blob: afd763cb245ffaac12f86285327a8a9611125c71 (
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
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
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
|
/* PR tree-optimization/95527 */
/* { dg-do compile } */
/* { dg-options "-O2 -fdump-tree-optimized" } */
/* { dg-final { scan-tree-dump-times "return 0;" 4 "optimized" } } */
/* { dg-final { scan-tree-dump-times "return 18;" 4 "optimized" } } */
/* { dg-final { scan-tree-dump-times "a_\[0-9]*\\\(D\\\) == 0" 1 "optimized" } } */
int
f1 (int a)
{
return __builtin_ffs (a) == 0;
}
/* { dg-final { scan-tree-dump-times "b_\[0-9]*\\\(D\\\) != 0" 1 "optimized" } } */
int
f2 (int b)
{
return __builtin_ffs (b) != 0;
}
int
f3 (int x)
{
return __builtin_ffs (x) == -1;
}
int
f4 (int x)
{
return 17 + (__builtin_ffs (x) != -1);
}
int
f5 (int x)
{
return __builtin_ffs (x) == __SIZEOF_INT__ * __CHAR_BIT__ + 1;
}
int
f6 (int x)
{
return 17 + (__builtin_ffs (x) != __SIZEOF_INT__ * __CHAR_BIT__ + 1);
}
/* { dg-final { scan-tree-dump-times "c_\[0-9]*\\\(D\\\) & 63" 1 "optimized" } } */
/* { dg-final { scan-tree-dump-times "== 32" 1 "optimized" } } */
int
f7 (int c)
{
return __builtin_ffs (c) == 6;
}
/* { dg-final { scan-tree-dump-times "d_\[0-9]*\\\(D\\\) & 16383" 1 "optimized" } } */
/* { dg-final { scan-tree-dump-times "!= 8192" 1 "optimized" } } */
int
f8 (int d)
{
return __builtin_ffs (d) != 14;
}
/* { dg-final { scan-tree-dump-times "e_\[0-9]*\\\(D\\\) == -9223372036854775808" 1 "optimized" { target lp64 } } } */
/* { dg-final { scan-tree-dump-times "e_\[0-9]*\\\(D\\\) == -2147483648" 1 "optimized" { target ilp32 } } } */
int
f9 (long int e)
{
return __builtin_ffsl (e) == __SIZEOF_LONG__ * __CHAR_BIT__;
}
/* { dg-final { scan-tree-dump-times "f_\[0-9]*\\\(D\\\) != -9223372036854775808" 1 "optimized" } } */
int
f10 (long long int f)
{
return __builtin_ffsll (f) != __SIZEOF_LONG_LONG__ * __CHAR_BIT__;
}
/* { dg-final { scan-tree-dump-times "g_\[0-9]*\\\(D\\\) != 0" 1 "optimized" } } */
int
f11 (long long int g)
{
return __builtin_ffsll (g) > 0;
}
/* { dg-final { scan-tree-dump-times "h_\[0-9]*\\\(D\\\) == 0" 1 "optimized" } } */
int
f12 (int h)
{
return __builtin_ffs (h) <= 0;
}
int
f13 (int x)
{
return 17 + (__builtin_ffs (x) > -1);
}
int
f14 (int x)
{
return __builtin_ffs (x) <= -1;
}
int
f15 (int x)
{
return __builtin_ffs (x) > __SIZEOF_INT__ * __CHAR_BIT__;
}
int
f16 (int x)
{
return 17 + (__builtin_ffs (x) <= __SIZEOF_INT__ * __CHAR_BIT__);
}
/* { dg-final { scan-tree-dump-times "i_\[0-9]*\\\(D\\\) & 63" 1 "optimized" } } */
/* { dg-final { scan-tree-dump-times "i_\[0-9]*\\\(D\\\) != 0" 1 "optimized" } } */
int
f17 (int i)
{
return __builtin_ffs (i) > 6;
}
/* { dg-final { scan-tree-dump-times "j_\[0-9]*\\\(D\\\) & 4095" 1 "optimized" } } */
/* { dg-final { scan-tree-dump-times "j_\[0-9]*\\\(D\\\) == 0" 1 "optimized" } } */
int
f18 (int j)
{
return __builtin_ffs (j) <= 12;
}
/* { dg-final { scan-tree-dump-times "k_\[0-9]*\\\(D\\\) == -2147483648" 1 "optimized" { target int32 } } } */
int
f19 (int k)
{
return __builtin_ffs (k) > __SIZEOF_INT__ * __CHAR_BIT__ - 1;
}
/* { dg-final { scan-tree-dump-times "l_\[0-9]*\\\(D\\\) != -2147483648" 1 "optimized" { target int32 } } } */
int
f20 (int l)
{
return __builtin_ffs (l) <= __SIZEOF_INT__ * __CHAR_BIT__ - 1;
}
/* { dg-final { scan-tree-dump-times "m_\[0-9]*\\\(D\\\) & 1073741823" 1 "optimized" { target int32 } } } */
/* { dg-final { scan-tree-dump-times "m_\[0-9]*\\\(D\\\) != 0" 1 "optimized" } } */
int
f21 (int m)
{
return __builtin_ffs (m) > __SIZEOF_INT__ * __CHAR_BIT__ - 2;
}
/* { dg-final { scan-tree-dump-times "n_\[0-9]*\\\(D\\\) & 1073741823" 1 "optimized" { target int32 } } } */
/* { dg-final { scan-tree-dump-times "n_\[0-9]*\\\(D\\\) == 0" 1 "optimized" } } */
int
f22 (int n)
{
return __builtin_ffs (n) <= __SIZEOF_INT__ * __CHAR_BIT__ - 2;
}
|
