File: ldist-26.c

package info (click to toggle)
gcc-arm-none-eabi 15%3A14.2.rel1-1
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid, trixie
  • size: 1,099,328 kB
  • sloc: cpp: 3,627,108; ansic: 2,571,498; ada: 834,230; f90: 235,082; makefile: 79,231; asm: 74,984; xml: 51,692; exp: 39,736; sh: 33,298; objc: 15,629; python: 15,069; fortran: 14,429; pascal: 7,003; awk: 5,070; perl: 3,106; ml: 285; lisp: 253; lex: 204; haskell: 135
file content (38 lines) | stat: -rw-r--r-- 891 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
37
38
 
/* { 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;
}

/* Loop splitting splits the iteration space so we end up with two
   loops entering loop distribution.  Both should have the b[i] = 0
   part split out as memset.  */
/* { dg-final { scan-tree-dump-times "distributed: split to 1 loops and 1 library calls" 2 "ldist" } } */
/* { dg-final { scan-tree-dump-times "generated memset zero" 2 "ldist" } } */