-
Notifications
You must be signed in to change notification settings - Fork 7
/
runtime.c
704 lines (592 loc) · 21.6 KB
/
runtime.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
#include <stdint.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
/// exit the program, displaying an error message
void panic(const char *message) {
fputs("PANIC:", stderr);
fputs(message, stderr);
exit(-1);
}
#ifdef DEBUG
#define DEBUG_PRINT(...) \
do { \
fprintf(stderr, __VA_ARGS__); \
} while (0)
#else
#define DEBUG_PRINT(...) \
do { \
} while (0)
#endif
/// A code label takes no arguments, and returns the next function.
///
/// We have to return a void*, because we can't easily have a recursive
/// type here. But, this is basically always an `EntryFunction*`.
typedef void *(*CodeLabel)(void);
/// An evac function takes the current location of a closure,
/// and returns the new location after moving that closure (if necessary).
typedef uint8_t *(*EvacFunction)(uint8_t *);
/// An InfoTable contains the information about the functions of a closure
typedef struct InfoTable {
/// The function we can call to enter the closure
CodeLabel entry;
/// The evacuation function we call to collect this closure
EvacFunction evac;
} InfoTable;
/// For static objects, evacuating them should return their current location
uint8_t *static_evac(uint8_t *base) {
return base;
}
/// It's useful for to have a null table to use that's valid for the GC,
/// but can't be entered
InfoTable table_for_null = {NULL, &static_evac};
static InfoTable *table_pointer_for_null = &table_for_null;
/// For closures that have already been evacuated
uint8_t *already_evac(uint8_t *base) {
uint8_t *ret;
memcpy(&ret, base + sizeof(InfoTable *), sizeof(uint8_t *));
return ret;
}
/// A table we can share between closures that are already evacuated
InfoTable table_for_already_evac = {NULL, &already_evac};
/// A pointer to the above table
static InfoTable *table_pointer_for_already_evac = &table_for_already_evac;
uint8_t *string_evac(uint8_t *);
/// The Infotable we use for strings
///
/// The entry should never be called, so we provide a panicking function
InfoTable table_for_string = {NULL, &string_evac};
static InfoTable *table_pointer_for_string = &table_for_string;
/// The InfoTable we use for string literals
InfoTable table_for_string_literal = {NULL, &static_evac};
typedef struct CAFCell {
InfoTable *table;
uint8_t *closure;
struct CAFCell *next;
} CAFCell;
CAFCell *g_CAFListHead = NULL;
CAFCell **g_CAFListLast = &g_CAFListHead;
/// Represents the argument stack
///
/// Each argument represents the location in memory where the closure
/// for that argument is stored. You can sort of think of this as InfoTable**.
typedef struct StackA {
/// The top of the argument stack.
///
/// The stack grows upward, with the current pointer always
/// pointing at valid memory, but containing no "live" value.
uint8_t **top;
/// The base pointer of the argument stack.
///
/// This is used to adjust the bottom of the stack, to implement updates
uint8_t **base;
/// A pointer to all of the data
///
/// We keep this around so that we can free the stack on program exit
uint8_t **data;
} StackA;
/// The "A" or argument stack
StackA g_SA = {NULL, NULL, NULL};
/// Represents an item on the secondary stack.
///
/// This is either a 64 bit integer, or a function
/// pointer for a continuation.
typedef union StackBItem {
int64_t as_int;
CodeLabel as_code;
uint8_t *as_closure;
union StackBItem *as_sb_base;
uint8_t **as_sa_base;
} StackBItem;
/// Represents the secondary stack.
///
/// This contains various things: ints, and continuations.
typedef struct StackB {
StackBItem *top;
StackBItem *base;
StackBItem *data;
} StackB;
/// The secondary stack
StackB g_SB = {NULL, NULL, NULL};
/// The register holding integer returns
int64_t g_IntRegister = 0xBAD;
/// The register holding string values
///
/// This is **not** a pointer to the character data, but rather,
/// the location in memory where this string closure resides.
uint8_t *g_StringRegister = NULL;
/// The register holding constructor tag returns
uint16_t g_TagRegister = 0xBAD;
/// The register holding the number of constructor args returned
int64_t g_ConstructorArgCountRegister = 0xBAD;
/// The register holding the location of the current closure
uint8_t *g_NodeRegister = NULL;
/// The register holding a constructor closure to update
uint8_t *g_ConstrUpdateRegister = NULL;
/// A data structure representing our global Heap of memory
typedef struct Heap {
/// The data contained in this heap
uint8_t *data;
/// The part of the data we're currently writing to
uint8_t *cursor;
/// The total capacity of the data, in bytes
size_t capacity;
} Heap;
/// "The Heap", as a global variable.
///
/// This is static, since we always use it through functions provided
/// in this runtime file.
static Heap g_Heap = {NULL, NULL, 0};
/// Get a current cursor, where writes to the Heap will happen
uint8_t *heap_cursor() {
return g_Heap.cursor;
}
void heap_write(void *data, size_t bytes) {
memcpy(g_Heap.cursor, data, bytes);
g_Heap.cursor += bytes;
}
/// Write a pointer into the heap
void heap_write_ptr(uint8_t *ptr) {
heap_write(&ptr, sizeof(uint8_t *));
}
/// Write an info table pointer into the heap
void heap_write_info_table(InfoTable *ptr) {
heap_write(&ptr, sizeof(InfoTable *));
}
/// Write an integer into the heap
void heap_write_int(int64_t x) {
heap_write(&x, sizeof(int64_t));
}
/// Write a short unsigned integer into the heap
void heap_write_uint16(uint16_t x) {
heap_write(&x, sizeof(uint16_t));
}
/// Read a ptr from a chunk of data
uint8_t *read_ptr(uint8_t *data) {
uint8_t *ret;
memcpy(&ret, data, sizeof(uint8_t *));
return ret;
}
/// Read a 64 bit integer from a chunk of data
int64_t read_int(uint8_t *data) {
int64_t ret;
memcpy(&ret, data, sizeof(int64_t));
return ret;
}
/// Read a pointer to an info table from a chunk of data
InfoTable *read_info_table(uint8_t *data) {
InfoTable *ret;
memcpy(&ret, data, sizeof(InfoTable *));
return ret;
}
static double HEAP_GROWTH = 3;
/// Collect a single root
void collect_root(uint8_t **root) {
*root = read_info_table(*root)->evac(*root);
}
/// Grow the heap, removing useless objects
void collect_garbage(size_t extra_required) {
Heap old = g_Heap;
size_t new_capacity = HEAP_GROWTH * old.capacity;
size_t required_capacity = old.cursor - old.data + extra_required;
if (new_capacity < required_capacity) {
new_capacity = required_capacity;
}
g_Heap.data = malloc(new_capacity * sizeof(uint8_t));
if (g_Heap.data == NULL) {
panic("Failed to allocate new heap during garbage collection");
}
g_Heap.cursor = g_Heap.data;
g_Heap.capacity = new_capacity;
if (g_StringRegister != NULL) {
collect_root(&g_StringRegister);
}
if (g_NodeRegister != NULL) {
collect_root(&g_NodeRegister);
}
if (g_ConstrUpdateRegister != NULL) {
collect_root(&g_ConstrUpdateRegister);
}
for (uint8_t **p = g_SA.data; p < g_SA.top; ++p) {
collect_root(p);
}
for (CAFCell *p = g_CAFListHead; p != NULL; p = p->next) {
collect_root(&p->closure);
}
// Collect all the closures in the update frames
for (StackBItem *base = g_SB.base; base != g_SB.data;
base = base[0].as_sb_base) {
collect_root(&base[2].as_closure);
}
// At this point, all references into the old heap are eliminated
free(old.data);
// To avoid exponential growth unnecessarily, we restrict
// the actual capacity available, hiding some of the unused data
size_t necessary_size = g_Heap.cursor - g_Heap.data;
size_t comfortable_size = HEAP_GROWTH * necessary_size;
if (comfortable_size < g_Heap.capacity) {
g_Heap.capacity = comfortable_size;
}
DEBUG_PRINT("GC Done. 0x%05X ↓ 0x%05X ↑ 0x%05X\n", old.capacity,
necessary_size, g_Heap.capacity);
}
/// Reserve a certain amount of bytes in the Heap
///
/// The point of this function is to trigger garbage collection, growing
/// the Heap, if necessary.
///
/// No bounds checking of the Heap is done otherwise.
void heap_reserve(size_t amount) {
// We'd need to write beyond the capacity of our buffer
if (g_Heap.cursor + amount > g_Heap.data + g_Heap.capacity) {
collect_garbage(amount);
}
}
void *black_hole_entry() {
fputs("infinite loop detected\n", stderr);
return NULL;
}
uint8_t *black_hole_evac(uint8_t *base) {
uint8_t *new_base = heap_cursor();
heap_write(base, sizeof(InfoTable *) + sizeof(uint8_t *));
memcpy(base, &table_pointer_for_already_evac, sizeof(InfoTable*));
memcpy(base + sizeof(InfoTable *), &new_base, sizeof(uint8_t *));
return new_base;
}
InfoTable table_for_black_hole = {&black_hole_entry, &black_hole_evac};
/// Concat two strings together, returning the location of the new string
///
/// This might trigger garbage collection. In practice, we only ever do
/// this right before jumping to a continuation, so this is ok.
uint8_t *string_concat(uint8_t *s1, uint8_t *s2) {
uint8_t *data1 = s1 + sizeof(InfoTable *);
uint8_t *data2 = s2 + sizeof(InfoTable *);
size_t len1 = strlen((char *)data1);
size_t len2 = strlen((char *)data2);
size_t required = sizeof(InfoTable *) + len1 + len2 + 1;
size_t min_size = sizeof(InfoTable *) + sizeof(uint8_t *);
size_t extra = 0;
// We need to make sure that the string has enough space for a relocation
if (required < min_size) {
extra = min_size - required;
required += extra;
}
if (g_Heap.cursor + required > g_Heap.data + g_Heap.capacity) {
// Push the two strings on the stack, so they're roots for the GC
g_SA.top[0] = s1;
g_SA.top[1] = s2;
g_SA.top += 2;
collect_garbage(required);
data2 = g_SA.top[-1] + sizeof(InfoTable *);
data1 = g_SA.top[-2] + sizeof(InfoTable *);
g_SA.top -= 2;
}
uint8_t *ret = g_Heap.cursor;
memcpy(g_Heap.cursor, &table_pointer_for_string, sizeof(InfoTable *));
g_Heap.cursor += sizeof(InfoTable *);
memcpy(g_Heap.cursor, data1, len1);
g_Heap.cursor += len1;
memcpy(g_Heap.cursor, data2, len2 + 1);
g_Heap.cursor += len2 + 1;
g_Heap.cursor += extra;
return ret;
}
/// The evacuation function for strings
uint8_t *string_evac(uint8_t *base) {
uint8_t *new_base = heap_cursor();
size_t bytes = strlen((char *)(base + sizeof(InfoTable *))) + 1;
heap_write(base, sizeof(InfoTable *) + bytes);
// We need to make sure we also have enough space for the relocation
if (bytes < sizeof(uint8_t *)) {
g_Heap.cursor += sizeof(uint8_t *) - bytes;
}
memcpy(base, &table_pointer_for_already_evac, sizeof(InfoTable *));
memcpy(base + sizeof(InfoTable *), &new_base, sizeof(uint8_t *));
return new_base;
}
/// Save the current contents of the B stack
void save_SB() {
g_SB.top[0].as_sb_base = g_SB.base;
g_SB.base = g_SB.top;
++g_SB.top;
}
/// Save the current contents of the A stack
void save_SA() {
g_SB.top[0].as_sa_base = g_SA.base;
g_SA.base = g_SA.top;
++g_SB.top;
}
/// The entry function for partial applications.
void *partial_application_entry() {
DEBUG_PRINT("%s\n", __func__);
uint8_t *cursor = g_NodeRegister + sizeof(InfoTable *);
CodeLabel ret;
memcpy(&ret, cursor, sizeof(CodeLabel));
cursor += sizeof(CodeLabel);
uint16_t b_items;
memcpy(&b_items, cursor, sizeof(uint16_t));
cursor += sizeof(uint16_t);
uint16_t a_items;
memcpy(&a_items, cursor, sizeof(uint16_t));
cursor += sizeof(uint16_t);
// Push saved stack arguments
size_t b_size = b_items * sizeof(StackBItem);
memcpy(g_SB.top, cursor, b_size);
g_SB.top += b_items;
cursor += b_size;
size_t a_size = a_items * sizeof(uint8_t *);
memcpy(g_SA.top, cursor, a_size);
g_SA.top += a_items;
// Jump to saved function
return ret;
}
/// THe evacuation function for a partial application
uint8_t *partial_application_evac(uint8_t *base) {
uint8_t *items_base = base + sizeof(InfoTable *) + sizeof(CodeLabel);
// Get the number of items, in order to calculate size
uint16_t b_items;
memcpy(&b_items, items_base, sizeof(uint16_t));
size_t b_size = b_items * sizeof(StackBItem);
uint16_t a_items;
memcpy(&a_items, items_base + sizeof(uint16_t), sizeof(uint16_t));
size_t a_size = a_items * sizeof(uint8_t *);
// Move over the closure
size_t total_size = sizeof(InfoTable *) + sizeof(CodeLabel) +
2 * sizeof(uint16_t) + b_size + a_size;
uint8_t *new_base = heap_cursor();
heap_write(base, total_size);
// Replace the old closure with an evacuation indirection
memcpy(base, &table_pointer_for_already_evac, sizeof(InfoTable *));
memcpy(base + sizeof(InfoTable *), &new_base, sizeof(uint8_t *));
// Collect the roots recursively
for (uint8_t *cursor = new_base + total_size - a_size;
cursor < new_base + total_size; cursor += sizeof(uint8_t *)) {
uint8_t *root;
memcpy(&root, cursor, sizeof(uint8_t *));
collect_root(&root);
memcpy(cursor, &root, sizeof(uint8_t *));
}
return new_base;
}
/// The table we use when creating a partial application closure
InfoTable table_for_partial_application = {&partial_application_entry,
&partial_application_evac};
/// The entry function for an indirection just enters the its pointee
void *indirection_entry() {
DEBUG_PRINT("%s\n", __func__);
g_NodeRegister = read_ptr(g_NodeRegister + sizeof(InfoTable *));
return read_info_table(g_NodeRegister)->entry;
}
/// The evacuation function for an indirection.
///
/// This has the effect of removing indirections, since we don't recreate
/// a new indirection in the heap.
uint8_t *indirection_evac(uint8_t *base) {
uint8_t *closure = read_ptr(base + sizeof(InfoTable *));
uint8_t *new_base = read_info_table(closure)->evac(closure);
memcpy(base, &table_pointer_for_already_evac, sizeof(InfoTable *));
memcpy(base + sizeof(InfoTable *), &new_base, sizeof(uint8_t *));
return new_base;
}
/// The table we use for an indirection closure
InfoTable table_for_indirection = {&indirection_entry, &indirection_evac};
InfoTable *table_pointer_for_indirection = &table_for_indirection;
InfoTable table_for_caf_cell = {&indirection_entry, &static_evac};
/// The code that gets called when we hit an update frame when we're expecting
/// a case continuation instead.
void *update_constructor() {
// At this point, the topmost part of our update frame has been lobbed off,
// now we need to chop off the rest, and also go to the "real" update
// continuation
g_SB.top -= 4;
uint8_t *closure = g_SB.top[3].as_closure;
// If we already have an updating thunk, just make us point to
// to that one instead.
if (g_ConstrUpdateRegister != NULL) {
memcpy(closure, &table_pointer_for_indirection, sizeof(InfoTable *));
memcpy(closure + sizeof(InfoTable *), &g_ConstrUpdateRegister,
sizeof(uint8_t *));
} else {
g_ConstrUpdateRegister = closure;
}
g_SA.base = g_SB.top[2].as_sa_base;
g_SB.base = g_SB.top[1].as_sb_base;
return g_SB.top[0].as_code;
}
void *with_int_entry() {
DEBUG_PRINT("%s\n", __func__);
g_IntRegister = read_int(g_NodeRegister + sizeof(InfoTable *));
--g_SB.top;
return g_SB.top[0].as_code;
}
uint8_t *with_int_evac(uint8_t *base) {
uint8_t *new_base = heap_cursor();
heap_write(base, sizeof(InfoTable *) + sizeof(int64_t));
memcpy(base, &table_pointer_for_already_evac, sizeof(InfoTable *));
memcpy(base + sizeof(InfoTable *), &new_base, sizeof(uint8_t *));
return new_base;
}
InfoTable table_for_with_int = {&with_int_entry, &with_int_evac};
void update_with_int() {
InfoTable *table = &table_for_with_int;
memcpy(g_ConstrUpdateRegister, &table, sizeof(InfoTable *));
memcpy(g_ConstrUpdateRegister + sizeof(InfoTable *), &g_IntRegister,
sizeof(int64_t));
}
void *with_string_entry() {
DEBUG_PRINT("%s\n", __func__);
g_StringRegister = read_ptr(g_NodeRegister + sizeof(InfoTable *));
--g_SB.top;
return g_SB.top[0].as_code;
}
uint8_t *with_string_evac(uint8_t *base) {
uint8_t *new_base = heap_cursor();
heap_write(base, sizeof(InfoTable *) + sizeof(uint8_t *));
memcpy(base, &table_pointer_for_already_evac, sizeof(InfoTable *));
memcpy(base + sizeof(InfoTable *), &new_base, sizeof(uint8_t *));
uint8_t *cursor = new_base + sizeof(InfoTable *);
uint8_t *root;
memcpy(&root, cursor, sizeof(uint8_t *));
collect_root(&root);
memcpy(cursor, &root, sizeof(uint8_t *));
return new_base;
}
InfoTable table_for_with_string = {&with_string_entry, &with_string_evac};
void update_with_string() {
InfoTable *table = &table_for_with_string;
memcpy(g_ConstrUpdateRegister, &table, sizeof(InfoTable *));
memcpy(g_ConstrUpdateRegister + sizeof(InfoTable *), &g_StringRegister,
sizeof(uint8_t *));
}
void *with_constructor_entry() {
DEBUG_PRINT("%s\n", __func__);
uint8_t *cursor = g_NodeRegister + sizeof(InfoTable *);
memcpy(&g_TagRegister, cursor, sizeof(uint16_t));
cursor += sizeof(uint16_t);
uint16_t items;
memcpy(&items, cursor, sizeof(uint16_t));
cursor += sizeof(uint16_t);
g_ConstructorArgCountRegister = items;
memcpy(g_SA.top, cursor, items * sizeof(uint8_t *));
g_SA.top += items;
--g_SB.top;
return g_SB.top[0].as_code;
}
uint8_t *with_constructor_evac(uint8_t *base) {
uint8_t *items_base = base + sizeof(InfoTable *) + sizeof(uint16_t);
uint16_t items;
memcpy(&items, items_base, sizeof(uint16_t));
size_t items_size = items * sizeof(uint8_t *);
size_t total_size = sizeof(InfoTable *) + 2 * sizeof(uint16_t) + items_size;
// Move over this closure
uint8_t *new_base = heap_cursor();
heap_write(base, total_size);
// Replace this closure with an evacuation indirection
memcpy(base, &table_pointer_for_already_evac, sizeof(InfoTable *));
memcpy(base + sizeof(InfoTable *), &new_base, sizeof(uint8_t *));
// Evacuate the roots recursively
uint8_t *cursor = new_base + sizeof(InfoTable *) + sizeof(uint16_t);
uint8_t *end = new_base + total_size;
for (uint8_t *cursor = end - items_size; cursor < end;
cursor += sizeof(uint8_t *)) {
uint8_t *root = read_ptr(cursor);
collect_root(&root);
memcpy(cursor, &root, sizeof(uint8_t *));
}
return new_base;
}
InfoTable table_for_with_constructor = {&with_constructor_entry,
&with_constructor_evac};
InfoTable *table_pointer_for_with_constructor = &table_for_with_constructor;
void update_with_constructor() {
uint16_t items = g_ConstructorArgCountRegister;
size_t items_size = items * sizeof(uint8_t *);
size_t required = sizeof(InfoTable *) + 2 * sizeof(uint16_t) + items_size;
heap_reserve(required);
uint8_t *indirection = heap_cursor();
heap_write_info_table(&table_for_with_constructor);
heap_write_uint16(g_TagRegister);
heap_write_uint16(items);
heap_write(g_SA.top - items, items_size);
memcpy(g_ConstrUpdateRegister, &table_pointer_for_indirection,
sizeof(InfoTable *));
memcpy(g_ConstrUpdateRegister + sizeof(InfoTable *), &indirection,
sizeof(uint8_t *));
}
/// Check if we need to create an application update.
///
/// This happens if insuffient arguments are passed to us on the stack.
///
/// We return either NULL, indicating that we need to continue, or
/// we return the codelabel to call next.
CodeLabel check_application_update(int64_t arg_count, CodeLabel current) {
// NOTE: Be very careful to not create any temporaries that might get
// invalidated by garbage collection before calling `h_reserve`!
int64_t args = g_SA.top - g_SA.base;
if (args >= arg_count) {
return NULL;
}
uint16_t b_items = g_SB.top - (g_SB.base + 4);
uint16_t a_items = g_SA.top - g_SA.base;
size_t b_size = b_items * sizeof(StackBItem);
size_t a_size = a_items * sizeof(uint8_t *);
size_t required = sizeof(InfoTable *) + sizeof(uint8_t *) + a_size + b_size;
heap_reserve(required);
// Pull out what we need from the update frame
uint8_t *closure = g_SB.base[2].as_closure;
StackBItem *saved_SB_base = g_SB.base[0].as_sb_base;
uint8_t **saved_SA_base = g_SB.base[1].as_sa_base;
// Remove the update frame
for (size_t i = 0; i < b_items; ++i) {
g_SB.base[i] = g_SB.base[i + 4];
}
g_SB.top -= 4;
// Construct the new closure
uint8_t *indirection = heap_cursor();
heap_write_info_table(&table_for_partial_application);
heap_write(¤t, sizeof(CodeLabel));
heap_write_uint16(b_items);
heap_write_uint16(a_items);
// NOTE: this works in my mental model of C, but I am not a lawyer
// heap_write uses memcpy under the hood
heap_write(g_SB.base, b_size);
heap_write(g_SA.base, a_size);
memcpy(closure, &table_pointer_for_indirection, sizeof(InfoTable *));
memcpy(closure + sizeof(InfoTable *), &indirection, sizeof(uint8_t *));
// Restoring old stack bases
g_SA.base = saved_SA_base;
g_SB.base = saved_SB_base;
// Return to the function that called us.
return current;
}
/// The starting size for the Heap
static const size_t BASE_HEAP_SIZE = 1 << 6;
/// The starting size for each Stack
static const size_t STACK_SIZE = 1 << 10;
/// Setup all the memory areas that we need
void setup() {
g_Heap.data = malloc(BASE_HEAP_SIZE * sizeof(uint8_t *));
if (g_Heap.data == NULL) {
panic("Failed to initialize Heap");
}
g_Heap.cursor = g_Heap.data;
g_Heap.capacity = BASE_HEAP_SIZE;
g_SA.data = malloc(STACK_SIZE * sizeof(InfoTable *));
if (g_SA.data == NULL) {
panic("Failed to initialize Argument Stack");
}
g_SA.base = g_SA.data;
g_SA.top = g_SA.data;
g_SB.data = malloc(STACK_SIZE * sizeof(StackBItem));
if (g_SB.data == NULL) {
panic("Failed to initialize Secondary Stack");
}
g_SB.top = g_SB.data;
g_SB.base = g_SB.data;
}
/// Cleanup all the memory areas that we've created
void cleanup() {
free(g_Heap.data);
free(g_SA.data);
free(g_SB.data);
}