diff options
author | hubicka <hubicka@138bc75d-0d04-0410-961f-82ee72b054a4> | 2002-06-20 17:51:06 +0000 |
---|---|---|
committer | hubicka <hubicka@138bc75d-0d04-0410-961f-82ee72b054a4> | 2002-06-20 17:51:06 +0000 |
commit | 89d75d78ea20e6326fb171c82a5b61ca98694329 (patch) | |
tree | 8635e8934338aabce3b83e28ee4e39d8b3df5645 /gcc/sched-rgn.c | |
parent | 0480d7803b3e4ea45f51343c7720c0f5589814e5 (diff) | |
download | gcc-89d75d78ea20e6326fb171c82a5b61ca98694329.tar.gz |
Mon Jun 10 20:42:34 CEST 2002 Jan Hubicka <jh@suse.cz>
* basic-block.h: Do not include et-forest.h
(dominance_info): Declare as struct dominance-info.
* cfglayout.c (cleanup_unconditional_jumps): Remove the edge before
deleting block.
* dominance.c (struct dominance_info): Define.
(BB_NODE, SET_BB_NODE): New macros.
(bb_hash_func, bb_eq_func): Kill.
(calculate_dominace_info, free_dominacne_info, set_immediate_dominator,
nearest_common_dominator, dominated_by_p, recount_dominator,
add_to_dominance_info, delete_from_dominance_info): update for new
representation.
(get_dominated_by, redirect_immediate_dominators): Rewrite using
enumerate_sons.
* ifcvt.c (process_double_test_block, merge_if_block, find_cond_trap,
find_if_case_1, find_if_case_2): Remove killed blocks from dominance
structure.
* et-forest.h: Update copyright; revamp all function to operate on
nodes
(et_forest_value): Kill.
(et_forest_enumerate_sons, et_forest_node_value): New.
* et-forest.c: Update copyright.
* et-forest.h: Update copyright; revamp all function to operate on
nodes
(et_forest_value): Kill.
(et_forest_enumerate_sons, et_forest_node_value): New.
Thu Jun 6 22:43:43 CEST 2002 Jan Hubicka <jh@suse.cz>
* basic-block.h: Inlude et-forest.h
(basic_block_def): Kill dominator.
(dominance_info): New type.
(loops): Use dominace_info.
(dominace handling functions): Take dominace_info as argument
instead of bitmaps.
(create_preheader): Likewise.
* cfg.c (entry_exit_blocks): Kill dominator.
(dump_flow_info): Do not dump dominators.
* cfglayout.c (cleanup_unconditonal_jumps): Delete deleted block from
dominators.
* cfgloop.c (flow_pre_header_find): Use dominacne_info.
(flow_loops_pre_header_scan, make_forwarder_block,
canonicale_loop_headers, flow_loops_find): Likewise.
* dominance.c: Include error.h
(idoms_to_doms): Kill.
(bb_hash_func, bb_eq_func): New static functions.
(debug_dominace_info): New global function.
(calculate_dominance_info): Use new et forest structure.
(free_dominace_info, get_immediate_dominator, set_immediate_dominator,
get_dominated_by, redirect_immediate_dominators,
nearest_common_dominator, dominated_by_p, verify_dominators,
recount_dominator, iterate_fix_dominators, add_to_dominace_info,
delete_from_dominance_info): New global functions.
* gcse.c (domnators): CHange to dominance_info.
(alloc_hoist_mem): Do not alloc dominators
(free_code_hoist_mem): Use free_dominance_info.
(compute_code_hoist_data): Use dominance_info.
(hoist_code): Likewise.
* ifcvt.c (post_dominators): Likewise.
(find_if_case_2, if_convert): Likewise.
* predict.c (process_note_predictions, process_note_prediction,
estimate-probability): Likewise.
* sched-rgn.c (find_rgns, init_regions): Likewise.
* ssa-dce.c (find_all_control_dependences, fint_control_depemndence,
find_pdom, delete_insn_bb, ssa_eliminate_dead_code): Likewise.
* ssa.c (compute_dominance_frontiers_1, rename_block, rename_registers,
find_evaluations, convert_to_ssa): Likewise.
* ssa.h (compute_dominance_frontiers): Likewise.
Thu Jun 6 22:57:34 CEST 2002 Pavel Nejedly <bim@atrey.karlin.mff.cuni.cz>
* Makefile.in (et-forest.c): Add.
* et-forest.c: New file.
* at-forest.h: New file.
git-svn-id: svn+ssh://gcc.gnu.org/svn/gcc/trunk@54843 138bc75d-0d04-0410-961f-82ee72b054a4
Diffstat (limited to 'gcc/sched-rgn.c')
-rw-r--r-- | gcc/sched-rgn.c | 14 |
1 files changed, 6 insertions, 8 deletions
diff --git a/gcc/sched-rgn.c b/gcc/sched-rgn.c index 6227645651b..4a9989758c8 100644 --- a/gcc/sched-rgn.c +++ b/gcc/sched-rgn.c @@ -153,7 +153,7 @@ static int *containing_rgn; void debug_regions PARAMS ((void)); static void find_single_block_region PARAMS ((void)); -static void find_rgns PARAMS ((struct edge_list *, sbitmap *)); +static void find_rgns PARAMS ((struct edge_list *, dominance_info)); static int too_large PARAMS ((int, int *, int *)); extern void debug_live PARAMS ((int, int)); @@ -624,7 +624,7 @@ too_large (block, num_bbs, num_insns) static void find_rgns (edge_list, dom) struct edge_list *edge_list; - sbitmap *dom; + dominance_info dom; { int *max_hdr, *dfs_nr, *stack, *degree; char no_loops = 1; @@ -837,7 +837,7 @@ find_rgns (edge_list, dom) { /* Now verify that the block is dominated by the loop header. */ - if (!TEST_BIT (dom[jbb->index], bb->index)) + if (!dominated_by_p (dom, jbb, bb)) break; } } @@ -2909,11 +2909,9 @@ init_regions () } else { - sbitmap *dom; + dominance_info dom; struct edge_list *edge_list; - dom = sbitmap_vector_alloc (last_basic_block, last_basic_block); - /* The scheduler runs after flow; therefore, we can't blindly call back into find_basic_blocks since doing so could invalidate the info in global_live_at_start. @@ -2928,7 +2926,7 @@ init_regions () edge_list = create_edge_list (); /* Compute the dominators and post dominators. */ - calculate_dominance_info (NULL, dom, CDI_DOMINATORS); + dom = calculate_dominance_info (CDI_DOMINATORS); /* build_control_flow will return nonzero if it detects unreachable blocks or any other irregularity with the cfg which prevents @@ -2946,7 +2944,7 @@ init_regions () /* For now. This will move as more and more of haifa is converted to using the cfg code in flow.c. */ - free (dom); + free_dominance_info (dom); } } |