-
-
Notifications
You must be signed in to change notification settings - Fork 90
/
gc.c
740 lines (670 loc) · 22.2 KB
/
gc.c
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
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
/**\file gc.c
Generational copying garbage collector, non-precise with Cheney loop.
Heavily based on Qish, a lightweight copying generational GC
by Basile Starynkevitch.
http://starynkevitch.net/Basile/qishintro.html
(c) 2008 why the lucky stiff, the freelance professor
*/
#include <stdio.h>
#include <stdlib.h>
#include "potion.h"
#include "internal.h"
#include "gc.h"
#include "khash.h"
#include "table.h"
#if defined(DEBUG)
//mingw32 has struct timeval in sys/time.h
//#ifdef WIN32
//# include <time.h>
//#else
#include <sys/time.h>
//#endif
static double mytime() {
struct timeval Tp;
struct timezone Tz;
int status;
status = gettimeofday (&Tp, &Tz);
if (status == 0) {
Tp.tv_sec += Tz.tz_minuteswest * 60; /* adjust for TZ */
return Tp.tv_sec + (Tp.tv_usec / 1000000.0);
} else {
return -1.0;
}
}
#define DBG_Gv(P,...) \
if (P->flags & DEBUG_GC && P->flags & DEBUG_VERBOSE) { \
printf(__VA_ARGS__); \
}
#define DBG_G(P,...) \
if (P->flags & DEBUG_GC) { \
printf(__VA_ARGS__); \
}
#else
#define DBG_Gv(...)
#define DBG_G(...)
#endif
PN_SIZE potion_stack_len(Potion *P, _PN **p) {
_PN *esp, *c = P->mem->cstack;
POTION_ESP(&esp);
if (p) *p = STACK_UPPER(c, esp);
return esp < c ? c - esp : esp - c + 1;
}
#define HAS_REAL_TYPE(v) (P->vts == NULL || (((struct PNFwd *)v)->fwd == POTION_COPIED || PN_TYPECHECK(PN_VTYPE(v))))
ATTRIBUTE_NO_ADDRESS_SAFETY_ANALYSIS
static PN_SIZE pngc_mark_array(Potion *P, register _PN *x, register long n, int type) {
_PN v;
PN_SIZE i = 0;
struct PNMemory *M = P->mem;
while (n--) {
v = *x;
if (IS_GC_PROTECTED(v) || IN_BIRTH_REGION(v) || IN_OLDER_REGION(v)) {
v = potion_fwd(v);
switch (type) {
case 0: // count only
if (!IS_GC_PROTECTED(v) && IN_BIRTH_REGION(v) && HAS_REAL_TYPE(v)) {
i++;
DBG_Gv(P,"GC mark count only %p %6x\n", x, PN_TYPE(*x));
}
break;
case 1: // minor
if (!IS_GC_PROTECTED(v) && IN_BIRTH_REGION(v) && HAS_REAL_TYPE(v)) {
GC_FORWARD(x, v);
i++;
DBG_Gv(P,"GC mark minor %p -> 0x%lx %6x\n", x, v, PN_TYPE(*x));
}
break;
case 2: // major
if (!IS_GC_PROTECTED(v) && (IN_BIRTH_REGION(v) || IN_OLDER_REGION(v)) && HAS_REAL_TYPE(v)) {
GC_FORWARD(x, v);
i++;
DBG_Gv(P,"GC mark major %p -> 0x%lx %6x\n", x, v, PN_TYPE(*x));
}
break;
}
}
x++;
}
return i;
}
ATTRIBUTE_NO_ADDRESS_SAFETY_ANALYSIS
PN_SIZE potion_mark_stack(Potion *P, int type) {
long n;
_PN *end, *start = P->mem->cstack;
POTION_ESP(&end);
#if POTION_STACK_DIR > 0
n = end - start;
#else
n = start - end + 1;
start = end;
end = P->mem->cstack;
#endif
DBG_Gv(P,"mark_stack (%p -> %p = %ld, type=%d)\n", start, end, n, type);
if (n <= 0) return 0;
return pngc_mark_array(P, start, n, type);
}
void *pngc_page_new(int *sz, const char exec) {
*sz = PN_ALIGN(*sz, POTION_PAGESIZE);
return potion_mmap(*sz, exec);
}
void pngc_page_delete(void *mem, int sz) {
potion_munmap(mem, PN_ALIGN(sz, POTION_PAGESIZE));
}
static inline int NEW_BIRTH_REGION(struct PNMemory *M, void **wb, int sz) {
int keeps = wb - (void **)M->birth_storeptr;
void *newad = pngc_page_new(&sz, 0);
if (newad == NULL)
potion_fatal("Out of memory");
wb = (void *)(((void **)(newad + sz)) - (keeps + 4));
PN_MEMCPY_N(wb + 1, M->birth_storeptr + 1, void *, keeps);
DEL_BIRTH_REGION();
SET_GEN(birth, newad, sz);
SET_STOREPTR(5 + keeps);
return sz;
}
/** \par
Both this function and potion_gc_major embody a simple
Cheney loop (also called a "two-finger collector.")
http://en.wikipedia.org/wiki/Cheney%27s_algorithm
(Again, many thanks to Basile Starynkevitch for
his tutelage in this matter.)
*/
static int potion_gc_minor(Potion *P, int sz) {
struct PNMemory *M = P->mem;
void *scanptr = 0;
void **storead = 0, **wb = 0;
if (sz < 0)
sz = 0;
else if (sz >= POTION_MAX_BIRTH_SIZE)
return POTION_NO_MEM;
scanptr = (void *) M->old_cur;
DBG_Gv(P,"running gc_minor "
"(young: %p -> %p = %ld) "
"(old: %p -> %p = %ld) "
"(storeptr len = %ld)\n",
M->birth_lo, M->birth_hi, (long)(M->birth_hi - M->birth_lo),
M->old_lo, M->old_hi, (long)(M->old_hi - M->old_lo),
(long)((void *)M->birth_hi - (void *)M->birth_storeptr));
potion_mark_stack(P, 1);
GC_MINOR_STRINGS();
wb = (void **)M->birth_storeptr;
for (storead = wb; storead < (void **)M->birth_hi; storead++) {
PN v = (PN)*storead;
if (PN_IS_PTR(v))
potion_mark_minor(P, (const struct PNObject *)v);
}
storead = 0;
while ((PN)scanptr < (PN)M->old_cur)
scanptr = potion_mark_minor(P, scanptr);
scanptr = 0;
sz += 2 * POTION_PAGESIZE;
sz = max(sz, potion_birth_suggest(sz, M->old_lo, M->old_cur));
sz = NEW_BIRTH_REGION(M, wb, sz);
M->minors++;
DBG_Gv(P,"(new young: %p -> %p = %ld)\n", M->birth_lo, M->birth_hi, (long)(M->birth_hi - M->birth_lo));
return POTION_OK;
}
static int potion_gc_major(Potion *P, int siz) {
struct PNMemory *M = P->mem;
void *prevoldlo = 0;
void *prevoldhi = 0;
void *prevoldcur = 0;
void *newold = 0;
void *protptr = (void *)M + PN_ALIGN(sizeof(struct PNMemory), 8);
void *scanptr = 0;
void **wb = 0;
int birthest = 0;
int birthsiz = 0;
int newoldsiz = 0;
int oldsiz = 0;
if (siz < 0)
siz = 0;
else if (siz >= POTION_MAX_BIRTH_SIZE) {
fprintf(stderr, "** Requesting too much memory: 0x%x > 0x%x\n", siz, POTION_MAX_BIRTH_SIZE);
return POTION_NO_MEM;
}
prevoldlo = (void *)M->old_lo;
prevoldhi = (void *)M->old_hi;
prevoldcur = (void *)M->old_cur;
DBG_G(P,"running gc_major "
"(young: %p -> %p = %ld) "
"(old: %p -> %p = %ld)\n",
M->birth_lo, M->birth_hi, (long)(M->birth_hi - M->birth_lo),
M->old_lo, M->old_hi, (long)(M->old_hi - M->old_lo));
birthest = potion_birth_suggest(siz, prevoldlo, prevoldcur);
newoldsiz = (((char *)prevoldcur - (char *)prevoldlo) + siz + birthest +
POTION_GC_THRESHOLD + 16 * POTION_PAGESIZE) + ((char *)M->birth_cur - (char *)M->birth_lo);
newold = pngc_page_new(&newoldsiz, 0);
if (newold == NULL) {
fprintf(stderr, "** Out of memory\n");
return POTION_NO_MEM;
}
M->old_cur = scanptr = newold + (sizeof(PN) * 2);
DBG_G(P,"(new old: %p -> %p = %d)\n", newold, (char *)newold + newoldsiz, newoldsiz);
potion_mark_stack(P, 2);
wb = (void **)M->birth_storeptr;
if (M->birth_lo != M) {
while ((PN)protptr < (PN)M->protect)
protptr = potion_mark_major(P, protptr);
}
while ((PN)scanptr < (PN)M->old_cur)
scanptr = potion_mark_major(P, scanptr);
scanptr = 0;
GC_MAJOR_STRINGS();
pngc_page_delete((void *)prevoldlo, (char *)prevoldhi - (char *)prevoldlo);
prevoldlo = 0;
prevoldhi = 0;
prevoldcur = 0;
birthsiz = NEW_BIRTH_REGION(M, wb, siz + birthest);
oldsiz = ((char *)M->old_cur - (char *)newold) +
(birthsiz + 2 * birthest + 4 * POTION_PAGESIZE);
oldsiz = PN_ALIGN(oldsiz, POTION_PAGESIZE);
if (oldsiz < newoldsiz) {
pngc_page_delete((void *)newold + oldsiz, newoldsiz - oldsiz);
newoldsiz = oldsiz;
}
M->old_lo = newold;
M->old_hi = (char *)newold + newoldsiz;
M->majors++;
newold = 0;
return POTION_OK;
}
void potion_garbagecollect(Potion *P, int sz, int full) {
struct PNMemory *M = P->mem;
if (M->collecting) return;
#ifdef DEBUG
double time = mytime();
#endif
M->pass++;
M->collecting = 1;
if (M->old_lo == NULL) {
int gensz = POTION_MIN_BIRTH_SIZE * 4;
if (gensz < sz * 4)
gensz = min(POTION_MAX_BIRTH_SIZE, PN_ALIGN(sz * 4, POTION_PAGESIZE));
void *page = pngc_page_new(&gensz, 0);
if (page == NULL) {
fprintf(stderr, "** Out of memory\n");
return;
}
SET_GEN(old, page, gensz);
full = 0;
} else if ((char *) M->old_cur + sz + potion_birth_suggest(sz, M->old_lo, M->old_cur) +
((char *) M->birth_hi - (char *) M->birth_lo) > (char *) M->old_hi)
full = 1;
#if POTION_GC_PERIOD>0
else if (M->pass % POTION_GC_PERIOD == POTION_GC_PERIOD)
full = 1;
#endif
if (full)
potion_gc_major(P, sz);
else
potion_gc_minor(P, sz);
#ifdef DEBUG
M->time += mytime() - time;
#endif
M->dirty = 0;
M->collecting = 0;
}
PN_SIZE potion_type_size(Potion *P, const struct PNObject *ptr) {
int sz = 0;
switch (((struct PNFwd *)ptr)->fwd) {
case POTION_COPIED:
case POTION_FWD:
sz = ((struct PNFwd *)ptr)->siz;
goto done_1;
}
if (ptr->vt < PN_TNIL) goto err;
if (ptr->vt > PN_TUSER) {
if (P->vts && ptr->vt < PN_TNIL + P->vts->len
&& PN_VTABLE(ptr->vt) && PN_TYPECHECK(ptr->vt)) {
sz = sizeof(struct PNObject) +
(((struct PNVtable *)PN_VTABLE(ptr->vt))->ivlen * sizeof(PN));
//sz = potion_send((PN)ptr, PN_size); //cannot use bind with POTION_COPIED objs during GC!
} else {
err:
if (P->flags & (DEBUG_VERBOSE
#ifdef DEBUG
|DEBUG_GC
#endif
))
fprintf(stderr, "** Invalid User Object 0x%lx vt: 0x%lx\n",
(unsigned long)ptr, (unsigned long)ptr->vt);
return 0;
}
goto done_1;
}
switch (ptr->vt) {
case PN_TNUMBER:
sz = sizeof(struct PNDouble);
break;
case PN_TSTRING:
sz = sizeof(struct PNString) + PN_STR_LEN(ptr) + 1;
break;
case PN_TCLOSURE:
sz = sizeof(struct PNClosure) + (PN_CLOSURE(ptr)->extra * sizeof(PN));
break;
case PN_TTUPLE:
sz = sizeof(struct PNTuple) + (sizeof(PN) * ((struct PNTuple *)ptr)->alloc);
break;
case PN_TSTATE:
sz = sizeof(Potion);
break;
case PN_TFILE:
sz = sizeof(struct PNFile);
break;
case PN_TVTABLE:
sz = sizeof(struct PNVtable);
break;
case PN_TSOURCE:
sz = sizeof(struct PNSource);
break;
case PN_TBYTES:
sz = sizeof(struct PNBytes) + ((struct PNBytes *)ptr)->siz;
break;
case PN_TPROTO:
sz = sizeof(struct PNProto);
break;
case PN_TTABLE:
sz = sizeof(struct PNTable) + kh_mem(PN, ptr);
break;
case PN_TLICK:
sz = sizeof(struct PNLick);
break;
case PN_TSTRINGS:
sz = sizeof(struct PNTable) + kh_mem(str, ptr);
break;
case PN_TFLEX:
sz = sizeof(PNFlex) + ((PNFlex *)ptr)->siz;
break;
case PN_TCONT:
sz = sizeof(struct PNCont) + (((struct PNCont *)ptr)->len * sizeof(PN));
break;
case PN_TUSER:
sz = sizeof(struct PNData) + ((struct PNData *)ptr)->siz;
break;
}
done_1:
if (sz < sizeof(struct PNFwd))
sz = sizeof(struct PNFwd);
return PN_ALIGN(sz, 8); // force 64-bit alignment
}
void *potion_gc_copy(Potion *P, struct PNObject *ptr) {
void *dst = (void *)P->mem->old_cur;
PN_SIZE sz = potion_type_size(P, (const struct PNObject *)ptr);
if (!sz) { //external pointer or immediate value
DBG_G(P,"GC copy: assuming extern pointer or immediate potion value %p: %ld / 0x%lx\n", ptr, *(long*)ptr, *(long*)ptr);
//return ptr;
memcpy(dst, ptr, sizeof(void*));
return dst;
}
memcpy(dst, ptr, sz);
P->mem->old_cur = (char *)dst + sz;
((struct PNFwd *)ptr)->fwd = POTION_COPIED;
((struct PNFwd *)ptr)->siz = sz;
((struct PNFwd *)ptr)->ptr = (PN)dst;
return dst;
}
void *potion_mark_minor(Potion *P, const struct PNObject *ptr) {
struct PNMemory *M = P->mem;
PN_SIZE i;
PN_SIZE sz = 16;
switch (((struct PNFwd *)ptr)->fwd) {
case POTION_COPIED:
case POTION_FWD:
GC_MINOR_UPDATE(((struct PNFwd *)ptr)->ptr);
goto done_2;
}
if (ptr->vt > PN_TUSER) {
GC_MINOR_UPDATE(PN_VTABLE(ptr->vt));
int ivars = ((struct PNVtable *)PN_VTABLE(ptr->vt))->ivlen;
for (i = 0; i < ivars; i++)
GC_MINOR_UPDATE(((struct PNObject *)ptr)->ivars[i]);
goto done_2;
}
switch (ptr->vt) {
case PN_TWEAK:
GC_MINOR_UPDATE(((struct PNWeakRef *)ptr)->data);
break;
case PN_TCLOSURE:
GC_MINOR_UPDATE(((struct PNClosure *)ptr)->sig);
for (i = 0; i < ((struct PNClosure *)ptr)->extra; i++)
GC_MINOR_UPDATE(((struct PNClosure *)ptr)->data[i]);
break;
case PN_TTUPLE: {
struct PNTuple * volatile t = (struct PNTuple *)potion_fwd((PN)ptr);
for (i = 0; i < t->len; i++)
GC_MINOR_UPDATE(t->set[i]);
}
break;
case PN_TSTATE:
DBG_Gv(P,"GC mark minor Potion_State\n"); // only with threads
GC_MINOR_UPDATE(((Potion *)ptr)->strings);
GC_MINOR_UPDATE(((Potion *)ptr)->lobby);
GC_MINOR_UPDATE(((Potion *)ptr)->vts);
GC_MINOR_UPDATE(((Potion *)ptr)->call);
GC_MINOR_UPDATE(((Potion *)ptr)->callset);
GC_MINOR_UPDATE(((Potion *)ptr)->input);
GC_MINOR_UPDATE(((Potion *)ptr)->source);
//GC_MINOR_UPDATE(((Potion *)ptr)->pbuf);
GC_MINOR_UPDATE(((Potion *)ptr)->line);
GC_MINOR_UPDATE(((Potion *)ptr)->unclosed);
//GC_MINOR_UPDATE(((Potion *)ptr)->target);
GC_MINOR_UPDATE(((Potion *)ptr)->mem);
break;
case PN_TFILE:
GC_MINOR_UPDATE(((struct PNFile *)ptr)->path);
break;
case PN_TVTABLE:
if (((struct PNVtable *)ptr)->parent)
GC_MINOR_UPDATE(PN_VTABLE(((struct PNVtable *)ptr)->parent));
GC_MINOR_UPDATE(((struct PNVtable *)ptr)->name);
GC_MINOR_UPDATE(((struct PNVtable *)ptr)->ivars);
GC_MINOR_UPDATE(((struct PNVtable *)ptr)->methods);
GC_MINOR_UPDATE(((struct PNVtable *)ptr)->meta);
GC_MINOR_UPDATE(((struct PNVtable *)ptr)->ctor);
GC_MINOR_UPDATE(((struct PNVtable *)ptr)->call);
GC_MINOR_UPDATE(((struct PNVtable *)ptr)->callset);
break;
case PN_TSOURCE:
GC_MINOR_UPDATE(((struct PNSource *)ptr)->a[0]);
GC_MINOR_UPDATE(((struct PNSource *)ptr)->a[1]);
GC_MINOR_UPDATE(((struct PNSource *)ptr)->a[2]);
GC_MINOR_UPDATE(((struct PNSource *)ptr)->line);
break;
case PN_TPROTO:
GC_MINOR_UPDATE(((struct PNProto *)ptr)->source);
GC_MINOR_UPDATE(((struct PNProto *)ptr)->sig);
GC_MINOR_UPDATE(((struct PNProto *)ptr)->stack);
GC_MINOR_UPDATE(((struct PNProto *)ptr)->paths);
GC_MINOR_UPDATE(((struct PNProto *)ptr)->locals);
GC_MINOR_UPDATE(((struct PNProto *)ptr)->upvals);
GC_MINOR_UPDATE(((struct PNProto *)ptr)->values);
GC_MINOR_UPDATE(((struct PNProto *)ptr)->protos);
GC_MINOR_UPDATE(((struct PNProto *)ptr)->debugs);
GC_MINOR_UPDATE(((struct PNProto *)ptr)->tree);
GC_MINOR_UPDATE(((struct PNProto *)ptr)->asmb);
break;
case PN_TTABLE:
GC_MINOR_UPDATE_TABLE(PN, (struct PNTable *)potion_fwd((PN)ptr), 1);
break;
case PN_TLICK:
GC_MINOR_UPDATE(((struct PNLick *)ptr)->name);
GC_MINOR_UPDATE(((struct PNLick *)ptr)->attr);
GC_MINOR_UPDATE(((struct PNLick *)ptr)->inner);
break;
case PN_TFLEX:
for (i = 0; i < PN_FLEX_SIZE(ptr); i++)
GC_MINOR_UPDATE(PN_FLEX_AT(ptr, i));
break;
case PN_TCONT:
GC_KEEP(ptr);
pngc_mark_array(P, (_PN *)((struct PNCont *)ptr)->stack + 3, ((struct PNCont *)ptr)->len - 3, 1);
break;
}
done_2:
sz = potion_type_size(P, ptr);
return (void *)((char *)ptr + sz);
}
void *potion_mark_major(Potion *P, const struct PNObject *ptr) {
struct PNMemory *M = P->mem;
PN_SIZE i;
PN_SIZE sz = 16;
switch (((struct PNFwd *)ptr)->fwd) {
case POTION_COPIED:
case POTION_FWD:
GC_MAJOR_UPDATE(((struct PNFwd *)ptr)->ptr);
goto done_3;
}
if (ptr->vt > PN_TUSER) {
GC_MAJOR_UPDATE(PN_VTABLE(ptr->vt));
int ivars = ((struct PNVtable *)PN_VTABLE(ptr->vt))->ivlen;
for (i = 0; i < ivars; i++)
GC_MAJOR_UPDATE(((struct PNObject *)ptr)->ivars[i]);
goto done_3;
}
switch (ptr->vt) {
case PN_TWEAK:
GC_MAJOR_UPDATE(((struct PNWeakRef *)ptr)->data);
break;
case PN_TCLOSURE:
GC_MAJOR_UPDATE(((struct PNClosure *)ptr)->sig);
for (i = 0; i < ((struct PNClosure *)ptr)->extra; i++)
GC_MAJOR_UPDATE(((struct PNClosure *)ptr)->data[i]);
break;
case PN_TTUPLE: {
struct PNTuple * volatile t = (struct PNTuple *)potion_fwd((PN)ptr);
for (i = 0; i < t->len; i++)
GC_MAJOR_UPDATE(t->set[i]);
}
break;
case PN_TSTATE:
DBG_Gv(P,"GC mark major Potion_State\n"); // only with threads
//DBG_G(P," strings\n");
GC_MAJOR_UPDATE(((Potion *)ptr)->strings);
//DBG_G(P," lobby\n");
GC_MAJOR_UPDATE(((Potion *)ptr)->lobby);
//DBG_G(P," vts\n");
GC_MAJOR_UPDATE(((Potion *)ptr)->vts);
//DBG_G(P," call\n");
GC_MAJOR_UPDATE(((Potion *)ptr)->call);
//DBG_G(P," callset\n");
GC_MAJOR_UPDATE(((Potion *)ptr)->callset);
//DBG_G(P," input\n");
GC_MAJOR_UPDATE(((Potion *)ptr)->input);
//DBG_G(P," source\n");
GC_MAJOR_UPDATE(((Potion *)ptr)->source);
//DBG_G(P," pbuf\n");
//GC_MAJOR_UPDATE(((Potion *)ptr)->pbuf);
//DBG_G(P," line\n");
GC_MAJOR_UPDATE(((Potion *)ptr)->line);
//DBG_G(P," unclosed\n");
GC_MAJOR_UPDATE(((Potion *)ptr)->unclosed);
//GC_MAJOR_UPDATE(((Potion *)ptr)->target);
//DBG_G(P," mem\n");
GC_MAJOR_UPDATE(((Potion *)ptr)->mem);
break;
case PN_TFILE:
GC_MAJOR_UPDATE(((struct PNFile *)ptr)->path);
break;
case PN_TVTABLE:
if (((struct PNVtable *)ptr)->parent)
GC_MAJOR_UPDATE(PN_VTABLE(((struct PNVtable *)ptr)->parent));
GC_MAJOR_UPDATE(((struct PNVtable *)ptr)->name);
GC_MAJOR_UPDATE(((struct PNVtable *)ptr)->ivars);
GC_MAJOR_UPDATE(((struct PNVtable *)ptr)->methods);
GC_MAJOR_UPDATE(((struct PNVtable *)ptr)->meta);
GC_MAJOR_UPDATE(((struct PNVtable *)ptr)->ctor);
GC_MAJOR_UPDATE(((struct PNVtable *)ptr)->call);
GC_MAJOR_UPDATE(((struct PNVtable *)ptr)->callset);
break;
case PN_TSOURCE:
GC_MAJOR_UPDATE(((struct PNSource *)ptr)->a[0]);
GC_MAJOR_UPDATE(((struct PNSource *)ptr)->a[1]);
GC_MAJOR_UPDATE(((struct PNSource *)ptr)->a[2]);
GC_MAJOR_UPDATE(((struct PNSource *)ptr)->line);
break;
case PN_TPROTO:
GC_MAJOR_UPDATE(((struct PNProto *)ptr)->source);
GC_MAJOR_UPDATE(((struct PNProto *)ptr)->sig);
GC_MAJOR_UPDATE(((struct PNProto *)ptr)->stack);
GC_MAJOR_UPDATE(((struct PNProto *)ptr)->paths);
GC_MAJOR_UPDATE(((struct PNProto *)ptr)->locals);
GC_MAJOR_UPDATE(((struct PNProto *)ptr)->upvals);
GC_MAJOR_UPDATE(((struct PNProto *)ptr)->values);
GC_MAJOR_UPDATE(((struct PNProto *)ptr)->protos);
GC_MAJOR_UPDATE(((struct PNProto *)ptr)->debugs);
GC_MAJOR_UPDATE(((struct PNProto *)ptr)->tree);
GC_MAJOR_UPDATE(((struct PNProto *)ptr)->asmb);
break;
case PN_TTABLE:
GC_MAJOR_UPDATE_TABLE(PN, (struct PNTable *)potion_fwd((PN)ptr), 1);
break;
case PN_TLICK:
GC_MAJOR_UPDATE(((struct PNLick *)ptr)->name);
GC_MAJOR_UPDATE(((struct PNLick *)ptr)->attr);
GC_MAJOR_UPDATE(((struct PNLick *)ptr)->inner);
break;
case PN_TFLEX:
for (i = 0; i < PN_FLEX_SIZE(ptr); i++)
GC_MAJOR_UPDATE(PN_FLEX_AT(ptr, i));
break;
case PN_TCONT:
GC_KEEP(ptr);
pngc_mark_array(P, (_PN *)((struct PNCont *)ptr)->stack + 3, ((struct PNCont *)ptr)->len - 3, 2);
break;
}
done_3:
sz = potion_type_size(P, ptr);
return (void *)((char *)ptr + sz);
}
/** \par
Potion's GC is a generational copying GC. This is why the
volatile keyword is used so liberally throughout the source
code. PN types may suddenly move during any collection phase.
They move from the birth area to the old area.
Potion actually begins by allocating an old area. This is for
two reasons. First, the script may be too short to require an
old area, so we want to avoid allocating two areas to start with.
And second, since Potion loads its core classes into GC first,
we save ourselves a severe promotion step by beginning with an
automatic promotion to second generation. (Oh and this allows
the core Potion struct pointer to be non-volatile.)
In short, this first page is never released, since the GC struct
itself is on that page.
While this may pay a slight penalty in memory size for long-running
scripts, perhaps I could add some occassional compaction to solve
that as well.
\sa potion_init() which calls GC_PROTECT()
*/
Potion *potion_gc_boot(void *sp) {
Potion *P;
int bootsz = POTION_MIN_BIRTH_SIZE;
void *page1 = pngc_page_new(&bootsz, 0);
if (page1 == NULL)
potion_fatal("Not enough memory");
struct PNMemory *M = (struct PNMemory *)page1;
PN_MEMZERO(M, struct PNMemory);
#ifdef DEBUG
M->time = 0.0;
#endif
SET_GEN(birth, page1, bootsz);
SET_STOREPTR(4);
// stack must be 16-byte aligned on amd64 SSE or __APPLE__, and 32-byte with AVX instrs.
// at least amd64 atof() does SSE register return.
#if (PN_SIZE_T == 8) || defined(__APPLE__)
M->cstack = (((_PN)sp & ((1<<5)-1)) == 0 )
? sp : (void *)(_PN)((_PN)sp | ((1<<5)-1) )+1;
#else
M->cstack = sp;
#endif
P = (Potion *)((char *)M + PN_ALIGN(sizeof(struct PNMemory), 8));
PN_MEMZERO(P, Potion);
P->mem = M;
M->birth_cur = (void *)((char *)P + PN_ALIGN(sizeof(Potion), 8));
GC_PROTECT(P);
return P;
}
// TODO: release memory allocated by the user
void potion_gc_release(Potion *P) {
struct PNMemory *M = P->mem;
void *birthlo = (void *)M->birth_lo;
void *birthhi = (void *)M->birth_hi;
void *oldlo = (void *)M->old_lo;
void *oldhi = (void *)M->old_hi;
if (M->birth_lo != M) {
void *protend = (void *)PN_ALIGN((_PN)M->protect, POTION_PAGESIZE);
DBG_G(P,"GC page delete: %p - %p\n", M, protend);
pngc_page_delete((void *)M, (char *)protend - (char *)M);
}
pngc_page_delete(birthlo, birthhi - birthlo);
if (oldlo != NULL)
pngc_page_delete(oldlo, oldhi - oldlo);
birthlo = 0;
birthhi = 0;
oldlo = 0;
oldhi = 0;
}
PN potion_gc_actual(Potion *P, PN cl, PN self)
{
int total = (char *)P->mem->birth_cur - (char *)P->mem->birth_lo;
if (P->mem != P->mem->birth_lo)
total += (char *)P->mem->protect - (char *)P->mem;
if (P->mem->old_lo != NULL)
total += (char *)P->mem->old_cur - (char *)P->mem->old_lo;
return PN_NUM(total);
}
PN potion_gc_fixed(Potion *P, PN cl, PN self)
{
int total = 0;
if (P->mem->protect != NULL)
total += (char *)P->mem->protect - (char *)P->mem;
return PN_NUM(total);
}
PN potion_gc_reserved(Potion *P, PN cl, PN self)
{
int total = (char *)P->mem->birth_hi - (char *)P->mem->birth_lo;
if (P->mem != P->mem->birth_lo)
total += (char *)P->mem->protect - (char *)P->mem;
if (P->mem->old_lo != NULL)
total += (char *)P->mem->old_hi - (char *)P->mem->old_lo;
return PN_NUM(total);
}