mirror of
https://github.com/thunderbrewhq/squall.git
synced 2026-02-04 16:59:08 +00:00
616 lines
15 KiB
C++
616 lines
15 KiB
C++
// These are the original SBig tests which rely on internals
|
|
#include "test/BigTest.hpp"
|
|
#include "storm/big/BigData.hpp"
|
|
#include <string>
|
|
|
|
TEST_CASE("SBigAdd internal", "[big]") {
|
|
BigDataTest a, b, c;
|
|
|
|
SECTION("adds 0 and 1") {
|
|
SBigFromUnsigned(b, 0);
|
|
SBigFromUnsigned(c, 1);
|
|
|
|
SBigAdd(a, b, c);
|
|
|
|
CHECK(a->Primary().Count() == 1);
|
|
CHECK(a->Primary()[0] == 1);
|
|
}
|
|
|
|
SECTION("adds 1 and 2") {
|
|
SBigFromUnsigned(b, 1);
|
|
SBigFromUnsigned(c, 2);
|
|
|
|
SBigAdd(a, b, c);
|
|
|
|
CHECK(a->Primary().Count() == 1);
|
|
CHECK(a->Primary()[0] == 3);
|
|
}
|
|
|
|
SECTION("adds 0x12345678 and 0x23456789") {
|
|
SBigFromUnsigned(b, 0x12345678);
|
|
SBigFromUnsigned(c, 0x23456789);
|
|
|
|
SBigAdd(a, b, c);
|
|
|
|
CHECK(a->Primary().Count() == 1);
|
|
CHECK(a->Primary()[0] == 0x3579BE01);
|
|
}
|
|
|
|
SECTION("adds 0xFFFFFFFF and 0xF0F0F0F0") {
|
|
SBigFromUnsigned(b, 0xFFFFFFFF);
|
|
SBigFromUnsigned(c, 0xF0F0F0F0);
|
|
|
|
SBigAdd(a, b, c);
|
|
|
|
CHECK(a->Primary().Count() == 2);
|
|
CHECK(a->Primary()[0] == 0xF0F0F0EF);
|
|
CHECK(a->Primary()[1] == 0x1);
|
|
}
|
|
}
|
|
|
|
TEST_CASE("SBigAnd internal", "[big]") {
|
|
BigDataTest a, b, c;
|
|
|
|
SECTION("overwrites output") {
|
|
SBigFromUnsigned(a, 123456);
|
|
SBigFromUnsigned(b, 0);
|
|
SBigFromUnsigned(c, 0);
|
|
|
|
SBigAnd(a, b, c);
|
|
|
|
CHECK(a->Primary().Count() == 1);
|
|
CHECK(a->Primary()[0] == 0);
|
|
}
|
|
|
|
SECTION("performs bitwise and on large nums") {
|
|
uint8_t data[] = {
|
|
1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 31, 12, 13, 14, 15
|
|
};
|
|
uint8_t data2[] = {
|
|
0, 0, 0, 6, 6, 0, 6, 0, 0, 6, 0xFF, 6, 0, 6, 0
|
|
};
|
|
SBigFromBinary(b, data, sizeof(data));
|
|
SBigFromBinary(c, data2, sizeof(data2));
|
|
|
|
SBigAnd(a, b, c);
|
|
|
|
CHECK(a->Primary().Count() == 4);
|
|
CHECK(a->Primary()[0] == 0x04000000);
|
|
CHECK(a->Primary()[1] == 0x00060004);
|
|
CHECK(a->Primary()[2] == 0x041F0200);
|
|
CHECK(a->Primary()[3] == 0x00000600);
|
|
}
|
|
}
|
|
|
|
TEST_CASE("SBigCopy internal", "[big]") {
|
|
BigDataTest a, b;
|
|
|
|
SECTION("copies data") {
|
|
uint8_t num[] = { 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9 };
|
|
SBigFromBinary(a, num, sizeof(num));
|
|
SBigFromUnsigned(b, 42);
|
|
|
|
CHECK(a->Primary().Count() == 4);
|
|
|
|
SBigCopy(a, b);
|
|
|
|
CHECK(a->Primary().Count() == 1);
|
|
CHECK(a->Primary()[0] == 42);
|
|
}
|
|
}
|
|
|
|
TEST_CASE("SBigDec internal", "[big]") {
|
|
BigDataTest a, b;
|
|
|
|
SECTION("decrements value by 1") {
|
|
SBigFromUnsigned(b, 5);
|
|
|
|
SBigDec(a, b);
|
|
|
|
CHECK(a->Primary().Count() == 1);
|
|
CHECK(a->Primary()[0] == 4);
|
|
}
|
|
|
|
#ifdef NDEBUG
|
|
SECTION("decrements from 0") {
|
|
SBigFromUnsigned(b, 0);
|
|
|
|
SBigDec(a, b);
|
|
|
|
CHECK(a->Primary().Count() == 1);
|
|
CHECK(a->Primary()[0] == 0xFFFFFFFF);
|
|
}
|
|
#endif
|
|
}
|
|
|
|
TEST_CASE("SBigDiv internal", "[big]") {
|
|
BigDataTest a, b, c;
|
|
|
|
SECTION("divides 2 by 1") {
|
|
SBigFromUnsigned(b, 2);
|
|
SBigFromUnsigned(c, 1);
|
|
|
|
SBigDiv(a, b, c);
|
|
|
|
CHECK(a->Primary().Count() == 1);
|
|
CHECK(a->Primary()[0] == 2);
|
|
}
|
|
|
|
SECTION("divides 5 by 2") {
|
|
SBigFromUnsigned(b, 5);
|
|
SBigFromUnsigned(c, 2);
|
|
|
|
SBigDiv(a, b, c);
|
|
|
|
CHECK(a->Primary().Count() == 1);
|
|
CHECK(a->Primary()[0] == 2);
|
|
}
|
|
|
|
SECTION("divides 7 by 4") {
|
|
SBigFromUnsigned(b, 7);
|
|
SBigFromUnsigned(c, 4);
|
|
|
|
SBigDiv(a, b, c);
|
|
|
|
CHECK(a->Primary().Count() == 1);
|
|
CHECK(a->Primary()[0] == 1);
|
|
}
|
|
|
|
SECTION("divides 0x9999444488885555 by 0x2222") {
|
|
SBigFromStr(b, std::to_string(0x9999444488885555ULL).c_str());
|
|
SBigFromUnsigned(c, 0x2222);
|
|
|
|
SBigDiv(a, b, c);
|
|
|
|
CHECK(a->Primary().Count() == 2);
|
|
CHECK(a->Primary()[0] == 0x00040002);
|
|
CHECK(a->Primary()[1] == 0x48002);
|
|
}
|
|
|
|
SECTION("divides 0x9999444488885555 by 0xFFFFFFFF") {
|
|
SBigFromStr(b, std::to_string(0x9999444488885555ULL).c_str());
|
|
SBigFromUnsigned(c, 0xFFFFFFFF);
|
|
|
|
SBigDiv(a, b, c);
|
|
|
|
CHECK(a->Primary().Count() == 1);
|
|
CHECK(a->Primary()[0] == 0x99994445);
|
|
}
|
|
|
|
SECTION("divides 0x9999444488885555 by 0x1111222233334444 (buffer divisor)") {
|
|
SBigFromStr(b, std::to_string(0x9999444488885555ULL).c_str());
|
|
SBigFromStr(c, std::to_string(0x1111222233334444ULL).c_str());
|
|
|
|
SBigDiv(a, b, c);
|
|
|
|
CHECK(a->Primary().Count() == 1);
|
|
CHECK(a->Primary()[0] == 8);
|
|
}
|
|
}
|
|
|
|
TEST_CASE("SBigFromBinary internal", "[big]") {
|
|
BigDataTest num;
|
|
|
|
SECTION("creates bigdata from 0") {
|
|
uint32_t data = 0;
|
|
SBigFromBinary(num, reinterpret_cast<uint8_t*>(&data), sizeof(data));
|
|
|
|
CHECK(num->Primary().Count() == 1);
|
|
CHECK(num->Primary()[0] == 0);
|
|
}
|
|
|
|
SECTION("creates bigdata from 0x123456789ABCDEF0") {
|
|
uint64_t data = 0x123456789ABCDEF0;
|
|
SBigFromBinary(num, reinterpret_cast<uint8_t*>(&data), sizeof(data));
|
|
|
|
CHECK(num->Primary().Count() == 2);
|
|
CHECK(num->Primary()[0] == 0x9ABCDEF0);
|
|
CHECK(num->Primary()[1] == 0x12345678);
|
|
}
|
|
}
|
|
|
|
TEST_CASE("SBigFromStr internal", "[big]") {
|
|
BigDataTest num;
|
|
|
|
SECTION("with empty string") {
|
|
SBigFromStr(num, "");
|
|
|
|
CHECK(num->Primary().Count() == 0);
|
|
}
|
|
|
|
SECTION("with string containing numbers") {
|
|
SBigFromStr(num, "123456");
|
|
|
|
CHECK(num->Primary().Count() == 1);
|
|
CHECK(num->Primary()[0] == 123456);
|
|
}
|
|
|
|
SECTION("with string containing letters (original bug)") {
|
|
SBigFromStr(num, "ABC");
|
|
|
|
const unsigned int expected_num = ('A' - '0') * 100 + ('B' - '0') * 10 + ('C' - '0');
|
|
|
|
CHECK(num->Primary().Count() == 1);
|
|
CHECK(num->Primary()[0] == expected_num);
|
|
}
|
|
}
|
|
|
|
TEST_CASE("SBigFromUnsigned internal", "[big]") {
|
|
BigDataTest num;
|
|
|
|
SECTION("creates bigdata from 0") {
|
|
SBigFromUnsigned(num, 0);
|
|
|
|
CHECK(num->Primary().Count() == 1);
|
|
CHECK(num->Primary()[0] == 0);
|
|
}
|
|
|
|
SECTION("creates bigdata from 0x12345678") {
|
|
SBigFromUnsigned(num, 0x12345678);
|
|
|
|
CHECK(num->Primary().Count() == 1);
|
|
CHECK(num->Primary()[0] == 0x12345678);
|
|
}
|
|
}
|
|
TEST_CASE("SBigInc internal", "[big]") {
|
|
BigDataTest a, b;
|
|
|
|
SECTION("increments from 0") {
|
|
SBigFromUnsigned(b, 0);
|
|
|
|
SBigInc(a, b);
|
|
|
|
CHECK(a->Primary().Count() == 1);
|
|
CHECK(a->Primary()[0] == 1);
|
|
}
|
|
|
|
SECTION("increments from max uint") {
|
|
SBigFromUnsigned(b, UINT32_MAX);
|
|
|
|
SBigInc(a, b);
|
|
|
|
CHECK(a->Primary().Count() == 2);
|
|
CHECK(a->Primary()[0] == 0);
|
|
CHECK(a->Primary()[1] == 1);
|
|
}
|
|
|
|
SECTION("increments from a number") {
|
|
SBigFromUnsigned(b, 1337);
|
|
|
|
SBigInc(a, b);
|
|
|
|
CHECK(a->Primary().Count() == 1);
|
|
CHECK(a->Primary()[0] == 1338);
|
|
}
|
|
}
|
|
|
|
TEST_CASE("SBigMod internal", "[big]") {
|
|
BigDataTest a, b, c;
|
|
SECTION("mods 7 by 4") {
|
|
SBigFromUnsigned(b, 7);
|
|
SBigFromUnsigned(c, 4);
|
|
|
|
SBigMod(a, b, c);
|
|
|
|
a->Primary().Trim();
|
|
|
|
CHECK(a->Primary().Count() == 1);
|
|
CHECK(a->Primary()[0] == 3);
|
|
}
|
|
|
|
SECTION("mods 7 by 4 then mods 9 by 5") {
|
|
BigDataTest b1, c1, b2, c2;
|
|
|
|
SBigFromUnsigned(b1, 7);
|
|
SBigFromUnsigned(c1, 4);
|
|
SBigFromUnsigned(b2, 9);
|
|
SBigFromUnsigned(c2, 5);
|
|
|
|
SBigMod(a, b1, c1);
|
|
|
|
a->Primary().Trim();
|
|
|
|
CHECK(a->Primary().Count() == 1);
|
|
CHECK(a->Primary()[0] == 3);
|
|
|
|
SBigMod(a, b2, c2);
|
|
|
|
a->Primary().Trim();
|
|
|
|
CHECK(a->Primary().Count() == 1);
|
|
CHECK(a->Primary()[0] == 4);
|
|
}
|
|
|
|
SECTION("mods 0x9999444488885555 by 0xFFFFFFFF") {
|
|
uint64_t b_ = 0x9999444488885555;
|
|
SBigFromBinary(b, reinterpret_cast<uint8_t*>(&b_), sizeof(b_));
|
|
SBigFromUnsigned(c, 0xFFFFFFFF);
|
|
|
|
SBigMod(a, b, c);
|
|
|
|
a->Primary().Trim();
|
|
|
|
CHECK(a->Primary().Count() == 1);
|
|
CHECK(a->Primary()[0] == 0x2221999A);
|
|
}
|
|
}
|
|
|
|
TEST_CASE("SBigMul internal", "[big]") {
|
|
BigDataTest a, b, c;
|
|
|
|
SECTION("multiplies 0 and 1") {
|
|
SBigFromUnsigned(b, 0);
|
|
SBigFromUnsigned(c, 1);
|
|
|
|
SBigMul(a, b, c);
|
|
|
|
a->Primary().Trim();
|
|
|
|
CHECK(a->Primary().Count() == 0);
|
|
}
|
|
|
|
SECTION("multiplies 2 and 4") {
|
|
SBigFromUnsigned(b, 2);
|
|
SBigFromUnsigned(c, 4);
|
|
|
|
SBigMul(a, b, c);
|
|
|
|
a->Primary().Trim();
|
|
|
|
CHECK(a->Primary().Count() == 1);
|
|
CHECK(a->Primary()[0] == 8);
|
|
}
|
|
|
|
SECTION("multiplies 0xFFFFFFFF and 0x100") {
|
|
SBigFromUnsigned(b, 0xFFFFFFFF);
|
|
SBigFromUnsigned(c, 0x100);
|
|
|
|
SBigMul(a, b, c);
|
|
|
|
a->Primary().Trim();
|
|
|
|
CHECK(a->Primary().Count() == 2);
|
|
CHECK(a->Primary()[0] == 0xFFFFFF00);
|
|
CHECK(a->Primary()[1] == 0xFF);
|
|
}
|
|
|
|
SECTION("multiplies 0xFFFFFF and 0x11223344") {
|
|
SBigFromUnsigned(b, 0xFFFFFF);
|
|
SBigFromUnsigned(c, 0x11223344);
|
|
|
|
SBigMul(a, b, c);
|
|
|
|
a->Primary().Trim();
|
|
|
|
CHECK(a->Primary().Count() == 2);
|
|
CHECK(a->Primary()[0] == 0x32DDCCBC);
|
|
CHECK(a->Primary()[1] == 0x112233);
|
|
}
|
|
}
|
|
|
|
TEST_CASE("SBigPowMod internal", "[big]") {
|
|
BigDataTest a, b, c, d;
|
|
SECTION("takes 256 to the 8th power and mods the result by 999") {
|
|
SBigFromUnsigned(b, 256);
|
|
SBigFromUnsigned(c, 8);
|
|
SBigFromUnsigned(d, 999);
|
|
|
|
SBigPowMod(a, b, c, d);
|
|
|
|
a->Primary().Trim();
|
|
|
|
CHECK(a->Primary().Count() == 1);
|
|
CHECK(a->Primary()[0] == 160);
|
|
}
|
|
}
|
|
|
|
TEST_CASE("SBigNot internal", "[big]") {
|
|
BigDataTest a, b;
|
|
|
|
SECTION("bitwise negates small values") {
|
|
auto v = GENERATE(uint32_t(1), 2, 10, 0xFFFFFFFF);
|
|
|
|
SBigFromUnsigned(b, v);
|
|
SBigNot(a, b);
|
|
|
|
CHECK(a->Primary().Count() == 1);
|
|
CHECK(a->Primary()[0] == ~v);
|
|
}
|
|
|
|
SECTION("bitwise negates large values") {
|
|
auto v = GENERATE(10000000000000ULL, 0xFF00000000000000ULL);
|
|
|
|
SBigFromStr(b, std::to_string(v).c_str());
|
|
SBigNot(a, b);
|
|
|
|
CHECK(a->Primary().Count() == 2);
|
|
CHECK(a->Primary()[0] == ~uint32_t(v));
|
|
CHECK(a->Primary()[1] == ~uint32_t(v >> 32));
|
|
}
|
|
|
|
SECTION("bitwise negates huge value") {
|
|
uint32_t data[] = { 0xF00DFEED, 0xBA1D, 0xBEEBBEEB, 0x12345678, 0x9ABCDEF, 0xDEADCAD, 0xD011A };
|
|
|
|
SBigFromBinary(b, data, sizeof(data));
|
|
SBigNot(a, b);
|
|
|
|
CHECK(a->Primary().Count() == 7);
|
|
CHECK(a->Primary()[0] == ~data[0]);
|
|
CHECK(a->Primary()[1] == ~data[1]);
|
|
CHECK(a->Primary()[2] == ~data[2]);
|
|
CHECK(a->Primary()[3] == ~data[3]);
|
|
CHECK(a->Primary()[4] == ~data[4]);
|
|
CHECK(a->Primary()[5] == ~data[5]);
|
|
CHECK(a->Primary()[6] == ~data[6]);
|
|
}
|
|
}
|
|
|
|
TEST_CASE("SBigOr internal", "[big]") {
|
|
BigDataTest a, b, c;
|
|
|
|
SECTION("performs bitwise or on small numbers") {
|
|
auto v = GENERATE(
|
|
std::make_pair(0UL, 0UL),
|
|
std::make_pair(0UL, 123UL),
|
|
std::make_pair(41689UL, 786740UL)
|
|
);
|
|
|
|
SBigFromUnsigned(b, v.first);
|
|
SBigFromUnsigned(c, v.second);
|
|
SBigOr(a, b, c);
|
|
|
|
CHECK(a->Primary().Count() == 1);
|
|
CHECK(a->Primary()[0] == (v.first | v.second));
|
|
}
|
|
|
|
SECTION("performs bitwise or on large numbers") {
|
|
auto v = GENERATE(
|
|
std::make_pair(0xFF00FF00FF00FF00ULL, 0xFF00FF00FF00FFULL)
|
|
);
|
|
|
|
SBigFromStr(b, std::to_string(v.first).c_str());
|
|
SBigFromStr(c, std::to_string(v.second).c_str());
|
|
SBigOr(a, b, c);
|
|
|
|
CHECK(a->Primary().Count() == 2);
|
|
CHECK(a->Primary()[0] == 0xFFFFFFFF);
|
|
CHECK(a->Primary()[1] == 0xFFFFFFFF);
|
|
}
|
|
|
|
SECTION("performs bitwise or on huge value") {
|
|
uint32_t data[] = { 0xF00DFEEDUL, 0xBA1DUL, 0xBEEBBEEBUL, 0x12345678UL, 0x9ABCDEFUL, 0xDEADCADUL, 0xD011AUL };
|
|
|
|
SBigFromBinary(b, data, sizeof(data));
|
|
SBigFromUnsigned(c, 0x11111111UL);
|
|
SBigOr(a, b, c);
|
|
|
|
CHECK(a->Primary().Count() == 7);
|
|
CHECK(a->Primary()[0] == 0xF11DFFFD);
|
|
CHECK(a->Primary()[1] == data[1]);
|
|
CHECK(a->Primary()[2] == data[2]);
|
|
CHECK(a->Primary()[3] == data[3]);
|
|
CHECK(a->Primary()[4] == data[4]);
|
|
CHECK(a->Primary()[5] == data[5]);
|
|
CHECK(a->Primary()[6] == data[6]);
|
|
}
|
|
}
|
|
|
|
TEST_CASE("SBigShl internal", "[big]") {
|
|
BigDataTest a, b;
|
|
|
|
SECTION("shifts 256 left 7 bits") {
|
|
SBigFromUnsigned(b, 256);
|
|
|
|
SBigShl(a, b, 7);
|
|
|
|
a->Primary().Trim();
|
|
|
|
CHECK(a->Primary().Count() == 1);
|
|
CHECK(a->Primary()[0] == 32768);
|
|
}
|
|
}
|
|
|
|
TEST_CASE("SBigShr internal", "[big]") {
|
|
BigDataTest a, b;
|
|
|
|
SECTION("shifts 256 right 7 bits") {
|
|
SBigFromUnsigned(b, 256);
|
|
|
|
SBigShr(a, b, 7);
|
|
|
|
a->Primary().Trim();
|
|
|
|
CHECK(a->Primary().Count() == 1);
|
|
CHECK(a->Primary()[0] == 2);
|
|
}
|
|
}
|
|
|
|
TEST_CASE("SBigSquare internal", "[big]") {
|
|
BigDataTest a, b;
|
|
|
|
SECTION("squares 0xFFFFFFFF") {
|
|
SBigFromUnsigned(b, 0xFFFFFFFF);
|
|
|
|
SBigSquare(a, b);
|
|
|
|
a->Primary().Trim();
|
|
|
|
CHECK(a->Primary().Count() == 2);
|
|
CHECK(a->Primary()[0] == 0x1);
|
|
CHECK(a->Primary()[1] == 0xFFFFFFFE);
|
|
}
|
|
}
|
|
|
|
TEST_CASE("SBigSub internal", "[big]") {
|
|
BigDataTest a, b, c;
|
|
|
|
SECTION("subtracts 1 from 2") {
|
|
SBigFromUnsigned(b, 2);
|
|
SBigFromUnsigned(c, 1);
|
|
|
|
SBigSub(a, b, c);
|
|
|
|
a->Primary().Trim();
|
|
|
|
CHECK(a->Primary().Count() == 1);
|
|
CHECK(a->Primary()[0] == 1);
|
|
}
|
|
|
|
#ifdef NDEBUG
|
|
SECTION("subtracts 1 from 0") {
|
|
SBigFromUnsigned(b, 0);
|
|
SBigFromUnsigned(c, 1);
|
|
|
|
SBigSub(a, b, c);
|
|
|
|
CHECK(a->Primary().Count() == 1);
|
|
CHECK(a->Primary()[0] == 0xFFFFFFFF);
|
|
}
|
|
#endif
|
|
}
|
|
|
|
TEST_CASE("SBigXor internal", "[big]") {
|
|
BigDataTest a, b, c;
|
|
|
|
SECTION("performs bitwise xor on small numbers") {
|
|
auto v = GENERATE(
|
|
std::make_pair(0UL, 0UL),
|
|
std::make_pair(0UL, 123UL),
|
|
std::make_pair(41689UL, 786740UL)
|
|
);
|
|
|
|
SBigFromUnsigned(b, v.first);
|
|
SBigFromUnsigned(c, v.second);
|
|
SBigXor(a, b, c);
|
|
|
|
CHECK(a->Primary().Count() == 1);
|
|
CHECK(a->Primary()[0] == (v.first ^ v.second));
|
|
}
|
|
|
|
SECTION("performs bitwise xor on large number") {
|
|
SBigFromStr(b, std::to_string(0xFF00FF00FF00FF00ULL).c_str());
|
|
SBigFromStr(c, std::to_string(0xFF00FF00FF00FULL).c_str());
|
|
SBigXor(a, b, c);
|
|
|
|
CHECK(a->Primary().Count() == 2);
|
|
CHECK(a->Primary()[0] == 0xF0F0F0F);
|
|
CHECK(a->Primary()[1] == 0xFF0F0F0F);
|
|
}
|
|
|
|
SECTION("performs bitwise xor on huge value") {
|
|
uint32_t data[] = { 0xF00DFEEDUL, 0xBA1DUL, 0xBEEBBEEBUL, 0x12345678UL, 0x9ABCDEFUL, 0xDEADCADUL, 0xD011AUL };
|
|
|
|
SBigFromBinary(b, data, sizeof(data));
|
|
SBigFromUnsigned(c, 0x1111111FUL);
|
|
SBigXor(a, b, c);
|
|
|
|
CHECK(a->Primary().Count() == 7);
|
|
CHECK(a->Primary()[0] == 0xE11CEFF2);
|
|
CHECK(a->Primary()[1] == data[1]);
|
|
CHECK(a->Primary()[2] == data[2]);
|
|
CHECK(a->Primary()[3] == data[3]);
|
|
CHECK(a->Primary()[4] == data[4]);
|
|
CHECK(a->Primary()[5] == data[5]);
|
|
CHECK(a->Primary()[6] == data[6]);
|
|
}
|
|
}
|