Searched refs:nodes_len (Results 1 – 4 of 4) sorted by relevance
1412 if (BE (dfa->nodes_len >= dfa->nodes_alloc, 0)) in re_dfa_add_node()1443 dfa->nodes[dfa->nodes_len] = token; in re_dfa_add_node()1444 dfa->nodes[dfa->nodes_len].constraint = 0; in re_dfa_add_node()1446 dfa->nodes[dfa->nodes_len].accept_mb = in re_dfa_add_node()1449 dfa->nexts[dfa->nodes_len] = -1; in re_dfa_add_node()1450 re_node_set_init_empty (dfa->edests + dfa->nodes_len); in re_dfa_add_node()1451 re_node_set_init_empty (dfa->eclosures + dfa->nodes_len); in re_dfa_add_node()1452 return dfa->nodes_len++; in re_dfa_add_node()
324 while (++node < dfa->nodes_len in re_compile_fastmap_iter()591 for (i = 0; i < dfa->nodes_len; ++i) in free_dfa_content()594 for (i = 0; i < dfa->nodes_len; ++i) in free_dfa_content()1080 for (node = 0; node < dfa->nodes_len; ++node) in optimize_utf8()1126 for (node = 0; node < dfa->nodes_len; ++node) in optimize_utf8()1196 dfa->inveclosures = re_malloc (re_node_set, dfa->nodes_len); in analyze()1580 for (idx = dfa->nodes_len - 1; dfa->nodes[idx].duplicated && idx > 0; --idx) in search_duplicated_node()1613 for (idx = 0; idx < dfa->nodes_len; ++idx) in calc_inveclosure()1616 for (src = 0; src < dfa->nodes_len; ++src) in calc_inveclosure()1637 assert (dfa->nodes_len > 0); in calc_eclosure()[all …]
620 size_t nodes_len; member
686 err = re_string_allocate (&mctx.input, string, length, dfa->nodes_len + 1,