2018-12-12 02:52:51 +00:00
|
|
|
#include <messages/path_latency.hpp>
|
2018-12-12 02:04:32 +00:00
|
|
|
#include <routing/handler.hpp>
|
2018-06-23 00:00:44 +00:00
|
|
|
|
|
|
|
namespace llarp
|
|
|
|
{
|
|
|
|
namespace routing
|
|
|
|
{
|
|
|
|
PathLatencyMessage::PathLatencyMessage()
|
|
|
|
{
|
|
|
|
}
|
2018-06-26 16:23:43 +00:00
|
|
|
|
|
|
|
bool
|
2019-02-05 00:41:33 +00:00
|
|
|
PathLatencyMessage::DecodeKey(const llarp_buffer_t& key,
|
|
|
|
llarp_buffer_t* val)
|
2018-06-26 16:23:43 +00:00
|
|
|
{
|
|
|
|
bool read = false;
|
|
|
|
if(!BEncodeMaybeReadDictInt("L", L, read, key, val))
|
|
|
|
return false;
|
2018-07-23 21:59:43 +00:00
|
|
|
if(!BEncodeMaybeReadDictInt("S", S, read, key, val))
|
|
|
|
return false;
|
2018-06-26 16:23:43 +00:00
|
|
|
if(!BEncodeMaybeReadDictInt("T", T, read, key, val))
|
|
|
|
return false;
|
|
|
|
return read;
|
|
|
|
}
|
|
|
|
|
|
|
|
bool
|
|
|
|
PathLatencyMessage::BEncode(llarp_buffer_t* buf) const
|
|
|
|
{
|
|
|
|
if(!bencode_start_dict(buf))
|
|
|
|
return false;
|
|
|
|
if(!BEncodeWriteDictMsgType(buf, "A", "L"))
|
|
|
|
return false;
|
|
|
|
if(L)
|
|
|
|
{
|
2018-07-23 21:59:43 +00:00
|
|
|
if(!BEncodeWriteDictInt("L", L, buf))
|
2018-06-26 16:23:43 +00:00
|
|
|
return false;
|
|
|
|
}
|
|
|
|
if(T)
|
|
|
|
{
|
2018-07-23 21:59:43 +00:00
|
|
|
if(!BEncodeWriteDictInt("T", T, buf))
|
2018-06-26 16:23:43 +00:00
|
|
|
return false;
|
|
|
|
}
|
2018-07-23 21:59:43 +00:00
|
|
|
if(!BEncodeWriteDictInt("S", S, buf))
|
|
|
|
return false;
|
2018-06-26 16:23:43 +00:00
|
|
|
return bencode_end(buf);
|
|
|
|
}
|
|
|
|
|
|
|
|
bool
|
2018-12-13 16:14:44 +00:00
|
|
|
PathLatencyMessage::HandleMessage(IMessageHandler* h,
|
2019-02-11 19:45:42 +00:00
|
|
|
AbstractRouter* r) const
|
2018-06-26 16:23:43 +00:00
|
|
|
{
|
2019-04-22 17:38:29 +00:00
|
|
|
return h && h->HandlePathLatencyMessage(*this, r);
|
2018-06-26 16:23:43 +00:00
|
|
|
}
|
|
|
|
|
2018-06-23 00:00:44 +00:00
|
|
|
} // namespace routing
|
2018-12-10 16:26:46 +00:00
|
|
|
} // namespace llarp
|