diff options
| author | Richard Guenther <rguenther@suse.de> | 2012-08-13 13:49:54 +0000 |
|---|---|---|
| committer | Richard Biener <rguenth@gcc.gnu.org> | 2012-08-13 13:49:54 +0000 |
| commit | 391886c8e0153d41b3ab4daf4d2dd1d923d9c50f (patch) | |
| tree | c9e7c894d3f7d2eaf1bfddbb370a7e8c883063c2 /gcc/tree-ssa-sink.c | |
| parent | 9006f7f325461dff15a5adaa577b36b789eab2a0 (diff) | |
| download | gcc-391886c8e0153d41b3ab4daf4d2dd1d923d9c50f.zip gcc-391886c8e0153d41b3ab4daf4d2dd1d923d9c50f.tar.gz gcc-391886c8e0153d41b3ab4daf4d2dd1d923d9c50f.tar.bz2 | |
basic-block.h (struct basic_block): Remove loop_depth member, move flags and index members next to each other.
2012-08-13 Richard Guenther <rguenther@suse.de>
* basic-block.h (struct basic_block): Remove loop_depth
member, move flags and index members next to each other.
* cfgloop.h (bb_loop_depth): New inline function.
* cfghooks.c (split_block): Do not set loop_depth.
(duplicate_block): Likewise.
* cfgloop.c (flow_loop_nodes_find): Likewise.
(flow_loops_find): Likewise.
(add_bb_to_loop): Likewise.
(remove_bb_from_loops): Likewise.
* cfgrtl.c (force_nonfallthru_and_redirect): Likewise.
* gimple-streamer-in.c (input_bb): Do not stream loop_depth.
* gimple-streamer-out.c (output_bb): Likewise.
* bt-load.c: Include cfgloop.h.
(migrate_btr_defs): Use bb_loop_depth.
* cfg.c (dump_bb_info): Likewise.
* final.c (compute_alignments): Likewise.
* ira.c (update_equiv_regs): Likewise.
* tree-ssa-copy.c (init_copy_prop): Likewise.
* tree-ssa-dom.c (loop_depth_of_name): Likewise.
* tree-ssa-forwprop.c: Include cfgloop.h.
(forward_propagate_addr_expr): Use bb_loop_depth.
* tree-ssa-pre.c (insert_into_preds_of_block): Likewise.
* tree-ssa-sink.c (select_best_block): Likewise.
* ipa-inline-analysis.c: Include cfgloop.h.
(estimate_function_body_sizes): Use bb_loop_depth.
* Makefile.in (tree-ssa-forwprop.o): Depend on $(CFGLOOP_H).
(ipa-inline-analysis.o): Likewise.
(bt-load.o): Likewise.
* gcc.dg/tree-prof/update-loopch.c: Adjust.
From-SVN: r190346
Diffstat (limited to 'gcc/tree-ssa-sink.c')
| -rw-r--r-- | gcc/tree-ssa-sink.c | 6 |
1 files changed, 3 insertions, 3 deletions
diff --git a/gcc/tree-ssa-sink.c b/gcc/tree-ssa-sink.c index b5495e7..2d2c370 100644 --- a/gcc/tree-ssa-sink.c +++ b/gcc/tree-ssa-sink.c @@ -212,7 +212,7 @@ select_best_block (basic_block early_bb, { /* If we've moved into a lower loop nest, then that becomes our best block. */ - if (temp_bb->loop_depth < best_bb->loop_depth) + if (bb_loop_depth (temp_bb) < bb_loop_depth (best_bb)) best_bb = temp_bb; /* Walk up the dominator tree, hopefully we'll find a shallower @@ -223,7 +223,7 @@ select_best_block (basic_block early_bb, /* If we found a shallower loop nest, then we always consider that a win. This will always give us the most control dependent block within that loop nest. */ - if (best_bb->loop_depth < early_bb->loop_depth) + if (bb_loop_depth (best_bb) < bb_loop_depth (early_bb)) return best_bb; /* Get the sinking threshold. If the statement to be moved has memory @@ -239,7 +239,7 @@ select_best_block (basic_block early_bb, /* If BEST_BB is at the same nesting level, then require it to have significantly lower execution frequency to avoid gratutious movement. */ - if (best_bb->loop_depth == early_bb->loop_depth + if (bb_loop_depth (best_bb) == bb_loop_depth (early_bb) && best_bb->frequency < (early_bb->frequency * threshold / 100.0)) return best_bb; |