mirror of
https://github.com/TokTok/c-toxcore
synced 2026-09-17 01:34:47 +00:00
jfreegman
5619b5e056
We additionally now make local copies of the IP_Port param instead of modifying the passed argument
114 lines
3.3 KiB
C++
114 lines
3.3 KiB
C++
#include "DHT.h"
|
|
|
|
#include <gtest/gtest.h>
|
|
|
|
#include <algorithm>
|
|
#include <array>
|
|
|
|
#include "crypto_core.h"
|
|
|
|
namespace {
|
|
|
|
using PublicKey = std::array<uint8_t, CRYPTO_PUBLIC_KEY_SIZE>;
|
|
|
|
template <typename T, size_t N>
|
|
std::array<T, N> to_array(T const (&arr)[N]) {
|
|
std::array<T, N> stdarr;
|
|
memcpy(stdarr.data(), arr, N);
|
|
return stdarr;
|
|
}
|
|
|
|
TEST(IdClosest, IdenticalKeysAreSameDistance) {
|
|
PublicKey pk0;
|
|
random_bytes(pk0.data(), CRYPTO_PUBLIC_KEY_SIZE);
|
|
|
|
PublicKey pk1;
|
|
random_bytes(pk1.data(), CRYPTO_PUBLIC_KEY_SIZE);
|
|
|
|
PublicKey pk2 = pk1;
|
|
|
|
EXPECT_EQ(id_closest(pk0.data(), pk1.data(), pk2.data()), 0);
|
|
}
|
|
|
|
TEST(IdClosest, DistanceIsCommutative) {
|
|
for (uint32_t i = 0; i < 100; ++i) {
|
|
PublicKey pk0;
|
|
random_bytes(pk0.data(), CRYPTO_PUBLIC_KEY_SIZE);
|
|
|
|
PublicKey pk1;
|
|
random_bytes(pk1.data(), CRYPTO_PUBLIC_KEY_SIZE);
|
|
|
|
PublicKey pk2;
|
|
random_bytes(pk2.data(), CRYPTO_PUBLIC_KEY_SIZE);
|
|
|
|
ASSERT_NE(pk1, pk2); // RNG can't produce the same random key twice
|
|
|
|
// Two non-equal keys can't have the same distance from any given key.
|
|
EXPECT_NE(id_closest(pk0.data(), pk1.data(), pk2.data()), 0);
|
|
|
|
if (id_closest(pk0.data(), pk1.data(), pk2.data()) == 1) {
|
|
EXPECT_EQ(id_closest(pk0.data(), pk2.data(), pk1.data()), 2);
|
|
}
|
|
|
|
if (id_closest(pk0.data(), pk1.data(), pk2.data()) == 2) {
|
|
EXPECT_EQ(id_closest(pk0.data(), pk2.data(), pk1.data()), 1);
|
|
}
|
|
}
|
|
}
|
|
|
|
TEST(IdClosest, SmallXorDistanceIsCloser) {
|
|
PublicKey const pk0 = {{0xaa}};
|
|
PublicKey const pk1 = {{0xa0}};
|
|
PublicKey const pk2 = {{0x0a}};
|
|
|
|
EXPECT_EQ(id_closest(pk0.data(), pk1.data(), pk2.data()), 1);
|
|
}
|
|
|
|
TEST(IdClosest, DistinctKeysCannotHaveTheSameDistance) {
|
|
PublicKey const pk0 = {{0x06}};
|
|
PublicKey const pk1 = {{0x00}};
|
|
PublicKey pk2 = {{0x00}};
|
|
|
|
for (uint8_t i = 1; i < 0xff; ++i) {
|
|
pk2[0] = i;
|
|
EXPECT_NE(id_closest(pk0.data(), pk1.data(), pk2.data()), 0);
|
|
}
|
|
}
|
|
|
|
TEST(AddToList, OverridesKeysWithCloserKeys) {
|
|
PublicKey const self_pk = {{0xaa}};
|
|
PublicKey const keys[] = {
|
|
{{0xa0}}, // closest
|
|
{{0x0a}}, //
|
|
{{0x0b}}, //
|
|
{{0x0c}}, //
|
|
{{0x0d}}, //
|
|
{{0xa1}}, // closer than the 4 keys above
|
|
};
|
|
|
|
std::array<Node_format, 4> nodes{};
|
|
|
|
IP_Port ip_port = {0};
|
|
EXPECT_TRUE(add_to_list(nodes.data(), nodes.size(), keys[0].data(), &ip_port, self_pk.data()));
|
|
EXPECT_TRUE(add_to_list(nodes.data(), nodes.size(), keys[1].data(), &ip_port, self_pk.data()));
|
|
EXPECT_TRUE(add_to_list(nodes.data(), nodes.size(), keys[2].data(), &ip_port, self_pk.data()));
|
|
EXPECT_TRUE(add_to_list(nodes.data(), nodes.size(), keys[3].data(), &ip_port, self_pk.data()));
|
|
|
|
EXPECT_EQ(to_array(nodes[0].public_key), keys[0]);
|
|
EXPECT_EQ(to_array(nodes[1].public_key), keys[1]);
|
|
EXPECT_EQ(to_array(nodes[2].public_key), keys[2]);
|
|
EXPECT_EQ(to_array(nodes[3].public_key), keys[3]);
|
|
|
|
// key 4 is less close than keys 0-3
|
|
EXPECT_FALSE(add_to_list(nodes.data(), nodes.size(), keys[4].data(), &ip_port, self_pk.data()));
|
|
// 5 is closer than all except key 0
|
|
EXPECT_TRUE(add_to_list(nodes.data(), nodes.size(), keys[5].data(), &ip_port, self_pk.data()));
|
|
|
|
EXPECT_EQ(to_array(nodes[0].public_key), keys[0]);
|
|
EXPECT_EQ(to_array(nodes[1].public_key), keys[5]);
|
|
EXPECT_EQ(to_array(nodes[2].public_key), keys[1]);
|
|
EXPECT_EQ(to_array(nodes[3].public_key), keys[2]);
|
|
}
|
|
|
|
} // namespace
|