URL
https://opencores.org/ocsvn/openrisc_2011-10-31/openrisc_2011-10-31/trunk
Only display areas with differences |
Details |
Blame |
View Log
| Rev 298 |
Rev 384 |
/* { dg-do compile } */
|
/* { dg-do compile } */
|
/* { dg-options "-O2 -ftree-loop-linear -fdump-tree-ltrans-all" } */
|
/* { dg-options "-O2 -ftree-loop-linear -fdump-tree-ltrans-all" } */
|
/* { dg-options "-O2 -ftree-loop-linear -fdump-tree-ltrans-all -march=i486" { target { i?86-*-* && ilp32} } } */
|
/* { dg-options "-O2 -ftree-loop-linear -fdump-tree-ltrans-all -march=i486" { target { i?86-*-* && ilp32} } } */
|
/* { dg-require-effective-target size32plus } */
|
/* { dg-require-effective-target size32plus } */
|
|
|
double u[1782225];
|
double u[1782225];
|
int foo(int N, int *res)
|
int foo(int N, int *res)
|
{
|
{
|
int i, j;
|
int i, j;
|
double sum = 0.0;
|
double sum = 0.0;
|
/* This loop should be converted to a perfect nest and
|
/* This loop should be converted to a perfect nest and
|
interchanged. */
|
interchanged. */
|
for (i = 0; i < N; i++)
|
for (i = 0; i < N; i++)
|
{
|
{
|
for (j = 0; j < N; j++)
|
for (j = 0; j < N; j++)
|
sum = sum + u[i + 1335 * j];
|
sum = sum + u[i + 1335 * j];
|
|
|
u[1336 * i] *= 2;
|
u[1336 * i] *= 2;
|
}
|
}
|
*res = sum + N;
|
*res = sum + N;
|
}
|
}
|
/* { dg-final { scan-tree-dump-times "converted loop nest to perfect loop nest" 1 "ltrans"} } */
|
/* { dg-final { scan-tree-dump-times "converted loop nest to perfect loop nest" 1 "ltrans"} } */
|
/* { dg-final { scan-tree-dump-times "transformed loop" 1 "ltrans"} } */
|
/* { dg-final { scan-tree-dump-times "transformed loop" 1 "ltrans"} } */
|
/* { dg-final { cleanup-tree-dump "ltrans" } } */
|
/* { dg-final { cleanup-tree-dump "ltrans" } } */
|
|
|
© copyright 1999-2024
OpenCores.org, equivalent to Oliscience, all rights reserved. OpenCores®, registered trademark.