Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Draft: Wire Protocol Overhaul, Message Handling Refactor #2204

Merged
merged 32 commits into from
Oct 16, 2023
Merged
Show file tree
Hide file tree
Changes from 1 commit
Commits
Show all changes
32 commits
Select commit Hold shift + click to select a range
a921575
mein gott
dr7ana Aug 29, 2023
11e54f6
More message refactoring
dr7ana Aug 31, 2023
511c20c
Message handling methods
dr7ana Sep 13, 2023
0b6506a
oxen-libquic version bump
dr7ana Sep 13, 2023
81aa044
kitware CI deps
dr7ana Sep 13, 2023
7ce517b
oxen-libquic update; no leak warn deprecated
dr7ana Sep 13, 2023
821cbea
warnings_as_errors fixes
dr7ana Sep 13, 2023
7f8207d
Nuked superfluous interface classes
dr7ana Sep 13, 2023
a4272c4
Added span backport
dr7ana Sep 14, 2023
d1b7eee
Zlib version bump 1.2.13 -> 1.3
dr7ana Sep 14, 2023
fd527d6
Carving through llarp/link
dr7ana Sep 14, 2023
ffb90e8
libquic bump
dr7ana Sep 14, 2023
aaf688c
Deleted a lot
dr7ana Sep 15, 2023
bfa9629
More carving + libquic bump
dr7ana Sep 18, 2023
a3e6cec
Address type migration + libquic bump
dr7ana Sep 19, 2023
d0c3837
libquic bparser merged
dr7ana Sep 21, 2023
ae31909
libquic bump
dr7ana Sep 26, 2023
d9ead7d
crypto and message encoding
dr7ana Sep 27, 2023
ad007ff
libquic/oxen-mq/oxenc version bumps
dr7ana Sep 29, 2023
1a9f977
Message method implementation continued
dr7ana Sep 29, 2023
206bd0b
wawaweewa
dr7ana Oct 3, 2023
f35f7fe
refactor path build message construction, no more async nonsense
tewinget Oct 4, 2023
4ed6a01
following up before Tom meeting
dr7ana Oct 4, 2023
65bd224
Exit endpoints implemented
dr7ana Oct 6, 2023
bd81357
Path message transmission
dr7ana Oct 10, 2023
2cc02d7
handle path build requests, generate responses
tewinget Oct 11, 2023
c8dae87
Path routing partially implementing
dr7ana Oct 11, 2023
5ccec24
callsafe
dr7ana Oct 12, 2023
577f5e6
De-mutexing
dr7ana Oct 12, 2023
a6f901a
RIP everything
dr7ana Oct 12, 2023
6b1e3fb
Touched up path build message handling
dr7ana Oct 16, 2023
e4315cd
More message handling underway
dr7ana Oct 16, 2023
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Jump to
Jump to file
Failed to load files.
Diff view
Diff view
2 changes: 1 addition & 1 deletion CMakeLists.txt
Original file line number Diff line number Diff line change
Expand Up @@ -96,7 +96,7 @@ if(CMAKE_BUILD_TYPE MATCHES "[Dd][Ee][Bb][Uu][Gg]")
add_definitions(-DLOKINET_DEBUG)
endif()

option(WARN_DEPRECATED "show deprecation warnings" ${debug})
option(WARN_DEPRECATED "show deprecation warnings" OFF)

include(CheckCXXSourceCompiles)
include(CheckLibraryExists)
Expand Down
22 changes: 11 additions & 11 deletions llarp/dht/context.cpp
Original file line number Diff line number Diff line change
Expand Up @@ -110,15 +110,15 @@ namespace llarp
/// send a dht message to peer, if keepalive is true then keep the session
/// with that peer alive for 10 seconds
void
DHTSendTo(const RouterID& peer, IMessage* msg, bool keepalive = true) override;
DHTSendTo(const RouterID& peer, AbstractDHTMessage* msg, bool keepalive = true) override;

/// get routers closest to target excluding requester
bool
HandleExploritoryRouterLookup(
const Key_t& requester,
uint64_t txid,
const RouterID& target,
std::vector<std::unique_ptr<IMessage>>& reply) override;
std::vector<std::unique_ptr<AbstractDHTMessage>>& reply) override;

/// handle rc lookup from requester for target
void
Expand All @@ -127,11 +127,11 @@ namespace llarp
uint64_t txid,
const Key_t& target,
bool recursive,
std::vector<std::unique_ptr<IMessage>>& replies) override;
std::vector<std::unique_ptr<AbstractDHTMessage>>& replies) override;

/// relay a dht message from a local path to the main network
bool
RelayRequestForPath(const llarp::PathID_t& localPath, const IMessage& msg) override;
RelayRequestForPath(const llarp::PathID_t& localPath, const AbstractDHTMessage& msg) override;

