File: pr43657.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 (52 lines) | stat: -rw-r--r-- 857 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
 
/* { dg-do run } */
/* { dg-options "-O1 -ftree-loop-linear" } */

extern void abort (void);

#define K 32

int cond_array[2*K][K];
int a[K][K];
int out[K];
int check_result[K] = {2,2,2,2,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0};

__attribute__ ((noinline)) void
foo (int c)
{
  int res, i, j, k, next;

  for (k = 0; k < K; k++)
    {
      res = 0;
      for (j = 0; j < K; j++)
        for (i = 0; i < K; i++)
          {
            next = a[i][j];
            res = c > cond_array[i+k][j] ? next : res;
          }

      out[k] = res;
    }
}

int main ()
{
  int i, j, k;

  for  (j = 0; j < K; j++)
    {
      for (i = 0; i < 2*K; i++)
        cond_array[i][j] = i+j;

      for (i = 0; i < K; i++)
        a[i][j] = i+2;
    }

  foo(5);

  for (k = 0; k < K; k++)
    if (out[k] != check_result[k])
      abort ();

  return 0;
}