gcc/basic-block.h

   1 /* Define control and data flow tables, and regsets.
   2    Copyright (C) 1987, 1997, 1998, 1999, 2000, 2001 Free Software Foundation, Inc.
   3
   4 This file is part of GCC.
   5
   6 GCC is free software; you can redistribute it and/or modify it under
   7 the terms of the GNU General Public License as published by the Free
   8 Software Foundation; either version 2, or (at your option) any later
   9 version.
  10
  11 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
  12 WARRANTY; without even the implied warranty of MERCHANTABILITY or
  13 FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
  14 for more details.
  15
  16 You should have received a copy of the GNU General Public License
  17 along with GCC; see the file COPYING.  If not, write to the Free
  18 Software Foundation, 59 Temple Place - Suite 330, Boston, MA
  19 02111-1307, USA.  */
  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
  29 #ifndef TREE_CODE
  30 union tree_node;
  31 #define tree union tree_node *
  32 #endif
  33
  34 /* Head of register set linked list.  */
  35 typedef bitmap_head regset_head;
  36 /* A pointer to a regset_head.  */
  37 typedef bitmap regset;
  38
  39 /* Initialize a new regset.  */
  40 #define INIT_REG_SET(HEAD) bitmap_initialize (HEAD)
  41
  42 /* Clear a register set by freeing up the linked list.  */
  43 #define CLEAR_REG_SET(HEAD) bitmap_clear (HEAD)
  44
  45 /* Copy a register set to another register set.  */
  46 #define COPY_REG_SET(TO, FROM) bitmap_copy (TO, FROM)
  47
  48 /* Compare two register sets.  */
  49 #define REG_SET_EQUAL_P(A, B) bitmap_equal_p (A, B)
  50
  51 /* `and' a register set with a second register set.  */
  52 #define AND_REG_SET(TO, FROM) bitmap_operation (TO, TO, FROM, BITMAP_AND)
  53
  54 /* `and' the complement of a register set with a register set.  */
  55 #define AND_COMPL_REG_SET(TO, FROM) \
  56   bitmap_operation (TO, TO, FROM, BITMAP_AND_COMPL)
  57
  58 /* Inclusive or a register set with a second register set.  */
  59 #define IOR_REG_SET(TO, FROM) bitmap_operation (TO, TO, FROM, BITMAP_IOR)
  60
  61 /* Exclusive or a register set with a second register set.  */
  62 #define XOR_REG_SET(TO, FROM) bitmap_operation (TO, TO, FROM, BITMAP_XOR)
  63
  64 /* Or into TO the register set FROM1 `and'ed with the complement of FROM2.  */
  65 #define IOR_AND_COMPL_REG_SET(TO, FROM1, FROM2) \
  66   bitmap_ior_and_compl (TO, FROM1, FROM2)
  67
  68 /* Clear a single register in a register set.  */
  69 #define CLEAR_REGNO_REG_SET(HEAD, REG) bitmap_clear_bit (HEAD, REG)
  70
  71 /* Set a single register in a register set.  */
  72 #define SET_REGNO_REG_SET(HEAD, REG) bitmap_set_bit (HEAD, REG)
  73
  74 /* Return true if a register is set in a register set.  */
  75 #define REGNO_REG_SET_P(TO, REG) bitmap_bit_p (TO, REG)
  76
  77 /* Copy the hard registers in a register set to the hard register set.  */
  78 extern void reg_set_to_hard_reg_set PARAMS ((HARD_REG_SET *, bitmap));
  79 #define REG_SET_TO_HARD_REG_SET(TO, FROM)                               \
  80 do {                                                                    \
  81   CLEAR_HARD_REG_SET (TO);                                              \
  82   reg_set_to_hard_reg_set (&TO, FROM);                                  \
  83 } while (0)
  84
  85 /* Loop over all registers in REGSET, starting with MIN, setting REGNUM to the
  86    register number and executing CODE for all registers that are set.  */
  87 #define EXECUTE_IF_SET_IN_REG_SET(REGSET, MIN, REGNUM, CODE)            \
  88   EXECUTE_IF_SET_IN_BITMAP (REGSET, MIN, REGNUM, CODE)
  89
  90 /* Loop over all registers in REGSET1 and REGSET2, starting with MIN, setting
  91    REGNUM to the register number and executing CODE for all registers that are
  92    set in the first regset and not set in the second.  */
  93 #define EXECUTE_IF_AND_COMPL_IN_REG_SET(REGSET1, REGSET2, MIN, REGNUM, CODE) \
  94   EXECUTE_IF_AND_COMPL_IN_BITMAP (REGSET1, REGSET2, MIN, REGNUM, CODE)
  95
  96 /* Loop over all registers in REGSET1 and REGSET2, starting with MIN, setting
  97    REGNUM to the register number and executing CODE for all registers that are
  98    set in both regsets.  */
  99 #define EXECUTE_IF_AND_IN_REG_SET(REGSET1, REGSET2, MIN, REGNUM, CODE) \
 100   EXECUTE_IF_AND_IN_BITMAP (REGSET1, REGSET2, MIN, REGNUM, CODE)
 101
 102 /* Allocate a register set with oballoc.  */
 103 #define OBSTACK_ALLOC_REG_SET(OBSTACK) BITMAP_OBSTACK_ALLOC (OBSTACK)
 104
 105 /* Initialize a register set.  Returns the new register set.  */
 106 #define INITIALIZE_REG_SET(HEAD) bitmap_initialize (&HEAD)
 107
 108 /* Do any cleanup needed on a regset when it is no longer used.  */
 109 #define FREE_REG_SET(REGSET) BITMAP_FREE(REGSET)
 110
 111 /* Do any one-time initializations needed for regsets.  */
 112 #define INIT_ONCE_REG_SET() BITMAP_INIT_ONCE ()
 113
 114 /* Grow any tables needed when the number of registers is calculated
 115    or extended.  For the linked list allocation, nothing needs to
 116    be done, other than zero the statistics on the first allocation.  */
 117 #define MAX_REGNO_REG_SET(NUM_REGS, NEW_P, RENUMBER_P)
 118
 119 /* Type we use to hold basic block counters.  Should be at least 64bit.  */
 120 typedef HOST_WIDEST_INT gcov_type;
 121
 122 /* Control flow edge information.  */
 123 typedef struct edge_def {
 124   /* Links through the predecessor and successor lists.  */
 125   struct edge_def *pred_next, *succ_next;
 126
 127   /* The two blocks at the ends of the edge.  */
 128   struct basic_block_def *src, *dest;
 129
 130   /* Instructions queued on the edge.  */
 131   rtx insns;
 132
 133   /* Auxiliary info specific to a pass.  */
 134   void *aux;
 135
 136   int flags;                    /* see EDGE_* below  */
 137   int probability;              /* biased by REG_BR_PROB_BASE */
 138   gcov_type count;              /* Expected number of executions calculated
 139                                    in profile.c  */
 140 } *edge;
 141
 142 #define EDGE_FALLTHRU           1
 143 #define EDGE_ABNORMAL           2
 144 #define EDGE_ABNORMAL_CALL      4
 145 #define EDGE_EH                 8
 146 #define EDGE_FAKE               16
 147 #define EDGE_DFS_BACK           32
 148
 149 #define EDGE_COMPLEX    (EDGE_ABNORMAL | EDGE_ABNORMAL_CALL | EDGE_EH)
 150
 151
 152 /* A basic block is a sequence of instructions with only entry and
 153    only one exit.  If any one of the instructions are executed, they
 154    will all be executed, and in sequence from first to last.
 155
 156    There may be COND_EXEC instructions in the basic block.  The
 157    COND_EXEC *instructions* will be executed -- but if the condition
 158    is false the conditionally executed *expressions* will of course
 159    not be executed.  We don't consider the conditionally executed
 160    expression (which might have side-effects) to be in a separate
 161    basic block because the program counter will always be at the same
 162    location after the COND_EXEC instruction, regardless of whether the
 163    condition is true or not.
 164
 165    Basic blocks need not start with a label nor end with a jump insn.
 166    For example, a previous basic block may just "conditionally fall"
 167    into the succeeding basic block, and the last basic block need not
 168    end with a jump insn.  Block 0 is a descendant of the entry block.
 169
 170    A basic block beginning with two labels cannot have notes between
 171    the labels.
 172
 173    Data for jump tables are stored in jump_insns that occur in no
 174    basic block even though these insns can follow or precede insns in
 175    basic blocks.  */
 176
 177 /* Basic block information indexed by block number.  */
 178 typedef struct basic_block_def {
 179   /* The first and last insns of the block.  */
 180   rtx head, end;
 181
 182   /* The first and last trees of the block.  */
 183   tree head_tree;
 184   tree end_tree;
 185
 186   /* The edges into and out of the block.  */
 187   edge pred, succ;
 188
 189   /* Liveness info.  */
 190
 191   /* The registers that are modified within this in block.  */
 192   regset local_set;
 193   /* The registers that are conditionally modified within this block.
 194      In other words, registers that are set only as part of a
 195      COND_EXEC.  */
 196   regset cond_local_set;
 197   /* The registers that are live on entry to this block.
 198
 199      Note that in SSA form, global_live_at_start does not reflect the
 200      use of regs in phi functions, since the liveness of these regs
 201      may depend on which edge was taken into the block.  */
 202   regset global_live_at_start;
 203   /* The registers that are live on exit from this block.  */
 204   regset global_live_at_end;
 205
 206   /* Auxiliary info specific to a pass.  */
 207   void *aux;
 208
 209   /* The index of this block.  */
 210   int index;
 211
 212   /* The loop depth of this block.  */
 213   int loop_depth;
 214
 215   /* Expected number of executions: calculated in profile.c.  */
 216   gcov_type count;
 217
 218   /* Expected frequency.  Normalized to be in range 0 to BB_FREQ_MAX.  */
 219   int frequency;
 220
 221   /* Various flags.  See BB_* below.  */
 222   int flags;
 223 } *basic_block;
 224
 225 #define BB_FREQ_MAX 10000
 226
 227 /* Masks for basic_block.flags.  */
 228 #define BB_REACHABLE            1
 229
 230 /* Number of basic blocks in the current function.  */
 231
 232 extern int n_basic_blocks;
 233
 234 /* Number of edges in the current function.  */
 235
 236 extern int n_edges;
 237
 238 /* Index by basic block number, get basic block struct info.  */
 239
 240 extern varray_type basic_block_info;
 241
 242 #define BASIC_BLOCK(N)  (VARRAY_BB (basic_block_info, (N)))
 243
 244 /* What registers are live at the setjmp call.  */
 245
 246 extern regset regs_live_at_setjmp;
 247
 248 /* Special labels found during CFG build.  */
 249
 250 extern rtx label_value_list, tail_recursion_label_list;
 251
 252 extern struct obstack flow_obstack;
 253
 254 /* Indexed by n, gives number of basic block that  (REG n) is used in.
 255    If the value is REG_BLOCK_GLOBAL (-2),
 256    it means (REG n) is used in more than one basic block.
 257    REG_BLOCK_UNKNOWN (-1) means it hasn't been seen yet so we don't know.
 258    This information remains valid for the rest of the compilation
 259    of the current function; it is used to control register allocation.  */
 260
 261 #define REG_BLOCK_UNKNOWN -1
 262 #define REG_BLOCK_GLOBAL -2
 263
 264 #define REG_BASIC_BLOCK(N) (VARRAY_REG (reg_n_info, N)->basic_block)
 265 \f
 266 /* Stuff for recording basic block info.  */
 267
 268 #define BLOCK_HEAD(B)      (BASIC_BLOCK (B)->head)
 269 #define BLOCK_END(B)       (BASIC_BLOCK (B)->end)
 270
 271 #define BLOCK_HEAD_TREE(B) (BASIC_BLOCK (B)->head_tree)
 272 #define BLOCK_END_TREE(B) (BASIC_BLOCK (B)->end_tree)
 273
 274 /* Special block numbers [markers] for entry and exit.  */
 275 #define ENTRY_BLOCK (-1)
 276 #define EXIT_BLOCK (-2)
 277
 278 /* Special block number not valid for any block.  */
 279 #define INVALID_BLOCK (-3)
 280
 281 /* Similarly, block pointers for the edge list.  */
 282 extern struct basic_block_def entry_exit_blocks[2];
 283 #define ENTRY_BLOCK_PTR (&entry_exit_blocks[0])
 284 #define EXIT_BLOCK_PTR  (&entry_exit_blocks[1])
 285
 286 extern varray_type basic_block_for_insn;
 287 #define BLOCK_FOR_INSN(INSN)  VARRAY_BB (basic_block_for_insn, INSN_UID (INSN))
 288 #define BLOCK_NUM(INSN)       (BLOCK_FOR_INSN (INSN)->index + 0)
 289
 290 extern void compute_bb_for_insn         PARAMS ((int));
 291 extern void free_bb_for_insn            PARAMS ((void));
 292 extern void update_bb_for_insn          PARAMS ((basic_block));
 293 extern void set_block_for_insn          PARAMS ((rtx, basic_block));
 294
 295 extern void free_basic_block_vars       PARAMS ((int));
 296
 297 extern edge split_block                 PARAMS ((basic_block, rtx));
 298 extern basic_block split_edge           PARAMS ((edge));
 299 extern void insert_insn_on_edge         PARAMS ((rtx, edge));
 300 extern void commit_edge_insertions      PARAMS ((void));
 301 extern void remove_fake_edges           PARAMS ((void));
 302 extern void add_noreturn_fake_exit_edges        PARAMS ((void));
 303 extern void connect_infinite_loops_to_exit      PARAMS ((void));
 304 extern int flow_call_edges_add          PARAMS ((sbitmap));
 305 extern edge cached_make_edge            PARAMS ((sbitmap *, basic_block,
 306                                                  basic_block, int));
 307 extern edge make_edge                   PARAMS ((basic_block,
 308                                                  basic_block, int));
 309 extern edge make_single_succ_edge       PARAMS ((basic_block,
 310                                                  basic_block, int));
 311 extern void remove_edge                 PARAMS ((edge));
 312 extern void redirect_edge_succ          PARAMS ((edge, basic_block));
 313 extern edge redirect_edge_succ_nodup    PARAMS ((edge, basic_block));
 314 extern void redirect_edge_pred          PARAMS ((edge, basic_block));
 315 extern basic_block create_basic_block_structure PARAMS ((int, rtx, rtx, rtx));
 316 extern basic_block create_basic_block   PARAMS ((int, rtx, rtx));
 317 extern int flow_delete_block            PARAMS ((basic_block));
 318 extern void merge_blocks_nomove         PARAMS ((basic_block, basic_block));
 319 extern void tidy_fallthru_edge          PARAMS ((edge, basic_block,
 320                                                  basic_block));
 321 extern void tidy_fallthru_edges         PARAMS ((void));
 322 extern void flow_reverse_top_sort_order_compute PARAMS ((int *));
 323 extern int flow_depth_first_order_compute       PARAMS ((int *, int *));
 324 extern void dump_edge_info              PARAMS ((FILE *, edge, int));
 325 extern void clear_edges                 PARAMS ((void));
 326 extern void mark_critical_edges         PARAMS ((void));
 327 extern rtx first_insn_after_basic_block_note    PARAMS ((basic_block));
 328
 329 /* Structure to hold information for each natural loop.  */
 330 struct loop
 331 {
 332   /* Index into loops array.  */
 333   int num;
 334
 335   /* Basic block of loop header.  */
 336   basic_block header;
 337
 338   /* Basic block of loop latch.  */
 339   basic_block latch;
 340
 341   /* Basic block of loop pre-header or NULL if it does not exist.  */
 342   basic_block pre_header;
 343
 344   /* Array of edges along the pre-header extended basic block trace.
 345      The source of the first edge is the root node of pre-header
 346      extended basic block, if it exists.  */
 347   edge *pre_header_edges;
 348
 349   /* Number of edges along the pre_header extended basic block trace.  */
 350   int num_pre_header_edges;
 351
 352   /* The first block in the loop.  This is not necessarily the same as
 353      the loop header.  */
 354   basic_block first;
 355
 356   /* The last block in the loop.  This is not necessarily the same as
 357      the loop latch.  */
 358   basic_block last;
 359
 360   /* Bitmap of blocks contained within the loop.  */
 361   sbitmap nodes;
 362
 363   /* Number of blocks contained within the loop.  */
 364   int num_nodes;
 365
 366   /* Array of edges that enter the loop.  */
 367   edge *entry_edges;
 368
 369   /* Number of edges that enter the loop.  */
 370   int num_entries;
 371
 372   /* Array of edges that exit the loop.  */
 373   edge *exit_edges;
 374
 375   /* Number of edges that exit the loop.  */
 376   int num_exits;
 377
 378   /* Bitmap of blocks that dominate all exits of the loop.  */
 379   sbitmap exits_doms;
 380
 381   /* The loop nesting depth.  */
 382   int depth;
 383
 384   /* The height of the loop (enclosed loop levels) within the loop
 385      hierarchy tree.  */
 386   int level;
 387
 388   /* The outer (parent) loop or NULL if outermost loop.  */
 389   struct loop *outer;
 390
 391   /* The first inner (child) loop or NULL if innermost loop.  */
 392   struct loop *inner;
 393
 394   /* Link to the next (sibling) loop.  */
 395   struct loop *next;
 396
 397   /* Non-zero if the loop shares a header with another loop.  */
 398   int shared;
 399
 400   /* Non-zero if the loop is invalid (e.g., contains setjmp.).  */
 401   int invalid;
 402
 403   /* Auxiliary info specific to a pass.  */
 404   void *aux;
 405
 406   /* The following are currently used by loop.c but they are likely to
 407      disappear as loop.c is converted to use the CFG.  */
 408
 409   /* Non-zero if the loop has a NOTE_INSN_LOOP_VTOP.  */
 410   rtx vtop;
 411
 412   /* Non-zero if the loop has a NOTE_INSN_LOOP_CONT.
 413      A continue statement will generate a branch to NEXT_INSN (cont).  */
 414   rtx cont;
 415
 416   /* The dominator of cont.  */
 417   rtx cont_dominator;
 418
 419   /* The NOTE_INSN_LOOP_BEG.  */
 420   rtx start;
 421
 422   /* The NOTE_INSN_LOOP_END.  */
 423   rtx end;
 424
 425   /* For a rotated loop that is entered near the bottom,
 426      this is the label at the top.  Otherwise it is zero.  */
 427   rtx top;
 428
 429   /* Place in the loop where control enters.  */
 430   rtx scan_start;
 431
 432   /* The position where to sink insns out of the loop.  */
 433   rtx sink;
 434
 435   /* List of all LABEL_REFs which refer to code labels outside the
 436      loop.  Used by routines that need to know all loop exits, such as
 437      final_biv_value and final_giv_value.
 438
 439      This does not include loop exits due to return instructions.
 440      This is because all bivs and givs are pseudos, and hence must be
 441      dead after a return, so the presense of a return does not affect
 442      any of the optimizations that use this info.  It is simpler to
 443      just not include return instructions on this list.  */
 444   rtx exit_labels;
 445
 446   /* The number of LABEL_REFs on exit_labels for this loop and all
 447      loops nested inside it.  */
 448   int exit_count;
 449 };
 450
 451
 452 /* Structure to hold CFG information about natural loops within a function.  */
 453 struct loops
 454 {
 455   /* Number of natural loops in the function.  */
 456   int num;
 457
 458   /* Maxium nested loop level in the function.  */
 459   int levels;
 460
 461   /* Array of natural loop descriptors (scanning this array in reverse order
 462      will find the inner loops before their enclosing outer loops).  */
 463   struct loop *array;
 464
 465   /* Pointer to root of loop heirachy tree.  */
 466   struct loop *tree_root;
 467
 468   /* Information derived from the CFG.  */
 469   struct cfg
 470   {
 471     /* The bitmap vector of dominators or NULL if not computed.  */
 472     sbitmap *dom;
 473
 474     /* The ordering of the basic blocks in a depth first search.  */
 475     int *dfs_order;
 476
 477     /* The reverse completion ordering of the basic blocks found in a
 478        depth first search.  */
 479     int *rc_order;
 480   } cfg;
 481
 482   /* Headers shared by multiple loops that should be merged.  */
 483   sbitmap shared_headers;
 484 };
 485
 486 extern int flow_loops_find PARAMS ((struct loops *, int flags));
 487 extern int flow_loops_update PARAMS ((struct loops *, int flags));
 488 extern void flow_loops_free PARAMS ((struct loops *));
 489 extern void flow_loops_dump PARAMS ((const struct loops *, FILE *,
 490                                      void (*)(const struct loop *,
 491                                               FILE *, int), int));
 492 extern void flow_loop_dump PARAMS ((const struct loop *, FILE *,
 493                                     void (*)(const struct loop *,
 494                                              FILE *, int), int));
 495 extern int flow_loop_scan PARAMS ((struct loops *, struct loop *, int));
 496
 497 /* This structure maintains an edge list vector.  */
 498 struct edge_list
 499 {
 500   int num_blocks;
 501   int num_edges;
 502   edge *index_to_edge;
 503 };
 504
 505 /* This is the value which indicates no edge is present.  */
 506 #define EDGE_INDEX_NO_EDGE      -1
 507
 508 /* EDGE_INDEX returns an integer index for an edge, or EDGE_INDEX_NO_EDGE
 509    if there is no edge between the 2 basic blocks.  */
 510 #define EDGE_INDEX(el, pred, succ) (find_edge_index ((el), (pred), (succ)))
 511
 512 /* INDEX_EDGE_PRED_BB and INDEX_EDGE_SUCC_BB return a pointer to the basic
 513    block which is either the pred or succ end of the indexed edge.  */
 514 #define INDEX_EDGE_PRED_BB(el, index)   ((el)->index_to_edge[(index)]->src)
 515 #define INDEX_EDGE_SUCC_BB(el, index)   ((el)->index_to_edge[(index)]->dest)
 516
 517 /* INDEX_EDGE returns a pointer to the edge.  */
 518 #define INDEX_EDGE(el, index)           ((el)->index_to_edge[(index)])
 519
 520 /* Number of edges in the compressed edge list.  */
 521 #define NUM_EDGES(el)                   ((el)->num_edges)
 522
 523 /* BB is assumed to contain conditional jump.  Return the fallthru edge.  */
 524 #define FALLTHRU_EDGE(bb)               ((bb)->succ->flags & EDGE_FALLTHRU \
 525                                          ? (bb)->succ : (bb)->succ->succ_next)
 526
 527 /* BB is assumed to contain conditional jump.  Return the branch edge.  */
 528 #define BRANCH_EDGE(bb)                 ((bb)->succ->flags & EDGE_FALLTHRU \
 529                                          ? (bb)->succ->succ_next : (bb)->succ)
 530
 531 /* Return expected execution frequency of the edge E.  */
 532 #define EDGE_FREQUENCY(e)               (((e)->src->frequency \
 533                                           * (e)->probability \
 534                                           + REG_BR_PROB_BASE / 2) \
 535                                          / REG_BR_PROB_BASE)
 536
 537 /* Return nonzero if edge is critical.  */
 538 #define EDGE_CRITICAL_P(e)              ((e)->src->succ->succ_next \
 539                                          && (e)->dest->pred->pred_next)
 540
 541 struct edge_list * create_edge_list     PARAMS ((void));
 542 void free_edge_list                     PARAMS ((struct edge_list *));
 543 void print_edge_list                    PARAMS ((FILE *, struct edge_list *));
 544 void verify_edge_list                   PARAMS ((FILE *, struct edge_list *));
 545 int find_edge_index                     PARAMS ((struct edge_list *,
 546                                                  basic_block, basic_block));
 547
 548
 549 enum update_life_extent
 550 {
 551   UPDATE_LIFE_LOCAL = 0,
 552   UPDATE_LIFE_GLOBAL = 1,
 553   UPDATE_LIFE_GLOBAL_RM_NOTES = 2
 554 };
 555
 556 /* Flags for life_analysis and update_life_info.  */
 557
 558 #define PROP_DEATH_NOTES        1       /* Create DEAD and UNUSED notes.  */
 559 #define PROP_LOG_LINKS          2       /* Create LOG_LINKS.  */
 560 #define PROP_REG_INFO           4       /* Update regs_ever_live et al.  */
 561 #define PROP_KILL_DEAD_CODE     8       /* Remove dead code.  */
 562 #define PROP_SCAN_DEAD_CODE     16      /* Scan for dead code.  */
 563 #define PROP_ALLOW_CFG_CHANGES  32      /* Allow the CFG to be changed
 564                                            by dead code removal.  */
 565 #define PROP_AUTOINC            64      /* Create autoinc mem references.  */
 566 #define PROP_FINAL              127     /* All of the above.  */
 567
 568 #define CLEANUP_EXPENSIVE       1       /* Do relativly expensive optimizations
 569                                            except for edge forwarding */
 570 #define CLEANUP_CROSSJUMP       2       /* Do crossjumping.  */
 571 #define CLEANUP_POST_REGSTACK   4       /* We run after reg-stack and need
 572                                            to care REG_DEAD notes.  */
 573 #define CLEANUP_PRE_SIBCALL     8       /* Do not get confused by code hidden
 574                                            inside call_placeholders..  */
 575 #define CLEANUP_PRE_LOOP        16      /* Take care to preserve syntactic loop
 576                                            notes.  */
 577 /* Flags for loop discovery.  */
 578
 579 #define LOOP_TREE               1       /* Build loop hierarchy tree.  */
 580 #define LOOP_PRE_HEADER         2       /* Analyse loop pre-header.  */
 581 #define LOOP_ENTRY_EDGES        4       /* Find entry edges.  */
 582 #define LOOP_EXIT_EDGES         8       /* Find exit edges.  */
 583 #define LOOP_EDGES              (LOOP_ENTRY_EDGES | LOOP_EXIT_EDGES)
 584 #define LOOP_EXITS_DOMS        16       /* Find nodes that dom. all exits.  */
 585 #define LOOP_ALL               31       /* All of the above  */
 586
 587 extern void life_analysis       PARAMS ((rtx, FILE *, int));
 588 extern void update_life_info    PARAMS ((sbitmap, enum update_life_extent,
 589                                          int));
 590 extern int count_or_remove_death_notes  PARAMS ((sbitmap, int));
 591 extern int propagate_block      PARAMS ((basic_block, regset, regset, regset,
 592                                          int));
 593
 594 struct propagate_block_info;
 595 extern rtx propagate_one_insn   PARAMS ((struct propagate_block_info *, rtx));
 596 extern struct propagate_block_info *init_propagate_block_info
 597   PARAMS ((basic_block, regset, regset, regset, int));
 598 extern void free_propagate_block_info PARAMS ((struct propagate_block_info *));
 599
 600 /* In lcm.c */
 601 extern struct edge_list *pre_edge_lcm   PARAMS ((FILE *, int, sbitmap *,
 602                                                  sbitmap *, sbitmap *,
 603                                                  sbitmap *, sbitmap **,
 604                                                  sbitmap **));
 605 extern struct edge_list *pre_edge_rev_lcm PARAMS ((FILE *, int, sbitmap *,
 606                                                    sbitmap *, sbitmap *,
 607                                                    sbitmap *, sbitmap **,
 608                                                    sbitmap **));
 609 extern void compute_available           PARAMS ((sbitmap *, sbitmap *,
 610                                                  sbitmap *, sbitmap *));
 611 extern int optimize_mode_switching      PARAMS ((FILE *));
 612
 613 /* In emit-rtl.c.  */
 614 extern rtx emit_block_insn_after        PARAMS ((rtx, rtx, basic_block));
 615 extern rtx emit_block_insn_before       PARAMS ((rtx, rtx, basic_block));
 616
 617 /* In predict.c */
 618 extern void estimate_probability        PARAMS ((struct loops *));
 619 extern void expected_value_to_br_prob   PARAMS ((void));
 620
 621 /* In flow.c */
 622 extern void init_flow                   PARAMS ((void));
 623 extern void reorder_basic_blocks        PARAMS ((void));
 624 extern void dump_bb                     PARAMS ((basic_block, FILE *));
 625 extern void debug_bb                    PARAMS ((basic_block));
 626 extern void debug_bb_n                  PARAMS ((int));
 627 extern void dump_regset                 PARAMS ((regset, FILE *));
 628 extern void debug_regset                PARAMS ((regset));
 629 extern void allocate_reg_life_data      PARAMS ((void));
 630 extern void allocate_bb_life_data       PARAMS ((void));
 631 extern void expunge_block               PARAMS ((basic_block));
 632 extern basic_block alloc_block          PARAMS ((void));
 633 extern void find_unreachable_blocks     PARAMS ((void));
 634 extern void delete_noop_moves           PARAMS ((rtx));
 635 extern basic_block redirect_edge_and_branch_force PARAMS ((edge, basic_block));
 636 extern basic_block force_nonfallthru    PARAMS ((edge));
 637 extern bool redirect_edge_and_branch    PARAMS ((edge, basic_block));
 638 extern rtx block_label                  PARAMS ((basic_block));
 639 extern bool forwarder_block_p           PARAMS ((basic_block));
 640 extern bool purge_all_dead_edges        PARAMS ((void));
 641 extern bool purge_dead_edges            PARAMS ((basic_block));
 642 extern void find_sub_basic_blocks       PARAMS ((basic_block));
 643 extern bool can_fallthru                PARAMS ((basic_block, basic_block));
 644 extern void flow_nodes_print            PARAMS ((const char *, const sbitmap,
 645                                                  FILE *));
 646 extern void flow_edge_list_print        PARAMS ((const char *, const edge *,
 647                                                  int, FILE *));
 648 extern void alloc_aux_for_block         PARAMS ((basic_block, int));
 649 extern void alloc_aux_for_blocks        PARAMS ((int));
 650 extern void free_aux_for_blocks         PARAMS ((void));
 651 extern void alloc_aux_for_edge          PARAMS ((edge, int));
 652 extern void alloc_aux_for_edges         PARAMS ((int));
 653 extern void free_aux_for_edges          PARAMS ((void));
 654
 655 /* This function is always defined so it can be called from the
 656    debugger, and it is declared extern so we don't get warnings about
 657    it being unused.  */
 658 extern void verify_flow_info            PARAMS ((void));
 659 extern int flow_loop_outside_edge_p     PARAMS ((const struct loop *, edge));
 660
 661 typedef struct conflict_graph_def *conflict_graph;
 662
 663 /* Callback function when enumerating conflicts.  The arguments are
 664    the smaller and larger regno in the conflict.  Returns zero if
 665    enumeration is to continue, non-zero to halt enumeration.  */
 666 typedef int (*conflict_graph_enum_fn) PARAMS ((int, int, void *));
 667
 668
 669 /* Prototypes of operations on conflict graphs.  */
 670
 671 extern conflict_graph conflict_graph_new
 672                                         PARAMS ((int));
 673 extern void conflict_graph_delete       PARAMS ((conflict_graph));
 674 extern int conflict_graph_add           PARAMS ((conflict_graph,
 675                                                  int, int));
 676 extern int conflict_graph_conflict_p    PARAMS ((conflict_graph,
 677                                                  int, int));
 678 extern void conflict_graph_enum         PARAMS ((conflict_graph, int,
 679                                                  conflict_graph_enum_fn,
 680                                                  void *));
 681 extern void conflict_graph_merge_regs   PARAMS ((conflict_graph, int,
 682                                                  int));
 683 extern void conflict_graph_print        PARAMS ((conflict_graph, FILE*));
 684 extern conflict_graph conflict_graph_compute
 685                                         PARAMS ((regset,
 686                                                  partition));
 687 extern bool mark_dfs_back_edges         PARAMS ((void));
 688
 689 /* In dominance.c */
 690
 691 enum cdi_direction
 692 {
 693   CDI_DOMINATORS,
 694   CDI_POST_DOMINATORS
 695 };
 696
 697 extern void calculate_dominance_info    PARAMS ((int *, sbitmap *,
 698                                                  enum cdi_direction));
 699
 700 #endif /* GCC_BASIC_BLOCK_H */