File: ldist-26.c

package info (click to toggle)
gcc-riscv64-unknown-elf 8.3.0.2019.08%2Bdfsg-1
  • links: PTS, VCS
  • area: main
  • in suites: bullseye
  • size: 680,956 kB
  • sloc: ansic: 3,237,715; cpp: 896,882; ada: 772,854; f90: 144,254; asm: 68,788; makefile: 67,456; sh: 29,743; exp: 28,045; objc: 15,273; fortran: 11,885; python: 7,369; pascal: 5,375; awk: 3,725; perl: 2,872; yacc: 316; xml: 311; ml: 285; lex: 198; haskell: 122
file content (36 lines) | stat: -rw-r--r-- 805 bytes parent folder | download | duplicates (2) 
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
 
/* { dg-do run } */
/* { dg-options "-O3 -ftree-loop-distribution -fdump-tree-ldist-details" } */

extern void abort (void);

int a[130], b[128], c[128];

int __attribute__((noinline,noclone))
foo (int len, int x)
{
  int i;
  for (i = 1; i <= len; ++i)
    {
      a[i] = a[i + 2] + 1;
      b[i] = 0;
      a[i + 1] = a[i] - 3;
      if (i < x)
	c[i] = a[i];
    }
  return i;
}

int main()
{
  int i;
  for (i = 0; i < 130; ++i)
    a[i] = i;
  foo (127, 67);
  if (a[0] != 0 || a[1] != 4 || a[127] != 130)
    abort ();
  return 0;
}

/* { dg-final { scan-tree-dump "distributed: split to 2 loops and 0 library calls" "ldist" } } */
/* { dg-final { scan-tree-dump "distributed: split to 1 loops and 1 library calls" "ldist" } } */
/* { dg-final { scan-tree-dump "generated memset zero" "ldist" } } */