nodes_len 319 maint/gnulib/lib/regcomp.c while (++node < dfa->nodes_len nodes_len 588 maint/gnulib/lib/regcomp.c for (i = 0; i < dfa->nodes_len; ++i) nodes_len 591 maint/gnulib/lib/regcomp.c for (i = 0; i < dfa->nodes_len; ++i) nodes_len 1090 maint/gnulib/lib/regcomp.c for (node = 0; node < dfa->nodes_len; ++node) nodes_len 1143 maint/gnulib/lib/regcomp.c for (node = 0; node < dfa->nodes_len; ++node) nodes_len 1213 maint/gnulib/lib/regcomp.c dfa->inveclosures = re_malloc (re_node_set, dfa->nodes_len); nodes_len 1598 maint/gnulib/lib/regcomp.c for (idx = dfa->nodes_len - 1; dfa->nodes[idx].duplicated && idx > 0; --idx) nodes_len 1632 maint/gnulib/lib/regcomp.c for (idx = 0; idx < dfa->nodes_len; ++idx) nodes_len 1635 maint/gnulib/lib/regcomp.c for (src = 0; src < dfa->nodes_len; ++src) nodes_len 1656 maint/gnulib/lib/regcomp.c DEBUG_ASSERT (dfa->nodes_len > 0); nodes_len 1663 maint/gnulib/lib/regcomp.c if (node_idx == dfa->nodes_len) nodes_len 1414 maint/gnulib/lib/regex_internal.c if (__glibc_unlikely (dfa->nodes_len >= dfa->nodes_alloc)) nodes_len 1452 maint/gnulib/lib/regex_internal.c dfa->nodes[dfa->nodes_len] = token; nodes_len 1453 maint/gnulib/lib/regex_internal.c dfa->nodes[dfa->nodes_len].constraint = 0; nodes_len 1455 maint/gnulib/lib/regex_internal.c dfa->nodes[dfa->nodes_len].accept_mb = nodes_len 1459 maint/gnulib/lib/regex_internal.c dfa->nexts[dfa->nodes_len] = -1; nodes_len 1460 maint/gnulib/lib/regex_internal.c re_node_set_init_empty (dfa->edests + dfa->nodes_len); nodes_len 1461 maint/gnulib/lib/regex_internal.c re_node_set_init_empty (dfa->eclosures + dfa->nodes_len); nodes_len 1462 maint/gnulib/lib/regex_internal.c return dfa->nodes_len++; nodes_len 642 maint/gnulib/lib/regex_internal.h size_t nodes_len; nodes_len 636 maint/gnulib/lib/regexec.c err = re_string_allocate (&mctx.input, string, length, dfa->nodes_len + 1,