Repository navigation
Expand file tree
/
Copy pathmem_alloc.h
More file actions
497 lines (432 loc) · 13 KB
/
Copy pathmem_alloc.h
File metadata and controls
497 lines (432 loc) · 13 KB
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
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
// Copyright © 2019-2023
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
#pragma once
#include <cstdint>
#include <assert.h>
#include <stdio.h>
namespace vortex {
class MemoryAllocator {
public:
MemoryAllocator(
uint64_t baseAddress,
uint64_t capacity,
uint32_t pageAlign,
uint32_t blockAlign)
: baseAddress_(baseAddress)
, capacity_(capacity)
, pageAlign_(pageAlign)
, blockAlign_(blockAlign)
, pages_(nullptr)
, allocated_(0)
{}
~MemoryAllocator() {
page_t* currPage = pages_;
while (currPage) {
auto nextPage = currPage->next;
#ifdef VX_CFG_VM_ENABLE
block_t* currblock = currPage->findfirstUsedBlock();
block_t* nextblock;
while (currblock) {
nextblock= currblock->nextUsed;
currPage->release(currblock);
currblock = nextblock;
}
#endif
delete currPage;
currPage = nextPage;
}
}
uint32_t baseAddress() const {
return baseAddress_;
}
uint32_t capacity() const {
return capacity_;
}
uint64_t free() const {
return (capacity_ - allocated_);
}
uint64_t allocated() const {
return allocated_;
}
int reserve(uint64_t addr, uint64_t size) {
if (size == 0) {
printf("Error: invalid arguments\n");
return -1;
}
size = alignSize(size, pageAlign_);
// Check if the reservation is within memory capacity bounds
if (addr + size > baseAddress_ + capacity_) {
printf("Error: address range out of bounds - requested=0x%lx, base+capacity=0x%lx\n", (addr + size), (baseAddress_ +capacity_));
return -1;
}
// Ensure the reservation does not overlap with existing pages
uint64_t overlapStart, overlapEnd;
if (hasPageOverlap(addr, size, &overlapStart, &overlapEnd)) {
printf("Error: address range overlaps with existing allocation - requested=[0x%lx-0x%lx], existing=[0x%lx, 0x%lx]\n", addr, addr+size, overlapStart, overlapEnd);
return -1;
}
auto newPage = this->createPage(addr, size);
auto freeBlock = newPage->findFreeBlock(size);
newPage->allocate(size, freeBlock);
allocated_ += size;
return 0;
}
int allocate(uint64_t size, uint64_t* addr) {
if (size == 0 || addr == nullptr) {
printf("Error: invalid arguments\n");
return -1;
}
size = alignSize(size, blockAlign_);
// Walk pages to find a free block
block_t* freeBlock = nullptr;
auto currPage = pages_;
while (currPage) {
freeBlock = currPage->findFreeBlock(size);
if (freeBlock != nullptr)
break;
currPage = currPage->next;
}
// Allocate a new page if no free block is found
if (freeBlock == nullptr) {
auto pageSize = alignSize(size, pageAlign_);
uint64_t pageAddr;
if (!this->findNextAddress(pageSize, &pageAddr)) {
printf("Error: out of memory (Can't find next address)\n");
return -1;
}
currPage = this->createPage(pageAddr, pageSize);
if (nullptr == currPage) {
printf("Error: out of memory (Can't create a page)\n");
return -1;
}
freeBlock = currPage->findFreeBlock(size);
}
currPage->allocate(size, freeBlock);
*addr = freeBlock->addr;
allocated_ += size;
return 0;
}
int release(uint64_t addr) {
block_t* usedBlock = nullptr;
auto currPage = pages_;
while (currPage) {
usedBlock = currPage->findUsedBlock(addr);
if (usedBlock != nullptr)
break;
currPage = currPage->next;
}
if (nullptr == usedBlock) {
printf("warning: release address not found: 0x%lx\n", addr);
return -1;
}
auto size = usedBlock->size;
currPage->release(usedBlock);
if (currPage->empty()) {
this->deletePage(currPage);
}
allocated_ -= size;
return 0;
}
private:
struct block_t {
block_t* nextFreeS;
block_t* prevFreeS;
block_t* nextFreeM;
block_t* prevFreeM;
block_t* nextUsed;
block_t* prevUsed;
uint64_t addr;
uint64_t size;
block_t(uint64_t addr, uint64_t size)
: nextFreeS(nullptr)
, prevFreeS(nullptr)
, nextFreeM(nullptr)
, prevFreeM(nullptr)
, nextUsed(nullptr)
, prevUsed(nullptr)
, addr(addr)
, size(size)
{}
};
struct page_t {
page_t* next;
uint64_t addr;
uint64_t size;
page_t(uint64_t addr, uint64_t size, uint32_t blockAlign) :
next(nullptr),
addr(addr),
size(size),
blockAlign_(blockAlign),
usedList_(nullptr) {
freeSList_ = freeMList_ = new block_t(addr, size);
}
~page_t() {
// The page should be empty
assert(nullptr == usedList_);
assert(freeMList_
&& (nullptr == freeMList_->nextFreeM)
&& (nullptr == freeMList_->prevFreeM));
delete freeMList_;
}
bool empty() const {
return (usedList_ == nullptr);
}
void allocate(uint64_t size, block_t* freeBlock) {
this->removeFreeMList(freeBlock);
this->removeFreeSList(freeBlock);
// Split the free block if larger than needed.
uint64_t extraBytes = freeBlock->size - size;
if (extraBytes >= blockAlign_) {
freeBlock->size = size;
auto nextAddr = freeBlock->addr + size;
auto newBlock = new block_t(nextAddr, extraBytes);
this->insertFreeMList(newBlock);
this->insertFreeSList(newBlock);
}
this->insertUsedList(freeBlock);
}
void release(block_t* usedBlock) {
this->removeUsedList(usedBlock);
this->insertFreeMList(usedBlock);
// Merge adjacent free blocks from the left.
if (usedBlock->prevFreeM) {
auto prevAddr = usedBlock->prevFreeM->addr + usedBlock->prevFreeM->size;
if (usedBlock->addr == prevAddr) {
auto prevBlock = usedBlock->prevFreeM;
prevBlock->size += usedBlock->size;
prevBlock->nextFreeM = usedBlock->nextFreeM;
if (prevBlock->nextFreeM) {
prevBlock->nextFreeM->prevFreeM = prevBlock;
}
// Detach prev from S-list since its size grew.
this->removeFreeSList(prevBlock);
delete usedBlock;
usedBlock = prevBlock;
}
}
// Merge adjacent free blocks from the right.
if (usedBlock->nextFreeM) {
auto nextAddr = usedBlock->addr + usedBlock->size;
if (usedBlock->nextFreeM->addr == nextAddr) {
auto nextBlock = usedBlock->nextFreeM;
usedBlock->size += nextBlock->size;
usedBlock->nextFreeM = nextBlock->nextFreeM;
if (usedBlock->nextFreeM) {
usedBlock->nextFreeM->prevFreeM = usedBlock;
}
this->removeFreeSList(nextBlock);
delete nextBlock;
}
}
this->insertFreeSList(usedBlock);
}
block_t* findFreeBlock(uint64_t size) {
auto freeBlock = freeSList_;
if (freeBlock) {
// S-list is sorted largest-first; find the smallest block that fits.
if (freeBlock->size >= size) {
while (freeBlock->nextFreeS && (freeBlock->nextFreeS->size >= size)) {
freeBlock = freeBlock->nextFreeS;
}
return freeBlock;
}
}
return nullptr;
}
block_t* findUsedBlock(uint64_t addr) {
if (addr >= this->addr && addr < (this->addr + this->size)) {
auto useBlock = usedList_;
while (useBlock) {
if (useBlock->addr == addr)
return useBlock;
useBlock = useBlock->nextUsed;
}
}
return nullptr;
}
#ifdef VX_CFG_VM_ENABLE
block_t* findfirstUsedBlock() {
return usedList_;
}
#endif
private:
void insertUsedList(block_t* block) {
block->nextUsed = usedList_;
if (usedList_) {
usedList_->prevUsed = block;
}
usedList_ = block;
}
void removeUsedList(block_t* block) {
if (block->prevUsed) {
block->prevUsed->nextUsed = block->nextUsed;
} else {
usedList_ = block->nextUsed;
}
if (block->nextUsed) {
block->nextUsed->prevUsed = block->prevUsed;
}
block->nextUsed = nullptr;
block->prevUsed = nullptr;
}
void insertFreeMList(block_t* block) {
block_t* currBlock = freeMList_;
block_t* prevBlock = nullptr;
while (currBlock && (currBlock->addr < block->addr)) {
prevBlock = currBlock;
currBlock = currBlock->nextFreeM;
}
block->nextFreeM = currBlock;
block->prevFreeM = prevBlock;
if (prevBlock) {
prevBlock->nextFreeM = block;
} else {
freeMList_ = block;
}
if (currBlock) {
currBlock->prevFreeM = block;
}
}
void removeFreeMList(block_t* block) {
if (block->prevFreeM) {
block->prevFreeM->nextFreeM = block->nextFreeM;
} else {
freeMList_ = block->nextFreeM;
}
if (block->nextFreeM) {
block->nextFreeM->prevFreeM = block->prevFreeM;
}
block->nextFreeM = nullptr;
block->prevFreeM = nullptr;
}
void insertFreeSList(block_t* block) {
block_t* currBlock = freeSList_;
block_t* prevBlock = nullptr;
while (currBlock && (currBlock->size > block->size)) {
prevBlock = currBlock;
currBlock = currBlock->nextFreeS;
}
block->nextFreeS = currBlock;
block->prevFreeS = prevBlock;
if (prevBlock) {
prevBlock->nextFreeS = block;
} else {
freeSList_ = block;
}
if (currBlock) {
currBlock->prevFreeS = block;
}
}
void removeFreeSList(block_t* block) {
if (block->prevFreeS) {
block->prevFreeS->nextFreeS = block->nextFreeS;
} else {
freeSList_ = block->nextFreeS;
}
if (block->nextFreeS) {
block->nextFreeS->prevFreeS = block->prevFreeS;
}
block->nextFreeS = nullptr;
block->prevFreeS = nullptr;
}
uint32_t blockAlign_;
block_t* usedList_;
block_t* freeSList_; // sorted by decreasing size (for allocation)
block_t* freeMList_; // sorted by increasing address (for merging)
};
page_t* createPage(uint64_t addr, uint64_t size) {
auto newPage = new page_t(addr, size, blockAlign_);
// Insert in address-sorted order.
if (pages_ == nullptr || pages_->addr > newPage->addr) {
newPage->next = pages_;
pages_ = newPage;
} else {
page_t* current = pages_;
while (current->next != nullptr && current->next->addr < newPage->addr) {
current = current->next;
}
newPage->next = current->next;
current->next = newPage;
}
return newPage;
}
void deletePage(page_t* page) {
page_t* prevPage = nullptr;
auto currPage = pages_;
while (currPage) {
if (currPage == page) {
if (prevPage) {
prevPage->next = currPage->next;
} else {
pages_ = currPage->next;
}
break;
}
prevPage = currPage;
currPage = currPage->next;
}
delete page;
}
bool findNextAddress(uint64_t size, uint64_t* addr) {
if (pages_ == nullptr) {
*addr = baseAddress_;
return true;
}
page_t* current = pages_;
uint64_t endOfLastPage = baseAddress_;
while (current != nullptr) {
uint64_t startOfCurrentPage = current->addr;
if ((endOfLastPage + size) <= startOfCurrentPage) {
*addr = endOfLastPage;
return true;
}
endOfLastPage = current->addr + current->size;
current = current->next;
}
if ((endOfLastPage + size) <= (baseAddress_ + capacity_)) {
*addr = endOfLastPage;
return true;
}
return false;
}
bool hasPageOverlap(uint64_t start, uint64_t size, uint64_t* overlapStart, uint64_t* overlapEnd) {
page_t* current = pages_;
while (current != nullptr) {
uint64_t pageStart = current->addr;
uint64_t pageEnd = pageStart + current->size;
uint64_t end = start + size;
// Half-open range overlap: [start, end) vs [pageStart, pageEnd).
// Adjacent ranges (start == pageEnd or end == pageStart) do NOT
// overlap.
if ((start < pageEnd) && (end > pageStart)) {
*overlapStart = pageStart;
*overlapEnd = pageEnd;
return true;
}
current = current->next;
}
return false;
}
static uint64_t alignSize(uint64_t size, uint64_t alignment) {
assert(0 == (alignment & (alignment - 1)));
return (size + alignment - 1) & ~(alignment - 1);
}
uint64_t baseAddress_;
uint64_t capacity_;
uint32_t pageAlign_;
uint32_t blockAlign_;
page_t* pages_;
uint64_t nextAddress_;
uint64_t allocated_;
};
} // namespace vortex