blob: 2d1c1797fbe97ce108643f850721b9a287b94971 (
plain) (
blame)
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
|
#ifndef GC_H
#define GC_H
#include "model.h"
#include <map>
const int GC_QUEUE_SIZE = 262144;
const size_t GC_CYC_THRESHOLD = GC_QUEUE_SIZE >> 1;
typedef std::set<EvalObj*> EvalObjSet;
class GarbageCollector;
#define GC_CYC_TRIGGER(ptr) \
do { \
if ((ptr) && (ptr)->is_container() && !visited.count(ptr)) \
visited.insert(*tail++ = (ptr)); \
} while (0)
#define GC_CYC_DEC(ptr) \
do { \
if ((ptr) && (ptr)->is_container()) \
static_cast<Container*>(ptr)->gc_refs--; \
} while (0)
extern GarbageCollector gc;
#define EXIT_CURRENT_ENVT(lenvt) \
do { \
gc.expose(lenvt); \
lenvt = cont->envt; \
gc.attach(lenvt); \
} while (0)
#define EXIT_CURRENT_CONT(cont) \
do { \
gc.expose(cont); \
cont = cont->prev_cont; \
gc.attach(cont); \
} while (0)
#define EXIT_CURRENT_EXEC(lenvt, cont, args) \
do { \
EXIT_CURRENT_ENVT(lenvt); \
EXIT_CURRENT_CONT(cont); \
gc.expose(args); \
gc.collect(); \
} while (0)
class GarbageCollector {
struct PendingEntry {
EvalObj *obj;
PendingEntry *next;
PendingEntry(EvalObj *obj, PendingEntry *next);
};
EvalObjSet joined;
PendingEntry *pending_list;
size_t resolve_threshold;
public:
GarbageCollector();
void collect();
void cycle_resolve();
void force();
void expose(EvalObj *ptr);
void set_resolve_threshold(size_t new_thres);
void join(EvalObj *ptr);
void quit(EvalObj *ptr);
size_t get_remaining();
EvalObj *attach(EvalObj *ptr);
};
#endif
|