gcc/testsuite/gcc.dg/graphite/pr29581-4.c


1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48

/* PR tree-optimization/29581 */
/* Origin: gcc.dg/vect/vect-88.c */
/* { dg-do run } */
/* { dg-options "-O2 -ftree-loop-linear" } */

extern void abort (void);

#define N 16

int main1 (int n, int *a)
{
  int i, j, k;
  int b[N];

  for (i = 0; i < n; i++)
    {
      for (j = 0; j < n; j++)
	{
	  k = i + n;
	  a[j] = k;
	}
      b[i] = k;
    }


  for (j = 0; j < n; j++)
    if (a[j] != i + n - 1)
      abort();	

  for (j = 0; j < n; j++)
    if (b[j] != j + n)
      abort();	

  return 0;
}

int main (void)
{
  int a[N+1] __attribute__ ((__aligned__(16)));

  main1 (N, a+1);
  main1 (0, a+1);
  main1 (1, a+1);
  main1 (2, a+1);
  main1 (N-1, a+1);

  return 0;
}