1 /* Subroutines for manipulating rtx's in semantically interesting ways.
2 Copyright (C) 1987, 1991, 1994, 1995, 1996, 1997, 1998,
3 1999, 2000 Free Software Foundation, Inc.
5 This file is part of GNU CC.
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)
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.
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
19 the Free Software Foundation, 59 Temple Place - Suite 330,
20 Boston, MA 02111-1307, USA. */
32 #include "hard-reg-set.h"
33 #include "insn-config.h"
35 #include "insn-flags.h"
36 #include "insn-codes.h"
38 #if !defined PREFERRED_STACK_BOUNDARY && defined STACK_BOUNDARY
39 #define PREFERRED_STACK_BOUNDARY STACK_BOUNDARY
42 static rtx break_out_memory_refs
PARAMS ((rtx
));
43 static void emit_stack_probe
PARAMS ((rtx
));
46 /* Truncate and perhaps sign-extend C as appropriate for MODE. */
49 trunc_int_for_mode (c
, mode
)
51 enum machine_mode mode
;
53 int width
= GET_MODE_BITSIZE (mode
);
55 /* Canonicalize BImode to 0 and STORE_FLAG_VALUE. */
57 return c
& 1 ? STORE_FLAG_VALUE
: 0;
59 /* We clear out all bits that don't belong in MODE, unless they and our
60 sign bit are all one. So we get either a reasonable negative
61 value or a reasonable unsigned value. */
63 if (width
< HOST_BITS_PER_WIDE_INT
64 && ((c
& ((HOST_WIDE_INT
) (-1) << (width
- 1)))
65 != ((HOST_WIDE_INT
) (-1) << (width
- 1))))
66 c
&= ((HOST_WIDE_INT
) 1 << width
) - 1;
68 /* If this would be an entire word for the target, but is not for
69 the host, then sign-extend on the host so that the number will look
70 the same way on the host that it would on the target.
72 For example, when building a 64 bit alpha hosted 32 bit sparc
73 targeted compiler, then we want the 32 bit unsigned value -1 to be
74 represented as a 64 bit value -1, and not as 0x00000000ffffffff.
75 The later confuses the sparc backend. */
77 if (BITS_PER_WORD
< HOST_BITS_PER_WIDE_INT
78 && BITS_PER_WORD
== width
79 && (c
& ((HOST_WIDE_INT
) 1 << (width
- 1))))
80 c
|= ((HOST_WIDE_INT
) (-1) << width
);
85 /* Return an rtx for the sum of X and the integer C.
87 This function should be used via the `plus_constant' macro. */
90 plus_constant_wide (x
, c
)
92 register HOST_WIDE_INT c
;
94 register RTX_CODE code
;
95 register enum machine_mode mode
;
109 return GEN_INT (INTVAL (x
) + c
);
113 unsigned HOST_WIDE_INT l1
= CONST_DOUBLE_LOW (x
);
114 HOST_WIDE_INT h1
= CONST_DOUBLE_HIGH (x
);
115 unsigned HOST_WIDE_INT l2
= c
;
116 HOST_WIDE_INT h2
= c
< 0 ? ~0 : 0;
117 unsigned HOST_WIDE_INT lv
;
120 add_double (l1
, h1
, l2
, h2
, &lv
, &hv
);
122 return immed_double_const (lv
, hv
, VOIDmode
);
126 /* If this is a reference to the constant pool, try replacing it with
127 a reference to a new constant. If the resulting address isn't
128 valid, don't return it because we have no way to validize it. */
129 if (GET_CODE (XEXP (x
, 0)) == SYMBOL_REF
130 && CONSTANT_POOL_ADDRESS_P (XEXP (x
, 0)))
133 = force_const_mem (GET_MODE (x
),
134 plus_constant (get_pool_constant (XEXP (x
, 0)),
136 if (memory_address_p (GET_MODE (tem
), XEXP (tem
, 0)))
142 /* If adding to something entirely constant, set a flag
143 so that we can add a CONST around the result. */
154 /* The interesting case is adding the integer to a sum.
155 Look for constant term in the sum and combine
156 with C. For an integer constant term, we make a combined
157 integer. For a constant term that is not an explicit integer,
158 we cannot really combine, but group them together anyway.
160 Restart or use a recursive call in case the remaining operand is
161 something that we handle specially, such as a SYMBOL_REF.
163 We may not immediately return from the recursive call here, lest
164 all_constant gets lost. */
166 if (GET_CODE (XEXP (x
, 1)) == CONST_INT
)
168 c
+= INTVAL (XEXP (x
, 1));
170 if (GET_MODE (x
) != VOIDmode
)
171 c
= trunc_int_for_mode (c
, GET_MODE (x
));
176 else if (CONSTANT_P (XEXP (x
, 0)))
178 x
= gen_rtx_PLUS (mode
,
179 plus_constant (XEXP (x
, 0), c
),
183 else if (CONSTANT_P (XEXP (x
, 1)))
185 x
= gen_rtx_PLUS (mode
,
187 plus_constant (XEXP (x
, 1), c
));
197 x
= gen_rtx_PLUS (mode
, x
, GEN_INT (c
));
199 if (GET_CODE (x
) == SYMBOL_REF
|| GET_CODE (x
) == LABEL_REF
)
201 else if (all_constant
)
202 return gen_rtx_CONST (mode
, x
);
207 /* This is the same as `plus_constant', except that it handles LO_SUM.
209 This function should be used via the `plus_constant_for_output' macro. */
212 plus_constant_for_output_wide (x
, c
)
214 register HOST_WIDE_INT c
;
216 register enum machine_mode mode
= GET_MODE (x
);
218 if (GET_CODE (x
) == LO_SUM
)
219 return gen_rtx_LO_SUM (mode
, XEXP (x
, 0),
220 plus_constant_for_output (XEXP (x
, 1), c
));
223 return plus_constant (x
, c
);
226 /* If X is a sum, return a new sum like X but lacking any constant terms.
227 Add all the removed constant terms into *CONSTPTR.
228 X itself is not altered. The result != X if and only if
229 it is not isomorphic to X. */
232 eliminate_constant_term (x
, constptr
)
239 if (GET_CODE (x
) != PLUS
)
242 /* First handle constants appearing at this level explicitly. */
243 if (GET_CODE (XEXP (x
, 1)) == CONST_INT
244 && 0 != (tem
= simplify_binary_operation (PLUS
, GET_MODE (x
), *constptr
,
246 && GET_CODE (tem
) == CONST_INT
)
249 return eliminate_constant_term (XEXP (x
, 0), constptr
);
253 x0
= eliminate_constant_term (XEXP (x
, 0), &tem
);
254 x1
= eliminate_constant_term (XEXP (x
, 1), &tem
);
255 if ((x1
!= XEXP (x
, 1) || x0
!= XEXP (x
, 0))
256 && 0 != (tem
= simplify_binary_operation (PLUS
, GET_MODE (x
),
258 && GET_CODE (tem
) == CONST_INT
)
261 return gen_rtx_PLUS (GET_MODE (x
), x0
, x1
);
267 /* Returns the insn that next references REG after INSN, or 0
268 if REG is clobbered before next referenced or we cannot find
269 an insn that references REG in a straight-line piece of code. */
272 find_next_ref (reg
, insn
)
278 for (insn
= NEXT_INSN (insn
); insn
; insn
= next
)
280 next
= NEXT_INSN (insn
);
281 if (GET_CODE (insn
) == NOTE
)
283 if (GET_CODE (insn
) == CODE_LABEL
284 || GET_CODE (insn
) == BARRIER
)
286 if (GET_CODE (insn
) == INSN
287 || GET_CODE (insn
) == JUMP_INSN
288 || GET_CODE (insn
) == CALL_INSN
)
290 if (reg_set_p (reg
, insn
))
292 if (reg_mentioned_p (reg
, PATTERN (insn
)))
294 if (GET_CODE (insn
) == JUMP_INSN
)
296 if (any_uncondjump_p (insn
))
297 next
= JUMP_LABEL (insn
);
301 if (GET_CODE (insn
) == CALL_INSN
302 && REGNO (reg
) < FIRST_PSEUDO_REGISTER
303 && call_used_regs
[REGNO (reg
)])
312 /* Return an rtx for the size in bytes of the value of EXP. */
318 tree size
= size_in_bytes (TREE_TYPE (exp
));
320 if (TREE_CODE (size
) != INTEGER_CST
321 && contains_placeholder_p (size
))
322 size
= build (WITH_RECORD_EXPR
, sizetype
, size
, exp
);
324 return expand_expr (size
, NULL_RTX
, TYPE_MODE (sizetype
),
325 EXPAND_MEMORY_USE_BAD
);
328 /* Return a copy of X in which all memory references
329 and all constants that involve symbol refs
330 have been replaced with new temporary registers.
331 Also emit code to load the memory locations and constants
332 into those registers.
334 If X contains no such constants or memory references,
335 X itself (not a copy) is returned.
337 If a constant is found in the address that is not a legitimate constant
338 in an insn, it is left alone in the hope that it might be valid in the
341 X may contain no arithmetic except addition, subtraction and multiplication.
342 Values returned by expand_expr with 1 for sum_ok fit this constraint. */
345 break_out_memory_refs (x
)
348 if (GET_CODE (x
) == MEM
349 || (CONSTANT_P (x
) && CONSTANT_ADDRESS_P (x
)
350 && GET_MODE (x
) != VOIDmode
))
351 x
= force_reg (GET_MODE (x
), x
);
352 else if (GET_CODE (x
) == PLUS
|| GET_CODE (x
) == MINUS
353 || GET_CODE (x
) == MULT
)
355 register rtx op0
= break_out_memory_refs (XEXP (x
, 0));
356 register rtx op1
= break_out_memory_refs (XEXP (x
, 1));
358 if (op0
!= XEXP (x
, 0) || op1
!= XEXP (x
, 1))
359 x
= gen_rtx_fmt_ee (GET_CODE (x
), Pmode
, op0
, op1
);
365 #ifdef POINTERS_EXTEND_UNSIGNED
367 /* Given X, a memory address in ptr_mode, convert it to an address
368 in Pmode, or vice versa (TO_MODE says which way). We take advantage of
369 the fact that pointers are not allowed to overflow by commuting arithmetic
370 operations over conversions so that address arithmetic insns can be
374 convert_memory_address (to_mode
, x
)
375 enum machine_mode to_mode
;
378 enum machine_mode from_mode
= to_mode
== ptr_mode
? Pmode
: ptr_mode
;
381 /* Here we handle some special cases. If none of them apply, fall through
382 to the default case. */
383 switch (GET_CODE (x
))
390 temp
= gen_rtx_LABEL_REF (to_mode
, XEXP (x
, 0));
391 LABEL_REF_NONLOCAL_P (temp
) = LABEL_REF_NONLOCAL_P (x
);
395 temp
= gen_rtx_SYMBOL_REF (to_mode
, XSTR (x
, 0));
396 SYMBOL_REF_FLAG (temp
) = SYMBOL_REF_FLAG (x
);
397 CONSTANT_POOL_ADDRESS_P (temp
) = CONSTANT_POOL_ADDRESS_P (x
);
401 return gen_rtx_CONST (to_mode
,
402 convert_memory_address (to_mode
, XEXP (x
, 0)));
406 /* For addition the second operand is a small constant, we can safely
407 permute the conversion and addition operation. We can always safely
408 permute them if we are making the address narrower. In addition,
409 always permute the operations if this is a constant. */
410 if (GET_MODE_SIZE (to_mode
) < GET_MODE_SIZE (from_mode
)
411 || (GET_CODE (x
) == PLUS
&& GET_CODE (XEXP (x
, 1)) == CONST_INT
412 && (INTVAL (XEXP (x
, 1)) + 20000 < 40000
413 || CONSTANT_P (XEXP (x
, 0)))))
414 return gen_rtx_fmt_ee (GET_CODE (x
), to_mode
,
415 convert_memory_address (to_mode
, XEXP (x
, 0)),
416 convert_memory_address (to_mode
, XEXP (x
, 1)));
423 return convert_modes (to_mode
, from_mode
,
424 x
, POINTERS_EXTEND_UNSIGNED
);
428 /* Given a memory address or facsimile X, construct a new address,
429 currently equivalent, that is stable: future stores won't change it.
431 X must be composed of constants, register and memory references
432 combined with addition, subtraction and multiplication:
433 in other words, just what you can get from expand_expr if sum_ok is 1.
435 Works by making copies of all regs and memory locations used
436 by X and combining them the same way X does.
437 You could also stabilize the reference to this address
438 by copying the address to a register with copy_to_reg;
439 but then you wouldn't get indexed addressing in the reference. */
445 if (GET_CODE (x
) == REG
)
447 if (REGNO (x
) != FRAME_POINTER_REGNUM
448 #if HARD_FRAME_POINTER_REGNUM != FRAME_POINTER_REGNUM
449 && REGNO (x
) != HARD_FRAME_POINTER_REGNUM
454 else if (GET_CODE (x
) == MEM
)
456 else if (GET_CODE (x
) == PLUS
|| GET_CODE (x
) == MINUS
457 || GET_CODE (x
) == MULT
)
459 register rtx op0
= copy_all_regs (XEXP (x
, 0));
460 register rtx op1
= copy_all_regs (XEXP (x
, 1));
461 if (op0
!= XEXP (x
, 0) || op1
!= XEXP (x
, 1))
462 x
= gen_rtx_fmt_ee (GET_CODE (x
), Pmode
, op0
, op1
);
467 /* Return something equivalent to X but valid as a memory address
468 for something of mode MODE. When X is not itself valid, this
469 works by copying X or subexpressions of it into registers. */
472 memory_address (mode
, x
)
473 enum machine_mode mode
;
476 register rtx oldx
= x
;
478 if (GET_CODE (x
) == ADDRESSOF
)
481 #ifdef POINTERS_EXTEND_UNSIGNED
482 if (GET_MODE (x
) == ptr_mode
)
483 x
= convert_memory_address (Pmode
, x
);
486 /* By passing constant addresses thru registers
487 we get a chance to cse them. */
488 if (! cse_not_expected
&& CONSTANT_P (x
) && CONSTANT_ADDRESS_P (x
))
489 x
= force_reg (Pmode
, x
);
491 /* Accept a QUEUED that refers to a REG
492 even though that isn't a valid address.
493 On attempting to put this in an insn we will call protect_from_queue
494 which will turn it into a REG, which is valid. */
495 else if (GET_CODE (x
) == QUEUED
496 && GET_CODE (QUEUED_VAR (x
)) == REG
)
499 /* We get better cse by rejecting indirect addressing at this stage.
500 Let the combiner create indirect addresses where appropriate.
501 For now, generate the code so that the subexpressions useful to share
502 are visible. But not if cse won't be done! */
505 if (! cse_not_expected
&& GET_CODE (x
) != REG
)
506 x
= break_out_memory_refs (x
);
508 /* At this point, any valid address is accepted. */
509 GO_IF_LEGITIMATE_ADDRESS (mode
, x
, win
);
511 /* If it was valid before but breaking out memory refs invalidated it,
512 use it the old way. */
513 if (memory_address_p (mode
, oldx
))
516 /* Perform machine-dependent transformations on X
517 in certain cases. This is not necessary since the code
518 below can handle all possible cases, but machine-dependent
519 transformations can make better code. */
520 LEGITIMIZE_ADDRESS (x
, oldx
, mode
, win
);
522 /* PLUS and MULT can appear in special ways
523 as the result of attempts to make an address usable for indexing.
524 Usually they are dealt with by calling force_operand, below.
525 But a sum containing constant terms is special
526 if removing them makes the sum a valid address:
527 then we generate that address in a register
528 and index off of it. We do this because it often makes
529 shorter code, and because the addresses thus generated
530 in registers often become common subexpressions. */
531 if (GET_CODE (x
) == PLUS
)
533 rtx constant_term
= const0_rtx
;
534 rtx y
= eliminate_constant_term (x
, &constant_term
);
535 if (constant_term
== const0_rtx
536 || ! memory_address_p (mode
, y
))
537 x
= force_operand (x
, NULL_RTX
);
540 y
= gen_rtx_PLUS (GET_MODE (x
), copy_to_reg (y
), constant_term
);
541 if (! memory_address_p (mode
, y
))
542 x
= force_operand (x
, NULL_RTX
);
548 else if (GET_CODE (x
) == MULT
|| GET_CODE (x
) == MINUS
)
549 x
= force_operand (x
, NULL_RTX
);
551 /* If we have a register that's an invalid address,
552 it must be a hard reg of the wrong class. Copy it to a pseudo. */
553 else if (GET_CODE (x
) == REG
)
556 /* Last resort: copy the value to a register, since
557 the register is a valid address. */
559 x
= force_reg (Pmode
, x
);
566 if (flag_force_addr
&& ! cse_not_expected
&& GET_CODE (x
) != REG
567 /* Don't copy an addr via a reg if it is one of our stack slots. */
568 && ! (GET_CODE (x
) == PLUS
569 && (XEXP (x
, 0) == virtual_stack_vars_rtx
570 || XEXP (x
, 0) == virtual_incoming_args_rtx
)))
572 if (general_operand (x
, Pmode
))
573 x
= force_reg (Pmode
, x
);
575 x
= force_operand (x
, NULL_RTX
);
581 /* If we didn't change the address, we are done. Otherwise, mark
582 a reg as a pointer if we have REG or REG + CONST_INT. */
585 else if (GET_CODE (x
) == REG
)
586 mark_reg_pointer (x
, BITS_PER_UNIT
);
587 else if (GET_CODE (x
) == PLUS
588 && GET_CODE (XEXP (x
, 0)) == REG
589 && GET_CODE (XEXP (x
, 1)) == CONST_INT
)
590 mark_reg_pointer (XEXP (x
, 0), BITS_PER_UNIT
);
592 /* OLDX may have been the address on a temporary. Update the address
593 to indicate that X is now used. */
594 update_temp_slot_address (oldx
, x
);
599 /* Like `memory_address' but pretend `flag_force_addr' is 0. */
602 memory_address_noforce (mode
, x
)
603 enum machine_mode mode
;
606 int ambient_force_addr
= flag_force_addr
;
610 val
= memory_address (mode
, x
);
611 flag_force_addr
= ambient_force_addr
;
615 /* Convert a mem ref into one with a valid memory address.
616 Pass through anything else unchanged. */
622 if (GET_CODE (ref
) != MEM
)
624 if (memory_address_p (GET_MODE (ref
), XEXP (ref
, 0)))
626 /* Don't alter REF itself, since that is probably a stack slot. */
627 return change_address (ref
, GET_MODE (ref
), XEXP (ref
, 0));
630 /* Given REF, either a MEM or a REG, and T, either the type of X or
631 the expression corresponding to REF, set RTX_UNCHANGING_P if
635 maybe_set_unchanging (ref
, t
)
639 /* We can set RTX_UNCHANGING_P from TREE_READONLY for decls whose
640 initialization is only executed once, or whose initializer always
641 has the same value. Currently we simplify this to PARM_DECLs in the
642 first case, and decls with TREE_CONSTANT initializers in the second. */
643 if ((TREE_READONLY (t
) && DECL_P (t
)
644 && (TREE_CODE (t
) == PARM_DECL
645 || DECL_INITIAL (t
) == NULL_TREE
646 || TREE_CONSTANT (DECL_INITIAL (t
))))
647 || TREE_CODE_CLASS (TREE_CODE (t
)) == 'c')
648 RTX_UNCHANGING_P (ref
) = 1;
651 /* Given REF, a MEM, and T, either the type of X or the expression
652 corresponding to REF, set the memory attributes. OBJECTP is nonzero
653 if we are making a new object of this type. */
656 set_mem_attributes (ref
, t
, objectp
)
663 /* It can happen that type_for_mode was given a mode for which there
664 is no language-level type. In which case it returns NULL, which
669 type
= TYPE_P (t
) ? t
: TREE_TYPE (t
);
671 /* Get the alias set from the expression or type (perhaps using a
672 front-end routine) and then copy bits from the type. */
674 /* It is incorrect to set RTX_UNCHANGING_P from TREE_READONLY (type)
675 here, because, in C and C++, the fact that a location is accessed
676 through a const expression does not mean that the value there can
678 MEM_ALIAS_SET (ref
) = get_alias_set (t
);
679 MEM_VOLATILE_P (ref
) = TYPE_VOLATILE (type
);
680 MEM_IN_STRUCT_P (ref
) = AGGREGATE_TYPE_P (type
);
682 /* If we are making an object of this type, we know that it is a scalar if
683 the type is not an aggregate. */
684 if (objectp
&& ! AGGREGATE_TYPE_P (type
))
685 MEM_SCALAR_P (ref
) = 1;
687 /* If T is a type, this is all we can do. Otherwise, we may be able
688 to deduce some more information about the expression. */
692 maybe_set_unchanging (ref
, t
);
693 if (TREE_THIS_VOLATILE (t
))
694 MEM_VOLATILE_P (ref
) = 1;
696 /* Now see if we can say more about whether it's an aggregate or
697 scalar. If we already know it's an aggregate, don't bother. */
698 if (MEM_IN_STRUCT_P (ref
))
701 /* Now remove any NOPs: they don't change what the underlying object is.
702 Likewise for SAVE_EXPR. */
703 while (TREE_CODE (t
) == NOP_EXPR
|| TREE_CODE (t
) == CONVERT_EXPR
704 || TREE_CODE (t
) == NON_LVALUE_EXPR
|| TREE_CODE (t
) == SAVE_EXPR
)
705 t
= TREE_OPERAND (t
, 0);
707 /* Since we already know the type isn't an aggregate, if this is a decl,
708 it must be a scalar. Or if it is a reference into an aggregate,
709 this is part of an aggregate. Otherwise we don't know. */
711 MEM_SCALAR_P (ref
) = 1;
712 else if (TREE_CODE (t
) == COMPONENT_REF
|| TREE_CODE (t
) == ARRAY_REF
713 || TREE_CODE (t
) == BIT_FIELD_REF
)
714 MEM_IN_STRUCT_P (ref
) = 1;
717 /* Return a modified copy of X with its memory address copied
718 into a temporary register to protect it from side effects.
719 If X is not a MEM, it is returned unchanged (and not copied).
720 Perhaps even if it is a MEM, if there is no need to change it. */
728 if (GET_CODE (x
) != MEM
)
732 if (rtx_unstable_p (addr
))
734 rtx temp
= force_reg (Pmode
, copy_all_regs (addr
));
735 rtx mem
= gen_rtx_MEM (GET_MODE (x
), temp
);
737 MEM_COPY_ATTRIBUTES (mem
, x
);
743 /* Copy the value or contents of X to a new temp reg and return that reg. */
749 register rtx temp
= gen_reg_rtx (GET_MODE (x
));
751 /* If not an operand, must be an address with PLUS and MULT so
752 do the computation. */
753 if (! general_operand (x
, VOIDmode
))
754 x
= force_operand (x
, temp
);
757 emit_move_insn (temp
, x
);
762 /* Like copy_to_reg but always give the new register mode Pmode
763 in case X is a constant. */
769 return copy_to_mode_reg (Pmode
, x
);
772 /* Like copy_to_reg but always give the new register mode MODE
773 in case X is a constant. */
776 copy_to_mode_reg (mode
, x
)
777 enum machine_mode mode
;
780 register rtx temp
= gen_reg_rtx (mode
);
782 /* If not an operand, must be an address with PLUS and MULT so
783 do the computation. */
784 if (! general_operand (x
, VOIDmode
))
785 x
= force_operand (x
, temp
);
787 if (GET_MODE (x
) != mode
&& GET_MODE (x
) != VOIDmode
)
790 emit_move_insn (temp
, x
);
794 /* Load X into a register if it is not already one.
795 Use mode MODE for the register.
796 X should be valid for mode MODE, but it may be a constant which
797 is valid for all integer modes; that's why caller must specify MODE.
799 The caller must not alter the value in the register we return,
800 since we mark it as a "constant" register. */
804 enum machine_mode mode
;
807 register rtx temp
, insn
, set
;
809 if (GET_CODE (x
) == REG
)
812 temp
= gen_reg_rtx (mode
);
814 if (! general_operand (x
, mode
))
815 x
= force_operand (x
, NULL_RTX
);
817 insn
= emit_move_insn (temp
, x
);
819 /* Let optimizers know that TEMP's value never changes
820 and that X can be substituted for it. Don't get confused
821 if INSN set something else (such as a SUBREG of TEMP). */
823 && (set
= single_set (insn
)) != 0
824 && SET_DEST (set
) == temp
)
826 rtx note
= find_reg_note (insn
, REG_EQUAL
, NULL_RTX
);
831 REG_NOTES (insn
) = gen_rtx_EXPR_LIST (REG_EQUAL
, x
, REG_NOTES (insn
));
836 /* If X is a memory ref, copy its contents to a new temp reg and return
837 that reg. Otherwise, return X. */
845 if (GET_CODE (x
) != MEM
|| GET_MODE (x
) == BLKmode
)
848 temp
= gen_reg_rtx (GET_MODE (x
));
849 emit_move_insn (temp
, x
);
853 /* Copy X to TARGET (if it's nonzero and a reg)
854 or to a new temp reg and return that reg.
855 MODE is the mode to use for X in case it is a constant. */
858 copy_to_suggested_reg (x
, target
, mode
)
860 enum machine_mode mode
;
864 if (target
&& GET_CODE (target
) == REG
)
867 temp
= gen_reg_rtx (mode
);
869 emit_move_insn (temp
, x
);
873 /* Return the mode to use to store a scalar of TYPE and MODE.
874 PUNSIGNEDP points to the signedness of the type and may be adjusted
875 to show what signedness to use on extension operations.
877 FOR_CALL is non-zero if this call is promoting args for a call. */
880 promote_mode (type
, mode
, punsignedp
, for_call
)
882 enum machine_mode mode
;
884 int for_call ATTRIBUTE_UNUSED
;
886 enum tree_code code
= TREE_CODE (type
);
887 int unsignedp
= *punsignedp
;
889 #ifdef PROMOTE_FOR_CALL_ONLY
897 case INTEGER_TYPE
: case ENUMERAL_TYPE
: case BOOLEAN_TYPE
:
898 case CHAR_TYPE
: case REAL_TYPE
: case OFFSET_TYPE
:
899 PROMOTE_MODE (mode
, unsignedp
, type
);
903 #ifdef POINTERS_EXTEND_UNSIGNED
907 unsignedp
= POINTERS_EXTEND_UNSIGNED
;
915 *punsignedp
= unsignedp
;
919 /* Adjust the stack pointer by ADJUST (an rtx for a number of bytes).
920 This pops when ADJUST is positive. ADJUST need not be constant. */
923 adjust_stack (adjust
)
927 adjust
= protect_from_queue (adjust
, 0);
929 if (adjust
== const0_rtx
)
932 /* We expect all variable sized adjustments to be multiple of
933 PREFERRED_STACK_BOUNDARY. */
934 if (GET_CODE (adjust
) == CONST_INT
)
935 stack_pointer_delta
-= INTVAL (adjust
);
937 temp
= expand_binop (Pmode
,
938 #ifdef STACK_GROWS_DOWNWARD
943 stack_pointer_rtx
, adjust
, stack_pointer_rtx
, 0,
946 if (temp
!= stack_pointer_rtx
)
947 emit_move_insn (stack_pointer_rtx
, temp
);
950 /* Adjust the stack pointer by minus ADJUST (an rtx for a number of bytes).
951 This pushes when ADJUST is positive. ADJUST need not be constant. */
954 anti_adjust_stack (adjust
)
958 adjust
= protect_from_queue (adjust
, 0);
960 if (adjust
== const0_rtx
)
963 /* We expect all variable sized adjustments to be multiple of
964 PREFERRED_STACK_BOUNDARY. */
965 if (GET_CODE (adjust
) == CONST_INT
)
966 stack_pointer_delta
+= INTVAL (adjust
);
968 temp
= expand_binop (Pmode
,
969 #ifdef STACK_GROWS_DOWNWARD
974 stack_pointer_rtx
, adjust
, stack_pointer_rtx
, 0,
977 if (temp
!= stack_pointer_rtx
)
978 emit_move_insn (stack_pointer_rtx
, temp
);
981 /* Round the size of a block to be pushed up to the boundary required
982 by this machine. SIZE is the desired size, which need not be constant. */
988 #ifdef PREFERRED_STACK_BOUNDARY
989 int align
= PREFERRED_STACK_BOUNDARY
/ BITS_PER_UNIT
;
992 if (GET_CODE (size
) == CONST_INT
)
994 int new = (INTVAL (size
) + align
- 1) / align
* align
;
995 if (INTVAL (size
) != new)
996 size
= GEN_INT (new);
1000 /* CEIL_DIV_EXPR needs to worry about the addition overflowing,
1001 but we know it can't. So add ourselves and then do
1003 size
= expand_binop (Pmode
, add_optab
, size
, GEN_INT (align
- 1),
1004 NULL_RTX
, 1, OPTAB_LIB_WIDEN
);
1005 size
= expand_divmod (0, TRUNC_DIV_EXPR
, Pmode
, size
, GEN_INT (align
),
1007 size
= expand_mult (Pmode
, size
, GEN_INT (align
), NULL_RTX
, 1);
1009 #endif /* PREFERRED_STACK_BOUNDARY */
1013 /* Save the stack pointer for the purpose in SAVE_LEVEL. PSAVE is a pointer
1014 to a previously-created save area. If no save area has been allocated,
1015 this function will allocate one. If a save area is specified, it
1016 must be of the proper mode.
1018 The insns are emitted after insn AFTER, if nonzero, otherwise the insns
1019 are emitted at the current position. */
1022 emit_stack_save (save_level
, psave
, after
)
1023 enum save_level save_level
;
1028 /* The default is that we use a move insn and save in a Pmode object. */
1029 rtx (*fcn
) PARAMS ((rtx
, rtx
)) = gen_move_insn
;
1030 enum machine_mode mode
= STACK_SAVEAREA_MODE (save_level
);
1032 /* See if this machine has anything special to do for this kind of save. */
1035 #ifdef HAVE_save_stack_block
1037 if (HAVE_save_stack_block
)
1038 fcn
= gen_save_stack_block
;
1041 #ifdef HAVE_save_stack_function
1043 if (HAVE_save_stack_function
)
1044 fcn
= gen_save_stack_function
;
1047 #ifdef HAVE_save_stack_nonlocal
1049 if (HAVE_save_stack_nonlocal
)
1050 fcn
= gen_save_stack_nonlocal
;
1057 /* If there is no save area and we have to allocate one, do so. Otherwise
1058 verify the save area is the proper mode. */
1062 if (mode
!= VOIDmode
)
1064 if (save_level
== SAVE_NONLOCAL
)
1065 *psave
= sa
= assign_stack_local (mode
, GET_MODE_SIZE (mode
), 0);
1067 *psave
= sa
= gen_reg_rtx (mode
);
1072 if (mode
== VOIDmode
|| GET_MODE (sa
) != mode
)
1081 /* We must validize inside the sequence, to ensure that any instructions
1082 created by the validize call also get moved to the right place. */
1084 sa
= validize_mem (sa
);
1085 emit_insn (fcn (sa
, stack_pointer_rtx
));
1086 seq
= gen_sequence ();
1088 emit_insn_after (seq
, after
);
1093 sa
= validize_mem (sa
);
1094 emit_insn (fcn (sa
, stack_pointer_rtx
));
1098 /* Restore the stack pointer for the purpose in SAVE_LEVEL. SA is the save
1099 area made by emit_stack_save. If it is zero, we have nothing to do.
1101 Put any emitted insns after insn AFTER, if nonzero, otherwise at
1102 current position. */
1105 emit_stack_restore (save_level
, sa
, after
)
1106 enum save_level save_level
;
1110 /* The default is that we use a move insn. */
1111 rtx (*fcn
) PARAMS ((rtx
, rtx
)) = gen_move_insn
;
1113 /* See if this machine has anything special to do for this kind of save. */
1116 #ifdef HAVE_restore_stack_block
1118 if (HAVE_restore_stack_block
)
1119 fcn
= gen_restore_stack_block
;
1122 #ifdef HAVE_restore_stack_function
1124 if (HAVE_restore_stack_function
)
1125 fcn
= gen_restore_stack_function
;
1128 #ifdef HAVE_restore_stack_nonlocal
1130 if (HAVE_restore_stack_nonlocal
)
1131 fcn
= gen_restore_stack_nonlocal
;
1139 sa
= validize_mem (sa
);
1146 emit_insn (fcn (stack_pointer_rtx
, sa
));
1147 seq
= gen_sequence ();
1149 emit_insn_after (seq
, after
);
1152 emit_insn (fcn (stack_pointer_rtx
, sa
));
1155 #ifdef SETJMP_VIA_SAVE_AREA
1156 /* Optimize RTL generated by allocate_dynamic_stack_space for targets
1157 where SETJMP_VIA_SAVE_AREA is true. The problem is that on these
1158 platforms, the dynamic stack space used can corrupt the original
1159 frame, thus causing a crash if a longjmp unwinds to it. */
1162 optimize_save_area_alloca (insns
)
1167 for (insn
= insns
; insn
; insn
= NEXT_INSN(insn
))
1171 if (GET_CODE (insn
) != INSN
)
1174 for (note
= REG_NOTES (insn
); note
; note
= XEXP (note
, 1))
1176 if (REG_NOTE_KIND (note
) != REG_SAVE_AREA
)
1179 if (!current_function_calls_setjmp
)
1181 rtx pat
= PATTERN (insn
);
1183 /* If we do not see the note in a pattern matching
1184 these precise characteristics, we did something
1185 entirely wrong in allocate_dynamic_stack_space.
1187 Note, one way this could happen is if SETJMP_VIA_SAVE_AREA
1188 was defined on a machine where stacks grow towards higher
1191 Right now only supported port with stack that grow upward
1192 is the HPPA and it does not define SETJMP_VIA_SAVE_AREA. */
1193 if (GET_CODE (pat
) != SET
1194 || SET_DEST (pat
) != stack_pointer_rtx
1195 || GET_CODE (SET_SRC (pat
)) != MINUS
1196 || XEXP (SET_SRC (pat
), 0) != stack_pointer_rtx
)
1199 /* This will now be transformed into a (set REG REG)
1200 so we can just blow away all the other notes. */
1201 XEXP (SET_SRC (pat
), 1) = XEXP (note
, 0);
1202 REG_NOTES (insn
) = NULL_RTX
;
1206 /* setjmp was called, we must remove the REG_SAVE_AREA
1207 note so that later passes do not get confused by its
1209 if (note
== REG_NOTES (insn
))
1211 REG_NOTES (insn
) = XEXP (note
, 1);
1217 for (srch
= REG_NOTES (insn
); srch
; srch
= XEXP (srch
, 1))
1218 if (XEXP (srch
, 1) == note
)
1221 if (srch
== NULL_RTX
)
1224 XEXP (srch
, 1) = XEXP (note
, 1);
1227 /* Once we've seen the note of interest, we need not look at
1228 the rest of them. */
1233 #endif /* SETJMP_VIA_SAVE_AREA */
1235 /* Return an rtx representing the address of an area of memory dynamically
1236 pushed on the stack. This region of memory is always aligned to
1237 a multiple of BIGGEST_ALIGNMENT.
1239 Any required stack pointer alignment is preserved.
1241 SIZE is an rtx representing the size of the area.
1242 TARGET is a place in which the address can be placed.
1244 KNOWN_ALIGN is the alignment (in bits) that we know SIZE has. */
1247 allocate_dynamic_stack_space (size
, target
, known_align
)
1252 #ifdef SETJMP_VIA_SAVE_AREA
1253 rtx setjmpless_size
= NULL_RTX
;
1256 /* If we're asking for zero bytes, it doesn't matter what we point
1257 to since we can't dereference it. But return a reasonable
1259 if (size
== const0_rtx
)
1260 return virtual_stack_dynamic_rtx
;
1262 /* Otherwise, show we're calling alloca or equivalent. */
1263 current_function_calls_alloca
= 1;
1265 /* Ensure the size is in the proper mode. */
1266 if (GET_MODE (size
) != VOIDmode
&& GET_MODE (size
) != Pmode
)
1267 size
= convert_to_mode (Pmode
, size
, 1);
1269 /* We can't attempt to minimize alignment necessary, because we don't
1270 know the final value of preferred_stack_boundary yet while executing
1272 #ifdef PREFERRED_STACK_BOUNDARY
1273 cfun
->preferred_stack_boundary
= PREFERRED_STACK_BOUNDARY
;
1276 /* We will need to ensure that the address we return is aligned to
1277 BIGGEST_ALIGNMENT. If STACK_DYNAMIC_OFFSET is defined, we don't
1278 always know its final value at this point in the compilation (it
1279 might depend on the size of the outgoing parameter lists, for
1280 example), so we must align the value to be returned in that case.
1281 (Note that STACK_DYNAMIC_OFFSET will have a default non-zero value if
1282 STACK_POINTER_OFFSET or ACCUMULATE_OUTGOING_ARGS are defined).
1283 We must also do an alignment operation on the returned value if
1284 the stack pointer alignment is less strict that BIGGEST_ALIGNMENT.
1286 If we have to align, we must leave space in SIZE for the hole
1287 that might result from the alignment operation. */
1289 #if defined (STACK_DYNAMIC_OFFSET) || defined (STACK_POINTER_OFFSET) || ! defined (PREFERRED_STACK_BOUNDARY)
1290 #define MUST_ALIGN 1
1292 #define MUST_ALIGN (PREFERRED_STACK_BOUNDARY < BIGGEST_ALIGNMENT)
1297 if (GET_CODE (size
) == CONST_INT
)
1298 size
= GEN_INT (INTVAL (size
)
1299 + (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
- 1));
1301 size
= expand_binop (Pmode
, add_optab
, size
,
1302 GEN_INT (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
- 1),
1303 NULL_RTX
, 1, OPTAB_LIB_WIDEN
);
1306 #ifdef SETJMP_VIA_SAVE_AREA
1307 /* If setjmp restores regs from a save area in the stack frame,
1308 avoid clobbering the reg save area. Note that the offset of
1309 virtual_incoming_args_rtx includes the preallocated stack args space.
1310 It would be no problem to clobber that, but it's on the wrong side
1311 of the old save area. */
1314 = expand_binop (Pmode
, sub_optab
, virtual_stack_dynamic_rtx
,
1315 stack_pointer_rtx
, NULL_RTX
, 1, OPTAB_LIB_WIDEN
);
1317 if (!current_function_calls_setjmp
)
1319 int align
= PREFERRED_STACK_BOUNDARY
/ BITS_PER_UNIT
;
1321 /* See optimize_save_area_alloca to understand what is being
1324 #if !defined(PREFERRED_STACK_BOUNDARY) || !defined(MUST_ALIGN) || (PREFERRED_STACK_BOUNDARY != BIGGEST_ALIGNMENT)
1325 /* If anyone creates a target with these characteristics, let them
1326 know that our optimization cannot work correctly in such a case. */
1330 if (GET_CODE (size
) == CONST_INT
)
1332 int new = INTVAL (size
) / align
* align
;
1334 if (INTVAL (size
) != new)
1335 setjmpless_size
= GEN_INT (new);
1337 setjmpless_size
= size
;
1341 /* Since we know overflow is not possible, we avoid using
1342 CEIL_DIV_EXPR and use TRUNC_DIV_EXPR instead. */
1343 setjmpless_size
= expand_divmod (0, TRUNC_DIV_EXPR
, Pmode
, size
,
1344 GEN_INT (align
), NULL_RTX
, 1);
1345 setjmpless_size
= expand_mult (Pmode
, setjmpless_size
,
1346 GEN_INT (align
), NULL_RTX
, 1);
1348 /* Our optimization works based upon being able to perform a simple
1349 transformation of this RTL into a (set REG REG) so make sure things
1350 did in fact end up in a REG. */
1351 if (!register_operand (setjmpless_size
, Pmode
))
1352 setjmpless_size
= force_reg (Pmode
, setjmpless_size
);
1355 size
= expand_binop (Pmode
, add_optab
, size
, dynamic_offset
,
1356 NULL_RTX
, 1, OPTAB_LIB_WIDEN
);
1358 #endif /* SETJMP_VIA_SAVE_AREA */
1360 /* Round the size to a multiple of the required stack alignment.
1361 Since the stack if presumed to be rounded before this allocation,
1362 this will maintain the required alignment.
1364 If the stack grows downward, we could save an insn by subtracting
1365 SIZE from the stack pointer and then aligning the stack pointer.
1366 The problem with this is that the stack pointer may be unaligned
1367 between the execution of the subtraction and alignment insns and
1368 some machines do not allow this. Even on those that do, some
1369 signal handlers malfunction if a signal should occur between those
1370 insns. Since this is an extremely rare event, we have no reliable
1371 way of knowing which systems have this problem. So we avoid even
1372 momentarily mis-aligning the stack. */
1374 #ifdef PREFERRED_STACK_BOUNDARY
1375 /* If we added a variable amount to SIZE,
1376 we can no longer assume it is aligned. */
1377 #if !defined (SETJMP_VIA_SAVE_AREA)
1378 if (MUST_ALIGN
|| known_align
% PREFERRED_STACK_BOUNDARY
!= 0)
1380 size
= round_push (size
);
1383 do_pending_stack_adjust ();
1385 /* We ought to be called always on the toplevel and stack ought to be aligned
1387 #ifdef PREFERRED_STACK_BOUNDARY
1388 if (stack_pointer_delta
% (PREFERRED_STACK_BOUNDARY
/ BITS_PER_UNIT
))
1392 /* If needed, check that we have the required amount of stack. Take into
1393 account what has already been checked. */
1394 if (flag_stack_check
&& ! STACK_CHECK_BUILTIN
)
1395 probe_stack_range (STACK_CHECK_MAX_FRAME_SIZE
+ STACK_CHECK_PROTECT
, size
);
1397 /* Don't use a TARGET that isn't a pseudo. */
1398 if (target
== 0 || GET_CODE (target
) != REG
1399 || REGNO (target
) < FIRST_PSEUDO_REGISTER
)
1400 target
= gen_reg_rtx (Pmode
);
1402 mark_reg_pointer (target
, known_align
);
1404 /* Perform the required allocation from the stack. Some systems do
1405 this differently than simply incrementing/decrementing from the
1406 stack pointer, such as acquiring the space by calling malloc(). */
1407 #ifdef HAVE_allocate_stack
1408 if (HAVE_allocate_stack
)
1410 enum machine_mode mode
= STACK_SIZE_MODE
;
1411 insn_operand_predicate_fn pred
;
1413 pred
= insn_data
[(int) CODE_FOR_allocate_stack
].operand
[0].predicate
;
1414 if (pred
&& ! ((*pred
) (target
, Pmode
)))
1415 #ifdef POINTERS_EXTEND_UNSIGNED
1416 target
= convert_memory_address (Pmode
, target
);
1418 target
= copy_to_mode_reg (Pmode
, target
);
1421 if (mode
== VOIDmode
)
1424 size
= convert_modes (mode
, ptr_mode
, size
, 1);
1425 pred
= insn_data
[(int) CODE_FOR_allocate_stack
].operand
[1].predicate
;
1426 if (pred
&& ! ((*pred
) (size
, mode
)))
1427 size
= copy_to_mode_reg (mode
, size
);
1429 emit_insn (gen_allocate_stack (target
, size
));
1434 #ifndef STACK_GROWS_DOWNWARD
1435 emit_move_insn (target
, virtual_stack_dynamic_rtx
);
1437 size
= convert_modes (Pmode
, ptr_mode
, size
, 1);
1439 /* Check stack bounds if necessary. */
1440 if (current_function_limit_stack
)
1443 rtx space_available
= gen_label_rtx ();
1444 #ifdef STACK_GROWS_DOWNWARD
1445 available
= expand_binop (Pmode
, sub_optab
,
1446 stack_pointer_rtx
, stack_limit_rtx
,
1447 NULL_RTX
, 1, OPTAB_WIDEN
);
1449 available
= expand_binop (Pmode
, sub_optab
,
1450 stack_limit_rtx
, stack_pointer_rtx
,
1451 NULL_RTX
, 1, OPTAB_WIDEN
);
1453 emit_cmp_and_jump_insns (available
, size
, GEU
, NULL_RTX
, Pmode
, 1,
1454 0, space_available
);
1457 emit_insn (gen_trap ());
1460 error ("stack limits not supported on this target");
1462 emit_label (space_available
);
1465 anti_adjust_stack (size
);
1466 #ifdef SETJMP_VIA_SAVE_AREA
1467 if (setjmpless_size
!= NULL_RTX
)
1469 rtx note_target
= get_last_insn ();
1471 REG_NOTES (note_target
)
1472 = gen_rtx_EXPR_LIST (REG_SAVE_AREA
, setjmpless_size
,
1473 REG_NOTES (note_target
));
1475 #endif /* SETJMP_VIA_SAVE_AREA */
1476 #ifdef STACK_GROWS_DOWNWARD
1477 emit_move_insn (target
, virtual_stack_dynamic_rtx
);
1483 /* CEIL_DIV_EXPR needs to worry about the addition overflowing,
1484 but we know it can't. So add ourselves and then do
1486 target
= expand_binop (Pmode
, add_optab
, target
,
1487 GEN_INT (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
- 1),
1488 NULL_RTX
, 1, OPTAB_LIB_WIDEN
);
1489 target
= expand_divmod (0, TRUNC_DIV_EXPR
, Pmode
, target
,
1490 GEN_INT (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
),
1492 target
= expand_mult (Pmode
, target
,
1493 GEN_INT (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
),
1497 /* Some systems require a particular insn to refer to the stack
1498 to make the pages exist. */
1501 emit_insn (gen_probe ());
1504 /* Record the new stack level for nonlocal gotos. */
1505 if (nonlocal_goto_handler_slots
!= 0)
1506 emit_stack_save (SAVE_NONLOCAL
, &nonlocal_goto_stack_level
, NULL_RTX
);
1511 /* A front end may want to override GCC's stack checking by providing a
1512 run-time routine to call to check the stack, so provide a mechanism for
1513 calling that routine. */
1515 static rtx stack_check_libfunc
;
1518 set_stack_check_libfunc (libfunc
)
1521 stack_check_libfunc
= libfunc
;
1524 /* Emit one stack probe at ADDRESS, an address within the stack. */
1527 emit_stack_probe (address
)
1530 rtx memref
= gen_rtx_MEM (word_mode
, address
);
1532 MEM_VOLATILE_P (memref
) = 1;
1534 if (STACK_CHECK_PROBE_LOAD
)
1535 emit_move_insn (gen_reg_rtx (word_mode
), memref
);
1537 emit_move_insn (memref
, const0_rtx
);
1540 /* Probe a range of stack addresses from FIRST to FIRST+SIZE, inclusive.
1541 FIRST is a constant and size is a Pmode RTX. These are offsets from the
1542 current stack pointer. STACK_GROWS_DOWNWARD says whether to add or
1543 subtract from the stack. If SIZE is constant, this is done
1544 with a fixed number of probes. Otherwise, we must make a loop. */
1546 #ifdef STACK_GROWS_DOWNWARD
1547 #define STACK_GROW_OP MINUS
1549 #define STACK_GROW_OP PLUS
1553 probe_stack_range (first
, size
)
1554 HOST_WIDE_INT first
;
1557 /* First see if the front end has set up a function for us to call to
1559 if (stack_check_libfunc
!= 0)
1560 emit_library_call (stack_check_libfunc
, 0, VOIDmode
, 1,
1561 memory_address (QImode
,
1562 gen_rtx (STACK_GROW_OP
, Pmode
,
1564 plus_constant (size
, first
))),
1567 /* Next see if we have an insn to check the stack. Use it if so. */
1568 #ifdef HAVE_check_stack
1569 else if (HAVE_check_stack
)
1571 insn_operand_predicate_fn pred
;
1573 = force_operand (gen_rtx_STACK_GROW_OP (Pmode
,
1575 plus_constant (size
, first
)),
1578 pred
= insn_data
[(int) CODE_FOR_check_stack
].operand
[0].predicate
;
1579 if (pred
&& ! ((*pred
) (last_addr
, Pmode
)))
1580 last_addr
= copy_to_mode_reg (Pmode
, last_addr
);
1582 emit_insn (gen_check_stack (last_addr
));
1586 /* If we have to generate explicit probes, see if we have a constant
1587 small number of them to generate. If so, that's the easy case. */
1588 else if (GET_CODE (size
) == CONST_INT
1589 && INTVAL (size
) < 10 * STACK_CHECK_PROBE_INTERVAL
)
1591 HOST_WIDE_INT offset
;
1593 /* Start probing at FIRST + N * STACK_CHECK_PROBE_INTERVAL
1594 for values of N from 1 until it exceeds LAST. If only one
1595 probe is needed, this will not generate any code. Then probe
1597 for (offset
= first
+ STACK_CHECK_PROBE_INTERVAL
;
1598 offset
< INTVAL (size
);
1599 offset
= offset
+ STACK_CHECK_PROBE_INTERVAL
)
1600 emit_stack_probe (gen_rtx_fmt_ee (STACK_GROW_OP
, Pmode
,
1604 emit_stack_probe (gen_rtx_fmt_ee (STACK_GROW_OP
, Pmode
,
1606 plus_constant (size
, first
)));
1609 /* In the variable case, do the same as above, but in a loop. We emit loop
1610 notes so that loop optimization can be done. */
1614 = force_operand (gen_rtx_fmt_ee (STACK_GROW_OP
, Pmode
,
1616 GEN_INT (first
+ STACK_CHECK_PROBE_INTERVAL
)),
1619 = force_operand (gen_rtx_fmt_ee (STACK_GROW_OP
, Pmode
,
1621 plus_constant (size
, first
)),
1623 rtx incr
= GEN_INT (STACK_CHECK_PROBE_INTERVAL
);
1624 rtx loop_lab
= gen_label_rtx ();
1625 rtx test_lab
= gen_label_rtx ();
1626 rtx end_lab
= gen_label_rtx ();
1629 if (GET_CODE (test_addr
) != REG
1630 || REGNO (test_addr
) < FIRST_PSEUDO_REGISTER
)
1631 test_addr
= force_reg (Pmode
, test_addr
);
1633 emit_note (NULL_PTR
, NOTE_INSN_LOOP_BEG
);
1634 emit_jump (test_lab
);
1636 emit_label (loop_lab
);
1637 emit_stack_probe (test_addr
);
1639 emit_note (NULL_PTR
, NOTE_INSN_LOOP_CONT
);
1641 #ifdef STACK_GROWS_DOWNWARD
1642 #define CMP_OPCODE GTU
1643 temp
= expand_binop (Pmode
, sub_optab
, test_addr
, incr
, test_addr
,
1646 #define CMP_OPCODE LTU
1647 temp
= expand_binop (Pmode
, add_optab
, test_addr
, incr
, test_addr
,
1651 if (temp
!= test_addr
)
1654 emit_label (test_lab
);
1655 emit_cmp_and_jump_insns (test_addr
, last_addr
, CMP_OPCODE
,
1656 NULL_RTX
, Pmode
, 1, 0, loop_lab
);
1657 emit_jump (end_lab
);
1658 emit_note (NULL_PTR
, NOTE_INSN_LOOP_END
);
1659 emit_label (end_lab
);
1661 emit_stack_probe (last_addr
);
1665 /* Return an rtx representing the register or memory location
1666 in which a scalar value of data type VALTYPE
1667 was returned by a function call to function FUNC.
1668 FUNC is a FUNCTION_DECL node if the precise function is known,
1670 OUTGOING is 1 if on a machine with register windows this function
1671 should return the register in which the function will put its result
1675 hard_function_value (valtype
, func
, outgoing
)
1677 tree func ATTRIBUTE_UNUSED
;
1678 int outgoing ATTRIBUTE_UNUSED
;
1682 #ifdef FUNCTION_OUTGOING_VALUE
1684 val
= FUNCTION_OUTGOING_VALUE (valtype
, func
);
1687 val
= FUNCTION_VALUE (valtype
, func
);
1689 if (GET_CODE (val
) == REG
1690 && GET_MODE (val
) == BLKmode
)
1692 unsigned HOST_WIDE_INT bytes
= int_size_in_bytes (valtype
);
1693 enum machine_mode tmpmode
;
1695 for (tmpmode
= GET_CLASS_NARROWEST_MODE (MODE_INT
);
1696 tmpmode
!= VOIDmode
;
1697 tmpmode
= GET_MODE_WIDER_MODE (tmpmode
))
1699 /* Have we found a large enough mode? */
1700 if (GET_MODE_SIZE (tmpmode
) >= bytes
)
1704 /* No suitable mode found. */
1705 if (tmpmode
== VOIDmode
)
1708 PUT_MODE (val
, tmpmode
);
1713 /* Return an rtx representing the register or memory location
1714 in which a scalar value of mode MODE was returned by a library call. */
1717 hard_libcall_value (mode
)
1718 enum machine_mode mode
;
1720 return LIBCALL_VALUE (mode
);
1723 /* Look up the tree code for a given rtx code
1724 to provide the arithmetic operation for REAL_ARITHMETIC.
1725 The function returns an int because the caller may not know
1726 what `enum tree_code' means. */
1729 rtx_to_tree_code (code
)
1732 enum tree_code tcode
;
1755 tcode
= LAST_AND_UNUSED_TREE_CODE
;
1758 return ((int) tcode
);