2004-05-13 08:41:07 +02:00
|
|
|
/* Generic dominator tree walker
|
|
|
|
Copyright (C) 2003, 2004 Free Software Foundation, Inc.
|
|
|
|
Contributed by Diego Novillo <dnovillo@redhat.com>
|
|
|
|
|
|
|
|
This file is part of GCC.
|
|
|
|
|
|
|
|
GCC is free software; you can redistribute it and/or modify
|
|
|
|
it under the terms of the GNU General Public License as published by
|
|
|
|
the Free Software Foundation; either version 2, or (at your option)
|
|
|
|
any later version.
|
|
|
|
|
|
|
|
GCC is distributed in the hope that it will be useful,
|
|
|
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
|
|
GNU General Public License for more details.
|
|
|
|
|
|
|
|
You should have received a copy of the GNU General Public License
|
|
|
|
along with GCC; see the file COPYING. If not, write to
|
|
|
|
the Free Software Foundation, 59 Temple Place - Suite 330,
|
|
|
|
Boston, MA 02111-1307, USA. */
|
|
|
|
|
|
|
|
#include "config.h"
|
|
|
|
#include "system.h"
|
|
|
|
#include "coretypes.h"
|
|
|
|
#include "tm.h"
|
|
|
|
#include "tree.h"
|
|
|
|
#include "basic-block.h"
|
|
|
|
#include "tree-flow.h"
|
|
|
|
#include "domwalk.h"
|
|
|
|
#include "ggc.h"
|
|
|
|
|
|
|
|
/* This file implements a generic walker for dominator trees.
|
|
|
|
|
|
|
|
To understand the dominator walker one must first have a grasp of dominators,
|
|
|
|
immediate dominators and the dominator tree.
|
|
|
|
|
|
|
|
Dominators
|
|
|
|
A block B1 is said to dominate B2 if every path from the entry to B2 must
|
|
|
|
pass through B1. Given the dominance relationship, we can proceed to
|
|
|
|
compute immediate dominators. Note it is not important whether or not
|
|
|
|
our definition allows a block to dominate itself.
|
|
|
|
|
|
|
|
Immediate Dominators:
|
|
|
|
Every block in the CFG has no more than one immediate dominator. The
|
|
|
|
immediate dominator of block BB must dominate BB and must not dominate
|
|
|
|
any other dominator of BB and must not be BB itself.
|
|
|
|
|
|
|
|
Dominator tree:
|
|
|
|
If we then construct a tree where each node is a basic block and there
|
|
|
|
is an edge from each block's immediate dominator to the block itself, then
|
|
|
|
we have a dominator tree.
|
|
|
|
|
|
|
|
|
|
|
|
[ Note this walker can also walk the post-dominator tree, which is
|
alias.c, [...]: Fix comment typos.
* alias.c, crtstuff.c, dbxout.c, domwalk.c, domwalk.h, gcc.c,
gcse.c, global.c, lambda-code.c, loop.c, mips-tdump.c,
optabs.h, predict.c, reg-stack.c, regclass.c, sched-rgn.c,
tree-optimize.c, tree-ssa-dom.c, tree-ssa-forwprop.c,
tree-ssa-operands.c, tree-ssa-phiopt.c,
tree-ssa-threadupdate.c: Fix comment typos.
From-SVN: r87707
2004-09-18 21:47:10 +02:00
|
|
|
defined in a similar manner. i.e., block B1 is said to post-dominate
|
2004-05-13 08:41:07 +02:00
|
|
|
block B2 if all paths from B2 to the exit block must pass through
|
|
|
|
B1. ]
|
|
|
|
|
|
|
|
For example, given the CFG
|
|
|
|
|
|
|
|
1
|
|
|
|
|
|
|
|
|
2
|
|
|
|
/ \
|
|
|
|
3 4
|
|
|
|
/ \
|
|
|
|
+---------->5 6
|
|
|
|
| / \ /
|
|
|
|
| +--->8 7
|
|
|
|
| | / |
|
|
|
|
| +--9 11
|
|
|
|
| / |
|
|
|
|
+--- 10 ---> 12
|
|
|
|
|
|
|
|
|
|
|
|
We have a dominator tree which looks like
|
|
|
|
|
|
|
|
1
|
|
|
|
|
|
|
|
|
2
|
|
|
|
/ \
|
|
|
|
/ \
|
|
|
|
3 4
|
|
|
|
/ / \ \
|
|
|
|
| | | |
|
|
|
|
5 6 7 12
|
|
|
|
| |
|
|
|
|
8 11
|
|
|
|
|
|
|
|
|
9
|
|
|
|
|
|
|
|
|
10
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
The dominator tree is the basis for a number of analysis, transformation
|
|
|
|
and optimization algorithms that operate on a semi-global basis.
|
|
|
|
|
|
|
|
The dominator walker is a generic routine which visits blocks in the CFG
|
|
|
|
via a depth first search of the dominator tree. In the example above
|
|
|
|
the dominator walker might visit blocks in the following order
|
|
|
|
1, 2, 3, 4, 5, 8, 9, 10, 6, 7, 11, 12.
|
|
|
|
|
|
|
|
The dominator walker has a number of callbacks to perform actions
|
|
|
|
during the walk of the dominator tree. There are two callbacks
|
|
|
|
which walk statements, one before visiting the dominator children,
|
|
|
|
one after visiting the dominator children. There is a callback
|
|
|
|
before and after each statement walk callback. In addition, the
|
|
|
|
dominator walker manages allocation/deallocation of data structures
|
|
|
|
which are local to each block visited.
|
|
|
|
|
|
|
|
The dominator walker is meant to provide a generic means to build a pass
|
|
|
|
which can analyze or transform/optimize a function based on walking
|
|
|
|
the dominator tree. One simply fills in the dominator walker data
|
|
|
|
structure with the appropriate callbacks and calls the walker.
|
|
|
|
|
|
|
|
We currently use the dominator walker to prune the set of variables
|
|
|
|
which might need PHI nodes (which can greatly improve compile-time
|
|
|
|
performance in some cases).
|
|
|
|
|
|
|
|
We also use the dominator walker to rewrite the function into SSA form
|
|
|
|
which reduces code duplication since the rewriting phase is inherently
|
|
|
|
a walk of the dominator tree.
|
|
|
|
|
|
|
|
And (of course), we use the dominator walker to drive a our dominator
|
|
|
|
optimizer, which is a semi-global optimizer.
|
|
|
|
|
|
|
|
TODO:
|
|
|
|
|
|
|
|
Walking statements is based on the block statement iterator abstraction,
|
|
|
|
which is currently an abstraction over walking tree statements. Thus
|
|
|
|
the dominator walker is currently only useful for trees. */
|
|
|
|
|
|
|
|
/* Recursively walk the dominator tree.
|
|
|
|
|
|
|
|
WALK_DATA contains a set of callbacks to perform pass-specific
|
|
|
|
actions during the dominator walk as well as a stack of block local
|
|
|
|
data maintained during the dominator walk.
|
|
|
|
|
|
|
|
BB is the basic block we are currently visiting. */
|
|
|
|
|
|
|
|
void
|
|
|
|
walk_dominator_tree (struct dom_walk_data *walk_data, basic_block bb)
|
|
|
|
{
|
|
|
|
void *bd = NULL;
|
|
|
|
basic_block dest;
|
|
|
|
block_stmt_iterator bsi;
|
|
|
|
|
|
|
|
/* Callback to initialize the local data structure. */
|
|
|
|
if (walk_data->initialize_block_local_data)
|
|
|
|
{
|
|
|
|
bool recycled;
|
|
|
|
|
|
|
|
/* First get some local data, reusing any local data pointer we may
|
|
|
|
have saved. */
|
|
|
|
if (VARRAY_ACTIVE_SIZE (walk_data->free_block_data) > 0)
|
|
|
|
{
|
|
|
|
bd = VARRAY_TOP_GENERIC_PTR (walk_data->free_block_data);
|
|
|
|
VARRAY_POP (walk_data->free_block_data);
|
|
|
|
recycled = 1;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
bd = xcalloc (1, walk_data->block_local_data_size);
|
|
|
|
recycled = 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Push the local data into the local data stack. */
|
|
|
|
VARRAY_PUSH_GENERIC_PTR (walk_data->block_data_stack, bd);
|
|
|
|
|
|
|
|
/* Call the initializer. */
|
|
|
|
walk_data->initialize_block_local_data (walk_data, bb, recycled);
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Callback for operations to execute before we have walked the
|
|
|
|
dominator children, but before we walk statements. */
|
|
|
|
if (walk_data->before_dom_children_before_stmts)
|
|
|
|
(*walk_data->before_dom_children_before_stmts) (walk_data, bb);
|
|
|
|
|
|
|
|
/* Statement walk before walking dominator children. */
|
|
|
|
if (walk_data->before_dom_children_walk_stmts)
|
|
|
|
{
|
|
|
|
if (walk_data->walk_stmts_backward)
|
|
|
|
for (bsi = bsi_last (bb); !bsi_end_p (bsi); bsi_prev (&bsi))
|
|
|
|
(*walk_data->before_dom_children_walk_stmts) (walk_data, bb, bsi);
|
|
|
|
else
|
|
|
|
for (bsi = bsi_start (bb); !bsi_end_p (bsi); bsi_next (&bsi))
|
|
|
|
(*walk_data->before_dom_children_walk_stmts) (walk_data, bb, bsi);
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Callback for operations to execute before we have walked the
|
|
|
|
dominator children, and after we walk statements. */
|
|
|
|
if (walk_data->before_dom_children_after_stmts)
|
|
|
|
(*walk_data->before_dom_children_after_stmts) (walk_data, bb);
|
|
|
|
|
|
|
|
/* Recursively call ourselves on the dominator children of BB. */
|
|
|
|
for (dest = first_dom_son (walk_data->dom_direction, bb);
|
|
|
|
dest;
|
|
|
|
dest = next_dom_son (walk_data->dom_direction, dest))
|
|
|
|
{
|
|
|
|
/* The destination block may have become unreachable, in
|
|
|
|
which case there's no point in optimizing it. */
|
backport: basic-block.h: Include vec.h, errors.h.
2004-09-24 Ben Elliston <bje@au.ibm.com>
Steven Bosscher <stevenb@suse.de>
Andrew Pinski <pinskia@physics.uc.edu>
Merge from edge-vector-branch:
* basic-block.h: Include vec.h, errors.h. Instantiate a VEC(edge).
(struct edge_def): Remove pred_next, succ_next members.
(struct basic_block_def): Remove pred, succ members. Add preds
and succs members of type VEC(edge).
(FALLTHRU_EDGE): Redefine using EDGE_SUCC.
(BRANCH_EDGE): Likewise.
(EDGE_CRITICAL_P): Redefine using EDGE_COUNT.
(EDGE_COUNT, EDGE_I, EDGE_PRED, EDGE_SUCC): New.
(edge_iterator): New.
(ei_start, ei_last, ei_end_p, ei_one_before_end_p): New.
(ei_next, ei_prev, ei_edge, ei_safe_edge): Likewise.
(FOR_EACH_EDGE): New.
* bb-reorder.c (find_traces): Use FOR_EACH_EDGE and EDGE_* macros
where applicable.
(rotate_loop): Likewise.
(find_traces_1_route): Likewise.
(bb_to_key): Likewise.
(connect_traces): Likewise.
(copy_bb_p): Likewise.
(find_rarely_executed_basic_blocks_and_crossing_edges): Likewise.
(add_labels_and_missing_jumps): Likewise.
(fix_up_fall_thru_edges): Likewise.
(find_jump_block): Likewise.
(fix_crossing_conditional_branches): Likewise.
(fix_crossing_unconditional_branches): Likewise.
(add_reg_crossing_jump_notes): Likewise.
* bt-load.c (augment_live_range): Likewise.
* cfg.c (clear_edges): Likewise.
(unchecked_make_edge): Likewise.
(cached_make_edge): Likewise.
(make_single_succ_edge): Likewise.
(remove_edge): Likewise.
(redirect_edge_succ_nodup): Likewise.
(check_bb_profile): Likewise.
(dump_flow_info): Likewise.
(alloc_aux_for_edges): Likewise.
(clear_aux_for_edges): Likewise.
(dump_cfg_bb_info): Likewise.
* cfganal.c (forwarder_block_p): Likewise.
(can_fallthru): Likewise.
(could_fall_through): Likewise.
(mark_dfs_back_edges): Likewise.
(set_edge_can_fallthru_flag): Likewise.
(find_unreachable_blocks): Likewise.
(create_edge_list): Likewise.
(verify_edge_list): Likewise.
(add_noreturn_fake_exit_edges): Likewise.
(connect_infinite_loops_to_exit): Likewise.
(flow_reverse_top_sort_order_compute): Likewise.
(flow_depth_first_order_compute): Likewise.
(flow_preorder_transversal_compute): Likewise.
(flow_dfs_compute_reverse_execute): Likewise.
(dfs_enumerate_from): Likewise.
(compute_dominance_frontiers_1): Likewise.
* cfgbuild.c (make_edges): Likewise.
(compute_outgoing_frequencies): Likewise.
(find_many_sub_basic_blocks): Likewise.
(find_sub_basic_blocks): Likewise.
* cfgcleanup.c (try_simplify_condjump): Likewise.
(thread_jump): Likewise.
(try_forward_edges): Likewise.
(merge_blocks_move): Likewise.
(outgoing_edges_match): Likewise.
(try_crossjump_to_edge): Likewise.
(try_crossjump_bb): Likewise.
(try_optimize_cfg): Likewise.
(merge_seq_blocks): Likewise.
* cfgexpand.c (expand_gimple_tailcall): Likewise.
(expand_gimple_basic_block): Likewise.
(construct_init_block): Likewise.
(construct_exit_block): Likewise.
* cfghooks.c (verify_flow_info): Likewise.
(dump_bb): Likewise.
(delete_basic_block): Likewise.
(split_edge): Likewise.
(merge_blocks): Likewise.
(make_forwarder_block): Likewise.
(tidy_fallthru_edges): Likewise.
(can_duplicate_block_p): Likewise.
(duplicate_block): Likewise.
* cfglayout.c (fixup_reorder_chain): Likewise.
(fixup_fallthru_exit_predecessor): Likewise.
(can_copy_bbs_p): Likewise.
(copy_bbs): Likewise.
* cfgloop.c (flow_loops_cfg_dump): Likewise.
(flow_loop_entry_edges_find): Likewise.
(flow_loop_exit_edges_find): Likewise.
(flow_loop_nodes_find): Likewise.
(mark_single_exit_loops): Likewise.
(flow_loop_pre_header_scan): Likewise.
(flow_loop_pre_header_find): Likewise.
(update_latch_info): Likewise.
(canonicalize_loop_headers): Likewise.
(flow_loops_find): Likewise.
(get_loop_body_in_bfs_order): Likewise.
(get_loop_exit_edges): Likewise.
(num_loop_branches): Likewise.
(verify_loop_structure): Likewise.
(loop_latch_edge): Likewise.
(loop_preheader_edge): Likewise.
* cfgloopanal.c (mark_irreducible_loops): Likewise.
(expected_loop_iterations): Likewise.
* cfgloopmanip.c (remove_bbs): Likewise.
(fix_bb_placement): Likewise.
(fix_irreducible_loops): Likewise.
(remove_path): Likewise.
(scale_bbs_frequencies): Likewise.
(loopify): Likewise.
(unloop): Likewise.
(fix_loop_placement): Likewise.
(loop_delete_branch_edge): Likewise.
(duplicate_loop_to_header_edge): Likewise.
(mfb_keep_just): Likewise.
(create_preheader): Likewise.
(force_single_succ_latches): Likewise.
(loop_split_edge_with): Likewise.
(create_loop_notes): Likewise.
* cfgrtl.c (rtl_split_block): Likewise.
(rtl_merge_blocks): Likewise.
(rtl_can_merge_blocks): Likewise.
(try_redirect_by_replacing_jump): Likewise.
(force_nonfallthru_and_redirect): Likewise.
(rtl_tidy_fallthru_edge): Likewise.
(commit_one_edge_insertion): Likewise.
(commit_edge_insertions): Likewise.
(commit_edge_insertions_watch_calls): Likewise.
(rtl_verify_flow_info_1): Likewise.
(rtl_verify_flow_info): Likewise.
(purge_dead_edges): Likewise.
(cfg_layout_redirect_edge_and_branch): Likewise.
(cfg_layout_can_merge_blocks_p): Likewise.
(rtl_flow_call_edges_add): Likewise.
* cse.c (cse_cc_succs): Likewise.
* df.c (hybrid_search): Likewise.
* dominance.c (calc_dfs_tree_nonrec): Likewise.
(calc_dfs_tree): Likewise.
(calc_idoms): Likewise.
(recount_dominator): Likewise.
* domwalk.c (walk_dominator_tree): Likewise.
* except.c (emit_to_new_bb_before): Likewise.
(connect_post_landing_pads): Likewise.
(sjlj_emit_function_enter): Likewise.
(sjlj_emit_function_exit): Likewise.
(finish_eh_generation): Likewise.
* final.c (compute_alignments): Likewise.
* flow.c (calculate_global_regs_live): Likewise.
(initialize_uninitialized_subregs): Likewise.
(init_propagate_block_info): Likewise.
* function.c (thread_prologue_and_epilogue_insns): Likewise.
* gcse.c (find_implicit_sets): Likewise.
(bypass_block): Likewise.
(bypass_conditional_jumps): Likewise.
(compute_pre_data): Likewise.
(insert_insn_end_bb): Likewise.
(insert_store): Likewise.
(remove_reachable_equiv_notes): Likewise.
* global.c (global_conflicts): Likewise.
(calculate_reg_pav): Likewise.
* graph.c (print_rtl_graph_with_bb): Likewise.
* ifcvt.c (mark_loop_exit_edges): Likewise.
(merge_if_block): Likewise.
(find_if_header): Likewise.
(block_jumps_and_fallthru_p): Likewise.
(find_if_block): Likewise.
(find_cond_trap): Likewise.
(block_has_only_trap): Likewise.
(find_if_case1): Likewise.
(find_if_case_2): Likewise.
* lambda-code.c (lambda_loopnest_to_gcc_loopnest): Likewise.
(perfect_nestify): Likewise.
* lcm.c (compute_antinout_edge): Likewise.
(compute_laterin): Likewise.
(compute_available): Likewise.
(compute_nearerout): Likewise.
* loop-doloop.c (doloop_modify): Likewise.
* loop-init.c (loop_optimizer_init): Likewise.
* loop-invariant.c (find_exits): Likewise.
* loop-iv.c (simplify_using_initial_values): Likewise.
(check_simple_exit): Likewise.
(find_simple_exit): Likewise.
* loop-unroll.c (peel_loop_completely): Likewise.
(unroll_loop_constant_iterations): Likewise.
(unroll_loop_runtime_iterations): Likewise.
* loop-unswitch.c (may_unswitch_on): Likewise.
(unswitch_loop): Likewise.
* modulo-sched.c (generate_prolog_epilog): Likewise.
(sms_schedule): Likewise.
* postreload-gcse.c (eliminate_partially_redundant_load):
Likewise.
* predict.c (can_predict_insn_p): Likewise.
(set_even_probabilities): Likewise.
(combine_predictions_for_bb): Likewise.
(predict_loops): Likewise.
(estimate_probability): Likewise.
(tree_predict_by_opcode): Likewise.
(tree_estimate_probability): Likewise.
(last_basic_block_p): Likewise.
(propagate_freq): Likewise.
(estimate_loops_at_level): Likewise.
(estimate_bb_frequencies): Likewise.
* profile.c (instrument_edges): Likewise.
(get_exec_counts): Likewise.
(compute_branch_probabilities): Likewise.
(branch_prob): Likewise.
* ra-build.c (live_in): Likewise.
* ra-rewrite.c (rewrite_program2): Likewise.
* ra.c (reg_alloc): Likewise.
* reg-stack.c (reg_to_stack): Likewise.
(convert_regs_entry): Likewise.
(compensate_edge): Likewise.
(convert_regs_1): Likewise,
(convert_regs_2): Likewise.
(convert_regs): Likewise.
* regrename.c (copyprop_hardreg_forward): Likewise.
* reload1.c (fixup_abnormal_edges): Likewise.
* sbitmap.c (sbitmap_intersection_of_succs): Likewise.
(sbitmap_insersection_of_preds): Likewise.
(sbitmap_union_of_succs): Likewise.
(sbitmap_union_of_preds): Likewise.
* sched-ebb.c (compute_jump_reg_dependencies): Likewise.
(fix_basic_block_boundaries): Likewise.
(sched_ebbs): Likewise.
* sched-rgn.c (build_control_flow): Likewise.
(find_rgns): Likewise.
* tracer.c (find_best_successor): Likewise.
(find_best_predecessor): Likewise.
(tail_duplicate): Likewise.
* tree-cfg.c (make_edges): Likewise.
(make_ctrl_stmt_edges): Likewise.
(make_goto_expr_edges): Likewise.
(tree_can_merge_blocks_p): Likewise.
(tree_merge_blocks): Likewise.
(cfg_remove_useless_stmts_bb): Likewise.
(remove_phi_nodes_and_edges_for_unreachable_block): Likewise.
(tree_block_forwards_to): Likewise.
(cleanup_control_expr_graph): Likewise.
(find_taken_edge): Likewise.
(dump_cfg_stats): Likewise.
(tree_cfg2vcg): Likewise.
(disband_implicit_edges): Likewise.
(tree_find_edge_insert_loc): Likewise.
(bsi_commit_edge_inserts): Likewise.
(tree_split_edge): Likewise.
(tree_verify_flow_info): Likewise.
(tree_make_forwarder_block): Likewise.
(tree_forwarder_block_p): Likewise.
(thread_jumps): Likewise.
(tree_try_redirect_by_replacing_jump): Likewise.
(tree_split_block): Likewise.
(add_phi_args_after_copy_bb): Likewise.
(rewrite_to_new_ssa_names_bb): Likewise.
(dump_function_to_file): Likewise.
(print_pred_bbs): Likewise.
(print_loop): Likewise.
(tree_flow_call_edges_add): Likewise.
(split_critical_edges): Likewise.
(execute_warn_function_return): Likewise.
(extract_true_false_edges_from_block): Likewise.
* tree-if-conv.c (tree_if_conversion): Likewise.
(if_convertable_bb_p): Likewise.
(find_phi_replacement_condition): Likewise.
(combine_blocks): Likewise.
* tree-into-ssa.c (compute_global_livein): Likewise.
(ssa_mark_phi_uses): Likewise.
(ssa_rewrite_initialize_block): Likewise.
(rewrite_add_phi_arguments): Likewise.
(ssa_rewrite_phi_arguments): Likewise.
(insert_phi_nodes_for): Likewise.
(rewrite_into_ssa): Likewise.
(rewrite_ssa_into_ssa): Likewise.
* tree-mudflap.c (mf_build_check_statement_for): Likewise.
* tree-outof-ssa.c (coalesce_abnormal_edges): Likewise.
(rewrite_trees): Likewise.
* tree-pretty-print.c (dump_bb_header): Likewise.
(dump_implicit_edges): Likewise.
* tree-sra.c (insert_edge_copies): Likewise.
(find_obviously_necessary_stmts): Likewise.
(remove_data_stmt): Likewise.
* tree-ssa-dom.c (thread_across_edge): Likewise.
(dom_opt_finalize_block): Likewise.
(single_incoming_edge_ignoring_loop_edges): Likewise.
(record_equivalences_from_incoming_edges): Likewise.
(cprop_into_successor_phis): Likewise.
* tree-ssa-live.c (live_worklist): Likewise.
(calculate_live_on_entry): Likewise.
(calculate_live_on_exit): Likewise.
* tree-ssa-loop-ch.c (should_duplicate_loop_header_p): Likewise.
(copy_loop_headers): Likewise.
* tree-ssa-loop-im.c (loop_commit_inserts): Likewise.
(fill_always_executed_in): Likewise.
* tree-ssa-loop-ivcanon.c (create_canonical_iv): Likewise.
* tree-ssa-loop-ivopts.c (find_interesting_uses): Likewise.
(compute_phi_arg_on_exit): Likewise.
* tree-ssa-loop-manip.c (add_exit_phis_edge): Likewise.
(get_loops_exit): Likewise.
(split_loop_exit_edge): Likewise.
(ip_normal_pos): Likewise.
* tree-ssa-loop-niter.c (simplify_using_initial_conditions):
Likewise.
* tree-ssa-phiopt.c (candidate_bb_for_phi_optimization): Likewise.
(replace_phi_with_stmt): Likewise.
(value_replacement): Likewise.
* tree-ssa-pre.c (compute_antic_aux): Likewise.
(insert_aux): Likewise.
(init_pre): Likewise.
* tree-ssa-propagate.c (simulate_stmt): Likewise.
(simulate_block): Likewise.
(ssa_prop_init): Likewise.
* tree-ssa-threadupdate.c (thread_block): Likewise.
(create_block_for_threading): Likewise.
(remove_last_stmt_and_useless_edges): Likewise.
* tree-ssa.c (verify_phi_args): Likewise.
(verify_ssa): Likewise.
* tree_tailcall.c (independent_of_stmt_p): Likewise.
(find_tail_calls): Likewise.
(eliminate_tail_call): Likewise.
(tree_optimize_tail_calls_1): Likewise.
* tree-vectorizer.c (vect_transform_loop): Likewise.
* var-tracking.c (prologue_stack_adjust): Likewise.
(vt_stack_adjustments): Likewise.
(vt_find_locations): Likewise.
* config/frv/frv.c (frv_ifcvt_modify_tests): Likewise.
* config/i386/i386.c (ix86_pad_returns): Likewise.
* config/ia64/ia64.c (ia64_expand_prologue): Likewise.
* config/rs6000/rs6000.c (rs6000_emit_prologue): Likewise.
Co-Authored-By: Andrew Pinski <pinskia@physics.uc.edu>
Co-Authored-By: Steven Bosscher <stevenb@suse.de>
From-SVN: r88222
2004-09-28 09:59:54 +02:00
|
|
|
if (EDGE_COUNT (dest->preds) > 0)
|
2004-05-13 08:41:07 +02:00
|
|
|
walk_dominator_tree (walk_data, dest);
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Callback for operations to execute after we have walked the
|
|
|
|
dominator children, but before we walk statements. */
|
|
|
|
if (walk_data->after_dom_children_before_stmts)
|
|
|
|
(*walk_data->after_dom_children_before_stmts) (walk_data, bb);
|
|
|
|
|
|
|
|
/* Statement walk after walking dominator children. */
|
|
|
|
if (walk_data->after_dom_children_walk_stmts)
|
|
|
|
{
|
|
|
|
if (walk_data->walk_stmts_backward)
|
|
|
|
for (bsi = bsi_last (bb); !bsi_end_p (bsi); bsi_prev (&bsi))
|
|
|
|
(*walk_data->after_dom_children_walk_stmts) (walk_data, bb, bsi);
|
|
|
|
else
|
|
|
|
for (bsi = bsi_start (bb); !bsi_end_p (bsi); bsi_next (&bsi))
|
|
|
|
(*walk_data->after_dom_children_walk_stmts) (walk_data, bb, bsi);
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Callback for operations to execute after we have walked the
|
|
|
|
dominator children and after we have walked statements. */
|
|
|
|
if (walk_data->after_dom_children_after_stmts)
|
|
|
|
(*walk_data->after_dom_children_after_stmts) (walk_data, bb);
|
|
|
|
|
|
|
|
if (walk_data->initialize_block_local_data)
|
|
|
|
{
|
|
|
|
/* And save the block data so that we can re-use it. */
|
|
|
|
VARRAY_PUSH_GENERIC_PTR (walk_data->free_block_data, bd);
|
|
|
|
|
|
|
|
/* And finally pop the record off the block local data stack. */
|
|
|
|
VARRAY_POP (walk_data->block_data_stack);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
void
|
|
|
|
init_walk_dominator_tree (struct dom_walk_data *walk_data)
|
|
|
|
{
|
|
|
|
if (walk_data->initialize_block_local_data)
|
|
|
|
{
|
|
|
|
VARRAY_GENERIC_PTR_INIT (walk_data->free_block_data, 2, "freelist ");
|
|
|
|
VARRAY_GENERIC_PTR_INIT (walk_data->block_data_stack, 2, "block_data");
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
walk_data->free_block_data = NULL;
|
|
|
|
walk_data->block_data_stack = NULL;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
void
|
|
|
|
fini_walk_dominator_tree (struct dom_walk_data *walk_data)
|
|
|
|
{
|
|
|
|
if (walk_data->initialize_block_local_data)
|
|
|
|
{
|
|
|
|
while (VARRAY_ACTIVE_SIZE (walk_data->free_block_data) > 0)
|
|
|
|
{
|
|
|
|
free (VARRAY_TOP_GENERIC_PTR (walk_data->free_block_data));
|
|
|
|
VARRAY_POP (walk_data->free_block_data);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|