Files
libtorrent/test/test_sha1_hash.cpp
2021-12-07 21:13:48 +01:00

125 lines
4.0 KiB
C++

/*
Copyright (c) 2015-2017, 2019-2021, Arvid Norberg
Copyright (c) 2016, Alden Torres
All rights reserved.
You may use, distribute and modify this code under the terms of the BSD license,
see LICENSE file.
*/
#include "test.hpp"
#include "libtorrent/sha1_hash.hpp"
#include "libtorrent/hex.hpp" // from_hex
using namespace lt;
static sha1_hash to_hash(char const* s)
{
sha1_hash ret;
aux::from_hex({s, 40}, ret.data());
return ret;
}
TORRENT_TEST(sha1_hash)
{
sha1_hash h1(nullptr);
sha1_hash h2(nullptr);
TEST_CHECK(h1 == h2);
TEST_CHECK(!(h1 != h2));
TEST_CHECK(!(h1 < h2));
TEST_CHECK(!(h1 < h2));
TEST_CHECK(h1.is_all_zeros());
h1 = to_hash("0123456789012345678901234567890123456789");
h2 = to_hash("0113456789012345678901234567890123456789");
TEST_CHECK(h2 < h1);
TEST_CHECK(h2 == h2);
TEST_CHECK(h1 == h1);
h2.clear();
TEST_CHECK(h2.is_all_zeros());
h2 = to_hash("ffffffffff0000000000ffffffffff0000000000");
h1 = to_hash("fffff00000fffff00000fffff00000fffff00000");
h1 &= h2;
TEST_CHECK(h1 == to_hash("fffff000000000000000fffff000000000000000"));
h2 = to_hash("ffffffffff0000000000ffffffffff0000000000");
h1 = to_hash("fffff00000fffff00000fffff00000fffff00000");
h1 |= h2;
TEST_CHECK(h1 == to_hash("fffffffffffffff00000fffffffffffffff00000"));
h2 = to_hash("0f0f0f0f0f0f0f0f0f0f0f0f0f0f0f0f0f0f0f0f");
h1 ^= h2;
TEST_CHECK(h1 == to_hash("f0f0f0f0f0f0f0ff0f0ff0f0f0f0f0f0f0ff0f0f"));
TEST_CHECK(h1 != h2);
h2 = sha1_hash(" ");
TEST_CHECK(h2 == to_hash("2020202020202020202020202020202020202020"));
h1 = to_hash("ffffffffff0000000000ffffffffff0000000000");
h1 <<= 12;
TEST_CHECK(h1 == to_hash("fffffff0000000000ffffffffff0000000000000"));
h1 >>= 12;
TEST_CHECK(h1 == to_hash("000fffffff0000000000ffffffffff0000000000"));
h1 = to_hash("7000000000000000000000000000000000000000");
h1 <<= 1;
TEST_CHECK(h1 == to_hash("e000000000000000000000000000000000000000"));
h1 = to_hash("0000000000000000000000000000000000000007");
h1 <<= 1;
TEST_CHECK(h1 == to_hash("000000000000000000000000000000000000000e"));
h1 = to_hash("0000000000000000000000000000000000000007");
h1 >>= 1;
TEST_CHECK(h1 == to_hash("0000000000000000000000000000000000000003"));
h1 = to_hash("7000000000000000000000000000000000000000");
h1 >>= 1;
TEST_CHECK(h1 == to_hash("3800000000000000000000000000000000000000"));
h1 = to_hash("7000000000000000000000000000000000000000");
h1 >>= 32;
TEST_CHECK(h1 == to_hash("0000000070000000000000000000000000000000"));
h1 >>= 33;
TEST_CHECK(h1 == to_hash("0000000000000000380000000000000000000000"));
h1 <<= 33;
TEST_CHECK(h1 == to_hash("0000000070000000000000000000000000000000"));
}
TORRENT_TEST(count_leading_zeroes)
{
std::vector<std::pair<char const*, int>> const tests = {
{ "ffffffffffffffffffffffffffffffffffffffff", 0 },
{ "0000000000000000000000000000000000000000", 160 },
{ "fff0000000000000000000000000000000000000", 0 },
{ "7ff0000000000000000000000000000000000000", 1 },
{ "3ff0000000000000000000000000000000000000", 2 },
{ "1ff0000000000000000000000000000000000000", 3 },
{ "0ff0000000000000000000000000000000000000", 4 },
{ "07f0000000000000000000000000000000000000", 5 },
{ "03f0000000000000000000000000000000000000", 6 },
{ "01f0000000000000000000000000000000000000", 7 },
{ "00f0000000000000000000000000000000000000", 8 },
{ "0070000000000000000000000000000000000000", 9 },
{ "0030000000000000000000000000000000000000", 10 },
{ "0010000000000000000000000000000000000000", 11 },
{ "0000000ffff00000000000000000000000000000", 28 },
{ "00000007fff00000000000000000000000000000", 29 },
{ "00000003fff00000000000000000000000000000", 30 },
{ "00000001fff00000000000000000000000000000", 31 },
{ "00000000fff00000000000000000000000000000", 32 },
{ "000000007ff00000000000000000000000000000", 33 },
{ "000000003ff00000000000000000000000000000", 34 },
{ "000000001ff00000000000000000000000000000", 35 },
};
for (auto const& t : tests)
{
std::printf("%s\n", t.first);
TEST_EQUAL(to_hash(t.first).count_leading_zeroes(), t.second);
}
}