blob: 7e6914d9d6bd9fd94b213bc7ed895339d0b09ca8 (
plain)
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
49
|
/* 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" } } */
/* { dg-final { cleanup-tree-dump "vrp1" } } */
|
