Line data Source code
1 : // Copyright (c) 2011-2021 The Bitcoin Core developers
2 : // Distributed under the MIT software license, see the accompanying
3 : // file COPYING or http://www.opensource.org/licenses/mit-license.php.
4 :
5 : #include <arith_uint256.h>
6 : #include <uint256.h>
7 :
8 : #include <boost/test/unit_test.hpp>
9 :
10 : #include <cmath>
11 : #include <cstdint>
12 : #include <iomanip>
13 : #include <limits>
14 : #include <sstream>
15 : #include <string>
16 : #include <vector>
17 :
18 146 : BOOST_AUTO_TEST_SUITE(arith_uint256_tests)
19 :
20 : /// Convert vector to arith_uint256, via uint256 blob
21 2032 : static inline arith_uint256 arith_uint256V(const std::vector<unsigned char>& vch)
22 : {
23 2032 : return UintToArith256(uint256(vch));
24 : }
25 14 : static inline arith_uint256 arith_uint256S(const std::string& str) { return UintToArith256(uint256S(str)); }
26 :
27 : const unsigned char R1Array[] =
28 : "\x9c\x52\x4a\xdb\xcf\x56\x11\x12\x2b\x29\x12\x5e\x5d\x35\xd2\xd2"
29 : "\x22\x81\xaa\xb5\x33\xf0\x08\x32\xd5\x56\xb1\xf9\xea\xe5\x1d\x7d";
30 : const char R1ArrayHex[] = "7D1DE5EAF9B156D53208F033B5AA8122D2d2355d5e12292b121156cfdb4a529c";
31 : const double R1Ldouble = 0.4887374590559308955; // R1L equals roughly R1Ldouble * 2^256
32 146 : const arith_uint256 R1L = arith_uint256V(std::vector<unsigned char>(R1Array,R1Array+32));
33 : const uint64_t R1LLow64 = 0x121156cfdb4a529cULL;
34 :
35 : const unsigned char R2Array[] =
36 : "\x70\x32\x1d\x7c\x47\xa5\x6b\x40\x26\x7e\x0a\xc3\xa6\x9c\xb6\xbf"
37 : "\x13\x30\x47\xa3\x19\x2d\xda\x71\x49\x13\x72\xf0\xb4\xca\x81\xd7";
38 146 : const arith_uint256 R2L = arith_uint256V(std::vector<unsigned char>(R2Array,R2Array+32));
39 :
40 : const char R1LplusR2L[] = "549FB09FEA236A1EA3E31D4D58F1B1369288D204211CA751527CFC175767850C";
41 :
42 : const unsigned char ZeroArray[] =
43 : "\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00"
44 : "\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00";
45 146 : const arith_uint256 ZeroL = arith_uint256V(std::vector<unsigned char>(ZeroArray,ZeroArray+32));
46 :
47 : const unsigned char OneArray[] =
48 : "\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00"
49 : "\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00";
50 146 : const arith_uint256 OneL = arith_uint256V(std::vector<unsigned char>(OneArray,OneArray+32));
51 :
52 : const unsigned char MaxArray[] =
53 : "\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff"
54 : "\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff";
55 146 : const arith_uint256 MaxL = arith_uint256V(std::vector<unsigned char>(MaxArray,MaxArray+32));
56 :
57 146 : const arith_uint256 HalfL = (OneL << 255);
58 6 : static std::string ArrayToString(const unsigned char A[], unsigned int width)
59 : {
60 6 : std::stringstream Stream;
61 6 : Stream << std::hex;
62 198 : for (unsigned int i = 0; i < width; ++i)
63 : {
64 192 : Stream<<std::setw(2)<<std::setfill('0')<<(unsigned int)A[width-i-1];
65 192 : }
66 6 : return Stream.str();
67 6 : }
68 :
69 148 : BOOST_AUTO_TEST_CASE( basics ) // constructors, equality, inequality
70 : {
71 1 : BOOST_CHECK(1 == 0+1);
72 : // constructor arith_uint256(vector<char>):
73 1 : BOOST_CHECK(R1L.ToString() == ArrayToString(R1Array,32));
74 1 : BOOST_CHECK(R2L.ToString() == ArrayToString(R2Array,32));
75 1 : BOOST_CHECK(ZeroL.ToString() == ArrayToString(ZeroArray,32));
76 1 : BOOST_CHECK(OneL.ToString() == ArrayToString(OneArray,32));
77 1 : BOOST_CHECK(MaxL.ToString() == ArrayToString(MaxArray,32));
78 1 : BOOST_CHECK(OneL.ToString() != ArrayToString(ZeroArray,32));
79 :
80 : // == and !=
81 1 : BOOST_CHECK(R1L != R2L);
82 1 : BOOST_CHECK(ZeroL != OneL);
83 1 : BOOST_CHECK(OneL != ZeroL);
84 1 : BOOST_CHECK(MaxL != ZeroL);
85 1 : BOOST_CHECK(~MaxL == ZeroL);
86 1 : BOOST_CHECK( ((R1L ^ R2L) ^ R1L) == R2L);
87 :
88 1 : uint64_t Tmp64 = 0xc4dab720d9c7acaaULL;
89 257 : for (unsigned int i = 0; i < 256; ++i)
90 : {
91 256 : BOOST_CHECK(ZeroL != (OneL << i));
92 256 : BOOST_CHECK((OneL << i) != ZeroL);
93 256 : BOOST_CHECK(R1L != (R1L ^ (OneL << i)));
94 256 : BOOST_CHECK(((arith_uint256(Tmp64) ^ (OneL << i) ) != Tmp64 ));
95 256 : }
96 1 : BOOST_CHECK(ZeroL == (OneL << 256));
97 :
98 : // String Constructor and Copy Constructor
99 1 : BOOST_CHECK(arith_uint256S("0x" + R1L.ToString()) == R1L);
100 1 : BOOST_CHECK(arith_uint256S("0x" + R2L.ToString()) == R2L);
101 1 : BOOST_CHECK(arith_uint256S("0x" + ZeroL.ToString()) == ZeroL);
102 1 : BOOST_CHECK(arith_uint256S("0x" + OneL.ToString()) == OneL);
103 1 : BOOST_CHECK(arith_uint256S("0x" + MaxL.ToString()) == MaxL);
104 1 : BOOST_CHECK(arith_uint256S(R1L.ToString()) == R1L);
105 1 : BOOST_CHECK(arith_uint256S(" 0x" + R1L.ToString() + " ") == R1L);
106 1 : BOOST_CHECK(arith_uint256S("") == ZeroL);
107 1 : BOOST_CHECK(R1L == arith_uint256S(R1ArrayHex));
108 1 : BOOST_CHECK(arith_uint256(R1L) == R1L);
109 1 : BOOST_CHECK((arith_uint256(R1L^R2L)^R2L) == R1L);
110 1 : BOOST_CHECK(arith_uint256(ZeroL) == ZeroL);
111 1 : BOOST_CHECK(arith_uint256(OneL) == OneL);
112 :
113 : // uint64_t constructor
114 1 : BOOST_CHECK((R1L & arith_uint256S("0xffffffffffffffff")) == arith_uint256(R1LLow64));
115 1 : BOOST_CHECK(ZeroL == arith_uint256(0));
116 1 : BOOST_CHECK(OneL == arith_uint256(1));
117 1 : BOOST_CHECK(arith_uint256S("0xffffffffffffffff") == arith_uint256(0xffffffffffffffffULL));
118 :
119 : // Assignment (from base_uint)
120 1 : arith_uint256 tmpL = ~ZeroL; BOOST_CHECK(tmpL == ~ZeroL);
121 1 : tmpL = ~OneL; BOOST_CHECK(tmpL == ~OneL);
122 1 : tmpL = ~R1L; BOOST_CHECK(tmpL == ~R1L);
123 1 : tmpL = ~R2L; BOOST_CHECK(tmpL == ~R2L);
124 1 : tmpL = ~MaxL; BOOST_CHECK(tmpL == ~MaxL);
125 1 : }
126 :
127 512 : static void shiftArrayRight(unsigned char* to, const unsigned char* from, unsigned int arrayLength, unsigned int bitsToShift)
128 : {
129 16896 : for (unsigned int T=0; T < arrayLength; ++T)
130 : {
131 16384 : unsigned int F = (T+bitsToShift/8);
132 16384 : if (F < arrayLength)
133 8448 : to[T] = uint8_t(from[F] >> (bitsToShift % 8));
134 : else
135 7936 : to[T] = 0;
136 16384 : if (F + 1 < arrayLength)
137 7936 : to[T] |= uint8_t(from[(F + 1)] << (8 - bitsToShift % 8));
138 16384 : }
139 512 : }
140 :
141 768 : static void shiftArrayLeft(unsigned char* to, const unsigned char* from, unsigned int arrayLength, unsigned int bitsToShift)
142 : {
143 25344 : for (unsigned int T=0; T < arrayLength; ++T)
144 : {
145 24576 : if (T >= bitsToShift/8)
146 : {
147 12672 : unsigned int F = T-bitsToShift/8;
148 12672 : to[T] = uint8_t(from[F] << (bitsToShift % 8));
149 12672 : if (T >= bitsToShift/8+1)
150 11904 : to[T] |= uint8_t(from[F - 1] >> (8 - bitsToShift % 8));
151 12672 : }
152 : else {
153 11904 : to[T] = 0;
154 : }
155 24576 : }
156 768 : }
157 :
158 148 : BOOST_AUTO_TEST_CASE( shifts ) { // "<<" ">>" "<<=" ">>="
159 : unsigned char TmpArray[32];
160 1 : arith_uint256 TmpL;
161 257 : for (unsigned int i = 0; i < 256; ++i)
162 : {
163 256 : shiftArrayLeft(TmpArray, OneArray, 32, i);
164 256 : BOOST_CHECK(arith_uint256V(std::vector<unsigned char>(TmpArray,TmpArray+32)) == (OneL << i));
165 256 : TmpL = OneL; TmpL <<= i;
166 256 : BOOST_CHECK(TmpL == (OneL << i));
167 256 : BOOST_CHECK((HalfL >> (255-i)) == (OneL << i));
168 256 : TmpL = HalfL; TmpL >>= (255-i);
169 256 : BOOST_CHECK(TmpL == (OneL << i));
170 :
171 256 : shiftArrayLeft(TmpArray, R1Array, 32, i);
172 256 : BOOST_CHECK(arith_uint256V(std::vector<unsigned char>(TmpArray,TmpArray+32)) == (R1L << i));
173 256 : TmpL = R1L; TmpL <<= i;
174 256 : BOOST_CHECK(TmpL == (R1L << i));
175 :
176 256 : shiftArrayRight(TmpArray, R1Array, 32, i);
177 256 : BOOST_CHECK(arith_uint256V(std::vector<unsigned char>(TmpArray,TmpArray+32)) == (R1L >> i));
178 256 : TmpL = R1L; TmpL >>= i;
179 256 : BOOST_CHECK(TmpL == (R1L >> i));
180 :
181 256 : shiftArrayLeft(TmpArray, MaxArray, 32, i);
182 256 : BOOST_CHECK(arith_uint256V(std::vector<unsigned char>(TmpArray,TmpArray+32)) == (MaxL << i));
183 256 : TmpL = MaxL; TmpL <<= i;
184 256 : BOOST_CHECK(TmpL == (MaxL << i));
185 :
186 256 : shiftArrayRight(TmpArray, MaxArray, 32, i);
187 256 : BOOST_CHECK(arith_uint256V(std::vector<unsigned char>(TmpArray,TmpArray+32)) == (MaxL >> i));
188 256 : TmpL = MaxL; TmpL >>= i;
189 256 : BOOST_CHECK(TmpL == (MaxL >> i));
190 256 : }
191 1 : arith_uint256 c1L = arith_uint256(0x0123456789abcdefULL);
192 1 : arith_uint256 c2L = c1L << 128;
193 129 : for (unsigned int i = 0; i < 128; ++i) {
194 128 : BOOST_CHECK((c1L << i) == (c2L >> (128-i)));
195 128 : }
196 129 : for (unsigned int i = 128; i < 256; ++i) {
197 128 : BOOST_CHECK((c1L << i) == (c2L << (i-128)));
198 128 : }
199 1 : }
200 :
201 148 : BOOST_AUTO_TEST_CASE( unaryOperators ) // ! ~ -
202 : {
203 1 : BOOST_CHECK(~ZeroL == MaxL);
204 :
205 : unsigned char TmpArray[32];
206 33 : for (unsigned int i = 0; i < 32; ++i) { TmpArray[i] = uint8_t(~R1Array[i]); }
207 1 : BOOST_CHECK(arith_uint256V(std::vector<unsigned char>(TmpArray,TmpArray+32)) == (~R1L));
208 :
209 1 : BOOST_CHECK(-ZeroL == ZeroL);
210 1 : BOOST_CHECK(-R1L == (~R1L)+1);
211 257 : for (unsigned int i = 0; i < 256; ++i)
212 256 : BOOST_CHECK(-(OneL<<i) == (MaxL << i));
213 1 : }
214 :
215 :
216 : // Check if doing _A_ _OP_ _B_ results in the same as applying _OP_ onto each
217 : // element of Aarray and Barray, and then converting the result into an arith_uint256.
218 : #define CHECKBITWISEOPERATOR(_A_,_B_,_OP_) \
219 : for (unsigned int i = 0; i < 32; ++i) { TmpArray[i] = uint8_t(_A_##Array[i] _OP_ _B_##Array[i]); } \
220 : BOOST_CHECK(arith_uint256V(std::vector<unsigned char>(TmpArray,TmpArray+32)) == (_A_##L _OP_ _B_##L));
221 :
222 : #define CHECKASSIGNMENTOPERATOR(_A_,_B_,_OP_) \
223 : TmpL = _A_##L; TmpL _OP_##= _B_##L; BOOST_CHECK(TmpL == (_A_##L _OP_ _B_##L));
224 :
225 148 : BOOST_AUTO_TEST_CASE( bitwiseOperators )
226 : {
227 : unsigned char TmpArray[32];
228 :
229 33 : CHECKBITWISEOPERATOR(R1,R2,|)
230 33 : CHECKBITWISEOPERATOR(R1,R2,^)
231 33 : CHECKBITWISEOPERATOR(R1,R2,&)
232 33 : CHECKBITWISEOPERATOR(R1,Zero,|)
233 33 : CHECKBITWISEOPERATOR(R1,Zero,^)
234 33 : CHECKBITWISEOPERATOR(R1,Zero,&)
235 33 : CHECKBITWISEOPERATOR(R1,Max,|)
236 33 : CHECKBITWISEOPERATOR(R1,Max,^)
237 33 : CHECKBITWISEOPERATOR(R1,Max,&)
238 33 : CHECKBITWISEOPERATOR(Zero,R1,|)
239 33 : CHECKBITWISEOPERATOR(Zero,R1,^)
240 33 : CHECKBITWISEOPERATOR(Zero,R1,&)
241 33 : CHECKBITWISEOPERATOR(Max,R1,|)
242 33 : CHECKBITWISEOPERATOR(Max,R1,^)
243 33 : CHECKBITWISEOPERATOR(Max,R1,&)
244 :
245 1 : arith_uint256 TmpL;
246 1 : CHECKASSIGNMENTOPERATOR(R1,R2,|)
247 1 : CHECKASSIGNMENTOPERATOR(R1,R2,^)
248 1 : CHECKASSIGNMENTOPERATOR(R1,R2,&)
249 1 : CHECKASSIGNMENTOPERATOR(R1,Zero,|)
250 1 : CHECKASSIGNMENTOPERATOR(R1,Zero,^)
251 1 : CHECKASSIGNMENTOPERATOR(R1,Zero,&)
252 1 : CHECKASSIGNMENTOPERATOR(R1,Max,|)
253 1 : CHECKASSIGNMENTOPERATOR(R1,Max,^)
254 1 : CHECKASSIGNMENTOPERATOR(R1,Max,&)
255 1 : CHECKASSIGNMENTOPERATOR(Zero,R1,|)
256 1 : CHECKASSIGNMENTOPERATOR(Zero,R1,^)
257 1 : CHECKASSIGNMENTOPERATOR(Zero,R1,&)
258 1 : CHECKASSIGNMENTOPERATOR(Max,R1,|)
259 1 : CHECKASSIGNMENTOPERATOR(Max,R1,^)
260 1 : CHECKASSIGNMENTOPERATOR(Max,R1,&)
261 :
262 1 : uint64_t Tmp64 = 0xe1db685c9a0b47a2ULL;
263 1 : TmpL = R1L; TmpL |= Tmp64; BOOST_CHECK(TmpL == (R1L | arith_uint256(Tmp64)));
264 1 : TmpL = R1L; TmpL |= 0; BOOST_CHECK(TmpL == R1L);
265 1 : TmpL ^= 0; BOOST_CHECK(TmpL == R1L);
266 1 : TmpL ^= Tmp64; BOOST_CHECK(TmpL == (R1L ^ arith_uint256(Tmp64)));
267 1 : }
268 :
269 148 : BOOST_AUTO_TEST_CASE( comparison ) // <= >= < >
270 : {
271 1 : arith_uint256 TmpL;
272 257 : for (unsigned int i = 0; i < 256; ++i) {
273 256 : TmpL= OneL<< i;
274 256 : BOOST_CHECK( TmpL >= ZeroL && TmpL > ZeroL && ZeroL < TmpL && ZeroL <= TmpL);
275 256 : BOOST_CHECK( TmpL >= 0 && TmpL > 0 && 0 < TmpL && 0 <= TmpL);
276 256 : TmpL |= R1L;
277 256 : BOOST_CHECK( TmpL >= R1L ); BOOST_CHECK( (TmpL == R1L) != (TmpL > R1L)); BOOST_CHECK( (TmpL == R1L) || !( TmpL <= R1L));
278 256 : BOOST_CHECK( R1L <= TmpL ); BOOST_CHECK( (R1L == TmpL) != (R1L < TmpL)); BOOST_CHECK( (TmpL == R1L) || !( R1L >= TmpL));
279 256 : BOOST_CHECK(! (TmpL < R1L)); BOOST_CHECK(! (R1L > TmpL));
280 256 : }
281 1 : }
282 :
283 148 : BOOST_AUTO_TEST_CASE( plusMinus )
284 : {
285 1 : arith_uint256 TmpL = 0;
286 1 : BOOST_CHECK(R1L + R2L == arith_uint256S(R1LplusR2L));
287 1 : TmpL += R1L;
288 1 : BOOST_CHECK(TmpL == R1L);
289 1 : TmpL += R2L;
290 1 : BOOST_CHECK(TmpL == R1L + R2L);
291 1 : BOOST_CHECK(OneL+MaxL == ZeroL);
292 1 : BOOST_CHECK(MaxL+OneL == ZeroL);
293 256 : for (unsigned int i = 1; i < 256; ++i) {
294 255 : BOOST_CHECK( (MaxL >> i) + OneL == (HalfL >> (i-1)) );
295 255 : BOOST_CHECK( OneL + (MaxL >> i) == (HalfL >> (i-1)) );
296 255 : TmpL = (MaxL>>i); TmpL += OneL;
297 255 : BOOST_CHECK( TmpL == (HalfL >> (i-1)) );
298 255 : TmpL = (MaxL>>i); TmpL += 1;
299 255 : BOOST_CHECK( TmpL == (HalfL >> (i-1)) );
300 255 : TmpL = (MaxL>>i);
301 255 : BOOST_CHECK( TmpL++ == (MaxL>>i) );
302 255 : BOOST_CHECK( TmpL == (HalfL >> (i-1)));
303 255 : }
304 1 : BOOST_CHECK(arith_uint256(0xbedc77e27940a7ULL) + 0xee8d836fce66fbULL == arith_uint256(0xbedc77e27940a7ULL + 0xee8d836fce66fbULL));
305 1 : TmpL = arith_uint256(0xbedc77e27940a7ULL); TmpL += 0xee8d836fce66fbULL;
306 1 : BOOST_CHECK(TmpL == arith_uint256(0xbedc77e27940a7ULL+0xee8d836fce66fbULL));
307 1 : TmpL -= 0xee8d836fce66fbULL; BOOST_CHECK(TmpL == 0xbedc77e27940a7ULL);
308 1 : TmpL = R1L;
309 1 : BOOST_CHECK(++TmpL == R1L+1);
310 :
311 1 : BOOST_CHECK(R1L -(-R2L) == R1L+R2L);
312 1 : BOOST_CHECK(R1L -(-OneL) == R1L+OneL);
313 1 : BOOST_CHECK(R1L - OneL == R1L+(-OneL));
314 256 : for (unsigned int i = 1; i < 256; ++i) {
315 255 : BOOST_CHECK((MaxL>>i) - (-OneL) == (HalfL >> (i-1)));
316 255 : BOOST_CHECK((HalfL >> (i-1)) - OneL == (MaxL>>i));
317 255 : TmpL = (HalfL >> (i-1));
318 255 : BOOST_CHECK(TmpL-- == (HalfL >> (i-1)));
319 255 : BOOST_CHECK(TmpL == (MaxL >> i));
320 255 : TmpL = (HalfL >> (i-1));
321 255 : BOOST_CHECK(--TmpL == (MaxL >> i));
322 255 : }
323 1 : TmpL = R1L;
324 1 : BOOST_CHECK(--TmpL == R1L-1);
325 1 : }
326 :
327 148 : BOOST_AUTO_TEST_CASE( multiply )
328 : {
329 1 : BOOST_CHECK((R1L * R1L).ToString() == "62a38c0486f01e45879d7910a7761bf30d5237e9873f9bff3642a732c4d84f10");
330 1 : BOOST_CHECK((R1L * R2L).ToString() == "de37805e9986996cfba76ff6ba51c008df851987d9dd323f0e5de07760529c40");
331 1 : BOOST_CHECK((R1L * ZeroL) == ZeroL);
332 1 : BOOST_CHECK((R1L * OneL) == R1L);
333 1 : BOOST_CHECK((R1L * MaxL) == -R1L);
334 1 : BOOST_CHECK((R2L * R1L) == (R1L * R2L));
335 1 : BOOST_CHECK((R2L * R2L).ToString() == "ac8c010096767d3cae5005dec28bb2b45a1d85ab7996ccd3e102a650f74ff100");
336 1 : BOOST_CHECK((R2L * ZeroL) == ZeroL);
337 1 : BOOST_CHECK((R2L * OneL) == R2L);
338 1 : BOOST_CHECK((R2L * MaxL) == -R2L);
339 :
340 1 : BOOST_CHECK(MaxL * MaxL == OneL);
341 :
342 1 : BOOST_CHECK((R1L * 0) == 0);
343 1 : BOOST_CHECK((R1L * 1) == R1L);
344 1 : BOOST_CHECK((R1L * 3).ToString() == "7759b1c0ed14047f961ad09b20ff83687876a0181a367b813634046f91def7d4");
345 1 : BOOST_CHECK((R2L * 0x87654321UL).ToString() == "23f7816e30c4ae2017257b7a0fa64d60402f5234d46e746b61c960d09a26d070");
346 1 : }
347 :
348 148 : BOOST_AUTO_TEST_CASE( divide )
349 : {
350 1 : arith_uint256 D1L{arith_uint256S("AD7133AC1977FA2B7")};
351 1 : arith_uint256 D2L{arith_uint256S("ECD751716")};
352 1 : BOOST_CHECK((R1L / D1L).ToString() == "00000000000000000b8ac01106981635d9ed112290f8895545a7654dde28fb3a");
353 1 : BOOST_CHECK((R1L / D2L).ToString() == "000000000873ce8efec5b67150bad3aa8c5fcb70e947586153bf2cec7c37c57a");
354 1 : BOOST_CHECK(R1L / OneL == R1L);
355 1 : BOOST_CHECK(R1L / MaxL == ZeroL);
356 1 : BOOST_CHECK(MaxL / R1L == 2);
357 2 : BOOST_CHECK_THROW(R1L / ZeroL, uint_error);
358 1 : BOOST_CHECK((R2L / D1L).ToString() == "000000000000000013e1665895a1cc981de6d93670105a6b3ec3b73141b3a3c5");
359 1 : BOOST_CHECK((R2L / D2L).ToString() == "000000000e8f0abe753bb0afe2e9437ee85d280be60882cf0bd1aaf7fa3cc2c4");
360 1 : BOOST_CHECK(R2L / OneL == R2L);
361 1 : BOOST_CHECK(R2L / MaxL == ZeroL);
362 1 : BOOST_CHECK(MaxL / R2L == 1);
363 2 : BOOST_CHECK_THROW(R2L / ZeroL, uint_error);
364 :
365 : // The integer-divisor overload must be bit-identical to dividing by the same
366 : // value widened to arith_uint256, for both the fast word-wise path
367 : // (<= uint32 max) and the arith_uint256 fallback above it.
368 8 : for (uint64_t d : {uint64_t{1}, uint64_t{2}, uint64_t{24}, uint64_t{3600},
369 : uint64_t{std::numeric_limits<uint32_t>::max()},
370 : uint64_t{std::numeric_limits<uint32_t>::max()} + 1,
371 : uint64_t{0xFEDCBA9876543210}}) {
372 7 : BOOST_CHECK(R1L / d == R1L / arith_uint256(d));
373 7 : BOOST_CHECK(R2L / d == R2L / arith_uint256(d));
374 7 : BOOST_CHECK(MaxL / d == MaxL / arith_uint256(d));
375 : }
376 2 : BOOST_CHECK_THROW(R1L / uint64_t{0}, uint_error);
377 4 : }
378 :
379 :
380 203 : static bool almostEqual(double d1, double d2)
381 : {
382 203 : return fabs(d1-d2) <= 4*fabs(d1)*std::numeric_limits<double>::epsilon();
383 : }
384 :
385 148 : BOOST_AUTO_TEST_CASE(methods) // GetHex operator= size() GetLow64 GetSerializeSize, Serialize, Unserialize
386 : {
387 1 : BOOST_CHECK(R1L.GetHex() == R1L.ToString());
388 1 : BOOST_CHECK(R2L.GetHex() == R2L.ToString());
389 1 : BOOST_CHECK(OneL.GetHex() == OneL.ToString());
390 1 : BOOST_CHECK(MaxL.GetHex() == MaxL.ToString());
391 1 : arith_uint256 TmpL(R1L);
392 1 : BOOST_CHECK(TmpL == R1L);
393 1 : TmpL = R2L;
394 1 : BOOST_CHECK(TmpL == R2L);
395 1 : TmpL = ZeroL;
396 1 : BOOST_CHECK(TmpL == 0);
397 1 : TmpL = HalfL;
398 1 : BOOST_CHECK(TmpL == HalfL);
399 :
400 1 : TmpL = R1L;
401 1 : BOOST_CHECK(R1L.size() == 32);
402 1 : BOOST_CHECK(R2L.size() == 32);
403 1 : BOOST_CHECK(ZeroL.size() == 32);
404 1 : BOOST_CHECK(MaxL.size() == 32);
405 1 : BOOST_CHECK(R1L.GetLow64() == R1LLow64);
406 1 : BOOST_CHECK(HalfL.GetLow64() ==0x0000000000000000ULL);
407 1 : BOOST_CHECK(OneL.GetLow64() ==0x0000000000000001ULL);
408 :
409 256 : for (unsigned int i = 0; i < 255; ++i)
410 : {
411 255 : BOOST_CHECK((OneL << i).getdouble() == ldexp(1.0,i));
412 255 : }
413 1 : BOOST_CHECK(ZeroL.getdouble() == 0.0);
414 204 : for (int i = 256; i > 53; --i)
415 203 : BOOST_CHECK(almostEqual((R1L>>(256-i)).getdouble(), ldexp(R1Ldouble,i)));
416 1 : uint64_t R1L64part = (R1L>>192).GetLow64();
417 54 : for (int i = 53; i > 0; --i) // doubles can store all integers in {0,...,2^54-1} exactly
418 : {
419 53 : BOOST_CHECK((R1L>>(256-i)).getdouble() == (double)(R1L64part >> (64-i)));
420 53 : }
421 1 : }
422 :
423 148 : BOOST_AUTO_TEST_CASE(bignum_SetCompact)
424 : {
425 1 : arith_uint256 num;
426 : bool fNegative;
427 : bool fOverflow;
428 1 : num.SetCompact(0, &fNegative, &fOverflow);
429 1 : BOOST_CHECK_EQUAL(num.GetHex(), "0000000000000000000000000000000000000000000000000000000000000000");
430 1 : BOOST_CHECK_EQUAL(num.GetCompact(), 0U);
431 1 : BOOST_CHECK_EQUAL(fNegative, false);
432 1 : BOOST_CHECK_EQUAL(fOverflow, false);
433 :
434 1 : num.SetCompact(0x00123456, &fNegative, &fOverflow);
435 1 : BOOST_CHECK_EQUAL(num.GetHex(), "0000000000000000000000000000000000000000000000000000000000000000");
436 1 : BOOST_CHECK_EQUAL(num.GetCompact(), 0U);
437 1 : BOOST_CHECK_EQUAL(fNegative, false);
438 1 : BOOST_CHECK_EQUAL(fOverflow, false);
439 :
440 1 : num.SetCompact(0x01003456, &fNegative, &fOverflow);
441 1 : BOOST_CHECK_EQUAL(num.GetHex(), "0000000000000000000000000000000000000000000000000000000000000000");
442 1 : BOOST_CHECK_EQUAL(num.GetCompact(), 0U);
443 1 : BOOST_CHECK_EQUAL(fNegative, false);
444 1 : BOOST_CHECK_EQUAL(fOverflow, false);
445 :
446 1 : num.SetCompact(0x02000056, &fNegative, &fOverflow);
447 1 : BOOST_CHECK_EQUAL(num.GetHex(), "0000000000000000000000000000000000000000000000000000000000000000");
448 1 : BOOST_CHECK_EQUAL(num.GetCompact(), 0U);
449 1 : BOOST_CHECK_EQUAL(fNegative, false);
450 1 : BOOST_CHECK_EQUAL(fOverflow, false);
451 :
452 1 : num.SetCompact(0x03000000, &fNegative, &fOverflow);
453 1 : BOOST_CHECK_EQUAL(num.GetHex(), "0000000000000000000000000000000000000000000000000000000000000000");
454 1 : BOOST_CHECK_EQUAL(num.GetCompact(), 0U);
455 1 : BOOST_CHECK_EQUAL(fNegative, false);
456 1 : BOOST_CHECK_EQUAL(fOverflow, false);
457 :
458 1 : num.SetCompact(0x04000000, &fNegative, &fOverflow);
459 1 : BOOST_CHECK_EQUAL(num.GetHex(), "0000000000000000000000000000000000000000000000000000000000000000");
460 1 : BOOST_CHECK_EQUAL(num.GetCompact(), 0U);
461 1 : BOOST_CHECK_EQUAL(fNegative, false);
462 1 : BOOST_CHECK_EQUAL(fOverflow, false);
463 :
464 1 : num.SetCompact(0x00923456, &fNegative, &fOverflow);
465 1 : BOOST_CHECK_EQUAL(num.GetHex(), "0000000000000000000000000000000000000000000000000000000000000000");
466 1 : BOOST_CHECK_EQUAL(num.GetCompact(), 0U);
467 1 : BOOST_CHECK_EQUAL(fNegative, false);
468 1 : BOOST_CHECK_EQUAL(fOverflow, false);
469 :
470 1 : num.SetCompact(0x01803456, &fNegative, &fOverflow);
471 1 : BOOST_CHECK_EQUAL(num.GetHex(), "0000000000000000000000000000000000000000000000000000000000000000");
472 1 : BOOST_CHECK_EQUAL(num.GetCompact(), 0U);
473 1 : BOOST_CHECK_EQUAL(fNegative, false);
474 1 : BOOST_CHECK_EQUAL(fOverflow, false);
475 :
476 1 : num.SetCompact(0x02800056, &fNegative, &fOverflow);
477 1 : BOOST_CHECK_EQUAL(num.GetHex(), "0000000000000000000000000000000000000000000000000000000000000000");
478 1 : BOOST_CHECK_EQUAL(num.GetCompact(), 0U);
479 1 : BOOST_CHECK_EQUAL(fNegative, false);
480 1 : BOOST_CHECK_EQUAL(fOverflow, false);
481 :
482 1 : num.SetCompact(0x03800000, &fNegative, &fOverflow);
483 1 : BOOST_CHECK_EQUAL(num.GetHex(), "0000000000000000000000000000000000000000000000000000000000000000");
484 1 : BOOST_CHECK_EQUAL(num.GetCompact(), 0U);
485 1 : BOOST_CHECK_EQUAL(fNegative, false);
486 1 : BOOST_CHECK_EQUAL(fOverflow, false);
487 :
488 1 : num.SetCompact(0x04800000, &fNegative, &fOverflow);
489 1 : BOOST_CHECK_EQUAL(num.GetHex(), "0000000000000000000000000000000000000000000000000000000000000000");
490 1 : BOOST_CHECK_EQUAL(num.GetCompact(), 0U);
491 1 : BOOST_CHECK_EQUAL(fNegative, false);
492 1 : BOOST_CHECK_EQUAL(fOverflow, false);
493 :
494 1 : num.SetCompact(0x01123456, &fNegative, &fOverflow);
495 1 : BOOST_CHECK_EQUAL(num.GetHex(), "0000000000000000000000000000000000000000000000000000000000000012");
496 1 : BOOST_CHECK_EQUAL(num.GetCompact(), 0x01120000U);
497 1 : BOOST_CHECK_EQUAL(fNegative, false);
498 1 : BOOST_CHECK_EQUAL(fOverflow, false);
499 :
500 : // Make sure that we don't generate compacts with the 0x00800000 bit set
501 1 : num = 0x80;
502 1 : BOOST_CHECK_EQUAL(num.GetCompact(), 0x02008000U);
503 :
504 1 : num.SetCompact(0x01fedcba, &fNegative, &fOverflow);
505 1 : BOOST_CHECK_EQUAL(num.GetHex(), "000000000000000000000000000000000000000000000000000000000000007e");
506 1 : BOOST_CHECK_EQUAL(num.GetCompact(true), 0x01fe0000U);
507 1 : BOOST_CHECK_EQUAL(fNegative, true);
508 1 : BOOST_CHECK_EQUAL(fOverflow, false);
509 :
510 1 : num.SetCompact(0x02123456, &fNegative, &fOverflow);
511 1 : BOOST_CHECK_EQUAL(num.GetHex(), "0000000000000000000000000000000000000000000000000000000000001234");
512 1 : BOOST_CHECK_EQUAL(num.GetCompact(), 0x02123400U);
513 1 : BOOST_CHECK_EQUAL(fNegative, false);
514 1 : BOOST_CHECK_EQUAL(fOverflow, false);
515 :
516 1 : num.SetCompact(0x03123456, &fNegative, &fOverflow);
517 1 : BOOST_CHECK_EQUAL(num.GetHex(), "0000000000000000000000000000000000000000000000000000000000123456");
518 1 : BOOST_CHECK_EQUAL(num.GetCompact(), 0x03123456U);
519 1 : BOOST_CHECK_EQUAL(fNegative, false);
520 1 : BOOST_CHECK_EQUAL(fOverflow, false);
521 :
522 1 : num.SetCompact(0x04123456, &fNegative, &fOverflow);
523 1 : BOOST_CHECK_EQUAL(num.GetHex(), "0000000000000000000000000000000000000000000000000000000012345600");
524 1 : BOOST_CHECK_EQUAL(num.GetCompact(), 0x04123456U);
525 1 : BOOST_CHECK_EQUAL(fNegative, false);
526 1 : BOOST_CHECK_EQUAL(fOverflow, false);
527 :
528 1 : num.SetCompact(0x04923456, &fNegative, &fOverflow);
529 1 : BOOST_CHECK_EQUAL(num.GetHex(), "0000000000000000000000000000000000000000000000000000000012345600");
530 1 : BOOST_CHECK_EQUAL(num.GetCompact(true), 0x04923456U);
531 1 : BOOST_CHECK_EQUAL(fNegative, true);
532 1 : BOOST_CHECK_EQUAL(fOverflow, false);
533 :
534 1 : num.SetCompact(0x05009234, &fNegative, &fOverflow);
535 1 : BOOST_CHECK_EQUAL(num.GetHex(), "0000000000000000000000000000000000000000000000000000000092340000");
536 1 : BOOST_CHECK_EQUAL(num.GetCompact(), 0x05009234U);
537 1 : BOOST_CHECK_EQUAL(fNegative, false);
538 1 : BOOST_CHECK_EQUAL(fOverflow, false);
539 :
540 1 : num.SetCompact(0x20123456, &fNegative, &fOverflow);
541 1 : BOOST_CHECK_EQUAL(num.GetHex(), "1234560000000000000000000000000000000000000000000000000000000000");
542 1 : BOOST_CHECK_EQUAL(num.GetCompact(), 0x20123456U);
543 1 : BOOST_CHECK_EQUAL(fNegative, false);
544 1 : BOOST_CHECK_EQUAL(fOverflow, false);
545 :
546 1 : num.SetCompact(0xff123456, &fNegative, &fOverflow);
547 1 : BOOST_CHECK_EQUAL(fNegative, false);
548 1 : BOOST_CHECK_EQUAL(fOverflow, true);
549 1 : }
550 :
551 :
552 148 : BOOST_AUTO_TEST_CASE( getmaxcoverage ) // some more tests just to get 100% coverage
553 : {
554 : // ~R1L give a base_uint<256>
555 1 : BOOST_CHECK((~~R1L >> 10) == (R1L >> 10));
556 1 : BOOST_CHECK((~~R1L << 10) == (R1L << 10));
557 1 : BOOST_CHECK(!(~~R1L < R1L));
558 1 : BOOST_CHECK(~~R1L <= R1L);
559 1 : BOOST_CHECK(!(~~R1L > R1L));
560 1 : BOOST_CHECK(~~R1L >= R1L);
561 1 : BOOST_CHECK(!(R1L < ~~R1L));
562 1 : BOOST_CHECK(R1L <= ~~R1L);
563 1 : BOOST_CHECK(!(R1L > ~~R1L));
564 1 : BOOST_CHECK(R1L >= ~~R1L);
565 :
566 1 : BOOST_CHECK(~~R1L + R2L == R1L + ~~R2L);
567 1 : BOOST_CHECK(~~R1L - R2L == R1L - ~~R2L);
568 1 : BOOST_CHECK(~R1L != R1L); BOOST_CHECK(R1L != ~R1L);
569 : unsigned char TmpArray[32];
570 33 : CHECKBITWISEOPERATOR(~R1,R2,|)
571 33 : CHECKBITWISEOPERATOR(~R1,R2,^)
572 33 : CHECKBITWISEOPERATOR(~R1,R2,&)
573 33 : CHECKBITWISEOPERATOR(R1,~R2,|)
574 33 : CHECKBITWISEOPERATOR(R1,~R2,^)
575 33 : CHECKBITWISEOPERATOR(R1,~R2,&)
576 1 : }
577 :
578 146 : BOOST_AUTO_TEST_SUITE_END()
|
