gcc/basic-block.h

   1 /* Define control and data flow tables, and regsets.
   2    Copyright (C) 1987, 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004,
   3    2005, 2006, 2007, 2008 Free Software Foundation, Inc.
   4
   5 This file is part of GCC.
   6
   7 GCC is free software; you can redistribute it and/or modify it under
   8 the terms of the GNU General Public License as published by the Free
   9 Software Foundation; either version 3, or (at your option) any later
  10 version.
  11
  12 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
  13 WARRANTY; without even the implied warranty of MERCHANTABILITY or
  14 FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
  15 for more details.
  16
  17 You should have received a copy of the GNU General Public License
  18 along with GCC; see the file COPYING3.  If not see
  19 <http://www.gnu.org/licenses/>.  */
  20
  21 #ifndef GCC_BASIC_BLOCK_H
  22 #define GCC_BASIC_BLOCK_H
  23
  24 #include "bitmap.h"
  25 #include "sbitmap.h"
  26 #include "varray.h"
  27 #include "partition.h"
  28 #include "hard-reg-set.h"
  29 #include "predict.h"
  30 #include "vec.h"
  31 #include "function.h"
  32
  33 /* Head of register set linked list.  */
  34 typedef bitmap_head regset_head;
  35
  36 /* A pointer to a regset_head.  */
  37 typedef bitmap regset;
  38
  39 /* Allocate a register set with oballoc.  */
  40 #define ALLOC_REG_SET(OBSTACK) BITMAP_ALLOC (OBSTACK)
  41
  42 /* Do any cleanup needed on a regset when it is no longer used.  */
  43 #define FREE_REG_SET(REGSET) BITMAP_FREE (REGSET)
  44
  45 /* Initialize a new regset.  */
  46 #define INIT_REG_SET(HEAD) bitmap_initialize (HEAD, &reg_obstack)
  47
  48 /* Clear a register set by freeing up the linked list.  */
  49 #define CLEAR_REG_SET(HEAD) bitmap_clear (HEAD)
  50
  51 /* Copy a register set to another register set.  */
  52 #define COPY_REG_SET(TO, FROM) bitmap_copy (TO, FROM)
  53
  54 /* Compare two register sets.  */
  55 #define REG_SET_EQUAL_P(A, B) bitmap_equal_p (A, B)
  56
  57 /* `and' a register set with a second register set.  */
  58 #define AND_REG_SET(TO, FROM) bitmap_and_into (TO, FROM)
  59
  60 /* `and' the complement of a register set with a register set.  */
  61 #define AND_COMPL_REG_SET(TO, FROM) bitmap_and_compl_into (TO, FROM)
  62
  63 /* Inclusive or a register set with a second register set.  */
  64 #define IOR_REG_SET(TO, FROM) bitmap_ior_into (TO, FROM)
  65
  66 /* Exclusive or a register set with a second register set.  */
  67 #define XOR_REG_SET(TO, FROM) bitmap_xor_into (TO, FROM)
  68
  69 /* Or into TO the register set FROM1 `and'ed with the complement of FROM2.  */
  70 #define IOR_AND_COMPL_REG_SET(TO, FROM1, FROM2) \
  71   bitmap_ior_and_compl_into (TO, FROM1, FROM2)
  72
  73 /* Clear a single register in a register set.  */
  74 #define CLEAR_REGNO_REG_SET(HEAD, REG) bitmap_clear_bit (HEAD, REG)
  75
  76 /* Set a single register in a register set.  */
  77 #define SET_REGNO_REG_SET(HEAD, REG) bitmap_set_bit (HEAD, REG)
  78
  79 /* Return true if a register is set in a register set.  */
  80 #define REGNO_REG_SET_P(TO, REG) bitmap_bit_p (TO, REG)
  81
  82 /* Copy the hard registers in a register set to the hard register set.  */
  83 extern void reg_set_to_hard_reg_set (HARD_REG_SET *, const_bitmap);
  84 #define REG_SET_TO_HARD_REG_SET(TO, FROM)                               \
  85 do {                                                                    \
  86   CLEAR_HARD_REG_SET (TO);                                              \
  87   reg_set_to_hard_reg_set (&TO, FROM);                                  \
  88 } while (0)
  89
  90 typedef bitmap_iterator reg_set_iterator;
  91
  92 /* Loop over all registers in REGSET, starting with MIN, setting REGNUM to the
  93    register number and executing CODE for all registers that are set.  */
  94 #define EXECUTE_IF_SET_IN_REG_SET(REGSET, MIN, REGNUM, RSI)     \
  95   EXECUTE_IF_SET_IN_BITMAP (REGSET, MIN, REGNUM, RSI)
  96
  97 /* Loop over all registers in REGSET1 and REGSET2, starting with MIN, setting
  98    REGNUM to the register number and executing CODE for all registers that are
  99    set in the first regset and not set in the second.  */
 100 #define EXECUTE_IF_AND_COMPL_IN_REG_SET(REGSET1, REGSET2, MIN, REGNUM, RSI) \
 101   EXECUTE_IF_AND_COMPL_IN_BITMAP (REGSET1, REGSET2, MIN, REGNUM, RSI)
 102
 103 /* Loop over all registers in REGSET1 and REGSET2, starting with MIN, setting
 104    REGNUM to the register number and executing CODE for all registers that are
 105    set in both regsets.  */
 106 #define EXECUTE_IF_AND_IN_REG_SET(REGSET1, REGSET2, MIN, REGNUM, RSI) \
 107   EXECUTE_IF_AND_IN_BITMAP (REGSET1, REGSET2, MIN, REGNUM, RSI) \
 108
 109 /* Type we use to hold basic block counters.  Should be at least
 110    64bit.  Although a counter cannot be negative, we use a signed
 111    type, because erroneous negative counts can be generated when the
 112    flow graph is manipulated by various optimizations.  A signed type
 113    makes those easy to detect.  */
 114 typedef HOST_WIDEST_INT gcov_type;
 115
 116 /* Control flow edge information.  */
 117 struct edge_def GTY(())
 118 {
 119   /* The two blocks at the ends of the edge.  */
 120   struct basic_block_def *src;
 121   struct basic_block_def *dest;
 122
 123   /* Instructions queued on the edge.  */
 124   union edge_def_insns {
 125     gimple_seq GTY ((tag ("true"))) g;
 126     rtx GTY ((tag ("false"))) r;
 127   } GTY ((desc ("current_ir_type () == IR_GIMPLE"))) insns;
 128
 129   /* Auxiliary info specific to a pass.  */
 130   PTR GTY ((skip (""))) aux;
 131
 132   /* Location of any goto implicit in the edge and associated BLOCK.  */
 133   tree goto_block;
 134   location_t goto_locus;
 135
 136   /* The index number corresponding to this edge in the edge vector
 137      dest->preds.  */
 138   unsigned int dest_idx;
 139
 140   int flags;                    /* see EDGE_* below  */
 141   int probability;              /* biased by REG_BR_PROB_BASE */
 142   gcov_type count;              /* Expected number of executions calculated
 143                                    in profile.c  */
 144 };
 145
 146 typedef struct edge_def *edge;
 147 typedef const struct edge_def *const_edge;
 148 DEF_VEC_P(edge);
 149 DEF_VEC_ALLOC_P(edge,gc);
 150 DEF_VEC_ALLOC_P(edge,heap);
 151
 152 #define EDGE_FALLTHRU           1       /* 'Straight line' flow */
 153 #define EDGE_ABNORMAL           2       /* Strange flow, like computed
 154                                            label, or eh */
 155 #define EDGE_ABNORMAL_CALL      4       /* Call with abnormal exit
 156                                            like an exception, or sibcall */
 157 #define EDGE_EH                 8       /* Exception throw */
 158 #define EDGE_FAKE               16      /* Not a real edge (profile.c) */
 159 #define EDGE_DFS_BACK           32      /* A backwards edge */
 160 #define EDGE_CAN_FALLTHRU       64      /* Candidate for straight line
 161                                            flow.  */
 162 #define EDGE_IRREDUCIBLE_LOOP   128     /* Part of irreducible loop.  */
 163 #define EDGE_SIBCALL            256     /* Edge from sibcall to exit.  */
 164 #define EDGE_LOOP_EXIT          512     /* Exit of a loop.  */
 165 #define EDGE_TRUE_VALUE         1024    /* Edge taken when controlling
 166                                            predicate is nonzero.  */
 167 #define EDGE_FALSE_VALUE        2048    /* Edge taken when controlling
 168                                            predicate is zero.  */
 169 #define EDGE_EXECUTABLE         4096    /* Edge is executable.  Only
 170                                            valid during SSA-CCP.  */
 171 #define EDGE_CROSSING           8192    /* Edge crosses between hot
 172                                            and cold sections, when we
 173                                            do partitioning.  */
 174 #define EDGE_ALL_FLAGS         16383
 175
 176 #define EDGE_COMPLEX    (EDGE_ABNORMAL | EDGE_ABNORMAL_CALL | EDGE_EH)
 177
 178 /* Counter summary from the last set of coverage counts read by
 179    profile.c.  */
 180 extern const struct gcov_ctr_summary *profile_info;
 181
 182 /* Declared in cfgloop.h.  */
 183 struct loop;
 184
 185 /* Declared in tree-flow.h.  */
 186 struct edge_prediction;
 187 struct rtl_bb_info;
 188
 189 /* A basic block is a sequence of instructions with only entry and
 190    only one exit.  If any one of the instructions are executed, they
 191    will all be executed, and in sequence from first to last.
 192
 193    There may be COND_EXEC instructions in the basic block.  The
 194    COND_EXEC *instructions* will be executed -- but if the condition
 195    is false the conditionally executed *expressions* will of course
 196    not be executed.  We don't consider the conditionally executed
 197    expression (which might have side-effects) to be in a separate
 198    basic block because the program counter will always be at the same
 199    location after the COND_EXEC instruction, regardless of whether the
 200    condition is true or not.
 201
 202    Basic blocks need not start with a label nor end with a jump insn.
 203    For example, a previous basic block may just "conditionally fall"
 204    into the succeeding basic block, and the last basic block need not
 205    end with a jump insn.  Block 0 is a descendant of the entry block.
 206
 207    A basic block beginning with two labels cannot have notes between
 208    the labels.
 209
 210    Data for jump tables are stored in jump_insns that occur in no
 211    basic block even though these insns can follow or precede insns in
 212    basic blocks.  */
 213
 214 /* Basic block information indexed by block number.  */
 215 struct basic_block_def GTY((chain_next ("%h.next_bb"), chain_prev ("%h.prev_bb")))
 216 {
 217   /* The edges into and out of the block.  */
 218   VEC(edge,gc) *preds;
 219   VEC(edge,gc) *succs;
 220
 221   /* Auxiliary info specific to a pass.  */
 222   PTR GTY ((skip (""))) aux;
 223
 224   /* Innermost loop containing the block.  */
 225   struct loop *loop_father;
 226
 227   /* The dominance and postdominance information node.  */
 228   struct et_node * GTY ((skip (""))) dom[2];
 229
 230   /* Previous and next blocks in the chain.  */
 231   struct basic_block_def *prev_bb;
 232   struct basic_block_def *next_bb;
 233
 234   union basic_block_il_dependent {
 235       struct gimple_bb_info * GTY ((tag ("0"))) gimple;
 236       struct rtl_bb_info * GTY ((tag ("1"))) rtl;
 237     } GTY ((desc ("((%1.flags & BB_RTL) != 0)"))) il;
 238
 239   /* Expected number of executions: calculated in profile.c.  */
 240   gcov_type count;
 241
 242   /* The index of this block.  */
 243   int index;
 244
 245   /* The loop depth of this block.  */
 246   int loop_depth;
 247
 248   /* Expected frequency.  Normalized to be in range 0 to BB_FREQ_MAX.  */
 249   int frequency;
 250
 251   /* Various flags.  See BB_* below.  */
 252   int flags;
 253 };
 254
 255 struct rtl_bb_info GTY(())
 256 {
 257   /* The first and last insns of the block.  */
 258   rtx head_;
 259   rtx end_;
 260
 261   /* In CFGlayout mode points to insn notes/jumptables to be placed just before
 262      and after the block.   */
 263   rtx header;
 264   rtx footer;
 265
 266   /* This field is used by the bb-reorder and tracer passes.  */
 267   int visited;
 268 };
 269
 270 struct gimple_bb_info GTY(())
 271 {
 272   /* Sequence of statements in this block.  */
 273   gimple_seq seq;
 274
 275   /* PHI nodes for this block.  */
 276   gimple_seq phi_nodes;
 277 };
 278
 279 typedef struct basic_block_def *basic_block;
 280 typedef const struct basic_block_def *const_basic_block;
 281
 282 DEF_VEC_P(basic_block);
 283 DEF_VEC_ALLOC_P(basic_block,gc);
 284 DEF_VEC_ALLOC_P(basic_block,heap);
 285
 286 #define BB_FREQ_MAX 10000
 287
 288 /* Masks for basic_block.flags.
 289
 290    BB_HOT_PARTITION and BB_COLD_PARTITION should be preserved throughout
 291    the compilation, so they are never cleared.
 292
 293    All other flags may be cleared by clear_bb_flags().  It is generally
 294    a bad idea to rely on any flags being up-to-date.  */
 295
 296 enum bb_flags
 297 {
 298   /* Only set on blocks that have just been created by create_bb.  */
 299   BB_NEW = 1 << 0,
 300
 301   /* Set by find_unreachable_blocks.  Do not rely on this being set in any
 302      pass.  */
 303   BB_REACHABLE = 1 << 1,
 304
 305   /* Set for blocks in an irreducible loop by loop analysis.  */
 306   BB_IRREDUCIBLE_LOOP = 1 << 2,
 307
 308   /* Set on blocks that may actually not be single-entry single-exit block.  */
 309   BB_SUPERBLOCK = 1 << 3,
 310
 311   /* Set on basic blocks that the scheduler should not touch.  This is used
 312      by SMS to prevent other schedulers from messing with the loop schedule.  */
 313   BB_DISABLE_SCHEDULE = 1 << 4,
 314
 315   /* Set on blocks that should be put in a hot section.  */
 316   BB_HOT_PARTITION = 1 << 5,
 317
 318   /* Set on blocks that should be put in a cold section.  */
 319   BB_COLD_PARTITION = 1 << 6,
 320
 321   /* Set on block that was duplicated.  */
 322   BB_DUPLICATED = 1 << 7,
 323
 324   /* Set if the label at the top of this block is the target of a non-local goto.  */
 325   BB_NON_LOCAL_GOTO_TARGET = 1 << 8,
 326
 327   /* Set on blocks that are in RTL format.  */
 328   BB_RTL = 1 << 9 ,
 329
 330   /* Set on blocks that are forwarder blocks.
 331      Only used in cfgcleanup.c.  */
 332   BB_FORWARDER_BLOCK = 1 << 10,
 333
 334   /* Set on blocks that cannot be threaded through.
 335      Only used in cfgcleanup.c.  */
 336   BB_NONTHREADABLE_BLOCK = 1 << 11
 337 };
 338
 339 /* Dummy flag for convenience in the hot/cold partitioning code.  */
 340 #define BB_UNPARTITIONED        0
 341
 342 /* Partitions, to be used when partitioning hot and cold basic blocks into
 343    separate sections.  */
 344 #define BB_PARTITION(bb) ((bb)->flags & (BB_HOT_PARTITION|BB_COLD_PARTITION))
 345 #define BB_SET_PARTITION(bb, part) do {                                 \
 346   basic_block bb_ = (bb);                                               \
 347   bb_->flags = ((bb_->flags & ~(BB_HOT_PARTITION|BB_COLD_PARTITION))    \
 348                 | (part));                                              \
 349 } while (0)
 350
 351 #define BB_COPY_PARTITION(dstbb, srcbb) \
 352   BB_SET_PARTITION (dstbb, BB_PARTITION (srcbb))
 353
 354 /* State of dominance information.  */
 355
 356 enum dom_state
 357 {
 358   DOM_NONE,             /* Not computed at all.  */
 359   DOM_NO_FAST_QUERY,    /* The data is OK, but the fast query data are not usable.  */
 360   DOM_OK                /* Everything is ok.  */
 361 };
 362
 363 /* A structure to group all the per-function control flow graph data.
 364    The x_* prefixing is necessary because otherwise references to the
 365    fields of this struct are interpreted as the defines for backward
 366    source compatibility following the definition of this struct.  */
 367 struct control_flow_graph GTY(())
 368 {
 369   /* Block pointers for the exit and entry of a function.
 370      These are always the head and tail of the basic block list.  */
 371   basic_block x_entry_block_ptr;
 372   basic_block x_exit_block_ptr;
 373
 374   /* Index by basic block number, get basic block struct info.  */
 375   VEC(basic_block,gc) *x_basic_block_info;
 376
 377   /* Number of basic blocks in this flow graph.  */
 378   int x_n_basic_blocks;
 379
 380   /* Number of edges in this flow graph.  */
 381   int x_n_edges;
 382
 383   /* The first free basic block number.  */
 384   int x_last_basic_block;
 385
 386   /* Mapping of labels to their associated blocks.  At present
 387      only used for the gimple CFG.  */
 388   VEC(basic_block,gc) *x_label_to_block_map;
 389
 390   enum profile_status {
 391     PROFILE_ABSENT,
 392     PROFILE_GUESSED,
 393     PROFILE_READ
 394   } x_profile_status;
 395
 396   /* Whether the dominators and the postdominators are available.  */
 397   enum dom_state x_dom_computed[2];
 398
 399   /* Number of basic blocks in the dominance tree.  */
 400   unsigned x_n_bbs_in_dom_tree[2];
 401
 402   /* Maximal number of entities in the single jumptable.  Used to estimate
 403      final flowgraph size.  */
 404   int max_jumptable_ents;
 405
 406   /* UIDs for LABEL_DECLs.  */
 407   int last_label_uid;
 408 };
 409
 410 /* Defines for accessing the fields of the CFG structure for function FN.  */
 411 #define ENTRY_BLOCK_PTR_FOR_FUNCTION(FN)     ((FN)->cfg->x_entry_block_ptr)
 412 #define EXIT_BLOCK_PTR_FOR_FUNCTION(FN)      ((FN)->cfg->x_exit_block_ptr)
 413 #define basic_block_info_for_function(FN)    ((FN)->cfg->x_basic_block_info)
 414 #define n_basic_blocks_for_function(FN)      ((FN)->cfg->x_n_basic_blocks)
 415 #define n_edges_for_function(FN)             ((FN)->cfg->x_n_edges)
 416 #define last_basic_block_for_function(FN)    ((FN)->cfg->x_last_basic_block)
 417 #define label_to_block_map_for_function(FN)  ((FN)->cfg->x_label_to_block_map)
 418 #define profile_status_for_function(FN)      ((FN)->cfg->x_profile_status)
 419
 420 #define BASIC_BLOCK_FOR_FUNCTION(FN,N) \
 421   (VEC_index (basic_block, basic_block_info_for_function(FN), (N)))
 422 #define SET_BASIC_BLOCK_FOR_FUNCTION(FN,N,BB) \
 423   (VEC_replace (basic_block, basic_block_info_for_function(FN), (N), (BB)))
 424
 425 /* Defines for textual backward source compatibility.  */
 426 #define ENTRY_BLOCK_PTR         (cfun->cfg->x_entry_block_ptr)
 427 #define EXIT_BLOCK_PTR          (cfun->cfg->x_exit_block_ptr)
 428 #define basic_block_info        (cfun->cfg->x_basic_block_info)
 429 #define n_basic_blocks          (cfun->cfg->x_n_basic_blocks)
 430 #define n_edges                 (cfun->cfg->x_n_edges)
 431 #define last_basic_block        (cfun->cfg->x_last_basic_block)
 432 #define label_to_block_map      (cfun->cfg->x_label_to_block_map)
 433 #define profile_status          (cfun->cfg->x_profile_status)
 434
 435 #define BASIC_BLOCK(N)          (VEC_index (basic_block, basic_block_info, (N)))
 436 #define SET_BASIC_BLOCK(N,BB)   (VEC_replace (basic_block, basic_block_info, (N), (BB)))
 437
 438 /* For iterating over basic blocks.  */
 439 #define FOR_BB_BETWEEN(BB, FROM, TO, DIR) \
 440   for (BB = FROM; BB != TO; BB = BB->DIR)
 441
 442 #define FOR_EACH_BB_FN(BB, FN) \
 443   FOR_BB_BETWEEN (BB, (FN)->cfg->x_entry_block_ptr->next_bb, (FN)->cfg->x_exit_block_ptr, next_bb)
 444
 445 #define FOR_EACH_BB(BB) FOR_EACH_BB_FN (BB, cfun)
 446
 447 #define FOR_EACH_BB_REVERSE_FN(BB, FN) \
 448   FOR_BB_BETWEEN (BB, (FN)->cfg->x_exit_block_ptr->prev_bb, (FN)->cfg->x_entry_block_ptr, prev_bb)
 449
 450 #define FOR_EACH_BB_REVERSE(BB) FOR_EACH_BB_REVERSE_FN(BB, cfun)
 451
 452 /* For iterating over insns in basic block.  */
 453 #define FOR_BB_INSNS(BB, INSN)                  \
 454   for ((INSN) = BB_HEAD (BB);                   \
 455        (INSN) && (INSN) != NEXT_INSN (BB_END (BB));     \
 456        (INSN) = NEXT_INSN (INSN))
 457
 458 /* For iterating over insns in basic block when we might remove the
 459    current insn.  */
 460 #define FOR_BB_INSNS_SAFE(BB, INSN, CURR)                       \
 461   for ((INSN) = BB_HEAD (BB), (CURR) = (INSN) ? NEXT_INSN ((INSN)): NULL;       \
 462        (INSN) && (INSN) != NEXT_INSN (BB_END (BB));     \
 463        (INSN) = (CURR), (CURR) = (INSN) ? NEXT_INSN ((INSN)) : NULL)
 464
 465 #define FOR_BB_INSNS_REVERSE(BB, INSN)          \
 466   for ((INSN) = BB_END (BB);                    \
 467        (INSN) && (INSN) != PREV_INSN (BB_HEAD (BB));    \
 468        (INSN) = PREV_INSN (INSN))
 469
 470 #define FOR_BB_INSNS_REVERSE_SAFE(BB, INSN, CURR)       \
 471   for ((INSN) = BB_END (BB),(CURR) = (INSN) ? PREV_INSN ((INSN)) : NULL;        \
 472        (INSN) && (INSN) != PREV_INSN (BB_HEAD (BB));    \
 473        (INSN) = (CURR), (CURR) = (INSN) ? PREV_INSN ((INSN)) : NULL)
 474
 475 /* Cycles through _all_ basic blocks, even the fake ones (entry and
 476    exit block).  */
 477
 478 #define FOR_ALL_BB(BB) \
 479   for (BB = ENTRY_BLOCK_PTR; BB; BB = BB->next_bb)
 480
 481 #define FOR_ALL_BB_FN(BB, FN) \
 482   for (BB = ENTRY_BLOCK_PTR_FOR_FUNCTION (FN); BB; BB = BB->next_bb)
 483
 484 extern bitmap_obstack reg_obstack;
 485
 486 \f
 487 /* Stuff for recording basic block info.  */
 488
 489 #define BB_HEAD(B)      (B)->il.rtl->head_
 490 #define BB_END(B)       (B)->il.rtl->end_
 491
 492 /* Special block numbers [markers] for entry and exit.  */
 493 #define ENTRY_BLOCK (0)
 494 #define EXIT_BLOCK (1)
 495
 496 /* The two blocks that are always in the cfg.  */
 497 #define NUM_FIXED_BLOCKS (2)
 498
 499
 500 #define BLOCK_NUM(INSN)       (BLOCK_FOR_INSN (INSN)->index + 0)
 501 #define set_block_for_insn(INSN, BB)  (BLOCK_FOR_INSN (INSN) = BB)
 502
 503 extern void compute_bb_for_insn (void);
 504 extern unsigned int free_bb_for_insn (void);
 505 extern void update_bb_for_insn (basic_block);
 506
 507 extern void insert_insn_on_edge (rtx, edge);
 508 basic_block split_edge_and_insert (edge, rtx);
 509
 510 extern void commit_edge_insertions (void);
 511
 512 extern void remove_fake_edges (void);
 513 extern void remove_fake_exit_edges (void);
 514 extern void add_noreturn_fake_exit_edges (void);
 515 extern void connect_infinite_loops_to_exit (void);
 516 extern edge unchecked_make_edge (basic_block, basic_block, int);
 517 extern edge cached_make_edge (sbitmap, basic_block, basic_block, int);
 518 extern edge make_edge (basic_block, basic_block, int);
 519 extern edge make_single_succ_edge (basic_block, basic_block, int);
 520 extern void remove_edge_raw (edge);
 521 extern void redirect_edge_succ (edge, basic_block);
 522 extern edge redirect_edge_succ_nodup (edge, basic_block);
 523 extern void redirect_edge_pred (edge, basic_block);
 524 extern basic_block create_basic_block_structure (rtx, rtx, rtx, basic_block);
 525 extern void clear_bb_flags (void);
 526 extern int post_order_compute (int *, bool, bool);
 527 extern int inverted_post_order_compute (int *);
 528 extern int pre_and_rev_post_order_compute (int *, int *, bool);
 529 extern int dfs_enumerate_from (basic_block, int,
 530                                bool (*)(const_basic_block, const void *),
 531                                basic_block *, int, const void *);
 532 extern void compute_dominance_frontiers (bitmap *);
 533 extern bitmap compute_idf (bitmap, bitmap *);
 534 extern void dump_bb_info (basic_block, bool, bool, int, const char *, FILE *);
 535 extern void dump_edge_info (FILE *, edge, int);
 536 extern void brief_dump_cfg (FILE *);
 537 extern void clear_edges (void);
 538 extern void scale_bbs_frequencies_int (basic_block *, int, int, int);
 539 extern void scale_bbs_frequencies_gcov_type (basic_block *, int, gcov_type,
 540                                              gcov_type);
 541
 542 /* Structure to group all of the information to process IF-THEN and
 543    IF-THEN-ELSE blocks for the conditional execution support.  This
 544    needs to be in a public file in case the IFCVT macros call
 545    functions passing the ce_if_block data structure.  */
 546
 547 typedef struct ce_if_block
 548 {
 549   basic_block test_bb;                  /* First test block.  */
 550   basic_block then_bb;                  /* THEN block.  */
 551   basic_block else_bb;                  /* ELSE block or NULL.  */
 552   basic_block join_bb;                  /* Join THEN/ELSE blocks.  */
 553   basic_block last_test_bb;             /* Last bb to hold && or || tests.  */
 554   int num_multiple_test_blocks;         /* # of && and || basic blocks.  */
 555   int num_and_and_blocks;               /* # of && blocks.  */
 556   int num_or_or_blocks;                 /* # of || blocks.  */
 557   int num_multiple_test_insns;          /* # of insns in && and || blocks.  */
 558   int and_and_p;                        /* Complex test is &&.  */
 559   int num_then_insns;                   /* # of insns in THEN block.  */
 560   int num_else_insns;                   /* # of insns in ELSE block.  */
 561   int pass;                             /* Pass number.  */
 562
 563 #ifdef IFCVT_EXTRA_FIELDS
 564   IFCVT_EXTRA_FIELDS                    /* Any machine dependent fields.  */
 565 #endif
 566
 567 } ce_if_block_t;
 568
 569 /* This structure maintains an edge list vector.  */
 570 struct edge_list
 571 {
 572   int num_blocks;
 573   int num_edges;
 574   edge *index_to_edge;
 575 };
 576
 577 /* The base value for branch probability notes and edge probabilities.  */
 578 #define REG_BR_PROB_BASE  10000
 579
 580 /* This is the value which indicates no edge is present.  */
 581 #define EDGE_INDEX_NO_EDGE      -1
 582
 583 /* EDGE_INDEX returns an integer index for an edge, or EDGE_INDEX_NO_EDGE
 584    if there is no edge between the 2 basic blocks.  */
 585 #define EDGE_INDEX(el, pred, succ) (find_edge_index ((el), (pred), (succ)))
 586
 587 /* INDEX_EDGE_PRED_BB and INDEX_EDGE_SUCC_BB return a pointer to the basic
 588    block which is either the pred or succ end of the indexed edge.  */
 589 #define INDEX_EDGE_PRED_BB(el, index)   ((el)->index_to_edge[(index)]->src)
 590 #define INDEX_EDGE_SUCC_BB(el, index)   ((el)->index_to_edge[(index)]->dest)
 591
 592 /* INDEX_EDGE returns a pointer to the edge.  */
 593 #define INDEX_EDGE(el, index)           ((el)->index_to_edge[(index)])
 594
 595 /* Number of edges in the compressed edge list.  */
 596 #define NUM_EDGES(el)                   ((el)->num_edges)
 597
 598 /* BB is assumed to contain conditional jump.  Return the fallthru edge.  */
 599 #define FALLTHRU_EDGE(bb)               (EDGE_SUCC ((bb), 0)->flags & EDGE_FALLTHRU \
 600                                          ? EDGE_SUCC ((bb), 0) : EDGE_SUCC ((bb), 1))
 601
 602 /* BB is assumed to contain conditional jump.  Return the branch edge.  */
 603 #define BRANCH_EDGE(bb)                 (EDGE_SUCC ((bb), 0)->flags & EDGE_FALLTHRU \
 604                                          ? EDGE_SUCC ((bb), 1) : EDGE_SUCC ((bb), 0))
 605
 606 /* Return expected execution frequency of the edge E.  */
 607 #define EDGE_FREQUENCY(e)               (((e)->src->frequency \
 608                                           * (e)->probability \
 609                                           + REG_BR_PROB_BASE / 2) \
 610                                          / REG_BR_PROB_BASE)
 611
 612 /* Return nonzero if edge is critical.  */
 613 #define EDGE_CRITICAL_P(e)              (EDGE_COUNT ((e)->src->succs) >= 2 \
 614                                          && EDGE_COUNT ((e)->dest->preds) >= 2)
 615
 616 #define EDGE_COUNT(ev)                  VEC_length (edge, (ev))
 617 #define EDGE_I(ev,i)                    VEC_index  (edge, (ev), (i))
 618 #define EDGE_PRED(bb,i)                 VEC_index  (edge, (bb)->preds, (i))
 619 #define EDGE_SUCC(bb,i)                 VEC_index  (edge, (bb)->succs, (i))
 620
 621 /* Returns true if BB has precisely one successor.  */
 622
 623 static inline bool
 624 single_succ_p (const_basic_block bb)
 625 {
 626   return EDGE_COUNT (bb->succs) == 1;
 627 }
 628
 629 /* Returns true if BB has precisely one predecessor.  */
 630
 631 static inline bool
 632 single_pred_p (const_basic_block bb)
 633 {
 634   return EDGE_COUNT (bb->preds) == 1;
 635 }
 636
 637 /* Returns the single successor edge of basic block BB.  Aborts if
 638    BB does not have exactly one successor.  */
 639
 640 static inline edge
 641 single_succ_edge (const_basic_block bb)
 642 {
 643   gcc_assert (single_succ_p (bb));
 644   return EDGE_SUCC (bb, 0);
 645 }
 646
 647 /* Returns the single predecessor edge of basic block BB.  Aborts
 648    if BB does not have exactly one predecessor.  */
 649
 650 static inline edge
 651 single_pred_edge (const_basic_block bb)
 652 {
 653   gcc_assert (single_pred_p (bb));
 654   return EDGE_PRED (bb, 0);
 655 }
 656
 657 /* Returns the single successor block of basic block BB.  Aborts
 658    if BB does not have exactly one successor.  */
 659
 660 static inline basic_block
 661 single_succ (const_basic_block bb)
 662 {
 663   return single_succ_edge (bb)->dest;
 664 }
 665
 666 /* Returns the single predecessor block of basic block BB.  Aborts
 667    if BB does not have exactly one predecessor.*/
 668
 669 static inline basic_block
 670 single_pred (const_basic_block bb)
 671 {
 672   return single_pred_edge (bb)->src;
 673 }
 674
 675 /* Iterator object for edges.  */
 676
 677 typedef struct {
 678   unsigned index;
 679   VEC(edge,gc) **container;
 680 } edge_iterator;
 681
 682 static inline VEC(edge,gc) *
 683 ei_container (edge_iterator i)
 684 {
 685   gcc_assert (i.container);
 686   return *i.container;
 687 }
 688
 689 #define ei_start(iter) ei_start_1 (&(iter))
 690 #define ei_last(iter) ei_last_1 (&(iter))
 691
 692 /* Return an iterator pointing to the start of an edge vector.  */
 693 static inline edge_iterator
 694 ei_start_1 (VEC(edge,gc) **ev)
 695 {
 696   edge_iterator i;
 697
 698   i.index = 0;
 699   i.container = ev;
 700
 701   return i;
 702 }
 703
 704 /* Return an iterator pointing to the last element of an edge
 705    vector.  */
 706 static inline edge_iterator
 707 ei_last_1 (VEC(edge,gc) **ev)
 708 {
 709   edge_iterator i;
 710
 711   i.index = EDGE_COUNT (*ev) - 1;
 712   i.container = ev;
 713
 714   return i;
 715 }
 716
 717 /* Is the iterator `i' at the end of the sequence?  */
 718 static inline bool
 719 ei_end_p (edge_iterator i)
 720 {
 721   return (i.index == EDGE_COUNT (ei_container (i)));
 722 }
 723
 724 /* Is the iterator `i' at one position before the end of the
 725    sequence?  */
 726 static inline bool
 727 ei_one_before_end_p (edge_iterator i)
 728 {
 729   return (i.index + 1 == EDGE_COUNT (ei_container (i)));
 730 }
 731
 732 /* Advance the iterator to the next element.  */
 733 static inline void
 734 ei_next (edge_iterator *i)
 735 {
 736   gcc_assert (i->index < EDGE_COUNT (ei_container (*i)));
 737   i->index++;
 738 }
 739
 740 /* Move the iterator to the previous element.  */
 741 static inline void
 742 ei_prev (edge_iterator *i)
 743 {
 744   gcc_assert (i->index > 0);
 745   i->index--;
 746 }
 747
 748 /* Return the edge pointed to by the iterator `i'.  */
 749 static inline edge
 750 ei_edge (edge_iterator i)
 751 {
 752   return EDGE_I (ei_container (i), i.index);
 753 }
 754
 755 /* Return an edge pointed to by the iterator.  Do it safely so that
 756    NULL is returned when the iterator is pointing at the end of the
 757    sequence.  */
 758 static inline edge
 759 ei_safe_edge (edge_iterator i)
 760 {
 761   return !ei_end_p (i) ? ei_edge (i) : NULL;
 762 }
 763
 764 /* Return 1 if we should continue to iterate.  Return 0 otherwise.
 765    *Edge P is set to the next edge if we are to continue to iterate
 766    and NULL otherwise.  */
 767
 768 static inline bool
 769 ei_cond (edge_iterator ei, edge *p)
 770 {
 771   if (!ei_end_p (ei))
 772     {
 773       *p = ei_edge (ei);
 774       return 1;
 775     }
 776   else
 777     {
 778       *p = NULL;
 779       return 0;
 780     }
 781 }
 782
 783 /* This macro serves as a convenient way to iterate each edge in a
 784    vector of predecessor or successor edges.  It must not be used when
 785    an element might be removed during the traversal, otherwise
 786    elements will be missed.  Instead, use a for-loop like that shown
 787    in the following pseudo-code:
 788
 789    FOR (ei = ei_start (bb->succs); (e = ei_safe_edge (ei)); )
 790      {
 791         IF (e != taken_edge)
 792           remove_edge (e);
 793         ELSE
 794           ei_next (&ei);
 795      }
 796 */
 797
 798 #define FOR_EACH_EDGE(EDGE,ITER,EDGE_VEC)       \
 799   for ((ITER) = ei_start ((EDGE_VEC));          \
 800        ei_cond ((ITER), &(EDGE));               \
 801        ei_next (&(ITER)))
 802
 803 struct edge_list * create_edge_list (void);
 804 void free_edge_list (struct edge_list *);
 805 void print_edge_list (FILE *, struct edge_list *);
 806 void verify_edge_list (FILE *, struct edge_list *);
 807 int find_edge_index (struct edge_list *, basic_block, basic_block);
 808 edge find_edge (basic_block, basic_block);
 809
 810 #define CLEANUP_EXPENSIVE       1       /* Do relatively expensive optimizations
 811                                            except for edge forwarding */
 812 #define CLEANUP_CROSSJUMP       2       /* Do crossjumping.  */
 813 #define CLEANUP_POST_REGSTACK   4       /* We run after reg-stack and need
 814                                            to care REG_DEAD notes.  */
 815 #define CLEANUP_THREADING       8       /* Do jump threading.  */
 816 #define CLEANUP_NO_INSN_DEL     16      /* Do not try to delete trivially dead
 817                                            insns.  */
 818 #define CLEANUP_CFGLAYOUT       32      /* Do cleanup in cfglayout mode.  */
 819
 820 /* In lcm.c */
 821 extern struct edge_list *pre_edge_lcm (int, sbitmap *, sbitmap *,
 822                                        sbitmap *, sbitmap *, sbitmap **,
 823                                        sbitmap **);
 824 extern struct edge_list *pre_edge_rev_lcm (int, sbitmap *,
 825                                            sbitmap *, sbitmap *,
 826                                            sbitmap *, sbitmap **,
 827                                            sbitmap **);
 828 extern void compute_available (sbitmap *, sbitmap *, sbitmap *, sbitmap *);
 829
 830 /* In predict.c */
 831 extern bool maybe_hot_bb_p (const_basic_block);
 832 extern bool maybe_hot_edge_p (edge);
 833 extern bool probably_never_executed_bb_p (const_basic_block);
 834 extern bool optimize_bb_for_size_p (const_basic_block);
 835 extern bool optimize_bb_for_speed_p (const_basic_block);
 836 extern bool optimize_edge_for_size_p (edge);
 837 extern bool optimize_edge_for_speed_p (edge);
 838 extern bool optimize_function_for_size_p (struct function *);
 839 extern bool optimize_function_for_speed_p (struct function *);
 840 extern bool optimize_loop_for_size_p (struct loop *);
 841 extern bool optimize_loop_for_speed_p (struct loop *);
 842 extern bool optimize_loop_nest_for_size_p (struct loop *);
 843 extern bool optimize_loop_nest_for_speed_p (struct loop *);
 844 extern bool gimple_predicted_by_p (const_basic_block, enum br_predictor);
 845 extern bool rtl_predicted_by_p (const_basic_block, enum br_predictor);
 846 extern void gimple_predict_edge (edge, enum br_predictor, int);
 847 extern void rtl_predict_edge (edge, enum br_predictor, int);
 848 extern void predict_edge_def (edge, enum br_predictor, enum prediction);
 849 extern void guess_outgoing_edge_probabilities (basic_block);
 850 extern void remove_predictions_associated_with_edge (edge);
 851 extern bool edge_probability_reliable_p (const_edge);
 852 extern bool br_prob_note_reliable_p (const_rtx);
 853 extern bool predictable_edge_p (edge);
 854
 855 /* In cfg.c  */
 856 extern void dump_regset (regset, FILE *);
 857 extern void debug_regset (regset);
 858 extern void init_flow (struct function *);
 859 extern void debug_bb (basic_block);
 860 extern basic_block debug_bb_n (int);
 861 extern void dump_regset (regset, FILE *);
 862 extern void debug_regset (regset);
 863 extern void expunge_block (basic_block);
 864 extern void link_block (basic_block, basic_block);
 865 extern void unlink_block (basic_block);
 866 extern void compact_blocks (void);
 867 extern basic_block alloc_block (void);
 868 extern void alloc_aux_for_block (basic_block, int);
 869 extern void alloc_aux_for_blocks (int);
 870 extern void clear_aux_for_blocks (void);
 871 extern void free_aux_for_blocks (void);
 872 extern void alloc_aux_for_edge (edge, int);
 873 extern void alloc_aux_for_edges (int);
 874 extern void clear_aux_for_edges (void);
 875 extern void free_aux_for_edges (void);
 876
 877 /* In cfganal.c  */
 878 extern void find_unreachable_blocks (void);
 879 extern bool forwarder_block_p (const_basic_block);
 880 extern bool can_fallthru (basic_block, basic_block);
 881 extern bool could_fall_through (basic_block, basic_block);
 882 extern void flow_nodes_print (const char *, const_sbitmap, FILE *);
 883 extern void flow_edge_list_print (const char *, const edge *, int, FILE *);
 884
 885 /* In cfgrtl.c  */
 886 extern basic_block force_nonfallthru (edge);
 887 extern rtx block_label (basic_block);
 888 extern bool purge_all_dead_edges (void);
 889 extern bool purge_dead_edges (basic_block);
 890
 891 /* In cfgbuild.c.  */
 892 extern void find_many_sub_basic_blocks (sbitmap);
 893 extern void rtl_make_eh_edge (sbitmap, basic_block, rtx);
 894 extern void find_basic_blocks (rtx);
 895
 896 /* In cfgcleanup.c.  */
 897 extern bool cleanup_cfg (int);
 898 extern bool delete_unreachable_blocks (void);
 899
 900 extern bool mark_dfs_back_edges (void);
 901 extern void set_edge_can_fallthru_flag (void);
 902 extern void update_br_prob_note (basic_block);
 903 extern void fixup_abnormal_edges (void);
 904 extern bool inside_basic_block_p (const_rtx);
 905 extern bool control_flow_insn_p (const_rtx);
 906 extern rtx get_last_bb_insn (basic_block);
 907
 908 /* In bb-reorder.c */
 909 extern void reorder_basic_blocks (void);
 910
 911 /* In dominance.c */
 912
 913 enum cdi_direction
 914 {
 915   CDI_DOMINATORS = 1,
 916   CDI_POST_DOMINATORS = 2
 917 };
 918
 919 extern enum dom_state dom_info_state (enum cdi_direction);
 920 extern void set_dom_info_availability (enum cdi_direction, enum dom_state);
 921 extern bool dom_info_available_p (enum cdi_direction);
 922 extern void calculate_dominance_info (enum cdi_direction);
 923 extern void free_dominance_info (enum cdi_direction);
 924 extern basic_block nearest_common_dominator (enum cdi_direction,
 925                                              basic_block, basic_block);
 926 extern basic_block nearest_common_dominator_for_set (enum cdi_direction,
 927                                                      bitmap);
 928 extern void set_immediate_dominator (enum cdi_direction, basic_block,
 929                                      basic_block);
 930 extern basic_block get_immediate_dominator (enum cdi_direction, basic_block);
 931 extern bool dominated_by_p (enum cdi_direction, const_basic_block, const_basic_block);
 932 extern VEC (basic_block, heap) *get_dominated_by (enum cdi_direction, basic_block);
 933 extern VEC (basic_block, heap) *get_dominated_by_region (enum cdi_direction,
 934                                                          basic_block *,
 935                                                          unsigned);
 936 extern void add_to_dominance_info (enum cdi_direction, basic_block);
 937 extern void delete_from_dominance_info (enum cdi_direction, basic_block);
 938 basic_block recompute_dominator (enum cdi_direction, basic_block);
 939 extern void redirect_immediate_dominators (enum cdi_direction, basic_block,
 940                                            basic_block);
 941 extern void iterate_fix_dominators (enum cdi_direction,
 942                                     VEC (basic_block, heap) *, bool);
 943 extern void verify_dominators (enum cdi_direction);
 944 extern basic_block first_dom_son (enum cdi_direction, basic_block);
 945 extern basic_block next_dom_son (enum cdi_direction, basic_block);
 946 unsigned bb_dom_dfs_in (enum cdi_direction, basic_block);
 947 unsigned bb_dom_dfs_out (enum cdi_direction, basic_block);
 948
 949 extern edge try_redirect_by_replacing_jump (edge, basic_block, bool);
 950 extern void break_superblocks (void);
 951 extern void relink_block_chain (bool);
 952 extern void check_bb_profile (basic_block, FILE *);
 953 extern void update_bb_profile_for_threading (basic_block, int, gcov_type, edge);
 954 extern void init_rtl_bb_info (basic_block);
 955
 956 extern void initialize_original_copy_tables (void);
 957 extern void free_original_copy_tables (void);
 958 extern void set_bb_original (basic_block, basic_block);
 959 extern basic_block get_bb_original (basic_block);
 960 extern void set_bb_copy (basic_block, basic_block);
 961 extern basic_block get_bb_copy (basic_block);
 962 void set_loop_copy (struct loop *, struct loop *);
 963 struct loop *get_loop_copy (struct loop *);
 964
 965
 966 extern rtx insert_insn_end_bb_new (rtx, basic_block);
 967
 968 #include "cfghooks.h"
 969
 970 /* Return true when one of the predecessor edges of BB is marked with EDGE_EH.  */
 971 static inline bool
 972 bb_has_eh_pred (basic_block bb)
 973 {
 974   edge e;
 975   edge_iterator ei;
 976
 977   FOR_EACH_EDGE (e, ei, bb->preds)
 978     {
 979       if (e->flags & EDGE_EH)
 980         return true;
 981     }
 982   return false;
 983 }
 984
 985 /* Return true when one of the predecessor edges of BB is marked with EDGE_ABNORMAL.  */
 986 static inline bool
 987 bb_has_abnormal_pred (basic_block bb)
 988 {
 989   edge e;
 990   edge_iterator ei;
 991
 992   FOR_EACH_EDGE (e, ei, bb->preds)
 993     {
 994       if (e->flags & EDGE_ABNORMAL)
 995         return true;
 996     }
 997   return false;
 998 }
 999
1000 /* In cfgloopmanip.c.  */
1001 extern edge mfb_kj_edge;
1002 extern bool mfb_keep_just (edge);
1003
1004 /* In cfgexpand.c.  */
1005 extern void rtl_profile_for_bb (basic_block);
1006 extern void rtl_profile_for_edge (edge);
1007 extern void default_rtl_profile (void);
1008
1009 #endif /* GCC_BASIC_BLOCK_H */