2012-03-27 23:13:14 +00:00
|
|
|
|
/* Combine stack adjustments.
|
2022-10-27 18:55:19 +00:00
|
|
|
|
Copyright (C) 1987-2022 Free Software Foundation, Inc.
|
2012-03-27 23:13:14 +00:00
|
|
|
|
|
|
|
|
|
This file is part of GCC.
|
|
|
|
|
|
|
|
|
|
GCC is free software; you can redistribute it and/or modify it under
|
|
|
|
|
the terms of the GNU General Public License as published by the Free
|
|
|
|
|
Software Foundation; either version 3, or (at your option) any later
|
|
|
|
|
version.
|
|
|
|
|
|
|
|
|
|
GCC is distributed in the hope that it will be useful, but WITHOUT ANY
|
|
|
|
|
WARRANTY; without even the implied warranty of MERCHANTABILITY or
|
|
|
|
|
FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
|
|
|
|
|
for more details.
|
|
|
|
|
|
|
|
|
|
You should have received a copy of the GNU General Public License
|
|
|
|
|
along with GCC; see the file COPYING3. If not see
|
|
|
|
|
<http://www.gnu.org/licenses/>. */
|
|
|
|
|
|
|
|
|
|
/* Track stack adjustments and stack memory references. Attempt to
|
|
|
|
|
reduce the number of stack adjustments by back-propagating across
|
|
|
|
|
the memory references.
|
|
|
|
|
|
|
|
|
|
This is intended primarily for use with targets that do not define
|
|
|
|
|
ACCUMULATE_OUTGOING_ARGS. It is of significantly more value to
|
|
|
|
|
targets that define PREFERRED_STACK_BOUNDARY more aligned than
|
|
|
|
|
STACK_BOUNDARY (e.g. x86), or if not all registers can be pushed
|
|
|
|
|
(e.g. x86 fp regs) which would ordinarily have to be implemented
|
2022-10-27 18:55:19 +00:00
|
|
|
|
as a sub/mov pair due to restrictions in calls.cc.
|
2012-03-27 23:13:14 +00:00
|
|
|
|
|
|
|
|
|
Propagation stops when any of the insns that need adjusting are
|
|
|
|
|
(a) no longer valid because we've exceeded their range, (b) a
|
|
|
|
|
non-trivial push instruction, or (c) a call instruction.
|
|
|
|
|
|
|
|
|
|
Restriction B is based on the assumption that push instructions
|
|
|
|
|
are smaller or faster. If a port really wants to remove all
|
|
|
|
|
pushes, it should have defined ACCUMULATE_OUTGOING_ARGS. The
|
|
|
|
|
one exception that is made is for an add immediately followed
|
|
|
|
|
by a push. */
|
|
|
|
|
|
|
|
|
|
#include "config.h"
|
|
|
|
|
#include "system.h"
|
|
|
|
|
#include "coretypes.h"
|
2017-04-10 11:32:00 +00:00
|
|
|
|
#include "backend.h"
|
2012-03-27 23:13:14 +00:00
|
|
|
|
#include "rtl.h"
|
2017-04-10 11:32:00 +00:00
|
|
|
|
#include "df.h"
|
2012-03-27 23:13:14 +00:00
|
|
|
|
#include "insn-config.h"
|
2017-10-07 00:16:47 +00:00
|
|
|
|
#include "memmodel.h"
|
2015-08-28 15:33:40 +00:00
|
|
|
|
#include "emit-rtl.h"
|
2017-04-10 11:32:00 +00:00
|
|
|
|
#include "recog.h"
|
2015-08-28 15:33:40 +00:00
|
|
|
|
#include "cfgrtl.h"
|
2012-03-27 23:13:14 +00:00
|
|
|
|
#include "tree-pass.h"
|
2015-08-28 15:33:40 +00:00
|
|
|
|
#include "rtl-iter.h"
|
2012-03-27 23:13:14 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/* This structure records two kinds of stack references between stack
|
|
|
|
|
adjusting instructions: stack references in memory addresses for
|
|
|
|
|
regular insns and all stack references for debug insns. */
|
|
|
|
|
|
|
|
|
|
struct csa_reflist
|
|
|
|
|
{
|
|
|
|
|
HOST_WIDE_INT sp_offset;
|
2015-08-28 15:33:40 +00:00
|
|
|
|
rtx_insn *insn;
|
|
|
|
|
rtx *ref;
|
2012-03-27 23:13:14 +00:00
|
|
|
|
struct csa_reflist *next;
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
static int stack_memref_p (rtx);
|
2015-08-28 15:33:40 +00:00
|
|
|
|
static rtx single_set_for_csa (rtx_insn *);
|
2012-03-27 23:13:14 +00:00
|
|
|
|
static void free_csa_reflist (struct csa_reflist *);
|
2015-08-28 15:33:40 +00:00
|
|
|
|
static struct csa_reflist *record_one_stack_ref (rtx_insn *, rtx *,
|
2012-03-27 23:13:14 +00:00
|
|
|
|
struct csa_reflist *);
|
2022-10-27 18:55:19 +00:00
|
|
|
|
static bool try_apply_stack_adjustment (rtx_insn *, struct csa_reflist *,
|
|
|
|
|
HOST_WIDE_INT, HOST_WIDE_INT,
|
|
|
|
|
bitmap, rtx_insn *);
|
|
|
|
|
static void combine_stack_adjustments_for_block (basic_block, bitmap);
|
2012-03-27 23:13:14 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/* Main entry point for stack adjustment combination. */
|
|
|
|
|
|
|
|
|
|
static void
|
|
|
|
|
combine_stack_adjustments (void)
|
|
|
|
|
{
|
|
|
|
|
basic_block bb;
|
2022-10-27 18:55:19 +00:00
|
|
|
|
bitmap live = BITMAP_ALLOC (®_obstack);
|
2012-03-27 23:13:14 +00:00
|
|
|
|
|
2014-09-21 17:33:12 +00:00
|
|
|
|
FOR_EACH_BB_FN (bb, cfun)
|
2022-10-27 18:55:19 +00:00
|
|
|
|
combine_stack_adjustments_for_block (bb, live);
|
|
|
|
|
|
|
|
|
|
BITMAP_FREE (live);
|
2012-03-27 23:13:14 +00:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Recognize a MEM of the form (sp) or (plus sp const). */
|
|
|
|
|
|
|
|
|
|
static int
|
|
|
|
|
stack_memref_p (rtx x)
|
|
|
|
|
{
|
|
|
|
|
if (!MEM_P (x))
|
|
|
|
|
return 0;
|
|
|
|
|
x = XEXP (x, 0);
|
|
|
|
|
|
|
|
|
|
if (x == stack_pointer_rtx)
|
|
|
|
|
return 1;
|
|
|
|
|
if (GET_CODE (x) == PLUS
|
|
|
|
|
&& XEXP (x, 0) == stack_pointer_rtx
|
|
|
|
|
&& CONST_INT_P (XEXP (x, 1)))
|
|
|
|
|
return 1;
|
|
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Recognize either normal single_set or the hack in i386.md for
|
|
|
|
|
tying fp and sp adjustments. */
|
|
|
|
|
|
|
|
|
|
static rtx
|
2015-08-28 15:33:40 +00:00
|
|
|
|
single_set_for_csa (rtx_insn *insn)
|
2012-03-27 23:13:14 +00:00
|
|
|
|
{
|
|
|
|
|
int i;
|
|
|
|
|
rtx tmp = single_set (insn);
|
|
|
|
|
if (tmp)
|
|
|
|
|
return tmp;
|
|
|
|
|
|
|
|
|
|
if (!NONJUMP_INSN_P (insn)
|
|
|
|
|
|| GET_CODE (PATTERN (insn)) != PARALLEL)
|
|
|
|
|
return NULL_RTX;
|
|
|
|
|
|
|
|
|
|
tmp = PATTERN (insn);
|
|
|
|
|
if (GET_CODE (XVECEXP (tmp, 0, 0)) != SET)
|
|
|
|
|
return NULL_RTX;
|
|
|
|
|
|
|
|
|
|
for (i = 1; i < XVECLEN (tmp, 0); ++i)
|
|
|
|
|
{
|
|
|
|
|
rtx this_rtx = XVECEXP (tmp, 0, i);
|
|
|
|
|
|
|
|
|
|
/* The special case is allowing a no-op set. */
|
|
|
|
|
if (GET_CODE (this_rtx) == SET
|
|
|
|
|
&& SET_SRC (this_rtx) == SET_DEST (this_rtx))
|
|
|
|
|
;
|
|
|
|
|
else if (GET_CODE (this_rtx) != CLOBBER
|
|
|
|
|
&& GET_CODE (this_rtx) != USE)
|
|
|
|
|
return NULL_RTX;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
return XVECEXP (tmp, 0, 0);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Free the list of csa_reflist nodes. */
|
|
|
|
|
|
|
|
|
|
static void
|
|
|
|
|
free_csa_reflist (struct csa_reflist *reflist)
|
|
|
|
|
{
|
|
|
|
|
struct csa_reflist *next;
|
|
|
|
|
for (; reflist ; reflist = next)
|
|
|
|
|
{
|
|
|
|
|
next = reflist->next;
|
|
|
|
|
free (reflist);
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Create a new csa_reflist node from the given stack reference.
|
|
|
|
|
It is already known that the reference is either a MEM satisfying the
|
|
|
|
|
predicate stack_memref_p or a REG representing the stack pointer. */
|
|
|
|
|
|
|
|
|
|
static struct csa_reflist *
|
2015-08-28 15:33:40 +00:00
|
|
|
|
record_one_stack_ref (rtx_insn *insn, rtx *ref, struct csa_reflist *next_reflist)
|
2012-03-27 23:13:14 +00:00
|
|
|
|
{
|
|
|
|
|
struct csa_reflist *ml;
|
|
|
|
|
|
|
|
|
|
ml = XNEW (struct csa_reflist);
|
|
|
|
|
|
|
|
|
|
if (REG_P (*ref) || XEXP (*ref, 0) == stack_pointer_rtx)
|
|
|
|
|
ml->sp_offset = 0;
|
|
|
|
|
else
|
|
|
|
|
ml->sp_offset = INTVAL (XEXP (XEXP (*ref, 0), 1));
|
|
|
|
|
|
|
|
|
|
ml->insn = insn;
|
|
|
|
|
ml->ref = ref;
|
|
|
|
|
ml->next = next_reflist;
|
|
|
|
|
|
|
|
|
|
return ml;
|
|
|
|
|
}
|
|
|
|
|
|
2015-08-28 15:33:40 +00:00
|
|
|
|
/* We only know how to adjust the CFA; no other frame-related changes
|
|
|
|
|
may appear in any insn to be deleted. */
|
|
|
|
|
|
|
|
|
|
static bool
|
|
|
|
|
no_unhandled_cfa (rtx_insn *insn)
|
|
|
|
|
{
|
|
|
|
|
if (!RTX_FRAME_RELATED_P (insn))
|
|
|
|
|
return true;
|
|
|
|
|
|
|
|
|
|
/* No CFA notes at all is a legacy interpretation like
|
|
|
|
|
FRAME_RELATED_EXPR, and is context sensitive within
|
|
|
|
|
the prologue state machine. We can't handle that here. */
|
|
|
|
|
bool has_cfa_adjust = false;
|
|
|
|
|
|
|
|
|
|
for (rtx link = REG_NOTES (insn); link; link = XEXP (link, 1))
|
|
|
|
|
switch (REG_NOTE_KIND (link))
|
|
|
|
|
{
|
|
|
|
|
default:
|
|
|
|
|
break;
|
|
|
|
|
case REG_CFA_ADJUST_CFA:
|
|
|
|
|
has_cfa_adjust = true;
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
case REG_FRAME_RELATED_EXPR:
|
|
|
|
|
case REG_CFA_DEF_CFA:
|
|
|
|
|
case REG_CFA_OFFSET:
|
|
|
|
|
case REG_CFA_REGISTER:
|
|
|
|
|
case REG_CFA_EXPRESSION:
|
|
|
|
|
case REG_CFA_RESTORE:
|
|
|
|
|
case REG_CFA_SET_VDRAP:
|
|
|
|
|
case REG_CFA_WINDOW_SAVE:
|
|
|
|
|
case REG_CFA_FLUSH_QUEUE:
|
2017-10-07 00:16:47 +00:00
|
|
|
|
case REG_CFA_TOGGLE_RA_MANGLE:
|
2015-08-28 15:33:40 +00:00
|
|
|
|
return false;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
return has_cfa_adjust;
|
|
|
|
|
}
|
|
|
|
|
|
2012-03-27 23:13:14 +00:00
|
|
|
|
/* Attempt to apply ADJUST to the stack adjusting insn INSN, as well
|
|
|
|
|
as each of the memories and stack references in REFLIST. Return true
|
|
|
|
|
on success. */
|
|
|
|
|
|
2022-10-27 18:55:19 +00:00
|
|
|
|
static bool
|
2015-08-28 15:33:40 +00:00
|
|
|
|
try_apply_stack_adjustment (rtx_insn *insn, struct csa_reflist *reflist,
|
2022-10-27 18:55:19 +00:00
|
|
|
|
HOST_WIDE_INT new_adjust, HOST_WIDE_INT delta,
|
|
|
|
|
bitmap live, rtx_insn *other_insn)
|
2012-03-27 23:13:14 +00:00
|
|
|
|
{
|
|
|
|
|
struct csa_reflist *ml;
|
|
|
|
|
rtx set;
|
2022-10-27 18:55:19 +00:00
|
|
|
|
bool remove_equal = false;
|
2012-03-27 23:13:14 +00:00
|
|
|
|
|
|
|
|
|
set = single_set_for_csa (insn);
|
|
|
|
|
if (MEM_P (SET_DEST (set)))
|
|
|
|
|
validate_change (insn, &SET_DEST (set),
|
|
|
|
|
replace_equiv_address (SET_DEST (set), stack_pointer_rtx),
|
|
|
|
|
1);
|
2022-10-27 18:55:19 +00:00
|
|
|
|
else if (REG_P (SET_SRC (set)))
|
|
|
|
|
{
|
|
|
|
|
if (other_insn == NULL_RTX || live == NULL)
|
|
|
|
|
return false;
|
|
|
|
|
rtx other_set = single_set_for_csa (other_insn);
|
|
|
|
|
if (SET_DEST (other_set) != stack_pointer_rtx
|
|
|
|
|
|| GET_CODE (SET_SRC (other_set)) != PLUS
|
|
|
|
|
|| XEXP (SET_SRC (other_set), 0) != stack_pointer_rtx
|
|
|
|
|
|| !CONST_INT_P (XEXP (SET_SRC (other_set), 1)))
|
|
|
|
|
return false;
|
|
|
|
|
if (PATTERN (other_insn) != other_set)
|
|
|
|
|
{
|
|
|
|
|
if (GET_CODE (PATTERN (other_insn)) != PARALLEL)
|
|
|
|
|
return false;
|
|
|
|
|
int i;
|
|
|
|
|
rtx p = PATTERN (other_insn);
|
|
|
|
|
for (i = 0; i < XVECLEN (p, 0); ++i)
|
|
|
|
|
{
|
|
|
|
|
rtx this_rtx = XVECEXP (p, 0, i);
|
|
|
|
|
if (this_rtx == other_set)
|
|
|
|
|
continue;
|
|
|
|
|
if (GET_CODE (this_rtx) != CLOBBER)
|
|
|
|
|
return false;
|
|
|
|
|
if (!REG_P (XEXP (this_rtx, 0))
|
|
|
|
|
|| !HARD_REGISTER_P (XEXP (this_rtx, 0)))
|
|
|
|
|
return false;
|
|
|
|
|
unsigned int end_regno = END_REGNO (XEXP (this_rtx, 0));
|
|
|
|
|
for (unsigned int regno = REGNO (XEXP (this_rtx, 0));
|
|
|
|
|
regno < end_regno; ++regno)
|
|
|
|
|
if (bitmap_bit_p (live, regno))
|
|
|
|
|
return false;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
validate_change (insn, &PATTERN (insn), copy_rtx (PATTERN (other_insn)),
|
|
|
|
|
1);
|
|
|
|
|
set = single_set_for_csa (insn);
|
|
|
|
|
validate_change (insn, &XEXP (SET_SRC (set), 1), GEN_INT (new_adjust),
|
|
|
|
|
1);
|
|
|
|
|
remove_equal = true;
|
|
|
|
|
}
|
2012-03-27 23:13:14 +00:00
|
|
|
|
else
|
|
|
|
|
validate_change (insn, &XEXP (SET_SRC (set), 1), GEN_INT (new_adjust), 1);
|
|
|
|
|
|
|
|
|
|
for (ml = reflist; ml ; ml = ml->next)
|
|
|
|
|
{
|
2014-09-21 17:33:12 +00:00
|
|
|
|
rtx new_addr = plus_constant (Pmode, stack_pointer_rtx,
|
|
|
|
|
ml->sp_offset - delta);
|
2012-03-27 23:13:14 +00:00
|
|
|
|
rtx new_val;
|
|
|
|
|
|
|
|
|
|
if (MEM_P (*ml->ref))
|
|
|
|
|
new_val = replace_equiv_address_nv (*ml->ref, new_addr);
|
|
|
|
|
else if (GET_MODE (*ml->ref) == GET_MODE (stack_pointer_rtx))
|
|
|
|
|
new_val = new_addr;
|
|
|
|
|
else
|
|
|
|
|
new_val = lowpart_subreg (GET_MODE (*ml->ref), new_addr,
|
|
|
|
|
GET_MODE (new_addr));
|
|
|
|
|
validate_change (ml->insn, ml->ref, new_val, 1);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
if (apply_change_group ())
|
|
|
|
|
{
|
|
|
|
|
/* Succeeded. Update our knowledge of the stack references. */
|
|
|
|
|
for (ml = reflist; ml ; ml = ml->next)
|
|
|
|
|
ml->sp_offset -= delta;
|
|
|
|
|
|
2022-10-27 18:55:19 +00:00
|
|
|
|
if (remove_equal)
|
|
|
|
|
remove_reg_equal_equiv_notes (insn);
|
|
|
|
|
return true;
|
2012-03-27 23:13:14 +00:00
|
|
|
|
}
|
|
|
|
|
else
|
2022-10-27 18:55:19 +00:00
|
|
|
|
return false;
|
2012-03-27 23:13:14 +00:00
|
|
|
|
}
|
|
|
|
|
|
2015-08-28 15:33:40 +00:00
|
|
|
|
/* For non-debug insns, record all stack memory references in INSN
|
|
|
|
|
and return true if there were no other (unrecorded) references to the
|
|
|
|
|
stack pointer. For debug insns, record all stack references regardless
|
|
|
|
|
of context and unconditionally return true. */
|
2012-03-27 23:13:14 +00:00
|
|
|
|
|
2015-08-28 15:33:40 +00:00
|
|
|
|
static bool
|
|
|
|
|
record_stack_refs (rtx_insn *insn, struct csa_reflist **reflist)
|
2012-03-27 23:13:14 +00:00
|
|
|
|
{
|
2015-08-28 15:33:40 +00:00
|
|
|
|
subrtx_ptr_iterator::array_type array;
|
|
|
|
|
FOR_EACH_SUBRTX_PTR (iter, array, &PATTERN (insn), NONCONST)
|
2012-03-27 23:13:14 +00:00
|
|
|
|
{
|
2015-08-28 15:33:40 +00:00
|
|
|
|
rtx *loc = *iter;
|
|
|
|
|
rtx x = *loc;
|
|
|
|
|
switch (GET_CODE (x))
|
2012-03-27 23:13:14 +00:00
|
|
|
|
{
|
2015-08-28 15:33:40 +00:00
|
|
|
|
case MEM:
|
|
|
|
|
if (!reg_mentioned_p (stack_pointer_rtx, x))
|
|
|
|
|
iter.skip_subrtxes ();
|
|
|
|
|
/* We are not able to handle correctly all possible memrefs
|
|
|
|
|
containing stack pointer, so this check is necessary. */
|
|
|
|
|
else if (stack_memref_p (x))
|
|
|
|
|
{
|
|
|
|
|
*reflist = record_one_stack_ref (insn, loc, *reflist);
|
|
|
|
|
iter.skip_subrtxes ();
|
|
|
|
|
}
|
|
|
|
|
/* Try harder for DEBUG_INSNs, handle e.g.
|
|
|
|
|
(mem (mem (sp + 16) + 4). */
|
|
|
|
|
else if (!DEBUG_INSN_P (insn))
|
|
|
|
|
return false;
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
case REG:
|
|
|
|
|
/* ??? We want be able to handle non-memory stack pointer
|
|
|
|
|
references later. For now just discard all insns referring to
|
|
|
|
|
stack pointer outside mem expressions. We would probably
|
|
|
|
|
want to teach validate_replace to simplify expressions first.
|
|
|
|
|
|
|
|
|
|
We can't just compare with STACK_POINTER_RTX because the
|
|
|
|
|
reference to the stack pointer might be in some other mode.
|
|
|
|
|
In particular, an explicit clobber in an asm statement will
|
|
|
|
|
result in a QImode clobber.
|
|
|
|
|
|
|
|
|
|
In DEBUG_INSNs, we want to replace all occurrences, otherwise
|
|
|
|
|
they will cause -fcompare-debug failures. */
|
|
|
|
|
if (REGNO (x) == STACK_POINTER_REGNUM)
|
|
|
|
|
{
|
|
|
|
|
if (!DEBUG_INSN_P (insn))
|
|
|
|
|
return false;
|
|
|
|
|
*reflist = record_one_stack_ref (insn, loc, *reflist);
|
|
|
|
|
}
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
default:
|
|
|
|
|
break;
|
2012-03-27 23:13:14 +00:00
|
|
|
|
}
|
|
|
|
|
}
|
2015-08-28 15:33:40 +00:00
|
|
|
|
return true;
|
2012-03-27 23:13:14 +00:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* If INSN has a REG_ARGS_SIZE note, move it to LAST.
|
|
|
|
|
AFTER is true iff LAST follows INSN in the instruction stream. */
|
|
|
|
|
|
|
|
|
|
static void
|
2015-08-28 15:33:40 +00:00
|
|
|
|
maybe_move_args_size_note (rtx_insn *last, rtx_insn *insn, bool after)
|
2012-03-27 23:13:14 +00:00
|
|
|
|
{
|
|
|
|
|
rtx note, last_note;
|
|
|
|
|
|
|
|
|
|
note = find_reg_note (insn, REG_ARGS_SIZE, NULL_RTX);
|
|
|
|
|
if (note == NULL)
|
|
|
|
|
return;
|
|
|
|
|
|
|
|
|
|
last_note = find_reg_note (last, REG_ARGS_SIZE, NULL_RTX);
|
|
|
|
|
if (last_note)
|
|
|
|
|
{
|
|
|
|
|
/* The ARGS_SIZE notes are *not* cumulative. They represent an
|
|
|
|
|
absolute value, and the "most recent" note wins. */
|
|
|
|
|
if (!after)
|
|
|
|
|
XEXP (last_note, 0) = XEXP (note, 0);
|
|
|
|
|
}
|
|
|
|
|
else
|
|
|
|
|
add_reg_note (last, REG_ARGS_SIZE, XEXP (note, 0));
|
|
|
|
|
}
|
|
|
|
|
|
2015-08-28 15:33:40 +00:00
|
|
|
|
/* Merge any REG_CFA_ADJUST_CFA note from SRC into DST.
|
|
|
|
|
AFTER is true iff DST follows SRC in the instruction stream. */
|
|
|
|
|
|
|
|
|
|
static void
|
|
|
|
|
maybe_merge_cfa_adjust (rtx_insn *dst, rtx_insn *src, bool after)
|
|
|
|
|
{
|
|
|
|
|
rtx snote = NULL, dnote = NULL;
|
|
|
|
|
rtx sexp, dexp;
|
|
|
|
|
rtx exp1, exp2;
|
|
|
|
|
|
|
|
|
|
if (RTX_FRAME_RELATED_P (src))
|
|
|
|
|
snote = find_reg_note (src, REG_CFA_ADJUST_CFA, NULL_RTX);
|
|
|
|
|
if (snote == NULL)
|
|
|
|
|
return;
|
|
|
|
|
sexp = XEXP (snote, 0);
|
|
|
|
|
|
|
|
|
|
if (RTX_FRAME_RELATED_P (dst))
|
|
|
|
|
dnote = find_reg_note (dst, REG_CFA_ADJUST_CFA, NULL_RTX);
|
|
|
|
|
if (dnote == NULL)
|
|
|
|
|
{
|
|
|
|
|
add_reg_note (dst, REG_CFA_ADJUST_CFA, sexp);
|
|
|
|
|
return;
|
|
|
|
|
}
|
|
|
|
|
dexp = XEXP (dnote, 0);
|
|
|
|
|
|
|
|
|
|
gcc_assert (GET_CODE (sexp) == SET);
|
|
|
|
|
gcc_assert (GET_CODE (dexp) == SET);
|
|
|
|
|
|
|
|
|
|
if (after)
|
|
|
|
|
exp1 = dexp, exp2 = sexp;
|
|
|
|
|
else
|
|
|
|
|
exp1 = sexp, exp2 = dexp;
|
|
|
|
|
|
|
|
|
|
SET_SRC (exp1) = simplify_replace_rtx (SET_SRC (exp1), SET_DEST (exp2),
|
|
|
|
|
SET_SRC (exp2));
|
|
|
|
|
XEXP (dnote, 0) = exp1;
|
|
|
|
|
}
|
|
|
|
|
|
2014-09-21 17:33:12 +00:00
|
|
|
|
/* Return the next (or previous) active insn within BB. */
|
|
|
|
|
|
2015-08-28 15:33:40 +00:00
|
|
|
|
static rtx_insn *
|
|
|
|
|
prev_active_insn_bb (basic_block bb, rtx_insn *insn)
|
2014-09-21 17:33:12 +00:00
|
|
|
|
{
|
|
|
|
|
for (insn = PREV_INSN (insn);
|
|
|
|
|
insn != PREV_INSN (BB_HEAD (bb));
|
|
|
|
|
insn = PREV_INSN (insn))
|
|
|
|
|
if (active_insn_p (insn))
|
|
|
|
|
return insn;
|
2015-08-28 15:33:40 +00:00
|
|
|
|
return NULL;
|
2014-09-21 17:33:12 +00:00
|
|
|
|
}
|
|
|
|
|
|
2015-08-28 15:33:40 +00:00
|
|
|
|
static rtx_insn *
|
|
|
|
|
next_active_insn_bb (basic_block bb, rtx_insn *insn)
|
2014-09-21 17:33:12 +00:00
|
|
|
|
{
|
|
|
|
|
for (insn = NEXT_INSN (insn);
|
|
|
|
|
insn != NEXT_INSN (BB_END (bb));
|
|
|
|
|
insn = NEXT_INSN (insn))
|
|
|
|
|
if (active_insn_p (insn))
|
|
|
|
|
return insn;
|
2015-08-28 15:33:40 +00:00
|
|
|
|
return NULL;
|
2014-09-21 17:33:12 +00:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* If INSN has a REG_ARGS_SIZE note, if possible move it to PREV. Otherwise
|
|
|
|
|
search for a nearby candidate within BB where we can stick the note. */
|
|
|
|
|
|
|
|
|
|
static void
|
2015-08-28 15:33:40 +00:00
|
|
|
|
force_move_args_size_note (basic_block bb, rtx_insn *prev, rtx_insn *insn)
|
2014-09-21 17:33:12 +00:00
|
|
|
|
{
|
2015-08-28 15:33:40 +00:00
|
|
|
|
rtx note;
|
|
|
|
|
rtx_insn *test, *next_candidate, *prev_candidate;
|
2014-09-21 17:33:12 +00:00
|
|
|
|
|
|
|
|
|
/* If PREV exists, tail-call to the logic in the other function. */
|
|
|
|
|
if (prev)
|
|
|
|
|
{
|
|
|
|
|
maybe_move_args_size_note (prev, insn, false);
|
|
|
|
|
return;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* First, make sure there's anything that needs doing. */
|
|
|
|
|
note = find_reg_note (insn, REG_ARGS_SIZE, NULL_RTX);
|
|
|
|
|
if (note == NULL)
|
|
|
|
|
return;
|
|
|
|
|
|
|
|
|
|
/* We need to find a spot between the previous and next exception points
|
|
|
|
|
where we can place the note and "properly" deallocate the arguments. */
|
|
|
|
|
next_candidate = prev_candidate = NULL;
|
|
|
|
|
|
|
|
|
|
/* It is often the case that we have insns in the order:
|
|
|
|
|
call
|
|
|
|
|
add sp (previous deallocation)
|
|
|
|
|
sub sp (align for next arglist)
|
|
|
|
|
push arg
|
|
|
|
|
and the add/sub cancel. Therefore we begin by searching forward. */
|
|
|
|
|
|
|
|
|
|
test = insn;
|
|
|
|
|
while ((test = next_active_insn_bb (bb, test)) != NULL)
|
|
|
|
|
{
|
|
|
|
|
/* Found an existing note: nothing to do. */
|
|
|
|
|
if (find_reg_note (test, REG_ARGS_SIZE, NULL_RTX))
|
|
|
|
|
return;
|
|
|
|
|
/* Found something that affects unwinding. Stop searching. */
|
|
|
|
|
if (CALL_P (test) || !insn_nothrow_p (test))
|
|
|
|
|
break;
|
|
|
|
|
if (next_candidate == NULL)
|
|
|
|
|
next_candidate = test;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
test = insn;
|
|
|
|
|
while ((test = prev_active_insn_bb (bb, test)) != NULL)
|
|
|
|
|
{
|
|
|
|
|
rtx tnote;
|
|
|
|
|
/* Found a place that seems logical to adjust the stack. */
|
|
|
|
|
tnote = find_reg_note (test, REG_ARGS_SIZE, NULL_RTX);
|
|
|
|
|
if (tnote)
|
|
|
|
|
{
|
|
|
|
|
XEXP (tnote, 0) = XEXP (note, 0);
|
|
|
|
|
return;
|
|
|
|
|
}
|
|
|
|
|
if (prev_candidate == NULL)
|
|
|
|
|
prev_candidate = test;
|
|
|
|
|
/* Found something that affects unwinding. Stop searching. */
|
|
|
|
|
if (CALL_P (test) || !insn_nothrow_p (test))
|
|
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
if (prev_candidate)
|
|
|
|
|
test = prev_candidate;
|
|
|
|
|
else if (next_candidate)
|
|
|
|
|
test = next_candidate;
|
|
|
|
|
else
|
|
|
|
|
{
|
|
|
|
|
/* ??? We *must* have a place, lest we ICE on the lost adjustment.
|
|
|
|
|
Options are: dummy clobber insn, nop, or prevent the removal of
|
|
|
|
|
the sp += 0 insn. */
|
|
|
|
|
/* TODO: Find another way to indicate to the dwarf2 code that we
|
|
|
|
|
have not in fact lost an adjustment. */
|
|
|
|
|
test = emit_insn_before (gen_rtx_CLOBBER (VOIDmode, const0_rtx), insn);
|
|
|
|
|
}
|
|
|
|
|
add_reg_note (test, REG_ARGS_SIZE, XEXP (note, 0));
|
|
|
|
|
}
|
|
|
|
|
|
2012-03-27 23:13:14 +00:00
|
|
|
|
/* Subroutine of combine_stack_adjustments, called for each basic block. */
|
|
|
|
|
|
|
|
|
|
static void
|
2022-10-27 18:55:19 +00:00
|
|
|
|
combine_stack_adjustments_for_block (basic_block bb, bitmap live)
|
2012-03-27 23:13:14 +00:00
|
|
|
|
{
|
|
|
|
|
HOST_WIDE_INT last_sp_adjust = 0;
|
2015-08-28 15:33:40 +00:00
|
|
|
|
rtx_insn *last_sp_set = NULL;
|
|
|
|
|
rtx_insn *last2_sp_set = NULL;
|
2022-10-27 18:55:19 +00:00
|
|
|
|
bitmap last_sp_live = NULL;
|
2012-03-27 23:13:14 +00:00
|
|
|
|
struct csa_reflist *reflist = NULL;
|
2022-10-27 18:55:19 +00:00
|
|
|
|
bitmap copy = NULL;
|
2015-08-28 15:33:40 +00:00
|
|
|
|
rtx_insn *insn, *next;
|
|
|
|
|
rtx set;
|
2012-03-27 23:13:14 +00:00
|
|
|
|
bool end_of_block = false;
|
|
|
|
|
|
2022-10-27 18:55:19 +00:00
|
|
|
|
bitmap_copy (live, DF_LR_IN (bb));
|
|
|
|
|
df_simulate_initialize_forwards (bb, live);
|
|
|
|
|
|
2012-03-27 23:13:14 +00:00
|
|
|
|
for (insn = BB_HEAD (bb); !end_of_block ; insn = next)
|
|
|
|
|
{
|
|
|
|
|
end_of_block = insn == BB_END (bb);
|
|
|
|
|
next = NEXT_INSN (insn);
|
|
|
|
|
|
|
|
|
|
if (! INSN_P (insn))
|
|
|
|
|
continue;
|
|
|
|
|
|
|
|
|
|
set = single_set_for_csa (insn);
|
2018-12-28 15:30:48 +00:00
|
|
|
|
if (set && find_reg_note (insn, REG_STACK_CHECK, NULL_RTX))
|
|
|
|
|
set = NULL_RTX;
|
2012-03-27 23:13:14 +00:00
|
|
|
|
if (set)
|
|
|
|
|
{
|
|
|
|
|
rtx dest = SET_DEST (set);
|
|
|
|
|
rtx src = SET_SRC (set);
|
2022-10-27 18:55:19 +00:00
|
|
|
|
HOST_WIDE_INT this_adjust = 0;
|
2012-03-27 23:13:14 +00:00
|
|
|
|
|
|
|
|
|
/* Find constant additions to the stack pointer. */
|
|
|
|
|
if (dest == stack_pointer_rtx
|
|
|
|
|
&& GET_CODE (src) == PLUS
|
|
|
|
|
&& XEXP (src, 0) == stack_pointer_rtx
|
|
|
|
|
&& CONST_INT_P (XEXP (src, 1)))
|
2022-10-27 18:55:19 +00:00
|
|
|
|
this_adjust = INTVAL (XEXP (src, 1));
|
|
|
|
|
/* Or such additions turned by postreload into a store of
|
|
|
|
|
equivalent register. */
|
|
|
|
|
else if (dest == stack_pointer_rtx
|
|
|
|
|
&& REG_P (src)
|
|
|
|
|
&& REGNO (src) != STACK_POINTER_REGNUM)
|
|
|
|
|
if (rtx equal = find_reg_note (insn, REG_EQUAL, NULL_RTX))
|
|
|
|
|
if (GET_CODE (XEXP (equal, 0)) == PLUS
|
|
|
|
|
&& XEXP (XEXP (equal, 0), 0) == stack_pointer_rtx
|
|
|
|
|
&& CONST_INT_P (XEXP (XEXP (equal, 0), 1)))
|
|
|
|
|
this_adjust = INTVAL (XEXP (XEXP (equal, 0), 1));
|
|
|
|
|
|
|
|
|
|
if (this_adjust)
|
2012-03-27 23:13:14 +00:00
|
|
|
|
{
|
|
|
|
|
/* If we've not seen an adjustment previously, record
|
|
|
|
|
it now and continue. */
|
|
|
|
|
if (! last_sp_set)
|
|
|
|
|
{
|
|
|
|
|
last_sp_set = insn;
|
|
|
|
|
last_sp_adjust = this_adjust;
|
2022-10-27 18:55:19 +00:00
|
|
|
|
if (REG_P (src))
|
|
|
|
|
{
|
|
|
|
|
if (copy == NULL)
|
|
|
|
|
copy = BITMAP_ALLOC (®_obstack);
|
|
|
|
|
last_sp_live = copy;
|
|
|
|
|
bitmap_copy (last_sp_live, live);
|
|
|
|
|
}
|
|
|
|
|
else
|
|
|
|
|
last_sp_live = NULL;
|
|
|
|
|
df_simulate_one_insn_forwards (bb, insn, live);
|
2012-03-27 23:13:14 +00:00
|
|
|
|
continue;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* If not all recorded refs can be adjusted, or the
|
|
|
|
|
adjustment is now too large for a constant addition,
|
|
|
|
|
we cannot merge the two stack adjustments.
|
|
|
|
|
|
|
|
|
|
Also we need to be careful to not move stack pointer
|
|
|
|
|
such that we create stack accesses outside the allocated
|
|
|
|
|
area. We can combine an allocation into the first insn,
|
2019-06-02 15:48:37 +00:00
|
|
|
|
or a deallocation into the second insn. We cannot
|
2012-03-27 23:13:14 +00:00
|
|
|
|
combine an allocation followed by a deallocation.
|
|
|
|
|
|
|
|
|
|
The only somewhat frequent occurrence of the later is when
|
|
|
|
|
a function allocates a stack frame but does not use it.
|
|
|
|
|
For this case, we would need to analyze rtl stream to be
|
|
|
|
|
sure that allocated area is really unused. This means not
|
|
|
|
|
only checking the memory references, but also all registers
|
|
|
|
|
or global memory references possibly containing a stack
|
|
|
|
|
frame address.
|
|
|
|
|
|
|
|
|
|
Perhaps the best way to address this problem is to teach
|
|
|
|
|
gcc not to allocate stack for objects never used. */
|
|
|
|
|
|
|
|
|
|
/* Combine an allocation into the first instruction. */
|
|
|
|
|
if (STACK_GROWS_DOWNWARD ? this_adjust <= 0 : this_adjust >= 0)
|
|
|
|
|
{
|
2015-08-28 15:33:40 +00:00
|
|
|
|
if (no_unhandled_cfa (insn)
|
|
|
|
|
&& try_apply_stack_adjustment (last_sp_set, reflist,
|
|
|
|
|
last_sp_adjust
|
|
|
|
|
+ this_adjust,
|
2022-10-27 18:55:19 +00:00
|
|
|
|
this_adjust,
|
|
|
|
|
last_sp_live,
|
|
|
|
|
insn))
|
2012-03-27 23:13:14 +00:00
|
|
|
|
{
|
|
|
|
|
/* It worked! */
|
2014-09-21 17:33:12 +00:00
|
|
|
|
maybe_move_args_size_note (last_sp_set, insn, false);
|
2015-08-28 15:33:40 +00:00
|
|
|
|
maybe_merge_cfa_adjust (last_sp_set, insn, false);
|
2012-03-27 23:13:14 +00:00
|
|
|
|
delete_insn (insn);
|
|
|
|
|
last_sp_adjust += this_adjust;
|
2022-10-27 18:55:19 +00:00
|
|
|
|
last_sp_live = NULL;
|
2012-03-27 23:13:14 +00:00
|
|
|
|
continue;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Otherwise we have a deallocation. Do not combine with
|
|
|
|
|
a previous allocation. Combine into the second insn. */
|
|
|
|
|
else if (STACK_GROWS_DOWNWARD
|
|
|
|
|
? last_sp_adjust >= 0 : last_sp_adjust <= 0)
|
|
|
|
|
{
|
2015-08-28 15:33:40 +00:00
|
|
|
|
if (no_unhandled_cfa (last_sp_set)
|
2022-10-27 18:55:19 +00:00
|
|
|
|
&& !REG_P (src)
|
2015-08-28 15:33:40 +00:00
|
|
|
|
&& try_apply_stack_adjustment (insn, reflist,
|
|
|
|
|
last_sp_adjust
|
|
|
|
|
+ this_adjust,
|
2022-10-27 18:55:19 +00:00
|
|
|
|
-last_sp_adjust,
|
|
|
|
|
NULL, NULL))
|
2012-03-27 23:13:14 +00:00
|
|
|
|
{
|
|
|
|
|
/* It worked! */
|
2014-09-21 17:33:12 +00:00
|
|
|
|
maybe_move_args_size_note (insn, last_sp_set, true);
|
2015-08-28 15:33:40 +00:00
|
|
|
|
maybe_merge_cfa_adjust (insn, last_sp_set, true);
|
2012-03-27 23:13:14 +00:00
|
|
|
|
delete_insn (last_sp_set);
|
|
|
|
|
last_sp_set = insn;
|
|
|
|
|
last_sp_adjust += this_adjust;
|
2022-10-27 18:55:19 +00:00
|
|
|
|
last_sp_live = NULL;
|
2012-03-27 23:13:14 +00:00
|
|
|
|
free_csa_reflist (reflist);
|
|
|
|
|
reflist = NULL;
|
2022-10-27 18:55:19 +00:00
|
|
|
|
df_simulate_one_insn_forwards (bb, insn, live);
|
2012-03-27 23:13:14 +00:00
|
|
|
|
continue;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Combination failed. Restart processing from here. If
|
|
|
|
|
deallocation+allocation conspired to cancel, we can
|
|
|
|
|
delete the old deallocation insn. */
|
2014-09-21 17:33:12 +00:00
|
|
|
|
if (last_sp_set)
|
|
|
|
|
{
|
2015-08-28 15:33:40 +00:00
|
|
|
|
if (last_sp_adjust == 0 && no_unhandled_cfa (last_sp_set))
|
2014-09-21 17:33:12 +00:00
|
|
|
|
{
|
|
|
|
|
maybe_move_args_size_note (insn, last_sp_set, true);
|
2015-08-28 15:33:40 +00:00
|
|
|
|
maybe_merge_cfa_adjust (insn, last_sp_set, true);
|
2014-09-21 17:33:12 +00:00
|
|
|
|
delete_insn (last_sp_set);
|
|
|
|
|
}
|
|
|
|
|
else
|
|
|
|
|
last2_sp_set = last_sp_set;
|
|
|
|
|
}
|
2012-03-27 23:13:14 +00:00
|
|
|
|
free_csa_reflist (reflist);
|
|
|
|
|
reflist = NULL;
|
|
|
|
|
last_sp_set = insn;
|
|
|
|
|
last_sp_adjust = this_adjust;
|
2022-10-27 18:55:19 +00:00
|
|
|
|
if (REG_P (src))
|
|
|
|
|
{
|
|
|
|
|
if (copy == NULL)
|
|
|
|
|
copy = BITMAP_ALLOC (®_obstack);
|
|
|
|
|
last_sp_live = copy;
|
|
|
|
|
bitmap_copy (last_sp_live, live);
|
|
|
|
|
}
|
|
|
|
|
else
|
|
|
|
|
last_sp_live = NULL;
|
|
|
|
|
df_simulate_one_insn_forwards (bb, insn, live);
|
2012-03-27 23:13:14 +00:00
|
|
|
|
continue;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Find a store with pre-(dec|inc)rement or pre-modify of exactly
|
|
|
|
|
the previous adjustment and turn it into a simple store. This
|
|
|
|
|
is equivalent to anticipating the stack adjustment so this must
|
|
|
|
|
be an allocation. */
|
|
|
|
|
if (MEM_P (dest)
|
|
|
|
|
&& ((STACK_GROWS_DOWNWARD
|
|
|
|
|
? (GET_CODE (XEXP (dest, 0)) == PRE_DEC
|
2018-12-28 15:30:48 +00:00
|
|
|
|
&& known_eq (last_sp_adjust,
|
|
|
|
|
GET_MODE_SIZE (GET_MODE (dest))))
|
2012-03-27 23:13:14 +00:00
|
|
|
|
: (GET_CODE (XEXP (dest, 0)) == PRE_INC
|
2018-12-28 15:30:48 +00:00
|
|
|
|
&& known_eq (-last_sp_adjust,
|
|
|
|
|
GET_MODE_SIZE (GET_MODE (dest)))))
|
2012-03-27 23:13:14 +00:00
|
|
|
|
|| ((STACK_GROWS_DOWNWARD
|
|
|
|
|
? last_sp_adjust >= 0 : last_sp_adjust <= 0)
|
|
|
|
|
&& GET_CODE (XEXP (dest, 0)) == PRE_MODIFY
|
|
|
|
|
&& GET_CODE (XEXP (XEXP (dest, 0), 1)) == PLUS
|
|
|
|
|
&& XEXP (XEXP (XEXP (dest, 0), 1), 0)
|
|
|
|
|
== stack_pointer_rtx
|
|
|
|
|
&& GET_CODE (XEXP (XEXP (XEXP (dest, 0), 1), 1))
|
|
|
|
|
== CONST_INT
|
|
|
|
|
&& INTVAL (XEXP (XEXP (XEXP (dest, 0), 1), 1))
|
|
|
|
|
== -last_sp_adjust))
|
|
|
|
|
&& XEXP (XEXP (dest, 0), 0) == stack_pointer_rtx
|
|
|
|
|
&& !reg_mentioned_p (stack_pointer_rtx, src)
|
|
|
|
|
&& memory_address_p (GET_MODE (dest), stack_pointer_rtx)
|
|
|
|
|
&& try_apply_stack_adjustment (insn, reflist, 0,
|
2022-10-27 18:55:19 +00:00
|
|
|
|
-last_sp_adjust,
|
|
|
|
|
NULL, NULL))
|
2012-03-27 23:13:14 +00:00
|
|
|
|
{
|
2014-09-21 17:33:12 +00:00
|
|
|
|
if (last2_sp_set)
|
|
|
|
|
maybe_move_args_size_note (last2_sp_set, last_sp_set, false);
|
|
|
|
|
else
|
|
|
|
|
maybe_move_args_size_note (insn, last_sp_set, true);
|
2012-03-27 23:13:14 +00:00
|
|
|
|
delete_insn (last_sp_set);
|
|
|
|
|
free_csa_reflist (reflist);
|
|
|
|
|
reflist = NULL;
|
2015-08-28 15:33:40 +00:00
|
|
|
|
last_sp_set = NULL;
|
2012-03-27 23:13:14 +00:00
|
|
|
|
last_sp_adjust = 0;
|
2022-10-27 18:55:19 +00:00
|
|
|
|
last_sp_live = NULL;
|
|
|
|
|
df_simulate_one_insn_forwards (bb, insn, live);
|
2012-03-27 23:13:14 +00:00
|
|
|
|
continue;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
2022-10-27 18:55:19 +00:00
|
|
|
|
if (!CALL_P (insn) && last_sp_set && record_stack_refs (insn, &reflist))
|
|
|
|
|
{
|
|
|
|
|
df_simulate_one_insn_forwards (bb, insn, live);
|
|
|
|
|
continue;
|
|
|
|
|
}
|
2012-03-27 23:13:14 +00:00
|
|
|
|
|
|
|
|
|
/* Otherwise, we were not able to process the instruction.
|
|
|
|
|
Do not continue collecting data across such a one. */
|
|
|
|
|
if (last_sp_set
|
|
|
|
|
&& (CALL_P (insn)
|
|
|
|
|
|| reg_mentioned_p (stack_pointer_rtx, PATTERN (insn))))
|
|
|
|
|
{
|
|
|
|
|
if (last_sp_set && last_sp_adjust == 0)
|
2014-09-21 17:33:12 +00:00
|
|
|
|
{
|
|
|
|
|
force_move_args_size_note (bb, last2_sp_set, last_sp_set);
|
|
|
|
|
delete_insn (last_sp_set);
|
|
|
|
|
}
|
2012-03-27 23:13:14 +00:00
|
|
|
|
free_csa_reflist (reflist);
|
|
|
|
|
reflist = NULL;
|
2015-08-28 15:33:40 +00:00
|
|
|
|
last2_sp_set = NULL;
|
|
|
|
|
last_sp_set = NULL;
|
2012-03-27 23:13:14 +00:00
|
|
|
|
last_sp_adjust = 0;
|
2022-10-27 18:55:19 +00:00
|
|
|
|
last_sp_live = NULL;
|
2012-03-27 23:13:14 +00:00
|
|
|
|
}
|
2022-10-27 18:55:19 +00:00
|
|
|
|
|
|
|
|
|
df_simulate_one_insn_forwards (bb, insn, live);
|
2012-03-27 23:13:14 +00:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
if (last_sp_set && last_sp_adjust == 0)
|
2014-09-21 17:33:12 +00:00
|
|
|
|
{
|
|
|
|
|
force_move_args_size_note (bb, last2_sp_set, last_sp_set);
|
|
|
|
|
delete_insn (last_sp_set);
|
|
|
|
|
}
|
2012-03-27 23:13:14 +00:00
|
|
|
|
|
|
|
|
|
if (reflist)
|
|
|
|
|
free_csa_reflist (reflist);
|
2022-10-27 18:55:19 +00:00
|
|
|
|
if (copy)
|
|
|
|
|
BITMAP_FREE (copy);
|
2012-03-27 23:13:14 +00:00
|
|
|
|
}
|
|
|
|
|
|
2014-09-21 17:33:12 +00:00
|
|
|
|
static unsigned int
|
|
|
|
|
rest_of_handle_stack_adjustments (void)
|
|
|
|
|
{
|
|
|
|
|
df_note_add_problem ();
|
|
|
|
|
df_analyze ();
|
|
|
|
|
combine_stack_adjustments ();
|
2012-03-27 23:13:14 +00:00
|
|
|
|
return 0;
|
|
|
|
|
}
|
|
|
|
|
|
2014-09-21 17:33:12 +00:00
|
|
|
|
namespace {
|
|
|
|
|
|
|
|
|
|
const pass_data pass_data_stack_adjustments =
|
2012-03-27 23:13:14 +00:00
|
|
|
|
{
|
2014-09-21 17:33:12 +00:00
|
|
|
|
RTL_PASS, /* type */
|
|
|
|
|
"csa", /* name */
|
|
|
|
|
OPTGROUP_NONE, /* optinfo_flags */
|
|
|
|
|
TV_COMBINE_STACK_ADJUST, /* tv_id */
|
|
|
|
|
0, /* properties_required */
|
|
|
|
|
0, /* properties_provided */
|
|
|
|
|
0, /* properties_destroyed */
|
|
|
|
|
0, /* todo_flags_start */
|
2015-08-28 15:33:40 +00:00
|
|
|
|
TODO_df_finish, /* todo_flags_finish */
|
2012-03-27 23:13:14 +00:00
|
|
|
|
};
|
2014-09-21 17:33:12 +00:00
|
|
|
|
|
|
|
|
|
class pass_stack_adjustments : public rtl_opt_pass
|
|
|
|
|
{
|
|
|
|
|
public:
|
|
|
|
|
pass_stack_adjustments (gcc::context *ctxt)
|
|
|
|
|
: rtl_opt_pass (pass_data_stack_adjustments, ctxt)
|
|
|
|
|
{}
|
|
|
|
|
|
|
|
|
|
/* opt_pass methods: */
|
2015-08-28 15:33:40 +00:00
|
|
|
|
virtual bool gate (function *);
|
|
|
|
|
virtual unsigned int execute (function *)
|
|
|
|
|
{
|
|
|
|
|
return rest_of_handle_stack_adjustments ();
|
|
|
|
|
}
|
2019-01-03 19:59:51 +00:00
|
|
|
|
virtual opt_pass *clone ()
|
|
|
|
|
{
|
|
|
|
|
return new pass_stack_adjustments(m_ctxt);
|
|
|
|
|
}
|
2014-09-21 17:33:12 +00:00
|
|
|
|
}; // class pass_stack_adjustments
|
|
|
|
|
|
2015-08-28 15:33:40 +00:00
|
|
|
|
bool
|
|
|
|
|
pass_stack_adjustments::gate (function *)
|
|
|
|
|
{
|
|
|
|
|
/* This is kind of a heuristic. We need to run combine_stack_adjustments
|
|
|
|
|
even for machines with possibly nonzero TARGET_RETURN_POPS_ARGS
|
|
|
|
|
and ACCUMULATE_OUTGOING_ARGS. We expect that only ports having
|
|
|
|
|
push instructions will have popping returns. */
|
|
|
|
|
#ifndef PUSH_ROUNDING
|
|
|
|
|
if (ACCUMULATE_OUTGOING_ARGS)
|
|
|
|
|
return false;
|
|
|
|
|
#endif
|
|
|
|
|
return flag_combine_stack_adjustments;
|
|
|
|
|
}
|
|
|
|
|
|
2014-09-21 17:33:12 +00:00
|
|
|
|
} // anon namespace
|
|
|
|
|
|
|
|
|
|
rtl_opt_pass *
|
|
|
|
|
make_pass_stack_adjustments (gcc::context *ctxt)
|
|
|
|
|
{
|
|
|
|
|
return new pass_stack_adjustments (ctxt);
|
|
|
|
|
}
|