gcc/tree-flow.h

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