Searched refs:tnfa (Results 1 - 7 of 7) sorted by relevance

/netbsd-6-1-5-RELEASE/external/bsd/tre/dist/lib/
H A Dregexec.c40 const tre_tnfa_t *tnfa, int *tags, int match_eo)
50 DPRINT(("end tag = t%d = %d\n", tnfa->end_tag, match_eo));
51 submatch_data = tnfa->submatch_data;
52 while (i < tnfa->num_submatches && i < nmatch)
54 if (submatch_data[i].so_tag == tnfa->end_tag)
59 if (submatch_data[i].eo_tag == tnfa->end_tag)
77 while (i < tnfa->num_submatches && i < nmatch)
112 tre_tnfa_t *tnfa = (void *)preg->TRE_REGEX_T_FIELD; local
113 return tnfa->have_backrefs;
119 tre_tnfa_t *tnfa local
39 tre_fill_pmatch(size_t nmatch, regmatch_t pmatch[], int cflags, const tre_tnfa_t *tnfa, int *tags, int match_eo) argument
124 tre_match(const tre_tnfa_t *tnfa, const void *string, size_t len, tre_str_type_t type, size_t nmatch, regmatch_t pmatch[], int eflags) argument
190 tre_tnfa_t *tnfa = (void *)preg->TRE_REGEX_T_FIELD; local
226 tre_tnfa_t *tnfa = (void *)preg->TRE_REGEX_T_FIELD; local
243 tre_tnfa_t *tnfa = (void *)preg->TRE_REGEX_T_FIELD; local
255 tre_match_approx(const tre_tnfa_t *tnfa, const void *string, size_t len, tre_str_type_t type, regamatch_t *match, regaparams_t params, int eflags) argument
299 tre_tnfa_t *tnfa = (void *)preg->TRE_REGEX_T_FIELD; local
318 tre_tnfa_t *tnfa = (void *)preg->TRE_REGEX_T_FIELD; local
[all...]
H A Dtre-match-parallel.c68 tre_print_reach(const tre_tnfa_t *tnfa, tre_tnfa_reach_t *reach, int num_tags) argument
93 tre_tnfa_run_parallel(const tre_tnfa_t *tnfa, const void *string, int len, argument
110 int reg_newline = tnfa->cflags & REG_NEWLINE;
134 num_tags = tnfa->num_tags;
145 rbytes = sizeof(*reach_next) * (tnfa->num_states + 1);
146 pbytes = sizeof(*reach_pos) * tnfa->num_states;
150 + (rbytes + xbytes * tnfa->num_states) * 2 + tbytes + pbytes;
175 for (i = 0; i < tnfa->num_states; i++)
184 for (i = 0; i < tnfa->num_states; i++)
188 if (tnfa
[all...]
H A Dtre-match-backtrack.c132 sizeof(*tags) * tnfa->num_tags); \
155 for (i = 0; i < tnfa->num_tags; i++) \
173 for (i = 0; i < tnfa->num_tags; i++) \
184 tre_tnfa_run_backtrack(const tre_tnfa_t *tnfa, const void *string, argument
201 int reg_newline = tnfa->cflags & REG_NEWLINE;
254 tags = alloca(sizeof(*tags) * tnfa->num_tags);
255 pmatch = alloca(sizeof(*pmatch) * tnfa->num_submatches);
256 states_seen = alloca(sizeof(*states_seen) * tnfa->num_states);
258 if (tnfa->num_tags)
260 tags = xmalloc(sizeof(*tags) * tnfa
[all...]
H A Dtre-compile.c121 tre_purge_regset(int *regset, tre_tnfa_t *tnfa, int tag) argument
133 tnfa->submatch_data[id].so_tag = tag;
135 tnfa->submatch_data[id].eo_tag = tag;
145 tre_tnfa_t *tnfa)
152 int first_pass = (mem == NULL || tnfa == NULL);
166 tnfa->end_tag = 0;
167 tnfa->minimal_tags[0] = -1;
170 regset = xmalloc(sizeof(*regset) * ((tnfa->num_submatches + 1) * 2));
176 parents = xmalloc(sizeof(*parents) * (tnfa->num_submatches + 1));
184 saved_states = xmalloc(sizeof(*saved_states) * (tnfa
144 tre_add_tags(tre_mem_t mem, tre_stack_t *stack, tre_ast_node_t *tree, tre_tnfa_t *tnfa) argument
1863 tre_tnfa_t *tnfa = NULL; local
2183 tre_tnfa_t *tnfa; local
[all...]
H A Dtre-internal.h229 typedef struct tnfa tre_tnfa_t;
231 struct tnfa { struct
260 const tre_tnfa_t *tnfa, int *tags, int match_eo);
263 tre_tnfa_run_parallel(const tre_tnfa_t *tnfa, const void *string, int len,
268 tre_tnfa_run_parallel(const tre_tnfa_t *tnfa, const void *string, int len,
273 tre_tnfa_run_backtrack(const tre_tnfa_t *tnfa, const void *string,
279 tre_tnfa_run_approx(const tre_tnfa_t *tnfa, const void *string, int len,
H A Dtre-match-utils.h158 #define CHECK_CHAR_CLASSES(trans_i, tnfa, eflags) \
160 && !(tnfa->cflags & REG_ICASE) \
163 && (tnfa->cflags & REG_ICASE) \
168 tnfa->cflags & REG_ICASE)))
H A Dtre-match-approx.c68 tre_print_reach(const tre_tnfa_t *tnfa, tre_tnfa_approx_reach_t *reach, argument
75 for (id = 0; id < tnfa->num_states; id++)
188 tre_tnfa_run_approx(const tre_tnfa_t *tnfa, const void *string, int len, argument
206 int reg_newline = tnfa->cflags & REG_NEWLINE;
231 num_tags = tnfa->num_tags;
256 size_t reach_bytes = sizeof(*reach_next) * tnfa->num_states;
258 size_t total_bytes = reach_bytes * 2 + (tnfa->num_states * 2 + 1 ) * tag_bytes;
289 for (i = 0; i < tnfa->num_states; i++)
303 for (i = 0; i < tnfa->num_states; i++)
320 for (trans = tnfa
[all...]

Completed in 156 milliseconds