2019-06-04 18:31:17 +00:00
|
|
|
#include <messages/relay_status.hpp>
|
|
|
|
|
|
|
|
#include <crypto/crypto.hpp>
|
|
|
|
#include <path/path_context.hpp>
|
|
|
|
#include <path/ihophandler.hpp>
|
|
|
|
#include <router/abstractrouter.hpp>
|
|
|
|
#include <routing/path_confirm_message.hpp>
|
|
|
|
#include <util/bencode.hpp>
|
|
|
|
#include <util/buffer.hpp>
|
2019-09-01 12:10:49 +00:00
|
|
|
#include <util/logging/logger.hpp>
|
2019-09-01 12:38:03 +00:00
|
|
|
#include <util/meta/memfn.hpp>
|
2019-09-01 13:26:16 +00:00
|
|
|
#include <util/thread/logic.hpp>
|
2019-06-04 18:31:17 +00:00
|
|
|
|
|
|
|
#include <functional>
|
2019-07-30 23:42:13 +00:00
|
|
|
#include <utility>
|
2019-06-04 18:31:17 +00:00
|
|
|
|
|
|
|
namespace llarp
|
|
|
|
{
|
|
|
|
struct LRSM_AsyncHandler
|
|
|
|
: public std::enable_shared_from_this< LRSM_AsyncHandler >
|
|
|
|
{
|
|
|
|
using HopHandler_ptr = std::shared_ptr< llarp::path::IHopHandler >;
|
|
|
|
|
|
|
|
std::array< EncryptedFrame, 8 > frames;
|
|
|
|
uint64_t status = 0;
|
|
|
|
HopHandler_ptr path;
|
|
|
|
AbstractRouter* router;
|
|
|
|
|
2019-07-30 23:42:13 +00:00
|
|
|
LRSM_AsyncHandler(std::array< EncryptedFrame, 8 > _frames, uint64_t _status,
|
|
|
|
HopHandler_ptr _path, AbstractRouter* _router)
|
|
|
|
: frames(std::move(_frames))
|
|
|
|
, status(_status)
|
|
|
|
, path(std::move(_path))
|
|
|
|
, router(_router)
|
2019-06-04 18:31:17 +00:00
|
|
|
{
|
|
|
|
}
|
|
|
|
|
|
|
|
~LRSM_AsyncHandler() = default;
|
|
|
|
|
|
|
|
void
|
|
|
|
handle()
|
|
|
|
{
|
|
|
|
path->HandleLRSM(status, frames, router);
|
|
|
|
}
|
|
|
|
|
|
|
|
void
|
|
|
|
queue_handle()
|
|
|
|
{
|
|
|
|
auto func =
|
|
|
|
std::bind(&llarp::LRSM_AsyncHandler::handle, shared_from_this());
|
|
|
|
router->threadpool()->addJob(func);
|
|
|
|
}
|
|
|
|
};
|
|
|
|
|
|
|
|
bool
|
|
|
|
LR_StatusMessage::DecodeKey(const llarp_buffer_t& key, llarp_buffer_t* buf)
|
|
|
|
{
|
|
|
|
bool read = false;
|
|
|
|
if(key == "c")
|
|
|
|
{
|
|
|
|
return BEncodeReadArray(frames, buf);
|
|
|
|
}
|
2019-07-30 23:42:13 +00:00
|
|
|
if(key == "p")
|
2019-06-04 18:31:17 +00:00
|
|
|
{
|
|
|
|
if(!BEncodeMaybeReadDictEntry("p", pathid, read, key, buf))
|
|
|
|
{
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
else if(key == "s")
|
|
|
|
{
|
|
|
|
if(!BEncodeMaybeReadDictInt("s", status, read, key, buf))
|
|
|
|
{
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
else if(key == "v")
|
|
|
|
{
|
2019-12-06 17:13:09 +00:00
|
|
|
if(!BEncodeMaybeVerifyVersion("v", version, LLARP_PROTO_VERSION, read,
|
|
|
|
key, buf))
|
2019-06-04 18:31:17 +00:00
|
|
|
{
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return read;
|
|
|
|
}
|
|
|
|
|
|
|
|
void
|
|
|
|
LR_StatusMessage::Clear()
|
|
|
|
{
|
|
|
|
std::for_each(frames.begin(), frames.end(), [](auto& f) { f.Clear(); });
|
2019-11-03 15:31:01 +00:00
|
|
|
version = 0;
|
2019-06-04 18:31:17 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
bool
|
|
|
|
LR_StatusMessage::BEncode(llarp_buffer_t* buf) const
|
|
|
|
{
|
|
|
|
if(!bencode_start_dict(buf))
|
|
|
|
return false;
|
|
|
|
// msg type
|
|
|
|
if(!BEncodeWriteDictMsgType(buf, "a", "s"))
|
|
|
|
return false;
|
|
|
|
// frames
|
|
|
|
if(!BEncodeWriteDictArray("c", frames, buf))
|
|
|
|
return false;
|
|
|
|
// path id
|
|
|
|
if(!BEncodeWriteDictEntry("p", pathid, buf))
|
|
|
|
return false;
|
|
|
|
// status (for now, only success bit is relevant)
|
|
|
|
if(!BEncodeWriteDictInt("s", status, buf))
|
|
|
|
return false;
|
|
|
|
// version
|
2019-11-22 17:39:35 +00:00
|
|
|
if(!bencode_write_uint64_entry(buf, "v", 1, LLARP_PROTO_VERSION))
|
2019-06-04 18:31:17 +00:00
|
|
|
return false;
|
|
|
|
|
|
|
|
return bencode_end(buf);
|
|
|
|
}
|
|
|
|
|
|
|
|
bool
|
|
|
|
LR_StatusMessage::HandleMessage(AbstractRouter* router) const
|
|
|
|
{
|
|
|
|
llarp::LogDebug("Received LR_Status message from (", session->GetPubKey(),
|
|
|
|
")");
|
|
|
|
if(frames.size() != path::max_len)
|
|
|
|
{
|
|
|
|
llarp::LogError("LRSM invalid number of records, ", frames.size(),
|
|
|
|
"!=", path::max_len);
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
auto path =
|
|
|
|
router->pathContext().GetByUpstream(session->GetPubKey(), pathid);
|
|
|
|
if(!path)
|
|
|
|
{
|
|
|
|
llarp::LogWarn(
|
|
|
|
"unhandled LR_Status message: no associated IHopHandler found");
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
2019-07-25 23:54:10 +00:00
|
|
|
auto handler =
|
|
|
|
std::make_shared< LRSM_AsyncHandler >(frames, status, path, router);
|
2019-06-04 18:31:17 +00:00
|
|
|
|
|
|
|
handler->queue_handle();
|
|
|
|
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
void
|
|
|
|
LR_StatusMessage::SetDummyFrames()
|
|
|
|
{
|
|
|
|
// TODO
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
// call this from a worker thread
|
|
|
|
bool
|
|
|
|
LR_StatusMessage::CreateAndSend(AbstractRouter* router, const PathID_t pathid,
|
|
|
|
const RouterID nextHop,
|
|
|
|
const SharedSecret pathKey, uint64_t status)
|
|
|
|
{
|
|
|
|
auto message = std::make_shared< LR_StatusMessage >();
|
|
|
|
|
|
|
|
message->status = status & LR_StatusRecord::SUCCESS;
|
|
|
|
message->pathid = pathid;
|
|
|
|
|
|
|
|
message->SetDummyFrames();
|
|
|
|
|
|
|
|
if(!message->AddFrame(pathKey, status))
|
|
|
|
{
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
QueueSendMessage(router, nextHop, message);
|
|
|
|
return true; // can't guarantee delivery here, as far as we know it's fine
|
|
|
|
}
|
|
|
|
|
|
|
|
bool
|
2019-08-01 07:44:26 +00:00
|
|
|
LR_StatusMessage::AddFrame(const SharedSecret& pathKey, uint64_t newStatus)
|
2019-06-04 18:31:17 +00:00
|
|
|
{
|
|
|
|
frames[7] = frames[6];
|
|
|
|
frames[6] = frames[5];
|
|
|
|
frames[5] = frames[4];
|
|
|
|
frames[4] = frames[3];
|
|
|
|
frames[3] = frames[2];
|
|
|
|
frames[2] = frames[1];
|
|
|
|
frames[1] = frames[0];
|
|
|
|
|
|
|
|
auto& frame = frames[0];
|
|
|
|
|
|
|
|
frame.Randomize();
|
|
|
|
|
|
|
|
LR_StatusRecord record;
|
|
|
|
|
2019-08-01 07:44:26 +00:00
|
|
|
record.status = newStatus;
|
2019-06-04 18:31:17 +00:00
|
|
|
record.version = LLARP_PROTO_VERSION;
|
|
|
|
|
|
|
|
llarp_buffer_t buf(frame.data(), frame.size());
|
|
|
|
buf.cur = buf.base + EncryptedFrameOverheadSize;
|
|
|
|
// encode record
|
|
|
|
if(!record.BEncode(&buf))
|
|
|
|
{
|
|
|
|
// failed to encode?
|
|
|
|
LogError(Name(), " Failed to generate Status Record");
|
|
|
|
DumpBuffer(buf);
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
// use ephemeral keypair for frame
|
|
|
|
if(!frame.DoEncrypt(pathKey, true))
|
|
|
|
{
|
|
|
|
LogError(Name(), " Failed to encrypt LRSR");
|
|
|
|
DumpBuffer(buf);
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
void
|
|
|
|
LR_StatusMessage::QueueSendMessage(AbstractRouter* router,
|
|
|
|
const RouterID nextHop,
|
|
|
|
std::shared_ptr< LR_StatusMessage > msg)
|
|
|
|
{
|
|
|
|
auto func = std::bind(&LR_StatusMessage::SendMessage, router, nextHop, msg);
|
2019-11-14 21:56:01 +00:00
|
|
|
LogicCall(router->logic(), func);
|
2019-06-04 18:31:17 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
void
|
|
|
|
LR_StatusMessage::SendMessage(AbstractRouter* router, const RouterID nextHop,
|
|
|
|
std::shared_ptr< LR_StatusMessage > msg)
|
|
|
|
{
|
|
|
|
llarp::LogDebug("Attempting to send LR_Status message to (", nextHop, ")");
|
|
|
|
if(not router->HasSessionTo(nextHop))
|
|
|
|
{
|
|
|
|
llarp::LogError(
|
|
|
|
"Sending LR_Status message, but no connection to previous hop (",
|
|
|
|
nextHop, ")");
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
if(not router->SendToOrQueue(nextHop, msg.get()))
|
|
|
|
{
|
|
|
|
llarp::LogError("Sending LR_Status message, SendToOrQueue to ", nextHop,
|
|
|
|
" failed");
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
bool
|
|
|
|
LR_StatusRecord::BEncode(llarp_buffer_t* buf) const
|
|
|
|
{
|
|
|
|
return bencode_start_dict(buf) && BEncodeWriteDictInt("s", status, buf)
|
2019-11-22 17:39:35 +00:00
|
|
|
&& bencode_write_uint64_entry(buf, "v", 1, LLARP_PROTO_VERSION)
|
|
|
|
&& bencode_end(buf);
|
2019-06-04 18:31:17 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
bool
|
|
|
|
LR_StatusRecord::OnKey(llarp_buffer_t* buffer, llarp_buffer_t* key)
|
|
|
|
{
|
|
|
|
if(!key)
|
|
|
|
return true;
|
|
|
|
|
|
|
|
bool read = false;
|
|
|
|
|
|
|
|
if(!BEncodeMaybeReadDictInt("s", status, read, *key, buffer))
|
|
|
|
return false;
|
2019-11-22 21:14:37 +00:00
|
|
|
if(!BEncodeMaybeVerifyVersion("v", version, LLARP_PROTO_VERSION, read, *key,
|
2019-12-06 17:13:09 +00:00
|
|
|
buffer))
|
2019-06-04 18:31:17 +00:00
|
|
|
return false;
|
|
|
|
|
|
|
|
return read;
|
|
|
|
}
|
|
|
|
|
|
|
|
bool
|
|
|
|
LR_StatusRecord::BDecode(llarp_buffer_t* buf)
|
|
|
|
{
|
|
|
|
return bencode_read_dict(util::memFn(&LR_StatusRecord::OnKey, this), buf);
|
|
|
|
}
|
|
|
|
|
|
|
|
bool
|
|
|
|
LR_StatusRecord::operator==(const LR_StatusRecord& other) const
|
|
|
|
{
|
|
|
|
return status == other.status;
|
|
|
|
}
|
|
|
|
|
|
|
|
} // namespace llarp
|