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: "[-sqliw] 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
174 static uint8_t lex_indent;
175 #define dbg_lex(...) \
177 fprintf(stderr, "%*s", lex_indent, ""); \
178 bb_error_msg(__VA_ARGS__); \
180 #define dbg_lex_enter(...) \
182 dbg_lex(__VA_ARGS__); \
185 #define dbg_lex_done(...) \
188 dbg_lex(__VA_ARGS__); \
191 # define dbg_lex(...) ((void)0)
192 # define dbg_lex_enter(...) ((void)0)
193 # define dbg_lex_done(...) ((void)0)
197 # define dbg_exec(...) bb_error_msg(__VA_ARGS__)
199 # define dbg_exec(...) ((void)0)
202 typedef enum BcStatus {
203 BC_STATUS_SUCCESS = 0,
204 BC_STATUS_FAILURE = 1,
205 BC_STATUS_PARSE_EMPTY_EXP = 2, // bc_parse_expr_empty_ok() uses this
208 #define BC_VEC_INVALID_IDX ((size_t) -1)
209 #define BC_VEC_START_CAP (1 << 5)
211 typedef void (*BcVecFree)(void *) FAST_FUNC;
213 typedef struct BcVec {
221 typedef signed char BcDig;
223 typedef struct BcNum {
231 #define BC_NUM_MIN_BASE ((unsigned long) 2)
232 #define BC_NUM_MAX_IBASE ((unsigned long) 16)
233 // larger value might speed up BIGNUM calculations a bit:
234 #define BC_NUM_DEF_SIZE (16)
235 #define BC_NUM_PRINT_WIDTH (69)
237 #define BC_NUM_KARATSUBA_LEN (32)
239 typedef enum BcInst {
269 BC_INST_ASSIGN_POWER,
270 BC_INST_ASSIGN_MULTIPLY,
271 BC_INST_ASSIGN_DIVIDE,
272 BC_INST_ASSIGN_MODULUS,
274 BC_INST_ASSIGN_MINUS,
320 BC_INST_PRINT_STREAM,
335 BC_INST_INVALID = -1,
340 typedef struct BcId {
345 typedef struct BcFunc {
352 typedef enum BcResultType {
357 BC_RESULT_ARRAY_ELEM,
366 // These are between to calculate ibase, obase, and last from instructions.
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 {
420 BC_LEX_OP_ASSIGN_POWER,
421 BC_LEX_OP_ASSIGN_MULTIPLY,
422 BC_LEX_OP_ASSIGN_DIVIDE,
423 BC_LEX_OP_ASSIGN_MODULUS,
424 BC_LEX_OP_ASSIGN_PLUS,
425 BC_LEX_OP_ASSIGN_MINUS,
446 BC_LEX_KEY_1st_keyword,
447 BC_LEX_KEY_AUTO = BC_LEX_KEY_1st_keyword,
454 // code uses "type - BC_LEX_KEY_IBASE + BC_INST_IBASE" construct,
455 BC_LEX_KEY_IBASE, // relative order should match for: BC_INST_IBASE
457 BC_LEX_KEY_LAST, // relative order should match for: BC_INST_LAST
460 BC_LEX_KEY_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
551 #define bc_lex_kws_POSIX(i) ((1 << (i)) & POSIX_KWORD_MASK)
554 #if ENABLE_FEATURE_BC_SIGNALS || ENABLE_FEATURE_CLEAN_UP
555 # define BC_STATUS BcStatus
557 # define BC_STATUS void
560 typedef struct BcLex {
573 #define BC_PARSE_STREND ((char) UCHAR_MAX)
575 #define BC_PARSE_REL (1 << 0)
576 #define BC_PARSE_PRINT (1 << 1)
577 #define BC_PARSE_NOCALL (1 << 2)
578 #define BC_PARSE_NOREAD (1 << 3)
579 #define BC_PARSE_ARRAY (1 << 4)
581 typedef struct BcParse {
592 //TODO: needed? Example?
596 typedef struct BcProgram {
637 #define BC_PROG_STACK(s, n) ((s)->len >= ((size_t) n))
639 #define BC_PROG_MAIN (0)
640 #define BC_PROG_READ (1)
642 #define BC_PROG_REQ_FUNCS (2)
645 #define BC_PROG_STR(n) (!(n)->num && !(n)->cap)
646 #define BC_PROG_NUM(r, n) \
647 ((r)->t != BC_RESULT_ARRAY && (r)->t != BC_RESULT_STR && !BC_PROG_STR(n))
649 #define BC_FLAG_W (1 << 0)
650 #define BC_FLAG_V (1 << 1)
651 #define BC_FLAG_S (1 << 2)
652 #define BC_FLAG_Q (1 << 3)
653 #define BC_FLAG_L (1 << 4)
654 #define BC_FLAG_I (1 << 5)
655 #define DC_FLAG_X (1 << 6)
657 #define BC_MAX(a, b) ((a) > (b) ? (a) : (b))
658 #define BC_MIN(a, b) ((a) < (b) ? (a) : (b))
660 #define BC_MAX_OBASE ((unsigned) 999)
661 #define BC_MAX_DIM ((unsigned) INT_MAX)
662 #define BC_MAX_SCALE ((unsigned) UINT_MAX)
663 #define BC_MAX_STRING ((unsigned) UINT_MAX - 1)
664 #define BC_MAX_NUM BC_MAX_STRING
665 // Unused apart from "limits" message. Just show a "biggish number" there.
666 //#define BC_MAX_NAME BC_MAX_STRING
667 //#define BC_MAX_EXP ((unsigned long) LONG_MAX)
668 //#define BC_MAX_VARS ((unsigned long) SIZE_MAX - 1)
669 #define BC_MAX_NAME_STR "999999999"
670 #define BC_MAX_EXP_STR "999999999"
671 #define BC_MAX_VARS_STR "999999999"
673 #define BC_MAX_OBASE_STR "999"
675 #if INT_MAX == 2147483647
676 # define BC_MAX_DIM_STR "2147483647"
677 #elif INT_MAX == 9223372036854775807
678 # define BC_MAX_DIM_STR "9223372036854775807"
680 # error Strange INT_MAX
683 #if UINT_MAX == 4294967295
684 # define BC_MAX_SCALE_STR "4294967295"
685 # define BC_MAX_STRING_STR "4294967294"
686 #elif UINT_MAX == 18446744073709551615
687 # define BC_MAX_SCALE_STR "18446744073709551615"
688 # define BC_MAX_STRING_STR "18446744073709551614"
690 # error Strange UINT_MAX
692 #define BC_MAX_NUM_STR BC_MAX_STRING_STR
695 IF_FEATURE_BC_SIGNALS(smallint ttyin;)
696 IF_FEATURE_CLEAN_UP(smallint exiting;)
703 // For error messages. Can be set to current parsed line,
704 // or [TODO] to current executing line (can be before last parsed one)
712 #if ENABLE_FEATURE_EDITING
713 line_input_t *line_input_state;
716 #define G (*ptr_to_globals)
717 #define INIT_G() do { \
718 SET_PTR_TO_GLOBALS(xzalloc(sizeof(G))); \
720 #define FREE_G() do { \
721 FREE_PTR_TO_GLOBALS(); \
723 #define G_posix (ENABLE_BC && (option_mask32 & BC_FLAG_S))
724 #define G_warn (ENABLE_BC && (option_mask32 & BC_FLAG_W))
725 #define G_exreg (ENABLE_DC && (option_mask32 & DC_FLAG_X))
726 #if ENABLE_FEATURE_BC_SIGNALS
727 # define G_interrupt bb_got_signal
728 # define G_ttyin G.ttyin
730 # define G_interrupt 0
733 #if ENABLE_FEATURE_CLEAN_UP
734 # define G_exiting G.exiting
738 #define IS_BC (ENABLE_BC && (!ENABLE_DC || applet_name[0] == 'b'))
739 #define IS_DC (ENABLE_DC && (!ENABLE_BC || applet_name[0] != 'b'))
743 // This is a bit array that corresponds to token types. An entry is
744 // true if the token is valid in an expression, false otherwise.
746 BC_PARSE_EXPRS_BITS = 0
747 + ((uint64_t)((0 << 0)+(0 << 1)+(1 << 2)+(1 << 3)+(1 << 4)+(1 << 5)+(1 << 6)+(1 << 7)) << (0*8))
748 + ((uint64_t)((1 << 0)+(1 << 1)+(1 << 2)+(1 << 3)+(1 << 4)+(1 << 5)+(1 << 6)+(1 << 7)) << (1*8))
749 + ((uint64_t)((1 << 0)+(1 << 1)+(1 << 2)+(1 << 3)+(1 << 4)+(1 << 5)+(1 << 6)+(1 << 7)) << (2*8))
750 + ((uint64_t)((1 << 0)+(1 << 1)+(1 << 2)+(0 << 3)+(0 << 4)+(1 << 5)+(1 << 6)+(0 << 7)) << (3*8))
751 + ((uint64_t)((0 << 0)+(0 << 1)+(0 << 2)+(0 << 3)+(0 << 4)+(0 << 5)+(1 << 6)+(1 << 7)) << (4*8))
752 + ((uint64_t)((0 << 0)+(0 << 1)+(0 << 2)+(0 << 3)+(0 << 4)+(0 << 5)+(0 << 6)+(1 << 7)) << (5*8))
753 + ((uint64_t)((0 << 0)+(1 << 1)+(1 << 2)+(1 << 3)+(1 << 4)+(0 << 5)+(0 << 6)+(1 << 7)) << (6*8))
754 + ((uint64_t)((0 << 0)+(1 << 1)+(1 << 2)+(0 << 3) ) << (7*8))
756 static ALWAYS_INLINE long bc_parse_exprs(unsigned i)
758 #if ULONG_MAX > 0xffffffff
759 // 64-bit version (will not work correctly for 32-bit longs!)
760 return BC_PARSE_EXPRS_BITS & (1UL << i);
763 unsigned long m = (uint32_t)BC_PARSE_EXPRS_BITS;
765 m = (uint32_t)(BC_PARSE_EXPRS_BITS >> 32);
768 return m & (1UL << i);
772 // This is an array of data for operators that correspond to token types.
773 static const uint8_t bc_parse_ops[] = {
774 #define OP(p,l) ((int)(l) * 0x10 + (p))
775 OP(0, false), OP( 0, false ), // inc dec
778 OP(3, true ), OP( 3, true ), OP( 3, true ), // pow mul div
779 OP(4, true ), OP( 4, true ), // mod + -
780 OP(6, true ), OP( 6, true ), OP( 6, true ), OP( 6, true ), OP( 6, true ), OP( 6, true ), // == <= >= != < >
782 OP(7, true ), OP( 7, true ), // or and
783 OP(5, false), OP( 5, false ), OP( 5, false ), OP( 5, false ), OP( 5, false ), // ^= *= /= %= +=
784 OP(5, false), OP( 5, false ), // -= =
787 #define bc_parse_op_PREC(i) (bc_parse_ops[i] & 0x0f)
788 #define bc_parse_op_LEFT(i) (bc_parse_ops[i] & 0x10)
790 // Byte array of up to 4 BC_LEX's, packed into 32-bit word
791 typedef uint32_t BcParseNext;
793 // These identify what tokens can come after expressions in certain cases.
795 #define BC_PARSE_NEXT4(a,b,c,d) ( (a) | ((b)<<8) | ((c)<<16) | ((((d)|0x80)<<24)) )
796 #define BC_PARSE_NEXT2(a,b) BC_PARSE_NEXT4(a,b,0xff,0xff)
797 #define BC_PARSE_NEXT1(a) BC_PARSE_NEXT4(a,0xff,0xff,0xff)
798 bc_parse_next_expr = BC_PARSE_NEXT4(BC_LEX_NLINE, BC_LEX_SCOLON, BC_LEX_RBRACE, BC_LEX_EOF),
799 bc_parse_next_param = BC_PARSE_NEXT2(BC_LEX_RPAREN, BC_LEX_COMMA),
800 bc_parse_next_print = BC_PARSE_NEXT4(BC_LEX_COMMA, BC_LEX_NLINE, BC_LEX_SCOLON, BC_LEX_EOF),
801 bc_parse_next_rel = BC_PARSE_NEXT1(BC_LEX_RPAREN),
802 bc_parse_next_elem = BC_PARSE_NEXT1(BC_LEX_RBRACKET),
803 bc_parse_next_for = BC_PARSE_NEXT1(BC_LEX_SCOLON),
804 bc_parse_next_read = BC_PARSE_NEXT2(BC_LEX_NLINE, BC_LEX_EOF),
805 #undef BC_PARSE_NEXT4
806 #undef BC_PARSE_NEXT2
807 #undef BC_PARSE_NEXT1
812 static const //BcLexType - should be this type, but narrower type saves size:
815 BC_LEX_OP_REL_EQ, BC_LEX_OP_REL_LE, BC_LEX_OP_REL_GE, BC_LEX_OP_REL_NE,
816 BC_LEX_OP_REL_LT, BC_LEX_OP_REL_GT, BC_LEX_SCOLON, BC_LEX_COLON,
817 BC_LEX_ELSE, BC_LEX_LOAD, BC_LEX_LOAD_POP, BC_LEX_OP_ASSIGN,
821 static const //BcLexType - should be this type
824 BC_LEX_OP_MODULUS, BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_LPAREN,
825 BC_LEX_INVALID, BC_LEX_OP_MULTIPLY, BC_LEX_OP_PLUS, BC_LEX_INVALID,
826 BC_LEX_OP_MINUS, BC_LEX_INVALID, BC_LEX_OP_DIVIDE,
827 BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID,
828 BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID,
829 BC_LEX_INVALID, BC_LEX_INVALID,
830 BC_LEX_COLON, BC_LEX_SCOLON, BC_LEX_OP_REL_GT, BC_LEX_OP_REL_EQ,
831 BC_LEX_OP_REL_LT, BC_LEX_KEY_READ, BC_LEX_INVALID,
832 BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID,
833 BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_EQ_NO_REG, BC_LEX_INVALID,
834 BC_LEX_KEY_IBASE, BC_LEX_INVALID, BC_LEX_KEY_SCALE, BC_LEX_LOAD_POP,
835 BC_LEX_INVALID, BC_LEX_OP_BOOL_NOT, BC_LEX_KEY_OBASE, BC_LEX_PRINT_STREAM,
836 BC_LEX_NQUIT, BC_LEX_POP, BC_LEX_STORE_PUSH, BC_LEX_INVALID, BC_LEX_INVALID,
837 BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_SCALE_FACTOR, BC_LEX_INVALID,
838 BC_LEX_KEY_LENGTH, BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID,
839 BC_LEX_OP_POWER, BC_LEX_NEG, BC_LEX_INVALID,
840 BC_LEX_ASCIIFY, BC_LEX_INVALID, BC_LEX_CLEAR_STACK, BC_LEX_DUPLICATE,
841 BC_LEX_ELSE, BC_LEX_PRINT_STACK, BC_LEX_INVALID, BC_LEX_INVALID,
842 BC_LEX_STORE_IBASE, BC_LEX_INVALID, BC_LEX_STORE_SCALE, BC_LEX_LOAD,
843 BC_LEX_INVALID, BC_LEX_PRINT_POP, BC_LEX_STORE_OBASE, BC_LEX_KEY_PRINT,
844 BC_LEX_KEY_QUIT, BC_LEX_SWAP, BC_LEX_OP_ASSIGN, BC_LEX_INVALID,
845 BC_LEX_INVALID, BC_LEX_KEY_SQRT, BC_LEX_INVALID, BC_LEX_EXECUTE,
846 BC_LEX_INVALID, BC_LEX_STACK_LEVEL,
847 BC_LEX_LBRACE, BC_LEX_OP_MODEXP, BC_LEX_INVALID, BC_LEX_OP_DIVMOD,
851 static const //BcInst - should be this type. Using signed narrow type since BC_INST_INVALID is -1
854 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID, BC_INST_REL_GE,
855 BC_INST_INVALID, BC_INST_POWER, BC_INST_MULTIPLY, BC_INST_DIVIDE,
856 BC_INST_MODULUS, BC_INST_PLUS, BC_INST_MINUS,
857 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID,
858 BC_INST_INVALID, BC_INST_INVALID,
859 BC_INST_BOOL_NOT, BC_INST_INVALID, BC_INST_INVALID,
860 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID,
861 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID,
862 BC_INST_INVALID, BC_INST_INVALID, BC_INST_REL_GT, BC_INST_INVALID,
863 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID, BC_INST_REL_GE,
864 BC_INST_INVALID, BC_INST_INVALID,
865 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID,
866 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID,
867 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID, BC_INST_IBASE,
868 BC_INST_INVALID, BC_INST_INVALID, BC_INST_LENGTH, BC_INST_INVALID,
869 BC_INST_OBASE, BC_INST_PRINT, BC_INST_QUIT, BC_INST_INVALID,
870 BC_INST_INVALID, BC_INST_SCALE, BC_INST_SQRT, BC_INST_INVALID,
871 BC_INST_REL_EQ, BC_INST_MODEXP, BC_INST_DIVMOD, BC_INST_INVALID,
872 BC_INST_INVALID, BC_INST_EXECUTE, BC_INST_PRINT_STACK, BC_INST_CLEAR_STACK,
873 BC_INST_STACK_LEN, BC_INST_DUPLICATE, BC_INST_SWAP, BC_INST_POP,
874 BC_INST_ASCIIFY, BC_INST_PRINT_STREAM, BC_INST_INVALID, BC_INST_INVALID,
875 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID,
876 BC_INST_PRINT, BC_INST_NQUIT, BC_INST_SCALE_FUNC,
880 // In configurations where errors abort instead of propagating error
881 // return code up the call chain, functions returning BC_STATUS
882 // actually don't return anything, they always succeed and return "void".
883 // A macro wrapper is provided, which makes this statement work:
885 // and makes it visible to the compiler that s is always zero,
886 // allowing compiler to optimize dead code after the statement.
888 // To make code more readable, each such function has a "z"
889 // ("always returning zero") prefix, i.e. zbc_foo or zdc_foo.
891 #if ENABLE_FEATURE_BC_SIGNALS || ENABLE_FEATURE_CLEAN_UP
892 # define ERRORS_ARE_FATAL 0
893 # define ERRORFUNC /*nothing*/
894 # define ERROR_RETURN(a) a
895 //moved up: # define BC_STATUS BcStatus
896 # define RETURN_STATUS(v) return (v)
898 # define ERRORS_ARE_FATAL 1
899 # define ERRORFUNC NORETURN
900 # define ERROR_RETURN(a) /*nothing*/
901 //moved up: # define BC_STATUS void
902 # define RETURN_STATUS(v) do { ((void)(v)); return; } while (0)
905 #define BC_NUM_NEG(n, neg) ((((ssize_t)(n)) ^ -((ssize_t)(neg))) + (neg))
906 #define BC_NUM_ONE(n) ((n)->len == 1 && (n)->rdx == 0 && (n)->num[0] == 1)
907 #define BC_NUM_INT(n) ((n)->len - (n)->rdx)
908 //#define BC_NUM_AREQ(a, b) (BC_MAX((a)->rdx, (b)->rdx) + BC_MAX(BC_NUM_INT(a), BC_NUM_INT(b)) + 1)
909 static /*ALWAYS_INLINE*/ size_t BC_NUM_AREQ(BcNum *a, BcNum *b)
911 return BC_MAX(a->rdx, b->rdx) + BC_MAX(BC_NUM_INT(a), BC_NUM_INT(b)) + 1;
913 //#define BC_NUM_MREQ(a, b, scale) (BC_NUM_INT(a) + BC_NUM_INT(b) + BC_MAX((scale), (a)->rdx + (b)->rdx) + 1)
914 static /*ALWAYS_INLINE*/ size_t BC_NUM_MREQ(BcNum *a, BcNum *b, size_t scale)
916 return BC_NUM_INT(a) + BC_NUM_INT(b) + BC_MAX(scale, a->rdx + b->rdx) + 1;
919 typedef void (*BcNumDigitOp)(size_t, size_t, bool) FAST_FUNC;
921 typedef BC_STATUS (*BcNumBinaryOp)(BcNum *, BcNum *, BcNum *, size_t) FAST_FUNC;
923 static BC_STATUS zbc_num_binary(BcNum *a, BcNum *b, BcNum *c, size_t scale,
924 BcNumBinaryOp op, size_t req);
925 static FAST_FUNC BC_STATUS zbc_num_a(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale);
926 static FAST_FUNC BC_STATUS zbc_num_s(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale);
927 static FAST_FUNC BC_STATUS zbc_num_p(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale);
928 static FAST_FUNC BC_STATUS zbc_num_m(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale);
929 static FAST_FUNC BC_STATUS zbc_num_d(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale);
930 static FAST_FUNC BC_STATUS zbc_num_rem(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale);
932 static FAST_FUNC BC_STATUS zbc_num_add(BcNum *a, BcNum *b, BcNum *c, size_t scale)
934 BcNumBinaryOp op = (!a->neg == !b->neg) ? zbc_num_a : zbc_num_s;
936 RETURN_STATUS(zbc_num_binary(a, b, c, false, op, BC_NUM_AREQ(a, b)));
939 static FAST_FUNC BC_STATUS zbc_num_sub(BcNum *a, BcNum *b, BcNum *c, size_t scale)
941 BcNumBinaryOp op = (!a->neg == !b->neg) ? zbc_num_s : zbc_num_a;
943 RETURN_STATUS(zbc_num_binary(a, b, c, true, op, BC_NUM_AREQ(a, b)));
946 static FAST_FUNC BC_STATUS zbc_num_mul(BcNum *a, BcNum *b, BcNum *c, size_t scale)
948 size_t req = BC_NUM_MREQ(a, b, scale);
949 RETURN_STATUS(zbc_num_binary(a, b, c, scale, zbc_num_m, req));
952 static FAST_FUNC BC_STATUS zbc_num_div(BcNum *a, BcNum *b, BcNum *c, size_t scale)
954 size_t req = BC_NUM_MREQ(a, b, scale);
955 RETURN_STATUS(zbc_num_binary(a, b, c, scale, zbc_num_d, req));
958 static FAST_FUNC BC_STATUS zbc_num_mod(BcNum *a, BcNum *b, BcNum *c, size_t scale)
960 size_t req = BC_NUM_MREQ(a, b, scale);
961 RETURN_STATUS(zbc_num_binary(a, b, c, scale, zbc_num_rem, req));
964 static FAST_FUNC BC_STATUS zbc_num_pow(BcNum *a, BcNum *b, BcNum *c, size_t scale)
966 RETURN_STATUS(zbc_num_binary(a, b, c, scale, zbc_num_p, a->len * b->len + 1));
969 static const BcNumBinaryOp zbc_program_ops[] = {
970 zbc_num_pow, zbc_num_mul, zbc_num_div, zbc_num_mod, zbc_num_add, zbc_num_sub,
973 # define zbc_num_add(...) (zbc_num_add(__VA_ARGS__), BC_STATUS_SUCCESS)
974 # define zbc_num_sub(...) (zbc_num_sub(__VA_ARGS__), BC_STATUS_SUCCESS)
975 # define zbc_num_mul(...) (zbc_num_mul(__VA_ARGS__), BC_STATUS_SUCCESS)
976 # define zbc_num_div(...) (zbc_num_div(__VA_ARGS__), BC_STATUS_SUCCESS)
977 # define zbc_num_mod(...) (zbc_num_mod(__VA_ARGS__), BC_STATUS_SUCCESS)
978 # define zbc_num_pow(...) (zbc_num_pow(__VA_ARGS__), BC_STATUS_SUCCESS)
981 static void fflush_and_check(void)
984 if (ferror(stdout) || ferror(stderr))
985 bb_perror_msg_and_die("output error");
988 #if ENABLE_FEATURE_CLEAN_UP
989 #define QUIT_OR_RETURN_TO_MAIN \
991 IF_FEATURE_BC_SIGNALS(G_ttyin = 0;) /* do not loop in main loop anymore */ \
993 return BC_STATUS_FAILURE; \
996 #define QUIT_OR_RETURN_TO_MAIN quit()
999 static void quit(void) NORETURN;
1000 static void quit(void)
1003 bb_perror_msg_and_die("input error");
1005 dbg_exec("quit(): exiting with exitcode SUCCESS");
1009 static void bc_verror_msg(const char *fmt, va_list p)
1011 const char *sv = sv; // for compiler
1014 applet_name = xasprintf("%s: %s:%u", applet_name, G.prog.file, G.err_line);
1016 bb_verror_msg(fmt, p, NULL);
1018 free((char*)applet_name);
1023 static NOINLINE ERRORFUNC int bc_error_fmt(const char *fmt, ...)
1028 bc_verror_msg(fmt, p);
1031 if (!ENABLE_FEATURE_CLEAN_UP && !G_ttyin)
1033 ERROR_RETURN(return BC_STATUS_FAILURE;)
1037 static NOINLINE int bc_posix_error_fmt(const char *fmt, ...)
1041 // Are non-POSIX constructs totally ok?
1042 if (!(option_mask32 & (BC_FLAG_S|BC_FLAG_W)))
1043 return BC_STATUS_SUCCESS; // yes
1046 bc_verror_msg(fmt, p);
1049 // Do we treat non-POSIX constructs as errors?
1050 if (!(option_mask32 & BC_FLAG_S))
1051 return BC_STATUS_SUCCESS; // no, it's a warning
1052 if (!ENABLE_FEATURE_CLEAN_UP && !G_ttyin)
1054 return BC_STATUS_FAILURE;
1058 // We use error functions with "return bc_error(FMT[, PARAMS])" idiom.
1059 // This idiom begs for tail-call optimization, but for it to work,
1060 // function must not have caller-cleaned parameters on stack.
1061 // Unfortunately, vararg function API does exactly that on most arches.
1062 // Thus, use these shims for the cases when we have no vararg PARAMS:
1063 static ERRORFUNC int bc_error(const char *msg)
1065 ERROR_RETURN(return) bc_error_fmt("%s", msg);
1067 static ERRORFUNC int bc_error_bad_character(char c)
1069 ERROR_RETURN(return) bc_error_fmt("bad character '%c'", c);
1071 static ERRORFUNC int bc_error_bad_expression(void)
1073 ERROR_RETURN(return) bc_error("bad expression");
1075 static ERRORFUNC int bc_error_bad_token(void)
1077 ERROR_RETURN(return) bc_error("bad token");
1079 static ERRORFUNC int bc_error_stack_has_too_few_elements(void)
1081 ERROR_RETURN(return) bc_error("stack has too few elements");
1083 static ERRORFUNC int bc_error_variable_is_wrong_type(void)
1085 ERROR_RETURN(return) bc_error("variable is wrong type");
1087 static ERRORFUNC int bc_error_nested_read_call(void)
1089 ERROR_RETURN(return) bc_error("read() call inside of a read() call");
1092 static int bc_POSIX_requires(const char *msg)
1094 return bc_posix_error_fmt("POSIX requires %s", msg);
1096 static int bc_POSIX_does_not_allow(const char *msg)
1098 return bc_posix_error_fmt("%s%s", "POSIX does not allow ", msg);
1100 static int bc_POSIX_does_not_allow_bool_ops_this_is_bad(const char *msg)
1102 return bc_posix_error_fmt("%s%s %s", "POSIX does not allow ", "boolean operators; the following is bad:", msg);
1104 static int bc_POSIX_does_not_allow_empty_X_expression_in_for(const char *msg)
1106 return bc_posix_error_fmt("%san empty %s expression in a for loop", "POSIX does not allow ", msg);
1110 static void bc_vec_grow(BcVec *v, size_t n)
1112 size_t cap = v->cap * 2;
1113 while (cap < v->len + n) cap *= 2;
1114 v->v = xrealloc(v->v, v->size * cap);
1118 static void bc_vec_init(BcVec *v, size_t esize, BcVecFree dtor)
1121 v->cap = BC_VEC_START_CAP;
1124 v->v = xmalloc(esize * BC_VEC_START_CAP);
1127 static void bc_char_vec_init(BcVec *v)
1129 bc_vec_init(v, sizeof(char), NULL);
1132 static void bc_vec_expand(BcVec *v, size_t req)
1135 v->v = xrealloc(v->v, v->size * req);
1140 static void bc_vec_pop(BcVec *v)
1144 v->dtor(v->v + (v->size * v->len));
1147 static void bc_vec_npop(BcVec *v, size_t n)
1152 size_t len = v->len - n;
1153 while (v->len > len) v->dtor(v->v + (v->size * --v->len));
1157 static void bc_vec_pop_all(BcVec *v)
1159 bc_vec_npop(v, v->len);
1162 static void bc_vec_push(BcVec *v, const void *data)
1164 if (v->len + 1 > v->cap) bc_vec_grow(v, 1);
1165 memmove(v->v + (v->size * v->len), data, v->size);
1169 static void bc_vec_pushByte(BcVec *v, char data)
1171 bc_vec_push(v, &data);
1174 static void bc_vec_pushZeroByte(BcVec *v)
1176 //bc_vec_pushByte(v, '\0');
1178 bc_vec_push(v, &const_int_0);
1181 static void bc_vec_pushAt(BcVec *v, const void *data, size_t idx)
1184 bc_vec_push(v, data);
1189 if (v->len == v->cap) bc_vec_grow(v, 1);
1191 ptr = v->v + v->size * idx;
1193 memmove(ptr + v->size, ptr, v->size * (v->len++ - idx));
1194 memmove(ptr, data, v->size);
1198 static void bc_vec_string(BcVec *v, size_t len, const char *str)
1201 bc_vec_expand(v, len + 1);
1202 memcpy(v->v, str, len);
1205 bc_vec_pushZeroByte(v);
1208 #if ENABLE_FEATURE_BC_SIGNALS && ENABLE_FEATURE_EDITING
1209 static void bc_vec_concat(BcVec *v, const char *str)
1213 if (v->len == 0) bc_vec_pushZeroByte(v);
1216 len = v->len + slen;
1218 if (v->cap < len) bc_vec_grow(v, slen);
1219 strcpy(v->v + v->len - 1, str);
1225 static void *bc_vec_item(const BcVec *v, size_t idx)
1227 return v->v + v->size * idx;
1230 static char** bc_program_str(size_t idx)
1232 return bc_vec_item(&G.prog.strs, idx);
1235 static BcFunc* bc_program_func(size_t idx)
1237 return bc_vec_item(&G.prog.fns, idx);
1240 static void *bc_vec_item_rev(const BcVec *v, size_t idx)
1242 return v->v + v->size * (v->len - idx - 1);
1245 static void *bc_vec_top(const BcVec *v)
1247 return v->v + v->size * (v->len - 1);
1250 static FAST_FUNC void bc_vec_free(void *vec)
1252 BcVec *v = (BcVec *) vec;
1257 static int bc_id_cmp(const void *e1, const void *e2)
1259 return strcmp(((const BcId *) e1)->name, ((const BcId *) e2)->name);
1262 static FAST_FUNC void bc_id_free(void *id)
1264 free(((BcId *) id)->name);
1267 static size_t bc_map_find(const BcVec *v, const void *ptr)
1269 size_t low = 0, high = v->len;
1271 while (low < high) {
1273 size_t mid = (low + high) / 2;
1274 BcId *id = bc_vec_item(v, mid);
1275 int result = bc_id_cmp(ptr, id);
1279 else if (result < 0)
1288 static int bc_map_insert(BcVec *v, const void *ptr, size_t *i)
1290 size_t n = *i = bc_map_find(v, ptr);
1293 bc_vec_push(v, ptr);
1294 else if (!bc_id_cmp(ptr, bc_vec_item(v, n)))
1295 return 0; // "was not inserted"
1297 bc_vec_pushAt(v, ptr, n);
1298 return 1; // "was inserted"
1302 static size_t bc_map_index(const BcVec *v, const void *ptr)
1304 size_t i = bc_map_find(v, ptr);
1305 if (i >= v->len) return BC_VEC_INVALID_IDX;
1306 return bc_id_cmp(ptr, bc_vec_item(v, i)) ? BC_VEC_INVALID_IDX : i;
1310 static int bad_input_byte(char c)
1312 if ((c < ' ' && c != '\t' && c != '\r' && c != '\n') // also allow '\v' '\f'?
1315 bc_error_fmt("illegal character 0x%02x", c);
1321 // Note: it _appends_ data from the stdin to vec.
1322 static void bc_read_line(BcVec *vec)
1327 #if ENABLE_FEATURE_BC_SIGNALS
1328 if (G_interrupt) { // ^C was pressed
1331 // GNU bc says "interrupted execution."
1332 // GNU dc says "Interrupt!"
1333 fputs("\ninterrupted execution\n", stderr);
1336 # if ENABLE_FEATURE_EDITING
1339 # define line_buf bb_common_bufsiz1
1340 n = read_line_input(G.line_input_state, "", line_buf, COMMON_BUFSIZE);
1341 if (n <= 0) { // read errors or EOF, or ^D, or ^C
1344 bc_vec_pushZeroByte(vec);
1349 char c = line_buf[i++];
1351 if (bad_input_byte(c)) goto again;
1353 bc_vec_concat(vec, line_buf);
1361 size_t len = vec->len;
1363 IF_FEATURE_BC_SIGNALS(errno = 0;)
1366 #if ENABLE_FEATURE_BC_SIGNALS && !ENABLE_FEATURE_EDITING
1367 // Both conditions appear simultaneously, check both just in case
1368 if (errno == EINTR || G_interrupt) {
1376 quit(); // this emits error message
1377 // Note: EOF does not append '\n', therefore:
1378 // printf 'print 123\n' | bc - works
1379 // printf 'print 123' | bc - fails (syntax error)
1382 bad_chars |= bad_input_byte(c);
1383 bc_vec_pushByte(vec, (char)c);
1384 } while (c != '\n');
1386 // Bad chars on this line, ignore entire line
1390 bc_vec_pushZeroByte(vec);
1394 static char* bc_read_file(const char *path)
1397 size_t size = ((size_t) -1);
1400 // Never returns NULL (dies on errors)
1401 buf = xmalloc_xopen_read_close(path, &size);
1403 for (i = 0; i < size; ++i) {
1405 if ((c < ' ' && c != '\t' && c != '\r' && c != '\n') // also allow '\v' '\f'?
1417 static void bc_num_setToZero(BcNum *n, size_t scale)
1424 static void bc_num_zero(BcNum *n)
1426 bc_num_setToZero(n, 0);
1429 static void bc_num_one(BcNum *n)
1431 bc_num_setToZero(n, 0);
1436 static void bc_num_ten(BcNum *n)
1438 bc_num_setToZero(n, 0);
1444 // Note: this also sets BcNum to zero
1445 static void bc_num_init(BcNum *n, size_t req)
1447 req = req >= BC_NUM_DEF_SIZE ? req : BC_NUM_DEF_SIZE;
1448 //memset(n, 0, sizeof(BcNum)); - cleared by assignments below
1449 n->num = xmalloc(req);
1456 static void bc_num_init_DEF_SIZE(BcNum *n)
1458 bc_num_init(n, BC_NUM_DEF_SIZE);
1461 static void bc_num_expand(BcNum *n, size_t req)
1463 req = req >= BC_NUM_DEF_SIZE ? req : BC_NUM_DEF_SIZE;
1465 n->num = xrealloc(n->num, req);
1470 static FAST_FUNC void bc_num_free(void *num)
1472 free(((BcNum *) num)->num);
1475 static void bc_num_copy(BcNum *d, BcNum *s)
1478 bc_num_expand(d, s->cap);
1482 memcpy(d->num, s->num, sizeof(BcDig) * d->len);
1486 static BC_STATUS zbc_num_ulong(BcNum *n, unsigned long *result_p)
1489 unsigned long pow, result;
1491 if (n->neg) RETURN_STATUS(bc_error("negative number"));
1493 for (result = 0, pow = 1, i = n->rdx; i < n->len; ++i) {
1495 unsigned long prev = result, powprev = pow;
1497 result += ((unsigned long) n->num[i]) * pow;
1500 if (result < prev || pow < powprev)
1501 RETURN_STATUS(bc_error("overflow"));
1507 RETURN_STATUS(BC_STATUS_SUCCESS);
1509 #if ERRORS_ARE_FATAL
1510 # define zbc_num_ulong(...) (zbc_num_ulong(__VA_ARGS__), BC_STATUS_SUCCESS)
1513 static void bc_num_ulong2num(BcNum *n, unsigned long val)
1519 if (val == 0) return;
1521 if (ULONG_MAX == 0xffffffffUL)
1522 bc_num_expand(n, 10); // 10 digits: 4294967295
1523 if (ULONG_MAX == 0xffffffffffffffffULL)
1524 bc_num_expand(n, 20); // 20 digits: 18446744073709551615
1525 BUILD_BUG_ON(ULONG_MAX > 0xffffffffffffffffULL);
1532 if (val == 0) break;
1536 static void bc_num_subArrays(BcDig *restrict a, BcDig *restrict b,
1540 for (i = 0; i < len; ++i) {
1541 for (a[i] -= b[i], j = 0; a[i + j] < 0;) {
1548 static ssize_t bc_num_compare(BcDig *restrict a, BcDig *restrict b, size_t len)
1552 for (i = len - 1; i < len && !(c = a[i] - b[i]); --i);
1553 return BC_NUM_NEG(i + 1, c < 0);
1556 static ssize_t bc_num_cmp(BcNum *a, BcNum *b)
1558 size_t i, min, a_int, b_int, diff;
1559 BcDig *max_num, *min_num;
1563 if (a == b) return 0;
1564 if (a->len == 0) return BC_NUM_NEG(!!b->len, !b->neg);
1565 if (b->len == 0) return BC_NUM_NEG(1, a->neg);
1567 if (a->neg != b->neg) // signs of a and b differ
1568 // +a,-b = a>b = 1 or -a,+b = a<b = -1
1569 return (int)b->neg - (int)a->neg;
1570 neg = a->neg; // 1 if both negative, 0 if both positive
1572 a_int = BC_NUM_INT(a);
1573 b_int = BC_NUM_INT(b);
1576 if (a_int != 0) return (ssize_t) a_int;
1578 a_max = (a->rdx > b->rdx);
1581 diff = a->rdx - b->rdx;
1582 max_num = a->num + diff;
1584 // neg = (a_max == neg); - NOP (maps 1->1 and 0->0)
1587 diff = b->rdx - a->rdx;
1588 max_num = b->num + diff;
1590 neg = !neg; // same as "neg = (a_max == neg)"
1593 cmp = bc_num_compare(max_num, min_num, b_int + min);
1594 if (cmp != 0) return BC_NUM_NEG(cmp, neg);
1596 for (max_num -= diff, i = diff - 1; i < diff; --i) {
1597 if (max_num[i]) return BC_NUM_NEG(1, neg);
1603 static void bc_num_truncate(BcNum *n, size_t places)
1605 if (places == 0) return;
1611 memmove(n->num, n->num + places, n->len * sizeof(BcDig));
1615 static void bc_num_extend(BcNum *n, size_t places)
1617 size_t len = n->len + places;
1621 if (n->cap < len) bc_num_expand(n, len);
1623 memmove(n->num + places, n->num, sizeof(BcDig) * n->len);
1624 memset(n->num, 0, sizeof(BcDig) * places);
1631 static void bc_num_clean(BcNum *n)
1633 while (n->len > 0 && n->num[n->len - 1] == 0) --n->len;
1636 else if (n->len < n->rdx)
1640 static void bc_num_retireMul(BcNum *n, size_t scale, bool neg1, bool neg2)
1643 bc_num_extend(n, scale - n->rdx);
1645 bc_num_truncate(n, n->rdx - scale);
1648 if (n->len != 0) n->neg = !neg1 != !neg2;
1651 static void bc_num_split(BcNum *restrict n, size_t idx, BcNum *restrict a,
1656 b->len = n->len - idx;
1658 a->rdx = b->rdx = 0;
1660 memcpy(b->num, n->num + idx, b->len * sizeof(BcDig));
1661 memcpy(a->num, n->num, idx * sizeof(BcDig));
1672 static BC_STATUS zbc_num_shift(BcNum *n, size_t places)
1674 if (places == 0 || n->len == 0) RETURN_STATUS(BC_STATUS_SUCCESS);
1676 // This check makes sense only if size_t is (much) larger than BC_MAX_NUM.
1677 if (SIZE_MAX > (BC_MAX_NUM | 0xff)) {
1678 if (places + n->len > BC_MAX_NUM)
1679 RETURN_STATUS(bc_error("number too long: must be [1,"BC_MAX_NUM_STR"]"));
1682 if (n->rdx >= places)
1685 bc_num_extend(n, places - n->rdx);
1691 RETURN_STATUS(BC_STATUS_SUCCESS);
1693 #if ERRORS_ARE_FATAL
1694 # define zbc_num_shift(...) (zbc_num_shift(__VA_ARGS__), BC_STATUS_SUCCESS)
1697 static BC_STATUS zbc_num_inv(BcNum *a, BcNum *b, size_t scale)
1706 RETURN_STATUS(zbc_num_div(&one, a, b, scale));
1708 #if ERRORS_ARE_FATAL
1709 # define zbc_num_inv(...) (zbc_num_inv(__VA_ARGS__), BC_STATUS_SUCCESS)
1712 static FAST_FUNC BC_STATUS zbc_num_a(BcNum *a, BcNum *b, BcNum *restrict c, size_t sub)
1714 BcDig *ptr, *ptr_a, *ptr_b, *ptr_c;
1715 size_t i, max, min_rdx, min_int, diff, a_int, b_int;
1718 // Because this function doesn't need to use scale (per the bc spec),
1719 // I am hijacking it to say whether it's doing an add or a subtract.
1723 if (sub && c->len) c->neg = !c->neg;
1724 RETURN_STATUS(BC_STATUS_SUCCESS);
1728 RETURN_STATUS(BC_STATUS_SUCCESS);
1732 c->rdx = BC_MAX(a->rdx, b->rdx);
1733 min_rdx = BC_MIN(a->rdx, b->rdx);
1736 if (a->rdx > b->rdx) {
1737 diff = a->rdx - b->rdx;
1739 ptr_a = a->num + diff;
1743 diff = b->rdx - a->rdx;
1746 ptr_b = b->num + diff;
1749 for (ptr_c = c->num, i = 0; i < diff; ++i, ++c->len) ptr_c[i] = ptr[i];
1752 a_int = BC_NUM_INT(a);
1753 b_int = BC_NUM_INT(b);
1755 if (a_int > b_int) {
1766 for (carry = 0, i = 0; i < min_rdx + min_int; ++i, ++c->len) {
1767 in = ((int) ptr_a[i]) + ((int) ptr_b[i]) + carry;
1769 ptr_c[i] = (BcDig)(in % 10);
1772 for (; i < max + min_rdx; ++i, ++c->len) {
1773 in = ((int) ptr[i]) + carry;
1775 ptr_c[i] = (BcDig)(in % 10);
1778 if (carry != 0) c->num[c->len++] = (BcDig) carry;
1780 RETURN_STATUS(BC_STATUS_SUCCESS); // can't make void, see zbc_num_binary()
1783 static FAST_FUNC BC_STATUS zbc_num_s(BcNum *a, BcNum *b, BcNum *restrict c, size_t sub)
1786 BcNum *minuend, *subtrahend;
1788 bool aneg, bneg, neg;
1790 // Because this function doesn't need to use scale (per the bc spec),
1791 // I am hijacking it to say whether it's doing an add or a subtract.
1795 if (sub && c->len) c->neg = !c->neg;
1796 RETURN_STATUS(BC_STATUS_SUCCESS);
1800 RETURN_STATUS(BC_STATUS_SUCCESS);
1805 a->neg = b->neg = false;
1807 cmp = bc_num_cmp(a, b);
1813 bc_num_setToZero(c, BC_MAX(a->rdx, b->rdx));
1814 RETURN_STATUS(BC_STATUS_SUCCESS);
1823 if (sub) neg = !neg;
1828 bc_num_copy(c, minuend);
1831 if (c->rdx < subtrahend->rdx) {
1832 bc_num_extend(c, subtrahend->rdx - c->rdx);
1836 start = c->rdx - subtrahend->rdx;
1838 bc_num_subArrays(c->num + start, subtrahend->num, subtrahend->len);
1842 RETURN_STATUS(BC_STATUS_SUCCESS); // can't make void, see zbc_num_binary()
1845 static FAST_FUNC BC_STATUS zbc_num_k(BcNum *restrict a, BcNum *restrict b,
1847 #if ERRORS_ARE_FATAL
1848 # define zbc_num_k(...) (zbc_num_k(__VA_ARGS__), BC_STATUS_SUCCESS)
1852 size_t max = BC_MAX(a->len, b->len), max2 = (max + 1) / 2;
1853 BcNum l1, h1, l2, h2, m2, m1, z0, z1, z2, temp;
1856 if (a->len == 0 || b->len == 0) {
1858 RETURN_STATUS(BC_STATUS_SUCCESS);
1860 aone = BC_NUM_ONE(a);
1861 if (aone || BC_NUM_ONE(b)) {
1862 bc_num_copy(c, aone ? b : a);
1863 RETURN_STATUS(BC_STATUS_SUCCESS);
1866 if (a->len + b->len < BC_NUM_KARATSUBA_LEN ||
1867 a->len < BC_NUM_KARATSUBA_LEN || b->len < BC_NUM_KARATSUBA_LEN)
1872 bc_num_expand(c, a->len + b->len + 1);
1874 memset(c->num, 0, sizeof(BcDig) * c->cap);
1877 for (i = 0; i < b->len; ++i) {
1880 for (j = 0; j < a->len; ++j) {
1881 unsigned in = c->num[i + j];
1882 in += ((unsigned) a->num[j]) * ((unsigned) b->num[i]) + carry;
1883 // note: compilers prefer _unsigned_ div/const
1885 c->num[i + j] = (BcDig)(in % 10);
1888 c->num[i + j] += (BcDig) carry;
1889 len = BC_MAX(len, i + j + !!carry);
1891 #if ENABLE_FEATURE_BC_SIGNALS
1893 // a*a <- without check below, this will not be interruptible
1894 if (G_interrupt) return BC_STATUS_FAILURE;
1900 RETURN_STATUS(BC_STATUS_SUCCESS);
1903 bc_num_init(&l1, max);
1904 bc_num_init(&h1, max);
1905 bc_num_init(&l2, max);
1906 bc_num_init(&h2, max);
1907 bc_num_init(&m1, max);
1908 bc_num_init(&m2, max);
1909 bc_num_init(&z0, max);
1910 bc_num_init(&z1, max);
1911 bc_num_init(&z2, max);
1912 bc_num_init(&temp, max + max);
1914 bc_num_split(a, max2, &l1, &h1);
1915 bc_num_split(b, max2, &l2, &h2);
1917 s = zbc_num_add(&h1, &l1, &m1, 0);
1919 s = zbc_num_add(&h2, &l2, &m2, 0);
1922 s = zbc_num_k(&h1, &h2, &z0);
1924 s = zbc_num_k(&m1, &m2, &z1);
1926 s = zbc_num_k(&l1, &l2, &z2);
1929 s = zbc_num_sub(&z1, &z0, &temp, 0);
1931 s = zbc_num_sub(&temp, &z2, &z1, 0);
1934 s = zbc_num_shift(&z0, max2 * 2);
1936 s = zbc_num_shift(&z1, max2);
1938 s = zbc_num_add(&z0, &z1, &temp, 0);
1940 s = zbc_num_add(&temp, &z2, c, 0);
1956 static FAST_FUNC BC_STATUS zbc_num_m(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale)
1960 size_t maxrdx = BC_MAX(a->rdx, b->rdx);
1962 scale = BC_MAX(scale, a->rdx);
1963 scale = BC_MAX(scale, b->rdx);
1964 scale = BC_MIN(a->rdx + b->rdx, scale);
1965 maxrdx = BC_MAX(maxrdx, scale);
1967 bc_num_init(&cpa, a->len);
1968 bc_num_init(&cpb, b->len);
1970 bc_num_copy(&cpa, a);
1971 bc_num_copy(&cpb, b);
1972 cpa.neg = cpb.neg = false;
1974 s = zbc_num_shift(&cpa, maxrdx);
1976 s = zbc_num_shift(&cpb, maxrdx);
1978 s = zbc_num_k(&cpa, &cpb, c);
1982 bc_num_expand(c, c->len + maxrdx);
1984 if (c->len < maxrdx) {
1985 memset(c->num + c->len, 0, (c->cap - c->len) * sizeof(BcDig));
1990 bc_num_retireMul(c, scale, a->neg, b->neg);
1997 #if ERRORS_ARE_FATAL
1998 # define zbc_num_m(...) (zbc_num_m(__VA_ARGS__), BC_STATUS_SUCCESS)
2001 static FAST_FUNC BC_STATUS zbc_num_d(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale)
2003 BcStatus s = BC_STATUS_SUCCESS;
2010 RETURN_STATUS(bc_error("divide by zero"));
2012 bc_num_setToZero(c, scale);
2013 RETURN_STATUS(BC_STATUS_SUCCESS);
2015 if (BC_NUM_ONE(b)) {
2017 bc_num_retireMul(c, scale, a->neg, b->neg);
2018 RETURN_STATUS(BC_STATUS_SUCCESS);
2021 bc_num_init(&cp, BC_NUM_MREQ(a, b, scale));
2022 bc_num_copy(&cp, a);
2026 bc_num_expand(&cp, len + 2);
2027 bc_num_extend(&cp, len - cp.len);
2030 if (b->rdx > cp.rdx) bc_num_extend(&cp, b->rdx - cp.rdx);
2032 if (scale > cp.rdx) bc_num_extend(&cp, scale - cp.rdx);
2034 if (b->rdx == b->len) {
2035 for (i = 0; zero && i < len; ++i) zero = !b->num[len - i - 1];
2039 if (cp.cap == cp.len) bc_num_expand(&cp, cp.len + 1);
2041 // We want an extra zero in front to make things simpler.
2042 cp.num[cp.len++] = 0;
2045 bc_num_expand(c, cp.len);
2048 memset(c->num + end, 0, (c->cap - end) * sizeof(BcDig));
2053 for (i = end - 1; !s && i < end; --i) {
2055 for (q = 0; (!s && n[len] != 0) || bc_num_compare(n, p, len) >= 0; ++q)
2056 bc_num_subArrays(n, p, len);
2058 #if ENABLE_FEATURE_BC_SIGNALS
2061 // 1/a <- without check below, this will not be interruptible
2063 s = BC_STATUS_FAILURE;
2069 bc_num_retireMul(c, scale, a->neg, b->neg);
2074 #if ERRORS_ARE_FATAL
2075 # define zbc_num_d(...) (zbc_num_d(__VA_ARGS__), BC_STATUS_SUCCESS)
2078 static FAST_FUNC BC_STATUS zbc_num_r(BcNum *a, BcNum *b, BcNum *restrict c,
2079 BcNum *restrict d, size_t scale, size_t ts)
2086 RETURN_STATUS(bc_error("divide by zero"));
2089 bc_num_setToZero(d, ts);
2090 RETURN_STATUS(BC_STATUS_SUCCESS);
2093 bc_num_init(&temp, d->cap);
2094 s = zbc_num_d(a, b, c, scale);
2097 if (scale != 0) scale = ts;
2099 s = zbc_num_m(c, b, &temp, scale);
2101 s = zbc_num_sub(a, &temp, d, scale);
2104 if (ts > d->rdx && d->len) bc_num_extend(d, ts - d->rdx);
2107 bc_num_retireMul(d, ts, a->neg, b->neg);
2114 #if ERRORS_ARE_FATAL
2115 # define zbc_num_r(...) (zbc_num_r(__VA_ARGS__), BC_STATUS_SUCCESS)
2118 static FAST_FUNC BC_STATUS zbc_num_rem(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale)
2122 size_t ts = BC_MAX(scale + b->rdx, a->rdx), len = BC_NUM_MREQ(a, b, ts);
2124 bc_num_init(&c1, len);
2125 s = zbc_num_r(a, b, &c1, c, scale, ts);
2130 #if ERRORS_ARE_FATAL
2131 # define zbc_num_rem(...) (zbc_num_rem(__VA_ARGS__), BC_STATUS_SUCCESS)
2134 static FAST_FUNC BC_STATUS zbc_num_p(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale)
2136 BcStatus s = BC_STATUS_SUCCESS;
2139 size_t i, powrdx, resrdx;
2142 if (b->rdx) RETURN_STATUS(bc_error("non integer number"));
2146 RETURN_STATUS(BC_STATUS_SUCCESS);
2149 bc_num_setToZero(c, scale);
2150 RETURN_STATUS(BC_STATUS_SUCCESS);
2152 if (BC_NUM_ONE(b)) {
2156 s = zbc_num_inv(a, c, scale);
2163 s = zbc_num_ulong(b, &pow);
2164 if (s) RETURN_STATUS(s);
2166 bc_num_init(©, a->len);
2167 bc_num_copy(©, a);
2172 if (a->rdx * pow < scale)
2173 scale = a->rdx * pow;
2178 for (powrdx = a->rdx; !(pow & 1); pow >>= 1) {
2180 s = zbc_num_mul(©, ©, ©, powrdx);
2182 // Not needed: zbc_num_mul() has a check for ^C:
2183 //if (G_interrupt) {
2184 // s = BC_STATUS_FAILURE;
2189 bc_num_copy(c, ©);
2191 for (resrdx = powrdx, pow >>= 1; pow != 0; pow >>= 1) {
2194 s = zbc_num_mul(©, ©, ©, powrdx);
2199 s = zbc_num_mul(c, ©, c, resrdx);
2202 // Not needed: zbc_num_mul() has a check for ^C:
2203 //if (G_interrupt) {
2204 // s = BC_STATUS_FAILURE;
2210 s = zbc_num_inv(c, c, scale);
2214 if (c->rdx > scale) bc_num_truncate(c, c->rdx - scale);
2216 // We can't use bc_num_clean() here.
2217 for (zero = true, i = 0; zero && i < c->len; ++i) zero = !c->num[i];
2218 if (zero) bc_num_setToZero(c, scale);
2224 #if ERRORS_ARE_FATAL
2225 # define zbc_num_p(...) (zbc_num_p(__VA_ARGS__), BC_STATUS_SUCCESS)
2228 static BC_STATUS zbc_num_binary(BcNum *a, BcNum *b, BcNum *c, size_t scale,
2229 BcNumBinaryOp op, size_t req)
2232 BcNum num2, *ptr_a, *ptr_b;
2237 memcpy(ptr_a, c, sizeof(BcNum));
2246 memcpy(ptr_b, c, sizeof(BcNum));
2254 bc_num_init(c, req);
2256 bc_num_expand(c, req);
2258 s = BC_STATUS_SUCCESS;
2259 ERROR_RETURN(s =) op(ptr_a, ptr_b, c, scale);
2261 if (init) bc_num_free(&num2);
2265 #if ERRORS_ARE_FATAL
2266 # define zbc_num_binary(...) (zbc_num_binary(__VA_ARGS__), BC_STATUS_SUCCESS)
2269 static bool bc_num_strValid(const char *val, size_t base)
2274 b = (BcDig)(base <= 10 ? base + '0' : base - 10 + 'A');
2281 if (radix) return false;
2285 if (c < '0' || c >= b || (c > '9' && c < 'A'))
2291 // Note: n is already "bc_num_zero()"ed,
2292 // leading zeroes in "val" are removed
2293 static void bc_num_parseDecimal(BcNum *n, const char *val)
2302 bc_num_expand(n, len);
2304 ptr = strchr(val, '.');
2308 n->rdx = (size_t)((val + len) - (ptr + 1));
2310 for (i = 0; val[i]; ++i) {
2311 if (val[i] != '0' && val[i] != '.') {
2312 // Not entirely zero value - convert it, and exit
2315 n->num[n->len] = val[i] - '0';
2319 if (val[--i] == '.') goto skip_dot;
2324 // if for() exits without hitting if(), the value is entirely zero
2327 // Note: n is already "bc_num_zero()"ed,
2328 // leading zeroes in "val" are removed
2329 static void bc_num_parseBase(BcNum *n, const char *val, BcNum *base)
2332 BcNum temp, mult, result;
2337 for (i = 0; ; ++i) {
2340 if (val[i] != '.' && val[i] != '0')
2344 bc_num_init_DEF_SIZE(&temp);
2345 bc_num_init_DEF_SIZE(&mult);
2349 if (c == '\0') goto int_err;
2350 if (c == '.') break;
2352 v = (unsigned long) (c <= '9' ? c - '0' : c - 'A' + 10);
2354 s = zbc_num_mul(n, base, &mult, 0);
2355 if (s) goto int_err;
2356 bc_num_ulong2num(&temp, v);
2357 s = zbc_num_add(&mult, &temp, n, 0);
2358 if (s) goto int_err;
2361 bc_num_init(&result, base->len);
2362 //bc_num_zero(&result); - already is
2368 if (c == '\0') break;
2371 v = (unsigned long) (c <= '9' ? c - '0' : c - 'A' + 10);
2373 s = zbc_num_mul(&result, base, &result, 0);
2375 bc_num_ulong2num(&temp, v);
2376 s = zbc_num_add(&result, &temp, &result, 0);
2378 s = zbc_num_mul(&mult, base, &mult, 0);
2382 s = zbc_num_div(&result, &mult, &result, digits);
2384 s = zbc_num_add(n, &result, n, digits);
2388 if (n->rdx < digits) bc_num_extend(n, digits - n->rdx);
2393 bc_num_free(&result);
2399 static BC_STATUS zbc_num_parse(BcNum *n, const char *val, BcNum *base,
2402 if (!bc_num_strValid(val, base_t))
2403 RETURN_STATUS(bc_error("bad number string"));
2406 while (*val == '0') val++;
2409 bc_num_parseDecimal(n, val);
2411 bc_num_parseBase(n, val, base);
2413 RETURN_STATUS(BC_STATUS_SUCCESS);
2415 #if ERRORS_ARE_FATAL
2416 # define zbc_num_parse(...) (zbc_num_parse(__VA_ARGS__), BC_STATUS_SUCCESS)
2419 static BC_STATUS zbc_num_sqrt(BcNum *a, BcNum *restrict b, size_t scale)
2422 BcNum num1, num2, half, f, fprime, *x0, *x1, *temp;
2423 size_t pow, len, digs, digs1, resrdx, req, times = 0;
2424 ssize_t cmp = 1, cmp1 = SSIZE_MAX, cmp2 = SSIZE_MAX;
2426 req = BC_MAX(scale, a->rdx) + ((BC_NUM_INT(a) + 1) >> 1) + 1;
2427 bc_num_expand(b, req);
2430 bc_num_setToZero(b, scale);
2431 RETURN_STATUS(BC_STATUS_SUCCESS);
2434 RETURN_STATUS(bc_error("negative number"));
2435 else if (BC_NUM_ONE(a)) {
2437 bc_num_extend(b, scale);
2438 RETURN_STATUS(BC_STATUS_SUCCESS);
2441 scale = BC_MAX(scale, a->rdx) + 1;
2442 len = a->len + scale;
2444 bc_num_init(&num1, len);
2445 bc_num_init(&num2, len);
2446 bc_num_init_DEF_SIZE(&half);
2452 bc_num_init(&f, len);
2453 bc_num_init(&fprime, len);
2459 pow = BC_NUM_INT(a);
2468 pow -= 2 - (pow & 1);
2470 bc_num_extend(x0, pow);
2472 // Make sure to move the radix back.
2476 x0->rdx = digs = digs1 = 0;
2478 len = BC_NUM_INT(x0) + resrdx - 1;
2480 while (cmp != 0 || digs < len) {
2482 s = zbc_num_div(a, x0, &f, resrdx);
2484 s = zbc_num_add(x0, &f, &fprime, resrdx);
2486 s = zbc_num_mul(&fprime, &half, x1, resrdx);
2489 cmp = bc_num_cmp(x1, x0);
2490 digs = x1->len - (unsigned long long) llabs(cmp);
2492 if (cmp == cmp2 && digs == digs1)
2497 resrdx += times > 4;
2510 if (b->rdx > scale) bc_num_truncate(b, b->rdx - scale);
2513 bc_num_free(&fprime);
2520 #if ERRORS_ARE_FATAL
2521 # define zbc_num_sqrt(...) (zbc_num_sqrt(__VA_ARGS__), BC_STATUS_SUCCESS)
2524 static BC_STATUS zbc_num_divmod(BcNum *a, BcNum *b, BcNum *c, BcNum *d,
2530 size_t ts = BC_MAX(scale + b->rdx, a->rdx), len = BC_NUM_MREQ(a, b, ts);
2533 memcpy(&num2, c, sizeof(BcNum));
2535 bc_num_init(c, len);
2540 bc_num_expand(c, len);
2543 s = zbc_num_r(ptr_a, b, c, d, scale, ts);
2545 if (init) bc_num_free(&num2);
2549 #if ERRORS_ARE_FATAL
2550 # define zbc_num_divmod(...) (zbc_num_divmod(__VA_ARGS__), BC_STATUS_SUCCESS)
2554 static BC_STATUS zbc_num_modexp(BcNum *a, BcNum *b, BcNum *c, BcNum *restrict d)
2557 BcNum base, exp, two, temp;
2560 RETURN_STATUS(bc_error("divide by zero"));
2561 if (a->rdx || b->rdx || c->rdx)
2562 RETURN_STATUS(bc_error("non integer number"));
2564 RETURN_STATUS(bc_error("negative number"));
2566 bc_num_expand(d, c->len);
2567 bc_num_init(&base, c->len);
2568 bc_num_init(&exp, b->len);
2569 bc_num_init_DEF_SIZE(&two);
2570 bc_num_init(&temp, b->len);
2576 s = zbc_num_rem(a, c, &base, 0);
2578 bc_num_copy(&exp, b);
2580 while (exp.len != 0) {
2582 s = zbc_num_divmod(&exp, &two, &exp, &temp, 0);
2585 if (BC_NUM_ONE(&temp)) {
2586 s = zbc_num_mul(d, &base, &temp, 0);
2588 s = zbc_num_rem(&temp, c, d, 0);
2592 s = zbc_num_mul(&base, &base, &temp, 0);
2594 s = zbc_num_rem(&temp, c, &base, 0);
2605 #if ERRORS_ARE_FATAL
2606 # define zbc_num_modexp(...) (zbc_num_modexp(__VA_ARGS__), BC_STATUS_SUCCESS)
2611 static BC_STATUS zbc_func_insert(BcFunc *f, char *name, bool var)
2616 for (i = 0; i < f->autos.len; ++i) {
2617 if (strcmp(name, ((BcId *) bc_vec_item(&f->autos, i))->name) == 0)
2618 RETURN_STATUS(bc_error("function parameter or auto var has the same name as another"));
2624 bc_vec_push(&f->autos, &a);
2626 RETURN_STATUS(BC_STATUS_SUCCESS);
2628 #if ERRORS_ARE_FATAL
2629 # define zbc_func_insert(...) (zbc_func_insert(__VA_ARGS__), BC_STATUS_SUCCESS)
2633 static void bc_func_init(BcFunc *f)
2635 bc_char_vec_init(&f->code);
2636 bc_vec_init(&f->autos, sizeof(BcId), bc_id_free);
2637 bc_vec_init(&f->labels, sizeof(size_t), NULL);
2641 static FAST_FUNC void bc_func_free(void *func)
2643 BcFunc *f = (BcFunc *) func;
2644 bc_vec_free(&f->code);
2645 bc_vec_free(&f->autos);
2646 bc_vec_free(&f->labels);
2649 static void bc_array_expand(BcVec *a, size_t len);
2651 static void bc_array_init(BcVec *a, bool nums)
2654 bc_vec_init(a, sizeof(BcNum), bc_num_free);
2656 bc_vec_init(a, sizeof(BcVec), bc_vec_free);
2657 bc_array_expand(a, 1);
2660 static void bc_array_expand(BcVec *a, size_t len)
2664 if (a->size == sizeof(BcNum) && a->dtor == bc_num_free) {
2665 while (len > a->len) {
2666 bc_num_init_DEF_SIZE(&data.n);
2667 bc_vec_push(a, &data.n);
2671 while (len > a->len) {
2672 bc_array_init(&data.v, true);
2673 bc_vec_push(a, &data.v);
2678 static void bc_array_copy(BcVec *d, const BcVec *s)
2683 bc_vec_expand(d, s->cap);
2686 for (i = 0; i < s->len; ++i) {
2687 BcNum *dnum = bc_vec_item(d, i), *snum = bc_vec_item(s, i);
2688 bc_num_init(dnum, snum->len);
2689 bc_num_copy(dnum, snum);
2693 static FAST_FUNC void bc_string_free(void *string)
2695 free(*((char **) string));
2699 static void bc_result_copy(BcResult *d, BcResult *src)
2705 case BC_RESULT_TEMP:
2706 case BC_RESULT_IBASE:
2707 case BC_RESULT_SCALE:
2708 case BC_RESULT_OBASE:
2710 bc_num_init(&d->d.n, src->d.n.len);
2711 bc_num_copy(&d->d.n, &src->d.n);
2716 case BC_RESULT_ARRAY:
2717 case BC_RESULT_ARRAY_ELEM:
2719 d->d.id.name = xstrdup(src->d.id.name);
2723 case BC_RESULT_CONSTANT:
2724 case BC_RESULT_LAST:
2728 memcpy(&d->d.n, &src->d.n, sizeof(BcNum));
2735 static FAST_FUNC void bc_result_free(void *result)
2737 BcResult *r = (BcResult *) result;
2741 case BC_RESULT_TEMP:
2742 case BC_RESULT_IBASE:
2743 case BC_RESULT_SCALE:
2744 case BC_RESULT_OBASE:
2746 bc_num_free(&r->d.n);
2751 case BC_RESULT_ARRAY:
2752 case BC_RESULT_ARRAY_ELEM:
2766 static void bc_lex_lineComment(BcLex *l)
2768 l->t.t = BC_LEX_WHITESPACE;
2769 while (l->i < l->len && l->buf[l->i++] != '\n');
2773 static void bc_lex_whitespace(BcLex *l)
2775 l->t.t = BC_LEX_WHITESPACE;
2777 char c = l->buf[l->i];
2778 if (c == '\n' || !isspace(c))
2784 static BC_STATUS zbc_lex_number(BcLex *l, char start)
2786 const char *buf = l->buf + l->i;
2787 size_t len, bslashes, i, ccnt;
2790 pt = (start == '.');
2791 l->t.t = BC_LEX_NUMBER;
2798 if (c == '\\' && buf[i + 1] == '\n') {
2803 if (!isdigit(c) && (c < 'A' || c > 'F')) {
2804 if (c != '.') break;
2805 // if '.' was already seen, stop on second one:
2809 // buf[i] is one of "0-9A-F."
2814 //i is buf[i] index of the first not-yet-parsed char
2817 //ccnt is the number of chars in the number string, excluding possible
2818 //trailing "." and possible following trailing "\<newline>"(s).
2819 len = ccnt - bslashes * 2 + 1; // +1 byte for NUL termination
2821 // This check makes sense only if size_t is (much) larger than BC_MAX_NUM.
2822 if (SIZE_MAX > (BC_MAX_NUM | 0xff)) {
2823 if (len > BC_MAX_NUM)
2824 RETURN_STATUS(bc_error("number too long: must be [1,"BC_MAX_NUM_STR"]"));
2827 bc_vec_pop_all(&l->t.v);
2828 bc_vec_expand(&l->t.v, 1 + len);
2829 bc_vec_push(&l->t.v, &start);
2832 // If we have hit a backslash, skip it. We don't have
2833 // to check for a newline because it's guaranteed.
2839 bc_vec_push(&l->t.v, buf);
2844 bc_vec_pushZeroByte(&l->t.v);
2846 RETURN_STATUS(BC_STATUS_SUCCESS);
2848 #if ERRORS_ARE_FATAL
2849 # define zbc_lex_number(...) (zbc_lex_number(__VA_ARGS__), BC_STATUS_SUCCESS)
2852 static void bc_lex_name(BcLex *l)
2857 l->t.t = BC_LEX_NAME;
2860 buf = l->buf + l->i - 1;
2863 if ((c < 'a' || c > 'z') && !isdigit(c) && c != '_') break;
2867 #if 0 // We do not protect against people with gigabyte-long names
2868 // This check makes sense only if size_t is (much) larger than BC_MAX_STRING.
2869 if (SIZE_MAX > (BC_MAX_STRING | 0xff)) {
2870 if (i > BC_MAX_STRING)
2871 return bc_error("name too long: must be [1,"BC_MAX_STRING_STR"]");
2874 bc_vec_string(&l->t.v, i, buf);
2876 // Increment the index. We minus 1 because it has already been incremented.
2879 //return BC_STATUS_SUCCESS;
2882 static void bc_lex_init(BcLex *l)
2884 bc_char_vec_init(&l->t.v);
2887 static void bc_lex_free(BcLex *l)
2889 bc_vec_free(&l->t.v);
2892 static void bc_lex_file(BcLex *l)
2894 G.err_line = l->line = 1;
2898 IF_BC(static BC_STATUS zbc_lex_token(BcLex *l);)
2899 IF_DC(static BC_STATUS zdc_lex_token(BcLex *l);)
2901 static BC_STATUS zcommon_lex_token(BcLex *l)
2904 IF_BC(RETURN_STATUS(zbc_lex_token(l));)
2906 IF_DC(RETURN_STATUS(zdc_lex_token(l));)
2909 static bool bc_lex_more_input(BcLex *l)
2914 bc_vec_pop_all(&G.stdin_buffer);
2916 // This loop is complex because the vm tries not to send any lines that end
2917 // with a backslash to the parser. The reason for that is because the parser
2918 // treats a backslash+newline combo as whitespace, per the bc spec. In that
2919 // case, and for strings and comments, the parser will expect more stuff.
2923 size_t prevlen = G.stdin_buffer.len;
2926 bc_read_line(&G.stdin_buffer);
2927 // No more input means EOF
2928 if (G.stdin_buffer.len <= prevlen + 1) // (we expect +1 for NUL byte)
2931 string = G.stdin_buffer.v + prevlen;
2934 if (string == G.stdin_buffer.v || string[-1] != '\\') {
2945 if (c == '/' && *string == '*') {
2950 if (c == '*' && *string == '/') {
2955 if (str != 0 || comment) {
2956 G.stdin_buffer.len--; // backstep over the trailing NUL byte
2960 // Check for backslash+newline.
2961 // we do not check that last char is '\n' -
2962 // if it is not, then it's EOF, and looping back
2963 // to bc_read_line() will detect it:
2965 if (string >= G.stdin_buffer.v && *string == '\\') {
2966 G.stdin_buffer.len--;
2973 l->buf = G.stdin_buffer.v;
2975 //bb_error_msg("G.stdin_buffer.len:%d '%s'", G.stdin_buffer.len, G.stdin_buffer.v);
2976 l->len = G.stdin_buffer.len - 1; // do not include NUL
2978 G.use_stdin = (l->len != 0);
2982 static BC_STATUS zbc_lex_next(BcLex *l)
2987 if (l->t.last == BC_LEX_EOF) RETURN_STATUS(bc_error("end of file"));
2989 l->line += l->newline;
2990 G.err_line = l->line;
2992 l->t.t = BC_LEX_EOF;
2993 //this NL handling is bogus
2994 l->newline = (l->i == l->len);
2996 if (!G.use_stdin || !bc_lex_more_input(l))
2997 RETURN_STATUS(BC_STATUS_SUCCESS);
2998 // here it's guaranteed that l->i is below l->len
3002 // Loop until failure or we don't have whitespace. This
3003 // is so the parser doesn't get inundated with whitespace.
3004 s = BC_STATUS_SUCCESS;
3006 dbg_lex("next string to parse:'%.*s'",
3007 (int)(strchrnul(l->buf + l->i, '\n') - (l->buf + l->i)),
3009 ERROR_RETURN(s =) zcommon_lex_token(l);
3010 } while (!s && l->t.t == BC_LEX_WHITESPACE);
3011 dbg_lex("l->t.t from string:%d", l->t.t);
3015 #if ERRORS_ARE_FATAL
3016 # define zbc_lex_next(...) (zbc_lex_next(__VA_ARGS__), BC_STATUS_SUCCESS)
3019 static BC_STATUS zbc_lex_text_init(BcLex *l, const char *text)
3023 l->len = strlen(text);
3024 l->t.t = l->t.last = BC_LEX_INVALID;
3025 RETURN_STATUS(zbc_lex_next(l));
3027 #if ERRORS_ARE_FATAL
3028 # define zbc_lex_text_init(...) (zbc_lex_text_init(__VA_ARGS__), BC_STATUS_SUCCESS)
3032 static BC_STATUS zbc_lex_identifier(BcLex *l)
3036 const char *buf = l->buf + l->i - 1;
3038 for (i = 0; i < ARRAY_SIZE(bc_lex_kws); ++i) {
3039 const char *keyword8 = bc_lex_kws[i].name8;
3041 while (buf[j] != '\0' && buf[j] == keyword8[j]) {
3043 if (j == 8) goto match;
3045 if (keyword8[j] != '\0')
3048 // buf starts with keyword bc_lex_kws[i]
3049 l->t.t = BC_LEX_KEY_1st_keyword + i;
3050 if (!bc_lex_kws_POSIX(i)) {
3051 s = bc_posix_error_fmt("%sthe '%.8s' keyword", "POSIX does not allow ", bc_lex_kws[i].name8);
3052 ERROR_RETURN(if (s) RETURN_STATUS(s);)
3055 // We minus 1 because the index has already been incremented.
3057 RETURN_STATUS(BC_STATUS_SUCCESS);
3062 if (l->t.v.len > 2) {
3065 // bc: POSIX only allows one character names; the following is bad: 'qwe=1
3067 unsigned len = strchrnul(buf, '\n') - buf;
3068 s = bc_posix_error_fmt("POSIX only allows one character names; the following is bad: '%.*s'", len, buf);
3073 #if ERRORS_ARE_FATAL
3074 # define zbc_lex_identifier(...) (zbc_lex_identifier(__VA_ARGS__), BC_STATUS_SUCCESS)
3077 static BC_STATUS zbc_lex_string(BcLex *l)
3079 size_t len, nls = 0, i = l->i;
3082 l->t.t = BC_LEX_STR;
3084 for (c = l->buf[i]; c != 0 && c != '"'; c = l->buf[++i])
3089 RETURN_STATUS(bc_error("string end could not be found"));
3093 // This check makes sense only if size_t is (much) larger than BC_MAX_STRING.
3094 if (SIZE_MAX > (BC_MAX_STRING | 0xff)) {
3095 if (len > BC_MAX_STRING)
3096 RETURN_STATUS(bc_error("string too long: must be [1,"BC_MAX_STRING_STR"]"));
3098 bc_vec_string(&l->t.v, len, l->buf + l->i);
3102 G.err_line = l->line;
3104 RETURN_STATUS(BC_STATUS_SUCCESS);
3106 #if ERRORS_ARE_FATAL
3107 # define zbc_lex_string(...) (zbc_lex_string(__VA_ARGS__), BC_STATUS_SUCCESS)
3110 static void bc_lex_assign(BcLex *l, unsigned with_and_without)
3112 if (l->buf[l->i] == '=') {
3114 with_and_without >>= 8; // store "with" value
3115 } // else store "without" value
3116 l->t.t = (with_and_without & 0xff);
3118 #define bc_lex_assign(l, with, without) \
3119 bc_lex_assign(l, ((with)<<8)|(without))
3121 static BC_STATUS zbc_lex_comment(BcLex *l)
3124 const char *buf = l->buf;
3126 l->t.t = BC_LEX_WHITESPACE;
3139 RETURN_STATUS(bc_error("comment end could not be found"));
3147 G.err_line = l->line;
3149 RETURN_STATUS(BC_STATUS_SUCCESS);
3151 #if ERRORS_ARE_FATAL
3152 # define zbc_lex_comment(...) (zbc_lex_comment(__VA_ARGS__), BC_STATUS_SUCCESS)
3155 static BC_STATUS zbc_lex_token(BcLex *l)
3157 BcStatus s = BC_STATUS_SUCCESS;
3158 char c = l->buf[l->i++], c2;
3160 // This is the workhorse of the lexer.
3165 l->t.t = !c ? BC_LEX_EOF : BC_LEX_NLINE;
3172 bc_lex_whitespace(l);
3175 bc_lex_assign(l, BC_LEX_OP_REL_NE, BC_LEX_OP_BOOL_NOT);
3176 if (l->t.t == BC_LEX_OP_BOOL_NOT) {
3177 s = bc_POSIX_does_not_allow_bool_ops_this_is_bad("!");
3178 ERROR_RETURN(if (s) RETURN_STATUS(s);)
3182 s = zbc_lex_string(l);
3185 s = bc_POSIX_does_not_allow("'#' script comments");
3186 ERROR_RETURN(if (s) RETURN_STATUS(s);)
3187 bc_lex_lineComment(l);
3190 bc_lex_assign(l, BC_LEX_OP_ASSIGN_MODULUS, BC_LEX_OP_MODULUS);
3195 s = bc_POSIX_does_not_allow_bool_ops_this_is_bad("&&");
3196 ERROR_RETURN(if (s) RETURN_STATUS(s);)
3198 l->t.t = BC_LEX_OP_BOOL_AND;
3200 l->t.t = BC_LEX_INVALID;
3201 s = bc_error_bad_character('&');
3206 l->t.t = (BcLexType)(c - '(' + BC_LEX_LPAREN);
3209 bc_lex_assign(l, BC_LEX_OP_ASSIGN_MULTIPLY, BC_LEX_OP_MULTIPLY);
3215 l->t.t = BC_LEX_OP_INC;
3217 bc_lex_assign(l, BC_LEX_OP_ASSIGN_PLUS, BC_LEX_OP_PLUS);
3220 l->t.t = BC_LEX_COMMA;
3226 l->t.t = BC_LEX_OP_DEC;
3228 bc_lex_assign(l, BC_LEX_OP_ASSIGN_MINUS, BC_LEX_OP_MINUS);
3231 if (isdigit(l->buf[l->i]))
3232 s = zbc_lex_number(l, c);
3234 l->t.t = BC_LEX_KEY_LAST;
3235 s = bc_POSIX_does_not_allow("a period ('.') as a shortcut for the last result");
3241 s = zbc_lex_comment(l);
3243 bc_lex_assign(l, BC_LEX_OP_ASSIGN_DIVIDE, BC_LEX_OP_DIVIDE);
3261 s = zbc_lex_number(l, c);
3264 l->t.t = BC_LEX_SCOLON;
3267 bc_lex_assign(l, BC_LEX_OP_REL_LE, BC_LEX_OP_REL_LT);
3270 bc_lex_assign(l, BC_LEX_OP_REL_EQ, BC_LEX_OP_ASSIGN);
3273 bc_lex_assign(l, BC_LEX_OP_REL_GE, BC_LEX_OP_REL_GT);
3277 l->t.t = (BcLexType)(c - '[' + BC_LEX_LBRACKET);
3280 if (l->buf[l->i] == '\n') {
3281 l->t.t = BC_LEX_WHITESPACE;
3284 s = bc_error_bad_character(c);
3287 bc_lex_assign(l, BC_LEX_OP_ASSIGN_POWER, BC_LEX_OP_POWER);
3315 s = zbc_lex_identifier(l);
3319 l->t.t = (BcLexType)(c - '{' + BC_LEX_LBRACE);
3324 s = bc_POSIX_does_not_allow_bool_ops_this_is_bad("||");
3325 ERROR_RETURN(if (s) RETURN_STATUS(s);)
3327 l->t.t = BC_LEX_OP_BOOL_OR;
3329 l->t.t = BC_LEX_INVALID;
3330 s = bc_error_bad_character(c);
3334 l->t.t = BC_LEX_INVALID;
3335 s = bc_error_bad_character(c);
3344 static BC_STATUS zdc_lex_register(BcLex *l)
3346 if (isspace(l->buf[l->i - 1])) {
3347 bc_lex_whitespace(l);
3350 RETURN_STATUS(bc_error("extended register"));
3354 bc_vec_pop_all(&l->t.v);
3355 bc_vec_push(&l->t.v, &l->buf[l->i - 1]);
3356 bc_vec_pushZeroByte(&l->t.v);
3357 l->t.t = BC_LEX_NAME;
3360 RETURN_STATUS(BC_STATUS_SUCCESS);
3362 #if ERRORS_ARE_FATAL
3363 # define zdc_lex_register(...) (zdc_lex_register(__VA_ARGS__), BC_STATUS_SUCCESS)
3366 static BC_STATUS zdc_lex_string(BcLex *l)
3368 size_t depth = 1, nls = 0, i = l->i;
3371 l->t.t = BC_LEX_STR;
3372 bc_vec_pop_all(&l->t.v);
3374 for (c = l->buf[i]; c != 0 && depth; c = l->buf[++i]) {
3376 depth += (c == '[' && (i == l->i || l->buf[i - 1] != '\\'));
3377 depth -= (c == ']' && (i == l->i || l->buf[i - 1] != '\\'));
3380 if (depth) bc_vec_push(&l->t.v, &c);
3385 RETURN_STATUS(bc_error("string end could not be found"));
3388 bc_vec_pushZeroByte(&l->t.v);
3389 // This check makes sense only if size_t is (much) larger than BC_MAX_STRING.
3390 if (SIZE_MAX > (BC_MAX_STRING | 0xff)) {
3391 if (i - l->i > BC_MAX_STRING)
3392 RETURN_STATUS(bc_error("string too long: must be [1,"BC_MAX_STRING_STR"]"));
3397 G.err_line = l->line;
3399 RETURN_STATUS(BC_STATUS_SUCCESS);
3401 #if ERRORS_ARE_FATAL
3402 # define zdc_lex_string(...) (zdc_lex_string(__VA_ARGS__), BC_STATUS_SUCCESS)
3405 static BC_STATUS zdc_lex_token(BcLex *l)
3407 BcStatus s = BC_STATUS_SUCCESS;
3408 char c = l->buf[l->i++], c2;
3411 for (i = 0; i < ARRAY_SIZE(dc_lex_regs); ++i) {
3412 if (l->t.last == dc_lex_regs[i])
3413 RETURN_STATUS(zdc_lex_register(l));
3416 if (c >= '%' && c <= '~'
3417 && (l->t.t = dc_lex_tokens[(c - '%')]) != BC_LEX_INVALID
3422 // This is the workhorse of the lexer.
3425 l->t.t = BC_LEX_EOF;
3433 l->newline = (c == '\n');
3434 bc_lex_whitespace(l);
3439 l->t.t = BC_LEX_OP_REL_NE;
3441 l->t.t = BC_LEX_OP_REL_LE;
3443 l->t.t = BC_LEX_OP_REL_GE;
3445 RETURN_STATUS(bc_error_bad_character(c));
3449 bc_lex_lineComment(l);
3452 if (isdigit(l->buf[l->i]))
3453 s = zbc_lex_number(l, c);
3455 s = bc_error_bad_character(c);
3473 s = zbc_lex_number(l, c);
3476 s = zdc_lex_string(l);
3479 l->t.t = BC_LEX_INVALID;
3480 s = bc_error_bad_character(c);
3488 static void bc_program_addFunc(char *name, size_t *idx);
3490 static void bc_parse_addFunc(BcParse *p, char *name, size_t *idx)
3492 bc_program_addFunc(name, idx);
3493 p->func = bc_program_func(p->fidx);
3496 static void bc_parse_push(BcParse *p, char i)
3498 dbg_lex("%s:%d pushing opcode %d", __func__, __LINE__, i);
3499 bc_vec_pushByte(&p->func->code, i);
3502 static void bc_parse_pushName(BcParse *p, char *name)
3504 size_t i = 0, len = strlen(name);
3506 for (; i < len; ++i) bc_parse_push(p, name[i]);
3507 bc_parse_push(p, BC_PARSE_STREND);
3512 static void bc_parse_pushIndex(BcParse *p, size_t idx)
3517 dbg_lex("%s:%d pushing index %d", __func__, __LINE__, idx);
3518 mask = ((size_t)0xff) << (sizeof(idx) * 8 - 8);
3521 if (idx & mask) break;
3526 bc_parse_push(p, amt);
3529 bc_parse_push(p, (unsigned char)idx);
3534 static void bc_parse_number(BcParse *p, BcInst *prev, size_t *nexs)
3536 char *num = xstrdup(p->l.t.v.v);
3537 size_t idx = G.prog.consts.len;
3539 bc_vec_push(&G.prog.consts, &num);
3541 bc_parse_push(p, BC_INST_NUM);
3542 bc_parse_pushIndex(p, idx);
3545 (*prev) = BC_INST_NUM;
3548 IF_BC(static BC_STATUS zbc_parse_stmt_or_funcdef(BcParse *p);)
3549 IF_DC(static BC_STATUS zdc_parse_parse(BcParse *p);)
3551 static BC_STATUS zcommon_parse(BcParse *p)
3554 IF_BC(RETURN_STATUS(zbc_parse_stmt_or_funcdef(p));)
3556 IF_DC(RETURN_STATUS(zdc_parse_parse(p));)
3559 static BC_STATUS zbc_parse_text_init(BcParse *p, const char *text)
3561 p->func = bc_program_func(p->fidx);
3563 RETURN_STATUS(zbc_lex_text_init(&p->l, text));
3565 #if ERRORS_ARE_FATAL
3566 # define zbc_parse_text_init(...) (zbc_parse_text_init(__VA_ARGS__), BC_STATUS_SUCCESS)
3569 // Called when parsing or execution detects a failure,
3570 // resets execution structures.
3571 static void bc_program_reset(void)
3576 bc_vec_npop(&G.prog.stack, G.prog.stack.len - 1);
3577 bc_vec_pop_all(&G.prog.results);
3579 f = bc_program_func(0);
3580 ip = bc_vec_top(&G.prog.stack);
3581 ip->idx = f->code.len;
3584 #define bc_parse_updateFunc(p, f) \
3585 ((p)->func = bc_program_func((p)->fidx = (f)))
3587 // Called when zbc/zdc_parse_parse() detects a failure,
3588 // resets parsing structures.
3589 static void bc_parse_reset(BcParse *p)
3591 if (p->fidx != BC_PROG_MAIN) {
3592 p->func->nparams = 0;
3593 bc_vec_pop_all(&p->func->code);
3594 bc_vec_pop_all(&p->func->autos);
3595 bc_vec_pop_all(&p->func->labels);
3597 bc_parse_updateFunc(p, BC_PROG_MAIN);
3601 p->l.t.t = BC_LEX_EOF;
3604 bc_vec_pop_all(&p->exits);
3605 bc_vec_pop_all(&p->conds);
3606 bc_vec_pop_all(&p->ops);
3611 static void bc_parse_free(BcParse *p)
3613 bc_vec_free(&p->exits);
3614 bc_vec_free(&p->conds);
3615 bc_vec_free(&p->ops);
3619 static void bc_parse_create(BcParse *p, size_t func)
3621 memset(p, 0, sizeof(BcParse));
3624 bc_vec_init(&p->exits, sizeof(BcInstPtr), NULL);
3625 bc_vec_init(&p->conds, sizeof(size_t), NULL);
3626 bc_vec_init(&p->ops, sizeof(BcLexType), NULL);
3628 // p->nbraces = 0; - already is
3629 bc_parse_updateFunc(p, func);
3634 #define BC_PARSE_TOP_OP(p) (*((BcLexType *) bc_vec_top(&(p)->ops)))
3635 #define BC_PARSE_LEAF(p, rparen) \
3636 (((p) >= BC_INST_NUM && (p) <= BC_INST_SQRT) || (rparen) || \
3637 (p) == BC_INST_INC_POST || (p) == BC_INST_DEC_POST)
3639 // We can calculate the conversion between tokens and exprs by subtracting the
3640 // position of the first operator in the lex enum and adding the position of the
3641 // first in the expr enum. Note: This only works for binary operators.
3642 #define BC_TOKEN_2_INST(t) ((char) ((t) - BC_LEX_NEG + BC_INST_NEG))
3644 static BC_STATUS zbc_parse_stmt_possibly_auto(BcParse *p, bool auto_allowed);
3645 static BC_STATUS zbc_parse_expr(BcParse *p, uint8_t flags, BcParseNext next);
3646 static BcStatus bc_parse_expr_empty_ok(BcParse *p, uint8_t flags, BcParseNext next);
3647 #if ERRORS_ARE_FATAL
3648 # define zbc_parse_expr(...) (zbc_parse_expr(__VA_ARGS__), BC_STATUS_SUCCESS)
3649 # defone zbc_parse_stmt_possibly_auto(...) (zbc_parse_stmt_possibly_auto(__VA_ARGS__), BC_STATUS_SUCCESS)
3652 static BC_STATUS zbc_parse_stmt(BcParse *p)
3654 RETURN_STATUS(zbc_parse_stmt_possibly_auto(p, false));
3656 #if ERRORS_ARE_FATAL
3657 # define zbc_parse_stmt(...) (zbc_parse_stmt(__VA_ARGS__), BC_STATUS_SUCCESS)
3660 static void bc_parse_operator(BcParse *p, BcLexType type, size_t start,
3663 char l, r = bc_parse_op_PREC(type - BC_LEX_OP_INC);
3664 bool left = bc_parse_op_LEFT(type - BC_LEX_OP_INC);
3666 while (p->ops.len > start) {
3667 BcLexType t = BC_PARSE_TOP_OP(p);
3668 if (t == BC_LEX_LPAREN) break;
3670 l = bc_parse_op_PREC(t - BC_LEX_OP_INC);
3671 if (l >= r && (l != r || !left)) break;
3673 bc_parse_push(p, BC_TOKEN_2_INST(t));
3674 bc_vec_pop(&p->ops);
3675 *nexprs -= (t != BC_LEX_OP_BOOL_NOT && t != BC_LEX_NEG);
3678 bc_vec_push(&p->ops, &type);
3681 static BC_STATUS zbc_parse_rightParen(BcParse *p, size_t ops_bgn, size_t *nexs)
3685 if (p->ops.len <= ops_bgn)
3686 RETURN_STATUS(bc_error_bad_expression());
3687 top = BC_PARSE_TOP_OP(p);
3689 while (top != BC_LEX_LPAREN) {
3690 bc_parse_push(p, BC_TOKEN_2_INST(top));
3692 bc_vec_pop(&p->ops);
3693 *nexs -= top != BC_LEX_OP_BOOL_NOT && top != BC_LEX_NEG;
3695 if (p->ops.len <= ops_bgn)
3696 RETURN_STATUS(bc_error_bad_expression());
3697 top = BC_PARSE_TOP_OP(p);
3700 bc_vec_pop(&p->ops);
3702 RETURN_STATUS(zbc_lex_next(&p->l));
3704 #if ERRORS_ARE_FATAL
3705 # define zbc_parse_rightParen(...) (zbc_parse_rightParen(__VA_ARGS__), BC_STATUS_SUCCESS)
3708 static BC_STATUS zbc_parse_params(BcParse *p, uint8_t flags)
3714 dbg_lex("%s:%d p->l.t.t:%d", __func__, __LINE__, p->l.t.t);
3715 s = zbc_lex_next(&p->l);
3716 if (s) RETURN_STATUS(s);
3718 for (nparams = 0; p->l.t.t != BC_LEX_RPAREN; ++nparams) {
3719 flags = (flags & ~(BC_PARSE_PRINT | BC_PARSE_REL)) | BC_PARSE_ARRAY;
3720 s = zbc_parse_expr(p, flags, bc_parse_next_param);
3721 if (s) RETURN_STATUS(s);
3723 comma = p->l.t.t == BC_LEX_COMMA;
3725 s = zbc_lex_next(&p->l);
3726 if (s) RETURN_STATUS(s);
3730 if (comma) RETURN_STATUS(bc_error_bad_token());
3731 bc_parse_push(p, BC_INST_CALL);
3732 bc_parse_pushIndex(p, nparams);
3734 RETURN_STATUS(BC_STATUS_SUCCESS);
3736 #if ERRORS_ARE_FATAL
3737 # define zbc_parse_params(...) (zbc_parse_params(__VA_ARGS__), BC_STATUS_SUCCESS)
3740 static BC_STATUS zbc_parse_call(BcParse *p, char *name, uint8_t flags)
3743 BcId entry, *entry_ptr;
3748 s = zbc_parse_params(p, flags);
3751 if (p->l.t.t != BC_LEX_RPAREN) {
3752 s = bc_error_bad_token();
3756 idx = bc_map_index(&G.prog.fn_map, &entry);
3758 if (idx == BC_VEC_INVALID_IDX) {
3759 name = xstrdup(entry.name);
3760 bc_parse_addFunc(p, name, &idx);
3761 idx = bc_map_index(&G.prog.fn_map, &entry);
3766 entry_ptr = bc_vec_item(&G.prog.fn_map, idx);
3767 bc_parse_pushIndex(p, entry_ptr->idx);
3769 RETURN_STATUS(zbc_lex_next(&p->l));
3775 #if ERRORS_ARE_FATAL
3776 # define zbc_parse_call(...) (zbc_parse_call(__VA_ARGS__), BC_STATUS_SUCCESS)
3779 static BC_STATUS zbc_parse_name(BcParse *p, BcInst *type, uint8_t flags)
3784 name = xstrdup(p->l.t.v.v);
3785 s = zbc_lex_next(&p->l);
3788 if (p->l.t.t == BC_LEX_LBRACKET) {
3789 s = zbc_lex_next(&p->l);
3792 if (p->l.t.t == BC_LEX_RBRACKET) {
3793 if (!(flags & BC_PARSE_ARRAY)) {
3794 s = bc_error_bad_expression();
3797 *type = BC_INST_ARRAY;
3799 *type = BC_INST_ARRAY_ELEM;
3800 flags &= ~(BC_PARSE_PRINT | BC_PARSE_REL);
3801 s = zbc_parse_expr(p, flags, bc_parse_next_elem);
3804 s = zbc_lex_next(&p->l);
3806 bc_parse_push(p, *type);
3807 bc_parse_pushName(p, name);
3809 else if (p->l.t.t == BC_LEX_LPAREN) {
3810 if (flags & BC_PARSE_NOCALL) {
3811 s = bc_error_bad_token();
3814 *type = BC_INST_CALL;
3815 s = zbc_parse_call(p, name, flags);
3817 *type = BC_INST_VAR;
3818 bc_parse_push(p, BC_INST_VAR);
3819 bc_parse_pushName(p, name);
3828 #if ERRORS_ARE_FATAL
3829 # define zbc_parse_name(...) (zbc_parse_name(__VA_ARGS__), BC_STATUS_SUCCESS)
3832 static BC_STATUS zbc_parse_read(BcParse *p)
3836 s = zbc_lex_next(&p->l);
3837 if (s) RETURN_STATUS(s);
3838 if (p->l.t.t != BC_LEX_LPAREN) RETURN_STATUS(bc_error_bad_token());
3840 s = zbc_lex_next(&p->l);
3841 if (s) RETURN_STATUS(s);
3842 if (p->l.t.t != BC_LEX_RPAREN) RETURN_STATUS(bc_error_bad_token());
3844 bc_parse_push(p, BC_INST_READ);
3846 RETURN_STATUS(zbc_lex_next(&p->l));
3848 #if ERRORS_ARE_FATAL
3849 # define zbc_parse_read(...) (zbc_parse_read(__VA_ARGS__), BC_STATUS_SUCCESS)
3852 static BC_STATUS zbc_parse_builtin(BcParse *p, BcLexType type, uint8_t flags,
3857 s = zbc_lex_next(&p->l);
3858 if (s) RETURN_STATUS(s);
3859 if (p->l.t.t != BC_LEX_LPAREN) RETURN_STATUS(bc_error_bad_token());
3861 flags = (flags & ~(BC_PARSE_PRINT | BC_PARSE_REL)) | BC_PARSE_ARRAY;
3863 s = zbc_lex_next(&p->l);
3864 if (s) RETURN_STATUS(s);
3866 s = zbc_parse_expr(p, flags, bc_parse_next_rel);
3867 if (s) RETURN_STATUS(s);
3869 if (p->l.t.t != BC_LEX_RPAREN) RETURN_STATUS(bc_error_bad_token());
3871 *prev = (type == BC_LEX_KEY_LENGTH) ? BC_INST_LENGTH : BC_INST_SQRT;
3872 bc_parse_push(p, *prev);
3874 RETURN_STATUS(zbc_lex_next(&p->l));
3876 #if ERRORS_ARE_FATAL
3877 # define zbc_parse_builtin(...) (zbc_parse_builtin(__VA_ARGS__), BC_STATUS_SUCCESS)
3880 static BC_STATUS zbc_parse_scale(BcParse *p, BcInst *type, uint8_t flags)
3884 s = zbc_lex_next(&p->l);
3885 if (s) RETURN_STATUS(s);
3887 if (p->l.t.t != BC_LEX_LPAREN) {
3888 *type = BC_INST_SCALE;
3889 bc_parse_push(p, BC_INST_SCALE);
3890 RETURN_STATUS(BC_STATUS_SUCCESS);
3893 *type = BC_INST_SCALE_FUNC;
3894 flags &= ~(BC_PARSE_PRINT | BC_PARSE_REL);
3896 s = zbc_lex_next(&p->l);
3897 if (s) RETURN_STATUS(s);
3899 s = zbc_parse_expr(p, flags, bc_parse_next_rel);
3900 if (s) RETURN_STATUS(s);
3901 if (p->l.t.t != BC_LEX_RPAREN)
3902 RETURN_STATUS(bc_error_bad_token());
3903 bc_parse_push(p, BC_INST_SCALE_FUNC);
3905 RETURN_STATUS(zbc_lex_next(&p->l));
3907 #if ERRORS_ARE_FATAL
3908 # define zbc_parse_scale(...) (zbc_parse_scale(__VA_ARGS__), BC_STATUS_SUCCESS)
3911 static BC_STATUS zbc_parse_incdec(BcParse *p, BcInst *prev, bool *paren_expr,
3912 size_t *nexprs, uint8_t flags)
3917 BcInst etype = *prev;
3919 if (etype == BC_INST_VAR || etype == BC_INST_ARRAY_ELEM ||
3920 etype == BC_INST_SCALE || etype == BC_INST_LAST ||
3921 etype == BC_INST_IBASE || etype == BC_INST_OBASE)
3923 *prev = inst = BC_INST_INC_POST + (p->l.t.t != BC_LEX_OP_INC);
3924 bc_parse_push(p, inst);
3925 s = zbc_lex_next(&p->l);
3928 *prev = inst = BC_INST_INC_PRE + (p->l.t.t != BC_LEX_OP_INC);
3931 s = zbc_lex_next(&p->l);
3932 if (s) RETURN_STATUS(s);
3935 // Because we parse the next part of the expression
3936 // right here, we need to increment this.
3937 *nexprs = *nexprs + 1;
3941 s = zbc_parse_name(p, prev, flags | BC_PARSE_NOCALL);
3943 case BC_LEX_KEY_IBASE:
3944 case BC_LEX_KEY_LAST:
3945 case BC_LEX_KEY_OBASE:
3946 bc_parse_push(p, type - BC_LEX_KEY_IBASE + BC_INST_IBASE);
3947 s = zbc_lex_next(&p->l);
3949 case BC_LEX_KEY_SCALE:
3950 s = zbc_lex_next(&p->l);
3951 if (s) RETURN_STATUS(s);
3952 if (p->l.t.t == BC_LEX_LPAREN)
3953 s = bc_error_bad_token();
3955 bc_parse_push(p, BC_INST_SCALE);
3958 s = bc_error_bad_token();
3962 if (!s) bc_parse_push(p, inst);
3967 #if ERRORS_ARE_FATAL
3968 # define zbc_parse_incdec(...) (zbc_parse_incdec(__VA_ARGS__), BC_STATUS_SUCCESS)
3971 static BC_STATUS zbc_parse_minus(BcParse *p, BcInst *prev, size_t ops_bgn,
3972 bool rparen, size_t *nexprs)
3976 BcInst etype = *prev;
3978 s = zbc_lex_next(&p->l);
3979 if (s) RETURN_STATUS(s);
3981 type = rparen || etype == BC_INST_INC_POST || etype == BC_INST_DEC_POST ||
3982 (etype >= BC_INST_NUM && etype <= BC_INST_SQRT) ?
3985 *prev = BC_TOKEN_2_INST(type);
3987 // We can just push onto the op stack because this is the largest
3988 // precedence operator that gets pushed. Inc/dec does not.
3989 if (type != BC_LEX_OP_MINUS)
3990 bc_vec_push(&p->ops, &type);
3992 bc_parse_operator(p, type, ops_bgn, nexprs);
3996 #if ERRORS_ARE_FATAL
3997 # define zbc_parse_minus(...) (zbc_parse_minus(__VA_ARGS__), BC_STATUS_SUCCESS)
4000 static BC_STATUS zbc_parse_string(BcParse *p, char inst)
4002 char *str = xstrdup(p->l.t.v.v);
4004 bc_parse_push(p, BC_INST_STR);
4005 bc_parse_pushIndex(p, G.prog.strs.len);
4006 bc_vec_push(&G.prog.strs, &str);
4007 bc_parse_push(p, inst);
4009 RETURN_STATUS(zbc_lex_next(&p->l));
4011 #if ERRORS_ARE_FATAL
4012 # define zbc_parse_string(...) (zbc_parse_string(__VA_ARGS__), BC_STATUS_SUCCESS)
4015 static BC_STATUS zbc_parse_print(BcParse *p)
4021 s = zbc_lex_next(&p->l);
4022 if (s) RETURN_STATUS(s);
4026 if (type == BC_LEX_SCOLON || type == BC_LEX_NLINE)
4027 RETURN_STATUS(bc_error("bad print statement"));
4030 while (type != BC_LEX_SCOLON && type != BC_LEX_NLINE) {
4031 if (type == BC_LEX_STR) {
4032 s = zbc_parse_string(p, BC_INST_PRINT_POP);
4033 if (s) RETURN_STATUS(s);
4035 s = zbc_parse_expr(p, 0, bc_parse_next_print);
4036 if (s) RETURN_STATUS(s);
4037 bc_parse_push(p, BC_INST_PRINT_POP);
4040 comma = p->l.t.t == BC_LEX_COMMA;
4042 s = zbc_lex_next(&p->l);
4043 if (s) RETURN_STATUS(s);
4048 if (comma) RETURN_STATUS(bc_error_bad_token());
4050 RETURN_STATUS(zbc_lex_next(&p->l));
4052 #if ERRORS_ARE_FATAL
4053 # define zbc_parse_print(...) (zbc_parse_print(__VA_ARGS__), BC_STATUS_SUCCESS)
4056 static BC_STATUS zbc_parse_return(BcParse *p)
4062 dbg_lex_enter("%s:%d entered", __func__, __LINE__);
4064 s = zbc_lex_next(&p->l);
4065 if (s) RETURN_STATUS(s);
4068 paren = t == BC_LEX_LPAREN;
4070 if (t == BC_LEX_NLINE || t == BC_LEX_SCOLON)
4071 bc_parse_push(p, BC_INST_RET0);
4073 s = bc_parse_expr_empty_ok(p, 0, bc_parse_next_expr);
4074 if (s == BC_STATUS_PARSE_EMPTY_EXP) {
4075 bc_parse_push(p, BC_INST_RET0);
4076 s = zbc_lex_next(&p->l);
4078 if (s) RETURN_STATUS(s);
4080 if (!paren || p->l.t.last != BC_LEX_RPAREN) {
4081 s = bc_POSIX_requires("parentheses around return expressions");
4082 ERROR_RETURN(if (s) RETURN_STATUS(s);)
4085 bc_parse_push(p, BC_INST_RET);
4088 dbg_lex_done("%s:%d done", __func__, __LINE__);
4091 #if ERRORS_ARE_FATAL
4092 # define zbc_parse_return(...) (zbc_parse_return(__VA_ARGS__), BC_STATUS_SUCCESS)
4095 static void bc_parse_noElse(BcParse *p)
4100 ip = bc_vec_top(&p->exits);
4101 label = bc_vec_item(&p->func->labels, ip->idx);
4102 dbg_lex("%s:%d rewriting label: %d -> %d", __func__, __LINE__, *label, p->func->code.len);
4103 *label = p->func->code.len;
4105 bc_vec_pop(&p->exits);
4108 static BC_STATUS zbc_parse_else(BcParse *p)
4113 dbg_lex_enter("%s:%d entered", __func__, __LINE__);
4115 ip.idx = p->func->labels.len;
4116 ip.func = ip.len = 0;
4118 dbg_lex("%s:%d after if() body: BC_INST_JUMP to %d", __func__, __LINE__, ip.idx);
4119 bc_parse_push(p, BC_INST_JUMP);
4120 bc_parse_pushIndex(p, ip.idx);
4122 dbg_lex("%s:%d calling bc_parse_noElse()", __func__, __LINE__);
4125 bc_vec_push(&p->exits, &ip);
4126 bc_vec_push(&p->func->labels, &ip.idx);
4128 s = zbc_parse_stmt(p);
4129 if (s) RETURN_STATUS(s);
4131 dbg_lex_done("%s:%d done", __func__, __LINE__);
4134 #if ERRORS_ARE_FATAL
4135 # define zbc_parse_else(...) (zbc_parse_else(__VA_ARGS__), BC_STATUS_SUCCESS)
4138 static BC_STATUS zbc_parse_if(BcParse *p)
4145 dbg_lex_enter("%s:%d entered", __func__, __LINE__);
4146 s = zbc_lex_next(&p->l);
4147 if (s) RETURN_STATUS(s);
4148 if (p->l.t.t != BC_LEX_LPAREN) RETURN_STATUS(bc_error_bad_token());
4150 s = zbc_lex_next(&p->l);
4151 if (s) RETURN_STATUS(s);
4152 s = zbc_parse_expr(p, BC_PARSE_REL, bc_parse_next_rel);
4153 if (s) RETURN_STATUS(s);
4155 if (p->l.t.t != BC_LEX_RPAREN) RETURN_STATUS(bc_error_bad_token());
4156 s = zbc_lex_next(&p->l);
4157 if (s) RETURN_STATUS(s);
4159 bc_parse_push(p, BC_INST_JUMP_ZERO);
4160 ip.idx = p->func->labels.len;
4161 ip.func = ip.len = 0;
4162 bc_parse_pushIndex(p, ip.idx);
4163 //TODO: can get rid of p->exits stack?
4164 bc_vec_push(&p->exits, &ip);
4165 bc_vec_push(&p->func->labels, &ip.idx);
4167 s = zbc_parse_stmt(p);
4168 if (s) RETURN_STATUS(s);
4169 dbg_lex("%s:%d in if after stmt: p->l.t.t:%d", __func__, __LINE__, p->l.t.t);
4170 if (p->l.t.t == BC_LEX_KEY_ELSE) {
4171 s = zbc_lex_next(&p->l);
4172 if (s) RETURN_STATUS(s);
4173 dbg_lex("%s:%d calling zbc_parse_else(), p->l.t.t:%d", __func__, __LINE__, p->l.t.t);
4174 s = zbc_parse_else(p);
4177 ipp = bc_vec_top(&p->exits);
4178 label = bc_vec_item(&p->func->labels, ipp->idx);
4179 dbg_lex("%s:%d rewriting label: %d -> %d", __func__, __LINE__, *label, p->func->code.len);
4180 *label = p->func->code.len;
4182 bc_vec_pop(&p->exits);
4184 dbg_lex_done("%s:%d done", __func__, __LINE__);
4187 #if ERRORS_ARE_FATAL
4188 # define zbc_parse_if(...) (zbc_parse_if(__VA_ARGS__), BC_STATUS_SUCCESS)
4191 static BC_STATUS zbc_parse_while(BcParse *p)
4199 s = zbc_lex_next(&p->l);
4200 if (s) RETURN_STATUS(s);
4201 if (p->l.t.t != BC_LEX_LPAREN) RETURN_STATUS(bc_error_bad_token());
4202 s = zbc_lex_next(&p->l);
4203 if (s) RETURN_STATUS(s);
4205 ip.idx = p->func->labels.len;
4207 bc_vec_push(&p->func->labels, &p->func->code.len);
4208 bc_vec_push(&p->conds, &ip.idx);
4210 ip.idx = p->func->labels.len;
4214 bc_vec_push(&p->exits, &ip);
4215 bc_vec_push(&p->func->labels, &ip.idx);
4217 s = zbc_parse_expr(p, BC_PARSE_REL, bc_parse_next_rel);
4218 if (s) RETURN_STATUS(s);
4219 if (p->l.t.t != BC_LEX_RPAREN) RETURN_STATUS(bc_error_bad_token());
4220 s = zbc_lex_next(&p->l);
4221 if (s) RETURN_STATUS(s);
4223 bc_parse_push(p, BC_INST_JUMP_ZERO);
4224 bc_parse_pushIndex(p, ip.idx);
4226 s = zbc_parse_stmt(p);
4227 if (s) RETURN_STATUS(s);
4229 n = *((size_t *) bc_vec_top(&p->conds));
4230 bc_parse_push(p, BC_INST_JUMP);
4231 bc_parse_pushIndex(p, n);
4233 ipp = bc_vec_top(&p->exits);
4234 label = bc_vec_top(&p->conds);
4236 dbg_lex("%s:%d BC_INST_JUMP to %d", __func__, __LINE__, *label);
4237 bc_parse_push(p, BC_INST_JUMP);
4238 bc_parse_pushIndex(p, *label);
4240 label = bc_vec_item(&p->func->labels, ipp->idx);
4241 dbg_lex("%s:%d rewriting label: %d -> %d", __func__, __LINE__, *label, p->func->code.len);
4242 *label = p->func->code.len;
4244 bc_vec_pop(&p->exits);
4245 bc_vec_pop(&p->conds);
4249 #if ERRORS_ARE_FATAL
4250 # define zbc_parse_while(...) (zbc_parse_while(__VA_ARGS__), BC_STATUS_SUCCESS)
4253 static BC_STATUS zbc_parse_for(BcParse *p)
4259 size_t cond_idx, exit_idx, body_idx, update_idx;
4262 dbg_lex("%s:%d p->l.t.t:%d", __func__, __LINE__, p->l.t.t);
4263 s = zbc_lex_next(&p->l);
4264 if (s) RETURN_STATUS(s);
4265 if (p->l.t.t != BC_LEX_LPAREN) RETURN_STATUS(bc_error_bad_token());
4266 s = zbc_lex_next(&p->l);
4267 if (s) RETURN_STATUS(s);
4269 if (p->l.t.t != BC_LEX_SCOLON)
4270 s = zbc_parse_expr(p, 0, bc_parse_next_for);
4272 s = bc_POSIX_does_not_allow_empty_X_expression_in_for("init");
4274 if (s) RETURN_STATUS(s);
4275 if (p->l.t.t != BC_LEX_SCOLON) RETURN_STATUS(bc_error_bad_token());
4276 s = zbc_lex_next(&p->l);
4277 if (s) RETURN_STATUS(s);
4279 cond_idx = p->func->labels.len;
4280 update_idx = cond_idx + 1;
4281 body_idx = update_idx + 1;
4282 exit_idx = body_idx + 1;
4284 bc_vec_push(&p->func->labels, &p->func->code.len);
4286 if (p->l.t.t != BC_LEX_SCOLON)
4287 s = zbc_parse_expr(p, BC_PARSE_REL, bc_parse_next_for);
4289 s = bc_POSIX_does_not_allow_empty_X_expression_in_for("condition");
4291 if (s) RETURN_STATUS(s);
4292 if (p->l.t.t != BC_LEX_SCOLON) RETURN_STATUS(bc_error_bad_token());
4294 s = zbc_lex_next(&p->l);
4295 if (s) RETURN_STATUS(s);
4297 bc_parse_push(p, BC_INST_JUMP_ZERO);
4298 bc_parse_pushIndex(p, exit_idx);
4299 bc_parse_push(p, BC_INST_JUMP);
4300 bc_parse_pushIndex(p, body_idx);
4302 ip.idx = p->func->labels.len;
4304 bc_vec_push(&p->conds, &update_idx);
4305 bc_vec_push(&p->func->labels, &p->func->code.len);
4307 if (p->l.t.t != BC_LEX_RPAREN)
4308 s = zbc_parse_expr(p, 0, bc_parse_next_rel);
4310 s = bc_POSIX_does_not_allow_empty_X_expression_in_for("update");
4312 if (s) RETURN_STATUS(s);
4314 if (p->l.t.t != BC_LEX_RPAREN) RETURN_STATUS(bc_error_bad_token());
4315 bc_parse_push(p, BC_INST_JUMP);
4316 bc_parse_pushIndex(p, cond_idx);
4317 bc_vec_push(&p->func->labels, &p->func->code.len);
4323 bc_vec_push(&p->exits, &ip);
4324 bc_vec_push(&p->func->labels, &ip.idx);
4325 s = zbc_lex_next(&p->l);
4326 if (s) RETURN_STATUS(s);
4328 s = zbc_parse_stmt(p);
4329 if (s) RETURN_STATUS(s);
4331 n = *((size_t *) bc_vec_top(&p->conds));
4332 bc_parse_push(p, BC_INST_JUMP);
4333 bc_parse_pushIndex(p, n);
4335 ipp = bc_vec_top(&p->exits);
4336 label = bc_vec_top(&p->conds);
4338 //TODO: commonalize?
4339 dbg_lex("%s:%d BC_INST_JUMP to %d", __func__, __LINE__, *label);
4340 bc_parse_push(p, BC_INST_JUMP);
4341 bc_parse_pushIndex(p, *label);
4343 label = bc_vec_item(&p->func->labels, ipp->idx);
4344 dbg_lex("%s:%d rewriting label: %d -> %d", __func__, __LINE__, *label, p->func->code.len);
4345 *label = p->func->code.len;
4347 bc_vec_pop(&p->exits);
4348 bc_vec_pop(&p->conds);
4350 RETURN_STATUS(BC_STATUS_SUCCESS);
4352 #if ERRORS_ARE_FATAL
4353 # define zbc_parse_for(...) (zbc_parse_for(__VA_ARGS__), BC_STATUS_SUCCESS)
4356 static BC_STATUS zbc_parse_break_or_continue(BcParse *p, BcLexType type)
4362 if (type == BC_LEX_KEY_BREAK) {
4363 if (p->exits.len == 0) RETURN_STATUS(bc_error_bad_token());
4365 i = p->exits.len - 1;
4366 ip = bc_vec_item(&p->exits, i);
4368 while (!ip->func && i < p->exits.len)
4369 ip = bc_vec_item(&p->exits, i--);
4370 if (i >= p->exits.len && !ip->func)
4371 RETURN_STATUS(bc_error_bad_token());
4376 i = *((size_t *) bc_vec_top(&p->conds));
4378 bc_parse_push(p, BC_INST_JUMP);
4379 bc_parse_pushIndex(p, i);
4381 s = zbc_lex_next(&p->l);
4382 if (s) RETURN_STATUS(s);
4384 if (p->l.t.t != BC_LEX_SCOLON && p->l.t.t != BC_LEX_NLINE)
4385 RETURN_STATUS(bc_error_bad_token());
4387 RETURN_STATUS(zbc_lex_next(&p->l));
4389 #if ERRORS_ARE_FATAL
4390 # define zbc_parse_break_or_continue(...) (zbc_parse_break_or_continue(__VA_ARGS__), BC_STATUS_SUCCESS)
4393 static BC_STATUS zbc_parse_func(BcParse *p)
4396 bool var, comma = false;
4399 s = zbc_lex_next(&p->l);
4400 if (s) RETURN_STATUS(s);
4401 if (p->l.t.t != BC_LEX_NAME)
4402 RETURN_STATUS(bc_error("bad function definition"));
4404 name = xstrdup(p->l.t.v.v);
4405 bc_parse_addFunc(p, name, &p->fidx);
4407 s = zbc_lex_next(&p->l);
4408 if (s) RETURN_STATUS(s);
4409 if (p->l.t.t != BC_LEX_LPAREN)
4410 RETURN_STATUS(bc_error("bad function definition"));
4411 s = zbc_lex_next(&p->l);
4412 if (s) RETURN_STATUS(s);
4414 while (p->l.t.t != BC_LEX_RPAREN) {
4415 if (p->l.t.t != BC_LEX_NAME)
4416 RETURN_STATUS(bc_error("bad function definition"));
4420 name = xstrdup(p->l.t.v.v);
4421 s = zbc_lex_next(&p->l);
4424 var = p->l.t.t != BC_LEX_LBRACKET;
4427 s = zbc_lex_next(&p->l);
4430 if (p->l.t.t != BC_LEX_RBRACKET) {
4431 s = bc_error("bad function definition");
4435 s = zbc_lex_next(&p->l);
4439 comma = p->l.t.t == BC_LEX_COMMA;
4441 s = zbc_lex_next(&p->l);
4445 s = zbc_func_insert(p->func, name, var);
4449 if (comma) RETURN_STATUS(bc_error("bad function definition"));
4451 s = zbc_lex_next(&p->l);
4452 if (s) RETURN_STATUS(s);
4454 if (p->l.t.t != BC_LEX_LBRACE)
4455 s = bc_POSIX_requires("the left brace be on the same line as the function header");
4457 s = zbc_parse_stmt_possibly_auto(p, true);
4458 if (s) RETURN_STATUS(s);
4460 bc_parse_push(p, BC_INST_RET0);
4461 bc_parse_updateFunc(p, BC_PROG_MAIN);
4469 #if ERRORS_ARE_FATAL
4470 # define zbc_parse_func(...) (zbc_parse_func(__VA_ARGS__), BC_STATUS_SUCCESS)
4473 static BC_STATUS zbc_parse_auto(BcParse *p)
4476 bool comma, var, one;
4479 dbg_lex_enter("%s:%d entered", __func__, __LINE__);
4480 s = zbc_lex_next(&p->l);
4481 if (s) RETURN_STATUS(s);
4484 one = p->l.t.t == BC_LEX_NAME;
4486 while (p->l.t.t == BC_LEX_NAME) {
4487 name = xstrdup(p->l.t.v.v);
4488 s = zbc_lex_next(&p->l);
4491 var = p->l.t.t != BC_LEX_LBRACKET;
4493 s = zbc_lex_next(&p->l);
4496 if (p->l.t.t != BC_LEX_RBRACKET) {
4497 s = bc_error("bad function definition");
4501 s = zbc_lex_next(&p->l);
4505 comma = p->l.t.t == BC_LEX_COMMA;
4507 s = zbc_lex_next(&p->l);
4511 s = zbc_func_insert(p->func, name, var);
4515 if (comma) RETURN_STATUS(bc_error("bad function definition"));
4516 if (!one) RETURN_STATUS(bc_error("no auto variable found"));
4518 if (p->l.t.t != BC_LEX_NLINE && p->l.t.t != BC_LEX_SCOLON)
4519 RETURN_STATUS(bc_error_bad_token());
4521 dbg_lex_done("%s:%d done", __func__, __LINE__);
4522 RETURN_STATUS(zbc_lex_next(&p->l));
4526 dbg_lex_done("%s:%d done (ERROR)", __func__, __LINE__);
4529 #if ERRORS_ARE_FATAL
4530 # define zbc_parse_auto(...) (zbc_parse_auto(__VA_ARGS__), BC_STATUS_SUCCESS)
4533 #undef zbc_parse_stmt_possibly_auto
4534 static BC_STATUS zbc_parse_stmt_possibly_auto(BcParse *p, bool auto_allowed)
4536 BcStatus s = BC_STATUS_SUCCESS;
4538 dbg_lex_enter("%s:%d entered, p->l.t.t:%d", __func__, __LINE__, p->l.t.t);
4540 if (p->l.t.t == BC_LEX_NLINE) {
4541 dbg_lex_done("%s:%d done (seen BC_LEX_NLINE)", __func__, __LINE__);
4542 RETURN_STATUS(zbc_lex_next(&p->l));
4544 if (p->l.t.t == BC_LEX_SCOLON) {
4545 dbg_lex_done("%s:%d done (seen BC_LEX_SCOLON)", __func__, __LINE__);
4546 RETURN_STATUS(zbc_lex_next(&p->l));
4549 if (p->l.t.t == BC_LEX_LBRACE) {
4550 dbg_lex("%s:%d BC_LEX_LBRACE: (auto_allowed:%d)", __func__, __LINE__, auto_allowed);
4552 s = zbc_lex_next(&p->l);
4553 if (s) RETURN_STATUS(s);
4554 } while (p->l.t.t == BC_LEX_NLINE);
4555 if (auto_allowed && p->l.t.t == BC_LEX_KEY_AUTO) {
4556 dbg_lex("%s:%d calling zbc_parse_auto()", __func__, __LINE__);
4557 s = zbc_parse_auto(p);
4558 if (s) RETURN_STATUS(s);
4560 while (p->l.t.t != BC_LEX_RBRACE) {
4561 dbg_lex("%s:%d block parsing loop", __func__, __LINE__);
4562 s = zbc_parse_stmt(p);
4563 if (s) RETURN_STATUS(s);
4565 s = zbc_lex_next(&p->l);
4566 dbg_lex_done("%s:%d done (seen BC_LEX_RBRACE)", __func__, __LINE__);
4570 dbg_lex("%s:%d p->l.t.t:%d", __func__, __LINE__, p->l.t.t);
4574 case BC_LEX_OP_MINUS:
4575 case BC_LEX_OP_BOOL_NOT:
4579 case BC_LEX_KEY_IBASE:
4580 case BC_LEX_KEY_LAST:
4581 case BC_LEX_KEY_LENGTH:
4582 case BC_LEX_KEY_OBASE:
4583 case BC_LEX_KEY_READ:
4584 case BC_LEX_KEY_SCALE:
4585 case BC_LEX_KEY_SQRT:
4586 s = zbc_parse_expr(p, BC_PARSE_PRINT, bc_parse_next_expr);
4589 s = zbc_parse_string(p, BC_INST_PRINT_STR);
4591 case BC_LEX_KEY_BREAK:
4592 case BC_LEX_KEY_CONTINUE:
4593 s = zbc_parse_break_or_continue(p, p->l.t.t);
4595 case BC_LEX_KEY_FOR:
4596 s = zbc_parse_for(p);
4598 case BC_LEX_KEY_HALT:
4599 bc_parse_push(p, BC_INST_HALT);
4600 s = zbc_lex_next(&p->l);
4603 s = zbc_parse_if(p);
4605 case BC_LEX_KEY_LIMITS:
4606 // "limits" is a compile-time command,
4607 // the output is produced at _parse time_.
4609 "BC_BASE_MAX = "BC_MAX_OBASE_STR "\n"
4610 "BC_DIM_MAX = "BC_MAX_DIM_STR "\n"
4611 "BC_SCALE_MAX = "BC_MAX_SCALE_STR "\n"
4612 "BC_STRING_MAX = "BC_MAX_STRING_STR"\n"
4613 "BC_NAME_MAX = "BC_MAX_NAME_STR "\n"
4614 "BC_NUM_MAX = "BC_MAX_NUM_STR "\n"
4615 "MAX Exponent = "BC_MAX_EXP_STR "\n"
4616 "Number of vars = "BC_MAX_VARS_STR "\n"
4618 s = zbc_lex_next(&p->l);
4620 case BC_LEX_KEY_PRINT:
4621 s = zbc_parse_print(p);
4623 case BC_LEX_KEY_QUIT:
4624 // "quit" is a compile-time command. For example,
4625 // "if (0 == 1) quit" terminates when parsing the statement,
4626 // not when it is executed
4627 QUIT_OR_RETURN_TO_MAIN;
4628 case BC_LEX_KEY_RETURN:
4629 s = zbc_parse_return(p);
4631 case BC_LEX_KEY_WHILE:
4632 s = zbc_parse_while(p);
4635 s = bc_error_bad_token();
4639 if (s || G_interrupt) {
4641 s = BC_STATUS_FAILURE;
4644 dbg_lex_done("%s:%d done", __func__, __LINE__);
4647 #if ERRORS_ARE_FATAL
4648 # define zbc_parse_stmt_possibly_auto(...) (zbc_parse_stmt_possibly_auto(__VA_ARGS__), BC_STATUS_SUCCESS)
4651 static BC_STATUS zbc_parse_stmt_or_funcdef(BcParse *p)
4655 dbg_lex_enter("%s:%d entered", __func__, __LINE__);
4656 if (p->l.t.t == BC_LEX_EOF)
4657 s = bc_error("end of file");
4658 else if (p->l.t.t == BC_LEX_KEY_DEFINE) {
4659 dbg_lex("%s:%d p->l.t.t:BC_LEX_KEY_DEFINE", __func__, __LINE__);
4660 s = zbc_parse_func(p);
4662 dbg_lex("%s:%d p->l.t.t:%d (not BC_LEX_KEY_DEFINE)", __func__, __LINE__, p->l.t.t);
4663 s = zbc_parse_stmt(p);
4666 dbg_lex_done("%s:%d done", __func__, __LINE__);
4669 #if ERRORS_ARE_FATAL
4670 # define zbc_parse_stmt_or_funcdef(...) (zbc_parse_stmt_or_funcdef(__VA_ARGS__), BC_STATUS_SUCCESS)
4673 // This is not a "z" function: can also return BC_STATUS_PARSE_EMPTY_EXP
4674 static BcStatus bc_parse_expr_empty_ok(BcParse *p, uint8_t flags, BcParseNext next)
4676 BcStatus s = BC_STATUS_SUCCESS;
4677 BcInst prev = BC_INST_PRINT;
4678 BcLexType top, t = p->l.t.t;
4679 size_t nexprs = 0, ops_bgn = p->ops.len;
4680 unsigned nparens, nrelops;
4681 bool paren_first, paren_expr, rprn, done, get_token, assign, bin_last;
4683 dbg_lex_enter("%s:%d entered", __func__, __LINE__);
4684 paren_first = p->l.t.t == BC_LEX_LPAREN;
4685 nparens = nrelops = 0;
4686 paren_expr = rprn = done = get_token = assign = false;
4689 for (; !G_interrupt && !s && !done && bc_parse_exprs(t); t = p->l.t.t) {
4695 s = zbc_parse_incdec(p, &prev, &paren_expr, &nexprs, flags);
4696 rprn = get_token = bin_last = false;
4700 case BC_LEX_OP_MINUS:
4702 s = zbc_parse_minus(p, &prev, ops_bgn, rprn, &nexprs);
4703 rprn = get_token = false;
4704 bin_last = prev == BC_INST_MINUS;
4708 case BC_LEX_OP_ASSIGN_POWER:
4709 case BC_LEX_OP_ASSIGN_MULTIPLY:
4710 case BC_LEX_OP_ASSIGN_DIVIDE:
4711 case BC_LEX_OP_ASSIGN_MODULUS:
4712 case BC_LEX_OP_ASSIGN_PLUS:
4713 case BC_LEX_OP_ASSIGN_MINUS:
4714 case BC_LEX_OP_ASSIGN:
4716 if (prev != BC_INST_VAR && prev != BC_INST_ARRAY_ELEM &&
4717 prev != BC_INST_SCALE && prev != BC_INST_IBASE &&
4718 prev != BC_INST_OBASE && prev != BC_INST_LAST)
4720 s = bc_error("bad assignment:"
4721 " left side must be variable"
4723 ); // note: shared string
4728 case BC_LEX_OP_POWER:
4729 case BC_LEX_OP_MULTIPLY:
4730 case BC_LEX_OP_DIVIDE:
4731 case BC_LEX_OP_MODULUS:
4732 case BC_LEX_OP_PLUS:
4733 case BC_LEX_OP_REL_EQ:
4734 case BC_LEX_OP_REL_LE:
4735 case BC_LEX_OP_REL_GE:
4736 case BC_LEX_OP_REL_NE:
4737 case BC_LEX_OP_REL_LT:
4738 case BC_LEX_OP_REL_GT:
4739 case BC_LEX_OP_BOOL_NOT:
4740 case BC_LEX_OP_BOOL_OR:
4741 case BC_LEX_OP_BOOL_AND:
4743 if (((t == BC_LEX_OP_BOOL_NOT) != bin_last)
4744 || (t != BC_LEX_OP_BOOL_NOT && prev == BC_INST_BOOL_NOT)
4746 return bc_error_bad_expression();
4749 nrelops += t >= BC_LEX_OP_REL_EQ && t <= BC_LEX_OP_REL_GT;
4750 prev = BC_TOKEN_2_INST(t);
4751 bc_parse_operator(p, t, ops_bgn, &nexprs);
4752 s = zbc_lex_next(&p->l);
4753 rprn = get_token = false;
4754 bin_last = t != BC_LEX_OP_BOOL_NOT;
4761 if (BC_PARSE_LEAF(prev, rprn))
4762 return bc_error_bad_expression();
4764 paren_expr = rprn = bin_last = false;
4766 bc_vec_push(&p->ops, &t);
4773 if (bin_last || prev == BC_INST_BOOL_NOT)
4774 return bc_error_bad_expression();
4777 s = BC_STATUS_SUCCESS;
4782 else if (!paren_expr) {
4783 dbg_lex_done("%s:%d done (returning EMPTY_EXP)", __func__, __LINE__);
4784 return BC_STATUS_PARSE_EMPTY_EXP;
4788 paren_expr = rprn = true;
4789 get_token = bin_last = false;
4791 s = zbc_parse_rightParen(p, ops_bgn, &nexprs);
4798 if (BC_PARSE_LEAF(prev, rprn))
4799 return bc_error_bad_expression();
4801 rprn = get_token = bin_last = false;
4802 s = zbc_parse_name(p, &prev, flags & ~BC_PARSE_NOCALL);
4810 if (BC_PARSE_LEAF(prev, rprn))
4811 return bc_error_bad_expression();
4812 bc_parse_number(p, &prev, &nexprs);
4813 paren_expr = get_token = true;
4814 rprn = bin_last = false;
4819 case BC_LEX_KEY_IBASE:
4820 case BC_LEX_KEY_LAST:
4821 case BC_LEX_KEY_OBASE:
4823 if (BC_PARSE_LEAF(prev, rprn))
4824 return bc_error_bad_expression();
4825 prev = (char) (t - BC_LEX_KEY_IBASE + BC_INST_IBASE);
4826 bc_parse_push(p, (char) prev);
4828 paren_expr = get_token = true;
4829 rprn = bin_last = false;
4835 case BC_LEX_KEY_LENGTH:
4836 case BC_LEX_KEY_SQRT:
4838 if (BC_PARSE_LEAF(prev, rprn))
4839 return bc_error_bad_expression();
4840 s = zbc_parse_builtin(p, t, flags, &prev);
4842 rprn = get_token = bin_last = false;
4848 case BC_LEX_KEY_READ:
4850 if (BC_PARSE_LEAF(prev, rprn))
4851 return bc_error_bad_expression();
4852 else if (flags & BC_PARSE_NOREAD)
4853 s = bc_error_nested_read_call();
4855 s = zbc_parse_read(p);
4858 rprn = get_token = bin_last = false;
4860 prev = BC_INST_READ;
4865 case BC_LEX_KEY_SCALE:
4867 if (BC_PARSE_LEAF(prev, rprn))
4868 return bc_error_bad_expression();
4869 s = zbc_parse_scale(p, &prev, flags);
4871 rprn = get_token = bin_last = false;
4873 prev = BC_INST_SCALE;
4880 s = bc_error_bad_token();
4885 if (!s && get_token) s = zbc_lex_next(&p->l);
4889 if (G_interrupt) return BC_STATUS_FAILURE; // ^C: stop parsing
4891 while (p->ops.len > ops_bgn) {
4893 top = BC_PARSE_TOP_OP(p);
4894 assign = top >= BC_LEX_OP_ASSIGN_POWER && top <= BC_LEX_OP_ASSIGN;
4896 if (top == BC_LEX_LPAREN || top == BC_LEX_RPAREN)
4897 return bc_error_bad_expression();
4899 bc_parse_push(p, BC_TOKEN_2_INST(top));
4901 nexprs -= top != BC_LEX_OP_BOOL_NOT && top != BC_LEX_NEG;
4902 bc_vec_pop(&p->ops);
4905 if (prev == BC_INST_BOOL_NOT || nexprs != 1)
4906 return bc_error_bad_expression();
4908 //TODO: why is this needed at all?
4909 // next is BcParseNext, byte array of up to 4 BC_LEX's, packed into 32-bit word
4911 if (t == (next & 0x7f))
4913 if (next & 0x80) // last element?
4917 if (t != BC_LEX_KEY_ELSE)
4918 return bc_error_bad_expression();
4921 if (!(flags & BC_PARSE_REL) && nrelops) {
4922 s = bc_POSIX_does_not_allow("comparison operators outside if or loops");
4923 ERROR_RETURN(if (s) return s;)
4925 else if ((flags & BC_PARSE_REL) && nrelops > 1) {
4926 s = bc_POSIX_requires("exactly one comparison operator per condition");
4927 ERROR_RETURN(if (s) return s;)
4930 if (flags & BC_PARSE_PRINT) {
4931 if (paren_first || !assign) bc_parse_push(p, BC_INST_PRINT);
4932 bc_parse_push(p, BC_INST_POP);
4935 dbg_lex_done("%s:%d done", __func__, __LINE__);
4939 #undef zbc_parse_expr
4940 static BC_STATUS zbc_parse_expr(BcParse *p, uint8_t flags, BcParseNext next)
4944 s = bc_parse_expr_empty_ok(p, flags, next);
4945 if (s == BC_STATUS_PARSE_EMPTY_EXP)
4946 RETURN_STATUS(bc_error("empty expression"));
4949 #if ERRORS_ARE_FATAL
4950 # define zbc_parse_expr(...) (zbc_parse_expr(__VA_ARGS__), BC_STATUS_SUCCESS)
4957 #define DC_PARSE_BUF_LEN ((int) (sizeof(uint32_t) * CHAR_BIT))
4959 static BC_STATUS zdc_parse_register(BcParse *p)
4964 s = zbc_lex_next(&p->l);
4965 if (s) RETURN_STATUS(s);
4966 if (p->l.t.t != BC_LEX_NAME) RETURN_STATUS(bc_error_bad_token());
4968 name = xstrdup(p->l.t.v.v);
4969 bc_parse_pushName(p, name);
4973 #if ERRORS_ARE_FATAL
4974 # define zdc_parse_register(...) (zdc_parse_register(__VA_ARGS__), BC_STATUS_SUCCESS)
4977 static BC_STATUS zdc_parse_string(BcParse *p)
4979 char *str, *name, b[DC_PARSE_BUF_LEN + 1];
4980 size_t idx, len = G.prog.strs.len;
4982 sprintf(b, "%0*zu", DC_PARSE_BUF_LEN, len);
4985 str = xstrdup(p->l.t.v.v);
4986 bc_parse_push(p, BC_INST_STR);
4987 bc_parse_pushIndex(p, len);
4988 bc_vec_push(&G.prog.strs, &str);
4989 bc_parse_addFunc(p, name, &idx);
4991 RETURN_STATUS(zbc_lex_next(&p->l));
4993 #if ERRORS_ARE_FATAL
4994 # define zdc_parse_string(...) (zdc_parse_string(__VA_ARGS__), BC_STATUS_SUCCESS)
4997 static BC_STATUS zdc_parse_mem(BcParse *p, uint8_t inst, bool name, bool store)
5001 bc_parse_push(p, inst);
5003 s = zdc_parse_register(p);
5004 if (s) RETURN_STATUS(s);
5008 bc_parse_push(p, BC_INST_SWAP);
5009 bc_parse_push(p, BC_INST_ASSIGN);
5010 bc_parse_push(p, BC_INST_POP);
5013 RETURN_STATUS(zbc_lex_next(&p->l));
5015 #if ERRORS_ARE_FATAL
5016 # define zdc_parse_mem(...) (zdc_parse_mem(__VA_ARGS__), BC_STATUS_SUCCESS)
5019 static BC_STATUS zdc_parse_cond(BcParse *p, uint8_t inst)
5023 bc_parse_push(p, inst);
5024 bc_parse_push(p, BC_INST_EXEC_COND);
5026 s = zdc_parse_register(p);
5027 if (s) RETURN_STATUS(s);
5029 s = zbc_lex_next(&p->l);
5030 if (s) RETURN_STATUS(s);
5032 if (p->l.t.t == BC_LEX_ELSE) {
5033 s = zdc_parse_register(p);
5034 if (s) RETURN_STATUS(s);
5035 s = zbc_lex_next(&p->l);
5038 bc_parse_push(p, BC_PARSE_STREND);
5042 #if ERRORS_ARE_FATAL
5043 # define zdc_parse_cond(...) (zdc_parse_cond(__VA_ARGS__), BC_STATUS_SUCCESS)
5046 static BC_STATUS zdc_parse_token(BcParse *p, BcLexType t, uint8_t flags)
5048 BcStatus s = BC_STATUS_SUCCESS;
5051 bool assign, get_token = false;
5054 case BC_LEX_OP_REL_EQ:
5055 case BC_LEX_OP_REL_LE:
5056 case BC_LEX_OP_REL_GE:
5057 case BC_LEX_OP_REL_NE:
5058 case BC_LEX_OP_REL_LT:
5059 case BC_LEX_OP_REL_GT:
5060 s = zdc_parse_cond(p, t - BC_LEX_OP_REL_EQ + BC_INST_REL_EQ);
5064 s = zdc_parse_mem(p, BC_INST_ARRAY_ELEM, true, t == BC_LEX_COLON);
5067 s = zdc_parse_string(p);
5071 if (t == BC_LEX_NEG) {
5072 s = zbc_lex_next(&p->l);
5073 if (s) RETURN_STATUS(s);
5074 if (p->l.t.t != BC_LEX_NUMBER)
5075 RETURN_STATUS(bc_error_bad_token());
5077 bc_parse_number(p, &prev, &p->nbraces);
5078 if (t == BC_LEX_NEG) bc_parse_push(p, BC_INST_NEG);
5081 case BC_LEX_KEY_READ:
5082 if (flags & BC_PARSE_NOREAD)
5083 s = bc_error_nested_read_call();
5085 bc_parse_push(p, BC_INST_READ);
5088 case BC_LEX_OP_ASSIGN:
5089 case BC_LEX_STORE_PUSH:
5090 assign = t == BC_LEX_OP_ASSIGN;
5091 inst = assign ? BC_INST_VAR : BC_INST_PUSH_TO_VAR;
5092 s = zdc_parse_mem(p, inst, true, assign);
5095 case BC_LEX_LOAD_POP:
5096 inst = t == BC_LEX_LOAD_POP ? BC_INST_PUSH_VAR : BC_INST_LOAD;
5097 s = zdc_parse_mem(p, inst, true, false);
5099 case BC_LEX_STORE_IBASE:
5100 case BC_LEX_STORE_SCALE:
5101 case BC_LEX_STORE_OBASE:
5102 inst = t - BC_LEX_STORE_IBASE + BC_INST_IBASE;
5103 s = zdc_parse_mem(p, inst, false, true);
5106 s = bc_error_bad_token();
5111 if (!s && get_token) s = zbc_lex_next(&p->l);
5115 #if ERRORS_ARE_FATAL
5116 # define zdc_parse_token(...) (zdc_parse_token(__VA_ARGS__), BC_STATUS_SUCCESS)
5119 static BC_STATUS zdc_parse_expr(BcParse *p, uint8_t flags)
5121 BcStatus s = BC_STATUS_SUCCESS;
5125 if (flags & BC_PARSE_NOCALL) p->nbraces = G.prog.results.len;
5127 for (t = p->l.t.t; !s && t != BC_LEX_EOF; t = p->l.t.t) {
5128 inst = dc_parse_insts[t];
5130 if (inst != BC_INST_INVALID) {
5131 bc_parse_push(p, inst);
5132 s = zbc_lex_next(&p->l);
5134 s = zdc_parse_token(p, t, flags);
5137 if (!s && p->l.t.t == BC_LEX_EOF && (flags & BC_PARSE_NOCALL))
5138 bc_parse_push(p, BC_INST_POP_EXEC);
5142 #if ERRORS_ARE_FATAL
5143 # define zdc_parse_expr(...) (zdc_parse_expr(__VA_ARGS__), BC_STATUS_SUCCESS)
5146 static BC_STATUS zdc_parse_parse(BcParse *p)
5150 if (p->l.t.t == BC_LEX_EOF)
5151 s = bc_error("end of file");
5153 s = zdc_parse_expr(p, 0);
5155 if (s || G_interrupt) {
5157 s = BC_STATUS_FAILURE;
5162 #if ERRORS_ARE_FATAL
5163 # define zdc_parse_parse(...) (zdc_parse_parse(__VA_ARGS__), BC_STATUS_SUCCESS)
5168 static BC_STATUS zcommon_parse_expr(BcParse *p, uint8_t flags)
5171 IF_BC(RETURN_STATUS(zbc_parse_expr(p, flags, bc_parse_next_read)));
5173 IF_DC(RETURN_STATUS(zdc_parse_expr(p, flags)));
5176 #if ERRORS_ARE_FATAL
5177 # define zcommon_parse_expr(...) (zcommon_parse_expr(__VA_ARGS__), BC_STATUS_SUCCESS)
5180 static BcVec* bc_program_search(char *id, bool var)
5188 v = var ? &G.prog.vars : &G.prog.arrs;
5189 map = var ? &G.prog.var_map : &G.prog.arr_map;
5193 new = bc_map_insert(map, &e, &i); // 1 if insertion was successful
5196 bc_array_init(&data.v, var);
5197 bc_vec_push(v, &data.v);
5200 ptr = bc_vec_item(map, i);
5201 if (new) ptr->name = xstrdup(e.name);
5202 return bc_vec_item(v, ptr->idx);
5205 static BC_STATUS zbc_program_num(BcResult *r, BcNum **num, bool hex)
5210 case BC_RESULT_TEMP:
5211 case BC_RESULT_IBASE:
5212 case BC_RESULT_SCALE:
5213 case BC_RESULT_OBASE:
5219 case BC_RESULT_CONSTANT:
5222 char **str = bc_vec_item(&G.prog.consts, r->d.id.idx);
5223 size_t base_t, len = strlen(*str);
5226 bc_num_init(&r->d.n, len);
5228 hex = hex && len == 1;
5229 base = hex ? &G.prog.hexb : &G.prog.ib;
5230 base_t = hex ? BC_NUM_MAX_IBASE : G.prog.ib_t;
5231 s = zbc_num_parse(&r->d.n, *str, base, base_t);
5234 bc_num_free(&r->d.n);
5239 r->t = BC_RESULT_TEMP;
5245 case BC_RESULT_ARRAY:
5246 case BC_RESULT_ARRAY_ELEM:
5250 v = bc_program_search(r->d.id.name, r->t == BC_RESULT_VAR);
5252 if (r->t == BC_RESULT_ARRAY_ELEM) {
5254 if (v->len <= r->d.id.idx) bc_array_expand(v, r->d.id.idx + 1);
5255 *num = bc_vec_item(v, r->d.id.idx);
5258 *num = bc_vec_top(v);
5263 case BC_RESULT_LAST:
5265 *num = &G.prog.last;
5276 RETURN_STATUS(BC_STATUS_SUCCESS);
5278 #if ERRORS_ARE_FATAL
5279 # define zbc_program_num(...) (zbc_program_num(__VA_ARGS__), BC_STATUS_SUCCESS)
5282 static BC_STATUS zbc_program_binOpPrep(BcResult **l, BcNum **ln,
5283 BcResult **r, BcNum **rn, bool assign)
5287 BcResultType lt, rt;
5289 if (!BC_PROG_STACK(&G.prog.results, 2))
5290 RETURN_STATUS(bc_error_stack_has_too_few_elements());
5292 *r = bc_vec_item_rev(&G.prog.results, 0);
5293 *l = bc_vec_item_rev(&G.prog.results, 1);
5297 hex = assign && (lt == BC_RESULT_IBASE || lt == BC_RESULT_OBASE);
5299 s = zbc_program_num(*l, ln, false);
5300 if (s) RETURN_STATUS(s);
5301 s = zbc_program_num(*r, rn, hex);
5302 if (s) RETURN_STATUS(s);
5304 // We run this again under these conditions in case any vector has been
5305 // reallocated out from under the BcNums or arrays we had.
5306 if (lt == rt && (lt == BC_RESULT_VAR || lt == BC_RESULT_ARRAY_ELEM)) {
5307 s = zbc_program_num(*l, ln, false);
5308 if (s) RETURN_STATUS(s);
5311 if (!BC_PROG_NUM((*l), (*ln)) && (!assign || (*l)->t != BC_RESULT_VAR))
5312 RETURN_STATUS(bc_error_variable_is_wrong_type());
5313 if (!assign && !BC_PROG_NUM((*r), (*ln)))
5314 RETURN_STATUS(bc_error_variable_is_wrong_type());
5318 #if ERRORS_ARE_FATAL
5319 # define zbc_program_binOpPrep(...) (zbc_program_binOpPrep(__VA_ARGS__), BC_STATUS_SUCCESS)
5322 static void bc_program_binOpRetire(BcResult *r)
5324 r->t = BC_RESULT_TEMP;
5325 bc_vec_pop(&G.prog.results);
5326 bc_vec_pop(&G.prog.results);
5327 bc_vec_push(&G.prog.results, r);
5330 static BC_STATUS zbc_program_prep(BcResult **r, BcNum **n)
5334 if (!BC_PROG_STACK(&G.prog.results, 1))
5335 RETURN_STATUS(bc_error_stack_has_too_few_elements());
5336 *r = bc_vec_top(&G.prog.results);
5338 s = zbc_program_num(*r, n, false);
5339 if (s) RETURN_STATUS(s);
5341 if (!BC_PROG_NUM((*r), (*n)))
5342 RETURN_STATUS(bc_error_variable_is_wrong_type());
5346 #if ERRORS_ARE_FATAL
5347 # define zbc_program_prep(...) (zbc_program_prep(__VA_ARGS__), BC_STATUS_SUCCESS)
5350 static void bc_program_retire(BcResult *r, BcResultType t)
5353 bc_vec_pop(&G.prog.results);
5354 bc_vec_push(&G.prog.results, r);
5357 static BC_STATUS zbc_program_op(char inst)
5360 BcResult *opd1, *opd2, res;
5361 BcNum *n1, *n2 = NULL;
5363 s = zbc_program_binOpPrep(&opd1, &n1, &opd2, &n2, false);
5364 if (s) RETURN_STATUS(s);
5365 bc_num_init_DEF_SIZE(&res.d.n);
5367 s = BC_STATUS_SUCCESS;
5368 ERROR_RETURN(s =) zbc_program_ops[inst - BC_INST_POWER](n1, n2, &res.d.n, G.prog.scale);
5370 bc_program_binOpRetire(&res);
5375 bc_num_free(&res.d.n);
5378 #if ERRORS_ARE_FATAL
5379 # define zbc_program_op(...) (zbc_program_op(__VA_ARGS__), BC_STATUS_SUCCESS)
5382 static BC_STATUS zbc_program_read(void)
5384 const char *sv_file;
5392 RETURN_STATUS(bc_error_nested_read_call());
5394 f = bc_program_func(BC_PROG_READ);
5395 bc_vec_pop_all(&f->code);
5397 sv_file = G.prog.file;
5401 bc_char_vec_init(&buf);
5404 bc_parse_create(&parse, BC_PROG_READ);
5405 bc_lex_file(&parse.l);
5407 s = zbc_parse_text_init(&parse, buf.v);
5408 if (s) goto exec_err;
5409 s = zcommon_parse_expr(&parse, BC_PARSE_NOREAD);
5410 if (s) goto exec_err;
5412 if (parse.l.t.t != BC_LEX_NLINE && parse.l.t.t != BC_LEX_EOF) {
5413 s = bc_error("bad read() expression");
5417 ip.func = BC_PROG_READ;
5419 ip.len = G.prog.results.len;
5421 // Update this pointer, just in case.
5422 f = bc_program_func(BC_PROG_READ);
5424 bc_vec_pushByte(&f->code, BC_INST_POP_EXEC);
5425 bc_vec_push(&G.prog.stack, &ip);
5428 bc_parse_free(&parse);
5431 G.prog.file = sv_file;
5435 #if ERRORS_ARE_FATAL
5436 # define zbc_program_read(...) (zbc_program_read(__VA_ARGS__), BC_STATUS_SUCCESS)
5439 static size_t bc_program_index(char *code, size_t *bgn)
5441 char amt = code[(*bgn)++], i = 0;
5444 for (; i < amt; ++i, ++(*bgn))
5445 res |= (((size_t)((int) code[*bgn]) & UCHAR_MAX) << (i * CHAR_BIT));
5450 static char *bc_program_name(char *code, size_t *bgn)
5453 char c, *s, *str = code + *bgn, *ptr = strchr(str, BC_PARSE_STREND);
5455 s = xmalloc(ptr - str + 1);
5458 for (i = 0; c != 0 && c != BC_PARSE_STREND; c = code[(*bgn)++], ++i)
5466 static void bc_program_printString(const char *str)
5470 // Example: echo '[]ap' | dc
5471 // should print two bytes: 0x00, 0x0A
5478 if (c != '\\' || !*str)
5498 G.prog.nchars = SIZE_MAX;
5510 // Just print the backslash and following character.
5521 static void bc_num_printNewline(void)
5523 if (G.prog.nchars == G.prog.len - 1) {
5531 static FAST_FUNC void bc_num_printChar(size_t num, size_t width, bool radix)
5534 bb_putchar((char) num);
5535 G.prog.nchars += width;
5539 static FAST_FUNC void bc_num_printDigits(size_t num, size_t width, bool radix)
5543 bc_num_printNewline();
5544 bb_putchar(radix ? '.' : ' ');
5547 bc_num_printNewline();
5548 for (exp = 0, pow = 1; exp < width - 1; ++exp, pow *= 10)
5551 for (exp = 0; exp < width; pow /= 10, ++G.prog.nchars, ++exp) {
5553 bc_num_printNewline();
5556 bb_putchar(((char) dig) + '0');
5560 static FAST_FUNC void bc_num_printHex(size_t num, size_t width, bool radix)
5563 bc_num_printNewline();
5568 bc_num_printNewline();
5569 bb_putchar(bb_hexdigits_upcase[num]);
5570 G.prog.nchars += width;
5573 static void bc_num_printDecimal(BcNum *n)
5575 size_t i, rdx = n->rdx - 1;
5577 if (n->neg) bb_putchar('-');
5578 G.prog.nchars += n->neg;
5580 for (i = n->len - 1; i < n->len; --i)
5581 bc_num_printHex((size_t) n->num[i], 1, i == rdx);
5584 static BC_STATUS zbc_num_printNum(BcNum *n, BcNum *base, size_t width, BcNumDigitOp print)
5588 BcNum intp, fracp, digit, frac_len;
5589 unsigned long dig, *ptr;
5594 print(0, width, false);
5595 RETURN_STATUS(BC_STATUS_SUCCESS);
5598 bc_vec_init(&stack, sizeof(long), NULL);
5599 bc_num_init(&intp, n->len);
5600 bc_num_init(&fracp, n->rdx);
5601 bc_num_init(&digit, width);
5602 bc_num_init(&frac_len, BC_NUM_INT(n));
5603 bc_num_copy(&intp, n);
5604 bc_num_one(&frac_len);
5606 bc_num_truncate(&intp, intp.rdx);
5607 s = zbc_num_sub(n, &intp, &fracp, 0);
5610 while (intp.len != 0) {
5611 s = zbc_num_divmod(&intp, base, &intp, &digit, 0);
5613 s = zbc_num_ulong(&digit, &dig);
5615 bc_vec_push(&stack, &dig);
5618 for (i = 0; i < stack.len; ++i) {
5619 ptr = bc_vec_item_rev(&stack, i);
5620 print(*ptr, width, false);
5623 if (!n->rdx) goto err;
5625 for (radix = true; frac_len.len <= n->rdx; radix = false) {
5626 s = zbc_num_mul(&fracp, base, &fracp, n->rdx);
5628 s = zbc_num_ulong(&fracp, &dig);
5630 bc_num_ulong2num(&intp, dig);
5631 s = zbc_num_sub(&fracp, &intp, &fracp, 0);
5633 print(dig, width, radix);
5634 s = zbc_num_mul(&frac_len, base, &frac_len, 0);
5639 bc_num_free(&frac_len);
5640 bc_num_free(&digit);
5641 bc_num_free(&fracp);
5643 bc_vec_free(&stack);
5646 #if ERRORS_ARE_FATAL
5647 # define zbc_num_printNum(...) (zbc_num_printNum(__VA_ARGS__), BC_STATUS_SUCCESS)
5650 static BC_STATUS zbc_num_printBase(BcNum *n)
5664 if (G.prog.ob_t <= BC_NUM_MAX_IBASE) {
5666 print = bc_num_printHex;
5669 for (i = G.prog.ob_t - 1, width = 0; i != 0; i /= 10, ++width)
5671 print = bc_num_printDigits;
5674 s = zbc_num_printNum(n, &G.prog.ob, width, print);
5679 #if ERRORS_ARE_FATAL
5680 # define zbc_num_printBase(...) (zbc_num_printBase(__VA_ARGS__), BC_STATUS_SUCCESS)
5684 static BC_STATUS zbc_num_stream(BcNum *n, BcNum *base)
5686 RETURN_STATUS(zbc_num_printNum(n, base, 1, bc_num_printChar));
5688 #if ERRORS_ARE_FATAL
5689 # define zbc_num_stream(...) (zbc_num_stream(__VA_ARGS__), BC_STATUS_SUCCESS)
5693 static BC_STATUS zbc_num_print(BcNum *n, bool newline)
5695 BcStatus s = BC_STATUS_SUCCESS;
5697 bc_num_printNewline();
5703 else if (G.prog.ob_t == 10)
5704 bc_num_printDecimal(n);
5706 s = zbc_num_printBase(n);
5715 #if ERRORS_ARE_FATAL
5716 # define zbc_num_print(...) (zbc_num_print(__VA_ARGS__), BC_STATUS_SUCCESS)
5719 static BC_STATUS zbc_program_print(char inst, size_t idx)
5724 bool pop = inst != BC_INST_PRINT;
5726 if (!BC_PROG_STACK(&G.prog.results, idx + 1))
5727 RETURN_STATUS(bc_error_stack_has_too_few_elements());
5729 r = bc_vec_item_rev(&G.prog.results, idx);
5730 num = NULL; // is this NULL necessary?
5731 s = zbc_program_num(r, &num, false);
5732 if (s) RETURN_STATUS(s);
5734 if (BC_PROG_NUM(r, num)) {
5735 s = zbc_num_print(num, !pop);
5736 if (!s) bc_num_copy(&G.prog.last, num);
5741 idx = (r->t == BC_RESULT_STR) ? r->d.id.idx : num->rdx;
5742 str = *bc_program_str(idx);
5744 if (inst == BC_INST_PRINT_STR) {
5747 if (c == '\0') break;
5750 if (c == '\n') G.prog.nchars = 0;
5754 bc_program_printString(str);
5755 if (inst == BC_INST_PRINT) bb_putchar('\n');
5759 if (!s && pop) bc_vec_pop(&G.prog.results);
5763 #if ERRORS_ARE_FATAL
5764 # define zbc_program_print(...) (zbc_program_print(__VA_ARGS__), BC_STATUS_SUCCESS)
5767 static BC_STATUS zbc_program_negate(void)
5773 s = zbc_program_prep(&ptr, &num);
5774 if (s) RETURN_STATUS(s);
5776 bc_num_init(&res.d.n, num->len);
5777 bc_num_copy(&res.d.n, num);
5778 if (res.d.n.len) res.d.n.neg = !res.d.n.neg;
5780 bc_program_retire(&res, BC_RESULT_TEMP);
5784 #if ERRORS_ARE_FATAL
5785 # define zbc_program_negate(...) (zbc_program_negate(__VA_ARGS__), BC_STATUS_SUCCESS)
5788 static BC_STATUS zbc_program_logical(char inst)
5791 BcResult *opd1, *opd2, res;
5795 s = zbc_program_binOpPrep(&opd1, &n1, &opd2, &n2, false);
5796 if (s) RETURN_STATUS(s);
5798 bc_num_init_DEF_SIZE(&res.d.n);
5800 if (inst == BC_INST_BOOL_AND)
5801 cond = bc_num_cmp(n1, &G.prog.zero) && bc_num_cmp(n2, &G.prog.zero);
5802 else if (inst == BC_INST_BOOL_OR)
5803 cond = bc_num_cmp(n1, &G.prog.zero) || bc_num_cmp(n2, &G.prog.zero);
5805 cond = bc_num_cmp(n1, n2);
5807 case BC_INST_REL_EQ:
5810 case BC_INST_REL_LE:
5813 case BC_INST_REL_GE:
5816 case BC_INST_REL_LT:
5819 case BC_INST_REL_GT:
5822 default: // = case BC_INST_REL_NE:
5823 //cond = (cond != 0); - not needed
5828 if (cond) bc_num_one(&res.d.n);
5829 //else bc_num_zero(&res.d.n); - already is
5831 bc_program_binOpRetire(&res);
5835 #if ERRORS_ARE_FATAL
5836 # define zbc_program_logical(...) (zbc_program_logical(__VA_ARGS__), BC_STATUS_SUCCESS)
5840 static BC_STATUS zbc_program_assignStr(BcResult *r, BcVec *v,
5846 memset(&n2, 0, sizeof(BcNum));
5847 n2.rdx = res.d.id.idx = r->d.id.idx;
5848 res.t = BC_RESULT_STR;
5851 if (!BC_PROG_STACK(&G.prog.results, 2))
5852 RETURN_STATUS(bc_error_stack_has_too_few_elements());
5854 bc_vec_pop(&G.prog.results);
5857 bc_vec_pop(&G.prog.results);
5859 bc_vec_push(&G.prog.results, &res);
5860 bc_vec_push(v, &n2);
5862 RETURN_STATUS(BC_STATUS_SUCCESS);
5864 #if ERRORS_ARE_FATAL
5865 # define zbc_program_assignStr(...) (zbc_program_assignStr(__VA_ARGS__), BC_STATUS_SUCCESS)
5869 static BC_STATUS zbc_program_copyToVar(char *name, bool var)
5876 if (!BC_PROG_STACK(&G.prog.results, 1))
5877 RETURN_STATUS(bc_error_stack_has_too_few_elements());
5879 ptr = bc_vec_top(&G.prog.results);
5880 if ((ptr->t == BC_RESULT_ARRAY) != !var)
5881 RETURN_STATUS(bc_error_variable_is_wrong_type());
5882 v = bc_program_search(name, var);
5885 if (ptr->t == BC_RESULT_STR && !var)
5886 RETURN_STATUS(bc_error_variable_is_wrong_type());
5887 if (ptr->t == BC_RESULT_STR)
5888 RETURN_STATUS(zbc_program_assignStr(ptr, v, true));
5891 s = zbc_program_num(ptr, &n, false);
5892 if (s) RETURN_STATUS(s);
5894 // Do this once more to make sure that pointers were not invalidated.
5895 v = bc_program_search(name, var);
5898 bc_num_init_DEF_SIZE(&r.d.n);
5899 bc_num_copy(&r.d.n, n);
5902 bc_array_init(&r.d.v, true);
5903 bc_array_copy(&r.d.v, (BcVec *) n);
5906 bc_vec_push(v, &r.d);
5907 bc_vec_pop(&G.prog.results);
5911 #if ERRORS_ARE_FATAL
5912 # define zbc_program_copyToVar(...) (zbc_program_copyToVar(__VA_ARGS__), BC_STATUS_SUCCESS)
5915 static BC_STATUS zbc_program_assign(char inst)
5918 BcResult *left, *right, res;
5919 BcNum *l = NULL, *r = NULL;
5920 bool assign = inst == BC_INST_ASSIGN, ib, sc;
5922 s = zbc_program_binOpPrep(&left, &l, &right, &r, assign);
5923 if (s) RETURN_STATUS(s);
5925 ib = left->t == BC_RESULT_IBASE;
5926 sc = left->t == BC_RESULT_SCALE;
5930 if (right->t == BC_RESULT_STR) {
5934 if (left->t != BC_RESULT_VAR)
5935 RETURN_STATUS(bc_error_variable_is_wrong_type());
5936 v = bc_program_search(left->d.id.name, true);
5938 RETURN_STATUS(zbc_program_assignStr(right, v, false));
5942 if (left->t == BC_RESULT_CONSTANT || left->t == BC_RESULT_TEMP)
5943 RETURN_STATUS(bc_error("bad assignment:"
5944 " left side must be variable"
5946 )); // note: shared string
5949 if (inst == BC_INST_ASSIGN_DIVIDE && !bc_num_cmp(r, &G.prog.zero))
5950 RETURN_STATUS(bc_error("divide by zero"));
5955 s = BC_STATUS_SUCCESS;
5956 ERROR_RETURN(s =) zbc_program_ops[inst - BC_INST_ASSIGN_POWER](l, r, l, G.prog.scale);
5958 if (s) RETURN_STATUS(s);
5963 if (ib || sc || left->t == BC_RESULT_OBASE) {
5964 static const char *const msg[] = {
5965 "bad ibase; must be [2,16]", //BC_RESULT_IBASE
5966 "bad scale; must be [0,"BC_MAX_SCALE_STR"]", //BC_RESULT_SCALE
5967 NULL, //can't happen //BC_RESULT_LAST
5968 NULL, //can't happen //BC_RESULT_CONSTANT
5969 NULL, //can't happen //BC_RESULT_ONE
5970 "bad obase; must be [2,"BC_MAX_OBASE_STR"]", //BC_RESULT_OBASE
5973 unsigned long val, max;
5975 s = zbc_num_ulong(l, &val);
5976 if (s) RETURN_STATUS(s);
5977 s = left->t - BC_RESULT_IBASE;
5980 ptr = &G.prog.scale;
5983 if (val < BC_NUM_MIN_BASE)
5984 RETURN_STATUS(bc_error(msg[s]));
5985 max = ib ? BC_NUM_MAX_IBASE : BC_MAX_OBASE;
5986 ptr = ib ? &G.prog.ib_t : &G.prog.ob_t;
5990 RETURN_STATUS(bc_error(msg[s]));
5992 bc_num_copy(ib ? &G.prog.ib : &G.prog.ob, l);
5994 *ptr = (size_t) val;
5995 s = BC_STATUS_SUCCESS;
5998 bc_num_init(&res.d.n, l->len);
5999 bc_num_copy(&res.d.n, l);
6000 bc_program_binOpRetire(&res);
6004 #if ERRORS_ARE_FATAL
6005 # define zbc_program_assign(...) (zbc_program_assign(__VA_ARGS__), BC_STATUS_SUCCESS)
6009 #define bc_program_pushVar(code, bgn, pop, copy) \
6010 bc_program_pushVar(code, bgn)
6011 // for bc, 'pop' and 'copy' are always false
6013 static BC_STATUS bc_program_pushVar(char *code, size_t *bgn,
6014 bool pop, bool copy)
6017 char *name = bc_program_name(code, bgn);
6019 r.t = BC_RESULT_VAR;
6024 BcVec *v = bc_program_search(name, true);
6025 BcNum *num = bc_vec_top(v);
6029 if (!BC_PROG_STACK(v, 2 - copy)) {
6031 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6037 if (!BC_PROG_STR(num)) {
6039 r.t = BC_RESULT_TEMP;
6041 bc_num_init_DEF_SIZE(&r.d.n);
6042 bc_num_copy(&r.d.n, num);
6045 r.t = BC_RESULT_STR;
6046 r.d.id.idx = num->rdx;
6049 if (!copy) bc_vec_pop(v);
6054 bc_vec_push(&G.prog.results, &r);
6056 RETURN_STATUS(BC_STATUS_SUCCESS);
6058 #if ERRORS_ARE_FATAL
6059 # define zbc_program_pushVar(...) (bc_program_pushVar(__VA_ARGS__), BC_STATUS_SUCCESS)
6061 # define zbc_program_pushVar(...) bc_program_pushVar(__VA_ARGS__)
6064 static BC_STATUS zbc_program_pushArray(char *code, size_t *bgn,
6067 BcStatus s = BC_STATUS_SUCCESS;
6071 r.d.id.name = bc_program_name(code, bgn);
6073 if (inst == BC_INST_ARRAY) {
6074 r.t = BC_RESULT_ARRAY;
6075 bc_vec_push(&G.prog.results, &r);
6082 s = zbc_program_prep(&operand, &num);
6084 s = zbc_num_ulong(num, &temp);
6087 if (temp > BC_MAX_DIM) {
6088 s = bc_error("array too long; must be [1,"BC_MAX_DIM_STR"]");
6092 r.d.id.idx = (size_t) temp;
6093 bc_program_retire(&r, BC_RESULT_ARRAY_ELEM);
6097 if (s) free(r.d.id.name);
6100 #if ERRORS_ARE_FATAL
6101 # define zbc_program_pushArray(...) (zbc_program_pushArray(__VA_ARGS__), BC_STATUS_SUCCESS)
6105 static BC_STATUS zbc_program_incdec(char inst)
6108 BcResult *ptr, res, copy;
6112 s = zbc_program_prep(&ptr, &num);
6113 if (s) RETURN_STATUS(s);
6115 if (inst == BC_INST_INC_POST || inst == BC_INST_DEC_POST) {
6116 copy.t = BC_RESULT_TEMP;
6117 bc_num_init(©.d.n, num->len);
6118 bc_num_copy(©.d.n, num);
6121 res.t = BC_RESULT_ONE;
6122 inst = inst == BC_INST_INC_PRE || inst == BC_INST_INC_POST ?
6123 BC_INST_ASSIGN_PLUS :
6124 BC_INST_ASSIGN_MINUS;
6126 bc_vec_push(&G.prog.results, &res);
6127 s = zbc_program_assign(inst);
6128 if (s) RETURN_STATUS(s);
6130 if (inst2 == BC_INST_INC_POST || inst2 == BC_INST_DEC_POST) {
6131 bc_vec_pop(&G.prog.results);
6132 bc_vec_push(&G.prog.results, ©);
6137 #if ERRORS_ARE_FATAL
6138 # define zbc_program_incdec(...) (zbc_program_incdec(__VA_ARGS__), BC_STATUS_SUCCESS)
6141 static BC_STATUS zbc_program_call(char *code, size_t *idx)
6144 size_t i, nparams = bc_program_index(code, idx);
6151 ip.func = bc_program_index(code, idx);
6152 func = bc_program_func(ip.func);
6154 if (func->code.len == 0) {
6155 RETURN_STATUS(bc_error("undefined function"));
6157 if (nparams != func->nparams) {
6158 RETURN_STATUS(bc_error_fmt("function has %u parameters, but called with %u", func->nparams, nparams));
6160 ip.len = G.prog.results.len - nparams;
6162 for (i = 0; i < nparams; ++i) {
6165 a = bc_vec_item(&func->autos, nparams - 1 - i);
6166 arg = bc_vec_top(&G.prog.results);
6168 if ((!a->idx) != (arg->t == BC_RESULT_ARRAY) || arg->t == BC_RESULT_STR)
6169 RETURN_STATUS(bc_error_variable_is_wrong_type());
6171 s = zbc_program_copyToVar(a->name, a->idx);
6172 if (s) RETURN_STATUS(s);
6175 for (; i < func->autos.len; ++i) {
6178 a = bc_vec_item(&func->autos, i);
6179 v = bc_program_search(a->name, a->idx);
6182 bc_num_init_DEF_SIZE(¶m.n);
6183 bc_vec_push(v, ¶m.n);
6186 bc_array_init(¶m.v, true);
6187 bc_vec_push(v, ¶m.v);
6191 bc_vec_push(&G.prog.stack, &ip);
6193 RETURN_STATUS(BC_STATUS_SUCCESS);
6195 #if ERRORS_ARE_FATAL
6196 # define zbc_program_call(...) (zbc_program_call(__VA_ARGS__), BC_STATUS_SUCCESS)
6199 static BC_STATUS zbc_program_return(char inst)
6204 BcInstPtr *ip = bc_vec_top(&G.prog.stack);
6206 if (!BC_PROG_STACK(&G.prog.results, ip->len + inst == BC_INST_RET))
6207 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6209 f = bc_program_func(ip->func);
6210 res.t = BC_RESULT_TEMP;
6212 if (inst == BC_INST_RET) {
6215 BcResult *operand = bc_vec_top(&G.prog.results);
6217 s = zbc_program_num(operand, &num, false);
6218 if (s) RETURN_STATUS(s);
6219 bc_num_init(&res.d.n, num->len);
6220 bc_num_copy(&res.d.n, num);
6223 bc_num_init_DEF_SIZE(&res.d.n);
6224 //bc_num_zero(&res.d.n); - already is
6227 // We need to pop arguments as well, so this takes that into account.
6228 for (i = 0; i < f->autos.len; ++i) {
6230 BcId *a = bc_vec_item(&f->autos, i);
6232 v = bc_program_search(a->name, a->idx);
6236 bc_vec_npop(&G.prog.results, G.prog.results.len - ip->len);
6237 bc_vec_push(&G.prog.results, &res);
6238 bc_vec_pop(&G.prog.stack);
6240 RETURN_STATUS(BC_STATUS_SUCCESS);
6242 #if ERRORS_ARE_FATAL
6243 # define zbc_program_return(...) (zbc_program_return(__VA_ARGS__), BC_STATUS_SUCCESS)
6247 static unsigned long bc_program_scale(BcNum *n)
6249 return (unsigned long) n->rdx;
6252 static unsigned long bc_program_len(BcNum *n)
6254 size_t len = n->len;
6256 if (n->rdx != len) return len;
6258 if (len == 0) break;
6260 if (n->num[len] != 0) break;
6265 static BC_STATUS zbc_program_builtin(char inst)
6271 bool len = inst == BC_INST_LENGTH;
6273 if (!BC_PROG_STACK(&G.prog.results, 1))
6274 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6275 opnd = bc_vec_top(&G.prog.results);
6277 s = zbc_program_num(opnd, &num, false);
6278 if (s) RETURN_STATUS(s);
6281 if (!BC_PROG_NUM(opnd, num) && !len)
6282 RETURN_STATUS(bc_error_variable_is_wrong_type());
6285 bc_num_init_DEF_SIZE(&res.d.n);
6287 if (inst == BC_INST_SQRT) s = zbc_num_sqrt(num, &res.d.n, G.prog.scale);
6289 else if (len != 0 && opnd->t == BC_RESULT_ARRAY) {
6290 bc_num_ulong2num(&res.d.n, (unsigned long) ((BcVec *) num)->len);
6294 else if (len != 0 && !BC_PROG_NUM(opnd, num)) {
6296 size_t idx = opnd->t == BC_RESULT_STR ? opnd->d.id.idx : num->rdx;
6298 str = bc_program_str(idx);
6299 bc_num_ulong2num(&res.d.n, strlen(*str));
6303 bc_num_ulong2num(&res.d.n, len ? bc_program_len(num) : bc_program_scale(num));
6306 bc_program_retire(&res, BC_RESULT_TEMP);
6310 #if ERRORS_ARE_FATAL
6311 # define zbc_program_builtin(...) (zbc_program_builtin(__VA_ARGS__), BC_STATUS_SUCCESS)
6315 static BC_STATUS zbc_program_divmod(void)
6318 BcResult *opd1, *opd2, res, res2;
6319 BcNum *n1, *n2 = NULL;
6321 s = zbc_program_binOpPrep(&opd1, &n1, &opd2, &n2, false);
6322 if (s) RETURN_STATUS(s);
6324 bc_num_init_DEF_SIZE(&res.d.n);
6325 bc_num_init(&res2.d.n, n2->len);
6327 s = zbc_num_divmod(n1, n2, &res2.d.n, &res.d.n, G.prog.scale);
6330 bc_program_binOpRetire(&res2);
6331 res.t = BC_RESULT_TEMP;
6332 bc_vec_push(&G.prog.results, &res);
6337 bc_num_free(&res2.d.n);
6338 bc_num_free(&res.d.n);
6341 #if ERRORS_ARE_FATAL
6342 # define zbc_program_divmod(...) (zbc_program_divmod(__VA_ARGS__), BC_STATUS_SUCCESS)
6345 static BC_STATUS zbc_program_modexp(void)
6348 BcResult *r1, *r2, *r3, res;
6349 BcNum *n1, *n2, *n3;
6351 if (!BC_PROG_STACK(&G.prog.results, 3))
6352 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6353 s = zbc_program_binOpPrep(&r2, &n2, &r3, &n3, false);
6354 if (s) RETURN_STATUS(s);
6356 r1 = bc_vec_item_rev(&G.prog.results, 2);
6357 s = zbc_program_num(r1, &n1, false);
6358 if (s) RETURN_STATUS(s);
6359 if (!BC_PROG_NUM(r1, n1))
6360 RETURN_STATUS(bc_error_variable_is_wrong_type());
6362 // Make sure that the values have their pointers updated, if necessary.
6363 if (r1->t == BC_RESULT_VAR || r1->t == BC_RESULT_ARRAY_ELEM) {
6365 if (r1->t == r2->t) {
6366 s = zbc_program_num(r2, &n2, false);
6367 if (s) RETURN_STATUS(s);
6370 if (r1->t == r3->t) {
6371 s = zbc_program_num(r3, &n3, false);
6372 if (s) RETURN_STATUS(s);
6376 bc_num_init(&res.d.n, n3->len);
6377 s = zbc_num_modexp(n1, n2, n3, &res.d.n);
6380 bc_vec_pop(&G.prog.results);
6381 bc_program_binOpRetire(&res);
6386 bc_num_free(&res.d.n);
6389 #if ERRORS_ARE_FATAL
6390 # define zbc_program_modexp(...) (zbc_program_modexp(__VA_ARGS__), BC_STATUS_SUCCESS)
6393 static void bc_program_stackLen(void)
6396 size_t len = G.prog.results.len;
6398 res.t = BC_RESULT_TEMP;
6400 bc_num_init_DEF_SIZE(&res.d.n);
6401 bc_num_ulong2num(&res.d.n, len);
6402 bc_vec_push(&G.prog.results, &res);
6405 static BC_STATUS zbc_program_asciify(void)
6410 char *str, *str2, c;
6411 size_t len = G.prog.strs.len, idx;
6414 if (!BC_PROG_STACK(&G.prog.results, 1))
6415 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6416 r = bc_vec_top(&G.prog.results);
6418 num = NULL; // TODO: is this NULL needed?
6419 s = zbc_program_num(r, &num, false);
6420 if (s) RETURN_STATUS(s);
6422 if (BC_PROG_NUM(r, num)) {
6424 bc_num_init_DEF_SIZE(&n);
6425 bc_num_copy(&n, num);
6426 bc_num_truncate(&n, n.rdx);
6428 s = zbc_num_mod(&n, &G.prog.strmb, &n, 0);
6429 if (s) goto num_err;
6430 s = zbc_num_ulong(&n, &val);
6431 if (s) goto num_err;
6438 idx = (r->t == BC_RESULT_STR) ? r->d.id.idx : num->rdx;
6439 str2 = *bc_program_str(idx);
6445 //str[1] = '\0'; - already is
6447 str2 = xstrdup(str);
6448 bc_program_addFunc(str2, &idx);
6450 if (idx != len + BC_PROG_REQ_FUNCS) {
6451 for (idx = 0; idx < G.prog.strs.len; ++idx) {
6452 if (strcmp(*bc_program_str(idx), str) == 0) {
6461 bc_vec_push(&G.prog.strs, &str);
6463 res.t = BC_RESULT_STR;
6465 bc_vec_pop(&G.prog.results);
6466 bc_vec_push(&G.prog.results, &res);
6468 RETURN_STATUS(BC_STATUS_SUCCESS);
6474 #if ERRORS_ARE_FATAL
6475 # define zbc_program_asciify(...) (zbc_program_asciify(__VA_ARGS__), BC_STATUS_SUCCESS)
6478 static BC_STATUS zbc_program_printStream(void)
6486 if (!BC_PROG_STACK(&G.prog.results, 1))
6487 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6488 r = bc_vec_top(&G.prog.results);
6490 s = zbc_program_num(r, &n, false);
6491 if (s) RETURN_STATUS(s);
6493 if (BC_PROG_NUM(r, n))
6494 s = zbc_num_stream(n, &G.prog.strmb);
6496 idx = (r->t == BC_RESULT_STR) ? r->d.id.idx : n->rdx;
6497 str = *bc_program_str(idx);
6503 #if ERRORS_ARE_FATAL
6504 # define zbc_program_printStream(...) (zbc_program_printStream(__VA_ARGS__), BC_STATUS_SUCCESS)
6507 static BC_STATUS zbc_program_nquit(void)
6514 s = zbc_program_prep(&opnd, &num);
6515 if (s) RETURN_STATUS(s);
6516 s = zbc_num_ulong(num, &val);
6517 if (s) RETURN_STATUS(s);
6519 bc_vec_pop(&G.prog.results);
6521 if (G.prog.stack.len < val)
6522 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6523 if (G.prog.stack.len == val) {
6524 QUIT_OR_RETURN_TO_MAIN;
6527 bc_vec_npop(&G.prog.stack, val);
6531 #if ERRORS_ARE_FATAL
6532 # define zbc_program_nquit(...) (zbc_program_nquit(__VA_ARGS__), BC_STATUS_SUCCESS)
6535 static BC_STATUS zbc_program_execStr(char *code, size_t *bgn,
6538 BcStatus s = BC_STATUS_SUCCESS;
6546 if (!BC_PROG_STACK(&G.prog.results, 1))
6547 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6549 r = bc_vec_top(&G.prog.results);
6552 BcNum *n = n; // for compiler
6555 char *then_name = bc_program_name(code, bgn);
6556 char *else_name = NULL;
6558 if (code[*bgn] == BC_PARSE_STREND)
6561 else_name = bc_program_name(code, bgn);
6563 exec = r->d.n.len != 0;
6565 if (!exec && else_name != NULL) {
6572 v = bc_program_search(name, true);
6579 if (!exec) goto exit;
6580 if (!BC_PROG_STR(n)) {
6581 s = bc_error_variable_is_wrong_type();
6587 if (r->t == BC_RESULT_STR) {
6589 } else if (r->t == BC_RESULT_VAR) {
6591 s = zbc_program_num(r, &n, false);
6592 if (s || !BC_PROG_STR(n)) goto exit;
6598 fidx = sidx + BC_PROG_REQ_FUNCS;
6600 str = bc_program_str(sidx);
6601 f = bc_program_func(fidx);
6603 if (f->code.len == 0) {
6604 bc_parse_create(&prs, fidx);
6605 s = zbc_parse_text_init(&prs, *str);
6607 s = zcommon_parse_expr(&prs, BC_PARSE_NOCALL);
6610 if (prs.l.t.t != BC_LEX_EOF) {
6611 s = bc_error_bad_expression();
6615 bc_parse_free(&prs);
6619 ip.len = G.prog.results.len;
6622 bc_vec_pop(&G.prog.results);
6623 bc_vec_push(&G.prog.stack, &ip);
6625 RETURN_STATUS(BC_STATUS_SUCCESS);
6628 bc_parse_free(&prs);
6629 f = bc_program_func(fidx);
6630 bc_vec_pop_all(&f->code);
6632 bc_vec_pop(&G.prog.results);
6635 #if ERRORS_ARE_FATAL
6636 # define zbc_program_execStr(...) (zbc_program_execStr(__VA_ARGS__), BC_STATUS_SUCCESS)
6640 static void bc_program_pushGlobal(char inst)
6645 res.t = inst - BC_INST_IBASE + BC_RESULT_IBASE;
6646 if (inst == BC_INST_IBASE)
6647 val = (unsigned long) G.prog.ib_t;
6648 else if (inst == BC_INST_SCALE)
6649 val = (unsigned long) G.prog.scale;
6651 val = (unsigned long) G.prog.ob_t;
6653 bc_num_init_DEF_SIZE(&res.d.n);
6654 bc_num_ulong2num(&res.d.n, val);
6655 bc_vec_push(&G.prog.results, &res);
6658 static void bc_program_addFunc(char *name, size_t *idx)
6660 BcId entry, *entry_ptr;
6665 entry.idx = G.prog.fns.len;
6667 inserted = bc_map_insert(&G.prog.fn_map, &entry, idx);
6668 if (!inserted) free(name);
6670 entry_ptr = bc_vec_item(&G.prog.fn_map, *idx);
6671 *idx = entry_ptr->idx;
6675 BcFunc *func = bc_program_func(entry_ptr->idx);
6677 // We need to reset these, so the function can be repopulated.
6679 bc_vec_pop_all(&func->autos);
6680 bc_vec_pop_all(&func->code);
6681 bc_vec_pop_all(&func->labels);
6685 bc_vec_push(&G.prog.fns, &f);
6689 static BC_STATUS zbc_program_exec(void)
6693 BcInstPtr *ip = bc_vec_top(&G.prog.stack);
6694 BcFunc *func = bc_program_func(ip->func);
6695 char *code = func->code.v;
6697 while (ip->idx < func->code.len) {
6698 BcStatus s = BC_STATUS_SUCCESS;
6699 char inst = code[(ip->idx)++];
6701 dbg_exec("inst:%d", inst);
6704 case BC_INST_JUMP_ZERO: {
6706 dbg_exec("BC_INST_JUMP_ZERO:");
6707 s = zbc_program_prep(&ptr, &num);
6708 if (s) RETURN_STATUS(s);
6709 zero = (bc_num_cmp(num, &G.prog.zero) == 0);
6710 bc_vec_pop(&G.prog.results);
6712 bc_program_index(code, &ip->idx);
6715 // else: fall through
6717 case BC_INST_JUMP: {
6718 size_t idx = bc_program_index(code, &ip->idx);
6719 size_t *addr = bc_vec_item(&func->labels, idx);
6720 dbg_exec("BC_INST_JUMP: to %ld", (long)*addr);
6725 dbg_exec("BC_INST_CALL:");
6726 s = zbc_program_call(code, &ip->idx);
6728 case BC_INST_INC_PRE:
6729 case BC_INST_DEC_PRE:
6730 case BC_INST_INC_POST:
6731 case BC_INST_DEC_POST:
6732 dbg_exec("BC_INST_INCDEC:");
6733 s = zbc_program_incdec(inst);
6736 dbg_exec("BC_INST_HALT:");
6737 QUIT_OR_RETURN_TO_MAIN;
6741 dbg_exec("BC_INST_RET[0]:");
6742 s = zbc_program_return(inst);
6744 case BC_INST_BOOL_OR:
6745 case BC_INST_BOOL_AND:
6747 case BC_INST_REL_EQ:
6748 case BC_INST_REL_LE:
6749 case BC_INST_REL_GE:
6750 case BC_INST_REL_NE:
6751 case BC_INST_REL_LT:
6752 case BC_INST_REL_GT:
6753 dbg_exec("BC_INST_BOOL:");
6754 s = zbc_program_logical(inst);
6757 dbg_exec("BC_INST_READ:");
6758 s = zbc_program_read();
6761 dbg_exec("BC_INST_VAR:");
6762 s = zbc_program_pushVar(code, &ip->idx, false, false);
6764 case BC_INST_ARRAY_ELEM:
6766 dbg_exec("BC_INST_ARRAY[_ELEM]:");
6767 s = zbc_program_pushArray(code, &ip->idx, inst);
6770 r.t = BC_RESULT_LAST;
6771 bc_vec_push(&G.prog.results, &r);
6776 bc_program_pushGlobal(inst);
6778 case BC_INST_SCALE_FUNC:
6779 case BC_INST_LENGTH:
6781 dbg_exec("BC_INST_builtin:");
6782 s = zbc_program_builtin(inst);
6785 dbg_exec("BC_INST_NUM:");
6786 r.t = BC_RESULT_CONSTANT;
6787 r.d.id.idx = bc_program_index(code, &ip->idx);
6788 bc_vec_push(&G.prog.results, &r);
6791 dbg_exec("BC_INST_POP:");
6792 if (!BC_PROG_STACK(&G.prog.results, 1))
6793 s = bc_error_stack_has_too_few_elements();
6795 bc_vec_pop(&G.prog.results);
6797 case BC_INST_POP_EXEC:
6798 dbg_exec("BC_INST_POP_EXEC:");
6799 bc_vec_pop(&G.prog.stack);
6802 case BC_INST_PRINT_POP:
6803 case BC_INST_PRINT_STR:
6804 dbg_exec("BC_INST_PRINTxyz:");
6805 s = zbc_program_print(inst, 0);
6808 dbg_exec("BC_INST_STR:");
6809 r.t = BC_RESULT_STR;
6810 r.d.id.idx = bc_program_index(code, &ip->idx);
6811 bc_vec_push(&G.prog.results, &r);
6814 case BC_INST_MULTIPLY:
6815 case BC_INST_DIVIDE:
6816 case BC_INST_MODULUS:
6819 dbg_exec("BC_INST_binaryop:");
6820 s = zbc_program_op(inst);
6822 case BC_INST_BOOL_NOT:
6823 dbg_exec("BC_INST_BOOL_NOT:");
6824 s = zbc_program_prep(&ptr, &num);
6825 if (s) RETURN_STATUS(s);
6826 bc_num_init_DEF_SIZE(&r.d.n);
6827 if (!bc_num_cmp(num, &G.prog.zero))
6829 //else bc_num_zero(&r.d.n); - already is
6830 bc_program_retire(&r, BC_RESULT_TEMP);
6833 dbg_exec("BC_INST_NEG:");
6834 s = zbc_program_negate();
6837 case BC_INST_ASSIGN_POWER:
6838 case BC_INST_ASSIGN_MULTIPLY:
6839 case BC_INST_ASSIGN_DIVIDE:
6840 case BC_INST_ASSIGN_MODULUS:
6841 case BC_INST_ASSIGN_PLUS:
6842 case BC_INST_ASSIGN_MINUS:
6844 case BC_INST_ASSIGN:
6845 dbg_exec("BC_INST_ASSIGNxyz:");
6846 s = zbc_program_assign(inst);
6849 case BC_INST_MODEXP:
6850 s = zbc_program_modexp();
6852 case BC_INST_DIVMOD:
6853 s = zbc_program_divmod();
6855 case BC_INST_EXECUTE:
6856 case BC_INST_EXEC_COND:
6857 s = zbc_program_execStr(code, &ip->idx, inst == BC_INST_EXEC_COND);
6859 case BC_INST_PRINT_STACK: {
6861 for (idx = 0; idx < G.prog.results.len; ++idx) {
6862 s = zbc_program_print(BC_INST_PRINT, idx);
6867 case BC_INST_CLEAR_STACK:
6868 bc_vec_pop_all(&G.prog.results);
6870 case BC_INST_STACK_LEN:
6871 bc_program_stackLen();
6873 case BC_INST_DUPLICATE:
6874 if (!BC_PROG_STACK(&G.prog.results, 1))
6875 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6876 ptr = bc_vec_top(&G.prog.results);
6877 bc_result_copy(&r, ptr);
6878 bc_vec_push(&G.prog.results, &r);
6880 case BC_INST_SWAP: {
6882 if (!BC_PROG_STACK(&G.prog.results, 2))
6883 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6884 ptr = bc_vec_item_rev(&G.prog.results, 0);
6885 ptr2 = bc_vec_item_rev(&G.prog.results, 1);
6886 memcpy(&r, ptr, sizeof(BcResult));
6887 memcpy(ptr, ptr2, sizeof(BcResult));
6888 memcpy(ptr2, &r, sizeof(BcResult));
6891 case BC_INST_ASCIIFY:
6892 s = zbc_program_asciify();
6894 case BC_INST_PRINT_STREAM:
6895 s = zbc_program_printStream();
6898 case BC_INST_PUSH_VAR: {
6899 bool copy = inst == BC_INST_LOAD;
6900 s = zbc_program_pushVar(code, &ip->idx, true, copy);
6903 case BC_INST_PUSH_TO_VAR: {
6904 char *name = bc_program_name(code, &ip->idx);
6905 s = zbc_program_copyToVar(name, true);
6910 dbg_exec("BC_INST_NEG:");
6911 if (G.prog.stack.len <= 2)
6912 QUIT_OR_RETURN_TO_MAIN;
6913 bc_vec_npop(&G.prog.stack, 2);
6916 s = zbc_program_nquit();
6921 if (s || G_interrupt) {
6926 // If the stack has changed, pointers may be invalid.
6927 ip = bc_vec_top(&G.prog.stack);
6928 func = bc_program_func(ip->func);
6929 code = func->code.v;
6932 RETURN_STATUS(BC_STATUS_SUCCESS);
6934 #if ERRORS_ARE_FATAL
6935 # define zbc_program_exec(...) (zbc_program_exec(__VA_ARGS__), BC_STATUS_SUCCESS)
6938 static unsigned bc_vm_envLen(const char *var)
6944 len = BC_NUM_PRINT_WIDTH;
6945 if (!lenv) return len;
6947 len = bb_strtou(lenv, NULL, 10) - 1;
6948 if (errno || len < 2 || len >= INT_MAX)
6949 len = BC_NUM_PRINT_WIDTH;
6954 static BC_STATUS zbc_vm_process(const char *text)
6958 dbg_lex_enter("%s:%d entered", __func__, __LINE__);
6959 s = zbc_parse_text_init(&G.prs, text);
6960 if (s) RETURN_STATUS(s);
6962 while (G.prs.l.t.t != BC_LEX_EOF) {
6963 dbg_lex("%s:%d G.prs.l.t.t:%d", __func__, __LINE__, G.prs.l.t.t);
6964 ERROR_RETURN(s =) zcommon_parse(&G.prs);
6965 if (s) RETURN_STATUS(s);
6966 s = zbc_program_exec();
6974 dbg_lex_done("%s:%d done", __func__, __LINE__);
6977 #if ERRORS_ARE_FATAL
6978 # define zbc_vm_process(...) (zbc_vm_process(__VA_ARGS__), BC_STATUS_SUCCESS)
6981 static BC_STATUS zbc_vm_file(const char *file)
6983 // So far bc/dc have no way to include a file from another file,
6984 // therefore we know G.prog.file == NULL on entry
6985 //const char *sv_file;
6991 data = bc_read_file(file);
6992 if (!data) RETURN_STATUS(bc_error_fmt("file '%s' is not text", file));
6994 //sv_file = G.prog.file;
6996 bc_lex_file(&G.prs.l);
6997 s = zbc_vm_process(data);
7000 main_func = bc_program_func(BC_PROG_MAIN);
7001 ip = bc_vec_item(&G.prog.stack, 0);
7003 if (main_func->code.len < ip->idx)
7004 s = bc_error_fmt("file '%s' is not executable", file);
7007 //G.prog.file = sv_file;
7012 #if ERRORS_ARE_FATAL
7013 # define zbc_vm_file(...) (zbc_vm_file(__VA_ARGS__), BC_STATUS_SUCCESS)
7016 static BC_STATUS zbc_vm_stdin(void)
7020 //G.prog.file = NULL; - already is
7021 bc_lex_file(&G.prs.l);
7024 s = zbc_vm_process("");
7027 #if ERRORS_ARE_FATAL
7028 # define zbc_vm_stdin(...) (zbc_vm_stdin(__VA_ARGS__), BC_STATUS_SUCCESS)
7032 static void bc_vm_info(void)
7034 printf("%s "BB_VER"\n"
7035 "Copyright (c) 2018 Gavin D. Howard and contributors\n"
7039 static void bc_args(char **argv)
7045 #if ENABLE_FEATURE_BC_LONG_OPTIONS
7046 opts = option_mask32 |= getopt32long(argv, "wvsqli",
7047 "warn\0" No_argument "w"
7048 "version\0" No_argument "v"
7049 "standard\0" No_argument "s"
7050 "quiet\0" No_argument "q"
7051 "mathlib\0" No_argument "l"
7052 "interactive\0" No_argument "i"
7055 opts = option_mask32 |= getopt32(argv, "wvsqli");
7057 if (getenv("POSIXLY_CORRECT"))
7058 option_mask32 |= BC_FLAG_S;
7060 if (opts & BC_FLAG_V) {
7065 for (i = optind; argv[i]; ++i)
7066 bc_vec_push(&G.files, argv + i);
7069 static void bc_vm_envArgs(void)
7073 char *env_args = getenv("BC_ENV_ARGS");
7075 if (!env_args) return;
7077 G.env_args = xstrdup(env_args);
7080 bc_vec_init(&v, sizeof(char *), NULL);
7082 while (*(buf = skip_whitespace(buf)) != '\0') {
7083 bc_vec_push(&v, &buf);
7084 buf = skip_non_whitespace(buf);
7090 // NULL terminate, and pass argv[] so that first arg is argv[1]
7091 if (sizeof(int) == sizeof(char*)) {
7092 bc_vec_push(&v, &const_int_0);
7094 static char *const nullptr = NULL;
7095 bc_vec_push(&v, &nullptr);
7097 bc_args(((char **)v.v) - 1);
7102 static const char bc_lib[] ALIGN1 = {
7105 "\n" "auto b,s,n,r,d,i,p,f,v"
7106 ////////////////"if(x<0)return(1/e(-x))" // and drop 'n' and x<0 logic below
7107 //^^^^^^^^^^^^^^^^ this would work, and is even more precise than GNU bc:
7108 //e(-.998896): GNU:.36828580434569428695
7109 // above code:.36828580434569428696
7110 // actual value:.3682858043456942869594...
7111 // but for now let's be "GNU compatible"
7120 "\n" "scale=scale(x)+1"
7130 "\n" "for(i=2;v;++i){"
7136 "\n" "while(d--)r*=r"
7139 "\n" "if(n)return(1/r)"
7143 "\n" "auto b,s,r,p,a,q,i,v"
7147 "\n" "r=(1-10^scale)/1"
7158 "\n" "while(x<=0.5){"
7162 "\n" "r=a=(x-1)/(x+1)"
7165 "\n" "for(i=3;v;i+=2){"
7176 "\n" "auto b,s,r,a,q,i"
7177 "\n" "if(x<0)return(-s(-x))"
7181 "\n" "scale=1.1*s+2"
7190 "\n" "for(i=3;a;i+=2){"
7191 "\n" "a*=q/(i*(i-1))"
7204 "\n" "x=s(2*a(1)+x)"
7210 "\n" "auto b,s,r,n,a,m,t,f,i,u"
7218 "\n" "if(scale<65){"
7219 "\n" "if(x==1)return(.7853981633974483096156608458198757210492923498437764552437361480/n)"
7220 "\n" "if(x==.2)return(.1973955598498807583700497651947902934475851037878521015176889402/n)"
7230 "\n" "x=(x-.2)/(1+.2*x)"
7235 "\n" "for(i=3;t;i+=2){"
7242 "\n" "return((m*a+r)/n)"
7244 "\n" "define j(n,x){"
7245 "\n" "auto b,s,o,a,i,v,f"
7256 "\n" "for(i=2;i<=n;++i)a*=i"
7258 "\n" "a=(x^n)/2^n/a"
7261 "\n" "scale+=length(a)-scale(a)"
7262 "\n" "for(i=1;v;++i){"
7263 "\n" "v=v*f/i/(n+i)"
7269 "\n" "return(a*r/1)"
7274 static BC_STATUS zbc_vm_exec(void)
7280 if (option_mask32 & BC_FLAG_L) {
7281 // We know that internal library is not buggy,
7282 // thus error checking is normally disabled.
7283 # define DEBUG_LIB 0
7284 bc_lex_file(&G.prs.l);
7285 s = zbc_vm_process(bc_lib);
7286 if (DEBUG_LIB && s) RETURN_STATUS(s);
7290 s = BC_STATUS_SUCCESS;
7291 for (i = 0; !s && i < G.files.len; ++i)
7292 s = zbc_vm_file(*((char **) bc_vec_item(&G.files, i)));
7293 if (ENABLE_FEATURE_CLEAN_UP && s && !G_ttyin) {
7294 // Debug config, non-interactive mode:
7295 // return all the way back to main.
7296 // Non-debug builds do not come here, they exit.
7300 if (IS_BC || (option_mask32 & BC_FLAG_I))
7305 #if ERRORS_ARE_FATAL
7306 # define zbc_vm_exec(...) (zbc_vm_exec(__VA_ARGS__), BC_STATUS_SUCCESS)
7309 #if ENABLE_FEATURE_CLEAN_UP
7310 static void bc_program_free(void)
7312 bc_num_free(&G.prog.ib);
7313 bc_num_free(&G.prog.ob);
7314 bc_num_free(&G.prog.hexb);
7316 bc_num_free(&G.prog.strmb);
7318 bc_vec_free(&G.prog.fns);
7319 bc_vec_free(&G.prog.fn_map);
7320 bc_vec_free(&G.prog.vars);
7321 bc_vec_free(&G.prog.var_map);
7322 bc_vec_free(&G.prog.arrs);
7323 bc_vec_free(&G.prog.arr_map);
7324 bc_vec_free(&G.prog.strs);
7325 bc_vec_free(&G.prog.consts);
7326 bc_vec_free(&G.prog.results);
7327 bc_vec_free(&G.prog.stack);
7328 bc_num_free(&G.prog.last);
7329 bc_num_free(&G.prog.zero);
7330 bc_num_free(&G.prog.one);
7331 bc_vec_free(&G.stdin_buffer);
7334 static void bc_vm_free(void)
7336 bc_vec_free(&G.files);
7338 bc_parse_free(&G.prs);
7343 static void bc_program_init(void)
7348 // memset(&G.prog, 0, sizeof(G.prog)); - already is
7349 memset(&ip, 0, sizeof(BcInstPtr));
7351 // G.prog.nchars = G.prog.scale = 0; - already is
7352 bc_num_init_DEF_SIZE(&G.prog.ib);
7353 bc_num_ten(&G.prog.ib);
7356 bc_num_init_DEF_SIZE(&G.prog.ob);
7357 bc_num_ten(&G.prog.ob);
7360 bc_num_init_DEF_SIZE(&G.prog.hexb);
7361 bc_num_ten(&G.prog.hexb);
7362 G.prog.hexb.num[0] = 6;
7365 bc_num_init_DEF_SIZE(&G.prog.strmb);
7366 bc_num_ulong2num(&G.prog.strmb, UCHAR_MAX + 1);
7369 bc_num_init_DEF_SIZE(&G.prog.last);
7370 //bc_num_zero(&G.prog.last); - already is
7372 bc_num_init_DEF_SIZE(&G.prog.zero);
7373 //bc_num_zero(&G.prog.zero); - already is
7375 bc_num_init_DEF_SIZE(&G.prog.one);
7376 bc_num_one(&G.prog.one);
7378 bc_vec_init(&G.prog.fns, sizeof(BcFunc), bc_func_free);
7379 bc_vec_init(&G.prog.fn_map, sizeof(BcId), bc_id_free);
7381 bc_program_addFunc(xstrdup("(main)"), &idx);
7382 bc_program_addFunc(xstrdup("(read)"), &idx);
7384 bc_vec_init(&G.prog.vars, sizeof(BcVec), bc_vec_free);
7385 bc_vec_init(&G.prog.var_map, sizeof(BcId), bc_id_free);
7387 bc_vec_init(&G.prog.arrs, sizeof(BcVec), bc_vec_free);
7388 bc_vec_init(&G.prog.arr_map, sizeof(BcId), bc_id_free);
7390 bc_vec_init(&G.prog.strs, sizeof(char *), bc_string_free);
7391 bc_vec_init(&G.prog.consts, sizeof(char *), bc_string_free);
7392 bc_vec_init(&G.prog.results, sizeof(BcResult), bc_result_free);
7393 bc_vec_init(&G.prog.stack, sizeof(BcInstPtr), NULL);
7394 bc_vec_push(&G.prog.stack, &ip);
7396 bc_char_vec_init(&G.stdin_buffer);
7399 static int bc_vm_init(const char *env_len)
7401 #if ENABLE_FEATURE_EDITING
7402 G.line_input_state = new_line_input_t(DO_HISTORY);
7404 G.prog.len = bc_vm_envLen(env_len);
7406 bc_vec_init(&G.files, sizeof(char *), NULL);
7407 IF_BC(if (IS_BC) bc_vm_envArgs();)
7409 bc_parse_create(&G.prs, BC_PROG_MAIN);
7411 //TODO: in GNU bc, the check is (isatty(0) && isatty(1)),
7412 //-i option unconditionally enables this regardless of isatty():
7414 #if ENABLE_FEATURE_BC_SIGNALS
7416 // With SA_RESTART, most system calls will restart
7417 // (IOW: they won't fail with EINTR).
7418 // In particular, this means ^C won't cause
7419 // stdout to get into "error state" if SIGINT hits
7420 // within write() syscall.
7422 // The downside is that ^C while tty input is taken
7423 // will only be handled after [Enter] since read()
7424 // from stdin is not interrupted by ^C either,
7425 // it restarts, thus fgetc() does not return on ^C.
7426 // (This problem manifests only if line editing is disabled)
7427 signal_SA_RESTART_empty_mask(SIGINT, record_signo);
7429 // Without SA_RESTART, this exhibits a bug:
7430 // "while (1) print 1" and try ^C-ing it.
7431 // Intermittently, instead of returning to input line,
7432 // you'll get "output error: Interrupted system call"
7434 //signal_no_SA_RESTART_empty_mask(SIGINT, record_signo);
7438 return 0; // "not a tty"
7441 static BcStatus bc_vm_run(void)
7443 BcStatus st = zbc_vm_exec();
7444 #if ENABLE_FEATURE_CLEAN_UP
7445 if (G_exiting) // it was actually "halt" or "quit"
7448 # if ENABLE_FEATURE_EDITING
7449 free_line_input_t(G.line_input_state);
7453 dbg_exec("exiting with exitcode %d", st);
7458 int bc_main(int argc, char **argv) MAIN_EXTERNALLY_VISIBLE;
7459 int bc_main(int argc UNUSED_PARAM, char **argv)
7465 is_tty = bc_vm_init("BC_LINE_LENGTH");
7469 if (is_tty && !(option_mask32 & BC_FLAG_Q))
7477 int dc_main(int argc, char **argv) MAIN_EXTERNALLY_VISIBLE;
7478 int dc_main(int argc UNUSED_PARAM, char **argv)
7484 // TODO: dc (GNU bc 1.07.1) 1.4.1 seems to use width
7485 // 1 char wider than bc from the same package.
7486 // Both default width, and xC_LINE_LENGTH=N are wider:
7487 // "DC_LINE_LENGTH=5 dc -e'123456 p'" prints:
7490 // "echo '123456' | BC_LINE_LENGTH=5 bc" prints:
7493 // Do the same, or it's a bug?
7494 bc_vm_init("DC_LINE_LENGTH");
7496 // Run -e'SCRIPT' and -fFILE in order of appearance, then handle FILEs
7497 noscript = BC_FLAG_I;
7499 int n = getopt(argc, argv, "e:f:x");
7505 n = zbc_vm_process(optarg);
7510 n = zbc_vm_file(optarg);
7514 option_mask32 |= DC_FLAG_X;
7524 bc_vec_push(&G.files, argv++);
7527 option_mask32 |= noscript; // set BC_FLAG_I if we need to interpret stdin
7533 #endif // not DC_SMALL