OpenE2K
/
gcc
2
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

Improve address offset range computation 

From-SVN: r163081
This commit is contained in:
Xinliang David Li 2010-08-10 23:26:05 +00:00
parent 9995f20912
commit d6fa2d17d4
4 changed files with 35 additions and 20 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

5
gcc/ChangeLog
View File

@ -1,3 +1,8 @@
2010-08-10 Xinliang David Li <davidxl@google.com>
* tree-ssa-loop-ivopts.c (get_address_cost): Properly
compute max/min offset in address.
2010-08-10 Vladimir Makarov <vmakarov@redhat.com>
* ira-live.c: Include sbitmap.h.

4
gcc/testsuite/ChangeLog
View File

@ -1,3 +1,7 @@
2010-08-10 xinliang David Li <davidxl@google.com>
* gcc.dg/tree-ssa/loop-19.c: Add option
-fno-prefetch-loop-array
2010-08-10 Bernd Schmidt <bernds@codesourcery.com>
PR middle-end/45182

2
gcc/testsuite/gcc.dg/tree-ssa/loop-19.c
View File

@ -6,7 +6,7 @@
/* { dg-do compile { target { i?86-*-* || { x86_64-*-* || powerpc_hard_double } } } } */
/* { dg-require-effective-target nonpic } */
/* { dg-options "-O3 -fdump-tree-optimized" } */
/* { dg-options "-O3 -fno-prefetch-loop-arrays -fdump-tree-optimized" } */
# define N 2000000
static double a[N],c[N];

44
gcc/tree-ssa-loop-ivopts.c
View File

@ -3241,9 +3241,8 @@ get_address_cost (bool symbol_present, bool var_present,
if (!data)
{
HOST_WIDE_INT i;
HOST_WIDE_INT start = BIGGEST_ALIGNMENT / BITS_PER_UNIT;
HOST_WIDE_INT rat, off;
int old_cse_not_expected;
HOST_WIDE_INT rat, off = 0;
int old_cse_not_expected, width;
unsigned sym_p, var_p, off_p, rat_p, add_c;
rtx seq, addr, base;
rtx reg0, reg1;
@ -3252,33 +3251,40 @@ get_address_cost (bool symbol_present, bool var_present,
reg1 = gen_raw_REG (address_mode, LAST_VIRTUAL_REGISTER + 1);
width = GET_MODE_BITSIZE (address_mode) - 1;
if (width > (HOST_BITS_PER_WIDE_INT - 1))
width = HOST_BITS_PER_WIDE_INT - 1;
addr = gen_rtx_fmt_ee (PLUS, address_mode, reg1, NULL_RTX);
for (i = start; i <= 1 << 20; i <<= 1)
{
XEXP (addr, 1) = gen_int_mode (i, address_mode);
if (!memory_address_addr_space_p (mem_mode, addr, as))
break;
}
data->max_offset = i == start ? 0 : i >> 1;
off = data->max_offset;
for (i = start; i <= 1 << 20; i <<= 1)
for (i = width; i >= 0; i--)
{
XEXP (addr, 1) = gen_int_mode (-i, address_mode);
if (!memory_address_addr_space_p (mem_mode, addr, as))
off = -((HOST_WIDE_INT) 1 << i);
XEXP (addr, 1) = gen_int_mode (off, address_mode);
if (memory_address_addr_space_p (mem_mode, addr, as))
break;
}
data->min_offset = i == start ? 0 : -(i >> 1);
data->min_offset = (i == -1? 0 : off);
for (i = width; i >= 0; i--)
{
off = ((HOST_WIDE_INT) 1 << i) - 1;
XEXP (addr, 1) = gen_int_mode (off, address_mode);
if (memory_address_addr_space_p (mem_mode, addr, as))
break;
}
if (i == -1)
off = 0;
data->max_offset = off;
if (dump_file && (dump_flags & TDF_DETAILS))
{
fprintf (dump_file, "get_address_cost:\n");
fprintf (dump_file, " min offset %s %d\n",
fprintf (dump_file, " min offset %s " HOST_WIDE_INT_PRINT_DEC "\n",
GET_MODE_NAME (mem_mode),
(int) data->min_offset);
fprintf (dump_file, " max offset %s %d\n",
data->min_offset);
fprintf (dump_file, " max offset %s " HOST_WIDE_INT_PRINT_DEC "\n",
GET_MODE_NAME (mem_mode),
(int) data->max_offset);
data->max_offset);
}
rat = 1;