Searched refs:nodes_len (Results 1 – 6 of 6) sorted by relevance
1414 if (__glibc_unlikely (dfa->nodes_len >= dfa->nodes_alloc)) in re_dfa_add_node()1452 dfa->nodes[dfa->nodes_len] = token; in re_dfa_add_node()1453 dfa->nodes[dfa->nodes_len].constraint = 0; in re_dfa_add_node()1455 dfa->nodes[dfa->nodes_len].accept_mb = in re_dfa_add_node()1459 dfa->nexts[dfa->nodes_len] = -1; in re_dfa_add_node()1460 re_node_set_init_empty (dfa->edests + dfa->nodes_len); in re_dfa_add_node()1461 re_node_set_init_empty (dfa->eclosures + dfa->nodes_len); in re_dfa_add_node()1462 return dfa->nodes_len++; in re_dfa_add_node()
319 while (++node < dfa->nodes_len in re_compile_fastmap_iter()588 for (i = 0; i < dfa->nodes_len; ++i) in free_dfa_content()591 for (i = 0; i < dfa->nodes_len; ++i) in free_dfa_content()1090 for (node = 0; node < dfa->nodes_len; ++node) in optimize_utf8()1143 for (node = 0; node < dfa->nodes_len; ++node) in optimize_utf8()1213 dfa->inveclosures = re_malloc (re_node_set, dfa->nodes_len); in analyze()1598 for (idx = dfa->nodes_len - 1; dfa->nodes[idx].duplicated && idx > 0; --idx) in search_duplicated_node()1632 for (idx = 0; idx < dfa->nodes_len; ++idx) in calc_inveclosure()1635 for (src = 0; src < dfa->nodes_len; ++src) in calc_inveclosure()1656 DEBUG_ASSERT (dfa->nodes_len > 0); in calc_eclosure()[all …]
642 size_t nodes_len; member
636 err = re_string_allocate (&mctx.input, string, length, dfa->nodes_len + 1, in re_search_internal()
8597 and nodes_len to size_t.
3885 instead of dfa->nodes_len + 1 state_log entries initially.