File: fuse-2.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 (41 lines) | stat: -rw-r--r-- 770 bytes parent folder | download | duplicates (6) 
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
 
/* Check that the three loops are fused.  */

/* Make sure we fuse the loops like this:
AST generated by isl:
for (int c0 = 0; c0 <= 99; c0 += 1) {
  S_3(c0);
  S_6(c0);
  S_9(c0);
}
*/

/* { dg-final { scan-tree-dump-times "AST generated by isl:.*for \\(int c0 = 0; c0 <= 99; c0 \\+= 1\\) \\{.*S_.*\\(c0\\);.*S_.*\\(c0\\);.*S_.*\\(c0\\);.*\\}" 1 "graphite" } } */

#define MAX 100
int A[MAX], B[MAX], C[MAX];

extern void abort ();

int
main (void)
{
  int i;

  /* The next three loops should be fused.  */
  for (i = 0; i < MAX; i++)
    {
      A[i] = i;
      B[i] = i + 2;
      C[i] = i + 1;
    }
  for(i=0; i<MAX; i++)
    A[i] += B[i];
  for(i=0; i<MAX; i++)
    A[i] += C[i];

  for (i = 0; i < MAX; i++)
    if (A[i] != 3*i+3)
      abort ();

  return 0;
}