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    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 2, 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 COPYING.  If not, write to the Free
  19 Software Foundation, 59 Temple Place - Suite 330, Boston, MA
  20 02111-1307, USA.  */
  21
  22 #ifndef GCC_BASIC_BLOCK_H
  23 #define GCC_BASIC_BLOCK_H
  24
  25 #include "bitmap.h"
  26 #include "sbitmap.h"
  27 #include "varray.h"
  28 #include "partition.h"
  29 #include "hard-reg-set.h"
  30 #include "predict.h"
  31 #include "vec.h"
  32 #include "errors.h"
  33
  34 /* Head of register set linked list.  */
  35 typedef bitmap_head regset_head;
  36
  37 /* A pointer to a regset_head.  */
  38 typedef bitmap regset;
  39
  40 /* Initialize a new regset.  */
  41 #define INIT_REG_SET(HEAD) bitmap_initialize (HEAD, 1)
  42
  43 /* Clear a register set by freeing up the linked list.  */
  44 #define CLEAR_REG_SET(HEAD) bitmap_clear (HEAD)
  45
  46 /* Copy a register set to another register set.  */
  47 #define COPY_REG_SET(TO, FROM) bitmap_copy (TO, FROM)
  48
  49 /* Compare two register sets.  */
  50 #define REG_SET_EQUAL_P(A, B) bitmap_equal_p (A, B)
  51
  52 /* `and' a register set with a second register set.  */
  53 #define AND_REG_SET(TO, FROM) bitmap_operation (TO, TO, FROM, BITMAP_AND)
  54
  55 /* `and' the complement of a register set with a register set.  */
  56 #define AND_COMPL_REG_SET(TO, FROM) \
  57   bitmap_operation (TO, TO, FROM, BITMAP_AND_COMPL)
  58
  59 /* Inclusive or a register set with a second register set.  */
  60 #define IOR_REG_SET(TO, FROM) bitmap_operation (TO, TO, FROM, BITMAP_IOR)
  61
  62 /* Exclusive or a register set with a second register set.  */
  63 #define XOR_REG_SET(TO, FROM) bitmap_operation (TO, TO, FROM, BITMAP_XOR)
  64
  65 /* Or into TO the register set FROM1 `and'ed with the complement of FROM2.  */
  66 #define IOR_AND_COMPL_REG_SET(TO, FROM1, FROM2) \
  67   bitmap_ior_and_compl (TO, FROM1, FROM2)
  68
  69 /* Clear a single register in a register set.  */
  70 #define CLEAR_REGNO_REG_SET(HEAD, REG) bitmap_clear_bit (HEAD, REG)
  71
  72 /* Set a single register in a register set.  */
  73 #define SET_REGNO_REG_SET(HEAD, REG) bitmap_set_bit (HEAD, REG)
  74
  75 /* Return true if a register is set in a register set.  */
  76 #define REGNO_REG_SET_P(TO, REG) bitmap_bit_p (TO, REG)
  77
  78 /* Copy the hard registers in a register set to the hard register set.  */
  79 extern void reg_set_to_hard_reg_set (HARD_REG_SET *, bitmap);
  80 #define REG_SET_TO_HARD_REG_SET(TO, FROM)                               \
  81 do {                                                                    \
  82   CLEAR_HARD_REG_SET (TO);                                              \
  83   reg_set_to_hard_reg_set (&TO, FROM);                                  \
  84 } while (0)
  85
  86 /* Loop over all registers in REGSET, starting with MIN, setting REGNUM to the
  87    register number and executing CODE for all registers that are set.  */
  88 #define EXECUTE_IF_SET_IN_REG_SET(REGSET, MIN, REGNUM, CODE)            \
  89   EXECUTE_IF_SET_IN_BITMAP (REGSET, MIN, REGNUM, CODE)
  90
  91 /* Loop over all registers in REGSET1 and REGSET2, starting with MIN, setting
  92    REGNUM to the register number and executing CODE for all registers that are
  93    set in the first regset and not set in the second.  */
  94 #define EXECUTE_IF_AND_COMPL_IN_REG_SET(REGSET1, REGSET2, MIN, REGNUM, CODE) \
  95   EXECUTE_IF_AND_COMPL_IN_BITMAP (REGSET1, REGSET2, MIN, REGNUM, CODE)
  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 both regsets.  */
 100 #define EXECUTE_IF_AND_IN_REG_SET(REGSET1, REGSET2, MIN, REGNUM, CODE) \
 101   EXECUTE_IF_AND_IN_BITMAP (REGSET1, REGSET2, MIN, REGNUM, CODE)
 102
 103 /* Allocate a register set with oballoc.  */
 104 #define OBSTACK_ALLOC_REG_SET(OBSTACK) BITMAP_OBSTACK_ALLOC (OBSTACK)
 105
 106 /* Initialize a register set.  Returns the new register set.  */
 107 #define INITIALIZE_REG_SET(HEAD) bitmap_initialize (&HEAD, 1)
 108
 109 /* Do any cleanup needed on a regset when it is no longer used.  */
 110 #define FREE_REG_SET(REGSET) BITMAP_FREE(REGSET)
 111
 112 /* Do any one-time initializations needed for regsets.  */
 113 #define INIT_ONCE_REG_SET() BITMAP_INIT_ONCE ()
 114
 115 /* Grow any tables needed when the number of registers is calculated
 116    or extended.  For the linked list allocation, nothing needs to
 117    be done, other than zero the statistics on the first allocation.  */
 118 #define MAX_REGNO_REG_SET(NUM_REGS, NEW_P, RENUMBER_P)
 119
 120 /* Type we use to hold basic block counters.  Should be at least
 121    64bit.  Although a counter cannot be negative, we use a signed
 122    type, because erroneous negative counts can be generated when the
 123    flow graph is manipulated by various optimizations.  A signed type
 124    makes those easy to detect.  */
 125 typedef HOST_WIDEST_INT gcov_type;
 126
 127 /* Control flow edge information.  */
 128 struct edge_def GTY(())
 129 {
 130   /* The two blocks at the ends of the edge.  */
 131   struct basic_block_def *src;
 132   struct basic_block_def *dest;
 133
 134   /* Instructions queued on the edge.  */
 135   union edge_def_insns {
 136     rtx GTY ((tag ("0"))) r;
 137     tree GTY ((tag ("1"))) t;
 138   } GTY ((desc ("ir_type ()"))) insns;
 139
 140   /* Auxiliary info specific to a pass.  */
 141   PTR GTY ((skip (""))) aux;
 142
 143   /* Location of any goto implicit in the edge, during tree-ssa.  */
 144   source_locus goto_locus;
 145
 146   int flags;                    /* see EDGE_* below  */
 147   int probability;              /* biased by REG_BR_PROB_BASE */
 148   gcov_type count;              /* Expected number of executions calculated
 149                                    in profile.c  */
 150 };
 151
 152 typedef struct edge_def *edge;
 153 DEF_VEC_GC_P(edge);
 154
 155 #define EDGE_FALLTHRU           1       /* 'Straight line' flow */
 156 #define EDGE_ABNORMAL           2       /* Strange flow, like computed
 157                                            label, or eh */
 158 #define EDGE_ABNORMAL_CALL      4       /* Call with abnormal exit
 159                                            like an exception, or sibcall */
 160 #define EDGE_EH                 8       /* Exception throw */
 161 #define EDGE_FAKE               16      /* Not a real edge (profile.c) */
 162 #define EDGE_DFS_BACK           32      /* A backwards edge */
 163 #define EDGE_CAN_FALLTHRU       64      /* Candidate for straight line
 164                                            flow.  */
 165 #define EDGE_IRREDUCIBLE_LOOP   128     /* Part of irreducible loop.  */
 166 #define EDGE_SIBCALL            256     /* Edge from sibcall to exit.  */
 167 #define EDGE_LOOP_EXIT          512     /* Exit of a loop.  */
 168 #define EDGE_TRUE_VALUE         1024    /* Edge taken when controlling
 169                                            predicate is non zero.  */
 170 #define EDGE_FALSE_VALUE        2048    /* Edge taken when controlling
 171                                            predicate is zero.  */
 172 #define EDGE_EXECUTABLE         4096    /* Edge is executable.  Only
 173                                            valid during SSA-CCP.  */
 174 #define EDGE_CROSSING           8192    /* Edge crosses between hot
 175                                            and cold sections, when we
 176                                            do partitioning.  */
 177 #define EDGE_ALL_FLAGS         16383
 178
 179 #define EDGE_COMPLEX    (EDGE_ABNORMAL | EDGE_ABNORMAL_CALL | EDGE_EH)
 180
 181 /* Counter summary from the last set of coverage counts read by
 182    profile.c.  */
 183 extern const struct gcov_ctr_summary *profile_info;
 184
 185 /* Declared in cfgloop.h.  */
 186 struct loop;
 187 struct loops;
 188
 189 /* Declared in tree-flow.h.  */
 190 struct bb_ann_d;
 191
 192 /* A basic block is a sequence of instructions with only entry and
 193    only one exit.  If any one of the instructions are executed, they
 194    will all be executed, and in sequence from first to last.
 195
 196    There may be COND_EXEC instructions in the basic block.  The
 197    COND_EXEC *instructions* will be executed -- but if the condition
 198    is false the conditionally executed *expressions* will of course
 199    not be executed.  We don't consider the conditionally executed
 200    expression (which might have side-effects) to be in a separate
 201    basic block because the program counter will always be at the same
 202    location after the COND_EXEC instruction, regardless of whether the
 203    condition is true or not.
 204
 205    Basic blocks need not start with a label nor end with a jump insn.
 206    For example, a previous basic block may just "conditionally fall"
 207    into the succeeding basic block, and the last basic block need not
 208    end with a jump insn.  Block 0 is a descendant of the entry block.
 209
 210    A basic block beginning with two labels cannot have notes between
 211    the labels.
 212
 213    Data for jump tables are stored in jump_insns that occur in no
 214    basic block even though these insns can follow or precede insns in
 215    basic blocks.  */
 216
 217 /* Basic block information indexed by block number.  */
 218 struct basic_block_def GTY((chain_next ("%h.next_bb"), chain_prev ("%h.prev_bb")))
 219 {
 220   /* The first and last insns of the block.  */
 221   rtx head_;
 222   rtx end_;
 223
 224   /* Pointers to the first and last trees of the block.  */
 225   tree stmt_list;
 226
 227   /* The edges into and out of the block.  */
 228   VEC(edge) *preds;
 229   VEC(edge) *succs;
 230
 231   /* Liveness info.  */
 232
 233   /* The registers that are modified within this in block.  */
 234   bitmap GTY ((skip (""))) local_set;
 235   /* The registers that are conditionally modified within this block.
 236      In other words, registers that are set only as part of a
 237      COND_EXEC.  */
 238   bitmap GTY ((skip (""))) cond_local_set;
 239   /* The registers that are live on entry to this block.
 240
 241      Note that in SSA form, global_live_at_start does not reflect the
 242      use of regs in phi functions, since the liveness of these regs
 243      may depend on which edge was taken into the block.  */
 244   bitmap GTY ((skip (""))) global_live_at_start;
 245   /* The registers that are live on exit from this block.  */
 246   bitmap GTY ((skip (""))) global_live_at_end;
 247
 248   /* Auxiliary info specific to a pass.  */
 249   PTR GTY ((skip (""))) aux;
 250
 251   /* Innermost loop containing the block.  */
 252   struct loop * GTY ((skip (""))) loop_father;
 253
 254   /* The dominance and postdominance information node.  */
 255   struct et_node * GTY ((skip (""))) dom[2];
 256
 257   /* Previous and next blocks in the chain.  */
 258   struct basic_block_def *prev_bb;
 259   struct basic_block_def *next_bb;
 260
 261   /* The data used by basic block copying and reordering functions.  */
 262   struct reorder_block_def * GTY ((skip (""))) rbi;
 263
 264   /* Annotations used at the tree level.  */
 265   struct bb_ann_d *tree_annotations;
 266
 267   /* Expected number of executions: calculated in profile.c.  */
 268   gcov_type count;
 269
 270   /* The index of this block.  */
 271   int index;
 272
 273   /* The loop depth of this block.  */
 274   int loop_depth;
 275
 276   /* Expected frequency.  Normalized to be in range 0 to BB_FREQ_MAX.  */
 277   int frequency;
 278
 279   /* Various flags.  See BB_* below.  */
 280   int flags;
 281 };
 282
 283 typedef struct basic_block_def *basic_block;
 284
 285 /* Structure to hold information about the blocks during reordering and
 286    copying.  */
 287
 288 typedef struct reorder_block_def
 289 {
 290   rtx header;
 291   rtx footer;
 292   basic_block next;
 293   basic_block original;
 294   /* Used by loop copying.  */
 295   basic_block copy;
 296   int duplicated;
 297
 298   /* These fields are used by bb-reorder pass.  */
 299   int visited;
 300 } *reorder_block_def_p;
 301
 302 #define BB_FREQ_MAX 10000
 303
 304 /* Masks for basic_block.flags.  */
 305 #define BB_DIRTY                1
 306 #define BB_NEW                  2
 307 #define BB_REACHABLE            4
 308 #define BB_VISITED              8
 309 #define BB_IRREDUCIBLE_LOOP     16
 310 #define BB_SUPERBLOCK           32
 311 #define BB_DISABLE_SCHEDULE     64
 312
 313 #define BB_HOT_PARTITION        128
 314 #define BB_COLD_PARTITION       256
 315 #define BB_UNPARTITIONED        0
 316
 317 /* Partitions, to be used when partitioning hot and cold basic blocks into
 318    separate sections.  */
 319 #define BB_PARTITION(bb) ((bb)->flags & (BB_HOT_PARTITION|BB_COLD_PARTITION))
 320 #define BB_SET_PARTITION(bb, part) do {                                 \
 321   basic_block bb_ = (bb);                                               \
 322   bb_->flags = ((bb_->flags & ~(BB_HOT_PARTITION|BB_COLD_PARTITION))    \
 323                 | (part));                                              \
 324 } while (0)
 325
 326 #define BB_COPY_PARTITION(dstbb, srcbb) \
 327   BB_SET_PARTITION (dstbb, BB_PARTITION (srcbb))
 328
 329 /* Number of basic blocks in the current function.  */
 330
 331 extern int n_basic_blocks;
 332
 333 /* First free basic block number.  */
 334
 335 extern int last_basic_block;
 336
 337 /* Number of edges in the current function.  */
 338
 339 extern int n_edges;
 340
 341 /* Signalize the status of profile information in the CFG.  */
 342 extern enum profile_status
 343 {
 344   PROFILE_ABSENT,
 345   PROFILE_GUESSED,
 346   PROFILE_READ
 347 } profile_status;
 348
 349 /* Index by basic block number, get basic block struct info.  */
 350
 351 extern GTY(()) varray_type basic_block_info;
 352
 353 #define BASIC_BLOCK(N)  (VARRAY_BB (basic_block_info, (N)))
 354
 355 /* For iterating over basic blocks.  */
 356 #define FOR_BB_BETWEEN(BB, FROM, TO, DIR) \
 357   for (BB = FROM; BB != TO; BB = BB->DIR)
 358
 359 #define FOR_EACH_BB(BB) \
 360   FOR_BB_BETWEEN (BB, ENTRY_BLOCK_PTR->next_bb, EXIT_BLOCK_PTR, next_bb)
 361
 362 #define FOR_EACH_BB_REVERSE(BB) \
 363   FOR_BB_BETWEEN (BB, EXIT_BLOCK_PTR->prev_bb, ENTRY_BLOCK_PTR, prev_bb)
 364
 365 /* For iterating over insns in basic block.  */
 366 #define FOR_BB_INSNS(BB, INSN)                  \
 367   for ((INSN) = BB_HEAD (BB);                   \
 368        (INSN) != NEXT_INSN (BB_END (BB));       \
 369        (INSN) = NEXT_INSN (INSN))
 370
 371 #define FOR_BB_INSNS_REVERSE(BB, INSN)          \
 372   for ((INSN) = BB_END (BB);                    \
 373        (INSN) != PREV_INSN (BB_HEAD (BB));      \
 374        (INSN) = PREV_INSN (INSN))
 375
 376 /* Cycles through _all_ basic blocks, even the fake ones (entry and
 377    exit block).  */
 378
 379 #define FOR_ALL_BB(BB) \
 380   for (BB = ENTRY_BLOCK_PTR; BB; BB = BB->next_bb)
 381
 382 /* What registers are live at the setjmp call.  */
 383
 384 extern regset regs_live_at_setjmp;
 385
 386 /* Special labels found during CFG build.  */
 387
 388 extern GTY(()) rtx label_value_list;
 389
 390 extern struct obstack flow_obstack;
 391
 392 /* Indexed by n, gives number of basic block that  (REG n) is used in.
 393    If the value is REG_BLOCK_GLOBAL (-2),
 394    it means (REG n) is used in more than one basic block.
 395    REG_BLOCK_UNKNOWN (-1) means it hasn't been seen yet so we don't know.
 396    This information remains valid for the rest of the compilation
 397    of the current function; it is used to control register allocation.  */
 398
 399 #define REG_BLOCK_UNKNOWN -1
 400 #define REG_BLOCK_GLOBAL -2
 401
 402 #define REG_BASIC_BLOCK(N) (VARRAY_REG (reg_n_info, N)->basic_block)
 403 \f
 404 /* Stuff for recording basic block info.  */
 405
 406 #define BB_HEAD(B)      (B)->head_
 407 #define BB_END(B)       (B)->end_
 408
 409 /* Special block numbers [markers] for entry and exit.  */
 410 #define ENTRY_BLOCK (-1)
 411 #define EXIT_BLOCK (-2)
 412
 413 /* Special block number not valid for any block.  */
 414 #define INVALID_BLOCK (-3)
 415
 416 /* Similarly, block pointers for the edge list.  */
 417 extern GTY(()) basic_block ENTRY_BLOCK_PTR;
 418 extern GTY(()) basic_block EXIT_BLOCK_PTR;
 419
 420 #define BLOCK_NUM(INSN)       (BLOCK_FOR_INSN (INSN)->index + 0)
 421 #define set_block_for_insn(INSN, BB)  (BLOCK_FOR_INSN (INSN) = BB)
 422
 423 extern void compute_bb_for_insn (void);
 424 extern void free_bb_for_insn (void);
 425 extern void update_bb_for_insn (basic_block);
 426
 427 extern void free_basic_block_vars (void);
 428
 429 extern void insert_insn_on_edge (rtx, edge);
 430 bool safe_insert_insn_on_edge (rtx, edge);
 431
 432 extern void commit_edge_insertions (void);
 433 extern void commit_edge_insertions_watch_calls (void);
 434
 435 extern void remove_fake_edges (void);
 436 extern void remove_fake_exit_edges (void);
 437 extern void add_noreturn_fake_exit_edges (void);
 438 extern void connect_infinite_loops_to_exit (void);
 439 extern edge unchecked_make_edge (basic_block, basic_block, int);
 440 extern edge cached_make_edge (sbitmap *, basic_block, basic_block, int);
 441 extern edge make_edge (basic_block, basic_block, int);
 442 extern edge make_single_succ_edge (basic_block, basic_block, int);
 443 extern void remove_edge (edge);
 444 extern void redirect_edge_succ (edge, basic_block);
 445 extern edge redirect_edge_succ_nodup (edge, basic_block);
 446 extern void redirect_edge_pred (edge, basic_block);
 447 extern basic_block create_basic_block_structure (rtx, rtx, rtx, basic_block);
 448 extern void clear_bb_flags (void);
 449 extern void flow_reverse_top_sort_order_compute (int *);
 450 extern int flow_depth_first_order_compute (int *, int *);
 451 extern void flow_preorder_transversal_compute (int *);
 452 extern int dfs_enumerate_from (basic_block, int,
 453                                bool (*)(basic_block, void *),
 454                                basic_block *, int, void *);
 455 extern void compute_dominance_frontiers (bitmap *);
 456 extern void dump_edge_info (FILE *, edge, int);
 457 extern void brief_dump_cfg (FILE *);
 458 extern void clear_edges (void);
 459 extern void mark_critical_edges (void);
 460 extern rtx first_insn_after_basic_block_note (basic_block);
 461
 462 /* Structure to group all of the information to process IF-THEN and
 463    IF-THEN-ELSE blocks for the conditional execution support.  This
 464    needs to be in a public file in case the IFCVT macros call
 465    functions passing the ce_if_block data structure.  */
 466
 467 typedef struct ce_if_block
 468 {
 469   basic_block test_bb;                  /* First test block.  */
 470   basic_block then_bb;                  /* THEN block.  */
 471   basic_block else_bb;                  /* ELSE block or NULL.  */
 472   basic_block join_bb;                  /* Join THEN/ELSE blocks.  */
 473   basic_block last_test_bb;             /* Last bb to hold && or || tests.  */
 474   int num_multiple_test_blocks;         /* # of && and || basic blocks.  */
 475   int num_and_and_blocks;               /* # of && blocks.  */
 476   int num_or_or_blocks;                 /* # of || blocks.  */
 477   int num_multiple_test_insns;          /* # of insns in && and || blocks.  */
 478   int and_and_p;                        /* Complex test is &&.  */
 479   int num_then_insns;                   /* # of insns in THEN block.  */
 480   int num_else_insns;                   /* # of insns in ELSE block.  */
 481   int pass;                             /* Pass number.  */
 482
 483 #ifdef IFCVT_EXTRA_FIELDS
 484   IFCVT_EXTRA_FIELDS                    /* Any machine dependent fields.  */
 485 #endif
 486
 487 } ce_if_block_t;
 488
 489 /* This structure maintains an edge list vector.  */
 490 struct edge_list
 491 {
 492   int num_blocks;
 493   int num_edges;
 494   edge *index_to_edge;
 495 };
 496
 497 /* This is the value which indicates no edge is present.  */
 498 #define EDGE_INDEX_NO_EDGE      -1
 499
 500 /* EDGE_INDEX returns an integer index for an edge, or EDGE_INDEX_NO_EDGE
 501    if there is no edge between the 2 basic blocks.  */
 502 #define EDGE_INDEX(el, pred, succ) (find_edge_index ((el), (pred), (succ)))
 503
 504 /* INDEX_EDGE_PRED_BB and INDEX_EDGE_SUCC_BB return a pointer to the basic
 505    block which is either the pred or succ end of the indexed edge.  */
 506 #define INDEX_EDGE_PRED_BB(el, index)   ((el)->index_to_edge[(index)]->src)
 507 #define INDEX_EDGE_SUCC_BB(el, index)   ((el)->index_to_edge[(index)]->dest)
 508
 509 /* INDEX_EDGE returns a pointer to the edge.  */
 510 #define INDEX_EDGE(el, index)           ((el)->index_to_edge[(index)])
 511
 512 /* Number of edges in the compressed edge list.  */
 513 #define NUM_EDGES(el)                   ((el)->num_edges)
 514
 515 /* BB is assumed to contain conditional jump.  Return the fallthru edge.  */
 516 #define FALLTHRU_EDGE(bb)               (EDGE_SUCC ((bb), 0)->flags & EDGE_FALLTHRU \
 517                                          ? EDGE_SUCC ((bb), 0) : EDGE_SUCC ((bb), 1))
 518
 519 /* BB is assumed to contain conditional jump.  Return the branch edge.  */
 520 #define BRANCH_EDGE(bb)                 (EDGE_SUCC ((bb), 0)->flags & EDGE_FALLTHRU \
 521                                          ? EDGE_SUCC ((bb), 1) : EDGE_SUCC ((bb), 0))
 522
 523 /* Return expected execution frequency of the edge E.  */
 524 #define EDGE_FREQUENCY(e)               (((e)->src->frequency \
 525                                           * (e)->probability \
 526                                           + REG_BR_PROB_BASE / 2) \
 527                                          / REG_BR_PROB_BASE)
 528
 529 /* Return nonzero if edge is critical.  */
 530 #define EDGE_CRITICAL_P(e)              (EDGE_COUNT ((e)->src->succs) >= 2 \
 531                                          && EDGE_COUNT ((e)->dest->preds) >= 2)
 532
 533 #if defined ENABLE_CHECKING
 534 #define ENABLE_VEC_CHECKING 1
 535 #else
 536 #define ENABLE_VEC_CHECKING 0
 537 #endif
 538
 539 #define EDGE_COUNT(ev)                  VEC_length (edge, (ev))
 540 #define EDGE_I(ev,i)                    VEC_index  (edge, (ev), (i))
 541 #define EDGE_PRED(bb,i)                 VEC_index  (edge, (bb)->preds, (i))
 542 #define EDGE_SUCC(bb,i)                 VEC_index  (edge, (bb)->succs, (i))
 543
 544 /* Iterator object for edges.  */
 545
 546 typedef struct {
 547   unsigned index;
 548   VEC(edge) *container;
 549 } edge_iterator;
 550
 551 static inline edge_iterator
 552 ei_start (VEC(edge) *ev)
 553 {
 554   edge_iterator i;
 555
 556   i.index = 0;
 557   i.container = ev;
 558
 559   return i;
 560 }
 561
 562 static inline edge_iterator
 563 ei_last (VEC(edge) *ev)
 564 {
 565   edge_iterator i;
 566
 567   i.index = EDGE_COUNT (ev) - 1;
 568   i.container = ev;
 569
 570   return i;
 571 }
 572
 573 static inline bool
 574 ei_end_p (edge_iterator i)
 575 {
 576   return (i.index == EDGE_COUNT (i.container));
 577 }
 578
 579 static inline bool
 580 ei_one_before_end_p (edge_iterator i)
 581 {
 582   return (i.index + 1 == EDGE_COUNT (i.container));
 583 }
 584
 585 static inline void
 586 ei_next (edge_iterator *i)
 587 {
 588   gcc_assert (i->index < EDGE_COUNT (i->container));
 589   i->index++;
 590 }
 591
 592 static inline void
 593 ei_prev (edge_iterator *i)
 594 {
 595   gcc_assert (i->index > 0);
 596   i->index--;
 597 }
 598
 599 static inline edge
 600 ei_edge (edge_iterator i)
 601 {
 602   return EDGE_I (i.container, i.index);
 603 }
 604
 605 static inline edge
 606 ei_safe_edge (edge_iterator i)
 607 {
 608   return !ei_end_p (i) ? ei_edge (i) : NULL;
 609 }
 610
 611 #define FOR_EACH_EDGE(EDGE,ITER,EDGE_VEC) \
 612   for ((EDGE) = NULL, (ITER) = ei_start ((EDGE_VEC)); \
 613        ((EDGE) = ei_safe_edge ((ITER))); \
 614        ei_next (&(ITER)))
 615
 616 struct edge_list * create_edge_list (void);
 617 void free_edge_list (struct edge_list *);
 618 void print_edge_list (FILE *, struct edge_list *);
 619 void verify_edge_list (FILE *, struct edge_list *);
 620 int find_edge_index (struct edge_list *, basic_block, basic_block);
 621 edge find_edge (basic_block, basic_block);
 622
 623
 624 enum update_life_extent
 625 {
 626   UPDATE_LIFE_LOCAL = 0,
 627   UPDATE_LIFE_GLOBAL = 1,
 628   UPDATE_LIFE_GLOBAL_RM_NOTES = 2
 629 };
 630
 631 /* Flags for life_analysis and update_life_info.  */
 632
 633 #define PROP_DEATH_NOTES        1       /* Create DEAD and UNUSED notes.  */
 634 #define PROP_LOG_LINKS          2       /* Create LOG_LINKS.  */
 635 #define PROP_REG_INFO           4       /* Update regs_ever_live et al.  */
 636 #define PROP_KILL_DEAD_CODE     8       /* Remove dead code.  */
 637 #define PROP_SCAN_DEAD_CODE     16      /* Scan for dead code.  */
 638 #define PROP_ALLOW_CFG_CHANGES  32      /* Allow the CFG to be changed
 639                                            by dead code removal.  */
 640 #define PROP_AUTOINC            64      /* Create autoinc mem references.  */
 641 #define PROP_EQUAL_NOTES        128     /* Take into account REG_EQUAL notes.  */
 642 #define PROP_SCAN_DEAD_STORES   256     /* Scan for dead code.  */
 643 #define PROP_ASM_SCAN           512     /* Internal flag used within flow.c
 644                                            to flag analysis of asms.  */
 645 #define PROP_FINAL              (PROP_DEATH_NOTES | PROP_LOG_LINKS  \
 646                                  | PROP_REG_INFO | PROP_KILL_DEAD_CODE  \
 647                                  | PROP_SCAN_DEAD_CODE | PROP_AUTOINC \
 648                                  | PROP_ALLOW_CFG_CHANGES \
 649                                  | PROP_SCAN_DEAD_STORES)
 650 #define PROP_POSTRELOAD         (PROP_DEATH_NOTES  \
 651                                  | PROP_KILL_DEAD_CODE  \
 652                                  | PROP_SCAN_DEAD_CODE | PROP_AUTOINC \
 653                                  | PROP_SCAN_DEAD_STORES)
 654
 655 #define CLEANUP_EXPENSIVE       1       /* Do relatively expensive optimizations
 656                                            except for edge forwarding */
 657 #define CLEANUP_CROSSJUMP       2       /* Do crossjumping.  */
 658 #define CLEANUP_POST_REGSTACK   4       /* We run after reg-stack and need
 659                                            to care REG_DEAD notes.  */
 660 #define CLEANUP_PRE_LOOP        8       /* Take care to preserve syntactic loop
 661                                            notes.  */
 662 #define CLEANUP_UPDATE_LIFE     16      /* Keep life information up to date.  */
 663 #define CLEANUP_THREADING       32      /* Do jump threading.  */
 664 #define CLEANUP_NO_INSN_DEL     64      /* Do not try to delete trivially dead
 665                                            insns.  */
 666 #define CLEANUP_CFGLAYOUT       128     /* Do cleanup in cfglayout mode.  */
 667 #define CLEANUP_LOG_LINKS       256     /* Update log links.  */
 668
 669 extern void life_analysis (FILE *, int);
 670 extern int update_life_info (sbitmap, enum update_life_extent, int);
 671 extern int update_life_info_in_dirty_blocks (enum update_life_extent, int);
 672 extern int count_or_remove_death_notes (sbitmap, int);
 673 extern int propagate_block (basic_block, regset, regset, regset, int);
 674
 675 struct propagate_block_info;
 676 extern rtx propagate_one_insn (struct propagate_block_info *, rtx);
 677 extern struct propagate_block_info *init_propagate_block_info
 678  (basic_block, regset, regset, regset, int);
 679 extern void free_propagate_block_info (struct propagate_block_info *);
 680
 681 /* In lcm.c */
 682 extern struct edge_list *pre_edge_lcm (FILE *, int, sbitmap *, sbitmap *,
 683                                        sbitmap *, sbitmap *, sbitmap **,
 684                                        sbitmap **);
 685 extern struct edge_list *pre_edge_rev_lcm (FILE *, int, sbitmap *,
 686                                            sbitmap *, sbitmap *,
 687                                            sbitmap *, sbitmap **,
 688                                            sbitmap **);
 689 extern void compute_available (sbitmap *, sbitmap *, sbitmap *, sbitmap *);
 690 extern int optimize_mode_switching (FILE *);
 691
 692 /* In emit-rtl.c.  */
 693 extern rtx emit_block_insn_after (rtx, rtx, basic_block);
 694 extern rtx emit_block_insn_before (rtx, rtx, basic_block);
 695
 696 /* In predict.c */
 697 extern void estimate_probability (struct loops *);
 698 extern void expected_value_to_br_prob (void);
 699 extern bool maybe_hot_bb_p (basic_block);
 700 extern bool probably_cold_bb_p (basic_block);
 701 extern bool probably_never_executed_bb_p (basic_block);
 702 extern bool tree_predicted_by_p (basic_block, enum br_predictor);
 703 extern bool rtl_predicted_by_p (basic_block, enum br_predictor);
 704 extern void tree_predict_edge (edge, enum br_predictor, int);
 705 extern void rtl_predict_edge (edge, enum br_predictor, int);
 706 extern void predict_edge_def (edge, enum br_predictor, enum prediction);
 707 extern void guess_outgoing_edge_probabilities (basic_block);
 708
 709 /* In flow.c */
 710 extern void init_flow (void);
 711 extern void debug_bb (basic_block);
 712 extern basic_block debug_bb_n (int);
 713 extern void dump_regset (regset, FILE *);
 714 extern void debug_regset (regset);
 715 extern void allocate_reg_life_data (void);
 716 extern void allocate_bb_life_data (void);
 717 extern void expunge_block (basic_block);
 718 extern void link_block (basic_block, basic_block);
 719 extern void unlink_block (basic_block);
 720 extern void compact_blocks (void);
 721 extern basic_block alloc_block (void);
 722 extern void find_unreachable_blocks (void);
 723 extern int delete_noop_moves (void);
 724 extern basic_block force_nonfallthru (edge);
 725 extern rtx block_label (basic_block);
 726 extern bool forwarder_block_p (basic_block);
 727 extern bool purge_all_dead_edges (int);
 728 extern bool purge_dead_edges (basic_block);
 729 extern void find_sub_basic_blocks (basic_block);
 730 extern void find_many_sub_basic_blocks (sbitmap);
 731 extern void rtl_make_eh_edge (sbitmap *, basic_block, rtx);
 732 extern bool can_fallthru (basic_block, basic_block);
 733 extern bool could_fall_through (basic_block, basic_block);
 734 extern void flow_nodes_print (const char *, const sbitmap, FILE *);
 735 extern void flow_edge_list_print (const char *, const edge *, int, FILE *);
 736 extern void alloc_aux_for_block (basic_block, int);
 737 extern void alloc_aux_for_blocks (int);
 738 extern void clear_aux_for_blocks (void);
 739 extern void free_aux_for_blocks (void);
 740 extern void alloc_aux_for_edge (edge, int);
 741 extern void alloc_aux_for_edges (int);
 742 extern void clear_aux_for_edges (void);
 743 extern void free_aux_for_edges (void);
 744 extern void find_basic_blocks (rtx, int, FILE *);
 745 extern bool cleanup_cfg (int);
 746 extern bool delete_unreachable_blocks (void);
 747 extern bool merge_seq_blocks (void);
 748
 749 typedef struct conflict_graph_def *conflict_graph;
 750
 751 /* Callback function when enumerating conflicts.  The arguments are
 752    the smaller and larger regno in the conflict.  Returns zero if
 753    enumeration is to continue, nonzero to halt enumeration.  */
 754 typedef int (*conflict_graph_enum_fn) (int, int, void *);
 755
 756
 757 /* Prototypes of operations on conflict graphs.  */
 758
 759 extern conflict_graph conflict_graph_new
 760  (int);
 761 extern void conflict_graph_delete (conflict_graph);
 762 extern int conflict_graph_add (conflict_graph, int, int);
 763 extern int conflict_graph_conflict_p (conflict_graph, int, int);
 764 extern void conflict_graph_enum (conflict_graph, int, conflict_graph_enum_fn,
 765                                  void *);
 766 extern void conflict_graph_merge_regs (conflict_graph, int, int);
 767 extern void conflict_graph_print (conflict_graph, FILE*);
 768 extern conflict_graph conflict_graph_compute (regset, partition);
 769 extern bool mark_dfs_back_edges (void);
 770 extern void set_edge_can_fallthru_flag (void);
 771 extern void update_br_prob_note (basic_block);
 772 extern void fixup_abnormal_edges (void);
 773 extern bool can_hoist_insn_p (rtx, rtx, regset);
 774 extern rtx hoist_insn_after (rtx, rtx, rtx, rtx);
 775 extern rtx hoist_insn_to_edge (rtx, edge, rtx, rtx);
 776 extern bool inside_basic_block_p (rtx);
 777 extern bool control_flow_insn_p (rtx);
 778
 779 /* In bb-reorder.c */
 780 extern void reorder_basic_blocks (unsigned int);
 781 extern void partition_hot_cold_basic_blocks (void);
 782
 783 /* In cfg.c */
 784 extern void alloc_rbi_pool (void);
 785 extern void initialize_bb_rbi (basic_block bb);
 786 extern void free_rbi_pool (void);
 787
 788 /* In dominance.c */
 789
 790 enum cdi_direction
 791 {
 792   CDI_DOMINATORS,
 793   CDI_POST_DOMINATORS
 794 };
 795
 796 enum dom_state
 797 {
 798   DOM_NONE,             /* Not computed at all.  */
 799   DOM_CONS_OK,          /* The data is conservatively OK, i.e. if it says you that A dominates B,
 800                            it indeed does.  */
 801   DOM_NO_FAST_QUERY,    /* The data is OK, but the fast query data are not usable.  */
 802   DOM_OK                /* Everything is ok.  */
 803 };
 804
 805 extern enum dom_state dom_computed[2];
 806
 807 extern void calculate_dominance_info (enum cdi_direction);
 808 extern void free_dominance_info (enum cdi_direction);
 809 extern basic_block nearest_common_dominator (enum cdi_direction,
 810                                              basic_block, basic_block);
 811 extern void set_immediate_dominator (enum cdi_direction, basic_block,
 812                                      basic_block);
 813 extern basic_block get_immediate_dominator (enum cdi_direction, basic_block);
 814 extern bool dominated_by_p (enum cdi_direction, basic_block, basic_block);
 815 extern int get_dominated_by (enum cdi_direction, basic_block, basic_block **);
 816 extern void add_to_dominance_info (enum cdi_direction, basic_block);
 817 extern void delete_from_dominance_info (enum cdi_direction, basic_block);
 818 basic_block recount_dominator (enum cdi_direction, basic_block);
 819 extern void redirect_immediate_dominators (enum cdi_direction, basic_block,
 820                                            basic_block);
 821 extern void iterate_fix_dominators (enum cdi_direction, basic_block *, int);
 822 extern void verify_dominators (enum cdi_direction);
 823 extern basic_block first_dom_son (enum cdi_direction, basic_block);
 824 extern basic_block next_dom_son (enum cdi_direction, basic_block);
 825 extern edge try_redirect_by_replacing_jump (edge, basic_block, bool);
 826 extern void break_superblocks (void);
 827 extern void check_bb_profile (basic_block, FILE *);
 828
 829 #include "cfghooks.h"
 830
 831 #endif /* GCC_BASIC_BLOCK_H */