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