lokinet/llarp/util/bencode.cpp

180 lines
3.9 KiB
C++
Raw Normal View History

#include <util/bencode.h>
#include <util/logger.hpp>
2019-01-10 17:43:29 +00:00
#include <cstdlib>
2019-02-18 21:55:27 +00:00
#include <inttypes.h>
2019-02-19 10:35:12 +00:00
#include <stdio.h>
bool
bencode_read_integer(struct llarp_buffer_t* buffer, uint64_t* result)
{
size_t len;
if(*buffer->cur != 'i')
return false;
char numbuf[32];
buffer->cur++;
len = buffer->read_until('e', (byte_t*)numbuf, sizeof(numbuf) - 1);
if(!len)
2019-01-10 17:43:29 +00:00
{
return false;
2019-01-10 17:43:29 +00:00
}
buffer->cur++;
numbuf[len] = '\0';
2019-01-10 17:43:29 +00:00
*result = std::strtoull(numbuf, nullptr, 10);
2018-07-09 17:32:11 +00:00
return true;
}
bool
bencode_read_string(llarp_buffer_t* buffer, llarp_buffer_t* result)
{
char numbuf[10];
size_t len = buffer->read_until(':', (byte_t*)numbuf, sizeof(numbuf) - 1);
if(!len)
return false;
2019-01-10 17:43:29 +00:00
numbuf[len] = '\0';
const int num = atoi(numbuf);
if(num < 0)
2019-01-10 17:43:29 +00:00
{
return false;
2019-01-10 17:43:29 +00:00
}
2019-01-10 17:43:29 +00:00
const size_t slen = num;
buffer->cur++;
len = buffer->size_left();
if(len < slen)
2019-01-10 17:43:29 +00:00
{
return false;
2019-01-10 17:43:29 +00:00
}
result->base = buffer->cur;
result->cur = buffer->cur;
result->sz = slen;
buffer->cur += slen;
return true;
}
2019-01-10 17:43:29 +00:00
bool
bencode_write_bytestring(llarp_buffer_t* buff, const void* data, size_t sz)
{
if(!buff->writef("%zu:", sz))
2019-01-10 17:43:29 +00:00
{
return false;
}
return buff->write(reinterpret_cast< const char* >(data),
reinterpret_cast< const char* >(data) + sz);
2019-01-10 17:43:29 +00:00
}
bool
bencode_write_uint64(llarp_buffer_t* buff, uint64_t i)
{
2019-04-11 16:32:10 +00:00
// NetBSDs also do this shit in long mode, wouldn't be surprised
// if all the BSDs do by default
#if !defined(__LP64__) || (__APPLE__ && __MACH__) || (__NetBSD__) \
|| (__OpenBSD__)
2019-02-22 17:18:54 +00:00
if(!buff->writef("i%llu", i))
2019-02-20 13:46:23 +00:00
#else
2019-02-22 17:18:54 +00:00
if(!buff->writef("i%lu", i))
#endif
{
return false;
}
static const char letter[1] = {'e'};
assert(std::distance(std::begin(letter), std::end(letter)) == 1);
return buff->write(std::begin(letter), std::end(letter));
2019-01-10 17:43:29 +00:00
}
bool
bencode_write_version_entry(llarp_buffer_t* buff)
{
return buff->writef("1:vi%de", LLARP_PROTO_VERSION);
2019-01-10 17:43:29 +00:00
}
bool
bencode_start_list(llarp_buffer_t* buff)
{
static const char letter[1] = {'l'};
assert(std::distance(std::begin(letter), std::end(letter)) == 1);
return buff->write(std::begin(letter), std::end(letter));
2019-01-10 17:43:29 +00:00
}
bool
bencode_start_dict(llarp_buffer_t* buff)
{
static const char letter[1] = {'d'};
assert(std::distance(std::begin(letter), std::end(letter)) == 1);
return buff->write(std::begin(letter), std::end(letter));
2019-01-10 17:43:29 +00:00
}
bool
bencode_end(llarp_buffer_t* buff)
{
static const char letter[1] = {'e'};
assert(std::distance(std::begin(letter), std::end(letter)) == 1);
return buff->write(std::begin(letter), std::end(letter));
2019-01-10 17:43:29 +00:00
}
bool
bencode_read_dict(llarp_buffer_t* buff, struct dict_reader* r)
{
2019-03-28 14:32:15 +00:00
if(buff->size_left() < 2) // minimum case is 'de'
return false;
llarp_buffer_t strbuf; // temporary buffer for current element
r->buffer = buff; // set up dict_reader
if(*r->buffer->cur != 'd') // ensure is a dictionary
return false;
r->buffer->cur++;
while(r->buffer->size_left() && *r->buffer->cur != 'e')
{
if(bencode_read_string(r->buffer, &strbuf))
{
if(!r->on_key(r, &strbuf)) // check for early abort
return false;
}
else
return false;
}
2018-09-06 11:46:19 +00:00
if(*r->buffer->cur != 'e')
{
llarp::LogWarn("reading dict not ending on 'e'");
// make sure we're at dictionary end
return false;
2018-09-06 11:46:19 +00:00
}
r->buffer->cur++;
2018-09-06 11:46:19 +00:00
return r->on_key(r, nullptr);
}
bool
bencode_read_list(llarp_buffer_t* buff, struct list_reader* r)
{
2019-03-28 14:32:15 +00:00
if(buff->size_left() < 2) // minimum case is 'le'
return false;
r->buffer = buff;
if(*r->buffer->cur != 'l') // ensure is a list
2018-08-13 08:47:24 +00:00
{
llarp::LogWarn("bencode::bencode_read_list - expecting list got ",
*r->buffer->cur);
return false;
2018-08-13 08:47:24 +00:00
}
r->buffer->cur++;
while(r->buffer->size_left() && *r->buffer->cur != 'e')
{
if(!r->on_item(r, true)) // check for early abort
return false;
}
if(*r->buffer->cur != 'e') // make sure we're at a list end
return false;
r->buffer->cur++;
return r->on_item(r, false);
}