diff options
| author | Joern Rennecke <joern.rennecke@embecosm.com> | 2012-11-06 05:01:47 +0000 |
|---|---|---|
| committer | Joern Rennecke <amylaar@gcc.gnu.org> | 2012-11-06 05:01:47 +0000 |
| commit | 2266617f0e641aaa3bffbeda3af200adaf9fc8d2 (patch) | |
| tree | f0a04f222e2f46b642413467003f32e7e133edac /gcc/config | |
| parent | 3649b9b791c54f35a8bfb5540711dc4112acce7d (diff) | |
| download | gcc-2266617f0e641aaa3bffbeda3af200adaf9fc8d2.zip gcc-2266617f0e641aaa3bffbeda3af200adaf9fc8d2.tar.gz gcc-2266617f0e641aaa3bffbeda3af200adaf9fc8d2.tar.bz2 | |
epiphany.c (epiphany_address_cost): Use MODE parameter.
* config/epiphany/epiphany.c (epiphany_address_cost):
Use MODE parameter.
From-SVN: r193205
Diffstat (limited to 'gcc/config')
| -rw-r--r-- | gcc/config/epiphany/epiphany.c | 29 |
1 files changed, 19 insertions, 10 deletions
diff --git a/gcc/config/epiphany/epiphany.c b/gcc/config/epiphany/epiphany.c index 65bb1c8..0b3e27a 100644 --- a/gcc/config/epiphany/epiphany.c +++ b/gcc/config/epiphany/epiphany.c @@ -729,7 +729,7 @@ epiphany_rtx_costs (rtx x, int code, int outer_code, int opno ATTRIBUTE_UNUSED, If ADDR is not a valid address, its cost is irrelevant. */ static int -epiphany_address_cost (rtx addr, enum machine_mode mode ATTRIBUTE_UNUSED, +epiphany_address_cost (rtx addr, enum machine_mode mode, addr_space_t as ATTRIBUTE_UNUSED, bool speed) { rtx reg; @@ -761,19 +761,28 @@ epiphany_address_cost (rtx addr, enum machine_mode mode ATTRIBUTE_UNUSED, } if (!satisfies_constraint_Rgs (reg)) return 1; - /* ??? We don't know the mode of the memory access. We are going to assume - SImode, unless lack of offset alignment indicates a smaller access. */ + /* The offset range available for short instructions depends on the mode + of the memory access. */ /* First, make sure we have a valid integer. */ if (!satisfies_constraint_L (off)) return 1; i = INTVAL (off); - if ((i & 1) == 0) - i >>= 1; - if ((i & 1) == 0) - i >>= 1; - if (i < -7 || i > 7) - return 1; - return 0; + switch (GET_MODE_SIZE (mode)) + { + default: + case 4: + if (i & 1) + return 1; + i >>= 1; + /* Fall through. */ + case 2: + if (i & 1) + return 1; + i >>= 1; + /* Fall through. */ + case 1: + return i < -7 || i > 7; + } } /* Compute the cost of moving data between registers and memory. |