lokinet/llarp/buffer.cpp

84 lines
1.7 KiB
C++
Raw Normal View History

2018-01-25 16:24:33 +00:00
#include <llarp/buffer.h>
2018-04-04 15:19:11 +00:00
#include <stdarg.h>
#include <stdio.h>
2018-01-19 16:51:27 +00:00
extern "C" {
2018-05-10 23:32:46 +00:00
size_t llarp_buffer_size_left(llarp_buffer_t* buff) {
size_t diff = buff->cur - buff->base;
if (diff > buff->sz)
return 0;
else
return buff->sz - diff;
}
2018-04-05 14:43:16 +00:00
bool llarp_buffer_writef(llarp_buffer_t* buff, const char* fmt, ...) {
int written;
size_t sz = llarp_buffer_size_left(buff);
va_list args;
va_start(args, fmt);
written = snprintf(buff->cur, sz, fmt, args);
va_end(args);
if (written == -1) return false;
buff->sz += written;
return true;
}
2018-04-08 12:18:16 +00:00
2018-05-10 23:32:46 +00:00
bool llarp_buffer_write(llarp_buffer_t* buff, const void* data, size_t sz) {
size_t left = llarp_buffer_size_left(buff);
if (left >= sz) {
memcpy(buff->cur, data, sz);
buff->cur += sz;
return true;
}
return false;
}
2018-04-30 16:14:20 +00:00
bool llarp_buffer_readfile(llarp_buffer_t* buff, FILE* f, llarp_alloc* mem) {
ssize_t len;
fseek(f, 0, SEEK_END);
len = ftell(f);
rewind(f);
if (len > 0) {
2018-05-16 18:13:18 +00:00
buff->base = static_cast<char*>(mem->alloc(mem, len, 8));
2018-04-30 16:14:20 +00:00
buff->cur = buff->base;
buff->sz = len;
2018-05-16 15:53:28 +00:00
ssize_t sz = fread(buff->base, len, 1, f);
2018-04-08 12:18:16 +00:00
rewind(f);
2018-04-30 16:14:20 +00:00
return sz == len;
2018-04-08 12:18:16 +00:00
}
2018-04-30 16:14:20 +00:00
return false;
}
2018-05-13 18:07:36 +00:00
size_t llarp_buffer_read_until(llarp_buffer_t * buff, char delim, char * result, size_t resultsize)
{
size_t read = 0;
while(*buff->cur != delim && resultsize && (buff->cur != buff->base + buff->sz))
{
*result = *buff->cur;
buff->cur ++;
result ++;
resultsize --;
read ++;
}
if(llarp_buffer_size_left(buff))
return read;
else
return 0;
}
bool llarp_buffer_eq(llarp_buffer_t buf, const char * str)
{
while(*str && buf.cur != (buf.base + buf.sz))
{
if(*buf.cur != *str) return false;
buf.cur ++;
str++;
}
return *str == 0;
}
2018-01-19 16:51:27 +00:00
}