+2004-06-26 Richard Henderson <rth@redhat.com>
+
+ * calls.c (combine_pending_stack_adjustment_and_call): Make
+ preferred_unit_stack_boundary argument unsigned. Make
+ unadjusted_alignment unsigned.
+ (expand_call): Make preferred_stack_boundary and
+ preferred_unit_stack_boundary variables unsigned.
+ * function.c (assign_stack_local_1): Make alignment unsigned.
+ * function.h (struct function): Make stack_alignment_needed,
+ preferred_stack_boundary unsigned.
+ * config/i386/i386.c (ix86_preferred_stack_boundary): Make unsigned.
+ (ix86_compute_frame_layout): Make stack_alignment_needed,
+ preferred_alignment variables unsigned.
+ * config/i386/i386.h (ix86_preferred_stack_boundary): Make unsigned.
+
2004-07-26 Tom Tromey <tromey@redhat.com>
* tree.h: Fix typo in comment.
static int check_sibcall_argument_overlap (rtx, struct arg_data *, int);
static int combine_pending_stack_adjustment_and_call (int, struct args_size *,
- int);
+ unsigned int);
static tree fix_unsafe_tree (tree);
static bool shift_returned_value (tree, rtx *);
static int
combine_pending_stack_adjustment_and_call (int unadjusted_args_size,
struct args_size *args_size,
- int preferred_unit_stack_boundary)
+ unsigned int preferred_unit_stack_boundary)
{
/* The number of bytes to pop so that the stack will be
under-aligned by UNADJUSTED_ARGS_SIZE bytes. */
HOST_WIDE_INT adjustment;
/* The alignment of the stack after the arguments are pushed, if we
just pushed the arguments without adjust the stack here. */
- HOST_WIDE_INT unadjusted_alignment;
+ unsigned HOST_WIDE_INT unadjusted_alignment;
unadjusted_alignment
= ((stack_pointer_delta + unadjusted_args_size)
tree addr = TREE_OPERAND (exp, 0);
int i;
/* The alignment of the stack, in bits. */
- HOST_WIDE_INT preferred_stack_boundary;
+ unsigned HOST_WIDE_INT preferred_stack_boundary;
/* The alignment of the stack, in bytes. */
- HOST_WIDE_INT preferred_unit_stack_boundary;
+ unsigned HOST_WIDE_INT preferred_unit_stack_boundary;
/* The static chain value to use for this call. */
rtx static_chain_value;
/* See if this is "nothrow" function call. */
const char *ix86_preferred_stack_boundary_string;
/* Preferred alignment for stack boundary in bits. */
-int ix86_preferred_stack_boundary;
+unsigned int ix86_preferred_stack_boundary;
/* Values 1-5: see jump.c */
int ix86_branch_cost;
ix86_compute_frame_layout (struct ix86_frame *frame)
{
HOST_WIDE_INT total_size;
- int stack_alignment_needed = cfun->stack_alignment_needed / BITS_PER_UNIT;
+ unsigned int stack_alignment_needed;
HOST_WIDE_INT offset;
- int preferred_alignment = cfun->preferred_stack_boundary / BITS_PER_UNIT;
+ unsigned int preferred_alignment;
HOST_WIDE_INT size = get_frame_size ();
frame->nregs = ix86_nsaved_regs ();
total_size = size;
+ stack_alignment_needed = cfun->stack_alignment_needed / BITS_PER_UNIT;
+ preferred_alignment = cfun->preferred_stack_boundary / BITS_PER_UNIT;
+
/* During reload iteration the amount of registers saved can change.
Recompute the value as needed. Do not recompute when amount of registers
didn't change as reload does mutiple calls to the function and does not
extern int ix86_regparm;
extern const char *ix86_regparm_string;
-extern int ix86_preferred_stack_boundary;
+extern unsigned int ix86_preferred_stack_boundary;
extern const char *ix86_preferred_stack_boundary_string;
extern int ix86_branch_cost;
{
rtx x, addr;
int bigend_correction = 0;
- int alignment;
+ unsigned int alignment;
int frame_off, frame_alignment, frame_phase;
if (align == 0)
/* tm.h can use this to store whatever it likes. */
struct machine_function * GTY ((maybe_undef)) machine;
/* The largest alignment of slot allocated on the stack. */
- int stack_alignment_needed;
+ unsigned int stack_alignment_needed;
/* Preferred alignment of the end of stack frame. */
- int preferred_stack_boundary;
+ unsigned int preferred_stack_boundary;
/* Set when the call to function itself has been emit. */
bool recursive_call_emit;
/* Set when the tail call has been produced. */