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-require-effective-target size32plus } */
|
/* { dg-require-effective-target size32plus } */
|
|
|
int foo(int *p, int n)
|
int foo(int *p, int n)
|
{
|
{
|
int i, j, k = 0;
|
int i, j, k = 0;
|
|
|
/* This is a reduction: there is a scalar dependence that cannot be
|
/* This is a reduction: there is a scalar dependence that cannot be
|
removed by rewriting IVs. This code cannot and should not be
|
removed by rewriting IVs. This code cannot and should not be
|
transformed into a perfect loop. */
|
transformed into a perfect loop. */
|
for (i = 0; i < 2; ++i, p += n)
|
for (i = 0; i < 2; ++i, p += n)
|
for (j = 0; j < 2; ++j)
|
for (j = 0; j < 2; ++j)
|
k += p[j];
|
k += p[j];
|
|
|
return k;
|
return k;
|
}
|
}
|
|
|
/* { dg-final { scan-tree-dump-times "converted loop nest to perfect loop nest" 0 "ltrans"} } */
|
/* { dg-final { scan-tree-dump-times "converted loop nest to perfect loop nest" 0 "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.