Lines Matching full:nodes_len
336 while (++node < dfa->nodes_len
618 for (i = 0; i < dfa->nodes_len; ++i)
621 for (i = 0; i < dfa->nodes_len; ++i)
1073 for (node = 0; node < dfa->nodes_len; ++node)
1126 for (node = 0; node < dfa->nodes_len; ++node)
1197 dfa->inveclosures = re_malloc (re_node_set, dfa->nodes_len);
1583 for (idx = dfa->nodes_len - 1; dfa->nodes[idx].duplicated && idx > 0; --idx)
1617 for (idx = 0; idx < dfa->nodes_len; ++idx)
1620 for (src = 0; src < dfa->nodes_len; ++src)
1642 assert (dfa->nodes_len > 0);
1650 if (node_idx == dfa->nodes_len)
