re_dfa_t 29 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 33 lib/regcomp.c static void optimize_utf8 (re_dfa_t *dfa); re_dfa_t 48 lib/regcomp.c static Idx duplicate_node (re_dfa_t *dfa, Idx org_idx, unsigned int constraint); re_dfa_t 49 lib/regcomp.c static Idx search_duplicated_node (const re_dfa_t *dfa, Idx org_node, re_dfa_t 51 lib/regcomp.c static reg_errcode_t calc_eclosure (re_dfa_t *dfa); re_dfa_t 52 lib/regcomp.c static reg_errcode_t calc_eclosure_iter (re_node_set *new_set, re_dfa_t *dfa, re_dfa_t 54 lib/regcomp.c static reg_errcode_t calc_inveclosure (re_dfa_t *dfa); re_dfa_t 74 lib/regcomp.c re_dfa_t *dfa, re_token_t *token, re_dfa_t 76 lib/regcomp.c static bin_tree_t *parse_bracket_exp (re_string_t *regexp, re_dfa_t *dfa, re_dfa_t 82 lib/regcomp.c re_dfa_t *dfa, re_dfa_t 98 lib/regcomp.c static bin_tree_t *build_charclass_op (re_dfa_t *dfa, re_dfa_t 103 lib/regcomp.c static bin_tree_t *create_tree (re_dfa_t *dfa, re_dfa_t 106 lib/regcomp.c static bin_tree_t *create_token_tree (re_dfa_t *dfa, re_dfa_t 109 lib/regcomp.c static bin_tree_t *duplicate_tree (const bin_tree_t *src, re_dfa_t *dfa); re_dfa_t 253 lib/regcomp.c re_dfa_t *dfa = bufp->buffer; re_dfa_t 284 lib/regcomp.c re_dfa_t *dfa = bufp->buffer; re_dfa_t 559 lib/regcomp.c free_dfa_content (re_dfa_t *dfa) re_dfa_t 609 lib/regcomp.c re_dfa_t *dfa = preg->buffer; re_dfa_t 704 lib/regcomp.c re_dfa_t *dfa; re_dfa_t 718 lib/regcomp.c if (__glibc_unlikely (preg->allocated < sizeof (re_dfa_t))) re_dfa_t 724 lib/regcomp.c dfa = re_realloc (preg->buffer, re_dfa_t, 1); re_dfa_t 727 lib/regcomp.c preg->allocated = sizeof (re_dfa_t); re_dfa_t 730 lib/regcomp.c preg->used = sizeof (re_dfa_t); re_dfa_t 799 lib/regcomp.c init_dfa (re_dfa_t *dfa, size_t pat_len) re_dfa_t 813 lib/regcomp.c memset (dfa, '\0', sizeof (re_dfa_t)); re_dfa_t 894 lib/regcomp.c init_word_char (re_dfa_t *dfa) re_dfa_t 944 lib/regcomp.c re_dfa_t *dfa = preg->buffer; re_dfa_t 961 lib/regcomp.c create_initial_state (re_dfa_t *dfa) re_dfa_t 1046 lib/regcomp.c optimize_utf8 (re_dfa_t *dfa) re_dfa_t 1127 lib/regcomp.c re_dfa_t *dfa = preg->buffer; re_dfa_t 1255 lib/regcomp.c re_dfa_t *dfa = (re_dfa_t *) extra; re_dfa_t 1308 lib/regcomp.c re_dfa_t *dfa = preg->buffer; re_dfa_t 1346 lib/regcomp.c re_dfa_t *dfa = (re_dfa_t *) extra; re_dfa_t 1391 lib/regcomp.c re_dfa_t *dfa = (re_dfa_t *) extra; re_dfa_t 1449 lib/regcomp.c duplicate_node_closure (re_dfa_t *dfa, Idx top_org_node, Idx top_clone_node, re_dfa_t 1556 lib/regcomp.c search_duplicated_node (const re_dfa_t *dfa, Idx org_node, re_dfa_t 1574 lib/regcomp.c duplicate_node (re_dfa_t *dfa, Idx org_idx, unsigned int constraint) re_dfa_t 1590 lib/regcomp.c calc_inveclosure (re_dfa_t *dfa) re_dfa_t 1614 lib/regcomp.c calc_eclosure (re_dfa_t *dfa) re_dfa_t 1655 lib/regcomp.c calc_eclosure_iter (re_node_set *new_set, re_dfa_t *dfa, Idx node, bool root) re_dfa_t 2084 lib/regcomp.c re_dfa_t *dfa = preg->buffer; re_dfa_t 2118 lib/regcomp.c re_dfa_t *dfa = preg->buffer; re_dfa_t 2168 lib/regcomp.c re_dfa_t *dfa = preg->buffer; re_dfa_t 2212 lib/regcomp.c re_dfa_t *dfa = preg->buffer; re_dfa_t 2444 lib/regcomp.c re_dfa_t *dfa = preg->buffer; re_dfa_t 2484 lib/regcomp.c parse_dup_op (bin_tree_t *elem, re_string_t *regexp, re_dfa_t *dfa, re_dfa_t 2635 lib/regcomp.c parse_byte (unsigned char b, re_dfa_t const *dfa) re_dfa_t 2650 lib/regcomp.c re_dfa_t *dfa, reg_syntax_t syntax, uint_fast32_t nrules, re_dfa_t 2873 lib/regcomp.c re_dfa_t *dfa, reg_syntax_t syntax, uint32_t nrules, re_dfa_t 3023 lib/regcomp.c parse_bracket_exp (re_string_t *regexp, re_dfa_t *dfa, re_token_t *token, re_dfa_t 3299 lib/regcomp.c re_token_t *token, int token_len, re_dfa_t *dfa, re_dfa_t 3540 lib/regcomp.c build_charclass_op (re_dfa_t *dfa, RE_TRANSLATE_TYPE trans, re_dfa_t 3669 lib/regcomp.c create_tree (re_dfa_t *dfa, bin_tree_t *left, bin_tree_t *right, re_dfa_t 3677 lib/regcomp.c create_token_tree (re_dfa_t *dfa, bin_tree_t *left, bin_tree_t *right, re_dfa_t 3751 lib/regcomp.c duplicate_tree (const bin_tree_t *root, re_dfa_t *dfa) re_dfa_t 417 lib/regex.h struct re_dfa_t *__REPB_PREFIX(buffer); re_dfa_t 23 lib/regex_internal.c const re_dfa_t *dfa); re_dfa_t 24 lib/regex_internal.c static re_dfastate_t *create_ci_newstate (const re_dfa_t *dfa, re_dfa_t 27 lib/regex_internal.c static re_dfastate_t *create_cd_newstate (const re_dfa_t *dfa, re_dfa_t 48 lib/regex_internal.c RE_TRANSLATE_TYPE trans, bool icase, const re_dfa_t *dfa) re_dfa_t 76 lib/regex_internal.c RE_TRANSLATE_TYPE trans, bool icase, const re_dfa_t *dfa) re_dfa_t 174 lib/regex_internal.c const re_dfa_t *dfa) re_dfa_t 1378 lib/regex_internal.c re_dfa_add_node (re_dfa_t *dfa, re_token_t token) re_dfa_t 1448 lib/regex_internal.c re_acquire_state (reg_errcode_t *err, const re_dfa_t *dfa, re_dfa_t 1496 lib/regex_internal.c re_acquire_state_context (reg_errcode_t *err, const re_dfa_t *dfa, re_dfa_t 1537 lib/regex_internal.c register_state (const re_dfa_t *dfa, re_dfastate_t *newstate, re_dfa_t 1592 lib/regex_internal.c create_ci_newstate (const re_dfa_t *dfa, const re_node_set *nodes, re_dfa_t 1640 lib/regex_internal.c create_cd_newstate (const re_dfa_t *dfa, const re_node_set *nodes, re_dfa_t 415 lib/regex_internal.h struct re_dfa_t; re_dfa_t 416 lib/regex_internal.h typedef struct re_dfa_t re_dfa_t; re_dfa_t 583 lib/regex_internal.h const re_dfa_t *const dfa; re_dfa_t 57 lib/regexec.c static void update_regs (const re_dfa_t *dfa, regmatch_t *pmatch, re_dfa_t 82 lib/regexec.c static reg_errcode_t add_epsilon_src_nodes (const re_dfa_t *dfa, re_dfa_t 96 lib/regexec.c static reg_errcode_t check_subexp_limits (const re_dfa_t *dfa, re_dfa_t 105 lib/regexec.c static reg_errcode_t merge_state_array (const re_dfa_t *dfa, re_dfa_t 134 lib/regexec.c static Idx find_subexp_node (const re_dfa_t *dfa, const re_node_set *nodes, re_dfa_t 144 lib/regexec.c static reg_errcode_t check_arrival_expand_ecl (const re_dfa_t *dfa, re_dfa_t 147 lib/regexec.c static reg_errcode_t check_arrival_expand_ecl_sub (const re_dfa_t *dfa, re_dfa_t 154 lib/regexec.c static bool build_trtable (const re_dfa_t *dfa, re_dfastate_t *state); re_dfa_t 155 lib/regexec.c static int check_node_accept_bytes (const re_dfa_t *dfa, Idx node_idx, re_dfa_t 161 lib/regexec.c static Idx group_nodes_into_DFAstates (const re_dfa_t *dfa, re_dfa_t 192 lib/regexec.c re_dfa_t *dfa = preg->buffer; re_dfa_t 372 lib/regexec.c re_dfa_t *dfa = bufp->buffer; re_dfa_t 585 lib/regexec.c const re_dfa_t *dfa = preg->buffer; re_dfa_t 896 lib/regexec.c const re_dfa_t *const dfa = mctx->dfa; re_dfa_t 991 lib/regexec.c const re_dfa_t *const dfa = mctx->dfa; re_dfa_t 1033 lib/regexec.c const re_dfa_t *const dfa = mctx->dfa; re_dfa_t 1162 lib/regexec.c check_halt_node_context (const re_dfa_t *dfa, Idx node, unsigned int context) re_dfa_t 1204 lib/regexec.c const re_dfa_t *const dfa = mctx->dfa; re_dfa_t 1368 lib/regexec.c const re_dfa_t *dfa = preg->buffer; re_dfa_t 1474 lib/regexec.c update_regs (const re_dfa_t *dfa, regmatch_t *pmatch, re_dfa_t 1604 lib/regexec.c const re_dfa_t *const dfa = mctx->dfa; re_dfa_t 1683 lib/regexec.c merge_state_array (const re_dfa_t *dfa, re_dfastate_t **dst, re_dfa_t 1713 lib/regexec.c const re_dfa_t *const dfa = mctx->dfa; re_dfa_t 1757 lib/regexec.c add_epsilon_src_nodes (const re_dfa_t *dfa, re_node_set *dest_nodes, re_dfa_t 1785 lib/regexec.c sub_epsilon_src_nodes (const re_dfa_t *dfa, Idx node, re_node_set *dest_nodes, re_dfa_t 1836 lib/regexec.c const re_dfa_t *const dfa = mctx->dfa; re_dfa_t 1871 lib/regexec.c const re_dfa_t *const dfa = mctx->dfa; re_dfa_t 1978 lib/regexec.c check_subexp_limits (const re_dfa_t *dfa, re_node_set *dest_nodes, re_dfa_t 2069 lib/regexec.c const re_dfa_t *const dfa = mctx->dfa; re_dfa_t 2167 lib/regexec.c const re_dfa_t *const dfa = mctx->dfa; re_dfa_t 2251 lib/regexec.c const re_dfa_t *const dfa = mctx->dfa; re_dfa_t 2359 lib/regexec.c const re_dfa_t *const dfa = mctx->dfa; re_dfa_t 2392 lib/regexec.c const re_dfa_t *const dfa = mctx->dfa; re_dfa_t 2429 lib/regexec.c const re_dfa_t *const dfa = mctx->dfa; re_dfa_t 2497 lib/regexec.c const re_dfa_t *const dfa = mctx->dfa; re_dfa_t 2609 lib/regexec.c const re_dfa_t *const dfa = mctx->dfa; re_dfa_t 2788 lib/regexec.c find_subexp_node (const re_dfa_t *dfa, const re_node_set *nodes, re_dfa_t 2814 lib/regexec.c const re_dfa_t *const dfa = mctx->dfa; re_dfa_t 2979 lib/regexec.c const re_dfa_t *const dfa = mctx->dfa; re_dfa_t 3051 lib/regexec.c check_arrival_expand_ecl (const re_dfa_t *dfa, re_node_set *cur_nodes, re_dfa_t 3102 lib/regexec.c check_arrival_expand_ecl_sub (const re_dfa_t *dfa, re_node_set *dst_nodes, re_dfa_t 3150 lib/regexec.c const re_dfa_t *const dfa = mctx->dfa; re_dfa_t 3235 lib/regexec.c build_trtable (const re_dfa_t *dfa, re_dfastate_t *state) re_dfa_t 3424 lib/regexec.c group_nodes_into_DFAstates (const re_dfa_t *dfa, const re_dfastate_t *state, re_dfa_t 3612 lib/regexec.c check_node_accept_bytes (const re_dfa_t *dfa, Idx node_idx,