]>
Commit | Line | Data |
---|---|---|
3245eea0 | 1 | /* Define control and data flow tables, and regsets. |
ad616de1 | 2 | Copyright (C) 1987, 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005 |
8aab0f2b | 3 | Free Software Foundation, Inc. |
3245eea0 | 4 | |
1322177d | 5 | This file is part of GCC. |
3245eea0 | 6 | |
1322177d LB |
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. | |
3245eea0 | 11 | |
1322177d LB |
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. | |
3245eea0 CH |
16 | |
17 | You should have received a copy of the GNU General Public License | |
1322177d | 18 | along with GCC; see the file COPYING. If not, write to the Free |
366ccddb KC |
19 | Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA |
20 | 02110-1301, USA. */ | |
3245eea0 | 21 | |
88657302 | 22 | #ifndef GCC_BASIC_BLOCK_H |
7f8a2125 | 23 | #define GCC_BASIC_BLOCK_H |
3245eea0 | 24 | |
19d18142 | 25 | #include "bitmap.h" |
5f6c11d6 | 26 | #include "sbitmap.h" |
e881bb1b | 27 | #include "varray.h" |
4e872036 | 28 | #include "partition.h" |
56f15830 | 29 | #include "hard-reg-set.h" |
6de9cd9a | 30 | #include "predict.h" |
628f6a4e | 31 | #include "vec.h" |
997de8ed | 32 | #include "function.h" |
19d18142 | 33 | |
b1dbfa1d BS |
34 | /* Head of register set linked list. */ |
35 | typedef bitmap_head regset_head; | |
6de9cd9a | 36 | |
b1dbfa1d BS |
37 | /* A pointer to a regset_head. */ |
38 | typedef bitmap regset; | |
39 | ||
04389919 | 40 | /* Allocate a register set with oballoc. */ |
cc175e7c | 41 | #define ALLOC_REG_SET(OBSTACK) BITMAP_ALLOC (OBSTACK) |
04389919 NS |
42 | |
43 | /* Do any cleanup needed on a regset when it is no longer used. */ | |
cc175e7c | 44 | #define FREE_REG_SET(REGSET) BITMAP_FREE (REGSET) |
04389919 | 45 | |
b1dbfa1d | 46 | /* Initialize a new regset. */ |
7932a3db | 47 | #define INIT_REG_SET(HEAD) bitmap_initialize (HEAD, ®_obstack) |
19d18142 RK |
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 | ||
d3a923ee RH |
55 | /* Compare two register sets. */ |
56 | #define REG_SET_EQUAL_P(A, B) bitmap_equal_p (A, B) | |
57 | ||
19d18142 | 58 | /* `and' a register set with a second register set. */ |
eb59b8de | 59 | #define AND_REG_SET(TO, FROM) bitmap_and_into (TO, FROM) |
19d18142 RK |
60 | |
61 | /* `and' the complement of a register set with a register set. */ | |
eb59b8de | 62 | #define AND_COMPL_REG_SET(TO, FROM) bitmap_and_compl_into (TO, FROM) |
19d18142 RK |
63 | |
64 | /* Inclusive or a register set with a second register set. */ | |
eb59b8de | 65 | #define IOR_REG_SET(TO, FROM) bitmap_ior_into (TO, FROM) |
19d18142 | 66 | |
d3a923ee | 67 | /* Exclusive or a register set with a second register set. */ |
eb59b8de | 68 | #define XOR_REG_SET(TO, FROM) bitmap_xor_into (TO, FROM) |
d3a923ee | 69 | |
19d18142 RK |
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) \ | |
eb59b8de | 72 | bitmap_ior_and_compl_into (TO, FROM1, FROM2) |
916b1701 MM |
73 | |
74 | /* Clear a single register in a register set. */ | |
19d18142 | 75 | #define CLEAR_REGNO_REG_SET(HEAD, REG) bitmap_clear_bit (HEAD, REG) |
916b1701 MM |
76 | |
77 | /* Set a single register in a register set. */ | |
19d18142 | 78 | #define SET_REGNO_REG_SET(HEAD, REG) bitmap_set_bit (HEAD, REG) |
916b1701 MM |
79 | |
80 | /* Return true if a register is set in a register set. */ | |
19d18142 | 81 | #define REGNO_REG_SET_P(TO, REG) bitmap_bit_p (TO, REG) |
916b1701 MM |
82 | |
83 | /* Copy the hard registers in a register set to the hard register set. */ | |
f55ade6e | 84 | extern void reg_set_to_hard_reg_set (HARD_REG_SET *, bitmap); |
916b1701 MM |
85 | #define REG_SET_TO_HARD_REG_SET(TO, FROM) \ |
86 | do { \ | |
916b1701 | 87 | CLEAR_HARD_REG_SET (TO); \ |
efc9bd41 | 88 | reg_set_to_hard_reg_set (&TO, FROM); \ |
916b1701 MM |
89 | } while (0) |
90 | ||
a2041967 KH |
91 | typedef bitmap_iterator reg_set_iterator; |
92 | ||
916b1701 | 93 | /* Loop over all registers in REGSET, starting with MIN, setting REGNUM to the |
eebedaa5 | 94 | register number and executing CODE for all registers that are set. */ |
a2041967 KH |
95 | #define EXECUTE_IF_SET_IN_REG_SET(REGSET, MIN, REGNUM, RSI) \ |
96 | EXECUTE_IF_SET_IN_BITMAP (REGSET, MIN, REGNUM, RSI) | |
916b1701 MM |
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 | |
eebedaa5 | 100 | set in the first regset and not set in the second. */ |
08a0c536 JJ |
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) | |
916b1701 | 103 | |
22fa5b8a MM |
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 | |
eebedaa5 | 106 | set in both regsets. */ |
a2041967 KH |
107 | #define EXECUTE_IF_AND_IN_REG_SET(REGSET1, REGSET2, MIN, REGNUM, RSI) \ |
108 | EXECUTE_IF_AND_IN_BITMAP (REGSET1, REGSET2, MIN, REGNUM, RSI) \ | |
22fa5b8a | 109 | |
4977bab6 ZW |
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 | |
32dd366d | 114 | makes those easy to detect. */ |
b2aec5c0 JH |
115 | typedef HOST_WIDEST_INT gcov_type; |
116 | ||
e881bb1b | 117 | /* Control flow edge information. */ |
628f6a4e | 118 | struct edge_def GTY(()) |
6de9cd9a | 119 | { |
e881bb1b | 120 | /* The two blocks at the ends of the edge. */ |
6de9cd9a DN |
121 | struct basic_block_def *src; |
122 | struct basic_block_def *dest; | |
e881bb1b RH |
123 | |
124 | /* Instructions queued on the edge. */ | |
6de9cd9a DN |
125 | union edge_def_insns { |
126 | rtx GTY ((tag ("0"))) r; | |
127 | tree GTY ((tag ("1"))) t; | |
128 | } GTY ((desc ("ir_type ()"))) insns; | |
e881bb1b RH |
129 | |
130 | /* Auxiliary info specific to a pass. */ | |
6de9cd9a | 131 | PTR GTY ((skip (""))) aux; |
3245eea0 | 132 | |
62b857ea | 133 | /* Location of any goto implicit in the edge, during tree-ssa. */ |
3c20847b | 134 | source_locus goto_locus; |
62b857ea | 135 | |
e881bb1b RH |
136 | int flags; /* see EDGE_* below */ |
137 | int probability; /* biased by REG_BR_PROB_BASE */ | |
b2aec5c0 | 138 | gcov_type count; /* Expected number of executions calculated |
51891abe | 139 | in profile.c */ |
73553871 KH |
140 | |
141 | /* The index number corresponding to this edge in the edge vector | |
142 | dest->preds. */ | |
143 | unsigned int dest_idx; | |
6de9cd9a DN |
144 | }; |
145 | ||
146 | typedef struct edge_def *edge; | |
d4e6fecb NS |
147 | DEF_VEC_P(edge); |
148 | DEF_VEC_ALLOC_P(edge,gc); | |
3245eea0 | 149 | |
6c208acd NS |
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 | |
4b7e68e7 | 159 | flow. */ |
35b07080 | 160 | #define EDGE_IRREDUCIBLE_LOOP 128 /* Part of irreducible loop. */ |
1722c2c8 | 161 | #define EDGE_SIBCALL 256 /* Edge from sibcall to exit. */ |
65f43cdf | 162 | #define EDGE_LOOP_EXIT 512 /* Exit of a loop. */ |
6de9cd9a | 163 | #define EDGE_TRUE_VALUE 1024 /* Edge taken when controlling |
b01d837f | 164 | predicate is nonzero. */ |
6de9cd9a DN |
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. */ | |
bd454efd SB |
169 | #define EDGE_CROSSING 8192 /* Edge crosses between hot |
170 | and cold sections, when we | |
171 | do partitioning. */ | |
172 | #define EDGE_ALL_FLAGS 16383 | |
3245eea0 | 173 | |
65b98a02 JW |
174 | #define EDGE_COMPLEX (EDGE_ABNORMAL | EDGE_ABNORMAL_CALL | EDGE_EH) |
175 | ||
cdb23767 | 176 | /* Counter summary from the last set of coverage counts read by |
71c0e7fc | 177 | profile.c. */ |
cdb23767 NS |
178 | extern const struct gcov_ctr_summary *profile_info; |
179 | ||
3d436d2a ZD |
180 | /* Declared in cfgloop.h. */ |
181 | struct loop; | |
182 | struct loops; | |
3245eea0 | 183 | |
4aab792d KH |
184 | /* Declared in tree-flow.h. */ |
185 | struct edge_prediction; | |
5e2d947c | 186 | struct rtl_bb_info; |
4aab792d | 187 | |
e68e3108 MM |
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. | |
b53978a3 JO |
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 | ||
e881bb1b | 213 | /* Basic block information indexed by block number. */ |
6de9cd9a DN |
214 | struct basic_block_def GTY((chain_next ("%h.next_bb"), chain_prev ("%h.prev_bb"))) |
215 | { | |
6de9cd9a DN |
216 | /* Pointers to the first and last trees of the block. */ |
217 | tree stmt_list; | |
2b1d9dc0 | 218 | |
e881bb1b | 219 | /* The edges into and out of the block. */ |
d4e6fecb NS |
220 | VEC(edge,gc) *preds; |
221 | VEC(edge,gc) *succs; | |
4d1d8045 | 222 | |
e881bb1b | 223 | /* Auxiliary info specific to a pass. */ |
6de9cd9a | 224 | PTR GTY ((skip (""))) aux; |
3245eea0 | 225 | |
076c7ab8 ZW |
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]; | |
336a6399 | 231 | |
918ed612 | 232 | /* Previous and next blocks in the chain. */ |
6de9cd9a DN |
233 | struct basic_block_def *prev_bb; |
234 | struct basic_block_def *next_bb; | |
918ed612 | 235 | |
5e2d947c JH |
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 | ||
4aab792d KH |
240 | /* Chain of PHI nodes for this block. */ |
241 | tree phi_nodes; | |
242 | ||
243 | /* A list of predictions. */ | |
244 | struct edge_prediction *predictions; | |
d47cc544 | 245 | |
52a11cbf | 246 | /* Expected number of executions: calculated in profile.c. */ |
b2aec5c0 | 247 | gcov_type count; |
7f8a2125 | 248 | |
076c7ab8 ZW |
249 | /* The index of this block. */ |
250 | int index; | |
251 | ||
252 | /* The loop depth of this block. */ | |
253 | int loop_depth; | |
254 | ||
861f9cd0 JH |
255 | /* Expected frequency. Normalized to be in range 0 to BB_FREQ_MAX. */ |
256 | int frequency; | |
006844a3 DN |
257 | |
258 | /* Various flags. See BB_* below. */ | |
259 | int flags; | |
6de9cd9a DN |
260 | }; |
261 | ||
5e2d947c JH |
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; | |
6de9cd9a | 273 | |
370369e1 JH |
274 | /* In CFGlayout mode points to insn notes/jumptables to be placed just before |
275 | and after the block. */ | |
6de9cd9a DN |
276 | rtx header; |
277 | rtx footer; | |
997de8ed | 278 | |
997de8ed | 279 | /* This field is used by the bb-reorder and tracer passes. */ |
6de9cd9a | 280 | int visited; |
997de8ed SB |
281 | }; |
282 | ||
370369e1 | 283 | typedef struct basic_block_def *basic_block; |
7f8a2125 | 284 | |
c71070ab KH |
285 | DEF_VEC_P(basic_block); |
286 | DEF_VEC_ALLOC_P(basic_block,gc); | |
287 | DEF_VEC_ALLOC_P(basic_block,heap); | |
288 | ||
861f9cd0 | 289 | #define BB_FREQ_MAX 10000 |
e881bb1b | 290 | |
740ce53d SB |
291 | /* Masks for basic_block.flags. |
292 | ||
740ce53d SB |
293 | BB_HOT_PARTITION and BB_COLD_PARTITION should be preserved throughout |
294 | the compilation, so they are never cleared. | |
295 | ||
296 | All other flags may be cleared by clear_bb_flags(). It is generally | |
297 | a bad idea to rely on any flags being up-to-date. */ | |
298 | ||
2dd2d53e | 299 | enum bb_flags |
9e32d2be | 300 | { |
740ce53d | 301 | |
9e32d2be ZD |
302 | /* Set if insns in BB have are modified. Used for updating liveness info. */ |
303 | BB_DIRTY = 1, | |
740ce53d | 304 | |
9e32d2be ZD |
305 | /* Only set on blocks that have just been created by create_bb. */ |
306 | BB_NEW = 2, | |
740ce53d | 307 | |
9e32d2be ZD |
308 | /* Set by find_unreachable_blocks. Do not rely on this being set in any |
309 | pass. */ | |
310 | BB_REACHABLE = 4, | |
740ce53d | 311 | |
9e32d2be ZD |
312 | /* Set for blocks in an irreducible loop by loop analysis. */ |
313 | BB_IRREDUCIBLE_LOOP = 8, | |
740ce53d | 314 | |
9e32d2be ZD |
315 | /* Set on blocks that may actually not be single-entry single-exit block. */ |
316 | BB_SUPERBLOCK = 16, | |
076c7ab8 | 317 | |
9e32d2be ZD |
318 | /* Set on basic blocks that the scheduler should not touch. This is used |
319 | by SMS to prevent other schedulers from messing with the loop schedule. */ | |
320 | BB_DISABLE_SCHEDULE = 32, | |
740ce53d | 321 | |
9e32d2be ZD |
322 | /* Set on blocks that should be put in a hot section. */ |
323 | BB_HOT_PARTITION = 64, | |
740ce53d | 324 | |
9e32d2be | 325 | /* Set on blocks that should be put in a cold section. */ |
6580ee77 JH |
326 | BB_COLD_PARTITION = 128, |
327 | ||
328 | /* Set on block that was duplicated. */ | |
5e2d947c JH |
329 | BB_DUPLICATED = 256, |
330 | ||
331 | /* Set on blocks that are in RTL format. */ | |
2dd2d53e SB |
332 | BB_RTL = 1024, |
333 | ||
334 | /* Set on blocks that are forwarder blocks. | |
335 | Only used in cfgcleanup.c. */ | |
336 | BB_FORWARDER_BLOCK = 2048, | |
337 | ||
338 | /* Set on blocks that cannot be threaded through. | |
339 | Only used in cfgcleanup.c. */ | |
340 | BB_NONTHREADABLE_BLOCK = 4096 | |
9e32d2be | 341 | }; |
740ce53d SB |
342 | |
343 | /* Dummy flag for convenience in the hot/cold partitioning code. */ | |
076c7ab8 | 344 | #define BB_UNPARTITIONED 0 |
006844a3 | 345 | |
750054a2 CT |
346 | /* Partitions, to be used when partitioning hot and cold basic blocks into |
347 | separate sections. */ | |
076c7ab8 | 348 | #define BB_PARTITION(bb) ((bb)->flags & (BB_HOT_PARTITION|BB_COLD_PARTITION)) |
51a904c9 ZW |
349 | #define BB_SET_PARTITION(bb, part) do { \ |
350 | basic_block bb_ = (bb); \ | |
351 | bb_->flags = ((bb_->flags & ~(BB_HOT_PARTITION|BB_COLD_PARTITION)) \ | |
352 | | (part)); \ | |
353 | } while (0) | |
354 | ||
076c7ab8 ZW |
355 | #define BB_COPY_PARTITION(dstbb, srcbb) \ |
356 | BB_SET_PARTITION (dstbb, BB_PARTITION (srcbb)) | |
750054a2 | 357 | |
997de8ed SB |
358 | /* A structure to group all the per-function control flow graph data. |
359 | The x_* prefixing is necessary because otherwise references to the | |
360 | fields of this struct are interpreted as the defines for backward | |
361 | source compatibility following the definition of this struct. */ | |
362 | struct control_flow_graph GTY(()) | |
363 | { | |
364 | /* Block pointers for the exit and entry of a function. | |
365 | These are always the head and tail of the basic block list. */ | |
366 | basic_block x_entry_block_ptr; | |
367 | basic_block x_exit_block_ptr; | |
368 | ||
369 | /* Index by basic block number, get basic block struct info. */ | |
68f9b844 | 370 | VEC(basic_block,gc) *x_basic_block_info; |
997de8ed SB |
371 | |
372 | /* Number of basic blocks in this flow graph. */ | |
373 | int x_n_basic_blocks; | |
e881bb1b | 374 | |
997de8ed SB |
375 | /* Number of edges in this flow graph. */ |
376 | int x_n_edges; | |
e881bb1b | 377 | |
997de8ed SB |
378 | /* The first free basic block number. */ |
379 | int x_last_basic_block; | |
d55bc081 | 380 | |
997de8ed SB |
381 | /* Mapping of labels to their associated blocks. At present |
382 | only used for the tree CFG. */ | |
e597f337 | 383 | VEC(basic_block,gc) *x_label_to_block_map; |
d55bc081 | 384 | |
997de8ed SB |
385 | enum profile_status { |
386 | PROFILE_ABSENT, | |
387 | PROFILE_GUESSED, | |
388 | PROFILE_READ | |
389 | } x_profile_status; | |
390 | }; | |
d3a923ee | 391 | |
997de8ed SB |
392 | /* Defines for accessing the fields of the CFG structure for function FN. */ |
393 | #define ENTRY_BLOCK_PTR_FOR_FUNCTION(FN) ((FN)->cfg->x_entry_block_ptr) | |
394 | #define EXIT_BLOCK_PTR_FOR_FUNCTION(FN) ((FN)->cfg->x_exit_block_ptr) | |
395 | #define basic_block_info_for_function(FN) ((FN)->cfg->x_basic_block_info) | |
396 | #define n_basic_blocks_for_function(FN) ((FN)->cfg->x_n_basic_blocks) | |
397 | #define n_edges_for_function(FN) ((FN)->cfg->x_n_edges) | |
398 | #define last_basic_block_for_function(FN) ((FN)->cfg->x_last_basic_block) | |
399 | #define label_to_block_map_for_function(FN) ((FN)->cfg->x_label_to_block_map) | |
400 | ||
401 | #define BASIC_BLOCK_FOR_FUNCTION(FN,N) \ | |
68f9b844 | 402 | (VEC_index (basic_block, basic_block_info_for_function(FN), (N))) |
997de8ed | 403 | |
f0e4ea10 | 404 | /* Defines for textual backward source compatibility. */ |
997de8ed SB |
405 | #define ENTRY_BLOCK_PTR (cfun->cfg->x_entry_block_ptr) |
406 | #define EXIT_BLOCK_PTR (cfun->cfg->x_exit_block_ptr) | |
407 | #define basic_block_info (cfun->cfg->x_basic_block_info) | |
408 | #define n_basic_blocks (cfun->cfg->x_n_basic_blocks) | |
409 | #define n_edges (cfun->cfg->x_n_edges) | |
410 | #define last_basic_block (cfun->cfg->x_last_basic_block) | |
411 | #define label_to_block_map (cfun->cfg->x_label_to_block_map) | |
412 | #define profile_status (cfun->cfg->x_profile_status) | |
413 | ||
68f9b844 KH |
414 | #define BASIC_BLOCK(N) (VEC_index (basic_block, basic_block_info, (N))) |
415 | #define SET_BASIC_BLOCK(N,BB) (VEC_replace (basic_block, basic_block_info, (N), (BB))) | |
d3a923ee | 416 | |
918ed612 ZD |
417 | /* For iterating over basic blocks. */ |
418 | #define FOR_BB_BETWEEN(BB, FROM, TO, DIR) \ | |
419 | for (BB = FROM; BB != TO; BB = BB->DIR) | |
420 | ||
997de8ed SB |
421 | #define FOR_EACH_BB_FN(BB, FN) \ |
422 | FOR_BB_BETWEEN (BB, (FN)->cfg->x_entry_block_ptr->next_bb, (FN)->cfg->x_exit_block_ptr, next_bb) | |
423 | ||
424 | #define FOR_EACH_BB(BB) FOR_EACH_BB_FN (BB, cfun) | |
918ed612 | 425 | |
997de8ed SB |
426 | #define FOR_EACH_BB_REVERSE_FN(BB, FN) \ |
427 | FOR_BB_BETWEEN (BB, (FN)->cfg->x_exit_block_ptr->prev_bb, (FN)->cfg->x_entry_block_ptr, prev_bb) | |
428 | ||
429 | #define FOR_EACH_BB_REVERSE(BB) FOR_EACH_BB_REVERSE_FN(BB, cfun) | |
918ed612 | 430 | |
50654f6c ZD |
431 | /* For iterating over insns in basic block. */ |
432 | #define FOR_BB_INSNS(BB, INSN) \ | |
433 | for ((INSN) = BB_HEAD (BB); \ | |
24bd1a0b | 434 | (INSN) && (INSN) != NEXT_INSN (BB_END (BB)); \ |
50654f6c ZD |
435 | (INSN) = NEXT_INSN (INSN)) |
436 | ||
437 | #define FOR_BB_INSNS_REVERSE(BB, INSN) \ | |
438 | for ((INSN) = BB_END (BB); \ | |
24bd1a0b | 439 | (INSN) && (INSN) != PREV_INSN (BB_HEAD (BB)); \ |
50654f6c ZD |
440 | (INSN) = PREV_INSN (INSN)) |
441 | ||
ed8d2920 MM |
442 | /* Cycles through _all_ basic blocks, even the fake ones (entry and |
443 | exit block). */ | |
444 | ||
445 | #define FOR_ALL_BB(BB) \ | |
446 | for (BB = ENTRY_BLOCK_PTR; BB; BB = BB->next_bb) | |
447 | ||
a930a4ef JH |
448 | #define FOR_ALL_BB_FN(BB, FN) \ |
449 | for (BB = ENTRY_BLOCK_PTR_FOR_FUNCTION (FN); BB; BB = BB->next_bb) | |
450 | ||
7932a3db | 451 | extern bitmap_obstack reg_obstack; |
402209ff | 452 | |
3245eea0 CH |
453 | /* Indexed by n, gives number of basic block that (REG n) is used in. |
454 | If the value is REG_BLOCK_GLOBAL (-2), | |
455 | it means (REG n) is used in more than one basic block. | |
456 | REG_BLOCK_UNKNOWN (-1) means it hasn't been seen yet so we don't know. | |
457 | This information remains valid for the rest of the compilation | |
458 | of the current function; it is used to control register allocation. */ | |
459 | ||
460 | #define REG_BLOCK_UNKNOWN -1 | |
461 | #define REG_BLOCK_GLOBAL -2 | |
b1f21e0a | 462 | |
1935e8a8 KH |
463 | #define REG_BASIC_BLOCK(N) \ |
464 | (VEC_index (reg_info_p, reg_n_info, N)->basic_block) | |
5ece9746 JL |
465 | \f |
466 | /* Stuff for recording basic block info. */ | |
467 | ||
5e2d947c JH |
468 | #define BB_HEAD(B) (B)->il.rtl->head_ |
469 | #define BB_END(B) (B)->il.rtl->end_ | |
2b1d9dc0 | 470 | |
5ece9746 | 471 | /* Special block numbers [markers] for entry and exit. */ |
24bd1a0b DB |
472 | #define ENTRY_BLOCK (0) |
473 | #define EXIT_BLOCK (1) | |
474 | ||
475 | /* The two blocks that are always in the cfg. */ | |
476 | #define NUM_FIXED_BLOCKS (2) | |
5ece9746 | 477 | |
b53978a3 | 478 | |
0b17ab2f | 479 | #define BLOCK_NUM(INSN) (BLOCK_FOR_INSN (INSN)->index + 0) |
ba4f7968 | 480 | #define set_block_for_insn(INSN, BB) (BLOCK_FOR_INSN (INSN) = BB) |
e881bb1b | 481 | |
f55ade6e | 482 | extern void compute_bb_for_insn (void); |
c2924966 | 483 | extern unsigned int free_bb_for_insn (void); |
f55ade6e | 484 | extern void update_bb_for_insn (basic_block); |
e881bb1b | 485 | |
bb8a619e | 486 | extern void free_basic_block_vars (void); |
52becdc0 | 487 | |
f55ade6e | 488 | extern void insert_insn_on_edge (rtx, edge); |
3dec4024 | 489 | |
f55ade6e AJ |
490 | extern void commit_edge_insertions (void); |
491 | extern void commit_edge_insertions_watch_calls (void); | |
492 | ||
493 | extern void remove_fake_edges (void); | |
6809cbf9 | 494 | extern void remove_fake_exit_edges (void); |
f55ade6e AJ |
495 | extern void add_noreturn_fake_exit_edges (void); |
496 | extern void connect_infinite_loops_to_exit (void); | |
f55ade6e | 497 | extern edge unchecked_make_edge (basic_block, basic_block, int); |
a6ee1a15 | 498 | extern edge cached_make_edge (sbitmap, basic_block, basic_block, int); |
f55ade6e AJ |
499 | extern edge make_edge (basic_block, basic_block, int); |
500 | extern edge make_single_succ_edge (basic_block, basic_block, int); | |
501 | extern void remove_edge (edge); | |
502 | extern void redirect_edge_succ (edge, basic_block); | |
503 | extern edge redirect_edge_succ_nodup (edge, basic_block); | |
504 | extern void redirect_edge_pred (edge, basic_block); | |
505 | extern basic_block create_basic_block_structure (rtx, rtx, rtx, basic_block); | |
506 | extern void clear_bb_flags (void); | |
f91a0beb KZ |
507 | extern int post_order_compute (int *, bool); |
508 | extern int pre_and_rev_post_order_compute (int *, int *, bool); | |
f55ade6e AJ |
509 | extern int dfs_enumerate_from (basic_block, int, |
510 | bool (*)(basic_block, void *), | |
511 | basic_block *, int, void *); | |
bd454efd | 512 | extern void compute_dominance_frontiers (bitmap *); |
a68e7e6c | 513 | extern void dump_bb_info (basic_block, bool, bool, int, const char *, FILE *); |
f55ade6e | 514 | extern void dump_edge_info (FILE *, edge, int); |
6de9cd9a | 515 | extern void brief_dump_cfg (FILE *); |
f55ade6e | 516 | extern void clear_edges (void); |
f55ade6e | 517 | extern rtx first_insn_after_basic_block_note (basic_block); |
33156717 JH |
518 | extern void scale_bbs_frequencies_int (basic_block *, int, int, int); |
519 | extern void scale_bbs_frequencies_gcov_type (basic_block *, int, gcov_type, | |
520 | gcov_type); | |
10c4b247 | 521 | |
c05ffc49 BS |
522 | /* Structure to group all of the information to process IF-THEN and |
523 | IF-THEN-ELSE blocks for the conditional execution support. This | |
524 | needs to be in a public file in case the IFCVT macros call | |
525 | functions passing the ce_if_block data structure. */ | |
526 | ||
527 | typedef struct ce_if_block | |
528 | { | |
529 | basic_block test_bb; /* First test block. */ | |
530 | basic_block then_bb; /* THEN block. */ | |
531 | basic_block else_bb; /* ELSE block or NULL. */ | |
532 | basic_block join_bb; /* Join THEN/ELSE blocks. */ | |
533 | basic_block last_test_bb; /* Last bb to hold && or || tests. */ | |
534 | int num_multiple_test_blocks; /* # of && and || basic blocks. */ | |
535 | int num_and_and_blocks; /* # of && blocks. */ | |
536 | int num_or_or_blocks; /* # of || blocks. */ | |
537 | int num_multiple_test_insns; /* # of insns in && and || blocks. */ | |
538 | int and_and_p; /* Complex test is &&. */ | |
539 | int num_then_insns; /* # of insns in THEN block. */ | |
540 | int num_else_insns; /* # of insns in ELSE block. */ | |
541 | int pass; /* Pass number. */ | |
542 | ||
543 | #ifdef IFCVT_EXTRA_FIELDS | |
544 | IFCVT_EXTRA_FIELDS /* Any machine dependent fields. */ | |
545 | #endif | |
546 | ||
547 | } ce_if_block_t; | |
548 | ||
410538ea | 549 | /* This structure maintains an edge list vector. */ |
7f8a2125 | 550 | struct edge_list |
410538ea AM |
551 | { |
552 | int num_blocks; | |
553 | int num_edges; | |
554 | edge *index_to_edge; | |
555 | }; | |
556 | ||
e42922b1 JH |
557 | /* The base value for branch probability notes and edge probabilities. */ |
558 | #define REG_BR_PROB_BASE 10000 | |
559 | ||
410538ea AM |
560 | /* This is the value which indicates no edge is present. */ |
561 | #define EDGE_INDEX_NO_EDGE -1 | |
562 | ||
563 | /* EDGE_INDEX returns an integer index for an edge, or EDGE_INDEX_NO_EDGE | |
564 | if there is no edge between the 2 basic blocks. */ | |
565 | #define EDGE_INDEX(el, pred, succ) (find_edge_index ((el), (pred), (succ))) | |
566 | ||
567 | /* INDEX_EDGE_PRED_BB and INDEX_EDGE_SUCC_BB return a pointer to the basic | |
568 | block which is either the pred or succ end of the indexed edge. */ | |
569 | #define INDEX_EDGE_PRED_BB(el, index) ((el)->index_to_edge[(index)]->src) | |
570 | #define INDEX_EDGE_SUCC_BB(el, index) ((el)->index_to_edge[(index)]->dest) | |
571 | ||
572 | /* INDEX_EDGE returns a pointer to the edge. */ | |
573 | #define INDEX_EDGE(el, index) ((el)->index_to_edge[(index)]) | |
574 | ||
575 | /* Number of edges in the compressed edge list. */ | |
576 | #define NUM_EDGES(el) ((el)->num_edges) | |
577 | ||
7a442791 | 578 | /* BB is assumed to contain conditional jump. Return the fallthru edge. */ |
628f6a4e BE |
579 | #define FALLTHRU_EDGE(bb) (EDGE_SUCC ((bb), 0)->flags & EDGE_FALLTHRU \ |
580 | ? EDGE_SUCC ((bb), 0) : EDGE_SUCC ((bb), 1)) | |
7a442791 JH |
581 | |
582 | /* BB is assumed to contain conditional jump. Return the branch edge. */ | |
628f6a4e BE |
583 | #define BRANCH_EDGE(bb) (EDGE_SUCC ((bb), 0)->flags & EDGE_FALLTHRU \ |
584 | ? EDGE_SUCC ((bb), 1) : EDGE_SUCC ((bb), 0)) | |
7a442791 | 585 | |
134d3a2e JH |
586 | /* Return expected execution frequency of the edge E. */ |
587 | #define EDGE_FREQUENCY(e) (((e)->src->frequency \ | |
588 | * (e)->probability \ | |
589 | + REG_BR_PROB_BASE / 2) \ | |
590 | / REG_BR_PROB_BASE) | |
591 | ||
4262e623 | 592 | /* Return nonzero if edge is critical. */ |
628f6a4e BE |
593 | #define EDGE_CRITICAL_P(e) (EDGE_COUNT ((e)->src->succs) >= 2 \ |
594 | && EDGE_COUNT ((e)->dest->preds) >= 2) | |
595 | ||
596 | #define EDGE_COUNT(ev) VEC_length (edge, (ev)) | |
597 | #define EDGE_I(ev,i) VEC_index (edge, (ev), (i)) | |
598 | #define EDGE_PRED(bb,i) VEC_index (edge, (bb)->preds, (i)) | |
599 | #define EDGE_SUCC(bb,i) VEC_index (edge, (bb)->succs, (i)) | |
600 | ||
c5cbcccf ZD |
601 | /* Returns true if BB has precisely one successor. */ |
602 | ||
603 | static inline bool | |
604 | single_succ_p (basic_block bb) | |
605 | { | |
606 | return EDGE_COUNT (bb->succs) == 1; | |
607 | } | |
608 | ||
609 | /* Returns true if BB has precisely one predecessor. */ | |
610 | ||
611 | static inline bool | |
612 | single_pred_p (basic_block bb) | |
613 | { | |
614 | return EDGE_COUNT (bb->preds) == 1; | |
615 | } | |
616 | ||
81b29e2f ZD |
617 | /* Returns the single successor edge of basic block BB. Aborts if |
618 | BB does not have exactly one successor. */ | |
c5cbcccf ZD |
619 | |
620 | static inline edge | |
621 | single_succ_edge (basic_block bb) | |
622 | { | |
623 | gcc_assert (single_succ_p (bb)); | |
624 | return EDGE_SUCC (bb, 0); | |
625 | } | |
626 | ||
81b29e2f ZD |
627 | /* Returns the single predecessor edge of basic block BB. Aborts |
628 | if BB does not have exactly one predecessor. */ | |
c5cbcccf ZD |
629 | |
630 | static inline edge | |
631 | single_pred_edge (basic_block bb) | |
632 | { | |
633 | gcc_assert (single_pred_p (bb)); | |
634 | return EDGE_PRED (bb, 0); | |
635 | } | |
636 | ||
81b29e2f ZD |
637 | /* Returns the single successor block of basic block BB. Aborts |
638 | if BB does not have exactly one successor. */ | |
c5cbcccf ZD |
639 | |
640 | static inline basic_block | |
641 | single_succ (basic_block bb) | |
642 | { | |
643 | return single_succ_edge (bb)->dest; | |
644 | } | |
645 | ||
81b29e2f ZD |
646 | /* Returns the single predecessor block of basic block BB. Aborts |
647 | if BB does not have exactly one predecessor.*/ | |
c5cbcccf ZD |
648 | |
649 | static inline basic_block | |
650 | single_pred (basic_block bb) | |
651 | { | |
652 | return single_pred_edge (bb)->src; | |
653 | } | |
654 | ||
628f6a4e BE |
655 | /* Iterator object for edges. */ |
656 | ||
657 | typedef struct { | |
658 | unsigned index; | |
d4e6fecb | 659 | VEC(edge,gc) **container; |
628f6a4e BE |
660 | } edge_iterator; |
661 | ||
d4e6fecb | 662 | static inline VEC(edge,gc) * |
f76ccf60 BE |
663 | ei_container (edge_iterator i) |
664 | { | |
665 | gcc_assert (i.container); | |
666 | return *i.container; | |
667 | } | |
668 | ||
669 | #define ei_start(iter) ei_start_1 (&(iter)) | |
670 | #define ei_last(iter) ei_last_1 (&(iter)) | |
671 | ||
628f6a4e BE |
672 | /* Return an iterator pointing to the start of an edge vector. */ |
673 | static inline edge_iterator | |
d4e6fecb | 674 | ei_start_1 (VEC(edge,gc) **ev) |
628f6a4e BE |
675 | { |
676 | edge_iterator i; | |
677 | ||
678 | i.index = 0; | |
679 | i.container = ev; | |
680 | ||
681 | return i; | |
682 | } | |
683 | ||
684 | /* Return an iterator pointing to the last element of an edge | |
471854f8 | 685 | vector. */ |
628f6a4e | 686 | static inline edge_iterator |
d4e6fecb | 687 | ei_last_1 (VEC(edge,gc) **ev) |
628f6a4e BE |
688 | { |
689 | edge_iterator i; | |
690 | ||
f76ccf60 | 691 | i.index = EDGE_COUNT (*ev) - 1; |
628f6a4e BE |
692 | i.container = ev; |
693 | ||
694 | return i; | |
695 | } | |
696 | ||
697 | /* Is the iterator `i' at the end of the sequence? */ | |
698 | static inline bool | |
699 | ei_end_p (edge_iterator i) | |
700 | { | |
f76ccf60 | 701 | return (i.index == EDGE_COUNT (ei_container (i))); |
628f6a4e BE |
702 | } |
703 | ||
704 | /* Is the iterator `i' at one position before the end of the | |
705 | sequence? */ | |
706 | static inline bool | |
707 | ei_one_before_end_p (edge_iterator i) | |
708 | { | |
f76ccf60 | 709 | return (i.index + 1 == EDGE_COUNT (ei_container (i))); |
628f6a4e BE |
710 | } |
711 | ||
712 | /* Advance the iterator to the next element. */ | |
713 | static inline void | |
714 | ei_next (edge_iterator *i) | |
715 | { | |
f76ccf60 | 716 | gcc_assert (i->index < EDGE_COUNT (ei_container (*i))); |
628f6a4e BE |
717 | i->index++; |
718 | } | |
719 | ||
720 | /* Move the iterator to the previous element. */ | |
721 | static inline void | |
722 | ei_prev (edge_iterator *i) | |
723 | { | |
724 | gcc_assert (i->index > 0); | |
725 | i->index--; | |
726 | } | |
727 | ||
728 | /* Return the edge pointed to by the iterator `i'. */ | |
729 | static inline edge | |
730 | ei_edge (edge_iterator i) | |
731 | { | |
f76ccf60 | 732 | return EDGE_I (ei_container (i), i.index); |
628f6a4e BE |
733 | } |
734 | ||
735 | /* Return an edge pointed to by the iterator. Do it safely so that | |
736 | NULL is returned when the iterator is pointing at the end of the | |
737 | sequence. */ | |
738 | static inline edge | |
739 | ei_safe_edge (edge_iterator i) | |
740 | { | |
741 | return !ei_end_p (i) ? ei_edge (i) : NULL; | |
742 | } | |
743 | ||
f3522a84 KH |
744 | /* Return 1 if we should continue to iterate. Return 0 otherwise. |
745 | *Edge P is set to the next edge if we are to continue to iterate | |
746 | and NULL otherwise. */ | |
747 | ||
748 | static inline bool | |
749 | ei_cond (edge_iterator ei, edge *p) | |
750 | { | |
751 | if (!ei_end_p (ei)) | |
752 | { | |
753 | *p = ei_edge (ei); | |
754 | return 1; | |
755 | } | |
756 | else | |
757 | { | |
758 | *p = NULL; | |
759 | return 0; | |
760 | } | |
761 | } | |
762 | ||
628f6a4e | 763 | /* This macro serves as a convenient way to iterate each edge in a |
c2b7c2d8 | 764 | vector of predecessor or successor edges. It must not be used when |
628f6a4e BE |
765 | an element might be removed during the traversal, otherwise |
766 | elements will be missed. Instead, use a for-loop like that shown | |
767 | in the following pseudo-code: | |
768 | ||
769 | FOR (ei = ei_start (bb->succs); (e = ei_safe_edge (ei)); ) | |
770 | { | |
771 | IF (e != taken_edge) | |
d0d2cc21 | 772 | remove_edge (e); |
628f6a4e BE |
773 | ELSE |
774 | ei_next (&ei); | |
775 | } | |
776 | */ | |
777 | ||
f3522a84 KH |
778 | #define FOR_EACH_EDGE(EDGE,ITER,EDGE_VEC) \ |
779 | for ((ITER) = ei_start ((EDGE_VEC)); \ | |
780 | ei_cond ((ITER), &(EDGE)); \ | |
628f6a4e | 781 | ei_next (&(ITER))) |
4262e623 | 782 | |
f55ade6e AJ |
783 | struct edge_list * create_edge_list (void); |
784 | void free_edge_list (struct edge_list *); | |
785 | void print_edge_list (FILE *, struct edge_list *); | |
786 | void verify_edge_list (FILE *, struct edge_list *); | |
787 | int find_edge_index (struct edge_list *, basic_block, basic_block); | |
6de9cd9a | 788 | edge find_edge (basic_block, basic_block); |
410538ea | 789 | |
49c3bb12 | 790 | |
d3a923ee RH |
791 | enum update_life_extent |
792 | { | |
715e7fbc RH |
793 | UPDATE_LIFE_LOCAL = 0, |
794 | UPDATE_LIFE_GLOBAL = 1, | |
5a425893 | 795 | UPDATE_LIFE_GLOBAL_RM_NOTES = 2 |
d3a923ee RH |
796 | }; |
797 | ||
49c3bb12 RH |
798 | /* Flags for life_analysis and update_life_info. */ |
799 | ||
800 | #define PROP_DEATH_NOTES 1 /* Create DEAD and UNUSED notes. */ | |
801 | #define PROP_LOG_LINKS 2 /* Create LOG_LINKS. */ | |
802 | #define PROP_REG_INFO 4 /* Update regs_ever_live et al. */ | |
803 | #define PROP_KILL_DEAD_CODE 8 /* Remove dead code. */ | |
804 | #define PROP_SCAN_DEAD_CODE 16 /* Scan for dead code. */ | |
11f68165 JW |
805 | #define PROP_ALLOW_CFG_CHANGES 32 /* Allow the CFG to be changed |
806 | by dead code removal. */ | |
807 | #define PROP_AUTOINC 64 /* Create autoinc mem references. */ | |
da190657 KH |
808 | #define PROP_SCAN_DEAD_STORES 128 /* Scan for dead code. */ |
809 | #define PROP_ASM_SCAN 256 /* Internal flag used within flow.c | |
df2ef49b | 810 | to flag analysis of asms. */ |
618656ff JR |
811 | #define PROP_DEAD_INSN 1024 /* Internal flag used within flow.c |
812 | to flag analysis of dead insn. */ | |
7d22e898 R |
813 | #define PROP_POST_REGSTACK 2048 /* We run after reg-stack and need |
814 | to preserve REG_DEAD notes for | |
815 | stack regs. */ | |
5149f070 JH |
816 | #define PROP_FINAL (PROP_DEATH_NOTES | PROP_LOG_LINKS \ |
817 | | PROP_REG_INFO | PROP_KILL_DEAD_CODE \ | |
818 | | PROP_SCAN_DEAD_CODE | PROP_AUTOINC \ | |
819 | | PROP_ALLOW_CFG_CHANGES \ | |
820 | | PROP_SCAN_DEAD_STORES) | |
23bd7a93 JH |
821 | #define PROP_POSTRELOAD (PROP_DEATH_NOTES \ |
822 | | PROP_KILL_DEAD_CODE \ | |
b4418614 | 823 | | PROP_SCAN_DEAD_CODE \ |
23bd7a93 | 824 | | PROP_SCAN_DEAD_STORES) |
5d6a16e2 | 825 | |
e0bb17a8 | 826 | #define CLEANUP_EXPENSIVE 1 /* Do relatively expensive optimizations |
46fac664 JH |
827 | except for edge forwarding */ |
828 | #define CLEANUP_CROSSJUMP 2 /* Do crossjumping. */ | |
829 | #define CLEANUP_POST_REGSTACK 4 /* We run after reg-stack and need | |
830 | to care REG_DEAD notes. */ | |
59994160 ZD |
831 | #define CLEANUP_UPDATE_LIFE 8 /* Keep life information up to date. */ |
832 | #define CLEANUP_THREADING 16 /* Do jump threading. */ | |
833 | #define CLEANUP_NO_INSN_DEL 32 /* Do not try to delete trivially dead | |
95479831 | 834 | insns. */ |
59994160 ZD |
835 | #define CLEANUP_CFGLAYOUT 64 /* Do cleanup in cfglayout mode. */ |
836 | #define CLEANUP_LOG_LINKS 128 /* Update log links. */ | |
6ce2bcb7 | 837 | |
7d22e898 R |
838 | /* The following are ORed in on top of the CLEANUP* flags in calls to |
839 | struct_equiv_block_eq. */ | |
59994160 ZD |
840 | #define STRUCT_EQUIV_START 256 /* Initializes the search range. */ |
841 | #define STRUCT_EQUIV_RERUN 512 /* Rerun to find register use in | |
7d22e898 | 842 | found equivalence. */ |
59994160 | 843 | #define STRUCT_EQUIV_FINAL 1024 /* Make any changes necessary to get |
7d22e898 | 844 | actual equivalence. */ |
59994160 | 845 | #define STRUCT_EQUIV_NEED_FULL_BLOCK 2048 /* struct_equiv_block_eq is required |
7d22e898 | 846 | to match only full blocks */ |
59994160 | 847 | #define STRUCT_EQUIV_MATCH_JUMPS 4096 /* Also include the jumps at the end of the block in the comparison. */ |
7d22e898 | 848 | |
10d22567 | 849 | extern void life_analysis (int); |
f55ade6e AJ |
850 | extern int update_life_info (sbitmap, enum update_life_extent, int); |
851 | extern int update_life_info_in_dirty_blocks (enum update_life_extent, int); | |
852 | extern int count_or_remove_death_notes (sbitmap, int); | |
853 | extern int propagate_block (basic_block, regset, regset, regset, int); | |
292f3869 RH |
854 | |
855 | struct propagate_block_info; | |
f55ade6e | 856 | extern rtx propagate_one_insn (struct propagate_block_info *, rtx); |
292f3869 | 857 | extern struct propagate_block_info *init_propagate_block_info |
f55ade6e AJ |
858 | (basic_block, regset, regset, regset, int); |
859 | extern void free_propagate_block_info (struct propagate_block_info *); | |
d3a923ee | 860 | |
077692c6 | 861 | /* In lcm.c */ |
10d22567 | 862 | extern struct edge_list *pre_edge_lcm (int, sbitmap *, sbitmap *, |
f55ade6e AJ |
863 | sbitmap *, sbitmap *, sbitmap **, |
864 | sbitmap **); | |
10d22567 | 865 | extern struct edge_list *pre_edge_rev_lcm (int, sbitmap *, |
f55ade6e AJ |
866 | sbitmap *, sbitmap *, |
867 | sbitmap *, sbitmap **, | |
868 | sbitmap **); | |
869 | extern void compute_available (sbitmap *, sbitmap *, sbitmap *, sbitmap *); | |
a05924f9 | 870 | |
f1ebdfc5 | 871 | /* In predict.c */ |
f55ade6e AJ |
872 | extern void expected_value_to_br_prob (void); |
873 | extern bool maybe_hot_bb_p (basic_block); | |
874 | extern bool probably_cold_bb_p (basic_block); | |
875 | extern bool probably_never_executed_bb_p (basic_block); | |
6de9cd9a DN |
876 | extern bool tree_predicted_by_p (basic_block, enum br_predictor); |
877 | extern bool rtl_predicted_by_p (basic_block, enum br_predictor); | |
878 | extern void tree_predict_edge (edge, enum br_predictor, int); | |
879 | extern void rtl_predict_edge (edge, enum br_predictor, int); | |
880 | extern void predict_edge_def (edge, enum br_predictor, enum prediction); | |
87022a6b | 881 | extern void guess_outgoing_edge_probabilities (basic_block); |
3809e990 | 882 | extern void remove_predictions_associated_with_edge (edge); |
f1ebdfc5 | 883 | |
11bdd2ae | 884 | /* In flow.c */ |
f55ade6e | 885 | extern void init_flow (void); |
f55ade6e AJ |
886 | extern void debug_bb (basic_block); |
887 | extern basic_block debug_bb_n (int); | |
888 | extern void dump_regset (regset, FILE *); | |
889 | extern void debug_regset (regset); | |
890 | extern void allocate_reg_life_data (void); | |
f55ade6e AJ |
891 | extern void expunge_block (basic_block); |
892 | extern void link_block (basic_block, basic_block); | |
893 | extern void unlink_block (basic_block); | |
894 | extern void compact_blocks (void); | |
895 | extern basic_block alloc_block (void); | |
896 | extern void find_unreachable_blocks (void); | |
827c06b6 | 897 | extern int delete_noop_moves (void); |
f55ade6e AJ |
898 | extern basic_block force_nonfallthru (edge); |
899 | extern rtx block_label (basic_block); | |
900 | extern bool forwarder_block_p (basic_block); | |
25cd19de | 901 | extern bool purge_all_dead_edges (void); |
f55ade6e | 902 | extern bool purge_dead_edges (basic_block); |
f55ade6e | 903 | extern void find_many_sub_basic_blocks (sbitmap); |
a6ee1a15 | 904 | extern void rtl_make_eh_edge (sbitmap, basic_block, rtx); |
f55ade6e | 905 | extern bool can_fallthru (basic_block, basic_block); |
623a66fa | 906 | extern bool could_fall_through (basic_block, basic_block); |
f55ade6e AJ |
907 | extern void flow_nodes_print (const char *, const sbitmap, FILE *); |
908 | extern void flow_edge_list_print (const char *, const edge *, int, FILE *); | |
909 | extern void alloc_aux_for_block (basic_block, int); | |
910 | extern void alloc_aux_for_blocks (int); | |
911 | extern void clear_aux_for_blocks (void); | |
912 | extern void free_aux_for_blocks (void); | |
913 | extern void alloc_aux_for_edge (edge, int); | |
914 | extern void alloc_aux_for_edges (int); | |
915 | extern void clear_aux_for_edges (void); | |
916 | extern void free_aux_for_edges (void); | |
2e09ee33 | 917 | extern void find_basic_blocks (rtx); |
6de9cd9a DN |
918 | extern bool cleanup_cfg (int); |
919 | extern bool delete_unreachable_blocks (void); | |
920 | extern bool merge_seq_blocks (void); | |
11bdd2ae | 921 | |
4e872036 AS |
922 | typedef struct conflict_graph_def *conflict_graph; |
923 | ||
924 | /* Callback function when enumerating conflicts. The arguments are | |
925 | the smaller and larger regno in the conflict. Returns zero if | |
da7d8304 | 926 | enumeration is to continue, nonzero to halt enumeration. */ |
f55ade6e | 927 | typedef int (*conflict_graph_enum_fn) (int, int, void *); |
4e872036 AS |
928 | |
929 | ||
930 | /* Prototypes of operations on conflict graphs. */ | |
931 | ||
7f8a2125 | 932 | extern conflict_graph conflict_graph_new |
f55ade6e AJ |
933 | (int); |
934 | extern void conflict_graph_delete (conflict_graph); | |
935 | extern int conflict_graph_add (conflict_graph, int, int); | |
936 | extern int conflict_graph_conflict_p (conflict_graph, int, int); | |
937 | extern void conflict_graph_enum (conflict_graph, int, conflict_graph_enum_fn, | |
938 | void *); | |
939 | extern void conflict_graph_merge_regs (conflict_graph, int, int); | |
940 | extern void conflict_graph_print (conflict_graph, FILE*); | |
f55ade6e AJ |
941 | extern bool mark_dfs_back_edges (void); |
942 | extern void set_edge_can_fallthru_flag (void); | |
943 | extern void update_br_prob_note (basic_block); | |
944 | extern void fixup_abnormal_edges (void); | |
f55ade6e AJ |
945 | extern bool inside_basic_block_p (rtx); |
946 | extern bool control_flow_insn_p (rtx); | |
11bdd2ae | 947 | |
4682ae04 | 948 | /* In bb-reorder.c */ |
35b6b437 | 949 | extern void reorder_basic_blocks (unsigned int); |
4682ae04 | 950 | |
f8032688 MM |
951 | /* In dominance.c */ |
952 | ||
953 | enum cdi_direction | |
954 | { | |
955 | CDI_DOMINATORS, | |
956 | CDI_POST_DOMINATORS | |
957 | }; | |
958 | ||
d47cc544 SB |
959 | enum dom_state |
960 | { | |
961 | DOM_NONE, /* Not computed at all. */ | |
d47cc544 SB |
962 | DOM_NO_FAST_QUERY, /* The data is OK, but the fast query data are not usable. */ |
963 | DOM_OK /* Everything is ok. */ | |
964 | }; | |
965 | ||
966 | extern enum dom_state dom_computed[2]; | |
967 | ||
fce22de5 | 968 | extern bool dom_info_available_p (enum cdi_direction); |
d47cc544 SB |
969 | extern void calculate_dominance_info (enum cdi_direction); |
970 | extern void free_dominance_info (enum cdi_direction); | |
971 | extern basic_block nearest_common_dominator (enum cdi_direction, | |
f55ade6e | 972 | basic_block, basic_block); |
0bca51f0 DN |
973 | extern basic_block nearest_common_dominator_for_set (enum cdi_direction, |
974 | bitmap); | |
d47cc544 | 975 | extern void set_immediate_dominator (enum cdi_direction, basic_block, |
f55ade6e | 976 | basic_block); |
d47cc544 SB |
977 | extern basic_block get_immediate_dominator (enum cdi_direction, basic_block); |
978 | extern bool dominated_by_p (enum cdi_direction, basic_block, basic_block); | |
979 | extern int get_dominated_by (enum cdi_direction, basic_block, basic_block **); | |
42759f1e ZD |
980 | extern unsigned get_dominated_by_region (enum cdi_direction, basic_block *, |
981 | unsigned, basic_block *); | |
d47cc544 SB |
982 | extern void add_to_dominance_info (enum cdi_direction, basic_block); |
983 | extern void delete_from_dominance_info (enum cdi_direction, basic_block); | |
984 | basic_block recount_dominator (enum cdi_direction, basic_block); | |
985 | extern void redirect_immediate_dominators (enum cdi_direction, basic_block, | |
f55ade6e | 986 | basic_block); |
d47cc544 SB |
987 | extern void iterate_fix_dominators (enum cdi_direction, basic_block *, int); |
988 | extern void verify_dominators (enum cdi_direction); | |
989 | extern basic_block first_dom_son (enum cdi_direction, basic_block); | |
990 | extern basic_block next_dom_son (enum cdi_direction, basic_block); | |
6de9cd9a | 991 | extern edge try_redirect_by_replacing_jump (edge, basic_block, bool); |
12c3874e | 992 | extern void break_superblocks (void); |
878f99d2 | 993 | extern void check_bb_profile (basic_block, FILE *); |
15db5571 | 994 | extern void update_bb_profile_for_threading (basic_block, int, gcov_type, edge); |
5e2d947c | 995 | extern void init_rtl_bb_info (basic_block); |
9ee634e3 | 996 | |
6580ee77 JH |
997 | extern void initialize_original_copy_tables (void); |
998 | extern void free_original_copy_tables (void); | |
999 | extern void set_bb_original (basic_block, basic_block); | |
1000 | extern basic_block get_bb_original (basic_block); | |
1001 | extern void set_bb_copy (basic_block, basic_block); | |
1002 | extern basic_block get_bb_copy (basic_block); | |
1003 | ||
8cd37d0b RL |
1004 | extern rtx insert_insn_end_bb_new (rtx, basic_block); |
1005 | ||
9ee634e3 JH |
1006 | #include "cfghooks.h" |
1007 | ||
7f416ffb | 1008 | /* In struct-equiv.c */ |
7d22e898 R |
1009 | |
1010 | /* Constants used to size arrays in struct equiv_info (currently only one). | |
1011 | When these limits are exceeded, struct_equiv returns zero. | |
1012 | The maximum number of pseudo registers that are different in the two blocks, | |
1013 | but appear in equivalent places and are dead at the end (or where one of | |
1014 | a pair is dead at the end). */ | |
1015 | #define STRUCT_EQUIV_MAX_LOCAL 16 | |
1016 | /* The maximum number of references to an input register that struct_equiv | |
1017 | can handle. */ | |
1018 | ||
1019 | /* Structure used to track state during struct_equiv that can be rolled | |
1020 | back when we find we can't match an insn, or if we want to match part | |
1021 | of it in a different way. | |
1022 | This information pertains to the pair of partial blocks that has been | |
1023 | matched so far. Since this pair is structurally equivalent, this is | |
1024 | conceptually just one partial block expressed in two potentially | |
1025 | different ways. */ | |
1026 | struct struct_equiv_checkpoint | |
1027 | { | |
1028 | int ninsns; /* Insns are matched so far. */ | |
1029 | int local_count; /* Number of block-local registers. */ | |
1030 | int input_count; /* Number of inputs to the block. */ | |
1031 | ||
1032 | /* X_START and Y_START are the first insns (in insn stream order) | |
1033 | of the partial blocks that have been considered for matching so far. | |
1034 | Since we are scanning backwards, they are also the instructions that | |
1035 | are currently considered - or the last ones that have been considered - | |
1036 | for matching (Unless we tracked back to these because a preceding | |
1037 | instruction failed to match). */ | |
1038 | rtx x_start, y_start; | |
1039 | ||
1040 | /* INPUT_VALID indicates if we have actually set up X_INPUT / Y_INPUT | |
1041 | during the current pass; we keep X_INPUT / Y_INPUT around between passes | |
1042 | so that we can match REG_EQUAL / REG_EQUIV notes referring to these. */ | |
1043 | bool input_valid; | |
1044 | ||
1045 | /* Some information would be expensive to exactly checkpoint, so we | |
1046 | merely increment VERSION any time information about local | |
1047 | registers, inputs and/or register liveness changes. When backtracking, | |
1048 | it is decremented for changes that can be undone, and if a discrepancy | |
1049 | remains, NEED_RERUN in the relevant struct equiv_info is set to indicate | |
1050 | that a new pass should be made over the entire block match to get | |
1051 | accurate register information. */ | |
1052 | int version; | |
1053 | }; | |
1054 | ||
1055 | /* A struct equiv_info is used to pass information to struct_equiv and | |
1056 | to gather state while two basic blocks are checked for structural | |
1057 | equivalence. */ | |
1058 | ||
1059 | struct equiv_info | |
1060 | { | |
1061 | /* Fields set up by the caller to struct_equiv_block_eq */ | |
1062 | ||
1063 | basic_block x_block, y_block; /* The two blocks being matched. */ | |
1064 | ||
1065 | /* MODE carries the mode bits from cleanup_cfg if we are called from | |
1066 | try_crossjump_to_edge, and additionally it carries the | |
1067 | STRUCT_EQUIV_* bits described above. */ | |
1068 | int mode; | |
1069 | ||
1070 | /* INPUT_COST is the cost that adding an extra input to the matched blocks | |
1071 | is supposed to have, and is taken into account when considering if the | |
1072 | matched sequence should be extended backwards. input_cost < 0 means | |
1073 | don't accept any inputs at all. */ | |
1074 | int input_cost; | |
1075 | ||
1076 | ||
1077 | /* Fields to track state inside of struct_equiv_block_eq. Some of these | |
1078 | are also outputs. */ | |
1079 | ||
1080 | /* X_INPUT and Y_INPUT are used by struct_equiv to record a register that | |
1081 | is used as an input parameter, i.e. where different registers are used | |
1082 | as sources. This is only used for a register that is live at the end | |
1083 | of the blocks, or in some identical code at the end of the blocks; | |
1084 | Inputs that are dead at the end go into X_LOCAL / Y_LOCAL. */ | |
1085 | rtx x_input, y_input; | |
1086 | /* When a previous pass has identified a valid input, INPUT_REG is set | |
1087 | by struct_equiv_block_eq, and it is henceforth replaced in X_BLOCK | |
1088 | for the input. */ | |
1089 | rtx input_reg; | |
1090 | ||
1091 | /* COMMON_LIVE keeps track of the registers which are currently live | |
1092 | (as we scan backwards from the end) and have the same numbers in both | |
1093 | blocks. N.B. a register that is in common_live is unsuitable to become | |
1094 | a local reg. */ | |
1095 | regset common_live; | |
1096 | /* Likewise, X_LOCAL_LIVE / Y_LOCAL_LIVE keep track of registers that are | |
1097 | local to one of the blocks; these registers must not be accepted as | |
1098 | identical when encountered in both blocks. */ | |
1099 | regset x_local_live, y_local_live; | |
1100 | ||
1101 | /* EQUIV_USED indicates for which insns a REG_EQUAL or REG_EQUIV note is | |
1102 | being used, to avoid having to backtrack in the next pass, so that we | |
1103 | get accurate life info for this insn then. For each such insn, | |
1104 | the bit with the number corresponding to the CUR.NINSNS value at the | |
1105 | time of scanning is set. */ | |
1106 | bitmap equiv_used; | |
1107 | ||
1108 | /* Current state that can be saved & restored easily. */ | |
1109 | struct struct_equiv_checkpoint cur; | |
1110 | /* BEST_MATCH is used to store the best match so far, weighing the | |
1111 | cost of matched insns COSTS_N_INSNS (CUR.NINSNS) against the cost | |
1112 | CUR.INPUT_COUNT * INPUT_COST of setting up the inputs. */ | |
1113 | struct struct_equiv_checkpoint best_match; | |
1114 | /* If a checkpoint restore failed, or an input conflict newly arises, | |
1115 | NEED_RERUN is set. This has to be tested by the caller to re-run | |
1116 | the comparison if the match appears otherwise sound. The state kept in | |
1117 | x_start, y_start, equiv_used and check_input_conflict ensures that | |
6416ae7f | 1118 | we won't loop indefinitely. */ |
7d22e898 R |
1119 | bool need_rerun; |
1120 | /* If there is indication of an input conflict at the end, | |
1121 | CHECK_INPUT_CONFLICT is set so that we'll check for input conflicts | |
1122 | for each insn in the next pass. This is needed so that we won't discard | |
1123 | a partial match if there is a longer match that has to be abandoned due | |
1124 | to an input conflict. */ | |
1125 | bool check_input_conflict; | |
1126 | /* HAD_INPUT_CONFLICT is set if CHECK_INPUT_CONFLICT was already set and we | |
1127 | have passed a point where there were multiple dying inputs. This helps | |
1128 | us decide if we should set check_input_conflict for the next pass. */ | |
1129 | bool had_input_conflict; | |
1130 | ||
1131 | /* LIVE_UPDATE controls if we want to change any life info at all. We | |
1132 | set it to false during REG_EQUAL / REG_EUQIV note comparison of the final | |
1133 | pass so that we don't introduce new registers just for the note; if we | |
1134 | can't match the notes without the current register information, we drop | |
1135 | them. */ | |
1136 | bool live_update; | |
1137 | ||
1138 | /* X_LOCAL and Y_LOCAL are used to gather register numbers of register pairs | |
1139 | that are local to X_BLOCK and Y_BLOCK, with CUR.LOCAL_COUNT being the index | |
1140 | to the next free entry. */ | |
1141 | rtx x_local[STRUCT_EQUIV_MAX_LOCAL], y_local[STRUCT_EQUIV_MAX_LOCAL]; | |
1142 | /* LOCAL_RVALUE is nonzero if the corresponding X_LOCAL / Y_LOCAL entry | |
1143 | was a source operand (including STRICT_LOW_PART) for the last invocation | |
1144 | of struct_equiv mentioning it, zero if it was a destination-only operand. | |
1145 | Since we are scanning backwards, this means the register is input/local | |
1146 | for the (partial) block scanned so far. */ | |
1147 | bool local_rvalue[STRUCT_EQUIV_MAX_LOCAL]; | |
1148 | ||
1149 | ||
1150 | /* Additional fields that are computed for the convenience of the caller. */ | |
1151 | ||
1152 | /* DYING_INPUTS is set to the number of local registers that turn out | |
1153 | to be inputs to the (possibly partial) block. */ | |
1154 | int dying_inputs; | |
1155 | /* X_END and Y_END are the last insns in X_BLOCK and Y_BLOCK, respectively, | |
1156 | that are being compared. A final jump insn will not be included. */ | |
1157 | rtx x_end, y_end; | |
1158 | ||
6416ae7f | 1159 | /* If we are matching tablejumps, X_LABEL in X_BLOCK corresponds to |
7d22e898 R |
1160 | Y_LABEL in Y_BLOCK. */ |
1161 | rtx x_label, y_label; | |
1162 | ||
1163 | }; | |
1164 | ||
1165 | extern bool insns_match_p (rtx, rtx, struct equiv_info *); | |
1166 | extern int struct_equiv_block_eq (int, struct equiv_info *); | |
1167 | extern bool struct_equiv_init (int, struct equiv_info *); | |
1168 | extern bool rtx_equiv_p (rtx *, rtx, int, struct equiv_info *); | |
1169 | ||
1170 | /* In cfgrtl.c */ | |
1171 | extern bool condjump_equiv_p (struct equiv_info *, bool); | |
7f416ffb | 1172 | |
88657302 | 1173 | #endif /* GCC_BASIC_BLOCK_H */ |