lokinet/llarp/messages/link_message_parser.cpp

153 lines
3.2 KiB
C++
Raw Normal View History

2019-06-15 14:55:13 +00:00
#include <messages/link_message_parser.hpp>
#include <messages/dht_immediate.hpp>
#include <messages/discard.hpp>
#include <messages/link_intro.hpp>
#include <messages/link_message.hpp>
#include <messages/relay_commit.hpp>
#include <messages/relay_status.hpp>
2019-06-15 14:55:13 +00:00
#include <messages/relay.hpp>
#include <router_contact.hpp>
#include <util/buffer.hpp>
#include <util/logger.hpp>
#include <util/metrics.hpp>
#include <memory>
namespace llarp
{
struct LinkMessageParser::msg_holder_t
2019-06-15 14:55:13 +00:00
{
LinkIntroMessage i;
RelayDownstreamMessage d;
RelayUpstreamMessage u;
DHTImmediateMessage m;
LR_CommitMessage c;
LR_StatusMessage s;
2019-06-15 14:55:13 +00:00
DiscardMessage x;
msg_holder_t() = default;
};
LinkMessageParser::LinkMessageParser(AbstractRouter* _router)
2019-06-15 14:55:14 +00:00
: router(_router)
, from(nullptr)
, msg(nullptr)
, holder(std::make_unique< msg_holder_t >())
2019-06-15 14:55:13 +00:00
{
}
2019-07-30 23:42:13 +00:00
LinkMessageParser::~LinkMessageParser() = default;
2019-06-15 14:55:13 +00:00
bool
LinkMessageParser::operator()(llarp_buffer_t* buffer, llarp_buffer_t* key)
2019-06-15 14:55:13 +00:00
{
// we are reading the first key
if(firstkey)
{
llarp_buffer_t strbuf;
// check for empty dict
if(!key)
return false;
// we are expecting the first key to be 'a'
if(!(*key == "a"))
{
llarp::LogWarn("message has no message type");
return false;
}
if(!bencode_read_string(buffer, &strbuf))
{
llarp::LogWarn("could not read value of message type");
return false;
}
// bad key size
if(strbuf.sz != 1)
{
llarp::LogWarn("bad mesage type size: ", strbuf.sz);
return false;
}
// create the message to parse based off message type
llarp::LogDebug("inbound message ", *strbuf.cur);
bool isLIM = false;
switch(*strbuf.cur)
{
case 'i':
msg = &holder->i;
isLIM = true;
break;
case 'd':
msg = &holder->d;
break;
case 'u':
msg = &holder->u;
break;
case 'm':
msg = &holder->m;
break;
case 'c':
msg = &holder->c;
break;
case 's':
msg = &holder->s;
break;
2019-06-15 14:55:13 +00:00
case 'x':
msg = &holder->x;
break;
default:
return false;
}
if(!isLIM)
{
metrics::integerTick(msg->Name(), "RX", 1, "id",
RouterID(from->GetPubKey()).ToString());
}
msg->session = from;
firstkey = false;
return true;
}
// check for last element
if(!key)
return MessageDone();
return msg->DecodeKey(*key, buffer);
}
bool
LinkMessageParser::MessageDone()
2019-06-15 14:55:13 +00:00
{
bool result = false;
if(msg)
{
result = msg->HandleMessage(router);
}
Reset();
return result;
}
bool
LinkMessageParser::ProcessFrom(ILinkSession* src, const llarp_buffer_t& buf)
2019-06-15 14:55:13 +00:00
{
if(!src)
{
llarp::LogWarn("no link session");
return false;
}
from = src;
firstkey = true;
ManagedBuffer copy(buf);
return bencode_read_dict(*this, &copy.underlying);
}
void
LinkMessageParser::Reset()
2019-06-15 14:55:13 +00:00
{
if(msg)
msg->Clear();
msg = nullptr;
}
} // namespace llarp