| /src/external/gpl3/gcc/dist/gcc/ |
| tree-ssa-loop-ch.cc | 443 /* Still look for invariant exits; exit may be both. */
580 Adding support for more exits can be done similarly,
649 /* All exits will happen in exit_e_copy which is out of the
1068 auto_vec<edge> exits = get_loop_exit_edges (loop); local
1069 bool precise = (nexits == (int) exits.length ());
1124 "Peeled all exits:"
1133 "Peeled likely exits: likely decreased number "
1140 " of iterations of loop %d; likely exits remains.\n",
1240 /* The vectorizer won't handle anything with multiple exits, so skip. */
|
| tree-ssa-propagate.cc | 1236 /* Check exits of each loop in FUN, walk over loop closed PHIs in
1247 /* Avoid possibly quadratic work when scanning for loop exits across
1260 auto_vec<edge> exits = get_loop_exit_edges (loop); local
1261 for (edge e : exits)
|
| cfgloop.cc | 188 for (exit = loop->exits->next; exit != loop->exits; exit = next)
195 ggc_free (loop->exits);
345 loop->exits = ggc_cleared_alloc<loop_exit> ();
346 loop->exits->next = loop->exits->prev = loop->exits;
433 /* Ensure that loop exits were released. */
434 gcc_assert (loops->exits == NULL);
1063 return current_loops->exits->find_with_hash (e, htab_hash_pointer (e))
1074 struct loop_exit *exits = NULL, *exit; local
[all...] |
| cfgloop.h | 81 /* Previous and next exit in the list of the exits of the loop. */
85 /* Next element in the list of loops from that E exits. */
267 /* Head of the cyclic list of the exits of the loop. */
268 struct loop_exit *exits; variable in typeref:struct:loop_exit
331 /* Maps edges to the list of their descriptions as loop exits. Edges
333 happen during the cfg manipulations) should not appear in EXITS. */
334 hash_table<loop_exit_hasher> *GTY(()) exits;
562 return loop->exits->next->e != NULL;
|
| cfgloopmanip.cc | 130 auto_vec<edge> exits = get_loop_exit_edges (loop); local
134 FOR_EACH_VEC_ELT (exits, i, e)
148 /* The exit edges of LOOP no longer exits its original immediate
150 FOR_EACH_VEC_ELT (exits, i, e)
537 auto_vec<edge> exits = get_loop_exit_edges (loop); local
538 exit_edge = single_likely_exit (loop, exits);
1284 /* Since we will scale up all basic blocks dominated by orig, exits
1288 auto_vec<edge> exits = get_loop_exit_edges (loop); local
1289 for (edge ex : exits)
|
| tree-ssa-loop-ivcanon.cc | 499 auto_vec<edge> exits = get_loop_exit_edges (loop);
501 FOR_EACH_VEC_ELT (exits, i, edge_to_cancel)
534 /* Remove all tests for exits that are known to be taken after LOOP was
592 /* Remove all exits that are known to be never taken because of the loop bound
1185 /* Duplicate possibly eliminating the exits. */
1282 auto_vec<edge> exits = get_loop_exit_edges (loop); local
1284 exit == single_likely_exit (loop, exits), true);
1287 /* Force re-computation of loop bounds so we can remove redundant exits. */
1310 /* Remove exits that are known to be never taken based on loop bound.
1548 loop_exit *exit = father->exits->next
[all...] |
| tree-vectorizer.cc | 1389 auto_vec<edge> exits = get_loop_exit_edges (loop);
1390 for (edge exit : exits)
1387 auto_vec<edge> exits = get_loop_exit_edges (loop); local
|
| ipa-fnsummary.cc | 3056 auto_vec<edge> exits = get_loop_exit_edges (loop); local
3057 FOR_EACH_VEC_ELT (exits, j, ex)
|
| predict.cc | 1844 /* Predict for extra loop exits that will lead to EXIT_EDGE. The extra loop
1845 exits are resulted from short-circuit conditions that will generate an
1869 exits. This function takes BB7->BB8 as input, and finds out the extra loop
1870 exits to predict them using PRED_LOOP_EXTRA_EXIT. */
1973 auto_vec<edge> exits = get_loop_exit_edges (loop); local
1974 FOR_EACH_VEC_ELT (exits, j, ex)
1981 fprintf (dump_file, "Predicting loop %i%s with %i exits.\n",
1997 FOR_EACH_VEC_ELT (exits, j, ex)
2136 /* For loop with many exits we don't want to predict all exits
[all...] |
| tree-predcom.cc | 875 auto_vec<edge> exits = get_loop_exit_edges (loop); local
879 FOR_EACH_VEC_ELT (exits, i, ex)
|
| tree-ssa-loop-im.cc | 2268 Exits from the LOOP are stored in EXITS. The initialization of the
2270 to the reference from the temporary variable are emitted to exits. */
2492 (but we can't easily cache for different exits?). */
2704 /* Hoists memory references MEM_REFS out of LOOP. EXITS is the list of exit
2709 const vec<edge> &exits)
2733 for (edge e : exits)
2819 /* Materialize ordered store sequences on exits. */
2821 FOR_EACH_VEC_ELT (exits, i, e)
2855 loop exits. *
3302 auto_vec<edge> exits = get_loop_exit_edges (loop); local
[all...] |
| tree-ssa-loop-niter.cc | 1034 which the loop exits immediately, and the iv does not overflow.
1908 /* If the loop exits immediately, there is nothing to do. */
3266 auto_vec<edge> exits = get_loop_exit_edges (loop); local
3272 FOR_EACH_VEC_ELT (exits, i, ex)
3332 auto_vec<edge> exits = get_loop_exit_edges (loop); local
3336 FOR_EACH_VEC_ELT (exits, i, ex)
3519 /* Tries to count the number of iterations of LOOP till it exits by EXIT
3619 /* Finds the exit of the LOOP by that the loop exits after a constant
3630 auto_vec<edge> exits = get_loop_exit_edges (loop); local
3636 /* Loops with multiple exits are expensive to handle and less important. *
4825 auto_vec<edge> exits = get_loop_exit_edges (loop, body); local
[all...] |
| sel-sched-ir.h | 1014 /* If skip to loop exits, save here information about loop exits. */
1091 for (exit = loop->exits->next; exit->e; exit = exit->next)
1131 /* Collect all loop exits recursively, skipping empty BBs between them.
1132 E.g. if BB is a loop header which has several loop exits,
1134 (after skipping empty BBs), add its loop exits to the resulting vector
1139 vec<edge> exits = vNULL;
1141 /* If bb is empty, and we're skipping to loop exits, then
1170 exits = get_loop_exit_edges_unique_dests (this_loop);
1175 for (i = 0; exits.iterate (i, &e); i++
1128 vec<edge> exits = vNULL; local
[all...] |
| tree-cfg.cc | 6910 edge exits[2], nexits[2], e; local
6917 exits[0] = exit;
6918 exits[1] = EDGE_SUCC (exit->src, EDGE_SUCC (exit->src, 0) == exit);
6956 copy_bbs (region, n_region, region_copy, exits, 2, nexits, orig_loop,
6984 sorig->flags = exits[1]->flags;
6985 sorig->probability = exits[1]->probability;
6986 snew = make_edge (switch_bb, nentry_bb, exits[0]->flags);
6987 snew->probability = exits[0]->probability;
7000 e = redirect_edge_and_branch (exits[0], exits[1]->dest)
[all...] |
| /src/external/gpl3/gcc.old/dist/gcc/ |
| tree-ssa-loop-ivcanon.cc | 454 auto_vec<edge> exits = get_loop_exit_edges (loop);
456 FOR_EACH_VEC_ELT (exits, i, edge_to_cancel)
489 /* Remove all tests for exits that are known to be taken after LOOP was
548 /* Remove all exits that are known to be never taken because of the loop bound
1083 /* Duplicate possibly eliminating the exits. */
1222 auto_vec<edge> exits = get_loop_exit_edges (loop); local
1224 exit == single_likely_exit (loop, exits), true);
1227 /* Force re-computation of loop bounds so we can remove redundant exits. */
1250 /* Remove exits that are known to be never taken based on loop bound.
1480 loop_exit *exit = father->exits->next
[all...] |
| tree-ssa-propagate.cc | 1241 /* Check exits of each loop in FUN, walk over loop closed PHIs in
1252 /* Avoid possibly quadratic work when scanning for loop exits across
1265 auto_vec<edge> exits = get_loop_exit_edges (loop); local
1266 for (edge e : exits)
|
| cfgloop.cc | 195 for (exit = loop->exits->next; exit != loop->exits; exit = next)
202 ggc_free (loop->exits);
352 loop->exits = ggc_cleared_alloc<loop_exit> ();
353 loop->exits->next = loop->exits->prev = loop->exits;
440 /* Ensure that loop exits were released. */
441 gcc_assert (loops->exits == NULL);
1070 return current_loops->exits->find_with_hash (e, htab_hash_pointer (e))
1081 struct loop_exit *exits = NULL, *exit; local
[all...] |
| cfgloop.h | 78 /* Previous and next exit in the list of the exits of the loop. */
82 /* Next element in the list of loops from that E exits. */
264 /* Head of the cyclic list of the exits of the loop. */
265 struct loop_exit *exits; variable in typeref:struct:loop_exit
328 /* Maps edges to the list of their descriptions as loop exits. Edges
330 happen during the cfg manipulations) should not appear in EXITS. */
331 hash_table<loop_exit_hasher> *GTY(()) exits;
554 return loop->exits->next->e != NULL;
|
| cfgloopmanip.cc | 129 auto_vec<edge> exits = get_loop_exit_edges (loop); local
133 FOR_EACH_VEC_ELT (exits, i, e)
147 /* The exit edges of LOOP no longer exits its original immediate
149 FOR_EACH_VEC_ELT (exits, i, e)
|
| ipa-fnsummary.cc | 2976 auto_vec<edge> exits = get_loop_exit_edges (loop); local
2977 FOR_EACH_VEC_ELT (exits, j, ex)
|
| predict.cc | 1833 /* Predict for extra loop exits that will lead to EXIT_EDGE. The extra loop
1834 exits are resulted from short-circuit conditions that will generate an
1858 exits. This function takes BB7->BB8 as input, and finds out the extra loop
1859 exits to predict them using PRED_LOOP_EXTRA_EXIT. */
1967 auto_vec<edge> exits = get_loop_exit_edges (loop); local
1968 FOR_EACH_VEC_ELT (exits, j, ex)
1975 fprintf (dump_file, "Predicting loop %i%s with %i exits.\n",
1991 FOR_EACH_VEC_ELT (exits, j, ex)
2131 /* For loop with many exits we don't want to predict all exits
[all...] |
| tree-predcom.cc | 875 auto_vec<edge> exits = get_loop_exit_edges (loop); local
879 FOR_EACH_VEC_ELT (exits, i, ex)
|
| tree-ssa-loop-im.cc | 2217 Exits from the LOOP are stored in EXITS. The initialization of the
2219 to the reference from the temporary variable are emitted to exits. */
2441 (but we can't easily cache for different exits?). */
2653 /* Hoists memory references MEM_REFS out of LOOP. EXITS is the list of exit
2658 const vec<edge> &exits)
2682 for (edge e : exits)
2768 /* Materialize ordered store sequences on exits. */
2770 FOR_EACH_VEC_ELT (exits, i, e)
2804 loop exits. *
3251 auto_vec<edge> exits = get_loop_exit_edges (loop); local
[all...] |
| tree-ssa-loop-niter.cc | 1048 which the loop exits immediately, and the iv does not overflow.
1926 /* If the loop exits immediately, there is nothing to do. */
2865 auto_vec<edge> exits = get_loop_exit_edges (loop); local
2871 FOR_EACH_VEC_ELT (exits, i, ex)
2949 auto_vec<edge> exits = get_loop_exit_edges (loop); local
2953 FOR_EACH_VEC_ELT (exits, i, ex)
3111 /* Tries to count the number of iterations of LOOP till it exits by EXIT
3212 /* Finds the exit of the LOOP by that the loop exits after a constant
3223 auto_vec<edge> exits = get_loop_exit_edges (loop); local
3229 /* Loops with multiple exits are expensive to handle and less important. *
4391 auto_vec<edge> exits = get_loop_exit_edges (loop, body); local
[all...] |
| sel-sched-ir.h | 1014 /* If skip to loop exits, save here information about loop exits. */
1091 for (exit = loop->exits->next; exit->e; exit = exit->next)
1131 /* Collect all loop exits recursively, skipping empty BBs between them.
1132 E.g. if BB is a loop header which has several loop exits,
1134 (after skipping empty BBs), add its loop exits to the resulting vector
1139 vec<edge> exits = vNULL;
1141 /* If bb is empty, and we're skipping to loop exits, then
1170 exits = get_loop_exit_edges_unique_dests (this_loop);
1175 for (i = 0; exits.iterate (i, &e); i++
1128 vec<edge> exits = vNULL; local
[all...] |
