Lines Matching refs:err
45 static bin_tree_t *lower_subexp (reg_errcode_t *err, regex_t *preg,
62 reg_syntax_t syntax, reg_errcode_t *err);
65 int nest, reg_errcode_t *err);
68 int nest, reg_errcode_t *err);
71 int nest, reg_errcode_t *err);
74 int nest, reg_errcode_t *err);
77 reg_syntax_t syntax, reg_errcode_t *err);
80 reg_errcode_t *err);
113 int non_match, reg_errcode_t *err);
739 reg_errcode_t err = REG_NOERROR;
768 err = init_dfa (dfa, length);
769 if (BE (err != REG_NOERROR, 0))
774 return err;
784 err = re_string_construct (®exp, pattern, length, preg->translate,
786 if (BE (err != REG_NOERROR, 0))
794 return err;
799 dfa->str_tree = parse (®exp, preg, syntax, &err);
804 err = analyze (preg);
805 if (BE (err != REG_NOERROR, 0))
815 err = create_initial_state (dfa);
821 if (BE (err != REG_NOERROR, 0))
828 return err;
968 reg_errcode_t err;
975 err = re_node_set_init_copy (&init_nodes, dfa->eclosures + first);
976 if (BE (err != REG_NOERROR, 0))
977 return err;
1015 dfa->init_state = re_acquire_state_context (&err, dfa, &init_nodes, 0);
1018 return err;
1021 dfa->init_state_word = re_acquire_state_context (&err, dfa, &init_nodes,
1023 dfa->init_state_nl = re_acquire_state_context (&err, dfa, &init_nodes,
1025 dfa->init_state_begbuf = re_acquire_state_context (&err, dfa,
1031 return err;
1199 reg_errcode_t err = fn (extra, node);
1200 if (BE (err != REG_NOERROR, 0))
1201 return err;
1221 reg_errcode_t err = fn (extra, node);
1222 if (BE (err != REG_NOERROR, 0))
1223 return err;
1281 reg_errcode_t err = REG_NOERROR;
1285 node->left = lower_subexp (&err, preg, node->left);
1291 node->right = lower_subexp (&err, preg, node->right);
1296 return err;
1300 lower_subexp (reg_errcode_t *err, regex_t *preg, bin_tree_t *node)
1325 *err = REG_ESPACE;
1386 reg_errcode_t err = REG_NOERROR;
1412 err = re_node_set_init_2 (dfa->edests + idx, left, right);
1419 err = re_node_set_init_1 (dfa->edests + idx, node->next->node_idx);
1434 return err;
1510 reg_errcode_t err;
1517 err = duplicate_node_closure (dfa, org_dest, clone_dest,
1519 if (BE (err != REG_NOERROR, 0))
1520 return err;
1616 reg_errcode_t err;
1634 err = calc_eclosure_iter (&eclosure_elem, dfa, node_idx, 1);
1635 if (BE (err != REG_NOERROR, 0))
1636 return err;
1652 reg_errcode_t err;
1656 err = re_node_set_alloc (&eclosure, dfa->edests[node].nelem + 1);
1657 if (BE (err != REG_NOERROR, 0))
1658 return err;
1670 err = duplicate_node_closure (dfa, node, node, node,
1672 if (BE (err != REG_NOERROR, 0))
1673 return err;
1693 err = calc_eclosure_iter (&eclosure_elem, dfa, edest, 0);
1694 if (BE (err != REG_NOERROR, 0))
1695 return err;
2075 reg_errcode_t *err)
2082 tree = parse_reg_exp (regexp, preg, ¤t_token, syntax, 0, err);
2083 if (BE (*err != REG_NOERROR && tree == NULL, 0))
2092 *err = REG_ESPACE;
2109 reg_syntax_t syntax, int nest, reg_errcode_t *err)
2113 tree = parse_branch (regexp, preg, token, syntax, nest, err);
2114 if (BE (*err != REG_NOERROR && tree == NULL, 0))
2123 branch = parse_branch (regexp, preg, token, syntax, nest, err);
2124 if (BE (*err != REG_NOERROR && branch == NULL, 0))
2132 *err = REG_ESPACE;
2150 reg_syntax_t syntax, int nest, reg_errcode_t *err)
2154 tree = parse_expression (regexp, preg, token, syntax, nest, err);
2155 if (BE (*err != REG_NOERROR && tree == NULL, 0))
2161 exp = parse_expression (regexp, preg, token, syntax, nest, err);
2162 if (BE (*err != REG_NOERROR && exp == NULL, 0))
2171 *err = REG_ESPACE;
2190 reg_syntax_t syntax, int nest, reg_errcode_t *err)
2200 *err = REG_ESPACE;
2215 *err = REG_ESPACE;
2223 tree = parse_sub_exp (regexp, preg, token, syntax, nest + 1, err);
2224 if (BE (*err != REG_NOERROR && tree == NULL, 0))
2228 tree = parse_bracket_exp (regexp, dfa, token, syntax, err);
2229 if (BE (*err != REG_NOERROR && tree == NULL, 0))
2235 *err = REG_ESUBREG;
2242 *err = REG_ESPACE;
2251 *err = REG_BADRPT;
2260 *err = REG_BADRPT;
2266 return parse_expression (regexp, preg, token, syntax, nest, err);
2273 *err = REG_ERPAREN;
2287 *err = REG_ESPACE;
2316 *err = REG_ESPACE;
2325 *err = REG_ESPACE;
2339 *err = REG_ESPACE;
2350 token->type == OP_NOTWORD, err);
2351 if (BE (*err != REG_NOERROR && tree == NULL, 0))
2359 token->type == OP_NOTSPACE, err);
2360 if (BE (*err != REG_NOERROR && tree == NULL, 0))
2367 *err = REG_EESCAPE;
2381 tree = parse_dup_op (tree, regexp, dfa, token, syntax, err);
2382 if (BE (*err != REG_NOERROR && tree == NULL, 0))
2389 *err = REG_BADRPT;
2406 reg_syntax_t syntax, int nest, reg_errcode_t *err)
2420 tree = parse_reg_exp (regexp, preg, token, syntax, nest, err);
2421 if (BE (*err == REG_NOERROR && token->type != OP_CLOSE_SUBEXP, 0))
2422 *err = REG_EPAREN;
2423 if (BE (*err != REG_NOERROR, 0))
2433 *err = REG_ESPACE;
2444 re_token_t *token, reg_syntax_t syntax, reg_errcode_t *err)
2460 *err = REG_BADBR; /* <re>{} is invalid. */
2477 *err = REG_EBRACE;
2479 *err = REG_BADBR;
2496 *err = REG_BADBR;
2566 *err = REG_ESPACE;
2728 reg_syntax_t syntax, reg_errcode_t *err)
3032 *err = REG_ESPACE;
3039 *err = REG_BADPAT;
3054 *err = REG_BADPAT;
3077 *err = ret;
3090 *err = REG_EBRACK;
3099 *err = REG_EBRACK;
3120 *err = ret;
3127 *err = build_range_exp (sbcset, mbcset, &range_alloc,
3131 *err = build_range_exp (sbcset,
3135 *err = build_range_exp (sbcset, &start_elem, &end_elem);
3138 if (BE (*err != REG_NOERROR, 0))
3168 *err = build_equiv_class (sbcset,
3173 if (BE (*err != REG_NOERROR, 0))
3177 *err = build_collating_symbol (sbcset,
3182 if (BE (*err != REG_NOERROR, 0))
3186 *err = build_charclass (regexp->trans, sbcset,
3191 if (BE (*err != REG_NOERROR, 0))
3201 *err = REG_EBRACK;
3273 *err = REG_ESPACE;
3554 reg_errcode_t *err)
3576 *err = REG_ESPACE;
3600 *err = ret;
3654 *err = REG_ESPACE;