HomeSort by: relevance | last modified time | path
    Searched defs:ndests (Results 1 - 3 of 3) sorted by relevancy

  /src/external/gpl2/xcvs/dist/lib/
regexec.c 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
3303 Idx ndests; \/* Number of the destination states from `state'. *\/ local
3535 Idx ndests; \/* Number of the destinations from `state'. *\/ local
    [all...]
  /src/external/gpl3/gcc/dist/gcc/
tree-eh.cc 1366 int nlabels, ndests, j, last_case_index; local
1397 ndests = fallthru_index + tf->may_fallthru;
1405 case_label_vec.create (ndests);
1575 decide_copy_try_finally (int ndests, bool may_throw, gimple_seq finally)
1585 ndests -= may_throw;
1593 if (ndests == 1)
1611 f_estimate = (f_estimate + 1) * ndests;
1614 sw_estimate = 10 + 2 * ndests;
1661 int ndests; local
1703 ndests = this_tf.dest_array.length ()
    [all...]
  /src/external/gpl3/gcc.old/dist/gcc/
tree-eh.cc 1365 int nlabels, ndests, j, last_case_index; local
1396 ndests = fallthru_index + tf->may_fallthru;
1404 case_label_vec.create (ndests);
1574 decide_copy_try_finally (int ndests, bool may_throw, gimple_seq finally)
1584 ndests -= may_throw;
1592 if (ndests == 1)
1610 f_estimate = (f_estimate + 1) * ndests;
1613 sw_estimate = 10 + 2 * ndests;
1660 int ndests; local
1702 ndests = this_tf.dest_array.length ()
    [all...]

Completed in 19 milliseconds