-
Notifications
You must be signed in to change notification settings - Fork 2
/
p-allocator.cc
58 lines (47 loc) · 1.49 KB
/
p-allocator.cc
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
#include "p-lib.hh"
#define ALLOC_SLOWDOWN 1
extern uint8_t end[];
uint8_t* heap_top;
uint8_t* stack_bottom;
void process_main(void) {
uintptr_t rbp;
asm volatile("movq %%rbp,%0" : "=r" (rbp));
assert(rbp % 16 == 0);
sys_kdisplay(KDISPLAY_MEMVIEWER);
// Fork three new copies. (But ignore failures.)
(void) sys_fork();
(void) sys_fork();
pid_t p = sys_getpid();
srand(p);
// Console testing
bool test_console = false;
if (test_console) {
for (int i = 0; i < CONSOLE_ROWS * CONSOLE_COLUMNS; ++i) {
console[i] = '*' | 0x5000;
}
}
// The heap starts on the page right after the 'end' symbol,
// whose address is the first address not allocated to process code
// or data.
heap_top = ROUNDUP((uint8_t*) end, PAGESIZE);
// The bottom of the stack is the first address on the current
// stack page (this process never needs more than one stack page).
stack_bottom = ROUNDDOWN((uint8_t*) read_rsp() - 1, PAGESIZE);
while (1) {
if (rand(0, ALLOC_SLOWDOWN - 1) < p) {
if (heap_top == stack_bottom || sys_page_alloc(heap_top) < 0) {
break;
}
*heap_top = p; /* check we have write access to new page */
heap_top += PAGESIZE;
}
sys_yield();
if (rand() < RAND_MAX / 32) {
sys_pause();
}
}
// After running out of memory, do nothing forever
while (1) {
sys_yield();
}
}