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