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
|
/* See LICENSE file for copyright and license details. */
#include "common.h"
#ifndef TEST
extern inline void libj2_cls_j2u(struct libj2_j2u *a);
/* TODO Add man page */
#else
static uintmax_t
random_ju(void)
{
size_t n = LIBJ2_JU_BIT;
uintmax_t r = 0;
while (n--)
if (rand() < rand())
r |= (uintmax_t)1 << n;
return r;
}
static void
cls(const struct libj2_j2u *a, struct libj2_j2u *res)
{
struct libj2_j2u a_saved = *a, r, b;
*res = (struct libj2_j2u){111, 222};
libj2_cls_j2u_to_j2u(a, res);
EXPECT(libj2_j2u_eq_j2u(a, &a_saved));
r = *a;
libj2_cls_j2u_to_j2u(&r, &r);
EXPECT(libj2_j2u_eq_j2u(&r, res));
r = *a;
libj2_cls_j2u(&r);
EXPECT(libj2_j2u_eq_j2u(&r, res));
r = (struct libj2_j2u){111, 222};
libj2_not_j2u_to_j2u(a, &b);
libj2_slc_j2u_to_j2u((const struct libj2_j2u *)&b, &r);
libj2_not_j2u(&b);
libj2_not_j2u(&r);
EXPECT(libj2_j2u_eq_j2u(&b, &a_saved));
EXPECT(libj2_j2u_eq_j2u(&r, res));
r = *a;
libj2_not_j2u(&r);
libj2_slc_j2u_to_j2u(&r, &r);
libj2_not_j2u(&r);
EXPECT(libj2_j2u_eq_j2u(&r, res));
r = *a;
libj2_not_j2u(&r);
libj2_slc_j2u(&r);
libj2_not_j2u(&r);
EXPECT(libj2_j2u_eq_j2u(&r, res));
b = (struct libj2_j2u){333, 444};
libj2_kls_j2u_to_j2u(a, &b);
EXPECT(libj2_j2u_eq_j2u(a, &a_saved));
libj2_j2u_sub_j2u_to_j2u(a, &b, &r);
EXPECT(libj2_j2u_eq_j2u(a, &a_saved));
EXPECT(libj2_j2u_eq_j2u(&r, res));
r = *a;
libj2_kls_j2u(&r);
EXPECT(libj2_j2u_eq_j2u(a, &a_saved));
EXPECT(libj2_j2u_eq_j2u(&r, &b));
}
int
main(void)
{
struct libj2_j2u a, r;
unsigned i, j, bit;
libj2_j2u_max(&a);
for (i = 0; i < LIBJ2_J2U_BIT; i++) {
cls(&a, &r);
libj2_j2u_rsh_to_j2u(&a, 1, &a);
EXPECT(libj2_j2u_eq_j2u(&r, &a));
}
EXPECT(libj2_j2u_is_zero(&a));
cls(&a, &r);
EXPECT(libj2_j2u_is_zero(&r));
libj2_j2u_max(&a);
a.low = 0;
for (i = 0; i < LIBJ2_JU_BIT; i++) {
cls(&a, &r);
libj2_j2u_rsh_to_j2u(&a, 1, &a);
a.low = 0;
EXPECT(libj2_j2u_eq_j2u(&r, &a));
}
EXPECT(libj2_j2u_is_zero(&a));
for (j = 1; j <= 3; j++) {
for (i = 0; i < 256; i++) {
a.high = (j & 1) ? random_ju() : 0;
a.low = (j & 2) ? random_ju() : 0;
while (!libj2_j2u_is_zero(&a)) {
cls(&a, &r);
bit = libj2_fls_j2u(&a);
EXPECT(bit);
bit -= 1U;
EXPECT(libj2_j2u_test_bit(&a, bit));
libj2_j2u_xor_bit(&a, bit);
EXPECT(libj2_j2u_eq_j2u(&r, &a));
}
}
}
return 0;
}
#endif
|
