2 * *****************************************************************************
4 * SPDX-License-Identifier: BSD-2-Clause
6 * Copyright (c) 2018-2020 Gavin D. Howard and contributors.
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions are met:
11 * * Redistributions of source code must retain the above copyright notice, this
12 * list of conditions and the following disclaimer.
14 * * Redistributions in binary form must reproduce the above copyright notice,
15 * this list of conditions and the following disclaimer in the documentation
16 * and/or other materials provided with the distribution.
18 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
19 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
20 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
21 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
22 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
23 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
24 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
25 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
26 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
27 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
28 * POSSIBILITY OF SUCH DAMAGE.
30 * *****************************************************************************
32 * Code to execute bc programs.
51 static void bc_program_addFunc(BcProgram *p, BcFunc *f, BcId *id_ptr);
53 static inline void bc_program_setVecs(BcProgram *p, BcFunc *f) {
54 p->consts = &f->consts;
55 if (BC_IS_BC) p->strs = &f->strs;
58 static inline void bc_program_type_num(BcResult *r, BcNum *n) {
61 assert(r->t != BC_RESULT_VOID);
64 if (BC_ERR(!BC_PROG_NUM(r, n))) bc_vm_err(BC_ERROR_EXEC_TYPE);
68 static void bc_program_type_match(BcResult *r, BcType t) {
71 assert(BC_IS_DC || BC_NO_ERR(r->t != BC_RESULT_STR));
74 if (BC_ERR((r->t != BC_RESULT_ARRAY) != (!t)))
75 bc_vm_err(BC_ERROR_EXEC_TYPE);
79 static size_t bc_program_index(const char *restrict code, size_t *restrict bgn)
81 uchar amt = (uchar) code[(*bgn)++], i = 0;
84 for (; i < amt; ++i, ++(*bgn)) {
85 size_t temp = ((size_t) ((int) (uchar) code[*bgn]) & UCHAR_MAX);
86 res |= (temp << (i * CHAR_BIT));
93 static void bc_program_prepGlobals(BcProgram *p) {
97 for (i = 0; i < BC_PROG_GLOBALS_LEN; ++i)
98 bc_vec_push(p->globals_v + i, p->globals + i);
100 #if BC_ENABLE_EXTRA_MATH && BC_ENABLE_RAND
101 bc_rand_push(&p->rng);
102 #endif // BC_ENABLE_EXTRA_MATH && BC_ENABLE_RAND
105 static void bc_program_popGlobals(BcProgram *p, bool reset) {
109 for (i = 0; i < BC_PROG_GLOBALS_LEN; ++i) {
110 BcVec *v = p->globals_v + i;
111 bc_vec_npop(v, reset ? v->len - 1 : 1);
112 p->globals[i] = BC_PROG_GLOBAL(v);
115 #if BC_ENABLE_EXTRA_MATH && BC_ENABLE_RAND
116 bc_rand_pop(&p->rng, reset);
117 #endif // BC_ENABLE_EXTRA_MATH && BC_ENABLE_RAND
121 static void bc_program_pushBigdig(BcProgram *p, BcBigDig dig, BcResultType type)
129 bc_num_createFromBigdig(&res.d.n, dig);
130 bc_vec_push(&p->results, &res);
136 static BcVec* bc_program_dereference(const BcProgram *p, BcVec *vec) {
139 size_t vidx, nidx, i = 0;
141 assert(vec->size == sizeof(uchar));
143 vidx = bc_program_index(vec->v, &i);
144 nidx = bc_program_index(vec->v, &i);
146 v = bc_vec_item(bc_vec_item(&p->arrs, vidx), nidx);
148 assert(v->size != sizeof(uchar));
154 size_t bc_program_search(BcProgram *p, const char *id, bool var) {
160 v = var ? &p->vars : &p->arrs;
161 map = var ? &p->var_map : &p->arr_map;
165 if (bc_map_insert(map, id, v->len, &i)) {
166 bc_array_init(&data.v, var);
167 bc_vec_push(v, &data.v);
172 return ((BcId*) bc_vec_item(map, i))->idx;
175 static inline BcVec* bc_program_vec(const BcProgram *p, size_t idx, BcType type)
177 const BcVec *v = (type == BC_TYPE_VAR) ? &p->vars : &p->arrs;
178 return bc_vec_item(v, idx);
181 static BcNum* bc_program_num(BcProgram *p, BcResult *r) {
189 case BC_RESULT_IBASE:
190 case BC_RESULT_SCALE:
191 case BC_RESULT_OBASE:
192 #if BC_ENABLE_EXTRA_MATH
194 #endif // BC_ENABLE_EXTRA_MATH
202 case BC_RESULT_ARRAY:
204 case BC_RESULT_ARRAY_ELEM:
207 BcType type = (r->t == BC_RESULT_VAR) ? BC_TYPE_VAR : BC_TYPE_ARRAY;
209 v = bc_program_vec(p, r->d.loc.loc, type);
211 if (r->t == BC_RESULT_ARRAY_ELEM) {
213 size_t idx = r->d.loc.idx;
218 if (v->size == sizeof(uchar)) v = bc_program_dereference(p, v);
221 assert(v->size == sizeof(BcNum));
225 bc_array_expand(v, bc_vm_growSize(idx, 1));
229 n = bc_vec_item(v, idx);
231 else n = bc_vec_top(v);
267 static void bc_program_operand(BcProgram *p, BcResult **r,
268 BcNum **n, size_t idx)
270 *r = bc_vec_item_rev(&p->results, idx);
273 if (BC_ERR((*r)->t == BC_RESULT_VOID)) bc_vm_err(BC_ERROR_EXEC_VOID_VAL);
276 *n = bc_program_num(p, *r);
279 static void bc_program_binPrep(BcProgram *p, BcResult **l, BcNum **ln,
280 BcResult **r, BcNum **rn, size_t idx)
284 assert(p != NULL && l != NULL && ln != NULL && r != NULL && rn != NULL);
286 #ifndef BC_PROG_NO_STACK_CHECK
288 if (BC_ERR(!BC_PROG_STACK(&p->results, idx + 2)))
289 bc_vm_err(BC_ERROR_EXEC_STACK);
291 #endif // BC_PROG_NO_STACK_CHECK
293 assert(BC_PROG_STACK(&p->results, idx + 2));
295 bc_program_operand(p, l, ln, idx + 1);
296 bc_program_operand(p, r, rn, idx);
301 assert(lt != BC_RESULT_VOID && (*r)->t != BC_RESULT_VOID);
304 // We run this again under these conditions in case any vector has been
305 // reallocated out from under the BcNums or arrays we had.
306 if (lt == (*r)->t && (lt == BC_RESULT_VAR || lt == BC_RESULT_ARRAY_ELEM))
307 *ln = bc_program_num(p, *l);
309 if (BC_ERR(lt == BC_RESULT_STR)) bc_vm_err(BC_ERROR_EXEC_TYPE);
312 static void bc_program_binOpPrep(BcProgram *p, BcResult **l, BcNum **ln,
313 BcResult **r, BcNum **rn, size_t idx)
315 bc_program_binPrep(p, l, ln, r, rn, idx);
316 bc_program_type_num(*l, *ln);
317 bc_program_type_num(*r, *rn);
320 static void bc_program_assignPrep(BcProgram *p, BcResult **l, BcNum **ln,
321 BcResult **r, BcNum **rn)
323 BcResultType lt, min;
325 min = BC_RESULT_TEMP - ((unsigned int) (BC_IS_BC));
327 bc_program_binPrep(p, l, ln, r, rn, 0);
331 if (BC_ERR(lt >= min && lt <= BC_RESULT_ONE))
332 bc_vm_err(BC_ERROR_EXEC_TYPE);
337 bool good = (((*r)->t == BC_RESULT_STR || BC_PROG_STR(*rn)) &&
338 lt <= BC_RESULT_ARRAY_ELEM);
340 if (!good) bc_program_type_num(*r, *rn);
343 assert((*r)->t != BC_RESULT_STR);
347 static void bc_program_prep(BcProgram *p, BcResult **r, BcNum **n, size_t idx) {
349 assert(p != NULL && r != NULL && n != NULL);
351 #ifndef BC_PROG_NO_STACK_CHECK
353 if (BC_ERR(!BC_PROG_STACK(&p->results, idx + 1)))
354 bc_vm_err(BC_ERROR_EXEC_STACK);
356 #endif // BC_PROG_NO_STACK_CHECK
358 assert(BC_PROG_STACK(&p->results, idx + 1));
360 bc_program_operand(p, r, n, idx);
363 assert((*r)->t != BC_RESULT_VAR || !BC_PROG_STR(*n));
366 bc_program_type_num(*r, *n);
369 static BcResult* bc_program_prepResult(BcProgram *p) {
373 bc_result_clear(&res);
374 bc_vec_push(&p->results, &res);
376 return bc_vec_top(&p->results);
379 static void bc_program_const(BcProgram *p, const char *code, size_t *bgn) {
381 BcResult *r = bc_program_prepResult(p);
382 BcConst *c = bc_vec_item(p->consts, bc_program_index(code, bgn));
383 BcBigDig base = BC_PROG_IBASE(p);
385 if (c->base != base) {
387 if (c->num.num == NULL) {
389 bc_num_init(&c->num, BC_NUM_RDX(strlen(c->val)));
393 // bc_num_parse() should only do operations that cannot fail.
394 bc_num_parse(&c->num, c->val, base, !c->val[1]);
401 bc_num_createCopy(&r->d.n, &c->num);
406 static void bc_program_op(BcProgram *p, uchar inst) {
408 BcResult *opd1, *opd2, *res;
410 size_t idx = inst - BC_INST_POWER;
412 res = bc_program_prepResult(p);
414 bc_program_binOpPrep(p, &opd1, &n1, &opd2, &n2, 1);
418 bc_num_init(&res->d.n, bc_program_opReqs[idx](n1, n2, BC_PROG_SCALE(p)));
422 bc_program_ops[idx](n1, n2, &res->d.n, BC_PROG_SCALE(p));
424 bc_program_retire(p, 1, 2);
427 static void bc_program_read(BcProgram *p) {
435 BcFunc *f = bc_vec_item(&p->fns, BC_PROG_READ);
437 for (i = 0; i < p->stack.len; ++i) {
438 BcInstPtr *ip_ptr = bc_vec_item(&p->stack, i);
439 if (ip_ptr->func == BC_PROG_READ)
440 bc_vm_err(BC_ERROR_EXEC_REC_READ);
446 bc_parse_init(&parse, p, BC_PROG_READ);
447 bc_vec_init(&buf, sizeof(char), NULL);
449 BC_SETJMP_LOCKED(exec_err);
453 bc_lex_file(&parse.l, bc_program_stdin_name);
454 bc_vec_npop(&f->code, f->code.len);
456 s = bc_read_line(&buf, BC_IS_BC ? "read> " : "?> ");
457 if (s == BC_STATUS_EOF) bc_vm_err(BC_ERROR_EXEC_READ_EXPR);
459 bc_parse_text(&parse, buf.v);
460 vm.expr(&parse, BC_PARSE_NOREAD | BC_PARSE_NEEDVAL);
462 if (BC_ERR(parse.l.t != BC_LEX_NLINE && parse.l.t != BC_LEX_EOF))
463 bc_vm_err(BC_ERROR_EXEC_READ_EXPR);
466 if (BC_G) bc_program_prepGlobals(p);
469 ip.func = BC_PROG_READ;
471 ip.len = p->results.len;
473 // Update this pointer, just in case.
474 f = bc_vec_item(&p->fns, BC_PROG_READ);
476 bc_vec_pushByte(&f->code, vm.read_ret);
477 bc_vec_push(&p->stack, &ip);
482 bc_vec_push(&p->tail_calls, &temp);
488 bc_parse_free(&parse);
494 #if BC_ENABLE_EXTRA_MATH && BC_ENABLE_RAND
495 static void bc_program_rand(BcProgram *p) {
496 BcRand rand = bc_rand_int(&p->rng);
497 bc_program_pushBigdig(p, (BcBigDig) rand, BC_RESULT_TEMP);
499 #endif // BC_ENABLE_EXTRA_MATH && BC_ENABLE_RAND
501 static void bc_program_printChars(const char *str) {
504 size_t len = vm.nchars + strlen(str);
506 bc_file_puts(&vm.fout, str);
507 nl = strrchr(str, '\n');
509 if (nl != NULL) len = strlen(nl + 1);
511 vm.nchars = len > UINT16_MAX ? UINT16_MAX : (uint16_t) len;
514 static void bc_program_printString(const char *restrict str) {
516 size_t i, len = strlen(str);
519 if (!len && BC_IS_DC) {
525 for (i = 0; i < len; ++i) {
529 if (c == '\\' && i != len - 1) {
534 ptr = strchr(bc_program_esc_chars, c);
537 if (c == 'n') vm.nchars = UINT16_MAX;
538 c = bc_program_esc_seqs[(size_t) (ptr - bc_program_esc_chars)];
541 // Just print the backslash. The following
542 // character will be printed later.
551 static void bc_program_print(BcProgram *p, uchar inst, size_t idx) {
556 bool pop = (inst != BC_INST_PRINT);
560 #ifndef BC_PROG_NO_STACK_CHECK
562 if (BC_ERR(!BC_PROG_STACK(&p->results, idx + 1)))
563 bc_vm_err(BC_ERROR_EXEC_STACK);
565 #endif // BC_PROG_NO_STACK_CHECK
567 assert(BC_PROG_STACK(&p->results, idx + 1));
569 r = bc_vec_item_rev(&p->results, idx);
572 if (r->t == BC_RESULT_VOID) {
573 if (BC_ERR(pop)) bc_vm_err(BC_ERROR_EXEC_VOID_VAL);
574 bc_vec_pop(&p->results);
579 n = bc_program_num(p, r);
581 if (BC_PROG_NUM(r, n)) {
582 assert(inst != BC_INST_PRINT_STR);
583 bc_num_print(n, BC_PROG_OBASE(p), !pop);
585 if (BC_IS_BC) bc_num_copy(&p->last, n);
590 size_t i = (r->t == BC_RESULT_STR) ? r->d.loc.loc : n->scale;
592 bc_file_flush(&vm.fout);
593 str = *((char**) bc_vec_item(p->strs, i));
595 if (inst == BC_INST_PRINT_STR) bc_program_printChars(str);
597 bc_program_printString(str);
598 if (inst == BC_INST_PRINT) bc_vm_putchar('\n');
602 if (BC_IS_BC || pop) bc_vec_pop(&p->results);
605 void bc_program_negate(BcResult *r, BcNum *n) {
606 bc_num_copy(&r->d.n, n);
607 if (BC_NUM_NONZERO(&r->d.n)) r->d.n.neg = !r->d.n.neg;
610 void bc_program_not(BcResult *r, BcNum *n) {
611 if (!bc_num_cmpZero(n)) bc_num_one(&r->d.n);
614 #if BC_ENABLE_EXTRA_MATH
615 void bc_program_trunc(BcResult *r, BcNum *n) {
616 bc_num_copy(&r->d.n, n);
617 bc_num_truncate(&r->d.n, n->scale);
619 #endif // BC_ENABLE_EXTRA_MATH
621 static void bc_program_unary(BcProgram *p, uchar inst) {
626 res = bc_program_prepResult(p);
628 bc_program_prep(p, &ptr, &num, 1);
632 bc_num_init(&res->d.n, num->len);
636 bc_program_unarys[inst - BC_INST_NEG](res, num);
637 bc_program_retire(p, 1, 1);
640 static void bc_program_logical(BcProgram *p, uchar inst) {
642 BcResult *opd1, *opd2, *res;
647 res = bc_program_prepResult(p);
649 bc_program_binOpPrep(p, &opd1, &n1, &opd2, &n2, 1);
651 if (inst == BC_INST_BOOL_AND)
652 cond = (bc_num_cmpZero(n1) && bc_num_cmpZero(n2));
653 else if (inst == BC_INST_BOOL_OR)
654 cond = (bc_num_cmpZero(n1) || bc_num_cmpZero(n2));
657 cmp = bc_num_cmp(n1, n2);
707 bc_num_init(&res->d.n, BC_NUM_DEF_SIZE);
711 if (cond) bc_num_one(&res->d.n);
713 bc_program_retire(p, 1, 2);
717 static void bc_program_assignStr(BcProgram *p, BcResult *r,
723 n2.scale = r->d.loc.loc;
725 assert(BC_PROG_STACK(&p->results, 1 + !push));
727 if (!push) bc_vec_pop(v);
729 bc_vec_npop(&p->results, 1 + !push);
734 static void bc_program_copyToVar(BcProgram *p, size_t idx,
737 BcResult *ptr = NULL, r;
740 bool var = (t == BC_TYPE_VAR);
745 if (BC_ERR(!BC_PROG_STACK(&p->results, 1)))
746 bc_vm_err(BC_ERROR_EXEC_STACK);
748 assert(BC_PROG_STACK(&p->results, 1));
750 bc_program_operand(p, &ptr, &n, 0);
757 ptr = bc_vec_top(&p->results);
759 bc_program_type_match(ptr, t);
761 if (last) n = bc_program_num(p, ptr);
763 n = bc_vec_item_rev(bc_program_vec(p, ptr->d.loc.loc, t), 1);
767 vec = bc_program_vec(p, idx, t);
770 if (BC_IS_DC && (ptr->t == BC_RESULT_STR || BC_PROG_STR(n))) {
771 if (BC_ERR(!var)) bc_vm_err(BC_ERROR_EXEC_TYPE);
772 bc_program_assignStr(p, ptr, vec, true);
779 if (var) bc_num_createCopy(&r.d.n, n);
782 BcVec *v = (BcVec*) n, *rv = &r.d.v;
787 parent = bc_program_vec(p, ptr->d.loc.loc, t);
788 assert(parent != NULL);
790 if (!last) v = bc_vec_item_rev(parent, !last);
793 ref = (v->size == sizeof(BcNum) && t == BC_TYPE_REF);
794 ref_size = (v->size == sizeof(uchar));
796 if (ref || (ref_size && t == BC_TYPE_REF)) {
798 bc_vec_init(rv, sizeof(uchar), NULL);
802 assert(parent->len >= (size_t) (!last + 1));
804 // Make sure the pointer was not invalidated.
805 vec = bc_program_vec(p, idx, t);
807 bc_vec_pushIndex(rv, ptr->d.loc.loc);
808 bc_vec_pushIndex(rv, parent->len - !last - 1);
810 // If we get here, we are copying a ref to a ref.
811 else bc_vec_npush(rv, v->len * sizeof(uchar), v->v);
813 // We need to return early.
814 bc_vec_push(vec, &r.d);
815 bc_vec_pop(&p->results);
820 else if (ref_size && t != BC_TYPE_REF) v = bc_program_dereference(p, v);
823 bc_array_init(rv, true);
824 bc_array_copy(rv, v);
827 bc_vec_push(vec, &r.d);
828 bc_vec_pop(&p->results);
833 static void bc_program_assign(BcProgram *p, uchar inst) {
835 BcResult *left, *right, res;
837 bool ob, sc, use_val = BC_INST_USE_VAL(inst);
839 bc_program_assignPrep(p, &left, &l, &right, &r);
842 assert(left->t != BC_RESULT_STR);
844 if (right->t == BC_RESULT_STR || BC_PROG_STR(r)) {
846 size_t idx = right->t == BC_RESULT_STR ? right->d.loc.loc : r->scale;
848 if (left->t == BC_RESULT_ARRAY_ELEM) {
853 bc_vec_npop(&p->results, 2);
857 BcVec *v = bc_program_vec(p, left->d.loc.loc, BC_TYPE_VAR);
858 bc_program_assignStr(p, right, v, false);
865 if (BC_INST_IS_ASSIGN(inst)) bc_num_copy(l, r);
869 BcBigDig scale = BC_PROG_SCALE(p);
872 inst -= (BC_INST_ASSIGN_POWER_NO_VAL - BC_INST_ASSIGN_POWER);
874 bc_program_ops[inst - BC_INST_ASSIGN_POWER](l, r, l, scale);
878 ob = (left->t == BC_RESULT_OBASE);
879 sc = (left->t == BC_RESULT_SCALE);
881 if (ob || sc || left->t == BC_RESULT_IBASE) {
884 BcBigDig *ptr, *ptr_t, val, max, min;
887 bc_num_bigdig(l, &val);
888 e = left->t - BC_RESULT_IBASE + BC_ERROR_EXEC_IBASE;
892 max = vm.maxes[BC_PROG_GLOBALS_SCALE];
893 v = p->globals_v + BC_PROG_GLOBALS_SCALE;
894 ptr_t = p->globals + BC_PROG_GLOBALS_SCALE;
897 min = BC_NUM_MIN_BASE;
898 if (BC_ENABLE_EXTRA_MATH && ob && (BC_IS_DC || !BC_IS_POSIX))
900 max = vm.maxes[ob + BC_PROG_GLOBALS_IBASE];
901 v = p->globals_v + BC_PROG_GLOBALS_IBASE + ob;
902 ptr_t = p->globals + BC_PROG_GLOBALS_IBASE + ob;
905 if (BC_ERR(val > max || val < min)) bc_vm_verr(e, min, max);
911 #if BC_ENABLE_EXTRA_MATH && BC_ENABLE_RAND
912 else if (left->t == BC_RESULT_SEED) bc_num_rng(l, &p->rng);
913 #endif // BC_ENABLE_EXTRA_MATH && BC_ENABLE_RAND
918 bc_num_createCopy(&res.d.n, l);
919 res.t = BC_RESULT_TEMP;
920 bc_vec_npop(&p->results, 2);
921 bc_vec_push(&p->results, &res);
923 else bc_vec_npop(&p->results, 2);
928 static void bc_program_pushVar(BcProgram *p, const char *restrict code,
929 size_t *restrict bgn, bool pop, bool copy)
932 size_t idx = bc_program_index(code, bgn);
938 if (BC_IS_DC && (pop || copy)) {
940 BcVec *v = bc_program_vec(p, idx, BC_TYPE_VAR);
941 BcNum *num = bc_vec_top(v);
943 if (BC_ERR(!BC_PROG_STACK(v, 2 - copy))) bc_vm_err(BC_ERROR_EXEC_STACK);
945 assert(BC_PROG_STACK(v, 2 - copy));
947 if (!BC_PROG_STR(num)) {
951 r.t = BC_RESULT_TEMP;
952 bc_num_createCopy(&r.d.n, num);
954 if (!copy) bc_vec_pop(v);
956 bc_vec_push(&p->results, &r);
963 r.d.loc.loc = num->scale;
967 if (!copy) bc_vec_pop(v);
971 bc_vec_push(&p->results, &r);
974 static void bc_program_pushArray(BcProgram *p, const char *restrict code,
975 size_t *restrict bgn, uchar inst)
977 BcResult r, *operand;
981 r.d.loc.loc = bc_program_index(code, bgn);
984 if (inst == BC_INST_ARRAY) {
985 r.t = BC_RESULT_ARRAY;
986 bc_vec_push(&p->results, &r);
991 bc_program_prep(p, &operand, &num, 0);
992 bc_num_bigdig(num, &temp);
994 r.t = BC_RESULT_ARRAY_ELEM;
995 r.d.loc.idx = (size_t) temp;
999 bc_vec_pop(&p->results);
1000 bc_vec_push(&p->results, &r);
1006 static void bc_program_incdec(BcProgram *p, uchar inst) {
1008 BcResult *ptr, res, copy;
1012 bc_program_prep(p, &ptr, &num, 0);
1016 copy.t = BC_RESULT_TEMP;
1017 bc_num_createCopy(©.d.n, num);
1019 BC_SETJMP_LOCKED(exit);
1023 res.t = BC_RESULT_ONE;
1024 inst2 = BC_INST_ASSIGN_PLUS + (inst & 0x01);
1026 bc_vec_push(&p->results, &res);
1027 bc_program_assign(p, inst2);
1031 bc_vec_pop(&p->results);
1032 bc_vec_push(&p->results, ©);
1042 bc_num_free(©.d.n);
1046 static void bc_program_call(BcProgram *p, const char *restrict code,
1047 size_t *restrict idx)
1050 size_t i, nparams = bc_program_index(code, idx);
1058 ip.func = bc_program_index(code, idx);
1059 f = bc_vec_item(&p->fns, ip.func);
1061 if (BC_ERR(!f->code.len)) bc_vm_verr(BC_ERROR_EXEC_UNDEF_FUNC, f->name);
1062 if (BC_ERR(nparams != f->nparams))
1063 bc_vm_verr(BC_ERROR_EXEC_PARAMS, f->nparams, nparams);
1064 ip.len = p->results.len - nparams;
1066 assert(BC_PROG_STACK(&p->results, nparams));
1068 if (BC_G) bc_program_prepGlobals(p);
1070 for (i = 0; i < nparams; ++i) {
1075 arg = bc_vec_top(&p->results);
1076 if (BC_ERR(arg->t == BC_RESULT_VOID))
1077 bc_vm_err(BC_ERROR_EXEC_VOID_VAL);
1079 a = bc_vec_item(&f->autos, nparams - 1 - i);
1081 // If I have already pushed to a var, I need to make sure I
1082 // get the previous version, not the already pushed one.
1083 if (arg->t == BC_RESULT_VAR || arg->t == BC_RESULT_ARRAY) {
1084 for (j = 0; j < i && last; ++j) {
1085 BcLoc *loc = bc_vec_item(&f->autos, nparams - 1 - j);
1086 last = (arg->d.loc.loc != loc->loc ||
1087 (!loc->idx) != (arg->t == BC_RESULT_VAR));
1091 bc_program_copyToVar(p, a->loc, (BcType) a->idx, last);
1096 for (; i < f->autos.len; ++i) {
1098 a = bc_vec_item(&f->autos, i);
1099 v = bc_program_vec(p, a->loc, (BcType) a->idx);
1101 if (a->idx == BC_TYPE_VAR) {
1102 bc_num_init(¶m.n, BC_NUM_DEF_SIZE);
1103 bc_vec_push(v, ¶m.n);
1106 assert(a->idx == BC_TYPE_ARRAY);
1107 bc_array_init(¶m.v, true);
1108 bc_vec_push(v, ¶m.v);
1112 bc_vec_push(&p->stack, &ip);
1117 static void bc_program_return(BcProgram *p, uchar inst) {
1121 BcInstPtr *ip = bc_vec_top(&p->stack);
1122 size_t i, nops = p->results.len - ip->len;
1124 assert(BC_PROG_STACK(&p->stack, 2));
1125 assert(BC_PROG_STACK(&p->results, ip->len + (inst == BC_INST_RET)));
1127 f = bc_vec_item(&p->fns, ip->func);
1128 res = bc_program_prepResult(p);
1130 if (inst == BC_INST_RET) {
1135 bc_program_operand(p, &operand, &num, 1);
1139 bc_num_createCopy(&res->d.n, num);
1141 else if (inst == BC_INST_RET_VOID) res->t = BC_RESULT_VOID;
1144 bc_num_init(&res->d.n, BC_NUM_DEF_SIZE);
1149 // We need to pop arguments as well, so this takes that into account.
1150 for (i = 0; i < f->autos.len; ++i) {
1152 BcLoc *a = bc_vec_item(&f->autos, i);
1153 BcVec *v = bc_program_vec(p, a->loc, (BcType) a->idx);
1158 bc_program_retire(p, 1, nops);
1160 if (BC_G) bc_program_popGlobals(p, false);
1162 bc_vec_pop(&p->stack);
1164 #endif // BC_ENABLED
1166 static void bc_program_builtin(BcProgram *p, uchar inst) {
1168 BcResult *opd, *res;
1170 bool len = (inst == BC_INST_LENGTH);
1172 #if BC_ENABLE_EXTRA_MATH && BC_ENABLE_RAND
1173 assert(inst >= BC_INST_LENGTH && inst <= BC_INST_IRAND);
1174 #else // BC_ENABLE_EXTRA_MATH && BC_ENABLE_RAND
1175 assert(inst >= BC_INST_LENGTH && inst <= BC_INST_ABS);
1176 #endif // BC_ENABLE_EXTRA_MATH && BC_ENABLE_RAND
1178 #ifndef BC_PROG_NO_STACK_CHECK
1180 if (BC_ERR(!BC_PROG_STACK(&p->results, 1)))
1181 bc_vm_err(BC_ERROR_EXEC_STACK);
1183 #endif // BC_PROG_NO_STACK_CHECK
1185 assert(BC_PROG_STACK(&p->results, 1));
1187 res = bc_program_prepResult(p);
1189 bc_program_operand(p, &opd, &num, 1);
1191 assert(num != NULL);
1194 if (!len && inst != BC_INST_SCALE_FUNC) bc_program_type_num(opd, num);
1195 #endif // DC_ENABLED
1197 if (inst == BC_INST_SQRT) bc_num_sqrt(num, &res->d.n, BC_PROG_SCALE(p));
1198 else if (inst == BC_INST_ABS) {
1202 bc_num_createCopy(&res->d.n, num);
1206 res->d.n.neg = false;
1208 #if BC_ENABLE_EXTRA_MATH && BC_ENABLE_RAND
1209 else if (inst == BC_INST_IRAND) {
1213 bc_num_init(&res->d.n, num->len - num->rdx);
1217 bc_num_irand(num, &res->d.n, &p->rng);
1219 #endif // BC_ENABLE_EXTRA_MATH && BC_ENABLE_RAND
1226 if (BC_IS_BC && opd->t == BC_RESULT_ARRAY) {
1228 BcVec *v = (BcVec*) num;
1230 if (v->size == sizeof(uchar)) v = bc_program_dereference(p, v);
1232 assert(v->size == sizeof(BcNum));
1234 val = (BcBigDig) v->len;
1237 #endif // BC_ENABLED
1240 if (!BC_PROG_NUM(opd, num)) {
1243 idx = opd->t == BC_RESULT_STR ? opd->d.loc.loc : num->scale;
1244 str = *((char**) bc_vec_item(p->strs, idx));
1245 val = (BcBigDig) strlen(str);
1248 #endif // DC_ENABLED
1250 val = (BcBigDig) bc_num_len(num);
1254 else if (BC_IS_BC || BC_PROG_NUM(opd, num))
1255 val = (BcBigDig) bc_num_scale(num);
1259 bc_num_createFromBigdig(&res->d.n, val);
1264 bc_program_retire(p, 1, 1);
1268 static void bc_program_divmod(BcProgram *p) {
1270 BcResult *opd1, *opd2, *res, *res2;
1274 res2 = bc_program_prepResult(p);
1275 res = bc_program_prepResult(p);
1277 // Update the pointer, just in case.
1278 res2 = bc_vec_item_rev(&p->results, 1);
1280 bc_program_binOpPrep(p, &opd1, &n1, &opd2, &n2, 2);
1282 req = bc_num_mulReq(n1, n2, BC_PROG_SCALE(p));
1286 bc_num_init(&res->d.n, req);
1287 bc_num_init(&res2->d.n, req);
1291 bc_num_divmod(n1, n2, &res2->d.n, &res->d.n, BC_PROG_SCALE(p));
1293 bc_program_retire(p, 2, 2);
1296 static void bc_program_modexp(BcProgram *p) {
1298 BcResult *r1, *r2, *r3, *res;
1299 BcNum *n1, *n2, *n3;
1301 if (BC_ERR(!BC_PROG_STACK(&p->results, 3))) bc_vm_err(BC_ERROR_EXEC_STACK);
1303 assert(BC_PROG_STACK(&p->results, 3));
1305 res = bc_program_prepResult(p);
1307 bc_program_operand(p, &r1, &n1, 3);
1308 bc_program_type_num(r1, n1);
1310 bc_program_binOpPrep(p, &r2, &n2, &r3, &n3, 1);
1312 // Make sure that the values have their pointers updated, if necessary.
1313 // Only array elements are possible.
1314 if (r1->t == BC_RESULT_ARRAY_ELEM && (r1->t == r2->t || r1->t == r3->t))
1315 n1 = bc_program_num(p, r1);
1319 bc_num_init(&res->d.n, n3->len);
1323 bc_num_modexp(n1, n2, n3, &res->d.n);
1325 bc_program_retire(p, 1, 3);
1328 static void bc_program_stackLen(BcProgram *p) {
1329 bc_program_pushBigdig(p, (BcBigDig) p->results.len, BC_RESULT_TEMP);
1332 static uchar bc_program_asciifyNum(BcProgram *p, BcNum *n) {
1343 bc_num_createCopy(&num, n);
1347 bc_num_truncate(&num, num.scale);
1350 // This is guaranteed to not have a divide by 0
1351 // because strmb is equal to UCHAR_MAX + 1.
1352 bc_num_mod(&num, &p->strmb, &num, 0);
1354 // This is also guaranteed to not error because num is in the range
1355 // [0, UCHAR_MAX], which is definitely in range for a BcBigDig. And
1356 // it is not negative.
1357 bc_num_bigdig2(&num, &val);
1366 static void bc_program_asciify(BcProgram *p) {
1374 if (BC_ERR(!BC_PROG_STACK(&p->results, 1))) bc_vm_err(BC_ERROR_EXEC_STACK);
1376 assert(BC_PROG_STACK(&p->results, 1));
1378 bc_program_operand(p, &r, &n, 0);
1382 assert(p->strs->len + BC_PROG_REQ_FUNCS == p->fns.len);
1384 if (BC_PROG_NUM(r, n)) c = bc_program_asciifyNum(p, n);
1386 size_t index = r->t == BC_RESULT_STR ? r->d.loc.loc : n->scale;
1387 str2 = *((char**) bc_vec_item(p->strs, index));
1388 c = (uchar) str2[0];
1396 idx = bc_program_insertFunc(p, str) - BC_PROG_REQ_FUNCS;
1400 res.t = BC_RESULT_STR;
1401 res.d.loc.loc = idx;
1402 bc_vec_pop(&p->results);
1403 bc_vec_push(&p->results, &res);
1406 static void bc_program_printStream(BcProgram *p) {
1411 if (BC_ERR(!BC_PROG_STACK(&p->results, 1))) bc_vm_err(BC_ERROR_EXEC_STACK);
1413 assert(BC_PROG_STACK(&p->results, 1));
1415 bc_program_operand(p, &r, &n, 0);
1419 if (BC_PROG_NUM(r, n)) bc_num_stream(n, p->strm);
1421 size_t idx = (r->t == BC_RESULT_STR) ? r->d.loc.loc : n->scale;
1422 bc_program_printChars(*((char**) bc_vec_item(p->strs, idx)));
1426 static void bc_program_nquit(BcProgram *p, uchar inst) {
1433 assert(p->stack.len == p->tail_calls.len);
1435 if (inst == BC_INST_QUIT) val = 2;
1438 bc_program_prep(p, &opnd, &num, 0);
1439 bc_num_bigdig(num, &val);
1441 bc_vec_pop(&p->results);
1444 for (i = 0; val && i < p->tail_calls.len; ++i) {
1445 size_t calls = *((size_t*) bc_vec_item_rev(&p->tail_calls, i)) + 1;
1446 if (calls >= val) val = 0;
1450 if (i == p->stack.len) {
1451 vm.status = BC_STATUS_QUIT;
1455 bc_vec_npop(&p->stack, i);
1456 bc_vec_npop(&p->tail_calls, i);
1460 static void bc_program_execStr(BcProgram *p, const char *restrict code,
1461 size_t *restrict bgn, bool cond, size_t len)
1471 assert(p->stack.len == p->tail_calls.len);
1473 if (BC_ERR(!BC_PROG_STACK(&p->results, 1))) bc_vm_err(BC_ERROR_EXEC_STACK);
1475 assert(BC_PROG_STACK(&p->results, 1));
1477 bc_program_operand(p, &r, &n, 0);
1482 size_t idx, then_idx, else_idx;
1484 then_idx = bc_program_index(code, bgn);
1485 else_idx = bc_program_index(code, bgn);
1487 exec = (r->d.n.len != 0);
1489 idx = exec ? then_idx : else_idx;
1492 BC_SETJMP_LOCKED(exit);
1494 if (exec || (else_idx != SIZE_MAX))
1495 n = bc_vec_top(bc_program_vec(p, idx, BC_TYPE_VAR));
1498 if (BC_ERR(!BC_PROG_STR(n))) bc_vm_err(BC_ERROR_EXEC_TYPE);
1507 // In non-conditional situations, only the top of stack can be executed,
1508 // and in those cases, variables are not allowed to be "on the stack";
1509 // they are only put on the stack to be assigned to.
1510 assert(r->t != BC_RESULT_VAR);
1512 if (r->t == BC_RESULT_STR) sidx = r->d.loc.loc;
1516 fidx = sidx + BC_PROG_REQ_FUNCS;
1517 str = *((char**) bc_vec_item(p->strs, sidx));
1518 f = bc_vec_item(&p->fns, fidx);
1524 bc_parse_init(&prs, p, fidx);
1525 bc_lex_file(&prs.l, vm.file);
1527 BC_SETJMP_LOCKED(err);
1531 bc_parse_text(&prs, str);
1532 vm.expr(&prs, BC_PARSE_NOCALL);
1538 // We can just assert this here because
1539 // dc should parse everything until EOF.
1540 assert(prs.l.t == BC_LEX_EOF);
1542 bc_parse_free(&prs);
1548 ip.len = p->results.len;
1551 bc_vec_pop(&p->results);
1554 if (p->stack.len > 1 && *bgn == len - 1 && code[*bgn] == BC_INST_POP_EXEC) {
1555 size_t *call_ptr = bc_vec_top(&p->tail_calls);
1557 bc_vec_pop(&p->stack);
1559 else bc_vec_push(&p->tail_calls, &ip.idx);
1561 bc_vec_push(&p->stack, &ip);
1567 bc_parse_free(&prs);
1568 f = bc_vec_item(&p->fns, fidx);
1569 bc_vec_npop(&f->code, f->code.len);
1571 bc_vec_pop(&p->results);
1575 static void bc_program_printStack(BcProgram *p) {
1579 for (idx = 0; idx < p->results.len; ++idx)
1580 bc_program_print(p, BC_INST_PRINT, idx);
1582 #endif // DC_ENABLED
1584 static void bc_program_pushGlobal(BcProgram *p, uchar inst) {
1588 assert(inst >= BC_INST_IBASE && inst <= BC_INST_SCALE);
1590 t = inst - BC_INST_IBASE + BC_RESULT_IBASE;
1591 bc_program_pushBigdig(p, p->globals[inst - BC_INST_IBASE], t);
1594 #if BC_ENABLE_EXTRA_MATH && BC_ENABLE_RAND
1595 static void bc_program_pushSeed(BcProgram *p) {
1599 res = bc_program_prepResult(p);
1600 res->t = BC_RESULT_SEED;
1604 bc_num_init(&res->d.n, 2 * BC_RAND_NUM_SIZE);
1608 bc_num_createFromRNG(&res->d.n, &p->rng);
1610 #endif // BC_ENABLE_EXTRA_MATH && BC_ENABLE_RAND
1612 static void bc_program_addFunc(BcProgram *p, BcFunc *f, BcId *id_ptr) {
1616 BC_SIG_ASSERT_LOCKED;
1618 bc_func_init(f, id_ptr->name);
1619 bc_vec_push(&p->fns, f);
1621 // This is to make sure pointers are updated if the array was moved.
1623 ip = bc_vec_top(&p->stack);
1624 bc_program_setVecs(p, (BcFunc*) bc_vec_item(&p->fns, ip->func));
1628 size_t bc_program_insertFunc(BcProgram *p, const char *name) {
1635 BC_SIG_ASSERT_LOCKED;
1637 assert(p != NULL && name != NULL);
1639 new = bc_map_insert(&p->fn_map, name, p->fns.len, &idx);
1640 id_ptr = (BcId*) bc_vec_item(&p->fn_map, idx);
1645 BcFunc *func = bc_vec_item(&p->fns, idx);
1646 bc_func_reset(func);
1651 bc_program_addFunc(p, &f, id_ptr);
1654 if (BC_IS_DC && idx >= BC_PROG_REQ_FUNCS) {
1655 bc_vec_push(p->strs, &id_ptr->name);
1656 assert(p->strs->len == p->fns.len - BC_PROG_REQ_FUNCS);
1658 #endif // DC_ENABLED
1665 void bc_program_free(BcProgram *p) {
1669 BC_SIG_ASSERT_LOCKED;
1673 for (i = 0; i < BC_PROG_GLOBALS_LEN; ++i) bc_vec_free(p->globals_v + i);
1675 bc_vec_free(&p->fns);
1676 bc_vec_free(&p->fn_map);
1677 bc_vec_free(&p->vars);
1678 bc_vec_free(&p->var_map);
1679 bc_vec_free(&p->arrs);
1680 bc_vec_free(&p->arr_map);
1681 bc_vec_free(&p->results);
1682 bc_vec_free(&p->stack);
1685 if (BC_IS_BC) bc_num_free(&p->last);
1686 #endif // BC_ENABLED
1688 #if BC_ENABLE_EXTRA_MATH && BC_ENABLE_RAND
1689 bc_rand_free(&p->rng);
1690 #endif // BC_ENABLE_EXTRA_MATH && BC_ENABLE_RAND
1694 bc_vec_free(&p->tail_calls);
1695 bc_vec_free(&p->strs_v);
1697 #endif // DC_ENABLED
1701 void bc_program_init(BcProgram *p) {
1705 BcBigDig val = BC_BASE;
1707 BC_SIG_ASSERT_LOCKED;
1711 memset(p, 0, sizeof(BcProgram));
1712 memset(&ip, 0, sizeof(BcInstPtr));
1714 for (i = 0; i < BC_PROG_GLOBALS_LEN; ++i) {
1715 bc_vec_init(p->globals_v + i, sizeof(BcBigDig), NULL);
1716 val = i == BC_PROG_GLOBALS_SCALE ? 0 : val;
1717 bc_vec_push(p->globals_v + i, &val);
1718 p->globals[i] = val;
1724 bc_vec_init(&p->strs_v, sizeof(char*), bc_string_free);
1725 p->strs = &p->strs_v;
1727 bc_vec_init(&p->tail_calls, sizeof(size_t), NULL);
1729 bc_vec_push(&p->tail_calls, &i);
1731 p->strm = UCHAR_MAX + 1;
1732 bc_num_setup(&p->strmb, p->strmb_num, BC_NUM_BIGDIG_LOG10);
1733 bc_num_bigdig2num(&p->strmb, p->strm);
1735 #endif // DC_ENABLED
1737 #if BC_ENABLE_EXTRA_MATH && BC_ENABLE_RAND
1738 srand((unsigned int) time(NULL));
1739 bc_rand_init(&p->rng);
1740 #endif // BC_ENABLE_EXTRA_MATH && BC_ENABLE_RAND
1742 bc_num_setup(&p->zero, p->zero_num, BC_PROG_ONE_CAP);
1744 bc_num_setup(&p->one, p->one_num, BC_PROG_ONE_CAP);
1745 bc_num_one(&p->one);
1748 if (BC_IS_BC) bc_num_init(&p->last, BC_NUM_DEF_SIZE);
1749 #endif // BC_ENABLED
1751 bc_vec_init(&p->fns, sizeof(BcFunc), bc_func_free);
1752 bc_map_init(&p->fn_map);
1753 bc_program_insertFunc(p, bc_func_main);
1754 bc_program_insertFunc(p, bc_func_read);
1756 bc_vec_init(&p->vars, sizeof(BcVec), bc_vec_free);
1757 bc_map_init(&p->var_map);
1759 bc_vec_init(&p->arrs, sizeof(BcVec), bc_vec_free);
1760 bc_map_init(&p->arr_map);
1762 bc_vec_init(&p->results, sizeof(BcResult), bc_result_free);
1763 bc_vec_init(&p->stack, sizeof(BcInstPtr), NULL);
1764 bc_vec_push(&p->stack, &ip);
1766 bc_program_setVecs(p, (BcFunc*) bc_vec_item(&p->fns, BC_PROG_MAIN));
1768 assert(p->consts != NULL && p->strs != NULL);
1771 void bc_program_reset(BcProgram *p) {
1776 BC_SIG_ASSERT_LOCKED;
1778 bc_vec_npop(&p->stack, p->stack.len - 1);
1779 bc_vec_npop(&p->results, p->results.len);
1782 if (BC_G) bc_program_popGlobals(p, true);
1783 #endif // BC_ENABLED
1785 f = bc_vec_item(&p->fns, BC_PROG_MAIN);
1786 ip = bc_vec_top(&p->stack);
1787 bc_program_setVecs(p, f);
1788 ip->idx = f->code.len;
1791 bc_file_write(&vm.fout, bc_program_ready_msg, bc_program_ready_msg_len);
1792 bc_file_flush(&vm.fout);
1797 void bc_program_exec(BcProgram *p) {
1801 BcInstPtr *ip = bc_vec_top(&p->stack);
1802 BcFunc *func = (BcFunc*) bc_vec_item(&p->fns, ip->func);
1803 char *code = func->code.v;
1807 #endif // BC_ENABLED
1809 size_t jmp_bufs_len;
1813 jmp_bufs_len = vm.jmp_bufs.len;
1816 bc_program_setVecs(p, func);
1818 while (ip->idx < func->code.len) {
1820 BC_SIG_ASSERT_NOT_LOCKED;
1822 uchar inst = (uchar) code[(ip->idx)++];
1827 case BC_INST_JUMP_ZERO:
1829 bc_program_prep(p, &ptr, &num, 0);
1830 cond = !bc_num_cmpZero(num);
1831 bc_vec_pop(&p->results);
1836 idx = bc_program_index(code, &ip->idx);
1838 if (inst == BC_INST_JUMP || cond) {
1840 size_t *addr = bc_vec_item(&func->labels, idx);
1842 assert(*addr != SIZE_MAX);
1854 bc_program_call(p, code, &ip->idx);
1856 ip = bc_vec_top(&p->stack);
1857 func = bc_vec_item(&p->fns, ip->func);
1858 code = func->code.v;
1860 bc_program_setVecs(p, func);
1868 bc_program_incdec(p, inst);
1874 vm.status = BC_STATUS_QUIT;
1881 case BC_INST_RET_VOID:
1883 bc_program_return(p, inst);
1885 ip = bc_vec_top(&p->stack);
1886 func = bc_vec_item(&p->fns, ip->func);
1887 code = func->code.v;
1889 bc_program_setVecs(p, func);
1893 #endif // BC_ENABLED
1895 case BC_INST_BOOL_OR:
1896 case BC_INST_BOOL_AND:
1897 case BC_INST_REL_EQ:
1898 case BC_INST_REL_LE:
1899 case BC_INST_REL_GE:
1900 case BC_INST_REL_NE:
1901 case BC_INST_REL_LT:
1902 case BC_INST_REL_GT:
1904 bc_program_logical(p, inst);
1912 ip = bc_vec_top(&p->stack);
1913 func = bc_vec_item(&p->fns, ip->func);
1914 code = func->code.v;
1916 bc_program_setVecs(p, func);
1921 #if BC_ENABLE_EXTRA_MATH && BC_ENABLE_RAND
1927 #endif // BC_ENABLE_EXTRA_MATH && BC_ENABLE_RAND
1929 case BC_INST_MAXIBASE:
1930 case BC_INST_MAXOBASE:
1931 case BC_INST_MAXSCALE:
1932 #if BC_ENABLE_EXTRA_MATH && BC_ENABLE_RAND
1933 case BC_INST_MAXRAND:
1934 #endif // BC_ENABLE_EXTRA_MATH && BC_ENABLE_RAND
1936 BcBigDig dig = vm.maxes[inst - BC_INST_MAXIBASE];
1937 bc_program_pushBigdig(p, dig, BC_RESULT_TEMP);
1943 bc_program_pushVar(p, code, &ip->idx, false, false);
1947 case BC_INST_ARRAY_ELEM:
1950 #endif // BC_ENABLED
1952 bc_program_pushArray(p, code, &ip->idx, inst);
1960 bc_program_pushGlobal(p, inst);
1964 #if BC_ENABLE_EXTRA_MATH && BC_ENABLE_RAND
1967 bc_program_pushSeed(p);
1970 #endif // BC_ENABLE_EXTRA_MATH && BC_ENABLE_RAND
1972 case BC_INST_LENGTH:
1973 case BC_INST_SCALE_FUNC:
1976 #if BC_ENABLE_EXTRA_MATH && BC_ENABLE_RAND
1978 #endif // BC_ENABLE_EXTRA_MATH && BC_ENABLE_RAND
1980 bc_program_builtin(p, inst);
1986 bc_program_const(p, code, &ip->idx);
1994 #endif // BC_ENABLED
1996 r.t = BC_RESULT_ZERO + (inst - BC_INST_ZERO);
1997 bc_vec_push(&p->results, &r);
2002 case BC_INST_PRINT_POP:
2003 case BC_INST_PRINT_STR:
2005 bc_program_print(p, inst, 0);
2011 r.t = BC_RESULT_STR;
2012 r.d.loc.loc = bc_program_index(code, &ip->idx);
2013 bc_vec_push(&p->results, &r);
2018 case BC_INST_MULTIPLY:
2019 case BC_INST_DIVIDE:
2020 case BC_INST_MODULUS:
2023 #if BC_ENABLE_EXTRA_MATH
2024 case BC_INST_PLACES:
2025 case BC_INST_LSHIFT:
2026 case BC_INST_RSHIFT:
2027 #endif // BC_ENABLE_EXTRA_MATH
2029 bc_program_op(p, inst);
2034 case BC_INST_BOOL_NOT:
2035 #if BC_ENABLE_EXTRA_MATH
2037 #endif // BC_ENABLE_EXTRA_MATH
2039 bc_program_unary(p, inst);
2044 case BC_INST_ASSIGN_POWER:
2045 case BC_INST_ASSIGN_MULTIPLY:
2046 case BC_INST_ASSIGN_DIVIDE:
2047 case BC_INST_ASSIGN_MODULUS:
2048 case BC_INST_ASSIGN_PLUS:
2049 case BC_INST_ASSIGN_MINUS:
2050 #if BC_ENABLE_EXTRA_MATH
2051 case BC_INST_ASSIGN_PLACES:
2052 case BC_INST_ASSIGN_LSHIFT:
2053 case BC_INST_ASSIGN_RSHIFT:
2054 #endif // BC_ENABLE_EXTRA_MATH
2055 case BC_INST_ASSIGN:
2056 case BC_INST_ASSIGN_POWER_NO_VAL:
2057 case BC_INST_ASSIGN_MULTIPLY_NO_VAL:
2058 case BC_INST_ASSIGN_DIVIDE_NO_VAL:
2059 case BC_INST_ASSIGN_MODULUS_NO_VAL:
2060 case BC_INST_ASSIGN_PLUS_NO_VAL:
2061 case BC_INST_ASSIGN_MINUS_NO_VAL:
2062 #if BC_ENABLE_EXTRA_MATH
2063 case BC_INST_ASSIGN_PLACES_NO_VAL:
2064 case BC_INST_ASSIGN_LSHIFT_NO_VAL:
2065 case BC_INST_ASSIGN_RSHIFT_NO_VAL:
2066 #endif // BC_ENABLE_EXTRA_MATH
2067 #endif // BC_ENABLED
2068 case BC_INST_ASSIGN_NO_VAL:
2070 bc_program_assign(p, inst);
2076 #ifndef BC_PROG_NO_STACK_CHECK
2078 if (BC_ERR(!BC_PROG_STACK(&p->results, 1)))
2079 bc_vm_err(BC_ERROR_EXEC_STACK);
2081 #endif // BC_PROG_NO_STACK_CHECK
2083 assert(BC_PROG_STACK(&p->results, 1));
2085 bc_vec_pop(&p->results);
2090 case BC_INST_POP_EXEC:
2092 assert(BC_PROG_STACK(&p->stack, 2));
2093 bc_vec_pop(&p->stack);
2094 bc_vec_pop(&p->tail_calls);
2095 ip = bc_vec_top(&p->stack);
2096 func = bc_vec_item(&p->fns, ip->func);
2097 code = func->code.v;
2098 bc_program_setVecs(p, func);
2102 case BC_INST_MODEXP:
2104 bc_program_modexp(p);
2108 case BC_INST_DIVMOD:
2110 bc_program_divmod(p);
2114 case BC_INST_EXECUTE:
2115 case BC_INST_EXEC_COND:
2117 cond = (inst == BC_INST_EXEC_COND);
2118 bc_program_execStr(p, code, &ip->idx, cond, func->code.len);
2119 ip = bc_vec_top(&p->stack);
2120 func = bc_vec_item(&p->fns, ip->func);
2121 code = func->code.v;
2122 bc_program_setVecs(p, func);
2126 case BC_INST_PRINT_STACK:
2128 bc_program_printStack(p);
2132 case BC_INST_CLEAR_STACK:
2134 bc_vec_npop(&p->results, p->results.len);
2138 case BC_INST_STACK_LEN:
2140 bc_program_stackLen(p);
2144 case BC_INST_DUPLICATE:
2146 if (BC_ERR(!BC_PROG_STACK(&p->results, 1)))
2147 bc_vm_err(BC_ERROR_EXEC_STACK);
2149 assert(BC_PROG_STACK(&p->results, 1));
2151 ptr = bc_vec_top(&p->results);
2155 bc_result_copy(&r, ptr);
2156 bc_vec_push(&p->results, &r);
2167 if (BC_ERR(!BC_PROG_STACK(&p->results, 2)))
2168 bc_vm_err(BC_ERROR_EXEC_STACK);
2170 assert(BC_PROG_STACK(&p->results, 2));
2172 ptr = bc_vec_item_rev(&p->results, 0);
2173 ptr2 = bc_vec_item_rev(&p->results, 1);
2174 memcpy(&r, ptr, sizeof(BcResult));
2175 memcpy(ptr, ptr2, sizeof(BcResult));
2176 memcpy(ptr2, &r, sizeof(BcResult));
2181 case BC_INST_ASCIIFY:
2183 bc_program_asciify(p);
2184 ip = bc_vec_top(&p->stack);
2185 func = bc_vec_item(&p->fns, ip->func);
2186 code = func->code.v;
2187 bc_program_setVecs(p, func);
2191 case BC_INST_PRINT_STREAM:
2193 bc_program_printStream(p);
2198 case BC_INST_PUSH_VAR:
2200 bool copy = (inst == BC_INST_LOAD);
2201 bc_program_pushVar(p, code, &ip->idx, true, copy);
2205 case BC_INST_PUSH_TO_VAR:
2207 idx = bc_program_index(code, &ip->idx);
2208 bc_program_copyToVar(p, idx, BC_TYPE_VAR, true);
2215 bc_program_nquit(p, inst);
2216 ip = bc_vec_top(&p->stack);
2217 func = bc_vec_item(&p->fns, ip->func);
2218 code = func->code.v;
2219 bc_program_setVecs(p, func);
2222 #endif // DC_ENABLED
2232 // This is to allow me to use a debugger to see the last instruction,
2233 // which will point to which function was the problem.
2234 assert(jmp_bufs_len == vm.jmp_bufs.len);
2240 #if BC_ENABLED && DC_ENABLED
2241 void bc_program_printStackDebug(BcProgram *p) {
2242 bc_file_puts(&vm.fout, "-------------- Stack ----------\n");
2243 bc_program_printStack(p);
2244 bc_file_puts(&vm.fout, "-------------- Stack End ------\n");
2247 static void bc_program_printIndex(const char *restrict code,
2248 size_t *restrict bgn)
2250 uchar byte, i, bytes = (uchar) code[(*bgn)++];
2253 for (byte = 1, i = 0; byte && i < bytes; ++i) {
2254 byte = (uchar) code[(*bgn)++];
2255 if (byte) val |= ((ulong) byte) << (CHAR_BIT * i);
2258 bc_vm_printf(" (%lu) ", val);
2261 static void bc_program_printStr(const BcProgram *p, const char *restrict code,
2262 size_t *restrict bgn)
2264 size_t idx = bc_program_index(code, bgn);
2267 s = *((char**) bc_vec_item(p->strs, idx));
2269 bc_vm_printf(" (\"%s\") ", s);
2272 void bc_program_printInst(const BcProgram *p, const char *restrict code,
2273 size_t *restrict bgn)
2275 uchar inst = (uchar) code[(*bgn)++];
2277 bc_vm_printf("Inst[%zu]: %s [%lu]; ", *bgn - 1,
2278 bc_inst_names[inst], (unsigned long) inst);
2280 if (inst == BC_INST_VAR || inst == BC_INST_ARRAY_ELEM ||
2281 inst == BC_INST_ARRAY)
2283 bc_program_printIndex(code, bgn);
2285 else if (inst == BC_INST_STR) bc_program_printStr(p, code, bgn);
2286 else if (inst == BC_INST_NUM) {
2287 size_t idx = bc_program_index(code, bgn);
2288 BcConst *c = bc_vec_item(p->consts, idx);
2289 bc_vm_printf("(%s)", c->val);
2291 else if (inst == BC_INST_CALL ||
2292 (inst > BC_INST_STR && inst <= BC_INST_JUMP_ZERO))
2294 bc_program_printIndex(code, bgn);
2295 if (inst == BC_INST_CALL) bc_program_printIndex(code, bgn);
2298 bc_vm_putchar('\n');
2301 void bc_program_code(const BcProgram* p) {
2308 for (i = 0; i < p->fns.len; ++i) {
2310 ip.idx = ip.len = 0;
2313 f = bc_vec_item(&p->fns, ip.func);
2316 bc_vm_printf("func[%zu]:\n", ip.func);
2317 while (ip.idx < f->code.len) bc_program_printInst(p, code, &ip.idx);
2318 bc_file_puts(&vm.fout, "\n\n");
2321 #endif // BC_ENABLED && DC_ENABLED
2322 #endif // BC_DEBUG_CODE