File: slsr-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 (29 lines) | stat: -rw-r--r-- 911 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
 
/* Verify straight-line strength reduction for simple pointer subtraction.  */

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

int*
f (int s, int *c, int *d)
{
  int a1, a2, a3, *x1, *x2, *x3;

  a1 = 2 * s;
  x1 = c - a1;
  a2 = 4 * s;
  x2 = c - a2;
  a3 = 6 * s;
  x3 = c - a3;
  return x1 == d ? x2 : x3;
}

/* Note that since some branch prediction heuristics changed, the
   calculations of x2 and x3 are pushed downward into the legs
   of the conditional, changing the code presented to SLSR.
   However, this proves to be a useful test for introducing an
   initializer with a cast, so we'll keep it as is.  */

/* There are 4 ' * ' instances in the decls (since "int * iftmp.0;" is
   added), 2 parms, 3 in the code.  The second one in the code may
   be a widening multiply (for example, on AArch64).  */
/* { dg-final { scan-tree-dump-times " w?\\* " 9 "optimized" } } */