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

/haiku/src/system/libroot/posix/glibc/regex/
H A Dregex_internal.c1403 if (BE (dfa->nodes_len >= dfa->nodes_alloc, 0))
1431 dfa->nodes[dfa->nodes_len] = token;
1432 dfa->nodes[dfa->nodes_len].constraint = 0;
1434 dfa->nodes[dfa->nodes_len].accept_mb =
1437 dfa->nexts[dfa->nodes_len] = -1;
1438 re_node_set_init_empty (dfa->edests + dfa->nodes_len);
1439 re_node_set_init_empty (dfa->eclosures + dfa->nodes_len);
1440 return dfa->nodes_len++;
H A Dregcomp.c328 while (++node < dfa->nodes_len
596 for (i = 0; i < dfa->nodes_len; ++i)
599 for (i = 0; i < dfa->nodes_len; ++i)
1052 for (node = 0; node < dfa->nodes_len; ++node)
1098 for (node = 0; node < dfa->nodes_len; ++node)
1169 dfa->inveclosures = re_malloc (re_node_set, dfa->nodes_len);
1553 for (idx = dfa->nodes_len - 1; dfa->nodes[idx].duplicated && idx > 0; --idx)
1586 for (idx = 0; idx < dfa->nodes_len; ++idx)
1589 for (src = 0; src < dfa->nodes_len; ++src)
1610 assert (dfa->nodes_len >
[all...]
H A Dregex_internal.h619 size_t nodes_len; member in struct:re_dfa_t
H A Dregexec.c681 err = re_string_allocate (&mctx.input, string, length, dfa->nodes_len + 1,

Completed in 55 milliseconds