]>
Commit | Line | Data |
---|---|---|
b9a06185 | 1 | /* Register renaming for the GNU compiler. |
fbd26352 | 2 | Copyright (C) 2000-2019 Free Software Foundation, Inc. |
b9a06185 | 3 | |
f12b58b3 | 4 | This file is part of GCC. |
b9a06185 | 5 | |
f12b58b3 | 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 | |
8c4c00c1 | 8 | the Free Software Foundation; either version 3, or (at your option) |
b9a06185 | 9 | any later version. |
10 | ||
f12b58b3 | 11 | GCC is distributed in the hope that it will be useful, but WITHOUT |
12 | ANY WARRANTY; without even the implied warranty of MERCHANTABILITY | |
13 | or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public | |
14 | License for more details. | |
b9a06185 | 15 | |
16 | You should have received a copy of the GNU General Public License | |
8c4c00c1 | 17 | along with GCC; see the file COPYING3. If not see |
18 | <http://www.gnu.org/licenses/>. */ | |
b9a06185 | 19 | |
20 | #include "config.h" | |
21 | #include "system.h" | |
805e22b2 | 22 | #include "coretypes.h" |
9ef16211 | 23 | #include "backend.h" |
7c29e30e | 24 | #include "target.h" |
9ef16211 | 25 | #include "rtl.h" |
26 | #include "df.h" | |
ad7b10a2 | 27 | #include "memmodel.h" |
1140e77e | 28 | #include "tm_p.h" |
b9a06185 | 29 | #include "insn-config.h" |
30 | #include "regs.h" | |
7c29e30e | 31 | #include "emit-rtl.h" |
32 | #include "recog.h" | |
00cb30dc | 33 | #include "addresses.h" |
94ea8568 | 34 | #include "cfganal.h" |
77fce4cd | 35 | #include "tree-pass.h" |
7de639a2 | 36 | #include "regrename.h" |
1140e77e | 37 | |
9f3e3774 | 38 | /* This file implements the RTL register renaming pass of the compiler. It is |
39 | a semi-local pass whose goal is to maximize the usage of the register file | |
40 | of the processor by substituting registers for others in the solution given | |
41 | by the register allocator. The algorithm is as follows: | |
42 | ||
43 | 1. Local def/use chains are built: within each basic block, chains are | |
44 | opened and closed; if a chain isn't closed at the end of the block, | |
31adcf56 | 45 | it is dropped. We pre-open chains if we have already examined a |
46 | predecessor block and found chains live at the end which match | |
47 | live registers at the start of the new block. | |
9f3e3774 | 48 | |
31adcf56 | 49 | 2. We try to combine the local chains across basic block boundaries by |
50 | comparing chains that were open at the start or end of a block to | |
51 | those in successor/predecessor blocks. | |
52 | ||
53 | 3. For each chain, the set of possible renaming registers is computed. | |
9f3e3774 | 54 | This takes into account the renaming of previously processed chains. |
55 | Optionally, a preferred class is computed for the renaming register. | |
56 | ||
31adcf56 | 57 | 4. The best renaming register is computed for the chain in the above set, |
9f3e3774 | 58 | using a round-robin allocation. If a preferred class exists, then the |
59 | round-robin allocation is done within the class first, if possible. | |
60 | The round-robin allocation of renaming registers itself is global. | |
61 | ||
31adcf56 | 62 | 5. If a renaming register has been found, it is substituted in the chain. |
9f3e3774 | 63 | |
64 | Targets can parameterize the pass by specifying a preferred class for the | |
e2ea3e5a | 65 | renaming register for a given (super)class of registers to be renamed. |
66 | ||
67 | DEBUG_INSNs are treated specially, in particular registers occurring inside | |
68 | them are treated as requiring ALL_REGS as a class. */ | |
9f3e3774 | 69 | |
c38fa63b | 70 | #if HOST_BITS_PER_WIDE_INT <= MAX_RECOG_OPERANDS |
71 | #error "Use a different bitmap implementation for untracked_operands." | |
72 | #endif | |
9f3e3774 | 73 | |
1140e77e | 74 | enum scan_actions |
75 | { | |
1140e77e | 76 | terminate_write, |
77 | terminate_dead, | |
7197e178 | 78 | mark_all_read, |
1140e77e | 79 | mark_read, |
b9d576f5 | 80 | mark_write, |
81 | /* mark_access is for marking the destination regs in | |
82 | REG_FRAME_RELATED_EXPR notes (as if they were read) so that the | |
83 | note is updated properly. */ | |
84 | mark_access | |
1140e77e | 85 | }; |
86 | ||
87 | static const char * const scan_actions_name[] = | |
88 | { | |
1140e77e | 89 | "terminate_write", |
90 | "terminate_dead", | |
7197e178 | 91 | "mark_all_read", |
1140e77e | 92 | "mark_read", |
b9d576f5 | 93 | "mark_write", |
94 | "mark_access" | |
1140e77e | 95 | }; |
96 | ||
8fe3bc87 | 97 | /* TICK and THIS_TICK are used to record the last time we saw each |
98 | register. */ | |
99 | static int tick[FIRST_PSEUDO_REGISTER]; | |
100 | static int this_tick = 0; | |
101 | ||
1140e77e | 102 | static struct obstack rename_obstack; |
103 | ||
7de639a2 | 104 | /* If nonnull, the code calling into the register renamer requested |
105 | information about insn operands, and we store it here. */ | |
f1f41a6c | 106 | vec<insn_rr_info> insn_rr; |
7de639a2 | 107 | |
05d5500b | 108 | static void scan_rtx (rtx_insn *, rtx *, enum reg_class, enum scan_actions, |
de67d37e | 109 | enum op_type); |
31adcf56 | 110 | static bool build_def_use (basic_block); |
d5dfb455 | 111 | |
8fe3bc87 | 112 | /* The id to be given to the next opened chain. */ |
113 | static unsigned current_id; | |
114 | ||
115 | /* A mapping of unique id numbers to chains. */ | |
f1f41a6c | 116 | static vec<du_head_p> id_to_chain; |
d5dfb455 | 117 | |
31adcf56 | 118 | /* List of currently open chains. */ |
8fe3bc87 | 119 | static struct du_head *open_chains; |
8fe3bc87 | 120 | |
121 | /* Bitmap of open chains. The bits set always match the list found in | |
122 | open_chains. */ | |
123 | static bitmap_head open_chains_set; | |
124 | ||
125 | /* Record the registers being tracked in open_chains. */ | |
126 | static HARD_REG_SET live_in_chains; | |
127 | ||
128 | /* Record the registers that are live but not tracked. The intersection | |
129 | between this and live_in_chains is empty. */ | |
130 | static HARD_REG_SET live_hard_regs; | |
131 | ||
7de639a2 | 132 | /* Set while scanning RTL if INSN_RR is nonnull, i.e. if the current analysis |
133 | is for a caller that requires operand data. Used in | |
134 | record_operand_use. */ | |
135 | static operand_rr_info *cur_operand; | |
136 | ||
19694471 | 137 | /* Set while scanning RTL if a register dies. Used to tie chains. */ |
138 | static struct du_head *terminated_this_insn; | |
139 | ||
31adcf56 | 140 | /* Return the chain corresponding to id number ID. Take into account that |
141 | chains may have been merged. */ | |
7de639a2 | 142 | du_head_p |
143 | regrename_chain_from_id (unsigned int id) | |
31adcf56 | 144 | { |
f1f41a6c | 145 | du_head_p first_chain = id_to_chain[id]; |
31adcf56 | 146 | du_head_p chain = first_chain; |
147 | while (chain->id != id) | |
148 | { | |
149 | id = chain->id; | |
f1f41a6c | 150 | chain = id_to_chain[id]; |
31adcf56 | 151 | } |
152 | first_chain->id = id; | |
153 | return chain; | |
154 | } | |
155 | ||
156 | /* Dump all def/use chains, starting at id FROM. */ | |
8fe3bc87 | 157 | |
158 | static void | |
31adcf56 | 159 | dump_def_use_chain (int from) |
8fe3bc87 | 160 | { |
31adcf56 | 161 | du_head_p head; |
162 | int i; | |
f1f41a6c | 163 | FOR_EACH_VEC_ELT_FROM (id_to_chain, i, head, from) |
8fe3bc87 | 164 | { |
165 | struct du_chain *this_du = head->first; | |
31adcf56 | 166 | |
8fe3bc87 | 167 | fprintf (dump_file, "Register %s (%d):", |
168 | reg_names[head->regno], head->nregs); | |
169 | while (this_du) | |
170 | { | |
171 | fprintf (dump_file, " %d [%s]", INSN_UID (this_du->insn), | |
172 | reg_class_names[this_du->cl]); | |
173 | this_du = this_du->next_use; | |
174 | } | |
175 | fprintf (dump_file, "\n"); | |
176 | head = head->next_chain; | |
177 | } | |
178 | } | |
179 | ||
d5dfb455 | 180 | static void |
7197e178 | 181 | free_chain_data (void) |
d5dfb455 | 182 | { |
7197e178 | 183 | int i; |
184 | du_head_p ptr; | |
f1f41a6c | 185 | for (i = 0; id_to_chain.iterate (i, &ptr); i++) |
7197e178 | 186 | bitmap_clear (&ptr->conflicts); |
feb90512 | 187 | |
f1f41a6c | 188 | id_to_chain.release (); |
d5dfb455 | 189 | } |
190 | ||
92effe69 | 191 | /* Walk all chains starting with CHAINS and record that they conflict with |
192 | another chain whose id is ID. */ | |
193 | ||
194 | static void | |
195 | mark_conflict (struct du_head *chains, unsigned id) | |
196 | { | |
197 | while (chains) | |
198 | { | |
199 | bitmap_set_bit (&chains->conflicts, id); | |
200 | chains = chains->next_chain; | |
201 | } | |
202 | } | |
203 | ||
7de639a2 | 204 | /* Examine cur_operand, and if it is nonnull, record information about the |
205 | use THIS_DU which is part of the chain HEAD. */ | |
206 | ||
207 | static void | |
208 | record_operand_use (struct du_head *head, struct du_chain *this_du) | |
209 | { | |
3c28a3eb | 210 | if (cur_operand == NULL || cur_operand->failed) |
7de639a2 | 211 | return; |
3c28a3eb | 212 | if (head->cannot_rename) |
213 | { | |
214 | cur_operand->failed = true; | |
215 | return; | |
216 | } | |
7de639a2 | 217 | gcc_assert (cur_operand->n_chains < MAX_REGS_PER_ADDRESS); |
218 | cur_operand->heads[cur_operand->n_chains] = head; | |
219 | cur_operand->chains[cur_operand->n_chains++] = this_du; | |
220 | } | |
221 | ||
92effe69 | 222 | /* Create a new chain for THIS_NREGS registers starting at THIS_REGNO, |
223 | and record its occurrence in *LOC, which is being written to in INSN. | |
224 | This access requires a register of class CL. */ | |
225 | ||
31adcf56 | 226 | static du_head_p |
92effe69 | 227 | create_new_chain (unsigned this_regno, unsigned this_nregs, rtx *loc, |
05d5500b | 228 | rtx_insn *insn, enum reg_class cl) |
92effe69 | 229 | { |
230 | struct du_head *head = XOBNEW (&rename_obstack, struct du_head); | |
231 | struct du_chain *this_du; | |
232 | int nregs; | |
233 | ||
7da7f1c6 | 234 | memset ((void *)head, 0, sizeof *head); |
92effe69 | 235 | head->next_chain = open_chains; |
92effe69 | 236 | head->regno = this_regno; |
237 | head->nregs = this_nregs; | |
92effe69 | 238 | |
f1f41a6c | 239 | id_to_chain.safe_push (head); |
92effe69 | 240 | head->id = current_id++; |
241 | ||
242 | bitmap_initialize (&head->conflicts, &bitmap_default_obstack); | |
243 | bitmap_copy (&head->conflicts, &open_chains_set); | |
244 | mark_conflict (open_chains, head->id); | |
245 | ||
246 | /* Since we're tracking this as a chain now, remove it from the | |
247 | list of conflicting live hard registers and track it in | |
248 | live_in_chains instead. */ | |
249 | nregs = head->nregs; | |
250 | while (nregs-- > 0) | |
251 | { | |
252 | SET_HARD_REG_BIT (live_in_chains, head->regno + nregs); | |
253 | CLEAR_HARD_REG_BIT (live_hard_regs, head->regno + nregs); | |
254 | } | |
255 | ||
256 | COPY_HARD_REG_SET (head->hard_conflicts, live_hard_regs); | |
257 | bitmap_set_bit (&open_chains_set, head->id); | |
258 | ||
259 | open_chains = head; | |
260 | ||
261 | if (dump_file) | |
262 | { | |
263 | fprintf (dump_file, "Creating chain %s (%d)", | |
264 | reg_names[head->regno], head->id); | |
265 | if (insn != NULL_RTX) | |
266 | fprintf (dump_file, " at insn %d", INSN_UID (insn)); | |
267 | fprintf (dump_file, "\n"); | |
268 | } | |
269 | ||
270 | if (insn == NULL_RTX) | |
271 | { | |
272 | head->first = head->last = NULL; | |
31adcf56 | 273 | return head; |
92effe69 | 274 | } |
275 | ||
276 | this_du = XOBNEW (&rename_obstack, struct du_chain); | |
277 | head->first = head->last = this_du; | |
278 | ||
279 | this_du->next_use = 0; | |
280 | this_du->loc = loc; | |
281 | this_du->insn = insn; | |
282 | this_du->cl = cl; | |
7de639a2 | 283 | record_operand_use (head, this_du); |
31adcf56 | 284 | return head; |
92effe69 | 285 | } |
286 | ||
7197e178 | 287 | /* For a def-use chain HEAD, find which registers overlap its lifetime and |
288 | set the corresponding bits in *PSET. */ | |
d5dfb455 | 289 | |
290 | static void | |
7197e178 | 291 | merge_overlapping_regs (HARD_REG_SET *pset, struct du_head *head) |
d5dfb455 | 292 | { |
7197e178 | 293 | bitmap_iterator bi; |
294 | unsigned i; | |
295 | IOR_HARD_REG_SET (*pset, head->hard_conflicts); | |
296 | EXECUTE_IF_SET_IN_BITMAP (&head->conflicts, 0, i, bi) | |
98ce3092 | 297 | { |
7de639a2 | 298 | du_head_p other = regrename_chain_from_id (i); |
7197e178 | 299 | unsigned j = other->nregs; |
31adcf56 | 300 | gcc_assert (other != head); |
7197e178 | 301 | while (j-- > 0) |
302 | SET_HARD_REG_BIT (*pset, other->regno + j); | |
d5dfb455 | 303 | } |
304 | } | |
305 | ||
d78118a3 | 306 | /* Check if NEW_REG can be the candidate register to rename for |
307 | REG in THIS_HEAD chain. THIS_UNAVAILABLE is a set of unavailable hard | |
308 | registers. */ | |
309 | ||
310 | static bool | |
57ce0a99 | 311 | check_new_reg_p (int reg ATTRIBUTE_UNUSED, int new_reg, |
312 | struct du_head *this_head, HARD_REG_SET this_unavailable) | |
d78118a3 | 313 | { |
3754d046 | 314 | machine_mode mode = GET_MODE (*this_head->first->loc); |
92d2aec3 | 315 | int nregs = hard_regno_nregs (new_reg, mode); |
d78118a3 | 316 | int i; |
317 | struct du_chain *tmp; | |
318 | ||
319 | for (i = nregs - 1; i >= 0; --i) | |
320 | if (TEST_HARD_REG_BIT (this_unavailable, new_reg + i) | |
321 | || fixed_regs[new_reg + i] | |
322 | || global_regs[new_reg + i] | |
323 | /* Can't use regs which aren't saved by the prologue. */ | |
324 | || (! df_regs_ever_live_p (new_reg + i) | |
325 | && ! call_used_regs[new_reg + i]) | |
326 | #ifdef LEAF_REGISTERS | |
327 | /* We can't use a non-leaf register if we're in a | |
328 | leaf function. */ | |
d5bf7b64 | 329 | || (crtl->is_leaf |
d78118a3 | 330 | && !LEAF_REGISTERS[new_reg + i]) |
331 | #endif | |
e239bb25 | 332 | || ! HARD_REGNO_RENAME_OK (reg + i, new_reg + i)) |
d78118a3 | 333 | return false; |
334 | ||
335 | /* See whether it accepts all modes that occur in | |
336 | definition and uses. */ | |
337 | for (tmp = this_head->first; tmp; tmp = tmp->next_use) | |
b395382f | 338 | if ((!targetm.hard_regno_mode_ok (new_reg, GET_MODE (*tmp->loc)) |
d78118a3 | 339 | && ! DEBUG_INSN_P (tmp->insn)) |
340 | || (this_head->need_caller_save_reg | |
5da94e60 | 341 | && ! (targetm.hard_regno_call_part_clobbered |
5c62f29a | 342 | (NULL, reg, GET_MODE (*tmp->loc))) |
5da94e60 | 343 | && (targetm.hard_regno_call_part_clobbered |
5c62f29a | 344 | (NULL, new_reg, GET_MODE (*tmp->loc))))) |
d78118a3 | 345 | return false; |
346 | ||
347 | return true; | |
348 | } | |
349 | ||
7de639a2 | 350 | /* For the chain THIS_HEAD, compute and return the best register to |
351 | rename to. SUPER_CLASS is the superunion of register classes in | |
352 | the chain. UNAVAILABLE is a set of registers that cannot be used. | |
46f1d251 | 353 | OLD_REG is the register currently used for the chain. BEST_RENAME |
354 | controls whether the register chosen must be better than the | |
355 | current one or just respect the given constraint. */ | |
7de639a2 | 356 | |
357 | int | |
46f1d251 | 358 | find_rename_reg (du_head_p this_head, enum reg_class super_class, |
359 | HARD_REG_SET *unavailable, int old_reg, bool best_rename) | |
7de639a2 | 360 | { |
361 | bool has_preferred_class; | |
362 | enum reg_class preferred_class; | |
363 | int pass; | |
364 | int best_new_reg = old_reg; | |
365 | ||
366 | /* Further narrow the set of registers we can use for renaming. | |
367 | If the chain needs a call-saved register, mark the call-used | |
368 | registers as unavailable. */ | |
369 | if (this_head->need_caller_save_reg) | |
370 | IOR_HARD_REG_SET (*unavailable, call_used_reg_set); | |
371 | ||
372 | /* Mark registers that overlap this chain's lifetime as unavailable. */ | |
373 | merge_overlapping_regs (unavailable, this_head); | |
374 | ||
375 | /* Compute preferred rename class of super union of all the classes | |
376 | in the chain. */ | |
377 | preferred_class | |
378 | = (enum reg_class) targetm.preferred_rename_class (super_class); | |
379 | ||
19694471 | 380 | /* Pick and check the register from the tied chain iff the tied chain |
381 | is not renamed. */ | |
382 | if (this_head->tied_chain && !this_head->tied_chain->renamed | |
383 | && check_new_reg_p (old_reg, this_head->tied_chain->regno, | |
384 | this_head, *unavailable)) | |
385 | return this_head->tied_chain->regno; | |
386 | ||
7de639a2 | 387 | /* If PREFERRED_CLASS is not NO_REGS, we iterate in the first pass |
388 | over registers that belong to PREFERRED_CLASS and try to find the | |
389 | best register within the class. If that failed, we iterate in | |
390 | the second pass over registers that don't belong to the class. | |
391 | If PREFERRED_CLASS is NO_REGS, we iterate over all registers in | |
392 | ascending order without any preference. */ | |
393 | has_preferred_class = (preferred_class != NO_REGS); | |
394 | for (pass = (has_preferred_class ? 0 : 1); pass < 2; pass++) | |
395 | { | |
396 | int new_reg; | |
397 | for (new_reg = 0; new_reg < FIRST_PSEUDO_REGISTER; new_reg++) | |
398 | { | |
399 | if (has_preferred_class | |
400 | && (pass == 0) | |
401 | != TEST_HARD_REG_BIT (reg_class_contents[preferred_class], | |
402 | new_reg)) | |
403 | continue; | |
404 | ||
46f1d251 | 405 | if (!check_new_reg_p (old_reg, new_reg, this_head, *unavailable)) |
406 | continue; | |
407 | ||
408 | if (!best_rename) | |
409 | return new_reg; | |
410 | ||
7de639a2 | 411 | /* In the first pass, we force the renaming of registers that |
412 | don't belong to PREFERRED_CLASS to registers that do, even | |
413 | though the latters were used not very long ago. */ | |
46f1d251 | 414 | if ((pass == 0 |
415 | && !TEST_HARD_REG_BIT (reg_class_contents[preferred_class], | |
416 | best_new_reg)) | |
417 | || tick[best_new_reg] > tick[new_reg]) | |
7de639a2 | 418 | best_new_reg = new_reg; |
419 | } | |
420 | if (pass == 0 && best_new_reg != old_reg) | |
421 | break; | |
422 | } | |
423 | return best_new_reg; | |
424 | } | |
425 | ||
d29d9ce9 | 426 | /* Iterate over elements in the chain HEAD in order to: |
427 | 1. Count number of uses, storing it in *PN_USES. | |
428 | 2. Narrow the set of registers we can use for renaming, adding | |
429 | unavailable registers to *PUNAVAILABLE, which must be | |
430 | initialized by the caller. | |
431 | 3. Compute the superunion of register classes in this chain | |
432 | and return it. */ | |
433 | reg_class | |
434 | regrename_find_superclass (du_head_p head, int *pn_uses, | |
435 | HARD_REG_SET *punavailable) | |
436 | { | |
437 | int n_uses = 0; | |
438 | reg_class super_class = NO_REGS; | |
439 | for (du_chain *tmp = head->first; tmp; tmp = tmp->next_use) | |
440 | { | |
441 | if (DEBUG_INSN_P (tmp->insn)) | |
442 | continue; | |
443 | n_uses++; | |
444 | IOR_COMPL_HARD_REG_SET (*punavailable, | |
445 | reg_class_contents[tmp->cl]); | |
446 | super_class | |
447 | = reg_class_superunion[(int) super_class][(int) tmp->cl]; | |
448 | } | |
449 | *pn_uses = n_uses; | |
450 | return super_class; | |
451 | } | |
452 | ||
31adcf56 | 453 | /* Perform register renaming on the current function. */ |
8fe3bc87 | 454 | static void |
31adcf56 | 455 | rename_chains (void) |
8fe3bc87 | 456 | { |
457 | HARD_REG_SET unavailable; | |
31adcf56 | 458 | du_head_p this_head; |
459 | int i; | |
460 | ||
461 | memset (tick, 0, sizeof tick); | |
8fe3bc87 | 462 | |
463 | CLEAR_HARD_REG_SET (unavailable); | |
464 | /* Don't clobber traceback for noreturn functions. */ | |
465 | if (frame_pointer_needed) | |
466 | { | |
467 | add_to_hard_reg_set (&unavailable, Pmode, FRAME_POINTER_REGNUM); | |
f703b3d6 | 468 | if (!HARD_FRAME_POINTER_IS_FRAME_POINTER) |
469 | add_to_hard_reg_set (&unavailable, Pmode, HARD_FRAME_POINTER_REGNUM); | |
8fe3bc87 | 470 | } |
471 | ||
f1f41a6c | 472 | FOR_EACH_VEC_ELT (id_to_chain, i, this_head) |
8fe3bc87 | 473 | { |
7de639a2 | 474 | int best_new_reg; |
8fe3bc87 | 475 | int n_uses; |
8fe3bc87 | 476 | HARD_REG_SET this_unavailable; |
477 | int reg = this_head->regno; | |
8fe3bc87 | 478 | |
8fe3bc87 | 479 | if (this_head->cannot_rename) |
480 | continue; | |
481 | ||
8fe3bc87 | 482 | if (fixed_regs[reg] || global_regs[reg] |
3c05b49d | 483 | || (!HARD_FRAME_POINTER_IS_FRAME_POINTER && frame_pointer_needed |
484 | && reg == HARD_FRAME_POINTER_REGNUM) | |
74163acd | 485 | || (HARD_FRAME_POINTER_IS_FRAME_POINTER && frame_pointer_needed |
3c05b49d | 486 | && reg == FRAME_POINTER_REGNUM)) |
8fe3bc87 | 487 | continue; |
488 | ||
489 | COPY_HARD_REG_SET (this_unavailable, unavailable); | |
490 | ||
d29d9ce9 | 491 | reg_class super_class = regrename_find_superclass (this_head, &n_uses, |
492 | &this_unavailable); | |
8fe3bc87 | 493 | if (n_uses < 2) |
494 | continue; | |
495 | ||
46f1d251 | 496 | best_new_reg = find_rename_reg (this_head, super_class, |
497 | &this_unavailable, reg, true); | |
8fe3bc87 | 498 | |
499 | if (dump_file) | |
500 | { | |
501 | fprintf (dump_file, "Register %s in insn %d", | |
502 | reg_names[reg], INSN_UID (this_head->first->insn)); | |
503 | if (this_head->need_caller_save_reg) | |
504 | fprintf (dump_file, " crosses a call"); | |
505 | } | |
506 | ||
507 | if (best_new_reg == reg) | |
508 | { | |
509 | tick[reg] = ++this_tick; | |
510 | if (dump_file) | |
511 | fprintf (dump_file, "; no available better choice\n"); | |
512 | continue; | |
513 | } | |
514 | ||
688586d5 | 515 | if (regrename_do_replace (this_head, best_new_reg)) |
516 | { | |
517 | if (dump_file) | |
518 | fprintf (dump_file, ", renamed as %s\n", reg_names[best_new_reg]); | |
519 | tick[best_new_reg] = ++this_tick; | |
520 | df_set_regs_ever_live (best_new_reg, true); | |
521 | } | |
522 | else | |
523 | { | |
524 | if (dump_file) | |
525 | fprintf (dump_file, ", renaming as %s failed\n", | |
526 | reg_names[best_new_reg]); | |
527 | tick[reg] = ++this_tick; | |
528 | } | |
8fe3bc87 | 529 | } |
530 | } | |
531 | ||
31adcf56 | 532 | /* A structure to record information for each hard register at the start of |
533 | a basic block. */ | |
534 | struct incoming_reg_info { | |
535 | /* Holds the number of registers used in the chain that gave us information | |
536 | about this register. Zero means no information known yet, while a | |
537 | negative value is used for something that is part of, but not the first | |
538 | register in a multi-register value. */ | |
539 | int nregs; | |
540 | /* Set to true if we have accesses that conflict in the number of registers | |
541 | used. */ | |
542 | bool unusable; | |
543 | }; | |
544 | ||
545 | /* A structure recording information about each basic block. It is saved | |
546 | and restored around basic block boundaries. | |
547 | A pointer to such a structure is stored in each basic block's aux field | |
548 | during regrename_analyze, except for blocks we know can't be optimized | |
549 | (such as entry and exit blocks). */ | |
550 | struct bb_rename_info | |
551 | { | |
552 | /* The basic block corresponding to this structure. */ | |
553 | basic_block bb; | |
554 | /* Copies of the global information. */ | |
555 | bitmap_head open_chains_set; | |
556 | bitmap_head incoming_open_chains_set; | |
557 | struct incoming_reg_info incoming[FIRST_PSEUDO_REGISTER]; | |
558 | }; | |
559 | ||
560 | /* Initialize a rename_info structure P for basic block BB, which starts a new | |
561 | scan. */ | |
562 | static void | |
563 | init_rename_info (struct bb_rename_info *p, basic_block bb) | |
564 | { | |
565 | int i; | |
f1c570a6 | 566 | df_ref def; |
31adcf56 | 567 | HARD_REG_SET start_chains_set; |
568 | ||
569 | p->bb = bb; | |
570 | bitmap_initialize (&p->open_chains_set, &bitmap_default_obstack); | |
571 | bitmap_initialize (&p->incoming_open_chains_set, &bitmap_default_obstack); | |
572 | ||
573 | open_chains = NULL; | |
574 | bitmap_clear (&open_chains_set); | |
575 | ||
576 | CLEAR_HARD_REG_SET (live_in_chains); | |
577 | REG_SET_TO_HARD_REG_SET (live_hard_regs, df_get_live_in (bb)); | |
f1c570a6 | 578 | FOR_EACH_ARTIFICIAL_DEF (def, bb->index) |
579 | if (DF_REF_FLAGS (def) & DF_REF_AT_TOP) | |
580 | SET_HARD_REG_BIT (live_hard_regs, DF_REF_REGNO (def)); | |
31adcf56 | 581 | |
582 | /* Open chains based on information from (at least one) predecessor | |
583 | block. This gives us a chance later on to combine chains across | |
584 | basic block boundaries. Inconsistencies (in access sizes) will | |
585 | be caught normally and dealt with conservatively by disabling the | |
586 | chain for renaming, and there is no risk of losing optimization | |
587 | opportunities by opening chains either: if we did not open the | |
588 | chains, we'd have to track the live register as a hard reg, and | |
589 | we'd be unable to rename it in any case. */ | |
590 | CLEAR_HARD_REG_SET (start_chains_set); | |
591 | for (i = 0; i < FIRST_PSEUDO_REGISTER; i++) | |
592 | { | |
593 | struct incoming_reg_info *iri = p->incoming + i; | |
594 | if (iri->nregs > 0 && !iri->unusable | |
595 | && range_in_hard_reg_set_p (live_hard_regs, i, iri->nregs)) | |
596 | { | |
597 | SET_HARD_REG_BIT (start_chains_set, i); | |
598 | remove_range_from_hard_reg_set (&live_hard_regs, i, iri->nregs); | |
599 | } | |
600 | } | |
601 | for (i = 0; i < FIRST_PSEUDO_REGISTER; i++) | |
602 | { | |
603 | struct incoming_reg_info *iri = p->incoming + i; | |
604 | if (TEST_HARD_REG_BIT (start_chains_set, i)) | |
605 | { | |
606 | du_head_p chain; | |
607 | if (dump_file) | |
608 | fprintf (dump_file, "opening incoming chain\n"); | |
05d5500b | 609 | chain = create_new_chain (i, iri->nregs, NULL, NULL, NO_REGS); |
31adcf56 | 610 | bitmap_set_bit (&p->incoming_open_chains_set, chain->id); |
611 | } | |
612 | } | |
613 | } | |
614 | ||
615 | /* Record in RI that the block corresponding to it has an incoming | |
616 | live value, described by CHAIN. */ | |
617 | static void | |
618 | set_incoming_from_chain (struct bb_rename_info *ri, du_head_p chain) | |
619 | { | |
620 | int i; | |
621 | int incoming_nregs = ri->incoming[chain->regno].nregs; | |
622 | int nregs; | |
623 | ||
624 | /* If we've recorded the same information before, everything is fine. */ | |
625 | if (incoming_nregs == chain->nregs) | |
626 | { | |
627 | if (dump_file) | |
628 | fprintf (dump_file, "reg %d/%d already recorded\n", | |
629 | chain->regno, chain->nregs); | |
630 | return; | |
631 | } | |
632 | ||
633 | /* If we have no information for any of the involved registers, update | |
634 | the incoming array. */ | |
635 | nregs = chain->nregs; | |
636 | while (nregs-- > 0) | |
637 | if (ri->incoming[chain->regno + nregs].nregs != 0 | |
638 | || ri->incoming[chain->regno + nregs].unusable) | |
639 | break; | |
640 | if (nregs < 0) | |
641 | { | |
642 | nregs = chain->nregs; | |
643 | ri->incoming[chain->regno].nregs = nregs; | |
644 | while (nregs-- > 1) | |
645 | ri->incoming[chain->regno + nregs].nregs = -nregs; | |
646 | if (dump_file) | |
647 | fprintf (dump_file, "recorded reg %d/%d\n", | |
648 | chain->regno, chain->nregs); | |
649 | return; | |
650 | } | |
651 | ||
652 | /* There must be some kind of conflict. Prevent both the old and | |
653 | new ranges from being used. */ | |
654 | if (incoming_nregs < 0) | |
655 | ri->incoming[chain->regno + incoming_nregs].unusable = true; | |
656 | for (i = 0; i < chain->nregs; i++) | |
657 | ri->incoming[chain->regno + i].unusable = true; | |
658 | } | |
659 | ||
660 | /* Merge the two chains C1 and C2 so that all conflict information is | |
661 | recorded and C1, and the id of C2 is changed to that of C1. */ | |
662 | static void | |
663 | merge_chains (du_head_p c1, du_head_p c2) | |
664 | { | |
665 | if (c1 == c2) | |
666 | return; | |
667 | ||
668 | if (c2->first != NULL) | |
669 | { | |
670 | if (c1->first == NULL) | |
671 | c1->first = c2->first; | |
672 | else | |
673 | c1->last->next_use = c2->first; | |
674 | c1->last = c2->last; | |
675 | } | |
676 | ||
677 | c2->first = c2->last = NULL; | |
678 | c2->id = c1->id; | |
679 | ||
680 | IOR_HARD_REG_SET (c1->hard_conflicts, c2->hard_conflicts); | |
681 | bitmap_ior_into (&c1->conflicts, &c2->conflicts); | |
682 | ||
683 | c1->need_caller_save_reg |= c2->need_caller_save_reg; | |
684 | c1->cannot_rename |= c2->cannot_rename; | |
685 | } | |
686 | ||
687 | /* Analyze the current function and build chains for renaming. */ | |
688 | ||
7de639a2 | 689 | void |
690 | regrename_analyze (bitmap bb_mask) | |
31adcf56 | 691 | { |
692 | struct bb_rename_info *rename_info; | |
693 | int i; | |
694 | basic_block bb; | |
695 | int n_bbs; | |
696 | int *inverse_postorder; | |
697 | ||
fe672ac0 | 698 | inverse_postorder = XNEWVEC (int, last_basic_block_for_fn (cfun)); |
31adcf56 | 699 | n_bbs = pre_and_rev_post_order_compute (NULL, inverse_postorder, false); |
700 | ||
701 | /* Gather some information about the blocks in this function. */ | |
a28770e1 | 702 | rename_info = XCNEWVEC (struct bb_rename_info, n_basic_blocks_for_fn (cfun)); |
31adcf56 | 703 | i = 0; |
fc00614f | 704 | FOR_EACH_BB_FN (bb, cfun) |
31adcf56 | 705 | { |
706 | struct bb_rename_info *ri = rename_info + i; | |
707 | ri->bb = bb; | |
7de639a2 | 708 | if (bb_mask != NULL && !bitmap_bit_p (bb_mask, bb->index)) |
709 | bb->aux = NULL; | |
710 | else | |
711 | bb->aux = ri; | |
31adcf56 | 712 | i++; |
713 | } | |
714 | ||
715 | current_id = 0; | |
f1f41a6c | 716 | id_to_chain.create (0); |
31adcf56 | 717 | bitmap_initialize (&open_chains_set, &bitmap_default_obstack); |
718 | ||
719 | /* The order in which we visit blocks ensures that whenever | |
720 | possible, we only process a block after at least one of its | |
721 | predecessors, which provides a "seeding" effect to make the logic | |
722 | in set_incoming_from_chain and init_rename_info useful. */ | |
723 | ||
724 | for (i = 0; i < n_bbs; i++) | |
725 | { | |
f5a6b05f | 726 | basic_block bb1 = BASIC_BLOCK_FOR_FN (cfun, inverse_postorder[i]); |
31adcf56 | 727 | struct bb_rename_info *this_info; |
728 | bool success; | |
729 | edge e; | |
730 | edge_iterator ei; | |
f1f41a6c | 731 | int old_length = id_to_chain.length (); |
31adcf56 | 732 | |
733 | this_info = (struct bb_rename_info *) bb1->aux; | |
734 | if (this_info == NULL) | |
735 | continue; | |
736 | ||
737 | if (dump_file) | |
738 | fprintf (dump_file, "\nprocessing block %d:\n", bb1->index); | |
739 | ||
740 | init_rename_info (this_info, bb1); | |
741 | ||
742 | success = build_def_use (bb1); | |
743 | if (!success) | |
744 | { | |
745 | if (dump_file) | |
746 | fprintf (dump_file, "failed\n"); | |
747 | bb1->aux = NULL; | |
f1f41a6c | 748 | id_to_chain.truncate (old_length); |
31adcf56 | 749 | current_id = old_length; |
750 | bitmap_clear (&this_info->incoming_open_chains_set); | |
751 | open_chains = NULL; | |
f1f41a6c | 752 | if (insn_rr.exists ()) |
7de639a2 | 753 | { |
05d5500b | 754 | rtx_insn *insn; |
7de639a2 | 755 | FOR_BB_INSNS (bb1, insn) |
756 | { | |
f1f41a6c | 757 | insn_rr_info *p = &insn_rr[INSN_UID (insn)]; |
7de639a2 | 758 | p->op_info = NULL; |
759 | } | |
760 | } | |
31adcf56 | 761 | continue; |
762 | } | |
763 | ||
764 | if (dump_file) | |
765 | dump_def_use_chain (old_length); | |
766 | bitmap_copy (&this_info->open_chains_set, &open_chains_set); | |
767 | ||
768 | /* Add successor blocks to the worklist if necessary, and record | |
769 | data about our own open chains at the end of this block, which | |
770 | will be used to pre-open chains when processing the successors. */ | |
771 | FOR_EACH_EDGE (e, ei, bb1->succs) | |
772 | { | |
773 | struct bb_rename_info *dest_ri; | |
774 | struct du_head *chain; | |
775 | ||
776 | if (dump_file) | |
777 | fprintf (dump_file, "successor block %d\n", e->dest->index); | |
778 | ||
779 | if (e->flags & (EDGE_EH | EDGE_ABNORMAL)) | |
780 | continue; | |
781 | dest_ri = (struct bb_rename_info *)e->dest->aux; | |
782 | if (dest_ri == NULL) | |
783 | continue; | |
784 | for (chain = open_chains; chain; chain = chain->next_chain) | |
785 | set_incoming_from_chain (dest_ri, chain); | |
786 | } | |
787 | } | |
788 | ||
789 | free (inverse_postorder); | |
790 | ||
791 | /* Now, combine the chains data we have gathered across basic block | |
792 | boundaries. | |
793 | ||
794 | For every basic block, there may be chains open at the start, or at the | |
795 | end. Rather than exclude them from renaming, we look for open chains | |
796 | with matching registers at the other side of the CFG edge. | |
797 | ||
798 | For a given chain using register R, open at the start of block B, we | |
799 | must find an open chain using R on the other side of every edge leading | |
800 | to B, if the register is live across this edge. In the code below, | |
801 | N_PREDS_USED counts the number of edges where the register is live, and | |
802 | N_PREDS_JOINED counts those where we found an appropriate chain for | |
803 | joining. | |
804 | ||
805 | We perform the analysis for both incoming and outgoing edges, but we | |
806 | only need to merge once (in the second part, after verifying outgoing | |
807 | edges). */ | |
fc00614f | 808 | FOR_EACH_BB_FN (bb, cfun) |
31adcf56 | 809 | { |
810 | struct bb_rename_info *bb_ri = (struct bb_rename_info *) bb->aux; | |
811 | unsigned j; | |
812 | bitmap_iterator bi; | |
813 | ||
814 | if (bb_ri == NULL) | |
815 | continue; | |
816 | ||
817 | if (dump_file) | |
818 | fprintf (dump_file, "processing bb %d in edges\n", bb->index); | |
819 | ||
820 | EXECUTE_IF_SET_IN_BITMAP (&bb_ri->incoming_open_chains_set, 0, j, bi) | |
821 | { | |
822 | edge e; | |
823 | edge_iterator ei; | |
7de639a2 | 824 | struct du_head *chain = regrename_chain_from_id (j); |
31adcf56 | 825 | int n_preds_used = 0, n_preds_joined = 0; |
826 | ||
827 | FOR_EACH_EDGE (e, ei, bb->preds) | |
828 | { | |
829 | struct bb_rename_info *src_ri; | |
830 | unsigned k; | |
831 | bitmap_iterator bi2; | |
832 | HARD_REG_SET live; | |
833 | bool success = false; | |
834 | ||
835 | REG_SET_TO_HARD_REG_SET (live, df_get_live_out (e->src)); | |
836 | if (!range_overlaps_hard_reg_set_p (live, chain->regno, | |
837 | chain->nregs)) | |
838 | continue; | |
839 | n_preds_used++; | |
840 | ||
841 | if (e->flags & (EDGE_EH | EDGE_ABNORMAL)) | |
842 | continue; | |
843 | ||
844 | src_ri = (struct bb_rename_info *)e->src->aux; | |
845 | if (src_ri == NULL) | |
846 | continue; | |
847 | ||
848 | EXECUTE_IF_SET_IN_BITMAP (&src_ri->open_chains_set, | |
849 | 0, k, bi2) | |
850 | { | |
7de639a2 | 851 | struct du_head *outgoing_chain = regrename_chain_from_id (k); |
31adcf56 | 852 | |
853 | if (outgoing_chain->regno == chain->regno | |
854 | && outgoing_chain->nregs == chain->nregs) | |
855 | { | |
856 | n_preds_joined++; | |
857 | success = true; | |
858 | break; | |
859 | } | |
860 | } | |
861 | if (!success && dump_file) | |
862 | fprintf (dump_file, "failure to match with pred block %d\n", | |
863 | e->src->index); | |
864 | } | |
865 | if (n_preds_joined < n_preds_used) | |
866 | { | |
867 | if (dump_file) | |
868 | fprintf (dump_file, "cannot rename chain %d\n", j); | |
869 | chain->cannot_rename = 1; | |
870 | } | |
871 | } | |
872 | } | |
fc00614f | 873 | FOR_EACH_BB_FN (bb, cfun) |
31adcf56 | 874 | { |
875 | struct bb_rename_info *bb_ri = (struct bb_rename_info *) bb->aux; | |
876 | unsigned j; | |
877 | bitmap_iterator bi; | |
878 | ||
879 | if (bb_ri == NULL) | |
880 | continue; | |
881 | ||
882 | if (dump_file) | |
883 | fprintf (dump_file, "processing bb %d out edges\n", bb->index); | |
884 | ||
885 | EXECUTE_IF_SET_IN_BITMAP (&bb_ri->open_chains_set, 0, j, bi) | |
886 | { | |
887 | edge e; | |
888 | edge_iterator ei; | |
7de639a2 | 889 | struct du_head *chain = regrename_chain_from_id (j); |
31adcf56 | 890 | int n_succs_used = 0, n_succs_joined = 0; |
891 | ||
892 | FOR_EACH_EDGE (e, ei, bb->succs) | |
893 | { | |
894 | bool printed = false; | |
895 | struct bb_rename_info *dest_ri; | |
896 | unsigned k; | |
897 | bitmap_iterator bi2; | |
898 | HARD_REG_SET live; | |
899 | ||
900 | REG_SET_TO_HARD_REG_SET (live, df_get_live_in (e->dest)); | |
901 | if (!range_overlaps_hard_reg_set_p (live, chain->regno, | |
902 | chain->nregs)) | |
903 | continue; | |
904 | ||
905 | n_succs_used++; | |
906 | ||
907 | dest_ri = (struct bb_rename_info *)e->dest->aux; | |
908 | if (dest_ri == NULL) | |
909 | continue; | |
910 | ||
911 | EXECUTE_IF_SET_IN_BITMAP (&dest_ri->incoming_open_chains_set, | |
912 | 0, k, bi2) | |
913 | { | |
7de639a2 | 914 | struct du_head *incoming_chain = regrename_chain_from_id (k); |
31adcf56 | 915 | |
916 | if (incoming_chain->regno == chain->regno | |
917 | && incoming_chain->nregs == chain->nregs) | |
918 | { | |
919 | if (dump_file) | |
920 | { | |
921 | if (!printed) | |
922 | fprintf (dump_file, | |
923 | "merging blocks for edge %d -> %d\n", | |
924 | e->src->index, e->dest->index); | |
925 | printed = true; | |
926 | fprintf (dump_file, | |
927 | " merging chains %d (->%d) and %d (->%d) [%s]\n", | |
928 | k, incoming_chain->id, j, chain->id, | |
929 | reg_names[incoming_chain->regno]); | |
930 | } | |
931 | ||
932 | merge_chains (chain, incoming_chain); | |
933 | n_succs_joined++; | |
934 | break; | |
935 | } | |
936 | } | |
937 | } | |
938 | if (n_succs_joined < n_succs_used) | |
939 | { | |
940 | if (dump_file) | |
941 | fprintf (dump_file, "cannot rename chain %d\n", | |
942 | j); | |
943 | chain->cannot_rename = 1; | |
944 | } | |
945 | } | |
946 | } | |
947 | ||
948 | free (rename_info); | |
949 | ||
fc00614f | 950 | FOR_EACH_BB_FN (bb, cfun) |
31adcf56 | 951 | bb->aux = NULL; |
952 | } | |
953 | ||
688586d5 | 954 | /* Attempt to replace all uses of the register in the chain beginning with |
955 | HEAD with REG. Returns true on success and false if the replacement is | |
956 | rejected because the insns would not validate. The latter can happen | |
957 | e.g. if a match_parallel predicate enforces restrictions on register | |
958 | numbering in its subpatterns. */ | |
959 | ||
960 | bool | |
7de639a2 | 961 | regrename_do_replace (struct du_head *head, int reg) |
b9a06185 | 962 | { |
bb6d4603 | 963 | struct du_chain *chain; |
964 | unsigned int base_regno = head->regno; | |
3754d046 | 965 | machine_mode mode; |
7352fff9 | 966 | rtx last_reg = NULL_RTX, last_repl = NULL_RTX; |
9845d120 | 967 | |
bb6d4603 | 968 | for (chain = head->first; chain; chain = chain->next_use) |
b9a06185 | 969 | { |
22cf44bc | 970 | unsigned int regno = ORIGINAL_REGNO (*chain->loc); |
bb6d4603 | 971 | struct reg_attrs *attr = REG_ATTRS (*chain->loc); |
41d261a4 | 972 | int reg_ptr = REG_POINTER (*chain->loc); |
83d9f776 | 973 | |
9845d120 | 974 | if (DEBUG_INSN_P (chain->insn) && REGNO (*chain->loc) != base_regno) |
688586d5 | 975 | validate_change (chain->insn, &(INSN_VAR_LOCATION_LOC (chain->insn)), |
976 | gen_rtx_UNKNOWN_VAR_LOC (), true); | |
9845d120 | 977 | else |
978 | { | |
7352fff9 | 979 | if (*chain->loc != last_reg) |
980 | { | |
981 | last_repl = gen_raw_REG (GET_MODE (*chain->loc), reg); | |
982 | if (regno >= FIRST_PSEUDO_REGISTER) | |
983 | ORIGINAL_REGNO (last_repl) = regno; | |
984 | REG_ATTRS (last_repl) = attr; | |
985 | REG_POINTER (last_repl) = reg_ptr; | |
986 | last_reg = *chain->loc; | |
987 | } | |
988 | validate_change (chain->insn, chain->loc, last_repl, true); | |
9845d120 | 989 | } |
b9a06185 | 990 | } |
7de639a2 | 991 | |
688586d5 | 992 | if (!apply_change_group ()) |
993 | return false; | |
994 | ||
7de639a2 | 995 | mode = GET_MODE (*head->first->loc); |
19694471 | 996 | head->renamed = 1; |
7de639a2 | 997 | head->regno = reg; |
92d2aec3 | 998 | head->nregs = hard_regno_nregs (reg, mode); |
688586d5 | 999 | return true; |
b9a06185 | 1000 | } |
1001 | ||
b9a06185 | 1002 | |
7197e178 | 1003 | /* True if we found a register with a size mismatch, which means that we |
1004 | can't track its lifetime accurately. If so, we abort the current block | |
1005 | without renaming. */ | |
1006 | static bool fail_current_block; | |
1007 | ||
c38fa63b | 1008 | /* Return true if OP is a reg for which all bits are set in PSET, false |
1009 | if all bits are clear. | |
1010 | In other cases, set fail_current_block and return false. */ | |
83361a4c | 1011 | |
1012 | static bool | |
c38fa63b | 1013 | verify_reg_in_set (rtx op, HARD_REG_SET *pset) |
83361a4c | 1014 | { |
1015 | unsigned regno, nregs; | |
1016 | bool all_live, all_dead; | |
1017 | if (!REG_P (op)) | |
1018 | return false; | |
1019 | ||
1020 | regno = REGNO (op); | |
0933f1d9 | 1021 | nregs = REG_NREGS (op); |
83361a4c | 1022 | all_live = all_dead = true; |
1023 | while (nregs-- > 0) | |
c38fa63b | 1024 | if (TEST_HARD_REG_BIT (*pset, regno + nregs)) |
83361a4c | 1025 | all_dead = false; |
1026 | else | |
1027 | all_live = false; | |
1028 | if (!all_dead && !all_live) | |
1029 | { | |
1030 | fail_current_block = true; | |
1031 | return false; | |
1032 | } | |
c38fa63b | 1033 | return all_live; |
1034 | } | |
83361a4c | 1035 | |
c38fa63b | 1036 | /* Return true if OP is a reg that is being tracked already in some form. |
1037 | May set fail_current_block if it sees an unhandled case of overlap. */ | |
83361a4c | 1038 | |
c38fa63b | 1039 | static bool |
1040 | verify_reg_tracked (rtx op) | |
1041 | { | |
1042 | return (verify_reg_in_set (op, &live_hard_regs) | |
1043 | || verify_reg_in_set (op, &live_in_chains)); | |
83361a4c | 1044 | } |
1045 | ||
7197e178 | 1046 | /* Called through note_stores. DATA points to a rtx_code, either SET or |
1047 | CLOBBER, which tells us which kind of rtx to look at. If we have a | |
1048 | match, record the set register in live_hard_regs and in the hard_conflicts | |
1049 | bitmap of open chains. */ | |
1050 | ||
1051 | static void | |
1052 | note_sets_clobbers (rtx x, const_rtx set, void *data) | |
1053 | { | |
1054 | enum rtx_code code = *(enum rtx_code *)data; | |
1055 | struct du_head *chain; | |
1056 | ||
1057 | if (GET_CODE (x) == SUBREG) | |
1058 | x = SUBREG_REG (x); | |
1059 | if (!REG_P (x) || GET_CODE (set) != code) | |
1060 | return; | |
1061 | /* There must not be pseudos at this point. */ | |
1062 | gcc_assert (HARD_REGISTER_P (x)); | |
1063 | add_to_hard_reg_set (&live_hard_regs, GET_MODE (x), REGNO (x)); | |
1064 | for (chain = open_chains; chain; chain = chain->next_chain) | |
1065 | add_to_hard_reg_set (&chain->hard_conflicts, GET_MODE (x), REGNO (x)); | |
1066 | } | |
1067 | ||
1140e77e | 1068 | static void |
05d5500b | 1069 | scan_rtx_reg (rtx_insn *insn, rtx *loc, enum reg_class cl, enum scan_actions action, |
de67d37e | 1070 | enum op_type type) |
b9a06185 | 1071 | { |
bb6d4603 | 1072 | struct du_head **p; |
1140e77e | 1073 | rtx x = *loc; |
bb6d4603 | 1074 | unsigned this_regno = REGNO (x); |
0933f1d9 | 1075 | int this_nregs = REG_NREGS (x); |
1140e77e | 1076 | |
1140e77e | 1077 | if (action == mark_write) |
b9a06185 | 1078 | { |
1140e77e | 1079 | if (type == OP_OUT) |
19694471 | 1080 | { |
1081 | du_head_p c; | |
1082 | rtx pat = PATTERN (insn); | |
1083 | ||
1084 | c = create_new_chain (this_regno, this_nregs, loc, insn, cl); | |
1085 | ||
1086 | /* We try to tie chains in a move instruction for | |
1087 | a single output. */ | |
1088 | if (recog_data.n_operands == 2 | |
1089 | && GET_CODE (pat) == SET | |
1090 | && GET_CODE (SET_DEST (pat)) == REG | |
1091 | && GET_CODE (SET_SRC (pat)) == REG | |
c7bb78e7 | 1092 | && terminated_this_insn |
1093 | && terminated_this_insn->nregs | |
1094 | == REG_NREGS (recog_data.operand[1])) | |
19694471 | 1095 | { |
1096 | gcc_assert (terminated_this_insn->regno | |
1097 | == REGNO (recog_data.operand[1])); | |
1098 | ||
1099 | c->tied_chain = terminated_this_insn; | |
1100 | terminated_this_insn->tied_chain = c; | |
1101 | ||
1102 | if (dump_file) | |
1103 | fprintf (dump_file, "Tying chain %s (%d) with %s (%d)\n", | |
1104 | reg_names[c->regno], c->id, | |
1105 | reg_names[terminated_this_insn->regno], | |
1106 | terminated_this_insn->id); | |
1107 | } | |
1108 | } | |
1109 | ||
1140e77e | 1110 | return; |
b9a06185 | 1111 | } |
d98fed9f | 1112 | |
b9d576f5 | 1113 | if ((type == OP_OUT) != (action == terminate_write || action == mark_access)) |
1140e77e | 1114 | return; |
ceba8bb1 | 1115 | |
1140e77e | 1116 | for (p = &open_chains; *p;) |
ceba8bb1 | 1117 | { |
bb6d4603 | 1118 | struct du_head *head = *p; |
7197e178 | 1119 | struct du_head *next = head->next_chain; |
1120 | int exact_match = (head->regno == this_regno | |
1121 | && head->nregs == this_nregs); | |
1122 | int superset = (this_regno <= head->regno | |
1123 | && this_regno + this_nregs >= head->regno + head->nregs); | |
c38fa63b | 1124 | int subset = (this_regno >= head->regno |
1125 | && this_regno + this_nregs <= head->regno + head->nregs); | |
7197e178 | 1126 | |
8fe3bc87 | 1127 | if (!bitmap_bit_p (&open_chains_set, head->id) |
7197e178 | 1128 | || head->regno + head->nregs <= this_regno |
1129 | || this_regno + this_nregs <= head->regno) | |
1130 | { | |
1131 | p = &head->next_chain; | |
1132 | continue; | |
1133 | } | |
1140e77e | 1134 | |
7197e178 | 1135 | if (action == mark_read || action == mark_access) |
709c2f34 | 1136 | { |
7197e178 | 1137 | /* ??? Class NO_REGS can happen if the md file makes use of |
1138 | EXTRA_CONSTRAINTS to match registers. Which is arguably | |
1139 | wrong, but there we are. */ | |
77b2358d | 1140 | |
7197e178 | 1141 | if (cl == NO_REGS || (!exact_match && !DEBUG_INSN_P (insn))) |
a292cb6e | 1142 | { |
7197e178 | 1143 | if (dump_file) |
1144 | fprintf (dump_file, | |
1145 | "Cannot rename chain %s (%d) at insn %d (%s)\n", | |
1146 | reg_names[head->regno], head->id, INSN_UID (insn), | |
1147 | scan_actions_name[(int) action]); | |
1148 | head->cannot_rename = 1; | |
c38fa63b | 1149 | if (superset) |
1150 | { | |
1151 | unsigned nregs = this_nregs; | |
1152 | head->regno = this_regno; | |
1153 | head->nregs = this_nregs; | |
1154 | while (nregs-- > 0) | |
1155 | SET_HARD_REG_BIT (live_in_chains, head->regno + nregs); | |
1156 | if (dump_file) | |
1157 | fprintf (dump_file, | |
1158 | "Widening register in chain %s (%d) at insn %d\n", | |
1159 | reg_names[head->regno], head->id, INSN_UID (insn)); | |
1160 | } | |
1161 | else if (!subset) | |
1162 | { | |
1163 | fail_current_block = true; | |
1164 | if (dump_file) | |
1165 | fprintf (dump_file, | |
1166 | "Failing basic block due to unhandled overlap\n"); | |
1167 | } | |
a292cb6e | 1168 | } |
7197e178 | 1169 | else |
1140e77e | 1170 | { |
7197e178 | 1171 | struct du_chain *this_du; |
1172 | this_du = XOBNEW (&rename_obstack, struct du_chain); | |
1173 | this_du->next_use = 0; | |
1174 | this_du->loc = loc; | |
1175 | this_du->insn = insn; | |
1176 | this_du->cl = cl; | |
17db414f | 1177 | if (head->first == NULL) |
1178 | head->first = this_du; | |
1179 | else | |
1180 | head->last->next_use = this_du; | |
7de639a2 | 1181 | record_operand_use (head, this_du); |
7197e178 | 1182 | head->last = this_du; |
1140e77e | 1183 | } |
7197e178 | 1184 | /* Avoid adding the same location in a DEBUG_INSN multiple times, |
1185 | which could happen with non-exact overlap. */ | |
1186 | if (DEBUG_INSN_P (insn)) | |
1187 | return; | |
1188 | /* Otherwise, find any other chains that do not match exactly; | |
1189 | ensure they all get marked unrenamable. */ | |
1190 | p = &head->next_chain; | |
1191 | continue; | |
1192 | } | |
a292cb6e | 1193 | |
7197e178 | 1194 | /* Whether the terminated chain can be used for renaming |
1195 | depends on the action and this being an exact match. | |
1196 | In either case, we remove this element from open_chains. */ | |
77b2358d | 1197 | |
7197e178 | 1198 | if ((action == terminate_dead || action == terminate_write) |
38e1b753 | 1199 | && (superset || subset)) |
7197e178 | 1200 | { |
83361a4c | 1201 | unsigned nregs; |
1202 | ||
38e1b753 | 1203 | if (subset && !superset) |
1204 | head->cannot_rename = 1; | |
7197e178 | 1205 | bitmap_clear_bit (&open_chains_set, head->id); |
83361a4c | 1206 | |
1207 | nregs = head->nregs; | |
1208 | while (nregs-- > 0) | |
38e1b753 | 1209 | { |
1210 | CLEAR_HARD_REG_BIT (live_in_chains, head->regno + nregs); | |
1211 | if (subset && !superset | |
1212 | && (head->regno + nregs < this_regno | |
1213 | || head->regno + nregs >= this_regno + this_nregs)) | |
1214 | SET_HARD_REG_BIT (live_hard_regs, head->regno + nregs); | |
1215 | } | |
83361a4c | 1216 | |
19694471 | 1217 | if (action == terminate_dead) |
1218 | terminated_this_insn = *p; | |
7197e178 | 1219 | *p = next; |
1220 | if (dump_file) | |
1221 | fprintf (dump_file, | |
38e1b753 | 1222 | "Closing chain %s (%d) at insn %d (%s%s)\n", |
7197e178 | 1223 | reg_names[head->regno], head->id, INSN_UID (insn), |
38e1b753 | 1224 | scan_actions_name[(int) action], |
1225 | superset ? ", superset" : subset ? ", subset" : ""); | |
7197e178 | 1226 | } |
1227 | else if (action == terminate_dead || action == terminate_write) | |
1228 | { | |
1229 | /* In this case, tracking liveness gets too hard. Fail the | |
1230 | entire basic block. */ | |
1231 | if (dump_file) | |
1232 | fprintf (dump_file, | |
1233 | "Failing basic block due to unhandled overlap\n"); | |
1234 | fail_current_block = true; | |
1235 | return; | |
1236 | } | |
1237 | else | |
1238 | { | |
1239 | head->cannot_rename = 1; | |
1240 | if (dump_file) | |
1241 | fprintf (dump_file, | |
1242 | "Cannot rename chain %s (%d) at insn %d (%s)\n", | |
1243 | reg_names[head->regno], head->id, INSN_UID (insn), | |
1244 | scan_actions_name[(int) action]); | |
1245 | p = &head->next_chain; | |
1140e77e | 1246 | } |
1140e77e | 1247 | } |
b9a06185 | 1248 | } |
1249 | ||
e2ea3e5a | 1250 | /* A wrapper around base_reg_class which returns ALL_REGS if INSN is a |
1251 | DEBUG_INSN. The arguments MODE, AS, CODE and INDEX_CODE are as for | |
1252 | base_reg_class. */ | |
1253 | ||
1254 | static reg_class | |
1255 | base_reg_class_for_rename (rtx_insn *insn, machine_mode mode, addr_space_t as, | |
1256 | rtx_code code, rtx_code index_code) | |
1257 | { | |
1258 | if (DEBUG_INSN_P (insn)) | |
1259 | return ALL_REGS; | |
1260 | return base_reg_class (mode, as, code, index_code); | |
1261 | } | |
1262 | ||
e916c70c | 1263 | /* Adapted from find_reloads_address_1. CL is INDEX_REG_CLASS or |
1140e77e | 1264 | BASE_REG_CLASS depending on how the register is being considered. */ |
b9a06185 | 1265 | |
31659b75 | 1266 | static void |
05d5500b | 1267 | scan_rtx_address (rtx_insn *insn, rtx *loc, enum reg_class cl, |
3754d046 | 1268 | enum scan_actions action, machine_mode mode, |
f8a8fc7b | 1269 | addr_space_t as) |
b9a06185 | 1270 | { |
1140e77e | 1271 | rtx x = *loc; |
1272 | RTX_CODE code = GET_CODE (x); | |
1273 | const char *fmt; | |
1274 | int i, j; | |
b9a06185 | 1275 | |
b9d576f5 | 1276 | if (action == mark_write || action == mark_access) |
1140e77e | 1277 | return; |
b9a06185 | 1278 | |
1140e77e | 1279 | switch (code) |
b9a06185 | 1280 | { |
1140e77e | 1281 | case PLUS: |
1282 | { | |
1283 | rtx orig_op0 = XEXP (x, 0); | |
1284 | rtx orig_op1 = XEXP (x, 1); | |
1285 | RTX_CODE code0 = GET_CODE (orig_op0); | |
1286 | RTX_CODE code1 = GET_CODE (orig_op1); | |
1287 | rtx op0 = orig_op0; | |
1288 | rtx op1 = orig_op1; | |
1289 | rtx *locI = NULL; | |
1290 | rtx *locB = NULL; | |
260988c8 | 1291 | enum rtx_code index_code = SCRATCH; |
1140e77e | 1292 | |
1293 | if (GET_CODE (op0) == SUBREG) | |
1294 | { | |
1295 | op0 = SUBREG_REG (op0); | |
1296 | code0 = GET_CODE (op0); | |
1297 | } | |
b9a06185 | 1298 | |
1140e77e | 1299 | if (GET_CODE (op1) == SUBREG) |
1300 | { | |
1301 | op1 = SUBREG_REG (op1); | |
1302 | code1 = GET_CODE (op1); | |
1303 | } | |
b9a06185 | 1304 | |
1140e77e | 1305 | if (code0 == MULT || code0 == SIGN_EXTEND || code0 == TRUNCATE |
1306 | || code0 == ZERO_EXTEND || code1 == MEM) | |
1307 | { | |
1308 | locI = &XEXP (x, 0); | |
1309 | locB = &XEXP (x, 1); | |
00cb30dc | 1310 | index_code = GET_CODE (*locI); |
1140e77e | 1311 | } |
1312 | else if (code1 == MULT || code1 == SIGN_EXTEND || code1 == TRUNCATE | |
1313 | || code1 == ZERO_EXTEND || code0 == MEM) | |
1314 | { | |
1315 | locI = &XEXP (x, 1); | |
1316 | locB = &XEXP (x, 0); | |
00cb30dc | 1317 | index_code = GET_CODE (*locI); |
1140e77e | 1318 | } |
1319 | else if (code0 == CONST_INT || code0 == CONST | |
1320 | || code0 == SYMBOL_REF || code0 == LABEL_REF) | |
00cb30dc | 1321 | { |
1322 | locB = &XEXP (x, 1); | |
1323 | index_code = GET_CODE (XEXP (x, 0)); | |
1324 | } | |
1140e77e | 1325 | else if (code1 == CONST_INT || code1 == CONST |
1326 | || code1 == SYMBOL_REF || code1 == LABEL_REF) | |
00cb30dc | 1327 | { |
1328 | locB = &XEXP (x, 0); | |
1329 | index_code = GET_CODE (XEXP (x, 1)); | |
1330 | } | |
1140e77e | 1331 | else if (code0 == REG && code1 == REG) |
1332 | { | |
1333 | int index_op; | |
00cb30dc | 1334 | unsigned regno0 = REGNO (op0), regno1 = REGNO (op1); |
1140e77e | 1335 | |
ce0d0c3a | 1336 | if (REGNO_OK_FOR_INDEX_P (regno1) |
f8a8fc7b | 1337 | && regno_ok_for_base_p (regno0, mode, as, PLUS, REG)) |
ce0d0c3a | 1338 | index_op = 1; |
1339 | else if (REGNO_OK_FOR_INDEX_P (regno0) | |
f8a8fc7b | 1340 | && regno_ok_for_base_p (regno1, mode, as, PLUS, REG)) |
1140e77e | 1341 | index_op = 0; |
f8a8fc7b | 1342 | else if (regno_ok_for_base_p (regno0, mode, as, PLUS, REG) |
ce0d0c3a | 1343 | || REGNO_OK_FOR_INDEX_P (regno1)) |
1140e77e | 1344 | index_op = 1; |
f8a8fc7b | 1345 | else if (regno_ok_for_base_p (regno1, mode, as, PLUS, REG)) |
1140e77e | 1346 | index_op = 0; |
1140e77e | 1347 | else |
ce0d0c3a | 1348 | index_op = 1; |
1140e77e | 1349 | |
1350 | locI = &XEXP (x, index_op); | |
00cb30dc | 1351 | locB = &XEXP (x, !index_op); |
1352 | index_code = GET_CODE (*locI); | |
1140e77e | 1353 | } |
1354 | else if (code0 == REG) | |
1355 | { | |
1356 | locI = &XEXP (x, 0); | |
1357 | locB = &XEXP (x, 1); | |
00cb30dc | 1358 | index_code = GET_CODE (*locI); |
1140e77e | 1359 | } |
1360 | else if (code1 == REG) | |
1361 | { | |
1362 | locI = &XEXP (x, 1); | |
1363 | locB = &XEXP (x, 0); | |
00cb30dc | 1364 | index_code = GET_CODE (*locI); |
1140e77e | 1365 | } |
b9a06185 | 1366 | |
1140e77e | 1367 | if (locI) |
e2ea3e5a | 1368 | { |
1369 | reg_class iclass = DEBUG_INSN_P (insn) ? ALL_REGS : INDEX_REG_CLASS; | |
1370 | scan_rtx_address (insn, locI, iclass, action, mode, as); | |
1371 | } | |
1140e77e | 1372 | if (locB) |
e2ea3e5a | 1373 | { |
1374 | reg_class bclass = base_reg_class_for_rename (insn, mode, as, PLUS, | |
1375 | index_code); | |
1376 | scan_rtx_address (insn, locB, bclass, action, mode, as); | |
1377 | } | |
1140e77e | 1378 | return; |
1379 | } | |
b9a06185 | 1380 | |
1140e77e | 1381 | case POST_INC: |
1382 | case POST_DEC: | |
1383 | case POST_MODIFY: | |
1384 | case PRE_INC: | |
1385 | case PRE_DEC: | |
1386 | case PRE_MODIFY: | |
8f758362 | 1387 | /* If the target doesn't claim to handle autoinc, this must be |
1388 | something special, like a stack push. Kill this chain. */ | |
5b3ba406 | 1389 | if (!AUTO_INC_DEC) |
1390 | action = mark_all_read; | |
32aa77d9 | 1391 | |
1140e77e | 1392 | break; |
b9a06185 | 1393 | |
1140e77e | 1394 | case MEM: |
e2ea3e5a | 1395 | { |
1396 | reg_class bclass = base_reg_class_for_rename (insn, GET_MODE (x), | |
1397 | MEM_ADDR_SPACE (x), | |
1398 | MEM, SCRATCH); | |
1399 | scan_rtx_address (insn, &XEXP (x, 0), bclass, action, GET_MODE (x), | |
1400 | MEM_ADDR_SPACE (x)); | |
1401 | } | |
1140e77e | 1402 | return; |
d98fed9f | 1403 | |
1140e77e | 1404 | case REG: |
de67d37e | 1405 | scan_rtx_reg (insn, loc, cl, action, OP_IN); |
31659b75 | 1406 | return; |
d98fed9f | 1407 | |
1140e77e | 1408 | default: |
1409 | break; | |
31659b75 | 1410 | } |
1140e77e | 1411 | |
1412 | fmt = GET_RTX_FORMAT (code); | |
1413 | for (i = GET_RTX_LENGTH (code) - 1; i >= 0; i--) | |
31659b75 | 1414 | { |
1140e77e | 1415 | if (fmt[i] == 'e') |
f8a8fc7b | 1416 | scan_rtx_address (insn, &XEXP (x, i), cl, action, mode, as); |
1140e77e | 1417 | else if (fmt[i] == 'E') |
1418 | for (j = XVECLEN (x, i) - 1; j >= 0; j--) | |
f8a8fc7b | 1419 | scan_rtx_address (insn, &XVECEXP (x, i, j), cl, action, mode, as); |
31659b75 | 1420 | } |
b9a06185 | 1421 | } |
1422 | ||
1140e77e | 1423 | static void |
05d5500b | 1424 | scan_rtx (rtx_insn *insn, rtx *loc, enum reg_class cl, enum scan_actions action, |
de67d37e | 1425 | enum op_type type) |
b9a06185 | 1426 | { |
1140e77e | 1427 | const char *fmt; |
1428 | rtx x = *loc; | |
1429 | enum rtx_code code = GET_CODE (x); | |
1430 | int i, j; | |
b9a06185 | 1431 | |
1140e77e | 1432 | code = GET_CODE (x); |
1433 | switch (code) | |
b9a06185 | 1434 | { |
1140e77e | 1435 | case CONST: |
0349edce | 1436 | CASE_CONST_ANY: |
1140e77e | 1437 | case SYMBOL_REF: |
1438 | case LABEL_REF: | |
1439 | case CC0: | |
1440 | case PC: | |
1441 | return; | |
22d9265e | 1442 | |
1140e77e | 1443 | case REG: |
de67d37e | 1444 | scan_rtx_reg (insn, loc, cl, action, type); |
1140e77e | 1445 | return; |
b9a06185 | 1446 | |
1140e77e | 1447 | case MEM: |
e2ea3e5a | 1448 | { |
1449 | reg_class bclass = base_reg_class_for_rename (insn, GET_MODE (x), | |
1450 | MEM_ADDR_SPACE (x), | |
1451 | MEM, SCRATCH); | |
1452 | ||
1453 | scan_rtx_address (insn, &XEXP (x, 0), bclass, action, GET_MODE (x), | |
1454 | MEM_ADDR_SPACE (x)); | |
1455 | } | |
1140e77e | 1456 | return; |
b9a06185 | 1457 | |
1140e77e | 1458 | case SET: |
de67d37e | 1459 | scan_rtx (insn, &SET_SRC (x), cl, action, OP_IN); |
72ab6a85 | 1460 | scan_rtx (insn, &SET_DEST (x), cl, action, |
83361a4c | 1461 | (GET_CODE (PATTERN (insn)) == COND_EXEC |
1462 | && verify_reg_tracked (SET_DEST (x))) ? OP_INOUT : OP_OUT); | |
1140e77e | 1463 | return; |
b9a06185 | 1464 | |
1140e77e | 1465 | case STRICT_LOW_PART: |
6581d87d | 1466 | scan_rtx (insn, &XEXP (x, 0), cl, action, |
1467 | verify_reg_tracked (XEXP (x, 0)) ? OP_INOUT : OP_OUT); | |
1140e77e | 1468 | return; |
b9a06185 | 1469 | |
1140e77e | 1470 | case ZERO_EXTRACT: |
709c2f34 | 1471 | case SIGN_EXTRACT: |
e916c70c | 1472 | scan_rtx (insn, &XEXP (x, 0), cl, action, |
6581d87d | 1473 | (type == OP_IN ? OP_IN : |
1474 | verify_reg_tracked (XEXP (x, 0)) ? OP_INOUT : OP_OUT)); | |
de67d37e | 1475 | scan_rtx (insn, &XEXP (x, 1), cl, action, OP_IN); |
1476 | scan_rtx (insn, &XEXP (x, 2), cl, action, OP_IN); | |
1140e77e | 1477 | return; |
b9a06185 | 1478 | |
1140e77e | 1479 | case POST_INC: |
1480 | case PRE_INC: | |
1481 | case POST_DEC: | |
1482 | case PRE_DEC: | |
1483 | case POST_MODIFY: | |
1484 | case PRE_MODIFY: | |
1485 | /* Should only happen inside MEM. */ | |
04e579b6 | 1486 | gcc_unreachable (); |
1140e77e | 1487 | |
1488 | case CLOBBER: | |
72ab6a85 | 1489 | scan_rtx (insn, &SET_DEST (x), cl, action, |
83361a4c | 1490 | (GET_CODE (PATTERN (insn)) == COND_EXEC |
1491 | && verify_reg_tracked (SET_DEST (x))) ? OP_INOUT : OP_OUT); | |
1140e77e | 1492 | return; |
b9a06185 | 1493 | |
1140e77e | 1494 | case EXPR_LIST: |
de67d37e | 1495 | scan_rtx (insn, &XEXP (x, 0), cl, action, type); |
1140e77e | 1496 | if (XEXP (x, 1)) |
de67d37e | 1497 | scan_rtx (insn, &XEXP (x, 1), cl, action, type); |
1140e77e | 1498 | return; |
b9a06185 | 1499 | |
1140e77e | 1500 | default: |
1501 | break; | |
1502 | } | |
b9a06185 | 1503 | |
1140e77e | 1504 | fmt = GET_RTX_FORMAT (code); |
1505 | for (i = GET_RTX_LENGTH (code) - 1; i >= 0; i--) | |
b9a06185 | 1506 | { |
1507 | if (fmt[i] == 'e') | |
de67d37e | 1508 | scan_rtx (insn, &XEXP (x, i), cl, action, type); |
b9a06185 | 1509 | else if (fmt[i] == 'E') |
1510 | for (j = XVECLEN (x, i) - 1; j >= 0; j--) | |
de67d37e | 1511 | scan_rtx (insn, &XVECEXP (x, i, j), cl, action, type); |
1512 | } | |
1513 | } | |
1514 | ||
1515 | /* Hide operands of the current insn (of which there are N_OPS) by | |
1516 | substituting cc0 for them. | |
1517 | Previous values are stored in the OLD_OPERANDS and OLD_DUPS. | |
c38fa63b | 1518 | For every bit set in DO_NOT_HIDE, we leave the operand alone. |
7197e178 | 1519 | If INOUT_AND_EC_ONLY is set, we only do this for OP_INOUT type operands |
1520 | and earlyclobbers. */ | |
de67d37e | 1521 | |
1522 | static void | |
1523 | hide_operands (int n_ops, rtx *old_operands, rtx *old_dups, | |
c38fa63b | 1524 | unsigned HOST_WIDE_INT do_not_hide, bool inout_and_ec_only) |
de67d37e | 1525 | { |
1526 | int i; | |
89a7a6a5 | 1527 | const operand_alternative *op_alt = which_op_alt (); |
de67d37e | 1528 | for (i = 0; i < n_ops; i++) |
1529 | { | |
1530 | old_operands[i] = recog_data.operand[i]; | |
1531 | /* Don't squash match_operator or match_parallel here, since | |
1532 | we don't know that all of the contained registers are | |
1533 | reachable by proper operands. */ | |
1534 | if (recog_data.constraints[i][0] == '\0') | |
1535 | continue; | |
c38fa63b | 1536 | if (do_not_hide & (1 << i)) |
1537 | continue; | |
7197e178 | 1538 | if (!inout_and_ec_only || recog_data.operand_type[i] == OP_INOUT |
757fefec | 1539 | || op_alt[i].earlyclobber) |
de67d37e | 1540 | *recog_data.operand_loc[i] = cc0_rtx; |
1541 | } | |
1542 | for (i = 0; i < recog_data.n_dups; i++) | |
1543 | { | |
1544 | int opn = recog_data.dup_num[i]; | |
1545 | old_dups[i] = *recog_data.dup_loc[i]; | |
c38fa63b | 1546 | if (do_not_hide & (1 << opn)) |
1547 | continue; | |
7197e178 | 1548 | if (!inout_and_ec_only || recog_data.operand_type[opn] == OP_INOUT |
757fefec | 1549 | || op_alt[opn].earlyclobber) |
de67d37e | 1550 | *recog_data.dup_loc[i] = cc0_rtx; |
1551 | } | |
1552 | } | |
1553 | ||
1554 | /* Undo the substitution performed by hide_operands. INSN is the insn we | |
1555 | are processing; the arguments are the same as in hide_operands. */ | |
1556 | ||
1557 | static void | |
05d5500b | 1558 | restore_operands (rtx_insn *insn, int n_ops, rtx *old_operands, rtx *old_dups) |
de67d37e | 1559 | { |
1560 | int i; | |
1561 | for (i = 0; i < recog_data.n_dups; i++) | |
1562 | *recog_data.dup_loc[i] = old_dups[i]; | |
1563 | for (i = 0; i < n_ops; i++) | |
1564 | *recog_data.operand_loc[i] = old_operands[i]; | |
1565 | if (recog_data.n_dups) | |
1566 | df_insn_rescan (insn); | |
1567 | } | |
1568 | ||
1569 | /* For each output operand of INSN, call scan_rtx to create a new | |
7197e178 | 1570 | open chain. Do this only for normal or earlyclobber outputs, |
7de639a2 | 1571 | depending on EARLYCLOBBER. If INSN_INFO is nonnull, use it to |
1572 | record information about the operands in the insn. */ | |
de67d37e | 1573 | |
1574 | static void | |
05d5500b | 1575 | record_out_operands (rtx_insn *insn, bool earlyclobber, insn_rr_info *insn_info) |
de67d37e | 1576 | { |
1577 | int n_ops = recog_data.n_operands; | |
89a7a6a5 | 1578 | const operand_alternative *op_alt = which_op_alt (); |
de67d37e | 1579 | |
1580 | int i; | |
1581 | ||
1582 | for (i = 0; i < n_ops + recog_data.n_dups; i++) | |
1583 | { | |
1584 | int opn = i < n_ops ? i : recog_data.dup_num[i - n_ops]; | |
1585 | rtx *loc = (i < n_ops | |
1586 | ? recog_data.operand_loc[opn] | |
1587 | : recog_data.dup_loc[i - n_ops]); | |
1588 | rtx op = *loc; | |
89a7a6a5 | 1589 | enum reg_class cl = alternative_class (op_alt, opn); |
de67d37e | 1590 | |
1591 | struct du_head *prev_open; | |
1592 | ||
7197e178 | 1593 | if (recog_data.operand_type[opn] != OP_OUT |
757fefec | 1594 | || op_alt[opn].earlyclobber != earlyclobber) |
de67d37e | 1595 | continue; |
1596 | ||
7de639a2 | 1597 | if (insn_info) |
1598 | cur_operand = insn_info->op_info + i; | |
1599 | ||
de67d37e | 1600 | prev_open = open_chains; |
e61dd417 | 1601 | if (earlyclobber) |
1602 | scan_rtx (insn, loc, cl, terminate_write, OP_OUT); | |
de67d37e | 1603 | scan_rtx (insn, loc, cl, mark_write, OP_OUT); |
1604 | ||
1605 | /* ??? Many targets have output constraints on the SET_DEST | |
1606 | of a call insn, which is stupid, since these are certainly | |
1607 | ABI defined hard registers. For these, and for asm operands | |
1608 | that originally referenced hard registers, we must record that | |
1609 | the chain cannot be renamed. */ | |
1610 | if (CALL_P (insn) | |
1611 | || (asm_noperands (PATTERN (insn)) > 0 | |
1612 | && REG_P (op) | |
1613 | && REGNO (op) == ORIGINAL_REGNO (op))) | |
1614 | { | |
1615 | if (prev_open != open_chains) | |
7197e178 | 1616 | open_chains->cannot_rename = 1; |
de67d37e | 1617 | } |
b9a06185 | 1618 | } |
7de639a2 | 1619 | cur_operand = NULL; |
b9a06185 | 1620 | } |
1621 | ||
45498ea1 | 1622 | /* Build def/use chain. */ |
b9a06185 | 1623 | |
31adcf56 | 1624 | static bool |
3ad4992f | 1625 | build_def_use (basic_block bb) |
b9a06185 | 1626 | { |
05d5500b | 1627 | rtx_insn *insn; |
c38fa63b | 1628 | unsigned HOST_WIDE_INT untracked_operands; |
d98fed9f | 1629 | |
7197e178 | 1630 | fail_current_block = false; |
1631 | ||
5496dbfc | 1632 | for (insn = BB_HEAD (bb); ; insn = NEXT_INSN (insn)) |
1140e77e | 1633 | { |
9845d120 | 1634 | if (NONDEBUG_INSN_P (insn)) |
1140e77e | 1635 | { |
1636 | int n_ops; | |
1637 | rtx note; | |
1638 | rtx old_operands[MAX_RECOG_OPERANDS]; | |
1639 | rtx old_dups[MAX_DUP_OPERANDS]; | |
f018d957 | 1640 | int i; |
1140e77e | 1641 | int predicated; |
7197e178 | 1642 | enum rtx_code set_code = SET; |
1643 | enum rtx_code clobber_code = CLOBBER; | |
7de639a2 | 1644 | insn_rr_info *insn_info = NULL; |
c7bb78e7 | 1645 | terminated_this_insn = NULL; |
1140e77e | 1646 | |
1140e77e | 1647 | /* Process the insn, determining its effect on the def-use |
7197e178 | 1648 | chains and live hard registers. We perform the following |
1649 | steps with the register references in the insn, simulating | |
1650 | its effect: | |
1651 | (1) Deal with earlyclobber operands and CLOBBERs of non-operands | |
1652 | by creating chains and marking hard regs live. | |
1140e77e | 1653 | (2) Any read outside an operand causes any chain it overlaps |
7197e178 | 1654 | with to be marked unrenamable. |
1140e77e | 1655 | (3) Any read inside an operand is added if there's already |
1656 | an open chain for it. | |
1657 | (4) For any REG_DEAD note we find, close open chains that | |
1658 | overlap it. | |
7197e178 | 1659 | (5) For any non-earlyclobber write we find, close open chains |
1660 | that overlap it. | |
1661 | (6) For any non-earlyclobber write we find in an operand, make | |
1662 | a new chain or mark the hard register as live. | |
1663 | (7) For any REG_UNUSED, close any chains we just opened. | |
f42d848f | 1664 | (8) For any REG_CFA_RESTORE or REG_CFA_REGISTER, kill any chain |
1665 | containing its dest. | |
7197e178 | 1666 | |
1667 | We cannot deal with situations where we track a reg in one mode | |
1668 | and see a reference in another mode; these will cause the chain | |
1669 | to be marked unrenamable or even cause us to abort the entire | |
1670 | basic block. */ | |
1140e77e | 1671 | |
835b8178 | 1672 | extract_constrain_insn (insn); |
8eaaac4d | 1673 | preprocess_constraints (insn); |
89a7a6a5 | 1674 | const operand_alternative *op_alt = which_op_alt (); |
1140e77e | 1675 | n_ops = recog_data.n_operands; |
c38fa63b | 1676 | untracked_operands = 0; |
1140e77e | 1677 | |
f1f41a6c | 1678 | if (insn_rr.exists ()) |
7de639a2 | 1679 | { |
f1f41a6c | 1680 | insn_info = &insn_rr[INSN_UID (insn)]; |
7de639a2 | 1681 | insn_info->op_info = XOBNEWVEC (&rename_obstack, operand_rr_info, |
1682 | recog_data.n_operands); | |
1683 | memset (insn_info->op_info, 0, | |
1684 | sizeof (operand_rr_info) * recog_data.n_operands); | |
1685 | } | |
1686 | ||
89a7a6a5 | 1687 | /* Simplify the code below by promoting OP_OUT to OP_INOUT in |
83361a4c | 1688 | predicated instructions, but only for register operands |
1689 | that are already tracked, so that we can create a chain | |
1690 | when the first SET makes a register live. */ | |
1140e77e | 1691 | |
1692 | predicated = GET_CODE (PATTERN (insn)) == COND_EXEC; | |
1693 | for (i = 0; i < n_ops; ++i) | |
b9a06185 | 1694 | { |
17db414f | 1695 | rtx op = recog_data.operand[i]; |
757fefec | 1696 | int matches = op_alt[i].matches; |
757fefec | 1697 | if (matches >= 0 || op_alt[i].matched >= 0 |
17db414f | 1698 | || (predicated && recog_data.operand_type[i] == OP_OUT)) |
7197e178 | 1699 | { |
1700 | recog_data.operand_type[i] = OP_INOUT; | |
c38fa63b | 1701 | /* A special case to deal with instruction patterns that |
1702 | have matching operands with different modes. If we're | |
1703 | not already tracking such a reg, we won't start here, | |
1704 | and we must instead make sure to make the operand visible | |
1705 | to the machinery that tracks hard registers. */ | |
52acb7ae | 1706 | machine_mode i_mode = recog_data.operand_mode[i]; |
529810de | 1707 | if (matches >= 0) |
c38fa63b | 1708 | { |
529810de | 1709 | machine_mode matches_mode |
1710 | = recog_data.operand_mode[matches]; | |
1711 | ||
1712 | if (maybe_ne (GET_MODE_SIZE (i_mode), | |
1713 | GET_MODE_SIZE (matches_mode)) | |
1714 | && !verify_reg_in_set (op, &live_in_chains)) | |
1715 | { | |
1716 | untracked_operands |= 1 << i; | |
1717 | untracked_operands |= 1 << matches; | |
1718 | } | |
c38fa63b | 1719 | } |
7197e178 | 1720 | } |
d34dd3bf | 1721 | #ifdef STACK_REGS |
1722 | if (regstack_completed | |
1723 | && REG_P (op) | |
1724 | && IN_RANGE (REGNO (op), FIRST_STACK_REG, LAST_STACK_REG)) | |
1725 | untracked_operands |= 1 << i; | |
1726 | #endif | |
6581d87d | 1727 | /* If there's an in-out operand with a register that is not |
17db414f | 1728 | being tracked at all yet, open a chain. */ |
6581d87d | 1729 | if (recog_data.operand_type[i] == OP_INOUT |
1730 | && !(untracked_operands & (1 << i)) | |
17db414f | 1731 | && REG_P (op) |
1732 | && !verify_reg_tracked (op)) | |
0933f1d9 | 1733 | create_new_chain (REGNO (op), REG_NREGS (op), NULL, NULL, |
1734 | NO_REGS); | |
b9a06185 | 1735 | } |
d98fed9f | 1736 | |
7197e178 | 1737 | if (fail_current_block) |
1738 | break; | |
1739 | ||
1740 | /* Step 1a: Mark hard registers that are clobbered in this insn, | |
1741 | outside an operand, as live. */ | |
c38fa63b | 1742 | hide_operands (n_ops, old_operands, old_dups, untracked_operands, |
1743 | false); | |
7197e178 | 1744 | note_stores (PATTERN (insn), note_sets_clobbers, &clobber_code); |
1745 | restore_operands (insn, n_ops, old_operands, old_dups); | |
1746 | ||
1747 | /* Step 1b: Begin new chains for earlyclobbered writes inside | |
1748 | operands. */ | |
7de639a2 | 1749 | record_out_operands (insn, true, insn_info); |
d98fed9f | 1750 | |
7197e178 | 1751 | /* Step 2: Mark chains for which we have reads outside operands |
1752 | as unrenamable. | |
709c2f34 | 1753 | We do this by munging all operands into CC0, and closing |
1140e77e | 1754 | everything remaining. */ |
b9a06185 | 1755 | |
c38fa63b | 1756 | hide_operands (n_ops, old_operands, old_dups, untracked_operands, |
1757 | false); | |
7197e178 | 1758 | scan_rtx (insn, &PATTERN (insn), NO_REGS, mark_all_read, OP_IN); |
de67d37e | 1759 | restore_operands (insn, n_ops, old_operands, old_dups); |
b9a06185 | 1760 | |
1140e77e | 1761 | /* Step 2B: Can't rename function call argument registers. */ |
6d7dc5b9 | 1762 | if (CALL_P (insn) && CALL_INSN_FUNCTION_USAGE (insn)) |
1140e77e | 1763 | scan_rtx (insn, &CALL_INSN_FUNCTION_USAGE (insn), |
7197e178 | 1764 | NO_REGS, mark_all_read, OP_IN); |
b9a06185 | 1765 | |
a68730c1 | 1766 | /* Step 2C: Can't rename asm operands that were originally |
1767 | hard registers. */ | |
1768 | if (asm_noperands (PATTERN (insn)) > 0) | |
1769 | for (i = 0; i < n_ops; i++) | |
1770 | { | |
1771 | rtx *loc = recog_data.operand_loc[i]; | |
1772 | rtx op = *loc; | |
1773 | ||
8ad4c111 | 1774 | if (REG_P (op) |
a68730c1 | 1775 | && REGNO (op) == ORIGINAL_REGNO (op) |
1776 | && (recog_data.operand_type[i] == OP_IN | |
1777 | || recog_data.operand_type[i] == OP_INOUT)) | |
7197e178 | 1778 | scan_rtx (insn, loc, NO_REGS, mark_all_read, OP_IN); |
a68730c1 | 1779 | } |
1780 | ||
1140e77e | 1781 | /* Step 3: Append to chains for reads inside operands. */ |
1782 | for (i = 0; i < n_ops + recog_data.n_dups; i++) | |
1783 | { | |
1784 | int opn = i < n_ops ? i : recog_data.dup_num[i - n_ops]; | |
1785 | rtx *loc = (i < n_ops | |
1786 | ? recog_data.operand_loc[opn] | |
1787 | : recog_data.dup_loc[i - n_ops]); | |
89a7a6a5 | 1788 | enum reg_class cl = alternative_class (op_alt, opn); |
1140e77e | 1789 | enum op_type type = recog_data.operand_type[opn]; |
1790 | ||
1791 | /* Don't scan match_operand here, since we've no reg class | |
1792 | information to pass down. Any operands that we could | |
1793 | substitute in will be represented elsewhere. */ | |
c38fa63b | 1794 | if (recog_data.constraints[opn][0] == '\0' |
1795 | || untracked_operands & (1 << opn)) | |
1140e77e | 1796 | continue; |
b9a06185 | 1797 | |
7de639a2 | 1798 | if (insn_info) |
1799 | cur_operand = i == opn ? insn_info->op_info + i : NULL; | |
757fefec | 1800 | if (op_alt[opn].is_address) |
f8a8fc7b | 1801 | scan_rtx_address (insn, loc, cl, mark_read, |
1802 | VOIDmode, ADDR_SPACE_GENERIC); | |
1140e77e | 1803 | else |
de67d37e | 1804 | scan_rtx (insn, loc, cl, mark_read, type); |
1140e77e | 1805 | } |
7de639a2 | 1806 | cur_operand = NULL; |
b9a06185 | 1807 | |
b9d576f5 | 1808 | /* Step 3B: Record updates for regs in REG_INC notes, and |
1809 | source regs in REG_FRAME_RELATED_EXPR notes. */ | |
1140e77e | 1810 | for (note = REG_NOTES (insn); note; note = XEXP (note, 1)) |
b9d576f5 | 1811 | if (REG_NOTE_KIND (note) == REG_INC |
1812 | || REG_NOTE_KIND (note) == REG_FRAME_RELATED_EXPR) | |
1813 | scan_rtx (insn, &XEXP (note, 0), ALL_REGS, mark_read, | |
de67d37e | 1814 | OP_INOUT); |
b9d576f5 | 1815 | |
1bcf869e | 1816 | /* Step 4: Close chains for registers that die here, unless |
1817 | the register is mentioned in a REG_UNUSED note. In that | |
1818 | case we keep the chain open until step #7 below to ensure | |
1819 | it conflicts with other output operands of this insn. | |
1820 | See PR 52573. Arguably the insn should not have both | |
1821 | notes; it has proven difficult to fix that without | |
1822 | other undesirable side effects. */ | |
b9d576f5 | 1823 | for (note = REG_NOTES (insn); note; note = XEXP (note, 1)) |
1bcf869e | 1824 | if (REG_NOTE_KIND (note) == REG_DEAD |
1825 | && !find_regno_note (insn, REG_UNUSED, REGNO (XEXP (note, 0)))) | |
7197e178 | 1826 | { |
1827 | remove_from_hard_reg_set (&live_hard_regs, | |
1828 | GET_MODE (XEXP (note, 0)), | |
1829 | REGNO (XEXP (note, 0))); | |
1830 | scan_rtx (insn, &XEXP (note, 0), NO_REGS, terminate_dead, | |
1831 | OP_IN); | |
1832 | } | |
d98fed9f | 1833 | |
1140e77e | 1834 | /* Step 4B: If this is a call, any chain live at this point |
1835 | requires a caller-saved reg. */ | |
6d7dc5b9 | 1836 | if (CALL_P (insn)) |
1140e77e | 1837 | { |
bb6d4603 | 1838 | struct du_head *p; |
1140e77e | 1839 | for (p = open_chains; p; p = p->next_chain) |
d5dfb455 | 1840 | p->need_caller_save_reg = 1; |
1140e77e | 1841 | } |
b9a06185 | 1842 | |
1140e77e | 1843 | /* Step 5: Close open chains that overlap writes. Similar to |
1844 | step 2, we hide in-out operands, since we do not want to | |
7197e178 | 1845 | close these chains. We also hide earlyclobber operands, |
1846 | since we've opened chains for them in step 1, and earlier | |
1847 | chains they would overlap with must have been closed at | |
1848 | the previous insn at the latest, as such operands cannot | |
1849 | possibly overlap with any input operands. */ | |
b9a06185 | 1850 | |
c38fa63b | 1851 | hide_operands (n_ops, old_operands, old_dups, untracked_operands, |
1852 | true); | |
de67d37e | 1853 | scan_rtx (insn, &PATTERN (insn), NO_REGS, terminate_write, OP_IN); |
1854 | restore_operands (insn, n_ops, old_operands, old_dups); | |
b9a06185 | 1855 | |
7197e178 | 1856 | /* Step 6a: Mark hard registers that are set in this insn, |
1857 | outside an operand, as live. */ | |
c38fa63b | 1858 | hide_operands (n_ops, old_operands, old_dups, untracked_operands, |
1859 | false); | |
7197e178 | 1860 | note_stores (PATTERN (insn), note_sets_clobbers, &set_code); |
1861 | restore_operands (insn, n_ops, old_operands, old_dups); | |
b9a06185 | 1862 | |
7197e178 | 1863 | /* Step 6b: Begin new chains for writes inside operands. */ |
7de639a2 | 1864 | record_out_operands (insn, false, insn_info); |
7197e178 | 1865 | |
1866 | /* Step 6c: Record destination regs in REG_FRAME_RELATED_EXPR | |
b9d576f5 | 1867 | notes for update. */ |
1868 | for (note = REG_NOTES (insn); note; note = XEXP (note, 1)) | |
1869 | if (REG_NOTE_KIND (note) == REG_FRAME_RELATED_EXPR) | |
1870 | scan_rtx (insn, &XEXP (note, 0), ALL_REGS, mark_access, | |
de67d37e | 1871 | OP_INOUT); |
b9d576f5 | 1872 | |
1140e77e | 1873 | /* Step 7: Close chains for registers that were never |
1874 | really used here. */ | |
1875 | for (note = REG_NOTES (insn); note; note = XEXP (note, 1)) | |
1876 | if (REG_NOTE_KIND (note) == REG_UNUSED) | |
7197e178 | 1877 | { |
1878 | remove_from_hard_reg_set (&live_hard_regs, | |
1879 | GET_MODE (XEXP (note, 0)), | |
1880 | REGNO (XEXP (note, 0))); | |
1881 | scan_rtx (insn, &XEXP (note, 0), NO_REGS, terminate_dead, | |
1882 | OP_IN); | |
1883 | } | |
1214505d | 1884 | |
1885 | /* Step 8: Kill the chains involving register restores. Those | |
f42d848f | 1886 | should restore _that_ register. Similar for REG_CFA_REGISTER. */ |
1214505d | 1887 | for (note = REG_NOTES (insn); note; note = XEXP (note, 1)) |
f42d848f | 1888 | if (REG_NOTE_KIND (note) == REG_CFA_RESTORE |
1889 | || REG_NOTE_KIND (note) == REG_CFA_REGISTER) | |
1890 | { | |
1891 | rtx *x = &XEXP (note, 0); | |
1892 | if (!*x) | |
1893 | x = &PATTERN (insn); | |
1894 | if (GET_CODE (*x) == PARALLEL) | |
1895 | x = &XVECEXP (*x, 0, 0); | |
1896 | if (GET_CODE (*x) == SET) | |
1897 | x = &SET_DEST (*x); | |
1898 | scan_rtx (insn, x, NO_REGS, mark_all_read, OP_IN); | |
1899 | } | |
1140e77e | 1900 | } |
c64f38bf | 1901 | else if (DEBUG_BIND_INSN_P (insn) |
9845d120 | 1902 | && !VAR_LOC_UNKNOWN_P (INSN_VAR_LOCATION_LOC (insn))) |
1903 | { | |
1904 | scan_rtx (insn, &INSN_VAR_LOCATION_LOC (insn), | |
de67d37e | 1905 | ALL_REGS, mark_read, OP_IN); |
9845d120 | 1906 | } |
5496dbfc | 1907 | if (insn == BB_END (bb)) |
1140e77e | 1908 | break; |
1909 | } | |
b9a06185 | 1910 | |
7197e178 | 1911 | if (fail_current_block) |
31adcf56 | 1912 | return false; |
7197e178 | 1913 | |
31adcf56 | 1914 | return true; |
1140e77e | 1915 | } |
77fce4cd | 1916 | \f |
7de639a2 | 1917 | /* Initialize the register renamer. If INSN_INFO is true, ensure that |
1918 | insn_rr is nonnull. */ | |
1919 | void | |
1920 | regrename_init (bool insn_info) | |
1921 | { | |
1922 | gcc_obstack_init (&rename_obstack); | |
f1f41a6c | 1923 | insn_rr.create (0); |
7de639a2 | 1924 | if (insn_info) |
f1f41a6c | 1925 | insn_rr.safe_grow_cleared (get_max_uid ()); |
7de639a2 | 1926 | } |
1927 | ||
1928 | /* Free all global data used by the register renamer. */ | |
1929 | void | |
1930 | regrename_finish (void) | |
1931 | { | |
f1f41a6c | 1932 | insn_rr.release (); |
7de639a2 | 1933 | free_chain_data (); |
1934 | obstack_free (&rename_obstack, NULL); | |
1935 | } | |
1936 | ||
92effe69 | 1937 | /* Perform register renaming on the current function. */ |
1938 | ||
1939 | static unsigned int | |
1940 | regrename_optimize (void) | |
1941 | { | |
92effe69 | 1942 | df_set_flags (DF_LR_RUN_DCE); |
1943 | df_note_add_problem (); | |
1944 | df_analyze (); | |
1945 | df_set_flags (DF_DEFER_INSN_RESCAN); | |
1946 | ||
7de639a2 | 1947 | regrename_init (false); |
92effe69 | 1948 | |
7de639a2 | 1949 | regrename_analyze (NULL); |
92effe69 | 1950 | |
31adcf56 | 1951 | rename_chains (); |
92effe69 | 1952 | |
7de639a2 | 1953 | regrename_finish (); |
92effe69 | 1954 | |
92effe69 | 1955 | return 0; |
1956 | } | |
1957 | \f | |
cbe8bda8 | 1958 | namespace { |
1959 | ||
1960 | const pass_data pass_data_regrename = | |
77fce4cd | 1961 | { |
cbe8bda8 | 1962 | RTL_PASS, /* type */ |
1963 | "rnreg", /* name */ | |
1964 | OPTGROUP_NONE, /* optinfo_flags */ | |
cbe8bda8 | 1965 | TV_RENAME_REGISTERS, /* tv_id */ |
1966 | 0, /* properties_required */ | |
1967 | 0, /* properties_provided */ | |
1968 | 0, /* properties_destroyed */ | |
1969 | 0, /* todo_flags_start */ | |
8b88439e | 1970 | TODO_df_finish, /* todo_flags_finish */ |
3072d30e | 1971 | }; |
cbe8bda8 | 1972 | |
1973 | class pass_regrename : public rtl_opt_pass | |
1974 | { | |
1975 | public: | |
9af5ce0c | 1976 | pass_regrename (gcc::context *ctxt) |
1977 | : rtl_opt_pass (pass_data_regrename, ctxt) | |
cbe8bda8 | 1978 | {} |
1979 | ||
1980 | /* opt_pass methods: */ | |
31315c24 | 1981 | virtual bool gate (function *) |
1982 | { | |
1983 | return (optimize > 0 && (flag_rename_registers)); | |
1984 | } | |
1985 | ||
65b0537f | 1986 | virtual unsigned int execute (function *) { return regrename_optimize (); } |
cbe8bda8 | 1987 | |
1988 | }; // class pass_regrename | |
1989 | ||
1990 | } // anon namespace | |
1991 | ||
1992 | rtl_opt_pass * | |
1993 | make_pass_regrename (gcc::context *ctxt) | |
1994 | { | |
1995 | return new pass_regrename (ctxt); | |
1996 | } |