mirror of https://github.com/oxen-io/lokinet
You cannot select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
58 lines
1.2 KiB
C++
58 lines
1.2 KiB
C++
#ifndef LLARP_BUFFER_HPP
|
|
#define LLARP_BUFFER_HPP
|
|
|
|
#include <util/buffer.h>
|
|
|
|
namespace llarp
|
|
{
|
|
template < typename T >
|
|
llarp_buffer_t
|
|
StackBuffer(T& stack)
|
|
{
|
|
llarp_buffer_t buff;
|
|
buff.base = &stack[0];
|
|
buff.cur = buff.base;
|
|
buff.sz = sizeof(stack);
|
|
return buff;
|
|
}
|
|
|
|
/** initialize llarp_buffer_t from raw memory */
|
|
template < typename T >
|
|
llarp_buffer_t
|
|
InitBuffer(T buf, size_t sz)
|
|
{
|
|
byte_t* ptr = (byte_t*)buf;
|
|
llarp_buffer_t ret;
|
|
ret.cur = ptr;
|
|
ret.base = ptr;
|
|
ret.sz = sz;
|
|
return ret;
|
|
}
|
|
|
|
/** initialize llarp_buffer_t from container */
|
|
template < typename T >
|
|
llarp_buffer_t
|
|
Buffer(T& t)
|
|
{
|
|
// use data over the first element to "enforce" the container used has
|
|
// contiguous memory. (Note this isn't required by the standard, but a
|
|
// reasonable test on most standard library implementations).
|
|
llarp_buffer_t buff(t.data(), t.data(), t.size());
|
|
return buff;
|
|
}
|
|
|
|
template < typename T >
|
|
llarp_buffer_t
|
|
ConstBuffer(const T& t)
|
|
{
|
|
llarp_buffer_t buff;
|
|
buff.base = (byte_t*)&t[0];
|
|
buff.cur = buff.base;
|
|
buff.sz = t.size();
|
|
return buff;
|
|
}
|
|
|
|
} // namespace llarp
|
|
|
|
#endif
|