/* { dg-options "-O2 -fgraphite-identity -fdump-tree-graphite-all" } */
|
/* { dg-options "-O2 -fgraphite-identity -fdump-tree-graphite-all" } */
|
|
|
int a[100];
|
int a[100];
|
|
|
int
|
int
|
foo (int bar, int n, int k)
|
foo (int bar, int n, int k)
|
{
|
{
|
int i;
|
int i;
|
|
|
for (i = 0; i < n; i++)
|
for (i = 0; i < n; i++)
|
if (i == k)
|
if (i == k)
|
a[i] = 1;
|
a[i] = 1;
|
else
|
else
|
a[i] = i;
|
a[i] = i;
|
|
|
return a[bar];
|
return a[bar];
|
}
|
}
|
|
|
/* We should generate the following:
|
/* We should generate the following:
|
|
|
| for (i = 0; i < min (n, k); i++)
|
| for (i = 0; i < min (n, k); i++)
|
| a[i] = i;
|
| a[i] = i;
|
| if (k >= 0 && k < n)
|
| if (k >= 0 && k < n)
|
| a[k] = 1;
|
| a[k] = 1;
|
| for (i = max(k+1,0); i < n; i++)
|
| for (i = max(k+1,0); i < n; i++)
|
| a[i] = i;
|
| a[i] = i;
|
|
|
XXX: At the moment we generate to protect loops that are executed zero times.
|
XXX: At the moment we generate to protect loops that are executed zero times.
|
|
|
| if (0 < min (n, k) + 1)
|
| if (0 < min (n, k) + 1)
|
| for (i = 0; i < min (n, k); i++)
|
| for (i = 0; i < min (n, k); i++)
|
| a[i] = i;
|
| a[i] = i;
|
| if (k >= 0 && k < n)
|
| if (k >= 0 && k < n)
|
| a[k] = 1;
|
| a[k] = 1;
|
| if (0 < max(n, k) + 1)
|
| if (0 < max(n, k) + 1)
|
| for (i = max(k+1,0); i < n; i++)
|
| for (i = max(k+1,0); i < n; i++)
|
| a[i] = i;
|
| a[i] = i;
|
|
|
*/
|
*/
|
|
|
|
|
/* { dg-final { scan-tree-dump-times "MIN_EXPR" 2 "graphite" } } */
|
/* { dg-final { scan-tree-dump-times "MIN_EXPR" 2 "graphite" } } */
|
/* { dg-final { scan-tree-dump-times "MAX_EXPR" 2 "graphite" } } */
|
/* { dg-final { scan-tree-dump-times "MAX_EXPR" 2 "graphite" } } */
|
/* { dg-final { cleanup-tree-dump "graphite" } } */
|
/* { dg-final { cleanup-tree-dump "graphite" } } */
|
|
|