/* Subroutines for manipulating rtx's in semantically interesting ways.
|
/* Subroutines for manipulating rtx's in semantically interesting ways.
|
Copyright (C) 1987, 1991, 1994, 1995, 1996, 1997, 1998, 1999, 2000,
|
Copyright (C) 1987, 1991, 1994, 1995, 1996, 1997, 1998, 1999, 2000,
|
2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011
|
2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011
|
Free Software Foundation, Inc.
|
Free Software Foundation, Inc.
|
|
|
This file is part of GCC.
|
This file is part of GCC.
|
|
|
GCC is free software; you can redistribute it and/or modify it under
|
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
|
the terms of the GNU General Public License as published by the Free
|
Software Foundation; either version 3, or (at your option) any later
|
Software Foundation; either version 3, or (at your option) any later
|
version.
|
version.
|
|
|
GCC is distributed in the hope that it will be useful, but WITHOUT ANY
|
GCC is distributed in the hope that it will be useful, but WITHOUT ANY
|
WARRANTY; without even the implied warranty of MERCHANTABILITY or
|
WARRANTY; without even the implied warranty of MERCHANTABILITY or
|
FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
|
FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
|
for more details.
|
for more details.
|
|
|
You should have received a copy of the GNU General Public License
|
You should have received a copy of the GNU General Public License
|
along with GCC; see the file COPYING3. If not see
|
along with GCC; see the file COPYING3. If not see
|
<http://www.gnu.org/licenses/>. */
|
<http://www.gnu.org/licenses/>. */
|
|
|
|
|
#include "config.h"
|
#include "config.h"
|
#include "system.h"
|
#include "system.h"
|
#include "coretypes.h"
|
#include "coretypes.h"
|
#include "tm.h"
|
#include "tm.h"
|
#include "diagnostic-core.h"
|
#include "diagnostic-core.h"
|
#include "rtl.h"
|
#include "rtl.h"
|
#include "tree.h"
|
#include "tree.h"
|
#include "tm_p.h"
|
#include "tm_p.h"
|
#include "flags.h"
|
#include "flags.h"
|
#include "except.h"
|
#include "except.h"
|
#include "function.h"
|
#include "function.h"
|
#include "expr.h"
|
#include "expr.h"
|
#include "optabs.h"
|
#include "optabs.h"
|
#include "libfuncs.h"
|
#include "libfuncs.h"
|
#include "hard-reg-set.h"
|
#include "hard-reg-set.h"
|
#include "insn-config.h"
|
#include "insn-config.h"
|
#include "ggc.h"
|
#include "ggc.h"
|
#include "recog.h"
|
#include "recog.h"
|
#include "langhooks.h"
|
#include "langhooks.h"
|
#include "target.h"
|
#include "target.h"
|
#include "common/common-target.h"
|
#include "common/common-target.h"
|
#include "output.h"
|
#include "output.h"
|
|
|
static rtx break_out_memory_refs (rtx);
|
static rtx break_out_memory_refs (rtx);
|
|
|
|
|
/* Truncate and perhaps sign-extend C as appropriate for MODE. */
|
/* Truncate and perhaps sign-extend C as appropriate for MODE. */
|
|
|
HOST_WIDE_INT
|
HOST_WIDE_INT
|
trunc_int_for_mode (HOST_WIDE_INT c, enum machine_mode mode)
|
trunc_int_for_mode (HOST_WIDE_INT c, enum machine_mode mode)
|
{
|
{
|
int width = GET_MODE_PRECISION (mode);
|
int width = GET_MODE_PRECISION (mode);
|
|
|
/* You want to truncate to a _what_? */
|
/* You want to truncate to a _what_? */
|
gcc_assert (SCALAR_INT_MODE_P (mode));
|
gcc_assert (SCALAR_INT_MODE_P (mode));
|
|
|
/* Canonicalize BImode to 0 and STORE_FLAG_VALUE. */
|
/* Canonicalize BImode to 0 and STORE_FLAG_VALUE. */
|
if (mode == BImode)
|
if (mode == BImode)
|
return c & 1 ? STORE_FLAG_VALUE : 0;
|
return c & 1 ? STORE_FLAG_VALUE : 0;
|
|
|
/* Sign-extend for the requested mode. */
|
/* Sign-extend for the requested mode. */
|
|
|
if (width < HOST_BITS_PER_WIDE_INT)
|
if (width < HOST_BITS_PER_WIDE_INT)
|
{
|
{
|
HOST_WIDE_INT sign = 1;
|
HOST_WIDE_INT sign = 1;
|
sign <<= width - 1;
|
sign <<= width - 1;
|
c &= (sign << 1) - 1;
|
c &= (sign << 1) - 1;
|
c ^= sign;
|
c ^= sign;
|
c -= sign;
|
c -= sign;
|
}
|
}
|
|
|
return c;
|
return c;
|
}
|
}
|
|
|
/* Return an rtx for the sum of X and the integer C. */
|
/* Return an rtx for the sum of X and the integer C. */
|
|
|
rtx
|
rtx
|
plus_constant (rtx x, HOST_WIDE_INT c)
|
plus_constant (rtx x, HOST_WIDE_INT c)
|
{
|
{
|
RTX_CODE code;
|
RTX_CODE code;
|
rtx y;
|
rtx y;
|
enum machine_mode mode;
|
enum machine_mode mode;
|
rtx tem;
|
rtx tem;
|
int all_constant = 0;
|
int all_constant = 0;
|
|
|
if (c == 0)
|
if (c == 0)
|
return x;
|
return x;
|
|
|
restart:
|
restart:
|
|
|
code = GET_CODE (x);
|
code = GET_CODE (x);
|
mode = GET_MODE (x);
|
mode = GET_MODE (x);
|
y = x;
|
y = x;
|
|
|
switch (code)
|
switch (code)
|
{
|
{
|
case CONST_INT:
|
case CONST_INT:
|
return GEN_INT (INTVAL (x) + c);
|
return GEN_INT (INTVAL (x) + c);
|
|
|
case CONST_DOUBLE:
|
case CONST_DOUBLE:
|
{
|
{
|
unsigned HOST_WIDE_INT l1 = CONST_DOUBLE_LOW (x);
|
unsigned HOST_WIDE_INT l1 = CONST_DOUBLE_LOW (x);
|
HOST_WIDE_INT h1 = CONST_DOUBLE_HIGH (x);
|
HOST_WIDE_INT h1 = CONST_DOUBLE_HIGH (x);
|
unsigned HOST_WIDE_INT l2 = c;
|
unsigned HOST_WIDE_INT l2 = c;
|
HOST_WIDE_INT h2 = c < 0 ? ~0 : 0;
|
HOST_WIDE_INT h2 = c < 0 ? ~0 : 0;
|
unsigned HOST_WIDE_INT lv;
|
unsigned HOST_WIDE_INT lv;
|
HOST_WIDE_INT hv;
|
HOST_WIDE_INT hv;
|
|
|
add_double (l1, h1, l2, h2, &lv, &hv);
|
add_double (l1, h1, l2, h2, &lv, &hv);
|
|
|
return immed_double_const (lv, hv, VOIDmode);
|
return immed_double_const (lv, hv, VOIDmode);
|
}
|
}
|
|
|
case MEM:
|
case MEM:
|
/* If this is a reference to the constant pool, try replacing it with
|
/* If this is a reference to the constant pool, try replacing it with
|
a reference to a new constant. If the resulting address isn't
|
a reference to a new constant. If the resulting address isn't
|
valid, don't return it because we have no way to validize it. */
|
valid, don't return it because we have no way to validize it. */
|
if (GET_CODE (XEXP (x, 0)) == SYMBOL_REF
|
if (GET_CODE (XEXP (x, 0)) == SYMBOL_REF
|
&& CONSTANT_POOL_ADDRESS_P (XEXP (x, 0)))
|
&& CONSTANT_POOL_ADDRESS_P (XEXP (x, 0)))
|
{
|
{
|
tem
|
tem
|
= force_const_mem (GET_MODE (x),
|
= force_const_mem (GET_MODE (x),
|
plus_constant (get_pool_constant (XEXP (x, 0)),
|
plus_constant (get_pool_constant (XEXP (x, 0)),
|
c));
|
c));
|
if (memory_address_p (GET_MODE (tem), XEXP (tem, 0)))
|
if (memory_address_p (GET_MODE (tem), XEXP (tem, 0)))
|
return tem;
|
return tem;
|
}
|
}
|
break;
|
break;
|
|
|
case CONST:
|
case CONST:
|
/* If adding to something entirely constant, set a flag
|
/* If adding to something entirely constant, set a flag
|
so that we can add a CONST around the result. */
|
so that we can add a CONST around the result. */
|
x = XEXP (x, 0);
|
x = XEXP (x, 0);
|
all_constant = 1;
|
all_constant = 1;
|
goto restart;
|
goto restart;
|
|
|
case SYMBOL_REF:
|
case SYMBOL_REF:
|
case LABEL_REF:
|
case LABEL_REF:
|
all_constant = 1;
|
all_constant = 1;
|
break;
|
break;
|
|
|
case PLUS:
|
case PLUS:
|
/* The interesting case is adding the integer to a sum.
|
/* The interesting case is adding the integer to a sum.
|
Look for constant term in the sum and combine
|
Look for constant term in the sum and combine
|
with C. For an integer constant term, we make a combined
|
with C. For an integer constant term, we make a combined
|
integer. For a constant term that is not an explicit integer,
|
integer. For a constant term that is not an explicit integer,
|
we cannot really combine, but group them together anyway.
|
we cannot really combine, but group them together anyway.
|
|
|
Restart or use a recursive call in case the remaining operand is
|
Restart or use a recursive call in case the remaining operand is
|
something that we handle specially, such as a SYMBOL_REF.
|
something that we handle specially, such as a SYMBOL_REF.
|
|
|
We may not immediately return from the recursive call here, lest
|
We may not immediately return from the recursive call here, lest
|
all_constant gets lost. */
|
all_constant gets lost. */
|
|
|
if (CONST_INT_P (XEXP (x, 1)))
|
if (CONST_INT_P (XEXP (x, 1)))
|
{
|
{
|
c += INTVAL (XEXP (x, 1));
|
c += INTVAL (XEXP (x, 1));
|
|
|
if (GET_MODE (x) != VOIDmode)
|
if (GET_MODE (x) != VOIDmode)
|
c = trunc_int_for_mode (c, GET_MODE (x));
|
c = trunc_int_for_mode (c, GET_MODE (x));
|
|
|
x = XEXP (x, 0);
|
x = XEXP (x, 0);
|
goto restart;
|
goto restart;
|
}
|
}
|
else if (CONSTANT_P (XEXP (x, 1)))
|
else if (CONSTANT_P (XEXP (x, 1)))
|
{
|
{
|
x = gen_rtx_PLUS (mode, XEXP (x, 0), plus_constant (XEXP (x, 1), c));
|
x = gen_rtx_PLUS (mode, XEXP (x, 0), plus_constant (XEXP (x, 1), c));
|
c = 0;
|
c = 0;
|
}
|
}
|
else if (find_constant_term_loc (&y))
|
else if (find_constant_term_loc (&y))
|
{
|
{
|
/* We need to be careful since X may be shared and we can't
|
/* We need to be careful since X may be shared and we can't
|
modify it in place. */
|
modify it in place. */
|
rtx copy = copy_rtx (x);
|
rtx copy = copy_rtx (x);
|
rtx *const_loc = find_constant_term_loc (©);
|
rtx *const_loc = find_constant_term_loc (©);
|
|
|
*const_loc = plus_constant (*const_loc, c);
|
*const_loc = plus_constant (*const_loc, c);
|
x = copy;
|
x = copy;
|
c = 0;
|
c = 0;
|
}
|
}
|
break;
|
break;
|
|
|
default:
|
default:
|
break;
|
break;
|
}
|
}
|
|
|
if (c != 0)
|
if (c != 0)
|
x = gen_rtx_PLUS (mode, x, GEN_INT (c));
|
x = gen_rtx_PLUS (mode, x, GEN_INT (c));
|
|
|
if (GET_CODE (x) == SYMBOL_REF || GET_CODE (x) == LABEL_REF)
|
if (GET_CODE (x) == SYMBOL_REF || GET_CODE (x) == LABEL_REF)
|
return x;
|
return x;
|
else if (all_constant)
|
else if (all_constant)
|
return gen_rtx_CONST (mode, x);
|
return gen_rtx_CONST (mode, x);
|
else
|
else
|
return x;
|
return x;
|
}
|
}
|
|
|
/* If X is a sum, return a new sum like X but lacking any constant terms.
|
/* If X is a sum, return a new sum like X but lacking any constant terms.
|
Add all the removed constant terms into *CONSTPTR.
|
Add all the removed constant terms into *CONSTPTR.
|
X itself is not altered. The result != X if and only if
|
X itself is not altered. The result != X if and only if
|
it is not isomorphic to X. */
|
it is not isomorphic to X. */
|
|
|
rtx
|
rtx
|
eliminate_constant_term (rtx x, rtx *constptr)
|
eliminate_constant_term (rtx x, rtx *constptr)
|
{
|
{
|
rtx x0, x1;
|
rtx x0, x1;
|
rtx tem;
|
rtx tem;
|
|
|
if (GET_CODE (x) != PLUS)
|
if (GET_CODE (x) != PLUS)
|
return x;
|
return x;
|
|
|
/* First handle constants appearing at this level explicitly. */
|
/* First handle constants appearing at this level explicitly. */
|
if (CONST_INT_P (XEXP (x, 1))
|
if (CONST_INT_P (XEXP (x, 1))
|
&& 0 != (tem = simplify_binary_operation (PLUS, GET_MODE (x), *constptr,
|
&& 0 != (tem = simplify_binary_operation (PLUS, GET_MODE (x), *constptr,
|
XEXP (x, 1)))
|
XEXP (x, 1)))
|
&& CONST_INT_P (tem))
|
&& CONST_INT_P (tem))
|
{
|
{
|
*constptr = tem;
|
*constptr = tem;
|
return eliminate_constant_term (XEXP (x, 0), constptr);
|
return eliminate_constant_term (XEXP (x, 0), constptr);
|
}
|
}
|
|
|
tem = const0_rtx;
|
tem = const0_rtx;
|
x0 = eliminate_constant_term (XEXP (x, 0), &tem);
|
x0 = eliminate_constant_term (XEXP (x, 0), &tem);
|
x1 = eliminate_constant_term (XEXP (x, 1), &tem);
|
x1 = eliminate_constant_term (XEXP (x, 1), &tem);
|
if ((x1 != XEXP (x, 1) || x0 != XEXP (x, 0))
|
if ((x1 != XEXP (x, 1) || x0 != XEXP (x, 0))
|
&& 0 != (tem = simplify_binary_operation (PLUS, GET_MODE (x),
|
&& 0 != (tem = simplify_binary_operation (PLUS, GET_MODE (x),
|
*constptr, tem))
|
*constptr, tem))
|
&& CONST_INT_P (tem))
|
&& CONST_INT_P (tem))
|
{
|
{
|
*constptr = tem;
|
*constptr = tem;
|
return gen_rtx_PLUS (GET_MODE (x), x0, x1);
|
return gen_rtx_PLUS (GET_MODE (x), x0, x1);
|
}
|
}
|
|
|
return x;
|
return x;
|
}
|
}
|
|
|
/* Return an rtx for the size in bytes of the value of EXP. */
|
/* Return an rtx for the size in bytes of the value of EXP. */
|
|
|
rtx
|
rtx
|
expr_size (tree exp)
|
expr_size (tree exp)
|
{
|
{
|
tree size;
|
tree size;
|
|
|
if (TREE_CODE (exp) == WITH_SIZE_EXPR)
|
if (TREE_CODE (exp) == WITH_SIZE_EXPR)
|
size = TREE_OPERAND (exp, 1);
|
size = TREE_OPERAND (exp, 1);
|
else
|
else
|
{
|
{
|
size = tree_expr_size (exp);
|
size = tree_expr_size (exp);
|
gcc_assert (size);
|
gcc_assert (size);
|
gcc_assert (size == SUBSTITUTE_PLACEHOLDER_IN_EXPR (size, exp));
|
gcc_assert (size == SUBSTITUTE_PLACEHOLDER_IN_EXPR (size, exp));
|
}
|
}
|
|
|
return expand_expr (size, NULL_RTX, TYPE_MODE (sizetype), EXPAND_NORMAL);
|
return expand_expr (size, NULL_RTX, TYPE_MODE (sizetype), EXPAND_NORMAL);
|
}
|
}
|
|
|
/* Return a wide integer for the size in bytes of the value of EXP, or -1
|
/* Return a wide integer for the size in bytes of the value of EXP, or -1
|
if the size can vary or is larger than an integer. */
|
if the size can vary or is larger than an integer. */
|
|
|
HOST_WIDE_INT
|
HOST_WIDE_INT
|
int_expr_size (tree exp)
|
int_expr_size (tree exp)
|
{
|
{
|
tree size;
|
tree size;
|
|
|
if (TREE_CODE (exp) == WITH_SIZE_EXPR)
|
if (TREE_CODE (exp) == WITH_SIZE_EXPR)
|
size = TREE_OPERAND (exp, 1);
|
size = TREE_OPERAND (exp, 1);
|
else
|
else
|
{
|
{
|
size = tree_expr_size (exp);
|
size = tree_expr_size (exp);
|
gcc_assert (size);
|
gcc_assert (size);
|
}
|
}
|
|
|
if (size == 0 || !host_integerp (size, 0))
|
if (size == 0 || !host_integerp (size, 0))
|
return -1;
|
return -1;
|
|
|
return tree_low_cst (size, 0);
|
return tree_low_cst (size, 0);
|
}
|
}
|
|
|
/* Return a copy of X in which all memory references
|
/* Return a copy of X in which all memory references
|
and all constants that involve symbol refs
|
and all constants that involve symbol refs
|
have been replaced with new temporary registers.
|
have been replaced with new temporary registers.
|
Also emit code to load the memory locations and constants
|
Also emit code to load the memory locations and constants
|
into those registers.
|
into those registers.
|
|
|
If X contains no such constants or memory references,
|
If X contains no such constants or memory references,
|
X itself (not a copy) is returned.
|
X itself (not a copy) is returned.
|
|
|
If a constant is found in the address that is not a legitimate constant
|
If a constant is found in the address that is not a legitimate constant
|
in an insn, it is left alone in the hope that it might be valid in the
|
in an insn, it is left alone in the hope that it might be valid in the
|
address.
|
address.
|
|
|
X may contain no arithmetic except addition, subtraction and multiplication.
|
X may contain no arithmetic except addition, subtraction and multiplication.
|
Values returned by expand_expr with 1 for sum_ok fit this constraint. */
|
Values returned by expand_expr with 1 for sum_ok fit this constraint. */
|
|
|
static rtx
|
static rtx
|
break_out_memory_refs (rtx x)
|
break_out_memory_refs (rtx x)
|
{
|
{
|
if (MEM_P (x)
|
if (MEM_P (x)
|
|| (CONSTANT_P (x) && CONSTANT_ADDRESS_P (x)
|
|| (CONSTANT_P (x) && CONSTANT_ADDRESS_P (x)
|
&& GET_MODE (x) != VOIDmode))
|
&& GET_MODE (x) != VOIDmode))
|
x = force_reg (GET_MODE (x), x);
|
x = force_reg (GET_MODE (x), x);
|
else if (GET_CODE (x) == PLUS || GET_CODE (x) == MINUS
|
else if (GET_CODE (x) == PLUS || GET_CODE (x) == MINUS
|
|| GET_CODE (x) == MULT)
|
|| GET_CODE (x) == MULT)
|
{
|
{
|
rtx op0 = break_out_memory_refs (XEXP (x, 0));
|
rtx op0 = break_out_memory_refs (XEXP (x, 0));
|
rtx op1 = break_out_memory_refs (XEXP (x, 1));
|
rtx op1 = break_out_memory_refs (XEXP (x, 1));
|
|
|
if (op0 != XEXP (x, 0) || op1 != XEXP (x, 1))
|
if (op0 != XEXP (x, 0) || op1 != XEXP (x, 1))
|
x = simplify_gen_binary (GET_CODE (x), GET_MODE (x), op0, op1);
|
x = simplify_gen_binary (GET_CODE (x), GET_MODE (x), op0, op1);
|
}
|
}
|
|
|
return x;
|
return x;
|
}
|
}
|
|
|
/* Given X, a memory address in address space AS' pointer mode, convert it to
|
/* Given X, a memory address in address space AS' pointer mode, convert it to
|
an address in the address space's address mode, or vice versa (TO_MODE says
|
an address in the address space's address mode, or vice versa (TO_MODE says
|
which way). We take advantage of the fact that pointers are not allowed to
|
which way). We take advantage of the fact that pointers are not allowed to
|
overflow by commuting arithmetic operations over conversions so that address
|
overflow by commuting arithmetic operations over conversions so that address
|
arithmetic insns can be used. */
|
arithmetic insns can be used. */
|
|
|
rtx
|
rtx
|
convert_memory_address_addr_space (enum machine_mode to_mode ATTRIBUTE_UNUSED,
|
convert_memory_address_addr_space (enum machine_mode to_mode ATTRIBUTE_UNUSED,
|
rtx x, addr_space_t as ATTRIBUTE_UNUSED)
|
rtx x, addr_space_t as ATTRIBUTE_UNUSED)
|
{
|
{
|
#ifndef POINTERS_EXTEND_UNSIGNED
|
#ifndef POINTERS_EXTEND_UNSIGNED
|
gcc_assert (GET_MODE (x) == to_mode || GET_MODE (x) == VOIDmode);
|
gcc_assert (GET_MODE (x) == to_mode || GET_MODE (x) == VOIDmode);
|
return x;
|
return x;
|
#else /* defined(POINTERS_EXTEND_UNSIGNED) */
|
#else /* defined(POINTERS_EXTEND_UNSIGNED) */
|
enum machine_mode pointer_mode, address_mode, from_mode;
|
enum machine_mode pointer_mode, address_mode, from_mode;
|
rtx temp;
|
rtx temp;
|
enum rtx_code code;
|
enum rtx_code code;
|
|
|
/* If X already has the right mode, just return it. */
|
/* If X already has the right mode, just return it. */
|
if (GET_MODE (x) == to_mode)
|
if (GET_MODE (x) == to_mode)
|
return x;
|
return x;
|
|
|
pointer_mode = targetm.addr_space.pointer_mode (as);
|
pointer_mode = targetm.addr_space.pointer_mode (as);
|
address_mode = targetm.addr_space.address_mode (as);
|
address_mode = targetm.addr_space.address_mode (as);
|
from_mode = to_mode == pointer_mode ? address_mode : pointer_mode;
|
from_mode = to_mode == pointer_mode ? address_mode : pointer_mode;
|
|
|
/* Here we handle some special cases. If none of them apply, fall through
|
/* Here we handle some special cases. If none of them apply, fall through
|
to the default case. */
|
to the default case. */
|
switch (GET_CODE (x))
|
switch (GET_CODE (x))
|
{
|
{
|
case CONST_INT:
|
case CONST_INT:
|
case CONST_DOUBLE:
|
case CONST_DOUBLE:
|
if (GET_MODE_SIZE (to_mode) < GET_MODE_SIZE (from_mode))
|
if (GET_MODE_SIZE (to_mode) < GET_MODE_SIZE (from_mode))
|
code = TRUNCATE;
|
code = TRUNCATE;
|
else if (POINTERS_EXTEND_UNSIGNED < 0)
|
else if (POINTERS_EXTEND_UNSIGNED < 0)
|
break;
|
break;
|
else if (POINTERS_EXTEND_UNSIGNED > 0)
|
else if (POINTERS_EXTEND_UNSIGNED > 0)
|
code = ZERO_EXTEND;
|
code = ZERO_EXTEND;
|
else
|
else
|
code = SIGN_EXTEND;
|
code = SIGN_EXTEND;
|
temp = simplify_unary_operation (code, to_mode, x, from_mode);
|
temp = simplify_unary_operation (code, to_mode, x, from_mode);
|
if (temp)
|
if (temp)
|
return temp;
|
return temp;
|
break;
|
break;
|
|
|
case SUBREG:
|
case SUBREG:
|
if ((SUBREG_PROMOTED_VAR_P (x) || REG_POINTER (SUBREG_REG (x)))
|
if ((SUBREG_PROMOTED_VAR_P (x) || REG_POINTER (SUBREG_REG (x)))
|
&& GET_MODE (SUBREG_REG (x)) == to_mode)
|
&& GET_MODE (SUBREG_REG (x)) == to_mode)
|
return SUBREG_REG (x);
|
return SUBREG_REG (x);
|
break;
|
break;
|
|
|
case LABEL_REF:
|
case LABEL_REF:
|
temp = gen_rtx_LABEL_REF (to_mode, XEXP (x, 0));
|
temp = gen_rtx_LABEL_REF (to_mode, XEXP (x, 0));
|
LABEL_REF_NONLOCAL_P (temp) = LABEL_REF_NONLOCAL_P (x);
|
LABEL_REF_NONLOCAL_P (temp) = LABEL_REF_NONLOCAL_P (x);
|
return temp;
|
return temp;
|
break;
|
break;
|
|
|
case SYMBOL_REF:
|
case SYMBOL_REF:
|
temp = shallow_copy_rtx (x);
|
temp = shallow_copy_rtx (x);
|
PUT_MODE (temp, to_mode);
|
PUT_MODE (temp, to_mode);
|
return temp;
|
return temp;
|
break;
|
break;
|
|
|
case CONST:
|
case CONST:
|
return gen_rtx_CONST (to_mode,
|
return gen_rtx_CONST (to_mode,
|
convert_memory_address_addr_space
|
convert_memory_address_addr_space
|
(to_mode, XEXP (x, 0), as));
|
(to_mode, XEXP (x, 0), as));
|
break;
|
break;
|
|
|
case PLUS:
|
case PLUS:
|
case MULT:
|
case MULT:
|
/* FIXME: For addition, we used to permute the conversion and
|
/* FIXME: For addition, we used to permute the conversion and
|
addition operation only if one operand is a constant and
|
addition operation only if one operand is a constant and
|
converting the constant does not change it or if one operand
|
converting the constant does not change it or if one operand
|
is a constant and we are using a ptr_extend instruction
|
is a constant and we are using a ptr_extend instruction
|
(POINTERS_EXTEND_UNSIGNED < 0) even if the resulting address
|
(POINTERS_EXTEND_UNSIGNED < 0) even if the resulting address
|
may overflow/underflow. We relax the condition to include
|
may overflow/underflow. We relax the condition to include
|
zero-extend (POINTERS_EXTEND_UNSIGNED > 0) since the other
|
zero-extend (POINTERS_EXTEND_UNSIGNED > 0) since the other
|
parts of the compiler depend on it. See PR 49721.
|
parts of the compiler depend on it. See PR 49721.
|
|
|
We can always safely permute them if we are making the address
|
We can always safely permute them if we are making the address
|
narrower. */
|
narrower. */
|
if (GET_MODE_SIZE (to_mode) < GET_MODE_SIZE (from_mode)
|
if (GET_MODE_SIZE (to_mode) < GET_MODE_SIZE (from_mode)
|
|| (GET_CODE (x) == PLUS
|
|| (GET_CODE (x) == PLUS
|
&& CONST_INT_P (XEXP (x, 1))
|
&& CONST_INT_P (XEXP (x, 1))
|
&& (POINTERS_EXTEND_UNSIGNED != 0
|
&& (POINTERS_EXTEND_UNSIGNED != 0
|
|| XEXP (x, 1) == convert_memory_address_addr_space
|
|| XEXP (x, 1) == convert_memory_address_addr_space
|
(to_mode, XEXP (x, 1), as))))
|
(to_mode, XEXP (x, 1), as))))
|
return gen_rtx_fmt_ee (GET_CODE (x), to_mode,
|
return gen_rtx_fmt_ee (GET_CODE (x), to_mode,
|
convert_memory_address_addr_space
|
convert_memory_address_addr_space
|
(to_mode, XEXP (x, 0), as),
|
(to_mode, XEXP (x, 0), as),
|
XEXP (x, 1));
|
XEXP (x, 1));
|
break;
|
break;
|
|
|
default:
|
default:
|
break;
|
break;
|
}
|
}
|
|
|
return convert_modes (to_mode, from_mode,
|
return convert_modes (to_mode, from_mode,
|
x, POINTERS_EXTEND_UNSIGNED);
|
x, POINTERS_EXTEND_UNSIGNED);
|
#endif /* defined(POINTERS_EXTEND_UNSIGNED) */
|
#endif /* defined(POINTERS_EXTEND_UNSIGNED) */
|
}
|
}
|
|
|
/* Return something equivalent to X but valid as a memory address for something
|
/* Return something equivalent to X but valid as a memory address for something
|
of mode MODE in the named address space AS. When X is not itself valid,
|
of mode MODE in the named address space AS. When X is not itself valid,
|
this works by copying X or subexpressions of it into registers. */
|
this works by copying X or subexpressions of it into registers. */
|
|
|
rtx
|
rtx
|
memory_address_addr_space (enum machine_mode mode, rtx x, addr_space_t as)
|
memory_address_addr_space (enum machine_mode mode, rtx x, addr_space_t as)
|
{
|
{
|
rtx oldx = x;
|
rtx oldx = x;
|
enum machine_mode address_mode = targetm.addr_space.address_mode (as);
|
enum machine_mode address_mode = targetm.addr_space.address_mode (as);
|
|
|
x = convert_memory_address_addr_space (address_mode, x, as);
|
x = convert_memory_address_addr_space (address_mode, x, as);
|
|
|
/* By passing constant addresses through registers
|
/* By passing constant addresses through registers
|
we get a chance to cse them. */
|
we get a chance to cse them. */
|
if (! cse_not_expected && CONSTANT_P (x) && CONSTANT_ADDRESS_P (x))
|
if (! cse_not_expected && CONSTANT_P (x) && CONSTANT_ADDRESS_P (x))
|
x = force_reg (address_mode, x);
|
x = force_reg (address_mode, x);
|
|
|
/* We get better cse by rejecting indirect addressing at this stage.
|
/* We get better cse by rejecting indirect addressing at this stage.
|
Let the combiner create indirect addresses where appropriate.
|
Let the combiner create indirect addresses where appropriate.
|
For now, generate the code so that the subexpressions useful to share
|
For now, generate the code so that the subexpressions useful to share
|
are visible. But not if cse won't be done! */
|
are visible. But not if cse won't be done! */
|
else
|
else
|
{
|
{
|
if (! cse_not_expected && !REG_P (x))
|
if (! cse_not_expected && !REG_P (x))
|
x = break_out_memory_refs (x);
|
x = break_out_memory_refs (x);
|
|
|
/* At this point, any valid address is accepted. */
|
/* At this point, any valid address is accepted. */
|
if (memory_address_addr_space_p (mode, x, as))
|
if (memory_address_addr_space_p (mode, x, as))
|
goto done;
|
goto done;
|
|
|
/* If it was valid before but breaking out memory refs invalidated it,
|
/* If it was valid before but breaking out memory refs invalidated it,
|
use it the old way. */
|
use it the old way. */
|
if (memory_address_addr_space_p (mode, oldx, as))
|
if (memory_address_addr_space_p (mode, oldx, as))
|
{
|
{
|
x = oldx;
|
x = oldx;
|
goto done;
|
goto done;
|
}
|
}
|
|
|
/* Perform machine-dependent transformations on X
|
/* Perform machine-dependent transformations on X
|
in certain cases. This is not necessary since the code
|
in certain cases. This is not necessary since the code
|
below can handle all possible cases, but machine-dependent
|
below can handle all possible cases, but machine-dependent
|
transformations can make better code. */
|
transformations can make better code. */
|
{
|
{
|
rtx orig_x = x;
|
rtx orig_x = x;
|
x = targetm.addr_space.legitimize_address (x, oldx, mode, as);
|
x = targetm.addr_space.legitimize_address (x, oldx, mode, as);
|
if (orig_x != x && memory_address_addr_space_p (mode, x, as))
|
if (orig_x != x && memory_address_addr_space_p (mode, x, as))
|
goto done;
|
goto done;
|
}
|
}
|
|
|
/* PLUS and MULT can appear in special ways
|
/* PLUS and MULT can appear in special ways
|
as the result of attempts to make an address usable for indexing.
|
as the result of attempts to make an address usable for indexing.
|
Usually they are dealt with by calling force_operand, below.
|
Usually they are dealt with by calling force_operand, below.
|
But a sum containing constant terms is special
|
But a sum containing constant terms is special
|
if removing them makes the sum a valid address:
|
if removing them makes the sum a valid address:
|
then we generate that address in a register
|
then we generate that address in a register
|
and index off of it. We do this because it often makes
|
and index off of it. We do this because it often makes
|
shorter code, and because the addresses thus generated
|
shorter code, and because the addresses thus generated
|
in registers often become common subexpressions. */
|
in registers often become common subexpressions. */
|
if (GET_CODE (x) == PLUS)
|
if (GET_CODE (x) == PLUS)
|
{
|
{
|
rtx constant_term = const0_rtx;
|
rtx constant_term = const0_rtx;
|
rtx y = eliminate_constant_term (x, &constant_term);
|
rtx y = eliminate_constant_term (x, &constant_term);
|
if (constant_term == const0_rtx
|
if (constant_term == const0_rtx
|
|| ! memory_address_addr_space_p (mode, y, as))
|
|| ! memory_address_addr_space_p (mode, y, as))
|
x = force_operand (x, NULL_RTX);
|
x = force_operand (x, NULL_RTX);
|
else
|
else
|
{
|
{
|
y = gen_rtx_PLUS (GET_MODE (x), copy_to_reg (y), constant_term);
|
y = gen_rtx_PLUS (GET_MODE (x), copy_to_reg (y), constant_term);
|
if (! memory_address_addr_space_p (mode, y, as))
|
if (! memory_address_addr_space_p (mode, y, as))
|
x = force_operand (x, NULL_RTX);
|
x = force_operand (x, NULL_RTX);
|
else
|
else
|
x = y;
|
x = y;
|
}
|
}
|
}
|
}
|
|
|
else if (GET_CODE (x) == MULT || GET_CODE (x) == MINUS)
|
else if (GET_CODE (x) == MULT || GET_CODE (x) == MINUS)
|
x = force_operand (x, NULL_RTX);
|
x = force_operand (x, NULL_RTX);
|
|
|
/* If we have a register that's an invalid address,
|
/* If we have a register that's an invalid address,
|
it must be a hard reg of the wrong class. Copy it to a pseudo. */
|
it must be a hard reg of the wrong class. Copy it to a pseudo. */
|
else if (REG_P (x))
|
else if (REG_P (x))
|
x = copy_to_reg (x);
|
x = copy_to_reg (x);
|
|
|
/* Last resort: copy the value to a register, since
|
/* Last resort: copy the value to a register, since
|
the register is a valid address. */
|
the register is a valid address. */
|
else
|
else
|
x = force_reg (address_mode, x);
|
x = force_reg (address_mode, x);
|
}
|
}
|
|
|
done:
|
done:
|
|
|
gcc_assert (memory_address_addr_space_p (mode, x, as));
|
gcc_assert (memory_address_addr_space_p (mode, x, as));
|
/* If we didn't change the address, we are done. Otherwise, mark
|
/* If we didn't change the address, we are done. Otherwise, mark
|
a reg as a pointer if we have REG or REG + CONST_INT. */
|
a reg as a pointer if we have REG or REG + CONST_INT. */
|
if (oldx == x)
|
if (oldx == x)
|
return x;
|
return x;
|
else if (REG_P (x))
|
else if (REG_P (x))
|
mark_reg_pointer (x, BITS_PER_UNIT);
|
mark_reg_pointer (x, BITS_PER_UNIT);
|
else if (GET_CODE (x) == PLUS
|
else if (GET_CODE (x) == PLUS
|
&& REG_P (XEXP (x, 0))
|
&& REG_P (XEXP (x, 0))
|
&& CONST_INT_P (XEXP (x, 1)))
|
&& CONST_INT_P (XEXP (x, 1)))
|
mark_reg_pointer (XEXP (x, 0), BITS_PER_UNIT);
|
mark_reg_pointer (XEXP (x, 0), BITS_PER_UNIT);
|
|
|
/* OLDX may have been the address on a temporary. Update the address
|
/* OLDX may have been the address on a temporary. Update the address
|
to indicate that X is now used. */
|
to indicate that X is now used. */
|
update_temp_slot_address (oldx, x);
|
update_temp_slot_address (oldx, x);
|
|
|
return x;
|
return x;
|
}
|
}
|
|
|
/* Convert a mem ref into one with a valid memory address.
|
/* Convert a mem ref into one with a valid memory address.
|
Pass through anything else unchanged. */
|
Pass through anything else unchanged. */
|
|
|
rtx
|
rtx
|
validize_mem (rtx ref)
|
validize_mem (rtx ref)
|
{
|
{
|
if (!MEM_P (ref))
|
if (!MEM_P (ref))
|
return ref;
|
return ref;
|
ref = use_anchored_address (ref);
|
ref = use_anchored_address (ref);
|
if (memory_address_addr_space_p (GET_MODE (ref), XEXP (ref, 0),
|
if (memory_address_addr_space_p (GET_MODE (ref), XEXP (ref, 0),
|
MEM_ADDR_SPACE (ref)))
|
MEM_ADDR_SPACE (ref)))
|
return ref;
|
return ref;
|
|
|
/* Don't alter REF itself, since that is probably a stack slot. */
|
/* Don't alter REF itself, since that is probably a stack slot. */
|
return replace_equiv_address (ref, XEXP (ref, 0));
|
return replace_equiv_address (ref, XEXP (ref, 0));
|
}
|
}
|
|
|
/* If X is a memory reference to a member of an object block, try rewriting
|
/* If X is a memory reference to a member of an object block, try rewriting
|
it to use an anchor instead. Return the new memory reference on success
|
it to use an anchor instead. Return the new memory reference on success
|
and the old one on failure. */
|
and the old one on failure. */
|
|
|
rtx
|
rtx
|
use_anchored_address (rtx x)
|
use_anchored_address (rtx x)
|
{
|
{
|
rtx base;
|
rtx base;
|
HOST_WIDE_INT offset;
|
HOST_WIDE_INT offset;
|
|
|
if (!flag_section_anchors)
|
if (!flag_section_anchors)
|
return x;
|
return x;
|
|
|
if (!MEM_P (x))
|
if (!MEM_P (x))
|
return x;
|
return x;
|
|
|
/* Split the address into a base and offset. */
|
/* Split the address into a base and offset. */
|
base = XEXP (x, 0);
|
base = XEXP (x, 0);
|
offset = 0;
|
offset = 0;
|
if (GET_CODE (base) == CONST
|
if (GET_CODE (base) == CONST
|
&& GET_CODE (XEXP (base, 0)) == PLUS
|
&& GET_CODE (XEXP (base, 0)) == PLUS
|
&& CONST_INT_P (XEXP (XEXP (base, 0), 1)))
|
&& CONST_INT_P (XEXP (XEXP (base, 0), 1)))
|
{
|
{
|
offset += INTVAL (XEXP (XEXP (base, 0), 1));
|
offset += INTVAL (XEXP (XEXP (base, 0), 1));
|
base = XEXP (XEXP (base, 0), 0);
|
base = XEXP (XEXP (base, 0), 0);
|
}
|
}
|
|
|
/* Check whether BASE is suitable for anchors. */
|
/* Check whether BASE is suitable for anchors. */
|
if (GET_CODE (base) != SYMBOL_REF
|
if (GET_CODE (base) != SYMBOL_REF
|
|| !SYMBOL_REF_HAS_BLOCK_INFO_P (base)
|
|| !SYMBOL_REF_HAS_BLOCK_INFO_P (base)
|
|| SYMBOL_REF_ANCHOR_P (base)
|
|| SYMBOL_REF_ANCHOR_P (base)
|
|| SYMBOL_REF_BLOCK (base) == NULL
|
|| SYMBOL_REF_BLOCK (base) == NULL
|
|| !targetm.use_anchors_for_symbol_p (base))
|
|| !targetm.use_anchors_for_symbol_p (base))
|
return x;
|
return x;
|
|
|
/* Decide where BASE is going to be. */
|
/* Decide where BASE is going to be. */
|
place_block_symbol (base);
|
place_block_symbol (base);
|
|
|
/* Get the anchor we need to use. */
|
/* Get the anchor we need to use. */
|
offset += SYMBOL_REF_BLOCK_OFFSET (base);
|
offset += SYMBOL_REF_BLOCK_OFFSET (base);
|
base = get_section_anchor (SYMBOL_REF_BLOCK (base), offset,
|
base = get_section_anchor (SYMBOL_REF_BLOCK (base), offset,
|
SYMBOL_REF_TLS_MODEL (base));
|
SYMBOL_REF_TLS_MODEL (base));
|
|
|
/* Work out the offset from the anchor. */
|
/* Work out the offset from the anchor. */
|
offset -= SYMBOL_REF_BLOCK_OFFSET (base);
|
offset -= SYMBOL_REF_BLOCK_OFFSET (base);
|
|
|
/* If we're going to run a CSE pass, force the anchor into a register.
|
/* If we're going to run a CSE pass, force the anchor into a register.
|
We will then be able to reuse registers for several accesses, if the
|
We will then be able to reuse registers for several accesses, if the
|
target costs say that that's worthwhile. */
|
target costs say that that's worthwhile. */
|
if (!cse_not_expected)
|
if (!cse_not_expected)
|
base = force_reg (GET_MODE (base), base);
|
base = force_reg (GET_MODE (base), base);
|
|
|
return replace_equiv_address (x, plus_constant (base, offset));
|
return replace_equiv_address (x, plus_constant (base, offset));
|
}
|
}
|
|
|
/* Copy the value or contents of X to a new temp reg and return that reg. */
|
/* Copy the value or contents of X to a new temp reg and return that reg. */
|
|
|
rtx
|
rtx
|
copy_to_reg (rtx x)
|
copy_to_reg (rtx x)
|
{
|
{
|
rtx temp = gen_reg_rtx (GET_MODE (x));
|
rtx temp = gen_reg_rtx (GET_MODE (x));
|
|
|
/* If not an operand, must be an address with PLUS and MULT so
|
/* If not an operand, must be an address with PLUS and MULT so
|
do the computation. */
|
do the computation. */
|
if (! general_operand (x, VOIDmode))
|
if (! general_operand (x, VOIDmode))
|
x = force_operand (x, temp);
|
x = force_operand (x, temp);
|
|
|
if (x != temp)
|
if (x != temp)
|
emit_move_insn (temp, x);
|
emit_move_insn (temp, x);
|
|
|
return temp;
|
return temp;
|
}
|
}
|
|
|
/* Like copy_to_reg but always give the new register mode Pmode
|
/* Like copy_to_reg but always give the new register mode Pmode
|
in case X is a constant. */
|
in case X is a constant. */
|
|
|
rtx
|
rtx
|
copy_addr_to_reg (rtx x)
|
copy_addr_to_reg (rtx x)
|
{
|
{
|
return copy_to_mode_reg (Pmode, x);
|
return copy_to_mode_reg (Pmode, x);
|
}
|
}
|
|
|
/* Like copy_to_reg but always give the new register mode MODE
|
/* Like copy_to_reg but always give the new register mode MODE
|
in case X is a constant. */
|
in case X is a constant. */
|
|
|
rtx
|
rtx
|
copy_to_mode_reg (enum machine_mode mode, rtx x)
|
copy_to_mode_reg (enum machine_mode mode, rtx x)
|
{
|
{
|
rtx temp = gen_reg_rtx (mode);
|
rtx temp = gen_reg_rtx (mode);
|
|
|
/* If not an operand, must be an address with PLUS and MULT so
|
/* If not an operand, must be an address with PLUS and MULT so
|
do the computation. */
|
do the computation. */
|
if (! general_operand (x, VOIDmode))
|
if (! general_operand (x, VOIDmode))
|
x = force_operand (x, temp);
|
x = force_operand (x, temp);
|
|
|
gcc_assert (GET_MODE (x) == mode || GET_MODE (x) == VOIDmode);
|
gcc_assert (GET_MODE (x) == mode || GET_MODE (x) == VOIDmode);
|
if (x != temp)
|
if (x != temp)
|
emit_move_insn (temp, x);
|
emit_move_insn (temp, x);
|
return temp;
|
return temp;
|
}
|
}
|
|
|
/* Load X into a register if it is not already one.
|
/* Load X into a register if it is not already one.
|
Use mode MODE for the register.
|
Use mode MODE for the register.
|
X should be valid for mode MODE, but it may be a constant which
|
X should be valid for mode MODE, but it may be a constant which
|
is valid for all integer modes; that's why caller must specify MODE.
|
is valid for all integer modes; that's why caller must specify MODE.
|
|
|
The caller must not alter the value in the register we return,
|
The caller must not alter the value in the register we return,
|
since we mark it as a "constant" register. */
|
since we mark it as a "constant" register. */
|
|
|
rtx
|
rtx
|
force_reg (enum machine_mode mode, rtx x)
|
force_reg (enum machine_mode mode, rtx x)
|
{
|
{
|
rtx temp, insn, set;
|
rtx temp, insn, set;
|
|
|
if (REG_P (x))
|
if (REG_P (x))
|
return x;
|
return x;
|
|
|
if (general_operand (x, mode))
|
if (general_operand (x, mode))
|
{
|
{
|
temp = gen_reg_rtx (mode);
|
temp = gen_reg_rtx (mode);
|
insn = emit_move_insn (temp, x);
|
insn = emit_move_insn (temp, x);
|
}
|
}
|
else
|
else
|
{
|
{
|
temp = force_operand (x, NULL_RTX);
|
temp = force_operand (x, NULL_RTX);
|
if (REG_P (temp))
|
if (REG_P (temp))
|
insn = get_last_insn ();
|
insn = get_last_insn ();
|
else
|
else
|
{
|
{
|
rtx temp2 = gen_reg_rtx (mode);
|
rtx temp2 = gen_reg_rtx (mode);
|
insn = emit_move_insn (temp2, temp);
|
insn = emit_move_insn (temp2, temp);
|
temp = temp2;
|
temp = temp2;
|
}
|
}
|
}
|
}
|
|
|
/* Let optimizers know that TEMP's value never changes
|
/* Let optimizers know that TEMP's value never changes
|
and that X can be substituted for it. Don't get confused
|
and that X can be substituted for it. Don't get confused
|
if INSN set something else (such as a SUBREG of TEMP). */
|
if INSN set something else (such as a SUBREG of TEMP). */
|
if (CONSTANT_P (x)
|
if (CONSTANT_P (x)
|
&& (set = single_set (insn)) != 0
|
&& (set = single_set (insn)) != 0
|
&& SET_DEST (set) == temp
|
&& SET_DEST (set) == temp
|
&& ! rtx_equal_p (x, SET_SRC (set)))
|
&& ! rtx_equal_p (x, SET_SRC (set)))
|
set_unique_reg_note (insn, REG_EQUAL, x);
|
set_unique_reg_note (insn, REG_EQUAL, x);
|
|
|
/* Let optimizers know that TEMP is a pointer, and if so, the
|
/* Let optimizers know that TEMP is a pointer, and if so, the
|
known alignment of that pointer. */
|
known alignment of that pointer. */
|
{
|
{
|
unsigned align = 0;
|
unsigned align = 0;
|
if (GET_CODE (x) == SYMBOL_REF)
|
if (GET_CODE (x) == SYMBOL_REF)
|
{
|
{
|
align = BITS_PER_UNIT;
|
align = BITS_PER_UNIT;
|
if (SYMBOL_REF_DECL (x) && DECL_P (SYMBOL_REF_DECL (x)))
|
if (SYMBOL_REF_DECL (x) && DECL_P (SYMBOL_REF_DECL (x)))
|
align = DECL_ALIGN (SYMBOL_REF_DECL (x));
|
align = DECL_ALIGN (SYMBOL_REF_DECL (x));
|
}
|
}
|
else if (GET_CODE (x) == LABEL_REF)
|
else if (GET_CODE (x) == LABEL_REF)
|
align = BITS_PER_UNIT;
|
align = BITS_PER_UNIT;
|
else if (GET_CODE (x) == CONST
|
else if (GET_CODE (x) == CONST
|
&& GET_CODE (XEXP (x, 0)) == PLUS
|
&& GET_CODE (XEXP (x, 0)) == PLUS
|
&& GET_CODE (XEXP (XEXP (x, 0), 0)) == SYMBOL_REF
|
&& GET_CODE (XEXP (XEXP (x, 0), 0)) == SYMBOL_REF
|
&& CONST_INT_P (XEXP (XEXP (x, 0), 1)))
|
&& CONST_INT_P (XEXP (XEXP (x, 0), 1)))
|
{
|
{
|
rtx s = XEXP (XEXP (x, 0), 0);
|
rtx s = XEXP (XEXP (x, 0), 0);
|
rtx c = XEXP (XEXP (x, 0), 1);
|
rtx c = XEXP (XEXP (x, 0), 1);
|
unsigned sa, ca;
|
unsigned sa, ca;
|
|
|
sa = BITS_PER_UNIT;
|
sa = BITS_PER_UNIT;
|
if (SYMBOL_REF_DECL (s) && DECL_P (SYMBOL_REF_DECL (s)))
|
if (SYMBOL_REF_DECL (s) && DECL_P (SYMBOL_REF_DECL (s)))
|
sa = DECL_ALIGN (SYMBOL_REF_DECL (s));
|
sa = DECL_ALIGN (SYMBOL_REF_DECL (s));
|
|
|
if (INTVAL (c) == 0)
|
if (INTVAL (c) == 0)
|
align = sa;
|
align = sa;
|
else
|
else
|
{
|
{
|
ca = ctz_hwi (INTVAL (c)) * BITS_PER_UNIT;
|
ca = ctz_hwi (INTVAL (c)) * BITS_PER_UNIT;
|
align = MIN (sa, ca);
|
align = MIN (sa, ca);
|
}
|
}
|
}
|
}
|
|
|
if (align || (MEM_P (x) && MEM_POINTER (x)))
|
if (align || (MEM_P (x) && MEM_POINTER (x)))
|
mark_reg_pointer (temp, align);
|
mark_reg_pointer (temp, align);
|
}
|
}
|
|
|
return temp;
|
return temp;
|
}
|
}
|
|
|
/* If X is a memory ref, copy its contents to a new temp reg and return
|
/* If X is a memory ref, copy its contents to a new temp reg and return
|
that reg. Otherwise, return X. */
|
that reg. Otherwise, return X. */
|
|
|
rtx
|
rtx
|
force_not_mem (rtx x)
|
force_not_mem (rtx x)
|
{
|
{
|
rtx temp;
|
rtx temp;
|
|
|
if (!MEM_P (x) || GET_MODE (x) == BLKmode)
|
if (!MEM_P (x) || GET_MODE (x) == BLKmode)
|
return x;
|
return x;
|
|
|
temp = gen_reg_rtx (GET_MODE (x));
|
temp = gen_reg_rtx (GET_MODE (x));
|
|
|
if (MEM_POINTER (x))
|
if (MEM_POINTER (x))
|
REG_POINTER (temp) = 1;
|
REG_POINTER (temp) = 1;
|
|
|
emit_move_insn (temp, x);
|
emit_move_insn (temp, x);
|
return temp;
|
return temp;
|
}
|
}
|
|
|
/* Copy X to TARGET (if it's nonzero and a reg)
|
/* Copy X to TARGET (if it's nonzero and a reg)
|
or to a new temp reg and return that reg.
|
or to a new temp reg and return that reg.
|
MODE is the mode to use for X in case it is a constant. */
|
MODE is the mode to use for X in case it is a constant. */
|
|
|
rtx
|
rtx
|
copy_to_suggested_reg (rtx x, rtx target, enum machine_mode mode)
|
copy_to_suggested_reg (rtx x, rtx target, enum machine_mode mode)
|
{
|
{
|
rtx temp;
|
rtx temp;
|
|
|
if (target && REG_P (target))
|
if (target && REG_P (target))
|
temp = target;
|
temp = target;
|
else
|
else
|
temp = gen_reg_rtx (mode);
|
temp = gen_reg_rtx (mode);
|
|
|
emit_move_insn (temp, x);
|
emit_move_insn (temp, x);
|
return temp;
|
return temp;
|
}
|
}
|
|
|
/* Return the mode to use to pass or return a scalar of TYPE and MODE.
|
/* Return the mode to use to pass or return a scalar of TYPE and MODE.
|
PUNSIGNEDP points to the signedness of the type and may be adjusted
|
PUNSIGNEDP points to the signedness of the type and may be adjusted
|
to show what signedness to use on extension operations.
|
to show what signedness to use on extension operations.
|
|
|
FOR_RETURN is nonzero if the caller is promoting the return value
|
FOR_RETURN is nonzero if the caller is promoting the return value
|
of FNDECL, else it is for promoting args. */
|
of FNDECL, else it is for promoting args. */
|
|
|
enum machine_mode
|
enum machine_mode
|
promote_function_mode (const_tree type, enum machine_mode mode, int *punsignedp,
|
promote_function_mode (const_tree type, enum machine_mode mode, int *punsignedp,
|
const_tree funtype, int for_return)
|
const_tree funtype, int for_return)
|
{
|
{
|
/* Called without a type node for a libcall. */
|
/* Called without a type node for a libcall. */
|
if (type == NULL_TREE)
|
if (type == NULL_TREE)
|
{
|
{
|
if (INTEGRAL_MODE_P (mode))
|
if (INTEGRAL_MODE_P (mode))
|
return targetm.calls.promote_function_mode (NULL_TREE, mode,
|
return targetm.calls.promote_function_mode (NULL_TREE, mode,
|
punsignedp, funtype,
|
punsignedp, funtype,
|
for_return);
|
for_return);
|
else
|
else
|
return mode;
|
return mode;
|
}
|
}
|
|
|
switch (TREE_CODE (type))
|
switch (TREE_CODE (type))
|
{
|
{
|
case INTEGER_TYPE: case ENUMERAL_TYPE: case BOOLEAN_TYPE:
|
case INTEGER_TYPE: case ENUMERAL_TYPE: case BOOLEAN_TYPE:
|
case REAL_TYPE: case OFFSET_TYPE: case FIXED_POINT_TYPE:
|
case REAL_TYPE: case OFFSET_TYPE: case FIXED_POINT_TYPE:
|
case POINTER_TYPE: case REFERENCE_TYPE:
|
case POINTER_TYPE: case REFERENCE_TYPE:
|
return targetm.calls.promote_function_mode (type, mode, punsignedp, funtype,
|
return targetm.calls.promote_function_mode (type, mode, punsignedp, funtype,
|
for_return);
|
for_return);
|
|
|
default:
|
default:
|
return mode;
|
return mode;
|
}
|
}
|
}
|
}
|
/* Return the mode to use to store a scalar of TYPE and MODE.
|
/* Return the mode to use to store a scalar of TYPE and MODE.
|
PUNSIGNEDP points to the signedness of the type and may be adjusted
|
PUNSIGNEDP points to the signedness of the type and may be adjusted
|
to show what signedness to use on extension operations. */
|
to show what signedness to use on extension operations. */
|
|
|
enum machine_mode
|
enum machine_mode
|
promote_mode (const_tree type ATTRIBUTE_UNUSED, enum machine_mode mode,
|
promote_mode (const_tree type ATTRIBUTE_UNUSED, enum machine_mode mode,
|
int *punsignedp ATTRIBUTE_UNUSED)
|
int *punsignedp ATTRIBUTE_UNUSED)
|
{
|
{
|
#ifdef PROMOTE_MODE
|
#ifdef PROMOTE_MODE
|
enum tree_code code;
|
enum tree_code code;
|
int unsignedp;
|
int unsignedp;
|
#endif
|
#endif
|
|
|
/* For libcalls this is invoked without TYPE from the backends
|
/* For libcalls this is invoked without TYPE from the backends
|
TARGET_PROMOTE_FUNCTION_MODE hooks. Don't do anything in that
|
TARGET_PROMOTE_FUNCTION_MODE hooks. Don't do anything in that
|
case. */
|
case. */
|
if (type == NULL_TREE)
|
if (type == NULL_TREE)
|
return mode;
|
return mode;
|
|
|
/* FIXME: this is the same logic that was there until GCC 4.4, but we
|
/* FIXME: this is the same logic that was there until GCC 4.4, but we
|
probably want to test POINTERS_EXTEND_UNSIGNED even if PROMOTE_MODE
|
probably want to test POINTERS_EXTEND_UNSIGNED even if PROMOTE_MODE
|
is not defined. The affected targets are M32C, S390, SPARC. */
|
is not defined. The affected targets are M32C, S390, SPARC. */
|
#ifdef PROMOTE_MODE
|
#ifdef PROMOTE_MODE
|
code = TREE_CODE (type);
|
code = TREE_CODE (type);
|
unsignedp = *punsignedp;
|
unsignedp = *punsignedp;
|
|
|
switch (code)
|
switch (code)
|
{
|
{
|
case INTEGER_TYPE: case ENUMERAL_TYPE: case BOOLEAN_TYPE:
|
case INTEGER_TYPE: case ENUMERAL_TYPE: case BOOLEAN_TYPE:
|
case REAL_TYPE: case OFFSET_TYPE: case FIXED_POINT_TYPE:
|
case REAL_TYPE: case OFFSET_TYPE: case FIXED_POINT_TYPE:
|
PROMOTE_MODE (mode, unsignedp, type);
|
PROMOTE_MODE (mode, unsignedp, type);
|
*punsignedp = unsignedp;
|
*punsignedp = unsignedp;
|
return mode;
|
return mode;
|
break;
|
break;
|
|
|
#ifdef POINTERS_EXTEND_UNSIGNED
|
#ifdef POINTERS_EXTEND_UNSIGNED
|
case REFERENCE_TYPE:
|
case REFERENCE_TYPE:
|
case POINTER_TYPE:
|
case POINTER_TYPE:
|
*punsignedp = POINTERS_EXTEND_UNSIGNED;
|
*punsignedp = POINTERS_EXTEND_UNSIGNED;
|
return targetm.addr_space.address_mode
|
return targetm.addr_space.address_mode
|
(TYPE_ADDR_SPACE (TREE_TYPE (type)));
|
(TYPE_ADDR_SPACE (TREE_TYPE (type)));
|
break;
|
break;
|
#endif
|
#endif
|
|
|
default:
|
default:
|
return mode;
|
return mode;
|
}
|
}
|
#else
|
#else
|
return mode;
|
return mode;
|
#endif
|
#endif
|
}
|
}
|
|
|
|
|
/* Use one of promote_mode or promote_function_mode to find the promoted
|
/* Use one of promote_mode or promote_function_mode to find the promoted
|
mode of DECL. If PUNSIGNEDP is not NULL, store there the unsignedness
|
mode of DECL. If PUNSIGNEDP is not NULL, store there the unsignedness
|
of DECL after promotion. */
|
of DECL after promotion. */
|
|
|
enum machine_mode
|
enum machine_mode
|
promote_decl_mode (const_tree decl, int *punsignedp)
|
promote_decl_mode (const_tree decl, int *punsignedp)
|
{
|
{
|
tree type = TREE_TYPE (decl);
|
tree type = TREE_TYPE (decl);
|
int unsignedp = TYPE_UNSIGNED (type);
|
int unsignedp = TYPE_UNSIGNED (type);
|
enum machine_mode mode = DECL_MODE (decl);
|
enum machine_mode mode = DECL_MODE (decl);
|
enum machine_mode pmode;
|
enum machine_mode pmode;
|
|
|
if (TREE_CODE (decl) == RESULT_DECL
|
if (TREE_CODE (decl) == RESULT_DECL
|
|| TREE_CODE (decl) == PARM_DECL)
|
|| TREE_CODE (decl) == PARM_DECL)
|
pmode = promote_function_mode (type, mode, &unsignedp,
|
pmode = promote_function_mode (type, mode, &unsignedp,
|
TREE_TYPE (current_function_decl), 2);
|
TREE_TYPE (current_function_decl), 2);
|
else
|
else
|
pmode = promote_mode (type, mode, &unsignedp);
|
pmode = promote_mode (type, mode, &unsignedp);
|
|
|
if (punsignedp)
|
if (punsignedp)
|
*punsignedp = unsignedp;
|
*punsignedp = unsignedp;
|
return pmode;
|
return pmode;
|
}
|
}
|
|
|
|
|
/* Controls the behaviour of {anti_,}adjust_stack. */
|
/* Controls the behaviour of {anti_,}adjust_stack. */
|
static bool suppress_reg_args_size;
|
static bool suppress_reg_args_size;
|
|
|
/* A helper for adjust_stack and anti_adjust_stack. */
|
/* A helper for adjust_stack and anti_adjust_stack. */
|
|
|
static void
|
static void
|
adjust_stack_1 (rtx adjust, bool anti_p)
|
adjust_stack_1 (rtx adjust, bool anti_p)
|
{
|
{
|
rtx temp, insn;
|
rtx temp, insn;
|
|
|
#ifndef STACK_GROWS_DOWNWARD
|
#ifndef STACK_GROWS_DOWNWARD
|
/* Hereafter anti_p means subtract_p. */
|
/* Hereafter anti_p means subtract_p. */
|
anti_p = !anti_p;
|
anti_p = !anti_p;
|
#endif
|
#endif
|
|
|
temp = expand_binop (Pmode,
|
temp = expand_binop (Pmode,
|
anti_p ? sub_optab : add_optab,
|
anti_p ? sub_optab : add_optab,
|
stack_pointer_rtx, adjust, stack_pointer_rtx, 0,
|
stack_pointer_rtx, adjust, stack_pointer_rtx, 0,
|
OPTAB_LIB_WIDEN);
|
OPTAB_LIB_WIDEN);
|
|
|
if (temp != stack_pointer_rtx)
|
if (temp != stack_pointer_rtx)
|
insn = emit_move_insn (stack_pointer_rtx, temp);
|
insn = emit_move_insn (stack_pointer_rtx, temp);
|
else
|
else
|
{
|
{
|
insn = get_last_insn ();
|
insn = get_last_insn ();
|
temp = single_set (insn);
|
temp = single_set (insn);
|
gcc_assert (temp != NULL && SET_DEST (temp) == stack_pointer_rtx);
|
gcc_assert (temp != NULL && SET_DEST (temp) == stack_pointer_rtx);
|
}
|
}
|
|
|
if (!suppress_reg_args_size)
|
if (!suppress_reg_args_size)
|
add_reg_note (insn, REG_ARGS_SIZE, GEN_INT (stack_pointer_delta));
|
add_reg_note (insn, REG_ARGS_SIZE, GEN_INT (stack_pointer_delta));
|
}
|
}
|
|
|
/* Adjust the stack pointer by ADJUST (an rtx for a number of bytes).
|
/* Adjust the stack pointer by ADJUST (an rtx for a number of bytes).
|
This pops when ADJUST is positive. ADJUST need not be constant. */
|
This pops when ADJUST is positive. ADJUST need not be constant. */
|
|
|
void
|
void
|
adjust_stack (rtx adjust)
|
adjust_stack (rtx adjust)
|
{
|
{
|
if (adjust == const0_rtx)
|
if (adjust == const0_rtx)
|
return;
|
return;
|
|
|
/* We expect all variable sized adjustments to be multiple of
|
/* We expect all variable sized adjustments to be multiple of
|
PREFERRED_STACK_BOUNDARY. */
|
PREFERRED_STACK_BOUNDARY. */
|
if (CONST_INT_P (adjust))
|
if (CONST_INT_P (adjust))
|
stack_pointer_delta -= INTVAL (adjust);
|
stack_pointer_delta -= INTVAL (adjust);
|
|
|
adjust_stack_1 (adjust, false);
|
adjust_stack_1 (adjust, false);
|
}
|
}
|
|
|
/* Adjust the stack pointer by minus ADJUST (an rtx for a number of bytes).
|
/* Adjust the stack pointer by minus ADJUST (an rtx for a number of bytes).
|
This pushes when ADJUST is positive. ADJUST need not be constant. */
|
This pushes when ADJUST is positive. ADJUST need not be constant. */
|
|
|
void
|
void
|
anti_adjust_stack (rtx adjust)
|
anti_adjust_stack (rtx adjust)
|
{
|
{
|
if (adjust == const0_rtx)
|
if (adjust == const0_rtx)
|
return;
|
return;
|
|
|
/* We expect all variable sized adjustments to be multiple of
|
/* We expect all variable sized adjustments to be multiple of
|
PREFERRED_STACK_BOUNDARY. */
|
PREFERRED_STACK_BOUNDARY. */
|
if (CONST_INT_P (adjust))
|
if (CONST_INT_P (adjust))
|
stack_pointer_delta += INTVAL (adjust);
|
stack_pointer_delta += INTVAL (adjust);
|
|
|
adjust_stack_1 (adjust, true);
|
adjust_stack_1 (adjust, true);
|
}
|
}
|
|
|
/* Round the size of a block to be pushed up to the boundary required
|
/* Round the size of a block to be pushed up to the boundary required
|
by this machine. SIZE is the desired size, which need not be constant. */
|
by this machine. SIZE is the desired size, which need not be constant. */
|
|
|
static rtx
|
static rtx
|
round_push (rtx size)
|
round_push (rtx size)
|
{
|
{
|
rtx align_rtx, alignm1_rtx;
|
rtx align_rtx, alignm1_rtx;
|
|
|
if (!SUPPORTS_STACK_ALIGNMENT
|
if (!SUPPORTS_STACK_ALIGNMENT
|
|| crtl->preferred_stack_boundary == MAX_SUPPORTED_STACK_ALIGNMENT)
|
|| crtl->preferred_stack_boundary == MAX_SUPPORTED_STACK_ALIGNMENT)
|
{
|
{
|
int align = crtl->preferred_stack_boundary / BITS_PER_UNIT;
|
int align = crtl->preferred_stack_boundary / BITS_PER_UNIT;
|
|
|
if (align == 1)
|
if (align == 1)
|
return size;
|
return size;
|
|
|
if (CONST_INT_P (size))
|
if (CONST_INT_P (size))
|
{
|
{
|
HOST_WIDE_INT new_size = (INTVAL (size) + align - 1) / align * align;
|
HOST_WIDE_INT new_size = (INTVAL (size) + align - 1) / align * align;
|
|
|
if (INTVAL (size) != new_size)
|
if (INTVAL (size) != new_size)
|
size = GEN_INT (new_size);
|
size = GEN_INT (new_size);
|
return size;
|
return size;
|
}
|
}
|
|
|
align_rtx = GEN_INT (align);
|
align_rtx = GEN_INT (align);
|
alignm1_rtx = GEN_INT (align - 1);
|
alignm1_rtx = GEN_INT (align - 1);
|
}
|
}
|
else
|
else
|
{
|
{
|
/* If crtl->preferred_stack_boundary might still grow, use
|
/* If crtl->preferred_stack_boundary might still grow, use
|
virtual_preferred_stack_boundary_rtx instead. This will be
|
virtual_preferred_stack_boundary_rtx instead. This will be
|
substituted by the right value in vregs pass and optimized
|
substituted by the right value in vregs pass and optimized
|
during combine. */
|
during combine. */
|
align_rtx = virtual_preferred_stack_boundary_rtx;
|
align_rtx = virtual_preferred_stack_boundary_rtx;
|
alignm1_rtx = force_operand (plus_constant (align_rtx, -1), NULL_RTX);
|
alignm1_rtx = force_operand (plus_constant (align_rtx, -1), NULL_RTX);
|
}
|
}
|
|
|
/* CEIL_DIV_EXPR needs to worry about the addition overflowing,
|
/* CEIL_DIV_EXPR needs to worry about the addition overflowing,
|
but we know it can't. So add ourselves and then do
|
but we know it can't. So add ourselves and then do
|
TRUNC_DIV_EXPR. */
|
TRUNC_DIV_EXPR. */
|
size = expand_binop (Pmode, add_optab, size, alignm1_rtx,
|
size = expand_binop (Pmode, add_optab, size, alignm1_rtx,
|
NULL_RTX, 1, OPTAB_LIB_WIDEN);
|
NULL_RTX, 1, OPTAB_LIB_WIDEN);
|
size = expand_divmod (0, TRUNC_DIV_EXPR, Pmode, size, align_rtx,
|
size = expand_divmod (0, TRUNC_DIV_EXPR, Pmode, size, align_rtx,
|
NULL_RTX, 1);
|
NULL_RTX, 1);
|
size = expand_mult (Pmode, size, align_rtx, NULL_RTX, 1);
|
size = expand_mult (Pmode, size, align_rtx, NULL_RTX, 1);
|
|
|
return size;
|
return size;
|
}
|
}
|
|
|
/* Save the stack pointer for the purpose in SAVE_LEVEL. PSAVE is a pointer
|
/* Save the stack pointer for the purpose in SAVE_LEVEL. PSAVE is a pointer
|
to a previously-created save area. If no save area has been allocated,
|
to a previously-created save area. If no save area has been allocated,
|
this function will allocate one. If a save area is specified, it
|
this function will allocate one. If a save area is specified, it
|
must be of the proper mode. */
|
must be of the proper mode. */
|
|
|
void
|
void
|
emit_stack_save (enum save_level save_level, rtx *psave)
|
emit_stack_save (enum save_level save_level, rtx *psave)
|
{
|
{
|
rtx sa = *psave;
|
rtx sa = *psave;
|
/* The default is that we use a move insn and save in a Pmode object. */
|
/* The default is that we use a move insn and save in a Pmode object. */
|
rtx (*fcn) (rtx, rtx) = gen_move_insn;
|
rtx (*fcn) (rtx, rtx) = gen_move_insn;
|
enum machine_mode mode = STACK_SAVEAREA_MODE (save_level);
|
enum machine_mode mode = STACK_SAVEAREA_MODE (save_level);
|
|
|
/* See if this machine has anything special to do for this kind of save. */
|
/* See if this machine has anything special to do for this kind of save. */
|
switch (save_level)
|
switch (save_level)
|
{
|
{
|
#ifdef HAVE_save_stack_block
|
#ifdef HAVE_save_stack_block
|
case SAVE_BLOCK:
|
case SAVE_BLOCK:
|
if (HAVE_save_stack_block)
|
if (HAVE_save_stack_block)
|
fcn = gen_save_stack_block;
|
fcn = gen_save_stack_block;
|
break;
|
break;
|
#endif
|
#endif
|
#ifdef HAVE_save_stack_function
|
#ifdef HAVE_save_stack_function
|
case SAVE_FUNCTION:
|
case SAVE_FUNCTION:
|
if (HAVE_save_stack_function)
|
if (HAVE_save_stack_function)
|
fcn = gen_save_stack_function;
|
fcn = gen_save_stack_function;
|
break;
|
break;
|
#endif
|
#endif
|
#ifdef HAVE_save_stack_nonlocal
|
#ifdef HAVE_save_stack_nonlocal
|
case SAVE_NONLOCAL:
|
case SAVE_NONLOCAL:
|
if (HAVE_save_stack_nonlocal)
|
if (HAVE_save_stack_nonlocal)
|
fcn = gen_save_stack_nonlocal;
|
fcn = gen_save_stack_nonlocal;
|
break;
|
break;
|
#endif
|
#endif
|
default:
|
default:
|
break;
|
break;
|
}
|
}
|
|
|
/* If there is no save area and we have to allocate one, do so. Otherwise
|
/* If there is no save area and we have to allocate one, do so. Otherwise
|
verify the save area is the proper mode. */
|
verify the save area is the proper mode. */
|
|
|
if (sa == 0)
|
if (sa == 0)
|
{
|
{
|
if (mode != VOIDmode)
|
if (mode != VOIDmode)
|
{
|
{
|
if (save_level == SAVE_NONLOCAL)
|
if (save_level == SAVE_NONLOCAL)
|
*psave = sa = assign_stack_local (mode, GET_MODE_SIZE (mode), 0);
|
*psave = sa = assign_stack_local (mode, GET_MODE_SIZE (mode), 0);
|
else
|
else
|
*psave = sa = gen_reg_rtx (mode);
|
*psave = sa = gen_reg_rtx (mode);
|
}
|
}
|
}
|
}
|
|
|
do_pending_stack_adjust ();
|
do_pending_stack_adjust ();
|
if (sa != 0)
|
if (sa != 0)
|
sa = validize_mem (sa);
|
sa = validize_mem (sa);
|
emit_insn (fcn (sa, stack_pointer_rtx));
|
emit_insn (fcn (sa, stack_pointer_rtx));
|
}
|
}
|
|
|
/* Restore the stack pointer for the purpose in SAVE_LEVEL. SA is the save
|
/* Restore the stack pointer for the purpose in SAVE_LEVEL. SA is the save
|
area made by emit_stack_save. If it is zero, we have nothing to do. */
|
area made by emit_stack_save. If it is zero, we have nothing to do. */
|
|
|
void
|
void
|
emit_stack_restore (enum save_level save_level, rtx sa)
|
emit_stack_restore (enum save_level save_level, rtx sa)
|
{
|
{
|
/* The default is that we use a move insn. */
|
/* The default is that we use a move insn. */
|
rtx (*fcn) (rtx, rtx) = gen_move_insn;
|
rtx (*fcn) (rtx, rtx) = gen_move_insn;
|
|
|
/* If stack_realign_drap, the x86 backend emits a prologue that aligns both
|
/* If stack_realign_drap, the x86 backend emits a prologue that aligns both
|
STACK_POINTER and HARD_FRAME_POINTER.
|
STACK_POINTER and HARD_FRAME_POINTER.
|
If stack_realign_fp, the x86 backend emits a prologue that aligns only
|
If stack_realign_fp, the x86 backend emits a prologue that aligns only
|
STACK_POINTER. This renders the HARD_FRAME_POINTER unusable for accessing
|
STACK_POINTER. This renders the HARD_FRAME_POINTER unusable for accessing
|
aligned variables, which is reflected in ix86_can_eliminate.
|
aligned variables, which is reflected in ix86_can_eliminate.
|
We normally still have the realigned STACK_POINTER that we can use.
|
We normally still have the realigned STACK_POINTER that we can use.
|
But if there is a stack restore still present at reload, it can trigger
|
But if there is a stack restore still present at reload, it can trigger
|
mark_not_eliminable for the STACK_POINTER, leaving no way to eliminate
|
mark_not_eliminable for the STACK_POINTER, leaving no way to eliminate
|
FRAME_POINTER into a hard reg.
|
FRAME_POINTER into a hard reg.
|
To prevent this situation, we force need_drap if we emit a stack
|
To prevent this situation, we force need_drap if we emit a stack
|
restore. */
|
restore. */
|
if (SUPPORTS_STACK_ALIGNMENT)
|
if (SUPPORTS_STACK_ALIGNMENT)
|
crtl->need_drap = true;
|
crtl->need_drap = true;
|
|
|
/* See if this machine has anything special to do for this kind of save. */
|
/* See if this machine has anything special to do for this kind of save. */
|
switch (save_level)
|
switch (save_level)
|
{
|
{
|
#ifdef HAVE_restore_stack_block
|
#ifdef HAVE_restore_stack_block
|
case SAVE_BLOCK:
|
case SAVE_BLOCK:
|
if (HAVE_restore_stack_block)
|
if (HAVE_restore_stack_block)
|
fcn = gen_restore_stack_block;
|
fcn = gen_restore_stack_block;
|
break;
|
break;
|
#endif
|
#endif
|
#ifdef HAVE_restore_stack_function
|
#ifdef HAVE_restore_stack_function
|
case SAVE_FUNCTION:
|
case SAVE_FUNCTION:
|
if (HAVE_restore_stack_function)
|
if (HAVE_restore_stack_function)
|
fcn = gen_restore_stack_function;
|
fcn = gen_restore_stack_function;
|
break;
|
break;
|
#endif
|
#endif
|
#ifdef HAVE_restore_stack_nonlocal
|
#ifdef HAVE_restore_stack_nonlocal
|
case SAVE_NONLOCAL:
|
case SAVE_NONLOCAL:
|
if (HAVE_restore_stack_nonlocal)
|
if (HAVE_restore_stack_nonlocal)
|
fcn = gen_restore_stack_nonlocal;
|
fcn = gen_restore_stack_nonlocal;
|
break;
|
break;
|
#endif
|
#endif
|
default:
|
default:
|
break;
|
break;
|
}
|
}
|
|
|
if (sa != 0)
|
if (sa != 0)
|
{
|
{
|
sa = validize_mem (sa);
|
sa = validize_mem (sa);
|
/* These clobbers prevent the scheduler from moving
|
/* These clobbers prevent the scheduler from moving
|
references to variable arrays below the code
|
references to variable arrays below the code
|
that deletes (pops) the arrays. */
|
that deletes (pops) the arrays. */
|
emit_clobber (gen_rtx_MEM (BLKmode, gen_rtx_SCRATCH (VOIDmode)));
|
emit_clobber (gen_rtx_MEM (BLKmode, gen_rtx_SCRATCH (VOIDmode)));
|
emit_clobber (gen_rtx_MEM (BLKmode, stack_pointer_rtx));
|
emit_clobber (gen_rtx_MEM (BLKmode, stack_pointer_rtx));
|
}
|
}
|
|
|
discard_pending_stack_adjust ();
|
discard_pending_stack_adjust ();
|
|
|
emit_insn (fcn (stack_pointer_rtx, sa));
|
emit_insn (fcn (stack_pointer_rtx, sa));
|
}
|
}
|
|
|
/* Invoke emit_stack_save on the nonlocal_goto_save_area for the current
|
/* Invoke emit_stack_save on the nonlocal_goto_save_area for the current
|
function. This function should be called whenever we allocate or
|
function. This function should be called whenever we allocate or
|
deallocate dynamic stack space. */
|
deallocate dynamic stack space. */
|
|
|
void
|
void
|
update_nonlocal_goto_save_area (void)
|
update_nonlocal_goto_save_area (void)
|
{
|
{
|
tree t_save;
|
tree t_save;
|
rtx r_save;
|
rtx r_save;
|
|
|
/* The nonlocal_goto_save_area object is an array of N pointers. The
|
/* The nonlocal_goto_save_area object is an array of N pointers. The
|
first one is used for the frame pointer save; the rest are sized by
|
first one is used for the frame pointer save; the rest are sized by
|
STACK_SAVEAREA_MODE. Create a reference to array index 1, the first
|
STACK_SAVEAREA_MODE. Create a reference to array index 1, the first
|
of the stack save area slots. */
|
of the stack save area slots. */
|
t_save = build4 (ARRAY_REF,
|
t_save = build4 (ARRAY_REF,
|
TREE_TYPE (TREE_TYPE (cfun->nonlocal_goto_save_area)),
|
TREE_TYPE (TREE_TYPE (cfun->nonlocal_goto_save_area)),
|
cfun->nonlocal_goto_save_area,
|
cfun->nonlocal_goto_save_area,
|
integer_one_node, NULL_TREE, NULL_TREE);
|
integer_one_node, NULL_TREE, NULL_TREE);
|
r_save = expand_expr (t_save, NULL_RTX, VOIDmode, EXPAND_WRITE);
|
r_save = expand_expr (t_save, NULL_RTX, VOIDmode, EXPAND_WRITE);
|
|
|
emit_stack_save (SAVE_NONLOCAL, &r_save);
|
emit_stack_save (SAVE_NONLOCAL, &r_save);
|
}
|
}
|
|
|
/* Return an rtx representing the address of an area of memory dynamically
|
/* Return an rtx representing the address of an area of memory dynamically
|
pushed on the stack.
|
pushed on the stack.
|
|
|
Any required stack pointer alignment is preserved.
|
Any required stack pointer alignment is preserved.
|
|
|
SIZE is an rtx representing the size of the area.
|
SIZE is an rtx representing the size of the area.
|
|
|
SIZE_ALIGN is the alignment (in bits) that we know SIZE has. This
|
SIZE_ALIGN is the alignment (in bits) that we know SIZE has. This
|
parameter may be zero. If so, a proper value will be extracted
|
parameter may be zero. If so, a proper value will be extracted
|
from SIZE if it is constant, otherwise BITS_PER_UNIT will be assumed.
|
from SIZE if it is constant, otherwise BITS_PER_UNIT will be assumed.
|
|
|
REQUIRED_ALIGN is the alignment (in bits) required for the region
|
REQUIRED_ALIGN is the alignment (in bits) required for the region
|
of memory.
|
of memory.
|
|
|
If CANNOT_ACCUMULATE is set to TRUE, the caller guarantees that the
|
If CANNOT_ACCUMULATE is set to TRUE, the caller guarantees that the
|
stack space allocated by the generated code cannot be added with itself
|
stack space allocated by the generated code cannot be added with itself
|
in the course of the execution of the function. It is always safe to
|
in the course of the execution of the function. It is always safe to
|
pass FALSE here and the following criterion is sufficient in order to
|
pass FALSE here and the following criterion is sufficient in order to
|
pass TRUE: every path in the CFG that starts at the allocation point and
|
pass TRUE: every path in the CFG that starts at the allocation point and
|
loops to it executes the associated deallocation code. */
|
loops to it executes the associated deallocation code. */
|
|
|
rtx
|
rtx
|
allocate_dynamic_stack_space (rtx size, unsigned size_align,
|
allocate_dynamic_stack_space (rtx size, unsigned size_align,
|
unsigned required_align, bool cannot_accumulate)
|
unsigned required_align, bool cannot_accumulate)
|
{
|
{
|
HOST_WIDE_INT stack_usage_size = -1;
|
HOST_WIDE_INT stack_usage_size = -1;
|
rtx final_label, final_target, target;
|
rtx final_label, final_target, target;
|
unsigned extra_align = 0;
|
unsigned extra_align = 0;
|
bool must_align;
|
bool must_align;
|
|
|
/* If we're asking for zero bytes, it doesn't matter what we point
|
/* If we're asking for zero bytes, it doesn't matter what we point
|
to since we can't dereference it. But return a reasonable
|
to since we can't dereference it. But return a reasonable
|
address anyway. */
|
address anyway. */
|
if (size == const0_rtx)
|
if (size == const0_rtx)
|
return virtual_stack_dynamic_rtx;
|
return virtual_stack_dynamic_rtx;
|
|
|
/* Otherwise, show we're calling alloca or equivalent. */
|
/* Otherwise, show we're calling alloca or equivalent. */
|
cfun->calls_alloca = 1;
|
cfun->calls_alloca = 1;
|
|
|
/* If stack usage info is requested, look into the size we are passed.
|
/* If stack usage info is requested, look into the size we are passed.
|
We need to do so this early to avoid the obfuscation that may be
|
We need to do so this early to avoid the obfuscation that may be
|
introduced later by the various alignment operations. */
|
introduced later by the various alignment operations. */
|
if (flag_stack_usage_info)
|
if (flag_stack_usage_info)
|
{
|
{
|
if (CONST_INT_P (size))
|
if (CONST_INT_P (size))
|
stack_usage_size = INTVAL (size);
|
stack_usage_size = INTVAL (size);
|
else if (REG_P (size))
|
else if (REG_P (size))
|
{
|
{
|
/* Look into the last emitted insn and see if we can deduce
|
/* Look into the last emitted insn and see if we can deduce
|
something for the register. */
|
something for the register. */
|
rtx insn, set, note;
|
rtx insn, set, note;
|
insn = get_last_insn ();
|
insn = get_last_insn ();
|
if ((set = single_set (insn)) && rtx_equal_p (SET_DEST (set), size))
|
if ((set = single_set (insn)) && rtx_equal_p (SET_DEST (set), size))
|
{
|
{
|
if (CONST_INT_P (SET_SRC (set)))
|
if (CONST_INT_P (SET_SRC (set)))
|
stack_usage_size = INTVAL (SET_SRC (set));
|
stack_usage_size = INTVAL (SET_SRC (set));
|
else if ((note = find_reg_equal_equiv_note (insn))
|
else if ((note = find_reg_equal_equiv_note (insn))
|
&& CONST_INT_P (XEXP (note, 0)))
|
&& CONST_INT_P (XEXP (note, 0)))
|
stack_usage_size = INTVAL (XEXP (note, 0));
|
stack_usage_size = INTVAL (XEXP (note, 0));
|
}
|
}
|
}
|
}
|
|
|
/* If the size is not constant, we can't say anything. */
|
/* If the size is not constant, we can't say anything. */
|
if (stack_usage_size == -1)
|
if (stack_usage_size == -1)
|
{
|
{
|
current_function_has_unbounded_dynamic_stack_size = 1;
|
current_function_has_unbounded_dynamic_stack_size = 1;
|
stack_usage_size = 0;
|
stack_usage_size = 0;
|
}
|
}
|
}
|
}
|
|
|
/* Ensure the size is in the proper mode. */
|
/* Ensure the size is in the proper mode. */
|
if (GET_MODE (size) != VOIDmode && GET_MODE (size) != Pmode)
|
if (GET_MODE (size) != VOIDmode && GET_MODE (size) != Pmode)
|
size = convert_to_mode (Pmode, size, 1);
|
size = convert_to_mode (Pmode, size, 1);
|
|
|
/* Adjust SIZE_ALIGN, if needed. */
|
/* Adjust SIZE_ALIGN, if needed. */
|
if (CONST_INT_P (size))
|
if (CONST_INT_P (size))
|
{
|
{
|
unsigned HOST_WIDE_INT lsb;
|
unsigned HOST_WIDE_INT lsb;
|
|
|
lsb = INTVAL (size);
|
lsb = INTVAL (size);
|
lsb &= -lsb;
|
lsb &= -lsb;
|
|
|
/* Watch out for overflow truncating to "unsigned". */
|
/* Watch out for overflow truncating to "unsigned". */
|
if (lsb > UINT_MAX / BITS_PER_UNIT)
|
if (lsb > UINT_MAX / BITS_PER_UNIT)
|
size_align = 1u << (HOST_BITS_PER_INT - 1);
|
size_align = 1u << (HOST_BITS_PER_INT - 1);
|
else
|
else
|
size_align = (unsigned)lsb * BITS_PER_UNIT;
|
size_align = (unsigned)lsb * BITS_PER_UNIT;
|
}
|
}
|
else if (size_align < BITS_PER_UNIT)
|
else if (size_align < BITS_PER_UNIT)
|
size_align = BITS_PER_UNIT;
|
size_align = BITS_PER_UNIT;
|
|
|
/* We can't attempt to minimize alignment necessary, because we don't
|
/* We can't attempt to minimize alignment necessary, because we don't
|
know the final value of preferred_stack_boundary yet while executing
|
know the final value of preferred_stack_boundary yet while executing
|
this code. */
|
this code. */
|
if (crtl->preferred_stack_boundary < PREFERRED_STACK_BOUNDARY)
|
if (crtl->preferred_stack_boundary < PREFERRED_STACK_BOUNDARY)
|
crtl->preferred_stack_boundary = PREFERRED_STACK_BOUNDARY;
|
crtl->preferred_stack_boundary = PREFERRED_STACK_BOUNDARY;
|
|
|
/* We will need to ensure that the address we return is aligned to
|
/* We will need to ensure that the address we return is aligned to
|
REQUIRED_ALIGN. If STACK_DYNAMIC_OFFSET is defined, we don't
|
REQUIRED_ALIGN. If STACK_DYNAMIC_OFFSET is defined, we don't
|
always know its final value at this point in the compilation (it
|
always know its final value at this point in the compilation (it
|
might depend on the size of the outgoing parameter lists, for
|
might depend on the size of the outgoing parameter lists, for
|
example), so we must align the value to be returned in that case.
|
example), so we must align the value to be returned in that case.
|
(Note that STACK_DYNAMIC_OFFSET will have a default nonzero value if
|
(Note that STACK_DYNAMIC_OFFSET will have a default nonzero value if
|
STACK_POINTER_OFFSET or ACCUMULATE_OUTGOING_ARGS are defined).
|
STACK_POINTER_OFFSET or ACCUMULATE_OUTGOING_ARGS are defined).
|
We must also do an alignment operation on the returned value if
|
We must also do an alignment operation on the returned value if
|
the stack pointer alignment is less strict than REQUIRED_ALIGN.
|
the stack pointer alignment is less strict than REQUIRED_ALIGN.
|
|
|
If we have to align, we must leave space in SIZE for the hole
|
If we have to align, we must leave space in SIZE for the hole
|
that might result from the alignment operation. */
|
that might result from the alignment operation. */
|
|
|
must_align = (crtl->preferred_stack_boundary < required_align);
|
must_align = (crtl->preferred_stack_boundary < required_align);
|
if (must_align)
|
if (must_align)
|
{
|
{
|
if (required_align > PREFERRED_STACK_BOUNDARY)
|
if (required_align > PREFERRED_STACK_BOUNDARY)
|
extra_align = PREFERRED_STACK_BOUNDARY;
|
extra_align = PREFERRED_STACK_BOUNDARY;
|
else if (required_align > STACK_BOUNDARY)
|
else if (required_align > STACK_BOUNDARY)
|
extra_align = STACK_BOUNDARY;
|
extra_align = STACK_BOUNDARY;
|
else
|
else
|
extra_align = BITS_PER_UNIT;
|
extra_align = BITS_PER_UNIT;
|
}
|
}
|
|
|
/* ??? STACK_POINTER_OFFSET is always defined now. */
|
/* ??? STACK_POINTER_OFFSET is always defined now. */
|
#if defined (STACK_DYNAMIC_OFFSET) || defined (STACK_POINTER_OFFSET)
|
#if defined (STACK_DYNAMIC_OFFSET) || defined (STACK_POINTER_OFFSET)
|
must_align = true;
|
must_align = true;
|
extra_align = BITS_PER_UNIT;
|
extra_align = BITS_PER_UNIT;
|
#endif
|
#endif
|
|
|
if (must_align)
|
if (must_align)
|
{
|
{
|
unsigned extra = (required_align - extra_align) / BITS_PER_UNIT;
|
unsigned extra = (required_align - extra_align) / BITS_PER_UNIT;
|
|
|
size = plus_constant (size, extra);
|
size = plus_constant (size, extra);
|
size = force_operand (size, NULL_RTX);
|
size = force_operand (size, NULL_RTX);
|
|
|
if (flag_stack_usage_info)
|
if (flag_stack_usage_info)
|
stack_usage_size += extra;
|
stack_usage_size += extra;
|
|
|
if (extra && size_align > extra_align)
|
if (extra && size_align > extra_align)
|
size_align = extra_align;
|
size_align = extra_align;
|
}
|
}
|
|
|
/* Round the size to a multiple of the required stack alignment.
|
/* Round the size to a multiple of the required stack alignment.
|
Since the stack if presumed to be rounded before this allocation,
|
Since the stack if presumed to be rounded before this allocation,
|
this will maintain the required alignment.
|
this will maintain the required alignment.
|
|
|
If the stack grows downward, we could save an insn by subtracting
|
If the stack grows downward, we could save an insn by subtracting
|
SIZE from the stack pointer and then aligning the stack pointer.
|
SIZE from the stack pointer and then aligning the stack pointer.
|
The problem with this is that the stack pointer may be unaligned
|
The problem with this is that the stack pointer may be unaligned
|
between the execution of the subtraction and alignment insns and
|
between the execution of the subtraction and alignment insns and
|
some machines do not allow this. Even on those that do, some
|
some machines do not allow this. Even on those that do, some
|
signal handlers malfunction if a signal should occur between those
|
signal handlers malfunction if a signal should occur between those
|
insns. Since this is an extremely rare event, we have no reliable
|
insns. Since this is an extremely rare event, we have no reliable
|
way of knowing which systems have this problem. So we avoid even
|
way of knowing which systems have this problem. So we avoid even
|
momentarily mis-aligning the stack. */
|
momentarily mis-aligning the stack. */
|
if (size_align % MAX_SUPPORTED_STACK_ALIGNMENT != 0)
|
if (size_align % MAX_SUPPORTED_STACK_ALIGNMENT != 0)
|
{
|
{
|
size = round_push (size);
|
size = round_push (size);
|
|
|
if (flag_stack_usage_info)
|
if (flag_stack_usage_info)
|
{
|
{
|
int align = crtl->preferred_stack_boundary / BITS_PER_UNIT;
|
int align = crtl->preferred_stack_boundary / BITS_PER_UNIT;
|
stack_usage_size = (stack_usage_size + align - 1) / align * align;
|
stack_usage_size = (stack_usage_size + align - 1) / align * align;
|
}
|
}
|
}
|
}
|
|
|
target = gen_reg_rtx (Pmode);
|
target = gen_reg_rtx (Pmode);
|
|
|
/* The size is supposed to be fully adjusted at this point so record it
|
/* The size is supposed to be fully adjusted at this point so record it
|
if stack usage info is requested. */
|
if stack usage info is requested. */
|
if (flag_stack_usage_info)
|
if (flag_stack_usage_info)
|
{
|
{
|
current_function_dynamic_stack_size += stack_usage_size;
|
current_function_dynamic_stack_size += stack_usage_size;
|
|
|
/* ??? This is gross but the only safe stance in the absence
|
/* ??? This is gross but the only safe stance in the absence
|
of stack usage oriented flow analysis. */
|
of stack usage oriented flow analysis. */
|
if (!cannot_accumulate)
|
if (!cannot_accumulate)
|
current_function_has_unbounded_dynamic_stack_size = 1;
|
current_function_has_unbounded_dynamic_stack_size = 1;
|
}
|
}
|
|
|
final_label = NULL_RTX;
|
final_label = NULL_RTX;
|
final_target = NULL_RTX;
|
final_target = NULL_RTX;
|
|
|
/* If we are splitting the stack, we need to ask the backend whether
|
/* If we are splitting the stack, we need to ask the backend whether
|
there is enough room on the current stack. If there isn't, or if
|
there is enough room on the current stack. If there isn't, or if
|
the backend doesn't know how to tell is, then we need to call a
|
the backend doesn't know how to tell is, then we need to call a
|
function to allocate memory in some other way. This memory will
|
function to allocate memory in some other way. This memory will
|
be released when we release the current stack segment. The
|
be released when we release the current stack segment. The
|
effect is that stack allocation becomes less efficient, but at
|
effect is that stack allocation becomes less efficient, but at
|
least it doesn't cause a stack overflow. */
|
least it doesn't cause a stack overflow. */
|
if (flag_split_stack)
|
if (flag_split_stack)
|
{
|
{
|
rtx available_label, ask, space, func;
|
rtx available_label, ask, space, func;
|
|
|
available_label = NULL_RTX;
|
available_label = NULL_RTX;
|
|
|
#ifdef HAVE_split_stack_space_check
|
#ifdef HAVE_split_stack_space_check
|
if (HAVE_split_stack_space_check)
|
if (HAVE_split_stack_space_check)
|
{
|
{
|
available_label = gen_label_rtx ();
|
available_label = gen_label_rtx ();
|
|
|
/* This instruction will branch to AVAILABLE_LABEL if there
|
/* This instruction will branch to AVAILABLE_LABEL if there
|
are SIZE bytes available on the stack. */
|
are SIZE bytes available on the stack. */
|
emit_insn (gen_split_stack_space_check (size, available_label));
|
emit_insn (gen_split_stack_space_check (size, available_label));
|
}
|
}
|
#endif
|
#endif
|
|
|
/* The __morestack_allocate_stack_space function will allocate
|
/* The __morestack_allocate_stack_space function will allocate
|
memory using malloc. If the alignment of the memory returned
|
memory using malloc. If the alignment of the memory returned
|
by malloc does not meet REQUIRED_ALIGN, we increase SIZE to
|
by malloc does not meet REQUIRED_ALIGN, we increase SIZE to
|
make sure we allocate enough space. */
|
make sure we allocate enough space. */
|
if (MALLOC_ABI_ALIGNMENT >= required_align)
|
if (MALLOC_ABI_ALIGNMENT >= required_align)
|
ask = size;
|
ask = size;
|
else
|
else
|
{
|
{
|
ask = expand_binop (Pmode, add_optab, size,
|
ask = expand_binop (Pmode, add_optab, size,
|
GEN_INT (required_align / BITS_PER_UNIT - 1),
|
GEN_INT (required_align / BITS_PER_UNIT - 1),
|
NULL_RTX, 1, OPTAB_LIB_WIDEN);
|
NULL_RTX, 1, OPTAB_LIB_WIDEN);
|
must_align = true;
|
must_align = true;
|
}
|
}
|
|
|
func = init_one_libfunc ("__morestack_allocate_stack_space");
|
func = init_one_libfunc ("__morestack_allocate_stack_space");
|
|
|
space = emit_library_call_value (func, target, LCT_NORMAL, Pmode,
|
space = emit_library_call_value (func, target, LCT_NORMAL, Pmode,
|
1, ask, Pmode);
|
1, ask, Pmode);
|
|
|
if (available_label == NULL_RTX)
|
if (available_label == NULL_RTX)
|
return space;
|
return space;
|
|
|
final_target = gen_reg_rtx (Pmode);
|
final_target = gen_reg_rtx (Pmode);
|
|
|
emit_move_insn (final_target, space);
|
emit_move_insn (final_target, space);
|
|
|
final_label = gen_label_rtx ();
|
final_label = gen_label_rtx ();
|
emit_jump (final_label);
|
emit_jump (final_label);
|
|
|
emit_label (available_label);
|
emit_label (available_label);
|
}
|
}
|
|
|
do_pending_stack_adjust ();
|
do_pending_stack_adjust ();
|
|
|
/* We ought to be called always on the toplevel and stack ought to be aligned
|
/* We ought to be called always on the toplevel and stack ought to be aligned
|
properly. */
|
properly. */
|
gcc_assert (!(stack_pointer_delta
|
gcc_assert (!(stack_pointer_delta
|
% (PREFERRED_STACK_BOUNDARY / BITS_PER_UNIT)));
|
% (PREFERRED_STACK_BOUNDARY / BITS_PER_UNIT)));
|
|
|
/* If needed, check that we have the required amount of stack. Take into
|
/* If needed, check that we have the required amount of stack. Take into
|
account what has already been checked. */
|
account what has already been checked. */
|
if (STACK_CHECK_MOVING_SP)
|
if (STACK_CHECK_MOVING_SP)
|
;
|
;
|
else if (flag_stack_check == GENERIC_STACK_CHECK)
|
else if (flag_stack_check == GENERIC_STACK_CHECK)
|
probe_stack_range (STACK_OLD_CHECK_PROTECT + STACK_CHECK_MAX_FRAME_SIZE,
|
probe_stack_range (STACK_OLD_CHECK_PROTECT + STACK_CHECK_MAX_FRAME_SIZE,
|
size);
|
size);
|
else if (flag_stack_check == STATIC_BUILTIN_STACK_CHECK)
|
else if (flag_stack_check == STATIC_BUILTIN_STACK_CHECK)
|
probe_stack_range (STACK_CHECK_PROTECT, size);
|
probe_stack_range (STACK_CHECK_PROTECT, size);
|
|
|
/* Don't let anti_adjust_stack emit notes. */
|
/* Don't let anti_adjust_stack emit notes. */
|
suppress_reg_args_size = true;
|
suppress_reg_args_size = true;
|
|
|
/* Perform the required allocation from the stack. Some systems do
|
/* Perform the required allocation from the stack. Some systems do
|
this differently than simply incrementing/decrementing from the
|
this differently than simply incrementing/decrementing from the
|
stack pointer, such as acquiring the space by calling malloc(). */
|
stack pointer, such as acquiring the space by calling malloc(). */
|
#ifdef HAVE_allocate_stack
|
#ifdef HAVE_allocate_stack
|
if (HAVE_allocate_stack)
|
if (HAVE_allocate_stack)
|
{
|
{
|
struct expand_operand ops[2];
|
struct expand_operand ops[2];
|
/* We don't have to check against the predicate for operand 0 since
|
/* We don't have to check against the predicate for operand 0 since
|
TARGET is known to be a pseudo of the proper mode, which must
|
TARGET is known to be a pseudo of the proper mode, which must
|
be valid for the operand. */
|
be valid for the operand. */
|
create_fixed_operand (&ops[0], target);
|
create_fixed_operand (&ops[0], target);
|
create_convert_operand_to (&ops[1], size, STACK_SIZE_MODE, true);
|
create_convert_operand_to (&ops[1], size, STACK_SIZE_MODE, true);
|
expand_insn (CODE_FOR_allocate_stack, 2, ops);
|
expand_insn (CODE_FOR_allocate_stack, 2, ops);
|
}
|
}
|
else
|
else
|
#endif
|
#endif
|
{
|
{
|
int saved_stack_pointer_delta;
|
int saved_stack_pointer_delta;
|
|
|
#ifndef STACK_GROWS_DOWNWARD
|
#ifndef STACK_GROWS_DOWNWARD
|
emit_move_insn (target, virtual_stack_dynamic_rtx);
|
emit_move_insn (target, virtual_stack_dynamic_rtx);
|
#endif
|
#endif
|
|
|
/* Check stack bounds if necessary. */
|
/* Check stack bounds if necessary. */
|
if (crtl->limit_stack)
|
if (crtl->limit_stack)
|
{
|
{
|
rtx available;
|
rtx available;
|
rtx space_available = gen_label_rtx ();
|
rtx space_available = gen_label_rtx ();
|
#ifdef STACK_GROWS_DOWNWARD
|
#ifdef STACK_GROWS_DOWNWARD
|
available = expand_binop (Pmode, sub_optab,
|
available = expand_binop (Pmode, sub_optab,
|
stack_pointer_rtx, stack_limit_rtx,
|
stack_pointer_rtx, stack_limit_rtx,
|
NULL_RTX, 1, OPTAB_WIDEN);
|
NULL_RTX, 1, OPTAB_WIDEN);
|
#else
|
#else
|
available = expand_binop (Pmode, sub_optab,
|
available = expand_binop (Pmode, sub_optab,
|
stack_limit_rtx, stack_pointer_rtx,
|
stack_limit_rtx, stack_pointer_rtx,
|
NULL_RTX, 1, OPTAB_WIDEN);
|
NULL_RTX, 1, OPTAB_WIDEN);
|
#endif
|
#endif
|
emit_cmp_and_jump_insns (available, size, GEU, NULL_RTX, Pmode, 1,
|
emit_cmp_and_jump_insns (available, size, GEU, NULL_RTX, Pmode, 1,
|
space_available);
|
space_available);
|
#ifdef HAVE_trap
|
#ifdef HAVE_trap
|
if (HAVE_trap)
|
if (HAVE_trap)
|
emit_insn (gen_trap ());
|
emit_insn (gen_trap ());
|
else
|
else
|
#endif
|
#endif
|
error ("stack limits not supported on this target");
|
error ("stack limits not supported on this target");
|
emit_barrier ();
|
emit_barrier ();
|
emit_label (space_available);
|
emit_label (space_available);
|
}
|
}
|
|
|
saved_stack_pointer_delta = stack_pointer_delta;
|
saved_stack_pointer_delta = stack_pointer_delta;
|
|
|
if (flag_stack_check && STACK_CHECK_MOVING_SP)
|
if (flag_stack_check && STACK_CHECK_MOVING_SP)
|
anti_adjust_stack_and_probe (size, false);
|
anti_adjust_stack_and_probe (size, false);
|
else
|
else
|
anti_adjust_stack (size);
|
anti_adjust_stack (size);
|
|
|
/* Even if size is constant, don't modify stack_pointer_delta.
|
/* Even if size is constant, don't modify stack_pointer_delta.
|
The constant size alloca should preserve
|
The constant size alloca should preserve
|
crtl->preferred_stack_boundary alignment. */
|
crtl->preferred_stack_boundary alignment. */
|
stack_pointer_delta = saved_stack_pointer_delta;
|
stack_pointer_delta = saved_stack_pointer_delta;
|
|
|
#ifdef STACK_GROWS_DOWNWARD
|
#ifdef STACK_GROWS_DOWNWARD
|
emit_move_insn (target, virtual_stack_dynamic_rtx);
|
emit_move_insn (target, virtual_stack_dynamic_rtx);
|
#endif
|
#endif
|
}
|
}
|
|
|
suppress_reg_args_size = false;
|
suppress_reg_args_size = false;
|
|
|
/* Finish up the split stack handling. */
|
/* Finish up the split stack handling. */
|
if (final_label != NULL_RTX)
|
if (final_label != NULL_RTX)
|
{
|
{
|
gcc_assert (flag_split_stack);
|
gcc_assert (flag_split_stack);
|
emit_move_insn (final_target, target);
|
emit_move_insn (final_target, target);
|
emit_label (final_label);
|
emit_label (final_label);
|
target = final_target;
|
target = final_target;
|
}
|
}
|
|
|
if (must_align)
|
if (must_align)
|
{
|
{
|
/* CEIL_DIV_EXPR needs to worry about the addition overflowing,
|
/* CEIL_DIV_EXPR needs to worry about the addition overflowing,
|
but we know it can't. So add ourselves and then do
|
but we know it can't. So add ourselves and then do
|
TRUNC_DIV_EXPR. */
|
TRUNC_DIV_EXPR. */
|
target = expand_binop (Pmode, add_optab, target,
|
target = expand_binop (Pmode, add_optab, target,
|
GEN_INT (required_align / BITS_PER_UNIT - 1),
|
GEN_INT (required_align / BITS_PER_UNIT - 1),
|
NULL_RTX, 1, OPTAB_LIB_WIDEN);
|
NULL_RTX, 1, OPTAB_LIB_WIDEN);
|
target = expand_divmod (0, TRUNC_DIV_EXPR, Pmode, target,
|
target = expand_divmod (0, TRUNC_DIV_EXPR, Pmode, target,
|
GEN_INT (required_align / BITS_PER_UNIT),
|
GEN_INT (required_align / BITS_PER_UNIT),
|
NULL_RTX, 1);
|
NULL_RTX, 1);
|
target = expand_mult (Pmode, target,
|
target = expand_mult (Pmode, target,
|
GEN_INT (required_align / BITS_PER_UNIT),
|
GEN_INT (required_align / BITS_PER_UNIT),
|
NULL_RTX, 1);
|
NULL_RTX, 1);
|
}
|
}
|
|
|
/* Now that we've committed to a return value, mark its alignment. */
|
/* Now that we've committed to a return value, mark its alignment. */
|
mark_reg_pointer (target, required_align);
|
mark_reg_pointer (target, required_align);
|
|
|
/* Record the new stack level for nonlocal gotos. */
|
/* Record the new stack level for nonlocal gotos. */
|
if (cfun->nonlocal_goto_save_area != 0)
|
if (cfun->nonlocal_goto_save_area != 0)
|
update_nonlocal_goto_save_area ();
|
update_nonlocal_goto_save_area ();
|
|
|
return target;
|
return target;
|
}
|
}
|
|
|
/* A front end may want to override GCC's stack checking by providing a
|
/* A front end may want to override GCC's stack checking by providing a
|
run-time routine to call to check the stack, so provide a mechanism for
|
run-time routine to call to check the stack, so provide a mechanism for
|
calling that routine. */
|
calling that routine. */
|
|
|
static GTY(()) rtx stack_check_libfunc;
|
static GTY(()) rtx stack_check_libfunc;
|
|
|
void
|
void
|
set_stack_check_libfunc (const char *libfunc_name)
|
set_stack_check_libfunc (const char *libfunc_name)
|
{
|
{
|
gcc_assert (stack_check_libfunc == NULL_RTX);
|
gcc_assert (stack_check_libfunc == NULL_RTX);
|
stack_check_libfunc = gen_rtx_SYMBOL_REF (Pmode, libfunc_name);
|
stack_check_libfunc = gen_rtx_SYMBOL_REF (Pmode, libfunc_name);
|
}
|
}
|
|
|
/* Emit one stack probe at ADDRESS, an address within the stack. */
|
/* Emit one stack probe at ADDRESS, an address within the stack. */
|
|
|
void
|
void
|
emit_stack_probe (rtx address)
|
emit_stack_probe (rtx address)
|
{
|
{
|
rtx memref = gen_rtx_MEM (word_mode, address);
|
rtx memref = gen_rtx_MEM (word_mode, address);
|
|
|
MEM_VOLATILE_P (memref) = 1;
|
MEM_VOLATILE_P (memref) = 1;
|
|
|
/* See if we have an insn to probe the stack. */
|
/* See if we have an insn to probe the stack. */
|
#ifdef HAVE_probe_stack
|
#ifdef HAVE_probe_stack
|
if (HAVE_probe_stack)
|
if (HAVE_probe_stack)
|
emit_insn (gen_probe_stack (memref));
|
emit_insn (gen_probe_stack (memref));
|
else
|
else
|
#endif
|
#endif
|
emit_move_insn (memref, const0_rtx);
|
emit_move_insn (memref, const0_rtx);
|
}
|
}
|
|
|
/* Probe a range of stack addresses from FIRST to FIRST+SIZE, inclusive.
|
/* Probe a range of stack addresses from FIRST to FIRST+SIZE, inclusive.
|
FIRST is a constant and size is a Pmode RTX. These are offsets from
|
FIRST is a constant and size is a Pmode RTX. These are offsets from
|
the current stack pointer. STACK_GROWS_DOWNWARD says whether to add
|
the current stack pointer. STACK_GROWS_DOWNWARD says whether to add
|
or subtract them from the stack pointer. */
|
or subtract them from the stack pointer. */
|
|
|
#define PROBE_INTERVAL (1 << STACK_CHECK_PROBE_INTERVAL_EXP)
|
#define PROBE_INTERVAL (1 << STACK_CHECK_PROBE_INTERVAL_EXP)
|
|
|
#ifdef STACK_GROWS_DOWNWARD
|
#ifdef STACK_GROWS_DOWNWARD
|
#define STACK_GROW_OP MINUS
|
#define STACK_GROW_OP MINUS
|
#define STACK_GROW_OPTAB sub_optab
|
#define STACK_GROW_OPTAB sub_optab
|
#define STACK_GROW_OFF(off) -(off)
|
#define STACK_GROW_OFF(off) -(off)
|
#else
|
#else
|
#define STACK_GROW_OP PLUS
|
#define STACK_GROW_OP PLUS
|
#define STACK_GROW_OPTAB add_optab
|
#define STACK_GROW_OPTAB add_optab
|
#define STACK_GROW_OFF(off) (off)
|
#define STACK_GROW_OFF(off) (off)
|
#endif
|
#endif
|
|
|
void
|
void
|
probe_stack_range (HOST_WIDE_INT first, rtx size)
|
probe_stack_range (HOST_WIDE_INT first, rtx size)
|
{
|
{
|
/* First ensure SIZE is Pmode. */
|
/* First ensure SIZE is Pmode. */
|
if (GET_MODE (size) != VOIDmode && GET_MODE (size) != Pmode)
|
if (GET_MODE (size) != VOIDmode && GET_MODE (size) != Pmode)
|
size = convert_to_mode (Pmode, size, 1);
|
size = convert_to_mode (Pmode, size, 1);
|
|
|
/* Next see if we have a function to check the stack. */
|
/* Next see if we have a function to check the stack. */
|
if (stack_check_libfunc)
|
if (stack_check_libfunc)
|
{
|
{
|
rtx addr = memory_address (Pmode,
|
rtx addr = memory_address (Pmode,
|
gen_rtx_fmt_ee (STACK_GROW_OP, Pmode,
|
gen_rtx_fmt_ee (STACK_GROW_OP, Pmode,
|
stack_pointer_rtx,
|
stack_pointer_rtx,
|
plus_constant (size, first)));
|
plus_constant (size, first)));
|
emit_library_call (stack_check_libfunc, LCT_NORMAL, VOIDmode, 1, addr,
|
emit_library_call (stack_check_libfunc, LCT_NORMAL, VOIDmode, 1, addr,
|
Pmode);
|
Pmode);
|
return;
|
return;
|
}
|
}
|
|
|
/* Next see if we have an insn to check the stack. */
|
/* Next see if we have an insn to check the stack. */
|
#ifdef HAVE_check_stack
|
#ifdef HAVE_check_stack
|
if (HAVE_check_stack)
|
if (HAVE_check_stack)
|
{
|
{
|
struct expand_operand ops[1];
|
struct expand_operand ops[1];
|
rtx addr = memory_address (Pmode,
|
rtx addr = memory_address (Pmode,
|
gen_rtx_fmt_ee (STACK_GROW_OP, Pmode,
|
gen_rtx_fmt_ee (STACK_GROW_OP, Pmode,
|
stack_pointer_rtx,
|
stack_pointer_rtx,
|
plus_constant (size, first)));
|
plus_constant (size, first)));
|
|
|
create_input_operand (&ops[0], addr, Pmode);
|
create_input_operand (&ops[0], addr, Pmode);
|
if (maybe_expand_insn (CODE_FOR_check_stack, 1, ops))
|
if (maybe_expand_insn (CODE_FOR_check_stack, 1, ops))
|
return;
|
return;
|
}
|
}
|
#endif
|
#endif
|
|
|
/* Otherwise we have to generate explicit probes. If we have a constant
|
/* Otherwise we have to generate explicit probes. If we have a constant
|
small number of them to generate, that's the easy case. */
|
small number of them to generate, that's the easy case. */
|
else if (CONST_INT_P (size) && INTVAL (size) < 7 * PROBE_INTERVAL)
|
else if (CONST_INT_P (size) && INTVAL (size) < 7 * PROBE_INTERVAL)
|
{
|
{
|
HOST_WIDE_INT isize = INTVAL (size), i;
|
HOST_WIDE_INT isize = INTVAL (size), i;
|
rtx addr;
|
rtx addr;
|
|
|
/* Probe at FIRST + N * PROBE_INTERVAL for values of N from 1 until
|
/* Probe at FIRST + N * PROBE_INTERVAL for values of N from 1 until
|
it exceeds SIZE. If only one probe is needed, this will not
|
it exceeds SIZE. If only one probe is needed, this will not
|
generate any code. Then probe at FIRST + SIZE. */
|
generate any code. Then probe at FIRST + SIZE. */
|
for (i = PROBE_INTERVAL; i < isize; i += PROBE_INTERVAL)
|
for (i = PROBE_INTERVAL; i < isize; i += PROBE_INTERVAL)
|
{
|
{
|
addr = memory_address (Pmode,
|
addr = memory_address (Pmode,
|
plus_constant (stack_pointer_rtx,
|
plus_constant (stack_pointer_rtx,
|
STACK_GROW_OFF (first + i)));
|
STACK_GROW_OFF (first + i)));
|
emit_stack_probe (addr);
|
emit_stack_probe (addr);
|
}
|
}
|
|
|
addr = memory_address (Pmode,
|
addr = memory_address (Pmode,
|
plus_constant (stack_pointer_rtx,
|
plus_constant (stack_pointer_rtx,
|
STACK_GROW_OFF (first + isize)));
|
STACK_GROW_OFF (first + isize)));
|
emit_stack_probe (addr);
|
emit_stack_probe (addr);
|
}
|
}
|
|
|
/* In the variable case, do the same as above, but in a loop. Note that we
|
/* In the variable case, do the same as above, but in a loop. Note that we
|
must be extra careful with variables wrapping around because we might be
|
must be extra careful with variables wrapping around because we might be
|
at the very top (or the very bottom) of the address space and we have to
|
at the very top (or the very bottom) of the address space and we have to
|
be able to handle this case properly; in particular, we use an equality
|
be able to handle this case properly; in particular, we use an equality
|
test for the loop condition. */
|
test for the loop condition. */
|
else
|
else
|
{
|
{
|
rtx rounded_size, rounded_size_op, test_addr, last_addr, temp;
|
rtx rounded_size, rounded_size_op, test_addr, last_addr, temp;
|
rtx loop_lab = gen_label_rtx ();
|
rtx loop_lab = gen_label_rtx ();
|
rtx end_lab = gen_label_rtx ();
|
rtx end_lab = gen_label_rtx ();
|
|
|
|
|
/* Step 1: round SIZE to the previous multiple of the interval. */
|
/* Step 1: round SIZE to the previous multiple of the interval. */
|
|
|
/* ROUNDED_SIZE = SIZE & -PROBE_INTERVAL */
|
/* ROUNDED_SIZE = SIZE & -PROBE_INTERVAL */
|
rounded_size
|
rounded_size
|
= simplify_gen_binary (AND, Pmode, size, GEN_INT (-PROBE_INTERVAL));
|
= simplify_gen_binary (AND, Pmode, size, GEN_INT (-PROBE_INTERVAL));
|
rounded_size_op = force_operand (rounded_size, NULL_RTX);
|
rounded_size_op = force_operand (rounded_size, NULL_RTX);
|
|
|
|
|
/* Step 2: compute initial and final value of the loop counter. */
|
/* Step 2: compute initial and final value of the loop counter. */
|
|
|
/* TEST_ADDR = SP + FIRST. */
|
/* TEST_ADDR = SP + FIRST. */
|
test_addr = force_operand (gen_rtx_fmt_ee (STACK_GROW_OP, Pmode,
|
test_addr = force_operand (gen_rtx_fmt_ee (STACK_GROW_OP, Pmode,
|
stack_pointer_rtx,
|
stack_pointer_rtx,
|
GEN_INT (first)), NULL_RTX);
|
GEN_INT (first)), NULL_RTX);
|
|
|
/* LAST_ADDR = SP + FIRST + ROUNDED_SIZE. */
|
/* LAST_ADDR = SP + FIRST + ROUNDED_SIZE. */
|
last_addr = force_operand (gen_rtx_fmt_ee (STACK_GROW_OP, Pmode,
|
last_addr = force_operand (gen_rtx_fmt_ee (STACK_GROW_OP, Pmode,
|
test_addr,
|
test_addr,
|
rounded_size_op), NULL_RTX);
|
rounded_size_op), NULL_RTX);
|
|
|
|
|
/* Step 3: the loop
|
/* Step 3: the loop
|
|
|
while (TEST_ADDR != LAST_ADDR)
|
while (TEST_ADDR != LAST_ADDR)
|
{
|
{
|
TEST_ADDR = TEST_ADDR + PROBE_INTERVAL
|
TEST_ADDR = TEST_ADDR + PROBE_INTERVAL
|
probe at TEST_ADDR
|
probe at TEST_ADDR
|
}
|
}
|
|
|
probes at FIRST + N * PROBE_INTERVAL for values of N from 1
|
probes at FIRST + N * PROBE_INTERVAL for values of N from 1
|
until it is equal to ROUNDED_SIZE. */
|
until it is equal to ROUNDED_SIZE. */
|
|
|
emit_label (loop_lab);
|
emit_label (loop_lab);
|
|
|
/* Jump to END_LAB if TEST_ADDR == LAST_ADDR. */
|
/* Jump to END_LAB if TEST_ADDR == LAST_ADDR. */
|
emit_cmp_and_jump_insns (test_addr, last_addr, EQ, NULL_RTX, Pmode, 1,
|
emit_cmp_and_jump_insns (test_addr, last_addr, EQ, NULL_RTX, Pmode, 1,
|
end_lab);
|
end_lab);
|
|
|
/* TEST_ADDR = TEST_ADDR + PROBE_INTERVAL. */
|
/* TEST_ADDR = TEST_ADDR + PROBE_INTERVAL. */
|
temp = expand_binop (Pmode, STACK_GROW_OPTAB, test_addr,
|
temp = expand_binop (Pmode, STACK_GROW_OPTAB, test_addr,
|
GEN_INT (PROBE_INTERVAL), test_addr,
|
GEN_INT (PROBE_INTERVAL), test_addr,
|
1, OPTAB_WIDEN);
|
1, OPTAB_WIDEN);
|
|
|
gcc_assert (temp == test_addr);
|
gcc_assert (temp == test_addr);
|
|
|
/* Probe at TEST_ADDR. */
|
/* Probe at TEST_ADDR. */
|
emit_stack_probe (test_addr);
|
emit_stack_probe (test_addr);
|
|
|
emit_jump (loop_lab);
|
emit_jump (loop_lab);
|
|
|
emit_label (end_lab);
|
emit_label (end_lab);
|
|
|
|
|
/* Step 4: probe at FIRST + SIZE if we cannot assert at compile-time
|
/* Step 4: probe at FIRST + SIZE if we cannot assert at compile-time
|
that SIZE is equal to ROUNDED_SIZE. */
|
that SIZE is equal to ROUNDED_SIZE. */
|
|
|
/* TEMP = SIZE - ROUNDED_SIZE. */
|
/* TEMP = SIZE - ROUNDED_SIZE. */
|
temp = simplify_gen_binary (MINUS, Pmode, size, rounded_size);
|
temp = simplify_gen_binary (MINUS, Pmode, size, rounded_size);
|
if (temp != const0_rtx)
|
if (temp != const0_rtx)
|
{
|
{
|
rtx addr;
|
rtx addr;
|
|
|
if (CONST_INT_P (temp))
|
if (CONST_INT_P (temp))
|
{
|
{
|
/* Use [base + disp} addressing mode if supported. */
|
/* Use [base + disp} addressing mode if supported. */
|
HOST_WIDE_INT offset = INTVAL (temp);
|
HOST_WIDE_INT offset = INTVAL (temp);
|
addr = memory_address (Pmode,
|
addr = memory_address (Pmode,
|
plus_constant (last_addr,
|
plus_constant (last_addr,
|
STACK_GROW_OFF (offset)));
|
STACK_GROW_OFF (offset)));
|
}
|
}
|
else
|
else
|
{
|
{
|
/* Manual CSE if the difference is not known at compile-time. */
|
/* Manual CSE if the difference is not known at compile-time. */
|
temp = gen_rtx_MINUS (Pmode, size, rounded_size_op);
|
temp = gen_rtx_MINUS (Pmode, size, rounded_size_op);
|
addr = memory_address (Pmode,
|
addr = memory_address (Pmode,
|
gen_rtx_fmt_ee (STACK_GROW_OP, Pmode,
|
gen_rtx_fmt_ee (STACK_GROW_OP, Pmode,
|
last_addr, temp));
|
last_addr, temp));
|
}
|
}
|
|
|
emit_stack_probe (addr);
|
emit_stack_probe (addr);
|
}
|
}
|
}
|
}
|
}
|
}
|
|
|
/* Adjust the stack pointer by minus SIZE (an rtx for a number of bytes)
|
/* Adjust the stack pointer by minus SIZE (an rtx for a number of bytes)
|
while probing it. This pushes when SIZE is positive. SIZE need not
|
while probing it. This pushes when SIZE is positive. SIZE need not
|
be constant. If ADJUST_BACK is true, adjust back the stack pointer
|
be constant. If ADJUST_BACK is true, adjust back the stack pointer
|
by plus SIZE at the end. */
|
by plus SIZE at the end. */
|
|
|
void
|
void
|
anti_adjust_stack_and_probe (rtx size, bool adjust_back)
|
anti_adjust_stack_and_probe (rtx size, bool adjust_back)
|
{
|
{
|
/* We skip the probe for the first interval + a small dope of 4 words and
|
/* We skip the probe for the first interval + a small dope of 4 words and
|
probe that many bytes past the specified size to maintain a protection
|
probe that many bytes past the specified size to maintain a protection
|
area at the botton of the stack. */
|
area at the botton of the stack. */
|
const int dope = 4 * UNITS_PER_WORD;
|
const int dope = 4 * UNITS_PER_WORD;
|
|
|
/* First ensure SIZE is Pmode. */
|
/* First ensure SIZE is Pmode. */
|
if (GET_MODE (size) != VOIDmode && GET_MODE (size) != Pmode)
|
if (GET_MODE (size) != VOIDmode && GET_MODE (size) != Pmode)
|
size = convert_to_mode (Pmode, size, 1);
|
size = convert_to_mode (Pmode, size, 1);
|
|
|
/* If we have a constant small number of probes to generate, that's the
|
/* If we have a constant small number of probes to generate, that's the
|
easy case. */
|
easy case. */
|
if (CONST_INT_P (size) && INTVAL (size) < 7 * PROBE_INTERVAL)
|
if (CONST_INT_P (size) && INTVAL (size) < 7 * PROBE_INTERVAL)
|
{
|
{
|
HOST_WIDE_INT isize = INTVAL (size), i;
|
HOST_WIDE_INT isize = INTVAL (size), i;
|
bool first_probe = true;
|
bool first_probe = true;
|
|
|
/* Adjust SP and probe at PROBE_INTERVAL + N * PROBE_INTERVAL for
|
/* Adjust SP and probe at PROBE_INTERVAL + N * PROBE_INTERVAL for
|
values of N from 1 until it exceeds SIZE. If only one probe is
|
values of N from 1 until it exceeds SIZE. If only one probe is
|
needed, this will not generate any code. Then adjust and probe
|
needed, this will not generate any code. Then adjust and probe
|
to PROBE_INTERVAL + SIZE. */
|
to PROBE_INTERVAL + SIZE. */
|
for (i = PROBE_INTERVAL; i < isize; i += PROBE_INTERVAL)
|
for (i = PROBE_INTERVAL; i < isize; i += PROBE_INTERVAL)
|
{
|
{
|
if (first_probe)
|
if (first_probe)
|
{
|
{
|
anti_adjust_stack (GEN_INT (2 * PROBE_INTERVAL + dope));
|
anti_adjust_stack (GEN_INT (2 * PROBE_INTERVAL + dope));
|
first_probe = false;
|
first_probe = false;
|
}
|
}
|
else
|
else
|
anti_adjust_stack (GEN_INT (PROBE_INTERVAL));
|
anti_adjust_stack (GEN_INT (PROBE_INTERVAL));
|
emit_stack_probe (stack_pointer_rtx);
|
emit_stack_probe (stack_pointer_rtx);
|
}
|
}
|
|
|
if (first_probe)
|
if (first_probe)
|
anti_adjust_stack (plus_constant (size, PROBE_INTERVAL + dope));
|
anti_adjust_stack (plus_constant (size, PROBE_INTERVAL + dope));
|
else
|
else
|
anti_adjust_stack (plus_constant (size, PROBE_INTERVAL - i));
|
anti_adjust_stack (plus_constant (size, PROBE_INTERVAL - i));
|
emit_stack_probe (stack_pointer_rtx);
|
emit_stack_probe (stack_pointer_rtx);
|
}
|
}
|
|
|
/* In the variable case, do the same as above, but in a loop. Note that we
|
/* In the variable case, do the same as above, but in a loop. Note that we
|
must be extra careful with variables wrapping around because we might be
|
must be extra careful with variables wrapping around because we might be
|
at the very top (or the very bottom) of the address space and we have to
|
at the very top (or the very bottom) of the address space and we have to
|
be able to handle this case properly; in particular, we use an equality
|
be able to handle this case properly; in particular, we use an equality
|
test for the loop condition. */
|
test for the loop condition. */
|
else
|
else
|
{
|
{
|
rtx rounded_size, rounded_size_op, last_addr, temp;
|
rtx rounded_size, rounded_size_op, last_addr, temp;
|
rtx loop_lab = gen_label_rtx ();
|
rtx loop_lab = gen_label_rtx ();
|
rtx end_lab = gen_label_rtx ();
|
rtx end_lab = gen_label_rtx ();
|
|
|
|
|
/* Step 1: round SIZE to the previous multiple of the interval. */
|
/* Step 1: round SIZE to the previous multiple of the interval. */
|
|
|
/* ROUNDED_SIZE = SIZE & -PROBE_INTERVAL */
|
/* ROUNDED_SIZE = SIZE & -PROBE_INTERVAL */
|
rounded_size
|
rounded_size
|
= simplify_gen_binary (AND, Pmode, size, GEN_INT (-PROBE_INTERVAL));
|
= simplify_gen_binary (AND, Pmode, size, GEN_INT (-PROBE_INTERVAL));
|
rounded_size_op = force_operand (rounded_size, NULL_RTX);
|
rounded_size_op = force_operand (rounded_size, NULL_RTX);
|
|
|
|
|
/* Step 2: compute initial and final value of the loop counter. */
|
/* Step 2: compute initial and final value of the loop counter. */
|
|
|
/* SP = SP_0 + PROBE_INTERVAL. */
|
/* SP = SP_0 + PROBE_INTERVAL. */
|
anti_adjust_stack (GEN_INT (PROBE_INTERVAL + dope));
|
anti_adjust_stack (GEN_INT (PROBE_INTERVAL + dope));
|
|
|
/* LAST_ADDR = SP_0 + PROBE_INTERVAL + ROUNDED_SIZE. */
|
/* LAST_ADDR = SP_0 + PROBE_INTERVAL + ROUNDED_SIZE. */
|
last_addr = force_operand (gen_rtx_fmt_ee (STACK_GROW_OP, Pmode,
|
last_addr = force_operand (gen_rtx_fmt_ee (STACK_GROW_OP, Pmode,
|
stack_pointer_rtx,
|
stack_pointer_rtx,
|
rounded_size_op), NULL_RTX);
|
rounded_size_op), NULL_RTX);
|
|
|
|
|
/* Step 3: the loop
|
/* Step 3: the loop
|
|
|
while (SP != LAST_ADDR)
|
while (SP != LAST_ADDR)
|
{
|
{
|
SP = SP + PROBE_INTERVAL
|
SP = SP + PROBE_INTERVAL
|
probe at SP
|
probe at SP
|
}
|
}
|
|
|
adjusts SP and probes at PROBE_INTERVAL + N * PROBE_INTERVAL for
|
adjusts SP and probes at PROBE_INTERVAL + N * PROBE_INTERVAL for
|
values of N from 1 until it is equal to ROUNDED_SIZE. */
|
values of N from 1 until it is equal to ROUNDED_SIZE. */
|
|
|
emit_label (loop_lab);
|
emit_label (loop_lab);
|
|
|
/* Jump to END_LAB if SP == LAST_ADDR. */
|
/* Jump to END_LAB if SP == LAST_ADDR. */
|
emit_cmp_and_jump_insns (stack_pointer_rtx, last_addr, EQ, NULL_RTX,
|
emit_cmp_and_jump_insns (stack_pointer_rtx, last_addr, EQ, NULL_RTX,
|
Pmode, 1, end_lab);
|
Pmode, 1, end_lab);
|
|
|
/* SP = SP + PROBE_INTERVAL and probe at SP. */
|
/* SP = SP + PROBE_INTERVAL and probe at SP. */
|
anti_adjust_stack (GEN_INT (PROBE_INTERVAL));
|
anti_adjust_stack (GEN_INT (PROBE_INTERVAL));
|
emit_stack_probe (stack_pointer_rtx);
|
emit_stack_probe (stack_pointer_rtx);
|
|
|
emit_jump (loop_lab);
|
emit_jump (loop_lab);
|
|
|
emit_label (end_lab);
|
emit_label (end_lab);
|
|
|
|
|
/* Step 4: adjust SP and probe at PROBE_INTERVAL + SIZE if we cannot
|
/* Step 4: adjust SP and probe at PROBE_INTERVAL + SIZE if we cannot
|
assert at compile-time that SIZE is equal to ROUNDED_SIZE. */
|
assert at compile-time that SIZE is equal to ROUNDED_SIZE. */
|
|
|
/* TEMP = SIZE - ROUNDED_SIZE. */
|
/* TEMP = SIZE - ROUNDED_SIZE. */
|
temp = simplify_gen_binary (MINUS, Pmode, size, rounded_size);
|
temp = simplify_gen_binary (MINUS, Pmode, size, rounded_size);
|
if (temp != const0_rtx)
|
if (temp != const0_rtx)
|
{
|
{
|
/* Manual CSE if the difference is not known at compile-time. */
|
/* Manual CSE if the difference is not known at compile-time. */
|
if (GET_CODE (temp) != CONST_INT)
|
if (GET_CODE (temp) != CONST_INT)
|
temp = gen_rtx_MINUS (Pmode, size, rounded_size_op);
|
temp = gen_rtx_MINUS (Pmode, size, rounded_size_op);
|
anti_adjust_stack (temp);
|
anti_adjust_stack (temp);
|
emit_stack_probe (stack_pointer_rtx);
|
emit_stack_probe (stack_pointer_rtx);
|
}
|
}
|
}
|
}
|
|
|
/* Adjust back and account for the additional first interval. */
|
/* Adjust back and account for the additional first interval. */
|
if (adjust_back)
|
if (adjust_back)
|
adjust_stack (plus_constant (size, PROBE_INTERVAL + dope));
|
adjust_stack (plus_constant (size, PROBE_INTERVAL + dope));
|
else
|
else
|
adjust_stack (GEN_INT (PROBE_INTERVAL + dope));
|
adjust_stack (GEN_INT (PROBE_INTERVAL + dope));
|
}
|
}
|
|
|
/* Return an rtx representing the register or memory location
|
/* Return an rtx representing the register or memory location
|
in which a scalar value of data type VALTYPE
|
in which a scalar value of data type VALTYPE
|
was returned by a function call to function FUNC.
|
was returned by a function call to function FUNC.
|
FUNC is a FUNCTION_DECL, FNTYPE a FUNCTION_TYPE node if the precise
|
FUNC is a FUNCTION_DECL, FNTYPE a FUNCTION_TYPE node if the precise
|
function is known, otherwise 0.
|
function is known, otherwise 0.
|
OUTGOING is 1 if on a machine with register windows this function
|
OUTGOING is 1 if on a machine with register windows this function
|
should return the register in which the function will put its result
|
should return the register in which the function will put its result
|
and 0 otherwise. */
|
and 0 otherwise. */
|
|
|
rtx
|
rtx
|
hard_function_value (const_tree valtype, const_tree func, const_tree fntype,
|
hard_function_value (const_tree valtype, const_tree func, const_tree fntype,
|
int outgoing ATTRIBUTE_UNUSED)
|
int outgoing ATTRIBUTE_UNUSED)
|
{
|
{
|
rtx val;
|
rtx val;
|
|
|
val = targetm.calls.function_value (valtype, func ? func : fntype, outgoing);
|
val = targetm.calls.function_value (valtype, func ? func : fntype, outgoing);
|
|
|
if (REG_P (val)
|
if (REG_P (val)
|
&& GET_MODE (val) == BLKmode)
|
&& GET_MODE (val) == BLKmode)
|
{
|
{
|
unsigned HOST_WIDE_INT bytes = int_size_in_bytes (valtype);
|
unsigned HOST_WIDE_INT bytes = int_size_in_bytes (valtype);
|
enum machine_mode tmpmode;
|
enum machine_mode tmpmode;
|
|
|
/* int_size_in_bytes can return -1. We don't need a check here
|
/* int_size_in_bytes can return -1. We don't need a check here
|
since the value of bytes will then be large enough that no
|
since the value of bytes will then be large enough that no
|
mode will match anyway. */
|
mode will match anyway. */
|
|
|
for (tmpmode = GET_CLASS_NARROWEST_MODE (MODE_INT);
|
for (tmpmode = GET_CLASS_NARROWEST_MODE (MODE_INT);
|
tmpmode != VOIDmode;
|
tmpmode != VOIDmode;
|
tmpmode = GET_MODE_WIDER_MODE (tmpmode))
|
tmpmode = GET_MODE_WIDER_MODE (tmpmode))
|
{
|
{
|
/* Have we found a large enough mode? */
|
/* Have we found a large enough mode? */
|
if (GET_MODE_SIZE (tmpmode) >= bytes)
|
if (GET_MODE_SIZE (tmpmode) >= bytes)
|
break;
|
break;
|
}
|
}
|
|
|
/* No suitable mode found. */
|
/* No suitable mode found. */
|
gcc_assert (tmpmode != VOIDmode);
|
gcc_assert (tmpmode != VOIDmode);
|
|
|
PUT_MODE (val, tmpmode);
|
PUT_MODE (val, tmpmode);
|
}
|
}
|
return val;
|
return val;
|
}
|
}
|
|
|
/* Return an rtx representing the register or memory location
|
/* Return an rtx representing the register or memory location
|
in which a scalar value of mode MODE was returned by a library call. */
|
in which a scalar value of mode MODE was returned by a library call. */
|
|
|
rtx
|
rtx
|
hard_libcall_value (enum machine_mode mode, rtx fun)
|
hard_libcall_value (enum machine_mode mode, rtx fun)
|
{
|
{
|
return targetm.calls.libcall_value (mode, fun);
|
return targetm.calls.libcall_value (mode, fun);
|
}
|
}
|
|
|
/* Look up the tree code for a given rtx code
|
/* Look up the tree code for a given rtx code
|
to provide the arithmetic operation for REAL_ARITHMETIC.
|
to provide the arithmetic operation for REAL_ARITHMETIC.
|
The function returns an int because the caller may not know
|
The function returns an int because the caller may not know
|
what `enum tree_code' means. */
|
what `enum tree_code' means. */
|
|
|
int
|
int
|
rtx_to_tree_code (enum rtx_code code)
|
rtx_to_tree_code (enum rtx_code code)
|
{
|
{
|
enum tree_code tcode;
|
enum tree_code tcode;
|
|
|
switch (code)
|
switch (code)
|
{
|
{
|
case PLUS:
|
case PLUS:
|
tcode = PLUS_EXPR;
|
tcode = PLUS_EXPR;
|
break;
|
break;
|
case MINUS:
|
case MINUS:
|
tcode = MINUS_EXPR;
|
tcode = MINUS_EXPR;
|
break;
|
break;
|
case MULT:
|
case MULT:
|
tcode = MULT_EXPR;
|
tcode = MULT_EXPR;
|
break;
|
break;
|
case DIV:
|
case DIV:
|
tcode = RDIV_EXPR;
|
tcode = RDIV_EXPR;
|
break;
|
break;
|
case SMIN:
|
case SMIN:
|
tcode = MIN_EXPR;
|
tcode = MIN_EXPR;
|
break;
|
break;
|
case SMAX:
|
case SMAX:
|
tcode = MAX_EXPR;
|
tcode = MAX_EXPR;
|
break;
|
break;
|
default:
|
default:
|
tcode = LAST_AND_UNUSED_TREE_CODE;
|
tcode = LAST_AND_UNUSED_TREE_CODE;
|
break;
|
break;
|
}
|
}
|
return ((int) tcode);
|
return ((int) tcode);
|
}
|
}
|
|
|
#include "gt-explow.h"
|
#include "gt-explow.h"
|
|
|
