1 /* Define control and data flow tables, and regsets.
2 Copyright (C) 1987, 1997, 1998, 1999, 2000, 2001, 2002, 2003
3 Free Software Foundation, Inc.
5 This file is part of GCC.
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
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
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
22 #ifndef GCC_BASIC_BLOCK_H
23 #define GCC_BASIC_BLOCK_H
28 #include "partition.h"
29 #include "hard-reg-set.h"
31 /* Head of register set linked list. */
32 typedef bitmap_head regset_head
;
33 /* A pointer to a regset_head. */
34 typedef bitmap regset
;
36 /* Initialize a new regset. */
37 #define INIT_REG_SET(HEAD) bitmap_initialize (HEAD, 1)
39 /* Clear a register set by freeing up the linked list. */
40 #define CLEAR_REG_SET(HEAD) bitmap_clear (HEAD)
42 /* Copy a register set to another register set. */
43 #define COPY_REG_SET(TO, FROM) bitmap_copy (TO, FROM)
45 /* Compare two register sets. */
46 #define REG_SET_EQUAL_P(A, B) bitmap_equal_p (A, B)
48 /* `and' a register set with a second register set. */
49 #define AND_REG_SET(TO, FROM) bitmap_operation (TO, TO, FROM, BITMAP_AND)
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)
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)
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)
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)
65 /* Clear a single register in a register set. */
66 #define CLEAR_REGNO_REG_SET(HEAD, REG) bitmap_clear_bit (HEAD, REG)
68 /* Set a single register in a register set. */
69 #define SET_REGNO_REG_SET(HEAD, REG) bitmap_set_bit (HEAD, REG)
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)
74 /* Copy the hard registers in a register set to the hard register set. */
75 extern void reg_set_to_hard_reg_set
PARAMS ((HARD_REG_SET
*, bitmap
));
76 #define REG_SET_TO_HARD_REG_SET(TO, FROM) \
78 CLEAR_HARD_REG_SET (TO); \
79 reg_set_to_hard_reg_set (&TO, FROM); \
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)
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)
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)
99 /* Allocate a register set with oballoc. */
100 #define OBSTACK_ALLOC_REG_SET(OBSTACK) BITMAP_OBSTACK_ALLOC (OBSTACK)
102 /* Initialize a register set. Returns the new register set. */
103 #define INITIALIZE_REG_SET(HEAD) bitmap_initialize (&HEAD, 1)
105 /* Do any cleanup needed on a regset when it is no longer used. */
106 #define FREE_REG_SET(REGSET) BITMAP_FREE(REGSET)
108 /* Do any one-time initializations needed for regsets. */
109 #define INIT_ONCE_REG_SET() BITMAP_INIT_ONCE ()
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)
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
;
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
;
128 /* The two blocks at the ends of the edge. */
129 struct basic_block_def
*src
, *dest
;
131 /* Instructions queued on the edge. */
134 /* Auxiliary info specific to a pass. */
137 int flags
; /* see EDGE_* below */
138 int probability
; /* biased by REG_BR_PROB_BASE */
139 gcov_type count
; /* Expected number of executions calculated
143 #define EDGE_FALLTHRU 1 /* 'Straight line' flow */
144 #define EDGE_ABNORMAL 2 /* Strange flow, like computed
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
153 #define EDGE_IRREDUCIBLE_LOOP 128 /* Part of irreducible loop. */
154 #define EDGE_ALL_FLAGS 255
156 #define EDGE_COMPLEX (EDGE_ABNORMAL | EDGE_ABNORMAL_CALL | EDGE_EH)
158 /* Declared in cfgloop.h. */
162 /* A basic block is a sequence of instructions with only entry and
163 only one exit. If any one of the instructions are executed, they
164 will all be executed, and in sequence from first to last.
166 There may be COND_EXEC instructions in the basic block. The
167 COND_EXEC *instructions* will be executed -- but if the condition
168 is false the conditionally executed *expressions* will of course
169 not be executed. We don't consider the conditionally executed
170 expression (which might have side-effects) to be in a separate
171 basic block because the program counter will always be at the same
172 location after the COND_EXEC instruction, regardless of whether the
173 condition is true or not.
175 Basic blocks need not start with a label nor end with a jump insn.
176 For example, a previous basic block may just "conditionally fall"
177 into the succeeding basic block, and the last basic block need not
178 end with a jump insn. Block 0 is a descendant of the entry block.
180 A basic block beginning with two labels cannot have notes between
183 Data for jump tables are stored in jump_insns that occur in no
184 basic block even though these insns can follow or precede insns in
187 /* Basic block information indexed by block number. */
188 typedef struct basic_block_def
{
189 /* The first and last insns of the block. */
192 /* The first and last trees of the block. */
196 /* The edges into and out of the block. */
201 /* The registers that are modified within this in block. */
203 /* The registers that are conditionally modified within this block.
204 In other words, registers that are set only as part of a
206 regset cond_local_set
;
207 /* The registers that are live on entry to this block.
209 Note that in SSA form, global_live_at_start does not reflect the
210 use of regs in phi functions, since the liveness of these regs
211 may depend on which edge was taken into the block. */
212 regset global_live_at_start
;
213 /* The registers that are live on exit from this block. */
214 regset global_live_at_end
;
216 /* Auxiliary info specific to a pass. */
219 /* The index of this block. */
222 /* Previous and next blocks in the chain. */
223 struct basic_block_def
*prev_bb
, *next_bb
;
225 /* The loop depth of this block. */
228 /* Outermost loop containing the block. */
229 struct loop
*loop_father
;
231 /* Expected number of executions: calculated in profile.c. */
234 /* Expected frequency. Normalized to be in range 0 to BB_FREQ_MAX. */
237 /* Various flags. See BB_* below. */
241 #define BB_FREQ_MAX 10000
243 /* Masks for basic_block.flags. */
246 #define BB_REACHABLE 4
248 #define BB_IRREDUCIBLE_LOOP 16
249 #define BB_SUPERBLOCK 32
251 /* Number of basic blocks in the current function. */
253 extern int n_basic_blocks
;
255 /* First free basic block number. */
257 extern int last_basic_block
;
259 /* Number of edges in the current function. */
263 /* Index by basic block number, get basic block struct info. */
265 extern varray_type basic_block_info
;
267 #define BASIC_BLOCK(N) (VARRAY_BB (basic_block_info, (N)))
269 /* For iterating over basic blocks. */
270 #define FOR_BB_BETWEEN(BB, FROM, TO, DIR) \
271 for (BB = FROM; BB != TO; BB = BB->DIR)
273 #define FOR_EACH_BB(BB) \
274 FOR_BB_BETWEEN (BB, ENTRY_BLOCK_PTR->next_bb, EXIT_BLOCK_PTR, next_bb)
276 #define FOR_EACH_BB_REVERSE(BB) \
277 FOR_BB_BETWEEN (BB, EXIT_BLOCK_PTR->prev_bb, ENTRY_BLOCK_PTR, prev_bb)
279 /* Cycles through _all_ basic blocks, even the fake ones (entry and
282 #define FOR_ALL_BB(BB) \
283 for (BB = ENTRY_BLOCK_PTR; BB; BB = BB->next_bb)
285 /* What registers are live at the setjmp call. */
287 extern regset regs_live_at_setjmp
;
289 /* Special labels found during CFG build. */
291 extern GTY(()) rtx label_value_list
;
292 extern GTY(()) rtx tail_recursion_label_list
;
294 extern struct obstack flow_obstack
;
296 /* Indexed by n, gives number of basic block that (REG n) is used in.
297 If the value is REG_BLOCK_GLOBAL (-2),
298 it means (REG n) is used in more than one basic block.
299 REG_BLOCK_UNKNOWN (-1) means it hasn't been seen yet so we don't know.
300 This information remains valid for the rest of the compilation
301 of the current function; it is used to control register allocation. */
303 #define REG_BLOCK_UNKNOWN -1
304 #define REG_BLOCK_GLOBAL -2
306 #define REG_BASIC_BLOCK(N) (VARRAY_REG (reg_n_info, N)->basic_block)
308 /* Stuff for recording basic block info. */
310 #define BLOCK_HEAD(B) (BASIC_BLOCK (B)->head)
311 #define BLOCK_END(B) (BASIC_BLOCK (B)->end)
313 #define BLOCK_HEAD_TREE(B) (BASIC_BLOCK (B)->head_tree)
314 #define BLOCK_END_TREE(B) (BASIC_BLOCK (B)->end_tree)
316 /* Special block numbers [markers] for entry and exit. */
317 #define ENTRY_BLOCK (-1)
318 #define EXIT_BLOCK (-2)
320 /* Special block number not valid for any block. */
321 #define INVALID_BLOCK (-3)
323 /* Similarly, block pointers for the edge list. */
324 extern struct basic_block_def entry_exit_blocks
[2];
325 #define ENTRY_BLOCK_PTR (&entry_exit_blocks[0])
326 #define EXIT_BLOCK_PTR (&entry_exit_blocks[1])
328 #define BLOCK_NUM(INSN) (BLOCK_FOR_INSN (INSN)->index + 0)
329 #define set_block_for_insn(INSN, BB) (BLOCK_FOR_INSN (INSN) = BB)
331 extern void compute_bb_for_insn
PARAMS ((void));
332 extern void free_bb_for_insn
PARAMS ((void));
333 extern void update_bb_for_insn
PARAMS ((basic_block
));
335 extern void free_basic_block_vars
PARAMS ((int));
337 extern edge split_block
PARAMS ((basic_block
, rtx
));
338 extern basic_block split_edge
PARAMS ((edge
));
339 extern void insert_insn_on_edge
PARAMS ((rtx
, edge
));
341 extern void commit_edge_insertions
PARAMS ((void));
342 extern void commit_edge_insertions_watch_calls
PARAMS ((void));
344 extern void remove_fake_edges
PARAMS ((void));
345 extern void add_noreturn_fake_exit_edges
PARAMS ((void));
346 extern void connect_infinite_loops_to_exit
PARAMS ((void));
347 extern int flow_call_edges_add
PARAMS ((sbitmap
));
348 extern edge unchecked_make_edge
PARAMS ((basic_block
,
350 extern edge cached_make_edge
PARAMS ((sbitmap
*, basic_block
,
352 extern edge make_edge
PARAMS ((basic_block
,
354 extern edge make_single_succ_edge
PARAMS ((basic_block
,
356 extern void remove_edge
PARAMS ((edge
));
357 extern void redirect_edge_succ
PARAMS ((edge
, basic_block
));
358 extern edge redirect_edge_succ_nodup
PARAMS ((edge
, basic_block
));
359 extern void redirect_edge_pred
PARAMS ((edge
, basic_block
));
360 extern basic_block create_basic_block_structure
PARAMS ((rtx
, rtx
, rtx
, basic_block
));
361 extern basic_block create_basic_block
PARAMS ((rtx
, rtx
, basic_block
));
362 extern int flow_delete_block
PARAMS ((basic_block
));
363 extern int flow_delete_block_noexpunge
PARAMS ((basic_block
));
364 extern void clear_bb_flags
PARAMS ((void));
365 extern void merge_blocks_nomove
PARAMS ((basic_block
, basic_block
));
366 extern void tidy_fallthru_edge
PARAMS ((edge
, basic_block
,
368 extern void tidy_fallthru_edges
PARAMS ((void));
369 extern void flow_reverse_top_sort_order_compute
PARAMS ((int *));
370 extern int flow_depth_first_order_compute
PARAMS ((int *, int *));
371 extern void flow_preorder_transversal_compute
PARAMS ((int *));
372 extern int dfs_enumerate_from
PARAMS ((basic_block
, int,
373 bool (*)(basic_block
, void *),
374 basic_block
*, int, void *));
375 extern void dump_edge_info
PARAMS ((FILE *, edge
, int));
376 extern void clear_edges
PARAMS ((void));
377 extern void mark_critical_edges
PARAMS ((void));
378 extern rtx first_insn_after_basic_block_note
PARAMS ((basic_block
));
380 /* Dominator information for basic blocks. */
382 typedef struct dominance_info
*dominance_info
;
384 /* Structure to group all of the information to process IF-THEN and
385 IF-THEN-ELSE blocks for the conditional execution support. This
386 needs to be in a public file in case the IFCVT macros call
387 functions passing the ce_if_block data structure. */
389 typedef struct ce_if_block
391 basic_block test_bb
; /* First test block. */
392 basic_block then_bb
; /* THEN block. */
393 basic_block else_bb
; /* ELSE block or NULL. */
394 basic_block join_bb
; /* Join THEN/ELSE blocks. */
395 basic_block last_test_bb
; /* Last bb to hold && or || tests. */
396 int num_multiple_test_blocks
; /* # of && and || basic blocks. */
397 int num_and_and_blocks
; /* # of && blocks. */
398 int num_or_or_blocks
; /* # of || blocks. */
399 int num_multiple_test_insns
; /* # of insns in && and || blocks. */
400 int and_and_p
; /* Complex test is &&. */
401 int num_then_insns
; /* # of insns in THEN block. */
402 int num_else_insns
; /* # of insns in ELSE block. */
403 int pass
; /* Pass number. */
405 #ifdef IFCVT_EXTRA_FIELDS
406 IFCVT_EXTRA_FIELDS
/* Any machine dependent fields. */
411 /* This structure maintains an edge list vector. */
419 /* This is the value which indicates no edge is present. */
420 #define EDGE_INDEX_NO_EDGE -1
422 /* EDGE_INDEX returns an integer index for an edge, or EDGE_INDEX_NO_EDGE
423 if there is no edge between the 2 basic blocks. */
424 #define EDGE_INDEX(el, pred, succ) (find_edge_index ((el), (pred), (succ)))
426 /* INDEX_EDGE_PRED_BB and INDEX_EDGE_SUCC_BB return a pointer to the basic
427 block which is either the pred or succ end of the indexed edge. */
428 #define INDEX_EDGE_PRED_BB(el, index) ((el)->index_to_edge[(index)]->src)
429 #define INDEX_EDGE_SUCC_BB(el, index) ((el)->index_to_edge[(index)]->dest)
431 /* INDEX_EDGE returns a pointer to the edge. */
432 #define INDEX_EDGE(el, index) ((el)->index_to_edge[(index)])
434 /* Number of edges in the compressed edge list. */
435 #define NUM_EDGES(el) ((el)->num_edges)
437 /* BB is assumed to contain conditional jump. Return the fallthru edge. */
438 #define FALLTHRU_EDGE(bb) ((bb)->succ->flags & EDGE_FALLTHRU \
439 ? (bb)->succ : (bb)->succ->succ_next)
441 /* BB is assumed to contain conditional jump. Return the branch edge. */
442 #define BRANCH_EDGE(bb) ((bb)->succ->flags & EDGE_FALLTHRU \
443 ? (bb)->succ->succ_next : (bb)->succ)
445 /* Return expected execution frequency of the edge E. */
446 #define EDGE_FREQUENCY(e) (((e)->src->frequency \
448 + REG_BR_PROB_BASE / 2) \
451 /* Return nonzero if edge is critical. */
452 #define EDGE_CRITICAL_P(e) ((e)->src->succ->succ_next \
453 && (e)->dest->pred->pred_next)
455 struct edge_list
* create_edge_list
PARAMS ((void));
456 void free_edge_list
PARAMS ((struct edge_list
*));
457 void print_edge_list
PARAMS ((FILE *, struct edge_list
*));
458 void verify_edge_list
PARAMS ((FILE *, struct edge_list
*));
459 int find_edge_index
PARAMS ((struct edge_list
*,
460 basic_block
, basic_block
));
463 enum update_life_extent
465 UPDATE_LIFE_LOCAL
= 0,
466 UPDATE_LIFE_GLOBAL
= 1,
467 UPDATE_LIFE_GLOBAL_RM_NOTES
= 2
470 /* Flags for life_analysis and update_life_info. */
472 #define PROP_DEATH_NOTES 1 /* Create DEAD and UNUSED notes. */
473 #define PROP_LOG_LINKS 2 /* Create LOG_LINKS. */
474 #define PROP_REG_INFO 4 /* Update regs_ever_live et al. */
475 #define PROP_KILL_DEAD_CODE 8 /* Remove dead code. */
476 #define PROP_SCAN_DEAD_CODE 16 /* Scan for dead code. */
477 #define PROP_ALLOW_CFG_CHANGES 32 /* Allow the CFG to be changed
478 by dead code removal. */
479 #define PROP_AUTOINC 64 /* Create autoinc mem references. */
480 #define PROP_EQUAL_NOTES 128 /* Take into account REG_EQUAL notes. */
481 #define PROP_SCAN_DEAD_STORES 256 /* Scan for dead code. */
482 #define PROP_FINAL (PROP_DEATH_NOTES | PROP_LOG_LINKS \
483 | PROP_REG_INFO | PROP_KILL_DEAD_CODE \
484 | PROP_SCAN_DEAD_CODE | PROP_AUTOINC \
485 | PROP_ALLOW_CFG_CHANGES \
486 | PROP_SCAN_DEAD_STORES)
488 #define CLEANUP_EXPENSIVE 1 /* Do relativly expensive optimizations
489 except for edge forwarding */
490 #define CLEANUP_CROSSJUMP 2 /* Do crossjumping. */
491 #define CLEANUP_POST_REGSTACK 4 /* We run after reg-stack and need
492 to care REG_DEAD notes. */
493 #define CLEANUP_PRE_SIBCALL 8 /* Do not get confused by code hidden
494 inside call_placeholders.. */
495 #define CLEANUP_PRE_LOOP 16 /* Take care to preserve syntactic loop
497 #define CLEANUP_UPDATE_LIFE 32 /* Keep life information up to date. */
498 #define CLEANUP_THREADING 64 /* Do jump threading. */
499 #define CLEANUP_NO_INSN_DEL 128 /* Do not try to delete trivially dead
501 extern void life_analysis
PARAMS ((rtx
, FILE *, int));
502 extern int update_life_info
PARAMS ((sbitmap
, enum update_life_extent
,
504 extern int update_life_info_in_dirty_blocks
PARAMS ((enum update_life_extent
,
506 extern int count_or_remove_death_notes
PARAMS ((sbitmap
, int));
507 extern int propagate_block
PARAMS ((basic_block
, regset
, regset
, regset
,
510 struct propagate_block_info
;
511 extern rtx propagate_one_insn
PARAMS ((struct propagate_block_info
*, rtx
));
512 extern struct propagate_block_info
*init_propagate_block_info
513 PARAMS ((basic_block
, regset
, regset
, regset
, int));
514 extern void free_propagate_block_info
PARAMS ((struct propagate_block_info
*));
517 extern struct edge_list
*pre_edge_lcm
PARAMS ((FILE *, int, sbitmap
*,
518 sbitmap
*, sbitmap
*,
519 sbitmap
*, sbitmap
**,
521 extern struct edge_list
*pre_edge_rev_lcm
PARAMS ((FILE *, int, sbitmap
*,
522 sbitmap
*, sbitmap
*,
523 sbitmap
*, sbitmap
**,
525 extern void compute_available
PARAMS ((sbitmap
*, sbitmap
*,
526 sbitmap
*, sbitmap
*));
527 extern int optimize_mode_switching
PARAMS ((FILE *));
530 extern rtx emit_block_insn_after
PARAMS ((rtx
, rtx
, basic_block
));
531 extern rtx emit_block_insn_before
PARAMS ((rtx
, rtx
, basic_block
));
534 extern void estimate_probability
PARAMS ((struct loops
*));
535 extern void note_prediction_to_br_prob
PARAMS ((void));
536 extern void expected_value_to_br_prob
PARAMS ((void));
537 extern void note_prediction_to_br_prob
PARAMS ((void));
538 extern bool maybe_hot_bb_p
PARAMS ((basic_block
));
539 extern bool probably_cold_bb_p
PARAMS ((basic_block
));
540 extern bool probably_never_executed_bb_p
PARAMS ((basic_block
));
543 extern void init_flow
PARAMS ((void));
544 extern void reorder_basic_blocks
PARAMS ((void));
545 extern void dump_bb
PARAMS ((basic_block
, FILE *));
546 extern void debug_bb
PARAMS ((basic_block
));
547 extern basic_block debug_bb_n
PARAMS ((int));
548 extern void dump_regset
PARAMS ((regset
, FILE *));
549 extern void debug_regset
PARAMS ((regset
));
550 extern void allocate_reg_life_data
PARAMS ((void));
551 extern void allocate_bb_life_data
PARAMS ((void));
552 extern void expunge_block
PARAMS ((basic_block
));
553 extern void link_block
PARAMS ((basic_block
, basic_block
));
554 extern void unlink_block
PARAMS ((basic_block
));
555 extern void compact_blocks
PARAMS ((void));
556 extern basic_block alloc_block
PARAMS ((void));
557 extern void find_unreachable_blocks
PARAMS ((void));
558 extern int delete_noop_moves
PARAMS ((rtx
));
559 extern basic_block redirect_edge_and_branch_force
PARAMS ((edge
, basic_block
));
560 extern basic_block force_nonfallthru
PARAMS ((edge
));
561 extern bool redirect_edge_and_branch
PARAMS ((edge
, basic_block
));
562 extern rtx block_label
PARAMS ((basic_block
));
563 extern bool forwarder_block_p
PARAMS ((basic_block
));
564 extern bool purge_all_dead_edges
PARAMS ((int));
565 extern bool purge_dead_edges
PARAMS ((basic_block
));
566 extern void find_sub_basic_blocks
PARAMS ((basic_block
));
567 extern void find_many_sub_basic_blocks
PARAMS ((sbitmap
));
568 extern bool can_fallthru
PARAMS ((basic_block
, basic_block
));
569 extern void flow_nodes_print
PARAMS ((const char *, const sbitmap
,
571 extern void flow_edge_list_print
PARAMS ((const char *, const edge
*,
573 extern void alloc_aux_for_block
PARAMS ((basic_block
, int));
574 extern void alloc_aux_for_blocks
PARAMS ((int));
575 extern void clear_aux_for_blocks
PARAMS ((void));
576 extern void free_aux_for_blocks
PARAMS ((void));
577 extern void alloc_aux_for_edge
PARAMS ((edge
, int));
578 extern void alloc_aux_for_edges
PARAMS ((int));
579 extern void clear_aux_for_edges
PARAMS ((void));
580 extern void free_aux_for_edges
PARAMS ((void));
582 /* This function is always defined so it can be called from the
583 debugger, and it is declared extern so we don't get warnings about
585 extern void verify_flow_info
PARAMS ((void));
587 typedef struct conflict_graph_def
*conflict_graph
;
589 /* Callback function when enumerating conflicts. The arguments are
590 the smaller and larger regno in the conflict. Returns zero if
591 enumeration is to continue, nonzero to halt enumeration. */
592 typedef int (*conflict_graph_enum_fn
) PARAMS ((int, int, void *));
595 /* Prototypes of operations on conflict graphs. */
597 extern conflict_graph conflict_graph_new
599 extern void conflict_graph_delete
PARAMS ((conflict_graph
));
600 extern int conflict_graph_add
PARAMS ((conflict_graph
,
602 extern int conflict_graph_conflict_p
PARAMS ((conflict_graph
,
604 extern void conflict_graph_enum
PARAMS ((conflict_graph
, int,
605 conflict_graph_enum_fn
,
607 extern void conflict_graph_merge_regs
PARAMS ((conflict_graph
, int,
609 extern void conflict_graph_print
PARAMS ((conflict_graph
, FILE*));
610 extern conflict_graph conflict_graph_compute
613 extern bool mark_dfs_back_edges
PARAMS ((void));
614 extern void set_edge_can_fallthru_flag
PARAMS ((void));
615 extern void update_br_prob_note
PARAMS ((basic_block
));
616 extern void fixup_abnormal_edges
PARAMS ((void));
617 extern bool can_hoist_insn_p
PARAMS ((rtx
, rtx
, regset
));
618 extern rtx hoist_insn_after
PARAMS ((rtx
, rtx
, rtx
, rtx
));
619 extern rtx hoist_insn_to_edge
PARAMS ((rtx
, edge
, rtx
, rtx
));
620 extern bool inside_basic_block_p
PARAMS ((rtx
));
621 extern bool control_flow_insn_p
PARAMS ((rtx
));
631 extern dominance_info calculate_dominance_info
PARAMS ((enum cdi_direction
));
632 extern void free_dominance_info
PARAMS ((dominance_info
));
633 extern basic_block nearest_common_dominator
PARAMS ((dominance_info
,
634 basic_block
, basic_block
));
635 extern void set_immediate_dominator
PARAMS ((dominance_info
,
636 basic_block
, basic_block
));
637 extern basic_block get_immediate_dominator
PARAMS ((dominance_info
,
639 extern bool dominated_by_p
PARAMS ((dominance_info
, basic_block
, basic_block
));
640 extern int get_dominated_by
PARAMS ((dominance_info
, basic_block
, basic_block
**));
641 extern void add_to_dominance_info
PARAMS ((dominance_info
, basic_block
));
642 extern void delete_from_dominance_info
PARAMS ((dominance_info
, basic_block
));
643 basic_block recount_dominator
PARAMS ((dominance_info
, basic_block
));
644 extern void redirect_immediate_dominators
PARAMS ((dominance_info
, basic_block
,
646 void iterate_fix_dominators
PARAMS ((dominance_info
, basic_block
*, int));
647 extern void verify_dominators
PARAMS ((dominance_info
));
648 #endif /* GCC_BASIC_BLOCK_H */