]>
Commit | Line | Data |
---|---|---|
55a2c322 | 1 | /* Code for RTL transformations to satisfy insn constraints. |
85ec4feb | 2 | Copyright (C) 2010-2018 Free Software Foundation, Inc. |
55a2c322 VM |
3 | Contributed by Vladimir Makarov <vmakarov@redhat.com>. |
4 | ||
5 | This file is part of GCC. | |
6 | ||
7 | GCC is free software; you can redistribute it and/or modify it under | |
8 | the terms of the GNU General Public License as published by the Free | |
9 | Software Foundation; either version 3, or (at your option) any later | |
10 | version. | |
11 | ||
12 | GCC is distributed in the hope that it will be useful, but WITHOUT ANY | |
13 | WARRANTY; without even the implied warranty of MERCHANTABILITY or | |
14 | FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License | |
15 | for more details. | |
16 | ||
17 | You should have received a copy of the GNU General Public License | |
18 | along with GCC; see the file COPYING3. If not see | |
19 | <http://www.gnu.org/licenses/>. */ | |
20 | ||
21 | ||
22 | /* This file contains code for 3 passes: constraint pass, | |
23 | inheritance/split pass, and pass for undoing failed inheritance and | |
24 | split. | |
25 | ||
26 | The major goal of constraint pass is to transform RTL to satisfy | |
27 | insn and address constraints by: | |
28 | o choosing insn alternatives; | |
29 | o generating *reload insns* (or reloads in brief) and *reload | |
30 | pseudos* which will get necessary hard registers later; | |
31 | o substituting pseudos with equivalent values and removing the | |
32 | instructions that initialized those pseudos. | |
33 | ||
34 | The constraint pass has biggest and most complicated code in LRA. | |
35 | There are a lot of important details like: | |
36 | o reuse of input reload pseudos to simplify reload pseudo | |
37 | allocations; | |
38 | o some heuristics to choose insn alternative to improve the | |
39 | inheritance; | |
40 | o early clobbers etc. | |
41 | ||
42 | The pass is mimicking former reload pass in alternative choosing | |
43 | because the reload pass is oriented to current machine description | |
44 | model. It might be changed if the machine description model is | |
45 | changed. | |
46 | ||
47 | There is special code for preventing all LRA and this pass cycling | |
48 | in case of bugs. | |
49 | ||
50 | On the first iteration of the pass we process every instruction and | |
51 | choose an alternative for each one. On subsequent iterations we try | |
52 | to avoid reprocessing instructions if we can be sure that the old | |
53 | choice is still valid. | |
54 | ||
55 | The inheritance/spilt pass is to transform code to achieve | |
56 | ineheritance and live range splitting. It is done on backward | |
57 | traversal of EBBs. | |
58 | ||
59 | The inheritance optimization goal is to reuse values in hard | |
60 | registers. There is analogous optimization in old reload pass. The | |
61 | inheritance is achieved by following transformation: | |
62 | ||
63 | reload_p1 <- p reload_p1 <- p | |
64 | ... new_p <- reload_p1 | |
65 | ... => ... | |
66 | reload_p2 <- p reload_p2 <- new_p | |
67 | ||
68 | where p is spilled and not changed between the insns. Reload_p1 is | |
69 | also called *original pseudo* and new_p is called *inheritance | |
70 | pseudo*. | |
71 | ||
72 | The subsequent assignment pass will try to assign the same (or | |
73 | another if it is not possible) hard register to new_p as to | |
74 | reload_p1 or reload_p2. | |
75 | ||
76 | If the assignment pass fails to assign a hard register to new_p, | |
77 | this file will undo the inheritance and restore the original code. | |
78 | This is because implementing the above sequence with a spilled | |
79 | new_p would make the code much worse. The inheritance is done in | |
80 | EBB scope. The above is just a simplified example to get an idea | |
81 | of the inheritance as the inheritance is also done for non-reload | |
82 | insns. | |
83 | ||
84 | Splitting (transformation) is also done in EBB scope on the same | |
85 | pass as the inheritance: | |
86 | ||
87 | r <- ... or ... <- r r <- ... or ... <- r | |
88 | ... s <- r (new insn -- save) | |
f4eafc30 | 89 | ... => |
55a2c322 VM |
90 | ... r <- s (new insn -- restore) |
91 | ... <- r ... <- r | |
92 | ||
93 | The *split pseudo* s is assigned to the hard register of the | |
94 | original pseudo or hard register r. | |
95 | ||
96 | Splitting is done: | |
97 | o In EBBs with high register pressure for global pseudos (living | |
98 | in at least 2 BBs) and assigned to hard registers when there | |
99 | are more one reloads needing the hard registers; | |
100 | o for pseudos needing save/restore code around calls. | |
101 | ||
102 | If the split pseudo still has the same hard register as the | |
103 | original pseudo after the subsequent assignment pass or the | |
104 | original pseudo was split, the opposite transformation is done on | |
105 | the same pass for undoing inheritance. */ | |
106 | ||
107 | #undef REG_OK_STRICT | |
108 | ||
109 | #include "config.h" | |
110 | #include "system.h" | |
111 | #include "coretypes.h" | |
c7131fb2 | 112 | #include "backend.h" |
957060b5 | 113 | #include "target.h" |
55a2c322 | 114 | #include "rtl.h" |
957060b5 AM |
115 | #include "tree.h" |
116 | #include "predict.h" | |
c7131fb2 | 117 | #include "df.h" |
4d0cdd0c | 118 | #include "memmodel.h" |
55a2c322 | 119 | #include "tm_p.h" |
957060b5 AM |
120 | #include "expmed.h" |
121 | #include "optabs.h" | |
55a2c322 | 122 | #include "regs.h" |
957060b5 | 123 | #include "ira.h" |
55a2c322 VM |
124 | #include "recog.h" |
125 | #include "output.h" | |
126 | #include "addresses.h" | |
55a2c322 | 127 | #include "expr.h" |
60393bbc | 128 | #include "cfgrtl.h" |
55a2c322 | 129 | #include "rtl-error.h" |
fb8a0e40 | 130 | #include "params.h" |
c7131fb2 | 131 | #include "lra.h" |
55a2c322 | 132 | #include "lra-int.h" |
013a8899 | 133 | #include "print-rtl.h" |
55a2c322 VM |
134 | |
135 | /* Value of LRA_CURR_RELOAD_NUM at the beginning of BB of the current | |
136 | insn. Remember that LRA_CURR_RELOAD_NUM is the number of emitted | |
137 | reload insns. */ | |
138 | static int bb_reload_num; | |
139 | ||
2c62cbaa VM |
140 | /* The current insn being processed and corresponding its single set |
141 | (NULL otherwise), its data (basic block, the insn data, the insn | |
142 | static data, and the mode of each operand). */ | |
cfa434f6 | 143 | static rtx_insn *curr_insn; |
2c62cbaa | 144 | static rtx curr_insn_set; |
55a2c322 VM |
145 | static basic_block curr_bb; |
146 | static lra_insn_recog_data_t curr_id; | |
147 | static struct lra_static_insn_data *curr_static_id; | |
ef4bddc2 | 148 | static machine_mode curr_operand_mode[MAX_RECOG_OPERANDS]; |
895ff86f VM |
149 | /* Mode of the register substituted by its equivalence with VOIDmode |
150 | (e.g. constant) and whose subreg is given operand of the current | |
151 | insn. VOIDmode in all other cases. */ | |
152 | static machine_mode original_subreg_reg_mode[MAX_RECOG_OPERANDS]; | |
55a2c322 VM |
153 | |
154 | \f | |
155 | ||
156 | /* Start numbers for new registers and insns at the current constraints | |
157 | pass start. */ | |
158 | static int new_regno_start; | |
159 | static int new_insn_uid_start; | |
160 | ||
277f65de RS |
161 | /* If LOC is nonnull, strip any outer subreg from it. */ |
162 | static inline rtx * | |
163 | strip_subreg (rtx *loc) | |
164 | { | |
165 | return loc && GET_CODE (*loc) == SUBREG ? &SUBREG_REG (*loc) : loc; | |
166 | } | |
167 | ||
55a2c322 VM |
168 | /* Return hard regno of REGNO or if it is was not assigned to a hard |
169 | register, use a hard register from its allocno class. */ | |
170 | static int | |
171 | get_try_hard_regno (int regno) | |
172 | { | |
173 | int hard_regno; | |
174 | enum reg_class rclass; | |
175 | ||
176 | if ((hard_regno = regno) >= FIRST_PSEUDO_REGISTER) | |
177 | hard_regno = lra_get_regno_hard_regno (regno); | |
178 | if (hard_regno >= 0) | |
179 | return hard_regno; | |
180 | rclass = lra_get_allocno_class (regno); | |
181 | if (rclass == NO_REGS) | |
182 | return -1; | |
183 | return ira_class_hard_regs[rclass][0]; | |
184 | } | |
185 | ||
9d0a9bb4 PB |
186 | /* Return the hard regno of X after removing its subreg. If X is not |
187 | a register or a subreg of a register, return -1. If X is a pseudo, | |
1686923c BE |
188 | use its assignment. If FINAL_P return the final hard regno which will |
189 | be after elimination. */ | |
55a2c322 | 190 | static int |
1686923c | 191 | get_hard_regno (rtx x, bool final_p) |
55a2c322 VM |
192 | { |
193 | rtx reg; | |
1686923c | 194 | int hard_regno; |
55a2c322 VM |
195 | |
196 | reg = x; | |
9d0a9bb4 | 197 | if (SUBREG_P (x)) |
55a2c322 VM |
198 | reg = SUBREG_REG (x); |
199 | if (! REG_P (reg)) | |
200 | return -1; | |
9d0a9bb4 | 201 | if (! HARD_REGISTER_NUM_P (hard_regno = REGNO (reg))) |
55a2c322 VM |
202 | hard_regno = lra_get_regno_hard_regno (hard_regno); |
203 | if (hard_regno < 0) | |
204 | return -1; | |
1686923c BE |
205 | if (final_p) |
206 | hard_regno = lra_get_elimination_hard_regno (hard_regno); | |
9d0a9bb4 | 207 | if (SUBREG_P (x)) |
1686923c BE |
208 | hard_regno += subreg_regno_offset (hard_regno, GET_MODE (reg), |
209 | SUBREG_BYTE (x), GET_MODE (x)); | |
210 | return hard_regno; | |
55a2c322 VM |
211 | } |
212 | ||
213 | /* If REGNO is a hard register or has been allocated a hard register, | |
214 | return the class of that register. If REGNO is a reload pseudo | |
215 | created by the current constraints pass, return its allocno class. | |
216 | Return NO_REGS otherwise. */ | |
217 | static enum reg_class | |
218 | get_reg_class (int regno) | |
219 | { | |
220 | int hard_regno; | |
221 | ||
1686923c | 222 | if (! HARD_REGISTER_NUM_P (hard_regno = regno)) |
55a2c322 VM |
223 | hard_regno = lra_get_regno_hard_regno (regno); |
224 | if (hard_regno >= 0) | |
225 | { | |
1686923c | 226 | hard_regno = lra_get_elimination_hard_regno (hard_regno); |
55a2c322 VM |
227 | return REGNO_REG_CLASS (hard_regno); |
228 | } | |
229 | if (regno >= new_regno_start) | |
230 | return lra_get_allocno_class (regno); | |
231 | return NO_REGS; | |
232 | } | |
233 | ||
234 | /* Return true if REG satisfies (or will satisfy) reg class constraint | |
235 | CL. Use elimination first if REG is a hard register. If REG is a | |
236 | reload pseudo created by this constraints pass, assume that it will | |
237 | be allocated a hard register from its allocno class, but allow that | |
238 | class to be narrowed to CL if it is currently a superset of CL. | |
239 | ||
240 | If NEW_CLASS is nonnull, set *NEW_CLASS to the new allocno class of | |
241 | REGNO (reg), or NO_REGS if no change in its class was needed. */ | |
242 | static bool | |
243 | in_class_p (rtx reg, enum reg_class cl, enum reg_class *new_class) | |
244 | { | |
245 | enum reg_class rclass, common_class; | |
ef4bddc2 | 246 | machine_mode reg_mode; |
55a2c322 VM |
247 | int class_size, hard_regno, nregs, i, j; |
248 | int regno = REGNO (reg); | |
f4eafc30 | 249 | |
55a2c322 VM |
250 | if (new_class != NULL) |
251 | *new_class = NO_REGS; | |
252 | if (regno < FIRST_PSEUDO_REGISTER) | |
253 | { | |
254 | rtx final_reg = reg; | |
255 | rtx *final_loc = &final_reg; | |
f4eafc30 | 256 | |
55a2c322 VM |
257 | lra_eliminate_reg_if_possible (final_loc); |
258 | return TEST_HARD_REG_BIT (reg_class_contents[cl], REGNO (*final_loc)); | |
259 | } | |
260 | reg_mode = GET_MODE (reg); | |
261 | rclass = get_reg_class (regno); | |
262 | if (regno < new_regno_start | |
263 | /* Do not allow the constraints for reload instructions to | |
264 | influence the classes of new pseudos. These reloads are | |
265 | typically moves that have many alternatives, and restricting | |
266 | reload pseudos for one alternative may lead to situations | |
267 | where other reload pseudos are no longer allocatable. */ | |
a2d0d374 VM |
268 | || (INSN_UID (curr_insn) >= new_insn_uid_start |
269 | && curr_insn_set != NULL | |
58532ca6 VM |
270 | && ((OBJECT_P (SET_SRC (curr_insn_set)) |
271 | && ! CONSTANT_P (SET_SRC (curr_insn_set))) | |
a2d0d374 | 272 | || (GET_CODE (SET_SRC (curr_insn_set)) == SUBREG |
58532ca6 VM |
273 | && OBJECT_P (SUBREG_REG (SET_SRC (curr_insn_set))) |
274 | && ! CONSTANT_P (SUBREG_REG (SET_SRC (curr_insn_set))))))) | |
55a2c322 VM |
275 | /* When we don't know what class will be used finally for reload |
276 | pseudos, we use ALL_REGS. */ | |
277 | return ((regno >= new_regno_start && rclass == ALL_REGS) | |
278 | || (rclass != NO_REGS && ira_class_subset_p[rclass][cl] | |
279 | && ! hard_reg_set_subset_p (reg_class_contents[cl], | |
280 | lra_no_alloc_regs))); | |
281 | else | |
282 | { | |
283 | common_class = ira_reg_class_subset[rclass][cl]; | |
284 | if (new_class != NULL) | |
285 | *new_class = common_class; | |
286 | if (hard_reg_set_subset_p (reg_class_contents[common_class], | |
287 | lra_no_alloc_regs)) | |
288 | return false; | |
289 | /* Check that there are enough allocatable regs. */ | |
290 | class_size = ira_class_hard_regs_num[common_class]; | |
291 | for (i = 0; i < class_size; i++) | |
292 | { | |
293 | hard_regno = ira_class_hard_regs[common_class][i]; | |
ad474626 | 294 | nregs = hard_regno_nregs (hard_regno, reg_mode); |
55a2c322 VM |
295 | if (nregs == 1) |
296 | return true; | |
297 | for (j = 0; j < nregs; j++) | |
f421c426 VM |
298 | if (TEST_HARD_REG_BIT (lra_no_alloc_regs, hard_regno + j) |
299 | || ! TEST_HARD_REG_BIT (reg_class_contents[common_class], | |
300 | hard_regno + j)) | |
55a2c322 VM |
301 | break; |
302 | if (j >= nregs) | |
303 | return true; | |
304 | } | |
305 | return false; | |
306 | } | |
307 | } | |
308 | ||
309 | /* Return true if REGNO satisfies a memory constraint. */ | |
310 | static bool | |
311 | in_mem_p (int regno) | |
312 | { | |
313 | return get_reg_class (regno) == NO_REGS; | |
314 | } | |
315 | ||
a953491e RS |
316 | /* Return 1 if ADDR is a valid memory address for mode MODE in address |
317 | space AS, and check that each pseudo has the proper kind of hard | |
318 | reg. */ | |
319 | static int | |
ef4bddc2 | 320 | valid_address_p (machine_mode mode ATTRIBUTE_UNUSED, |
a953491e RS |
321 | rtx addr, addr_space_t as) |
322 | { | |
323 | #ifdef GO_IF_LEGITIMATE_ADDRESS | |
324 | lra_assert (ADDR_SPACE_GENERIC_P (as)); | |
325 | GO_IF_LEGITIMATE_ADDRESS (mode, addr, win); | |
326 | return 0; | |
327 | ||
328 | win: | |
329 | return 1; | |
330 | #else | |
331 | return targetm.addr_space.legitimate_address_p (mode, addr, 0, as); | |
332 | #endif | |
333 | } | |
334 | ||
335 | namespace { | |
336 | /* Temporarily eliminates registers in an address (for the lifetime of | |
337 | the object). */ | |
338 | class address_eliminator { | |
339 | public: | |
340 | address_eliminator (struct address_info *ad); | |
341 | ~address_eliminator (); | |
342 | ||
343 | private: | |
344 | struct address_info *m_ad; | |
345 | rtx *m_base_loc; | |
346 | rtx m_base_reg; | |
347 | rtx *m_index_loc; | |
348 | rtx m_index_reg; | |
349 | }; | |
350 | } | |
351 | ||
352 | address_eliminator::address_eliminator (struct address_info *ad) | |
353 | : m_ad (ad), | |
354 | m_base_loc (strip_subreg (ad->base_term)), | |
355 | m_base_reg (NULL_RTX), | |
356 | m_index_loc (strip_subreg (ad->index_term)), | |
357 | m_index_reg (NULL_RTX) | |
358 | { | |
359 | if (m_base_loc != NULL) | |
360 | { | |
361 | m_base_reg = *m_base_loc; | |
362 | lra_eliminate_reg_if_possible (m_base_loc); | |
363 | if (m_ad->base_term2 != NULL) | |
364 | *m_ad->base_term2 = *m_ad->base_term; | |
365 | } | |
366 | if (m_index_loc != NULL) | |
367 | { | |
368 | m_index_reg = *m_index_loc; | |
369 | lra_eliminate_reg_if_possible (m_index_loc); | |
370 | } | |
371 | } | |
372 | ||
373 | address_eliminator::~address_eliminator () | |
374 | { | |
375 | if (m_base_loc && *m_base_loc != m_base_reg) | |
376 | { | |
377 | *m_base_loc = m_base_reg; | |
378 | if (m_ad->base_term2 != NULL) | |
379 | *m_ad->base_term2 = *m_ad->base_term; | |
380 | } | |
381 | if (m_index_loc && *m_index_loc != m_index_reg) | |
382 | *m_index_loc = m_index_reg; | |
383 | } | |
384 | ||
385 | /* Return true if the eliminated form of AD is a legitimate target address. */ | |
386 | static bool | |
387 | valid_address_p (struct address_info *ad) | |
388 | { | |
389 | address_eliminator eliminator (ad); | |
390 | return valid_address_p (ad->mode, *ad->outer, ad->as); | |
391 | } | |
392 | ||
a953491e | 393 | /* Return true if the eliminated form of memory reference OP satisfies |
9eb1ca69 | 394 | extra (special) memory constraint CONSTRAINT. */ |
a953491e | 395 | static bool |
777e635f | 396 | satisfies_memory_constraint_p (rtx op, enum constraint_num constraint) |
a953491e RS |
397 | { |
398 | struct address_info ad; | |
399 | ||
400 | decompose_mem_address (&ad, op); | |
401 | address_eliminator eliminator (&ad); | |
777e635f | 402 | return constraint_satisfied_p (op, constraint); |
a953491e RS |
403 | } |
404 | ||
405 | /* Return true if the eliminated form of address AD satisfies extra | |
406 | address constraint CONSTRAINT. */ | |
407 | static bool | |
408 | satisfies_address_constraint_p (struct address_info *ad, | |
777e635f | 409 | enum constraint_num constraint) |
a953491e RS |
410 | { |
411 | address_eliminator eliminator (ad); | |
777e635f | 412 | return constraint_satisfied_p (*ad->outer, constraint); |
a953491e RS |
413 | } |
414 | ||
415 | /* Return true if the eliminated form of address OP satisfies extra | |
416 | address constraint CONSTRAINT. */ | |
417 | static bool | |
777e635f | 418 | satisfies_address_constraint_p (rtx op, enum constraint_num constraint) |
a953491e RS |
419 | { |
420 | struct address_info ad; | |
421 | ||
422 | decompose_lea_address (&ad, &op); | |
423 | return satisfies_address_constraint_p (&ad, constraint); | |
424 | } | |
a953491e | 425 | |
4c2b2d79 VM |
426 | /* Initiate equivalences for LRA. As we keep original equivalences |
427 | before any elimination, we need to make copies otherwise any change | |
428 | in insns might change the equivalences. */ | |
429 | void | |
430 | lra_init_equiv (void) | |
431 | { | |
432 | ira_expand_reg_equiv (); | |
433 | for (int i = FIRST_PSEUDO_REGISTER; i < max_reg_num (); i++) | |
434 | { | |
435 | rtx res; | |
436 | ||
437 | if ((res = ira_reg_equiv[i].memory) != NULL_RTX) | |
438 | ira_reg_equiv[i].memory = copy_rtx (res); | |
439 | if ((res = ira_reg_equiv[i].invariant) != NULL_RTX) | |
440 | ira_reg_equiv[i].invariant = copy_rtx (res); | |
441 | } | |
442 | } | |
443 | ||
444 | static rtx loc_equivalence_callback (rtx, const_rtx, void *); | |
445 | ||
446 | /* Update equivalence for REGNO. We need to this as the equivalence | |
447 | might contain other pseudos which are changed by their | |
448 | equivalences. */ | |
449 | static void | |
450 | update_equiv (int regno) | |
451 | { | |
452 | rtx x; | |
453 | ||
454 | if ((x = ira_reg_equiv[regno].memory) != NULL_RTX) | |
455 | ira_reg_equiv[regno].memory | |
456 | = simplify_replace_fn_rtx (x, NULL_RTX, loc_equivalence_callback, | |
457 | NULL_RTX); | |
458 | if ((x = ira_reg_equiv[regno].invariant) != NULL_RTX) | |
459 | ira_reg_equiv[regno].invariant | |
460 | = simplify_replace_fn_rtx (x, NULL_RTX, loc_equivalence_callback, | |
461 | NULL_RTX); | |
462 | } | |
463 | ||
55a2c322 VM |
464 | /* If we have decided to substitute X with another value, return that |
465 | value, otherwise return X. */ | |
466 | static rtx | |
8d49e7ef | 467 | get_equiv (rtx x) |
55a2c322 VM |
468 | { |
469 | int regno; | |
470 | rtx res; | |
471 | ||
472 | if (! REG_P (x) || (regno = REGNO (x)) < FIRST_PSEUDO_REGISTER | |
473 | || ! ira_reg_equiv[regno].defined_p | |
474 | || ! ira_reg_equiv[regno].profitable_p | |
475 | || lra_get_regno_hard_regno (regno) >= 0) | |
476 | return x; | |
477 | if ((res = ira_reg_equiv[regno].memory) != NULL_RTX) | |
d6220b11 KK |
478 | { |
479 | if (targetm.cannot_substitute_mem_equiv_p (res)) | |
480 | return x; | |
481 | return res; | |
482 | } | |
55a2c322 VM |
483 | if ((res = ira_reg_equiv[regno].constant) != NULL_RTX) |
484 | return res; | |
485 | if ((res = ira_reg_equiv[regno].invariant) != NULL_RTX) | |
486 | return res; | |
487 | gcc_unreachable (); | |
488 | } | |
489 | ||
8d49e7ef VM |
490 | /* If we have decided to substitute X with the equivalent value, |
491 | return that value after elimination for INSN, otherwise return | |
492 | X. */ | |
493 | static rtx | |
cfa434f6 | 494 | get_equiv_with_elimination (rtx x, rtx_insn *insn) |
8d49e7ef VM |
495 | { |
496 | rtx res = get_equiv (x); | |
497 | ||
498 | if (x == res || CONSTANT_P (res)) | |
499 | return res; | |
d9cf932c | 500 | return lra_eliminate_regs_1 (insn, res, GET_MODE (res), |
a6af1bf9 | 501 | false, false, 0, true); |
8d49e7ef VM |
502 | } |
503 | ||
55a2c322 VM |
504 | /* Set up curr_operand_mode. */ |
505 | static void | |
506 | init_curr_operand_mode (void) | |
507 | { | |
508 | int nop = curr_static_id->n_operands; | |
509 | for (int i = 0; i < nop; i++) | |
510 | { | |
ef4bddc2 | 511 | machine_mode mode = GET_MODE (*curr_id->operand_loc[i]); |
55a2c322 VM |
512 | if (mode == VOIDmode) |
513 | { | |
514 | /* The .md mode for address operands is the mode of the | |
515 | addressed value rather than the mode of the address itself. */ | |
516 | if (curr_id->icode >= 0 && curr_static_id->operand[i].is_address) | |
517 | mode = Pmode; | |
518 | else | |
519 | mode = curr_static_id->operand[i].mode; | |
520 | } | |
521 | curr_operand_mode[i] = mode; | |
522 | } | |
523 | } | |
524 | ||
525 | \f | |
526 | ||
527 | /* The page contains code to reuse input reloads. */ | |
528 | ||
529 | /* Structure describes input reload of the current insns. */ | |
530 | struct input_reload | |
531 | { | |
3f156a6c VM |
532 | /* True for input reload of matched operands. */ |
533 | bool match_p; | |
55a2c322 VM |
534 | /* Reloaded value. */ |
535 | rtx input; | |
536 | /* Reload pseudo used. */ | |
537 | rtx reg; | |
538 | }; | |
539 | ||
540 | /* The number of elements in the following array. */ | |
541 | static int curr_insn_input_reloads_num; | |
542 | /* Array containing info about input reloads. It is used to find the | |
543 | same input reload and reuse the reload pseudo in this case. */ | |
544 | static struct input_reload curr_insn_input_reloads[LRA_MAX_INSN_RELOADS]; | |
545 | ||
546 | /* Initiate data concerning reuse of input reloads for the current | |
547 | insn. */ | |
548 | static void | |
549 | init_curr_insn_input_reloads (void) | |
550 | { | |
551 | curr_insn_input_reloads_num = 0; | |
552 | } | |
553 | ||
55a2c322 | 554 | /* Create a new pseudo using MODE, RCLASS, ORIGINAL or reuse already |
95921002 VM |
555 | created input reload pseudo (only if TYPE is not OP_OUT). Don't |
556 | reuse pseudo if IN_SUBREG_P is true and the reused pseudo should be | |
557 | wrapped up in SUBREG. The result pseudo is returned through | |
558 | RESULT_REG. Return TRUE if we created a new pseudo, FALSE if we | |
559 | reused the already created input reload pseudo. Use TITLE to | |
560 | describe new registers for debug purposes. */ | |
55a2c322 | 561 | static bool |
ef4bddc2 | 562 | get_reload_reg (enum op_type type, machine_mode mode, rtx original, |
95921002 VM |
563 | enum reg_class rclass, bool in_subreg_p, |
564 | const char *title, rtx *result_reg) | |
55a2c322 VM |
565 | { |
566 | int i, regno; | |
567 | enum reg_class new_class; | |
3f156a6c | 568 | bool unique_p = false; |
55a2c322 VM |
569 | |
570 | if (type == OP_OUT) | |
571 | { | |
572 | *result_reg | |
573 | = lra_create_new_reg_with_unique_value (mode, original, rclass, title); | |
574 | return true; | |
575 | } | |
73cca0cc VM |
576 | /* Prevent reuse value of expression with side effects, |
577 | e.g. volatile memory. */ | |
578 | if (! side_effects_p (original)) | |
579 | for (i = 0; i < curr_insn_input_reloads_num; i++) | |
3f156a6c VM |
580 | { |
581 | if (! curr_insn_input_reloads[i].match_p | |
582 | && rtx_equal_p (curr_insn_input_reloads[i].input, original) | |
583 | && in_class_p (curr_insn_input_reloads[i].reg, rclass, &new_class)) | |
584 | { | |
585 | rtx reg = curr_insn_input_reloads[i].reg; | |
586 | regno = REGNO (reg); | |
587 | /* If input is equal to original and both are VOIDmode, | |
588 | GET_MODE (reg) might be still different from mode. | |
589 | Ensure we don't return *result_reg with wrong mode. */ | |
590 | if (GET_MODE (reg) != mode) | |
591 | { | |
592 | if (in_subreg_p) | |
593 | continue; | |
cf098191 RS |
594 | if (maybe_lt (GET_MODE_SIZE (GET_MODE (reg)), |
595 | GET_MODE_SIZE (mode))) | |
3f156a6c VM |
596 | continue; |
597 | reg = lowpart_subreg (mode, reg, GET_MODE (reg)); | |
598 | if (reg == NULL_RTX || GET_CODE (reg) != SUBREG) | |
599 | continue; | |
600 | } | |
601 | *result_reg = reg; | |
602 | if (lra_dump_file != NULL) | |
603 | { | |
604 | fprintf (lra_dump_file, " Reuse r%d for reload ", regno); | |
605 | dump_value_slim (lra_dump_file, original, 1); | |
606 | } | |
607 | if (new_class != lra_get_allocno_class (regno)) | |
608 | lra_change_class (regno, new_class, ", change to", false); | |
609 | if (lra_dump_file != NULL) | |
610 | fprintf (lra_dump_file, "\n"); | |
611 | return false; | |
612 | } | |
613 | /* If we have an input reload with a different mode, make sure it | |
614 | will get a different hard reg. */ | |
615 | else if (REG_P (original) | |
616 | && REG_P (curr_insn_input_reloads[i].input) | |
617 | && REGNO (original) == REGNO (curr_insn_input_reloads[i].input) | |
618 | && (GET_MODE (original) | |
619 | != GET_MODE (curr_insn_input_reloads[i].input))) | |
620 | unique_p = true; | |
621 | } | |
622 | *result_reg = (unique_p | |
623 | ? lra_create_new_reg_with_unique_value | |
624 | : lra_create_new_reg) (mode, original, rclass, title); | |
55a2c322 VM |
625 | lra_assert (curr_insn_input_reloads_num < LRA_MAX_INSN_RELOADS); |
626 | curr_insn_input_reloads[curr_insn_input_reloads_num].input = original; | |
3f156a6c | 627 | curr_insn_input_reloads[curr_insn_input_reloads_num].match_p = false; |
55a2c322 VM |
628 | curr_insn_input_reloads[curr_insn_input_reloads_num++].reg = *result_reg; |
629 | return true; | |
630 | } | |
631 | ||
632 | \f | |
633 | ||
634 | /* The page contains code to extract memory address parts. */ | |
635 | ||
55a2c322 VM |
636 | /* Wrapper around REGNO_OK_FOR_INDEX_P, to allow pseudos. */ |
637 | static inline bool | |
638 | ok_for_index_p_nonstrict (rtx reg) | |
639 | { | |
640 | unsigned regno = REGNO (reg); | |
f4eafc30 | 641 | |
55a2c322 VM |
642 | return regno >= FIRST_PSEUDO_REGISTER || REGNO_OK_FOR_INDEX_P (regno); |
643 | } | |
644 | ||
645 | /* A version of regno_ok_for_base_p for use here, when all pseudos | |
646 | should count as OK. Arguments as for regno_ok_for_base_p. */ | |
647 | static inline bool | |
ef4bddc2 | 648 | ok_for_base_p_nonstrict (rtx reg, machine_mode mode, addr_space_t as, |
55a2c322 VM |
649 | enum rtx_code outer_code, enum rtx_code index_code) |
650 | { | |
651 | unsigned regno = REGNO (reg); | |
652 | ||
653 | if (regno >= FIRST_PSEUDO_REGISTER) | |
654 | return true; | |
655 | return ok_for_base_p_1 (regno, mode, as, outer_code, index_code); | |
656 | } | |
657 | ||
55a2c322 VM |
658 | \f |
659 | ||
660 | /* The page contains major code to choose the current insn alternative | |
661 | and generate reloads for it. */ | |
662 | ||
663 | /* Return the offset from REGNO of the least significant register | |
664 | in (reg:MODE REGNO). | |
665 | ||
666 | This function is used to tell whether two registers satisfy | |
667 | a matching constraint. (reg:MODE1 REGNO1) matches (reg:MODE2 REGNO2) if: | |
668 | ||
669 | REGNO1 + lra_constraint_offset (REGNO1, MODE1) | |
670 | == REGNO2 + lra_constraint_offset (REGNO2, MODE2) */ | |
671 | int | |
ef4bddc2 | 672 | lra_constraint_offset (int regno, machine_mode mode) |
55a2c322 VM |
673 | { |
674 | lra_assert (regno < FIRST_PSEUDO_REGISTER); | |
b0567726 RS |
675 | |
676 | scalar_int_mode int_mode; | |
677 | if (WORDS_BIG_ENDIAN | |
678 | && is_a <scalar_int_mode> (mode, &int_mode) | |
679 | && GET_MODE_SIZE (int_mode) > UNITS_PER_WORD) | |
ad474626 | 680 | return hard_regno_nregs (regno, mode) - 1; |
55a2c322 VM |
681 | return 0; |
682 | } | |
683 | ||
684 | /* Like rtx_equal_p except that it allows a REG and a SUBREG to match | |
685 | if they are the same hard reg, and has special hacks for | |
686 | auto-increment and auto-decrement. This is specifically intended for | |
687 | process_alt_operands to use in determining whether two operands | |
688 | match. X is the operand whose number is the lower of the two. | |
689 | ||
690 | It is supposed that X is the output operand and Y is the input | |
691 | operand. Y_HARD_REGNO is the final hard regno of register Y or | |
692 | register in subreg Y as we know it now. Otherwise, it is a | |
693 | negative value. */ | |
694 | static bool | |
695 | operands_match_p (rtx x, rtx y, int y_hard_regno) | |
696 | { | |
697 | int i; | |
698 | RTX_CODE code = GET_CODE (x); | |
699 | const char *fmt; | |
700 | ||
701 | if (x == y) | |
702 | return true; | |
703 | if ((code == REG || (code == SUBREG && REG_P (SUBREG_REG (x)))) | |
704 | && (REG_P (y) || (GET_CODE (y) == SUBREG && REG_P (SUBREG_REG (y))))) | |
705 | { | |
706 | int j; | |
f4eafc30 | 707 | |
1686923c | 708 | i = get_hard_regno (x, false); |
55a2c322 VM |
709 | if (i < 0) |
710 | goto slow; | |
711 | ||
712 | if ((j = y_hard_regno) < 0) | |
713 | goto slow; | |
714 | ||
715 | i += lra_constraint_offset (i, GET_MODE (x)); | |
716 | j += lra_constraint_offset (j, GET_MODE (y)); | |
717 | ||
718 | return i == j; | |
719 | } | |
720 | ||
721 | /* If two operands must match, because they are really a single | |
722 | operand of an assembler insn, then two post-increments are invalid | |
723 | because the assembler insn would increment only once. On the | |
724 | other hand, a post-increment matches ordinary indexing if the | |
725 | post-increment is the output operand. */ | |
726 | if (code == POST_DEC || code == POST_INC || code == POST_MODIFY) | |
727 | return operands_match_p (XEXP (x, 0), y, y_hard_regno); | |
728 | ||
729 | /* Two pre-increments are invalid because the assembler insn would | |
730 | increment only once. On the other hand, a pre-increment matches | |
731 | ordinary indexing if the pre-increment is the input operand. */ | |
732 | if (GET_CODE (y) == PRE_DEC || GET_CODE (y) == PRE_INC | |
733 | || GET_CODE (y) == PRE_MODIFY) | |
734 | return operands_match_p (x, XEXP (y, 0), -1); | |
f4eafc30 | 735 | |
55a2c322 VM |
736 | slow: |
737 | ||
9fccb335 RS |
738 | if (code == REG && REG_P (y)) |
739 | return REGNO (x) == REGNO (y); | |
740 | ||
55a2c322 VM |
741 | if (code == REG && GET_CODE (y) == SUBREG && REG_P (SUBREG_REG (y)) |
742 | && x == SUBREG_REG (y)) | |
743 | return true; | |
744 | if (GET_CODE (y) == REG && code == SUBREG && REG_P (SUBREG_REG (x)) | |
745 | && SUBREG_REG (x) == y) | |
746 | return true; | |
747 | ||
748 | /* Now we have disposed of all the cases in which different rtx | |
749 | codes can match. */ | |
750 | if (code != GET_CODE (y)) | |
751 | return false; | |
752 | ||
753 | /* (MULT:SI x y) and (MULT:HI x y) are NOT equivalent. */ | |
754 | if (GET_MODE (x) != GET_MODE (y)) | |
755 | return false; | |
756 | ||
757 | switch (code) | |
758 | { | |
759 | CASE_CONST_UNIQUE: | |
760 | return false; | |
761 | ||
762 | case LABEL_REF: | |
04a121a7 | 763 | return label_ref_label (x) == label_ref_label (y); |
55a2c322 VM |
764 | case SYMBOL_REF: |
765 | return XSTR (x, 0) == XSTR (y, 0); | |
766 | ||
767 | default: | |
768 | break; | |
769 | } | |
770 | ||
771 | /* Compare the elements. If any pair of corresponding elements fail | |
772 | to match, return false for the whole things. */ | |
773 | ||
774 | fmt = GET_RTX_FORMAT (code); | |
775 | for (i = GET_RTX_LENGTH (code) - 1; i >= 0; i--) | |
776 | { | |
777 | int val, j; | |
778 | switch (fmt[i]) | |
779 | { | |
780 | case 'w': | |
781 | if (XWINT (x, i) != XWINT (y, i)) | |
782 | return false; | |
783 | break; | |
784 | ||
785 | case 'i': | |
786 | if (XINT (x, i) != XINT (y, i)) | |
787 | return false; | |
788 | break; | |
789 | ||
91914e56 RS |
790 | case 'p': |
791 | if (maybe_ne (SUBREG_BYTE (x), SUBREG_BYTE (y))) | |
792 | return false; | |
793 | break; | |
794 | ||
55a2c322 VM |
795 | case 'e': |
796 | val = operands_match_p (XEXP (x, i), XEXP (y, i), -1); | |
797 | if (val == 0) | |
798 | return false; | |
799 | break; | |
800 | ||
801 | case '0': | |
802 | break; | |
803 | ||
804 | case 'E': | |
805 | if (XVECLEN (x, i) != XVECLEN (y, i)) | |
806 | return false; | |
807 | for (j = XVECLEN (x, i) - 1; j >= 0; --j) | |
808 | { | |
809 | val = operands_match_p (XVECEXP (x, i, j), XVECEXP (y, i, j), -1); | |
810 | if (val == 0) | |
811 | return false; | |
812 | } | |
813 | break; | |
814 | ||
815 | /* It is believed that rtx's at this level will never | |
816 | contain anything but integers and other rtx's, except for | |
817 | within LABEL_REFs and SYMBOL_REFs. */ | |
818 | default: | |
819 | gcc_unreachable (); | |
820 | } | |
821 | } | |
822 | return true; | |
823 | } | |
824 | ||
825 | /* True if X is a constant that can be forced into the constant pool. | |
826 | MODE is the mode of the operand, or VOIDmode if not known. */ | |
827 | #define CONST_POOL_OK_P(MODE, X) \ | |
828 | ((MODE) != VOIDmode \ | |
829 | && CONSTANT_P (X) \ | |
830 | && GET_CODE (X) != HIGH \ | |
cf098191 | 831 | && GET_MODE_SIZE (MODE).is_constant () \ |
55a2c322 VM |
832 | && !targetm.cannot_force_const_mem (MODE, X)) |
833 | ||
834 | /* True if C is a non-empty register class that has too few registers | |
835 | to be safely used as a reload target class. */ | |
a9711f36 VM |
836 | #define SMALL_REGISTER_CLASS_P(C) \ |
837 | (ira_class_hard_regs_num [(C)] == 1 \ | |
838 | || (ira_class_hard_regs_num [(C)] >= 1 \ | |
839 | && targetm.class_likely_spilled_p (C))) | |
55a2c322 VM |
840 | |
841 | /* If REG is a reload pseudo, try to make its class satisfying CL. */ | |
842 | static void | |
843 | narrow_reload_pseudo_class (rtx reg, enum reg_class cl) | |
844 | { | |
845 | enum reg_class rclass; | |
846 | ||
847 | /* Do not make more accurate class from reloads generated. They are | |
848 | mostly moves with a lot of constraints. Making more accurate | |
849 | class may results in very narrow class and impossibility of find | |
850 | registers for several reloads of one insn. */ | |
851 | if (INSN_UID (curr_insn) >= new_insn_uid_start) | |
852 | return; | |
853 | if (GET_CODE (reg) == SUBREG) | |
854 | reg = SUBREG_REG (reg); | |
855 | if (! REG_P (reg) || (int) REGNO (reg) < new_regno_start) | |
856 | return; | |
857 | if (in_class_p (reg, cl, &rclass) && rclass != cl) | |
a2d0d374 | 858 | lra_change_class (REGNO (reg), rclass, " Change to", true); |
55a2c322 VM |
859 | } |
860 | ||
4be9717c VM |
861 | /* Searches X for any reference to a reg with the same value as REGNO, |
862 | returning the rtx of the reference found if any. Otherwise, | |
863 | returns NULL_RTX. */ | |
864 | static rtx | |
865 | regno_val_use_in (unsigned int regno, rtx x) | |
866 | { | |
867 | const char *fmt; | |
868 | int i, j; | |
869 | rtx tem; | |
870 | ||
871 | if (REG_P (x) && lra_reg_info[REGNO (x)].val == lra_reg_info[regno].val) | |
872 | return x; | |
873 | ||
874 | fmt = GET_RTX_FORMAT (GET_CODE (x)); | |
875 | for (i = GET_RTX_LENGTH (GET_CODE (x)) - 1; i >= 0; i--) | |
876 | { | |
877 | if (fmt[i] == 'e') | |
878 | { | |
879 | if ((tem = regno_val_use_in (regno, XEXP (x, i)))) | |
880 | return tem; | |
881 | } | |
882 | else if (fmt[i] == 'E') | |
883 | for (j = XVECLEN (x, i) - 1; j >= 0; j--) | |
884 | if ((tem = regno_val_use_in (regno , XVECEXP (x, i, j)))) | |
885 | return tem; | |
886 | } | |
887 | ||
888 | return NULL_RTX; | |
889 | } | |
890 | ||
d8321b33 VM |
891 | /* Return true if all current insn non-output operands except INS (it |
892 | has a negaitve end marker) do not use pseudos with the same value | |
893 | as REGNO. */ | |
894 | static bool | |
895 | check_conflict_input_operands (int regno, signed char *ins) | |
896 | { | |
897 | int in; | |
898 | int n_operands = curr_static_id->n_operands; | |
899 | ||
900 | for (int nop = 0; nop < n_operands; nop++) | |
901 | if (! curr_static_id->operand[nop].is_operator | |
902 | && curr_static_id->operand[nop].type != OP_OUT) | |
903 | { | |
904 | for (int i = 0; (in = ins[i]) >= 0; i++) | |
905 | if (in == nop) | |
906 | break; | |
907 | if (in < 0 | |
908 | && regno_val_use_in (regno, *curr_id->operand_loc[nop]) != NULL_RTX) | |
909 | return false; | |
910 | } | |
911 | return true; | |
912 | } | |
913 | ||
55a2c322 | 914 | /* Generate reloads for matching OUT and INS (array of input operand |
aefae0f1 TP |
915 | numbers with end marker -1) with reg class GOAL_CLASS, considering |
916 | output operands OUTS (similar array to INS) needing to be in different | |
917 | registers. Add input and output reloads correspondingly to the lists | |
918 | *BEFORE and *AFTER. OUT might be negative. In this case we generate | |
919 | input reloads for matched input operands INS. EARLY_CLOBBER_P is a flag | |
920 | that the output operand is early clobbered for chosen alternative. */ | |
55a2c322 | 921 | static void |
aefae0f1 TP |
922 | match_reload (signed char out, signed char *ins, signed char *outs, |
923 | enum reg_class goal_class, rtx_insn **before, | |
924 | rtx_insn **after, bool early_clobber_p) | |
55a2c322 | 925 | { |
aefae0f1 | 926 | bool out_conflict; |
55a2c322 | 927 | int i, in; |
e67d1102 | 928 | rtx new_in_reg, new_out_reg, reg; |
ef4bddc2 | 929 | machine_mode inmode, outmode; |
55a2c322 | 930 | rtx in_rtx = *curr_id->operand_loc[ins[0]]; |
511dcace | 931 | rtx out_rtx = out < 0 ? in_rtx : *curr_id->operand_loc[out]; |
55a2c322 | 932 | |
55a2c322 | 933 | inmode = curr_operand_mode[ins[0]]; |
511dcace | 934 | outmode = out < 0 ? inmode : curr_operand_mode[out]; |
55a2c322 VM |
935 | push_to_sequence (*before); |
936 | if (inmode != outmode) | |
937 | { | |
00224b1a RS |
938 | /* process_alt_operands has already checked that the mode sizes |
939 | are ordered. */ | |
bd4288c0 | 940 | if (partial_subreg_p (outmode, inmode)) |
55a2c322 VM |
941 | { |
942 | reg = new_in_reg | |
943 | = lra_create_new_reg_with_unique_value (inmode, in_rtx, | |
944 | goal_class, ""); | |
945 | if (SCALAR_INT_MODE_P (inmode)) | |
946 | new_out_reg = gen_lowpart_SUBREG (outmode, reg); | |
947 | else | |
948 | new_out_reg = gen_rtx_SUBREG (outmode, reg, 0); | |
2c62cbaa | 949 | LRA_SUBREG_P (new_out_reg) = 1; |
350c0fe7 | 950 | /* If the input reg is dying here, we can use the same hard |
f681cf95 VM |
951 | register for REG and IN_RTX. We do it only for original |
952 | pseudos as reload pseudos can die although original | |
953 | pseudos still live where reload pseudos dies. */ | |
954 | if (REG_P (in_rtx) && (int) REGNO (in_rtx) < lra_new_regno_start | |
d8321b33 VM |
955 | && find_regno_note (curr_insn, REG_DEAD, REGNO (in_rtx)) |
956 | && (!early_clobber_p | |
957 | || check_conflict_input_operands(REGNO (in_rtx), ins))) | |
d70a81dd | 958 | lra_assign_reg_val (REGNO (in_rtx), REGNO (reg)); |
55a2c322 VM |
959 | } |
960 | else | |
961 | { | |
962 | reg = new_out_reg | |
963 | = lra_create_new_reg_with_unique_value (outmode, out_rtx, | |
964 | goal_class, ""); | |
965 | if (SCALAR_INT_MODE_P (outmode)) | |
966 | new_in_reg = gen_lowpart_SUBREG (inmode, reg); | |
967 | else | |
968 | new_in_reg = gen_rtx_SUBREG (inmode, reg, 0); | |
969 | /* NEW_IN_REG is non-paradoxical subreg. We don't want | |
970 | NEW_OUT_REG living above. We add clobber clause for | |
c5cd5a7e VM |
971 | this. This is just a temporary clobber. We can remove |
972 | it at the end of LRA work. */ | |
e67d1102 | 973 | rtx_insn *clobber = emit_clobber (new_out_reg); |
c5cd5a7e | 974 | LRA_TEMP_CLOBBER_P (PATTERN (clobber)) = 1; |
2c62cbaa | 975 | LRA_SUBREG_P (new_in_reg) = 1; |
350c0fe7 VM |
976 | if (GET_CODE (in_rtx) == SUBREG) |
977 | { | |
978 | rtx subreg_reg = SUBREG_REG (in_rtx); | |
979 | ||
980 | /* If SUBREG_REG is dying here and sub-registers IN_RTX | |
981 | and NEW_IN_REG are similar, we can use the same hard | |
982 | register for REG and SUBREG_REG. */ | |
f681cf95 VM |
983 | if (REG_P (subreg_reg) |
984 | && (int) REGNO (subreg_reg) < lra_new_regno_start | |
985 | && GET_MODE (subreg_reg) == outmode | |
91914e56 | 986 | && known_eq (SUBREG_BYTE (in_rtx), SUBREG_BYTE (new_in_reg)) |
d8321b33 VM |
987 | && find_regno_note (curr_insn, REG_DEAD, REGNO (subreg_reg)) |
988 | && (! early_clobber_p | |
989 | || check_conflict_input_operands (REGNO (subreg_reg), | |
990 | ins))) | |
d70a81dd | 991 | lra_assign_reg_val (REGNO (subreg_reg), REGNO (reg)); |
350c0fe7 | 992 | } |
55a2c322 VM |
993 | } |
994 | } | |
995 | else | |
996 | { | |
997 | /* Pseudos have values -- see comments for lra_reg_info. | |
998 | Different pseudos with the same value do not conflict even if | |
999 | they live in the same place. When we create a pseudo we | |
1000 | assign value of original pseudo (if any) from which we | |
1001 | created the new pseudo. If we create the pseudo from the | |
3363daad VM |
1002 | input pseudo, the new pseudo will have no conflict with the |
1003 | input pseudo which is wrong when the input pseudo lives after | |
1004 | the insn and as the new pseudo value is changed by the insn | |
1005 | output. Therefore we create the new pseudo from the output | |
1006 | except the case when we have single matched dying input | |
1007 | pseudo. | |
f4eafc30 | 1008 | |
55a2c322 VM |
1009 | We cannot reuse the current output register because we might |
1010 | have a situation like "a <- a op b", where the constraints | |
1011 | force the second input operand ("b") to match the output | |
1012 | operand ("a"). "b" must then be copied into a new register | |
599e1cf8 VM |
1013 | so that it doesn't clobber the current value of "a". |
1014 | ||
1015 | We can not use the same value if the output pseudo is | |
1016 | early clobbered or the input pseudo is mentioned in the | |
1017 | output, e.g. as an address part in memory, because | |
1018 | output reload will actually extend the pseudo liveness. | |
1019 | We don't care about eliminable hard regs here as we are | |
1020 | interesting only in pseudos. */ | |
f4eafc30 | 1021 | |
aefae0f1 TP |
1022 | /* Matching input's register value is the same as one of the other |
1023 | output operand. Output operands in a parallel insn must be in | |
1024 | different registers. */ | |
1025 | out_conflict = false; | |
1026 | if (REG_P (in_rtx)) | |
1027 | { | |
1028 | for (i = 0; outs[i] >= 0; i++) | |
1029 | { | |
1030 | rtx other_out_rtx = *curr_id->operand_loc[outs[i]]; | |
1031 | if (REG_P (other_out_rtx) | |
1032 | && (regno_val_use_in (REGNO (in_rtx), other_out_rtx) | |
1033 | != NULL_RTX)) | |
1034 | { | |
1035 | out_conflict = true; | |
1036 | break; | |
1037 | } | |
1038 | } | |
1039 | } | |
1040 | ||
55a2c322 | 1041 | new_in_reg = new_out_reg |
599e1cf8 | 1042 | = (! early_clobber_p && ins[1] < 0 && REG_P (in_rtx) |
3363daad VM |
1043 | && (int) REGNO (in_rtx) < lra_new_regno_start |
1044 | && find_regno_note (curr_insn, REG_DEAD, REGNO (in_rtx)) | |
d8321b33 VM |
1045 | && (! early_clobber_p |
1046 | || check_conflict_input_operands (REGNO (in_rtx), ins)) | |
4be9717c VM |
1047 | && (out < 0 |
1048 | || regno_val_use_in (REGNO (in_rtx), out_rtx) == NULL_RTX) | |
aefae0f1 | 1049 | && !out_conflict |
3363daad VM |
1050 | ? lra_create_new_reg (inmode, in_rtx, goal_class, "") |
1051 | : lra_create_new_reg_with_unique_value (outmode, out_rtx, | |
1052 | goal_class, "")); | |
55a2c322 | 1053 | } |
511dcace VM |
1054 | /* In operand can be got from transformations before processing insn |
1055 | constraints. One example of such transformations is subreg | |
1056 | reloading (see function simplify_operand_subreg). The new | |
1057 | pseudos created by the transformations might have inaccurate | |
55a2c322 VM |
1058 | class (ALL_REGS) and we should make their classes more |
1059 | accurate. */ | |
1060 | narrow_reload_pseudo_class (in_rtx, goal_class); | |
55a2c322 VM |
1061 | lra_emit_move (copy_rtx (new_in_reg), in_rtx); |
1062 | *before = get_insns (); | |
1063 | end_sequence (); | |
3f156a6c VM |
1064 | /* Add the new pseudo to consider values of subsequent input reload |
1065 | pseudos. */ | |
1066 | lra_assert (curr_insn_input_reloads_num < LRA_MAX_INSN_RELOADS); | |
1067 | curr_insn_input_reloads[curr_insn_input_reloads_num].input = in_rtx; | |
1068 | curr_insn_input_reloads[curr_insn_input_reloads_num].match_p = true; | |
1069 | curr_insn_input_reloads[curr_insn_input_reloads_num++].reg = new_in_reg; | |
55a2c322 VM |
1070 | for (i = 0; (in = ins[i]) >= 0; i++) |
1071 | { | |
1072 | lra_assert | |
1073 | (GET_MODE (*curr_id->operand_loc[in]) == VOIDmode | |
1074 | || GET_MODE (new_in_reg) == GET_MODE (*curr_id->operand_loc[in])); | |
1075 | *curr_id->operand_loc[in] = new_in_reg; | |
1076 | } | |
1077 | lra_update_dups (curr_id, ins); | |
511dcace VM |
1078 | if (out < 0) |
1079 | return; | |
1080 | /* See a comment for the input operand above. */ | |
1081 | narrow_reload_pseudo_class (out_rtx, goal_class); | |
55a2c322 VM |
1082 | if (find_reg_note (curr_insn, REG_UNUSED, out_rtx) == NULL_RTX) |
1083 | { | |
1084 | start_sequence (); | |
1085 | lra_emit_move (out_rtx, copy_rtx (new_out_reg)); | |
1086 | emit_insn (*after); | |
1087 | *after = get_insns (); | |
1088 | end_sequence (); | |
1089 | } | |
1090 | *curr_id->operand_loc[out] = new_out_reg; | |
1091 | lra_update_dup (curr_id, out); | |
1092 | } | |
1093 | ||
1094 | /* Return register class which is union of all reg classes in insn | |
1095 | constraint alternative string starting with P. */ | |
1096 | static enum reg_class | |
1097 | reg_class_from_constraints (const char *p) | |
1098 | { | |
1099 | int c, len; | |
1100 | enum reg_class op_class = NO_REGS; | |
1101 | ||
1102 | do | |
1103 | switch ((c = *p, len = CONSTRAINT_LEN (c, p)), c) | |
1104 | { | |
1105 | case '#': | |
1106 | case ',': | |
1107 | return op_class; | |
1108 | ||
55a2c322 | 1109 | case 'g': |
55a2c322 VM |
1110 | op_class = reg_class_subunion[op_class][GENERAL_REGS]; |
1111 | break; | |
f4eafc30 | 1112 | |
55a2c322 | 1113 | default: |
777e635f RS |
1114 | enum constraint_num cn = lookup_constraint (p); |
1115 | enum reg_class cl = reg_class_for_constraint (cn); | |
1116 | if (cl == NO_REGS) | |
55a2c322 | 1117 | { |
777e635f | 1118 | if (insn_extra_address_constraint (cn)) |
55a2c322 VM |
1119 | op_class |
1120 | = (reg_class_subunion | |
1121 | [op_class][base_reg_class (VOIDmode, ADDR_SPACE_GENERIC, | |
1122 | ADDRESS, SCRATCH)]); | |
55a2c322 VM |
1123 | break; |
1124 | } | |
f4eafc30 | 1125 | |
777e635f RS |
1126 | op_class = reg_class_subunion[op_class][cl]; |
1127 | break; | |
55a2c322 VM |
1128 | } |
1129 | while ((p += len), c); | |
1130 | return op_class; | |
1131 | } | |
1132 | ||
1133 | /* If OP is a register, return the class of the register as per | |
1134 | get_reg_class, otherwise return NO_REGS. */ | |
1135 | static inline enum reg_class | |
1136 | get_op_class (rtx op) | |
1137 | { | |
1138 | return REG_P (op) ? get_reg_class (REGNO (op)) : NO_REGS; | |
1139 | } | |
1140 | ||
1141 | /* Return generated insn mem_pseudo:=val if TO_P or val:=mem_pseudo | |
1142 | otherwise. If modes of MEM_PSEUDO and VAL are different, use | |
1143 | SUBREG for VAL to make them equal. */ | |
cfa434f6 | 1144 | static rtx_insn * |
55a2c322 VM |
1145 | emit_spill_move (bool to_p, rtx mem_pseudo, rtx val) |
1146 | { | |
1147 | if (GET_MODE (mem_pseudo) != GET_MODE (val)) | |
2c62cbaa | 1148 | { |
cb1cca12 VM |
1149 | /* Usually size of mem_pseudo is greater than val size but in |
1150 | rare cases it can be less as it can be defined by target | |
1151 | dependent macro HARD_REGNO_CALLER_SAVE_MODE. */ | |
1ccd4874 VM |
1152 | if (! MEM_P (val)) |
1153 | { | |
54b84aa9 EB |
1154 | val = gen_lowpart_SUBREG (GET_MODE (mem_pseudo), |
1155 | GET_CODE (val) == SUBREG | |
1156 | ? SUBREG_REG (val) : val); | |
1ccd4874 VM |
1157 | LRA_SUBREG_P (val) = 1; |
1158 | } | |
1159 | else | |
1160 | { | |
1161 | mem_pseudo = gen_lowpart_SUBREG (GET_MODE (val), mem_pseudo); | |
1162 | LRA_SUBREG_P (mem_pseudo) = 1; | |
1163 | } | |
2c62cbaa | 1164 | } |
1476d1bd MM |
1165 | return to_p ? gen_move_insn (mem_pseudo, val) |
1166 | : gen_move_insn (val, mem_pseudo); | |
55a2c322 VM |
1167 | } |
1168 | ||
1169 | /* Process a special case insn (register move), return true if we | |
2c62cbaa | 1170 | don't need to process it anymore. INSN should be a single set |
f15643d4 RS |
1171 | insn. Set up that RTL was changed through CHANGE_P and that hook |
1172 | TARGET_SECONDARY_MEMORY_NEEDED says to use secondary memory through | |
2c62cbaa | 1173 | SEC_MEM_P. */ |
55a2c322 | 1174 | static bool |
2c62cbaa | 1175 | check_and_process_move (bool *change_p, bool *sec_mem_p ATTRIBUTE_UNUSED) |
55a2c322 VM |
1176 | { |
1177 | int sregno, dregno; | |
ef0006eb | 1178 | rtx dest, src, dreg, sreg, new_reg, scratch_reg; |
cfa434f6 | 1179 | rtx_insn *before; |
55a2c322 | 1180 | enum reg_class dclass, sclass, secondary_class; |
55a2c322 VM |
1181 | secondary_reload_info sri; |
1182 | ||
2c62cbaa VM |
1183 | lra_assert (curr_insn_set != NULL_RTX); |
1184 | dreg = dest = SET_DEST (curr_insn_set); | |
1185 | sreg = src = SET_SRC (curr_insn_set); | |
55a2c322 VM |
1186 | if (GET_CODE (dest) == SUBREG) |
1187 | dreg = SUBREG_REG (dest); | |
1188 | if (GET_CODE (src) == SUBREG) | |
1189 | sreg = SUBREG_REG (src); | |
1ccd4874 | 1190 | if (! (REG_P (dreg) || MEM_P (dreg)) || ! (REG_P (sreg) || MEM_P (sreg))) |
55a2c322 VM |
1191 | return false; |
1192 | sclass = dclass = NO_REGS; | |
55a2c322 VM |
1193 | if (REG_P (dreg)) |
1194 | dclass = get_reg_class (REGNO (dreg)); | |
48855443 | 1195 | gcc_assert (dclass < LIM_REG_CLASSES); |
55a2c322 VM |
1196 | if (dclass == ALL_REGS) |
1197 | /* ALL_REGS is used for new pseudos created by transformations | |
1198 | like reload of SUBREG_REG (see function | |
1199 | simplify_operand_subreg). We don't know their class yet. We | |
1200 | should figure out the class from processing the insn | |
1201 | constraints not in this fast path function. Even if ALL_REGS | |
1202 | were a right class for the pseudo, secondary_... hooks usually | |
1203 | are not define for ALL_REGS. */ | |
1204 | return false; | |
55a2c322 VM |
1205 | if (REG_P (sreg)) |
1206 | sclass = get_reg_class (REGNO (sreg)); | |
48855443 | 1207 | gcc_assert (sclass < LIM_REG_CLASSES); |
55a2c322 VM |
1208 | if (sclass == ALL_REGS) |
1209 | /* See comments above. */ | |
1210 | return false; | |
1ccd4874 VM |
1211 | if (sclass == NO_REGS && dclass == NO_REGS) |
1212 | return false; | |
f15643d4 | 1213 | if (targetm.secondary_memory_needed (GET_MODE (src), sclass, dclass) |
1ccd4874 | 1214 | && ((sclass != NO_REGS && dclass != NO_REGS) |
94e23f53 RS |
1215 | || (GET_MODE (src) |
1216 | != targetm.secondary_memory_needed_mode (GET_MODE (src))))) | |
55a2c322 VM |
1217 | { |
1218 | *sec_mem_p = true; | |
1219 | return false; | |
1220 | } | |
1ccd4874 VM |
1221 | if (! REG_P (dreg) || ! REG_P (sreg)) |
1222 | return false; | |
55a2c322 VM |
1223 | sri.prev_sri = NULL; |
1224 | sri.icode = CODE_FOR_nothing; | |
1225 | sri.extra_cost = 0; | |
1226 | secondary_class = NO_REGS; | |
1227 | /* Set up hard register for a reload pseudo for hook | |
1228 | secondary_reload because some targets just ignore unassigned | |
1229 | pseudos in the hook. */ | |
1230 | if (dclass != NO_REGS && lra_get_regno_hard_regno (REGNO (dreg)) < 0) | |
1231 | { | |
1232 | dregno = REGNO (dreg); | |
1233 | reg_renumber[dregno] = ira_class_hard_regs[dclass][0]; | |
1234 | } | |
1235 | else | |
1236 | dregno = -1; | |
1237 | if (sclass != NO_REGS && lra_get_regno_hard_regno (REGNO (sreg)) < 0) | |
1238 | { | |
1239 | sregno = REGNO (sreg); | |
1240 | reg_renumber[sregno] = ira_class_hard_regs[sclass][0]; | |
1241 | } | |
1242 | else | |
1243 | sregno = -1; | |
1244 | if (sclass != NO_REGS) | |
1245 | secondary_class | |
1246 | = (enum reg_class) targetm.secondary_reload (false, dest, | |
1247 | (reg_class_t) sclass, | |
1248 | GET_MODE (src), &sri); | |
1249 | if (sclass == NO_REGS | |
1250 | || ((secondary_class != NO_REGS || sri.icode != CODE_FOR_nothing) | |
1251 | && dclass != NO_REGS)) | |
1252 | { | |
55a2c322 VM |
1253 | enum reg_class old_sclass = secondary_class; |
1254 | secondary_reload_info old_sri = sri; | |
55a2c322 VM |
1255 | |
1256 | sri.prev_sri = NULL; | |
1257 | sri.icode = CODE_FOR_nothing; | |
1258 | sri.extra_cost = 0; | |
1259 | secondary_class | |
ef0006eb | 1260 | = (enum reg_class) targetm.secondary_reload (true, src, |
55a2c322 | 1261 | (reg_class_t) dclass, |
ef0006eb | 1262 | GET_MODE (src), &sri); |
55a2c322 VM |
1263 | /* Check the target hook consistency. */ |
1264 | lra_assert | |
1265 | ((secondary_class == NO_REGS && sri.icode == CODE_FOR_nothing) | |
1266 | || (old_sclass == NO_REGS && old_sri.icode == CODE_FOR_nothing) | |
1267 | || (secondary_class == old_sclass && sri.icode == old_sri.icode)); | |
1268 | } | |
1269 | if (sregno >= 0) | |
1270 | reg_renumber [sregno] = -1; | |
1271 | if (dregno >= 0) | |
1272 | reg_renumber [dregno] = -1; | |
1273 | if (secondary_class == NO_REGS && sri.icode == CODE_FOR_nothing) | |
1274 | return false; | |
1275 | *change_p = true; | |
1276 | new_reg = NULL_RTX; | |
1277 | if (secondary_class != NO_REGS) | |
ef0006eb | 1278 | new_reg = lra_create_new_reg_with_unique_value (GET_MODE (src), NULL_RTX, |
55a2c322 VM |
1279 | secondary_class, |
1280 | "secondary"); | |
1281 | start_sequence (); | |
55a2c322 | 1282 | if (sri.icode == CODE_FOR_nothing) |
ef0006eb | 1283 | lra_emit_move (new_reg, src); |
55a2c322 VM |
1284 | else |
1285 | { | |
1286 | enum reg_class scratch_class; | |
1287 | ||
1288 | scratch_class = (reg_class_from_constraints | |
1289 | (insn_data[sri.icode].operand[2].constraint)); | |
1290 | scratch_reg = (lra_create_new_reg_with_unique_value | |
1291 | (insn_data[sri.icode].operand[2].mode, NULL_RTX, | |
1292 | scratch_class, "scratch")); | |
1293 | emit_insn (GEN_FCN (sri.icode) (new_reg != NULL_RTX ? new_reg : dest, | |
ef0006eb | 1294 | src, scratch_reg)); |
55a2c322 VM |
1295 | } |
1296 | before = get_insns (); | |
1297 | end_sequence (); | |
cfa434f6 | 1298 | lra_process_new_insns (curr_insn, before, NULL, "Inserting the move"); |
55a2c322 | 1299 | if (new_reg != NULL_RTX) |
ef0006eb | 1300 | SET_SRC (curr_insn_set) = new_reg; |
55a2c322 VM |
1301 | else |
1302 | { | |
1303 | if (lra_dump_file != NULL) | |
1304 | { | |
1305 | fprintf (lra_dump_file, "Deleting move %u\n", INSN_UID (curr_insn)); | |
cfbeaedf | 1306 | dump_insn_slim (lra_dump_file, curr_insn); |
55a2c322 VM |
1307 | } |
1308 | lra_set_insn_deleted (curr_insn); | |
1309 | return true; | |
1310 | } | |
1311 | return false; | |
1312 | } | |
1313 | ||
1314 | /* The following data describe the result of process_alt_operands. | |
1315 | The data are used in curr_insn_transform to generate reloads. */ | |
1316 | ||
1317 | /* The chosen reg classes which should be used for the corresponding | |
1318 | operands. */ | |
1319 | static enum reg_class goal_alt[MAX_RECOG_OPERANDS]; | |
1320 | /* True if the operand should be the same as another operand and that | |
1321 | other operand does not need a reload. */ | |
1322 | static bool goal_alt_match_win[MAX_RECOG_OPERANDS]; | |
1323 | /* True if the operand does not need a reload. */ | |
1324 | static bool goal_alt_win[MAX_RECOG_OPERANDS]; | |
1325 | /* True if the operand can be offsetable memory. */ | |
1326 | static bool goal_alt_offmemok[MAX_RECOG_OPERANDS]; | |
1327 | /* The number of an operand to which given operand can be matched to. */ | |
1328 | static int goal_alt_matches[MAX_RECOG_OPERANDS]; | |
1329 | /* The number of elements in the following array. */ | |
1330 | static int goal_alt_dont_inherit_ops_num; | |
1331 | /* Numbers of operands whose reload pseudos should not be inherited. */ | |
1332 | static int goal_alt_dont_inherit_ops[MAX_RECOG_OPERANDS]; | |
1333 | /* True if the insn commutative operands should be swapped. */ | |
1334 | static bool goal_alt_swapped; | |
1335 | /* The chosen insn alternative. */ | |
1336 | static int goal_alt_number; | |
1337 | ||
987b67f1 VM |
1338 | /* True if the corresponding operand is the result of an equivalence |
1339 | substitution. */ | |
1340 | static bool equiv_substition_p[MAX_RECOG_OPERANDS]; | |
1341 | ||
55a2c322 VM |
1342 | /* The following five variables are used to choose the best insn |
1343 | alternative. They reflect final characteristics of the best | |
1344 | alternative. */ | |
1345 | ||
1346 | /* Number of necessary reloads and overall cost reflecting the | |
1347 | previous value and other unpleasantness of the best alternative. */ | |
1348 | static int best_losers, best_overall; | |
55a2c322 VM |
1349 | /* Overall number hard registers used for reloads. For example, on |
1350 | some targets we need 2 general registers to reload DFmode and only | |
1351 | one floating point register. */ | |
1352 | static int best_reload_nregs; | |
1353 | /* Overall number reflecting distances of previous reloading the same | |
1354 | value. The distances are counted from the current BB start. It is | |
1355 | used to improve inheritance chances. */ | |
1356 | static int best_reload_sum; | |
1357 | ||
1358 | /* True if the current insn should have no correspondingly input or | |
1359 | output reloads. */ | |
1360 | static bool no_input_reloads_p, no_output_reloads_p; | |
1361 | ||
1362 | /* True if we swapped the commutative operands in the current | |
1363 | insn. */ | |
1364 | static int curr_swapped; | |
1365 | ||
d9cf932c VM |
1366 | /* if CHECK_ONLY_P is false, arrange for address element *LOC to be a |
1367 | register of class CL. Add any input reloads to list BEFORE. AFTER | |
1368 | is nonnull if *LOC is an automodified value; handle that case by | |
1369 | adding the required output reloads to list AFTER. Return true if | |
1370 | the RTL was changed. | |
1371 | ||
1372 | if CHECK_ONLY_P is true, check that the *LOC is a correct address | |
1373 | register. Return false if the address register is correct. */ | |
55a2c322 | 1374 | static bool |
d9cf932c | 1375 | process_addr_reg (rtx *loc, bool check_only_p, rtx_insn **before, rtx_insn **after, |
cfa434f6 | 1376 | enum reg_class cl) |
55a2c322 VM |
1377 | { |
1378 | int regno; | |
1379 | enum reg_class rclass, new_class; | |
277f65de | 1380 | rtx reg; |
55a2c322 | 1381 | rtx new_reg; |
ef4bddc2 | 1382 | machine_mode mode; |
95921002 | 1383 | bool subreg_p, before_p = false; |
55a2c322 | 1384 | |
95921002 VM |
1385 | subreg_p = GET_CODE (*loc) == SUBREG; |
1386 | if (subreg_p) | |
ada2eb68 JW |
1387 | { |
1388 | reg = SUBREG_REG (*loc); | |
1389 | mode = GET_MODE (reg); | |
1390 | ||
1391 | /* For mode with size bigger than ptr_mode, there unlikely to be "mov" | |
1392 | between two registers with different classes, but there normally will | |
1393 | be "mov" which transfers element of vector register into the general | |
1394 | register, and this normally will be a subreg which should be reloaded | |
1395 | as a whole. This is particularly likely to be triggered when | |
1396 | -fno-split-wide-types specified. */ | |
3c11e1af JW |
1397 | if (!REG_P (reg) |
1398 | || in_class_p (reg, cl, &new_class) | |
cf098191 | 1399 | || known_le (GET_MODE_SIZE (mode), GET_MODE_SIZE (ptr_mode))) |
ada2eb68 JW |
1400 | loc = &SUBREG_REG (*loc); |
1401 | } | |
1402 | ||
277f65de | 1403 | reg = *loc; |
55a2c322 VM |
1404 | mode = GET_MODE (reg); |
1405 | if (! REG_P (reg)) | |
1406 | { | |
d9cf932c VM |
1407 | if (check_only_p) |
1408 | return true; | |
55a2c322 VM |
1409 | /* Always reload memory in an address even if the target supports |
1410 | such addresses. */ | |
1411 | new_reg = lra_create_new_reg_with_unique_value (mode, reg, cl, "address"); | |
1412 | before_p = true; | |
1413 | } | |
1414 | else | |
1415 | { | |
1416 | regno = REGNO (reg); | |
1417 | rclass = get_reg_class (regno); | |
d9cf932c VM |
1418 | if (! check_only_p |
1419 | && (*loc = get_equiv_with_elimination (reg, curr_insn)) != reg) | |
55a2c322 VM |
1420 | { |
1421 | if (lra_dump_file != NULL) | |
1422 | { | |
1423 | fprintf (lra_dump_file, | |
1424 | "Changing pseudo %d in address of insn %u on equiv ", | |
1425 | REGNO (reg), INSN_UID (curr_insn)); | |
cfbeaedf | 1426 | dump_value_slim (lra_dump_file, *loc, 1); |
55a2c322 VM |
1427 | fprintf (lra_dump_file, "\n"); |
1428 | } | |
1429 | *loc = copy_rtx (*loc); | |
1430 | } | |
1431 | if (*loc != reg || ! in_class_p (reg, cl, &new_class)) | |
1432 | { | |
d9cf932c VM |
1433 | if (check_only_p) |
1434 | return true; | |
55a2c322 VM |
1435 | reg = *loc; |
1436 | if (get_reload_reg (after == NULL ? OP_IN : OP_INOUT, | |
95921002 | 1437 | mode, reg, cl, subreg_p, "address", &new_reg)) |
55a2c322 VM |
1438 | before_p = true; |
1439 | } | |
1440 | else if (new_class != NO_REGS && rclass != new_class) | |
1441 | { | |
d9cf932c VM |
1442 | if (check_only_p) |
1443 | return true; | |
a2d0d374 | 1444 | lra_change_class (regno, new_class, " Change to", true); |
55a2c322 VM |
1445 | return false; |
1446 | } | |
1447 | else | |
1448 | return false; | |
1449 | } | |
1450 | if (before_p) | |
1451 | { | |
1452 | push_to_sequence (*before); | |
1453 | lra_emit_move (new_reg, reg); | |
1454 | *before = get_insns (); | |
1455 | end_sequence (); | |
1456 | } | |
1457 | *loc = new_reg; | |
1458 | if (after != NULL) | |
1459 | { | |
1460 | start_sequence (); | |
9a9fe2b4 | 1461 | lra_emit_move (before_p ? copy_rtx (reg) : reg, new_reg); |
55a2c322 VM |
1462 | emit_insn (*after); |
1463 | *after = get_insns (); | |
1464 | end_sequence (); | |
1465 | } | |
1466 | return true; | |
1467 | } | |
1468 | ||
4f0bee4c WM |
1469 | /* Insert move insn in simplify_operand_subreg. BEFORE returns |
1470 | the insn to be inserted before curr insn. AFTER returns the | |
1471 | the insn to be inserted after curr insn. ORIGREG and NEWREG | |
1472 | are the original reg and new reg for reload. */ | |
1473 | static void | |
cfa434f6 DM |
1474 | insert_move_for_subreg (rtx_insn **before, rtx_insn **after, rtx origreg, |
1475 | rtx newreg) | |
4f0bee4c WM |
1476 | { |
1477 | if (before) | |
1478 | { | |
1479 | push_to_sequence (*before); | |
1480 | lra_emit_move (newreg, origreg); | |
1481 | *before = get_insns (); | |
1482 | end_sequence (); | |
1483 | } | |
1484 | if (after) | |
1485 | { | |
1486 | start_sequence (); | |
1487 | lra_emit_move (origreg, newreg); | |
1488 | emit_insn (*after); | |
1489 | *after = get_insns (); | |
1490 | end_sequence (); | |
1491 | } | |
1492 | } | |
1493 | ||
ef4bddc2 | 1494 | static int valid_address_p (machine_mode mode, rtx addr, addr_space_t as); |
ab5d2233 | 1495 | static bool process_address (int, bool, rtx_insn **, rtx_insn **); |
ba38538f | 1496 | |
55a2c322 VM |
1497 | /* Make reloads for subreg in operand NOP with internal subreg mode |
1498 | REG_MODE, add new reloads for further processing. Return true if | |
895ff86f | 1499 | any change was done. */ |
55a2c322 | 1500 | static bool |
ef4bddc2 | 1501 | simplify_operand_subreg (int nop, machine_mode reg_mode) |
55a2c322 VM |
1502 | { |
1503 | int hard_regno; | |
cfa434f6 | 1504 | rtx_insn *before, *after; |
895ff86f | 1505 | machine_mode mode, innermode; |
55a2c322 VM |
1506 | rtx reg, new_reg; |
1507 | rtx operand = *curr_id->operand_loc[nop]; | |
4f0bee4c WM |
1508 | enum reg_class regclass; |
1509 | enum op_type type; | |
55a2c322 | 1510 | |
cfa434f6 | 1511 | before = after = NULL; |
55a2c322 VM |
1512 | |
1513 | if (GET_CODE (operand) != SUBREG) | |
1514 | return false; | |
f4eafc30 | 1515 | |
55a2c322 VM |
1516 | mode = GET_MODE (operand); |
1517 | reg = SUBREG_REG (operand); | |
895ff86f | 1518 | innermode = GET_MODE (reg); |
4f0bee4c | 1519 | type = curr_static_id->operand[nop].type; |
2e186411 | 1520 | if (MEM_P (reg)) |
ba38538f | 1521 | { |
ab5d2233 EB |
1522 | const bool addr_was_valid |
1523 | = valid_address_p (innermode, XEXP (reg, 0), MEM_ADDR_SPACE (reg)); | |
ba38538f | 1524 | alter_subreg (curr_id->operand_loc[nop], false); |
ab5d2233 | 1525 | rtx subst = *curr_id->operand_loc[nop]; |
ba38538f | 1526 | lra_assert (MEM_P (subst)); |
ab5d2233 EB |
1527 | |
1528 | if (!addr_was_valid | |
ba38538f | 1529 | || valid_address_p (GET_MODE (subst), XEXP (subst, 0), |
2e186411 AM |
1530 | MEM_ADDR_SPACE (subst)) |
1531 | || ((get_constraint_type (lookup_constraint | |
1532 | (curr_static_id->operand[nop].constraint)) | |
1533 | != CT_SPECIAL_MEMORY) | |
1534 | /* We still can reload address and if the address is | |
1535 | valid, we can remove subreg without reloading its | |
1536 | inner memory. */ | |
1537 | && valid_address_p (GET_MODE (subst), | |
1538 | regno_reg_rtx | |
1539 | [ira_class_hard_regs | |
1540 | [base_reg_class (GET_MODE (subst), | |
1541 | MEM_ADDR_SPACE (subst), | |
1542 | ADDRESS, SCRATCH)][0]], | |
1543 | MEM_ADDR_SPACE (subst)))) | |
1544 | { | |
ab5d2233 | 1545 | /* If we change the address for a paradoxical subreg of memory, the |
849fccf8 EB |
1546 | new address might violate the necessary alignment or the access |
1547 | might be slow; take this into consideration. We need not worry | |
ab5d2233 | 1548 | about accesses beyond allocated memory for paradoxical memory |
2e186411 AM |
1549 | subregs as we don't substitute such equiv memory (see processing |
1550 | equivalences in function lra_constraints) and because for spilled | |
1551 | pseudos we allocate stack memory enough for the biggest | |
198075e1 MF |
1552 | corresponding paradoxical subreg. |
1553 | ||
1554 | However, do not blindly simplify a (subreg (mem ...)) for | |
1555 | WORD_REGISTER_OPERATIONS targets as this may lead to loading junk | |
1556 | data into a register when the inner is narrower than outer or | |
1557 | missing important data from memory when the inner is wider than | |
1558 | outer. This rule only applies to modes that are no wider than | |
1559 | a word. */ | |
bb94ec76 RS |
1560 | if (!(maybe_ne (GET_MODE_PRECISION (mode), |
1561 | GET_MODE_PRECISION (innermode)) | |
cf098191 RS |
1562 | && known_le (GET_MODE_SIZE (mode), UNITS_PER_WORD) |
1563 | && known_le (GET_MODE_SIZE (innermode), UNITS_PER_WORD) | |
198075e1 MF |
1564 | && WORD_REGISTER_OPERATIONS) |
1565 | && (!(MEM_ALIGN (subst) < GET_MODE_ALIGNMENT (mode) | |
e0bd6c9f | 1566 | && targetm.slow_unaligned_access (mode, MEM_ALIGN (subst))) |
198075e1 | 1567 | || (MEM_ALIGN (reg) < GET_MODE_ALIGNMENT (innermode) |
e0bd6c9f RS |
1568 | && targetm.slow_unaligned_access (innermode, |
1569 | MEM_ALIGN (reg))))) | |
2e186411 AM |
1570 | return true; |
1571 | ||
ab5d2233 EB |
1572 | *curr_id->operand_loc[nop] = operand; |
1573 | ||
1574 | /* But if the address was not valid, we cannot reload the MEM without | |
1575 | reloading the address first. */ | |
1576 | if (!addr_was_valid) | |
1577 | process_address (nop, false, &before, &after); | |
1578 | ||
2e186411 AM |
1579 | /* INNERMODE is fast, MODE slow. Reload the mem in INNERMODE. */ |
1580 | enum reg_class rclass | |
1581 | = (enum reg_class) targetm.preferred_reload_class (reg, ALL_REGS); | |
ab5d2233 EB |
1582 | if (get_reload_reg (curr_static_id->operand[nop].type, innermode, |
1583 | reg, rclass, TRUE, "slow mem", &new_reg)) | |
2e186411 AM |
1584 | { |
1585 | bool insert_before, insert_after; | |
1586 | bitmap_set_bit (&lra_subreg_reload_pseudos, REGNO (new_reg)); | |
1587 | ||
1588 | insert_before = (type != OP_OUT | |
bd4288c0 | 1589 | || partial_subreg_p (mode, innermode)); |
2e186411 AM |
1590 | insert_after = type != OP_IN; |
1591 | insert_move_for_subreg (insert_before ? &before : NULL, | |
1592 | insert_after ? &after : NULL, | |
1593 | reg, new_reg); | |
1594 | } | |
2e186411 AM |
1595 | SUBREG_REG (operand) = new_reg; |
1596 | ||
1597 | /* Convert to MODE. */ | |
1598 | reg = operand; | |
ab5d2233 EB |
1599 | rclass |
1600 | = (enum reg_class) targetm.preferred_reload_class (reg, ALL_REGS); | |
2e186411 AM |
1601 | if (get_reload_reg (curr_static_id->operand[nop].type, mode, reg, |
1602 | rclass, TRUE, "slow mem", &new_reg)) | |
1603 | { | |
1604 | bool insert_before, insert_after; | |
1605 | bitmap_set_bit (&lra_subreg_reload_pseudos, REGNO (new_reg)); | |
1606 | ||
1607 | insert_before = type != OP_OUT; | |
1608 | insert_after = type != OP_IN; | |
1609 | insert_move_for_subreg (insert_before ? &before : NULL, | |
1610 | insert_after ? &after : NULL, | |
1611 | reg, new_reg); | |
1612 | } | |
1613 | *curr_id->operand_loc[nop] = new_reg; | |
1614 | lra_process_new_insns (curr_insn, before, after, | |
1615 | "Inserting slow mem reload"); | |
1616 | return true; | |
1617 | } | |
95831c01 | 1618 | |
ba38538f VM |
1619 | /* If the address was valid and became invalid, prefer to reload |
1620 | the memory. Typical case is when the index scale should | |
1621 | correspond the memory. */ | |
2e186411 | 1622 | *curr_id->operand_loc[nop] = operand; |
77850e96 MF |
1623 | /* Do not return false here as the MEM_P (reg) will be processed |
1624 | later in this function. */ | |
ba38538f VM |
1625 | } |
1626 | else if (REG_P (reg) && REGNO (reg) < FIRST_PSEUDO_REGISTER) | |
55a2c322 VM |
1627 | { |
1628 | alter_subreg (curr_id->operand_loc[nop], false); | |
1629 | return true; | |
1630 | } | |
895ff86f VM |
1631 | else if (CONSTANT_P (reg)) |
1632 | { | |
1633 | /* Try to simplify subreg of constant. It is usually result of | |
1634 | equivalence substitution. */ | |
1635 | if (innermode == VOIDmode | |
1636 | && (innermode = original_subreg_reg_mode[nop]) == VOIDmode) | |
1637 | innermode = curr_static_id->operand[nop].mode; | |
1638 | if ((new_reg = simplify_subreg (mode, reg, innermode, | |
1639 | SUBREG_BYTE (operand))) != NULL_RTX) | |
1640 | { | |
1641 | *curr_id->operand_loc[nop] = new_reg; | |
1642 | return true; | |
1643 | } | |
1644 | } | |
55a2c322 VM |
1645 | /* Put constant into memory when we have mixed modes. It generates |
1646 | a better code in most cases as it does not need a secondary | |
1647 | reload memory. It also prevents LRA looping when LRA is using | |
1648 | secondary reload memory again and again. */ | |
1649 | if (CONSTANT_P (reg) && CONST_POOL_OK_P (reg_mode, reg) | |
1650 | && SCALAR_INT_MODE_P (reg_mode) != SCALAR_INT_MODE_P (mode)) | |
1651 | { | |
1652 | SUBREG_REG (operand) = force_const_mem (reg_mode, reg); | |
1653 | alter_subreg (curr_id->operand_loc[nop], false); | |
1654 | return true; | |
1655 | } | |
1656 | /* Force a reload of the SUBREG_REG if this is a constant or PLUS or | |
1657 | if there may be a problem accessing OPERAND in the outer | |
1658 | mode. */ | |
1659 | if ((REG_P (reg) | |
1660 | && REGNO (reg) >= FIRST_PSEUDO_REGISTER | |
1661 | && (hard_regno = lra_get_regno_hard_regno (REGNO (reg))) >= 0 | |
1662 | /* Don't reload paradoxical subregs because we could be looping | |
1663 | having repeatedly final regno out of hard regs range. */ | |
ad474626 RS |
1664 | && (hard_regno_nregs (hard_regno, innermode) |
1665 | >= hard_regno_nregs (hard_regno, mode)) | |
895ff86f | 1666 | && simplify_subreg_regno (hard_regno, innermode, |
2c62cbaa VM |
1667 | SUBREG_BYTE (operand), mode) < 0 |
1668 | /* Don't reload subreg for matching reload. It is actually | |
1669 | valid subreg in LRA. */ | |
1670 | && ! LRA_SUBREG_P (operand)) | |
55a2c322 VM |
1671 | || CONSTANT_P (reg) || GET_CODE (reg) == PLUS || MEM_P (reg)) |
1672 | { | |
6e23f296 VM |
1673 | enum reg_class rclass; |
1674 | ||
7613fa50 VM |
1675 | if (REG_P (reg)) |
1676 | /* There is a big probability that we will get the same class | |
6e23f296 VM |
1677 | for the new pseudo and we will get the same insn which |
1678 | means infinite looping. So spill the new pseudo. */ | |
1679 | rclass = NO_REGS; | |
1680 | else | |
1681 | /* The class will be defined later in curr_insn_transform. */ | |
1682 | rclass | |
1683 | = (enum reg_class) targetm.preferred_reload_class (reg, ALL_REGS); | |
55a2c322 | 1684 | |
25bb0bb5 | 1685 | if (get_reload_reg (curr_static_id->operand[nop].type, reg_mode, reg, |
95921002 | 1686 | rclass, TRUE, "subreg reg", &new_reg)) |
55a2c322 | 1687 | { |
4f0bee4c | 1688 | bool insert_before, insert_after; |
2b778c9d | 1689 | bitmap_set_bit (&lra_subreg_reload_pseudos, REGNO (new_reg)); |
4f0bee4c WM |
1690 | |
1691 | insert_before = (type != OP_OUT | |
9eaf97d6 | 1692 | || read_modify_subreg_p (operand)); |
4f0bee4c WM |
1693 | insert_after = (type != OP_IN); |
1694 | insert_move_for_subreg (insert_before ? &before : NULL, | |
1695 | insert_after ? &after : NULL, | |
1696 | reg, new_reg); | |
55a2c322 VM |
1697 | } |
1698 | SUBREG_REG (operand) = new_reg; | |
1699 | lra_process_new_insns (curr_insn, before, after, | |
1700 | "Inserting subreg reload"); | |
1701 | return true; | |
1702 | } | |
4f0bee4c WM |
1703 | /* Force a reload for a paradoxical subreg. For paradoxical subreg, |
1704 | IRA allocates hardreg to the inner pseudo reg according to its mode | |
1705 | instead of the outermode, so the size of the hardreg may not be enough | |
1706 | to contain the outermode operand, in that case we may need to insert | |
1707 | reload for the reg. For the following two types of paradoxical subreg, | |
1708 | we need to insert reload: | |
1709 | 1. If the op_type is OP_IN, and the hardreg could not be paired with | |
1710 | other hardreg to contain the outermode operand | |
1711 | (checked by in_hard_reg_set_p), we need to insert the reload. | |
1712 | 2. If the op_type is OP_OUT or OP_INOUT. | |
1713 | ||
1714 | Here is a paradoxical subreg example showing how the reload is generated: | |
1715 | ||
1716 | (insn 5 4 7 2 (set (reg:TI 106 [ __comp ]) | |
1717 | (subreg:TI (reg:DI 107 [ __comp ]) 0)) {*movti_internal_rex64} | |
1718 | ||
1719 | In IRA, reg107 is allocated to a DImode hardreg. We use x86-64 as example | |
1720 | here, if reg107 is assigned to hardreg R15, because R15 is the last | |
1721 | hardreg, compiler cannot find another hardreg to pair with R15 to | |
1722 | contain TImode data. So we insert a TImode reload reg180 for it. | |
1723 | After reload is inserted: | |
1724 | ||
1725 | (insn 283 0 0 (set (subreg:DI (reg:TI 180 [orig:107 __comp ] [107]) 0) | |
1726 | (reg:DI 107 [ __comp ])) -1 | |
1727 | (insn 5 4 7 2 (set (reg:TI 106 [ __comp ]) | |
1728 | (subreg:TI (reg:TI 180 [orig:107 __comp ] [107]) 0)) {*movti_internal_rex64} | |
1729 | ||
1730 | Two reload hard registers will be allocated to reg180 to save TImode data | |
1731 | in LRA_assign. */ | |
1732 | else if (REG_P (reg) | |
1733 | && REGNO (reg) >= FIRST_PSEUDO_REGISTER | |
1734 | && (hard_regno = lra_get_regno_hard_regno (REGNO (reg))) >= 0 | |
ad474626 RS |
1735 | && (hard_regno_nregs (hard_regno, innermode) |
1736 | < hard_regno_nregs (hard_regno, mode)) | |
4f0bee4c WM |
1737 | && (regclass = lra_get_allocno_class (REGNO (reg))) |
1738 | && (type != OP_IN | |
1739 | || !in_hard_reg_set_p (reg_class_contents[regclass], | |
1740 | mode, hard_regno))) | |
1741 | { | |
1742 | /* The class will be defined later in curr_insn_transform. */ | |
1743 | enum reg_class rclass | |
1744 | = (enum reg_class) targetm.preferred_reload_class (reg, ALL_REGS); | |
1745 | ||
1746 | if (get_reload_reg (curr_static_id->operand[nop].type, mode, reg, | |
95921002 | 1747 | rclass, TRUE, "paradoxical subreg", &new_reg)) |
4f0bee4c WM |
1748 | { |
1749 | rtx subreg; | |
1750 | bool insert_before, insert_after; | |
1751 | ||
1752 | PUT_MODE (new_reg, mode); | |
ea09f50d | 1753 | subreg = gen_lowpart_SUBREG (innermode, new_reg); |
4f0bee4c WM |
1754 | bitmap_set_bit (&lra_subreg_reload_pseudos, REGNO (new_reg)); |
1755 | ||
1756 | insert_before = (type != OP_OUT); | |
1757 | insert_after = (type != OP_IN); | |
1758 | insert_move_for_subreg (insert_before ? &before : NULL, | |
1759 | insert_after ? &after : NULL, | |
1760 | reg, subreg); | |
1761 | } | |
1762 | SUBREG_REG (operand) = new_reg; | |
1763 | lra_process_new_insns (curr_insn, before, after, | |
1764 | "Inserting paradoxical subreg reload"); | |
1765 | return true; | |
1766 | } | |
55a2c322 VM |
1767 | return false; |
1768 | } | |
1769 | ||
1770 | /* Return TRUE if X refers for a hard register from SET. */ | |
1771 | static bool | |
1772 | uses_hard_regs_p (rtx x, HARD_REG_SET set) | |
1773 | { | |
1774 | int i, j, x_hard_regno; | |
ef4bddc2 | 1775 | machine_mode mode; |
55a2c322 VM |
1776 | const char *fmt; |
1777 | enum rtx_code code; | |
1778 | ||
1779 | if (x == NULL_RTX) | |
1780 | return false; | |
1781 | code = GET_CODE (x); | |
1782 | mode = GET_MODE (x); | |
1783 | if (code == SUBREG) | |
1784 | { | |
bd5a2c67 | 1785 | mode = wider_subreg_mode (x); |
55a2c322 VM |
1786 | x = SUBREG_REG (x); |
1787 | code = GET_CODE (x); | |
55a2c322 | 1788 | } |
f4eafc30 | 1789 | |
55a2c322 VM |
1790 | if (REG_P (x)) |
1791 | { | |
1686923c | 1792 | x_hard_regno = get_hard_regno (x, true); |
55a2c322 VM |
1793 | return (x_hard_regno >= 0 |
1794 | && overlaps_hard_reg_set_p (set, mode, x_hard_regno)); | |
1795 | } | |
1796 | if (MEM_P (x)) | |
1797 | { | |
277f65de | 1798 | struct address_info ad; |
55a2c322 | 1799 | |
277f65de RS |
1800 | decompose_mem_address (&ad, x); |
1801 | if (ad.base_term != NULL && uses_hard_regs_p (*ad.base_term, set)) | |
1802 | return true; | |
1803 | if (ad.index_term != NULL && uses_hard_regs_p (*ad.index_term, set)) | |
1804 | return true; | |
55a2c322 VM |
1805 | } |
1806 | fmt = GET_RTX_FORMAT (code); | |
1807 | for (i = GET_RTX_LENGTH (code) - 1; i >= 0; i--) | |
1808 | { | |
1809 | if (fmt[i] == 'e') | |
1810 | { | |
1811 | if (uses_hard_regs_p (XEXP (x, i), set)) | |
1812 | return true; | |
1813 | } | |
1814 | else if (fmt[i] == 'E') | |
1815 | { | |
1816 | for (j = XVECLEN (x, i) - 1; j >= 0; j--) | |
1817 | if (uses_hard_regs_p (XVECEXP (x, i, j), set)) | |
1818 | return true; | |
1819 | } | |
1820 | } | |
1821 | return false; | |
1822 | } | |
1823 | ||
1824 | /* Return true if OP is a spilled pseudo. */ | |
1825 | static inline bool | |
1826 | spilled_pseudo_p (rtx op) | |
1827 | { | |
1828 | return (REG_P (op) | |
1829 | && REGNO (op) >= FIRST_PSEUDO_REGISTER && in_mem_p (REGNO (op))); | |
1830 | } | |
1831 | ||
1832 | /* Return true if X is a general constant. */ | |
1833 | static inline bool | |
1834 | general_constant_p (rtx x) | |
1835 | { | |
1836 | return CONSTANT_P (x) && (! flag_pic || LEGITIMATE_PIC_OPERAND_P (x)); | |
1837 | } | |
1838 | ||
2c62cbaa VM |
1839 | static bool |
1840 | reg_in_class_p (rtx reg, enum reg_class cl) | |
1841 | { | |
1842 | if (cl == NO_REGS) | |
1843 | return get_reg_class (REGNO (reg)) == NO_REGS; | |
1844 | return in_class_p (reg, cl, NULL); | |
1845 | } | |
1846 | ||
3c954213 VM |
1847 | /* Return true if SET of RCLASS contains no hard regs which can be |
1848 | used in MODE. */ | |
1849 | static bool | |
1850 | prohibited_class_reg_set_mode_p (enum reg_class rclass, | |
1851 | HARD_REG_SET &set, | |
b8506a8a | 1852 | machine_mode mode) |
3c954213 VM |
1853 | { |
1854 | HARD_REG_SET temp; | |
1855 | ||
c07ad89a | 1856 | lra_assert (hard_reg_set_subset_p (reg_class_contents[rclass], set)); |
3c954213 VM |
1857 | COPY_HARD_REG_SET (temp, set); |
1858 | AND_COMPL_HARD_REG_SET (temp, lra_no_alloc_regs); | |
1859 | return (hard_reg_set_subset_p | |
1860 | (temp, ira_prohibited_class_mode_regs[rclass][mode])); | |
1861 | } | |
1862 | ||
9b195552 VM |
1863 | |
1864 | /* Used to check validity info about small class input operands. It | |
1865 | should be incremented at start of processing an insn | |
1866 | alternative. */ | |
1867 | static unsigned int curr_small_class_check = 0; | |
1868 | ||
1869 | /* Update number of used inputs of class OP_CLASS for operand NOP. | |
1870 | Return true if we have more such class operands than the number of | |
1871 | available regs. */ | |
1872 | static bool | |
1873 | update_and_check_small_class_inputs (int nop, enum reg_class op_class) | |
1874 | { | |
1875 | static unsigned int small_class_check[LIM_REG_CLASSES]; | |
1876 | static int small_class_input_nums[LIM_REG_CLASSES]; | |
1877 | ||
1878 | if (SMALL_REGISTER_CLASS_P (op_class) | |
1879 | /* We are interesting in classes became small because of fixing | |
1880 | some hard regs, e.g. by an user through GCC options. */ | |
1881 | && hard_reg_set_intersect_p (reg_class_contents[op_class], | |
1882 | ira_no_alloc_regs) | |
1883 | && (curr_static_id->operand[nop].type != OP_OUT | |
1884 | || curr_static_id->operand[nop].early_clobber)) | |
1885 | { | |
1886 | if (small_class_check[op_class] == curr_small_class_check) | |
1887 | small_class_input_nums[op_class]++; | |
1888 | else | |
1889 | { | |
1890 | small_class_check[op_class] = curr_small_class_check; | |
1891 | small_class_input_nums[op_class] = 1; | |
1892 | } | |
1893 | if (small_class_input_nums[op_class] > ira_class_hard_regs_num[op_class]) | |
1894 | return true; | |
1895 | } | |
1896 | return false; | |
1897 | } | |
1898 | ||
55a2c322 VM |
1899 | /* Major function to choose the current insn alternative and what |
1900 | operands should be reloaded and how. If ONLY_ALTERNATIVE is not | |
1901 | negative we should consider only this alternative. Return false if | |
1902 | we can not choose the alternative or find how to reload the | |
1903 | operands. */ | |
1904 | static bool | |
1905 | process_alt_operands (int only_alternative) | |
1906 | { | |
1907 | bool ok_p = false; | |
36ff9dfb | 1908 | int nop, overall, nalt; |
55a2c322 VM |
1909 | int n_alternatives = curr_static_id->n_alternatives; |
1910 | int n_operands = curr_static_id->n_operands; | |
1911 | /* LOSERS counts the operands that don't fit this alternative and | |
1912 | would require loading. */ | |
1913 | int losers; | |
feca7b89 | 1914 | int addr_losers; |
55a2c322 VM |
1915 | /* REJECT is a count of how undesirable this alternative says it is |
1916 | if any reloading is required. If the alternative matches exactly | |
1917 | then REJECT is ignored, but otherwise it gets this much counted | |
1918 | against it in addition to the reloading needed. */ | |
1919 | int reject; | |
feca7b89 VM |
1920 | /* This is defined by '!' or '?' alternative constraint and added to |
1921 | reject. But in some cases it can be ignored. */ | |
1922 | int static_reject; | |
d1457701 | 1923 | int op_reject; |
55a2c322 VM |
1924 | /* The number of elements in the following array. */ |
1925 | int early_clobbered_regs_num; | |
1926 | /* Numbers of operands which are early clobber registers. */ | |
1927 | int early_clobbered_nops[MAX_RECOG_OPERANDS]; | |
1928 | enum reg_class curr_alt[MAX_RECOG_OPERANDS]; | |
1929 | HARD_REG_SET curr_alt_set[MAX_RECOG_OPERANDS]; | |
1930 | bool curr_alt_match_win[MAX_RECOG_OPERANDS]; | |
1931 | bool curr_alt_win[MAX_RECOG_OPERANDS]; | |
1932 | bool curr_alt_offmemok[MAX_RECOG_OPERANDS]; | |
1933 | int curr_alt_matches[MAX_RECOG_OPERANDS]; | |
1934 | /* The number of elements in the following array. */ | |
1935 | int curr_alt_dont_inherit_ops_num; | |
1936 | /* Numbers of operands whose reload pseudos should not be inherited. */ | |
1937 | int curr_alt_dont_inherit_ops[MAX_RECOG_OPERANDS]; | |
1938 | rtx op; | |
1939 | /* The register when the operand is a subreg of register, otherwise the | |
1940 | operand itself. */ | |
1941 | rtx no_subreg_reg_operand[MAX_RECOG_OPERANDS]; | |
1942 | /* The register if the operand is a register or subreg of register, | |
1943 | otherwise NULL. */ | |
1944 | rtx operand_reg[MAX_RECOG_OPERANDS]; | |
1945 | int hard_regno[MAX_RECOG_OPERANDS]; | |
ef4bddc2 | 1946 | machine_mode biggest_mode[MAX_RECOG_OPERANDS]; |
55a2c322 VM |
1947 | int reload_nregs, reload_sum; |
1948 | bool costly_p; | |
1949 | enum reg_class cl; | |
1950 | ||
1951 | /* Calculate some data common for all alternatives to speed up the | |
1952 | function. */ | |
1953 | for (nop = 0; nop < n_operands; nop++) | |
1954 | { | |
7214306b VM |
1955 | rtx reg; |
1956 | ||
55a2c322 VM |
1957 | op = no_subreg_reg_operand[nop] = *curr_id->operand_loc[nop]; |
1958 | /* The real hard regno of the operand after the allocation. */ | |
1686923c | 1959 | hard_regno[nop] = get_hard_regno (op, true); |
f4eafc30 | 1960 | |
7214306b VM |
1961 | operand_reg[nop] = reg = op; |
1962 | biggest_mode[nop] = GET_MODE (op); | |
1963 | if (GET_CODE (op) == SUBREG) | |
55a2c322 | 1964 | { |
bd5a2c67 | 1965 | biggest_mode[nop] = wider_subreg_mode (op); |
7214306b | 1966 | operand_reg[nop] = reg = SUBREG_REG (op); |
55a2c322 | 1967 | } |
7214306b | 1968 | if (! REG_P (reg)) |
55a2c322 | 1969 | operand_reg[nop] = NULL_RTX; |
7214306b VM |
1970 | else if (REGNO (reg) >= FIRST_PSEUDO_REGISTER |
1971 | || ((int) REGNO (reg) | |
1972 | == lra_get_elimination_hard_regno (REGNO (reg)))) | |
1973 | no_subreg_reg_operand[nop] = reg; | |
1974 | else | |
1975 | operand_reg[nop] = no_subreg_reg_operand[nop] | |
1976 | /* Just use natural mode for elimination result. It should | |
1977 | be enough for extra constraints hooks. */ | |
1978 | = regno_reg_rtx[hard_regno[nop]]; | |
55a2c322 VM |
1979 | } |
1980 | ||
1981 | /* The constraints are made of several alternatives. Each operand's | |
1982 | constraint looks like foo,bar,... with commas separating the | |
1983 | alternatives. The first alternatives for all operands go | |
1984 | together, the second alternatives go together, etc. | |
1985 | ||
1986 | First loop over alternatives. */ | |
9840b2fa | 1987 | alternative_mask preferred = curr_id->preferred_alternatives; |
4cc8d9d2 | 1988 | if (only_alternative >= 0) |
9840b2fa | 1989 | preferred &= ALTERNATIVE_BIT (only_alternative); |
4cc8d9d2 | 1990 | |
55a2c322 VM |
1991 | for (nalt = 0; nalt < n_alternatives; nalt++) |
1992 | { | |
1993 | /* Loop over operands for one constraint alternative. */ | |
9840b2fa | 1994 | if (!TEST_BIT (preferred, nalt)) |
55a2c322 VM |
1995 | continue; |
1996 | ||
9b195552 | 1997 | curr_small_class_check++; |
feca7b89 VM |
1998 | overall = losers = addr_losers = 0; |
1999 | static_reject = reject = reload_nregs = reload_sum = 0; | |
55a2c322 | 2000 | for (nop = 0; nop < n_operands; nop++) |
cb1cca12 VM |
2001 | { |
2002 | int inc = (curr_static_id | |
2003 | ->operand_alternative[nalt * n_operands + nop].reject); | |
2004 | if (lra_dump_file != NULL && inc != 0) | |
2005 | fprintf (lra_dump_file, | |
2006 | " Staticly defined alt reject+=%d\n", inc); | |
feca7b89 | 2007 | static_reject += inc; |
cb1cca12 | 2008 | } |
feca7b89 | 2009 | reject += static_reject; |
55a2c322 VM |
2010 | early_clobbered_regs_num = 0; |
2011 | ||
2012 | for (nop = 0; nop < n_operands; nop++) | |
2013 | { | |
2014 | const char *p; | |
2015 | char *end; | |
2016 | int len, c, m, i, opalt_num, this_alternative_matches; | |
2017 | bool win, did_match, offmemok, early_clobber_p; | |
2018 | /* false => this operand can be reloaded somehow for this | |
2019 | alternative. */ | |
2020 | bool badop; | |
2021 | /* true => this operand can be reloaded if the alternative | |
2022 | allows regs. */ | |
2023 | bool winreg; | |
2024 | /* True if a constant forced into memory would be OK for | |
2025 | this operand. */ | |
2026 | bool constmemok; | |
2027 | enum reg_class this_alternative, this_costly_alternative; | |
2028 | HARD_REG_SET this_alternative_set, this_costly_alternative_set; | |
2029 | bool this_alternative_match_win, this_alternative_win; | |
2030 | bool this_alternative_offmemok; | |
80f466c4 | 2031 | bool scratch_p; |
ef4bddc2 | 2032 | machine_mode mode; |
777e635f | 2033 | enum constraint_num cn; |
55a2c322 VM |
2034 | |
2035 | opalt_num = nalt * n_operands + nop; | |
2036 | if (curr_static_id->operand_alternative[opalt_num].anything_ok) | |
2037 | { | |
2038 | /* Fast track for no constraints at all. */ | |
2039 | curr_alt[nop] = NO_REGS; | |
2040 | CLEAR_HARD_REG_SET (curr_alt_set[nop]); | |
2041 | curr_alt_win[nop] = true; | |
2042 | curr_alt_match_win[nop] = false; | |
2043 | curr_alt_offmemok[nop] = false; | |
2044 | curr_alt_matches[nop] = -1; | |
2045 | continue; | |
2046 | } | |
f4eafc30 | 2047 | |
55a2c322 VM |
2048 | op = no_subreg_reg_operand[nop]; |
2049 | mode = curr_operand_mode[nop]; | |
2050 | ||
2051 | win = did_match = winreg = offmemok = constmemok = false; | |
2052 | badop = true; | |
f4eafc30 | 2053 | |
55a2c322 VM |
2054 | early_clobber_p = false; |
2055 | p = curr_static_id->operand_alternative[opalt_num].constraint; | |
f4eafc30 | 2056 | |
55a2c322 VM |
2057 | this_costly_alternative = this_alternative = NO_REGS; |
2058 | /* We update set of possible hard regs besides its class | |
2059 | because reg class might be inaccurate. For example, | |
2060 | union of LO_REGS (l), HI_REGS(h), and STACK_REG(k) in ARM | |
2061 | is translated in HI_REGS because classes are merged by | |
2062 | pairs and there is no accurate intermediate class. */ | |
2063 | CLEAR_HARD_REG_SET (this_alternative_set); | |
2064 | CLEAR_HARD_REG_SET (this_costly_alternative_set); | |
2065 | this_alternative_win = false; | |
2066 | this_alternative_match_win = false; | |
2067 | this_alternative_offmemok = false; | |
2068 | this_alternative_matches = -1; | |
f4eafc30 | 2069 | |
55a2c322 VM |
2070 | /* An empty constraint should be excluded by the fast |
2071 | track. */ | |
2072 | lra_assert (*p != 0 && *p != ','); | |
f4eafc30 | 2073 | |
d1457701 | 2074 | op_reject = 0; |
55a2c322 VM |
2075 | /* Scan this alternative's specs for this operand; set WIN |
2076 | if the operand fits any letter in this alternative. | |
2077 | Otherwise, clear BADOP if this operand could fit some | |
2078 | letter after reloads, or set WINREG if this operand could | |
2079 | fit after reloads provided the constraint allows some | |
2080 | registers. */ | |
2081 | costly_p = false; | |
2082 | do | |
2083 | { | |
2084 | switch ((c = *p, len = CONSTRAINT_LEN (c, p)), c) | |
2085 | { | |
2086 | case '\0': | |
2087 | len = 0; | |
2088 | break; | |
2089 | case ',': | |
2090 | c = '\0'; | |
2091 | break; | |
f4eafc30 | 2092 | |
55a2c322 VM |
2093 | case '&': |
2094 | early_clobber_p = true; | |
2095 | break; | |
f4eafc30 | 2096 | |
d1457701 VM |
2097 | case '$': |
2098 | op_reject += LRA_MAX_REJECT; | |
2099 | break; | |
2100 | case '^': | |
2101 | op_reject += LRA_LOSER_COST_FACTOR; | |
2102 | break; | |
2103 | ||
55a2c322 VM |
2104 | case '#': |
2105 | /* Ignore rest of this alternative. */ | |
2106 | c = '\0'; | |
2107 | break; | |
f4eafc30 | 2108 | |
55a2c322 VM |
2109 | case '0': case '1': case '2': case '3': case '4': |
2110 | case '5': case '6': case '7': case '8': case '9': | |
2111 | { | |
2112 | int m_hregno; | |
2113 | bool match_p; | |
f4eafc30 | 2114 | |
55a2c322 VM |
2115 | m = strtoul (p, &end, 10); |
2116 | p = end; | |
2117 | len = 0; | |
2118 | lra_assert (nop > m); | |
f4eafc30 | 2119 | |
00224b1a RS |
2120 | /* Reject matches if we don't know which operand is |
2121 | bigger. This situation would arguably be a bug in | |
2122 | an .md pattern, but could also occur in a user asm. */ | |
2123 | if (!ordered_p (GET_MODE_SIZE (biggest_mode[m]), | |
2124 | GET_MODE_SIZE (biggest_mode[nop]))) | |
2125 | break; | |
2126 | ||
55a2c322 | 2127 | this_alternative_matches = m; |
1686923c | 2128 | m_hregno = get_hard_regno (*curr_id->operand_loc[m], false); |
55a2c322 VM |
2129 | /* We are supposed to match a previous operand. |
2130 | If we do, we win if that one did. If we do | |
2131 | not, count both of the operands as losers. | |
2132 | (This is too conservative, since most of the | |
2133 | time only a single reload insn will be needed | |
2134 | to make the two operands win. As a result, | |
2135 | this alternative may be rejected when it is | |
2136 | actually desirable.) */ | |
2137 | match_p = false; | |
2138 | if (operands_match_p (*curr_id->operand_loc[nop], | |
2139 | *curr_id->operand_loc[m], m_hregno)) | |
2140 | { | |
2141 | /* We should reject matching of an early | |
2142 | clobber operand if the matching operand is | |
2143 | not dying in the insn. */ | |
2144 | if (! curr_static_id->operand[m].early_clobber | |
2145 | || operand_reg[nop] == NULL_RTX | |
2146 | || (find_regno_note (curr_insn, REG_DEAD, | |
1c86bd80 VM |
2147 | REGNO (op)) |
2148 | || REGNO (op) == REGNO (operand_reg[m]))) | |
55a2c322 VM |
2149 | match_p = true; |
2150 | } | |
2151 | if (match_p) | |
2152 | { | |
2153 | /* If we are matching a non-offsettable | |
2154 | address where an offsettable address was | |
2155 | expected, then we must reject this | |
2156 | combination, because we can't reload | |
2157 | it. */ | |
2158 | if (curr_alt_offmemok[m] | |
2159 | && MEM_P (*curr_id->operand_loc[m]) | |
2160 | && curr_alt[m] == NO_REGS && ! curr_alt_win[m]) | |
2161 | continue; | |
55a2c322 VM |
2162 | } |
2163 | else | |
2164 | { | |
2165 | /* Operands don't match. Both operands must | |
2166 | allow a reload register, otherwise we | |
2167 | cannot make them match. */ | |
2168 | if (curr_alt[m] == NO_REGS) | |
2169 | break; | |
2170 | /* Retroactively mark the operand we had to | |
2171 | match as a loser, if it wasn't already and | |
2172 | it wasn't matched to a register constraint | |
2173 | (e.g it might be matched by memory). */ | |
2174 | if (curr_alt_win[m] | |
2175 | && (operand_reg[m] == NULL_RTX | |
2176 | || hard_regno[m] < 0)) | |
2177 | { | |
2178 | losers++; | |
2179 | reload_nregs | |
2180 | += (ira_reg_class_max_nregs[curr_alt[m]] | |
2181 | [GET_MODE (*curr_id->operand_loc[m])]); | |
2182 | } | |
f4eafc30 | 2183 | |
f4581282 VM |
2184 | /* Prefer matching earlyclobber alternative as |
2185 | it results in less hard regs required for | |
2186 | the insn than a non-matching earlyclobber | |
2187 | alternative. */ | |
2188 | if (curr_static_id->operand[m].early_clobber) | |
2189 | { | |
2190 | if (lra_dump_file != NULL) | |
2191 | fprintf | |
2192 | (lra_dump_file, | |
2193 | " %d Matching earlyclobber alt:" | |
2194 | " reject--\n", | |
2195 | nop); | |
2196 | reject--; | |
2197 | } | |
2198 | /* Otherwise we prefer no matching | |
2199 | alternatives because it gives more freedom | |
2200 | in RA. */ | |
2201 | else if (operand_reg[nop] == NULL_RTX | |
2202 | || (find_regno_note (curr_insn, REG_DEAD, | |
2203 | REGNO (operand_reg[nop])) | |
2204 | == NULL_RTX)) | |
cb1cca12 VM |
2205 | { |
2206 | if (lra_dump_file != NULL) | |
2207 | fprintf | |
2208 | (lra_dump_file, | |
2209 | " %d Matching alt: reject+=2\n", | |
2210 | nop); | |
2211 | reject += 2; | |
2212 | } | |
55a2c322 VM |
2213 | } |
2214 | /* If we have to reload this operand and some | |
2215 | previous operand also had to match the same | |
2216 | thing as this operand, we don't know how to do | |
2217 | that. */ | |
2218 | if (!match_p || !curr_alt_win[m]) | |
2219 | { | |
2220 | for (i = 0; i < nop; i++) | |
2221 | if (curr_alt_matches[i] == m) | |
2222 | break; | |
2223 | if (i < nop) | |
2224 | break; | |
2225 | } | |
2226 | else | |
2227 | did_match = true; | |
f4eafc30 | 2228 | |
55a2c322 VM |
2229 | /* This can be fixed with reloads if the operand |
2230 | we are supposed to match can be fixed with | |
2231 | reloads. */ | |
2232 | badop = false; | |
2233 | this_alternative = curr_alt[m]; | |
2234 | COPY_HARD_REG_SET (this_alternative_set, curr_alt_set[m]); | |
821b7577 | 2235 | winreg = this_alternative != NO_REGS; |
55a2c322 VM |
2236 | break; |
2237 | } | |
f4eafc30 | 2238 | |
55a2c322 VM |
2239 | case 'g': |
2240 | if (MEM_P (op) | |
2241 | || general_constant_p (op) | |
2242 | || spilled_pseudo_p (op)) | |
2243 | win = true; | |
777e635f | 2244 | cl = GENERAL_REGS; |
55a2c322 | 2245 | goto reg; |
f4eafc30 | 2246 | |
55a2c322 | 2247 | default: |
777e635f RS |
2248 | cn = lookup_constraint (p); |
2249 | switch (get_constraint_type (cn)) | |
55a2c322 | 2250 | { |
777e635f RS |
2251 | case CT_REGISTER: |
2252 | cl = reg_class_for_constraint (cn); | |
2253 | if (cl != NO_REGS) | |
2254 | goto reg; | |
2255 | break; | |
f4eafc30 | 2256 | |
d9c35eee RS |
2257 | case CT_CONST_INT: |
2258 | if (CONST_INT_P (op) | |
2259 | && insn_const_int_ok_for_constraint (INTVAL (op), cn)) | |
2260 | win = true; | |
2261 | break; | |
2262 | ||
777e635f RS |
2263 | case CT_MEMORY: |
2264 | if (MEM_P (op) | |
2265 | && satisfies_memory_constraint_p (op, cn)) | |
2266 | win = true; | |
2267 | else if (spilled_pseudo_p (op)) | |
2268 | win = true; | |
2269 | ||
2270 | /* If we didn't already win, we can reload constants | |
2271 | via force_const_mem or put the pseudo value into | |
2272 | memory, or make other memory by reloading the | |
2273 | address like for 'o'. */ | |
2274 | if (CONST_POOL_OK_P (mode, op) | |
987b67f1 VM |
2275 | || MEM_P (op) || REG_P (op) |
2276 | /* We can restore the equiv insn by a | |
2277 | reload. */ | |
2278 | || equiv_substition_p[nop]) | |
777e635f RS |
2279 | badop = false; |
2280 | constmemok = true; | |
2281 | offmemok = true; | |
2282 | break; | |
2283 | ||
2284 | case CT_ADDRESS: | |
2285 | /* If we didn't already win, we can reload the address | |
2286 | into a base register. */ | |
2287 | if (satisfies_address_constraint_p (op, cn)) | |
2288 | win = true; | |
2289 | cl = base_reg_class (VOIDmode, ADDR_SPACE_GENERIC, | |
2290 | ADDRESS, SCRATCH); | |
2291 | badop = false; | |
2292 | goto reg; | |
2293 | ||
2294 | case CT_FIXED_FORM: | |
2295 | if (constraint_satisfied_p (op, cn)) | |
55a2c322 | 2296 | win = true; |
55a2c322 | 2297 | break; |
9eb1ca69 VM |
2298 | |
2299 | case CT_SPECIAL_MEMORY: | |
2300 | if (MEM_P (op) | |
2301 | && satisfies_memory_constraint_p (op, cn)) | |
2302 | win = true; | |
2303 | else if (spilled_pseudo_p (op)) | |
2304 | win = true; | |
2305 | break; | |
55a2c322 | 2306 | } |
777e635f | 2307 | break; |
f4eafc30 | 2308 | |
777e635f | 2309 | reg: |
55a2c322 VM |
2310 | this_alternative = reg_class_subunion[this_alternative][cl]; |
2311 | IOR_HARD_REG_SET (this_alternative_set, | |
2312 | reg_class_contents[cl]); | |
2313 | if (costly_p) | |
2314 | { | |
2315 | this_costly_alternative | |
2316 | = reg_class_subunion[this_costly_alternative][cl]; | |
2317 | IOR_HARD_REG_SET (this_costly_alternative_set, | |
2318 | reg_class_contents[cl]); | |
2319 | } | |
55a2c322 VM |
2320 | if (mode == BLKmode) |
2321 | break; | |
2322 | winreg = true; | |
2323 | if (REG_P (op)) | |
2324 | { | |
2325 | if (hard_regno[nop] >= 0 | |
2326 | && in_hard_reg_set_p (this_alternative_set, | |
2327 | mode, hard_regno[nop])) | |
2328 | win = true; | |
2329 | else if (hard_regno[nop] < 0 | |
2330 | && in_class_p (op, this_alternative, NULL)) | |
2331 | win = true; | |
2332 | } | |
2333 | break; | |
2334 | } | |
2335 | if (c != ' ' && c != '\t') | |
2336 | costly_p = c == '*'; | |
2337 | } | |
2338 | while ((p += len), c); | |
f4eafc30 | 2339 | |
80f466c4 VM |
2340 | scratch_p = (operand_reg[nop] != NULL_RTX |
2341 | && lra_former_scratch_p (REGNO (operand_reg[nop]))); | |
55a2c322 VM |
2342 | /* Record which operands fit this alternative. */ |
2343 | if (win) | |
2344 | { | |
2345 | this_alternative_win = true; | |
2346 | if (operand_reg[nop] != NULL_RTX) | |
2347 | { | |
2348 | if (hard_regno[nop] >= 0) | |
2349 | { | |
2350 | if (in_hard_reg_set_p (this_costly_alternative_set, | |
2351 | mode, hard_regno[nop])) | |
cb1cca12 VM |
2352 | { |
2353 | if (lra_dump_file != NULL) | |
2354 | fprintf (lra_dump_file, | |
2355 | " %d Costly set: reject++\n", | |
2356 | nop); | |
2357 | reject++; | |
2358 | } | |
55a2c322 VM |
2359 | } |
2360 | else | |
2361 | { | |
80f466c4 VM |
2362 | /* Prefer won reg to spilled pseudo under other |
2363 | equal conditions for possibe inheritance. */ | |
2364 | if (! scratch_p) | |
2365 | { | |
2366 | if (lra_dump_file != NULL) | |
2367 | fprintf | |
2368 | (lra_dump_file, | |
2369 | " %d Non pseudo reload: reject++\n", | |
2370 | nop); | |
2371 | reject++; | |
2372 | } | |
55a2c322 VM |
2373 | if (in_class_p (operand_reg[nop], |
2374 | this_costly_alternative, NULL)) | |
cb1cca12 VM |
2375 | { |
2376 | if (lra_dump_file != NULL) | |
2377 | fprintf | |
2378 | (lra_dump_file, | |
2379 | " %d Non pseudo costly reload:" | |
2380 | " reject++\n", | |
2381 | nop); | |
2382 | reject++; | |
2383 | } | |
55a2c322 | 2384 | } |
9c582551 | 2385 | /* We simulate the behavior of old reload here. |
55a2c322 VM |
2386 | Although scratches need hard registers and it |
2387 | might result in spilling other pseudos, no reload | |
2388 | insns are generated for the scratches. So it | |
2389 | might cost something but probably less than old | |
2390 | reload pass believes. */ | |
80f466c4 | 2391 | if (scratch_p) |
cb1cca12 VM |
2392 | { |
2393 | if (lra_dump_file != NULL) | |
2394 | fprintf (lra_dump_file, | |
80f466c4 | 2395 | " %d Scratch win: reject+=2\n", |
cb1cca12 | 2396 | nop); |
80f466c4 | 2397 | reject += 2; |
cb1cca12 | 2398 | } |
55a2c322 VM |
2399 | } |
2400 | } | |
2401 | else if (did_match) | |
2402 | this_alternative_match_win = true; | |
2403 | else | |
2404 | { | |
2405 | int const_to_mem = 0; | |
2406 | bool no_regs_p; | |
2407 | ||
d1457701 | 2408 | reject += op_reject; |
8d49e7ef VM |
2409 | /* Never do output reload of stack pointer. It makes |
2410 | impossible to do elimination when SP is changed in | |
2411 | RTL. */ | |
2412 | if (op == stack_pointer_rtx && ! frame_pointer_needed | |
2413 | && curr_static_id->operand[nop].type != OP_IN) | |
2414 | goto fail; | |
2415 | ||
e86c0101 SB |
2416 | /* If this alternative asks for a specific reg class, see if there |
2417 | is at least one allocatable register in that class. */ | |
55a2c322 VM |
2418 | no_regs_p |
2419 | = (this_alternative == NO_REGS | |
2420 | || (hard_reg_set_subset_p | |
2421 | (reg_class_contents[this_alternative], | |
2422 | lra_no_alloc_regs))); | |
e86c0101 SB |
2423 | |
2424 | /* For asms, verify that the class for this alternative is possible | |
2425 | for the mode that is specified. */ | |
ecee672b | 2426 | if (!no_regs_p && INSN_CODE (curr_insn) < 0) |
e86c0101 SB |
2427 | { |
2428 | int i; | |
2429 | for (i = 0; i < FIRST_PSEUDO_REGISTER; i++) | |
f939c3e6 | 2430 | if (targetm.hard_regno_mode_ok (i, mode) |
8f21260c VM |
2431 | && in_hard_reg_set_p (reg_class_contents[this_alternative], |
2432 | mode, i)) | |
e86c0101 SB |
2433 | break; |
2434 | if (i == FIRST_PSEUDO_REGISTER) | |
2435 | winreg = false; | |
2436 | } | |
2437 | ||
55a2c322 VM |
2438 | /* If this operand accepts a register, and if the |
2439 | register class has at least one allocatable register, | |
2440 | then this operand can be reloaded. */ | |
2441 | if (winreg && !no_regs_p) | |
2442 | badop = false; | |
f4eafc30 | 2443 | |
55a2c322 | 2444 | if (badop) |
8f21260c VM |
2445 | { |
2446 | if (lra_dump_file != NULL) | |
2447 | fprintf (lra_dump_file, | |
2448 | " alt=%d: Bad operand -- refuse\n", | |
2449 | nalt); | |
2450 | goto fail; | |
2451 | } | |
55a2c322 | 2452 | |
d13835b6 VM |
2453 | if (this_alternative != NO_REGS) |
2454 | { | |
2455 | HARD_REG_SET available_regs; | |
2456 | ||
2457 | COPY_HARD_REG_SET (available_regs, | |
2458 | reg_class_contents[this_alternative]); | |
2459 | AND_COMPL_HARD_REG_SET | |
2460 | (available_regs, | |
2461 | ira_prohibited_class_mode_regs[this_alternative][mode]); | |
2462 | AND_COMPL_HARD_REG_SET (available_regs, lra_no_alloc_regs); | |
2463 | if (hard_reg_set_empty_p (available_regs)) | |
2464 | { | |
2465 | /* There are no hard regs holding a value of given | |
2466 | mode. */ | |
2467 | if (offmemok) | |
2468 | { | |
2469 | this_alternative = NO_REGS; | |
2470 | if (lra_dump_file != NULL) | |
2471 | fprintf (lra_dump_file, | |
2472 | " %d Using memory because of" | |
2473 | " a bad mode: reject+=2\n", | |
2474 | nop); | |
2475 | reject += 2; | |
2476 | } | |
2477 | else | |
2478 | { | |
2479 | if (lra_dump_file != NULL) | |
2480 | fprintf (lra_dump_file, | |
2481 | " alt=%d: Wrong mode -- refuse\n", | |
2482 | nalt); | |
2483 | goto fail; | |
2484 | } | |
2485 | } | |
2486 | } | |
2487 | ||
2ae577fd VM |
2488 | /* If not assigned pseudo has a class which a subset of |
2489 | required reg class, it is a less costly alternative | |
2490 | as the pseudo still can get a hard reg of necessary | |
2491 | class. */ | |
2492 | if (! no_regs_p && REG_P (op) && hard_regno[nop] < 0 | |
2493 | && (cl = get_reg_class (REGNO (op))) != NO_REGS | |
2494 | && ira_class_subset_p[this_alternative][cl]) | |
2495 | { | |
2496 | if (lra_dump_file != NULL) | |
2497 | fprintf | |
2498 | (lra_dump_file, | |
2499 | " %d Super set class reg: reject-=3\n", nop); | |
2500 | reject -= 3; | |
2501 | } | |
2502 | ||
55a2c322 VM |
2503 | this_alternative_offmemok = offmemok; |
2504 | if (this_costly_alternative != NO_REGS) | |
cb1cca12 VM |
2505 | { |
2506 | if (lra_dump_file != NULL) | |
2507 | fprintf (lra_dump_file, | |
2508 | " %d Costly loser: reject++\n", nop); | |
2509 | reject++; | |
2510 | } | |
55a2c322 VM |
2511 | /* If the operand is dying, has a matching constraint, |
2512 | and satisfies constraints of the matched operand | |
f4581282 | 2513 | which failed to satisfy the own constraints, most probably |
a9711f36 VM |
2514 | the reload for this operand will be gone. */ |
2515 | if (this_alternative_matches >= 0 | |
2516 | && !curr_alt_win[this_alternative_matches] | |
2517 | && REG_P (op) | |
2518 | && find_regno_note (curr_insn, REG_DEAD, REGNO (op)) | |
2519 | && (hard_regno[nop] >= 0 | |
2520 | ? in_hard_reg_set_p (this_alternative_set, | |
2521 | mode, hard_regno[nop]) | |
2522 | : in_class_p (op, this_alternative, NULL))) | |
2523 | { | |
2524 | if (lra_dump_file != NULL) | |
2525 | fprintf | |
2526 | (lra_dump_file, | |
2527 | " %d Dying matched operand reload: reject++\n", | |
2528 | nop); | |
2529 | reject++; | |
2530 | } | |
2531 | else | |
027ece11 | 2532 | { |
5306401f VM |
2533 | /* Strict_low_part requires to reload the register |
2534 | not the sub-register. In this case we should | |
2535 | check that a final reload hard reg can hold the | |
2536 | value mode. */ | |
027ece11 VM |
2537 | if (curr_static_id->operand[nop].strict_low |
2538 | && REG_P (op) | |
2539 | && hard_regno[nop] < 0 | |
2540 | && GET_CODE (*curr_id->operand_loc[nop]) == SUBREG | |
2541 | && ira_class_hard_regs_num[this_alternative] > 0 | |
f939c3e6 RS |
2542 | && (!targetm.hard_regno_mode_ok |
2543 | (ira_class_hard_regs[this_alternative][0], | |
2544 | GET_MODE (*curr_id->operand_loc[nop])))) | |
8f21260c VM |
2545 | { |
2546 | if (lra_dump_file != NULL) | |
2547 | fprintf | |
2548 | (lra_dump_file, | |
2549 | " alt=%d: Strict low subreg reload -- refuse\n", | |
2550 | nalt); | |
2551 | goto fail; | |
2552 | } | |
027ece11 VM |
2553 | losers++; |
2554 | } | |
55a2c322 VM |
2555 | if (operand_reg[nop] != NULL_RTX |
2556 | /* Output operands and matched input operands are | |
2557 | not inherited. The following conditions do not | |
2558 | exactly describe the previous statement but they | |
2559 | are pretty close. */ | |
2560 | && curr_static_id->operand[nop].type != OP_OUT | |
2561 | && (this_alternative_matches < 0 | |
2562 | || curr_static_id->operand[nop].type != OP_IN)) | |
2563 | { | |
2564 | int last_reload = (lra_reg_info[ORIGINAL_REGNO | |
2565 | (operand_reg[nop])] | |
2566 | .last_reload); | |
2567 | ||
6334f3e9 VM |
2568 | /* The value of reload_sum has sense only if we |
2569 | process insns in their order. It happens only on | |
2570 | the first constraints sub-pass when we do most of | |
2571 | reload work. */ | |
2572 | if (lra_constraint_iter == 1 && last_reload > bb_reload_num) | |
55a2c322 VM |
2573 | reload_sum += last_reload - bb_reload_num; |
2574 | } | |
2575 | /* If this is a constant that is reloaded into the | |
2576 | desired class by copying it to memory first, count | |
2577 | that as another reload. This is consistent with | |
2578 | other code and is required to avoid choosing another | |
2579 | alternative when the constant is moved into memory. | |
2580 | Note that the test here is precisely the same as in | |
2581 | the code below that calls force_const_mem. */ | |
2582 | if (CONST_POOL_OK_P (mode, op) | |
2583 | && ((targetm.preferred_reload_class | |
2584 | (op, this_alternative) == NO_REGS) | |
2585 | || no_input_reloads_p)) | |
2586 | { | |
2587 | const_to_mem = 1; | |
2588 | if (! no_regs_p) | |
2589 | losers++; | |
2590 | } | |
f4eafc30 | 2591 | |
55a2c322 VM |
2592 | /* Alternative loses if it requires a type of reload not |
2593 | permitted for this insn. We can always reload | |
2594 | objects with a REG_UNUSED note. */ | |
2595 | if ((curr_static_id->operand[nop].type != OP_IN | |
2596 | && no_output_reloads_p | |
2597 | && ! find_reg_note (curr_insn, REG_UNUSED, op)) | |
2598 | || (curr_static_id->operand[nop].type != OP_OUT | |
8f21260c VM |
2599 | && no_input_reloads_p && ! const_to_mem) |
2600 | || (this_alternative_matches >= 0 | |
9102dadd VM |
2601 | && (no_input_reloads_p |
2602 | || (no_output_reloads_p | |
2603 | && (curr_static_id->operand | |
2604 | [this_alternative_matches].type != OP_IN) | |
2605 | && ! find_reg_note (curr_insn, REG_UNUSED, | |
2606 | no_subreg_reg_operand | |
2607 | [this_alternative_matches]))))) | |
8f21260c VM |
2608 | { |
2609 | if (lra_dump_file != NULL) | |
2610 | fprintf | |
2611 | (lra_dump_file, | |
2612 | " alt=%d: No input/otput reload -- refuse\n", | |
2613 | nalt); | |
2614 | goto fail; | |
2615 | } | |
f4eafc30 | 2616 | |
f66af4aa VM |
2617 | /* Alternative loses if it required class pseudo can not |
2618 | hold value of required mode. Such insns can be | |
7b6e0c54 | 2619 | described by insn definitions with mode iterators. */ |
f66af4aa VM |
2620 | if (GET_MODE (*curr_id->operand_loc[nop]) != VOIDmode |
2621 | && ! hard_reg_set_empty_p (this_alternative_set) | |
7b6e0c54 VM |
2622 | /* It is common practice for constraints to use a |
2623 | class which does not have actually enough regs to | |
2624 | hold the value (e.g. x86 AREG for mode requiring | |
2625 | more one general reg). Therefore we have 2 | |
2626 | conditions to check that the reload pseudo can | |
2627 | not hold the mode value. */ | |
f939c3e6 RS |
2628 | && (!targetm.hard_regno_mode_ok |
2629 | (ira_class_hard_regs[this_alternative][0], | |
2630 | GET_MODE (*curr_id->operand_loc[nop]))) | |
7b6e0c54 VM |
2631 | /* The above condition is not enough as the first |
2632 | reg in ira_class_hard_regs can be not aligned for | |
2633 | multi-words mode values. */ | |
3c954213 VM |
2634 | && (prohibited_class_reg_set_mode_p |
2635 | (this_alternative, this_alternative_set, | |
2636 | GET_MODE (*curr_id->operand_loc[nop])))) | |
2637 | { | |
2638 | if (lra_dump_file != NULL) | |
2639 | fprintf (lra_dump_file, | |
2640 | " alt=%d: reload pseudo for op %d " | |
2641 | " can not hold the mode value -- refuse\n", | |
2642 | nalt, nop); | |
2643 | goto fail; | |
f66af4aa VM |
2644 | } |
2645 | ||
821b7577 VM |
2646 | /* Check strong discouragement of reload of non-constant |
2647 | into class THIS_ALTERNATIVE. */ | |
2648 | if (! CONSTANT_P (op) && ! no_regs_p | |
2649 | && (targetm.preferred_reload_class | |
2650 | (op, this_alternative) == NO_REGS | |
2651 | || (curr_static_id->operand[nop].type == OP_OUT | |
2652 | && (targetm.preferred_output_reload_class | |
2653 | (op, this_alternative) == NO_REGS)))) | |
cb1cca12 VM |
2654 | { |
2655 | if (lra_dump_file != NULL) | |
2656 | fprintf (lra_dump_file, | |
2657 | " %d Non-prefered reload: reject+=%d\n", | |
2658 | nop, LRA_MAX_REJECT); | |
2659 | reject += LRA_MAX_REJECT; | |
2660 | } | |
f4eafc30 | 2661 | |
ed52a84e VM |
2662 | if (! (MEM_P (op) && offmemok) |
2663 | && ! (const_to_mem && constmemok)) | |
55a2c322 VM |
2664 | { |
2665 | /* We prefer to reload pseudos over reloading other | |
2666 | things, since such reloads may be able to be | |
2667 | eliminated later. So bump REJECT in other cases. | |
2668 | Don't do this in the case where we are forcing a | |
2669 | constant into memory and it will then win since | |
2670 | we don't want to have a different alternative | |
2671 | match then. */ | |
2672 | if (! (REG_P (op) && REGNO (op) >= FIRST_PSEUDO_REGISTER)) | |
cb1cca12 VM |
2673 | { |
2674 | if (lra_dump_file != NULL) | |
2675 | fprintf | |
2676 | (lra_dump_file, | |
2677 | " %d Non-pseudo reload: reject+=2\n", | |
2678 | nop); | |
2679 | reject += 2; | |
2680 | } | |
f4eafc30 | 2681 | |
55a2c322 VM |
2682 | if (! no_regs_p) |
2683 | reload_nregs | |
2684 | += ira_reg_class_max_nregs[this_alternative][mode]; | |
36ff9dfb VM |
2685 | |
2686 | if (SMALL_REGISTER_CLASS_P (this_alternative)) | |
cb1cca12 VM |
2687 | { |
2688 | if (lra_dump_file != NULL) | |
2689 | fprintf | |
2690 | (lra_dump_file, | |
2691 | " %d Small class reload: reject+=%d\n", | |
2692 | nop, LRA_LOSER_COST_FACTOR / 2); | |
2693 | reject += LRA_LOSER_COST_FACTOR / 2; | |
2694 | } | |
55a2c322 VM |
2695 | } |
2696 | ||
1bdc4b11 VM |
2697 | /* We are trying to spill pseudo into memory. It is |
2698 | usually more costly than moving to a hard register | |
2699 | although it might takes the same number of | |
5f225ef4 VM |
2700 | reloads. |
2701 | ||
2702 | Non-pseudo spill may happen also. Suppose a target allows both | |
2703 | register and memory in the operand constraint alternatives, | |
2704 | then it's typical that an eliminable register has a substition | |
2705 | of "base + offset" which can either be reloaded by a simple | |
2706 | "new_reg <= base + offset" which will match the register | |
2707 | constraint, or a similar reg addition followed by further spill | |
2708 | to and reload from memory which will match the memory | |
2709 | constraint, but this memory spill will be much more costly | |
2710 | usually. | |
2711 | ||
2712 | Code below increases the reject for both pseudo and non-pseudo | |
2713 | spill. */ | |
10406801 JW |
2714 | if (no_regs_p |
2715 | && !(MEM_P (op) && offmemok) | |
2716 | && !(REG_P (op) && hard_regno[nop] < 0)) | |
cb1cca12 VM |
2717 | { |
2718 | if (lra_dump_file != NULL) | |
2719 | fprintf | |
2720 | (lra_dump_file, | |
5f225ef4 VM |
2721 | " %d Spill %spseudo into memory: reject+=3\n", |
2722 | nop, REG_P (op) ? "" : "Non-"); | |
cb1cca12 | 2723 | reject += 3; |
7891065a VM |
2724 | if (VECTOR_MODE_P (mode)) |
2725 | { | |
2726 | /* Spilling vectors into memory is usually more | |
2727 | costly as they contain big values. */ | |
2728 | if (lra_dump_file != NULL) | |
2729 | fprintf | |
2730 | (lra_dump_file, | |
2731 | " %d Spill vector pseudo: reject+=2\n", | |
2732 | nop); | |
2733 | reject += 2; | |
2734 | } | |
cb1cca12 | 2735 | } |
1bdc4b11 | 2736 | |
4796d8f6 VM |
2737 | /* When we use an operand requiring memory in given |
2738 | alternative, the insn should write *and* read the | |
2739 | value to/from memory it is costly in comparison with | |
2740 | an insn alternative which does not use memory | |
2741 | (e.g. register or immediate operand). We exclude | |
2742 | memory operand for such case as we can satisfy the | |
2743 | memory constraints by reloading address. */ | |
2744 | if (no_regs_p && offmemok && !MEM_P (op)) | |
9b195552 VM |
2745 | { |
2746 | if (lra_dump_file != NULL) | |
2747 | fprintf | |
2748 | (lra_dump_file, | |
2749 | " Using memory insn operand %d: reject+=3\n", | |
2750 | nop); | |
2751 | reject += 3; | |
2752 | } | |
2753 | ||
7100b561 UB |
2754 | /* If reload requires moving value through secondary |
2755 | memory, it will need one more insn at least. */ | |
2756 | if (this_alternative != NO_REGS | |
2757 | && REG_P (op) && (cl = get_reg_class (REGNO (op))) != NO_REGS | |
2758 | && ((curr_static_id->operand[nop].type != OP_OUT | |
f15643d4 RS |
2759 | && targetm.secondary_memory_needed (GET_MODE (op), cl, |
2760 | this_alternative)) | |
7100b561 | 2761 | || (curr_static_id->operand[nop].type != OP_IN |
f15643d4 RS |
2762 | && (targetm.secondary_memory_needed |
2763 | (GET_MODE (op), this_alternative, cl))))) | |
7100b561 | 2764 | losers++; |
f15643d4 | 2765 | |
55a2c322 VM |
2766 | /* Input reloads can be inherited more often than output |
2767 | reloads can be removed, so penalize output | |
2768 | reloads. */ | |
2769 | if (!REG_P (op) || curr_static_id->operand[nop].type != OP_IN) | |
cb1cca12 VM |
2770 | { |
2771 | if (lra_dump_file != NULL) | |
2772 | fprintf | |
2773 | (lra_dump_file, | |
2774 | " %d Non input pseudo reload: reject++\n", | |
2775 | nop); | |
2776 | reject++; | |
2777 | } | |
feca7b89 VM |
2778 | |
2779 | if (MEM_P (op) && offmemok) | |
2780 | addr_losers++; | |
8b8e41e5 VM |
2781 | else if (curr_static_id->operand[nop].type == OP_INOUT) |
2782 | { | |
2783 | if (lra_dump_file != NULL) | |
2784 | fprintf | |
2785 | (lra_dump_file, | |
2786 | " %d Input/Output reload: reject+=%d\n", | |
2787 | nop, LRA_LOSER_COST_FACTOR); | |
2788 | reject += LRA_LOSER_COST_FACTOR; | |
2789 | } | |
55a2c322 | 2790 | } |
f4eafc30 | 2791 | |
80f466c4 | 2792 | if (early_clobber_p && ! scratch_p) |
cb1cca12 VM |
2793 | { |
2794 | if (lra_dump_file != NULL) | |
2795 | fprintf (lra_dump_file, | |
2796 | " %d Early clobber: reject++\n", nop); | |
2797 | reject++; | |
2798 | } | |
55a2c322 VM |
2799 | /* ??? We check early clobbers after processing all operands |
2800 | (see loop below) and there we update the costs more. | |
2801 | Should we update the cost (may be approximately) here | |
2802 | because of early clobber register reloads or it is a rare | |
2803 | or non-important thing to be worth to do it. */ | |
feca7b89 VM |
2804 | overall = (losers * LRA_LOSER_COST_FACTOR + reject |
2805 | - (addr_losers == losers ? static_reject : 0)); | |
55a2c322 | 2806 | if ((best_losers == 0 || losers != 0) && best_overall < overall) |
deca73f5 VM |
2807 | { |
2808 | if (lra_dump_file != NULL) | |
2809 | fprintf (lra_dump_file, | |
cb1cca12 | 2810 | " alt=%d,overall=%d,losers=%d -- refuse\n", |
deca73f5 VM |
2811 | nalt, overall, losers); |
2812 | goto fail; | |
2813 | } | |
55a2c322 | 2814 | |
9b195552 VM |
2815 | if (update_and_check_small_class_inputs (nop, this_alternative)) |
2816 | { | |
2817 | if (lra_dump_file != NULL) | |
2818 | fprintf (lra_dump_file, | |
2819 | " alt=%d, not enough small class regs -- refuse\n", | |
2820 | nalt); | |
2821 | goto fail; | |
2822 | } | |
55a2c322 VM |
2823 | curr_alt[nop] = this_alternative; |
2824 | COPY_HARD_REG_SET (curr_alt_set[nop], this_alternative_set); | |
2825 | curr_alt_win[nop] = this_alternative_win; | |
2826 | curr_alt_match_win[nop] = this_alternative_match_win; | |
2827 | curr_alt_offmemok[nop] = this_alternative_offmemok; | |
2828 | curr_alt_matches[nop] = this_alternative_matches; | |
f4eafc30 | 2829 | |
55a2c322 VM |
2830 | if (this_alternative_matches >= 0 |
2831 | && !did_match && !this_alternative_win) | |
2832 | curr_alt_win[this_alternative_matches] = false; | |
f4eafc30 | 2833 | |
55a2c322 VM |
2834 | if (early_clobber_p && operand_reg[nop] != NULL_RTX) |
2835 | early_clobbered_nops[early_clobbered_regs_num++] = nop; | |
2836 | } | |
feca7b89 | 2837 | |
2c62cbaa VM |
2838 | if (curr_insn_set != NULL_RTX && n_operands == 2 |
2839 | /* Prevent processing non-move insns. */ | |
2840 | && (GET_CODE (SET_SRC (curr_insn_set)) == SUBREG | |
2841 | || SET_SRC (curr_insn_set) == no_subreg_reg_operand[1]) | |
2842 | && ((! curr_alt_win[0] && ! curr_alt_win[1] | |
2843 | && REG_P (no_subreg_reg_operand[0]) | |
2844 | && REG_P (no_subreg_reg_operand[1]) | |
2845 | && (reg_in_class_p (no_subreg_reg_operand[0], curr_alt[1]) | |
2846 | || reg_in_class_p (no_subreg_reg_operand[1], curr_alt[0]))) | |
2847 | || (! curr_alt_win[0] && curr_alt_win[1] | |
2848 | && REG_P (no_subreg_reg_operand[1]) | |
feca7b89 VM |
2849 | /* Check that we reload memory not the memory |
2850 | address. */ | |
9125b9fc VM |
2851 | && ! (curr_alt_offmemok[0] |
2852 | && MEM_P (no_subreg_reg_operand[0])) | |
2c62cbaa VM |
2853 | && reg_in_class_p (no_subreg_reg_operand[1], curr_alt[0])) |
2854 | || (curr_alt_win[0] && ! curr_alt_win[1] | |
2855 | && REG_P (no_subreg_reg_operand[0]) | |
feca7b89 VM |
2856 | /* Check that we reload memory not the memory |
2857 | address. */ | |
9125b9fc VM |
2858 | && ! (curr_alt_offmemok[1] |
2859 | && MEM_P (no_subreg_reg_operand[1])) | |
2c62cbaa VM |
2860 | && reg_in_class_p (no_subreg_reg_operand[0], curr_alt[1]) |
2861 | && (! CONST_POOL_OK_P (curr_operand_mode[1], | |
2862 | no_subreg_reg_operand[1]) | |
2863 | || (targetm.preferred_reload_class | |
2864 | (no_subreg_reg_operand[1], | |
2865 | (enum reg_class) curr_alt[1]) != NO_REGS)) | |
2866 | /* If it is a result of recent elimination in move | |
2867 | insn we can transform it into an add still by | |
2868 | using this alternative. */ | |
b4c96972 RS |
2869 | && GET_CODE (no_subreg_reg_operand[1]) != PLUS |
2870 | /* Likewise if the source has been replaced with an | |
2871 | equivalent value. This only happens once -- the reload | |
2872 | will use the equivalent value instead of the register it | |
2873 | replaces -- so there should be no danger of cycling. */ | |
2874 | && !equiv_substition_p[1]))) | |
cb1cca12 VM |
2875 | { |
2876 | /* We have a move insn and a new reload insn will be similar | |
9125b9fc VM |
2877 | to the current insn. We should avoid such situation as |
2878 | it results in LRA cycling. */ | |
2879 | if (lra_dump_file != NULL) | |
2880 | fprintf (lra_dump_file, | |
2881 | " Cycle danger: overall += LRA_MAX_REJECT\n"); | |
cb1cca12 VM |
2882 | overall += LRA_MAX_REJECT; |
2883 | } | |
55a2c322 VM |
2884 | ok_p = true; |
2885 | curr_alt_dont_inherit_ops_num = 0; | |
2886 | for (nop = 0; nop < early_clobbered_regs_num; nop++) | |
2887 | { | |
2194f7a2 | 2888 | int i, j, clobbered_hard_regno, first_conflict_j, last_conflict_j; |
55a2c322 VM |
2889 | HARD_REG_SET temp_set; |
2890 | ||
2891 | i = early_clobbered_nops[nop]; | |
2892 | if ((! curr_alt_win[i] && ! curr_alt_match_win[i]) | |
2893 | || hard_regno[i] < 0) | |
2894 | continue; | |
1c86bd80 | 2895 | lra_assert (operand_reg[i] != NULL_RTX); |
55a2c322 VM |
2896 | clobbered_hard_regno = hard_regno[i]; |
2897 | CLEAR_HARD_REG_SET (temp_set); | |
2898 | add_to_hard_reg_set (&temp_set, biggest_mode[i], clobbered_hard_regno); | |
2194f7a2 | 2899 | first_conflict_j = last_conflict_j = -1; |
55a2c322 VM |
2900 | for (j = 0; j < n_operands; j++) |
2901 | if (j == i | |
2902 | /* We don't want process insides of match_operator and | |
2903 | match_parallel because otherwise we would process | |
2904 | their operands once again generating a wrong | |
2905 | code. */ | |
2906 | || curr_static_id->operand[j].is_operator) | |
2907 | continue; | |
2908 | else if ((curr_alt_matches[j] == i && curr_alt_match_win[j]) | |
2909 | || (curr_alt_matches[i] == j && curr_alt_match_win[i])) | |
2910 | continue; | |
1c86bd80 VM |
2911 | /* If we don't reload j-th operand, check conflicts. */ |
2912 | else if ((curr_alt_win[j] || curr_alt_match_win[j]) | |
2913 | && uses_hard_regs_p (*curr_id->operand_loc[j], temp_set)) | |
2194f7a2 VM |
2914 | { |
2915 | if (first_conflict_j < 0) | |
2916 | first_conflict_j = j; | |
2917 | last_conflict_j = j; | |
2918 | } | |
2919 | if (last_conflict_j < 0) | |
55a2c322 | 2920 | continue; |
1c86bd80 VM |
2921 | /* If earlyclobber operand conflicts with another |
2922 | non-matching operand which is actually the same register | |
2923 | as the earlyclobber operand, it is better to reload the | |
2924 | another operand as an operand matching the earlyclobber | |
2925 | operand can be also the same. */ | |
2194f7a2 | 2926 | if (first_conflict_j == last_conflict_j |
e78dbb4a MS |
2927 | && operand_reg[last_conflict_j] != NULL_RTX |
2928 | && ! curr_alt_match_win[last_conflict_j] | |
2194f7a2 | 2929 | && REGNO (operand_reg[i]) == REGNO (operand_reg[last_conflict_j])) |
1c86bd80 | 2930 | { |
2194f7a2 VM |
2931 | curr_alt_win[last_conflict_j] = false; |
2932 | curr_alt_dont_inherit_ops[curr_alt_dont_inherit_ops_num++] | |
2933 | = last_conflict_j; | |
1c86bd80 | 2934 | losers++; |
deca73f5 VM |
2935 | /* Early clobber was already reflected in REJECT. */ |
2936 | lra_assert (reject > 0); | |
cb1cca12 VM |
2937 | if (lra_dump_file != NULL) |
2938 | fprintf | |
2939 | (lra_dump_file, | |
2940 | " %d Conflict early clobber reload: reject--\n", | |
2941 | i); | |
deca73f5 VM |
2942 | reject--; |
2943 | overall += LRA_LOSER_COST_FACTOR - 1; | |
1c86bd80 | 2944 | } |
55a2c322 VM |
2945 | else |
2946 | { | |
1c86bd80 VM |
2947 | /* We need to reload early clobbered register and the |
2948 | matched registers. */ | |
2949 | for (j = 0; j < n_operands; j++) | |
2950 | if (curr_alt_matches[j] == i) | |
2951 | { | |
2952 | curr_alt_match_win[j] = false; | |
2953 | losers++; | |
2954 | overall += LRA_LOSER_COST_FACTOR; | |
2955 | } | |
2956 | if (! curr_alt_match_win[i]) | |
2957 | curr_alt_dont_inherit_ops[curr_alt_dont_inherit_ops_num++] = i; | |
2958 | else | |
2959 | { | |
2960 | /* Remember pseudos used for match reloads are never | |
2961 | inherited. */ | |
2962 | lra_assert (curr_alt_matches[i] >= 0); | |
2963 | curr_alt_win[curr_alt_matches[i]] = false; | |
2964 | } | |
2965 | curr_alt_win[i] = curr_alt_match_win[i] = false; | |
2966 | losers++; | |
deca73f5 VM |
2967 | /* Early clobber was already reflected in REJECT. */ |
2968 | lra_assert (reject > 0); | |
cb1cca12 VM |
2969 | if (lra_dump_file != NULL) |
2970 | fprintf | |
2971 | (lra_dump_file, | |
aa326bfb | 2972 | " %d Matched conflict early clobber reloads: " |
cb1cca12 VM |
2973 | "reject--\n", |
2974 | i); | |
deca73f5 VM |
2975 | reject--; |
2976 | overall += LRA_LOSER_COST_FACTOR - 1; | |
55a2c322 | 2977 | } |
55a2c322 | 2978 | } |
deca73f5 | 2979 | if (lra_dump_file != NULL) |
36ff9dfb VM |
2980 | fprintf (lra_dump_file, " alt=%d,overall=%d,losers=%d,rld_nregs=%d\n", |
2981 | nalt, overall, losers, reload_nregs); | |
deca73f5 | 2982 | |
55a2c322 VM |
2983 | /* If this alternative can be made to work by reloading, and it |
2984 | needs less reloading than the others checked so far, record | |
2985 | it as the chosen goal for reloading. */ | |
2986 | if ((best_losers != 0 && losers == 0) | |
2987 | || (((best_losers == 0 && losers == 0) | |
2988 | || (best_losers != 0 && losers != 0)) | |
2989 | && (best_overall > overall | |
2990 | || (best_overall == overall | |
2991 | /* If the cost of the reloads is the same, | |
2992 | prefer alternative which requires minimal | |
36ff9dfb VM |
2993 | number of reload regs. */ |
2994 | && (reload_nregs < best_reload_nregs | |
2995 | || (reload_nregs == best_reload_nregs | |
f15feaf9 VM |
2996 | && (best_reload_sum < reload_sum |
2997 | || (best_reload_sum == reload_sum | |
2998 | && nalt < goal_alt_number)))))))) | |
55a2c322 VM |
2999 | { |
3000 | for (nop = 0; nop < n_operands; nop++) | |
3001 | { | |
3002 | goal_alt_win[nop] = curr_alt_win[nop]; | |
3003 | goal_alt_match_win[nop] = curr_alt_match_win[nop]; | |
3004 | goal_alt_matches[nop] = curr_alt_matches[nop]; | |
3005 | goal_alt[nop] = curr_alt[nop]; | |
3006 | goal_alt_offmemok[nop] = curr_alt_offmemok[nop]; | |
3007 | } | |
3008 | goal_alt_dont_inherit_ops_num = curr_alt_dont_inherit_ops_num; | |
3009 | for (nop = 0; nop < curr_alt_dont_inherit_ops_num; nop++) | |
3010 | goal_alt_dont_inherit_ops[nop] = curr_alt_dont_inherit_ops[nop]; | |
3011 | goal_alt_swapped = curr_swapped; | |
3012 | best_overall = overall; | |
3013 | best_losers = losers; | |
55a2c322 VM |
3014 | best_reload_nregs = reload_nregs; |
3015 | best_reload_sum = reload_sum; | |
3016 | goal_alt_number = nalt; | |
3017 | } | |
3018 | if (losers == 0) | |
3019 | /* Everything is satisfied. Do not process alternatives | |
f4eafc30 | 3020 | anymore. */ |
55a2c322 VM |
3021 | break; |
3022 | fail: | |
3023 | ; | |
3024 | } | |
3025 | return ok_p; | |
3026 | } | |
3027 | ||
c31d2d11 RS |
3028 | /* Make reload base reg from address AD. */ |
3029 | static rtx | |
3030 | base_to_reg (struct address_info *ad) | |
3031 | { | |
3032 | enum reg_class cl; | |
3033 | int code = -1; | |
3034 | rtx new_inner = NULL_RTX; | |
3035 | rtx new_reg = NULL_RTX; | |
fee3e72c DM |
3036 | rtx_insn *insn; |
3037 | rtx_insn *last_insn = get_last_insn(); | |
c31d2d11 | 3038 | |
0a001dcb | 3039 | lra_assert (ad->disp == ad->disp_term); |
c31d2d11 RS |
3040 | cl = base_reg_class (ad->mode, ad->as, ad->base_outer_code, |
3041 | get_index_code (ad)); | |
0a001dcb | 3042 | new_reg = lra_create_new_reg (GET_MODE (*ad->base), NULL_RTX, |
c31d2d11 RS |
3043 | cl, "base"); |
3044 | new_inner = simplify_gen_binary (PLUS, GET_MODE (new_reg), new_reg, | |
3045 | ad->disp_term == NULL | |
0a001dcb | 3046 | ? const0_rtx |
c31d2d11 RS |
3047 | : *ad->disp_term); |
3048 | if (!valid_address_p (ad->mode, new_inner, ad->as)) | |
3049 | return NULL_RTX; | |
0a001dcb | 3050 | insn = emit_insn (gen_rtx_SET (new_reg, *ad->base)); |
c31d2d11 RS |
3051 | code = recog_memoized (insn); |
3052 | if (code < 0) | |
3053 | { | |
3054 | delete_insns_since (last_insn); | |
3055 | return NULL_RTX; | |
3056 | } | |
3057 | ||
3058 | return new_inner; | |
3059 | } | |
3060 | ||
9005477f | 3061 | /* Make reload base reg + DISP from address AD. Return the new pseudo. */ |
55a2c322 | 3062 | static rtx |
9005477f | 3063 | base_plus_disp_to_reg (struct address_info *ad, rtx disp) |
55a2c322 VM |
3064 | { |
3065 | enum reg_class cl; | |
3066 | rtx new_reg; | |
3067 | ||
9005477f | 3068 | lra_assert (ad->base == ad->base_term); |
277f65de RS |
3069 | cl = base_reg_class (ad->mode, ad->as, ad->base_outer_code, |
3070 | get_index_code (ad)); | |
3071 | new_reg = lra_create_new_reg (GET_MODE (*ad->base_term), NULL_RTX, | |
3072 | cl, "base + disp"); | |
9005477f | 3073 | lra_emit_add (new_reg, *ad->base_term, disp); |
55a2c322 VM |
3074 | return new_reg; |
3075 | } | |
3076 | ||
6e071b1e VM |
3077 | /* Make reload of index part of address AD. Return the new |
3078 | pseudo. */ | |
3079 | static rtx | |
3080 | index_part_to_reg (struct address_info *ad) | |
3081 | { | |
3082 | rtx new_reg; | |
3083 | ||
3084 | new_reg = lra_create_new_reg (GET_MODE (*ad->index), NULL_RTX, | |
3085 | INDEX_REG_CLASS, "index term"); | |
3086 | expand_mult (GET_MODE (*ad->index), *ad->index_term, | |
3087 | GEN_INT (get_index_scale (ad)), new_reg, 1); | |
3088 | return new_reg; | |
3089 | } | |
3090 | ||
277f65de RS |
3091 | /* Return true if we can add a displacement to address AD, even if that |
3092 | makes the address invalid. The fix-up code requires any new address | |
3093 | to be the sum of the BASE_TERM, INDEX and DISP_TERM fields. */ | |
02ea4bf4 | 3094 | static bool |
277f65de | 3095 | can_add_disp_p (struct address_info *ad) |
02ea4bf4 | 3096 | { |
277f65de RS |
3097 | return (!ad->autoinc_p |
3098 | && ad->segment == NULL | |
3099 | && ad->base == ad->base_term | |
3100 | && ad->disp == ad->disp_term); | |
02ea4bf4 RS |
3101 | } |
3102 | ||
277f65de RS |
3103 | /* Make equiv substitution in address AD. Return true if a substitution |
3104 | was made. */ | |
55a2c322 | 3105 | static bool |
277f65de | 3106 | equiv_address_substitution (struct address_info *ad) |
55a2c322 | 3107 | { |
277f65de | 3108 | rtx base_reg, new_base_reg, index_reg, new_index_reg, *base_term, *index_term; |
73ca989c RS |
3109 | poly_int64 disp; |
3110 | HOST_WIDE_INT scale; | |
55a2c322 VM |
3111 | bool change_p; |
3112 | ||
277f65de RS |
3113 | base_term = strip_subreg (ad->base_term); |
3114 | if (base_term == NULL) | |
55a2c322 VM |
3115 | base_reg = new_base_reg = NULL_RTX; |
3116 | else | |
3117 | { | |
277f65de | 3118 | base_reg = *base_term; |
8d49e7ef | 3119 | new_base_reg = get_equiv_with_elimination (base_reg, curr_insn); |
55a2c322 | 3120 | } |
277f65de RS |
3121 | index_term = strip_subreg (ad->index_term); |
3122 | if (index_term == NULL) | |
55a2c322 VM |
3123 | index_reg = new_index_reg = NULL_RTX; |
3124 | else | |
3125 | { | |
277f65de | 3126 | index_reg = *index_term; |
8d49e7ef | 3127 | new_index_reg = get_equiv_with_elimination (index_reg, curr_insn); |
55a2c322 VM |
3128 | } |
3129 | if (base_reg == new_base_reg && index_reg == new_index_reg) | |
3130 | return false; | |
3131 | disp = 0; | |
3132 | change_p = false; | |
3133 | if (lra_dump_file != NULL) | |
3134 | { | |
3135 | fprintf (lra_dump_file, "Changing address in insn %d ", | |
3136 | INSN_UID (curr_insn)); | |
cfbeaedf | 3137 | dump_value_slim (lra_dump_file, *ad->outer, 1); |
55a2c322 VM |
3138 | } |
3139 | if (base_reg != new_base_reg) | |
3140 | { | |
73ca989c | 3141 | poly_int64 offset; |
55a2c322 VM |
3142 | if (REG_P (new_base_reg)) |
3143 | { | |
277f65de | 3144 | *base_term = new_base_reg; |
55a2c322 VM |
3145 | change_p = true; |
3146 | } | |
3147 | else if (GET_CODE (new_base_reg) == PLUS | |
3148 | && REG_P (XEXP (new_base_reg, 0)) | |
73ca989c | 3149 | && poly_int_rtx_p (XEXP (new_base_reg, 1), &offset) |
277f65de | 3150 | && can_add_disp_p (ad)) |
55a2c322 | 3151 | { |
73ca989c | 3152 | disp += offset; |
277f65de | 3153 | *base_term = XEXP (new_base_reg, 0); |
55a2c322 VM |
3154 | change_p = true; |
3155 | } | |
277f65de RS |
3156 | if (ad->base_term2 != NULL) |
3157 | *ad->base_term2 = *ad->base_term; | |
55a2c322 | 3158 | } |
55a2c322 VM |
3159 | if (index_reg != new_index_reg) |
3160 | { | |
73ca989c | 3161 | poly_int64 offset; |
55a2c322 VM |
3162 | if (REG_P (new_index_reg)) |
3163 | { | |
277f65de | 3164 | *index_term = new_index_reg; |
55a2c322 VM |
3165 | change_p = true; |
3166 | } | |
3167 | else if (GET_CODE (new_index_reg) == PLUS | |
3168 | && REG_P (XEXP (new_index_reg, 0)) | |
73ca989c | 3169 | && poly_int_rtx_p (XEXP (new_index_reg, 1), &offset) |
277f65de | 3170 | && can_add_disp_p (ad) |
02ea4bf4 | 3171 | && (scale = get_index_scale (ad))) |
55a2c322 | 3172 | { |
73ca989c | 3173 | disp += offset * scale; |
277f65de | 3174 | *index_term = XEXP (new_index_reg, 0); |
55a2c322 VM |
3175 | change_p = true; |
3176 | } | |
3177 | } | |
73ca989c | 3178 | if (maybe_ne (disp, 0)) |
55a2c322 | 3179 | { |
277f65de RS |
3180 | if (ad->disp != NULL) |
3181 | *ad->disp = plus_constant (GET_MODE (*ad->inner), *ad->disp, disp); | |
55a2c322 VM |
3182 | else |
3183 | { | |
277f65de RS |
3184 | *ad->inner = plus_constant (GET_MODE (*ad->inner), *ad->inner, disp); |
3185 | update_address (ad); | |
55a2c322 VM |
3186 | } |
3187 | change_p = true; | |
3188 | } | |
3189 | if (lra_dump_file != NULL) | |
3190 | { | |
3191 | if (! change_p) | |
3192 | fprintf (lra_dump_file, " -- no change\n"); | |
3193 | else | |
3194 | { | |
3195 | fprintf (lra_dump_file, " on equiv "); | |
cfbeaedf | 3196 | dump_value_slim (lra_dump_file, *ad->outer, 1); |
55a2c322 VM |
3197 | fprintf (lra_dump_file, "\n"); |
3198 | } | |
3199 | } | |
3200 | return change_p; | |
3201 | } | |
3202 | ||
d9cf932c VM |
3203 | /* Major function to make reloads for an address in operand NOP or |
3204 | check its correctness (If CHECK_ONLY_P is true). The supported | |
3205 | cases are: | |
bd3d34d4 | 3206 | |
5a107a0f VM |
3207 | 1) an address that existed before LRA started, at which point it |
3208 | must have been valid. These addresses are subject to elimination | |
3209 | and may have become invalid due to the elimination offset being out | |
3210 | of range. | |
bd3d34d4 | 3211 | |
5a107a0f VM |
3212 | 2) an address created by forcing a constant to memory |
3213 | (force_const_to_mem). The initial form of these addresses might | |
3214 | not be valid, and it is this function's job to make them valid. | |
bd3d34d4 RS |
3215 | |
3216 | 3) a frame address formed from a register and a (possibly zero) | |
5a107a0f VM |
3217 | constant offset. As above, these addresses might not be valid and |
3218 | this function must make them so. | |
bd3d34d4 RS |
3219 | |
3220 | Add reloads to the lists *BEFORE and *AFTER. We might need to add | |
55a2c322 | 3221 | reloads to *AFTER because of inc/dec, {pre, post} modify in the |
cc8849a1 VM |
3222 | address. Return true for any RTL change. |
3223 | ||
3224 | The function is a helper function which does not produce all | |
d9cf932c VM |
3225 | transformations (when CHECK_ONLY_P is false) which can be |
3226 | necessary. It does just basic steps. To do all necessary | |
3227 | transformations use function process_address. */ | |
55a2c322 | 3228 | static bool |
d9cf932c VM |
3229 | process_address_1 (int nop, bool check_only_p, |
3230 | rtx_insn **before, rtx_insn **after) | |
55a2c322 | 3231 | { |
277f65de RS |
3232 | struct address_info ad; |
3233 | rtx new_reg; | |
bc2fc1f3 | 3234 | HOST_WIDE_INT scale; |
55a2c322 VM |
3235 | rtx op = *curr_id->operand_loc[nop]; |
3236 | const char *constraint = curr_static_id->operand[nop].constraint; | |
777e635f | 3237 | enum constraint_num cn = lookup_constraint (constraint); |
d9cf932c | 3238 | bool change_p = false; |
55a2c322 | 3239 | |
823bb054 SB |
3240 | if (MEM_P (op) |
3241 | && GET_MODE (op) == BLKmode | |
3242 | && GET_CODE (XEXP (op, 0)) == SCRATCH) | |
3243 | return false; | |
3244 | ||
8677664e | 3245 | if (insn_extra_address_constraint (cn)) |
277f65de | 3246 | decompose_lea_address (&ad, curr_id->operand_loc[nop]); |
164f0634 EB |
3247 | /* Do not attempt to decompose arbitrary addresses generated by combine |
3248 | for asm operands with loose constraints, e.g 'X'. */ | |
3249 | else if (MEM_P (op) | |
4692a783 VM |
3250 | && !(INSN_CODE (curr_insn) < 0 |
3251 | && get_constraint_type (cn) == CT_FIXED_FORM | |
164f0634 | 3252 | && constraint_satisfied_p (op, cn))) |
277f65de | 3253 | decompose_mem_address (&ad, op); |
55a2c322 VM |
3254 | else if (GET_CODE (op) == SUBREG |
3255 | && MEM_P (SUBREG_REG (op))) | |
277f65de | 3256 | decompose_mem_address (&ad, SUBREG_REG (op)); |
55a2c322 VM |
3257 | else |
3258 | return false; | |
70712859 KK |
3259 | /* If INDEX_REG_CLASS is assigned to base_term already and isn't to |
3260 | index_term, swap them so to avoid assigning INDEX_REG_CLASS to both | |
3261 | when INDEX_REG_CLASS is a single register class. */ | |
3262 | if (ad.base_term != NULL | |
3263 | && ad.index_term != NULL | |
3264 | && ira_class_hard_regs_num[INDEX_REG_CLASS] == 1 | |
3265 | && REG_P (*ad.base_term) | |
3266 | && REG_P (*ad.index_term) | |
3267 | && in_class_p (*ad.base_term, INDEX_REG_CLASS, NULL) | |
3268 | && ! in_class_p (*ad.index_term, INDEX_REG_CLASS, NULL)) | |
3269 | { | |
3270 | std::swap (ad.base, ad.index); | |
3271 | std::swap (ad.base_term, ad.index_term); | |
3272 | } | |
d9cf932c VM |
3273 | if (! check_only_p) |
3274 | change_p = equiv_address_substitution (&ad); | |
277f65de | 3275 | if (ad.base_term != NULL |
55a2c322 | 3276 | && (process_addr_reg |
d9cf932c | 3277 | (ad.base_term, check_only_p, before, |
277f65de RS |
3278 | (ad.autoinc_p |
3279 | && !(REG_P (*ad.base_term) | |
3280 | && find_regno_note (curr_insn, REG_DEAD, | |
3281 | REGNO (*ad.base_term)) != NULL_RTX) | |
55a2c322 | 3282 | ? after : NULL), |
277f65de RS |
3283 | base_reg_class (ad.mode, ad.as, ad.base_outer_code, |
3284 | get_index_code (&ad))))) | |
55a2c322 VM |
3285 | { |
3286 | change_p = true; | |
277f65de RS |
3287 | if (ad.base_term2 != NULL) |
3288 | *ad.base_term2 = *ad.base_term; | |
55a2c322 | 3289 | } |
277f65de | 3290 | if (ad.index_term != NULL |
d9cf932c VM |
3291 | && process_addr_reg (ad.index_term, check_only_p, |
3292 | before, NULL, INDEX_REG_CLASS)) | |
55a2c322 VM |
3293 | change_p = true; |
3294 | ||
777e635f RS |
3295 | /* Target hooks sometimes don't treat extra-constraint addresses as |
3296 | legitimate address_operands, so handle them specially. */ | |
8677664e | 3297 | if (insn_extra_address_constraint (cn) |
777e635f | 3298 | && satisfies_address_constraint_p (&ad, cn)) |
2c62cbaa | 3299 | return change_p; |
2c62cbaa | 3300 | |
d9cf932c VM |
3301 | if (check_only_p) |
3302 | return change_p; | |
3303 | ||
277f65de | 3304 | /* There are three cases where the shape of *AD.INNER may now be invalid: |
bd3d34d4 RS |
3305 | |
3306 | 1) the original address was valid, but either elimination or | |
5a107a0f VM |
3307 | equiv_address_substitution was applied and that made |
3308 | the address invalid. | |
bd3d34d4 RS |
3309 | |
3310 | 2) the address is an invalid symbolic address created by | |
5a107a0f | 3311 | force_const_to_mem. |
bd3d34d4 RS |
3312 | |
3313 | 3) the address is a frame address with an invalid offset. | |
3314 | ||
c31d2d11 RS |
3315 | 4) the address is a frame address with an invalid base. |
3316 | ||
2c62cbaa VM |
3317 | All these cases involve a non-autoinc address, so there is no |
3318 | point revalidating other types. */ | |
3319 | if (ad.autoinc_p || valid_address_p (&ad)) | |
55a2c322 VM |
3320 | return change_p; |
3321 | ||
bd3d34d4 RS |
3322 | /* Any index existed before LRA started, so we can assume that the |
3323 | presence and shape of the index is valid. */ | |
55a2c322 | 3324 | push_to_sequence (*before); |
2c62cbaa | 3325 | lra_assert (ad.disp == ad.disp_term); |
277f65de | 3326 | if (ad.base == NULL) |
55a2c322 | 3327 | { |
277f65de | 3328 | if (ad.index == NULL) |
55a2c322 | 3329 | { |
95831c01 VM |
3330 | rtx_insn *insn; |
3331 | rtx_insn *last = get_last_insn (); | |
55a2c322 | 3332 | int code = -1; |
277f65de RS |
3333 | enum reg_class cl = base_reg_class (ad.mode, ad.as, |
3334 | SCRATCH, SCRATCH); | |
2c62cbaa | 3335 | rtx addr = *ad.inner; |
277f65de | 3336 | |
2c62cbaa | 3337 | new_reg = lra_create_new_reg (Pmode, NULL_RTX, cl, "addr"); |
d0b2266a TS |
3338 | if (HAVE_lo_sum) |
3339 | { | |
d0b2266a TS |
3340 | /* addr => lo_sum (new_base, addr), case (2) above. */ |
3341 | insn = emit_insn (gen_rtx_SET | |
3342 | (new_reg, | |
3343 | gen_rtx_HIGH (Pmode, copy_rtx (addr)))); | |
3344 | code = recog_memoized (insn); | |
3345 | if (code >= 0) | |
3346 | { | |
3347 | *ad.inner = gen_rtx_LO_SUM (Pmode, new_reg, addr); | |
3348 | if (! valid_address_p (ad.mode, *ad.outer, ad.as)) | |
3349 | { | |
3350 | /* Try to put lo_sum into register. */ | |
3351 | insn = emit_insn (gen_rtx_SET | |
3352 | (new_reg, | |
3353 | gen_rtx_LO_SUM (Pmode, new_reg, addr))); | |
3354 | code = recog_memoized (insn); | |
3355 | if (code >= 0) | |
3356 | { | |
3357 | *ad.inner = new_reg; | |
3358 | if (! valid_address_p (ad.mode, *ad.outer, ad.as)) | |
3359 | { | |
3360 | *ad.inner = addr; | |
3361 | code = -1; | |
3362 | } | |
3363 | } | |
3364 | ||
3365 | } | |
3366 | } | |
3367 | if (code < 0) | |
3368 | delete_insns_since (last); | |
3369 | } | |
3370 | ||
55a2c322 VM |
3371 | if (code < 0) |
3372 | { | |
2c62cbaa VM |
3373 | /* addr => new_base, case (2) above. */ |
3374 | lra_emit_move (new_reg, addr); | |
95831c01 VM |
3375 | |
3376 | for (insn = last == NULL_RTX ? get_insns () : NEXT_INSN (last); | |
3377 | insn != NULL_RTX; | |
3378 | insn = NEXT_INSN (insn)) | |
3379 | if (recog_memoized (insn) < 0) | |
3380 | break; | |
3381 | if (insn != NULL_RTX) | |
3382 | { | |
3383 | /* Do nothing if we cannot generate right insns. | |
9c582551 | 3384 | This is analogous to reload pass behavior. */ |
95831c01 VM |
3385 | delete_insns_since (last); |
3386 | end_sequence (); | |
3387 | return false; | |
3388 | } | |
2c62cbaa | 3389 | *ad.inner = new_reg; |
55a2c322 VM |
3390 | } |
3391 | } | |
3392 | else | |
3393 | { | |
bd3d34d4 RS |
3394 | /* index * scale + disp => new base + index * scale, |
3395 | case (1) above. */ | |
277f65de RS |
3396 | enum reg_class cl = base_reg_class (ad.mode, ad.as, PLUS, |
3397 | GET_CODE (*ad.index)); | |
55a2c322 VM |
3398 | |
3399 | lra_assert (INDEX_REG_CLASS != NO_REGS); | |
3400 | new_reg = lra_create_new_reg (Pmode, NULL_RTX, cl, "disp"); | |
277f65de RS |
3401 | lra_emit_move (new_reg, *ad.disp); |
3402 | *ad.inner = simplify_gen_binary (PLUS, GET_MODE (new_reg), | |
3403 | new_reg, *ad.index); | |
55a2c322 VM |
3404 | } |
3405 | } | |
277f65de | 3406 | else if (ad.index == NULL) |
55a2c322 | 3407 | { |
5a107a0f VM |
3408 | int regno; |
3409 | enum reg_class cl; | |
cfa434f6 DM |
3410 | rtx set; |
3411 | rtx_insn *insns, *last_insn; | |
c31d2d11 RS |
3412 | /* Try to reload base into register only if the base is invalid |
3413 | for the address but with valid offset, case (4) above. */ | |
3414 | start_sequence (); | |
3415 | new_reg = base_to_reg (&ad); | |
3416 | ||
bd3d34d4 | 3417 | /* base + disp => new base, cases (1) and (3) above. */ |
55a2c322 VM |
3418 | /* Another option would be to reload the displacement into an |
3419 | index register. However, postreload has code to optimize | |
3420 | address reloads that have the same base and different | |
3421 | displacements, so reloading into an index register would | |
3422 | not necessarily be a win. */ | |
c31d2d11 | 3423 | if (new_reg == NULL_RTX) |
9005477f RS |
3424 | { |
3425 | /* See if the target can split the displacement into a | |
3426 | legitimate new displacement from a local anchor. */ | |
3427 | gcc_assert (ad.disp == ad.disp_term); | |
3428 | poly_int64 orig_offset; | |
3429 | rtx offset1, offset2; | |
3430 | if (poly_int_rtx_p (*ad.disp, &orig_offset) | |
3431 | && targetm.legitimize_address_displacement (&offset1, &offset2, | |
3432 | orig_offset, | |
3433 | ad.mode)) | |
3434 | { | |
3435 | new_reg = base_plus_disp_to_reg (&ad, offset1); | |
3436 | new_reg = gen_rtx_PLUS (GET_MODE (new_reg), new_reg, offset2); | |
3437 | } | |
3438 | else | |
3439 | new_reg = base_plus_disp_to_reg (&ad, *ad.disp); | |
3440 | } | |
5a107a0f VM |
3441 | insns = get_insns (); |
3442 | last_insn = get_last_insn (); | |
3443 | /* If we generated at least two insns, try last insn source as | |
3444 | an address. If we succeed, we generate one less insn. */ | |
9005477f RS |
3445 | if (REG_P (new_reg) |
3446 | && last_insn != insns | |
3447 | && (set = single_set (last_insn)) != NULL_RTX | |
5a107a0f VM |
3448 | && GET_CODE (SET_SRC (set)) == PLUS |
3449 | && REG_P (XEXP (SET_SRC (set), 0)) | |
3450 | && CONSTANT_P (XEXP (SET_SRC (set), 1))) | |
3451 | { | |
3452 | *ad.inner = SET_SRC (set); | |
3453 | if (valid_address_p (ad.mode, *ad.outer, ad.as)) | |
3454 | { | |
3455 | *ad.base_term = XEXP (SET_SRC (set), 0); | |
3456 | *ad.disp_term = XEXP (SET_SRC (set), 1); | |
3457 | cl = base_reg_class (ad.mode, ad.as, ad.base_outer_code, | |
3458 | get_index_code (&ad)); | |
3459 | regno = REGNO (*ad.base_term); | |
3460 | if (regno >= FIRST_PSEUDO_REGISTER | |
3461 | && cl != lra_get_allocno_class (regno)) | |
a2d0d374 | 3462 | lra_change_class (regno, cl, " Change to", true); |
5a107a0f VM |
3463 | new_reg = SET_SRC (set); |
3464 | delete_insns_since (PREV_INSN (last_insn)); | |
3465 | } | |
3466 | } | |
3467 | end_sequence (); | |
3468 | emit_insn (insns); | |
277f65de | 3469 | *ad.inner = new_reg; |
55a2c322 | 3470 | } |
6e071b1e | 3471 | else if (ad.disp_term != NULL) |
55a2c322 | 3472 | { |
bd3d34d4 RS |
3473 | /* base + scale * index + disp => new base + scale * index, |
3474 | case (1) above. */ | |
9005477f RS |
3475 | gcc_assert (ad.disp == ad.disp_term); |
3476 | new_reg = base_plus_disp_to_reg (&ad, *ad.disp); | |
277f65de RS |
3477 | *ad.inner = simplify_gen_binary (PLUS, GET_MODE (new_reg), |
3478 | new_reg, *ad.index); | |
55a2c322 | 3479 | } |
bc2fc1f3 | 3480 | else if ((scale = get_index_scale (&ad)) == 1) |
5a770e01 VM |
3481 | { |
3482 | /* The last transformation to one reg will be made in | |
3483 | curr_insn_transform function. */ | |
3484 | end_sequence (); | |
3485 | return false; | |
3486 | } | |
bc2fc1f3 | 3487 | else if (scale != 0) |
6e071b1e VM |
3488 | { |
3489 | /* base + scale * index => base + new_reg, | |
3490 | case (1) above. | |
3491 | Index part of address may become invalid. For example, we | |
3492 | changed pseudo on the equivalent memory and a subreg of the | |
3493 | pseudo onto the memory of different mode for which the scale is | |
3494 | prohibitted. */ | |
3495 | new_reg = index_part_to_reg (&ad); | |
3496 | *ad.inner = simplify_gen_binary (PLUS, GET_MODE (new_reg), | |
3497 | *ad.base_term, new_reg); | |
3498 | } | |
bc2fc1f3 VM |
3499 | else |
3500 | { | |
3501 | enum reg_class cl = base_reg_class (ad.mode, ad.as, | |
3502 | SCRATCH, SCRATCH); | |
3503 | rtx addr = *ad.inner; | |
3504 | ||
3505 | new_reg = lra_create_new_reg (Pmode, NULL_RTX, cl, "addr"); | |
3506 | /* addr => new_base. */ | |
3507 | lra_emit_move (new_reg, addr); | |
3508 | *ad.inner = new_reg; | |
3509 | } | |
55a2c322 VM |
3510 | *before = get_insns (); |
3511 | end_sequence (); | |
3512 | return true; | |
3513 | } | |
3514 | ||
d9cf932c VM |
3515 | /* If CHECK_ONLY_P is false, do address reloads until it is necessary. |
3516 | Use process_address_1 as a helper function. Return true for any | |
3517 | RTL changes. | |
3518 | ||
3519 | If CHECK_ONLY_P is true, just check address correctness. Return | |
3520 | false if the address correct. */ | |
cc8849a1 | 3521 | static bool |
d9cf932c VM |
3522 | process_address (int nop, bool check_only_p, |
3523 | rtx_insn **before, rtx_insn **after) | |
cc8849a1 VM |
3524 | { |
3525 | bool res = false; | |
3526 | ||
d9cf932c VM |
3527 | while (process_address_1 (nop, check_only_p, before, after)) |
3528 | { | |
3529 | if (check_only_p) | |
3530 | return true; | |
3531 | res = true; | |
3532 | } | |
cc8849a1 VM |
3533 | return res; |
3534 | } | |
3535 | ||
55a2c322 VM |
3536 | /* Emit insns to reload VALUE into a new register. VALUE is an |
3537 | auto-increment or auto-decrement RTX whose operand is a register or | |
3538 | memory location; so reloading involves incrementing that location. | |
3539 | IN is either identical to VALUE, or some cheaper place to reload | |
3540 | value being incremented/decremented from. | |
3541 | ||
3542 | INC_AMOUNT is the number to increment or decrement by (always | |
3543 | positive and ignored for POST_MODIFY/PRE_MODIFY). | |
3544 | ||
3545 | Return pseudo containing the result. */ | |
3546 | static rtx | |
31ae0e43 | 3547 | emit_inc (enum reg_class new_rclass, rtx in, rtx value, poly_int64 inc_amount) |
55a2c322 VM |
3548 | { |
3549 | /* REG or MEM to be copied and incremented. */ | |
3550 | rtx incloc = XEXP (value, 0); | |
3551 | /* Nonzero if increment after copying. */ | |
3552 | int post = (GET_CODE (value) == POST_DEC || GET_CODE (value) == POST_INC | |
3553 | || GET_CODE (value) == POST_MODIFY); | |
cfa434f6 | 3554 | rtx_insn *last; |
55a2c322 | 3555 | rtx inc; |
647d790d | 3556 | rtx_insn *add_insn; |
55a2c322 VM |
3557 | int code; |
3558 | rtx real_in = in == value ? incloc : in; | |
3559 | rtx result; | |
3560 | bool plus_p = true; | |
3561 | ||
3562 | if (GET_CODE (value) == PRE_MODIFY || GET_CODE (value) == POST_MODIFY) | |
3563 | { | |
3564 | lra_assert (GET_CODE (XEXP (value, 1)) == PLUS | |
3565 | || GET_CODE (XEXP (value, 1)) == MINUS); | |
3566 | lra_assert (rtx_equal_p (XEXP (XEXP (value, 1), 0), XEXP (value, 0))); | |
3567 | plus_p = GET_CODE (XEXP (value, 1)) == PLUS; | |
3568 | inc = XEXP (XEXP (value, 1), 1); | |
3569 | } | |
3570 | else | |
3571 | { | |
3572 | if (GET_CODE (value) == PRE_DEC || GET_CODE (value) == POST_DEC) | |
3573 | inc_amount = -inc_amount; | |
3574 | ||
31ae0e43 | 3575 | inc = gen_int_mode (inc_amount, GET_MODE (value)); |
55a2c322 VM |
3576 | } |
3577 | ||
3578 | if (! post && REG_P (incloc)) | |
3579 | result = incloc; | |
3580 | else | |
3581 | result = lra_create_new_reg (GET_MODE (value), value, new_rclass, | |
3582 | "INC/DEC result"); | |
3583 | ||
3584 | if (real_in != result) | |
3585 | { | |
3586 | /* First copy the location to the result register. */ | |
3587 | lra_assert (REG_P (result)); | |
3588 | emit_insn (gen_move_insn (result, real_in)); | |
3589 | } | |
3590 | ||
3591 | /* We suppose that there are insns to add/sub with the constant | |
3592 | increment permitted in {PRE/POST)_{DEC/INC/MODIFY}. At least the | |
3593 | old reload worked with this assumption. If the assumption | |
3594 | becomes wrong, we should use approach in function | |
3595 | base_plus_disp_to_reg. */ | |
3596 | if (in == value) | |
3597 | { | |
3598 | /* See if we can directly increment INCLOC. */ | |
3599 | last = get_last_insn (); | |
3600 | add_insn = emit_insn (plus_p | |
3601 | ? gen_add2_insn (incloc, inc) | |
3602 | : gen_sub2_insn (incloc, inc)); | |
3603 | ||
3604 | code = recog_memoized (add_insn); | |
3605 | if (code >= 0) | |
3606 | { | |
3607 | if (! post && result != incloc) | |
3608 | emit_insn (gen_move_insn (result, incloc)); | |
3609 | return result; | |
3610 | } | |
3611 | delete_insns_since (last); | |
3612 | } | |
3613 | ||
3614 | /* If couldn't do the increment directly, must increment in RESULT. | |
3615 | The way we do this depends on whether this is pre- or | |
3616 | post-increment. For pre-increment, copy INCLOC to the reload | |
3617 | register, increment it there, then save back. */ | |
3618 | if (! post) | |
3619 | { | |
3620 | if (real_in != result) | |
3621 | emit_insn (gen_move_insn (result, real_in)); | |
3622 | if (plus_p) | |
3623 | emit_insn (gen_add2_insn (result, inc)); | |
3624 | else | |
3625 | emit_insn (gen_sub2_insn (result, inc)); | |
3626 | if (result != incloc) | |
3627 | emit_insn (gen_move_insn (incloc, result)); | |
3628 | } | |
3629 | else | |
3630 | { | |
3631 | /* Post-increment. | |
3632 | ||
3633 | Because this might be a jump insn or a compare, and because | |
3634 | RESULT may not be available after the insn in an input | |
3635 | reload, we must do the incrementing before the insn being | |
3636 | reloaded for. | |
3637 | ||
3638 | We have already copied IN to RESULT. Increment the copy in | |
3639 | RESULT, save that back, then decrement RESULT so it has | |
3640 | the original value. */ | |
3641 | if (plus_p) | |
3642 | emit_insn (gen_add2_insn (result, inc)); | |
3643 | else | |
3644 | emit_insn (gen_sub2_insn (result, inc)); | |
3645 | emit_insn (gen_move_insn (incloc, result)); | |
3646 | /* Restore non-modified value for the result. We prefer this | |
3647 | way because it does not require an additional hard | |
3648 | register. */ | |
3649 | if (plus_p) | |
3650 | { | |
73ca989c RS |
3651 | poly_int64 offset; |
3652 | if (poly_int_rtx_p (inc, &offset)) | |
69db2d57 | 3653 | emit_insn (gen_add2_insn (result, |
73ca989c | 3654 | gen_int_mode (-offset, |
69db2d57 | 3655 | GET_MODE (result)))); |
55a2c322 VM |
3656 | else |
3657 | emit_insn (gen_sub2_insn (result, inc)); | |
3658 | } | |
3659 | else | |
3660 | emit_insn (gen_add2_insn (result, inc)); | |
3661 | } | |
3662 | return result; | |
3663 | } | |
3664 | ||
2c62cbaa VM |
3665 | /* Return true if the current move insn does not need processing as we |
3666 | already know that it satisfies its constraints. */ | |
3667 | static bool | |
3668 | simple_move_p (void) | |
3669 | { | |
3670 | rtx dest, src; | |
3671 | enum reg_class dclass, sclass; | |
3672 | ||
3673 | lra_assert (curr_insn_set != NULL_RTX); | |
3674 | dest = SET_DEST (curr_insn_set); | |
3675 | src = SET_SRC (curr_insn_set); | |
2008be40 SB |
3676 | |
3677 | /* If the instruction has multiple sets we need to process it even if it | |
3678 | is single_set. This can happen if one or more of the SETs are dead. | |
3679 | See PR73650. */ | |
3680 | if (multiple_sets (curr_insn)) | |
3681 | return false; | |
3682 | ||
2c62cbaa VM |
3683 | return ((dclass = get_op_class (dest)) != NO_REGS |
3684 | && (sclass = get_op_class (src)) != NO_REGS | |
3685 | /* The backend guarantees that register moves of cost 2 | |
3686 | never need reloads. */ | |
03b9b5ce | 3687 | && targetm.register_move_cost (GET_MODE (src), sclass, dclass) == 2); |
2c62cbaa VM |
3688 | } |
3689 | ||
55a2c322 VM |
3690 | /* Swap operands NOP and NOP + 1. */ |
3691 | static inline void | |
3692 | swap_operands (int nop) | |
3693 | { | |
fab27f52 MM |
3694 | std::swap (curr_operand_mode[nop], curr_operand_mode[nop + 1]); |
3695 | std::swap (original_subreg_reg_mode[nop], original_subreg_reg_mode[nop + 1]); | |
3696 | std::swap (*curr_id->operand_loc[nop], *curr_id->operand_loc[nop + 1]); | |
987b67f1 | 3697 | std::swap (equiv_substition_p[nop], equiv_substition_p[nop + 1]); |
55a2c322 VM |
3698 | /* Swap the duplicates too. */ |
3699 | lra_update_dup (curr_id, nop); | |
3700 | lra_update_dup (curr_id, nop + 1); | |
3701 | } | |
3702 | ||
3703 | /* Main entry point of the constraint code: search the body of the | |
3704 | current insn to choose the best alternative. It is mimicking insn | |
3705 | alternative cost calculation model of former reload pass. That is | |
3706 | because machine descriptions were written to use this model. This | |
3707 | model can be changed in future. Make commutative operand exchange | |
3708 | if it is chosen. | |
3709 | ||
d9cf932c VM |
3710 | if CHECK_ONLY_P is false, do RTL changes to satisfy the |
3711 | constraints. Return true if any change happened during function | |
3712 | call. | |
3713 | ||
3714 | If CHECK_ONLY_P is true then don't do any transformation. Just | |
3715 | check that the insn satisfies all constraints. If the insn does | |
3716 | not satisfy any constraint, return true. */ | |
55a2c322 | 3717 | static bool |
d9cf932c | 3718 | curr_insn_transform (bool check_only_p) |
55a2c322 VM |
3719 | { |
3720 | int i, j, k; | |
3721 | int n_operands; | |
3722 | int n_alternatives; | |
aefae0f1 | 3723 | int n_outputs; |
55a2c322 VM |
3724 | int commutative; |
3725 | signed char goal_alt_matched[MAX_RECOG_OPERANDS][MAX_RECOG_OPERANDS]; | |
511dcace | 3726 | signed char match_inputs[MAX_RECOG_OPERANDS + 1]; |
aefae0f1 | 3727 | signed char outputs[MAX_RECOG_OPERANDS + 1]; |
cfa434f6 | 3728 | rtx_insn *before, *after; |
55a2c322 VM |
3729 | bool alt_p = false; |
3730 | /* Flag that the insn has been changed through a transformation. */ | |
3731 | bool change_p; | |
3732 | bool sec_mem_p; | |
55a2c322 | 3733 | bool use_sec_mem_p; |
55a2c322 VM |
3734 | int max_regno_before; |
3735 | int reused_alternative_num; | |
3736 | ||
2c62cbaa VM |
3737 | curr_insn_set = single_set (curr_insn); |
3738 | if (curr_insn_set != NULL_RTX && simple_move_p ()) | |
3739 | return false; | |
3740 | ||
55a2c322 VM |
3741 | no_input_reloads_p = no_output_reloads_p = false; |
3742 | goal_alt_number = -1; | |
2c62cbaa | 3743 | change_p = sec_mem_p = false; |
55a2c322 VM |
3744 | /* JUMP_INSNs and CALL_INSNs are not allowed to have any output |
3745 | reloads; neither are insns that SET cc0. Insns that use CC0 are | |
3746 | not allowed to have any input reloads. */ | |
3747 | if (JUMP_P (curr_insn) || CALL_P (curr_insn)) | |
3748 | no_output_reloads_p = true; | |
3749 | ||
058eb3b0 | 3750 | if (HAVE_cc0 && reg_referenced_p (cc0_rtx, PATTERN (curr_insn))) |
55a2c322 | 3751 | no_input_reloads_p = true; |
058eb3b0 | 3752 | if (HAVE_cc0 && reg_set_p (cc0_rtx, PATTERN (curr_insn))) |
55a2c322 | 3753 | no_output_reloads_p = true; |
55a2c322 VM |
3754 | |
3755 | n_operands = curr_static_id->n_operands; | |
3756 | n_alternatives = curr_static_id->n_alternatives; | |
3757 | ||
3758 | /* Just return "no reloads" if insn has no operands with | |
3759 | constraints. */ | |
3760 | if (n_operands == 0 || n_alternatives == 0) | |
3761 | return false; | |
3762 | ||
3763 | max_regno_before = max_reg_num (); | |
3764 | ||
3765 | for (i = 0; i < n_operands; i++) | |
3766 | { | |
3767 | goal_alt_matched[i][0] = -1; | |
3768 | goal_alt_matches[i] = -1; | |
3769 | } | |
3770 | ||
3771 | commutative = curr_static_id->commutative; | |
3772 | ||
3773 | /* Now see what we need for pseudos that didn't get hard regs or got | |
3774 | the wrong kind of hard reg. For this, we must consider all the | |
3775 | operands together against the register constraints. */ | |
3776 | ||
821b7577 | 3777 | best_losers = best_overall = INT_MAX; |
36ff9dfb | 3778 | best_reload_sum = 0; |
55a2c322 VM |
3779 | |
3780 | curr_swapped = false; | |
3781 | goal_alt_swapped = false; | |
3782 | ||
d9cf932c VM |
3783 | if (! check_only_p) |
3784 | /* Make equivalence substitution and memory subreg elimination | |
3785 | before address processing because an address legitimacy can | |
3786 | depend on memory mode. */ | |
3787 | for (i = 0; i < n_operands; i++) | |
3788 | { | |
0b87be09 | 3789 | rtx op, subst, old; |
d9cf932c | 3790 | bool op_change_p = false; |
0b87be09 VM |
3791 | |
3792 | if (curr_static_id->operand[i].is_operator) | |
3793 | continue; | |
d9cf932c | 3794 | |
0b87be09 | 3795 | old = op = *curr_id->operand_loc[i]; |
d9cf932c VM |
3796 | if (GET_CODE (old) == SUBREG) |
3797 | old = SUBREG_REG (old); | |
3798 | subst = get_equiv_with_elimination (old, curr_insn); | |
895ff86f | 3799 | original_subreg_reg_mode[i] = VOIDmode; |
987b67f1 | 3800 | equiv_substition_p[i] = false; |
d9cf932c VM |
3801 | if (subst != old) |
3802 | { | |
987b67f1 | 3803 | equiv_substition_p[i] = true; |
d9cf932c VM |
3804 | subst = copy_rtx (subst); |
3805 | lra_assert (REG_P (old)); | |
895ff86f | 3806 | if (GET_CODE (op) != SUBREG) |
d9cf932c | 3807 | *curr_id->operand_loc[i] = subst; |
895ff86f VM |
3808 | else |
3809 | { | |
3810 | SUBREG_REG (op) = subst; | |
3811 | if (GET_MODE (subst) == VOIDmode) | |
3812 | original_subreg_reg_mode[i] = GET_MODE (old); | |
3813 | } | |
d9cf932c VM |
3814 | if (lra_dump_file != NULL) |
3815 | { | |
3816 | fprintf (lra_dump_file, | |
3817 | "Changing pseudo %d in operand %i of insn %u on equiv ", | |
3818 | REGNO (old), i, INSN_UID (curr_insn)); | |
3819 | dump_value_slim (lra_dump_file, subst, 1); | |
895ff86f | 3820 | fprintf (lra_dump_file, "\n"); |
d9cf932c VM |
3821 | } |
3822 | op_change_p = change_p = true; | |
3823 | } | |
3824 | if (simplify_operand_subreg (i, GET_MODE (old)) || op_change_p) | |
3825 | { | |
3826 | change_p = true; | |
3827 | lra_update_dup (curr_id, i); | |
3828 | } | |
3829 | } | |
55a2c322 VM |
3830 | |
3831 | /* Reload address registers and displacements. We do it before | |
3832 | finding an alternative because of memory constraints. */ | |
cfa434f6 | 3833 | before = after = NULL; |
55a2c322 VM |
3834 | for (i = 0; i < n_operands; i++) |
3835 | if (! curr_static_id->operand[i].is_operator | |
d9cf932c | 3836 | && process_address (i, check_only_p, &before, &after)) |
55a2c322 | 3837 | { |
d9cf932c VM |
3838 | if (check_only_p) |
3839 | return true; | |
55a2c322 VM |
3840 | change_p = true; |
3841 | lra_update_dup (curr_id, i); | |
3842 | } | |
cc8849a1 | 3843 | |
55a2c322 VM |
3844 | if (change_p) |
3845 | /* If we've changed the instruction then any alternative that | |
3846 | we chose previously may no longer be valid. */ | |
3847 | lra_set_used_insn_alternative (curr_insn, -1); | |
3848 | ||
d9cf932c | 3849 | if (! check_only_p && curr_insn_set != NULL_RTX |
2c62cbaa VM |
3850 | && check_and_process_move (&change_p, &sec_mem_p)) |
3851 | return change_p; | |
3852 | ||
55a2c322 VM |
3853 | try_swapped: |
3854 | ||
d9cf932c | 3855 | reused_alternative_num = check_only_p ? -1 : curr_id->used_insn_alternative; |
55a2c322 VM |
3856 | if (lra_dump_file != NULL && reused_alternative_num >= 0) |
3857 | fprintf (lra_dump_file, "Reusing alternative %d for insn #%u\n", | |
3858 | reused_alternative_num, INSN_UID (curr_insn)); | |
3859 | ||
3860 | if (process_alt_operands (reused_alternative_num)) | |
3861 | alt_p = true; | |
3862 | ||
d9cf932c VM |
3863 | if (check_only_p) |
3864 | return ! alt_p || best_losers != 0; | |
3865 | ||
55a2c322 VM |
3866 | /* If insn is commutative (it's safe to exchange a certain pair of |
3867 | operands) then we need to try each alternative twice, the second | |
3868 | time matching those two operands as if we had exchanged them. To | |
3869 | do this, really exchange them in operands. | |
3870 | ||
3871 | If we have just tried the alternatives the second time, return | |
3872 | operands to normal and drop through. */ | |
3873 | ||
3874 | if (reused_alternative_num < 0 && commutative >= 0) | |
3875 | { | |
3876 | curr_swapped = !curr_swapped; | |
3877 | if (curr_swapped) | |
3878 | { | |
3879 | swap_operands (commutative); | |
3880 | goto try_swapped; | |
3881 | } | |
3882 | else | |
3883 | swap_operands (commutative); | |
3884 | } | |
3885 | ||
55a2c322 VM |
3886 | if (! alt_p && ! sec_mem_p) |
3887 | { | |
3888 | /* No alternative works with reloads?? */ | |
3889 | if (INSN_CODE (curr_insn) >= 0) | |
3890 | fatal_insn ("unable to generate reloads for:", curr_insn); | |
3891 | error_for_asm (curr_insn, | |
3892 | "inconsistent operand constraints in an %<asm%>"); | |
8b4aea73 VM |
3893 | /* Avoid further trouble with this insn. Don't generate use |
3894 | pattern here as we could use the insn SP offset. */ | |
3895 | lra_set_insn_deleted (curr_insn); | |
55a2c322 VM |
3896 | return true; |
3897 | } | |
3898 | ||
3899 | /* If the best alternative is with operands 1 and 2 swapped, swap | |
3900 | them. Update the operand numbers of any reloads already | |
3901 | pushed. */ | |
3902 | ||
3903 | if (goal_alt_swapped) | |
3904 | { | |
3905 | if (lra_dump_file != NULL) | |
3906 | fprintf (lra_dump_file, " Commutative operand exchange in insn %u\n", | |
3907 | INSN_UID (curr_insn)); | |
3908 | ||
3909 | /* Swap the duplicates too. */ | |
3910 | swap_operands (commutative); | |
3911 | change_p = true; | |
3912 | } | |
3913 | ||
f15643d4 | 3914 | /* Some targets' TARGET_SECONDARY_MEMORY_NEEDED (e.g. x86) are defined |
55a2c322 VM |
3915 | too conservatively. So we use the secondary memory only if there |
3916 | is no any alternative without reloads. */ | |
3917 | use_sec_mem_p = false; | |
3918 | if (! alt_p) | |
3919 | use_sec_mem_p = true; | |
3920 | else if (sec_mem_p) | |
3921 | { | |
3922 | for (i = 0; i < n_operands; i++) | |
3923 | if (! goal_alt_win[i] && ! goal_alt_match_win[i]) | |
3924 | break; | |
3925 | use_sec_mem_p = i < n_operands; | |
3926 | } | |
3927 | ||
3928 | if (use_sec_mem_p) | |
3929 | { | |
e03dd765 | 3930 | int in = -1, out = -1; |
89d56d79 | 3931 | rtx new_reg, src, dest, rld; |
ef4bddc2 | 3932 | machine_mode sec_mode, rld_mode; |
55a2c322 | 3933 | |
e03dd765 VM |
3934 | lra_assert (curr_insn_set != NULL_RTX && sec_mem_p); |
3935 | dest = SET_DEST (curr_insn_set); | |
3936 | src = SET_SRC (curr_insn_set); | |
3937 | for (i = 0; i < n_operands; i++) | |
3938 | if (*curr_id->operand_loc[i] == dest) | |
3939 | out = i; | |
3940 | else if (*curr_id->operand_loc[i] == src) | |
3941 | in = i; | |
3942 | for (i = 0; i < curr_static_id->n_dups; i++) | |
3943 | if (out < 0 && *curr_id->dup_loc[i] == dest) | |
3944 | out = curr_static_id->dup_num[i]; | |
3945 | else if (in < 0 && *curr_id->dup_loc[i] == src) | |
3946 | in = curr_static_id->dup_num[i]; | |
3947 | lra_assert (out >= 0 && in >= 0 | |
3948 | && curr_static_id->operand[out].type == OP_OUT | |
3949 | && curr_static_id->operand[in].type == OP_IN); | |
bd4288c0 | 3950 | rld = partial_subreg_p (GET_MODE (src), GET_MODE (dest)) ? src : dest; |
66aa7879 | 3951 | rld_mode = GET_MODE (rld); |
94e23f53 | 3952 | sec_mode = targetm.secondary_memory_needed_mode (rld_mode); |
55a2c322 VM |
3953 | new_reg = lra_create_new_reg (sec_mode, NULL_RTX, |
3954 | NO_REGS, "secondary"); | |
3955 | /* If the mode is changed, it should be wider. */ | |
bd4288c0 | 3956 | lra_assert (!partial_subreg_p (sec_mode, rld_mode)); |
89d56d79 VM |
3957 | if (sec_mode != rld_mode) |
3958 | { | |
3959 | /* If the target says specifically to use another mode for | |
3960 | secondary memory moves we can not reuse the original | |
3961 | insn. */ | |
1ccd4874 | 3962 | after = emit_spill_move (false, new_reg, dest); |
cfa434f6 | 3963 | lra_process_new_insns (curr_insn, NULL, after, |
1ccd4874 VM |
3964 | "Inserting the sec. move"); |
3965 | /* We may have non null BEFORE here (e.g. after address | |
3966 | processing. */ | |
3967 | push_to_sequence (before); | |
3968 | before = emit_spill_move (true, new_reg, src); | |
3969 | emit_insn (before); | |
3970 | before = get_insns (); | |
3971 | end_sequence (); | |
cfa434f6 | 3972 | lra_process_new_insns (curr_insn, before, NULL, "Changing on"); |
1ccd4874 VM |
3973 | lra_set_insn_deleted (curr_insn); |
3974 | } | |
89d56d79 | 3975 | else if (dest == rld) |
1ccd4874 | 3976 | { |
e03dd765 VM |
3977 | *curr_id->operand_loc[out] = new_reg; |
3978 | lra_update_dup (curr_id, out); | |
66aa7879 | 3979 | after = emit_spill_move (false, new_reg, dest); |
cfa434f6 | 3980 | lra_process_new_insns (curr_insn, NULL, after, |
66aa7879 VM |
3981 | "Inserting the sec. move"); |
3982 | } | |
3983 | else | |
3984 | { | |
e03dd765 VM |
3985 | *curr_id->operand_loc[in] = new_reg; |
3986 | lra_update_dup (curr_id, in); | |
1ccd4874 VM |
3987 | /* See comments above. */ |
3988 | push_to_sequence (before); | |
66aa7879 | 3989 | before = emit_spill_move (true, new_reg, src); |
1ccd4874 VM |
3990 | emit_insn (before); |
3991 | before = get_insns (); | |
3992 | end_sequence (); | |
cfa434f6 | 3993 | lra_process_new_insns (curr_insn, before, NULL, |
66aa7879 VM |
3994 | "Inserting the sec. move"); |
3995 | } | |
3996 | lra_update_insn_regno_info (curr_insn); | |
55a2c322 VM |
3997 | return true; |
3998 | } | |
55a2c322 VM |
3999 | |
4000 | lra_assert (goal_alt_number >= 0); | |
4001 | lra_set_used_insn_alternative (curr_insn, goal_alt_number); | |
4002 | ||
4003 | if (lra_dump_file != NULL) | |
4004 | { | |
4005 | const char *p; | |
4006 | ||
4007 | fprintf (lra_dump_file, " Choosing alt %d in insn %u:", | |
4008 | goal_alt_number, INSN_UID (curr_insn)); | |
4009 | for (i = 0; i < n_operands; i++) | |
4010 | { | |
4011 | p = (curr_static_id->operand_alternative | |
4012 | [goal_alt_number * n_operands + i].constraint); | |
4013 | if (*p == '\0') | |
4014 | continue; | |
4015 | fprintf (lra_dump_file, " (%d) ", i); | |
4016 | for (; *p != '\0' && *p != ',' && *p != '#'; p++) | |
4017 | fputc (*p, lra_dump_file); | |
4018 | } | |
36ff9dfb VM |
4019 | if (INSN_CODE (curr_insn) >= 0 |
4020 | && (p = get_insn_name (INSN_CODE (curr_insn))) != NULL) | |
4021 | fprintf (lra_dump_file, " {%s}", p); | |
73ca989c RS |
4022 | if (maybe_ne (curr_id->sp_offset, 0)) |
4023 | { | |
4024 | fprintf (lra_dump_file, " (sp_off="); | |
4025 | print_dec (curr_id->sp_offset, lra_dump_file); | |
4026 | fprintf (lra_dump_file, ")"); | |
4027 | } | |
4028 | fprintf (lra_dump_file, "\n"); | |
55a2c322 VM |
4029 | } |
4030 | ||
4031 | /* Right now, for any pair of operands I and J that are required to | |
4032 | match, with J < I, goal_alt_matches[I] is J. Add I to | |
4033 | goal_alt_matched[J]. */ | |
f4eafc30 | 4034 | |
55a2c322 VM |
4035 | for (i = 0; i < n_operands; i++) |
4036 | if ((j = goal_alt_matches[i]) >= 0) | |
4037 | { | |
4038 | for (k = 0; goal_alt_matched[j][k] >= 0; k++) | |
4039 | ; | |
4040 | /* We allow matching one output operand and several input | |
4041 | operands. */ | |
4042 | lra_assert (k == 0 | |
4043 | || (curr_static_id->operand[j].type == OP_OUT | |
4044 | && curr_static_id->operand[i].type == OP_IN | |
4045 | && (curr_static_id->operand | |
4046 | [goal_alt_matched[j][0]].type == OP_IN))); | |
4047 | goal_alt_matched[j][k] = i; | |
4048 | goal_alt_matched[j][k + 1] = -1; | |
4049 | } | |
f4eafc30 | 4050 | |
55a2c322 VM |
4051 | for (i = 0; i < n_operands; i++) |
4052 | goal_alt_win[i] |= goal_alt_match_win[i]; | |
f4eafc30 | 4053 | |
55a2c322 VM |
4054 | /* Any constants that aren't allowed and can't be reloaded into |
4055 | registers are here changed into memory references. */ | |
4056 | for (i = 0; i < n_operands; i++) | |
4057 | if (goal_alt_win[i]) | |
4058 | { | |
4059 | int regno; | |
4060 | enum reg_class new_class; | |
4061 | rtx reg = *curr_id->operand_loc[i]; | |
4062 | ||
4063 | if (GET_CODE (reg) == SUBREG) | |
4064 | reg = SUBREG_REG (reg); | |
f4eafc30 | 4065 | |
55a2c322 VM |
4066 | if (REG_P (reg) && (regno = REGNO (reg)) >= FIRST_PSEUDO_REGISTER) |
4067 | { | |
4068 | bool ok_p = in_class_p (reg, goal_alt[i], &new_class); | |
4069 | ||
4070 | if (new_class != NO_REGS && get_reg_class (regno) != new_class) | |
4071 | { | |
4072 | lra_assert (ok_p); | |
a2d0d374 | 4073 | lra_change_class (regno, new_class, " Change to", true); |
55a2c322 VM |
4074 | } |
4075 | } | |
4076 | } | |
4077 | else | |
4078 | { | |
4079 | const char *constraint; | |
4080 | char c; | |
4081 | rtx op = *curr_id->operand_loc[i]; | |
4082 | rtx subreg = NULL_RTX; | |
ef4bddc2 | 4083 | machine_mode mode = curr_operand_mode[i]; |
f4eafc30 | 4084 | |
55a2c322 VM |
4085 | if (GET_CODE (op) == SUBREG) |
4086 | { | |
4087 | subreg = op; | |
4088 | op = SUBREG_REG (op); | |
4089 | mode = GET_MODE (op); | |
4090 | } | |
f4eafc30 | 4091 | |
55a2c322 VM |
4092 | if (CONST_POOL_OK_P (mode, op) |
4093 | && ((targetm.preferred_reload_class | |
4094 | (op, (enum reg_class) goal_alt[i]) == NO_REGS) | |
4095 | || no_input_reloads_p)) | |
4096 | { | |
4097 | rtx tem = force_const_mem (mode, op); | |
f4eafc30 | 4098 | |
55a2c322 VM |
4099 | change_p = true; |
4100 | if (subreg != NULL_RTX) | |
4101 | tem = gen_rtx_SUBREG (mode, tem, SUBREG_BYTE (subreg)); | |
f4eafc30 | 4102 | |
55a2c322 VM |
4103 | *curr_id->operand_loc[i] = tem; |
4104 | lra_update_dup (curr_id, i); | |
d9cf932c | 4105 | process_address (i, false, &before, &after); |
f4eafc30 | 4106 | |
55a2c322 VM |
4107 | /* If the alternative accepts constant pool refs directly |
4108 | there will be no reload needed at all. */ | |
4109 | if (subreg != NULL_RTX) | |
4110 | continue; | |
4111 | /* Skip alternatives before the one requested. */ | |
4112 | constraint = (curr_static_id->operand_alternative | |
4113 | [goal_alt_number * n_operands + i].constraint); | |
4114 | for (; | |
4115 | (c = *constraint) && c != ',' && c != '#'; | |
4116 | constraint += CONSTRAINT_LEN (c, constraint)) | |
4117 | { | |
777e635f | 4118 | enum constraint_num cn = lookup_constraint (constraint); |
9eb1ca69 VM |
4119 | if ((insn_extra_memory_constraint (cn) |
4120 | || insn_extra_special_memory_constraint (cn)) | |
777e635f | 4121 | && satisfies_memory_constraint_p (tem, cn)) |
55a2c322 | 4122 | break; |
55a2c322 VM |
4123 | } |
4124 | if (c == '\0' || c == ',' || c == '#') | |
4125 | continue; | |
f4eafc30 | 4126 | |
55a2c322 VM |
4127 | goal_alt_win[i] = true; |
4128 | } | |
4129 | } | |
f4eafc30 | 4130 | |
aefae0f1 TP |
4131 | n_outputs = 0; |
4132 | outputs[0] = -1; | |
55a2c322 VM |
4133 | for (i = 0; i < n_operands; i++) |
4134 | { | |
2b778c9d VM |
4135 | int regno; |
4136 | bool optional_p = false; | |
55a2c322 VM |
4137 | rtx old, new_reg; |
4138 | rtx op = *curr_id->operand_loc[i]; | |
4139 | ||
4140 | if (goal_alt_win[i]) | |
4141 | { | |
4142 | if (goal_alt[i] == NO_REGS | |
4143 | && REG_P (op) | |
4144 | /* When we assign NO_REGS it means that we will not | |
4145 | assign a hard register to the scratch pseudo by | |
4146 | assigment pass and the scratch pseudo will be | |
4147 | spilled. Spilled scratch pseudos are transformed | |
4148 | back to scratches at the LRA end. */ | |
6c051d60 VM |
4149 | && lra_former_scratch_operand_p (curr_insn, i) |
4150 | && lra_former_scratch_p (REGNO (op))) | |
deca73f5 VM |
4151 | { |
4152 | int regno = REGNO (op); | |
a2d0d374 | 4153 | lra_change_class (regno, NO_REGS, " Change to", true); |
deca73f5 VM |
4154 | if (lra_get_regno_hard_regno (regno) >= 0) |
4155 | /* We don't have to mark all insn affected by the | |
4156 | spilled pseudo as there is only one such insn, the | |
4157 | current one. */ | |
4158 | reg_renumber[regno] = -1; | |
6c051d60 VM |
4159 | lra_assert (bitmap_single_bit_set_p |
4160 | (&lra_reg_info[REGNO (op)].insn_bitmap)); | |
deca73f5 | 4161 | } |
2b778c9d VM |
4162 | /* We can do an optional reload. If the pseudo got a hard |
4163 | reg, we might improve the code through inheritance. If | |
4164 | it does not get a hard register we coalesce memory/memory | |
4165 | moves later. Ignore move insns to avoid cycling. */ | |
b0681c9e | 4166 | if (! lra_simple_p |
2b778c9d VM |
4167 | && lra_undo_inheritance_iter < LRA_MAX_INHERITANCE_PASSES |
4168 | && goal_alt[i] != NO_REGS && REG_P (op) | |
4169 | && (regno = REGNO (op)) >= FIRST_PSEUDO_REGISTER | |
a2d0d374 | 4170 | && regno < new_regno_start |
b0681c9e | 4171 | && ! lra_former_scratch_p (regno) |
2b778c9d | 4172 | && reg_renumber[regno] < 0 |
3c954213 VM |
4173 | /* Check that the optional reload pseudo will be able to |
4174 | hold given mode value. */ | |
4175 | && ! (prohibited_class_reg_set_mode_p | |
4176 | (goal_alt[i], reg_class_contents[goal_alt[i]], | |
4177 | PSEUDO_REGNO_MODE (regno))) | |
2b778c9d | 4178 | && (curr_insn_set == NULL_RTX |
b0681c9e VM |
4179 | || !((REG_P (SET_SRC (curr_insn_set)) |
4180 | || MEM_P (SET_SRC (curr_insn_set)) | |
4181 | || GET_CODE (SET_SRC (curr_insn_set)) == SUBREG) | |
4182 | && (REG_P (SET_DEST (curr_insn_set)) | |
4183 | || MEM_P (SET_DEST (curr_insn_set)) | |
4184 | || GET_CODE (SET_DEST (curr_insn_set)) == SUBREG)))) | |
2b778c9d VM |
4185 | optional_p = true; |
4186 | else | |
4187 | continue; | |
55a2c322 | 4188 | } |
f4eafc30 | 4189 | |
55a2c322 VM |
4190 | /* Operands that match previous ones have already been handled. */ |
4191 | if (goal_alt_matches[i] >= 0) | |
4192 | continue; | |
4193 | ||
4194 | /* We should not have an operand with a non-offsettable address | |
4195 | appearing where an offsettable address will do. It also may | |
4196 | be a case when the address should be special in other words | |
4197 | not a general one (e.g. it needs no index reg). */ | |
4198 | if (goal_alt_matched[i][0] == -1 && goal_alt_offmemok[i] && MEM_P (op)) | |
4199 | { | |
4200 | enum reg_class rclass; | |
4201 | rtx *loc = &XEXP (op, 0); | |
4202 | enum rtx_code code = GET_CODE (*loc); | |
4203 | ||
4204 | push_to_sequence (before); | |
4205 | rclass = base_reg_class (GET_MODE (op), MEM_ADDR_SPACE (op), | |
4206 | MEM, SCRATCH); | |
4207 | if (GET_RTX_CLASS (code) == RTX_AUTOINC) | |
4208 | new_reg = emit_inc (rclass, *loc, *loc, | |
4209 | /* This value does not matter for MODIFY. */ | |
4210 | GET_MODE_SIZE (GET_MODE (op))); | |
95921002 | 4211 | else if (get_reload_reg (OP_IN, Pmode, *loc, rclass, FALSE, |
55a2c322 VM |
4212 | "offsetable address", &new_reg)) |
4213 | lra_emit_move (new_reg, *loc); | |
4214 | before = get_insns (); | |
4215 | end_sequence (); | |
4216 | *loc = new_reg; | |
4217 | lra_update_dup (curr_id, i); | |
4218 | } | |
4219 | else if (goal_alt_matched[i][0] == -1) | |
4220 | { | |
ef4bddc2 | 4221 | machine_mode mode; |
55a2c322 | 4222 | rtx reg, *loc; |
91914e56 | 4223 | int hard_regno; |
55a2c322 VM |
4224 | enum op_type type = curr_static_id->operand[i].type; |
4225 | ||
4226 | loc = curr_id->operand_loc[i]; | |
4227 | mode = curr_operand_mode[i]; | |
4228 | if (GET_CODE (*loc) == SUBREG) | |
4229 | { | |
4230 | reg = SUBREG_REG (*loc); | |
91914e56 | 4231 | poly_int64 byte = SUBREG_BYTE (*loc); |
55a2c322 | 4232 | if (REG_P (reg) |
8e02e8a0 MF |
4233 | /* Strict_low_part requires reloading the register and not |
4234 | just the subreg. Likewise for a strict subreg no wider | |
4235 | than a word for WORD_REGISTER_OPERATIONS targets. */ | |
55a2c322 | 4236 | && (curr_static_id->operand[i].strict_low |
03a95621 | 4237 | || (!paradoxical_subreg_p (mode, GET_MODE (reg)) |
55a2c322 VM |
4238 | && (hard_regno |
4239 | = get_try_hard_regno (REGNO (reg))) >= 0 | |
4240 | && (simplify_subreg_regno | |
4241 | (hard_regno, | |
4242 | GET_MODE (reg), byte, mode) < 0) | |
4243 | && (goal_alt[i] == NO_REGS | |
4244 | || (simplify_subreg_regno | |
4245 | (ira_class_hard_regs[goal_alt[i]][0], | |
8e02e8a0 | 4246 | GET_MODE (reg), byte, mode) >= 0))) |
e5f83886 | 4247 | || (partial_subreg_p (mode, GET_MODE (reg)) |
cf098191 RS |
4248 | && known_le (GET_MODE_SIZE (GET_MODE (reg)), |
4249 | UNITS_PER_WORD) | |
8e02e8a0 | 4250 | && WORD_REGISTER_OPERATIONS))) |
55a2c322 | 4251 | { |
62cdb862 MF |
4252 | /* An OP_INOUT is required when reloading a subreg of a |
4253 | mode wider than a word to ensure that data beyond the | |
4254 | word being reloaded is preserved. Also automatically | |
4255 | ensure that strict_low_part reloads are made into | |
4256 | OP_INOUT which should already be true from the backend | |
4257 | constraints. */ | |
4258 | if (type == OP_OUT | |
4259 | && (curr_static_id->operand[i].strict_low | |
9eaf97d6 | 4260 | || read_modify_subreg_p (*loc))) |
8b8e23de | 4261 | type = OP_INOUT; |
55a2c322 VM |
4262 | loc = &SUBREG_REG (*loc); |
4263 | mode = GET_MODE (*loc); | |
4264 | } | |
4265 | } | |
4266 | old = *loc; | |
95921002 VM |
4267 | if (get_reload_reg (type, mode, old, goal_alt[i], |
4268 | loc != curr_id->operand_loc[i], "", &new_reg) | |
55a2c322 VM |
4269 | && type != OP_OUT) |
4270 | { | |
4271 | push_to_sequence (before); | |
4272 | lra_emit_move (new_reg, old); | |
4273 | before = get_insns (); | |
4274 | end_sequence (); | |
4275 | } | |
4276 | *loc = new_reg; | |
4277 | if (type != OP_IN | |
4278 | && find_reg_note (curr_insn, REG_UNUSED, old) == NULL_RTX) | |
4279 | { | |
4280 | start_sequence (); | |
4281 | lra_emit_move (type == OP_INOUT ? copy_rtx (old) : old, new_reg); | |
4282 | emit_insn (after); | |
4283 | after = get_insns (); | |
4284 | end_sequence (); | |
4285 | *loc = new_reg; | |
4286 | } | |
4287 | for (j = 0; j < goal_alt_dont_inherit_ops_num; j++) | |
4288 | if (goal_alt_dont_inherit_ops[j] == i) | |
4289 | { | |
4290 | lra_set_regno_unique_value (REGNO (new_reg)); | |
4291 | break; | |
4292 | } | |
4293 | lra_update_dup (curr_id, i); | |
4294 | } | |
4295 | else if (curr_static_id->operand[i].type == OP_IN | |
4296 | && (curr_static_id->operand[goal_alt_matched[i][0]].type | |
57d69a63 VM |
4297 | == OP_OUT |
4298 | || (curr_static_id->operand[goal_alt_matched[i][0]].type | |
4299 | == OP_INOUT | |
4300 | && (operands_match_p | |
4301 | (*curr_id->operand_loc[i], | |
4302 | *curr_id->operand_loc[goal_alt_matched[i][0]], | |
4303 | -1))))) | |
55a2c322 | 4304 | { |
511dcace VM |
4305 | /* generate reloads for input and matched outputs. */ |
4306 | match_inputs[0] = i; | |
4307 | match_inputs[1] = -1; | |
aefae0f1 | 4308 | match_reload (goal_alt_matched[i][0], match_inputs, outputs, |
599e1cf8 VM |
4309 | goal_alt[i], &before, &after, |
4310 | curr_static_id->operand_alternative | |
4311 | [goal_alt_number * n_operands + goal_alt_matched[i][0]] | |
4312 | .earlyclobber); | |
55a2c322 | 4313 | } |
57d69a63 VM |
4314 | else if ((curr_static_id->operand[i].type == OP_OUT |
4315 | || (curr_static_id->operand[i].type == OP_INOUT | |
4316 | && (operands_match_p | |
4317 | (*curr_id->operand_loc[i], | |
4318 | *curr_id->operand_loc[goal_alt_matched[i][0]], | |
4319 | -1)))) | |
55a2c322 | 4320 | && (curr_static_id->operand[goal_alt_matched[i][0]].type |
57d69a63 | 4321 | == OP_IN)) |
511dcace | 4322 | /* Generate reloads for output and matched inputs. */ |
aefae0f1 TP |
4323 | match_reload (i, goal_alt_matched[i], outputs, goal_alt[i], &before, |
4324 | &after, curr_static_id->operand_alternative | |
4325 | [goal_alt_number * n_operands + i].earlyclobber); | |
511dcace VM |
4326 | else if (curr_static_id->operand[i].type == OP_IN |
4327 | && (curr_static_id->operand[goal_alt_matched[i][0]].type | |
4328 | == OP_IN)) | |
4329 | { | |
4330 | /* Generate reloads for matched inputs. */ | |
4331 | match_inputs[0] = i; | |
4332 | for (j = 0; (k = goal_alt_matched[i][j]) >= 0; j++) | |
4333 | match_inputs[j + 1] = k; | |
4334 | match_inputs[j + 1] = -1; | |
aefae0f1 TP |
4335 | match_reload (-1, match_inputs, outputs, goal_alt[i], &before, |
4336 | &after, false); | |
511dcace | 4337 | } |
55a2c322 VM |
4338 | else |
4339 | /* We must generate code in any case when function | |
4340 | process_alt_operands decides that it is possible. */ | |
4341 | gcc_unreachable (); | |
aefae0f1 TP |
4342 | |
4343 | /* Memorise processed outputs so that output remaining to be processed | |
4344 | can avoid using the same register value (see match_reload). */ | |
4345 | if (curr_static_id->operand[i].type == OP_OUT) | |
4346 | { | |
4347 | outputs[n_outputs++] = i; | |
4348 | outputs[n_outputs] = -1; | |
4349 | } | |
4350 | ||
2b778c9d VM |
4351 | if (optional_p) |
4352 | { | |
8a8330b7 VM |
4353 | rtx reg = op; |
4354 | ||
4355 | lra_assert (REG_P (reg)); | |
4356 | regno = REGNO (reg); | |
2b778c9d VM |
4357 | op = *curr_id->operand_loc[i]; /* Substitution. */ |
4358 | if (GET_CODE (op) == SUBREG) | |
4359 | op = SUBREG_REG (op); | |
4360 | gcc_assert (REG_P (op) && (int) REGNO (op) >= new_regno_start); | |
4361 | bitmap_set_bit (&lra_optional_reload_pseudos, REGNO (op)); | |
8a8330b7 | 4362 | lra_reg_info[REGNO (op)].restore_rtx = reg; |
2b778c9d VM |
4363 | if (lra_dump_file != NULL) |
4364 | fprintf (lra_dump_file, | |
4365 | " Making reload reg %d for reg %d optional\n", | |
4366 | REGNO (op), regno); | |
4367 | } | |
55a2c322 VM |
4368 | } |
4369 | if (before != NULL_RTX || after != NULL_RTX | |
4370 | || max_regno_before != max_reg_num ()) | |
4371 | change_p = true; | |
4372 | if (change_p) | |
4373 | { | |
4374 | lra_update_operator_dups (curr_id); | |
4375 | /* Something changes -- process the insn. */ | |
4376 | lra_update_insn_regno_info (curr_insn); | |
4377 | } | |
4378 | lra_process_new_insns (curr_insn, before, after, "Inserting insn reload"); | |
4379 | return change_p; | |
4380 | } | |
4381 | ||
d9cf932c VM |
4382 | /* Return true if INSN satisfies all constraints. In other words, no |
4383 | reload insns are needed. */ | |
4384 | bool | |
4385 | lra_constrain_insn (rtx_insn *insn) | |
4386 | { | |
4387 | int saved_new_regno_start = new_regno_start; | |
4388 | int saved_new_insn_uid_start = new_insn_uid_start; | |
4389 | bool change_p; | |
4390 | ||
4391 | curr_insn = insn; | |
4392 | curr_id = lra_get_insn_recog_data (curr_insn); | |
4393 | curr_static_id = curr_id->insn_static_data; | |
4394 | new_insn_uid_start = get_max_uid (); | |
4395 | new_regno_start = max_reg_num (); | |
4396 | change_p = curr_insn_transform (true); | |
4397 | new_regno_start = saved_new_regno_start; | |
4398 | new_insn_uid_start = saved_new_insn_uid_start; | |
4399 | return ! change_p; | |
4400 | } | |
4401 | ||
55a2c322 VM |
4402 | /* Return true if X is in LIST. */ |
4403 | static bool | |
4404 | in_list_p (rtx x, rtx list) | |
4405 | { | |
4406 | for (; list != NULL_RTX; list = XEXP (list, 1)) | |
4407 | if (XEXP (list, 0) == x) | |
4408 | return true; | |
4409 | return false; | |
4410 | } | |
4411 | ||
4412 | /* Return true if X contains an allocatable hard register (if | |
4413 | HARD_REG_P) or a (spilled if SPILLED_P) pseudo. */ | |
4414 | static bool | |
4415 | contains_reg_p (rtx x, bool hard_reg_p, bool spilled_p) | |
4416 | { | |
4417 | int i, j; | |
4418 | const char *fmt; | |
4419 | enum rtx_code code; | |
4420 | ||
4421 | code = GET_CODE (x); | |
4422 | if (REG_P (x)) | |
4423 | { | |
4424 | int regno = REGNO (x); | |
4425 | HARD_REG_SET alloc_regs; | |
4426 | ||
4427 | if (hard_reg_p) | |
4428 | { | |
4429 | if (regno >= FIRST_PSEUDO_REGISTER) | |
4430 | regno = lra_get_regno_hard_regno (regno); | |
4431 | if (regno < 0) | |
4432 | return false; | |
4433 | COMPL_HARD_REG_SET (alloc_regs, lra_no_alloc_regs); | |
4434 | return overlaps_hard_reg_set_p (alloc_regs, GET_MODE (x), regno); | |
4435 | } | |
4436 | else | |
4437 | { | |
4438 | if (regno < FIRST_PSEUDO_REGISTER) | |
4439 | return false; | |
4440 | if (! spilled_p) | |
4441 | return true; | |
4442 | return lra_get_regno_hard_regno (regno) < 0; | |
4443 | } | |
4444 | } | |
4445 | fmt = GET_RTX_FORMAT (code); | |
4446 | for (i = GET_RTX_LENGTH (code) - 1; i >= 0; i--) | |
4447 | { | |
4448 | if (fmt[i] == 'e') | |
4449 | { | |
4450 | if (contains_reg_p (XEXP (x, i), hard_reg_p, spilled_p)) | |
4451 | return true; | |
4452 | } | |
4453 | else if (fmt[i] == 'E') | |
4454 | { | |
4455 | for (j = XVECLEN (x, i) - 1; j >= 0; j--) | |
4456 | if (contains_reg_p (XVECEXP (x, i, j), hard_reg_p, spilled_p)) | |
4457 | return true; | |
4458 | } | |
4459 | } | |
4460 | return false; | |
4461 | } | |
4462 | ||
28430b2e VM |
4463 | /* Process all regs in location *LOC and change them on equivalent |
4464 | substitution. Return true if any change was done. */ | |
55a2c322 | 4465 | static bool |
28430b2e | 4466 | loc_equivalence_change_p (rtx *loc) |
55a2c322 VM |
4467 | { |
4468 | rtx subst, reg, x = *loc; | |
4469 | bool result = false; | |
4470 | enum rtx_code code = GET_CODE (x); | |
4471 | const char *fmt; | |
4472 | int i, j; | |
4473 | ||
4474 | if (code == SUBREG) | |
4475 | { | |
4476 | reg = SUBREG_REG (x); | |
8d49e7ef | 4477 | if ((subst = get_equiv_with_elimination (reg, curr_insn)) != reg |
55a2c322 VM |
4478 | && GET_MODE (subst) == VOIDmode) |
4479 | { | |
4480 | /* We cannot reload debug location. Simplify subreg here | |
4481 | while we know the inner mode. */ | |
4482 | *loc = simplify_gen_subreg (GET_MODE (x), subst, | |
4483 | GET_MODE (reg), SUBREG_BYTE (x)); | |
4484 | return true; | |
4485 | } | |
4486 | } | |
8d49e7ef | 4487 | if (code == REG && (subst = get_equiv_with_elimination (x, curr_insn)) != x) |
55a2c322 VM |
4488 | { |
4489 | *loc = subst; | |
4490 | return true; | |
4491 | } | |
4492 | ||
4493 | /* Scan all the operand sub-expressions. */ | |
4494 | fmt = GET_RTX_FORMAT (code); | |
4495 | for (i = GET_RTX_LENGTH (code) - 1; i >= 0; i--) | |
4496 | { | |
4497 | if (fmt[i] == 'e') | |
28430b2e | 4498 | result = loc_equivalence_change_p (&XEXP (x, i)) || result; |
55a2c322 VM |
4499 | else if (fmt[i] == 'E') |
4500 | for (j = XVECLEN (x, i) - 1; j >= 0; j--) | |
4501 | result | |
28430b2e | 4502 | = loc_equivalence_change_p (&XVECEXP (x, i, j)) || result; |
55a2c322 VM |
4503 | } |
4504 | return result; | |
4505 | } | |
4506 | ||
d0608e59 | 4507 | /* Similar to loc_equivalence_change_p, but for use as |
4c2b2d79 VM |
4508 | simplify_replace_fn_rtx callback. DATA is insn for which the |
4509 | elimination is done. If it null we don't do the elimination. */ | |
d0608e59 | 4510 | static rtx |
4c2b2d79 | 4511 | loc_equivalence_callback (rtx loc, const_rtx, void *data) |
d0608e59 JJ |
4512 | { |
4513 | if (!REG_P (loc)) | |
4514 | return NULL_RTX; | |
4515 | ||
4c2b2d79 | 4516 | rtx subst = (data == NULL |
cfa434f6 | 4517 | ? get_equiv (loc) : get_equiv_with_elimination (loc, (rtx_insn *) data)); |
d0608e59 JJ |
4518 | if (subst != loc) |
4519 | return subst; | |
4520 | ||
4521 | return NULL_RTX; | |
4522 | } | |
4523 | ||
55a2c322 VM |
4524 | /* Maximum number of generated reload insns per an insn. It is for |
4525 | preventing this pass cycling in a bug case. */ | |
4526 | #define MAX_RELOAD_INSNS_NUMBER LRA_MAX_INSN_RELOADS | |
4527 | ||
4528 | /* The current iteration number of this LRA pass. */ | |
4529 | int lra_constraint_iter; | |
4530 | ||
55a2c322 VM |
4531 | /* True if we substituted equiv which needs checking register |
4532 | allocation correctness because the equivalent value contains | |
4533 | allocatable hard registers or when we restore multi-register | |
4534 | pseudo. */ | |
4535 | bool lra_risky_transformations_p; | |
4536 | ||
4537 | /* Return true if REGNO is referenced in more than one block. */ | |
4538 | static bool | |
4539 | multi_block_pseudo_p (int regno) | |
4540 | { | |
4541 | basic_block bb = NULL; | |
4542 | unsigned int uid; | |
4543 | bitmap_iterator bi; | |
f4eafc30 | 4544 | |
55a2c322 VM |
4545 | if (regno < FIRST_PSEUDO_REGISTER) |
4546 | return false; | |
f4eafc30 | 4547 | |
55a2c322 VM |
4548 | EXECUTE_IF_SET_IN_BITMAP (&lra_reg_info[regno].insn_bitmap, 0, uid, bi) |
4549 | if (bb == NULL) | |
4550 | bb = BLOCK_FOR_INSN (lra_insn_recog_data[uid]->insn); | |
4551 | else if (BLOCK_FOR_INSN (lra_insn_recog_data[uid]->insn) != bb) | |
4552 | return true; | |
4553 | return false; | |
4554 | } | |
4555 | ||
1966c91b VM |
4556 | /* Return true if LIST contains a deleted insn. */ |
4557 | static bool | |
0cc97fc5 | 4558 | contains_deleted_insn_p (rtx_insn_list *list) |
1966c91b | 4559 | { |
0cc97fc5 DM |
4560 | for (; list != NULL_RTX; list = list->next ()) |
4561 | if (NOTE_P (list->insn ()) | |
4562 | && NOTE_KIND (list->insn ()) == NOTE_INSN_DELETED) | |
1966c91b VM |
4563 | return true; |
4564 | return false; | |
4565 | } | |
4566 | ||
55a2c322 VM |
4567 | /* Return true if X contains a pseudo dying in INSN. */ |
4568 | static bool | |
605780f6 | 4569 | dead_pseudo_p (rtx x, rtx_insn *insn) |
55a2c322 VM |
4570 | { |
4571 | int i, j; | |
4572 | const char *fmt; | |
4573 | enum rtx_code code; | |
4574 | ||
4575 | if (REG_P (x)) | |
4576 | return (insn != NULL_RTX | |
4577 | && find_regno_note (insn, REG_DEAD, REGNO (x)) != NULL_RTX); | |
4578 | code = GET_CODE (x); | |
4579 | fmt = GET_RTX_FORMAT (code); | |
4580 | for (i = GET_RTX_LENGTH (code) - 1; i >= 0; i--) | |
4581 | { | |
4582 | if (fmt[i] == 'e') | |
4583 | { | |
4584 | if (dead_pseudo_p (XEXP (x, i), insn)) | |
4585 | return true; | |
4586 | } | |
4587 | else if (fmt[i] == 'E') | |
4588 | { | |
4589 | for (j = XVECLEN (x, i) - 1; j >= 0; j--) | |
4590 | if (dead_pseudo_p (XVECEXP (x, i, j), insn)) | |
4591 | return true; | |
4592 | } | |
4593 | } | |
4594 | return false; | |
4595 | } | |
4596 | ||
4597 | /* Return true if INSN contains a dying pseudo in INSN right hand | |
4598 | side. */ | |
4599 | static bool | |
e8a54173 | 4600 | insn_rhs_dead_pseudo_p (rtx_insn *insn) |
55a2c322 VM |
4601 | { |
4602 | rtx set = single_set (insn); | |
4603 | ||
4604 | gcc_assert (set != NULL); | |
4605 | return dead_pseudo_p (SET_SRC (set), insn); | |
4606 | } | |
4607 | ||
4608 | /* Return true if any init insn of REGNO contains a dying pseudo in | |
4609 | insn right hand side. */ | |
4610 | static bool | |
4611 | init_insn_rhs_dead_pseudo_p (int regno) | |
4612 | { | |
0cc97fc5 | 4613 | rtx_insn_list *insns = ira_reg_equiv[regno].init_insns; |
55a2c322 VM |
4614 | |
4615 | if (insns == NULL) | |
4616 | return false; | |
0cc97fc5 DM |
4617 | for (; insns != NULL_RTX; insns = insns->next ()) |
4618 | if (insn_rhs_dead_pseudo_p (insns->insn ())) | |
55a2c322 VM |
4619 | return true; |
4620 | return false; | |
4621 | } | |
4622 | ||
01e54ef8 VM |
4623 | /* Return TRUE if REGNO has a reverse equivalence. The equivalence is |
4624 | reverse only if we have one init insn with given REGNO as a | |
4625 | source. */ | |
4626 | static bool | |
4627 | reverse_equiv_p (int regno) | |
4628 | { | |
0cc97fc5 DM |
4629 | rtx_insn_list *insns = ira_reg_equiv[regno].init_insns; |
4630 | rtx set; | |
01e54ef8 | 4631 | |
0cc97fc5 | 4632 | if (insns == NULL) |
01e54ef8 | 4633 | return false; |
0cc97fc5 DM |
4634 | if (! INSN_P (insns->insn ()) |
4635 | || insns->next () != NULL) | |
01e54ef8 | 4636 | return false; |
0cc97fc5 | 4637 | if ((set = single_set (insns->insn ())) == NULL_RTX) |
01e54ef8 VM |
4638 | return false; |
4639 | return REG_P (SET_SRC (set)) && (int) REGNO (SET_SRC (set)) == regno; | |
4640 | } | |
4641 | ||
4642 | /* Return TRUE if REGNO was reloaded in an equivalence init insn. We | |
4643 | call this function only for non-reverse equivalence. */ | |
4644 | static bool | |
4645 | contains_reloaded_insn_p (int regno) | |
4646 | { | |
4647 | rtx set; | |
0cc97fc5 | 4648 | rtx_insn_list *list = ira_reg_equiv[regno].init_insns; |
01e54ef8 | 4649 | |
0cc97fc5 DM |
4650 | for (; list != NULL; list = list->next ()) |
4651 | if ((set = single_set (list->insn ())) == NULL_RTX | |
01e54ef8 VM |
4652 | || ! REG_P (SET_DEST (set)) |
4653 | || (int) REGNO (SET_DEST (set)) != regno) | |
4654 | return true; | |
4655 | return false; | |
4656 | } | |
4657 | ||
55a2c322 VM |
4658 | /* Entry function of LRA constraint pass. Return true if the |
4659 | constraint pass did change the code. */ | |
4660 | bool | |
4661 | lra_constraints (bool first_p) | |
4662 | { | |
4663 | bool changed_p; | |
4664 | int i, hard_regno, new_insns_num; | |
6cd1dd26 VM |
4665 | unsigned int min_len, new_min_len, uid; |
4666 | rtx set, x, reg, dest_reg; | |
55a2c322 | 4667 | basic_block last_bb; |
6cd1dd26 | 4668 | bitmap_iterator bi; |
55a2c322 VM |
4669 | |
4670 | lra_constraint_iter++; | |
4671 | if (lra_dump_file != NULL) | |
4672 | fprintf (lra_dump_file, "\n********** Local #%d: **********\n\n", | |
4673 | lra_constraint_iter); | |
55a2c322 | 4674 | changed_p = false; |
bcb21886 KY |
4675 | if (pic_offset_table_rtx |
4676 | && REGNO (pic_offset_table_rtx) >= FIRST_PSEUDO_REGISTER) | |
4677 | lra_risky_transformations_p = true; | |
4678 | else | |
15961e4a VM |
4679 | /* On the first iteration we should check IRA assignment |
4680 | correctness. In rare cases, the assignments can be wrong as | |
4681 | early clobbers operands are ignored in IRA. */ | |
4682 | lra_risky_transformations_p = first_p; | |
55a2c322 VM |
4683 | new_insn_uid_start = get_max_uid (); |
4684 | new_regno_start = first_p ? lra_constraint_new_regno_start : max_reg_num (); | |
8d49e7ef VM |
4685 | /* Mark used hard regs for target stack size calulations. */ |
4686 | for (i = FIRST_PSEUDO_REGISTER; i < new_regno_start; i++) | |
4687 | if (lra_reg_info[i].nrefs != 0 | |
4688 | && (hard_regno = lra_get_regno_hard_regno (i)) >= 0) | |
4689 | { | |
4690 | int j, nregs; | |
4691 | ||
ad474626 | 4692 | nregs = hard_regno_nregs (hard_regno, lra_reg_info[i].biggest_mode); |
8d49e7ef VM |
4693 | for (j = 0; j < nregs; j++) |
4694 | df_set_regs_ever_live (hard_regno + j, true); | |
4695 | } | |
4696 | /* Do elimination before the equivalence processing as we can spill | |
4697 | some pseudos during elimination. */ | |
4698 | lra_eliminate (false, first_p); | |
d648b5ff | 4699 | auto_bitmap equiv_insn_bitmap (®_obstack); |
55a2c322 VM |
4700 | for (i = FIRST_PSEUDO_REGISTER; i < new_regno_start; i++) |
4701 | if (lra_reg_info[i].nrefs != 0) | |
4702 | { | |
4703 | ira_reg_equiv[i].profitable_p = true; | |
6cd1dd26 | 4704 | reg = regno_reg_rtx[i]; |
8d49e7ef | 4705 | if (lra_get_regno_hard_regno (i) < 0 && (x = get_equiv (reg)) != reg) |
55a2c322 VM |
4706 | { |
4707 | bool pseudo_p = contains_reg_p (x, false, false); | |
55a2c322 | 4708 | |
1966c91b VM |
4709 | /* After RTL transformation, we can not guarantee that |
4710 | pseudo in the substitution was not reloaded which might | |
4711 | make equivalence invalid. For example, in reverse | |
4712 | equiv of p0 | |
4713 | ||
4714 | p0 <- ... | |
4715 | ... | |
4716 | equiv_mem <- p0 | |
4717 | ||
4718 | the memory address register was reloaded before the 2nd | |
4719 | insn. */ | |
4720 | if ((! first_p && pseudo_p) | |
4721 | /* We don't use DF for compilation speed sake. So it | |
4722 | is problematic to update live info when we use an | |
4723 | equivalence containing pseudos in more than one | |
4724 | BB. */ | |
4725 | || (pseudo_p && multi_block_pseudo_p (i)) | |
4726 | /* If an init insn was deleted for some reason, cancel | |
4727 | the equiv. We could update the equiv insns after | |
4728 | transformations including an equiv insn deletion | |
4729 | but it is not worthy as such cases are extremely | |
4730 | rare. */ | |
4731 | || contains_deleted_insn_p (ira_reg_equiv[i].init_insns) | |
55a2c322 VM |
4732 | /* If it is not a reverse equivalence, we check that a |
4733 | pseudo in rhs of the init insn is not dying in the | |
4734 | insn. Otherwise, the live info at the beginning of | |
4735 | the corresponding BB might be wrong after we | |
4736 | removed the insn. When the equiv can be a | |
4737 | constant, the right hand side of the init insn can | |
4738 | be a pseudo. */ | |
01e54ef8 VM |
4739 | || (! reverse_equiv_p (i) |
4740 | && (init_insn_rhs_dead_pseudo_p (i) | |
4741 | /* If we reloaded the pseudo in an equivalence | |
4742 | init insn, we can not remove the equiv init | |
4743 | insns and the init insns might write into | |
4744 | const memory in this case. */ | |
4745 | || contains_reloaded_insn_p (i))) | |
b28ece32 VM |
4746 | /* Prevent access beyond equivalent memory for |
4747 | paradoxical subregs. */ | |
4748 | || (MEM_P (x) | |
cf098191 RS |
4749 | && maybe_gt (GET_MODE_SIZE (lra_reg_info[i].biggest_mode), |
4750 | GET_MODE_SIZE (GET_MODE (x)))) | |
bcb21886 KY |
4751 | || (pic_offset_table_rtx |
4752 | && ((CONST_POOL_OK_P (PSEUDO_REGNO_MODE (i), x) | |
4753 | && (targetm.preferred_reload_class | |
4754 | (x, lra_get_allocno_class (i)) == NO_REGS)) | |
b81a2f0d | 4755 | || contains_symbol_ref_p (x)))) |
55a2c322 | 4756 | ira_reg_equiv[i].defined_p = false; |
55a2c322 VM |
4757 | if (contains_reg_p (x, false, true)) |
4758 | ira_reg_equiv[i].profitable_p = false; | |
8d49e7ef | 4759 | if (get_equiv (reg) != reg) |
d648b5ff | 4760 | bitmap_ior_into (equiv_insn_bitmap, &lra_reg_info[i].insn_bitmap); |
55a2c322 VM |
4761 | } |
4762 | } | |
4c2b2d79 VM |
4763 | for (i = FIRST_PSEUDO_REGISTER; i < new_regno_start; i++) |
4764 | update_equiv (i); | |
6cd1dd26 VM |
4765 | /* We should add all insns containing pseudos which should be |
4766 | substituted by their equivalences. */ | |
d648b5ff | 4767 | EXECUTE_IF_SET_IN_BITMAP (equiv_insn_bitmap, 0, uid, bi) |
6cd1dd26 | 4768 | lra_push_insn_by_uid (uid); |
55a2c322 VM |
4769 | min_len = lra_insn_stack_length (); |
4770 | new_insns_num = 0; | |
4771 | last_bb = NULL; | |
4772 | changed_p = false; | |
4773 | while ((new_min_len = lra_insn_stack_length ()) != 0) | |
4774 | { | |
4775 | curr_insn = lra_pop_insn (); | |
4776 | --new_min_len; | |
f4eafc30 | 4777 | curr_bb = BLOCK_FOR_INSN (curr_insn); |
55a2c322 VM |
4778 | if (curr_bb != last_bb) |
4779 | { | |
4780 | last_bb = curr_bb; | |
4781 | bb_reload_num = lra_curr_reload_num; | |
4782 | } | |
4783 | if (min_len > new_min_len) | |
4784 | { | |
4785 | min_len = new_min_len; | |
4786 | new_insns_num = 0; | |
4787 | } | |
4788 | if (new_insns_num > MAX_RELOAD_INSNS_NUMBER) | |
4789 | internal_error | |
4790 | ("Max. number of generated reload insns per insn is achieved (%d)\n", | |
4791 | MAX_RELOAD_INSNS_NUMBER); | |
4792 | new_insns_num++; | |
4793 | if (DEBUG_INSN_P (curr_insn)) | |
4794 | { | |
4795 | /* We need to check equivalence in debug insn and change | |
4796 | pseudo to the equivalent value if necessary. */ | |
4797 | curr_id = lra_get_insn_recog_data (curr_insn); | |
d648b5ff | 4798 | if (bitmap_bit_p (equiv_insn_bitmap, INSN_UID (curr_insn))) |
4d64ce5c | 4799 | { |
d0608e59 JJ |
4800 | rtx old = *curr_id->operand_loc[0]; |
4801 | *curr_id->operand_loc[0] | |
4802 | = simplify_replace_fn_rtx (old, NULL_RTX, | |
4c2b2d79 | 4803 | loc_equivalence_callback, curr_insn); |
d0608e59 JJ |
4804 | if (old != *curr_id->operand_loc[0]) |
4805 | { | |
4806 | lra_update_insn_regno_info (curr_insn); | |
4807 | changed_p = true; | |
4808 | } | |
4d64ce5c | 4809 | } |
55a2c322 VM |
4810 | } |
4811 | else if (INSN_P (curr_insn)) | |
4812 | { | |
4813 | if ((set = single_set (curr_insn)) != NULL_RTX) | |
4814 | { | |
4815 | dest_reg = SET_DEST (set); | |
4816 | /* The equivalence pseudo could be set up as SUBREG in a | |
4817 | case when it is a call restore insn in a mode | |
4818 | different from the pseudo mode. */ | |
4819 | if (GET_CODE (dest_reg) == SUBREG) | |
4820 | dest_reg = SUBREG_REG (dest_reg); | |
4821 | if ((REG_P (dest_reg) | |
8d49e7ef | 4822 | && (x = get_equiv (dest_reg)) != dest_reg |
55a2c322 VM |
4823 | /* Remove insns which set up a pseudo whose value |
4824 | can not be changed. Such insns might be not in | |
4825 | init_insns because we don't update equiv data | |
4826 | during insn transformations. | |
5a107a0f | 4827 | |
55a2c322 VM |
4828 | As an example, let suppose that a pseudo got |
4829 | hard register and on the 1st pass was not | |
4830 | changed to equivalent constant. We generate an | |
4831 | additional insn setting up the pseudo because of | |
4832 | secondary memory movement. Then the pseudo is | |
4833 | spilled and we use the equiv constant. In this | |
4834 | case we should remove the additional insn and | |
f6937e32 | 4835 | this insn is not init_insns list. */ |
55a2c322 | 4836 | && (! MEM_P (x) || MEM_READONLY_P (x) |
f6937e32 VM |
4837 | /* Check that this is actually an insn setting |
4838 | up the equivalence. */ | |
55a2c322 VM |
4839 | || in_list_p (curr_insn, |
4840 | ira_reg_equiv | |
4841 | [REGNO (dest_reg)].init_insns))) | |
8d49e7ef | 4842 | || (((x = get_equiv (SET_SRC (set))) != SET_SRC (set)) |
55a2c322 VM |
4843 | && in_list_p (curr_insn, |
4844 | ira_reg_equiv | |
4845 | [REGNO (SET_SRC (set))].init_insns))) | |
4846 | { | |
4847 | /* This is equiv init insn of pseudo which did not get a | |
4848 | hard register -- remove the insn. */ | |
4849 | if (lra_dump_file != NULL) | |
4850 | { | |
4851 | fprintf (lra_dump_file, | |
4852 | " Removing equiv init insn %i (freq=%d)\n", | |
4853 | INSN_UID (curr_insn), | |
fef37404 | 4854 | REG_FREQ_FROM_BB (BLOCK_FOR_INSN (curr_insn))); |
cfbeaedf | 4855 | dump_insn_slim (lra_dump_file, curr_insn); |
55a2c322 VM |
4856 | } |
4857 | if (contains_reg_p (x, true, false)) | |
4858 | lra_risky_transformations_p = true; | |
4859 | lra_set_insn_deleted (curr_insn); | |
4860 | continue; | |
4861 | } | |
4862 | } | |
4863 | curr_id = lra_get_insn_recog_data (curr_insn); | |
4864 | curr_static_id = curr_id->insn_static_data; | |
4865 | init_curr_insn_input_reloads (); | |
4866 | init_curr_operand_mode (); | |
d9cf932c | 4867 | if (curr_insn_transform (false)) |
55a2c322 | 4868 | changed_p = true; |
28430b2e VM |
4869 | /* Check non-transformed insns too for equiv change as USE |
4870 | or CLOBBER don't need reloads but can contain pseudos | |
4871 | being changed on their equivalences. */ | |
d648b5ff | 4872 | else if (bitmap_bit_p (equiv_insn_bitmap, INSN_UID (curr_insn)) |
28430b2e VM |
4873 | && loc_equivalence_change_p (&PATTERN (curr_insn))) |
4874 | { | |
4875 | lra_update_insn_regno_info (curr_insn); | |
4876 | changed_p = true; | |
4877 | } | |
55a2c322 VM |
4878 | } |
4879 | } | |
d648b5ff | 4880 | |
55a2c322 VM |
4881 | /* If we used a new hard regno, changed_p should be true because the |
4882 | hard reg is assigned to a new pseudo. */ | |
b2b29377 | 4883 | if (flag_checking && !changed_p) |
55a2c322 VM |
4884 | { |
4885 | for (i = FIRST_PSEUDO_REGISTER; i < new_regno_start; i++) | |
4886 | if (lra_reg_info[i].nrefs != 0 | |
4887 | && (hard_regno = lra_get_regno_hard_regno (i)) >= 0) | |
4888 | { | |
ad474626 RS |
4889 | int j, nregs = hard_regno_nregs (hard_regno, |
4890 | PSEUDO_REGNO_MODE (i)); | |
f4eafc30 | 4891 | |
55a2c322 VM |
4892 | for (j = 0; j < nregs; j++) |
4893 | lra_assert (df_regs_ever_live_p (hard_regno + j)); | |
4894 | } | |
4895 | } | |
55a2c322 VM |
4896 | return changed_p; |
4897 | } | |
4898 | ||
8a8330b7 VM |
4899 | static void initiate_invariants (void); |
4900 | static void finish_invariants (void); | |
4901 | ||
55a2c322 VM |
4902 | /* Initiate the LRA constraint pass. It is done once per |
4903 | function. */ | |
4904 | void | |
4905 | lra_constraints_init (void) | |
4906 | { | |
8a8330b7 | 4907 | initiate_invariants (); |
55a2c322 VM |
4908 | } |
4909 | ||
4910 | /* Finalize the LRA constraint pass. It is done once per | |
4911 | function. */ | |
4912 | void | |
4913 | lra_constraints_finish (void) | |
4914 | { | |
8a8330b7 VM |
4915 | finish_invariants (); |
4916 | } | |
4917 | ||
4918 | \f | |
4919 | ||
4920 | /* Structure describes invariants for ineheritance. */ | |
eb0f8780 | 4921 | struct lra_invariant |
8a8330b7 VM |
4922 | { |
4923 | /* The order number of the invariant. */ | |
4924 | int num; | |
4925 | /* The invariant RTX. */ | |
4926 | rtx invariant_rtx; | |
4927 | /* The origin insn of the invariant. */ | |
4928 | rtx_insn *insn; | |
4929 | }; | |
4930 | ||
eb0f8780 | 4931 | typedef lra_invariant invariant_t; |
8a8330b7 VM |
4932 | typedef invariant_t *invariant_ptr_t; |
4933 | typedef const invariant_t *const_invariant_ptr_t; | |
4934 | ||
4935 | /* Pointer to the inheritance invariants. */ | |
4936 | static vec<invariant_ptr_t> invariants; | |
4937 | ||
4938 | /* Allocation pool for the invariants. */ | |
eb0f8780 | 4939 | static object_allocator<lra_invariant> *invariants_pool; |
8a8330b7 VM |
4940 | |
4941 | /* Hash table for the invariants. */ | |
4942 | static htab_t invariant_table; | |
4943 | ||
4944 | /* Hash function for INVARIANT. */ | |
4945 | static hashval_t | |
4946 | invariant_hash (const void *invariant) | |
4947 | { | |
4948 | rtx inv = ((const_invariant_ptr_t) invariant)->invariant_rtx; | |
4949 | return lra_rtx_hash (inv); | |
4950 | } | |
4951 | ||
4952 | /* Equal function for invariants INVARIANT1 and INVARIANT2. */ | |
4953 | static int | |
4954 | invariant_eq_p (const void *invariant1, const void *invariant2) | |
4955 | { | |
4956 | rtx inv1 = ((const_invariant_ptr_t) invariant1)->invariant_rtx; | |
4957 | rtx inv2 = ((const_invariant_ptr_t) invariant2)->invariant_rtx; | |
4958 | ||
4959 | return rtx_equal_p (inv1, inv2); | |
4960 | } | |
4961 | ||
4962 | /* Insert INVARIANT_RTX into the table if it is not there yet. Return | |
4963 | invariant which is in the table. */ | |
4964 | static invariant_ptr_t | |
4965 | insert_invariant (rtx invariant_rtx) | |
4966 | { | |
4967 | void **entry_ptr; | |
4968 | invariant_t invariant; | |
4969 | invariant_ptr_t invariant_ptr; | |
4970 | ||
4971 | invariant.invariant_rtx = invariant_rtx; | |
4972 | entry_ptr = htab_find_slot (invariant_table, &invariant, INSERT); | |
4973 | if (*entry_ptr == NULL) | |
4974 | { | |
4975 | invariant_ptr = invariants_pool->allocate (); | |
4976 | invariant_ptr->invariant_rtx = invariant_rtx; | |
4977 | invariant_ptr->insn = NULL; | |
4978 | invariants.safe_push (invariant_ptr); | |
4979 | *entry_ptr = (void *) invariant_ptr; | |
4980 | } | |
4981 | return (invariant_ptr_t) *entry_ptr; | |
4982 | } | |
4983 | ||
4984 | /* Initiate the invariant table. */ | |
4985 | static void | |
4986 | initiate_invariants (void) | |
4987 | { | |
4988 | invariants.create (100); | |
eb0f8780 ML |
4989 | invariants_pool |
4990 | = new object_allocator<lra_invariant> ("Inheritance invariants"); | |
8a8330b7 VM |
4991 | invariant_table = htab_create (100, invariant_hash, invariant_eq_p, NULL); |
4992 | } | |
4993 | ||
4994 | /* Finish the invariant table. */ | |
4995 | static void | |
4996 | finish_invariants (void) | |
4997 | { | |
4998 | htab_delete (invariant_table); | |
4999 | delete invariants_pool; | |
5000 | invariants.release (); | |
5001 | } | |
5002 | ||
5003 | /* Make the invariant table empty. */ | |
5004 | static void | |
5005 | clear_invariants (void) | |
5006 | { | |
5007 | htab_empty (invariant_table); | |
5008 | invariants_pool->release (); | |
5009 | invariants.truncate (0); | |
55a2c322 VM |
5010 | } |
5011 | ||
5012 | \f | |
5013 | ||
5014 | /* This page contains code to do inheritance/split | |
5015 | transformations. */ | |
5016 | ||
5017 | /* Number of reloads passed so far in current EBB. */ | |
5018 | static int reloads_num; | |
5019 | ||
5020 | /* Number of calls passed so far in current EBB. */ | |
5021 | static int calls_num; | |
5022 | ||
5023 | /* Current reload pseudo check for validity of elements in | |
5024 | USAGE_INSNS. */ | |
5025 | static int curr_usage_insns_check; | |
5026 | ||
5027 | /* Info about last usage of registers in EBB to do inheritance/split | |
5028 | transformation. Inheritance transformation is done from a spilled | |
5029 | pseudo and split transformations from a hard register or a pseudo | |
5030 | assigned to a hard register. */ | |
5031 | struct usage_insns | |
5032 | { | |
5033 | /* If the value is equal to CURR_USAGE_INSNS_CHECK, then the member | |
5034 | value INSNS is valid. The insns is chain of optional debug insns | |
1ccd4874 VM |
5035 | and a finishing non-debug insn using the corresponding reg. The |
5036 | value is also used to mark the registers which are set up in the | |
5037 | current insn. The negated insn uid is used for this. */ | |
55a2c322 VM |
5038 | int check; |
5039 | /* Value of global reloads_num at the last insn in INSNS. */ | |
5040 | int reloads_num; | |
5041 | /* Value of global reloads_nums at the last insn in INSNS. */ | |
5042 | int calls_num; | |
5043 | /* It can be true only for splitting. And it means that the restore | |
5044 | insn should be put after insn given by the following member. */ | |
5045 | bool after_p; | |
5046 | /* Next insns in the current EBB which use the original reg and the | |
5047 | original reg value is not changed between the current insn and | |
5048 | the next insns. In order words, e.g. for inheritance, if we need | |
5049 | to use the original reg value again in the next insns we can try | |
5050 | to use the value in a hard register from a reload insn of the | |
5051 | current insn. */ | |
5052 | rtx insns; | |
5053 | }; | |
5054 | ||
5055 | /* Map: regno -> corresponding pseudo usage insns. */ | |
5056 | static struct usage_insns *usage_insns; | |
5057 | ||
5058 | static void | |
1476d1bd | 5059 | setup_next_usage_insn (int regno, rtx insn, int reloads_num, bool after_p) |
55a2c322 VM |
5060 | { |
5061 | usage_insns[regno].check = curr_usage_insns_check; | |
5062 | usage_insns[regno].insns = insn; | |
5063 | usage_insns[regno].reloads_num = reloads_num; | |
5064 | usage_insns[regno].calls_num = calls_num; | |
5065 | usage_insns[regno].after_p = after_p; | |
5066 | } | |
5067 | ||
5068 | /* The function is used to form list REGNO usages which consists of | |
5069 | optional debug insns finished by a non-debug insn using REGNO. | |
5070 | RELOADS_NUM is current number of reload insns processed so far. */ | |
5071 | static void | |
767dc529 | 5072 | add_next_usage_insn (int regno, rtx_insn *insn, int reloads_num) |
55a2c322 VM |
5073 | { |
5074 | rtx next_usage_insns; | |
f4eafc30 | 5075 | |
55a2c322 VM |
5076 | if (usage_insns[regno].check == curr_usage_insns_check |
5077 | && (next_usage_insns = usage_insns[regno].insns) != NULL_RTX | |
5078 | && DEBUG_INSN_P (insn)) | |
5079 | { | |
5080 | /* Check that we did not add the debug insn yet. */ | |
5081 | if (next_usage_insns != insn | |
5082 | && (GET_CODE (next_usage_insns) != INSN_LIST | |
5083 | || XEXP (next_usage_insns, 0) != insn)) | |
5084 | usage_insns[regno].insns = gen_rtx_INSN_LIST (VOIDmode, insn, | |
5085 | next_usage_insns); | |
5086 | } | |
5087 | else if (NONDEBUG_INSN_P (insn)) | |
5088 | setup_next_usage_insn (regno, insn, reloads_num, false); | |
5089 | else | |
5090 | usage_insns[regno].check = 0; | |
5091 | } | |
f4eafc30 | 5092 | |
bc3591eb | 5093 | /* Return first non-debug insn in list USAGE_INSNS. */ |
e8a54173 | 5094 | static rtx_insn * |
bc3591eb VM |
5095 | skip_usage_debug_insns (rtx usage_insns) |
5096 | { | |
5097 | rtx insn; | |
5098 | ||
5099 | /* Skip debug insns. */ | |
5100 | for (insn = usage_insns; | |
5101 | insn != NULL_RTX && GET_CODE (insn) == INSN_LIST; | |
5102 | insn = XEXP (insn, 1)) | |
5103 | ; | |
e8a54173 | 5104 | return safe_as_a <rtx_insn *> (insn); |
bc3591eb VM |
5105 | } |
5106 | ||
5107 | /* Return true if we need secondary memory moves for insn in | |
5108 | USAGE_INSNS after inserting inherited pseudo of class INHER_CL | |
5109 | into the insn. */ | |
5110 | static bool | |
fbebbadd JR |
5111 | check_secondary_memory_needed_p (enum reg_class inher_cl ATTRIBUTE_UNUSED, |
5112 | rtx usage_insns ATTRIBUTE_UNUSED) | |
bc3591eb | 5113 | { |
e8a54173 DM |
5114 | rtx_insn *insn; |
5115 | rtx set, dest; | |
bc3591eb VM |
5116 | enum reg_class cl; |
5117 | ||
5118 | if (inher_cl == ALL_REGS | |
5119 | || (insn = skip_usage_debug_insns (usage_insns)) == NULL_RTX) | |
5120 | return false; | |
5121 | lra_assert (INSN_P (insn)); | |
5122 | if ((set = single_set (insn)) == NULL_RTX || ! REG_P (SET_DEST (set))) | |
5123 | return false; | |
5124 | dest = SET_DEST (set); | |
5125 | if (! REG_P (dest)) | |
5126 | return false; | |
5127 | lra_assert (inher_cl != NO_REGS); | |
5128 | cl = get_reg_class (REGNO (dest)); | |
5129 | return (cl != NO_REGS && cl != ALL_REGS | |
f15643d4 | 5130 | && targetm.secondary_memory_needed (GET_MODE (dest), inher_cl, cl)); |
bc3591eb VM |
5131 | } |
5132 | ||
55a2c322 VM |
5133 | /* Registers involved in inheritance/split in the current EBB |
5134 | (inheritance/split pseudos and original registers). */ | |
5135 | static bitmap_head check_only_regs; | |
5136 | ||
8a8330b7 VM |
5137 | /* Reload pseudos can not be involded in invariant inheritance in the |
5138 | current EBB. */ | |
5139 | static bitmap_head invalid_invariant_regs; | |
5140 | ||
55a2c322 VM |
5141 | /* Do inheritance transformations for insn INSN, which defines (if |
5142 | DEF_P) or uses ORIGINAL_REGNO. NEXT_USAGE_INSNS specifies which | |
5143 | instruction in the EBB next uses ORIGINAL_REGNO; it has the same | |
5144 | form as the "insns" field of usage_insns. Return true if we | |
5145 | succeed in such transformation. | |
5146 | ||
5147 | The transformations look like: | |
5148 | ||
5149 | p <- ... i <- ... | |
5150 | ... p <- i (new insn) | |
5151 | ... => | |
5152 | <- ... p ... <- ... i ... | |
5153 | or | |
5154 | ... i <- p (new insn) | |
5155 | <- ... p ... <- ... i ... | |
5156 | ... => | |
5157 | <- ... p ... <- ... i ... | |
5158 | where p is a spilled original pseudo and i is a new inheritance pseudo. | |
f4eafc30 L |
5159 | |
5160 | ||
55a2c322 VM |
5161 | The inheritance pseudo has the smallest class of two classes CL and |
5162 | class of ORIGINAL REGNO. */ | |
5163 | static bool | |
5164 | inherit_reload_reg (bool def_p, int original_regno, | |
cfa434f6 | 5165 | enum reg_class cl, rtx_insn *insn, rtx next_usage_insns) |
55a2c322 | 5166 | { |
2ae577fd VM |
5167 | if (optimize_function_for_size_p (cfun)) |
5168 | return false; | |
5169 | ||
55a2c322 VM |
5170 | enum reg_class rclass = lra_get_allocno_class (original_regno); |
5171 | rtx original_reg = regno_reg_rtx[original_regno]; | |
cfa434f6 DM |
5172 | rtx new_reg, usage_insn; |
5173 | rtx_insn *new_insns; | |
55a2c322 VM |
5174 | |
5175 | lra_assert (! usage_insns[original_regno].after_p); | |
5176 | if (lra_dump_file != NULL) | |
5177 | fprintf (lra_dump_file, | |
bc3591eb | 5178 | " <<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<\n"); |
55a2c322 VM |
5179 | if (! ira_reg_classes_intersect_p[cl][rclass]) |
5180 | { | |
5181 | if (lra_dump_file != NULL) | |
5182 | { | |
5183 | fprintf (lra_dump_file, | |
bc3591eb | 5184 | " Rejecting inheritance for %d " |
55a2c322 VM |
5185 | "because of disjoint classes %s and %s\n", |
5186 | original_regno, reg_class_names[cl], | |
5187 | reg_class_names[rclass]); | |
5188 | fprintf (lra_dump_file, | |
bc3591eb | 5189 | " >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>\n"); |
55a2c322 VM |
5190 | } |
5191 | return false; | |
5192 | } | |
5193 | if ((ira_class_subset_p[cl][rclass] && cl != rclass) | |
5194 | /* We don't use a subset of two classes because it can be | |
5195 | NO_REGS. This transformation is still profitable in most | |
5196 | cases even if the classes are not intersected as register | |
5197 | move is probably cheaper than a memory load. */ | |
5198 | || ira_class_hard_regs_num[cl] < ira_class_hard_regs_num[rclass]) | |
5199 | { | |
5200 | if (lra_dump_file != NULL) | |
5201 | fprintf (lra_dump_file, " Use smallest class of %s and %s\n", | |
5202 | reg_class_names[cl], reg_class_names[rclass]); | |
f4eafc30 | 5203 | |
55a2c322 VM |
5204 | rclass = cl; |
5205 | } | |
66aa7879 | 5206 | if (check_secondary_memory_needed_p (rclass, next_usage_insns)) |
bc3591eb VM |
5207 | { |
5208 | /* Reject inheritance resulting in secondary memory moves. | |
5209 | Otherwise, there is a danger in LRA cycling. Also such | |
5210 | transformation will be unprofitable. */ | |
5211 | if (lra_dump_file != NULL) | |
5212 | { | |
e8a54173 | 5213 | rtx_insn *insn = skip_usage_debug_insns (next_usage_insns); |
bc3591eb VM |
5214 | rtx set = single_set (insn); |
5215 | ||
5216 | lra_assert (set != NULL_RTX); | |
5217 | ||
5218 | rtx dest = SET_DEST (set); | |
5219 | ||
5220 | lra_assert (REG_P (dest)); | |
5221 | fprintf (lra_dump_file, | |
5222 | " Rejecting inheritance for insn %d(%s)<-%d(%s) " | |
5223 | "as secondary mem is needed\n", | |
5224 | REGNO (dest), reg_class_names[get_reg_class (REGNO (dest))], | |
66aa7879 | 5225 | original_regno, reg_class_names[rclass]); |
bc3591eb VM |
5226 | fprintf (lra_dump_file, |
5227 | " >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>\n"); | |
5228 | } | |
5229 | return false; | |
5230 | } | |
55a2c322 VM |
5231 | new_reg = lra_create_new_reg (GET_MODE (original_reg), original_reg, |
5232 | rclass, "inheritance"); | |
5233 | start_sequence (); | |
5234 | if (def_p) | |
a810ee82 | 5235 | lra_emit_move (original_reg, new_reg); |
55a2c322 | 5236 | else |
a810ee82 | 5237 | lra_emit_move (new_reg, original_reg); |
55a2c322 VM |
5238 | new_insns = get_insns (); |
5239 | end_sequence (); | |
5240 | if (NEXT_INSN (new_insns) != NULL_RTX) | |
5241 | { | |
5242 | if (lra_dump_file != NULL) | |
5243 | { | |
5244 | fprintf (lra_dump_file, | |
bc3591eb | 5245 | " Rejecting inheritance %d->%d " |
55a2c322 VM |
5246 | "as it results in 2 or more insns:\n", |
5247 | original_regno, REGNO (new_reg)); | |
dc01c3d1 | 5248 | dump_rtl_slim (lra_dump_file, new_insns, NULL, -1, 0); |
55a2c322 VM |
5249 | fprintf (lra_dump_file, |
5250 | " >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>\n"); | |
5251 | } | |
5252 | return false; | |
5253 | } | |
ef87312e | 5254 | lra_substitute_pseudo_within_insn (insn, original_regno, new_reg, false); |
55a2c322 VM |
5255 | lra_update_insn_regno_info (insn); |
5256 | if (! def_p) | |
5257 | /* We now have a new usage insn for original regno. */ | |
5258 | setup_next_usage_insn (original_regno, new_insns, reloads_num, false); | |
5259 | if (lra_dump_file != NULL) | |
bc3591eb | 5260 | fprintf (lra_dump_file, " Original reg change %d->%d (bb%d):\n", |
55a2c322 | 5261 | original_regno, REGNO (new_reg), BLOCK_FOR_INSN (insn)->index); |
8a8330b7 | 5262 | lra_reg_info[REGNO (new_reg)].restore_rtx = regno_reg_rtx[original_regno]; |
55a2c322 VM |
5263 | bitmap_set_bit (&check_only_regs, REGNO (new_reg)); |
5264 | bitmap_set_bit (&check_only_regs, original_regno); | |
5265 | bitmap_set_bit (&lra_inheritance_pseudos, REGNO (new_reg)); | |
5266 | if (def_p) | |
cfa434f6 | 5267 | lra_process_new_insns (insn, NULL, new_insns, |
55a2c322 VM |
5268 | "Add original<-inheritance"); |
5269 | else | |
cfa434f6 | 5270 | lra_process_new_insns (insn, new_insns, NULL, |
55a2c322 VM |
5271 | "Add inheritance<-original"); |
5272 | while (next_usage_insns != NULL_RTX) | |
5273 | { | |
5274 | if (GET_CODE (next_usage_insns) != INSN_LIST) | |
5275 | { | |
5276 | usage_insn = next_usage_insns; | |
5277 | lra_assert (NONDEBUG_INSN_P (usage_insn)); | |
5278 | next_usage_insns = NULL; | |
5279 | } | |
5280 | else | |
5281 | { | |
5282 | usage_insn = XEXP (next_usage_insns, 0); | |
5283 | lra_assert (DEBUG_INSN_P (usage_insn)); | |
5284 | next_usage_insns = XEXP (next_usage_insns, 1); | |
5285 | } | |
ef87312e | 5286 | lra_substitute_pseudo (&usage_insn, original_regno, new_reg, false); |
cfa434f6 | 5287 | lra_update_insn_regno_info (as_a <rtx_insn *> (usage_insn)); |
55a2c322 VM |
5288 | if (lra_dump_file != NULL) |
5289 | { | |
96a95ac1 | 5290 | basic_block bb = BLOCK_FOR_INSN (usage_insn); |
55a2c322 VM |
5291 | fprintf (lra_dump_file, |
5292 | " Inheritance reuse change %d->%d (bb%d):\n", | |
5293 | original_regno, REGNO (new_reg), | |
96a95ac1 | 5294 | bb ? bb->index : -1); |
1476d1bd | 5295 | dump_insn_slim (lra_dump_file, as_a <rtx_insn *> (usage_insn)); |
55a2c322 VM |
5296 | } |
5297 | } | |
5298 | if (lra_dump_file != NULL) | |
5299 | fprintf (lra_dump_file, | |
5300 | " >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>\n"); | |
5301 | return true; | |
5302 | } | |
5303 | ||
5304 | /* Return true if we need a caller save/restore for pseudo REGNO which | |
5305 | was assigned to a hard register. */ | |
5306 | static inline bool | |
5307 | need_for_call_save_p (int regno) | |
5308 | { | |
5309 | lra_assert (regno >= FIRST_PSEUDO_REGISTER && reg_renumber[regno] >= 0); | |
5310 | return (usage_insns[regno].calls_num < calls_num | |
5311 | && (overlaps_hard_reg_set_p | |
1e288103 | 5312 | ((flag_ipa_ra && |
10e1bdb2 TV |
5313 | ! hard_reg_set_empty_p (lra_reg_info[regno].actual_call_used_reg_set)) |
5314 | ? lra_reg_info[regno].actual_call_used_reg_set | |
5315 | : call_used_reg_set, | |
8a26ad39 | 5316 | PSEUDO_REGNO_MODE (regno), reg_renumber[regno]) |
80ec73f4 RS |
5317 | || (targetm.hard_regno_call_part_clobbered |
5318 | (reg_renumber[regno], PSEUDO_REGNO_MODE (regno))))); | |
55a2c322 VM |
5319 | } |
5320 | ||
1aa95df7 | 5321 | /* Global registers occurring in the current EBB. */ |
55a2c322 VM |
5322 | static bitmap_head ebb_global_regs; |
5323 | ||
5324 | /* Return true if we need a split for hard register REGNO or pseudo | |
5325 | REGNO which was assigned to a hard register. | |
5326 | POTENTIAL_RELOAD_HARD_REGS contains hard registers which might be | |
5327 | used for reloads since the EBB end. It is an approximation of the | |
5328 | used hard registers in the split range. The exact value would | |
5329 | require expensive calculations. If we were aggressive with | |
5330 | splitting because of the approximation, the split pseudo will save | |
5331 | the same hard register assignment and will be removed in the undo | |
5332 | pass. We still need the approximation because too aggressive | |
5333 | splitting would result in too inaccurate cost calculation in the | |
5334 | assignment pass because of too many generated moves which will be | |
5335 | probably removed in the undo pass. */ | |
5336 | static inline bool | |
5337 | need_for_split_p (HARD_REG_SET potential_reload_hard_regs, int regno) | |
5338 | { | |
5339 | int hard_regno = regno < FIRST_PSEUDO_REGISTER ? regno : reg_renumber[regno]; | |
5340 | ||
5341 | lra_assert (hard_regno >= 0); | |
5342 | return ((TEST_HARD_REG_BIT (potential_reload_hard_regs, hard_regno) | |
5343 | /* Don't split eliminable hard registers, otherwise we can | |
5344 | split hard registers like hard frame pointer, which | |
5345 | lives on BB start/end according to DF-infrastructure, | |
5346 | when there is a pseudo assigned to the register and | |
5347 | living in the same BB. */ | |
5348 | && (regno >= FIRST_PSEUDO_REGISTER | |
5349 | || ! TEST_HARD_REG_BIT (eliminable_regset, hard_regno)) | |
5350 | && ! TEST_HARD_REG_BIT (lra_no_alloc_regs, hard_regno) | |
e32e4c4a VM |
5351 | /* Don't split call clobbered hard regs living through |
5352 | calls, otherwise we might have a check problem in the | |
5353 | assign sub-pass as in the most cases (exception is a | |
5354 | situation when lra_risky_transformations_p value is | |
5355 | true) the assign pass assumes that all pseudos living | |
5356 | through calls are assigned to call saved hard regs. */ | |
5357 | && (regno >= FIRST_PSEUDO_REGISTER | |
5358 | || ! TEST_HARD_REG_BIT (call_used_reg_set, regno) | |
5359 | || usage_insns[regno].calls_num == calls_num) | |
55a2c322 VM |
5360 | /* We need at least 2 reloads to make pseudo splitting |
5361 | profitable. We should provide hard regno splitting in | |
5362 | any case to solve 1st insn scheduling problem when | |
5363 | moving hard register definition up might result in | |
5364 | impossibility to find hard register for reload pseudo of | |
5365 | small register class. */ | |
5366 | && (usage_insns[regno].reloads_num | |
8e9d68a9 | 5367 | + (regno < FIRST_PSEUDO_REGISTER ? 0 : 3) < reloads_num) |
55a2c322 VM |
5368 | && (regno < FIRST_PSEUDO_REGISTER |
5369 | /* For short living pseudos, spilling + inheritance can | |
5370 | be considered a substitution for splitting. | |
5371 | Therefore we do not splitting for local pseudos. It | |
5372 | decreases also aggressiveness of splitting. The | |
5373 | minimal number of references is chosen taking into | |
5374 | account that for 2 references splitting has no sense | |
5375 | as we can just spill the pseudo. */ | |
5376 | || (regno >= FIRST_PSEUDO_REGISTER | |
5377 | && lra_reg_info[regno].nrefs > 3 | |
5378 | && bitmap_bit_p (&ebb_global_regs, regno)))) | |
5379 | || (regno >= FIRST_PSEUDO_REGISTER && need_for_call_save_p (regno))); | |
5380 | } | |
5381 | ||
5382 | /* Return class for the split pseudo created from original pseudo with | |
5383 | ALLOCNO_CLASS and MODE which got a hard register HARD_REGNO. We | |
5384 | choose subclass of ALLOCNO_CLASS which contains HARD_REGNO and | |
5385 | results in no secondary memory movements. */ | |
5386 | static enum reg_class | |
5387 | choose_split_class (enum reg_class allocno_class, | |
5388 | int hard_regno ATTRIBUTE_UNUSED, | |
ef4bddc2 | 5389 | machine_mode mode ATTRIBUTE_UNUSED) |
55a2c322 | 5390 | { |
55a2c322 VM |
5391 | int i; |
5392 | enum reg_class cl, best_cl = NO_REGS; | |
ef4dbe49 JR |
5393 | enum reg_class hard_reg_class ATTRIBUTE_UNUSED |
5394 | = REGNO_REG_CLASS (hard_regno); | |
f4eafc30 | 5395 | |
f15643d4 | 5396 | if (! targetm.secondary_memory_needed (mode, allocno_class, allocno_class) |
55a2c322 VM |
5397 | && TEST_HARD_REG_BIT (reg_class_contents[allocno_class], hard_regno)) |
5398 | return allocno_class; | |
5399 | for (i = 0; | |
5400 | (cl = reg_class_subclasses[allocno_class][i]) != LIM_REG_CLASSES; | |
5401 | i++) | |
f15643d4 RS |
5402 | if (! targetm.secondary_memory_needed (mode, cl, hard_reg_class) |
5403 | && ! targetm.secondary_memory_needed (mode, hard_reg_class, cl) | |
55a2c322 VM |
5404 | && TEST_HARD_REG_BIT (reg_class_contents[cl], hard_regno) |
5405 | && (best_cl == NO_REGS | |
5406 | || ira_class_hard_regs_num[best_cl] < ira_class_hard_regs_num[cl])) | |
5407 | best_cl = cl; | |
5408 | return best_cl; | |
55a2c322 VM |
5409 | } |
5410 | ||
8ffa3150 RS |
5411 | /* Copy any equivalence information from ORIGINAL_REGNO to NEW_REGNO. |
5412 | It only makes sense to call this function if NEW_REGNO is always | |
5413 | equal to ORIGINAL_REGNO. */ | |
5414 | ||
5415 | static void | |
5416 | lra_copy_reg_equiv (unsigned int new_regno, unsigned int original_regno) | |
5417 | { | |
5418 | if (!ira_reg_equiv[original_regno].defined_p) | |
5419 | return; | |
5420 | ||
5421 | ira_expand_reg_equiv (); | |
5422 | ira_reg_equiv[new_regno].defined_p = true; | |
5423 | if (ira_reg_equiv[original_regno].memory) | |
5424 | ira_reg_equiv[new_regno].memory | |
5425 | = copy_rtx (ira_reg_equiv[original_regno].memory); | |
5426 | if (ira_reg_equiv[original_regno].constant) | |
5427 | ira_reg_equiv[new_regno].constant | |
5428 | = copy_rtx (ira_reg_equiv[original_regno].constant); | |
5429 | if (ira_reg_equiv[original_regno].invariant) | |
5430 | ira_reg_equiv[new_regno].invariant | |
5431 | = copy_rtx (ira_reg_equiv[original_regno].invariant); | |
5432 | } | |
5433 | ||
55a2c322 VM |
5434 | /* Do split transformations for insn INSN, which defines or uses |
5435 | ORIGINAL_REGNO. NEXT_USAGE_INSNS specifies which instruction in | |
5436 | the EBB next uses ORIGINAL_REGNO; it has the same form as the | |
5437 | "insns" field of usage_insns. | |
5438 | ||
5439 | The transformations look like: | |
5440 | ||
5441 | p <- ... p <- ... | |
5442 | ... s <- p (new insn -- save) | |
5443 | ... => | |
5444 | ... p <- s (new insn -- restore) | |
5445 | <- ... p ... <- ... p ... | |
5446 | or | |
5447 | <- ... p ... <- ... p ... | |
5448 | ... s <- p (new insn -- save) | |
5449 | ... => | |
5450 | ... p <- s (new insn -- restore) | |
5451 | <- ... p ... <- ... p ... | |
5452 | ||
5453 | where p is an original pseudo got a hard register or a hard | |
5454 | register and s is a new split pseudo. The save is put before INSN | |
5455 | if BEFORE_P is true. Return true if we succeed in such | |
5456 | transformation. */ | |
5457 | static bool | |
cfa434f6 DM |
5458 | split_reg (bool before_p, int original_regno, rtx_insn *insn, |
5459 | rtx next_usage_insns) | |
55a2c322 VM |
5460 | { |
5461 | enum reg_class rclass; | |
5462 | rtx original_reg; | |
77bce07c | 5463 | int hard_regno, nregs; |
cfa434f6 DM |
5464 | rtx new_reg, usage_insn; |
5465 | rtx_insn *restore, *save; | |
55a2c322 VM |
5466 | bool after_p; |
5467 | bool call_save_p; | |
3cbf012a | 5468 | machine_mode mode; |
55a2c322 VM |
5469 | |
5470 | if (original_regno < FIRST_PSEUDO_REGISTER) | |
5471 | { | |
5472 | rclass = ira_allocno_class_translate[REGNO_REG_CLASS (original_regno)]; | |
5473 | hard_regno = original_regno; | |
5474 | call_save_p = false; | |
77bce07c | 5475 | nregs = 1; |
3cbf012a BS |
5476 | mode = lra_reg_info[hard_regno].biggest_mode; |
5477 | machine_mode reg_rtx_mode = GET_MODE (regno_reg_rtx[hard_regno]); | |
5c6a601c BS |
5478 | /* A reg can have a biggest_mode of VOIDmode if it was only ever seen |
5479 | as part of a multi-word register. In that case, or if the biggest | |
5480 | mode was larger than a register, just use the reg_rtx. Otherwise, | |
5481 | limit the size to that of the biggest access in the function. */ | |
5482 | if (mode == VOIDmode | |
03a95621 | 5483 | || paradoxical_subreg_p (mode, reg_rtx_mode)) |
3cbf012a BS |
5484 | { |
5485 | original_reg = regno_reg_rtx[hard_regno]; | |
5486 | mode = reg_rtx_mode; | |
5487 | } | |
5488 | else | |
5489 | original_reg = gen_rtx_REG (mode, hard_regno); | |
55a2c322 VM |
5490 | } |
5491 | else | |
5492 | { | |
3cbf012a | 5493 | mode = PSEUDO_REGNO_MODE (original_regno); |
55a2c322 | 5494 | hard_regno = reg_renumber[original_regno]; |
ad474626 | 5495 | nregs = hard_regno_nregs (hard_regno, mode); |
55a2c322 VM |
5496 | rclass = lra_get_allocno_class (original_regno); |
5497 | original_reg = regno_reg_rtx[original_regno]; | |
5498 | call_save_p = need_for_call_save_p (original_regno); | |
5499 | } | |
55a2c322 VM |
5500 | lra_assert (hard_regno >= 0); |
5501 | if (lra_dump_file != NULL) | |
5502 | fprintf (lra_dump_file, | |
5503 | " ((((((((((((((((((((((((((((((((((((((((((((((((\n"); | |
3cbf012a | 5504 | |
55a2c322 VM |
5505 | if (call_save_p) |
5506 | { | |
cb1cca12 | 5507 | mode = HARD_REGNO_CALLER_SAVE_MODE (hard_regno, |
ad474626 | 5508 | hard_regno_nregs (hard_regno, mode), |
cb1cca12 VM |
5509 | mode); |
5510 | new_reg = lra_create_new_reg (mode, NULL_RTX, NO_REGS, "save"); | |
55a2c322 VM |
5511 | } |
5512 | else | |
5513 | { | |
3cbf012a | 5514 | rclass = choose_split_class (rclass, hard_regno, mode); |
55a2c322 VM |
5515 | if (rclass == NO_REGS) |
5516 | { | |
5517 | if (lra_dump_file != NULL) | |
5518 | { | |
5519 | fprintf (lra_dump_file, | |
5520 | " Rejecting split of %d(%s): " | |
5521 | "no good reg class for %d(%s)\n", | |
5522 | original_regno, | |
5523 | reg_class_names[lra_get_allocno_class (original_regno)], | |
5524 | hard_regno, | |
5525 | reg_class_names[REGNO_REG_CLASS (hard_regno)]); | |
5526 | fprintf | |
5527 | (lra_dump_file, | |
5528 | " ))))))))))))))))))))))))))))))))))))))))))))))))\n"); | |
5529 | } | |
5530 | return false; | |
5531 | } | |
1b51df94 MF |
5532 | /* Split_if_necessary can split hard registers used as part of a |
5533 | multi-register mode but splits each register individually. The | |
5534 | mode used for each independent register may not be supported | |
5535 | so reject the split. Splitting the wider mode should theoretically | |
5536 | be possible but is not implemented. */ | |
f939c3e6 | 5537 | if (!targetm.hard_regno_mode_ok (hard_regno, mode)) |
1b51df94 MF |
5538 | { |
5539 | if (lra_dump_file != NULL) | |
5540 | { | |
5541 | fprintf (lra_dump_file, | |
5542 | " Rejecting split of %d(%s): unsuitable mode %s\n", | |
5543 | original_regno, | |
5544 | reg_class_names[lra_get_allocno_class (original_regno)], | |
5545 | GET_MODE_NAME (mode)); | |
5546 | fprintf | |
5547 | (lra_dump_file, | |
5548 | " ))))))))))))))))))))))))))))))))))))))))))))))))\n"); | |
5549 | } | |
5550 | return false; | |
5551 | } | |
3cbf012a | 5552 | new_reg = lra_create_new_reg (mode, original_reg, rclass, "split"); |
55a2c322 VM |
5553 | reg_renumber[REGNO (new_reg)] = hard_regno; |
5554 | } | |
8ffa3150 | 5555 | int new_regno = REGNO (new_reg); |
55a2c322 | 5556 | save = emit_spill_move (true, new_reg, original_reg); |
c61fe0cc | 5557 | if (NEXT_INSN (save) != NULL_RTX && !call_save_p) |
55a2c322 | 5558 | { |
55a2c322 VM |
5559 | if (lra_dump_file != NULL) |
5560 | { | |
5561 | fprintf | |
5562 | (lra_dump_file, | |
c61fe0cc | 5563 | " Rejecting split %d->%d resulting in > 2 save insns:\n", |
8ffa3150 | 5564 | original_regno, new_regno); |
dc01c3d1 | 5565 | dump_rtl_slim (lra_dump_file, save, NULL, -1, 0); |
55a2c322 VM |
5566 | fprintf (lra_dump_file, |
5567 | " ))))))))))))))))))))))))))))))))))))))))))))))))\n"); | |
5568 | } | |
5569 | return false; | |
5570 | } | |
5571 | restore = emit_spill_move (false, new_reg, original_reg); | |
c61fe0cc | 5572 | if (NEXT_INSN (restore) != NULL_RTX && !call_save_p) |
55a2c322 | 5573 | { |
55a2c322 VM |
5574 | if (lra_dump_file != NULL) |
5575 | { | |
5576 | fprintf (lra_dump_file, | |
5577 | " Rejecting split %d->%d " | |
c61fe0cc | 5578 | "resulting in > 2 restore insns:\n", |
8ffa3150 | 5579 | original_regno, new_regno); |
dc01c3d1 | 5580 | dump_rtl_slim (lra_dump_file, restore, NULL, -1, 0); |
55a2c322 VM |
5581 | fprintf (lra_dump_file, |
5582 | " ))))))))))))))))))))))))))))))))))))))))))))))))\n"); | |
5583 | } | |
5584 | return false; | |
5585 | } | |
8ffa3150 RS |
5586 | /* Transfer equivalence information to the spill register, so that |
5587 | if we fail to allocate the spill register, we have the option of | |
5588 | rematerializing the original value instead of spilling to the stack. */ | |
5589 | if (!HARD_REGISTER_NUM_P (original_regno) | |
5590 | && mode == PSEUDO_REGNO_MODE (original_regno)) | |
5591 | lra_copy_reg_equiv (new_regno, original_regno); | |
55a2c322 | 5592 | after_p = usage_insns[original_regno].after_p; |
8ffa3150 RS |
5593 | lra_reg_info[new_regno].restore_rtx = regno_reg_rtx[original_regno]; |
5594 | bitmap_set_bit (&check_only_regs, new_regno); | |
55a2c322 | 5595 | bitmap_set_bit (&check_only_regs, original_regno); |
8ffa3150 | 5596 | bitmap_set_bit (&lra_split_regs, new_regno); |
55a2c322 VM |
5597 | for (;;) |
5598 | { | |
5599 | if (GET_CODE (next_usage_insns) != INSN_LIST) | |
5600 | { | |
5601 | usage_insn = next_usage_insns; | |
5602 | break; | |
5603 | } | |
5604 | usage_insn = XEXP (next_usage_insns, 0); | |
5605 | lra_assert (DEBUG_INSN_P (usage_insn)); | |
5606 | next_usage_insns = XEXP (next_usage_insns, 1); | |
ef87312e | 5607 | lra_substitute_pseudo (&usage_insn, original_regno, new_reg, false); |
cfa434f6 | 5608 | lra_update_insn_regno_info (as_a <rtx_insn *> (usage_insn)); |
55a2c322 VM |
5609 | if (lra_dump_file != NULL) |
5610 | { | |
5611 | fprintf (lra_dump_file, " Split reuse change %d->%d:\n", | |
8ffa3150 | 5612 | original_regno, new_regno); |
1476d1bd | 5613 | dump_insn_slim (lra_dump_file, as_a <rtx_insn *> (usage_insn)); |
55a2c322 VM |
5614 | } |
5615 | } | |
5616 | lra_assert (NOTE_P (usage_insn) || NONDEBUG_INSN_P (usage_insn)); | |
5617 | lra_assert (usage_insn != insn || (after_p && before_p)); | |
cfa434f6 DM |
5618 | lra_process_new_insns (as_a <rtx_insn *> (usage_insn), |
5619 | after_p ? NULL : restore, | |
5620 | after_p ? restore : NULL, | |
55a2c322 VM |
5621 | call_save_p |
5622 | ? "Add reg<-save" : "Add reg<-split"); | |
cfa434f6 DM |
5623 | lra_process_new_insns (insn, before_p ? save : NULL, |
5624 | before_p ? NULL : save, | |
55a2c322 VM |
5625 | call_save_p |
5626 | ? "Add save<-reg" : "Add split<-reg"); | |
77bce07c VM |
5627 | if (nregs > 1) |
5628 | /* If we are trying to split multi-register. We should check | |
5629 | conflicts on the next assignment sub-pass. IRA can allocate on | |
5630 | sub-register levels, LRA do this on pseudos level right now and | |
5631 | this discrepancy may create allocation conflicts after | |
5632 | splitting. */ | |
5633 | lra_risky_transformations_p = true; | |
55a2c322 VM |
5634 | if (lra_dump_file != NULL) |
5635 | fprintf (lra_dump_file, | |
5636 | " ))))))))))))))))))))))))))))))))))))))))))))))))\n"); | |
5637 | return true; | |
5638 | } | |
5639 | ||
5640 | /* Recognize that we need a split transformation for insn INSN, which | |
5641 | defines or uses REGNO in its insn biggest MODE (we use it only if | |
5642 | REGNO is a hard register). POTENTIAL_RELOAD_HARD_REGS contains | |
5643 | hard registers which might be used for reloads since the EBB end. | |
5644 | Put the save before INSN if BEFORE_P is true. MAX_UID is maximla | |
5645 | uid before starting INSN processing. Return true if we succeed in | |
5646 | such transformation. */ | |
5647 | static bool | |
ef4bddc2 | 5648 | split_if_necessary (int regno, machine_mode mode, |
55a2c322 | 5649 | HARD_REG_SET potential_reload_hard_regs, |
cfa434f6 | 5650 | bool before_p, rtx_insn *insn, int max_uid) |
55a2c322 VM |
5651 | { |
5652 | bool res = false; | |
5653 | int i, nregs = 1; | |
5654 | rtx next_usage_insns; | |
5655 | ||
5656 | if (regno < FIRST_PSEUDO_REGISTER) | |
ad474626 | 5657 | nregs = hard_regno_nregs (regno, mode); |
55a2c322 VM |
5658 | for (i = 0; i < nregs; i++) |
5659 | if (usage_insns[regno + i].check == curr_usage_insns_check | |
5660 | && (next_usage_insns = usage_insns[regno + i].insns) != NULL_RTX | |
5661 | /* To avoid processing the register twice or more. */ | |
5662 | && ((GET_CODE (next_usage_insns) != INSN_LIST | |
5663 | && INSN_UID (next_usage_insns) < max_uid) | |
5664 | || (GET_CODE (next_usage_insns) == INSN_LIST | |
5665 | && (INSN_UID (XEXP (next_usage_insns, 0)) < max_uid))) | |
5666 | && need_for_split_p (potential_reload_hard_regs, regno + i) | |
5667 | && split_reg (before_p, regno + i, insn, next_usage_insns)) | |
5668 | res = true; | |
5669 | return res; | |
5670 | } | |
5671 | ||
8a8330b7 VM |
5672 | /* Return TRUE if rtx X is considered as an invariant for |
5673 | inheritance. */ | |
5674 | static bool | |
5675 | invariant_p (const_rtx x) | |
5676 | { | |
5677 | machine_mode mode; | |
5678 | const char *fmt; | |
5679 | enum rtx_code code; | |
5680 | int i, j; | |
5681 | ||
5682 | code = GET_CODE (x); | |
5683 | mode = GET_MODE (x); | |
5684 | if (code == SUBREG) | |
5685 | { | |
5686 | x = SUBREG_REG (x); | |
5687 | code = GET_CODE (x); | |
bd5a2c67 | 5688 | mode = wider_subreg_mode (mode, GET_MODE (x)); |
8a8330b7 VM |
5689 | } |
5690 | ||
5691 | if (MEM_P (x)) | |
5692 | return false; | |
5693 | ||
5694 | if (REG_P (x)) | |
5695 | { | |
5696 | int i, nregs, regno = REGNO (x); | |
5697 | ||
5698 | if (regno >= FIRST_PSEUDO_REGISTER || regno == STACK_POINTER_REGNUM | |
5699 | || TEST_HARD_REG_BIT (eliminable_regset, regno) | |
5700 | || GET_MODE_CLASS (GET_MODE (x)) == MODE_CC) | |
5701 | return false; | |
ad474626 | 5702 | nregs = hard_regno_nregs (regno, mode); |
8a8330b7 VM |
5703 | for (i = 0; i < nregs; i++) |
5704 | if (! fixed_regs[regno + i] | |
5705 | /* A hard register may be clobbered in the current insn | |
5706 | but we can ignore this case because if the hard | |
5707 | register is used it should be set somewhere after the | |
5708 | clobber. */ | |
5709 | || bitmap_bit_p (&invalid_invariant_regs, regno + i)) | |
5710 | return false; | |
5711 | } | |
5712 | fmt = GET_RTX_FORMAT (code); | |
5713 | for (i = GET_RTX_LENGTH (code) - 1; i >= 0; i--) | |
5714 | { | |
5715 | if (fmt[i] == 'e') | |
5716 | { | |
5717 | if (! invariant_p (XEXP (x, i))) | |
5718 | return false; | |
5719 | } | |
5720 | else if (fmt[i] == 'E') | |
5721 | { | |
5722 | for (j = XVECLEN (x, i) - 1; j >= 0; j--) | |
5723 | if (! invariant_p (XVECEXP (x, i, j))) | |
5724 | return false; | |
5725 | } | |
5726 | } | |
5727 | return true; | |
5728 | } | |
5729 | ||
5730 | /* We have 'dest_reg <- invariant'. Let us try to make an invariant | |
5731 | inheritance transformation (using dest_reg instead invariant in a | |
5732 | subsequent insn). */ | |
5733 | static bool | |
5734 | process_invariant_for_inheritance (rtx dst_reg, rtx invariant_rtx) | |
5735 | { | |
5736 | invariant_ptr_t invariant_ptr; | |
5737 | rtx_insn *insn, *new_insns; | |
5738 | rtx insn_set, insn_reg, new_reg; | |
5739 | int insn_regno; | |
5740 | bool succ_p = false; | |
5741 | int dst_regno = REGNO (dst_reg); | |
b8506a8a | 5742 | machine_mode dst_mode = GET_MODE (dst_reg); |
8a8330b7 VM |
5743 | enum reg_class cl = lra_get_allocno_class (dst_regno), insn_reg_cl; |
5744 | ||
5745 | invariant_ptr = insert_invariant (invariant_rtx); | |
5746 | if ((insn = invariant_ptr->insn) != NULL_RTX) | |
5747 | { | |
5748 | /* We have a subsequent insn using the invariant. */ | |
5749 | insn_set = single_set (insn); | |
5750 | lra_assert (insn_set != NULL); | |
5751 | insn_reg = SET_DEST (insn_set); | |
5752 | lra_assert (REG_P (insn_reg)); | |
5753 | insn_regno = REGNO (insn_reg); | |
5754 | insn_reg_cl = lra_get_allocno_class (insn_regno); | |
5755 | ||
5756 | if (dst_mode == GET_MODE (insn_reg) | |
5757 | /* We should consider only result move reg insns which are | |
5758 | cheap. */ | |
5759 | && targetm.register_move_cost (dst_mode, cl, insn_reg_cl) == 2 | |
5760 | && targetm.register_move_cost (dst_mode, cl, cl) == 2) | |
5761 | { | |
5762 | if (lra_dump_file != NULL) | |
5763 | fprintf (lra_dump_file, | |
5764 | " [[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[\n"); | |
5765 | new_reg = lra_create_new_reg (dst_mode, dst_reg, | |
5766 | cl, "invariant inheritance"); | |
5767 | bitmap_set_bit (&lra_inheritance_pseudos, REGNO (new_reg)); | |
5768 | bitmap_set_bit (&check_only_regs, REGNO (new_reg)); | |
b10d44ef | 5769 | lra_reg_info[REGNO (new_reg)].restore_rtx = PATTERN (insn); |
8a8330b7 VM |
5770 | start_sequence (); |
5771 | lra_emit_move (new_reg, dst_reg); | |
5772 | new_insns = get_insns (); | |
5773 | end_sequence (); | |
5774 | lra_process_new_insns (curr_insn, NULL, new_insns, | |
5775 | "Add invariant inheritance<-original"); | |
5776 | start_sequence (); | |
5777 | lra_emit_move (SET_DEST (insn_set), new_reg); | |
5778 | new_insns = get_insns (); | |
5779 | end_sequence (); | |
5780 | lra_process_new_insns (insn, NULL, new_insns, | |
5781 | "Changing reload<-inheritance"); | |
5782 | lra_set_insn_deleted (insn); | |
5783 | succ_p = true; | |
5784 | if (lra_dump_file != NULL) | |
5785 | { | |
5786 | fprintf (lra_dump_file, | |
5787 | " Invariant inheritance reuse change %d (bb%d):\n", | |
5788 | REGNO (new_reg), BLOCK_FOR_INSN (insn)->index); | |
5789 | dump_insn_slim (lra_dump_file, insn); | |
5790 | fprintf (lra_dump_file, | |
5791 | " ]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]\n"); | |
5792 | } | |
5793 | } | |
5794 | } | |
5795 | invariant_ptr->insn = curr_insn; | |
5796 | return succ_p; | |
5797 | } | |
5798 | ||
55a2c322 VM |
5799 | /* Check only registers living at the current program point in the |
5800 | current EBB. */ | |
5801 | static bitmap_head live_regs; | |
5802 | ||
5803 | /* Update live info in EBB given by its HEAD and TAIL insns after | |
5804 | inheritance/split transformation. The function removes dead moves | |
5805 | too. */ | |
5806 | static void | |
cfa434f6 | 5807 | update_ebb_live_info (rtx_insn *head, rtx_insn *tail) |
55a2c322 VM |
5808 | { |
5809 | unsigned int j; | |
8e9d68a9 | 5810 | int i, regno; |
55a2c322 | 5811 | bool live_p; |
cfa434f6 DM |
5812 | rtx_insn *prev_insn; |
5813 | rtx set; | |
55a2c322 VM |
5814 | bool remove_p; |
5815 | basic_block last_bb, prev_bb, curr_bb; | |
5816 | bitmap_iterator bi; | |
5817 | struct lra_insn_reg *reg; | |
5818 | edge e; | |
5819 | edge_iterator ei; | |
5820 | ||
f4eafc30 | 5821 | last_bb = BLOCK_FOR_INSN (tail); |
55a2c322 VM |
5822 | prev_bb = NULL; |
5823 | for (curr_insn = tail; | |
5824 | curr_insn != PREV_INSN (head); | |
5825 | curr_insn = prev_insn) | |
5826 | { | |
5827 | prev_insn = PREV_INSN (curr_insn); | |
911598e3 VM |
5828 | /* We need to process empty blocks too. They contain |
5829 | NOTE_INSN_BASIC_BLOCK referring for the basic block. */ | |
5830 | if (NOTE_P (curr_insn) && NOTE_KIND (curr_insn) != NOTE_INSN_BASIC_BLOCK) | |
5831 | continue; | |
55a2c322 VM |
5832 | curr_bb = BLOCK_FOR_INSN (curr_insn); |
5833 | if (curr_bb != prev_bb) | |
5834 | { | |
5835 | if (prev_bb != NULL) | |
5836 | { | |
5837 | /* Update df_get_live_in (prev_bb): */ | |
5838 | EXECUTE_IF_SET_IN_BITMAP (&check_only_regs, 0, j, bi) | |
5839 | if (bitmap_bit_p (&live_regs, j)) | |
5840 | bitmap_set_bit (df_get_live_in (prev_bb), j); | |
5841 | else | |
5842 | bitmap_clear_bit (df_get_live_in (prev_bb), j); | |
5843 | } | |
5844 | if (curr_bb != last_bb) | |
5845 | { | |
5846 | /* Update df_get_live_out (curr_bb): */ | |
5847 | EXECUTE_IF_SET_IN_BITMAP (&check_only_regs, 0, j, bi) | |
5848 | { | |
5849 | live_p = bitmap_bit_p (&live_regs, j); | |
5850 | if (! live_p) | |
5851 | FOR_EACH_EDGE (e, ei, curr_bb->succs) | |
5852 | if (bitmap_bit_p (df_get_live_in (e->dest), j)) | |
5853 | { | |
5854 | live_p = true; | |
5855 | break; | |
5856 | } | |
5857 | if (live_p) | |
5858 | bitmap_set_bit (df_get_live_out (curr_bb), j); | |
5859 | else | |
5860 | bitmap_clear_bit (df_get_live_out (curr_bb), j); | |
5861 | } | |
5862 | } | |
5863 | prev_bb = curr_bb; | |
5864 | bitmap_and (&live_regs, &check_only_regs, df_get_live_out (curr_bb)); | |
5865 | } | |
44b94bdb | 5866 | if (! NONDEBUG_INSN_P (curr_insn)) |
55a2c322 VM |
5867 | continue; |
5868 | curr_id = lra_get_insn_recog_data (curr_insn); | |
8e9d68a9 | 5869 | curr_static_id = curr_id->insn_static_data; |
55a2c322 | 5870 | remove_p = false; |
53250f44 BS |
5871 | if ((set = single_set (curr_insn)) != NULL_RTX |
5872 | && REG_P (SET_DEST (set)) | |
55a2c322 | 5873 | && (regno = REGNO (SET_DEST (set))) >= FIRST_PSEUDO_REGISTER |
53250f44 | 5874 | && SET_DEST (set) != pic_offset_table_rtx |
55a2c322 VM |
5875 | && bitmap_bit_p (&check_only_regs, regno) |
5876 | && ! bitmap_bit_p (&live_regs, regno)) | |
5877 | remove_p = true; | |
5878 | /* See which defined values die here. */ | |
5879 | for (reg = curr_id->regs; reg != NULL; reg = reg->next) | |
5880 | if (reg->type == OP_OUT && ! reg->subreg_p) | |
5881 | bitmap_clear_bit (&live_regs, reg->regno); | |
8e9d68a9 VM |
5882 | for (reg = curr_static_id->hard_regs; reg != NULL; reg = reg->next) |
5883 | if (reg->type == OP_OUT && ! reg->subreg_p) | |
5884 | bitmap_clear_bit (&live_regs, reg->regno); | |
9d86e84e VM |
5885 | if (curr_id->arg_hard_regs != NULL) |
5886 | /* Make clobbered argument hard registers die. */ | |
5887 | for (i = 0; (regno = curr_id->arg_hard_regs[i]) >= 0; i++) | |
5888 | if (regno >= FIRST_PSEUDO_REGISTER) | |
5889 | bitmap_clear_bit (&live_regs, regno - FIRST_PSEUDO_REGISTER); | |
55a2c322 VM |
5890 | /* Mark each used value as live. */ |
5891 | for (reg = curr_id->regs; reg != NULL; reg = reg->next) | |
d89ae27c | 5892 | if (reg->type != OP_OUT |
55a2c322 VM |
5893 | && bitmap_bit_p (&check_only_regs, reg->regno)) |
5894 | bitmap_set_bit (&live_regs, reg->regno); | |
8e9d68a9 VM |
5895 | for (reg = curr_static_id->hard_regs; reg != NULL; reg = reg->next) |
5896 | if (reg->type != OP_OUT | |
5897 | && bitmap_bit_p (&check_only_regs, reg->regno)) | |
5898 | bitmap_set_bit (&live_regs, reg->regno); | |
5899 | if (curr_id->arg_hard_regs != NULL) | |
9d86e84e | 5900 | /* Make used argument hard registers live. */ |
8e9d68a9 | 5901 | for (i = 0; (regno = curr_id->arg_hard_regs[i]) >= 0; i++) |
9d86e84e VM |
5902 | if (regno < FIRST_PSEUDO_REGISTER |
5903 | && bitmap_bit_p (&check_only_regs, regno)) | |
8e9d68a9 | 5904 | bitmap_set_bit (&live_regs, regno); |
55a2c322 VM |
5905 | /* It is quite important to remove dead move insns because it |
5906 | means removing dead store. We don't need to process them for | |
5907 | constraints. */ | |
5908 | if (remove_p) | |
5909 | { | |
5910 | if (lra_dump_file != NULL) | |
5911 | { | |
5912 | fprintf (lra_dump_file, " Removing dead insn:\n "); | |
cfbeaedf | 5913 | dump_insn_slim (lra_dump_file, curr_insn); |
55a2c322 VM |
5914 | } |
5915 | lra_set_insn_deleted (curr_insn); | |
5916 | } | |
5917 | } | |
5918 | } | |
5919 | ||
5920 | /* The structure describes info to do an inheritance for the current | |
5921 | insn. We need to collect such info first before doing the | |
5922 | transformations because the transformations change the insn | |
5923 | internal representation. */ | |
5924 | struct to_inherit | |
5925 | { | |
5926 | /* Original regno. */ | |
5927 | int regno; | |
5928 | /* Subsequent insns which can inherit original reg value. */ | |
5929 | rtx insns; | |
5930 | }; | |
5931 | ||
5932 | /* Array containing all info for doing inheritance from the current | |
5933 | insn. */ | |
5934 | static struct to_inherit to_inherit[LRA_MAX_INSN_RELOADS]; | |
5935 | ||
5936 | /* Number elements in the previous array. */ | |
5937 | static int to_inherit_num; | |
5938 | ||
5939 | /* Add inheritance info REGNO and INSNS. Their meaning is described in | |
5940 | structure to_inherit. */ | |
5941 | static void | |
5942 | add_to_inherit (int regno, rtx insns) | |
5943 | { | |
5944 | int i; | |
5945 | ||
5946 | for (i = 0; i < to_inherit_num; i++) | |
5947 | if (to_inherit[i].regno == regno) | |
5948 | return; | |
5949 | lra_assert (to_inherit_num < LRA_MAX_INSN_RELOADS); | |
5950 | to_inherit[to_inherit_num].regno = regno; | |
5951 | to_inherit[to_inherit_num++].insns = insns; | |
5952 | } | |
5953 | ||
5954 | /* Return the last non-debug insn in basic block BB, or the block begin | |
5955 | note if none. */ | |
cfa434f6 | 5956 | static rtx_insn * |
55a2c322 VM |
5957 | get_last_insertion_point (basic_block bb) |
5958 | { | |
cfa434f6 | 5959 | rtx_insn *insn; |
55a2c322 VM |
5960 | |
5961 | FOR_BB_INSNS_REVERSE (bb, insn) | |
5962 | if (NONDEBUG_INSN_P (insn) || NOTE_INSN_BASIC_BLOCK_P (insn)) | |
5963 | return insn; | |
5964 | gcc_unreachable (); | |
5965 | } | |
5966 | ||
5967 | /* Set up RES by registers living on edges FROM except the edge (FROM, | |
5968 | TO) or by registers set up in a jump insn in BB FROM. */ | |
5969 | static void | |
5970 | get_live_on_other_edges (basic_block from, basic_block to, bitmap res) | |
5971 | { | |
cfa434f6 | 5972 | rtx_insn *last; |
55a2c322 VM |
5973 | struct lra_insn_reg *reg; |
5974 | edge e; | |
5975 | edge_iterator ei; | |
5976 | ||
5977 | lra_assert (to != NULL); | |
5978 | bitmap_clear (res); | |
5979 | FOR_EACH_EDGE (e, ei, from->succs) | |
5980 | if (e->dest != to) | |
5981 | bitmap_ior_into (res, df_get_live_in (e->dest)); | |
5982 | last = get_last_insertion_point (from); | |
5983 | if (! JUMP_P (last)) | |
5984 | return; | |
5985 | curr_id = lra_get_insn_recog_data (last); | |
5986 | for (reg = curr_id->regs; reg != NULL; reg = reg->next) | |
5987 | if (reg->type != OP_IN) | |
5988 | bitmap_set_bit (res, reg->regno); | |
5989 | } | |
f4eafc30 | 5990 | |
55a2c322 VM |
5991 | /* Used as a temporary results of some bitmap calculations. */ |
5992 | static bitmap_head temp_bitmap; | |
5993 | ||
8e9d68a9 VM |
5994 | /* We split for reloads of small class of hard regs. The following |
5995 | defines how many hard regs the class should have to be qualified as | |
5996 | small. The code is mostly oriented to x86/x86-64 architecture | |
5997 | where some insns need to use only specific register or pair of | |
5998 | registers and these register can live in RTL explicitly, e.g. for | |
5999 | parameter passing. */ | |
6000 | static const int max_small_class_regs_num = 2; | |
6001 | ||
55a2c322 VM |
6002 | /* Do inheritance/split transformations in EBB starting with HEAD and |
6003 | finishing on TAIL. We process EBB insns in the reverse order. | |
6004 | Return true if we did any inheritance/split transformation in the | |
6005 | EBB. | |
6006 | ||
6007 | We should avoid excessive splitting which results in worse code | |
6008 | because of inaccurate cost calculations for spilling new split | |
6009 | pseudos in such case. To achieve this we do splitting only if | |
6010 | register pressure is high in given basic block and there are reload | |
6011 | pseudos requiring hard registers. We could do more register | |
6012 | pressure calculations at any given program point to avoid necessary | |
6013 | splitting even more but it is to expensive and the current approach | |
6014 | works well enough. */ | |
6015 | static bool | |
cfa434f6 | 6016 | inherit_in_ebb (rtx_insn *head, rtx_insn *tail) |
55a2c322 VM |
6017 | { |
6018 | int i, src_regno, dst_regno, nregs; | |
df2980be | 6019 | bool change_p, succ_p, update_reloads_num_p; |
cfa434f6 | 6020 | rtx_insn *prev_insn, *last_insn; |
8a8330b7 | 6021 | rtx next_usage_insns, curr_set; |
55a2c322 VM |
6022 | enum reg_class cl; |
6023 | struct lra_insn_reg *reg; | |
6024 | basic_block last_processed_bb, curr_bb = NULL; | |
6025 | HARD_REG_SET potential_reload_hard_regs, live_hard_regs; | |
6026 | bitmap to_process; | |
6027 | unsigned int j; | |
6028 | bitmap_iterator bi; | |
6029 | bool head_p, after_p; | |
6030 | ||
6031 | change_p = false; | |
6032 | curr_usage_insns_check++; | |
8a8330b7 | 6033 | clear_invariants (); |
55a2c322 VM |
6034 | reloads_num = calls_num = 0; |
6035 | bitmap_clear (&check_only_regs); | |
8a8330b7 | 6036 | bitmap_clear (&invalid_invariant_regs); |
55a2c322 VM |
6037 | last_processed_bb = NULL; |
6038 | CLEAR_HARD_REG_SET (potential_reload_hard_regs); | |
8e9d68a9 VM |
6039 | COPY_HARD_REG_SET (live_hard_regs, eliminable_regset); |
6040 | IOR_HARD_REG_SET (live_hard_regs, lra_no_alloc_regs); | |
55a2c322 VM |
6041 | /* We don't process new insns generated in the loop. */ |
6042 | for (curr_insn = tail; curr_insn != PREV_INSN (head); curr_insn = prev_insn) | |
6043 | { | |
6044 | prev_insn = PREV_INSN (curr_insn); | |
6045 | if (BLOCK_FOR_INSN (curr_insn) != NULL) | |
6046 | curr_bb = BLOCK_FOR_INSN (curr_insn); | |
6047 | if (last_processed_bb != curr_bb) | |
6048 | { | |
6049 | /* We are at the end of BB. Add qualified living | |
6050 | pseudos for potential splitting. */ | |
6051 | to_process = df_get_live_out (curr_bb); | |
6052 | if (last_processed_bb != NULL) | |
f4eafc30 | 6053 | { |
55a2c322 VM |
6054 | /* We are somewhere in the middle of EBB. */ |
6055 | get_live_on_other_edges (curr_bb, last_processed_bb, | |
6056 | &temp_bitmap); | |
6057 | to_process = &temp_bitmap; | |
6058 | } | |
6059 | last_processed_bb = curr_bb; | |
6060 | last_insn = get_last_insertion_point (curr_bb); | |
6061 | after_p = (! JUMP_P (last_insn) | |
6062 | && (! CALL_P (last_insn) | |
6063 | || (find_reg_note (last_insn, | |
6064 | REG_NORETURN, NULL_RTX) == NULL_RTX | |
6065 | && ! SIBLING_CALL_P (last_insn)))); | |
55a2c322 VM |
6066 | CLEAR_HARD_REG_SET (potential_reload_hard_regs); |
6067 | EXECUTE_IF_SET_IN_BITMAP (to_process, 0, j, bi) | |
6068 | { | |
6069 | if ((int) j >= lra_constraint_new_regno_start) | |
6070 | break; | |
6071 | if (j < FIRST_PSEUDO_REGISTER || reg_renumber[j] >= 0) | |
6072 | { | |
6073 | if (j < FIRST_PSEUDO_REGISTER) | |
6074 | SET_HARD_REG_BIT (live_hard_regs, j); | |
6075 | else | |
6076 | add_to_hard_reg_set (&live_hard_regs, | |
6077 | PSEUDO_REGNO_MODE (j), | |
6078 | reg_renumber[j]); | |
6079 | setup_next_usage_insn (j, last_insn, reloads_num, after_p); | |
6080 | } | |
6081 | } | |
6082 | } | |
6083 | src_regno = dst_regno = -1; | |
8a8330b7 VM |
6084 | curr_set = single_set (curr_insn); |
6085 | if (curr_set != NULL_RTX && REG_P (SET_DEST (curr_set))) | |
6086 | dst_regno = REGNO (SET_DEST (curr_set)); | |
6087 | if (curr_set != NULL_RTX && REG_P (SET_SRC (curr_set))) | |
6088 | src_regno = REGNO (SET_SRC (curr_set)); | |
df2980be | 6089 | update_reloads_num_p = true; |
55a2c322 VM |
6090 | if (src_regno < lra_constraint_new_regno_start |
6091 | && src_regno >= FIRST_PSEUDO_REGISTER | |
6092 | && reg_renumber[src_regno] < 0 | |
6093 | && dst_regno >= lra_constraint_new_regno_start | |
6094 | && (cl = lra_get_allocno_class (dst_regno)) != NO_REGS) | |
6095 | { | |
6096 | /* 'reload_pseudo <- original_pseudo'. */ | |
8e9d68a9 VM |
6097 | if (ira_class_hard_regs_num[cl] <= max_small_class_regs_num) |
6098 | reloads_num++; | |
df2980be | 6099 | update_reloads_num_p = false; |
55a2c322 VM |
6100 | succ_p = false; |
6101 | if (usage_insns[src_regno].check == curr_usage_insns_check | |
6102 | && (next_usage_insns = usage_insns[src_regno].insns) != NULL_RTX) | |
6103 | succ_p = inherit_reload_reg (false, src_regno, cl, | |
6104 | curr_insn, next_usage_insns); | |
6105 | if (succ_p) | |
6106 | change_p = true; | |
6107 | else | |
6108 | setup_next_usage_insn (src_regno, curr_insn, reloads_num, false); | |
6109 | if (hard_reg_set_subset_p (reg_class_contents[cl], live_hard_regs)) | |
6110 | IOR_HARD_REG_SET (potential_reload_hard_regs, | |
6111 | reg_class_contents[cl]); | |
6112 | } | |
8a8330b7 VM |
6113 | else if (src_regno < 0 |
6114 | && dst_regno >= lra_constraint_new_regno_start | |
6115 | && invariant_p (SET_SRC (curr_set)) | |
6116 | && (cl = lra_get_allocno_class (dst_regno)) != NO_REGS | |
f7abdf36 VM |
6117 | && ! bitmap_bit_p (&invalid_invariant_regs, dst_regno) |
6118 | && ! bitmap_bit_p (&invalid_invariant_regs, | |
6119 | ORIGINAL_REGNO(regno_reg_rtx[dst_regno]))) | |
8a8330b7 VM |
6120 | { |
6121 | /* 'reload_pseudo <- invariant'. */ | |
6122 | if (ira_class_hard_regs_num[cl] <= max_small_class_regs_num) | |
6123 | reloads_num++; | |
6124 | update_reloads_num_p = false; | |
6125 | if (process_invariant_for_inheritance (SET_DEST (curr_set), SET_SRC (curr_set))) | |
6126 | change_p = true; | |
6127 | if (hard_reg_set_subset_p (reg_class_contents[cl], live_hard_regs)) | |
6128 | IOR_HARD_REG_SET (potential_reload_hard_regs, | |
6129 | reg_class_contents[cl]); | |
6130 | } | |
55a2c322 VM |
6131 | else if (src_regno >= lra_constraint_new_regno_start |
6132 | && dst_regno < lra_constraint_new_regno_start | |
6133 | && dst_regno >= FIRST_PSEUDO_REGISTER | |
6134 | && reg_renumber[dst_regno] < 0 | |
6135 | && (cl = lra_get_allocno_class (src_regno)) != NO_REGS | |
6136 | && usage_insns[dst_regno].check == curr_usage_insns_check | |
6137 | && (next_usage_insns | |
6138 | = usage_insns[dst_regno].insns) != NULL_RTX) | |
6139 | { | |
8e9d68a9 VM |
6140 | if (ira_class_hard_regs_num[cl] <= max_small_class_regs_num) |
6141 | reloads_num++; | |
df2980be | 6142 | update_reloads_num_p = false; |
55a2c322 VM |
6143 | /* 'original_pseudo <- reload_pseudo'. */ |
6144 | if (! JUMP_P (curr_insn) | |
6145 | && inherit_reload_reg (true, dst_regno, cl, | |
6146 | curr_insn, next_usage_insns)) | |
6147 | change_p = true; | |
6148 | /* Invalidate. */ | |
6149 | usage_insns[dst_regno].check = 0; | |
6150 | if (hard_reg_set_subset_p (reg_class_contents[cl], live_hard_regs)) | |
6151 | IOR_HARD_REG_SET (potential_reload_hard_regs, | |
6152 | reg_class_contents[cl]); | |
6153 | } | |
6154 | else if (INSN_P (curr_insn)) | |
6155 | { | |
2f259720 | 6156 | int iter; |
55a2c322 VM |
6157 | int max_uid = get_max_uid (); |
6158 | ||
6159 | curr_id = lra_get_insn_recog_data (curr_insn); | |
2f259720 | 6160 | curr_static_id = curr_id->insn_static_data; |
55a2c322 VM |
6161 | to_inherit_num = 0; |
6162 | /* Process insn definitions. */ | |
2f259720 VM |
6163 | for (iter = 0; iter < 2; iter++) |
6164 | for (reg = iter == 0 ? curr_id->regs : curr_static_id->hard_regs; | |
6165 | reg != NULL; | |
6166 | reg = reg->next) | |
6167 | if (reg->type != OP_IN | |
6168 | && (dst_regno = reg->regno) < lra_constraint_new_regno_start) | |
6169 | { | |
6170 | if (dst_regno >= FIRST_PSEUDO_REGISTER && reg->type == OP_OUT | |
6171 | && reg_renumber[dst_regno] < 0 && ! reg->subreg_p | |
6172 | && usage_insns[dst_regno].check == curr_usage_insns_check | |
6173 | && (next_usage_insns | |
6174 | = usage_insns[dst_regno].insns) != NULL_RTX) | |
6175 | { | |
6176 | struct lra_insn_reg *r; | |
6177 | ||
6178 | for (r = curr_id->regs; r != NULL; r = r->next) | |
6179 | if (r->type != OP_OUT && r->regno == dst_regno) | |
6180 | break; | |
6181 | /* Don't do inheritance if the pseudo is also | |
6182 | used in the insn. */ | |
6183 | if (r == NULL) | |
6184 | /* We can not do inheritance right now | |
6185 | because the current insn reg info (chain | |
6186 | regs) can change after that. */ | |
6187 | add_to_inherit (dst_regno, next_usage_insns); | |
6188 | } | |
6189 | /* We can not process one reg twice here because of | |
6190 | usage_insns invalidation. */ | |
6191 | if ((dst_regno < FIRST_PSEUDO_REGISTER | |
6192 | || reg_renumber[dst_regno] >= 0) | |
e32e4c4a | 6193 | && ! reg->subreg_p && reg->type != OP_IN) |
2f259720 VM |
6194 | { |
6195 | HARD_REG_SET s; | |
6196 | ||
6197 | if (split_if_necessary (dst_regno, reg->biggest_mode, | |
6198 | potential_reload_hard_regs, | |
6199 | false, curr_insn, max_uid)) | |
6200 | change_p = true; | |
6201 | CLEAR_HARD_REG_SET (s); | |
6202 | if (dst_regno < FIRST_PSEUDO_REGISTER) | |
6203 | add_to_hard_reg_set (&s, reg->biggest_mode, dst_regno); | |
6204 | else | |
6205 | add_to_hard_reg_set (&s, PSEUDO_REGNO_MODE (dst_regno), | |
6206 | reg_renumber[dst_regno]); | |
6207 | AND_COMPL_HARD_REG_SET (live_hard_regs, s); | |
6208 | } | |
6209 | /* We should invalidate potential inheritance or | |
6210 | splitting for the current insn usages to the next | |
6211 | usage insns (see code below) as the output pseudo | |
6212 | prevents this. */ | |
6213 | if ((dst_regno >= FIRST_PSEUDO_REGISTER | |
6214 | && reg_renumber[dst_regno] < 0) | |
6215 | || (reg->type == OP_OUT && ! reg->subreg_p | |
6216 | && (dst_regno < FIRST_PSEUDO_REGISTER | |
6217 | || reg_renumber[dst_regno] >= 0))) | |
6218 | { | |
6219 | /* Invalidate and mark definitions. */ | |
6220 | if (dst_regno >= FIRST_PSEUDO_REGISTER) | |
6221 | usage_insns[dst_regno].check = -(int) INSN_UID (curr_insn); | |
6222 | else | |
6223 | { | |
ad474626 RS |
6224 | nregs = hard_regno_nregs (dst_regno, |
6225 | reg->biggest_mode); | |
2f259720 VM |
6226 | for (i = 0; i < nregs; i++) |
6227 | usage_insns[dst_regno + i].check | |
6228 | = -(int) INSN_UID (curr_insn); | |
6229 | } | |
6230 | } | |
6231 | } | |
9d86e84e VM |
6232 | /* Process clobbered call regs. */ |
6233 | if (curr_id->arg_hard_regs != NULL) | |
6234 | for (i = 0; (dst_regno = curr_id->arg_hard_regs[i]) >= 0; i++) | |
6235 | if (dst_regno >= FIRST_PSEUDO_REGISTER) | |
6236 | usage_insns[dst_regno - FIRST_PSEUDO_REGISTER].check | |
6237 | = -(int) INSN_UID (curr_insn); | |
55a2c322 VM |
6238 | if (! JUMP_P (curr_insn)) |
6239 | for (i = 0; i < to_inherit_num; i++) | |
6240 | if (inherit_reload_reg (true, to_inherit[i].regno, | |
6241 | ALL_REGS, curr_insn, | |
6242 | to_inherit[i].insns)) | |
6243 | change_p = true; | |
6244 | if (CALL_P (curr_insn)) | |
6245 | { | |
cfa434f6 DM |
6246 | rtx cheap, pat, dest; |
6247 | rtx_insn *restore; | |
55a2c322 VM |
6248 | int regno, hard_regno; |
6249 | ||
6250 | calls_num++; | |
6251 | if ((cheap = find_reg_note (curr_insn, | |
6252 | REG_RETURNED, NULL_RTX)) != NULL_RTX | |
6253 | && ((cheap = XEXP (cheap, 0)), true) | |
6254 | && (regno = REGNO (cheap)) >= FIRST_PSEUDO_REGISTER | |
6255 | && (hard_regno = reg_renumber[regno]) >= 0 | |
851dac7c | 6256 | && usage_insns[regno].check == curr_usage_insns_check |
55a2c322 VM |
6257 | /* If there are pending saves/restores, the |
6258 | optimization is not worth. */ | |
6259 | && usage_insns[regno].calls_num == calls_num - 1 | |
6260 | && TEST_HARD_REG_BIT (call_used_reg_set, hard_regno)) | |
6261 | { | |
6262 | /* Restore the pseudo from the call result as | |
6263 | REG_RETURNED note says that the pseudo value is | |
6264 | in the call result and the pseudo is an argument | |
6265 | of the call. */ | |
6266 | pat = PATTERN (curr_insn); | |
6267 | if (GET_CODE (pat) == PARALLEL) | |
6268 | pat = XVECEXP (pat, 0, 0); | |
6269 | dest = SET_DEST (pat); | |
54bddf1d IE |
6270 | /* For multiple return values dest is PARALLEL. |
6271 | Currently we handle only single return value case. */ | |
6272 | if (REG_P (dest)) | |
6273 | { | |
6274 | start_sequence (); | |
6275 | emit_move_insn (cheap, copy_rtx (dest)); | |
6276 | restore = get_insns (); | |
6277 | end_sequence (); | |
6278 | lra_process_new_insns (curr_insn, NULL, restore, | |
6279 | "Inserting call parameter restore"); | |
6280 | /* We don't need to save/restore of the pseudo from | |
6281 | this call. */ | |
6282 | usage_insns[regno].calls_num = calls_num; | |
6283 | bitmap_set_bit (&check_only_regs, regno); | |
6284 | } | |
55a2c322 VM |
6285 | } |
6286 | } | |
6287 | to_inherit_num = 0; | |
6288 | /* Process insn usages. */ | |
2f259720 VM |
6289 | for (iter = 0; iter < 2; iter++) |
6290 | for (reg = iter == 0 ? curr_id->regs : curr_static_id->hard_regs; | |
6291 | reg != NULL; | |
6292 | reg = reg->next) | |
6293 | if ((reg->type != OP_OUT | |
6294 | || (reg->type == OP_OUT && reg->subreg_p)) | |
6295 | && (src_regno = reg->regno) < lra_constraint_new_regno_start) | |
6296 | { | |
6297 | if (src_regno >= FIRST_PSEUDO_REGISTER | |
6298 | && reg_renumber[src_regno] < 0 && reg->type == OP_IN) | |
6299 | { | |
6300 | if (usage_insns[src_regno].check == curr_usage_insns_check | |
6301 | && (next_usage_insns | |
6302 | = usage_insns[src_regno].insns) != NULL_RTX | |
6303 | && NONDEBUG_INSN_P (curr_insn)) | |
6304 | add_to_inherit (src_regno, next_usage_insns); | |
6305 | else if (usage_insns[src_regno].check | |
6306 | != -(int) INSN_UID (curr_insn)) | |
6307 | /* Add usages but only if the reg is not set up | |
6308 | in the same insn. */ | |
6309 | add_next_usage_insn (src_regno, curr_insn, reloads_num); | |
6310 | } | |
6311 | else if (src_regno < FIRST_PSEUDO_REGISTER | |
6312 | || reg_renumber[src_regno] >= 0) | |
6313 | { | |
6314 | bool before_p; | |
e67d1102 | 6315 | rtx_insn *use_insn = curr_insn; |
2f259720 VM |
6316 | |
6317 | before_p = (JUMP_P (curr_insn) | |
6318 | || (CALL_P (curr_insn) && reg->type == OP_IN)); | |
6319 | if (NONDEBUG_INSN_P (curr_insn) | |
8e9d68a9 | 6320 | && (! JUMP_P (curr_insn) || reg->type == OP_IN) |
2f259720 VM |
6321 | && split_if_necessary (src_regno, reg->biggest_mode, |
6322 | potential_reload_hard_regs, | |
6323 | before_p, curr_insn, max_uid)) | |
6324 | { | |
6325 | if (reg->subreg_p) | |
6326 | lra_risky_transformations_p = true; | |
6327 | change_p = true; | |
8e9d68a9 | 6328 | /* Invalidate. */ |
2f259720 VM |
6329 | usage_insns[src_regno].check = 0; |
6330 | if (before_p) | |
6331 | use_insn = PREV_INSN (curr_insn); | |
6332 | } | |
6333 | if (NONDEBUG_INSN_P (curr_insn)) | |
6334 | { | |
6335 | if (src_regno < FIRST_PSEUDO_REGISTER) | |
6336 | add_to_hard_reg_set (&live_hard_regs, | |
6337 | reg->biggest_mode, src_regno); | |
6338 | else | |
6339 | add_to_hard_reg_set (&live_hard_regs, | |
6340 | PSEUDO_REGNO_MODE (src_regno), | |
6341 | reg_renumber[src_regno]); | |
6342 | } | |
6343 | add_next_usage_insn (src_regno, use_insn, reloads_num); | |
6344 | } | |
6345 | } | |
9d86e84e | 6346 | /* Process used call regs. */ |
df2980be VM |
6347 | if (curr_id->arg_hard_regs != NULL) |
6348 | for (i = 0; (src_regno = curr_id->arg_hard_regs[i]) >= 0; i++) | |
6349 | if (src_regno < FIRST_PSEUDO_REGISTER) | |
6350 | { | |
6351 | SET_HARD_REG_BIT (live_hard_regs, src_regno); | |
6352 | add_next_usage_insn (src_regno, curr_insn, reloads_num); | |
6353 | } | |
55a2c322 VM |
6354 | for (i = 0; i < to_inherit_num; i++) |
6355 | { | |
6356 | src_regno = to_inherit[i].regno; | |
6357 | if (inherit_reload_reg (false, src_regno, ALL_REGS, | |
6358 | curr_insn, to_inherit[i].insns)) | |
6359 | change_p = true; | |
6360 | else | |
6361 | setup_next_usage_insn (src_regno, curr_insn, reloads_num, false); | |
6362 | } | |
6363 | } | |
df2980be | 6364 | if (update_reloads_num_p |
8a8330b7 | 6365 | && NONDEBUG_INSN_P (curr_insn) && curr_set != NULL_RTX) |
df2980be VM |
6366 | { |
6367 | int regno = -1; | |
8a8330b7 VM |
6368 | if ((REG_P (SET_DEST (curr_set)) |
6369 | && (regno = REGNO (SET_DEST (curr_set))) >= lra_constraint_new_regno_start | |
df2980be VM |
6370 | && reg_renumber[regno] < 0 |
6371 | && (cl = lra_get_allocno_class (regno)) != NO_REGS) | |
8a8330b7 VM |
6372 | || (REG_P (SET_SRC (curr_set)) |
6373 | && (regno = REGNO (SET_SRC (curr_set))) >= lra_constraint_new_regno_start | |
df2980be VM |
6374 | && reg_renumber[regno] < 0 |
6375 | && (cl = lra_get_allocno_class (regno)) != NO_REGS)) | |
6376 | { | |
8e9d68a9 VM |
6377 | if (ira_class_hard_regs_num[cl] <= max_small_class_regs_num) |
6378 | reloads_num++; | |
df2980be VM |
6379 | if (hard_reg_set_subset_p (reg_class_contents[cl], live_hard_regs)) |
6380 | IOR_HARD_REG_SET (potential_reload_hard_regs, | |
6381 | reg_class_contents[cl]); | |
6382 | } | |
6383 | } | |
8a8330b7 VM |
6384 | if (NONDEBUG_INSN_P (curr_insn)) |
6385 | { | |
6386 | int regno; | |
6387 | ||
6388 | /* Invalidate invariants with changed regs. */ | |
6389 | curr_id = lra_get_insn_recog_data (curr_insn); | |
6390 | for (reg = curr_id->regs; reg != NULL; reg = reg->next) | |
6391 | if (reg->type != OP_IN) | |
f7abdf36 VM |
6392 | { |
6393 | bitmap_set_bit (&invalid_invariant_regs, reg->regno); | |
6394 | bitmap_set_bit (&invalid_invariant_regs, | |
6395 | ORIGINAL_REGNO (regno_reg_rtx[reg->regno])); | |
6396 | } | |
8a8330b7 VM |
6397 | curr_static_id = curr_id->insn_static_data; |
6398 | for (reg = curr_static_id->hard_regs; reg != NULL; reg = reg->next) | |
6399 | if (reg->type != OP_IN) | |
6400 | bitmap_set_bit (&invalid_invariant_regs, reg->regno); | |
6401 | if (curr_id->arg_hard_regs != NULL) | |
6402 | for (i = 0; (regno = curr_id->arg_hard_regs[i]) >= 0; i++) | |
f7abdf36 | 6403 | if (regno >= FIRST_PSEUDO_REGISTER) |
8a8330b7 | 6404 | bitmap_set_bit (&invalid_invariant_regs, |
f7abdf36 | 6405 | regno - FIRST_PSEUDO_REGISTER); |
8a8330b7 | 6406 | } |
55a2c322 VM |
6407 | /* We reached the start of the current basic block. */ |
6408 | if (prev_insn == NULL_RTX || prev_insn == PREV_INSN (head) | |
6409 | || BLOCK_FOR_INSN (prev_insn) != curr_bb) | |
6410 | { | |
6411 | /* We reached the beginning of the current block -- do | |
6412 | rest of spliting in the current BB. */ | |
6413 | to_process = df_get_live_in (curr_bb); | |
6414 | if (BLOCK_FOR_INSN (head) != curr_bb) | |
f4eafc30 | 6415 | { |
55a2c322 VM |
6416 | /* We are somewhere in the middle of EBB. */ |
6417 | get_live_on_other_edges (EDGE_PRED (curr_bb, 0)->src, | |
6418 | curr_bb, &temp_bitmap); | |
6419 | to_process = &temp_bitmap; | |
6420 | } | |
6421 | head_p = true; | |
6422 | EXECUTE_IF_SET_IN_BITMAP (to_process, 0, j, bi) | |
6423 | { | |
6424 | if ((int) j >= lra_constraint_new_regno_start) | |
6425 | break; | |
6426 | if (((int) j < FIRST_PSEUDO_REGISTER || reg_renumber[j] >= 0) | |
6427 | && usage_insns[j].check == curr_usage_insns_check | |
6428 | && (next_usage_insns = usage_insns[j].insns) != NULL_RTX) | |
6429 | { | |
6430 | if (need_for_split_p (potential_reload_hard_regs, j)) | |
6431 | { | |
6432 | if (lra_dump_file != NULL && head_p) | |
6433 | { | |
6434 | fprintf (lra_dump_file, | |
6435 | " ----------------------------------\n"); | |
6436 | head_p = false; | |
6437 | } | |
6438 | if (split_reg (false, j, bb_note (curr_bb), | |
6439 | next_usage_insns)) | |
6440 | change_p = true; | |
6441 | } | |
6442 | usage_insns[j].check = 0; | |
6443 | } | |
6444 | } | |
6445 | } | |
6446 | } | |
6447 | return change_p; | |
6448 | } | |
6449 | ||
6450 | /* This value affects EBB forming. If probability of edge from EBB to | |
6451 | a BB is not greater than the following value, we don't add the BB | |
f4eafc30 | 6452 | to EBB. */ |
fb8a0e40 VM |
6453 | #define EBB_PROBABILITY_CUTOFF \ |
6454 | ((REG_BR_PROB_BASE * LRA_INHERITANCE_EBB_PROBABILITY_CUTOFF) / 100) | |
55a2c322 VM |
6455 | |
6456 | /* Current number of inheritance/split iteration. */ | |
6457 | int lra_inheritance_iter; | |
6458 | ||
6459 | /* Entry function for inheritance/split pass. */ | |
6460 | void | |
6461 | lra_inheritance (void) | |
6462 | { | |
6463 | int i; | |
6464 | basic_block bb, start_bb; | |
6465 | edge e; | |
6466 | ||
55a2c322 | 6467 | lra_inheritance_iter++; |
8e3a4869 | 6468 | if (lra_inheritance_iter > LRA_MAX_INHERITANCE_PASSES) |
e731262b VM |
6469 | return; |
6470 | timevar_push (TV_LRA_INHERITANCE); | |
55a2c322 VM |
6471 | if (lra_dump_file != NULL) |
6472 | fprintf (lra_dump_file, "\n********** Inheritance #%d: **********\n\n", | |
6473 | lra_inheritance_iter); | |
6474 | curr_usage_insns_check = 0; | |
6475 | usage_insns = XNEWVEC (struct usage_insns, lra_constraint_new_regno_start); | |
6476 | for (i = 0; i < lra_constraint_new_regno_start; i++) | |
6477 | usage_insns[i].check = 0; | |
6478 | bitmap_initialize (&check_only_regs, ®_obstack); | |
8a8330b7 | 6479 | bitmap_initialize (&invalid_invariant_regs, ®_obstack); |
55a2c322 VM |
6480 | bitmap_initialize (&live_regs, ®_obstack); |
6481 | bitmap_initialize (&temp_bitmap, ®_obstack); | |
6482 | bitmap_initialize (&ebb_global_regs, ®_obstack); | |
11cd3bed | 6483 | FOR_EACH_BB_FN (bb, cfun) |
55a2c322 VM |
6484 | { |
6485 | start_bb = bb; | |
6486 | if (lra_dump_file != NULL) | |
6487 | fprintf (lra_dump_file, "EBB"); | |
6488 | /* Form a EBB starting with BB. */ | |
6489 | bitmap_clear (&ebb_global_regs); | |
6490 | bitmap_ior_into (&ebb_global_regs, df_get_live_in (bb)); | |
6491 | for (;;) | |
6492 | { | |
6493 | if (lra_dump_file != NULL) | |
6494 | fprintf (lra_dump_file, " %d", bb->index); | |
fefa31b5 DM |
6495 | if (bb->next_bb == EXIT_BLOCK_PTR_FOR_FN (cfun) |
6496 | || LABEL_P (BB_HEAD (bb->next_bb))) | |
55a2c322 VM |
6497 | break; |
6498 | e = find_fallthru_edge (bb->succs); | |
6499 | if (! e) | |
6500 | break; | |
357067f2 JH |
6501 | if (e->probability.initialized_p () |
6502 | && e->probability.to_reg_br_prob_base () < EBB_PROBABILITY_CUTOFF) | |
55a2c322 VM |
6503 | break; |
6504 | bb = bb->next_bb; | |
6505 | } | |
6506 | bitmap_ior_into (&ebb_global_regs, df_get_live_out (bb)); | |
6507 | if (lra_dump_file != NULL) | |
6508 | fprintf (lra_dump_file, "\n"); | |
6509 | if (inherit_in_ebb (BB_HEAD (start_bb), BB_END (bb))) | |
6510 | /* Remember that the EBB head and tail can change in | |
6511 | inherit_in_ebb. */ | |
6512 | update_ebb_live_info (BB_HEAD (start_bb), BB_END (bb)); | |
6513 | } | |
6514 | bitmap_clear (&ebb_global_regs); | |
6515 | bitmap_clear (&temp_bitmap); | |
6516 | bitmap_clear (&live_regs); | |
8a8330b7 | 6517 | bitmap_clear (&invalid_invariant_regs); |
55a2c322 VM |
6518 | bitmap_clear (&check_only_regs); |
6519 | free (usage_insns); | |
6520 | ||
6521 | timevar_pop (TV_LRA_INHERITANCE); | |
6522 | } | |
6523 | ||
6524 | \f | |
6525 | ||
6526 | /* This page contains code to undo failed inheritance/split | |
6527 | transformations. */ | |
6528 | ||
6529 | /* Current number of iteration undoing inheritance/split. */ | |
6530 | int lra_undo_inheritance_iter; | |
6531 | ||
6532 | /* Fix BB live info LIVE after removing pseudos created on pass doing | |
6533 | inheritance/split which are REMOVED_PSEUDOS. */ | |
6534 | static void | |
6535 | fix_bb_live_info (bitmap live, bitmap removed_pseudos) | |
6536 | { | |
6537 | unsigned int regno; | |
6538 | bitmap_iterator bi; | |
6539 | ||
6540 | EXECUTE_IF_SET_IN_BITMAP (removed_pseudos, 0, regno, bi) | |
8a8330b7 VM |
6541 | if (bitmap_clear_bit (live, regno) |
6542 | && REG_P (lra_reg_info[regno].restore_rtx)) | |
6543 | bitmap_set_bit (live, REGNO (lra_reg_info[regno].restore_rtx)); | |
55a2c322 VM |
6544 | } |
6545 | ||
6546 | /* Return regno of the (subreg of) REG. Otherwise, return a negative | |
6547 | number. */ | |
6548 | static int | |
6549 | get_regno (rtx reg) | |
6550 | { | |
6551 | if (GET_CODE (reg) == SUBREG) | |
6552 | reg = SUBREG_REG (reg); | |
6553 | if (REG_P (reg)) | |
6554 | return REGNO (reg); | |
6555 | return -1; | |
6556 | } | |
6557 | ||
cefe08a4 VM |
6558 | /* Delete a move INSN with destination reg DREGNO and a previous |
6559 | clobber insn with the same regno. The inheritance/split code can | |
6560 | generate moves with preceding clobber and when we delete such moves | |
6561 | we should delete the clobber insn too to keep the correct life | |
6562 | info. */ | |
6563 | static void | |
6564 | delete_move_and_clobber (rtx_insn *insn, int dregno) | |
6565 | { | |
6566 | rtx_insn *prev_insn = PREV_INSN (insn); | |
6567 | ||
6568 | lra_set_insn_deleted (insn); | |
79b57d18 | 6569 | lra_assert (dregno >= 0); |
cefe08a4 VM |
6570 | if (prev_insn != NULL && NONDEBUG_INSN_P (prev_insn) |
6571 | && GET_CODE (PATTERN (prev_insn)) == CLOBBER | |
6572 | && dregno == get_regno (XEXP (PATTERN (prev_insn), 0))) | |
6573 | lra_set_insn_deleted (prev_insn); | |
6574 | } | |
6575 | ||
55a2c322 VM |
6576 | /* Remove inheritance/split pseudos which are in REMOVE_PSEUDOS and |
6577 | return true if we did any change. The undo transformations for | |
6578 | inheritance looks like | |
6579 | i <- i2 | |
6580 | p <- i => p <- i2 | |
6581 | or removing | |
6582 | p <- i, i <- p, and i <- i3 | |
6583 | where p is original pseudo from which inheritance pseudo i was | |
6584 | created, i and i3 are removed inheritance pseudos, i2 is another | |
6585 | not removed inheritance pseudo. All split pseudos or other | |
6586 | occurrences of removed inheritance pseudos are changed on the | |
6587 | corresponding original pseudos. | |
6588 | ||
6589 | The function also schedules insns changed and created during | |
6590 | inheritance/split pass for processing by the subsequent constraint | |
6591 | pass. */ | |
6592 | static bool | |
6593 | remove_inheritance_pseudos (bitmap remove_pseudos) | |
6594 | { | |
6595 | basic_block bb; | |
8a8330b7 VM |
6596 | int regno, sregno, prev_sregno, dregno; |
6597 | rtx restore_rtx; | |
cfa434f6 DM |
6598 | rtx set, prev_set; |
6599 | rtx_insn *prev_insn; | |
55a2c322 VM |
6600 | bool change_p, done_p; |
6601 | ||
6602 | change_p = ! bitmap_empty_p (remove_pseudos); | |
6603 | /* We can not finish the function right away if CHANGE_P is true | |
6604 | because we need to marks insns affected by previous | |
6605 | inheritance/split pass for processing by the subsequent | |
6606 | constraint pass. */ | |
11cd3bed | 6607 | FOR_EACH_BB_FN (bb, cfun) |
55a2c322 VM |
6608 | { |
6609 | fix_bb_live_info (df_get_live_in (bb), remove_pseudos); | |
6610 | fix_bb_live_info (df_get_live_out (bb), remove_pseudos); | |
6611 | FOR_BB_INSNS_REVERSE (bb, curr_insn) | |
6612 | { | |
6613 | if (! INSN_P (curr_insn)) | |
6614 | continue; | |
6615 | done_p = false; | |
6616 | sregno = dregno = -1; | |
6617 | if (change_p && NONDEBUG_INSN_P (curr_insn) | |
6618 | && (set = single_set (curr_insn)) != NULL_RTX) | |
6619 | { | |
6620 | dregno = get_regno (SET_DEST (set)); | |
6621 | sregno = get_regno (SET_SRC (set)); | |
6622 | } | |
f4eafc30 | 6623 | |
55a2c322 VM |
6624 | if (sregno >= 0 && dregno >= 0) |
6625 | { | |
8a8330b7 VM |
6626 | if (bitmap_bit_p (remove_pseudos, dregno) |
6627 | && ! REG_P (lra_reg_info[dregno].restore_rtx)) | |
6628 | { | |
6629 | /* invariant inheritance pseudo <- original pseudo */ | |
6630 | if (lra_dump_file != NULL) | |
6631 | { | |
6632 | fprintf (lra_dump_file, " Removing invariant inheritance:\n"); | |
6633 | dump_insn_slim (lra_dump_file, curr_insn); | |
6634 | fprintf (lra_dump_file, "\n"); | |
6635 | } | |
6636 | delete_move_and_clobber (curr_insn, dregno); | |
6637 | done_p = true; | |
6638 | } | |
6639 | else if (bitmap_bit_p (remove_pseudos, sregno) | |
6640 | && ! REG_P (lra_reg_info[sregno].restore_rtx)) | |
6641 | { | |
6642 | /* reload pseudo <- invariant inheritance pseudo */ | |
6643 | start_sequence (); | |
6644 | /* We can not just change the source. It might be | |
6645 | an insn different from the move. */ | |
b10d44ef | 6646 | emit_insn (lra_reg_info[sregno].restore_rtx); |
8a8330b7 VM |
6647 | rtx_insn *new_insns = get_insns (); |
6648 | end_sequence (); | |
b10d44ef VM |
6649 | lra_assert (single_set (new_insns) != NULL |
6650 | && SET_DEST (set) == SET_DEST (single_set (new_insns))); | |
8a8330b7 VM |
6651 | lra_process_new_insns (curr_insn, NULL, new_insns, |
6652 | "Changing reload<-invariant inheritance"); | |
6653 | delete_move_and_clobber (curr_insn, dregno); | |
6654 | done_p = true; | |
6655 | } | |
6656 | else if ((bitmap_bit_p (remove_pseudos, sregno) | |
6657 | && (get_regno (lra_reg_info[sregno].restore_rtx) == dregno | |
6658 | || (bitmap_bit_p (remove_pseudos, dregno) | |
6659 | && get_regno (lra_reg_info[sregno].restore_rtx) >= 0 | |
6660 | && (get_regno (lra_reg_info[sregno].restore_rtx) | |
6661 | == get_regno (lra_reg_info[dregno].restore_rtx))))) | |
55a2c322 | 6662 | || (bitmap_bit_p (remove_pseudos, dregno) |
8a8330b7 | 6663 | && get_regno (lra_reg_info[dregno].restore_rtx) == sregno)) |
55a2c322 VM |
6664 | /* One of the following cases: |
6665 | original <- removed inheritance pseudo | |
6666 | removed inherit pseudo <- another removed inherit pseudo | |
6667 | removed inherit pseudo <- original pseudo | |
6668 | Or | |
6669 | removed_split_pseudo <- original_reg | |
6670 | original_reg <- removed_split_pseudo */ | |
6671 | { | |
6672 | if (lra_dump_file != NULL) | |
6673 | { | |
6674 | fprintf (lra_dump_file, " Removing %s:\n", | |
6675 | bitmap_bit_p (&lra_split_regs, sregno) | |
6676 | || bitmap_bit_p (&lra_split_regs, dregno) | |
6677 | ? "split" : "inheritance"); | |
cfbeaedf | 6678 | dump_insn_slim (lra_dump_file, curr_insn); |
55a2c322 | 6679 | } |
cefe08a4 | 6680 | delete_move_and_clobber (curr_insn, dregno); |
55a2c322 VM |
6681 | done_p = true; |
6682 | } | |
6683 | else if (bitmap_bit_p (remove_pseudos, sregno) | |
6684 | && bitmap_bit_p (&lra_inheritance_pseudos, sregno)) | |
6685 | { | |
6686 | /* Search the following pattern: | |
6687 | inherit_or_split_pseudo1 <- inherit_or_split_pseudo2 | |
6688 | original_pseudo <- inherit_or_split_pseudo1 | |
6689 | where the 2nd insn is the current insn and | |
6690 | inherit_or_split_pseudo2 is not removed. If it is found, | |
6691 | change the current insn onto: | |
6692 | original_pseudo <- inherit_or_split_pseudo2. */ | |
6693 | for (prev_insn = PREV_INSN (curr_insn); | |
6694 | prev_insn != NULL_RTX && ! NONDEBUG_INSN_P (prev_insn); | |
6695 | prev_insn = PREV_INSN (prev_insn)) | |
6696 | ; | |
6697 | if (prev_insn != NULL_RTX && BLOCK_FOR_INSN (prev_insn) == bb | |
6698 | && (prev_set = single_set (prev_insn)) != NULL_RTX | |
6699 | /* There should be no subregs in insn we are | |
6700 | searching because only the original reg might | |
6701 | be in subreg when we changed the mode of | |
6702 | load/store for splitting. */ | |
6703 | && REG_P (SET_DEST (prev_set)) | |
6704 | && REG_P (SET_SRC (prev_set)) | |
6705 | && (int) REGNO (SET_DEST (prev_set)) == sregno | |
6706 | && ((prev_sregno = REGNO (SET_SRC (prev_set))) | |
6707 | >= FIRST_PSEUDO_REGISTER) | |
8a8330b7 VM |
6708 | && (lra_reg_info[prev_sregno].restore_rtx == NULL_RTX |
6709 | || | |
6710 | /* As we consider chain of inheritance or | |
6711 | splitting described in above comment we should | |
6712 | check that sregno and prev_sregno were | |
6713 | inheritance/split pseudos created from the | |
6714 | same original regno. */ | |
6715 | (get_regno (lra_reg_info[sregno].restore_rtx) >= 0 | |
6716 | && (get_regno (lra_reg_info[sregno].restore_rtx) | |
6717 | == get_regno (lra_reg_info[prev_sregno].restore_rtx)))) | |
55a2c322 VM |
6718 | && ! bitmap_bit_p (remove_pseudos, prev_sregno)) |
6719 | { | |
6720 | lra_assert (GET_MODE (SET_SRC (prev_set)) | |
6721 | == GET_MODE (regno_reg_rtx[sregno])); | |
6722 | if (GET_CODE (SET_SRC (set)) == SUBREG) | |
6723 | SUBREG_REG (SET_SRC (set)) = SET_SRC (prev_set); | |
6724 | else | |
6725 | SET_SRC (set) = SET_SRC (prev_set); | |
12b308fa VM |
6726 | /* As we are finishing with processing the insn |
6727 | here, check the destination too as it might | |
6728 | inheritance pseudo for another pseudo. */ | |
6729 | if (bitmap_bit_p (remove_pseudos, dregno) | |
6730 | && bitmap_bit_p (&lra_inheritance_pseudos, dregno) | |
8a8330b7 VM |
6731 | && (restore_rtx |
6732 | = lra_reg_info[dregno].restore_rtx) != NULL_RTX) | |
12b308fa VM |
6733 | { |
6734 | if (GET_CODE (SET_DEST (set)) == SUBREG) | |
8a8330b7 | 6735 | SUBREG_REG (SET_DEST (set)) = restore_rtx; |
12b308fa | 6736 | else |
8a8330b7 | 6737 | SET_DEST (set) = restore_rtx; |
12b308fa | 6738 | } |
55a2c322 VM |
6739 | lra_push_insn_and_update_insn_regno_info (curr_insn); |
6740 | lra_set_used_insn_alternative_by_uid | |
6741 | (INSN_UID (curr_insn), -1); | |
6742 | done_p = true; | |
6743 | if (lra_dump_file != NULL) | |
6744 | { | |
6745 | fprintf (lra_dump_file, " Change reload insn:\n"); | |
cfbeaedf | 6746 | dump_insn_slim (lra_dump_file, curr_insn); |
55a2c322 VM |
6747 | } |
6748 | } | |
6749 | } | |
6750 | } | |
6751 | if (! done_p) | |
6752 | { | |
6753 | struct lra_insn_reg *reg; | |
6754 | bool restored_regs_p = false; | |
6755 | bool kept_regs_p = false; | |
6756 | ||
6757 | curr_id = lra_get_insn_recog_data (curr_insn); | |
6758 | for (reg = curr_id->regs; reg != NULL; reg = reg->next) | |
6759 | { | |
6760 | regno = reg->regno; | |
8a8330b7 VM |
6761 | restore_rtx = lra_reg_info[regno].restore_rtx; |
6762 | if (restore_rtx != NULL_RTX) | |
55a2c322 VM |
6763 | { |
6764 | if (change_p && bitmap_bit_p (remove_pseudos, regno)) | |
6765 | { | |
ef87312e | 6766 | lra_substitute_pseudo_within_insn |
8a8330b7 | 6767 | (curr_insn, regno, restore_rtx, false); |
55a2c322 VM |
6768 | restored_regs_p = true; |
6769 | } | |
6770 | else | |
6771 | kept_regs_p = true; | |
6772 | } | |
6773 | } | |
6774 | if (NONDEBUG_INSN_P (curr_insn) && kept_regs_p) | |
6775 | { | |
6776 | /* The instruction has changed since the previous | |
6777 | constraints pass. */ | |
6778 | lra_push_insn_and_update_insn_regno_info (curr_insn); | |
6779 | lra_set_used_insn_alternative_by_uid | |
6780 | (INSN_UID (curr_insn), -1); | |
6781 | } | |
6782 | else if (restored_regs_p) | |
6783 | /* The instruction has been restored to the form that | |
6784 | it had during the previous constraints pass. */ | |
6785 | lra_update_insn_regno_info (curr_insn); | |
6786 | if (restored_regs_p && lra_dump_file != NULL) | |
6787 | { | |
6788 | fprintf (lra_dump_file, " Insn after restoring regs:\n"); | |
cfbeaedf | 6789 | dump_insn_slim (lra_dump_file, curr_insn); |
55a2c322 VM |
6790 | } |
6791 | } | |
6792 | } | |
6793 | } | |
6794 | return change_p; | |
6795 | } | |
6796 | ||
2b778c9d VM |
6797 | /* If optional reload pseudos failed to get a hard register or was not |
6798 | inherited, it is better to remove optional reloads. We do this | |
6799 | transformation after undoing inheritance to figure out necessity to | |
6800 | remove optional reloads easier. Return true if we do any | |
6801 | change. */ | |
6802 | static bool | |
6803 | undo_optional_reloads (void) | |
6804 | { | |
b0681c9e | 6805 | bool change_p, keep_p; |
2b778c9d VM |
6806 | unsigned int regno, uid; |
6807 | bitmap_iterator bi, bi2; | |
cfa434f6 DM |
6808 | rtx_insn *insn; |
6809 | rtx set, src, dest; | |
d648b5ff | 6810 | auto_bitmap removed_optional_reload_pseudos (®_obstack); |
2b778c9d | 6811 | |
d648b5ff | 6812 | bitmap_copy (removed_optional_reload_pseudos, &lra_optional_reload_pseudos); |
2b778c9d | 6813 | EXECUTE_IF_SET_IN_BITMAP (&lra_optional_reload_pseudos, 0, regno, bi) |
aa940f7c VM |
6814 | { |
6815 | keep_p = false; | |
080cbf9e | 6816 | /* Keep optional reloads from previous subpasses. */ |
8a8330b7 | 6817 | if (lra_reg_info[regno].restore_rtx == NULL_RTX |
080cbf9e VM |
6818 | /* If the original pseudo changed its allocation, just |
6819 | removing the optional pseudo is dangerous as the original | |
6820 | pseudo will have longer live range. */ | |
8a8330b7 | 6821 | || reg_renumber[REGNO (lra_reg_info[regno].restore_rtx)] >= 0) |
aa940f7c VM |
6822 | keep_p = true; |
6823 | else if (reg_renumber[regno] >= 0) | |
6824 | EXECUTE_IF_SET_IN_BITMAP (&lra_reg_info[regno].insn_bitmap, 0, uid, bi2) | |
b0681c9e | 6825 | { |
aa940f7c VM |
6826 | insn = lra_insn_recog_data[uid]->insn; |
6827 | if ((set = single_set (insn)) == NULL_RTX) | |
6828 | continue; | |
6829 | src = SET_SRC (set); | |
6830 | dest = SET_DEST (set); | |
6831 | if (! REG_P (src) || ! REG_P (dest)) | |
6832 | continue; | |
6833 | if (REGNO (dest) == regno | |
6834 | /* Ignore insn for optional reloads itself. */ | |
8a8330b7 | 6835 | && REGNO (lra_reg_info[regno].restore_rtx) != REGNO (src) |
aa940f7c VM |
6836 | /* Check only inheritance on last inheritance pass. */ |
6837 | && (int) REGNO (src) >= new_regno_start | |
6838 | /* Check that the optional reload was inherited. */ | |
6839 | && bitmap_bit_p (&lra_inheritance_pseudos, REGNO (src))) | |
6840 | { | |
6841 | keep_p = true; | |
6842 | break; | |
6843 | } | |
b0681c9e | 6844 | } |
aa940f7c VM |
6845 | if (keep_p) |
6846 | { | |
d648b5ff | 6847 | bitmap_clear_bit (removed_optional_reload_pseudos, regno); |
aa940f7c VM |
6848 | if (lra_dump_file != NULL) |
6849 | fprintf (lra_dump_file, "Keep optional reload reg %d\n", regno); | |
6850 | } | |
6851 | } | |
d648b5ff TS |
6852 | change_p = ! bitmap_empty_p (removed_optional_reload_pseudos); |
6853 | auto_bitmap insn_bitmap (®_obstack); | |
6854 | EXECUTE_IF_SET_IN_BITMAP (removed_optional_reload_pseudos, 0, regno, bi) | |
2b778c9d VM |
6855 | { |
6856 | if (lra_dump_file != NULL) | |
6857 | fprintf (lra_dump_file, "Remove optional reload reg %d\n", regno); | |
d648b5ff TS |
6858 | bitmap_copy (insn_bitmap, &lra_reg_info[regno].insn_bitmap); |
6859 | EXECUTE_IF_SET_IN_BITMAP (insn_bitmap, 0, uid, bi2) | |
2b778c9d VM |
6860 | { |
6861 | insn = lra_insn_recog_data[uid]->insn; | |
6862 | if ((set = single_set (insn)) != NULL_RTX) | |
6863 | { | |
6864 | src = SET_SRC (set); | |
6865 | dest = SET_DEST (set); | |
6866 | if (REG_P (src) && REG_P (dest) | |
6867 | && ((REGNO (src) == regno | |
8a8330b7 VM |
6868 | && (REGNO (lra_reg_info[regno].restore_rtx) |
6869 | == REGNO (dest))) | |
2b778c9d | 6870 | || (REGNO (dest) == regno |
8a8330b7 VM |
6871 | && (REGNO (lra_reg_info[regno].restore_rtx) |
6872 | == REGNO (src))))) | |
2b778c9d VM |
6873 | { |
6874 | if (lra_dump_file != NULL) | |
6875 | { | |
6876 | fprintf (lra_dump_file, " Deleting move %u\n", | |
6877 | INSN_UID (insn)); | |
6878 | dump_insn_slim (lra_dump_file, insn); | |
6879 | } | |
cefe08a4 | 6880 | delete_move_and_clobber (insn, REGNO (dest)); |
2b778c9d VM |
6881 | continue; |
6882 | } | |
6883 | /* We should not worry about generation memory-memory | |
6884 | moves here as if the corresponding inheritance did | |
6885 | not work (inheritance pseudo did not get a hard reg), | |
6886 | we remove the inheritance pseudo and the optional | |
6887 | reload. */ | |
6888 | } | |
ef87312e | 6889 | lra_substitute_pseudo_within_insn |
8a8330b7 | 6890 | (insn, regno, lra_reg_info[regno].restore_rtx, false); |
2b778c9d VM |
6891 | lra_update_insn_regno_info (insn); |
6892 | if (lra_dump_file != NULL) | |
6893 | { | |
6894 | fprintf (lra_dump_file, | |
6895 | " Restoring original insn:\n"); | |
6896 | dump_insn_slim (lra_dump_file, insn); | |
6897 | } | |
6898 | } | |
6899 | } | |
6900 | /* Clear restore_regnos. */ | |
6901 | EXECUTE_IF_SET_IN_BITMAP (&lra_optional_reload_pseudos, 0, regno, bi) | |
8a8330b7 | 6902 | lra_reg_info[regno].restore_rtx = NULL_RTX; |
2b778c9d VM |
6903 | return change_p; |
6904 | } | |
6905 | ||
55a2c322 VM |
6906 | /* Entry function for undoing inheritance/split transformation. Return true |
6907 | if we did any RTL change in this pass. */ | |
6908 | bool | |
6909 | lra_undo_inheritance (void) | |
6910 | { | |
6911 | unsigned int regno; | |
8a8330b7 | 6912 | int hard_regno; |
55a2c322 | 6913 | int n_all_inherit, n_inherit, n_all_split, n_split; |
8a8330b7 | 6914 | rtx restore_rtx; |
55a2c322 VM |
6915 | bitmap_iterator bi; |
6916 | bool change_p; | |
6917 | ||
6918 | lra_undo_inheritance_iter++; | |
8e3a4869 | 6919 | if (lra_undo_inheritance_iter > LRA_MAX_INHERITANCE_PASSES) |
e731262b | 6920 | return false; |
55a2c322 VM |
6921 | if (lra_dump_file != NULL) |
6922 | fprintf (lra_dump_file, | |
6923 | "\n********** Undoing inheritance #%d: **********\n\n", | |
6924 | lra_undo_inheritance_iter); | |
d648b5ff | 6925 | auto_bitmap remove_pseudos (®_obstack); |
55a2c322 VM |
6926 | n_inherit = n_all_inherit = 0; |
6927 | EXECUTE_IF_SET_IN_BITMAP (&lra_inheritance_pseudos, 0, regno, bi) | |
8a8330b7 | 6928 | if (lra_reg_info[regno].restore_rtx != NULL_RTX) |
55a2c322 VM |
6929 | { |
6930 | n_all_inherit++; | |
b0681c9e VM |
6931 | if (reg_renumber[regno] < 0 |
6932 | /* If the original pseudo changed its allocation, just | |
6933 | removing inheritance is dangerous as for changing | |
6934 | allocation we used shorter live-ranges. */ | |
8a8330b7 VM |
6935 | && (! REG_P (lra_reg_info[regno].restore_rtx) |
6936 | || reg_renumber[REGNO (lra_reg_info[regno].restore_rtx)] < 0)) | |
d648b5ff | 6937 | bitmap_set_bit (remove_pseudos, regno); |
55a2c322 VM |
6938 | else |
6939 | n_inherit++; | |
6940 | } | |
6941 | if (lra_dump_file != NULL && n_all_inherit != 0) | |
6942 | fprintf (lra_dump_file, "Inherit %d out of %d (%.2f%%)\n", | |
6943 | n_inherit, n_all_inherit, | |
6944 | (double) n_inherit / n_all_inherit * 100); | |
6945 | n_split = n_all_split = 0; | |
6946 | EXECUTE_IF_SET_IN_BITMAP (&lra_split_regs, 0, regno, bi) | |
8a8330b7 | 6947 | if ((restore_rtx = lra_reg_info[regno].restore_rtx) != NULL_RTX) |
55a2c322 | 6948 | { |
8a8330b7 VM |
6949 | int restore_regno = REGNO (restore_rtx); |
6950 | ||
55a2c322 VM |
6951 | n_all_split++; |
6952 | hard_regno = (restore_regno >= FIRST_PSEUDO_REGISTER | |
6953 | ? reg_renumber[restore_regno] : restore_regno); | |
6954 | if (hard_regno < 0 || reg_renumber[regno] == hard_regno) | |
d648b5ff | 6955 | bitmap_set_bit (remove_pseudos, regno); |
55a2c322 VM |
6956 | else |
6957 | { | |
6958 | n_split++; | |
6959 | if (lra_dump_file != NULL) | |
6960 | fprintf (lra_dump_file, " Keep split r%d (orig=r%d)\n", | |
6961 | regno, restore_regno); | |
6962 | } | |
6963 | } | |
6964 | if (lra_dump_file != NULL && n_all_split != 0) | |
6965 | fprintf (lra_dump_file, "Split %d out of %d (%.2f%%)\n", | |
6966 | n_split, n_all_split, | |
6967 | (double) n_split / n_all_split * 100); | |
d648b5ff | 6968 | change_p = remove_inheritance_pseudos (remove_pseudos); |
55a2c322 VM |
6969 | /* Clear restore_regnos. */ |
6970 | EXECUTE_IF_SET_IN_BITMAP (&lra_inheritance_pseudos, 0, regno, bi) | |
8a8330b7 | 6971 | lra_reg_info[regno].restore_rtx = NULL_RTX; |
55a2c322 | 6972 | EXECUTE_IF_SET_IN_BITMAP (&lra_split_regs, 0, regno, bi) |
8a8330b7 | 6973 | lra_reg_info[regno].restore_rtx = NULL_RTX; |
2b778c9d | 6974 | change_p = undo_optional_reloads () || change_p; |
55a2c322 VM |
6975 | return change_p; |
6976 | } |