/haiku-fatelf/src/bin/coreutils/lib/ |
H A D | regex_internal.c | 45 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 73 re_string_construct(re_string_t *pstr, const char *str, Idx len, RE_TRANSLATE_TYPE trans, bool icase, const re_dfa_t *dfa) argument 176 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 1414 re_dfa_add_node(re_dfa_t *dfa, re_token_t token) argument 1485 re_acquire_state(reg_errcode_t *err, const re_dfa_t *dfa, const re_node_set *nodes) argument 1533 re_acquire_state_context(reg_errcode_t *err, const re_dfa_t *dfa, const re_node_set *nodes, unsigned int context) argument 1573 register_state(const re_dfa_t *dfa, re_dfastate_t *newstate, re_hashval_t hash) argument 1628 create_ci_newstate(const re_dfa_t *dfa, const re_node_set *nodes, re_hashval_t hash) argument 1678 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 | regcomp.c | 282 re_dfa_t *dfa = (re_dfa_t *) bufp->buffer; local 316 re_dfa_t *dfa = (re_dfa_t *) bufp->buffer; local 613 free_dfa_content(re_dfa_t *dfa) argument 666 re_dfa_t *dfa = (re_dfa_t *) preg->buffer; local 760 re_dfa_t *dfa; local 855 init_dfa(re_dfa_t *dfa, size_t pat_len) argument 954 init_word_char(re_dfa_t *dfa) argument 969 re_dfa_t *dfa = (re_dfa_t *) preg->buffer; local 986 create_initial_state(re_dfa_t *dfa) argument 1068 optimize_utf8(re_dfa_t *dfa) argument 1150 re_dfa_t *dfa = (re_dfa_t *) preg->buffer; local 1278 re_dfa_t *dfa = (re_dfa_t *) extra; local 1331 re_dfa_t *dfa = (re_dfa_t *) preg->buffer; local 1368 re_dfa_t *dfa = (re_dfa_t *) extra; local 1413 re_dfa_t *dfa = (re_dfa_t *) extra; local 1472 duplicate_node_closure(re_dfa_t *dfa, Idx top_org_node, Idx top_clone_node, Idx root_node, unsigned int init_constraint) argument 1579 search_duplicated_node(const re_dfa_t *dfa, Idx org_node, unsigned int constraint) argument 1597 duplicate_node(re_dfa_t *dfa, Idx org_idx, unsigned int constraint) argument 1613 calc_inveclosure(re_dfa_t *dfa) argument 1637 calc_eclosure(re_dfa_t *dfa) argument 1682 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 2765 parse_bracket_exp(re_string_t *regexp, re_dfa_t *dfa, re_token_t *token, reg_syntax_t syntax, reg_errcode_t *err) argument 3592 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 3747 create_tree(re_dfa_t *dfa, bin_tree_t *left, bin_tree_t *right, re_token_type_t type) argument 3756 create_token_tree(re_dfa_t *dfa, bin_tree_t *left, bin_tree_t *right, const re_token_t *token) argument 3833 duplicate_tree(const bin_tree_t *root, re_dfa_t *dfa) argument [all...] |
H A D | regex_internal.h | 613 const re_dfa_t *const dfa; member in struct:__anon3334 615 const re_dfa_t *dfa; member in struct:__anon3334
|
H A D | regexec.c | 239 re_dfa_t *dfa = (re_dfa_t *) preg->buffer; local 437 re_dfa_t *dfa = (re_dfa_t *) bufp->buffer; local 659 const re_dfa_t *dfa = (const re_dfa_t *) preg->buffer; local 989 const re_dfa_t *const dfa = mctx->dfa; local 1086 const re_dfa_t *const dfa = mctx->dfa; local 1128 const re_dfa_t *const dfa = mctx->dfa; local 1257 check_halt_node_context(const re_dfa_t *dfa, Idx node, unsigned int context) argument 1302 const re_dfa_t *const dfa = mctx->dfa; local 1450 const re_dfa_t *dfa = (const re_dfa_t *) preg->buffer; local 1571 update_regs(const re_dfa_t *dfa, regmatch_t *pmatch, regmatch_t *prev_idx_match, Idx cur_node, Idx cur_idx, Idx nmatch) argument 1704 const re_dfa_t *const dfa = mctx->dfa; local 1788 merge_state_array(const re_dfa_t *dfa, re_dfastate_t **dst, re_dfastate_t **src, Idx num) argument 1819 const re_dfa_t *const dfa = mctx->dfa; local 1863 add_epsilon_src_nodes(const re_dfa_t *dfa, re_node_set *dest_nodes, const re_node_set *candidates) argument 1888 sub_epsilon_src_nodes(const re_dfa_t *dfa, Idx node, re_node_set *dest_nodes, const re_node_set *candidates) argument 1940 const re_dfa_t *const dfa = mctx->dfa; local 1976 const re_dfa_t *const dfa = mctx->dfa; local 2085 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 2176 const re_dfa_t *const dfa = mctx->dfa; local 2276 const re_dfa_t *const dfa = mctx->dfa; local 2364 const re_dfa_t *const dfa = mctx->dfa; local 2474 const re_dfa_t *const dfa = mctx->dfa; local 2546 const re_dfa_t *const dfa = mctx->dfa; local 2617 const re_dfa_t *const dfa = mctx->dfa; local 2731 const re_dfa_t *const dfa = mctx->dfa; local 2908 find_subexp_node(const re_dfa_t *dfa, const re_node_set *nodes, Idx subexp_idx, int type) argument 2933 const re_dfa_t *const dfa = mctx->dfa; local 3095 const re_dfa_t *const dfa = mctx->dfa; local 3173 check_arrival_expand_ecl(const re_dfa_t *dfa, re_node_set *cur_nodes, Idx ex_subexp, int type) argument 3226 check_arrival_expand_ecl_sub(const re_dfa_t *dfa, re_node_set *dst_nodes, Idx target, Idx ex_subexp, int type) argument 3274 const re_dfa_t *const dfa = mctx->dfa; local 3360 build_trtable(const re_dfa_t *dfa, re_dfastate_t *state) argument 3595 group_nodes_into_DFAstates(const re_dfa_t *dfa, const re_dfastate_t *state, re_node_set *dests_node, bitset_t *dests_ch) argument 3788 check_node_accept_bytes(const re_dfa_t *dfa, Idx node_idx, const re_string_t *input, Idx str_idx) argument [all...] |
/haiku-fatelf/src/bin/findutils/gnulib/lib/ |
H A D | regex_internal.c | 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 1406 re_dfa_add_node(re_dfa_t *dfa, re_token_t token) argument 1477 re_acquire_state(reg_errcode_t *err, const re_dfa_t *dfa, const re_node_set *nodes) argument 1525 re_acquire_state_context(reg_errcode_t *err, const re_dfa_t *dfa, const re_node_set *nodes, unsigned int context) argument 1565 register_state(const re_dfa_t *dfa, re_dfastate_t *newstate, re_hashval_t hash) argument 1620 create_ci_newstate(const re_dfa_t *dfa, const re_node_set *nodes, re_hashval_t hash) argument 1670 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 | regcomp.c | 276 re_dfa_t *dfa = (re_dfa_t *) bufp->buffer; local 310 re_dfa_t *dfa = (re_dfa_t *) bufp->buffer; local 587 free_dfa_content(re_dfa_t *dfa) argument 640 re_dfa_t *dfa = (re_dfa_t *) preg->buffer; local 734 re_dfa_t *dfa; local 829 init_dfa(re_dfa_t *dfa, size_t pat_len) argument 923 init_word_char(re_dfa_t *dfa) argument 938 re_dfa_t *dfa = (re_dfa_t *) preg->buffer; local 955 create_initial_state(re_dfa_t *dfa) argument 1037 optimize_utf8(re_dfa_t *dfa) argument 1117 re_dfa_t *dfa = (re_dfa_t *) preg->buffer; local 1245 re_dfa_t *dfa = (re_dfa_t *) extra; local 1298 re_dfa_t *dfa = (re_dfa_t *) preg->buffer; local 1335 re_dfa_t *dfa = (re_dfa_t *) extra; local 1378 re_dfa_t *dfa = (re_dfa_t *) extra; local 1437 duplicate_node_closure(re_dfa_t *dfa, Idx top_org_node, Idx top_clone_node, Idx root_node, unsigned int init_constraint) argument 1548 search_duplicated_node(const re_dfa_t *dfa, Idx org_node, unsigned int constraint) argument 1566 duplicate_node(re_dfa_t *dfa, Idx org_idx, unsigned int constraint) argument 1583 calc_inveclosure(re_dfa_t *dfa) argument 1607 calc_eclosure(re_dfa_t *dfa) argument 1652 calc_eclosure_iter(re_node_set *new_set, re_dfa_t *dfa, Idx node, bool root) argument 2083 re_dfa_t *dfa = (re_dfa_t *) preg->buffer; local 2117 re_dfa_t *dfa = (re_dfa_t *) preg->buffer; local 2159 re_dfa_t *dfa = (re_dfa_t *) preg->buffer; local 2198 re_dfa_t *dfa = (re_dfa_t *) preg->buffer; local 2414 re_dfa_t *dfa = (re_dfa_t *) preg->buffer; local 2449 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 2734 parse_bracket_exp(re_string_t *regexp, re_dfa_t *dfa, re_token_t *token, reg_syntax_t syntax, reg_errcode_t *err) argument 3292 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 3554 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 3709 create_tree(re_dfa_t *dfa, bin_tree_t *left, bin_tree_t *right, re_token_type_t type) argument 3718 create_token_tree(re_dfa_t *dfa, bin_tree_t *left, bin_tree_t *right, const re_token_t *token) argument 3795 duplicate_tree(const bin_tree_t *root, re_dfa_t *dfa) argument [all...] |
H A D | regex_internal.h | 613 const re_dfa_t *const dfa; member in struct:__anon3508 615 const re_dfa_t *dfa; member in struct:__anon3508
|
H A D | regexec.c | 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 977 const re_dfa_t *const dfa = mctx->dfa; local 1069 const re_dfa_t *const dfa = mctx->dfa; local 1111 const re_dfa_t *const dfa = mctx->dfa; local 1240 check_halt_node_context(const re_dfa_t *dfa, Idx node, unsigned int context) argument 1285 const re_dfa_t *const dfa = mctx->dfa; local 1433 const re_dfa_t *dfa = (const re_dfa_t *) preg->buffer; local 1554 update_regs(const re_dfa_t *dfa, regmatch_t *pmatch, regmatch_t *prev_idx_match, Idx cur_node, Idx cur_idx, Idx nmatch) argument 1687 const re_dfa_t *const dfa = mctx->dfa; local 1771 merge_state_array(const re_dfa_t *dfa, re_dfastate_t **dst, re_dfastate_t **src, Idx num) argument 1802 const re_dfa_t *const dfa = mctx->dfa; local 1846 add_epsilon_src_nodes(const re_dfa_t *dfa, re_node_set *dest_nodes, const re_node_set *candidates) argument 1871 sub_epsilon_src_nodes(const re_dfa_t *dfa, Idx node, re_node_set *dest_nodes, const re_node_set *candidates) argument 1923 const re_dfa_t *const dfa = mctx->dfa; local 1959 const re_dfa_t *const dfa = mctx->dfa; local 2068 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 2159 const re_dfa_t *const dfa = mctx->dfa; local 2259 const re_dfa_t *const dfa = mctx->dfa; local 2347 const re_dfa_t *const dfa = mctx->dfa; local 2457 const re_dfa_t *const dfa = mctx->dfa; local 2529 const re_dfa_t *const dfa = mctx->dfa; local 2600 const re_dfa_t *const dfa = mctx->dfa; local 2714 const re_dfa_t *const dfa = mctx->dfa; local 2891 find_subexp_node(const re_dfa_t *dfa, const re_node_set *nodes, Idx subexp_idx, int type) argument 2916 const re_dfa_t *const dfa = mctx->dfa; local 3078 const re_dfa_t *const dfa = mctx->dfa; local 3154 check_arrival_expand_ecl(const re_dfa_t *dfa, re_node_set *cur_nodes, Idx ex_subexp, int type) argument 3207 check_arrival_expand_ecl_sub(const re_dfa_t *dfa, re_node_set *dst_nodes, Idx target, Idx ex_subexp, int type) argument 3255 const re_dfa_t *const dfa = mctx->dfa; local 3341 build_trtable(const re_dfa_t *dfa, re_dfastate_t *state) argument 3576 group_nodes_into_DFAstates(const re_dfa_t *dfa, const re_dfastate_t *state, re_node_set *dests_node, bitset_t *dests_ch) argument 3769 check_node_accept_bytes(const re_dfa_t *dfa, Idx node_idx, const re_string_t *input, Idx str_idx) argument [all...] |
/haiku-fatelf/src/system/libroot/posix/glibc/regex/ |
H A D | regex_internal.c | 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 D | regcomp.c | 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 D | regex_internal.h | 569 const re_dfa_t *const dfa; member in struct:__anon5503 571 const re_dfa_t *dfa; member in struct:__anon5503
|
H A D | regexec.c | 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...] |
/haiku-fatelf/src/bin/gawk/ |
H A D | regcomp.c | 278 re_dfa_t *dfa = (re_dfa_t *) bufp->buffer; local 313 re_dfa_t *dfa = (re_dfa_t *) bufp->buffer; local 527 free_dfa_content(re_dfa_t *dfa) argument 587 re_dfa_t *dfa = (re_dfa_t *) preg->buffer; local 678 re_dfa_t *dfa; local 826 re_dfa_t *dfa = (re_dfa_t *) preg->buffer; local 1791 re_dfa_t *dfa = (re_dfa_t *) preg->buffer; local 1831 re_dfa_t *dfa = (re_dfa_t *) preg->buffer; local 1930 re_dfa_t *dfa = (re_dfa_t *) preg->buffer; local 2137 re_dfa_t *dfa = (re_dfa_t *) preg->buffer; local [all...] |
H A D | regexec.c | 586 re_dfa_t *dfa = (re_dfa_t *)preg->buffer; local 832 re_dfa_t *dfa = (re_dfa_t *)preg->buffer; local 920 re_dfa_t *dfa = (re_dfa_t *) preg->buffer; local 965 re_dfa_t *dfa = (re_dfa_t *) preg->buffer; local 1101 re_dfa_t *dfa = (re_dfa_t *) preg->buffer; local 1129 re_dfa_t *dfa = (re_dfa_t *)preg->buffer; local 1270 re_dfa_t *dfa = (re_dfa_t *)preg->buffer; local 1413 re_dfa_t *dfa = (re_dfa_t *)preg->buffer; local 1581 re_dfa_t *dfa = (re_dfa_t *)preg->buffer; local 1893 re_dfa_t *dfa = (re_dfa_t *)preg->buffer; local 2015 re_dfa_t *dfa = (re_dfa_t *) preg->buffer; local 2048 re_dfa_t *dfa = (re_dfa_t *) preg->buffer; local 2224 re_dfa_t *dfa = (re_dfa_t *) preg->buffer; local 2289 re_dfa_t *dfa = (re_dfa_t *) preg->buffer; local 2361 re_dfa_t *dfa = (re_dfa_t *) preg->buffer; local 2477 re_dfa_t *dfa = (re_dfa_t *) preg->buffer; local 2645 re_dfa_t *dfa = (re_dfa_t *) preg->buffer; local 3000 re_dfa_t *dfa = (re_dfa_t *) preg->buffer; local 3089 re_dfa_t *dfa = (re_dfa_t *) preg->buffer; local 3307 const re_dfa_t *dfa = (re_dfa_t *) preg->buffer; local 3444 const re_dfa_t *dfa = (re_dfa_t *) preg->buffer; local [all...] |