lokinet/llarp/pathbuilder.cpp

289 lines
7.5 KiB
C++
Raw Normal View History

2018-08-30 18:48:43 +00:00
#include <llarp/nodedb.hpp>
2018-06-18 22:03:50 +00:00
#include <llarp/path.hpp>
2018-07-09 17:32:11 +00:00
#include <llarp/pathbuilder.hpp>
2018-10-09 12:06:30 +00:00
#include <functional>
#include "buffer.hpp"
2018-06-18 22:03:50 +00:00
#include "router.hpp"
namespace llarp
{
2018-06-21 12:55:02 +00:00
template < typename User >
struct AsyncPathKeyExchangeContext
{
typedef llarp::path::Path Path_t;
typedef llarp::path::PathSet PathSet_t;
PathSet_t* pathset = nullptr;
Path_t* path = nullptr;
2018-10-09 12:06:30 +00:00
typedef std::function< void(AsyncPathKeyExchangeContext< User >*) > Handler;
User* user = nullptr;
Handler result;
2018-06-21 12:55:02 +00:00
size_t idx = 0;
2018-12-07 13:38:49 +00:00
llarp_router* router = nullptr;
2018-06-21 12:55:02 +00:00
llarp_threadpool* worker = nullptr;
llarp_logic* logic = nullptr;
llarp_crypto* crypto = nullptr;
LR_CommitMessage LRCM;
2018-06-21 12:55:02 +00:00
static void
HandleDone(void* u)
{
AsyncPathKeyExchangeContext< User >* ctx =
static_cast< AsyncPathKeyExchangeContext< User >* >(u);
ctx->result(ctx);
2018-10-09 12:06:30 +00:00
delete ctx;
2018-06-21 12:55:02 +00:00
}
static void
GenerateNextKey(void* u)
{
AsyncPathKeyExchangeContext< User >* ctx =
static_cast< AsyncPathKeyExchangeContext< User >* >(u);
2018-06-21 14:20:14 +00:00
// current hop
2018-06-21 12:55:02 +00:00
auto& hop = ctx->path->hops[ctx->idx];
auto& frame = ctx->LRCM.frames[ctx->idx];
2018-06-21 12:55:02 +00:00
// generate key
ctx->crypto->encryption_keygen(hop.commkey);
hop.nonce.Randomize();
// do key exchange
2018-08-30 18:48:43 +00:00
if(!ctx->crypto->dh_client(hop.shared, hop.rc.enckey, hop.commkey,
2018-06-21 12:55:02 +00:00
hop.nonce))
{
llarp::LogError("Failed to generate shared key for path build");
delete ctx;
2018-06-21 12:55:02 +00:00
return;
}
// generate nonceXOR valueself->hop->pathKey
ctx->crypto->shorthash(hop.nonceXOR, llarp::Buffer(hop.shared));
2018-06-21 12:55:02 +00:00
++ctx->idx;
2018-06-21 14:20:14 +00:00
bool isFarthestHop = ctx->idx == ctx->path->hops.size();
2018-06-21 14:20:14 +00:00
if(isFarthestHop)
2018-06-21 12:55:02 +00:00
{
2018-08-30 18:48:43 +00:00
hop.upstream = hop.rc.pubkey;
2018-06-21 12:55:02 +00:00
}
else
{
2018-08-30 18:48:43 +00:00
hop.upstream = ctx->path->hops[ctx->idx].rc.pubkey;
2018-06-21 12:55:02 +00:00
}
2018-06-21 15:46:35 +00:00
// build record
LR_CommitRecord record;
record.version = LLARP_PROTO_VERSION;
record.txid = hop.txID;
record.rxid = hop.rxID;
2018-06-21 15:46:35 +00:00
record.tunnelNonce = hop.nonce;
record.nextHop = hop.upstream;
record.commkey = llarp::seckey_topublic(hop.commkey);
2018-06-21 12:55:02 +00:00
auto buf = frame.Buffer();
buf->cur = buf->base + EncryptedFrame::OverheadSize;
2018-06-21 15:46:35 +00:00
// encode record
2018-06-21 12:55:02 +00:00
if(!record.BEncode(buf))
{
// failed to encode?
llarp::LogError("Failed to generate Commit Record");
delete ctx;
2018-06-21 12:55:02 +00:00
return;
}
// use ephameral keypair for frame
SecretKey framekey;
ctx->crypto->encryption_keygen(framekey);
2018-08-30 18:48:43 +00:00
if(!frame.EncryptInPlace(framekey, hop.rc.enckey, ctx->crypto))
2018-06-21 12:55:02 +00:00
{
llarp::LogError("Failed to encrypt LRCR");
delete ctx;
2018-06-21 12:55:02 +00:00
return;
}
2018-06-21 14:20:14 +00:00
if(isFarthestHop)
2018-06-21 12:55:02 +00:00
{
2018-06-21 14:20:14 +00:00
// farthest hop
llarp_logic_queue_job(ctx->logic, {ctx, &HandleDone});
2018-06-21 12:55:02 +00:00
}
else
{
2018-06-21 14:20:14 +00:00
// next hop
llarp_threadpool_queue_job(ctx->worker, {ctx, &GenerateNextKey});
2018-06-21 12:55:02 +00:00
}
}
AsyncPathKeyExchangeContext(llarp_crypto* c) : crypto(c)
{
}
/// Generate all keys asynchronously and call hadler when done
void
AsyncGenerateKeys(Path_t* p, llarp_logic* l, llarp_threadpool* pool,
User* u, Handler func)
2018-06-21 12:55:02 +00:00
{
path = p;
logic = l;
user = u;
result = func;
worker = pool;
for(size_t idx = 0; idx < MAXHOPS; ++idx)
{
LRCM.frames[idx].Randomize();
2018-06-21 12:55:02 +00:00
}
llarp_threadpool_queue_job(pool, {this, &GenerateNextKey});
}
};
2018-06-18 22:03:50 +00:00
void
2018-08-30 18:48:43 +00:00
pathbuilder_generated_keys(AsyncPathKeyExchangeContext< path::Builder >* ctx)
2018-06-18 22:03:50 +00:00
{
2018-12-07 13:38:49 +00:00
RouterID remote = ctx->path->Upstream();
2018-11-08 15:15:02 +00:00
const ILinkMessage* msg = &ctx->LRCM;
2018-12-07 13:38:49 +00:00
if(!ctx->router->SendToOrQueue(remote, msg))
2018-06-20 12:34:48 +00:00
{
llarp::LogError("failed to send LRCM");
2018-06-20 12:34:48 +00:00
return;
}
2018-08-14 21:17:18 +00:00
// persist session with router until this path is done
2018-12-07 13:38:49 +00:00
ctx->router->PersistSessionUntil(remote, ctx->path->ExpireTime());
2018-08-14 21:17:18 +00:00
// add own path
2018-12-07 13:38:49 +00:00
ctx->router->paths.AddOwnPath(ctx->pathset, ctx->path);
2018-06-18 22:03:50 +00:00
}
2018-08-30 18:48:43 +00:00
namespace path
2018-06-18 22:03:50 +00:00
{
2018-08-30 18:48:43 +00:00
Builder::Builder(llarp_router* p_router, struct llarp_dht_context* p_dht,
size_t pathNum, size_t hops)
: llarp::path::PathSet(pathNum)
, router(p_router)
, dht(p_dht)
, numHops(hops)
2018-06-18 22:03:50 +00:00
{
2018-08-30 18:48:43 +00:00
p_router->paths.AddPathBuilder(this);
p_router->crypto.encryption_keygen(enckey);
2018-06-18 22:03:50 +00:00
}
2018-08-30 18:48:43 +00:00
Builder::~Builder()
{
router->paths.RemovePathBuilder(this);
}
2018-08-30 18:48:43 +00:00
bool
Builder::SelectHop(llarp_nodedb* db, const RouterContact& prev,
2018-11-14 18:02:27 +00:00
RouterContact& cur, size_t hop, PathRole roles)
2018-08-30 18:48:43 +00:00
{
2018-11-15 13:47:46 +00:00
(void)roles;
2018-11-29 14:18:53 +00:00
if(hop == 0)
return router->NumberOfConnectedRouters()
&& router->GetRandomConnectedRouter(cur);
2018-10-04 17:51:45 +00:00
size_t tries = 5;
do
{
--tries;
2018-11-15 13:47:46 +00:00
if(llarp_nodedb_select_random_hop(db, prev, cur, hop))
2018-11-29 14:18:53 +00:00
return true;
2018-10-04 17:51:45 +00:00
} while(router->routerProfiling.IsBad(cur.pubkey) && tries > 0);
2018-11-29 14:18:53 +00:00
return false;
2018-08-30 18:48:43 +00:00
}
2018-08-30 18:48:43 +00:00
const byte_t*
Builder::GetTunnelEncryptionSecretKey() const
{
return enckey;
}
2018-06-18 22:03:50 +00:00
2018-08-30 18:48:43 +00:00
bool
2018-10-29 16:48:36 +00:00
Builder::ShouldBuildMore(llarp_time_t now) const
2018-08-30 18:48:43 +00:00
{
2018-10-29 16:48:36 +00:00
return llarp::path::PathSet::ShouldBuildMore(now) && now > lastBuild
&& now - lastBuild > buildIntervalLimit;
2018-08-30 18:48:43 +00:00
}
2018-08-12 17:22:29 +00:00
2018-08-30 18:48:43 +00:00
void
2018-11-14 18:02:27 +00:00
Builder::BuildOne(PathRole roles)
2018-08-30 18:48:43 +00:00
{
2018-08-31 14:41:04 +00:00
std::vector< RouterContact > hops;
2018-11-14 18:02:27 +00:00
if(SelectHops(router->nodedb, hops, roles))
Build(hops, roles);
}
bool
Builder::SelectHops(llarp_nodedb* nodedb,
2018-11-14 18:02:27 +00:00
std::vector< RouterContact >& hops, PathRole roles)
{
2018-09-06 11:46:19 +00:00
hops.resize(numHops);
2018-08-30 18:48:43 +00:00
size_t idx = 0;
while(idx < numHops)
{
if(idx == 0)
{
2018-11-14 18:02:27 +00:00
if(!SelectHop(nodedb, hops[0], hops[0], 0, roles))
2018-08-30 18:48:43 +00:00
{
llarp::LogError("failed to select first hop");
return false;
2018-08-30 18:48:43 +00:00
}
}
else
{
2018-11-14 18:02:27 +00:00
if(!SelectHop(nodedb, hops[idx - 1], hops[idx], idx, roles))
2018-08-30 18:48:43 +00:00
{
/// TODO: handle this failure properly
llarp::LogWarn("Failed to select hop ", idx);
return false;
2018-08-30 18:48:43 +00:00
}
}
++idx;
}
return true;
}
2018-10-29 16:48:36 +00:00
llarp_time_t
Builder::Now() const
{
return router->Now();
}
void
2018-11-14 18:02:27 +00:00
Builder::Build(const std::vector< RouterContact >& hops, PathRole roles)
{
2018-10-29 16:48:36 +00:00
lastBuild = Now();
2018-08-30 18:48:43 +00:00
// async generate keys
AsyncPathKeyExchangeContext< Builder >* ctx =
new AsyncPathKeyExchangeContext< Builder >(&router->crypto);
2018-12-07 13:38:49 +00:00
ctx->router = router;
2018-08-30 18:48:43 +00:00
ctx->pathset = this;
2018-11-14 18:02:27 +00:00
auto path = new llarp::path::Path(hops, this, roles);
path->SetBuildResultHook(std::bind(&llarp::path::Builder::HandlePathBuilt,
this, std::placeholders::_1));
2018-08-30 18:48:43 +00:00
ctx->AsyncGenerateKeys(path, router->logic, router->tp, this,
&pathbuilder_generated_keys);
}
2018-06-18 22:03:50 +00:00
void
Builder::HandlePathBuilt(Path* p)
{
buildIntervalLimit = MIN_PATH_BUILD_INTERVAL;
PathSet::HandlePathBuilt(p);
}
void
Builder::HandlePathBuildTimeout(Path* p)
{
// linear backoff
buildIntervalLimit += 1000;
PathSet::HandlePathBuildTimeout(p);
}
2018-08-30 18:48:43 +00:00
void
2018-11-14 18:02:27 +00:00
Builder::ManualRebuild(size_t num, PathRole roles)
2018-08-30 18:48:43 +00:00
{
llarp::LogDebug("manual rebuild ", num);
while(num--)
2018-11-14 18:02:27 +00:00
BuildOne(roles);
2018-08-30 18:48:43 +00:00
}
2018-06-18 22:03:50 +00:00
2018-08-30 18:48:43 +00:00
} // namespace path
} // namespace llarp