File: loop-17.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 (18 lines) | stat: -rw-r--r-- 435 bytes parent folder | download | duplicates (6) 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
 
/* { dg-do compile } */
/* { dg-options "-O -fdump-tree-sccp-details" } */

/* To determine the number of iterations in this loop we need to fold
   p_4 + 4B > p_4 + 8B to false.  This transformation has caused
   troubles in the past due to overflow issues.  */

int foo (int *p)
{
  int i = 0, *x;

  for (x = p; x < p + 2; x++)
    i++;

  return i;
}

/* { dg-final { scan-tree-dump "# of iterations 1, bounded by 1" "sccp" } } */