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