File: loop-8.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 (24 lines) | stat: -rw-r--r-- 659 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
 
/* A test for strength reduction of ivs with nonconstant step.  */

/* { dg-do compile } */
/* { dg-options "-O1 -fdump-tree-optimized" } */

int bar (void);

int a[100];

void xxx (void)
{
  int iter, step = bar ();

  for (iter = 0; iter < 10; iter++)
    a[iter * step] = bar ();
}

/* The array access should be strength reduced.  But to determine the value of
   the step, we need to calculate step * sizeof (int), thus we need to be
   a bit careful about which multiplications we disallow.  */

/* { dg-final { scan-tree-dump-times "step \\* \[^0-9\]" 0 "optimized" } } */
/* { dg-final { scan-tree-dump-times "\[^0-9\] \\* step" 0 "optimized" } } */