#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
live at the same time and this can happen for each call to the
dominator optimizer. */
tree current_def;
+
+ /* Pointer to the structure that contains the sets of global
+ variables modified by function calls. This field is only used
+ for FUNCTION_DECLs. */
+ static_vars_info_t static_vars_info;
};
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;
/* Chain of PHI nodes for this block. */
tree phi_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;
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 stmt_for_bsi (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 *);
extern void verify_stmts (void);
extern tree tree_block_label (basic_block bb);
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 void rewrite_to_new_ssa_names_bb (basic_block, struct htab *);
+extern void rewrite_to_new_ssa_names (basic_block *, unsigned, htab_t);
+extern void allocate_ssa_names (bitmap, struct htab **);
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 void debug_immediate_uses_for (tree);
extern void compute_immediate_uses (int, bool (*)(tree));
extern void free_df (void);
+extern void free_df_for_stmt (tree);
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 find_new_referenced_vars (tree *);
+
extern void redirect_immediate_uses (tree, tree);
extern tree make_rename_temp (tree, const char *);
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
struct tree_niter_desc
{
- tree assumptions; /* The boolean expression. If this expression evalutes
+ 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 booleand expression. If it evaluates to true,
+ 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. */
/* 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 *);
+void tree_ssa_iv_optimize (struct loops *);
void number_of_iterations_cond (tree, tree, tree, enum tree_code, tree, tree,
struct tree_niter_desc *);
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-if-conv.c */
+bool tree_if_conversion (struct loop *, bool);
+
/* In tree-flow-inline.h */
static inline int phi_arg_from_edge (tree, edge);
extern void build_ssa_operands (tree, stmt_ann_t, stmt_operands_p,
stmt_operands_p);
+/* 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 *loop, tree expr);
+/* In gimplify.c */
+
+tree force_gimple_operand (tree, tree *, bool, tree);
+
#include "tree-flow-inline.h"
#endif /* _TREE_FLOW_H */
OSDN Git Service
