Searched refs:ndests (Results 1 - 2 of 2) sorted by relevance
/freebsd-9.3-release/contrib/gcc/ |
H A D | tree-eh.c | 1151 int nlabels, ndests, j, last_case_index; 1167 ndests = fallthru_index + tf->may_fallthru; 1172 case_label_vec = make_tree_vec (ndests); 1320 decide_copy_try_finally (int ndests, tree finally) 1329 f_estimate = (f_estimate + 1) * ndests; 1332 sw_estimate = 10 + 2 * ndests; 1355 int ndests; 1397 ndests = VEC_length (tree, this_tf.dest_array); 1398 ndests += this_tf.may_fallthru; 1399 ndests 1146 int nlabels, ndests, j, last_case_index; local 1315 decide_copy_try_finally(int ndests, tree finally) argument 1350 int ndests; local [all...] |
/freebsd-9.3-release/gnu/lib/libregex/ |
H A D | regexec.c | 3294 int ndests; /* Number of the destination states from `state'. */ 3325 ndests = group_nodes_into_DFAstates (dfa, state, dests_node, dests_ch); 3326 if (BE (ndests <= 0, 0)) 3331 if (ndests == 0) 3340 err = re_node_set_alloc (&follows, ndests + 1); 3346 + ndests * 3 * sizeof (re_dfastate_t *))) 3348 alloca (ndests * 3 * sizeof (re_dfastate_t *)); 3353 malloc (ndests * 3 * sizeof (re_dfastate_t *)); 3360 for (i = 0; i < ndests; ++i) 3368 dest_states_word = dest_states + ndests; 3290 int ndests; /* Number of the destination states from `state'. */ local 3517 int ndests; /* Number of the destinations from `state'. */ local [all...] |
Completed in 95 milliseconds