2010-02-07 Sebastian Pop <sebastian.pop@amd.com>
* gcc.dg/graphite/block-0.c: Call abort for runtime test. Always
return 0 from main.
* gcc.dg/graphite/block-1.c: Same.
* gcc.dg/graphite/block-3.c: Same.
* gcc.dg/graphite/block-4.c: Same.
* gcc.dg/graphite/block-5.c: Same.
* gcc.dg/graphite/block-6.c: Same.
* gcc.dg/graphite/block-7.c: Same.
* gcc.dg/graphite/interchange-0.c: Same.
* gcc.dg/graphite/interchange-1.c: Same.
* gcc.dg/graphite/interchange-10.c: Same.
* gcc.dg/graphite/interchange-11.c: Same.
* gcc.dg/graphite/interchange-12.c: Same.
* gcc.dg/graphite/interchange-2.c: Same.
* gcc.dg/graphite/interchange-3.c: Same.
* gcc.dg/graphite/interchange-4.c: Same.
* gcc.dg/graphite/interchange-5.c: Same.
* gcc.dg/graphite/interchange-6.c: Same.
* gcc.dg/graphite/interchange-7.c: Same.
* gcc.dg/graphite/interchange-8.c: Same.
* gcc.dg/graphite/interchange-9.c: Same.
* gcc.dg/graphite/interchange-mvt.c: Same.
git-svn-id: svn+ssh://gcc.gnu.org/svn/gcc/trunk@156584
138bc75d-0d04-0410-961f-
82ee72b054a4
2010-02-07 Sebastian Pop <sebastian.pop@amd.com>
+ * gcc.dg/graphite/block-0.c: Call abort for runtime test. Always
+ return 0 from main.
+ * gcc.dg/graphite/block-1.c: Same.
+ * gcc.dg/graphite/block-3.c: Same.
+ * gcc.dg/graphite/block-4.c: Same.
+ * gcc.dg/graphite/block-5.c: Same.
+ * gcc.dg/graphite/block-6.c: Same.
+ * gcc.dg/graphite/block-7.c: Same.
+ * gcc.dg/graphite/interchange-0.c: Same.
+ * gcc.dg/graphite/interchange-1.c: Same.
+ * gcc.dg/graphite/interchange-10.c: Same.
+ * gcc.dg/graphite/interchange-11.c: Same.
+ * gcc.dg/graphite/interchange-12.c: Same.
+ * gcc.dg/graphite/interchange-2.c: Same.
+ * gcc.dg/graphite/interchange-3.c: Same.
+ * gcc.dg/graphite/interchange-4.c: Same.
+ * gcc.dg/graphite/interchange-5.c: Same.
+ * gcc.dg/graphite/interchange-6.c: Same.
+ * gcc.dg/graphite/interchange-7.c: Same.
+ * gcc.dg/graphite/interchange-8.c: Same.
+ * gcc.dg/graphite/interchange-9.c: Same.
+ * gcc.dg/graphite/interchange-mvt.c: Same.
+
+2010-02-07 Sebastian Pop <sebastian.pop@amd.com>
+
* gfortran.dg/graphite/id-19.f: New.
* gfortran.dg/graphite/pr14741.f90: New.
* gfortran.dg/graphite/pr41924.f90: New.
return a[0];
}
-main()
+extern void abort ();
+
+int
+main (void)
{
int i, res;
fprintf (stderr, "res = %d \n", res);
#endif
- return res != 1999;
+ if (res != 1999)
+ abort ();
+
+ return 0;
}
/* { dg-final { scan-tree-dump-times "will be loop blocked" 1 "graphite" { xfail *-*-* } } } */
#define MAX 100
-int main()
+extern void abort ();
+
+int
+main (void)
{
int i, j;
int sum = 0;
fprintf (stderr, "sum = %d \n", sum);
#endif
- return sum != 990000;
+ if (sum != 990000)
+ abort ();
+
+ return 0;
}
/* { dg-final { scan-tree-dump-times "will be loop blocked" 2 "graphite" { xfail *-*-* } } } */
return A[0][0][0] + A[M-1][M-1][M-1];
}
+extern void abort ();
+
int
main (void)
{
fprintf (stderr, "res = %d \n", res);
#endif
- return res != 9801;
+ if (res != 9801)
+ abort ();
+
+ return 0;
}
/* { dg-final { scan-tree-dump-times "will be loop blocked" 1 "graphite" } } */
return A[0][0] + A[M-1][M-1];
}
+extern void abort ();
+
int
main (void)
{
fprintf (stderr, "res = %d \n", res);
#endif
- return res != 998001;
+ if (res != 998001)
+ abort ();
+
+ return 0;
}
/* { dg-final { scan-tree-dump-times "will be loop blocked" 1 "graphite" { xfail *-*-* } } } */
return res;
}
+extern void abort ();
+
int
main (void)
{
fprintf (stderr, "res = %d \n", res);
#endif
- return res != 1333300;
+ if (res != 1333300)
+ abort ();
+
+ return 0;
}
/* { dg-final { scan-tree-dump-times "will be loop blocked" 1 "graphite" } } */
return res;
}
+extern void abort ();
+
int
main (void)
{
fprintf (stderr, "res = %d \n", res);
#endif
- return res != 204007516;
+ if (res != 204007516)
+ abort ();
+
+ return 0;
}
/* { dg-final { scan-tree-dump-times "will be loop blocked" 0 "graphite" } } */
}
}
+extern void abort ();
+
int
main (void)
{
fprintf (stderr, "res = %d \n", res);
#endif
- return res != 529340000;
+ if (res != 529340000)
+ abort ();
+
+ return 0;
}
/* { dg-final { scan-tree-dump-times "will be loop blocked" 1 "graphite" { xfail *-*-* } } } */
return a[N-1][N-1];
}
+extern void abort ();
+
int
main (void)
{
fprintf (stderr, "res = %d \n", res);
#endif
- return res != 13;
+ if (res != 13)
+ abort ();
+
+ return 0;
}
/* { dg-final { scan-tree-dump-times "will be interchanged" 1 "graphite" } } */
return sum + N + u[1336 * 2] + u[1336];
}
+extern void abort ();
+
int
main (void)
{
fprintf (stderr, "res = %d \n", res);
#endif
- return res != 3565793;
+ if (res != 3565793)
+ abort ();
+
+ return 0;
}
*res = sum + N + u[1336 * 2] + u[1336];
}
+extern void abort ();
+
int
main (void)
{
fprintf (stderr, "res = %d \n", res);
#endif
- return res != 7130239;
+ if (res != 7130239)
+ abort ();
+
+ return 0;
}
/* { dg-final { scan-tree-dump-times "will be interchanged" 2 "graphite" } } */
*res = sum;
}
+extern void abort ();
+
int
main (void)
{
fprintf (stderr, "res = %d \n", res);
#endif
- return res != 3564450;
+ if (res != 3564450)
+ abort ();
+
+ return 0;
}
/* { dg-final { scan-tree-dump-times "will be interchanged" 1 "graphite" { xfail *-*-* } } } */
return A[0][0] + A[N-1][N-1];
}
+extern void abort ();
+
int
main (void)
{
fprintf (stderr, "res = %d \n", res);
#endif
- return res != 2626800;
+ if (res != 2626800)
+ abort ();
+
+ return 0;
}
/* { dg-final { scan-tree-dump-times "will be interchanged" 1 "graphite" { xfail *-*-* } } } */
*res = sum + N + u[1336 * 2] + u[1336];
}
+extern void abort ();
+
int
main (void)
{
fprintf (stderr, "res = %d \n", res);
#endif
- return res != 3565793;
+ if (res != 3565793)
+ abort ();
+
+ return 0;
}
/* { dg-final { scan-tree-dump-times "will be interchanged" 1 "graphite" { xfail *-*-* } } } */
*res = sum + N + u[1336 * 2] + u[1336];
}
+extern void abort ();
+
int
main (void)
{
fprintf (stderr, "res = %d \n", res);
#endif
- return res != 3565789;
+ if (res != 3565789)
+ abort ();
+
+ return 0;
}
/* { dg-final { scan-tree-dump-times "will be interchanged" 1 "graphite" } } */
*res = sum + N + u[1336 * 2] + u[1336];
}
+extern void abort ();
+
int
main (void)
{
fprintf (stderr, "res = %d \n", res);
#endif
- return res != 3565793;
+ if (res != 3565793)
+ abort ();
+
+ return 0;
}
/* { dg-final { scan-tree-dump-times "will be interchanged" 1 "graphite" } } */
return A[0][0] + A[N-1][M-1];
}
+extern void abort ();
+
int
main (void)
{
fprintf (stderr, "res = %d \n", res);
#endif
- return res != 20;
+ if (res != 20)
+ abort ();
+
+ return 0;
}
/* { dg-final { scan-tree-dump-times "will be interchanged" 1 "graphite" } } */
return A[0][0] + A[N-1][M-1];
}
+extern void abort ();
+
int
main (void)
{
fprintf (stderr, "res = %d \n", res);
#endif
- return res != 8;
+ if (res != 8)
+ abort ();
+
+ return 0;
}
/* { dg-final { scan-tree-dump-times "will be interchanged" 1 "graphite" } } */
return r;
}
+extern void abort ();
+
int
main (void)
{
fprintf (stderr, "res = %d \n", res);
#endif
- return res != 246642;
+ if (res != 246642)
+ abort ();
+
+ return 0;
}
/* { dg-final { scan-tree-dump-times "will be interchanged" 1 "graphite" } } */
return A[0][1][0][2] + A[0][3][0][3] + A[0][2][0][2] + A[0][1][0][1] + A[3][3][0][2];
}
+extern void abort ();
+
int
main (void)
{
fprintf (stderr, "res = %d \n", res);
#endif
- return res != 424;
+ if (res != 424)
+ abort ();
+
+ return 0;
}
/* Loops K and L should be interchanged. */
return sum;
}
+extern void abort ();
+
int
main (void)
{
fprintf (stderr, "res = %d \n", res);
#endif
- return res != 2468642;
+ if (res != 2468642)
+ abort ();
+
+ return 0;
}
/* { dg-final { scan-tree-dump-times "will be interchanged" 1 "graphite" } } */
return x1[0] + x2[0];
}
+extern void abort ();
+
int
main (void)
{
fprintf (stderr, "res = %d \n", res);
#endif
- return res != 199900000;
+ if (res != 199900000)
+ abort ();
+
+ return 0;
}
/* { dg-final { scan-tree-dump-times "will be interchanged" 1 "graphite" { xfail *-*-* } } } */