Home
last modified time | relevance | path

Searched refs:nodes_len (Results 1 – 4 of 4) sorted by relevance

/l4re-core-master/uclibc/lib/contrib/uclibc/libc/misc/regex/
A Dregex_internal.c1321 if (BE (dfa->nodes_len >= dfa->nodes_alloc, 0)) in re_dfa_add_node()
1349 dfa->nodes[dfa->nodes_len] = token; in re_dfa_add_node()
1350 dfa->nodes[dfa->nodes_len].constraint = 0; in re_dfa_add_node()
1352 dfa->nodes[dfa->nodes_len].accept_mb = in re_dfa_add_node()
1355 dfa->nexts[dfa->nodes_len] = -1; in re_dfa_add_node()
1356 re_node_set_init_empty (dfa->edests + dfa->nodes_len); in re_dfa_add_node()
1357 re_node_set_init_empty (dfa->eclosures + dfa->nodes_len); in re_dfa_add_node()
1358 return dfa->nodes_len++; in re_dfa_add_node()
A Dregcomp.c313 while (++node < dfa->nodes_len in re_compile_fastmap_iter()
548 for (i = 0; i < dfa->nodes_len; ++i) in free_dfa_content()
551 for (i = 0; i < dfa->nodes_len; ++i) in free_dfa_content()
1010 for (node = 0; node < dfa->nodes_len; ++node) in optimize_utf8()
1054 for (node = 0; node < dfa->nodes_len; ++node) in optimize_utf8()
1124 dfa->inveclosures = re_malloc (re_node_set, dfa->nodes_len); in analyze()
1511 for (idx = dfa->nodes_len - 1; dfa->nodes[idx].duplicated && idx > 0; --idx) in search_duplicated_node()
1545 for (idx = 0; idx < dfa->nodes_len; ++idx) in calc_inveclosure()
1548 for (src = 0; src < dfa->nodes_len; ++src) in calc_inveclosure()
1569 assert (dfa->nodes_len > 0); in calc_eclosure()
[all …]
A Dregex_internal.h557 size_t nodes_len; member
A Dregexec.c601 err = re_string_allocate (&mctx.input, string, length, dfa->nodes_len + 1, in re_search_internal()

Completed in 17 milliseconds