Squashed 'external/toxcore/c-toxcore/' changes from c9cdae001..9ed2fa80d
9ed2fa80d fix(toxav): remove extra copy of video frame on encode de30cf3ad docs: Add new file kinds, that should be useful to all clients. d5b5e879d fix(DHT): Correct node skipping logic timed out nodes. 30e71fe97 refactor: Generate event dispatch functions and add tox_events_dispatch. 8fdbb0b50 style: Format parameter lists in event handlers. d00dee12b refactor: Add warning logs when losing chat invites. b144e8db1 feat: Add a way to look up a file number by ID. 849281ea0 feat: Add a way to fetch groups by chat ID. a2c177396 refactor: Harden event system and improve type safety. 8f5caa656 refactor: Add MessagePack string support to bin_pack. 34e8d5ad5 chore: Add GitHub CodeQL workflow and local Docker runner. f7b068010 refactor: Add nullability annotations to event headers. 788abe651 refactor(toxav): Use system allocator for mutexes. 2e4b423eb refactor: Use specific typedefs for public API arrays. 2baf34775 docs(toxav): update idle iteration interval see 679444751876fa3882a717772918ebdc8f083354 2f87ac67b feat: Add Event Loop abstraction (Ev). f8dfc38d8 test: Fix data race in ToxScenario virtual_clock. 38313921e test(TCP): Add regression test for TCP priority queue integrity. f94a50d9a refactor(toxav): Replace mutable_mutex with dynamically allocated mutex. ad054511e refactor: Internalize DHT structs and add debug helpers. 8b467cc96 fix: Prevent potential integer overflow in group chat handshake. 4962bdbb8 test: Improve TCP simulation and add tests 5f0227093 refactor: Allow nullable data in group chat handlers. e97b18ea9 chore: Improve Windows Docker support. b14943bbd refactor: Move Logger out of Messenger into Tox. dd3136250 cleanup: Apply nullability qualifiers to C++ codebase. 1849f70fc refactor: Extract low-level networking code to net and os_network. 8fec75421 refactor: Delete tox_random, align on rng and os_random. a03ae8051 refactor: Delete tox_memory, align on mem and os_memory. 4c88fed2c refactor: Use `std::` prefixes more consistently in C++ code. 72452f2ae test: Add some more tests for onion and shared key cache. d5a51b09a cleanup: Use tox_attributes.h in tox_private.h and install it. b6f5b9fc5 test: Add some benchmarks for various high level things. 8a8d02785 test(support): Introduce threaded Tox runner and simulation barrier d68d1d095 perf(toxav): optimize audio and video intermediate buffers by keeping them around REVERT: c9cdae001 fix(toxav): remove extra copy of video frame on encode git-subtree-dir: external/toxcore/c-toxcore git-subtree-split: 9ed2fa80d582c714d6bdde6a7648220a92cddff8
This commit is contained in:
@@ -10,6 +10,7 @@
|
||||
|
||||
#include "../testing/support/public/simulated_environment.hh"
|
||||
#include "DHT_test_util.hh"
|
||||
#include "attributes.h"
|
||||
#include "crypto_core.h"
|
||||
#include "crypto_core_test_util.hh"
|
||||
#include "logger.h"
|
||||
@@ -27,19 +28,19 @@ using ::testing::PrintToString;
|
||||
using ::testing::UnorderedElementsAre;
|
||||
using namespace tox::test;
|
||||
|
||||
using SecretKey = std::array<uint8_t, CRYPTO_SECRET_KEY_SIZE>;
|
||||
using SecretKey = std::array<std::uint8_t, CRYPTO_SECRET_KEY_SIZE>;
|
||||
|
||||
struct KeyPair {
|
||||
PublicKey pk;
|
||||
SecretKey sk;
|
||||
|
||||
explicit KeyPair(const Random *rng) { crypto_new_keypair(rng, pk.data(), sk.data()); }
|
||||
explicit KeyPair(const Random *_Nonnull rng) { crypto_new_keypair(rng, pk.data(), sk.data()); }
|
||||
};
|
||||
|
||||
TEST(IdClosest, KeyIsClosestToItself)
|
||||
{
|
||||
SimulatedEnvironment env;
|
||||
auto c_rng = env.fake_random().get_c_random();
|
||||
auto c_rng = env.fake_random().c_random();
|
||||
|
||||
PublicKey pk0 = random_pk(&c_rng);
|
||||
PublicKey pk1;
|
||||
@@ -54,7 +55,7 @@ TEST(IdClosest, KeyIsClosestToItself)
|
||||
TEST(IdClosest, IdenticalKeysAreSameDistance)
|
||||
{
|
||||
SimulatedEnvironment env;
|
||||
auto c_rng = env.fake_random().get_c_random();
|
||||
auto c_rng = env.fake_random().c_random();
|
||||
|
||||
PublicKey pk0 = random_pk(&c_rng);
|
||||
PublicKey pk1 = random_pk(&c_rng);
|
||||
@@ -65,7 +66,7 @@ TEST(IdClosest, IdenticalKeysAreSameDistance)
|
||||
TEST(IdClosest, DistanceIsCommutative)
|
||||
{
|
||||
SimulatedEnvironment env;
|
||||
auto c_rng = env.fake_random().get_c_random();
|
||||
auto c_rng = env.fake_random().c_random();
|
||||
|
||||
PublicKey pk0 = random_pk(&c_rng);
|
||||
PublicKey pk1 = random_pk(&c_rng);
|
||||
@@ -100,7 +101,7 @@ TEST(IdClosest, DistinctKeysCannotHaveTheSameDistance)
|
||||
PublicKey const pk1 = {0x00};
|
||||
PublicKey pk2 = {0x00};
|
||||
|
||||
for (uint8_t i = 1; i < 0xff; ++i) {
|
||||
for (std::uint8_t i = 1; i < 0xff; ++i) {
|
||||
pk2[0] = i;
|
||||
EXPECT_NE(id_closest(pk0.data(), pk1.data(), pk2.data()), 0);
|
||||
}
|
||||
@@ -152,7 +153,7 @@ Node_format fill(Node_format v, PublicKey const &pk, IP_Port const &ip_port)
|
||||
TEST(AddToList, AddsFirstKeysInOrder)
|
||||
{
|
||||
SimulatedEnvironment env;
|
||||
auto c_rng = env.fake_random().get_c_random();
|
||||
auto c_rng = env.fake_random().c_random();
|
||||
|
||||
// Make cmp_key the furthest away from 00000... as possible, so all initial inserts succeed.
|
||||
PublicKey const cmp_pk{0xff, 0xff, 0xff, 0xff};
|
||||
@@ -255,7 +256,7 @@ TEST(AddToList, AddsFirstKeysInOrder)
|
||||
TEST(AddToList, KeepsKeysInOrder)
|
||||
{
|
||||
SimulatedEnvironment env;
|
||||
auto c_rng = env.fake_random().get_c_random();
|
||||
auto c_rng = env.fake_random().c_random();
|
||||
|
||||
// Any random cmp_pk should work, as well as the smallest or (approximately) largest pk.
|
||||
for (PublicKey const cmp_pk : {random_pk(&c_rng), PublicKey{0x00}, PublicKey{0xff, 0xff}}) {
|
||||
@@ -281,24 +282,24 @@ TEST(AddToList, KeepsKeysInOrder)
|
||||
TEST(Request, CreateAndParse)
|
||||
{
|
||||
SimulatedEnvironment env;
|
||||
auto c_mem = env.fake_memory().get_c_memory();
|
||||
auto c_rng = env.fake_random().get_c_random();
|
||||
auto c_mem = env.fake_memory().c_memory();
|
||||
auto c_rng = env.fake_random().c_random();
|
||||
|
||||
// Peers.
|
||||
const KeyPair sender(&c_rng);
|
||||
const KeyPair receiver(&c_rng);
|
||||
const uint8_t sent_pkt_id = CRYPTO_PACKET_FRIEND_REQ;
|
||||
const std::uint8_t sent_pkt_id = CRYPTO_PACKET_FRIEND_REQ;
|
||||
|
||||
// Encoded packet.
|
||||
std::array<uint8_t, MAX_CRYPTO_REQUEST_SIZE> packet;
|
||||
std::array<std::uint8_t, MAX_CRYPTO_REQUEST_SIZE> packet;
|
||||
|
||||
// Received components.
|
||||
PublicKey pk;
|
||||
std::array<uint8_t, MAX_CRYPTO_REQUEST_SIZE> incoming;
|
||||
uint8_t recvd_pkt_id;
|
||||
std::array<std::uint8_t, MAX_CRYPTO_REQUEST_SIZE> incoming;
|
||||
std::uint8_t recvd_pkt_id;
|
||||
|
||||
// Request data: maximum payload is 918 bytes, so create a payload 1 byte larger than max.
|
||||
std::vector<uint8_t> outgoing(919);
|
||||
std::vector<std::uint8_t> outgoing(919);
|
||||
random_bytes(&c_rng, outgoing.data(), outgoing.size());
|
||||
|
||||
EXPECT_LT(create_request(&c_mem, &c_rng, sender.pk.data(), sender.sk.data(), packet.data(),
|
||||
@@ -330,7 +331,7 @@ TEST(Request, CreateAndParse)
|
||||
ASSERT_GE(recvd_length, 0);
|
||||
|
||||
EXPECT_EQ(
|
||||
std::vector<uint8_t>(incoming.begin(), incoming.begin() + recvd_length), outgoing);
|
||||
std::vector<std::uint8_t>(incoming.begin(), incoming.begin() + recvd_length), outgoing);
|
||||
|
||||
outgoing.pop_back();
|
||||
}
|
||||
@@ -339,8 +340,8 @@ TEST(Request, CreateAndParse)
|
||||
TEST(AnnounceNodes, SetAndTest)
|
||||
{
|
||||
SimulatedEnvironment env;
|
||||
auto c_mem = env.fake_memory().get_c_memory();
|
||||
auto c_rng = env.fake_random().get_c_random();
|
||||
auto c_mem = env.fake_memory().c_memory();
|
||||
auto c_rng = env.fake_random().c_random();
|
||||
|
||||
// Use FakeNetwork instead of Test_Network (which wrapped os_network)
|
||||
// Create endpoint bound to virtual port
|
||||
@@ -356,7 +357,7 @@ TEST(AnnounceNodes, SetAndTest)
|
||||
// Hook up simulation clock to mono_time
|
||||
mono_time_set_current_time_callback(
|
||||
mono_time,
|
||||
[](void *user_data) -> uint64_t {
|
||||
[](void *user_data) -> std::uint64_t {
|
||||
auto *clock = static_cast<FakeClock *>(user_data);
|
||||
return clock->current_time_ms();
|
||||
},
|
||||
@@ -367,8 +368,8 @@ TEST(AnnounceNodes, SetAndTest)
|
||||
Ptr<DHT> dht(new_dht(log, &c_mem, &c_rng, &net_struct, mono_time, net.get(), true, true));
|
||||
ASSERT_NE(dht, nullptr);
|
||||
|
||||
uint8_t pk_data[CRYPTO_PUBLIC_KEY_SIZE];
|
||||
memcpy(pk_data, dht_get_self_public_key(dht.get()), sizeof(pk_data));
|
||||
std::uint8_t pk_data[CRYPTO_PUBLIC_KEY_SIZE];
|
||||
std::memcpy(pk_data, dht_get_self_public_key(dht.get()), sizeof(pk_data));
|
||||
PublicKey self_pk(to_array(pk_data));
|
||||
|
||||
PublicKey pk1 = random_pk(&c_rng);
|
||||
|
||||
Reference in New Issue
Block a user