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
|
// PERMUTE_ARGS:
import core.stdc.stdio;
import core.bitop;
/*****************************************************/
void test1()
{
size_t[2] array;
uint x;
version (D_LP64)
size_t bitToUse = 67;
else
size_t bitToUse = 35;
array[0] = 2;
array[1] = 0x100;
printf("array = [0]:x%zx, [1]:x%zx\n", array[0], array[1]);
x = btc(array.ptr, bitToUse);
printf("btc(array, %zd) = %d\n", bitToUse, x);
printf("array = [0]:x%zx, [1]:x%zx\n", array[0], array[1]);
assert(x == 0);
assert(array[0] == 0x2 && array[1] == 0x108);
x = btc(array.ptr, bitToUse);
printf("btc(array, %zd) = %d\n", bitToUse, x);
printf("array = [0]:x%zx, [1]:x%zx\n", array[0], array[1]);
assert(x != 0);
assert(array[0] == 2 && array[1] == 0x100);
x = bts(array.ptr, bitToUse);
printf("bts(array, %zd) = %d\n", bitToUse, x);
printf("array = [0]:x%zx, [1]:x%zx\n", array[0], array[1]);
assert(x == 0);
assert(array[0] == 2 && array[1] == 0x108);
x = btr(array.ptr, bitToUse);
printf("btr(array, %zd) = %d\n", bitToUse, x);
printf("array = [0]:x%zx, [1]:x%zx\n", array[0], array[1]);
assert(x != 0);
assert(array[0] == 2 && array[1] == 0x100);
x = bt(array.ptr, 1);
printf("bt(array, 1) = %d\n", x);
printf("array = [0]:x%zx, [1]:x%zx\n", array[0], array[1]);
assert(x != 0);
assert(array[0] == 2 && array[1] == 0x100);
}
/*****************************************************/
void test2()
{
uint v;
int x;
v = 0x21;
x = bsf(v);
printf("bsf(x%x) = %d\n", v, x);
assert(x == 0);
x = bsr(v);
printf("bsr(x%x) = %d\n", v, x);
assert(x == 5);
}
/*****************************************************/
version (DigitalMars)
{
void test3()
{ uint v;
int b;
b = inp(b);
b = inpw(b);
b = inpl(b);
b = outp(v, cast(ubyte)b);
b = outpw(v, cast(ushort)b);
b = outpl(v, b);
}
}
/*****************************************************/
void test4()
{
uint i = 0x12_34_56_78;
i = bswap(i);
assert(i == 0x78_56_34_12);
}
/*****************************************************/
void test5()
{
size_t[2] array;
array[0] = 2;
array[1] = 0x100;
printf("btc(array, 35) = %d\n", btc(array.ptr, 35));
printf("array = [0]:x%zx, [1]:x%zx\n", array[0], array[1]);
printf("btc(array, 35) = %d\n", btc(array.ptr, 35));
printf("array = [0]:x%zx, [1]:x%zx\n", array[0], array[1]);
printf("bts(array, 35) = %d\n", bts(array.ptr, 35));
printf("array = [0]:x%zx, [1]:x%zx\n", array[0], array[1]);
printf("btr(array, 35) = %d\n", btr(array.ptr, 35));
printf("array = [0]:x%zx, [1]:x%zx\n", array[0], array[1]);
printf("bt(array, 1) = %d\n", bt(array.ptr, 1));
printf("array = [0]:x%zx, [1]:x%zx\n", array[0], array[1]);
}
/*****************************************************/
class Node {
uint leaf = 0;
int m() {
return leaf ? 0 : bsf(leaf);
}
}
void test6()
{
Node n = new Node();
}
/*****************************************************/
int main()
{
test1();
test2();
//test3();
test4();
test5();
test6();
printf("Success\n");
return 0;
}
|
