Searched refs:dfa (Results 1 - 4 of 4) sorted by relevance

/haiku/src/system/libroot/posix/glibc/regex/
H A Dregcomp.c27 static reg_errcode_t init_dfa (re_dfa_t *dfa, size_t pat_len);
32 static reg_errcode_t create_initial_state (re_dfa_t *dfa);
34 static void optimize_utf8 (re_dfa_t *dfa);
50 static int duplicate_node (re_dfa_t *dfa, int org_idx, unsigned int constraint);
51 static int search_duplicated_node (const re_dfa_t *dfa, int org_node,
53 static reg_errcode_t calc_eclosure (re_dfa_t *dfa);
54 static reg_errcode_t calc_eclosure_iter (re_node_set *new_set, re_dfa_t *dfa,
56 static reg_errcode_t calc_inveclosure (re_dfa_t *dfa);
76 re_dfa_t *dfa, re_token_t *token,
78 static bin_tree_t *parse_bracket_exp (re_string_t *regexp, re_dfa_t *dfa,
272 re_dfa_t *dfa = (re_dfa_t *) bufp->buffer; local
306 re_dfa_t *dfa = (re_dfa_t *) bufp->buffer; local
588 free_dfa_content(re_dfa_t *dfa) argument
641 re_dfa_t *dfa = (re_dfa_t *) preg->buffer; local
735 re_dfa_t *dfa; local
830 init_dfa(re_dfa_t *dfa, size_t pat_len) argument
928 init_word_char(re_dfa_t *dfa) argument
943 re_dfa_t *dfa = (re_dfa_t *) preg->buffer; local
960 create_initial_state(re_dfa_t *dfa) argument
1042 optimize_utf8(re_dfa_t *dfa) argument
1114 re_dfa_t *dfa = (re_dfa_t *) preg->buffer; local
1242 re_dfa_t *dfa = (re_dfa_t *) extra; local
1295 re_dfa_t *dfa = (re_dfa_t *) preg->buffer; local
1332 re_dfa_t *dfa = (re_dfa_t *) extra; local
1377 re_dfa_t *dfa = (re_dfa_t *) extra; local
1436 duplicate_node_closure(re_dfa_t *dfa, int top_org_node, int top_clone_node, int root_node, unsigned int init_constraint) argument
1542 search_duplicated_node(const re_dfa_t *dfa, int org_node, unsigned int constraint) argument
1560 duplicate_node(re_dfa_t *dfa, int org_idx, unsigned int constraint) argument
1576 calc_inveclosure(re_dfa_t *dfa) argument
1599 calc_eclosure(re_dfa_t *dfa) argument
1643 calc_eclosure_iter(re_node_set *new_set, re_dfa_t *dfa, int node, int root) argument
2068 re_dfa_t *dfa = (re_dfa_t *) preg->buffer; local
2102 re_dfa_t *dfa = (re_dfa_t *) preg->buffer; local
2144 re_dfa_t *dfa = (re_dfa_t *) preg->buffer; local
2183 re_dfa_t *dfa = (re_dfa_t *) preg->buffer; local
2399 re_dfa_t *dfa = (re_dfa_t *) preg->buffer; local
2434 parse_dup_op(bin_tree_t *elem, re_string_t *regexp, re_dfa_t *dfa, re_token_t *token, reg_syntax_t syntax, reg_errcode_t *err) argument
2718 parse_bracket_exp(re_string_t *regexp, re_dfa_t *dfa, re_token_t *token, reg_syntax_t syntax, reg_errcode_t *err) argument
3276 parse_bracket_element(bracket_elem_t *elem, re_string_t *regexp, re_token_t *token, int token_len, re_dfa_t *dfa, reg_syntax_t syntax, int accept_hyphen) argument
3542 build_charclass_op(re_dfa_t *dfa, RE_TRANSLATE_TYPE trans, const unsigned char *class_name, const unsigned char *extra, int non_match, reg_errcode_t *err) argument
3695 create_tree(re_dfa_t *dfa, bin_tree_t *left, bin_tree_t *right, re_token_type_t type) argument
3704 create_token_tree(re_dfa_t *dfa, bin_tree_t *left, bin_tree_t *right, const re_token_t *token) argument
3781 duplicate_tree(const bin_tree_t *root, re_dfa_t *dfa) argument
[all...]
H A Dregexec.c62 static void update_regs (const re_dfa_t *dfa, regmatch_t *pmatch,
95 static reg_errcode_t add_epsilon_src_nodes (const re_dfa_t *dfa,
111 static reg_errcode_t check_subexp_limits (const re_dfa_t *dfa,
121 static reg_errcode_t merge_state_array (const re_dfa_t *dfa,
159 static int find_subexp_node (const re_dfa_t *dfa, const re_node_set *nodes,
170 static reg_errcode_t check_arrival_expand_ecl (const re_dfa_t *dfa,
174 static reg_errcode_t check_arrival_expand_ecl_sub (const re_dfa_t *dfa,
182 static int build_trtable (const re_dfa_t *dfa,
185 static int check_node_accept_bytes (const re_dfa_t *dfa, int node_idx,
194 static int group_nodes_into_DFAstates (const re_dfa_t *dfa,
230 re_dfa_t *dfa = (re_dfa_t *) preg->buffer; local
421 re_dfa_t *dfa = (re_dfa_t *) bufp->buffer; local
629 const re_dfa_t *dfa = (const re_dfa_t *) preg->buffer; local
942 const re_dfa_t *const dfa = mctx->dfa; local
1034 const re_dfa_t *const dfa = mctx->dfa; local
1076 const re_dfa_t *const dfa = mctx->dfa; local
1205 check_halt_node_context(const re_dfa_t *dfa, int node, unsigned int context) argument
1250 const re_dfa_t *const dfa = mctx->dfa; local
1396 const re_dfa_t *dfa = (const re_dfa_t *) preg->buffer; local
1517 update_regs(const re_dfa_t *dfa, regmatch_t *pmatch, regmatch_t *prev_idx_match, int cur_node, int cur_idx, int nmatch) argument
1650 const re_dfa_t *const dfa = mctx->dfa; local
1734 merge_state_array(const re_dfa_t *dfa, re_dfastate_t **dst, re_dfastate_t **src, int num) argument
1765 const re_dfa_t *const dfa = mctx->dfa; local
1809 add_epsilon_src_nodes(const re_dfa_t *dfa, re_node_set *dest_nodes, const re_node_set *candidates) argument
1834 sub_epsilon_src_nodes(const re_dfa_t *dfa, int node, re_node_set *dest_nodes, const re_node_set *candidates) argument
1886 const re_dfa_t *const dfa = mctx->dfa; local
1922 const re_dfa_t *const dfa = mctx->dfa; local
2030 check_subexp_limits(const re_dfa_t *dfa, re_node_set *dest_nodes, const re_node_set *candidates, re_node_set *limits, struct re_backref_cache_entry *bkref_ents, int str_idx) argument
2121 const re_dfa_t *const dfa = mctx->dfa; local
2221 const re_dfa_t *const dfa = mctx->dfa; local
2309 const re_dfa_t *const dfa = mctx->dfa; local
2419 const re_dfa_t *const dfa = mctx->dfa; local
2491 const re_dfa_t *const dfa = mctx->dfa; local
2561 const re_dfa_t *const dfa = mctx->dfa; local
2675 const re_dfa_t *const dfa = mctx->dfa; local
2851 find_subexp_node(const re_dfa_t *dfa, const re_node_set *nodes, int subexp_idx, int type) argument
2876 const re_dfa_t *const dfa = mctx->dfa; local
3037 const re_dfa_t *const dfa = mctx->dfa; local
3113 check_arrival_expand_ecl(const re_dfa_t *dfa, re_node_set *cur_nodes, int ex_subexp, int type) argument
3166 check_arrival_expand_ecl_sub(const re_dfa_t *dfa, re_node_set *dst_nodes, int target, int ex_subexp, int type) argument
3213 const re_dfa_t *const dfa = mctx->dfa; local
3299 build_trtable(const re_dfa_t *dfa, re_dfastate_t *state) argument
3526 group_nodes_into_DFAstates(const re_dfa_t *dfa, const re_dfastate_t *state, re_node_set *dests_node, bitset_t *dests_ch) argument
3716 check_node_accept_bytes(const re_dfa_t *dfa, int node_idx, const re_string_t *input, int str_idx) argument
[all...]
H A Dregex_internal.c24 const re_dfa_t *dfa) internal_function;
25 static re_dfastate_t *create_ci_newstate (const re_dfa_t *dfa,
28 static re_dfastate_t *create_cd_newstate (const re_dfa_t *dfa,
42 RE_TRANSLATE_TYPE trans, int icase, const re_dfa_t *dfa)
48 if (init_len < dfa->mb_cur_max)
49 init_len = dfa->mb_cur_max;
51 re_string_construct_common (str, len, pstr, trans, icase, dfa);
57 pstr->word_char = dfa->word_char;
58 pstr->word_ops_used = dfa->word_ops_used;
60 pstr->valid_len = (pstr->mbs_allocated || dfa
40 re_string_allocate(re_string_t *pstr, const char *str, int len, int init_len, RE_TRANSLATE_TYPE trans, int icase, const re_dfa_t *dfa) argument
68 re_string_construct(re_string_t *pstr, const char *str, int len, RE_TRANSLATE_TYPE trans, int icase, const re_dfa_t *dfa) argument
164 re_string_construct_common(const char *str, int len, re_string_t *pstr, RE_TRANSLATE_TYPE trans, int icase, const re_dfa_t *dfa) argument
1397 re_dfa_add_node(re_dfa_t *dfa, re_token_t token) argument
1462 re_acquire_state(reg_errcode_t *err, const re_dfa_t *dfa, const re_node_set *nodes) argument
1506 re_acquire_state_context(reg_errcode_t *err, const re_dfa_t *dfa, const re_node_set *nodes, unsigned int context) argument
1542 register_state(const re_dfa_t *dfa, re_dfastate_t *newstate, unsigned int hash) argument
1596 create_ci_newstate(const re_dfa_t *dfa, const re_node_set *nodes, unsigned int hash) argument
1646 create_cd_newstate(const re_dfa_t *dfa, const re_node_set *nodes, unsigned int context, unsigned int hash) argument
[all...]
H A Dregex_internal.h450 /* `node_idx' is the index in dfa->nodes, if `type' == 0.
569 const re_dfa_t *const dfa; member in struct:__anon5502
571 const re_dfa_t *dfa; member in struct:__anon5502
638 int nbackref; /* The number of backreference in this dfa. */
645 /* If this dfa has "multibyte node", which is a backreference or

Completed in 48 milliseconds