-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathvm.c
More file actions
1491 lines (1408 loc) · 40.6 KB
/
vm.c
File metadata and controls
1491 lines (1408 loc) · 40.6 KB
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
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
/* Copyright (C) 2020-2021
* "Mu Lei" known as "NalaGinrut" <NalaGinrut@gmail.com>
* Animula is free software: you can redistribute it and/or modify
* it under the terms of the GNU Lesser General Public License as
* published by the Free Software Foundation, either version 3 of the
* License, or (at your option) any later version.
* Animula is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU Lesser General Public License for more details.
* You should have received a copy of the GNU Lesser General Public
* License along with this program.
* If not, see <http://www.gnu.org/licenses/>.
*/
#include "vm.h"
GLOBAL_DEF (size_t, VM_CODESEG_SIZE) = 0;
GLOBAL_DEF (size_t, VM_DATASEG_SIZE) = 0;
GLOBAL_DEF (size_t, VM_GLOBALSEG_SIZE) = 0;
static void handle_optional_args (vm_t vm, object_t proc)
{
u8_t cnt = COUNT_ARGS () - proc->proc.opt;
Object varg = {.attr = {.type = list, .gc = FREE_OBJ},
.value = (void *)NEW_INNER_OBJ (list)};
ListHead *head = LIST_OBJECT_HEAD (&varg);
for (int i = 0; i < cnt; i++)
{
object_t new_obj = NEW_OBJ (0);
*new_obj = POP_OBJ ();
new_obj->attr.gc = GEN_1_OBJ; // don't forget to reset gc to GEN_1_OBJ
list_node_t bl = (list_node_t)GC_MALLOC (sizeof (ListNode));
bl->obj = new_obj;
SLIST_INSERT_HEAD (head, bl, next);
}
PUSH_OBJ (varg);
}
static closure_t create_closure (vm_t vm, u8_t arity, u8_t frame_size,
reg_t entry)
{
closure_t closure = make_closure (arity, frame_size, entry);
for (u8_t i = frame_size; i > 0; i--)
{
closure->env[i - 1] = POP_OBJ ();
/* os_printk ("capture local-%d ", i - 1); */
/* object_printer (&closure->env[i - 1]); */
/* os_printk ("\n"); */
}
return closure;
}
void call_prim (vm_t vm, pn_t pn)
{
prim_t prim = get_prim (pn);
switch (pn)
{
case ret:
{
break;
}
case restore:
{
RESTORE ();
break;
}
case num_add:
case num_sub:
case num_mul:
case fract_div:
{
func_2_args_with_ret_t fn = (func_2_args_with_ret_t)prim->fn;
size_t size = sizeof (struct Object);
Object o2 = POP_OBJ ();
Object o1 = POP_OBJ ();
Object ret = {.attr = {.type = none, .gc = FREE_OBJ}, .value = NULL};
ret = *(fn (vm, &ret, &o1, &o2));
PUSH_OBJ (ret);
break;
}
case int_modulo:
case int_remainder:
{
arith_prim_t fn = (arith_prim_t)prim->fn;
size_t size = sizeof (struct Object);
Object xsor = POP_OBJ ();
Object xend = POP_OBJ ();
Object ret = {.attr = {.type = imm_int, .gc = FREE_OBJ}, .value = NULL};
VALIDATE (&xsor, imm_int);
VALIDATE (&xend, imm_int);
ret.value = (void *)fn ((imm_int_t)xend.value, (imm_int_t)xsor.value);
PUSH_OBJ (ret);
break;
}
case object_print:
{
printer_prim_t fn = (printer_prim_t)prim->fn;
Object obj = POP_OBJ ();
fn (&obj);
PUSH_OBJ (GLOBAL_REF (none_const)); // return NONE object
break;
}
case num_eq:
case num_lt:
case num_gt:
case num_le:
case num_ge:
case eq:
case eqv:
case equal:
{
logic_check_t fn = (logic_check_t)prim->fn;
Object comparee = POP_OBJ ();
Object comparand = POP_OBJ ();
if (fn (&comparand, &comparee))
PUSH_OBJ (GLOBAL_REF (true_const));
else
PUSH_OBJ (GLOBAL_REF (false_const));
break;
}
case not:
{
logic_not_t fn = (logic_not_t)prim->fn;
Object obj = POP_OBJ ();
if (fn (&obj))
PUSH_OBJ (GLOBAL_REF (true_const));
else
PUSH_OBJ (GLOBAL_REF (false_const));
break;
}
case pop:
{
if (vm->sp)
{
POP_OBJ ();
}
break;
}
case map:
{
// FIXME: Fix the stack order for GC
Object lst = POP_OBJ ();
Object proc = POP_OBJ ();
ListHead *head = LIST_OBJECT_HEAD (&lst);
list_node_t node = NULL;
list_node_t prev = NULL;
/* We always set k as return */
Object k = GEN_PRIM (ret);
list_t new_list = NEW_INNER_OBJ (list);
/* NOTE:
* To safely created a List, we have to consider that GC may happend
* unexpectedly.
*/
Object new_list_obj = {.attr = {.type = list, .gc = PERMANENT_OBJ},
.value = (void *)new_list};
ListHead *new_head = LIST_OBJECT_HEAD (&new_list_obj);
new_list->non_shared = 0;
SAVE_ENV_SIMPLE ();
SLIST_FOREACH (node, head, next)
{
list_node_t new_node = NEW_LIST_NODE ();
new_node->obj = (void *)0xDEADBEEF;
if (!prev)
{
// when the new list is still empty
SLIST_INSERT_HEAD (new_head, new_node, next);
}
else
{
SLIST_INSERT_AFTER (prev, new_node, next);
}
object_t new_obj = NEW_OBJ (0);
new_obj->attr.gc = GEN_1_OBJ;
new_node->obj = new_obj;
vm->sp = vm->local;
PUSH_OBJ (k);
PUSH_OBJ (*node->obj);
switch (proc.attr.type)
{
case procedure:
{
apply_proc (vm, &proc, new_obj);
break;
}
case primitive:
{
call_prim (vm, (pn_t)proc.value);
*new_obj = POP_OBJ ();
break;
}
}
prev = new_node;
/* NOTE:
* We're not going to create frame for each proc call in order
* to make it faster. So we have to drop the dirty frame by resetting
* sp to local each round.
* So does for-each
*/
vm->sp = vm->local;
}
new_list->attr.gc
= (VM_INIT_GLOBALS == vm->state) ? PERMANENT_OBJ : GEN_1_OBJ;
PUSH_OBJ (new_list_obj);
RESTORE_SIMPLE ();
break;
}
case foreach:
{
/* We always set k as return */
Object k = GEN_PRIM (ret);
Object lst = POP_OBJ ();
Object proc = POP_OBJ ();
ListHead *head = LIST_OBJECT_HEAD (&lst);
list_node_t node = NULL;
PUSH_REG (vm->pc);
PUSH_REG (vm->fp);
PUSH (vm->attr.all);
PUSH_CLOSURE (vm->closure);
vm->fp = vm->sp - FPS;
vm->local = vm->fp + FPS;
SLIST_FOREACH (node, head, next)
{
// TODO: support for-each in multiple lists
vm->sp = vm->local;
PUSH_OBJ (k);
PUSH_OBJ (*(node->obj));
switch (proc.attr.type)
{
case procedure:
{
apply_proc (vm, &proc, ret);
break;
}
case primitive:
{
call_prim (vm, (pn_t)proc.value);
break;
}
}
vm->sp = vm->local;
}
RESTORE ();
PUSH_OBJ (GLOBAL_REF (none_const)); // return NONE object
break;
}
case apply:
{
VM_DEBUG ("(call apply)\n");
Object args = POP_OBJ ();
Object proc = POP_OBJ ();
Object ret = CREATE_RET_OBJ ();
ListHead *head = LIST_OBJECT_HEAD (&args);
list_node_t node = NULL;
SLIST_FOREACH (node, head, next)
{
PUSH_OBJ (*node->obj);
}
FIX_PC ();
switch (proc.attr.type)
{
case procedure:
{
VM_DEBUG ("apply proc\n");
// vm->local = vm->fp + FPS;
apply_proc (vm, &proc, &ret);
PUSH_OBJ (ret);
break;
}
case primitive:
{
VM_DEBUG ("apply prim %d\n", (pn_t)proc.value);
call_prim (vm, (pn_t)proc.value);
break;
}
case closure_on_heap:
{
VM_DEBUG ("apply closure %x\n", ((closure_t)proc.value)->entry);
call_closure_on_heap (vm, &proc);
break;
}
default:
{
os_printk ("apply: not an applicable object, type: %d\n",
proc.attr.type);
PANIC ("apply panic!\n");
}
}
break;
}
case prim_bytevector_copy_overwrite: // 5 parameters
case prim_string_copy_side_effect:
{
func_5_args_with_ret_t fn = (func_5_args_with_ret_t)prim->fn;
Object o5 = POP_OBJ ();
Object o4 = POP_OBJ ();
Object o3 = POP_OBJ ();
Object o2 = POP_OBJ ();
Object o1 = POP_OBJ ();
Object ret = CREATE_RET_OBJ ();
ret = *(fn (vm, &ret, &o1, &o2, &o3, &o4, &o5));
PUSH_OBJ (ret);
break;
}
case prim_i2c_write_byte: // 4 parameters
case prim_spi_transceive:
case prim_string_fill:
{
func_4_args_with_ret_t fn = (func_4_args_with_ret_t)prim->fn;
Object o4 = POP_OBJ ();
Object o3 = POP_OBJ ();
Object o2 = POP_OBJ ();
Object o1 = POP_OBJ ();
Object ret = CREATE_RET_OBJ ();
ret = *(fn (vm, &ret, &o1, &o2, &o3, &o4));
PUSH_OBJ (ret);
break;
}
case prim_i2c_read_list: // 3 parameters
case prim_i2c_read_bytevector:
case prim_i2c_write_list:
case prim_i2c_read_byte:
case prim_bytevector_u8_set:
case prim_bytevector_copy:
case prim_i2c_write_bytevector:
case prim_string_set:
case prim_substring:
case prim_string_copy:
{
func_3_args_with_ret_t fn = (func_3_args_with_ret_t)prim->fn;
Object o3 = POP_OBJ ();
Object o2 = POP_OBJ ();
Object o1 = POP_OBJ ();
Object ret = CREATE_RET_OBJ ();
ret = *(fn (vm, &ret, &o1, &o2, &o3));
PUSH_OBJ (ret);
break;
}
case list_append: // 2 parameters
case list_ref:
case cons:
case prim_gpio_set:
case prim_make_bytevector:
case prim_bytevector_u8_ref:
case prim_bytevector_append:
case prim_floor_div:
case prim_floor_quotient:
case prim_floor_remainder:
case prim_truncate_div:
case prim_truncate_quotient:
case prim_truncate_remainder:
case prim_expt:
case prim_make_string:
case prim_string_ref:
case prim_string_eq:
case prim_string_append:
{
func_2_args_with_ret_t fn = (func_2_args_with_ret_t)prim->fn;
Object o2 = POP_OBJ ();
Object o1 = POP_OBJ ();
Object ret = CREATE_RET_OBJ ();
fn (vm, &ret, &o1, &o2);
PUSH_OBJ (ret);
break;
}
case prim_usleep: // 1 parameter
case prim_device_configure:
case prim_gpio_toggle:
case prim_gpio_get:
case list_to_string:
case car:
case cdr:
case prim_bytevector_length:
case prim_floor:
case prim_ceiling:
case prim_truncate:
case prim_round:
case prim_rationalize:
case prim_numerator:
case prim_denominator:
case prim_is_exact_integer:
case prim_is_finite:
case prim_is_infinite:
case prim_is_nan:
case prim_is_zero:
case prim_is_positive:
case prim_is_negative:
case prim_is_odd:
case prim_is_even:
case prim_square:
case prim_sqrt:
case prim_exact_integer_sqrt:
case prim_string_length:
{
func_1_args_with_ret_t fn = (func_1_args_with_ret_t)prim->fn;
Object o = POP_OBJ ();
Object ret = CREATE_RET_OBJ ();
PUSH_OBJ (*fn (vm, &ret, &o));
break;
}
case prim_get_board_id:
{
func_0_args_t fn = (func_0_args_t)prim->fn;
PUSH_OBJ (*fn (vm));
break;
}
case read_char:
case readln:
case prim_vm_reset:
{
func_0_args_with_ret_t fn = (func_0_args_with_ret_t)prim->fn;
Object ret = CREATE_RET_OBJ ();
PUSH_OBJ (*fn (vm, &ret));
break;
}
case scm_raise:
{
vm->state = VM_EXCPT;
break;
}
case scm_raise_continuable:
{
vm->state = VM_EXCPT_CONT;
break;
}
case with_exception_handler:
{
Object thunk = POP_OBJ ();
Object handler = POP_OBJ ();
Object result = CREATE_RET_OBJ ();
Object k = GEN_PRIM (restore);
reg_t local = 0;
SAVE_ENV_SIMPLE ();
local = vm->local;
PUSH_OBJ (k); // prim:return
apply_proc (vm, &thunk, &result);
extent:
if (VM_EXCPT_CONT == vm->state)
{
reg_t sp = POP_REG ();
reg_t pc = POP_REG ();
SAVE_ENV_SIMPLE ();
PUSH_OBJ (k); // prim:return
PUSH_OBJ (result);
vm->state = VM_RUN;
apply_proc (vm, &handler, &result);
PUSH_OBJ (result);
RESTORE_SIMPLE ();
vm->sp = sp;
vm->local = local;
PUSH_OBJ (result);
thunk.proc.entry = pc;
apply_proc (vm, &thunk, &result);
goto extent;
}
else if (VM_EXCPT == vm->state)
{
SAVE_ENV_SIMPLE ();
PUSH_OBJ (k); // prim:return
PUSH_OBJ (result);
vm->state = VM_RUN;
apply_proc (vm, &handler, NULL);
RESTORE_SIMPLE ();
// Handle non-continuable exception
os_printk ("Exception occurred with non-continuable object: ");
object_printer (&result);
os_printk ("\n");
vm->state = VM_STOP;
}
PUSH_OBJ (result);
RESTORE_SIMPLE ();
break;
}
case is_null:
case is_pair:
case is_list:
case is_string:
case is_char:
case is_keyword:
case is_symbol:
case is_procedure:
case is_primitive:
case is_boolean:
case is_number:
case is_integer:
case is_real:
case is_rational:
case is_complex:
case is_bytevector:
{
Object o = POP_OBJ ();
pred_t fn = (pred_t)prim->fn;
PUSH_OBJ (fn (&o));
break;
}
default:
{
PANIC ("Invalid prim number: %d\n", pn);
}
}
}
static uintptr_t vm_get_uintptr (vm_t vm)
{
u8_t buf[sizeof (uintptr_t)] = {0};
#if defined ANIMULA_BIG_ENDIAN
buf[0] = NEXT_DATA ();
buf[1] = NEXT_DATA ();
buf[2] = NEXT_DATA ();
buf[3] = NEXT_DATA ();
#else
buf[3] = NEXT_DATA ();
buf[2] = NEXT_DATA ();
buf[1] = NEXT_DATA ();
buf[0] = NEXT_DATA ();
#endif
return *((uintptr_t *)buf);
}
static u16_t vm_get_u16 (vm_t vm)
{
u8_t buf[sizeof (u16_t)] = {0};
#if defined ANIMULA_BIG_ENDIAN
buf[0] = NEXT_DATA ();
buf[1] = NEXT_DATA ();
#else
buf[1] = NEXT_DATA ();
buf[0] = NEXT_DATA ();
#endif
return *((u16_t *)buf);
}
static object_t generate_object (vm_t vm, object_t obj)
{
bytecode8_t bc;
bc.all = NEXT_DATA ();
obj->attr.gc = (VM_INIT_GLOBALS == vm->state) ? PERMANENT_OBJ : FREE_OBJ;
obj->attr.type = bc.all;
switch (obj->attr.type)
{
case imm_int:
{
imm_int_t value = (imm_int_t)vm_get_uintptr (vm);
VM_DEBUG ("(push-integer-object %d)\n", value);
obj->value = (void *)value;
break;
}
case string: // immutable string
{
const char *str = (char *)(vm->code + vm->pc);
vm->pc += os_strnlen (str, MAX_STR_LEN) + 1;
VM_DEBUG ("(push-string-object \"%s\")\n", str);
obj->value = (void *)str;
break;
}
case keyword:
{
const char *str = (char *)(vm->code + vm->pc);
vm->pc += os_strnlen (str, MAX_STR_LEN) + 1;
VM_DEBUG ("(push-keyword-object #:%s)\n", str);
obj->value = (void *)str;
break;
}
case procedure:
{
u16_t offset = vm_get_u16 (vm);
u8_t arity = NEXT_DATA ();
u8_t opt = NEXT_DATA ();
VM_DEBUG ("(push-proc-object 0x%x %d %d)\n", offset, arity, opt);
obj->proc.entry = offset;
obj->proc.arity = arity;
obj->proc.opt = opt;
break;
}
case primitive:
{
uintptr_t prim = vm_get_uintptr (vm);
// vm->pc += sizeof (uintptr_t);
VM_DEBUG ("(push-prim-object %u %s)\n", prim, prim_name (prim));
obj->value = (void *)prim;
break;
}
case pair:
{
VM_DEBUG ("(push-pair-object)\n");
pair_t p = NEW_INNER_OBJ (pair);
p->attr.gc = (VM_INIT_GLOBALS == vm->state) ? PERMANENT_OBJ : GEN_1_OBJ;
obj->attr.type = pair;
obj->value = (void *)p;
PUSH_OBJ (*obj);
u32_t sp = vm->sp - sizeof (Object);
object_t cdr = NEW_OBJ (TOP_OBJ_PTR_FROM (sp)->attr.type);
*cdr = POP_OBJ_FROM (sp);
cdr->attr.gc = GEN_1_OBJ; // don't forget to reset gc to 1
p->cdr = cdr;
object_t car = NEW_OBJ (TOP_OBJ_PTR_FROM (sp)->attr.type);
*car = POP_OBJ_FROM (sp);
car->attr.gc = GEN_1_OBJ; // don't forget to reset gc to 1
p->car = car;
vm->sp = sp; // refix the pop offset
break;
}
case list:
{
u8_t s = NEXT_DATA ();
u16_t size = ((s << 8) | NEXT_DATA ());
VM_DEBUG ("(push-list-object %d)\n", size);
list_t l = NEW_INNER_OBJ (list);
SLIST_INIT (&l->list);
l->attr.gc = (VM_INIT_GLOBALS == vm->state) ? PERMANENT_OBJ : GEN_1_OBJ;
l->non_shared = 0;
obj->attr.type = list;
obj->value = (void *)l;
/* NOTE:
* To safely created a List, we have to consider that GC may happend
* unexpectedly.
* 1. We must save list-obj to avoid to be freed by GC.
* 2. The POP operation must be fixed to skip list-obj.
* 3. oln must be created and inserted before the object allocation.
*/
PUSH_OBJ (*obj);
u32_t sp = vm->sp - sizeof (Object);
for (u16_t i = 0; i < size; i++)
{
// POP_OBJ_FROM (sp);
list_node_t bl = NEW_LIST_NODE ();
// avoid crash in case GC was triggered here
bl->obj = (void *)0xDEADBEEF;
SLIST_INSERT_HEAD (&l->list, bl, next);
object_t new_obj = NEW_OBJ (TOP_OBJ_PTR_FROM (sp)->attr.type);
*new_obj = POP_OBJ_FROM (sp);
// FIXME: What if it's global const?
new_obj->attr.gc
= (VM_INIT_GLOBALS == vm->state) ? PERMANENT_OBJ : GEN_1_OBJ;
bl->obj = new_obj;
}
vm->sp = sp; // refix the pop offset
break;
}
case vector:
{
u8_t s = NEXT_DATA ();
u16_t size = ((s << 8) | NEXT_DATA ());
VM_DEBUG ("(push-vector-object %d)\n", size);
vector_t v = NEW_INNER_OBJ (vector);
v->attr.gc = (VM_INIT_GLOBALS == vm->state) ? PERMANENT_OBJ : GEN_1_OBJ;
v->vec = (object_t *)GC_MALLOC (sizeof (Object) * size);
v->size = size;
obj->attr.type = vector;
obj->value = (void *)v;
PUSH_OBJ (*obj);
u32_t sp = vm->sp - sizeof (Object);
for (u16_t i = 0; i < size; i++)
{
object_t new_obj = NEW_OBJ (TOP_OBJ_PTR_FROM (sp)->attr.type);
*new_obj = POP_OBJ_FROM (sp);
new_obj->attr.gc = GEN_1_OBJ; // don't forget to reset gc to 1
v->vec[i] = new_obj;
}
vm->sp = sp; // refix the pop offset
break;
}
case real:
{
real_t r = {.v = vm_get_uintptr (vm)};
VM_DEBUG ("(push-real-object %f)\n", r.f);
obj->value = (void *)r.v;
break;
}
case rational_pos:
case rational_neg:
{
numerator_t n = (u16_t)vm_get_u16 (vm);
denominator_t d = (u16_t)vm_get_u16 (vm);
hov_t value = ((n << 16) | d);
VM_DEBUG ("(push-rational-object %d/%d)\n", n > 0 ? n : -n, d);
obj->value = (void *)value;
break;
}
case complex_exact:
{
real_part_t r = (real_part_t)vm_get_u16 (vm);
imag_part_t i = (imag_part_t)vm_get_u16 (vm);
hov_t value = ((r << 0xf) | i);
VM_DEBUG ("(push-complex-object %d%d)\n", r, i);
obj->value = (void *)value;
break;
}
case complex_inexact:
{
const void *value = (void *)(vm->code + vm->pc);
#ifdef ANIMULA_DEBUG
real_t r = {.v = vm_get_uintptr (vm)};
real_t i = {.v = vm_get_uintptr (vm)};
if (i.f >= 0)
{
VM_DEBUG ("(push-complex-object %.1f+%.1fi)\n", r.f, i.f);
}
else
{
VM_DEBUG ("(push-complex-object %.1f%.1fi)\n", r.f, i.f);
}
#else
vm->pc += 8;
#endif
obj->value = (void *)value;
break;
}
case mut_bytevector:
{
u16_t size = NEXT_DATA ();
size = ((size << 8) | NEXT_DATA ());
VM_DEBUG ("(push-mut_bytevector-object %d)\n", size);
mut_bytevector_t v = NEW_INNER_OBJ (mut_bytevector);
v->attr.gc = (VM_INIT_GLOBALS == vm->state) ? PERMANENT_OBJ : GEN_1_OBJ;
v->size = size;
obj->attr.gc = v->attr.gc;
obj->attr.type = mut_bytevector;
v->vec = (u8_t *)GC_MALLOC (size);
obj->value = (void *)v;
vm->pc += size;
break;
}
case bytevector: // immutable bytevector
{
u16_t size = NEXT_DATA ();
size = ((size << 8) | NEXT_DATA ());
VM_DEBUG ("(push-bytevector-object %d)\n", size);
bytevector_t v = NEW_INNER_OBJ (bytevector);
v->attr.gc = (VM_INIT_GLOBALS == vm->state) ? PERMANENT_OBJ : GEN_1_OBJ;
v->size = size;
obj->attr.gc = v->attr.gc;
obj->attr.type = bytevector;
v->vec = vm->code + vm->pc;
obj->value = (void *)v;
vm->pc += size;
break;
}
default:
{
os_printk ("Oops, invalid object %d %d!\n", bc.type, bc.data);
VM_PANIC ();
}
}
return obj;
}
static void interp_single_encode (vm_t vm, bytecode8_t bc)
{
switch (bc.type)
{
case LOCAL_REF:
{
VM_DEBUG ("(local %d)\n", bc.data);
object_t obj = (object_t)LOCAL (bc.data);
/* os_printk ("\nobj: "); */
/* object_printer (obj); */
/* os_printk ("\n"); */
/* if (vm->closure) */
/* { */
/* for (int i = 0; i < vm->closure->frame_size; i++) */
/* { */
/* os_printk ("env[%d] type: %d, value: %d\n", i, */
/* vm->closure->env[i].attr.type, */
/* (imm_int_t) (vm->closure->env[i].value)); */
/* } */
/* } */
PUSH_OBJ (*obj);
break;
}
case LOCAL_REF_EXTEND:
{
VM_DEBUG ("(local %d)\n", bc.data);
object_t obj = (object_t)LOCAL (bc.data + 16);
PUSH_OBJ (*obj);
break;
}
case FREE_REF:
{
u8_t frame = NEXT_DATA ();
u8_t up = (frame & 0b00111111);
u8_t offset = ((bc.data << 2) | ((frame & 0b11000000) >> 6));
VM_DEBUG ("(free %x %d)\n", up, offset);
object_t obj = (object_t)FREE_VAR (up, offset);
/* os_printk ("obj: type = %d, value = %d\n", obj->attr.type, */
/* (imm_int_t)obj->value); */
PUSH_OBJ (*obj);
break;
}
case CALL_FREE:
{
/* TODO:
* 1. For proc, what's stored in free?
* 2. What's call convention?
* 3. Do we need to create proc-object when store?
*/
u8_t frame = NEXT_DATA ();
u8_t up = (frame & 0b00111111);
u8_t offset = ((bc.data << 2) | ((frame & 0b11000000) >> 6));
VM_DEBUG ("(call-free %x %d)\n", up, offset);
object_t obj = (object_t)FREE_VAR (up, offset);
if (NEED_VARGS (obj))
handle_optional_args (vm, obj);
CALL (obj);
break;
}
case CALL_LOCAL:
{
VM_DEBUG ("(call-local %d)\n", bc.data);
object_t obj = (object_t)LOCAL (bc.data);
if (NEED_VARGS (obj))
handle_optional_args (vm, obj);
CALL (obj);
break;
}
case CALL_LOCAL_EXTEND:
{
VM_DEBUG ("(call-local %d)\n", bc.data + 16);
object_t obj = (object_t)LOCAL (bc.data + 16);
if (NEED_VARGS (obj))
handle_optional_args (vm, obj);
CALL (obj);
break;
}
case FREE_ASSIGN:
{
u8_t frame = NEXT_DATA ();
u8_t up = (frame & 0b00111111);
u8_t offset = ((bc.data << 2) | ((frame & 0b11000000) >> 6));
VM_DEBUG ("(assign-free %x %d)\n", up, offset);
object_t obj = (object_t)FREE_VAR (up, offset);
*obj = POP_OBJ ();
break;
}
case LOCAL_ASSIGN:
{
u8_t offset_0 = NEXT_DATA ();
u8_t offset = ((bc.data << 8) | offset_0);
VM_DEBUG ("(assign-local %x)\n", offset);
object_t obj = (object_t)LOCAL (offset);
*obj = POP_OBJ ();
break;
}
default:
{
os_printk ("Invalid bytecode %X\n", bc.all);
PANIC ("interp_single_encode panic!\n");
}
}
}
static void interp_double_encode (vm_t vm, bytecode16_t bc)
{
switch (bc.type)
{
case PRELUDE:
{
VM_DEBUG ("(prelude %d %d)\n", PROC_MODE (bc.bc2), PROC_ARITY (bc.bc2));
SAVE_ENV ();
break;
}
case LOCAL_REF_HIGH:
{
u8_t offset = bc.bc2 + 32;
VM_DEBUG ("(local %d)\n", offset);
object_t obj = (object_t)LOCAL (offset);
PUSH_OBJ (*obj);
break;
}
case CALL_LOCAL_HIGH:
{
u8_t offset = bc.bc2 + 32;
VM_DEBUG ("(call-local %d)\n", offset);
object_t obj = (object_t)LOCAL (offset);
if (NEED_VARGS (obj))
handle_optional_args (vm, obj);
CALL (obj);
break;
}
case GLOBAL_VAR_ASSIGN:
{
u8_t index = bc.bc2;
Object var = POP_OBJ ();
#ifdef ANIMULA_DEBUG
if (GLOBAL_REF (vm_verbose))
{
os_printk ("(global-assign %d ", index);
object_printer (&var);
os_printk (")\n");
}
#endif
GLOBAL_ASSIGN (index, var);
PUSH_OBJ (GLOBAL_REF (none_const)); // return NONE object
break;
}
case GLOBAL_VAR_REF:
{
u8_t index = bc.bc2;
VM_DEBUG ("(global %d)\n", index);
object_t obj = &GLOBAL (index);
PUSH_OBJ (*obj);
break;
}
case CALL_GLOBAL_VAR:
{
u8_t index = bc.bc2;
VM_DEBUG ("(call-global %d)\n", index);
object_t obj = &GLOBAL (index);
if (NEED_VARGS (obj))
handle_optional_args (vm, obj);
CALL (obj);
break;
}
default:
{
os_printk ("Invalid bytecode %X %X\n", bc.type, bc.data);
PANIC ("interp_double_encode panic!\n");
}
};
}
static void interp_triple_encode (vm_t vm, bytecode24_t bc)
{
switch (bc.type)
{
case CALL_PROC:
{
u32_t offset = bc.data;
VM_DEBUG ("(call-proc 0x%x)\n", offset);
/* os_printk ("call-proc before fp: %d\n", ((u32_t
* *)vm->stack)[vm->fp]);
*/
FIX_PC ();
PROC_CALL (offset);
/* os_printk ("call-proc after fp: %d\n", ((u32_t *)vm->stack)[vm->fp]);
*/
break;
}
case F_JMP:
{
u32_t offset = bc.data;
VM_DEBUG ("(fjump 0x%x)\n", offset);
Object obj = POP_OBJ ();
if (is_false (&obj))
{
VM_DEBUG ("False! Jump!\n");
JUMP (offset);
}
break;
}
case JMP:
{
u32_t offset = bc.data;
VM_DEBUG ("(jump 0x%x)\n", offset);
JUMP (offset);
break;
}
case VEC_REF:
{
PANIC ("VEC_REf hasn't been implemented yet!");
// VM_DEBUG ("(vec-ref 0x%p %d)\n", vec, bc.bc3);
// PUSH (vector_ref (vec, bc.bc2));
break;
}
case GLOBAL_VAR_ASSIGN_EXTEND:
{