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
175 static uint8_t lex_indent;
176 #define dbg_lex(...) \
178 fprintf(stderr, "%*s", lex_indent, ""); \
179 bb_error_msg(__VA_ARGS__); \
181 #define dbg_lex_enter(...) \
183 dbg_lex(__VA_ARGS__); \
186 #define dbg_lex_done(...) \
189 dbg_lex(__VA_ARGS__); \
192 # define dbg_lex(...) ((void)0)
193 # define dbg_lex_enter(...) ((void)0)
194 # define dbg_lex_done(...) ((void)0)
198 # define dbg_compile(...) bb_error_msg(__VA_ARGS__)
200 # define dbg_compile(...) ((void)0)
204 # define dbg_exec(...) bb_error_msg(__VA_ARGS__)
206 # define dbg_exec(...) ((void)0)
209 typedef enum BcStatus {
210 BC_STATUS_SUCCESS = 0,
211 BC_STATUS_FAILURE = 1,
212 BC_STATUS_PARSE_EMPTY_EXP = 2, // bc_parse_expr_empty_ok() uses this
215 #define BC_VEC_INVALID_IDX ((size_t) -1)
216 #define BC_VEC_START_CAP (1 << 5)
218 typedef void (*BcVecFree)(void *) FAST_FUNC;
220 typedef struct BcVec {
228 typedef signed char BcDig;
230 typedef struct BcNum {
238 #define BC_NUM_MAX_IBASE ((unsigned long) 16)
239 // larger value might speed up BIGNUM calculations a bit:
240 #define BC_NUM_DEF_SIZE (16)
241 #define BC_NUM_PRINT_WIDTH (69)
243 #define BC_NUM_KARATSUBA_LEN (32)
245 typedef enum BcInst {
274 BC_INST_ASSIGN_POWER,
275 BC_INST_ASSIGN_MULTIPLY,
276 BC_INST_ASSIGN_DIVIDE,
277 BC_INST_ASSIGN_MODULUS,
279 BC_INST_ASSIGN_MINUS,
325 BC_INST_PRINT_STREAM,
340 BC_INST_INVALID = -1,
344 typedef struct BcId {
349 typedef struct BcFunc {
353 IF_BC(size_t nparams;)
356 typedef enum BcResultType {
360 BC_RESULT_ARRAY_ELEM,
365 //code uses "inst - BC_INST_IBASE + BC_RESULT_IBASE" construct,
366 BC_RESULT_IBASE, // relative order should match for: BC_INST_IBASE
367 BC_RESULT_SCALE, // relative order should match for: BC_INST_SCALE
368 BC_RESULT_LAST, // relative order should match for: BC_INST_LAST
371 BC_RESULT_OBASE, // relative order should match for: BC_INST_OBASE
374 typedef union BcResultData {
380 typedef struct BcResult {
385 typedef struct BcInstPtr {
391 // BC_LEX_NEG is not used in lexing; it is only for parsing.
392 typedef enum BcLexType {
419 BC_LEX_OP_ASSIGN_POWER,
420 BC_LEX_OP_ASSIGN_MULTIPLY,
421 BC_LEX_OP_ASSIGN_DIVIDE,
422 BC_LEX_OP_ASSIGN_MODULUS,
423 BC_LEX_OP_ASSIGN_PLUS,
424 BC_LEX_OP_ASSIGN_MINUS,
437 BC_LEX_LBRACE, // '{' is 0x7B, '}' is 0x7D,
439 BC_LEX_RBRACE, // should be LBRACE+2: code uses (c - '{' + BC_LEX_LBRACE)
445 BC_LEX_KEY_1st_keyword,
446 BC_LEX_KEY_AUTO = BC_LEX_KEY_1st_keyword,
453 // code uses "type - BC_LEX_KEY_IBASE + BC_INST_IBASE" construct,
454 BC_LEX_KEY_IBASE, // relative order should match for: BC_INST_IBASE
456 BC_LEX_KEY_LAST, // relative order should match for: BC_INST_LAST
459 BC_LEX_KEY_OBASE, // relative order should match for: BC_INST_OBASE
486 // code uses "t - BC_LEX_STORE_IBASE + BC_INST_IBASE" construct,
487 BC_LEX_STORE_IBASE, // relative order should match for: BC_INST_IBASE
488 BC_LEX_STORE_SCALE, // relative order should match for: BC_INST_SCALE
492 BC_LEX_STORE_OBASE, // relative order should match for: BC_INST_OBASE
498 // must match order of BC_LEX_KEY_foo etc above
500 struct BcLexKeyword {
503 #define BC_LEX_KW_ENTRY(a, b) \
504 { .name8 = a /*, .posix = b */ }
505 static const struct BcLexKeyword bc_lex_kws[20] = {
506 BC_LEX_KW_ENTRY("auto" , 1), // 0
507 BC_LEX_KW_ENTRY("break" , 1), // 1
508 BC_LEX_KW_ENTRY("continue", 0), // 2 note: this one has no terminating NUL
509 BC_LEX_KW_ENTRY("define" , 1), // 3
510 BC_LEX_KW_ENTRY("else" , 0), // 4
511 BC_LEX_KW_ENTRY("for" , 1), // 5
512 BC_LEX_KW_ENTRY("halt" , 0), // 6
513 BC_LEX_KW_ENTRY("ibase" , 1), // 7
514 BC_LEX_KW_ENTRY("if" , 1), // 8
515 BC_LEX_KW_ENTRY("last" , 0), // 9
516 BC_LEX_KW_ENTRY("length" , 1), // 10
517 BC_LEX_KW_ENTRY("limits" , 0), // 11
518 BC_LEX_KW_ENTRY("obase" , 1), // 12
519 BC_LEX_KW_ENTRY("print" , 0), // 13
520 BC_LEX_KW_ENTRY("quit" , 1), // 14
521 BC_LEX_KW_ENTRY("read" , 0), // 15
522 BC_LEX_KW_ENTRY("return" , 1), // 16
523 BC_LEX_KW_ENTRY("scale" , 1), // 17
524 BC_LEX_KW_ENTRY("sqrt" , 1), // 18
525 BC_LEX_KW_ENTRY("while" , 1), // 19
527 #undef BC_LEX_KW_ENTRY
528 #define STRING_if (bc_lex_kws[8].name8)
529 #define STRING_else (bc_lex_kws[4].name8)
530 #define STRING_while (bc_lex_kws[19].name8)
531 #define STRING_for (bc_lex_kws[5].name8)
555 #define bc_lex_kws_POSIX(i) ((1 << (i)) & POSIX_KWORD_MASK)
557 // This is a bit array that corresponds to token types. An entry is
558 // true if the token is valid in an expression, false otherwise.
559 // Used to figure out when expr parsing should stop *without error message*
560 // - 0 element indicates this condition. 1 means "this token is to be eaten
561 // as part of the expression", token can them still be determined to be invalid
562 // by later processing.
564 #define EXBITS(a,b,c,d,e,f,g,h) \
565 ((uint64_t)((a << 0)+(b << 1)+(c << 2)+(d << 3)+(e << 4)+(f << 5)+(g << 6)+(h << 7)))
566 BC_PARSE_EXPRS_BITS = 0
567 + (EXBITS(0,0,1,1,1,1,1,1) << (0*8)) // 0: eof inval ++ -- - ^ * /
568 + (EXBITS(1,1,1,1,1,1,1,1) << (1*8)) // 8: % + - == <= >= != <
569 + (EXBITS(1,1,1,1,1,1,1,1) << (2*8)) // 16: > ! || && ^= *= /= %=
570 + (EXBITS(1,1,1,0,0,1,1,0) << (3*8)) // 24: += -= = NL WS ( ) [
571 + (EXBITS(0,0,0,0,0,0,1,1) << (4*8)) // 32: , ] { ; } STR NAME NUM
572 + (EXBITS(0,0,0,0,0,0,0,1) << (5*8)) // 40: auto break cont define else for halt ibase
573 + (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?
574 + (EXBITS(0,1,1,0,0,0,0,0) << (7*8)) // 56: return scale sqrt while
577 static ALWAYS_INLINE long bc_parse_exprs(unsigned i)
579 #if ULONG_MAX > 0xffffffff
580 // 64-bit version (will not work correctly for 32-bit longs!)
581 return BC_PARSE_EXPRS_BITS & (1UL << i);
584 unsigned long m = (uint32_t)BC_PARSE_EXPRS_BITS;
586 m = (uint32_t)(BC_PARSE_EXPRS_BITS >> 32);
589 return m & (1UL << i);
593 // This is an array of data for operators that correspond to
594 // [BC_LEX_OP_INC...BC_LEX_OP_ASSIGN] token types.
595 static const uint8_t bc_parse_ops[] = {
596 #define OP(p,l) ((int)(l) * 0x10 + (p))
597 OP(0, false), OP( 0, false ), // inc dec
600 OP(3, true ), OP( 3, true ), OP( 3, true ), // mul div mod
601 OP(4, true ), OP( 4, true ), // + -
602 OP(6, true ), OP( 6, true ), OP( 6, true ), OP( 6, true ), OP( 6, true ), OP( 6, true ), // == <= >= != < >
604 OP(7, true ), OP( 7, true ), // or and
605 OP(5, false), OP( 5, false ), OP( 5, false ), OP( 5, false ), OP( 5, false ), // ^= *= /= %= +=
606 OP(5, false), OP( 5, false ), // -= =
609 #define bc_parse_op_PREC(i) (bc_parse_ops[i] & 0x0f)
610 #define bc_parse_op_LEFT(i) (bc_parse_ops[i] & 0x10)
614 static const //BcInst - should be this type. Using signed narrow type since BC_INST_INVALID is -1
617 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID, BC_INST_REL_GE,
618 BC_INST_INVALID, BC_INST_POWER, BC_INST_MULTIPLY, BC_INST_DIVIDE,
619 BC_INST_MODULUS, BC_INST_PLUS, BC_INST_MINUS,
620 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID,
621 BC_INST_INVALID, BC_INST_INVALID,
622 BC_INST_BOOL_NOT, BC_INST_INVALID, BC_INST_INVALID,
623 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID,
624 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID,
625 BC_INST_INVALID, BC_INST_INVALID, BC_INST_REL_GT, BC_INST_INVALID,
626 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID, BC_INST_REL_GE,
627 BC_INST_INVALID, BC_INST_INVALID,
628 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID,
629 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID,
630 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID, BC_INST_IBASE,
631 BC_INST_INVALID, BC_INST_INVALID, BC_INST_LENGTH, BC_INST_INVALID,
632 BC_INST_OBASE, BC_INST_PRINT, BC_INST_QUIT, BC_INST_INVALID,
633 BC_INST_INVALID, BC_INST_SCALE, BC_INST_SQRT, BC_INST_INVALID,
634 BC_INST_REL_EQ, BC_INST_MODEXP, BC_INST_DIVMOD, BC_INST_INVALID,
635 BC_INST_INVALID, BC_INST_EXECUTE, BC_INST_PRINT_STACK, BC_INST_CLEAR_STACK,
636 BC_INST_STACK_LEN, BC_INST_DUPLICATE, BC_INST_SWAP, BC_INST_POP,
637 BC_INST_ASCIIFY, BC_INST_PRINT_STREAM, BC_INST_INVALID, BC_INST_INVALID,
638 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID,
639 BC_INST_PRINT, BC_INST_NQUIT, BC_INST_SCALE_FUNC,
643 typedef struct BcLex {
656 #define BC_PARSE_STREND (0xff)
658 #define BC_PARSE_REL (1 << 0)
659 #define BC_PARSE_PRINT (1 << 1)
660 #define BC_PARSE_NOCALL (1 << 2)
661 #define BC_PARSE_NOREAD (1 << 3)
662 #define BC_PARSE_ARRAY (1 << 4)
664 typedef struct BcParse {
674 IF_BC(size_t in_funcdef;)
677 typedef struct BcProgram {
707 #define BC_PROG_MAIN (0)
708 #define BC_PROG_READ (1)
710 #define BC_PROG_REQ_FUNCS (2)
713 #define BC_PROG_STR(n) (!(n)->num && !(n)->cap)
714 #define BC_PROG_NUM(r, n) \
715 ((r)->t != BC_RESULT_ARRAY && (r)->t != BC_RESULT_STR && !BC_PROG_STR(n))
717 #define BC_FLAG_W (1 << 0)
718 #define BC_FLAG_V (1 << 1)
719 #define BC_FLAG_S (1 << 2)
720 #define BC_FLAG_Q (1 << 3)
721 #define BC_FLAG_L (1 << 4)
722 #define BC_FLAG_I (1 << 5)
723 #define DC_FLAG_X (1 << 6)
725 #define BC_MAX(a, b) ((a) > (b) ? (a) : (b))
726 #define BC_MIN(a, b) ((a) < (b) ? (a) : (b))
728 #define BC_MAX_OBASE ((unsigned) 999)
729 #define BC_MAX_DIM ((unsigned) INT_MAX)
730 #define BC_MAX_SCALE ((unsigned) UINT_MAX)
731 #define BC_MAX_STRING ((unsigned) UINT_MAX - 1)
732 #define BC_MAX_NUM BC_MAX_STRING
733 // Unused apart from "limits" message. Just show a "biggish number" there.
734 //#define BC_MAX_NAME BC_MAX_STRING
735 //#define BC_MAX_EXP ((unsigned long) LONG_MAX)
736 //#define BC_MAX_VARS ((unsigned long) SIZE_MAX - 1)
737 #define BC_MAX_NAME_STR "999999999"
738 #define BC_MAX_EXP_STR "999999999"
739 #define BC_MAX_VARS_STR "999999999"
741 #define BC_MAX_OBASE_STR "999"
743 #if INT_MAX == 2147483647
744 # define BC_MAX_DIM_STR "2147483647"
745 #elif INT_MAX == 9223372036854775807
746 # define BC_MAX_DIM_STR "9223372036854775807"
748 # error Strange INT_MAX
751 #if UINT_MAX == 4294967295
752 # define BC_MAX_SCALE_STR "4294967295"
753 # define BC_MAX_STRING_STR "4294967294"
754 #elif UINT_MAX == 18446744073709551615
755 # define BC_MAX_SCALE_STR "18446744073709551615"
756 # define BC_MAX_STRING_STR "18446744073709551614"
758 # error Strange UINT_MAX
760 #define BC_MAX_NUM_STR BC_MAX_STRING_STR
763 IF_FEATURE_BC_SIGNALS(smallint ttyin;)
764 IF_FEATURE_CLEAN_UP(smallint exiting;)
770 // For error messages. Can be set to current parsed line,
771 // or [TODO] to current executing line (can be before last parsed one)
780 #if ENABLE_FEATURE_EDITING
781 line_input_t *line_input_state;
784 #define G (*ptr_to_globals)
785 #define INIT_G() do { \
786 SET_PTR_TO_GLOBALS(xzalloc(sizeof(G))); \
788 #define FREE_G() do { \
789 FREE_PTR_TO_GLOBALS(); \
791 #define G_posix (ENABLE_BC && (option_mask32 & BC_FLAG_S))
792 #define G_warn (ENABLE_BC && (option_mask32 & BC_FLAG_W))
793 #define G_exreg (ENABLE_DC && (option_mask32 & DC_FLAG_X))
794 #if ENABLE_FEATURE_BC_SIGNALS
795 # define G_interrupt bb_got_signal
796 # define G_ttyin G.ttyin
798 # define G_interrupt 0
801 #if ENABLE_FEATURE_CLEAN_UP
802 # define G_exiting G.exiting
806 #define IS_BC (ENABLE_BC && (!ENABLE_DC || applet_name[0] == 'b'))
807 #define IS_DC (ENABLE_DC && (!ENABLE_BC || applet_name[0] != 'b'))
809 // In configurations where errors abort instead of propagating error
810 // return code up the call chain, functions returning BC_STATUS
811 // actually don't return anything, they always succeed and return "void".
812 // A macro wrapper is provided, which makes this statement work:
814 // and makes it visible to the compiler that s is always zero,
815 // allowing compiler to optimize dead code after the statement.
817 // To make code more readable, each such function has a "z"
818 // ("always returning zero") prefix, i.e. zbc_foo or zdc_foo.
820 #if ENABLE_FEATURE_BC_SIGNALS || ENABLE_FEATURE_CLEAN_UP
821 # define ERRORS_ARE_FATAL 0
822 # define ERRORFUNC /*nothing*/
823 # define IF_ERROR_RETURN_POSSIBLE(a) a
824 # define BC_STATUS BcStatus
825 # define RETURN_STATUS(v) return (v)
826 # define COMMA_SUCCESS /*nothing*/
828 # define ERRORS_ARE_FATAL 1
829 # define ERRORFUNC NORETURN
830 # define IF_ERROR_RETURN_POSSIBLE(a) /*nothing*/
831 # define BC_STATUS void
832 # define RETURN_STATUS(v) do { ((void)(v)); return; } while (0)
833 # define COMMA_SUCCESS ,BC_STATUS_SUCCESS
836 #define STACK_HAS_MORE_THAN(s, n) ((s)->len > ((size_t)(n)))
837 #define STACK_HAS_EQUAL_OR_MORE_THAN(s, n) ((s)->len >= ((size_t)(n)))
839 #define BC_NUM_NEG(n, neg) ((((ssize_t)(n)) ^ -((ssize_t)(neg))) + (neg))
840 #define BC_NUM_ONE(n) ((n)->len == 1 && (n)->rdx == 0 && (n)->num[0] == 1)
841 #define BC_NUM_INT(n) ((n)->len - (n)->rdx)
842 //#define BC_NUM_AREQ(a, b) (BC_MAX((a)->rdx, (b)->rdx) + BC_MAX(BC_NUM_INT(a), BC_NUM_INT(b)) + 1)
843 static /*ALWAYS_INLINE*/ size_t BC_NUM_AREQ(BcNum *a, BcNum *b)
845 return BC_MAX(a->rdx, b->rdx) + BC_MAX(BC_NUM_INT(a), BC_NUM_INT(b)) + 1;
847 //#define BC_NUM_MREQ(a, b, scale) (BC_NUM_INT(a) + BC_NUM_INT(b) + BC_MAX((scale), (a)->rdx + (b)->rdx) + 1)
848 static /*ALWAYS_INLINE*/ size_t BC_NUM_MREQ(BcNum *a, BcNum *b, size_t scale)
850 return BC_NUM_INT(a) + BC_NUM_INT(b) + BC_MAX(scale, a->rdx + b->rdx) + 1;
853 typedef void (*BcNumDigitOp)(size_t, size_t, bool) FAST_FUNC;
855 typedef BC_STATUS (*BcNumBinaryOp)(BcNum *, BcNum *, BcNum *, size_t) FAST_FUNC;
857 static BC_STATUS zbc_num_binary(BcNum *a, BcNum *b, BcNum *c, size_t scale,
858 BcNumBinaryOp op, size_t req);
859 static FAST_FUNC BC_STATUS zbc_num_a(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale);
860 static FAST_FUNC BC_STATUS zbc_num_s(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale);
861 static FAST_FUNC BC_STATUS zbc_num_p(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale);
862 static FAST_FUNC BC_STATUS zbc_num_m(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale);
863 static FAST_FUNC BC_STATUS zbc_num_d(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale);
864 static FAST_FUNC BC_STATUS zbc_num_rem(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale);
866 static FAST_FUNC BC_STATUS zbc_num_add(BcNum *a, BcNum *b, BcNum *c, size_t scale)
868 BcNumBinaryOp op = (!a->neg == !b->neg) ? zbc_num_a : zbc_num_s;
870 RETURN_STATUS(zbc_num_binary(a, b, c, false, op, BC_NUM_AREQ(a, b)));
873 static FAST_FUNC BC_STATUS zbc_num_sub(BcNum *a, BcNum *b, BcNum *c, size_t scale)
875 BcNumBinaryOp op = (!a->neg == !b->neg) ? zbc_num_s : zbc_num_a;
877 RETURN_STATUS(zbc_num_binary(a, b, c, true, op, BC_NUM_AREQ(a, b)));
880 static FAST_FUNC BC_STATUS zbc_num_mul(BcNum *a, BcNum *b, BcNum *c, size_t scale)
882 size_t req = BC_NUM_MREQ(a, b, scale);
883 RETURN_STATUS(zbc_num_binary(a, b, c, scale, zbc_num_m, req));
886 static FAST_FUNC BC_STATUS zbc_num_div(BcNum *a, BcNum *b, BcNum *c, size_t scale)
888 size_t req = BC_NUM_MREQ(a, b, scale);
889 RETURN_STATUS(zbc_num_binary(a, b, c, scale, zbc_num_d, req));
892 static FAST_FUNC BC_STATUS zbc_num_mod(BcNum *a, BcNum *b, BcNum *c, size_t scale)
894 size_t req = BC_NUM_MREQ(a, b, scale);
895 RETURN_STATUS(zbc_num_binary(a, b, c, scale, zbc_num_rem, req));
898 static FAST_FUNC BC_STATUS zbc_num_pow(BcNum *a, BcNum *b, BcNum *c, size_t scale)
900 RETURN_STATUS(zbc_num_binary(a, b, c, scale, zbc_num_p, a->len * b->len + 1));
903 static const BcNumBinaryOp zbc_program_ops[] = {
904 zbc_num_pow, zbc_num_mul, zbc_num_div, zbc_num_mod, zbc_num_add, zbc_num_sub,
906 #define zbc_num_add(...) (zbc_num_add(__VA_ARGS__) COMMA_SUCCESS)
907 #define zbc_num_sub(...) (zbc_num_sub(__VA_ARGS__) COMMA_SUCCESS)
908 #define zbc_num_mul(...) (zbc_num_mul(__VA_ARGS__) COMMA_SUCCESS)
909 #define zbc_num_div(...) (zbc_num_div(__VA_ARGS__) COMMA_SUCCESS)
910 #define zbc_num_mod(...) (zbc_num_mod(__VA_ARGS__) COMMA_SUCCESS)
911 #define zbc_num_pow(...) (zbc_num_pow(__VA_ARGS__) COMMA_SUCCESS)
913 static void fflush_and_check(void)
916 if (ferror(stdout) || ferror(stderr))
917 bb_perror_msg_and_die("output error");
920 #if ENABLE_FEATURE_CLEAN_UP
921 #define QUIT_OR_RETURN_TO_MAIN \
923 IF_FEATURE_BC_SIGNALS(G_ttyin = 0;) /* do not loop in main loop anymore */ \
925 return BC_STATUS_FAILURE; \
928 #define QUIT_OR_RETURN_TO_MAIN quit()
931 static void quit(void) NORETURN;
932 static void quit(void)
935 bb_perror_msg_and_die("input error");
937 dbg_exec("quit(): exiting with exitcode SUCCESS");
941 static void bc_verror_msg(const char *fmt, va_list p)
943 const char *sv = sv; // for compiler
946 applet_name = xasprintf("%s: %s:%u", applet_name, G.prog.file, G.err_line);
948 bb_verror_msg(fmt, p, NULL);
950 free((char*)applet_name);
955 static NOINLINE ERRORFUNC int bc_error_fmt(const char *fmt, ...)
960 bc_verror_msg(fmt, p);
963 if (ENABLE_FEATURE_CLEAN_UP || G_ttyin)
964 IF_ERROR_RETURN_POSSIBLE(return BC_STATUS_FAILURE);
969 static NOINLINE int bc_posix_error_fmt(const char *fmt, ...)
973 // Are non-POSIX constructs totally ok?
974 if (!(option_mask32 & (BC_FLAG_S|BC_FLAG_W)))
975 return BC_STATUS_SUCCESS; // yes
978 bc_verror_msg(fmt, p);
981 // Do we treat non-POSIX constructs as errors?
982 if (!(option_mask32 & BC_FLAG_S))
983 return BC_STATUS_SUCCESS; // no, it's a warning
984 if (ENABLE_FEATURE_CLEAN_UP || G_ttyin)
985 return BC_STATUS_FAILURE;
990 // We use error functions with "return bc_error(FMT[, PARAMS])" idiom.
991 // This idiom begs for tail-call optimization, but for it to work,
992 // function must not have caller-cleaned parameters on stack.
993 // Unfortunately, vararg function API does exactly that on most arches.
994 // Thus, use these shims for the cases when we have no vararg PARAMS:
995 static ERRORFUNC int bc_error(const char *msg)
997 IF_ERROR_RETURN_POSSIBLE(return) bc_error_fmt("%s", msg);
999 static ERRORFUNC int bc_error_bad_character(char c)
1002 IF_ERROR_RETURN_POSSIBLE(return) bc_error("NUL character");
1003 IF_ERROR_RETURN_POSSIBLE(return) bc_error_fmt("bad character '%c'", c);
1005 static ERRORFUNC int bc_error_bad_expression(void)
1007 IF_ERROR_RETURN_POSSIBLE(return) bc_error("bad expression");
1009 static ERRORFUNC int bc_error_bad_token(void)
1011 IF_ERROR_RETURN_POSSIBLE(return) bc_error("bad token");
1013 static ERRORFUNC int bc_error_stack_has_too_few_elements(void)
1015 IF_ERROR_RETURN_POSSIBLE(return) bc_error("stack has too few elements");
1017 static ERRORFUNC int bc_error_variable_is_wrong_type(void)
1019 IF_ERROR_RETURN_POSSIBLE(return) bc_error("variable is wrong type");
1021 static ERRORFUNC int bc_error_nested_read_call(void)
1023 IF_ERROR_RETURN_POSSIBLE(return) bc_error("read() call inside of a read() call");
1026 static int bc_POSIX_requires(const char *msg)
1028 return bc_posix_error_fmt("POSIX requires %s", msg);
1030 static int bc_POSIX_does_not_allow(const char *msg)
1032 return bc_posix_error_fmt("%s%s", "POSIX does not allow ", msg);
1034 static int bc_POSIX_does_not_allow_bool_ops_this_is_bad(const char *msg)
1036 return bc_posix_error_fmt("%s%s %s", "POSIX does not allow ", "boolean operators; the following is bad:", msg);
1038 static int bc_POSIX_does_not_allow_empty_X_expression_in_for(const char *msg)
1040 return bc_posix_error_fmt("%san empty %s expression in a for loop", "POSIX does not allow ", msg);
1044 static void bc_vec_grow(BcVec *v, size_t n)
1046 size_t cap = v->cap * 2;
1047 while (cap < v->len + n) cap *= 2;
1048 v->v = xrealloc(v->v, v->size * cap);
1052 static void bc_vec_init(BcVec *v, size_t esize, BcVecFree dtor)
1055 v->cap = BC_VEC_START_CAP;
1058 v->v = xmalloc(esize * BC_VEC_START_CAP);
1061 static void bc_char_vec_init(BcVec *v)
1063 bc_vec_init(v, sizeof(char), NULL);
1066 static void bc_vec_expand(BcVec *v, size_t req)
1069 v->v = xrealloc(v->v, v->size * req);
1074 static void bc_vec_pop(BcVec *v)
1078 v->dtor(v->v + (v->size * v->len));
1081 static void bc_vec_npop(BcVec *v, size_t n)
1086 size_t len = v->len - n;
1087 while (v->len > len) v->dtor(v->v + (v->size * --v->len));
1091 static void bc_vec_pop_all(BcVec *v)
1093 bc_vec_npop(v, v->len);
1096 static void bc_vec_push(BcVec *v, const void *data)
1098 if (v->len + 1 > v->cap) bc_vec_grow(v, 1);
1099 memmove(v->v + (v->size * v->len), data, v->size);
1103 static void bc_vec_pushByte(BcVec *v, char data)
1105 bc_vec_push(v, &data);
1108 static void bc_vec_pushZeroByte(BcVec *v)
1110 //bc_vec_pushByte(v, '\0');
1112 bc_vec_push(v, &const_int_0);
1115 static void bc_vec_pushAt(BcVec *v, const void *data, size_t idx)
1118 bc_vec_push(v, data);
1122 if (v->len == v->cap) bc_vec_grow(v, 1);
1124 ptr = v->v + v->size * idx;
1126 memmove(ptr + v->size, ptr, v->size * (v->len++ - idx));
1127 memmove(ptr, data, v->size);
1131 static void bc_vec_string(BcVec *v, size_t len, const char *str)
1134 bc_vec_expand(v, len + 1);
1135 memcpy(v->v, str, len);
1138 bc_vec_pushZeroByte(v);
1141 #if ENABLE_FEATURE_BC_SIGNALS && ENABLE_FEATURE_EDITING
1142 static void bc_vec_concat(BcVec *v, const char *str)
1146 if (v->len == 0) bc_vec_pushZeroByte(v);
1149 len = v->len + slen;
1151 if (v->cap < len) bc_vec_grow(v, slen);
1152 strcpy(v->v + v->len - 1, str);
1158 static void *bc_vec_item(const BcVec *v, size_t idx)
1160 return v->v + v->size * idx;
1163 static char** bc_program_str(size_t idx)
1165 return bc_vec_item(&G.prog.strs, idx);
1168 static BcFunc* bc_program_func(size_t idx)
1170 return bc_vec_item(&G.prog.fns, idx);
1172 // BC_PROG_MAIN is zeroth element, so:
1173 #define bc_program_func_BC_PROG_MAIN() ((BcFunc*)(G.prog.fns.v))
1175 static void *bc_vec_item_rev(const BcVec *v, size_t idx)
1177 return v->v + v->size * (v->len - idx - 1);
1180 static void *bc_vec_top(const BcVec *v)
1182 return v->v + v->size * (v->len - 1);
1185 static FAST_FUNC void bc_vec_free(void *vec)
1187 BcVec *v = (BcVec *) vec;
1192 static int bc_id_cmp(const void *e1, const void *e2)
1194 return strcmp(((const BcId *) e1)->name, ((const BcId *) e2)->name);
1197 static FAST_FUNC void bc_id_free(void *id)
1199 free(((BcId *) id)->name);
1202 static size_t bc_map_find_ge(const BcVec *v, const void *ptr)
1204 size_t low = 0, high = v->len;
1206 while (low < high) {
1207 size_t mid = (low + high) / 2;
1208 BcId *id = bc_vec_item(v, mid);
1209 int result = bc_id_cmp(ptr, id);
1222 static int bc_map_insert(BcVec *v, const void *ptr, size_t *i)
1224 size_t n = *i = bc_map_find_ge(v, ptr);
1227 bc_vec_push(v, ptr);
1228 else if (!bc_id_cmp(ptr, bc_vec_item(v, n)))
1229 return 0; // "was not inserted"
1231 bc_vec_pushAt(v, ptr, n);
1232 return 1; // "was inserted"
1236 static size_t bc_map_find_exact(const BcVec *v, const void *ptr)
1238 size_t i = bc_map_find_ge(v, ptr);
1239 if (i >= v->len) return BC_VEC_INVALID_IDX;
1240 return bc_id_cmp(ptr, bc_vec_item(v, i)) ? BC_VEC_INVALID_IDX : i;
1244 static int bad_input_byte(char c)
1246 if ((c < ' ' && c != '\t' && c != '\r' && c != '\n') // also allow '\v' '\f'?
1249 bc_error_fmt("illegal character 0x%02x", c);
1255 // Note: it _appends_ data from fp to vec.
1256 static void bc_read_line(BcVec *vec, FILE *fp)
1261 #if ENABLE_FEATURE_BC_SIGNALS
1262 if (G_interrupt) { // ^C was pressed
1265 // ^C while running a script (bc SCRIPT): die.
1266 // We do not return to interactive prompt:
1267 // user might be running us from a shell,
1268 // and SCRIPT might be intended to terminate
1269 // (e.g. contain a "halt" stmt).
1270 // ^C dropping user into a bc prompt instead of
1271 // the shell would be unexpected.
1274 // ^C while interactive input
1276 // GNU bc says "interrupted execution."
1277 // GNU dc says "Interrupt!"
1278 fputs("\ninterrupted execution\n", stderr);
1281 # if ENABLE_FEATURE_EDITING
1282 if (G_ttyin && fp == stdin) {
1284 # define line_buf bb_common_bufsiz1
1285 n = read_line_input(G.line_input_state, "", line_buf, COMMON_BUFSIZE);
1286 if (n <= 0) { // read errors or EOF, or ^D, or ^C
1289 bc_vec_pushZeroByte(vec); // ^D or EOF (or error)
1294 char c = line_buf[i++];
1296 if (bad_input_byte(c)) goto again;
1298 bc_vec_concat(vec, line_buf);
1306 size_t len = vec->len;
1309 #if ENABLE_FEATURE_BC_SIGNALS
1311 // ^C was pressed: ignore entire line, get another one
1316 do c = fgetc(fp); while (c == '\0');
1319 bb_perror_msg_and_die("input error");
1320 // Note: EOF does not append '\n'
1323 bad_chars |= bad_input_byte(c);
1324 bc_vec_pushByte(vec, (char)c);
1325 } while (c != '\n');
1328 // Bad chars on this line
1329 if (!G.prog.file) { // stdin
1330 // ignore entire line, get another one
1334 bb_perror_msg_and_die("file '%s' is not text", G.prog.file);
1336 bc_vec_pushZeroByte(vec);
1340 static void bc_num_setToZero(BcNum *n, size_t scale)
1347 static void bc_num_zero(BcNum *n)
1349 bc_num_setToZero(n, 0);
1352 static void bc_num_one(BcNum *n)
1354 bc_num_setToZero(n, 0);
1359 // Note: this also sets BcNum to zero
1360 static void bc_num_init(BcNum *n, size_t req)
1362 req = req >= BC_NUM_DEF_SIZE ? req : BC_NUM_DEF_SIZE;
1363 //memset(n, 0, sizeof(BcNum)); - cleared by assignments below
1364 n->num = xmalloc(req);
1371 static void bc_num_init_DEF_SIZE(BcNum *n)
1373 bc_num_init(n, BC_NUM_DEF_SIZE);
1376 static void bc_num_expand(BcNum *n, size_t req)
1378 req = req >= BC_NUM_DEF_SIZE ? req : BC_NUM_DEF_SIZE;
1380 n->num = xrealloc(n->num, req);
1385 static FAST_FUNC void bc_num_free(void *num)
1387 free(((BcNum *) num)->num);
1390 static void bc_num_copy(BcNum *d, BcNum *s)
1393 bc_num_expand(d, s->cap);
1397 memcpy(d->num, s->num, sizeof(BcDig) * d->len);
1401 static BC_STATUS zbc_num_ulong(BcNum *n, unsigned long *result_p)
1404 unsigned long pow, result;
1406 if (n->neg) RETURN_STATUS(bc_error("negative number"));
1408 for (result = 0, pow = 1, i = n->rdx; i < n->len; ++i) {
1409 unsigned long prev = result, powprev = pow;
1411 result += ((unsigned long) n->num[i]) * pow;
1414 if (result < prev || pow < powprev)
1415 RETURN_STATUS(bc_error("overflow"));
1421 RETURN_STATUS(BC_STATUS_SUCCESS);
1423 #define zbc_num_ulong(...) (zbc_num_ulong(__VA_ARGS__) COMMA_SUCCESS)
1425 static void bc_num_ulong2num(BcNum *n, unsigned long val)
1431 if (val == 0) return;
1433 if (ULONG_MAX == 0xffffffffUL)
1434 bc_num_expand(n, 10); // 10 digits: 4294967295
1435 if (ULONG_MAX == 0xffffffffffffffffULL)
1436 bc_num_expand(n, 20); // 20 digits: 18446744073709551615
1437 BUILD_BUG_ON(ULONG_MAX > 0xffffffffffffffffULL);
1444 if (val == 0) break;
1448 static void bc_num_subArrays(BcDig *restrict a, BcDig *restrict b, size_t len)
1451 for (i = 0; i < len; ++i) {
1453 for (j = i; a[j] < 0;) {
1460 static ssize_t bc_num_compare(BcDig *restrict a, BcDig *restrict b, size_t len)
1478 static ssize_t bc_num_cmp(BcNum *a, BcNum *b)
1480 size_t i, min, a_int, b_int, diff;
1481 BcDig *max_num, *min_num;
1485 if (a == b) return 0;
1486 if (a->len == 0) return BC_NUM_NEG(!!b->len, !b->neg);
1487 if (b->len == 0) return BC_NUM_NEG(1, a->neg);
1489 if (a->neg != b->neg) // signs of a and b differ
1490 // +a,-b = a>b = 1 or -a,+b = a<b = -1
1491 return (int)b->neg - (int)a->neg;
1492 neg = a->neg; // 1 if both negative, 0 if both positive
1494 a_int = BC_NUM_INT(a);
1495 b_int = BC_NUM_INT(b);
1498 if (a_int != 0) return (ssize_t) a_int;
1500 a_max = (a->rdx > b->rdx);
1503 diff = a->rdx - b->rdx;
1504 max_num = a->num + diff;
1506 // neg = (a_max == neg); - NOP (maps 1->1 and 0->0)
1509 diff = b->rdx - a->rdx;
1510 max_num = b->num + diff;
1512 neg = !neg; // same as "neg = (a_max == neg)"
1515 cmp = bc_num_compare(max_num, min_num, b_int + min);
1516 if (cmp != 0) return BC_NUM_NEG(cmp, neg);
1518 for (max_num -= diff, i = diff - 1; i < diff; --i) {
1519 if (max_num[i]) return BC_NUM_NEG(1, neg);
1525 static void bc_num_truncate(BcNum *n, size_t places)
1527 if (places == 0) return;
1533 memmove(n->num, n->num + places, n->len * sizeof(BcDig));
1537 static void bc_num_extend(BcNum *n, size_t places)
1539 size_t len = n->len + places;
1542 if (n->cap < len) bc_num_expand(n, len);
1544 memmove(n->num + places, n->num, sizeof(BcDig) * n->len);
1545 memset(n->num, 0, sizeof(BcDig) * places);
1552 static void bc_num_clean(BcNum *n)
1554 while (n->len > 0 && n->num[n->len - 1] == 0) --n->len;
1557 else if (n->len < n->rdx)
1561 static void bc_num_retireMul(BcNum *n, size_t scale, bool neg1, bool neg2)
1564 bc_num_extend(n, scale - n->rdx);
1566 bc_num_truncate(n, n->rdx - scale);
1569 if (n->len != 0) n->neg = !neg1 != !neg2;
1572 static void bc_num_split(BcNum *restrict n, size_t idx, BcNum *restrict a,
1576 b->len = n->len - idx;
1578 a->rdx = b->rdx = 0;
1580 memcpy(b->num, n->num + idx, b->len * sizeof(BcDig));
1581 memcpy(a->num, n->num, idx * sizeof(BcDig));
1591 static BC_STATUS zbc_num_shift(BcNum *n, size_t places)
1593 if (places == 0 || n->len == 0) RETURN_STATUS(BC_STATUS_SUCCESS);
1595 // This check makes sense only if size_t is (much) larger than BC_MAX_NUM.
1596 if (SIZE_MAX > (BC_MAX_NUM | 0xff)) {
1597 if (places + n->len > BC_MAX_NUM)
1598 RETURN_STATUS(bc_error("number too long: must be [1,"BC_MAX_NUM_STR"]"));
1601 if (n->rdx >= places)
1604 bc_num_extend(n, places - n->rdx);
1610 RETURN_STATUS(BC_STATUS_SUCCESS);
1612 #define zbc_num_shift(...) (zbc_num_shift(__VA_ARGS__) COMMA_SUCCESS)
1614 static BC_STATUS zbc_num_inv(BcNum *a, BcNum *b, size_t scale)
1616 //TODO: nice example of non-allocated BcNum, use in other places as well!
1624 RETURN_STATUS(zbc_num_div(&one, a, b, scale));
1626 #define zbc_num_inv(...) (zbc_num_inv(__VA_ARGS__) COMMA_SUCCESS)
1628 static FAST_FUNC BC_STATUS zbc_num_a(BcNum *a, BcNum *b, BcNum *restrict c, size_t sub)
1630 BcDig *ptr, *ptr_a, *ptr_b, *ptr_c;
1631 size_t i, max, min_rdx, min_int, diff, a_int, b_int;
1634 // Because this function doesn't need to use scale (per the bc spec),
1635 // I am hijacking it to say whether it's doing an add or a subtract.
1639 if (sub && c->len) c->neg = !c->neg;
1640 RETURN_STATUS(BC_STATUS_SUCCESS);
1644 RETURN_STATUS(BC_STATUS_SUCCESS);
1648 c->rdx = BC_MAX(a->rdx, b->rdx);
1649 min_rdx = BC_MIN(a->rdx, b->rdx);
1652 if (a->rdx > b->rdx) {
1653 diff = a->rdx - b->rdx;
1655 ptr_a = a->num + diff;
1658 diff = b->rdx - a->rdx;
1661 ptr_b = b->num + diff;
1665 for (i = 0; i < diff; ++i, ++c->len)
1669 a_int = BC_NUM_INT(a);
1670 b_int = BC_NUM_INT(b);
1672 if (a_int > b_int) {
1683 for (i = 0; i < min_rdx + min_int; ++i) {
1684 unsigned in = (unsigned)ptr_a[i] + (unsigned)ptr_b[i] + carry;
1686 ptr_c[i] = (BcDig)(in % 10);
1688 for (; i < max + min_rdx; ++i) {
1689 unsigned in = (unsigned)ptr[i] + carry;
1691 ptr_c[i] = (BcDig)(in % 10);
1695 if (carry != 0) c->num[c->len++] = (BcDig) carry;
1697 RETURN_STATUS(BC_STATUS_SUCCESS); // can't make void, see zbc_num_binary()
1700 static FAST_FUNC BC_STATUS zbc_num_s(BcNum *a, BcNum *b, BcNum *restrict c, size_t sub)
1703 BcNum *minuend, *subtrahend;
1705 bool aneg, bneg, neg;
1707 // Because this function doesn't need to use scale (per the bc spec),
1708 // I am hijacking it to say whether it's doing an add or a subtract.
1712 if (sub && c->len) c->neg = !c->neg;
1713 RETURN_STATUS(BC_STATUS_SUCCESS);
1717 RETURN_STATUS(BC_STATUS_SUCCESS);
1722 a->neg = b->neg = false;
1724 cmp = bc_num_cmp(a, b);
1730 bc_num_setToZero(c, BC_MAX(a->rdx, b->rdx));
1731 RETURN_STATUS(BC_STATUS_SUCCESS);
1739 if (sub) neg = !neg;
1744 bc_num_copy(c, minuend);
1747 if (c->rdx < subtrahend->rdx) {
1748 bc_num_extend(c, subtrahend->rdx - c->rdx);
1751 start = c->rdx - subtrahend->rdx;
1753 bc_num_subArrays(c->num + start, subtrahend->num, subtrahend->len);
1757 RETURN_STATUS(BC_STATUS_SUCCESS); // can't make void, see zbc_num_binary()
1760 static FAST_FUNC BC_STATUS zbc_num_k(BcNum *restrict a, BcNum *restrict b,
1762 #define zbc_num_k(...) (zbc_num_k(__VA_ARGS__) COMMA_SUCCESS)
1765 size_t max = BC_MAX(a->len, b->len), max2 = (max + 1) / 2;
1766 BcNum l1, h1, l2, h2, m2, m1, z0, z1, z2, temp;
1769 if (a->len == 0 || b->len == 0) {
1771 RETURN_STATUS(BC_STATUS_SUCCESS);
1773 aone = BC_NUM_ONE(a);
1774 if (aone || BC_NUM_ONE(b)) {
1775 bc_num_copy(c, aone ? b : a);
1776 RETURN_STATUS(BC_STATUS_SUCCESS);
1779 if (a->len + b->len < BC_NUM_KARATSUBA_LEN
1780 || a->len < BC_NUM_KARATSUBA_LEN
1781 || b->len < BC_NUM_KARATSUBA_LEN
1785 bc_num_expand(c, a->len + b->len + 1);
1787 memset(c->num, 0, sizeof(BcDig) * c->cap);
1790 for (i = 0; i < b->len; ++i) {
1792 for (j = 0; j < a->len; ++j) {
1793 unsigned in = c->num[i + j];
1794 in += (unsigned)a->num[j] * (unsigned)b->num[i] + carry;
1795 // note: compilers prefer _unsigned_ div/const
1797 c->num[i + j] = (BcDig)(in % 10);
1800 c->num[i + j] += (BcDig) carry;
1801 len = BC_MAX(len, i + j + !!carry);
1803 #if ENABLE_FEATURE_BC_SIGNALS
1805 // a*a <- without check below, this will not be interruptible
1806 if (G_interrupt) return BC_STATUS_FAILURE;
1812 RETURN_STATUS(BC_STATUS_SUCCESS);
1815 bc_num_init(&l1, max);
1816 bc_num_init(&h1, max);
1817 bc_num_init(&l2, max);
1818 bc_num_init(&h2, max);
1819 bc_num_init(&m1, max);
1820 bc_num_init(&m2, max);
1821 bc_num_init(&z0, max);
1822 bc_num_init(&z1, max);
1823 bc_num_init(&z2, max);
1824 bc_num_init(&temp, max + max);
1826 bc_num_split(a, max2, &l1, &h1);
1827 bc_num_split(b, max2, &l2, &h2);
1829 s = zbc_num_add(&h1, &l1, &m1, 0);
1831 s = zbc_num_add(&h2, &l2, &m2, 0);
1834 s = zbc_num_k(&h1, &h2, &z0);
1836 s = zbc_num_k(&m1, &m2, &z1);
1838 s = zbc_num_k(&l1, &l2, &z2);
1841 s = zbc_num_sub(&z1, &z0, &temp, 0);
1843 s = zbc_num_sub(&temp, &z2, &z1, 0);
1846 s = zbc_num_shift(&z0, max2 * 2);
1848 s = zbc_num_shift(&z1, max2);
1850 s = zbc_num_add(&z0, &z1, &temp, 0);
1852 s = zbc_num_add(&temp, &z2, c, 0);
1867 static FAST_FUNC BC_STATUS zbc_num_m(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale)
1871 size_t maxrdx = BC_MAX(a->rdx, b->rdx);
1873 scale = BC_MAX(scale, a->rdx);
1874 scale = BC_MAX(scale, b->rdx);
1875 scale = BC_MIN(a->rdx + b->rdx, scale);
1876 maxrdx = BC_MAX(maxrdx, scale);
1878 bc_num_init(&cpa, a->len);
1879 bc_num_init(&cpb, b->len);
1881 bc_num_copy(&cpa, a);
1882 bc_num_copy(&cpb, b);
1883 cpa.neg = cpb.neg = false;
1885 s = zbc_num_shift(&cpa, maxrdx);
1887 s = zbc_num_shift(&cpb, maxrdx);
1889 s = zbc_num_k(&cpa, &cpb, c);
1893 bc_num_expand(c, c->len + maxrdx);
1895 if (c->len < maxrdx) {
1896 memset(c->num + c->len, 0, (c->cap - c->len) * sizeof(BcDig));
1901 bc_num_retireMul(c, scale, a->neg, b->neg);
1907 #define zbc_num_m(...) (zbc_num_m(__VA_ARGS__) COMMA_SUCCESS)
1909 static FAST_FUNC BC_STATUS zbc_num_d(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale)
1916 RETURN_STATUS(bc_error("divide by zero"));
1918 bc_num_setToZero(c, scale);
1919 RETURN_STATUS(BC_STATUS_SUCCESS);
1921 if (BC_NUM_ONE(b)) {
1923 bc_num_retireMul(c, scale, a->neg, b->neg);
1924 RETURN_STATUS(BC_STATUS_SUCCESS);
1927 bc_num_init(&cp, BC_NUM_MREQ(a, b, scale));
1928 bc_num_copy(&cp, a);
1932 bc_num_expand(&cp, len + 2);
1933 bc_num_extend(&cp, len - cp.len);
1936 if (b->rdx > cp.rdx) bc_num_extend(&cp, b->rdx - cp.rdx);
1938 if (scale > cp.rdx) bc_num_extend(&cp, scale - cp.rdx);
1940 if (b->rdx == b->len) {
1942 if (len == 0) break;
1944 if (b->num[len] != 0)
1950 if (cp.cap == cp.len) bc_num_expand(&cp, cp.len + 1);
1952 // We want an extra zero in front to make things simpler.
1953 cp.num[cp.len++] = 0;
1956 bc_num_expand(c, cp.len);
1959 memset(c->num + end, 0, (c->cap - end) * sizeof(BcDig));
1963 s = BC_STATUS_SUCCESS;
1964 for (i = end - 1; i < end; --i) {
1967 for (q = 0; n[len] != 0 || bc_num_compare(n, b->num, len) >= 0; ++q)
1968 bc_num_subArrays(n, b->num, len);
1970 #if ENABLE_FEATURE_BC_SIGNALS
1973 // 1/a <- without check below, this will not be interruptible
1975 s = BC_STATUS_FAILURE;
1981 bc_num_retireMul(c, scale, a->neg, b->neg);
1986 #define zbc_num_d(...) (zbc_num_d(__VA_ARGS__) COMMA_SUCCESS)
1988 static FAST_FUNC BC_STATUS zbc_num_r(BcNum *a, BcNum *b, BcNum *restrict c,
1989 BcNum *restrict d, size_t scale, size_t ts)
1996 RETURN_STATUS(bc_error("divide by zero"));
1999 bc_num_setToZero(d, ts);
2000 RETURN_STATUS(BC_STATUS_SUCCESS);
2003 bc_num_init(&temp, d->cap);
2004 s = zbc_num_d(a, b, c, scale);
2007 if (scale != 0) scale = ts;
2009 s = zbc_num_m(c, b, &temp, scale);
2011 s = zbc_num_sub(a, &temp, d, scale);
2014 if (ts > d->rdx && d->len) bc_num_extend(d, ts - d->rdx);
2017 bc_num_retireMul(d, ts, a->neg, b->neg);
2023 #define zbc_num_r(...) (zbc_num_r(__VA_ARGS__) COMMA_SUCCESS)
2025 static FAST_FUNC BC_STATUS zbc_num_rem(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale)
2029 size_t ts = BC_MAX(scale + b->rdx, a->rdx), len = BC_NUM_MREQ(a, b, ts);
2031 bc_num_init(&c1, len);
2032 s = zbc_num_r(a, b, &c1, c, scale, ts);
2037 #define zbc_num_rem(...) (zbc_num_rem(__VA_ARGS__) COMMA_SUCCESS)
2039 static FAST_FUNC BC_STATUS zbc_num_p(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale)
2041 BcStatus s = BC_STATUS_SUCCESS;
2044 size_t i, powrdx, resrdx;
2047 if (b->rdx) RETURN_STATUS(bc_error("non integer number"));
2051 RETURN_STATUS(BC_STATUS_SUCCESS);
2054 bc_num_setToZero(c, scale);
2055 RETURN_STATUS(BC_STATUS_SUCCESS);
2057 if (BC_NUM_ONE(b)) {
2061 s = zbc_num_inv(a, c, scale);
2068 s = zbc_num_ulong(b, &pow);
2069 if (s) RETURN_STATUS(s);
2071 bc_num_init(©, a->len);
2072 bc_num_copy(©, a);
2077 if (a->rdx * pow < scale)
2078 scale = a->rdx * pow;
2083 for (powrdx = a->rdx; !(pow & 1); pow >>= 1) {
2085 s = zbc_num_mul(©, ©, ©, powrdx);
2087 // Not needed: zbc_num_mul() has a check for ^C:
2088 //if (G_interrupt) {
2089 // s = BC_STATUS_FAILURE;
2094 bc_num_copy(c, ©);
2096 for (resrdx = powrdx, pow >>= 1; pow != 0; pow >>= 1) {
2098 s = zbc_num_mul(©, ©, ©, powrdx);
2103 s = zbc_num_mul(c, ©, c, resrdx);
2106 // Not needed: zbc_num_mul() has a check for ^C:
2107 //if (G_interrupt) {
2108 // s = BC_STATUS_FAILURE;
2114 s = zbc_num_inv(c, c, scale);
2118 if (c->rdx > scale) bc_num_truncate(c, c->rdx - scale);
2120 // We can't use bc_num_clean() here.
2121 for (i = 0; i < c->len; ++i)
2124 bc_num_setToZero(c, scale);
2131 #define zbc_num_p(...) (zbc_num_p(__VA_ARGS__) COMMA_SUCCESS)
2133 static BC_STATUS zbc_num_binary(BcNum *a, BcNum *b, BcNum *c, size_t scale,
2134 BcNumBinaryOp op, size_t req)
2137 BcNum num2, *ptr_a, *ptr_b;
2142 memcpy(ptr_a, c, sizeof(BcNum));
2150 memcpy(ptr_b, c, sizeof(BcNum));
2157 bc_num_init(c, req);
2159 bc_num_expand(c, req);
2161 s = BC_STATUS_SUCCESS;
2162 IF_ERROR_RETURN_POSSIBLE(s =) op(ptr_a, ptr_b, c, scale);
2164 if (init) bc_num_free(&num2);
2168 #define zbc_num_binary(...) (zbc_num_binary(__VA_ARGS__) COMMA_SUCCESS)
2170 static bool bc_num_strValid(const char *val, size_t base)
2175 b = (BcDig)(base <= 10 ? base + '0' : base - 10 + 'A');
2182 if (radix) return false;
2186 if (c < '0' || c >= b || (c > '9' && c < 'A'))
2192 // Note: n is already "bc_num_zero()"ed,
2193 // leading zeroes in "val" are removed
2194 static void bc_num_parseDecimal(BcNum *n, const char *val)
2203 bc_num_expand(n, len);
2205 ptr = strchr(val, '.');
2209 n->rdx = (size_t)((val + len) - (ptr + 1));
2211 for (i = 0; val[i]; ++i) {
2212 if (val[i] != '0' && val[i] != '.') {
2213 // Not entirely zero value - convert it, and exit
2216 n->num[n->len] = val[i] - '0';
2220 if (val[--i] == '.') goto skip_dot;
2225 // if for() exits without hitting if(), the value is entirely zero
2228 // Note: n is already "bc_num_zero()"ed,
2229 // leading zeroes in "val" are removed
2230 static void bc_num_parseBase(BcNum *n, const char *val, unsigned base_t)
2233 BcNum temp, mult, result;
2239 for (i = 0; ; ++i) {
2242 if (val[i] != '.' && val[i] != '0')
2246 bc_num_init_DEF_SIZE(&temp);
2247 bc_num_init_DEF_SIZE(&mult);
2248 //TODO: have BcNumSmall type, with static buffer
2249 bc_num_init_DEF_SIZE(&base);
2250 bc_num_ulong2num(&base, base_t);
2254 if (c == '\0') goto int_err;
2255 if (c == '.') break;
2257 v = (unsigned long) (c <= '9' ? c - '0' : c - 'A' + 10);
2259 s = zbc_num_mul(n, &base, &mult, 0);
2260 if (s) goto int_err;
2261 bc_num_ulong2num(&temp, v);
2262 s = zbc_num_add(&mult, &temp, n, 0);
2263 if (s) goto int_err;
2266 bc_num_init(&result, base.len);
2267 //bc_num_zero(&result); - already is
2273 if (c == '\0') break;
2276 v = (unsigned long) (c <= '9' ? c - '0' : c - 'A' + 10);
2278 s = zbc_num_mul(&result, &base, &result, 0);
2280 bc_num_ulong2num(&temp, v);
2281 s = zbc_num_add(&result, &temp, &result, 0);
2283 s = zbc_num_mul(&mult, &base, &mult, 0);
2287 s = zbc_num_div(&result, &mult, &result, digits);
2289 s = zbc_num_add(n, &result, n, digits);
2293 if (n->rdx < digits)
2294 bc_num_extend(n, digits - n->rdx);
2298 bc_num_free(&result);
2305 static BC_STATUS zbc_num_parse(BcNum *n, const char *val, unsigned base_t)
2307 if (!bc_num_strValid(val, base_t))
2308 RETURN_STATUS(bc_error("bad number string"));
2311 while (*val == '0') val++;
2314 bc_num_parseDecimal(n, val);
2316 bc_num_parseBase(n, val, base_t);
2318 RETURN_STATUS(BC_STATUS_SUCCESS);
2320 #define zbc_num_parse(...) (zbc_num_parse(__VA_ARGS__) COMMA_SUCCESS)
2322 static BC_STATUS zbc_num_sqrt(BcNum *a, BcNum *restrict b, size_t scale)
2325 BcNum num1, num2, half, f, fprime, *x0, *x1, *temp;
2326 size_t pow, len, digs, digs1, resrdx, req, times = 0;
2327 ssize_t cmp = 1, cmp1 = SSIZE_MAX, cmp2 = SSIZE_MAX;
2329 req = BC_MAX(scale, a->rdx) + ((BC_NUM_INT(a) + 1) >> 1) + 1;
2330 bc_num_expand(b, req);
2333 bc_num_setToZero(b, scale);
2334 RETURN_STATUS(BC_STATUS_SUCCESS);
2337 RETURN_STATUS(bc_error("negative number"));
2339 if (BC_NUM_ONE(a)) {
2341 bc_num_extend(b, scale);
2342 RETURN_STATUS(BC_STATUS_SUCCESS);
2345 scale = BC_MAX(scale, a->rdx) + 1;
2346 len = a->len + scale;
2348 bc_num_init(&num1, len);
2349 bc_num_init(&num2, len);
2350 bc_num_init_DEF_SIZE(&half);
2356 bc_num_init(&f, len);
2357 bc_num_init(&fprime, len);
2363 pow = BC_NUM_INT(a);
2371 pow -= 2 - (pow & 1);
2373 bc_num_extend(x0, pow);
2375 // Make sure to move the radix back.
2379 x0->rdx = digs = digs1 = 0;
2381 len = BC_NUM_INT(x0) + resrdx - 1;
2383 while (cmp != 0 || digs < len) {
2384 s = zbc_num_div(a, x0, &f, resrdx);
2386 s = zbc_num_add(x0, &f, &fprime, resrdx);
2388 s = zbc_num_mul(&fprime, &half, x1, resrdx);
2391 cmp = bc_num_cmp(x1, x0);
2392 digs = x1->len - (unsigned long long) llabs(cmp);
2394 if (cmp == cmp2 && digs == digs1)
2399 resrdx += times > 4;
2412 if (b->rdx > scale) bc_num_truncate(b, b->rdx - scale);
2414 bc_num_free(&fprime);
2421 #define zbc_num_sqrt(...) (zbc_num_sqrt(__VA_ARGS__) COMMA_SUCCESS)
2423 static BC_STATUS zbc_num_divmod(BcNum *a, BcNum *b, BcNum *c, BcNum *d,
2429 size_t ts = BC_MAX(scale + b->rdx, a->rdx), len = BC_NUM_MREQ(a, b, ts);
2432 memcpy(&num2, c, sizeof(BcNum));
2434 bc_num_init(c, len);
2438 bc_num_expand(c, len);
2441 s = zbc_num_r(ptr_a, b, c, d, scale, ts);
2443 if (init) bc_num_free(&num2);
2447 #define zbc_num_divmod(...) (zbc_num_divmod(__VA_ARGS__) COMMA_SUCCESS)
2450 static BC_STATUS zdc_num_modexp(BcNum *a, BcNum *b, BcNum *c, BcNum *restrict d)
2453 BcNum base, exp, two, temp;
2456 RETURN_STATUS(bc_error("divide by zero"));
2457 if (a->rdx || b->rdx || c->rdx)
2458 RETURN_STATUS(bc_error("non integer number"));
2460 RETURN_STATUS(bc_error("negative number"));
2462 bc_num_expand(d, c->len);
2463 bc_num_init(&base, c->len);
2464 bc_num_init(&exp, b->len);
2465 bc_num_init_DEF_SIZE(&two);
2466 bc_num_init(&temp, b->len);
2472 s = zbc_num_rem(a, c, &base, 0);
2474 bc_num_copy(&exp, b);
2476 while (exp.len != 0) {
2477 s = zbc_num_divmod(&exp, &two, &exp, &temp, 0);
2480 if (BC_NUM_ONE(&temp)) {
2481 s = zbc_num_mul(d, &base, &temp, 0);
2483 s = zbc_num_rem(&temp, c, d, 0);
2487 s = zbc_num_mul(&base, &base, &temp, 0);
2489 s = zbc_num_rem(&temp, c, &base, 0);
2499 #define zdc_num_modexp(...) (zdc_num_modexp(__VA_ARGS__) COMMA_SUCCESS)
2503 static BC_STATUS zbc_func_insert(BcFunc *f, char *name, bool var)
2509 autoid = (void*)f->autos.v;
2510 for (i = 0; i < f->autos.len; i++, autoid++) {
2511 if (strcmp(name, autoid->name) == 0)
2512 RETURN_STATUS(bc_error("function parameter or auto var has the same name as another"));
2518 bc_vec_push(&f->autos, &a);
2520 RETURN_STATUS(BC_STATUS_SUCCESS);
2522 #define zbc_func_insert(...) (zbc_func_insert(__VA_ARGS__) COMMA_SUCCESS)
2525 static void bc_func_init(BcFunc *f)
2527 bc_char_vec_init(&f->code);
2528 IF_BC(bc_vec_init(&f->labels, sizeof(size_t), NULL);)
2529 IF_BC(bc_vec_init(&f->autos, sizeof(BcId), bc_id_free);)
2530 IF_BC(f->nparams = 0;)
2533 static FAST_FUNC void bc_func_free(void *func)
2535 BcFunc *f = (BcFunc *) func;
2536 bc_vec_free(&f->code);
2537 IF_BC(bc_vec_free(&f->labels);)
2538 IF_BC(bc_vec_free(&f->autos);)
2541 static void bc_array_expand(BcVec *a, size_t len);
2543 static void bc_array_init(BcVec *a, bool nums)
2546 bc_vec_init(a, sizeof(BcNum), bc_num_free);
2548 bc_vec_init(a, sizeof(BcVec), bc_vec_free);
2549 bc_array_expand(a, 1);
2552 static void bc_array_expand(BcVec *a, size_t len)
2554 if (a->dtor == bc_num_free
2555 // && a->size == sizeof(BcNum) - always true
2558 while (len > a->len) {
2559 bc_num_init_DEF_SIZE(&n);
2564 while (len > a->len) {
2565 bc_array_init(&v, true);
2571 static void bc_array_copy(BcVec *d, const BcVec *s)
2577 bc_vec_expand(d, s->cap);
2582 for (i = 0; i < s->len; i++, dnum++, snum++) {
2583 bc_num_init(dnum, snum->len);
2584 bc_num_copy(dnum, snum);
2588 static FAST_FUNC void bc_string_free(void *string)
2590 free(*((char **) string));
2594 static void dc_result_copy(BcResult *d, BcResult *src)
2599 case BC_RESULT_TEMP:
2600 case BC_RESULT_IBASE:
2601 case BC_RESULT_SCALE:
2602 case BC_RESULT_OBASE:
2603 bc_num_init(&d->d.n, src->d.n.len);
2604 bc_num_copy(&d->d.n, &src->d.n);
2607 case BC_RESULT_ARRAY:
2608 case BC_RESULT_ARRAY_ELEM:
2609 d->d.id.name = xstrdup(src->d.id.name);
2611 case BC_RESULT_CONSTANT:
2612 case BC_RESULT_LAST:
2615 memcpy(&d->d.n, &src->d.n, sizeof(BcNum));
2621 static FAST_FUNC void bc_result_free(void *result)
2623 BcResult *r = (BcResult *) result;
2626 case BC_RESULT_TEMP:
2627 case BC_RESULT_IBASE:
2628 case BC_RESULT_SCALE:
2629 case BC_RESULT_OBASE:
2630 bc_num_free(&r->d.n);
2633 case BC_RESULT_ARRAY:
2634 case BC_RESULT_ARRAY_ELEM:
2643 static void bc_lex_lineComment(BcLex *l)
2645 // Try: echo -n '#foo' | bc
2647 l->t.t = BC_LEX_WHITESPACE;
2649 while (i < l->len && l->buf[i] != '\n')
2654 static void bc_lex_whitespace(BcLex *l)
2656 l->t.t = BC_LEX_WHITESPACE;
2658 char c = l->buf[l->i];
2659 if (c == '\n') // this is BC_LEX_NLINE, not BC_LEX_WHITESPACE
2667 static BC_STATUS zbc_lex_number(BcLex *l, char start)
2669 const char *buf = l->buf + l->i;
2670 size_t len, i, ccnt;
2673 pt = (start == '.');
2674 l->t.t = BC_LEX_NUMBER;
2680 if (c == '\\' && buf[i + 1] == '\n') {
2682 //number_of_backslashes++ - see comment below
2685 if (!isdigit(c) && (c < 'A' || c > 'F')) {
2686 if (c != '.') break;
2687 // if '.' was already seen, stop on second one:
2691 // buf[i] is one of "0-9A-F."
2696 //ccnt is the number of chars in the number string, excluding possible
2697 //trailing "[\<newline>].[\<newline>]" (with any number of \<NL> repetitions).
2698 //i is buf[i] index of the first not-yet-parsed char after that.
2701 // This might overestimate the size, if there are "\<NL>"'s
2702 // in the number. Subtracting number_of_backslashes*2 correctly
2703 // is not that easy: consider that in the case of "NNN.\<NL>"
2704 // loop above will count "\<NL>" before it realizes it is not
2705 // in fact *inside* the number:
2706 len = ccnt + 1; // +1 byte for NUL termination
2708 // This check makes sense only if size_t is (much) larger than BC_MAX_NUM.
2709 if (SIZE_MAX > (BC_MAX_NUM | 0xff)) {
2710 if (len > BC_MAX_NUM)
2711 RETURN_STATUS(bc_error("number too long: must be [1,"BC_MAX_NUM_STR"]"));
2714 bc_vec_pop_all(&l->t.v);
2715 bc_vec_expand(&l->t.v, 1 + len);
2716 bc_vec_push(&l->t.v, &start);
2719 // If we have hit a backslash, skip it. We don't have
2720 // to check for a newline because it's guaranteed.
2726 bc_vec_push(&l->t.v, buf);
2731 bc_vec_pushZeroByte(&l->t.v);
2733 RETURN_STATUS(BC_STATUS_SUCCESS);
2735 #define zbc_lex_number(...) (zbc_lex_number(__VA_ARGS__) COMMA_SUCCESS)
2737 static void bc_lex_name(BcLex *l)
2742 l->t.t = BC_LEX_NAME;
2745 buf = l->buf + l->i - 1;
2748 if ((c < 'a' || c > 'z') && !isdigit(c) && c != '_') break;
2752 #if 0 // We do not protect against people with gigabyte-long names
2753 // This check makes sense only if size_t is (much) larger than BC_MAX_STRING.
2754 if (SIZE_MAX > (BC_MAX_STRING | 0xff)) {
2755 if (i > BC_MAX_STRING)
2756 return bc_error("name too long: must be [1,"BC_MAX_STRING_STR"]");
2759 bc_vec_string(&l->t.v, i, buf);
2761 // Increment the index. We minus 1 because it has already been incremented.
2764 //return BC_STATUS_SUCCESS;
2767 static void bc_lex_init(BcLex *l)
2769 bc_char_vec_init(&l->t.v);
2772 static void bc_lex_free(BcLex *l)
2774 bc_vec_free(&l->t.v);
2777 static void bc_lex_file(BcLex *l)
2779 G.err_line = l->line = 1;
2783 IF_BC(static BC_STATUS zbc_lex_token(BcLex *l);)
2784 IF_DC(static BC_STATUS zdc_lex_token(BcLex *l);)
2786 static BC_STATUS zcommon_lex_token(BcLex *l)
2789 IF_BC(RETURN_STATUS(zbc_lex_token(l));)
2791 IF_DC(RETURN_STATUS(zdc_lex_token(l));)
2793 #define zcommon_lex_token(...) (zcommon_lex_token(__VA_ARGS__) COMMA_SUCCESS)
2795 static bool bc_lex_more_input(BcLex *l)
2800 bc_vec_pop_all(&G.input_buffer);
2802 // This loop is complex because the vm tries not to send any lines that end
2803 // with a backslash to the parser. The reason for that is because the parser
2804 // treats a backslash+newline combo as whitespace, per the bc spec. In that
2805 // case, and for strings and comments, the parser will expect more stuff.
2809 size_t prevlen = G.input_buffer.len;
2812 bc_read_line(&G.input_buffer, G.input_fp);
2813 // No more input means EOF
2814 if (G.input_buffer.len <= prevlen + 1) // (we expect +1 for NUL byte)
2817 string = G.input_buffer.v + prevlen;
2820 if (string == G.input_buffer.v || string[-1] != '\\') {
2831 if (c == '/' && *string == '*') {
2836 if (c == '*' && *string == '/') {
2841 if (str != 0 || comment) {
2842 G.input_buffer.len--; // backstep over the trailing NUL byte
2846 // Check for backslash+newline.
2847 // we do not check that last char is '\n' -
2848 // if it is not, then it's EOF, and looping back
2849 // to bc_read_line() will detect it:
2851 if (string >= G.input_buffer.v && *string == '\\') {
2852 G.input_buffer.len--;
2859 l->buf = G.input_buffer.v;
2861 // bb_error_msg("G.input_buffer.len:%d '%s'", G.input_buffer.len, G.input_buffer.v);
2862 l->len = G.input_buffer.len - 1; // do not include NUL
2867 static BC_STATUS zbc_lex_next(BcLex *l)
2872 if (l->t.last == BC_LEX_EOF) RETURN_STATUS(bc_error("end of file"));
2874 l->line += l->newline;
2875 G.err_line = l->line;
2878 // Loop until failure or we don't have whitespace. This
2879 // is so the parser doesn't get inundated with whitespace.
2880 // Comments are also BC_LEX_WHITESPACE tokens and eaten here.
2881 s = BC_STATUS_SUCCESS;
2883 if (l->i == l->len) {
2884 l->t.t = BC_LEX_EOF;
2886 RETURN_STATUS(BC_STATUS_SUCCESS);
2887 if (!bc_lex_more_input(l)) {
2889 RETURN_STATUS(BC_STATUS_SUCCESS);
2891 // here it's guaranteed that l->i is below l->len
2893 dbg_lex("next string to parse:'%.*s'",
2894 (int)(strchrnul(l->buf + l->i, '\n') - (l->buf + l->i)),
2896 s = zcommon_lex_token(l);
2897 } while (!s && l->t.t == BC_LEX_WHITESPACE);
2898 dbg_lex("l->t.t from string:%d", l->t.t);
2902 #define zbc_lex_next(...) (zbc_lex_next(__VA_ARGS__) COMMA_SUCCESS)
2905 static BC_STATUS zbc_lex_skip_if_at_NLINE(BcLex *l)
2907 if (l->t.t == BC_LEX_NLINE)
2908 RETURN_STATUS(zbc_lex_next(l));
2909 RETURN_STATUS(BC_STATUS_SUCCESS);
2911 #define zbc_lex_skip_if_at_NLINE(...) (zbc_lex_skip_if_at_NLINE(__VA_ARGS__) COMMA_SUCCESS)
2913 static BC_STATUS zbc_lex_next_and_skip_NLINE(BcLex *l)
2916 s = zbc_lex_next(l);
2917 if (s) RETURN_STATUS(s);
2918 // if(cond)<newline>stmt is accepted too (but not 2+ newlines)
2919 s = zbc_lex_skip_if_at_NLINE(l);
2922 #define zbc_lex_next_and_skip_NLINE(...) (zbc_lex_next_and_skip_NLINE(__VA_ARGS__) COMMA_SUCCESS)
2925 static BC_STATUS zbc_lex_text_init(BcLex *l, const char *text)
2929 l->len = strlen(text);
2930 l->t.t = l->t.last = BC_LEX_INVALID;
2931 RETURN_STATUS(zbc_lex_next(l));
2933 #define zbc_lex_text_init(...) (zbc_lex_text_init(__VA_ARGS__) COMMA_SUCCESS)
2936 static BC_STATUS zbc_lex_identifier(BcLex *l)
2940 const char *buf = l->buf + l->i - 1;
2942 for (i = 0; i < ARRAY_SIZE(bc_lex_kws); ++i) {
2943 const char *keyword8 = bc_lex_kws[i].name8;
2945 while (buf[j] != '\0' && buf[j] == keyword8[j]) {
2947 if (j == 8) goto match;
2949 if (keyword8[j] != '\0')
2952 // buf starts with keyword bc_lex_kws[i]
2953 if (isalnum(buf[j]) || buf[j]=='_')
2954 continue; // "ifz" does not match "if" keyword, "if." does
2955 l->t.t = BC_LEX_KEY_1st_keyword + i;
2956 if (!bc_lex_kws_POSIX(i)) {
2957 s = bc_posix_error_fmt("%sthe '%.8s' keyword", "POSIX does not allow ", bc_lex_kws[i].name8);
2958 IF_ERROR_RETURN_POSSIBLE(if (s) RETURN_STATUS(s));
2961 // We minus 1 because the index has already been incremented.
2963 RETURN_STATUS(BC_STATUS_SUCCESS);
2967 s = BC_STATUS_SUCCESS;
2969 if (l->t.v.len > 2) {
2972 // bc: POSIX only allows one character names; the following is bad: 'qwe=1
2974 unsigned len = strchrnul(buf, '\n') - buf;
2975 s = bc_posix_error_fmt("POSIX only allows one character names; the following is bad: '%.*s'", len, buf);
2980 #define zbc_lex_identifier(...) (zbc_lex_identifier(__VA_ARGS__) COMMA_SUCCESS)
2982 static BC_STATUS zbc_lex_string(BcLex *l)
2986 l->t.t = BC_LEX_STR;
2994 RETURN_STATUS(bc_error("string end could not be found"));
3003 // This check makes sense only if size_t is (much) larger than BC_MAX_STRING.
3004 if (SIZE_MAX > (BC_MAX_STRING | 0xff)) {
3005 if (len > BC_MAX_STRING)
3006 RETURN_STATUS(bc_error("string too long: must be [1,"BC_MAX_STRING_STR"]"));
3008 bc_vec_string(&l->t.v, len, l->buf + l->i);
3012 G.err_line = l->line;
3014 RETURN_STATUS(BC_STATUS_SUCCESS);
3016 #define zbc_lex_string(...) (zbc_lex_string(__VA_ARGS__) COMMA_SUCCESS)
3018 static void bc_lex_assign(BcLex *l, unsigned with_and_without)
3020 if (l->buf[l->i] == '=') {
3022 with_and_without >>= 8; // store "with" value
3023 } // else store "without" value
3024 l->t.t = (with_and_without & 0xff);
3026 #define bc_lex_assign(l, with, without) \
3027 bc_lex_assign(l, ((with)<<8)|(without))
3029 static BC_STATUS zbc_lex_comment(BcLex *l)
3032 const char *buf = l->buf;
3034 l->t.t = BC_LEX_WHITESPACE;
3035 i = l->i; /* here buf[l->i] is the '*' of opening comment delimiter */
3047 RETURN_STATUS(bc_error("comment end could not be found"));
3054 G.err_line = l->line;
3056 RETURN_STATUS(BC_STATUS_SUCCESS);
3058 #define zbc_lex_comment(...) (zbc_lex_comment(__VA_ARGS__) COMMA_SUCCESS)
3060 static BC_STATUS zbc_lex_token(BcLex *l)
3062 BcStatus s = BC_STATUS_SUCCESS;
3063 char c = l->buf[l->i++], c2;
3065 // This is the workhorse of the lexer.
3067 // case '\0': // probably never reached
3069 // l->t.t = BC_LEX_EOF;
3070 // l->newline = true;
3073 l->t.t = BC_LEX_NLINE;
3081 bc_lex_whitespace(l);
3084 bc_lex_assign(l, BC_LEX_OP_REL_NE, BC_LEX_OP_BOOL_NOT);
3085 if (l->t.t == BC_LEX_OP_BOOL_NOT) {
3086 s = bc_POSIX_does_not_allow_bool_ops_this_is_bad("!");
3087 IF_ERROR_RETURN_POSSIBLE(if (s) RETURN_STATUS(s));
3091 s = zbc_lex_string(l);
3094 s = bc_POSIX_does_not_allow("'#' script comments");
3095 IF_ERROR_RETURN_POSSIBLE(if (s) RETURN_STATUS(s));
3096 bc_lex_lineComment(l);
3099 bc_lex_assign(l, BC_LEX_OP_ASSIGN_MODULUS, BC_LEX_OP_MODULUS);
3104 s = bc_POSIX_does_not_allow_bool_ops_this_is_bad("&&");
3105 IF_ERROR_RETURN_POSSIBLE(if (s) RETURN_STATUS(s));
3107 l->t.t = BC_LEX_OP_BOOL_AND;
3109 l->t.t = BC_LEX_INVALID;
3110 s = bc_error_bad_character('&');
3115 l->t.t = (BcLexType)(c - '(' + BC_LEX_LPAREN);
3118 bc_lex_assign(l, BC_LEX_OP_ASSIGN_MULTIPLY, BC_LEX_OP_MULTIPLY);
3124 l->t.t = BC_LEX_OP_INC;
3126 bc_lex_assign(l, BC_LEX_OP_ASSIGN_PLUS, BC_LEX_OP_PLUS);
3129 l->t.t = BC_LEX_COMMA;
3135 l->t.t = BC_LEX_OP_DEC;
3137 bc_lex_assign(l, BC_LEX_OP_ASSIGN_MINUS, BC_LEX_OP_MINUS);
3140 if (isdigit(l->buf[l->i]))
3141 s = zbc_lex_number(l, c);
3143 l->t.t = BC_LEX_KEY_LAST;
3144 s = bc_POSIX_does_not_allow("a period ('.') as a shortcut for the last result");
3150 s = zbc_lex_comment(l);
3152 bc_lex_assign(l, BC_LEX_OP_ASSIGN_DIVIDE, BC_LEX_OP_DIVIDE);
3170 s = zbc_lex_number(l, c);
3173 l->t.t = BC_LEX_SCOLON;
3176 bc_lex_assign(l, BC_LEX_OP_REL_LE, BC_LEX_OP_REL_LT);
3179 bc_lex_assign(l, BC_LEX_OP_REL_EQ, BC_LEX_OP_ASSIGN);
3182 bc_lex_assign(l, BC_LEX_OP_REL_GE, BC_LEX_OP_REL_GT);
3186 l->t.t = (BcLexType)(c - '[' + BC_LEX_LBRACKET);
3189 if (l->buf[l->i] == '\n') {
3190 l->t.t = BC_LEX_WHITESPACE;
3193 s = bc_error_bad_character(c);
3196 bc_lex_assign(l, BC_LEX_OP_ASSIGN_POWER, BC_LEX_OP_POWER);
3224 s = zbc_lex_identifier(l);
3228 l->t.t = (BcLexType)(c - '{' + BC_LEX_LBRACE);
3233 s = bc_POSIX_does_not_allow_bool_ops_this_is_bad("||");
3234 IF_ERROR_RETURN_POSSIBLE(if (s) RETURN_STATUS(s));
3236 l->t.t = BC_LEX_OP_BOOL_OR;
3238 l->t.t = BC_LEX_INVALID;
3239 s = bc_error_bad_character(c);
3243 l->t.t = BC_LEX_INVALID;
3244 s = bc_error_bad_character(c);
3253 static BC_STATUS zdc_lex_register(BcLex *l)
3255 if (isspace(l->buf[l->i - 1])) {
3256 bc_lex_whitespace(l);
3259 RETURN_STATUS(bc_error("extended register"));
3263 bc_vec_pop_all(&l->t.v);
3264 bc_vec_push(&l->t.v, &l->buf[l->i - 1]);
3265 bc_vec_pushZeroByte(&l->t.v);
3266 l->t.t = BC_LEX_NAME;
3269 RETURN_STATUS(BC_STATUS_SUCCESS);
3271 #define zdc_lex_register(...) (zdc_lex_register(__VA_ARGS__) COMMA_SUCCESS)
3273 static BC_STATUS zdc_lex_string(BcLex *l)
3275 size_t depth, nls, i;
3277 l->t.t = BC_LEX_STR;
3278 bc_vec_pop_all(&l->t.v);
3287 RETURN_STATUS(bc_error("string end could not be found"));
3290 if (i == l->i || l->buf[i - 1] != '\\') {
3291 if (c == '[') depth++;
3296 bc_vec_push(&l->t.v, &l->buf[i]);
3301 bc_vec_pushZeroByte(&l->t.v);
3302 // This check makes sense only if size_t is (much) larger than BC_MAX_STRING.
3303 if (SIZE_MAX > (BC_MAX_STRING | 0xff)) {
3304 if (i - l->i > BC_MAX_STRING)
3305 RETURN_STATUS(bc_error("string too long: must be [1,"BC_MAX_STRING_STR"]"));
3310 G.err_line = l->line;
3312 RETURN_STATUS(BC_STATUS_SUCCESS);
3314 #define zdc_lex_string(...) (zdc_lex_string(__VA_ARGS__) COMMA_SUCCESS)
3316 static BC_STATUS zdc_lex_token(BcLex *l)
3318 static const //BcLexType - should be this type, but narrower type saves size:
3321 BC_LEX_OP_REL_EQ, BC_LEX_OP_REL_LE, BC_LEX_OP_REL_GE, BC_LEX_OP_REL_NE,
3322 BC_LEX_OP_REL_LT, BC_LEX_OP_REL_GT, BC_LEX_SCOLON, BC_LEX_COLON,
3323 BC_LEX_ELSE, BC_LEX_LOAD, BC_LEX_LOAD_POP, BC_LEX_OP_ASSIGN,
3326 static const //BcLexType - should be this type
3330 BC_LEX_OP_MODULUS, BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_LPAREN,
3332 BC_LEX_INVALID, BC_LEX_OP_MULTIPLY, BC_LEX_OP_PLUS, BC_LEX_INVALID,
3334 BC_LEX_OP_MINUS, BC_LEX_INVALID, BC_LEX_OP_DIVIDE,
3336 BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID,
3337 BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID,
3338 BC_LEX_INVALID, BC_LEX_INVALID,
3340 BC_LEX_COLON, BC_LEX_SCOLON, BC_LEX_OP_REL_GT, BC_LEX_OP_REL_EQ,
3341 BC_LEX_OP_REL_LT, BC_LEX_KEY_READ, BC_LEX_INVALID,
3343 BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID,
3344 BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_EQ_NO_REG, BC_LEX_INVALID,
3346 BC_LEX_KEY_IBASE, BC_LEX_INVALID, BC_LEX_KEY_SCALE, BC_LEX_LOAD_POP,
3347 BC_LEX_INVALID, BC_LEX_OP_BOOL_NOT, BC_LEX_KEY_OBASE, BC_LEX_PRINT_STREAM,
3349 BC_LEX_NQUIT, BC_LEX_POP, BC_LEX_STORE_PUSH, BC_LEX_INVALID, BC_LEX_INVALID,
3350 BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_SCALE_FACTOR, BC_LEX_INVALID,
3352 BC_LEX_KEY_LENGTH, BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID,
3354 BC_LEX_OP_POWER, BC_LEX_NEG, BC_LEX_INVALID,
3356 BC_LEX_ASCIIFY, BC_LEX_INVALID, BC_LEX_CLEAR_STACK, BC_LEX_DUPLICATE,
3357 BC_LEX_ELSE, BC_LEX_PRINT_STACK, BC_LEX_INVALID, BC_LEX_INVALID,
3359 BC_LEX_STORE_IBASE, BC_LEX_INVALID, BC_LEX_STORE_SCALE, BC_LEX_LOAD,
3360 BC_LEX_INVALID, BC_LEX_PRINT_POP, BC_LEX_STORE_OBASE, BC_LEX_KEY_PRINT,
3362 BC_LEX_KEY_QUIT, BC_LEX_SWAP, BC_LEX_OP_ASSIGN, BC_LEX_INVALID,
3363 BC_LEX_INVALID, BC_LEX_KEY_SQRT, BC_LEX_INVALID, BC_LEX_EXECUTE,
3365 BC_LEX_INVALID, BC_LEX_STACK_LEVEL,
3367 BC_LEX_LBRACE, BC_LEX_OP_MODEXP, BC_LEX_INVALID, BC_LEX_OP_DIVMOD,
3370 BcStatus s = BC_STATUS_SUCCESS;
3371 char c = l->buf[l->i++], c2;
3374 for (i = 0; i < ARRAY_SIZE(dc_lex_regs); ++i) {
3375 if (l->t.last == dc_lex_regs[i])
3376 RETURN_STATUS(zdc_lex_register(l));
3379 if (c >= '%' && c <= '~'
3380 && (l->t.t = dc_lex_tokens[c - '%']) != BC_LEX_INVALID
3385 // This is the workhorse of the lexer.
3387 // case '\0': // probably never reached
3388 // l->t.t = BC_LEX_EOF;
3396 l->newline = (c == '\n');
3397 bc_lex_whitespace(l);
3402 l->t.t = BC_LEX_OP_REL_NE;
3404 l->t.t = BC_LEX_OP_REL_LE;
3406 l->t.t = BC_LEX_OP_REL_GE;
3408 RETURN_STATUS(bc_error_bad_character(c));
3412 bc_lex_lineComment(l);
3415 if (isdigit(l->buf[l->i]))
3416 s = zbc_lex_number(l, c);
3418 s = bc_error_bad_character(c);
3436 s = zbc_lex_number(l, c);
3439 s = zdc_lex_string(l);
3442 l->t.t = BC_LEX_INVALID;
3443 s = bc_error_bad_character(c);
3451 static void bc_parse_push(BcParse *p, char i)
3453 dbg_compile("%s:%d pushing bytecode %zd:%d", __func__, __LINE__, p->func->code.len, i);
3454 bc_vec_pushByte(&p->func->code, i);
3457 static void bc_parse_pushName(BcParse *p, char *name)
3460 bc_parse_push(p, *name++);
3461 bc_parse_push(p, BC_PARSE_STREND);
3464 static void bc_parse_pushIndex(BcParse *p, size_t idx)
3469 dbg_lex("%s:%d pushing index %zd", __func__, __LINE__, idx);
3470 mask = ((size_t)0xff) << (sizeof(idx) * 8 - 8);
3473 if (idx & mask) break;
3478 bc_parse_push(p, amt);
3481 bc_parse_push(p, (unsigned char)idx);
3487 static void bc_parse_pushJUMP(BcParse *p, size_t idx)
3489 bc_parse_push(p, BC_INST_JUMP);
3490 bc_parse_pushIndex(p, idx);
3493 static void bc_parse_pushJUMP_ZERO(BcParse *p, size_t idx)
3495 bc_parse_push(p, BC_INST_JUMP_ZERO);
3496 bc_parse_pushIndex(p, idx);
3499 static BC_STATUS bc_parse_pushSTR(BcParse *p)
3501 char *str = xstrdup(p->l.t.v.v);
3503 bc_parse_push(p, BC_INST_STR);
3504 bc_parse_pushIndex(p, G.prog.strs.len);
3505 bc_vec_push(&G.prog.strs, &str);
3507 RETURN_STATUS(zbc_lex_next(&p->l));
3509 #define bc_parse_pushSTR(...) (bc_parse_pushSTR(__VA_ARGS__) COMMA_SUCCESS)
3512 static void bc_parse_pushNUM(BcParse *p)
3514 char *num = xstrdup(p->l.t.v.v);
3515 size_t idx = G.prog.consts.len;
3517 bc_vec_push(&G.prog.consts, &num);
3519 bc_parse_push(p, BC_INST_NUM);
3520 bc_parse_pushIndex(p, idx);
3523 IF_BC(static BC_STATUS zbc_parse_stmt_or_funcdef(BcParse *p);)
3524 IF_DC(static BC_STATUS zdc_parse_parse(BcParse *p);)
3526 // "Parse" half of "parse,execute,repeat" main loop
3527 static BC_STATUS zcommon_parse(BcParse *p)
3530 // FIXME: "eating" of stmt delemiters is coded inconsistently
3531 // (sometimes zbc_parse_stmt() eats the delimiter, sometimes don't),
3532 // which causes bugs such as "print 1 print 2" erroneously accepted,
3533 // or "print 1 else 2" detecting parse error only after executing
3535 IF_BC(RETURN_STATUS(zbc_parse_stmt_or_funcdef(p));)
3537 IF_DC(RETURN_STATUS(zdc_parse_parse(p));)
3539 #define zcommon_parse(...) (zcommon_parse(__VA_ARGS__) COMMA_SUCCESS)
3541 static BC_STATUS zbc_parse_text_init(BcParse *p, const char *text)
3543 p->func = bc_program_func(p->fidx);
3545 RETURN_STATUS(zbc_lex_text_init(&p->l, text));
3547 #define zbc_parse_text_init(...) (zbc_parse_text_init(__VA_ARGS__) COMMA_SUCCESS)
3549 // Called when parsing or execution detects a failure,
3550 // resets execution structures.
3551 static void bc_program_reset(void)
3556 bc_vec_npop(&G.prog.exestack, G.prog.exestack.len - 1);
3557 bc_vec_pop_all(&G.prog.results);
3559 f = bc_program_func(0);
3560 ip = bc_vec_top(&G.prog.exestack);
3561 ip->idx = f->code.len;
3564 // Called when zbc/zdc_parse_parse() detects a failure,
3565 // resets parsing structures.
3566 static void bc_parse_reset(BcParse *p)
3568 if (p->fidx != BC_PROG_MAIN) {
3569 bc_vec_pop_all(&p->func->code);
3570 IF_BC(bc_vec_pop_all(&p->func->labels);)
3571 IF_BC(bc_vec_pop_all(&p->func->autos);)
3572 IF_BC(p->func->nparams = 0;)
3574 p->fidx = BC_PROG_MAIN;
3575 p->func = bc_program_func_BC_PROG_MAIN();
3579 p->l.t.t = BC_LEX_EOF;
3581 IF_BC(bc_vec_pop_all(&p->exits);)
3582 IF_BC(bc_vec_pop_all(&p->conds);)
3583 IF_BC(bc_vec_pop_all(&p->ops);)
3588 static void bc_parse_free(BcParse *p)
3590 IF_BC(bc_vec_free(&p->exits);)
3591 IF_BC(bc_vec_free(&p->conds);)
3592 IF_BC(bc_vec_free(&p->ops);)
3596 static void bc_parse_create(BcParse *p, size_t fidx)
3598 memset(p, 0, sizeof(BcParse));
3601 IF_BC(bc_vec_init(&p->exits, sizeof(size_t), NULL);)
3602 IF_BC(bc_vec_init(&p->conds, sizeof(size_t), NULL);)
3603 IF_BC(bc_vec_init(&p->ops, sizeof(BcLexType), NULL);)
3606 p->func = bc_program_func(fidx);
3609 static void bc_program_add_fn(void)
3614 //idx = G.prog.fns.len;
3615 bc_vec_push(&G.prog.fns, &f);
3621 // Note: takes ownership of 'name' (must be malloced)
3622 static size_t bc_program_addFunc(char *name)
3625 BcId entry, *entry_ptr;
3629 entry.idx = G.prog.fns.len;
3631 inserted = bc_map_insert(&G.prog.fn_map, &entry, &idx);
3632 if (!inserted) free(name);
3634 entry_ptr = bc_vec_item(&G.prog.fn_map, idx);
3635 idx = entry_ptr->idx;
3638 // There is already a function with this name.
3639 // It'll be redefined now, clear old definition.
3640 BcFunc *func = bc_program_func(entry_ptr->idx);
3644 bc_program_add_fn();
3650 #define BC_PARSE_TOP_OP(p) (*((BcLexType *) bc_vec_top(&(p)->ops)))
3651 #define BC_PARSE_LEAF(p, rparen) \
3652 (((p) >= BC_INST_NUM && (p) <= BC_INST_SQRT) || (rparen) || \
3653 (p) == BC_INST_INC_POST || (p) == BC_INST_DEC_POST)
3655 // We can calculate the conversion between tokens and exprs by subtracting the
3656 // position of the first operator in the lex enum and adding the position of the
3657 // first in the expr enum. Note: This only works for binary operators.
3658 #define BC_TOKEN_2_INST(t) ((char) ((t) - BC_LEX_NEG + BC_INST_NEG))
3660 static BcStatus bc_parse_expr_empty_ok(BcParse *p, uint8_t flags);
3662 static BC_STATUS zbc_parse_expr(BcParse *p, uint8_t flags)
3666 s = bc_parse_expr_empty_ok(p, flags);
3667 if (s == BC_STATUS_PARSE_EMPTY_EXP)
3668 RETURN_STATUS(bc_error("empty expression"));
3671 #define zbc_parse_expr(...) (zbc_parse_expr(__VA_ARGS__) COMMA_SUCCESS)
3673 static BC_STATUS zbc_parse_stmt_possibly_auto(BcParse *p, bool auto_allowed);
3674 #define zbc_parse_stmt_possibly_auto(...) (zbc_parse_stmt_possibly_auto(__VA_ARGS__) COMMA_SUCCESS)
3676 static BC_STATUS zbc_parse_stmt(BcParse *p)
3678 RETURN_STATUS(zbc_parse_stmt_possibly_auto(p, false));
3680 #define zbc_parse_stmt(...) (zbc_parse_stmt(__VA_ARGS__) COMMA_SUCCESS)
3682 static BC_STATUS zbc_parse_stmt_allow_NLINE_before(BcParse *p, const char *after_X)
3684 // "if(cond)<newline>stmt" is accepted too, but not 2+ newlines.
3685 // Same for "else", "while()", "for()".
3686 BcStatus s = zbc_lex_next_and_skip_NLINE(&p->l);
3687 if (s) RETURN_STATUS(s);
3688 if (p->l.t.t == BC_LEX_NLINE)
3689 RETURN_STATUS(bc_error_fmt("no statement after '%s'", after_X));
3691 RETURN_STATUS(zbc_parse_stmt(p));
3693 #define zbc_parse_stmt_allow_NLINE_before(...) (zbc_parse_stmt_allow_NLINE_before(__VA_ARGS__) COMMA_SUCCESS)
3695 static void bc_parse_operator(BcParse *p, BcLexType type, size_t start,
3698 char l, r = bc_parse_op_PREC(type - BC_LEX_OP_INC);
3699 bool left = bc_parse_op_LEFT(type - BC_LEX_OP_INC);
3701 while (p->ops.len > start) {
3702 BcLexType t = BC_PARSE_TOP_OP(p);
3703 if (t == BC_LEX_LPAREN) break;
3705 l = bc_parse_op_PREC(t - BC_LEX_OP_INC);
3706 if (l >= r && (l != r || !left)) break;
3708 bc_parse_push(p, BC_TOKEN_2_INST(t));
3709 bc_vec_pop(&p->ops);
3710 *nexprs -= (t != BC_LEX_OP_BOOL_NOT && t != BC_LEX_NEG);
3713 bc_vec_push(&p->ops, &type);
3716 static BC_STATUS zbc_parse_rightParen(BcParse *p, size_t ops_bgn, size_t *nexs)
3720 if (p->ops.len <= ops_bgn)
3721 RETURN_STATUS(bc_error_bad_expression());
3722 top = BC_PARSE_TOP_OP(p);
3724 while (top != BC_LEX_LPAREN) {
3725 bc_parse_push(p, BC_TOKEN_2_INST(top));
3727 bc_vec_pop(&p->ops);
3728 *nexs -= top != BC_LEX_OP_BOOL_NOT && top != BC_LEX_NEG;
3730 if (p->ops.len <= ops_bgn)
3731 RETURN_STATUS(bc_error_bad_expression());
3732 top = BC_PARSE_TOP_OP(p);
3735 bc_vec_pop(&p->ops);
3737 RETURN_STATUS(zbc_lex_next(&p->l));
3739 #define zbc_parse_rightParen(...) (zbc_parse_rightParen(__VA_ARGS__) COMMA_SUCCESS)
3741 static BC_STATUS zbc_parse_params(BcParse *p, uint8_t flags)
3746 dbg_lex("%s:%d p->l.t.t:%d", __func__, __LINE__, p->l.t.t);
3747 flags = (flags & ~(BC_PARSE_PRINT | BC_PARSE_REL)) | BC_PARSE_ARRAY;
3749 s = zbc_lex_next(&p->l);
3750 if (s) RETURN_STATUS(s);
3753 if (p->l.t.t != BC_LEX_RPAREN) {
3755 s = zbc_parse_expr(p, flags);
3756 if (s) RETURN_STATUS(s);
3758 if (p->l.t.t != BC_LEX_COMMA) {
3759 if (p->l.t.t == BC_LEX_RPAREN)
3761 RETURN_STATUS(bc_error_bad_token());
3763 s = zbc_lex_next(&p->l);
3764 if (s) RETURN_STATUS(s);
3768 bc_parse_push(p, BC_INST_CALL);
3769 bc_parse_pushIndex(p, nparams);
3771 RETURN_STATUS(BC_STATUS_SUCCESS);
3773 #define zbc_parse_params(...) (zbc_parse_params(__VA_ARGS__) COMMA_SUCCESS)
3775 // Note: takes ownership of 'name' (must be malloced)
3776 static BC_STATUS zbc_parse_call(BcParse *p, char *name, uint8_t flags)
3779 BcId entry, *entry_ptr;
3784 s = zbc_parse_params(p, flags);
3787 if (p->l.t.t != BC_LEX_RPAREN) {
3788 s = bc_error_bad_token();
3792 idx = bc_map_find_exact(&G.prog.fn_map, &entry);
3794 if (idx == BC_VEC_INVALID_IDX) {
3795 // No such function exists, create an empty one
3796 bc_program_addFunc(name);
3797 idx = bc_map_find_exact(&G.prog.fn_map, &entry);
3801 entry_ptr = bc_vec_item(&G.prog.fn_map, idx);
3802 bc_parse_pushIndex(p, entry_ptr->idx);
3804 RETURN_STATUS(zbc_lex_next(&p->l));
3809 #define zbc_parse_call(...) (zbc_parse_call(__VA_ARGS__) COMMA_SUCCESS)
3811 static BC_STATUS zbc_parse_name(BcParse *p, BcInst *type, uint8_t flags)
3816 name = xstrdup(p->l.t.v.v);
3817 s = zbc_lex_next(&p->l);
3820 if (p->l.t.t == BC_LEX_LBRACKET) {
3821 s = zbc_lex_next(&p->l);
3824 if (p->l.t.t == BC_LEX_RBRACKET) {
3825 if (!(flags & BC_PARSE_ARRAY)) {
3826 s = bc_error_bad_expression();
3829 *type = BC_INST_ARRAY;
3831 *type = BC_INST_ARRAY_ELEM;
3832 flags &= ~(BC_PARSE_PRINT | BC_PARSE_REL);
3833 s = zbc_parse_expr(p, flags);
3836 s = zbc_lex_next(&p->l);
3838 bc_parse_push(p, *type);
3839 bc_parse_pushName(p, name);
3841 } else if (p->l.t.t == BC_LEX_LPAREN) {
3842 if (flags & BC_PARSE_NOCALL) {
3843 s = bc_error_bad_token();
3846 *type = BC_INST_CALL;
3847 s = zbc_parse_call(p, name, flags);
3849 *type = BC_INST_VAR;
3850 bc_parse_push(p, BC_INST_VAR);
3851 bc_parse_pushName(p, name);
3860 #define zbc_parse_name(...) (zbc_parse_name(__VA_ARGS__) COMMA_SUCCESS)
3862 static BC_STATUS zbc_parse_read(BcParse *p)
3866 s = zbc_lex_next(&p->l);
3867 if (s) RETURN_STATUS(s);
3868 if (p->l.t.t != BC_LEX_LPAREN) RETURN_STATUS(bc_error_bad_token());
3870 s = zbc_lex_next(&p->l);
3871 if (s) RETURN_STATUS(s);
3872 if (p->l.t.t != BC_LEX_RPAREN) RETURN_STATUS(bc_error_bad_token());
3874 bc_parse_push(p, BC_INST_READ);
3876 RETURN_STATUS(zbc_lex_next(&p->l));
3878 #define zbc_parse_read(...) (zbc_parse_read(__VA_ARGS__) COMMA_SUCCESS)
3880 static BC_STATUS zbc_parse_builtin(BcParse *p, BcLexType type, uint8_t flags,
3885 s = zbc_lex_next(&p->l);
3886 if (s) RETURN_STATUS(s);
3887 if (p->l.t.t != BC_LEX_LPAREN) RETURN_STATUS(bc_error_bad_token());
3889 flags = (flags & ~(BC_PARSE_PRINT | BC_PARSE_REL)) | BC_PARSE_ARRAY;
3891 s = zbc_lex_next(&p->l);
3892 if (s) RETURN_STATUS(s);
3894 s = zbc_parse_expr(p, flags);
3895 if (s) RETURN_STATUS(s);
3897 if (p->l.t.t != BC_LEX_RPAREN) RETURN_STATUS(bc_error_bad_token());
3899 *prev = (type == BC_LEX_KEY_LENGTH) ? BC_INST_LENGTH : BC_INST_SQRT;
3900 bc_parse_push(p, *prev);
3902 RETURN_STATUS(zbc_lex_next(&p->l));
3904 #define zbc_parse_builtin(...) (zbc_parse_builtin(__VA_ARGS__) COMMA_SUCCESS)
3906 static BC_STATUS zbc_parse_scale(BcParse *p, BcInst *type, uint8_t flags)
3910 s = zbc_lex_next(&p->l);
3911 if (s) RETURN_STATUS(s);
3913 if (p->l.t.t != BC_LEX_LPAREN) {
3914 *type = BC_INST_SCALE;
3915 bc_parse_push(p, BC_INST_SCALE);
3916 RETURN_STATUS(BC_STATUS_SUCCESS);
3919 *type = BC_INST_SCALE_FUNC;
3920 flags &= ~(BC_PARSE_PRINT | BC_PARSE_REL);
3922 s = zbc_lex_next(&p->l);
3923 if (s) RETURN_STATUS(s);
3925 s = zbc_parse_expr(p, flags);
3926 if (s) RETURN_STATUS(s);
3927 if (p->l.t.t != BC_LEX_RPAREN)
3928 RETURN_STATUS(bc_error_bad_token());
3929 bc_parse_push(p, BC_INST_SCALE_FUNC);
3931 RETURN_STATUS(zbc_lex_next(&p->l));
3933 #define zbc_parse_scale(...) (zbc_parse_scale(__VA_ARGS__) COMMA_SUCCESS)
3935 static BC_STATUS zbc_parse_incdec(BcParse *p, BcInst *prev, bool *paren_expr,
3936 size_t *nexprs, uint8_t flags)
3941 BcInst etype = *prev;
3943 if (etype == BC_INST_VAR || etype == BC_INST_ARRAY_ELEM
3944 || etype == BC_INST_SCALE || etype == BC_INST_LAST
3945 || etype == BC_INST_IBASE || etype == BC_INST_OBASE
3947 *prev = inst = BC_INST_INC_POST + (p->l.t.t != BC_LEX_OP_INC);
3948 bc_parse_push(p, inst);
3949 s = zbc_lex_next(&p->l);
3951 *prev = inst = BC_INST_INC_PRE + (p->l.t.t != BC_LEX_OP_INC);
3954 s = zbc_lex_next(&p->l);
3955 if (s) RETURN_STATUS(s);
3958 // Because we parse the next part of the expression
3959 // right here, we need to increment this.
3960 *nexprs = *nexprs + 1;
3964 s = zbc_parse_name(p, prev, flags | BC_PARSE_NOCALL);
3966 case BC_LEX_KEY_IBASE:
3967 case BC_LEX_KEY_LAST:
3968 case BC_LEX_KEY_OBASE:
3969 bc_parse_push(p, type - BC_LEX_KEY_IBASE + BC_INST_IBASE);
3970 s = zbc_lex_next(&p->l);
3972 case BC_LEX_KEY_SCALE:
3973 s = zbc_lex_next(&p->l);
3974 if (s) RETURN_STATUS(s);
3975 if (p->l.t.t == BC_LEX_LPAREN)
3976 s = bc_error_bad_token();
3978 bc_parse_push(p, BC_INST_SCALE);
3981 s = bc_error_bad_token();
3985 if (!s) bc_parse_push(p, inst);
3990 #define zbc_parse_incdec(...) (zbc_parse_incdec(__VA_ARGS__) COMMA_SUCCESS)
3992 static BC_STATUS zbc_parse_minus(BcParse *p, BcInst *prev, size_t ops_bgn,
3993 bool rparen, size_t *nexprs)
3997 BcInst etype = *prev;
3999 s = zbc_lex_next(&p->l);
4000 if (s) RETURN_STATUS(s);
4002 type = rparen || etype == BC_INST_INC_POST || etype == BC_INST_DEC_POST ||
4003 (etype >= BC_INST_NUM && etype <= BC_INST_SQRT) ?
4006 *prev = BC_TOKEN_2_INST(type);
4008 // We can just push onto the op stack because this is the largest
4009 // precedence operator that gets pushed. Inc/dec does not.
4010 if (type != BC_LEX_OP_MINUS)
4011 bc_vec_push(&p->ops, &type);
4013 bc_parse_operator(p, type, ops_bgn, nexprs);
4017 #define zbc_parse_minus(...) (zbc_parse_minus(__VA_ARGS__) COMMA_SUCCESS)
4019 static BC_STATUS zbc_parse_print(BcParse *p)
4025 s = zbc_lex_next(&p->l);
4026 if (s) RETURN_STATUS(s);
4028 if (type == BC_LEX_STR) {
4029 s = bc_parse_pushSTR(p);
4031 s = zbc_parse_expr(p, 0);
4033 if (s) RETURN_STATUS(s);
4034 bc_parse_push(p, BC_INST_PRINT_POP);
4035 if (p->l.t.t != BC_LEX_COMMA)
4041 #define zbc_parse_print(...) (zbc_parse_print(__VA_ARGS__) COMMA_SUCCESS)
4043 static BC_STATUS zbc_parse_return(BcParse *p)
4048 dbg_lex_enter("%s:%d entered", __func__, __LINE__);
4049 s = zbc_lex_next(&p->l);
4050 if (s) RETURN_STATUS(s);
4053 if (t == BC_LEX_NLINE || t == BC_LEX_SCOLON)
4054 bc_parse_push(p, BC_INST_RET0);
4056 bool paren = (t == BC_LEX_LPAREN);
4057 s = bc_parse_expr_empty_ok(p, 0);
4058 if (s == BC_STATUS_PARSE_EMPTY_EXP) {
4059 bc_parse_push(p, BC_INST_RET0);
4060 s = zbc_lex_next(&p->l);
4062 if (s) RETURN_STATUS(s);
4064 if (!paren || p->l.t.last != BC_LEX_RPAREN) {
4065 s = bc_POSIX_requires("parentheses around return expressions");
4066 IF_ERROR_RETURN_POSSIBLE(if (s) RETURN_STATUS(s));
4069 bc_parse_push(p, BC_INST_RET);
4072 dbg_lex_done("%s:%d done", __func__, __LINE__);
4075 #define zbc_parse_return(...) (zbc_parse_return(__VA_ARGS__) COMMA_SUCCESS)
4077 static void rewrite_label_to_current(BcParse *p, size_t idx)
4079 size_t *label = bc_vec_item(&p->func->labels, idx);
4080 *label = p->func->code.len;
4083 static BC_STATUS zbc_parse_if(BcParse *p)
4088 dbg_lex_enter("%s:%d entered", __func__, __LINE__);
4089 s = zbc_lex_next(&p->l);
4090 if (s) RETURN_STATUS(s);
4091 if (p->l.t.t != BC_LEX_LPAREN) RETURN_STATUS(bc_error_bad_token());
4093 s = zbc_lex_next(&p->l);
4094 if (s) RETURN_STATUS(s);
4095 s = zbc_parse_expr(p, BC_PARSE_REL);
4096 if (s) RETURN_STATUS(s);
4098 if (p->l.t.t != BC_LEX_RPAREN) RETURN_STATUS(bc_error_bad_token());
4100 ip_idx = p->func->labels.len;
4101 bc_parse_pushJUMP_ZERO(p, ip_idx);
4102 bc_vec_push(&p->func->labels, &ip_idx);
4104 s = zbc_parse_stmt_allow_NLINE_before(p, STRING_if);
4105 if (s) RETURN_STATUS(s);
4107 dbg_lex("%s:%d in if after stmt: p->l.t.t:%d", __func__, __LINE__, p->l.t.t);
4108 if (p->l.t.t == BC_LEX_KEY_ELSE) {
4111 ip2_idx = p->func->labels.len;
4113 dbg_lex("%s:%d after if() body: BC_INST_JUMP to %zd", __func__, __LINE__, ip2_idx);
4114 bc_parse_pushJUMP(p, ip2_idx);
4116 dbg_lex("%s:%d rewriting 'if_zero' label to jump to 'else'-> %zd", __func__, __LINE__, p->func->code.len);
4117 rewrite_label_to_current(p, ip_idx);
4119 bc_vec_push(&p->func->labels, &ip2_idx);
4122 s = zbc_parse_stmt_allow_NLINE_before(p, STRING_else);
4123 if (s) RETURN_STATUS(s);
4126 dbg_lex("%s:%d rewriting label to jump after 'if' body-> %zd", __func__, __LINE__, p->func->code.len);
4127 rewrite_label_to_current(p, ip_idx);
4129 dbg_lex_done("%s:%d done", __func__, __LINE__);
4132 #define zbc_parse_if(...) (zbc_parse_if(__VA_ARGS__) COMMA_SUCCESS)
4134 static BC_STATUS zbc_parse_while(BcParse *p)
4140 s = zbc_lex_next(&p->l);
4141 if (s) RETURN_STATUS(s);
4142 if (p->l.t.t != BC_LEX_LPAREN) RETURN_STATUS(bc_error_bad_token());
4143 s = zbc_lex_next(&p->l);
4144 if (s) RETURN_STATUS(s);
4146 cond_idx = p->func->labels.len;
4147 ip_idx = cond_idx + 1;
4149 bc_vec_push(&p->func->labels, &p->func->code.len);
4150 bc_vec_push(&p->conds, &cond_idx);
4152 bc_vec_push(&p->exits, &ip_idx);
4153 bc_vec_push(&p->func->labels, &ip_idx);
4155 s = zbc_parse_expr(p, BC_PARSE_REL);
4156 if (s) RETURN_STATUS(s);
4157 if (p->l.t.t != BC_LEX_RPAREN) RETURN_STATUS(bc_error_bad_token());
4159 bc_parse_pushJUMP_ZERO(p, ip_idx);
4161 s = zbc_parse_stmt_allow_NLINE_before(p, STRING_while);
4162 if (s) RETURN_STATUS(s);
4164 dbg_lex("%s:%d BC_INST_JUMP to %zd", __func__, __LINE__, cond_idx);
4165 bc_parse_pushJUMP(p, cond_idx);
4167 dbg_lex("%s:%d rewriting label-> %zd", __func__, __LINE__, p->func->code.len);
4168 rewrite_label_to_current(p, ip_idx);
4170 bc_vec_pop(&p->exits);
4171 bc_vec_pop(&p->conds);
4175 #define zbc_parse_while(...) (zbc_parse_while(__VA_ARGS__) COMMA_SUCCESS)
4177 static BC_STATUS zbc_parse_for(BcParse *p)
4180 size_t cond_idx, exit_idx, body_idx, update_idx;
4182 dbg_lex("%s:%d p->l.t.t:%d", __func__, __LINE__, p->l.t.t);
4183 s = zbc_lex_next(&p->l);
4184 if (s) RETURN_STATUS(s);
4185 if (p->l.t.t != BC_LEX_LPAREN) RETURN_STATUS(bc_error_bad_token());
4186 s = zbc_lex_next(&p->l);
4187 if (s) RETURN_STATUS(s);
4189 if (p->l.t.t != BC_LEX_SCOLON)
4190 s = zbc_parse_expr(p, 0);
4192 s = bc_POSIX_does_not_allow_empty_X_expression_in_for("init");
4194 if (s) RETURN_STATUS(s);
4195 if (p->l.t.t != BC_LEX_SCOLON) RETURN_STATUS(bc_error_bad_token());
4196 s = zbc_lex_next(&p->l);
4197 if (s) RETURN_STATUS(s);
4199 cond_idx = p->func->labels.len;
4200 update_idx = cond_idx + 1;
4201 body_idx = update_idx + 1;
4202 exit_idx = body_idx + 1;
4204 bc_vec_push(&p->func->labels, &p->func->code.len);
4206 if (p->l.t.t != BC_LEX_SCOLON)
4207 s = zbc_parse_expr(p, BC_PARSE_REL);
4209 // Set this for the next call to bc_parse_number.
4210 // This is safe to set because the current token is a semicolon,
4211 // which has no string requirement.
4212 bc_vec_string(&p->l.t.v, 1, "1");
4213 bc_parse_pushNUM(p);
4214 s = bc_POSIX_does_not_allow_empty_X_expression_in_for("condition");
4217 if (s) RETURN_STATUS(s);
4218 if (p->l.t.t != BC_LEX_SCOLON) RETURN_STATUS(bc_error_bad_token());
4220 s = zbc_lex_next(&p->l);
4221 if (s) RETURN_STATUS(s);
4223 bc_parse_pushJUMP_ZERO(p, exit_idx);
4224 bc_parse_pushJUMP(p, body_idx);
4226 bc_vec_push(&p->conds, &update_idx);
4227 bc_vec_push(&p->func->labels, &p->func->code.len);
4229 if (p->l.t.t != BC_LEX_RPAREN)
4230 s = zbc_parse_expr(p, 0);
4232 s = bc_POSIX_does_not_allow_empty_X_expression_in_for("update");
4234 if (s) RETURN_STATUS(s);
4236 if (p->l.t.t != BC_LEX_RPAREN) RETURN_STATUS(bc_error_bad_token());
4237 bc_parse_pushJUMP(p, cond_idx);
4238 bc_vec_push(&p->func->labels, &p->func->code.len);
4240 bc_vec_push(&p->exits, &exit_idx);
4241 bc_vec_push(&p->func->labels, &exit_idx);
4243 s = zbc_parse_stmt_allow_NLINE_before(p, STRING_for);
4244 if (s) RETURN_STATUS(s);
4246 dbg_lex("%s:%d BC_INST_JUMP to %zd", __func__, __LINE__, update_idx);
4247 bc_parse_pushJUMP(p, update_idx);
4249 dbg_lex("%s:%d rewriting label-> %zd", __func__, __LINE__, p->func->code.len);
4250 rewrite_label_to_current(p, exit_idx);
4252 bc_vec_pop(&p->exits);
4253 bc_vec_pop(&p->conds);
4255 RETURN_STATUS(BC_STATUS_SUCCESS);
4257 #define zbc_parse_for(...) (zbc_parse_for(__VA_ARGS__) COMMA_SUCCESS)
4259 static BC_STATUS zbc_parse_break_or_continue(BcParse *p, BcLexType type)
4264 if (type == BC_LEX_KEY_BREAK) {
4265 if (p->exits.len == 0) // none of the enclosing blocks is a loop
4266 RETURN_STATUS(bc_error_bad_token());
4267 i = *(size_t*)bc_vec_top(&p->exits);
4269 i = *(size_t*)bc_vec_top(&p->conds);
4272 bc_parse_pushJUMP(p, i);
4274 s = zbc_lex_next(&p->l);
4275 if (s) RETURN_STATUS(s);
4277 if (p->l.t.t != BC_LEX_SCOLON && p->l.t.t != BC_LEX_NLINE)
4278 RETURN_STATUS(bc_error_bad_token());
4280 RETURN_STATUS(zbc_lex_next(&p->l));
4282 #define zbc_parse_break_or_continue(...) (zbc_parse_break_or_continue(__VA_ARGS__) COMMA_SUCCESS)
4284 static BC_STATUS zbc_parse_funcdef(BcParse *p)
4287 bool var, comma = false;
4290 dbg_lex_enter("%s:%d entered", __func__, __LINE__);
4291 s = zbc_lex_next(&p->l);
4292 if (s) RETURN_STATUS(s);
4293 if (p->l.t.t != BC_LEX_NAME)
4294 RETURN_STATUS(bc_error("bad function definition"));
4296 name = xstrdup(p->l.t.v.v);
4297 p->fidx = bc_program_addFunc(name);
4298 p->func = bc_program_func(p->fidx);
4300 s = zbc_lex_next(&p->l);
4301 if (s) RETURN_STATUS(s);
4302 if (p->l.t.t != BC_LEX_LPAREN)
4303 RETURN_STATUS(bc_error("bad function definition"));
4304 s = zbc_lex_next(&p->l);
4305 if (s) RETURN_STATUS(s);
4307 while (p->l.t.t != BC_LEX_RPAREN) {
4308 if (p->l.t.t != BC_LEX_NAME)
4309 RETURN_STATUS(bc_error("bad function definition"));
4313 name = xstrdup(p->l.t.v.v);
4314 s = zbc_lex_next(&p->l);
4317 var = p->l.t.t != BC_LEX_LBRACKET;
4320 s = zbc_lex_next(&p->l);
4323 if (p->l.t.t != BC_LEX_RBRACKET) {
4324 s = bc_error("bad function definition");
4328 s = zbc_lex_next(&p->l);
4332 comma = p->l.t.t == BC_LEX_COMMA;
4334 s = zbc_lex_next(&p->l);
4338 s = zbc_func_insert(p->func, name, var);
4342 if (comma) RETURN_STATUS(bc_error("bad function definition"));
4344 s = zbc_lex_next(&p->l);
4345 if (s) RETURN_STATUS(s);
4347 if (p->l.t.t != BC_LEX_LBRACE)
4348 s = bc_POSIX_requires("the left brace be on the same line as the function header");
4350 // Prevent "define z()<newline>" from being interpreted as function with empty stmt as body
4351 s = zbc_lex_skip_if_at_NLINE(&p->l);
4352 if (s) RETURN_STATUS(s);
4353 //GNU bc requires a {} block even if function body has single stmt, enforce this?
4354 if (p->l.t.t != BC_LEX_LBRACE)
4355 RETURN_STATUS(bc_error("function { body } expected"));
4357 p->in_funcdef++; // to determine whether "return" stmt is allowed, and such
4358 s = zbc_parse_stmt_possibly_auto(p, true);
4360 if (s) RETURN_STATUS(s);
4362 bc_parse_push(p, BC_INST_RET0);
4364 // Subsequent code generation is into main program
4365 p->fidx = BC_PROG_MAIN;
4366 p->func = bc_program_func_BC_PROG_MAIN();
4368 dbg_lex_done("%s:%d done", __func__, __LINE__);
4371 dbg_lex_done("%s:%d done (error)", __func__, __LINE__);
4375 #define zbc_parse_funcdef(...) (zbc_parse_funcdef(__VA_ARGS__) COMMA_SUCCESS)
4377 static BC_STATUS zbc_parse_auto(BcParse *p)
4380 bool comma, var, one;
4383 dbg_lex_enter("%s:%d entered", __func__, __LINE__);
4384 s = zbc_lex_next(&p->l);
4385 if (s) RETURN_STATUS(s);
4388 one = p->l.t.t == BC_LEX_NAME;
4390 while (p->l.t.t == BC_LEX_NAME) {
4391 name = xstrdup(p->l.t.v.v);
4392 s = zbc_lex_next(&p->l);
4395 var = p->l.t.t != BC_LEX_LBRACKET;
4397 s = zbc_lex_next(&p->l);
4400 if (p->l.t.t != BC_LEX_RBRACKET) {
4401 s = bc_error("bad function definition");
4405 s = zbc_lex_next(&p->l);
4409 comma = p->l.t.t == BC_LEX_COMMA;
4411 s = zbc_lex_next(&p->l);
4415 s = zbc_func_insert(p->func, name, var);
4419 if (comma) RETURN_STATUS(bc_error("bad function definition"));
4420 if (!one) RETURN_STATUS(bc_error("no auto variable found"));
4422 if (p->l.t.t != BC_LEX_NLINE && p->l.t.t != BC_LEX_SCOLON)
4423 RETURN_STATUS(bc_error_bad_token());
4425 dbg_lex_done("%s:%d done", __func__, __LINE__);
4426 RETURN_STATUS(zbc_lex_next(&p->l));
4429 dbg_lex_done("%s:%d done (ERROR)", __func__, __LINE__);
4432 #define zbc_parse_auto(...) (zbc_parse_auto(__VA_ARGS__) COMMA_SUCCESS)
4434 #undef zbc_parse_stmt_possibly_auto
4435 static BC_STATUS zbc_parse_stmt_possibly_auto(BcParse *p, bool auto_allowed)
4437 BcStatus s = BC_STATUS_SUCCESS;
4439 dbg_lex_enter("%s:%d entered, p->l.t.t:%d", __func__, __LINE__, p->l.t.t);
4441 if (p->l.t.t == BC_LEX_NLINE) {
4442 dbg_lex_done("%s:%d done (seen BC_LEX_NLINE)", __func__, __LINE__);
4443 RETURN_STATUS(zbc_lex_next(&p->l));
4445 if (p->l.t.t == BC_LEX_SCOLON) {
4446 dbg_lex_done("%s:%d done (seen BC_LEX_SCOLON)", __func__, __LINE__);
4447 RETURN_STATUS(zbc_lex_next(&p->l));
4450 if (p->l.t.t == BC_LEX_LBRACE) {
4451 dbg_lex("%s:%d BC_LEX_LBRACE: (auto_allowed:%d)", __func__, __LINE__, auto_allowed);
4453 s = zbc_lex_next(&p->l);
4454 if (s) RETURN_STATUS(s);
4455 } while (p->l.t.t == BC_LEX_NLINE);
4456 if (auto_allowed && p->l.t.t == BC_LEX_KEY_AUTO) {
4457 dbg_lex("%s:%d calling zbc_parse_auto()", __func__, __LINE__);
4458 s = zbc_parse_auto(p);
4459 if (s) RETURN_STATUS(s);
4461 while (p->l.t.t != BC_LEX_RBRACE) {
4462 dbg_lex("%s:%d block parsing loop", __func__, __LINE__);
4463 s = zbc_parse_stmt(p);
4464 if (s) RETURN_STATUS(s);
4466 s = zbc_lex_next(&p->l);
4467 dbg_lex_done("%s:%d done (seen BC_LEX_RBRACE)", __func__, __LINE__);
4471 dbg_lex("%s:%d p->l.t.t:%d", __func__, __LINE__, p->l.t.t);
4475 case BC_LEX_OP_MINUS:
4476 case BC_LEX_OP_BOOL_NOT:
4480 case BC_LEX_KEY_IBASE:
4481 case BC_LEX_KEY_LAST:
4482 case BC_LEX_KEY_LENGTH:
4483 case BC_LEX_KEY_OBASE:
4484 case BC_LEX_KEY_READ:
4485 case BC_LEX_KEY_SCALE:
4486 case BC_LEX_KEY_SQRT:
4487 s = zbc_parse_expr(p, BC_PARSE_PRINT);
4490 s = bc_parse_pushSTR(p);
4491 bc_parse_push(p, BC_INST_PRINT_STR);
4493 case BC_LEX_KEY_BREAK:
4494 case BC_LEX_KEY_CONTINUE:
4495 s = zbc_parse_break_or_continue(p, p->l.t.t);
4497 case BC_LEX_KEY_FOR:
4498 s = zbc_parse_for(p);
4500 case BC_LEX_KEY_HALT:
4501 bc_parse_push(p, BC_INST_HALT);
4502 s = zbc_lex_next(&p->l);
4505 s = zbc_parse_if(p);
4507 case BC_LEX_KEY_LIMITS:
4508 // "limits" is a compile-time command,
4509 // the output is produced at _parse time_.
4511 "BC_BASE_MAX = "BC_MAX_OBASE_STR "\n"
4512 "BC_DIM_MAX = "BC_MAX_DIM_STR "\n"
4513 "BC_SCALE_MAX = "BC_MAX_SCALE_STR "\n"
4514 "BC_STRING_MAX = "BC_MAX_STRING_STR"\n"
4515 "BC_NAME_MAX = "BC_MAX_NAME_STR "\n"
4516 "BC_NUM_MAX = "BC_MAX_NUM_STR "\n"
4517 "MAX Exponent = "BC_MAX_EXP_STR "\n"
4518 "Number of vars = "BC_MAX_VARS_STR "\n"
4520 s = zbc_lex_next(&p->l);
4522 case BC_LEX_KEY_PRINT:
4523 s = zbc_parse_print(p);
4525 case BC_LEX_KEY_QUIT:
4526 // "quit" is a compile-time command. For example,
4527 // "if (0 == 1) quit" terminates when parsing the statement,
4528 // not when it is executed
4529 QUIT_OR_RETURN_TO_MAIN;
4530 case BC_LEX_KEY_RETURN:
4532 RETURN_STATUS(bc_error("'return' not in a function"));
4533 s = zbc_parse_return(p);
4535 case BC_LEX_KEY_WHILE:
4536 s = zbc_parse_while(p);
4539 s = bc_error_bad_token();
4543 if (s || G_interrupt) {
4545 s = BC_STATUS_FAILURE;
4548 dbg_lex_done("%s:%d done", __func__, __LINE__);
4551 #define zbc_parse_stmt_possibly_auto(...) (zbc_parse_stmt_possibly_auto(__VA_ARGS__) COMMA_SUCCESS)
4553 static BC_STATUS zbc_parse_stmt_or_funcdef(BcParse *p)
4557 dbg_lex_enter("%s:%d entered", __func__, __LINE__);
4558 if (p->l.t.t == BC_LEX_EOF)
4559 s = bc_error("end of file");
4560 else if (p->l.t.t == BC_LEX_KEY_DEFINE) {
4561 dbg_lex("%s:%d p->l.t.t:BC_LEX_KEY_DEFINE", __func__, __LINE__);
4562 s = zbc_parse_funcdef(p);
4564 dbg_lex("%s:%d p->l.t.t:%d (not BC_LEX_KEY_DEFINE)", __func__, __LINE__, p->l.t.t);
4565 s = zbc_parse_stmt(p);
4568 dbg_lex_done("%s:%d done", __func__, __LINE__);
4571 #define zbc_parse_stmt_or_funcdef(...) (zbc_parse_stmt_or_funcdef(__VA_ARGS__) COMMA_SUCCESS)
4573 // This is not a "z" function: can also return BC_STATUS_PARSE_EMPTY_EXP
4574 static BcStatus bc_parse_expr_empty_ok(BcParse *p, uint8_t flags)
4576 BcStatus s = BC_STATUS_SUCCESS;
4577 BcInst prev = BC_INST_PRINT;
4578 BcLexType top, t = p->l.t.t;
4579 size_t nexprs = 0, ops_bgn = p->ops.len;
4580 unsigned nparens, nrelops;
4581 bool paren_first, paren_expr, rprn, done, get_token, assign, bin_last;
4583 dbg_lex_enter("%s:%d entered", __func__, __LINE__);
4584 paren_first = p->l.t.t == BC_LEX_LPAREN;
4585 nparens = nrelops = 0;
4586 paren_expr = rprn = done = get_token = assign = false;
4589 for (; !G_interrupt && !s && !done && bc_parse_exprs(t); t = p->l.t.t) {
4593 s = zbc_parse_incdec(p, &prev, &paren_expr, &nexprs, flags);
4594 rprn = get_token = bin_last = false;
4596 case BC_LEX_OP_MINUS:
4597 s = zbc_parse_minus(p, &prev, ops_bgn, rprn, &nexprs);
4598 rprn = get_token = false;
4599 bin_last = prev == BC_INST_MINUS;
4601 case BC_LEX_OP_ASSIGN_POWER:
4602 case BC_LEX_OP_ASSIGN_MULTIPLY:
4603 case BC_LEX_OP_ASSIGN_DIVIDE:
4604 case BC_LEX_OP_ASSIGN_MODULUS:
4605 case BC_LEX_OP_ASSIGN_PLUS:
4606 case BC_LEX_OP_ASSIGN_MINUS:
4607 case BC_LEX_OP_ASSIGN:
4608 if (prev != BC_INST_VAR && prev != BC_INST_ARRAY_ELEM
4609 && prev != BC_INST_SCALE && prev != BC_INST_IBASE
4610 && prev != BC_INST_OBASE && prev != BC_INST_LAST
4612 s = bc_error("bad assignment:"
4613 " left side must be variable"
4615 ); // note: shared string
4619 case BC_LEX_OP_POWER:
4620 case BC_LEX_OP_MULTIPLY:
4621 case BC_LEX_OP_DIVIDE:
4622 case BC_LEX_OP_MODULUS:
4623 case BC_LEX_OP_PLUS:
4624 case BC_LEX_OP_REL_EQ:
4625 case BC_LEX_OP_REL_LE:
4626 case BC_LEX_OP_REL_GE:
4627 case BC_LEX_OP_REL_NE:
4628 case BC_LEX_OP_REL_LT:
4629 case BC_LEX_OP_REL_GT:
4630 case BC_LEX_OP_BOOL_NOT:
4631 case BC_LEX_OP_BOOL_OR:
4632 case BC_LEX_OP_BOOL_AND:
4633 if (((t == BC_LEX_OP_BOOL_NOT) != bin_last)
4634 || (t != BC_LEX_OP_BOOL_NOT && prev == BC_INST_BOOL_NOT)
4636 return bc_error_bad_expression();
4638 nrelops += t >= BC_LEX_OP_REL_EQ && t <= BC_LEX_OP_REL_GT;
4639 prev = BC_TOKEN_2_INST(t);
4640 bc_parse_operator(p, t, ops_bgn, &nexprs);
4641 s = zbc_lex_next(&p->l);
4642 rprn = get_token = false;
4643 bin_last = t != BC_LEX_OP_BOOL_NOT;
4646 if (BC_PARSE_LEAF(prev, rprn))
4647 return bc_error_bad_expression();
4649 paren_expr = rprn = bin_last = false;
4651 bc_vec_push(&p->ops, &t);
4654 if (bin_last || prev == BC_INST_BOOL_NOT)
4655 return bc_error_bad_expression();
4657 s = BC_STATUS_SUCCESS;
4663 dbg_lex_done("%s:%d done (returning EMPTY_EXP)", __func__, __LINE__);
4664 return BC_STATUS_PARSE_EMPTY_EXP;
4667 paren_expr = rprn = true;
4668 get_token = bin_last = false;
4669 s = zbc_parse_rightParen(p, ops_bgn, &nexprs);
4672 if (BC_PARSE_LEAF(prev, rprn))
4673 return bc_error_bad_expression();
4675 rprn = get_token = bin_last = false;
4676 s = zbc_parse_name(p, &prev, flags & ~BC_PARSE_NOCALL);
4680 if (BC_PARSE_LEAF(prev, rprn))
4681 return bc_error_bad_expression();
4682 bc_parse_pushNUM(p);
4685 paren_expr = get_token = true;
4686 rprn = bin_last = false;
4688 case BC_LEX_KEY_IBASE:
4689 case BC_LEX_KEY_LAST:
4690 case BC_LEX_KEY_OBASE:
4691 if (BC_PARSE_LEAF(prev, rprn))
4692 return bc_error_bad_expression();
4693 prev = (char) (t - BC_LEX_KEY_IBASE + BC_INST_IBASE);
4694 bc_parse_push(p, (char) prev);
4695 paren_expr = get_token = true;
4696 rprn = bin_last = false;
4699 case BC_LEX_KEY_LENGTH:
4700 case BC_LEX_KEY_SQRT:
4701 if (BC_PARSE_LEAF(prev, rprn))
4702 return bc_error_bad_expression();
4703 s = zbc_parse_builtin(p, t, flags, &prev);
4705 rprn = get_token = bin_last = false;
4708 case BC_LEX_KEY_READ:
4709 if (BC_PARSE_LEAF(prev, rprn))
4710 return bc_error_bad_expression();
4711 else if (flags & BC_PARSE_NOREAD)
4712 s = bc_error_nested_read_call();
4714 s = zbc_parse_read(p);
4716 rprn = get_token = bin_last = false;
4718 prev = BC_INST_READ;
4720 case BC_LEX_KEY_SCALE:
4721 if (BC_PARSE_LEAF(prev, rprn))
4722 return bc_error_bad_expression();
4723 s = zbc_parse_scale(p, &prev, flags);
4725 rprn = get_token = bin_last = false;
4727 prev = BC_INST_SCALE;
4730 s = bc_error_bad_token();
4734 if (!s && get_token) s = zbc_lex_next(&p->l);
4738 if (G_interrupt) return BC_STATUS_FAILURE; // ^C: stop parsing
4740 while (p->ops.len > ops_bgn) {
4741 top = BC_PARSE_TOP_OP(p);
4742 assign = top >= BC_LEX_OP_ASSIGN_POWER && top <= BC_LEX_OP_ASSIGN;
4744 if (top == BC_LEX_LPAREN || top == BC_LEX_RPAREN)
4745 return bc_error_bad_expression();
4747 bc_parse_push(p, BC_TOKEN_2_INST(top));
4749 nexprs -= top != BC_LEX_OP_BOOL_NOT && top != BC_LEX_NEG;
4750 bc_vec_pop(&p->ops);
4753 if (prev == BC_INST_BOOL_NOT || nexprs != 1)
4754 return bc_error_bad_expression();
4756 if (!(flags & BC_PARSE_REL) && nrelops) {
4757 s = bc_POSIX_does_not_allow("comparison operators outside if or loops");
4758 IF_ERROR_RETURN_POSSIBLE(if (s) return s);
4759 } else if ((flags & BC_PARSE_REL) && nrelops > 1) {
4760 s = bc_POSIX_requires("exactly one comparison operator per condition");
4761 IF_ERROR_RETURN_POSSIBLE(if (s) return s);
4764 if (flags & BC_PARSE_PRINT) {
4765 if (paren_first || !assign) bc_parse_push(p, BC_INST_PRINT);
4766 bc_parse_push(p, BC_INST_POP);
4769 dbg_lex_done("%s:%d done", __func__, __LINE__);
4777 static BC_STATUS zdc_parse_register(BcParse *p)
4781 s = zbc_lex_next(&p->l);
4782 if (s) RETURN_STATUS(s);
4783 if (p->l.t.t != BC_LEX_NAME) RETURN_STATUS(bc_error_bad_token());
4785 bc_parse_pushName(p, p->l.t.v.v);
4789 #define zdc_parse_register(...) (zdc_parse_register(__VA_ARGS__) COMMA_SUCCESS)
4791 static BC_STATUS zdc_parse_string(BcParse *p)
4794 size_t len = G.prog.strs.len;
4796 dbg_lex_enter("%s:%d entered", __func__, __LINE__);
4798 str = xstrdup(p->l.t.v.v);
4799 bc_parse_push(p, BC_INST_STR);
4800 bc_parse_pushIndex(p, len);
4801 bc_vec_push(&G.prog.strs, &str);
4803 // Explanation needed here
4804 bc_program_add_fn();
4805 p->func = bc_program_func(p->fidx);
4807 dbg_lex_done("%s:%d done", __func__, __LINE__);
4809 RETURN_STATUS(zbc_lex_next(&p->l));
4811 #define zdc_parse_string(...) (zdc_parse_string(__VA_ARGS__) COMMA_SUCCESS)
4813 static BC_STATUS zdc_parse_mem(BcParse *p, uint8_t inst, bool name, bool store)
4817 bc_parse_push(p, inst);
4819 s = zdc_parse_register(p);
4820 if (s) RETURN_STATUS(s);
4824 bc_parse_push(p, BC_INST_SWAP);
4825 bc_parse_push(p, BC_INST_ASSIGN);
4826 bc_parse_push(p, BC_INST_POP);
4829 RETURN_STATUS(zbc_lex_next(&p->l));
4831 #define zdc_parse_mem(...) (zdc_parse_mem(__VA_ARGS__) COMMA_SUCCESS)
4833 static BC_STATUS zdc_parse_cond(BcParse *p, uint8_t inst)
4837 bc_parse_push(p, inst);
4838 bc_parse_push(p, BC_INST_EXEC_COND);
4840 s = zdc_parse_register(p);
4841 if (s) RETURN_STATUS(s);
4843 s = zbc_lex_next(&p->l);
4844 if (s) RETURN_STATUS(s);
4846 if (p->l.t.t == BC_LEX_ELSE) {
4847 s = zdc_parse_register(p);
4848 if (s) RETURN_STATUS(s);
4849 s = zbc_lex_next(&p->l);
4851 bc_parse_push(p, BC_PARSE_STREND);
4855 #define zdc_parse_cond(...) (zdc_parse_cond(__VA_ARGS__) COMMA_SUCCESS)
4857 static BC_STATUS zdc_parse_token(BcParse *p, BcLexType t, uint8_t flags)
4859 BcStatus s = BC_STATUS_SUCCESS;
4861 bool assign, get_token = false;
4863 dbg_lex_enter("%s:%d entered", __func__, __LINE__);
4865 case BC_LEX_OP_REL_EQ:
4866 case BC_LEX_OP_REL_LE:
4867 case BC_LEX_OP_REL_GE:
4868 case BC_LEX_OP_REL_NE:
4869 case BC_LEX_OP_REL_LT:
4870 case BC_LEX_OP_REL_GT:
4871 s = zdc_parse_cond(p, t - BC_LEX_OP_REL_EQ + BC_INST_REL_EQ);
4875 s = zdc_parse_mem(p, BC_INST_ARRAY_ELEM, true, t == BC_LEX_COLON);
4878 dbg_lex("%s:%d LEX_STR", __func__, __LINE__);
4879 s = zdc_parse_string(p);
4883 dbg_lex("%s:%d LEX_NEG/NUMBER", __func__, __LINE__);
4884 if (t == BC_LEX_NEG) {
4885 s = zbc_lex_next(&p->l);
4886 if (s) RETURN_STATUS(s);
4887 if (p->l.t.t != BC_LEX_NUMBER)
4888 RETURN_STATUS(bc_error_bad_token());
4890 bc_parse_pushNUM(p);
4891 if (t == BC_LEX_NEG) bc_parse_push(p, BC_INST_NEG);
4894 case BC_LEX_KEY_READ:
4895 if (flags & BC_PARSE_NOREAD)
4896 s = bc_error_nested_read_call();
4898 bc_parse_push(p, BC_INST_READ);
4901 case BC_LEX_OP_ASSIGN:
4902 case BC_LEX_STORE_PUSH:
4903 assign = t == BC_LEX_OP_ASSIGN;
4904 inst = assign ? BC_INST_VAR : BC_INST_PUSH_TO_VAR;
4905 s = zdc_parse_mem(p, inst, true, assign);
4908 case BC_LEX_LOAD_POP:
4909 inst = t == BC_LEX_LOAD_POP ? BC_INST_PUSH_VAR : BC_INST_LOAD;
4910 s = zdc_parse_mem(p, inst, true, false);
4912 case BC_LEX_STORE_IBASE:
4913 case BC_LEX_STORE_SCALE:
4914 case BC_LEX_STORE_OBASE:
4915 inst = t - BC_LEX_STORE_IBASE + BC_INST_IBASE;
4916 s = zdc_parse_mem(p, inst, false, true);
4919 s = bc_error_bad_token();
4924 if (!s && get_token) s = zbc_lex_next(&p->l);
4926 dbg_lex_done("%s:%d done", __func__, __LINE__);
4929 #define zdc_parse_token(...) (zdc_parse_token(__VA_ARGS__) COMMA_SUCCESS)
4931 static BC_STATUS zdc_parse_expr(BcParse *p, uint8_t flags)
4935 dbg_lex_enter("%s:%d entered G.prs.l.t.t:%d", __func__, __LINE__, G.prs.l.t.t);
4941 if (t == BC_LEX_EOF) break;
4943 inst = dc_parse_insts[t];
4944 if (inst != BC_INST_INVALID) {
4945 dbg_lex("%s:%d", __func__, __LINE__);
4946 bc_parse_push(p, inst);
4947 s = zbc_lex_next(&p->l);
4949 dbg_lex("%s:%d", __func__, __LINE__);
4950 s = zdc_parse_token(p, t, flags);
4952 if (s) RETURN_STATUS(s);
4955 if (flags & BC_PARSE_NOCALL)
4956 bc_parse_push(p, BC_INST_POP_EXEC);
4958 dbg_lex_done("%s:%d done", __func__, __LINE__);
4959 RETURN_STATUS(BC_STATUS_SUCCESS);
4961 #define zdc_parse_expr(...) (zdc_parse_expr(__VA_ARGS__) COMMA_SUCCESS)
4963 static BC_STATUS zdc_parse_parse(BcParse *p)
4967 if (p->l.t.t == BC_LEX_EOF)
4968 s = bc_error("end of file");
4970 s = zdc_parse_expr(p, 0);
4972 if (s || G_interrupt) {
4974 s = BC_STATUS_FAILURE;
4979 #define zdc_parse_parse(...) (zdc_parse_parse(__VA_ARGS__) COMMA_SUCCESS)
4983 static BC_STATUS zcommon_parse_expr(BcParse *p, uint8_t flags)
4986 IF_BC(RETURN_STATUS(zbc_parse_expr(p, flags)));
4988 IF_DC(RETURN_STATUS(zdc_parse_expr(p, flags)));
4991 #define zcommon_parse_expr(...) (zcommon_parse_expr(__VA_ARGS__) COMMA_SUCCESS)
4993 static BcVec* bc_program_search(char *id, bool var)
5000 v = var ? &G.prog.vars : &G.prog.arrs;
5001 map = var ? &G.prog.var_map : &G.prog.arr_map;
5005 new = bc_map_insert(map, &e, &i); // 1 if insertion was successful
5009 bc_array_init(&v2, var);
5010 bc_vec_push(v, &v2);
5013 ptr = bc_vec_item(map, i);
5014 if (new) ptr->name = xstrdup(e.name);
5015 return bc_vec_item(v, ptr->idx);
5018 static BC_STATUS zbc_program_num(BcResult *r, BcNum **num, bool hex)
5022 case BC_RESULT_TEMP:
5023 case BC_RESULT_IBASE:
5024 case BC_RESULT_SCALE:
5025 case BC_RESULT_OBASE:
5028 case BC_RESULT_CONSTANT: {
5030 char *str = *(char**)bc_vec_item(&G.prog.consts, r->d.id.idx);
5032 size_t len = strlen(str);
5034 bc_num_init(&r->d.n, len);
5036 hex = hex && len == 1;
5037 base_t = hex ? 16 : G.prog.ib_t;
5038 s = zbc_num_parse(&r->d.n, str, base_t);
5041 bc_num_free(&r->d.n);
5046 r->t = BC_RESULT_TEMP;
5050 case BC_RESULT_ARRAY:
5051 case BC_RESULT_ARRAY_ELEM: {
5054 v = bc_program_search(r->d.id.name, r->t == BC_RESULT_VAR);
5056 if (r->t == BC_RESULT_ARRAY_ELEM) {
5058 if (v->len <= r->d.id.idx) bc_array_expand(v, r->d.id.idx + 1);
5059 *num = bc_vec_item(v, r->d.id.idx);
5061 *num = bc_vec_top(v);
5065 case BC_RESULT_LAST:
5066 *num = &G.prog.last;
5073 // Testing the theory that dc does not reach LAST/ONE
5074 bb_error_msg_and_die("BUG:%d", r->t);
5077 RETURN_STATUS(BC_STATUS_SUCCESS);
5079 #define zbc_program_num(...) (zbc_program_num(__VA_ARGS__) COMMA_SUCCESS)
5081 static BC_STATUS zbc_program_binOpPrep(BcResult **l, BcNum **ln,
5082 BcResult **r, BcNum **rn, bool assign)
5086 BcResultType lt, rt;
5088 if (!STACK_HAS_MORE_THAN(&G.prog.results, 1))
5089 RETURN_STATUS(bc_error_stack_has_too_few_elements());
5091 *r = bc_vec_item_rev(&G.prog.results, 0);
5092 *l = bc_vec_item_rev(&G.prog.results, 1);
5096 hex = assign && (lt == BC_RESULT_IBASE || lt == BC_RESULT_OBASE);
5098 s = zbc_program_num(*l, ln, false);
5099 if (s) RETURN_STATUS(s);
5100 s = zbc_program_num(*r, rn, hex);
5101 if (s) RETURN_STATUS(s);
5103 // We run this again under these conditions in case any vector has been
5104 // reallocated out from under the BcNums or arrays we had.
5105 if (lt == rt && (lt == BC_RESULT_VAR || lt == BC_RESULT_ARRAY_ELEM)) {
5106 s = zbc_program_num(*l, ln, false);
5107 if (s) RETURN_STATUS(s);
5110 if (!BC_PROG_NUM((*l), (*ln)) && (!assign || (*l)->t != BC_RESULT_VAR))
5111 RETURN_STATUS(bc_error_variable_is_wrong_type());
5112 if (!assign && !BC_PROG_NUM((*r), (*ln)))
5113 RETURN_STATUS(bc_error_variable_is_wrong_type());
5117 #define zbc_program_binOpPrep(...) (zbc_program_binOpPrep(__VA_ARGS__) COMMA_SUCCESS)
5119 static void bc_program_binOpRetire(BcResult *r)
5121 r->t = BC_RESULT_TEMP;
5122 bc_vec_pop(&G.prog.results);
5123 bc_vec_pop(&G.prog.results);
5124 bc_vec_push(&G.prog.results, r);
5127 static BC_STATUS zbc_program_prep(BcResult **r, BcNum **n)
5131 if (!STACK_HAS_MORE_THAN(&G.prog.results, 0))
5132 RETURN_STATUS(bc_error_stack_has_too_few_elements());
5133 *r = bc_vec_top(&G.prog.results);
5135 s = zbc_program_num(*r, n, false);
5136 if (s) RETURN_STATUS(s);
5138 if (!BC_PROG_NUM((*r), (*n)))
5139 RETURN_STATUS(bc_error_variable_is_wrong_type());
5143 #define zbc_program_prep(...) (zbc_program_prep(__VA_ARGS__) COMMA_SUCCESS)
5145 static void bc_program_retire(BcResult *r, BcResultType t)
5148 bc_vec_pop(&G.prog.results);
5149 bc_vec_push(&G.prog.results, r);
5152 static BC_STATUS zbc_program_op(char inst)
5155 BcResult *opd1, *opd2, res;
5156 BcNum *n1, *n2 = NULL;
5158 s = zbc_program_binOpPrep(&opd1, &n1, &opd2, &n2, false);
5159 if (s) RETURN_STATUS(s);
5160 bc_num_init_DEF_SIZE(&res.d.n);
5162 s = BC_STATUS_SUCCESS;
5163 IF_ERROR_RETURN_POSSIBLE(s =) zbc_program_ops[inst - BC_INST_POWER](n1, n2, &res.d.n, G.prog.scale);
5165 bc_program_binOpRetire(&res);
5169 bc_num_free(&res.d.n);
5172 #define zbc_program_op(...) (zbc_program_op(__VA_ARGS__) COMMA_SUCCESS)
5174 static BC_STATUS zbc_program_read(void)
5176 const char *sv_file;
5184 RETURN_STATUS(bc_error_nested_read_call());
5186 f = bc_program_func(BC_PROG_READ);
5187 bc_vec_pop_all(&f->code);
5189 sv_file = G.prog.file;
5193 bc_char_vec_init(&buf);
5194 bc_read_line(&buf, stdin);
5196 bc_parse_create(&parse, BC_PROG_READ);
5197 bc_lex_file(&parse.l);
5199 s = zbc_parse_text_init(&parse, buf.v);
5200 if (s) goto exec_err;
5201 s = zcommon_parse_expr(&parse, BC_PARSE_NOREAD);
5202 if (s) goto exec_err;
5204 if (parse.l.t.t != BC_LEX_NLINE && parse.l.t.t != BC_LEX_EOF) {
5205 s = bc_error("bad read() expression");
5209 ip.func = BC_PROG_READ;
5211 IF_BC(ip.len = G.prog.results.len;)
5213 // Update this pointer, just in case.
5214 f = bc_program_func(BC_PROG_READ);
5216 bc_vec_pushByte(&f->code, BC_INST_POP_EXEC);
5217 bc_vec_push(&G.prog.exestack, &ip);
5219 bc_parse_free(&parse);
5221 G.prog.file = sv_file;
5225 #define zbc_program_read(...) (zbc_program_read(__VA_ARGS__) COMMA_SUCCESS)
5227 static size_t bc_program_index(char *code, size_t *bgn)
5229 unsigned char *bytes = (void*)(code + *bgn);
5239 for (i = 0; i < amt; i += 8)
5240 res |= (size_t)(*bytes++) << i;
5245 static char *bc_program_name(char *code, size_t *bgn)
5251 s = xmalloc(strchr(code, BC_PARSE_STREND) - code + 1);
5255 if (c == BC_PARSE_STREND)
5265 static void bc_program_printString(const char *str)
5269 // Example: echo '[]ap' | dc
5270 // should print two bytes: 0x00, 0x0A
5277 if (c != '\\' || !*str)
5297 G.prog.nchars = SIZE_MAX;
5309 // Just print the backslash and following character.
5320 static void bc_num_printNewline(void)
5322 if (G.prog.nchars == G.prog.len - 1) {
5330 static FAST_FUNC void dc_num_printChar(size_t num, size_t width, bool radix)
5333 bb_putchar((char) num);
5334 G.prog.nchars += width;
5338 static FAST_FUNC void bc_num_printDigits(size_t num, size_t width, bool radix)
5342 bc_num_printNewline();
5343 bb_putchar(radix ? '.' : ' ');
5346 bc_num_printNewline();
5347 for (exp = 0, pow = 1; exp < width - 1; ++exp, pow *= 10)
5350 for (exp = 0; exp < width; pow /= 10, ++G.prog.nchars, ++exp) {
5352 bc_num_printNewline();
5355 bb_putchar(((char) dig) + '0');
5359 static FAST_FUNC void bc_num_printHex(size_t num, size_t width, bool radix)
5362 bc_num_printNewline();
5367 bc_num_printNewline();
5368 bb_putchar(bb_hexdigits_upcase[num]);
5369 G.prog.nchars += width;
5372 static void bc_num_printDecimal(BcNum *n)
5374 size_t i, rdx = n->rdx - 1;
5381 for (i = n->len - 1; i < n->len; --i)
5382 bc_num_printHex((size_t) n->num[i], 1, i == rdx);
5385 static BC_STATUS zbc_num_printNum(BcNum *n, unsigned base_t, size_t width, BcNumDigitOp print)
5390 BcNum intp, fracp, digit, frac_len;
5391 unsigned long dig, *ptr;
5396 print(0, width, false);
5397 RETURN_STATUS(BC_STATUS_SUCCESS);
5400 bc_vec_init(&stack, sizeof(long), NULL);
5401 bc_num_init(&intp, n->len);
5402 bc_num_init(&fracp, n->rdx);
5403 bc_num_init(&digit, width);
5404 bc_num_init(&frac_len, BC_NUM_INT(n));
5405 bc_num_copy(&intp, n);
5406 bc_num_one(&frac_len);
5407 //TODO: have BcNumSmall type, with static buffer
5408 bc_num_init_DEF_SIZE(&base);
5409 bc_num_ulong2num(&base, base_t);
5411 bc_num_truncate(&intp, intp.rdx);
5412 s = zbc_num_sub(n, &intp, &fracp, 0);
5415 while (intp.len != 0) {
5416 s = zbc_num_divmod(&intp, &base, &intp, &digit, 0);
5418 s = zbc_num_ulong(&digit, &dig);
5420 bc_vec_push(&stack, &dig);
5423 for (i = 0; i < stack.len; ++i) {
5424 ptr = bc_vec_item_rev(&stack, i);
5425 print(*ptr, width, false);
5428 if (!n->rdx) goto err;
5430 for (radix = true; frac_len.len <= n->rdx; radix = false) {
5431 s = zbc_num_mul(&fracp, &base, &fracp, n->rdx);
5433 s = zbc_num_ulong(&fracp, &dig);
5435 bc_num_ulong2num(&intp, dig);
5436 s = zbc_num_sub(&fracp, &intp, &fracp, 0);
5438 print(dig, width, radix);
5439 s = zbc_num_mul(&frac_len, &base, &frac_len, 0);
5444 bc_num_free(&frac_len);
5445 bc_num_free(&digit);
5446 bc_num_free(&fracp);
5448 bc_vec_free(&stack);
5451 #define zbc_num_printNum(...) (zbc_num_printNum(__VA_ARGS__) COMMA_SUCCESS)
5453 static BC_STATUS zbc_num_printBase(BcNum *n)
5467 if (G.prog.ob_t <= BC_NUM_MAX_IBASE) {
5469 print = bc_num_printHex;
5471 unsigned i = G.prog.ob_t - 1;
5479 print = bc_num_printDigits;
5482 s = zbc_num_printNum(n, G.prog.ob_t, width, print);
5487 #define zbc_num_printBase(...) (zbc_num_printBase(__VA_ARGS__) COMMA_SUCCESS)
5489 static BC_STATUS zbc_num_print(BcNum *n, bool newline)
5491 BcStatus s = BC_STATUS_SUCCESS;
5493 bc_num_printNewline();
5498 } else if (G.prog.ob_t == 10)
5499 bc_num_printDecimal(n);
5501 s = zbc_num_printBase(n);
5510 #define zbc_num_print(...) (zbc_num_print(__VA_ARGS__) COMMA_SUCCESS)
5512 static BC_STATUS zbc_program_print(char inst, size_t idx)
5517 bool pop = inst != BC_INST_PRINT;
5519 if (!STACK_HAS_MORE_THAN(&G.prog.results, idx))
5520 RETURN_STATUS(bc_error_stack_has_too_few_elements());
5522 r = bc_vec_item_rev(&G.prog.results, idx);
5523 num = NULL; // is this NULL necessary?
5524 s = zbc_program_num(r, &num, false);
5525 if (s) RETURN_STATUS(s);
5527 if (BC_PROG_NUM(r, num)) {
5528 s = zbc_num_print(num, !pop);
5530 if (!s && IS_BC) bc_num_copy(&G.prog.last, num);
5535 idx = (r->t == BC_RESULT_STR) ? r->d.id.idx : num->rdx;
5536 str = *bc_program_str(idx);
5538 if (inst == BC_INST_PRINT_STR) {
5541 if (c == '\0') break;
5544 if (c == '\n') G.prog.nchars = 0;
5547 bc_program_printString(str);
5548 if (inst == BC_INST_PRINT) bb_putchar('\n');
5552 if (!s && pop) bc_vec_pop(&G.prog.results);
5556 #define zbc_program_print(...) (zbc_program_print(__VA_ARGS__) COMMA_SUCCESS)
5558 static BC_STATUS zbc_program_negate(void)
5564 s = zbc_program_prep(&ptr, &num);
5565 if (s) RETURN_STATUS(s);
5567 bc_num_init(&res.d.n, num->len);
5568 bc_num_copy(&res.d.n, num);
5569 if (res.d.n.len) res.d.n.neg = !res.d.n.neg;
5571 bc_program_retire(&res, BC_RESULT_TEMP);
5575 #define zbc_program_negate(...) (zbc_program_negate(__VA_ARGS__) COMMA_SUCCESS)
5577 static BC_STATUS zbc_program_logical(char inst)
5580 BcResult *opd1, *opd2, res;
5584 s = zbc_program_binOpPrep(&opd1, &n1, &opd2, &n2, false);
5585 if (s) RETURN_STATUS(s);
5587 bc_num_init_DEF_SIZE(&res.d.n);
5589 if (inst == BC_INST_BOOL_AND)
5590 cond = bc_num_cmp(n1, &G.prog.zero) && bc_num_cmp(n2, &G.prog.zero);
5591 else if (inst == BC_INST_BOOL_OR)
5592 cond = bc_num_cmp(n1, &G.prog.zero) || bc_num_cmp(n2, &G.prog.zero);
5594 cond = bc_num_cmp(n1, n2);
5596 case BC_INST_REL_EQ:
5599 case BC_INST_REL_LE:
5602 case BC_INST_REL_GE:
5605 case BC_INST_REL_LT:
5608 case BC_INST_REL_GT:
5611 default: // = case BC_INST_REL_NE:
5612 //cond = (cond != 0); - not needed
5617 if (cond) bc_num_one(&res.d.n);
5618 //else bc_num_zero(&res.d.n); - already is
5620 bc_program_binOpRetire(&res);
5624 #define zbc_program_logical(...) (zbc_program_logical(__VA_ARGS__) COMMA_SUCCESS)
5627 static BC_STATUS zdc_program_assignStr(BcResult *r, BcVec *v, bool push)
5632 memset(&n2, 0, sizeof(BcNum));
5633 n2.rdx = res.d.id.idx = r->d.id.idx;
5634 res.t = BC_RESULT_STR;
5637 if (!STACK_HAS_MORE_THAN(&G.prog.results, 1))
5638 RETURN_STATUS(bc_error_stack_has_too_few_elements());
5640 bc_vec_pop(&G.prog.results);
5643 bc_vec_pop(&G.prog.results);
5645 bc_vec_push(&G.prog.results, &res);
5646 bc_vec_push(v, &n2);
5648 RETURN_STATUS(BC_STATUS_SUCCESS);
5650 #define zdc_program_assignStr(...) (zdc_program_assignStr(__VA_ARGS__) COMMA_SUCCESS)
5653 static BC_STATUS zbc_program_copyToVar(char *name, bool var)
5660 if (!STACK_HAS_MORE_THAN(&G.prog.results, 0))
5661 RETURN_STATUS(bc_error_stack_has_too_few_elements());
5663 ptr = bc_vec_top(&G.prog.results);
5664 if ((ptr->t == BC_RESULT_ARRAY) != !var)
5665 RETURN_STATUS(bc_error_variable_is_wrong_type());
5666 v = bc_program_search(name, var);
5669 if (ptr->t == BC_RESULT_STR && !var)
5670 RETURN_STATUS(bc_error_variable_is_wrong_type());
5671 if (ptr->t == BC_RESULT_STR)
5672 RETURN_STATUS(zdc_program_assignStr(ptr, v, true));
5675 s = zbc_program_num(ptr, &n, false);
5676 if (s) RETURN_STATUS(s);
5678 // Do this once more to make sure that pointers were not invalidated.
5679 v = bc_program_search(name, var);
5682 bc_num_init_DEF_SIZE(&r.d.n);
5683 bc_num_copy(&r.d.n, n);
5685 bc_array_init(&r.d.v, true);
5686 bc_array_copy(&r.d.v, (BcVec *) n);
5689 bc_vec_push(v, &r.d);
5690 bc_vec_pop(&G.prog.results);
5694 #define zbc_program_copyToVar(...) (zbc_program_copyToVar(__VA_ARGS__) COMMA_SUCCESS)
5696 static BC_STATUS zbc_program_assign(char inst)
5699 BcResult *left, *right, res;
5700 BcNum *l = NULL, *r = NULL;
5701 bool assign = inst == BC_INST_ASSIGN, ib, sc;
5703 s = zbc_program_binOpPrep(&left, &l, &right, &r, assign);
5704 if (s) RETURN_STATUS(s);
5706 ib = left->t == BC_RESULT_IBASE;
5707 sc = left->t == BC_RESULT_SCALE;
5710 if (right->t == BC_RESULT_STR) {
5713 if (left->t != BC_RESULT_VAR)
5714 RETURN_STATUS(bc_error_variable_is_wrong_type());
5715 v = bc_program_search(left->d.id.name, true);
5717 RETURN_STATUS(zdc_program_assignStr(right, v, false));
5721 if (left->t == BC_RESULT_CONSTANT || left->t == BC_RESULT_TEMP)
5722 RETURN_STATUS(bc_error("bad assignment:"
5723 " left side must be variable"
5725 )); // note: shared string
5728 if (inst == BC_INST_ASSIGN_DIVIDE && !bc_num_cmp(r, &G.prog.zero))
5729 RETURN_STATUS(bc_error("divide by zero"));
5734 s = BC_STATUS_SUCCESS;
5735 IF_ERROR_RETURN_POSSIBLE(s =) zbc_program_ops[inst - BC_INST_ASSIGN_POWER](l, r, l, G.prog.scale);
5737 if (s) RETURN_STATUS(s);
5742 if (ib || sc || left->t == BC_RESULT_OBASE) {
5743 static const char *const msg[] = {
5744 "bad ibase; must be [2,16]", //BC_RESULT_IBASE
5745 "bad scale; must be [0,"BC_MAX_SCALE_STR"]", //BC_RESULT_SCALE
5746 NULL, //can't happen //BC_RESULT_LAST
5747 NULL, //can't happen //BC_RESULT_CONSTANT
5748 NULL, //can't happen //BC_RESULT_ONE
5749 "bad obase; must be [2,"BC_MAX_OBASE_STR"]", //BC_RESULT_OBASE
5755 s = zbc_num_ulong(l, &val);
5756 if (s) RETURN_STATUS(s);
5757 s = left->t - BC_RESULT_IBASE;
5760 ptr = &G.prog.scale;
5763 RETURN_STATUS(bc_error(msg[s]));
5764 max = ib ? BC_NUM_MAX_IBASE : BC_MAX_OBASE;
5765 ptr = ib ? &G.prog.ib_t : &G.prog.ob_t;
5769 RETURN_STATUS(bc_error(msg[s]));
5771 *ptr = (size_t) val;
5772 s = BC_STATUS_SUCCESS;
5775 bc_num_init(&res.d.n, l->len);
5776 bc_num_copy(&res.d.n, l);
5777 bc_program_binOpRetire(&res);
5781 #define zbc_program_assign(...) (zbc_program_assign(__VA_ARGS__) COMMA_SUCCESS)
5784 #define bc_program_pushVar(code, bgn, pop, copy) \
5785 bc_program_pushVar(code, bgn)
5786 // for bc, 'pop' and 'copy' are always false
5788 static BC_STATUS bc_program_pushVar(char *code, size_t *bgn,
5789 bool pop, bool copy)
5792 char *name = bc_program_name(code, bgn);
5794 r.t = BC_RESULT_VAR;
5799 BcVec *v = bc_program_search(name, true);
5800 BcNum *num = bc_vec_top(v);
5803 if (!STACK_HAS_MORE_THAN(v, 1 - copy)) {
5804 RETURN_STATUS(bc_error_stack_has_too_few_elements());
5807 if (!BC_PROG_STR(num)) {
5808 r.t = BC_RESULT_TEMP;
5809 bc_num_init_DEF_SIZE(&r.d.n);
5810 bc_num_copy(&r.d.n, num);
5812 r.t = BC_RESULT_STR;
5813 r.d.id.idx = num->rdx;
5816 if (!copy) bc_vec_pop(v);
5820 bc_vec_push(&G.prog.results, &r);
5822 RETURN_STATUS(BC_STATUS_SUCCESS);
5824 #define zbc_program_pushVar(...) (bc_program_pushVar(__VA_ARGS__) COMMA_SUCCESS)
5826 static BC_STATUS zbc_program_pushArray(char *code, size_t *bgn, char inst)
5828 BcStatus s = BC_STATUS_SUCCESS;
5832 r.d.id.name = bc_program_name(code, bgn);
5834 if (inst == BC_INST_ARRAY) {
5835 r.t = BC_RESULT_ARRAY;
5836 bc_vec_push(&G.prog.results, &r);
5841 s = zbc_program_prep(&operand, &num);
5843 s = zbc_num_ulong(num, &temp);
5846 if (temp > BC_MAX_DIM) {
5847 s = bc_error("array too long; must be [1,"BC_MAX_DIM_STR"]");
5851 r.d.id.idx = (size_t) temp;
5852 bc_program_retire(&r, BC_RESULT_ARRAY_ELEM);
5855 if (s) free(r.d.id.name);
5858 #define zbc_program_pushArray(...) (zbc_program_pushArray(__VA_ARGS__) COMMA_SUCCESS)
5861 static BC_STATUS zbc_program_incdec(char inst)
5864 BcResult *ptr, res, copy;
5868 s = zbc_program_prep(&ptr, &num);
5869 if (s) RETURN_STATUS(s);
5871 if (inst == BC_INST_INC_POST || inst == BC_INST_DEC_POST) {
5872 copy.t = BC_RESULT_TEMP;
5873 bc_num_init(©.d.n, num->len);
5874 bc_num_copy(©.d.n, num);
5877 res.t = BC_RESULT_ONE;
5878 inst = inst == BC_INST_INC_PRE || inst == BC_INST_INC_POST ?
5879 BC_INST_ASSIGN_PLUS :
5880 BC_INST_ASSIGN_MINUS;
5882 bc_vec_push(&G.prog.results, &res);
5883 s = zbc_program_assign(inst);
5884 if (s) RETURN_STATUS(s);
5886 if (inst2 == BC_INST_INC_POST || inst2 == BC_INST_DEC_POST) {
5887 bc_vec_pop(&G.prog.results);
5888 bc_vec_push(&G.prog.results, ©);
5893 #define zbc_program_incdec(...) (zbc_program_incdec(__VA_ARGS__) COMMA_SUCCESS)
5895 static BC_STATUS zbc_program_call(char *code, size_t *idx)
5903 nparams = bc_program_index(code, idx);
5905 ip.func = bc_program_index(code, idx);
5906 func = bc_program_func(ip.func);
5908 if (func->code.len == 0) {
5909 RETURN_STATUS(bc_error("undefined function"));
5911 if (nparams != func->nparams) {
5912 RETURN_STATUS(bc_error_fmt("function has %u parameters, but called with %u", func->nparams, nparams));
5914 ip.len = G.prog.results.len - nparams;
5916 for (i = 0; i < nparams; ++i) {
5919 a = bc_vec_item(&func->autos, nparams - 1 - i);
5920 arg = bc_vec_top(&G.prog.results);
5922 if ((!a->idx) != (arg->t == BC_RESULT_ARRAY) || arg->t == BC_RESULT_STR)
5923 RETURN_STATUS(bc_error_variable_is_wrong_type());
5925 s = zbc_program_copyToVar(a->name, a->idx);
5926 if (s) RETURN_STATUS(s);
5929 a = bc_vec_item(&func->autos, i);
5930 for (; i < func->autos.len; i++, a++) {
5933 v = bc_program_search(a->name, a->idx);
5936 bc_num_init_DEF_SIZE(&n2);
5937 bc_vec_push(v, &n2);
5940 bc_array_init(&v2, true);
5941 bc_vec_push(v, &v2);
5945 bc_vec_push(&G.prog.exestack, &ip);
5947 RETURN_STATUS(BC_STATUS_SUCCESS);
5949 #define zbc_program_call(...) (zbc_program_call(__VA_ARGS__) COMMA_SUCCESS)
5951 static BC_STATUS zbc_program_return(char inst)
5957 BcInstPtr *ip = bc_vec_top(&G.prog.exestack);
5959 if (!STACK_HAS_EQUAL_OR_MORE_THAN(&G.prog.results, ip->len + (inst == BC_INST_RET)))
5960 RETURN_STATUS(bc_error_stack_has_too_few_elements());
5962 f = bc_program_func(ip->func);
5963 res.t = BC_RESULT_TEMP;
5965 if (inst == BC_INST_RET) {
5968 BcResult *operand = bc_vec_top(&G.prog.results);
5970 s = zbc_program_num(operand, &num, false);
5971 if (s) RETURN_STATUS(s);
5972 bc_num_init(&res.d.n, num->len);
5973 bc_num_copy(&res.d.n, num);
5975 bc_num_init_DEF_SIZE(&res.d.n);
5976 //bc_num_zero(&res.d.n); - already is
5979 // We need to pop arguments as well, so this takes that into account.
5980 a = (void*)f->autos.v;
5981 for (i = 0; i < f->autos.len; i++, a++) {
5983 v = bc_program_search(a->name, a->idx);
5987 bc_vec_npop(&G.prog.results, G.prog.results.len - ip->len);
5988 bc_vec_push(&G.prog.results, &res);
5989 bc_vec_pop(&G.prog.exestack);
5991 RETURN_STATUS(BC_STATUS_SUCCESS);
5993 #define zbc_program_return(...) (zbc_program_return(__VA_ARGS__) COMMA_SUCCESS)
5996 static unsigned long bc_program_scale(BcNum *n)
5998 return (unsigned long) n->rdx;
6001 static unsigned long bc_program_len(BcNum *n)
6003 size_t len = n->len;
6005 if (n->rdx != len) return len;
6007 if (len == 0) break;
6009 if (n->num[len] != 0) break;
6014 static BC_STATUS zbc_program_builtin(char inst)
6020 bool len = inst == BC_INST_LENGTH;
6022 if (!STACK_HAS_MORE_THAN(&G.prog.results, 0))
6023 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6024 opnd = bc_vec_top(&G.prog.results);
6026 s = zbc_program_num(opnd, &num, false);
6027 if (s) RETURN_STATUS(s);
6030 if (!BC_PROG_NUM(opnd, num) && !len)
6031 RETURN_STATUS(bc_error_variable_is_wrong_type());
6034 bc_num_init_DEF_SIZE(&res.d.n);
6036 if (inst == BC_INST_SQRT)
6037 s = zbc_num_sqrt(num, &res.d.n, G.prog.scale);
6039 else if (len != 0 && opnd->t == BC_RESULT_ARRAY) {
6040 bc_num_ulong2num(&res.d.n, (unsigned long) ((BcVec *) num)->len);
6044 else if (len != 0 && !BC_PROG_NUM(opnd, num)) {
6046 size_t idx = opnd->t == BC_RESULT_STR ? opnd->d.id.idx : num->rdx;
6048 str = bc_program_str(idx);
6049 bc_num_ulong2num(&res.d.n, strlen(*str));
6053 bc_num_ulong2num(&res.d.n, len ? bc_program_len(num) : bc_program_scale(num));
6056 bc_program_retire(&res, BC_RESULT_TEMP);
6060 #define zbc_program_builtin(...) (zbc_program_builtin(__VA_ARGS__) COMMA_SUCCESS)
6063 static BC_STATUS zdc_program_divmod(void)
6066 BcResult *opd1, *opd2, res, res2;
6067 BcNum *n1, *n2 = NULL;
6069 s = zbc_program_binOpPrep(&opd1, &n1, &opd2, &n2, false);
6070 if (s) RETURN_STATUS(s);
6072 bc_num_init_DEF_SIZE(&res.d.n);
6073 bc_num_init(&res2.d.n, n2->len);
6075 s = zbc_num_divmod(n1, n2, &res2.d.n, &res.d.n, G.prog.scale);
6078 bc_program_binOpRetire(&res2);
6079 res.t = BC_RESULT_TEMP;
6080 bc_vec_push(&G.prog.results, &res);
6084 bc_num_free(&res2.d.n);
6085 bc_num_free(&res.d.n);
6088 #define zdc_program_divmod(...) (zdc_program_divmod(__VA_ARGS__) COMMA_SUCCESS)
6090 static BC_STATUS zdc_program_modexp(void)
6093 BcResult *r1, *r2, *r3, res;
6094 BcNum *n1, *n2, *n3;
6096 if (!STACK_HAS_MORE_THAN(&G.prog.results, 2))
6097 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6098 s = zbc_program_binOpPrep(&r2, &n2, &r3, &n3, false);
6099 if (s) RETURN_STATUS(s);
6101 r1 = bc_vec_item_rev(&G.prog.results, 2);
6102 s = zbc_program_num(r1, &n1, false);
6103 if (s) RETURN_STATUS(s);
6104 if (!BC_PROG_NUM(r1, n1))
6105 RETURN_STATUS(bc_error_variable_is_wrong_type());
6107 // Make sure that the values have their pointers updated, if necessary.
6108 if (r1->t == BC_RESULT_VAR || r1->t == BC_RESULT_ARRAY_ELEM) {
6109 if (r1->t == r2->t) {
6110 s = zbc_program_num(r2, &n2, false);
6111 if (s) RETURN_STATUS(s);
6113 if (r1->t == r3->t) {
6114 s = zbc_program_num(r3, &n3, false);
6115 if (s) RETURN_STATUS(s);
6119 bc_num_init(&res.d.n, n3->len);
6120 s = zdc_num_modexp(n1, n2, n3, &res.d.n);
6123 bc_vec_pop(&G.prog.results);
6124 bc_program_binOpRetire(&res);
6128 bc_num_free(&res.d.n);
6131 #define zdc_program_modexp(...) (zdc_program_modexp(__VA_ARGS__) COMMA_SUCCESS)
6133 static void dc_program_stackLen(void)
6136 size_t len = G.prog.results.len;
6138 res.t = BC_RESULT_TEMP;
6140 bc_num_init_DEF_SIZE(&res.d.n);
6141 bc_num_ulong2num(&res.d.n, len);
6142 bc_vec_push(&G.prog.results, &res);
6145 static BC_STATUS zdc_program_asciify(void)
6156 if (!STACK_HAS_MORE_THAN(&G.prog.results, 0))
6157 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6158 r = bc_vec_top(&G.prog.results);
6160 num = NULL; // TODO: is this NULL needed?
6161 s = zbc_program_num(r, &num, false);
6162 if (s) RETURN_STATUS(s);
6164 if (BC_PROG_NUM(r, num)) {
6167 bc_num_init_DEF_SIZE(&n);
6168 bc_num_copy(&n, num);
6169 bc_num_truncate(&n, n.rdx);
6171 //TODO: have BcNumSmall type, with static buffer
6172 bc_num_init_DEF_SIZE(&strmb);
6173 bc_num_ulong2num(&strmb, 0x100);
6174 s = zbc_num_mod(&n, &strmb, &n, 0);
6175 bc_num_free(&strmb);
6177 if (s) goto num_err;
6178 s = zbc_num_ulong(&n, &val);
6179 if (s) goto num_err;
6186 idx = (r->t == BC_RESULT_STR) ? r->d.id.idx : num->rdx;
6187 sp = *bc_program_str(idx);
6191 strs = (void*)G.prog.strs.v;
6192 for (idx = 0; idx < G.prog.strs.len; idx++) {
6193 if (strs[idx][0] == c && strs[idx][1] == '\0') {
6199 //str[1] = '\0'; - already is
6200 bc_vec_push(&G.prog.strs, &str);
6202 res.t = BC_RESULT_STR;
6204 bc_vec_pop(&G.prog.results);
6205 bc_vec_push(&G.prog.results, &res);
6207 RETURN_STATUS(BC_STATUS_SUCCESS);
6212 #define zdc_program_asciify(...) (zdc_program_asciify(__VA_ARGS__) COMMA_SUCCESS)
6214 static BC_STATUS zdc_program_printStream(void)
6221 if (!STACK_HAS_MORE_THAN(&G.prog.results, 0))
6222 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6223 r = bc_vec_top(&G.prog.results);
6225 n = NULL; // is this needed?
6226 s = zbc_program_num(r, &n, false);
6227 if (s) RETURN_STATUS(s);
6229 if (BC_PROG_NUM(r, n)) {
6230 s = zbc_num_printNum(n, 0x100, 1, dc_num_printChar);
6233 idx = (r->t == BC_RESULT_STR) ? r->d.id.idx : n->rdx;
6234 str = *bc_program_str(idx);
6240 #define zdc_program_printStream(...) (zdc_program_printStream(__VA_ARGS__) COMMA_SUCCESS)
6242 static BC_STATUS zdc_program_nquit(void)
6249 s = zbc_program_prep(&opnd, &num);
6250 if (s) RETURN_STATUS(s);
6251 s = zbc_num_ulong(num, &val);
6252 if (s) RETURN_STATUS(s);
6254 bc_vec_pop(&G.prog.results);
6256 if (G.prog.exestack.len < val)
6257 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6258 if (G.prog.exestack.len == val) {
6259 QUIT_OR_RETURN_TO_MAIN;
6262 bc_vec_npop(&G.prog.exestack, val);
6266 #define zdc_program_nquit(...) (zdc_program_nquit(__VA_ARGS__) COMMA_SUCCESS)
6268 static BC_STATUS zdc_program_execStr(char *code, size_t *bgn, bool cond)
6270 BcStatus s = BC_STATUS_SUCCESS;
6276 if (!STACK_HAS_MORE_THAN(&G.prog.results, 0))
6277 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6279 r = bc_vec_top(&G.prog.results);
6282 BcNum *n = n; // for compiler
6285 char *then_name = bc_program_name(code, bgn);
6286 char *else_name = NULL;
6288 if (code[*bgn] == BC_PARSE_STREND)
6291 else_name = bc_program_name(code, bgn);
6293 exec = r->d.n.len != 0;
6295 if (!exec && else_name != NULL) {
6302 v = bc_program_search(name, true);
6309 if (!exec) goto exit;
6310 if (!BC_PROG_STR(n)) {
6311 s = bc_error_variable_is_wrong_type();
6317 if (r->t == BC_RESULT_STR) {
6319 } else if (r->t == BC_RESULT_VAR) {
6321 s = zbc_program_num(r, &n, false);
6322 if (s || !BC_PROG_STR(n)) goto exit;
6328 fidx = sidx + BC_PROG_REQ_FUNCS;
6330 f = bc_program_func(fidx);
6332 if (f->code.len == 0) {
6336 bc_parse_create(&prs, fidx);
6337 str = *bc_program_str(sidx);
6338 s = zbc_parse_text_init(&prs, str);
6340 s = zcommon_parse_expr(&prs, BC_PARSE_NOCALL);
6342 if (prs.l.t.t != BC_LEX_EOF) {
6343 s = bc_error_bad_expression();
6345 bc_parse_free(&prs);
6346 bc_vec_pop_all(&f->code);
6349 bc_parse_free(&prs);
6353 IF_BC(ip.len = G.prog.results.len;)
6356 bc_vec_pop(&G.prog.results);
6357 bc_vec_push(&G.prog.exestack, &ip);
6359 RETURN_STATUS(BC_STATUS_SUCCESS);
6361 bc_vec_pop(&G.prog.results);
6364 #define zdc_program_execStr(...) (zdc_program_execStr(__VA_ARGS__) COMMA_SUCCESS)
6367 static void bc_program_pushGlobal(char inst)
6372 res.t = inst - BC_INST_IBASE + BC_RESULT_IBASE;
6373 if (inst == BC_INST_IBASE)
6374 val = (unsigned long) G.prog.ib_t;
6375 else if (inst == BC_INST_SCALE)
6376 val = (unsigned long) G.prog.scale;
6378 val = (unsigned long) G.prog.ob_t;
6380 bc_num_init_DEF_SIZE(&res.d.n);
6381 bc_num_ulong2num(&res.d.n, val);
6382 bc_vec_push(&G.prog.results, &res);
6385 static BC_STATUS zbc_program_exec(void)
6389 BcInstPtr *ip = bc_vec_top(&G.prog.exestack);
6390 BcFunc *func = bc_program_func(ip->func);
6391 char *code = func->code.v;
6393 dbg_exec("func:%zd bytes:%zd ip:%zd", ip->func, func->code.len, ip->idx);
6394 while (ip->idx < func->code.len) {
6395 BcStatus s = BC_STATUS_SUCCESS;
6396 char inst = code[ip->idx++];
6398 dbg_exec("inst at %zd:%d", ip->idx - 1, inst);
6401 case BC_INST_JUMP_ZERO: {
6403 dbg_exec("BC_INST_JUMP_ZERO:");
6404 s = zbc_program_prep(&ptr, &num);
6405 if (s) RETURN_STATUS(s);
6406 zero = (bc_num_cmp(num, &G.prog.zero) == 0);
6407 bc_vec_pop(&G.prog.results);
6409 bc_program_index(code, &ip->idx);
6412 // else: fall through
6414 case BC_INST_JUMP: {
6415 size_t idx = bc_program_index(code, &ip->idx);
6416 size_t *addr = bc_vec_item(&func->labels, idx);
6417 dbg_exec("BC_INST_JUMP: to %ld", (long)*addr);
6422 dbg_exec("BC_INST_CALL:");
6423 s = zbc_program_call(code, &ip->idx);
6424 goto read_updated_ip;
6425 case BC_INST_INC_PRE:
6426 case BC_INST_DEC_PRE:
6427 case BC_INST_INC_POST:
6428 case BC_INST_DEC_POST:
6429 dbg_exec("BC_INST_INCDEC:");
6430 s = zbc_program_incdec(inst);
6433 dbg_exec("BC_INST_HALT:");
6434 QUIT_OR_RETURN_TO_MAIN;
6438 dbg_exec("BC_INST_RET[0]:");
6439 s = zbc_program_return(inst);
6440 goto read_updated_ip;
6441 case BC_INST_BOOL_OR:
6442 case BC_INST_BOOL_AND:
6444 case BC_INST_REL_EQ:
6445 case BC_INST_REL_LE:
6446 case BC_INST_REL_GE:
6447 case BC_INST_REL_NE:
6448 case BC_INST_REL_LT:
6449 case BC_INST_REL_GT:
6450 dbg_exec("BC_INST_BOOL:");
6451 s = zbc_program_logical(inst);
6454 dbg_exec("BC_INST_READ:");
6455 s = zbc_program_read();
6456 goto read_updated_ip;
6458 dbg_exec("BC_INST_VAR:");
6459 s = zbc_program_pushVar(code, &ip->idx, false, false);
6461 case BC_INST_ARRAY_ELEM:
6463 dbg_exec("BC_INST_ARRAY[_ELEM]:");
6464 s = zbc_program_pushArray(code, &ip->idx, inst);
6467 r.t = BC_RESULT_LAST;
6468 bc_vec_push(&G.prog.results, &r);
6473 bc_program_pushGlobal(inst);
6475 case BC_INST_SCALE_FUNC:
6476 case BC_INST_LENGTH:
6478 dbg_exec("BC_INST_builtin:");
6479 s = zbc_program_builtin(inst);
6482 dbg_exec("BC_INST_NUM:");
6483 r.t = BC_RESULT_CONSTANT;
6484 r.d.id.idx = bc_program_index(code, &ip->idx);
6485 bc_vec_push(&G.prog.results, &r);
6488 dbg_exec("BC_INST_POP:");
6489 if (!STACK_HAS_MORE_THAN(&G.prog.results, 0))
6490 s = bc_error_stack_has_too_few_elements();
6492 bc_vec_pop(&G.prog.results);
6494 case BC_INST_POP_EXEC:
6495 dbg_exec("BC_INST_POP_EXEC:");
6496 bc_vec_pop(&G.prog.exestack);
6497 goto read_updated_ip;
6499 case BC_INST_PRINT_POP:
6500 case BC_INST_PRINT_STR:
6501 dbg_exec("BC_INST_PRINTxyz:");
6502 s = zbc_program_print(inst, 0);
6505 dbg_exec("BC_INST_STR:");
6506 r.t = BC_RESULT_STR;
6507 r.d.id.idx = bc_program_index(code, &ip->idx);
6508 bc_vec_push(&G.prog.results, &r);
6511 case BC_INST_MULTIPLY:
6512 case BC_INST_DIVIDE:
6513 case BC_INST_MODULUS:
6516 dbg_exec("BC_INST_binaryop:");
6517 s = zbc_program_op(inst);
6519 case BC_INST_BOOL_NOT:
6520 dbg_exec("BC_INST_BOOL_NOT:");
6521 s = zbc_program_prep(&ptr, &num);
6522 if (s) RETURN_STATUS(s);
6523 bc_num_init_DEF_SIZE(&r.d.n);
6524 if (!bc_num_cmp(num, &G.prog.zero))
6526 //else bc_num_zero(&r.d.n); - already is
6527 bc_program_retire(&r, BC_RESULT_TEMP);
6530 dbg_exec("BC_INST_NEG:");
6531 s = zbc_program_negate();
6534 case BC_INST_ASSIGN_POWER:
6535 case BC_INST_ASSIGN_MULTIPLY:
6536 case BC_INST_ASSIGN_DIVIDE:
6537 case BC_INST_ASSIGN_MODULUS:
6538 case BC_INST_ASSIGN_PLUS:
6539 case BC_INST_ASSIGN_MINUS:
6541 case BC_INST_ASSIGN:
6542 dbg_exec("BC_INST_ASSIGNxyz:");
6543 s = zbc_program_assign(inst);
6546 case BC_INST_MODEXP:
6547 s = zdc_program_modexp();
6549 case BC_INST_DIVMOD:
6550 s = zdc_program_divmod();
6552 case BC_INST_EXECUTE:
6553 case BC_INST_EXEC_COND:
6554 s = zdc_program_execStr(code, &ip->idx, inst == BC_INST_EXEC_COND);
6555 goto read_updated_ip;
6556 case BC_INST_PRINT_STACK: {
6558 for (idx = 0; idx < G.prog.results.len; ++idx) {
6559 s = zbc_program_print(BC_INST_PRINT, idx);
6564 case BC_INST_CLEAR_STACK:
6565 bc_vec_pop_all(&G.prog.results);
6567 case BC_INST_STACK_LEN:
6568 dc_program_stackLen();
6570 case BC_INST_DUPLICATE:
6571 if (!STACK_HAS_MORE_THAN(&G.prog.results, 0))
6572 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6573 ptr = bc_vec_top(&G.prog.results);
6574 dc_result_copy(&r, ptr);
6575 bc_vec_push(&G.prog.results, &r);
6577 case BC_INST_SWAP: {
6579 if (!STACK_HAS_MORE_THAN(&G.prog.results, 1))
6580 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6581 ptr = bc_vec_item_rev(&G.prog.results, 0);
6582 ptr2 = bc_vec_item_rev(&G.prog.results, 1);
6583 memcpy(&r, ptr, sizeof(BcResult));
6584 memcpy(ptr, ptr2, sizeof(BcResult));
6585 memcpy(ptr2, &r, sizeof(BcResult));
6588 case BC_INST_ASCIIFY:
6589 s = zdc_program_asciify();
6591 case BC_INST_PRINT_STREAM:
6592 s = zdc_program_printStream();
6595 case BC_INST_PUSH_VAR: {
6596 bool copy = inst == BC_INST_LOAD;
6597 s = zbc_program_pushVar(code, &ip->idx, true, copy);
6600 case BC_INST_PUSH_TO_VAR: {
6601 char *name = bc_program_name(code, &ip->idx);
6602 s = zbc_program_copyToVar(name, true);
6607 dbg_exec("BC_INST_QUIT:");
6608 if (G.prog.exestack.len <= 2)
6609 QUIT_OR_RETURN_TO_MAIN;
6610 bc_vec_npop(&G.prog.exestack, 2);
6611 goto read_updated_ip;
6613 s = zdc_program_nquit();
6614 //goto read_updated_ip; - just fall through to it
6617 // Instruction stack has changed, read new pointers
6618 ip = bc_vec_top(&G.prog.exestack);
6619 func = bc_program_func(ip->func);
6620 code = func->code.v;
6621 dbg_exec("func:%zd bytes:%zd ip:%zd", ip->func, func->code.len, ip->idx);
6624 if (s || G_interrupt) {
6633 RETURN_STATUS(BC_STATUS_SUCCESS);
6635 #define zbc_program_exec(...) (zbc_program_exec(__VA_ARGS__) COMMA_SUCCESS)
6637 static unsigned bc_vm_envLen(const char *var)
6643 len = BC_NUM_PRINT_WIDTH;
6644 if (!lenv) return len;
6646 len = bb_strtou(lenv, NULL, 10) - 1;
6647 if (errno || len < 2 || len >= INT_MAX)
6648 len = BC_NUM_PRINT_WIDTH;
6653 static BC_STATUS zbc_vm_process(const char *text)
6657 dbg_lex_enter("%s:%d entered", __func__, __LINE__);
6658 s = zbc_parse_text_init(&G.prs, text);
6659 if (s) RETURN_STATUS(s);
6661 while (G.prs.l.t.t != BC_LEX_EOF) {
6662 dbg_lex("%s:%d G.prs.l.t.t:%d", __func__, __LINE__, G.prs.l.t.t);
6663 s = zcommon_parse(&G.prs);
6664 if (s) RETURN_STATUS(s);
6665 s = zbc_program_exec();
6672 dbg_lex_done("%s:%d done", __func__, __LINE__);
6675 #define zbc_vm_process(...) (zbc_vm_process(__VA_ARGS__) COMMA_SUCCESS)
6677 static BC_STATUS zbc_vm_execute_FILE(FILE *fp, const char *filename)
6679 // So far bc/dc have no way to include a file from another file,
6680 // therefore we know G.prog.file == NULL on entry
6681 //const char *sv_file;
6684 G.prog.file = filename;
6686 bc_lex_file(&G.prs.l);
6689 s = zbc_vm_process("");
6690 // We do not stop looping on errors here if reading stdin.
6691 // Example: start interactive bc and enter "return".
6692 // It should say "'return' not in a function"
6693 // but should not exit.
6694 } while (G.input_fp == stdin);
6698 #define zbc_vm_execute_FILE(...) (zbc_vm_execute_FILE(__VA_ARGS__) COMMA_SUCCESS)
6700 static BC_STATUS zbc_vm_file(const char *file)
6705 fp = xfopen_for_read(file);
6706 s = zbc_vm_execute_FILE(fp, file);
6711 #define zbc_vm_file(...) (zbc_vm_file(__VA_ARGS__) COMMA_SUCCESS)
6714 static void bc_vm_info(void)
6716 printf("%s "BB_VER"\n"
6717 "Copyright (c) 2018 Gavin D. Howard and contributors\n"
6721 static void bc_args(char **argv)
6727 #if ENABLE_FEATURE_BC_LONG_OPTIONS
6728 opts = option_mask32 |= getopt32long(argv, "wvsqli",
6729 "warn\0" No_argument "w"
6730 "version\0" No_argument "v"
6731 "standard\0" No_argument "s"
6732 "quiet\0" No_argument "q"
6733 "mathlib\0" No_argument "l"
6734 "interactive\0" No_argument "i"
6737 opts = option_mask32 |= getopt32(argv, "wvsqli");
6739 if (getenv("POSIXLY_CORRECT"))
6740 option_mask32 |= BC_FLAG_S;
6742 if (opts & BC_FLAG_V) {
6747 for (i = optind; argv[i]; ++i)
6748 bc_vec_push(&G.files, argv + i);
6751 static void bc_vm_envArgs(void)
6755 char *env_args = getenv("BC_ENV_ARGS");
6757 if (!env_args) return;
6759 G.env_args = xstrdup(env_args);
6762 bc_vec_init(&v, sizeof(char *), NULL);
6764 while (*(buf = skip_whitespace(buf)) != '\0') {
6765 bc_vec_push(&v, &buf);
6766 buf = skip_non_whitespace(buf);
6772 // NULL terminate, and pass argv[] so that first arg is argv[1]
6773 if (sizeof(int) == sizeof(char*)) {
6774 bc_vec_push(&v, &const_int_0);
6776 static char *const nullptr = NULL;
6777 bc_vec_push(&v, &nullptr);
6779 bc_args(((char **)v.v) - 1);
6784 static const char bc_lib[] ALIGN1 = {
6787 "\n" "auto b,s,n,r,d,i,p,f,v"
6788 ////////////////"if(x<0)return(1/e(-x))" // and drop 'n' and x<0 logic below
6789 //^^^^^^^^^^^^^^^^ this would work, and is even more precise than GNU bc:
6790 //e(-.998896): GNU:.36828580434569428695
6791 // above code:.36828580434569428696
6792 // actual value:.3682858043456942869594...
6793 // but for now let's be "GNU compatible"
6802 "\n" "scale=scale(x)+1"
6812 "\n" "for(i=2;v;++i){"
6818 "\n" "while(d--)r*=r"
6821 "\n" "if(n)return(1/r)"
6825 "\n" "auto b,s,r,p,a,q,i,v"
6829 "\n" "r=(1-10^scale)/1"
6840 "\n" "while(x<=.5){"
6844 "\n" "r=a=(x-1)/(x+1)"
6847 "\n" "for(i=3;v;i+=2){"
6858 "\n" "auto b,s,r,a,q,i"
6859 "\n" "if(x<0)return(-s(-x))"
6863 "\n" "scale=1.1*s+2"
6872 "\n" "for(i=3;a;i+=2){"
6873 "\n" "a*=q/(i*(i-1))"
6886 "\n" "x=s(2*a(1)+x)"
6892 "\n" "auto b,s,r,n,a,m,t,f,i,u"
6900 "\n" "if(scale<65){"
6901 "\n" "if(x==1)return(.7853981633974483096156608458198757210492923498437764552437361480/n)"
6902 "\n" "if(x==.2)return(.1973955598498807583700497651947902934475851037878521015176889402/n)"
6912 "\n" "x=(x-.2)/(1+.2*x)"
6917 "\n" "for(i=3;t;i+=2){"
6924 "\n" "return((m*a+r)/n)"
6926 "\n" "define j(n,x){"
6927 "\n" "auto b,s,o,a,i,v,f"
6938 "\n" "for(i=2;i<=n;++i)a*=i"
6940 "\n" "a=(x^n)/2^n/a"
6943 "\n" "scale+=length(a)-scale(a)"
6944 "\n" "for(i=1;v;++i){"
6945 "\n" "v=v*f/i/(n+i)"
6951 "\n" "return(a*r/1)"
6956 static BC_STATUS zbc_vm_exec(void)
6963 if (option_mask32 & BC_FLAG_L) {
6964 // We know that internal library is not buggy,
6965 // thus error checking is normally disabled.
6966 # define DEBUG_LIB 0
6967 bc_lex_file(&G.prs.l);
6968 s = zbc_vm_process(bc_lib);
6969 if (DEBUG_LIB && s) RETURN_STATUS(s);
6973 s = BC_STATUS_SUCCESS;
6974 fname = (void*)G.files.v;
6975 for (i = 0; i < G.files.len; i++) {
6976 s = zbc_vm_file(*fname++);
6977 if (ENABLE_FEATURE_CLEAN_UP && !G_ttyin && s) {
6978 // Debug config, non-interactive mode:
6979 // return all the way back to main.
6980 // Non-debug builds do not come here
6981 // in non-interactive mode, they exit.
6986 if (IS_BC || (option_mask32 & BC_FLAG_I))
6987 s = zbc_vm_execute_FILE(stdin, /*filename:*/ NULL);
6991 #define zbc_vm_exec(...) (zbc_vm_exec(__VA_ARGS__) COMMA_SUCCESS)
6993 #if ENABLE_FEATURE_CLEAN_UP
6994 static void bc_program_free(void)
6996 bc_vec_free(&G.prog.fns);
6997 IF_BC(bc_vec_free(&G.prog.fn_map);)
6998 bc_vec_free(&G.prog.vars);
6999 bc_vec_free(&G.prog.var_map);
7000 bc_vec_free(&G.prog.arrs);
7001 bc_vec_free(&G.prog.arr_map);
7002 bc_vec_free(&G.prog.strs);
7003 bc_vec_free(&G.prog.consts);
7004 bc_vec_free(&G.prog.results);
7005 bc_vec_free(&G.prog.exestack);
7006 IF_BC(bc_num_free(&G.prog.last);)
7007 IF_BC(bc_num_free(&G.prog.zero);)
7008 IF_BC(bc_num_free(&G.prog.one);)
7009 bc_vec_free(&G.input_buffer);
7012 static void bc_vm_free(void)
7014 bc_vec_free(&G.files);
7016 bc_parse_free(&G.prs);
7021 static void bc_program_init(void)
7025 // memset(&G.prog, 0, sizeof(G.prog)); - already is
7026 memset(&ip, 0, sizeof(BcInstPtr));
7028 // G.prog.nchars = G.prog.scale = 0; - already is
7032 IF_BC(bc_num_init_DEF_SIZE(&G.prog.last);)
7033 //IF_BC(bc_num_zero(&G.prog.last);) - already is
7035 bc_num_init_DEF_SIZE(&G.prog.zero);
7036 //bc_num_zero(&G.prog.zero); - already is
7038 IF_BC(bc_num_init_DEF_SIZE(&G.prog.one);)
7039 IF_BC(bc_num_one(&G.prog.one);)
7041 bc_vec_init(&G.prog.fns, sizeof(BcFunc), bc_func_free);
7042 IF_BC(bc_vec_init(&G.prog.fn_map, sizeof(BcId), bc_id_free);)
7045 // Names are chosen simply to never match
7046 // a valid function name (and be short)
7047 IF_BC(bc_program_addFunc(xstrdup(""))); // func #0: main
7048 IF_BC(bc_program_addFunc(xstrdup(""))); // func #1: for read()
7050 bc_program_add_fn();
7051 bc_program_add_fn();
7054 bc_vec_init(&G.prog.vars, sizeof(BcVec), bc_vec_free);
7055 bc_vec_init(&G.prog.var_map, sizeof(BcId), bc_id_free);
7057 bc_vec_init(&G.prog.arrs, sizeof(BcVec), bc_vec_free);
7058 bc_vec_init(&G.prog.arr_map, sizeof(BcId), bc_id_free);
7060 bc_vec_init(&G.prog.strs, sizeof(char *), bc_string_free);
7061 bc_vec_init(&G.prog.consts, sizeof(char *), bc_string_free);
7062 bc_vec_init(&G.prog.results, sizeof(BcResult), bc_result_free);
7063 bc_vec_init(&G.prog.exestack, sizeof(BcInstPtr), NULL);
7064 bc_vec_push(&G.prog.exestack, &ip);
7066 bc_char_vec_init(&G.input_buffer);
7069 static int bc_vm_init(const char *env_len)
7071 #if ENABLE_FEATURE_EDITING
7072 G.line_input_state = new_line_input_t(DO_HISTORY);
7074 G.prog.len = bc_vm_envLen(env_len);
7076 bc_vec_init(&G.files, sizeof(char *), NULL);
7077 IF_BC(if (IS_BC) bc_vm_envArgs();)
7079 bc_parse_create(&G.prs, BC_PROG_MAIN);
7081 //TODO: in GNU bc, the check is (isatty(0) && isatty(1)),
7082 //-i option unconditionally enables this regardless of isatty():
7084 #if ENABLE_FEATURE_BC_SIGNALS
7086 // With SA_RESTART, most system calls will restart
7087 // (IOW: they won't fail with EINTR).
7088 // In particular, this means ^C won't cause
7089 // stdout to get into "error state" if SIGINT hits
7090 // within write() syscall.
7092 // The downside is that ^C while tty input is taken
7093 // will only be handled after [Enter] since read()
7094 // from stdin is not interrupted by ^C either,
7095 // it restarts, thus fgetc() does not return on ^C.
7096 // (This problem manifests only if line editing is disabled)
7097 signal_SA_RESTART_empty_mask(SIGINT, record_signo);
7099 // Without SA_RESTART, this exhibits a bug:
7100 // "while (1) print 1" and try ^C-ing it.
7101 // Intermittently, instead of returning to input line,
7102 // you'll get "output error: Interrupted system call"
7104 //signal_no_SA_RESTART_empty_mask(SIGINT, record_signo);
7108 return 0; // "not a tty"
7111 static BcStatus bc_vm_run(void)
7113 BcStatus st = zbc_vm_exec();
7114 #if ENABLE_FEATURE_CLEAN_UP
7115 if (G_exiting) // it was actually "halt" or "quit"
7118 # if ENABLE_FEATURE_EDITING
7119 free_line_input_t(G.line_input_state);
7123 dbg_exec("exiting with exitcode %d", st);
7128 int bc_main(int argc, char **argv) MAIN_EXTERNALLY_VISIBLE;
7129 int bc_main(int argc UNUSED_PARAM, char **argv)
7135 is_tty = bc_vm_init("BC_LINE_LENGTH");
7139 if (is_tty && !(option_mask32 & BC_FLAG_Q))
7147 int dc_main(int argc, char **argv) MAIN_EXTERNALLY_VISIBLE;
7148 int dc_main(int argc UNUSED_PARAM, char **argv)
7154 // TODO: dc (GNU bc 1.07.1) 1.4.1 seems to use width
7155 // 1 char wider than bc from the same package.
7156 // Both default width, and xC_LINE_LENGTH=N are wider:
7157 // "DC_LINE_LENGTH=5 dc -e'123456 p'" prints:
7160 // "echo '123456' | BC_LINE_LENGTH=5 bc" prints:
7163 // Do the same, or it's a bug?
7164 bc_vm_init("DC_LINE_LENGTH");
7166 // Run -e'SCRIPT' and -fFILE in order of appearance, then handle FILEs
7167 noscript = BC_FLAG_I;
7169 int n = getopt(argc, argv, "e:f:x");
7175 n = zbc_vm_process(optarg);
7180 n = zbc_vm_file(optarg);
7184 option_mask32 |= DC_FLAG_X;
7194 bc_vec_push(&G.files, argv++);
7197 option_mask32 |= noscript; // set BC_FLAG_I if we need to interpret stdin
7203 #endif // not DC_SMALL