nodes_len 304 maint/gnulib/lib/regcomp.c while (++node < dfa->nodes_len nodes_len 564 maint/gnulib/lib/regcomp.c for (i = 0; i < dfa->nodes_len; ++i) nodes_len 567 maint/gnulib/lib/regcomp.c for (i = 0; i < dfa->nodes_len; ++i) nodes_len 1053 maint/gnulib/lib/regcomp.c for (node = 0; node < dfa->nodes_len; ++node) nodes_len 1106 maint/gnulib/lib/regcomp.c for (node = 0; node < dfa->nodes_len; ++node) nodes_len 1175 maint/gnulib/lib/regcomp.c dfa->inveclosures = re_malloc (re_node_set, dfa->nodes_len); nodes_len 1560 maint/gnulib/lib/regcomp.c for (idx = dfa->nodes_len - 1; dfa->nodes[idx].duplicated && idx > 0; --idx) nodes_len 1594 maint/gnulib/lib/regcomp.c for (idx = 0; idx < dfa->nodes_len; ++idx) nodes_len 1597 maint/gnulib/lib/regcomp.c for (src = 0; src < dfa->nodes_len; ++src) nodes_len 1618 maint/gnulib/lib/regcomp.c DEBUG_ASSERT (dfa->nodes_len > 0); nodes_len 1625 maint/gnulib/lib/regcomp.c if (node_idx == dfa->nodes_len) nodes_len 1380 maint/gnulib/lib/regex_internal.c if (__glibc_unlikely (dfa->nodes_len >= dfa->nodes_alloc)) nodes_len 1418 maint/gnulib/lib/regex_internal.c dfa->nodes[dfa->nodes_len] = token; nodes_len 1419 maint/gnulib/lib/regex_internal.c dfa->nodes[dfa->nodes_len].constraint = 0; nodes_len 1420 maint/gnulib/lib/regex_internal.c dfa->nodes[dfa->nodes_len].accept_mb = nodes_len 1423 maint/gnulib/lib/regex_internal.c dfa->nexts[dfa->nodes_len] = -1; nodes_len 1424 maint/gnulib/lib/regex_internal.c re_node_set_init_empty (dfa->edests + dfa->nodes_len); nodes_len 1425 maint/gnulib/lib/regex_internal.c re_node_set_init_empty (dfa->eclosures + dfa->nodes_len); nodes_len 1426 maint/gnulib/lib/regex_internal.c return dfa->nodes_len++; nodes_len 633 maint/gnulib/lib/regex_internal.h size_t nodes_len; nodes_len 630 maint/gnulib/lib/regexec.c err = re_string_allocate (&mctx.input, string, length, dfa->nodes_len + 1,