]>
Commit | Line | Data |
---|---|---|
cb20f7e8 | 1 | /* RTL-level loop invariant motion. |
5624e564 | 2 | Copyright (C) 2004-2015 Free Software Foundation, Inc. |
cb20f7e8 | 3 | |
5e962776 | 4 | This file is part of GCC. |
cb20f7e8 | 5 | |
5e962776 ZD |
6 | GCC is free software; you can redistribute it and/or modify it |
7 | under the terms of the GNU General Public License as published by the | |
9dcd6f09 | 8 | Free Software Foundation; either version 3, or (at your option) any |
5e962776 | 9 | later version. |
cb20f7e8 | 10 | |
5e962776 ZD |
11 | GCC is distributed in the hope that it will be useful, but WITHOUT |
12 | ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or | |
13 | FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License | |
14 | for more details. | |
cb20f7e8 | 15 | |
5e962776 | 16 | You should have received a copy of the GNU General Public License |
9dcd6f09 NC |
17 | along with GCC; see the file COPYING3. If not see |
18 | <http://www.gnu.org/licenses/>. */ | |
5e962776 ZD |
19 | |
20 | /* This implements the loop invariant motion pass. It is very simple | |
4a8cae83 SB |
21 | (no calls, no loads/stores, etc.). This should be sufficient to cleanup |
22 | things like address arithmetics -- other more complicated invariants should | |
23 | be eliminated on GIMPLE either in tree-ssa-loop-im.c or in tree-ssa-pre.c. | |
cb20f7e8 | 24 | |
5e962776 ZD |
25 | We proceed loop by loop -- it is simpler than trying to handle things |
26 | globally and should not lose much. First we inspect all sets inside loop | |
27 | and create a dependency graph on insns (saying "to move this insn, you must | |
28 | also move the following insns"). | |
29 | ||
30 | We then need to determine what to move. We estimate the number of registers | |
31 | used and move as many invariants as possible while we still have enough free | |
32 | registers. We prefer the expensive invariants. | |
cb20f7e8 | 33 | |
5e962776 ZD |
34 | Then we move the selected invariants out of the loop, creating a new |
35 | temporaries for them if necessary. */ | |
36 | ||
37 | #include "config.h" | |
38 | #include "system.h" | |
39 | #include "coretypes.h" | |
40 | #include "tm.h" | |
1833192f | 41 | #include "hard-reg-set.h" |
5e962776 | 42 | #include "rtl.h" |
3912d291 | 43 | #include "tm_p.h" |
7932a3db | 44 | #include "obstack.h" |
60393bbc AM |
45 | #include "predict.h" |
46 | #include "vec.h" | |
83685514 AM |
47 | #include "hashtab.h" |
48 | #include "hash-set.h" | |
83685514 AM |
49 | #include "machmode.h" |
50 | #include "input.h" | |
5e962776 | 51 | #include "function.h" |
60393bbc AM |
52 | #include "dominance.h" |
53 | #include "cfg.h" | |
54 | #include "cfgrtl.h" | |
55 | #include "basic-block.h" | |
56 | #include "cfgloop.h" | |
40e23961 | 57 | #include "symtab.h" |
36566b39 PK |
58 | #include "flags.h" |
59 | #include "statistics.h" | |
60 | #include "double-int.h" | |
61 | #include "real.h" | |
62 | #include "fixed-value.h" | |
63 | #include "alias.h" | |
64 | #include "wide-int.h" | |
65 | #include "inchash.h" | |
66 | #include "tree.h" | |
67 | #include "insn-config.h" | |
68 | #include "expmed.h" | |
69 | #include "dojump.h" | |
70 | #include "explow.h" | |
71 | #include "calls.h" | |
72 | #include "emit-rtl.h" | |
73 | #include "varasm.h" | |
74 | #include "stmt.h" | |
60393bbc AM |
75 | #include "expr.h" |
76 | #include "recog.h" | |
77 | #include "target.h" | |
5e962776 | 78 | #include "df.h" |
4a8fb1a1 | 79 | #include "hash-table.h" |
28749cfb | 80 | #include "except.h" |
b1fb9f56 | 81 | #include "params.h" |
1833192f VM |
82 | #include "regs.h" |
83 | #include "ira.h" | |
7ee2468b | 84 | #include "dumpfile.h" |
5e962776 ZD |
85 | |
86 | /* The data stored for the loop. */ | |
87 | ||
88 | struct loop_data | |
89 | { | |
90 | struct loop *outermost_exit; /* The outermost exit of the loop. */ | |
91 | bool has_call; /* True if the loop contains a call. */ | |
1833192f | 92 | /* Maximal register pressure inside loop for given register class |
1756cb66 | 93 | (defined only for the pressure classes). */ |
1833192f VM |
94 | int max_reg_pressure[N_REG_CLASSES]; |
95 | /* Loop regs referenced and live pseudo-registers. */ | |
96 | bitmap_head regs_ref; | |
97 | bitmap_head regs_live; | |
5e962776 ZD |
98 | }; |
99 | ||
100 | #define LOOP_DATA(LOOP) ((struct loop_data *) (LOOP)->aux) | |
101 | ||
102 | /* The description of an use. */ | |
103 | ||
104 | struct use | |
105 | { | |
106 | rtx *pos; /* Position of the use. */ | |
89bfd6f5 | 107 | rtx_insn *insn; /* The insn in that the use occurs. */ |
1bfdbb29 | 108 | unsigned addr_use_p; /* Whether the use occurs in an address. */ |
5e962776 ZD |
109 | struct use *next; /* Next use in the list. */ |
110 | }; | |
111 | ||
112 | /* The description of a def. */ | |
113 | ||
114 | struct def | |
115 | { | |
116 | struct use *uses; /* The list of uses that are uniquely reached | |
117 | by it. */ | |
118 | unsigned n_uses; /* Number of such uses. */ | |
1bfdbb29 | 119 | unsigned n_addr_uses; /* Number of uses in addresses. */ |
5e962776 ZD |
120 | unsigned invno; /* The corresponding invariant. */ |
121 | }; | |
122 | ||
123 | /* The data stored for each invariant. */ | |
124 | ||
125 | struct invariant | |
126 | { | |
127 | /* The number of the invariant. */ | |
128 | unsigned invno; | |
129 | ||
1052bd54 ZD |
130 | /* The number of the invariant with the same value. */ |
131 | unsigned eqto; | |
132 | ||
e42e3d15 ZC |
133 | /* The number of invariants which eqto this. */ |
134 | unsigned eqno; | |
135 | ||
1052bd54 ZD |
136 | /* If we moved the invariant out of the loop, the register that contains its |
137 | value. */ | |
138 | rtx reg; | |
5e962776 | 139 | |
1833192f VM |
140 | /* If we moved the invariant out of the loop, the original regno |
141 | that contained its value. */ | |
142 | int orig_regno; | |
143 | ||
5e962776 ZD |
144 | /* The definition of the invariant. */ |
145 | struct def *def; | |
146 | ||
147 | /* The insn in that it is defined. */ | |
89bfd6f5 | 148 | rtx_insn *insn; |
5e962776 ZD |
149 | |
150 | /* Whether it is always executed. */ | |
151 | bool always_executed; | |
152 | ||
153 | /* Whether to move the invariant. */ | |
154 | bool move; | |
155 | ||
1bfdbb29 PB |
156 | /* Whether the invariant is cheap when used as an address. */ |
157 | bool cheap_address; | |
158 | ||
cb20f7e8 | 159 | /* Cost of the invariant. */ |
5e962776 ZD |
160 | unsigned cost; |
161 | ||
162 | /* The invariants it depends on. */ | |
163 | bitmap depends_on; | |
164 | ||
165 | /* Used for detecting already visited invariants during determining | |
166 | costs of movements. */ | |
167 | unsigned stamp; | |
168 | }; | |
169 | ||
1833192f VM |
170 | /* Currently processed loop. */ |
171 | static struct loop *curr_loop; | |
172 | ||
6fb5fa3c DB |
173 | /* Table of invariants indexed by the df_ref uid field. */ |
174 | ||
175 | static unsigned int invariant_table_size = 0; | |
176 | static struct invariant ** invariant_table; | |
177 | ||
1052bd54 ZD |
178 | /* Entry for hash table of invariant expressions. */ |
179 | ||
180 | struct invariant_expr_entry | |
181 | { | |
182 | /* The invariant. */ | |
183 | struct invariant *inv; | |
184 | ||
185 | /* Its value. */ | |
186 | rtx expr; | |
187 | ||
188 | /* Its mode. */ | |
ef4bddc2 | 189 | machine_mode mode; |
1052bd54 ZD |
190 | |
191 | /* Its hash. */ | |
192 | hashval_t hash; | |
193 | }; | |
194 | ||
5e962776 ZD |
195 | /* The actual stamp for marking already visited invariants during determining |
196 | costs of movements. */ | |
197 | ||
198 | static unsigned actual_stamp; | |
199 | ||
edd954e6 KH |
200 | typedef struct invariant *invariant_p; |
201 | ||
edd954e6 | 202 | |
5e962776 ZD |
203 | /* The invariants. */ |
204 | ||
9771b263 | 205 | static vec<invariant_p> invariants; |
5e962776 | 206 | |
6fb5fa3c | 207 | /* Check the size of the invariant table and realloc if necessary. */ |
cb20f7e8 | 208 | |
b8698a0f | 209 | static void |
6fb5fa3c DB |
210 | check_invariant_table_size (void) |
211 | { | |
c3284718 | 212 | if (invariant_table_size < DF_DEFS_TABLE_SIZE ()) |
6fb5fa3c DB |
213 | { |
214 | unsigned int new_size = DF_DEFS_TABLE_SIZE () + (DF_DEFS_TABLE_SIZE () / 4); | |
d3bfe4de | 215 | invariant_table = XRESIZEVEC (struct invariant *, invariant_table, new_size); |
b8698a0f | 216 | memset (&invariant_table[invariant_table_size], 0, |
92cfe9d5 | 217 | (new_size - invariant_table_size) * sizeof (struct invariant *)); |
6fb5fa3c DB |
218 | invariant_table_size = new_size; |
219 | } | |
220 | } | |
cb20f7e8 | 221 | |
5e962776 ZD |
222 | /* Test for possibility of invariantness of X. */ |
223 | ||
224 | static bool | |
225 | check_maybe_invariant (rtx x) | |
226 | { | |
227 | enum rtx_code code = GET_CODE (x); | |
228 | int i, j; | |
229 | const char *fmt; | |
230 | ||
231 | switch (code) | |
232 | { | |
d8116890 | 233 | CASE_CONST_ANY: |
5e962776 ZD |
234 | case SYMBOL_REF: |
235 | case CONST: | |
236 | case LABEL_REF: | |
237 | return true; | |
238 | ||
239 | case PC: | |
240 | case CC0: | |
241 | case UNSPEC_VOLATILE: | |
242 | case CALL: | |
243 | return false; | |
244 | ||
245 | case REG: | |
246 | return true; | |
247 | ||
248 | case MEM: | |
249 | /* Load/store motion is done elsewhere. ??? Perhaps also add it here? | |
250 | It should not be hard, and might be faster than "elsewhere". */ | |
251 | ||
252 | /* Just handle the most trivial case where we load from an unchanging | |
253 | location (most importantly, pic tables). */ | |
66f91b93 | 254 | if (MEM_READONLY_P (x) && !MEM_VOLATILE_P (x)) |
5e962776 ZD |
255 | break; |
256 | ||
257 | return false; | |
258 | ||
259 | case ASM_OPERANDS: | |
260 | /* Don't mess with insns declared volatile. */ | |
261 | if (MEM_VOLATILE_P (x)) | |
262 | return false; | |
263 | break; | |
264 | ||
265 | default: | |
266 | break; | |
267 | } | |
268 | ||
269 | fmt = GET_RTX_FORMAT (code); | |
270 | for (i = GET_RTX_LENGTH (code) - 1; i >= 0; i--) | |
271 | { | |
272 | if (fmt[i] == 'e') | |
273 | { | |
274 | if (!check_maybe_invariant (XEXP (x, i))) | |
275 | return false; | |
276 | } | |
277 | else if (fmt[i] == 'E') | |
278 | { | |
279 | for (j = 0; j < XVECLEN (x, i); j++) | |
280 | if (!check_maybe_invariant (XVECEXP (x, i, j))) | |
281 | return false; | |
282 | } | |
283 | } | |
284 | ||
285 | return true; | |
286 | } | |
287 | ||
1052bd54 ZD |
288 | /* Returns the invariant definition for USE, or NULL if USE is not |
289 | invariant. */ | |
290 | ||
291 | static struct invariant * | |
57512f53 | 292 | invariant_for_use (df_ref use) |
1052bd54 ZD |
293 | { |
294 | struct df_link *defs; | |
57512f53 | 295 | df_ref def; |
50e94c7e | 296 | basic_block bb = DF_REF_BB (use), def_bb; |
1052bd54 | 297 | |
57512f53 | 298 | if (DF_REF_FLAGS (use) & DF_REF_READ_WRITE) |
b6c9b9bc ZD |
299 | return NULL; |
300 | ||
1052bd54 ZD |
301 | defs = DF_REF_CHAIN (use); |
302 | if (!defs || defs->next) | |
303 | return NULL; | |
304 | def = defs->ref; | |
6fb5fa3c | 305 | check_invariant_table_size (); |
c3284718 | 306 | if (!invariant_table[DF_REF_ID (def)]) |
1052bd54 ZD |
307 | return NULL; |
308 | ||
309 | def_bb = DF_REF_BB (def); | |
310 | if (!dominated_by_p (CDI_DOMINATORS, bb, def_bb)) | |
311 | return NULL; | |
c3284718 | 312 | return invariant_table[DF_REF_ID (def)]; |
1052bd54 ZD |
313 | } |
314 | ||
315 | /* Computes hash value for invariant expression X in INSN. */ | |
316 | ||
317 | static hashval_t | |
89bfd6f5 | 318 | hash_invariant_expr_1 (rtx_insn *insn, rtx x) |
1052bd54 ZD |
319 | { |
320 | enum rtx_code code = GET_CODE (x); | |
321 | int i, j; | |
322 | const char *fmt; | |
323 | hashval_t val = code; | |
324 | int do_not_record_p; | |
57512f53 | 325 | df_ref use; |
1052bd54 ZD |
326 | struct invariant *inv; |
327 | ||
328 | switch (code) | |
329 | { | |
d8116890 | 330 | CASE_CONST_ANY: |
1052bd54 ZD |
331 | case SYMBOL_REF: |
332 | case CONST: | |
333 | case LABEL_REF: | |
334 | return hash_rtx (x, GET_MODE (x), &do_not_record_p, NULL, false); | |
335 | ||
336 | case REG: | |
6fb5fa3c | 337 | use = df_find_use (insn, x); |
1052bd54 ZD |
338 | if (!use) |
339 | return hash_rtx (x, GET_MODE (x), &do_not_record_p, NULL, false); | |
340 | inv = invariant_for_use (use); | |
341 | if (!inv) | |
342 | return hash_rtx (x, GET_MODE (x), &do_not_record_p, NULL, false); | |
343 | ||
344 | gcc_assert (inv->eqto != ~0u); | |
345 | return inv->eqto; | |
346 | ||
347 | default: | |
348 | break; | |
349 | } | |
350 | ||
351 | fmt = GET_RTX_FORMAT (code); | |
352 | for (i = GET_RTX_LENGTH (code) - 1; i >= 0; i--) | |
353 | { | |
354 | if (fmt[i] == 'e') | |
355 | val ^= hash_invariant_expr_1 (insn, XEXP (x, i)); | |
356 | else if (fmt[i] == 'E') | |
357 | { | |
358 | for (j = 0; j < XVECLEN (x, i); j++) | |
359 | val ^= hash_invariant_expr_1 (insn, XVECEXP (x, i, j)); | |
360 | } | |
8e1409e8 ZD |
361 | else if (fmt[i] == 'i' || fmt[i] == 'n') |
362 | val ^= XINT (x, i); | |
1052bd54 ZD |
363 | } |
364 | ||
365 | return val; | |
366 | } | |
367 | ||
368 | /* Returns true if the invariant expressions E1 and E2 used in insns INSN1 | |
369 | and INSN2 have always the same value. */ | |
370 | ||
371 | static bool | |
89bfd6f5 | 372 | invariant_expr_equal_p (rtx_insn *insn1, rtx e1, rtx_insn *insn2, rtx e2) |
1052bd54 ZD |
373 | { |
374 | enum rtx_code code = GET_CODE (e1); | |
375 | int i, j; | |
376 | const char *fmt; | |
57512f53 | 377 | df_ref use1, use2; |
1052bd54 ZD |
378 | struct invariant *inv1 = NULL, *inv2 = NULL; |
379 | rtx sub1, sub2; | |
380 | ||
381 | /* If mode of only one of the operands is VOIDmode, it is not equivalent to | |
382 | the other one. If both are VOIDmode, we rely on the caller of this | |
383 | function to verify that their modes are the same. */ | |
384 | if (code != GET_CODE (e2) || GET_MODE (e1) != GET_MODE (e2)) | |
385 | return false; | |
386 | ||
387 | switch (code) | |
388 | { | |
d8116890 | 389 | CASE_CONST_ANY: |
1052bd54 ZD |
390 | case SYMBOL_REF: |
391 | case CONST: | |
392 | case LABEL_REF: | |
393 | return rtx_equal_p (e1, e2); | |
394 | ||
395 | case REG: | |
6fb5fa3c DB |
396 | use1 = df_find_use (insn1, e1); |
397 | use2 = df_find_use (insn2, e2); | |
1052bd54 ZD |
398 | if (use1) |
399 | inv1 = invariant_for_use (use1); | |
400 | if (use2) | |
401 | inv2 = invariant_for_use (use2); | |
402 | ||
403 | if (!inv1 && !inv2) | |
404 | return rtx_equal_p (e1, e2); | |
405 | ||
406 | if (!inv1 || !inv2) | |
407 | return false; | |
408 | ||
409 | gcc_assert (inv1->eqto != ~0u); | |
410 | gcc_assert (inv2->eqto != ~0u); | |
411 | return inv1->eqto == inv2->eqto; | |
412 | ||
413 | default: | |
414 | break; | |
415 | } | |
416 | ||
417 | fmt = GET_RTX_FORMAT (code); | |
418 | for (i = GET_RTX_LENGTH (code) - 1; i >= 0; i--) | |
419 | { | |
420 | if (fmt[i] == 'e') | |
421 | { | |
422 | sub1 = XEXP (e1, i); | |
423 | sub2 = XEXP (e2, i); | |
424 | ||
425 | if (!invariant_expr_equal_p (insn1, sub1, insn2, sub2)) | |
426 | return false; | |
427 | } | |
428 | ||
429 | else if (fmt[i] == 'E') | |
430 | { | |
431 | if (XVECLEN (e1, i) != XVECLEN (e2, i)) | |
432 | return false; | |
433 | ||
434 | for (j = 0; j < XVECLEN (e1, i); j++) | |
435 | { | |
436 | sub1 = XVECEXP (e1, i, j); | |
437 | sub2 = XVECEXP (e2, i, j); | |
438 | ||
439 | if (!invariant_expr_equal_p (insn1, sub1, insn2, sub2)) | |
440 | return false; | |
441 | } | |
442 | } | |
8e1409e8 ZD |
443 | else if (fmt[i] == 'i' || fmt[i] == 'n') |
444 | { | |
445 | if (XINT (e1, i) != XINT (e2, i)) | |
446 | return false; | |
447 | } | |
448 | /* Unhandled type of subexpression, we fail conservatively. */ | |
449 | else | |
450 | return false; | |
1052bd54 ZD |
451 | } |
452 | ||
453 | return true; | |
454 | } | |
455 | ||
4a8fb1a1 | 456 | struct invariant_expr_hasher : typed_free_remove <invariant_expr_entry> |
1052bd54 | 457 | { |
4a8fb1a1 LC |
458 | typedef invariant_expr_entry value_type; |
459 | typedef invariant_expr_entry compare_type; | |
460 | static inline hashval_t hash (const value_type *); | |
461 | static inline bool equal (const value_type *, const compare_type *); | |
462 | }; | |
463 | ||
464 | /* Returns hash value for invariant expression entry ENTRY. */ | |
1052bd54 | 465 | |
4a8fb1a1 LC |
466 | inline hashval_t |
467 | invariant_expr_hasher::hash (const value_type *entry) | |
468 | { | |
1052bd54 ZD |
469 | return entry->hash; |
470 | } | |
471 | ||
4a8fb1a1 | 472 | /* Compares invariant expression entries ENTRY1 and ENTRY2. */ |
1052bd54 | 473 | |
4a8fb1a1 LC |
474 | inline bool |
475 | invariant_expr_hasher::equal (const value_type *entry1, | |
476 | const compare_type *entry2) | |
1052bd54 | 477 | { |
1052bd54 ZD |
478 | if (entry1->mode != entry2->mode) |
479 | return 0; | |
480 | ||
481 | return invariant_expr_equal_p (entry1->inv->insn, entry1->expr, | |
482 | entry2->inv->insn, entry2->expr); | |
483 | } | |
484 | ||
c203e8a7 | 485 | typedef hash_table<invariant_expr_hasher> invariant_htab_type; |
4a8fb1a1 | 486 | |
1052bd54 ZD |
487 | /* Checks whether invariant with value EXPR in machine mode MODE is |
488 | recorded in EQ. If this is the case, return the invariant. Otherwise | |
489 | insert INV to the table for this expression and return INV. */ | |
490 | ||
491 | static struct invariant * | |
ef4bddc2 | 492 | find_or_insert_inv (invariant_htab_type *eq, rtx expr, machine_mode mode, |
1052bd54 ZD |
493 | struct invariant *inv) |
494 | { | |
495 | hashval_t hash = hash_invariant_expr_1 (inv->insn, expr); | |
496 | struct invariant_expr_entry *entry; | |
497 | struct invariant_expr_entry pentry; | |
4a8fb1a1 | 498 | invariant_expr_entry **slot; |
1052bd54 ZD |
499 | |
500 | pentry.expr = expr; | |
501 | pentry.inv = inv; | |
502 | pentry.mode = mode; | |
c203e8a7 | 503 | slot = eq->find_slot_with_hash (&pentry, hash, INSERT); |
4a8fb1a1 | 504 | entry = *slot; |
1052bd54 ZD |
505 | |
506 | if (entry) | |
507 | return entry->inv; | |
508 | ||
5ed6ace5 | 509 | entry = XNEW (struct invariant_expr_entry); |
1052bd54 ZD |
510 | entry->inv = inv; |
511 | entry->expr = expr; | |
512 | entry->mode = mode; | |
513 | entry->hash = hash; | |
514 | *slot = entry; | |
515 | ||
516 | return inv; | |
517 | } | |
518 | ||
519 | /* Finds invariants identical to INV and records the equivalence. EQ is the | |
520 | hash table of the invariants. */ | |
521 | ||
522 | static void | |
c203e8a7 | 523 | find_identical_invariants (invariant_htab_type *eq, struct invariant *inv) |
1052bd54 ZD |
524 | { |
525 | unsigned depno; | |
526 | bitmap_iterator bi; | |
527 | struct invariant *dep; | |
528 | rtx expr, set; | |
ef4bddc2 | 529 | machine_mode mode; |
e42e3d15 | 530 | struct invariant *tmp; |
1052bd54 ZD |
531 | |
532 | if (inv->eqto != ~0u) | |
533 | return; | |
534 | ||
535 | EXECUTE_IF_SET_IN_BITMAP (inv->depends_on, 0, depno, bi) | |
536 | { | |
9771b263 | 537 | dep = invariants[depno]; |
1052bd54 ZD |
538 | find_identical_invariants (eq, dep); |
539 | } | |
540 | ||
541 | set = single_set (inv->insn); | |
542 | expr = SET_SRC (set); | |
543 | mode = GET_MODE (expr); | |
544 | if (mode == VOIDmode) | |
545 | mode = GET_MODE (SET_DEST (set)); | |
e42e3d15 ZC |
546 | |
547 | tmp = find_or_insert_inv (eq, expr, mode, inv); | |
548 | inv->eqto = tmp->invno; | |
549 | ||
550 | if (tmp->invno != inv->invno && inv->always_executed) | |
551 | tmp->eqno++; | |
1052bd54 ZD |
552 | |
553 | if (dump_file && inv->eqto != inv->invno) | |
554 | fprintf (dump_file, | |
e755fcf5 | 555 | "Invariant %d is equivalent to invariant %d.\n", |
1052bd54 ZD |
556 | inv->invno, inv->eqto); |
557 | } | |
558 | ||
559 | /* Find invariants with the same value and record the equivalences. */ | |
560 | ||
561 | static void | |
562 | merge_identical_invariants (void) | |
563 | { | |
564 | unsigned i; | |
565 | struct invariant *inv; | |
c203e8a7 | 566 | invariant_htab_type eq (invariants.length ()); |
1052bd54 | 567 | |
9771b263 | 568 | FOR_EACH_VEC_ELT (invariants, i, inv) |
c203e8a7 | 569 | find_identical_invariants (&eq, inv); |
1052bd54 ZD |
570 | } |
571 | ||
5e962776 ZD |
572 | /* Determines the basic blocks inside LOOP that are always executed and |
573 | stores their bitmap to ALWAYS_REACHED. MAY_EXIT is a bitmap of | |
574 | basic blocks that may either exit the loop, or contain the call that | |
575 | does not have to return. BODY is body of the loop obtained by | |
576 | get_loop_body_in_dom_order. */ | |
577 | ||
578 | static void | |
579 | compute_always_reached (struct loop *loop, basic_block *body, | |
580 | bitmap may_exit, bitmap always_reached) | |
581 | { | |
582 | unsigned i; | |
583 | ||
584 | for (i = 0; i < loop->num_nodes; i++) | |
585 | { | |
586 | if (dominated_by_p (CDI_DOMINATORS, loop->latch, body[i])) | |
587 | bitmap_set_bit (always_reached, i); | |
588 | ||
589 | if (bitmap_bit_p (may_exit, i)) | |
590 | return; | |
591 | } | |
592 | } | |
593 | ||
594 | /* Finds exits out of the LOOP with body BODY. Marks blocks in that we may | |
595 | exit the loop by cfg edge to HAS_EXIT and MAY_EXIT. In MAY_EXIT | |
596 | additionally mark blocks that may exit due to a call. */ | |
597 | ||
598 | static void | |
599 | find_exits (struct loop *loop, basic_block *body, | |
600 | bitmap may_exit, bitmap has_exit) | |
601 | { | |
602 | unsigned i; | |
628f6a4e | 603 | edge_iterator ei; |
5e962776 ZD |
604 | edge e; |
605 | struct loop *outermost_exit = loop, *aexit; | |
606 | bool has_call = false; | |
89bfd6f5 | 607 | rtx_insn *insn; |
5e962776 ZD |
608 | |
609 | for (i = 0; i < loop->num_nodes; i++) | |
610 | { | |
611 | if (body[i]->loop_father == loop) | |
612 | { | |
613 | FOR_BB_INSNS (body[i], insn) | |
614 | { | |
4b4bf941 | 615 | if (CALL_P (insn) |
becfd6e5 KZ |
616 | && (RTL_LOOPING_CONST_OR_PURE_CALL_P (insn) |
617 | || !RTL_CONST_OR_PURE_CALL_P (insn))) | |
5e962776 ZD |
618 | { |
619 | has_call = true; | |
620 | bitmap_set_bit (may_exit, i); | |
621 | break; | |
622 | } | |
623 | } | |
624 | ||
628f6a4e | 625 | FOR_EACH_EDGE (e, ei, body[i]->succs) |
5e962776 ZD |
626 | { |
627 | if (flow_bb_inside_loop_p (loop, e->dest)) | |
628 | continue; | |
629 | ||
630 | bitmap_set_bit (may_exit, i); | |
631 | bitmap_set_bit (has_exit, i); | |
632 | outermost_exit = find_common_loop (outermost_exit, | |
633 | e->dest->loop_father); | |
634 | } | |
635 | continue; | |
636 | } | |
cb20f7e8 | 637 | |
5e962776 ZD |
638 | /* Use the data stored for the subloop to decide whether we may exit |
639 | through it. It is sufficient to do this for header of the loop, | |
640 | as other basic blocks inside it must be dominated by it. */ | |
641 | if (body[i]->loop_father->header != body[i]) | |
642 | continue; | |
643 | ||
644 | if (LOOP_DATA (body[i]->loop_father)->has_call) | |
645 | { | |
646 | has_call = true; | |
647 | bitmap_set_bit (may_exit, i); | |
648 | } | |
649 | aexit = LOOP_DATA (body[i]->loop_father)->outermost_exit; | |
650 | if (aexit != loop) | |
651 | { | |
652 | bitmap_set_bit (may_exit, i); | |
653 | bitmap_set_bit (has_exit, i); | |
654 | ||
655 | if (flow_loop_nested_p (aexit, outermost_exit)) | |
656 | outermost_exit = aexit; | |
657 | } | |
658 | } | |
659 | ||
1833192f VM |
660 | if (loop->aux == NULL) |
661 | { | |
662 | loop->aux = xcalloc (1, sizeof (struct loop_data)); | |
663 | bitmap_initialize (&LOOP_DATA (loop)->regs_ref, ®_obstack); | |
664 | bitmap_initialize (&LOOP_DATA (loop)->regs_live, ®_obstack); | |
665 | } | |
5e962776 ZD |
666 | LOOP_DATA (loop)->outermost_exit = outermost_exit; |
667 | LOOP_DATA (loop)->has_call = has_call; | |
668 | } | |
669 | ||
670 | /* Check whether we may assign a value to X from a register. */ | |
671 | ||
672 | static bool | |
673 | may_assign_reg_p (rtx x) | |
674 | { | |
bd361d85 | 675 | return (GET_MODE (x) != VOIDmode |
4b06592a | 676 | && GET_MODE (x) != BLKmode |
bd361d85 | 677 | && can_copy_p (GET_MODE (x)) |
a7f4ccb1 SB |
678 | && (!REG_P (x) |
679 | || !HARD_REGISTER_P (x) | |
680 | || REGNO_REG_CLASS (REGNO (x)) != NO_REGS)); | |
5e962776 ZD |
681 | } |
682 | ||
cb20f7e8 ZD |
683 | /* Finds definitions that may correspond to invariants in LOOP with body |
684 | BODY. */ | |
5e962776 ZD |
685 | |
686 | static void | |
7be64667 | 687 | find_defs (struct loop *loop) |
5e962776 | 688 | { |
7b19209f SB |
689 | if (dump_file) |
690 | { | |
691 | fprintf (dump_file, | |
692 | "*****starting processing of loop %d ******\n", | |
693 | loop->num); | |
694 | } | |
695 | ||
6fb5fa3c DB |
696 | df_remove_problem (df_chain); |
697 | df_process_deferred_rescans (); | |
698 | df_chain_add_problem (DF_UD_CHAIN); | |
7b19209f | 699 | df_set_flags (DF_RD_PRUNE_DEAD_DEFS); |
7be64667 | 700 | df_analyze_loop (loop); |
7b19209f | 701 | check_invariant_table_size (); |
6fb5fa3c DB |
702 | |
703 | if (dump_file) | |
704 | { | |
ffd640ed | 705 | df_dump_region (dump_file); |
7b19209f SB |
706 | fprintf (dump_file, |
707 | "*****ending processing of loop %d ******\n", | |
708 | loop->num); | |
6fb5fa3c | 709 | } |
5e962776 ZD |
710 | } |
711 | ||
712 | /* Creates a new invariant for definition DEF in INSN, depending on invariants | |
713 | in DEPENDS_ON. ALWAYS_EXECUTED is true if the insn is always executed, | |
1052bd54 ZD |
714 | unless the program ends due to a function call. The newly created invariant |
715 | is returned. */ | |
5e962776 | 716 | |
1052bd54 | 717 | static struct invariant * |
89bfd6f5 | 718 | create_new_invariant (struct def *def, rtx_insn *insn, bitmap depends_on, |
5e962776 ZD |
719 | bool always_executed) |
720 | { | |
5ed6ace5 | 721 | struct invariant *inv = XNEW (struct invariant); |
5e962776 | 722 | rtx set = single_set (insn); |
f40751dd | 723 | bool speed = optimize_bb_for_speed_p (BLOCK_FOR_INSN (insn)); |
5e962776 ZD |
724 | |
725 | inv->def = def; | |
726 | inv->always_executed = always_executed; | |
727 | inv->depends_on = depends_on; | |
728 | ||
729 | /* If the set is simple, usually by moving it we move the whole store out of | |
730 | the loop. Otherwise we save only cost of the computation. */ | |
731 | if (def) | |
1bfdbb29 | 732 | { |
d51102f3 | 733 | inv->cost = set_rtx_cost (set, speed); |
1578e910 MM |
734 | /* ??? Try to determine cheapness of address computation. Unfortunately |
735 | the address cost is only a relative measure, we can't really compare | |
736 | it with any absolute number, but only with other address costs. | |
737 | But here we don't have any other addresses, so compare with a magic | |
738 | number anyway. It has to be large enough to not regress PR33928 | |
739 | (by avoiding to move reg+8,reg+16,reg+24 invariants), but small | |
740 | enough to not regress 410.bwaves either (by still moving reg+reg | |
741 | invariants). | |
742 | See http://gcc.gnu.org/ml/gcc-patches/2009-10/msg01210.html . */ | |
1bfdbb29 | 743 | inv->cheap_address = address_cost (SET_SRC (set), word_mode, |
09e881c9 | 744 | ADDR_SPACE_GENERIC, speed) < 3; |
1bfdbb29 | 745 | } |
5e962776 | 746 | else |
1bfdbb29 | 747 | { |
5e8f01f4 | 748 | inv->cost = set_src_cost (SET_SRC (set), speed); |
1bfdbb29 PB |
749 | inv->cheap_address = false; |
750 | } | |
5e962776 ZD |
751 | |
752 | inv->move = false; | |
1052bd54 | 753 | inv->reg = NULL_RTX; |
1833192f | 754 | inv->orig_regno = -1; |
5e962776 ZD |
755 | inv->stamp = 0; |
756 | inv->insn = insn; | |
757 | ||
9771b263 | 758 | inv->invno = invariants.length (); |
1052bd54 | 759 | inv->eqto = ~0u; |
e42e3d15 ZC |
760 | |
761 | /* Itself. */ | |
762 | inv->eqno = 1; | |
763 | ||
5e962776 ZD |
764 | if (def) |
765 | def->invno = inv->invno; | |
9771b263 | 766 | invariants.safe_push (inv); |
5e962776 ZD |
767 | |
768 | if (dump_file) | |
769 | { | |
770 | fprintf (dump_file, | |
771 | "Set in insn %d is invariant (%d), cost %d, depends on ", | |
772 | INSN_UID (insn), inv->invno, inv->cost); | |
773 | dump_bitmap (dump_file, inv->depends_on); | |
774 | } | |
1052bd54 ZD |
775 | |
776 | return inv; | |
5e962776 ZD |
777 | } |
778 | ||
779 | /* Record USE at DEF. */ | |
780 | ||
781 | static void | |
1bfdbb29 | 782 | record_use (struct def *def, df_ref use) |
5e962776 | 783 | { |
5ed6ace5 | 784 | struct use *u = XNEW (struct use); |
5e962776 | 785 | |
1bfdbb29 PB |
786 | u->pos = DF_REF_REAL_LOC (use); |
787 | u->insn = DF_REF_INSN (use); | |
788 | u->addr_use_p = (DF_REF_TYPE (use) == DF_REF_REG_MEM_LOAD | |
3e807ffc | 789 | || DF_REF_TYPE (use) == DF_REF_REG_MEM_STORE); |
5e962776 ZD |
790 | u->next = def->uses; |
791 | def->uses = u; | |
792 | def->n_uses++; | |
1bfdbb29 PB |
793 | if (u->addr_use_p) |
794 | def->n_addr_uses++; | |
5e962776 ZD |
795 | } |
796 | ||
6fb5fa3c DB |
797 | /* Finds the invariants USE depends on and store them to the DEPENDS_ON |
798 | bitmap. Returns true if all dependencies of USE are known to be | |
b6c9b9bc | 799 | loop invariants, false otherwise. */ |
5e962776 ZD |
800 | |
801 | static bool | |
57512f53 | 802 | check_dependency (basic_block bb, df_ref use, bitmap depends_on) |
5e962776 | 803 | { |
57512f53 | 804 | df_ref def; |
6fb5fa3c | 805 | basic_block def_bb; |
4d779342 | 806 | struct df_link *defs; |
5e962776 | 807 | struct def *def_data; |
1052bd54 | 808 | struct invariant *inv; |
b8698a0f | 809 | |
57512f53 | 810 | if (DF_REF_FLAGS (use) & DF_REF_READ_WRITE) |
6fb5fa3c | 811 | return false; |
b8698a0f | 812 | |
6fb5fa3c DB |
813 | defs = DF_REF_CHAIN (use); |
814 | if (!defs) | |
1a17bd35 EB |
815 | { |
816 | unsigned int regno = DF_REF_REGNO (use); | |
817 | ||
818 | /* If this is the use of an uninitialized argument register that is | |
819 | likely to be spilled, do not move it lest this might extend its | |
820 | lifetime and cause reload to die. This can occur for a call to | |
821 | a function taking complex number arguments and moving the insns | |
822 | preparing the arguments without moving the call itself wouldn't | |
823 | gain much in practice. */ | |
824 | if ((DF_REF_FLAGS (use) & DF_HARD_REG_LIVE) | |
825 | && FUNCTION_ARG_REGNO_P (regno) | |
826 | && targetm.class_likely_spilled_p (REGNO_REG_CLASS (regno))) | |
827 | return false; | |
828 | ||
829 | return true; | |
830 | } | |
b8698a0f | 831 | |
6fb5fa3c DB |
832 | if (defs->next) |
833 | return false; | |
b8698a0f | 834 | |
6fb5fa3c DB |
835 | def = defs->ref; |
836 | check_invariant_table_size (); | |
c3284718 | 837 | inv = invariant_table[DF_REF_ID (def)]; |
6fb5fa3c DB |
838 | if (!inv) |
839 | return false; | |
b8698a0f | 840 | |
6fb5fa3c DB |
841 | def_data = inv->def; |
842 | gcc_assert (def_data != NULL); | |
b8698a0f | 843 | |
6fb5fa3c DB |
844 | def_bb = DF_REF_BB (def); |
845 | /* Note that in case bb == def_bb, we know that the definition | |
846 | dominates insn, because def has invariant_table[DF_REF_ID(def)] | |
847 | defined and we process the insns in the basic block bb | |
848 | sequentially. */ | |
849 | if (!dominated_by_p (CDI_DOMINATORS, bb, def_bb)) | |
850 | return false; | |
b8698a0f | 851 | |
6fb5fa3c DB |
852 | bitmap_set_bit (depends_on, def_data->invno); |
853 | return true; | |
854 | } | |
1052bd54 | 855 | |
1052bd54 | 856 | |
6fb5fa3c DB |
857 | /* Finds the invariants INSN depends on and store them to the DEPENDS_ON |
858 | bitmap. Returns true if all dependencies of INSN are known to be | |
859 | loop invariants, false otherwise. */ | |
5e962776 | 860 | |
6fb5fa3c | 861 | static bool |
89bfd6f5 | 862 | check_dependencies (rtx_insn *insn, bitmap depends_on) |
6fb5fa3c | 863 | { |
50e94c7e | 864 | struct df_insn_info *insn_info = DF_INSN_INFO_GET (insn); |
bfac633a | 865 | df_ref use; |
6fb5fa3c | 866 | basic_block bb = BLOCK_FOR_INSN (insn); |
5e962776 | 867 | |
bfac633a RS |
868 | FOR_EACH_INSN_INFO_USE (use, insn_info) |
869 | if (!check_dependency (bb, use, depends_on)) | |
6fb5fa3c | 870 | return false; |
bfac633a RS |
871 | FOR_EACH_INSN_INFO_EQ_USE (use, insn_info) |
872 | if (!check_dependency (bb, use, depends_on)) | |
6fb5fa3c | 873 | return false; |
b8698a0f | 874 | |
5e962776 ZD |
875 | return true; |
876 | } | |
877 | ||
2c97f472 ZC |
878 | /* Pre-check candidate DEST to skip the one which can not make a valid insn |
879 | during move_invariant_reg. SIMPLE is to skip HARD_REGISTER. */ | |
880 | static bool | |
881 | pre_check_invariant_p (bool simple, rtx dest) | |
882 | { | |
883 | if (simple && REG_P (dest) && DF_REG_DEF_COUNT (REGNO (dest)) > 1) | |
884 | { | |
885 | df_ref use; | |
886 | rtx ref; | |
887 | unsigned int i = REGNO (dest); | |
888 | struct df_insn_info *insn_info; | |
889 | df_ref def_rec; | |
890 | ||
891 | for (use = DF_REG_USE_CHAIN (i); use; use = DF_REF_NEXT_REG (use)) | |
892 | { | |
893 | ref = DF_REF_INSN (use); | |
894 | insn_info = DF_INSN_INFO_GET (ref); | |
895 | ||
896 | FOR_EACH_INSN_INFO_DEF (def_rec, insn_info) | |
897 | if (DF_REF_REGNO (def_rec) == i) | |
898 | { | |
899 | /* Multi definitions at this stage, most likely are due to | |
900 | instruction constraints, which requires both read and write | |
901 | on the same register. Since move_invariant_reg is not | |
902 | powerful enough to handle such cases, just ignore the INV | |
903 | and leave the chance to others. */ | |
904 | return false; | |
905 | } | |
906 | } | |
907 | } | |
908 | return true; | |
909 | } | |
910 | ||
5e962776 ZD |
911 | /* Finds invariant in INSN. ALWAYS_REACHED is true if the insn is always |
912 | executed. ALWAYS_EXECUTED is true if the insn is always executed, | |
cb20f7e8 | 913 | unless the program ends due to a function call. */ |
5e962776 ZD |
914 | |
915 | static void | |
89bfd6f5 | 916 | find_invariant_insn (rtx_insn *insn, bool always_reached, bool always_executed) |
5e962776 | 917 | { |
57512f53 | 918 | df_ref ref; |
5e962776 ZD |
919 | struct def *def; |
920 | bitmap depends_on; | |
921 | rtx set, dest; | |
922 | bool simple = true; | |
1052bd54 | 923 | struct invariant *inv; |
5e962776 | 924 | |
00f70f98 ZD |
925 | #ifdef HAVE_cc0 |
926 | /* We can't move a CC0 setter without the user. */ | |
927 | if (sets_cc0_p (insn)) | |
928 | return; | |
929 | #endif | |
930 | ||
5e962776 ZD |
931 | set = single_set (insn); |
932 | if (!set) | |
933 | return; | |
934 | dest = SET_DEST (set); | |
935 | ||
2ca202e7 | 936 | if (!REG_P (dest) |
5e962776 ZD |
937 | || HARD_REGISTER_P (dest)) |
938 | simple = false; | |
939 | ||
2c97f472 ZC |
940 | if (!may_assign_reg_p (dest) |
941 | || !pre_check_invariant_p (simple, dest) | |
a7f4ccb1 | 942 | || !check_maybe_invariant (SET_SRC (set))) |
5e962776 ZD |
943 | return; |
944 | ||
28749cfb ZD |
945 | /* If the insn can throw exception, we cannot move it at all without changing |
946 | cfg. */ | |
947 | if (can_throw_internal (insn)) | |
948 | return; | |
5e962776 | 949 | |
28749cfb | 950 | /* We cannot make trapping insn executed, unless it was executed before. */ |
48e8382e | 951 | if (may_trap_or_fault_p (PATTERN (insn)) && !always_reached) |
28749cfb | 952 | return; |
5e962776 | 953 | |
8bdbfff5 | 954 | depends_on = BITMAP_ALLOC (NULL); |
cb20f7e8 | 955 | if (!check_dependencies (insn, depends_on)) |
5e962776 | 956 | { |
8bdbfff5 | 957 | BITMAP_FREE (depends_on); |
5e962776 ZD |
958 | return; |
959 | } | |
960 | ||
961 | if (simple) | |
5ed6ace5 | 962 | def = XCNEW (struct def); |
5e962776 ZD |
963 | else |
964 | def = NULL; | |
965 | ||
1052bd54 ZD |
966 | inv = create_new_invariant (def, insn, depends_on, always_executed); |
967 | ||
968 | if (simple) | |
969 | { | |
6fb5fa3c DB |
970 | ref = df_find_def (insn, dest); |
971 | check_invariant_table_size (); | |
c3284718 | 972 | invariant_table[DF_REF_ID (ref)] = inv; |
1052bd54 | 973 | } |
5e962776 ZD |
974 | } |
975 | ||
cb20f7e8 | 976 | /* Record registers used in INSN that have a unique invariant definition. */ |
5e962776 ZD |
977 | |
978 | static void | |
89bfd6f5 | 979 | record_uses (rtx_insn *insn) |
5e962776 | 980 | { |
50e94c7e | 981 | struct df_insn_info *insn_info = DF_INSN_INFO_GET (insn); |
bfac633a | 982 | df_ref use; |
1052bd54 ZD |
983 | struct invariant *inv; |
984 | ||
bfac633a | 985 | FOR_EACH_INSN_INFO_USE (use, insn_info) |
6fb5fa3c | 986 | { |
6fb5fa3c DB |
987 | inv = invariant_for_use (use); |
988 | if (inv) | |
1bfdbb29 | 989 | record_use (inv->def, use); |
6fb5fa3c | 990 | } |
bfac633a | 991 | FOR_EACH_INSN_INFO_EQ_USE (use, insn_info) |
5e962776 | 992 | { |
1052bd54 ZD |
993 | inv = invariant_for_use (use); |
994 | if (inv) | |
1bfdbb29 | 995 | record_use (inv->def, use); |
5e962776 ZD |
996 | } |
997 | } | |
998 | ||
999 | /* Finds invariants in INSN. ALWAYS_REACHED is true if the insn is always | |
1000 | executed. ALWAYS_EXECUTED is true if the insn is always executed, | |
cb20f7e8 | 1001 | unless the program ends due to a function call. */ |
5e962776 ZD |
1002 | |
1003 | static void | |
89bfd6f5 | 1004 | find_invariants_insn (rtx_insn *insn, bool always_reached, bool always_executed) |
5e962776 | 1005 | { |
cb20f7e8 ZD |
1006 | find_invariant_insn (insn, always_reached, always_executed); |
1007 | record_uses (insn); | |
5e962776 ZD |
1008 | } |
1009 | ||
1010 | /* Finds invariants in basic block BB. ALWAYS_REACHED is true if the | |
1011 | basic block is always executed. ALWAYS_EXECUTED is true if the basic | |
1012 | block is always executed, unless the program ends due to a function | |
cb20f7e8 | 1013 | call. */ |
5e962776 ZD |
1014 | |
1015 | static void | |
cb20f7e8 | 1016 | find_invariants_bb (basic_block bb, bool always_reached, bool always_executed) |
5e962776 | 1017 | { |
89bfd6f5 | 1018 | rtx_insn *insn; |
5e962776 ZD |
1019 | |
1020 | FOR_BB_INSNS (bb, insn) | |
1021 | { | |
b5b8b0ac | 1022 | if (!NONDEBUG_INSN_P (insn)) |
5e962776 ZD |
1023 | continue; |
1024 | ||
cb20f7e8 | 1025 | find_invariants_insn (insn, always_reached, always_executed); |
5e962776 ZD |
1026 | |
1027 | if (always_reached | |
4b4bf941 | 1028 | && CALL_P (insn) |
becfd6e5 KZ |
1029 | && (RTL_LOOPING_CONST_OR_PURE_CALL_P (insn) |
1030 | || ! RTL_CONST_OR_PURE_CALL_P (insn))) | |
5e962776 ZD |
1031 | always_reached = false; |
1032 | } | |
1033 | } | |
1034 | ||
1035 | /* Finds invariants in LOOP with body BODY. ALWAYS_REACHED is the bitmap of | |
1036 | basic blocks in BODY that are always executed. ALWAYS_EXECUTED is the | |
1037 | bitmap of basic blocks in BODY that are always executed unless the program | |
cb20f7e8 | 1038 | ends due to a function call. */ |
5e962776 ZD |
1039 | |
1040 | static void | |
1041 | find_invariants_body (struct loop *loop, basic_block *body, | |
cb20f7e8 | 1042 | bitmap always_reached, bitmap always_executed) |
5e962776 ZD |
1043 | { |
1044 | unsigned i; | |
1045 | ||
1046 | for (i = 0; i < loop->num_nodes; i++) | |
1047 | find_invariants_bb (body[i], | |
1048 | bitmap_bit_p (always_reached, i), | |
cb20f7e8 | 1049 | bitmap_bit_p (always_executed, i)); |
5e962776 ZD |
1050 | } |
1051 | ||
cb20f7e8 | 1052 | /* Finds invariants in LOOP. */ |
5e962776 ZD |
1053 | |
1054 | static void | |
cb20f7e8 | 1055 | find_invariants (struct loop *loop) |
5e962776 | 1056 | { |
8bdbfff5 NS |
1057 | bitmap may_exit = BITMAP_ALLOC (NULL); |
1058 | bitmap always_reached = BITMAP_ALLOC (NULL); | |
1059 | bitmap has_exit = BITMAP_ALLOC (NULL); | |
1060 | bitmap always_executed = BITMAP_ALLOC (NULL); | |
5e962776 ZD |
1061 | basic_block *body = get_loop_body_in_dom_order (loop); |
1062 | ||
1063 | find_exits (loop, body, may_exit, has_exit); | |
1064 | compute_always_reached (loop, body, may_exit, always_reached); | |
1065 | compute_always_reached (loop, body, has_exit, always_executed); | |
1066 | ||
7be64667 | 1067 | find_defs (loop); |
cb20f7e8 | 1068 | find_invariants_body (loop, body, always_reached, always_executed); |
1052bd54 | 1069 | merge_identical_invariants (); |
5e962776 | 1070 | |
8bdbfff5 NS |
1071 | BITMAP_FREE (always_reached); |
1072 | BITMAP_FREE (always_executed); | |
1073 | BITMAP_FREE (may_exit); | |
1074 | BITMAP_FREE (has_exit); | |
5e962776 ZD |
1075 | free (body); |
1076 | } | |
1077 | ||
1078 | /* Frees a list of uses USE. */ | |
1079 | ||
1080 | static void | |
1081 | free_use_list (struct use *use) | |
1082 | { | |
1083 | struct use *next; | |
1084 | ||
1085 | for (; use; use = next) | |
1086 | { | |
1087 | next = use->next; | |
1088 | free (use); | |
1089 | } | |
1090 | } | |
1091 | ||
1756cb66 | 1092 | /* Return pressure class and number of hard registers (through *NREGS) |
1833192f VM |
1093 | for destination of INSN. */ |
1094 | static enum reg_class | |
89bfd6f5 | 1095 | get_pressure_class_and_nregs (rtx_insn *insn, int *nregs) |
1833192f VM |
1096 | { |
1097 | rtx reg; | |
1756cb66 | 1098 | enum reg_class pressure_class; |
1833192f | 1099 | rtx set = single_set (insn); |
b8698a0f | 1100 | |
1833192f VM |
1101 | /* Considered invariant insns have only one set. */ |
1102 | gcc_assert (set != NULL_RTX); | |
1103 | reg = SET_DEST (set); | |
1104 | if (GET_CODE (reg) == SUBREG) | |
1105 | reg = SUBREG_REG (reg); | |
1106 | if (MEM_P (reg)) | |
1107 | { | |
1108 | *nregs = 0; | |
1756cb66 | 1109 | pressure_class = NO_REGS; |
1833192f VM |
1110 | } |
1111 | else | |
1112 | { | |
1113 | if (! REG_P (reg)) | |
1114 | reg = NULL_RTX; | |
1115 | if (reg == NULL_RTX) | |
1756cb66 | 1116 | pressure_class = GENERAL_REGS; |
1833192f | 1117 | else |
1756cb66 VM |
1118 | { |
1119 | pressure_class = reg_allocno_class (REGNO (reg)); | |
1120 | pressure_class = ira_pressure_class_translate[pressure_class]; | |
1121 | } | |
1122 | *nregs | |
1123 | = ira_reg_class_max_nregs[pressure_class][GET_MODE (SET_SRC (set))]; | |
1833192f | 1124 | } |
1756cb66 | 1125 | return pressure_class; |
1833192f VM |
1126 | } |
1127 | ||
5e962776 | 1128 | /* Calculates cost and number of registers needed for moving invariant INV |
51a69168 ZC |
1129 | out of the loop and stores them to *COST and *REGS_NEEDED. *CL will be |
1130 | the REG_CLASS of INV. Return | |
1131 | -1: if INV is invalid. | |
1132 | 0: if INV and its depends_on have same reg_class | |
1133 | 1: if INV and its depends_on have different reg_classes. */ | |
5e962776 | 1134 | |
51a69168 ZC |
1135 | static int |
1136 | get_inv_cost (struct invariant *inv, int *comp_cost, unsigned *regs_needed, | |
1137 | enum reg_class *cl) | |
5e962776 | 1138 | { |
1833192f VM |
1139 | int i, acomp_cost; |
1140 | unsigned aregs_needed[N_REG_CLASSES]; | |
5e962776 ZD |
1141 | unsigned depno; |
1142 | struct invariant *dep; | |
87c476a2 | 1143 | bitmap_iterator bi; |
51a69168 | 1144 | int ret = 1; |
5e962776 | 1145 | |
1052bd54 | 1146 | /* Find the representative of the class of the equivalent invariants. */ |
9771b263 | 1147 | inv = invariants[inv->eqto]; |
1052bd54 | 1148 | |
5e962776 | 1149 | *comp_cost = 0; |
1833192f VM |
1150 | if (! flag_ira_loop_pressure) |
1151 | regs_needed[0] = 0; | |
1152 | else | |
1153 | { | |
1756cb66 VM |
1154 | for (i = 0; i < ira_pressure_classes_num; i++) |
1155 | regs_needed[ira_pressure_classes[i]] = 0; | |
1833192f VM |
1156 | } |
1157 | ||
5e962776 ZD |
1158 | if (inv->move |
1159 | || inv->stamp == actual_stamp) | |
51a69168 | 1160 | return -1; |
5e962776 ZD |
1161 | inv->stamp = actual_stamp; |
1162 | ||
1833192f VM |
1163 | if (! flag_ira_loop_pressure) |
1164 | regs_needed[0]++; | |
1165 | else | |
1166 | { | |
1167 | int nregs; | |
1756cb66 | 1168 | enum reg_class pressure_class; |
1833192f | 1169 | |
1756cb66 VM |
1170 | pressure_class = get_pressure_class_and_nregs (inv->insn, &nregs); |
1171 | regs_needed[pressure_class] += nregs; | |
51a69168 ZC |
1172 | *cl = pressure_class; |
1173 | ret = 0; | |
1833192f VM |
1174 | } |
1175 | ||
1bfdbb29 PB |
1176 | if (!inv->cheap_address |
1177 | || inv->def->n_addr_uses < inv->def->n_uses) | |
e42e3d15 | 1178 | (*comp_cost) += inv->cost * inv->eqno; |
5e962776 | 1179 | |
3d8504ac RS |
1180 | #ifdef STACK_REGS |
1181 | { | |
1182 | /* Hoisting constant pool constants into stack regs may cost more than | |
1183 | just single register. On x87, the balance is affected both by the | |
c0220ea4 | 1184 | small number of FP registers, and by its register stack organization, |
3d8504ac RS |
1185 | that forces us to add compensation code in and around the loop to |
1186 | shuffle the operands to the top of stack before use, and pop them | |
1187 | from the stack after the loop finishes. | |
1188 | ||
1189 | To model this effect, we increase the number of registers needed for | |
1190 | stack registers by two: one register push, and one register pop. | |
1191 | This usually has the effect that FP constant loads from the constant | |
1192 | pool are not moved out of the loop. | |
1193 | ||
1194 | Note that this also means that dependent invariants can not be moved. | |
1195 | However, the primary purpose of this pass is to move loop invariant | |
1196 | address arithmetic out of loops, and address arithmetic that depends | |
1197 | on floating point constants is unlikely to ever occur. */ | |
1198 | rtx set = single_set (inv->insn); | |
1199 | if (set | |
1833192f VM |
1200 | && IS_STACK_MODE (GET_MODE (SET_SRC (set))) |
1201 | && constant_pool_constant_p (SET_SRC (set))) | |
1202 | { | |
1203 | if (flag_ira_loop_pressure) | |
1756cb66 | 1204 | regs_needed[ira_stack_reg_pressure_class] += 2; |
1833192f VM |
1205 | else |
1206 | regs_needed[0] += 2; | |
1207 | } | |
3d8504ac RS |
1208 | } |
1209 | #endif | |
1210 | ||
87c476a2 | 1211 | EXECUTE_IF_SET_IN_BITMAP (inv->depends_on, 0, depno, bi) |
5e962776 | 1212 | { |
1833192f | 1213 | bool check_p; |
51a69168 ZC |
1214 | enum reg_class dep_cl = ALL_REGS; |
1215 | int dep_ret; | |
1833192f | 1216 | |
9771b263 | 1217 | dep = invariants[depno]; |
5e962776 | 1218 | |
61fc05c7 ZC |
1219 | /* If DEP is moved out of the loop, it is not a depends_on any more. */ |
1220 | if (dep->move) | |
1221 | continue; | |
1222 | ||
51a69168 | 1223 | dep_ret = get_inv_cost (dep, &acomp_cost, aregs_needed, &dep_cl); |
5e962776 | 1224 | |
1833192f VM |
1225 | if (! flag_ira_loop_pressure) |
1226 | check_p = aregs_needed[0] != 0; | |
1227 | else | |
1228 | { | |
1756cb66 VM |
1229 | for (i = 0; i < ira_pressure_classes_num; i++) |
1230 | if (aregs_needed[ira_pressure_classes[i]] != 0) | |
1833192f | 1231 | break; |
1756cb66 | 1232 | check_p = i < ira_pressure_classes_num; |
51a69168 ZC |
1233 | |
1234 | if ((dep_ret == 1) || ((dep_ret == 0) && (*cl != dep_cl))) | |
1235 | { | |
1236 | *cl = ALL_REGS; | |
1237 | ret = 1; | |
1238 | } | |
1833192f VM |
1239 | } |
1240 | if (check_p | |
5e962776 ZD |
1241 | /* We need to check always_executed, since if the original value of |
1242 | the invariant may be preserved, we may need to keep it in a | |
1243 | separate register. TODO check whether the register has an | |
1244 | use outside of the loop. */ | |
1245 | && dep->always_executed | |
1246 | && !dep->def->uses->next) | |
1247 | { | |
1248 | /* If this is a single use, after moving the dependency we will not | |
1249 | need a new register. */ | |
1833192f VM |
1250 | if (! flag_ira_loop_pressure) |
1251 | aregs_needed[0]--; | |
1252 | else | |
1253 | { | |
1254 | int nregs; | |
1756cb66 | 1255 | enum reg_class pressure_class; |
1833192f | 1256 | |
1756cb66 VM |
1257 | pressure_class = get_pressure_class_and_nregs (inv->insn, &nregs); |
1258 | aregs_needed[pressure_class] -= nregs; | |
1833192f | 1259 | } |
5e962776 ZD |
1260 | } |
1261 | ||
1833192f VM |
1262 | if (! flag_ira_loop_pressure) |
1263 | regs_needed[0] += aregs_needed[0]; | |
1264 | else | |
1265 | { | |
1756cb66 VM |
1266 | for (i = 0; i < ira_pressure_classes_num; i++) |
1267 | regs_needed[ira_pressure_classes[i]] | |
1268 | += aregs_needed[ira_pressure_classes[i]]; | |
1833192f | 1269 | } |
5e962776 | 1270 | (*comp_cost) += acomp_cost; |
87c476a2 | 1271 | } |
51a69168 | 1272 | return ret; |
5e962776 ZD |
1273 | } |
1274 | ||
1275 | /* Calculates gain for eliminating invariant INV. REGS_USED is the number | |
a154b43a ZD |
1276 | of registers used in the loop, NEW_REGS is the number of new variables |
1277 | already added due to the invariant motion. The number of registers needed | |
bec922f0 SL |
1278 | for it is stored in *REGS_NEEDED. SPEED and CALL_P are flags passed |
1279 | through to estimate_reg_pressure_cost. */ | |
5e962776 ZD |
1280 | |
1281 | static int | |
1282 | gain_for_invariant (struct invariant *inv, unsigned *regs_needed, | |
bec922f0 SL |
1283 | unsigned *new_regs, unsigned regs_used, |
1284 | bool speed, bool call_p) | |
5e962776 ZD |
1285 | { |
1286 | int comp_cost, size_cost; | |
e54bd4ab JJ |
1287 | /* Workaround -Wmaybe-uninitialized false positive during |
1288 | profiledbootstrap by initializing it. */ | |
1289 | enum reg_class cl = NO_REGS; | |
51a69168 | 1290 | int ret; |
5e962776 | 1291 | |
5e962776 ZD |
1292 | actual_stamp++; |
1293 | ||
51a69168 | 1294 | ret = get_inv_cost (inv, &comp_cost, regs_needed, &cl); |
1833192f VM |
1295 | |
1296 | if (! flag_ira_loop_pressure) | |
1297 | { | |
1298 | size_cost = (estimate_reg_pressure_cost (new_regs[0] + regs_needed[0], | |
bec922f0 | 1299 | regs_used, speed, call_p) |
1833192f | 1300 | - estimate_reg_pressure_cost (new_regs[0], |
bec922f0 | 1301 | regs_used, speed, call_p)); |
1833192f | 1302 | } |
51a69168 ZC |
1303 | else if (ret < 0) |
1304 | return -1; | |
1305 | else if ((ret == 0) && (cl == NO_REGS)) | |
1306 | /* Hoist it anyway since it does not impact register pressure. */ | |
1307 | return 1; | |
1833192f VM |
1308 | else |
1309 | { | |
1310 | int i; | |
1756cb66 | 1311 | enum reg_class pressure_class; |
1833192f | 1312 | |
1756cb66 | 1313 | for (i = 0; i < ira_pressure_classes_num; i++) |
1833192f | 1314 | { |
1756cb66 | 1315 | pressure_class = ira_pressure_classes[i]; |
51a69168 ZC |
1316 | |
1317 | if (!reg_classes_intersect_p (pressure_class, cl)) | |
1318 | continue; | |
1319 | ||
1756cb66 VM |
1320 | if ((int) new_regs[pressure_class] |
1321 | + (int) regs_needed[pressure_class] | |
1322 | + LOOP_DATA (curr_loop)->max_reg_pressure[pressure_class] | |
1833192f | 1323 | + IRA_LOOP_RESERVED_REGS |
f508f827 | 1324 | > ira_class_hard_regs_num[pressure_class]) |
1833192f VM |
1325 | break; |
1326 | } | |
1756cb66 | 1327 | if (i < ira_pressure_classes_num) |
1833192f VM |
1328 | /* There will be register pressure excess and we want not to |
1329 | make this loop invariant motion. All loop invariants with | |
1330 | non-positive gains will be rejected in function | |
1331 | find_invariants_to_move. Therefore we return the negative | |
1332 | number here. | |
1333 | ||
1334 | One could think that this rejects also expensive loop | |
1335 | invariant motions and this will hurt code performance. | |
1336 | However numerous experiments with different heuristics | |
1337 | taking invariant cost into account did not confirm this | |
1338 | assumption. There are possible explanations for this | |
1339 | result: | |
1340 | o probably all expensive invariants were already moved out | |
1341 | of the loop by PRE and gimple invariant motion pass. | |
1342 | o expensive invariant execution will be hidden by insn | |
1343 | scheduling or OOO processor hardware because usually such | |
1344 | invariants have a lot of freedom to be executed | |
1345 | out-of-order. | |
1346 | Another reason for ignoring invariant cost vs spilling cost | |
1347 | heuristics is also in difficulties to evaluate accurately | |
1348 | spill cost at this stage. */ | |
1349 | return -1; | |
1350 | else | |
1351 | size_cost = 0; | |
1352 | } | |
5e962776 ZD |
1353 | |
1354 | return comp_cost - size_cost; | |
1355 | } | |
1356 | ||
1357 | /* Finds invariant with best gain for moving. Returns the gain, stores | |
1358 | the invariant in *BEST and number of registers needed for it to | |
a154b43a ZD |
1359 | *REGS_NEEDED. REGS_USED is the number of registers used in the loop. |
1360 | NEW_REGS is the number of new variables already added due to invariant | |
1361 | motion. */ | |
5e962776 ZD |
1362 | |
1363 | static int | |
1364 | best_gain_for_invariant (struct invariant **best, unsigned *regs_needed, | |
bec922f0 SL |
1365 | unsigned *new_regs, unsigned regs_used, |
1366 | bool speed, bool call_p) | |
5e962776 ZD |
1367 | { |
1368 | struct invariant *inv; | |
1833192f VM |
1369 | int i, gain = 0, again; |
1370 | unsigned aregs_needed[N_REG_CLASSES], invno; | |
5e962776 | 1371 | |
9771b263 | 1372 | FOR_EACH_VEC_ELT (invariants, invno, inv) |
5e962776 | 1373 | { |
5e962776 ZD |
1374 | if (inv->move) |
1375 | continue; | |
1376 | ||
1052bd54 ZD |
1377 | /* Only consider the "representatives" of equivalent invariants. */ |
1378 | if (inv->eqto != inv->invno) | |
1379 | continue; | |
1380 | ||
1833192f | 1381 | again = gain_for_invariant (inv, aregs_needed, new_regs, regs_used, |
bec922f0 | 1382 | speed, call_p); |
5e962776 ZD |
1383 | if (again > gain) |
1384 | { | |
1385 | gain = again; | |
1386 | *best = inv; | |
1833192f VM |
1387 | if (! flag_ira_loop_pressure) |
1388 | regs_needed[0] = aregs_needed[0]; | |
1389 | else | |
1390 | { | |
1756cb66 VM |
1391 | for (i = 0; i < ira_pressure_classes_num; i++) |
1392 | regs_needed[ira_pressure_classes[i]] | |
1393 | = aregs_needed[ira_pressure_classes[i]]; | |
1833192f | 1394 | } |
5e962776 ZD |
1395 | } |
1396 | } | |
1397 | ||
1398 | return gain; | |
1399 | } | |
1400 | ||
1401 | /* Marks invariant INVNO and all its dependencies for moving. */ | |
1402 | ||
1403 | static void | |
1833192f | 1404 | set_move_mark (unsigned invno, int gain) |
5e962776 | 1405 | { |
9771b263 | 1406 | struct invariant *inv = invariants[invno]; |
87c476a2 | 1407 | bitmap_iterator bi; |
5e962776 | 1408 | |
1052bd54 | 1409 | /* Find the representative of the class of the equivalent invariants. */ |
9771b263 | 1410 | inv = invariants[inv->eqto]; |
1052bd54 | 1411 | |
5e962776 ZD |
1412 | if (inv->move) |
1413 | return; | |
1414 | inv->move = true; | |
1415 | ||
1416 | if (dump_file) | |
1833192f VM |
1417 | { |
1418 | if (gain >= 0) | |
1419 | fprintf (dump_file, "Decided to move invariant %d -- gain %d\n", | |
1420 | invno, gain); | |
1421 | else | |
1422 | fprintf (dump_file, "Decided to move dependent invariant %d\n", | |
1423 | invno); | |
1424 | }; | |
5e962776 | 1425 | |
87c476a2 ZD |
1426 | EXECUTE_IF_SET_IN_BITMAP (inv->depends_on, 0, invno, bi) |
1427 | { | |
1833192f | 1428 | set_move_mark (invno, -1); |
87c476a2 | 1429 | } |
5e962776 ZD |
1430 | } |
1431 | ||
cb20f7e8 | 1432 | /* Determines which invariants to move. */ |
5e962776 ZD |
1433 | |
1434 | static void | |
bec922f0 | 1435 | find_invariants_to_move (bool speed, bool call_p) |
5e962776 | 1436 | { |
1833192f VM |
1437 | int gain; |
1438 | unsigned i, regs_used, regs_needed[N_REG_CLASSES], new_regs[N_REG_CLASSES]; | |
5e962776 ZD |
1439 | struct invariant *inv = NULL; |
1440 | ||
9771b263 | 1441 | if (!invariants.length ()) |
5e962776 ZD |
1442 | return; |
1443 | ||
1833192f | 1444 | if (flag_ira_loop_pressure) |
b8698a0f | 1445 | /* REGS_USED is actually never used when the flag is on. */ |
1833192f VM |
1446 | regs_used = 0; |
1447 | else | |
1448 | /* We do not really do a good job in estimating number of | |
1449 | registers used; we put some initial bound here to stand for | |
1450 | induction variables etc. that we do not detect. */ | |
5e962776 | 1451 | { |
1833192f VM |
1452 | unsigned int n_regs = DF_REG_SIZE (df); |
1453 | ||
1454 | regs_used = 2; | |
b8698a0f | 1455 | |
1833192f | 1456 | for (i = 0; i < n_regs; i++) |
5e962776 | 1457 | { |
1833192f VM |
1458 | if (!DF_REGNO_FIRST_DEF (i) && DF_REGNO_LAST_USE (i)) |
1459 | { | |
1460 | /* This is a value that is used but not changed inside loop. */ | |
1461 | regs_used++; | |
1462 | } | |
5e962776 ZD |
1463 | } |
1464 | } | |
1465 | ||
1833192f VM |
1466 | if (! flag_ira_loop_pressure) |
1467 | new_regs[0] = regs_needed[0] = 0; | |
1468 | else | |
5e962776 | 1469 | { |
1756cb66 VM |
1470 | for (i = 0; (int) i < ira_pressure_classes_num; i++) |
1471 | new_regs[ira_pressure_classes[i]] = 0; | |
1833192f VM |
1472 | } |
1473 | while ((gain = best_gain_for_invariant (&inv, regs_needed, | |
bec922f0 SL |
1474 | new_regs, regs_used, |
1475 | speed, call_p)) > 0) | |
1833192f VM |
1476 | { |
1477 | set_move_mark (inv->invno, gain); | |
1478 | if (! flag_ira_loop_pressure) | |
1479 | new_regs[0] += regs_needed[0]; | |
1480 | else | |
1481 | { | |
1756cb66 VM |
1482 | for (i = 0; (int) i < ira_pressure_classes_num; i++) |
1483 | new_regs[ira_pressure_classes[i]] | |
1484 | += regs_needed[ira_pressure_classes[i]]; | |
1833192f | 1485 | } |
5e962776 ZD |
1486 | } |
1487 | } | |
1488 | ||
43ba743c EB |
1489 | /* Replace the uses, reached by the definition of invariant INV, by REG. |
1490 | ||
1491 | IN_GROUP is nonzero if this is part of a group of changes that must be | |
1492 | performed as a group. In that case, the changes will be stored. The | |
1493 | function `apply_change_group' will validate and apply the changes. */ | |
1494 | ||
1495 | static int | |
1496 | replace_uses (struct invariant *inv, rtx reg, bool in_group) | |
1497 | { | |
1498 | /* Replace the uses we know to be dominated. It saves work for copy | |
1499 | propagation, and also it is necessary so that dependent invariants | |
1500 | are computed right. */ | |
1501 | if (inv->def) | |
1502 | { | |
1503 | struct use *use; | |
1504 | for (use = inv->def->uses; use; use = use->next) | |
1505 | validate_change (use->insn, use->pos, reg, true); | |
1506 | ||
1507 | /* If we aren't part of a larger group, apply the changes now. */ | |
1508 | if (!in_group) | |
1509 | return apply_change_group (); | |
1510 | } | |
1511 | ||
1512 | return 1; | |
1513 | } | |
1514 | ||
ba946209 ZD |
1515 | /* Move invariant INVNO out of the LOOP. Returns true if this succeeds, false |
1516 | otherwise. */ | |
1517 | ||
1518 | static bool | |
cb20f7e8 | 1519 | move_invariant_reg (struct loop *loop, unsigned invno) |
5e962776 | 1520 | { |
9771b263 DN |
1521 | struct invariant *inv = invariants[invno]; |
1522 | struct invariant *repr = invariants[inv->eqto]; | |
5e962776 ZD |
1523 | unsigned i; |
1524 | basic_block preheader = loop_preheader_edge (loop)->src; | |
90b1c344 | 1525 | rtx reg, set, dest, note; |
87c476a2 | 1526 | bitmap_iterator bi; |
43ba743c | 1527 | int regno = -1; |
5e962776 | 1528 | |
ba946209 ZD |
1529 | if (inv->reg) |
1530 | return true; | |
1531 | if (!repr->move) | |
1532 | return false; | |
43ba743c | 1533 | |
1052bd54 ZD |
1534 | /* If this is a representative of the class of equivalent invariants, |
1535 | really move the invariant. Otherwise just replace its use with | |
1536 | the register used for the representative. */ | |
1537 | if (inv == repr) | |
5e962776 | 1538 | { |
1052bd54 | 1539 | if (inv->depends_on) |
5e962776 | 1540 | { |
1052bd54 ZD |
1541 | EXECUTE_IF_SET_IN_BITMAP (inv->depends_on, 0, i, bi) |
1542 | { | |
ba946209 ZD |
1543 | if (!move_invariant_reg (loop, i)) |
1544 | goto fail; | |
1052bd54 | 1545 | } |
87c476a2 | 1546 | } |
5e962776 | 1547 | |
1052bd54 | 1548 | /* Move the set out of the loop. If the set is always executed (we could |
43ba743c EB |
1549 | omit this condition if we know that the register is unused outside of |
1550 | the loop, but it does not seem worth finding out) and it has no uses | |
1551 | that would not be dominated by it, we may just move it (TODO). | |
1552 | Otherwise we need to create a temporary register. */ | |
1052bd54 | 1553 | set = single_set (inv->insn); |
1833192f VM |
1554 | reg = dest = SET_DEST (set); |
1555 | if (GET_CODE (reg) == SUBREG) | |
1556 | reg = SUBREG_REG (reg); | |
1557 | if (REG_P (reg)) | |
1558 | regno = REGNO (reg); | |
1559 | ||
46b71b03 | 1560 | reg = gen_reg_rtx_and_attrs (dest); |
1052bd54 | 1561 | |
90b1c344 | 1562 | /* Try replacing the destination by a new pseudoregister. */ |
43ba743c EB |
1563 | validate_change (inv->insn, &SET_DEST (set), reg, true); |
1564 | ||
1565 | /* As well as all the dominated uses. */ | |
1566 | replace_uses (inv, reg, true); | |
1567 | ||
1568 | /* And validate all the changes. */ | |
1569 | if (!apply_change_group ()) | |
90b1c344 | 1570 | goto fail; |
90b1c344 ZD |
1571 | |
1572 | emit_insn_after (gen_move_insn (dest, reg), inv->insn); | |
1573 | reorder_insns (inv->insn, inv->insn, BB_END (preheader)); | |
1574 | ||
82fa5f8a L |
1575 | /* If there is a REG_EQUAL note on the insn we just moved, and the |
1576 | insn is in a basic block that is not always executed or the note | |
1577 | contains something for which we don't know the invariant status, | |
1578 | the note may no longer be valid after we move the insn. Note that | |
1579 | uses in REG_EQUAL notes are taken into account in the computation | |
1580 | of invariants, so it is safe to retain the note even if it contains | |
1581 | register references for which we know the invariant status. */ | |
1582 | if ((note = find_reg_note (inv->insn, REG_EQUAL, NULL_RTX)) | |
1583 | && (!inv->always_executed | |
1584 | || !check_maybe_invariant (XEXP (note, 0)))) | |
90b1c344 | 1585 | remove_note (inv->insn, note); |
b644b211 SB |
1586 | } |
1587 | else | |
1588 | { | |
ba946209 ZD |
1589 | if (!move_invariant_reg (loop, repr->invno)) |
1590 | goto fail; | |
1052bd54 | 1591 | reg = repr->reg; |
1833192f | 1592 | regno = repr->orig_regno; |
43ba743c EB |
1593 | if (!replace_uses (inv, reg, false)) |
1594 | goto fail; | |
1052bd54 | 1595 | set = single_set (inv->insn); |
4d779342 DB |
1596 | emit_insn_after (gen_move_insn (SET_DEST (set), reg), inv->insn); |
1597 | delete_insn (inv->insn); | |
b644b211 | 1598 | } |
5e962776 | 1599 | |
1052bd54 | 1600 | inv->reg = reg; |
1833192f | 1601 | inv->orig_regno = regno; |
1052bd54 | 1602 | |
ba946209 ZD |
1603 | return true; |
1604 | ||
1605 | fail: | |
1606 | /* If we failed, clear move flag, so that we do not try to move inv | |
1607 | again. */ | |
1608 | if (dump_file) | |
1609 | fprintf (dump_file, "Failed to move invariant %d\n", invno); | |
1610 | inv->move = false; | |
1611 | inv->reg = NULL_RTX; | |
1833192f | 1612 | inv->orig_regno = -1; |
6fb5fa3c | 1613 | |
ba946209 | 1614 | return false; |
5e962776 ZD |
1615 | } |
1616 | ||
1617 | /* Move selected invariant out of the LOOP. Newly created regs are marked | |
cb20f7e8 | 1618 | in TEMPORARY_REGS. */ |
5e962776 ZD |
1619 | |
1620 | static void | |
cb20f7e8 | 1621 | move_invariants (struct loop *loop) |
5e962776 ZD |
1622 | { |
1623 | struct invariant *inv; | |
1624 | unsigned i; | |
1625 | ||
9771b263 | 1626 | FOR_EACH_VEC_ELT (invariants, i, inv) |
1052bd54 | 1627 | move_invariant_reg (loop, i); |
1833192f VM |
1628 | if (flag_ira_loop_pressure && resize_reg_info ()) |
1629 | { | |
9771b263 | 1630 | FOR_EACH_VEC_ELT (invariants, i, inv) |
1833192f VM |
1631 | if (inv->reg != NULL_RTX) |
1632 | { | |
1633 | if (inv->orig_regno >= 0) | |
1634 | setup_reg_classes (REGNO (inv->reg), | |
1635 | reg_preferred_class (inv->orig_regno), | |
1636 | reg_alternate_class (inv->orig_regno), | |
1756cb66 | 1637 | reg_allocno_class (inv->orig_regno)); |
1833192f VM |
1638 | else |
1639 | setup_reg_classes (REGNO (inv->reg), | |
1640 | GENERAL_REGS, NO_REGS, GENERAL_REGS); | |
1641 | } | |
1642 | } | |
5e962776 ZD |
1643 | } |
1644 | ||
1645 | /* Initializes invariant motion data. */ | |
1646 | ||
1647 | static void | |
1648 | init_inv_motion_data (void) | |
1649 | { | |
1650 | actual_stamp = 1; | |
1651 | ||
9771b263 | 1652 | invariants.create (100); |
5e962776 ZD |
1653 | } |
1654 | ||
cb20f7e8 | 1655 | /* Frees the data allocated by invariant motion. */ |
5e962776 ZD |
1656 | |
1657 | static void | |
cb20f7e8 | 1658 | free_inv_motion_data (void) |
5e962776 ZD |
1659 | { |
1660 | unsigned i; | |
1661 | struct def *def; | |
1662 | struct invariant *inv; | |
1663 | ||
6fb5fa3c DB |
1664 | check_invariant_table_size (); |
1665 | for (i = 0; i < DF_DEFS_TABLE_SIZE (); i++) | |
5e962776 | 1666 | { |
6fb5fa3c DB |
1667 | inv = invariant_table[i]; |
1668 | if (inv) | |
1669 | { | |
1670 | def = inv->def; | |
1671 | gcc_assert (def != NULL); | |
b8698a0f | 1672 | |
6fb5fa3c DB |
1673 | free_use_list (def->uses); |
1674 | free (def); | |
1675 | invariant_table[i] = NULL; | |
1676 | } | |
5e962776 ZD |
1677 | } |
1678 | ||
9771b263 | 1679 | FOR_EACH_VEC_ELT (invariants, i, inv) |
5e962776 | 1680 | { |
8bdbfff5 | 1681 | BITMAP_FREE (inv->depends_on); |
5e962776 ZD |
1682 | free (inv); |
1683 | } | |
9771b263 | 1684 | invariants.release (); |
5e962776 ZD |
1685 | } |
1686 | ||
cb20f7e8 | 1687 | /* Move the invariants out of the LOOP. */ |
5e962776 ZD |
1688 | |
1689 | static void | |
cb20f7e8 | 1690 | move_single_loop_invariants (struct loop *loop) |
5e962776 ZD |
1691 | { |
1692 | init_inv_motion_data (); | |
1693 | ||
cb20f7e8 | 1694 | find_invariants (loop); |
bec922f0 SL |
1695 | find_invariants_to_move (optimize_loop_for_speed_p (loop), |
1696 | LOOP_DATA (loop)->has_call); | |
cb20f7e8 | 1697 | move_invariants (loop); |
5e962776 | 1698 | |
cb20f7e8 | 1699 | free_inv_motion_data (); |
5e962776 ZD |
1700 | } |
1701 | ||
1702 | /* Releases the auxiliary data for LOOP. */ | |
1703 | ||
1704 | static void | |
1705 | free_loop_data (struct loop *loop) | |
1706 | { | |
1707 | struct loop_data *data = LOOP_DATA (loop); | |
eb149440 RG |
1708 | if (!data) |
1709 | return; | |
5e962776 | 1710 | |
1833192f VM |
1711 | bitmap_clear (&LOOP_DATA (loop)->regs_ref); |
1712 | bitmap_clear (&LOOP_DATA (loop)->regs_live); | |
5e962776 ZD |
1713 | free (data); |
1714 | loop->aux = NULL; | |
1715 | } | |
1716 | ||
1833192f VM |
1717 | \f |
1718 | ||
1719 | /* Registers currently living. */ | |
1720 | static bitmap_head curr_regs_live; | |
1721 | ||
1756cb66 | 1722 | /* Current reg pressure for each pressure class. */ |
1833192f VM |
1723 | static int curr_reg_pressure[N_REG_CLASSES]; |
1724 | ||
1725 | /* Record all regs that are set in any one insn. Communication from | |
1726 | mark_reg_{store,clobber} and global_conflicts. Asm can refer to | |
1727 | all hard-registers. */ | |
1728 | static rtx regs_set[(FIRST_PSEUDO_REGISTER > MAX_RECOG_OPERANDS | |
1729 | ? FIRST_PSEUDO_REGISTER : MAX_RECOG_OPERANDS) * 2]; | |
1730 | /* Number of regs stored in the previous array. */ | |
1731 | static int n_regs_set; | |
1732 | ||
1756cb66 | 1733 | /* Return pressure class and number of needed hard registers (through |
b8698a0f | 1734 | *NREGS) of register REGNO. */ |
1833192f | 1735 | static enum reg_class |
1756cb66 | 1736 | get_regno_pressure_class (int regno, int *nregs) |
1833192f VM |
1737 | { |
1738 | if (regno >= FIRST_PSEUDO_REGISTER) | |
1739 | { | |
1756cb66 | 1740 | enum reg_class pressure_class; |
1833192f | 1741 | |
1756cb66 VM |
1742 | pressure_class = reg_allocno_class (regno); |
1743 | pressure_class = ira_pressure_class_translate[pressure_class]; | |
1744 | *nregs | |
1745 | = ira_reg_class_max_nregs[pressure_class][PSEUDO_REGNO_MODE (regno)]; | |
1746 | return pressure_class; | |
1833192f VM |
1747 | } |
1748 | else if (! TEST_HARD_REG_BIT (ira_no_alloc_regs, regno) | |
1749 | && ! TEST_HARD_REG_BIT (eliminable_regset, regno)) | |
1750 | { | |
1751 | *nregs = 1; | |
1756cb66 | 1752 | return ira_pressure_class_translate[REGNO_REG_CLASS (regno)]; |
1833192f VM |
1753 | } |
1754 | else | |
1755 | { | |
1756 | *nregs = 0; | |
1757 | return NO_REGS; | |
1758 | } | |
1759 | } | |
1760 | ||
1761 | /* Increase (if INCR_P) or decrease current register pressure for | |
1762 | register REGNO. */ | |
1763 | static void | |
1764 | change_pressure (int regno, bool incr_p) | |
1765 | { | |
1766 | int nregs; | |
1756cb66 | 1767 | enum reg_class pressure_class; |
1833192f | 1768 | |
1756cb66 | 1769 | pressure_class = get_regno_pressure_class (regno, &nregs); |
1833192f | 1770 | if (! incr_p) |
1756cb66 | 1771 | curr_reg_pressure[pressure_class] -= nregs; |
1833192f VM |
1772 | else |
1773 | { | |
1756cb66 VM |
1774 | curr_reg_pressure[pressure_class] += nregs; |
1775 | if (LOOP_DATA (curr_loop)->max_reg_pressure[pressure_class] | |
1776 | < curr_reg_pressure[pressure_class]) | |
1777 | LOOP_DATA (curr_loop)->max_reg_pressure[pressure_class] | |
1778 | = curr_reg_pressure[pressure_class]; | |
1833192f VM |
1779 | } |
1780 | } | |
1781 | ||
1782 | /* Mark REGNO birth. */ | |
1783 | static void | |
1784 | mark_regno_live (int regno) | |
1785 | { | |
1786 | struct loop *loop; | |
1787 | ||
1788 | for (loop = curr_loop; | |
1789 | loop != current_loops->tree_root; | |
1790 | loop = loop_outer (loop)) | |
1791 | bitmap_set_bit (&LOOP_DATA (loop)->regs_live, regno); | |
fcaa4ca4 | 1792 | if (!bitmap_set_bit (&curr_regs_live, regno)) |
1833192f | 1793 | return; |
1833192f VM |
1794 | change_pressure (regno, true); |
1795 | } | |
1796 | ||
1797 | /* Mark REGNO death. */ | |
1798 | static void | |
1799 | mark_regno_death (int regno) | |
1800 | { | |
fcaa4ca4 | 1801 | if (! bitmap_clear_bit (&curr_regs_live, regno)) |
1833192f | 1802 | return; |
1833192f VM |
1803 | change_pressure (regno, false); |
1804 | } | |
1805 | ||
1806 | /* Mark setting register REG. */ | |
1807 | static void | |
1808 | mark_reg_store (rtx reg, const_rtx setter ATTRIBUTE_UNUSED, | |
1809 | void *data ATTRIBUTE_UNUSED) | |
1810 | { | |
1811 | int regno; | |
1812 | ||
1813 | if (GET_CODE (reg) == SUBREG) | |
1814 | reg = SUBREG_REG (reg); | |
1815 | ||
1816 | if (! REG_P (reg)) | |
1817 | return; | |
1818 | ||
1819 | regs_set[n_regs_set++] = reg; | |
1820 | ||
1821 | regno = REGNO (reg); | |
1822 | ||
1823 | if (regno >= FIRST_PSEUDO_REGISTER) | |
1824 | mark_regno_live (regno); | |
1825 | else | |
1826 | { | |
1827 | int last = regno + hard_regno_nregs[regno][GET_MODE (reg)]; | |
1828 | ||
1829 | while (regno < last) | |
1830 | { | |
1831 | mark_regno_live (regno); | |
1832 | regno++; | |
1833 | } | |
1834 | } | |
1835 | } | |
1836 | ||
1837 | /* Mark clobbering register REG. */ | |
1838 | static void | |
1839 | mark_reg_clobber (rtx reg, const_rtx setter, void *data) | |
1840 | { | |
1841 | if (GET_CODE (setter) == CLOBBER) | |
1842 | mark_reg_store (reg, setter, data); | |
1843 | } | |
1844 | ||
1845 | /* Mark register REG death. */ | |
1846 | static void | |
1847 | mark_reg_death (rtx reg) | |
1848 | { | |
1849 | int regno = REGNO (reg); | |
1850 | ||
1851 | if (regno >= FIRST_PSEUDO_REGISTER) | |
1852 | mark_regno_death (regno); | |
1853 | else | |
1854 | { | |
1855 | int last = regno + hard_regno_nregs[regno][GET_MODE (reg)]; | |
1856 | ||
1857 | while (regno < last) | |
1858 | { | |
1859 | mark_regno_death (regno); | |
1860 | regno++; | |
1861 | } | |
1862 | } | |
1863 | } | |
1864 | ||
1865 | /* Mark occurrence of registers in X for the current loop. */ | |
1866 | static void | |
1867 | mark_ref_regs (rtx x) | |
1868 | { | |
1869 | RTX_CODE code; | |
1870 | int i; | |
1871 | const char *fmt; | |
1872 | ||
1873 | if (!x) | |
1874 | return; | |
1875 | ||
1876 | code = GET_CODE (x); | |
1877 | if (code == REG) | |
1878 | { | |
1879 | struct loop *loop; | |
b8698a0f | 1880 | |
1833192f VM |
1881 | for (loop = curr_loop; |
1882 | loop != current_loops->tree_root; | |
1883 | loop = loop_outer (loop)) | |
1884 | bitmap_set_bit (&LOOP_DATA (loop)->regs_ref, REGNO (x)); | |
1885 | return; | |
1886 | } | |
1887 | ||
1888 | fmt = GET_RTX_FORMAT (code); | |
1889 | for (i = GET_RTX_LENGTH (code) - 1; i >= 0; i--) | |
1890 | if (fmt[i] == 'e') | |
1891 | mark_ref_regs (XEXP (x, i)); | |
1892 | else if (fmt[i] == 'E') | |
1893 | { | |
1894 | int j; | |
b8698a0f | 1895 | |
1833192f VM |
1896 | for (j = 0; j < XVECLEN (x, i); j++) |
1897 | mark_ref_regs (XVECEXP (x, i, j)); | |
1898 | } | |
1899 | } | |
1900 | ||
1901 | /* Calculate register pressure in the loops. */ | |
1902 | static void | |
1903 | calculate_loop_reg_pressure (void) | |
1904 | { | |
1905 | int i; | |
1906 | unsigned int j; | |
1907 | bitmap_iterator bi; | |
1908 | basic_block bb; | |
89bfd6f5 DM |
1909 | rtx_insn *insn; |
1910 | rtx link; | |
1833192f | 1911 | struct loop *loop, *parent; |
1833192f | 1912 | |
f0bd40b1 | 1913 | FOR_EACH_LOOP (loop, 0) |
1833192f VM |
1914 | if (loop->aux == NULL) |
1915 | { | |
1916 | loop->aux = xcalloc (1, sizeof (struct loop_data)); | |
1917 | bitmap_initialize (&LOOP_DATA (loop)->regs_ref, ®_obstack); | |
1918 | bitmap_initialize (&LOOP_DATA (loop)->regs_live, ®_obstack); | |
1919 | } | |
8d49e7ef | 1920 | ira_setup_eliminable_regset (); |
1833192f | 1921 | bitmap_initialize (&curr_regs_live, ®_obstack); |
11cd3bed | 1922 | FOR_EACH_BB_FN (bb, cfun) |
1833192f VM |
1923 | { |
1924 | curr_loop = bb->loop_father; | |
1925 | if (curr_loop == current_loops->tree_root) | |
1926 | continue; | |
1927 | ||
1928 | for (loop = curr_loop; | |
1929 | loop != current_loops->tree_root; | |
1930 | loop = loop_outer (loop)) | |
1931 | bitmap_ior_into (&LOOP_DATA (loop)->regs_live, DF_LR_IN (bb)); | |
1932 | ||
1933 | bitmap_copy (&curr_regs_live, DF_LR_IN (bb)); | |
1756cb66 VM |
1934 | for (i = 0; i < ira_pressure_classes_num; i++) |
1935 | curr_reg_pressure[ira_pressure_classes[i]] = 0; | |
1833192f VM |
1936 | EXECUTE_IF_SET_IN_BITMAP (&curr_regs_live, 0, j, bi) |
1937 | change_pressure (j, true); | |
1938 | ||
1939 | FOR_BB_INSNS (bb, insn) | |
1940 | { | |
dd8c071d | 1941 | if (! NONDEBUG_INSN_P (insn)) |
1833192f VM |
1942 | continue; |
1943 | ||
1944 | mark_ref_regs (PATTERN (insn)); | |
1945 | n_regs_set = 0; | |
1946 | note_stores (PATTERN (insn), mark_reg_clobber, NULL); | |
b8698a0f | 1947 | |
1833192f | 1948 | /* Mark any registers dead after INSN as dead now. */ |
b8698a0f | 1949 | |
1833192f VM |
1950 | for (link = REG_NOTES (insn); link; link = XEXP (link, 1)) |
1951 | if (REG_NOTE_KIND (link) == REG_DEAD) | |
1952 | mark_reg_death (XEXP (link, 0)); | |
b8698a0f | 1953 | |
1833192f VM |
1954 | /* Mark any registers set in INSN as live, |
1955 | and mark them as conflicting with all other live regs. | |
1956 | Clobbers are processed again, so they conflict with | |
1957 | the registers that are set. */ | |
b8698a0f | 1958 | |
1833192f | 1959 | note_stores (PATTERN (insn), mark_reg_store, NULL); |
b8698a0f | 1960 | |
1833192f VM |
1961 | #ifdef AUTO_INC_DEC |
1962 | for (link = REG_NOTES (insn); link; link = XEXP (link, 1)) | |
1963 | if (REG_NOTE_KIND (link) == REG_INC) | |
1964 | mark_reg_store (XEXP (link, 0), NULL_RTX, NULL); | |
1965 | #endif | |
1966 | while (n_regs_set-- > 0) | |
1967 | { | |
1968 | rtx note = find_regno_note (insn, REG_UNUSED, | |
1969 | REGNO (regs_set[n_regs_set])); | |
1970 | if (! note) | |
1971 | continue; | |
b8698a0f | 1972 | |
1833192f VM |
1973 | mark_reg_death (XEXP (note, 0)); |
1974 | } | |
1975 | } | |
1976 | } | |
1977 | bitmap_clear (&curr_regs_live); | |
1978 | if (flag_ira_region == IRA_REGION_MIXED | |
1979 | || flag_ira_region == IRA_REGION_ALL) | |
f0bd40b1 | 1980 | FOR_EACH_LOOP (loop, 0) |
1833192f VM |
1981 | { |
1982 | EXECUTE_IF_SET_IN_BITMAP (&LOOP_DATA (loop)->regs_live, 0, j, bi) | |
1983 | if (! bitmap_bit_p (&LOOP_DATA (loop)->regs_ref, j)) | |
1984 | { | |
1756cb66 | 1985 | enum reg_class pressure_class; |
1833192f VM |
1986 | int nregs; |
1987 | ||
1756cb66 VM |
1988 | pressure_class = get_regno_pressure_class (j, &nregs); |
1989 | LOOP_DATA (loop)->max_reg_pressure[pressure_class] -= nregs; | |
1833192f VM |
1990 | } |
1991 | } | |
1992 | if (dump_file == NULL) | |
1993 | return; | |
f0bd40b1 | 1994 | FOR_EACH_LOOP (loop, 0) |
1833192f VM |
1995 | { |
1996 | parent = loop_outer (loop); | |
1997 | fprintf (dump_file, "\n Loop %d (parent %d, header bb%d, depth %d)\n", | |
1998 | loop->num, (parent == NULL ? -1 : parent->num), | |
1999 | loop->header->index, loop_depth (loop)); | |
2000 | fprintf (dump_file, "\n ref. regnos:"); | |
2001 | EXECUTE_IF_SET_IN_BITMAP (&LOOP_DATA (loop)->regs_ref, 0, j, bi) | |
2002 | fprintf (dump_file, " %d", j); | |
2003 | fprintf (dump_file, "\n live regnos:"); | |
2004 | EXECUTE_IF_SET_IN_BITMAP (&LOOP_DATA (loop)->regs_live, 0, j, bi) | |
2005 | fprintf (dump_file, " %d", j); | |
2006 | fprintf (dump_file, "\n Pressure:"); | |
1756cb66 | 2007 | for (i = 0; (int) i < ira_pressure_classes_num; i++) |
1833192f | 2008 | { |
1756cb66 | 2009 | enum reg_class pressure_class; |
b8698a0f | 2010 | |
1756cb66 VM |
2011 | pressure_class = ira_pressure_classes[i]; |
2012 | if (LOOP_DATA (loop)->max_reg_pressure[pressure_class] == 0) | |
1833192f | 2013 | continue; |
1756cb66 VM |
2014 | fprintf (dump_file, " %s=%d", reg_class_names[pressure_class], |
2015 | LOOP_DATA (loop)->max_reg_pressure[pressure_class]); | |
1833192f VM |
2016 | } |
2017 | fprintf (dump_file, "\n"); | |
2018 | } | |
2019 | } | |
2020 | ||
2021 | \f | |
2022 | ||
d73be268 | 2023 | /* Move the invariants out of the loops. */ |
5e962776 ZD |
2024 | |
2025 | void | |
d73be268 | 2026 | move_loop_invariants (void) |
5e962776 ZD |
2027 | { |
2028 | struct loop *loop; | |
cb20f7e8 | 2029 | |
1833192f VM |
2030 | if (flag_ira_loop_pressure) |
2031 | { | |
2032 | df_analyze (); | |
1756cb66 | 2033 | regstat_init_n_sets_and_refs (); |
b11f0116 | 2034 | ira_set_pseudo_classes (true, dump_file); |
1833192f | 2035 | calculate_loop_reg_pressure (); |
1756cb66 | 2036 | regstat_free_n_sets_and_refs (); |
1833192f | 2037 | } |
6fb5fa3c | 2038 | df_set_flags (DF_EQ_NOTES + DF_DEFER_INSN_RESCAN); |
5e962776 | 2039 | /* Process the loops, innermost first. */ |
f0bd40b1 | 2040 | FOR_EACH_LOOP (loop, LI_FROM_INNERMOST) |
5e962776 | 2041 | { |
1833192f | 2042 | curr_loop = loop; |
b1fb9f56 JJ |
2043 | /* move_single_loop_invariants for very large loops |
2044 | is time consuming and might need a lot of memory. */ | |
2045 | if (loop->num_nodes <= (unsigned) LOOP_INVARIANT_MAX_BBS_IN_LOOP) | |
2046 | move_single_loop_invariants (loop); | |
5e962776 ZD |
2047 | } |
2048 | ||
f0bd40b1 | 2049 | FOR_EACH_LOOP (loop, 0) |
42fd6772 ZD |
2050 | { |
2051 | free_loop_data (loop); | |
2052 | } | |
5e962776 | 2053 | |
1833192f VM |
2054 | if (flag_ira_loop_pressure) |
2055 | /* There is no sense to keep this info because it was most | |
2056 | probably outdated by subsequent passes. */ | |
2057 | free_reg_info (); | |
6fb5fa3c DB |
2058 | free (invariant_table); |
2059 | invariant_table = NULL; | |
2060 | invariant_table_size = 0; | |
a7f4ccb1 SB |
2061 | |
2062 | #ifdef ENABLE_CHECKING | |
2063 | verify_flow_info (); | |
2064 | #endif | |
5e962776 | 2065 | } |