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
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
|
/* PR tree-optimization/61839. */
/* { dg-do compile } */
/* { dg-options "-O2 -fdump-tree-evrp" } */
/* { dg-require-effective-target int32plus } */
__attribute__ ((noinline))
int foo ()
{
int a = -1;
volatile unsigned b = 1U;
int c = 1;
c = (a + 972195718) / (b ? 2 : 0);
if (c == 486097858)
;
else
__builtin_abort ();
return 0;
}
__attribute__ ((noinline))
int bar ()
{
int a = -1;
volatile unsigned b = 1U;
int c = 1;
c = (a + 972195718) % (b ? 2 : 0);
if (c == 1)
;
else
__builtin_abort ();
return 0;
}
__attribute__ ((noinline))
int bar2 ()
{
int a = -1;
volatile unsigned b = 1U;
int c = 1;
c = (a + 972195716) % (b ? 1 : 2);
if (c == 0)
;
else
__builtin_abort ();
return 0;
}
/* Ensure we are folding modulus sub-ranges properly. */
__attribute__ ((noinline))
int mod (int a, int b)
{
int v1, v2;
v1 = (a < 10) ? 12 : 24;
v2 = (b > 20) ? 3 : 6;
if (a > 20)
v1 = v1 * 2;
if (b > 20)
v2 = v2 * 2;
if (a == b)
v2 = 0;
/* v1 == 12, 24, or 48. v2 == 0, 3, 6, or 12. */
int c = v1 % v2;
if (c == 0)
;
else
__builtin_abort ();
return 0;
}
/* EVRP now makes transformations in all functions, leaving a single
* builtin_abort call in bar2. */
/* { dg-final { scan-tree-dump-times "__builtin_abort" 1 "evrp" } } */
/* Make sure to optimize 972195717 / 0 in function foo. */
/* { dg-final { scan-tree-dump-times "972195717 / " 0 "evrp" } } */
/* Make sure to optimize 972195717 % 0 in function bar. */
/* { dg-final { scan-tree-dump-times "972195717 % " 0 "evrp" } } */
/* Make sure to optimize 972195717 % [1,2] function bar2. */
/* { dg-final { scan-tree-dump-times "972195715 % " 0 "evrp" } } */
/* [12,12][24,24][48,48] % [0,0][3,3][6,6][12,12] == [0,0] */
/* { dg-final { scan-tree-dump-times "%" 0 "evrp" } } */
|
