blob: 63c5e231f85b106111a1637a2c0e7b82bbc17c56 (
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
50
51
52
53
54
55
56
57
58
59
|
/* { dg-additional-options "-fdump-tree-optimized-details-blocks" } */
/* { dg-do compile } */
int
f1 (int *x, int n)
{
int res = 0;
for (int i = 0; i < n; ++i)
res += x[i * 2] == 1 ? 2 : 3;
return res;
}
int
f2 (int *x)
{
int res = 0;
for (int i = 0; i < 0x83; ++i)
res += x[i * 2] == 1 ? 2 : 3;
return res;
}
int
f3 (int *x, int n)
{
int res = 0;
for (int i = 0; i < n; ++i)
res += x[i * 2] == 1 ? 2 : 3;
return res + x[0x100];
}
int
f4 (int *x)
{
int res = 0;
for (int i = 0; i < 0x83; ++i)
res += x[i * 2] == 1 ? 2 : 3;
return res + x[0x100];
}
int
f5 (int *x, int n, int a)
{
int res = 0;
for (int i = 0; i < n; ++i)
res += x[i * 2] == 1 ? 2 : 3;
x[a] += 1;
return res;
}
int
f6 (int *x, int a)
{
int res = 0;
for (int i = 0; i < 0x83; ++i)
res += x[i * 2] == 1 ? 2 : 3;
x[a] += 1;
return res;
}
/* { dg-final { scan-tree-dump-not "Invalid sum" "optimized" } } */
|
