68d3ff9044
Fix pr42644. Fix pr42130 (dealII). 2010-03-03 Tobias Grosser <grosser@fim.uni-passau.de> * gcc/graphite-clast-to-gimple.c (clast_to_gcc_expression): Also handle conversions from pointer to integers. (gcc_type_for_cloog_iv): Choose the smalles signed integer as an induction variable, to be able to work with code generated by CLooG. * gcc/graphite-sese-to-poly.c (scop_ivs_can_be_represented): New. (build_poly_scop): Bail out if we cannot codegen a loop. * gcc/testsuite/gcc.dg/graphite/id-18.c: New. * gcc/testsuite/gcc.dg/graphite/run-id-pr42644.c: New. * libgomp/testsuite/libgomp.graphite/force-parallel-1.c: Adjust. * libgomp/testsuite/libgomp.graphite/force-parallel-2.c: Adjust. From-SVN: r157286
31 lines
690 B
C
31 lines
690 B
C
void abort (void);
|
|
|
|
void parloop (int N)
|
|
{
|
|
int i, j;
|
|
int x[500][500];
|
|
|
|
for (i = 0; i < N; i++)
|
|
for (j = 0; j < N; j++)
|
|
x[i][j] = i + j + 3;
|
|
|
|
for (i = 0; i < N; i++)
|
|
for (j = 0; j < N; j++)
|
|
if (x[i][j] != i + j + 3)
|
|
abort ();
|
|
}
|
|
|
|
int main(void)
|
|
{
|
|
parloop(500);
|
|
|
|
return 0;
|
|
}
|
|
|
|
/* Check that parallel code generation part make the right answer. */
|
|
/* { dg-final { scan-tree-dump-times "2 loops carried no dependency" 1 "graphite" } } */
|
|
/* { dg-final { cleanup-tree-dump "graphite" } } */
|
|
/* { dg-final { scan-tree-dump-times "loopfn" 5 "optimized" } } */
|
|
/* { dg-final { cleanup-tree-dump "parloops" } } */
|
|
/* { dg-final { cleanup-tree-dump "optimized" } } */
|