File: run-id-6.c

package info (click to toggle)
gcc-arm-none-eabi 15%3A7-2018-q2-5
  • links: PTS, VCS
  • area: main
  • in suites: buster
  • size: 539,188 kB
  • sloc: ansic: 2,739,935; cpp: 848,238; ada: 602,637; makefile: 62,919; asm: 55,635; xml: 46,238; exp: 23,020; sh: 19,616; python: 6,371; pascal: 3,889; awk: 3,278; perl: 2,691; yacc: 316; ml: 285; f90: 234; lex: 198; objc: 194; haskell: 119
file content (55 lines) | stat: -rw-r--r-- 906 bytes parent folder | download | duplicates (10) 
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
49
50
51
52
53
54
55
 
/* { dg-options "-O2 -ftree-vectorize -fno-vect-cost-model -fno-tree-scev-cprop -fgraphite-identity" } */
/* { dg-require-effective-target vect_int } */

/* gcc.dg/vect/no-scevccp-outer-4.c was miscompiled by Graphite.
   Adding it here to always test it with Graphite.  */

#include <stdarg.h>

extern void abort ();
#define N 40

int a[N];

/* induction variable k advances through inner and outer loops.  */

__attribute__ ((noinline)) int
foo (int n){
  int i,j,k=0;
  int sum;

  if (n<=0)
    return 0;

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

int main (void)
{
  int i,j,k=0;
  int sum;

  for (i=0; i<N; i++)
    a[i] = i;

  foo (N);

    /* check results:  */
  for (i=0; i<N; i++)
    {
      sum = 0;
      for (j = 0; j < N; j+=2)
        sum += k++;
      if (a[i] != sum + j)
	abort();
    }

  return 0;
}