File: ldist-27.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 (42 lines) | stat: -rw-r--r-- 657 bytes parent folder | download | duplicates (4) 
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
 
/* { dg-do run { target size32plus } } */
/* { dg-options "-O3 -ftree-loop-distribute-patterns -fdump-tree-ldist-details" } */
/* { dg-skip-if "too big data segment" { visium-*-* } } */

#define M (300)
#define N (200)

struct st
{
  double a[M];
  double b[M];
  double c[M][N];
};

int __attribute__ ((noinline))
foo (struct st *s)
{
  int i, j;
  for (i = 0; i != M;)
    {
      s->a[i] = 0.0;
      s->b[i] = 1.0;
      for (j = 0; 1; ++j)
	{
	  if (j == N) goto L2;
	  s->c[i][j] = 0.0;
	}
L2:
      ++i;
    }
  return 0;
}

struct st s;

int
main (void)
{
  return foo (&s);
}

/* { dg-final { scan-tree-dump "distributed: split to " "ldist" } } */