blob: 0e9a8d6a5467b55812ea4bf2d188595932d9835c (
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
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
|
#include "halt.h"
#include "heap.h"
#include "memory.h"
#include "font.h"
#include "interrupts.h"
#define PAGESIZE 0x1000
#define MAGIC ((void *) 0x69)
static heap_header init_free_ptr;
static heap_header *free_ptr = nil;
static usize total_size = 0;
#ifdef DEBUG
void heap_check()
{
heap_header *h = free_ptr;
for (;;) {
if ((u64) h < 0x100000) {
print(S("heap corruption\n"));
asm volatile("int $1");
}
h = h->next;
if (h == free_ptr)
break;
}
}
#endif
void kfree(void *ptr)
{
ISR_UNSAFE
heap_check();
heap_header *h = ((heap_header *) ptr) - 1;
if (h->next != MAGIC)
panic(S("kfree: invalid pointer\n"));
heap_header *next = free_ptr->next;
free_ptr->next = h;
h->next = next;
heap_check();
}
void *try_kmalloc(usize size)
{
ISR_UNSAFE
heap_check();
for (heap_header *prev = free_ptr;; prev = prev->next) {
heap_header *h = prev->next;
if (h->size < size) {
if (h == free_ptr)
break;
else
continue;
}
if (h->size <= size + sizeof(heap_header)) {
prev->next = h->next;
} else {
// split
h->size -= size + sizeof(heap_header);
h = ((void *) h) + sizeof(heap_header) + h->size;
h->size = size;
}
h->next = MAGIC;
free_ptr = prev;
heap_check();
return h + 1;
}
return nil;
}
void *kmalloc(usize size)
{
ISR_UNSAFE
void *ptr = try_kmalloc(size);
if (ptr == nil)
panic(S("kmalloc: out of memory\n"));
return ptr;
}
void *krealloc(void *ptr, usize size)
{
ISR_UNSAFE
if (ptr == nil)
return kmalloc(size);
heap_header *h = ((heap_header *) ptr) - 1;
if (h->next != MAGIC)
panic(S("krealloc: invalid pointer\n"));
void *new = kmalloc(size);
lmemcpy(new, ptr, h->size);
kfree(h + 1);
return new;
}
void heap_init()
{
free_ptr = &init_free_ptr;
free_ptr->size = 0;
free_ptr->next = free_ptr;
}
void heap_add(void *ptr, usize size)
{
// discard blocks that are too small
if (size <= sizeof(heap_header))
return;
heap_header *h = ptr;
h->next = MAGIC;
h->size = size - sizeof(heap_header);
kfree(h + 1);
total_size += size;
}
heap_header *heap_get_free_ptr()
{
return free_ptr;
}
usize heap_total_size()
{
return total_size;
}
|
