3360   Idx ndests; /* Number of the destination states from `state'.  */  in build_trtable()  local
3394   ndests = group_nodes_into_DFAstates (dfa, state, dests_node, dests_ch);  in build_trtable()
3395   if (BE (! REG_VALID_NONZERO_INDEX (ndests), 0))  in build_trtable()
3399       if (ndests == 0)  in build_trtable()
3408   err = re_node_set_alloc (&follows, ndests + 1);  in build_trtable()
3415 	   < ndests),  in build_trtable()
3420 			 + ndests * 3 * sizeof (re_dfastate_t *)))  in build_trtable()
3422       alloca (ndests * 3 * sizeof (re_dfastate_t *));  in build_trtable()
3426 	malloc (ndests * 3 * sizeof (re_dfastate_t *));  in build_trtable()
3433 	  for (i = 0; i < ndests; ++i)  in build_trtable()
3441   dest_states_word = dest_states + ndests;  in build_trtable()
3442   dest_states_nl = dest_states_word + ndests;  in build_trtable()
3446   for (i = 0; i < ndests; ++i)  in build_trtable()
3553       for (j = 0; j < ndests; ++j)  in build_trtable()
3570   for (i = 0; i < ndests; ++i)  in build_trtable()
3592   Idx ndests; /* Number of the destinations from `state'.  */  in group_nodes_into_DFAstates()  local
3596   ndests = 0;  in group_nodes_into_DFAstates()
3702       for (j = 0; j < ndests; ++j)  in group_nodes_into_DFAstates()
3733 	      bitset_copy (dests_ch[ndests], remains);  in group_nodes_into_DFAstates()
3735 	      err = re_node_set_init_copy (dests_node + ndests, &dests_node[j]);  in group_nodes_into_DFAstates()
3738 	      ++ndests;  in group_nodes_into_DFAstates()
3751       if (j == ndests)  in group_nodes_into_DFAstates()
3753 	  bitset_copy (dests_ch[ndests], accepts);  in group_nodes_into_DFAstates()
3754 	  err = re_node_set_init_1 (dests_node + ndests, cur_nodes->elems[i]);  in group_nodes_into_DFAstates()
3757 	  ++ndests;  in group_nodes_into_DFAstates()
3761   return ndests;  in group_nodes_into_DFAstates()
3763   for (j = 0; j < ndests; ++j)  in group_nodes_into_DFAstates()