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
|
#include "heap.h"
#include "paging.h"
#include <core/sys.h>
#include <lib/stdlib.h>
#define HEAP_MAGIC 0xBAD0BEEF
#define HEAP_MIN_SIZE 0x4000
/* ******************* HEADER ****************** */
/* For internal use only. Inserts a hole in the heap's hole index at the correct position. */
static void heapIdx_insert(struct heap *heap, struct heap_header *e) {
if ((heap->idxused + sizeof(struct heap_header*) + (size_t)heap->idx) >= heap->start_addr) return;
uint32_t iterator = 0, pos;
while (iterator < heap->idxused && heap->idx[iterator]->size <= e->size) {
if (heap->idx[iterator] == e) return;
iterator++;
}
if (iterator == heap->idxused) {
heap->idx[heap->idxused++] = e;
} else {
pos = iterator;
iterator = heap->idxused;
while (iterator > pos) {
heap->idx[iterator] = heap->idx[iterator - 1];
iterator--;
}
heap->idxused++;
heap->idx[pos] = e;
}
}
/* For internal use only. Removes a hole from the heap's hole index. */
static void heapIdx_remove(struct heap *heap, struct heap_header *e) {
uint32_t iterator;
for (iterator = 0; iterator < heap->idxused; iterator++) {
if (heap->idx[iterator] == e) break;
}
if (iterator == heap->idxused) return;
heap->idxused--;
while (iterator < heap->idxused) {
heap->idx[iterator] = heap->idx[iterator + 1];
iterator++;
}
}
/* ******************** CONTENTS ********************* */
/* Initializes the heap, creates the correct data structures. */
void heap_create(struct heap *heap, size_t start, size_t idxsize, size_t datasize, size_t maxdatasize) {
uint32_t i;
if (start & 0x0FFF) start = (start & 0xFFFFF000) + 0x1000;
heap->start_addr = start + idxsize;
heap->end_addr = start + idxsize + datasize;
heap->max_end = start + idxsize + maxdatasize;
for (i = start; i < heap->end_addr; i += 0x1000) {
page_map(pagedir_getPage(kernel_pagedir, i, 1), frame_alloc(), 0, 0);
}
heap->idx = (struct heap_header**)start;
heap->idxused = 0;
struct heap_header *hole = (struct heap_header*) heap->start_addr;
hole->size = (heap->end_addr - heap->start_addr);
hole->magic = HEAP_MAGIC;
hole->is_hole = 1;
struct heap_footer *hole_footer = (struct heap_footer*)(heap->end_addr - sizeof(struct heap_footer));
hole_footer->header = hole;
hole_footer->magic = HEAP_MAGIC;
heapIdx_insert(heap, hole);
}
/* For internal use only. Called by heap_alloc when necessary. Expands the heap to take more space. */
static uint32_t heap_expand(struct heap *heap, size_t quantity) {
uint32_t i;
if (quantity & 0x0FFF) {
quantity = (quantity & 0xFFFFF000) + 0x1000;
}
if (heap->end_addr + quantity > heap->max_end) return 0;
size_t newEnd = heap->end_addr + quantity;
for (i = heap->end_addr; i < newEnd; i += 0x1000) {
page_map(pagedir_getPage(kernel_pagedir, i, 1), frame_alloc(), 0, 0);
}
struct heap_footer *last_footer = (struct heap_footer*)(heap->end_addr - sizeof(struct heap_footer));
struct heap_header *last_header = last_footer->header;
if (last_header->is_hole) {
heapIdx_remove(heap, last_header);
last_header->size += quantity;
last_footer = (struct heap_footer*)(newEnd - sizeof(struct heap_footer));
last_footer->magic = HEAP_MAGIC;
last_footer->header = last_header;
heapIdx_insert(heap, last_header);
} else {
last_header = (struct heap_header*)heap->end_addr;
last_footer = (struct heap_footer*)(newEnd - sizeof(struct heap_footer));
last_header->is_hole = 1;
last_header->magic = HEAP_MAGIC;
last_header->size = quantity;
last_footer->magic = HEAP_MAGIC;
last_footer->header = last_header;
heapIdx_insert(heap, last_header);
}
heap->end_addr = newEnd;
return 1;
}
/* For internal use only. Called by heap_free when necessary. Reduces the heap's size. */
static void heap_contract(struct heap *heap) {
return; //TODO: this function bugs everything
struct heap_footer *last_footer = (struct heap_footer*)(heap->end_addr - sizeof(struct heap_footer));
struct heap_header *last_header = last_footer->header;
if (last_header->is_hole == 0) return;
if (last_header->size <= 0x1000) return;
size_t quantity = ((heap->end_addr - heap->start_addr) & 0xFFFFF000) - 0x1000;
while ((heap->end_addr - heap->start_addr) - quantity < HEAP_MIN_SIZE ||
last_header->size - 0x4000 < quantity)
quantity -= 0x1000;
if (quantity == 0) return;
size_t newEnd = heap->end_addr - quantity;
heapIdx_remove(heap, last_header);
last_header->size -= quantity;
last_footer = (struct heap_footer*)((size_t)last_footer - quantity);
last_footer->magic = HEAP_MAGIC;
last_footer->header = last_header;
heapIdx_insert(heap, last_header);
for (heap->end_addr -= 0x1000; heap->end_addr >= newEnd; heap->end_addr -= 0x1000) {
page_unmapFree(pagedir_getPage(kernel_pagedir, heap->end_addr, 0));
}
}
/* Alocate some bytes on the heap. */
void* heap_alloc(struct heap *heap, size_t sz) {
ASSERT(heap > 0xE0000000);
size_t newsize = sz + sizeof(struct heap_header) + sizeof(struct heap_footer);
uint32_t iterator = 0;
while (iterator < heap->idxused) {
if (heap->idx[iterator]->size >= newsize) break;
iterator++;
}
if (iterator == heap->idxused) { //No hole is big enough
if (heap_expand(heap,
MAX((heap->end_addr - heap->start_addr) & 0xFFFFF000, (newsize & 0xFFFFF000) + 0x1000)
) == 0) return 0; //FAILED
return heap_alloc(heap, sz);
}
struct heap_header *loc = heap->idx[iterator];
heapIdx_remove(heap, loc);
struct heap_footer *footer = (struct heap_footer*)((size_t)loc + loc->size - sizeof(struct heap_footer));
loc->is_hole = 0;
//If we have enough space to create a USEFUL new hole next to the allocated block, do it.
//If we do not, we might return a block that is a few bytes bigger than needed.
if (loc->size > (newsize + sizeof(struct heap_header) + sizeof(struct heap_footer))) {
loc->size = newsize;
//Write footer for block we return
struct heap_footer *newfooter = (struct heap_footer*)((size_t)loc + newsize - sizeof(struct heap_footer));
newfooter->header = loc;
newfooter->magic = HEAP_MAGIC;
//Write header for new hole we create
struct heap_header *nextloc = (struct heap_header*)((size_t)loc + newsize);
nextloc->is_hole = 1;
nextloc->magic = HEAP_MAGIC;
nextloc->size = ((size_t)footer - (size_t)nextloc + sizeof(struct heap_footer));
footer->header = nextloc; //Update footer
footer->magic = HEAP_MAGIC;
heapIdx_insert(heap, nextloc);
}
return (void*)((size_t)loc + sizeof(struct heap_header));
}
/* Frees a block previously allocated on the heap. */
void heap_free(struct heap *heap, void* ptr) {
if (ptr == 0) return;
if ((size_t)ptr < heap->start_addr || (size_t)ptr > heap->end_addr) return;
struct heap_header *header = (struct heap_header*)((size_t)ptr - sizeof(struct heap_header));
struct heap_footer *footer = (struct heap_footer*)((size_t)header + header->size - sizeof(struct heap_footer));
if (header->magic != HEAP_MAGIC || footer->magic != HEAP_MAGIC) return;
//Unify left
struct heap_footer *prev_footer = (struct heap_footer*)((size_t)header - sizeof(struct heap_footer));
if (prev_footer->magic == HEAP_MAGIC && prev_footer->header->is_hole) {
header = prev_footer->header;
heapIdx_remove(heap, header);
footer->header = header;
header->size = ((size_t)footer - (size_t)header + sizeof(struct heap_footer));
}
//Unify right
struct heap_header *next_header = (struct heap_header*)((size_t)footer + sizeof(struct heap_footer));
if (next_header->magic == HEAP_MAGIC && next_header->is_hole) {
heapIdx_remove(heap, next_header);
footer = (struct heap_footer*)((size_t)footer + next_header->size);
footer->header = header;
header->size = ((size_t)footer - (size_t)header + sizeof(struct heap_footer));
}
header->is_hole = 1;
heapIdx_insert(heap, header);
if ((size_t)footer == (heap->end_addr - sizeof(struct heap_footer)) &&
header->size >= 0x2000 && (heap->end_addr - heap->start_addr > HEAP_MIN_SIZE)) {
heap_contract(heap);
}
}
|
