mirror of
https://github.com/oxen-io/lokinet.git
synced 2024-11-17 15:25:35 +00:00
635dc4fe13
llarp/config/config.cpp: respect [network]:type option llarp/handlers/exit.cpp: when [network]:type is null dont init tun interface llarp/service/context.cpp: respect [network]:type option change endpoint name back to "default" llarp/tooling/router_hive.cpp: dont use LogicCall for obtaining RCs from underlying relays, it crashes the mainloop and it's probably safe to readonly access RCs. pybind/common.hpp: remove typecasters as we use C++17 now pybind/llarp/config.cpp: remove SnappConfig wire up NetworkConfig pybind/llarp/handlers/pyhandler.hpp: remove SnappConfig from constructor pybind/llarp/handlers/pyhandler.cpp: update constructor implementation to match header test/hive/hive.py: remove broke endpoint related code wire up null endpoint option using NetworkConfig use index at 0 for relays and clients instead of 1 dont add a python endpoint to all clients
233 lines
5.0 KiB
C++
233 lines
5.0 KiB
C++
#include <tooling/router_hive.hpp>
|
|
|
|
#include "llarp.h"
|
|
#include "llarp.hpp"
|
|
#include "util/thread/logic.hpp"
|
|
#include "util/str.hpp"
|
|
#include "router/abstractrouter.hpp"
|
|
|
|
#include <chrono>
|
|
#include <algorithm>
|
|
|
|
using namespace std::chrono_literals;
|
|
|
|
namespace tooling
|
|
{
|
|
void
|
|
RouterHive::AddRouter(
|
|
const std::shared_ptr<llarp::Config>& config, std::vector<llarp_main*>* routers, bool isRelay)
|
|
{
|
|
llarp_main* ctx = llarp_main_init_from_config(config->Copy(), isRelay);
|
|
auto result = llarp_main_setup(ctx);
|
|
if (result == 0)
|
|
{
|
|
llarp::Context::Get(ctx)->InjectHive(this);
|
|
routers->push_back(ctx);
|
|
}
|
|
else
|
|
{
|
|
throw std::runtime_error(llarp::stringify(
|
|
"Failed to add RouterHive ",
|
|
(isRelay ? "relay" : "client"),
|
|
", llarp_main_setup() returned ",
|
|
result));
|
|
}
|
|
}
|
|
|
|
void
|
|
RouterHive::AddRelay(const std::shared_ptr<llarp::Config>& config)
|
|
{
|
|
AddRouter(config, &relays, true);
|
|
}
|
|
|
|
void
|
|
RouterHive::AddClient(const std::shared_ptr<llarp::Config>& config)
|
|
{
|
|
AddRouter(config, &clients, false);
|
|
}
|
|
|
|
void
|
|
RouterHive::StartRouters(std::vector<llarp_main*>* routers, bool isRelay)
|
|
{
|
|
for (llarp_main* ctx : *routers)
|
|
{
|
|
routerMainThreads.emplace_back([=]() {
|
|
llarp_main_run(ctx, llarp_main_runtime_opts{false, false, false, isRelay});
|
|
});
|
|
std::this_thread::sleep_for(2ms);
|
|
}
|
|
}
|
|
|
|
void
|
|
RouterHive::StartRelays()
|
|
{
|
|
StartRouters(&relays, true);
|
|
}
|
|
|
|
void
|
|
RouterHive::StartClients()
|
|
{
|
|
StartRouters(&clients, false);
|
|
}
|
|
|
|
void
|
|
RouterHive::StopRouters()
|
|
{
|
|
llarp::LogInfo("Signalling all routers to stop");
|
|
for (llarp_main* ctx : relays)
|
|
{
|
|
llarp_main_signal(ctx, 2 /* SIGINT */);
|
|
}
|
|
for (llarp_main* ctx : clients)
|
|
{
|
|
llarp_main_signal(ctx, 2 /* SIGINT */);
|
|
}
|
|
|
|
llarp::LogInfo("Waiting on routers to be stopped");
|
|
for (llarp_main* ctx : relays)
|
|
{
|
|
while (llarp_main_is_running(ctx))
|
|
{
|
|
std::this_thread::sleep_for(10ms);
|
|
}
|
|
}
|
|
for (llarp_main* ctx : clients)
|
|
{
|
|
while (llarp_main_is_running(ctx))
|
|
{
|
|
std::this_thread::sleep_for(10ms);
|
|
}
|
|
}
|
|
|
|
llarp::LogInfo("Joining all router threads");
|
|
for (auto& thread : routerMainThreads)
|
|
{
|
|
while (not thread.joinable())
|
|
{
|
|
std::this_thread::sleep_for(500ms);
|
|
}
|
|
thread.join();
|
|
}
|
|
|
|
llarp::LogInfo("RouterHive::StopRouters finished");
|
|
}
|
|
|
|
void
|
|
RouterHive::NotifyEvent(RouterEventPtr event)
|
|
{
|
|
std::lock_guard<std::mutex> guard{eventQueueMutex};
|
|
|
|
eventQueue.push_back(std::move(event));
|
|
}
|
|
|
|
RouterEventPtr
|
|
RouterHive::GetNextEvent()
|
|
{
|
|
std::lock_guard<std::mutex> guard{eventQueueMutex};
|
|
|
|
if (not eventQueue.empty())
|
|
{
|
|
auto ptr = std::move(eventQueue.front());
|
|
eventQueue.pop_front();
|
|
return ptr;
|
|
}
|
|
return nullptr;
|
|
}
|
|
|
|
std::deque<RouterEventPtr>
|
|
RouterHive::GetAllEvents()
|
|
{
|
|
std::lock_guard<std::mutex> guard{eventQueueMutex};
|
|
|
|
std::deque<RouterEventPtr> events;
|
|
if (not eventQueue.empty())
|
|
{
|
|
eventQueue.swap(events);
|
|
}
|
|
return events;
|
|
}
|
|
|
|
void
|
|
RouterHive::VisitRouter(llarp_main* router, std::function<void(Context_ptr)> visit)
|
|
{
|
|
auto ctx = llarp::Context::Get(router);
|
|
LogicCall(ctx->logic, [visit, ctx]() { visit(ctx); });
|
|
}
|
|
|
|
void
|
|
RouterHive::VisitRelay(size_t index, std::function<void(Context_ptr)> visit)
|
|
{
|
|
if (index >= relays.size())
|
|
{
|
|
visit(nullptr);
|
|
return;
|
|
}
|
|
VisitRouter(relays[index], visit);
|
|
}
|
|
|
|
void
|
|
RouterHive::VisitClient(size_t index, std::function<void(Context_ptr)> visit)
|
|
{
|
|
if (index >= clients.size())
|
|
{
|
|
visit(nullptr);
|
|
return;
|
|
}
|
|
VisitRouter(clients[index], visit);
|
|
}
|
|
|
|
std::vector<size_t>
|
|
RouterHive::RelayConnectedRelays()
|
|
{
|
|
std::vector<size_t> results;
|
|
results.resize(relays.size());
|
|
std::mutex results_lock;
|
|
|
|
size_t i = 0;
|
|
size_t done_count = 0;
|
|
for (auto relay : relays)
|
|
{
|
|
auto ctx = llarp::Context::Get(relay);
|
|
LogicCall(ctx->logic, [&, i, ctx]() {
|
|
size_t count = ctx->router->NumberOfConnectedRouters();
|
|
std::lock_guard<std::mutex> guard{results_lock};
|
|
results[i] = count;
|
|
done_count++;
|
|
});
|
|
i++;
|
|
}
|
|
|
|
while (true)
|
|
{
|
|
size_t read_done_count = 0;
|
|
{
|
|
std::lock_guard<std::mutex> guard{results_lock};
|
|
read_done_count = done_count;
|
|
}
|
|
if (read_done_count == relays.size())
|
|
break;
|
|
|
|
std::this_thread::sleep_for(100ms);
|
|
}
|
|
return results;
|
|
}
|
|
|
|
// TODO: DRY -- this smells a lot like RelayConnectedRelays()
|
|
std::vector<llarp::RouterContact>
|
|
RouterHive::GetRelayRCs()
|
|
{
|
|
std::vector<llarp::RouterContact> results;
|
|
results.resize(relays.size());
|
|
|
|
size_t i = 0;
|
|
for (auto relay : relays)
|
|
{
|
|
auto ctx = llarp::Context::Get(relay);
|
|
results[i] = ctx->router->rc();
|
|
i++;
|
|
}
|
|
return results;
|
|
}
|
|
|
|
} // namespace tooling
|