| 1 |
/* SPDX-License-Identifier: LGPL-2.1-or-later */ |
| 2 |
|
| 3 |
#include <threads.h> |
| 4 |
#include <unistd.h> |
| 5 |
|
| 6 |
#include "alloc-util.h" |
| 7 |
#include "memory-util.h" |
| 8 |
|
| 9 |
size_t page_size(void) { |
| 10 |
static thread_local size_t pgsz = 0; |
| 11 |
long r; |
| 12 |
|
| 13 |
if (_likely_(pgsz > 0)) |
| 14 |
return pgsz; |
| 15 |
|
| 16 |
r = sysconf(_SC_PAGESIZE); |
| 17 |
assert(r > 0); |
| 18 |
|
| 19 |
pgsz = (size_t) r; |
| 20 |
return pgsz; |
| 21 |
} |
| 22 |
|
| 23 |
void* memdup_reverse(const void *mem, size_t size) { |
| 24 |
assert(mem); |
| 25 |
assert(size != 0); |
| 26 |
|
| 27 |
void *p = malloc(size); |
| 28 |
if (!p) |
| 29 |
return NULL; |
| 30 |
|
| 31 |
uint8_t *p_dst = p; |
| 32 |
const uint8_t *p_src = mem; |
| 33 |
for (size_t i = 0, k = size; i < size; i++, k--) |
| 34 |
p_dst[i] = p_src[k-1]; |
| 35 |
|
| 36 |
return p; |
| 37 |
} |
| 38 |
|
| 39 |
void* erase_and_free(void *p) { |
| 40 |
size_t l; |
| 41 |
|
| 42 |
if (!p) |
| 43 |
return NULL; |
| 44 |
|
| 45 |
l = MALLOC_SIZEOF_SAFE(p); |
| 46 |
explicit_bzero_safe(p, l); |
| 47 |
return mfree(p); |
| 48 |
} |