lokinet/llarp/util/bencode.hpp

376 lines
8.7 KiB
C++
Raw Normal View History

#ifndef LLARP_BENCODE_HPP
#define LLARP_BENCODE_HPP
#include <util/buffer.hpp>
#include <util/bencode.h>
#include <util/fs.hpp>
2019-09-01 12:10:49 +00:00
#include <util/logging/logger.hpp>
#include <util/mem.hpp>
2018-12-12 00:33:54 +00:00
#include <fstream>
2019-02-02 23:12:42 +00:00
#include <set>
#include <vector>
2018-07-19 04:58:39 +00:00
namespace llarp
{
2019-05-24 02:01:36 +00:00
template < typename List_t >
bool
BEncodeReadList(List_t& result, llarp_buffer_t* buf);
2018-06-13 16:32:34 +00:00
inline bool
BEncodeWriteDictMsgType(llarp_buffer_t* buf, const char* k, const char* t)
{
return bencode_write_bytestring(buf, k, 1)
&& bencode_write_bytestring(buf, t, 1);
}
2018-08-10 21:34:11 +00:00
2018-06-23 00:00:44 +00:00
template < typename Obj_t >
bool
BEncodeWriteDictString(const char* k, const Obj_t& str, llarp_buffer_t* buf)
{
return bencode_write_bytestring(buf, k, 1)
2018-08-10 21:34:11 +00:00
&& bencode_write_bytestring(buf, str.data(), str.size());
2018-06-23 00:00:44 +00:00
}
template < typename Obj_t >
bool
BEncodeWriteDictEntry(const char* k, const Obj_t& o, llarp_buffer_t* buf)
{
return bencode_write_bytestring(buf, k, 1) && o.BEncode(buf);
}
2018-06-13 16:32:34 +00:00
template < typename Int_t >
bool
BEncodeWriteDictInt(const char* k, const Int_t& i, llarp_buffer_t* buf)
2018-06-13 16:32:34 +00:00
{
return bencode_write_bytestring(buf, k, 1) && bencode_write_uint64(buf, i);
}
2018-08-30 18:48:43 +00:00
template < typename List_t >
bool
BEncodeMaybeReadDictList(const char* k, List_t& item, bool& read,
const llarp_buffer_t& key, llarp_buffer_t* buf)
2018-08-30 18:48:43 +00:00
{
if(key == k)
2018-08-30 18:48:43 +00:00
{
if(!BEncodeReadList(item, buf))
2019-01-10 17:43:29 +00:00
{
2018-08-30 18:48:43 +00:00
return false;
2019-01-10 17:43:29 +00:00
}
2018-08-30 18:48:43 +00:00
read = true;
}
return true;
}
template < typename Item_t >
bool
BEncodeMaybeReadDictEntry(const char* k, Item_t& item, bool& read,
const llarp_buffer_t& key, llarp_buffer_t* buf)
{
if(key == k)
{
if(!item.BDecode(buf))
2018-06-21 12:55:02 +00:00
{
llarp::LogWarnTag("llarp/bencode.hpp", "failed to decode key ", k,
" for entry in dict");
return false;
2018-06-21 12:55:02 +00:00
}
read = true;
}
return true;
}
template < typename Int_t >
bool
BEncodeMaybeReadDictInt(const char* k, Int_t& i, bool& read,
const llarp_buffer_t& key, llarp_buffer_t* buf)
{
if(key == k)
{
if(!bencode_read_integer(buf, &i))
{
llarp::LogWarnTag("llarp/BEncode.hpp", "failed to decode key ", k,
" for integer in dict");
return false;
}
read = true;
}
return true;
}
template < typename Item_t >
bool
BEncodeMaybeReadVersion(const char* k, Item_t& item, uint64_t expect,
bool& read, const llarp_buffer_t& key,
llarp_buffer_t* buf)
{
if(key == k)
{
if(!bencode_read_integer(buf, &item))
return false;
read = item == expect;
}
return true;
}
2018-06-23 00:00:44 +00:00
template < typename List_t >
bool
BEncodeWriteDictBEncodeList(const char* k, const List_t& l,
llarp_buffer_t* buf)
{
if(!bencode_write_bytestring(buf, k, 1))
return false;
if(!bencode_start_list(buf))
return false;
for(const auto& item : l)
if(!item->BEncode(buf))
return false;
return bencode_end(buf);
}
2018-08-30 18:48:43 +00:00
template < typename Array >
bool
BEncodeWriteDictArray(const char* k, const Array& array, llarp_buffer_t* buf)
{
if(!bencode_write_bytestring(buf, k, 1))
return false;
if(!bencode_start_list(buf))
return false;
for(size_t idx = 0; idx < array.size(); ++idx)
if(!array[idx].BEncode(buf))
return false;
return bencode_end(buf);
}
template < typename Iter >
bool
BEncodeWriteList(Iter itr, Iter end, llarp_buffer_t* buf)
{
if(!bencode_start_list(buf))
return false;
while(itr != end)
if(!itr->BEncode(buf))
return false;
else
++itr;
return bencode_end(buf);
}
template < typename Sink >
bool
bencode_read_dict(Sink&& sink, llarp_buffer_t* buffer)
{
if(buffer->size_left() < 2) // minimum case is 'de'
return false;
if(*buffer->cur != 'd') // ensure is a dictionary
return false;
buffer->cur++;
while(buffer->size_left() && *buffer->cur != 'e')
{
llarp_buffer_t strbuf; // temporary buffer for current element
if(bencode_read_string(buffer, &strbuf))
{
if(!sink(buffer, &strbuf)) // check for early abort
return false;
}
else
return false;
}
if(*buffer->cur != 'e')
{
llarp::LogWarn("reading dict not ending on 'e'");
// make sure we're at dictionary end
return false;
}
buffer->cur++;
return sink(buffer, nullptr);
}
2019-05-24 02:01:36 +00:00
template < typename Sink >
bool
bencode_decode_dict(Sink&& sink, llarp_buffer_t* buff)
{
return bencode_read_dict(
[&](llarp_buffer_t* buffer, llarp_buffer_t* key) {
if(key == nullptr)
return true;
if(sink.DecodeKey(*key, buffer))
return true;
llarp::LogWarnTag("llarp/bencode.hpp", "undefined key '", *key->cur,
"' for entry in dict");
return false;
},
buff);
}
template < typename Sink >
2018-07-19 04:58:39 +00:00
bool
bencode_read_list(Sink&& sink, llarp_buffer_t* buffer)
2018-07-19 04:58:39 +00:00
{
if(buffer->size_left() < 2) // minimum case is 'le'
2018-07-19 04:58:39 +00:00
return false;
if(*buffer->cur != 'l') // ensure is a list
{
llarp::LogWarn("bencode::bencode_read_list - expecting list got ",
*buffer->cur);
return false;
}
2018-07-19 04:58:39 +00:00
buffer->cur++;
while(buffer->size_left() && *buffer->cur != 'e')
2018-07-19 04:58:39 +00:00
{
if(!sink(buffer, true)) // check for early abort
2018-07-19 04:58:39 +00:00
return false;
}
if(*buffer->cur != 'e') // make sure we're at a list end
2018-07-19 04:58:39 +00:00
return false;
buffer->cur++;
return sink(buffer, false);
}
template < typename Array >
bool
BEncodeReadArray(Array& array, llarp_buffer_t* buf)
{
size_t idx = 0;
return bencode_read_list(
[&array, &idx](llarp_buffer_t* buffer, bool has) {
if(has)
{
if(idx >= array.size())
return false;
if(!array[idx++].BDecode(buffer))
return false;
}
return true;
},
buf);
}
template < typename List_t >
bool
BEncodeReadList(List_t& result, llarp_buffer_t* buf)
{
return bencode_read_list(
[&result](llarp_buffer_t* buffer, bool has) {
if(has)
{
if(!result.emplace(result.end())->BDecode(buffer))
{
return false;
}
}
return true;
},
buf);
2018-07-19 04:58:39 +00:00
}
template < typename List_t >
bool
BEncodeWriteDictList(const char* k, List_t& list, llarp_buffer_t* buf)
{
return bencode_write_bytestring(buf, k, 1)
&& BEncodeWriteList(list.begin(), list.end(), buf);
}
2018-06-23 00:00:44 +00:00
2019-05-24 02:01:36 +00:00
template < size_t bufsz, typename T >
void
Dump(const T& val)
2018-06-23 00:00:44 +00:00
{
2019-05-24 02:01:36 +00:00
std::array< byte_t, bufsz > tmp;
llarp_buffer_t buf(tmp);
if(val.BEncode(&buf))
2018-09-06 11:46:19 +00:00
{
2019-05-24 02:01:36 +00:00
llarp::DumpBuffer< decltype(buf), 128 >(buf);
2018-07-09 17:32:11 +00:00
}
2019-05-24 02:01:36 +00:00
}
2019-05-24 02:01:36 +00:00
/// read entire file and decode its contents into t
template < typename T >
bool
BDecodeReadFile(const char* fpath, T& t)
{
std::vector< byte_t > ptr;
{
2019-05-24 02:01:36 +00:00
std::ifstream f;
f.open(fpath);
if(!f.is_open())
2019-02-02 23:12:42 +00:00
{
2019-05-24 02:01:36 +00:00
return false;
2019-02-02 23:12:42 +00:00
}
2019-05-24 02:01:36 +00:00
f.seekg(0, std::ios::end);
const std::streampos sz = f.tellg();
f.seekg(0, std::ios::beg);
ptr.resize(sz);
f.read((char*)ptr.data(), sz);
}
llarp_buffer_t buf(ptr);
auto result = t.BDecode(&buf);
if(!result)
{
DumpBuffer(buf);
}
2019-05-24 02:01:36 +00:00
return result;
}
2018-06-23 00:00:44 +00:00
/// read entire file and decode its contents into t
template < typename T >
bool
2019-05-24 02:01:36 +00:00
BDecodeReadFromFile(const char* fpath, T& t)
{
2019-02-02 23:12:42 +00:00
std::vector< byte_t > ptr;
{
std::ifstream f;
f.open(fpath);
if(!f.is_open())
2019-02-02 23:12:42 +00:00
{
return false;
2019-02-02 23:12:42 +00:00
}
f.seekg(0, std::ios::end);
2019-02-02 23:12:42 +00:00
const std::streampos sz = f.tellg();
2018-09-04 19:15:06 +00:00
f.seekg(0, std::ios::beg);
2019-02-02 23:12:42 +00:00
ptr.resize(sz);
f.read((char*)ptr.data(), sz);
}
2019-02-02 23:12:42 +00:00
llarp_buffer_t buf(ptr);
2019-05-24 02:01:36 +00:00
auto result = bencode_decode_dict(t, &buf);
2018-09-04 19:15:06 +00:00
if(!result)
2019-02-02 23:12:42 +00:00
{
2018-09-04 19:15:06 +00:00
DumpBuffer(buf);
2019-02-02 23:12:42 +00:00
}
return result;
}
/// bencode and write to file
template < typename T, size_t bufsz >
bool
BEncodeWriteFile(const char* fpath, const T& t)
{
2019-02-02 23:12:42 +00:00
std::array< byte_t, bufsz > tmp;
llarp_buffer_t buf(tmp);
if(!t.BEncode(&buf))
return false;
buf.sz = buf.cur - buf.base;
{
const fs::path path = std::string(fpath);
auto optional_f =
llarp::util::OpenFileStream< std::ofstream >(path, std::ios::binary);
if(!optional_f)
return false;
auto& f = optional_f.value();
if(!f.is_open())
return false;
f.write((char*)buf.base, buf.sz);
}
return true;
}
2018-06-21 12:55:02 +00:00
} // namespace llarp
2018-08-30 18:48:43 +00:00
#endif