355be0dc58
* 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. Co-Authored-By: Pavel Nejedly <bim@atrey.karlin.mff.cuni.cz> From-SVN: r54843
73 lines
2.5 KiB
C
73 lines
2.5 KiB
C
/* Static Single Assignment (SSA) definitions for GNU C-Compiler
|
|
Copyright (C) 2000, 2001 Free Software Foundation, Inc.
|
|
Written by Jeffrey D. Oldham <oldham@codesourcery.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. */
|
|
|
|
|
|
/* Main SSA routines. */
|
|
extern void convert_to_ssa PARAMS ((void));
|
|
extern void convert_from_ssa PARAMS ((void));
|
|
typedef int (*successor_phi_fn) PARAMS ((rtx, int, int, void *));
|
|
extern int for_each_successor_phi PARAMS ((basic_block bb,
|
|
successor_phi_fn,
|
|
void *));
|
|
void compute_dominance_frontiers PARAMS ((sbitmap *frontiers,
|
|
dominance_info idom));
|
|
extern int remove_phi_alternative PARAMS ((rtx, basic_block));
|
|
|
|
|
|
/* Optimizations. */
|
|
/* In ssa-dce.c */
|
|
extern void ssa_eliminate_dead_code PARAMS ((void));
|
|
|
|
/* In ssa-ccp.c */
|
|
extern void ssa_const_prop PARAMS ((void));
|
|
|
|
|
|
/* SSA definitions and uses. */
|
|
/* This flag is set when the CFG is in SSA form. */
|
|
extern int in_ssa_form;
|
|
|
|
/* Element I is the single instruction that sets register I. */
|
|
extern GTY(()) varray_type ssa_definition;
|
|
|
|
/* Element I is an INSN_LIST of instructions that use register I. */
|
|
extern varray_type ssa_uses;
|
|
|
|
|
|
/* Specify which hard registers should be converted. */
|
|
|
|
/* All pseudo-registers (having register number >=
|
|
FIRST_PSEUDO_REGISTER) and hard registers satisfying
|
|
CONVERT_HARD_REGISTER_TO_SSA_P are converted to SSA form. */
|
|
|
|
/* Given a hard register number REG_NO, return nonzero if and only if
|
|
the register should be converted to SSA. */
|
|
|
|
#ifndef CONVERT_HARD_REGISTER_TO_SSA_P
|
|
#define CONVERT_HARD_REGISTER_TO_SSA_P(REG_NO) (0) /* default of no hard registers */
|
|
#endif /* CONVERT_HARD_REGISTER_TO_SSA_P */
|
|
|
|
/* Given a register number REG_NO, return nonzero if and only if the
|
|
register should be converted to SSA. */
|
|
|
|
#define CONVERT_REGISTER_TO_SSA_P(REG_NO) \
|
|
((!HARD_REGISTER_NUM_P (REG_NO)) || \
|
|
(CONVERT_HARD_REGISTER_TO_SSA_P (REG_NO)))
|