1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
|
#ifndef PKE_MEMORY_HPP
#define PKE_MEMORY_HPP
#include "memory-type-defs.hpp"
#include "macros.hpp"
#include <cstring>
#include <cstdint>
#include <cstdlib>
#include <cstdio>
#include <cassert>
#include <type_traits>
#include <new>
// 256MB
#define DEFAULT_BUCKET_SIZE 1UL << 27
extern const std::size_t MINIMUM_ALIGNMENT;
extern const std::size_t MAXIMUM_ALIGNMENT;
void *Pke_New(std::size_t sz, std::size_t alignment);
void *Pke_New(std::size_t sz, std::size_t alignment, MemBucket *bkt);
void Pke_Delete(const void *ptr, std::size_t sz);
void Pke_Delete(const void *ptr, std::size_t sz, MemBucket *bkt);
bool Pke_InBucket(const void *ptr, const MemBucket *bkt);
void Pke_DebugPrint();
MemBucket *Pke_BeginTransientBucket(int64_t sz = DEFAULT_BUCKET_SIZE);
void Pke_EndTransientBucket(MemBucket *bkt);
void Pke_ResetBucket(MemBucket *bkt);
void Pke_MemoryFlush();
template <typename T>
inline T *Pke_New(MemBucket *bucket = nullptr) {
void *ptr = nullptr;
if (bucket) {
ptr = Pke_New(sizeof(T), alignof(T), bucket);
} else {
ptr = Pke_New(sizeof(T), alignof(T));
}
if IS_CONSTRUCTIBLE(T) {
return new (ptr) T{};
}
return reinterpret_cast<T *>(ptr);
}
template <typename T>
inline T *Pke_New(long count, MemBucket *bucket = nullptr) {
char *ptr = nullptr;
if (bucket) {
ptr = static_cast<char *>(Pke_New(sizeof(T) * count, alignof(T), bucket));
} else {
ptr = static_cast<char *>(Pke_New(sizeof(T) * count, alignof(T)));
}
if IS_CONSTRUCTIBLE(T) {
for (long i = 0; i < count; ++i) {
new (ptr + (i * sizeof(T))) T{};
}
}
return reinterpret_cast<T *>(ptr);
}
template <typename T>
inline void Pke_Delete(const void *ptr, MemBucket *bucket = nullptr) {
if IS_DESTRUCTIBLE(T) {
reinterpret_cast<const T *>(ptr)->~T();
}
if (bucket) {
return Pke_Delete(ptr, sizeof(T), bucket);
} else {
return Pke_Delete(ptr, sizeof(T));
}
}
template <typename T>
inline void Pke_Delete(const void *ptr, long count, MemBucket *bucket = nullptr) {
if IS_DESTRUCTIBLE(T) {
for (long i = 0; i < count; ++i) {
reinterpret_cast<const T *>(reinterpret_cast<const char *>(ptr) + (i * sizeof(T)))->~T();
}
}
if (bucket) {
return Pke_Delete(ptr, sizeof(T) * count, bucket);
} else {
return Pke_Delete(ptr, sizeof(T) * count);
}
}
#endif /* PKE_MEMORY_HPP */
|
