X-Git-Url: http://git.sourceforge.jp/view?a=blobdiff_plain;f=gcc%2Ftree-flow.h;h=2835c221f0155cb35b9dbd4fa486d0be5c370696;hb=8d0afcccdc8ad93ff596ef95b44d520d6b3c73ae;hp=8d8f58a9eeb5362e0e5ede6d75c6cdae06071b47;hpb=f3d9a16cb6215826d71c1b53087d2e4eec38bb56;p=pf3gnuchains%2Fgcc-fork.git diff --git a/gcc/tree-flow.h b/gcc/tree-flow.h index 8d8f58a9eeb..2835c221f01 100644 --- a/gcc/tree-flow.h +++ b/gcc/tree-flow.h @@ -1,5 +1,5 @@ /* Data and Control Flow Analysis for Trees. - Copyright (C) 2001, 2003, 2004 Free Software Foundation, Inc. + Copyright (C) 2001, 2003, 2004, 2005 Free Software Foundation, Inc. Contributed by Diego Novillo This file is part of GCC. @@ -28,6 +28,7 @@ Boston, MA 02111-1307, USA. */ #include "hashtab.h" #include "tree-gimple.h" #include "tree-ssa-operands.h" +#include "cgraph.h" /* Forward declare structures for the garbage collector GTY markers. */ #ifndef GCC_BASIC_BLOCK_H @@ -37,6 +38,9 @@ struct basic_block_def; typedef struct basic_block_def *basic_block; #endif +/* True if the code is in ssa form. */ +extern bool in_ssa_p; + /*--------------------------------------------------------------------------- Attributes for SSA_NAMEs. @@ -59,6 +63,15 @@ struct ptr_info_def GTY(()) /* Nonzero if the value of this pointer escapes the current function. */ unsigned int value_escapes_p : 1; + /* Nonzero if this pointer is dereferenced. */ + unsigned int is_dereferenced : 1; + + /* Nonzero if this pointer points to a global variable. */ + unsigned int pt_global_mem : 1; + + /* Nonzero if this pointer points to NULL. */ + unsigned int pt_null : 1; + /* Set of variables that this pointer may point to. */ bitmap pt_vars; @@ -70,6 +83,34 @@ struct ptr_info_def GTY(()) }; +/* Types of value ranges. */ +enum value_range_type { VR_UNDEFINED, VR_RANGE, VR_ANTI_RANGE, VR_VARYING }; + + +/* Ranges of values that can be associated with an SSA_NAME after VRP + has executed. */ +struct value_range_def GTY(()) +{ + /* Lattice value represented by this range. */ + enum value_range_type type; + + /* Minimum and maximum values represented by this range. These + values are _CST nodes that should be interpreted as follows: + + - If TYPE == VR_UNDEFINED then MIN and MAX must be NULL. + + - If TYPE == VR_RANGE then MIN holds the minimum value and + MAX holds the maximum value of the range [MIN, MAX]. + + - If TYPE == ANTI_RANGE the variable is known to NOT + take any values in the range [MIN, MAX]. */ + tree min; + tree max; +}; + +typedef struct value_range_def value_range; + + /*--------------------------------------------------------------------------- Tree annotations stored in tree_common.ann ---------------------------------------------------------------------------*/ @@ -124,24 +165,32 @@ enum mem_tag_kind { TYPE_TAG, /* This variable is a name memory tag (NMT). */ - NAME_TAG + NAME_TAG, + + /* This variable represents a structure field. */ + STRUCT_FIELD +}; +struct subvar; +typedef struct subvar *subvar_t; + +/* This structure represents a fake sub-variable for a structure field. */ + +struct subvar GTY(()) +{ + /* Fake variable name */ + tree var; + /* Offset inside structure. */ + HOST_WIDE_INT offset; + /* Size of field. */ + HOST_WIDE_INT size; + /* Next subvar for this structure. */ + subvar_t next; }; struct var_ann_d GTY(()) { struct tree_ann_common_d common; - /* Nonzero if this variable has uses which may not appear - in the IL. This can happen in the following cases: - - 1. If the variable is used in a variable length - array declaration. - - 2. If the variable is the return value in a C++ - function where the named return value optimization - has been performed. */ - unsigned has_hidden_use : 1; - /* Used by the out of SSA pass to determine whether this variable has been seen yet or not. */ unsigned out_of_ssa_tag : 1; @@ -166,6 +215,14 @@ struct var_ann_d GTY(()) states. */ ENUM_BITFIELD (need_phi_state) need_phi_state : 2; + /* Used during operand processing to determine if this variable is already + in the vuse list. */ + unsigned in_vuse_list : 1; + + /* Used during operand processing to determine if this variable is already + in the v_may_def list. */ + unsigned in_v_may_def_list : 1; + /* An artificial variable representing the memory location pointed-to by all the pointers that TBAA (type-based alias analysis) considers to be aliased. If the variable is not a pointer or if it is never @@ -192,54 +249,42 @@ struct var_ann_d GTY(()) tree default_def; /* During into-ssa and the dominator optimizer, this field holds the - current version of this variable (an SSA_NAME). - - This was previously two varrays (one in into-ssa the other in the - dominator optimizer). That is wasteful, particularly since the - dominator optimizer calls into-ssa resulting in having two varrays - live at the same time and this can happen for each call to the - dominator optimizer. */ + current version of this variable (an SSA_NAME). */ tree current_def; + + /* If this variable is a structure, this fields holds a list of + symbols representing each of the fields of the structure. */ + subvar_t subvars; }; -struct dataflow_d GTY(()) +typedef struct immediate_use_iterator_d { - /* Immediate uses. This is a list of all the statements and PHI nodes - that are immediately reached by the definitions made in this - statement. */ - varray_type immediate_uses; - - /* Use this array for very small numbers of uses instead of the varray. */ - tree uses[2]; - - /* Reached uses. This is a list of all the possible program statements - that may be reached directly or indirectly by definitions made in this - statement. Notice that this is a superset of IMMEDIATE_USES. - For instance, given the following piece of code: - - 1 a1 = 10; - 2 if (a1 > 3) - 3 a2 = a1 + 5; - 4 a3 = PHI (a1, a2) - 5 b1 = a3 - 2; - - IMMEDIATE_USES for statement #1 are all those statements that use a1 - directly (i.e., #2, #3 and #4). REACHED_USES for statement #1 also - includes statement #5 because 'a1' could reach 'a3' via the PHI node - at statement #4. The set of REACHED_USES is then the transitive - closure over all the PHI nodes in the IMMEDIATE_USES set. */ - - /* Reaching definitions. Similarly to REACHED_USES, the set - REACHING_DEFS is the set of all the statements that make definitions - that may reach this statement. Notice that we don't need to have a - similar entry for immediate definitions, as these are represented by - the SSA_NAME nodes themselves (each SSA_NAME node contains a pointer - to the statement that makes that definition). */ -}; + ssa_use_operand_t *imm_use; + ssa_use_operand_t *end_p; + ssa_use_operand_t iter_node; +} imm_use_iterator; + -typedef struct dataflow_d *dataflow_t; +/* Use this iterator when simply looking at stmts. Adding, deleting or + modifying stmts will cause this iterator to malfunction. */ +#define FOR_EACH_IMM_USE_FAST(DEST, ITER, SSAVAR) \ + for ((DEST) = first_readonly_imm_use (&(ITER), (SSAVAR)); \ + !end_readonly_imm_use_p (&(ITER)); \ + (DEST) = next_readonly_imm_use (&(ITER))) + + +#define FOR_EACH_IMM_USE_SAFE(DEST, ITER, SSAVAR) \ + for ((DEST) = first_safe_imm_use (&(ITER), (SSAVAR)); \ + !end_safe_imm_use_p (&(ITER)); \ + (DEST) = next_safe_imm_use (&(ITER))) + +#define BREAK_FROM_SAFE_IMM_USE(ITER) \ + { \ + end_safe_imm_use_traverse (&(ITER)); \ + break; \ + } struct stmt_ann_d GTY(()) { @@ -249,11 +294,6 @@ struct stmt_ann_d GTY(()) need to be scanned again). */ unsigned modified : 1; - /* Nonzero if the statement is in the CCP worklist and has not been - "cancelled". If we ever need to use this bit outside CCP, then - it should be renamed. */ - unsigned in_ccp_worklist: 1; - /* Nonzero if the statement makes aliased loads. */ unsigned makes_aliased_loads : 1; @@ -270,17 +310,8 @@ struct stmt_ann_d GTY(()) /* Basic block that contains this statement. */ basic_block GTY ((skip (""))) bb; - /* Statement operands. */ - struct def_optype_d * GTY (()) def_ops; - struct use_optype_d * GTY (()) use_ops; - - /* Virtual operands (V_MAY_DEF, VUSE, and V_MUST_DEF). */ - struct v_may_def_optype_d * GTY (()) v_may_def_ops; - struct vuse_optype_d * GTY (()) vuse_ops; - struct v_must_def_optype_d * GTY (()) v_must_def_ops; - - /* Dataflow information. */ - dataflow_t df; + /* Operand cache for stmt. */ + struct stmt_operands_d GTY ((skip (""))) operands; /* Set of variables that have had their address taken in the statement. */ bitmap addresses_taken; @@ -289,6 +320,16 @@ struct stmt_ann_d GTY(()) by each pass on an as-needed basis in any order convenient for the pass which needs statement UIDs. */ unsigned int uid; + + /* Auxiliary info specific to a pass. At all times, this + should either point to valid data or be NULL. */ + PTR GTY ((skip (""))) aux; + + /* Linked list of histograms for value-based profiling. This is really a + struct histogram_value*. We use void* to avoid having to export that + everywhere, and to avoid having to put it in GC memory. */ + + void * GTY ((skip (""))) histograms; }; union tree_ann_d GTY((desc ("ann_type ((tree_ann_t)&%h)"))) @@ -298,6 +339,8 @@ union tree_ann_d GTY((desc ("ann_type ((tree_ann_t)&%h)"))) struct stmt_ann_d GTY((tag ("STMT_ANN"))) stmt; }; +extern GTY(()) VEC(tree,gc) *modified_noreturn_calls; + typedef union tree_ann_d *tree_ann_t; typedef struct var_ann_d *var_ann_t; typedef struct stmt_ann_d *stmt_ann_t; @@ -311,27 +354,17 @@ static inline stmt_ann_t get_stmt_ann (tree); static inline enum tree_ann_type ann_type (tree_ann_t); static inline basic_block bb_for_stmt (tree); extern void set_bb_for_stmt (tree, basic_block); -static inline void modify_stmt (tree); -static inline void unmodify_stmt (tree); +static inline bool noreturn_call_p (tree); +static inline void update_stmt (tree); static inline bool stmt_modified_p (tree); static inline varray_type may_aliases (tree); static inline int get_lineno (tree); static inline const char *get_filename (tree); static inline bool is_exec_stmt (tree); static inline bool is_label_stmt (tree); -static inline v_may_def_optype get_v_may_def_ops (stmt_ann_t); -static inline vuse_optype get_vuse_ops (stmt_ann_t); -static inline use_optype get_use_ops (stmt_ann_t); -static inline def_optype get_def_ops (stmt_ann_t); static inline bitmap addresses_taken (tree); -static inline int num_immediate_uses (dataflow_t); -static inline tree immediate_use (dataflow_t, int); -static inline dataflow_t get_immediate_uses (tree); -static inline bool has_hidden_use (tree); -static inline void set_has_hidden_use (tree); static inline void set_default_def (tree, tree); static inline tree default_def (tree); -static inline bool may_be_aliased (tree); /*--------------------------------------------------------------------------- Structure representing predictions in tree level. @@ -352,20 +385,13 @@ struct bb_ann_d GTY(()) /* Chain of PHI nodes for this block. */ tree phi_nodes; - /* Chain of EPHI nodes created in this block. */ - tree ephi_nodes; - - /* Number of predecessors for this block. This is only valid during - SSA rewriting. It is not maintained after conversion into SSA form. */ - int num_preds; - - /* Nonzero if this block is forwardable during cfg cleanups. This is also - used to detect loops during cfg cleanups. */ - unsigned forwardable: 1; - /* Nonzero if this block contains an escape point (see is_escape_site). */ unsigned has_escape_site : 1; + /* Nonzero if one or more incoming edges to this block should be threaded + to an outgoing edge of this block. */ + unsigned incoming_edge_threaded : 1; + struct edge_prediction *predictions; }; @@ -380,16 +406,16 @@ static inline void set_phi_nodes (basic_block, tree); Global declarations ---------------------------------------------------------------------------*/ /* Array of all variables referenced in the function. */ -extern GTY(()) varray_type referenced_vars; +extern GTY(()) VEC(tree,gc) *referenced_vars; -#define num_referenced_vars VARRAY_ACTIVE_SIZE (referenced_vars) -#define referenced_var(i) VARRAY_TREE (referenced_vars, i) +#define num_referenced_vars VEC_length (tree, referenced_vars) +#define referenced_var(i) VEC_index (tree, referenced_vars, i) /* Array of all SSA_NAMEs used in the function. */ -extern GTY(()) varray_type ssa_names; +extern GTY(()) VEC(tree,gc) *ssa_names; -#define num_ssa_names VARRAY_ACTIVE_SIZE (ssa_names) -#define ssa_name(i) VARRAY_TREE (ssa_names, i) +#define num_ssa_names (VEC_length (tree, ssa_names)) +#define ssa_name(i) (VEC_index (tree, ssa_names, (i))) /* Artificial variable used to model the effects of function calls. */ extern GTY(()) tree global_var; @@ -398,6 +424,10 @@ extern GTY(()) tree global_var; REFERENCED_VARS (I) is call-clobbered. */ extern bitmap call_clobbered_vars; +/* Addressable variables in the function. If bit I is set, then + REFERENCED_VARS (I) has had its address taken. */ +extern bitmap addressable_vars; + /* 'true' after aliases have been computed (see compute_may_aliases). */ extern bool aliases_computed_p; @@ -412,7 +442,6 @@ extern bool aliases_computed_p; #define PERCENT(x,y) ((float)(x) * 100.0 / (float)(y)) - /*--------------------------------------------------------------------------- Block iterators ---------------------------------------------------------------------------*/ @@ -425,6 +454,7 @@ typedef struct { static inline block_stmt_iterator bsi_start (basic_block); static inline block_stmt_iterator bsi_last (basic_block); static inline block_stmt_iterator bsi_after_labels (basic_block); +block_stmt_iterator bsi_for_stmt (tree); static inline bool bsi_end_p (block_stmt_iterator); static inline void bsi_next (block_stmt_iterator *); static inline void bsi_prev (block_stmt_iterator *); @@ -478,27 +508,40 @@ extern void dump_cfg_stats (FILE *); extern void debug_cfg_stats (void); extern void debug_loop_ir (void); extern void print_loop_ir (FILE *); -extern void cleanup_tree_cfg (void); +extern void cleanup_dead_labels (void); +extern void group_case_labels (void); +extern bool cleanup_tree_cfg (void); +extern void cleanup_tree_cfg_loop (void); extern tree first_stmt (basic_block); extern tree last_stmt (basic_block); extern tree *last_stmt_ptr (basic_block); extern tree last_and_only_stmt (basic_block); extern edge find_taken_edge (basic_block, tree); -extern void cfg_remove_useless_stmts (void); -extern edge thread_edge (edge, basic_block); -extern basic_block label_to_block (tree); -extern void tree_optimize_tail_calls (bool, enum tree_dump_index); -extern edge tree_block_forwards_to (basic_block bb); +extern basic_block label_to_block_fn (struct function *, tree); +#define label_to_block(t) (label_to_block_fn (cfun, t)) extern void bsi_insert_on_edge (edge, tree); -extern void bsi_commit_edge_inserts (int *); +extern basic_block bsi_insert_on_edge_immediate (edge, tree); +extern void bsi_commit_one_edge_insert (edge, basic_block *); +extern void bsi_commit_edge_inserts (void); extern void notice_special_calls (tree); extern void clear_special_calls (void); -extern void compute_dominance_frontiers (bitmap *); extern void verify_stmts (void); -extern tree tree_block_label (basic_block bb); +extern tree tree_block_label (basic_block); extern void extract_true_false_edges_from_block (basic_block, edge *, edge *); +extern bool tree_duplicate_sese_region (edge, edge, basic_block *, unsigned, + basic_block *); +extern void add_phi_args_after_copy_bb (basic_block); +extern void add_phi_args_after_copy (basic_block *, unsigned); extern bool tree_purge_dead_eh_edges (basic_block); extern bool tree_purge_all_dead_eh_edges (bitmap); +extern tree gimplify_val (block_stmt_iterator *, tree, tree); +extern tree gimplify_build1 (block_stmt_iterator *, enum tree_code, + tree, tree); +extern tree gimplify_build2 (block_stmt_iterator *, enum tree_code, + tree, tree, tree); +extern tree gimplify_build3 (block_stmt_iterator *, enum tree_code, + tree, tree, tree, tree); +extern void init_empty_tree_cfg (void); /* In tree-pretty-print.c. */ extern void dump_generic_bb (FILE *, basic_block, int, int); @@ -507,38 +550,26 @@ extern void dump_generic_bb (FILE *, basic_block, int, int); extern var_ann_t create_var_ann (tree); extern stmt_ann_t create_stmt_ann (tree); extern tree_ann_t create_tree_ann (tree); +extern void reserve_phi_args_for_new_edge (basic_block); extern tree create_phi_node (tree, basic_block); -extern void add_phi_arg (tree *, tree, edge); -extern void remove_phi_arg (tree, basic_block); -extern void remove_phi_arg_num (tree, int); -extern void remove_phi_node (tree, tree, basic_block); -extern void remove_all_phi_nodes_for (bitmap); +extern void add_phi_arg (tree, tree, edge); +extern void remove_phi_args (edge); +extern void remove_phi_node (tree, tree); +extern tree phi_reverse (tree); extern void dump_dfa_stats (FILE *); extern void debug_dfa_stats (void); extern void debug_referenced_vars (void); extern void dump_referenced_vars (FILE *); extern void dump_variable (FILE *, tree); extern void debug_variable (tree); -extern void dump_immediate_uses (FILE *); -extern void debug_immediate_uses (void); -extern void dump_immediate_uses_for (FILE *, tree); -extern void debug_immediate_uses_for (tree); -extern void compute_immediate_uses (int, bool (*)(tree)); -extern void free_df (void); extern tree get_virtual_var (tree); -extern void add_referenced_tmp_var (tree var); -extern void mark_new_vars_to_rename (tree, bitmap); -extern void redirect_immediate_uses (tree, tree); -extern tree make_rename_temp (tree, const char *); +extern void add_referenced_tmp_var (tree); +extern void mark_new_vars_to_rename (tree); +extern void find_new_referenced_vars (tree *); -/* Flags used when computing reaching definitions and reached uses. */ -#define TDFA_USE_OPS 1 << 0 -#define TDFA_USE_VOPS 1 << 1 +extern tree make_rename_temp (tree, const char *); /* In gimple-low.c */ -struct lower_data; -extern void lower_stmt_body (tree, struct lower_data *); -extern void expand_used_vars (void); extern void record_vars (tree); extern bool block_may_fallthru (tree block); @@ -549,56 +580,167 @@ extern void dump_alias_info (FILE *); extern void debug_alias_info (void); extern void dump_points_to_info (FILE *); extern void debug_points_to_info (void); +extern void dump_points_to_info_for (FILE *, tree); +extern void debug_points_to_info_for (tree); +extern bool may_be_aliased (tree); +extern struct ptr_info_def *get_ptr_info (tree); +extern void add_type_alias (tree, tree); +extern void count_uses_and_derefs (tree, tree, unsigned *, unsigned *, bool *); +static inline subvar_t get_subvars_for_var (tree); +static inline bool ref_contains_array_ref (tree); +extern tree okay_component_ref_for_subvars (tree, HOST_WIDE_INT *, + HOST_WIDE_INT *); +static inline bool var_can_have_subvars (tree); +static inline bool overlap_subvar (HOST_WIDE_INT, HOST_WIDE_INT, + subvar_t, bool *); /* Call-back function for walk_use_def_chains(). At each reaching definition, a function with this prototype is called. */ typedef bool (*walk_use_def_chains_fn) (tree, tree, void *); + /* In tree-ssa.c */ extern void init_tree_ssa (void); -extern void rewrite_vars_out_of_ssa (bitmap); -extern void dump_reaching_defs (FILE *); -extern void debug_reaching_defs (void); -extern void dump_tree_ssa (FILE *); -extern void debug_tree_ssa (void); -extern void debug_def_blocks (void); -extern void dump_tree_ssa_stats (FILE *); -extern void debug_tree_ssa_stats (void); -extern void ssa_remove_edge (edge); extern edge ssa_redirect_edge (edge, basic_block); -extern void set_is_used (tree); +extern void flush_pending_stmts (edge); extern bool tree_ssa_useless_type_conversion (tree); extern bool tree_ssa_useless_type_conversion_1 (tree, tree); -extern void verify_ssa (void); +extern void verify_ssa (bool); extern void delete_tree_ssa (void); -extern void register_new_def (tree, varray_type *); -extern void walk_use_def_chains (tree, walk_use_def_chains_fn, void *); +extern void register_new_def (tree, VEC(tree,heap) **); +extern void walk_use_def_chains (tree, walk_use_def_chains_fn, void *, bool); +extern bool stmt_references_memory_p (tree); /* In tree-into-ssa.c */ -extern void rewrite_into_ssa (bool); -extern void rewrite_ssa_into_ssa (bitmap); - +void update_ssa (unsigned); +void delete_update_ssa (void); +void register_new_name_mapping (tree, tree); +tree create_new_def_for (tree, tree, def_operand_p); +bool need_ssa_update_p (void); +bool name_registered_for_update_p (tree); +bitmap ssa_names_to_replace (void); +void release_ssa_name_after_update_ssa (tree name); void compute_global_livein (bitmap, bitmap); tree duplicate_ssa_name (tree, tree); +void mark_sym_for_renaming (tree); +void mark_set_for_renaming (bitmap); +tree get_current_def (tree); +void set_current_def (tree, tree); /* In tree-ssa-ccp.c */ bool fold_stmt (tree *); tree widen_bitfield (tree, tree, tree); +/* In tree-vrp.c */ +value_range *get_value_range (tree); +void dump_value_range (FILE *, value_range *); +void debug_value_range (value_range *); +void dump_all_value_ranges (FILE *); +void debug_all_value_ranges (void); +bool expr_computes_nonzero (tree); + /* In tree-ssa-dom.c */ extern void dump_dominator_optimization_stats (FILE *); extern void debug_dominator_optimization_stats (void); +int loop_depth_of_name (tree); /* In tree-ssa-copy.c */ extern void propagate_value (use_operand_p, tree); extern void propagate_tree_value (tree *, tree); extern void replace_exp (use_operand_p, tree); +extern bool may_propagate_copy (tree, tree); +extern bool may_propagate_copy_into_asm (tree); + +/* Description of number of iterations of a loop. All the expressions inside + the structure can be evaluated at the end of the loop's preheader + (and due to ssa form, also anywhere inside the body of the loop). */ + +struct tree_niter_desc +{ + tree assumptions; /* The boolean expression. If this expression evaluates + to false, then the other fields in this structure + should not be used; there is no guarantee that they + will be correct. */ + tree may_be_zero; /* The boolean expression. If it evaluates to true, + the loop will exit in the first iteration (i.e. + its latch will not be executed), even if the niter + field says otherwise. */ + tree niter; /* The expression giving the number of iterations of + a loop (provided that assumptions == true and + may_be_zero == false), more precisely the number + of executions of the latch of the loop. */ + tree additional_info; /* The boolean expression. Sometimes we use additional + knowledge to simplify the other expressions + contained in this structure (for example the + knowledge about value ranges of operands on entry to + the loop). If this is a case, conjunction of such + condition is stored in this field, so that we do not + lose the information: for example if may_be_zero + is (n <= 0) and niter is (unsigned) n, we know + that the number of iterations is at most + MAX_SIGNED_INT. However if the (n <= 0) assumption + is eliminated (by looking at the guard on entry of + the loop), then the information would be lost. */ +}; + +/* In tree-vectorizer.c */ +void vectorize_loops (struct loops *); + +/* In tree-ssa-phiopt.c */ +bool empty_block_p (basic_block); + +/* In tree-ssa-loop*.c */ + +void tree_ssa_lim (struct loops *); +void tree_ssa_unswitch_loops (struct loops *); +void canonicalize_induction_variables (struct loops *); +void tree_unroll_loops_completely (struct loops *, bool); +void tree_ssa_iv_optimize (struct loops *); + +bool number_of_iterations_exit (struct loop *, edge, + struct tree_niter_desc *niter); +tree find_loop_niter (struct loop *, edge *); +tree loop_niter_by_eval (struct loop *, edge); +tree find_loop_niter_by_eval (struct loop *, edge *); +void estimate_numbers_of_iterations (struct loops *); +tree can_count_iv_in_wider_type (struct loop *, tree, tree, tree, tree); +void free_numbers_of_iterations_estimates (struct loops *); +void rewrite_into_loop_closed_ssa (bitmap, unsigned); +void verify_loop_closed_ssa (void); +void loop_commit_inserts (void); +bool for_each_index (tree *, bool (*) (tree, tree *, void *), void *); +void create_iv (tree, tree, tree, struct loop *, block_stmt_iterator *, bool, + tree *, tree *); +void split_loop_exit_edge (edge); +basic_block bsi_insert_on_edge_immediate_loop (edge, tree); +void standard_iv_increment_position (struct loop *, block_stmt_iterator *, + bool *); +basic_block ip_end_pos (struct loop *); +basic_block ip_normal_pos (struct loop *); +bool tree_duplicate_loop_to_header_edge (struct loop *, edge, struct loops *, + unsigned int, sbitmap, + edge, edge *, + unsigned int *, int); +struct loop *tree_ssa_loop_version (struct loops *, struct loop *, tree, + basic_block *); + +/* In tree-ssa-loop-im.c */ +/* The possibilities of statement movement. */ + +enum move_pos + { + MOVE_IMPOSSIBLE, /* No movement -- side effect expression. */ + MOVE_PRESERVE_EXECUTION, /* Must not cause the non-executed statement + become executed -- memory accesses, ... */ + MOVE_POSSIBLE /* Unlimited movement. */ + }; +extern enum move_pos movement_possibility (tree); /* In tree-flow-inline.h */ -static inline int phi_arg_from_edge (tree, edge); -static inline bool may_propagate_copy (tree, tree); static inline bool is_call_clobbered (tree); static inline void mark_call_clobbered (tree); +static inline void set_is_used (tree); +static inline bool unmodifiable_var_p (tree); /* In tree-eh.c */ extern void make_eh_edges (tree); @@ -620,16 +762,28 @@ void print_value_expressions (FILE *, tree); /* In tree-vn.c */ bool expressions_equal_p (tree, tree); tree get_value_handle (tree); -hashval_t vn_compute (tree, hashval_t, vuse_optype); -tree vn_lookup_or_add (tree, vuse_optype); -void vn_add (tree, tree, vuse_optype); -tree vn_lookup (tree, vuse_optype); +hashval_t vn_compute (tree, hashval_t, tree); +tree vn_lookup_or_add (tree, tree); +void vn_add (tree, tree, tree); +tree vn_lookup (tree, tree); void vn_init (void); void vn_delete (void); +/* In tree-ssa-sink.c */ +bool is_hidden_global_store (tree); /* In tree-sra.c */ -void insert_edge_copies (tree stmt, basic_block bb); +void insert_edge_copies (tree, basic_block); + +/* In tree-loop-linear.c */ +extern void linear_transform_loops (struct loops *); + +/* In tree-ssa-loop-ivopts.c */ +extern bool expr_invariant_in_loop_p (struct loop *, tree); + +/* In gimplify.c */ +tree force_gimple_operand (tree, tree *, bool, tree); +tree force_gimple_operand_bsi (block_stmt_iterator *, tree, bool, tree); #include "tree-flow-inline.h"