re_dfa_t 28 compat/regex/regcomp.c static reg_errcode_t init_dfa (re_dfa_t *dfa, size_t pat_len); re_dfa_t 33 compat/regex/regcomp.c static reg_errcode_t create_initial_state (re_dfa_t *dfa); re_dfa_t 35 compat/regex/regcomp.c static void optimize_utf8 (re_dfa_t *dfa); re_dfa_t 51 compat/regex/regcomp.c static int duplicate_node (re_dfa_t *dfa, int org_idx, unsigned int constraint); re_dfa_t 52 compat/regex/regcomp.c static int search_duplicated_node (const re_dfa_t *dfa, int org_node, re_dfa_t 54 compat/regex/regcomp.c static reg_errcode_t calc_eclosure (re_dfa_t *dfa); re_dfa_t 55 compat/regex/regcomp.c static reg_errcode_t calc_eclosure_iter (re_node_set *new_set, re_dfa_t *dfa, re_dfa_t 57 compat/regex/regcomp.c static reg_errcode_t calc_inveclosure (re_dfa_t *dfa); re_dfa_t 77 compat/regex/regcomp.c re_dfa_t *dfa, re_token_t *token, re_dfa_t 79 compat/regex/regcomp.c static bin_tree_t *parse_bracket_exp (re_string_t *regexp, re_dfa_t *dfa, re_dfa_t 85 compat/regex/regcomp.c re_dfa_t *dfa, re_dfa_t 110 compat/regex/regcomp.c static bin_tree_t *build_charclass_op (re_dfa_t *dfa, re_dfa_t 115 compat/regex/regcomp.c static bin_tree_t *create_tree (re_dfa_t *dfa, re_dfa_t 118 compat/regex/regcomp.c static bin_tree_t *create_token_tree (re_dfa_t *dfa, re_dfa_t 121 compat/regex/regcomp.c static bin_tree_t *duplicate_tree (const bin_tree_t *src, re_dfa_t *dfa); re_dfa_t 289 compat/regex/regcomp.c re_dfa_t *dfa = (re_dfa_t *) bufp->buffer; re_dfa_t 323 compat/regex/regcomp.c volatile re_dfa_t *dfa = (re_dfa_t *) bufp->buffer; re_dfa_t 601 compat/regex/regcomp.c free_dfa_content (re_dfa_t *dfa) re_dfa_t 653 compat/regex/regcomp.c re_dfa_t *dfa = (re_dfa_t *) preg->buffer; re_dfa_t 747 compat/regex/regcomp.c re_dfa_t *dfa; re_dfa_t 760 compat/regex/regcomp.c dfa = (re_dfa_t *) preg->buffer; re_dfa_t 761 compat/regex/regcomp.c if (BE (preg->allocated < sizeof (re_dfa_t), 0)) re_dfa_t 767 compat/regex/regcomp.c dfa = re_realloc (preg->buffer, re_dfa_t, 1); re_dfa_t 770 compat/regex/regcomp.c preg->allocated = sizeof (re_dfa_t); re_dfa_t 773 compat/regex/regcomp.c preg->used = sizeof (re_dfa_t); re_dfa_t 842 compat/regex/regcomp.c init_dfa (re_dfa_t *dfa, size_t pat_len) re_dfa_t 849 compat/regex/regcomp.c memset (dfa, '\0', sizeof (re_dfa_t)); re_dfa_t 965 compat/regex/regcomp.c init_word_char (re_dfa_t *dfa) re_dfa_t 980 compat/regex/regcomp.c re_dfa_t *dfa = (re_dfa_t *) preg->buffer; re_dfa_t 997 compat/regex/regcomp.c create_initial_state (re_dfa_t *dfa) re_dfa_t 1083 compat/regex/regcomp.c optimize_utf8 (re_dfa_t *dfa) re_dfa_t 1155 compat/regex/regcomp.c re_dfa_t *dfa = (re_dfa_t *) preg->buffer; re_dfa_t 1283 compat/regex/regcomp.c re_dfa_t *dfa = (re_dfa_t *) extra; re_dfa_t 1336 compat/regex/regcomp.c re_dfa_t *dfa = (re_dfa_t *) preg->buffer; re_dfa_t 1373 compat/regex/regcomp.c re_dfa_t *dfa = (re_dfa_t *) extra; re_dfa_t 1418 compat/regex/regcomp.c re_dfa_t *dfa = (re_dfa_t *) extra; re_dfa_t 1477 compat/regex/regcomp.c duplicate_node_closure (re_dfa_t *dfa, int top_org_node, int top_clone_node, re_dfa_t 1583 compat/regex/regcomp.c search_duplicated_node (const re_dfa_t *dfa, int org_node, re_dfa_t 1601 compat/regex/regcomp.c duplicate_node (re_dfa_t *dfa, int org_idx, unsigned int constraint) re_dfa_t 1617 compat/regex/regcomp.c calc_inveclosure (re_dfa_t *dfa) re_dfa_t 1640 compat/regex/regcomp.c calc_eclosure (re_dfa_t *dfa) re_dfa_t 1684 compat/regex/regcomp.c calc_eclosure_iter (re_node_set *new_set, re_dfa_t *dfa, int node, int root) re_dfa_t 2114 compat/regex/regcomp.c re_dfa_t *dfa = (re_dfa_t *) preg->buffer; re_dfa_t 2148 compat/regex/regcomp.c re_dfa_t *dfa = (re_dfa_t *) preg->buffer; re_dfa_t 2190 compat/regex/regcomp.c re_dfa_t *dfa = (re_dfa_t *) preg->buffer; re_dfa_t 2229 compat/regex/regcomp.c re_dfa_t *dfa = (re_dfa_t *) preg->buffer; re_dfa_t 2445 compat/regex/regcomp.c re_dfa_t *dfa = (re_dfa_t *) preg->buffer; re_dfa_t 2480 compat/regex/regcomp.c parse_dup_op (bin_tree_t *elem, re_string_t *regexp, re_dfa_t *dfa, re_dfa_t 2782 compat/regex/regcomp.c parse_bracket_exp (re_string_t *regexp, re_dfa_t *dfa, re_token_t *token, re_dfa_t 3341 compat/regex/regcomp.c re_token_t *token, int token_len, re_dfa_t *dfa, re_dfa_t 3610 compat/regex/regcomp.c build_charclass_op (re_dfa_t *dfa, RE_TRANSLATE_TYPE trans, re_dfa_t 3763 compat/regex/regcomp.c create_tree (re_dfa_t *dfa, bin_tree_t *left, bin_tree_t *right, re_dfa_t 3772 compat/regex/regcomp.c create_token_tree (re_dfa_t *dfa, bin_tree_t *left, bin_tree_t *right, re_dfa_t 3849 compat/regex/regcomp.c duplicate_tree (const bin_tree_t *root, re_dfa_t *dfa) re_dfa_t 24 compat/regex/regex_internal.c const re_dfa_t *dfa) internal_function; re_dfa_t 25 compat/regex/regex_internal.c static re_dfastate_t *create_ci_newstate (const re_dfa_t *dfa, re_dfa_t 28 compat/regex/regex_internal.c static re_dfastate_t *create_cd_newstate (const re_dfa_t *dfa, re_dfa_t 50 compat/regex/regex_internal.c RE_TRANSLATE_TYPE trans, int icase, const re_dfa_t *dfa) re_dfa_t 78 compat/regex/regex_internal.c RE_TRANSLATE_TYPE trans, int icase, const re_dfa_t *dfa) re_dfa_t 182 compat/regex/regex_internal.c const re_dfa_t *dfa) re_dfa_t 1423 compat/regex/regex_internal.c re_dfa_add_node (re_dfa_t *dfa, re_token_t token) re_dfa_t 1490 compat/regex/regex_internal.c re_acquire_state (reg_errcode_t *err, const re_dfa_t *dfa, re_dfa_t 1534 compat/regex/regex_internal.c re_acquire_state_context (reg_errcode_t *err, const re_dfa_t *dfa, re_dfa_t 1570 compat/regex/regex_internal.c register_state (const re_dfa_t *dfa, re_dfastate_t *newstate, re_dfa_t 1625 compat/regex/regex_internal.c create_ci_newstate (const re_dfa_t *dfa, const re_node_set *nodes, re_dfa_t 1675 compat/regex/regex_internal.c create_cd_newstate (const re_dfa_t *dfa, const re_node_set *nodes, re_dfa_t 412 compat/regex/regex_internal.h struct re_dfa_t; re_dfa_t 413 compat/regex/regex_internal.h typedef struct re_dfa_t re_dfa_t; re_dfa_t 608 compat/regex/regex_internal.h const re_dfa_t *const dfa; re_dfa_t 610 compat/regex/regex_internal.h const re_dfa_t *dfa; re_dfa_t 61 compat/regex/regexec.c static void update_regs (const re_dfa_t *dfa, regmatch_t *pmatch, re_dfa_t 94 compat/regex/regexec.c static reg_errcode_t add_epsilon_src_nodes (const re_dfa_t *dfa, re_dfa_t 110 compat/regex/regexec.c static reg_errcode_t check_subexp_limits (const re_dfa_t *dfa, re_dfa_t 120 compat/regex/regexec.c static reg_errcode_t merge_state_array (const re_dfa_t *dfa, re_dfa_t 158 compat/regex/regexec.c static int find_subexp_node (const re_dfa_t *dfa, const re_node_set *nodes, re_dfa_t 169 compat/regex/regexec.c static reg_errcode_t check_arrival_expand_ecl (const re_dfa_t *dfa, re_dfa_t 173 compat/regex/regexec.c static reg_errcode_t check_arrival_expand_ecl_sub (const re_dfa_t *dfa, re_dfa_t 181 compat/regex/regexec.c static int build_trtable (const re_dfa_t *dfa, re_dfa_t 184 compat/regex/regexec.c static int check_node_accept_bytes (const re_dfa_t *dfa, int node_idx, re_dfa_t 193 compat/regex/regexec.c static int group_nodes_into_DFAstates (const re_dfa_t *dfa, re_dfa_t 624 compat/regex/regexec.c const re_dfa_t *dfa = (const re_dfa_t *) preg->buffer; re_dfa_t 943 compat/regex/regexec.c const re_dfa_t *const dfa = mctx->dfa; re_dfa_t 1040 compat/regex/regexec.c const re_dfa_t *const dfa = mctx->dfa; re_dfa_t 1082 compat/regex/regexec.c const re_dfa_t *const dfa = mctx->dfa; re_dfa_t 1211 compat/regex/regexec.c check_halt_node_context (const re_dfa_t *dfa, int node, unsigned int context) re_dfa_t 1256 compat/regex/regexec.c const re_dfa_t *const dfa = mctx->dfa; re_dfa_t 1402 compat/regex/regexec.c const re_dfa_t *dfa = (const re_dfa_t *) preg->buffer; re_dfa_t 1525 compat/regex/regexec.c update_regs (const re_dfa_t *dfa, regmatch_t *pmatch, re_dfa_t 1658 compat/regex/regexec.c const re_dfa_t *const dfa = mctx->dfa; re_dfa_t 1742 compat/regex/regexec.c merge_state_array (const re_dfa_t *dfa, re_dfastate_t **dst, re_dfa_t 1773 compat/regex/regexec.c const re_dfa_t *const dfa = mctx->dfa; re_dfa_t 1817 compat/regex/regexec.c add_epsilon_src_nodes (const re_dfa_t *dfa, re_node_set *dest_nodes, re_dfa_t 1846 compat/regex/regexec.c sub_epsilon_src_nodes (const re_dfa_t *dfa, int node, re_node_set *dest_nodes, re_dfa_t 1898 compat/regex/regexec.c const re_dfa_t *const dfa = mctx->dfa; re_dfa_t 1934 compat/regex/regexec.c const re_dfa_t *const dfa = mctx->dfa; re_dfa_t 2042 compat/regex/regexec.c check_subexp_limits (const re_dfa_t *dfa, re_node_set *dest_nodes, re_dfa_t 2133 compat/regex/regexec.c const re_dfa_t *const dfa = mctx->dfa; re_dfa_t 2233 compat/regex/regexec.c const re_dfa_t *const dfa = mctx->dfa; re_dfa_t 2321 compat/regex/regexec.c const re_dfa_t *const dfa = mctx->dfa; re_dfa_t 2431 compat/regex/regexec.c const re_dfa_t *const dfa = mctx->dfa; re_dfa_t 2464 compat/regex/regexec.c const re_dfa_t *const dfa = mctx->dfa; re_dfa_t 2503 compat/regex/regexec.c const re_dfa_t *const dfa = mctx->dfa; re_dfa_t 2573 compat/regex/regexec.c const re_dfa_t *const dfa = mctx->dfa; re_dfa_t 2687 compat/regex/regexec.c const re_dfa_t *const dfa = mctx->dfa; re_dfa_t 2863 compat/regex/regexec.c find_subexp_node (const re_dfa_t *dfa, const re_node_set *nodes, re_dfa_t 2888 compat/regex/regexec.c const re_dfa_t *const dfa = mctx->dfa; re_dfa_t 3049 compat/regex/regexec.c const re_dfa_t *const dfa = mctx->dfa; re_dfa_t 3127 compat/regex/regexec.c check_arrival_expand_ecl (const re_dfa_t *dfa, re_node_set *cur_nodes, re_dfa_t 3180 compat/regex/regexec.c check_arrival_expand_ecl_sub (const re_dfa_t *dfa, re_node_set *dst_nodes, re_dfa_t 3227 compat/regex/regexec.c const re_dfa_t *const dfa = mctx->dfa; re_dfa_t 3313 compat/regex/regexec.c build_trtable (const re_dfa_t *dfa, re_dfastate_t *state) re_dfa_t 3551 compat/regex/regexec.c group_nodes_into_DFAstates (const re_dfa_t *dfa, const re_dfastate_t *state, re_dfa_t 3741 compat/regex/regexec.c check_node_accept_bytes (const re_dfa_t *dfa, int node_idx,