gcc/tree-flow.h

   1 /* Data and Control Flow Analysis for Trees.
   2    Copyright (C) 2001-2013 Free Software Foundation, Inc.
   3    Contributed by Diego Novillo <dnovillo@redhat.com>
   4
   5 This file is part of GCC.
   6
   7 GCC is free software; you can redistribute it and/or modify
   8 it under the terms of the GNU General Public License as published by
   9 the Free Software Foundation; either version 3, or (at your option)
  10 any later version.
  11
  12 GCC is distributed in the hope that it will be useful,
  13 but WITHOUT ANY WARRANTY; without even the implied warranty of
  14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  15 GNU General Public License for more details.
  16
  17 You should have received a copy of the GNU General Public License
  18 along with GCC; see the file COPYING3.  If not see
  19 <http://www.gnu.org/licenses/>.  */
  20
  21 #ifndef _TREE_FLOW_H
  22 #define _TREE_FLOW_H 1
  23
  24 #include "bitmap.h"
  25 #include "sbitmap.h"
  26 #include "basic-block.h"
  27 #include "hashtab.h"
  28 #include "gimple.h"
  29 #include "tree-ssa-operands.h"
  30 #include "cgraph.h"
  31 #include "ipa-reference.h"
  32 #include "tree-ssa-alias.h"
  33 #include "wide-int.h"
  34
  35
  36 /* This structure is used to map a gimple statement to a label,
  37    or list of labels to represent transaction restart.  */
  38
  39 struct GTY(()) tm_restart_node {
  40   gimple stmt;
  41   tree label_or_list;
  42 };
  43
  44 /* Gimple dataflow datastructure. All publicly available fields shall have
  45    gimple_ accessor defined in tree-flow-inline.h, all publicly modifiable
  46    fields should have gimple_set accessor.  */
  47 struct GTY(()) gimple_df {
  48   /* A vector of all the noreturn calls passed to modify_stmt.
  49      cleanup_control_flow uses it to detect cases where a mid-block
  50      indirect call has been turned into a noreturn call.  When this
  51      happens, all the instructions after the call are no longer
  52      reachable and must be deleted as dead.  */
  53   vec<gimple, va_gc> *modified_noreturn_calls;
  54
  55   /* Array of all SSA_NAMEs used in the function.  */
  56   vec<tree, va_gc> *ssa_names;
  57
  58   /* Artificial variable used for the virtual operand FUD chain.  */
  59   tree vop;
  60
  61   /* The PTA solution for the ESCAPED artificial variable.  */
  62   struct pt_solution escaped;
  63
  64   /* A map of decls to artificial ssa-names that point to the partition
  65      of the decl.  */
  66   struct pointer_map_t * GTY((skip(""))) decls_to_pointers;
  67
  68   /* Free list of SSA_NAMEs.  */
  69   vec<tree, va_gc> *free_ssanames;
  70
  71   /* Hashtable holding definition for symbol.  If this field is not NULL, it
  72      means that the first reference to this variable in the function is a
  73      USE or a VUSE.  In those cases, the SSA renamer creates an SSA name
  74      for this variable with an empty defining statement.  */
  75   htab_t GTY((param_is (union tree_node))) default_defs;
  76
  77   /* True if there are any symbols that need to be renamed.  */
  78   unsigned int ssa_renaming_needed : 1;
  79
  80   /* True if all virtual operands need to be renamed.  */
  81   unsigned int rename_vops : 1;
  82
  83   /* True if the code is in ssa form.  */
  84   unsigned int in_ssa_p : 1;
  85
  86   /* True if IPA points-to information was computed for this function.  */
  87   unsigned int ipa_pta : 1;
  88
  89   struct ssa_operands ssa_operands;
  90
  91   /* Map gimple stmt to tree label (or list of labels) for transaction
  92      restart and abort.  */
  93   htab_t GTY ((param_is (struct tm_restart_node))) tm_restart;
  94 };
  95
  96
  97 typedef struct
  98 {
  99   htab_t htab;
 100   PTR *slot;
 101   PTR *limit;
 102 } htab_iterator;
 103
 104 /* Iterate through the elements of hashtable HTAB, using htab_iterator ITER,
 105    storing each element in RESULT, which is of type TYPE.  */
 106 #define FOR_EACH_HTAB_ELEMENT(HTAB, RESULT, TYPE, ITER) \
 107   for (RESULT = (TYPE) first_htab_element (&(ITER), (HTAB)); \
 108         !end_htab_p (&(ITER)); \
 109         RESULT = (TYPE) next_htab_element (&(ITER)))
 110
 111 /* It is advantageous to avoid things like life analysis for variables which
 112    do not need PHI nodes.  This enum describes whether or not a particular
 113    variable may need a PHI node.  */
 114
 115 enum need_phi_state {
 116   /* This is the default.  If we are still in this state after finding
 117      all the definition and use sites, then we will assume the variable
 118      needs PHI nodes.  This is probably an overly conservative assumption.  */
 119   NEED_PHI_STATE_UNKNOWN,
 120
 121   /* This state indicates that we have seen one or more sets of the
 122      variable in a single basic block and that the sets dominate all
 123      uses seen so far.  If after finding all definition and use sites
 124      we are still in this state, then the variable does not need any
 125      PHI nodes.  */
 126   NEED_PHI_STATE_NO,
 127
 128   /* This state indicates that we have either seen multiple definitions of
 129      the variable in multiple blocks, or that we encountered a use in a
 130      block that was not dominated by the block containing the set(s) of
 131      this variable.  This variable is assumed to need PHI nodes.  */
 132   NEED_PHI_STATE_MAYBE
 133 };
 134
 135
 136 /* Immediate use lists are used to directly access all uses for an SSA
 137    name and get pointers to the statement for each use.
 138
 139    The structure ssa_use_operand_d consists of PREV and NEXT pointers
 140    to maintain the list.  A USE pointer, which points to address where
 141    the use is located and a LOC pointer which can point to the
 142    statement where the use is located, or, in the case of the root
 143    node, it points to the SSA name itself.
 144
 145    The list is anchored by an occurrence of ssa_operand_d *in* the
 146    ssa_name node itself (named 'imm_uses').  This node is uniquely
 147    identified by having a NULL USE pointer. and the LOC pointer
 148    pointing back to the ssa_name node itself.  This node forms the
 149    base for a circular list, and initially this is the only node in
 150    the list.
 151
 152    Fast iteration allows each use to be examined, but does not allow
 153    any modifications to the uses or stmts.
 154
 155    Normal iteration allows insertion, deletion, and modification. the
 156    iterator manages this by inserting a marker node into the list
 157    immediately before the node currently being examined in the list.
 158    this marker node is uniquely identified by having null stmt *and* a
 159    null use pointer.
 160
 161    When iterating to the next use, the iteration routines check to see
 162    if the node after the marker has changed. if it has, then the node
 163    following the marker is now the next one to be visited. if not, the
 164    marker node is moved past that node in the list (visualize it as
 165    bumping the marker node through the list).  this continues until
 166    the marker node is moved to the original anchor position. the
 167    marker node is then removed from the list.
 168
 169    If iteration is halted early, the marker node must be removed from
 170    the list before continuing.  */
 171 typedef struct immediate_use_iterator_d
 172 {
 173   /* This is the current use the iterator is processing.  */
 174   ssa_use_operand_t *imm_use;
 175   /* This marks the last use in the list (use node from SSA_NAME)  */
 176   ssa_use_operand_t *end_p;
 177   /* This node is inserted and used to mark the end of the uses for a stmt.  */
 178   ssa_use_operand_t iter_node;
 179   /* This is the next ssa_name to visit.  IMM_USE may get removed before
 180      the next one is traversed to, so it must be cached early.  */
 181   ssa_use_operand_t *next_imm_name;
 182 } imm_use_iterator;
 183
 184
 185 /* Use this iterator when simply looking at stmts.  Adding, deleting or
 186    modifying stmts will cause this iterator to malfunction.  */
 187
 188 #define FOR_EACH_IMM_USE_FAST(DEST, ITER, SSAVAR)               \
 189   for ((DEST) = first_readonly_imm_use (&(ITER), (SSAVAR));     \
 190        !end_readonly_imm_use_p (&(ITER));                       \
 191        (void) ((DEST) = next_readonly_imm_use (&(ITER))))
 192
 193 /* Use this iterator to visit each stmt which has a use of SSAVAR.  */
 194
 195 #define FOR_EACH_IMM_USE_STMT(STMT, ITER, SSAVAR)               \
 196   for ((STMT) = first_imm_use_stmt (&(ITER), (SSAVAR));         \
 197        !end_imm_use_stmt_p (&(ITER));                           \
 198        (void) ((STMT) = next_imm_use_stmt (&(ITER))))
 199
 200 /* Use this to terminate the FOR_EACH_IMM_USE_STMT loop early.  Failure to
 201    do so will result in leaving a iterator marker node in the immediate
 202    use list, and nothing good will come from that.   */
 203 #define BREAK_FROM_IMM_USE_STMT(ITER)                           \
 204    {                                                            \
 205      end_imm_use_stmt_traverse (&(ITER));                       \
 206      break;                                                     \
 207    }
 208
 209
 210 /* Use this iterator in combination with FOR_EACH_IMM_USE_STMT to
 211    get access to each occurrence of ssavar on the stmt returned by
 212    that iterator..  for instance:
 213
 214      FOR_EACH_IMM_USE_STMT (stmt, iter, var)
 215        {
 216          FOR_EACH_IMM_USE_ON_STMT (use_p, iter)
 217            {
 218              SET_USE (use_p, blah);
 219            }
 220          update_stmt (stmt);
 221        }                                                         */
 222
 223 #define FOR_EACH_IMM_USE_ON_STMT(DEST, ITER)                    \
 224   for ((DEST) = first_imm_use_on_stmt (&(ITER));                \
 225        !end_imm_use_on_stmt_p (&(ITER));                        \
 226        (void) ((DEST) = next_imm_use_on_stmt (&(ITER))))
 227
 228
 229
 230 static inline void update_stmt (gimple);
 231 static inline int get_lineno (const_gimple);
 232
 233 /* Accessors for basic block annotations.  */
 234 static inline gimple_seq phi_nodes (const_basic_block);
 235 static inline void set_phi_nodes (basic_block, gimple_seq);
 236
 237 /*---------------------------------------------------------------------------
 238                               Global declarations
 239 ---------------------------------------------------------------------------*/
 240 struct int_tree_map {
 241   unsigned int uid;
 242   tree to;
 243 };
 244
 245 /* Macros for showing usage statistics.  */
 246 #define SCALE(x) ((unsigned long) ((x) < 1024*10        \
 247                   ? (x)                                 \
 248                   : ((x) < 1024*1024*10                 \
 249                      ? (x) / 1024                       \
 250                      : (x) / (1024*1024))))
 251
 252 #define LABEL(x) ((x) < 1024*10 ? 'b' : ((x) < 1024*1024*10 ? 'k' : 'M'))
 253
 254 #define PERCENT(x,y) ((float)(x) * 100.0 / (float)(y))
 255
 256 /*---------------------------------------------------------------------------
 257                               OpenMP Region Tree
 258 ---------------------------------------------------------------------------*/
 259
 260 /* Parallel region information.  Every parallel and workshare
 261    directive is enclosed between two markers, the OMP_* directive
 262    and a corresponding OMP_RETURN statement.  */
 263
 264 struct omp_region
 265 {
 266   /* The enclosing region.  */
 267   struct omp_region *outer;
 268
 269   /* First child region.  */
 270   struct omp_region *inner;
 271
 272   /* Next peer region.  */
 273   struct omp_region *next;
 274
 275   /* Block containing the omp directive as its last stmt.  */
 276   basic_block entry;
 277
 278   /* Block containing the OMP_RETURN as its last stmt.  */
 279   basic_block exit;
 280
 281   /* Block containing the OMP_CONTINUE as its last stmt.  */
 282   basic_block cont;
 283
 284   /* If this is a combined parallel+workshare region, this is a list
 285      of additional arguments needed by the combined parallel+workshare
 286      library call.  */
 287   vec<tree, va_gc> *ws_args;
 288
 289   /* The code for the omp directive of this region.  */
 290   enum gimple_code type;
 291
 292   /* Schedule kind, only used for OMP_FOR type regions.  */
 293   enum omp_clause_schedule_kind sched_kind;
 294
 295   /* True if this is a combined parallel+workshare region.  */
 296   bool is_combined_parallel;
 297 };
 298
 299 extern struct omp_region *root_omp_region;
 300 extern struct omp_region *new_omp_region (basic_block, enum gimple_code,
 301                                           struct omp_region *);
 302 extern void free_omp_regions (void);
 303 void omp_expand_local (basic_block);
 304 tree copy_var_decl (tree, tree, tree);
 305
 306 /*---------------------------------------------------------------------------
 307                               Function prototypes
 308 ---------------------------------------------------------------------------*/
 309 /* In tree-cfg.c  */
 310
 311 /* Location to track pending stmt for edge insertion.  */
 312 #define PENDING_STMT(e) ((e)->insns.g)
 313
 314 extern void delete_tree_cfg_annotations (void);
 315 extern bool stmt_ends_bb_p (gimple);
 316 extern bool is_ctrl_stmt (gimple);
 317 extern bool is_ctrl_altering_stmt (gimple);
 318 extern bool simple_goto_p (gimple);
 319 extern bool stmt_can_make_abnormal_goto (gimple);
 320 extern basic_block single_noncomplex_succ (basic_block bb);
 321 extern void gimple_dump_bb (FILE *, basic_block, int, int);
 322 extern void gimple_debug_bb (basic_block);
 323 extern basic_block gimple_debug_bb_n (int);
 324 extern void gimple_dump_cfg (FILE *, int);
 325 extern void gimple_debug_cfg (int);
 326 extern void dump_cfg_stats (FILE *);
 327 extern void dot_cfg (void);
 328 extern void debug_cfg_stats (void);
 329 extern void debug_loops (int);
 330 extern void debug_loop (struct loop *, int);
 331 extern void debug (struct loop &ref);
 332 extern void debug (struct loop *ptr);
 333 extern void debug_verbose (struct loop &ref);
 334 extern void debug_verbose (struct loop *ptr);
 335 extern void debug_loop_num (unsigned, int);
 336 extern void print_loops (FILE *, int);
 337 extern void print_loops_bb (FILE *, basic_block, int, int);
 338 extern void cleanup_dead_labels (void);
 339 extern void group_case_labels_stmt (gimple);
 340 extern void group_case_labels (void);
 341 extern gimple first_stmt (basic_block);
 342 extern gimple last_stmt (basic_block);
 343 extern gimple last_and_only_stmt (basic_block);
 344 extern edge find_taken_edge (basic_block, tree);
 345 extern basic_block label_to_block_fn (struct function *, tree);
 346 #define label_to_block(t) (label_to_block_fn (cfun, t))
 347 extern void notice_special_calls (gimple);
 348 extern void clear_special_calls (void);
 349 extern void verify_gimple_in_seq (gimple_seq);
 350 extern void verify_gimple_in_cfg (struct function *);
 351 extern tree gimple_block_label (basic_block);
 352 extern void extract_true_false_edges_from_block (basic_block, edge *, edge *);
 353 extern bool gimple_duplicate_sese_region (edge, edge, basic_block *, unsigned,
 354                                         basic_block *, bool);
 355 extern bool gimple_duplicate_sese_tail (edge, edge, basic_block *, unsigned,
 356                                       basic_block *);
 357 extern void gather_blocks_in_sese_region (basic_block entry, basic_block exit,
 358                                           vec<basic_block> *bbs_p);
 359 extern void add_phi_args_after_copy_bb (basic_block);
 360 extern void add_phi_args_after_copy (basic_block *, unsigned, edge);
 361 extern bool gimple_purge_dead_eh_edges (basic_block);
 362 extern bool gimple_purge_all_dead_eh_edges (const_bitmap);
 363 extern bool gimple_purge_dead_abnormal_call_edges (basic_block);
 364 extern bool gimple_purge_all_dead_abnormal_call_edges (const_bitmap);
 365 extern tree gimplify_build1 (gimple_stmt_iterator *, enum tree_code,
 366                              tree, tree);
 367 extern tree gimplify_build2 (gimple_stmt_iterator *, enum tree_code,
 368                              tree, tree, tree);
 369 extern tree gimplify_build3 (gimple_stmt_iterator *, enum tree_code,
 370                              tree, tree, tree, tree);
 371 extern void init_empty_tree_cfg (void);
 372 extern void init_empty_tree_cfg_for_function (struct function *);
 373 extern void fold_cond_expr_cond (void);
 374 extern void make_abnormal_goto_edges (basic_block, bool);
 375 extern void replace_uses_by (tree, tree);
 376 extern void start_recording_case_labels (void);
 377 extern void end_recording_case_labels (void);
 378 extern basic_block move_sese_region_to_fn (struct function *, basic_block,
 379                                            basic_block, tree);
 380 void remove_edge_and_dominated_blocks (edge);
 381 bool tree_node_can_be_shared (tree);
 382
 383 /* In tree-cfgcleanup.c  */
 384 extern bitmap cfgcleanup_altered_bbs;
 385 extern bool cleanup_tree_cfg (void);
 386
 387 /* In tree-pretty-print.c.  */
 388 extern void dump_generic_bb (FILE *, basic_block, int, int);
 389 extern int op_code_prio (enum tree_code);
 390 extern int op_prio (const_tree);
 391 extern const char *op_symbol_code (enum tree_code);
 392
 393 /* In tree-dfa.c  */
 394 extern void renumber_gimple_stmt_uids (void);
 395 extern void renumber_gimple_stmt_uids_in_blocks (basic_block *, int);
 396 extern void dump_dfa_stats (FILE *);
 397 extern void debug_dfa_stats (void);
 398 extern void dump_variable (FILE *, tree);
 399 extern void debug_variable (tree);
 400 extern void set_ssa_default_def (struct function *, tree, tree);
 401 extern tree ssa_default_def (struct function *, tree);
 402 extern tree get_or_create_ssa_default_def (struct function *, tree);
 403 extern bool stmt_references_abnormal_ssa_name (gimple);
 404 extern tree get_addr_base_and_unit_offset (tree, HOST_WIDE_INT *);
 405 extern void dump_enumerated_decls (FILE *, int);
 406
 407 /* In tree-phinodes.c  */
 408 extern void reserve_phi_args_for_new_edge (basic_block);
 409 extern void add_phi_node_to_bb (gimple phi, basic_block bb);
 410 extern gimple create_phi_node (tree, basic_block);
 411 extern void add_phi_arg (gimple, tree, edge, source_location);
 412 extern void remove_phi_args (edge);
 413 extern void remove_phi_node (gimple_stmt_iterator *, bool);
 414 extern void remove_phi_nodes (basic_block);
 415 extern void release_phi_node (gimple);
 416 extern void phinodes_print_statistics (void);
 417
 418 /* In gimple-low.c  */
 419 extern void record_vars_into (tree, tree);
 420 extern void record_vars (tree);
 421 extern bool gimple_seq_may_fallthru (gimple_seq);
 422 extern bool gimple_stmt_may_fallthru (gimple);
 423 extern bool gimple_check_call_matching_types (gimple, tree, bool);
 424
 425 /* In tree-into-ssa.c  */
 426 void update_ssa (unsigned);
 427 void delete_update_ssa (void);
 428 tree create_new_def_for (tree, gimple, def_operand_p);
 429 bool need_ssa_update_p (struct function *);
 430 bool name_registered_for_update_p (tree);
 431 void release_ssa_name_after_update_ssa (tree);
 432 void mark_virtual_operands_for_renaming (struct function *);
 433 tree get_current_def (tree);
 434 void set_current_def (tree, tree);
 435
 436 /* In tree-ssa-ccp.c  */
 437 tree fold_const_aggregate_ref (tree);
 438 tree gimple_fold_stmt_to_constant (gimple, tree (*)(tree));
 439
 440 /* In tree-ssa-dom.c  */
 441 extern void dump_dominator_optimization_stats (FILE *);
 442 extern void debug_dominator_optimization_stats (void);
 443 int loop_depth_of_name (tree);
 444 tree degenerate_phi_result (gimple);
 445 bool simple_iv_increment_p (gimple);
 446
 447 /* In tree-ssa-copy.c  */
 448 extern void propagate_value (use_operand_p, tree);
 449 extern void propagate_tree_value (tree *, tree);
 450 extern void propagate_tree_value_into_stmt (gimple_stmt_iterator *, tree);
 451 extern void replace_exp (use_operand_p, tree);
 452 extern bool may_propagate_copy (tree, tree);
 453 extern bool may_propagate_copy_into_stmt (gimple, tree);
 454 extern bool may_propagate_copy_into_asm (tree);
 455
 456 /* In tree-ssa-loop-ch.c  */
 457 bool do_while_loop_p (struct loop *);
 458
 459 /* Affine iv.  */
 460
 461 typedef struct
 462 {
 463   /* Iv = BASE + STEP * i.  */
 464   tree base, step;
 465
 466   /* True if this iv does not overflow.  */
 467   bool no_overflow;
 468 } affine_iv;
 469
 470 /* Description of number of iterations of a loop.  All the expressions inside
 471    the structure can be evaluated at the end of the loop's preheader
 472    (and due to ssa form, also anywhere inside the body of the loop).  */
 473
 474 struct tree_niter_desc
 475 {
 476   tree assumptions;     /* The boolean expression.  If this expression evaluates
 477                            to false, then the other fields in this structure
 478                            should not be used; there is no guarantee that they
 479                            will be correct.  */
 480   tree may_be_zero;     /* The boolean expression.  If it evaluates to true,
 481                            the loop will exit in the first iteration (i.e.
 482                            its latch will not be executed), even if the niter
 483                            field says otherwise.  */
 484   tree niter;           /* The expression giving the number of iterations of
 485                            a loop (provided that assumptions == true and
 486                            may_be_zero == false), more precisely the number
 487                            of executions of the latch of the loop.  */
 488   widest_int max;       /* The upper bound on the number of iterations of
 489                            the loop.  */
 490
 491   /* The simplified shape of the exit condition.  The loop exits if
 492      CONTROL CMP BOUND is false, where CMP is one of NE_EXPR,
 493      LT_EXPR, or GT_EXPR, and step of CONTROL is positive if CMP is
 494      LE_EXPR and negative if CMP is GE_EXPR.  This information is used
 495      by loop unrolling.  */
 496   affine_iv control;
 497   tree bound;
 498   enum tree_code cmp;
 499 };
 500
 501 /* In tree-ssa-phiopt.c */
 502 bool empty_block_p (basic_block);
 503 basic_block *blocks_in_phiopt_order (void);
 504 bool nonfreeing_call_p (gimple);
 505
 506 /* In tree-ssa-loop*.c  */
 507
 508 unsigned int tree_ssa_lim (void);
 509 unsigned int tree_ssa_unswitch_loops (void);
 510 unsigned int canonicalize_induction_variables (void);
 511 unsigned int tree_unroll_loops_completely (bool, bool);
 512 unsigned int tree_ssa_prefetch_arrays (void);
 513 void tree_ssa_iv_optimize (void);
 514 unsigned tree_predictive_commoning (void);
 515 tree canonicalize_loop_ivs (struct loop *, tree *, bool);
 516 bool parallelize_loops (void);
 517
 518 bool loop_only_exit_p (const struct loop *, const_edge);
 519 bool number_of_iterations_exit (struct loop *, edge,
 520                                 struct tree_niter_desc *niter, bool,
 521                                 bool every_iteration = true);
 522 tree find_loop_niter (struct loop *, edge *);
 523 tree loop_niter_by_eval (struct loop *, edge);
 524 tree find_loop_niter_by_eval (struct loop *, edge *);
 525 void estimate_numbers_of_iterations (void);
 526 bool scev_probably_wraps_p (tree, tree, gimple, struct loop *, bool);
 527 bool convert_affine_scev (struct loop *, tree, tree *, tree *, gimple, bool);
 528
 529 bool nowrap_type_p (tree);
 530 enum ev_direction {EV_DIR_GROWS, EV_DIR_DECREASES, EV_DIR_UNKNOWN};
 531 enum ev_direction scev_direction (const_tree);
 532
 533 void free_numbers_of_iterations_estimates (void);
 534 void free_numbers_of_iterations_estimates_loop (struct loop *);
 535 void rewrite_into_loop_closed_ssa (bitmap, unsigned);
 536 void verify_loop_closed_ssa (bool);
 537 bool for_each_index (tree *, bool (*) (tree, tree *, void *), void *);
 538 void create_iv (tree, tree, tree, struct loop *, gimple_stmt_iterator *, bool,
 539                 tree *, tree *);
 540 basic_block split_loop_exit_edge (edge);
 541 void standard_iv_increment_position (struct loop *, gimple_stmt_iterator *,
 542                                      bool *);
 543 basic_block ip_end_pos (struct loop *);
 544 basic_block ip_normal_pos (struct loop *);
 545 bool gimple_duplicate_loop_to_header_edge (struct loop *, edge,
 546                                          unsigned int, sbitmap,
 547                                          edge, vec<edge> *,
 548                                          int);
 549 struct loop *slpeel_tree_duplicate_loop_to_edge_cfg (struct loop *, edge);
 550 tree expand_simple_operations (tree);
 551 void substitute_in_loop_info (struct loop *, tree, tree);
 552 edge single_dom_exit (struct loop *);
 553 bool can_unroll_loop_p (struct loop *loop, unsigned factor,
 554                         struct tree_niter_desc *niter);
 555 void tree_unroll_loop (struct loop *, unsigned,
 556                        edge, struct tree_niter_desc *);
 557 typedef void (*transform_callback)(struct loop *, void *);
 558 void tree_transform_and_unroll_loop (struct loop *, unsigned,
 559                                      edge, struct tree_niter_desc *,
 560                                      transform_callback, void *);
 561 bool contains_abnormal_ssa_name_p (tree);
 562 bool stmt_dominates_stmt_p (gimple, gimple);
 563
 564 /* In tree-ssa-dce.c */
 565 void mark_virtual_operand_for_renaming (tree);
 566 void mark_virtual_phi_result_for_renaming (gimple);
 567
 568 /* In tree-ssa-threadedge.c */
 569 extern void threadedge_initialize_values (void);
 570 extern void threadedge_finalize_values (void);
 571 extern vec<tree> ssa_name_values;
 572 #define SSA_NAME_VALUE(x) \
 573     (SSA_NAME_VERSION(x) < ssa_name_values.length () \
 574      ? ssa_name_values[SSA_NAME_VERSION(x)] \
 575      : NULL_TREE)
 576 extern void set_ssa_name_value (tree, tree);
 577 extern bool potentially_threadable_block (basic_block);
 578 extern void thread_across_edge (gimple, edge, bool,
 579                                 vec<tree> *, tree (*) (gimple, gimple));
 580 extern void propagate_threaded_block_debug_into (basic_block, basic_block);
 581
 582 /* In tree-ssa-loop-im.c  */
 583 /* The possibilities of statement movement.  */
 584
 585 enum move_pos
 586   {
 587     MOVE_IMPOSSIBLE,            /* No movement -- side effect expression.  */
 588     MOVE_PRESERVE_EXECUTION,    /* Must not cause the non-executed statement
 589                                    become executed -- memory accesses, ... */
 590     MOVE_POSSIBLE               /* Unlimited movement.  */
 591   };
 592 extern enum move_pos movement_possibility (gimple);
 593 char *get_lsm_tmp_name (tree, unsigned);
 594
 595 /* In tree-flow-inline.h  */
 596 static inline bool unmodifiable_var_p (const_tree);
 597 static inline bool ref_contains_array_ref (const_tree);
 598
 599 /* In tree-eh.c  */
 600 extern void make_eh_edges (gimple);
 601 extern bool make_eh_dispatch_edges (gimple);
 602 extern edge redirect_eh_edge (edge, basic_block);
 603 extern void redirect_eh_dispatch_edge (gimple, edge, basic_block);
 604 extern bool stmt_could_throw_p (gimple);
 605 extern bool stmt_can_throw_internal (gimple);
 606 extern bool stmt_can_throw_external (gimple);
 607 extern void add_stmt_to_eh_lp_fn (struct function *, gimple, int);
 608 extern void add_stmt_to_eh_lp (gimple, int);
 609 extern bool remove_stmt_from_eh_lp (gimple);
 610 extern bool remove_stmt_from_eh_lp_fn (struct function *, gimple);
 611 extern int lookup_stmt_eh_lp_fn (struct function *, gimple);
 612 extern int lookup_stmt_eh_lp (gimple);
 613 extern bool maybe_clean_eh_stmt_fn (struct function *, gimple);
 614 extern bool maybe_clean_eh_stmt (gimple);
 615 extern bool maybe_clean_or_replace_eh_stmt (gimple, gimple);
 616 extern bool maybe_duplicate_eh_stmt_fn (struct function *, gimple,
 617                                         struct function *, gimple,
 618                                         struct pointer_map_t *, int);
 619 extern bool maybe_duplicate_eh_stmt (gimple, gimple);
 620 extern bool verify_eh_edges (gimple);
 621 extern bool verify_eh_dispatch_edge (gimple);
 622 extern void maybe_remove_unreachable_handlers (void);
 623
 624 /* In tree-ssa-pre.c  */
 625 void debug_value_expressions (unsigned int);
 626
 627 /* In tree-loop-linear.c  */
 628 extern void linear_transform_loops (void);
 629 extern unsigned perfect_loop_nest_depth (struct loop *);
 630
 631 /* In graphite.c  */
 632 extern void graphite_transform_loops (void);
 633
 634 /* In tree-data-ref.c  */
 635 extern void tree_check_data_deps (void);
 636
 637 /* In tree-ssa-loop-ivopts.c  */
 638 bool expr_invariant_in_loop_p (struct loop *, tree);
 639 bool stmt_invariant_in_loop_p (struct loop *, gimple);
 640 struct loop *outermost_invariant_loop_for_expr (struct loop *, tree);
 641 bool multiplier_allowed_in_address_p (HOST_WIDE_INT, enum machine_mode,
 642                                       addr_space_t);
 643 bool may_be_nonaddressable_p (tree expr);
 644
 645 /* In tree-ssa-threadupdate.c.  */
 646 extern bool thread_through_all_blocks (bool);
 647 extern void register_jump_thread (vec<edge>, bool);
 648
 649 /* In gimplify.c  */
 650 tree force_gimple_operand_1 (tree, gimple_seq *, gimple_predicate, tree);
 651 tree force_gimple_operand (tree, gimple_seq *, bool, tree);
 652 tree force_gimple_operand_gsi_1 (gimple_stmt_iterator *, tree,
 653                                  gimple_predicate, tree,
 654                                  bool, enum gsi_iterator_update);
 655 tree force_gimple_operand_gsi (gimple_stmt_iterator *, tree, bool, tree,
 656                                bool, enum gsi_iterator_update);
 657 tree gimple_fold_indirect_ref (tree);
 658
 659 /* In tree-ssa-live.c */
 660 extern void remove_unused_locals (void);
 661 extern void dump_scope_blocks (FILE *, int);
 662 extern void debug_scope_blocks (int);
 663 extern void debug_scope_block (tree, int);
 664
 665 /* In tree-ssa-address.c  */
 666
 667 /* Description of a memory address.  */
 668
 669 struct mem_address
 670 {
 671   tree symbol, base, index, step, offset;
 672 };
 673
 674 struct affine_tree_combination;
 675 tree create_mem_ref (gimple_stmt_iterator *, tree,
 676                      struct affine_tree_combination *, tree, tree, tree, bool);
 677 rtx addr_for_mem_ref (struct mem_address *, addr_space_t, bool);
 678 void get_address_description (tree, struct mem_address *);
 679 tree maybe_fold_tmr (tree);
 680
 681 unsigned int execute_fixup_cfg (void);
 682 bool fixup_noreturn_call (gimple stmt);
 683
 684 /* In ipa-pure-const.c  */
 685 void warn_function_noreturn (tree);
 686
 687 /* In tree-ssa-ter.c  */
 688 bool stmt_is_replaceable_p (gimple);
 689
 690 /* In tree-parloops.c  */
 691 bool parallelized_function_p (tree);
 692
 693 #include "tree-flow-inline.h"
 694
 695 void swap_tree_operands (gimple, tree *, tree *);
 696
 697 #endif /* _TREE_FLOW_H  */