diff options
| author | Zdenek Dvorak <dvorakz@suse.cz> | 2006-11-21 01:20:02 +0100 |
|---|---|---|
| committer | Zdenek Dvorak <rakdver@gcc.gnu.org> | 2006-11-21 00:20:02 +0000 |
| commit | ca83d38556d2c0ac60a369d42258fc0a39df86bf (patch) | |
| tree | 5936129bd622c7aef21ba556b43971c620090ebd /gcc/predict.c | |
| parent | c61191974ba056b73abcee46eca65cd440a2b2e2 (diff) | |
| download | gcc-ca83d38556d2c0ac60a369d42258fc0a39df86bf.zip gcc-ca83d38556d2c0ac60a369d42258fc0a39df86bf.tar.gz gcc-ca83d38556d2c0ac60a369d42258fc0a39df86bf.tar.bz2 | |
tree-ssa-loop-im.c (schedule_sm, [...]): Use vector of edges instead of array.
* tree-ssa-loop-im.c (schedule_sm, determine_lsm_ref,
hoist_memory_references, loop_suitable_for_sm, determine_lsm_loop):
Use vector of edges instead of array.
* tree-ssa-loop-niter.c (find_loop_niter, find_loop_niter_by_eval,
estimate_numbers_of_iterations_loop): Ditto.
* predict.c (predict_loops): Ditto.
* loop-unroll.c (analyze_insns_in_loop): Ditto.
* tree-ssa-threadupdate.c: Remove declaration of heap allocation for
edge vectors.
* basic-block.h: Declare heap allocation for edge vectors.
* tree-outof-ssa.c: Ditto.
* cfgloop.c (get_loop_exit_edges): Return vector of edges.
* cfgloop.h (get_loop_exit_edges): Declaration changed.
From-SVN: r119039
Diffstat (limited to 'gcc/predict.c')
| -rw-r--r-- | gcc/predict.c | 20 |
1 files changed, 10 insertions, 10 deletions
diff --git a/gcc/predict.c b/gcc/predict.c index caf867e..5e90543 100644 --- a/gcc/predict.c +++ b/gcc/predict.c @@ -640,23 +640,23 @@ predict_loops (struct loops *loops_info) for (i = 1; i < loops_info->num; i++) { basic_block bb, *bbs; - unsigned j; - unsigned n_exits; + unsigned j, n_exits; struct loop *loop = loops_info->parray[i]; - edge *exits; + VEC (edge, heap) *exits; struct tree_niter_desc niter_desc; + edge ex; - exits = get_loop_exit_edges (loop, &n_exits); + exits = get_loop_exit_edges (loop); + n_exits = VEC_length (edge, exits); - - for (j = 0; j < n_exits; j++) + for (j = 0; VEC_iterate (edge, exits, j, ex); j++) { tree niter = NULL; - if (number_of_iterations_exit (loop, exits[j], &niter_desc, false)) + if (number_of_iterations_exit (loop, ex, &niter_desc, false)) niter = niter_desc.niter; if (!niter || TREE_CODE (niter_desc.niter) != INTEGER_CST) - niter = loop_niter_by_eval (loop, exits[j]); + niter = loop_niter_by_eval (loop, ex); if (TREE_CODE (niter) == INTEGER_CST) { @@ -673,10 +673,10 @@ predict_loops (struct loops *loops_info) else probability = ((REG_BR_PROB_BASE + max / 2) / max); - predict_edge (exits[j], PRED_LOOP_ITERATIONS, probability); + predict_edge (ex, PRED_LOOP_ITERATIONS, probability); } } - free (exits); + VEC_free (edge, heap, exits); bbs = get_loop_body (loop); |