Search

Home

Sort by

Full Search
Definition
Symbol
File Path
History

In Project(s)

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

/osnet-11/usr/src/grub/grub2/grub-core/gnulib/
H A D	regcomp.c	27 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 Idx duplicate_node (re_dfa_t dfa, Idx org_idx, unsigned int constraint); 51 static Idx search_duplicated_node (const re_dfa_t dfa, Idx 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, 278 re_dfa_t dfa = (re_dfa_t ) bufp->buffer; local 312 re_dfa_t dfa = (re_dfa_t ) bufp->buffer; local 609 free_dfa_content(re_dfa_t dfa) argument 662 re_dfa_t dfa = (re_dfa_t ) preg->buffer; local 756 re_dfa_t dfa; local 851 init_dfa(re_dfa_t dfa, size_t pat_len) argument 950 init_word_char(re_dfa_t dfa) argument 965 re_dfa_t dfa = (re_dfa_t ) preg->buffer; local 982 create_initial_state(re_dfa_t dfa) argument 1067 optimize_utf8(re_dfa_t dfa) argument 1149 re_dfa_t dfa = (re_dfa_t ) preg->buffer; local 1277 re_dfa_t dfa = (re_dfa_t ) extra; local 1330 re_dfa_t dfa = (re_dfa_t ) preg->buffer; local 1367 re_dfa_t dfa = (re_dfa_t ) extra; local 1412 re_dfa_t dfa = (re_dfa_t ) extra; local 1471 duplicate_node_closure(re_dfa_t dfa, Idx top_org_node, Idx top_clone_node, Idx root_node, unsigned int init_constraint) argument 1578 search_duplicated_node(const re_dfa_t dfa, Idx org_node, unsigned int constraint) argument 1596 duplicate_node(re_dfa_t dfa, Idx org_idx, unsigned int constraint) argument 1612 calc_inveclosure(re_dfa_t dfa) argument 1636 calc_eclosure(re_dfa_t dfa) argument 1681 calc_eclosure_iter(re_node_set new_set, re_dfa_t dfa, Idx node, bool root) argument 2111 re_dfa_t dfa = (re_dfa_t ) preg->buffer; local 2145 re_dfa_t dfa = (re_dfa_t ) preg->buffer; local 2187 re_dfa_t dfa = (re_dfa_t ) preg->buffer; local 2226 re_dfa_t dfa = (re_dfa_t ) preg->buffer; local 2442 re_dfa_t dfa = (re_dfa_t ) preg->buffer; local 2477 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 2775 parse_bracket_exp(re_string_t regexp, re_dfa_t dfa, re_token_t token, reg_syntax_t syntax, reg_errcode_t err) argument 3342 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, bool accept_hyphen) argument 3608 build_charclass_op(re_dfa_t dfa, RE_TRANSLATE_TYPE trans, const unsigned char class_name, const unsigned char extra, bool non_match, reg_errcode_t err) argument 3769 create_tree(re_dfa_t dfa, bin_tree_t left, bin_tree_t right, re_token_type_t type) argument 3778 create_token_tree(re_dfa_t dfa, bin_tree_t left, bin_tree_t right, const re_token_t token) argument 3855 duplicate_tree(const bin_tree_t root, re_dfa_t *dfa) argument [all...]
H A D	regexec.c	65 static void update_regs (const re_dfa_t dfa, regmatch_t pmatch, 98 static reg_errcode_t add_epsilon_src_nodes (const re_dfa_t dfa, 114 static reg_errcode_t check_subexp_limits (const re_dfa_t dfa, 124 static reg_errcode_t merge_state_array (const re_dfa_t dfa, 162 static Idx find_subexp_node (const re_dfa_t dfa, const re_node_set nodes, 173 static reg_errcode_t check_arrival_expand_ecl (const re_dfa_t dfa, 177 static reg_errcode_t check_arrival_expand_ecl_sub (const re_dfa_t dfa, 185 static bool build_trtable (const re_dfa_t dfa, 188 static int check_node_accept_bytes (const re_dfa_t dfa, Idx node_idx, 197 static Idx group_nodes_into_DFAstates (const re_dfa_t dfa, 234 re_dfa_t dfa = (re_dfa_t ) preg->buffer; local 429 re_dfa_t dfa = (re_dfa_t ) bufp->buffer; local 648 const re_dfa_t dfa = (const re_dfa_t ) preg->buffer; local 978 const re_dfa_t const dfa = mctx->dfa; local 1075 const re_dfa_t const dfa = mctx->dfa; local 1117 const re_dfa_t const dfa = mctx->dfa; local 1246 check_halt_node_context(const re_dfa_t dfa, Idx node, unsigned int context) argument 1291 const re_dfa_t const dfa = mctx->dfa; local 1439 const re_dfa_t dfa = (const re_dfa_t ) preg->buffer; local 1560 update_regs(const re_dfa_t dfa, regmatch_t pmatch, regmatch_t prev_idx_match, Idx cur_node, Idx cur_idx, Idx nmatch) argument 1693 const re_dfa_t const dfa = mctx->dfa; local 1777 merge_state_array(const re_dfa_t dfa, re_dfastate_t dst, re_dfastate_t src, Idx num) argument 1808 const re_dfa_t const dfa = mctx->dfa; local 1852 add_epsilon_src_nodes(const re_dfa_t dfa, re_node_set dest_nodes, const re_node_set candidates) argument 1881 sub_epsilon_src_nodes(const re_dfa_t dfa, Idx node, re_node_set dest_nodes, const re_node_set candidates) argument 1933 const re_dfa_t const dfa = mctx->dfa; local 1969 const re_dfa_t const dfa = mctx->dfa; local 2078 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, Idx str_idx) argument 2169 const re_dfa_t const dfa = mctx->dfa; local 2269 const re_dfa_t const dfa = mctx->dfa; local 2357 const re_dfa_t const dfa = mctx->dfa; local 2467 const re_dfa_t const dfa = mctx->dfa; local 2539 const re_dfa_t const dfa = mctx->dfa; local 2610 const re_dfa_t const dfa = mctx->dfa; local 2724 const re_dfa_t const dfa = mctx->dfa; local 2901 find_subexp_node(const re_dfa_t dfa, const re_node_set nodes, Idx subexp_idx, int type) argument 2926 const re_dfa_t const dfa = mctx->dfa; local 3088 const re_dfa_t const dfa = mctx->dfa; local 3166 check_arrival_expand_ecl(const re_dfa_t dfa, re_node_set cur_nodes, Idx ex_subexp, int type) argument 3219 check_arrival_expand_ecl_sub(const re_dfa_t dfa, re_node_set dst_nodes, Idx target, Idx ex_subexp, int type) argument 3267 const re_dfa_t const dfa = mctx->dfa; local 3353 build_trtable(const re_dfa_t dfa, re_dfastate_t state) argument 3588 group_nodes_into_DFAstates(const re_dfa_t dfa, const re_dfastate_t state, re_node_set dests_node, bitset_t dests_ch) argument 3781 check_node_accept_bytes(const re_dfa_t dfa, Idx node_idx, const re_string_t input, Idx str_idx) argument [all...]
H A D	regex_internal.c	24 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, bool 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, Idx len, Idx init_len, RE_TRANSLATE_TYPE trans, bool icase, const re_dfa_t dfa) argument 68 re_string_construct(re_string_t pstr, const char str, Idx len, RE_TRANSLATE_TYPE trans, bool icase, const re_dfa_t dfa) argument 171 re_string_construct_common(const char str, Idx len, re_string_t pstr, RE_TRANSLATE_TYPE trans, bool icase, const re_dfa_t dfa) argument 1408 re_dfa_add_node(re_dfa_t dfa, re_token_t token) argument 1479 re_acquire_state(reg_errcode_t err, const re_dfa_t dfa, const re_node_set nodes) argument 1527 re_acquire_state_context(reg_errcode_t err, const re_dfa_t dfa, const re_node_set nodes, unsigned int context) argument 1568 register_state(const re_dfa_t dfa, re_dfastate_t newstate, re_hashval_t hash) argument 1623 create_ci_newstate(const re_dfa_t dfa, const re_node_set nodes, re_hashval_t hash) argument 1673 create_cd_newstate(const re_dfa_t dfa, const re_node_set nodes, unsigned int context, re_hashval_t hash) argument [all...]
H A D	regex_internal.h	493 /* `node_idx' is the index in dfa->nodes, if `type' == 0. 612 const re_dfa_t const dfa; member in struct:__anon472 614 const re_dfa_t dfa; member in struct:__anon472 681 Idx nbackref; /* The number of backreference in this dfa. / 688 / If this dfa has "multibyte node", which is a backreference or
/osnet-11/usr/src/lib/gss_mechs/mech_krb5/krb5/unicode/
H A D	ure.h	`128 void ure_dfa_free (ure_dfa_t dfa); 130 void ure_write_dfa (ure_dfa_t dfa, FILE out); 133 ure_exec (ure_dfa_t dfa, int flags, ucs2_t text,`
H A D	ure.c	1698 ure_dfa_t dfa; local 1744 dfa = (ure_dfa_t) malloc(sizeof(_ure_dfa_t)); 1745 (void) memset((char ) dfa, '\0', sizeof(_ure_dfa_t)); 1747 dfa->flags = buf->flags & (_URE_DFA_CASEFOLD\|_URE_DFA_BLANKLINE); 1757 dfa->syms = buf->symtab; 1758 dfa->nsyms = buf->symtab_used; 1768 dfa->nstates++; 1769 dfa->ntrans += sp->trans_used; 1777 dfa->states = (_ure_dstate_t ) malloc(sizeof(_ure_dstate_t) * 1778 dfa 1810 ure_dfa_free(ure_dfa_t dfa) argument 1834 ure_write_dfa(ure_dfa_t dfa, FILE out) argument 1954 ure_exec(ure_dfa_t dfa, int flags, ucs2_t text, unsigned long textlen, unsigned long match_start, unsigned long match_end) argument [all...]

Completed in 42 milliseconds