/// send introset to peer as R/S
void
Expand Down Expand Up @@ -374,7 +374,7 @@ namespace llarp
uint64_t txid,
const Key_t& target,
bool recursive,
std::vector<std::unique_ptr<IMessage>>& replies)
std::vector<std::unique_ptr<AbstractDHTMessage>>& replies)
{
if (target == ourKey)
{
Expand Down Expand Up @@ -475,9 +475,9 @@ namespace llarp
}

void
Context::DHTSendTo(const RouterID& peer, IMessage* msg, bool)
Context::DHTSendTo(const RouterID& peer, AbstractDHTMessage* msg, bool)
{
llarp::DHTImmediateMessage m;
DHTImmediateMessage m;
m.msgs.emplace_back(msg);
router->SendToOrQueue(peer, m);
auto now = Now();
Expand All @@ -489,10 +489,10 @@ namespace llarp
// namespace. by the time this is called, we are inside
// llarp::routing::DHTMessage::HandleMessage()
bool
Context::RelayRequestForPath(const llarp::PathID_t& id, const IMessage& msg)
Context::RelayRequestForPath(const llarp::PathID_t& id, const AbstractDHTMessage& msg)
{
llarp::routing::DHTMessage reply;
if (!msg.HandleMessage(router->dht(), reply.M))
routing::DHTMessage reply;
if (!msg.handle_message(router->dht(), reply.M))
return false;
if (not reply.M.empty())
{
Expand Down Expand Up @@ -584,7 +584,7 @@ namespace llarp
const Key_t& requester,
uint64_t txid,
const RouterID& target,
std::vector<std::unique_ptr<IMessage>>& reply)
std::vector<std::unique_ptr<AbstractDHTMessage>>& reply)
{
std::vector<RouterID> closer;
const Key_t t(target.as_array());
Expand Down
8 changes: 4 additions & 4 deletions llarp/dht/context.hpp
Original file line number Diff line number Diff line change
Expand Up @@ -89,15 +89,15 @@ namespace llarp
uint64_t relayOrder) = 0;

virtual void
DHTSendTo(const RouterID& peer, IMessage* msg, bool keepalive = true) = 0;
DHTSendTo(const RouterID& peer, AbstractDHTMessage* msg, bool keepalive = true) = 0;

/// get routers closest to target excluding requester
virtual bool
HandleExploritoryRouterLookup(
const Key_t& requester,
uint64_t txid,
const RouterID& target,
std::vector<std::unique_ptr<IMessage>>& reply) = 0;
std::vector<std::unique_ptr<AbstractDHTMessage>>& reply) = 0;

/// handle rc lookup from requester for target
virtual void
Expand All @@ -106,10 +106,10 @@ namespace llarp
uint64_t txid,
const Key_t& target,
bool recursive,
std::vector<std::unique_ptr<IMessage>>& replies) = 0;
std::vector<std::unique_ptr<AbstractDHTMessage>>& replies) = 0;

virtual bool
RelayRequestForPath(const PathID_t& localPath, const IMessage& msg) = 0;
RelayRequestForPath(const PathID_t& localPath, const AbstractDHTMessage& msg) = 0;

/// send introset to peer from source with S counter and excluding peers
virtual void
Expand Down
207 changes: 102 additions & 105 deletions llarp/dht/message.cpp
Original file line number Diff line number Diff line change
@@ -1,4 +1,5 @@
#include "context.hpp"
#include "oxenc/bt_serialize.h"

#include <memory>
#include <llarp/util/bencode.hpp>
Expand All @@ -10,128 +11,124 @@
#include <llarp/dht/messages/findname.hpp>
#include <llarp/dht/messages/gotname.hpp>

