#include "coretypes.h"
#include "tm.h"
#include "diagnostic-core.h"
-#include "toplev.h"
#include "rtl.h"
#include "tree.h"
#include "tm_p.h"
}
\f
/* Return an rtx representing the address of an area of memory dynamically
- pushed on the stack. This region of memory is always aligned to
- a multiple of BIGGEST_ALIGNMENT.
+ pushed on the stack.
Any required stack pointer alignment is preserved.
SIZE is an rtx representing the size of the area.
- TARGET is a place in which the address can be placed.
- KNOWN_ALIGN is the alignment (in bits) that we know SIZE has.
+ SIZE_ALIGN is the alignment (in bits) that we know SIZE has. This
+ parameter may be zero. If so, a proper value will be extracted
+ from SIZE if it is constant, otherwise BITS_PER_UNIT will be assumed.
+
+ REQUIRED_ALIGN is the alignment (in bits) required for the region
+ of memory.
If CANNOT_ACCUMULATE is set to TRUE, the caller guarantees that the
stack space allocated by the generated code cannot be added with itself
loops to it executes the associated deallocation code. */
rtx
-allocate_dynamic_stack_space (rtx size, rtx target, int known_align,
- bool cannot_accumulate)
+allocate_dynamic_stack_space (rtx size, unsigned size_align,
+ unsigned required_align, bool cannot_accumulate)
{
HOST_WIDE_INT stack_usage_size = -1;
- bool known_align_valid = true;
- rtx final_label, final_target;
+ rtx final_label, final_target, target;
+ bool must_align;
/* If we're asking for zero bytes, it doesn't matter what we point
to since we can't dereference it. But return a reasonable
if (GET_MODE (size) != VOIDmode && GET_MODE (size) != Pmode)
size = convert_to_mode (Pmode, size, 1);
+ /* Adjust SIZE_ALIGN, if needed. */
+ if (CONST_INT_P (size))
+ {
+ unsigned HOST_WIDE_INT lsb;
+
+ lsb = INTVAL (size);
+ lsb &= -lsb;
+
+ /* Watch out for overflow truncating to "unsigned". */
+ if (lsb > UINT_MAX / BITS_PER_UNIT)
+ size_align = 1u << (HOST_BITS_PER_INT - 1);
+ else
+ size_align = (unsigned)lsb * BITS_PER_UNIT;
+ }
+ else if (size_align < BITS_PER_UNIT)
+ size_align = BITS_PER_UNIT;
+
/* We can't attempt to minimize alignment necessary, because we don't
know the final value of preferred_stack_boundary yet while executing
this code. */
crtl->preferred_stack_boundary = PREFERRED_STACK_BOUNDARY;
/* We will need to ensure that the address we return is aligned to
- BIGGEST_ALIGNMENT. If STACK_DYNAMIC_OFFSET is defined, we don't
+ REQUIRED_ALIGN. If STACK_DYNAMIC_OFFSET is defined, we don't
always know its final value at this point in the compilation (it
might depend on the size of the outgoing parameter lists, for
example), so we must align the value to be returned in that case.
(Note that STACK_DYNAMIC_OFFSET will have a default nonzero value if
STACK_POINTER_OFFSET or ACCUMULATE_OUTGOING_ARGS are defined).
We must also do an alignment operation on the returned value if
- the stack pointer alignment is less strict that BIGGEST_ALIGNMENT.
+ the stack pointer alignment is less strict than REQUIRED_ALIGN.
If we have to align, we must leave space in SIZE for the hole
that might result from the alignment operation. */
+ must_align = (crtl->preferred_stack_boundary < required_align);
#if defined (STACK_DYNAMIC_OFFSET) || defined (STACK_POINTER_OFFSET)
-#define MUST_ALIGN 1
-#else
-#define MUST_ALIGN (crtl->preferred_stack_boundary < BIGGEST_ALIGNMENT)
+ must_align = true;
#endif
- if (MUST_ALIGN)
+ if (must_align)
{
- size
- = force_operand (plus_constant (size,
- BIGGEST_ALIGNMENT / BITS_PER_UNIT - 1),
- NULL_RTX);
+ unsigned extra, extra_align;
+
+ if (required_align > PREFERRED_STACK_BOUNDARY)
+ extra_align = PREFERRED_STACK_BOUNDARY;
+ else if (required_align > STACK_BOUNDARY)
+ extra_align = STACK_BOUNDARY;
+ else
+ extra_align = BITS_PER_UNIT;
+ extra = (required_align - extra_align) / BITS_PER_UNIT;
+
+ size = plus_constant (size, extra);
+ size = force_operand (size, NULL_RTX);
if (flag_stack_usage)
- stack_usage_size += BIGGEST_ALIGNMENT / BITS_PER_UNIT - 1;
+ stack_usage_size += extra;
- known_align_valid = false;
+ if (extra && size_align > extra_align)
+ size_align = extra_align;
}
#ifdef SETJMP_VIA_SAVE_AREA
if (flag_stack_usage)
current_function_dynamic_alloc_count++;
- known_align_valid = false;
+ /* ??? Can we infer a minimum of STACK_BOUNDARY here? */
+ size_align = BITS_PER_UNIT;
}
#endif /* SETJMP_VIA_SAVE_AREA */
insns. Since this is an extremely rare event, we have no reliable
way of knowing which systems have this problem. So we avoid even
momentarily mis-aligning the stack. */
- if (!known_align_valid || known_align % MAX_SUPPORTED_STACK_ALIGNMENT != 0)
+ if (size_align % MAX_SUPPORTED_STACK_ALIGNMENT != 0)
{
size = round_push (size);
}
}
- /* Don't use a TARGET that isn't a pseudo or is the wrong mode. */
- if (target == 0 || !REG_P (target)
- || REGNO (target) < FIRST_PSEUDO_REGISTER
- || GET_MODE (target) != Pmode)
- target = gen_reg_rtx (Pmode);
-
- mark_reg_pointer (target, known_align);
+ target = gen_reg_rtx (Pmode);
/* The size is supposed to be fully adjusted at this point so record it
if stack usage info is requested. */
least it doesn't cause a stack overflow. */
if (flag_split_stack)
{
- rtx available_label, space, func;
+ rtx available_label, ask, space, func;
available_label = NULL_RTX;
}
#endif
+ /* The __morestack_allocate_stack_space function will allocate
+ memory using malloc. If the alignment of the memory returned
+ by malloc does not meet REQUIRED_ALIGN, we increase SIZE to
+ make sure we allocate enough space. */
+ if (MALLOC_ABI_ALIGNMENT >= required_align)
+ ask = size;
+ else
+ {
+ ask = expand_binop (Pmode, add_optab, size,
+ GEN_INT (required_align / BITS_PER_UNIT - 1),
+ NULL_RTX, 1, OPTAB_LIB_WIDEN);
+ must_align = true;
+ }
+
func = init_one_libfunc ("__morestack_allocate_stack_space");
space = emit_library_call_value (func, target, LCT_NORMAL, Pmode,
- 1, size, Pmode);
+ 1, ask, Pmode);
if (available_label == NULL_RTX)
return space;
final_target = gen_reg_rtx (Pmode);
- mark_reg_pointer (final_target, known_align);
emit_move_insn (final_target, space);
#endif
}
- if (MUST_ALIGN)
+ /* Finish up the split stack handling. */
+ if (final_label != NULL_RTX)
+ {
+ gcc_assert (flag_split_stack);
+ emit_move_insn (final_target, target);
+ emit_label (final_label);
+ target = final_target;
+ }
+
+ if (must_align)
{
/* CEIL_DIV_EXPR needs to worry about the addition overflowing,
but we know it can't. So add ourselves and then do
TRUNC_DIV_EXPR. */
target = expand_binop (Pmode, add_optab, target,
- GEN_INT (BIGGEST_ALIGNMENT / BITS_PER_UNIT - 1),
+ GEN_INT (required_align / BITS_PER_UNIT - 1),
NULL_RTX, 1, OPTAB_LIB_WIDEN);
target = expand_divmod (0, TRUNC_DIV_EXPR, Pmode, target,
- GEN_INT (BIGGEST_ALIGNMENT / BITS_PER_UNIT),
+ GEN_INT (required_align / BITS_PER_UNIT),
NULL_RTX, 1);
target = expand_mult (Pmode, target,
- GEN_INT (BIGGEST_ALIGNMENT / BITS_PER_UNIT),
+ GEN_INT (required_align / BITS_PER_UNIT),
NULL_RTX, 1);
}
+ /* Now that we've committed to a return value, mark its alignment. */
+ mark_reg_pointer (target, required_align);
+
/* Record the new stack level for nonlocal gotos. */
if (cfun->nonlocal_goto_save_area != 0)
update_nonlocal_goto_save_area ();
- /* Finish up the split stack handling. */
- if (final_label != NULL_RTX)
- {
- gcc_assert (flag_split_stack);
- emit_move_insn (final_target, target);
- emit_label (final_label);
- target = final_target;
- }
-
return target;
}
\f
OSDN Git Service
