Commit 0be957dc by Sebastian Pop Committed by Sebastian Pop

Call abort for runtime test, always return 0 from main.

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.

From-SVN: r156584
parent 4d48441c
2010-02-07 Sebastian Pop <sebastian.pop@amd.com> 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/id-19.f: New.
* gfortran.dg/graphite/pr14741.f90: New. * gfortran.dg/graphite/pr14741.f90: New.
* gfortran.dg/graphite/pr41924.f90: New. * gfortran.dg/graphite/pr41924.f90: New.
......
...@@ -19,7 +19,10 @@ foo (void) ...@@ -19,7 +19,10 @@ foo (void)
return a[0]; return a[0];
} }
main() extern void abort ();
int
main (void)
{ {
int i, res; int i, res;
...@@ -32,7 +35,10 @@ main() ...@@ -32,7 +35,10 @@ main()
fprintf (stderr, "res = %d \n", res); fprintf (stderr, "res = %d \n", res);
#endif #endif
return res != 1999; if (res != 1999)
abort ();
return 0;
} }
/* { dg-final { scan-tree-dump-times "will be loop blocked" 1 "graphite" { xfail *-*-* } } } */ /* { dg-final { scan-tree-dump-times "will be loop blocked" 1 "graphite" { xfail *-*-* } } } */
......
...@@ -7,7 +7,10 @@ ...@@ -7,7 +7,10 @@
#define MAX 100 #define MAX 100
int main() extern void abort ();
int
main (void)
{ {
int i, j; int i, j;
int sum = 0; int sum = 0;
...@@ -33,7 +36,10 @@ int main() ...@@ -33,7 +36,10 @@ int main()
fprintf (stderr, "sum = %d \n", sum); fprintf (stderr, "sum = %d \n", sum);
#endif #endif
return sum != 990000; if (sum != 990000)
abort ();
return 0;
} }
/* { dg-final { scan-tree-dump-times "will be loop blocked" 2 "graphite" { xfail *-*-* } } } */ /* { dg-final { scan-tree-dump-times "will be loop blocked" 2 "graphite" { xfail *-*-* } } } */
......
...@@ -30,6 +30,8 @@ foo (void) ...@@ -30,6 +30,8 @@ foo (void)
return A[0][0][0] + A[M-1][M-1][M-1]; return A[0][0][0] + A[M-1][M-1][M-1];
} }
extern void abort ();
int int
main (void) main (void)
{ {
...@@ -48,7 +50,10 @@ main (void) ...@@ -48,7 +50,10 @@ main (void)
fprintf (stderr, "res = %d \n", res); fprintf (stderr, "res = %d \n", res);
#endif #endif
return res != 9801; if (res != 9801)
abort ();
return 0;
} }
/* { dg-final { scan-tree-dump-times "will be loop blocked" 1 "graphite" } } */ /* { dg-final { scan-tree-dump-times "will be loop blocked" 1 "graphite" } } */
......
...@@ -28,6 +28,8 @@ foo (void) ...@@ -28,6 +28,8 @@ foo (void)
return A[0][0] + A[M-1][M-1]; return A[0][0] + A[M-1][M-1];
} }
extern void abort ();
int int
main (void) main (void)
{ {
...@@ -46,7 +48,10 @@ main (void) ...@@ -46,7 +48,10 @@ main (void)
fprintf (stderr, "res = %d \n", res); fprintf (stderr, "res = %d \n", res);
#endif #endif
return res != 998001; if (res != 998001)
abort ();
return 0;
} }
/* { dg-final { scan-tree-dump-times "will be loop blocked" 1 "graphite" { xfail *-*-* } } } */ /* { dg-final { scan-tree-dump-times "will be loop blocked" 1 "graphite" { xfail *-*-* } } } */
......
...@@ -27,6 +27,8 @@ foo (void) ...@@ -27,6 +27,8 @@ foo (void)
return res; return res;
} }
extern void abort ();
int int
main (void) main (void)
{ {
...@@ -45,7 +47,10 @@ main (void) ...@@ -45,7 +47,10 @@ main (void)
fprintf (stderr, "res = %d \n", res); fprintf (stderr, "res = %d \n", res);
#endif #endif
return res != 1333300; if (res != 1333300)
abort ();
return 0;
} }
/* { dg-final { scan-tree-dump-times "will be loop blocked" 1 "graphite" } } */ /* { dg-final { scan-tree-dump-times "will be loop blocked" 1 "graphite" } } */
......
...@@ -25,6 +25,8 @@ foo (void) ...@@ -25,6 +25,8 @@ foo (void)
return res; return res;
} }
extern void abort ();
int int
main (void) main (void)
{ {
...@@ -40,7 +42,10 @@ main (void) ...@@ -40,7 +42,10 @@ main (void)
fprintf (stderr, "res = %d \n", res); fprintf (stderr, "res = %d \n", res);
#endif #endif
return res != 204007516; if (res != 204007516)
abort ();
return 0;
} }
/* { dg-final { scan-tree-dump-times "will be loop blocked" 0 "graphite" } } */ /* { dg-final { scan-tree-dump-times "will be loop blocked" 0 "graphite" } } */
......
...@@ -23,6 +23,8 @@ matmult (void) ...@@ -23,6 +23,8 @@ matmult (void)
} }
} }
extern void abort ();
int int
main (void) main (void)
{ {
...@@ -44,7 +46,10 @@ main (void) ...@@ -44,7 +46,10 @@ main (void)
fprintf (stderr, "res = %d \n", res); fprintf (stderr, "res = %d \n", res);
#endif #endif
return res != 529340000; if (res != 529340000)
abort ();
return 0;
} }
/* { dg-final { scan-tree-dump-times "will be loop blocked" 1 "graphite" { xfail *-*-* } } } */ /* { dg-final { scan-tree-dump-times "will be loop blocked" 1 "graphite" { xfail *-*-* } } } */
......
...@@ -22,6 +22,8 @@ foo (void) ...@@ -22,6 +22,8 @@ foo (void)
return a[N-1][N-1]; return a[N-1][N-1];
} }
extern void abort ();
int int
main (void) main (void)
{ {
...@@ -38,7 +40,10 @@ main (void) ...@@ -38,7 +40,10 @@ main (void)
fprintf (stderr, "res = %d \n", res); fprintf (stderr, "res = %d \n", res);
#endif #endif
return res != 13; if (res != 13)
abort ();
return 0;
} }
/* { dg-final { scan-tree-dump-times "will be interchanged" 1 "graphite" } } */ /* { dg-final { scan-tree-dump-times "will be interchanged" 1 "graphite" } } */
......
...@@ -26,6 +26,8 @@ foo (int N) ...@@ -26,6 +26,8 @@ foo (int N)
return sum + N + u[1336 * 2] + u[1336]; return sum + N + u[1336 * 2] + u[1336];
} }
extern void abort ();
int int
main (void) main (void)
{ {
...@@ -40,7 +42,10 @@ main (void) ...@@ -40,7 +42,10 @@ main (void)
fprintf (stderr, "res = %d \n", res); fprintf (stderr, "res = %d \n", res);
#endif #endif
return res != 3565793; if (res != 3565793)
abort ();
return 0;
} }
......
...@@ -24,6 +24,8 @@ foo (int N, int *res) ...@@ -24,6 +24,8 @@ foo (int N, int *res)
*res = sum + N + u[1336 * 2] + u[1336]; *res = sum + N + u[1336 * 2] + u[1336];
} }
extern void abort ();
int int
main (void) main (void)
{ {
...@@ -38,7 +40,10 @@ main (void) ...@@ -38,7 +40,10 @@ main (void)
fprintf (stderr, "res = %d \n", res); fprintf (stderr, "res = %d \n", res);
#endif #endif
return res != 7130239; if (res != 7130239)
abort ();
return 0;
} }
/* { dg-final { scan-tree-dump-times "will be interchanged" 2 "graphite" } } */ /* { dg-final { scan-tree-dump-times "will be interchanged" 2 "graphite" } } */
......
...@@ -23,6 +23,8 @@ foo (int N, int *res) ...@@ -23,6 +23,8 @@ foo (int N, int *res)
*res = sum; *res = sum;
} }
extern void abort ();
int int
main (void) main (void)
{ {
...@@ -37,7 +39,10 @@ main (void) ...@@ -37,7 +39,10 @@ main (void)
fprintf (stderr, "res = %d \n", res); fprintf (stderr, "res = %d \n", res);
#endif #endif
return res != 3564450; if (res != 3564450)
abort ();
return 0;
} }
/* { dg-final { scan-tree-dump-times "will be interchanged" 1 "graphite" { xfail *-*-* } } } */ /* { dg-final { scan-tree-dump-times "will be interchanged" 1 "graphite" { xfail *-*-* } } } */
......
...@@ -25,6 +25,8 @@ matmult (void) ...@@ -25,6 +25,8 @@ matmult (void)
return A[0][0] + A[N-1][N-1]; return A[0][0] + A[N-1][N-1];
} }
extern void abort ();
int int
main (void) main (void)
{ {
...@@ -44,7 +46,10 @@ main (void) ...@@ -44,7 +46,10 @@ main (void)
fprintf (stderr, "res = %d \n", res); fprintf (stderr, "res = %d \n", res);
#endif #endif
return res != 2626800; if (res != 2626800)
abort ();
return 0;
} }
/* { dg-final { scan-tree-dump-times "will be interchanged" 1 "graphite" { xfail *-*-* } } } */ /* { dg-final { scan-tree-dump-times "will be interchanged" 1 "graphite" { xfail *-*-* } } } */
......
...@@ -30,6 +30,8 @@ foo (int N, int *res) ...@@ -30,6 +30,8 @@ foo (int N, int *res)
*res = sum + N + u[1336 * 2] + u[1336]; *res = sum + N + u[1336 * 2] + u[1336];
} }
extern void abort ();
int int
main (void) main (void)
{ {
...@@ -44,7 +46,10 @@ main (void) ...@@ -44,7 +46,10 @@ main (void)
fprintf (stderr, "res = %d \n", res); fprintf (stderr, "res = %d \n", res);
#endif #endif
return res != 3565793; if (res != 3565793)
abort ();
return 0;
} }
/* { dg-final { scan-tree-dump-times "will be interchanged" 1 "graphite" { xfail *-*-* } } } */ /* { dg-final { scan-tree-dump-times "will be interchanged" 1 "graphite" { xfail *-*-* } } } */
......
...@@ -25,6 +25,8 @@ foo (int N, int *res) ...@@ -25,6 +25,8 @@ foo (int N, int *res)
*res = sum + N + u[1336 * 2] + u[1336]; *res = sum + N + u[1336 * 2] + u[1336];
} }
extern void abort ();
int int
main (void) main (void)
{ {
...@@ -39,7 +41,10 @@ main (void) ...@@ -39,7 +41,10 @@ main (void)
fprintf (stderr, "res = %d \n", res); fprintf (stderr, "res = %d \n", res);
#endif #endif
return res != 3565789; if (res != 3565789)
abort ();
return 0;
} }
/* { dg-final { scan-tree-dump-times "will be interchanged" 1 "graphite" } } */ /* { dg-final { scan-tree-dump-times "will be interchanged" 1 "graphite" } } */
......
...@@ -24,6 +24,8 @@ foo (int N, int *res) ...@@ -24,6 +24,8 @@ foo (int N, int *res)
*res = sum + N + u[1336 * 2] + u[1336]; *res = sum + N + u[1336 * 2] + u[1336];
} }
extern void abort ();
int int
main (void) main (void)
{ {
...@@ -38,7 +40,10 @@ main (void) ...@@ -38,7 +40,10 @@ main (void)
fprintf (stderr, "res = %d \n", res); fprintf (stderr, "res = %d \n", res);
#endif #endif
return res != 3565793; if (res != 3565793)
abort ();
return 0;
} }
/* { dg-final { scan-tree-dump-times "will be interchanged" 1 "graphite" } } */ /* { dg-final { scan-tree-dump-times "will be interchanged" 1 "graphite" } } */
......
...@@ -23,6 +23,8 @@ foo (void) ...@@ -23,6 +23,8 @@ foo (void)
return A[0][0] + A[N-1][M-1]; return A[0][0] + A[N-1][M-1];
} }
extern void abort ();
int int
main (void) main (void)
{ {
...@@ -38,7 +40,10 @@ main (void) ...@@ -38,7 +40,10 @@ main (void)
fprintf (stderr, "res = %d \n", res); fprintf (stderr, "res = %d \n", res);
#endif #endif
return res != 20; if (res != 20)
abort ();
return 0;
} }
/* { dg-final { scan-tree-dump-times "will be interchanged" 1 "graphite" } } */ /* { dg-final { scan-tree-dump-times "will be interchanged" 1 "graphite" } } */
......
...@@ -23,6 +23,8 @@ foo (int A[N][M]) ...@@ -23,6 +23,8 @@ foo (int A[N][M])
return A[0][0] + A[N-1][M-1]; return A[0][0] + A[N-1][M-1];
} }
extern void abort ();
int int
main (void) main (void)
{ {
...@@ -39,7 +41,10 @@ main (void) ...@@ -39,7 +41,10 @@ main (void)
fprintf (stderr, "res = %d \n", res); fprintf (stderr, "res = %d \n", res);
#endif #endif
return res != 8; if (res != 8)
abort ();
return 0;
} }
/* { dg-final { scan-tree-dump-times "will be interchanged" 1 "graphite" } } */ /* { dg-final { scan-tree-dump-times "will be interchanged" 1 "graphite" } } */
......
...@@ -23,6 +23,8 @@ foo (double *a) ...@@ -23,6 +23,8 @@ foo (double *a)
return r; return r;
} }
extern void abort ();
int int
main (void) main (void)
{ {
...@@ -38,7 +40,10 @@ main (void) ...@@ -38,7 +40,10 @@ main (void)
fprintf (stderr, "res = %d \n", res); fprintf (stderr, "res = %d \n", res);
#endif #endif
return res != 246642; if (res != 246642)
abort ();
return 0;
} }
/* { dg-final { scan-tree-dump-times "will be interchanged" 1 "graphite" } } */ /* { dg-final { scan-tree-dump-times "will be interchanged" 1 "graphite" } } */
......
...@@ -46,6 +46,8 @@ foo (void) ...@@ -46,6 +46,8 @@ foo (void)
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]; 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 int
main (void) main (void)
{ {
...@@ -72,7 +74,10 @@ main (void) ...@@ -72,7 +74,10 @@ main (void)
fprintf (stderr, "res = %d \n", res); fprintf (stderr, "res = %d \n", res);
#endif #endif
return res != 424; if (res != 424)
abort ();
return 0;
} }
/* Loops K and L should be interchanged. */ /* Loops K and L should be interchanged. */
......
...@@ -21,6 +21,8 @@ foo (int *x) ...@@ -21,6 +21,8 @@ foo (int *x)
return sum; return sum;
} }
extern void abort ();
int int
main (void) main (void)
{ {
...@@ -36,7 +38,10 @@ main (void) ...@@ -36,7 +38,10 @@ main (void)
fprintf (stderr, "res = %d \n", res); fprintf (stderr, "res = %d \n", res);
#endif #endif
return res != 2468642; if (res != 2468642)
abort ();
return 0;
} }
/* { dg-final { scan-tree-dump-times "will be interchanged" 1 "graphite" } } */ /* { dg-final { scan-tree-dump-times "will be interchanged" 1 "graphite" } } */
......
...@@ -26,6 +26,8 @@ mvt (long N) ...@@ -26,6 +26,8 @@ mvt (long N)
return x1[0] + x2[0]; return x1[0] + x2[0];
} }
extern void abort ();
int int
main (void) main (void)
{ {
...@@ -49,7 +51,10 @@ main (void) ...@@ -49,7 +51,10 @@ main (void)
fprintf (stderr, "res = %d \n", res); fprintf (stderr, "res = %d \n", res);
#endif #endif
return res != 199900000; if (res != 199900000)
abort ();
return 0;
} }
/* { dg-final { scan-tree-dump-times "will be interchanged" 1 "graphite" { xfail *-*-* } } } */ /* { dg-final { scan-tree-dump-times "will be interchanged" 1 "graphite" { xfail *-*-* } } } */
......
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment