gcc/tree-flow.h

   1 /* Data and Control Flow Analysis for Trees.
   2    Copyright (C) 2001, 2003, 2004, 2005 Free Software Foundation, Inc.
   3    Contributed by Diego Novillo <dnovillo@redhat.com>
   4
   5 This file is part of GCC.
   6
   7 GCC is free software; you can redistribute it and/or modify
   8 it under the terms of the GNU General Public License as published by
   9 the Free Software Foundation; either version 2, or (at your option)
  10 any later version.
  11
  12 GCC is distributed in the hope that it will be useful,
  13 but WITHOUT ANY WARRANTY; without even the implied warranty of
  14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  15 GNU General Public License for more details.
  16
  17 You should have received a copy of the GNU General Public License
  18 along with GCC; see the file COPYING.  If not, write to
  19 the Free Software Foundation, 51 Franklin Street, Fifth Floor,
  20 Boston, MA 02110-1301, USA.  */
  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 "tree-gimple.h"
  30 #include "tree-ssa-operands.h"
  31 #include "cgraph.h"
  32 #include "ipa-reference.h"
  33
  34 /* Forward declare structures for the garbage collector GTY markers.  */
  35 #ifndef GCC_BASIC_BLOCK_H
  36 struct edge_def;
  37 typedef struct edge_def *edge;
  38 struct basic_block_def;
  39 typedef struct basic_block_def *basic_block;
  40 #endif
  41
  42 /* True if the code is in ssa form.  */
  43 extern bool in_ssa_p;
  44
  45 typedef struct
  46 {
  47   htab_t htab;
  48   PTR *slot;
  49   PTR *limit;
  50 } htab_iterator;
  51
  52 /* Iterate through the elements of hashtable HTAB, using htab_iterator ITER,
  53    storing each element in RESULT, which is of type TYPE.  */
  54 #define FOR_EACH_HTAB_ELEMENT(HTAB, RESULT, TYPE, ITER) \
  55   for (RESULT = (TYPE) first_htab_element (&(ITER), (HTAB)); \
  56         !end_htab_p (&(ITER)); \
  57         RESULT = (TYPE) next_htab_element (&(ITER)))
  58
  59 /*---------------------------------------------------------------------------
  60                       Attributes for SSA_NAMEs.
  61
  62   NOTE: These structures are stored in struct tree_ssa_name
  63   but are only used by the tree optimizers, so it makes better sense
  64   to declare them here to avoid recompiling unrelated files when
  65   making changes.
  66 ---------------------------------------------------------------------------*/
  67
  68 /* Aliasing information for SSA_NAMEs representing pointer variables.  */
  69 struct ptr_info_def GTY(())
  70 {
  71   /* Nonzero if points-to analysis couldn't determine where this pointer
  72      is pointing to.  */
  73   unsigned int pt_anything : 1;
  74
  75   /* Nonzero if the value of this pointer escapes the current function.  */
  76   unsigned int value_escapes_p : 1;
  77
  78   /* Nonzero if this pointer is dereferenced.  */
  79   unsigned int is_dereferenced : 1;
  80
  81   /* Nonzero if this pointer points to a global variable.  */
  82   unsigned int pt_global_mem : 1;
  83
  84   /* Nonzero if this pointer points to NULL.  */
  85   unsigned int pt_null : 1;
  86
  87   /* Set of variables that this pointer may point to.  */
  88   bitmap pt_vars;
  89
  90   /* If this pointer has been dereferenced, and points-to information is
  91      more precise than type-based aliasing, indirect references to this
  92      pointer will be represented by this memory tag, instead of the type
  93      tag computed by TBAA.  */
  94   tree name_mem_tag;
  95
  96   /* Mask of reasons this pointer's value escapes the function  */
  97   unsigned int escape_mask;
  98 };
  99
 100
 101 /*---------------------------------------------------------------------------
 102                    Tree annotations stored in tree_common.ann
 103 ---------------------------------------------------------------------------*/
 104 enum tree_ann_type { TREE_ANN_COMMON, VAR_ANN, FUNCTION_ANN, STMT_ANN };
 105
 106 struct tree_ann_common_d GTY(())
 107 {
 108   /* Annotation type.  */
 109   enum tree_ann_type type;
 110
 111  /* Auxiliary info specific to a pass.  At all times, this
 112     should either point to valid data or be NULL.  */
 113   PTR GTY ((skip (""))) aux;
 114
 115   /* The value handle for this expression.  Used by GVN-PRE.  */
 116   tree GTY((skip)) value_handle;
 117 };
 118
 119 /* It is advantageous to avoid things like life analysis for variables which
 120    do not need PHI nodes.  This enum describes whether or not a particular
 121    variable may need a PHI node.  */
 122
 123 enum need_phi_state {
 124   /* This is the default.  If we are still in this state after finding
 125      all the definition and use sites, then we will assume the variable
 126      needs PHI nodes.  This is probably an overly conservative assumption.  */
 127   NEED_PHI_STATE_UNKNOWN,
 128
 129   /* This state indicates that we have seen one or more sets of the
 130      variable in a single basic block and that the sets dominate all
 131      uses seen so far.  If after finding all definition and use sites
 132      we are still in this state, then the variable does not need any
 133      PHI nodes.  */
 134   NEED_PHI_STATE_NO,
 135
 136   /* This state indicates that we have either seen multiple definitions of
 137      the variable in multiple blocks, or that we encountered a use in a
 138      block that was not dominated by the block containing the set(s) of
 139      this variable.  This variable is assumed to need PHI nodes.  */
 140   NEED_PHI_STATE_MAYBE
 141 };
 142
 143 struct subvar;
 144 typedef struct subvar *subvar_t;
 145
 146 /* This structure represents a fake sub-variable for a structure field.  */
 147 struct subvar GTY(())
 148 {
 149   /* Fake variable.  */
 150   tree var;
 151
 152   /* Next subvar for this structure.  */
 153   subvar_t next;
 154 };
 155
 156 struct var_ann_d GTY(())
 157 {
 158   struct tree_ann_common_d common;
 159
 160   /* Used by the out of SSA pass to determine whether this variable has
 161      been seen yet or not.  */
 162   unsigned out_of_ssa_tag : 1;
 163
 164   /* Used when building root_var structures in tree_ssa_live.[ch].  */
 165   unsigned root_var_processed : 1;
 166
 167   /* Nonzero if this variable is in the alias set of another variable.  */
 168   unsigned is_aliased : 1;
 169
 170   /* Nonzero if this variable was used after SSA optimizations were
 171      applied.  We set this when translating out of SSA form.  */
 172   unsigned used : 1;
 173
 174   /* This field indicates whether or not the variable may need PHI nodes.
 175      See the enum's definition for more detailed information about the
 176      states.  */
 177   ENUM_BITFIELD (need_phi_state) need_phi_state : 2;
 178
 179   /* Used during operand processing to determine if this variable is already
 180      in the vuse list.  */
 181   unsigned in_vuse_list : 1;
 182
 183   /* Used during operand processing to determine if this variable is already
 184      in the v_may_def list.  */
 185   unsigned in_v_may_def_list : 1;
 186
 187   /* An artificial variable representing the memory location pointed-to by
 188      all the pointer symbols that flow-insensitive alias analysis
 189      (mostly type-based) considers to be aliased.  If the variable is
 190      not a pointer or if it is never dereferenced, this must be NULL.  */
 191   tree symbol_mem_tag;
 192
 193   /* Variables that may alias this variable.  */
 194   VEC(tree, gc) *may_aliases;
 195
 196   /* Used when going out of SSA form to indicate which partition this
 197      variable represents storage for.  */
 198   unsigned partition;
 199
 200   /* Used by the root-var object in tree-ssa-live.[ch].  */
 201   unsigned root_index;
 202
 203   /* During into-ssa and the dominator optimizer, this field holds the
 204      current version of this variable (an SSA_NAME).  */
 205   tree current_def;
 206
 207   /* If this variable is a structure, this fields holds a list of
 208      symbols representing each of the fields of the structure.  */
 209   subvar_t subvars;
 210
 211   /* Mask of values saying the reasons why this variable has escaped
 212      the function.  */
 213   unsigned int escape_mask;
 214 };
 215
 216 struct function_ann_d GTY(())
 217 {
 218   struct tree_ann_common_d common;
 219
 220   /* Pointer to the structure that contains the sets of global
 221      variables modified by function calls.  This field is only used
 222      for FUNCTION_DECLs.  */
 223   ipa_reference_vars_info_t GTY ((skip)) reference_vars_info;
 224 };
 225
 226 typedef struct immediate_use_iterator_d
 227 {
 228   ssa_use_operand_t *imm_use;
 229   ssa_use_operand_t *end_p;
 230   ssa_use_operand_t iter_node;
 231 } imm_use_iterator;
 232
 233
 234 /* Use this iterator when simply looking at stmts.  Adding, deleting or
 235    modifying stmts will cause this iterator to malfunction.  */
 236
 237 #define FOR_EACH_IMM_USE_FAST(DEST, ITER, SSAVAR)                       \
 238   for ((DEST) = first_readonly_imm_use (&(ITER), (SSAVAR));     \
 239        !end_readonly_imm_use_p (&(ITER));                       \
 240        (DEST) = next_readonly_imm_use (&(ITER)))
 241
 242
 243 #define FOR_EACH_IMM_USE_SAFE(DEST, ITER, SSAVAR)               \
 244   for ((DEST) = first_safe_imm_use (&(ITER), (SSAVAR));         \
 245        !end_safe_imm_use_p (&(ITER));                           \
 246        (DEST) = next_safe_imm_use (&(ITER)))
 247
 248 #define BREAK_FROM_SAFE_IMM_USE(ITER)                           \
 249    {                                                            \
 250      end_safe_imm_use_traverse (&(ITER));                       \
 251      break;                                                     \
 252    }
 253
 254 struct stmt_ann_d GTY(())
 255 {
 256   struct tree_ann_common_d common;
 257
 258   /* Nonzero if the statement has been modified (meaning that the operands
 259      need to be scanned again).  */
 260   unsigned modified : 1;
 261
 262   /* Nonzero if the statement makes references to volatile storage.  */
 263   unsigned has_volatile_ops : 1;
 264
 265   /* Nonzero if the statement makes a function call that may clobber global
 266      and local addressable variables.  */
 267   unsigned makes_clobbering_call : 1;
 268
 269   /* Basic block that contains this statement.  */
 270   basic_block bb;
 271
 272   /* Operand cache for stmt.  */
 273   struct stmt_operands_d GTY ((skip (""))) operands;
 274
 275   /* Set of variables that have had their address taken in the statement.  */
 276   bitmap addresses_taken;
 277
 278   /* Unique identifier for this statement.  These ID's are to be created
 279      by each pass on an as-needed basis in any order convenient for the
 280      pass which needs statement UIDs.  */
 281   unsigned int uid;
 282
 283   /* Linked list of histograms for value-based profiling.  This is really a
 284      struct histogram_value*.  We use void* to avoid having to export that
 285      everywhere, and to avoid having to put it in GC memory.  */
 286
 287   void * GTY ((skip (""))) histograms;
 288 };
 289
 290 union tree_ann_d GTY((desc ("ann_type ((tree_ann_t)&%h)")))
 291 {
 292   struct tree_ann_common_d GTY((tag ("TREE_ANN_COMMON"))) common;
 293   struct var_ann_d GTY((tag ("VAR_ANN"))) vdecl;
 294   struct function_ann_d GTY((tag ("FUNCTION_ANN"))) fdecl;
 295   struct stmt_ann_d GTY((tag ("STMT_ANN"))) stmt;
 296 };
 297
 298 extern GTY(()) VEC(tree,gc) *modified_noreturn_calls;
 299
 300 typedef union tree_ann_d *tree_ann_t;
 301 typedef struct var_ann_d *var_ann_t;
 302 typedef struct function_ann_d *function_ann_t;
 303 typedef struct stmt_ann_d *stmt_ann_t;
 304
 305 static inline tree_ann_t tree_ann (tree);
 306 static inline tree_ann_t get_tree_ann (tree);
 307 static inline var_ann_t var_ann (tree);
 308 static inline var_ann_t get_var_ann (tree);
 309 static inline function_ann_t function_ann (tree);
 310 static inline function_ann_t get_function_ann (tree);
 311 static inline stmt_ann_t stmt_ann (tree);
 312 static inline stmt_ann_t get_stmt_ann (tree);
 313 static inline enum tree_ann_type ann_type (tree_ann_t);
 314 static inline basic_block bb_for_stmt (tree);
 315 extern void set_bb_for_stmt (tree, basic_block);
 316 static inline bool noreturn_call_p (tree);
 317 static inline void update_stmt (tree);
 318 static inline bool stmt_modified_p (tree);
 319 static inline VEC(tree, gc) *may_aliases (tree);
 320 static inline int get_lineno (tree);
 321 static inline const char *get_filename (tree);
 322 static inline bool is_exec_stmt (tree);
 323 static inline bool is_label_stmt (tree);
 324 static inline bitmap addresses_taken (tree);
 325
 326 /*---------------------------------------------------------------------------
 327                   Structure representing predictions in tree level.
 328 ---------------------------------------------------------------------------*/
 329 struct edge_prediction GTY((chain_next ("%h.ep_next")))
 330 {
 331   struct edge_prediction *ep_next;
 332   edge ep_edge;
 333   enum br_predictor ep_predictor;
 334   int ep_probability;
 335 };
 336
 337 /* Accessors for basic block annotations.  */
 338 static inline tree phi_nodes (basic_block);
 339 static inline void set_phi_nodes (basic_block, tree);
 340
 341 /*---------------------------------------------------------------------------
 342                               Global declarations
 343 ---------------------------------------------------------------------------*/
 344 struct int_tree_map GTY(())
 345 {
 346
 347   unsigned int uid;
 348   tree to;
 349 };
 350
 351 extern unsigned int int_tree_map_hash (const void *);
 352 extern int int_tree_map_eq (const void *, const void *);
 353
 354 typedef struct
 355 {
 356   htab_iterator hti;
 357 } referenced_var_iterator;
 358
 359
 360 /* This macro loops over all the referenced vars, one at a time, putting the
 361    current var in VAR.  Note:  You are not allowed to add referenced variables
 362    to the hashtable while using this macro.  Doing so may cause it to behave
 363    erratically.  */
 364
 365 #define FOR_EACH_REFERENCED_VAR(VAR, ITER) \
 366   for ((VAR) = first_referenced_var (&(ITER)); \
 367        !end_referenced_vars_p (&(ITER)); \
 368        (VAR) = next_referenced_var (&(ITER)))
 369
 370
 371 typedef struct
 372 {
 373   int i;
 374 } safe_referenced_var_iterator;
 375
 376 /* This macro loops over all the referenced vars, one at a time, putting the
 377    current var in VAR.  You are allowed to add referenced variables during the
 378    execution of this macro, however, the macro will not iterate over them.  It
 379    requires a temporary vector of trees, VEC, whose lifetime is controlled by
 380    the caller.  The purpose of the vector is to temporarily store the
 381    referenced_variables hashtable so that adding referenced variables does not
 382    affect the hashtable.  */
 383
 384 #define FOR_EACH_REFERENCED_VAR_SAFE(VAR, VEC, ITER) \
 385   for ((ITER).i = 0, fill_referenced_var_vec (&(VEC)); \
 386        VEC_iterate (tree, (VEC), (ITER).i, (VAR)); \
 387        (ITER).i++)
 388
 389 /* Array of all variables referenced in the function.  */
 390 extern GTY((param_is (struct int_tree_map))) htab_t referenced_vars;
 391
 392 /* Default defs for undefined symbols. */
 393 extern GTY((param_is (struct int_tree_map))) htab_t default_defs;
 394
 395 extern tree referenced_var_lookup (unsigned int);
 396 #define num_referenced_vars htab_elements (referenced_vars)
 397 #define referenced_var(i) referenced_var_lookup (i)
 398
 399 /* Array of all SSA_NAMEs used in the function.  */
 400 extern GTY(()) VEC(tree,gc) *ssa_names;
 401
 402 #define num_ssa_names (VEC_length (tree, ssa_names))
 403 #define ssa_name(i) (VEC_index (tree, ssa_names, (i)))
 404
 405 /* Artificial variable used to model the effects of function calls.  */
 406 extern GTY(()) tree global_var;
 407
 408 /* Call clobbered variables in the function.  If bit I is set, then
 409    REFERENCED_VARS (I) is call-clobbered.  */
 410 extern bitmap call_clobbered_vars;
 411
 412 /* Addressable variables in the function.  If bit I is set, then
 413    REFERENCED_VARS (I) has had its address taken.  */
 414 extern bitmap addressable_vars;
 415
 416 /* 'true' after aliases have been computed (see compute_may_aliases).  */
 417 extern bool aliases_computed_p;
 418
 419 /* Macros for showing usage statistics.  */
 420 #define SCALE(x) ((unsigned long) ((x) < 1024*10        \
 421                   ? (x)                                 \
 422                   : ((x) < 1024*1024*10                 \
 423                      ? (x) / 1024                       \
 424                      : (x) / (1024*1024))))
 425
 426 #define LABEL(x) ((x) < 1024*10 ? 'b' : ((x) < 1024*1024*10 ? 'k' : 'M'))
 427
 428 #define PERCENT(x,y) ((float)(x) * 100.0 / (float)(y))
 429
 430 /*---------------------------------------------------------------------------
 431                               Block iterators
 432 ---------------------------------------------------------------------------*/
 433
 434 typedef struct {
 435   tree_stmt_iterator tsi;
 436   basic_block bb;
 437 } block_stmt_iterator;
 438
 439 static inline block_stmt_iterator bsi_start (basic_block);
 440 static inline block_stmt_iterator bsi_last (basic_block);
 441 static inline block_stmt_iterator bsi_after_labels (basic_block);
 442 block_stmt_iterator bsi_for_stmt (tree);
 443 static inline bool bsi_end_p (block_stmt_iterator);
 444 static inline void bsi_next (block_stmt_iterator *);
 445 static inline void bsi_prev (block_stmt_iterator *);
 446 static inline tree bsi_stmt (block_stmt_iterator);
 447 static inline tree * bsi_stmt_ptr (block_stmt_iterator);
 448
 449 extern void bsi_remove (block_stmt_iterator *, bool);
 450 extern void bsi_move_before (block_stmt_iterator *, block_stmt_iterator *);
 451 extern void bsi_move_after (block_stmt_iterator *, block_stmt_iterator *);
 452 extern void bsi_move_to_bb_end (block_stmt_iterator *, basic_block);
 453
 454 enum bsi_iterator_update
 455 {
 456   /* Note that these are intentionally in the same order as TSI_FOO.  They
 457      mean exactly the same as their TSI_* counterparts.  */
 458   BSI_NEW_STMT,
 459   BSI_SAME_STMT,
 460   BSI_CHAIN_START,
 461   BSI_CHAIN_END,
 462   BSI_CONTINUE_LINKING
 463 };
 464
 465 extern void bsi_insert_before (block_stmt_iterator *, tree,
 466                                enum bsi_iterator_update);
 467 extern void bsi_insert_after (block_stmt_iterator *, tree,
 468                               enum bsi_iterator_update);
 469
 470 extern void bsi_replace (const block_stmt_iterator *, tree, bool);
 471
 472 /*---------------------------------------------------------------------------
 473                               OpenMP Region Tree
 474 ---------------------------------------------------------------------------*/
 475
 476 /* Parallel region information.  Every parallel and workshare
 477    directive is enclosed between two markers, the OMP_* directive
 478    and a corresponding OMP_RETURN statement.  */
 479
 480 struct omp_region
 481 {
 482   /* The enclosing region.  */
 483   struct omp_region *outer;
 484
 485   /* First child region.  */
 486   struct omp_region *inner;
 487
 488   /* Next peer region.  */
 489   struct omp_region *next;
 490
 491   /* Block containing the omp directive as its last stmt.  */
 492   basic_block entry;
 493
 494   /* Block containing the OMP_RETURN as its last stmt.  */
 495   basic_block exit;
 496
 497   /* Block containing the OMP_CONTINUE as its last stmt.  */
 498   basic_block cont;
 499
 500   /* If this is a combined parallel+workshare region, this is a list
 501      of additional arguments needed by the combined parallel+workshare
 502      library call.  */
 503   tree ws_args;
 504
 505   /* The code for the omp directive of this region.  */
 506   enum tree_code type;
 507
 508   /* Schedule kind, only used for OMP_FOR type regions.  */
 509   enum omp_clause_schedule_kind sched_kind;
 510
 511   /* True if this is a combined parallel+workshare region.  */
 512   bool is_combined_parallel;
 513 };
 514
 515 extern struct omp_region *root_omp_region;
 516 extern struct omp_region *new_omp_region (basic_block, enum tree_code,
 517                                           struct omp_region *);
 518 extern void free_omp_regions (void);
 519
 520 /*---------------------------------------------------------------------------
 521                               Function prototypes
 522 ---------------------------------------------------------------------------*/
 523 /* In tree-cfg.c  */
 524
 525 /* Location to track pending stmt for edge insertion.  */
 526 #define PENDING_STMT(e) ((e)->insns.t)
 527
 528 extern void delete_tree_cfg_annotations (void);
 529 extern void disband_implicit_edges (void);
 530 extern bool stmt_ends_bb_p (tree);
 531 extern bool is_ctrl_stmt (tree);
 532 extern bool is_ctrl_altering_stmt (tree);
 533 extern bool computed_goto_p (tree);
 534 extern bool simple_goto_p (tree);
 535 extern basic_block single_noncomplex_succ (basic_block bb);
 536 extern void tree_dump_bb (basic_block, FILE *, int);
 537 extern void debug_tree_bb (basic_block);
 538 extern basic_block debug_tree_bb_n (int);
 539 extern void dump_tree_cfg (FILE *, int);
 540 extern void debug_tree_cfg (int);
 541 extern void dump_cfg_stats (FILE *);
 542 extern void debug_cfg_stats (void);
 543 extern void debug_loop_ir (void);
 544 extern void print_loop_ir (FILE *);
 545 extern void cleanup_dead_labels (void);
 546 extern void group_case_labels (void);
 547 extern tree first_stmt (basic_block);
 548 extern tree last_stmt (basic_block);
 549 extern tree *last_stmt_ptr (basic_block);
 550 extern tree last_and_only_stmt (basic_block);
 551 extern edge find_taken_edge (basic_block, tree);
 552 extern basic_block label_to_block_fn (struct function *, tree);
 553 #define label_to_block(t) (label_to_block_fn (cfun, t))
 554 extern void bsi_insert_on_edge (edge, tree);
 555 extern basic_block bsi_insert_on_edge_immediate (edge, tree);
 556 extern void bsi_commit_one_edge_insert (edge, basic_block *);
 557 extern void bsi_commit_edge_inserts (void);
 558 extern void notice_special_calls (tree);
 559 extern void clear_special_calls (void);
 560 extern void verify_stmts (void);
 561 extern tree tree_block_label (basic_block);
 562 extern void extract_true_false_edges_from_block (basic_block, edge *, edge *);
 563 extern bool tree_duplicate_sese_region (edge, edge, basic_block *, unsigned,
 564                                         basic_block *);
 565 extern void add_phi_args_after_copy_bb (basic_block);
 566 extern void add_phi_args_after_copy (basic_block *, unsigned);
 567 extern bool tree_purge_dead_eh_edges (basic_block);
 568 extern bool tree_purge_all_dead_eh_edges (bitmap);
 569 extern tree gimplify_val (block_stmt_iterator *, tree, tree);
 570 extern tree gimplify_build1 (block_stmt_iterator *, enum tree_code,
 571                              tree, tree);
 572 extern tree gimplify_build2 (block_stmt_iterator *, enum tree_code,
 573                              tree, tree, tree);
 574 extern tree gimplify_build3 (block_stmt_iterator *, enum tree_code,
 575                              tree, tree, tree, tree);
 576 extern void init_empty_tree_cfg (void);
 577 extern void fold_cond_expr_cond (void);
 578 extern void replace_uses_by (tree, tree);
 579 extern void start_recording_case_labels (void);
 580 extern void end_recording_case_labels (void);
 581 extern basic_block move_sese_region_to_fn (struct function *, basic_block,
 582                                            basic_block);
 583
 584 /* In tree-cfgcleanup.c  */
 585 extern bool cleanup_tree_cfg (void);
 586 extern void cleanup_tree_cfg_loop (void);
 587
 588 /* In tree-pretty-print.c.  */
 589 extern void dump_generic_bb (FILE *, basic_block, int, int);
 590
 591 /* In tree-dfa.c  */
 592 extern var_ann_t create_var_ann (tree);
 593 extern function_ann_t create_function_ann (tree);
 594 extern stmt_ann_t create_stmt_ann (tree);
 595 extern tree_ann_t create_tree_ann (tree);
 596 extern void dump_dfa_stats (FILE *);
 597 extern void debug_dfa_stats (void);
 598 extern void debug_referenced_vars (void);
 599 extern void dump_referenced_vars (FILE *);
 600 extern void dump_variable (FILE *, tree);
 601 extern void debug_variable (tree);
 602 extern void dump_subvars_for (FILE *, tree);
 603 extern void debug_subvars_for (tree);
 604 extern tree get_virtual_var (tree);
 605 extern void add_referenced_tmp_var (tree);
 606 extern void mark_new_vars_to_rename (tree);
 607 extern void find_new_referenced_vars (tree *);
 608
 609 extern tree make_rename_temp (tree, const char *);
 610 extern void set_default_def (tree, tree);
 611 extern tree default_def (tree);
 612 extern tree default_def_fn (struct function *, tree);
 613
 614 /* In tree-phinodes.c  */
 615 extern void reserve_phi_args_for_new_edge (basic_block);
 616 extern tree create_phi_node (tree, basic_block);
 617 extern void add_phi_arg (tree, tree, edge);
 618 extern void remove_phi_args (edge);
 619 extern void remove_phi_node (tree, tree);
 620 extern tree phi_reverse (tree);
 621
 622 /* In gimple-low.c  */
 623 extern void record_vars_into (tree, tree);
 624 extern void record_vars (tree);
 625 extern bool block_may_fallthru (tree);
 626
 627 /* In tree-ssa-alias.c  */
 628 extern void dump_may_aliases_for (FILE *, tree);
 629 extern void debug_may_aliases_for (tree);
 630 extern void dump_alias_info (FILE *);
 631 extern void debug_alias_info (void);
 632 extern void dump_points_to_info (FILE *);
 633 extern void debug_points_to_info (void);
 634 extern void dump_points_to_info_for (FILE *, tree);
 635 extern void debug_points_to_info_for (tree);
 636 extern bool may_be_aliased (tree);
 637 extern bool is_aliased_with (tree, tree);
 638 extern struct ptr_info_def *get_ptr_info (tree);
 639 extern void add_type_alias (tree, tree);
 640 extern void new_type_alias (tree, tree);
 641 extern void count_uses_and_derefs (tree, tree, unsigned *, unsigned *, bool *);
 642 static inline subvar_t get_subvars_for_var (tree);
 643 static inline tree get_subvar_at (tree, unsigned HOST_WIDE_INT);
 644 static inline bool ref_contains_array_ref (tree);
 645 static inline bool array_ref_contains_indirect_ref (tree);
 646 extern tree get_ref_base_and_extent (tree, HOST_WIDE_INT *,
 647                                      HOST_WIDE_INT *, HOST_WIDE_INT *);
 648 static inline bool var_can_have_subvars (tree);
 649 static inline bool overlap_subvar (unsigned HOST_WIDE_INT,
 650                                    unsigned HOST_WIDE_INT,
 651                                    tree, bool *);
 652
 653 /* Call-back function for walk_use_def_chains().  At each reaching
 654    definition, a function with this prototype is called.  */
 655 typedef bool (*walk_use_def_chains_fn) (tree, tree, void *);
 656
 657
 658 /* In tree-ssa.c  */
 659 extern void init_tree_ssa (void);
 660 extern edge ssa_redirect_edge (edge, basic_block);
 661 extern void flush_pending_stmts (edge);
 662 extern bool tree_ssa_useless_type_conversion (tree);
 663 extern bool tree_ssa_useless_type_conversion_1 (tree, tree);
 664 extern void verify_ssa (bool);
 665 extern void delete_tree_ssa (void);
 666 extern void register_new_def (tree, VEC(tree,heap) **);
 667 extern void walk_use_def_chains (tree, walk_use_def_chains_fn, void *, bool);
 668 extern bool stmt_references_memory_p (tree);
 669
 670 /* In tree-into-ssa.c  */
 671 void update_ssa (unsigned);
 672 void delete_update_ssa (void);
 673 void register_new_name_mapping (tree, tree);
 674 tree create_new_def_for (tree, tree, def_operand_p);
 675 bool need_ssa_update_p (void);
 676 bool name_registered_for_update_p (tree);
 677 bitmap ssa_names_to_replace (void);
 678 void release_ssa_name_after_update_ssa (tree name);
 679 void compute_global_livein (bitmap, bitmap);
 680 tree duplicate_ssa_name (tree, tree);
 681 void mark_sym_for_renaming (tree);
 682 void mark_set_for_renaming (bitmap);
 683 tree get_current_def (tree);
 684 void set_current_def (tree, tree);
 685
 686 /* In tree-ssa-ccp.c  */
 687 bool fold_stmt (tree *);
 688 bool fold_stmt_inplace (tree);
 689 tree widen_bitfield (tree, tree, tree);
 690
 691 /* In tree-vrp.c  */
 692 tree vrp_evaluate_conditional (tree, bool);
 693 void simplify_stmt_using_ranges (tree);
 694
 695 /* In tree-ssa-dom.c  */
 696 extern void dump_dominator_optimization_stats (FILE *);
 697 extern void debug_dominator_optimization_stats (void);
 698 int loop_depth_of_name (tree);
 699
 700 /* In tree-ssa-copy.c  */
 701 extern void merge_alias_info (tree, tree);
 702 extern void propagate_value (use_operand_p, tree);
 703 extern void propagate_tree_value (tree *, 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_asm (tree);
 707
 708 /* Affine iv.  */
 709
 710 typedef struct
 711 {
 712   /* Iv = BASE + STEP * i.  */
 713   tree base, step;
 714
 715   /* True if this iv does not overflow.  */
 716   bool no_overflow;
 717 } affine_iv;
 718
 719 /* Description of number of iterations of a loop.  All the expressions inside
 720    the structure can be evaluated at the end of the loop's preheader
 721    (and due to ssa form, also anywhere inside the body of the loop).  */
 722
 723 struct tree_niter_desc
 724 {
 725   tree assumptions;     /* The boolean expression.  If this expression evaluates
 726                            to false, then the other fields in this structure
 727                            should not be used; there is no guarantee that they
 728                            will be correct.  */
 729   tree may_be_zero;     /* The boolean expression.  If it evaluates to true,
 730                            the loop will exit in the first iteration (i.e.
 731                            its latch will not be executed), even if the niter
 732                            field says otherwise.  */
 733   tree niter;           /* The expression giving the number of iterations of
 734                            a loop (provided that assumptions == true and
 735                            may_be_zero == false), more precisely the number
 736                            of executions of the latch of the loop.  */
 737   tree additional_info; /* The boolean expression.  Sometimes we use additional
 738                            knowledge to simplify the other expressions
 739                            contained in this structure (for example the
 740                            knowledge about value ranges of operands on entry to
 741                            the loop).  If this is a case, conjunction of such
 742                            condition is stored in this field, so that we do not
 743                            lose the information: for example if may_be_zero
 744                            is (n <= 0) and niter is (unsigned) n, we know
 745                            that the number of iterations is at most
 746                            MAX_SIGNED_INT.  However if the (n <= 0) assumption
 747                            is eliminated (by looking at the guard on entry of
 748                            the loop), then the information would be lost.  */
 749
 750   /* The simplified shape of the exit condition.  The loop exits if
 751      CONTROL CMP BOUND is false, where CMP is one of NE_EXPR,
 752      LT_EXPR, or GT_EXPR, and step of CONTROL is positive if CMP is
 753      LE_EXPR and negative if CMP is GE_EXPR.  This information is used
 754      by loop unrolling.  */
 755   affine_iv control;
 756   tree bound;
 757   enum tree_code cmp;
 758 };
 759
 760 /* In tree-vectorizer.c */
 761 void vectorize_loops (struct loops *);
 762
 763 /* In tree-ssa-phiopt.c */
 764 bool empty_block_p (basic_block);
 765
 766 /* In tree-ssa-loop*.c  */
 767
 768 void tree_ssa_lim (struct loops *);
 769 void tree_ssa_unswitch_loops (struct loops *);
 770 void canonicalize_induction_variables (struct loops *);
 771 void tree_unroll_loops_completely (struct loops *, bool);
 772 void tree_ssa_prefetch_arrays (struct loops *);
 773 void remove_empty_loops (struct loops *);
 774 void tree_ssa_iv_optimize (struct loops *);
 775
 776 bool number_of_iterations_exit (struct loop *, edge,
 777                                 struct tree_niter_desc *niter, bool);
 778 tree find_loop_niter (struct loop *, edge *);
 779 tree loop_niter_by_eval (struct loop *, edge);
 780 tree find_loop_niter_by_eval (struct loop *, edge *);
 781 void estimate_numbers_of_iterations (struct loops *);
 782 bool scev_probably_wraps_p (tree, tree, tree, tree, struct loop *, bool *,
 783                             bool *);
 784 tree convert_step (struct loop *, tree, tree, tree, tree);
 785 void free_numbers_of_iterations_estimates (struct loops *);
 786 void free_numbers_of_iterations_estimates_loop (struct loop *);
 787 void rewrite_into_loop_closed_ssa (bitmap, unsigned);
 788 void verify_loop_closed_ssa (void);
 789 void loop_commit_inserts (void);
 790 bool for_each_index (tree *, bool (*) (tree, tree *, void *), void *);
 791 void create_iv (tree, tree, tree, struct loop *, block_stmt_iterator *, bool,
 792                 tree *, tree *);
 793 void split_loop_exit_edge (edge);
 794 void compute_phi_arg_on_exit (edge, tree, tree);
 795 unsigned force_expr_to_var_cost (tree);
 796 basic_block bsi_insert_on_edge_immediate_loop (edge, tree);
 797 void standard_iv_increment_position (struct loop *, block_stmt_iterator *,
 798                                      bool *);
 799 basic_block ip_end_pos (struct loop *);
 800 basic_block ip_normal_pos (struct loop *);
 801 bool tree_duplicate_loop_to_header_edge (struct loop *, edge, struct loops *,
 802                                          unsigned int, sbitmap,
 803                                          edge, edge *,
 804                                          unsigned int *, int);
 805 struct loop *tree_ssa_loop_version (struct loops *, struct loop *, tree,
 806                                     basic_block *);
 807 tree expand_simple_operations (tree);
 808 void substitute_in_loop_info (struct loop *, tree, tree);
 809 edge single_dom_exit (struct loop *);
 810 bool can_unroll_loop_p (struct loop *loop, unsigned factor,
 811                         struct tree_niter_desc *niter);
 812 void tree_unroll_loop (struct loops *, struct loop *, unsigned,
 813                        edge, struct tree_niter_desc *);
 814
 815 /* In tree-ssa-threadedge.c */
 816 extern bool potentially_threadable_block (basic_block);
 817 extern void thread_across_edge (tree, edge, bool,
 818                                 VEC(tree, heap) **, tree (*) (tree));
 819
 820 /* In tree-ssa-loop-im.c  */
 821 /* The possibilities of statement movement.  */
 822
 823 enum move_pos
 824   {
 825     MOVE_IMPOSSIBLE,            /* No movement -- side effect expression.  */
 826     MOVE_PRESERVE_EXECUTION,    /* Must not cause the non-executed statement
 827                                    become executed -- memory accesses, ... */
 828     MOVE_POSSIBLE               /* Unlimited movement.  */
 829   };
 830 extern enum move_pos movement_possibility (tree);
 831
 832 /* The reasons a variable may escape a function.  */
 833 enum escape_type
 834   {
 835     NO_ESCAPE = 0, /* Doesn't escape.  */
 836     ESCAPE_STORED_IN_GLOBAL = 1 << 1,
 837     ESCAPE_TO_ASM = 1 << 2,  /* Passed by address to an assembly
 838                                 statement.  */
 839     ESCAPE_TO_CALL = 1 << 3,  /* Escapes to a function call.  */
 840     ESCAPE_BAD_CAST = 1 << 4, /* Cast from pointer to integer */
 841     ESCAPE_TO_RETURN = 1 << 5, /* Returned from function.  */
 842     ESCAPE_TO_PURE_CONST = 1 << 6, /* Escapes to a pure or constant
 843                                       function call.  */
 844     ESCAPE_IS_GLOBAL = 1 << 7,  /* Is a global variable.  */
 845     ESCAPE_IS_PARM = 1 << 8, /* Is an incoming function parameter.  */
 846     ESCAPE_UNKNOWN = 1 << 9 /* We believe it escapes for some reason
 847                                not enumerated above.  */
 848   };
 849
 850 /* In tree-flow-inline.h  */
 851 static inline bool is_call_clobbered (tree);
 852 static inline void mark_call_clobbered (tree, unsigned int);
 853 static inline void set_is_used (tree);
 854 static inline bool unmodifiable_var_p (tree);
 855
 856 /* In tree-eh.c  */
 857 extern void make_eh_edges (tree);
 858 extern bool tree_could_trap_p (tree);
 859 extern bool tree_could_throw_p (tree);
 860 extern bool tree_can_throw_internal (tree);
 861 extern bool tree_can_throw_external (tree);
 862 extern int lookup_stmt_eh_region (tree);
 863 extern void add_stmt_to_eh_region (tree, int);
 864 extern bool remove_stmt_from_eh_region (tree);
 865 extern bool maybe_clean_or_replace_eh_stmt (tree, tree);
 866
 867 /* In tree-ssa-pre.c  */
 868 void add_to_value (tree, tree);
 869 void debug_value_expressions (tree);
 870 void print_value_expressions (FILE *, tree);
 871
 872
 873 /* In tree-vn.c  */
 874 bool expressions_equal_p (tree, tree);
 875 tree get_value_handle (tree);
 876 hashval_t vn_compute (tree, hashval_t);
 877 void sort_vuses (VEC (tree, gc) *);
 878 tree vn_lookup_or_add (tree, tree);
 879 tree vn_lookup_or_add_with_vuses (tree, VEC (tree, gc) *);
 880 void vn_add (tree, tree);
 881 void vn_add_with_vuses (tree, tree, VEC (tree, gc) *);
 882 tree vn_lookup (tree, tree);
 883 tree vn_lookup_with_vuses (tree, VEC (tree, gc) *);
 884 void vn_init (void);
 885 void vn_delete (void);
 886
 887 /* In tree-ssa-sink.c  */
 888 bool is_hidden_global_store (tree);
 889
 890 /* In tree-sra.c  */
 891 void insert_edge_copies (tree, basic_block);
 892 void sra_insert_before (block_stmt_iterator *, tree);
 893 void sra_insert_after (block_stmt_iterator *, tree);
 894 void sra_init_cache (void);
 895 bool sra_type_can_be_decomposed_p (tree);
 896
 897 /* In tree-loop-linear.c  */
 898 extern void linear_transform_loops (struct loops *);
 899
 900 /* In tree-ssa-loop-ivopts.c  */
 901 bool expr_invariant_in_loop_p (struct loop *, tree);
 902 bool multiplier_allowed_in_address_p (HOST_WIDE_INT);
 903 unsigned multiply_by_cost (HOST_WIDE_INT, enum machine_mode);
 904
 905 /* In tree-ssa-threadupdate.c.  */
 906 extern bool thread_through_all_blocks (void);
 907 extern void register_jump_thread (edge, edge);
 908
 909 /* In gimplify.c  */
 910 tree force_gimple_operand (tree, tree *, bool, tree);
 911 tree force_gimple_operand_bsi (block_stmt_iterator *, tree, bool, tree);
 912
 913 /* In tree-ssa-structalias.c */
 914 bool find_what_p_points_to (tree);
 915
 916 /* In tree-ssa-live.c */
 917 extern void remove_unused_locals (void);
 918
 919 /* In tree-ssa-address.c  */
 920
 921 /* Affine combination of trees.  We keep track of at most MAX_AFF_ELTS elements
 922    to make things simpler; this is sufficient in most cases.  */
 923
 924 #define MAX_AFF_ELTS 8
 925
 926 struct affine_tree_combination
 927 {
 928   /* Type of the result of the combination.  */
 929   tree type;
 930
 931   /* Mask modulo that the operations are performed.  */
 932   unsigned HOST_WIDE_INT mask;
 933
 934   /* Constant offset.  */
 935   unsigned HOST_WIDE_INT offset;
 936
 937   /* Number of elements of the combination.  */
 938   unsigned n;
 939
 940   /* Elements and their coefficients.  */
 941   tree elts[MAX_AFF_ELTS];
 942   unsigned HOST_WIDE_INT coefs[MAX_AFF_ELTS];
 943
 944   /* Remainder of the expression.  */
 945   tree rest;
 946 };
 947
 948 /* Description of a memory address.  */
 949
 950 struct mem_address
 951 {
 952   tree symbol, base, index, step, offset;
 953 };
 954
 955 tree create_mem_ref (block_stmt_iterator *, tree,
 956                      struct affine_tree_combination *);
 957 rtx addr_for_mem_ref (struct mem_address *, bool);
 958 void get_address_description (tree, struct mem_address *);
 959 tree maybe_fold_tmr (tree);
 960
 961 /* This structure is simply used during pushing fields onto the fieldstack
 962    to track the offset of the field, since bitpos_of_field gives it relative
 963    to its immediate containing type, and we want it relative to the ultimate
 964    containing object.  */
 965
 966 struct fieldoff
 967 {
 968   tree type;
 969   tree size;
 970   tree decl;
 971   HOST_WIDE_INT offset;
 972 };
 973 typedef struct fieldoff fieldoff_s;
 974
 975 DEF_VEC_O(fieldoff_s);
 976 DEF_VEC_ALLOC_O(fieldoff_s,heap);
 977 int push_fields_onto_fieldstack (tree, VEC(fieldoff_s,heap) **,
 978                                  HOST_WIDE_INT, bool *);
 979 void sort_fieldstack (VEC(fieldoff_s,heap) *);
 980
 981 void init_alias_heapvars (void);
 982 void delete_alias_heapvars (void);
 983
 984 #include "tree-flow-inline.h"
 985
 986 void swap_tree_operands (tree, tree *, tree *);
 987
 988 extern void recalculate_used_alone (void);
 989 extern bool updating_used_alone;
 990 #endif /* _TREE_FLOW_H  */