47 lines
779 B
C
47 lines
779 B
C
/* { dg-require-effective-target size32plus } */
|
|
|
|
#define DEBUG 0
|
|
#if DEBUG
|
|
#include <stdio.h>
|
|
#endif
|
|
|
|
#define MAX 100
|
|
|
|
extern void abort ();
|
|
|
|
int
|
|
main (void)
|
|
{
|
|
int i, j;
|
|
int sum = 0;
|
|
int A[MAX * MAX];
|
|
int B[MAX * MAX];
|
|
|
|
for (i = 0; i < MAX; i++)
|
|
for (j = 0; j < MAX; j++)
|
|
{
|
|
A[i*MAX + j] = j;
|
|
B[i*MAX + j] = j;
|
|
}
|
|
|
|
for (i = 0; i < MAX; i++)
|
|
for (j = 0; j < MAX; j++)
|
|
A[i*MAX + j] += B[j*MAX + i];
|
|
|
|
for(i = 0; i < MAX; i++)
|
|
for(j = 0; j < MAX; j++)
|
|
sum += A[i*MAX + j];
|
|
|
|
#if DEBUG
|
|
fprintf (stderr, "sum = %d \n", sum);
|
|
#endif
|
|
|
|
if (sum != 990000)
|
|
abort ();
|
|
|
|
return 0;
|
|
}
|
|
|
|
/* { dg-final { scan-tree-dump-times "will be loop blocked" 2 "graphite" { xfail *-*-* } } } */
|
|
/* { dg-final { cleanup-tree-dump "graphite" } } */
|