File: loop-8.c

package info (click to toggle)
gcc-arm-none-eabi 15%3A8-2019-q3-1
  • links: PTS, VCS
  • area: main
  • in suites: bullseye
  • size: 571,828 kB
  • sloc: ansic: 2,937,651; cpp: 881,644; ada: 597,189; makefile: 65,528; asm: 56,499; xml: 46,621; exp: 24,747; sh: 19,684; python: 7,256; pascal: 4,370; awk: 3,497; perl: 2,695; yacc: 316; ml: 285; f90: 234; lex: 198; objc: 194; haskell: 119
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" } } */