]>
Commit | Line | Data |
---|---|---|
18ca7dab | 1 | /* Subroutines for manipulating rtx's in semantically interesting ways. |
ef58a523 | 2 | Copyright (C) 1987, 1991, 1994, 1995, 1996, 1997, 1998, |
66647d44 | 3 | 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008 |
71d59383 | 4 | Free Software Foundation, Inc. |
18ca7dab | 5 | |
1322177d | 6 | This file is part of GCC. |
18ca7dab | 7 | |
1322177d LB |
8 | GCC is free software; you can redistribute it and/or modify it under |
9 | the terms of the GNU General Public License as published by the Free | |
9dcd6f09 | 10 | Software Foundation; either version 3, or (at your option) any later |
1322177d | 11 | version. |
18ca7dab | 12 | |
1322177d LB |
13 | GCC is distributed in the hope that it will be useful, but WITHOUT ANY |
14 | WARRANTY; without even the implied warranty of MERCHANTABILITY or | |
15 | FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License | |
16 | for more details. | |
18ca7dab RK |
17 | |
18 | You should have received a copy of the GNU General Public License | |
9dcd6f09 NC |
19 | along with GCC; see the file COPYING3. If not see |
20 | <http://www.gnu.org/licenses/>. */ | |
18ca7dab RK |
21 | |
22 | ||
23 | #include "config.h" | |
670ee920 | 24 | #include "system.h" |
4977bab6 ZW |
25 | #include "coretypes.h" |
26 | #include "tm.h" | |
01198c2f | 27 | #include "toplev.h" |
18ca7dab RK |
28 | #include "rtl.h" |
29 | #include "tree.h" | |
6baf1cc8 | 30 | #include "tm_p.h" |
18ca7dab | 31 | #include "flags.h" |
b38f3813 | 32 | #include "except.h" |
49ad7cfa | 33 | #include "function.h" |
18ca7dab | 34 | #include "expr.h" |
e78d8e51 | 35 | #include "optabs.h" |
18ca7dab RK |
36 | #include "hard-reg-set.h" |
37 | #include "insn-config.h" | |
1d974ca7 | 38 | #include "ggc.h" |
18ca7dab | 39 | #include "recog.h" |
a77a9a18 | 40 | #include "langhooks.h" |
1d636cc6 | 41 | #include "target.h" |
aacd3885 | 42 | #include "output.h" |
18ca7dab | 43 | |
502b8322 AJ |
44 | static rtx break_out_memory_refs (rtx); |
45 | static void emit_stack_probe (rtx); | |
7e4ce834 RH |
46 | |
47 | ||
48 | /* Truncate and perhaps sign-extend C as appropriate for MODE. */ | |
49 | ||
50 | HOST_WIDE_INT | |
502b8322 | 51 | trunc_int_for_mode (HOST_WIDE_INT c, enum machine_mode mode) |
7e4ce834 RH |
52 | { |
53 | int width = GET_MODE_BITSIZE (mode); | |
54 | ||
71012d97 | 55 | /* You want to truncate to a _what_? */ |
5b0264cb | 56 | gcc_assert (SCALAR_INT_MODE_P (mode)); |
71012d97 | 57 | |
1f3f36d1 RH |
58 | /* Canonicalize BImode to 0 and STORE_FLAG_VALUE. */ |
59 | if (mode == BImode) | |
60 | return c & 1 ? STORE_FLAG_VALUE : 0; | |
61 | ||
5b0d91c3 AO |
62 | /* Sign-extend for the requested mode. */ |
63 | ||
64 | if (width < HOST_BITS_PER_WIDE_INT) | |
65 | { | |
66 | HOST_WIDE_INT sign = 1; | |
67 | sign <<= width - 1; | |
68 | c &= (sign << 1) - 1; | |
69 | c ^= sign; | |
70 | c -= sign; | |
71 | } | |
7e4ce834 RH |
72 | |
73 | return c; | |
74 | } | |
75 | ||
3e95a7cb | 76 | /* Return an rtx for the sum of X and the integer C. */ |
18ca7dab RK |
77 | |
78 | rtx | |
3e95a7cb | 79 | plus_constant (rtx x, HOST_WIDE_INT c) |
18ca7dab | 80 | { |
b3694847 | 81 | RTX_CODE code; |
17ab7c59 | 82 | rtx y; |
b3694847 SS |
83 | enum machine_mode mode; |
84 | rtx tem; | |
18ca7dab RK |
85 | int all_constant = 0; |
86 | ||
87 | if (c == 0) | |
88 | return x; | |
89 | ||
90 | restart: | |
91 | ||
92 | code = GET_CODE (x); | |
93 | mode = GET_MODE (x); | |
17ab7c59 RK |
94 | y = x; |
95 | ||
18ca7dab RK |
96 | switch (code) |
97 | { | |
98 | case CONST_INT: | |
b1ec3c92 | 99 | return GEN_INT (INTVAL (x) + c); |
18ca7dab RK |
100 | |
101 | case CONST_DOUBLE: | |
102 | { | |
f9e158c3 | 103 | unsigned HOST_WIDE_INT l1 = CONST_DOUBLE_LOW (x); |
b1ec3c92 | 104 | HOST_WIDE_INT h1 = CONST_DOUBLE_HIGH (x); |
f9e158c3 | 105 | unsigned HOST_WIDE_INT l2 = c; |
b1ec3c92 | 106 | HOST_WIDE_INT h2 = c < 0 ? ~0 : 0; |
f9e158c3 JM |
107 | unsigned HOST_WIDE_INT lv; |
108 | HOST_WIDE_INT hv; | |
18ca7dab RK |
109 | |
110 | add_double (l1, h1, l2, h2, &lv, &hv); | |
111 | ||
112 | return immed_double_const (lv, hv, VOIDmode); | |
113 | } | |
114 | ||
115 | case MEM: | |
116 | /* If this is a reference to the constant pool, try replacing it with | |
117 | a reference to a new constant. If the resulting address isn't | |
118 | valid, don't return it because we have no way to validize it. */ | |
119 | if (GET_CODE (XEXP (x, 0)) == SYMBOL_REF | |
120 | && CONSTANT_POOL_ADDRESS_P (XEXP (x, 0))) | |
121 | { | |
122 | tem | |
123 | = force_const_mem (GET_MODE (x), | |
124 | plus_constant (get_pool_constant (XEXP (x, 0)), | |
125 | c)); | |
126 | if (memory_address_p (GET_MODE (tem), XEXP (tem, 0))) | |
127 | return tem; | |
128 | } | |
129 | break; | |
130 | ||
131 | case CONST: | |
132 | /* If adding to something entirely constant, set a flag | |
133 | so that we can add a CONST around the result. */ | |
134 | x = XEXP (x, 0); | |
135 | all_constant = 1; | |
136 | goto restart; | |
137 | ||
138 | case SYMBOL_REF: | |
139 | case LABEL_REF: | |
140 | all_constant = 1; | |
141 | break; | |
142 | ||
143 | case PLUS: | |
144 | /* The interesting case is adding the integer to a sum. | |
145 | Look for constant term in the sum and combine | |
146 | with C. For an integer constant term, we make a combined | |
147 | integer. For a constant term that is not an explicit integer, | |
d9b3eb63 | 148 | we cannot really combine, but group them together anyway. |
e5671f2b | 149 | |
03d937fc R |
150 | Restart or use a recursive call in case the remaining operand is |
151 | something that we handle specially, such as a SYMBOL_REF. | |
152 | ||
153 | We may not immediately return from the recursive call here, lest | |
154 | all_constant gets lost. */ | |
e5671f2b | 155 | |
481683e1 | 156 | if (CONST_INT_P (XEXP (x, 1))) |
03d937fc R |
157 | { |
158 | c += INTVAL (XEXP (x, 1)); | |
7e4ce834 RH |
159 | |
160 | if (GET_MODE (x) != VOIDmode) | |
161 | c = trunc_int_for_mode (c, GET_MODE (x)); | |
162 | ||
03d937fc R |
163 | x = XEXP (x, 0); |
164 | goto restart; | |
165 | } | |
b72f00af | 166 | else if (CONSTANT_P (XEXP (x, 1))) |
03d937fc | 167 | { |
b72f00af | 168 | x = gen_rtx_PLUS (mode, XEXP (x, 0), plus_constant (XEXP (x, 1), c)); |
03d937fc R |
169 | c = 0; |
170 | } | |
b72f00af | 171 | else if (find_constant_term_loc (&y)) |
03d937fc | 172 | { |
b72f00af RK |
173 | /* We need to be careful since X may be shared and we can't |
174 | modify it in place. */ | |
175 | rtx copy = copy_rtx (x); | |
176 | rtx *const_loc = find_constant_term_loc (©); | |
177 | ||
178 | *const_loc = plus_constant (*const_loc, c); | |
179 | x = copy; | |
03d937fc R |
180 | c = 0; |
181 | } | |
38a448ca | 182 | break; |
ed8908e7 | 183 | |
38a448ca RH |
184 | default: |
185 | break; | |
18ca7dab RK |
186 | } |
187 | ||
188 | if (c != 0) | |
38a448ca | 189 | x = gen_rtx_PLUS (mode, x, GEN_INT (c)); |
18ca7dab RK |
190 | |
191 | if (GET_CODE (x) == SYMBOL_REF || GET_CODE (x) == LABEL_REF) | |
192 | return x; | |
193 | else if (all_constant) | |
38a448ca | 194 | return gen_rtx_CONST (mode, x); |
18ca7dab RK |
195 | else |
196 | return x; | |
197 | } | |
18ca7dab RK |
198 | \f |
199 | /* If X is a sum, return a new sum like X but lacking any constant terms. | |
200 | Add all the removed constant terms into *CONSTPTR. | |
201 | X itself is not altered. The result != X if and only if | |
202 | it is not isomorphic to X. */ | |
203 | ||
204 | rtx | |
502b8322 | 205 | eliminate_constant_term (rtx x, rtx *constptr) |
18ca7dab | 206 | { |
b3694847 | 207 | rtx x0, x1; |
18ca7dab RK |
208 | rtx tem; |
209 | ||
210 | if (GET_CODE (x) != PLUS) | |
211 | return x; | |
212 | ||
213 | /* First handle constants appearing at this level explicitly. */ | |
481683e1 | 214 | if (CONST_INT_P (XEXP (x, 1)) |
18ca7dab RK |
215 | && 0 != (tem = simplify_binary_operation (PLUS, GET_MODE (x), *constptr, |
216 | XEXP (x, 1))) | |
481683e1 | 217 | && CONST_INT_P (tem)) |
18ca7dab RK |
218 | { |
219 | *constptr = tem; | |
220 | return eliminate_constant_term (XEXP (x, 0), constptr); | |
221 | } | |
222 | ||
223 | tem = const0_rtx; | |
224 | x0 = eliminate_constant_term (XEXP (x, 0), &tem); | |
225 | x1 = eliminate_constant_term (XEXP (x, 1), &tem); | |
226 | if ((x1 != XEXP (x, 1) || x0 != XEXP (x, 0)) | |
227 | && 0 != (tem = simplify_binary_operation (PLUS, GET_MODE (x), | |
228 | *constptr, tem)) | |
481683e1 | 229 | && CONST_INT_P (tem)) |
18ca7dab RK |
230 | { |
231 | *constptr = tem; | |
38a448ca | 232 | return gen_rtx_PLUS (GET_MODE (x), x0, x1); |
18ca7dab RK |
233 | } |
234 | ||
235 | return x; | |
236 | } | |
237 | ||
18ca7dab RK |
238 | /* Return an rtx for the size in bytes of the value of EXP. */ |
239 | ||
240 | rtx | |
502b8322 | 241 | expr_size (tree exp) |
18ca7dab | 242 | { |
d25cee4d RH |
243 | tree size; |
244 | ||
245 | if (TREE_CODE (exp) == WITH_SIZE_EXPR) | |
246 | size = TREE_OPERAND (exp, 1); | |
247 | else | |
26979bc2 | 248 | { |
71c00b5c | 249 | size = tree_expr_size (exp); |
26979bc2 | 250 | gcc_assert (size); |
2ec5deb5 | 251 | gcc_assert (size == SUBSTITUTE_PLACEHOLDER_IN_EXPR (size, exp)); |
26979bc2 | 252 | } |
99098c66 | 253 | |
49452c07 | 254 | return expand_expr (size, NULL_RTX, TYPE_MODE (sizetype), EXPAND_NORMAL); |
18ca7dab | 255 | } |
de8920be JM |
256 | |
257 | /* Return a wide integer for the size in bytes of the value of EXP, or -1 | |
258 | if the size can vary or is larger than an integer. */ | |
259 | ||
260 | HOST_WIDE_INT | |
502b8322 | 261 | int_expr_size (tree exp) |
de8920be | 262 | { |
d25cee4d RH |
263 | tree size; |
264 | ||
265 | if (TREE_CODE (exp) == WITH_SIZE_EXPR) | |
266 | size = TREE_OPERAND (exp, 1); | |
267 | else | |
26979bc2 | 268 | { |
71c00b5c | 269 | size = tree_expr_size (exp); |
26979bc2 JH |
270 | gcc_assert (size); |
271 | } | |
d25cee4d RH |
272 | |
273 | if (size == 0 || !host_integerp (size, 0)) | |
de8920be JM |
274 | return -1; |
275 | ||
d25cee4d | 276 | return tree_low_cst (size, 0); |
de8920be | 277 | } |
18ca7dab RK |
278 | \f |
279 | /* Return a copy of X in which all memory references | |
280 | and all constants that involve symbol refs | |
281 | have been replaced with new temporary registers. | |
282 | Also emit code to load the memory locations and constants | |
283 | into those registers. | |
284 | ||
285 | If X contains no such constants or memory references, | |
286 | X itself (not a copy) is returned. | |
287 | ||
288 | If a constant is found in the address that is not a legitimate constant | |
289 | in an insn, it is left alone in the hope that it might be valid in the | |
290 | address. | |
291 | ||
292 | X may contain no arithmetic except addition, subtraction and multiplication. | |
293 | Values returned by expand_expr with 1 for sum_ok fit this constraint. */ | |
294 | ||
295 | static rtx | |
502b8322 | 296 | break_out_memory_refs (rtx x) |
18ca7dab | 297 | { |
3c0cb5de | 298 | if (MEM_P (x) |
cabeca29 | 299 | || (CONSTANT_P (x) && CONSTANT_ADDRESS_P (x) |
18ca7dab | 300 | && GET_MODE (x) != VOIDmode)) |
2cca6e3f | 301 | x = force_reg (GET_MODE (x), x); |
18ca7dab RK |
302 | else if (GET_CODE (x) == PLUS || GET_CODE (x) == MINUS |
303 | || GET_CODE (x) == MULT) | |
304 | { | |
b3694847 SS |
305 | rtx op0 = break_out_memory_refs (XEXP (x, 0)); |
306 | rtx op1 = break_out_memory_refs (XEXP (x, 1)); | |
2cca6e3f | 307 | |
18ca7dab | 308 | if (op0 != XEXP (x, 0) || op1 != XEXP (x, 1)) |
3a3a1fe1 | 309 | x = simplify_gen_binary (GET_CODE (x), Pmode, op0, op1); |
18ca7dab | 310 | } |
2cca6e3f | 311 | |
18ca7dab RK |
312 | return x; |
313 | } | |
314 | ||
ea534b63 | 315 | /* Given X, a memory address in ptr_mode, convert it to an address |
498b529f RK |
316 | in Pmode, or vice versa (TO_MODE says which way). We take advantage of |
317 | the fact that pointers are not allowed to overflow by commuting arithmetic | |
318 | operations over conversions so that address arithmetic insns can be | |
319 | used. */ | |
ea534b63 | 320 | |
498b529f | 321 | rtx |
5ae6cd0d MM |
322 | convert_memory_address (enum machine_mode to_mode ATTRIBUTE_UNUSED, |
323 | rtx x) | |
ea534b63 | 324 | { |
5ae6cd0d | 325 | #ifndef POINTERS_EXTEND_UNSIGNED |
7c137931 | 326 | gcc_assert (GET_MODE (x) == to_mode || GET_MODE (x) == VOIDmode); |
5ae6cd0d MM |
327 | return x; |
328 | #else /* defined(POINTERS_EXTEND_UNSIGNED) */ | |
329 | enum machine_mode from_mode; | |
498b529f | 330 | rtx temp; |
aa0f70e6 | 331 | enum rtx_code code; |
498b529f | 332 | |
5ae6cd0d MM |
333 | /* If X already has the right mode, just return it. */ |
334 | if (GET_MODE (x) == to_mode) | |
335 | return x; | |
336 | ||
337 | from_mode = to_mode == ptr_mode ? Pmode : ptr_mode; | |
338 | ||
0b04ec8c RK |
339 | /* Here we handle some special cases. If none of them apply, fall through |
340 | to the default case. */ | |
ea534b63 RK |
341 | switch (GET_CODE (x)) |
342 | { | |
343 | case CONST_INT: | |
344 | case CONST_DOUBLE: | |
aa0f70e6 SE |
345 | if (GET_MODE_SIZE (to_mode) < GET_MODE_SIZE (from_mode)) |
346 | code = TRUNCATE; | |
347 | else if (POINTERS_EXTEND_UNSIGNED < 0) | |
348 | break; | |
349 | else if (POINTERS_EXTEND_UNSIGNED > 0) | |
350 | code = ZERO_EXTEND; | |
351 | else | |
352 | code = SIGN_EXTEND; | |
353 | temp = simplify_unary_operation (code, to_mode, x, from_mode); | |
354 | if (temp) | |
355 | return temp; | |
356 | break; | |
498b529f | 357 | |
d1405722 | 358 | case SUBREG: |
5da4f548 | 359 | if ((SUBREG_PROMOTED_VAR_P (x) || REG_POINTER (SUBREG_REG (x))) |
6dd12198 | 360 | && GET_MODE (SUBREG_REG (x)) == to_mode) |
d1405722 RK |
361 | return SUBREG_REG (x); |
362 | break; | |
363 | ||
ea534b63 | 364 | case LABEL_REF: |
5da4f548 SE |
365 | temp = gen_rtx_LABEL_REF (to_mode, XEXP (x, 0)); |
366 | LABEL_REF_NONLOCAL_P (temp) = LABEL_REF_NONLOCAL_P (x); | |
367 | return temp; | |
6dd12198 | 368 | break; |
498b529f | 369 | |
ea534b63 | 370 | case SYMBOL_REF: |
ce02ba25 EC |
371 | temp = shallow_copy_rtx (x); |
372 | PUT_MODE (temp, to_mode); | |
5da4f548 | 373 | return temp; |
6dd12198 | 374 | break; |
ea534b63 | 375 | |
498b529f | 376 | case CONST: |
5da4f548 SE |
377 | return gen_rtx_CONST (to_mode, |
378 | convert_memory_address (to_mode, XEXP (x, 0))); | |
6dd12198 | 379 | break; |
ea534b63 | 380 | |
0b04ec8c RK |
381 | case PLUS: |
382 | case MULT: | |
aa0f70e6 SE |
383 | /* For addition we can safely permute the conversion and addition |
384 | operation if one operand is a constant and converting the constant | |
17939c98 SE |
385 | does not change it or if one operand is a constant and we are |
386 | using a ptr_extend instruction (POINTERS_EXTEND_UNSIGNED < 0). | |
387 | We can always safely permute them if we are making the address | |
388 | narrower. */ | |
aa0f70e6 SE |
389 | if (GET_MODE_SIZE (to_mode) < GET_MODE_SIZE (from_mode) |
390 | || (GET_CODE (x) == PLUS | |
481683e1 | 391 | && CONST_INT_P (XEXP (x, 1)) |
17939c98 SE |
392 | && (XEXP (x, 1) == convert_memory_address (to_mode, XEXP (x, 1)) |
393 | || POINTERS_EXTEND_UNSIGNED < 0))) | |
d9b3eb63 | 394 | return gen_rtx_fmt_ee (GET_CODE (x), to_mode, |
38a448ca | 395 | convert_memory_address (to_mode, XEXP (x, 0)), |
aa0f70e6 | 396 | XEXP (x, 1)); |
38a448ca | 397 | break; |
d9b3eb63 | 398 | |
38a448ca RH |
399 | default: |
400 | break; | |
ea534b63 | 401 | } |
0b04ec8c RK |
402 | |
403 | return convert_modes (to_mode, from_mode, | |
404 | x, POINTERS_EXTEND_UNSIGNED); | |
5ae6cd0d | 405 | #endif /* defined(POINTERS_EXTEND_UNSIGNED) */ |
ea534b63 | 406 | } |
18ca7dab | 407 | \f |
09e881c9 BE |
408 | /* Return something equivalent to X but valid as a memory address for something |
409 | of mode MODE in the named address space AS. When X is not itself valid, | |
410 | this works by copying X or subexpressions of it into registers. */ | |
18ca7dab RK |
411 | |
412 | rtx | |
09e881c9 | 413 | memory_address_addr_space (enum machine_mode mode, rtx x, addr_space_t as) |
18ca7dab | 414 | { |
b3694847 | 415 | rtx oldx = x; |
18ca7dab | 416 | |
5ae6cd0d | 417 | x = convert_memory_address (Pmode, x); |
ea534b63 | 418 | |
ba228239 | 419 | /* By passing constant addresses through registers |
18ca7dab | 420 | we get a chance to cse them. */ |
cabeca29 | 421 | if (! cse_not_expected && CONSTANT_P (x) && CONSTANT_ADDRESS_P (x)) |
18b9ca6f | 422 | x = force_reg (Pmode, x); |
18ca7dab | 423 | |
18ca7dab RK |
424 | /* We get better cse by rejecting indirect addressing at this stage. |
425 | Let the combiner create indirect addresses where appropriate. | |
426 | For now, generate the code so that the subexpressions useful to share | |
427 | are visible. But not if cse won't be done! */ | |
18b9ca6f | 428 | else |
18ca7dab | 429 | { |
f8cfc6aa | 430 | if (! cse_not_expected && !REG_P (x)) |
18b9ca6f RK |
431 | x = break_out_memory_refs (x); |
432 | ||
433 | /* At this point, any valid address is accepted. */ | |
09e881c9 | 434 | if (memory_address_addr_space_p (mode, x, as)) |
3de5e93a | 435 | goto done; |
18b9ca6f RK |
436 | |
437 | /* If it was valid before but breaking out memory refs invalidated it, | |
438 | use it the old way. */ | |
09e881c9 | 439 | if (memory_address_addr_space_p (mode, oldx, as)) |
3de5e93a SB |
440 | { |
441 | x = oldx; | |
442 | goto done; | |
443 | } | |
18b9ca6f RK |
444 | |
445 | /* Perform machine-dependent transformations on X | |
446 | in certain cases. This is not necessary since the code | |
447 | below can handle all possible cases, but machine-dependent | |
448 | transformations can make better code. */ | |
506d7b68 | 449 | { |
09e881c9 BE |
450 | rtx orig_x = x; |
451 | x = targetm.addr_space.legitimize_address (x, oldx, mode, as); | |
452 | if (orig_x != x && memory_address_addr_space_p (mode, x, as)) | |
506d7b68 PB |
453 | goto done; |
454 | } | |
18b9ca6f RK |
455 | |
456 | /* PLUS and MULT can appear in special ways | |
457 | as the result of attempts to make an address usable for indexing. | |
458 | Usually they are dealt with by calling force_operand, below. | |
459 | But a sum containing constant terms is special | |
460 | if removing them makes the sum a valid address: | |
461 | then we generate that address in a register | |
462 | and index off of it. We do this because it often makes | |
463 | shorter code, and because the addresses thus generated | |
464 | in registers often become common subexpressions. */ | |
465 | if (GET_CODE (x) == PLUS) | |
466 | { | |
467 | rtx constant_term = const0_rtx; | |
468 | rtx y = eliminate_constant_term (x, &constant_term); | |
469 | if (constant_term == const0_rtx | |
09e881c9 | 470 | || ! memory_address_addr_space_p (mode, y, as)) |
18b9ca6f RK |
471 | x = force_operand (x, NULL_RTX); |
472 | else | |
473 | { | |
38a448ca | 474 | y = gen_rtx_PLUS (GET_MODE (x), copy_to_reg (y), constant_term); |
09e881c9 | 475 | if (! memory_address_addr_space_p (mode, y, as)) |
18b9ca6f RK |
476 | x = force_operand (x, NULL_RTX); |
477 | else | |
478 | x = y; | |
479 | } | |
480 | } | |
18ca7dab | 481 | |
e475ed2a | 482 | else if (GET_CODE (x) == MULT || GET_CODE (x) == MINUS) |
18b9ca6f | 483 | x = force_operand (x, NULL_RTX); |
18ca7dab | 484 | |
18b9ca6f RK |
485 | /* If we have a register that's an invalid address, |
486 | it must be a hard reg of the wrong class. Copy it to a pseudo. */ | |
f8cfc6aa | 487 | else if (REG_P (x)) |
18b9ca6f RK |
488 | x = copy_to_reg (x); |
489 | ||
490 | /* Last resort: copy the value to a register, since | |
491 | the register is a valid address. */ | |
492 | else | |
493 | x = force_reg (Pmode, x); | |
18ca7dab | 494 | } |
18b9ca6f RK |
495 | |
496 | done: | |
497 | ||
09e881c9 | 498 | gcc_assert (memory_address_addr_space_p (mode, x, as)); |
2cca6e3f RK |
499 | /* If we didn't change the address, we are done. Otherwise, mark |
500 | a reg as a pointer if we have REG or REG + CONST_INT. */ | |
501 | if (oldx == x) | |
502 | return x; | |
f8cfc6aa | 503 | else if (REG_P (x)) |
bdb429a5 | 504 | mark_reg_pointer (x, BITS_PER_UNIT); |
2cca6e3f | 505 | else if (GET_CODE (x) == PLUS |
f8cfc6aa | 506 | && REG_P (XEXP (x, 0)) |
481683e1 | 507 | && CONST_INT_P (XEXP (x, 1))) |
bdb429a5 | 508 | mark_reg_pointer (XEXP (x, 0), BITS_PER_UNIT); |
2cca6e3f | 509 | |
18b9ca6f RK |
510 | /* OLDX may have been the address on a temporary. Update the address |
511 | to indicate that X is now used. */ | |
512 | update_temp_slot_address (oldx, x); | |
513 | ||
18ca7dab RK |
514 | return x; |
515 | } | |
516 | ||
18ca7dab RK |
517 | /* Convert a mem ref into one with a valid memory address. |
518 | Pass through anything else unchanged. */ | |
519 | ||
520 | rtx | |
502b8322 | 521 | validize_mem (rtx ref) |
18ca7dab | 522 | { |
3c0cb5de | 523 | if (!MEM_P (ref)) |
18ca7dab | 524 | return ref; |
aacd3885 | 525 | ref = use_anchored_address (ref); |
09e881c9 BE |
526 | if (memory_address_addr_space_p (GET_MODE (ref), XEXP (ref, 0), |
527 | MEM_ADDR_SPACE (ref))) | |
18ca7dab | 528 | return ref; |
792760b9 | 529 | |
18ca7dab | 530 | /* Don't alter REF itself, since that is probably a stack slot. */ |
792760b9 | 531 | return replace_equiv_address (ref, XEXP (ref, 0)); |
18ca7dab | 532 | } |
aacd3885 RS |
533 | |
534 | /* If X is a memory reference to a member of an object block, try rewriting | |
535 | it to use an anchor instead. Return the new memory reference on success | |
536 | and the old one on failure. */ | |
537 | ||
538 | rtx | |
539 | use_anchored_address (rtx x) | |
540 | { | |
541 | rtx base; | |
542 | HOST_WIDE_INT offset; | |
543 | ||
544 | if (!flag_section_anchors) | |
545 | return x; | |
546 | ||
547 | if (!MEM_P (x)) | |
548 | return x; | |
549 | ||
550 | /* Split the address into a base and offset. */ | |
551 | base = XEXP (x, 0); | |
552 | offset = 0; | |
553 | if (GET_CODE (base) == CONST | |
554 | && GET_CODE (XEXP (base, 0)) == PLUS | |
481683e1 | 555 | && CONST_INT_P (XEXP (XEXP (base, 0), 1))) |
aacd3885 RS |
556 | { |
557 | offset += INTVAL (XEXP (XEXP (base, 0), 1)); | |
558 | base = XEXP (XEXP (base, 0), 0); | |
559 | } | |
560 | ||
561 | /* Check whether BASE is suitable for anchors. */ | |
562 | if (GET_CODE (base) != SYMBOL_REF | |
3fa9c136 | 563 | || !SYMBOL_REF_HAS_BLOCK_INFO_P (base) |
aacd3885 | 564 | || SYMBOL_REF_ANCHOR_P (base) |
434aeebb | 565 | || SYMBOL_REF_BLOCK (base) == NULL |
aacd3885 RS |
566 | || !targetm.use_anchors_for_symbol_p (base)) |
567 | return x; | |
568 | ||
569 | /* Decide where BASE is going to be. */ | |
570 | place_block_symbol (base); | |
571 | ||
572 | /* Get the anchor we need to use. */ | |
573 | offset += SYMBOL_REF_BLOCK_OFFSET (base); | |
574 | base = get_section_anchor (SYMBOL_REF_BLOCK (base), offset, | |
575 | SYMBOL_REF_TLS_MODEL (base)); | |
576 | ||
577 | /* Work out the offset from the anchor. */ | |
578 | offset -= SYMBOL_REF_BLOCK_OFFSET (base); | |
579 | ||
580 | /* If we're going to run a CSE pass, force the anchor into a register. | |
581 | We will then be able to reuse registers for several accesses, if the | |
582 | target costs say that that's worthwhile. */ | |
583 | if (!cse_not_expected) | |
584 | base = force_reg (GET_MODE (base), base); | |
585 | ||
586 | return replace_equiv_address (x, plus_constant (base, offset)); | |
587 | } | |
18ca7dab | 588 | \f |
18ca7dab RK |
589 | /* Copy the value or contents of X to a new temp reg and return that reg. */ |
590 | ||
591 | rtx | |
502b8322 | 592 | copy_to_reg (rtx x) |
18ca7dab | 593 | { |
b3694847 | 594 | rtx temp = gen_reg_rtx (GET_MODE (x)); |
d9b3eb63 | 595 | |
18ca7dab | 596 | /* If not an operand, must be an address with PLUS and MULT so |
d9b3eb63 | 597 | do the computation. */ |
18ca7dab RK |
598 | if (! general_operand (x, VOIDmode)) |
599 | x = force_operand (x, temp); | |
d9b3eb63 | 600 | |
18ca7dab RK |
601 | if (x != temp) |
602 | emit_move_insn (temp, x); | |
603 | ||
604 | return temp; | |
605 | } | |
606 | ||
607 | /* Like copy_to_reg but always give the new register mode Pmode | |
608 | in case X is a constant. */ | |
609 | ||
610 | rtx | |
502b8322 | 611 | copy_addr_to_reg (rtx x) |
18ca7dab RK |
612 | { |
613 | return copy_to_mode_reg (Pmode, x); | |
614 | } | |
615 | ||
616 | /* Like copy_to_reg but always give the new register mode MODE | |
617 | in case X is a constant. */ | |
618 | ||
619 | rtx | |
502b8322 | 620 | copy_to_mode_reg (enum machine_mode mode, rtx x) |
18ca7dab | 621 | { |
b3694847 | 622 | rtx temp = gen_reg_rtx (mode); |
d9b3eb63 | 623 | |
18ca7dab | 624 | /* If not an operand, must be an address with PLUS and MULT so |
d9b3eb63 | 625 | do the computation. */ |
18ca7dab RK |
626 | if (! general_operand (x, VOIDmode)) |
627 | x = force_operand (x, temp); | |
628 | ||
5b0264cb | 629 | gcc_assert (GET_MODE (x) == mode || GET_MODE (x) == VOIDmode); |
18ca7dab RK |
630 | if (x != temp) |
631 | emit_move_insn (temp, x); | |
632 | return temp; | |
633 | } | |
634 | ||
635 | /* Load X into a register if it is not already one. | |
636 | Use mode MODE for the register. | |
637 | X should be valid for mode MODE, but it may be a constant which | |
638 | is valid for all integer modes; that's why caller must specify MODE. | |
639 | ||
640 | The caller must not alter the value in the register we return, | |
641 | since we mark it as a "constant" register. */ | |
642 | ||
643 | rtx | |
502b8322 | 644 | force_reg (enum machine_mode mode, rtx x) |
18ca7dab | 645 | { |
b3694847 | 646 | rtx temp, insn, set; |
18ca7dab | 647 | |
f8cfc6aa | 648 | if (REG_P (x)) |
18ca7dab | 649 | return x; |
d9b3eb63 | 650 | |
e3c8ea67 RH |
651 | if (general_operand (x, mode)) |
652 | { | |
653 | temp = gen_reg_rtx (mode); | |
654 | insn = emit_move_insn (temp, x); | |
655 | } | |
656 | else | |
657 | { | |
658 | temp = force_operand (x, NULL_RTX); | |
f8cfc6aa | 659 | if (REG_P (temp)) |
e3c8ea67 RH |
660 | insn = get_last_insn (); |
661 | else | |
662 | { | |
663 | rtx temp2 = gen_reg_rtx (mode); | |
664 | insn = emit_move_insn (temp2, temp); | |
665 | temp = temp2; | |
666 | } | |
667 | } | |
62874575 | 668 | |
18ca7dab | 669 | /* Let optimizers know that TEMP's value never changes |
62874575 RK |
670 | and that X can be substituted for it. Don't get confused |
671 | if INSN set something else (such as a SUBREG of TEMP). */ | |
672 | if (CONSTANT_P (x) | |
673 | && (set = single_set (insn)) != 0 | |
fd7acc30 RS |
674 | && SET_DEST (set) == temp |
675 | && ! rtx_equal_p (x, SET_SRC (set))) | |
3d238248 | 676 | set_unique_reg_note (insn, REG_EQUAL, x); |
e3c8ea67 | 677 | |
4a4f95d9 RH |
678 | /* Let optimizers know that TEMP is a pointer, and if so, the |
679 | known alignment of that pointer. */ | |
680 | { | |
681 | unsigned align = 0; | |
682 | if (GET_CODE (x) == SYMBOL_REF) | |
683 | { | |
684 | align = BITS_PER_UNIT; | |
685 | if (SYMBOL_REF_DECL (x) && DECL_P (SYMBOL_REF_DECL (x))) | |
686 | align = DECL_ALIGN (SYMBOL_REF_DECL (x)); | |
687 | } | |
688 | else if (GET_CODE (x) == LABEL_REF) | |
689 | align = BITS_PER_UNIT; | |
690 | else if (GET_CODE (x) == CONST | |
691 | && GET_CODE (XEXP (x, 0)) == PLUS | |
692 | && GET_CODE (XEXP (XEXP (x, 0), 0)) == SYMBOL_REF | |
481683e1 | 693 | && CONST_INT_P (XEXP (XEXP (x, 0), 1))) |
4a4f95d9 RH |
694 | { |
695 | rtx s = XEXP (XEXP (x, 0), 0); | |
696 | rtx c = XEXP (XEXP (x, 0), 1); | |
697 | unsigned sa, ca; | |
698 | ||
699 | sa = BITS_PER_UNIT; | |
700 | if (SYMBOL_REF_DECL (s) && DECL_P (SYMBOL_REF_DECL (s))) | |
701 | sa = DECL_ALIGN (SYMBOL_REF_DECL (s)); | |
702 | ||
703 | ca = exact_log2 (INTVAL (c) & -INTVAL (c)) * BITS_PER_UNIT; | |
704 | ||
705 | align = MIN (sa, ca); | |
706 | } | |
707 | ||
0a317111 | 708 | if (align || (MEM_P (x) && MEM_POINTER (x))) |
4a4f95d9 RH |
709 | mark_reg_pointer (temp, align); |
710 | } | |
711 | ||
18ca7dab RK |
712 | return temp; |
713 | } | |
714 | ||
715 | /* If X is a memory ref, copy its contents to a new temp reg and return | |
716 | that reg. Otherwise, return X. */ | |
717 | ||
718 | rtx | |
502b8322 | 719 | force_not_mem (rtx x) |
18ca7dab | 720 | { |
b3694847 | 721 | rtx temp; |
fe3439b0 | 722 | |
3c0cb5de | 723 | if (!MEM_P (x) || GET_MODE (x) == BLKmode) |
18ca7dab | 724 | return x; |
fe3439b0 | 725 | |
18ca7dab | 726 | temp = gen_reg_rtx (GET_MODE (x)); |
f8ad8d7c ZD |
727 | |
728 | if (MEM_POINTER (x)) | |
729 | REG_POINTER (temp) = 1; | |
730 | ||
18ca7dab RK |
731 | emit_move_insn (temp, x); |
732 | return temp; | |
733 | } | |
734 | ||
735 | /* Copy X to TARGET (if it's nonzero and a reg) | |
736 | or to a new temp reg and return that reg. | |
737 | MODE is the mode to use for X in case it is a constant. */ | |
738 | ||
739 | rtx | |
502b8322 | 740 | copy_to_suggested_reg (rtx x, rtx target, enum machine_mode mode) |
18ca7dab | 741 | { |
b3694847 | 742 | rtx temp; |
18ca7dab | 743 | |
f8cfc6aa | 744 | if (target && REG_P (target)) |
18ca7dab RK |
745 | temp = target; |
746 | else | |
747 | temp = gen_reg_rtx (mode); | |
748 | ||
749 | emit_move_insn (temp, x); | |
750 | return temp; | |
751 | } | |
752 | \f | |
cde0f3fd | 753 | /* Return the mode to use to pass or return a scalar of TYPE and MODE. |
9ff65789 RK |
754 | PUNSIGNEDP points to the signedness of the type and may be adjusted |
755 | to show what signedness to use on extension operations. | |
756 | ||
cde0f3fd PB |
757 | FOR_RETURN is nonzero if the caller is promoting the return value |
758 | of FNDECL, else it is for promoting args. */ | |
9ff65789 | 759 | |
cde0f3fd PB |
760 | enum machine_mode |
761 | promote_function_mode (const_tree type, enum machine_mode mode, int *punsignedp, | |
762 | const_tree funtype, int for_return) | |
763 | { | |
cde0f3fd PB |
764 | switch (TREE_CODE (type)) |
765 | { | |
766 | case INTEGER_TYPE: case ENUMERAL_TYPE: case BOOLEAN_TYPE: | |
767 | case REAL_TYPE: case OFFSET_TYPE: case FIXED_POINT_TYPE: | |
768 | case POINTER_TYPE: case REFERENCE_TYPE: | |
769 | return targetm.calls.promote_function_mode (type, mode, punsignedp, funtype, | |
770 | for_return); | |
771 | ||
772 | default: | |
773 | return mode; | |
774 | } | |
775 | } | |
776 | /* Return the mode to use to store a scalar of TYPE and MODE. | |
777 | PUNSIGNEDP points to the signedness of the type and may be adjusted | |
778 | to show what signedness to use on extension operations. */ | |
d4453b7a | 779 | |
9ff65789 | 780 | enum machine_mode |
b1680483 AK |
781 | promote_mode (const_tree type ATTRIBUTE_UNUSED, enum machine_mode mode, |
782 | int *punsignedp ATTRIBUTE_UNUSED) | |
9ff65789 | 783 | { |
cde0f3fd PB |
784 | /* FIXME: this is the same logic that was there until GCC 4.4, but we |
785 | probably want to test POINTERS_EXTEND_UNSIGNED even if PROMOTE_MODE | |
786 | is not defined. The affected targets are M32C, S390, SPARC. */ | |
787 | #ifdef PROMOTE_MODE | |
586de218 | 788 | const enum tree_code code = TREE_CODE (type); |
9ff65789 RK |
789 | int unsignedp = *punsignedp; |
790 | ||
9ff65789 RK |
791 | switch (code) |
792 | { | |
9ff65789 | 793 | case INTEGER_TYPE: case ENUMERAL_TYPE: case BOOLEAN_TYPE: |
325217ed | 794 | case REAL_TYPE: case OFFSET_TYPE: case FIXED_POINT_TYPE: |
cde0f3fd PB |
795 | PROMOTE_MODE (mode, unsignedp, type); |
796 | *punsignedp = unsignedp; | |
797 | return mode; | |
9ff65789 | 798 | break; |
9ff65789 | 799 | |
ea534b63 | 800 | #ifdef POINTERS_EXTEND_UNSIGNED |
56a4c9e2 | 801 | case REFERENCE_TYPE: |
9ff65789 | 802 | case POINTER_TYPE: |
cde0f3fd PB |
803 | *punsignedp = POINTERS_EXTEND_UNSIGNED; |
804 | return Pmode; | |
9ff65789 | 805 | break; |
ea534b63 | 806 | #endif |
d9b3eb63 | 807 | |
38a448ca | 808 | default: |
cde0f3fd | 809 | return mode; |
9ff65789 | 810 | } |
cde0f3fd | 811 | #else |
9ff65789 | 812 | return mode; |
cde0f3fd | 813 | #endif |
9ff65789 | 814 | } |
cde0f3fd PB |
815 | |
816 | ||
817 | /* Use one of promote_mode or promote_function_mode to find the promoted | |
818 | mode of DECL. If PUNSIGNEDP is not NULL, store there the unsignedness | |
819 | of DECL after promotion. */ | |
820 | ||
821 | enum machine_mode | |
822 | promote_decl_mode (const_tree decl, int *punsignedp) | |
823 | { | |
824 | tree type = TREE_TYPE (decl); | |
825 | int unsignedp = TYPE_UNSIGNED (type); | |
826 | enum machine_mode mode = DECL_MODE (decl); | |
827 | enum machine_mode pmode; | |
828 | ||
666e3ceb PB |
829 | if (TREE_CODE (decl) == RESULT_DECL |
830 | || TREE_CODE (decl) == PARM_DECL) | |
cde0f3fd | 831 | pmode = promote_function_mode (type, mode, &unsignedp, |
666e3ceb | 832 | TREE_TYPE (current_function_decl), 2); |
cde0f3fd PB |
833 | else |
834 | pmode = promote_mode (type, mode, &unsignedp); | |
835 | ||
836 | if (punsignedp) | |
837 | *punsignedp = unsignedp; | |
838 | return pmode; | |
839 | } | |
840 | ||
9ff65789 | 841 | \f |
18ca7dab RK |
842 | /* Adjust the stack pointer by ADJUST (an rtx for a number of bytes). |
843 | This pops when ADJUST is positive. ADJUST need not be constant. */ | |
844 | ||
845 | void | |
502b8322 | 846 | adjust_stack (rtx adjust) |
18ca7dab RK |
847 | { |
848 | rtx temp; | |
18ca7dab RK |
849 | |
850 | if (adjust == const0_rtx) | |
851 | return; | |
852 | ||
1503a7ec JH |
853 | /* We expect all variable sized adjustments to be multiple of |
854 | PREFERRED_STACK_BOUNDARY. */ | |
481683e1 | 855 | if (CONST_INT_P (adjust)) |
1503a7ec JH |
856 | stack_pointer_delta -= INTVAL (adjust); |
857 | ||
18ca7dab RK |
858 | temp = expand_binop (Pmode, |
859 | #ifdef STACK_GROWS_DOWNWARD | |
860 | add_optab, | |
861 | #else | |
862 | sub_optab, | |
863 | #endif | |
864 | stack_pointer_rtx, adjust, stack_pointer_rtx, 0, | |
865 | OPTAB_LIB_WIDEN); | |
866 | ||
867 | if (temp != stack_pointer_rtx) | |
868 | emit_move_insn (stack_pointer_rtx, temp); | |
869 | } | |
870 | ||
871 | /* Adjust the stack pointer by minus ADJUST (an rtx for a number of bytes). | |
872 | This pushes when ADJUST is positive. ADJUST need not be constant. */ | |
873 | ||
874 | void | |
502b8322 | 875 | anti_adjust_stack (rtx adjust) |
18ca7dab RK |
876 | { |
877 | rtx temp; | |
18ca7dab RK |
878 | |
879 | if (adjust == const0_rtx) | |
880 | return; | |
881 | ||
1503a7ec JH |
882 | /* We expect all variable sized adjustments to be multiple of |
883 | PREFERRED_STACK_BOUNDARY. */ | |
481683e1 | 884 | if (CONST_INT_P (adjust)) |
1503a7ec JH |
885 | stack_pointer_delta += INTVAL (adjust); |
886 | ||
18ca7dab RK |
887 | temp = expand_binop (Pmode, |
888 | #ifdef STACK_GROWS_DOWNWARD | |
889 | sub_optab, | |
890 | #else | |
891 | add_optab, | |
892 | #endif | |
893 | stack_pointer_rtx, adjust, stack_pointer_rtx, 0, | |
894 | OPTAB_LIB_WIDEN); | |
895 | ||
896 | if (temp != stack_pointer_rtx) | |
897 | emit_move_insn (stack_pointer_rtx, temp); | |
898 | } | |
899 | ||
900 | /* Round the size of a block to be pushed up to the boundary required | |
901 | by this machine. SIZE is the desired size, which need not be constant. */ | |
902 | ||
4dd9b044 | 903 | static rtx |
502b8322 | 904 | round_push (rtx size) |
18ca7dab | 905 | { |
c795bca9 | 906 | int align = PREFERRED_STACK_BOUNDARY / BITS_PER_UNIT; |
41ee3204 | 907 | |
18ca7dab RK |
908 | if (align == 1) |
909 | return size; | |
41ee3204 | 910 | |
481683e1 | 911 | if (CONST_INT_P (size)) |
18ca7dab | 912 | { |
60564289 | 913 | HOST_WIDE_INT new_size = (INTVAL (size) + align - 1) / align * align; |
41ee3204 | 914 | |
60564289 KG |
915 | if (INTVAL (size) != new_size) |
916 | size = GEN_INT (new_size); | |
18ca7dab RK |
917 | } |
918 | else | |
919 | { | |
5244db05 | 920 | /* CEIL_DIV_EXPR needs to worry about the addition overflowing, |
0f41302f MS |
921 | but we know it can't. So add ourselves and then do |
922 | TRUNC_DIV_EXPR. */ | |
5244db05 RK |
923 | size = expand_binop (Pmode, add_optab, size, GEN_INT (align - 1), |
924 | NULL_RTX, 1, OPTAB_LIB_WIDEN); | |
925 | size = expand_divmod (0, TRUNC_DIV_EXPR, Pmode, size, GEN_INT (align), | |
b1ec3c92 CH |
926 | NULL_RTX, 1); |
927 | size = expand_mult (Pmode, size, GEN_INT (align), NULL_RTX, 1); | |
18ca7dab | 928 | } |
41ee3204 | 929 | |
18ca7dab RK |
930 | return size; |
931 | } | |
932 | \f | |
59257ff7 RK |
933 | /* Save the stack pointer for the purpose in SAVE_LEVEL. PSAVE is a pointer |
934 | to a previously-created save area. If no save area has been allocated, | |
935 | this function will allocate one. If a save area is specified, it | |
936 | must be of the proper mode. | |
937 | ||
938 | The insns are emitted after insn AFTER, if nonzero, otherwise the insns | |
939 | are emitted at the current position. */ | |
940 | ||
941 | void | |
502b8322 | 942 | emit_stack_save (enum save_level save_level, rtx *psave, rtx after) |
59257ff7 RK |
943 | { |
944 | rtx sa = *psave; | |
945 | /* The default is that we use a move insn and save in a Pmode object. */ | |
502b8322 | 946 | rtx (*fcn) (rtx, rtx) = gen_move_insn; |
a260abc9 | 947 | enum machine_mode mode = STACK_SAVEAREA_MODE (save_level); |
59257ff7 RK |
948 | |
949 | /* See if this machine has anything special to do for this kind of save. */ | |
950 | switch (save_level) | |
951 | { | |
952 | #ifdef HAVE_save_stack_block | |
953 | case SAVE_BLOCK: | |
954 | if (HAVE_save_stack_block) | |
a260abc9 | 955 | fcn = gen_save_stack_block; |
59257ff7 RK |
956 | break; |
957 | #endif | |
958 | #ifdef HAVE_save_stack_function | |
959 | case SAVE_FUNCTION: | |
960 | if (HAVE_save_stack_function) | |
a260abc9 | 961 | fcn = gen_save_stack_function; |
59257ff7 RK |
962 | break; |
963 | #endif | |
964 | #ifdef HAVE_save_stack_nonlocal | |
965 | case SAVE_NONLOCAL: | |
966 | if (HAVE_save_stack_nonlocal) | |
a260abc9 | 967 | fcn = gen_save_stack_nonlocal; |
59257ff7 RK |
968 | break; |
969 | #endif | |
38a448ca RH |
970 | default: |
971 | break; | |
59257ff7 RK |
972 | } |
973 | ||
974 | /* If there is no save area and we have to allocate one, do so. Otherwise | |
975 | verify the save area is the proper mode. */ | |
976 | ||
977 | if (sa == 0) | |
978 | { | |
979 | if (mode != VOIDmode) | |
980 | { | |
981 | if (save_level == SAVE_NONLOCAL) | |
982 | *psave = sa = assign_stack_local (mode, GET_MODE_SIZE (mode), 0); | |
983 | else | |
984 | *psave = sa = gen_reg_rtx (mode); | |
985 | } | |
986 | } | |
59257ff7 RK |
987 | |
988 | if (after) | |
700f6f98 RK |
989 | { |
990 | rtx seq; | |
991 | ||
992 | start_sequence (); | |
a494ed43 | 993 | do_pending_stack_adjust (); |
5460015d JW |
994 | /* We must validize inside the sequence, to ensure that any instructions |
995 | created by the validize call also get moved to the right place. */ | |
996 | if (sa != 0) | |
997 | sa = validize_mem (sa); | |
d072107f | 998 | emit_insn (fcn (sa, stack_pointer_rtx)); |
2f937369 | 999 | seq = get_insns (); |
700f6f98 RK |
1000 | end_sequence (); |
1001 | emit_insn_after (seq, after); | |
1002 | } | |
59257ff7 | 1003 | else |
5460015d | 1004 | { |
a494ed43 | 1005 | do_pending_stack_adjust (); |
5460015d JW |
1006 | if (sa != 0) |
1007 | sa = validize_mem (sa); | |
1008 | emit_insn (fcn (sa, stack_pointer_rtx)); | |
1009 | } | |
59257ff7 RK |
1010 | } |
1011 | ||
1012 | /* Restore the stack pointer for the purpose in SAVE_LEVEL. SA is the save | |
d9b3eb63 | 1013 | area made by emit_stack_save. If it is zero, we have nothing to do. |
59257ff7 | 1014 | |
d9b3eb63 | 1015 | Put any emitted insns after insn AFTER, if nonzero, otherwise at |
59257ff7 RK |
1016 | current position. */ |
1017 | ||
1018 | void | |
502b8322 | 1019 | emit_stack_restore (enum save_level save_level, rtx sa, rtx after) |
59257ff7 RK |
1020 | { |
1021 | /* The default is that we use a move insn. */ | |
502b8322 | 1022 | rtx (*fcn) (rtx, rtx) = gen_move_insn; |
59257ff7 RK |
1023 | |
1024 | /* See if this machine has anything special to do for this kind of save. */ | |
1025 | switch (save_level) | |
1026 | { | |
1027 | #ifdef HAVE_restore_stack_block | |
1028 | case SAVE_BLOCK: | |
1029 | if (HAVE_restore_stack_block) | |
1030 | fcn = gen_restore_stack_block; | |
1031 | break; | |
1032 | #endif | |
1033 | #ifdef HAVE_restore_stack_function | |
1034 | case SAVE_FUNCTION: | |
1035 | if (HAVE_restore_stack_function) | |
1036 | fcn = gen_restore_stack_function; | |
1037 | break; | |
1038 | #endif | |
1039 | #ifdef HAVE_restore_stack_nonlocal | |
59257ff7 RK |
1040 | case SAVE_NONLOCAL: |
1041 | if (HAVE_restore_stack_nonlocal) | |
1042 | fcn = gen_restore_stack_nonlocal; | |
1043 | break; | |
1044 | #endif | |
38a448ca RH |
1045 | default: |
1046 | break; | |
59257ff7 RK |
1047 | } |
1048 | ||
d072107f | 1049 | if (sa != 0) |
260f91c2 DJ |
1050 | { |
1051 | sa = validize_mem (sa); | |
1052 | /* These clobbers prevent the scheduler from moving | |
1053 | references to variable arrays below the code | |
4b7e68e7 | 1054 | that deletes (pops) the arrays. */ |
c41c1387 RS |
1055 | emit_clobber (gen_rtx_MEM (BLKmode, gen_rtx_SCRATCH (VOIDmode))); |
1056 | emit_clobber (gen_rtx_MEM (BLKmode, stack_pointer_rtx)); | |
260f91c2 | 1057 | } |
d072107f | 1058 | |
a494ed43 EB |
1059 | discard_pending_stack_adjust (); |
1060 | ||
59257ff7 | 1061 | if (after) |
700f6f98 RK |
1062 | { |
1063 | rtx seq; | |
1064 | ||
1065 | start_sequence (); | |
d072107f | 1066 | emit_insn (fcn (stack_pointer_rtx, sa)); |
2f937369 | 1067 | seq = get_insns (); |
700f6f98 RK |
1068 | end_sequence (); |
1069 | emit_insn_after (seq, after); | |
1070 | } | |
59257ff7 | 1071 | else |
d072107f | 1072 | emit_insn (fcn (stack_pointer_rtx, sa)); |
59257ff7 | 1073 | } |
6de9cd9a DN |
1074 | |
1075 | /* Invoke emit_stack_save on the nonlocal_goto_save_area for the current | |
1076 | function. This function should be called whenever we allocate or | |
1077 | deallocate dynamic stack space. */ | |
1078 | ||
1079 | void | |
1080 | update_nonlocal_goto_save_area (void) | |
1081 | { | |
1082 | tree t_save; | |
1083 | rtx r_save; | |
1084 | ||
1085 | /* The nonlocal_goto_save_area object is an array of N pointers. The | |
1086 | first one is used for the frame pointer save; the rest are sized by | |
1087 | STACK_SAVEAREA_MODE. Create a reference to array index 1, the first | |
1088 | of the stack save area slots. */ | |
3244e67d RS |
1089 | t_save = build4 (ARRAY_REF, ptr_type_node, cfun->nonlocal_goto_save_area, |
1090 | integer_one_node, NULL_TREE, NULL_TREE); | |
6de9cd9a DN |
1091 | r_save = expand_expr (t_save, NULL_RTX, VOIDmode, EXPAND_WRITE); |
1092 | ||
1093 | emit_stack_save (SAVE_NONLOCAL, &r_save, NULL_RTX); | |
1094 | } | |
59257ff7 | 1095 | \f |
18ca7dab RK |
1096 | /* Return an rtx representing the address of an area of memory dynamically |
1097 | pushed on the stack. This region of memory is always aligned to | |
1098 | a multiple of BIGGEST_ALIGNMENT. | |
1099 | ||
1100 | Any required stack pointer alignment is preserved. | |
1101 | ||
1102 | SIZE is an rtx representing the size of the area. | |
091ad0b9 RK |
1103 | TARGET is a place in which the address can be placed. |
1104 | ||
1105 | KNOWN_ALIGN is the alignment (in bits) that we know SIZE has. */ | |
18ca7dab RK |
1106 | |
1107 | rtx | |
502b8322 | 1108 | allocate_dynamic_stack_space (rtx size, rtx target, int known_align) |
18ca7dab | 1109 | { |
15fc0026 | 1110 | /* If we're asking for zero bytes, it doesn't matter what we point |
9faa82d8 | 1111 | to since we can't dereference it. But return a reasonable |
15fc0026 RK |
1112 | address anyway. */ |
1113 | if (size == const0_rtx) | |
1114 | return virtual_stack_dynamic_rtx; | |
1115 | ||
1116 | /* Otherwise, show we're calling alloca or equivalent. */ | |
e3b5732b | 1117 | cfun->calls_alloca = 1; |
15fc0026 | 1118 | |
18ca7dab RK |
1119 | /* Ensure the size is in the proper mode. */ |
1120 | if (GET_MODE (size) != VOIDmode && GET_MODE (size) != Pmode) | |
1121 | size = convert_to_mode (Pmode, size, 1); | |
1122 | ||
c2f8b491 JH |
1123 | /* We can't attempt to minimize alignment necessary, because we don't |
1124 | know the final value of preferred_stack_boundary yet while executing | |
1125 | this code. */ | |
cb91fab0 | 1126 | crtl->preferred_stack_boundary = PREFERRED_STACK_BOUNDARY; |
c2f8b491 | 1127 | |
18ca7dab RK |
1128 | /* We will need to ensure that the address we return is aligned to |
1129 | BIGGEST_ALIGNMENT. If STACK_DYNAMIC_OFFSET is defined, we don't | |
d9b3eb63 | 1130 | always know its final value at this point in the compilation (it |
18ca7dab RK |
1131 | might depend on the size of the outgoing parameter lists, for |
1132 | example), so we must align the value to be returned in that case. | |
cc2902df | 1133 | (Note that STACK_DYNAMIC_OFFSET will have a default nonzero value if |
18ca7dab RK |
1134 | STACK_POINTER_OFFSET or ACCUMULATE_OUTGOING_ARGS are defined). |
1135 | We must also do an alignment operation on the returned value if | |
1136 | the stack pointer alignment is less strict that BIGGEST_ALIGNMENT. | |
1137 | ||
1138 | If we have to align, we must leave space in SIZE for the hole | |
1139 | that might result from the alignment operation. */ | |
1140 | ||
31cdd499 | 1141 | #if defined (STACK_DYNAMIC_OFFSET) || defined (STACK_POINTER_OFFSET) |
515a7242 JW |
1142 | #define MUST_ALIGN 1 |
1143 | #else | |
c795bca9 | 1144 | #define MUST_ALIGN (PREFERRED_STACK_BOUNDARY < BIGGEST_ALIGNMENT) |
18ca7dab RK |
1145 | #endif |
1146 | ||
515a7242 | 1147 | if (MUST_ALIGN) |
d5457140 | 1148 | size |
d9b3eb63 | 1149 | = force_operand (plus_constant (size, |
d5457140 RK |
1150 | BIGGEST_ALIGNMENT / BITS_PER_UNIT - 1), |
1151 | NULL_RTX); | |
1d9d04f8 | 1152 | |
18ca7dab RK |
1153 | #ifdef SETJMP_VIA_SAVE_AREA |
1154 | /* If setjmp restores regs from a save area in the stack frame, | |
1155 | avoid clobbering the reg save area. Note that the offset of | |
1156 | virtual_incoming_args_rtx includes the preallocated stack args space. | |
1157 | It would be no problem to clobber that, but it's on the wrong side | |
d0828b31 DM |
1158 | of the old save area. |
1159 | ||
1160 | What used to happen is that, since we did not know for sure | |
1161 | whether setjmp() was invoked until after RTL generation, we | |
1162 | would use reg notes to store the "optimized" size and fix things | |
1163 | up later. These days we know this information before we ever | |
1164 | start building RTL so the reg notes are unnecessary. */ | |
e3b5732b | 1165 | if (!cfun->calls_setjmp) |
d0828b31 DM |
1166 | { |
1167 | int align = PREFERRED_STACK_BOUNDARY / BITS_PER_UNIT; | |
c9ec4f99 | 1168 | |
d0828b31 DM |
1169 | /* ??? Code below assumes that the save area needs maximal |
1170 | alignment. This constraint may be too strong. */ | |
1171 | gcc_assert (PREFERRED_STACK_BOUNDARY == BIGGEST_ALIGNMENT); | |
c9ec4f99 | 1172 | |
481683e1 | 1173 | if (CONST_INT_P (size)) |
d0828b31 | 1174 | { |
60564289 | 1175 | HOST_WIDE_INT new_size = INTVAL (size) / align * align; |
d0828b31 | 1176 | |
60564289 KG |
1177 | if (INTVAL (size) != new_size) |
1178 | size = GEN_INT (new_size); | |
d0828b31 DM |
1179 | } |
1180 | else | |
1181 | { | |
1182 | /* Since we know overflow is not possible, we avoid using | |
1183 | CEIL_DIV_EXPR and use TRUNC_DIV_EXPR instead. */ | |
1184 | size = expand_divmod (0, TRUNC_DIV_EXPR, Pmode, size, | |
1185 | GEN_INT (align), NULL_RTX, 1); | |
1186 | size = expand_mult (Pmode, size, | |
1187 | GEN_INT (align), NULL_RTX, 1); | |
1188 | } | |
1189 | } | |
1190 | else | |
1191 | { | |
1192 | rtx dynamic_offset | |
1193 | = expand_binop (Pmode, sub_optab, virtual_stack_dynamic_rtx, | |
1194 | stack_pointer_rtx, NULL_RTX, 1, OPTAB_LIB_WIDEN); | |
1195 | ||
1196 | size = expand_binop (Pmode, add_optab, size, dynamic_offset, | |
1197 | NULL_RTX, 1, OPTAB_LIB_WIDEN); | |
1198 | } | |
18ca7dab RK |
1199 | #endif /* SETJMP_VIA_SAVE_AREA */ |
1200 | ||
1201 | /* Round the size to a multiple of the required stack alignment. | |
1202 | Since the stack if presumed to be rounded before this allocation, | |
1203 | this will maintain the required alignment. | |
1204 | ||
1205 | If the stack grows downward, we could save an insn by subtracting | |
1206 | SIZE from the stack pointer and then aligning the stack pointer. | |
1207 | The problem with this is that the stack pointer may be unaligned | |
1208 | between the execution of the subtraction and alignment insns and | |
1209 | some machines do not allow this. Even on those that do, some | |
1210 | signal handlers malfunction if a signal should occur between those | |
1211 | insns. Since this is an extremely rare event, we have no reliable | |
1212 | way of knowing which systems have this problem. So we avoid even | |
1213 | momentarily mis-aligning the stack. */ | |
1214 | ||
86b25e81 RS |
1215 | /* If we added a variable amount to SIZE, |
1216 | we can no longer assume it is aligned. */ | |
515a7242 | 1217 | #if !defined (SETJMP_VIA_SAVE_AREA) |
c795bca9 | 1218 | if (MUST_ALIGN || known_align % PREFERRED_STACK_BOUNDARY != 0) |
34c9156a | 1219 | #endif |
091ad0b9 | 1220 | size = round_push (size); |
18ca7dab RK |
1221 | |
1222 | do_pending_stack_adjust (); | |
1223 | ||
1503a7ec | 1224 | /* We ought to be called always on the toplevel and stack ought to be aligned |
a1f300c0 | 1225 | properly. */ |
5b0264cb NS |
1226 | gcc_assert (!(stack_pointer_delta |
1227 | % (PREFERRED_STACK_BOUNDARY / BITS_PER_UNIT))); | |
1503a7ec | 1228 | |
b38f3813 EB |
1229 | /* If needed, check that we have the required amount of stack. |
1230 | Take into account what has already been checked. */ | |
1231 | if (flag_stack_check == GENERIC_STACK_CHECK) | |
1232 | probe_stack_range (STACK_OLD_CHECK_PROTECT + STACK_CHECK_MAX_FRAME_SIZE, | |
1233 | size); | |
1234 | else if (flag_stack_check == STATIC_BUILTIN_STACK_CHECK) | |
1235 | probe_stack_range (STACK_CHECK_PROTECT, size); | |
edff2491 | 1236 | |
d5457140 | 1237 | /* Don't use a TARGET that isn't a pseudo or is the wrong mode. */ |
f8cfc6aa | 1238 | if (target == 0 || !REG_P (target) |
d5457140 RK |
1239 | || REGNO (target) < FIRST_PSEUDO_REGISTER |
1240 | || GET_MODE (target) != Pmode) | |
18ca7dab RK |
1241 | target = gen_reg_rtx (Pmode); |
1242 | ||
bdb429a5 | 1243 | mark_reg_pointer (target, known_align); |
3ad69266 | 1244 | |
18ca7dab RK |
1245 | /* Perform the required allocation from the stack. Some systems do |
1246 | this differently than simply incrementing/decrementing from the | |
38a448ca | 1247 | stack pointer, such as acquiring the space by calling malloc(). */ |
18ca7dab RK |
1248 | #ifdef HAVE_allocate_stack |
1249 | if (HAVE_allocate_stack) | |
1250 | { | |
39403d82 | 1251 | enum machine_mode mode = STACK_SIZE_MODE; |
a995e389 | 1252 | insn_operand_predicate_fn pred; |
39403d82 | 1253 | |
4b6c1672 RK |
1254 | /* We don't have to check against the predicate for operand 0 since |
1255 | TARGET is known to be a pseudo of the proper mode, which must | |
1256 | be valid for the operand. For operand 1, convert to the | |
1257 | proper mode and validate. */ | |
c5c76735 | 1258 | if (mode == VOIDmode) |
4b6c1672 | 1259 | mode = insn_data[(int) CODE_FOR_allocate_stack].operand[1].mode; |
c5c76735 | 1260 | |
a995e389 RH |
1261 | pred = insn_data[(int) CODE_FOR_allocate_stack].operand[1].predicate; |
1262 | if (pred && ! ((*pred) (size, mode))) | |
05d482b9 | 1263 | size = copy_to_mode_reg (mode, convert_to_mode (mode, size, 1)); |
18ca7dab | 1264 | |
38a448ca | 1265 | emit_insn (gen_allocate_stack (target, size)); |
18ca7dab RK |
1266 | } |
1267 | else | |
1268 | #endif | |
ea534b63 | 1269 | { |
38a448ca RH |
1270 | #ifndef STACK_GROWS_DOWNWARD |
1271 | emit_move_insn (target, virtual_stack_dynamic_rtx); | |
1272 | #endif | |
a157febd GK |
1273 | |
1274 | /* Check stack bounds if necessary. */ | |
e3b5732b | 1275 | if (crtl->limit_stack) |
a157febd GK |
1276 | { |
1277 | rtx available; | |
1278 | rtx space_available = gen_label_rtx (); | |
1279 | #ifdef STACK_GROWS_DOWNWARD | |
d9b3eb63 | 1280 | available = expand_binop (Pmode, sub_optab, |
a157febd GK |
1281 | stack_pointer_rtx, stack_limit_rtx, |
1282 | NULL_RTX, 1, OPTAB_WIDEN); | |
1283 | #else | |
d9b3eb63 | 1284 | available = expand_binop (Pmode, sub_optab, |
a157febd GK |
1285 | stack_limit_rtx, stack_pointer_rtx, |
1286 | NULL_RTX, 1, OPTAB_WIDEN); | |
1287 | #endif | |
1288 | emit_cmp_and_jump_insns (available, size, GEU, NULL_RTX, Pmode, 1, | |
a06ef755 | 1289 | space_available); |
a157febd GK |
1290 | #ifdef HAVE_trap |
1291 | if (HAVE_trap) | |
1292 | emit_insn (gen_trap ()); | |
1293 | else | |
1294 | #endif | |
1295 | error ("stack limits not supported on this target"); | |
1296 | emit_barrier (); | |
1297 | emit_label (space_available); | |
1298 | } | |
1299 | ||
ea534b63 | 1300 | anti_adjust_stack (size); |
d5457140 | 1301 | |
18ca7dab | 1302 | #ifdef STACK_GROWS_DOWNWARD |
ca56cd30 | 1303 | emit_move_insn (target, virtual_stack_dynamic_rtx); |
18ca7dab | 1304 | #endif |
38a448ca | 1305 | } |
18ca7dab | 1306 | |
515a7242 | 1307 | if (MUST_ALIGN) |
091ad0b9 | 1308 | { |
5244db05 | 1309 | /* CEIL_DIV_EXPR needs to worry about the addition overflowing, |
0f41302f MS |
1310 | but we know it can't. So add ourselves and then do |
1311 | TRUNC_DIV_EXPR. */ | |
0f56a403 | 1312 | target = expand_binop (Pmode, add_optab, target, |
5244db05 RK |
1313 | GEN_INT (BIGGEST_ALIGNMENT / BITS_PER_UNIT - 1), |
1314 | NULL_RTX, 1, OPTAB_LIB_WIDEN); | |
1315 | target = expand_divmod (0, TRUNC_DIV_EXPR, Pmode, target, | |
b1ec3c92 CH |
1316 | GEN_INT (BIGGEST_ALIGNMENT / BITS_PER_UNIT), |
1317 | NULL_RTX, 1); | |
091ad0b9 | 1318 | target = expand_mult (Pmode, target, |
b1ec3c92 CH |
1319 | GEN_INT (BIGGEST_ALIGNMENT / BITS_PER_UNIT), |
1320 | NULL_RTX, 1); | |
091ad0b9 | 1321 | } |
d9b3eb63 | 1322 | |
15fc0026 | 1323 | /* Record the new stack level for nonlocal gotos. */ |
6de9cd9a DN |
1324 | if (cfun->nonlocal_goto_save_area != 0) |
1325 | update_nonlocal_goto_save_area (); | |
15fc0026 | 1326 | |
18ca7dab RK |
1327 | return target; |
1328 | } | |
1329 | \f | |
d9b3eb63 | 1330 | /* A front end may want to override GCC's stack checking by providing a |
14a774a9 RK |
1331 | run-time routine to call to check the stack, so provide a mechanism for |
1332 | calling that routine. */ | |
1333 | ||
e2500fed | 1334 | static GTY(()) rtx stack_check_libfunc; |
14a774a9 RK |
1335 | |
1336 | void | |
502b8322 | 1337 | set_stack_check_libfunc (rtx libfunc) |
14a774a9 RK |
1338 | { |
1339 | stack_check_libfunc = libfunc; | |
1340 | } | |
1341 | \f | |
edff2491 RK |
1342 | /* Emit one stack probe at ADDRESS, an address within the stack. */ |
1343 | ||
1344 | static void | |
502b8322 | 1345 | emit_stack_probe (rtx address) |
edff2491 | 1346 | { |
38a448ca | 1347 | rtx memref = gen_rtx_MEM (word_mode, address); |
edff2491 RK |
1348 | |
1349 | MEM_VOLATILE_P (memref) = 1; | |
1350 | ||
1351 | if (STACK_CHECK_PROBE_LOAD) | |
1352 | emit_move_insn (gen_reg_rtx (word_mode), memref); | |
1353 | else | |
1354 | emit_move_insn (memref, const0_rtx); | |
1355 | } | |
1356 | ||
d9b3eb63 | 1357 | /* Probe a range of stack addresses from FIRST to FIRST+SIZE, inclusive. |
edff2491 RK |
1358 | FIRST is a constant and size is a Pmode RTX. These are offsets from the |
1359 | current stack pointer. STACK_GROWS_DOWNWARD says whether to add or | |
1360 | subtract from the stack. If SIZE is constant, this is done | |
1361 | with a fixed number of probes. Otherwise, we must make a loop. */ | |
1362 | ||
1363 | #ifdef STACK_GROWS_DOWNWARD | |
1364 | #define STACK_GROW_OP MINUS | |
1365 | #else | |
1366 | #define STACK_GROW_OP PLUS | |
1367 | #endif | |
1368 | ||
1369 | void | |
502b8322 | 1370 | probe_stack_range (HOST_WIDE_INT first, rtx size) |
edff2491 | 1371 | { |
4b6c1672 RK |
1372 | /* First ensure SIZE is Pmode. */ |
1373 | if (GET_MODE (size) != VOIDmode && GET_MODE (size) != Pmode) | |
1374 | size = convert_to_mode (Pmode, size, 1); | |
1375 | ||
1376 | /* Next see if the front end has set up a function for us to call to | |
14a774a9 RK |
1377 | check the stack. */ |
1378 | if (stack_check_libfunc != 0) | |
f5f5363f RK |
1379 | { |
1380 | rtx addr = memory_address (QImode, | |
2b3aadfc RH |
1381 | gen_rtx_fmt_ee (STACK_GROW_OP, Pmode, |
1382 | stack_pointer_rtx, | |
1383 | plus_constant (size, first))); | |
f5f5363f | 1384 | |
5ae6cd0d | 1385 | addr = convert_memory_address (ptr_mode, addr); |
1258ee80 | 1386 | emit_library_call (stack_check_libfunc, LCT_NORMAL, VOIDmode, 1, addr, |
f5f5363f RK |
1387 | ptr_mode); |
1388 | } | |
14a774a9 RK |
1389 | |
1390 | /* Next see if we have an insn to check the stack. Use it if so. */ | |
edff2491 | 1391 | #ifdef HAVE_check_stack |
14a774a9 | 1392 | else if (HAVE_check_stack) |
edff2491 | 1393 | { |
a995e389 | 1394 | insn_operand_predicate_fn pred; |
38a448ca | 1395 | rtx last_addr |
2b3aadfc RH |
1396 | = force_operand (gen_rtx_fmt_ee (STACK_GROW_OP, Pmode, |
1397 | stack_pointer_rtx, | |
1398 | plus_constant (size, first)), | |
38a448ca | 1399 | NULL_RTX); |
edff2491 | 1400 | |
a995e389 RH |
1401 | pred = insn_data[(int) CODE_FOR_check_stack].operand[0].predicate; |
1402 | if (pred && ! ((*pred) (last_addr, Pmode))) | |
c5c76735 | 1403 | last_addr = copy_to_mode_reg (Pmode, last_addr); |
edff2491 | 1404 | |
c5c76735 | 1405 | emit_insn (gen_check_stack (last_addr)); |
edff2491 RK |
1406 | } |
1407 | #endif | |
1408 | ||
1409 | /* If we have to generate explicit probes, see if we have a constant | |
95a086b1 | 1410 | small number of them to generate. If so, that's the easy case. */ |
481683e1 | 1411 | else if (CONST_INT_P (size) |
14a774a9 | 1412 | && INTVAL (size) < 10 * STACK_CHECK_PROBE_INTERVAL) |
edff2491 RK |
1413 | { |
1414 | HOST_WIDE_INT offset; | |
1415 | ||
1416 | /* Start probing at FIRST + N * STACK_CHECK_PROBE_INTERVAL | |
1417 | for values of N from 1 until it exceeds LAST. If only one | |
1418 | probe is needed, this will not generate any code. Then probe | |
1419 | at LAST. */ | |
1420 | for (offset = first + STACK_CHECK_PROBE_INTERVAL; | |
1421 | offset < INTVAL (size); | |
1422 | offset = offset + STACK_CHECK_PROBE_INTERVAL) | |
38a448ca RH |
1423 | emit_stack_probe (gen_rtx_fmt_ee (STACK_GROW_OP, Pmode, |
1424 | stack_pointer_rtx, | |
1425 | GEN_INT (offset))); | |
edff2491 | 1426 | |
38a448ca RH |
1427 | emit_stack_probe (gen_rtx_fmt_ee (STACK_GROW_OP, Pmode, |
1428 | stack_pointer_rtx, | |
1429 | plus_constant (size, first))); | |
edff2491 RK |
1430 | } |
1431 | ||
1432 | /* In the variable case, do the same as above, but in a loop. We emit loop | |
1433 | notes so that loop optimization can be done. */ | |
1434 | else | |
1435 | { | |
1436 | rtx test_addr | |
38a448ca RH |
1437 | = force_operand (gen_rtx_fmt_ee (STACK_GROW_OP, Pmode, |
1438 | stack_pointer_rtx, | |
1439 | GEN_INT (first + STACK_CHECK_PROBE_INTERVAL)), | |
edff2491 RK |
1440 | NULL_RTX); |
1441 | rtx last_addr | |
38a448ca RH |
1442 | = force_operand (gen_rtx_fmt_ee (STACK_GROW_OP, Pmode, |
1443 | stack_pointer_rtx, | |
1444 | plus_constant (size, first)), | |
edff2491 RK |
1445 | NULL_RTX); |
1446 | rtx incr = GEN_INT (STACK_CHECK_PROBE_INTERVAL); | |
1447 | rtx loop_lab = gen_label_rtx (); | |
1448 | rtx test_lab = gen_label_rtx (); | |
1449 | rtx end_lab = gen_label_rtx (); | |
1450 | rtx temp; | |
1451 | ||
f8cfc6aa | 1452 | if (!REG_P (test_addr) |
edff2491 RK |
1453 | || REGNO (test_addr) < FIRST_PSEUDO_REGISTER) |
1454 | test_addr = force_reg (Pmode, test_addr); | |
1455 | ||
edff2491 RK |
1456 | emit_jump (test_lab); |
1457 | ||
1458 | emit_label (loop_lab); | |
1459 | emit_stack_probe (test_addr); | |
1460 | ||
edff2491 RK |
1461 | #ifdef STACK_GROWS_DOWNWARD |
1462 | #define CMP_OPCODE GTU | |
1463 | temp = expand_binop (Pmode, sub_optab, test_addr, incr, test_addr, | |
1464 | 1, OPTAB_WIDEN); | |
1465 | #else | |
1466 | #define CMP_OPCODE LTU | |
1467 | temp = expand_binop (Pmode, add_optab, test_addr, incr, test_addr, | |
1468 | 1, OPTAB_WIDEN); | |
1469 | #endif | |
1470 | ||
5b0264cb | 1471 | gcc_assert (temp == test_addr); |
edff2491 RK |
1472 | |
1473 | emit_label (test_lab); | |
c5d5d461 | 1474 | emit_cmp_and_jump_insns (test_addr, last_addr, CMP_OPCODE, |
a06ef755 | 1475 | NULL_RTX, Pmode, 1, loop_lab); |
edff2491 | 1476 | emit_jump (end_lab); |
edff2491 RK |
1477 | emit_label (end_lab); |
1478 | ||
1479 | emit_stack_probe (last_addr); | |
1480 | } | |
1481 | } | |
1482 | \f | |
18ca7dab RK |
1483 | /* Return an rtx representing the register or memory location |
1484 | in which a scalar value of data type VALTYPE | |
1485 | was returned by a function call to function FUNC. | |
1d636cc6 RG |
1486 | FUNC is a FUNCTION_DECL, FNTYPE a FUNCTION_TYPE node if the precise |
1487 | function is known, otherwise 0. | |
4dc07bd7 JJ |
1488 | OUTGOING is 1 if on a machine with register windows this function |
1489 | should return the register in which the function will put its result | |
30f7a378 | 1490 | and 0 otherwise. */ |
18ca7dab RK |
1491 | |
1492 | rtx | |
586de218 | 1493 | hard_function_value (const_tree valtype, const_tree func, const_tree fntype, |
502b8322 | 1494 | int outgoing ATTRIBUTE_UNUSED) |
18ca7dab | 1495 | { |
4dc07bd7 | 1496 | rtx val; |
770ae6cc | 1497 | |
1d636cc6 | 1498 | val = targetm.calls.function_value (valtype, func ? func : fntype, outgoing); |
770ae6cc | 1499 | |
f8cfc6aa | 1500 | if (REG_P (val) |
e1a4071f JL |
1501 | && GET_MODE (val) == BLKmode) |
1502 | { | |
770ae6cc | 1503 | unsigned HOST_WIDE_INT bytes = int_size_in_bytes (valtype); |
e1a4071f | 1504 | enum machine_mode tmpmode; |
770ae6cc | 1505 | |
d9b3eb63 | 1506 | /* int_size_in_bytes can return -1. We don't need a check here |
535a42b1 NS |
1507 | since the value of bytes will then be large enough that no |
1508 | mode will match anyway. */ | |
d9b3eb63 | 1509 | |
e1a4071f | 1510 | for (tmpmode = GET_CLASS_NARROWEST_MODE (MODE_INT); |
0fb7aeda KH |
1511 | tmpmode != VOIDmode; |
1512 | tmpmode = GET_MODE_WIDER_MODE (tmpmode)) | |
1513 | { | |
1514 | /* Have we found a large enough mode? */ | |
1515 | if (GET_MODE_SIZE (tmpmode) >= bytes) | |
1516 | break; | |
1517 | } | |
e1a4071f JL |
1518 | |
1519 | /* No suitable mode found. */ | |
5b0264cb | 1520 | gcc_assert (tmpmode != VOIDmode); |
e1a4071f JL |
1521 | |
1522 | PUT_MODE (val, tmpmode); | |
d9b3eb63 | 1523 | } |
e1a4071f | 1524 | return val; |
18ca7dab RK |
1525 | } |
1526 | ||
1527 | /* Return an rtx representing the register or memory location | |
1528 | in which a scalar value of mode MODE was returned by a library call. */ | |
1529 | ||
1530 | rtx | |
390b17c2 | 1531 | hard_libcall_value (enum machine_mode mode, rtx fun) |
18ca7dab | 1532 | { |
390b17c2 | 1533 | return targetm.calls.libcall_value (mode, fun); |
18ca7dab | 1534 | } |
0c5e217d RS |
1535 | |
1536 | /* Look up the tree code for a given rtx code | |
1537 | to provide the arithmetic operation for REAL_ARITHMETIC. | |
1538 | The function returns an int because the caller may not know | |
1539 | what `enum tree_code' means. */ | |
1540 | ||
1541 | int | |
502b8322 | 1542 | rtx_to_tree_code (enum rtx_code code) |
0c5e217d RS |
1543 | { |
1544 | enum tree_code tcode; | |
1545 | ||
1546 | switch (code) | |
1547 | { | |
1548 | case PLUS: | |
1549 | tcode = PLUS_EXPR; | |
1550 | break; | |
1551 | case MINUS: | |
1552 | tcode = MINUS_EXPR; | |
1553 | break; | |
1554 | case MULT: | |
1555 | tcode = MULT_EXPR; | |
1556 | break; | |
1557 | case DIV: | |
1558 | tcode = RDIV_EXPR; | |
1559 | break; | |
1560 | case SMIN: | |
1561 | tcode = MIN_EXPR; | |
1562 | break; | |
1563 | case SMAX: | |
1564 | tcode = MAX_EXPR; | |
1565 | break; | |
1566 | default: | |
1567 | tcode = LAST_AND_UNUSED_TREE_CODE; | |
1568 | break; | |
1569 | } | |
1570 | return ((int) tcode); | |
1571 | } | |
e2500fed GK |
1572 | |
1573 | #include "gt-explow.h" |