Searched refs:ndests (Results 1 – 2 of 2) sorted by relevance
| /trueos/contrib/gcc/ |
| HD | tree-eh.c | 1146 int nlabels, ndests, j, last_case_index; in lower_try_finally_switch() local
1162 ndests = fallthru_index + tf->may_fallthru; in lower_try_finally_switch()
1167 case_label_vec = make_tree_vec (ndests); in lower_try_finally_switch()
1315 decide_copy_try_finally (int ndests, tree finally) in decide_copy_try_finally() argument
1324 f_estimate = (f_estimate + 1) * ndests; in decide_copy_try_finally()
1327 sw_estimate = 10 + 2 * ndests; in decide_copy_try_finally()
1350 int ndests; in lower_try_finally() local
1392 ndests = VEC_length (tree, this_tf.dest_array); in lower_try_finally()
1393 ndests += this_tf.may_fallthru; in lower_try_finally()
1394 ndests += this_tf.may_return; in lower_try_finally()
[all …]
|
| /trueos/contrib/libgnuregex/ |
| HD | regexec.c | 3333 int ndests; /* Number of the destination states from `state'. */ in build_trtable() local
3367 ndests = group_nodes_into_DFAstates (dfa, state, dests_node, dests_ch); in build_trtable()
3368 if (BE (ndests <= 0, 0)) in build_trtable()
3373 if (ndests == 0) in build_trtable()
3384 err = re_node_set_alloc (&follows, ndests + 1); in build_trtable()
3391 < ndests), in build_trtable()
3396 + ndests * 3 * sizeof (re_dfastate_t *))) in build_trtable()
3398 alloca (ndests * 3 * sizeof (re_dfastate_t *)); in build_trtable()
3402 malloc (ndests * 3 * sizeof (re_dfastate_t *)); in build_trtable()
3409 for (i = 0; i < ndests; ++i) in build_trtable()
[all …]
|