gcc/tree-flow.h

   1 /* Data and Control Flow Analysis for Trees.
   2    Copyright (C) 2001, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010
   3    Free Software Foundation, Inc.
   4    Contributed by Diego Novillo <dnovillo@redhat.com>
   5
   6 This file is part of GCC.
   7
   8 GCC is free software; you can redistribute it and/or modify
   9 it under the terms of the GNU General Public License as published by
  10 the Free Software Foundation; either version 3, or (at your option)
  11 any later version.
  12
  13 GCC is distributed in the hope that it will be useful,
  14 but WITHOUT ANY WARRANTY; without even the implied warranty of
  15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  16 GNU General Public License for more details.
  17
  18 You should have received a copy of the GNU General Public License
  19 along with GCC; see the file COPYING3.  If not see
  20 <http://www.gnu.org/licenses/>.  */
  21
  22 #ifndef _TREE_FLOW_H
  23 #define _TREE_FLOW_H 1
  24
  25 #include "bitmap.h"
  26 #include "sbitmap.h"
  27 #include "basic-block.h"
  28 #include "hashtab.h"
  29 #include "gimple.h"
  30 #include "tree-ssa-operands.h"
  31 #include "cgraph.h"
  32 #include "ipa-reference.h"
  33 #include "tree-ssa-alias.h"
  34
  35
  36 /* Gimple dataflow datastructure. All publicly available fields shall have
  37    gimple_ accessor defined in tree-flow-inline.h, all publicly modifiable
  38    fields should have gimple_set accessor.  */
  39 struct GTY(()) gimple_df {
  40   /* Array of all variables referenced in the function.  */
  41   htab_t GTY((param_is (union tree_node))) referenced_vars;
  42
  43   /* A vector of all the noreturn calls passed to modify_stmt.
  44      cleanup_control_flow uses it to detect cases where a mid-block
  45      indirect call has been turned into a noreturn call.  When this
  46      happens, all the instructions after the call are no longer
  47      reachable and must be deleted as dead.  */
  48   VEC(gimple,gc) *modified_noreturn_calls;
  49
  50   /* Array of all SSA_NAMEs used in the function.  */
  51   VEC(tree,gc) *ssa_names;
  52
  53   /* Artificial variable used for the virtual operand FUD chain.  */
  54   tree vop;
  55
  56   /* The PTA solution for the ESCAPED artificial variable.  */
  57   struct pt_solution escaped;
  58
  59   /* A map of decls to artificial ssa-names that point to the partition
  60      of the decl.  */
  61   struct pointer_map_t * GTY((skip(""))) decls_to_pointers;
  62
  63   /* Free list of SSA_NAMEs.  */
  64   tree free_ssanames;
  65
  66   /* Hashtable holding definition for symbol.  If this field is not NULL, it
  67      means that the first reference to this variable in the function is a
  68      USE or a VUSE.  In those cases, the SSA renamer creates an SSA name
  69      for this variable with an empty defining statement.  */
  70   htab_t GTY((param_is (union tree_node))) default_defs;
  71
  72   /* Symbols whose SSA form needs to be updated or created for the first
  73      time.  */
  74   bitmap syms_to_rename;
  75
  76   /* True if the code is in ssa form.  */
  77   unsigned int in_ssa_p : 1;
  78
  79   /* True if IPA points-to information was computed for this function.  */
  80   unsigned int ipa_pta : 1;
  81
  82   struct ssa_operands ssa_operands;
  83 };
  84
  85 /* Accessors for internal use only.  Generic code should use abstraction
  86    provided by tree-flow-inline.h or specific modules.  */
  87 #define FREE_SSANAMES(fun) (fun)->gimple_df->free_ssanames
  88 #define SSANAMES(fun) (fun)->gimple_df->ssa_names
  89 #define MODIFIED_NORETURN_CALLS(fun) (fun)->gimple_df->modified_noreturn_calls
  90 #define DEFAULT_DEFS(fun) (fun)->gimple_df->default_defs
  91 #define SYMS_TO_RENAME(fun) (fun)->gimple_df->syms_to_rename
  92
  93 typedef struct
  94 {
  95   htab_t htab;
  96   PTR *slot;
  97   PTR *limit;
  98 } htab_iterator;
  99
 100 /* Iterate through the elements of hashtable HTAB, using htab_iterator ITER,
 101    storing each element in RESULT, which is of type TYPE.  */
 102 #define FOR_EACH_HTAB_ELEMENT(HTAB, RESULT, TYPE, ITER) \
 103   for (RESULT = (TYPE) first_htab_element (&(ITER), (HTAB)); \
 104         !end_htab_p (&(ITER)); \
 105         RESULT = (TYPE) next_htab_element (&(ITER)))
 106
 107 /*---------------------------------------------------------------------------
 108                       Attributes for SSA_NAMEs.
 109
 110   NOTE: These structures are stored in struct tree_ssa_name
 111   but are only used by the tree optimizers, so it makes better sense
 112   to declare them here to avoid recompiling unrelated files when
 113   making changes.
 114 ---------------------------------------------------------------------------*/
 115
 116 /* Aliasing information for SSA_NAMEs representing pointer variables.  */
 117
 118 struct GTY(()) ptr_info_def
 119 {
 120   /* The points-to solution.  */
 121   struct pt_solution pt;
 122
 123   /* Alignment and misalignment of the pointer in bytes.  Together
 124      align and misalign specify low known bits of the pointer.
 125      ptr & (align - 1) == misalign.  */
 126
 127   /* The power-of-two byte alignment of the object this pointer
 128      points into.  This is usually DECL_ALIGN_UNIT for decls and
 129      MALLOC_ABI_ALIGNMENT for allocated storage.  */
 130   unsigned int align;
 131
 132   /* The byte offset this pointer differs from the above alignment.  */
 133   unsigned int misalign;
 134 };
 135
 136
 137 /* It is advantageous to avoid things like life analysis for variables which
 138    do not need PHI nodes.  This enum describes whether or not a particular
 139    variable may need a PHI node.  */
 140
 141 enum need_phi_state {
 142   /* This is the default.  If we are still in this state after finding
 143      all the definition and use sites, then we will assume the variable
 144      needs PHI nodes.  This is probably an overly conservative assumption.  */
 145   NEED_PHI_STATE_UNKNOWN,
 146
 147   /* This state indicates that we have seen one or more sets of the
 148      variable in a single basic block and that the sets dominate all
 149      uses seen so far.  If after finding all definition and use sites
 150      we are still in this state, then the variable does not need any
 151      PHI nodes.  */
 152   NEED_PHI_STATE_NO,
 153
 154   /* This state indicates that we have either seen multiple definitions of
 155      the variable in multiple blocks, or that we encountered a use in a
 156      block that was not dominated by the block containing the set(s) of
 157      this variable.  This variable is assumed to need PHI nodes.  */
 158   NEED_PHI_STATE_MAYBE
 159 };
 160
 161
 162 struct GTY(()) var_ann_d {
 163   /* Used when building base variable structures in a var_map.  */
 164   unsigned base_var_processed : 1;
 165
 166   /* Nonzero if this variable was used after SSA optimizations were
 167      applied.  We set this when translating out of SSA form.  */
 168   unsigned used : 1;
 169
 170   /* This field indicates whether or not the variable may need PHI nodes.
 171      See the enum's definition for more detailed information about the
 172      states.  */
 173   ENUM_BITFIELD (need_phi_state) need_phi_state : 2;
 174
 175   /* True for HEAP artificial variables.  These variables represent
 176      the memory area allocated by a call to malloc.  */
 177   unsigned is_heapvar : 1;
 178
 179   /* Used by var_map for the base index of ssa base variables.  */
 180   unsigned base_index;
 181
 182   /* During into-ssa and the dominator optimizer, this field holds the
 183      current version of this variable (an SSA_NAME).  */
 184   tree current_def;
 185 };
 186
 187
 188 /* Immediate use lists are used to directly access all uses for an SSA
 189    name and get pointers to the statement for each use.
 190
 191    The structure ssa_use_operand_d consists of PREV and NEXT pointers
 192    to maintain the list.  A USE pointer, which points to address where
 193    the use is located and a LOC pointer which can point to the
 194    statement where the use is located, or, in the case of the root
 195    node, it points to the SSA name itself.
 196
 197    The list is anchored by an occurrence of ssa_operand_d *in* the
 198    ssa_name node itself (named 'imm_uses').  This node is uniquely
 199    identified by having a NULL USE pointer. and the LOC pointer
 200    pointing back to the ssa_name node itself.  This node forms the
 201    base for a circular list, and initially this is the only node in
 202    the list.
 203
 204    Fast iteration allows each use to be examined, but does not allow
 205    any modifications to the uses or stmts.
 206
 207    Normal iteration allows insertion, deletion, and modification. the
 208    iterator manages this by inserting a marker node into the list
 209    immediately before the node currently being examined in the list.
 210    this marker node is uniquely identified by having null stmt *and* a
 211    null use pointer.
 212
 213    When iterating to the next use, the iteration routines check to see
 214    if the node after the marker has changed. if it has, then the node
 215    following the marker is now the next one to be visited. if not, the
 216    marker node is moved past that node in the list (visualize it as
 217    bumping the marker node through the list).  this continues until
 218    the marker node is moved to the original anchor position. the
 219    marker node is then removed from the list.
 220
 221    If iteration is halted early, the marker node must be removed from
 222    the list before continuing.  */
 223 typedef struct immediate_use_iterator_d
 224 {
 225   /* This is the current use the iterator is processing.  */
 226   ssa_use_operand_t *imm_use;
 227   /* This marks the last use in the list (use node from SSA_NAME)  */
 228   ssa_use_operand_t *end_p;
 229   /* This node is inserted and used to mark the end of the uses for a stmt.  */
 230   ssa_use_operand_t iter_node;
 231   /* This is the next ssa_name to visit.  IMM_USE may get removed before
 232      the next one is traversed to, so it must be cached early.  */
 233   ssa_use_operand_t *next_imm_name;
 234 } imm_use_iterator;
 235
 236
 237 /* Use this iterator when simply looking at stmts.  Adding, deleting or
 238    modifying stmts will cause this iterator to malfunction.  */
 239
 240 #define FOR_EACH_IMM_USE_FAST(DEST, ITER, SSAVAR)               \
 241   for ((DEST) = first_readonly_imm_use (&(ITER), (SSAVAR));     \
 242        !end_readonly_imm_use_p (&(ITER));                       \
 243        (void) ((DEST) = next_readonly_imm_use (&(ITER))))
 244
 245 /* Use this iterator to visit each stmt which has a use of SSAVAR.  */
 246
 247 #define FOR_EACH_IMM_USE_STMT(STMT, ITER, SSAVAR)               \
 248   for ((STMT) = first_imm_use_stmt (&(ITER), (SSAVAR));         \
 249        !end_imm_use_stmt_p (&(ITER));                           \
 250        (void) ((STMT) = next_imm_use_stmt (&(ITER))))
 251
 252 /* Use this to terminate the FOR_EACH_IMM_USE_STMT loop early.  Failure to
 253    do so will result in leaving a iterator marker node in the immediate
 254    use list, and nothing good will come from that.   */
 255 #define BREAK_FROM_IMM_USE_STMT(ITER)                           \
 256    {                                                            \
 257      end_imm_use_stmt_traverse (&(ITER));                       \
 258      break;                                                     \
 259    }
 260
 261
 262 /* Use this iterator in combination with FOR_EACH_IMM_USE_STMT to
 263    get access to each occurrence of ssavar on the stmt returned by
 264    that iterator..  for instance:
 265
 266      FOR_EACH_IMM_USE_STMT (stmt, iter, var)
 267        {
 268          FOR_EACH_IMM_USE_ON_STMT (use_p, iter)
 269            {
 270              SET_USE (use_p, blah);
 271            }
 272          update_stmt (stmt);
 273        }                                                         */
 274
 275 #define FOR_EACH_IMM_USE_ON_STMT(DEST, ITER)                    \
 276   for ((DEST) = first_imm_use_on_stmt (&(ITER));                \
 277        !end_imm_use_on_stmt_p (&(ITER));                        \
 278        (void) ((DEST) = next_imm_use_on_stmt (&(ITER))))
 279
 280
 281
 282 typedef struct var_ann_d *var_ann_t;
 283
 284 static inline var_ann_t var_ann (const_tree);
 285 static inline var_ann_t get_var_ann (tree);
 286 static inline void update_stmt (gimple);
 287 static inline int get_lineno (const_gimple);
 288
 289 /*---------------------------------------------------------------------------
 290                   Structure representing predictions in tree level.
 291 ---------------------------------------------------------------------------*/
 292 struct GTY((chain_next ("%h.ep_next"))) edge_prediction {
 293   struct edge_prediction *ep_next;
 294   edge ep_edge;
 295   enum br_predictor ep_predictor;
 296   int ep_probability;
 297 };
 298
 299 /* Accessors for basic block annotations.  */
 300 static inline gimple_seq phi_nodes (const_basic_block);
 301 static inline void set_phi_nodes (basic_block, gimple_seq);
 302
 303 /*---------------------------------------------------------------------------
 304                               Global declarations
 305 ---------------------------------------------------------------------------*/
 306 struct GTY(()) int_tree_map {
 307
 308   unsigned int uid;
 309   tree to;
 310 };
 311
 312 extern unsigned int int_tree_map_hash (const void *);
 313 extern int int_tree_map_eq (const void *, const void *);
 314
 315 extern unsigned int uid_decl_map_hash (const void *);
 316 extern int uid_decl_map_eq (const void *, const void *);
 317
 318 typedef struct
 319 {
 320   htab_iterator hti;
 321 } referenced_var_iterator;
 322
 323 /* This macro loops over all the referenced vars, one at a time, putting the
 324    current var in VAR.  Note:  You are not allowed to add referenced variables
 325    to the hashtable while using this macro.  Doing so may cause it to behave
 326    erratically.  */
 327
 328 #define FOR_EACH_REFERENCED_VAR(VAR, ITER) \
 329   for ((VAR) = first_referenced_var (&(ITER)); \
 330        !end_referenced_vars_p (&(ITER)); \
 331        (VAR) = next_referenced_var (&(ITER)))
 332
 333 extern tree referenced_var_lookup (unsigned int);
 334 extern bool referenced_var_check_and_insert (tree);
 335 #define num_referenced_vars htab_elements (gimple_referenced_vars (cfun))
 336
 337 #define num_ssa_names (VEC_length (tree, cfun->gimple_df->ssa_names))
 338 #define ssa_name(i) (VEC_index (tree, cfun->gimple_df->ssa_names, (i)))
 339
 340 /* Macros for showing usage statistics.  */
 341 #define SCALE(x) ((unsigned long) ((x) < 1024*10        \
 342                   ? (x)                                 \
 343                   : ((x) < 1024*1024*10                 \
 344                      ? (x) / 1024                       \
 345                      : (x) / (1024*1024))))
 346
 347 #define LABEL(x) ((x) < 1024*10 ? 'b' : ((x) < 1024*1024*10 ? 'k' : 'M'))
 348
 349 #define PERCENT(x,y) ((float)(x) * 100.0 / (float)(y))
 350
 351 /*---------------------------------------------------------------------------
 352                               OpenMP Region Tree
 353 ---------------------------------------------------------------------------*/
 354
 355 /* Parallel region information.  Every parallel and workshare
 356    directive is enclosed between two markers, the OMP_* directive
 357    and a corresponding OMP_RETURN statement.  */
 358
 359 struct omp_region
 360 {
 361   /* The enclosing region.  */
 362   struct omp_region *outer;
 363
 364   /* First child region.  */
 365   struct omp_region *inner;
 366
 367   /* Next peer region.  */
 368   struct omp_region *next;
 369
 370   /* Block containing the omp directive as its last stmt.  */
 371   basic_block entry;
 372
 373   /* Block containing the OMP_RETURN as its last stmt.  */
 374   basic_block exit;
 375
 376   /* Block containing the OMP_CONTINUE as its last stmt.  */
 377   basic_block cont;
 378
 379   /* If this is a combined parallel+workshare region, this is a list
 380      of additional arguments needed by the combined parallel+workshare
 381      library call.  */
 382   VEC(tree,gc) *ws_args;
 383
 384   /* The code for the omp directive of this region.  */
 385   enum gimple_code type;
 386
 387   /* Schedule kind, only used for OMP_FOR type regions.  */
 388   enum omp_clause_schedule_kind sched_kind;
 389
 390   /* True if this is a combined parallel+workshare region.  */
 391   bool is_combined_parallel;
 392 };
 393
 394 extern struct omp_region *root_omp_region;
 395 extern struct omp_region *new_omp_region (basic_block, enum gimple_code,
 396                                           struct omp_region *);
 397 extern void free_omp_regions (void);
 398 void omp_expand_local (basic_block);
 399 extern tree find_omp_clause (tree, enum omp_clause_code);
 400 tree copy_var_decl (tree, tree, tree);
 401
 402 /*---------------------------------------------------------------------------
 403                               Function prototypes
 404 ---------------------------------------------------------------------------*/
 405 /* In tree-cfg.c  */
 406
 407 /* Location to track pending stmt for edge insertion.  */
 408 #define PENDING_STMT(e) ((e)->insns.g)
 409
 410 extern void delete_tree_cfg_annotations (void);
 411 extern bool stmt_ends_bb_p (gimple);
 412 extern bool is_ctrl_stmt (gimple);
 413 extern bool is_ctrl_altering_stmt (gimple);
 414 extern bool simple_goto_p (gimple);
 415 extern bool stmt_can_make_abnormal_goto (gimple);
 416 extern basic_block single_noncomplex_succ (basic_block bb);
 417 extern void gimple_dump_bb (basic_block, FILE *, int, int);
 418 extern void gimple_debug_bb (basic_block);
 419 extern basic_block gimple_debug_bb_n (int);
 420 extern void gimple_dump_cfg (FILE *, int);
 421 extern void gimple_debug_cfg (int);
 422 extern void dump_cfg_stats (FILE *);
 423 extern void dot_cfg (void);
 424 extern void debug_cfg_stats (void);
 425 extern void debug_loops (int);
 426 extern void debug_loop (struct loop *, int);
 427 extern void debug_loop_num (unsigned, int);
 428 extern void print_loops (FILE *, int);
 429 extern void print_loops_bb (FILE *, basic_block, int, int);
 430 extern void cleanup_dead_labels (void);
 431 extern void group_case_labels (void);
 432 extern gimple first_stmt (basic_block);
 433 extern gimple last_stmt (basic_block);
 434 extern gimple last_and_only_stmt (basic_block);
 435 extern edge find_taken_edge (basic_block, tree);
 436 extern basic_block label_to_block_fn (struct function *, tree);
 437 #define label_to_block(t) (label_to_block_fn (cfun, t))
 438 extern void notice_special_calls (gimple);
 439 extern void clear_special_calls (void);
 440 extern void verify_stmts (void);
 441 extern void verify_gimple (void);
 442 extern void verify_types_in_gimple_seq (gimple_seq);
 443 extern tree gimple_block_label (basic_block);
 444 extern void extract_true_false_edges_from_block (basic_block, edge *, edge *);
 445 extern bool gimple_duplicate_sese_region (edge, edge, basic_block *, unsigned,
 446                                         basic_block *);
 447 extern bool gimple_duplicate_sese_tail (edge, edge, basic_block *, unsigned,
 448                                       basic_block *);
 449 extern void gather_blocks_in_sese_region (basic_block entry, basic_block exit,
 450                                           VEC(basic_block,heap) **bbs_p);
 451 extern void add_phi_args_after_copy_bb (basic_block);
 452 extern void add_phi_args_after_copy (basic_block *, unsigned, edge);
 453 extern bool gimple_purge_dead_eh_edges (basic_block);
 454 extern bool gimple_purge_all_dead_eh_edges (const_bitmap);
 455 extern bool gimple_purge_dead_abnormal_call_edges (basic_block);
 456 extern bool gimple_purge_all_dead_abnormal_call_edges (const_bitmap);
 457 extern tree gimplify_build1 (gimple_stmt_iterator *, enum tree_code,
 458                              tree, tree);
 459 extern tree gimplify_build2 (gimple_stmt_iterator *, enum tree_code,
 460                              tree, tree, tree);
 461 extern tree gimplify_build3 (gimple_stmt_iterator *, enum tree_code,
 462                              tree, tree, tree, tree);
 463 extern void init_empty_tree_cfg (void);
 464 extern void init_empty_tree_cfg_for_function (struct function *);
 465 extern void fold_cond_expr_cond (void);
 466 extern void make_abnormal_goto_edges (basic_block, bool);
 467 extern void replace_uses_by (tree, tree);
 468 extern void start_recording_case_labels (void);
 469 extern void end_recording_case_labels (void);
 470 extern basic_block move_sese_region_to_fn (struct function *, basic_block,
 471                                            basic_block, tree);
 472 void remove_edge_and_dominated_blocks (edge);
 473 bool tree_node_can_be_shared (tree);
 474
 475 /* In tree-cfgcleanup.c  */
 476 extern bitmap cfgcleanup_altered_bbs;
 477 extern bool cleanup_tree_cfg (void);
 478
 479 /* In tree-pretty-print.c.  */
 480 extern void dump_generic_bb (FILE *, basic_block, int, int);
 481 extern int op_code_prio (enum tree_code);
 482 extern int op_prio (const_tree);
 483 extern const char *op_symbol_code (enum tree_code);
 484
 485 /* In tree-dfa.c  */
 486 extern var_ann_t create_var_ann (tree);
 487 extern void renumber_gimple_stmt_uids (void);
 488 extern void renumber_gimple_stmt_uids_in_blocks (basic_block *, int);
 489 extern void dump_dfa_stats (FILE *);
 490 extern void debug_dfa_stats (void);
 491 extern void debug_referenced_vars (void);
 492 extern void dump_referenced_vars (FILE *);
 493 extern void dump_variable (FILE *, tree);
 494 extern void debug_variable (tree);
 495 extern tree get_virtual_var (tree);
 496 extern bool add_referenced_var (tree);
 497 extern void remove_referenced_var (tree);
 498 extern void mark_symbols_for_renaming (gimple);
 499 extern void find_new_referenced_vars (gimple);
 500 extern tree make_rename_temp (tree, const char *);
 501 extern void set_default_def (tree, tree);
 502 extern tree gimple_default_def (struct function *, tree);
 503 extern bool stmt_references_abnormal_ssa_name (gimple);
 504 extern tree get_ref_base_and_extent (tree, HOST_WIDE_INT *,
 505                                      HOST_WIDE_INT *, HOST_WIDE_INT *);
 506 extern tree get_addr_base_and_unit_offset (tree, HOST_WIDE_INT *);
 507 extern void find_referenced_vars_in (gimple);
 508
 509 /* In tree-phinodes.c  */
 510 extern void reserve_phi_args_for_new_edge (basic_block);
 511 extern void add_phi_node_to_bb (gimple phi, basic_block bb);
 512 extern gimple make_phi_node (tree var, int len);
 513 extern gimple create_phi_node (tree, basic_block);
 514 extern void add_phi_arg (gimple, tree, edge, source_location);
 515 extern void remove_phi_args (edge);
 516 extern void remove_phi_node (gimple_stmt_iterator *, bool);
 517 extern void remove_phi_nodes (basic_block);
 518 extern void init_phinodes (void);
 519 extern void fini_phinodes (void);
 520 extern void release_phi_node (gimple);
 521 #ifdef GATHER_STATISTICS
 522 extern void phinodes_print_statistics (void);
 523 #endif
 524
 525 /* In gimple-low.c  */
 526 extern void record_vars_into (tree, tree);
 527 extern void record_vars (tree);
 528 extern bool gimple_seq_may_fallthru (gimple_seq);
 529 extern bool gimple_stmt_may_fallthru (gimple);
 530 extern bool gimple_check_call_args (gimple);
 531
 532
 533 /* In tree-ssa.c  */
 534
 535 /* Mapping for redirected edges.  */
 536 struct GTY(()) _edge_var_map {
 537   tree result;                  /* PHI result.  */
 538   tree def;                     /* PHI arg definition.  */
 539   source_location locus;        /* PHI arg location.  */
 540 };
 541 typedef struct _edge_var_map edge_var_map;
 542
 543 DEF_VEC_O(edge_var_map);
 544 DEF_VEC_ALLOC_O(edge_var_map, heap);
 545
 546 /* A vector of var maps.  */
 547 typedef VEC(edge_var_map, heap) *edge_var_map_vector;
 548
 549 extern void init_tree_ssa (struct function *);
 550 extern void redirect_edge_var_map_add (edge, tree, tree, source_location);
 551 extern void redirect_edge_var_map_clear (edge);
 552 extern void redirect_edge_var_map_dup (edge, edge);
 553 extern edge_var_map_vector redirect_edge_var_map_vector (edge);
 554 extern void redirect_edge_var_map_destroy (void);
 555
 556 extern edge ssa_redirect_edge (edge, basic_block);
 557 extern void flush_pending_stmts (edge);
 558 extern void verify_ssa (bool);
 559 extern void delete_tree_ssa (void);
 560 extern bool ssa_undefined_value_p (tree);
 561 extern void warn_uninit (tree, const char *, void *);
 562 extern unsigned int warn_uninitialized_vars (bool);
 563 extern void execute_update_addresses_taken (void);
 564
 565 /* Call-back function for walk_use_def_chains().  At each reaching
 566    definition, a function with this prototype is called.  */
 567 typedef bool (*walk_use_def_chains_fn) (tree, gimple, void *);
 568
 569 extern void walk_use_def_chains (tree, walk_use_def_chains_fn, void *, bool);
 570
 571 void insert_debug_temps_for_defs (gimple_stmt_iterator *);
 572 void insert_debug_temp_for_var_def (gimple_stmt_iterator *, tree);
 573 void release_defs_bitset (bitmap toremove);
 574
 575 /* In tree-into-ssa.c  */
 576 void update_ssa (unsigned);
 577 void delete_update_ssa (void);
 578 void register_new_name_mapping (tree, tree);
 579 tree create_new_def_for (tree, gimple, def_operand_p);
 580 bool need_ssa_update_p (struct function *);
 581 bool name_mappings_registered_p (void);
 582 bool name_registered_for_update_p (tree);
 583 bitmap ssa_names_to_replace (void);
 584 void release_ssa_name_after_update_ssa (tree);
 585 void compute_global_livein (bitmap, bitmap);
 586 void mark_sym_for_renaming (tree);
 587 void mark_set_for_renaming (bitmap);
 588 bool symbol_marked_for_renaming (tree);
 589 tree get_current_def (tree);
 590 void set_current_def (tree, tree);
 591
 592 /* In tree-ssanames.c  */
 593 extern void init_ssanames (struct function *, int);
 594 extern void fini_ssanames (void);
 595 extern tree make_ssa_name_fn (struct function *, tree, gimple);
 596 extern tree duplicate_ssa_name (tree, gimple);
 597 extern void duplicate_ssa_name_ptr_info (tree, struct ptr_info_def *);
 598 extern void release_ssa_name (tree);
 599 extern void release_defs (gimple);
 600 extern void replace_ssa_name_symbol (tree, tree);
 601
 602 #ifdef GATHER_STATISTICS
 603 extern void ssanames_print_statistics (void);
 604 #endif
 605
 606 /* In tree-ssa-ccp.c  */
 607 tree fold_const_aggregate_ref (tree);
 608
 609 /* In tree-ssa-dom.c  */
 610 extern void dump_dominator_optimization_stats (FILE *);
 611 extern void debug_dominator_optimization_stats (void);
 612 int loop_depth_of_name (tree);
 613 tree degenerate_phi_result (gimple);
 614
 615 /* In tree-ssa-copy.c  */
 616 extern void propagate_value (use_operand_p, tree);
 617 extern void propagate_tree_value (tree *, tree);
 618 extern void propagate_tree_value_into_stmt (gimple_stmt_iterator *, tree);
 619 extern void replace_exp (use_operand_p, tree);
 620 extern bool may_propagate_copy (tree, tree);
 621 extern bool may_propagate_copy_into_stmt (gimple, tree);
 622 extern bool may_propagate_copy_into_asm (tree);
 623
 624 /* Affine iv.  */
 625
 626 typedef struct
 627 {
 628   /* Iv = BASE + STEP * i.  */
 629   tree base, step;
 630
 631   /* True if this iv does not overflow.  */
 632   bool no_overflow;
 633 } affine_iv;
 634
 635 /* Description of number of iterations of a loop.  All the expressions inside
 636    the structure can be evaluated at the end of the loop's preheader
 637    (and due to ssa form, also anywhere inside the body of the loop).  */
 638
 639 struct tree_niter_desc
 640 {
 641   tree assumptions;     /* The boolean expression.  If this expression evaluates
 642                            to false, then the other fields in this structure
 643                            should not be used; there is no guarantee that they
 644                            will be correct.  */
 645   tree may_be_zero;     /* The boolean expression.  If it evaluates to true,
 646                            the loop will exit in the first iteration (i.e.
 647                            its latch will not be executed), even if the niter
 648                            field says otherwise.  */
 649   tree niter;           /* The expression giving the number of iterations of
 650                            a loop (provided that assumptions == true and
 651                            may_be_zero == false), more precisely the number
 652                            of executions of the latch of the loop.  */
 653   double_int max;       /* The upper bound on the number of iterations of
 654                            the loop.  */
 655
 656   /* The simplified shape of the exit condition.  The loop exits if
 657      CONTROL CMP BOUND is false, where CMP is one of NE_EXPR,
 658      LT_EXPR, or GT_EXPR, and step of CONTROL is positive if CMP is
 659      LE_EXPR and negative if CMP is GE_EXPR.  This information is used
 660      by loop unrolling.  */
 661   affine_iv control;
 662   tree bound;
 663   enum tree_code cmp;
 664 };
 665
 666 /* In tree-ssa-phiopt.c */
 667 bool empty_block_p (basic_block);
 668 basic_block *blocks_in_phiopt_order (void);
 669
 670 /* In tree-ssa-loop*.c  */
 671
 672 unsigned int tree_ssa_lim (void);
 673 unsigned int tree_ssa_unswitch_loops (void);
 674 unsigned int canonicalize_induction_variables (void);
 675 unsigned int tree_unroll_loops_completely (bool, bool);
 676 unsigned int tree_ssa_prefetch_arrays (void);
 677 void tree_ssa_iv_optimize (void);
 678 unsigned tree_predictive_commoning (void);
 679 tree canonicalize_loop_ivs (struct loop *, tree *, bool);
 680 bool parallelize_loops (void);
 681
 682 bool loop_only_exit_p (const struct loop *, const_edge);
 683 bool number_of_iterations_exit (struct loop *, edge,
 684                                 struct tree_niter_desc *niter, bool);
 685 tree find_loop_niter (struct loop *, edge *);
 686 tree loop_niter_by_eval (struct loop *, edge);
 687 tree find_loop_niter_by_eval (struct loop *, edge *);
 688 void estimate_numbers_of_iterations (bool);
 689 bool array_at_struct_end_p (tree);
 690 bool scev_probably_wraps_p (tree, tree, gimple, struct loop *, bool);
 691 bool convert_affine_scev (struct loop *, tree, tree *, tree *, gimple, bool);
 692
 693 bool nowrap_type_p (tree);
 694 enum ev_direction {EV_DIR_GROWS, EV_DIR_DECREASES, EV_DIR_UNKNOWN};
 695 enum ev_direction scev_direction (const_tree);
 696
 697 void free_numbers_of_iterations_estimates (void);
 698 void free_numbers_of_iterations_estimates_loop (struct loop *);
 699 void rewrite_into_loop_closed_ssa (bitmap, unsigned);
 700 void verify_loop_closed_ssa (bool);
 701 bool for_each_index (tree *, bool (*) (tree, tree *, void *), void *);
 702 void create_iv (tree, tree, tree, struct loop *, gimple_stmt_iterator *, bool,
 703                 tree *, tree *);
 704 basic_block split_loop_exit_edge (edge);
 705 void standard_iv_increment_position (struct loop *, gimple_stmt_iterator *,
 706                                      bool *);
 707 basic_block ip_end_pos (struct loop *);
 708 basic_block ip_normal_pos (struct loop *);
 709 bool gimple_duplicate_loop_to_header_edge (struct loop *, edge,
 710                                          unsigned int, sbitmap,
 711                                          edge, VEC (edge, heap) **,
 712                                          int);
 713 struct loop *slpeel_tree_duplicate_loop_to_edge_cfg (struct loop *, edge);
 714 void rename_variables_in_loop (struct loop *);
 715 void rename_variables_in_bb (basic_block bb);
 716 struct loop *tree_ssa_loop_version (struct loop *, tree,
 717                                     basic_block *);
 718 tree expand_simple_operations (tree);
 719 void substitute_in_loop_info (struct loop *, tree, tree);
 720 edge single_dom_exit (struct loop *);
 721 bool can_unroll_loop_p (struct loop *loop, unsigned factor,
 722                         struct tree_niter_desc *niter);
 723 void tree_unroll_loop (struct loop *, unsigned,
 724                        edge, struct tree_niter_desc *);
 725 typedef void (*transform_callback)(struct loop *, void *);
 726 void tree_transform_and_unroll_loop (struct loop *, unsigned,
 727                                      edge, struct tree_niter_desc *,
 728                                      transform_callback, void *);
 729 bool contains_abnormal_ssa_name_p (tree);
 730 bool stmt_dominates_stmt_p (gimple, gimple);
 731 void mark_virtual_ops_for_renaming (gimple);
 732
 733 /* In tree-ssa-dce.c */
 734 void mark_virtual_phi_result_for_renaming (gimple);
 735
 736 /* In tree-ssa-threadedge.c */
 737 extern void threadedge_initialize_values (void);
 738 extern void threadedge_finalize_values (void);
 739 extern VEC(tree,heap) *ssa_name_values;
 740 #define SSA_NAME_VALUE(x) \
 741     (SSA_NAME_VERSION(x) < VEC_length(tree, ssa_name_values) \
 742      ? VEC_index(tree, ssa_name_values, SSA_NAME_VERSION(x)) \
 743      : NULL_TREE)
 744 extern void set_ssa_name_value (tree, tree);
 745 extern bool potentially_threadable_block (basic_block);
 746 extern void thread_across_edge (gimple, edge, bool,
 747                                 VEC(tree, heap) **, tree (*) (gimple, gimple));
 748
 749 /* In tree-ssa-loop-im.c  */
 750 /* The possibilities of statement movement.  */
 751
 752 enum move_pos
 753   {
 754     MOVE_IMPOSSIBLE,            /* No movement -- side effect expression.  */
 755     MOVE_PRESERVE_EXECUTION,    /* Must not cause the non-executed statement
 756                                    become executed -- memory accesses, ... */
 757     MOVE_POSSIBLE               /* Unlimited movement.  */
 758   };
 759 extern enum move_pos movement_possibility (gimple);
 760 char *get_lsm_tmp_name (tree, unsigned);
 761
 762 /* In tree-flow-inline.h  */
 763 static inline void set_is_used (tree);
 764 static inline bool unmodifiable_var_p (const_tree);
 765 static inline bool ref_contains_array_ref (const_tree);
 766
 767 /* In tree-eh.c  */
 768 extern void make_eh_edges (gimple);
 769 extern bool make_eh_dispatch_edges (gimple);
 770 extern edge redirect_eh_edge (edge, basic_block);
 771 extern void redirect_eh_dispatch_edge (gimple, edge, basic_block);
 772 extern bool tree_could_trap_p (tree);
 773 extern bool operation_could_trap_helper_p (enum tree_code, bool, bool, bool,
 774                                            bool, tree, bool *);
 775 extern bool operation_could_trap_p (enum tree_code, bool, bool, tree);
 776 extern bool stmt_could_throw_p (gimple);
 777 extern bool tree_could_throw_p (tree);
 778 extern bool stmt_can_throw_internal (gimple);
 779 extern bool stmt_can_throw_external (gimple);
 780 extern void add_stmt_to_eh_lp_fn (struct function *, gimple, int);
 781 extern void add_stmt_to_eh_lp (gimple, int);
 782 extern bool remove_stmt_from_eh_lp (gimple);
 783 extern bool remove_stmt_from_eh_lp_fn (struct function *, gimple);
 784 extern int lookup_stmt_eh_lp_fn (struct function *, gimple);
 785 extern int lookup_stmt_eh_lp (gimple);
 786 extern bool maybe_clean_eh_stmt_fn (struct function *, gimple);
 787 extern bool maybe_clean_eh_stmt (gimple);
 788 extern bool maybe_clean_or_replace_eh_stmt (gimple, gimple);
 789 extern bool maybe_duplicate_eh_stmt_fn (struct function *, gimple,
 790                                         struct function *, gimple,
 791                                         struct pointer_map_t *, int);
 792 extern bool maybe_duplicate_eh_stmt (gimple, gimple);
 793 extern bool verify_eh_edges (gimple);
 794 extern bool verify_eh_dispatch_edge (gimple);
 795
 796 /* In tree-ssa-pre.c  */
 797 struct pre_expr_d;
 798 void add_to_value (unsigned int, struct pre_expr_d *);
 799 void debug_value_expressions (unsigned int);
 800 void print_value_expressions (FILE *, unsigned int);
 801
 802 /* In tree-ssa-sink.c  */
 803 bool is_hidden_global_store (gimple);
 804
 805 /* In tree-loop-linear.c  */
 806 extern void linear_transform_loops (void);
 807 extern unsigned perfect_loop_nest_depth (struct loop *);
 808
 809 /* In graphite.c  */
 810 extern void graphite_transform_loops (void);
 811
 812 /* In tree-data-ref.c  */
 813 extern void tree_check_data_deps (void);
 814
 815 /* In tree-ssa-loop-ivopts.c  */
 816 bool expr_invariant_in_loop_p (struct loop *, tree);
 817 bool stmt_invariant_in_loop_p (struct loop *, gimple);
 818 bool multiplier_allowed_in_address_p (HOST_WIDE_INT, enum machine_mode,
 819                                       addr_space_t);
 820 unsigned multiply_by_cost (HOST_WIDE_INT, enum machine_mode, bool);
 821 bool may_be_nonaddressable_p (tree expr);
 822
 823 /* In tree-ssa-threadupdate.c.  */
 824 extern bool thread_through_all_blocks (bool);
 825 extern void register_jump_thread (edge, edge);
 826
 827 /* In gimplify.c  */
 828 tree force_gimple_operand_1 (tree, gimple_seq *, gimple_predicate, tree);
 829 tree force_gimple_operand (tree, gimple_seq *, bool, tree);
 830 tree force_gimple_operand_gsi_1 (gimple_stmt_iterator *, tree,
 831                                  gimple_predicate, tree,
 832                                  bool, enum gsi_iterator_update);
 833 tree force_gimple_operand_gsi (gimple_stmt_iterator *, tree, bool, tree,
 834                                bool, enum gsi_iterator_update);
 835 tree gimple_fold_indirect_ref (tree);
 836
 837 /* In tree-ssa-live.c */
 838 extern void remove_unused_locals (void);
 839 extern void dump_scope_blocks (FILE *, int);
 840 extern void debug_scope_blocks (int);
 841 extern void debug_scope_block (tree, int);
 842
 843 /* In tree-ssa-address.c  */
 844
 845 /* Description of a memory address.  */
 846
 847 struct mem_address
 848 {
 849   tree symbol, base, index, step, offset;
 850 };
 851
 852 struct affine_tree_combination;
 853 tree create_mem_ref (gimple_stmt_iterator *, tree,
 854                      struct affine_tree_combination *, tree, tree, tree, bool);
 855 rtx addr_for_mem_ref (struct mem_address *, addr_space_t, bool);
 856 void get_address_description (tree, struct mem_address *);
 857 tree maybe_fold_tmr (tree);
 858
 859 unsigned int execute_free_datastructures (void);
 860 unsigned int execute_fixup_cfg (void);
 861 bool fixup_noreturn_call (gimple stmt);
 862
 863 /* In ipa-pure-const.c  */
 864 void warn_function_noreturn (tree);
 865
 866 #include "tree-flow-inline.h"
 867
 868 void swap_tree_operands (gimple, tree *, tree *);
 869
 870 int least_common_multiple (int, int);
 871
 872 #endif /* _TREE_FLOW_H  */