File: pr22026.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 (48 lines) | stat: -rw-r--r-- 816 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
47
48
 
/* PR tree-optimization/22026
   VRP used think that ~[0,0] + ~[0,0] = ~[0,0], which is wrong.  The
   same applies to subtraction and unsigned multiplication.  */

/* { dg-do compile } */
/* { dg-options "-O2 -fdump-tree-vrp1" } */

int
plus (int x, int y)
{
  if (x != 0)
    if (y != 0)
      {
        int z = x + y;
        if (z != 0)
          return 1;
      }
  return 0;
}

int
minus (int x, int y)
{
  if (x != 0)
    if (y != 0)
      {
        int z = x - y;
        if (z != 0)
          return 1;
      }
  return 0;
}

int
mult (unsigned x, unsigned y)
{
  if (x != 0)
    if (y != 0)
      {
	unsigned z = x * y;
	if (z != 0)
	  return 1;
      }
  return 0;
}

/* None of the predicates can be folded in these functions.  */
/* { dg-final { scan-tree-dump-times "Folding predicate" 0 "vrp1" } } */