namespace llarp
namespace llarp::dht
{
namespace dht
struct MessageDecoder
{
struct MessageDecoder
{
const Key_t& From;
IMessage::Ptr_t msg;
bool firstKey = true;
bool relayed = false;
const Key_t& From;
AbstractDHTMessage::Ptr_t msg;
bool firstKey = true;
bool relayed = false;

MessageDecoder(const Key_t& from, bool wasRelayed) : From(from), relayed(wasRelayed)
{}
MessageDecoder(const Key_t& from, bool wasRelayed) : From(from), relayed(wasRelayed)
{}

bool
operator()(llarp_buffer_t* buffer, llarp_buffer_t* key)
bool
operator()(llarp_buffer_t* buffer, llarp_buffer_t* key)
{
llarp_buffer_t strbuf;
// check for empty dict
if (!key)
return !firstKey;
// first key
if (firstKey)
{
llarp_buffer_t strbuf;
// check for empty dict
if (!key)
return !firstKey;

// first key
if (firstKey)
if (!(key->startswith("A")))
return false;
if (!bencode_read_string(buffer, &strbuf))
return false;
// bad msg size?
if (strbuf.sz != 1)
return false;
llarp::LogDebug("Handle DHT message ", *strbuf.base, " relayed=", relayed);
switch (*strbuf.base)
{
if (!(key->startswith("A")))
return false;
if (!bencode_read_string(buffer, &strbuf))
return false;
// bad msg size?
if (strbuf.sz != 1)
return false;
llarp::LogDebug("Handle DHT message ", *strbuf.base, " relayed=", relayed);
switch (*strbuf.base)
{
case 'N':
msg = std::make_unique<FindNameMessage>(From, Key_t{}, 0);
case 'N':
msg = std::make_unique<FindNameMessage>(From, Key_t{}, 0);
break;
case 'M':
msg = std::make_unique<GotNameMessage>(From, 0, service::EncryptedName{});
break;
case 'F':
msg = std::make_unique<FindIntroMessage>(From, relayed, 0);
break;
case 'R':
if (relayed)
msg = std::make_unique<RelayedFindRouterMessage>(From);
else
msg = std::make_unique<FindRouterMessage>(From);
break;
case 'S':
msg = std::make_unique<GotRouterMessage>(From, relayed);
break;
case 'I':
msg = std::make_unique<PublishIntroMessage>(From, relayed);
break;
case 'G':
if (relayed)
{
msg = std::make_unique<RelayedGotIntroMessage>();
break;
case 'M':
msg = std::make_unique<GotNameMessage>(From, 0, service::EncryptedName{});
}
else
{
msg = std::make_unique<GotIntroMessage>(From);
break;
case 'F':
msg = std::make_unique<FindIntroMessage>(From, relayed, 0);
break;
case 'R':
if (relayed)
msg = std::make_unique<RelayedFindRouterMessage>(From);
else
msg = std::make_unique<FindRouterMessage>(From);
break;
case 'S':
msg = std::make_unique<GotRouterMessage>(From, relayed);
break;
case 'I':
msg = std::make_unique<PublishIntroMessage>(From, relayed);
break;
case 'G':
if (relayed)
{
msg = std::make_unique<RelayedGotIntroMessage>();
break;
}
else
{
msg = std::make_unique<GotIntroMessage>(From);
break;
}
default:
llarp::LogWarn("unknown dht message type: ", (char)*strbuf.base);
// bad msg type
return false;
}
firstKey = false;
return msg != nullptr;
}
default:
llarp::LogWarn("unknown dht message type: ", (char)*strbuf.base);
// bad msg type
return false;
}

return msg->DecodeKey(*key, buffer);
firstKey = false;
return msg != nullptr;
}
};

IMessage::Ptr_t
DecodeMesssage(const Key_t& from, llarp_buffer_t* buf, bool relayed)
{
MessageDecoder dec(from, relayed);
if (!bencode_read_dict(dec, buf))
return nullptr;

return std::move(dec.msg);
return msg->decode_key(*key, buffer);
}
};

struct ListDecoder
{
ListDecoder(bool hasRelayed, const Key_t& from, std::vector<IMessage::Ptr_t>& list)
: relayed(hasRelayed), From(from), l(list)
{}
AbstractDHTMessage::Ptr_t
DecodeMessage(const Key_t& from, llarp_buffer_t* buf, bool relayed)
{
MessageDecoder dec(from, relayed);
if (!bencode_read_dict(dec, buf))
return nullptr;

bool relayed;
const Key_t& From;
std::vector<IMessage::Ptr_t>& l;
return std::move(dec.msg);
}

bool
operator()(llarp_buffer_t* buffer, bool has)
{
if (!has)
return true;
auto msg = DecodeMesssage(From, buffer, relayed);
if (msg)
{
l.emplace_back(std::move(msg));
return true;
}
struct ListDecoder
{
ListDecoder(bool hasRelayed, const Key_t& from, std::vector<AbstractDHTMessage::Ptr_t>& list)
: relayed(hasRelayed), From(from), l(list)
{}

return false;
}
};
bool relayed;
const Key_t& From;
std::vector<AbstractDHTMessage::Ptr_t>& l;

bool
DecodeMesssageList(
Key_t from, llarp_buffer_t* buf, std::vector<IMessage::Ptr_t>& list, bool relayed)
operator()(llarp_buffer_t* buffer, bool has)
{
ListDecoder dec(relayed, from, list);
return bencode_read_list(dec, buf);
if (!has)
return true;
auto msg = DecodeMessage(From, buffer, relayed);
if (msg)
{
l.emplace_back(std::move(msg));
return true;
}

return false;
}
} // namespace dht
} // namespace llarp
};

bool
DecodeMessageList(
Key_t from, llarp_buffer_t* buf, std::vector<AbstractDHTMessage::Ptr_t>& list, bool relayed)
{
ListDecoder dec(relayed, from, list);
return bencode_read_list(dec, buf);
}
} // namespace llarp::dht