|
| 1 | +#include <stdint.h> |
| 2 | +#include <stdlib.h> |
| 3 | +#include <stdio.h> |
| 4 | +#include <stdbool.h> |
| 5 | + |
| 6 | +struct gcobj { |
| 7 | + struct gcobj* prev; |
| 8 | + struct gcobj* nextwork; |
| 9 | + struct java_lang_Object obj[]; |
| 10 | +} |
| 11 | + |
| 12 | +static struct gcobj* head = NULL; |
| 13 | + |
| 14 | +/* 1MB shadow stack */ |
| 15 | +#define STACK_SIZE (1024*1024/sizeof(struct gcobj*)) |
| 16 | +static struct gcobj* shadowstack[STACK_SIZE]; |
| 17 | +static struct gcobj** shadowsp = &(shadowstack[0]); |
| 18 | +static struct gcobj** shadowlimit = &(shadowstack[STACK_SIZE]); |
| 19 | + |
| 20 | +#define ROOT_SIZE (1024) |
| 21 | +static struct java_lang_Object** staticroots[ROOT_SIZE]; |
| 22 | +static struct java_lang_Object*** nextroot = &(staticroots[0]); |
| 23 | +static struct java_lang_Object*** rootlimit = &(staticroots[ROOT_SIZE]); |
| 24 | + |
| 25 | +static size_t heapsize = 0; |
| 26 | +#define HEAPLIMIT (64*1024*1024) |
| 27 | + |
| 28 | +static inline struct gcobj* object2gc(struct java_lang_Object *obj) { |
| 29 | + return (struct gcobj*)(((void*)obj)-offsetof(struct gcobj, obj[0])); |
| 30 | +} |
| 31 | + |
| 32 | +static inline struct java_lang_Object* gc2object(struct gcobj *gc) { |
| 33 | + return &(gc->obj[0]); |
| 34 | +} |
| 35 | + |
| 36 | +struct java_lang_Object* rt_new(struct klass *klass) |
| 37 | +{ |
| 38 | + return gcalloc(klass->instsize); |
| 39 | +} |
| 40 | + |
| 41 | +struct java_lang_Object* gcalloc(size_t nbytes) { |
| 42 | + size_t objsize = sizeof(struct gcobj)+nbytes; |
| 43 | + if (heapsize + objsize > HEAPLIMIT) marksweep(); |
| 44 | + if (heapsize + objsize > HEAPLIMIT) { |
| 45 | + fprintf(stderr, "Out of heap\n"); |
| 46 | + abort(); |
| 47 | + } |
| 48 | + struct gcobj* gcp = (struct gcobj*)calloc(1, objsize); |
| 49 | + struct java_lang_Object* obj = gc2object(gcp); |
| 50 | + gcp->prev = head; |
| 51 | + head = gcp; |
| 52 | + rt_initobj(obj, klass); |
| 53 | + return obj; |
| 54 | +} |
| 55 | + |
| 56 | +void rt_addroot(struct java_lang_Object** obj) { |
| 57 | + if (nextroot == rootlimit) { |
| 58 | + fprintf(stderr, "Too many roots\n"); |
| 59 | + fflush(stderr); |
| 60 | + abort(); |
| 61 | + } |
| 62 | + *(nextroot++) = obj; |
| 63 | +} |
| 64 | + |
| 65 | +void rt_pushref(struct java_lang_Object* obj) { |
| 66 | + if (obj == NULL) return; |
| 67 | + if (shadowsp == shadowlimit) { |
| 68 | + fprintf(stderr, "Stack overflow\n"); |
| 69 | + fflush(stderr); |
| 70 | + abort(); |
| 71 | + } |
| 72 | + *(shadowsp++) = object2gc(obj); |
| 73 | +} |
| 74 | + |
| 75 | +void rt_popref(uint32_t n) { |
| 76 | + if (shadowsp-n < &(shadowstack[0])) { |
| 77 | + fprintf(stderr, "Stack underflow\n"); |
| 78 | + fflush(stderr); |
| 79 | + abort(); |
| 80 | + } |
| 81 | + shadowsp-=n; |
| 82 | +} |
| 83 | + |
| 84 | +void marksweep() { |
| 85 | + struct gcobj* workq = NULL; |
| 86 | + for (struct java_lang_Object** curp = &(staticroots[0]); curp < nextroot; curp++) { |
| 87 | + struct gcobj* cur = object2gc(*curp); |
| 88 | + if (!cur->nextwork) { |
| 89 | + if (workq) { |
| 90 | + cur->nextwork = workq; |
| 91 | + } else { |
| 92 | + cur->nextwork = cur; |
| 93 | + } |
| 94 | + workq = cur; |
| 95 | + } |
| 96 | + } |
| 97 | + for (struct gcobj **curp = &(shadowstack[0]); curp < shadowsp; curp++) { |
| 98 | + struct gcobj* cur = *curp; |
| 99 | + if (!cur->nextwork) { |
| 100 | + if (workq) { |
| 101 | + cur->nextwork = workq; |
| 102 | + } else { |
| 103 | + cur->nextwork = cur; |
| 104 | + } |
| 105 | + workq = cur; |
| 106 | + } |
| 107 | + } |
| 108 | + while (workq) { |
| 109 | + struct gcobj* cur = workq; |
| 110 | + struct java_lang_Object* obj = gc2object(cur); |
| 111 | + struct klass* k = obj->klass; |
| 112 | + if (k->instsize == 0) { |
| 113 | + struct array* a = (struct array*)obj; |
| 114 | + if (k->elementklass) { |
| 115 | + struct java_lang_Object** data = (struct java_lang_Object**)&(a->data[0]); |
| 116 | + for (size_t i = 0; i < a->length; i++) { |
| 117 | + struct java_lang_Object* p = *(data+i); |
| 118 | + struct gcobj* gcp = object2gc(p); |
| 119 | + if (gcp->nextwork == NULL) { |
| 120 | + gcp->nextwork = workq; |
| 121 | + workq = gcp; |
| 122 | + } |
| 123 | + } |
| 124 | + } |
| 125 | + } else { |
| 126 | + while (k != class_java_Dlang_DObject) { |
| 127 | + struct klass* sk = k->super; |
| 128 | + struct java_lang_Object** ps; |
| 129 | + ps = (struct reference*)(((char*)obj)+sk->instsize); |
| 130 | + for (size_t i = 0; i < k->npointers; ++i) { |
| 131 | + struct java_lang_Object* p = (ps+i)->object; |
| 132 | + struct gcobj* gcp = object2gc(p); |
| 133 | + if (gcp->nextwork == NULL) { |
| 134 | + gcp->nextwork = workq; |
| 135 | + workq = gcp; |
| 136 | + } |
| 137 | + } |
| 138 | + k = sk; |
| 139 | + } |
| 140 | + } |
| 141 | + if (workq->nextwork == workq) { |
| 142 | + workq == NULL; |
| 143 | + } |
| 144 | + } |
| 145 | + /* everything live has non-null nextwork */ |
| 146 | + workq = head; |
| 147 | + head = NULL; |
| 148 | + while (workq) { |
| 149 | + struct gcobj* cur = workq; |
| 150 | + workq = cur->prev; |
| 151 | + if (cur->nextwork) { |
| 152 | + /* cur is live */ |
| 153 | + cur->prev = head |
| 154 | + head = cur; |
| 155 | + cur->nextwork = NULL; |
| 156 | + } else { |
| 157 | + if (cur->klass-> == /*...*/) { |
| 158 | + } |
| 159 | + free(cur); |
| 160 | + } |
| 161 | + } |
| 162 | +} |
0 commit comments