gcc/tree-flow.h

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