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,
325 BC_INST_PRINT_STREAM,
340 BC_INST_INVALID = -1,
344 typedef struct BcId {
349 typedef struct BcFunc {
355 IF_BC(size_t nparams;)
358 typedef enum BcResultType {
362 BC_RESULT_ARRAY_ELEM,
367 //code uses "inst - BC_INST_IBASE + BC_RESULT_IBASE" construct,
368 BC_RESULT_IBASE, // relative order should match for: BC_INST_IBASE
369 BC_RESULT_SCALE, // relative order should match for: BC_INST_SCALE
370 BC_RESULT_LAST, // relative order should match for: BC_INST_LAST
373 BC_RESULT_OBASE, // relative order should match for: BC_INST_OBASE
376 typedef union BcResultData {
382 typedef struct BcResult {
387 typedef struct BcInstPtr {
390 IF_BC(size_t results_len_before_call;)
393 // BC_LEX_NEG is not used in lexing; it is only for parsing.
394 typedef enum BcLexType {
421 BC_LEX_OP_ASSIGN_POWER,
422 BC_LEX_OP_ASSIGN_MULTIPLY,
423 BC_LEX_OP_ASSIGN_DIVIDE,
424 BC_LEX_OP_ASSIGN_MODULUS,
425 BC_LEX_OP_ASSIGN_PLUS,
426 BC_LEX_OP_ASSIGN_MINUS,
439 BC_LEX_LBRACE, // '{' is 0x7B, '}' is 0x7D,
441 BC_LEX_RBRACE, // should be LBRACE+2: code uses (c - '{' + BC_LEX_LBRACE)
447 BC_LEX_KEY_1st_keyword,
448 BC_LEX_KEY_AUTO = BC_LEX_KEY_1st_keyword,
455 // code uses "type - BC_LEX_KEY_IBASE + BC_INST_IBASE" construct,
456 BC_LEX_KEY_IBASE, // relative order should match for: BC_INST_IBASE
458 BC_LEX_KEY_LAST, // relative order should match for: BC_INST_LAST
461 BC_LEX_KEY_OBASE, // relative order should match for: BC_INST_OBASE
488 // code uses "t - BC_LEX_STORE_IBASE + BC_INST_IBASE" construct,
489 BC_LEX_STORE_IBASE, // relative order should match for: BC_INST_IBASE
490 BC_LEX_STORE_SCALE, // relative order should match for: BC_INST_SCALE
494 BC_LEX_STORE_OBASE, // relative order should match for: BC_INST_OBASE
500 // must match order of BC_LEX_KEY_foo etc above
502 struct BcLexKeyword {
505 #define BC_LEX_KW_ENTRY(a, b) \
506 { .name8 = a /*, .posix = b */ }
507 static const struct BcLexKeyword bc_lex_kws[20] = {
508 BC_LEX_KW_ENTRY("auto" , 1), // 0
509 BC_LEX_KW_ENTRY("break" , 1), // 1
510 BC_LEX_KW_ENTRY("continue", 0), // 2 note: this one has no terminating NUL
511 BC_LEX_KW_ENTRY("define" , 1), // 3
512 BC_LEX_KW_ENTRY("else" , 0), // 4
513 BC_LEX_KW_ENTRY("for" , 1), // 5
514 BC_LEX_KW_ENTRY("halt" , 0), // 6
515 BC_LEX_KW_ENTRY("ibase" , 1), // 7
516 BC_LEX_KW_ENTRY("if" , 1), // 8
517 BC_LEX_KW_ENTRY("last" , 0), // 9
518 BC_LEX_KW_ENTRY("length" , 1), // 10
519 BC_LEX_KW_ENTRY("limits" , 0), // 11
520 BC_LEX_KW_ENTRY("obase" , 1), // 12
521 BC_LEX_KW_ENTRY("print" , 0), // 13
522 BC_LEX_KW_ENTRY("quit" , 1), // 14
523 BC_LEX_KW_ENTRY("read" , 0), // 15
524 BC_LEX_KW_ENTRY("return" , 1), // 16
525 BC_LEX_KW_ENTRY("scale" , 1), // 17
526 BC_LEX_KW_ENTRY("sqrt" , 1), // 18
527 BC_LEX_KW_ENTRY("while" , 1), // 19
529 #undef BC_LEX_KW_ENTRY
530 #define STRING_if (bc_lex_kws[8].name8)
531 #define STRING_else (bc_lex_kws[4].name8)
532 #define STRING_while (bc_lex_kws[19].name8)
533 #define STRING_for (bc_lex_kws[5].name8)
557 #define bc_lex_kws_POSIX(i) ((1 << (i)) & POSIX_KWORD_MASK)
559 // This is a bit array that corresponds to token types. An entry is
560 // true if the token is valid in an expression, false otherwise.
561 // Used to figure out when expr parsing should stop *without error message*
562 // - 0 element indicates this condition. 1 means "this token is to be eaten
563 // as part of the expression", token can them still be determined to be invalid
564 // by later processing.
566 #define EXBITS(a,b,c,d,e,f,g,h) \
567 ((uint64_t)((a << 0)+(b << 1)+(c << 2)+(d << 3)+(e << 4)+(f << 5)+(g << 6)+(h << 7)))
568 BC_PARSE_EXPRS_BITS = 0
569 + (EXBITS(0,0,1,1,1,1,1,1) << (0*8)) // 0: eof inval ++ -- - ^ * /
570 + (EXBITS(1,1,1,1,1,1,1,1) << (1*8)) // 8: % + - == <= >= != <
571 + (EXBITS(1,1,1,1,1,1,1,1) << (2*8)) // 16: > ! || && ^= *= /= %=
572 + (EXBITS(1,1,1,0,0,1,1,0) << (3*8)) // 24: += -= = NL WS ( ) [
573 + (EXBITS(0,0,0,0,0,0,1,1) << (4*8)) // 32: , ] { ; } STR NAME NUM
574 + (EXBITS(0,0,0,0,0,0,0,1) << (5*8)) // 40: auto break cont define else for halt ibase
575 + (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?
576 + (EXBITS(0,1,1,0,0,0,0,0) << (7*8)) // 56: return scale sqrt while
579 static ALWAYS_INLINE long bc_parse_exprs(unsigned i)
581 #if ULONG_MAX > 0xffffffff
582 // 64-bit version (will not work correctly for 32-bit longs!)
583 return BC_PARSE_EXPRS_BITS & (1UL << i);
586 unsigned long m = (uint32_t)BC_PARSE_EXPRS_BITS;
588 m = (uint32_t)(BC_PARSE_EXPRS_BITS >> 32);
591 return m & (1UL << i);
595 // This is an array of data for operators that correspond to
596 // [BC_LEX_OP_INC...BC_LEX_OP_ASSIGN] token types.
597 static const uint8_t bc_parse_ops[] = {
598 #define OP(p,l) ((int)(l) * 0x10 + (p))
599 OP(0, false), OP( 0, false ), // inc dec
602 OP(3, true ), OP( 3, true ), OP( 3, true ), // mul div mod
603 OP(4, true ), OP( 4, true ), // + -
604 OP(6, true ), OP( 6, true ), OP( 6, true ), OP( 6, true ), OP( 6, true ), OP( 6, true ), // == <= >= != < >
606 OP(7, true ), OP( 7, true ), // or and
607 OP(5, false), OP( 5, false ), OP( 5, false ), OP( 5, false ), OP( 5, false ), // ^= *= /= %= +=
608 OP(5, false), OP( 5, false ), // -= =
611 #define bc_parse_op_PREC(i) (bc_parse_ops[i] & 0x0f)
612 #define bc_parse_op_LEFT(i) (bc_parse_ops[i] & 0x10)
616 static const //BcInst - should be this type. Using signed narrow type since BC_INST_INVALID is -1
619 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID, BC_INST_REL_GE,
620 BC_INST_INVALID, BC_INST_POWER, BC_INST_MULTIPLY, BC_INST_DIVIDE,
621 BC_INST_MODULUS, BC_INST_PLUS, BC_INST_MINUS,
622 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID,
623 BC_INST_INVALID, BC_INST_INVALID,
624 BC_INST_BOOL_NOT, BC_INST_INVALID, BC_INST_INVALID,
625 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID,
626 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID,
627 BC_INST_INVALID, BC_INST_INVALID, BC_INST_REL_GT, BC_INST_INVALID,
628 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID, BC_INST_REL_GE,
629 BC_INST_INVALID, BC_INST_INVALID,
630 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID,
631 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID,
632 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID, BC_INST_IBASE,
633 BC_INST_INVALID, BC_INST_INVALID, BC_INST_LENGTH, BC_INST_INVALID,
634 BC_INST_OBASE, BC_INST_PRINT, BC_INST_QUIT, BC_INST_INVALID,
635 BC_INST_INVALID, BC_INST_SCALE, BC_INST_SQRT, BC_INST_INVALID,
636 BC_INST_REL_EQ, BC_INST_MODEXP, BC_INST_DIVMOD, BC_INST_INVALID,
637 BC_INST_INVALID, BC_INST_EXECUTE, BC_INST_PRINT_STACK, BC_INST_CLEAR_STACK,
638 BC_INST_STACK_LEN, BC_INST_DUPLICATE, BC_INST_SWAP, BC_INST_POP,
639 BC_INST_ASCIIFY, BC_INST_PRINT_STREAM, BC_INST_INVALID, BC_INST_INVALID,
640 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID,
641 BC_INST_PRINT, BC_INST_NQUIT, BC_INST_SCALE_FUNC,
645 typedef struct BcLex {
658 #define BC_PARSE_STREND (0xff)
661 # define BC_PARSE_REL (1 << 0)
662 # define BC_PARSE_PRINT (1 << 1)
663 # define BC_PARSE_ARRAY (1 << 2)
664 # define BC_PARSE_NOCALL (1 << 3)
667 typedef struct BcParse {
677 IF_BC(size_t in_funcdef;)
680 typedef struct BcProgram {
710 #define BC_PROG_MAIN (0)
711 #define BC_PROG_READ (1)
713 #define BC_PROG_REQ_FUNCS (2)
716 #define BC_PROG_STR(n) (!(n)->num && !(n)->cap)
717 #define BC_PROG_NUM(r, n) \
718 ((r)->t != BC_RESULT_ARRAY && (r)->t != BC_RESULT_STR && !BC_PROG_STR(n))
720 #define BC_FLAG_W (1 << 0)
721 #define BC_FLAG_V (1 << 1)
722 #define BC_FLAG_S (1 << 2)
723 #define BC_FLAG_Q (1 << 3)
724 #define BC_FLAG_L (1 << 4)
725 #define BC_FLAG_I (1 << 5)
726 #define DC_FLAG_X (1 << 6)
728 #define BC_MAX(a, b) ((a) > (b) ? (a) : (b))
729 #define BC_MIN(a, b) ((a) < (b) ? (a) : (b))
731 #define BC_MAX_OBASE ((unsigned) 999)
732 #define BC_MAX_DIM ((unsigned) INT_MAX)
733 #define BC_MAX_SCALE ((unsigned) UINT_MAX)
734 #define BC_MAX_STRING ((unsigned) UINT_MAX - 1)
735 #define BC_MAX_NUM BC_MAX_STRING
736 // Unused apart from "limits" message. Just show a "biggish number" there.
737 //#define BC_MAX_NAME BC_MAX_STRING
738 //#define BC_MAX_EXP ((unsigned long) LONG_MAX)
739 //#define BC_MAX_VARS ((unsigned long) SIZE_MAX - 1)
740 #define BC_MAX_NAME_STR "999999999"
741 #define BC_MAX_EXP_STR "999999999"
742 #define BC_MAX_VARS_STR "999999999"
744 #define BC_MAX_OBASE_STR "999"
746 #if INT_MAX == 2147483647
747 # define BC_MAX_DIM_STR "2147483647"
748 #elif INT_MAX == 9223372036854775807
749 # define BC_MAX_DIM_STR "9223372036854775807"
751 # error Strange INT_MAX
754 #if UINT_MAX == 4294967295
755 # define BC_MAX_SCALE_STR "4294967295"
756 # define BC_MAX_STRING_STR "4294967294"
757 #elif UINT_MAX == 18446744073709551615
758 # define BC_MAX_SCALE_STR "18446744073709551615"
759 # define BC_MAX_STRING_STR "18446744073709551614"
761 # error Strange UINT_MAX
763 #define BC_MAX_NUM_STR BC_MAX_STRING_STR
766 IF_FEATURE_BC_SIGNALS(smallint ttyin;)
767 IF_FEATURE_CLEAN_UP(smallint exiting;)
772 // For error messages. Can be set to current parsed line,
773 // or [TODO] to current executing line (can be before last parsed one)
782 #if ENABLE_FEATURE_EDITING
783 line_input_t *line_input_state;
786 #define G (*ptr_to_globals)
787 #define INIT_G() do { \
788 SET_PTR_TO_GLOBALS(xzalloc(sizeof(G))); \
790 #define FREE_G() do { \
791 FREE_PTR_TO_GLOBALS(); \
793 #define G_posix (ENABLE_BC && (option_mask32 & BC_FLAG_S))
794 #define G_warn (ENABLE_BC && (option_mask32 & BC_FLAG_W))
795 #define G_exreg (ENABLE_DC && (option_mask32 & DC_FLAG_X))
796 #if ENABLE_FEATURE_BC_SIGNALS
797 # define G_interrupt bb_got_signal
798 # define G_ttyin G.ttyin
800 # define G_interrupt 0
803 #if ENABLE_FEATURE_CLEAN_UP
804 # define G_exiting G.exiting
808 #define IS_BC (ENABLE_BC && (!ENABLE_DC || applet_name[0] == 'b'))
809 #define IS_DC (ENABLE_DC && (!ENABLE_BC || applet_name[0] != 'b'))
811 // In configurations where errors abort instead of propagating error
812 // return code up the call chain, functions returning BC_STATUS
813 // actually don't return anything, they always succeed and return "void".
814 // A macro wrapper is provided, which makes this statement work:
816 // and makes it visible to the compiler that s is always zero,
817 // allowing compiler to optimize dead code after the statement.
819 // To make code more readable, each such function has a "z"
820 // ("always returning zero") prefix, i.e. zbc_foo or zdc_foo.
822 #if ENABLE_FEATURE_BC_SIGNALS || ENABLE_FEATURE_CLEAN_UP
823 # define ERRORS_ARE_FATAL 0
824 # define ERRORFUNC /*nothing*/
825 # define IF_ERROR_RETURN_POSSIBLE(a) a
826 # define BC_STATUS BcStatus
827 # define RETURN_STATUS(v) return (v)
828 # define COMMA_SUCCESS /*nothing*/
830 # define ERRORS_ARE_FATAL 1
831 # define ERRORFUNC NORETURN
832 # define IF_ERROR_RETURN_POSSIBLE(a) /*nothing*/
833 # define BC_STATUS void
834 # define RETURN_STATUS(v) do { ((void)(v)); return; } while (0)
835 # define COMMA_SUCCESS ,BC_STATUS_SUCCESS
838 #define STACK_HAS_MORE_THAN(s, n) ((s)->len > ((size_t)(n)))
839 #define STACK_HAS_EQUAL_OR_MORE_THAN(s, n) ((s)->len >= ((size_t)(n)))
841 #define BC_NUM_NEG(n, neg) ((((ssize_t)(n)) ^ -((ssize_t)(neg))) + (neg))
842 #define BC_NUM_ONE(n) ((n)->len == 1 && (n)->rdx == 0 && (n)->num[0] == 1)
843 #define BC_NUM_INT(n) ((n)->len - (n)->rdx)
844 //#define BC_NUM_AREQ(a, b) (BC_MAX((a)->rdx, (b)->rdx) + BC_MAX(BC_NUM_INT(a), BC_NUM_INT(b)) + 1)
845 static /*ALWAYS_INLINE*/ size_t BC_NUM_AREQ(BcNum *a, BcNum *b)
847 return BC_MAX(a->rdx, b->rdx) + BC_MAX(BC_NUM_INT(a), BC_NUM_INT(b)) + 1;
849 //#define BC_NUM_MREQ(a, b, scale) (BC_NUM_INT(a) + BC_NUM_INT(b) + BC_MAX((scale), (a)->rdx + (b)->rdx) + 1)
850 static /*ALWAYS_INLINE*/ size_t BC_NUM_MREQ(BcNum *a, BcNum *b, size_t scale)
852 return BC_NUM_INT(a) + BC_NUM_INT(b) + BC_MAX(scale, a->rdx + b->rdx) + 1;
855 typedef void (*BcNumDigitOp)(size_t, size_t, bool) FAST_FUNC;
857 typedef BC_STATUS (*BcNumBinaryOp)(BcNum *, BcNum *, BcNum *, size_t) FAST_FUNC;
859 static BC_STATUS zbc_num_binary(BcNum *a, BcNum *b, BcNum *c, size_t scale,
860 BcNumBinaryOp op, size_t req);
861 static FAST_FUNC BC_STATUS zbc_num_a(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale);
862 static FAST_FUNC BC_STATUS zbc_num_s(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale);
863 static FAST_FUNC BC_STATUS zbc_num_p(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale);
864 static FAST_FUNC BC_STATUS zbc_num_m(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale);
865 static FAST_FUNC BC_STATUS zbc_num_d(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale);
866 static FAST_FUNC BC_STATUS zbc_num_rem(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale);
868 static FAST_FUNC BC_STATUS zbc_num_add(BcNum *a, BcNum *b, BcNum *c, size_t scale)
870 BcNumBinaryOp op = (!a->neg == !b->neg) ? zbc_num_a : zbc_num_s;
872 RETURN_STATUS(zbc_num_binary(a, b, c, false, op, BC_NUM_AREQ(a, b)));
875 static FAST_FUNC BC_STATUS zbc_num_sub(BcNum *a, BcNum *b, BcNum *c, size_t scale)
877 BcNumBinaryOp op = (!a->neg == !b->neg) ? zbc_num_s : zbc_num_a;
879 RETURN_STATUS(zbc_num_binary(a, b, c, true, op, BC_NUM_AREQ(a, b)));
882 static FAST_FUNC BC_STATUS zbc_num_mul(BcNum *a, BcNum *b, BcNum *c, size_t scale)
884 size_t req = BC_NUM_MREQ(a, b, scale);
885 RETURN_STATUS(zbc_num_binary(a, b, c, scale, zbc_num_m, req));
888 static FAST_FUNC BC_STATUS zbc_num_div(BcNum *a, BcNum *b, BcNum *c, size_t scale)
890 size_t req = BC_NUM_MREQ(a, b, scale);
891 RETURN_STATUS(zbc_num_binary(a, b, c, scale, zbc_num_d, req));
894 static FAST_FUNC BC_STATUS zbc_num_mod(BcNum *a, BcNum *b, BcNum *c, size_t scale)
896 size_t req = BC_NUM_MREQ(a, b, scale);
897 RETURN_STATUS(zbc_num_binary(a, b, c, scale, zbc_num_rem, req));
900 static FAST_FUNC BC_STATUS zbc_num_pow(BcNum *a, BcNum *b, BcNum *c, size_t scale)
902 RETURN_STATUS(zbc_num_binary(a, b, c, scale, zbc_num_p, a->len * b->len + 1));
905 static const BcNumBinaryOp zbc_program_ops[] = {
906 zbc_num_pow, zbc_num_mul, zbc_num_div, zbc_num_mod, zbc_num_add, zbc_num_sub,
908 #define zbc_num_add(...) (zbc_num_add(__VA_ARGS__) COMMA_SUCCESS)
909 #define zbc_num_sub(...) (zbc_num_sub(__VA_ARGS__) COMMA_SUCCESS)
910 #define zbc_num_mul(...) (zbc_num_mul(__VA_ARGS__) COMMA_SUCCESS)
911 #define zbc_num_div(...) (zbc_num_div(__VA_ARGS__) COMMA_SUCCESS)
912 #define zbc_num_mod(...) (zbc_num_mod(__VA_ARGS__) COMMA_SUCCESS)
913 #define zbc_num_pow(...) (zbc_num_pow(__VA_ARGS__) COMMA_SUCCESS)
915 static void fflush_and_check(void)
918 if (ferror(stdout) || ferror(stderr))
919 bb_perror_msg_and_die("output error");
922 #if ENABLE_FEATURE_CLEAN_UP
923 #define QUIT_OR_RETURN_TO_MAIN \
925 IF_FEATURE_BC_SIGNALS(G_ttyin = 0;) /* do not loop in main loop anymore */ \
927 return BC_STATUS_FAILURE; \
930 #define QUIT_OR_RETURN_TO_MAIN quit()
933 static void quit(void) NORETURN;
934 static void quit(void)
937 bb_perror_msg_and_die("input error");
939 dbg_exec("quit(): exiting with exitcode SUCCESS");
943 static void bc_verror_msg(const char *fmt, va_list p)
945 const char *sv = sv; // for compiler
948 applet_name = xasprintf("%s: %s:%u", applet_name, G.prog.file, G.err_line);
950 bb_verror_msg(fmt, p, NULL);
952 free((char*)applet_name);
957 static NOINLINE ERRORFUNC int bc_error_fmt(const char *fmt, ...)
962 bc_verror_msg(fmt, p);
965 if (ENABLE_FEATURE_CLEAN_UP || G_ttyin)
966 IF_ERROR_RETURN_POSSIBLE(return BC_STATUS_FAILURE);
971 static NOINLINE int bc_posix_error_fmt(const char *fmt, ...)
975 // Are non-POSIX constructs totally ok?
976 if (!(option_mask32 & (BC_FLAG_S|BC_FLAG_W)))
977 return BC_STATUS_SUCCESS; // yes
980 bc_verror_msg(fmt, p);
983 // Do we treat non-POSIX constructs as errors?
984 if (!(option_mask32 & BC_FLAG_S))
985 return BC_STATUS_SUCCESS; // no, it's a warning
986 if (ENABLE_FEATURE_CLEAN_UP || G_ttyin)
987 return BC_STATUS_FAILURE;
992 // We use error functions with "return bc_error(FMT[, PARAMS])" idiom.
993 // This idiom begs for tail-call optimization, but for it to work,
994 // function must not have caller-cleaned parameters on stack.
995 // Unfortunately, vararg function API does exactly that on most arches.
996 // Thus, use these shims for the cases when we have no vararg PARAMS:
997 static ERRORFUNC int bc_error(const char *msg)
999 IF_ERROR_RETURN_POSSIBLE(return) bc_error_fmt("%s", msg);
1001 static ERRORFUNC int bc_error_bad_character(char c)
1004 IF_ERROR_RETURN_POSSIBLE(return) bc_error("NUL character");
1005 IF_ERROR_RETURN_POSSIBLE(return) bc_error_fmt("bad character '%c'", c);
1007 static ERRORFUNC int bc_error_bad_expression(void)
1009 IF_ERROR_RETURN_POSSIBLE(return) bc_error("bad expression");
1011 static ERRORFUNC int bc_error_bad_token(void)
1013 IF_ERROR_RETURN_POSSIBLE(return) bc_error("bad token");
1015 static ERRORFUNC int bc_error_stack_has_too_few_elements(void)
1017 IF_ERROR_RETURN_POSSIBLE(return) bc_error("stack has too few elements");
1019 static ERRORFUNC int bc_error_variable_is_wrong_type(void)
1021 IF_ERROR_RETURN_POSSIBLE(return) bc_error("variable is wrong type");
1024 static int bc_POSIX_requires(const char *msg)
1026 return bc_posix_error_fmt("POSIX requires %s", msg);
1028 static int bc_POSIX_does_not_allow(const char *msg)
1030 return bc_posix_error_fmt("%s%s", "POSIX does not allow ", msg);
1032 static int bc_POSIX_does_not_allow_bool_ops_this_is_bad(const char *msg)
1034 return bc_posix_error_fmt("%s%s %s", "POSIX does not allow ", "boolean operators; the following is bad:", msg);
1036 static int bc_POSIX_does_not_allow_empty_X_expression_in_for(const char *msg)
1038 return bc_posix_error_fmt("%san empty %s expression in a for loop", "POSIX does not allow ", msg);
1042 static void bc_vec_grow(BcVec *v, size_t n)
1044 size_t cap = v->cap * 2;
1045 while (cap < v->len + n) cap *= 2;
1046 v->v = xrealloc(v->v, v->size * cap);
1050 static void bc_vec_init(BcVec *v, size_t esize, BcVecFree dtor)
1053 v->cap = BC_VEC_START_CAP;
1056 v->v = xmalloc(esize * BC_VEC_START_CAP);
1059 static void bc_char_vec_init(BcVec *v)
1061 bc_vec_init(v, sizeof(char), NULL);
1064 static void bc_vec_expand(BcVec *v, size_t req)
1067 v->v = xrealloc(v->v, v->size * req);
1072 static void bc_vec_pop(BcVec *v)
1076 v->dtor(v->v + (v->size * v->len));
1079 static void bc_vec_npop(BcVec *v, size_t n)
1084 size_t len = v->len - n;
1085 while (v->len > len) v->dtor(v->v + (v->size * --v->len));
1089 static void bc_vec_pop_all(BcVec *v)
1091 bc_vec_npop(v, v->len);
1094 static size_t bc_vec_push(BcVec *v, const void *data)
1096 size_t len = v->len;
1097 if (len >= v->cap) bc_vec_grow(v, 1);
1098 memmove(v->v + (v->size * len), data, v->size);
1103 // G.prog.results often needs "pop old operand, push result" idiom.
1104 // Can do this without a few extra ops
1105 static size_t bc_result_pop_and_push(const void *data)
1107 BcVec *v = &G.prog.results;
1109 size_t len = v->len - 1;
1111 last = v->v + (v->size * len);
1114 memmove(last, data, v->size);
1118 static size_t bc_vec_pushByte(BcVec *v, char data)
1120 return bc_vec_push(v, &data);
1123 static size_t bc_vec_pushZeroByte(BcVec *v)
1125 //return bc_vec_pushByte(v, '\0');
1127 return bc_vec_push(v, &const_int_0);
1130 static void bc_vec_pushAt(BcVec *v, const void *data, size_t idx)
1133 bc_vec_push(v, data);
1137 if (v->len == v->cap) bc_vec_grow(v, 1);
1139 ptr = v->v + v->size * idx;
1141 memmove(ptr + v->size, ptr, v->size * (v->len++ - idx));
1142 memmove(ptr, data, v->size);
1146 static void bc_vec_string(BcVec *v, size_t len, const char *str)
1149 bc_vec_expand(v, len + 1);
1150 memcpy(v->v, str, len);
1153 bc_vec_pushZeroByte(v);
1156 #if ENABLE_FEATURE_BC_SIGNALS && ENABLE_FEATURE_EDITING
1157 static void bc_vec_concat(BcVec *v, const char *str)
1161 if (v->len == 0) bc_vec_pushZeroByte(v);
1164 len = v->len + slen;
1166 if (v->cap < len) bc_vec_grow(v, slen);
1167 strcpy(v->v + v->len - 1, str);
1173 static void *bc_vec_item(const BcVec *v, size_t idx)
1175 return v->v + v->size * idx;
1178 static void *bc_vec_item_rev(const BcVec *v, size_t idx)
1180 return v->v + v->size * (v->len - idx - 1);
1183 static void *bc_vec_top(const BcVec *v)
1185 return v->v + v->size * (v->len - 1);
1188 static FAST_FUNC void bc_vec_free(void *vec)
1190 BcVec *v = (BcVec *) vec;
1195 static BcFunc* bc_program_func(size_t idx)
1197 return bc_vec_item(&G.prog.fns, idx);
1199 // BC_PROG_MAIN is zeroth element, so:
1200 #define bc_program_func_BC_PROG_MAIN() ((BcFunc*)(G.prog.fns.v))
1203 static BcFunc* bc_program_current_func(void)
1205 BcInstPtr *ip = bc_vec_top(&G.prog.exestack);
1206 BcFunc *func = bc_program_func(ip->func);
1211 static char** bc_program_str(size_t idx)
1215 BcFunc *func = bc_program_current_func();
1216 return bc_vec_item(&func->strs, idx);
1219 IF_DC(return bc_vec_item(&G.prog.strs, idx);)
1222 static char** bc_program_const(size_t idx)
1226 BcFunc *func = bc_program_current_func();
1227 return bc_vec_item(&func->consts, idx);
1230 IF_DC(return bc_vec_item(&G.prog.consts, idx);)
1233 static int bc_id_cmp(const void *e1, const void *e2)
1235 return strcmp(((const BcId *) e1)->name, ((const BcId *) e2)->name);
1238 static FAST_FUNC void bc_id_free(void *id)
1240 free(((BcId *) id)->name);
1243 static size_t bc_map_find_ge(const BcVec *v, const void *ptr)
1245 size_t low = 0, high = v->len;
1247 while (low < high) {
1248 size_t mid = (low + high) / 2;
1249 BcId *id = bc_vec_item(v, mid);
1250 int result = bc_id_cmp(ptr, id);
1263 static int bc_map_insert(BcVec *v, const void *ptr, size_t *i)
1265 size_t n = *i = bc_map_find_ge(v, ptr);
1268 bc_vec_push(v, ptr);
1269 else if (!bc_id_cmp(ptr, bc_vec_item(v, n)))
1270 return 0; // "was not inserted"
1272 bc_vec_pushAt(v, ptr, n);
1273 return 1; // "was inserted"
1277 static size_t bc_map_find_exact(const BcVec *v, const void *ptr)
1279 size_t i = bc_map_find_ge(v, ptr);
1280 if (i >= v->len) return BC_VEC_INVALID_IDX;
1281 return bc_id_cmp(ptr, bc_vec_item(v, i)) ? BC_VEC_INVALID_IDX : i;
1285 static int bad_input_byte(char c)
1287 if ((c < ' ' && c != '\t' && c != '\r' && c != '\n') // also allow '\v' '\f'?
1290 bc_error_fmt("illegal character 0x%02x", c);
1296 // Note: it _appends_ data from fp to vec.
1297 static void bc_read_line(BcVec *vec, FILE *fp)
1302 #if ENABLE_FEATURE_BC_SIGNALS
1303 if (G_interrupt) { // ^C was pressed
1306 // ^C while running a script (bc SCRIPT): die.
1307 // We do not return to interactive prompt:
1308 // user might be running us from a shell,
1309 // and SCRIPT might be intended to terminate
1310 // (e.g. contain a "halt" stmt).
1311 // ^C dropping user into a bc prompt instead of
1312 // the shell would be unexpected.
1315 // ^C while interactive input
1317 // GNU bc says "interrupted execution."
1318 // GNU dc says "Interrupt!"
1319 fputs("\ninterrupted execution\n", stderr);
1322 # if ENABLE_FEATURE_EDITING
1323 if (G_ttyin && fp == stdin) {
1325 # define line_buf bb_common_bufsiz1
1326 n = read_line_input(G.line_input_state, "", line_buf, COMMON_BUFSIZE);
1327 if (n <= 0) { // read errors or EOF, or ^D, or ^C
1330 bc_vec_pushZeroByte(vec); // ^D or EOF (or error)
1335 char c = line_buf[i++];
1337 if (bad_input_byte(c)) goto again;
1339 bc_vec_concat(vec, line_buf);
1347 size_t len = vec->len;
1350 #if ENABLE_FEATURE_BC_SIGNALS
1352 // ^C was pressed: ignore entire line, get another one
1357 do c = fgetc(fp); while (c == '\0');
1360 bb_perror_msg_and_die("input error");
1361 // Note: EOF does not append '\n'
1364 bad_chars |= bad_input_byte(c);
1365 bc_vec_pushByte(vec, (char)c);
1366 } while (c != '\n');
1369 // Bad chars on this line
1370 if (!G.prog.file) { // stdin
1371 // ignore entire line, get another one
1375 bb_perror_msg_and_die("file '%s' is not text", G.prog.file);
1377 bc_vec_pushZeroByte(vec);
1381 static void bc_num_setToZero(BcNum *n, size_t scale)
1388 static void bc_num_zero(BcNum *n)
1390 bc_num_setToZero(n, 0);
1393 static void bc_num_one(BcNum *n)
1395 bc_num_setToZero(n, 0);
1400 // Note: this also sets BcNum to zero
1401 static void bc_num_init(BcNum *n, size_t req)
1403 req = req >= BC_NUM_DEF_SIZE ? req : BC_NUM_DEF_SIZE;
1404 //memset(n, 0, sizeof(BcNum)); - cleared by assignments below
1405 n->num = xmalloc(req);
1412 static void bc_num_init_DEF_SIZE(BcNum *n)
1414 bc_num_init(n, BC_NUM_DEF_SIZE);
1417 static void bc_num_expand(BcNum *n, size_t req)
1419 req = req >= BC_NUM_DEF_SIZE ? req : BC_NUM_DEF_SIZE;
1421 n->num = xrealloc(n->num, req);
1426 static FAST_FUNC void bc_num_free(void *num)
1428 free(((BcNum *) num)->num);
1431 static void bc_num_copy(BcNum *d, BcNum *s)
1434 bc_num_expand(d, s->cap);
1438 memcpy(d->num, s->num, sizeof(BcDig) * d->len);
1442 static BC_STATUS zbc_num_ulong(BcNum *n, unsigned long *result_p)
1445 unsigned long pow, result;
1447 if (n->neg) RETURN_STATUS(bc_error("negative number"));
1449 for (result = 0, pow = 1, i = n->rdx; i < n->len; ++i) {
1450 unsigned long prev = result, powprev = pow;
1452 result += ((unsigned long) n->num[i]) * pow;
1455 if (result < prev || pow < powprev)
1456 RETURN_STATUS(bc_error("overflow"));
1462 RETURN_STATUS(BC_STATUS_SUCCESS);
1464 #define zbc_num_ulong(...) (zbc_num_ulong(__VA_ARGS__) COMMA_SUCCESS)
1466 #if ULONG_MAX == 0xffffffffUL // 10 digits: 4294967295
1467 # define ULONG_NUM_BUFSIZE (10 > BC_NUM_DEF_SIZE ? 10 : BC_NUM_DEF_SIZE)
1468 #elif ULONG_MAX == 0xffffffffffffffffULL // 20 digits: 18446744073709551615
1469 # define ULONG_NUM_BUFSIZE (20 > BC_NUM_DEF_SIZE ? 20 : BC_NUM_DEF_SIZE)
1471 // minimum BC_NUM_DEF_SIZE, so that bc_num_expand() in bc_num_ulong2num()
1472 // would not hit realloc() code path - not good if num[] is not malloced
1474 static void bc_num_ulong2num(BcNum *n, unsigned long val)
1480 if (val == 0) return;
1482 bc_num_expand(n, ULONG_NUM_BUFSIZE);
1489 if (val == 0) break;
1493 static void bc_num_subArrays(BcDig *restrict a, BcDig *restrict b, size_t len)
1496 for (i = 0; i < len; ++i) {
1498 for (j = i; a[j] < 0;) {
1505 static ssize_t bc_num_compare(BcDig *restrict a, BcDig *restrict b, size_t len)
1523 static ssize_t bc_num_cmp(BcNum *a, BcNum *b)
1525 size_t i, min, a_int, b_int, diff;
1526 BcDig *max_num, *min_num;
1530 if (a == b) return 0;
1531 if (a->len == 0) return BC_NUM_NEG(!!b->len, !b->neg);
1532 if (b->len == 0) return BC_NUM_NEG(1, a->neg);
1534 if (a->neg != b->neg) // signs of a and b differ
1535 // +a,-b = a>b = 1 or -a,+b = a<b = -1
1536 return (int)b->neg - (int)a->neg;
1537 neg = a->neg; // 1 if both negative, 0 if both positive
1539 a_int = BC_NUM_INT(a);
1540 b_int = BC_NUM_INT(b);
1543 if (a_int != 0) return (ssize_t) a_int;
1545 a_max = (a->rdx > b->rdx);
1548 diff = a->rdx - b->rdx;
1549 max_num = a->num + diff;
1551 // neg = (a_max == neg); - NOP (maps 1->1 and 0->0)
1554 diff = b->rdx - a->rdx;
1555 max_num = b->num + diff;
1557 neg = !neg; // same as "neg = (a_max == neg)"
1560 cmp = bc_num_compare(max_num, min_num, b_int + min);
1561 if (cmp != 0) return BC_NUM_NEG(cmp, neg);
1563 for (max_num -= diff, i = diff - 1; i < diff; --i) {
1564 if (max_num[i]) return BC_NUM_NEG(1, neg);
1570 static void bc_num_truncate(BcNum *n, size_t places)
1572 if (places == 0) return;
1578 memmove(n->num, n->num + places, n->len * sizeof(BcDig));
1582 static void bc_num_extend(BcNum *n, size_t places)
1584 size_t len = n->len + places;
1587 if (n->cap < len) bc_num_expand(n, len);
1589 memmove(n->num + places, n->num, sizeof(BcDig) * n->len);
1590 memset(n->num, 0, sizeof(BcDig) * places);
1597 static void bc_num_clean(BcNum *n)
1599 while (n->len > 0 && n->num[n->len - 1] == 0) --n->len;
1602 else if (n->len < n->rdx)
1606 static void bc_num_retireMul(BcNum *n, size_t scale, bool neg1, bool neg2)
1609 bc_num_extend(n, scale - n->rdx);
1611 bc_num_truncate(n, n->rdx - scale);
1614 if (n->len != 0) n->neg = !neg1 != !neg2;
1617 static void bc_num_split(BcNum *restrict n, size_t idx, BcNum *restrict a,
1621 b->len = n->len - idx;
1623 a->rdx = b->rdx = 0;
1625 memcpy(b->num, n->num + idx, b->len * sizeof(BcDig));
1626 memcpy(a->num, n->num, idx * sizeof(BcDig));
1636 static BC_STATUS zbc_num_shift(BcNum *n, size_t places)
1638 if (places == 0 || n->len == 0) RETURN_STATUS(BC_STATUS_SUCCESS);
1640 // This check makes sense only if size_t is (much) larger than BC_MAX_NUM.
1641 if (SIZE_MAX > (BC_MAX_NUM | 0xff)) {
1642 if (places + n->len > BC_MAX_NUM)
1643 RETURN_STATUS(bc_error("number too long: must be [1,"BC_MAX_NUM_STR"]"));
1646 if (n->rdx >= places)
1649 bc_num_extend(n, places - n->rdx);
1655 RETURN_STATUS(BC_STATUS_SUCCESS);
1657 #define zbc_num_shift(...) (zbc_num_shift(__VA_ARGS__) COMMA_SUCCESS)
1659 static BC_STATUS zbc_num_inv(BcNum *a, BcNum *b, size_t scale)
1668 RETURN_STATUS(zbc_num_div(&one, a, b, scale));
1670 #define zbc_num_inv(...) (zbc_num_inv(__VA_ARGS__) COMMA_SUCCESS)
1672 static FAST_FUNC BC_STATUS zbc_num_a(BcNum *a, BcNum *b, BcNum *restrict c, size_t sub)
1674 BcDig *ptr, *ptr_a, *ptr_b, *ptr_c;
1675 size_t i, max, min_rdx, min_int, diff, a_int, b_int;
1678 // Because this function doesn't need to use scale (per the bc spec),
1679 // I am hijacking it to say whether it's doing an add or a subtract.
1683 if (sub && c->len) c->neg = !c->neg;
1684 RETURN_STATUS(BC_STATUS_SUCCESS);
1688 RETURN_STATUS(BC_STATUS_SUCCESS);
1692 c->rdx = BC_MAX(a->rdx, b->rdx);
1693 min_rdx = BC_MIN(a->rdx, b->rdx);
1696 if (a->rdx > b->rdx) {
1697 diff = a->rdx - b->rdx;
1699 ptr_a = a->num + diff;
1702 diff = b->rdx - a->rdx;
1705 ptr_b = b->num + diff;
1709 for (i = 0; i < diff; ++i, ++c->len)
1713 a_int = BC_NUM_INT(a);
1714 b_int = BC_NUM_INT(b);
1716 if (a_int > b_int) {
1727 for (i = 0; i < min_rdx + min_int; ++i) {
1728 unsigned in = (unsigned)ptr_a[i] + (unsigned)ptr_b[i] + carry;
1730 ptr_c[i] = (BcDig)(in % 10);
1732 for (; i < max + min_rdx; ++i) {
1733 unsigned in = (unsigned)ptr[i] + carry;
1735 ptr_c[i] = (BcDig)(in % 10);
1739 if (carry != 0) c->num[c->len++] = (BcDig) carry;
1741 RETURN_STATUS(BC_STATUS_SUCCESS); // can't make void, see zbc_num_binary()
1744 static FAST_FUNC BC_STATUS zbc_num_s(BcNum *a, BcNum *b, BcNum *restrict c, size_t sub)
1747 BcNum *minuend, *subtrahend;
1749 bool aneg, bneg, neg;
1751 // Because this function doesn't need to use scale (per the bc spec),
1752 // I am hijacking it to say whether it's doing an add or a subtract.
1756 if (sub && c->len) c->neg = !c->neg;
1757 RETURN_STATUS(BC_STATUS_SUCCESS);
1761 RETURN_STATUS(BC_STATUS_SUCCESS);
1766 a->neg = b->neg = false;
1768 cmp = bc_num_cmp(a, b);
1774 bc_num_setToZero(c, BC_MAX(a->rdx, b->rdx));
1775 RETURN_STATUS(BC_STATUS_SUCCESS);
1783 if (sub) neg = !neg;
1788 bc_num_copy(c, minuend);
1791 if (c->rdx < subtrahend->rdx) {
1792 bc_num_extend(c, subtrahend->rdx - c->rdx);
1795 start = c->rdx - subtrahend->rdx;
1797 bc_num_subArrays(c->num + start, subtrahend->num, subtrahend->len);
1801 RETURN_STATUS(BC_STATUS_SUCCESS); // can't make void, see zbc_num_binary()
1804 static FAST_FUNC BC_STATUS zbc_num_k(BcNum *restrict a, BcNum *restrict b,
1806 #define zbc_num_k(...) (zbc_num_k(__VA_ARGS__) COMMA_SUCCESS)
1809 size_t max = BC_MAX(a->len, b->len), max2 = (max + 1) / 2;
1810 BcNum l1, h1, l2, h2, m2, m1, z0, z1, z2, temp;
1813 if (a->len == 0 || b->len == 0) {
1815 RETURN_STATUS(BC_STATUS_SUCCESS);
1817 aone = BC_NUM_ONE(a);
1818 if (aone || BC_NUM_ONE(b)) {
1819 bc_num_copy(c, aone ? b : a);
1820 RETURN_STATUS(BC_STATUS_SUCCESS);
1823 if (a->len + b->len < BC_NUM_KARATSUBA_LEN
1824 || a->len < BC_NUM_KARATSUBA_LEN
1825 || b->len < BC_NUM_KARATSUBA_LEN
1829 bc_num_expand(c, a->len + b->len + 1);
1831 memset(c->num, 0, sizeof(BcDig) * c->cap);
1834 for (i = 0; i < b->len; ++i) {
1836 for (j = 0; j < a->len; ++j) {
1837 unsigned in = c->num[i + j];
1838 in += (unsigned)a->num[j] * (unsigned)b->num[i] + carry;
1839 // note: compilers prefer _unsigned_ div/const
1841 c->num[i + j] = (BcDig)(in % 10);
1844 c->num[i + j] += (BcDig) carry;
1845 len = BC_MAX(len, i + j + !!carry);
1847 #if ENABLE_FEATURE_BC_SIGNALS
1849 // a*a <- without check below, this will not be interruptible
1850 if (G_interrupt) return BC_STATUS_FAILURE;
1856 RETURN_STATUS(BC_STATUS_SUCCESS);
1859 bc_num_init(&l1, max);
1860 bc_num_init(&h1, max);
1861 bc_num_init(&l2, max);
1862 bc_num_init(&h2, max);
1863 bc_num_init(&m1, max);
1864 bc_num_init(&m2, max);
1865 bc_num_init(&z0, max);
1866 bc_num_init(&z1, max);
1867 bc_num_init(&z2, max);
1868 bc_num_init(&temp, max + max);
1870 bc_num_split(a, max2, &l1, &h1);
1871 bc_num_split(b, max2, &l2, &h2);
1873 s = zbc_num_add(&h1, &l1, &m1, 0);
1875 s = zbc_num_add(&h2, &l2, &m2, 0);
1878 s = zbc_num_k(&h1, &h2, &z0);
1880 s = zbc_num_k(&m1, &m2, &z1);
1882 s = zbc_num_k(&l1, &l2, &z2);
1885 s = zbc_num_sub(&z1, &z0, &temp, 0);
1887 s = zbc_num_sub(&temp, &z2, &z1, 0);
1890 s = zbc_num_shift(&z0, max2 * 2);
1892 s = zbc_num_shift(&z1, max2);
1894 s = zbc_num_add(&z0, &z1, &temp, 0);
1896 s = zbc_num_add(&temp, &z2, c, 0);
1911 static FAST_FUNC BC_STATUS zbc_num_m(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale)
1915 size_t maxrdx = BC_MAX(a->rdx, b->rdx);
1917 scale = BC_MAX(scale, a->rdx);
1918 scale = BC_MAX(scale, b->rdx);
1919 scale = BC_MIN(a->rdx + b->rdx, scale);
1920 maxrdx = BC_MAX(maxrdx, scale);
1922 bc_num_init(&cpa, a->len);
1923 bc_num_init(&cpb, b->len);
1925 bc_num_copy(&cpa, a);
1926 bc_num_copy(&cpb, b);
1927 cpa.neg = cpb.neg = false;
1929 s = zbc_num_shift(&cpa, maxrdx);
1931 s = zbc_num_shift(&cpb, maxrdx);
1933 s = zbc_num_k(&cpa, &cpb, c);
1937 bc_num_expand(c, c->len + maxrdx);
1939 if (c->len < maxrdx) {
1940 memset(c->num + c->len, 0, (c->cap - c->len) * sizeof(BcDig));
1945 bc_num_retireMul(c, scale, a->neg, b->neg);
1951 #define zbc_num_m(...) (zbc_num_m(__VA_ARGS__) COMMA_SUCCESS)
1953 static FAST_FUNC BC_STATUS zbc_num_d(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale)
1960 RETURN_STATUS(bc_error("divide by zero"));
1962 bc_num_setToZero(c, scale);
1963 RETURN_STATUS(BC_STATUS_SUCCESS);
1965 if (BC_NUM_ONE(b)) {
1967 bc_num_retireMul(c, scale, a->neg, b->neg);
1968 RETURN_STATUS(BC_STATUS_SUCCESS);
1971 bc_num_init(&cp, BC_NUM_MREQ(a, b, scale));
1972 bc_num_copy(&cp, a);
1976 bc_num_expand(&cp, len + 2);
1977 bc_num_extend(&cp, len - cp.len);
1980 if (b->rdx > cp.rdx) bc_num_extend(&cp, b->rdx - cp.rdx);
1982 if (scale > cp.rdx) bc_num_extend(&cp, scale - cp.rdx);
1984 if (b->rdx == b->len) {
1986 if (len == 0) break;
1988 if (b->num[len] != 0)
1994 if (cp.cap == cp.len) bc_num_expand(&cp, cp.len + 1);
1996 // We want an extra zero in front to make things simpler.
1997 cp.num[cp.len++] = 0;
2000 bc_num_expand(c, cp.len);
2003 memset(c->num + end, 0, (c->cap - end) * sizeof(BcDig));
2007 s = BC_STATUS_SUCCESS;
2008 for (i = end - 1; i < end; --i) {
2011 for (q = 0; n[len] != 0 || bc_num_compare(n, b->num, len) >= 0; ++q)
2012 bc_num_subArrays(n, b->num, len);
2014 #if ENABLE_FEATURE_BC_SIGNALS
2017 // 1/a <- without check below, this will not be interruptible
2019 s = BC_STATUS_FAILURE;
2025 bc_num_retireMul(c, scale, a->neg, b->neg);
2030 #define zbc_num_d(...) (zbc_num_d(__VA_ARGS__) COMMA_SUCCESS)
2032 static FAST_FUNC BC_STATUS zbc_num_r(BcNum *a, BcNum *b, BcNum *restrict c,
2033 BcNum *restrict d, size_t scale, size_t ts)
2040 RETURN_STATUS(bc_error("divide by zero"));
2043 bc_num_setToZero(d, ts);
2044 RETURN_STATUS(BC_STATUS_SUCCESS);
2047 bc_num_init(&temp, d->cap);
2048 s = zbc_num_d(a, b, c, scale);
2051 if (scale != 0) scale = ts;
2053 s = zbc_num_m(c, b, &temp, scale);
2055 s = zbc_num_sub(a, &temp, d, scale);
2058 if (ts > d->rdx && d->len) bc_num_extend(d, ts - d->rdx);
2061 bc_num_retireMul(d, ts, a->neg, b->neg);
2067 #define zbc_num_r(...) (zbc_num_r(__VA_ARGS__) COMMA_SUCCESS)
2069 static FAST_FUNC BC_STATUS zbc_num_rem(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale)
2073 size_t ts = BC_MAX(scale + b->rdx, a->rdx), len = BC_NUM_MREQ(a, b, ts);
2075 bc_num_init(&c1, len);
2076 s = zbc_num_r(a, b, &c1, c, scale, ts);
2081 #define zbc_num_rem(...) (zbc_num_rem(__VA_ARGS__) COMMA_SUCCESS)
2083 static FAST_FUNC BC_STATUS zbc_num_p(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale)
2085 BcStatus s = BC_STATUS_SUCCESS;
2088 size_t i, powrdx, resrdx;
2091 if (b->rdx) RETURN_STATUS(bc_error("non integer number"));
2095 RETURN_STATUS(BC_STATUS_SUCCESS);
2098 bc_num_setToZero(c, scale);
2099 RETURN_STATUS(BC_STATUS_SUCCESS);
2101 if (BC_NUM_ONE(b)) {
2105 s = zbc_num_inv(a, c, scale);
2112 s = zbc_num_ulong(b, &pow);
2113 if (s) RETURN_STATUS(s);
2115 bc_num_init(©, a->len);
2116 bc_num_copy(©, a);
2121 if (a->rdx * pow < scale)
2122 scale = a->rdx * pow;
2127 for (powrdx = a->rdx; !(pow & 1); pow >>= 1) {
2129 s = zbc_num_mul(©, ©, ©, powrdx);
2131 // Not needed: zbc_num_mul() has a check for ^C:
2132 //if (G_interrupt) {
2133 // s = BC_STATUS_FAILURE;
2138 bc_num_copy(c, ©);
2140 for (resrdx = powrdx, pow >>= 1; pow != 0; pow >>= 1) {
2142 s = zbc_num_mul(©, ©, ©, powrdx);
2147 s = zbc_num_mul(c, ©, c, resrdx);
2150 // Not needed: zbc_num_mul() has a check for ^C:
2151 //if (G_interrupt) {
2152 // s = BC_STATUS_FAILURE;
2158 s = zbc_num_inv(c, c, scale);
2162 if (c->rdx > scale) bc_num_truncate(c, c->rdx - scale);
2164 // We can't use bc_num_clean() here.
2165 for (i = 0; i < c->len; ++i)
2168 bc_num_setToZero(c, scale);
2175 #define zbc_num_p(...) (zbc_num_p(__VA_ARGS__) COMMA_SUCCESS)
2177 static BC_STATUS zbc_num_binary(BcNum *a, BcNum *b, BcNum *c, size_t scale,
2178 BcNumBinaryOp op, size_t req)
2181 BcNum num2, *ptr_a, *ptr_b;
2186 memcpy(ptr_a, c, sizeof(BcNum));
2194 memcpy(ptr_b, c, sizeof(BcNum));
2201 bc_num_init(c, req);
2203 bc_num_expand(c, req);
2205 s = BC_STATUS_SUCCESS;
2206 IF_ERROR_RETURN_POSSIBLE(s =) op(ptr_a, ptr_b, c, scale);
2208 if (init) bc_num_free(&num2);
2212 #define zbc_num_binary(...) (zbc_num_binary(__VA_ARGS__) COMMA_SUCCESS)
2214 static bool bc_num_strValid(const char *val, size_t base)
2219 b = (BcDig)(base <= 10 ? base + '0' : base - 10 + 'A');
2226 if (radix) return false;
2230 if (c < '0' || c >= b || (c > '9' && c < 'A'))
2236 // Note: n is already "bc_num_zero()"ed,
2237 // leading zeroes in "val" are removed
2238 static void bc_num_parseDecimal(BcNum *n, const char *val)
2247 bc_num_expand(n, len);
2249 ptr = strchr(val, '.');
2253 n->rdx = (size_t)((val + len) - (ptr + 1));
2255 for (i = 0; val[i]; ++i) {
2256 if (val[i] != '0' && val[i] != '.') {
2257 // Not entirely zero value - convert it, and exit
2260 n->num[n->len] = val[i] - '0';
2264 if (val[--i] == '.') goto skip_dot;
2269 // if for() exits without hitting if(), the value is entirely zero
2272 // Note: n is already "bc_num_zero()"ed,
2273 // leading zeroes in "val" are removed
2274 static void bc_num_parseBase(BcNum *n, const char *val, unsigned base_t)
2277 BcNum temp, mult, result;
2279 BcDig base_digs[ULONG_NUM_BUFSIZE];
2284 for (i = 0; ; ++i) {
2287 if (val[i] != '.' && val[i] != '0')
2291 bc_num_init_DEF_SIZE(&temp);
2292 bc_num_init_DEF_SIZE(&mult);
2293 base.cap = ARRAY_SIZE(base_digs);
2294 base.num = base_digs;
2295 bc_num_ulong2num(&base, base_t);
2299 if (c == '\0') goto int_err;
2300 if (c == '.') break;
2302 v = (unsigned long) (c <= '9' ? c - '0' : c - 'A' + 10);
2304 s = zbc_num_mul(n, &base, &mult, 0);
2305 if (s) goto int_err;
2306 bc_num_ulong2num(&temp, v);
2307 s = zbc_num_add(&mult, &temp, n, 0);
2308 if (s) goto int_err;
2311 bc_num_init(&result, base.len);
2312 //bc_num_zero(&result); - already is
2318 if (c == '\0') break;
2321 v = (unsigned long) (c <= '9' ? c - '0' : c - 'A' + 10);
2323 s = zbc_num_mul(&result, &base, &result, 0);
2325 bc_num_ulong2num(&temp, v);
2326 s = zbc_num_add(&result, &temp, &result, 0);
2328 s = zbc_num_mul(&mult, &base, &mult, 0);
2332 s = zbc_num_div(&result, &mult, &result, digits);
2334 s = zbc_num_add(n, &result, n, digits);
2338 if (n->rdx < digits)
2339 bc_num_extend(n, digits - n->rdx);
2343 bc_num_free(&result);
2349 static BC_STATUS zbc_num_parse(BcNum *n, const char *val, unsigned base_t)
2351 if (!bc_num_strValid(val, base_t))
2352 RETURN_STATUS(bc_error("bad number string"));
2355 while (*val == '0') val++;
2358 bc_num_parseDecimal(n, val);
2360 bc_num_parseBase(n, val, base_t);
2362 RETURN_STATUS(BC_STATUS_SUCCESS);
2364 #define zbc_num_parse(...) (zbc_num_parse(__VA_ARGS__) COMMA_SUCCESS)
2366 static BC_STATUS zbc_num_sqrt(BcNum *a, BcNum *restrict b, size_t scale)
2369 BcNum num1, num2, half, f, fprime, *x0, *x1, *temp;
2370 size_t pow, len, digs, digs1, resrdx, req, times = 0;
2371 ssize_t cmp = 1, cmp1 = SSIZE_MAX, cmp2 = SSIZE_MAX;
2373 req = BC_MAX(scale, a->rdx) + ((BC_NUM_INT(a) + 1) >> 1) + 1;
2374 bc_num_expand(b, req);
2377 bc_num_setToZero(b, scale);
2378 RETURN_STATUS(BC_STATUS_SUCCESS);
2381 RETURN_STATUS(bc_error("negative number"));
2383 if (BC_NUM_ONE(a)) {
2385 bc_num_extend(b, scale);
2386 RETURN_STATUS(BC_STATUS_SUCCESS);
2389 scale = BC_MAX(scale, a->rdx) + 1;
2390 len = a->len + scale;
2392 bc_num_init(&num1, len);
2393 bc_num_init(&num2, len);
2394 bc_num_init_DEF_SIZE(&half);
2400 bc_num_init(&f, len);
2401 bc_num_init(&fprime, len);
2407 pow = BC_NUM_INT(a);
2415 pow -= 2 - (pow & 1);
2417 bc_num_extend(x0, pow);
2419 // Make sure to move the radix back.
2423 x0->rdx = digs = digs1 = 0;
2425 len = BC_NUM_INT(x0) + resrdx - 1;
2427 while (cmp != 0 || digs < len) {
2428 s = zbc_num_div(a, x0, &f, resrdx);
2430 s = zbc_num_add(x0, &f, &fprime, resrdx);
2432 s = zbc_num_mul(&fprime, &half, x1, resrdx);
2435 cmp = bc_num_cmp(x1, x0);
2436 digs = x1->len - (unsigned long long) llabs(cmp);
2438 if (cmp == cmp2 && digs == digs1)
2443 resrdx += times > 4;
2456 if (b->rdx > scale) bc_num_truncate(b, b->rdx - scale);
2458 bc_num_free(&fprime);
2465 #define zbc_num_sqrt(...) (zbc_num_sqrt(__VA_ARGS__) COMMA_SUCCESS)
2467 static BC_STATUS zbc_num_divmod(BcNum *a, BcNum *b, BcNum *c, BcNum *d,
2473 size_t ts = BC_MAX(scale + b->rdx, a->rdx), len = BC_NUM_MREQ(a, b, ts);
2476 memcpy(&num2, c, sizeof(BcNum));
2478 bc_num_init(c, len);
2482 bc_num_expand(c, len);
2485 s = zbc_num_r(ptr_a, b, c, d, scale, ts);
2487 if (init) bc_num_free(&num2);
2491 #define zbc_num_divmod(...) (zbc_num_divmod(__VA_ARGS__) COMMA_SUCCESS)
2494 static BC_STATUS zdc_num_modexp(BcNum *a, BcNum *b, BcNum *c, BcNum *restrict d)
2497 BcNum base, exp, two, temp;
2500 RETURN_STATUS(bc_error("divide by zero"));
2501 if (a->rdx || b->rdx || c->rdx)
2502 RETURN_STATUS(bc_error("non integer number"));
2504 RETURN_STATUS(bc_error("negative number"));
2506 bc_num_expand(d, c->len);
2507 bc_num_init(&base, c->len);
2508 bc_num_init(&exp, b->len);
2509 bc_num_init_DEF_SIZE(&two);
2510 bc_num_init(&temp, b->len);
2516 s = zbc_num_rem(a, c, &base, 0);
2518 bc_num_copy(&exp, b);
2520 while (exp.len != 0) {
2521 s = zbc_num_divmod(&exp, &two, &exp, &temp, 0);
2524 if (BC_NUM_ONE(&temp)) {
2525 s = zbc_num_mul(d, &base, &temp, 0);
2527 s = zbc_num_rem(&temp, c, d, 0);
2531 s = zbc_num_mul(&base, &base, &temp, 0);
2533 s = zbc_num_rem(&temp, c, &base, 0);
2543 #define zdc_num_modexp(...) (zdc_num_modexp(__VA_ARGS__) COMMA_SUCCESS)
2547 static BC_STATUS zbc_func_insert(BcFunc *f, char *name, bool var)
2553 autoid = (void*)f->autos.v;
2554 for (i = 0; i < f->autos.len; i++, autoid++) {
2555 if (strcmp(name, autoid->name) == 0)
2556 RETURN_STATUS(bc_error("function parameter or auto var has the same name as another"));
2562 bc_vec_push(&f->autos, &a);
2564 RETURN_STATUS(BC_STATUS_SUCCESS);
2566 #define zbc_func_insert(...) (zbc_func_insert(__VA_ARGS__) COMMA_SUCCESS)
2569 static FAST_FUNC void bc_string_free(void *string)
2571 free(*(char**)string);
2574 static void bc_func_init(BcFunc *f)
2576 bc_char_vec_init(&f->code);
2577 IF_BC(bc_vec_init(&f->labels, sizeof(size_t), NULL);)
2578 IF_BC(bc_vec_init(&f->autos, sizeof(BcId), bc_id_free);)
2579 IF_BC(bc_vec_init(&f->strs, sizeof(char *), bc_string_free);)
2580 IF_BC(bc_vec_init(&f->consts, sizeof(char *), bc_string_free);)
2581 IF_BC(f->nparams = 0;)
2584 static FAST_FUNC void bc_func_free(void *func)
2586 BcFunc *f = (BcFunc *) func;
2587 bc_vec_free(&f->code);
2588 IF_BC(bc_vec_free(&f->labels);)
2589 IF_BC(bc_vec_free(&f->autos);)
2590 IF_BC(bc_vec_free(&f->strs);)
2591 IF_BC(bc_vec_free(&f->consts);)
2594 static void bc_array_expand(BcVec *a, size_t len);
2596 static void bc_array_init(BcVec *a, bool nums)
2599 bc_vec_init(a, sizeof(BcNum), bc_num_free);
2601 bc_vec_init(a, sizeof(BcVec), bc_vec_free);
2602 bc_array_expand(a, 1);
2605 static void bc_array_expand(BcVec *a, size_t len)
2607 if (a->dtor == bc_num_free
2608 // && a->size == sizeof(BcNum) - always true
2611 while (len > a->len) {
2612 bc_num_init_DEF_SIZE(&n);
2617 while (len > a->len) {
2618 bc_array_init(&v, true);
2624 static void bc_array_copy(BcVec *d, const BcVec *s)
2630 bc_vec_expand(d, s->cap);
2635 for (i = 0; i < s->len; i++, dnum++, snum++) {
2636 bc_num_init(dnum, snum->len);
2637 bc_num_copy(dnum, snum);
2642 static void dc_result_copy(BcResult *d, BcResult *src)
2647 case BC_RESULT_TEMP:
2648 case BC_RESULT_IBASE:
2649 case BC_RESULT_SCALE:
2650 case BC_RESULT_OBASE:
2651 bc_num_init(&d->d.n, src->d.n.len);
2652 bc_num_copy(&d->d.n, &src->d.n);
2655 case BC_RESULT_ARRAY:
2656 case BC_RESULT_ARRAY_ELEM:
2657 d->d.id.name = xstrdup(src->d.id.name);
2659 case BC_RESULT_CONSTANT:
2660 case BC_RESULT_LAST:
2663 memcpy(&d->d.n, &src->d.n, sizeof(BcNum));
2669 static FAST_FUNC void bc_result_free(void *result)
2671 BcResult *r = (BcResult *) result;
2674 case BC_RESULT_TEMP:
2675 case BC_RESULT_IBASE:
2676 case BC_RESULT_SCALE:
2677 case BC_RESULT_OBASE:
2678 bc_num_free(&r->d.n);
2681 case BC_RESULT_ARRAY:
2682 case BC_RESULT_ARRAY_ELEM:
2691 static void bc_lex_lineComment(BcLex *l)
2693 // Try: echo -n '#foo' | bc
2695 l->t.t = BC_LEX_WHITESPACE;
2697 while (i < l->len && l->buf[i] != '\n')
2702 static void bc_lex_whitespace(BcLex *l)
2704 l->t.t = BC_LEX_WHITESPACE;
2706 char c = l->buf[l->i];
2707 if (c == '\n') // this is BC_LEX_NLINE, not BC_LEX_WHITESPACE
2715 static BC_STATUS zbc_lex_number(BcLex *l, char start)
2717 const char *buf = l->buf + l->i;
2718 size_t len, i, ccnt;
2721 pt = (start == '.');
2722 l->t.t = BC_LEX_NUMBER;
2728 if (c == '\\' && buf[i + 1] == '\n') {
2730 //number_of_backslashes++ - see comment below
2733 if (!isdigit(c) && (c < 'A' || c > 'F')) {
2734 if (c != '.') break;
2735 // if '.' was already seen, stop on second one:
2739 // buf[i] is one of "0-9A-F."
2744 //ccnt is the number of chars in the number string, excluding possible
2745 //trailing "[\<newline>].[\<newline>]" (with any number of \<NL> repetitions).
2746 //i is buf[i] index of the first not-yet-parsed char after that.
2749 // This might overestimate the size, if there are "\<NL>"'s
2750 // in the number. Subtracting number_of_backslashes*2 correctly
2751 // is not that easy: consider that in the case of "NNN.\<NL>"
2752 // loop above will count "\<NL>" before it realizes it is not
2753 // in fact *inside* the number:
2754 len = ccnt + 1; // +1 byte for NUL termination
2756 // This check makes sense only if size_t is (much) larger than BC_MAX_NUM.
2757 if (SIZE_MAX > (BC_MAX_NUM | 0xff)) {
2758 if (len > BC_MAX_NUM)
2759 RETURN_STATUS(bc_error("number too long: must be [1,"BC_MAX_NUM_STR"]"));
2762 bc_vec_pop_all(&l->t.v);
2763 bc_vec_expand(&l->t.v, 1 + len);
2764 bc_vec_push(&l->t.v, &start);
2767 // If we have hit a backslash, skip it. We don't have
2768 // to check for a newline because it's guaranteed.
2774 bc_vec_push(&l->t.v, buf);
2779 bc_vec_pushZeroByte(&l->t.v);
2781 RETURN_STATUS(BC_STATUS_SUCCESS);
2783 #define zbc_lex_number(...) (zbc_lex_number(__VA_ARGS__) COMMA_SUCCESS)
2785 static void bc_lex_name(BcLex *l)
2790 l->t.t = BC_LEX_NAME;
2793 buf = l->buf + l->i - 1;
2796 if ((c < 'a' || c > 'z') && !isdigit(c) && c != '_') break;
2800 #if 0 // We do not protect against people with gigabyte-long names
2801 // This check makes sense only if size_t is (much) larger than BC_MAX_STRING.
2802 if (SIZE_MAX > (BC_MAX_STRING | 0xff)) {
2803 if (i > BC_MAX_STRING)
2804 return bc_error("name too long: must be [1,"BC_MAX_STRING_STR"]");
2807 bc_vec_string(&l->t.v, i, buf);
2809 // Increment the index. We minus 1 because it has already been incremented.
2812 //return BC_STATUS_SUCCESS;
2815 static void bc_lex_init(BcLex *l)
2817 bc_char_vec_init(&l->t.v);
2820 static void bc_lex_free(BcLex *l)
2822 bc_vec_free(&l->t.v);
2825 static void bc_lex_file(BcLex *l)
2827 G.err_line = l->line = 1;
2831 static bool bc_lex_more_input(BcLex *l)
2836 bc_vec_pop_all(&G.input_buffer);
2838 // This loop is complex because the vm tries not to send any lines that end
2839 // with a backslash to the parser. The reason for that is because the parser
2840 // treats a backslash+newline combo as whitespace, per the bc spec. In that
2841 // case, and for strings and comments, the parser will expect more stuff.
2845 size_t prevlen = G.input_buffer.len;
2848 bc_read_line(&G.input_buffer, G.input_fp);
2849 // No more input means EOF
2850 if (G.input_buffer.len <= prevlen + 1) // (we expect +1 for NUL byte)
2853 string = G.input_buffer.v + prevlen;
2856 if (string == G.input_buffer.v || string[-1] != '\\') {
2867 if (c == '/' && *string == '*') {
2872 if (c == '*' && *string == '/') {
2877 if (str != 0 || comment) {
2878 G.input_buffer.len--; // backstep over the trailing NUL byte
2882 // Check for backslash+newline.
2883 // we do not check that last char is '\n' -
2884 // if it is not, then it's EOF, and looping back
2885 // to bc_read_line() will detect it:
2887 if (string >= G.input_buffer.v && *string == '\\') {
2888 G.input_buffer.len--;
2895 l->buf = G.input_buffer.v;
2897 // bb_error_msg("G.input_buffer.len:%d '%s'", G.input_buffer.len, G.input_buffer.v);
2898 l->len = G.input_buffer.len - 1; // do not include NUL
2903 IF_BC(static BC_STATUS zbc_lex_token(BcLex *l);)
2904 IF_DC(static BC_STATUS zdc_lex_token(BcLex *l);)
2906 static BC_STATUS zbc_lex_next(BcLex *l)
2911 if (l->t.last == BC_LEX_EOF) RETURN_STATUS(bc_error("end of file"));
2913 l->line += l->newline;
2914 G.err_line = l->line;
2917 // Loop until failure or we don't have whitespace. This
2918 // is so the parser doesn't get inundated with whitespace.
2919 // Comments are also BC_LEX_WHITESPACE tokens and eaten here.
2920 s = BC_STATUS_SUCCESS;
2922 if (l->i == l->len) {
2923 l->t.t = BC_LEX_EOF;
2925 RETURN_STATUS(BC_STATUS_SUCCESS);
2926 if (!bc_lex_more_input(l)) {
2928 RETURN_STATUS(BC_STATUS_SUCCESS);
2930 // here it's guaranteed that l->i is below l->len
2932 dbg_lex("next string to parse:'%.*s'",
2933 (int)(strchrnul(l->buf + l->i, '\n') - (l->buf + l->i)),
2936 IF_BC(s = zbc_lex_token(l));
2938 IF_DC(s = zdc_lex_token(l));
2940 } while (!s && l->t.t == BC_LEX_WHITESPACE);
2941 dbg_lex("l->t.t from string:%d", l->t.t);
2945 #define zbc_lex_next(...) (zbc_lex_next(__VA_ARGS__) COMMA_SUCCESS)
2948 static BC_STATUS zbc_lex_skip_if_at_NLINE(BcLex *l)
2950 if (l->t.t == BC_LEX_NLINE)
2951 RETURN_STATUS(zbc_lex_next(l));
2952 RETURN_STATUS(BC_STATUS_SUCCESS);
2954 #define zbc_lex_skip_if_at_NLINE(...) (zbc_lex_skip_if_at_NLINE(__VA_ARGS__) COMMA_SUCCESS)
2956 static BC_STATUS zbc_lex_next_and_skip_NLINE(BcLex *l)
2959 s = zbc_lex_next(l);
2960 if (s) RETURN_STATUS(s);
2961 // if(cond)<newline>stmt is accepted too (but not 2+ newlines)
2962 s = zbc_lex_skip_if_at_NLINE(l);
2965 #define zbc_lex_next_and_skip_NLINE(...) (zbc_lex_next_and_skip_NLINE(__VA_ARGS__) COMMA_SUCCESS)
2968 static BC_STATUS zbc_lex_text_init(BcLex *l, const char *text)
2972 l->len = strlen(text);
2973 l->t.t = l->t.last = BC_LEX_INVALID;
2974 RETURN_STATUS(zbc_lex_next(l));
2976 #define zbc_lex_text_init(...) (zbc_lex_text_init(__VA_ARGS__) COMMA_SUCCESS)
2979 static BC_STATUS zbc_lex_identifier(BcLex *l)
2983 const char *buf = l->buf + l->i - 1;
2985 for (i = 0; i < ARRAY_SIZE(bc_lex_kws); ++i) {
2986 const char *keyword8 = bc_lex_kws[i].name8;
2988 while (buf[j] != '\0' && buf[j] == keyword8[j]) {
2990 if (j == 8) goto match;
2992 if (keyword8[j] != '\0')
2995 // buf starts with keyword bc_lex_kws[i]
2996 if (isalnum(buf[j]) || buf[j]=='_')
2997 continue; // "ifz" does not match "if" keyword, "if." does
2998 l->t.t = BC_LEX_KEY_1st_keyword + i;
2999 if (!bc_lex_kws_POSIX(i)) {
3000 s = bc_posix_error_fmt("%sthe '%.8s' keyword", "POSIX does not allow ", bc_lex_kws[i].name8);
3001 IF_ERROR_RETURN_POSSIBLE(if (s) RETURN_STATUS(s));
3004 // We minus 1 because the index has already been incremented.
3006 RETURN_STATUS(BC_STATUS_SUCCESS);
3010 s = BC_STATUS_SUCCESS;
3012 if (l->t.v.len > 2) {
3015 // bc: POSIX only allows one character names; the following is bad: 'qwe=1
3017 unsigned len = strchrnul(buf, '\n') - buf;
3018 s = bc_posix_error_fmt("POSIX only allows one character names; the following is bad: '%.*s'", len, buf);
3023 #define zbc_lex_identifier(...) (zbc_lex_identifier(__VA_ARGS__) COMMA_SUCCESS)
3025 static BC_STATUS zbc_lex_string(BcLex *l)
3029 l->t.t = BC_LEX_STR;
3037 RETURN_STATUS(bc_error("string end could not be found"));
3046 // This check makes sense only if size_t is (much) larger than BC_MAX_STRING.
3047 if (SIZE_MAX > (BC_MAX_STRING | 0xff)) {
3048 if (len > BC_MAX_STRING)
3049 RETURN_STATUS(bc_error("string too long: must be [1,"BC_MAX_STRING_STR"]"));
3051 bc_vec_string(&l->t.v, len, l->buf + l->i);
3055 G.err_line = l->line;
3057 RETURN_STATUS(BC_STATUS_SUCCESS);
3059 #define zbc_lex_string(...) (zbc_lex_string(__VA_ARGS__) COMMA_SUCCESS)
3061 static void bc_lex_assign(BcLex *l, unsigned with_and_without)
3063 if (l->buf[l->i] == '=') {
3065 with_and_without >>= 8; // store "with" value
3066 } // else store "without" value
3067 l->t.t = (with_and_without & 0xff);
3069 #define bc_lex_assign(l, with, without) \
3070 bc_lex_assign(l, ((with)<<8)|(without))
3072 static BC_STATUS zbc_lex_comment(BcLex *l)
3075 const char *buf = l->buf;
3077 l->t.t = BC_LEX_WHITESPACE;
3078 i = l->i; /* here buf[l->i] is the '*' of opening comment delimiter */
3090 RETURN_STATUS(bc_error("comment end could not be found"));
3097 G.err_line = l->line;
3099 RETURN_STATUS(BC_STATUS_SUCCESS);
3101 #define zbc_lex_comment(...) (zbc_lex_comment(__VA_ARGS__) COMMA_SUCCESS)
3103 static BC_STATUS zbc_lex_token(BcLex *l)
3105 BcStatus s = BC_STATUS_SUCCESS;
3106 char c = l->buf[l->i++], c2;
3108 // This is the workhorse of the lexer.
3110 // case '\0': // probably never reached
3112 // l->t.t = BC_LEX_EOF;
3113 // l->newline = true;
3116 l->t.t = BC_LEX_NLINE;
3124 bc_lex_whitespace(l);
3127 bc_lex_assign(l, BC_LEX_OP_REL_NE, BC_LEX_OP_BOOL_NOT);
3128 if (l->t.t == BC_LEX_OP_BOOL_NOT) {
3129 s = bc_POSIX_does_not_allow_bool_ops_this_is_bad("!");
3130 IF_ERROR_RETURN_POSSIBLE(if (s) RETURN_STATUS(s));
3134 s = zbc_lex_string(l);
3137 s = bc_POSIX_does_not_allow("'#' script comments");
3138 IF_ERROR_RETURN_POSSIBLE(if (s) RETURN_STATUS(s));
3139 bc_lex_lineComment(l);
3142 bc_lex_assign(l, BC_LEX_OP_ASSIGN_MODULUS, BC_LEX_OP_MODULUS);
3147 s = bc_POSIX_does_not_allow_bool_ops_this_is_bad("&&");
3148 IF_ERROR_RETURN_POSSIBLE(if (s) RETURN_STATUS(s));
3150 l->t.t = BC_LEX_OP_BOOL_AND;
3152 l->t.t = BC_LEX_INVALID;
3153 s = bc_error_bad_character('&');
3158 l->t.t = (BcLexType)(c - '(' + BC_LEX_LPAREN);
3161 bc_lex_assign(l, BC_LEX_OP_ASSIGN_MULTIPLY, BC_LEX_OP_MULTIPLY);
3167 l->t.t = BC_LEX_OP_INC;
3169 bc_lex_assign(l, BC_LEX_OP_ASSIGN_PLUS, BC_LEX_OP_PLUS);
3172 l->t.t = BC_LEX_COMMA;
3178 l->t.t = BC_LEX_OP_DEC;
3180 bc_lex_assign(l, BC_LEX_OP_ASSIGN_MINUS, BC_LEX_OP_MINUS);
3183 if (isdigit(l->buf[l->i]))
3184 s = zbc_lex_number(l, c);
3186 l->t.t = BC_LEX_KEY_LAST;
3187 s = bc_POSIX_does_not_allow("a period ('.') as a shortcut for the last result");
3193 s = zbc_lex_comment(l);
3195 bc_lex_assign(l, BC_LEX_OP_ASSIGN_DIVIDE, BC_LEX_OP_DIVIDE);
3213 s = zbc_lex_number(l, c);
3216 l->t.t = BC_LEX_SCOLON;
3219 bc_lex_assign(l, BC_LEX_OP_REL_LE, BC_LEX_OP_REL_LT);
3222 bc_lex_assign(l, BC_LEX_OP_REL_EQ, BC_LEX_OP_ASSIGN);
3225 bc_lex_assign(l, BC_LEX_OP_REL_GE, BC_LEX_OP_REL_GT);
3229 l->t.t = (BcLexType)(c - '[' + BC_LEX_LBRACKET);
3232 if (l->buf[l->i] == '\n') {
3233 l->t.t = BC_LEX_WHITESPACE;
3236 s = bc_error_bad_character(c);
3239 bc_lex_assign(l, BC_LEX_OP_ASSIGN_POWER, BC_LEX_OP_POWER);
3267 s = zbc_lex_identifier(l);
3271 l->t.t = (BcLexType)(c - '{' + BC_LEX_LBRACE);
3276 s = bc_POSIX_does_not_allow_bool_ops_this_is_bad("||");
3277 IF_ERROR_RETURN_POSSIBLE(if (s) RETURN_STATUS(s));
3279 l->t.t = BC_LEX_OP_BOOL_OR;
3281 l->t.t = BC_LEX_INVALID;
3282 s = bc_error_bad_character(c);
3286 l->t.t = BC_LEX_INVALID;
3287 s = bc_error_bad_character(c);
3296 static BC_STATUS zdc_lex_register(BcLex *l)
3298 if (isspace(l->buf[l->i - 1])) {
3299 bc_lex_whitespace(l);
3302 RETURN_STATUS(bc_error("extended register"));
3306 bc_vec_pop_all(&l->t.v);
3307 bc_vec_push(&l->t.v, &l->buf[l->i - 1]);
3308 bc_vec_pushZeroByte(&l->t.v);
3309 l->t.t = BC_LEX_NAME;
3312 RETURN_STATUS(BC_STATUS_SUCCESS);
3314 #define zdc_lex_register(...) (zdc_lex_register(__VA_ARGS__) COMMA_SUCCESS)
3316 static BC_STATUS zdc_lex_string(BcLex *l)
3318 size_t depth, nls, i;
3320 l->t.t = BC_LEX_STR;
3321 bc_vec_pop_all(&l->t.v);
3330 RETURN_STATUS(bc_error("string end could not be found"));
3333 if (i == l->i || l->buf[i - 1] != '\\') {
3334 if (c == '[') depth++;
3339 bc_vec_push(&l->t.v, &l->buf[i]);
3344 bc_vec_pushZeroByte(&l->t.v);
3345 // This check makes sense only if size_t is (much) larger than BC_MAX_STRING.
3346 if (SIZE_MAX > (BC_MAX_STRING | 0xff)) {
3347 if (i - l->i > BC_MAX_STRING)
3348 RETURN_STATUS(bc_error("string too long: must be [1,"BC_MAX_STRING_STR"]"));
3353 G.err_line = l->line;
3355 RETURN_STATUS(BC_STATUS_SUCCESS);
3357 #define zdc_lex_string(...) (zdc_lex_string(__VA_ARGS__) COMMA_SUCCESS)
3359 static BC_STATUS zdc_lex_token(BcLex *l)
3361 static const //BcLexType - should be this type, but narrower type saves size:
3364 BC_LEX_OP_REL_EQ, BC_LEX_OP_REL_LE, BC_LEX_OP_REL_GE, BC_LEX_OP_REL_NE,
3365 BC_LEX_OP_REL_LT, BC_LEX_OP_REL_GT, BC_LEX_SCOLON, BC_LEX_COLON,
3366 BC_LEX_ELSE, BC_LEX_LOAD, BC_LEX_LOAD_POP, BC_LEX_OP_ASSIGN,
3369 static const //BcLexType - should be this type
3373 BC_LEX_OP_MODULUS, BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_LPAREN,
3375 BC_LEX_INVALID, BC_LEX_OP_MULTIPLY, BC_LEX_OP_PLUS, BC_LEX_INVALID,
3377 BC_LEX_OP_MINUS, BC_LEX_INVALID, BC_LEX_OP_DIVIDE,
3379 BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID,
3380 BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID,
3381 BC_LEX_INVALID, BC_LEX_INVALID,
3383 BC_LEX_COLON, BC_LEX_SCOLON, BC_LEX_OP_REL_GT, BC_LEX_OP_REL_EQ,
3384 BC_LEX_OP_REL_LT, BC_LEX_KEY_READ, BC_LEX_INVALID,
3386 BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID,
3387 BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_EQ_NO_REG, BC_LEX_INVALID,
3389 BC_LEX_KEY_IBASE, BC_LEX_INVALID, BC_LEX_KEY_SCALE, BC_LEX_LOAD_POP,
3390 BC_LEX_INVALID, BC_LEX_OP_BOOL_NOT, BC_LEX_KEY_OBASE, BC_LEX_PRINT_STREAM,
3392 BC_LEX_NQUIT, BC_LEX_POP, BC_LEX_STORE_PUSH, BC_LEX_INVALID, BC_LEX_INVALID,
3393 BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_SCALE_FACTOR, BC_LEX_INVALID,
3395 BC_LEX_KEY_LENGTH, BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID,
3397 BC_LEX_OP_POWER, BC_LEX_NEG, BC_LEX_INVALID,
3399 BC_LEX_ASCIIFY, BC_LEX_INVALID, BC_LEX_CLEAR_STACK, BC_LEX_DUPLICATE,
3400 BC_LEX_ELSE, BC_LEX_PRINT_STACK, BC_LEX_INVALID, BC_LEX_INVALID,
3402 BC_LEX_STORE_IBASE, BC_LEX_INVALID, BC_LEX_STORE_SCALE, BC_LEX_LOAD,
3403 BC_LEX_INVALID, BC_LEX_PRINT_POP, BC_LEX_STORE_OBASE, BC_LEX_KEY_PRINT,
3405 BC_LEX_KEY_QUIT, BC_LEX_SWAP, BC_LEX_OP_ASSIGN, BC_LEX_INVALID,
3406 BC_LEX_INVALID, BC_LEX_KEY_SQRT, BC_LEX_INVALID, BC_LEX_EXECUTE,
3408 BC_LEX_INVALID, BC_LEX_STACK_LEVEL,
3410 BC_LEX_LBRACE, BC_LEX_OP_MODEXP, BC_LEX_INVALID, BC_LEX_OP_DIVMOD,
3413 BcStatus s = BC_STATUS_SUCCESS;
3414 char c = l->buf[l->i++], c2;
3417 for (i = 0; i < ARRAY_SIZE(dc_lex_regs); ++i) {
3418 if (l->t.last == dc_lex_regs[i])
3419 RETURN_STATUS(zdc_lex_register(l));
3422 if (c >= '%' && c <= '~'
3423 && (l->t.t = dc_lex_tokens[c - '%']) != BC_LEX_INVALID
3428 // This is the workhorse of the lexer.
3430 // case '\0': // probably never reached
3431 // l->t.t = BC_LEX_EOF;
3439 l->newline = (c == '\n');
3440 bc_lex_whitespace(l);
3445 l->t.t = BC_LEX_OP_REL_NE;
3447 l->t.t = BC_LEX_OP_REL_LE;
3449 l->t.t = BC_LEX_OP_REL_GE;
3451 RETURN_STATUS(bc_error_bad_character(c));
3455 bc_lex_lineComment(l);
3458 if (isdigit(l->buf[l->i]))
3459 s = zbc_lex_number(l, c);
3461 s = bc_error_bad_character(c);
3479 s = zbc_lex_number(l, c);
3482 s = zdc_lex_string(l);
3485 l->t.t = BC_LEX_INVALID;
3486 s = bc_error_bad_character(c);
3494 static void bc_parse_push(BcParse *p, char i)
3496 dbg_compile("%s:%d pushing bytecode %zd:%d", __func__, __LINE__, p->func->code.len, i);
3497 bc_vec_pushByte(&p->func->code, i);
3500 static void bc_parse_pushName(BcParse *p, char *name)
3503 bc_parse_push(p, *name++);
3504 bc_parse_push(p, BC_PARSE_STREND);
3507 static void bc_parse_pushIndex(BcParse *p, size_t idx)
3512 dbg_lex("%s:%d pushing index %zd", __func__, __LINE__, idx);
3513 mask = ((size_t)0xff) << (sizeof(idx) * 8 - 8);
3516 if (idx & mask) break;
3521 bc_parse_push(p, amt);
3524 bc_parse_push(p, (unsigned char)idx);
3530 static void bc_parse_pushJUMP(BcParse *p, size_t idx)
3532 bc_parse_push(p, BC_INST_JUMP);
3533 bc_parse_pushIndex(p, idx);
3536 static void bc_parse_pushJUMP_ZERO(BcParse *p, size_t idx)
3538 bc_parse_push(p, BC_INST_JUMP_ZERO);
3539 bc_parse_pushIndex(p, idx);
3542 static BC_STATUS zbc_parse_pushSTR(BcParse *p)
3544 char *str = xstrdup(p->l.t.v.v);
3546 bc_parse_push(p, BC_INST_STR);
3547 bc_parse_pushIndex(p, p->func->strs.len);
3548 bc_vec_push(&p->func->strs, &str);
3550 RETURN_STATUS(zbc_lex_next(&p->l));
3552 #define zbc_parse_pushSTR(...) (zbc_parse_pushSTR(__VA_ARGS__) COMMA_SUCCESS)
3555 static void bc_parse_pushNUM(BcParse *p)
3557 char *num = xstrdup(p->l.t.v.v);
3558 #if ENABLE_BC && ENABLE_DC
3559 size_t idx = bc_vec_push(IS_BC ? &p->func->consts : &G.prog.consts, &num);
3561 size_t idx = bc_vec_push(&p->func->consts, &num);
3563 size_t idx = bc_vec_push(&G.prog.consts, &num);
3565 bc_parse_push(p, BC_INST_NUM);
3566 bc_parse_pushIndex(p, idx);
3569 static BC_STATUS zbc_parse_text_init(BcParse *p, const char *text)
3571 p->func = bc_program_func(p->fidx);
3573 RETURN_STATUS(zbc_lex_text_init(&p->l, text));
3575 #define zbc_parse_text_init(...) (zbc_parse_text_init(__VA_ARGS__) COMMA_SUCCESS)
3577 // Called when parsing or execution detects a failure,
3578 // resets execution structures.
3579 static void bc_program_reset(void)
3584 bc_vec_npop(&G.prog.exestack, G.prog.exestack.len - 1);
3585 bc_vec_pop_all(&G.prog.results);
3587 f = bc_program_func_BC_PROG_MAIN();
3588 ip = bc_vec_top(&G.prog.exestack);
3589 ip->inst_idx = f->code.len;
3592 // Called when parsing code detects a failure,
3593 // resets parsing structures.
3594 static void bc_parse_reset(BcParse *p)
3596 if (p->fidx != BC_PROG_MAIN) {
3597 bc_func_free(p->func);
3598 bc_func_init(p->func);
3600 p->fidx = BC_PROG_MAIN;
3601 p->func = bc_program_func_BC_PROG_MAIN();
3605 p->l.t.t = BC_LEX_EOF;
3607 IF_BC(bc_vec_pop_all(&p->exits);)
3608 IF_BC(bc_vec_pop_all(&p->conds);)
3609 IF_BC(bc_vec_pop_all(&p->ops);)
3614 static void bc_parse_free(BcParse *p)
3616 IF_BC(bc_vec_free(&p->exits);)
3617 IF_BC(bc_vec_free(&p->conds);)
3618 IF_BC(bc_vec_free(&p->ops);)
3622 static void bc_parse_create(BcParse *p, size_t fidx)
3624 memset(p, 0, sizeof(BcParse));
3627 IF_BC(bc_vec_init(&p->exits, sizeof(size_t), NULL);)
3628 IF_BC(bc_vec_init(&p->conds, sizeof(size_t), NULL);)
3629 IF_BC(bc_vec_init(&p->ops, sizeof(BcLexType), NULL);)
3632 p->func = bc_program_func(fidx);
3635 static void bc_program_add_fn(void)
3641 bc_vec_push(&G.prog.fns, &f);
3647 // Note: takes ownership of 'name' (must be malloced)
3648 static size_t bc_program_addFunc(char *name)
3651 BcId entry, *entry_ptr;
3655 entry.idx = G.prog.fns.len;
3657 inserted = bc_map_insert(&G.prog.fn_map, &entry, &idx);
3658 if (!inserted) free(name);
3660 entry_ptr = bc_vec_item(&G.prog.fn_map, idx);
3661 idx = entry_ptr->idx;
3664 // There is already a function with this name.
3665 // It'll be redefined now, clear old definition.
3666 BcFunc *func = bc_program_func(entry_ptr->idx);
3670 bc_program_add_fn();
3676 #define BC_PARSE_TOP_OP(p) (*((BcLexType *) bc_vec_top(&(p)->ops)))
3677 #define BC_PARSE_LEAF(p, rparen) \
3678 (((p) >= BC_INST_NUM && (p) <= BC_INST_SQRT) || (rparen) || \
3679 (p) == BC_INST_INC_POST || (p) == BC_INST_DEC_POST)
3681 // We can calculate the conversion between tokens and exprs by subtracting the
3682 // position of the first operator in the lex enum and adding the position of the
3683 // first in the expr enum. Note: This only works for binary operators.
3684 #define BC_TOKEN_2_INST(t) ((char) ((t) - BC_LEX_NEG + BC_INST_NEG))
3686 static BcStatus bc_parse_expr_empty_ok(BcParse *p, uint8_t flags);
3688 static BC_STATUS zbc_parse_expr(BcParse *p, uint8_t flags)
3692 s = bc_parse_expr_empty_ok(p, flags);
3693 if (s == BC_STATUS_PARSE_EMPTY_EXP)
3694 RETURN_STATUS(bc_error("empty expression"));
3697 #define zbc_parse_expr(...) (zbc_parse_expr(__VA_ARGS__) COMMA_SUCCESS)
3699 static BC_STATUS zbc_parse_stmt_possibly_auto(BcParse *p, bool auto_allowed);
3700 #define zbc_parse_stmt_possibly_auto(...) (zbc_parse_stmt_possibly_auto(__VA_ARGS__) COMMA_SUCCESS)
3702 static BC_STATUS zbc_parse_stmt(BcParse *p)
3704 RETURN_STATUS(zbc_parse_stmt_possibly_auto(p, false));
3706 #define zbc_parse_stmt(...) (zbc_parse_stmt(__VA_ARGS__) COMMA_SUCCESS)
3708 static BC_STATUS zbc_parse_stmt_allow_NLINE_before(BcParse *p, const char *after_X)
3710 // "if(cond)<newline>stmt" is accepted too, but not 2+ newlines.
3711 // Same for "else", "while()", "for()".
3712 BcStatus s = zbc_lex_next_and_skip_NLINE(&p->l);
3713 if (s) RETURN_STATUS(s);
3714 if (p->l.t.t == BC_LEX_NLINE)
3715 RETURN_STATUS(bc_error_fmt("no statement after '%s'", after_X));
3717 RETURN_STATUS(zbc_parse_stmt(p));
3719 #define zbc_parse_stmt_allow_NLINE_before(...) (zbc_parse_stmt_allow_NLINE_before(__VA_ARGS__) COMMA_SUCCESS)
3721 static void bc_parse_operator(BcParse *p, BcLexType type, size_t start,
3724 char l, r = bc_parse_op_PREC(type - BC_LEX_OP_INC);
3725 bool left = bc_parse_op_LEFT(type - BC_LEX_OP_INC);
3727 while (p->ops.len > start) {
3728 BcLexType t = BC_PARSE_TOP_OP(p);
3729 if (t == BC_LEX_LPAREN) break;
3731 l = bc_parse_op_PREC(t - BC_LEX_OP_INC);
3732 if (l >= r && (l != r || !left)) break;
3734 bc_parse_push(p, BC_TOKEN_2_INST(t));
3735 bc_vec_pop(&p->ops);
3736 *nexprs -= (t != BC_LEX_OP_BOOL_NOT && t != BC_LEX_NEG);
3739 bc_vec_push(&p->ops, &type);
3742 static BC_STATUS zbc_parse_rightParen(BcParse *p, size_t ops_bgn, size_t *nexs)
3746 if (p->ops.len <= ops_bgn)
3747 RETURN_STATUS(bc_error_bad_expression());
3748 top = BC_PARSE_TOP_OP(p);
3750 while (top != BC_LEX_LPAREN) {
3751 bc_parse_push(p, BC_TOKEN_2_INST(top));
3753 bc_vec_pop(&p->ops);
3754 *nexs -= top != BC_LEX_OP_BOOL_NOT && top != BC_LEX_NEG;
3756 if (p->ops.len <= ops_bgn)
3757 RETURN_STATUS(bc_error_bad_expression());
3758 top = BC_PARSE_TOP_OP(p);
3761 bc_vec_pop(&p->ops);
3763 RETURN_STATUS(zbc_lex_next(&p->l));
3765 #define zbc_parse_rightParen(...) (zbc_parse_rightParen(__VA_ARGS__) COMMA_SUCCESS)
3767 static BC_STATUS zbc_parse_params(BcParse *p, uint8_t flags)
3772 dbg_lex("%s:%d p->l.t.t:%d", __func__, __LINE__, p->l.t.t);
3773 flags = (flags & ~(BC_PARSE_PRINT | BC_PARSE_REL)) | BC_PARSE_ARRAY;
3775 s = zbc_lex_next(&p->l);
3776 if (s) RETURN_STATUS(s);
3779 if (p->l.t.t != BC_LEX_RPAREN) {
3781 s = zbc_parse_expr(p, flags);
3782 if (s) RETURN_STATUS(s);
3784 if (p->l.t.t != BC_LEX_COMMA) {
3785 if (p->l.t.t == BC_LEX_RPAREN)
3787 RETURN_STATUS(bc_error_bad_token());
3789 s = zbc_lex_next(&p->l);
3790 if (s) RETURN_STATUS(s);
3794 bc_parse_push(p, BC_INST_CALL);
3795 bc_parse_pushIndex(p, nparams);
3797 RETURN_STATUS(BC_STATUS_SUCCESS);
3799 #define zbc_parse_params(...) (zbc_parse_params(__VA_ARGS__) COMMA_SUCCESS)
3801 // Note: takes ownership of 'name' (must be malloced)
3802 static BC_STATUS zbc_parse_call(BcParse *p, char *name, uint8_t flags)
3805 BcId entry, *entry_ptr;
3810 s = zbc_parse_params(p, flags);
3813 if (p->l.t.t != BC_LEX_RPAREN) {
3814 s = bc_error_bad_token();
3818 idx = bc_map_find_exact(&G.prog.fn_map, &entry);
3820 if (idx == BC_VEC_INVALID_IDX) {
3821 // No such function exists, create an empty one
3822 bc_program_addFunc(name);
3823 idx = bc_map_find_exact(&G.prog.fn_map, &entry);
3827 entry_ptr = bc_vec_item(&G.prog.fn_map, idx);
3828 bc_parse_pushIndex(p, entry_ptr->idx);
3830 RETURN_STATUS(zbc_lex_next(&p->l));
3835 #define zbc_parse_call(...) (zbc_parse_call(__VA_ARGS__) COMMA_SUCCESS)
3837 static BC_STATUS zbc_parse_name(BcParse *p, BcInst *type, uint8_t flags)
3842 name = xstrdup(p->l.t.v.v);
3843 s = zbc_lex_next(&p->l);
3846 if (p->l.t.t == BC_LEX_LBRACKET) {
3847 s = zbc_lex_next(&p->l);
3850 if (p->l.t.t == BC_LEX_RBRACKET) {
3851 if (!(flags & BC_PARSE_ARRAY)) {
3852 s = bc_error_bad_expression();
3855 *type = BC_INST_ARRAY;
3857 *type = BC_INST_ARRAY_ELEM;
3858 flags &= ~(BC_PARSE_PRINT | BC_PARSE_REL);
3859 s = zbc_parse_expr(p, flags);
3862 s = zbc_lex_next(&p->l);
3864 bc_parse_push(p, *type);
3865 bc_parse_pushName(p, name);
3867 } else if (p->l.t.t == BC_LEX_LPAREN) {
3868 if (flags & BC_PARSE_NOCALL) {
3869 s = bc_error_bad_token();
3872 *type = BC_INST_CALL;
3873 s = zbc_parse_call(p, name, flags);
3875 *type = BC_INST_VAR;
3876 bc_parse_push(p, BC_INST_VAR);
3877 bc_parse_pushName(p, name);
3886 #define zbc_parse_name(...) (zbc_parse_name(__VA_ARGS__) COMMA_SUCCESS)
3888 static BC_STATUS zbc_parse_read(BcParse *p)
3892 s = zbc_lex_next(&p->l);
3893 if (s) RETURN_STATUS(s);
3894 if (p->l.t.t != BC_LEX_LPAREN) RETURN_STATUS(bc_error_bad_token());
3896 s = zbc_lex_next(&p->l);
3897 if (s) RETURN_STATUS(s);
3898 if (p->l.t.t != BC_LEX_RPAREN) RETURN_STATUS(bc_error_bad_token());
3900 bc_parse_push(p, BC_INST_READ);
3902 RETURN_STATUS(zbc_lex_next(&p->l));
3904 #define zbc_parse_read(...) (zbc_parse_read(__VA_ARGS__) COMMA_SUCCESS)
3906 static BC_STATUS zbc_parse_builtin(BcParse *p, BcLexType type, uint8_t flags,
3911 s = zbc_lex_next(&p->l);
3912 if (s) RETURN_STATUS(s);
3913 if (p->l.t.t != BC_LEX_LPAREN) RETURN_STATUS(bc_error_bad_token());
3915 flags = (flags & ~(BC_PARSE_PRINT | BC_PARSE_REL)) | BC_PARSE_ARRAY;
3917 s = zbc_lex_next(&p->l);
3918 if (s) RETURN_STATUS(s);
3920 s = zbc_parse_expr(p, flags);
3921 if (s) RETURN_STATUS(s);
3923 if (p->l.t.t != BC_LEX_RPAREN) RETURN_STATUS(bc_error_bad_token());
3925 *prev = (type == BC_LEX_KEY_LENGTH) ? BC_INST_LENGTH : BC_INST_SQRT;
3926 bc_parse_push(p, *prev);
3928 RETURN_STATUS(zbc_lex_next(&p->l));
3930 #define zbc_parse_builtin(...) (zbc_parse_builtin(__VA_ARGS__) COMMA_SUCCESS)
3932 static BC_STATUS zbc_parse_scale(BcParse *p, BcInst *type, uint8_t flags)
3936 s = zbc_lex_next(&p->l);
3937 if (s) RETURN_STATUS(s);
3939 if (p->l.t.t != BC_LEX_LPAREN) {
3940 *type = BC_INST_SCALE;
3941 bc_parse_push(p, BC_INST_SCALE);
3942 RETURN_STATUS(BC_STATUS_SUCCESS);
3945 *type = BC_INST_SCALE_FUNC;
3946 flags &= ~(BC_PARSE_PRINT | BC_PARSE_REL);
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);
3953 if (p->l.t.t != BC_LEX_RPAREN)
3954 RETURN_STATUS(bc_error_bad_token());
3955 bc_parse_push(p, BC_INST_SCALE_FUNC);
3957 RETURN_STATUS(zbc_lex_next(&p->l));
3959 #define zbc_parse_scale(...) (zbc_parse_scale(__VA_ARGS__) COMMA_SUCCESS)
3961 static BC_STATUS zbc_parse_incdec(BcParse *p, BcInst *prev, bool *paren_expr,
3962 size_t *nexprs, uint8_t flags)
3967 BcInst etype = *prev;
3969 if (etype == BC_INST_VAR || etype == BC_INST_ARRAY_ELEM
3970 || etype == BC_INST_SCALE || etype == BC_INST_LAST
3971 || etype == BC_INST_IBASE || etype == BC_INST_OBASE
3973 *prev = inst = BC_INST_INC_POST + (p->l.t.t != BC_LEX_OP_INC);
3974 bc_parse_push(p, inst);
3975 s = zbc_lex_next(&p->l);
3977 *prev = inst = BC_INST_INC_PRE + (p->l.t.t != BC_LEX_OP_INC);
3980 s = zbc_lex_next(&p->l);
3981 if (s) RETURN_STATUS(s);
3984 // Because we parse the next part of the expression
3985 // right here, we need to increment this.
3986 *nexprs = *nexprs + 1;
3990 s = zbc_parse_name(p, prev, flags | BC_PARSE_NOCALL);
3992 case BC_LEX_KEY_IBASE:
3993 case BC_LEX_KEY_LAST:
3994 case BC_LEX_KEY_OBASE:
3995 bc_parse_push(p, type - BC_LEX_KEY_IBASE + BC_INST_IBASE);
3996 s = zbc_lex_next(&p->l);
3998 case BC_LEX_KEY_SCALE:
3999 s = zbc_lex_next(&p->l);
4000 if (s) RETURN_STATUS(s);
4001 if (p->l.t.t == BC_LEX_LPAREN)
4002 s = bc_error_bad_token();
4004 bc_parse_push(p, BC_INST_SCALE);
4007 s = bc_error_bad_token();
4011 if (!s) bc_parse_push(p, inst);
4016 #define zbc_parse_incdec(...) (zbc_parse_incdec(__VA_ARGS__) COMMA_SUCCESS)
4018 static BC_STATUS zbc_parse_minus(BcParse *p, BcInst *prev, size_t ops_bgn,
4019 bool rparen, size_t *nexprs)
4023 BcInst etype = *prev;
4025 s = zbc_lex_next(&p->l);
4026 if (s) RETURN_STATUS(s);
4028 type = rparen || etype == BC_INST_INC_POST || etype == BC_INST_DEC_POST ||
4029 (etype >= BC_INST_NUM && etype <= BC_INST_SQRT) ?
4032 *prev = BC_TOKEN_2_INST(type);
4034 // We can just push onto the op stack because this is the largest
4035 // precedence operator that gets pushed. Inc/dec does not.
4036 if (type != BC_LEX_OP_MINUS)
4037 bc_vec_push(&p->ops, &type);
4039 bc_parse_operator(p, type, ops_bgn, nexprs);
4043 #define zbc_parse_minus(...) (zbc_parse_minus(__VA_ARGS__) COMMA_SUCCESS)
4045 static BC_STATUS zbc_parse_print(BcParse *p)
4051 s = zbc_lex_next(&p->l);
4052 if (s) RETURN_STATUS(s);
4054 if (type == BC_LEX_STR) {
4055 s = zbc_parse_pushSTR(p);
4057 s = zbc_parse_expr(p, 0);
4059 if (s) RETURN_STATUS(s);
4060 bc_parse_push(p, BC_INST_PRINT_POP);
4061 if (p->l.t.t != BC_LEX_COMMA)
4067 #define zbc_parse_print(...) (zbc_parse_print(__VA_ARGS__) COMMA_SUCCESS)
4069 static BC_STATUS zbc_parse_return(BcParse *p)
4074 dbg_lex_enter("%s:%d entered", __func__, __LINE__);
4075 s = zbc_lex_next(&p->l);
4076 if (s) RETURN_STATUS(s);
4079 if (t == BC_LEX_NLINE || t == BC_LEX_SCOLON)
4080 bc_parse_push(p, BC_INST_RET0);
4082 bool paren = (t == BC_LEX_LPAREN);
4083 s = bc_parse_expr_empty_ok(p, 0);
4084 if (s == BC_STATUS_PARSE_EMPTY_EXP) {
4085 bc_parse_push(p, BC_INST_RET0);
4086 s = zbc_lex_next(&p->l);
4088 if (s) RETURN_STATUS(s);
4090 if (!paren || p->l.t.last != BC_LEX_RPAREN) {
4091 s = bc_POSIX_requires("parentheses around return expressions");
4092 IF_ERROR_RETURN_POSSIBLE(if (s) RETURN_STATUS(s));
4095 bc_parse_push(p, BC_INST_RET);
4098 dbg_lex_done("%s:%d done", __func__, __LINE__);
4101 #define zbc_parse_return(...) (zbc_parse_return(__VA_ARGS__) COMMA_SUCCESS)
4103 static void rewrite_label_to_current(BcParse *p, size_t idx)
4105 size_t *label = bc_vec_item(&p->func->labels, idx);
4106 *label = p->func->code.len;
4109 static BC_STATUS zbc_parse_if(BcParse *p)
4114 dbg_lex_enter("%s:%d entered", __func__, __LINE__);
4115 s = zbc_lex_next(&p->l);
4116 if (s) RETURN_STATUS(s);
4117 if (p->l.t.t != BC_LEX_LPAREN) RETURN_STATUS(bc_error_bad_token());
4119 s = zbc_lex_next(&p->l);
4120 if (s) RETURN_STATUS(s);
4121 s = zbc_parse_expr(p, BC_PARSE_REL);
4122 if (s) RETURN_STATUS(s);
4123 if (p->l.t.t != BC_LEX_RPAREN) RETURN_STATUS(bc_error_bad_token());
4125 // Encode "if zero, jump to ..."
4126 // Pushed value (destination of the jump) is uninitialized,
4127 // will be rewritten to be address of "end of if()" or of "else".
4128 ip_idx = bc_vec_push(&p->func->labels, &ip_idx);
4129 bc_parse_pushJUMP_ZERO(p, ip_idx);
4131 s = zbc_parse_stmt_allow_NLINE_before(p, STRING_if);
4132 if (s) RETURN_STATUS(s);
4134 dbg_lex("%s:%d in if after stmt: p->l.t.t:%d", __func__, __LINE__, p->l.t.t);
4135 if (p->l.t.t == BC_LEX_KEY_ELSE) {
4138 // Encode "after then_stmt, jump to end of if()"
4139 ip2_idx = bc_vec_push(&p->func->labels, &ip2_idx);
4140 dbg_lex("%s:%d after if() then_stmt: BC_INST_JUMP to %zd", __func__, __LINE__, ip2_idx);
4141 bc_parse_pushJUMP(p, ip2_idx);
4143 dbg_lex("%s:%d rewriting 'if_zero' label to jump to 'else'-> %zd", __func__, __LINE__, p->func->code.len);
4144 rewrite_label_to_current(p, ip_idx);
4148 s = zbc_parse_stmt_allow_NLINE_before(p, STRING_else);
4149 if (s) RETURN_STATUS(s);
4152 dbg_lex("%s:%d rewriting label to jump after 'if' body-> %zd", __func__, __LINE__, p->func->code.len);
4153 rewrite_label_to_current(p, ip_idx);
4155 dbg_lex_done("%s:%d done", __func__, __LINE__);
4158 #define zbc_parse_if(...) (zbc_parse_if(__VA_ARGS__) COMMA_SUCCESS)
4160 static BC_STATUS zbc_parse_while(BcParse *p)
4166 s = zbc_lex_next(&p->l);
4167 if (s) RETURN_STATUS(s);
4168 if (p->l.t.t != BC_LEX_LPAREN) RETURN_STATUS(bc_error_bad_token());
4169 s = zbc_lex_next(&p->l);
4170 if (s) RETURN_STATUS(s);
4172 cond_idx = bc_vec_push(&p->func->labels, &p->func->code.len);
4173 ip_idx = cond_idx + 1;
4174 bc_vec_push(&p->conds, &cond_idx);
4176 bc_vec_push(&p->exits, &ip_idx);
4177 bc_vec_push(&p->func->labels, &ip_idx);
4179 s = zbc_parse_expr(p, BC_PARSE_REL);
4180 if (s) RETURN_STATUS(s);
4181 if (p->l.t.t != BC_LEX_RPAREN) RETURN_STATUS(bc_error_bad_token());
4183 bc_parse_pushJUMP_ZERO(p, ip_idx);
4185 s = zbc_parse_stmt_allow_NLINE_before(p, STRING_while);
4186 if (s) RETURN_STATUS(s);
4188 dbg_lex("%s:%d BC_INST_JUMP to %zd", __func__, __LINE__, cond_idx);
4189 bc_parse_pushJUMP(p, cond_idx);
4191 dbg_lex("%s:%d rewriting label-> %zd", __func__, __LINE__, p->func->code.len);
4192 rewrite_label_to_current(p, ip_idx);
4194 bc_vec_pop(&p->exits);
4195 bc_vec_pop(&p->conds);
4199 #define zbc_parse_while(...) (zbc_parse_while(__VA_ARGS__) COMMA_SUCCESS)
4201 static BC_STATUS zbc_parse_for(BcParse *p)
4204 size_t cond_idx, exit_idx, body_idx, update_idx;
4206 dbg_lex("%s:%d p->l.t.t:%d", __func__, __LINE__, p->l.t.t);
4207 s = zbc_lex_next(&p->l);
4208 if (s) RETURN_STATUS(s);
4209 if (p->l.t.t != BC_LEX_LPAREN) RETURN_STATUS(bc_error_bad_token());
4210 s = zbc_lex_next(&p->l);
4211 if (s) RETURN_STATUS(s);
4213 if (p->l.t.t != BC_LEX_SCOLON) {
4214 s = zbc_parse_expr(p, 0);
4215 bc_parse_push(p, BC_INST_POP);
4216 if (s) RETURN_STATUS(s);
4218 s = bc_POSIX_does_not_allow_empty_X_expression_in_for("init");
4219 IF_ERROR_RETURN_POSSIBLE(if (s) RETURN_STATUS(s);)
4222 if (p->l.t.t != BC_LEX_SCOLON) RETURN_STATUS(bc_error_bad_token());
4223 s = zbc_lex_next(&p->l);
4224 if (s) RETURN_STATUS(s);
4226 cond_idx = bc_vec_push(&p->func->labels, &p->func->code.len);
4227 update_idx = cond_idx + 1;
4228 body_idx = update_idx + 1;
4229 exit_idx = body_idx + 1;
4231 if (p->l.t.t != BC_LEX_SCOLON)
4232 s = zbc_parse_expr(p, BC_PARSE_REL);
4234 // Set this for the next call to bc_parse_pushNUM().
4235 // This is safe to set because the current token is a semicolon,
4236 // which has no string requirement.
4237 bc_vec_string(&p->l.t.v, 1, "1");
4238 bc_parse_pushNUM(p);
4239 s = bc_POSIX_does_not_allow_empty_X_expression_in_for("condition");
4241 if (s) RETURN_STATUS(s);
4243 if (p->l.t.t != BC_LEX_SCOLON) RETURN_STATUS(bc_error_bad_token());
4245 s = zbc_lex_next(&p->l);
4246 if (s) RETURN_STATUS(s);
4248 bc_parse_pushJUMP_ZERO(p, exit_idx);
4249 bc_parse_pushJUMP(p, body_idx);
4251 bc_vec_push(&p->conds, &update_idx);
4252 bc_vec_push(&p->func->labels, &p->func->code.len);
4254 if (p->l.t.t != BC_LEX_RPAREN) {
4255 s = zbc_parse_expr(p, 0);
4256 if (s) RETURN_STATUS(s);
4257 if (p->l.t.t != BC_LEX_RPAREN) RETURN_STATUS(bc_error_bad_token());
4258 bc_parse_push(p, BC_INST_POP);
4260 s = bc_POSIX_does_not_allow_empty_X_expression_in_for("update");
4261 IF_ERROR_RETURN_POSSIBLE(if (s) RETURN_STATUS(s);)
4264 bc_parse_pushJUMP(p, cond_idx);
4265 bc_vec_push(&p->func->labels, &p->func->code.len);
4267 bc_vec_push(&p->exits, &exit_idx);
4268 bc_vec_push(&p->func->labels, &exit_idx);
4270 s = zbc_parse_stmt_allow_NLINE_before(p, STRING_for);
4271 if (s) RETURN_STATUS(s);
4273 dbg_lex("%s:%d BC_INST_JUMP to %zd", __func__, __LINE__, update_idx);
4274 bc_parse_pushJUMP(p, update_idx);
4276 dbg_lex("%s:%d rewriting label-> %zd", __func__, __LINE__, p->func->code.len);
4277 rewrite_label_to_current(p, exit_idx);
4279 bc_vec_pop(&p->exits);
4280 bc_vec_pop(&p->conds);
4282 RETURN_STATUS(BC_STATUS_SUCCESS);
4284 #define zbc_parse_for(...) (zbc_parse_for(__VA_ARGS__) COMMA_SUCCESS)
4286 static BC_STATUS zbc_parse_break_or_continue(BcParse *p, BcLexType type)
4291 if (type == BC_LEX_KEY_BREAK) {
4292 if (p->exits.len == 0) // none of the enclosing blocks is a loop
4293 RETURN_STATUS(bc_error_bad_token());
4294 i = *(size_t*)bc_vec_top(&p->exits);
4296 i = *(size_t*)bc_vec_top(&p->conds);
4299 bc_parse_pushJUMP(p, i);
4301 s = zbc_lex_next(&p->l);
4302 if (s) RETURN_STATUS(s);
4304 if (p->l.t.t != BC_LEX_SCOLON && p->l.t.t != BC_LEX_NLINE)
4305 RETURN_STATUS(bc_error_bad_token());
4307 RETURN_STATUS(zbc_lex_next(&p->l));
4309 #define zbc_parse_break_or_continue(...) (zbc_parse_break_or_continue(__VA_ARGS__) COMMA_SUCCESS)
4311 static BC_STATUS zbc_parse_funcdef(BcParse *p)
4314 bool var, comma = false;
4317 dbg_lex_enter("%s:%d entered", __func__, __LINE__);
4318 s = zbc_lex_next(&p->l);
4319 if (s) RETURN_STATUS(s);
4320 if (p->l.t.t != BC_LEX_NAME)
4321 RETURN_STATUS(bc_error("bad function definition"));
4323 name = xstrdup(p->l.t.v.v);
4324 p->fidx = bc_program_addFunc(name);
4325 p->func = bc_program_func(p->fidx);
4327 s = zbc_lex_next(&p->l);
4328 if (s) RETURN_STATUS(s);
4329 if (p->l.t.t != BC_LEX_LPAREN)
4330 RETURN_STATUS(bc_error("bad function definition"));
4331 s = zbc_lex_next(&p->l);
4332 if (s) RETURN_STATUS(s);
4334 while (p->l.t.t != BC_LEX_RPAREN) {
4335 if (p->l.t.t != BC_LEX_NAME)
4336 RETURN_STATUS(bc_error("bad function definition"));
4340 name = xstrdup(p->l.t.v.v);
4341 s = zbc_lex_next(&p->l);
4344 var = p->l.t.t != BC_LEX_LBRACKET;
4347 s = zbc_lex_next(&p->l);
4350 if (p->l.t.t != BC_LEX_RBRACKET) {
4351 s = bc_error("bad function definition");
4355 s = zbc_lex_next(&p->l);
4359 comma = p->l.t.t == BC_LEX_COMMA;
4361 s = zbc_lex_next(&p->l);
4365 s = zbc_func_insert(p->func, name, var);
4369 if (comma) RETURN_STATUS(bc_error("bad function definition"));
4371 s = zbc_lex_next(&p->l);
4372 if (s) RETURN_STATUS(s);
4374 if (p->l.t.t != BC_LEX_LBRACE)
4375 s = bc_POSIX_requires("the left brace be on the same line as the function header");
4377 // Prevent "define z()<newline>" from being interpreted as function with empty stmt as body
4378 s = zbc_lex_skip_if_at_NLINE(&p->l);
4379 if (s) RETURN_STATUS(s);
4380 //GNU bc requires a {} block even if function body has single stmt, enforce this?
4381 if (p->l.t.t != BC_LEX_LBRACE)
4382 RETURN_STATUS(bc_error("function { body } expected"));
4384 p->in_funcdef++; // to determine whether "return" stmt is allowed, and such
4385 s = zbc_parse_stmt_possibly_auto(p, true);
4387 if (s) RETURN_STATUS(s);
4389 bc_parse_push(p, BC_INST_RET0);
4391 // Subsequent code generation is into main program
4392 p->fidx = BC_PROG_MAIN;
4393 p->func = bc_program_func_BC_PROG_MAIN();
4395 dbg_lex_done("%s:%d done", __func__, __LINE__);
4398 dbg_lex_done("%s:%d done (error)", __func__, __LINE__);
4402 #define zbc_parse_funcdef(...) (zbc_parse_funcdef(__VA_ARGS__) COMMA_SUCCESS)
4404 static BC_STATUS zbc_parse_auto(BcParse *p)
4407 bool comma, var, one;
4410 dbg_lex_enter("%s:%d entered", __func__, __LINE__);
4411 s = zbc_lex_next(&p->l);
4412 if (s) RETURN_STATUS(s);
4415 one = p->l.t.t == BC_LEX_NAME;
4417 while (p->l.t.t == BC_LEX_NAME) {
4418 name = xstrdup(p->l.t.v.v);
4419 s = zbc_lex_next(&p->l);
4422 var = p->l.t.t != BC_LEX_LBRACKET;
4424 s = zbc_lex_next(&p->l);
4427 if (p->l.t.t != BC_LEX_RBRACKET) {
4428 s = bc_error("bad function definition");
4432 s = zbc_lex_next(&p->l);
4436 comma = p->l.t.t == BC_LEX_COMMA;
4438 s = zbc_lex_next(&p->l);
4442 s = zbc_func_insert(p->func, name, var);
4446 if (comma) RETURN_STATUS(bc_error("bad function definition"));
4447 if (!one) RETURN_STATUS(bc_error("no auto variable found"));
4449 if (p->l.t.t != BC_LEX_NLINE && p->l.t.t != BC_LEX_SCOLON)
4450 RETURN_STATUS(bc_error_bad_token());
4452 dbg_lex_done("%s:%d done", __func__, __LINE__);
4453 RETURN_STATUS(zbc_lex_next(&p->l));
4456 dbg_lex_done("%s:%d done (ERROR)", __func__, __LINE__);
4459 #define zbc_parse_auto(...) (zbc_parse_auto(__VA_ARGS__) COMMA_SUCCESS)
4461 #undef zbc_parse_stmt_possibly_auto
4462 static BC_STATUS zbc_parse_stmt_possibly_auto(BcParse *p, bool auto_allowed)
4464 BcStatus s = BC_STATUS_SUCCESS;
4466 dbg_lex_enter("%s:%d entered, p->l.t.t:%d", __func__, __LINE__, p->l.t.t);
4468 if (p->l.t.t == BC_LEX_NLINE) {
4469 dbg_lex_done("%s:%d done (seen BC_LEX_NLINE)", __func__, __LINE__);
4470 RETURN_STATUS(zbc_lex_next(&p->l));
4472 if (p->l.t.t == BC_LEX_SCOLON) {
4473 dbg_lex_done("%s:%d done (seen BC_LEX_SCOLON)", __func__, __LINE__);
4474 RETURN_STATUS(zbc_lex_next(&p->l));
4477 if (p->l.t.t == BC_LEX_LBRACE) {
4478 dbg_lex("%s:%d BC_LEX_LBRACE: (auto_allowed:%d)", __func__, __LINE__, auto_allowed);
4480 s = zbc_lex_next(&p->l);
4481 if (s) RETURN_STATUS(s);
4482 } while (p->l.t.t == BC_LEX_NLINE);
4483 if (auto_allowed && p->l.t.t == BC_LEX_KEY_AUTO) {
4484 dbg_lex("%s:%d calling zbc_parse_auto()", __func__, __LINE__);
4485 s = zbc_parse_auto(p);
4486 if (s) RETURN_STATUS(s);
4488 while (p->l.t.t != BC_LEX_RBRACE) {
4489 dbg_lex("%s:%d block parsing loop", __func__, __LINE__);
4490 s = zbc_parse_stmt(p);
4491 if (s) RETURN_STATUS(s);
4493 s = zbc_lex_next(&p->l);
4494 dbg_lex_done("%s:%d done (seen BC_LEX_RBRACE)", __func__, __LINE__);
4498 dbg_lex("%s:%d p->l.t.t:%d", __func__, __LINE__, p->l.t.t);
4502 case BC_LEX_OP_MINUS:
4503 case BC_LEX_OP_BOOL_NOT:
4507 case BC_LEX_KEY_IBASE:
4508 case BC_LEX_KEY_LAST:
4509 case BC_LEX_KEY_LENGTH:
4510 case BC_LEX_KEY_OBASE:
4511 case BC_LEX_KEY_READ:
4512 case BC_LEX_KEY_SCALE:
4513 case BC_LEX_KEY_SQRT:
4514 s = zbc_parse_expr(p, BC_PARSE_PRINT);
4517 s = zbc_parse_pushSTR(p);
4518 bc_parse_push(p, BC_INST_PRINT_STR);
4520 case BC_LEX_KEY_BREAK:
4521 case BC_LEX_KEY_CONTINUE:
4522 s = zbc_parse_break_or_continue(p, p->l.t.t);
4524 case BC_LEX_KEY_FOR:
4525 s = zbc_parse_for(p);
4527 case BC_LEX_KEY_HALT:
4528 bc_parse_push(p, BC_INST_HALT);
4529 s = zbc_lex_next(&p->l);
4532 s = zbc_parse_if(p);
4534 case BC_LEX_KEY_LIMITS:
4535 // "limits" is a compile-time command,
4536 // the output is produced at _parse time_.
4538 "BC_BASE_MAX = "BC_MAX_OBASE_STR "\n"
4539 "BC_DIM_MAX = "BC_MAX_DIM_STR "\n"
4540 "BC_SCALE_MAX = "BC_MAX_SCALE_STR "\n"
4541 "BC_STRING_MAX = "BC_MAX_STRING_STR"\n"
4542 "BC_NAME_MAX = "BC_MAX_NAME_STR "\n"
4543 "BC_NUM_MAX = "BC_MAX_NUM_STR "\n"
4544 "MAX Exponent = "BC_MAX_EXP_STR "\n"
4545 "Number of vars = "BC_MAX_VARS_STR "\n"
4547 s = zbc_lex_next(&p->l);
4549 case BC_LEX_KEY_PRINT:
4550 s = zbc_parse_print(p);
4552 case BC_LEX_KEY_QUIT:
4553 // "quit" is a compile-time command. For example,
4554 // "if (0 == 1) quit" terminates when parsing the statement,
4555 // not when it is executed
4556 QUIT_OR_RETURN_TO_MAIN;
4557 case BC_LEX_KEY_RETURN:
4559 RETURN_STATUS(bc_error("'return' not in a function"));
4560 s = zbc_parse_return(p);
4562 case BC_LEX_KEY_WHILE:
4563 s = zbc_parse_while(p);
4566 s = bc_error_bad_token();
4570 dbg_lex_done("%s:%d done", __func__, __LINE__);
4573 #define zbc_parse_stmt_possibly_auto(...) (zbc_parse_stmt_possibly_auto(__VA_ARGS__) COMMA_SUCCESS)
4575 static BC_STATUS zbc_parse_stmt_or_funcdef(BcParse *p)
4579 dbg_lex_enter("%s:%d entered", __func__, __LINE__);
4580 if (p->l.t.t == BC_LEX_EOF)
4581 s = bc_error("end of file");
4582 else if (p->l.t.t == BC_LEX_KEY_DEFINE) {
4583 dbg_lex("%s:%d p->l.t.t:BC_LEX_KEY_DEFINE", __func__, __LINE__);
4584 s = zbc_parse_funcdef(p);
4586 dbg_lex("%s:%d p->l.t.t:%d (not BC_LEX_KEY_DEFINE)", __func__, __LINE__, p->l.t.t);
4587 s = zbc_parse_stmt(p);
4590 dbg_lex_done("%s:%d done", __func__, __LINE__);
4593 #define zbc_parse_stmt_or_funcdef(...) (zbc_parse_stmt_or_funcdef(__VA_ARGS__) COMMA_SUCCESS)
4595 // This is not a "z" function: can also return BC_STATUS_PARSE_EMPTY_EXP
4596 static BcStatus bc_parse_expr_empty_ok(BcParse *p, uint8_t flags)
4598 BcStatus s = BC_STATUS_SUCCESS;
4599 BcInst prev = BC_INST_PRINT;
4600 BcLexType top, t = p->l.t.t;
4601 size_t nexprs = 0, ops_bgn = p->ops.len;
4602 unsigned nparens, nrelops;
4603 bool paren_first, paren_expr, rprn, done, get_token, assign, bin_last;
4605 dbg_lex_enter("%s:%d entered", __func__, __LINE__);
4606 paren_first = p->l.t.t == BC_LEX_LPAREN;
4607 nparens = nrelops = 0;
4608 paren_expr = rprn = done = get_token = assign = false;
4611 for (; !G_interrupt && !s && !done && bc_parse_exprs(t); t = p->l.t.t) {
4612 dbg_lex("%s:%d t:%d", __func__, __LINE__, t);
4616 s = zbc_parse_incdec(p, &prev, &paren_expr, &nexprs, flags);
4617 rprn = get_token = bin_last = false;
4619 case BC_LEX_OP_MINUS:
4620 s = zbc_parse_minus(p, &prev, ops_bgn, rprn, &nexprs);
4621 rprn = get_token = false;
4622 bin_last = prev == BC_INST_MINUS;
4624 case BC_LEX_OP_ASSIGN_POWER:
4625 case BC_LEX_OP_ASSIGN_MULTIPLY:
4626 case BC_LEX_OP_ASSIGN_DIVIDE:
4627 case BC_LEX_OP_ASSIGN_MODULUS:
4628 case BC_LEX_OP_ASSIGN_PLUS:
4629 case BC_LEX_OP_ASSIGN_MINUS:
4630 case BC_LEX_OP_ASSIGN:
4631 if (prev != BC_INST_VAR && prev != BC_INST_ARRAY_ELEM
4632 && prev != BC_INST_SCALE && prev != BC_INST_IBASE
4633 && prev != BC_INST_OBASE && prev != BC_INST_LAST
4635 s = bc_error("bad assignment:"
4636 " left side must be variable"
4638 ); // note: shared string
4642 case BC_LEX_OP_POWER:
4643 case BC_LEX_OP_MULTIPLY:
4644 case BC_LEX_OP_DIVIDE:
4645 case BC_LEX_OP_MODULUS:
4646 case BC_LEX_OP_PLUS:
4647 case BC_LEX_OP_REL_EQ:
4648 case BC_LEX_OP_REL_LE:
4649 case BC_LEX_OP_REL_GE:
4650 case BC_LEX_OP_REL_NE:
4651 case BC_LEX_OP_REL_LT:
4652 case BC_LEX_OP_REL_GT:
4653 case BC_LEX_OP_BOOL_NOT:
4654 case BC_LEX_OP_BOOL_OR:
4655 case BC_LEX_OP_BOOL_AND:
4656 if (((t == BC_LEX_OP_BOOL_NOT) != bin_last)
4657 || (t != BC_LEX_OP_BOOL_NOT && prev == BC_INST_BOOL_NOT)
4659 return bc_error_bad_expression();
4661 nrelops += t >= BC_LEX_OP_REL_EQ && t <= BC_LEX_OP_REL_GT;
4662 prev = BC_TOKEN_2_INST(t);
4663 bc_parse_operator(p, t, ops_bgn, &nexprs);
4664 s = zbc_lex_next(&p->l);
4665 rprn = get_token = false;
4666 bin_last = t != BC_LEX_OP_BOOL_NOT;
4669 if (BC_PARSE_LEAF(prev, rprn))
4670 return bc_error_bad_expression();
4672 paren_expr = rprn = bin_last = false;
4674 bc_vec_push(&p->ops, &t);
4677 if (bin_last || prev == BC_INST_BOOL_NOT)
4678 return bc_error_bad_expression();
4680 s = BC_STATUS_SUCCESS;
4686 dbg_lex_done("%s:%d done (returning EMPTY_EXP)", __func__, __LINE__);
4687 return BC_STATUS_PARSE_EMPTY_EXP;
4690 paren_expr = rprn = true;
4691 get_token = bin_last = false;
4692 s = zbc_parse_rightParen(p, ops_bgn, &nexprs);
4695 if (BC_PARSE_LEAF(prev, rprn))
4696 return bc_error_bad_expression();
4698 rprn = get_token = bin_last = false;
4699 s = zbc_parse_name(p, &prev, flags & ~BC_PARSE_NOCALL);
4703 if (BC_PARSE_LEAF(prev, rprn))
4704 return bc_error_bad_expression();
4705 bc_parse_pushNUM(p);
4708 paren_expr = get_token = true;
4709 rprn = bin_last = false;
4711 case BC_LEX_KEY_IBASE:
4712 case BC_LEX_KEY_LAST:
4713 case BC_LEX_KEY_OBASE:
4714 if (BC_PARSE_LEAF(prev, rprn))
4715 return bc_error_bad_expression();
4716 prev = (char) (t - BC_LEX_KEY_IBASE + BC_INST_IBASE);
4717 bc_parse_push(p, (char) prev);
4718 paren_expr = get_token = true;
4719 rprn = bin_last = false;
4722 case BC_LEX_KEY_LENGTH:
4723 case BC_LEX_KEY_SQRT:
4724 if (BC_PARSE_LEAF(prev, rprn))
4725 return bc_error_bad_expression();
4726 s = zbc_parse_builtin(p, t, flags, &prev);
4728 rprn = get_token = bin_last = false;
4731 case BC_LEX_KEY_READ:
4732 if (BC_PARSE_LEAF(prev, rprn))
4733 return bc_error_bad_expression();
4735 s = zbc_parse_read(p);
4737 rprn = get_token = bin_last = false;
4739 prev = BC_INST_READ;
4741 case BC_LEX_KEY_SCALE:
4742 if (BC_PARSE_LEAF(prev, rprn))
4743 return bc_error_bad_expression();
4744 s = zbc_parse_scale(p, &prev, flags);
4746 rprn = get_token = bin_last = false;
4748 prev = BC_INST_SCALE;
4751 s = bc_error_bad_token();
4755 if (!s && get_token) s = zbc_lex_next(&p->l);
4759 if (G_interrupt) return BC_STATUS_FAILURE; // ^C: stop parsing
4761 while (p->ops.len > ops_bgn) {
4762 top = BC_PARSE_TOP_OP(p);
4763 assign = top >= BC_LEX_OP_ASSIGN_POWER && top <= BC_LEX_OP_ASSIGN;
4765 if (top == BC_LEX_LPAREN || top == BC_LEX_RPAREN)
4766 return bc_error_bad_expression();
4768 bc_parse_push(p, BC_TOKEN_2_INST(top));
4770 nexprs -= top != BC_LEX_OP_BOOL_NOT && top != BC_LEX_NEG;
4771 bc_vec_pop(&p->ops);
4774 if (prev == BC_INST_BOOL_NOT || nexprs != 1)
4775 return bc_error_bad_expression();
4777 if (!(flags & BC_PARSE_REL) && nrelops) {
4778 s = bc_POSIX_does_not_allow("comparison operators outside if or loops");
4779 IF_ERROR_RETURN_POSSIBLE(if (s) return s);
4780 } else if ((flags & BC_PARSE_REL) && nrelops > 1) {
4781 s = bc_POSIX_requires("exactly one comparison operator per condition");
4782 IF_ERROR_RETURN_POSSIBLE(if (s) return s);
4785 if (flags & BC_PARSE_PRINT) {
4786 if (paren_first || !assign) bc_parse_push(p, BC_INST_PRINT);
4787 bc_parse_push(p, BC_INST_POP);
4790 dbg_lex_done("%s:%d done", __func__, __LINE__);
4798 static BC_STATUS zdc_parse_register(BcParse *p)
4802 s = zbc_lex_next(&p->l);
4803 if (s) RETURN_STATUS(s);
4804 if (p->l.t.t != BC_LEX_NAME) RETURN_STATUS(bc_error_bad_token());
4806 bc_parse_pushName(p, p->l.t.v.v);
4810 #define zdc_parse_register(...) (zdc_parse_register(__VA_ARGS__) COMMA_SUCCESS)
4812 static BC_STATUS zdc_parse_string(BcParse *p)
4815 size_t len = G.prog.strs.len;
4817 dbg_lex_enter("%s:%d entered", __func__, __LINE__);
4819 str = xstrdup(p->l.t.v.v);
4820 bc_parse_push(p, BC_INST_STR);
4821 bc_parse_pushIndex(p, len);
4822 bc_vec_push(&G.prog.strs, &str);
4824 // Explanation needed here
4825 bc_program_add_fn();
4826 p->func = bc_program_func(p->fidx);
4828 dbg_lex_done("%s:%d done", __func__, __LINE__);
4830 RETURN_STATUS(zbc_lex_next(&p->l));
4832 #define zdc_parse_string(...) (zdc_parse_string(__VA_ARGS__) COMMA_SUCCESS)
4834 static BC_STATUS zdc_parse_mem(BcParse *p, uint8_t inst, bool name, bool store)
4838 bc_parse_push(p, inst);
4840 s = zdc_parse_register(p);
4841 if (s) RETURN_STATUS(s);
4845 bc_parse_push(p, BC_INST_SWAP);
4846 bc_parse_push(p, BC_INST_ASSIGN);
4847 bc_parse_push(p, BC_INST_POP);
4850 RETURN_STATUS(zbc_lex_next(&p->l));
4852 #define zdc_parse_mem(...) (zdc_parse_mem(__VA_ARGS__) COMMA_SUCCESS)
4854 static BC_STATUS zdc_parse_cond(BcParse *p, uint8_t inst)
4858 bc_parse_push(p, inst);
4859 bc_parse_push(p, BC_INST_EXEC_COND);
4861 s = zdc_parse_register(p);
4862 if (s) RETURN_STATUS(s);
4864 s = zbc_lex_next(&p->l);
4865 if (s) RETURN_STATUS(s);
4867 if (p->l.t.t == BC_LEX_ELSE) {
4868 s = zdc_parse_register(p);
4869 if (s) RETURN_STATUS(s);
4870 s = zbc_lex_next(&p->l);
4872 bc_parse_push(p, BC_PARSE_STREND);
4876 #define zdc_parse_cond(...) (zdc_parse_cond(__VA_ARGS__) COMMA_SUCCESS)
4878 static BC_STATUS zdc_parse_token(BcParse *p, BcLexType t)
4880 BcStatus s = BC_STATUS_SUCCESS;
4882 bool assign, get_token = false;
4884 dbg_lex_enter("%s:%d entered", __func__, __LINE__);
4886 case BC_LEX_OP_REL_EQ:
4887 case BC_LEX_OP_REL_LE:
4888 case BC_LEX_OP_REL_GE:
4889 case BC_LEX_OP_REL_NE:
4890 case BC_LEX_OP_REL_LT:
4891 case BC_LEX_OP_REL_GT:
4892 s = zdc_parse_cond(p, t - BC_LEX_OP_REL_EQ + BC_INST_REL_EQ);
4896 s = zdc_parse_mem(p, BC_INST_ARRAY_ELEM, true, t == BC_LEX_COLON);
4899 dbg_lex("%s:%d LEX_STR", __func__, __LINE__);
4900 s = zdc_parse_string(p);
4904 dbg_lex("%s:%d LEX_NEG/NUMBER", __func__, __LINE__);
4905 if (t == BC_LEX_NEG) {
4906 s = zbc_lex_next(&p->l);
4907 if (s) RETURN_STATUS(s);
4908 if (p->l.t.t != BC_LEX_NUMBER)
4909 RETURN_STATUS(bc_error_bad_token());
4911 bc_parse_pushNUM(p);
4912 if (t == BC_LEX_NEG) bc_parse_push(p, BC_INST_NEG);
4915 case BC_LEX_KEY_READ:
4916 bc_parse_push(p, BC_INST_READ);
4919 case BC_LEX_OP_ASSIGN:
4920 case BC_LEX_STORE_PUSH:
4921 assign = t == BC_LEX_OP_ASSIGN;
4922 inst = assign ? BC_INST_VAR : BC_INST_PUSH_TO_VAR;
4923 s = zdc_parse_mem(p, inst, true, assign);
4926 case BC_LEX_LOAD_POP:
4927 inst = t == BC_LEX_LOAD_POP ? BC_INST_PUSH_VAR : BC_INST_LOAD;
4928 s = zdc_parse_mem(p, inst, true, false);
4930 case BC_LEX_STORE_IBASE:
4931 case BC_LEX_STORE_SCALE:
4932 case BC_LEX_STORE_OBASE:
4933 inst = t - BC_LEX_STORE_IBASE + BC_INST_IBASE;
4934 s = zdc_parse_mem(p, inst, false, true);
4937 s = bc_error_bad_token();
4942 if (!s && get_token) s = zbc_lex_next(&p->l);
4944 dbg_lex_done("%s:%d done", __func__, __LINE__);
4947 #define zdc_parse_token(...) (zdc_parse_token(__VA_ARGS__) COMMA_SUCCESS)
4949 static BC_STATUS zdc_parse_expr(BcParse *p)
4953 dbg_lex_enter("%s:%d entered, p->l.t.t:%d", __func__, __LINE__, p->l.t.t);
4959 dbg_lex("%s:%d p->l.t.t:%d", __func__, __LINE__, p->l.t.t);
4960 if (t == BC_LEX_EOF) break;
4962 inst = dc_parse_insts[t];
4963 if (inst != BC_INST_INVALID) {
4964 dbg_lex("%s:%d", __func__, __LINE__);
4965 bc_parse_push(p, inst);
4966 s = zbc_lex_next(&p->l);
4968 dbg_lex("%s:%d", __func__, __LINE__);
4969 s = zdc_parse_token(p, t);
4971 if (s) RETURN_STATUS(s);
4974 dbg_lex_done("%s:%d done", __func__, __LINE__);
4975 RETURN_STATUS(BC_STATUS_SUCCESS);
4977 #define zdc_parse_expr(...) (zdc_parse_expr(__VA_ARGS__) COMMA_SUCCESS)
4981 static BcVec* bc_program_search(char *id, bool var)
4988 v = var ? &G.prog.vars : &G.prog.arrs;
4989 map = var ? &G.prog.var_map : &G.prog.arr_map;
4993 new = bc_map_insert(map, &e, &i); // 1 if insertion was successful
4997 bc_array_init(&v2, var);
4998 bc_vec_push(v, &v2);
5001 ptr = bc_vec_item(map, i);
5002 if (new) ptr->name = xstrdup(e.name);
5003 return bc_vec_item(v, ptr->idx);
5006 // 'num' need not be initialized on entry
5007 static BC_STATUS zbc_program_num(BcResult *r, BcNum **num, bool hex)
5011 case BC_RESULT_TEMP:
5012 case BC_RESULT_IBASE:
5013 case BC_RESULT_SCALE:
5014 case BC_RESULT_OBASE:
5017 case BC_RESULT_CONSTANT: {
5023 str = *bc_program_const(r->d.id.idx);
5026 bc_num_init(&r->d.n, len);
5028 hex = hex && len == 1;
5029 base_t = hex ? 16 : G.prog.ib_t;
5030 s = zbc_num_parse(&r->d.n, str, base_t);
5032 bc_num_free(&r->d.n);
5036 r->t = BC_RESULT_TEMP;
5040 case BC_RESULT_ARRAY:
5041 case BC_RESULT_ARRAY_ELEM: {
5044 v = bc_program_search(r->d.id.name, r->t == BC_RESULT_VAR);
5046 if (r->t == BC_RESULT_ARRAY_ELEM) {
5048 if (v->len <= r->d.id.idx) bc_array_expand(v, r->d.id.idx + 1);
5049 *num = bc_vec_item(v, r->d.id.idx);
5051 *num = bc_vec_top(v);
5055 case BC_RESULT_LAST:
5056 *num = &G.prog.last;
5063 // Testing the theory that dc does not reach LAST/ONE
5064 bb_error_msg_and_die("BUG:%d", r->t);
5067 RETURN_STATUS(BC_STATUS_SUCCESS);
5069 #define zbc_program_num(...) (zbc_program_num(__VA_ARGS__) COMMA_SUCCESS)
5071 static BC_STATUS zbc_program_binOpPrep(BcResult **l, BcNum **ln,
5072 BcResult **r, BcNum **rn, bool assign)
5076 BcResultType lt, rt;
5078 if (!STACK_HAS_MORE_THAN(&G.prog.results, 1))
5079 RETURN_STATUS(bc_error_stack_has_too_few_elements());
5081 *r = bc_vec_item_rev(&G.prog.results, 0);
5082 *l = bc_vec_item_rev(&G.prog.results, 1);
5086 hex = assign && (lt == BC_RESULT_IBASE || lt == BC_RESULT_OBASE);
5088 s = zbc_program_num(*l, ln, false);
5089 if (s) RETURN_STATUS(s);
5090 s = zbc_program_num(*r, rn, hex);
5091 if (s) RETURN_STATUS(s);
5093 // We run this again under these conditions in case any vector has been
5094 // reallocated out from under the BcNums or arrays we had.
5095 if (lt == rt && (lt == BC_RESULT_VAR || lt == BC_RESULT_ARRAY_ELEM)) {
5096 s = zbc_program_num(*l, ln, false);
5097 if (s) RETURN_STATUS(s);
5100 if (!BC_PROG_NUM((*l), (*ln)) && (!assign || (*l)->t != BC_RESULT_VAR))
5101 RETURN_STATUS(bc_error_variable_is_wrong_type());
5102 if (!assign && !BC_PROG_NUM((*r), (*ln)))
5103 RETURN_STATUS(bc_error_variable_is_wrong_type());
5107 #define zbc_program_binOpPrep(...) (zbc_program_binOpPrep(__VA_ARGS__) COMMA_SUCCESS)
5109 static void bc_program_binOpRetire(BcResult *r)
5111 r->t = BC_RESULT_TEMP;
5112 bc_vec_pop(&G.prog.results);
5113 bc_result_pop_and_push(r);
5116 static BC_STATUS zbc_program_prep(BcResult **r, BcNum **n)
5120 if (!STACK_HAS_MORE_THAN(&G.prog.results, 0))
5121 RETURN_STATUS(bc_error_stack_has_too_few_elements());
5122 *r = bc_vec_top(&G.prog.results);
5124 s = zbc_program_num(*r, n, false);
5125 if (s) RETURN_STATUS(s);
5127 if (!BC_PROG_NUM((*r), (*n)))
5128 RETURN_STATUS(bc_error_variable_is_wrong_type());
5132 #define zbc_program_prep(...) (zbc_program_prep(__VA_ARGS__) COMMA_SUCCESS)
5134 static void bc_program_retire(BcResult *r, BcResultType t)
5137 bc_result_pop_and_push(r);
5140 static BC_STATUS zbc_program_op(char inst)
5143 BcResult *opd1, *opd2, res;
5144 BcNum *n1, *n2 = NULL;
5146 s = zbc_program_binOpPrep(&opd1, &n1, &opd2, &n2, false);
5147 if (s) RETURN_STATUS(s);
5148 bc_num_init_DEF_SIZE(&res.d.n);
5150 s = BC_STATUS_SUCCESS;
5151 IF_ERROR_RETURN_POSSIBLE(s =) zbc_program_ops[inst - BC_INST_POWER](n1, n2, &res.d.n, G.prog.scale);
5153 bc_program_binOpRetire(&res);
5157 bc_num_free(&res.d.n);
5160 #define zbc_program_op(...) (zbc_program_op(__VA_ARGS__) COMMA_SUCCESS)
5162 static BC_STATUS zbc_program_read(void)
5164 const char *sv_file;
5171 f = bc_program_func(BC_PROG_READ);
5172 bc_vec_pop_all(&f->code);
5174 sv_file = G.prog.file;
5177 bc_char_vec_init(&buf);
5178 bc_read_line(&buf, stdin);
5180 bc_parse_create(&parse, BC_PROG_READ);
5181 bc_lex_file(&parse.l);
5183 s = zbc_parse_text_init(&parse, buf.v);
5184 if (s) goto exec_err;
5186 IF_BC(s = zbc_parse_expr(&parse, 0));
5188 IF_DC(s = zdc_parse_expr(&parse));
5190 if (s) goto exec_err;
5192 if (parse.l.t.t != BC_LEX_NLINE && parse.l.t.t != BC_LEX_EOF) {
5193 s = bc_error("bad read() expression");
5197 ip.func = BC_PROG_READ;
5199 IF_BC(ip.results_len_before_call = G.prog.results.len;)
5201 bc_parse_push(&parse, BC_INST_RET);
5202 bc_vec_push(&G.prog.exestack, &ip);
5204 bc_parse_free(&parse);
5205 G.prog.file = sv_file;
5209 #define zbc_program_read(...) (zbc_program_read(__VA_ARGS__) COMMA_SUCCESS)
5211 static size_t bc_program_index(char *code, size_t *bgn)
5213 unsigned char *bytes = (void*)(code + *bgn);
5223 for (i = 0; i < amt; i += 8)
5224 res |= (size_t)(*bytes++) << i;
5229 static char *bc_program_name(char *code, size_t *bgn)
5235 s = xmalloc(strchr(code, BC_PARSE_STREND) - code + 1);
5239 if (c == BC_PARSE_STREND)
5249 static void bc_program_printString(const char *str)
5253 // Example: echo '[]ap' | dc
5254 // should print two bytes: 0x00, 0x0A
5261 if (c != '\\' || !*str)
5281 G.prog.nchars = SIZE_MAX;
5293 // Just print the backslash and following character.
5304 static void bc_num_printNewline(void)
5306 if (G.prog.nchars == G.prog.len - 1) {
5314 static FAST_FUNC void dc_num_printChar(size_t num, size_t width, bool radix)
5317 bb_putchar((char) num);
5318 G.prog.nchars += width;
5322 static FAST_FUNC void bc_num_printDigits(size_t num, size_t width, bool radix)
5326 bc_num_printNewline();
5327 bb_putchar(radix ? '.' : ' ');
5330 bc_num_printNewline();
5331 for (exp = 0, pow = 1; exp < width - 1; ++exp, pow *= 10)
5334 for (exp = 0; exp < width; pow /= 10, ++G.prog.nchars, ++exp) {
5336 bc_num_printNewline();
5339 bb_putchar(((char) dig) + '0');
5343 static FAST_FUNC void bc_num_printHex(size_t num, size_t width, bool radix)
5346 bc_num_printNewline();
5351 bc_num_printNewline();
5352 bb_putchar(bb_hexdigits_upcase[num]);
5353 G.prog.nchars += width;
5356 static void bc_num_printDecimal(BcNum *n)
5358 size_t i, rdx = n->rdx - 1;
5365 for (i = n->len - 1; i < n->len; --i)
5366 bc_num_printHex((size_t) n->num[i], 1, i == rdx);
5369 static BC_STATUS zbc_num_printNum(BcNum *n, unsigned base_t, size_t width, BcNumDigitOp print)
5374 BcDig base_digs[ULONG_NUM_BUFSIZE];
5375 BcNum intp, fracp, digit, frac_len;
5376 unsigned long dig, *ptr;
5381 print(0, width, false);
5382 RETURN_STATUS(BC_STATUS_SUCCESS);
5385 bc_vec_init(&stack, sizeof(long), NULL);
5386 bc_num_init(&intp, n->len);
5387 bc_num_init(&fracp, n->rdx);
5388 bc_num_init(&digit, width);
5389 bc_num_init(&frac_len, BC_NUM_INT(n));
5390 bc_num_copy(&intp, n);
5391 bc_num_one(&frac_len);
5392 base.cap = ARRAY_SIZE(base_digs);
5393 base.num = base_digs;
5394 bc_num_ulong2num(&base, base_t);
5396 bc_num_truncate(&intp, intp.rdx);
5397 s = zbc_num_sub(n, &intp, &fracp, 0);
5400 while (intp.len != 0) {
5401 s = zbc_num_divmod(&intp, &base, &intp, &digit, 0);
5403 s = zbc_num_ulong(&digit, &dig);
5405 bc_vec_push(&stack, &dig);
5408 for (i = 0; i < stack.len; ++i) {
5409 ptr = bc_vec_item_rev(&stack, i);
5410 print(*ptr, width, false);
5413 if (!n->rdx) goto err;
5415 for (radix = true; frac_len.len <= n->rdx; radix = false) {
5416 s = zbc_num_mul(&fracp, &base, &fracp, n->rdx);
5418 s = zbc_num_ulong(&fracp, &dig);
5420 bc_num_ulong2num(&intp, dig);
5421 s = zbc_num_sub(&fracp, &intp, &fracp, 0);
5423 print(dig, width, radix);
5424 s = zbc_num_mul(&frac_len, &base, &frac_len, 0);
5428 bc_num_free(&frac_len);
5429 bc_num_free(&digit);
5430 bc_num_free(&fracp);
5432 bc_vec_free(&stack);
5435 #define zbc_num_printNum(...) (zbc_num_printNum(__VA_ARGS__) COMMA_SUCCESS)
5437 static BC_STATUS zbc_num_printBase(BcNum *n)
5451 if (G.prog.ob_t <= BC_NUM_MAX_IBASE) {
5453 print = bc_num_printHex;
5455 unsigned i = G.prog.ob_t - 1;
5463 print = bc_num_printDigits;
5466 s = zbc_num_printNum(n, G.prog.ob_t, width, print);
5471 #define zbc_num_printBase(...) (zbc_num_printBase(__VA_ARGS__) COMMA_SUCCESS)
5473 static BC_STATUS zbc_num_print(BcNum *n, bool newline)
5475 BcStatus s = BC_STATUS_SUCCESS;
5477 bc_num_printNewline();
5482 } else if (G.prog.ob_t == 10)
5483 bc_num_printDecimal(n);
5485 s = zbc_num_printBase(n);
5494 #define zbc_num_print(...) (zbc_num_print(__VA_ARGS__) COMMA_SUCCESS)
5496 static BC_STATUS zbc_program_print(char inst, size_t idx)
5501 bool pop = inst != BC_INST_PRINT;
5503 if (!STACK_HAS_MORE_THAN(&G.prog.results, idx))
5504 RETURN_STATUS(bc_error_stack_has_too_few_elements());
5506 r = bc_vec_item_rev(&G.prog.results, idx);
5507 s = zbc_program_num(r, &num, false);
5508 if (s) RETURN_STATUS(s);
5510 if (BC_PROG_NUM(r, num)) {
5511 s = zbc_num_print(num, !pop);
5513 if (!s && IS_BC) bc_num_copy(&G.prog.last, num);
5518 idx = (r->t == BC_RESULT_STR) ? r->d.id.idx : num->rdx;
5519 str = *bc_program_str(idx);
5521 if (inst == BC_INST_PRINT_STR) {
5524 if (c == '\0') break;
5527 if (c == '\n') G.prog.nchars = 0;
5530 bc_program_printString(str);
5531 if (inst == BC_INST_PRINT) bb_putchar('\n');
5535 if (!s && pop) bc_vec_pop(&G.prog.results);
5539 #define zbc_program_print(...) (zbc_program_print(__VA_ARGS__) COMMA_SUCCESS)
5541 static BC_STATUS zbc_program_negate(void)
5547 s = zbc_program_prep(&ptr, &num);
5548 if (s) RETURN_STATUS(s);
5550 bc_num_init(&res.d.n, num->len);
5551 bc_num_copy(&res.d.n, num);
5552 if (res.d.n.len) res.d.n.neg = !res.d.n.neg;
5554 bc_program_retire(&res, BC_RESULT_TEMP);
5558 #define zbc_program_negate(...) (zbc_program_negate(__VA_ARGS__) COMMA_SUCCESS)
5560 static BC_STATUS zbc_program_logical(char inst)
5563 BcResult *opd1, *opd2, res;
5567 s = zbc_program_binOpPrep(&opd1, &n1, &opd2, &n2, false);
5568 if (s) RETURN_STATUS(s);
5570 bc_num_init_DEF_SIZE(&res.d.n);
5572 if (inst == BC_INST_BOOL_AND)
5573 cond = bc_num_cmp(n1, &G.prog.zero) && bc_num_cmp(n2, &G.prog.zero);
5574 else if (inst == BC_INST_BOOL_OR)
5575 cond = bc_num_cmp(n1, &G.prog.zero) || bc_num_cmp(n2, &G.prog.zero);
5577 cond = bc_num_cmp(n1, n2);
5579 case BC_INST_REL_EQ:
5582 case BC_INST_REL_LE:
5585 case BC_INST_REL_GE:
5588 case BC_INST_REL_LT:
5591 case BC_INST_REL_GT:
5594 default: // = case BC_INST_REL_NE:
5595 //cond = (cond != 0); - not needed
5600 if (cond) bc_num_one(&res.d.n);
5601 //else bc_num_zero(&res.d.n); - already is
5603 bc_program_binOpRetire(&res);
5607 #define zbc_program_logical(...) (zbc_program_logical(__VA_ARGS__) COMMA_SUCCESS)
5610 static BC_STATUS zdc_program_assignStr(BcResult *r, BcVec *v, bool push)
5615 memset(&n2, 0, sizeof(BcNum));
5616 n2.rdx = res.d.id.idx = r->d.id.idx;
5617 res.t = BC_RESULT_STR;
5620 if (!STACK_HAS_MORE_THAN(&G.prog.results, 1))
5621 RETURN_STATUS(bc_error_stack_has_too_few_elements());
5623 bc_vec_pop(&G.prog.results);
5626 bc_result_pop_and_push(&res);
5627 bc_vec_push(v, &n2);
5629 RETURN_STATUS(BC_STATUS_SUCCESS);
5631 #define zdc_program_assignStr(...) (zdc_program_assignStr(__VA_ARGS__) COMMA_SUCCESS)
5634 static BC_STATUS zbc_program_copyToVar(char *name, bool var)
5641 if (!STACK_HAS_MORE_THAN(&G.prog.results, 0))
5642 RETURN_STATUS(bc_error_stack_has_too_few_elements());
5644 ptr = bc_vec_top(&G.prog.results);
5645 if ((ptr->t == BC_RESULT_ARRAY) != !var)
5646 RETURN_STATUS(bc_error_variable_is_wrong_type());
5647 v = bc_program_search(name, var);
5650 if (ptr->t == BC_RESULT_STR && !var)
5651 RETURN_STATUS(bc_error_variable_is_wrong_type());
5652 if (ptr->t == BC_RESULT_STR)
5653 RETURN_STATUS(zdc_program_assignStr(ptr, v, true));
5656 s = zbc_program_num(ptr, &n, false);
5657 if (s) RETURN_STATUS(s);
5659 // Do this once more to make sure that pointers were not invalidated.
5660 v = bc_program_search(name, var);
5663 bc_num_init_DEF_SIZE(&r.d.n);
5664 bc_num_copy(&r.d.n, n);
5666 bc_array_init(&r.d.v, true);
5667 bc_array_copy(&r.d.v, (BcVec *) n);
5670 bc_vec_push(v, &r.d);
5671 bc_vec_pop(&G.prog.results);
5675 #define zbc_program_copyToVar(...) (zbc_program_copyToVar(__VA_ARGS__) COMMA_SUCCESS)
5677 static BC_STATUS zbc_program_assign(char inst)
5680 BcResult *left, *right, res;
5681 BcNum *l = NULL, *r = NULL;
5682 bool assign = inst == BC_INST_ASSIGN, ib, sc;
5684 s = zbc_program_binOpPrep(&left, &l, &right, &r, assign);
5685 if (s) RETURN_STATUS(s);
5687 ib = left->t == BC_RESULT_IBASE;
5688 sc = left->t == BC_RESULT_SCALE;
5691 if (right->t == BC_RESULT_STR) {
5694 if (left->t != BC_RESULT_VAR)
5695 RETURN_STATUS(bc_error_variable_is_wrong_type());
5696 v = bc_program_search(left->d.id.name, true);
5698 RETURN_STATUS(zdc_program_assignStr(right, v, false));
5702 if (left->t == BC_RESULT_CONSTANT || left->t == BC_RESULT_TEMP)
5703 RETURN_STATUS(bc_error("bad assignment:"
5704 " left side must be variable"
5706 )); // note: shared string
5709 if (inst == BC_INST_ASSIGN_DIVIDE && !bc_num_cmp(r, &G.prog.zero))
5710 RETURN_STATUS(bc_error("divide by zero"));
5715 s = BC_STATUS_SUCCESS;
5716 IF_ERROR_RETURN_POSSIBLE(s =) zbc_program_ops[inst - BC_INST_ASSIGN_POWER](l, r, l, G.prog.scale);
5718 if (s) RETURN_STATUS(s);
5723 if (ib || sc || left->t == BC_RESULT_OBASE) {
5724 static const char *const msg[] = {
5725 "bad ibase; must be [2,16]", //BC_RESULT_IBASE
5726 "bad scale; must be [0,"BC_MAX_SCALE_STR"]", //BC_RESULT_SCALE
5727 NULL, //can't happen //BC_RESULT_LAST
5728 NULL, //can't happen //BC_RESULT_CONSTANT
5729 NULL, //can't happen //BC_RESULT_ONE
5730 "bad obase; must be [2,"BC_MAX_OBASE_STR"]", //BC_RESULT_OBASE
5736 s = zbc_num_ulong(l, &val);
5737 if (s) RETURN_STATUS(s);
5738 s = left->t - BC_RESULT_IBASE;
5741 ptr = &G.prog.scale;
5744 RETURN_STATUS(bc_error(msg[s]));
5745 max = ib ? BC_NUM_MAX_IBASE : BC_MAX_OBASE;
5746 ptr = ib ? &G.prog.ib_t : &G.prog.ob_t;
5750 RETURN_STATUS(bc_error(msg[s]));
5752 *ptr = (size_t) val;
5753 s = BC_STATUS_SUCCESS;
5756 bc_num_init(&res.d.n, l->len);
5757 bc_num_copy(&res.d.n, l);
5758 bc_program_binOpRetire(&res);
5762 #define zbc_program_assign(...) (zbc_program_assign(__VA_ARGS__) COMMA_SUCCESS)
5765 #define bc_program_pushVar(code, bgn, pop, copy) \
5766 bc_program_pushVar(code, bgn)
5767 // for bc, 'pop' and 'copy' are always false
5769 static BC_STATUS bc_program_pushVar(char *code, size_t *bgn,
5770 bool pop, bool copy)
5773 char *name = bc_program_name(code, bgn);
5775 r.t = BC_RESULT_VAR;
5780 BcVec *v = bc_program_search(name, true);
5781 BcNum *num = bc_vec_top(v);
5784 if (!STACK_HAS_MORE_THAN(v, 1 - copy)) {
5785 RETURN_STATUS(bc_error_stack_has_too_few_elements());
5788 if (!BC_PROG_STR(num)) {
5789 r.t = BC_RESULT_TEMP;
5790 bc_num_init_DEF_SIZE(&r.d.n);
5791 bc_num_copy(&r.d.n, num);
5793 r.t = BC_RESULT_STR;
5794 r.d.id.idx = num->rdx;
5797 if (!copy) bc_vec_pop(v);
5801 bc_vec_push(&G.prog.results, &r);
5803 RETURN_STATUS(BC_STATUS_SUCCESS);
5805 #define zbc_program_pushVar(...) (bc_program_pushVar(__VA_ARGS__) COMMA_SUCCESS)
5807 static BC_STATUS zbc_program_pushArray(char *code, size_t *bgn, char inst)
5809 BcStatus s = BC_STATUS_SUCCESS;
5813 r.d.id.name = bc_program_name(code, bgn);
5815 if (inst == BC_INST_ARRAY) {
5816 r.t = BC_RESULT_ARRAY;
5817 bc_vec_push(&G.prog.results, &r);
5822 s = zbc_program_prep(&operand, &num);
5824 s = zbc_num_ulong(num, &temp);
5827 if (temp > BC_MAX_DIM) {
5828 s = bc_error("array too long; must be [1,"BC_MAX_DIM_STR"]");
5832 r.d.id.idx = (size_t) temp;
5833 bc_program_retire(&r, BC_RESULT_ARRAY_ELEM);
5836 if (s) free(r.d.id.name);
5839 #define zbc_program_pushArray(...) (zbc_program_pushArray(__VA_ARGS__) COMMA_SUCCESS)
5842 static BC_STATUS zbc_program_incdec(char inst)
5845 BcResult *ptr, res, copy;
5849 s = zbc_program_prep(&ptr, &num);
5850 if (s) RETURN_STATUS(s);
5852 if (inst == BC_INST_INC_POST || inst == BC_INST_DEC_POST) {
5853 copy.t = BC_RESULT_TEMP;
5854 bc_num_init(©.d.n, num->len);
5855 bc_num_copy(©.d.n, num);
5858 res.t = BC_RESULT_ONE;
5859 inst = inst == BC_INST_INC_PRE || inst == BC_INST_INC_POST ?
5860 BC_INST_ASSIGN_PLUS :
5861 BC_INST_ASSIGN_MINUS;
5863 bc_vec_push(&G.prog.results, &res);
5864 s = zbc_program_assign(inst);
5865 if (s) RETURN_STATUS(s);
5867 if (inst2 == BC_INST_INC_POST || inst2 == BC_INST_DEC_POST) {
5868 bc_result_pop_and_push(©);
5873 #define zbc_program_incdec(...) (zbc_program_incdec(__VA_ARGS__) COMMA_SUCCESS)
5875 static BC_STATUS zbc_program_call(char *code, size_t *idx)
5883 nparams = bc_program_index(code, idx);
5885 ip.func = bc_program_index(code, idx);
5886 func = bc_program_func(ip.func);
5888 if (func->code.len == 0) {
5889 RETURN_STATUS(bc_error("undefined function"));
5891 if (nparams != func->nparams) {
5892 RETURN_STATUS(bc_error_fmt("function has %u parameters, but called with %u", func->nparams, nparams));
5894 ip.results_len_before_call = G.prog.results.len - nparams;
5896 for (i = 0; i < nparams; ++i) {
5899 a = bc_vec_item(&func->autos, nparams - 1 - i);
5900 arg = bc_vec_top(&G.prog.results);
5902 if ((!a->idx) != (arg->t == BC_RESULT_ARRAY) || arg->t == BC_RESULT_STR)
5903 RETURN_STATUS(bc_error_variable_is_wrong_type());
5905 s = zbc_program_copyToVar(a->name, a->idx);
5906 if (s) RETURN_STATUS(s);
5909 a = bc_vec_item(&func->autos, i);
5910 for (; i < func->autos.len; i++, a++) {
5913 v = bc_program_search(a->name, a->idx);
5916 bc_num_init_DEF_SIZE(&n2);
5917 bc_vec_push(v, &n2);
5920 bc_array_init(&v2, true);
5921 bc_vec_push(v, &v2);
5925 bc_vec_push(&G.prog.exestack, &ip);
5927 RETURN_STATUS(BC_STATUS_SUCCESS);
5929 #define zbc_program_call(...) (zbc_program_call(__VA_ARGS__) COMMA_SUCCESS)
5931 static BC_STATUS zbc_program_return(char inst)
5937 BcInstPtr *ip = bc_vec_top(&G.prog.exestack);
5939 if (!STACK_HAS_EQUAL_OR_MORE_THAN(&G.prog.results, ip->results_len_before_call + (inst == BC_INST_RET)))
5940 RETURN_STATUS(bc_error_stack_has_too_few_elements());
5942 f = bc_program_func(ip->func);
5943 res.t = BC_RESULT_TEMP;
5945 if (inst == BC_INST_RET) {
5948 BcResult *operand = bc_vec_top(&G.prog.results);
5950 s = zbc_program_num(operand, &num, false);
5951 if (s) RETURN_STATUS(s);
5952 bc_num_init(&res.d.n, num->len);
5953 bc_num_copy(&res.d.n, num);
5955 bc_num_init_DEF_SIZE(&res.d.n);
5956 //bc_num_zero(&res.d.n); - already is
5959 // We need to pop arguments as well, so this takes that into account.
5960 a = (void*)f->autos.v;
5961 for (i = 0; i < f->autos.len; i++, a++) {
5963 v = bc_program_search(a->name, a->idx);
5967 bc_vec_npop(&G.prog.results, G.prog.results.len - ip->results_len_before_call);
5968 bc_vec_push(&G.prog.results, &res);
5969 bc_vec_pop(&G.prog.exestack);
5971 RETURN_STATUS(BC_STATUS_SUCCESS);
5973 #define zbc_program_return(...) (zbc_program_return(__VA_ARGS__) COMMA_SUCCESS)
5976 static unsigned long bc_program_scale(BcNum *n)
5978 return (unsigned long) n->rdx;
5981 static unsigned long bc_program_len(BcNum *n)
5983 size_t len = n->len;
5985 if (n->rdx != len) return len;
5987 if (len == 0) break;
5989 if (n->num[len] != 0) break;
5994 static BC_STATUS zbc_program_builtin(char inst)
6000 bool len = inst == BC_INST_LENGTH;
6002 if (!STACK_HAS_MORE_THAN(&G.prog.results, 0))
6003 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6004 opnd = bc_vec_top(&G.prog.results);
6006 s = zbc_program_num(opnd, &num, false);
6007 if (s) RETURN_STATUS(s);
6010 if (!BC_PROG_NUM(opnd, num) && !len)
6011 RETURN_STATUS(bc_error_variable_is_wrong_type());
6014 bc_num_init_DEF_SIZE(&res.d.n);
6016 if (inst == BC_INST_SQRT)
6017 s = zbc_num_sqrt(num, &res.d.n, G.prog.scale);
6019 else if (len != 0 && opnd->t == BC_RESULT_ARRAY) {
6020 bc_num_ulong2num(&res.d.n, (unsigned long) ((BcVec *) num)->len);
6024 else if (len != 0 && !BC_PROG_NUM(opnd, num)) {
6026 size_t idx = opnd->t == BC_RESULT_STR ? opnd->d.id.idx : num->rdx;
6028 str = bc_program_str(idx);
6029 bc_num_ulong2num(&res.d.n, strlen(*str));
6033 bc_num_ulong2num(&res.d.n, len ? bc_program_len(num) : bc_program_scale(num));
6036 bc_program_retire(&res, BC_RESULT_TEMP);
6040 #define zbc_program_builtin(...) (zbc_program_builtin(__VA_ARGS__) COMMA_SUCCESS)
6043 static BC_STATUS zdc_program_divmod(void)
6046 BcResult *opd1, *opd2, res, res2;
6047 BcNum *n1, *n2 = NULL;
6049 s = zbc_program_binOpPrep(&opd1, &n1, &opd2, &n2, false);
6050 if (s) RETURN_STATUS(s);
6052 bc_num_init_DEF_SIZE(&res.d.n);
6053 bc_num_init(&res2.d.n, n2->len);
6055 s = zbc_num_divmod(n1, n2, &res2.d.n, &res.d.n, G.prog.scale);
6058 bc_program_binOpRetire(&res2);
6059 res.t = BC_RESULT_TEMP;
6060 bc_vec_push(&G.prog.results, &res);
6064 bc_num_free(&res2.d.n);
6065 bc_num_free(&res.d.n);
6068 #define zdc_program_divmod(...) (zdc_program_divmod(__VA_ARGS__) COMMA_SUCCESS)
6070 static BC_STATUS zdc_program_modexp(void)
6073 BcResult *r1, *r2, *r3, res;
6074 BcNum *n1, *n2, *n3;
6076 if (!STACK_HAS_MORE_THAN(&G.prog.results, 2))
6077 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6078 s = zbc_program_binOpPrep(&r2, &n2, &r3, &n3, false);
6079 if (s) RETURN_STATUS(s);
6081 r1 = bc_vec_item_rev(&G.prog.results, 2);
6082 s = zbc_program_num(r1, &n1, false);
6083 if (s) RETURN_STATUS(s);
6084 if (!BC_PROG_NUM(r1, n1))
6085 RETURN_STATUS(bc_error_variable_is_wrong_type());
6087 // Make sure that the values have their pointers updated, if necessary.
6088 if (r1->t == BC_RESULT_VAR || r1->t == BC_RESULT_ARRAY_ELEM) {
6089 if (r1->t == r2->t) {
6090 s = zbc_program_num(r2, &n2, false);
6091 if (s) RETURN_STATUS(s);
6093 if (r1->t == r3->t) {
6094 s = zbc_program_num(r3, &n3, false);
6095 if (s) RETURN_STATUS(s);
6099 bc_num_init(&res.d.n, n3->len);
6100 s = zdc_num_modexp(n1, n2, n3, &res.d.n);
6103 bc_vec_pop(&G.prog.results);
6104 bc_program_binOpRetire(&res);
6108 bc_num_free(&res.d.n);
6111 #define zdc_program_modexp(...) (zdc_program_modexp(__VA_ARGS__) COMMA_SUCCESS)
6113 static void dc_program_stackLen(void)
6116 size_t len = G.prog.results.len;
6118 res.t = BC_RESULT_TEMP;
6120 bc_num_init_DEF_SIZE(&res.d.n);
6121 bc_num_ulong2num(&res.d.n, len);
6122 bc_vec_push(&G.prog.results, &res);
6125 static BC_STATUS zdc_program_asciify(void)
6136 if (!STACK_HAS_MORE_THAN(&G.prog.results, 0))
6137 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6138 r = bc_vec_top(&G.prog.results);
6140 s = zbc_program_num(r, &num, false);
6141 if (s) RETURN_STATUS(s);
6143 if (BC_PROG_NUM(r, num)) {
6145 BcDig strmb_digs[ULONG_NUM_BUFSIZE];
6147 bc_num_init_DEF_SIZE(&n);
6148 bc_num_copy(&n, num);
6149 bc_num_truncate(&n, n.rdx);
6151 strmb.cap = ARRAY_SIZE(strmb_digs);
6152 strmb.num = strmb_digs;
6153 bc_num_ulong2num(&strmb, 0x100);
6154 s = zbc_num_mod(&n, &strmb, &n, 0);
6156 if (s) goto num_err;
6157 s = zbc_num_ulong(&n, &val);
6158 if (s) goto num_err;
6165 idx = (r->t == BC_RESULT_STR) ? r->d.id.idx : num->rdx;
6166 sp = *bc_program_str(idx);
6170 strs = (void*)G.prog.strs.v;
6171 for (idx = 0; idx < G.prog.strs.len; idx++) {
6172 if (strs[idx][0] == c && strs[idx][1] == '\0') {
6178 //str[1] = '\0'; - already is
6179 bc_vec_push(&G.prog.strs, &str);
6181 res.t = BC_RESULT_STR;
6183 bc_result_pop_and_push(&res);
6185 RETURN_STATUS(BC_STATUS_SUCCESS);
6190 #define zdc_program_asciify(...) (zdc_program_asciify(__VA_ARGS__) COMMA_SUCCESS)
6192 static BC_STATUS zdc_program_printStream(void)
6199 if (!STACK_HAS_MORE_THAN(&G.prog.results, 0))
6200 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6201 r = bc_vec_top(&G.prog.results);
6203 s = zbc_program_num(r, &n, false);
6204 if (s) RETURN_STATUS(s);
6206 if (BC_PROG_NUM(r, n)) {
6207 s = zbc_num_printNum(n, 0x100, 1, dc_num_printChar);
6210 idx = (r->t == BC_RESULT_STR) ? r->d.id.idx : n->rdx;
6211 str = *bc_program_str(idx);
6217 #define zdc_program_printStream(...) (zdc_program_printStream(__VA_ARGS__) COMMA_SUCCESS)
6219 static BC_STATUS zdc_program_nquit(void)
6226 s = zbc_program_prep(&opnd, &num);
6227 if (s) RETURN_STATUS(s);
6228 s = zbc_num_ulong(num, &val);
6229 if (s) RETURN_STATUS(s);
6231 bc_vec_pop(&G.prog.results);
6233 if (G.prog.exestack.len < val)
6234 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6235 if (G.prog.exestack.len == val) {
6236 QUIT_OR_RETURN_TO_MAIN;
6239 bc_vec_npop(&G.prog.exestack, val);
6243 #define zdc_program_nquit(...) (zdc_program_nquit(__VA_ARGS__) COMMA_SUCCESS)
6245 static BC_STATUS zdc_program_execStr(char *code, size_t *bgn, bool cond)
6247 BcStatus s = BC_STATUS_SUCCESS;
6253 if (!STACK_HAS_MORE_THAN(&G.prog.results, 0))
6254 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6256 r = bc_vec_top(&G.prog.results);
6259 BcNum *n = n; // for compiler
6262 char *then_name = bc_program_name(code, bgn);
6263 char *else_name = NULL;
6265 if (code[*bgn] == BC_PARSE_STREND)
6268 else_name = bc_program_name(code, bgn);
6270 exec = r->d.n.len != 0;
6272 if (!exec && else_name != NULL) {
6279 v = bc_program_search(name, true);
6286 if (!exec) goto exit;
6287 if (!BC_PROG_STR(n)) {
6288 s = bc_error_variable_is_wrong_type();
6294 if (r->t == BC_RESULT_STR) {
6296 } else if (r->t == BC_RESULT_VAR) {
6298 s = zbc_program_num(r, &n, false);
6299 if (s || !BC_PROG_STR(n)) goto exit;
6305 fidx = sidx + BC_PROG_REQ_FUNCS;
6307 f = bc_program_func(fidx);
6309 if (f->code.len == 0) {
6313 bc_parse_create(&prs, fidx);
6314 str = *bc_program_str(sidx);
6315 s = zbc_parse_text_init(&prs, str);
6317 s = zdc_parse_expr(&prs);
6319 if (prs.l.t.t != BC_LEX_EOF) {
6320 s = bc_error_bad_expression();
6322 bc_parse_free(&prs);
6323 bc_vec_pop_all(&f->code);
6326 bc_parse_push(&prs, BC_INST_POP_EXEC);
6327 bc_parse_free(&prs);
6333 bc_vec_pop(&G.prog.results);
6334 bc_vec_push(&G.prog.exestack, &ip);
6336 RETURN_STATUS(BC_STATUS_SUCCESS);
6338 bc_vec_pop(&G.prog.results);
6341 #define zdc_program_execStr(...) (zdc_program_execStr(__VA_ARGS__) COMMA_SUCCESS)
6344 static void bc_program_pushGlobal(char inst)
6349 res.t = inst - BC_INST_IBASE + BC_RESULT_IBASE;
6350 if (inst == BC_INST_IBASE)
6351 val = (unsigned long) G.prog.ib_t;
6352 else if (inst == BC_INST_SCALE)
6353 val = (unsigned long) G.prog.scale;
6355 val = (unsigned long) G.prog.ob_t;
6357 bc_num_init_DEF_SIZE(&res.d.n);
6358 bc_num_ulong2num(&res.d.n, val);
6359 bc_vec_push(&G.prog.results, &res);
6362 static BC_STATUS zbc_program_exec(void)
6366 BcInstPtr *ip = bc_vec_top(&G.prog.exestack);
6367 BcFunc *func = bc_program_func(ip->func);
6368 char *code = func->code.v;
6370 dbg_exec("func:%zd bytes:%zd ip:%zd results.len:%d",
6371 ip->func, func->code.len, ip->inst_idx, G.prog.results.len);
6372 while (ip->inst_idx < func->code.len) {
6373 BcStatus s = BC_STATUS_SUCCESS;
6374 char inst = code[ip->inst_idx++];
6376 dbg_exec("inst at %zd:%d results.len:%d", ip->inst_idx - 1, inst, G.prog.results.len);
6379 case BC_INST_JUMP_ZERO: {
6381 dbg_exec("BC_INST_JUMP_ZERO:");
6382 s = zbc_program_prep(&ptr, &num);
6383 if (s) RETURN_STATUS(s);
6384 zero = (bc_num_cmp(num, &G.prog.zero) == 0);
6385 bc_vec_pop(&G.prog.results);
6387 bc_program_index(code, &ip->inst_idx);
6390 // else: fall through
6392 case BC_INST_JUMP: {
6393 size_t idx = bc_program_index(code, &ip->inst_idx);
6394 size_t *addr = bc_vec_item(&func->labels, idx);
6395 dbg_exec("BC_INST_JUMP: to %ld", (long)*addr);
6396 ip->inst_idx = *addr;
6400 dbg_exec("BC_INST_CALL:");
6401 s = zbc_program_call(code, &ip->inst_idx);
6402 goto read_updated_ip;
6403 case BC_INST_INC_PRE:
6404 case BC_INST_DEC_PRE:
6405 case BC_INST_INC_POST:
6406 case BC_INST_DEC_POST:
6407 dbg_exec("BC_INST_INCDEC:");
6408 s = zbc_program_incdec(inst);
6411 dbg_exec("BC_INST_HALT:");
6412 QUIT_OR_RETURN_TO_MAIN;
6416 dbg_exec("BC_INST_RET[0]:");
6417 s = zbc_program_return(inst);
6418 goto read_updated_ip;
6419 case BC_INST_BOOL_OR:
6420 case BC_INST_BOOL_AND:
6422 case BC_INST_REL_EQ:
6423 case BC_INST_REL_LE:
6424 case BC_INST_REL_GE:
6425 case BC_INST_REL_NE:
6426 case BC_INST_REL_LT:
6427 case BC_INST_REL_GT:
6428 dbg_exec("BC_INST_BOOL:");
6429 s = zbc_program_logical(inst);
6432 dbg_exec("BC_INST_READ:");
6433 s = zbc_program_read();
6434 goto read_updated_ip;
6436 dbg_exec("BC_INST_VAR:");
6437 s = zbc_program_pushVar(code, &ip->inst_idx, false, false);
6439 case BC_INST_ARRAY_ELEM:
6441 dbg_exec("BC_INST_ARRAY[_ELEM]:");
6442 s = zbc_program_pushArray(code, &ip->inst_idx, inst);
6445 r.t = BC_RESULT_LAST;
6446 bc_vec_push(&G.prog.results, &r);
6451 bc_program_pushGlobal(inst);
6453 case BC_INST_SCALE_FUNC:
6454 case BC_INST_LENGTH:
6456 dbg_exec("BC_INST_builtin:");
6457 s = zbc_program_builtin(inst);
6460 dbg_exec("BC_INST_NUM:");
6461 r.t = BC_RESULT_CONSTANT;
6462 r.d.id.idx = bc_program_index(code, &ip->inst_idx);
6463 bc_vec_push(&G.prog.results, &r);
6466 dbg_exec("BC_INST_POP:");
6467 if (!STACK_HAS_MORE_THAN(&G.prog.results, 0))
6468 s = bc_error_stack_has_too_few_elements();
6470 bc_vec_pop(&G.prog.results);
6473 case BC_INST_PRINT_POP:
6474 case BC_INST_PRINT_STR:
6475 dbg_exec("BC_INST_PRINTxyz:");
6476 s = zbc_program_print(inst, 0);
6479 dbg_exec("BC_INST_STR:");
6480 r.t = BC_RESULT_STR;
6481 r.d.id.idx = bc_program_index(code, &ip->inst_idx);
6482 bc_vec_push(&G.prog.results, &r);
6485 case BC_INST_MULTIPLY:
6486 case BC_INST_DIVIDE:
6487 case BC_INST_MODULUS:
6490 dbg_exec("BC_INST_binaryop:");
6491 s = zbc_program_op(inst);
6493 case BC_INST_BOOL_NOT:
6494 dbg_exec("BC_INST_BOOL_NOT:");
6495 s = zbc_program_prep(&ptr, &num);
6496 if (s) RETURN_STATUS(s);
6497 bc_num_init_DEF_SIZE(&r.d.n);
6498 if (!bc_num_cmp(num, &G.prog.zero))
6500 //else bc_num_zero(&r.d.n); - already is
6501 bc_program_retire(&r, BC_RESULT_TEMP);
6504 dbg_exec("BC_INST_NEG:");
6505 s = zbc_program_negate();
6508 case BC_INST_ASSIGN_POWER:
6509 case BC_INST_ASSIGN_MULTIPLY:
6510 case BC_INST_ASSIGN_DIVIDE:
6511 case BC_INST_ASSIGN_MODULUS:
6512 case BC_INST_ASSIGN_PLUS:
6513 case BC_INST_ASSIGN_MINUS:
6515 case BC_INST_ASSIGN:
6516 dbg_exec("BC_INST_ASSIGNxyz:");
6517 s = zbc_program_assign(inst);
6520 case BC_INST_POP_EXEC:
6521 dbg_exec("BC_INST_POP_EXEC:");
6522 bc_vec_pop(&G.prog.exestack);
6523 goto read_updated_ip;
6524 case BC_INST_MODEXP:
6525 s = zdc_program_modexp();
6527 case BC_INST_DIVMOD:
6528 s = zdc_program_divmod();
6530 case BC_INST_EXECUTE:
6531 case BC_INST_EXEC_COND:
6532 s = zdc_program_execStr(code, &ip->inst_idx, inst == BC_INST_EXEC_COND);
6533 goto read_updated_ip;
6534 case BC_INST_PRINT_STACK: {
6536 for (idx = 0; idx < G.prog.results.len; ++idx) {
6537 s = zbc_program_print(BC_INST_PRINT, idx);
6542 case BC_INST_CLEAR_STACK:
6543 bc_vec_pop_all(&G.prog.results);
6545 case BC_INST_STACK_LEN:
6546 dc_program_stackLen();
6548 case BC_INST_DUPLICATE:
6549 if (!STACK_HAS_MORE_THAN(&G.prog.results, 0))
6550 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6551 ptr = bc_vec_top(&G.prog.results);
6552 dc_result_copy(&r, ptr);
6553 bc_vec_push(&G.prog.results, &r);
6555 case BC_INST_SWAP: {
6557 if (!STACK_HAS_MORE_THAN(&G.prog.results, 1))
6558 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6559 ptr = bc_vec_item_rev(&G.prog.results, 0);
6560 ptr2 = bc_vec_item_rev(&G.prog.results, 1);
6561 memcpy(&r, ptr, sizeof(BcResult));
6562 memcpy(ptr, ptr2, sizeof(BcResult));
6563 memcpy(ptr2, &r, sizeof(BcResult));
6566 case BC_INST_ASCIIFY:
6567 s = zdc_program_asciify();
6569 case BC_INST_PRINT_STREAM:
6570 s = zdc_program_printStream();
6573 case BC_INST_PUSH_VAR: {
6574 bool copy = inst == BC_INST_LOAD;
6575 s = zbc_program_pushVar(code, &ip->inst_idx, true, copy);
6578 case BC_INST_PUSH_TO_VAR: {
6579 char *name = bc_program_name(code, &ip->inst_idx);
6580 s = zbc_program_copyToVar(name, true);
6585 dbg_exec("BC_INST_QUIT:");
6586 if (G.prog.exestack.len <= 2)
6587 QUIT_OR_RETURN_TO_MAIN;
6588 bc_vec_npop(&G.prog.exestack, 2);
6589 goto read_updated_ip;
6591 s = zdc_program_nquit();
6592 //goto read_updated_ip; - just fall through to it
6595 // Instruction stack has changed, read new pointers
6596 ip = bc_vec_top(&G.prog.exestack);
6597 func = bc_program_func(ip->func);
6598 code = func->code.v;
6599 dbg_exec("func:%zd bytes:%zd ip:%zd", ip->func, func->code.len, ip->inst_idx);
6602 if (s || G_interrupt) {
6610 RETURN_STATUS(BC_STATUS_SUCCESS);
6612 #define zbc_program_exec(...) (zbc_program_exec(__VA_ARGS__) COMMA_SUCCESS)
6614 static unsigned bc_vm_envLen(const char *var)
6620 len = BC_NUM_PRINT_WIDTH;
6621 if (!lenv) return len;
6623 len = bb_strtou(lenv, NULL, 10) - 1;
6624 if (errno || len < 2 || len >= INT_MAX)
6625 len = BC_NUM_PRINT_WIDTH;
6630 static BC_STATUS zbc_vm_process(const char *text)
6634 dbg_lex_enter("%s:%d entered", __func__, __LINE__);
6635 s = zbc_parse_text_init(&G.prs, text);
6636 if (s) RETURN_STATUS(s);
6638 while (G.prs.l.t.t != BC_LEX_EOF) {
6639 dbg_lex("%s:%d G.prs.l.t.t:%d, parsing...", __func__, __LINE__, G.prs.l.t.t);
6641 // FIXME: "eating" of stmt delemiters is coded inconsistently
6642 // (sometimes zbc_parse_stmt() eats the delimiter, sometimes don't),
6643 // which causes bugs such as "print 1 print 2" erroneously accepted,
6644 // or "print 1 else 2" detecting parse error only after executing
6646 IF_BC(s = zbc_parse_stmt_or_funcdef(&G.prs));
6649 if (G.prs.l.t.t == BC_LEX_EOF)
6650 s = bc_error("end of file");
6652 s = zdc_parse_expr(&G.prs);
6655 if (s || G_interrupt) {
6656 bc_parse_reset(&G.prs); // includes bc_program_reset()
6657 RETURN_STATUS(BC_STATUS_FAILURE);
6660 dbg_lex("%s:%d executing...", __func__, __LINE__);
6661 s = zbc_program_exec();
6666 // bc discards strings, constants and code after each
6667 // top-level statement in the "main program".
6668 // This prevents "yes 1 | bc" from growing its memory
6669 // without bound. This can be done because data stack
6670 // is empty and thus can't hold any references to
6671 // strings or constants, there is no generated code
6672 // which can hold references (after we discard one
6673 // we just executed). Code of functions can have references,
6674 // but bc stores function strings/constants in per-function
6678 BcInstPtr *ip = (void*)G.prog.exestack.v;
6681 if (G.prog.results.len != 0) // should be empty
6682 bb_error_msg_and_die("BUG:data stack");
6683 if (G.prog.exestack.len != 1) // should have only main's IP
6684 bb_error_msg_and_die("BUG:call stack");
6685 if (ip->func != BC_PROG_MAIN)
6686 bb_error_msg_and_die("BUG:not MAIN");
6688 //bb_error_msg("ip->func:%d >idx:%d >len:%d", ip->func, ip->inst_idx, ip->len);
6689 f = bc_program_func_BC_PROG_MAIN();
6690 //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
6691 bc_vec_pop_all(&f->code);
6693 IF_BC(bc_vec_pop_all(&f->strs);)
6694 IF_BC(bc_vec_pop_all(&f->consts);)
6698 dbg_lex_done("%s:%d done", __func__, __LINE__);
6701 #define zbc_vm_process(...) (zbc_vm_process(__VA_ARGS__) COMMA_SUCCESS)
6703 static BC_STATUS zbc_vm_execute_FILE(FILE *fp, const char *filename)
6705 // So far bc/dc have no way to include a file from another file,
6706 // therefore we know G.prog.file == NULL on entry
6707 //const char *sv_file;
6710 G.prog.file = filename;
6712 bc_lex_file(&G.prs.l);
6715 s = zbc_vm_process("");
6716 // We do not stop looping on errors here if reading stdin.
6717 // Example: start interactive bc and enter "return".
6718 // It should say "'return' not in a function"
6719 // but should not exit.
6720 } while (G.input_fp == stdin);
6724 #define zbc_vm_execute_FILE(...) (zbc_vm_execute_FILE(__VA_ARGS__) COMMA_SUCCESS)
6726 static BC_STATUS zbc_vm_file(const char *file)
6731 fp = xfopen_for_read(file);
6732 s = zbc_vm_execute_FILE(fp, file);
6737 #define zbc_vm_file(...) (zbc_vm_file(__VA_ARGS__) COMMA_SUCCESS)
6740 static void bc_vm_info(void)
6742 printf("%s "BB_VER"\n"
6743 "Copyright (c) 2018 Gavin D. Howard and contributors\n"
6747 static void bc_args(char **argv)
6753 #if ENABLE_FEATURE_BC_LONG_OPTIONS
6754 opts = option_mask32 |= getopt32long(argv, "wvsqli",
6755 "warn\0" No_argument "w"
6756 "version\0" No_argument "v"
6757 "standard\0" No_argument "s"
6758 "quiet\0" No_argument "q"
6759 "mathlib\0" No_argument "l"
6760 "interactive\0" No_argument "i"
6763 opts = option_mask32 |= getopt32(argv, "wvsqli");
6765 if (getenv("POSIXLY_CORRECT"))
6766 option_mask32 |= BC_FLAG_S;
6768 if (opts & BC_FLAG_V) {
6773 for (i = optind; argv[i]; ++i)
6774 bc_vec_push(&G.files, argv + i);
6777 static void bc_vm_envArgs(void)
6781 char *env_args = getenv("BC_ENV_ARGS");
6783 if (!env_args) return;
6785 G.env_args = xstrdup(env_args);
6788 bc_vec_init(&v, sizeof(char *), NULL);
6790 while (*(buf = skip_whitespace(buf)) != '\0') {
6791 bc_vec_push(&v, &buf);
6792 buf = skip_non_whitespace(buf);
6798 // NULL terminate, and pass argv[] so that first arg is argv[1]
6799 if (sizeof(int) == sizeof(char*)) {
6800 bc_vec_push(&v, &const_int_0);
6802 static char *const nullptr = NULL;
6803 bc_vec_push(&v, &nullptr);
6805 bc_args(((char **)v.v) - 1);
6810 static const char bc_lib[] ALIGN1 = {
6813 "\n" "auto b,s,n,r,d,i,p,f,v"
6814 ////////////////"if(x<0)return(1/e(-x))" // and drop 'n' and x<0 logic below
6815 //^^^^^^^^^^^^^^^^ this would work, and is even more precise than GNU bc:
6816 //e(-.998896): GNU:.36828580434569428695
6817 // above code:.36828580434569428696
6818 // actual value:.3682858043456942869594...
6819 // but for now let's be "GNU compatible"
6828 "\n" "scale=scale(x)+1"
6838 "\n" "for(i=2;v;++i){"
6844 "\n" "while(d--)r*=r"
6847 "\n" "if(n)return(1/r)"
6851 "\n" "auto b,s,r,p,a,q,i,v"
6855 "\n" "r=(1-10^scale)/1"
6866 "\n" "while(x<=.5){"
6870 "\n" "r=a=(x-1)/(x+1)"
6873 "\n" "for(i=3;v;i+=2){"
6884 "\n" "auto b,s,r,a,q,i"
6885 "\n" "if(x<0)return(-s(-x))"
6889 "\n" "scale=1.1*s+2"
6898 "\n" "for(i=3;a;i+=2){"
6899 "\n" "a*=q/(i*(i-1))"
6912 "\n" "x=s(2*a(1)+x)"
6918 "\n" "auto b,s,r,n,a,m,t,f,i,u"
6926 "\n" "if(scale<65){"
6927 "\n" "if(x==1)return(.7853981633974483096156608458198757210492923498437764552437361480/n)"
6928 "\n" "if(x==.2)return(.1973955598498807583700497651947902934475851037878521015176889402/n)"
6938 "\n" "x=(x-.2)/(1+.2*x)"
6943 "\n" "for(i=3;t;i+=2){"
6950 "\n" "return((m*a+r)/n)"
6952 "\n" "define j(n,x){"
6953 "\n" "auto b,s,o,a,i,v,f"
6964 "\n" "for(i=2;i<=n;++i)a*=i"
6966 "\n" "a=(x^n)/2^n/a"
6969 "\n" "scale+=length(a)-scale(a)"
6970 "\n" "for(i=1;v;++i){"
6971 "\n" "v=v*f/i/(n+i)"
6977 "\n" "return(a*r/1)"
6982 static BC_STATUS zbc_vm_exec(void)
6989 if (option_mask32 & BC_FLAG_L) {
6990 // We know that internal library is not buggy,
6991 // thus error checking is normally disabled.
6992 # define DEBUG_LIB 0
6993 bc_lex_file(&G.prs.l);
6994 s = zbc_vm_process(bc_lib);
6995 if (DEBUG_LIB && s) RETURN_STATUS(s);
6999 s = BC_STATUS_SUCCESS;
7000 fname = (void*)G.files.v;
7001 for (i = 0; i < G.files.len; i++) {
7002 s = zbc_vm_file(*fname++);
7003 if (ENABLE_FEATURE_CLEAN_UP && !G_ttyin && s) {
7004 // Debug config, non-interactive mode:
7005 // return all the way back to main.
7006 // Non-debug builds do not come here
7007 // in non-interactive mode, they exit.
7012 if (IS_BC || (option_mask32 & BC_FLAG_I))
7013 s = zbc_vm_execute_FILE(stdin, /*filename:*/ NULL);
7017 #define zbc_vm_exec(...) (zbc_vm_exec(__VA_ARGS__) COMMA_SUCCESS)
7019 #if ENABLE_FEATURE_CLEAN_UP
7020 static void bc_program_free(void)
7022 bc_vec_free(&G.prog.fns);
7023 IF_BC(bc_vec_free(&G.prog.fn_map);)
7024 bc_vec_free(&G.prog.vars);
7025 bc_vec_free(&G.prog.var_map);
7026 bc_vec_free(&G.prog.arrs);
7027 bc_vec_free(&G.prog.arr_map);
7028 IF_DC(bc_vec_free(&G.prog.strs);)
7029 IF_DC(bc_vec_free(&G.prog.consts);)
7030 bc_vec_free(&G.prog.results);
7031 bc_vec_free(&G.prog.exestack);
7032 IF_BC(bc_num_free(&G.prog.last);)
7033 IF_BC(bc_num_free(&G.prog.zero);)
7034 IF_BC(bc_num_free(&G.prog.one);)
7035 bc_vec_free(&G.input_buffer);
7038 static void bc_vm_free(void)
7040 bc_vec_free(&G.files);
7042 bc_parse_free(&G.prs);
7047 static void bc_program_init(void)
7051 // memset(&G.prog, 0, sizeof(G.prog)); - already is
7052 memset(&ip, 0, sizeof(BcInstPtr));
7054 // G.prog.nchars = G.prog.scale = 0; - already is
7058 IF_BC(bc_num_init_DEF_SIZE(&G.prog.last);)
7059 //IF_BC(bc_num_zero(&G.prog.last);) - already is
7061 bc_num_init_DEF_SIZE(&G.prog.zero);
7062 //bc_num_zero(&G.prog.zero); - already is
7064 IF_BC(bc_num_init_DEF_SIZE(&G.prog.one);)
7065 IF_BC(bc_num_one(&G.prog.one);)
7067 bc_vec_init(&G.prog.fns, sizeof(BcFunc), bc_func_free);
7068 IF_BC(bc_vec_init(&G.prog.fn_map, sizeof(BcId), bc_id_free);)
7071 // Names are chosen simply to be distinct and never match
7072 // a valid function name (and be short)
7073 IF_BC(bc_program_addFunc(xstrdup(""))); // func #0: main
7074 IF_BC(bc_program_addFunc(xstrdup("1"))); // func #1: for read()
7076 // in dc, functions have no names
7077 bc_program_add_fn();
7078 bc_program_add_fn();
7081 bc_vec_init(&G.prog.vars, sizeof(BcVec), bc_vec_free);
7082 bc_vec_init(&G.prog.var_map, sizeof(BcId), bc_id_free);
7084 bc_vec_init(&G.prog.arrs, sizeof(BcVec), bc_vec_free);
7085 bc_vec_init(&G.prog.arr_map, sizeof(BcId), bc_id_free);
7087 IF_DC(bc_vec_init(&G.prog.strs, sizeof(char *), bc_string_free);)
7088 IF_DC(bc_vec_init(&G.prog.consts, sizeof(char *), bc_string_free);)
7089 bc_vec_init(&G.prog.results, sizeof(BcResult), bc_result_free);
7090 bc_vec_init(&G.prog.exestack, sizeof(BcInstPtr), NULL);
7091 bc_vec_push(&G.prog.exestack, &ip);
7093 bc_char_vec_init(&G.input_buffer);
7096 static int bc_vm_init(const char *env_len)
7098 #if ENABLE_FEATURE_EDITING
7099 G.line_input_state = new_line_input_t(DO_HISTORY);
7101 G.prog.len = bc_vm_envLen(env_len);
7103 bc_vec_init(&G.files, sizeof(char *), NULL);
7104 IF_BC(if (IS_BC) bc_vm_envArgs();)
7106 bc_parse_create(&G.prs, BC_PROG_MAIN);
7108 //TODO: in GNU bc, the check is (isatty(0) && isatty(1)),
7109 //-i option unconditionally enables this regardless of isatty():
7111 #if ENABLE_FEATURE_BC_SIGNALS
7113 // With SA_RESTART, most system calls will restart
7114 // (IOW: they won't fail with EINTR).
7115 // In particular, this means ^C won't cause
7116 // stdout to get into "error state" if SIGINT hits
7117 // within write() syscall.
7119 // The downside is that ^C while tty input is taken
7120 // will only be handled after [Enter] since read()
7121 // from stdin is not interrupted by ^C either,
7122 // it restarts, thus fgetc() does not return on ^C.
7123 // (This problem manifests only if line editing is disabled)
7124 signal_SA_RESTART_empty_mask(SIGINT, record_signo);
7126 // Without SA_RESTART, this exhibits a bug:
7127 // "while (1) print 1" and try ^C-ing it.
7128 // Intermittently, instead of returning to input line,
7129 // you'll get "output error: Interrupted system call"
7131 //signal_no_SA_RESTART_empty_mask(SIGINT, record_signo);
7135 return 0; // "not a tty"
7138 static BcStatus bc_vm_run(void)
7140 BcStatus st = zbc_vm_exec();
7141 #if ENABLE_FEATURE_CLEAN_UP
7142 if (G_exiting) // it was actually "halt" or "quit"
7145 # if ENABLE_FEATURE_EDITING
7146 free_line_input_t(G.line_input_state);
7150 dbg_exec("exiting with exitcode %d", st);
7155 int bc_main(int argc, char **argv) MAIN_EXTERNALLY_VISIBLE;
7156 int bc_main(int argc UNUSED_PARAM, char **argv)
7162 is_tty = bc_vm_init("BC_LINE_LENGTH");
7166 if (is_tty && !(option_mask32 & BC_FLAG_Q))
7174 int dc_main(int argc, char **argv) MAIN_EXTERNALLY_VISIBLE;
7175 int dc_main(int argc UNUSED_PARAM, char **argv)
7181 // TODO: dc (GNU bc 1.07.1) 1.4.1 seems to use width
7182 // 1 char wider than bc from the same package.
7183 // Both default width, and xC_LINE_LENGTH=N are wider:
7184 // "DC_LINE_LENGTH=5 dc -e'123456 p'" prints:
7187 // "echo '123456' | BC_LINE_LENGTH=5 bc" prints:
7190 // Do the same, or it's a bug?
7191 bc_vm_init("DC_LINE_LENGTH");
7193 // Run -e'SCRIPT' and -fFILE in order of appearance, then handle FILEs
7194 noscript = BC_FLAG_I;
7196 int n = getopt(argc, argv, "e:f:x");
7202 n = zbc_vm_process(optarg);
7207 n = zbc_vm_file(optarg);
7211 option_mask32 |= DC_FLAG_X;
7221 bc_vec_push(&G.files, argv++);
7224 option_mask32 |= noscript; // set BC_FLAG_I if we need to interpret stdin
7230 #endif // not DC_SMALL