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.
4
5This file is part of GCC.
6
7GCC is free software; you can redistribute it and/or modify it under
8the terms of the GNU General Public License as published by the Free
--- 12 unchanged lines hidden (view full) ---
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
30/* Head of register set linked list. */
31typedef bitmap_head regset_head;
32/* A pointer to a regset_head. */
33typedef bitmap regset;
34
35/* Initialize a new regset. */
36#define INIT_REG_SET(HEAD) bitmap_initialize (HEAD)
37
38/* Clear a register set by freeing up the linked list. */
39#define CLEAR_REG_SET(HEAD) bitmap_clear (HEAD)
40
41/* Copy a register set to another register set. */
42#define COPY_REG_SET(TO, FROM) bitmap_copy (TO, FROM)
43
44/* Compare two register sets. */
--- 49 unchanged lines hidden (view full) ---
94 set in both regsets. */
95#define EXECUTE_IF_AND_IN_REG_SET(REGSET1, REGSET2, MIN, REGNUM, CODE) \
96 EXECUTE_IF_AND_IN_BITMAP (REGSET1, REGSET2, MIN, REGNUM, CODE)
97
98/* Allocate a register set with oballoc. */
99#define OBSTACK_ALLOC_REG_SET(OBSTACK) BITMAP_OBSTACK_ALLOC (OBSTACK)
100
101/* Initialize a register set. Returns the new register set. */
102#define INITIALIZE_REG_SET(HEAD) bitmap_initialize (&HEAD)
103
104/* Do any cleanup needed on a regset when it is no longer used. */
105#define FREE_REG_SET(REGSET) BITMAP_FREE(REGSET)
106
107/* Do any one-time initializations needed for regsets. */
108#define INIT_ONCE_REG_SET() BITMAP_INIT_ONCE ()
109
110/* Grow any tables needed when the number of registers is calculated
--- 19 unchanged lines hidden (view full) ---
130 void *aux;
131
132 int flags; /* see EDGE_* below */
133 int probability; /* biased by REG_BR_PROB_BASE */
134 gcov_type count; /* Expected number of executions calculated
135 in profile.c */
136} *edge;
137
138#define EDGE_FALLTHRU 1
139#define EDGE_ABNORMAL 2
140#define EDGE_ABNORMAL_CALL 4
141#define EDGE_EH 8
142#define EDGE_FAKE 16
143#define EDGE_DFS_BACK 32
144
145#define EDGE_COMPLEX (EDGE_ABNORMAL | EDGE_ABNORMAL_CALL | EDGE_EH)
146
147
148/* A basic block is a sequence of instructions with only entry and
149 only one exit. If any one of the instructions are executed, they
150 will all be executed, and in sequence from first to last.
151
--- 48 unchanged lines hidden (view full) ---
200 regset global_live_at_end;
201
202 /* Auxiliary info specific to a pass. */
203 void *aux;
204
205 /* The index of this block. */
206 int index;
207
208 /* The loop depth of this block. */
209 int loop_depth;
210
211 /* Expected number of executions: calculated in profile.c. */
212 gcov_type count;
213
214 /* Expected frequency. Normalized to be in range 0 to BB_FREQ_MAX. */
215 int frequency;
216
217 /* Various flags. See BB_* below. */
218 int flags;
219} *basic_block;
220
221#define BB_FREQ_MAX 10000
222
223/* Masks for basic_block.flags. */
224#define BB_REACHABLE 1
225
226/* Number of basic blocks in the current function. */
227
228extern int n_basic_blocks;
229
230/* Number of edges in the current function. */
231
232extern int n_edges;
233
234/* Index by basic block number, get basic block struct info. */
235
236extern varray_type basic_block_info;
237
238#define BASIC_BLOCK(N) (VARRAY_BB (basic_block_info, (N)))
239
240/* What registers are live at the setjmp call. */
241
242extern regset regs_live_at_setjmp;
243
244/* Special labels found during CFG build. */
245
246extern rtx label_value_list, tail_recursion_label_list;
247
248extern struct obstack flow_obstack;
249
250/* Indexed by n, gives number of basic block that (REG n) is used in.
251 If the value is REG_BLOCK_GLOBAL (-2),
252 it means (REG n) is used in more than one basic block.
253 REG_BLOCK_UNKNOWN (-1) means it hasn't been seen yet so we don't know.
254 This information remains valid for the rest of the compilation
--- 19 unchanged lines hidden (view full) ---
274/* Special block number not valid for any block. */
275#define INVALID_BLOCK (-3)
276
277/* Similarly, block pointers for the edge list. */
278extern struct basic_block_def entry_exit_blocks[2];
279#define ENTRY_BLOCK_PTR (&entry_exit_blocks[0])
280#define EXIT_BLOCK_PTR (&entry_exit_blocks[1])
281
282extern varray_type basic_block_for_insn;
283#define BLOCK_FOR_INSN(INSN) VARRAY_BB (basic_block_for_insn, INSN_UID (INSN))
284#define BLOCK_NUM(INSN) (BLOCK_FOR_INSN (INSN)->index + 0)
285
286extern void compute_bb_for_insn PARAMS ((int));
287extern void free_bb_for_insn PARAMS ((void));
288extern void update_bb_for_insn PARAMS ((basic_block));
289extern void set_block_for_insn PARAMS ((rtx, basic_block));
290
291extern void free_basic_block_vars PARAMS ((int));
292
293extern edge split_block PARAMS ((basic_block, rtx));
294extern basic_block split_edge PARAMS ((edge));
295extern void insert_insn_on_edge PARAMS ((rtx, edge));
296extern void commit_edge_insertions PARAMS ((void));
297extern void remove_fake_edges PARAMS ((void));
298extern void add_noreturn_fake_exit_edges PARAMS ((void));
299extern void connect_infinite_loops_to_exit PARAMS ((void));
300extern int flow_call_edges_add PARAMS ((sbitmap));
301extern edge cached_make_edge PARAMS ((sbitmap *, basic_block,
302 basic_block, int));
303extern edge make_edge PARAMS ((basic_block,
304 basic_block, int));
305extern edge make_single_succ_edge PARAMS ((basic_block,
306 basic_block, int));
307extern void remove_edge PARAMS ((edge));
308extern void redirect_edge_succ PARAMS ((edge, basic_block));
309extern edge redirect_edge_succ_nodup PARAMS ((edge, basic_block));
310extern void redirect_edge_pred PARAMS ((edge, basic_block));
311extern basic_block create_basic_block_structure PARAMS ((int, rtx, rtx, rtx));
312extern basic_block create_basic_block PARAMS ((int, rtx, rtx));
313extern int flow_delete_block PARAMS ((basic_block));
314extern int flow_delete_block_noexpunge PARAMS ((basic_block));
315extern void merge_blocks_nomove PARAMS ((basic_block, basic_block));
316extern void tidy_fallthru_edge PARAMS ((edge, basic_block,
317 basic_block));
318extern void tidy_fallthru_edges PARAMS ((void));
319extern void flow_reverse_top_sort_order_compute PARAMS ((int *));
320extern int flow_depth_first_order_compute PARAMS ((int *, int *));
321extern void flow_preorder_transversal_compute PARAMS ((int *));
322extern void dump_edge_info PARAMS ((FILE *, edge, int));
323extern void clear_edges PARAMS ((void));
324extern void mark_critical_edges PARAMS ((void));
325extern rtx first_insn_after_basic_block_note PARAMS ((basic_block));
326
327/* Structure to hold information for each natural loop. */
328struct loop
329{
330 /* Index into loops array. */
331 int num;
332
333 /* Basic block of loop header. */
334 basic_block header;
--- 39 unchanged lines hidden (view full) ---
374 int num_exits;
375
376 /* Bitmap of blocks that dominate all exits of the loop. */
377 sbitmap exits_doms;
378
379 /* The loop nesting depth. */
380 int depth;
381
382 /* The height of the loop (enclosed loop levels) within the loop
383 hierarchy tree. */
384 int level;
385
386 /* The outer (parent) loop or NULL if outermost loop. */
387 struct loop *outer;
388
389 /* The first inner (child) loop or NULL if innermost loop. */
390 struct loop *inner;
391
392 /* Link to the next (sibling) loop. */
393 struct loop *next;
394
395 /* Non-zero if the loop shares a header with another loop. */
396 int shared;
397
398 /* Non-zero if the loop is invalid (e.g., contains setjmp.). */
399 int invalid;
400
401 /* Auxiliary info specific to a pass. */
402 void *aux;
403
404 /* The following are currently used by loop.c but they are likely to
405 disappear as loop.c is converted to use the CFG. */
406
407 /* Non-zero if the loop has a NOTE_INSN_LOOP_VTOP. */
408 rtx vtop;
409
410 /* Non-zero if the loop has a NOTE_INSN_LOOP_CONT.
411 A continue statement will generate a branch to NEXT_INSN (cont). */
412 rtx cont;
413
414 /* The dominator of cont. */
415 rtx cont_dominator;
416
417 /* The NOTE_INSN_LOOP_BEG. */
418 rtx start;
419
420 /* The NOTE_INSN_LOOP_END. */
421 rtx end;
422
423 /* For a rotated loop that is entered near the bottom,
424 this is the label at the top. Otherwise it is zero. */
--- 30 unchanged lines hidden (view full) ---
455
456 /* Maxium nested loop level in the function. */
457 int levels;
458
459 /* Array of natural loop descriptors (scanning this array in reverse order
460 will find the inner loops before their enclosing outer loops). */
461 struct loop *array;
462
463 /* Pointer to root of loop heirachy tree. */
464 struct loop *tree_root;
465
466 /* Information derived from the CFG. */
467 struct cfg
468 {
469 /* The bitmap vector of dominators or NULL if not computed. */
470 sbitmap *dom;
471
472 /* The ordering of the basic blocks in a depth first search. */
473 int *dfs_order;
474
475 /* The reverse completion ordering of the basic blocks found in a
476 depth first search. */
477 int *rc_order;
478 } cfg;
479
480 /* Headers shared by multiple loops that should be merged. */
481 sbitmap shared_headers;
482};
483
484extern int flow_loops_find PARAMS ((struct loops *, int flags));
485extern int flow_loops_update PARAMS ((struct loops *, int flags));
486extern void flow_loops_free PARAMS ((struct loops *));
487extern void flow_loops_dump PARAMS ((const struct loops *, FILE *,
488 void (*)(const struct loop *,
489 FILE *, int), int));
490extern void flow_loop_dump PARAMS ((const struct loop *, FILE *,
491 void (*)(const struct loop *,
492 FILE *, int), int));
493extern int flow_loop_scan PARAMS ((struct loops *, struct loop *, int));
494
495/* This structure maintains an edge list vector. */
496struct edge_list
497{
498 int num_blocks;
499 int num_edges;
500 edge *index_to_edge;
501};
--- 55 unchanged lines hidden (view full) ---
557#define PROP_LOG_LINKS 2 /* Create LOG_LINKS. */
558#define PROP_REG_INFO 4 /* Update regs_ever_live et al. */
559#define PROP_KILL_DEAD_CODE 8 /* Remove dead code. */
560#define PROP_SCAN_DEAD_CODE 16 /* Scan for dead code. */
561#define PROP_ALLOW_CFG_CHANGES 32 /* Allow the CFG to be changed
562 by dead code removal. */
563#define PROP_AUTOINC 64 /* Create autoinc mem references. */
564#define PROP_EQUAL_NOTES 128 /* Take into account REG_EQUAL notes. */
565#define PROP_FINAL 127 /* All of the above. */
566
567#define CLEANUP_EXPENSIVE 1 /* Do relativly expensive optimizations
568 except for edge forwarding */
569#define CLEANUP_CROSSJUMP 2 /* Do crossjumping. */
570#define CLEANUP_POST_REGSTACK 4 /* We run after reg-stack and need
571 to care REG_DEAD notes. */
572#define CLEANUP_PRE_SIBCALL 8 /* Do not get confused by code hidden
573 inside call_placeholders.. */
574#define CLEANUP_PRE_LOOP 16 /* Take care to preserve syntactic loop
575 notes. */
576#define CLEANUP_UPDATE_LIFE 32 /* Keep life information up to date. */
577#define CLEANUP_THREADING 64 /* Do jump threading. */
578/* Flags for loop discovery. */
579
580#define LOOP_TREE 1 /* Build loop hierarchy tree. */
581#define LOOP_PRE_HEADER 2 /* Analyse loop pre-header. */
582#define LOOP_ENTRY_EDGES 4 /* Find entry edges. */
583#define LOOP_EXIT_EDGES 8 /* Find exit edges. */
584#define LOOP_EDGES (LOOP_ENTRY_EDGES | LOOP_EXIT_EDGES)
585#define LOOP_EXITS_DOMS 16 /* Find nodes that dom. all exits. */
586#define LOOP_ALL 31 /* All of the above */
587
588extern void life_analysis PARAMS ((rtx, FILE *, int));
589extern void update_life_info PARAMS ((sbitmap, enum update_life_extent,
590 int));
591extern int count_or_remove_death_notes PARAMS ((sbitmap, int));
592extern int propagate_block PARAMS ((basic_block, regset, regset, regset,
593 int));
594
595struct propagate_block_info;
596extern rtx propagate_one_insn PARAMS ((struct propagate_block_info *, rtx));
597extern struct propagate_block_info *init_propagate_block_info
598 PARAMS ((basic_block, regset, regset, regset, int));
--- 13 unchanged lines hidden (view full) ---
612extern int optimize_mode_switching PARAMS ((FILE *));
613
614/* In emit-rtl.c. */
615extern rtx emit_block_insn_after PARAMS ((rtx, rtx, basic_block));
616extern rtx emit_block_insn_before PARAMS ((rtx, rtx, basic_block));
617
618/* In predict.c */
619extern void estimate_probability PARAMS ((struct loops *));
620extern void expected_value_to_br_prob PARAMS ((void));
621
622/* In flow.c */
623extern void init_flow PARAMS ((void));
624extern void reorder_basic_blocks PARAMS ((void));
625extern void dump_bb PARAMS ((basic_block, FILE *));
626extern void debug_bb PARAMS ((basic_block));
627extern void debug_bb_n PARAMS ((int));
628extern void dump_regset PARAMS ((regset, FILE *));
629extern void debug_regset PARAMS ((regset));
630extern void allocate_reg_life_data PARAMS ((void));
631extern void allocate_bb_life_data PARAMS ((void));
632extern void expunge_block PARAMS ((basic_block));
633extern void expunge_block_nocompact PARAMS ((basic_block));
634extern basic_block alloc_block PARAMS ((void));
635extern void find_unreachable_blocks PARAMS ((void));
636extern void delete_noop_moves PARAMS ((rtx));
637extern basic_block redirect_edge_and_branch_force PARAMS ((edge, basic_block));
638extern basic_block force_nonfallthru PARAMS ((edge));
639extern bool redirect_edge_and_branch PARAMS ((edge, basic_block));
640extern rtx block_label PARAMS ((basic_block));
641extern bool forwarder_block_p PARAMS ((basic_block));
642extern bool purge_all_dead_edges PARAMS ((int));
643extern bool purge_dead_edges PARAMS ((basic_block));
644extern void find_sub_basic_blocks PARAMS ((basic_block));
--- 11 unchanged lines hidden (view full) ---
656extern void alloc_aux_for_edges PARAMS ((int));
657extern void clear_aux_for_edges PARAMS ((void));
658extern void free_aux_for_edges PARAMS ((void));
659
660/* This function is always defined so it can be called from the
661 debugger, and it is declared extern so we don't get warnings about
662 it being unused. */
663extern void verify_flow_info PARAMS ((void));
664extern int flow_loop_outside_edge_p PARAMS ((const struct loop *, edge));
665
666typedef struct conflict_graph_def *conflict_graph;
667
668/* Callback function when enumerating conflicts. The arguments are
669 the smaller and larger regno in the conflict. Returns zero if
670 enumeration is to continue, non-zero to halt enumeration. */
671typedef int (*conflict_graph_enum_fn) PARAMS ((int, int, void *));
672
673
674/* Prototypes of operations on conflict graphs. */
675
676extern conflict_graph conflict_graph_new
677 PARAMS ((int));
678extern void conflict_graph_delete PARAMS ((conflict_graph));
--- 6 unchanged lines hidden (view full) ---
685 void *));
686extern void conflict_graph_merge_regs PARAMS ((conflict_graph, int,
687 int));
688extern void conflict_graph_print PARAMS ((conflict_graph, FILE*));
689extern conflict_graph conflict_graph_compute
690 PARAMS ((regset,
691 partition));
692extern bool mark_dfs_back_edges PARAMS ((void));
693extern void update_br_prob_note PARAMS ((basic_block));
694extern void fixup_abnormal_edges PARAMS ((void));
695extern bool control_flow_insn_p PARAMS ((rtx));
696
697/* In dominance.c */
698
699enum cdi_direction
700{
701 CDI_DOMINATORS,
702 CDI_POST_DOMINATORS
703};
704
705extern void calculate_dominance_info PARAMS ((int *, sbitmap *,
706 enum cdi_direction));
707
708#endif /* GCC_BASIC_BLOCK_H */
2 Copyright (C) 1987, 1997, 1998, 1999, 2000, 2001, 2002, 2003
3 Free Software Foundation, Inc.
4
5This file is part of GCC.
6
7GCC is free software; you can redistribute it and/or modify it under
8the terms of the GNU General Public License as published by the Free
--- 12 unchanged lines hidden (view full) ---
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
30/* Head of register set linked list. */
31typedef bitmap_head regset_head;
32/* A pointer to a regset_head. */
33typedef bitmap regset;
34
35/* Initialize a new regset. */
36#define INIT_REG_SET(HEAD) bitmap_initialize (HEAD)
37
38/* Clear a register set by freeing up the linked list. */
39#define CLEAR_REG_SET(HEAD) bitmap_clear (HEAD)
40
41/* Copy a register set to another register set. */
42#define COPY_REG_SET(TO, FROM) bitmap_copy (TO, FROM)
43
44/* Compare two register sets. */
--- 49 unchanged lines hidden (view full) ---
94 set in both regsets. */
95#define EXECUTE_IF_AND_IN_REG_SET(REGSET1, REGSET2, MIN, REGNUM, CODE) \
96 EXECUTE_IF_AND_IN_BITMAP (REGSET1, REGSET2, MIN, REGNUM, CODE)
97
98/* Allocate a register set with oballoc. */
99#define OBSTACK_ALLOC_REG_SET(OBSTACK) BITMAP_OBSTACK_ALLOC (OBSTACK)
100
101/* Initialize a register set. Returns the new register set. */
102#define INITIALIZE_REG_SET(HEAD) bitmap_initialize (&HEAD)
103
104/* Do any cleanup needed on a regset when it is no longer used. */
105#define FREE_REG_SET(REGSET) BITMAP_FREE(REGSET)
106
107/* Do any one-time initializations needed for regsets. */
108#define INIT_ONCE_REG_SET() BITMAP_INIT_ONCE ()
109
110/* Grow any tables needed when the number of registers is calculated
--- 19 unchanged lines hidden (view full) ---
130 void *aux;
131
132 int flags; /* see EDGE_* below */
133 int probability; /* biased by REG_BR_PROB_BASE */
134 gcov_type count; /* Expected number of executions calculated
135 in profile.c */
136} *edge;
137
138#define EDGE_FALLTHRU 1
139#define EDGE_ABNORMAL 2
140#define EDGE_ABNORMAL_CALL 4
141#define EDGE_EH 8
142#define EDGE_FAKE 16
143#define EDGE_DFS_BACK 32
144
145#define EDGE_COMPLEX (EDGE_ABNORMAL | EDGE_ABNORMAL_CALL | EDGE_EH)
146
147
148/* A basic block is a sequence of instructions with only entry and
149 only one exit. If any one of the instructions are executed, they
150 will all be executed, and in sequence from first to last.
151
--- 48 unchanged lines hidden (view full) ---
200 regset global_live_at_end;
201
202 /* Auxiliary info specific to a pass. */
203 void *aux;
204
205 /* The index of this block. */
206 int index;
207
208 /* The loop depth of this block. */
209 int loop_depth;
210
211 /* Expected number of executions: calculated in profile.c. */
212 gcov_type count;
213
214 /* Expected frequency. Normalized to be in range 0 to BB_FREQ_MAX. */
215 int frequency;
216
217 /* Various flags. See BB_* below. */
218 int flags;
219} *basic_block;
220
221#define BB_FREQ_MAX 10000
222
223/* Masks for basic_block.flags. */
224#define BB_REACHABLE 1
225
226/* Number of basic blocks in the current function. */
227
228extern int n_basic_blocks;
229
230/* Number of edges in the current function. */
231
232extern int n_edges;
233
234/* Index by basic block number, get basic block struct info. */
235
236extern varray_type basic_block_info;
237
238#define BASIC_BLOCK(N) (VARRAY_BB (basic_block_info, (N)))
239
240/* What registers are live at the setjmp call. */
241
242extern regset regs_live_at_setjmp;
243
244/* Special labels found during CFG build. */
245
246extern rtx label_value_list, tail_recursion_label_list;
247
248extern struct obstack flow_obstack;
249
250/* Indexed by n, gives number of basic block that (REG n) is used in.
251 If the value is REG_BLOCK_GLOBAL (-2),
252 it means (REG n) is used in more than one basic block.
253 REG_BLOCK_UNKNOWN (-1) means it hasn't been seen yet so we don't know.
254 This information remains valid for the rest of the compilation
--- 19 unchanged lines hidden (view full) ---
274/* Special block number not valid for any block. */
275#define INVALID_BLOCK (-3)
276
277/* Similarly, block pointers for the edge list. */
278extern struct basic_block_def entry_exit_blocks[2];
279#define ENTRY_BLOCK_PTR (&entry_exit_blocks[0])
280#define EXIT_BLOCK_PTR (&entry_exit_blocks[1])
281
282extern varray_type basic_block_for_insn;
283#define BLOCK_FOR_INSN(INSN) VARRAY_BB (basic_block_for_insn, INSN_UID (INSN))
284#define BLOCK_NUM(INSN) (BLOCK_FOR_INSN (INSN)->index + 0)
285
286extern void compute_bb_for_insn PARAMS ((int));
287extern void free_bb_for_insn PARAMS ((void));
288extern void update_bb_for_insn PARAMS ((basic_block));
289extern void set_block_for_insn PARAMS ((rtx, basic_block));
290
291extern void free_basic_block_vars PARAMS ((int));
292
293extern edge split_block PARAMS ((basic_block, rtx));
294extern basic_block split_edge PARAMS ((edge));
295extern void insert_insn_on_edge PARAMS ((rtx, edge));
296extern void commit_edge_insertions PARAMS ((void));
297extern void remove_fake_edges PARAMS ((void));
298extern void add_noreturn_fake_exit_edges PARAMS ((void));
299extern void connect_infinite_loops_to_exit PARAMS ((void));
300extern int flow_call_edges_add PARAMS ((sbitmap));
301extern edge cached_make_edge PARAMS ((sbitmap *, basic_block,
302 basic_block, int));
303extern edge make_edge PARAMS ((basic_block,
304 basic_block, int));
305extern edge make_single_succ_edge PARAMS ((basic_block,
306 basic_block, int));
307extern void remove_edge PARAMS ((edge));
308extern void redirect_edge_succ PARAMS ((edge, basic_block));
309extern edge redirect_edge_succ_nodup PARAMS ((edge, basic_block));
310extern void redirect_edge_pred PARAMS ((edge, basic_block));
311extern basic_block create_basic_block_structure PARAMS ((int, rtx, rtx, rtx));
312extern basic_block create_basic_block PARAMS ((int, rtx, rtx));
313extern int flow_delete_block PARAMS ((basic_block));
314extern int flow_delete_block_noexpunge PARAMS ((basic_block));
315extern void merge_blocks_nomove PARAMS ((basic_block, basic_block));
316extern void tidy_fallthru_edge PARAMS ((edge, basic_block,
317 basic_block));
318extern void tidy_fallthru_edges PARAMS ((void));
319extern void flow_reverse_top_sort_order_compute PARAMS ((int *));
320extern int flow_depth_first_order_compute PARAMS ((int *, int *));
321extern void flow_preorder_transversal_compute PARAMS ((int *));
322extern void dump_edge_info PARAMS ((FILE *, edge, int));
323extern void clear_edges PARAMS ((void));
324extern void mark_critical_edges PARAMS ((void));
325extern rtx first_insn_after_basic_block_note PARAMS ((basic_block));
326
327/* Structure to hold information for each natural loop. */
328struct loop
329{
330 /* Index into loops array. */
331 int num;
332
333 /* Basic block of loop header. */
334 basic_block header;
--- 39 unchanged lines hidden (view full) ---
374 int num_exits;
375
376 /* Bitmap of blocks that dominate all exits of the loop. */
377 sbitmap exits_doms;
378
379 /* The loop nesting depth. */
380 int depth;
381
382 /* The height of the loop (enclosed loop levels) within the loop
383 hierarchy tree. */
384 int level;
385
386 /* The outer (parent) loop or NULL if outermost loop. */
387 struct loop *outer;
388
389 /* The first inner (child) loop or NULL if innermost loop. */
390 struct loop *inner;
391
392 /* Link to the next (sibling) loop. */
393 struct loop *next;
394
395 /* Non-zero if the loop shares a header with another loop. */
396 int shared;
397
398 /* Non-zero if the loop is invalid (e.g., contains setjmp.). */
399 int invalid;
400
401 /* Auxiliary info specific to a pass. */
402 void *aux;
403
404 /* The following are currently used by loop.c but they are likely to
405 disappear as loop.c is converted to use the CFG. */
406
407 /* Non-zero if the loop has a NOTE_INSN_LOOP_VTOP. */
408 rtx vtop;
409
410 /* Non-zero if the loop has a NOTE_INSN_LOOP_CONT.
411 A continue statement will generate a branch to NEXT_INSN (cont). */
412 rtx cont;
413
414 /* The dominator of cont. */
415 rtx cont_dominator;
416
417 /* The NOTE_INSN_LOOP_BEG. */
418 rtx start;
419
420 /* The NOTE_INSN_LOOP_END. */
421 rtx end;
422
423 /* For a rotated loop that is entered near the bottom,
424 this is the label at the top. Otherwise it is zero. */
--- 30 unchanged lines hidden (view full) ---
455
456 /* Maxium nested loop level in the function. */
457 int levels;
458
459 /* Array of natural loop descriptors (scanning this array in reverse order
460 will find the inner loops before their enclosing outer loops). */
461 struct loop *array;
462
463 /* Pointer to root of loop heirachy tree. */
464 struct loop *tree_root;
465
466 /* Information derived from the CFG. */
467 struct cfg
468 {
469 /* The bitmap vector of dominators or NULL if not computed. */
470 sbitmap *dom;
471
472 /* The ordering of the basic blocks in a depth first search. */
473 int *dfs_order;
474
475 /* The reverse completion ordering of the basic blocks found in a
476 depth first search. */
477 int *rc_order;
478 } cfg;
479
480 /* Headers shared by multiple loops that should be merged. */
481 sbitmap shared_headers;
482};
483
484extern int flow_loops_find PARAMS ((struct loops *, int flags));
485extern int flow_loops_update PARAMS ((struct loops *, int flags));
486extern void flow_loops_free PARAMS ((struct loops *));
487extern void flow_loops_dump PARAMS ((const struct loops *, FILE *,
488 void (*)(const struct loop *,
489 FILE *, int), int));
490extern void flow_loop_dump PARAMS ((const struct loop *, FILE *,
491 void (*)(const struct loop *,
492 FILE *, int), int));
493extern int flow_loop_scan PARAMS ((struct loops *, struct loop *, int));
494
495/* This structure maintains an edge list vector. */
496struct edge_list
497{
498 int num_blocks;
499 int num_edges;
500 edge *index_to_edge;
501};
--- 55 unchanged lines hidden (view full) ---
557#define PROP_LOG_LINKS 2 /* Create LOG_LINKS. */
558#define PROP_REG_INFO 4 /* Update regs_ever_live et al. */
559#define PROP_KILL_DEAD_CODE 8 /* Remove dead code. */
560#define PROP_SCAN_DEAD_CODE 16 /* Scan for dead code. */
561#define PROP_ALLOW_CFG_CHANGES 32 /* Allow the CFG to be changed
562 by dead code removal. */
563#define PROP_AUTOINC 64 /* Create autoinc mem references. */
564#define PROP_EQUAL_NOTES 128 /* Take into account REG_EQUAL notes. */
565#define PROP_FINAL 127 /* All of the above. */
566
567#define CLEANUP_EXPENSIVE 1 /* Do relativly expensive optimizations
568 except for edge forwarding */
569#define CLEANUP_CROSSJUMP 2 /* Do crossjumping. */
570#define CLEANUP_POST_REGSTACK 4 /* We run after reg-stack and need
571 to care REG_DEAD notes. */
572#define CLEANUP_PRE_SIBCALL 8 /* Do not get confused by code hidden
573 inside call_placeholders.. */
574#define CLEANUP_PRE_LOOP 16 /* Take care to preserve syntactic loop
575 notes. */
576#define CLEANUP_UPDATE_LIFE 32 /* Keep life information up to date. */
577#define CLEANUP_THREADING 64 /* Do jump threading. */
578/* Flags for loop discovery. */
579
580#define LOOP_TREE 1 /* Build loop hierarchy tree. */
581#define LOOP_PRE_HEADER 2 /* Analyse loop pre-header. */
582#define LOOP_ENTRY_EDGES 4 /* Find entry edges. */
583#define LOOP_EXIT_EDGES 8 /* Find exit edges. */
584#define LOOP_EDGES (LOOP_ENTRY_EDGES | LOOP_EXIT_EDGES)
585#define LOOP_EXITS_DOMS 16 /* Find nodes that dom. all exits. */
586#define LOOP_ALL 31 /* All of the above */
587
588extern void life_analysis PARAMS ((rtx, FILE *, int));
589extern void update_life_info PARAMS ((sbitmap, enum update_life_extent,
590 int));
591extern int count_or_remove_death_notes PARAMS ((sbitmap, int));
592extern int propagate_block PARAMS ((basic_block, regset, regset, regset,
593 int));
594
595struct propagate_block_info;
596extern rtx propagate_one_insn PARAMS ((struct propagate_block_info *, rtx));
597extern struct propagate_block_info *init_propagate_block_info
598 PARAMS ((basic_block, regset, regset, regset, int));
--- 13 unchanged lines hidden (view full) ---
612extern int optimize_mode_switching PARAMS ((FILE *));
613
614/* In emit-rtl.c. */
615extern rtx emit_block_insn_after PARAMS ((rtx, rtx, basic_block));
616extern rtx emit_block_insn_before PARAMS ((rtx, rtx, basic_block));
617
618/* In predict.c */
619extern void estimate_probability PARAMS ((struct loops *));
620extern void expected_value_to_br_prob PARAMS ((void));
621
622/* In flow.c */
623extern void init_flow PARAMS ((void));
624extern void reorder_basic_blocks PARAMS ((void));
625extern void dump_bb PARAMS ((basic_block, FILE *));
626extern void debug_bb PARAMS ((basic_block));
627extern void debug_bb_n PARAMS ((int));
628extern void dump_regset PARAMS ((regset, FILE *));
629extern void debug_regset PARAMS ((regset));
630extern void allocate_reg_life_data PARAMS ((void));
631extern void allocate_bb_life_data PARAMS ((void));
632extern void expunge_block PARAMS ((basic_block));
633extern void expunge_block_nocompact PARAMS ((basic_block));
634extern basic_block alloc_block PARAMS ((void));
635extern void find_unreachable_blocks PARAMS ((void));
636extern void delete_noop_moves PARAMS ((rtx));
637extern basic_block redirect_edge_and_branch_force PARAMS ((edge, basic_block));
638extern basic_block force_nonfallthru PARAMS ((edge));
639extern bool redirect_edge_and_branch PARAMS ((edge, basic_block));
640extern rtx block_label PARAMS ((basic_block));
641extern bool forwarder_block_p PARAMS ((basic_block));
642extern bool purge_all_dead_edges PARAMS ((int));
643extern bool purge_dead_edges PARAMS ((basic_block));
644extern void find_sub_basic_blocks PARAMS ((basic_block));
--- 11 unchanged lines hidden (view full) ---
656extern void alloc_aux_for_edges PARAMS ((int));
657extern void clear_aux_for_edges PARAMS ((void));
658extern void free_aux_for_edges PARAMS ((void));
659
660/* This function is always defined so it can be called from the
661 debugger, and it is declared extern so we don't get warnings about
662 it being unused. */
663extern void verify_flow_info PARAMS ((void));
664extern int flow_loop_outside_edge_p PARAMS ((const struct loop *, edge));
665
666typedef struct conflict_graph_def *conflict_graph;
667
668/* Callback function when enumerating conflicts. The arguments are
669 the smaller and larger regno in the conflict. Returns zero if
670 enumeration is to continue, non-zero to halt enumeration. */
671typedef int (*conflict_graph_enum_fn) PARAMS ((int, int, void *));
672
673
674/* Prototypes of operations on conflict graphs. */
675
676extern conflict_graph conflict_graph_new
677 PARAMS ((int));
678extern void conflict_graph_delete PARAMS ((conflict_graph));
--- 6 unchanged lines hidden (view full) ---
685 void *));
686extern void conflict_graph_merge_regs PARAMS ((conflict_graph, int,
687 int));
688extern void conflict_graph_print PARAMS ((conflict_graph, FILE*));
689extern conflict_graph conflict_graph_compute
690 PARAMS ((regset,
691 partition));
692extern bool mark_dfs_back_edges PARAMS ((void));
693extern void update_br_prob_note PARAMS ((basic_block));
694extern void fixup_abnormal_edges PARAMS ((void));
695extern bool control_flow_insn_p PARAMS ((rtx));
696
697/* In dominance.c */
698
699enum cdi_direction
700{
701 CDI_DOMINATORS,
702 CDI_POST_DOMINATORS
703};
704
705extern void calculate_dominance_info PARAMS ((int *, sbitmap *,
706 enum cdi_direction));
707
708#endif /* GCC_BASIC_BLOCK_H */