summaryrefslogtreecommitdiff
path: root/mem/framer.c
blob: dbd8c9a5c30b2a220e2f1d753c4cb89cbf48df4f (plain)
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
#include "framer.h"

/* Installs a MemFramer at the specified address */
MemFramer *mem_framer_install(void *addr, usize end, uint blksz) {
	MemFramer *self = addr;
	usize selfend = (usize)(self + 1);
	usize next = ALIGN_UP(selfend, blksz);

	*self = (MemFramer) {
		.allocator = (MemAllocator) {
			.alloc = mem_framer_alloc,
			.free = mem_framer_free
		},
		.next = next,
		.end = end,
		.blksz = blksz
	};

	return self;
}

/* Allocates a frame */
void *mem_framer_alloc(MemAllocator *inner, usize n) {
	/* When allocating a frame, we have two paths:
	      1. The freelist is not empty: give away
	         the last freed frame
	      2. The freelist is empty: bump away the next
	         frame (pointed at by the next member)
	   The alloc must fail the freelist is empty and that
	   the next is beyond the end of the region */
	
	MemFramer *self = (MemFramer*)inner;

	/* The implementation does not support more than
	   one frame */
	if (n == 0 || n > self->blksz)
		return nil;

	void *ptr = nil;

	if (self->free) {
		ptr = self->free;
		self->free = self->free->next;
	} else if (self->next + self->blksz <= self->end) {
		ptr = (void*)self->next;
		self->next += self->blksz;
	}

	return ptr;
}

/* Frees a frame */
void mem_framer_free(MemAllocator *inner, void *ptr) {
	/* NOTE: this implementation does make the assumption
	         that the given pointer is the base of the allocated
	         region without correction */

	MemFramer *self = (MemFramer*)inner;

	MemFramerFreed *freed = ptr;
	freed->next = self->free;
	self->free = freed;
}