Retro68/gcc/libgomp/testsuite/libgomp.graphite/force-parallel-8.c

54 lines
1.1 KiB
C
Raw Normal View History

2012-03-27 23:13:14 +00:00
#define N 1500
int x[N][N], y[N];
2014-09-21 17:33:12 +00:00
void abort (void);
2012-03-27 23:13:14 +00:00
int foo(void)
{
int i, j;
2014-09-21 17:33:12 +00:00
for (i = 0; i < N; i++)
y[i] = i;
for (i = 0; i < N; i++)
for (j = 0; j < N; j++)
x[i][j] = i + j;
2012-03-27 23:13:14 +00:00
for (i = 0; i < N; i++)
{
y[i] = i;
for (j = 0; j < N; j++)
{
if (j > 500)
{
x[i][j] = i + j + 3;
y[j] = i*j + 10;
}
else
x[i][j] = x[i][j]*3;
}
}
return x[2][5]*y[8];
}
int main(void)
{
2014-09-21 17:33:12 +00:00
if (168 != foo())
abort ();
2012-03-27 23:13:14 +00:00
return 0;
}
/* Check that parallel code generation part make the right answer. */
2014-09-21 17:33:12 +00:00
/* { dg-final { scan-tree-dump-times "1 loops carried no dependency" 1 "graphite" } } */
/* { dg-final { scan-tree-dump-times "3 loops carried no dependency" 1 "graphite" } } */
/* { dg-final { scan-tree-dump-times "5 loops carried no dependency" 1 "graphite" } } */
2012-03-27 23:13:14 +00:00
/* { dg-final { cleanup-tree-dump "graphite" } } */
2014-09-21 17:33:12 +00:00
/* { dg-final { scan-tree-dump-times "loopfn.0" 4 "optimized" } } */
/* { dg-final { scan-tree-dump-times "loopfn.1" 4 "optimized" } } */
2012-03-27 23:13:14 +00:00
/* { dg-final { cleanup-tree-dump "parloops" } } */
/* { dg-final { cleanup-tree-dump "optimized" } } */