Go to the source code of this file.
|
eusinteger_t | _end () |
|
void | call_disposers () |
|
| dump_bcell (int k, struct buddyfree *b) |
|
void | gc () |
|
pointer | gc_alloc (int s, int e, int cid, int nils) |
|
void | mark (pointer p) |
|
void | markall () |
|
static bpointer | mergecell (bpointer p, int cbix) |
|
int | newchunk (int k) |
|
void | newgcstack (pointer *oldsp) |
|
pointer | p_print (pointer v, context *ctx) |
|
void | reclaim (bpointer p) |
|
void | resume_all_threads () |
|
bpointer | root_alloc_big (context *ctx, int req) |
|
void | root_alloc_small (context *ctx, int req) |
|
void | splitheap (int k, struct buddyfree *buddy) |
|
void | suspend_all_threads () |
|
static void | sweep (struct chunk *cp, int gcmerge) |
|
void | sweepall () |
|
◆ _end()
Definition at line 33 of file eus.c.
◆ call_disposers()
◆ dump_bcell()
◆ gc()
◆ gc_alloc()
pointer gc_alloc |
( |
int |
s, |
|
|
int |
e, |
|
|
int |
cid, |
|
|
int |
nils |
|
) |
| |
◆ mark()
◆ markall()
◆ mergecell()
◆ newchunk()
◆ newgcstack()
◆ p_print()
◆ reclaim()
◆ resume_all_threads()
void resume_all_threads |
( |
| ) |
|
◆ root_alloc_big()
◆ root_alloc_small()
void root_alloc_small |
( |
context * |
ctx, |
|
|
int |
req |
|
) |
| |
◆ splitheap()
void splitheap |
( |
int |
k, |
|
|
struct buddyfree * |
buddy |
|
) |
| |
◆ suspend_all_threads()
void suspend_all_threads |
( |
| ) |
|
◆ sweep()
static void sweep |
( |
struct chunk * |
cp, |
|
|
int |
gcmerge |
|
) |
| |
|
static |
◆ sweepall()
◆ alloccount
long alloccount[MAXBUDDY] |
◆ bottom_addr
◆ chunklist
◆ dispose
◆ dispose_count
◆ edata
◆ freeheap
◆ gccount
◆ gcsp
◆ gcsplimit
◆ gcstack
◆ K_DISPOSE
◆ mark_buddy_q
◆ mark_ctx
◆ mark_root
◆ mark_stack_root
◆ mark_state
◆ marking
◆ marking2
◆ marktime
◆ maxmemory
char* maxmemory =(char *)0x0 |
◆ minmemory
char* minmemory =(char *)0xffffffffffffffff |
◆ QPARAGC
◆ rcsid
◆ sweeptime
◆ top_addr
◆ totalheap