re_dfa_t 27 lib/regcomp.c static reg_errcode_t init_dfa (re_dfa_t *dfa, size_t pat_len); re_dfa_t 32 lib/regcomp.c static reg_errcode_t create_initial_state (re_dfa_t *dfa); re_dfa_t 34 lib/regcomp.c static void optimize_utf8 (re_dfa_t *dfa); re_dfa_t 50 lib/regcomp.c static Idx duplicate_node (re_dfa_t *dfa, Idx org_idx, unsigned int constraint); re_dfa_t 51 lib/regcomp.c static Idx search_duplicated_node (const re_dfa_t *dfa, Idx org_node, re_dfa_t 53 lib/regcomp.c static reg_errcode_t calc_eclosure (re_dfa_t *dfa); re_dfa_t 54 lib/regcomp.c static reg_errcode_t calc_eclosure_iter (re_node_set *new_set, re_dfa_t *dfa, re_dfa_t 56 lib/regcomp.c static reg_errcode_t calc_inveclosure (re_dfa_t *dfa); re_dfa_t 76 lib/regcomp.c re_dfa_t *dfa, re_token_t *token, re_dfa_t 78 lib/regcomp.c static bin_tree_t *parse_bracket_exp (re_string_t *regexp, re_dfa_t *dfa, re_dfa_t 84 lib/regcomp.c re_dfa_t *dfa, re_dfa_t 109 lib/regcomp.c static bin_tree_t *build_charclass_op (re_dfa_t *dfa, re_dfa_t 114 lib/regcomp.c static bin_tree_t *create_tree (re_dfa_t *dfa, re_dfa_t 117 lib/regcomp.c static bin_tree_t *create_token_tree (re_dfa_t *dfa, re_dfa_t 120 lib/regcomp.c static bin_tree_t *duplicate_tree (const bin_tree_t *src, re_dfa_t *dfa); re_dfa_t 278 lib/regcomp.c re_dfa_t *dfa = (re_dfa_t *) bufp->buffer; re_dfa_t 312 lib/regcomp.c re_dfa_t *dfa = (re_dfa_t *) bufp->buffer; re_dfa_t 609 lib/regcomp.c free_dfa_content (re_dfa_t *dfa) re_dfa_t 662 lib/regcomp.c re_dfa_t *dfa = (re_dfa_t *) preg->buffer; re_dfa_t 756 lib/regcomp.c re_dfa_t *dfa; re_dfa_t 769 lib/regcomp.c dfa = (re_dfa_t *) preg->buffer; re_dfa_t 770 lib/regcomp.c if (BE (preg->allocated < sizeof (re_dfa_t), 0)) re_dfa_t 776 lib/regcomp.c dfa = re_realloc (preg->buffer, re_dfa_t, 1); re_dfa_t 779 lib/regcomp.c preg->allocated = sizeof (re_dfa_t); re_dfa_t 782 lib/regcomp.c preg->used = sizeof (re_dfa_t); re_dfa_t 851 lib/regcomp.c init_dfa (re_dfa_t *dfa, size_t pat_len) re_dfa_t 869 lib/regcomp.c memset (dfa, '\0', sizeof (re_dfa_t)); re_dfa_t 950 lib/regcomp.c init_word_char (re_dfa_t *dfa) re_dfa_t 965 lib/regcomp.c re_dfa_t *dfa = (re_dfa_t *) preg->buffer; re_dfa_t 982 lib/regcomp.c create_initial_state (re_dfa_t *dfa) re_dfa_t 1067 lib/regcomp.c optimize_utf8 (re_dfa_t *dfa) re_dfa_t 1149 lib/regcomp.c re_dfa_t *dfa = (re_dfa_t *) preg->buffer; re_dfa_t 1277 lib/regcomp.c re_dfa_t *dfa = (re_dfa_t *) extra; re_dfa_t 1330 lib/regcomp.c re_dfa_t *dfa = (re_dfa_t *) preg->buffer; re_dfa_t 1367 lib/regcomp.c re_dfa_t *dfa = (re_dfa_t *) extra; re_dfa_t 1412 lib/regcomp.c re_dfa_t *dfa = (re_dfa_t *) extra; re_dfa_t 1471 lib/regcomp.c duplicate_node_closure (re_dfa_t *dfa, Idx top_org_node, Idx top_clone_node, re_dfa_t 1578 lib/regcomp.c search_duplicated_node (const re_dfa_t *dfa, Idx org_node, re_dfa_t 1596 lib/regcomp.c duplicate_node (re_dfa_t *dfa, Idx org_idx, unsigned int constraint) re_dfa_t 1612 lib/regcomp.c calc_inveclosure (re_dfa_t *dfa) re_dfa_t 1636 lib/regcomp.c calc_eclosure (re_dfa_t *dfa) re_dfa_t 1681 lib/regcomp.c calc_eclosure_iter (re_node_set *new_set, re_dfa_t *dfa, Idx node, bool root) re_dfa_t 2111 lib/regcomp.c re_dfa_t *dfa = (re_dfa_t *) preg->buffer; re_dfa_t 2145 lib/regcomp.c re_dfa_t *dfa = (re_dfa_t *) preg->buffer; re_dfa_t 2187 lib/regcomp.c re_dfa_t *dfa = (re_dfa_t *) preg->buffer; re_dfa_t 2226 lib/regcomp.c re_dfa_t *dfa = (re_dfa_t *) preg->buffer; re_dfa_t 2442 lib/regcomp.c re_dfa_t *dfa = (re_dfa_t *) preg->buffer; re_dfa_t 2477 lib/regcomp.c parse_dup_op (bin_tree_t *elem, re_string_t *regexp, re_dfa_t *dfa, re_dfa_t 2776 lib/regcomp.c parse_bracket_exp (re_string_t *regexp, re_dfa_t *dfa, re_token_t *token, re_dfa_t 3337 lib/regcomp.c re_dfa_t *dfa _UNUSED_PARAMETER_, re_dfa_t 3603 lib/regcomp.c build_charclass_op (re_dfa_t *dfa, RE_TRANSLATE_TYPE trans, re_dfa_t 3758 lib/regcomp.c create_tree (re_dfa_t *dfa, bin_tree_t *left, bin_tree_t *right, re_dfa_t 3767 lib/regcomp.c create_token_tree (re_dfa_t *dfa, bin_tree_t *left, bin_tree_t *right, re_dfa_t 3844 lib/regcomp.c duplicate_tree (const bin_tree_t *root, re_dfa_t *dfa) re_dfa_t 27 lib/regex_internal.c const re_dfa_t *dfa) internal_function; re_dfa_t 28 lib/regex_internal.c static re_dfastate_t *create_ci_newstate (const re_dfa_t *dfa, re_dfa_t 31 lib/regex_internal.c static re_dfastate_t *create_cd_newstate (const re_dfa_t *dfa, re_dfa_t 44 lib/regex_internal.c RE_TRANSLATE_TYPE trans, bool icase, const re_dfa_t *dfa) re_dfa_t 72 lib/regex_internal.c RE_TRANSLATE_TYPE trans, bool icase, const re_dfa_t *dfa) re_dfa_t 176 lib/regex_internal.c const re_dfa_t *dfa) re_dfa_t 1414 lib/regex_internal.c re_dfa_add_node (re_dfa_t *dfa, re_token_t token) re_dfa_t 1485 lib/regex_internal.c re_acquire_state (reg_errcode_t *err, const re_dfa_t *dfa, re_dfa_t 1533 lib/regex_internal.c re_acquire_state_context (reg_errcode_t *err, const re_dfa_t *dfa, re_dfa_t 1574 lib/regex_internal.c register_state (const re_dfa_t *dfa, re_dfastate_t *newstate, re_dfa_t 1629 lib/regex_internal.c create_ci_newstate (const re_dfa_t *dfa, const re_node_set *nodes, re_dfa_t 1679 lib/regex_internal.c create_cd_newstate (const re_dfa_t *dfa, const re_node_set *nodes, re_dfa_t 416 lib/regex_internal.h struct re_dfa_t; re_dfa_t 417 lib/regex_internal.h typedef struct re_dfa_t re_dfa_t; re_dfa_t 607 lib/regex_internal.h const re_dfa_t *const dfa; re_dfa_t 609 lib/regex_internal.h const re_dfa_t *dfa; re_dfa_t 68 lib/regexec.c static void update_regs (const re_dfa_t *dfa, regmatch_t *pmatch, re_dfa_t 101 lib/regexec.c static reg_errcode_t add_epsilon_src_nodes (const re_dfa_t *dfa, re_dfa_t 117 lib/regexec.c static reg_errcode_t check_subexp_limits (const re_dfa_t *dfa, re_dfa_t 127 lib/regexec.c static reg_errcode_t merge_state_array (const re_dfa_t *dfa, re_dfa_t 165 lib/regexec.c static Idx find_subexp_node (const re_dfa_t *dfa, const re_node_set *nodes, re_dfa_t 176 lib/regexec.c static reg_errcode_t check_arrival_expand_ecl (const re_dfa_t *dfa, re_dfa_t 180 lib/regexec.c static reg_errcode_t check_arrival_expand_ecl_sub (const re_dfa_t *dfa, re_dfa_t 188 lib/regexec.c static bool build_trtable (const re_dfa_t *dfa, re_dfa_t 191 lib/regexec.c static int check_node_accept_bytes (const re_dfa_t *dfa, Idx node_idx, re_dfa_t 200 lib/regexec.c static Idx group_nodes_into_DFAstates (const re_dfa_t *dfa, re_dfa_t 237 lib/regexec.c re_dfa_t *dfa = (re_dfa_t *) preg->buffer; re_dfa_t 435 lib/regexec.c re_dfa_t *dfa = (re_dfa_t *) bufp->buffer; re_dfa_t 657 lib/regexec.c const re_dfa_t *dfa = (const re_dfa_t *) preg->buffer; re_dfa_t 987 lib/regexec.c const re_dfa_t *const dfa = mctx->dfa; re_dfa_t 1084 lib/regexec.c const re_dfa_t *const dfa = mctx->dfa; re_dfa_t 1126 lib/regexec.c const re_dfa_t *const dfa = mctx->dfa; re_dfa_t 1255 lib/regexec.c check_halt_node_context (const re_dfa_t *dfa, Idx node, unsigned int context) re_dfa_t 1300 lib/regexec.c const re_dfa_t *const dfa = mctx->dfa; re_dfa_t 1448 lib/regexec.c const re_dfa_t *dfa = (const re_dfa_t *) preg->buffer; re_dfa_t 1569 lib/regexec.c update_regs (const re_dfa_t *dfa, regmatch_t *pmatch, re_dfa_t 1702 lib/regexec.c const re_dfa_t *const dfa = mctx->dfa; re_dfa_t 1786 lib/regexec.c merge_state_array (const re_dfa_t *dfa, re_dfastate_t **dst, re_dfa_t 1817 lib/regexec.c const re_dfa_t *const dfa = mctx->dfa; re_dfa_t 1861 lib/regexec.c add_epsilon_src_nodes (const re_dfa_t *dfa, re_node_set *dest_nodes, re_dfa_t 1890 lib/regexec.c sub_epsilon_src_nodes (const re_dfa_t *dfa, Idx node, re_node_set *dest_nodes, re_dfa_t 1942 lib/regexec.c const re_dfa_t *const dfa = mctx->dfa; re_dfa_t 1978 lib/regexec.c const re_dfa_t *const dfa = mctx->dfa; re_dfa_t 2087 lib/regexec.c check_subexp_limits (const re_dfa_t *dfa, re_node_set *dest_nodes, re_dfa_t 2178 lib/regexec.c const re_dfa_t *const dfa = mctx->dfa; re_dfa_t 2278 lib/regexec.c const re_dfa_t *const dfa = mctx->dfa; re_dfa_t 2366 lib/regexec.c const re_dfa_t *const dfa = mctx->dfa; re_dfa_t 2476 lib/regexec.c const re_dfa_t *const dfa = mctx->dfa; re_dfa_t 2509 lib/regexec.c const re_dfa_t *const dfa = mctx->dfa; re_dfa_t 2548 lib/regexec.c const re_dfa_t *const dfa = mctx->dfa; re_dfa_t 2619 lib/regexec.c const re_dfa_t *const dfa = mctx->dfa; re_dfa_t 2733 lib/regexec.c const re_dfa_t *const dfa = mctx->dfa; re_dfa_t 2910 lib/regexec.c find_subexp_node (const re_dfa_t *dfa, const re_node_set *nodes, re_dfa_t 2935 lib/regexec.c const re_dfa_t *const dfa = mctx->dfa; re_dfa_t 3097 lib/regexec.c const re_dfa_t *const dfa = mctx->dfa; re_dfa_t 3175 lib/regexec.c check_arrival_expand_ecl (const re_dfa_t *dfa, re_node_set *cur_nodes, re_dfa_t 3228 lib/regexec.c check_arrival_expand_ecl_sub (const re_dfa_t *dfa, re_node_set *dst_nodes, re_dfa_t 3276 lib/regexec.c const re_dfa_t *const dfa = mctx->dfa; re_dfa_t 3362 lib/regexec.c build_trtable (const re_dfa_t *dfa, re_dfastate_t *state) re_dfa_t 3599 lib/regexec.c group_nodes_into_DFAstates (const re_dfa_t *dfa, const re_dfastate_t *state, re_dfa_t 3792 lib/regexec.c check_node_accept_bytes (const re_dfa_t *dfa, Idx node_idx,