HomeSort by relevance Sort by last modified time
    Searched defs:dfa (Results 1 - 3 of 3) sorted by null

  /ndk/sources/host-tools/sed-4.2.1/lib/
regcomp.c 28 static reg_errcode_t init_dfa (re_dfa_t *dfa, size_t pat_len);
33 static reg_errcode_t create_initial_state (re_dfa_t *dfa);
35 static void optimize_utf8 (re_dfa_t *dfa);
51 static Idx duplicate_node (re_dfa_t *dfa, Idx org_idx, unsigned int constraint);
52 static Idx search_duplicated_node (const re_dfa_t *dfa, Idx org_node,
54 static reg_errcode_t calc_eclosure (re_dfa_t *dfa);
55 static reg_errcode_t calc_eclosure_iter (re_node_set *new_set, re_dfa_t *dfa,
57 static reg_errcode_t calc_inveclosure (re_dfa_t *dfa);
77 re_dfa_t *dfa, re_token_t *token,
79 static bin_tree_t *parse_bracket_exp (re_string_t *regexp, re_dfa_t *dfa,
279 re_dfa_t *dfa = (re_dfa_t *) bufp->buffer; local
313 re_dfa_t *dfa = (re_dfa_t *) bufp->buffer; local
663 re_dfa_t *dfa = (re_dfa_t *) preg->buffer; local
757 re_dfa_t *dfa; local
961 re_dfa_t *dfa = (re_dfa_t *) preg->buffer; local
1142 re_dfa_t *dfa = (re_dfa_t *) preg->buffer; local
1270 re_dfa_t *dfa = (re_dfa_t *) extra; local
1323 re_dfa_t *dfa = (re_dfa_t *) preg->buffer; local
1360 re_dfa_t *dfa = (re_dfa_t *) extra; local
1405 re_dfa_t *dfa = (re_dfa_t *) extra; local
2104 re_dfa_t *dfa = (re_dfa_t *) preg->buffer; local
2138 re_dfa_t *dfa = (re_dfa_t *) preg->buffer; local
2180 re_dfa_t *dfa = (re_dfa_t *) preg->buffer; local
2219 re_dfa_t *dfa = (re_dfa_t *) preg->buffer; local
2435 re_dfa_t *dfa = (re_dfa_t *) preg->buffer; local
    [all...]
regex_internal.h 494 /* `node_idx' is the index in dfa->nodes, if `type' == 0.
613 const re_dfa_t *const dfa; member in struct:__anon17016
615 const re_dfa_t *dfa; member in struct:__anon17016
682 Idx nbackref; /* The number of backreference in this dfa. */
689 /* If this dfa has "multibyte node", which is a backreference or
regexec.c 67 static void update_regs (const re_dfa_t *dfa, regmatch_t *pmatch,
100 static reg_errcode_t add_epsilon_src_nodes (const re_dfa_t *dfa,
116 static reg_errcode_t check_subexp_limits (const re_dfa_t *dfa,
126 static reg_errcode_t merge_state_array (const re_dfa_t *dfa,
164 static Idx find_subexp_node (const re_dfa_t *dfa, const re_node_set *nodes,
175 static reg_errcode_t check_arrival_expand_ecl (const re_dfa_t *dfa,
179 static reg_errcode_t check_arrival_expand_ecl_sub (const re_dfa_t *dfa,
187 static bool build_trtable (const re_dfa_t *dfa,
190 static int check_node_accept_bytes (const re_dfa_t *dfa, Idx node_idx,
199 static Idx group_nodes_into_DFAstates (const re_dfa_t *dfa,
236 re_dfa_t *dfa = (re_dfa_t *) preg->buffer; local
431 re_dfa_t *dfa = (re_dfa_t *) bufp->buffer; local
650 const re_dfa_t *dfa = (const re_dfa_t *) preg->buffer; local
980 const re_dfa_t *const dfa = mctx->dfa; local
1077 const re_dfa_t *const dfa = mctx->dfa; local
1119 const re_dfa_t *const dfa = mctx->dfa; local
1293 const re_dfa_t *const dfa = mctx->dfa; local
1441 const re_dfa_t *dfa = (const re_dfa_t *) preg->buffer; local
1695 const re_dfa_t *const dfa = mctx->dfa; local
1810 const re_dfa_t *const dfa = mctx->dfa; local
1931 const re_dfa_t *const dfa = mctx->dfa; local
1967 const re_dfa_t *const dfa = mctx->dfa; local
2167 const re_dfa_t *const dfa = mctx->dfa; local
2267 const re_dfa_t *const dfa = mctx->dfa; local
2355 const re_dfa_t *const dfa = mctx->dfa; local
2465 const re_dfa_t *const dfa = mctx->dfa; local
2537 const re_dfa_t *const dfa = mctx->dfa; local
2608 const re_dfa_t *const dfa = mctx->dfa; local
2722 const re_dfa_t *const dfa = mctx->dfa; local
2924 const re_dfa_t *const dfa = mctx->dfa; local
3086 const re_dfa_t *const dfa = mctx->dfa; local
3265 const re_dfa_t *const dfa = mctx->dfa; local
    [all...]

Completed in 4389 milliseconds