]>
Commit | Line | Data |
---|---|---|
38398762 | 1 | /* Allocate registers for pseudo-registers that span basic blocks. |
d050d723 JL |
2 | Copyright (C) 1987, 1988, 1991, 1994, 1996, 1997, 1998, |
3 | 1999, 2000 Free Software Foundation, Inc. | |
38398762 RK |
4 | |
5 | This file is part of GNU CC. | |
6 | ||
7 | GNU CC is free software; you can redistribute it and/or modify | |
8 | it under the terms of the GNU General Public License as published by | |
9 | the Free Software Foundation; either version 2, or (at your option) | |
10 | any later version. | |
11 | ||
12 | GNU CC is distributed in the hope that it will be useful, | |
13 | but WITHOUT ANY WARRANTY; without even the implied warranty of | |
14 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
15 | GNU General Public License for more details. | |
16 | ||
17 | You should have received a copy of the GNU General Public License | |
18 | along with GNU CC; see the file COPYING. If not, write to | |
a35311b0 RK |
19 | the Free Software Foundation, 59 Temple Place - Suite 330, |
20 | Boston, MA 02111-1307, USA. */ | |
38398762 RK |
21 | |
22 | ||
38398762 | 23 | #include "config.h" |
670ee920 | 24 | #include "system.h" |
ccd043a9 | 25 | |
f6781658 L |
26 | #include "machmode.h" |
27 | #include "hard-reg-set.h" | |
38398762 | 28 | #include "rtl.h" |
6baf1cc8 | 29 | #include "tm_p.h" |
38398762 RK |
30 | #include "flags.h" |
31 | #include "basic-block.h" | |
38398762 | 32 | #include "regs.h" |
49ad7cfa | 33 | #include "function.h" |
38398762 | 34 | #include "insn-config.h" |
cad6f7d0 | 35 | #include "reload.h" |
38398762 | 36 | #include "output.h" |
2e107e9e | 37 | #include "toplev.h" |
38398762 RK |
38 | |
39 | /* This pass of the compiler performs global register allocation. | |
40 | It assigns hard register numbers to all the pseudo registers | |
41 | that were not handled in local_alloc. Assignments are recorded | |
42 | in the vector reg_renumber, not by changing the rtl code. | |
43 | (Such changes are made by final). The entry point is | |
44 | the function global_alloc. | |
45 | ||
46 | After allocation is complete, the reload pass is run as a subroutine | |
47 | of this pass, so that when a pseudo reg loses its hard reg due to | |
48 | spilling it is possible to make a second attempt to find a hard | |
49 | reg for it. The reload pass is independent in other respects | |
50 | and it is run even when stupid register allocation is in use. | |
51 | ||
a300b8d9 JW |
52 | 1. Assign allocation-numbers (allocnos) to the pseudo-registers |
53 | still needing allocations and to the pseudo-registers currently | |
54 | allocated by local-alloc which may be spilled by reload. | |
38398762 RK |
55 | Set up tables reg_allocno and allocno_reg to map |
56 | reg numbers to allocnos and vice versa. | |
57 | max_allocno gets the number of allocnos in use. | |
58 | ||
59 | 2. Allocate a max_allocno by max_allocno conflict bit matrix and clear it. | |
60 | Allocate a max_allocno by FIRST_PSEUDO_REGISTER conflict matrix | |
61 | for conflicts between allocnos and explicit hard register use | |
62 | (which includes use of pseudo-registers allocated by local_alloc). | |
63 | ||
a300b8d9 | 64 | 3. For each basic block |
38398762 | 65 | walk forward through the block, recording which |
a300b8d9 JW |
66 | pseudo-registers and which hardware registers are live. |
67 | Build the conflict matrix between the pseudo-registers | |
68 | and another of pseudo-registers versus hardware registers. | |
38398762 | 69 | Also record the preferred hardware registers |
a300b8d9 | 70 | for each pseudo-register. |
38398762 RK |
71 | |
72 | 4. Sort a table of the allocnos into order of | |
73 | desirability of the variables. | |
74 | ||
75 | 5. Allocate the variables in that order; each if possible into | |
76 | a preferred register, else into another register. */ | |
77 | \f | |
a300b8d9 | 78 | /* Number of pseudo-registers which are candidates for allocation. */ |
38398762 RK |
79 | |
80 | static int max_allocno; | |
81 | ||
82 | /* Indexed by (pseudo) reg number, gives the allocno, or -1 | |
a300b8d9 | 83 | for pseudo registers which are not to be allocated. */ |
38398762 | 84 | |
f15ebf65 | 85 | static int *reg_allocno; |
38398762 | 86 | |
5c0ecffe JH |
87 | struct allocno |
88 | { | |
89 | int reg; | |
90 | /* Gives the number of consecutive hard registers needed by that | |
91 | pseudo reg. */ | |
92 | int size; | |
93 | ||
94 | /* Number of calls crossed by each allocno. */ | |
95 | int calls_crossed; | |
96 | ||
97 | /* Number of refs (weighted) to each allocno. */ | |
98 | int n_refs; | |
99 | ||
100 | /* Guess at live length of each allocno. | |
101 | This is actually the max of the live lengths of the regs. */ | |
102 | int live_length; | |
103 | ||
104 | /* Set of hard regs conflicting with allocno N. */ | |
105 | ||
106 | HARD_REG_SET hard_reg_conflicts; | |
107 | ||
108 | /* Set of hard regs preferred by allocno N. | |
109 | This is used to make allocnos go into regs that are copied to or from them, | |
110 | when possible, to reduce register shuffling. */ | |
111 | ||
112 | HARD_REG_SET hard_reg_preferences; | |
113 | ||
114 | /* Similar, but just counts register preferences made in simple copy | |
115 | operations, rather than arithmetic. These are given priority because | |
116 | we can always eliminate an insn by using these, but using a register | |
117 | in the above list won't always eliminate an insn. */ | |
38398762 | 118 | |
5c0ecffe JH |
119 | HARD_REG_SET hard_reg_copy_preferences; |
120 | ||
121 | /* Similar to hard_reg_preferences, but includes bits for subsequent | |
122 | registers when an allocno is multi-word. The above variable is used for | |
123 | allocation while this is used to build reg_someone_prefers, below. */ | |
124 | ||
125 | HARD_REG_SET hard_reg_full_preferences; | |
126 | ||
127 | /* Set of hard registers that some later allocno has a preference for. */ | |
128 | ||
129 | HARD_REG_SET regs_someone_prefers; | |
130 | }; | |
131 | ||
132 | static struct allocno *allocno; | |
38398762 RK |
133 | |
134 | /* A vector of the integers from 0 to max_allocno-1, | |
135 | sorted in the order of first-to-be-allocated first. */ | |
136 | ||
137 | static int *allocno_order; | |
138 | ||
38398762 | 139 | /* Indexed by (pseudo) reg number, gives the number of another |
6dc42e49 | 140 | lower-numbered pseudo reg which can share a hard reg with this pseudo |
38398762 RK |
141 | *even if the two pseudos would otherwise appear to conflict*. */ |
142 | ||
143 | static int *reg_may_share; | |
144 | ||
b1ec3c92 CH |
145 | /* Define the number of bits in each element of `conflicts' and what |
146 | type that element has. We use the largest integer format on the | |
147 | host machine. */ | |
148 | ||
149 | #define INT_BITS HOST_BITS_PER_WIDE_INT | |
150 | #define INT_TYPE HOST_WIDE_INT | |
151 | ||
38398762 RK |
152 | /* max_allocno by max_allocno array of bits, |
153 | recording whether two allocno's conflict (can't go in the same | |
154 | hardware register). | |
155 | ||
267cf808 | 156 | `conflicts' is symmetric after the call to mirror_conflicts. */ |
38398762 | 157 | |
b1ec3c92 | 158 | static INT_TYPE *conflicts; |
38398762 RK |
159 | |
160 | /* Number of ints require to hold max_allocno bits. | |
161 | This is the length of a row in `conflicts'. */ | |
162 | ||
163 | static int allocno_row_words; | |
164 | ||
165 | /* Two macros to test or store 1 in an element of `conflicts'. */ | |
166 | ||
167 | #define CONFLICTP(I, J) \ | |
267cf808 JL |
168 | (conflicts[(I) * allocno_row_words + (unsigned)(J) / INT_BITS] \ |
169 | & ((INT_TYPE) 1 << ((unsigned)(J) % INT_BITS))) | |
38398762 RK |
170 | |
171 | #define SET_CONFLICT(I, J) \ | |
267cf808 JL |
172 | (conflicts[(I) * allocno_row_words + (unsigned)(J) / INT_BITS] \ |
173 | |= ((INT_TYPE) 1 << ((unsigned)(J) % INT_BITS))) | |
174 | ||
32c8d1bc R |
175 | /* For any allocno set in ALLOCNO_SET, set ALLOCNO to that allocno, |
176 | and execute CODE. */ | |
177 | #define EXECUTE_IF_SET_IN_ALLOCNO_SET(ALLOCNO_SET, ALLOCNO, CODE) \ | |
178 | do { \ | |
179 | int i_; \ | |
180 | int allocno_; \ | |
5c0ecffe | 181 | INT_TYPE *p_ = (ALLOCNO_SET); \ |
32c8d1bc R |
182 | \ |
183 | for (i_ = allocno_row_words - 1, allocno_ = 0; i_ >= 0; \ | |
184 | i_--, allocno_ += INT_BITS) \ | |
185 | { \ | |
186 | unsigned INT_TYPE word_ = (unsigned INT_TYPE) *p_++; \ | |
187 | \ | |
188 | for ((ALLOCNO) = allocno_; word_; word_ >>= 1, (ALLOCNO)++) \ | |
189 | { \ | |
190 | if (word_ & 1) \ | |
36013ffc | 191 | {CODE;} \ |
32c8d1bc R |
192 | } \ |
193 | } \ | |
194 | } while (0) | |
195 | ||
312618c7 R |
196 | /* This doesn't work for non-GNU C due to the way CODE is macro expanded. */ |
197 | #if 0 | |
32c8d1bc R |
198 | /* For any allocno that conflicts with IN_ALLOCNO, set OUT_ALLOCNO to |
199 | the conflicting allocno, and execute CODE. This macro assumes that | |
200 | mirror_conflicts has been run. */ | |
201 | #define EXECUTE_IF_CONFLICT(IN_ALLOCNO, OUT_ALLOCNO, CODE)\ | |
202 | EXECUTE_IF_SET_IN_ALLOCNO_SET (conflicts + (IN_ALLOCNO) * allocno_row_words,\ | |
36013ffc | 203 | OUT_ALLOCNO, (CODE)) |
312618c7 | 204 | #endif |
32c8d1bc | 205 | |
38398762 RK |
206 | /* Set of hard regs currently live (during scan of all insns). */ |
207 | ||
208 | static HARD_REG_SET hard_regs_live; | |
209 | ||
38398762 RK |
210 | /* Set of registers that global-alloc isn't supposed to use. */ |
211 | ||
212 | static HARD_REG_SET no_global_alloc_regs; | |
213 | ||
214 | /* Set of registers used so far. */ | |
215 | ||
216 | static HARD_REG_SET regs_used_so_far; | |
217 | ||
1d56e983 RS |
218 | /* Number of refs (weighted) to each hard reg, as used by local alloc. |
219 | It is zero for a reg that contains global pseudos or is explicitly used. */ | |
220 | ||
221 | static int local_reg_n_refs[FIRST_PSEUDO_REGISTER]; | |
222 | ||
223 | /* Guess at live length of each hard reg, as used by local alloc. | |
224 | This is actually the sum of the live lengths of the specific regs. */ | |
225 | ||
226 | static int local_reg_live_length[FIRST_PSEUDO_REGISTER]; | |
227 | ||
38398762 RK |
228 | /* Test a bit in TABLE, a vector of HARD_REG_SETs, |
229 | for vector element I, and hard register number J. */ | |
230 | ||
5c0ecffe | 231 | #define REGBITP(TABLE, I, J) TEST_HARD_REG_BIT (allocno[I].TABLE, J) |
38398762 RK |
232 | |
233 | /* Set to 1 a bit in a vector of HARD_REG_SETs. Works like REGBITP. */ | |
234 | ||
5c0ecffe | 235 | #define SET_REGBIT(TABLE, I, J) SET_HARD_REG_BIT (allocno[I].TABLE, J) |
38398762 RK |
236 | |
237 | /* Bit mask for allocnos live at current point in the scan. */ | |
238 | ||
b1ec3c92 | 239 | static INT_TYPE *allocnos_live; |
38398762 RK |
240 | |
241 | /* Test, set or clear bit number I in allocnos_live, | |
242 | a bit vector indexed by allocno. */ | |
243 | ||
32c8d1bc R |
244 | #define ALLOCNO_LIVE_P(I) \ |
245 | (allocnos_live[(unsigned)(I) / INT_BITS] \ | |
246 | & ((INT_TYPE) 1 << ((unsigned)(I) % INT_BITS))) | |
38398762 | 247 | |
32c8d1bc R |
248 | #define SET_ALLOCNO_LIVE(I) \ |
249 | (allocnos_live[(unsigned)(I) / INT_BITS] \ | |
250 | |= ((INT_TYPE) 1 << ((unsigned)(I) % INT_BITS))) | |
38398762 | 251 | |
32c8d1bc R |
252 | #define CLEAR_ALLOCNO_LIVE(I) \ |
253 | (allocnos_live[(unsigned)(I) / INT_BITS] \ | |
254 | &= ~((INT_TYPE) 1 << ((unsigned)(I) % INT_BITS))) | |
38398762 RK |
255 | |
256 | /* This is turned off because it doesn't work right for DImode. | |
257 | (And it is only used for DImode, so the other cases are worthless.) | |
258 | The problem is that it isn't true that there is NO possibility of conflict; | |
259 | only that there is no conflict if the two pseudos get the exact same regs. | |
260 | If they were allocated with a partial overlap, there would be a conflict. | |
261 | We can't safely turn off the conflict unless we have another way to | |
262 | prevent the partial overlap. | |
263 | ||
264 | Idea: change hard_reg_conflicts so that instead of recording which | |
265 | hard regs the allocno may not overlap, it records where the allocno | |
266 | may not start. Change both where it is used and where it is updated. | |
267 | Then there is a way to record that (reg:DI 108) may start at 10 | |
268 | but not at 9 or 11. There is still the question of how to record | |
269 | this semi-conflict between two pseudos. */ | |
270 | #if 0 | |
271 | /* Reg pairs for which conflict after the current insn | |
272 | is inhibited by a REG_NO_CONFLICT note. | |
273 | If the table gets full, we ignore any other notes--that is conservative. */ | |
274 | #define NUM_NO_CONFLICT_PAIRS 4 | |
275 | /* Number of pairs in use in this insn. */ | |
276 | int n_no_conflict_pairs; | |
277 | static struct { int allocno1, allocno2;} | |
278 | no_conflict_pairs[NUM_NO_CONFLICT_PAIRS]; | |
279 | #endif /* 0 */ | |
280 | ||
281 | /* Record all regs that are set in any one insn. | |
282 | Communication from mark_reg_{store,clobber} and global_conflicts. */ | |
283 | ||
284 | static rtx *regs_set; | |
285 | static int n_regs_set; | |
286 | ||
daf55ac6 | 287 | /* All registers that can be eliminated. */ |
38398762 RK |
288 | |
289 | static HARD_REG_SET eliminable_regset; | |
290 | ||
3fe41456 KG |
291 | static int allocno_compare PARAMS ((const PTR, const PTR)); |
292 | static void global_conflicts PARAMS ((void)); | |
293 | static void mirror_conflicts PARAMS ((void)); | |
294 | static void expand_preferences PARAMS ((void)); | |
295 | static void prune_preferences PARAMS ((void)); | |
296 | static void find_reg PARAMS ((int, HARD_REG_SET, int, int, int)); | |
297 | static void record_one_conflict PARAMS ((int)); | |
298 | static void record_conflicts PARAMS ((int *, int)); | |
299 | static void mark_reg_store PARAMS ((rtx, rtx, void *)); | |
300 | static void mark_reg_clobber PARAMS ((rtx, rtx, void *)); | |
301 | static void mark_reg_conflicts PARAMS ((rtx)); | |
302 | static void mark_reg_death PARAMS ((rtx)); | |
303 | static void mark_reg_live_nc PARAMS ((int, enum machine_mode)); | |
304 | static void set_preference PARAMS ((rtx, rtx)); | |
305 | static void dump_conflicts PARAMS ((FILE *)); | |
306 | static void reg_becomes_live PARAMS ((rtx, rtx, void *)); | |
307 | static void reg_dies PARAMS ((int, enum machine_mode, | |
285f3cf0 | 308 | struct insn_chain *)); |
38398762 RK |
309 | \f |
310 | /* Perform allocation of pseudo-registers not allocated by local_alloc. | |
311 | FILE is a file to output debugging information on, | |
ab40ad2b | 312 | or zero if such output is not desired. |
38398762 | 313 | |
ab40ad2b RS |
314 | Return value is nonzero if reload failed |
315 | and we must not do any more for this function. */ | |
316 | ||
317 | int | |
38398762 RK |
318 | global_alloc (file) |
319 | FILE *file; | |
320 | { | |
8c316ae2 | 321 | int retval; |
38398762 RK |
322 | #ifdef ELIMINABLE_REGS |
323 | static struct {int from, to; } eliminables[] = ELIMINABLE_REGS; | |
324 | #endif | |
daf55ac6 RK |
325 | int need_fp |
326 | = (! flag_omit_frame_pointer | |
327 | #ifdef EXIT_IGNORE_STACK | |
328 | || (current_function_calls_alloca && EXIT_IGNORE_STACK) | |
329 | #endif | |
330 | || FRAME_POINTER_REQUIRED); | |
331 | ||
f8344bea | 332 | register size_t i; |
38398762 RK |
333 | rtx x; |
334 | ||
335 | max_allocno = 0; | |
336 | ||
337 | /* A machine may have certain hard registers that | |
338 | are safe to use only within a basic block. */ | |
339 | ||
340 | CLEAR_HARD_REG_SET (no_global_alloc_regs); | |
38398762 RK |
341 | |
342 | /* Build the regset of all eliminable registers and show we can't use those | |
343 | that we already know won't be eliminated. */ | |
344 | #ifdef ELIMINABLE_REGS | |
b6a1cbae | 345 | for (i = 0; i < ARRAY_SIZE (eliminables); i++) |
38398762 RK |
346 | { |
347 | SET_HARD_REG_BIT (eliminable_regset, eliminables[i].from); | |
348 | ||
349 | if (! CAN_ELIMINATE (eliminables[i].from, eliminables[i].to) | |
daf55ac6 | 350 | || (eliminables[i].to == STACK_POINTER_REGNUM && need_fp)) |
38398762 RK |
351 | SET_HARD_REG_BIT (no_global_alloc_regs, eliminables[i].from); |
352 | } | |
7b0957a7 | 353 | #if FRAME_POINTER_REGNUM != HARD_FRAME_POINTER_REGNUM |
daf55ac6 RK |
354 | SET_HARD_REG_BIT (eliminable_regset, HARD_FRAME_POINTER_REGNUM); |
355 | if (need_fp) | |
7b0957a7 DE |
356 | SET_HARD_REG_BIT (no_global_alloc_regs, HARD_FRAME_POINTER_REGNUM); |
357 | #endif | |
daf55ac6 | 358 | |
38398762 RK |
359 | #else |
360 | SET_HARD_REG_BIT (eliminable_regset, FRAME_POINTER_REGNUM); | |
daf55ac6 | 361 | if (need_fp) |
38398762 RK |
362 | SET_HARD_REG_BIT (no_global_alloc_regs, FRAME_POINTER_REGNUM); |
363 | #endif | |
364 | ||
365 | /* Track which registers have already been used. Start with registers | |
366 | explicitly in the rtl, then registers allocated by local register | |
b4b4db94 | 367 | allocation. */ |
38398762 RK |
368 | |
369 | CLEAR_HARD_REG_SET (regs_used_so_far); | |
b4b4db94 RS |
370 | #ifdef LEAF_REGISTERS |
371 | /* If we are doing the leaf function optimization, and this is a leaf | |
372 | function, it means that the registers that take work to save are those | |
373 | that need a register window. So prefer the ones that can be used in | |
374 | a leaf function. */ | |
375 | { | |
376 | char *cheap_regs; | |
7d167afd | 377 | char *leaf_regs = LEAF_REGISTERS; |
b4b4db94 RS |
378 | |
379 | if (only_leaf_regs_used () && leaf_function_p ()) | |
380 | cheap_regs = leaf_regs; | |
381 | else | |
382 | cheap_regs = call_used_regs; | |
383 | for (i = 0; i < FIRST_PSEUDO_REGISTER; i++) | |
384 | if (regs_ever_live[i] || cheap_regs[i]) | |
385 | SET_HARD_REG_BIT (regs_used_so_far, i); | |
386 | } | |
387 | #else | |
388 | /* We consider registers that do not have to be saved over calls as if | |
389 | they were already used since there is no cost in using them. */ | |
38398762 RK |
390 | for (i = 0; i < FIRST_PSEUDO_REGISTER; i++) |
391 | if (regs_ever_live[i] || call_used_regs[i]) | |
392 | SET_HARD_REG_BIT (regs_used_so_far, i); | |
b4b4db94 | 393 | #endif |
38398762 | 394 | |
e51712db | 395 | for (i = FIRST_PSEUDO_REGISTER; i < (size_t) max_regno; i++) |
38398762 RK |
396 | if (reg_renumber[i] >= 0) |
397 | SET_HARD_REG_BIT (regs_used_so_far, reg_renumber[i]); | |
398 | ||
399 | /* Establish mappings from register number to allocation number | |
400 | and vice versa. In the process, count the allocnos. */ | |
401 | ||
67289ea6 | 402 | reg_allocno = (int *) xmalloc (max_regno * sizeof (int)); |
38398762 RK |
403 | |
404 | for (i = 0; i < FIRST_PSEUDO_REGISTER; i++) | |
405 | reg_allocno[i] = -1; | |
406 | ||
407 | /* Initialize the shared-hard-reg mapping | |
408 | from the list of pairs that may share. */ | |
67289ea6 | 409 | reg_may_share = (int *) xcalloc (max_regno, sizeof (int)); |
38398762 RK |
410 | for (x = regs_may_share; x; x = XEXP (XEXP (x, 1), 1)) |
411 | { | |
412 | int r1 = REGNO (XEXP (x, 0)); | |
413 | int r2 = REGNO (XEXP (XEXP (x, 1), 0)); | |
414 | if (r1 > r2) | |
415 | reg_may_share[r1] = r2; | |
416 | else | |
417 | reg_may_share[r2] = r1; | |
418 | } | |
419 | ||
e51712db | 420 | for (i = FIRST_PSEUDO_REGISTER; i < (size_t) max_regno; i++) |
38398762 RK |
421 | /* Note that reg_live_length[i] < 0 indicates a "constant" reg |
422 | that we are supposed to refrain from putting in a hard reg. | |
423 | -2 means do make an allocno but don't allocate it. */ | |
a300b8d9 | 424 | if (REG_N_REFS (i) != 0 && REG_LIVE_LENGTH (i) != -1 |
38398762 RK |
425 | /* Don't allocate pseudos that cross calls, |
426 | if this function receives a nonlocal goto. */ | |
427 | && (! current_function_has_nonlocal_label | |
b1f21e0a | 428 | || REG_N_CALLS_CROSSED (i) == 0)) |
38398762 | 429 | { |
a300b8d9 | 430 | if (reg_renumber[i] < 0 && reg_may_share[i] && reg_allocno[reg_may_share[i]] >= 0) |
38398762 RK |
431 | reg_allocno[i] = reg_allocno[reg_may_share[i]]; |
432 | else | |
433 | reg_allocno[i] = max_allocno++; | |
b1f21e0a | 434 | if (REG_LIVE_LENGTH (i) == 0) |
38398762 RK |
435 | abort (); |
436 | } | |
437 | else | |
438 | reg_allocno[i] = -1; | |
439 | ||
5c0ecffe | 440 | allocno = (struct allocno *) xcalloc (max_allocno, sizeof (struct allocno)); |
38398762 | 441 | |
e51712db | 442 | for (i = FIRST_PSEUDO_REGISTER; i < (size_t) max_regno; i++) |
38398762 RK |
443 | if (reg_allocno[i] >= 0) |
444 | { | |
5c0ecffe JH |
445 | int num = reg_allocno[i]; |
446 | allocno[num].reg = i; | |
447 | allocno[num].size = PSEUDO_REGNO_SIZE (i); | |
448 | allocno[num].calls_crossed += REG_N_CALLS_CROSSED (i); | |
449 | allocno[num].n_refs += REG_N_REFS (i); | |
450 | if (allocno[num].live_length < REG_LIVE_LENGTH (i)) | |
451 | allocno[num].live_length = REG_LIVE_LENGTH (i); | |
38398762 RK |
452 | } |
453 | ||
1d56e983 RS |
454 | /* Calculate amount of usage of each hard reg by pseudos |
455 | allocated by local-alloc. This is to see if we want to | |
456 | override it. */ | |
961192e1 JM |
457 | memset ((char *) local_reg_live_length, 0, sizeof local_reg_live_length); |
458 | memset ((char *) local_reg_n_refs, 0, sizeof local_reg_n_refs); | |
e51712db | 459 | for (i = FIRST_PSEUDO_REGISTER; i < (size_t) max_regno; i++) |
a300b8d9 | 460 | if (reg_renumber[i] >= 0) |
1d56e983 | 461 | { |
34e56753 RS |
462 | int regno = reg_renumber[i]; |
463 | int endregno = regno + HARD_REGNO_NREGS (regno, PSEUDO_REGNO_MODE (i)); | |
464 | int j; | |
465 | ||
466 | for (j = regno; j < endregno; j++) | |
467 | { | |
b1f21e0a MM |
468 | local_reg_n_refs[j] += REG_N_REFS (i); |
469 | local_reg_live_length[j] += REG_LIVE_LENGTH (i); | |
34e56753 | 470 | } |
1d56e983 | 471 | } |
34e56753 | 472 | |
1d56e983 RS |
473 | /* We can't override local-alloc for a reg used not just by local-alloc. */ |
474 | for (i = 0; i < FIRST_PSEUDO_REGISTER; i++) | |
475 | if (regs_ever_live[i]) | |
476 | local_reg_n_refs[i] = 0; | |
0dfa4517 | 477 | |
38398762 RK |
478 | allocno_row_words = (max_allocno + INT_BITS - 1) / INT_BITS; |
479 | ||
ba3b3878 BK |
480 | /* We used to use alloca here, but the size of what it would try to |
481 | allocate would occasionally cause it to exceed the stack limit and | |
482 | cause unpredictable core dumps. Some examples were > 2Mb in size. */ | |
3de90026 RH |
483 | conflicts = (INT_TYPE *) xcalloc (max_allocno * allocno_row_words, |
484 | sizeof (INT_TYPE)); | |
38398762 | 485 | |
67289ea6 | 486 | allocnos_live = (INT_TYPE *) xmalloc (allocno_row_words * sizeof (INT_TYPE)); |
38398762 RK |
487 | |
488 | /* If there is work to be done (at least one reg to allocate), | |
489 | perform global conflict analysis and allocate the regs. */ | |
490 | ||
491 | if (max_allocno > 0) | |
492 | { | |
493 | /* Scan all the insns and compute the conflicts among allocnos | |
494 | and between allocnos and hard regs. */ | |
495 | ||
496 | global_conflicts (); | |
497 | ||
267cf808 JL |
498 | mirror_conflicts (); |
499 | ||
38398762 RK |
500 | /* Eliminate conflicts between pseudos and eliminable registers. If |
501 | the register is not eliminated, the pseudo won't really be able to | |
502 | live in the eliminable register, so the conflict doesn't matter. | |
503 | If we do eliminate the register, the conflict will no longer exist. | |
1d56e983 RS |
504 | So in either case, we can ignore the conflict. Likewise for |
505 | preferences. */ | |
38398762 | 506 | |
e51712db | 507 | for (i = 0; i < (size_t) max_allocno; i++) |
1d56e983 | 508 | { |
5c0ecffe JH |
509 | AND_COMPL_HARD_REG_SET (allocno[i].hard_reg_conflicts, |
510 | eliminable_regset); | |
511 | AND_COMPL_HARD_REG_SET (allocno[i].hard_reg_copy_preferences, | |
512 | eliminable_regset); | |
513 | AND_COMPL_HARD_REG_SET (allocno[i].hard_reg_preferences, | |
1d56e983 | 514 | eliminable_regset); |
1d56e983 | 515 | } |
38398762 RK |
516 | |
517 | /* Try to expand the preferences by merging them between allocnos. */ | |
518 | ||
519 | expand_preferences (); | |
520 | ||
521 | /* Determine the order to allocate the remaining pseudo registers. */ | |
522 | ||
67289ea6 | 523 | allocno_order = (int *) xmalloc (max_allocno * sizeof (int)); |
e51712db | 524 | for (i = 0; i < (size_t) max_allocno; i++) |
38398762 RK |
525 | allocno_order[i] = i; |
526 | ||
527 | /* Default the size to 1, since allocno_compare uses it to divide by. | |
528 | Also convert allocno_live_length of zero to -1. A length of zero | |
529 | can occur when all the registers for that allocno have reg_live_length | |
530 | equal to -2. In this case, we want to make an allocno, but not | |
531 | allocate it. So avoid the divide-by-zero and set it to a low | |
532 | priority. */ | |
533 | ||
e51712db | 534 | for (i = 0; i < (size_t) max_allocno; i++) |
38398762 | 535 | { |
5c0ecffe JH |
536 | if (allocno[i].size == 0) |
537 | allocno[i].size = 1; | |
538 | if (allocno[i].live_length == 0) | |
539 | allocno[i].live_length = -1; | |
38398762 RK |
540 | } |
541 | ||
542 | qsort (allocno_order, max_allocno, sizeof (int), allocno_compare); | |
543 | ||
544 | prune_preferences (); | |
545 | ||
546 | if (file) | |
547 | dump_conflicts (file); | |
548 | ||
549 | /* Try allocating them, one by one, in that order, | |
550 | except for parameters marked with reg_live_length[regno] == -2. */ | |
551 | ||
e51712db | 552 | for (i = 0; i < (size_t) max_allocno; i++) |
5c0ecffe JH |
553 | if (reg_renumber[allocno[allocno_order[i]].reg] < 0 |
554 | && REG_LIVE_LENGTH (allocno[allocno_order[i]].reg) >= 0) | |
38398762 RK |
555 | { |
556 | /* If we have more than one register class, | |
557 | first try allocating in the class that is cheapest | |
558 | for this pseudo-reg. If that fails, try any reg. */ | |
559 | if (N_REG_CLASSES > 1) | |
560 | { | |
ea8693a4 | 561 | find_reg (allocno_order[i], 0, 0, 0, 0); |
5c0ecffe | 562 | if (reg_renumber[allocno[allocno_order[i]].reg] >= 0) |
38398762 RK |
563 | continue; |
564 | } | |
5c0ecffe | 565 | if (reg_alternate_class (allocno[allocno_order[i]].reg) != NO_REGS) |
ea8693a4 | 566 | find_reg (allocno_order[i], 0, 1, 0, 0); |
38398762 | 567 | } |
67289ea6 MM |
568 | |
569 | free (allocno_order); | |
38398762 RK |
570 | } |
571 | ||
572 | /* Do the reloads now while the allocno data still exist, so that we can | |
573 | try to assign new hard regs to any pseudo regs that are spilled. */ | |
574 | ||
7e860cf7 RS |
575 | #if 0 /* We need to eliminate regs even if there is no rtl code, |
576 | for the sake of debugging information. */ | |
38398762 | 577 | if (n_basic_blocks > 0) |
7e860cf7 | 578 | #endif |
cad6f7d0 | 579 | { |
108c535a | 580 | build_insn_chain (get_insns ()); |
e04ca094 | 581 | retval = reload (get_insns (), 1); |
cad6f7d0 | 582 | } |
8c316ae2 | 583 | |
67289ea6 MM |
584 | /* Clean up. */ |
585 | free (reg_allocno); | |
586 | free (reg_may_share); | |
5c0ecffe | 587 | free (allocno); |
8c316ae2 | 588 | free (conflicts); |
67289ea6 MM |
589 | free (allocnos_live); |
590 | ||
8c316ae2 | 591 | return retval; |
38398762 RK |
592 | } |
593 | ||
594 | /* Sort predicate for ordering the allocnos. | |
595 | Returns -1 (1) if *v1 should be allocated before (after) *v2. */ | |
596 | ||
597 | static int | |
daa6f17d | 598 | allocno_compare (v1p, v2p) |
e1b6684c KG |
599 | const PTR v1p; |
600 | const PTR v2p; | |
38398762 | 601 | { |
ec0ce6e2 | 602 | int v1 = *(const int *)v1p, v2 = *(const int *)v2p; |
38398762 RK |
603 | /* Note that the quotient will never be bigger than |
604 | the value of floor_log2 times the maximum number of | |
605 | times a register can occur in one insn (surely less than 100). | |
606 | Multiplying this by 10000 can't overflow. */ | |
607 | register int pri1 | |
5c0ecffe JH |
608 | = (((double) (floor_log2 (allocno[v1].n_refs) * allocno[v1].n_refs) |
609 | / allocno[v1].live_length) | |
610 | * 10000 * allocno[v1].size); | |
38398762 | 611 | register int pri2 |
5c0ecffe JH |
612 | = (((double) (floor_log2 (allocno[v2].n_refs) * allocno[v2].n_refs) |
613 | / allocno[v2].live_length) | |
614 | * 10000 * allocno[v2].size); | |
38398762 RK |
615 | if (pri2 - pri1) |
616 | return pri2 - pri1; | |
617 | ||
618 | /* If regs are equally good, sort by allocno, | |
619 | so that the results of qsort leave nothing to chance. */ | |
daa6f17d | 620 | return v1 - v2; |
38398762 RK |
621 | } |
622 | \f | |
623 | /* Scan the rtl code and record all conflicts and register preferences in the | |
624 | conflict matrices and preference tables. */ | |
625 | ||
626 | static void | |
627 | global_conflicts () | |
628 | { | |
629 | register int b, i; | |
630 | register rtx insn; | |
8d4c79be | 631 | int *block_start_allocnos; |
38398762 RK |
632 | |
633 | /* Make a vector that mark_reg_{store,clobber} will store in. */ | |
67289ea6 | 634 | regs_set = (rtx *) xmalloc (max_parallel * sizeof (rtx) * 2); |
38398762 | 635 | |
67289ea6 | 636 | block_start_allocnos = (int *) xmalloc (max_allocno * sizeof (int)); |
38398762 RK |
637 | |
638 | for (b = 0; b < n_basic_blocks; b++) | |
639 | { | |
961192e1 | 640 | memset ((char *) allocnos_live, 0, allocno_row_words * sizeof (INT_TYPE)); |
38398762 RK |
641 | |
642 | /* Initialize table of registers currently live | |
643 | to the state at the beginning of this basic block. | |
bdc24974 JL |
644 | This also marks the conflicts among hard registers |
645 | and any allocnos that are live. | |
38398762 RK |
646 | |
647 | For pseudo-regs, there is only one bit for each one | |
648 | no matter how many hard regs it occupies. | |
649 | This is ok; we know the size from PSEUDO_REGNO_SIZE. | |
650 | For explicit hard regs, we cannot know the size that way | |
651 | since one hard reg can be used with various sizes. | |
652 | Therefore, we must require that all the hard regs | |
653 | implicitly live as part of a multi-word hard reg | |
654 | are explicitly marked in basic_block_live_at_start. */ | |
655 | ||
656 | { | |
e881bb1b | 657 | register regset old = BASIC_BLOCK (b)->global_live_at_start; |
38398762 RK |
658 | int ax = 0; |
659 | ||
916b1701 | 660 | REG_SET_TO_HARD_REG_SET (hard_regs_live, old); |
1313ec9d | 661 | EXECUTE_IF_SET_IN_REG_SET (old, FIRST_PSEUDO_REGISTER, i, |
916b1701 MM |
662 | { |
663 | register int a = reg_allocno[i]; | |
664 | if (a >= 0) | |
665 | { | |
666 | SET_ALLOCNO_LIVE (a); | |
667 | block_start_allocnos[ax++] = a; | |
668 | } | |
669 | else if ((a = reg_renumber[i]) >= 0) | |
1313ec9d RK |
670 | mark_reg_live_nc |
671 | (a, PSEUDO_REGNO_MODE (i)); | |
916b1701 | 672 | }); |
38398762 | 673 | |
bdc24974 JL |
674 | /* Record that each allocno now live conflicts with each hard reg |
675 | now live. | |
38398762 | 676 | |
bdc24974 JL |
677 | It is not necessary to mark any conflicts between pseudos as |
678 | this point, even for pseudos which are live at the start of | |
679 | the basic block. | |
680 | ||
681 | Given two pseudos X and Y and any point in the CFG P. | |
682 | ||
683 | On any path to point P where X and Y are live one of the | |
684 | following conditions must be true: | |
685 | ||
686 | 1. X is live at some instruction on the path that | |
687 | evaluates Y. | |
688 | ||
689 | 2. Y is live at some instruction on the path that | |
690 | evaluates X. | |
691 | ||
692 | 3. Either X or Y is not evaluted on the path to P | |
693 | (ie it is used uninitialized) and thus the | |
694 | conflict can be ignored. | |
695 | ||
696 | In cases #1 and #2 the conflict will be recorded when we | |
697 | scan the instruction that makes either X or Y become live. */ | |
38398762 | 698 | record_conflicts (block_start_allocnos, ax); |
4d1d8045 BS |
699 | |
700 | #ifdef STACK_REGS | |
e881bb1b RH |
701 | { |
702 | /* Pseudos can't go in stack regs at the start of a basic block | |
a05924f9 | 703 | that is reached by an abnormal edge. */ |
e881bb1b RH |
704 | |
705 | edge e; | |
706 | for (e = BASIC_BLOCK (b)->pred; e ; e = e->pred_next) | |
707 | if (e->flags & EDGE_ABNORMAL) | |
708 | break; | |
e881bb1b RH |
709 | if (e != NULL) |
710 | for (ax = FIRST_STACK_REG; ax <= LAST_STACK_REG; ax++) | |
711 | record_one_conflict (ax); | |
712 | } | |
4d1d8045 | 713 | #endif |
38398762 RK |
714 | } |
715 | ||
3b413743 | 716 | insn = BLOCK_HEAD (b); |
38398762 RK |
717 | |
718 | /* Scan the code of this basic block, noting which allocnos | |
719 | and hard regs are born or die. When one is born, | |
720 | record a conflict with all others currently live. */ | |
721 | ||
722 | while (1) | |
723 | { | |
724 | register RTX_CODE code = GET_CODE (insn); | |
725 | register rtx link; | |
726 | ||
727 | /* Make regs_set an empty set. */ | |
728 | ||
729 | n_regs_set = 0; | |
730 | ||
731 | if (code == INSN || code == CALL_INSN || code == JUMP_INSN) | |
732 | { | |
38398762 RK |
733 | |
734 | #if 0 | |
2049526b | 735 | int i = 0; |
38398762 RK |
736 | for (link = REG_NOTES (insn); |
737 | link && i < NUM_NO_CONFLICT_PAIRS; | |
738 | link = XEXP (link, 1)) | |
739 | if (REG_NOTE_KIND (link) == REG_NO_CONFLICT) | |
740 | { | |
741 | no_conflict_pairs[i].allocno1 | |
742 | = reg_allocno[REGNO (SET_DEST (PATTERN (insn)))]; | |
743 | no_conflict_pairs[i].allocno2 | |
744 | = reg_allocno[REGNO (XEXP (link, 0))]; | |
745 | i++; | |
746 | } | |
747 | #endif /* 0 */ | |
748 | ||
749 | /* Mark any registers clobbered by INSN as live, | |
750 | so they conflict with the inputs. */ | |
751 | ||
84832317 | 752 | note_stores (PATTERN (insn), mark_reg_clobber, NULL); |
38398762 RK |
753 | |
754 | /* Mark any registers dead after INSN as dead now. */ | |
755 | ||
756 | for (link = REG_NOTES (insn); link; link = XEXP (link, 1)) | |
757 | if (REG_NOTE_KIND (link) == REG_DEAD) | |
758 | mark_reg_death (XEXP (link, 0)); | |
759 | ||
760 | /* Mark any registers set in INSN as live, | |
761 | and mark them as conflicting with all other live regs. | |
762 | Clobbers are processed again, so they conflict with | |
763 | the registers that are set. */ | |
764 | ||
84832317 | 765 | note_stores (PATTERN (insn), mark_reg_store, NULL); |
38398762 RK |
766 | |
767 | #ifdef AUTO_INC_DEC | |
768 | for (link = REG_NOTES (insn); link; link = XEXP (link, 1)) | |
769 | if (REG_NOTE_KIND (link) == REG_INC) | |
84832317 | 770 | mark_reg_store (XEXP (link, 0), NULL_RTX, NULL); |
38398762 RK |
771 | #endif |
772 | ||
333e0f7d RS |
773 | /* If INSN has multiple outputs, then any reg that dies here |
774 | and is used inside of an output | |
941c63ac JL |
775 | must conflict with the other outputs. |
776 | ||
777 | It is unsafe to use !single_set here since it will ignore an | |
778 | unused output. Just because an output is unused does not mean | |
779 | the compiler can assume the side effect will not occur. | |
780 | Consider if REG appears in the address of an output and we | |
781 | reload the output. If we allocate REG to the same hard | |
782 | register as an unused output we could set the hard register | |
783 | before the output reload insn. */ | |
784 | if (GET_CODE (PATTERN (insn)) == PARALLEL && multiple_sets (insn)) | |
333e0f7d RS |
785 | for (link = REG_NOTES (insn); link; link = XEXP (link, 1)) |
786 | if (REG_NOTE_KIND (link) == REG_DEAD) | |
787 | { | |
788 | int used_in_output = 0; | |
789 | int i; | |
790 | rtx reg = XEXP (link, 0); | |
791 | ||
792 | for (i = XVECLEN (PATTERN (insn), 0) - 1; i >= 0; i--) | |
793 | { | |
794 | rtx set = XVECEXP (PATTERN (insn), 0, i); | |
795 | if (GET_CODE (set) == SET | |
796 | && GET_CODE (SET_DEST (set)) != REG | |
797 | && !rtx_equal_p (reg, SET_DEST (set)) | |
798 | && reg_overlap_mentioned_p (reg, SET_DEST (set))) | |
799 | used_in_output = 1; | |
800 | } | |
801 | if (used_in_output) | |
802 | mark_reg_conflicts (reg); | |
803 | } | |
804 | ||
38398762 RK |
805 | /* Mark any registers set in INSN and then never used. */ |
806 | ||
06a3a6db GK |
807 | while (n_regs_set-- > 0) |
808 | { | |
809 | rtx note = find_regno_note (insn, REG_UNUSED, | |
810 | REGNO (regs_set[n_regs_set])); | |
811 | if (note) | |
812 | mark_reg_death (XEXP (note, 0)); | |
813 | } | |
38398762 RK |
814 | } |
815 | ||
3b413743 | 816 | if (insn == BLOCK_END (b)) |
38398762 RK |
817 | break; |
818 | insn = NEXT_INSN (insn); | |
819 | } | |
820 | } | |
67289ea6 MM |
821 | |
822 | /* Clean up. */ | |
823 | free (block_start_allocnos); | |
824 | free (regs_set); | |
38398762 RK |
825 | } |
826 | /* Expand the preference information by looking for cases where one allocno | |
827 | dies in an insn that sets an allocno. If those two allocnos don't conflict, | |
828 | merge any preferences between those allocnos. */ | |
829 | ||
830 | static void | |
831 | expand_preferences () | |
832 | { | |
833 | rtx insn; | |
834 | rtx link; | |
835 | rtx set; | |
836 | ||
837 | /* We only try to handle the most common cases here. Most of the cases | |
838 | where this wins are reg-reg copies. */ | |
839 | ||
840 | for (insn = get_insns (); insn; insn = NEXT_INSN (insn)) | |
2c3c49de | 841 | if (INSN_P (insn) |
38398762 RK |
842 | && (set = single_set (insn)) != 0 |
843 | && GET_CODE (SET_DEST (set)) == REG | |
844 | && reg_allocno[REGNO (SET_DEST (set))] >= 0) | |
845 | for (link = REG_NOTES (insn); link; link = XEXP (link, 1)) | |
846 | if (REG_NOTE_KIND (link) == REG_DEAD | |
847 | && GET_CODE (XEXP (link, 0)) == REG | |
848 | && reg_allocno[REGNO (XEXP (link, 0))] >= 0 | |
849 | && ! CONFLICTP (reg_allocno[REGNO (SET_DEST (set))], | |
267cf808 | 850 | reg_allocno[REGNO (XEXP (link, 0))])) |
38398762 RK |
851 | { |
852 | int a1 = reg_allocno[REGNO (SET_DEST (set))]; | |
853 | int a2 = reg_allocno[REGNO (XEXP (link, 0))]; | |
854 | ||
855 | if (XEXP (link, 0) == SET_SRC (set)) | |
856 | { | |
5c0ecffe JH |
857 | IOR_HARD_REG_SET (allocno[a1].hard_reg_copy_preferences, |
858 | allocno[a2].hard_reg_copy_preferences); | |
859 | IOR_HARD_REG_SET (allocno[a2].hard_reg_copy_preferences, | |
860 | allocno[a1].hard_reg_copy_preferences); | |
38398762 RK |
861 | } |
862 | ||
5c0ecffe JH |
863 | IOR_HARD_REG_SET (allocno[a1].hard_reg_preferences, |
864 | allocno[a2].hard_reg_preferences); | |
865 | IOR_HARD_REG_SET (allocno[a2].hard_reg_preferences, | |
866 | allocno[a1].hard_reg_preferences); | |
867 | IOR_HARD_REG_SET (allocno[a1].hard_reg_full_preferences, | |
868 | allocno[a2].hard_reg_full_preferences); | |
869 | IOR_HARD_REG_SET (allocno[a2].hard_reg_full_preferences, | |
870 | allocno[a1].hard_reg_full_preferences); | |
38398762 RK |
871 | } |
872 | } | |
873 | \f | |
874 | /* Prune the preferences for global registers to exclude registers that cannot | |
875 | be used. | |
876 | ||
877 | Compute `regs_someone_prefers', which is a bitmask of the hard registers | |
878 | that are preferred by conflicting registers of lower priority. If possible, | |
879 | we will avoid using these registers. */ | |
880 | ||
881 | static void | |
882 | prune_preferences () | |
883 | { | |
32c8d1bc | 884 | int i; |
5c0ecffe | 885 | int num; |
267cf808 | 886 | int *allocno_to_order = (int *) xmalloc (max_allocno * sizeof (int)); |
38398762 RK |
887 | |
888 | /* Scan least most important to most important. | |
889 | For each allocno, remove from preferences registers that cannot be used, | |
890 | either because of conflicts or register type. Then compute all registers | |
d45cf215 | 891 | preferred by each lower-priority register that conflicts. */ |
38398762 RK |
892 | |
893 | for (i = max_allocno - 1; i >= 0; i--) | |
894 | { | |
267cf808 | 895 | HARD_REG_SET temp; |
38398762 | 896 | |
5c0ecffe JH |
897 | num = allocno_order[i]; |
898 | allocno_to_order[num] = i; | |
899 | COPY_HARD_REG_SET (temp, allocno[num].hard_reg_conflicts); | |
38398762 | 900 | |
5c0ecffe | 901 | if (allocno[num].calls_crossed == 0) |
38398762 RK |
902 | IOR_HARD_REG_SET (temp, fixed_reg_set); |
903 | else | |
904 | IOR_HARD_REG_SET (temp, call_used_reg_set); | |
905 | ||
906 | IOR_COMPL_HARD_REG_SET | |
907 | (temp, | |
5c0ecffe | 908 | reg_class_contents[(int) reg_preferred_class (allocno[num].reg)]); |
38398762 | 909 | |
5c0ecffe JH |
910 | AND_COMPL_HARD_REG_SET (allocno[num].hard_reg_preferences, temp); |
911 | AND_COMPL_HARD_REG_SET (allocno[num].hard_reg_copy_preferences, temp); | |
912 | AND_COMPL_HARD_REG_SET (allocno[num].hard_reg_full_preferences, temp); | |
267cf808 | 913 | } |
38398762 | 914 | |
267cf808 JL |
915 | for (i = max_allocno - 1; i >= 0; i--) |
916 | { | |
38398762 RK |
917 | /* Merge in the preferences of lower-priority registers (they have |
918 | already been pruned). If we also prefer some of those registers, | |
919 | don't exclude them unless we are of a smaller size (in which case | |
920 | we want to give the lower-priority allocno the first chance for | |
921 | these registers). */ | |
267cf808 | 922 | HARD_REG_SET temp, temp2; |
32c8d1bc | 923 | int allocno2; |
267cf808 | 924 | |
5c0ecffe | 925 | num = allocno_order[i]; |
267cf808 | 926 | |
ea1637e9 R |
927 | CLEAR_HARD_REG_SET (temp); |
928 | CLEAR_HARD_REG_SET (temp2); | |
267cf808 | 929 | |
5c0ecffe | 930 | EXECUTE_IF_SET_IN_ALLOCNO_SET (conflicts + num * allocno_row_words, |
312618c7 | 931 | allocno2, |
267cf808 | 932 | { |
32c8d1bc | 933 | if (allocno_to_order[allocno2] > i) |
267cf808 | 934 | { |
5c0ecffe JH |
935 | if (allocno[allocno2].size <= allocno[num].size) |
936 | IOR_HARD_REG_SET (temp, | |
937 | allocno[allocno2].hard_reg_full_preferences); | |
32c8d1bc | 938 | else |
5c0ecffe JH |
939 | IOR_HARD_REG_SET (temp2, |
940 | allocno[allocno2].hard_reg_full_preferences); | |
267cf808 | 941 | } |
32c8d1bc | 942 | }); |
267cf808 | 943 | |
5c0ecffe | 944 | AND_COMPL_HARD_REG_SET (temp, allocno[num].hard_reg_full_preferences); |
ea1637e9 | 945 | IOR_HARD_REG_SET (temp, temp2); |
5c0ecffe | 946 | COPY_HARD_REG_SET (allocno[num].regs_someone_prefers, temp); |
38398762 | 947 | } |
267cf808 | 948 | free (allocno_to_order); |
38398762 RK |
949 | } |
950 | \f | |
5c0ecffe | 951 | /* Assign a hard register to allocno NUM; look for one that is the beginning |
38398762 RK |
952 | of a long enough stretch of hard regs none of which conflicts with ALLOCNO. |
953 | The registers marked in PREFREGS are tried first. | |
954 | ||
955 | LOSERS, if non-zero, is a HARD_REG_SET indicating registers that cannot | |
956 | be used for this allocation. | |
957 | ||
b1ec3c92 CH |
958 | If ALT_REGS_P is zero, consider only the preferred class of ALLOCNO's reg. |
959 | Otherwise ignore that preferred class and use the alternate class. | |
38398762 RK |
960 | |
961 | If ACCEPT_CALL_CLOBBERED is nonzero, accept a call-clobbered hard reg that | |
962 | will have to be saved and restored at calls. | |
963 | ||
1d56e983 RS |
964 | RETRYING is nonzero if this is called from retry_global_alloc. |
965 | ||
38398762 RK |
966 | If we find one, record it in reg_renumber. |
967 | If not, do nothing. */ | |
968 | ||
969 | static void | |
5c0ecffe JH |
970 | find_reg (num, losers, alt_regs_p, accept_call_clobbered, retrying) |
971 | int num; | |
38398762 | 972 | HARD_REG_SET losers; |
b1ec3c92 | 973 | int alt_regs_p; |
38398762 | 974 | int accept_call_clobbered; |
1d56e983 | 975 | int retrying; |
38398762 RK |
976 | { |
977 | register int i, best_reg, pass; | |
978 | #ifdef HARD_REG_SET | |
979 | register /* Declare it register if it's a scalar. */ | |
980 | #endif | |
1d56e983 | 981 | HARD_REG_SET used, used1, used2; |
38398762 | 982 | |
b1ec3c92 | 983 | enum reg_class class = (alt_regs_p |
5c0ecffe JH |
984 | ? reg_alternate_class (allocno[num].reg) |
985 | : reg_preferred_class (allocno[num].reg)); | |
986 | enum machine_mode mode = PSEUDO_REGNO_MODE (allocno[num].reg); | |
38398762 RK |
987 | |
988 | if (accept_call_clobbered) | |
989 | COPY_HARD_REG_SET (used1, call_fixed_reg_set); | |
5c0ecffe | 990 | else if (allocno[num].calls_crossed == 0) |
38398762 RK |
991 | COPY_HARD_REG_SET (used1, fixed_reg_set); |
992 | else | |
993 | COPY_HARD_REG_SET (used1, call_used_reg_set); | |
994 | ||
995 | /* Some registers should not be allocated in global-alloc. */ | |
996 | IOR_HARD_REG_SET (used1, no_global_alloc_regs); | |
997 | if (losers) | |
998 | IOR_HARD_REG_SET (used1, losers); | |
999 | ||
1000 | IOR_COMPL_HARD_REG_SET (used1, reg_class_contents[(int) class]); | |
1d56e983 RS |
1001 | COPY_HARD_REG_SET (used2, used1); |
1002 | ||
5c0ecffe | 1003 | IOR_HARD_REG_SET (used1, allocno[num].hard_reg_conflicts); |
38398762 | 1004 | |
02188693 RH |
1005 | #ifdef CLASS_CANNOT_CHANGE_MODE |
1006 | if (REG_CHANGES_MODE (allocno[num].reg)) | |
d546b10a | 1007 | IOR_HARD_REG_SET (used1, |
02188693 | 1008 | reg_class_contents[(int) CLASS_CANNOT_CHANGE_MODE]); |
d546b10a RK |
1009 | #endif |
1010 | ||
38398762 | 1011 | /* Try each hard reg to see if it fits. Do this in two passes. |
d45cf215 | 1012 | In the first pass, skip registers that are preferred by some other pseudo |
38398762 RK |
1013 | to give it a better chance of getting one of those registers. Only if |
1014 | we can't get a register when excluding those do we take one of them. | |
1015 | However, we never allocate a register for the first time in pass 0. */ | |
1016 | ||
1017 | COPY_HARD_REG_SET (used, used1); | |
1018 | IOR_COMPL_HARD_REG_SET (used, regs_used_so_far); | |
5c0ecffe | 1019 | IOR_HARD_REG_SET (used, allocno[num].regs_someone_prefers); |
38398762 RK |
1020 | |
1021 | best_reg = -1; | |
1022 | for (i = FIRST_PSEUDO_REGISTER, pass = 0; | |
1023 | pass <= 1 && i >= FIRST_PSEUDO_REGISTER; | |
1024 | pass++) | |
1025 | { | |
1026 | if (pass == 1) | |
1027 | COPY_HARD_REG_SET (used, used1); | |
1028 | for (i = 0; i < FIRST_PSEUDO_REGISTER; i++) | |
1029 | { | |
1030 | #ifdef REG_ALLOC_ORDER | |
1031 | int regno = reg_alloc_order[i]; | |
1032 | #else | |
1033 | int regno = i; | |
1034 | #endif | |
1035 | if (! TEST_HARD_REG_BIT (used, regno) | |
1e326708 | 1036 | && HARD_REGNO_MODE_OK (regno, mode) |
5c0ecffe | 1037 | && (allocno[num].calls_crossed == 0 |
1e326708 MH |
1038 | || accept_call_clobbered |
1039 | || ! HARD_REGNO_CALL_PART_CLOBBERED (regno, mode))) | |
38398762 RK |
1040 | { |
1041 | register int j; | |
1042 | register int lim = regno + HARD_REGNO_NREGS (regno, mode); | |
1043 | for (j = regno + 1; | |
1044 | (j < lim | |
1045 | && ! TEST_HARD_REG_BIT (used, j)); | |
1046 | j++); | |
1047 | if (j == lim) | |
1048 | { | |
1049 | best_reg = regno; | |
1050 | break; | |
1051 | } | |
1052 | #ifndef REG_ALLOC_ORDER | |
1053 | i = j; /* Skip starting points we know will lose */ | |
1054 | #endif | |
1055 | } | |
1056 | } | |
1057 | } | |
1058 | ||
1059 | /* See if there is a preferred register with the same class as the register | |
1060 | we allocated above. Making this restriction prevents register | |
1061 | preferencing from creating worse register allocation. | |
1062 | ||
1063 | Remove from the preferred registers and conflicting registers. Note that | |
1064 | additional conflicts may have been added after `prune_preferences' was | |
1065 | called. | |
1066 | ||
1067 | First do this for those register with copy preferences, then all | |
1068 | preferred registers. */ | |
1069 | ||
5c0ecffe JH |
1070 | AND_COMPL_HARD_REG_SET (allocno[num].hard_reg_copy_preferences, used); |
1071 | GO_IF_HARD_REG_SUBSET (allocno[num].hard_reg_copy_preferences, | |
38398762 RK |
1072 | reg_class_contents[(int) NO_REGS], no_copy_prefs); |
1073 | ||
1074 | if (best_reg >= 0) | |
1075 | { | |
1076 | for (i = 0; i < FIRST_PSEUDO_REGISTER; i++) | |
5c0ecffe | 1077 | if (TEST_HARD_REG_BIT (allocno[num].hard_reg_copy_preferences, i) |
38398762 RK |
1078 | && HARD_REGNO_MODE_OK (i, mode) |
1079 | && (REGNO_REG_CLASS (i) == REGNO_REG_CLASS (best_reg) | |
1080 | || reg_class_subset_p (REGNO_REG_CLASS (i), | |
1081 | REGNO_REG_CLASS (best_reg)) | |
1082 | || reg_class_subset_p (REGNO_REG_CLASS (best_reg), | |
1083 | REGNO_REG_CLASS (i)))) | |
1084 | { | |
1085 | register int j; | |
1086 | register int lim = i + HARD_REGNO_NREGS (i, mode); | |
1087 | for (j = i + 1; | |
1088 | (j < lim | |
1089 | && ! TEST_HARD_REG_BIT (used, j) | |
1090 | && (REGNO_REG_CLASS (j) | |
1091 | == REGNO_REG_CLASS (best_reg + (j - i)) | |
1092 | || reg_class_subset_p (REGNO_REG_CLASS (j), | |
1093 | REGNO_REG_CLASS (best_reg + (j - i))) | |
1094 | || reg_class_subset_p (REGNO_REG_CLASS (best_reg + (j - i)), | |
1095 | REGNO_REG_CLASS (j)))); | |
1096 | j++); | |
1097 | if (j == lim) | |
1098 | { | |
1099 | best_reg = i; | |
1100 | goto no_prefs; | |
1101 | } | |
1102 | } | |
1103 | } | |
1104 | no_copy_prefs: | |
1105 | ||
5c0ecffe JH |
1106 | AND_COMPL_HARD_REG_SET (allocno[num].hard_reg_preferences, used); |
1107 | GO_IF_HARD_REG_SUBSET (allocno[num].hard_reg_preferences, | |
38398762 RK |
1108 | reg_class_contents[(int) NO_REGS], no_prefs); |
1109 | ||
1110 | if (best_reg >= 0) | |
1111 | { | |
1112 | for (i = 0; i < FIRST_PSEUDO_REGISTER; i++) | |
5c0ecffe | 1113 | if (TEST_HARD_REG_BIT (allocno[num].hard_reg_preferences, i) |
38398762 RK |
1114 | && HARD_REGNO_MODE_OK (i, mode) |
1115 | && (REGNO_REG_CLASS (i) == REGNO_REG_CLASS (best_reg) | |
1116 | || reg_class_subset_p (REGNO_REG_CLASS (i), | |
1117 | REGNO_REG_CLASS (best_reg)) | |
1118 | || reg_class_subset_p (REGNO_REG_CLASS (best_reg), | |
1119 | REGNO_REG_CLASS (i)))) | |
1120 | { | |
1121 | register int j; | |
1122 | register int lim = i + HARD_REGNO_NREGS (i, mode); | |
1123 | for (j = i + 1; | |
1124 | (j < lim | |
1125 | && ! TEST_HARD_REG_BIT (used, j) | |
1126 | && (REGNO_REG_CLASS (j) | |
1127 | == REGNO_REG_CLASS (best_reg + (j - i)) | |
1128 | || reg_class_subset_p (REGNO_REG_CLASS (j), | |
1129 | REGNO_REG_CLASS (best_reg + (j - i))) | |
1130 | || reg_class_subset_p (REGNO_REG_CLASS (best_reg + (j - i)), | |
1131 | REGNO_REG_CLASS (j)))); | |
1132 | j++); | |
1133 | if (j == lim) | |
1134 | { | |
1135 | best_reg = i; | |
1136 | break; | |
1137 | } | |
1138 | } | |
1139 | } | |
1140 | no_prefs: | |
1141 | ||
cfcf04a6 RK |
1142 | /* If we haven't succeeded yet, try with caller-saves. |
1143 | We need not check to see if the current function has nonlocal | |
1144 | labels because we don't put any pseudos that are live over calls in | |
1145 | registers in that case. */ | |
1146 | ||
1d56e983 RS |
1147 | if (flag_caller_saves && best_reg < 0) |
1148 | { | |
1149 | /* Did not find a register. If it would be profitable to | |
1150 | allocate a call-clobbered register and save and restore it | |
1151 | around calls, do that. */ | |
1152 | if (! accept_call_clobbered | |
5c0ecffe JH |
1153 | && allocno[num].calls_crossed != 0 |
1154 | && CALLER_SAVE_PROFITABLE (allocno[num].n_refs, | |
1155 | allocno[num].calls_crossed)) | |
1d56e983 | 1156 | { |
6cad67d2 JL |
1157 | HARD_REG_SET new_losers; |
1158 | if (! losers) | |
1159 | CLEAR_HARD_REG_SET (new_losers); | |
1160 | else | |
1161 | COPY_HARD_REG_SET (new_losers, losers); | |
1162 | ||
1163 | IOR_HARD_REG_SET(new_losers, losing_caller_save_reg_set); | |
5c0ecffe JH |
1164 | find_reg (num, new_losers, alt_regs_p, 1, retrying); |
1165 | if (reg_renumber[allocno[num].reg] >= 0) | |
1d56e983 RS |
1166 | { |
1167 | caller_save_needed = 1; | |
1168 | return; | |
1169 | } | |
1170 | } | |
1171 | } | |
1172 | ||
1173 | /* If we haven't succeeded yet, | |
1174 | see if some hard reg that conflicts with us | |
1175 | was utilized poorly by local-alloc. | |
1176 | If so, kick out the regs that were put there by local-alloc | |
1177 | so we can use it instead. */ | |
1178 | if (best_reg < 0 && !retrying | |
1179 | /* Let's not bother with multi-reg allocnos. */ | |
5c0ecffe | 1180 | && allocno[num].size == 1) |
1d56e983 RS |
1181 | { |
1182 | /* Count from the end, to find the least-used ones first. */ | |
1183 | for (i = FIRST_PSEUDO_REGISTER - 1; i >= 0; i--) | |
17a0a76d RK |
1184 | { |
1185 | #ifdef REG_ALLOC_ORDER | |
1186 | int regno = reg_alloc_order[i]; | |
1187 | #else | |
1188 | int regno = i; | |
1189 | #endif | |
34e56753 | 1190 | |
17a0a76d RK |
1191 | if (local_reg_n_refs[regno] != 0 |
1192 | /* Don't use a reg no good for this pseudo. */ | |
1193 | && ! TEST_HARD_REG_BIT (used2, regno) | |
d546b10a | 1194 | && HARD_REGNO_MODE_OK (regno, mode) |
02188693 RH |
1195 | #ifdef CLASS_CANNOT_CHANGE_MODE |
1196 | && ! (REG_CHANGES_MODE (allocno[num].reg) | |
d546b10a | 1197 | && (TEST_HARD_REG_BIT |
02188693 | 1198 | (reg_class_contents[(int) CLASS_CANNOT_CHANGE_MODE], |
d546b10a RK |
1199 | regno))) |
1200 | #endif | |
1201 | ) | |
17a0a76d | 1202 | { |
7a17c588 JW |
1203 | /* We explicitly evaluate the divide results into temporary |
1204 | variables so as to avoid excess precision problems that occur | |
1205 | on a i386-unknown-sysv4.2 (unixware) host. */ | |
1206 | ||
1207 | double tmp1 = ((double) local_reg_n_refs[regno] | |
1208 | / local_reg_live_length[regno]); | |
5c0ecffe JH |
1209 | double tmp2 = ((double) allocno[num].n_refs |
1210 | / allocno[num].live_length); | |
7a17c588 JW |
1211 | |
1212 | if (tmp1 < tmp2) | |
1213 | { | |
1214 | /* Hard reg REGNO was used less in total by local regs | |
1215 | than it would be used by this one allocno! */ | |
1216 | int k; | |
1217 | for (k = 0; k < max_regno; k++) | |
1218 | if (reg_renumber[k] >= 0) | |
1219 | { | |
1220 | int r = reg_renumber[k]; | |
1221 | int endregno | |
1222 | = r + HARD_REGNO_NREGS (r, PSEUDO_REGNO_MODE (k)); | |
34e56753 | 1223 | |
7a17c588 JW |
1224 | if (regno >= r && regno < endregno) |
1225 | reg_renumber[k] = -1; | |
1226 | } | |
17a0a76d | 1227 | |
7a17c588 JW |
1228 | best_reg = regno; |
1229 | break; | |
1230 | } | |
17a0a76d RK |
1231 | } |
1232 | } | |
1d56e983 RS |
1233 | } |
1234 | ||
38398762 RK |
1235 | /* Did we find a register? */ |
1236 | ||
1237 | if (best_reg >= 0) | |
1238 | { | |
1239 | register int lim, j; | |
1240 | HARD_REG_SET this_reg; | |
1241 | ||
1242 | /* Yes. Record it as the hard register of this pseudo-reg. */ | |
5c0ecffe | 1243 | reg_renumber[allocno[num].reg] = best_reg; |
38398762 | 1244 | /* Also of any pseudo-regs that share with it. */ |
5c0ecffe | 1245 | if (reg_may_share[allocno[num].reg]) |
38398762 | 1246 | for (j = FIRST_PSEUDO_REGISTER; j < max_regno; j++) |
5c0ecffe | 1247 | if (reg_allocno[j] == num) |
38398762 RK |
1248 | reg_renumber[j] = best_reg; |
1249 | ||
1250 | /* Make a set of the hard regs being allocated. */ | |
1251 | CLEAR_HARD_REG_SET (this_reg); | |
1252 | lim = best_reg + HARD_REGNO_NREGS (best_reg, mode); | |
1253 | for (j = best_reg; j < lim; j++) | |
1254 | { | |
1255 | SET_HARD_REG_BIT (this_reg, j); | |
1256 | SET_HARD_REG_BIT (regs_used_so_far, j); | |
1d56e983 RS |
1257 | /* This is no longer a reg used just by local regs. */ |
1258 | local_reg_n_refs[j] = 0; | |
38398762 RK |
1259 | } |
1260 | /* For each other pseudo-reg conflicting with this one, | |
1261 | mark it as conflicting with the hard regs this one occupies. */ | |
5c0ecffe | 1262 | lim = num; |
312618c7 | 1263 | EXECUTE_IF_SET_IN_ALLOCNO_SET (conflicts + lim * allocno_row_words, j, |
32c8d1bc | 1264 | { |
5c0ecffe | 1265 | IOR_HARD_REG_SET (allocno[j].hard_reg_conflicts, this_reg); |
32c8d1bc | 1266 | }); |
38398762 | 1267 | } |
38398762 RK |
1268 | } |
1269 | \f | |
1270 | /* Called from `reload' to look for a hard reg to put pseudo reg REGNO in. | |
1271 | Perhaps it had previously seemed not worth a hard reg, | |
1272 | or perhaps its old hard reg has been commandeered for reloads. | |
1273 | FORBIDDEN_REGS indicates certain hard regs that may not be used, even if | |
1274 | they do not appear to be allocated. | |
1275 | If FORBIDDEN_REGS is zero, no regs are forbidden. */ | |
1276 | ||
1277 | void | |
1278 | retry_global_alloc (regno, forbidden_regs) | |
1279 | int regno; | |
1280 | HARD_REG_SET forbidden_regs; | |
1281 | { | |
1282 | int allocno = reg_allocno[regno]; | |
1283 | if (allocno >= 0) | |
1284 | { | |
1285 | /* If we have more than one register class, | |
1286 | first try allocating in the class that is cheapest | |
1287 | for this pseudo-reg. If that fails, try any reg. */ | |
1288 | if (N_REG_CLASSES > 1) | |
1d56e983 | 1289 | find_reg (allocno, forbidden_regs, 0, 0, 1); |
38398762 | 1290 | if (reg_renumber[regno] < 0 |
b1ec3c92 | 1291 | && reg_alternate_class (regno) != NO_REGS) |
1d56e983 | 1292 | find_reg (allocno, forbidden_regs, 1, 0, 1); |
38398762 RK |
1293 | |
1294 | /* If we found a register, modify the RTL for the register to | |
1295 | show the hard register, and mark that register live. */ | |
1296 | if (reg_renumber[regno] >= 0) | |
1297 | { | |
1298 | REGNO (regno_reg_rtx[regno]) = reg_renumber[regno]; | |
1299 | mark_home_live (regno); | |
1300 | } | |
1301 | } | |
1302 | } | |
1303 | \f | |
1304 | /* Record a conflict between register REGNO | |
1305 | and everything currently live. | |
1306 | REGNO must not be a pseudo reg that was allocated | |
1307 | by local_alloc; such numbers must be translated through | |
1308 | reg_renumber before calling here. */ | |
1309 | ||
1310 | static void | |
1311 | record_one_conflict (regno) | |
1312 | int regno; | |
1313 | { | |
1314 | register int j; | |
1315 | ||
1316 | if (regno < FIRST_PSEUDO_REGISTER) | |
1317 | /* When a hard register becomes live, | |
1318 | record conflicts with live pseudo regs. */ | |
32c8d1bc | 1319 | EXECUTE_IF_SET_IN_ALLOCNO_SET (allocnos_live, j, |
38398762 | 1320 | { |
5c0ecffe | 1321 | SET_HARD_REG_BIT (allocno[j].hard_reg_conflicts, regno); |
32c8d1bc | 1322 | }); |
38398762 RK |
1323 | else |
1324 | /* When a pseudo-register becomes live, | |
1325 | record conflicts first with hard regs, | |
1326 | then with other pseudo regs. */ | |
1327 | { | |
1328 | register int ialloc = reg_allocno[regno]; | |
1329 | register int ialloc_prod = ialloc * allocno_row_words; | |
5c0ecffe | 1330 | IOR_HARD_REG_SET (allocno[ialloc].hard_reg_conflicts, hard_regs_live); |
38398762 RK |
1331 | for (j = allocno_row_words - 1; j >= 0; j--) |
1332 | { | |
1333 | #if 0 | |
1334 | int k; | |
1335 | for (k = 0; k < n_no_conflict_pairs; k++) | |
1336 | if (! ((j == no_conflict_pairs[k].allocno1 | |
1337 | && ialloc == no_conflict_pairs[k].allocno2) | |
1338 | || | |
1339 | (j == no_conflict_pairs[k].allocno2 | |
1340 | && ialloc == no_conflict_pairs[k].allocno1))) | |
1341 | #endif /* 0 */ | |
1342 | conflicts[ialloc_prod + j] |= allocnos_live[j]; | |
1343 | } | |
1344 | } | |
1345 | } | |
1346 | ||
1347 | /* Record all allocnos currently live as conflicting | |
bdc24974 JL |
1348 | with all hard regs currently live. |
1349 | ||
38398762 RK |
1350 | ALLOCNO_VEC is a vector of LEN allocnos, all allocnos that |
1351 | are currently live. Their bits are also flagged in allocnos_live. */ | |
1352 | ||
1353 | static void | |
1354 | record_conflicts (allocno_vec, len) | |
8d4c79be | 1355 | register int *allocno_vec; |
38398762 RK |
1356 | register int len; |
1357 | { | |
5c0ecffe | 1358 | register int num; |
38398762 RK |
1359 | register int ialloc_prod; |
1360 | ||
1361 | while (--len >= 0) | |
1362 | { | |
5c0ecffe JH |
1363 | num = allocno_vec[len]; |
1364 | ialloc_prod = num * allocno_row_words; | |
1365 | IOR_HARD_REG_SET (allocno[num].hard_reg_conflicts, hard_regs_live); | |
38398762 RK |
1366 | } |
1367 | } | |
267cf808 JL |
1368 | |
1369 | /* If CONFLICTP (i, j) is true, make sure CONFLICTP (j, i) is also true. */ | |
1370 | static void | |
1371 | mirror_conflicts () | |
1372 | { | |
1373 | register int i, j; | |
1374 | int rw = allocno_row_words; | |
1375 | int rwb = rw * INT_BITS; | |
1376 | INT_TYPE *p = conflicts; | |
1377 | INT_TYPE *q0 = conflicts, *q1, *q2; | |
1378 | unsigned INT_TYPE mask; | |
1379 | ||
1380 | for (i = max_allocno - 1, mask = 1; i >= 0; i--, mask <<= 1) | |
1381 | { | |
1382 | if (! mask) | |
1383 | { | |
1384 | mask = 1; | |
1385 | q0++; | |
1386 | } | |
1387 | for (j = allocno_row_words - 1, q1 = q0; j >= 0; j--, q1 += rwb) | |
1388 | { | |
1389 | unsigned INT_TYPE word; | |
1390 | ||
1391 | for (word = (unsigned INT_TYPE) *p++, q2 = q1; word; | |
1392 | word >>= 1, q2 += rw) | |
1393 | { | |
1394 | if (word & 1) | |
1395 | *q2 |= mask; | |
1396 | } | |
1397 | } | |
1398 | } | |
1399 | } | |
38398762 RK |
1400 | \f |
1401 | /* Handle the case where REG is set by the insn being scanned, | |
1402 | during the forward scan to accumulate conflicts. | |
1403 | Store a 1 in regs_live or allocnos_live for this register, record how many | |
1404 | consecutive hardware registers it actually needs, | |
1405 | and record a conflict with all other registers already live. | |
1406 | ||
1407 | Note that even if REG does not remain alive after this insn, | |
1408 | we must mark it here as live, to ensure a conflict between | |
1409 | REG and any other regs set in this insn that really do live. | |
1410 | This is because those other regs could be considered after this. | |
1411 | ||
1412 | REG might actually be something other than a register; | |
1413 | if so, we do nothing. | |
1414 | ||
1415 | SETTER is 0 if this register was modified by an auto-increment (i.e., | |
a4c3ddd8 | 1416 | a REG_INC note was found for it). */ |
38398762 RK |
1417 | |
1418 | static void | |
84832317 | 1419 | mark_reg_store (reg, setter, data) |
a4c3ddd8 | 1420 | rtx reg, setter; |
84832317 | 1421 | void *data ATTRIBUTE_UNUSED; |
38398762 RK |
1422 | { |
1423 | register int regno; | |
38398762 RK |
1424 | |
1425 | /* WORD is which word of a multi-register group is being stored. | |
1426 | For the case where the store is actually into a SUBREG of REG. | |
1427 | Except we don't use it; I believe the entire REG needs to be | |
1428 | made live. */ | |
1429 | int word = 0; | |
1430 | ||
1431 | if (GET_CODE (reg) == SUBREG) | |
1432 | { | |
1433 | word = SUBREG_WORD (reg); | |
1434 | reg = SUBREG_REG (reg); | |
1435 | } | |
1436 | ||
1437 | if (GET_CODE (reg) != REG) | |
1438 | return; | |
1439 | ||
38398762 RK |
1440 | regs_set[n_regs_set++] = reg; |
1441 | ||
a4c3ddd8 | 1442 | if (setter && GET_CODE (setter) != CLOBBER) |
38398762 RK |
1443 | set_preference (reg, SET_SRC (setter)); |
1444 | ||
1445 | regno = REGNO (reg); | |
1446 | ||
38398762 RK |
1447 | /* Either this is one of the max_allocno pseudo regs not allocated, |
1448 | or it is or has a hardware reg. First handle the pseudo-regs. */ | |
1449 | if (regno >= FIRST_PSEUDO_REGISTER) | |
1450 | { | |
1451 | if (reg_allocno[regno] >= 0) | |
1452 | { | |
1453 | SET_ALLOCNO_LIVE (reg_allocno[regno]); | |
1454 | record_one_conflict (regno); | |
1455 | } | |
1456 | } | |
a300b8d9 JW |
1457 | |
1458 | if (reg_renumber[regno] >= 0) | |
1459 | regno = reg_renumber[regno] /* + word */; | |
1460 | ||
38398762 | 1461 | /* Handle hardware regs (and pseudos allocated to hard regs). */ |
a300b8d9 | 1462 | if (regno < FIRST_PSEUDO_REGISTER && ! fixed_regs[regno]) |
38398762 RK |
1463 | { |
1464 | register int last = regno + HARD_REGNO_NREGS (regno, GET_MODE (reg)); | |
1465 | while (regno < last) | |
1466 | { | |
1467 | record_one_conflict (regno); | |
1468 | SET_HARD_REG_BIT (hard_regs_live, regno); | |
1469 | regno++; | |
1470 | } | |
1471 | } | |
1472 | } | |
1473 | \f | |
1474 | /* Like mark_reg_set except notice just CLOBBERs; ignore SETs. */ | |
1475 | ||
1476 | static void | |
84832317 | 1477 | mark_reg_clobber (reg, setter, data) |
38398762 | 1478 | rtx reg, setter; |
84832317 | 1479 | void *data ATTRIBUTE_UNUSED; |
38398762 | 1480 | { |
a4c3ddd8 | 1481 | if (GET_CODE (setter) == CLOBBER) |
84832317 | 1482 | mark_reg_store (reg, setter, data); |
333e0f7d RS |
1483 | } |
1484 | ||
1485 | /* Record that REG has conflicts with all the regs currently live. | |
1486 | Do not mark REG itself as live. */ | |
1487 | ||
1488 | static void | |
1489 | mark_reg_conflicts (reg) | |
1490 | rtx reg; | |
1491 | { | |
1492 | register int regno; | |
1493 | ||
1494 | if (GET_CODE (reg) == SUBREG) | |
1495 | reg = SUBREG_REG (reg); | |
1496 | ||
1497 | if (GET_CODE (reg) != REG) | |
1498 | return; | |
1499 | ||
1500 | regno = REGNO (reg); | |
1501 | ||
333e0f7d RS |
1502 | /* Either this is one of the max_allocno pseudo regs not allocated, |
1503 | or it is or has a hardware reg. First handle the pseudo-regs. */ | |
1504 | if (regno >= FIRST_PSEUDO_REGISTER) | |
1505 | { | |
1506 | if (reg_allocno[regno] >= 0) | |
1507 | record_one_conflict (regno); | |
1508 | } | |
a300b8d9 JW |
1509 | |
1510 | if (reg_renumber[regno] >= 0) | |
1511 | regno = reg_renumber[regno]; | |
1512 | ||
333e0f7d | 1513 | /* Handle hardware regs (and pseudos allocated to hard regs). */ |
a300b8d9 | 1514 | if (regno < FIRST_PSEUDO_REGISTER && ! fixed_regs[regno]) |
333e0f7d RS |
1515 | { |
1516 | register int last = regno + HARD_REGNO_NREGS (regno, GET_MODE (reg)); | |
1517 | while (regno < last) | |
1518 | { | |
1519 | record_one_conflict (regno); | |
1520 | regno++; | |
1521 | } | |
1522 | } | |
38398762 RK |
1523 | } |
1524 | \f | |
1525 | /* Mark REG as being dead (following the insn being scanned now). | |
1526 | Store a 0 in regs_live or allocnos_live for this register. */ | |
1527 | ||
1528 | static void | |
1529 | mark_reg_death (reg) | |
1530 | rtx reg; | |
1531 | { | |
1532 | register int regno = REGNO (reg); | |
1533 | ||
38398762 RK |
1534 | /* Either this is one of the max_allocno pseudo regs not allocated, |
1535 | or it is a hardware reg. First handle the pseudo-regs. */ | |
1536 | if (regno >= FIRST_PSEUDO_REGISTER) | |
1537 | { | |
1538 | if (reg_allocno[regno] >= 0) | |
1539 | CLEAR_ALLOCNO_LIVE (reg_allocno[regno]); | |
1540 | } | |
a300b8d9 JW |
1541 | |
1542 | /* For pseudo reg, see if it has been assigned a hardware reg. */ | |
1543 | if (reg_renumber[regno] >= 0) | |
1544 | regno = reg_renumber[regno]; | |
1545 | ||
38398762 | 1546 | /* Handle hardware regs (and pseudos allocated to hard regs). */ |
a300b8d9 | 1547 | if (regno < FIRST_PSEUDO_REGISTER && ! fixed_regs[regno]) |
38398762 RK |
1548 | { |
1549 | /* Pseudo regs already assigned hardware regs are treated | |
1550 | almost the same as explicit hardware regs. */ | |
1551 | register int last = regno + HARD_REGNO_NREGS (regno, GET_MODE (reg)); | |
1552 | while (regno < last) | |
1553 | { | |
1554 | CLEAR_HARD_REG_BIT (hard_regs_live, regno); | |
1555 | regno++; | |
1556 | } | |
1557 | } | |
1558 | } | |
1559 | ||
1560 | /* Mark hard reg REGNO as currently live, assuming machine mode MODE | |
1561 | for the value stored in it. MODE determines how many consecutive | |
1562 | registers are actually in use. Do not record conflicts; | |
1563 | it is assumed that the caller will do that. */ | |
1564 | ||
1565 | static void | |
1566 | mark_reg_live_nc (regno, mode) | |
1567 | register int regno; | |
1568 | enum machine_mode mode; | |
1569 | { | |
1570 | register int last = regno + HARD_REGNO_NREGS (regno, mode); | |
1571 | while (regno < last) | |
1572 | { | |
1573 | SET_HARD_REG_BIT (hard_regs_live, regno); | |
1574 | regno++; | |
1575 | } | |
1576 | } | |
1577 | \f | |
1578 | /* Try to set a preference for an allocno to a hard register. | |
1579 | We are passed DEST and SRC which are the operands of a SET. It is known | |
1580 | that SRC is a register. If SRC or the first operand of SRC is a register, | |
1581 | try to set a preference. If one of the two is a hard register and the other | |
1582 | is a pseudo-register, mark the preference. | |
1583 | ||
6dc42e49 | 1584 | Note that we are not as aggressive as local-alloc in trying to tie a |
38398762 RK |
1585 | pseudo-register to a hard register. */ |
1586 | ||
1587 | static void | |
1588 | set_preference (dest, src) | |
1589 | rtx dest, src; | |
1590 | { | |
770ae6cc | 1591 | unsigned int src_regno, dest_regno; |
38398762 RK |
1592 | /* Amount to add to the hard regno for SRC, or subtract from that for DEST, |
1593 | to compensate for subregs in SRC or DEST. */ | |
1594 | int offset = 0; | |
770ae6cc | 1595 | unsigned int i; |
38398762 RK |
1596 | int copy = 1; |
1597 | ||
1598 | if (GET_RTX_FORMAT (GET_CODE (src))[0] == 'e') | |
1599 | src = XEXP (src, 0), copy = 0; | |
1600 | ||
1601 | /* Get the reg number for both SRC and DEST. | |
1602 | If neither is a reg, give up. */ | |
1603 | ||
1604 | if (GET_CODE (src) == REG) | |
1605 | src_regno = REGNO (src); | |
1606 | else if (GET_CODE (src) == SUBREG && GET_CODE (SUBREG_REG (src)) == REG) | |
1607 | { | |
1608 | src_regno = REGNO (SUBREG_REG (src)); | |
1609 | offset += SUBREG_WORD (src); | |
1610 | } | |
1611 | else | |
1612 | return; | |
1613 | ||
1614 | if (GET_CODE (dest) == REG) | |
1615 | dest_regno = REGNO (dest); | |
1616 | else if (GET_CODE (dest) == SUBREG && GET_CODE (SUBREG_REG (dest)) == REG) | |
1617 | { | |
1618 | dest_regno = REGNO (SUBREG_REG (dest)); | |
1619 | offset -= SUBREG_WORD (dest); | |
1620 | } | |
1621 | else | |
1622 | return; | |
1623 | ||
1624 | /* Convert either or both to hard reg numbers. */ | |
1625 | ||
1626 | if (reg_renumber[src_regno] >= 0) | |
1627 | src_regno = reg_renumber[src_regno]; | |
1628 | ||
1629 | if (reg_renumber[dest_regno] >= 0) | |
1630 | dest_regno = reg_renumber[dest_regno]; | |
1631 | ||
1632 | /* Now if one is a hard reg and the other is a global pseudo | |
1633 | then give the other a preference. */ | |
1634 | ||
1635 | if (dest_regno < FIRST_PSEUDO_REGISTER && src_regno >= FIRST_PSEUDO_REGISTER | |
1636 | && reg_allocno[src_regno] >= 0) | |
1637 | { | |
1638 | dest_regno -= offset; | |
770ae6cc | 1639 | if (dest_regno < FIRST_PSEUDO_REGISTER) |
38398762 RK |
1640 | { |
1641 | if (copy) | |
1642 | SET_REGBIT (hard_reg_copy_preferences, | |
1643 | reg_allocno[src_regno], dest_regno); | |
1644 | ||
1645 | SET_REGBIT (hard_reg_preferences, | |
1646 | reg_allocno[src_regno], dest_regno); | |
1647 | for (i = dest_regno; | |
1648 | i < dest_regno + HARD_REGNO_NREGS (dest_regno, GET_MODE (dest)); | |
1649 | i++) | |
1650 | SET_REGBIT (hard_reg_full_preferences, reg_allocno[src_regno], i); | |
1651 | } | |
1652 | } | |
1653 | ||
1654 | if (src_regno < FIRST_PSEUDO_REGISTER && dest_regno >= FIRST_PSEUDO_REGISTER | |
1655 | && reg_allocno[dest_regno] >= 0) | |
1656 | { | |
1657 | src_regno += offset; | |
770ae6cc | 1658 | if (src_regno < FIRST_PSEUDO_REGISTER) |
38398762 RK |
1659 | { |
1660 | if (copy) | |
1661 | SET_REGBIT (hard_reg_copy_preferences, | |
1662 | reg_allocno[dest_regno], src_regno); | |
1663 | ||
1664 | SET_REGBIT (hard_reg_preferences, | |
1665 | reg_allocno[dest_regno], src_regno); | |
1666 | for (i = src_regno; | |
1667 | i < src_regno + HARD_REGNO_NREGS (src_regno, GET_MODE (src)); | |
1668 | i++) | |
1669 | SET_REGBIT (hard_reg_full_preferences, reg_allocno[dest_regno], i); | |
1670 | } | |
1671 | } | |
1672 | } | |
1673 | \f | |
1674 | /* Indicate that hard register number FROM was eliminated and replaced with | |
1675 | an offset from hard register number TO. The status of hard registers live | |
1676 | at the start of a basic block is updated by replacing a use of FROM with | |
1677 | a use of TO. */ | |
1678 | ||
1679 | void | |
1680 | mark_elimination (from, to) | |
1681 | int from, to; | |
1682 | { | |
1683 | int i; | |
1684 | ||
1685 | for (i = 0; i < n_basic_blocks; i++) | |
e881bb1b RH |
1686 | { |
1687 | register regset r = BASIC_BLOCK (i)->global_live_at_start; | |
1688 | if (REGNO_REG_SET_P (r, from)) | |
1689 | { | |
1690 | CLEAR_REGNO_REG_SET (r, from); | |
1691 | SET_REGNO_REG_SET (r, to); | |
1692 | } | |
1693 | } | |
38398762 RK |
1694 | } |
1695 | \f | |
cad6f7d0 BS |
1696 | /* Used for communication between the following functions. Holds the |
1697 | current life information. */ | |
1698 | static regset live_relevant_regs; | |
1699 | ||
285f3cf0 R |
1700 | /* Record in live_relevant_regs and REGS_SET that register REG became live. |
1701 | This is called via note_stores. */ | |
cad6f7d0 | 1702 | static void |
285f3cf0 | 1703 | reg_becomes_live (reg, setter, regs_set) |
cad6f7d0 BS |
1704 | rtx reg; |
1705 | rtx setter ATTRIBUTE_UNUSED; | |
285f3cf0 | 1706 | void *regs_set; |
cad6f7d0 BS |
1707 | { |
1708 | int regno; | |
1709 | ||
1710 | if (GET_CODE (reg) == SUBREG) | |
1711 | reg = SUBREG_REG (reg); | |
1712 | ||
1713 | if (GET_CODE (reg) != REG) | |
1714 | return; | |
1715 | ||
1716 | regno = REGNO (reg); | |
1717 | if (regno < FIRST_PSEUDO_REGISTER) | |
1718 | { | |
1719 | int nregs = HARD_REGNO_NREGS (regno, GET_MODE (reg)); | |
1720 | while (nregs-- > 0) | |
285f3cf0 R |
1721 | { |
1722 | SET_REGNO_REG_SET (live_relevant_regs, regno); | |
1723 | if (! fixed_regs[regno]) | |
1724 | SET_REGNO_REG_SET ((regset) regs_set, regno); | |
1725 | regno++; | |
1726 | } | |
cad6f7d0 BS |
1727 | } |
1728 | else if (reg_renumber[regno] >= 0) | |
285f3cf0 R |
1729 | { |
1730 | SET_REGNO_REG_SET (live_relevant_regs, regno); | |
1731 | SET_REGNO_REG_SET ((regset) regs_set, regno); | |
1732 | } | |
cad6f7d0 BS |
1733 | } |
1734 | ||
1735 | /* Record in live_relevant_regs that register REGNO died. */ | |
1736 | static void | |
285f3cf0 | 1737 | reg_dies (regno, mode, chain) |
cad6f7d0 BS |
1738 | int regno; |
1739 | enum machine_mode mode; | |
285f3cf0 | 1740 | struct insn_chain *chain; |
cad6f7d0 BS |
1741 | { |
1742 | if (regno < FIRST_PSEUDO_REGISTER) | |
1743 | { | |
1744 | int nregs = HARD_REGNO_NREGS (regno, mode); | |
1745 | while (nregs-- > 0) | |
285f3cf0 R |
1746 | { |
1747 | CLEAR_REGNO_REG_SET (live_relevant_regs, regno); | |
1748 | if (! fixed_regs[regno]) | |
239a0f5b | 1749 | SET_REGNO_REG_SET (&chain->dead_or_set, regno); |
285f3cf0 R |
1750 | regno++; |
1751 | } | |
cad6f7d0 BS |
1752 | } |
1753 | else | |
285f3cf0 R |
1754 | { |
1755 | CLEAR_REGNO_REG_SET (live_relevant_regs, regno); | |
1756 | if (reg_renumber[regno] >= 0) | |
239a0f5b | 1757 | SET_REGNO_REG_SET (&chain->dead_or_set, regno); |
285f3cf0 | 1758 | } |
cad6f7d0 BS |
1759 | } |
1760 | ||
1761 | /* Walk the insns of the current function and build reload_insn_chain, | |
1762 | and record register life information. */ | |
d29c259b | 1763 | void |
108c535a RH |
1764 | build_insn_chain (first) |
1765 | rtx first; | |
cad6f7d0 BS |
1766 | { |
1767 | struct insn_chain **p = &reload_insn_chain; | |
1768 | struct insn_chain *prev = 0; | |
108c535a | 1769 | int b = 0; |
ee25a7a5 | 1770 | regset_head live_relevant_regs_head; |
cad6f7d0 | 1771 | |
ee25a7a5 | 1772 | live_relevant_regs = INITIALIZE_REG_SET (live_relevant_regs_head); |
cad6f7d0 | 1773 | |
108c535a | 1774 | for (; first; first = NEXT_INSN (first)) |
cad6f7d0 | 1775 | { |
108c535a | 1776 | struct insn_chain *c; |
cad6f7d0 | 1777 | |
108c535a | 1778 | if (first == BLOCK_HEAD (b)) |
cad6f7d0 | 1779 | { |
108c535a | 1780 | int i; |
267cf808 | 1781 | |
108c535a | 1782 | CLEAR_REG_SET (live_relevant_regs); |
267cf808 JL |
1783 | |
1784 | EXECUTE_IF_SET_IN_BITMAP | |
1785 | (BASIC_BLOCK (b)->global_live_at_start, 0, i, | |
1786 | { | |
1787 | if (i < FIRST_PSEUDO_REGISTER | |
1788 | ? ! TEST_HARD_REG_BIT (eliminable_regset, i) | |
1789 | : reg_renumber[i] >= 0) | |
1790 | SET_REGNO_REG_SET (live_relevant_regs, i); | |
1791 | }); | |
1792 | } | |
108c535a RH |
1793 | |
1794 | if (GET_CODE (first) != NOTE && GET_CODE (first) != BARRIER) | |
021d1677 | 1795 | { |
108c535a RH |
1796 | c = new_insn_chain (); |
1797 | c->prev = prev; | |
1798 | prev = c; | |
1799 | *p = c; | |
1800 | p = &c->next; | |
1801 | c->insn = first; | |
1802 | c->block = b; | |
1803 | ||
2c3c49de | 1804 | if (INSN_P (first)) |
cad6f7d0 | 1805 | { |
108c535a | 1806 | rtx link; |
cad6f7d0 | 1807 | |
108c535a | 1808 | /* Mark the death of everything that dies in this instruction. */ |
cad6f7d0 | 1809 | |
108c535a RH |
1810 | for (link = REG_NOTES (first); link; link = XEXP (link, 1)) |
1811 | if (REG_NOTE_KIND (link) == REG_DEAD | |
1812 | && GET_CODE (XEXP (link, 0)) == REG) | |
285f3cf0 R |
1813 | reg_dies (REGNO (XEXP (link, 0)), GET_MODE (XEXP (link, 0)), |
1814 | c); | |
1815 | ||
239a0f5b | 1816 | COPY_REG_SET (&c->live_throughout, live_relevant_regs); |
cad6f7d0 | 1817 | |
108c535a | 1818 | /* Mark everything born in this instruction as live. */ |
cad6f7d0 | 1819 | |
285f3cf0 | 1820 | note_stores (PATTERN (first), reg_becomes_live, |
239a0f5b | 1821 | &c->dead_or_set); |
cad6f7d0 | 1822 | } |
285f3cf0 | 1823 | else |
239a0f5b | 1824 | COPY_REG_SET (&c->live_throughout, live_relevant_regs); |
108c535a | 1825 | |
2c3c49de | 1826 | if (INSN_P (first)) |
108c535a RH |
1827 | { |
1828 | rtx link; | |
1829 | ||
1830 | /* Mark anything that is set in this insn and then unused as dying. */ | |
1831 | ||
1832 | for (link = REG_NOTES (first); link; link = XEXP (link, 1)) | |
1833 | if (REG_NOTE_KIND (link) == REG_UNUSED | |
1834 | && GET_CODE (XEXP (link, 0)) == REG) | |
285f3cf0 R |
1835 | reg_dies (REGNO (XEXP (link, 0)), GET_MODE (XEXP (link, 0)), |
1836 | c); | |
108c535a | 1837 | } |
3663a304 | 1838 | } |
021d1677 | 1839 | |
108c535a RH |
1840 | if (first == BLOCK_END (b)) |
1841 | b++; | |
1842 | ||
1843 | /* Stop after we pass the end of the last basic block. Verify that | |
1844 | no real insns are after the end of the last basic block. | |
1845 | ||
1846 | We may want to reorganize the loop somewhat since this test should | |
1847 | always be the right exit test. */ | |
1848 | if (b == n_basic_blocks) | |
1849 | { | |
1850 | for (first = NEXT_INSN (first) ; first; first = NEXT_INSN (first)) | |
2c3c49de | 1851 | if (INSN_P (first) && GET_CODE (PATTERN (first)) != USE) |
108c535a RH |
1852 | abort (); |
1853 | break; | |
1854 | } | |
1855 | } | |
cad6f7d0 BS |
1856 | FREE_REG_SET (live_relevant_regs); |
1857 | *p = 0; | |
1858 | } | |
1859 | \f | |
318e4b56 | 1860 | /* Print debugging trace information if -dg switch is given, |
38398762 RK |
1861 | showing the information on which the allocation decisions are based. */ |
1862 | ||
1863 | static void | |
1864 | dump_conflicts (file) | |
1865 | FILE *file; | |
1866 | { | |
1867 | register int i; | |
1868 | register int has_preferences; | |
a300b8d9 JW |
1869 | register int nregs; |
1870 | nregs = 0; | |
1871 | for (i = 0; i < max_allocno; i++) | |
1872 | { | |
5c0ecffe | 1873 | if (reg_renumber[allocno[allocno_order[i]].reg] >= 0) |
a300b8d9 JW |
1874 | continue; |
1875 | nregs++; | |
1876 | } | |
1877 | fprintf (file, ";; %d regs to allocate:", nregs); | |
38398762 RK |
1878 | for (i = 0; i < max_allocno; i++) |
1879 | { | |
1880 | int j; | |
5c0ecffe | 1881 | if (reg_renumber[allocno[allocno_order[i]].reg] >= 0) |
a300b8d9 | 1882 | continue; |
5c0ecffe | 1883 | fprintf (file, " %d", allocno[allocno_order[i]].reg); |
38398762 RK |
1884 | for (j = 0; j < max_regno; j++) |
1885 | if (reg_allocno[j] == allocno_order[i] | |
5c0ecffe | 1886 | && j != allocno[allocno_order[i]].reg) |
38398762 | 1887 | fprintf (file, "+%d", j); |
5c0ecffe JH |
1888 | if (allocno[allocno_order[i]].size != 1) |
1889 | fprintf (file, " (%d)", allocno[allocno_order[i]].size); | |
38398762 RK |
1890 | } |
1891 | fprintf (file, "\n"); | |
1892 | ||
1893 | for (i = 0; i < max_allocno; i++) | |
1894 | { | |
1895 | register int j; | |
5c0ecffe | 1896 | fprintf (file, ";; %d conflicts:", allocno[i].reg); |
38398762 | 1897 | for (j = 0; j < max_allocno; j++) |
267cf808 | 1898 | if (CONFLICTP (j, i)) |
5c0ecffe | 1899 | fprintf (file, " %d", allocno[j].reg); |
38398762 | 1900 | for (j = 0; j < FIRST_PSEUDO_REGISTER; j++) |
5c0ecffe | 1901 | if (TEST_HARD_REG_BIT (allocno[i].hard_reg_conflicts, j)) |
38398762 RK |
1902 | fprintf (file, " %d", j); |
1903 | fprintf (file, "\n"); | |
1904 | ||
1905 | has_preferences = 0; | |
1906 | for (j = 0; j < FIRST_PSEUDO_REGISTER; j++) | |
5c0ecffe | 1907 | if (TEST_HARD_REG_BIT (allocno[i].hard_reg_preferences, j)) |
38398762 RK |
1908 | has_preferences = 1; |
1909 | ||
1910 | if (! has_preferences) | |
1911 | continue; | |
5c0ecffe | 1912 | fprintf (file, ";; %d preferences:", allocno[i].reg); |
38398762 | 1913 | for (j = 0; j < FIRST_PSEUDO_REGISTER; j++) |
5c0ecffe | 1914 | if (TEST_HARD_REG_BIT (allocno[i].hard_reg_preferences, j)) |
38398762 RK |
1915 | fprintf (file, " %d", j); |
1916 | fprintf (file, "\n"); | |
1917 | } | |
1918 | fprintf (file, "\n"); | |
1919 | } | |
1920 | ||
1921 | void | |
1922 | dump_global_regs (file) | |
1923 | FILE *file; | |
1924 | { | |
1925 | register int i, j; | |
1926 | ||
1927 | fprintf (file, ";; Register dispositions:\n"); | |
1928 | for (i = FIRST_PSEUDO_REGISTER, j = 0; i < max_regno; i++) | |
1929 | if (reg_renumber[i] >= 0) | |
1930 | { | |
1931 | fprintf (file, "%d in %d ", i, reg_renumber[i]); | |
1932 | if (++j % 6 == 0) | |
1933 | fprintf (file, "\n"); | |
1934 | } | |
1935 | ||
1936 | fprintf (file, "\n\n;; Hard regs used: "); | |
1937 | for (i = 0; i < FIRST_PSEUDO_REGISTER; i++) | |
1938 | if (regs_ever_live[i]) | |
1939 | fprintf (file, " %d", i); | |
1940 | fprintf (file, "\n\n"); | |
1941 | } |