oreodave/avm
Archived
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Made heap a vector of pages

Browse Source 
Instead of using a linked list, which is incredibly fragmented, a
vector keeps all pointers together.  Keeps all our stuff together and
in theory we should have less cache misses when deleting pages.

It does introduce the issue of fragmenting, where if we allocate and
then delete many times a lot of the heap vector will be empty so
traversal will be over a ton of useless stuff.
This commit is contained in:
Aryadev Chavali
2024-06-12 19:58:23 +01:00
parent b3de11d1f7
commit a60108ae1d
3 changed files with 40 additions and 71 deletions
Download Patch File Download Diff File Expand all files Collapse all files

13
vm/struct.c
View File

@@ -14,6 +14,7 @@
#include <stdio.h>
#include "./struct.h"
#include "lib/darr.h"
void vm_load_stack(vm_t *vm, byte_t *bytes, size_t size)
{
@@ -180,17 +181,18 @@ void vm_print_program(vm_t *vm, FILE *fp)
void vm_print_heap(vm_t *vm, FILE *fp)
{
heap_t heap = vm->heap;
fprintf(fp, "Heap.pages = %lu\nHeap.data = [", heap.pages);
if (heap.pages == 0)
heap_t heap = vm->heap;
const size_t heap_pages = heap.page_vec.used / sizeof(page_t *);
fprintf(fp, "Heap.pages = %lu\nHeap.data = [", heap_pages);
if (heap_pages == 0)
{
fprintf(fp, "]\n");
return;
}
page_t *cur = heap.beg;
fprintf(fp, "\n");
for (size_t i = 0; i < heap.pages; ++i)
for (size_t i = 0; i < heap_pages; ++i)
{
page_t *cur = DARR_AT(page_t *, heap.page_vec.data, i);
fprintf(fp, "\t[%lu]@%p: ", i, (void *)cur);
if (!cur)
fprintf(fp, "<NIL>\n");
@@ -206,7 +208,6 @@ void vm_print_heap(vm_t *vm, FILE *fp)
fprintf(fp, ",\t");
}
fprintf(fp, "\n\t}\n");
cur = cur->next;
}
}
fprintf(fp, "]\n");