File: vrp77.c

package info (click to toggle)
gcc-arm-none-eabi 15%3A7-2018-q2-5
  • links: PTS, VCS
  • area: main
  • in suites: buster
  • size: 539,188 kB
  • sloc: ansic: 2,739,935; cpp: 848,238; ada: 602,637; makefile: 62,919; asm: 55,635; xml: 46,238; exp: 23,020; sh: 19,616; python: 6,371; pascal: 3,889; awk: 3,278; perl: 2,691; yacc: 316; ml: 285; f90: 234; lex: 198; objc: 194; haskell: 119
file content (46 lines) | stat: -rw-r--r-- 842 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
42
43
44
45
46
 
/* { dg-do compile } */
/* { dg-options "-O2 -fdump-tree-optimized" } */

#ifdef __SIZEOF_INT128__
#define T __int128
#else
#define T long long
#endif

extern void impossible (void);

void f(T x)
{
  unsigned T y;
  unsigned T z;
  if (x < -7)
    return;
  if (x > 2)
    return;
  y = x;
  z = y * y;
  if (z == 666)
    impossible ();
}

void g(unsigned T x)
{
  unsigned T y;
  unsigned T z;
  unsigned T m = -1;
  m = m / 2;
  if (x < m-2)
    return;
  if (x > m-1)
    return;
  y = x;
  z = y * y;
  /* The product (ignoring it is a square) has only 3 possible values:
     4, 9 and 2^127+6.  At least one of the values 7, 666 and -666 is
     known to be impossible.  7 is the most logical in the current
     implementation.  */
  if (z == 7)
    impossible ();
}

/* { dg-final { scan-tree-dump-not "impossible" "optimized" } } */