File: predcom-dse-11.c

package info (click to toggle)
gcc-arm-none-eabi 15%3A8-2019-q3-1
  • links: PTS, VCS
  • area: main
  • in suites: bullseye
  • size: 571,828 kB
  • sloc: ansic: 2,937,651; cpp: 881,644; ada: 597,189; makefile: 65,528; asm: 56,499; xml: 46,621; exp: 24,747; sh: 19,684; python: 7,256; pascal: 4,370; awk: 3,497; perl: 2,695; yacc: 316; ml: 285; f90: 234; lex: 198; objc: 194; haskell: 119
file content (51 lines) | stat: -rw-r--r-- 1,039 bytes parent folder | download | duplicates (3) 
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
 
/* { dg-do run } */
/* { dg-options "-O2 -fno-inline -fpredictive-commoning -fdump-tree-pcom-details" } */

int arr[105] = {2, 3, 5, 7, 11};
int x[105] = {2, 3, 5, 7, 11};
int result0[10] = {2, 3, 5, 7, 11};
int result1[10] = {0, 0, 0, 0, 0, 0, -1, -2, -2};

extern void abort (void);

int __attribute__((noinline)) foo (int * __restrict__ a, int * __restrict__ b, int len, int flag)
{
  int i, sum = 0;
  for (i = 0; i < len; i++)
    {
      a[i] = 0;
      b[i + 2] = i;
      a[i + 1] = -1;
      sum += b[i];
      a[i + 3] = -2;
    }
  return sum;
}

void check (int *a, int *res, int len, int sum, int val)
{
  int i;

  if (sum != val)
    abort ();

  for (i = 0; i < len; i++)
    if (a[i] != res[i])
      abort ();
}

int main (void)
{
  int i, sum;

  sum = foo (arr, x, 0, 0);
  check (arr, result0, 10, sum, 0);

  sum = foo (arr, x, 6, 0);
  check (arr, result1, 10, sum, 11);

  return 0;
}
/* { dg-final { scan-tree-dump "Store-stores chain" "pcom"} } */
/* { dg-final { scan-tree-dump "Store-loads chain" "pcom"} } */