Lines Matching defs:ndests
3307 Idx ndests; /* Number of the destination states from `state'. */
3343 ndests = group_nodes_into_DFAstates (dfa, state, dests_node, dests_ch);
3344 if (BE (! REG_VALID_NONZERO_INDEX (ndests), 0))
3348 if (ndests == 0)
3356 err = re_node_set_alloc (&follows, ndests + 1);
3363 < ndests, 0))
3368 + ndests * 3 * sizeof (re_dfastate_t *)))
3370 alloca (ndests * 3 * sizeof (re_dfastate_t *));
3375 malloc (ndests * 3 * sizeof (re_dfastate_t *));
3382 for (i = 0; i < ndests; ++i)
3390 dest_states_word = dest_states + ndests;
3391 dest_states_nl = dest_states_word + ndests;
3395 for (i = 0; i < ndests; ++i)
3500 for (j = 0; j < ndests; ++j)
3517 for (i = 0; i < ndests; ++i)
3539 Idx ndests; /* Number of the destinations from `state'. */
3543 ndests = 0;
3649 for (j = 0; j < ndests; ++j)
3680 bitset_copy (dests_ch[ndests], remains);
3682 err = re_node_set_init_copy (dests_node + ndests, &dests_node[j]);
3685 ++ndests;
3698 if (j == ndests)
3700 bitset_copy (dests_ch[ndests], accepts);
3701 err = re_node_set_init_1 (dests_node + ndests, cur_nodes->elems[i]);
3704 ++ndests;
3708 return ndests;
3710 for (j = 0; j < ndests; ++j)
Indexes created Mon Apr 20 00:23:12 UTC 2026