Commit b23fdfb7 by Tom de Vries Committed by Tom de Vries

Fixup graphite/uns-*.c testcases

2015-07-25  Tom de Vries  <tom@codesourcery.com>

	* gcc.dg/graphite/graphite.exp: Include uns-*.c files in
	interchange_files and block_files variables.
	* gcc.dg/graphite/uns-block-1.c (main): Change signed into unsigned
	arithmetic.
	* gcc.dg/graphite/uns-interchange-12.c: Same.
	* gcc.dg/graphite/uns-interchange-14.c: Same.
	* gcc.dg/graphite/uns-interchange-15.c: Same.
	* gcc.dg/graphite/uns-interchange-9.c (foo): Same.
	* gcc.dg/graphite/uns-interchange-mvt.c: Same.

From-SVN: r226209
parent 00367044
2015-07-25 Tom de Vries <tom@codesourcery.com>
* gcc.dg/graphite/graphite.exp: Include uns-*.c files in
interchange_files and block_files variables.
* gcc.dg/graphite/uns-block-1.c (main): Change signed into unsigned
arithmetic.
* gcc.dg/graphite/uns-interchange-12.c: Same.
* gcc.dg/graphite/uns-interchange-14.c: Same.
* gcc.dg/graphite/uns-interchange-15.c: Same.
* gcc.dg/graphite/uns-interchange-9.c (foo): Same.
* gcc.dg/graphite/uns-interchange-mvt.c: Same.
2015-07-25 Jeff Law <law@redhat.com>
Revert:
......
......@@ -41,8 +41,10 @@ set wait_to_run_files [lsort [glob -nocomplain $srcdir/$subdir/*.c ] ]
set scop_files [lsort [glob -nocomplain $srcdir/$subdir/scop-*.c ] ]
set id_files [lsort [glob -nocomplain $srcdir/$subdir/id-*.c ] ]
set run_id_files [lsort [glob -nocomplain $srcdir/$subdir/run-id-*.c ] ]
set interchange_files [lsort [glob -nocomplain $srcdir/$subdir/interchange-*.c ] ]
set block_files [lsort [glob -nocomplain $srcdir/$subdir/block-*.c ] ]
set interchange_files [lsort [glob -nocomplain $srcdir/$subdir/interchange-*.c \
$srcdir/$subdir/uns-interchange-*.c ] ]
set block_files [lsort [glob -nocomplain $srcdir/$subdir/block-*.c \
$srcdir/$subdir/uns-block-*.c ] ]
set vect_files [lsort [glob -nocomplain $srcdir/$subdir/vect-*.c ] ]
# Tests to be compiled.
......
......@@ -13,9 +13,9 @@ int
main (void)
{
int i, j;
int sum = 0;
int A[MAX * MAX];
int B[MAX * MAX];
unsigned int sum = 0;
unsigned int A[MAX * MAX];
unsigned int B[MAX * MAX];
/* These loops should be loop blocked. */
for (i = 0; i < MAX; i++)
......
......@@ -7,9 +7,9 @@
#define N 200
int A[N][N], B[N][N], C[N][N];
unsigned int A[N][N], B[N][N], C[N][N];
static int __attribute__((noinline))
static unsigned int __attribute__((noinline))
matmult (void)
{
int i, j, k;
......@@ -31,7 +31,8 @@ extern void abort ();
int
main (void)
{
int i, j, res;
int i, j;
unsigned int res;
for (i = 0; i < N; i++)
for (j = 0; j < N; j++)
......
......@@ -7,7 +7,7 @@
#define N 200
int A[N][N], B[N][N], C[N][N];
unsigned int A[N][N], B[N][N], C[N][N];
static void __attribute__((noinline))
matmult (void)
......@@ -30,7 +30,8 @@ extern void abort ();
int
main (void)
{
int i, j, res = 0;
int i, j;
unsigned res = 0;
for (i = 0; i < N; i++)
for (j = 0; j < N; j++)
......
......@@ -7,9 +7,9 @@
#define NMAX 2000
static int x[NMAX], a[NMAX][NMAX];
static unsigned int x[NMAX], a[NMAX][NMAX];
static int __attribute__((noinline))
static unsigned int __attribute__((noinline))
mvt (long N)
{
int i,j;
......@@ -27,7 +27,8 @@ extern void abort ();
int
main (void)
{
int i, j, res;
int i, j;
unsigned int res;
for (i = 0; i < NMAX; i++)
for (j = 0; j < NMAX; j++)
......
......@@ -8,11 +8,11 @@
#define N 111
#define M 111
static int __attribute__((noinline))
foo (int *x)
static unsigned int __attribute__((noinline))
foo (unsigned int *x)
{
int i, j;
int sum = 0;
unsigned int sum = 0;
for (j = 0; j < M; ++j)
for (i = 0; i < N; ++i)
......@@ -26,8 +26,9 @@ extern void abort ();
int
main (void)
{
int A[N*M];
int i, res;
unsigned int A[N*M];
int i;
unsigned int res;
for (i = 0; i < N*M; i++)
A[i] = 2;
......
......@@ -7,9 +7,9 @@
#define NMAX 2000
static int x1[NMAX], x2[NMAX], a[NMAX][NMAX], y1[NMAX], y2[NMAX];
static unsigned int x1[NMAX], x2[NMAX], a[NMAX][NMAX], y1[NMAX], y2[NMAX];
static int __attribute__((noinline))
static unsigned int __attribute__((noinline))
mvt (long N)
{
......@@ -32,7 +32,8 @@ extern void abort ();
int
main (void)
{
int i, j, res;
int i, j;
unsigned int res;
for (i = 0; i < NMAX; i++)
for (j = 0; j < NMAX; j++)
......
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