1 /* vi: set sw=4 ts=4: */
3 * Licensed under GPLv2 or later, see file LICENSE in this source tree.
4 * Copyright (c) 2018 Gavin D. Howard and contributors.
7 //config: bool "bc (45 kb; 49 kb when combined with dc)"
10 //config: bc is a command-line, arbitrary-precision calculator with a
11 //config: Turing-complete language. See the GNU bc manual
12 //config: (https://www.gnu.org/software/bc/manual/bc.html) and bc spec
13 //config: (http://pubs.opengroup.org/onlinepubs/9699919799/utilities/bc.html).
15 //config: This bc has five differences to the GNU bc:
16 //config: 1) The period (.) is a shortcut for "last", as in the BSD bc.
17 //config: 2) Arrays are copied before being passed as arguments to
18 //config: functions. This behavior is required by the bc spec.
19 //config: 3) Arrays can be passed to the builtin "length" function to get
20 //config: the number of elements in the array. This prints "1":
21 //config: a[0] = 0; length(a[])
22 //config: 4) The precedence of the boolean "not" operator (!) is equal to
23 //config: that of the unary minus (-) negation operator. This still
24 //config: allows POSIX-compliant scripts to work while somewhat
25 //config: preserving expected behavior (versus C) and making parsing
27 //config: 5) "read()" accepts expressions, not only numeric literals.
30 //config: -i --interactive force interactive mode
31 //config: -q --quiet don't print version and copyright
32 //config: -s --standard error if any non-POSIX extensions are used
33 //config: -w --warn warn if any non-POSIX extensions are used
34 //config: -l --mathlib use predefined math routines:
35 //config: s(expr) sine in radians
36 //config: c(expr) cosine in radians
37 //config: a(expr) arctangent, returning radians
38 //config: l(expr) natural log
39 //config: e(expr) raises e to the power of expr
40 //config: j(n, x) Bessel function of integer order n of x
43 //config: bool "dc (38 kb; 49 kb when combined with bc)"
46 //config: dc is a reverse-polish notation command-line calculator which
47 //config: supports unlimited precision arithmetic. See the FreeBSD man page
48 //config: (https://www.unix.com/man-page/FreeBSD/1/dc/) and GNU dc manual
49 //config: (https://www.gnu.org/software/bc/manual/dc-1.05/html_mono/dc.html).
51 //config: This dc has a few differences from the two above:
52 //config: 1) When printing a byte stream (command "P"), this dc follows what
53 //config: the FreeBSD dc does.
54 //config: 2) Implements the GNU extensions for divmod ("~") and
55 //config: modular exponentiation ("|").
56 //config: 3) Implements all FreeBSD extensions, except for "J" and "M".
57 //config: 4) Like the FreeBSD dc, this dc supports extended registers.
58 //config: However, they are implemented differently. When it encounters
59 //config: whitespace where a register should be, it skips the whitespace.
60 //config: If the character following is not a lowercase letter, an error
61 //config: is issued. Otherwise, the register name is parsed by the
62 //config: following regex:
63 //config: [a-z][a-z0-9_]*
64 //config: This generally means that register names will be surrounded by
65 //config: whitespace. Examples:
66 //config: l idx s temp L index S temp2 < do_thing
67 //config: Also note that, like the FreeBSD dc, extended registers are not
68 //config: allowed unless the "-x" option is given.
70 //config:config FEATURE_DC_SMALL
71 //config: bool "Minimal dc implementation (4.2 kb), not using bc code base"
72 //config: depends on DC && !BC
75 //config:config FEATURE_DC_LIBM
76 //config: bool "Enable power and exp functions (requires libm)"
78 //config: depends on FEATURE_DC_SMALL
80 //config: Enable power and exp functions.
81 //config: NOTE: This will require libm to be present for linking.
83 //config:config FEATURE_BC_SIGNALS
84 //config: bool "Interactive mode (+4kb)"
86 //config: depends on (BC || DC) && !FEATURE_DC_SMALL
88 //config: Enable interactive mode: when started on a tty,
89 //config: ^C interrupts execution and returns to command line,
90 //config: errors also return to command line instead of exiting,
91 //config: line editing with history is available.
93 //config: With this option off, input can still be taken from tty,
94 //config: but all errors are fatal, ^C is fatal,
95 //config: tty is treated exactly the same as any other
96 //config: standard input (IOW: no line editing).
98 //config:config FEATURE_BC_LONG_OPTIONS
99 //config: bool "Enable bc/dc long options"
101 //config: depends on (BC || DC) && !FEATURE_DC_SMALL
103 //config: Enable long options for bc and dc.
105 //applet:IF_BC(APPLET(bc, BB_DIR_USR_BIN, BB_SUID_DROP))
106 //applet:IF_DC(APPLET(dc, BB_DIR_USR_BIN, BB_SUID_DROP))
108 //kbuild:lib-$(CONFIG_BC) += bc.o
109 //kbuild:lib-$(CONFIG_DC) += bc.o
111 //See www.gnu.org/software/bc/manual/bc.html
112 //usage:#define bc_trivial_usage
113 //usage: "[-sqlw] FILE..."
115 //usage:#define bc_full_usage "\n"
116 //usage: "\nArbitrary precision calculator"
118 ///////: "\n -i Interactive" - has no effect for now
119 //usage: "\n -q Quiet"
120 //usage: "\n -l Load standard math library"
121 //usage: "\n -s Be POSIX compatible"
122 //usage: "\n -w Warn if extensions are used"
123 ///////: "\n -v Version"
125 //usage: "\n$BC_LINE_LENGTH changes output width"
127 //usage:#define bc_example_usage
128 //usage: "3 + 4.129\n"
129 //usage: "1903 - 2893\n"
130 //usage: "-129 * 213.28935\n"
131 //usage: "12 / -1932\n"
133 //usage: "34 ^ 189\n"
134 //usage: "scale = 13\n"
135 //usage: "ibase = 2\n"
136 //usage: "obase = A\n"
138 //usage:#define dc_trivial_usage
139 //usage: IF_NOT_FEATURE_DC_SMALL("[-x] ")"[-eSCRIPT]... [-fFILE]... [FILE]..."
141 //usage:#define dc_full_usage "\n"
142 //usage: "\nTiny RPN calculator. Operations:"
143 //usage: "\n+, -, *, /, %, ~, ^," IF_NOT_FEATURE_DC_SMALL(" |,")
144 //usage: "\np - print top of the stack (without popping)"
145 //usage: "\nf - print entire stack"
146 //usage: "\nk - pop the value and set the precision"
147 //usage: "\ni - pop the value and set input radix"
148 //usage: "\no - pop the value and set output radix"
149 //usage: "\nExamples: dc -e'2 2 + p' -> 4, dc -e'8 8 * 2 2 + / p' -> 16"
151 //usage:#define dc_example_usage
152 //usage: "$ dc -e'2 2 + p'\n"
154 //usage: "$ dc -e'8 8 \\* 2 2 + / p'\n"
156 //usage: "$ dc -e'0 1 & p'\n"
158 //usage: "$ dc -e'0 1 | p'\n"
160 //usage: "$ echo '72 9 / 8 * p' | dc\n"
164 #include "common_bufsiz.h"
166 #if ENABLE_FEATURE_DC_SMALL
170 #define DEBUG_LEXER 0
171 #define DEBUG_COMPILE 0
173 // This can be left enabled for production as well:
174 #define SANITY_CHECKS 1
177 static uint8_t lex_indent;
178 #define dbg_lex(...) \
180 fprintf(stderr, "%*s", lex_indent, ""); \
181 bb_error_msg(__VA_ARGS__); \
183 #define dbg_lex_enter(...) \
185 dbg_lex(__VA_ARGS__); \
188 #define dbg_lex_done(...) \
191 dbg_lex(__VA_ARGS__); \
194 # define dbg_lex(...) ((void)0)
195 # define dbg_lex_enter(...) ((void)0)
196 # define dbg_lex_done(...) ((void)0)
200 # define dbg_compile(...) bb_error_msg(__VA_ARGS__)
202 # define dbg_compile(...) ((void)0)
206 # define dbg_exec(...) bb_error_msg(__VA_ARGS__)
208 # define dbg_exec(...) ((void)0)
211 typedef enum BcStatus {
212 BC_STATUS_SUCCESS = 0,
213 BC_STATUS_FAILURE = 1,
214 BC_STATUS_PARSE_EMPTY_EXP = 2, // bc_parse_expr_empty_ok() uses this
217 #define BC_VEC_INVALID_IDX ((size_t) -1)
218 #define BC_VEC_START_CAP (1 << 5)
220 typedef void (*BcVecFree)(void *) FAST_FUNC;
222 typedef struct BcVec {
230 typedef signed char BcDig;
232 typedef struct BcNum {
240 #define BC_NUM_MAX_IBASE ((unsigned long) 16)
241 // larger value might speed up BIGNUM calculations a bit:
242 #define BC_NUM_DEF_SIZE (16)
243 #define BC_NUM_PRINT_WIDTH (69)
245 #define BC_NUM_KARATSUBA_LEN (32)
247 typedef enum BcInst {
276 BC_INST_ASSIGN_POWER,
277 BC_INST_ASSIGN_MULTIPLY,
278 BC_INST_ASSIGN_DIVIDE,
279 BC_INST_ASSIGN_MODULUS,
281 BC_INST_ASSIGN_MINUS,
327 BC_INST_PRINT_STREAM,
342 BC_INST_INVALID = -1,
346 typedef struct BcId {
351 typedef struct BcFunc {
357 IF_BC(size_t nparams;)
360 typedef enum BcResultType {
364 BC_RESULT_ARRAY_ELEM,
369 //code uses "inst - BC_INST_IBASE + BC_RESULT_IBASE" construct,
370 BC_RESULT_IBASE, // relative order should match for: BC_INST_IBASE
371 BC_RESULT_SCALE, // relative order should match for: BC_INST_SCALE
372 BC_RESULT_LAST, // relative order should match for: BC_INST_LAST
375 BC_RESULT_OBASE, // relative order should match for: BC_INST_OBASE
378 typedef union BcResultData {
384 typedef struct BcResult {
389 typedef struct BcInstPtr {
392 IF_BC(size_t results_len_before_call;)
395 // BC_LEX_NEG is not used in lexing; it is only for parsing.
396 typedef enum BcLexType {
423 BC_LEX_OP_ASSIGN_POWER,
424 BC_LEX_OP_ASSIGN_MULTIPLY,
425 BC_LEX_OP_ASSIGN_DIVIDE,
426 BC_LEX_OP_ASSIGN_MODULUS,
427 BC_LEX_OP_ASSIGN_PLUS,
428 BC_LEX_OP_ASSIGN_MINUS,
441 BC_LEX_LBRACE, // '{' is 0x7B, '}' is 0x7D,
443 BC_LEX_RBRACE, // should be LBRACE+2: code uses (c - '{' + BC_LEX_LBRACE)
449 BC_LEX_KEY_1st_keyword,
450 BC_LEX_KEY_AUTO = BC_LEX_KEY_1st_keyword,
457 // code uses "type - BC_LEX_KEY_IBASE + BC_INST_IBASE" construct,
458 BC_LEX_KEY_IBASE, // relative order should match for: BC_INST_IBASE
460 BC_LEX_KEY_LAST, // relative order should match for: BC_INST_LAST
463 BC_LEX_KEY_OBASE, // relative order should match for: BC_INST_OBASE
490 // code uses "t - BC_LEX_STORE_IBASE + BC_INST_IBASE" construct,
491 BC_LEX_STORE_IBASE, // relative order should match for: BC_INST_IBASE
492 BC_LEX_STORE_SCALE, // relative order should match for: BC_INST_SCALE
496 BC_LEX_STORE_OBASE, // relative order should match for: BC_INST_OBASE
502 // must match order of BC_LEX_KEY_foo etc above
504 struct BcLexKeyword {
507 #define BC_LEX_KW_ENTRY(a, b) \
508 { .name8 = a /*, .posix = b */ }
509 static const struct BcLexKeyword bc_lex_kws[20] = {
510 BC_LEX_KW_ENTRY("auto" , 1), // 0
511 BC_LEX_KW_ENTRY("break" , 1), // 1
512 BC_LEX_KW_ENTRY("continue", 0), // 2 note: this one has no terminating NUL
513 BC_LEX_KW_ENTRY("define" , 1), // 3
514 BC_LEX_KW_ENTRY("else" , 0), // 4
515 BC_LEX_KW_ENTRY("for" , 1), // 5
516 BC_LEX_KW_ENTRY("halt" , 0), // 6
517 BC_LEX_KW_ENTRY("ibase" , 1), // 7
518 BC_LEX_KW_ENTRY("if" , 1), // 8
519 BC_LEX_KW_ENTRY("last" , 0), // 9
520 BC_LEX_KW_ENTRY("length" , 1), // 10
521 BC_LEX_KW_ENTRY("limits" , 0), // 11
522 BC_LEX_KW_ENTRY("obase" , 1), // 12
523 BC_LEX_KW_ENTRY("print" , 0), // 13
524 BC_LEX_KW_ENTRY("quit" , 1), // 14
525 BC_LEX_KW_ENTRY("read" , 0), // 15
526 BC_LEX_KW_ENTRY("return" , 1), // 16
527 BC_LEX_KW_ENTRY("scale" , 1), // 17
528 BC_LEX_KW_ENTRY("sqrt" , 1), // 18
529 BC_LEX_KW_ENTRY("while" , 1), // 19
531 #undef BC_LEX_KW_ENTRY
532 #define STRING_if (bc_lex_kws[8].name8)
533 #define STRING_else (bc_lex_kws[4].name8)
534 #define STRING_while (bc_lex_kws[19].name8)
535 #define STRING_for (bc_lex_kws[5].name8)
559 #define bc_lex_kws_POSIX(i) ((1 << (i)) & POSIX_KWORD_MASK)
561 // This is a bit array that corresponds to token types. An entry is
562 // true if the token is valid in an expression, false otherwise.
563 // Used to figure out when expr parsing should stop *without error message*
564 // - 0 element indicates this condition. 1 means "this token is to be eaten
565 // as part of the expression", token can them still be determined to be invalid
566 // by later processing.
568 #define EXBITS(a,b,c,d,e,f,g,h) \
569 ((uint64_t)((a << 0)+(b << 1)+(c << 2)+(d << 3)+(e << 4)+(f << 5)+(g << 6)+(h << 7)))
570 BC_PARSE_EXPRS_BITS = 0
571 + (EXBITS(0,0,1,1,1,1,1,1) << (0*8)) // 0: eof inval ++ -- - ^ * /
572 + (EXBITS(1,1,1,1,1,1,1,1) << (1*8)) // 8: % + - == <= >= != <
573 + (EXBITS(1,1,1,1,1,1,1,1) << (2*8)) // 16: > ! || && ^= *= /= %=
574 + (EXBITS(1,1,1,0,0,1,1,0) << (3*8)) // 24: += -= = NL WS ( ) [
575 + (EXBITS(0,0,0,0,0,0,1,1) << (4*8)) // 32: , ] { ; } STR NAME NUM
576 + (EXBITS(0,0,0,0,0,0,0,1) << (5*8)) // 40: auto break cont define else for halt ibase
577 + (EXBITS(0,1,1,1,1,0,0,1) << (6*8)) // 48: if last len limits obase print quit read - bug, why "limits" is allowed?
578 + (EXBITS(0,1,1,0,0,0,0,0) << (7*8)) // 56: return scale sqrt while
581 static ALWAYS_INLINE long bc_parse_exprs(unsigned i)
583 #if ULONG_MAX > 0xffffffff
584 // 64-bit version (will not work correctly for 32-bit longs!)
585 return BC_PARSE_EXPRS_BITS & (1UL << i);
588 unsigned long m = (uint32_t)BC_PARSE_EXPRS_BITS;
590 m = (uint32_t)(BC_PARSE_EXPRS_BITS >> 32);
593 return m & (1UL << i);
597 // This is an array of data for operators that correspond to
598 // [BC_LEX_OP_INC...BC_LEX_OP_ASSIGN] token types.
599 static const uint8_t bc_parse_ops[] = {
600 #define OP(p,l) ((int)(l) * 0x10 + (p))
601 OP(0, false), OP( 0, false ), // inc dec
604 OP(3, true ), OP( 3, true ), OP( 3, true ), // mul div mod
605 OP(4, true ), OP( 4, true ), // + -
606 OP(6, true ), OP( 6, true ), OP( 6, true ), OP( 6, true ), OP( 6, true ), OP( 6, true ), // == <= >= != < >
608 OP(7, true ), OP( 7, true ), // or and
609 OP(5, false), OP( 5, false ), OP( 5, false ), OP( 5, false ), OP( 5, false ), // ^= *= /= %= +=
610 OP(5, false), OP( 5, false ), // -= =
613 #define bc_parse_op_PREC(i) (bc_parse_ops[i] & 0x0f)
614 #define bc_parse_op_LEFT(i) (bc_parse_ops[i] & 0x10)
618 static const //BcInst - should be this type. Using signed narrow type since BC_INST_INVALID is -1
621 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID, BC_INST_REL_GE,
622 BC_INST_INVALID, BC_INST_POWER, BC_INST_MULTIPLY, BC_INST_DIVIDE,
623 BC_INST_MODULUS, BC_INST_PLUS, BC_INST_MINUS,
624 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID,
625 BC_INST_INVALID, BC_INST_INVALID,
626 BC_INST_BOOL_NOT, BC_INST_INVALID, BC_INST_INVALID,
627 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID,
628 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID,
629 BC_INST_INVALID, BC_INST_INVALID, BC_INST_REL_GT, BC_INST_INVALID,
630 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID, BC_INST_REL_GE,
631 BC_INST_INVALID, BC_INST_INVALID,
632 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID,
633 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID,
634 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID, BC_INST_IBASE,
635 BC_INST_INVALID, BC_INST_INVALID, BC_INST_LENGTH, BC_INST_INVALID,
636 BC_INST_OBASE, BC_INST_PRINT, BC_INST_QUIT, BC_INST_INVALID,
637 BC_INST_INVALID, BC_INST_SCALE, BC_INST_SQRT, BC_INST_INVALID,
638 BC_INST_REL_EQ, BC_INST_MODEXP, BC_INST_DIVMOD, BC_INST_INVALID,
639 BC_INST_INVALID, BC_INST_EXECUTE, BC_INST_PRINT_STACK, BC_INST_CLEAR_STACK,
640 BC_INST_STACK_LEN, BC_INST_DUPLICATE, BC_INST_SWAP, BC_INST_POP,
641 BC_INST_ASCIIFY, BC_INST_PRINT_STREAM, BC_INST_INVALID, BC_INST_INVALID,
642 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID,
643 BC_INST_PRINT, BC_INST_NQUIT, BC_INST_SCALE_FUNC,
647 typedef struct BcLex {
660 #define BC_PARSE_STREND (0xff)
662 #define BC_PARSE_REL (1 << 0)
663 #define BC_PARSE_PRINT (1 << 1)
664 #define BC_PARSE_NOCALL (1 << 2)
665 #define BC_PARSE_NOREAD (1 << 3)
666 #define BC_PARSE_ARRAY (1 << 4)
668 typedef struct BcParse {
678 IF_BC(size_t in_funcdef;)
681 typedef struct BcProgram {
711 #define BC_PROG_MAIN (0)
712 #define BC_PROG_READ (1)
714 #define BC_PROG_REQ_FUNCS (2)
717 #define BC_PROG_STR(n) (!(n)->num && !(n)->cap)
718 #define BC_PROG_NUM(r, n) \
719 ((r)->t != BC_RESULT_ARRAY && (r)->t != BC_RESULT_STR && !BC_PROG_STR(n))
721 #define BC_FLAG_W (1 << 0)
722 #define BC_FLAG_V (1 << 1)
723 #define BC_FLAG_S (1 << 2)
724 #define BC_FLAG_Q (1 << 3)
725 #define BC_FLAG_L (1 << 4)
726 #define BC_FLAG_I (1 << 5)
727 #define DC_FLAG_X (1 << 6)
729 #define BC_MAX(a, b) ((a) > (b) ? (a) : (b))
730 #define BC_MIN(a, b) ((a) < (b) ? (a) : (b))
732 #define BC_MAX_OBASE ((unsigned) 999)
733 #define BC_MAX_DIM ((unsigned) INT_MAX)
734 #define BC_MAX_SCALE ((unsigned) UINT_MAX)
735 #define BC_MAX_STRING ((unsigned) UINT_MAX - 1)
736 #define BC_MAX_NUM BC_MAX_STRING
737 // Unused apart from "limits" message. Just show a "biggish number" there.
738 //#define BC_MAX_NAME BC_MAX_STRING
739 //#define BC_MAX_EXP ((unsigned long) LONG_MAX)
740 //#define BC_MAX_VARS ((unsigned long) SIZE_MAX - 1)
741 #define BC_MAX_NAME_STR "999999999"
742 #define BC_MAX_EXP_STR "999999999"
743 #define BC_MAX_VARS_STR "999999999"
745 #define BC_MAX_OBASE_STR "999"
747 #if INT_MAX == 2147483647
748 # define BC_MAX_DIM_STR "2147483647"
749 #elif INT_MAX == 9223372036854775807
750 # define BC_MAX_DIM_STR "9223372036854775807"
752 # error Strange INT_MAX
755 #if UINT_MAX == 4294967295
756 # define BC_MAX_SCALE_STR "4294967295"
757 # define BC_MAX_STRING_STR "4294967294"
758 #elif UINT_MAX == 18446744073709551615
759 # define BC_MAX_SCALE_STR "18446744073709551615"
760 # define BC_MAX_STRING_STR "18446744073709551614"
762 # error Strange UINT_MAX
764 #define BC_MAX_NUM_STR BC_MAX_STRING_STR
767 IF_FEATURE_BC_SIGNALS(smallint ttyin;)
768 IF_FEATURE_CLEAN_UP(smallint exiting;)
774 // For error messages. Can be set to current parsed line,
775 // or [TODO] to current executing line (can be before last parsed one)
784 #if ENABLE_FEATURE_EDITING
785 line_input_t *line_input_state;
788 #define G (*ptr_to_globals)
789 #define INIT_G() do { \
790 SET_PTR_TO_GLOBALS(xzalloc(sizeof(G))); \
792 #define FREE_G() do { \
793 FREE_PTR_TO_GLOBALS(); \
795 #define G_posix (ENABLE_BC && (option_mask32 & BC_FLAG_S))
796 #define G_warn (ENABLE_BC && (option_mask32 & BC_FLAG_W))
797 #define G_exreg (ENABLE_DC && (option_mask32 & DC_FLAG_X))
798 #if ENABLE_FEATURE_BC_SIGNALS
799 # define G_interrupt bb_got_signal
800 # define G_ttyin G.ttyin
802 # define G_interrupt 0
805 #if ENABLE_FEATURE_CLEAN_UP
806 # define G_exiting G.exiting
810 #define IS_BC (ENABLE_BC && (!ENABLE_DC || applet_name[0] == 'b'))
811 #define IS_DC (ENABLE_DC && (!ENABLE_BC || applet_name[0] != 'b'))
813 // In configurations where errors abort instead of propagating error
814 // return code up the call chain, functions returning BC_STATUS
815 // actually don't return anything, they always succeed and return "void".
816 // A macro wrapper is provided, which makes this statement work:
818 // and makes it visible to the compiler that s is always zero,
819 // allowing compiler to optimize dead code after the statement.
821 // To make code more readable, each such function has a "z"
822 // ("always returning zero") prefix, i.e. zbc_foo or zdc_foo.
824 #if ENABLE_FEATURE_BC_SIGNALS || ENABLE_FEATURE_CLEAN_UP
825 # define ERRORS_ARE_FATAL 0
826 # define ERRORFUNC /*nothing*/
827 # define IF_ERROR_RETURN_POSSIBLE(a) a
828 # define BC_STATUS BcStatus
829 # define RETURN_STATUS(v) return (v)
830 # define COMMA_SUCCESS /*nothing*/
832 # define ERRORS_ARE_FATAL 1
833 # define ERRORFUNC NORETURN
834 # define IF_ERROR_RETURN_POSSIBLE(a) /*nothing*/
835 # define BC_STATUS void
836 # define RETURN_STATUS(v) do { ((void)(v)); return; } while (0)
837 # define COMMA_SUCCESS ,BC_STATUS_SUCCESS
840 #define STACK_HAS_MORE_THAN(s, n) ((s)->len > ((size_t)(n)))
841 #define STACK_HAS_EQUAL_OR_MORE_THAN(s, n) ((s)->len >= ((size_t)(n)))
843 #define BC_NUM_NEG(n, neg) ((((ssize_t)(n)) ^ -((ssize_t)(neg))) + (neg))
844 #define BC_NUM_ONE(n) ((n)->len == 1 && (n)->rdx == 0 && (n)->num[0] == 1)
845 #define BC_NUM_INT(n) ((n)->len - (n)->rdx)
846 //#define BC_NUM_AREQ(a, b) (BC_MAX((a)->rdx, (b)->rdx) + BC_MAX(BC_NUM_INT(a), BC_NUM_INT(b)) + 1)
847 static /*ALWAYS_INLINE*/ size_t BC_NUM_AREQ(BcNum *a, BcNum *b)
849 return BC_MAX(a->rdx, b->rdx) + BC_MAX(BC_NUM_INT(a), BC_NUM_INT(b)) + 1;
851 //#define BC_NUM_MREQ(a, b, scale) (BC_NUM_INT(a) + BC_NUM_INT(b) + BC_MAX((scale), (a)->rdx + (b)->rdx) + 1)
852 static /*ALWAYS_INLINE*/ size_t BC_NUM_MREQ(BcNum *a, BcNum *b, size_t scale)
854 return BC_NUM_INT(a) + BC_NUM_INT(b) + BC_MAX(scale, a->rdx + b->rdx) + 1;
857 typedef void (*BcNumDigitOp)(size_t, size_t, bool) FAST_FUNC;
859 typedef BC_STATUS (*BcNumBinaryOp)(BcNum *, BcNum *, BcNum *, size_t) FAST_FUNC;
861 static BC_STATUS zbc_num_binary(BcNum *a, BcNum *b, BcNum *c, size_t scale,
862 BcNumBinaryOp op, size_t req);
863 static FAST_FUNC BC_STATUS zbc_num_a(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale);
864 static FAST_FUNC BC_STATUS zbc_num_s(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale);
865 static FAST_FUNC BC_STATUS zbc_num_p(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale);
866 static FAST_FUNC BC_STATUS zbc_num_m(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale);
867 static FAST_FUNC BC_STATUS zbc_num_d(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale);
868 static FAST_FUNC BC_STATUS zbc_num_rem(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale);
870 static FAST_FUNC BC_STATUS zbc_num_add(BcNum *a, BcNum *b, BcNum *c, size_t scale)
872 BcNumBinaryOp op = (!a->neg == !b->neg) ? zbc_num_a : zbc_num_s;
874 RETURN_STATUS(zbc_num_binary(a, b, c, false, op, BC_NUM_AREQ(a, b)));
877 static FAST_FUNC BC_STATUS zbc_num_sub(BcNum *a, BcNum *b, BcNum *c, size_t scale)
879 BcNumBinaryOp op = (!a->neg == !b->neg) ? zbc_num_s : zbc_num_a;
881 RETURN_STATUS(zbc_num_binary(a, b, c, true, op, BC_NUM_AREQ(a, b)));
884 static FAST_FUNC BC_STATUS zbc_num_mul(BcNum *a, BcNum *b, BcNum *c, size_t scale)
886 size_t req = BC_NUM_MREQ(a, b, scale);
887 RETURN_STATUS(zbc_num_binary(a, b, c, scale, zbc_num_m, req));
890 static FAST_FUNC BC_STATUS zbc_num_div(BcNum *a, BcNum *b, BcNum *c, size_t scale)
892 size_t req = BC_NUM_MREQ(a, b, scale);
893 RETURN_STATUS(zbc_num_binary(a, b, c, scale, zbc_num_d, req));
896 static FAST_FUNC BC_STATUS zbc_num_mod(BcNum *a, BcNum *b, BcNum *c, size_t scale)
898 size_t req = BC_NUM_MREQ(a, b, scale);
899 RETURN_STATUS(zbc_num_binary(a, b, c, scale, zbc_num_rem, req));
902 static FAST_FUNC BC_STATUS zbc_num_pow(BcNum *a, BcNum *b, BcNum *c, size_t scale)
904 RETURN_STATUS(zbc_num_binary(a, b, c, scale, zbc_num_p, a->len * b->len + 1));
907 static const BcNumBinaryOp zbc_program_ops[] = {
908 zbc_num_pow, zbc_num_mul, zbc_num_div, zbc_num_mod, zbc_num_add, zbc_num_sub,
910 #define zbc_num_add(...) (zbc_num_add(__VA_ARGS__) COMMA_SUCCESS)
911 #define zbc_num_sub(...) (zbc_num_sub(__VA_ARGS__) COMMA_SUCCESS)
912 #define zbc_num_mul(...) (zbc_num_mul(__VA_ARGS__) COMMA_SUCCESS)
913 #define zbc_num_div(...) (zbc_num_div(__VA_ARGS__) COMMA_SUCCESS)
914 #define zbc_num_mod(...) (zbc_num_mod(__VA_ARGS__) COMMA_SUCCESS)
915 #define zbc_num_pow(...) (zbc_num_pow(__VA_ARGS__) COMMA_SUCCESS)
917 static void fflush_and_check(void)
920 if (ferror(stdout) || ferror(stderr))
921 bb_perror_msg_and_die("output error");
924 #if ENABLE_FEATURE_CLEAN_UP
925 #define QUIT_OR_RETURN_TO_MAIN \
927 IF_FEATURE_BC_SIGNALS(G_ttyin = 0;) /* do not loop in main loop anymore */ \
929 return BC_STATUS_FAILURE; \
932 #define QUIT_OR_RETURN_TO_MAIN quit()
935 static void quit(void) NORETURN;
936 static void quit(void)
939 bb_perror_msg_and_die("input error");
941 dbg_exec("quit(): exiting with exitcode SUCCESS");
945 static void bc_verror_msg(const char *fmt, va_list p)
947 const char *sv = sv; // for compiler
950 applet_name = xasprintf("%s: %s:%u", applet_name, G.prog.file, G.err_line);
952 bb_verror_msg(fmt, p, NULL);
954 free((char*)applet_name);
959 static NOINLINE ERRORFUNC int bc_error_fmt(const char *fmt, ...)
964 bc_verror_msg(fmt, p);
967 if (ENABLE_FEATURE_CLEAN_UP || G_ttyin)
968 IF_ERROR_RETURN_POSSIBLE(return BC_STATUS_FAILURE);
973 static NOINLINE int bc_posix_error_fmt(const char *fmt, ...)
977 // Are non-POSIX constructs totally ok?
978 if (!(option_mask32 & (BC_FLAG_S|BC_FLAG_W)))
979 return BC_STATUS_SUCCESS; // yes
982 bc_verror_msg(fmt, p);
985 // Do we treat non-POSIX constructs as errors?
986 if (!(option_mask32 & BC_FLAG_S))
987 return BC_STATUS_SUCCESS; // no, it's a warning
988 if (ENABLE_FEATURE_CLEAN_UP || G_ttyin)
989 return BC_STATUS_FAILURE;
994 // We use error functions with "return bc_error(FMT[, PARAMS])" idiom.
995 // This idiom begs for tail-call optimization, but for it to work,
996 // function must not have caller-cleaned parameters on stack.
997 // Unfortunately, vararg function API does exactly that on most arches.
998 // Thus, use these shims for the cases when we have no vararg PARAMS:
999 static ERRORFUNC int bc_error(const char *msg)
1001 IF_ERROR_RETURN_POSSIBLE(return) bc_error_fmt("%s", msg);
1003 static ERRORFUNC int bc_error_bad_character(char c)
1006 IF_ERROR_RETURN_POSSIBLE(return) bc_error("NUL character");
1007 IF_ERROR_RETURN_POSSIBLE(return) bc_error_fmt("bad character '%c'", c);
1009 static ERRORFUNC int bc_error_bad_expression(void)
1011 IF_ERROR_RETURN_POSSIBLE(return) bc_error("bad expression");
1013 static ERRORFUNC int bc_error_bad_token(void)
1015 IF_ERROR_RETURN_POSSIBLE(return) bc_error("bad token");
1017 static ERRORFUNC int bc_error_stack_has_too_few_elements(void)
1019 IF_ERROR_RETURN_POSSIBLE(return) bc_error("stack has too few elements");
1021 static ERRORFUNC int bc_error_variable_is_wrong_type(void)
1023 IF_ERROR_RETURN_POSSIBLE(return) bc_error("variable is wrong type");
1025 static ERRORFUNC int bc_error_nested_read_call(void)
1027 IF_ERROR_RETURN_POSSIBLE(return) bc_error("read() call inside of a read() call");
1030 static int bc_POSIX_requires(const char *msg)
1032 return bc_posix_error_fmt("POSIX requires %s", msg);
1034 static int bc_POSIX_does_not_allow(const char *msg)
1036 return bc_posix_error_fmt("%s%s", "POSIX does not allow ", msg);
1038 static int bc_POSIX_does_not_allow_bool_ops_this_is_bad(const char *msg)
1040 return bc_posix_error_fmt("%s%s %s", "POSIX does not allow ", "boolean operators; the following is bad:", msg);
1042 static int bc_POSIX_does_not_allow_empty_X_expression_in_for(const char *msg)
1044 return bc_posix_error_fmt("%san empty %s expression in a for loop", "POSIX does not allow ", msg);
1048 static void bc_vec_grow(BcVec *v, size_t n)
1050 size_t cap = v->cap * 2;
1051 while (cap < v->len + n) cap *= 2;
1052 v->v = xrealloc(v->v, v->size * cap);
1056 static void bc_vec_init(BcVec *v, size_t esize, BcVecFree dtor)
1059 v->cap = BC_VEC_START_CAP;
1062 v->v = xmalloc(esize * BC_VEC_START_CAP);
1065 static void bc_char_vec_init(BcVec *v)
1067 bc_vec_init(v, sizeof(char), NULL);
1070 static void bc_vec_expand(BcVec *v, size_t req)
1073 v->v = xrealloc(v->v, v->size * req);
1078 static void bc_vec_pop(BcVec *v)
1082 v->dtor(v->v + (v->size * v->len));
1085 static void bc_vec_npop(BcVec *v, size_t n)
1090 size_t len = v->len - n;
1091 while (v->len > len) v->dtor(v->v + (v->size * --v->len));
1095 static void bc_vec_pop_all(BcVec *v)
1097 bc_vec_npop(v, v->len);
1100 static size_t bc_vec_push(BcVec *v, const void *data)
1102 size_t len = v->len;
1103 if (len >= v->cap) bc_vec_grow(v, 1);
1104 memmove(v->v + (v->size * len), data, v->size);
1109 // G.prog.results often needs "pop old operand, push result" idiom.
1110 // Can do this without a few extra ops
1111 static size_t bc_result_pop_and_push(const void *data)
1113 BcVec *v = &G.prog.results;
1115 size_t len = v->len - 1;
1117 last = v->v + (v->size * len);
1120 memmove(last, data, v->size);
1124 static size_t bc_vec_pushByte(BcVec *v, char data)
1126 return bc_vec_push(v, &data);
1129 static size_t bc_vec_pushZeroByte(BcVec *v)
1131 //return bc_vec_pushByte(v, '\0');
1133 return bc_vec_push(v, &const_int_0);
1136 static void bc_vec_pushAt(BcVec *v, const void *data, size_t idx)
1139 bc_vec_push(v, data);
1143 if (v->len == v->cap) bc_vec_grow(v, 1);
1145 ptr = v->v + v->size * idx;
1147 memmove(ptr + v->size, ptr, v->size * (v->len++ - idx));
1148 memmove(ptr, data, v->size);
1152 static void bc_vec_string(BcVec *v, size_t len, const char *str)
1155 bc_vec_expand(v, len + 1);
1156 memcpy(v->v, str, len);
1159 bc_vec_pushZeroByte(v);
1162 #if ENABLE_FEATURE_BC_SIGNALS && ENABLE_FEATURE_EDITING
1163 static void bc_vec_concat(BcVec *v, const char *str)
1167 if (v->len == 0) bc_vec_pushZeroByte(v);
1170 len = v->len + slen;
1172 if (v->cap < len) bc_vec_grow(v, slen);
1173 strcpy(v->v + v->len - 1, str);
1179 static void *bc_vec_item(const BcVec *v, size_t idx)
1181 return v->v + v->size * idx;
1184 static void *bc_vec_item_rev(const BcVec *v, size_t idx)
1186 return v->v + v->size * (v->len - idx - 1);
1189 static void *bc_vec_top(const BcVec *v)
1191 return v->v + v->size * (v->len - 1);
1194 static FAST_FUNC void bc_vec_free(void *vec)
1196 BcVec *v = (BcVec *) vec;
1201 static BcFunc* bc_program_func(size_t idx)
1203 return bc_vec_item(&G.prog.fns, idx);
1205 // BC_PROG_MAIN is zeroth element, so:
1206 #define bc_program_func_BC_PROG_MAIN() ((BcFunc*)(G.prog.fns.v))
1209 static BcFunc* bc_program_current_func(void)
1211 BcInstPtr *ip = bc_vec_top(&G.prog.exestack);
1212 BcFunc *func = bc_program_func(ip->func);
1217 static char** bc_program_str(size_t idx)
1221 BcFunc *func = bc_program_current_func();
1222 return bc_vec_item(&func->strs, idx);
1225 IF_DC(return bc_vec_item(&G.prog.strs, idx);)
1228 static char** bc_program_const(size_t idx)
1232 BcFunc *func = bc_program_current_func();
1233 return bc_vec_item(&func->consts, idx);
1236 IF_DC(return bc_vec_item(&G.prog.consts, idx);)
1239 static int bc_id_cmp(const void *e1, const void *e2)
1241 return strcmp(((const BcId *) e1)->name, ((const BcId *) e2)->name);
1244 static FAST_FUNC void bc_id_free(void *id)
1246 free(((BcId *) id)->name);
1249 static size_t bc_map_find_ge(const BcVec *v, const void *ptr)
1251 size_t low = 0, high = v->len;
1253 while (low < high) {
1254 size_t mid = (low + high) / 2;
1255 BcId *id = bc_vec_item(v, mid);
1256 int result = bc_id_cmp(ptr, id);
1269 static int bc_map_insert(BcVec *v, const void *ptr, size_t *i)
1271 size_t n = *i = bc_map_find_ge(v, ptr);
1274 bc_vec_push(v, ptr);
1275 else if (!bc_id_cmp(ptr, bc_vec_item(v, n)))
1276 return 0; // "was not inserted"
1278 bc_vec_pushAt(v, ptr, n);
1279 return 1; // "was inserted"
1283 static size_t bc_map_find_exact(const BcVec *v, const void *ptr)
1285 size_t i = bc_map_find_ge(v, ptr);
1286 if (i >= v->len) return BC_VEC_INVALID_IDX;
1287 return bc_id_cmp(ptr, bc_vec_item(v, i)) ? BC_VEC_INVALID_IDX : i;
1291 static int bad_input_byte(char c)
1293 if ((c < ' ' && c != '\t' && c != '\r' && c != '\n') // also allow '\v' '\f'?
1296 bc_error_fmt("illegal character 0x%02x", c);
1302 // Note: it _appends_ data from fp to vec.
1303 static void bc_read_line(BcVec *vec, FILE *fp)
1308 #if ENABLE_FEATURE_BC_SIGNALS
1309 if (G_interrupt) { // ^C was pressed
1312 // ^C while running a script (bc SCRIPT): die.
1313 // We do not return to interactive prompt:
1314 // user might be running us from a shell,
1315 // and SCRIPT might be intended to terminate
1316 // (e.g. contain a "halt" stmt).
1317 // ^C dropping user into a bc prompt instead of
1318 // the shell would be unexpected.
1321 // ^C while interactive input
1323 // GNU bc says "interrupted execution."
1324 // GNU dc says "Interrupt!"
1325 fputs("\ninterrupted execution\n", stderr);
1328 # if ENABLE_FEATURE_EDITING
1329 if (G_ttyin && fp == stdin) {
1331 # define line_buf bb_common_bufsiz1
1332 n = read_line_input(G.line_input_state, "", line_buf, COMMON_BUFSIZE);
1333 if (n <= 0) { // read errors or EOF, or ^D, or ^C
1336 bc_vec_pushZeroByte(vec); // ^D or EOF (or error)
1341 char c = line_buf[i++];
1343 if (bad_input_byte(c)) goto again;
1345 bc_vec_concat(vec, line_buf);
1353 size_t len = vec->len;
1356 #if ENABLE_FEATURE_BC_SIGNALS
1358 // ^C was pressed: ignore entire line, get another one
1363 do c = fgetc(fp); while (c == '\0');
1366 bb_perror_msg_and_die("input error");
1367 // Note: EOF does not append '\n'
1370 bad_chars |= bad_input_byte(c);
1371 bc_vec_pushByte(vec, (char)c);
1372 } while (c != '\n');
1375 // Bad chars on this line
1376 if (!G.prog.file) { // stdin
1377 // ignore entire line, get another one
1381 bb_perror_msg_and_die("file '%s' is not text", G.prog.file);
1383 bc_vec_pushZeroByte(vec);
1387 static void bc_num_setToZero(BcNum *n, size_t scale)
1394 static void bc_num_zero(BcNum *n)
1396 bc_num_setToZero(n, 0);
1399 static void bc_num_one(BcNum *n)
1401 bc_num_setToZero(n, 0);
1406 // Note: this also sets BcNum to zero
1407 static void bc_num_init(BcNum *n, size_t req)
1409 req = req >= BC_NUM_DEF_SIZE ? req : BC_NUM_DEF_SIZE;
1410 //memset(n, 0, sizeof(BcNum)); - cleared by assignments below
1411 n->num = xmalloc(req);
1418 static void bc_num_init_DEF_SIZE(BcNum *n)
1420 bc_num_init(n, BC_NUM_DEF_SIZE);
1423 static void bc_num_expand(BcNum *n, size_t req)
1425 req = req >= BC_NUM_DEF_SIZE ? req : BC_NUM_DEF_SIZE;
1427 n->num = xrealloc(n->num, req);
1432 static FAST_FUNC void bc_num_free(void *num)
1434 free(((BcNum *) num)->num);
1437 static void bc_num_copy(BcNum *d, BcNum *s)
1440 bc_num_expand(d, s->cap);
1444 memcpy(d->num, s->num, sizeof(BcDig) * d->len);
1448 static BC_STATUS zbc_num_ulong(BcNum *n, unsigned long *result_p)
1451 unsigned long pow, result;
1453 if (n->neg) RETURN_STATUS(bc_error("negative number"));
1455 for (result = 0, pow = 1, i = n->rdx; i < n->len; ++i) {
1456 unsigned long prev = result, powprev = pow;
1458 result += ((unsigned long) n->num[i]) * pow;
1461 if (result < prev || pow < powprev)
1462 RETURN_STATUS(bc_error("overflow"));
1468 RETURN_STATUS(BC_STATUS_SUCCESS);
1470 #define zbc_num_ulong(...) (zbc_num_ulong(__VA_ARGS__) COMMA_SUCCESS)
1472 #if ULONG_MAX == 0xffffffffUL // 10 digits: 4294967295
1473 # define ULONG_NUM_BUFSIZE (10 > BC_NUM_DEF_SIZE ? 10 : BC_NUM_DEF_SIZE)
1474 #elif ULONG_MAX == 0xffffffffffffffffULL // 20 digits: 18446744073709551615
1475 # define ULONG_NUM_BUFSIZE (20 > BC_NUM_DEF_SIZE ? 20 : BC_NUM_DEF_SIZE)
1477 // minimum BC_NUM_DEF_SIZE, so that bc_num_expand() in bc_num_ulong2num()
1478 // would not hit realloc() code path - not good if num[] is not malloced
1480 static void bc_num_ulong2num(BcNum *n, unsigned long val)
1486 if (val == 0) return;
1488 bc_num_expand(n, ULONG_NUM_BUFSIZE);
1495 if (val == 0) break;
1499 static void bc_num_subArrays(BcDig *restrict a, BcDig *restrict b, size_t len)
1502 for (i = 0; i < len; ++i) {
1504 for (j = i; a[j] < 0;) {
1511 static ssize_t bc_num_compare(BcDig *restrict a, BcDig *restrict b, size_t len)
1529 static ssize_t bc_num_cmp(BcNum *a, BcNum *b)
1531 size_t i, min, a_int, b_int, diff;
1532 BcDig *max_num, *min_num;
1536 if (a == b) return 0;
1537 if (a->len == 0) return BC_NUM_NEG(!!b->len, !b->neg);
1538 if (b->len == 0) return BC_NUM_NEG(1, a->neg);
1540 if (a->neg != b->neg) // signs of a and b differ
1541 // +a,-b = a>b = 1 or -a,+b = a<b = -1
1542 return (int)b->neg - (int)a->neg;
1543 neg = a->neg; // 1 if both negative, 0 if both positive
1545 a_int = BC_NUM_INT(a);
1546 b_int = BC_NUM_INT(b);
1549 if (a_int != 0) return (ssize_t) a_int;
1551 a_max = (a->rdx > b->rdx);
1554 diff = a->rdx - b->rdx;
1555 max_num = a->num + diff;
1557 // neg = (a_max == neg); - NOP (maps 1->1 and 0->0)
1560 diff = b->rdx - a->rdx;
1561 max_num = b->num + diff;
1563 neg = !neg; // same as "neg = (a_max == neg)"
1566 cmp = bc_num_compare(max_num, min_num, b_int + min);
1567 if (cmp != 0) return BC_NUM_NEG(cmp, neg);
1569 for (max_num -= diff, i = diff - 1; i < diff; --i) {
1570 if (max_num[i]) return BC_NUM_NEG(1, neg);
1576 static void bc_num_truncate(BcNum *n, size_t places)
1578 if (places == 0) return;
1584 memmove(n->num, n->num + places, n->len * sizeof(BcDig));
1588 static void bc_num_extend(BcNum *n, size_t places)
1590 size_t len = n->len + places;
1593 if (n->cap < len) bc_num_expand(n, len);
1595 memmove(n->num + places, n->num, sizeof(BcDig) * n->len);
1596 memset(n->num, 0, sizeof(BcDig) * places);
1603 static void bc_num_clean(BcNum *n)
1605 while (n->len > 0 && n->num[n->len - 1] == 0) --n->len;
1608 else if (n->len < n->rdx)
1612 static void bc_num_retireMul(BcNum *n, size_t scale, bool neg1, bool neg2)
1615 bc_num_extend(n, scale - n->rdx);
1617 bc_num_truncate(n, n->rdx - scale);
1620 if (n->len != 0) n->neg = !neg1 != !neg2;
1623 static void bc_num_split(BcNum *restrict n, size_t idx, BcNum *restrict a,
1627 b->len = n->len - idx;
1629 a->rdx = b->rdx = 0;
1631 memcpy(b->num, n->num + idx, b->len * sizeof(BcDig));
1632 memcpy(a->num, n->num, idx * sizeof(BcDig));
1642 static BC_STATUS zbc_num_shift(BcNum *n, size_t places)
1644 if (places == 0 || n->len == 0) RETURN_STATUS(BC_STATUS_SUCCESS);
1646 // This check makes sense only if size_t is (much) larger than BC_MAX_NUM.
1647 if (SIZE_MAX > (BC_MAX_NUM | 0xff)) {
1648 if (places + n->len > BC_MAX_NUM)
1649 RETURN_STATUS(bc_error("number too long: must be [1,"BC_MAX_NUM_STR"]"));
1652 if (n->rdx >= places)
1655 bc_num_extend(n, places - n->rdx);
1661 RETURN_STATUS(BC_STATUS_SUCCESS);
1663 #define zbc_num_shift(...) (zbc_num_shift(__VA_ARGS__) COMMA_SUCCESS)
1665 static BC_STATUS zbc_num_inv(BcNum *a, BcNum *b, size_t scale)
1674 RETURN_STATUS(zbc_num_div(&one, a, b, scale));
1676 #define zbc_num_inv(...) (zbc_num_inv(__VA_ARGS__) COMMA_SUCCESS)
1678 static FAST_FUNC BC_STATUS zbc_num_a(BcNum *a, BcNum *b, BcNum *restrict c, size_t sub)
1680 BcDig *ptr, *ptr_a, *ptr_b, *ptr_c;
1681 size_t i, max, min_rdx, min_int, diff, a_int, b_int;
1684 // Because this function doesn't need to use scale (per the bc spec),
1685 // I am hijacking it to say whether it's doing an add or a subtract.
1689 if (sub && c->len) c->neg = !c->neg;
1690 RETURN_STATUS(BC_STATUS_SUCCESS);
1694 RETURN_STATUS(BC_STATUS_SUCCESS);
1698 c->rdx = BC_MAX(a->rdx, b->rdx);
1699 min_rdx = BC_MIN(a->rdx, b->rdx);
1702 if (a->rdx > b->rdx) {
1703 diff = a->rdx - b->rdx;
1705 ptr_a = a->num + diff;
1708 diff = b->rdx - a->rdx;
1711 ptr_b = b->num + diff;
1715 for (i = 0; i < diff; ++i, ++c->len)
1719 a_int = BC_NUM_INT(a);
1720 b_int = BC_NUM_INT(b);
1722 if (a_int > b_int) {
1733 for (i = 0; i < min_rdx + min_int; ++i) {
1734 unsigned in = (unsigned)ptr_a[i] + (unsigned)ptr_b[i] + carry;
1736 ptr_c[i] = (BcDig)(in % 10);
1738 for (; i < max + min_rdx; ++i) {
1739 unsigned in = (unsigned)ptr[i] + carry;
1741 ptr_c[i] = (BcDig)(in % 10);
1745 if (carry != 0) c->num[c->len++] = (BcDig) carry;
1747 RETURN_STATUS(BC_STATUS_SUCCESS); // can't make void, see zbc_num_binary()
1750 static FAST_FUNC BC_STATUS zbc_num_s(BcNum *a, BcNum *b, BcNum *restrict c, size_t sub)
1753 BcNum *minuend, *subtrahend;
1755 bool aneg, bneg, neg;
1757 // Because this function doesn't need to use scale (per the bc spec),
1758 // I am hijacking it to say whether it's doing an add or a subtract.
1762 if (sub && c->len) c->neg = !c->neg;
1763 RETURN_STATUS(BC_STATUS_SUCCESS);
1767 RETURN_STATUS(BC_STATUS_SUCCESS);
1772 a->neg = b->neg = false;
1774 cmp = bc_num_cmp(a, b);
1780 bc_num_setToZero(c, BC_MAX(a->rdx, b->rdx));
1781 RETURN_STATUS(BC_STATUS_SUCCESS);
1789 if (sub) neg = !neg;
1794 bc_num_copy(c, minuend);
1797 if (c->rdx < subtrahend->rdx) {
1798 bc_num_extend(c, subtrahend->rdx - c->rdx);
1801 start = c->rdx - subtrahend->rdx;
1803 bc_num_subArrays(c->num + start, subtrahend->num, subtrahend->len);
1807 RETURN_STATUS(BC_STATUS_SUCCESS); // can't make void, see zbc_num_binary()
1810 static FAST_FUNC BC_STATUS zbc_num_k(BcNum *restrict a, BcNum *restrict b,
1812 #define zbc_num_k(...) (zbc_num_k(__VA_ARGS__) COMMA_SUCCESS)
1815 size_t max = BC_MAX(a->len, b->len), max2 = (max + 1) / 2;
1816 BcNum l1, h1, l2, h2, m2, m1, z0, z1, z2, temp;
1819 if (a->len == 0 || b->len == 0) {
1821 RETURN_STATUS(BC_STATUS_SUCCESS);
1823 aone = BC_NUM_ONE(a);
1824 if (aone || BC_NUM_ONE(b)) {
1825 bc_num_copy(c, aone ? b : a);
1826 RETURN_STATUS(BC_STATUS_SUCCESS);
1829 if (a->len + b->len < BC_NUM_KARATSUBA_LEN
1830 || a->len < BC_NUM_KARATSUBA_LEN
1831 || b->len < BC_NUM_KARATSUBA_LEN
1835 bc_num_expand(c, a->len + b->len + 1);
1837 memset(c->num, 0, sizeof(BcDig) * c->cap);
1840 for (i = 0; i < b->len; ++i) {
1842 for (j = 0; j < a->len; ++j) {
1843 unsigned in = c->num[i + j];
1844 in += (unsigned)a->num[j] * (unsigned)b->num[i] + carry;
1845 // note: compilers prefer _unsigned_ div/const
1847 c->num[i + j] = (BcDig)(in % 10);
1850 c->num[i + j] += (BcDig) carry;
1851 len = BC_MAX(len, i + j + !!carry);
1853 #if ENABLE_FEATURE_BC_SIGNALS
1855 // a*a <- without check below, this will not be interruptible
1856 if (G_interrupt) return BC_STATUS_FAILURE;
1862 RETURN_STATUS(BC_STATUS_SUCCESS);
1865 bc_num_init(&l1, max);
1866 bc_num_init(&h1, max);
1867 bc_num_init(&l2, max);
1868 bc_num_init(&h2, max);
1869 bc_num_init(&m1, max);
1870 bc_num_init(&m2, max);
1871 bc_num_init(&z0, max);
1872 bc_num_init(&z1, max);
1873 bc_num_init(&z2, max);
1874 bc_num_init(&temp, max + max);
1876 bc_num_split(a, max2, &l1, &h1);
1877 bc_num_split(b, max2, &l2, &h2);
1879 s = zbc_num_add(&h1, &l1, &m1, 0);
1881 s = zbc_num_add(&h2, &l2, &m2, 0);
1884 s = zbc_num_k(&h1, &h2, &z0);
1886 s = zbc_num_k(&m1, &m2, &z1);
1888 s = zbc_num_k(&l1, &l2, &z2);
1891 s = zbc_num_sub(&z1, &z0, &temp, 0);
1893 s = zbc_num_sub(&temp, &z2, &z1, 0);
1896 s = zbc_num_shift(&z0, max2 * 2);
1898 s = zbc_num_shift(&z1, max2);
1900 s = zbc_num_add(&z0, &z1, &temp, 0);
1902 s = zbc_num_add(&temp, &z2, c, 0);
1917 static FAST_FUNC BC_STATUS zbc_num_m(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale)
1921 size_t maxrdx = BC_MAX(a->rdx, b->rdx);
1923 scale = BC_MAX(scale, a->rdx);
1924 scale = BC_MAX(scale, b->rdx);
1925 scale = BC_MIN(a->rdx + b->rdx, scale);
1926 maxrdx = BC_MAX(maxrdx, scale);
1928 bc_num_init(&cpa, a->len);
1929 bc_num_init(&cpb, b->len);
1931 bc_num_copy(&cpa, a);
1932 bc_num_copy(&cpb, b);
1933 cpa.neg = cpb.neg = false;
1935 s = zbc_num_shift(&cpa, maxrdx);
1937 s = zbc_num_shift(&cpb, maxrdx);
1939 s = zbc_num_k(&cpa, &cpb, c);
1943 bc_num_expand(c, c->len + maxrdx);
1945 if (c->len < maxrdx) {
1946 memset(c->num + c->len, 0, (c->cap - c->len) * sizeof(BcDig));
1951 bc_num_retireMul(c, scale, a->neg, b->neg);
1957 #define zbc_num_m(...) (zbc_num_m(__VA_ARGS__) COMMA_SUCCESS)
1959 static FAST_FUNC BC_STATUS zbc_num_d(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale)
1966 RETURN_STATUS(bc_error("divide by zero"));
1968 bc_num_setToZero(c, scale);
1969 RETURN_STATUS(BC_STATUS_SUCCESS);
1971 if (BC_NUM_ONE(b)) {
1973 bc_num_retireMul(c, scale, a->neg, b->neg);
1974 RETURN_STATUS(BC_STATUS_SUCCESS);
1977 bc_num_init(&cp, BC_NUM_MREQ(a, b, scale));
1978 bc_num_copy(&cp, a);
1982 bc_num_expand(&cp, len + 2);
1983 bc_num_extend(&cp, len - cp.len);
1986 if (b->rdx > cp.rdx) bc_num_extend(&cp, b->rdx - cp.rdx);
1988 if (scale > cp.rdx) bc_num_extend(&cp, scale - cp.rdx);
1990 if (b->rdx == b->len) {
1992 if (len == 0) break;
1994 if (b->num[len] != 0)
2000 if (cp.cap == cp.len) bc_num_expand(&cp, cp.len + 1);
2002 // We want an extra zero in front to make things simpler.
2003 cp.num[cp.len++] = 0;
2006 bc_num_expand(c, cp.len);
2009 memset(c->num + end, 0, (c->cap - end) * sizeof(BcDig));
2013 s = BC_STATUS_SUCCESS;
2014 for (i = end - 1; i < end; --i) {
2017 for (q = 0; n[len] != 0 || bc_num_compare(n, b->num, len) >= 0; ++q)
2018 bc_num_subArrays(n, b->num, len);
2020 #if ENABLE_FEATURE_BC_SIGNALS
2023 // 1/a <- without check below, this will not be interruptible
2025 s = BC_STATUS_FAILURE;
2031 bc_num_retireMul(c, scale, a->neg, b->neg);
2036 #define zbc_num_d(...) (zbc_num_d(__VA_ARGS__) COMMA_SUCCESS)
2038 static FAST_FUNC BC_STATUS zbc_num_r(BcNum *a, BcNum *b, BcNum *restrict c,
2039 BcNum *restrict d, size_t scale, size_t ts)
2046 RETURN_STATUS(bc_error("divide by zero"));
2049 bc_num_setToZero(d, ts);
2050 RETURN_STATUS(BC_STATUS_SUCCESS);
2053 bc_num_init(&temp, d->cap);
2054 s = zbc_num_d(a, b, c, scale);
2057 if (scale != 0) scale = ts;
2059 s = zbc_num_m(c, b, &temp, scale);
2061 s = zbc_num_sub(a, &temp, d, scale);
2064 if (ts > d->rdx && d->len) bc_num_extend(d, ts - d->rdx);
2067 bc_num_retireMul(d, ts, a->neg, b->neg);
2073 #define zbc_num_r(...) (zbc_num_r(__VA_ARGS__) COMMA_SUCCESS)
2075 static FAST_FUNC BC_STATUS zbc_num_rem(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale)
2079 size_t ts = BC_MAX(scale + b->rdx, a->rdx), len = BC_NUM_MREQ(a, b, ts);
2081 bc_num_init(&c1, len);
2082 s = zbc_num_r(a, b, &c1, c, scale, ts);
2087 #define zbc_num_rem(...) (zbc_num_rem(__VA_ARGS__) COMMA_SUCCESS)
2089 static FAST_FUNC BC_STATUS zbc_num_p(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale)
2091 BcStatus s = BC_STATUS_SUCCESS;
2094 size_t i, powrdx, resrdx;
2097 if (b->rdx) RETURN_STATUS(bc_error("non integer number"));
2101 RETURN_STATUS(BC_STATUS_SUCCESS);
2104 bc_num_setToZero(c, scale);
2105 RETURN_STATUS(BC_STATUS_SUCCESS);
2107 if (BC_NUM_ONE(b)) {
2111 s = zbc_num_inv(a, c, scale);
2118 s = zbc_num_ulong(b, &pow);
2119 if (s) RETURN_STATUS(s);
2121 bc_num_init(©, a->len);
2122 bc_num_copy(©, a);
2127 if (a->rdx * pow < scale)
2128 scale = a->rdx * pow;
2133 for (powrdx = a->rdx; !(pow & 1); pow >>= 1) {
2135 s = zbc_num_mul(©, ©, ©, powrdx);
2137 // Not needed: zbc_num_mul() has a check for ^C:
2138 //if (G_interrupt) {
2139 // s = BC_STATUS_FAILURE;
2144 bc_num_copy(c, ©);
2146 for (resrdx = powrdx, pow >>= 1; pow != 0; pow >>= 1) {
2148 s = zbc_num_mul(©, ©, ©, powrdx);
2153 s = zbc_num_mul(c, ©, c, resrdx);
2156 // Not needed: zbc_num_mul() has a check for ^C:
2157 //if (G_interrupt) {
2158 // s = BC_STATUS_FAILURE;
2164 s = zbc_num_inv(c, c, scale);
2168 if (c->rdx > scale) bc_num_truncate(c, c->rdx - scale);
2170 // We can't use bc_num_clean() here.
2171 for (i = 0; i < c->len; ++i)
2174 bc_num_setToZero(c, scale);
2181 #define zbc_num_p(...) (zbc_num_p(__VA_ARGS__) COMMA_SUCCESS)
2183 static BC_STATUS zbc_num_binary(BcNum *a, BcNum *b, BcNum *c, size_t scale,
2184 BcNumBinaryOp op, size_t req)
2187 BcNum num2, *ptr_a, *ptr_b;
2192 memcpy(ptr_a, c, sizeof(BcNum));
2200 memcpy(ptr_b, c, sizeof(BcNum));
2207 bc_num_init(c, req);
2209 bc_num_expand(c, req);
2211 s = BC_STATUS_SUCCESS;
2212 IF_ERROR_RETURN_POSSIBLE(s =) op(ptr_a, ptr_b, c, scale);
2214 if (init) bc_num_free(&num2);
2218 #define zbc_num_binary(...) (zbc_num_binary(__VA_ARGS__) COMMA_SUCCESS)
2220 static bool bc_num_strValid(const char *val, size_t base)
2225 b = (BcDig)(base <= 10 ? base + '0' : base - 10 + 'A');
2232 if (radix) return false;
2236 if (c < '0' || c >= b || (c > '9' && c < 'A'))
2242 // Note: n is already "bc_num_zero()"ed,
2243 // leading zeroes in "val" are removed
2244 static void bc_num_parseDecimal(BcNum *n, const char *val)
2253 bc_num_expand(n, len);
2255 ptr = strchr(val, '.');
2259 n->rdx = (size_t)((val + len) - (ptr + 1));
2261 for (i = 0; val[i]; ++i) {
2262 if (val[i] != '0' && val[i] != '.') {
2263 // Not entirely zero value - convert it, and exit
2266 n->num[n->len] = val[i] - '0';
2270 if (val[--i] == '.') goto skip_dot;
2275 // if for() exits without hitting if(), the value is entirely zero
2278 // Note: n is already "bc_num_zero()"ed,
2279 // leading zeroes in "val" are removed
2280 static void bc_num_parseBase(BcNum *n, const char *val, unsigned base_t)
2283 BcNum temp, mult, result;
2285 BcDig base_digs[ULONG_NUM_BUFSIZE];
2290 for (i = 0; ; ++i) {
2293 if (val[i] != '.' && val[i] != '0')
2297 bc_num_init_DEF_SIZE(&temp);
2298 bc_num_init_DEF_SIZE(&mult);
2299 base.cap = ARRAY_SIZE(base_digs);
2300 base.num = base_digs;
2301 bc_num_ulong2num(&base, base_t);
2305 if (c == '\0') goto int_err;
2306 if (c == '.') break;
2308 v = (unsigned long) (c <= '9' ? c - '0' : c - 'A' + 10);
2310 s = zbc_num_mul(n, &base, &mult, 0);
2311 if (s) goto int_err;
2312 bc_num_ulong2num(&temp, v);
2313 s = zbc_num_add(&mult, &temp, n, 0);
2314 if (s) goto int_err;
2317 bc_num_init(&result, base.len);
2318 //bc_num_zero(&result); - already is
2324 if (c == '\0') break;
2327 v = (unsigned long) (c <= '9' ? c - '0' : c - 'A' + 10);
2329 s = zbc_num_mul(&result, &base, &result, 0);
2331 bc_num_ulong2num(&temp, v);
2332 s = zbc_num_add(&result, &temp, &result, 0);
2334 s = zbc_num_mul(&mult, &base, &mult, 0);
2338 s = zbc_num_div(&result, &mult, &result, digits);
2340 s = zbc_num_add(n, &result, n, digits);
2344 if (n->rdx < digits)
2345 bc_num_extend(n, digits - n->rdx);
2349 bc_num_free(&result);
2355 static BC_STATUS zbc_num_parse(BcNum *n, const char *val, unsigned base_t)
2357 if (!bc_num_strValid(val, base_t))
2358 RETURN_STATUS(bc_error("bad number string"));
2361 while (*val == '0') val++;
2364 bc_num_parseDecimal(n, val);
2366 bc_num_parseBase(n, val, base_t);
2368 RETURN_STATUS(BC_STATUS_SUCCESS);
2370 #define zbc_num_parse(...) (zbc_num_parse(__VA_ARGS__) COMMA_SUCCESS)
2372 static BC_STATUS zbc_num_sqrt(BcNum *a, BcNum *restrict b, size_t scale)
2375 BcNum num1, num2, half, f, fprime, *x0, *x1, *temp;
2376 size_t pow, len, digs, digs1, resrdx, req, times = 0;
2377 ssize_t cmp = 1, cmp1 = SSIZE_MAX, cmp2 = SSIZE_MAX;
2379 req = BC_MAX(scale, a->rdx) + ((BC_NUM_INT(a) + 1) >> 1) + 1;
2380 bc_num_expand(b, req);
2383 bc_num_setToZero(b, scale);
2384 RETURN_STATUS(BC_STATUS_SUCCESS);
2387 RETURN_STATUS(bc_error("negative number"));
2389 if (BC_NUM_ONE(a)) {
2391 bc_num_extend(b, scale);
2392 RETURN_STATUS(BC_STATUS_SUCCESS);
2395 scale = BC_MAX(scale, a->rdx) + 1;
2396 len = a->len + scale;
2398 bc_num_init(&num1, len);
2399 bc_num_init(&num2, len);
2400 bc_num_init_DEF_SIZE(&half);
2406 bc_num_init(&f, len);
2407 bc_num_init(&fprime, len);
2413 pow = BC_NUM_INT(a);
2421 pow -= 2 - (pow & 1);
2423 bc_num_extend(x0, pow);
2425 // Make sure to move the radix back.
2429 x0->rdx = digs = digs1 = 0;
2431 len = BC_NUM_INT(x0) + resrdx - 1;
2433 while (cmp != 0 || digs < len) {
2434 s = zbc_num_div(a, x0, &f, resrdx);
2436 s = zbc_num_add(x0, &f, &fprime, resrdx);
2438 s = zbc_num_mul(&fprime, &half, x1, resrdx);
2441 cmp = bc_num_cmp(x1, x0);
2442 digs = x1->len - (unsigned long long) llabs(cmp);
2444 if (cmp == cmp2 && digs == digs1)
2449 resrdx += times > 4;
2462 if (b->rdx > scale) bc_num_truncate(b, b->rdx - scale);
2464 bc_num_free(&fprime);
2471 #define zbc_num_sqrt(...) (zbc_num_sqrt(__VA_ARGS__) COMMA_SUCCESS)
2473 static BC_STATUS zbc_num_divmod(BcNum *a, BcNum *b, BcNum *c, BcNum *d,
2479 size_t ts = BC_MAX(scale + b->rdx, a->rdx), len = BC_NUM_MREQ(a, b, ts);
2482 memcpy(&num2, c, sizeof(BcNum));
2484 bc_num_init(c, len);
2488 bc_num_expand(c, len);
2491 s = zbc_num_r(ptr_a, b, c, d, scale, ts);
2493 if (init) bc_num_free(&num2);
2497 #define zbc_num_divmod(...) (zbc_num_divmod(__VA_ARGS__) COMMA_SUCCESS)
2500 static BC_STATUS zdc_num_modexp(BcNum *a, BcNum *b, BcNum *c, BcNum *restrict d)
2503 BcNum base, exp, two, temp;
2506 RETURN_STATUS(bc_error("divide by zero"));
2507 if (a->rdx || b->rdx || c->rdx)
2508 RETURN_STATUS(bc_error("non integer number"));
2510 RETURN_STATUS(bc_error("negative number"));
2512 bc_num_expand(d, c->len);
2513 bc_num_init(&base, c->len);
2514 bc_num_init(&exp, b->len);
2515 bc_num_init_DEF_SIZE(&two);
2516 bc_num_init(&temp, b->len);
2522 s = zbc_num_rem(a, c, &base, 0);
2524 bc_num_copy(&exp, b);
2526 while (exp.len != 0) {
2527 s = zbc_num_divmod(&exp, &two, &exp, &temp, 0);
2530 if (BC_NUM_ONE(&temp)) {
2531 s = zbc_num_mul(d, &base, &temp, 0);
2533 s = zbc_num_rem(&temp, c, d, 0);
2537 s = zbc_num_mul(&base, &base, &temp, 0);
2539 s = zbc_num_rem(&temp, c, &base, 0);
2549 #define zdc_num_modexp(...) (zdc_num_modexp(__VA_ARGS__) COMMA_SUCCESS)
2553 static BC_STATUS zbc_func_insert(BcFunc *f, char *name, bool var)
2559 autoid = (void*)f->autos.v;
2560 for (i = 0; i < f->autos.len; i++, autoid++) {
2561 if (strcmp(name, autoid->name) == 0)
2562 RETURN_STATUS(bc_error("function parameter or auto var has the same name as another"));
2568 bc_vec_push(&f->autos, &a);
2570 RETURN_STATUS(BC_STATUS_SUCCESS);
2572 #define zbc_func_insert(...) (zbc_func_insert(__VA_ARGS__) COMMA_SUCCESS)
2575 static FAST_FUNC void bc_string_free(void *string)
2577 free(*(char**)string);
2580 static void bc_func_init(BcFunc *f)
2582 bc_char_vec_init(&f->code);
2583 IF_BC(bc_vec_init(&f->labels, sizeof(size_t), NULL);)
2584 IF_BC(bc_vec_init(&f->autos, sizeof(BcId), bc_id_free);)
2585 IF_BC(bc_vec_init(&f->strs, sizeof(char *), bc_string_free);)
2586 IF_BC(bc_vec_init(&f->consts, sizeof(char *), bc_string_free);)
2587 IF_BC(f->nparams = 0;)
2590 static FAST_FUNC void bc_func_free(void *func)
2592 BcFunc *f = (BcFunc *) func;
2593 bc_vec_free(&f->code);
2594 IF_BC(bc_vec_free(&f->labels);)
2595 IF_BC(bc_vec_free(&f->autos);)
2596 IF_BC(bc_vec_free(&f->strs);)
2597 IF_BC(bc_vec_free(&f->consts);)
2600 static void bc_array_expand(BcVec *a, size_t len);
2602 static void bc_array_init(BcVec *a, bool nums)
2605 bc_vec_init(a, sizeof(BcNum), bc_num_free);
2607 bc_vec_init(a, sizeof(BcVec), bc_vec_free);
2608 bc_array_expand(a, 1);
2611 static void bc_array_expand(BcVec *a, size_t len)
2613 if (a->dtor == bc_num_free
2614 // && a->size == sizeof(BcNum) - always true
2617 while (len > a->len) {
2618 bc_num_init_DEF_SIZE(&n);
2623 while (len > a->len) {
2624 bc_array_init(&v, true);
2630 static void bc_array_copy(BcVec *d, const BcVec *s)
2636 bc_vec_expand(d, s->cap);
2641 for (i = 0; i < s->len; i++, dnum++, snum++) {
2642 bc_num_init(dnum, snum->len);
2643 bc_num_copy(dnum, snum);
2648 static void dc_result_copy(BcResult *d, BcResult *src)
2653 case BC_RESULT_TEMP:
2654 case BC_RESULT_IBASE:
2655 case BC_RESULT_SCALE:
2656 case BC_RESULT_OBASE:
2657 bc_num_init(&d->d.n, src->d.n.len);
2658 bc_num_copy(&d->d.n, &src->d.n);
2661 case BC_RESULT_ARRAY:
2662 case BC_RESULT_ARRAY_ELEM:
2663 d->d.id.name = xstrdup(src->d.id.name);
2665 case BC_RESULT_CONSTANT:
2666 case BC_RESULT_LAST:
2669 memcpy(&d->d.n, &src->d.n, sizeof(BcNum));
2675 static FAST_FUNC void bc_result_free(void *result)
2677 BcResult *r = (BcResult *) result;
2680 case BC_RESULT_TEMP:
2681 case BC_RESULT_IBASE:
2682 case BC_RESULT_SCALE:
2683 case BC_RESULT_OBASE:
2684 bc_num_free(&r->d.n);
2687 case BC_RESULT_ARRAY:
2688 case BC_RESULT_ARRAY_ELEM:
2697 static void bc_lex_lineComment(BcLex *l)
2699 // Try: echo -n '#foo' | bc
2701 l->t.t = BC_LEX_WHITESPACE;
2703 while (i < l->len && l->buf[i] != '\n')
2708 static void bc_lex_whitespace(BcLex *l)
2710 l->t.t = BC_LEX_WHITESPACE;
2712 char c = l->buf[l->i];
2713 if (c == '\n') // this is BC_LEX_NLINE, not BC_LEX_WHITESPACE
2721 static BC_STATUS zbc_lex_number(BcLex *l, char start)
2723 const char *buf = l->buf + l->i;
2724 size_t len, i, ccnt;
2727 pt = (start == '.');
2728 l->t.t = BC_LEX_NUMBER;
2734 if (c == '\\' && buf[i + 1] == '\n') {
2736 //number_of_backslashes++ - see comment below
2739 if (!isdigit(c) && (c < 'A' || c > 'F')) {
2740 if (c != '.') break;
2741 // if '.' was already seen, stop on second one:
2745 // buf[i] is one of "0-9A-F."
2750 //ccnt is the number of chars in the number string, excluding possible
2751 //trailing "[\<newline>].[\<newline>]" (with any number of \<NL> repetitions).
2752 //i is buf[i] index of the first not-yet-parsed char after that.
2755 // This might overestimate the size, if there are "\<NL>"'s
2756 // in the number. Subtracting number_of_backslashes*2 correctly
2757 // is not that easy: consider that in the case of "NNN.\<NL>"
2758 // loop above will count "\<NL>" before it realizes it is not
2759 // in fact *inside* the number:
2760 len = ccnt + 1; // +1 byte for NUL termination
2762 // This check makes sense only if size_t is (much) larger than BC_MAX_NUM.
2763 if (SIZE_MAX > (BC_MAX_NUM | 0xff)) {
2764 if (len > BC_MAX_NUM)
2765 RETURN_STATUS(bc_error("number too long: must be [1,"BC_MAX_NUM_STR"]"));
2768 bc_vec_pop_all(&l->t.v);
2769 bc_vec_expand(&l->t.v, 1 + len);
2770 bc_vec_push(&l->t.v, &start);
2773 // If we have hit a backslash, skip it. We don't have
2774 // to check for a newline because it's guaranteed.
2780 bc_vec_push(&l->t.v, buf);
2785 bc_vec_pushZeroByte(&l->t.v);
2787 RETURN_STATUS(BC_STATUS_SUCCESS);
2789 #define zbc_lex_number(...) (zbc_lex_number(__VA_ARGS__) COMMA_SUCCESS)
2791 static void bc_lex_name(BcLex *l)
2796 l->t.t = BC_LEX_NAME;
2799 buf = l->buf + l->i - 1;
2802 if ((c < 'a' || c > 'z') && !isdigit(c) && c != '_') break;
2806 #if 0 // We do not protect against people with gigabyte-long names
2807 // This check makes sense only if size_t is (much) larger than BC_MAX_STRING.
2808 if (SIZE_MAX > (BC_MAX_STRING | 0xff)) {
2809 if (i > BC_MAX_STRING)
2810 return bc_error("name too long: must be [1,"BC_MAX_STRING_STR"]");
2813 bc_vec_string(&l->t.v, i, buf);
2815 // Increment the index. We minus 1 because it has already been incremented.
2818 //return BC_STATUS_SUCCESS;
2821 static void bc_lex_init(BcLex *l)
2823 bc_char_vec_init(&l->t.v);
2826 static void bc_lex_free(BcLex *l)
2828 bc_vec_free(&l->t.v);
2831 static void bc_lex_file(BcLex *l)
2833 G.err_line = l->line = 1;
2837 IF_BC(static BC_STATUS zbc_lex_token(BcLex *l);)
2838 IF_DC(static BC_STATUS zdc_lex_token(BcLex *l);)
2840 static BC_STATUS zcommon_lex_token(BcLex *l)
2843 IF_BC(RETURN_STATUS(zbc_lex_token(l));)
2845 IF_DC(RETURN_STATUS(zdc_lex_token(l));)
2847 #define zcommon_lex_token(...) (zcommon_lex_token(__VA_ARGS__) COMMA_SUCCESS)
2849 static bool bc_lex_more_input(BcLex *l)
2854 bc_vec_pop_all(&G.input_buffer);
2856 // This loop is complex because the vm tries not to send any lines that end
2857 // with a backslash to the parser. The reason for that is because the parser
2858 // treats a backslash+newline combo as whitespace, per the bc spec. In that
2859 // case, and for strings and comments, the parser will expect more stuff.
2863 size_t prevlen = G.input_buffer.len;
2866 bc_read_line(&G.input_buffer, G.input_fp);
2867 // No more input means EOF
2868 if (G.input_buffer.len <= prevlen + 1) // (we expect +1 for NUL byte)
2871 string = G.input_buffer.v + prevlen;
2874 if (string == G.input_buffer.v || string[-1] != '\\') {
2885 if (c == '/' && *string == '*') {
2890 if (c == '*' && *string == '/') {
2895 if (str != 0 || comment) {
2896 G.input_buffer.len--; // backstep over the trailing NUL byte
2900 // Check for backslash+newline.
2901 // we do not check that last char is '\n' -
2902 // if it is not, then it's EOF, and looping back
2903 // to bc_read_line() will detect it:
2905 if (string >= G.input_buffer.v && *string == '\\') {
2906 G.input_buffer.len--;
2913 l->buf = G.input_buffer.v;
2915 // bb_error_msg("G.input_buffer.len:%d '%s'", G.input_buffer.len, G.input_buffer.v);
2916 l->len = G.input_buffer.len - 1; // do not include NUL
2921 static BC_STATUS zbc_lex_next(BcLex *l)
2926 if (l->t.last == BC_LEX_EOF) RETURN_STATUS(bc_error("end of file"));
2928 l->line += l->newline;
2929 G.err_line = l->line;
2932 // Loop until failure or we don't have whitespace. This
2933 // is so the parser doesn't get inundated with whitespace.
2934 // Comments are also BC_LEX_WHITESPACE tokens and eaten here.
2935 s = BC_STATUS_SUCCESS;
2937 if (l->i == l->len) {
2938 l->t.t = BC_LEX_EOF;
2940 RETURN_STATUS(BC_STATUS_SUCCESS);
2941 if (!bc_lex_more_input(l)) {
2943 RETURN_STATUS(BC_STATUS_SUCCESS);
2945 // here it's guaranteed that l->i is below l->len
2947 dbg_lex("next string to parse:'%.*s'",
2948 (int)(strchrnul(l->buf + l->i, '\n') - (l->buf + l->i)),
2950 s = zcommon_lex_token(l);
2951 } while (!s && l->t.t == BC_LEX_WHITESPACE);
2952 dbg_lex("l->t.t from string:%d", l->t.t);
2956 #define zbc_lex_next(...) (zbc_lex_next(__VA_ARGS__) COMMA_SUCCESS)
2959 static BC_STATUS zbc_lex_skip_if_at_NLINE(BcLex *l)
2961 if (l->t.t == BC_LEX_NLINE)
2962 RETURN_STATUS(zbc_lex_next(l));
2963 RETURN_STATUS(BC_STATUS_SUCCESS);
2965 #define zbc_lex_skip_if_at_NLINE(...) (zbc_lex_skip_if_at_NLINE(__VA_ARGS__) COMMA_SUCCESS)
2967 static BC_STATUS zbc_lex_next_and_skip_NLINE(BcLex *l)
2970 s = zbc_lex_next(l);
2971 if (s) RETURN_STATUS(s);
2972 // if(cond)<newline>stmt is accepted too (but not 2+ newlines)
2973 s = zbc_lex_skip_if_at_NLINE(l);
2976 #define zbc_lex_next_and_skip_NLINE(...) (zbc_lex_next_and_skip_NLINE(__VA_ARGS__) COMMA_SUCCESS)
2979 static BC_STATUS zbc_lex_text_init(BcLex *l, const char *text)
2983 l->len = strlen(text);
2984 l->t.t = l->t.last = BC_LEX_INVALID;
2985 RETURN_STATUS(zbc_lex_next(l));
2987 #define zbc_lex_text_init(...) (zbc_lex_text_init(__VA_ARGS__) COMMA_SUCCESS)
2990 static BC_STATUS zbc_lex_identifier(BcLex *l)
2994 const char *buf = l->buf + l->i - 1;
2996 for (i = 0; i < ARRAY_SIZE(bc_lex_kws); ++i) {
2997 const char *keyword8 = bc_lex_kws[i].name8;
2999 while (buf[j] != '\0' && buf[j] == keyword8[j]) {
3001 if (j == 8) goto match;
3003 if (keyword8[j] != '\0')
3006 // buf starts with keyword bc_lex_kws[i]
3007 if (isalnum(buf[j]) || buf[j]=='_')
3008 continue; // "ifz" does not match "if" keyword, "if." does
3009 l->t.t = BC_LEX_KEY_1st_keyword + i;
3010 if (!bc_lex_kws_POSIX(i)) {
3011 s = bc_posix_error_fmt("%sthe '%.8s' keyword", "POSIX does not allow ", bc_lex_kws[i].name8);
3012 IF_ERROR_RETURN_POSSIBLE(if (s) RETURN_STATUS(s));
3015 // We minus 1 because the index has already been incremented.
3017 RETURN_STATUS(BC_STATUS_SUCCESS);
3021 s = BC_STATUS_SUCCESS;
3023 if (l->t.v.len > 2) {
3026 // bc: POSIX only allows one character names; the following is bad: 'qwe=1
3028 unsigned len = strchrnul(buf, '\n') - buf;
3029 s = bc_posix_error_fmt("POSIX only allows one character names; the following is bad: '%.*s'", len, buf);
3034 #define zbc_lex_identifier(...) (zbc_lex_identifier(__VA_ARGS__) COMMA_SUCCESS)
3036 static BC_STATUS zbc_lex_string(BcLex *l)
3040 l->t.t = BC_LEX_STR;
3048 RETURN_STATUS(bc_error("string end could not be found"));
3057 // This check makes sense only if size_t is (much) larger than BC_MAX_STRING.
3058 if (SIZE_MAX > (BC_MAX_STRING | 0xff)) {
3059 if (len > BC_MAX_STRING)
3060 RETURN_STATUS(bc_error("string too long: must be [1,"BC_MAX_STRING_STR"]"));
3062 bc_vec_string(&l->t.v, len, l->buf + l->i);
3066 G.err_line = l->line;
3068 RETURN_STATUS(BC_STATUS_SUCCESS);
3070 #define zbc_lex_string(...) (zbc_lex_string(__VA_ARGS__) COMMA_SUCCESS)
3072 static void bc_lex_assign(BcLex *l, unsigned with_and_without)
3074 if (l->buf[l->i] == '=') {
3076 with_and_without >>= 8; // store "with" value
3077 } // else store "without" value
3078 l->t.t = (with_and_without & 0xff);
3080 #define bc_lex_assign(l, with, without) \
3081 bc_lex_assign(l, ((with)<<8)|(without))
3083 static BC_STATUS zbc_lex_comment(BcLex *l)
3086 const char *buf = l->buf;
3088 l->t.t = BC_LEX_WHITESPACE;
3089 i = l->i; /* here buf[l->i] is the '*' of opening comment delimiter */
3101 RETURN_STATUS(bc_error("comment end could not be found"));
3108 G.err_line = l->line;
3110 RETURN_STATUS(BC_STATUS_SUCCESS);
3112 #define zbc_lex_comment(...) (zbc_lex_comment(__VA_ARGS__) COMMA_SUCCESS)
3114 static BC_STATUS zbc_lex_token(BcLex *l)
3116 BcStatus s = BC_STATUS_SUCCESS;
3117 char c = l->buf[l->i++], c2;
3119 // This is the workhorse of the lexer.
3121 // case '\0': // probably never reached
3123 // l->t.t = BC_LEX_EOF;
3124 // l->newline = true;
3127 l->t.t = BC_LEX_NLINE;
3135 bc_lex_whitespace(l);
3138 bc_lex_assign(l, BC_LEX_OP_REL_NE, BC_LEX_OP_BOOL_NOT);
3139 if (l->t.t == BC_LEX_OP_BOOL_NOT) {
3140 s = bc_POSIX_does_not_allow_bool_ops_this_is_bad("!");
3141 IF_ERROR_RETURN_POSSIBLE(if (s) RETURN_STATUS(s));
3145 s = zbc_lex_string(l);
3148 s = bc_POSIX_does_not_allow("'#' script comments");
3149 IF_ERROR_RETURN_POSSIBLE(if (s) RETURN_STATUS(s));
3150 bc_lex_lineComment(l);
3153 bc_lex_assign(l, BC_LEX_OP_ASSIGN_MODULUS, BC_LEX_OP_MODULUS);
3158 s = bc_POSIX_does_not_allow_bool_ops_this_is_bad("&&");
3159 IF_ERROR_RETURN_POSSIBLE(if (s) RETURN_STATUS(s));
3161 l->t.t = BC_LEX_OP_BOOL_AND;
3163 l->t.t = BC_LEX_INVALID;
3164 s = bc_error_bad_character('&');
3169 l->t.t = (BcLexType)(c - '(' + BC_LEX_LPAREN);
3172 bc_lex_assign(l, BC_LEX_OP_ASSIGN_MULTIPLY, BC_LEX_OP_MULTIPLY);
3178 l->t.t = BC_LEX_OP_INC;
3180 bc_lex_assign(l, BC_LEX_OP_ASSIGN_PLUS, BC_LEX_OP_PLUS);
3183 l->t.t = BC_LEX_COMMA;
3189 l->t.t = BC_LEX_OP_DEC;
3191 bc_lex_assign(l, BC_LEX_OP_ASSIGN_MINUS, BC_LEX_OP_MINUS);
3194 if (isdigit(l->buf[l->i]))
3195 s = zbc_lex_number(l, c);
3197 l->t.t = BC_LEX_KEY_LAST;
3198 s = bc_POSIX_does_not_allow("a period ('.') as a shortcut for the last result");
3204 s = zbc_lex_comment(l);
3206 bc_lex_assign(l, BC_LEX_OP_ASSIGN_DIVIDE, BC_LEX_OP_DIVIDE);
3224 s = zbc_lex_number(l, c);
3227 l->t.t = BC_LEX_SCOLON;
3230 bc_lex_assign(l, BC_LEX_OP_REL_LE, BC_LEX_OP_REL_LT);
3233 bc_lex_assign(l, BC_LEX_OP_REL_EQ, BC_LEX_OP_ASSIGN);
3236 bc_lex_assign(l, BC_LEX_OP_REL_GE, BC_LEX_OP_REL_GT);
3240 l->t.t = (BcLexType)(c - '[' + BC_LEX_LBRACKET);
3243 if (l->buf[l->i] == '\n') {
3244 l->t.t = BC_LEX_WHITESPACE;
3247 s = bc_error_bad_character(c);
3250 bc_lex_assign(l, BC_LEX_OP_ASSIGN_POWER, BC_LEX_OP_POWER);
3278 s = zbc_lex_identifier(l);
3282 l->t.t = (BcLexType)(c - '{' + BC_LEX_LBRACE);
3287 s = bc_POSIX_does_not_allow_bool_ops_this_is_bad("||");
3288 IF_ERROR_RETURN_POSSIBLE(if (s) RETURN_STATUS(s));
3290 l->t.t = BC_LEX_OP_BOOL_OR;
3292 l->t.t = BC_LEX_INVALID;
3293 s = bc_error_bad_character(c);
3297 l->t.t = BC_LEX_INVALID;
3298 s = bc_error_bad_character(c);
3307 static BC_STATUS zdc_lex_register(BcLex *l)
3309 if (isspace(l->buf[l->i - 1])) {
3310 bc_lex_whitespace(l);
3313 RETURN_STATUS(bc_error("extended register"));
3317 bc_vec_pop_all(&l->t.v);
3318 bc_vec_push(&l->t.v, &l->buf[l->i - 1]);
3319 bc_vec_pushZeroByte(&l->t.v);
3320 l->t.t = BC_LEX_NAME;
3323 RETURN_STATUS(BC_STATUS_SUCCESS);
3325 #define zdc_lex_register(...) (zdc_lex_register(__VA_ARGS__) COMMA_SUCCESS)
3327 static BC_STATUS zdc_lex_string(BcLex *l)
3329 size_t depth, nls, i;
3331 l->t.t = BC_LEX_STR;
3332 bc_vec_pop_all(&l->t.v);
3341 RETURN_STATUS(bc_error("string end could not be found"));
3344 if (i == l->i || l->buf[i - 1] != '\\') {
3345 if (c == '[') depth++;
3350 bc_vec_push(&l->t.v, &l->buf[i]);
3355 bc_vec_pushZeroByte(&l->t.v);
3356 // This check makes sense only if size_t is (much) larger than BC_MAX_STRING.
3357 if (SIZE_MAX > (BC_MAX_STRING | 0xff)) {
3358 if (i - l->i > BC_MAX_STRING)
3359 RETURN_STATUS(bc_error("string too long: must be [1,"BC_MAX_STRING_STR"]"));
3364 G.err_line = l->line;
3366 RETURN_STATUS(BC_STATUS_SUCCESS);
3368 #define zdc_lex_string(...) (zdc_lex_string(__VA_ARGS__) COMMA_SUCCESS)
3370 static BC_STATUS zdc_lex_token(BcLex *l)
3372 static const //BcLexType - should be this type, but narrower type saves size:
3375 BC_LEX_OP_REL_EQ, BC_LEX_OP_REL_LE, BC_LEX_OP_REL_GE, BC_LEX_OP_REL_NE,
3376 BC_LEX_OP_REL_LT, BC_LEX_OP_REL_GT, BC_LEX_SCOLON, BC_LEX_COLON,
3377 BC_LEX_ELSE, BC_LEX_LOAD, BC_LEX_LOAD_POP, BC_LEX_OP_ASSIGN,
3380 static const //BcLexType - should be this type
3384 BC_LEX_OP_MODULUS, BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_LPAREN,
3386 BC_LEX_INVALID, BC_LEX_OP_MULTIPLY, BC_LEX_OP_PLUS, BC_LEX_INVALID,
3388 BC_LEX_OP_MINUS, BC_LEX_INVALID, BC_LEX_OP_DIVIDE,
3390 BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID,
3391 BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID,
3392 BC_LEX_INVALID, BC_LEX_INVALID,
3394 BC_LEX_COLON, BC_LEX_SCOLON, BC_LEX_OP_REL_GT, BC_LEX_OP_REL_EQ,
3395 BC_LEX_OP_REL_LT, BC_LEX_KEY_READ, BC_LEX_INVALID,
3397 BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID,
3398 BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_EQ_NO_REG, BC_LEX_INVALID,
3400 BC_LEX_KEY_IBASE, BC_LEX_INVALID, BC_LEX_KEY_SCALE, BC_LEX_LOAD_POP,
3401 BC_LEX_INVALID, BC_LEX_OP_BOOL_NOT, BC_LEX_KEY_OBASE, BC_LEX_PRINT_STREAM,
3403 BC_LEX_NQUIT, BC_LEX_POP, BC_LEX_STORE_PUSH, BC_LEX_INVALID, BC_LEX_INVALID,
3404 BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_SCALE_FACTOR, BC_LEX_INVALID,
3406 BC_LEX_KEY_LENGTH, BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID,
3408 BC_LEX_OP_POWER, BC_LEX_NEG, BC_LEX_INVALID,
3410 BC_LEX_ASCIIFY, BC_LEX_INVALID, BC_LEX_CLEAR_STACK, BC_LEX_DUPLICATE,
3411 BC_LEX_ELSE, BC_LEX_PRINT_STACK, BC_LEX_INVALID, BC_LEX_INVALID,
3413 BC_LEX_STORE_IBASE, BC_LEX_INVALID, BC_LEX_STORE_SCALE, BC_LEX_LOAD,
3414 BC_LEX_INVALID, BC_LEX_PRINT_POP, BC_LEX_STORE_OBASE, BC_LEX_KEY_PRINT,
3416 BC_LEX_KEY_QUIT, BC_LEX_SWAP, BC_LEX_OP_ASSIGN, BC_LEX_INVALID,
3417 BC_LEX_INVALID, BC_LEX_KEY_SQRT, BC_LEX_INVALID, BC_LEX_EXECUTE,
3419 BC_LEX_INVALID, BC_LEX_STACK_LEVEL,
3421 BC_LEX_LBRACE, BC_LEX_OP_MODEXP, BC_LEX_INVALID, BC_LEX_OP_DIVMOD,
3424 BcStatus s = BC_STATUS_SUCCESS;
3425 char c = l->buf[l->i++], c2;
3428 for (i = 0; i < ARRAY_SIZE(dc_lex_regs); ++i) {
3429 if (l->t.last == dc_lex_regs[i])
3430 RETURN_STATUS(zdc_lex_register(l));
3433 if (c >= '%' && c <= '~'
3434 && (l->t.t = dc_lex_tokens[c - '%']) != BC_LEX_INVALID
3439 // This is the workhorse of the lexer.
3441 // case '\0': // probably never reached
3442 // l->t.t = BC_LEX_EOF;
3450 l->newline = (c == '\n');
3451 bc_lex_whitespace(l);
3456 l->t.t = BC_LEX_OP_REL_NE;
3458 l->t.t = BC_LEX_OP_REL_LE;
3460 l->t.t = BC_LEX_OP_REL_GE;
3462 RETURN_STATUS(bc_error_bad_character(c));
3466 bc_lex_lineComment(l);
3469 if (isdigit(l->buf[l->i]))
3470 s = zbc_lex_number(l, c);
3472 s = bc_error_bad_character(c);
3490 s = zbc_lex_number(l, c);
3493 s = zdc_lex_string(l);
3496 l->t.t = BC_LEX_INVALID;
3497 s = bc_error_bad_character(c);
3505 static void bc_parse_push(BcParse *p, char i)
3507 dbg_compile("%s:%d pushing bytecode %zd:%d", __func__, __LINE__, p->func->code.len, i);
3508 bc_vec_pushByte(&p->func->code, i);
3511 static void bc_parse_pushName(BcParse *p, char *name)
3514 bc_parse_push(p, *name++);
3515 bc_parse_push(p, BC_PARSE_STREND);
3518 static void bc_parse_pushIndex(BcParse *p, size_t idx)
3523 dbg_lex("%s:%d pushing index %zd", __func__, __LINE__, idx);
3524 mask = ((size_t)0xff) << (sizeof(idx) * 8 - 8);
3527 if (idx & mask) break;
3532 bc_parse_push(p, amt);
3535 bc_parse_push(p, (unsigned char)idx);
3541 static void bc_parse_pushJUMP(BcParse *p, size_t idx)
3543 bc_parse_push(p, BC_INST_JUMP);
3544 bc_parse_pushIndex(p, idx);
3547 static void bc_parse_pushJUMP_ZERO(BcParse *p, size_t idx)
3549 bc_parse_push(p, BC_INST_JUMP_ZERO);
3550 bc_parse_pushIndex(p, idx);
3553 static BC_STATUS bc_parse_pushSTR(BcParse *p)
3555 char *str = xstrdup(p->l.t.v.v);
3557 bc_parse_push(p, BC_INST_STR);
3558 bc_parse_pushIndex(p, p->func->strs.len);
3559 bc_vec_push(&p->func->strs, &str);
3561 RETURN_STATUS(zbc_lex_next(&p->l));
3563 #define bc_parse_pushSTR(...) (bc_parse_pushSTR(__VA_ARGS__) COMMA_SUCCESS)
3566 static void bc_parse_pushNUM(BcParse *p)
3568 char *num = xstrdup(p->l.t.v.v);
3569 #if ENABLE_BC && ENABLE_DC
3570 size_t idx = bc_vec_push(IS_BC ? &p->func->consts : &G.prog.consts, &num);
3572 size_t idx = bc_vec_push(&p->func->consts, &num);
3574 size_t idx = bc_vec_push(&G.prog.consts, &num);
3576 bc_parse_push(p, BC_INST_NUM);
3577 bc_parse_pushIndex(p, idx);
3580 IF_BC(static BC_STATUS zbc_parse_stmt_or_funcdef(BcParse *p);)
3581 IF_DC(static BC_STATUS zdc_parse_parse(BcParse *p);)
3583 // "Parse" half of "parse,execute,repeat" main loop
3584 static BC_STATUS zcommon_parse(BcParse *p)
3587 // FIXME: "eating" of stmt delemiters is coded inconsistently
3588 // (sometimes zbc_parse_stmt() eats the delimiter, sometimes don't),
3589 // which causes bugs such as "print 1 print 2" erroneously accepted,
3590 // or "print 1 else 2" detecting parse error only after executing
3592 IF_BC(RETURN_STATUS(zbc_parse_stmt_or_funcdef(p));)
3594 IF_DC(RETURN_STATUS(zdc_parse_parse(p));)
3596 #define zcommon_parse(...) (zcommon_parse(__VA_ARGS__) COMMA_SUCCESS)
3598 static BC_STATUS zbc_parse_text_init(BcParse *p, const char *text)
3600 p->func = bc_program_func(p->fidx);
3602 RETURN_STATUS(zbc_lex_text_init(&p->l, text));
3604 #define zbc_parse_text_init(...) (zbc_parse_text_init(__VA_ARGS__) COMMA_SUCCESS)
3606 // Called when parsing or execution detects a failure,
3607 // resets execution structures.
3608 static void bc_program_reset(void)
3613 bc_vec_npop(&G.prog.exestack, G.prog.exestack.len - 1);
3614 bc_vec_pop_all(&G.prog.results);
3616 f = bc_program_func_BC_PROG_MAIN();
3617 ip = bc_vec_top(&G.prog.exestack);
3618 ip->inst_idx = f->code.len;
3621 // Called when zbc/zdc_parse_parse() detects a failure,
3622 // resets parsing structures.
3623 static void bc_parse_reset(BcParse *p)
3625 if (p->fidx != BC_PROG_MAIN) {
3626 bc_vec_pop_all(&p->func->code);
3627 IF_BC(bc_vec_pop_all(&p->func->labels);)
3628 IF_BC(bc_vec_pop_all(&p->func->autos);)
3629 IF_BC(p->func->nparams = 0;)
3631 p->fidx = BC_PROG_MAIN;
3632 p->func = bc_program_func_BC_PROG_MAIN();
3636 p->l.t.t = BC_LEX_EOF;
3638 IF_BC(bc_vec_pop_all(&p->exits);)
3639 IF_BC(bc_vec_pop_all(&p->conds);)
3640 IF_BC(bc_vec_pop_all(&p->ops);)
3645 static void bc_parse_free(BcParse *p)
3647 IF_BC(bc_vec_free(&p->exits);)
3648 IF_BC(bc_vec_free(&p->conds);)
3649 IF_BC(bc_vec_free(&p->ops);)
3653 static void bc_parse_create(BcParse *p, size_t fidx)
3655 memset(p, 0, sizeof(BcParse));
3658 IF_BC(bc_vec_init(&p->exits, sizeof(size_t), NULL);)
3659 IF_BC(bc_vec_init(&p->conds, sizeof(size_t), NULL);)
3660 IF_BC(bc_vec_init(&p->ops, sizeof(BcLexType), NULL);)
3663 p->func = bc_program_func(fidx);
3666 static void bc_program_add_fn(void)
3672 bc_vec_push(&G.prog.fns, &f);
3678 // Note: takes ownership of 'name' (must be malloced)
3679 static size_t bc_program_addFunc(char *name)
3682 BcId entry, *entry_ptr;
3686 entry.idx = G.prog.fns.len;
3688 inserted = bc_map_insert(&G.prog.fn_map, &entry, &idx);
3689 if (!inserted) free(name);
3691 entry_ptr = bc_vec_item(&G.prog.fn_map, idx);
3692 idx = entry_ptr->idx;
3695 // There is already a function with this name.
3696 // It'll be redefined now, clear old definition.
3697 BcFunc *func = bc_program_func(entry_ptr->idx);
3701 bc_program_add_fn();
3707 #define BC_PARSE_TOP_OP(p) (*((BcLexType *) bc_vec_top(&(p)->ops)))
3708 #define BC_PARSE_LEAF(p, rparen) \
3709 (((p) >= BC_INST_NUM && (p) <= BC_INST_SQRT) || (rparen) || \
3710 (p) == BC_INST_INC_POST || (p) == BC_INST_DEC_POST)
3712 // We can calculate the conversion between tokens and exprs by subtracting the
3713 // position of the first operator in the lex enum and adding the position of the
3714 // first in the expr enum. Note: This only works for binary operators.
3715 #define BC_TOKEN_2_INST(t) ((char) ((t) - BC_LEX_NEG + BC_INST_NEG))
3717 static BcStatus bc_parse_expr_empty_ok(BcParse *p, uint8_t flags);
3719 static BC_STATUS zbc_parse_expr(BcParse *p, uint8_t flags)
3723 s = bc_parse_expr_empty_ok(p, flags);
3724 if (s == BC_STATUS_PARSE_EMPTY_EXP)
3725 RETURN_STATUS(bc_error("empty expression"));
3728 #define zbc_parse_expr(...) (zbc_parse_expr(__VA_ARGS__) COMMA_SUCCESS)
3730 static BC_STATUS zbc_parse_stmt_possibly_auto(BcParse *p, bool auto_allowed);
3731 #define zbc_parse_stmt_possibly_auto(...) (zbc_parse_stmt_possibly_auto(__VA_ARGS__) COMMA_SUCCESS)
3733 static BC_STATUS zbc_parse_stmt(BcParse *p)
3735 RETURN_STATUS(zbc_parse_stmt_possibly_auto(p, false));
3737 #define zbc_parse_stmt(...) (zbc_parse_stmt(__VA_ARGS__) COMMA_SUCCESS)
3739 static BC_STATUS zbc_parse_stmt_allow_NLINE_before(BcParse *p, const char *after_X)
3741 // "if(cond)<newline>stmt" is accepted too, but not 2+ newlines.
3742 // Same for "else", "while()", "for()".
3743 BcStatus s = zbc_lex_next_and_skip_NLINE(&p->l);
3744 if (s) RETURN_STATUS(s);
3745 if (p->l.t.t == BC_LEX_NLINE)
3746 RETURN_STATUS(bc_error_fmt("no statement after '%s'", after_X));
3748 RETURN_STATUS(zbc_parse_stmt(p));
3750 #define zbc_parse_stmt_allow_NLINE_before(...) (zbc_parse_stmt_allow_NLINE_before(__VA_ARGS__) COMMA_SUCCESS)
3752 static void bc_parse_operator(BcParse *p, BcLexType type, size_t start,
3755 char l, r = bc_parse_op_PREC(type - BC_LEX_OP_INC);
3756 bool left = bc_parse_op_LEFT(type - BC_LEX_OP_INC);
3758 while (p->ops.len > start) {
3759 BcLexType t = BC_PARSE_TOP_OP(p);
3760 if (t == BC_LEX_LPAREN) break;
3762 l = bc_parse_op_PREC(t - BC_LEX_OP_INC);
3763 if (l >= r && (l != r || !left)) break;
3765 bc_parse_push(p, BC_TOKEN_2_INST(t));
3766 bc_vec_pop(&p->ops);
3767 *nexprs -= (t != BC_LEX_OP_BOOL_NOT && t != BC_LEX_NEG);
3770 bc_vec_push(&p->ops, &type);
3773 static BC_STATUS zbc_parse_rightParen(BcParse *p, size_t ops_bgn, size_t *nexs)
3777 if (p->ops.len <= ops_bgn)
3778 RETURN_STATUS(bc_error_bad_expression());
3779 top = BC_PARSE_TOP_OP(p);
3781 while (top != BC_LEX_LPAREN) {
3782 bc_parse_push(p, BC_TOKEN_2_INST(top));
3784 bc_vec_pop(&p->ops);
3785 *nexs -= top != BC_LEX_OP_BOOL_NOT && top != BC_LEX_NEG;
3787 if (p->ops.len <= ops_bgn)
3788 RETURN_STATUS(bc_error_bad_expression());
3789 top = BC_PARSE_TOP_OP(p);
3792 bc_vec_pop(&p->ops);
3794 RETURN_STATUS(zbc_lex_next(&p->l));
3796 #define zbc_parse_rightParen(...) (zbc_parse_rightParen(__VA_ARGS__) COMMA_SUCCESS)
3798 static BC_STATUS zbc_parse_params(BcParse *p, uint8_t flags)
3803 dbg_lex("%s:%d p->l.t.t:%d", __func__, __LINE__, p->l.t.t);
3804 flags = (flags & ~(BC_PARSE_PRINT | BC_PARSE_REL)) | BC_PARSE_ARRAY;
3806 s = zbc_lex_next(&p->l);
3807 if (s) RETURN_STATUS(s);
3810 if (p->l.t.t != BC_LEX_RPAREN) {
3812 s = zbc_parse_expr(p, flags);
3813 if (s) RETURN_STATUS(s);
3815 if (p->l.t.t != BC_LEX_COMMA) {
3816 if (p->l.t.t == BC_LEX_RPAREN)
3818 RETURN_STATUS(bc_error_bad_token());
3820 s = zbc_lex_next(&p->l);
3821 if (s) RETURN_STATUS(s);
3825 bc_parse_push(p, BC_INST_CALL);
3826 bc_parse_pushIndex(p, nparams);
3828 RETURN_STATUS(BC_STATUS_SUCCESS);
3830 #define zbc_parse_params(...) (zbc_parse_params(__VA_ARGS__) COMMA_SUCCESS)
3832 // Note: takes ownership of 'name' (must be malloced)
3833 static BC_STATUS zbc_parse_call(BcParse *p, char *name, uint8_t flags)
3836 BcId entry, *entry_ptr;
3841 s = zbc_parse_params(p, flags);
3844 if (p->l.t.t != BC_LEX_RPAREN) {
3845 s = bc_error_bad_token();
3849 idx = bc_map_find_exact(&G.prog.fn_map, &entry);
3851 if (idx == BC_VEC_INVALID_IDX) {
3852 // No such function exists, create an empty one
3853 bc_program_addFunc(name);
3854 idx = bc_map_find_exact(&G.prog.fn_map, &entry);
3858 entry_ptr = bc_vec_item(&G.prog.fn_map, idx);
3859 bc_parse_pushIndex(p, entry_ptr->idx);
3861 RETURN_STATUS(zbc_lex_next(&p->l));
3866 #define zbc_parse_call(...) (zbc_parse_call(__VA_ARGS__) COMMA_SUCCESS)
3868 static BC_STATUS zbc_parse_name(BcParse *p, BcInst *type, uint8_t flags)
3873 name = xstrdup(p->l.t.v.v);
3874 s = zbc_lex_next(&p->l);
3877 if (p->l.t.t == BC_LEX_LBRACKET) {
3878 s = zbc_lex_next(&p->l);
3881 if (p->l.t.t == BC_LEX_RBRACKET) {
3882 if (!(flags & BC_PARSE_ARRAY)) {
3883 s = bc_error_bad_expression();
3886 *type = BC_INST_ARRAY;
3888 *type = BC_INST_ARRAY_ELEM;
3889 flags &= ~(BC_PARSE_PRINT | BC_PARSE_REL);
3890 s = zbc_parse_expr(p, flags);
3893 s = zbc_lex_next(&p->l);
3895 bc_parse_push(p, *type);
3896 bc_parse_pushName(p, name);
3898 } else if (p->l.t.t == BC_LEX_LPAREN) {
3899 if (flags & BC_PARSE_NOCALL) {
3900 s = bc_error_bad_token();
3903 *type = BC_INST_CALL;
3904 s = zbc_parse_call(p, name, flags);
3906 *type = BC_INST_VAR;
3907 bc_parse_push(p, BC_INST_VAR);
3908 bc_parse_pushName(p, name);
3917 #define zbc_parse_name(...) (zbc_parse_name(__VA_ARGS__) COMMA_SUCCESS)
3919 static BC_STATUS zbc_parse_read(BcParse *p)
3923 s = zbc_lex_next(&p->l);
3924 if (s) RETURN_STATUS(s);
3925 if (p->l.t.t != BC_LEX_LPAREN) RETURN_STATUS(bc_error_bad_token());
3927 s = zbc_lex_next(&p->l);
3928 if (s) RETURN_STATUS(s);
3929 if (p->l.t.t != BC_LEX_RPAREN) RETURN_STATUS(bc_error_bad_token());
3931 bc_parse_push(p, BC_INST_READ);
3933 RETURN_STATUS(zbc_lex_next(&p->l));
3935 #define zbc_parse_read(...) (zbc_parse_read(__VA_ARGS__) COMMA_SUCCESS)
3937 static BC_STATUS zbc_parse_builtin(BcParse *p, BcLexType type, uint8_t flags,
3942 s = zbc_lex_next(&p->l);
3943 if (s) RETURN_STATUS(s);
3944 if (p->l.t.t != BC_LEX_LPAREN) RETURN_STATUS(bc_error_bad_token());
3946 flags = (flags & ~(BC_PARSE_PRINT | BC_PARSE_REL)) | BC_PARSE_ARRAY;
3948 s = zbc_lex_next(&p->l);
3949 if (s) RETURN_STATUS(s);
3951 s = zbc_parse_expr(p, flags);
3952 if (s) RETURN_STATUS(s);
3954 if (p->l.t.t != BC_LEX_RPAREN) RETURN_STATUS(bc_error_bad_token());
3956 *prev = (type == BC_LEX_KEY_LENGTH) ? BC_INST_LENGTH : BC_INST_SQRT;
3957 bc_parse_push(p, *prev);
3959 RETURN_STATUS(zbc_lex_next(&p->l));
3961 #define zbc_parse_builtin(...) (zbc_parse_builtin(__VA_ARGS__) COMMA_SUCCESS)
3963 static BC_STATUS zbc_parse_scale(BcParse *p, BcInst *type, uint8_t flags)
3967 s = zbc_lex_next(&p->l);
3968 if (s) RETURN_STATUS(s);
3970 if (p->l.t.t != BC_LEX_LPAREN) {
3971 *type = BC_INST_SCALE;
3972 bc_parse_push(p, BC_INST_SCALE);
3973 RETURN_STATUS(BC_STATUS_SUCCESS);
3976 *type = BC_INST_SCALE_FUNC;
3977 flags &= ~(BC_PARSE_PRINT | BC_PARSE_REL);
3979 s = zbc_lex_next(&p->l);
3980 if (s) RETURN_STATUS(s);
3982 s = zbc_parse_expr(p, flags);
3983 if (s) RETURN_STATUS(s);
3984 if (p->l.t.t != BC_LEX_RPAREN)
3985 RETURN_STATUS(bc_error_bad_token());
3986 bc_parse_push(p, BC_INST_SCALE_FUNC);
3988 RETURN_STATUS(zbc_lex_next(&p->l));
3990 #define zbc_parse_scale(...) (zbc_parse_scale(__VA_ARGS__) COMMA_SUCCESS)
3992 static BC_STATUS zbc_parse_incdec(BcParse *p, BcInst *prev, bool *paren_expr,
3993 size_t *nexprs, uint8_t flags)
3998 BcInst etype = *prev;
4000 if (etype == BC_INST_VAR || etype == BC_INST_ARRAY_ELEM
4001 || etype == BC_INST_SCALE || etype == BC_INST_LAST
4002 || etype == BC_INST_IBASE || etype == BC_INST_OBASE
4004 *prev = inst = BC_INST_INC_POST + (p->l.t.t != BC_LEX_OP_INC);
4005 bc_parse_push(p, inst);
4006 s = zbc_lex_next(&p->l);
4008 *prev = inst = BC_INST_INC_PRE + (p->l.t.t != BC_LEX_OP_INC);
4011 s = zbc_lex_next(&p->l);
4012 if (s) RETURN_STATUS(s);
4015 // Because we parse the next part of the expression
4016 // right here, we need to increment this.
4017 *nexprs = *nexprs + 1;
4021 s = zbc_parse_name(p, prev, flags | BC_PARSE_NOCALL);
4023 case BC_LEX_KEY_IBASE:
4024 case BC_LEX_KEY_LAST:
4025 case BC_LEX_KEY_OBASE:
4026 bc_parse_push(p, type - BC_LEX_KEY_IBASE + BC_INST_IBASE);
4027 s = zbc_lex_next(&p->l);
4029 case BC_LEX_KEY_SCALE:
4030 s = zbc_lex_next(&p->l);
4031 if (s) RETURN_STATUS(s);
4032 if (p->l.t.t == BC_LEX_LPAREN)
4033 s = bc_error_bad_token();
4035 bc_parse_push(p, BC_INST_SCALE);
4038 s = bc_error_bad_token();
4042 if (!s) bc_parse_push(p, inst);
4047 #define zbc_parse_incdec(...) (zbc_parse_incdec(__VA_ARGS__) COMMA_SUCCESS)
4049 static BC_STATUS zbc_parse_minus(BcParse *p, BcInst *prev, size_t ops_bgn,
4050 bool rparen, size_t *nexprs)
4054 BcInst etype = *prev;
4056 s = zbc_lex_next(&p->l);
4057 if (s) RETURN_STATUS(s);
4059 type = rparen || etype == BC_INST_INC_POST || etype == BC_INST_DEC_POST ||
4060 (etype >= BC_INST_NUM && etype <= BC_INST_SQRT) ?
4063 *prev = BC_TOKEN_2_INST(type);
4065 // We can just push onto the op stack because this is the largest
4066 // precedence operator that gets pushed. Inc/dec does not.
4067 if (type != BC_LEX_OP_MINUS)
4068 bc_vec_push(&p->ops, &type);
4070 bc_parse_operator(p, type, ops_bgn, nexprs);
4074 #define zbc_parse_minus(...) (zbc_parse_minus(__VA_ARGS__) COMMA_SUCCESS)
4076 static BC_STATUS zbc_parse_print(BcParse *p)
4082 s = zbc_lex_next(&p->l);
4083 if (s) RETURN_STATUS(s);
4085 if (type == BC_LEX_STR) {
4086 s = bc_parse_pushSTR(p);
4088 s = zbc_parse_expr(p, 0);
4090 if (s) RETURN_STATUS(s);
4091 bc_parse_push(p, BC_INST_PRINT_POP);
4092 if (p->l.t.t != BC_LEX_COMMA)
4098 #define zbc_parse_print(...) (zbc_parse_print(__VA_ARGS__) COMMA_SUCCESS)
4100 static BC_STATUS zbc_parse_return(BcParse *p)
4105 dbg_lex_enter("%s:%d entered", __func__, __LINE__);
4106 s = zbc_lex_next(&p->l);
4107 if (s) RETURN_STATUS(s);
4110 if (t == BC_LEX_NLINE || t == BC_LEX_SCOLON)
4111 bc_parse_push(p, BC_INST_RET0);
4113 bool paren = (t == BC_LEX_LPAREN);
4114 s = bc_parse_expr_empty_ok(p, 0);
4115 if (s == BC_STATUS_PARSE_EMPTY_EXP) {
4116 bc_parse_push(p, BC_INST_RET0);
4117 s = zbc_lex_next(&p->l);
4119 if (s) RETURN_STATUS(s);
4121 if (!paren || p->l.t.last != BC_LEX_RPAREN) {
4122 s = bc_POSIX_requires("parentheses around return expressions");
4123 IF_ERROR_RETURN_POSSIBLE(if (s) RETURN_STATUS(s));
4126 bc_parse_push(p, BC_INST_RET);
4129 dbg_lex_done("%s:%d done", __func__, __LINE__);
4132 #define zbc_parse_return(...) (zbc_parse_return(__VA_ARGS__) COMMA_SUCCESS)
4134 static void rewrite_label_to_current(BcParse *p, size_t idx)
4136 size_t *label = bc_vec_item(&p->func->labels, idx);
4137 *label = p->func->code.len;
4140 static BC_STATUS zbc_parse_if(BcParse *p)
4145 dbg_lex_enter("%s:%d entered", __func__, __LINE__);
4146 s = zbc_lex_next(&p->l);
4147 if (s) RETURN_STATUS(s);
4148 if (p->l.t.t != BC_LEX_LPAREN) RETURN_STATUS(bc_error_bad_token());
4150 s = zbc_lex_next(&p->l);
4151 if (s) RETURN_STATUS(s);
4152 s = zbc_parse_expr(p, BC_PARSE_REL);
4153 if (s) RETURN_STATUS(s);
4154 if (p->l.t.t != BC_LEX_RPAREN) RETURN_STATUS(bc_error_bad_token());
4156 // Encode "if zero, jump to ..."
4157 // Pushed value (destination of the jump) is uninitialized,
4158 // will be rewritten to be address of "end of if()" or of "else".
4159 ip_idx = bc_vec_push(&p->func->labels, &ip_idx);
4160 bc_parse_pushJUMP_ZERO(p, ip_idx);
4162 s = zbc_parse_stmt_allow_NLINE_before(p, STRING_if);
4163 if (s) RETURN_STATUS(s);
4165 dbg_lex("%s:%d in if after stmt: p->l.t.t:%d", __func__, __LINE__, p->l.t.t);
4166 if (p->l.t.t == BC_LEX_KEY_ELSE) {
4169 // Encode "after then_stmt, jump to end of if()"
4170 ip2_idx = bc_vec_push(&p->func->labels, &ip2_idx);
4171 dbg_lex("%s:%d after if() then_stmt: BC_INST_JUMP to %zd", __func__, __LINE__, ip2_idx);
4172 bc_parse_pushJUMP(p, ip2_idx);
4174 dbg_lex("%s:%d rewriting 'if_zero' label to jump to 'else'-> %zd", __func__, __LINE__, p->func->code.len);
4175 rewrite_label_to_current(p, ip_idx);
4179 s = zbc_parse_stmt_allow_NLINE_before(p, STRING_else);
4180 if (s) RETURN_STATUS(s);
4183 dbg_lex("%s:%d rewriting label to jump after 'if' body-> %zd", __func__, __LINE__, p->func->code.len);
4184 rewrite_label_to_current(p, ip_idx);
4186 dbg_lex_done("%s:%d done", __func__, __LINE__);
4189 #define zbc_parse_if(...) (zbc_parse_if(__VA_ARGS__) COMMA_SUCCESS)
4191 static BC_STATUS zbc_parse_while(BcParse *p)
4197 s = zbc_lex_next(&p->l);
4198 if (s) RETURN_STATUS(s);
4199 if (p->l.t.t != BC_LEX_LPAREN) RETURN_STATUS(bc_error_bad_token());
4200 s = zbc_lex_next(&p->l);
4201 if (s) RETURN_STATUS(s);
4203 cond_idx = bc_vec_push(&p->func->labels, &p->func->code.len);
4204 ip_idx = cond_idx + 1;
4205 bc_vec_push(&p->conds, &cond_idx);
4207 bc_vec_push(&p->exits, &ip_idx);
4208 bc_vec_push(&p->func->labels, &ip_idx);
4210 s = zbc_parse_expr(p, BC_PARSE_REL);
4211 if (s) RETURN_STATUS(s);
4212 if (p->l.t.t != BC_LEX_RPAREN) RETURN_STATUS(bc_error_bad_token());
4214 bc_parse_pushJUMP_ZERO(p, ip_idx);
4216 s = zbc_parse_stmt_allow_NLINE_before(p, STRING_while);
4217 if (s) RETURN_STATUS(s);
4219 dbg_lex("%s:%d BC_INST_JUMP to %zd", __func__, __LINE__, cond_idx);
4220 bc_parse_pushJUMP(p, cond_idx);
4222 dbg_lex("%s:%d rewriting label-> %zd", __func__, __LINE__, p->func->code.len);
4223 rewrite_label_to_current(p, ip_idx);
4225 bc_vec_pop(&p->exits);
4226 bc_vec_pop(&p->conds);
4230 #define zbc_parse_while(...) (zbc_parse_while(__VA_ARGS__) COMMA_SUCCESS)
4232 static BC_STATUS zbc_parse_for(BcParse *p)
4235 size_t cond_idx, exit_idx, body_idx, update_idx;
4237 dbg_lex("%s:%d p->l.t.t:%d", __func__, __LINE__, p->l.t.t);
4238 s = zbc_lex_next(&p->l);
4239 if (s) RETURN_STATUS(s);
4240 if (p->l.t.t != BC_LEX_LPAREN) RETURN_STATUS(bc_error_bad_token());
4241 s = zbc_lex_next(&p->l);
4242 if (s) RETURN_STATUS(s);
4244 if (p->l.t.t != BC_LEX_SCOLON) {
4245 s = zbc_parse_expr(p, 0);
4246 bc_parse_push(p, BC_INST_POP);
4247 if (s) RETURN_STATUS(s);
4249 s = bc_POSIX_does_not_allow_empty_X_expression_in_for("init");
4250 IF_ERROR_RETURN_POSSIBLE(if (s) RETURN_STATUS(s);)
4253 if (p->l.t.t != BC_LEX_SCOLON) RETURN_STATUS(bc_error_bad_token());
4254 s = zbc_lex_next(&p->l);
4255 if (s) RETURN_STATUS(s);
4257 cond_idx = bc_vec_push(&p->func->labels, &p->func->code.len);
4258 update_idx = cond_idx + 1;
4259 body_idx = update_idx + 1;
4260 exit_idx = body_idx + 1;
4262 if (p->l.t.t != BC_LEX_SCOLON)
4263 s = zbc_parse_expr(p, BC_PARSE_REL);
4265 // Set this for the next call to bc_parse_pushNUM().
4266 // This is safe to set because the current token is a semicolon,
4267 // which has no string requirement.
4268 bc_vec_string(&p->l.t.v, 1, "1");
4269 bc_parse_pushNUM(p);
4270 s = bc_POSIX_does_not_allow_empty_X_expression_in_for("condition");
4272 if (s) RETURN_STATUS(s);
4274 if (p->l.t.t != BC_LEX_SCOLON) RETURN_STATUS(bc_error_bad_token());
4276 s = zbc_lex_next(&p->l);
4277 if (s) RETURN_STATUS(s);
4279 bc_parse_pushJUMP_ZERO(p, exit_idx);
4280 bc_parse_pushJUMP(p, body_idx);
4282 bc_vec_push(&p->conds, &update_idx);
4283 bc_vec_push(&p->func->labels, &p->func->code.len);
4285 if (p->l.t.t != BC_LEX_RPAREN) {
4286 s = zbc_parse_expr(p, 0);
4287 if (s) RETURN_STATUS(s);
4288 if (p->l.t.t != BC_LEX_RPAREN) RETURN_STATUS(bc_error_bad_token());
4289 bc_parse_push(p, BC_INST_POP);
4291 s = bc_POSIX_does_not_allow_empty_X_expression_in_for("update");
4292 IF_ERROR_RETURN_POSSIBLE(if (s) RETURN_STATUS(s);)
4295 bc_parse_pushJUMP(p, cond_idx);
4296 bc_vec_push(&p->func->labels, &p->func->code.len);
4298 bc_vec_push(&p->exits, &exit_idx);
4299 bc_vec_push(&p->func->labels, &exit_idx);
4301 s = zbc_parse_stmt_allow_NLINE_before(p, STRING_for);
4302 if (s) RETURN_STATUS(s);
4304 dbg_lex("%s:%d BC_INST_JUMP to %zd", __func__, __LINE__, update_idx);
4305 bc_parse_pushJUMP(p, update_idx);
4307 dbg_lex("%s:%d rewriting label-> %zd", __func__, __LINE__, p->func->code.len);
4308 rewrite_label_to_current(p, exit_idx);
4310 bc_vec_pop(&p->exits);
4311 bc_vec_pop(&p->conds);
4313 RETURN_STATUS(BC_STATUS_SUCCESS);
4315 #define zbc_parse_for(...) (zbc_parse_for(__VA_ARGS__) COMMA_SUCCESS)
4317 static BC_STATUS zbc_parse_break_or_continue(BcParse *p, BcLexType type)
4322 if (type == BC_LEX_KEY_BREAK) {
4323 if (p->exits.len == 0) // none of the enclosing blocks is a loop
4324 RETURN_STATUS(bc_error_bad_token());
4325 i = *(size_t*)bc_vec_top(&p->exits);
4327 i = *(size_t*)bc_vec_top(&p->conds);
4330 bc_parse_pushJUMP(p, i);
4332 s = zbc_lex_next(&p->l);
4333 if (s) RETURN_STATUS(s);
4335 if (p->l.t.t != BC_LEX_SCOLON && p->l.t.t != BC_LEX_NLINE)
4336 RETURN_STATUS(bc_error_bad_token());
4338 RETURN_STATUS(zbc_lex_next(&p->l));
4340 #define zbc_parse_break_or_continue(...) (zbc_parse_break_or_continue(__VA_ARGS__) COMMA_SUCCESS)
4342 static BC_STATUS zbc_parse_funcdef(BcParse *p)
4345 bool var, comma = false;
4348 dbg_lex_enter("%s:%d entered", __func__, __LINE__);
4349 s = zbc_lex_next(&p->l);
4350 if (s) RETURN_STATUS(s);
4351 if (p->l.t.t != BC_LEX_NAME)
4352 RETURN_STATUS(bc_error("bad function definition"));
4354 name = xstrdup(p->l.t.v.v);
4355 p->fidx = bc_program_addFunc(name);
4356 p->func = bc_program_func(p->fidx);
4358 s = zbc_lex_next(&p->l);
4359 if (s) RETURN_STATUS(s);
4360 if (p->l.t.t != BC_LEX_LPAREN)
4361 RETURN_STATUS(bc_error("bad function definition"));
4362 s = zbc_lex_next(&p->l);
4363 if (s) RETURN_STATUS(s);
4365 while (p->l.t.t != BC_LEX_RPAREN) {
4366 if (p->l.t.t != BC_LEX_NAME)
4367 RETURN_STATUS(bc_error("bad function definition"));
4371 name = xstrdup(p->l.t.v.v);
4372 s = zbc_lex_next(&p->l);
4375 var = p->l.t.t != BC_LEX_LBRACKET;
4378 s = zbc_lex_next(&p->l);
4381 if (p->l.t.t != BC_LEX_RBRACKET) {
4382 s = bc_error("bad function definition");
4386 s = zbc_lex_next(&p->l);
4390 comma = p->l.t.t == BC_LEX_COMMA;
4392 s = zbc_lex_next(&p->l);
4396 s = zbc_func_insert(p->func, name, var);
4400 if (comma) RETURN_STATUS(bc_error("bad function definition"));
4402 s = zbc_lex_next(&p->l);
4403 if (s) RETURN_STATUS(s);
4405 if (p->l.t.t != BC_LEX_LBRACE)
4406 s = bc_POSIX_requires("the left brace be on the same line as the function header");
4408 // Prevent "define z()<newline>" from being interpreted as function with empty stmt as body
4409 s = zbc_lex_skip_if_at_NLINE(&p->l);
4410 if (s) RETURN_STATUS(s);
4411 //GNU bc requires a {} block even if function body has single stmt, enforce this?
4412 if (p->l.t.t != BC_LEX_LBRACE)
4413 RETURN_STATUS(bc_error("function { body } expected"));
4415 p->in_funcdef++; // to determine whether "return" stmt is allowed, and such
4416 s = zbc_parse_stmt_possibly_auto(p, true);
4418 if (s) RETURN_STATUS(s);
4420 bc_parse_push(p, BC_INST_RET0);
4422 // Subsequent code generation is into main program
4423 p->fidx = BC_PROG_MAIN;
4424 p->func = bc_program_func_BC_PROG_MAIN();
4426 dbg_lex_done("%s:%d done", __func__, __LINE__);
4429 dbg_lex_done("%s:%d done (error)", __func__, __LINE__);
4433 #define zbc_parse_funcdef(...) (zbc_parse_funcdef(__VA_ARGS__) COMMA_SUCCESS)
4435 static BC_STATUS zbc_parse_auto(BcParse *p)
4438 bool comma, var, one;
4441 dbg_lex_enter("%s:%d entered", __func__, __LINE__);
4442 s = zbc_lex_next(&p->l);
4443 if (s) RETURN_STATUS(s);
4446 one = p->l.t.t == BC_LEX_NAME;
4448 while (p->l.t.t == BC_LEX_NAME) {
4449 name = xstrdup(p->l.t.v.v);
4450 s = zbc_lex_next(&p->l);
4453 var = p->l.t.t != BC_LEX_LBRACKET;
4455 s = zbc_lex_next(&p->l);
4458 if (p->l.t.t != BC_LEX_RBRACKET) {
4459 s = bc_error("bad function definition");
4463 s = zbc_lex_next(&p->l);
4467 comma = p->l.t.t == BC_LEX_COMMA;
4469 s = zbc_lex_next(&p->l);
4473 s = zbc_func_insert(p->func, name, var);
4477 if (comma) RETURN_STATUS(bc_error("bad function definition"));
4478 if (!one) RETURN_STATUS(bc_error("no auto variable found"));
4480 if (p->l.t.t != BC_LEX_NLINE && p->l.t.t != BC_LEX_SCOLON)
4481 RETURN_STATUS(bc_error_bad_token());
4483 dbg_lex_done("%s:%d done", __func__, __LINE__);
4484 RETURN_STATUS(zbc_lex_next(&p->l));
4487 dbg_lex_done("%s:%d done (ERROR)", __func__, __LINE__);
4490 #define zbc_parse_auto(...) (zbc_parse_auto(__VA_ARGS__) COMMA_SUCCESS)
4492 #undef zbc_parse_stmt_possibly_auto
4493 static BC_STATUS zbc_parse_stmt_possibly_auto(BcParse *p, bool auto_allowed)
4495 BcStatus s = BC_STATUS_SUCCESS;
4497 dbg_lex_enter("%s:%d entered, p->l.t.t:%d", __func__, __LINE__, p->l.t.t);
4499 if (p->l.t.t == BC_LEX_NLINE) {
4500 dbg_lex_done("%s:%d done (seen BC_LEX_NLINE)", __func__, __LINE__);
4501 RETURN_STATUS(zbc_lex_next(&p->l));
4503 if (p->l.t.t == BC_LEX_SCOLON) {
4504 dbg_lex_done("%s:%d done (seen BC_LEX_SCOLON)", __func__, __LINE__);
4505 RETURN_STATUS(zbc_lex_next(&p->l));
4508 if (p->l.t.t == BC_LEX_LBRACE) {
4509 dbg_lex("%s:%d BC_LEX_LBRACE: (auto_allowed:%d)", __func__, __LINE__, auto_allowed);
4511 s = zbc_lex_next(&p->l);
4512 if (s) RETURN_STATUS(s);
4513 } while (p->l.t.t == BC_LEX_NLINE);
4514 if (auto_allowed && p->l.t.t == BC_LEX_KEY_AUTO) {
4515 dbg_lex("%s:%d calling zbc_parse_auto()", __func__, __LINE__);
4516 s = zbc_parse_auto(p);
4517 if (s) RETURN_STATUS(s);
4519 while (p->l.t.t != BC_LEX_RBRACE) {
4520 dbg_lex("%s:%d block parsing loop", __func__, __LINE__);
4521 s = zbc_parse_stmt(p);
4522 if (s) RETURN_STATUS(s);
4524 s = zbc_lex_next(&p->l);
4525 dbg_lex_done("%s:%d done (seen BC_LEX_RBRACE)", __func__, __LINE__);
4529 dbg_lex("%s:%d p->l.t.t:%d", __func__, __LINE__, p->l.t.t);
4533 case BC_LEX_OP_MINUS:
4534 case BC_LEX_OP_BOOL_NOT:
4538 case BC_LEX_KEY_IBASE:
4539 case BC_LEX_KEY_LAST:
4540 case BC_LEX_KEY_LENGTH:
4541 case BC_LEX_KEY_OBASE:
4542 case BC_LEX_KEY_READ:
4543 case BC_LEX_KEY_SCALE:
4544 case BC_LEX_KEY_SQRT:
4545 s = zbc_parse_expr(p, BC_PARSE_PRINT);
4548 s = bc_parse_pushSTR(p);
4549 bc_parse_push(p, BC_INST_PRINT_STR);
4551 case BC_LEX_KEY_BREAK:
4552 case BC_LEX_KEY_CONTINUE:
4553 s = zbc_parse_break_or_continue(p, p->l.t.t);
4555 case BC_LEX_KEY_FOR:
4556 s = zbc_parse_for(p);
4558 case BC_LEX_KEY_HALT:
4559 bc_parse_push(p, BC_INST_HALT);
4560 s = zbc_lex_next(&p->l);
4563 s = zbc_parse_if(p);
4565 case BC_LEX_KEY_LIMITS:
4566 // "limits" is a compile-time command,
4567 // the output is produced at _parse time_.
4569 "BC_BASE_MAX = "BC_MAX_OBASE_STR "\n"
4570 "BC_DIM_MAX = "BC_MAX_DIM_STR "\n"
4571 "BC_SCALE_MAX = "BC_MAX_SCALE_STR "\n"
4572 "BC_STRING_MAX = "BC_MAX_STRING_STR"\n"
4573 "BC_NAME_MAX = "BC_MAX_NAME_STR "\n"
4574 "BC_NUM_MAX = "BC_MAX_NUM_STR "\n"
4575 "MAX Exponent = "BC_MAX_EXP_STR "\n"
4576 "Number of vars = "BC_MAX_VARS_STR "\n"
4578 s = zbc_lex_next(&p->l);
4580 case BC_LEX_KEY_PRINT:
4581 s = zbc_parse_print(p);
4583 case BC_LEX_KEY_QUIT:
4584 // "quit" is a compile-time command. For example,
4585 // "if (0 == 1) quit" terminates when parsing the statement,
4586 // not when it is executed
4587 QUIT_OR_RETURN_TO_MAIN;
4588 case BC_LEX_KEY_RETURN:
4590 RETURN_STATUS(bc_error("'return' not in a function"));
4591 s = zbc_parse_return(p);
4593 case BC_LEX_KEY_WHILE:
4594 s = zbc_parse_while(p);
4597 s = bc_error_bad_token();
4601 if (s || G_interrupt) {
4603 s = BC_STATUS_FAILURE;
4606 dbg_lex_done("%s:%d done", __func__, __LINE__);
4609 #define zbc_parse_stmt_possibly_auto(...) (zbc_parse_stmt_possibly_auto(__VA_ARGS__) COMMA_SUCCESS)
4611 static BC_STATUS zbc_parse_stmt_or_funcdef(BcParse *p)
4615 dbg_lex_enter("%s:%d entered", __func__, __LINE__);
4616 if (p->l.t.t == BC_LEX_EOF)
4617 s = bc_error("end of file");
4618 else if (p->l.t.t == BC_LEX_KEY_DEFINE) {
4619 dbg_lex("%s:%d p->l.t.t:BC_LEX_KEY_DEFINE", __func__, __LINE__);
4620 s = zbc_parse_funcdef(p);
4622 dbg_lex("%s:%d p->l.t.t:%d (not BC_LEX_KEY_DEFINE)", __func__, __LINE__, p->l.t.t);
4623 s = zbc_parse_stmt(p);
4626 dbg_lex_done("%s:%d done", __func__, __LINE__);
4629 #define zbc_parse_stmt_or_funcdef(...) (zbc_parse_stmt_or_funcdef(__VA_ARGS__) COMMA_SUCCESS)
4631 // This is not a "z" function: can also return BC_STATUS_PARSE_EMPTY_EXP
4632 static BcStatus bc_parse_expr_empty_ok(BcParse *p, uint8_t flags)
4634 BcStatus s = BC_STATUS_SUCCESS;
4635 BcInst prev = BC_INST_PRINT;
4636 BcLexType top, t = p->l.t.t;
4637 size_t nexprs = 0, ops_bgn = p->ops.len;
4638 unsigned nparens, nrelops;
4639 bool paren_first, paren_expr, rprn, done, get_token, assign, bin_last;
4641 dbg_lex_enter("%s:%d entered", __func__, __LINE__);
4642 paren_first = p->l.t.t == BC_LEX_LPAREN;
4643 nparens = nrelops = 0;
4644 paren_expr = rprn = done = get_token = assign = false;
4647 for (; !G_interrupt && !s && !done && bc_parse_exprs(t); t = p->l.t.t) {
4651 s = zbc_parse_incdec(p, &prev, &paren_expr, &nexprs, flags);
4652 rprn = get_token = bin_last = false;
4654 case BC_LEX_OP_MINUS:
4655 s = zbc_parse_minus(p, &prev, ops_bgn, rprn, &nexprs);
4656 rprn = get_token = false;
4657 bin_last = prev == BC_INST_MINUS;
4659 case BC_LEX_OP_ASSIGN_POWER:
4660 case BC_LEX_OP_ASSIGN_MULTIPLY:
4661 case BC_LEX_OP_ASSIGN_DIVIDE:
4662 case BC_LEX_OP_ASSIGN_MODULUS:
4663 case BC_LEX_OP_ASSIGN_PLUS:
4664 case BC_LEX_OP_ASSIGN_MINUS:
4665 case BC_LEX_OP_ASSIGN:
4666 if (prev != BC_INST_VAR && prev != BC_INST_ARRAY_ELEM
4667 && prev != BC_INST_SCALE && prev != BC_INST_IBASE
4668 && prev != BC_INST_OBASE && prev != BC_INST_LAST
4670 s = bc_error("bad assignment:"
4671 " left side must be variable"
4673 ); // note: shared string
4677 case BC_LEX_OP_POWER:
4678 case BC_LEX_OP_MULTIPLY:
4679 case BC_LEX_OP_DIVIDE:
4680 case BC_LEX_OP_MODULUS:
4681 case BC_LEX_OP_PLUS:
4682 case BC_LEX_OP_REL_EQ:
4683 case BC_LEX_OP_REL_LE:
4684 case BC_LEX_OP_REL_GE:
4685 case BC_LEX_OP_REL_NE:
4686 case BC_LEX_OP_REL_LT:
4687 case BC_LEX_OP_REL_GT:
4688 case BC_LEX_OP_BOOL_NOT:
4689 case BC_LEX_OP_BOOL_OR:
4690 case BC_LEX_OP_BOOL_AND:
4691 if (((t == BC_LEX_OP_BOOL_NOT) != bin_last)
4692 || (t != BC_LEX_OP_BOOL_NOT && prev == BC_INST_BOOL_NOT)
4694 return bc_error_bad_expression();
4696 nrelops += t >= BC_LEX_OP_REL_EQ && t <= BC_LEX_OP_REL_GT;
4697 prev = BC_TOKEN_2_INST(t);
4698 bc_parse_operator(p, t, ops_bgn, &nexprs);
4699 s = zbc_lex_next(&p->l);
4700 rprn = get_token = false;
4701 bin_last = t != BC_LEX_OP_BOOL_NOT;
4704 if (BC_PARSE_LEAF(prev, rprn))
4705 return bc_error_bad_expression();
4707 paren_expr = rprn = bin_last = false;
4709 bc_vec_push(&p->ops, &t);
4712 if (bin_last || prev == BC_INST_BOOL_NOT)
4713 return bc_error_bad_expression();
4715 s = BC_STATUS_SUCCESS;
4721 dbg_lex_done("%s:%d done (returning EMPTY_EXP)", __func__, __LINE__);
4722 return BC_STATUS_PARSE_EMPTY_EXP;
4725 paren_expr = rprn = true;
4726 get_token = bin_last = false;
4727 s = zbc_parse_rightParen(p, ops_bgn, &nexprs);
4730 if (BC_PARSE_LEAF(prev, rprn))
4731 return bc_error_bad_expression();
4733 rprn = get_token = bin_last = false;
4734 s = zbc_parse_name(p, &prev, flags & ~BC_PARSE_NOCALL);
4738 if (BC_PARSE_LEAF(prev, rprn))
4739 return bc_error_bad_expression();
4740 bc_parse_pushNUM(p);
4743 paren_expr = get_token = true;
4744 rprn = bin_last = false;
4746 case BC_LEX_KEY_IBASE:
4747 case BC_LEX_KEY_LAST:
4748 case BC_LEX_KEY_OBASE:
4749 if (BC_PARSE_LEAF(prev, rprn))
4750 return bc_error_bad_expression();
4751 prev = (char) (t - BC_LEX_KEY_IBASE + BC_INST_IBASE);
4752 bc_parse_push(p, (char) prev);
4753 paren_expr = get_token = true;
4754 rprn = bin_last = false;
4757 case BC_LEX_KEY_LENGTH:
4758 case BC_LEX_KEY_SQRT:
4759 if (BC_PARSE_LEAF(prev, rprn))
4760 return bc_error_bad_expression();
4761 s = zbc_parse_builtin(p, t, flags, &prev);
4763 rprn = get_token = bin_last = false;
4766 case BC_LEX_KEY_READ:
4767 if (BC_PARSE_LEAF(prev, rprn))
4768 return bc_error_bad_expression();
4769 else if (flags & BC_PARSE_NOREAD)
4770 s = bc_error_nested_read_call();
4772 s = zbc_parse_read(p);
4774 rprn = get_token = bin_last = false;
4776 prev = BC_INST_READ;
4778 case BC_LEX_KEY_SCALE:
4779 if (BC_PARSE_LEAF(prev, rprn))
4780 return bc_error_bad_expression();
4781 s = zbc_parse_scale(p, &prev, flags);
4783 rprn = get_token = bin_last = false;
4785 prev = BC_INST_SCALE;
4788 s = bc_error_bad_token();
4792 if (!s && get_token) s = zbc_lex_next(&p->l);
4796 if (G_interrupt) return BC_STATUS_FAILURE; // ^C: stop parsing
4798 while (p->ops.len > ops_bgn) {
4799 top = BC_PARSE_TOP_OP(p);
4800 assign = top >= BC_LEX_OP_ASSIGN_POWER && top <= BC_LEX_OP_ASSIGN;
4802 if (top == BC_LEX_LPAREN || top == BC_LEX_RPAREN)
4803 return bc_error_bad_expression();
4805 bc_parse_push(p, BC_TOKEN_2_INST(top));
4807 nexprs -= top != BC_LEX_OP_BOOL_NOT && top != BC_LEX_NEG;
4808 bc_vec_pop(&p->ops);
4811 if (prev == BC_INST_BOOL_NOT || nexprs != 1)
4812 return bc_error_bad_expression();
4814 if (!(flags & BC_PARSE_REL) && nrelops) {
4815 s = bc_POSIX_does_not_allow("comparison operators outside if or loops");
4816 IF_ERROR_RETURN_POSSIBLE(if (s) return s);
4817 } else if ((flags & BC_PARSE_REL) && nrelops > 1) {
4818 s = bc_POSIX_requires("exactly one comparison operator per condition");
4819 IF_ERROR_RETURN_POSSIBLE(if (s) return s);
4822 if (flags & BC_PARSE_PRINT) {
4823 if (paren_first || !assign) bc_parse_push(p, BC_INST_PRINT);
4824 bc_parse_push(p, BC_INST_POP);
4827 dbg_lex_done("%s:%d done", __func__, __LINE__);
4835 static BC_STATUS zdc_parse_register(BcParse *p)
4839 s = zbc_lex_next(&p->l);
4840 if (s) RETURN_STATUS(s);
4841 if (p->l.t.t != BC_LEX_NAME) RETURN_STATUS(bc_error_bad_token());
4843 bc_parse_pushName(p, p->l.t.v.v);
4847 #define zdc_parse_register(...) (zdc_parse_register(__VA_ARGS__) COMMA_SUCCESS)
4849 static BC_STATUS zdc_parse_string(BcParse *p)
4852 size_t len = G.prog.strs.len;
4854 dbg_lex_enter("%s:%d entered", __func__, __LINE__);
4856 str = xstrdup(p->l.t.v.v);
4857 bc_parse_push(p, BC_INST_STR);
4858 bc_parse_pushIndex(p, len);
4859 bc_vec_push(&G.prog.strs, &str);
4861 // Explanation needed here
4862 bc_program_add_fn();
4863 p->func = bc_program_func(p->fidx);
4865 dbg_lex_done("%s:%d done", __func__, __LINE__);
4867 RETURN_STATUS(zbc_lex_next(&p->l));
4869 #define zdc_parse_string(...) (zdc_parse_string(__VA_ARGS__) COMMA_SUCCESS)
4871 static BC_STATUS zdc_parse_mem(BcParse *p, uint8_t inst, bool name, bool store)
4875 bc_parse_push(p, inst);
4877 s = zdc_parse_register(p);
4878 if (s) RETURN_STATUS(s);
4882 bc_parse_push(p, BC_INST_SWAP);
4883 bc_parse_push(p, BC_INST_ASSIGN);
4884 bc_parse_push(p, BC_INST_POP);
4887 RETURN_STATUS(zbc_lex_next(&p->l));
4889 #define zdc_parse_mem(...) (zdc_parse_mem(__VA_ARGS__) COMMA_SUCCESS)
4891 static BC_STATUS zdc_parse_cond(BcParse *p, uint8_t inst)
4895 bc_parse_push(p, inst);
4896 bc_parse_push(p, BC_INST_EXEC_COND);
4898 s = zdc_parse_register(p);
4899 if (s) RETURN_STATUS(s);
4901 s = zbc_lex_next(&p->l);
4902 if (s) RETURN_STATUS(s);
4904 if (p->l.t.t == BC_LEX_ELSE) {
4905 s = zdc_parse_register(p);
4906 if (s) RETURN_STATUS(s);
4907 s = zbc_lex_next(&p->l);
4909 bc_parse_push(p, BC_PARSE_STREND);
4913 #define zdc_parse_cond(...) (zdc_parse_cond(__VA_ARGS__) COMMA_SUCCESS)
4915 static BC_STATUS zdc_parse_token(BcParse *p, BcLexType t, uint8_t flags)
4917 BcStatus s = BC_STATUS_SUCCESS;
4919 bool assign, get_token = false;
4921 dbg_lex_enter("%s:%d entered", __func__, __LINE__);
4923 case BC_LEX_OP_REL_EQ:
4924 case BC_LEX_OP_REL_LE:
4925 case BC_LEX_OP_REL_GE:
4926 case BC_LEX_OP_REL_NE:
4927 case BC_LEX_OP_REL_LT:
4928 case BC_LEX_OP_REL_GT:
4929 s = zdc_parse_cond(p, t - BC_LEX_OP_REL_EQ + BC_INST_REL_EQ);
4933 s = zdc_parse_mem(p, BC_INST_ARRAY_ELEM, true, t == BC_LEX_COLON);
4936 dbg_lex("%s:%d LEX_STR", __func__, __LINE__);
4937 s = zdc_parse_string(p);
4941 dbg_lex("%s:%d LEX_NEG/NUMBER", __func__, __LINE__);
4942 if (t == BC_LEX_NEG) {
4943 s = zbc_lex_next(&p->l);
4944 if (s) RETURN_STATUS(s);
4945 if (p->l.t.t != BC_LEX_NUMBER)
4946 RETURN_STATUS(bc_error_bad_token());
4948 bc_parse_pushNUM(p);
4949 if (t == BC_LEX_NEG) bc_parse_push(p, BC_INST_NEG);
4952 case BC_LEX_KEY_READ:
4953 if (flags & BC_PARSE_NOREAD)
4954 s = bc_error_nested_read_call();
4956 bc_parse_push(p, BC_INST_READ);
4959 case BC_LEX_OP_ASSIGN:
4960 case BC_LEX_STORE_PUSH:
4961 assign = t == BC_LEX_OP_ASSIGN;
4962 inst = assign ? BC_INST_VAR : BC_INST_PUSH_TO_VAR;
4963 s = zdc_parse_mem(p, inst, true, assign);
4966 case BC_LEX_LOAD_POP:
4967 inst = t == BC_LEX_LOAD_POP ? BC_INST_PUSH_VAR : BC_INST_LOAD;
4968 s = zdc_parse_mem(p, inst, true, false);
4970 case BC_LEX_STORE_IBASE:
4971 case BC_LEX_STORE_SCALE:
4972 case BC_LEX_STORE_OBASE:
4973 inst = t - BC_LEX_STORE_IBASE + BC_INST_IBASE;
4974 s = zdc_parse_mem(p, inst, false, true);
4977 s = bc_error_bad_token();
4982 if (!s && get_token) s = zbc_lex_next(&p->l);
4984 dbg_lex_done("%s:%d done", __func__, __LINE__);
4987 #define zdc_parse_token(...) (zdc_parse_token(__VA_ARGS__) COMMA_SUCCESS)
4989 static BC_STATUS zdc_parse_expr(BcParse *p, uint8_t flags)
4993 dbg_lex_enter("%s:%d entered G.prs.l.t.t:%d", __func__, __LINE__, G.prs.l.t.t);
4999 if (t == BC_LEX_EOF) break;
5001 inst = dc_parse_insts[t];
5002 if (inst != BC_INST_INVALID) {
5003 dbg_lex("%s:%d", __func__, __LINE__);
5004 bc_parse_push(p, inst);
5005 s = zbc_lex_next(&p->l);
5007 dbg_lex("%s:%d", __func__, __LINE__);
5008 s = zdc_parse_token(p, t, flags);
5010 if (s) RETURN_STATUS(s);
5013 if (flags & BC_PARSE_NOCALL)
5014 bc_parse_push(p, BC_INST_POP_EXEC);
5016 dbg_lex_done("%s:%d done", __func__, __LINE__);
5017 RETURN_STATUS(BC_STATUS_SUCCESS);
5019 #define zdc_parse_expr(...) (zdc_parse_expr(__VA_ARGS__) COMMA_SUCCESS)
5021 static BC_STATUS zdc_parse_parse(BcParse *p)
5025 if (p->l.t.t == BC_LEX_EOF)
5026 s = bc_error("end of file");
5028 s = zdc_parse_expr(p, 0);
5030 if (s || G_interrupt) {
5032 s = BC_STATUS_FAILURE;
5037 #define zdc_parse_parse(...) (zdc_parse_parse(__VA_ARGS__) COMMA_SUCCESS)
5041 static BC_STATUS zcommon_parse_expr(BcParse *p, uint8_t flags)
5044 IF_BC(RETURN_STATUS(zbc_parse_expr(p, flags)));
5046 IF_DC(RETURN_STATUS(zdc_parse_expr(p, flags)));
5049 #define zcommon_parse_expr(...) (zcommon_parse_expr(__VA_ARGS__) COMMA_SUCCESS)
5051 static BcVec* bc_program_search(char *id, bool var)
5058 v = var ? &G.prog.vars : &G.prog.arrs;
5059 map = var ? &G.prog.var_map : &G.prog.arr_map;
5063 new = bc_map_insert(map, &e, &i); // 1 if insertion was successful
5067 bc_array_init(&v2, var);
5068 bc_vec_push(v, &v2);
5071 ptr = bc_vec_item(map, i);
5072 if (new) ptr->name = xstrdup(e.name);
5073 return bc_vec_item(v, ptr->idx);
5076 // 'num' need not be initialized on entry
5077 static BC_STATUS zbc_program_num(BcResult *r, BcNum **num, bool hex)
5081 case BC_RESULT_TEMP:
5082 case BC_RESULT_IBASE:
5083 case BC_RESULT_SCALE:
5084 case BC_RESULT_OBASE:
5087 case BC_RESULT_CONSTANT: {
5093 str = *bc_program_const(r->d.id.idx);
5096 bc_num_init(&r->d.n, len);
5098 hex = hex && len == 1;
5099 base_t = hex ? 16 : G.prog.ib_t;
5100 s = zbc_num_parse(&r->d.n, str, base_t);
5102 bc_num_free(&r->d.n);
5106 r->t = BC_RESULT_TEMP;
5110 case BC_RESULT_ARRAY:
5111 case BC_RESULT_ARRAY_ELEM: {
5114 v = bc_program_search(r->d.id.name, r->t == BC_RESULT_VAR);
5116 if (r->t == BC_RESULT_ARRAY_ELEM) {
5118 if (v->len <= r->d.id.idx) bc_array_expand(v, r->d.id.idx + 1);
5119 *num = bc_vec_item(v, r->d.id.idx);
5121 *num = bc_vec_top(v);
5125 case BC_RESULT_LAST:
5126 *num = &G.prog.last;
5133 // Testing the theory that dc does not reach LAST/ONE
5134 bb_error_msg_and_die("BUG:%d", r->t);
5137 RETURN_STATUS(BC_STATUS_SUCCESS);
5139 #define zbc_program_num(...) (zbc_program_num(__VA_ARGS__) COMMA_SUCCESS)
5141 static BC_STATUS zbc_program_binOpPrep(BcResult **l, BcNum **ln,
5142 BcResult **r, BcNum **rn, bool assign)
5146 BcResultType lt, rt;
5148 if (!STACK_HAS_MORE_THAN(&G.prog.results, 1))
5149 RETURN_STATUS(bc_error_stack_has_too_few_elements());
5151 *r = bc_vec_item_rev(&G.prog.results, 0);
5152 *l = bc_vec_item_rev(&G.prog.results, 1);
5156 hex = assign && (lt == BC_RESULT_IBASE || lt == BC_RESULT_OBASE);
5158 s = zbc_program_num(*l, ln, false);
5159 if (s) RETURN_STATUS(s);
5160 s = zbc_program_num(*r, rn, hex);
5161 if (s) RETURN_STATUS(s);
5163 // We run this again under these conditions in case any vector has been
5164 // reallocated out from under the BcNums or arrays we had.
5165 if (lt == rt && (lt == BC_RESULT_VAR || lt == BC_RESULT_ARRAY_ELEM)) {
5166 s = zbc_program_num(*l, ln, false);
5167 if (s) RETURN_STATUS(s);
5170 if (!BC_PROG_NUM((*l), (*ln)) && (!assign || (*l)->t != BC_RESULT_VAR))
5171 RETURN_STATUS(bc_error_variable_is_wrong_type());
5172 if (!assign && !BC_PROG_NUM((*r), (*ln)))
5173 RETURN_STATUS(bc_error_variable_is_wrong_type());
5177 #define zbc_program_binOpPrep(...) (zbc_program_binOpPrep(__VA_ARGS__) COMMA_SUCCESS)
5179 static void bc_program_binOpRetire(BcResult *r)
5181 r->t = BC_RESULT_TEMP;
5182 bc_vec_pop(&G.prog.results);
5183 bc_result_pop_and_push(r);
5186 static BC_STATUS zbc_program_prep(BcResult **r, BcNum **n)
5190 if (!STACK_HAS_MORE_THAN(&G.prog.results, 0))
5191 RETURN_STATUS(bc_error_stack_has_too_few_elements());
5192 *r = bc_vec_top(&G.prog.results);
5194 s = zbc_program_num(*r, n, false);
5195 if (s) RETURN_STATUS(s);
5197 if (!BC_PROG_NUM((*r), (*n)))
5198 RETURN_STATUS(bc_error_variable_is_wrong_type());
5202 #define zbc_program_prep(...) (zbc_program_prep(__VA_ARGS__) COMMA_SUCCESS)
5204 static void bc_program_retire(BcResult *r, BcResultType t)
5207 bc_result_pop_and_push(r);
5210 static BC_STATUS zbc_program_op(char inst)
5213 BcResult *opd1, *opd2, res;
5214 BcNum *n1, *n2 = NULL;
5216 s = zbc_program_binOpPrep(&opd1, &n1, &opd2, &n2, false);
5217 if (s) RETURN_STATUS(s);
5218 bc_num_init_DEF_SIZE(&res.d.n);
5220 s = BC_STATUS_SUCCESS;
5221 IF_ERROR_RETURN_POSSIBLE(s =) zbc_program_ops[inst - BC_INST_POWER](n1, n2, &res.d.n, G.prog.scale);
5223 bc_program_binOpRetire(&res);
5227 bc_num_free(&res.d.n);
5230 #define zbc_program_op(...) (zbc_program_op(__VA_ARGS__) COMMA_SUCCESS)
5232 static BC_STATUS zbc_program_read(void)
5234 const char *sv_file;
5242 RETURN_STATUS(bc_error_nested_read_call());
5244 f = bc_program_func(BC_PROG_READ);
5245 bc_vec_pop_all(&f->code);
5247 sv_file = G.prog.file;
5251 bc_char_vec_init(&buf);
5252 bc_read_line(&buf, stdin);
5254 bc_parse_create(&parse, BC_PROG_READ);
5255 bc_lex_file(&parse.l);
5257 s = zbc_parse_text_init(&parse, buf.v);
5258 if (s) goto exec_err;
5259 s = zcommon_parse_expr(&parse, BC_PARSE_NOREAD);
5260 if (s) goto exec_err;
5262 if (parse.l.t.t != BC_LEX_NLINE && parse.l.t.t != BC_LEX_EOF) {
5263 s = bc_error("bad read() expression");
5267 ip.func = BC_PROG_READ;
5269 IF_BC(ip.results_len_before_call = G.prog.results.len;)
5271 // Update this pointer, just in case.
5272 f = bc_program_func(BC_PROG_READ);
5274 bc_vec_pushByte(&f->code, BC_INST_POP_EXEC);
5275 bc_vec_push(&G.prog.exestack, &ip);
5277 bc_parse_free(&parse);
5279 G.prog.file = sv_file;
5283 #define zbc_program_read(...) (zbc_program_read(__VA_ARGS__) COMMA_SUCCESS)
5285 static size_t bc_program_index(char *code, size_t *bgn)
5287 unsigned char *bytes = (void*)(code + *bgn);
5297 for (i = 0; i < amt; i += 8)
5298 res |= (size_t)(*bytes++) << i;
5303 static char *bc_program_name(char *code, size_t *bgn)
5309 s = xmalloc(strchr(code, BC_PARSE_STREND) - code + 1);
5313 if (c == BC_PARSE_STREND)
5323 static void bc_program_printString(const char *str)
5327 // Example: echo '[]ap' | dc
5328 // should print two bytes: 0x00, 0x0A
5335 if (c != '\\' || !*str)
5355 G.prog.nchars = SIZE_MAX;
5367 // Just print the backslash and following character.
5378 static void bc_num_printNewline(void)
5380 if (G.prog.nchars == G.prog.len - 1) {
5388 static FAST_FUNC void dc_num_printChar(size_t num, size_t width, bool radix)
5391 bb_putchar((char) num);
5392 G.prog.nchars += width;
5396 static FAST_FUNC void bc_num_printDigits(size_t num, size_t width, bool radix)
5400 bc_num_printNewline();
5401 bb_putchar(radix ? '.' : ' ');
5404 bc_num_printNewline();
5405 for (exp = 0, pow = 1; exp < width - 1; ++exp, pow *= 10)
5408 for (exp = 0; exp < width; pow /= 10, ++G.prog.nchars, ++exp) {
5410 bc_num_printNewline();
5413 bb_putchar(((char) dig) + '0');
5417 static FAST_FUNC void bc_num_printHex(size_t num, size_t width, bool radix)
5420 bc_num_printNewline();
5425 bc_num_printNewline();
5426 bb_putchar(bb_hexdigits_upcase[num]);
5427 G.prog.nchars += width;
5430 static void bc_num_printDecimal(BcNum *n)
5432 size_t i, rdx = n->rdx - 1;
5439 for (i = n->len - 1; i < n->len; --i)
5440 bc_num_printHex((size_t) n->num[i], 1, i == rdx);
5443 static BC_STATUS zbc_num_printNum(BcNum *n, unsigned base_t, size_t width, BcNumDigitOp print)
5448 BcDig base_digs[ULONG_NUM_BUFSIZE];
5449 BcNum intp, fracp, digit, frac_len;
5450 unsigned long dig, *ptr;
5455 print(0, width, false);
5456 RETURN_STATUS(BC_STATUS_SUCCESS);
5459 bc_vec_init(&stack, sizeof(long), NULL);
5460 bc_num_init(&intp, n->len);
5461 bc_num_init(&fracp, n->rdx);
5462 bc_num_init(&digit, width);
5463 bc_num_init(&frac_len, BC_NUM_INT(n));
5464 bc_num_copy(&intp, n);
5465 bc_num_one(&frac_len);
5466 base.cap = ARRAY_SIZE(base_digs);
5467 base.num = base_digs;
5468 bc_num_ulong2num(&base, base_t);
5470 bc_num_truncate(&intp, intp.rdx);
5471 s = zbc_num_sub(n, &intp, &fracp, 0);
5474 while (intp.len != 0) {
5475 s = zbc_num_divmod(&intp, &base, &intp, &digit, 0);
5477 s = zbc_num_ulong(&digit, &dig);
5479 bc_vec_push(&stack, &dig);
5482 for (i = 0; i < stack.len; ++i) {
5483 ptr = bc_vec_item_rev(&stack, i);
5484 print(*ptr, width, false);
5487 if (!n->rdx) goto err;
5489 for (radix = true; frac_len.len <= n->rdx; radix = false) {
5490 s = zbc_num_mul(&fracp, &base, &fracp, n->rdx);
5492 s = zbc_num_ulong(&fracp, &dig);
5494 bc_num_ulong2num(&intp, dig);
5495 s = zbc_num_sub(&fracp, &intp, &fracp, 0);
5497 print(dig, width, radix);
5498 s = zbc_num_mul(&frac_len, &base, &frac_len, 0);
5502 bc_num_free(&frac_len);
5503 bc_num_free(&digit);
5504 bc_num_free(&fracp);
5506 bc_vec_free(&stack);
5509 #define zbc_num_printNum(...) (zbc_num_printNum(__VA_ARGS__) COMMA_SUCCESS)
5511 static BC_STATUS zbc_num_printBase(BcNum *n)
5525 if (G.prog.ob_t <= BC_NUM_MAX_IBASE) {
5527 print = bc_num_printHex;
5529 unsigned i = G.prog.ob_t - 1;
5537 print = bc_num_printDigits;
5540 s = zbc_num_printNum(n, G.prog.ob_t, width, print);
5545 #define zbc_num_printBase(...) (zbc_num_printBase(__VA_ARGS__) COMMA_SUCCESS)
5547 static BC_STATUS zbc_num_print(BcNum *n, bool newline)
5549 BcStatus s = BC_STATUS_SUCCESS;
5551 bc_num_printNewline();
5556 } else if (G.prog.ob_t == 10)
5557 bc_num_printDecimal(n);
5559 s = zbc_num_printBase(n);
5568 #define zbc_num_print(...) (zbc_num_print(__VA_ARGS__) COMMA_SUCCESS)
5570 static BC_STATUS zbc_program_print(char inst, size_t idx)
5575 bool pop = inst != BC_INST_PRINT;
5577 if (!STACK_HAS_MORE_THAN(&G.prog.results, idx))
5578 RETURN_STATUS(bc_error_stack_has_too_few_elements());
5580 r = bc_vec_item_rev(&G.prog.results, idx);
5581 s = zbc_program_num(r, &num, false);
5582 if (s) RETURN_STATUS(s);
5584 if (BC_PROG_NUM(r, num)) {
5585 s = zbc_num_print(num, !pop);
5587 if (!s && IS_BC) bc_num_copy(&G.prog.last, num);
5592 idx = (r->t == BC_RESULT_STR) ? r->d.id.idx : num->rdx;
5593 str = *bc_program_str(idx);
5595 if (inst == BC_INST_PRINT_STR) {
5598 if (c == '\0') break;
5601 if (c == '\n') G.prog.nchars = 0;
5604 bc_program_printString(str);
5605 if (inst == BC_INST_PRINT) bb_putchar('\n');
5609 if (!s && pop) bc_vec_pop(&G.prog.results);
5613 #define zbc_program_print(...) (zbc_program_print(__VA_ARGS__) COMMA_SUCCESS)
5615 static BC_STATUS zbc_program_negate(void)
5621 s = zbc_program_prep(&ptr, &num);
5622 if (s) RETURN_STATUS(s);
5624 bc_num_init(&res.d.n, num->len);
5625 bc_num_copy(&res.d.n, num);
5626 if (res.d.n.len) res.d.n.neg = !res.d.n.neg;
5628 bc_program_retire(&res, BC_RESULT_TEMP);
5632 #define zbc_program_negate(...) (zbc_program_negate(__VA_ARGS__) COMMA_SUCCESS)
5634 static BC_STATUS zbc_program_logical(char inst)
5637 BcResult *opd1, *opd2, res;
5641 s = zbc_program_binOpPrep(&opd1, &n1, &opd2, &n2, false);
5642 if (s) RETURN_STATUS(s);
5644 bc_num_init_DEF_SIZE(&res.d.n);
5646 if (inst == BC_INST_BOOL_AND)
5647 cond = bc_num_cmp(n1, &G.prog.zero) && bc_num_cmp(n2, &G.prog.zero);
5648 else if (inst == BC_INST_BOOL_OR)
5649 cond = bc_num_cmp(n1, &G.prog.zero) || bc_num_cmp(n2, &G.prog.zero);
5651 cond = bc_num_cmp(n1, n2);
5653 case BC_INST_REL_EQ:
5656 case BC_INST_REL_LE:
5659 case BC_INST_REL_GE:
5662 case BC_INST_REL_LT:
5665 case BC_INST_REL_GT:
5668 default: // = case BC_INST_REL_NE:
5669 //cond = (cond != 0); - not needed
5674 if (cond) bc_num_one(&res.d.n);
5675 //else bc_num_zero(&res.d.n); - already is
5677 bc_program_binOpRetire(&res);
5681 #define zbc_program_logical(...) (zbc_program_logical(__VA_ARGS__) COMMA_SUCCESS)
5684 static BC_STATUS zdc_program_assignStr(BcResult *r, BcVec *v, bool push)
5689 memset(&n2, 0, sizeof(BcNum));
5690 n2.rdx = res.d.id.idx = r->d.id.idx;
5691 res.t = BC_RESULT_STR;
5694 if (!STACK_HAS_MORE_THAN(&G.prog.results, 1))
5695 RETURN_STATUS(bc_error_stack_has_too_few_elements());
5697 bc_vec_pop(&G.prog.results);
5700 bc_result_pop_and_push(&res);
5701 bc_vec_push(v, &n2);
5703 RETURN_STATUS(BC_STATUS_SUCCESS);
5705 #define zdc_program_assignStr(...) (zdc_program_assignStr(__VA_ARGS__) COMMA_SUCCESS)
5708 static BC_STATUS zbc_program_copyToVar(char *name, bool var)
5715 if (!STACK_HAS_MORE_THAN(&G.prog.results, 0))
5716 RETURN_STATUS(bc_error_stack_has_too_few_elements());
5718 ptr = bc_vec_top(&G.prog.results);
5719 if ((ptr->t == BC_RESULT_ARRAY) != !var)
5720 RETURN_STATUS(bc_error_variable_is_wrong_type());
5721 v = bc_program_search(name, var);
5724 if (ptr->t == BC_RESULT_STR && !var)
5725 RETURN_STATUS(bc_error_variable_is_wrong_type());
5726 if (ptr->t == BC_RESULT_STR)
5727 RETURN_STATUS(zdc_program_assignStr(ptr, v, true));
5730 s = zbc_program_num(ptr, &n, false);
5731 if (s) RETURN_STATUS(s);
5733 // Do this once more to make sure that pointers were not invalidated.
5734 v = bc_program_search(name, var);
5737 bc_num_init_DEF_SIZE(&r.d.n);
5738 bc_num_copy(&r.d.n, n);
5740 bc_array_init(&r.d.v, true);
5741 bc_array_copy(&r.d.v, (BcVec *) n);
5744 bc_vec_push(v, &r.d);
5745 bc_vec_pop(&G.prog.results);
5749 #define zbc_program_copyToVar(...) (zbc_program_copyToVar(__VA_ARGS__) COMMA_SUCCESS)
5751 static BC_STATUS zbc_program_assign(char inst)
5754 BcResult *left, *right, res;
5755 BcNum *l = NULL, *r = NULL;
5756 bool assign = inst == BC_INST_ASSIGN, ib, sc;
5758 s = zbc_program_binOpPrep(&left, &l, &right, &r, assign);
5759 if (s) RETURN_STATUS(s);
5761 ib = left->t == BC_RESULT_IBASE;
5762 sc = left->t == BC_RESULT_SCALE;
5765 if (right->t == BC_RESULT_STR) {
5768 if (left->t != BC_RESULT_VAR)
5769 RETURN_STATUS(bc_error_variable_is_wrong_type());
5770 v = bc_program_search(left->d.id.name, true);
5772 RETURN_STATUS(zdc_program_assignStr(right, v, false));
5776 if (left->t == BC_RESULT_CONSTANT || left->t == BC_RESULT_TEMP)
5777 RETURN_STATUS(bc_error("bad assignment:"
5778 " left side must be variable"
5780 )); // note: shared string
5783 if (inst == BC_INST_ASSIGN_DIVIDE && !bc_num_cmp(r, &G.prog.zero))
5784 RETURN_STATUS(bc_error("divide by zero"));
5789 s = BC_STATUS_SUCCESS;
5790 IF_ERROR_RETURN_POSSIBLE(s =) zbc_program_ops[inst - BC_INST_ASSIGN_POWER](l, r, l, G.prog.scale);
5792 if (s) RETURN_STATUS(s);
5797 if (ib || sc || left->t == BC_RESULT_OBASE) {
5798 static const char *const msg[] = {
5799 "bad ibase; must be [2,16]", //BC_RESULT_IBASE
5800 "bad scale; must be [0,"BC_MAX_SCALE_STR"]", //BC_RESULT_SCALE
5801 NULL, //can't happen //BC_RESULT_LAST
5802 NULL, //can't happen //BC_RESULT_CONSTANT
5803 NULL, //can't happen //BC_RESULT_ONE
5804 "bad obase; must be [2,"BC_MAX_OBASE_STR"]", //BC_RESULT_OBASE
5810 s = zbc_num_ulong(l, &val);
5811 if (s) RETURN_STATUS(s);
5812 s = left->t - BC_RESULT_IBASE;
5815 ptr = &G.prog.scale;
5818 RETURN_STATUS(bc_error(msg[s]));
5819 max = ib ? BC_NUM_MAX_IBASE : BC_MAX_OBASE;
5820 ptr = ib ? &G.prog.ib_t : &G.prog.ob_t;
5824 RETURN_STATUS(bc_error(msg[s]));
5826 *ptr = (size_t) val;
5827 s = BC_STATUS_SUCCESS;
5830 bc_num_init(&res.d.n, l->len);
5831 bc_num_copy(&res.d.n, l);
5832 bc_program_binOpRetire(&res);
5836 #define zbc_program_assign(...) (zbc_program_assign(__VA_ARGS__) COMMA_SUCCESS)
5839 #define bc_program_pushVar(code, bgn, pop, copy) \
5840 bc_program_pushVar(code, bgn)
5841 // for bc, 'pop' and 'copy' are always false
5843 static BC_STATUS bc_program_pushVar(char *code, size_t *bgn,
5844 bool pop, bool copy)
5847 char *name = bc_program_name(code, bgn);
5849 r.t = BC_RESULT_VAR;
5854 BcVec *v = bc_program_search(name, true);
5855 BcNum *num = bc_vec_top(v);
5858 if (!STACK_HAS_MORE_THAN(v, 1 - copy)) {
5859 RETURN_STATUS(bc_error_stack_has_too_few_elements());
5862 if (!BC_PROG_STR(num)) {
5863 r.t = BC_RESULT_TEMP;
5864 bc_num_init_DEF_SIZE(&r.d.n);
5865 bc_num_copy(&r.d.n, num);
5867 r.t = BC_RESULT_STR;
5868 r.d.id.idx = num->rdx;
5871 if (!copy) bc_vec_pop(v);
5875 bc_vec_push(&G.prog.results, &r);
5877 RETURN_STATUS(BC_STATUS_SUCCESS);
5879 #define zbc_program_pushVar(...) (bc_program_pushVar(__VA_ARGS__) COMMA_SUCCESS)
5881 static BC_STATUS zbc_program_pushArray(char *code, size_t *bgn, char inst)
5883 BcStatus s = BC_STATUS_SUCCESS;
5887 r.d.id.name = bc_program_name(code, bgn);
5889 if (inst == BC_INST_ARRAY) {
5890 r.t = BC_RESULT_ARRAY;
5891 bc_vec_push(&G.prog.results, &r);
5896 s = zbc_program_prep(&operand, &num);
5898 s = zbc_num_ulong(num, &temp);
5901 if (temp > BC_MAX_DIM) {
5902 s = bc_error("array too long; must be [1,"BC_MAX_DIM_STR"]");
5906 r.d.id.idx = (size_t) temp;
5907 bc_program_retire(&r, BC_RESULT_ARRAY_ELEM);
5910 if (s) free(r.d.id.name);
5913 #define zbc_program_pushArray(...) (zbc_program_pushArray(__VA_ARGS__) COMMA_SUCCESS)
5916 static BC_STATUS zbc_program_incdec(char inst)
5919 BcResult *ptr, res, copy;
5923 s = zbc_program_prep(&ptr, &num);
5924 if (s) RETURN_STATUS(s);
5926 if (inst == BC_INST_INC_POST || inst == BC_INST_DEC_POST) {
5927 copy.t = BC_RESULT_TEMP;
5928 bc_num_init(©.d.n, num->len);
5929 bc_num_copy(©.d.n, num);
5932 res.t = BC_RESULT_ONE;
5933 inst = inst == BC_INST_INC_PRE || inst == BC_INST_INC_POST ?
5934 BC_INST_ASSIGN_PLUS :
5935 BC_INST_ASSIGN_MINUS;
5937 bc_vec_push(&G.prog.results, &res);
5938 s = zbc_program_assign(inst);
5939 if (s) RETURN_STATUS(s);
5941 if (inst2 == BC_INST_INC_POST || inst2 == BC_INST_DEC_POST) {
5942 bc_result_pop_and_push(©);
5947 #define zbc_program_incdec(...) (zbc_program_incdec(__VA_ARGS__) COMMA_SUCCESS)
5949 static BC_STATUS zbc_program_call(char *code, size_t *idx)
5957 nparams = bc_program_index(code, idx);
5959 ip.func = bc_program_index(code, idx);
5960 func = bc_program_func(ip.func);
5962 if (func->code.len == 0) {
5963 RETURN_STATUS(bc_error("undefined function"));
5965 if (nparams != func->nparams) {
5966 RETURN_STATUS(bc_error_fmt("function has %u parameters, but called with %u", func->nparams, nparams));
5968 ip.results_len_before_call = G.prog.results.len - nparams;
5970 for (i = 0; i < nparams; ++i) {
5973 a = bc_vec_item(&func->autos, nparams - 1 - i);
5974 arg = bc_vec_top(&G.prog.results);
5976 if ((!a->idx) != (arg->t == BC_RESULT_ARRAY) || arg->t == BC_RESULT_STR)
5977 RETURN_STATUS(bc_error_variable_is_wrong_type());
5979 s = zbc_program_copyToVar(a->name, a->idx);
5980 if (s) RETURN_STATUS(s);
5983 a = bc_vec_item(&func->autos, i);
5984 for (; i < func->autos.len; i++, a++) {
5987 v = bc_program_search(a->name, a->idx);
5990 bc_num_init_DEF_SIZE(&n2);
5991 bc_vec_push(v, &n2);
5994 bc_array_init(&v2, true);
5995 bc_vec_push(v, &v2);
5999 bc_vec_push(&G.prog.exestack, &ip);
6001 RETURN_STATUS(BC_STATUS_SUCCESS);
6003 #define zbc_program_call(...) (zbc_program_call(__VA_ARGS__) COMMA_SUCCESS)
6005 static BC_STATUS zbc_program_return(char inst)
6011 BcInstPtr *ip = bc_vec_top(&G.prog.exestack);
6013 if (!STACK_HAS_EQUAL_OR_MORE_THAN(&G.prog.results, ip->results_len_before_call + (inst == BC_INST_RET)))
6014 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6016 f = bc_program_func(ip->func);
6017 res.t = BC_RESULT_TEMP;
6019 if (inst == BC_INST_RET) {
6022 BcResult *operand = bc_vec_top(&G.prog.results);
6024 s = zbc_program_num(operand, &num, false);
6025 if (s) RETURN_STATUS(s);
6026 bc_num_init(&res.d.n, num->len);
6027 bc_num_copy(&res.d.n, num);
6029 bc_num_init_DEF_SIZE(&res.d.n);
6030 //bc_num_zero(&res.d.n); - already is
6033 // We need to pop arguments as well, so this takes that into account.
6034 a = (void*)f->autos.v;
6035 for (i = 0; i < f->autos.len; i++, a++) {
6037 v = bc_program_search(a->name, a->idx);
6041 bc_vec_npop(&G.prog.results, G.prog.results.len - ip->results_len_before_call);
6042 bc_vec_push(&G.prog.results, &res);
6043 bc_vec_pop(&G.prog.exestack);
6045 RETURN_STATUS(BC_STATUS_SUCCESS);
6047 #define zbc_program_return(...) (zbc_program_return(__VA_ARGS__) COMMA_SUCCESS)
6050 static unsigned long bc_program_scale(BcNum *n)
6052 return (unsigned long) n->rdx;
6055 static unsigned long bc_program_len(BcNum *n)
6057 size_t len = n->len;
6059 if (n->rdx != len) return len;
6061 if (len == 0) break;
6063 if (n->num[len] != 0) break;
6068 static BC_STATUS zbc_program_builtin(char inst)
6074 bool len = inst == BC_INST_LENGTH;
6076 if (!STACK_HAS_MORE_THAN(&G.prog.results, 0))
6077 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6078 opnd = bc_vec_top(&G.prog.results);
6080 s = zbc_program_num(opnd, &num, false);
6081 if (s) RETURN_STATUS(s);
6084 if (!BC_PROG_NUM(opnd, num) && !len)
6085 RETURN_STATUS(bc_error_variable_is_wrong_type());
6088 bc_num_init_DEF_SIZE(&res.d.n);
6090 if (inst == BC_INST_SQRT)
6091 s = zbc_num_sqrt(num, &res.d.n, G.prog.scale);
6093 else if (len != 0 && opnd->t == BC_RESULT_ARRAY) {
6094 bc_num_ulong2num(&res.d.n, (unsigned long) ((BcVec *) num)->len);
6098 else if (len != 0 && !BC_PROG_NUM(opnd, num)) {
6100 size_t idx = opnd->t == BC_RESULT_STR ? opnd->d.id.idx : num->rdx;
6102 str = bc_program_str(idx);
6103 bc_num_ulong2num(&res.d.n, strlen(*str));
6107 bc_num_ulong2num(&res.d.n, len ? bc_program_len(num) : bc_program_scale(num));
6110 bc_program_retire(&res, BC_RESULT_TEMP);
6114 #define zbc_program_builtin(...) (zbc_program_builtin(__VA_ARGS__) COMMA_SUCCESS)
6117 static BC_STATUS zdc_program_divmod(void)
6120 BcResult *opd1, *opd2, res, res2;
6121 BcNum *n1, *n2 = NULL;
6123 s = zbc_program_binOpPrep(&opd1, &n1, &opd2, &n2, false);
6124 if (s) RETURN_STATUS(s);
6126 bc_num_init_DEF_SIZE(&res.d.n);
6127 bc_num_init(&res2.d.n, n2->len);
6129 s = zbc_num_divmod(n1, n2, &res2.d.n, &res.d.n, G.prog.scale);
6132 bc_program_binOpRetire(&res2);
6133 res.t = BC_RESULT_TEMP;
6134 bc_vec_push(&G.prog.results, &res);
6138 bc_num_free(&res2.d.n);
6139 bc_num_free(&res.d.n);
6142 #define zdc_program_divmod(...) (zdc_program_divmod(__VA_ARGS__) COMMA_SUCCESS)
6144 static BC_STATUS zdc_program_modexp(void)
6147 BcResult *r1, *r2, *r3, res;
6148 BcNum *n1, *n2, *n3;
6150 if (!STACK_HAS_MORE_THAN(&G.prog.results, 2))
6151 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6152 s = zbc_program_binOpPrep(&r2, &n2, &r3, &n3, false);
6153 if (s) RETURN_STATUS(s);
6155 r1 = bc_vec_item_rev(&G.prog.results, 2);
6156 s = zbc_program_num(r1, &n1, false);
6157 if (s) RETURN_STATUS(s);
6158 if (!BC_PROG_NUM(r1, n1))
6159 RETURN_STATUS(bc_error_variable_is_wrong_type());
6161 // Make sure that the values have their pointers updated, if necessary.
6162 if (r1->t == BC_RESULT_VAR || r1->t == BC_RESULT_ARRAY_ELEM) {
6163 if (r1->t == r2->t) {
6164 s = zbc_program_num(r2, &n2, false);
6165 if (s) RETURN_STATUS(s);
6167 if (r1->t == r3->t) {
6168 s = zbc_program_num(r3, &n3, false);
6169 if (s) RETURN_STATUS(s);
6173 bc_num_init(&res.d.n, n3->len);
6174 s = zdc_num_modexp(n1, n2, n3, &res.d.n);
6177 bc_vec_pop(&G.prog.results);
6178 bc_program_binOpRetire(&res);
6182 bc_num_free(&res.d.n);
6185 #define zdc_program_modexp(...) (zdc_program_modexp(__VA_ARGS__) COMMA_SUCCESS)
6187 static void dc_program_stackLen(void)
6190 size_t len = G.prog.results.len;
6192 res.t = BC_RESULT_TEMP;
6194 bc_num_init_DEF_SIZE(&res.d.n);
6195 bc_num_ulong2num(&res.d.n, len);
6196 bc_vec_push(&G.prog.results, &res);
6199 static BC_STATUS zdc_program_asciify(void)
6210 if (!STACK_HAS_MORE_THAN(&G.prog.results, 0))
6211 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6212 r = bc_vec_top(&G.prog.results);
6214 s = zbc_program_num(r, &num, false);
6215 if (s) RETURN_STATUS(s);
6217 if (BC_PROG_NUM(r, num)) {
6219 BcDig strmb_digs[ULONG_NUM_BUFSIZE];
6221 bc_num_init_DEF_SIZE(&n);
6222 bc_num_copy(&n, num);
6223 bc_num_truncate(&n, n.rdx);
6225 strmb.cap = ARRAY_SIZE(strmb_digs);
6226 strmb.num = strmb_digs;
6227 bc_num_ulong2num(&strmb, 0x100);
6228 s = zbc_num_mod(&n, &strmb, &n, 0);
6230 if (s) goto num_err;
6231 s = zbc_num_ulong(&n, &val);
6232 if (s) goto num_err;
6239 idx = (r->t == BC_RESULT_STR) ? r->d.id.idx : num->rdx;
6240 sp = *bc_program_str(idx);
6244 strs = (void*)G.prog.strs.v;
6245 for (idx = 0; idx < G.prog.strs.len; idx++) {
6246 if (strs[idx][0] == c && strs[idx][1] == '\0') {
6252 //str[1] = '\0'; - already is
6253 bc_vec_push(&G.prog.strs, &str);
6255 res.t = BC_RESULT_STR;
6257 bc_result_pop_and_push(&res);
6259 RETURN_STATUS(BC_STATUS_SUCCESS);
6264 #define zdc_program_asciify(...) (zdc_program_asciify(__VA_ARGS__) COMMA_SUCCESS)
6266 static BC_STATUS zdc_program_printStream(void)
6273 if (!STACK_HAS_MORE_THAN(&G.prog.results, 0))
6274 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6275 r = bc_vec_top(&G.prog.results);
6277 s = zbc_program_num(r, &n, false);
6278 if (s) RETURN_STATUS(s);
6280 if (BC_PROG_NUM(r, n)) {
6281 s = zbc_num_printNum(n, 0x100, 1, dc_num_printChar);
6284 idx = (r->t == BC_RESULT_STR) ? r->d.id.idx : n->rdx;
6285 str = *bc_program_str(idx);
6291 #define zdc_program_printStream(...) (zdc_program_printStream(__VA_ARGS__) COMMA_SUCCESS)
6293 static BC_STATUS zdc_program_nquit(void)
6300 s = zbc_program_prep(&opnd, &num);
6301 if (s) RETURN_STATUS(s);
6302 s = zbc_num_ulong(num, &val);
6303 if (s) RETURN_STATUS(s);
6305 bc_vec_pop(&G.prog.results);
6307 if (G.prog.exestack.len < val)
6308 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6309 if (G.prog.exestack.len == val) {
6310 QUIT_OR_RETURN_TO_MAIN;
6313 bc_vec_npop(&G.prog.exestack, val);
6317 #define zdc_program_nquit(...) (zdc_program_nquit(__VA_ARGS__) COMMA_SUCCESS)
6319 static BC_STATUS zdc_program_execStr(char *code, size_t *bgn, bool cond)
6321 BcStatus s = BC_STATUS_SUCCESS;
6327 if (!STACK_HAS_MORE_THAN(&G.prog.results, 0))
6328 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6330 r = bc_vec_top(&G.prog.results);
6333 BcNum *n = n; // for compiler
6336 char *then_name = bc_program_name(code, bgn);
6337 char *else_name = NULL;
6339 if (code[*bgn] == BC_PARSE_STREND)
6342 else_name = bc_program_name(code, bgn);
6344 exec = r->d.n.len != 0;
6346 if (!exec && else_name != NULL) {
6353 v = bc_program_search(name, true);
6360 if (!exec) goto exit;
6361 if (!BC_PROG_STR(n)) {
6362 s = bc_error_variable_is_wrong_type();
6368 if (r->t == BC_RESULT_STR) {
6370 } else if (r->t == BC_RESULT_VAR) {
6372 s = zbc_program_num(r, &n, false);
6373 if (s || !BC_PROG_STR(n)) goto exit;
6379 fidx = sidx + BC_PROG_REQ_FUNCS;
6381 f = bc_program_func(fidx);
6383 if (f->code.len == 0) {
6387 bc_parse_create(&prs, fidx);
6388 str = *bc_program_str(sidx);
6389 s = zbc_parse_text_init(&prs, str);
6391 s = zcommon_parse_expr(&prs, BC_PARSE_NOCALL);
6393 if (prs.l.t.t != BC_LEX_EOF) {
6394 s = bc_error_bad_expression();
6396 bc_parse_free(&prs);
6397 bc_vec_pop_all(&f->code);
6400 bc_parse_free(&prs);
6406 bc_vec_pop(&G.prog.results);
6407 bc_vec_push(&G.prog.exestack, &ip);
6409 RETURN_STATUS(BC_STATUS_SUCCESS);
6411 bc_vec_pop(&G.prog.results);
6414 #define zdc_program_execStr(...) (zdc_program_execStr(__VA_ARGS__) COMMA_SUCCESS)
6417 static void bc_program_pushGlobal(char inst)
6422 res.t = inst - BC_INST_IBASE + BC_RESULT_IBASE;
6423 if (inst == BC_INST_IBASE)
6424 val = (unsigned long) G.prog.ib_t;
6425 else if (inst == BC_INST_SCALE)
6426 val = (unsigned long) G.prog.scale;
6428 val = (unsigned long) G.prog.ob_t;
6430 bc_num_init_DEF_SIZE(&res.d.n);
6431 bc_num_ulong2num(&res.d.n, val);
6432 bc_vec_push(&G.prog.results, &res);
6435 static BC_STATUS zbc_program_exec(void)
6439 BcInstPtr *ip = bc_vec_top(&G.prog.exestack);
6440 BcFunc *func = bc_program_func(ip->func);
6441 char *code = func->code.v;
6443 dbg_exec("func:%zd bytes:%zd ip:%zd results.len:%d",
6444 ip->func, func->code.len, ip->inst_idx, G.prog.results.len);
6445 while (ip->inst_idx < func->code.len) {
6446 BcStatus s = BC_STATUS_SUCCESS;
6447 char inst = code[ip->inst_idx++];
6449 dbg_exec("inst at %zd:%d results.len:%d", ip->inst_idx - 1, inst, G.prog.results.len);
6452 case BC_INST_JUMP_ZERO: {
6454 dbg_exec("BC_INST_JUMP_ZERO:");
6455 s = zbc_program_prep(&ptr, &num);
6456 if (s) RETURN_STATUS(s);
6457 zero = (bc_num_cmp(num, &G.prog.zero) == 0);
6458 bc_vec_pop(&G.prog.results);
6460 bc_program_index(code, &ip->inst_idx);
6463 // else: fall through
6465 case BC_INST_JUMP: {
6466 size_t idx = bc_program_index(code, &ip->inst_idx);
6467 size_t *addr = bc_vec_item(&func->labels, idx);
6468 dbg_exec("BC_INST_JUMP: to %ld", (long)*addr);
6469 ip->inst_idx = *addr;
6473 dbg_exec("BC_INST_CALL:");
6474 s = zbc_program_call(code, &ip->inst_idx);
6475 goto read_updated_ip;
6476 case BC_INST_INC_PRE:
6477 case BC_INST_DEC_PRE:
6478 case BC_INST_INC_POST:
6479 case BC_INST_DEC_POST:
6480 dbg_exec("BC_INST_INCDEC:");
6481 s = zbc_program_incdec(inst);
6484 dbg_exec("BC_INST_HALT:");
6485 QUIT_OR_RETURN_TO_MAIN;
6489 dbg_exec("BC_INST_RET[0]:");
6490 s = zbc_program_return(inst);
6491 goto read_updated_ip;
6492 case BC_INST_BOOL_OR:
6493 case BC_INST_BOOL_AND:
6495 case BC_INST_REL_EQ:
6496 case BC_INST_REL_LE:
6497 case BC_INST_REL_GE:
6498 case BC_INST_REL_NE:
6499 case BC_INST_REL_LT:
6500 case BC_INST_REL_GT:
6501 dbg_exec("BC_INST_BOOL:");
6502 s = zbc_program_logical(inst);
6505 dbg_exec("BC_INST_READ:");
6506 s = zbc_program_read();
6507 goto read_updated_ip;
6509 dbg_exec("BC_INST_VAR:");
6510 s = zbc_program_pushVar(code, &ip->inst_idx, false, false);
6512 case BC_INST_ARRAY_ELEM:
6514 dbg_exec("BC_INST_ARRAY[_ELEM]:");
6515 s = zbc_program_pushArray(code, &ip->inst_idx, inst);
6518 r.t = BC_RESULT_LAST;
6519 bc_vec_push(&G.prog.results, &r);
6524 bc_program_pushGlobal(inst);
6526 case BC_INST_SCALE_FUNC:
6527 case BC_INST_LENGTH:
6529 dbg_exec("BC_INST_builtin:");
6530 s = zbc_program_builtin(inst);
6533 dbg_exec("BC_INST_NUM:");
6534 r.t = BC_RESULT_CONSTANT;
6535 r.d.id.idx = bc_program_index(code, &ip->inst_idx);
6536 bc_vec_push(&G.prog.results, &r);
6539 dbg_exec("BC_INST_POP:");
6540 if (!STACK_HAS_MORE_THAN(&G.prog.results, 0))
6541 s = bc_error_stack_has_too_few_elements();
6543 bc_vec_pop(&G.prog.results);
6545 case BC_INST_POP_EXEC:
6546 dbg_exec("BC_INST_POP_EXEC:");
6547 bc_vec_pop(&G.prog.exestack);
6548 goto read_updated_ip;
6550 case BC_INST_PRINT_POP:
6551 case BC_INST_PRINT_STR:
6552 dbg_exec("BC_INST_PRINTxyz:");
6553 s = zbc_program_print(inst, 0);
6556 dbg_exec("BC_INST_STR:");
6557 r.t = BC_RESULT_STR;
6558 r.d.id.idx = bc_program_index(code, &ip->inst_idx);
6559 bc_vec_push(&G.prog.results, &r);
6562 case BC_INST_MULTIPLY:
6563 case BC_INST_DIVIDE:
6564 case BC_INST_MODULUS:
6567 dbg_exec("BC_INST_binaryop:");
6568 s = zbc_program_op(inst);
6570 case BC_INST_BOOL_NOT:
6571 dbg_exec("BC_INST_BOOL_NOT:");
6572 s = zbc_program_prep(&ptr, &num);
6573 if (s) RETURN_STATUS(s);
6574 bc_num_init_DEF_SIZE(&r.d.n);
6575 if (!bc_num_cmp(num, &G.prog.zero))
6577 //else bc_num_zero(&r.d.n); - already is
6578 bc_program_retire(&r, BC_RESULT_TEMP);
6581 dbg_exec("BC_INST_NEG:");
6582 s = zbc_program_negate();
6585 case BC_INST_ASSIGN_POWER:
6586 case BC_INST_ASSIGN_MULTIPLY:
6587 case BC_INST_ASSIGN_DIVIDE:
6588 case BC_INST_ASSIGN_MODULUS:
6589 case BC_INST_ASSIGN_PLUS:
6590 case BC_INST_ASSIGN_MINUS:
6592 case BC_INST_ASSIGN:
6593 dbg_exec("BC_INST_ASSIGNxyz:");
6594 s = zbc_program_assign(inst);
6597 case BC_INST_MODEXP:
6598 s = zdc_program_modexp();
6600 case BC_INST_DIVMOD:
6601 s = zdc_program_divmod();
6603 case BC_INST_EXECUTE:
6604 case BC_INST_EXEC_COND:
6605 s = zdc_program_execStr(code, &ip->inst_idx, inst == BC_INST_EXEC_COND);
6606 goto read_updated_ip;
6607 case BC_INST_PRINT_STACK: {
6609 for (idx = 0; idx < G.prog.results.len; ++idx) {
6610 s = zbc_program_print(BC_INST_PRINT, idx);
6615 case BC_INST_CLEAR_STACK:
6616 bc_vec_pop_all(&G.prog.results);
6618 case BC_INST_STACK_LEN:
6619 dc_program_stackLen();
6621 case BC_INST_DUPLICATE:
6622 if (!STACK_HAS_MORE_THAN(&G.prog.results, 0))
6623 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6624 ptr = bc_vec_top(&G.prog.results);
6625 dc_result_copy(&r, ptr);
6626 bc_vec_push(&G.prog.results, &r);
6628 case BC_INST_SWAP: {
6630 if (!STACK_HAS_MORE_THAN(&G.prog.results, 1))
6631 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6632 ptr = bc_vec_item_rev(&G.prog.results, 0);
6633 ptr2 = bc_vec_item_rev(&G.prog.results, 1);
6634 memcpy(&r, ptr, sizeof(BcResult));
6635 memcpy(ptr, ptr2, sizeof(BcResult));
6636 memcpy(ptr2, &r, sizeof(BcResult));
6639 case BC_INST_ASCIIFY:
6640 s = zdc_program_asciify();
6642 case BC_INST_PRINT_STREAM:
6643 s = zdc_program_printStream();
6646 case BC_INST_PUSH_VAR: {
6647 bool copy = inst == BC_INST_LOAD;
6648 s = zbc_program_pushVar(code, &ip->inst_idx, true, copy);
6651 case BC_INST_PUSH_TO_VAR: {
6652 char *name = bc_program_name(code, &ip->inst_idx);
6653 s = zbc_program_copyToVar(name, true);
6658 dbg_exec("BC_INST_QUIT:");
6659 if (G.prog.exestack.len <= 2)
6660 QUIT_OR_RETURN_TO_MAIN;
6661 bc_vec_npop(&G.prog.exestack, 2);
6662 goto read_updated_ip;
6664 s = zdc_program_nquit();
6665 //goto read_updated_ip; - just fall through to it
6668 // Instruction stack has changed, read new pointers
6669 ip = bc_vec_top(&G.prog.exestack);
6670 func = bc_program_func(ip->func);
6671 code = func->code.v;
6672 dbg_exec("func:%zd bytes:%zd ip:%zd", ip->func, func->code.len, ip->inst_idx);
6675 if (s || G_interrupt) {
6683 RETURN_STATUS(BC_STATUS_SUCCESS);
6685 #define zbc_program_exec(...) (zbc_program_exec(__VA_ARGS__) COMMA_SUCCESS)
6687 static unsigned bc_vm_envLen(const char *var)
6693 len = BC_NUM_PRINT_WIDTH;
6694 if (!lenv) return len;
6696 len = bb_strtou(lenv, NULL, 10) - 1;
6697 if (errno || len < 2 || len >= INT_MAX)
6698 len = BC_NUM_PRINT_WIDTH;
6703 static BC_STATUS zbc_vm_process(const char *text)
6707 dbg_lex_enter("%s:%d entered", __func__, __LINE__);
6708 s = zbc_parse_text_init(&G.prs, text);
6709 if (s) RETURN_STATUS(s);
6711 while (G.prs.l.t.t != BC_LEX_EOF) {
6712 dbg_lex("%s:%d G.prs.l.t.t:%d", __func__, __LINE__, G.prs.l.t.t);
6713 s = zcommon_parse(&G.prs);
6714 if (s) RETURN_STATUS(s);
6715 s = zbc_program_exec();
6720 // bc discards strings, constants and code after each
6721 // top-level statement in the "main program".
6722 // This prevents "yes 1 | bc" from growing its memory
6723 // without bound. This can be done because data stack
6724 // is empty and thus can't hold any references to
6725 // strings or constants, there is no generated code
6726 // which can hold references (after we discard one
6727 // we just executed). Code of functions can have references,
6728 // but bc stores function strings/constants in per-function
6732 BcInstPtr *ip = (void*)G.prog.exestack.v;
6735 if (G.prog.results.len != 0)
6736 bb_error_msg_and_die("data stack not empty: %d slots", G.prog.results.len);
6737 if (G.prog.exestack.len != 1) // should be empty
6738 bb_error_msg_and_die("BUG:call stack");
6739 if (ip->func != BC_PROG_MAIN)
6740 bb_error_msg_and_die("BUG:not MAIN");
6742 //bb_error_msg("ip->func:%d >idx:%d >len:%d", ip->func, ip->inst_idx, ip->len);
6743 f = bc_program_func_BC_PROG_MAIN();
6744 //bb_error_msg("MAIN->code.len:%d >strs.len:%d >consts.len:%d", f->code.len, f->strs.len, f->consts.len); // labels, autos, nparams
6745 bc_vec_pop_all(&f->code);
6747 IF_BC(bc_vec_pop_all(&f->strs);)
6748 IF_BC(bc_vec_pop_all(&f->consts);)
6752 dbg_lex_done("%s:%d done", __func__, __LINE__);
6755 #define zbc_vm_process(...) (zbc_vm_process(__VA_ARGS__) COMMA_SUCCESS)
6757 static BC_STATUS zbc_vm_execute_FILE(FILE *fp, const char *filename)
6759 // So far bc/dc have no way to include a file from another file,
6760 // therefore we know G.prog.file == NULL on entry
6761 //const char *sv_file;
6764 G.prog.file = filename;
6766 bc_lex_file(&G.prs.l);
6769 s = zbc_vm_process("");
6770 // We do not stop looping on errors here if reading stdin.
6771 // Example: start interactive bc and enter "return".
6772 // It should say "'return' not in a function"
6773 // but should not exit.
6774 } while (G.input_fp == stdin);
6778 #define zbc_vm_execute_FILE(...) (zbc_vm_execute_FILE(__VA_ARGS__) COMMA_SUCCESS)
6780 static BC_STATUS zbc_vm_file(const char *file)
6785 fp = xfopen_for_read(file);
6786 s = zbc_vm_execute_FILE(fp, file);
6791 #define zbc_vm_file(...) (zbc_vm_file(__VA_ARGS__) COMMA_SUCCESS)
6794 static void bc_vm_info(void)
6796 printf("%s "BB_VER"\n"
6797 "Copyright (c) 2018 Gavin D. Howard and contributors\n"
6801 static void bc_args(char **argv)
6807 #if ENABLE_FEATURE_BC_LONG_OPTIONS
6808 opts = option_mask32 |= getopt32long(argv, "wvsqli",
6809 "warn\0" No_argument "w"
6810 "version\0" No_argument "v"
6811 "standard\0" No_argument "s"
6812 "quiet\0" No_argument "q"
6813 "mathlib\0" No_argument "l"
6814 "interactive\0" No_argument "i"
6817 opts = option_mask32 |= getopt32(argv, "wvsqli");
6819 if (getenv("POSIXLY_CORRECT"))
6820 option_mask32 |= BC_FLAG_S;
6822 if (opts & BC_FLAG_V) {
6827 for (i = optind; argv[i]; ++i)
6828 bc_vec_push(&G.files, argv + i);
6831 static void bc_vm_envArgs(void)
6835 char *env_args = getenv("BC_ENV_ARGS");
6837 if (!env_args) return;
6839 G.env_args = xstrdup(env_args);
6842 bc_vec_init(&v, sizeof(char *), NULL);
6844 while (*(buf = skip_whitespace(buf)) != '\0') {
6845 bc_vec_push(&v, &buf);
6846 buf = skip_non_whitespace(buf);
6852 // NULL terminate, and pass argv[] so that first arg is argv[1]
6853 if (sizeof(int) == sizeof(char*)) {
6854 bc_vec_push(&v, &const_int_0);
6856 static char *const nullptr = NULL;
6857 bc_vec_push(&v, &nullptr);
6859 bc_args(((char **)v.v) - 1);
6864 static const char bc_lib[] ALIGN1 = {
6867 "\n" "auto b,s,n,r,d,i,p,f,v"
6868 ////////////////"if(x<0)return(1/e(-x))" // and drop 'n' and x<0 logic below
6869 //^^^^^^^^^^^^^^^^ this would work, and is even more precise than GNU bc:
6870 //e(-.998896): GNU:.36828580434569428695
6871 // above code:.36828580434569428696
6872 // actual value:.3682858043456942869594...
6873 // but for now let's be "GNU compatible"
6882 "\n" "scale=scale(x)+1"
6892 "\n" "for(i=2;v;++i){"
6898 "\n" "while(d--)r*=r"
6901 "\n" "if(n)return(1/r)"
6905 "\n" "auto b,s,r,p,a,q,i,v"
6909 "\n" "r=(1-10^scale)/1"
6920 "\n" "while(x<=.5){"
6924 "\n" "r=a=(x-1)/(x+1)"
6927 "\n" "for(i=3;v;i+=2){"
6938 "\n" "auto b,s,r,a,q,i"
6939 "\n" "if(x<0)return(-s(-x))"
6943 "\n" "scale=1.1*s+2"
6952 "\n" "for(i=3;a;i+=2){"
6953 "\n" "a*=q/(i*(i-1))"
6966 "\n" "x=s(2*a(1)+x)"
6972 "\n" "auto b,s,r,n,a,m,t,f,i,u"
6980 "\n" "if(scale<65){"
6981 "\n" "if(x==1)return(.7853981633974483096156608458198757210492923498437764552437361480/n)"
6982 "\n" "if(x==.2)return(.1973955598498807583700497651947902934475851037878521015176889402/n)"
6992 "\n" "x=(x-.2)/(1+.2*x)"
6997 "\n" "for(i=3;t;i+=2){"
7004 "\n" "return((m*a+r)/n)"
7006 "\n" "define j(n,x){"
7007 "\n" "auto b,s,o,a,i,v,f"
7018 "\n" "for(i=2;i<=n;++i)a*=i"
7020 "\n" "a=(x^n)/2^n/a"
7023 "\n" "scale+=length(a)-scale(a)"
7024 "\n" "for(i=1;v;++i){"
7025 "\n" "v=v*f/i/(n+i)"
7031 "\n" "return(a*r/1)"
7036 static BC_STATUS zbc_vm_exec(void)
7043 if (option_mask32 & BC_FLAG_L) {
7044 // We know that internal library is not buggy,
7045 // thus error checking is normally disabled.
7046 # define DEBUG_LIB 0
7047 bc_lex_file(&G.prs.l);
7048 s = zbc_vm_process(bc_lib);
7049 if (DEBUG_LIB && s) RETURN_STATUS(s);
7053 s = BC_STATUS_SUCCESS;
7054 fname = (void*)G.files.v;
7055 for (i = 0; i < G.files.len; i++) {
7056 s = zbc_vm_file(*fname++);
7057 if (ENABLE_FEATURE_CLEAN_UP && !G_ttyin && s) {
7058 // Debug config, non-interactive mode:
7059 // return all the way back to main.
7060 // Non-debug builds do not come here
7061 // in non-interactive mode, they exit.
7066 if (IS_BC || (option_mask32 & BC_FLAG_I))
7067 s = zbc_vm_execute_FILE(stdin, /*filename:*/ NULL);
7071 #define zbc_vm_exec(...) (zbc_vm_exec(__VA_ARGS__) COMMA_SUCCESS)
7073 #if ENABLE_FEATURE_CLEAN_UP
7074 static void bc_program_free(void)
7076 bc_vec_free(&G.prog.fns);
7077 IF_BC(bc_vec_free(&G.prog.fn_map);)
7078 bc_vec_free(&G.prog.vars);
7079 bc_vec_free(&G.prog.var_map);
7080 bc_vec_free(&G.prog.arrs);
7081 bc_vec_free(&G.prog.arr_map);
7082 IF_DC(bc_vec_free(&G.prog.strs);)
7083 IF_DC(bc_vec_free(&G.prog.consts);)
7084 bc_vec_free(&G.prog.results);
7085 bc_vec_free(&G.prog.exestack);
7086 IF_BC(bc_num_free(&G.prog.last);)
7087 IF_BC(bc_num_free(&G.prog.zero);)
7088 IF_BC(bc_num_free(&G.prog.one);)
7089 bc_vec_free(&G.input_buffer);
7092 static void bc_vm_free(void)
7094 bc_vec_free(&G.files);
7096 bc_parse_free(&G.prs);
7101 static void bc_program_init(void)
7105 // memset(&G.prog, 0, sizeof(G.prog)); - already is
7106 memset(&ip, 0, sizeof(BcInstPtr));
7108 // G.prog.nchars = G.prog.scale = 0; - already is
7112 IF_BC(bc_num_init_DEF_SIZE(&G.prog.last);)
7113 //IF_BC(bc_num_zero(&G.prog.last);) - already is
7115 bc_num_init_DEF_SIZE(&G.prog.zero);
7116 //bc_num_zero(&G.prog.zero); - already is
7118 IF_BC(bc_num_init_DEF_SIZE(&G.prog.one);)
7119 IF_BC(bc_num_one(&G.prog.one);)
7121 bc_vec_init(&G.prog.fns, sizeof(BcFunc), bc_func_free);
7122 IF_BC(bc_vec_init(&G.prog.fn_map, sizeof(BcId), bc_id_free);)
7125 // Names are chosen simply to never match
7126 // a valid function name (and be short)
7127 IF_BC(bc_program_addFunc(xstrdup(""))); // func #0: main
7128 IF_BC(bc_program_addFunc(xstrdup(""))); // func #1: for read()
7130 bc_program_add_fn();
7131 bc_program_add_fn();
7134 bc_vec_init(&G.prog.vars, sizeof(BcVec), bc_vec_free);
7135 bc_vec_init(&G.prog.var_map, sizeof(BcId), bc_id_free);
7137 bc_vec_init(&G.prog.arrs, sizeof(BcVec), bc_vec_free);
7138 bc_vec_init(&G.prog.arr_map, sizeof(BcId), bc_id_free);
7140 IF_DC(bc_vec_init(&G.prog.strs, sizeof(char *), bc_string_free);)
7141 IF_DC(bc_vec_init(&G.prog.consts, sizeof(char *), bc_string_free);)
7142 bc_vec_init(&G.prog.results, sizeof(BcResult), bc_result_free);
7143 bc_vec_init(&G.prog.exestack, sizeof(BcInstPtr), NULL);
7144 bc_vec_push(&G.prog.exestack, &ip);
7146 bc_char_vec_init(&G.input_buffer);
7149 static int bc_vm_init(const char *env_len)
7151 #if ENABLE_FEATURE_EDITING
7152 G.line_input_state = new_line_input_t(DO_HISTORY);
7154 G.prog.len = bc_vm_envLen(env_len);
7156 bc_vec_init(&G.files, sizeof(char *), NULL);
7157 IF_BC(if (IS_BC) bc_vm_envArgs();)
7159 bc_parse_create(&G.prs, BC_PROG_MAIN);
7161 //TODO: in GNU bc, the check is (isatty(0) && isatty(1)),
7162 //-i option unconditionally enables this regardless of isatty():
7164 #if ENABLE_FEATURE_BC_SIGNALS
7166 // With SA_RESTART, most system calls will restart
7167 // (IOW: they won't fail with EINTR).
7168 // In particular, this means ^C won't cause
7169 // stdout to get into "error state" if SIGINT hits
7170 // within write() syscall.
7172 // The downside is that ^C while tty input is taken
7173 // will only be handled after [Enter] since read()
7174 // from stdin is not interrupted by ^C either,
7175 // it restarts, thus fgetc() does not return on ^C.
7176 // (This problem manifests only if line editing is disabled)
7177 signal_SA_RESTART_empty_mask(SIGINT, record_signo);
7179 // Without SA_RESTART, this exhibits a bug:
7180 // "while (1) print 1" and try ^C-ing it.
7181 // Intermittently, instead of returning to input line,
7182 // you'll get "output error: Interrupted system call"
7184 //signal_no_SA_RESTART_empty_mask(SIGINT, record_signo);
7188 return 0; // "not a tty"
7191 static BcStatus bc_vm_run(void)
7193 BcStatus st = zbc_vm_exec();
7194 #if ENABLE_FEATURE_CLEAN_UP
7195 if (G_exiting) // it was actually "halt" or "quit"
7198 # if ENABLE_FEATURE_EDITING
7199 free_line_input_t(G.line_input_state);
7203 dbg_exec("exiting with exitcode %d", st);
7208 int bc_main(int argc, char **argv) MAIN_EXTERNALLY_VISIBLE;
7209 int bc_main(int argc UNUSED_PARAM, char **argv)
7215 is_tty = bc_vm_init("BC_LINE_LENGTH");
7219 if (is_tty && !(option_mask32 & BC_FLAG_Q))
7227 int dc_main(int argc, char **argv) MAIN_EXTERNALLY_VISIBLE;
7228 int dc_main(int argc UNUSED_PARAM, char **argv)
7234 // TODO: dc (GNU bc 1.07.1) 1.4.1 seems to use width
7235 // 1 char wider than bc from the same package.
7236 // Both default width, and xC_LINE_LENGTH=N are wider:
7237 // "DC_LINE_LENGTH=5 dc -e'123456 p'" prints:
7240 // "echo '123456' | BC_LINE_LENGTH=5 bc" prints:
7243 // Do the same, or it's a bug?
7244 bc_vm_init("DC_LINE_LENGTH");
7246 // Run -e'SCRIPT' and -fFILE in order of appearance, then handle FILEs
7247 noscript = BC_FLAG_I;
7249 int n = getopt(argc, argv, "e:f:x");
7255 n = zbc_vm_process(optarg);
7260 n = zbc_vm_file(optarg);
7264 option_mask32 |= DC_FLAG_X;
7274 bc_vec_push(&G.files, argv++);
7277 option_mask32 |= noscript; // set BC_FLAG_I if we need to interpret stdin
7283 #endif // not DC_SMALL