/
runt.c
2059 lines (1739 loc) · 45.6 KB
/
runt.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
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
#include <stdlib.h>
#include <string.h>
#include <stdio.h>
#ifdef RUNT_PLUGINS
#include <dlfcn.h>
#endif
#include "runt.h"
#ifndef MAX
#define MAX(A, B) ((A) > (B) ? (A) : (B))
#endif
static runt_int runt_proc_zero(runt_vm *vm, runt_ptr p);
static runt_int runt_proc_link(runt_vm *vm, runt_ptr p);
static int runt_copy_float(runt_vm *vm, runt_cell *src, runt_cell *dest);
static int rproc_float(runt_vm *vm, runt_ptr p);
static int runt_copy_string(runt_vm *vm, runt_cell *src, runt_cell *dest);
static int runt_copy_cell(runt_vm *vm, runt_cell *c);
static int rproc_string(runt_vm *vm, runt_ptr p);
static int rproc_cell(runt_vm *vm, runt_ptr p);
static int rproc_begin(runt_vm *vm, runt_cell *src, runt_cell *dst);
static int rproc_end(runt_vm *vm, runt_cell *src, runt_cell *dst);
static int rproc_cptr(runt_vm *vm, runt_ptr p);
static int rproc_rec(runt_vm *vm, runt_ptr p);
static int rproc_stop(runt_vm *vm, runt_cell *src, runt_cell *dst);
static runt_int load_nothing(runt_vm *vm);
runt_int runt_init(runt_vm *vm)
{
vm->status = 0;
vm->zproc = runt_proc_zero;
vm->nil = runt_mk_ptr(RUNT_NIL, NULL);
/* init stack */
runt_stack_init(vm, &vm->stack);
/* init dictionary */
runt_dictionary_init(vm);
/* record cells being parsed by default */
runt_set_state(vm, RUNT_MODE_INTERACTIVE, RUNT_OFF);
runt_set_state(vm, RUNT_MODE_RUNNING, RUNT_ON);
vm->level = 0;
vm->pos = 0;
/* set print output to STDERR by default */
vm->fp = stderr;
/* set up plugin handle list */
runt_list_init(&vm->plugins);
vm->nwords = 0;
vm->loader = load_nothing;
runt_cell_bind(vm, &vm->empty, vm->zproc);
runt_cell_data(vm, &vm->empty, vm->nil);
runt_print_set(vm, runt_print_default);
/* set up destructor list */
runt_list_init(&vm->dtors);
/* set up registers */
runt_registers_init(vm);
vm->anon = NULL;
vm->last_cell_called = &vm->empty;
return RUNT_OK;
}
/* Useful if runt needs to be reloaded */
runt_int runt_reinit(runt_vm *vm)
{
runt_init(vm);
runt_cell_pool_set(vm, vm->cell_pool.cells, vm->cell_pool.size);
runt_cell_pool_init(vm);
runt_memory_pool_set(vm, vm->memory_pool.data, vm->memory_pool.size);
return RUNT_OK;
}
runt_int runt_load_minimal(runt_vm *vm)
{
/* create float type */
runt_cell_malloc(vm, &vm->f_cell);
runt_cell_bind(vm, vm->f_cell, rproc_float);
/* create string type */
runt_cell_malloc(vm, &vm->s_cell);
runt_cell_bind(vm, vm->s_cell, rproc_string);
/* ability to create procedures by default */
runt_keyword_define_with_copy(vm, ":", 1, vm->zproc, rproc_begin, NULL);
runt_keyword_define_with_copy(vm, ";", 1, vm->zproc, rproc_end, NULL);
/* [ and ] for rec, stop */
runt_keyword_define(vm, "[", 1, rproc_rec, NULL);
runt_keyword_define_with_copy(vm, "]", 1, vm->zproc, rproc_stop, NULL);
return RUNT_OK;
}
runt_int runt_load_stdlib(runt_vm *vm)
{
runt_load_minimal(vm);
/* load basic library */
runt_load_basic(vm);
return RUNT_OK;
}
runt_int runt_cell_pool_set(runt_vm *vm, runt_cell *cells, runt_uint size)
{
vm->cell_pool.cells = cells;
vm->cell_pool.size = size;
vm->cell_pool.used = 0;
return RUNT_OK;
}
runt_int runt_cell_pool_init(runt_vm *vm)
{
runt_uint i;
runt_cell *cells = vm->cell_pool.cells;
for(i = 0; i < vm->cell_pool.size; i++) {
runt_cell_clear(vm, &cells[i]);
}
vm->cell_pool.mark = 0;
return RUNT_OK;
}
runt_int runt_memory_pool_set(runt_vm *vm, unsigned char *buf, runt_uint size)
{
vm->memory_pool.data = buf;
vm->memory_pool.size = size;
vm->memory_pool.used = 0;
vm->memory_pool.mark = 0;
memset(buf, 0, size);
return RUNT_OK;
}
runt_uint runt_cell_new(runt_vm *vm, runt_cell **cell)
{
runt_uint id;
runt_cell_pool *pool = &vm->cell_pool;
runt_cell *proc;
runt_stacklet *s;
pool->used++;
if(runt_get_state(vm, RUNT_MODE_PANIC) == RUNT_ON) {
return 0;
}else if(pool->used >= pool->size) {
runt_print(vm, "Oh dear. Runt cell pool space at maximum.\n");
runt_set_state(vm, RUNT_MODE_PANIC, RUNT_ON);
runt_set_state(vm, RUNT_MODE_RUNNING, RUNT_OFF);
return 0;
}
if(vm->status & RUNT_MODE_PROC) {
s = runt_peak(vm);
proc = runt_to_cell(s->p);
proc->psize++;
}
id = pool->used;
*cell = &pool->cells[id - 1];
(*cell)->id = id;
return id;
}
runt_int runt_cell_malloc(runt_vm *vm, runt_cell **cell)
{
runt_uint id;
id = runt_malloc(vm, sizeof(runt_cell), (void **)cell);
if(id == 0) return RUNT_NOT_OK;
runt_cell_clear(vm, *cell);
(*cell)->id = 0;
return RUNT_OK;
}
runt_ptr runt_mk_ptr(runt_type type, void *ud)
{
runt_ptr ptr;
ptr.type = type;
ptr.ud = ud;
return ptr;
}
runt_int runt_cell_bind(runt_vm *vm, runt_cell *cell, runt_proc proc)
{
cell->fun = proc;
return RUNT_OK;
}
runt_int runt_cell_data(runt_vm *vm, runt_cell *cell, runt_ptr p)
{
cell->p = p;
return RUNT_OK;
}
runt_int runt_cell_call(runt_vm *vm, runt_cell *cell)
{
vm->last_cell_called = cell;
return cell->fun(vm, cell->p);
}
static runt_int runt_proc_zero(runt_vm *vm, runt_ptr p)
{
return RUNT_OK;
}
runt_int runt_proc_begin(runt_vm *vm, runt_cell *proc)
{
runt_stacklet *s = runt_push(vm);
runt_set_state(vm, RUNT_MODE_PROC, RUNT_ON);
s->p = runt_mk_ptr(RUNT_CELL, (void *)proc);
return RUNT_OK;
}
runt_int runt_proc_end(runt_vm *vm)
{
runt_pop(vm);
vm->status &= ~(RUNT_MODE_PROC);
return RUNT_OK;
}
runt_int runt_cell_exec(runt_vm *vm, runt_cell *cell)
{
runt_uint i;
runt_int rc = RUNT_OK;
if(cell == NULL) {
runt_print(vm, "Could not execute. Cell is NULL\n");
return RUNT_NOT_OK;
}
if(cell->psize == 0) {
return runt_cell_call(vm, cell);
}
for(i = 1; i <= cell->psize; i++) {
if(cell[i].psize == 0) {
rc = runt_cell_call(vm, &cell[i]);
} else {
rc = runt_cell_exec(vm, &cell[i]);
}
RUNT_ERROR_CHECK(rc);
}
return rc;
}
runt_int runt_cell_id_exec(runt_vm *vm, runt_uint id)
{
return runt_cell_exec(vm, &vm->cell_pool.cells[id - 1]);
}
runt_int runt_cell_link(runt_vm *vm, runt_cell *src, runt_cell *dest)
{
/* TODO: error handling for init */
dest->fun = runt_proc_link;
dest->p = runt_mk_ptr(RUNT_CELL, src);
return RUNT_OK;
}
static runt_int runt_proc_link(runt_vm *vm, runt_ptr p)
{
runt_cell *cell = runt_to_cell(p);
return runt_cell_exec(vm, cell);
}
runt_cell * runt_to_cell(runt_ptr p)
{
runt_cell *cell = NULL;
/* TODO: error handling */
if(p.type == RUNT_CELL) {
cell = (runt_cell *)p.ud;
} else {
fprintf(stderr, "Not a cell!\n");
}
return cell;
}
runt_float * runt_to_float(runt_ptr p)
{
runt_float *f = NULL;
/* TODO: error handling */
if(p.type == RUNT_FLOAT) {
f = (runt_float *)p.ud;
}
return f;
}
runt_ptr runt_mk_float(runt_vm *vm, runt_float ival)
{
runt_ptr p;
float *val;
val = NULL;
p.pos = runt_malloc(vm, sizeof(runt_float), (void**)&val);
p = runt_mk_ptr(RUNT_FLOAT, val);
*val = ival;
return p;
}
runt_int runt_memory_pool_get(runt_vm *vm, runt_uint id, void **ud)
{
if(id > runt_memory_pool_size(vm)) {
runt_print(vm, "Memory ID out of bounds!\n");
return RUNT_NOT_OK;
}
if(id == 0) {
runt_print(vm, "Memory ID has illegal value of zero.\n");
return RUNT_NOT_OK;
}
*ud = &vm->memory_pool.data[id - 1];
return RUNT_OK;
}
const char * runt_to_string(runt_ptr p)
{
const char *str;
/*TODO: error handling */
if(p.type == RUNT_STRING) {
str = p.ud;
return str;
} else {
return NULL;
}
return NULL;
}
runt_ptr runt_mk_string(runt_vm *vm, const char *str, runt_uint size)
{
runt_ptr p;
char *buf;
runt_uint i;
runt_uint pos;
buf = NULL;
pos = runt_malloc(vm, size + 1, (void *)&buf);
for(i = 0; i < size; i++) {
buf[i] = str[i];
}
buf[size] = 0;
p = runt_mk_ptr(RUNT_STRING, (void *)buf);
p.pos = pos;
return p;
}
runt_stacklet * runt_push(runt_vm *vm)
{
/*TODO: wrapper for ppush */
runt_stacklet *s;
/*TODO: error handling for stack overflows */
if(runt_stack_pos(vm, &vm->stack) == vm->stack.size) {
runt_print(vm, "stack overflow!\n");
s = &vm->stack.stack[0];
return NULL;
}
runt_stack_inc(vm, &vm->stack);
s = &vm->stack.stack[runt_stack_pos(vm, &vm->stack) - 1];
return s;
}
runt_int runt_ppush(runt_vm *vm, runt_stacklet **s)
{
/*TODO: error handling for stack overflows */
if(runt_stack_pos(vm, &vm->stack) == vm->stack.size) {
runt_print(vm, "stack overflow!\n");
*s = &vm->stack.stack[0];
return RUNT_NOT_OK;
}
runt_stack_inc(vm, &vm->stack);
*s = &vm->stack.stack[runt_stack_pos(vm, &vm->stack)- 1];
return RUNT_OK;
}
/* peak just looks at the last item on the stack */
runt_stacklet * runt_peak(runt_vm *vm)
{
runt_stacklet *s;
runt_ppeak(vm, &s);
return s;
}
runt_int runt_ppeak(runt_vm *vm, runt_stacklet **s)
{
/*TODO: error handling for stack underflows */
if(runt_stack_pos(vm, &vm->stack) > 0) {
*s = &vm->stack.stack[runt_stack_pos(vm, &vm->stack) - 1];
} else {
runt_print(vm, "Empty stack.\n");
*s = &vm->stack.stack[0];
return RUNT_NOT_OK;
}
return RUNT_OK;
}
runt_int runt_ppeakn(runt_vm *vm, runt_stacklet **s, runt_int pos)
{
*s = &vm->stack.stack[0];
if(abs(pos) > runt_stack_bias_pos(vm, &vm->stack)) {
runt_print(vm, "Invalid range %d\n", pos);
return RUNT_NOT_OK;
}
if(pos >= 0) {
*s = &vm->stack.stack[pos + vm->stack.bias];
} else {
*s = &vm->stack.stack[runt_stack_bias_pos(vm, &vm->stack) + pos];
}
return RUNT_OK;
}
/* undo the last pop */
void runt_unpop(runt_vm *vm)
{
runt_stack_inc(vm, &vm->stack);
}
runt_float runt_stack_float(runt_vm *vm, runt_stacklet *stack)
{
return stack->f;
}
runt_int runt_stack_pos(runt_vm *vm, runt_stack *stack)
{
return stack->pos;
}
runt_int runt_stack_bias_pos(runt_vm *vm, runt_stack *stack)
{
return stack->pos + stack->bias;
}
void runt_stack_bias(runt_vm *vm, runt_stack *stack, runt_int bias)
{
stack->bias = stack->pos - bias;
}
void runt_stack_unbias(runt_vm *vm, runt_stack *stack)
{
stack->bias = 0;
}
void runt_stack_dec(runt_vm *vm, runt_stack *stack)
{
runt_stack_dec_n(vm, stack, 1);
}
void runt_stack_dec_n(runt_vm *vm, runt_stack *stack, runt_uint n)
{
stack->pos -= n;
}
void runt_stack_inc(runt_vm *vm, runt_stack *stack)
{
stack->pos++;
}
void runt_stack_init(runt_vm *vm, runt_stack *stack)
{
stack->pos = 0;
stack->size = RUNT_STACK_SIZE;
stack->bias = 0;
}
runt_stacklet * runt_pop(runt_vm *vm)
{
runt_stacklet *s = NULL;
runt_ppop(vm, &s);
return s;
}
runt_int runt_ppop(runt_vm *vm, runt_stacklet **s)
{
*s = &vm->stack.stack[0];
if(runt_stack_pos(vm, &vm->stack) > 0) {
runt_stack_dec(vm, &vm->stack);
*s = &vm->stack.stack[runt_stack_pos(vm, &vm->stack)];
} else {
runt_print(vm, "Empty stack.\n");
return RUNT_NOT_OK;
}
return RUNT_OK;
}
runt_uint runt_malloc(runt_vm *vm, size_t size, void **ud)
{
runt_memory_pool *pool = &vm->memory_pool;
runt_uint id = 0;
#ifdef ALIGNED_MALLOC
if(size % 4 != 0) {
size = ((size/4) + 1) * 4;
}
#endif
/* TODO: overload error handling */
if(pool->used + size >= pool->size) {
return 0;
}
*ud = (void *)&pool->data[pool->used];
id = pool->used + 1;
pool->used += size;
return id;
}
runt_uint runt_entry_create(runt_vm *vm,
runt_cell *cell,
runt_entry **entry)
{
runt_entry *e;
runt_malloc(vm, sizeof(runt_entry), (void **)entry);
e = *entry;
e->copy = runt_cell_link;
e->cell = cell;
e->p = vm->nil;
e->size = 0;
return 0;
}
void runt_entry_set_copy_proc(runt_entry *entry, runt_copy_proc copy)
{
entry->copy = copy;
}
runt_int runt_entry_copy(runt_vm *vm, runt_entry *entry, runt_cell *dest)
{
return entry->copy(vm, entry->cell, dest);
}
runt_int runt_entry_exec(runt_vm *vm, runt_entry *entry)
{
return runt_cell_exec(vm, entry->cell);
}
static runt_uint runt_hash(const char *str, runt_int size)
{
runt_uint h = 5381;
runt_int i = 0;
for(i = 0; i < size; i++) {
h = ((h << 5) + h) ^ str[i];
h %= 0x7FFFFFFF;
}
return h % RUNT_DICT_SIZE;
}
runt_int runt_word(runt_vm *vm,
const char *name,
runt_int size,
runt_entry *entry)
{
entry->p = runt_mk_string(vm, name, size);
return runt_word_dict(vm,
name,
size,
entry,
runt_dictionary_get(vm));
}
runt_int runt_word_dict(runt_vm *vm,
const char *name,
runt_int size,
runt_entry *entry,
runt_dict *dict)
{
runt_uint pos;
runt_list *list;
pos = runt_hash(name, size);
list = &dict->list[pos];
entry->size = size;
runt_list_append(list, entry);
dict->nwords++;
return RUNT_OK;
}
static runt_int runt_strncmp(runt_vm *vm, const char *str, runt_int size, runt_entry *e)
{
if(size == e->size) {
return strncmp(str, runt_to_string(e->p), size);
} else {
return 1;
}
}
runt_int runt_word_search(runt_vm *vm,
const char *name,
runt_int size,
runt_entry **entry)
{
return runt_word_search_dict(vm,
name,
size,
entry,
runt_dictionary_get(vm));
}
runt_int runt_word_search_dict(runt_vm *vm,
const char *name,
runt_int size,
runt_entry **entry,
runt_dict *dict)
{
runt_uint pos;
runt_list *list;
runt_uint i;
runt_entry *ent;
runt_entry *next;
pos = runt_hash(name, size);
list = &dict->list[pos];
ent = runt_list_top(list);
for(i = 0; i < list->size; i++) {
next = ent->next;
if(runt_strncmp(vm, name, size, ent) == 0) {
*entry = ent;
return RUNT_OK;
}
ent = next;
}
return RUNT_NOT_OK;
}
void runt_list_init(runt_list *lst)
{
lst->size = 0;
}
runt_int runt_list_append(runt_list *lst, runt_entry *ent)
{
if(lst->size == 0) {
lst->top = ent;
lst->last = lst->top;
} else {
lst->last->next = ent;
}
ent->prev = lst->last;
lst->last = ent;
lst->size++;
ent->list = lst;
return RUNT_OK;
}
runt_int runt_list_pop(runt_vm *vm, runt_list *lst)
{
if(lst->size == 0) {
runt_print(vm, "No items on the list to pop off");
return RUNT_NOT_OK;
} else if(lst->size == 1) {
lst->size = 0;
return RUNT_OK;
}
lst->size--;
lst->last = lst->last->prev;
return RUNT_OK;
}
runt_int runt_list_prepend(runt_list *lst, runt_entry *ent)
{
if(lst->size > 0) {
ent->next = lst->top;
}
lst->top = ent;
lst->size++;
return RUNT_OK;
}
runt_int runt_list_append_ptr(runt_vm *vm, runt_list *lst, runt_ptr p)
{
runt_entry *entry;
entry = NULL;
/* make entry, using empty cell */
runt_entry_create(vm, &vm->empty, &entry);
/* set ptr to "string" entry in struct. works better than it looks */
entry->p = p;
runt_list_append(lst, entry);
return RUNT_OK;
}
runt_int runt_list_append_cell(runt_vm *vm, runt_list *lst, runt_cell *cell)
{
runt_entry *entry;
entry = NULL;
runt_entry_create(vm, cell, &entry);
runt_list_append(lst, entry);
return RUNT_OK;
}
runt_int runt_list_prepend_cell(runt_vm *vm, runt_list *lst, runt_cell *cell)
{
runt_entry *entry;
entry = NULL;
runt_entry_create(vm, cell, &entry);
runt_list_prepend(lst, entry);
return RUNT_OK;
}
runt_int runt_list_size(runt_list *lst)
{
return lst->size;
}
runt_entry * runt_list_top(runt_list *lst)
{
return lst->top;
}
void runt_dictionary_init(runt_vm *vm)
{
runt_dictionary_set(vm, &vm->idict);
runt_dict_init(vm, &vm->idict);
}
void runt_dict_init(runt_vm *vm, runt_dict *dict)
{
runt_uint i;
dict->nwords = 0;
for(i = 0; i < RUNT_DICT_SIZE; i++) {
runt_list_init(&dict->list[i]);
}
dict->last = dict;
}
runt_int runt_dictionary_clear(runt_vm *vm)
{
return runt_dict_clear(vm, &vm->idict);
}
runt_int runt_dict_clear(runt_vm *vm, runt_dict *dict)
{
dict->nwords = 0;
runt_dictionary_init(vm);
return RUNT_OK;
}
runt_uint runt_dictionary_size(runt_vm *vm)
{
return runt_dict_size(vm, &vm->idict);
}
runt_uint runt_dict_size(runt_vm *vm, runt_dict *dict)
{
return dict->nwords;
}
runt_uint runt_memory_pool_size(runt_vm *vm)
{
return vm->memory_pool.size;
}
runt_uint runt_memory_pool_used(runt_vm *vm)
{
return vm->memory_pool.used;
}
void runt_memory_pool_clear(runt_vm *vm)
{
vm->memory_pool.used = 0;
}
runt_uint runt_cell_pool_size(runt_vm *vm)
{
return vm->cell_pool.size;
}
runt_uint runt_cell_pool_used(runt_vm *vm)
{
return vm->cell_pool.used;
}
void runt_cell_pool_clear(runt_vm *vm)
{
vm->cell_pool.used = 0;
}
runt_int runt_cell_pool_get_cell(runt_vm *vm, runt_uint id, runt_cell **cell)
{
runt_cell_pool *cell_pool = &vm->cell_pool;
if(id > runt_cell_pool_size(vm) || id <= 0) {
runt_print(vm, "psize: invalid id %d\n", id);
return RUNT_NOT_OK;
}
*cell = &cell_pool->cells[id - 1];
return RUNT_OK;
}
runt_int runt_tokenize(runt_vm *vm,
const char *str,
runt_uint size,
runt_uint *pos,
runt_uint *wsize,
runt_uint *next)
{
runt_uint s;
runt_uint p;
runt_uint mode = 0;
runt_uint stop = 0;
char m = '"';
*wsize = 0;
*pos = *next;
p = *pos;
if(*pos > size) return RUNT_OK;
if(*pos == size) {
*next = size + 1;
return RUNT_CONTINUE;
}
for(s = p; s < size; s++) {
if(stop != 0) {
break;
}
switch (mode) {
case 3:
if(str[s] == m) {
mode = 2;
*wsize = (s - *pos) + 1;
}
continue;
case 2:
if(str[s] != ' ' && str[s] != '\n') {
*next = s;
stop = 1;
break;
}
continue;
case 1:
if(str[s] == ' ' || str[s] == '\n') {
mode = 2;
*wsize = (s - *pos);
}
continue;
case 0:
if(str[s] == '#') return RUNT_OK;
if(str[s] != ' ' && str[s] != '\n') {
if(str[s] == '\'' || str[s] == '\"') {
mode = 3;
m = str[s];
} else {
mode = 1;
*pos = s;
}
}
*pos = s;
continue;
default: break;
}
}
/* if we are at the end, make next larger than the size */
if(s == size) {
if(mode == 1) {
*wsize = (s - *pos);
} if(mode == 2 && *next == size - 1) {
return RUNT_CONTINUE;
}
*next = size + 1;
}
return RUNT_CONTINUE;
}
runt_type runt_lex(runt_vm *vm,
const char *str,
runt_uint pos,
runt_uint size)
{
runt_uint c;
runt_int off;
runt_int lvl;
lvl = 0;
off = pos + size;
for(c = pos; c < off; c++) {
switch(lvl) {
case 0:
switch(str[c]) {
case '0':
if(size > 1) {
lvl = 1;
break;
}
case '1':
case '2':
case '3':
case '4':
case '5':
case '6':
case '7':
case '8':
case '9':
return RUNT_FLOAT;
case '-':
if(size == 1) {
return RUNT_PROC;
} else {
return RUNT_FLOAT;
}
case '"':
case '\'':
return RUNT_STRING;
case '_':
return RUNT_WORD;
case '\n':
return RUNT_NIL;
default:
return RUNT_PROC;
}
break;
case 1:
switch(str[c]) {
case 'x':
return RUNT_HEX;
default:
return RUNT_FLOAT;
}
break;
}
}
return RUNT_NOT_OK;
}
runt_float runt_atof(const char *str, runt_uint pos, runt_uint size)
{
runt_float total = 0.0;
runt_int sign = 1.0;
runt_uint i;
runt_uint mode = 0;
runt_float place = 1.0;
runt_float scale = 10.0;
runt_float num = 0.0;
if(str[pos] == '-') {
sign = -1;
pos++;
size--;
}
for(i = pos; i < pos + size; i++) {
num = 0.0;
switch(str[i]) {
case '0':
num = 0.0;
break;
case '1':
num = 1.0;
break;
case '2':
num = 2.0;
break;
case '3':
num = 3.0;
break;
case '4':
num = 4.0;
break;
case '5':