Rakarake/churf
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

Yoinked a newer GC.

Browse source
This commit is contained in:
Samuel Hammersberg 2023-05-06 12:47:40 +02:00
parent a388f480e5
commit ab87f7fb15
6 changed files with 1015 additions and 196 deletions
Download patch file Download diff file Expand all files Collapse all files

12
src/GC/include/heap.hpp
View file

@ -4,12 +4,13 @@
#include <stdlib.h>
#include <vector>
#include <unordered_map>
#include <queue>
#include "chunk.hpp"
#include "profiler.hpp"
#define HEAP_SIZE 320//65536
#define FREE_THRESH (uint) 0
#define HEAP_SIZE 1000000//65536
#define FREE_THRESH (uint) 100
// #define HEAP_DEBUG
namespace GC
@ -64,12 +65,11 @@ namespace GC
static bool profiler_enabled();
// static Chunk *get_at(std::vector<Chunk *> &list, size_t n);
void collect();
void collect(uintptr_t *stack_bottom);
void sweep(Heap &heap);
Chunk *try_recycle_chunks(size_t size);
void free(Heap &heap);
void free_overlap(Heap &heap);
void mark(uintptr_t *start, const uintptr_t *end, std::vector<Chunk *> &worklist);
void mark_hash(uintptr_t *start, const uintptr_t *end);
Chunk* find_pointer_hash(uintptr_t *start, const uintptr_t *end);
void create_table();
@ -78,6 +78,10 @@ namespace GC
void mark_step(uintptr_t start, uintptr_t end, std::vector<Chunk *> &worklist);
void mark_range(std::vector<AddrRange *> &ranges, std::vector<Chunk *> &worklist);
void find_roots(uintptr_t *stack_bottom, std::vector<uintptr_t *> &roots);
void mark(std::vector<uintptr_t *> &roots);
void find_chunks(uintptr_t *stack_addr, std::queue<std::pair<uintptr_t, uintptr_t>> &chunk_spaces);
// Temporary
Chunk *try_recycle_chunks_new(size_t size);
void free_overlap_new(Heap &heap);