/* Expands front end tree to back end RTL for GCC.
Copyright (C) 1987, 1988, 1989, 1991, 1992, 1993, 1994, 1995, 1996, 1997,
- 1998, 1999, 2000, 2001, 2002, 2003, 2004 Free Software Foundation, Inc.
+ 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005
+ Free Software Foundation, Inc.
This file is part of GCC.
#include "langhooks.h"
#include "target.h"
#include "cfglayout.h"
+#include "tree-gimple.h"
#ifndef LOCAL_ALIGNMENT
#define LOCAL_ALIGNMENT(TYPE, ALIGNMENT) ALIGNMENT
alignment. */
#define CEIL_ROUND(VALUE,ALIGN) (((VALUE) + (ALIGN) - 1) & ~((ALIGN)- 1))
-/* NEED_SEPARATE_AP means that we cannot derive ap from the value of fp
- during rtl generation. If they are different register numbers, this is
- always true. It may also be true if
- FIRST_PARM_OFFSET - STARTING_FRAME_OFFSET is not a constant during rtl
- generation. See fix_lexical_addr for details. */
-
-#if ARG_POINTER_REGNUM != FRAME_POINTER_REGNUM
-#define NEED_SEPARATE_AP
-#endif
-
/* Nonzero if function being compiled doesn't contain any calls
(ignoring the prologue and epilogue). This is set prior to
local register allocation and is valid for the remaining
compiler passes. */
int current_function_is_leaf;
-/* Nonzero if function being compiled doesn't contain any instructions
- that can throw an exception. This is set prior to final. */
-
-int current_function_nothrow;
-
/* Nonzero if function being compiled doesn't modify the stack pointer
(ignoring the prologue and epilogue). This is only valid after
life_analysis has run. */
#ifdef HAVE_return
static void emit_return_into_block (basic_block, rtx);
#endif
-static void purge_single_hard_subreg_set (rtx);
#if defined(HAVE_epilogue) && defined(INCOMING_RETURN_ADDR_RTX)
static rtx keep_stack_depressed (rtx);
#endif
static void do_clobber_return_reg (rtx, void *);
static void do_use_return_reg (rtx, void *);
static void instantiate_virtual_regs_lossage (rtx);
-static tree split_complex_args (tree);
static void set_insn_locators (rtx, int) ATTRIBUTE_UNUSED;
\f
/* Pointer to chain of `struct function' for containing functions. */
if (p->decl == decl)
return p;
- abort ();
+ gcc_unreachable ();
}
/* Save the current context for compilation of a nested function.
outer_function_chain = p->outer;
current_function_decl = p->decl;
- reg_renumber = 0;
-
- restore_emit_status (p);
lang_hooks.function.leave_nested (p);
/* Reset variables that have known state during rtx generation. */
- rtx_equal_function_value_matters = 1;
virtuals_instantiated = 0;
generating_concat_p = 1;
}
/* f->eh->eh_return_stub_label is used by code generation. */
lang_hooks.function.final (f);
- f->stmt = NULL;
}
/* Clear out all parts of the state in F that can safely be discarded
This size counts from zero. It is not rounded to PREFERRED_STACK_BOUNDARY;
the caller may have to do that. */
-HOST_WIDE_INT
+static HOST_WIDE_INT
get_func_frame_size (struct function *f)
{
#ifdef FRAME_GROWS_DOWNWARD
{
rtx x, addr;
int bigend_correction = 0;
- int alignment;
+ unsigned int alignment;
int frame_off, frame_alignment, frame_phase;
if (align == 0)
use logical operations which are unambiguous. */
#ifdef FRAME_GROWS_DOWNWARD
function->x_frame_offset
- = (FLOOR_ROUND (function->x_frame_offset - frame_phase, alignment)
+ = (FLOOR_ROUND (function->x_frame_offset - frame_phase,
+ (unsigned HOST_WIDE_INT) alignment)
+ frame_phase);
#else
function->x_frame_offset
- = (CEIL_ROUND (function->x_frame_offset - frame_phase, alignment)
+ = (CEIL_ROUND (function->x_frame_offset - frame_phase,
+ (unsigned HOST_WIDE_INT) alignment)
+ frame_phase);
#endif
}
static struct temp_slot **
temp_slots_at_level (int level)
{
- level++;
if (!used_temp_slots)
VARRAY_GENERIC_PTR_INIT (used_temp_slots, 3, "used_temp_slots");
KEEP is 1 if this slot is to be retained after a call to
free_temp_slots. Automatic variables for a block are allocated
- with this flag. KEEP is 2 if we allocate a longer term temporary,
- whose lifetime is controlled by CLEANUP_POINT_EXPRs. KEEP is 3
- if we are to allocate something at an inner level to be treated as
- a variable in the block (e.g., a SAVE_EXPR).
+ with this flag. KEEP values of 2 or 3 were needed respectively
+ for variables whose lifetime is controlled by CLEANUP_POINT_EXPRs
+ or for SAVE_EXPRs, but they are now unused and will abort.
TYPE is the type that will be used for the stack slot. */
/* If SIZE is -1 it means that somebody tried to allocate a temporary
of a variable size. */
- if (size == -1)
- abort ();
+ gcc_assert (size != -1);
+
+ /* These are now unused. */
+ gcc_assert (keep <= 1);
if (mode == BLKmode)
align = BIGGEST_ALIGNMENT;
So for requests which depended on the rounding of SIZE, we go ahead
and round it now. We also make sure ALIGNMENT is at least
BIGGEST_ALIGNMENT. */
- if (mode == BLKmode && align < BIGGEST_ALIGNMENT)
- abort ();
+ gcc_assert (mode != BLKmode || align == BIGGEST_ALIGNMENT);
p->slot = assign_stack_local (mode,
(mode == BLKmode
? CEIL_ROUND (size, (int) align / BITS_PER_UNIT)
p->in_use = 1;
p->addr_taken = 0;
p->type = type;
-
- if (keep == 2)
- {
- p->level = target_temp_slot_level;
- p->keep = 1;
- }
- else if (keep == 3)
- {
- p->level = var_temp_slot_level;
- p->keep = 0;
- }
- else
- {
- p->level = temp_slot_level;
- p->keep = keep;
- }
+ p->level = temp_slot_level;
+ p->keep = keep;
pp = temp_slots_at_level (p->level);
insert_slot_to_list (p, pp);
/* If a type is specified, set the relevant flags. */
if (type != 0)
{
- RTX_UNCHANGING_P (slot) = (lang_hooks.honor_readonly
- && TYPE_READONLY (type));
MEM_VOLATILE_P (slot) = TYPE_VOLATILE (type);
MEM_SET_IN_STRUCT_P (slot, AGGREGATE_TYPE_P (type));
}
/* If we still haven't been able to get a size, see if the language
can compute a maximum size. */
if (size == -1
- && (size_tree = lang_hooks.type_max_size (type)) != 0
+ && (size_tree = lang_hooks.types.max_size (type)) != 0
&& host_integerp (size_tree, 1))
size = tree_low_cst (size_tree, 1);
if (decl && size == -1
&& TREE_CODE (TYPE_SIZE_UNIT (type)) == INTEGER_CST)
{
- error ("%Jsize of variable '%D' is too large", decl, decl);
+ error ("%Jsize of variable %qD is too large", decl, decl);
size = 1;
}
done for BLKmode slots because we can be sure that we won't have alignment
problems in this case. */
-void
+static void
combine_temp_slots (void)
{
struct temp_slot *p, *q, *next, *next_q;
avail_temp_slots = 0;
used_temp_slots = 0;
temp_slot_level = 0;
- var_temp_slot_level = 0;
- target_temp_slot_level = 0;
}
\f
/* These routines are responsible for converting virtual register references
#endif
\f
-/* Convert a SET of a hard subreg to a set of the appropriate hard
- register. A subroutine of purge_hard_subreg_sets. */
-
-static void
-purge_single_hard_subreg_set (rtx pattern)
-{
- rtx reg = SET_DEST (pattern);
- enum machine_mode mode = GET_MODE (SET_DEST (pattern));
- int offset = 0;
-
- if (GET_CODE (reg) == SUBREG && REG_P (SUBREG_REG (reg))
- && REGNO (SUBREG_REG (reg)) < FIRST_PSEUDO_REGISTER)
- {
- offset = subreg_regno_offset (REGNO (SUBREG_REG (reg)),
- GET_MODE (SUBREG_REG (reg)),
- SUBREG_BYTE (reg),
- GET_MODE (reg));
- reg = SUBREG_REG (reg);
- }
-
-
- if (REG_P (reg) && REGNO (reg) < FIRST_PSEUDO_REGISTER)
- {
- reg = gen_rtx_REG (mode, REGNO (reg) + offset);
- SET_DEST (pattern) = reg;
- }
-}
-
-/* Eliminate all occurrences of SETs of hard subregs from INSNS. The
- only such SETs that we expect to see are those left in because
- integrate can't handle sets of parts of a return value register.
-
- We don't use alter_subreg because we only want to eliminate subregs
- of hard registers. */
-
-void
-purge_hard_subreg_sets (rtx insn)
-{
- for (; insn; insn = NEXT_INSN (insn))
- {
- if (INSN_P (insn))
- {
- rtx pattern = PATTERN (insn);
- switch (GET_CODE (pattern))
- {
- case SET:
- if (GET_CODE (SET_DEST (pattern)) == SUBREG)
- purge_single_hard_subreg_set (pattern);
- break;
- case PARALLEL:
- {
- int j;
- for (j = XVECLEN (pattern, 0) - 1; j >= 0; j--)
- {
- rtx inner_pattern = XVECEXP (pattern, 0, j);
- if (GET_CODE (inner_pattern) == SET
- && GET_CODE (SET_DEST (inner_pattern)) == SUBREG)
- purge_single_hard_subreg_set (inner_pattern);
- }
- }
- break;
- default:
- break;
- }
- }
- }
-}
-\f
/* Pass through the INSNS of function FNDECL and convert virtual register
references to hard register references. */
enum machine_mode mode;
rtx addr;
+ if (x == 0)
+ return;
+
+ /* If this is a CONCAT, recurse for the pieces. */
+ if (GET_CODE (x) == CONCAT)
+ {
+ instantiate_decl (XEXP (x, 0), size / 2, valid_only);
+ instantiate_decl (XEXP (x, 1), size / 2, valid_only);
+ return;
+ }
+
/* If this is not a MEM, no need to do anything. Similarly if the
address is a constant or a register that is not a virtual register. */
-
- if (x == 0 || !MEM_P (x))
+ if (!MEM_P (x))
return;
addr = XEXP (x, 0);
static void
instantiate_virtual_regs_lossage (rtx insn)
{
- if (asm_noperands (PATTERN (insn)) >= 0)
- {
- error_for_asm (insn, "impossible constraint in `asm'");
- delete_insn (insn);
- }
- else
- abort ();
+ gcc_assert (asm_noperands (PATTERN (insn)) >= 0);
+ error_for_asm (insn, "impossible constraint in %<asm%>");
+ delete_insn (insn);
}
/* Given a pointer to a piece of rtx and an optional pointer to the
containing object, instantiate any virtual registers present in it.
break;
default:
/* We don't expect other rtl types here. */
- abort();
+ gcc_unreachable ();
}
if (TREE_CODE (type) == VOID_TYPE)
return 0;
+ /* If the front end has decided that this needs to be passed by
+ reference, do so. */
+ if ((TREE_CODE (exp) == PARM_DECL || TREE_CODE (exp) == RESULT_DECL)
+ && DECL_BY_REFERENCE (exp))
+ return 1;
if (targetm.calls.return_in_memory (type, fntype))
return 1;
/* Types that are TREE_ADDRESSABLE must be constructed in memory,
if (flag_float_store && FLOAT_TYPE_P (TREE_TYPE (decl)))
return false;
- /* Compiler-generated temporaries can always go in registers. */
- if (DECL_ARTIFICIAL (decl))
+ /* If we're not interested in tracking debugging information for
+ this decl, then we can certainly put it in a register. */
+ if (DECL_IGNORED_P (decl))
return true;
-#ifdef NON_SAVING_SETJMP
- /* Protect variables not declared "register" from setjmp. */
- if (NON_SAVING_SETJMP
- && current_function_calls_setjmp
- && !DECL_REGISTER (decl))
- return false;
-#endif
-
return (optimize || DECL_REGISTER (decl));
}
-/* Assign RTL expressions to the function's parameters.
- This may involve copying them into registers and using
- those registers as the RTL for them. */
+/* Return true if TYPE should be passed by invisible reference. */
-void
-assign_parms (tree fndecl)
+bool
+pass_by_reference (CUMULATIVE_ARGS *ca, enum machine_mode mode,
+ tree type, bool named_arg)
+{
+ if (type)
+ {
+ /* If this type contains non-trivial constructors, then it is
+ forbidden for the middle-end to create any new copies. */
+ if (TREE_ADDRESSABLE (type))
+ return true;
+
+ /* GCC post 3.4 passes *all* variable sized types by reference. */
+ if (!TYPE_SIZE (type) || TREE_CODE (TYPE_SIZE (type)) != INTEGER_CST)
+ return true;
+ }
+
+ return targetm.calls.pass_by_reference (ca, mode, type, named_arg);
+}
+
+/* Return true if TYPE, which is passed by reference, should be callee
+ copied instead of caller copied. */
+
+bool
+reference_callee_copied (CUMULATIVE_ARGS *ca, enum machine_mode mode,
+ tree type, bool named_arg)
+{
+ if (type && TREE_ADDRESSABLE (type))
+ return false;
+ return targetm.calls.callee_copies (ca, mode, type, named_arg);
+}
+
+/* Structures to communicate between the subroutines of assign_parms.
+ The first holds data persistent across all parameters, the second
+ is cleared out for each parameter. */
+
+struct assign_parm_data_all
{
- tree parm;
CUMULATIVE_ARGS args_so_far;
- /* Total space needed so far for args on the stack,
- given as a constant and a tree-expression. */
struct args_size stack_args_size;
- HOST_WIDE_INT extra_pretend_bytes = 0;
- tree fntype = TREE_TYPE (fndecl);
- tree fnargs = DECL_ARGUMENTS (fndecl), orig_fnargs;
- /* This is used for the arg pointer when referring to stack args. */
- rtx internal_arg_pointer;
- /* This is a dummy PARM_DECL that we used for the function result if
- the function returns a structure. */
- tree function_result_decl = 0;
- int varargs_setup = 0;
- int reg_parm_stack_space ATTRIBUTE_UNUSED = 0;
- rtx conversion_insns = 0;
-
- /* Nonzero if function takes extra anonymous args.
- This means the last named arg must be on the stack
- right before the anonymous ones. */
- int stdarg = current_function_stdarg;
+ tree function_result_decl;
+ tree orig_fnargs;
+ rtx conversion_insns;
+ HOST_WIDE_INT pretend_args_size;
+ HOST_WIDE_INT extra_pretend_bytes;
+ int reg_parm_stack_space;
+};
- /* If the reg that the virtual arg pointer will be translated into is
- not a fixed reg or is the stack pointer, make a copy of the virtual
- arg pointer, and address parms via the copy. The frame pointer is
- considered fixed even though it is not marked as such.
+struct assign_parm_data_one
+{
+ tree nominal_type;
+ tree passed_type;
+ rtx entry_parm;
+ rtx stack_parm;
+ enum machine_mode nominal_mode;
+ enum machine_mode passed_mode;
+ enum machine_mode promoted_mode;
+ struct locate_and_pad_arg_data locate;
+ int partial;
+ BOOL_BITFIELD named_arg : 1;
+ BOOL_BITFIELD passed_pointer : 1;
+ BOOL_BITFIELD on_stack : 1;
+ BOOL_BITFIELD loaded_in_reg : 1;
+};
- The second time through, simply use ap to avoid generating rtx. */
+/* A subroutine of assign_parms. Initialize ALL. */
- if ((ARG_POINTER_REGNUM == STACK_POINTER_REGNUM
- || ! (fixed_regs[ARG_POINTER_REGNUM]
- || ARG_POINTER_REGNUM == FRAME_POINTER_REGNUM)))
- internal_arg_pointer = copy_to_reg (virtual_incoming_args_rtx);
- else
- internal_arg_pointer = virtual_incoming_args_rtx;
- current_function_internal_arg_pointer = internal_arg_pointer;
+static void
+assign_parms_initialize_all (struct assign_parm_data_all *all)
+{
+ tree fntype;
+
+ memset (all, 0, sizeof (*all));
+
+ fntype = TREE_TYPE (current_function_decl);
+
+#ifdef INIT_CUMULATIVE_INCOMING_ARGS
+ INIT_CUMULATIVE_INCOMING_ARGS (all->args_so_far, fntype, NULL_RTX);
+#else
+ INIT_CUMULATIVE_ARGS (all->args_so_far, fntype, NULL_RTX,
+ current_function_decl, -1);
+#endif
+
+#ifdef REG_PARM_STACK_SPACE
+ all->reg_parm_stack_space = REG_PARM_STACK_SPACE (current_function_decl);
+#endif
+}
+
+/* If ARGS contains entries with complex types, split the entry into two
+ entries of the component type. Return a new list of substitutions are
+ needed, else the old list. */
+
+static tree
+split_complex_args (tree args)
+{
+ tree p;
+
+ /* Before allocating memory, check for the common case of no complex. */
+ for (p = args; p; p = TREE_CHAIN (p))
+ {
+ tree type = TREE_TYPE (p);
+ if (TREE_CODE (type) == COMPLEX_TYPE
+ && targetm.calls.split_complex_arg (type))
+ goto found;
+ }
+ return args;
- stack_args_size.constant = 0;
- stack_args_size.var = 0;
+ found:
+ args = copy_list (args);
+
+ for (p = args; p; p = TREE_CHAIN (p))
+ {
+ tree type = TREE_TYPE (p);
+ if (TREE_CODE (type) == COMPLEX_TYPE
+ && targetm.calls.split_complex_arg (type))
+ {
+ tree decl;
+ tree subtype = TREE_TYPE (type);
+ bool addressable = TREE_ADDRESSABLE (p);
+
+ /* Rewrite the PARM_DECL's type with its component. */
+ TREE_TYPE (p) = subtype;
+ DECL_ARG_TYPE (p) = TREE_TYPE (DECL_ARG_TYPE (p));
+ DECL_MODE (p) = VOIDmode;
+ DECL_SIZE (p) = NULL;
+ DECL_SIZE_UNIT (p) = NULL;
+ /* If this arg must go in memory, put it in a pseudo here.
+ We can't allow it to go in memory as per normal parms,
+ because the usual place might not have the imag part
+ adjacent to the real part. */
+ DECL_ARTIFICIAL (p) = addressable;
+ DECL_IGNORED_P (p) = addressable;
+ TREE_ADDRESSABLE (p) = 0;
+ layout_decl (p, 0);
+
+ /* Build a second synthetic decl. */
+ decl = build_decl (PARM_DECL, NULL_TREE, subtype);
+ DECL_ARG_TYPE (decl) = DECL_ARG_TYPE (p);
+ DECL_ARTIFICIAL (decl) = addressable;
+ DECL_IGNORED_P (decl) = addressable;
+ layout_decl (decl, 0);
+
+ /* Splice it in; skip the new decl. */
+ TREE_CHAIN (decl) = TREE_CHAIN (p);
+ TREE_CHAIN (p) = decl;
+ p = decl;
+ }
+ }
+
+ return args;
+}
+
+/* A subroutine of assign_parms. Adjust the parameter list to incorporate
+ the hidden struct return argument, and (abi willing) complex args.
+ Return the new parameter list. */
+
+static tree
+assign_parms_augmented_arg_list (struct assign_parm_data_all *all)
+{
+ tree fndecl = current_function_decl;
+ tree fntype = TREE_TYPE (fndecl);
+ tree fnargs = DECL_ARGUMENTS (fndecl);
/* If struct value address is treated as the first argument, make it so. */
if (aggregate_value_p (DECL_RESULT (fndecl), fndecl)
&& targetm.calls.struct_value_rtx (TREE_TYPE (fndecl), 1) == 0)
{
tree type = build_pointer_type (TREE_TYPE (fntype));
+ tree decl;
- function_result_decl = build_decl (PARM_DECL, NULL_TREE, type);
+ decl = build_decl (PARM_DECL, NULL_TREE, type);
+ DECL_ARG_TYPE (decl) = type;
+ DECL_ARTIFICIAL (decl) = 1;
+ DECL_IGNORED_P (decl) = 1;
- DECL_ARG_TYPE (function_result_decl) = type;
- TREE_CHAIN (function_result_decl) = fnargs;
- fnargs = function_result_decl;
+ TREE_CHAIN (decl) = fnargs;
+ fnargs = decl;
+ all->function_result_decl = decl;
}
- orig_fnargs = fnargs;
+ all->orig_fnargs = fnargs;
/* If the target wants to split complex arguments into scalars, do so. */
if (targetm.calls.split_complex_arg)
fnargs = split_complex_args (fnargs);
-#ifdef REG_PARM_STACK_SPACE
- reg_parm_stack_space = REG_PARM_STACK_SPACE (fndecl);
-#endif
+ return fnargs;
+}
-#ifdef INIT_CUMULATIVE_INCOMING_ARGS
- INIT_CUMULATIVE_INCOMING_ARGS (args_so_far, fntype, NULL_RTX);
-#else
- INIT_CUMULATIVE_ARGS (args_so_far, fntype, NULL_RTX, fndecl, -1);
-#endif
+/* A subroutine of assign_parms. Examine PARM and pull out type and mode
+ data for the parameter. Incorporate ABI specifics such as pass-by-
+ reference and type promotion. */
- /* We haven't yet found an argument that we must push and pretend the
- caller did. */
- current_function_pretend_args_size = 0;
+static void
+assign_parm_find_data_types (struct assign_parm_data_all *all, tree parm,
+ struct assign_parm_data_one *data)
+{
+ tree nominal_type, passed_type;
+ enum machine_mode nominal_mode, passed_mode, promoted_mode;
+
+ memset (data, 0, sizeof (*data));
+
+ /* NAMED_ARG is a mis-nomer. We really mean 'non-varadic'. */
+ if (!current_function_stdarg)
+ data->named_arg = 1; /* No varadic parms. */
+ else if (TREE_CHAIN (parm))
+ data->named_arg = 1; /* Not the last non-varadic parm. */
+ else if (targetm.calls.strict_argument_naming (&all->args_so_far))
+ data->named_arg = 1; /* Only varadic ones are unnamed. */
+ else
+ data->named_arg = 0; /* Treat as varadic. */
+
+ nominal_type = TREE_TYPE (parm);
+ passed_type = DECL_ARG_TYPE (parm);
+
+ /* Look out for errors propagating this far. Also, if the parameter's
+ type is void then its value doesn't matter. */
+ if (TREE_TYPE (parm) == error_mark_node
+ /* This can happen after weird syntax errors
+ or if an enum type is defined among the parms. */
+ || TREE_CODE (parm) != PARM_DECL
+ || passed_type == NULL
+ || VOID_TYPE_P (nominal_type))
+ {
+ nominal_type = passed_type = void_type_node;
+ nominal_mode = passed_mode = promoted_mode = VOIDmode;
+ goto egress;
+ }
- for (parm = fnargs; parm; parm = TREE_CHAIN (parm))
+ /* Find mode of arg as it is passed, and mode of arg as it should be
+ during execution of this function. */
+ passed_mode = TYPE_MODE (passed_type);
+ nominal_mode = TYPE_MODE (nominal_type);
+
+ /* If the parm is to be passed as a transparent union, use the type of
+ the first field for the tests below. We have already verified that
+ the modes are the same. */
+ if (DECL_TRANSPARENT_UNION (parm)
+ || (TREE_CODE (passed_type) == UNION_TYPE
+ && TYPE_TRANSPARENT_UNION (passed_type)))
+ passed_type = TREE_TYPE (TYPE_FIELDS (passed_type));
+
+ /* See if this arg was passed by invisible reference. */
+ if (pass_by_reference (&all->args_so_far, passed_mode,
+ passed_type, data->named_arg))
{
- rtx entry_parm;
- rtx stack_parm;
- enum machine_mode promoted_mode, passed_mode;
- enum machine_mode nominal_mode, promoted_nominal_mode;
- int unsignedp;
- struct locate_and_pad_arg_data locate;
- int passed_pointer = 0;
- int did_conversion = 0;
- tree passed_type = DECL_ARG_TYPE (parm);
- tree nominal_type = TREE_TYPE (parm);
- int last_named = 0, named_arg;
- int in_regs;
- int partial = 0;
- int pretend_bytes = 0;
- int loaded_in_reg = 0;
-
- /* Set LAST_NAMED if this is last named arg before last
- anonymous args. */
- if (stdarg)
- {
- tree tem;
+ passed_type = nominal_type = build_pointer_type (passed_type);
+ data->passed_pointer = true;
+ passed_mode = nominal_mode = Pmode;
+ }
- for (tem = TREE_CHAIN (parm); tem; tem = TREE_CHAIN (tem))
- if (DECL_NAME (tem))
- break;
+ /* Find mode as it is passed by the ABI. */
+ promoted_mode = passed_mode;
+ if (targetm.calls.promote_function_args (TREE_TYPE (current_function_decl)))
+ {
+ int unsignedp = TYPE_UNSIGNED (passed_type);
+ promoted_mode = promote_mode (passed_type, promoted_mode,
+ &unsignedp, 1);
+ }
- if (tem == 0)
- last_named = 1;
- }
- /* Set NAMED_ARG if this arg should be treated as a named arg. For
- most machines, if this is a varargs/stdarg function, then we treat
- the last named arg as if it were anonymous too. */
- named_arg = (targetm.calls.strict_argument_naming (&args_so_far)
- ? 1 : !last_named);
-
- if (TREE_TYPE (parm) == error_mark_node
- /* This can happen after weird syntax errors
- or if an enum type is defined among the parms. */
- || TREE_CODE (parm) != PARM_DECL
- || passed_type == NULL)
- {
- SET_DECL_RTL (parm, gen_rtx_MEM (BLKmode, const0_rtx));
- DECL_INCOMING_RTL (parm) = DECL_RTL (parm);
- TREE_USED (parm) = 1;
- continue;
- }
+ egress:
+ data->nominal_type = nominal_type;
+ data->passed_type = passed_type;
+ data->nominal_mode = nominal_mode;
+ data->passed_mode = passed_mode;
+ data->promoted_mode = promoted_mode;
+}
- /* Find mode of arg as it is passed, and mode of arg
- as it should be during execution of this function. */
- passed_mode = TYPE_MODE (passed_type);
- nominal_mode = TYPE_MODE (nominal_type);
+/* A subroutine of assign_parms. Invoke setup_incoming_varargs. */
- /* If the parm's mode is VOID, its value doesn't matter,
- and avoid the usual things like emit_move_insn that could crash. */
- if (nominal_mode == VOIDmode)
- {
- SET_DECL_RTL (parm, const0_rtx);
- DECL_INCOMING_RTL (parm) = DECL_RTL (parm);
- continue;
- }
+static void
+assign_parms_setup_varargs (struct assign_parm_data_all *all,
+ struct assign_parm_data_one *data, bool no_rtl)
+{
+ int varargs_pretend_bytes = 0;
+
+ targetm.calls.setup_incoming_varargs (&all->args_so_far,
+ data->promoted_mode,
+ data->passed_type,
+ &varargs_pretend_bytes, no_rtl);
+
+ /* If the back-end has requested extra stack space, record how much is
+ needed. Do not change pretend_args_size otherwise since it may be
+ nonzero from an earlier partial argument. */
+ if (varargs_pretend_bytes > 0)
+ all->pretend_args_size = varargs_pretend_bytes;
+}
+
+/* A subroutine of assign_parms. Set DATA->ENTRY_PARM corresponding to
+ the incoming location of the current parameter. */
+
+static void
+assign_parm_find_entry_rtl (struct assign_parm_data_all *all,
+ struct assign_parm_data_one *data)
+{
+ HOST_WIDE_INT pretend_bytes = 0;
+ rtx entry_parm;
+ bool in_regs;
- /* If the parm is to be passed as a transparent union, use the
- type of the first field for the tests below. We have already
- verified that the modes are the same. */
- if (DECL_TRANSPARENT_UNION (parm)
- || (TREE_CODE (passed_type) == UNION_TYPE
- && TYPE_TRANSPARENT_UNION (passed_type)))
- passed_type = TREE_TYPE (TYPE_FIELDS (passed_type));
-
- /* See if this arg was passed by invisible reference. It is if
- it is an object whose size depends on the contents of the
- object itself or if the machine requires these objects be passed
- that way. */
-
- if (CONTAINS_PLACEHOLDER_P (TYPE_SIZE (passed_type))
- || TREE_ADDRESSABLE (passed_type)
-#ifdef FUNCTION_ARG_PASS_BY_REFERENCE
- || FUNCTION_ARG_PASS_BY_REFERENCE (args_so_far, passed_mode,
- passed_type, named_arg)
+ if (data->promoted_mode == VOIDmode)
+ {
+ data->entry_parm = data->stack_parm = const0_rtx;
+ return;
+ }
+
+#ifdef FUNCTION_INCOMING_ARG
+ entry_parm = FUNCTION_INCOMING_ARG (all->args_so_far, data->promoted_mode,
+ data->passed_type, data->named_arg);
+#else
+ entry_parm = FUNCTION_ARG (all->args_so_far, data->promoted_mode,
+ data->passed_type, data->named_arg);
#endif
- )
- {
- passed_type = nominal_type = build_pointer_type (passed_type);
- passed_pointer = 1;
- passed_mode = nominal_mode = Pmode;
- }
- /* See if the frontend wants to pass this by invisible reference. */
- else if (passed_type != nominal_type
- && POINTER_TYPE_P (passed_type)
- && TREE_TYPE (passed_type) == nominal_type)
+
+ if (entry_parm == 0)
+ data->promoted_mode = data->passed_mode;
+
+ /* Determine parm's home in the stack, in case it arrives in the stack
+ or we should pretend it did. Compute the stack position and rtx where
+ the argument arrives and its size.
+
+ There is one complexity here: If this was a parameter that would
+ have been passed in registers, but wasn't only because it is
+ __builtin_va_alist, we want locate_and_pad_parm to treat it as if
+ it came in a register so that REG_PARM_STACK_SPACE isn't skipped.
+ In this case, we call FUNCTION_ARG with NAMED set to 1 instead of 0
+ as it was the previous time. */
+ in_regs = entry_parm != 0;
+#ifdef STACK_PARMS_IN_REG_PARM_AREA
+ in_regs = true;
+#endif
+ if (!in_regs && !data->named_arg)
+ {
+ if (targetm.calls.pretend_outgoing_varargs_named (&all->args_so_far))
{
- nominal_type = passed_type;
- passed_pointer = 1;
- passed_mode = nominal_mode = Pmode;
+ rtx tem;
+#ifdef FUNCTION_INCOMING_ARG
+ tem = FUNCTION_INCOMING_ARG (all->args_so_far, data->promoted_mode,
+ data->passed_type, true);
+#else
+ tem = FUNCTION_ARG (all->args_so_far, data->promoted_mode,
+ data->passed_type, true);
+#endif
+ in_regs = tem != NULL;
}
+ }
- promoted_mode = passed_mode;
+ /* If this parameter was passed both in registers and in the stack, use
+ the copy on the stack. */
+ if (targetm.calls.must_pass_in_stack (data->promoted_mode,
+ data->passed_type))
+ entry_parm = 0;
- if (targetm.calls.promote_function_args (TREE_TYPE (fndecl)))
+ if (entry_parm)
+ {
+ int partial;
+
+ partial = targetm.calls.arg_partial_bytes (&all->args_so_far,
+ data->promoted_mode,
+ data->passed_type,
+ data->named_arg);
+ data->partial = partial;
+
+ /* The caller might already have allocated stack space for the
+ register parameters. */
+ if (partial != 0 && all->reg_parm_stack_space == 0)
{
- /* Compute the mode in which the arg is actually extended to. */
- unsignedp = TYPE_UNSIGNED (passed_type);
- promoted_mode = promote_mode (passed_type, promoted_mode,
- &unsignedp, 1);
+ /* Part of this argument is passed in registers and part
+ is passed on the stack. Ask the prologue code to extend
+ the stack part so that we can recreate the full value.
+
+ PRETEND_BYTES is the size of the registers we need to store.
+ CURRENT_FUNCTION_PRETEND_ARGS_SIZE is the amount of extra
+ stack space that the prologue should allocate.
+
+ Internally, gcc assumes that the argument pointer is aligned
+ to STACK_BOUNDARY bits. This is used both for alignment
+ optimizations (see init_emit) and to locate arguments that are
+ aligned to more than PARM_BOUNDARY bits. We must preserve this
+ invariant by rounding CURRENT_FUNCTION_PRETEND_ARGS_SIZE up to
+ a stack boundary. */
+
+ /* We assume at most one partial arg, and it must be the first
+ argument on the stack. */
+ gcc_assert (!all->extra_pretend_bytes && !all->pretend_args_size);
+
+ pretend_bytes = partial;
+ all->pretend_args_size = CEIL_ROUND (pretend_bytes, STACK_BYTES);
+
+ /* We want to align relative to the actual stack pointer, so
+ don't include this in the stack size until later. */
+ all->extra_pretend_bytes = all->pretend_args_size;
}
+ }
- /* Let machine desc say which reg (if any) the parm arrives in.
- 0 means it arrives on the stack. */
-#ifdef FUNCTION_INCOMING_ARG
- entry_parm = FUNCTION_INCOMING_ARG (args_so_far, promoted_mode,
- passed_type, named_arg);
-#else
- entry_parm = FUNCTION_ARG (args_so_far, promoted_mode,
- passed_type, named_arg);
-#endif
+ locate_and_pad_parm (data->promoted_mode, data->passed_type, in_regs,
+ entry_parm ? data->partial : 0, current_function_decl,
+ &all->stack_args_size, &data->locate);
- if (entry_parm == 0)
- promoted_mode = passed_mode;
+ /* Adjust offsets to include the pretend args. */
+ pretend_bytes = all->extra_pretend_bytes - pretend_bytes;
+ data->locate.slot_offset.constant += pretend_bytes;
+ data->locate.offset.constant += pretend_bytes;
- /* If this is the last named parameter, do any required setup for
- varargs or stdargs. We need to know about the case of this being an
- addressable type, in which case we skip the registers it
- would have arrived in.
+ data->entry_parm = entry_parm;
+}
+
+/* A subroutine of assign_parms. If there is actually space on the stack
+ for this parm, count it in stack_args_size and return true. */
+
+static bool
+assign_parm_is_stack_parm (struct assign_parm_data_all *all,
+ struct assign_parm_data_one *data)
+{
+ /* Trivially true if we've no incoming register. */
+ if (data->entry_parm == NULL)
+ ;
+ /* Also true if we're partially in registers and partially not,
+ since we've arranged to drop the entire argument on the stack. */
+ else if (data->partial != 0)
+ ;
+ /* Also true if the target says that it's passed in both registers
+ and on the stack. */
+ else if (GET_CODE (data->entry_parm) == PARALLEL
+ && XEXP (XVECEXP (data->entry_parm, 0, 0), 0) == NULL_RTX)
+ ;
+ /* Also true if the target says that there's stack allocated for
+ all register parameters. */
+ else if (all->reg_parm_stack_space > 0)
+ ;
+ /* Otherwise, no, this parameter has no ABI defined stack slot. */
+ else
+ return false;
- For stdargs, LAST_NAMED will be set for two parameters, the one that
- is actually the last named, and the dummy parameter. We only
- want to do this action once.
+ all->stack_args_size.constant += data->locate.size.constant;
+ if (data->locate.size.var)
+ ADD_PARM_SIZE (all->stack_args_size, data->locate.size.var);
- Also, indicate when RTL generation is to be suppressed. */
- if (last_named && !varargs_setup)
+ return true;
+}
+
+/* A subroutine of assign_parms. Given that this parameter is allocated
+ stack space by the ABI, find it. */
+
+static void
+assign_parm_find_stack_rtl (tree parm, struct assign_parm_data_one *data)
+{
+ rtx offset_rtx, stack_parm;
+ unsigned int align, boundary;
+
+ /* If we're passing this arg using a reg, make its stack home the
+ aligned stack slot. */
+ if (data->entry_parm)
+ offset_rtx = ARGS_SIZE_RTX (data->locate.slot_offset);
+ else
+ offset_rtx = ARGS_SIZE_RTX (data->locate.offset);
+
+ stack_parm = current_function_internal_arg_pointer;
+ if (offset_rtx != const0_rtx)
+ stack_parm = gen_rtx_PLUS (Pmode, stack_parm, offset_rtx);
+ stack_parm = gen_rtx_MEM (data->promoted_mode, stack_parm);
+
+ set_mem_attributes (stack_parm, parm, 1);
+
+ boundary = data->locate.boundary;
+ align = BITS_PER_UNIT;
+
+ /* If we're padding upward, we know that the alignment of the slot
+ is FUNCTION_ARG_BOUNDARY. If we're using slot_offset, we're
+ intentionally forcing upward padding. Otherwise we have to come
+ up with a guess at the alignment based on OFFSET_RTX. */
+ if (data->locate.where_pad != downward || data->entry_parm)
+ align = boundary;
+ else if (GET_CODE (offset_rtx) == CONST_INT)
+ {
+ align = INTVAL (offset_rtx) * BITS_PER_UNIT | boundary;
+ align = align & -align;
+ }
+ set_mem_align (stack_parm, align);
+
+ if (data->entry_parm)
+ set_reg_attrs_for_parm (data->entry_parm, stack_parm);
+
+ data->stack_parm = stack_parm;
+}
+
+/* A subroutine of assign_parms. Adjust DATA->ENTRY_RTL such that it's
+ always valid and contiguous. */
+
+static void
+assign_parm_adjust_entry_rtl (struct assign_parm_data_one *data)
+{
+ rtx entry_parm = data->entry_parm;
+ rtx stack_parm = data->stack_parm;
+
+ /* If this parm was passed part in regs and part in memory, pretend it
+ arrived entirely in memory by pushing the register-part onto the stack.
+ In the special case of a DImode or DFmode that is split, we could put
+ it together in a pseudoreg directly, but for now that's not worth
+ bothering with. */
+ if (data->partial != 0)
+ {
+ /* Handle calls that pass values in multiple non-contiguous
+ locations. The Irix 6 ABI has examples of this. */
+ if (GET_CODE (entry_parm) == PARALLEL)
+ emit_group_store (validize_mem (stack_parm), entry_parm,
+ data->passed_type,
+ int_size_in_bytes (data->passed_type));
+ else
{
- int varargs_pretend_bytes = 0;
- targetm.calls.setup_incoming_varargs (&args_so_far, promoted_mode,
- passed_type,
- &varargs_pretend_bytes, 0);
- varargs_setup = 1;
-
- /* If the back-end has requested extra stack space, record how
- much is needed. Do not change pretend_args_size otherwise
- since it may be nonzero from an earlier partial argument. */
- if (varargs_pretend_bytes > 0)
- current_function_pretend_args_size = varargs_pretend_bytes;
+ gcc_assert (data->partial % UNITS_PER_WORD == 0);
+ move_block_from_reg (REGNO (entry_parm), validize_mem (stack_parm),
+ data->partial / UNITS_PER_WORD);
}
- /* Determine parm's home in the stack,
- in case it arrives in the stack or we should pretend it did.
+ entry_parm = stack_parm;
+ }
- Compute the stack position and rtx where the argument arrives
- and its size.
+ /* If we didn't decide this parm came in a register, by default it came
+ on the stack. */
+ else if (entry_parm == NULL)
+ entry_parm = stack_parm;
+
+ /* When an argument is passed in multiple locations, we can't make use
+ of this information, but we can save some copying if the whole argument
+ is passed in a single register. */
+ else if (GET_CODE (entry_parm) == PARALLEL
+ && data->nominal_mode != BLKmode
+ && data->passed_mode != BLKmode)
+ {
+ size_t i, len = XVECLEN (entry_parm, 0);
+
+ for (i = 0; i < len; i++)
+ if (XEXP (XVECEXP (entry_parm, 0, i), 0) != NULL_RTX
+ && REG_P (XEXP (XVECEXP (entry_parm, 0, i), 0))
+ && (GET_MODE (XEXP (XVECEXP (entry_parm, 0, i), 0))
+ == data->passed_mode)
+ && INTVAL (XEXP (XVECEXP (entry_parm, 0, i), 1)) == 0)
+ {
+ entry_parm = XEXP (XVECEXP (entry_parm, 0, i), 0);
+ break;
+ }
+ }
- There is one complexity here: If this was a parameter that would
- have been passed in registers, but wasn't only because it is
- __builtin_va_alist, we want locate_and_pad_parm to treat it as if
- it came in a register so that REG_PARM_STACK_SPACE isn't skipped.
- In this case, we call FUNCTION_ARG with NAMED set to 1 instead of
- 0 as it was the previous time. */
- in_regs = entry_parm != 0;
-#ifdef STACK_PARMS_IN_REG_PARM_AREA
- in_regs = 1;
+ data->entry_parm = entry_parm;
+}
+
+/* A subroutine of assign_parms. Adjust DATA->STACK_RTL such that it's
+ always valid and properly aligned. */
+
+static void
+assign_parm_adjust_stack_rtl (struct assign_parm_data_one *data)
+{
+ rtx stack_parm = data->stack_parm;
+
+ /* If we can't trust the parm stack slot to be aligned enough for its
+ ultimate type, don't use that slot after entry. We'll make another
+ stack slot, if we need one. */
+ if (stack_parm
+ && ((STRICT_ALIGNMENT
+ && GET_MODE_ALIGNMENT (data->nominal_mode) > MEM_ALIGN (stack_parm))
+ || (data->nominal_type
+ && TYPE_ALIGN (data->nominal_type) > MEM_ALIGN (stack_parm)
+ && MEM_ALIGN (stack_parm) < PREFERRED_STACK_BOUNDARY)))
+ stack_parm = NULL;
+
+ /* If parm was passed in memory, and we need to convert it on entry,
+ don't store it back in that same slot. */
+ else if (data->entry_parm == stack_parm
+ && data->nominal_mode != BLKmode
+ && data->nominal_mode != data->passed_mode)
+ stack_parm = NULL;
+
+ data->stack_parm = stack_parm;
+}
+
+/* A subroutine of assign_parms. Return true if the current parameter
+ should be stored as a BLKmode in the current frame. */
+
+static bool
+assign_parm_setup_block_p (struct assign_parm_data_one *data)
+{
+ if (data->nominal_mode == BLKmode)
+ return true;
+ if (GET_CODE (data->entry_parm) == PARALLEL)
+ return true;
+
+#ifdef BLOCK_REG_PADDING
+ /* Only assign_parm_setup_block knows how to deal with register arguments
+ that are padded at the least significant end. */
+ if (REG_P (data->entry_parm)
+ && GET_MODE_SIZE (data->promoted_mode) < UNITS_PER_WORD
+ && (BLOCK_REG_PADDING (data->passed_mode, data->passed_type, 1)
+ == (BYTES_BIG_ENDIAN ? upward : downward)))
+ return true;
#endif
- if (!in_regs && !named_arg)
+
+ return false;
+}
+
+/* A subroutine of assign_parms. Arrange for the parameter to be
+ present and valid in DATA->STACK_RTL. */
+
+static void
+assign_parm_setup_block (struct assign_parm_data_all *all,
+ tree parm, struct assign_parm_data_one *data)
+{
+ rtx entry_parm = data->entry_parm;
+ rtx stack_parm = data->stack_parm;
+ HOST_WIDE_INT size;
+ HOST_WIDE_INT size_stored;
+ rtx orig_entry_parm = entry_parm;
+
+ if (GET_CODE (entry_parm) == PARALLEL)
+ entry_parm = emit_group_move_into_temps (entry_parm);
+
+ /* If we've a non-block object that's nevertheless passed in parts,
+ reconstitute it in register operations rather than on the stack. */
+ if (GET_CODE (entry_parm) == PARALLEL
+ && data->nominal_mode != BLKmode)
+ {
+ rtx elt0 = XEXP (XVECEXP (orig_entry_parm, 0, 0), 0);
+
+ if ((XVECLEN (entry_parm, 0) > 1
+ || hard_regno_nregs[REGNO (elt0)][GET_MODE (elt0)] > 1)
+ && use_register_for_decl (parm))
{
- int pretend_named =
- targetm.calls.pretend_outgoing_varargs_named (&args_so_far);
- if (pretend_named)
+ rtx parmreg = gen_reg_rtx (data->nominal_mode);
+
+ push_to_sequence (all->conversion_insns);
+
+ /* For values returned in multiple registers, handle possible
+ incompatible calls to emit_group_store.
+
+ For example, the following would be invalid, and would have to
+ be fixed by the conditional below:
+
+ emit_group_store ((reg:SF), (parallel:DF))
+ emit_group_store ((reg:SI), (parallel:DI))
+
+ An example of this are doubles in e500 v2:
+ (parallel:DF (expr_list (reg:SI) (const_int 0))
+ (expr_list (reg:SI) (const_int 4))). */
+ if (data->nominal_mode != data->passed_mode)
{
-#ifdef FUNCTION_INCOMING_ARG
- in_regs = FUNCTION_INCOMING_ARG (args_so_far, promoted_mode,
- passed_type,
- pretend_named) != 0;
-#else
- in_regs = FUNCTION_ARG (args_so_far, promoted_mode,
- passed_type,
- pretend_named) != 0;
-#endif
+ rtx t = gen_reg_rtx (GET_MODE (entry_parm));
+ emit_group_store (t, entry_parm, NULL_TREE,
+ GET_MODE_SIZE (GET_MODE (entry_parm)));
+ convert_move (parmreg, t, 0);
}
+ else
+ emit_group_store (parmreg, entry_parm, data->nominal_type,
+ int_size_in_bytes (data->nominal_type));
+
+ all->conversion_insns = get_insns ();
+ end_sequence ();
+
+ SET_DECL_RTL (parm, parmreg);
+ return;
}
+ }
+
+ size = int_size_in_bytes (data->passed_type);
+ size_stored = CEIL_ROUND (size, UNITS_PER_WORD);
+ if (stack_parm == 0)
+ {
+ DECL_ALIGN (parm) = MAX (DECL_ALIGN (parm), BITS_PER_WORD);
+ stack_parm = assign_stack_local (BLKmode, size_stored,
+ DECL_ALIGN (parm));
+ if (GET_MODE_SIZE (GET_MODE (entry_parm)) == size)
+ PUT_MODE (stack_parm, GET_MODE (entry_parm));
+ set_mem_attributes (stack_parm, parm, 1);
+ }
+
+ /* If a BLKmode arrives in registers, copy it to a stack slot. Handle
+ calls that pass values in multiple non-contiguous locations. */
+ if (REG_P (entry_parm) || GET_CODE (entry_parm) == PARALLEL)
+ {
+ rtx mem;
+
+ /* Note that we will be storing an integral number of words.
+ So we have to be careful to ensure that we allocate an
+ integral number of words. We do this above when we call
+ assign_stack_local if space was not allocated in the argument
+ list. If it was, this will not work if PARM_BOUNDARY is not
+ a multiple of BITS_PER_WORD. It isn't clear how to fix this
+ if it becomes a problem. Exception is when BLKmode arrives
+ with arguments not conforming to word_mode. */
+
+ if (data->stack_parm == 0)
+ ;
+ else if (GET_CODE (entry_parm) == PARALLEL)
+ ;
+ else
+ gcc_assert (!size || !(PARM_BOUNDARY % BITS_PER_WORD));
- /* If this parameter was passed both in registers and in the stack,
- use the copy on the stack. */
- if (MUST_PASS_IN_STACK (promoted_mode, passed_type))
- entry_parm = 0;
+ mem = validize_mem (stack_parm);
-#ifdef FUNCTION_ARG_PARTIAL_NREGS
- if (entry_parm)
+ /* Handle values in multiple non-contiguous locations. */
+ if (GET_CODE (entry_parm) == PARALLEL)
{
- partial = FUNCTION_ARG_PARTIAL_NREGS (args_so_far, promoted_mode,
- passed_type, named_arg);
- if (partial
- /* The caller might already have allocated stack space
- for the register parameters. */
- && reg_parm_stack_space == 0)
- {
- /* Part of this argument is passed in registers and part
- is passed on the stack. Ask the prologue code to extend
- the stack part so that we can recreate the full value.
-
- PRETEND_BYTES is the size of the registers we need to store.
- CURRENT_FUNCTION_PRETEND_ARGS_SIZE is the amount of extra
- stack space that the prologue should allocate.
-
- Internally, gcc assumes that the argument pointer is
- aligned to STACK_BOUNDARY bits. This is used both for
- alignment optimizations (see init_emit) and to locate
- arguments that are aligned to more than PARM_BOUNDARY
- bits. We must preserve this invariant by rounding
- CURRENT_FUNCTION_PRETEND_ARGS_SIZE up to a stack
- boundary. */
-
- /* We assume at most one partial arg, and it must be the first
- argument on the stack. */
- if (extra_pretend_bytes || current_function_pretend_args_size)
- abort ();
-
- pretend_bytes = partial * UNITS_PER_WORD;
- current_function_pretend_args_size
- = CEIL_ROUND (pretend_bytes, STACK_BYTES);
-
- /* We want to align relative to the actual stack pointer, so
- don't include this in the stack size until later. */
- extra_pretend_bytes = current_function_pretend_args_size;
- }
+ push_to_sequence (all->conversion_insns);
+ emit_group_store (mem, entry_parm, data->passed_type, size);
+ all->conversion_insns = get_insns ();
+ end_sequence ();
}
+
+ else if (size == 0)
+ ;
+
+ /* If SIZE is that of a mode no bigger than a word, just use
+ that mode's store operation. */
+ else if (size <= UNITS_PER_WORD)
+ {
+ enum machine_mode mode
+ = mode_for_size (size * BITS_PER_UNIT, MODE_INT, 0);
+
+ if (mode != BLKmode
+#ifdef BLOCK_REG_PADDING
+ && (size == UNITS_PER_WORD
+ || (BLOCK_REG_PADDING (mode, data->passed_type, 1)
+ != (BYTES_BIG_ENDIAN ? upward : downward)))
#endif
+ )
+ {
+ rtx reg = gen_rtx_REG (mode, REGNO (entry_parm));
+ emit_move_insn (change_address (mem, mode, 0), reg);
+ }
- memset (&locate, 0, sizeof (locate));
- locate_and_pad_parm (promoted_mode, passed_type, in_regs,
- entry_parm ? partial : 0, fndecl,
- &stack_args_size, &locate);
- /* Adjust offsets to include the pretend args. */
- locate.slot_offset.constant += extra_pretend_bytes - pretend_bytes;
- locate.offset.constant += extra_pretend_bytes - pretend_bytes;
+ /* Blocks smaller than a word on a BYTES_BIG_ENDIAN
+ machine must be aligned to the left before storing
+ to memory. Note that the previous test doesn't
+ handle all cases (e.g. SIZE == 3). */
+ else if (size != UNITS_PER_WORD
+#ifdef BLOCK_REG_PADDING
+ && (BLOCK_REG_PADDING (mode, data->passed_type, 1)
+ == downward)
+#else
+ && BYTES_BIG_ENDIAN
+#endif
+ )
+ {
+ rtx tem, x;
+ int by = (UNITS_PER_WORD - size) * BITS_PER_UNIT;
+ rtx reg = gen_rtx_REG (word_mode, REGNO (entry_parm));
+
+ x = expand_shift (LSHIFT_EXPR, word_mode, reg,
+ build_int_cst (NULL_TREE, by),
+ NULL_RTX, 1);
+ tem = change_address (mem, word_mode, 0);
+ emit_move_insn (tem, x);
+ }
+ else
+ move_block_from_reg (REGNO (entry_parm), mem,
+ size_stored / UNITS_PER_WORD);
+ }
+ else
+ move_block_from_reg (REGNO (entry_parm), mem,
+ size_stored / UNITS_PER_WORD);
+ }
+ else if (data->stack_parm == 0)
+ {
+ push_to_sequence (all->conversion_insns);
+ emit_block_move (stack_parm, data->entry_parm, GEN_INT (size),
+ BLOCK_OP_NORMAL);
+ all->conversion_insns = get_insns ();
+ end_sequence ();
+ }
- {
- rtx offset_rtx;
- unsigned int align, boundary;
-
- /* If we're passing this arg using a reg, make its stack home
- the aligned stack slot. */
- if (entry_parm)
- offset_rtx = ARGS_SIZE_RTX (locate.slot_offset);
- else
- offset_rtx = ARGS_SIZE_RTX (locate.offset);
-
- if (offset_rtx == const0_rtx)
- stack_parm = gen_rtx_MEM (promoted_mode, internal_arg_pointer);
- else
- stack_parm = gen_rtx_MEM (promoted_mode,
- gen_rtx_PLUS (Pmode,
- internal_arg_pointer,
- offset_rtx));
-
- set_mem_attributes (stack_parm, parm, 1);
-
- boundary = FUNCTION_ARG_BOUNDARY (promoted_mode, passed_type);
- align = 0;
-
- /* If we're padding upward, we know that the alignment of the slot
- is FUNCTION_ARG_BOUNDARY. If we're using slot_offset, we're
- intentionally forcing upward padding. Otherwise we have to come
- up with a guess at the alignment based on OFFSET_RTX. */
- if (locate.where_pad == upward || entry_parm)
- align = boundary;
- else if (GET_CODE (offset_rtx) == CONST_INT)
- {
- align = INTVAL (offset_rtx) * BITS_PER_UNIT | boundary;
- align = align & -align;
- }
- if (align > 0)
- set_mem_align (stack_parm, align);
+ data->stack_parm = stack_parm;
+ SET_DECL_RTL (parm, stack_parm);
+}
- if (entry_parm)
- set_reg_attrs_for_parm (entry_parm, stack_parm);
- }
+/* A subroutine of assign_parms. Allocate a pseudo to hold the current
+ parameter. Get it there. Perform all ABI specified conversions. */
- /* If this parm was passed part in regs and part in memory,
- pretend it arrived entirely in memory
- by pushing the register-part onto the stack.
+static void
+assign_parm_setup_reg (struct assign_parm_data_all *all, tree parm,
+ struct assign_parm_data_one *data)
+{
+ rtx parmreg;
+ enum machine_mode promoted_nominal_mode;
+ int unsignedp = TYPE_UNSIGNED (TREE_TYPE (parm));
+ bool did_conversion = false;
- In the special case of a DImode or DFmode that is split,
- we could put it together in a pseudoreg directly,
- but for now that's not worth bothering with. */
+ /* Store the parm in a pseudoregister during the function, but we may
+ need to do it in a wider mode. */
- if (partial)
- {
- /* Handle calls that pass values in multiple non-contiguous
- locations. The Irix 6 ABI has examples of this. */
- if (GET_CODE (entry_parm) == PARALLEL)
- emit_group_store (validize_mem (stack_parm), entry_parm,
- TREE_TYPE (parm),
- int_size_in_bytes (TREE_TYPE (parm)));
+ promoted_nominal_mode
+ = promote_mode (data->nominal_type, data->nominal_mode, &unsignedp, 0);
- else
- move_block_from_reg (REGNO (entry_parm), validize_mem (stack_parm),
- partial);
+ parmreg = gen_reg_rtx (promoted_nominal_mode);
- entry_parm = stack_parm;
- }
+ if (!DECL_ARTIFICIAL (parm))
+ mark_user_reg (parmreg);
- /* If we didn't decide this parm came in a register,
- by default it came on the stack. */
- if (entry_parm == 0)
- entry_parm = stack_parm;
+ /* If this was an item that we received a pointer to,
+ set DECL_RTL appropriately. */
+ if (data->passed_pointer)
+ {
+ rtx x = gen_rtx_MEM (TYPE_MODE (TREE_TYPE (data->passed_type)), parmreg);
+ set_mem_attributes (x, parm, 1);
+ SET_DECL_RTL (parm, x);
+ }
+ else
+ SET_DECL_RTL (parm, parmreg);
- /* Record permanently how this parm was passed. */
- set_decl_incoming_rtl (parm, entry_parm);
-
- /* If there is actually space on the stack for this parm,
- count it in stack_args_size; otherwise set stack_parm to 0
- to indicate there is no preallocated stack slot for the parm. */
-
- if (entry_parm == stack_parm
- || (GET_CODE (entry_parm) == PARALLEL
- && XEXP (XVECEXP (entry_parm, 0, 0), 0) == NULL_RTX)
-#if defined (REG_PARM_STACK_SPACE)
- /* On some machines, even if a parm value arrives in a register
- there is still an (uninitialized) stack slot allocated
- for it. */
- || REG_PARM_STACK_SPACE (fndecl) > 0
-#endif
- )
+ /* Copy the value into the register. */
+ if (data->nominal_mode != data->passed_mode
+ || promoted_nominal_mode != data->promoted_mode)
+ {
+ int save_tree_used;
+
+ /* ENTRY_PARM has been converted to PROMOTED_MODE, its
+ mode, by the caller. We now have to convert it to
+ NOMINAL_MODE, if different. However, PARMREG may be in
+ a different mode than NOMINAL_MODE if it is being stored
+ promoted.
+
+ If ENTRY_PARM is a hard register, it might be in a register
+ not valid for operating in its mode (e.g., an odd-numbered
+ register for a DFmode). In that case, moves are the only
+ thing valid, so we can't do a convert from there. This
+ occurs when the calling sequence allow such misaligned
+ usages.
+
+ In addition, the conversion may involve a call, which could
+ clobber parameters which haven't been copied to pseudo
+ registers yet. Therefore, we must first copy the parm to
+ a pseudo reg here, and save the conversion until after all
+ parameters have been moved. */
+
+ rtx tempreg = gen_reg_rtx (GET_MODE (data->entry_parm));
+
+ emit_move_insn (tempreg, validize_mem (data->entry_parm));
+
+ push_to_sequence (all->conversion_insns);
+ tempreg = convert_to_mode (data->nominal_mode, tempreg, unsignedp);
+
+ if (GET_CODE (tempreg) == SUBREG
+ && GET_MODE (tempreg) == data->nominal_mode
+ && REG_P (SUBREG_REG (tempreg))
+ && data->nominal_mode == data->passed_mode
+ && GET_MODE (SUBREG_REG (tempreg)) == GET_MODE (data->entry_parm)
+ && GET_MODE_SIZE (GET_MODE (tempreg))
+ < GET_MODE_SIZE (GET_MODE (data->entry_parm)))
{
- stack_args_size.constant += locate.size.constant;
- if (locate.size.var)
- ADD_PARM_SIZE (stack_args_size, locate.size.var);
+ /* The argument is already sign/zero extended, so note it
+ into the subreg. */
+ SUBREG_PROMOTED_VAR_P (tempreg) = 1;
+ SUBREG_PROMOTED_UNSIGNED_SET (tempreg, unsignedp);
}
- else
- /* No stack slot was pushed for this parm. */
- stack_parm = 0;
- /* Update info on where next arg arrives in registers. */
+ /* TREE_USED gets set erroneously during expand_assignment. */
+ save_tree_used = TREE_USED (parm);
+ expand_assignment (parm, make_tree (data->nominal_type, tempreg));
+ TREE_USED (parm) = save_tree_used;
+ all->conversion_insns = get_insns ();
+ end_sequence ();
- FUNCTION_ARG_ADVANCE (args_so_far, promoted_mode,
- passed_type, named_arg);
-
- /* If we can't trust the parm stack slot to be aligned enough
- for its ultimate type, don't use that slot after entry.
- We'll make another stack slot, if we need one. */
- if (STRICT_ALIGNMENT && stack_parm
- && GET_MODE_ALIGNMENT (nominal_mode) > MEM_ALIGN (stack_parm))
- stack_parm = 0;
-
- /* If parm was passed in memory, and we need to convert it on entry,
- don't store it back in that same slot. */
- if (entry_parm == stack_parm
- && nominal_mode != BLKmode && nominal_mode != passed_mode)
- stack_parm = 0;
-
- /* When an argument is passed in multiple locations, we can't
- make use of this information, but we can save some copying if
- the whole argument is passed in a single register. */
- if (GET_CODE (entry_parm) == PARALLEL
- && nominal_mode != BLKmode && passed_mode != BLKmode)
+ did_conversion = true;
+ }
+ else
+ emit_move_insn (parmreg, validize_mem (data->entry_parm));
+
+ /* If we were passed a pointer but the actual value can safely live
+ in a register, put it in one. */
+ if (data->passed_pointer
+ && TYPE_MODE (TREE_TYPE (parm)) != BLKmode
+ /* If by-reference argument was promoted, demote it. */
+ && (TYPE_MODE (TREE_TYPE (parm)) != GET_MODE (DECL_RTL (parm))
+ || use_register_for_decl (parm)))
+ {
+ /* We can't use nominal_mode, because it will have been set to
+ Pmode above. We must use the actual mode of the parm. */
+ parmreg = gen_reg_rtx (TYPE_MODE (TREE_TYPE (parm)));
+ mark_user_reg (parmreg);
+
+ if (GET_MODE (parmreg) != GET_MODE (DECL_RTL (parm)))
{
- int i, len = XVECLEN (entry_parm, 0);
-
- for (i = 0; i < len; i++)
- if (XEXP (XVECEXP (entry_parm, 0, i), 0) != NULL_RTX
- && REG_P (XEXP (XVECEXP (entry_parm, 0, i), 0))
- && (GET_MODE (XEXP (XVECEXP (entry_parm, 0, i), 0))
- == passed_mode)
- && INTVAL (XEXP (XVECEXP (entry_parm, 0, i), 1)) == 0)
- {
- entry_parm = XEXP (XVECEXP (entry_parm, 0, i), 0);
- set_decl_incoming_rtl (parm, entry_parm);
- break;
- }
+ rtx tempreg = gen_reg_rtx (GET_MODE (DECL_RTL (parm)));
+ int unsigned_p = TYPE_UNSIGNED (TREE_TYPE (parm));
+
+ push_to_sequence (all->conversion_insns);
+ emit_move_insn (tempreg, DECL_RTL (parm));
+ tempreg = convert_to_mode (GET_MODE (parmreg), tempreg, unsigned_p);
+ emit_move_insn (parmreg, tempreg);
+ all->conversion_insns = get_insns ();
+ end_sequence ();
+
+ did_conversion = true;
}
+ else
+ emit_move_insn (parmreg, DECL_RTL (parm));
- /* ENTRY_PARM is an RTX for the parameter as it arrives,
- in the mode in which it arrives.
- STACK_PARM is an RTX for a stack slot where the parameter can live
- during the function (in case we want to put it there).
- STACK_PARM is 0 if no stack slot was pushed for it.
+ SET_DECL_RTL (parm, parmreg);
- Now output code if necessary to convert ENTRY_PARM to
- the type in which this function declares it,
- and store that result in an appropriate place,
- which may be a pseudo reg, may be STACK_PARM,
- or may be a local stack slot if STACK_PARM is 0.
+ /* STACK_PARM is the pointer, not the parm, and PARMREG is
+ now the parm. */
+ data->stack_parm = NULL;
+ }
- Set DECL_RTL to that place. */
+ /* Mark the register as eliminable if we did no conversion and it was
+ copied from memory at a fixed offset, and the arg pointer was not
+ copied to a pseudo-reg. If the arg pointer is a pseudo reg or the
+ offset formed an invalid address, such memory-equivalences as we
+ make here would screw up life analysis for it. */
+ if (data->nominal_mode == data->passed_mode
+ && !did_conversion
+ && data->stack_parm != 0
+ && MEM_P (data->stack_parm)
+ && data->locate.offset.var == 0
+ && reg_mentioned_p (virtual_incoming_args_rtx,
+ XEXP (data->stack_parm, 0)))
+ {
+ rtx linsn = get_last_insn ();
+ rtx sinsn, set;
- if (GET_CODE (entry_parm) == PARALLEL
- && nominal_mode != BLKmode
- && XVECLEN (entry_parm, 0) > 1)
+ /* Mark complex types separately. */
+ if (GET_CODE (parmreg) == CONCAT)
{
- /* Reconstitute objects the size of a register or larger using
- register operations instead of the stack. */
- rtx parmreg = gen_reg_rtx (nominal_mode);
-
- if (REG_P (parmreg))
+ enum machine_mode submode
+ = GET_MODE_INNER (GET_MODE (parmreg));
+ int regnor = REGNO (XEXP (parmreg, 0));
+ int regnoi = REGNO (XEXP (parmreg, 1));
+ rtx stackr = adjust_address_nv (data->stack_parm, submode, 0);
+ rtx stacki = adjust_address_nv (data->stack_parm, submode,
+ GET_MODE_SIZE (submode));
+
+ /* Scan backwards for the set of the real and
+ imaginary parts. */
+ for (sinsn = linsn; sinsn != 0;
+ sinsn = prev_nonnote_insn (sinsn))
{
- emit_group_store (parmreg, entry_parm, TREE_TYPE (parm),
- int_size_in_bytes (TREE_TYPE (parm)));
- SET_DECL_RTL (parm, parmreg);
- loaded_in_reg = 1;
+ set = single_set (sinsn);
+ if (set == 0)
+ continue;
+
+ if (SET_DEST (set) == regno_reg_rtx [regnoi])
+ REG_NOTES (sinsn)
+ = gen_rtx_EXPR_LIST (REG_EQUIV, stacki,
+ REG_NOTES (sinsn));
+ else if (SET_DEST (set) == regno_reg_rtx [regnor])
+ REG_NOTES (sinsn)
+ = gen_rtx_EXPR_LIST (REG_EQUIV, stackr,
+ REG_NOTES (sinsn));
}
}
+ else if ((set = single_set (linsn)) != 0
+ && SET_DEST (set) == parmreg)
+ REG_NOTES (linsn)
+ = gen_rtx_EXPR_LIST (REG_EQUIV,
+ data->stack_parm, REG_NOTES (linsn));
+ }
- if (nominal_mode == BLKmode
-#ifdef BLOCK_REG_PADDING
- || (locate.where_pad == (BYTES_BIG_ENDIAN ? upward : downward)
- && GET_MODE_SIZE (promoted_mode) < UNITS_PER_WORD)
-#endif
- || GET_CODE (entry_parm) == PARALLEL)
- {
- /* If a BLKmode arrives in registers, copy it to a stack slot.
- Handle calls that pass values in multiple non-contiguous
- locations. The Irix 6 ABI has examples of this. */
- if (REG_P (entry_parm)
- || (GET_CODE (entry_parm) == PARALLEL
- && (!loaded_in_reg || !optimize)))
- {
- int size = int_size_in_bytes (TREE_TYPE (parm));
- int size_stored = CEIL_ROUND (size, UNITS_PER_WORD);
- rtx mem;
-
- /* Note that we will be storing an integral number of words.
- So we have to be careful to ensure that we allocate an
- integral number of words. We do this below in the
- assign_stack_local if space was not allocated in the argument
- list. If it was, this will not work if PARM_BOUNDARY is not
- a multiple of BITS_PER_WORD. It isn't clear how to fix this
- if it becomes a problem. Exception is when BLKmode arrives
- with arguments not conforming to word_mode. */
-
- if (stack_parm == 0)
- {
- stack_parm = assign_stack_local (BLKmode, size_stored, 0);
- PUT_MODE (stack_parm, GET_MODE (entry_parm));
- set_mem_attributes (stack_parm, parm, 1);
- }
- else if (GET_CODE (entry_parm) == PARALLEL)
- ;
- else if (size != 0 && PARM_BOUNDARY % BITS_PER_WORD != 0)
- abort ();
+ /* For pointer data type, suggest pointer register. */
+ if (POINTER_TYPE_P (TREE_TYPE (parm)))
+ mark_reg_pointer (parmreg,
+ TYPE_ALIGN (TREE_TYPE (TREE_TYPE (parm))));
+}
- mem = validize_mem (stack_parm);
+/* A subroutine of assign_parms. Allocate stack space to hold the current
+ parameter. Get it there. Perform all ABI specified conversions. */
- /* Handle calls that pass values in multiple non-contiguous
- locations. The Irix 6 ABI has examples of this. */
- if (GET_CODE (entry_parm) == PARALLEL)
- emit_group_store (mem, entry_parm, TREE_TYPE (parm), size);
+static void
+assign_parm_setup_stack (struct assign_parm_data_all *all, tree parm,
+ struct assign_parm_data_one *data)
+{
+ /* Value must be stored in the stack slot STACK_PARM during function
+ execution. */
+ bool to_conversion = false;
- else if (size == 0)
- ;
+ if (data->promoted_mode != data->nominal_mode)
+ {
+ /* Conversion is required. */
+ rtx tempreg = gen_reg_rtx (GET_MODE (data->entry_parm));
- /* If SIZE is that of a mode no bigger than a word, just use
- that mode's store operation. */
- else if (size <= UNITS_PER_WORD)
- {
- enum machine_mode mode
- = mode_for_size (size * BITS_PER_UNIT, MODE_INT, 0);
+ emit_move_insn (tempreg, validize_mem (data->entry_parm));
- if (mode != BLKmode
-#ifdef BLOCK_REG_PADDING
- && (size == UNITS_PER_WORD
- || (BLOCK_REG_PADDING (mode, TREE_TYPE (parm), 1)
- != (BYTES_BIG_ENDIAN ? upward : downward)))
-#endif
- )
- {
- rtx reg = gen_rtx_REG (mode, REGNO (entry_parm));
- emit_move_insn (change_address (mem, mode, 0), reg);
- }
+ push_to_sequence (all->conversion_insns);
+ to_conversion = true;
- /* Blocks smaller than a word on a BYTES_BIG_ENDIAN
- machine must be aligned to the left before storing
- to memory. Note that the previous test doesn't
- handle all cases (e.g. SIZE == 3). */
- else if (size != UNITS_PER_WORD
-#ifdef BLOCK_REG_PADDING
- && (BLOCK_REG_PADDING (mode, TREE_TYPE (parm), 1)
- == downward)
-#else
- && BYTES_BIG_ENDIAN
-#endif
- )
- {
- rtx tem, x;
- int by = (UNITS_PER_WORD - size) * BITS_PER_UNIT;
- rtx reg = gen_rtx_REG (word_mode, REGNO (entry_parm));
-
- x = expand_binop (word_mode, ashl_optab, reg,
- GEN_INT (by), 0, 1, OPTAB_WIDEN);
- tem = change_address (mem, word_mode, 0);
- emit_move_insn (tem, x);
- }
- else
- move_block_from_reg (REGNO (entry_parm), mem,
- size_stored / UNITS_PER_WORD);
- }
- else
- move_block_from_reg (REGNO (entry_parm), mem,
- size_stored / UNITS_PER_WORD);
- }
- /* If parm is already bound to register pair, don't change
- this binding. */
- if (! DECL_RTL_SET_P (parm))
- SET_DECL_RTL (parm, stack_parm);
+ data->entry_parm = convert_to_mode (data->nominal_mode, tempreg,
+ TYPE_UNSIGNED (TREE_TYPE (parm)));
+
+ if (data->stack_parm)
+ /* ??? This may need a big-endian conversion on sparc64. */
+ data->stack_parm
+ = adjust_address (data->stack_parm, data->nominal_mode, 0);
+ }
+
+ if (data->entry_parm != data->stack_parm)
+ {
+ rtx src, dest;
+
+ if (data->stack_parm == 0)
+ {
+ data->stack_parm
+ = assign_stack_local (GET_MODE (data->entry_parm),
+ GET_MODE_SIZE (GET_MODE (data->entry_parm)),
+ TYPE_ALIGN (data->passed_type));
+ set_mem_attributes (data->stack_parm, parm, 1);
}
- else if (use_register_for_decl (parm)
- /* Always assign pseudo to structure return or item passed
- by invisible reference. */
- || passed_pointer || parm == function_result_decl)
+
+ dest = validize_mem (data->stack_parm);
+ src = validize_mem (data->entry_parm);
+
+ if (MEM_P (src))
{
- /* Store the parm in a pseudoregister during the function, but we
- may need to do it in a wider mode. */
+ /* Use a block move to handle potentially misaligned entry_parm. */
+ if (!to_conversion)
+ push_to_sequence (all->conversion_insns);
+ to_conversion = true;
+
+ emit_block_move (dest, src,
+ GEN_INT (int_size_in_bytes (data->passed_type)),
+ BLOCK_OP_NORMAL);
+ }
+ else
+ emit_move_insn (dest, src);
+ }
- rtx parmreg;
+ if (to_conversion)
+ {
+ all->conversion_insns = get_insns ();
+ end_sequence ();
+ }
- unsignedp = TYPE_UNSIGNED (TREE_TYPE (parm));
+ SET_DECL_RTL (parm, data->stack_parm);
+}
- promoted_nominal_mode
- = promote_mode (TREE_TYPE (parm), nominal_mode, &unsignedp, 0);
+/* A subroutine of assign_parms. If the ABI splits complex arguments, then
+ undo the frobbing that we did in assign_parms_augmented_arg_list. */
- parmreg = gen_reg_rtx (promoted_nominal_mode);
- mark_user_reg (parmreg);
+static void
+assign_parms_unsplit_complex (struct assign_parm_data_all *all, tree fnargs)
+{
+ tree parm;
+ tree orig_fnargs = all->orig_fnargs;
- /* If this was an item that we received a pointer to, set DECL_RTL
- appropriately. */
- if (passed_pointer)
- {
- rtx x = gen_rtx_MEM (TYPE_MODE (TREE_TYPE (passed_type)),
- parmreg);
- set_mem_attributes (x, parm, 1);
- SET_DECL_RTL (parm, x);
- }
- else
+ for (parm = orig_fnargs; parm; parm = TREE_CHAIN (parm))
+ {
+ if (TREE_CODE (TREE_TYPE (parm)) == COMPLEX_TYPE
+ && targetm.calls.split_complex_arg (TREE_TYPE (parm)))
+ {
+ rtx tmp, real, imag;
+ enum machine_mode inner = GET_MODE_INNER (DECL_MODE (parm));
+
+ real = DECL_RTL (fnargs);
+ imag = DECL_RTL (TREE_CHAIN (fnargs));
+ if (inner != GET_MODE (real))
{
- SET_DECL_RTL (parm, parmreg);
- maybe_set_unchanging (DECL_RTL (parm), parm);
+ real = gen_lowpart_SUBREG (inner, real);
+ imag = gen_lowpart_SUBREG (inner, imag);
}
- /* Copy the value into the register. */
- if (nominal_mode != passed_mode
- || promoted_nominal_mode != promoted_mode)
+ if (TREE_ADDRESSABLE (parm))
{
- int save_tree_used;
- /* ENTRY_PARM has been converted to PROMOTED_MODE, its
- mode, by the caller. We now have to convert it to
- NOMINAL_MODE, if different. However, PARMREG may be in
- a different mode than NOMINAL_MODE if it is being stored
- promoted.
-
- If ENTRY_PARM is a hard register, it might be in a register
- not valid for operating in its mode (e.g., an odd-numbered
- register for a DFmode). In that case, moves are the only
- thing valid, so we can't do a convert from there. This
- occurs when the calling sequence allow such misaligned
- usages.
-
- In addition, the conversion may involve a call, which could
- clobber parameters which haven't been copied to pseudo
- registers yet. Therefore, we must first copy the parm to
- a pseudo reg here, and save the conversion until after all
- parameters have been moved. */
-
- rtx tempreg = gen_reg_rtx (GET_MODE (entry_parm));
-
- emit_move_insn (tempreg, validize_mem (entry_parm));
-
- push_to_sequence (conversion_insns);
- tempreg = convert_to_mode (nominal_mode, tempreg, unsignedp);
-
- if (GET_CODE (tempreg) == SUBREG
- && GET_MODE (tempreg) == nominal_mode
- && REG_P (SUBREG_REG (tempreg))
- && nominal_mode == passed_mode
- && GET_MODE (SUBREG_REG (tempreg)) == GET_MODE (entry_parm)
- && GET_MODE_SIZE (GET_MODE (tempreg))
- < GET_MODE_SIZE (GET_MODE (entry_parm)))
- {
- /* The argument is already sign/zero extended, so note it
- into the subreg. */
- SUBREG_PROMOTED_VAR_P (tempreg) = 1;
- SUBREG_PROMOTED_UNSIGNED_SET (tempreg, unsignedp);
- }
-
- /* TREE_USED gets set erroneously during expand_assignment. */
- save_tree_used = TREE_USED (parm);
- expand_assignment (parm,
- make_tree (nominal_type, tempreg), 0);
- TREE_USED (parm) = save_tree_used;
- conversion_insns = get_insns ();
- did_conversion = 1;
+ rtx rmem, imem;
+ HOST_WIDE_INT size = int_size_in_bytes (TREE_TYPE (parm));
+
+ /* split_complex_arg put the real and imag parts in
+ pseudos. Move them to memory. */
+ tmp = assign_stack_local (DECL_MODE (parm), size,
+ TYPE_ALIGN (TREE_TYPE (parm)));
+ set_mem_attributes (tmp, parm, 1);
+ rmem = adjust_address_nv (tmp, inner, 0);
+ imem = adjust_address_nv (tmp, inner, GET_MODE_SIZE (inner));
+ push_to_sequence (all->conversion_insns);
+ emit_move_insn (rmem, real);
+ emit_move_insn (imem, imag);
+ all->conversion_insns = get_insns ();
end_sequence ();
}
else
- emit_move_insn (parmreg, validize_mem (entry_parm));
-
- /* If we were passed a pointer but the actual value
- can safely live in a register, put it in one. */
- if (passed_pointer
- && use_register_for_decl (parm)
- /* If by-reference argument was promoted, demote it. */
- && TYPE_MODE (TREE_TYPE (parm)) != GET_MODE (DECL_RTL (parm)))
- {
- /* We can't use nominal_mode, because it will have been set to
- Pmode above. We must use the actual mode of the parm. */
- parmreg = gen_reg_rtx (TYPE_MODE (TREE_TYPE (parm)));
- mark_user_reg (parmreg);
- if (GET_MODE (parmreg) != GET_MODE (DECL_RTL (parm)))
- {
- rtx tempreg = gen_reg_rtx (GET_MODE (DECL_RTL (parm)));
- int unsigned_p = TYPE_UNSIGNED (TREE_TYPE (parm));
- push_to_sequence (conversion_insns);
- emit_move_insn (tempreg, DECL_RTL (parm));
- SET_DECL_RTL (parm,
- convert_to_mode (GET_MODE (parmreg),
- tempreg,
- unsigned_p));
- emit_move_insn (parmreg, DECL_RTL (parm));
- conversion_insns = get_insns();
- did_conversion = 1;
- end_sequence ();
- }
- else
- emit_move_insn (parmreg, DECL_RTL (parm));
- SET_DECL_RTL (parm, parmreg);
- /* STACK_PARM is the pointer, not the parm, and PARMREG is
- now the parm. */
- stack_parm = 0;
- }
-#ifdef FUNCTION_ARG_CALLEE_COPIES
- /* If we are passed an arg by reference and it is our responsibility
- to make a copy, do it now.
- PASSED_TYPE and PASSED mode now refer to the pointer, not the
- original argument, so we must recreate them in the call to
- FUNCTION_ARG_CALLEE_COPIES. */
- /* ??? Later add code to handle the case that if the argument isn't
- modified, don't do the copy. */
-
- else if (passed_pointer
- && FUNCTION_ARG_CALLEE_COPIES (args_so_far,
- TYPE_MODE (TREE_TYPE (passed_type)),
- TREE_TYPE (passed_type),
- named_arg)
- && ! TREE_ADDRESSABLE (TREE_TYPE (passed_type)))
- {
- rtx copy;
- tree type = TREE_TYPE (passed_type);
-
- /* This sequence may involve a library call perhaps clobbering
- registers that haven't been copied to pseudos yet. */
+ tmp = gen_rtx_CONCAT (DECL_MODE (parm), real, imag);
+ SET_DECL_RTL (parm, tmp);
- push_to_sequence (conversion_insns);
-
- if (!COMPLETE_TYPE_P (type)
- || TREE_CODE (TYPE_SIZE (type)) != INTEGER_CST)
- /* This is a variable sized object. */
- copy = gen_rtx_MEM (BLKmode,
- allocate_dynamic_stack_space
- (expr_size (parm), NULL_RTX,
- TYPE_ALIGN (type)));
- else
- copy = assign_stack_temp (TYPE_MODE (type),
- int_size_in_bytes (type), 1);
- set_mem_attributes (copy, parm, 1);
-
- store_expr (parm, copy, 0);
- emit_move_insn (parmreg, XEXP (copy, 0));
- conversion_insns = get_insns ();
- did_conversion = 1;
- end_sequence ();
- }
-#endif /* FUNCTION_ARG_CALLEE_COPIES */
-
- /* Mark the register as eliminable if we did no conversion
- and it was copied from memory at a fixed offset,
- and the arg pointer was not copied to a pseudo-reg.
- If the arg pointer is a pseudo reg or the offset formed
- an invalid address, such memory-equivalences
- as we make here would screw up life analysis for it. */
- if (nominal_mode == passed_mode
- && ! did_conversion
- && stack_parm != 0
- && MEM_P (stack_parm)
- && locate.offset.var == 0
- && reg_mentioned_p (virtual_incoming_args_rtx,
- XEXP (stack_parm, 0)))
+ real = DECL_INCOMING_RTL (fnargs);
+ imag = DECL_INCOMING_RTL (TREE_CHAIN (fnargs));
+ if (inner != GET_MODE (real))
{
- rtx linsn = get_last_insn ();
- rtx sinsn, set;
-
- /* Mark complex types separately. */
- if (GET_CODE (parmreg) == CONCAT)
- {
- enum machine_mode submode
- = GET_MODE_INNER (GET_MODE (parmreg));
- int regnor = REGNO (gen_realpart (submode, parmreg));
- int regnoi = REGNO (gen_imagpart (submode, parmreg));
- rtx stackr = gen_realpart (submode, stack_parm);
- rtx stacki = gen_imagpart (submode, stack_parm);
-
- /* Scan backwards for the set of the real and
- imaginary parts. */
- for (sinsn = linsn; sinsn != 0;
- sinsn = prev_nonnote_insn (sinsn))
- {
- set = single_set (sinsn);
- if (set == 0)
- continue;
-
- if (SET_DEST (set) == regno_reg_rtx [regnoi])
- REG_NOTES (sinsn)
- = gen_rtx_EXPR_LIST (REG_EQUIV, stacki,
- REG_NOTES (sinsn));
- else if (SET_DEST (set) == regno_reg_rtx [regnor])
- REG_NOTES (sinsn)
- = gen_rtx_EXPR_LIST (REG_EQUIV, stackr,
- REG_NOTES (sinsn));
- }
- }
- else if ((set = single_set (linsn)) != 0
- && SET_DEST (set) == parmreg)
- REG_NOTES (linsn)
- = gen_rtx_EXPR_LIST (REG_EQUIV,
- stack_parm, REG_NOTES (linsn));
+ real = gen_lowpart_SUBREG (inner, real);
+ imag = gen_lowpart_SUBREG (inner, imag);
}
-
- /* For pointer data type, suggest pointer register. */
- if (POINTER_TYPE_P (TREE_TYPE (parm)))
- mark_reg_pointer (parmreg,
- TYPE_ALIGN (TREE_TYPE (TREE_TYPE (parm))));
+ tmp = gen_rtx_CONCAT (DECL_MODE (parm), real, imag);
+ set_decl_incoming_rtl (parm, tmp);
+ fnargs = TREE_CHAIN (fnargs);
}
else
{
- /* Value must be stored in the stack slot STACK_PARM
- during function execution. */
+ SET_DECL_RTL (parm, DECL_RTL (fnargs));
+ set_decl_incoming_rtl (parm, DECL_INCOMING_RTL (fnargs));
- if (promoted_mode != nominal_mode)
- {
- /* Conversion is required. */
- rtx tempreg = gen_reg_rtx (GET_MODE (entry_parm));
+ /* Set MEM_EXPR to the original decl, i.e. to PARM,
+ instead of the copy of decl, i.e. FNARGS. */
+ if (DECL_INCOMING_RTL (parm) && MEM_P (DECL_INCOMING_RTL (parm)))
+ set_mem_expr (DECL_INCOMING_RTL (parm), parm);
+ }
- emit_move_insn (tempreg, validize_mem (entry_parm));
+ fnargs = TREE_CHAIN (fnargs);
+ }
+}
- push_to_sequence (conversion_insns);
- entry_parm = convert_to_mode (nominal_mode, tempreg,
- TYPE_UNSIGNED (TREE_TYPE (parm)));
- if (stack_parm)
- /* ??? This may need a big-endian conversion on sparc64. */
- stack_parm = adjust_address (stack_parm, nominal_mode, 0);
+/* Assign RTL expressions to the function's parameters. This may involve
+ copying them into registers and using those registers as the DECL_RTL. */
- conversion_insns = get_insns ();
- did_conversion = 1;
- end_sequence ();
- }
+static void
+assign_parms (tree fndecl)
+{
+ struct assign_parm_data_all all;
+ tree fnargs, parm;
+ rtx internal_arg_pointer;
- if (entry_parm != stack_parm)
- {
- if (stack_parm == 0)
- {
- stack_parm
- = assign_stack_local (GET_MODE (entry_parm),
- GET_MODE_SIZE (GET_MODE (entry_parm)),
- 0);
- set_mem_attributes (stack_parm, parm, 1);
- }
+ /* If the reg that the virtual arg pointer will be translated into is
+ not a fixed reg or is the stack pointer, make a copy of the virtual
+ arg pointer, and address parms via the copy. The frame pointer is
+ considered fixed even though it is not marked as such.
- if (promoted_mode != nominal_mode)
- {
- push_to_sequence (conversion_insns);
- emit_move_insn (validize_mem (stack_parm),
- validize_mem (entry_parm));
- conversion_insns = get_insns ();
- end_sequence ();
- }
- else
- emit_move_insn (validize_mem (stack_parm),
- validize_mem (entry_parm));
- }
+ The second time through, simply use ap to avoid generating rtx. */
- SET_DECL_RTL (parm, stack_parm);
- }
- }
+ if ((ARG_POINTER_REGNUM == STACK_POINTER_REGNUM
+ || ! (fixed_regs[ARG_POINTER_REGNUM]
+ || ARG_POINTER_REGNUM == FRAME_POINTER_REGNUM)))
+ internal_arg_pointer = copy_to_reg (virtual_incoming_args_rtx);
+ else
+ internal_arg_pointer = virtual_incoming_args_rtx;
+ current_function_internal_arg_pointer = internal_arg_pointer;
+
+ assign_parms_initialize_all (&all);
+ fnargs = assign_parms_augmented_arg_list (&all);
- if (targetm.calls.split_complex_arg && fnargs != orig_fnargs)
+ for (parm = fnargs; parm; parm = TREE_CHAIN (parm))
{
- for (parm = orig_fnargs; parm; parm = TREE_CHAIN (parm))
+ struct assign_parm_data_one data;
+
+ /* Extract the type of PARM; adjust it according to ABI. */
+ assign_parm_find_data_types (&all, parm, &data);
+
+ /* Early out for errors and void parameters. */
+ if (data.passed_mode == VOIDmode)
{
- if (TREE_CODE (TREE_TYPE (parm)) == COMPLEX_TYPE
- && targetm.calls.split_complex_arg (TREE_TYPE (parm)))
- {
- rtx tmp, real, imag;
- enum machine_mode inner = GET_MODE_INNER (DECL_MODE (parm));
+ SET_DECL_RTL (parm, const0_rtx);
+ DECL_INCOMING_RTL (parm) = DECL_RTL (parm);
+ continue;
+ }
- real = DECL_RTL (fnargs);
- imag = DECL_RTL (TREE_CHAIN (fnargs));
- if (inner != GET_MODE (real))
- {
- real = gen_lowpart_SUBREG (inner, real);
- imag = gen_lowpart_SUBREG (inner, imag);
- }
- tmp = gen_rtx_CONCAT (DECL_MODE (parm), real, imag);
- SET_DECL_RTL (parm, tmp);
+ if (current_function_stdarg && !TREE_CHAIN (parm))
+ assign_parms_setup_varargs (&all, &data, false);
- real = DECL_INCOMING_RTL (fnargs);
- imag = DECL_INCOMING_RTL (TREE_CHAIN (fnargs));
- if (inner != GET_MODE (real))
- {
- real = gen_lowpart_SUBREG (inner, real);
- imag = gen_lowpart_SUBREG (inner, imag);
- }
- tmp = gen_rtx_CONCAT (DECL_MODE (parm), real, imag);
- set_decl_incoming_rtl (parm, tmp);
- fnargs = TREE_CHAIN (fnargs);
- }
- else
- {
- SET_DECL_RTL (parm, DECL_RTL (fnargs));
- set_decl_incoming_rtl (parm, DECL_INCOMING_RTL (fnargs));
-
- /* Set MEM_EXPR to the original decl, i.e. to PARM,
- instead of the copy of decl, i.e. FNARGS. */
- if (DECL_INCOMING_RTL (parm)
- && MEM_P (DECL_INCOMING_RTL (parm)))
- set_mem_expr (DECL_INCOMING_RTL (parm), parm);
- }
- fnargs = TREE_CHAIN (fnargs);
+ /* Find out where the parameter arrives in this function. */
+ assign_parm_find_entry_rtl (&all, &data);
+
+ /* Find out where stack space for this parameter might be. */
+ if (assign_parm_is_stack_parm (&all, &data))
+ {
+ assign_parm_find_stack_rtl (parm, &data);
+ assign_parm_adjust_entry_rtl (&data);
}
+
+ /* Record permanently how this parm was passed. */
+ set_decl_incoming_rtl (parm, data.entry_parm);
+
+ /* Update info on where next arg arrives in registers. */
+ FUNCTION_ARG_ADVANCE (all.args_so_far, data.promoted_mode,
+ data.passed_type, data.named_arg);
+
+ assign_parm_adjust_stack_rtl (&data);
+
+ if (assign_parm_setup_block_p (&data))
+ assign_parm_setup_block (&all, parm, &data);
+ else if (data.passed_pointer || use_register_for_decl (parm))
+ assign_parm_setup_reg (&all, parm, &data);
+ else
+ assign_parm_setup_stack (&all, parm, &data);
}
+ if (targetm.calls.split_complex_arg && fnargs != all.orig_fnargs)
+ assign_parms_unsplit_complex (&all, fnargs);
+
/* Output all parameter conversion instructions (possibly including calls)
now that all parameters have been copied out of hard registers. */
- emit_insn (conversion_insns);
+ emit_insn (all.conversion_insns);
/* If we are receiving a struct value address as the first argument, set up
the RTL for the function result. As this might require code to convert
the transmitted address to Pmode, we do this here to ensure that possible
preliminary conversions of the address have been emitted already. */
- if (function_result_decl)
+ if (all.function_result_decl)
{
- tree result = DECL_RESULT (fndecl);
- rtx addr = DECL_RTL (function_result_decl);
+ tree result = DECL_RESULT (current_function_decl);
+ rtx addr = DECL_RTL (all.function_result_decl);
rtx x;
- addr = convert_memory_address (Pmode, addr);
- x = gen_rtx_MEM (DECL_MODE (result), addr);
- set_mem_attributes (x, result, 1);
+ if (DECL_BY_REFERENCE (result))
+ x = addr;
+ else
+ {
+ addr = convert_memory_address (Pmode, addr);
+ x = gen_rtx_MEM (DECL_MODE (result), addr);
+ set_mem_attributes (x, result, 1);
+ }
SET_DECL_RTL (result, x);
}
/* We have aligned all the args, so add space for the pretend args. */
- stack_args_size.constant += extra_pretend_bytes;
- current_function_args_size = stack_args_size.constant;
+ current_function_pretend_args_size = all.pretend_args_size;
+ all.stack_args_size.constant += all.extra_pretend_bytes;
+ current_function_args_size = all.stack_args_size.constant;
/* Adjust function incoming argument size for alignment and
minimum length. */
#ifdef ARGS_GROW_DOWNWARD
current_function_arg_offset_rtx
- = (stack_args_size.var == 0 ? GEN_INT (-stack_args_size.constant)
- : expand_expr (size_diffop (stack_args_size.var,
- size_int (-stack_args_size.constant)),
+ = (all.stack_args_size.var == 0 ? GEN_INT (-all.stack_args_size.constant)
+ : expand_expr (size_diffop (all.stack_args_size.var,
+ size_int (-all.stack_args_size.constant)),
NULL_RTX, VOIDmode, 0));
#else
- current_function_arg_offset_rtx = ARGS_SIZE_RTX (stack_args_size);
+ current_function_arg_offset_rtx = ARGS_SIZE_RTX (all.stack_args_size);
#endif
/* See how many bytes, if any, of its args a function should try to pop
/* For stdarg.h function, save info about
regs and stack space used by the named args. */
- current_function_args_info = args_so_far;
+ current_function_args_info = all.args_so_far;
/* Set the rtx used for the function return value. Put this in its
own variable so any optimizers that need this information don't have
}
}
-/* If ARGS contains entries with complex types, split the entry into two
- entries of the component type. Return a new list of substitutions are
- needed, else the old list. */
+/* A subroutine of gimplify_parameters, invoked via walk_tree.
+ For all seen types, gimplify their sizes. */
static tree
-split_complex_args (tree args)
+gimplify_parm_type (tree *tp, int *walk_subtrees, void *data)
{
- tree p;
+ tree t = *tp;
- /* Before allocating memory, check for the common case of no complex. */
- for (p = args; p; p = TREE_CHAIN (p))
+ *walk_subtrees = 0;
+ if (TYPE_P (t))
{
- tree type = TREE_TYPE (p);
- if (TREE_CODE (type) == COMPLEX_TYPE
- && targetm.calls.split_complex_arg (type))
- goto found;
+ if (POINTER_TYPE_P (t))
+ *walk_subtrees = 1;
+ else if (TYPE_SIZE (t) && !TREE_CONSTANT (TYPE_SIZE (t))
+ && !TYPE_SIZES_GIMPLIFIED (t))
+ {
+ gimplify_type_sizes (t, (tree *) data);
+ *walk_subtrees = 1;
+ }
}
- return args;
- found:
- args = copy_list (args);
+ return NULL;
+}
- for (p = args; p; p = TREE_CHAIN (p))
+/* Gimplify the parameter list for current_function_decl. This involves
+ evaluating SAVE_EXPRs of variable sized parameters and generating code
+ to implement callee-copies reference parameters. Returns a list of
+ statements to add to the beginning of the function, or NULL if nothing
+ to do. */
+
+tree
+gimplify_parameters (void)
+{
+ struct assign_parm_data_all all;
+ tree fnargs, parm, stmts = NULL;
+
+ assign_parms_initialize_all (&all);
+ fnargs = assign_parms_augmented_arg_list (&all);
+
+ for (parm = fnargs; parm; parm = TREE_CHAIN (parm))
{
- tree type = TREE_TYPE (p);
- if (TREE_CODE (type) == COMPLEX_TYPE
- && targetm.calls.split_complex_arg (type))
+ struct assign_parm_data_one data;
+
+ /* Extract the type of PARM; adjust it according to ABI. */
+ assign_parm_find_data_types (&all, parm, &data);
+
+ /* Early out for errors and void parameters. */
+ if (data.passed_mode == VOIDmode || DECL_SIZE (parm) == NULL)
+ continue;
+
+ /* Update info on where next arg arrives in registers. */
+ FUNCTION_ARG_ADVANCE (all.args_so_far, data.promoted_mode,
+ data.passed_type, data.named_arg);
+
+ /* ??? Once upon a time variable_size stuffed parameter list
+ SAVE_EXPRs (amongst others) onto a pending sizes list. This
+ turned out to be less than manageable in the gimple world.
+ Now we have to hunt them down ourselves. */
+ walk_tree_without_duplicates (&data.passed_type,
+ gimplify_parm_type, &stmts);
+
+ if (!TREE_CONSTANT (DECL_SIZE (parm)))
{
- tree decl;
- tree subtype = TREE_TYPE (type);
+ gimplify_one_sizepos (&DECL_SIZE (parm), &stmts);
+ gimplify_one_sizepos (&DECL_SIZE_UNIT (parm), &stmts);
+ }
- /* Rewrite the PARM_DECL's type with its component. */
- TREE_TYPE (p) = subtype;
- DECL_ARG_TYPE (p) = TREE_TYPE (DECL_ARG_TYPE (p));
- DECL_MODE (p) = VOIDmode;
- DECL_SIZE (p) = NULL;
- DECL_SIZE_UNIT (p) = NULL;
- layout_decl (p, 0);
+ if (data.passed_pointer)
+ {
+ tree type = TREE_TYPE (data.passed_type);
+ if (reference_callee_copied (&all.args_so_far, TYPE_MODE (type),
+ type, data.named_arg))
+ {
+ tree local, t;
- /* Build a second synthetic decl. */
- decl = build_decl (PARM_DECL, NULL_TREE, subtype);
- DECL_ARG_TYPE (decl) = DECL_ARG_TYPE (p);
- layout_decl (decl, 0);
+ /* For constant sized objects, this is trivial; for
+ variable-sized objects, we have to play games. */
+ if (TREE_CONSTANT (DECL_SIZE (parm)))
+ {
+ local = create_tmp_var (type, get_name (parm));
+ DECL_IGNORED_P (local) = 0;
+ }
+ else
+ {
+ tree ptr_type, addr, args;
+
+ ptr_type = build_pointer_type (type);
+ addr = create_tmp_var (ptr_type, get_name (parm));
+ DECL_IGNORED_P (addr) = 0;
+ local = build_fold_indirect_ref (addr);
+
+ args = tree_cons (NULL, DECL_SIZE_UNIT (parm), NULL);
+ t = built_in_decls[BUILT_IN_ALLOCA];
+ t = build_function_call_expr (t, args);
+ t = fold_convert (ptr_type, t);
+ t = build2 (MODIFY_EXPR, void_type_node, addr, t);
+ gimplify_and_add (t, &stmts);
+ }
- /* Splice it in; skip the new decl. */
- TREE_CHAIN (decl) = TREE_CHAIN (p);
- TREE_CHAIN (p) = decl;
- p = decl;
+ t = build2 (MODIFY_EXPR, void_type_node, local, parm);
+ gimplify_and_add (t, &stmts);
+
+ DECL_VALUE_EXPR (parm) = local;
+ }
}
}
- return args;
+ return stmts;
}
\f
/* Indicate whether REGNO is an incoming argument to the current function
}
#endif /* REG_PARM_STACK_SPACE */
- part_size_in_regs = 0;
- if (reg_parm_stack_space == 0)
- part_size_in_regs = ((partial * UNITS_PER_WORD)
- / (PARM_BOUNDARY / BITS_PER_UNIT)
- * (PARM_BOUNDARY / BITS_PER_UNIT));
+ part_size_in_regs = (reg_parm_stack_space == 0 ? partial : 0);
sizetree
= type ? size_in_bytes (type) : size_int (GET_MODE_SIZE (passed_mode));
where_pad = FUNCTION_ARG_PADDING (passed_mode, type);
boundary = FUNCTION_ARG_BOUNDARY (passed_mode, type);
locate->where_pad = where_pad;
+ locate->boundary = boundary;
#ifdef ARGS_GROW_DOWNWARD
locate->slot_offset.constant = -initial_offset_ptr->constant;
&& DECL_RTL_SET_P (decl)
&& REG_P (DECL_RTL (decl))
&& regno_clobbered_at_setjmp (REGNO (DECL_RTL (decl))))
- warning ("%Jvariable '%D' might be clobbered by `longjmp' or `vfork'",
+ warning ("%Jvariable %qD might be clobbered by %<longjmp%>"
+ " or %<vfork%>",
decl, decl);
}
if (DECL_RTL (decl) != 0
&& REG_P (DECL_RTL (decl))
&& regno_clobbered_at_setjmp (REGNO (DECL_RTL (decl))))
- warning ("%Jargument '%D' might be clobbered by `longjmp' or `vfork'",
+ warning ("%Jargument %qD might be clobbered by %<longjmp%> or %<vfork%>",
decl, decl);
}
\f
-/* Convert a stack slot address ADDR for variable VAR
- (from a containing function)
- into an address valid in this function (using a static chain). */
-
-rtx
-fix_lexical_addr (rtx addr, tree var)
-{
- rtx basereg;
- HOST_WIDE_INT displacement;
- tree context = decl_function_context (var);
- struct function *fp;
- rtx base = 0;
-
- /* If this is the present function, we need not do anything. */
- if (context == current_function_decl)
- return addr;
-
- fp = find_function_data (context);
-
- /* Decode given address as base reg plus displacement. */
- if (REG_P (addr))
- basereg = addr, displacement = 0;
- else if (GET_CODE (addr) == PLUS && GET_CODE (XEXP (addr, 1)) == CONST_INT)
- basereg = XEXP (addr, 0), displacement = INTVAL (XEXP (addr, 1));
- else
- abort ();
-
- if (base == 0)
- abort ();
-
- /* Use same offset, relative to appropriate static chain or argument
- pointer. */
- return plus_constant (base, displacement);
-}
-\f
/* Identify BLOCKs referenced by more than one NOTE_INSN_BLOCK_{BEG,END},
and create duplicate blocks. */
/* ??? Need an option to either create block fragments or to create
for (insn = insns; insn; insn = NEXT_INSN (insn))
{
- if (GET_CODE (insn) == NOTE)
+ if (NOTE_P (insn))
{
if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_BLOCK_BEG)
{
cfun->function_frequency = FUNCTION_FREQUENCY_NORMAL;
- init_stmt_for_function ();
init_eh_for_function ();
lang_hooks.function.init (cfun);
/* We haven't done register allocation yet. */
reg_renumber = 0;
- /* Indicate that we need to distinguish between the return value of the
- present function and the return value of a function being called. */
- rtx_equal_function_value_matters = 1;
-
/* Indicate that we have not instantiated virtual registers yet. */
virtuals_instantiated = 0;
#endif
}
\f
-/* The PENDING_SIZES represent the sizes of variable-sized types.
- Create RTL for the various sizes now (using temporary variables),
- so that we can refer to the sizes from the RTL we are generating
- for the current function. The PENDING_SIZES are a TREE_LIST. The
- TREE_VALUE of each node is a SAVE_EXPR. */
-
-void
-expand_pending_sizes (tree pending_sizes)
-{
- tree tem;
-
- /* Evaluate now the sizes of any types declared among the arguments. */
- for (tem = pending_sizes; tem; tem = TREE_CHAIN (tem))
- {
- expand_expr (TREE_VALUE (tem), const0_rtx, VOIDmode, 0);
- /* Flush the queue in case this parameter declaration has
- side-effects. */
- emit_queue ();
- }
-}
-
/* Start the RTL for a new function, and set variables used for
emitting RTL.
SUBR is the FUNCTION_DECL node.
}
if (value_address)
{
- rtx x = gen_rtx_MEM (DECL_MODE (DECL_RESULT (subr)), value_address);
- set_mem_attributes (x, DECL_RESULT (subr), 1);
+ rtx x = value_address;
+ if (!DECL_BY_REFERENCE (DECL_RESULT (subr)))
+ {
+ x = gen_rtx_MEM (DECL_MODE (DECL_RESULT (subr)), x);
+ set_mem_attributes (x, DECL_RESULT (subr), 1);
+ }
SET_DECL_RTL (DECL_RESULT (subr), x);
}
}
{
/* Compute the return values into a pseudo reg, which we will copy
into the true return register after the cleanups are done. */
-
- /* In order to figure out what mode to use for the pseudo, we
- figure out what the mode of the eventual return register will
- actually be, and use that. */
- rtx hard_reg
- = hard_function_value (TREE_TYPE (DECL_RESULT (subr)),
- subr, 1);
-
- /* Structures that are returned in registers are not aggregate_value_p,
- so we may see a PARALLEL or a REG. */
- if (REG_P (hard_reg))
- SET_DECL_RTL (DECL_RESULT (subr), gen_reg_rtx (GET_MODE (hard_reg)));
- else if (GET_CODE (hard_reg) == PARALLEL)
- SET_DECL_RTL (DECL_RESULT (subr), gen_group_rtx (hard_reg));
+ tree return_type = TREE_TYPE (DECL_RESULT (subr));
+ if (TYPE_MODE (return_type) != BLKmode
+ && targetm.calls.return_in_msb (return_type))
+ /* expand_function_end will insert the appropriate padding in
+ this case. Use the return value's natural (unpadded) mode
+ within the function proper. */
+ SET_DECL_RTL (DECL_RESULT (subr),
+ gen_reg_rtx (TYPE_MODE (return_type)));
else
- abort ();
+ {
+ /* In order to figure out what mode to use for the pseudo, we
+ figure out what the mode of the eventual return register will
+ actually be, and use that. */
+ rtx hard_reg = hard_function_value (return_type, subr, 1);
+
+ /* Structures that are returned in registers are not
+ aggregate_value_p, so we may see a PARALLEL or a REG. */
+ if (REG_P (hard_reg))
+ SET_DECL_RTL (DECL_RESULT (subr),
+ gen_reg_rtx (GET_MODE (hard_reg)));
+ else
+ {
+ gcc_assert (GET_CODE (hard_reg) == PARALLEL);
+ SET_DECL_RTL (DECL_RESULT (subr), gen_group_rtx (hard_reg));
+ }
+ }
/* Set DECL_REGISTER flag so that expand_function_end will copy the
result to the real return register(s). */
set_decl_incoming_rtl (parm, static_chain_incoming_rtx);
SET_DECL_RTL (parm, local);
- maybe_set_unchanging (local, parm);
mark_reg_pointer (local, TYPE_ALIGN (TREE_TYPE (TREE_TYPE (parm))));
emit_move_insn (local, static_chain_incoming_rtx);
before the frame variable gets declared. Help out... */
expand_var (TREE_OPERAND (cfun->nonlocal_goto_save_area, 0));
- t_save = build (ARRAY_REF, ptr_type_node, cfun->nonlocal_goto_save_area,
- integer_zero_node, NULL_TREE, NULL_TREE);
+ t_save = build4 (ARRAY_REF, ptr_type_node,
+ cfun->nonlocal_goto_save_area,
+ integer_zero_node, NULL_TREE, NULL_TREE);
r_save = expand_expr (t_save, NULL_RTX, VOIDmode, EXPAND_WRITE);
+ r_save = convert_memory_address (Pmode, r_save);
emit_move_insn (r_save, virtual_stack_vars_rtx);
update_nonlocal_goto_save_area ();
as opposed to parm setup. */
emit_note (NOTE_INSN_FUNCTION_BEG);
- if (GET_CODE (get_last_insn ()) != NOTE)
+ if (!NOTE_P (get_last_insn ()))
emit_note (NOTE_INSN_DELETED);
parm_birth_insn = get_last_insn ();
since some things (like trampolines) get placed before this. */
tail_recursion_reentry = emit_note (NOTE_INSN_DELETED);
- /* Evaluate now the sizes of any types declared among the arguments. */
- expand_pending_sizes (nreverse (get_pending_sizes ()));
-
/* Make sure there is a line number after the function entry setup code. */
force_next_line_note ();
}
decl; decl = TREE_CHAIN (decl))
if (!TREE_USED (decl) && TREE_CODE (decl) == PARM_DECL
&& DECL_NAME (decl) && !DECL_ARTIFICIAL (decl))
- warning ("%Junused parameter '%D'", decl, decl);
+ warning ("%Junused parameter %qD", decl, decl);
}
static GTY(()) rtx initial_trampoline;
{
rtx clobber_after;
- finish_expr_for_function ();
-
/* If arg_pointer_save_area was referenced only from a nested
function, we will not have initialized it yet. Do that now. */
if (arg_pointer_save_area && ! cfun->arg_pointer_save_area_init)
rtx insn, seq;
for (insn = get_insns (); insn; insn = NEXT_INSN (insn))
- if (GET_CODE (insn) == CALL_INSN)
+ if (CALL_P (insn))
{
start_sequence ();
probe_stack_range (STACK_CHECK_PROTECT,
is computed. */
clobber_after = get_last_insn ();
- /* Output the label for the actual return from the function,
- if one is expected. This happens either because a function epilogue
- is used instead of a return instruction, or because a return was done
- with a goto in order to run local cleanups, or because of pcc-style
- structure returning. */
- if (return_label)
- emit_label (return_label);
+ /* Output the label for the actual return from the function. */
+ emit_label (return_label);
/* Let except.c know where it should emit the call to unregister
the function context for sjlj exceptions. */
if (flag_exceptions && USING_SJLJ_EXCEPTIONS)
sjlj_emit_function_exit_after (get_last_insn ());
- /* If we had calls to alloca, and this machine needs
- an accurate stack pointer to exit the function,
- insert some code to save and restore the stack pointer. */
- if (! EXIT_IGNORE_STACK
- && current_function_calls_alloca)
- {
- rtx tem = 0;
-
- emit_stack_save (SAVE_FUNCTION, &tem, parm_birth_insn);
- emit_stack_restore (SAVE_FUNCTION, tem, NULL_RTX);
- }
-
/* If scalar return value was computed in a pseudo-reg, or was a named
return value that got dumped to the stack, copy that to the hard
return register. */
rtx real_decl_rtl = current_function_return_rtx;
/* This should be set in assign_parms. */
- if (! REG_FUNCTION_VALUE_P (real_decl_rtl))
- abort ();
+ gcc_assert (REG_FUNCTION_VALUE_P (real_decl_rtl));
/* If this is a BLKmode structure being returned in registers,
then use the mode computed in expand_return. Note that if
if (GET_MODE (real_decl_rtl) == BLKmode)
PUT_MODE (real_decl_rtl, GET_MODE (decl_rtl));
+ /* If a non-BLKmode return value should be padded at the least
+ significant end of the register, shift it left by the appropriate
+ amount. BLKmode results are handled using the group load/store
+ machinery. */
+ if (TYPE_MODE (TREE_TYPE (decl_result)) != BLKmode
+ && targetm.calls.return_in_msb (TREE_TYPE (decl_result)))
+ {
+ emit_move_insn (gen_rtx_REG (GET_MODE (decl_rtl),
+ REGNO (real_decl_rtl)),
+ decl_rtl);
+ shift_return_value (GET_MODE (decl_rtl), true, real_decl_rtl);
+ }
/* If a named return value dumped decl_return to memory, then
we may need to re-do the PROMOTE_MODE signed/unsigned
extension. */
- if (GET_MODE (real_decl_rtl) != GET_MODE (decl_rtl))
+ else if (GET_MODE (real_decl_rtl) != GET_MODE (decl_rtl))
{
int unsignedp = TYPE_UNSIGNED (TREE_TYPE (decl_result));
if (current_function_returns_struct
|| current_function_returns_pcc_struct)
{
- rtx value_address
- = XEXP (DECL_RTL (DECL_RESULT (current_function_decl)), 0);
+ rtx value_address = DECL_RTL (DECL_RESULT (current_function_decl));
tree type = TREE_TYPE (DECL_RESULT (current_function_decl));
+ rtx outgoing;
+
+ if (DECL_BY_REFERENCE (DECL_RESULT (current_function_decl)))
+ type = TREE_TYPE (type);
+ else
+ value_address = XEXP (value_address, 0);
+
#ifdef FUNCTION_OUTGOING_VALUE
- rtx outgoing
- = FUNCTION_OUTGOING_VALUE (build_pointer_type (type),
- current_function_decl);
+ outgoing = FUNCTION_OUTGOING_VALUE (build_pointer_type (type),
+ current_function_decl);
#else
- rtx outgoing
- = FUNCTION_VALUE (build_pointer_type (type), current_function_decl);
-#endif
+ outgoing = FUNCTION_VALUE (build_pointer_type (type),
+ current_function_decl);
+#endif
/* Mark this as a function return value so integrate will delete the
assignment and USE below when inlining this function. */
/* Emit the actual code to clobber return register. */
{
- rtx seq, after;
+ rtx seq;
start_sequence ();
clobber_return_register ();
+ expand_naked_return ();
seq = get_insns ();
end_sequence ();
- after = emit_insn_after (seq, clobber_after);
+ emit_insn_after (seq, clobber_after);
}
- /* Output the label for the naked return from the function, if one is
- expected. This is currently used only by __builtin_return. */
- if (naked_return_label)
- emit_label (naked_return_label);
+ /* Output the label for the naked return from the function. */
+ emit_label (naked_return_label);
+
+ /* If we had calls to alloca, and this machine needs
+ an accurate stack pointer to exit the function,
+ insert some code to save and restore the stack pointer. */
+ if (! EXIT_IGNORE_STACK
+ && current_function_calls_alloca)
+ {
+ rtx tem = 0;
+
+ emit_stack_save (SAVE_FUNCTION, &tem, parm_birth_insn);
+ emit_stack_restore (SAVE_FUNCTION, tem, NULL_RTX);
+ }
/* ??? This should no longer be necessary since stupid is no longer with
us, but there are some parts of the compiler (eg reload_combine, and
sh mach_dep_reorg) that still try and compute their own lifetime info
instead of using the general framework. */
use_return_register ();
-
- /* Fix up any gotos that jumped out to the outermost
- binding level of the function.
- Must follow emitting RETURN_LABEL. */
-
- /* If you have any cleanups to do at this point,
- and they need to create temporary variables,
- then you will lose. */
- expand_fixups (get_insns ());
}
rtx
end_sequence ();
push_topmost_sequence ();
- emit_insn_after (seq, get_insns ());
+ emit_insn_after (seq, entry_of_function ());
pop_topmost_sequence ();
}
{
int i, j;
- if (GET_CODE (insn) == INSN
+ if (NONJUMP_INSN_P (insn)
&& GET_CODE (PATTERN (insn)) == SEQUENCE)
{
int count = 0;
insn = next;
continue;
}
- else if (MEM_P (retaddr)
- && REG_P (XEXP (retaddr, 0)))
- base = gen_rtx_REG (Pmode, REGNO (XEXP (retaddr, 0))), offset = 0;
- else if (MEM_P (retaddr)
- && GET_CODE (XEXP (retaddr, 0)) == PLUS
- && REG_P (XEXP (XEXP (retaddr, 0), 0))
- && GET_CODE (XEXP (XEXP (retaddr, 0), 1)) == CONST_INT)
+ else
{
- base = gen_rtx_REG (Pmode, REGNO (XEXP (XEXP (retaddr, 0), 0)));
- offset = INTVAL (XEXP (XEXP (retaddr, 0), 1));
+ rtx ret_ptr;
+ gcc_assert (MEM_P (retaddr));
+
+ ret_ptr = XEXP (retaddr, 0);
+
+ if (REG_P (ret_ptr))
+ {
+ base = gen_rtx_REG (Pmode, REGNO (ret_ptr));
+ offset = 0;
+ }
+ else
+ {
+ gcc_assert (GET_CODE (ret_ptr) == PLUS
+ && REG_P (XEXP (ret_ptr, 0))
+ && GET_CODE (XEXP (ret_ptr, 1)) == CONST_INT);
+ base = gen_rtx_REG (Pmode, REGNO (XEXP (ret_ptr, 0)));
+ offset = INTVAL (XEXP (ret_ptr, 1));
+ }
}
- else
- abort ();
/* If the base of the location containing the return pointer
is SP, we must update it with the replacement address. Otherwise,
&& info.const_equiv[regno] == 0)
break;
- if (regno == FIRST_PSEUDO_REGISTER)
- abort ();
+ gcc_assert (regno < FIRST_PSEUDO_REGISTER);
reg = gen_rtx_REG (Pmode, regno);
emit_move_insn (reg, retaddr);
/* Show the SET in the above insn is a RETURN. */
jump_set = single_set (jump_insn);
- if (jump_set == 0)
- abort ();
- else
- SET_IS_RETURN_P (jump_set) = 1;
+ gcc_assert (jump_set);
+ SET_IS_RETURN_P (jump_set) = 1;
}
/* If SP is not mentioned in the pattern and its equivalent register, if
&& (info.sp_equiv_reg == stack_pointer_rtx
|| !reg_set_p (info.sp_equiv_reg, insn)))
{
- if (! validate_replace_rtx (stack_pointer_rtx,
- plus_constant (info.sp_equiv_reg,
- info.sp_offset),
- insn))
- abort ();
+ int changed;
+
+ changed = validate_replace_rtx (stack_pointer_rtx,
+ plus_constant (info.sp_equiv_reg,
+ info.sp_offset),
+ insn);
+ gcc_assert (changed);
add_insn (insn);
}
set from. If unknown, abort. */
if (reg_set_p (stack_pointer_rtx, set))
{
- if (SET_DEST (set) != stack_pointer_rtx)
- abort ();
+ gcc_assert (SET_DEST (set) == stack_pointer_rtx);
if (GET_CODE (SET_SRC (set)) == PLUS)
{
p->new_sp_equiv_reg = XEXP (SET_SRC (set), 0);
if (GET_CODE (XEXP (SET_SRC (set), 1)) == CONST_INT)
p->new_sp_offset = INTVAL (XEXP (SET_SRC (set), 1));
- else if (REG_P (XEXP (SET_SRC (set), 1))
- && REGNO (XEXP (SET_SRC (set), 1)) < FIRST_PSEUDO_REGISTER
- && p->const_equiv[REGNO (XEXP (SET_SRC (set), 1))] != 0)
- p->new_sp_offset
- = INTVAL (p->const_equiv[REGNO (XEXP (SET_SRC (set), 1))]);
else
- abort ();
+ {
+ gcc_assert (REG_P (XEXP (SET_SRC (set), 1))
+ && (REGNO (XEXP (SET_SRC (set), 1))
+ < FIRST_PSEUDO_REGISTER)
+ && p->const_equiv[REGNO (XEXP (SET_SRC (set), 1))]);
+ p->new_sp_offset
+ = INTVAL (p->const_equiv[REGNO (XEXP (SET_SRC (set), 1))]);
+ }
}
else
p->new_sp_equiv_reg = SET_SRC (set), p->new_sp_offset = 0;
p->new_sp_offset += p->sp_offset;
}
- if (p->new_sp_equiv_reg == 0 || !REG_P (p->new_sp_equiv_reg))
- abort ();
+ gcc_assert (p->new_sp_equiv_reg && REG_P (p->new_sp_equiv_reg));
return;
}
Pmode). */
else if (p->new_sp_equiv_reg != 0 && reg_set_p (p->new_sp_equiv_reg, set))
{
- if (p->equiv_reg_src != 0
- || !REG_P (p->new_sp_equiv_reg)
- || !REG_P (SET_DEST (set))
- || GET_MODE_BITSIZE (GET_MODE (SET_DEST (set))) > BITS_PER_WORD
- || REGNO (p->new_sp_equiv_reg) != REGNO (SET_DEST (set)))
- abort ();
- else
- p->equiv_reg_src
- = simplify_replace_rtx (SET_SRC (set), stack_pointer_rtx,
- plus_constant (p->sp_equiv_reg,
- p->sp_offset));
+ gcc_assert (!p->equiv_reg_src
+ && REG_P (p->new_sp_equiv_reg)
+ && REG_P (SET_DEST (set))
+ && (GET_MODE_BITSIZE (GET_MODE (SET_DEST (set)))
+ <= BITS_PER_WORD)
+ && REGNO (p->new_sp_equiv_reg) == REGNO (SET_DEST (set)));
+ p->equiv_reg_src
+ = simplify_replace_rtx (SET_SRC (set), stack_pointer_rtx,
+ plus_constant (p->sp_equiv_reg,
+ p->sp_offset));
}
/* Otherwise, replace any references to SP in the insn to its new value
#if defined (HAVE_epilogue) || defined(HAVE_return)
rtx epilogue_end = NULL_RTX;
#endif
+ edge_iterator ei;
#ifdef HAVE_prologue
if (HAVE_prologue)
/* Can't deal with multiple successors of the entry block
at the moment. Function should always have at least one
entry point. */
- if (!ENTRY_BLOCK_PTR->succ || ENTRY_BLOCK_PTR->succ->succ_next)
- abort ();
+ gcc_assert (single_succ_p (ENTRY_BLOCK_PTR));
- insert_insn_on_edge (seq, ENTRY_BLOCK_PTR->succ);
+ insert_insn_on_edge (seq, single_succ_edge (ENTRY_BLOCK_PTR));
inserted = 1;
}
#endif
/* If the exit block has no non-fake predecessors, we don't need
an epilogue. */
- for (e = EXIT_BLOCK_PTR->pred; e; e = e->pred_next)
+ FOR_EACH_EDGE (e, ei, EXIT_BLOCK_PTR->preds)
if ((e->flags & EDGE_FAKE) == 0)
break;
if (e == NULL)
emit (conditional) return instructions. */
basic_block last;
- edge e_next;
rtx label;
- for (e = EXIT_BLOCK_PTR->pred; e; e = e->pred_next)
+ FOR_EACH_EDGE (e, ei, EXIT_BLOCK_PTR->preds)
if (e->flags & EDGE_FALLTHRU)
break;
if (e == NULL)
/* Verify that there are no active instructions in the last block. */
label = BB_END (last);
- while (label && GET_CODE (label) != CODE_LABEL)
+ while (label && !LABEL_P (label))
{
if (active_insn_p (label))
break;
label = PREV_INSN (label);
}
- if (BB_HEAD (last) == label && GET_CODE (label) == CODE_LABEL)
+ if (BB_HEAD (last) == label && LABEL_P (label))
{
+ edge_iterator ei2;
rtx epilogue_line_note = NULL_RTX;
/* Locate the line number associated with the closing brace,
for (seq = get_last_insn ();
seq && ! active_insn_p (seq);
seq = PREV_INSN (seq))
- if (GET_CODE (seq) == NOTE && NOTE_LINE_NUMBER (seq) > 0)
+ if (NOTE_P (seq) && NOTE_LINE_NUMBER (seq) > 0)
{
epilogue_line_note = seq;
break;
}
- for (e = last->pred; e; e = e_next)
+ for (ei2 = ei_start (last->preds); (e = ei_safe_edge (ei2)); )
{
basic_block bb = e->src;
rtx jump;
- e_next = e->pred_next;
if (bb == ENTRY_BLOCK_PTR)
- continue;
+ {
+ ei_next (&ei2);
+ continue;
+ }
jump = BB_END (bb);
- if ((GET_CODE (jump) != JUMP_INSN) || JUMP_LABEL (jump) != label)
- continue;
+ if (!JUMP_P (jump) || JUMP_LABEL (jump) != label)
+ {
+ ei_next (&ei2);
+ continue;
+ }
/* If we have an unconditional jump, we can replace that
with a simple return instruction. */
else if (condjump_p (jump))
{
if (! redirect_jump (jump, 0, 0))
- continue;
+ {
+ ei_next (&ei2);
+ continue;
+ }
/* If this block has only one successor, it both jumps
and falls through to the fallthru block, so we can't
delete the edge. */
- if (bb->succ->succ_next == NULL)
- continue;
+ if (single_succ_p (bb))
+ {
+ ei_next (&ei2);
+ continue;
+ }
}
else
- continue;
+ {
+ ei_next (&ei2);
+ continue;
+ }
/* Fix up the CFG for the successful change we just made. */
redirect_edge_succ (e, EXIT_BLOCK_PTR);
emit_barrier_after (BB_END (last));
emit_return_into_block (last, epilogue_line_note);
epilogue_end = BB_END (last);
- last->succ->flags &= ~EDGE_FALLTHRU;
+ single_succ_edge (last)->flags &= ~EDGE_FALLTHRU;
goto epilogue_done;
}
}
There really shouldn't be a mixture -- either all should have
been converted or none, however... */
- for (e = EXIT_BLOCK_PTR->pred; e; e = e->pred_next)
+ FOR_EACH_EDGE (e, ei, EXIT_BLOCK_PTR->preds)
if (e->flags & EDGE_FALLTHRU)
break;
if (e == NULL)
use return. Inserting a jump 'by hand' is extremely messy, so
we take advantage of cfg_layout_finalize using
fixup_fallthru_exit_predecessor. */
- cfg_layout_initialize ();
+ cfg_layout_initialize (0);
FOR_EACH_BB (cur_bb)
if (cur_bb->index >= 0 && cur_bb->next_bb->index >= 0)
cur_bb->rbi->next = cur_bb->next_bb;
#ifdef HAVE_sibcall_epilogue
/* Emit sibling epilogues before any sibling call sites. */
- for (e = EXIT_BLOCK_PTR->pred; e; e = e->pred_next)
+ for (ei = ei_start (EXIT_BLOCK_PTR->preds); (e = ei_safe_edge (ei)); )
{
basic_block bb = e->src;
rtx insn = BB_END (bb);
- rtx i;
- rtx newinsn;
- if (GET_CODE (insn) != CALL_INSN
+ if (!CALL_P (insn)
|| ! SIBLING_CALL_P (insn))
- continue;
+ {
+ ei_next (&ei);
+ continue;
+ }
start_sequence ();
emit_insn (gen_sibcall_epilogue ());
record_insns (seq, &sibcall_epilogue);
set_insn_locators (seq, epilogue_locator);
- i = PREV_INSN (insn);
- newinsn = emit_insn_before (seq, insn);
+ emit_insn_before (seq, insn);
+ ei_next (&ei);
}
#endif
for (insn = prologue_end; insn; insn = prev)
{
prev = PREV_INSN (insn);
- if (GET_CODE (insn) == NOTE && NOTE_LINE_NUMBER (insn) > 0)
+ if (NOTE_P (insn) && NOTE_LINE_NUMBER (insn) > 0)
{
/* Note that we cannot reorder the first insn in the
chain, since rest_of_compilation relies on that
for (insn = BB_END (ENTRY_BLOCK_PTR->next_bb);
insn != prologue_end && insn;
insn = PREV_INSN (insn))
- if (GET_CODE (insn) == NOTE && NOTE_LINE_NUMBER (insn) > 0)
+ if (NOTE_P (insn) && NOTE_LINE_NUMBER (insn) > 0)
break;
/* If we didn't find one, make a copy of the first line number
for (insn = next_active_insn (prologue_end);
insn;
insn = PREV_INSN (insn))
- if (GET_CODE (insn) == NOTE && NOTE_LINE_NUMBER (insn) > 0)
+ if (NOTE_P (insn) && NOTE_LINE_NUMBER (insn) > 0)
{
emit_note_copy_after (insn, prologue_end);
break;
for (insn = epilogue_end; insn; insn = next)
{
next = NEXT_INSN (insn);
- if (GET_CODE (insn) == NOTE
+ if (NOTE_P (insn)
&& (NOTE_LINE_NUMBER (insn) > 0
|| NOTE_LINE_NUMBER (insn) == NOTE_INSN_FUNCTION_BEG
|| NOTE_LINE_NUMBER (insn) == NOTE_INSN_FUNCTION_END))
reorg has run. */
for (insn = f; insn; insn = NEXT_INSN (insn))
{
- if (GET_CODE (insn) == NOTE)
+ if (NOTE_P (insn))
{
if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_PROLOGUE_END)
note = insn;
if (note == 0)
{
for (note = last; (note = NEXT_INSN (note));)
- if (GET_CODE (note) == NOTE
+ if (NOTE_P (note)
&& NOTE_LINE_NUMBER (note) == NOTE_INSN_PROLOGUE_END)
break;
}
/* Avoid placing note between CODE_LABEL and BASIC_BLOCK note. */
- if (GET_CODE (last) == CODE_LABEL)
+ if (LABEL_P (last))
last = NEXT_INSN (last);
reorder_insns (note, note, last);
}
reorg has run. */
for (insn = get_last_insn (); insn; insn = PREV_INSN (insn))
{
- if (GET_CODE (insn) == NOTE)
+ if (NOTE_P (insn))
{
if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_EPILOGUE_BEG)
note = insn;
if (note == 0)
{
for (note = insn; (note = PREV_INSN (note));)
- if (GET_CODE (note) == NOTE
+ if (NOTE_P (note)
&& NOTE_LINE_NUMBER (note) == NOTE_INSN_EPILOGUE_BEG)
break;
}
OSDN Git Service
