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
use core::cmp::{max, min};
use core::mem::size_of;
use core::ptr;
use math::PowersOf2;
const MIN_HEAP_ALIGN: usize = 4096;
pub struct FreeBlock {
next: *mut FreeBlock,
}
impl FreeBlock {
fn new(next: *mut FreeBlock) -> FreeBlock {
FreeBlock { next: next }
}
}
pub struct Heap<'a> {
heap_base: *mut u8,
heap_size: usize,
free_lists: &'a mut [*mut FreeBlock],
min_block_size: usize,
min_block_size_log2: u8,
}
unsafe impl<'a> Send for Heap<'a> {}
impl<'a> Heap<'a> {
pub unsafe fn new(
heap_base: *mut u8,
heap_size: usize,
free_lists: &mut [*mut FreeBlock])
-> Heap
{
assert!(heap_base != ptr::null_mut());
assert!(free_lists.len() > 0);
let min_block_size = heap_size >> (free_lists.len()-1);
assert_eq!(heap_base as usize & (MIN_HEAP_ALIGN-1), 0);
assert!(heap_size >= min_block_size);
assert!(min_block_size >= size_of::<FreeBlock>());
assert!(heap_size.is_power_of_2());
assert_eq!(min_block_size *
(2u32.pow(free_lists.len() as u32 - 1)) as usize,
heap_size);
for ptr in free_lists.iter_mut() {
*ptr = ptr::null_mut();
}
let mut result = Heap {
heap_base: heap_base,
heap_size: heap_size,
free_lists: free_lists,
min_block_size: min_block_size,
min_block_size_log2: min_block_size.log2(),
};
let order = result.allocation_order(heap_size, 1)
.expect("Failed to calculate order for root heap block");
result.free_list_insert(order, heap_base);
result
}
pub fn allocation_size(&self, mut size: usize, align: usize) -> Option<usize> {
if !align.is_power_of_2() { return None; }
if align > MIN_HEAP_ALIGN { return None; }
if align > size { size = align; }
size = max(size, self.min_block_size);
size = size.next_power_of_2();
if size > self.heap_size { return None; }
Some(size)
}
pub fn allocation_order(&self, size: usize, align: usize) -> Option<usize> {
self.allocation_size(size, align).map(|s| {
(s.log2() - self.min_block_size_log2) as usize
})
}
fn order_size(&self, order: usize) -> usize {
1 << (self.min_block_size_log2 as usize + order)
}
unsafe fn free_list_pop(&mut self, order: usize) -> Option<*mut u8> {
let candidate = self.free_lists[order];
if candidate != ptr::null_mut() {
self.free_lists[order] = (*candidate).next;
Some(candidate as *mut u8)
} else {
None
}
}
unsafe fn free_list_insert(&mut self, order: usize, block: *mut u8) {
let free_block_ptr = block as *mut FreeBlock;
*free_block_ptr = FreeBlock::new(self.free_lists[order]);
self.free_lists[order] = free_block_ptr;
}
unsafe fn free_list_remove(
&mut self, order: usize, block: *mut u8)
-> bool
{
let block_ptr = block as *mut FreeBlock;
let mut checking: *mut *mut FreeBlock = &mut self.free_lists[order];
while *checking != ptr::null_mut() {
if *checking == block_ptr {
*checking = (*(*checking)).next;
return true;
}
checking = &mut ((*(*checking)).next);
}
false
}
unsafe fn split_free_block(
&mut self, block: *mut u8, mut order: usize, order_needed: usize)
{
let mut size_to_split = self.order_size(order);
while order > order_needed {
size_to_split >>= 1;
order -= 1;
let split = block.offset(size_to_split as isize);
self.free_list_insert(order, split);
}
}
pub unsafe fn allocate(&mut self, size: usize, align: usize) -> *mut u8
{
if let Some(order_needed) = self.allocation_order(size, align) {
for order in order_needed..self.free_lists.len() {
if let Some(block) = self.free_list_pop(order) {
if order > order_needed {
self.split_free_block(block, order, order_needed);
}
return block;
}
}
ptr::null_mut()
} else {
ptr::null_mut()
}
}
pub unsafe fn buddy(&self, order: usize, block: *mut u8) -> Option<*mut u8> {
let relative = (block as usize) - (self.heap_base as usize);
let size = self.order_size(order);
if size >= self.heap_size {
None
} else {
Some(self.heap_base.offset((relative ^ size) as isize))
}
}
pub unsafe fn deallocate(
&mut self, ptr: *mut u8, old_size: usize, align: usize)
{
let initial_order = self.allocation_order(old_size, align)
.expect("Tried to dispose of invalid block");
let mut block = ptr;
for order in initial_order..self.free_lists.len() {
if let Some(buddy) = self.buddy(order, block) {
if self.free_list_remove(order, buddy) {
block = min(block, buddy);
continue;
}
}
self.free_list_insert(order, block);
return;
}
}
}
#[cfg(test)]
mod test {
use super::*;
use core::ptr;
extern "C" {
fn memalign(alignment: usize, size: usize) -> *mut u8;
fn free(ptr: *mut u8);
}
#[test]
fn test_allocation_size_and_order() {
unsafe {
let heap_size = 256;
let mem = memalign(4096, heap_size);
let mut free_lists: [*mut FreeBlock; 5] = [0 as *mut _; 5];
let heap = Heap::new(mem, heap_size, &mut free_lists);
assert_eq!(None, heap.allocation_size(256, 256*2));
assert_eq!(Some(16), heap.allocation_size(0, 1));
assert_eq!(Some(16), heap.allocation_size(1, 1));
assert_eq!(Some(16), heap.allocation_size(16, 1));
assert_eq!(Some(32), heap.allocation_size(17, 1));
assert_eq!(Some(32), heap.allocation_size(32, 32));
assert_eq!(Some(256), heap.allocation_size(256, 256));
assert_eq!(Some(64), heap.allocation_size(16, 64));
assert_eq!(Some(0), heap.allocation_order(0, 1));
assert_eq!(Some(0), heap.allocation_order(1, 1));
assert_eq!(Some(0), heap.allocation_order(16, 16));
assert_eq!(Some(1), heap.allocation_order(32, 32));
assert_eq!(Some(2), heap.allocation_order(64, 64));
assert_eq!(Some(3), heap.allocation_order(128, 128));
assert_eq!(Some(4), heap.allocation_order(256, 256));
assert_eq!(None, heap.allocation_order(512, 512));
free(mem);
}
}
#[test]
fn test_buddy() {
unsafe {
let heap_size = 256;
let mem = memalign(4096, heap_size);
let mut free_lists: [*mut FreeBlock; 5] = [0 as *mut _; 5];
let heap = Heap::new(mem, heap_size, &mut free_lists);
let block_16_0 = mem;
let block_16_1 = mem.offset(16);
assert_eq!(Some(block_16_1), heap.buddy(0, block_16_0));
assert_eq!(Some(block_16_0), heap.buddy(0, block_16_1));
let block_32_0 = mem;
let block_32_1 = mem.offset(32);
assert_eq!(Some(block_32_1), heap.buddy(1, block_32_0));
assert_eq!(Some(block_32_0), heap.buddy(1, block_32_1));
let block_32_2 = mem.offset(64);
let block_32_3 = mem.offset(96);
assert_eq!(Some(block_32_3), heap.buddy(1, block_32_2));
assert_eq!(Some(block_32_2), heap.buddy(1, block_32_3));
let block_256_0 = mem;
assert_eq!(None, heap.buddy(4, block_256_0));
free(mem);
}
}
#[test]
fn test_alloc_and_dealloc() {
unsafe {
let heap_size = 256;
let mem = memalign(4096, heap_size);
let mut free_lists: [*mut FreeBlock; 5] = [0 as *mut _; 5];
let mut heap = Heap::new(mem, heap_size, &mut free_lists);
let block_16_0 = heap.allocate(8, 8);
assert_eq!(mem, block_16_0);
let bigger_than_heap = heap.allocate(4096, heap_size);
assert_eq!(ptr::null_mut(), bigger_than_heap);
let bigger_than_free = heap.allocate(heap_size, heap_size);
assert_eq!(ptr::null_mut(), bigger_than_free);
let block_16_1 = heap.allocate(8, 8);
assert_eq!(mem.offset(16), block_16_1);
let block_16_2 = heap.allocate(8, 8);
assert_eq!(mem.offset(32), block_16_2);
let block_32_2 = heap.allocate(32, 32);
assert_eq!(mem.offset(64), block_32_2);
let block_16_3 = heap.allocate(8, 8);
assert_eq!(mem.offset(48), block_16_3);
let block_128_1 = heap.allocate(128, 128);
assert_eq!(mem.offset(128), block_128_1);
let too_fragmented = heap.allocate(64, 64);
assert_eq!(ptr::null_mut(), too_fragmented);
heap.deallocate(block_32_2, 32, 32);
heap.deallocate(block_16_0, 8, 8);
heap.deallocate(block_16_3, 8, 8);
heap.deallocate(block_16_1, 8, 8);
heap.deallocate(block_16_2, 8, 8);
let block_128_0 = heap.allocate(128, 128);
assert_eq!(mem.offset(0), block_128_0);
heap.deallocate(block_128_1, 128, 128);
heap.deallocate(block_128_0, 128, 128);
let block_256_0 = heap.allocate(256, 256);
assert_eq!(mem.offset(0), block_256_0);
free(mem);
}
}
}