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.
73 lines
1.3 KiB
C++
73 lines
1.3 KiB
C++
#ifndef LLARP_MEM_HPP
|
|
#define LLARP_MEM_HPP
|
|
#include <llarp/buffer.h>
|
|
#include <llarp/mem.h>
|
|
#include <cctype>
|
|
#include <cstdio>
|
|
#include <memory>
|
|
|
|
namespace llarp
|
|
{
|
|
void
|
|
Zero(void *ptr, size_t sz);
|
|
|
|
template < typename T >
|
|
void
|
|
dumphex(const uint8_t *t)
|
|
{
|
|
size_t idx = 0;
|
|
while(idx < sizeof(T))
|
|
{
|
|
printf("%.2x ", t[idx++]);
|
|
if(idx % 8 == 0)
|
|
printf("\n");
|
|
}
|
|
}
|
|
|
|
template < typename T, size_t align = 128 >
|
|
void
|
|
DumpBuffer(const T &buff)
|
|
{
|
|
size_t idx = 0;
|
|
printf("buffer of size %zu\n", buff.sz);
|
|
while(idx < buff.sz)
|
|
{
|
|
if(buff.base + idx == buff.cur)
|
|
{
|
|
printf("%c[1;31m", 27);
|
|
}
|
|
if(std::isprint(buff.base[idx]))
|
|
{
|
|
printf("%c", buff.base[idx]);
|
|
}
|
|
else
|
|
{
|
|
printf("X");
|
|
}
|
|
if(buff.base + idx == buff.cur)
|
|
{
|
|
printf("%c[0;0m", 27);
|
|
}
|
|
++idx;
|
|
if(idx % align == 0)
|
|
printf("\n");
|
|
}
|
|
printf("\n");
|
|
fflush(stdout);
|
|
}
|
|
|
|
} // namespace llarp
|
|
|
|
#if __cplusplus < 201402L
|
|
namespace std
|
|
{
|
|
template < typename T, typename... Args >
|
|
std::unique_ptr< T >
|
|
make_unique(Args &&... args)
|
|
{
|
|
return std::unique_ptr< T >(new T(std::forward< Args >(args)...));
|
|
}
|
|
} // namespace std
|
|
#endif
|
|
#endif
|