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
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
|
#include <assert.h>
#include <errno.h>
#include <stddef.h> /* NULL, size_t */
#include <stdint.h> /* uintptr_t */
#include <stdio.h> /* fprintf */
#include <stdlib.h> /* exit */
#include <unistd.h> /* sysconf(_SC_PAGESIZE) */
#include <string.h> /* memset */
#include <sys/mman.h> /* mmap */
#define MIN_ALIGNMENT 16
#ifndef MEMSIZE
#define MEMSIZE 1024*4*1024*1024l
#endif
// sizeof(tls_t) == 4096
#define CACHE_BINS 511
// max cached object: 511 * 64 - 1 = 32703
#define CACHE_BIN_SEPERATION 64
#define unlikely(x) __builtin_expect((x),0)
#ifdef __cplusplus
extern "C" {
#endif
typedef struct chunk {
size_t size; // Size header field for internal use
struct chunk* next;
} chunk_t;
static inline chunk_t* ptr2chunk(void* ptr) {
return (chunk_t*)((uintptr_t)ptr - sizeof(size_t));
}
static inline void* chunk2ptr (chunk_t* chunk) {
return (void*)((uintptr_t)chunk + sizeof(size_t));
}
typedef struct TLStates {
uintptr_t ptr;
uintptr_t end;
chunk_t* bins[CACHE_BINS];
} tls_t;
__thread tls_t* tls;
static inline int size2bin(size_t size) {
assert(size > 0 && size < CACHE_BINS * CACHE_BIN_SEPERATION);
return (size - 1) / CACHE_BIN_SEPERATION;
}
static inline size_t bin2size(int bin) {
assert(bin >= 0 && bin < CACHE_BINS);
return (bin + 1) * CACHE_BIN_SEPERATION;
}
static void init_tls(void) {
void *mem = mmap(NULL, MEMSIZE, PROT_READ|PROT_WRITE, MAP_PRIVATE|MAP_ANONYMOUS, -1, 0);
if (mem == MAP_FAILED) {
perror("mmap");
exit(1);
}
tls = (tls_t*)mem;
tls->ptr = ((uintptr_t)tls) + sizeof(tls_t);
tls->end = (uintptr_t)tls + MEMSIZE;
}
inline static void* bump_alloc(size_t size, size_t align) {
assert(align % 2 == 0);
tls_t* ltls = tls;
// allocate size header
uintptr_t ptr_w_header = ltls->ptr + sizeof(size_t);
// align ptr
size_t mask = align -1;
uintptr_t aligned = (ptr_w_header + mask) & ~mask;
uintptr_t new_ptr = aligned + size;
if (new_ptr > ltls->end)
return NULL;
else {
void* ptr = (void*)ltls->ptr;
// save size in chunk header
ptr2chunk(ptr)->size = size;
ltls->ptr = new_ptr;
return ptr;
}
}
void* malloc(size_t size) {
tls_t* ltls = tls;
if (unlikely(ltls == NULL)) {
init_tls();
}
// cached sizes
if (size < CACHE_BINS * CACHE_BIN_SEPERATION) {
int bin = size2bin(size);
if (ltls->bins[bin] != NULL) {
chunk_t* chunk = ltls->bins[bin];
// remove first chunk from list
ltls->bins[bin] = chunk->next;
return chunk2ptr(chunk);
}
return bump_alloc(bin2size(bin), MIN_ALIGNMENT);
}
return bump_alloc(size, MIN_ALIGNMENT);
}
void free(void* ptr) {
tls_t* ltls = tls;
if (unlikely(ltls == NULL)) {
init_tls();
}
if (ptr == NULL) {
return;
}
chunk_t* chunk = ptr2chunk(ptr);
if (chunk->size < CACHE_BINS * CACHE_BIN_SEPERATION) {
int bin = size2bin(chunk->size);
chunk->next = ltls->bins[bin];
ltls->bins[bin] = chunk;
}
}
void* realloc(void* ptr, size_t size) {
if (ptr == NULL) {
return malloc(size);
}
if (size == 0) {
return NULL;
}
void* new_ptr = malloc(size);
size_t to_copy = ptr2chunk(ptr)->size;
memcpy(new_ptr, ptr, to_copy);
return new_ptr;
}
void* memalign(size_t alignment, size_t size) {
/* if not power of two */
if (!((alignment != 0) && !(alignment & (alignment - 1)))) {
return NULL;
}
if (unlikely(tls == NULL)) {
init_tls();
}
return bump_alloc(size, alignment);
}
int posix_memalign(void **memptr, size_t alignment, size_t size)
{
void *out;
if (memptr == NULL) {
return 22;
}
if ((alignment % sizeof(void*)) != 0) {
return 22;
}
/* if not power of two */
if (!((alignment != 0) && !(alignment & (alignment - 1)))) {
return 22;
}
if (size == 0) {
*memptr = NULL;
return 0;
}
out = memalign(alignment, size);
if (out == NULL) {
return 12;
}
*memptr = out;
return 0;
}
void* calloc(size_t nmemb, size_t size)
{
void *out;
size_t fullsize = nmemb * size;
if ((size != 0) && ((fullsize / size) != nmemb)) {
return NULL;
}
out = malloc(fullsize);
if (out != NULL)
memset(out, 0, fullsize);
return out;
}
void* valloc(size_t size)
{
long ret = sysconf(_SC_PAGESIZE);
if (ret == -1) {
return NULL;
}
return memalign(ret, size);
}
void* pvalloc(size_t size)
{
size_t ps, rem, allocsize;
long ret = sysconf(_SC_PAGESIZE);
if (ret == -1) {
return NULL;
}
ps = ret;
rem = size % ps;
allocsize = size;
if (rem != 0) {
allocsize = ps + (size - rem);
}
return memalign(ps, allocsize);
}
void* aligned_alloc(size_t alignment, size_t size)
{
if (alignment > size) {
return NULL;
}
if ((size % alignment) != 0) {
return NULL;
}
return memalign(alignment, size);
}
int malloc_stats() {
fprintf(stderr, "Bump pointer allocator by muhq\n");
fprintf(stderr, "Memsize: %zu, start address: %p, bump pointer %p\n", MEMSIZE, &tls, tls->ptr);
return 0;
}
#ifdef __cplusplus
}
#endif
|
