lokinet/llarp/bencode.cpp

140 lines
2.8 KiB
C++
Raw Normal View History

#include <llarp/bencode.h>
bool
bencode_write_bytestring(llarp_buffer_t* buff, const void* data, size_t sz)
{
if(!llarp_buffer_writef(buff, "%ld:", sz))
return false;
return llarp_buffer_write(buff, data, sz);
}
bool
bencode_write_uint64(llarp_buffer_t* buff, uint64_t i)
{
2018-07-30 01:53:35 +00:00
return llarp_buffer_writef(buff, "i%lu", i)
&& llarp_buffer_write(buff, "e", 1);
}
bool
bencode_start_list(llarp_buffer_t* buff)
{
return llarp_buffer_write(buff, "l", 1);
}
bool
bencode_start_dict(llarp_buffer_t* buff)
{
return llarp_buffer_write(buff, "d", 1);
}
bool
bencode_end(llarp_buffer_t* buff)
{
return llarp_buffer_write(buff, "e", 1);
}
bool
bencode_write_version_entry(llarp_buffer_t* buff)
{
return llarp_buffer_writef(buff, "1:vi%de", LLARP_PROTO_VERSION);
}
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 =
llarp_buffer_read_until(buffer, 'e', (byte_t*)numbuf, sizeof(numbuf) - 1);
if(!len)
return false;
buffer->cur++;
numbuf[len] = 0;
2018-07-30 01:29:12 +00:00
*result = strtoul(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)
{
size_t len, slen;
int num;
char numbuf[10];
len =
llarp_buffer_read_until(buffer, ':', (byte_t*)numbuf, sizeof(numbuf) - 1);
if(!len)
return false;
numbuf[len] = 0;
num = atoi(numbuf);
if(num < 0)
return false;
slen = num;
buffer->cur++;
len = llarp_buffer_size_left(*buffer);
if(len < slen)
return false;
result->base = buffer->cur;
result->cur = buffer->cur;
result->sz = slen;
buffer->cur += slen;
return true;
}
bool
bencode_read_dict(llarp_buffer_t* buff, struct dict_reader* r)
{
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(llarp_buffer_size_left(*r->buffer) && *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;
}
if(*r->buffer->cur != 'e') // make sure we're at dictionary end
return false;
r->buffer->cur++;
return r->on_key(r, 0);
}
bool
bencode_read_list(llarp_buffer_t* buff, struct list_reader* r)
{
r->buffer = buff;
if(*r->buffer->cur != 'l') // ensure is a list
return false;
r->buffer->cur++;
while(llarp_buffer_size_left(*r->buffer) && *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);
}