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,
438 BC_LEX_LBRACE, // '{' is 0x7B, '}' is 0x7D,
440 BC_LEX_RBRACE, // should be LBRACE+2: code uses (c - '{' + BC_LEX_LBRACE)
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 {
595 typedef struct BcProgram {
636 #define BC_PROG_STACK(s, n) ((s)->len >= ((size_t) n))
638 #define BC_PROG_MAIN (0)
639 #define BC_PROG_READ (1)
641 #define BC_PROG_REQ_FUNCS (2)
644 #define BC_PROG_STR(n) (!(n)->num && !(n)->cap)
645 #define BC_PROG_NUM(r, n) \
646 ((r)->t != BC_RESULT_ARRAY && (r)->t != BC_RESULT_STR && !BC_PROG_STR(n))
648 #define BC_FLAG_W (1 << 0)
649 #define BC_FLAG_V (1 << 1)
650 #define BC_FLAG_S (1 << 2)
651 #define BC_FLAG_Q (1 << 3)
652 #define BC_FLAG_L (1 << 4)
653 #define BC_FLAG_I (1 << 5)
654 #define DC_FLAG_X (1 << 6)
656 #define BC_MAX(a, b) ((a) > (b) ? (a) : (b))
657 #define BC_MIN(a, b) ((a) < (b) ? (a) : (b))
659 #define BC_MAX_OBASE ((unsigned) 999)
660 #define BC_MAX_DIM ((unsigned) INT_MAX)
661 #define BC_MAX_SCALE ((unsigned) UINT_MAX)
662 #define BC_MAX_STRING ((unsigned) UINT_MAX - 1)
663 #define BC_MAX_NUM BC_MAX_STRING
664 // Unused apart from "limits" message. Just show a "biggish number" there.
665 //#define BC_MAX_NAME BC_MAX_STRING
666 //#define BC_MAX_EXP ((unsigned long) LONG_MAX)
667 //#define BC_MAX_VARS ((unsigned long) SIZE_MAX - 1)
668 #define BC_MAX_NAME_STR "999999999"
669 #define BC_MAX_EXP_STR "999999999"
670 #define BC_MAX_VARS_STR "999999999"
672 #define BC_MAX_OBASE_STR "999"
674 #if INT_MAX == 2147483647
675 # define BC_MAX_DIM_STR "2147483647"
676 #elif INT_MAX == 9223372036854775807
677 # define BC_MAX_DIM_STR "9223372036854775807"
679 # error Strange INT_MAX
682 #if UINT_MAX == 4294967295
683 # define BC_MAX_SCALE_STR "4294967295"
684 # define BC_MAX_STRING_STR "4294967294"
685 #elif UINT_MAX == 18446744073709551615
686 # define BC_MAX_SCALE_STR "18446744073709551615"
687 # define BC_MAX_STRING_STR "18446744073709551614"
689 # error Strange UINT_MAX
691 #define BC_MAX_NUM_STR BC_MAX_STRING_STR
694 IF_FEATURE_BC_SIGNALS(smallint ttyin;)
695 IF_FEATURE_CLEAN_UP(smallint exiting;)
702 // For error messages. Can be set to current parsed line,
703 // or [TODO] to current executing line (can be before last parsed one)
711 #if ENABLE_FEATURE_EDITING
712 line_input_t *line_input_state;
715 #define G (*ptr_to_globals)
716 #define INIT_G() do { \
717 SET_PTR_TO_GLOBALS(xzalloc(sizeof(G))); \
719 #define FREE_G() do { \
720 FREE_PTR_TO_GLOBALS(); \
722 #define G_posix (ENABLE_BC && (option_mask32 & BC_FLAG_S))
723 #define G_warn (ENABLE_BC && (option_mask32 & BC_FLAG_W))
724 #define G_exreg (ENABLE_DC && (option_mask32 & DC_FLAG_X))
725 #if ENABLE_FEATURE_BC_SIGNALS
726 # define G_interrupt bb_got_signal
727 # define G_ttyin G.ttyin
729 # define G_interrupt 0
732 #if ENABLE_FEATURE_CLEAN_UP
733 # define G_exiting G.exiting
737 #define IS_BC (ENABLE_BC && (!ENABLE_DC || applet_name[0] == 'b'))
738 #define IS_DC (ENABLE_DC && (!ENABLE_BC || applet_name[0] != 'b'))
742 // This is a bit array that corresponds to token types. An entry is
743 // true if the token is valid in an expression, false otherwise.
745 BC_PARSE_EXPRS_BITS = 0
746 + ((uint64_t)((0 << 0)+(0 << 1)+(1 << 2)+(1 << 3)+(1 << 4)+(1 << 5)+(1 << 6)+(1 << 7)) << (0*8))
747 + ((uint64_t)((1 << 0)+(1 << 1)+(1 << 2)+(1 << 3)+(1 << 4)+(1 << 5)+(1 << 6)+(1 << 7)) << (1*8))
748 + ((uint64_t)((1 << 0)+(1 << 1)+(1 << 2)+(1 << 3)+(1 << 4)+(1 << 5)+(1 << 6)+(1 << 7)) << (2*8))
749 + ((uint64_t)((1 << 0)+(1 << 1)+(1 << 2)+(0 << 3)+(0 << 4)+(1 << 5)+(1 << 6)+(0 << 7)) << (3*8))
750 + ((uint64_t)((0 << 0)+(0 << 1)+(0 << 2)+(0 << 3)+(0 << 4)+(0 << 5)+(1 << 6)+(1 << 7)) << (4*8))
751 + ((uint64_t)((0 << 0)+(0 << 1)+(0 << 2)+(0 << 3)+(0 << 4)+(0 << 5)+(0 << 6)+(1 << 7)) << (5*8))
752 + ((uint64_t)((0 << 0)+(1 << 1)+(1 << 2)+(1 << 3)+(1 << 4)+(0 << 5)+(0 << 6)+(1 << 7)) << (6*8))
753 + ((uint64_t)((0 << 0)+(1 << 1)+(1 << 2)+(0 << 3) ) << (7*8))
755 static ALWAYS_INLINE long bc_parse_exprs(unsigned i)
757 #if ULONG_MAX > 0xffffffff
758 // 64-bit version (will not work correctly for 32-bit longs!)
759 return BC_PARSE_EXPRS_BITS & (1UL << i);
762 unsigned long m = (uint32_t)BC_PARSE_EXPRS_BITS;
764 m = (uint32_t)(BC_PARSE_EXPRS_BITS >> 32);
767 return m & (1UL << i);
771 // This is an array of data for operators that correspond to token types.
772 static const uint8_t bc_parse_ops[] = {
773 #define OP(p,l) ((int)(l) * 0x10 + (p))
774 OP(0, false), OP( 0, false ), // inc dec
777 OP(3, true ), OP( 3, true ), OP( 3, true ), // pow mul div
778 OP(4, true ), OP( 4, true ), // mod + -
779 OP(6, true ), OP( 6, true ), OP( 6, true ), OP( 6, true ), OP( 6, true ), OP( 6, true ), // == <= >= != < >
781 OP(7, true ), OP( 7, true ), // or and
782 OP(5, false), OP( 5, false ), OP( 5, false ), OP( 5, false ), OP( 5, false ), // ^= *= /= %= +=
783 OP(5, false), OP( 5, false ), // -= =
786 #define bc_parse_op_PREC(i) (bc_parse_ops[i] & 0x0f)
787 #define bc_parse_op_LEFT(i) (bc_parse_ops[i] & 0x10)
789 // Byte array of up to 4 BC_LEX's, packed into 32-bit word
790 typedef uint32_t BcParseNext;
792 // These identify what tokens can come after expressions in certain cases.
794 #define BC_PARSE_NEXT4(a,b,c,d) ( (a) | ((b)<<8) | ((c)<<16) | ((((d)|0x80)<<24)) )
795 #define BC_PARSE_NEXT2(a,b) BC_PARSE_NEXT4(a,b,0xff,0xff)
796 #define BC_PARSE_NEXT1(a) BC_PARSE_NEXT4(a,0xff,0xff,0xff)
797 bc_parse_next_expr = BC_PARSE_NEXT4(BC_LEX_NLINE, BC_LEX_SCOLON, BC_LEX_RBRACE, BC_LEX_EOF),
798 bc_parse_next_param = BC_PARSE_NEXT2(BC_LEX_RPAREN, BC_LEX_COMMA),
799 bc_parse_next_print = BC_PARSE_NEXT4(BC_LEX_COMMA, BC_LEX_NLINE, BC_LEX_SCOLON, BC_LEX_EOF),
800 bc_parse_next_rel = BC_PARSE_NEXT1(BC_LEX_RPAREN),
801 bc_parse_next_elem = BC_PARSE_NEXT1(BC_LEX_RBRACKET),
802 bc_parse_next_for = BC_PARSE_NEXT1(BC_LEX_SCOLON),
803 bc_parse_next_read = BC_PARSE_NEXT2(BC_LEX_NLINE, BC_LEX_EOF),
804 #undef BC_PARSE_NEXT4
805 #undef BC_PARSE_NEXT2
806 #undef BC_PARSE_NEXT1
811 static const //BcLexType - should be this type, but narrower type saves size:
814 BC_LEX_OP_REL_EQ, BC_LEX_OP_REL_LE, BC_LEX_OP_REL_GE, BC_LEX_OP_REL_NE,
815 BC_LEX_OP_REL_LT, BC_LEX_OP_REL_GT, BC_LEX_SCOLON, BC_LEX_COLON,
816 BC_LEX_ELSE, BC_LEX_LOAD, BC_LEX_LOAD_POP, BC_LEX_OP_ASSIGN,
820 static const //BcLexType - should be this type
823 BC_LEX_OP_MODULUS, BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_LPAREN,
824 BC_LEX_INVALID, BC_LEX_OP_MULTIPLY, BC_LEX_OP_PLUS, BC_LEX_INVALID,
825 BC_LEX_OP_MINUS, BC_LEX_INVALID, BC_LEX_OP_DIVIDE,
826 BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID,
827 BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID,
828 BC_LEX_INVALID, BC_LEX_INVALID,
829 BC_LEX_COLON, BC_LEX_SCOLON, BC_LEX_OP_REL_GT, BC_LEX_OP_REL_EQ,
830 BC_LEX_OP_REL_LT, BC_LEX_KEY_READ, BC_LEX_INVALID,
831 BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID,
832 BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_EQ_NO_REG, BC_LEX_INVALID,
833 BC_LEX_KEY_IBASE, BC_LEX_INVALID, BC_LEX_KEY_SCALE, BC_LEX_LOAD_POP,
834 BC_LEX_INVALID, BC_LEX_OP_BOOL_NOT, BC_LEX_KEY_OBASE, BC_LEX_PRINT_STREAM,
835 BC_LEX_NQUIT, BC_LEX_POP, BC_LEX_STORE_PUSH, BC_LEX_INVALID, BC_LEX_INVALID,
836 BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_SCALE_FACTOR, BC_LEX_INVALID,
837 BC_LEX_KEY_LENGTH, BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID,
838 BC_LEX_OP_POWER, BC_LEX_NEG, BC_LEX_INVALID,
839 BC_LEX_ASCIIFY, BC_LEX_INVALID, BC_LEX_CLEAR_STACK, BC_LEX_DUPLICATE,
840 BC_LEX_ELSE, BC_LEX_PRINT_STACK, BC_LEX_INVALID, BC_LEX_INVALID,
841 BC_LEX_STORE_IBASE, BC_LEX_INVALID, BC_LEX_STORE_SCALE, BC_LEX_LOAD,
842 BC_LEX_INVALID, BC_LEX_PRINT_POP, BC_LEX_STORE_OBASE, BC_LEX_KEY_PRINT,
843 BC_LEX_KEY_QUIT, BC_LEX_SWAP, BC_LEX_OP_ASSIGN, BC_LEX_INVALID,
844 BC_LEX_INVALID, BC_LEX_KEY_SQRT, BC_LEX_INVALID, BC_LEX_EXECUTE,
845 BC_LEX_INVALID, BC_LEX_STACK_LEVEL,
846 BC_LEX_LBRACE, BC_LEX_OP_MODEXP, BC_LEX_INVALID, BC_LEX_OP_DIVMOD,
850 static const //BcInst - should be this type. Using signed narrow type since BC_INST_INVALID is -1
853 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID, BC_INST_REL_GE,
854 BC_INST_INVALID, BC_INST_POWER, BC_INST_MULTIPLY, BC_INST_DIVIDE,
855 BC_INST_MODULUS, BC_INST_PLUS, BC_INST_MINUS,
856 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID,
857 BC_INST_INVALID, BC_INST_INVALID,
858 BC_INST_BOOL_NOT, BC_INST_INVALID, BC_INST_INVALID,
859 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID,
860 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID,
861 BC_INST_INVALID, BC_INST_INVALID, BC_INST_REL_GT, BC_INST_INVALID,
862 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID, BC_INST_REL_GE,
863 BC_INST_INVALID, BC_INST_INVALID,
864 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID,
865 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID,
866 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID, BC_INST_IBASE,
867 BC_INST_INVALID, BC_INST_INVALID, BC_INST_LENGTH, BC_INST_INVALID,
868 BC_INST_OBASE, BC_INST_PRINT, BC_INST_QUIT, BC_INST_INVALID,
869 BC_INST_INVALID, BC_INST_SCALE, BC_INST_SQRT, BC_INST_INVALID,
870 BC_INST_REL_EQ, BC_INST_MODEXP, BC_INST_DIVMOD, BC_INST_INVALID,
871 BC_INST_INVALID, BC_INST_EXECUTE, BC_INST_PRINT_STACK, BC_INST_CLEAR_STACK,
872 BC_INST_STACK_LEN, BC_INST_DUPLICATE, BC_INST_SWAP, BC_INST_POP,
873 BC_INST_ASCIIFY, BC_INST_PRINT_STREAM, BC_INST_INVALID, BC_INST_INVALID,
874 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID,
875 BC_INST_PRINT, BC_INST_NQUIT, BC_INST_SCALE_FUNC,
879 // In configurations where errors abort instead of propagating error
880 // return code up the call chain, functions returning BC_STATUS
881 // actually don't return anything, they always succeed and return "void".
882 // A macro wrapper is provided, which makes this statement work:
884 // and makes it visible to the compiler that s is always zero,
885 // allowing compiler to optimize dead code after the statement.
887 // To make code more readable, each such function has a "z"
888 // ("always returning zero") prefix, i.e. zbc_foo or zdc_foo.
890 #if ENABLE_FEATURE_BC_SIGNALS || ENABLE_FEATURE_CLEAN_UP
891 # define ERRORS_ARE_FATAL 0
892 # define ERRORFUNC /*nothing*/
893 # define ERROR_RETURN(a) a
894 //moved up: # define BC_STATUS BcStatus
895 # define RETURN_STATUS(v) return (v)
897 # define ERRORS_ARE_FATAL 1
898 # define ERRORFUNC NORETURN
899 # define ERROR_RETURN(a) /*nothing*/
900 //moved up: # define BC_STATUS void
901 # define RETURN_STATUS(v) do { ((void)(v)); return; } while (0)
904 #define BC_NUM_NEG(n, neg) ((((ssize_t)(n)) ^ -((ssize_t)(neg))) + (neg))
905 #define BC_NUM_ONE(n) ((n)->len == 1 && (n)->rdx == 0 && (n)->num[0] == 1)
906 #define BC_NUM_INT(n) ((n)->len - (n)->rdx)
907 //#define BC_NUM_AREQ(a, b) (BC_MAX((a)->rdx, (b)->rdx) + BC_MAX(BC_NUM_INT(a), BC_NUM_INT(b)) + 1)
908 static /*ALWAYS_INLINE*/ size_t BC_NUM_AREQ(BcNum *a, BcNum *b)
910 return BC_MAX(a->rdx, b->rdx) + BC_MAX(BC_NUM_INT(a), BC_NUM_INT(b)) + 1;
912 //#define BC_NUM_MREQ(a, b, scale) (BC_NUM_INT(a) + BC_NUM_INT(b) + BC_MAX((scale), (a)->rdx + (b)->rdx) + 1)
913 static /*ALWAYS_INLINE*/ size_t BC_NUM_MREQ(BcNum *a, BcNum *b, size_t scale)
915 return BC_NUM_INT(a) + BC_NUM_INT(b) + BC_MAX(scale, a->rdx + b->rdx) + 1;
918 typedef void (*BcNumDigitOp)(size_t, size_t, bool) FAST_FUNC;
920 typedef BC_STATUS (*BcNumBinaryOp)(BcNum *, BcNum *, BcNum *, size_t) FAST_FUNC;
922 static BC_STATUS zbc_num_binary(BcNum *a, BcNum *b, BcNum *c, size_t scale,
923 BcNumBinaryOp op, size_t req);
924 static FAST_FUNC BC_STATUS zbc_num_a(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale);
925 static FAST_FUNC BC_STATUS zbc_num_s(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale);
926 static FAST_FUNC BC_STATUS zbc_num_p(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale);
927 static FAST_FUNC BC_STATUS zbc_num_m(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale);
928 static FAST_FUNC BC_STATUS zbc_num_d(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale);
929 static FAST_FUNC BC_STATUS zbc_num_rem(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale);
931 static FAST_FUNC BC_STATUS zbc_num_add(BcNum *a, BcNum *b, BcNum *c, size_t scale)
933 BcNumBinaryOp op = (!a->neg == !b->neg) ? zbc_num_a : zbc_num_s;
935 RETURN_STATUS(zbc_num_binary(a, b, c, false, op, BC_NUM_AREQ(a, b)));
938 static FAST_FUNC BC_STATUS zbc_num_sub(BcNum *a, BcNum *b, BcNum *c, size_t scale)
940 BcNumBinaryOp op = (!a->neg == !b->neg) ? zbc_num_s : zbc_num_a;
942 RETURN_STATUS(zbc_num_binary(a, b, c, true, op, BC_NUM_AREQ(a, b)));
945 static FAST_FUNC BC_STATUS zbc_num_mul(BcNum *a, BcNum *b, BcNum *c, size_t scale)
947 size_t req = BC_NUM_MREQ(a, b, scale);
948 RETURN_STATUS(zbc_num_binary(a, b, c, scale, zbc_num_m, req));
951 static FAST_FUNC BC_STATUS zbc_num_div(BcNum *a, BcNum *b, BcNum *c, size_t scale)
953 size_t req = BC_NUM_MREQ(a, b, scale);
954 RETURN_STATUS(zbc_num_binary(a, b, c, scale, zbc_num_d, req));
957 static FAST_FUNC BC_STATUS zbc_num_mod(BcNum *a, BcNum *b, BcNum *c, size_t scale)
959 size_t req = BC_NUM_MREQ(a, b, scale);
960 RETURN_STATUS(zbc_num_binary(a, b, c, scale, zbc_num_rem, req));
963 static FAST_FUNC BC_STATUS zbc_num_pow(BcNum *a, BcNum *b, BcNum *c, size_t scale)
965 RETURN_STATUS(zbc_num_binary(a, b, c, scale, zbc_num_p, a->len * b->len + 1));
968 static const BcNumBinaryOp zbc_program_ops[] = {
969 zbc_num_pow, zbc_num_mul, zbc_num_div, zbc_num_mod, zbc_num_add, zbc_num_sub,
972 # define zbc_num_add(...) (zbc_num_add(__VA_ARGS__), BC_STATUS_SUCCESS)
973 # define zbc_num_sub(...) (zbc_num_sub(__VA_ARGS__), BC_STATUS_SUCCESS)
974 # define zbc_num_mul(...) (zbc_num_mul(__VA_ARGS__), BC_STATUS_SUCCESS)
975 # define zbc_num_div(...) (zbc_num_div(__VA_ARGS__), BC_STATUS_SUCCESS)
976 # define zbc_num_mod(...) (zbc_num_mod(__VA_ARGS__), BC_STATUS_SUCCESS)
977 # define zbc_num_pow(...) (zbc_num_pow(__VA_ARGS__), BC_STATUS_SUCCESS)
980 static void fflush_and_check(void)
983 if (ferror(stdout) || ferror(stderr))
984 bb_perror_msg_and_die("output error");
987 #if ENABLE_FEATURE_CLEAN_UP
988 #define QUIT_OR_RETURN_TO_MAIN \
990 IF_FEATURE_BC_SIGNALS(G_ttyin = 0;) /* do not loop in main loop anymore */ \
992 return BC_STATUS_FAILURE; \
995 #define QUIT_OR_RETURN_TO_MAIN quit()
998 static void quit(void) NORETURN;
999 static void quit(void)
1002 bb_perror_msg_and_die("input error");
1004 dbg_exec("quit(): exiting with exitcode SUCCESS");
1008 static void bc_verror_msg(const char *fmt, va_list p)
1010 const char *sv = sv; // for compiler
1013 applet_name = xasprintf("%s: %s:%u", applet_name, G.prog.file, G.err_line);
1015 bb_verror_msg(fmt, p, NULL);
1017 free((char*)applet_name);
1022 static NOINLINE ERRORFUNC int bc_error_fmt(const char *fmt, ...)
1027 bc_verror_msg(fmt, p);
1030 if (!ENABLE_FEATURE_CLEAN_UP && !G_ttyin)
1032 ERROR_RETURN(return BC_STATUS_FAILURE;)
1036 static NOINLINE int bc_posix_error_fmt(const char *fmt, ...)
1040 // Are non-POSIX constructs totally ok?
1041 if (!(option_mask32 & (BC_FLAG_S|BC_FLAG_W)))
1042 return BC_STATUS_SUCCESS; // yes
1045 bc_verror_msg(fmt, p);
1048 // Do we treat non-POSIX constructs as errors?
1049 if (!(option_mask32 & BC_FLAG_S))
1050 return BC_STATUS_SUCCESS; // no, it's a warning
1051 if (!ENABLE_FEATURE_CLEAN_UP && !G_ttyin)
1053 return BC_STATUS_FAILURE;
1057 // We use error functions with "return bc_error(FMT[, PARAMS])" idiom.
1058 // This idiom begs for tail-call optimization, but for it to work,
1059 // function must not have caller-cleaned parameters on stack.
1060 // Unfortunately, vararg function API does exactly that on most arches.
1061 // Thus, use these shims for the cases when we have no vararg PARAMS:
1062 static ERRORFUNC int bc_error(const char *msg)
1064 ERROR_RETURN(return) bc_error_fmt("%s", msg);
1066 static ERRORFUNC int bc_error_bad_character(char c)
1068 ERROR_RETURN(return) bc_error_fmt("bad character '%c'", c);
1070 static ERRORFUNC int bc_error_bad_expression(void)
1072 ERROR_RETURN(return) bc_error("bad expression");
1074 static ERRORFUNC int bc_error_bad_token(void)
1076 ERROR_RETURN(return) bc_error("bad token");
1078 static ERRORFUNC int bc_error_stack_has_too_few_elements(void)
1080 ERROR_RETURN(return) bc_error("stack has too few elements");
1082 static ERRORFUNC int bc_error_variable_is_wrong_type(void)
1084 ERROR_RETURN(return) bc_error("variable is wrong type");
1086 static ERRORFUNC int bc_error_nested_read_call(void)
1088 ERROR_RETURN(return) bc_error("read() call inside of a read() call");
1091 static int bc_POSIX_requires(const char *msg)
1093 return bc_posix_error_fmt("POSIX requires %s", msg);
1095 static int bc_POSIX_does_not_allow(const char *msg)
1097 return bc_posix_error_fmt("%s%s", "POSIX does not allow ", msg);
1099 static int bc_POSIX_does_not_allow_bool_ops_this_is_bad(const char *msg)
1101 return bc_posix_error_fmt("%s%s %s", "POSIX does not allow ", "boolean operators; the following is bad:", msg);
1103 static int bc_POSIX_does_not_allow_empty_X_expression_in_for(const char *msg)
1105 return bc_posix_error_fmt("%san empty %s expression in a for loop", "POSIX does not allow ", msg);
1109 static void bc_vec_grow(BcVec *v, size_t n)
1111 size_t cap = v->cap * 2;
1112 while (cap < v->len + n) cap *= 2;
1113 v->v = xrealloc(v->v, v->size * cap);
1117 static void bc_vec_init(BcVec *v, size_t esize, BcVecFree dtor)
1120 v->cap = BC_VEC_START_CAP;
1123 v->v = xmalloc(esize * BC_VEC_START_CAP);
1126 static void bc_char_vec_init(BcVec *v)
1128 bc_vec_init(v, sizeof(char), NULL);
1131 static void bc_vec_expand(BcVec *v, size_t req)
1134 v->v = xrealloc(v->v, v->size * req);
1139 static void bc_vec_pop(BcVec *v)
1143 v->dtor(v->v + (v->size * v->len));
1146 static void bc_vec_npop(BcVec *v, size_t n)
1151 size_t len = v->len - n;
1152 while (v->len > len) v->dtor(v->v + (v->size * --v->len));
1156 static void bc_vec_pop_all(BcVec *v)
1158 bc_vec_npop(v, v->len);
1161 static void bc_vec_push(BcVec *v, const void *data)
1163 if (v->len + 1 > v->cap) bc_vec_grow(v, 1);
1164 memmove(v->v + (v->size * v->len), data, v->size);
1168 static void bc_vec_pushByte(BcVec *v, char data)
1170 bc_vec_push(v, &data);
1173 static void bc_vec_pushZeroByte(BcVec *v)
1175 //bc_vec_pushByte(v, '\0');
1177 bc_vec_push(v, &const_int_0);
1180 static void bc_vec_pushAt(BcVec *v, const void *data, size_t idx)
1183 bc_vec_push(v, data);
1188 if (v->len == v->cap) bc_vec_grow(v, 1);
1190 ptr = v->v + v->size * idx;
1192 memmove(ptr + v->size, ptr, v->size * (v->len++ - idx));
1193 memmove(ptr, data, v->size);
1197 static void bc_vec_string(BcVec *v, size_t len, const char *str)
1200 bc_vec_expand(v, len + 1);
1201 memcpy(v->v, str, len);
1204 bc_vec_pushZeroByte(v);
1207 #if ENABLE_FEATURE_BC_SIGNALS && ENABLE_FEATURE_EDITING
1208 static void bc_vec_concat(BcVec *v, const char *str)
1212 if (v->len == 0) bc_vec_pushZeroByte(v);
1215 len = v->len + slen;
1217 if (v->cap < len) bc_vec_grow(v, slen);
1218 strcpy(v->v + v->len - 1, str);
1224 static void *bc_vec_item(const BcVec *v, size_t idx)
1226 return v->v + v->size * idx;
1229 static char** bc_program_str(size_t idx)
1231 return bc_vec_item(&G.prog.strs, idx);
1234 static BcFunc* bc_program_func(size_t idx)
1236 return bc_vec_item(&G.prog.fns, idx);
1239 static void *bc_vec_item_rev(const BcVec *v, size_t idx)
1241 return v->v + v->size * (v->len - idx - 1);
1244 static void *bc_vec_top(const BcVec *v)
1246 return v->v + v->size * (v->len - 1);
1249 static FAST_FUNC void bc_vec_free(void *vec)
1251 BcVec *v = (BcVec *) vec;
1256 static int bc_id_cmp(const void *e1, const void *e2)
1258 return strcmp(((const BcId *) e1)->name, ((const BcId *) e2)->name);
1261 static FAST_FUNC void bc_id_free(void *id)
1263 free(((BcId *) id)->name);
1266 static size_t bc_map_find(const BcVec *v, const void *ptr)
1268 size_t low = 0, high = v->len;
1270 while (low < high) {
1272 size_t mid = (low + high) / 2;
1273 BcId *id = bc_vec_item(v, mid);
1274 int result = bc_id_cmp(ptr, id);
1278 else if (result < 0)
1287 static int bc_map_insert(BcVec *v, const void *ptr, size_t *i)
1289 size_t n = *i = bc_map_find(v, ptr);
1292 bc_vec_push(v, ptr);
1293 else if (!bc_id_cmp(ptr, bc_vec_item(v, n)))
1294 return 0; // "was not inserted"
1296 bc_vec_pushAt(v, ptr, n);
1297 return 1; // "was inserted"
1301 static size_t bc_map_index(const BcVec *v, const void *ptr)
1303 size_t i = bc_map_find(v, ptr);
1304 if (i >= v->len) return BC_VEC_INVALID_IDX;
1305 return bc_id_cmp(ptr, bc_vec_item(v, i)) ? BC_VEC_INVALID_IDX : i;
1309 static int bad_input_byte(char c)
1311 if ((c < ' ' && c != '\t' && c != '\r' && c != '\n') // also allow '\v' '\f'?
1314 bc_error_fmt("illegal character 0x%02x", c);
1320 // Note: it _appends_ data from the stdin to vec.
1321 static void bc_read_line(BcVec *vec)
1326 #if ENABLE_FEATURE_BC_SIGNALS
1327 if (G_interrupt) { // ^C was pressed
1330 // GNU bc says "interrupted execution."
1331 // GNU dc says "Interrupt!"
1332 fputs("\ninterrupted execution\n", stderr);
1335 # if ENABLE_FEATURE_EDITING
1338 # define line_buf bb_common_bufsiz1
1339 n = read_line_input(G.line_input_state, "", line_buf, COMMON_BUFSIZE);
1340 if (n <= 0) { // read errors or EOF, or ^D, or ^C
1343 bc_vec_pushZeroByte(vec);
1348 char c = line_buf[i++];
1350 if (bad_input_byte(c)) goto again;
1352 bc_vec_concat(vec, line_buf);
1360 size_t len = vec->len;
1362 IF_FEATURE_BC_SIGNALS(errno = 0;)
1365 #if ENABLE_FEATURE_BC_SIGNALS && !ENABLE_FEATURE_EDITING
1366 // Both conditions appear simultaneously, check both just in case
1367 if (errno == EINTR || G_interrupt) {
1375 quit(); // this emits error message
1376 // Note: EOF does not append '\n', therefore:
1377 // printf 'print 123\n' | bc - works
1378 // printf 'print 123' | bc - fails (syntax error)
1381 bad_chars |= bad_input_byte(c);
1382 bc_vec_pushByte(vec, (char)c);
1383 } while (c != '\n');
1385 // Bad chars on this line, ignore entire line
1389 bc_vec_pushZeroByte(vec);
1393 static char* bc_read_file(const char *path)
1396 size_t size = ((size_t) -1);
1399 // Never returns NULL (dies on errors)
1400 buf = xmalloc_xopen_read_close(path, &size);
1402 for (i = 0; i < size; ++i) {
1404 if ((c < ' ' && c != '\t' && c != '\r' && c != '\n') // also allow '\v' '\f'?
1416 static void bc_num_setToZero(BcNum *n, size_t scale)
1423 static void bc_num_zero(BcNum *n)
1425 bc_num_setToZero(n, 0);
1428 static void bc_num_one(BcNum *n)
1430 bc_num_setToZero(n, 0);
1435 static void bc_num_ten(BcNum *n)
1437 bc_num_setToZero(n, 0);
1443 // Note: this also sets BcNum to zero
1444 static void bc_num_init(BcNum *n, size_t req)
1446 req = req >= BC_NUM_DEF_SIZE ? req : BC_NUM_DEF_SIZE;
1447 //memset(n, 0, sizeof(BcNum)); - cleared by assignments below
1448 n->num = xmalloc(req);
1455 static void bc_num_init_DEF_SIZE(BcNum *n)
1457 bc_num_init(n, BC_NUM_DEF_SIZE);
1460 static void bc_num_expand(BcNum *n, size_t req)
1462 req = req >= BC_NUM_DEF_SIZE ? req : BC_NUM_DEF_SIZE;
1464 n->num = xrealloc(n->num, req);
1469 static FAST_FUNC void bc_num_free(void *num)
1471 free(((BcNum *) num)->num);
1474 static void bc_num_copy(BcNum *d, BcNum *s)
1477 bc_num_expand(d, s->cap);
1481 memcpy(d->num, s->num, sizeof(BcDig) * d->len);
1485 static BC_STATUS zbc_num_ulong(BcNum *n, unsigned long *result_p)
1488 unsigned long pow, result;
1490 if (n->neg) RETURN_STATUS(bc_error("negative number"));
1492 for (result = 0, pow = 1, i = n->rdx; i < n->len; ++i) {
1494 unsigned long prev = result, powprev = pow;
1496 result += ((unsigned long) n->num[i]) * pow;
1499 if (result < prev || pow < powprev)
1500 RETURN_STATUS(bc_error("overflow"));
1506 RETURN_STATUS(BC_STATUS_SUCCESS);
1508 #if ERRORS_ARE_FATAL
1509 # define zbc_num_ulong(...) (zbc_num_ulong(__VA_ARGS__), BC_STATUS_SUCCESS)
1512 static void bc_num_ulong2num(BcNum *n, unsigned long val)
1518 if (val == 0) return;
1520 if (ULONG_MAX == 0xffffffffUL)
1521 bc_num_expand(n, 10); // 10 digits: 4294967295
1522 if (ULONG_MAX == 0xffffffffffffffffULL)
1523 bc_num_expand(n, 20); // 20 digits: 18446744073709551615
1524 BUILD_BUG_ON(ULONG_MAX > 0xffffffffffffffffULL);
1531 if (val == 0) break;
1535 static void bc_num_subArrays(BcDig *restrict a, BcDig *restrict b,
1539 for (i = 0; i < len; ++i) {
1540 for (a[i] -= b[i], j = 0; a[i + j] < 0;) {
1547 static ssize_t bc_num_compare(BcDig *restrict a, BcDig *restrict b, size_t len)
1551 for (i = len - 1; i < len && !(c = a[i] - b[i]); --i);
1552 return BC_NUM_NEG(i + 1, c < 0);
1555 static ssize_t bc_num_cmp(BcNum *a, BcNum *b)
1557 size_t i, min, a_int, b_int, diff;
1558 BcDig *max_num, *min_num;
1562 if (a == b) return 0;
1563 if (a->len == 0) return BC_NUM_NEG(!!b->len, !b->neg);
1564 if (b->len == 0) return BC_NUM_NEG(1, a->neg);
1566 if (a->neg != b->neg) // signs of a and b differ
1567 // +a,-b = a>b = 1 or -a,+b = a<b = -1
1568 return (int)b->neg - (int)a->neg;
1569 neg = a->neg; // 1 if both negative, 0 if both positive
1571 a_int = BC_NUM_INT(a);
1572 b_int = BC_NUM_INT(b);
1575 if (a_int != 0) return (ssize_t) a_int;
1577 a_max = (a->rdx > b->rdx);
1580 diff = a->rdx - b->rdx;
1581 max_num = a->num + diff;
1583 // neg = (a_max == neg); - NOP (maps 1->1 and 0->0)
1586 diff = b->rdx - a->rdx;
1587 max_num = b->num + diff;
1589 neg = !neg; // same as "neg = (a_max == neg)"
1592 cmp = bc_num_compare(max_num, min_num, b_int + min);
1593 if (cmp != 0) return BC_NUM_NEG(cmp, neg);
1595 for (max_num -= diff, i = diff - 1; i < diff; --i) {
1596 if (max_num[i]) return BC_NUM_NEG(1, neg);
1602 static void bc_num_truncate(BcNum *n, size_t places)
1604 if (places == 0) return;
1610 memmove(n->num, n->num + places, n->len * sizeof(BcDig));
1614 static void bc_num_extend(BcNum *n, size_t places)
1616 size_t len = n->len + places;
1620 if (n->cap < len) bc_num_expand(n, len);
1622 memmove(n->num + places, n->num, sizeof(BcDig) * n->len);
1623 memset(n->num, 0, sizeof(BcDig) * places);
1630 static void bc_num_clean(BcNum *n)
1632 while (n->len > 0 && n->num[n->len - 1] == 0) --n->len;
1635 else if (n->len < n->rdx)
1639 static void bc_num_retireMul(BcNum *n, size_t scale, bool neg1, bool neg2)
1642 bc_num_extend(n, scale - n->rdx);
1644 bc_num_truncate(n, n->rdx - scale);
1647 if (n->len != 0) n->neg = !neg1 != !neg2;
1650 static void bc_num_split(BcNum *restrict n, size_t idx, BcNum *restrict a,
1655 b->len = n->len - idx;
1657 a->rdx = b->rdx = 0;
1659 memcpy(b->num, n->num + idx, b->len * sizeof(BcDig));
1660 memcpy(a->num, n->num, idx * sizeof(BcDig));
1671 static BC_STATUS zbc_num_shift(BcNum *n, size_t places)
1673 if (places == 0 || n->len == 0) RETURN_STATUS(BC_STATUS_SUCCESS);
1675 // This check makes sense only if size_t is (much) larger than BC_MAX_NUM.
1676 if (SIZE_MAX > (BC_MAX_NUM | 0xff)) {
1677 if (places + n->len > BC_MAX_NUM)
1678 RETURN_STATUS(bc_error("number too long: must be [1,"BC_MAX_NUM_STR"]"));
1681 if (n->rdx >= places)
1684 bc_num_extend(n, places - n->rdx);
1690 RETURN_STATUS(BC_STATUS_SUCCESS);
1692 #if ERRORS_ARE_FATAL
1693 # define zbc_num_shift(...) (zbc_num_shift(__VA_ARGS__), BC_STATUS_SUCCESS)
1696 static BC_STATUS zbc_num_inv(BcNum *a, BcNum *b, size_t scale)
1705 RETURN_STATUS(zbc_num_div(&one, a, b, scale));
1707 #if ERRORS_ARE_FATAL
1708 # define zbc_num_inv(...) (zbc_num_inv(__VA_ARGS__), BC_STATUS_SUCCESS)
1711 static FAST_FUNC BC_STATUS zbc_num_a(BcNum *a, BcNum *b, BcNum *restrict c, size_t sub)
1713 BcDig *ptr, *ptr_a, *ptr_b, *ptr_c;
1714 size_t i, max, min_rdx, min_int, diff, a_int, b_int;
1717 // Because this function doesn't need to use scale (per the bc spec),
1718 // I am hijacking it to say whether it's doing an add or a subtract.
1722 if (sub && c->len) c->neg = !c->neg;
1723 RETURN_STATUS(BC_STATUS_SUCCESS);
1727 RETURN_STATUS(BC_STATUS_SUCCESS);
1731 c->rdx = BC_MAX(a->rdx, b->rdx);
1732 min_rdx = BC_MIN(a->rdx, b->rdx);
1735 if (a->rdx > b->rdx) {
1736 diff = a->rdx - b->rdx;
1738 ptr_a = a->num + diff;
1742 diff = b->rdx - a->rdx;
1745 ptr_b = b->num + diff;
1748 for (ptr_c = c->num, i = 0; i < diff; ++i, ++c->len) ptr_c[i] = ptr[i];
1751 a_int = BC_NUM_INT(a);
1752 b_int = BC_NUM_INT(b);
1754 if (a_int > b_int) {
1765 for (carry = 0, i = 0; i < min_rdx + min_int; ++i, ++c->len) {
1766 in = ((int) ptr_a[i]) + ((int) ptr_b[i]) + carry;
1768 ptr_c[i] = (BcDig)(in % 10);
1771 for (; i < max + min_rdx; ++i, ++c->len) {
1772 in = ((int) ptr[i]) + carry;
1774 ptr_c[i] = (BcDig)(in % 10);
1777 if (carry != 0) c->num[c->len++] = (BcDig) carry;
1779 RETURN_STATUS(BC_STATUS_SUCCESS); // can't make void, see zbc_num_binary()
1782 static FAST_FUNC BC_STATUS zbc_num_s(BcNum *a, BcNum *b, BcNum *restrict c, size_t sub)
1785 BcNum *minuend, *subtrahend;
1787 bool aneg, bneg, neg;
1789 // Because this function doesn't need to use scale (per the bc spec),
1790 // I am hijacking it to say whether it's doing an add or a subtract.
1794 if (sub && c->len) c->neg = !c->neg;
1795 RETURN_STATUS(BC_STATUS_SUCCESS);
1799 RETURN_STATUS(BC_STATUS_SUCCESS);
1804 a->neg = b->neg = false;
1806 cmp = bc_num_cmp(a, b);
1812 bc_num_setToZero(c, BC_MAX(a->rdx, b->rdx));
1813 RETURN_STATUS(BC_STATUS_SUCCESS);
1822 if (sub) neg = !neg;
1827 bc_num_copy(c, minuend);
1830 if (c->rdx < subtrahend->rdx) {
1831 bc_num_extend(c, subtrahend->rdx - c->rdx);
1835 start = c->rdx - subtrahend->rdx;
1837 bc_num_subArrays(c->num + start, subtrahend->num, subtrahend->len);
1841 RETURN_STATUS(BC_STATUS_SUCCESS); // can't make void, see zbc_num_binary()
1844 static FAST_FUNC BC_STATUS zbc_num_k(BcNum *restrict a, BcNum *restrict b,
1846 #if ERRORS_ARE_FATAL
1847 # define zbc_num_k(...) (zbc_num_k(__VA_ARGS__), BC_STATUS_SUCCESS)
1851 size_t max = BC_MAX(a->len, b->len), max2 = (max + 1) / 2;
1852 BcNum l1, h1, l2, h2, m2, m1, z0, z1, z2, temp;
1855 if (a->len == 0 || b->len == 0) {
1857 RETURN_STATUS(BC_STATUS_SUCCESS);
1859 aone = BC_NUM_ONE(a);
1860 if (aone || BC_NUM_ONE(b)) {
1861 bc_num_copy(c, aone ? b : a);
1862 RETURN_STATUS(BC_STATUS_SUCCESS);
1865 if (a->len + b->len < BC_NUM_KARATSUBA_LEN ||
1866 a->len < BC_NUM_KARATSUBA_LEN || b->len < BC_NUM_KARATSUBA_LEN)
1871 bc_num_expand(c, a->len + b->len + 1);
1873 memset(c->num, 0, sizeof(BcDig) * c->cap);
1876 for (i = 0; i < b->len; ++i) {
1879 for (j = 0; j < a->len; ++j) {
1880 unsigned in = c->num[i + j];
1881 in += ((unsigned) a->num[j]) * ((unsigned) b->num[i]) + carry;
1882 // note: compilers prefer _unsigned_ div/const
1884 c->num[i + j] = (BcDig)(in % 10);
1887 c->num[i + j] += (BcDig) carry;
1888 len = BC_MAX(len, i + j + !!carry);
1890 #if ENABLE_FEATURE_BC_SIGNALS
1892 // a*a <- without check below, this will not be interruptible
1893 if (G_interrupt) return BC_STATUS_FAILURE;
1899 RETURN_STATUS(BC_STATUS_SUCCESS);
1902 bc_num_init(&l1, max);
1903 bc_num_init(&h1, max);
1904 bc_num_init(&l2, max);
1905 bc_num_init(&h2, max);
1906 bc_num_init(&m1, max);
1907 bc_num_init(&m2, max);
1908 bc_num_init(&z0, max);
1909 bc_num_init(&z1, max);
1910 bc_num_init(&z2, max);
1911 bc_num_init(&temp, max + max);
1913 bc_num_split(a, max2, &l1, &h1);
1914 bc_num_split(b, max2, &l2, &h2);
1916 s = zbc_num_add(&h1, &l1, &m1, 0);
1918 s = zbc_num_add(&h2, &l2, &m2, 0);
1921 s = zbc_num_k(&h1, &h2, &z0);
1923 s = zbc_num_k(&m1, &m2, &z1);
1925 s = zbc_num_k(&l1, &l2, &z2);
1928 s = zbc_num_sub(&z1, &z0, &temp, 0);
1930 s = zbc_num_sub(&temp, &z2, &z1, 0);
1933 s = zbc_num_shift(&z0, max2 * 2);
1935 s = zbc_num_shift(&z1, max2);
1937 s = zbc_num_add(&z0, &z1, &temp, 0);
1939 s = zbc_num_add(&temp, &z2, c, 0);
1955 static FAST_FUNC BC_STATUS zbc_num_m(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale)
1959 size_t maxrdx = BC_MAX(a->rdx, b->rdx);
1961 scale = BC_MAX(scale, a->rdx);
1962 scale = BC_MAX(scale, b->rdx);
1963 scale = BC_MIN(a->rdx + b->rdx, scale);
1964 maxrdx = BC_MAX(maxrdx, scale);
1966 bc_num_init(&cpa, a->len);
1967 bc_num_init(&cpb, b->len);
1969 bc_num_copy(&cpa, a);
1970 bc_num_copy(&cpb, b);
1971 cpa.neg = cpb.neg = false;
1973 s = zbc_num_shift(&cpa, maxrdx);
1975 s = zbc_num_shift(&cpb, maxrdx);
1977 s = zbc_num_k(&cpa, &cpb, c);
1981 bc_num_expand(c, c->len + maxrdx);
1983 if (c->len < maxrdx) {
1984 memset(c->num + c->len, 0, (c->cap - c->len) * sizeof(BcDig));
1989 bc_num_retireMul(c, scale, a->neg, b->neg);
1996 #if ERRORS_ARE_FATAL
1997 # define zbc_num_m(...) (zbc_num_m(__VA_ARGS__), BC_STATUS_SUCCESS)
2000 static FAST_FUNC BC_STATUS zbc_num_d(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale)
2002 BcStatus s = BC_STATUS_SUCCESS;
2009 RETURN_STATUS(bc_error("divide by zero"));
2011 bc_num_setToZero(c, scale);
2012 RETURN_STATUS(BC_STATUS_SUCCESS);
2014 if (BC_NUM_ONE(b)) {
2016 bc_num_retireMul(c, scale, a->neg, b->neg);
2017 RETURN_STATUS(BC_STATUS_SUCCESS);
2020 bc_num_init(&cp, BC_NUM_MREQ(a, b, scale));
2021 bc_num_copy(&cp, a);
2025 bc_num_expand(&cp, len + 2);
2026 bc_num_extend(&cp, len - cp.len);
2029 if (b->rdx > cp.rdx) bc_num_extend(&cp, b->rdx - cp.rdx);
2031 if (scale > cp.rdx) bc_num_extend(&cp, scale - cp.rdx);
2033 if (b->rdx == b->len) {
2034 for (i = 0; zero && i < len; ++i) zero = !b->num[len - i - 1];
2038 if (cp.cap == cp.len) bc_num_expand(&cp, cp.len + 1);
2040 // We want an extra zero in front to make things simpler.
2041 cp.num[cp.len++] = 0;
2044 bc_num_expand(c, cp.len);
2047 memset(c->num + end, 0, (c->cap - end) * sizeof(BcDig));
2052 for (i = end - 1; !s && i < end; --i) {
2054 for (q = 0; (!s && n[len] != 0) || bc_num_compare(n, p, len) >= 0; ++q)
2055 bc_num_subArrays(n, p, len);
2057 #if ENABLE_FEATURE_BC_SIGNALS
2060 // 1/a <- without check below, this will not be interruptible
2062 s = BC_STATUS_FAILURE;
2068 bc_num_retireMul(c, scale, a->neg, b->neg);
2073 #if ERRORS_ARE_FATAL
2074 # define zbc_num_d(...) (zbc_num_d(__VA_ARGS__), BC_STATUS_SUCCESS)
2077 static FAST_FUNC BC_STATUS zbc_num_r(BcNum *a, BcNum *b, BcNum *restrict c,
2078 BcNum *restrict d, size_t scale, size_t ts)
2085 RETURN_STATUS(bc_error("divide by zero"));
2088 bc_num_setToZero(d, ts);
2089 RETURN_STATUS(BC_STATUS_SUCCESS);
2092 bc_num_init(&temp, d->cap);
2093 s = zbc_num_d(a, b, c, scale);
2096 if (scale != 0) scale = ts;
2098 s = zbc_num_m(c, b, &temp, scale);
2100 s = zbc_num_sub(a, &temp, d, scale);
2103 if (ts > d->rdx && d->len) bc_num_extend(d, ts - d->rdx);
2106 bc_num_retireMul(d, ts, a->neg, b->neg);
2113 #if ERRORS_ARE_FATAL
2114 # define zbc_num_r(...) (zbc_num_r(__VA_ARGS__), BC_STATUS_SUCCESS)
2117 static FAST_FUNC BC_STATUS zbc_num_rem(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale)
2121 size_t ts = BC_MAX(scale + b->rdx, a->rdx), len = BC_NUM_MREQ(a, b, ts);
2123 bc_num_init(&c1, len);
2124 s = zbc_num_r(a, b, &c1, c, scale, ts);
2129 #if ERRORS_ARE_FATAL
2130 # define zbc_num_rem(...) (zbc_num_rem(__VA_ARGS__), BC_STATUS_SUCCESS)
2133 static FAST_FUNC BC_STATUS zbc_num_p(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale)
2135 BcStatus s = BC_STATUS_SUCCESS;
2138 size_t i, powrdx, resrdx;
2141 if (b->rdx) RETURN_STATUS(bc_error("non integer number"));
2145 RETURN_STATUS(BC_STATUS_SUCCESS);
2148 bc_num_setToZero(c, scale);
2149 RETURN_STATUS(BC_STATUS_SUCCESS);
2151 if (BC_NUM_ONE(b)) {
2155 s = zbc_num_inv(a, c, scale);
2162 s = zbc_num_ulong(b, &pow);
2163 if (s) RETURN_STATUS(s);
2165 bc_num_init(©, a->len);
2166 bc_num_copy(©, a);
2171 if (a->rdx * pow < scale)
2172 scale = a->rdx * pow;
2177 for (powrdx = a->rdx; !(pow & 1); pow >>= 1) {
2179 s = zbc_num_mul(©, ©, ©, powrdx);
2181 // Not needed: zbc_num_mul() has a check for ^C:
2182 //if (G_interrupt) {
2183 // s = BC_STATUS_FAILURE;
2188 bc_num_copy(c, ©);
2190 for (resrdx = powrdx, pow >>= 1; pow != 0; pow >>= 1) {
2193 s = zbc_num_mul(©, ©, ©, powrdx);
2198 s = zbc_num_mul(c, ©, c, resrdx);
2201 // Not needed: zbc_num_mul() has a check for ^C:
2202 //if (G_interrupt) {
2203 // s = BC_STATUS_FAILURE;
2209 s = zbc_num_inv(c, c, scale);
2213 if (c->rdx > scale) bc_num_truncate(c, c->rdx - scale);
2215 // We can't use bc_num_clean() here.
2216 for (zero = true, i = 0; zero && i < c->len; ++i) zero = !c->num[i];
2217 if (zero) bc_num_setToZero(c, scale);
2223 #if ERRORS_ARE_FATAL
2224 # define zbc_num_p(...) (zbc_num_p(__VA_ARGS__), BC_STATUS_SUCCESS)
2227 static BC_STATUS zbc_num_binary(BcNum *a, BcNum *b, BcNum *c, size_t scale,
2228 BcNumBinaryOp op, size_t req)
2231 BcNum num2, *ptr_a, *ptr_b;
2236 memcpy(ptr_a, c, sizeof(BcNum));
2245 memcpy(ptr_b, c, sizeof(BcNum));
2253 bc_num_init(c, req);
2255 bc_num_expand(c, req);
2257 s = BC_STATUS_SUCCESS;
2258 ERROR_RETURN(s =) op(ptr_a, ptr_b, c, scale);
2260 if (init) bc_num_free(&num2);
2264 #if ERRORS_ARE_FATAL
2265 # define zbc_num_binary(...) (zbc_num_binary(__VA_ARGS__), BC_STATUS_SUCCESS)
2268 static bool bc_num_strValid(const char *val, size_t base)
2273 b = (BcDig)(base <= 10 ? base + '0' : base - 10 + 'A');
2280 if (radix) return false;
2284 if (c < '0' || c >= b || (c > '9' && c < 'A'))
2290 // Note: n is already "bc_num_zero()"ed,
2291 // leading zeroes in "val" are removed
2292 static void bc_num_parseDecimal(BcNum *n, const char *val)
2301 bc_num_expand(n, len);
2303 ptr = strchr(val, '.');
2307 n->rdx = (size_t)((val + len) - (ptr + 1));
2309 for (i = 0; val[i]; ++i) {
2310 if (val[i] != '0' && val[i] != '.') {
2311 // Not entirely zero value - convert it, and exit
2314 n->num[n->len] = val[i] - '0';
2318 if (val[--i] == '.') goto skip_dot;
2323 // if for() exits without hitting if(), the value is entirely zero
2326 // Note: n is already "bc_num_zero()"ed,
2327 // leading zeroes in "val" are removed
2328 static void bc_num_parseBase(BcNum *n, const char *val, BcNum *base)
2331 BcNum temp, mult, result;
2336 for (i = 0; ; ++i) {
2339 if (val[i] != '.' && val[i] != '0')
2343 bc_num_init_DEF_SIZE(&temp);
2344 bc_num_init_DEF_SIZE(&mult);
2348 if (c == '\0') goto int_err;
2349 if (c == '.') break;
2351 v = (unsigned long) (c <= '9' ? c - '0' : c - 'A' + 10);
2353 s = zbc_num_mul(n, base, &mult, 0);
2354 if (s) goto int_err;
2355 bc_num_ulong2num(&temp, v);
2356 s = zbc_num_add(&mult, &temp, n, 0);
2357 if (s) goto int_err;
2360 bc_num_init(&result, base->len);
2361 //bc_num_zero(&result); - already is
2367 if (c == '\0') break;
2370 v = (unsigned long) (c <= '9' ? c - '0' : c - 'A' + 10);
2372 s = zbc_num_mul(&result, base, &result, 0);
2374 bc_num_ulong2num(&temp, v);
2375 s = zbc_num_add(&result, &temp, &result, 0);
2377 s = zbc_num_mul(&mult, base, &mult, 0);
2381 s = zbc_num_div(&result, &mult, &result, digits);
2383 s = zbc_num_add(n, &result, n, digits);
2387 if (n->rdx < digits) bc_num_extend(n, digits - n->rdx);
2392 bc_num_free(&result);
2398 static BC_STATUS zbc_num_parse(BcNum *n, const char *val, BcNum *base,
2401 if (!bc_num_strValid(val, base_t))
2402 RETURN_STATUS(bc_error("bad number string"));
2405 while (*val == '0') val++;
2408 bc_num_parseDecimal(n, val);
2410 bc_num_parseBase(n, val, base);
2412 RETURN_STATUS(BC_STATUS_SUCCESS);
2414 #if ERRORS_ARE_FATAL
2415 # define zbc_num_parse(...) (zbc_num_parse(__VA_ARGS__), BC_STATUS_SUCCESS)
2418 static BC_STATUS zbc_num_sqrt(BcNum *a, BcNum *restrict b, size_t scale)
2421 BcNum num1, num2, half, f, fprime, *x0, *x1, *temp;
2422 size_t pow, len, digs, digs1, resrdx, req, times = 0;
2423 ssize_t cmp = 1, cmp1 = SSIZE_MAX, cmp2 = SSIZE_MAX;
2425 req = BC_MAX(scale, a->rdx) + ((BC_NUM_INT(a) + 1) >> 1) + 1;
2426 bc_num_expand(b, req);
2429 bc_num_setToZero(b, scale);
2430 RETURN_STATUS(BC_STATUS_SUCCESS);
2433 RETURN_STATUS(bc_error("negative number"));
2434 else if (BC_NUM_ONE(a)) {
2436 bc_num_extend(b, scale);
2437 RETURN_STATUS(BC_STATUS_SUCCESS);
2440 scale = BC_MAX(scale, a->rdx) + 1;
2441 len = a->len + scale;
2443 bc_num_init(&num1, len);
2444 bc_num_init(&num2, len);
2445 bc_num_init_DEF_SIZE(&half);
2451 bc_num_init(&f, len);
2452 bc_num_init(&fprime, len);
2458 pow = BC_NUM_INT(a);
2467 pow -= 2 - (pow & 1);
2469 bc_num_extend(x0, pow);
2471 // Make sure to move the radix back.
2475 x0->rdx = digs = digs1 = 0;
2477 len = BC_NUM_INT(x0) + resrdx - 1;
2479 while (cmp != 0 || digs < len) {
2481 s = zbc_num_div(a, x0, &f, resrdx);
2483 s = zbc_num_add(x0, &f, &fprime, resrdx);
2485 s = zbc_num_mul(&fprime, &half, x1, resrdx);
2488 cmp = bc_num_cmp(x1, x0);
2489 digs = x1->len - (unsigned long long) llabs(cmp);
2491 if (cmp == cmp2 && digs == digs1)
2496 resrdx += times > 4;
2509 if (b->rdx > scale) bc_num_truncate(b, b->rdx - scale);
2512 bc_num_free(&fprime);
2519 #if ERRORS_ARE_FATAL
2520 # define zbc_num_sqrt(...) (zbc_num_sqrt(__VA_ARGS__), BC_STATUS_SUCCESS)
2523 static BC_STATUS zbc_num_divmod(BcNum *a, BcNum *b, BcNum *c, BcNum *d,
2529 size_t ts = BC_MAX(scale + b->rdx, a->rdx), len = BC_NUM_MREQ(a, b, ts);
2532 memcpy(&num2, c, sizeof(BcNum));
2534 bc_num_init(c, len);
2539 bc_num_expand(c, len);
2542 s = zbc_num_r(ptr_a, b, c, d, scale, ts);
2544 if (init) bc_num_free(&num2);
2548 #if ERRORS_ARE_FATAL
2549 # define zbc_num_divmod(...) (zbc_num_divmod(__VA_ARGS__), BC_STATUS_SUCCESS)
2553 static BC_STATUS zbc_num_modexp(BcNum *a, BcNum *b, BcNum *c, BcNum *restrict d)
2556 BcNum base, exp, two, temp;
2559 RETURN_STATUS(bc_error("divide by zero"));
2560 if (a->rdx || b->rdx || c->rdx)
2561 RETURN_STATUS(bc_error("non integer number"));
2563 RETURN_STATUS(bc_error("negative number"));
2565 bc_num_expand(d, c->len);
2566 bc_num_init(&base, c->len);
2567 bc_num_init(&exp, b->len);
2568 bc_num_init_DEF_SIZE(&two);
2569 bc_num_init(&temp, b->len);
2575 s = zbc_num_rem(a, c, &base, 0);
2577 bc_num_copy(&exp, b);
2579 while (exp.len != 0) {
2581 s = zbc_num_divmod(&exp, &two, &exp, &temp, 0);
2584 if (BC_NUM_ONE(&temp)) {
2585 s = zbc_num_mul(d, &base, &temp, 0);
2587 s = zbc_num_rem(&temp, c, d, 0);
2591 s = zbc_num_mul(&base, &base, &temp, 0);
2593 s = zbc_num_rem(&temp, c, &base, 0);
2604 #if ERRORS_ARE_FATAL
2605 # define zbc_num_modexp(...) (zbc_num_modexp(__VA_ARGS__), BC_STATUS_SUCCESS)
2610 static BC_STATUS zbc_func_insert(BcFunc *f, char *name, bool var)
2615 for (i = 0; i < f->autos.len; ++i) {
2616 if (strcmp(name, ((BcId *) bc_vec_item(&f->autos, i))->name) == 0)
2617 RETURN_STATUS(bc_error("function parameter or auto var has the same name as another"));
2623 bc_vec_push(&f->autos, &a);
2625 RETURN_STATUS(BC_STATUS_SUCCESS);
2627 #if ERRORS_ARE_FATAL
2628 # define zbc_func_insert(...) (zbc_func_insert(__VA_ARGS__), BC_STATUS_SUCCESS)
2632 static void bc_func_init(BcFunc *f)
2634 bc_char_vec_init(&f->code);
2635 bc_vec_init(&f->autos, sizeof(BcId), bc_id_free);
2636 bc_vec_init(&f->labels, sizeof(size_t), NULL);
2640 static FAST_FUNC void bc_func_free(void *func)
2642 BcFunc *f = (BcFunc *) func;
2643 bc_vec_free(&f->code);
2644 bc_vec_free(&f->autos);
2645 bc_vec_free(&f->labels);
2648 static void bc_array_expand(BcVec *a, size_t len);
2650 static void bc_array_init(BcVec *a, bool nums)
2653 bc_vec_init(a, sizeof(BcNum), bc_num_free);
2655 bc_vec_init(a, sizeof(BcVec), bc_vec_free);
2656 bc_array_expand(a, 1);
2659 static void bc_array_expand(BcVec *a, size_t len)
2663 if (a->size == sizeof(BcNum) && a->dtor == bc_num_free) {
2664 while (len > a->len) {
2665 bc_num_init_DEF_SIZE(&data.n);
2666 bc_vec_push(a, &data.n);
2670 while (len > a->len) {
2671 bc_array_init(&data.v, true);
2672 bc_vec_push(a, &data.v);
2677 static void bc_array_copy(BcVec *d, const BcVec *s)
2682 bc_vec_expand(d, s->cap);
2685 for (i = 0; i < s->len; ++i) {
2686 BcNum *dnum = bc_vec_item(d, i), *snum = bc_vec_item(s, i);
2687 bc_num_init(dnum, snum->len);
2688 bc_num_copy(dnum, snum);
2692 static FAST_FUNC void bc_string_free(void *string)
2694 free(*((char **) string));
2698 static void bc_result_copy(BcResult *d, BcResult *src)
2704 case BC_RESULT_TEMP:
2705 case BC_RESULT_IBASE:
2706 case BC_RESULT_SCALE:
2707 case BC_RESULT_OBASE:
2709 bc_num_init(&d->d.n, src->d.n.len);
2710 bc_num_copy(&d->d.n, &src->d.n);
2715 case BC_RESULT_ARRAY:
2716 case BC_RESULT_ARRAY_ELEM:
2718 d->d.id.name = xstrdup(src->d.id.name);
2722 case BC_RESULT_CONSTANT:
2723 case BC_RESULT_LAST:
2727 memcpy(&d->d.n, &src->d.n, sizeof(BcNum));
2734 static FAST_FUNC void bc_result_free(void *result)
2736 BcResult *r = (BcResult *) result;
2740 case BC_RESULT_TEMP:
2741 case BC_RESULT_IBASE:
2742 case BC_RESULT_SCALE:
2743 case BC_RESULT_OBASE:
2745 bc_num_free(&r->d.n);
2750 case BC_RESULT_ARRAY:
2751 case BC_RESULT_ARRAY_ELEM:
2765 static void bc_lex_lineComment(BcLex *l)
2767 l->t.t = BC_LEX_WHITESPACE;
2768 while (l->i < l->len && l->buf[l->i++] != '\n');
2772 static void bc_lex_whitespace(BcLex *l)
2774 l->t.t = BC_LEX_WHITESPACE;
2776 char c = l->buf[l->i];
2777 if (c == '\n') // this is BC_LEX_NLINE, not BC_LEX_WHITESPACE
2785 static BC_STATUS zbc_lex_number(BcLex *l, char start)
2787 const char *buf = l->buf + l->i;
2788 size_t len, bslashes, i, ccnt;
2791 pt = (start == '.');
2792 l->t.t = BC_LEX_NUMBER;
2799 if (c == '\\' && buf[i + 1] == '\n') {
2804 if (!isdigit(c) && (c < 'A' || c > 'F')) {
2805 if (c != '.') break;
2806 // if '.' was already seen, stop on second one:
2810 // buf[i] is one of "0-9A-F."
2815 //i is buf[i] index of the first not-yet-parsed char
2818 //ccnt is the number of chars in the number string, excluding possible
2819 //trailing "." and possible following trailing "\<newline>"(s).
2820 len = ccnt - bslashes * 2 + 1; // +1 byte for NUL termination
2822 // This check makes sense only if size_t is (much) larger than BC_MAX_NUM.
2823 if (SIZE_MAX > (BC_MAX_NUM | 0xff)) {
2824 if (len > BC_MAX_NUM)
2825 RETURN_STATUS(bc_error("number too long: must be [1,"BC_MAX_NUM_STR"]"));
2828 bc_vec_pop_all(&l->t.v);
2829 bc_vec_expand(&l->t.v, 1 + len);
2830 bc_vec_push(&l->t.v, &start);
2833 // If we have hit a backslash, skip it. We don't have
2834 // to check for a newline because it's guaranteed.
2840 bc_vec_push(&l->t.v, buf);
2845 bc_vec_pushZeroByte(&l->t.v);
2847 RETURN_STATUS(BC_STATUS_SUCCESS);
2849 #if ERRORS_ARE_FATAL
2850 # define zbc_lex_number(...) (zbc_lex_number(__VA_ARGS__), BC_STATUS_SUCCESS)
2853 static void bc_lex_name(BcLex *l)
2858 l->t.t = BC_LEX_NAME;
2861 buf = l->buf + l->i - 1;
2864 if ((c < 'a' || c > 'z') && !isdigit(c) && c != '_') break;
2868 #if 0 // We do not protect against people with gigabyte-long names
2869 // This check makes sense only if size_t is (much) larger than BC_MAX_STRING.
2870 if (SIZE_MAX > (BC_MAX_STRING | 0xff)) {
2871 if (i > BC_MAX_STRING)
2872 return bc_error("name too long: must be [1,"BC_MAX_STRING_STR"]");
2875 bc_vec_string(&l->t.v, i, buf);
2877 // Increment the index. We minus 1 because it has already been incremented.
2880 //return BC_STATUS_SUCCESS;
2883 static void bc_lex_init(BcLex *l)
2885 bc_char_vec_init(&l->t.v);
2888 static void bc_lex_free(BcLex *l)
2890 bc_vec_free(&l->t.v);
2893 static void bc_lex_file(BcLex *l)
2895 G.err_line = l->line = 1;
2899 IF_BC(static BC_STATUS zbc_lex_token(BcLex *l);)
2900 IF_DC(static BC_STATUS zdc_lex_token(BcLex *l);)
2902 static BC_STATUS zcommon_lex_token(BcLex *l)
2905 IF_BC(RETURN_STATUS(zbc_lex_token(l));)
2907 IF_DC(RETURN_STATUS(zdc_lex_token(l));)
2910 static bool bc_lex_more_input(BcLex *l)
2915 bc_vec_pop_all(&G.stdin_buffer);
2917 // This loop is complex because the vm tries not to send any lines that end
2918 // with a backslash to the parser. The reason for that is because the parser
2919 // treats a backslash+newline combo as whitespace, per the bc spec. In that
2920 // case, and for strings and comments, the parser will expect more stuff.
2924 size_t prevlen = G.stdin_buffer.len;
2927 bc_read_line(&G.stdin_buffer);
2928 // No more input means EOF
2929 if (G.stdin_buffer.len <= prevlen + 1) // (we expect +1 for NUL byte)
2932 string = G.stdin_buffer.v + prevlen;
2935 if (string == G.stdin_buffer.v || string[-1] != '\\') {
2946 if (c == '/' && *string == '*') {
2951 if (c == '*' && *string == '/') {
2956 if (str != 0 || comment) {
2957 G.stdin_buffer.len--; // backstep over the trailing NUL byte
2961 // Check for backslash+newline.
2962 // we do not check that last char is '\n' -
2963 // if it is not, then it's EOF, and looping back
2964 // to bc_read_line() will detect it:
2966 if (string >= G.stdin_buffer.v && *string == '\\') {
2967 G.stdin_buffer.len--;
2974 l->buf = G.stdin_buffer.v;
2976 //bb_error_msg("G.stdin_buffer.len:%d '%s'", G.stdin_buffer.len, G.stdin_buffer.v);
2977 l->len = G.stdin_buffer.len - 1; // do not include NUL
2979 G.use_stdin = (l->len != 0);
2983 static BC_STATUS zbc_lex_next(BcLex *l)
2988 if (l->t.last == BC_LEX_EOF) RETURN_STATUS(bc_error("end of file"));
2990 l->line += l->newline;
2991 G.err_line = l->line;
2993 l->t.t = BC_LEX_EOF;
2994 //this NL handling is bogus
2995 l->newline = (l->i == l->len);
2997 if (!G.use_stdin || !bc_lex_more_input(l))
2998 RETURN_STATUS(BC_STATUS_SUCCESS);
2999 // here it's guaranteed that l->i is below l->len
3003 // Loop until failure or we don't have whitespace. This
3004 // is so the parser doesn't get inundated with whitespace.
3005 // Comments are also BC_LEX_WHITESPACE tokens and eaten here.
3006 s = BC_STATUS_SUCCESS;
3008 dbg_lex("next string to parse:'%.*s'",
3009 (int)(strchrnul(l->buf + l->i, '\n') - (l->buf + l->i)),
3011 ERROR_RETURN(s =) zcommon_lex_token(l);
3012 } while (!s && l->t.t == BC_LEX_WHITESPACE);
3013 dbg_lex("l->t.t from string:%d", l->t.t);
3017 #if ERRORS_ARE_FATAL
3018 # define zbc_lex_next(...) (zbc_lex_next(__VA_ARGS__), BC_STATUS_SUCCESS)
3021 static BC_STATUS zbc_lex_skip_if_at_NLINE(BcLex *l)
3023 if (l->t.t == BC_LEX_NLINE)
3024 RETURN_STATUS(zbc_lex_next(l));
3025 RETURN_STATUS(BC_STATUS_SUCCESS);
3027 #if ERRORS_ARE_FATAL
3028 # define zbc_lex_skip_if_at_NLINE(...) (zbc_lex_skip_if_at_NLINE(__VA_ARGS__), BC_STATUS_SUCCESS)
3031 static BC_STATUS zbc_lex_next_and_skip_NLINE(BcLex *l)
3034 s = zbc_lex_next(l);
3035 if (s) RETURN_STATUS(s);
3036 // if(cond)<newline>stmt is accepted too (but not 2+ newlines)
3037 s = zbc_lex_skip_if_at_NLINE(l);
3040 #if ERRORS_ARE_FATAL
3041 # define zbc_lex_next_and_skip_NLINE(...) (zbc_lex_next_and_skip_NLINE(__VA_ARGS__), BC_STATUS_SUCCESS)
3044 static BC_STATUS zbc_lex_text_init(BcLex *l, const char *text)
3048 l->len = strlen(text);
3049 l->t.t = l->t.last = BC_LEX_INVALID;
3050 RETURN_STATUS(zbc_lex_next(l));
3052 #if ERRORS_ARE_FATAL
3053 # define zbc_lex_text_init(...) (zbc_lex_text_init(__VA_ARGS__), BC_STATUS_SUCCESS)
3057 static BC_STATUS zbc_lex_identifier(BcLex *l)
3061 const char *buf = l->buf + l->i - 1;
3063 for (i = 0; i < ARRAY_SIZE(bc_lex_kws); ++i) {
3064 const char *keyword8 = bc_lex_kws[i].name8;
3066 while (buf[j] != '\0' && buf[j] == keyword8[j]) {
3068 if (j == 8) goto match;
3070 if (keyword8[j] != '\0')
3073 // buf starts with keyword bc_lex_kws[i]
3074 l->t.t = BC_LEX_KEY_1st_keyword + i;
3075 if (!bc_lex_kws_POSIX(i)) {
3076 s = bc_posix_error_fmt("%sthe '%.8s' keyword", "POSIX does not allow ", bc_lex_kws[i].name8);
3077 ERROR_RETURN(if (s) RETURN_STATUS(s);)
3080 // We minus 1 because the index has already been incremented.
3082 RETURN_STATUS(BC_STATUS_SUCCESS);
3087 if (l->t.v.len > 2) {
3090 // bc: POSIX only allows one character names; the following is bad: 'qwe=1
3092 unsigned len = strchrnul(buf, '\n') - buf;
3093 s = bc_posix_error_fmt("POSIX only allows one character names; the following is bad: '%.*s'", len, buf);
3098 #if ERRORS_ARE_FATAL
3099 # define zbc_lex_identifier(...) (zbc_lex_identifier(__VA_ARGS__), BC_STATUS_SUCCESS)
3102 static BC_STATUS zbc_lex_string(BcLex *l)
3104 size_t len, nls = 0, i = l->i;
3107 l->t.t = BC_LEX_STR;
3109 for (c = l->buf[i]; c != 0 && c != '"'; c = l->buf[++i])
3114 RETURN_STATUS(bc_error("string end could not be found"));
3118 // This check makes sense only if size_t is (much) larger than BC_MAX_STRING.
3119 if (SIZE_MAX > (BC_MAX_STRING | 0xff)) {
3120 if (len > BC_MAX_STRING)
3121 RETURN_STATUS(bc_error("string too long: must be [1,"BC_MAX_STRING_STR"]"));
3123 bc_vec_string(&l->t.v, len, l->buf + l->i);
3127 G.err_line = l->line;
3129 RETURN_STATUS(BC_STATUS_SUCCESS);
3131 #if ERRORS_ARE_FATAL
3132 # define zbc_lex_string(...) (zbc_lex_string(__VA_ARGS__), BC_STATUS_SUCCESS)
3135 static void bc_lex_assign(BcLex *l, unsigned with_and_without)
3137 if (l->buf[l->i] == '=') {
3139 with_and_without >>= 8; // store "with" value
3140 } // else store "without" value
3141 l->t.t = (with_and_without & 0xff);
3143 #define bc_lex_assign(l, with, without) \
3144 bc_lex_assign(l, ((with)<<8)|(without))
3146 static BC_STATUS zbc_lex_comment(BcLex *l)
3149 const char *buf = l->buf;
3151 l->t.t = BC_LEX_WHITESPACE;
3152 i = l->i; /* here buf[l->i] is the '*' of opening comment delimiter */
3164 RETURN_STATUS(bc_error("comment end could not be found"));
3171 G.err_line = l->line;
3173 RETURN_STATUS(BC_STATUS_SUCCESS);
3175 #if ERRORS_ARE_FATAL
3176 # define zbc_lex_comment(...) (zbc_lex_comment(__VA_ARGS__), BC_STATUS_SUCCESS)
3179 static BC_STATUS zbc_lex_token(BcLex *l)
3181 BcStatus s = BC_STATUS_SUCCESS;
3182 char c = l->buf[l->i++], c2;
3184 // This is the workhorse of the lexer.
3186 case '\0': // probably never reached
3188 l->t.t = BC_LEX_EOF;
3192 l->t.t = BC_LEX_NLINE;
3200 bc_lex_whitespace(l);
3203 bc_lex_assign(l, BC_LEX_OP_REL_NE, BC_LEX_OP_BOOL_NOT);
3204 if (l->t.t == BC_LEX_OP_BOOL_NOT) {
3205 s = bc_POSIX_does_not_allow_bool_ops_this_is_bad("!");
3206 ERROR_RETURN(if (s) RETURN_STATUS(s);)
3210 s = zbc_lex_string(l);
3213 s = bc_POSIX_does_not_allow("'#' script comments");
3214 ERROR_RETURN(if (s) RETURN_STATUS(s);)
3215 bc_lex_lineComment(l);
3218 bc_lex_assign(l, BC_LEX_OP_ASSIGN_MODULUS, BC_LEX_OP_MODULUS);
3223 s = bc_POSIX_does_not_allow_bool_ops_this_is_bad("&&");
3224 ERROR_RETURN(if (s) RETURN_STATUS(s);)
3226 l->t.t = BC_LEX_OP_BOOL_AND;
3228 l->t.t = BC_LEX_INVALID;
3229 s = bc_error_bad_character('&');
3234 l->t.t = (BcLexType)(c - '(' + BC_LEX_LPAREN);
3237 bc_lex_assign(l, BC_LEX_OP_ASSIGN_MULTIPLY, BC_LEX_OP_MULTIPLY);
3243 l->t.t = BC_LEX_OP_INC;
3245 bc_lex_assign(l, BC_LEX_OP_ASSIGN_PLUS, BC_LEX_OP_PLUS);
3248 l->t.t = BC_LEX_COMMA;
3254 l->t.t = BC_LEX_OP_DEC;
3256 bc_lex_assign(l, BC_LEX_OP_ASSIGN_MINUS, BC_LEX_OP_MINUS);
3259 if (isdigit(l->buf[l->i]))
3260 s = zbc_lex_number(l, c);
3262 l->t.t = BC_LEX_KEY_LAST;
3263 s = bc_POSIX_does_not_allow("a period ('.') as a shortcut for the last result");
3269 s = zbc_lex_comment(l);
3271 bc_lex_assign(l, BC_LEX_OP_ASSIGN_DIVIDE, BC_LEX_OP_DIVIDE);
3289 s = zbc_lex_number(l, c);
3292 l->t.t = BC_LEX_SCOLON;
3295 bc_lex_assign(l, BC_LEX_OP_REL_LE, BC_LEX_OP_REL_LT);
3298 bc_lex_assign(l, BC_LEX_OP_REL_EQ, BC_LEX_OP_ASSIGN);
3301 bc_lex_assign(l, BC_LEX_OP_REL_GE, BC_LEX_OP_REL_GT);
3305 l->t.t = (BcLexType)(c - '[' + BC_LEX_LBRACKET);
3308 if (l->buf[l->i] == '\n') {
3309 l->t.t = BC_LEX_WHITESPACE;
3312 s = bc_error_bad_character(c);
3315 bc_lex_assign(l, BC_LEX_OP_ASSIGN_POWER, BC_LEX_OP_POWER);
3343 s = zbc_lex_identifier(l);
3347 l->t.t = (BcLexType)(c - '{' + BC_LEX_LBRACE);
3352 s = bc_POSIX_does_not_allow_bool_ops_this_is_bad("||");
3353 ERROR_RETURN(if (s) RETURN_STATUS(s);)
3355 l->t.t = BC_LEX_OP_BOOL_OR;
3357 l->t.t = BC_LEX_INVALID;
3358 s = bc_error_bad_character(c);
3362 l->t.t = BC_LEX_INVALID;
3363 s = bc_error_bad_character(c);
3372 static BC_STATUS zdc_lex_register(BcLex *l)
3374 if (isspace(l->buf[l->i - 1])) {
3375 bc_lex_whitespace(l);
3378 RETURN_STATUS(bc_error("extended register"));
3382 bc_vec_pop_all(&l->t.v);
3383 bc_vec_push(&l->t.v, &l->buf[l->i - 1]);
3384 bc_vec_pushZeroByte(&l->t.v);
3385 l->t.t = BC_LEX_NAME;
3388 RETURN_STATUS(BC_STATUS_SUCCESS);
3390 #if ERRORS_ARE_FATAL
3391 # define zdc_lex_register(...) (zdc_lex_register(__VA_ARGS__), BC_STATUS_SUCCESS)
3394 static BC_STATUS zdc_lex_string(BcLex *l)
3396 size_t depth = 1, nls = 0, i = l->i;
3399 l->t.t = BC_LEX_STR;
3400 bc_vec_pop_all(&l->t.v);
3402 for (c = l->buf[i]; c != 0 && depth; c = l->buf[++i]) {
3404 depth += (c == '[' && (i == l->i || l->buf[i - 1] != '\\'));
3405 depth -= (c == ']' && (i == l->i || l->buf[i - 1] != '\\'));
3408 if (depth) bc_vec_push(&l->t.v, &c);
3413 RETURN_STATUS(bc_error("string end could not be found"));
3416 bc_vec_pushZeroByte(&l->t.v);
3417 // This check makes sense only if size_t is (much) larger than BC_MAX_STRING.
3418 if (SIZE_MAX > (BC_MAX_STRING | 0xff)) {
3419 if (i - l->i > BC_MAX_STRING)
3420 RETURN_STATUS(bc_error("string too long: must be [1,"BC_MAX_STRING_STR"]"));
3425 G.err_line = l->line;
3427 RETURN_STATUS(BC_STATUS_SUCCESS);
3429 #if ERRORS_ARE_FATAL
3430 # define zdc_lex_string(...) (zdc_lex_string(__VA_ARGS__), BC_STATUS_SUCCESS)
3433 static BC_STATUS zdc_lex_token(BcLex *l)
3435 BcStatus s = BC_STATUS_SUCCESS;
3436 char c = l->buf[l->i++], c2;
3439 for (i = 0; i < ARRAY_SIZE(dc_lex_regs); ++i) {
3440 if (l->t.last == dc_lex_regs[i])
3441 RETURN_STATUS(zdc_lex_register(l));
3444 if (c >= '%' && c <= '~'
3445 && (l->t.t = dc_lex_tokens[(c - '%')]) != BC_LEX_INVALID
3450 // This is the workhorse of the lexer.
3453 l->t.t = BC_LEX_EOF;
3461 l->newline = (c == '\n');
3462 bc_lex_whitespace(l);
3467 l->t.t = BC_LEX_OP_REL_NE;
3469 l->t.t = BC_LEX_OP_REL_LE;
3471 l->t.t = BC_LEX_OP_REL_GE;
3473 RETURN_STATUS(bc_error_bad_character(c));
3477 bc_lex_lineComment(l);
3480 if (isdigit(l->buf[l->i]))
3481 s = zbc_lex_number(l, c);
3483 s = bc_error_bad_character(c);
3501 s = zbc_lex_number(l, c);
3504 s = zdc_lex_string(l);
3507 l->t.t = BC_LEX_INVALID;
3508 s = bc_error_bad_character(c);
3516 static void bc_program_addFunc(char *name, size_t *idx);
3518 static void bc_parse_addFunc(BcParse *p, char *name, size_t *idx)
3520 bc_program_addFunc(name, idx);
3521 p->func = bc_program_func(p->fidx);
3524 static void bc_parse_push(BcParse *p, char i)
3526 dbg_lex("%s:%d pushing opcode %d", __func__, __LINE__, i);
3527 bc_vec_pushByte(&p->func->code, i);
3530 static void bc_parse_pushName(BcParse *p, char *name)
3533 bc_parse_push(p, *name++);
3534 bc_parse_push(p, BC_PARSE_STREND);
3537 static void bc_parse_pushIndex(BcParse *p, size_t idx)
3542 dbg_lex("%s:%d pushing index %d", __func__, __LINE__, idx);
3543 mask = ((size_t)0xff) << (sizeof(idx) * 8 - 8);
3546 if (idx & mask) break;
3551 bc_parse_push(p, amt);
3554 bc_parse_push(p, (unsigned char)idx);
3559 static void bc_parse_number(BcParse *p)
3561 char *num = xstrdup(p->l.t.v.v);
3562 size_t idx = G.prog.consts.len;
3564 bc_vec_push(&G.prog.consts, &num);
3566 bc_parse_push(p, BC_INST_NUM);
3567 bc_parse_pushIndex(p, idx);
3570 IF_BC(static BC_STATUS zbc_parse_stmt_or_funcdef(BcParse *p);)
3571 IF_DC(static BC_STATUS zdc_parse_parse(BcParse *p);)
3573 static BC_STATUS zcommon_parse(BcParse *p)
3576 IF_BC(RETURN_STATUS(zbc_parse_stmt_or_funcdef(p));)
3578 IF_DC(RETURN_STATUS(zdc_parse_parse(p));)
3581 static BC_STATUS zbc_parse_text_init(BcParse *p, const char *text)
3583 p->func = bc_program_func(p->fidx);
3585 RETURN_STATUS(zbc_lex_text_init(&p->l, text));
3587 #if ERRORS_ARE_FATAL
3588 # define zbc_parse_text_init(...) (zbc_parse_text_init(__VA_ARGS__), BC_STATUS_SUCCESS)
3591 // Called when parsing or execution detects a failure,
3592 // resets execution structures.
3593 static void bc_program_reset(void)
3598 bc_vec_npop(&G.prog.stack, G.prog.stack.len - 1);
3599 bc_vec_pop_all(&G.prog.results);
3601 f = bc_program_func(0);
3602 ip = bc_vec_top(&G.prog.stack);
3603 ip->idx = f->code.len;
3606 #define bc_parse_updateFunc(p, f) \
3607 ((p)->func = bc_program_func((p)->fidx = (f)))
3609 // Called when zbc/zdc_parse_parse() detects a failure,
3610 // resets parsing structures.
3611 static void bc_parse_reset(BcParse *p)
3613 if (p->fidx != BC_PROG_MAIN) {
3614 p->func->nparams = 0;
3615 bc_vec_pop_all(&p->func->code);
3616 bc_vec_pop_all(&p->func->autos);
3617 bc_vec_pop_all(&p->func->labels);
3619 bc_parse_updateFunc(p, BC_PROG_MAIN);
3623 p->l.t.t = BC_LEX_EOF;
3625 bc_vec_pop_all(&p->exits);
3626 bc_vec_pop_all(&p->conds);
3627 bc_vec_pop_all(&p->ops);
3632 static void bc_parse_free(BcParse *p)
3634 bc_vec_free(&p->exits);
3635 bc_vec_free(&p->conds);
3636 bc_vec_free(&p->ops);
3640 static void bc_parse_create(BcParse *p, size_t func)
3642 memset(p, 0, sizeof(BcParse));
3645 bc_vec_init(&p->exits, sizeof(size_t), NULL);
3646 bc_vec_init(&p->conds, sizeof(size_t), NULL);
3647 bc_vec_init(&p->ops, sizeof(BcLexType), NULL);
3649 bc_parse_updateFunc(p, func);
3654 #define BC_PARSE_TOP_OP(p) (*((BcLexType *) bc_vec_top(&(p)->ops)))
3655 #define BC_PARSE_LEAF(p, rparen) \
3656 (((p) >= BC_INST_NUM && (p) <= BC_INST_SQRT) || (rparen) || \
3657 (p) == BC_INST_INC_POST || (p) == BC_INST_DEC_POST)
3659 // We can calculate the conversion between tokens and exprs by subtracting the
3660 // position of the first operator in the lex enum and adding the position of the
3661 // first in the expr enum. Note: This only works for binary operators.
3662 #define BC_TOKEN_2_INST(t) ((char) ((t) - BC_LEX_NEG + BC_INST_NEG))
3664 static BC_STATUS zbc_parse_stmt_possibly_auto(BcParse *p, bool auto_allowed);
3665 static BC_STATUS zbc_parse_expr(BcParse *p, uint8_t flags, BcParseNext next);
3666 static BcStatus bc_parse_expr_empty_ok(BcParse *p, uint8_t flags, BcParseNext next);
3667 #if ERRORS_ARE_FATAL
3668 # define zbc_parse_expr(...) (zbc_parse_expr(__VA_ARGS__), BC_STATUS_SUCCESS)
3669 # defone zbc_parse_stmt_possibly_auto(...) (zbc_parse_stmt_possibly_auto(__VA_ARGS__), BC_STATUS_SUCCESS)
3672 static BC_STATUS zbc_parse_stmt(BcParse *p)
3674 RETURN_STATUS(zbc_parse_stmt_possibly_auto(p, false));
3676 #if ERRORS_ARE_FATAL
3677 # define zbc_parse_stmt(...) (zbc_parse_stmt(__VA_ARGS__), BC_STATUS_SUCCESS)
3680 static BC_STATUS zbc_parse_stmt_fail_if_bare_NLINE(BcParse *p, bool auto_allowed, const char *after_X)
3682 if (p->l.t.t == BC_LEX_NLINE)
3683 RETURN_STATUS(bc_error_fmt("no statement after '%s'", after_X));
3684 RETURN_STATUS(zbc_parse_stmt_possibly_auto(p, auto_allowed));
3686 #if ERRORS_ARE_FATAL
3687 # define zbc_parse_stmt_fail_if_bare_NLINE(...) (zbc_parse_stmt_fail_if_bare_NLINE(__VA_ARGS__), BC_STATUS_SUCCESS)
3690 static void bc_parse_operator(BcParse *p, BcLexType type, size_t start,
3693 char l, r = bc_parse_op_PREC(type - BC_LEX_OP_INC);
3694 bool left = bc_parse_op_LEFT(type - BC_LEX_OP_INC);
3696 while (p->ops.len > start) {
3697 BcLexType t = BC_PARSE_TOP_OP(p);
3698 if (t == BC_LEX_LPAREN) break;
3700 l = bc_parse_op_PREC(t - BC_LEX_OP_INC);
3701 if (l >= r && (l != r || !left)) break;
3703 bc_parse_push(p, BC_TOKEN_2_INST(t));
3704 bc_vec_pop(&p->ops);
3705 *nexprs -= (t != BC_LEX_OP_BOOL_NOT && t != BC_LEX_NEG);
3708 bc_vec_push(&p->ops, &type);
3711 static BC_STATUS zbc_parse_rightParen(BcParse *p, size_t ops_bgn, size_t *nexs)
3715 if (p->ops.len <= ops_bgn)
3716 RETURN_STATUS(bc_error_bad_expression());
3717 top = BC_PARSE_TOP_OP(p);
3719 while (top != BC_LEX_LPAREN) {
3720 bc_parse_push(p, BC_TOKEN_2_INST(top));
3722 bc_vec_pop(&p->ops);
3723 *nexs -= top != BC_LEX_OP_BOOL_NOT && top != BC_LEX_NEG;
3725 if (p->ops.len <= ops_bgn)
3726 RETURN_STATUS(bc_error_bad_expression());
3727 top = BC_PARSE_TOP_OP(p);
3730 bc_vec_pop(&p->ops);
3732 RETURN_STATUS(zbc_lex_next(&p->l));
3734 #if ERRORS_ARE_FATAL
3735 # define zbc_parse_rightParen(...) (zbc_parse_rightParen(__VA_ARGS__), BC_STATUS_SUCCESS)
3738 static BC_STATUS zbc_parse_params(BcParse *p, uint8_t flags)
3744 dbg_lex("%s:%d p->l.t.t:%d", __func__, __LINE__, p->l.t.t);
3745 s = zbc_lex_next(&p->l);
3746 if (s) RETURN_STATUS(s);
3748 for (nparams = 0; p->l.t.t != BC_LEX_RPAREN; ++nparams) {
3749 flags = (flags & ~(BC_PARSE_PRINT | BC_PARSE_REL)) | BC_PARSE_ARRAY;
3750 s = zbc_parse_expr(p, flags, bc_parse_next_param);
3751 if (s) RETURN_STATUS(s);
3753 comma = p->l.t.t == BC_LEX_COMMA;
3755 s = zbc_lex_next(&p->l);
3756 if (s) RETURN_STATUS(s);
3760 if (comma) RETURN_STATUS(bc_error_bad_token());
3761 bc_parse_push(p, BC_INST_CALL);
3762 bc_parse_pushIndex(p, nparams);
3764 RETURN_STATUS(BC_STATUS_SUCCESS);
3766 #if ERRORS_ARE_FATAL
3767 # define zbc_parse_params(...) (zbc_parse_params(__VA_ARGS__), BC_STATUS_SUCCESS)
3770 static BC_STATUS zbc_parse_call(BcParse *p, char *name, uint8_t flags)
3773 BcId entry, *entry_ptr;
3778 s = zbc_parse_params(p, flags);
3781 if (p->l.t.t != BC_LEX_RPAREN) {
3782 s = bc_error_bad_token();
3786 idx = bc_map_index(&G.prog.fn_map, &entry);
3788 if (idx == BC_VEC_INVALID_IDX) {
3789 name = xstrdup(entry.name);
3790 bc_parse_addFunc(p, name, &idx);
3791 idx = bc_map_index(&G.prog.fn_map, &entry);
3796 entry_ptr = bc_vec_item(&G.prog.fn_map, idx);
3797 bc_parse_pushIndex(p, entry_ptr->idx);
3799 RETURN_STATUS(zbc_lex_next(&p->l));
3805 #if ERRORS_ARE_FATAL
3806 # define zbc_parse_call(...) (zbc_parse_call(__VA_ARGS__), BC_STATUS_SUCCESS)
3809 static BC_STATUS zbc_parse_name(BcParse *p, BcInst *type, uint8_t flags)
3814 name = xstrdup(p->l.t.v.v);
3815 s = zbc_lex_next(&p->l);
3818 if (p->l.t.t == BC_LEX_LBRACKET) {
3819 s = zbc_lex_next(&p->l);
3822 if (p->l.t.t == BC_LEX_RBRACKET) {
3823 if (!(flags & BC_PARSE_ARRAY)) {
3824 s = bc_error_bad_expression();
3827 *type = BC_INST_ARRAY;
3829 *type = BC_INST_ARRAY_ELEM;
3830 flags &= ~(BC_PARSE_PRINT | BC_PARSE_REL);
3831 s = zbc_parse_expr(p, flags, bc_parse_next_elem);
3834 s = zbc_lex_next(&p->l);
3836 bc_parse_push(p, *type);
3837 bc_parse_pushName(p, name);
3840 else if (p->l.t.t == BC_LEX_LPAREN) {
3841 if (flags & BC_PARSE_NOCALL) {
3842 s = bc_error_bad_token();
3845 *type = BC_INST_CALL;
3846 s = zbc_parse_call(p, name, flags);
3848 *type = BC_INST_VAR;
3849 bc_parse_push(p, BC_INST_VAR);
3850 bc_parse_pushName(p, name);
3860 #if ERRORS_ARE_FATAL
3861 # define zbc_parse_name(...) (zbc_parse_name(__VA_ARGS__), BC_STATUS_SUCCESS)
3864 static BC_STATUS zbc_parse_read(BcParse *p)
3868 s = zbc_lex_next(&p->l);
3869 if (s) RETURN_STATUS(s);
3870 if (p->l.t.t != BC_LEX_LPAREN) RETURN_STATUS(bc_error_bad_token());
3872 s = zbc_lex_next(&p->l);
3873 if (s) RETURN_STATUS(s);
3874 if (p->l.t.t != BC_LEX_RPAREN) RETURN_STATUS(bc_error_bad_token());
3876 bc_parse_push(p, BC_INST_READ);
3878 RETURN_STATUS(zbc_lex_next(&p->l));
3880 #if ERRORS_ARE_FATAL
3881 # define zbc_parse_read(...) (zbc_parse_read(__VA_ARGS__), BC_STATUS_SUCCESS)
3884 static BC_STATUS zbc_parse_builtin(BcParse *p, BcLexType type, uint8_t flags,
3889 s = zbc_lex_next(&p->l);
3890 if (s) RETURN_STATUS(s);
3891 if (p->l.t.t != BC_LEX_LPAREN) RETURN_STATUS(bc_error_bad_token());
3893 flags = (flags & ~(BC_PARSE_PRINT | BC_PARSE_REL)) | BC_PARSE_ARRAY;
3895 s = zbc_lex_next(&p->l);
3896 if (s) RETURN_STATUS(s);
3898 s = zbc_parse_expr(p, flags, bc_parse_next_rel);
3899 if (s) RETURN_STATUS(s);
3901 if (p->l.t.t != BC_LEX_RPAREN) RETURN_STATUS(bc_error_bad_token());
3903 *prev = (type == BC_LEX_KEY_LENGTH) ? BC_INST_LENGTH : BC_INST_SQRT;
3904 bc_parse_push(p, *prev);
3906 RETURN_STATUS(zbc_lex_next(&p->l));
3908 #if ERRORS_ARE_FATAL
3909 # define zbc_parse_builtin(...) (zbc_parse_builtin(__VA_ARGS__), BC_STATUS_SUCCESS)
3912 static BC_STATUS zbc_parse_scale(BcParse *p, BcInst *type, uint8_t flags)
3916 s = zbc_lex_next(&p->l);
3917 if (s) RETURN_STATUS(s);
3919 if (p->l.t.t != BC_LEX_LPAREN) {
3920 *type = BC_INST_SCALE;
3921 bc_parse_push(p, BC_INST_SCALE);
3922 RETURN_STATUS(BC_STATUS_SUCCESS);
3925 *type = BC_INST_SCALE_FUNC;
3926 flags &= ~(BC_PARSE_PRINT | BC_PARSE_REL);
3928 s = zbc_lex_next(&p->l);
3929 if (s) RETURN_STATUS(s);
3931 s = zbc_parse_expr(p, flags, bc_parse_next_rel);
3932 if (s) RETURN_STATUS(s);
3933 if (p->l.t.t != BC_LEX_RPAREN)
3934 RETURN_STATUS(bc_error_bad_token());
3935 bc_parse_push(p, BC_INST_SCALE_FUNC);
3937 RETURN_STATUS(zbc_lex_next(&p->l));
3939 #if ERRORS_ARE_FATAL
3940 # define zbc_parse_scale(...) (zbc_parse_scale(__VA_ARGS__), BC_STATUS_SUCCESS)
3943 static BC_STATUS zbc_parse_incdec(BcParse *p, BcInst *prev, bool *paren_expr,
3944 size_t *nexprs, uint8_t flags)
3949 BcInst etype = *prev;
3951 if (etype == BC_INST_VAR || etype == BC_INST_ARRAY_ELEM ||
3952 etype == BC_INST_SCALE || etype == BC_INST_LAST ||
3953 etype == BC_INST_IBASE || etype == BC_INST_OBASE)
3955 *prev = inst = BC_INST_INC_POST + (p->l.t.t != BC_LEX_OP_INC);
3956 bc_parse_push(p, inst);
3957 s = zbc_lex_next(&p->l);
3960 *prev = inst = BC_INST_INC_PRE + (p->l.t.t != BC_LEX_OP_INC);
3963 s = zbc_lex_next(&p->l);
3964 if (s) RETURN_STATUS(s);
3967 // Because we parse the next part of the expression
3968 // right here, we need to increment this.
3969 *nexprs = *nexprs + 1;
3973 s = zbc_parse_name(p, prev, flags | BC_PARSE_NOCALL);
3975 case BC_LEX_KEY_IBASE:
3976 case BC_LEX_KEY_LAST:
3977 case BC_LEX_KEY_OBASE:
3978 bc_parse_push(p, type - BC_LEX_KEY_IBASE + BC_INST_IBASE);
3979 s = zbc_lex_next(&p->l);
3981 case BC_LEX_KEY_SCALE:
3982 s = zbc_lex_next(&p->l);
3983 if (s) RETURN_STATUS(s);
3984 if (p->l.t.t == BC_LEX_LPAREN)
3985 s = bc_error_bad_token();
3987 bc_parse_push(p, BC_INST_SCALE);
3990 s = bc_error_bad_token();
3994 if (!s) bc_parse_push(p, inst);
3999 #if ERRORS_ARE_FATAL
4000 # define zbc_parse_incdec(...) (zbc_parse_incdec(__VA_ARGS__), BC_STATUS_SUCCESS)
4003 static BC_STATUS zbc_parse_minus(BcParse *p, BcInst *prev, size_t ops_bgn,
4004 bool rparen, size_t *nexprs)
4008 BcInst etype = *prev;
4010 s = zbc_lex_next(&p->l);
4011 if (s) RETURN_STATUS(s);
4013 type = rparen || etype == BC_INST_INC_POST || etype == BC_INST_DEC_POST ||
4014 (etype >= BC_INST_NUM && etype <= BC_INST_SQRT) ?
4017 *prev = BC_TOKEN_2_INST(type);
4019 // We can just push onto the op stack because this is the largest
4020 // precedence operator that gets pushed. Inc/dec does not.
4021 if (type != BC_LEX_OP_MINUS)
4022 bc_vec_push(&p->ops, &type);
4024 bc_parse_operator(p, type, ops_bgn, nexprs);
4028 #if ERRORS_ARE_FATAL
4029 # define zbc_parse_minus(...) (zbc_parse_minus(__VA_ARGS__), BC_STATUS_SUCCESS)
4032 static BC_STATUS zbc_parse_string(BcParse *p, char inst)
4034 char *str = xstrdup(p->l.t.v.v);
4036 bc_parse_push(p, BC_INST_STR);
4037 bc_parse_pushIndex(p, G.prog.strs.len);
4038 bc_vec_push(&G.prog.strs, &str);
4039 bc_parse_push(p, inst);
4041 RETURN_STATUS(zbc_lex_next(&p->l));
4043 #if ERRORS_ARE_FATAL
4044 # define zbc_parse_string(...) (zbc_parse_string(__VA_ARGS__), BC_STATUS_SUCCESS)
4047 static BC_STATUS zbc_parse_print(BcParse *p)
4053 s = zbc_lex_next(&p->l);
4054 if (s) RETURN_STATUS(s);
4056 if (type == BC_LEX_STR) {
4057 s = zbc_parse_string(p, BC_INST_PRINT_POP);
4059 s = zbc_parse_expr(p, 0, bc_parse_next_print);
4060 bc_parse_push(p, BC_INST_PRINT_POP);
4062 if (s) RETURN_STATUS(s);
4063 if (p->l.t.t != BC_LEX_COMMA)
4069 #if ERRORS_ARE_FATAL
4070 # define zbc_parse_print(...) (zbc_parse_print(__VA_ARGS__), BC_STATUS_SUCCESS)
4073 static BC_STATUS zbc_parse_return(BcParse *p)
4078 dbg_lex_enter("%s:%d entered", __func__, __LINE__);
4079 s = zbc_lex_next(&p->l);
4080 if (s) RETURN_STATUS(s);
4083 if (t == BC_LEX_NLINE || t == BC_LEX_SCOLON)
4084 bc_parse_push(p, BC_INST_RET0);
4086 bool paren = (t == BC_LEX_LPAREN);
4087 s = bc_parse_expr_empty_ok(p, 0, bc_parse_next_expr);
4088 if (s == BC_STATUS_PARSE_EMPTY_EXP) {
4089 bc_parse_push(p, BC_INST_RET0);
4090 s = zbc_lex_next(&p->l);
4092 if (s) RETURN_STATUS(s);
4094 if (!paren || p->l.t.last != BC_LEX_RPAREN) {
4095 s = bc_POSIX_requires("parentheses around return expressions");
4096 ERROR_RETURN(if (s) RETURN_STATUS(s);)
4099 bc_parse_push(p, BC_INST_RET);
4102 dbg_lex_done("%s:%d done", __func__, __LINE__);
4105 #if ERRORS_ARE_FATAL
4106 # define zbc_parse_return(...) (zbc_parse_return(__VA_ARGS__), BC_STATUS_SUCCESS)
4109 static BC_STATUS zbc_parse_if(BcParse *p)
4115 dbg_lex_enter("%s:%d entered", __func__, __LINE__);
4116 s = zbc_lex_next(&p->l);
4117 if (s) RETURN_STATUS(s);
4118 if (p->l.t.t != BC_LEX_LPAREN) RETURN_STATUS(bc_error_bad_token());
4120 s = zbc_lex_next(&p->l);
4121 if (s) RETURN_STATUS(s);
4122 s = zbc_parse_expr(p, BC_PARSE_REL, bc_parse_next_rel);
4123 if (s) RETURN_STATUS(s);
4125 if (p->l.t.t != BC_LEX_RPAREN) RETURN_STATUS(bc_error_bad_token());
4126 // if(cond)<newline>stmt is accepted too (but not 2+ newlines)
4127 s = zbc_lex_next_and_skip_NLINE(&p->l);
4128 if (s) RETURN_STATUS(s);
4130 bc_parse_push(p, BC_INST_JUMP_ZERO);
4131 ip_idx = p->func->labels.len;
4132 bc_parse_pushIndex(p, ip_idx);
4133 bc_vec_push(&p->func->labels, &ip_idx);
4135 s = zbc_parse_stmt_fail_if_bare_NLINE(p, false, "if");
4136 if (s) RETURN_STATUS(s);
4138 dbg_lex("%s:%d in if after stmt: p->l.t.t:%d", __func__, __LINE__, p->l.t.t);
4139 if (p->l.t.t == BC_LEX_KEY_ELSE) {
4142 s = zbc_lex_next_and_skip_NLINE(&p->l);
4143 if (s) RETURN_STATUS(s);
4145 ip2_idx = p->func->labels.len;
4147 dbg_lex("%s:%d after if() body: BC_INST_JUMP to %d", __func__, __LINE__, ip2_idx);
4148 bc_parse_push(p, BC_INST_JUMP);
4149 bc_parse_pushIndex(p, ip2_idx);
4151 label = bc_vec_item(&p->func->labels, ip_idx);
4152 dbg_lex("%s:%d rewriting 'if_zero' label to jump to 'else': %d -> %d", __func__, __LINE__, *label, p->func->code.len);
4153 *label = p->func->code.len;
4155 bc_vec_push(&p->func->labels, &ip2_idx);
4158 s = zbc_parse_stmt_fail_if_bare_NLINE(p, false, "else");
4159 if (s) RETURN_STATUS(s);
4162 label = bc_vec_item(&p->func->labels, ip_idx);
4163 dbg_lex("%s:%d rewriting label to jump after 'if' body: %d -> %d", __func__, __LINE__, *label, p->func->code.len);
4164 *label = p->func->code.len;
4166 dbg_lex_done("%s:%d done", __func__, __LINE__);
4169 #if ERRORS_ARE_FATAL
4170 # define zbc_parse_if(...) (zbc_parse_if(__VA_ARGS__), BC_STATUS_SUCCESS)
4173 static BC_STATUS zbc_parse_while(BcParse *p)
4180 s = zbc_lex_next(&p->l);
4181 if (s) RETURN_STATUS(s);
4182 if (p->l.t.t != BC_LEX_LPAREN) RETURN_STATUS(bc_error_bad_token());
4183 s = zbc_lex_next(&p->l);
4184 if (s) RETURN_STATUS(s);
4186 cond_idx = p->func->labels.len;
4188 bc_vec_push(&p->func->labels, &p->func->code.len);
4189 bc_vec_push(&p->conds, &cond_idx);
4191 ip.idx = p->func->labels.len;
4195 bc_vec_push(&p->exits, &ip.idx);
4196 bc_vec_push(&p->func->labels, &ip.idx);
4198 s = zbc_parse_expr(p, BC_PARSE_REL, bc_parse_next_rel);
4199 if (s) RETURN_STATUS(s);
4200 if (p->l.t.t != BC_LEX_RPAREN) RETURN_STATUS(bc_error_bad_token());
4202 // while(cond)<newline>stmt is accepted too
4203 s = zbc_lex_next_and_skip_NLINE(&p->l);
4204 if (s) RETURN_STATUS(s);
4206 bc_parse_push(p, BC_INST_JUMP_ZERO);
4207 bc_parse_pushIndex(p, ip.idx);
4209 s = zbc_parse_stmt_fail_if_bare_NLINE(p, false, "while");
4210 if (s) RETURN_STATUS(s);
4212 dbg_lex("%s:%d BC_INST_JUMP to %d", __func__, __LINE__, cond_idx);
4213 bc_parse_push(p, BC_INST_JUMP);
4214 bc_parse_pushIndex(p, cond_idx);
4216 label = bc_vec_item(&p->func->labels, ip.idx);
4217 dbg_lex("%s:%d rewriting label: %d -> %d", __func__, __LINE__, *label, p->func->code.len);
4218 *label = p->func->code.len;
4220 bc_vec_pop(&p->exits);
4221 bc_vec_pop(&p->conds);
4225 #if ERRORS_ARE_FATAL
4226 # define zbc_parse_while(...) (zbc_parse_while(__VA_ARGS__), BC_STATUS_SUCCESS)
4229 static BC_STATUS zbc_parse_for(BcParse *p)
4234 size_t cond_idx, exit_idx, body_idx, update_idx;
4236 dbg_lex("%s:%d p->l.t.t:%d", __func__, __LINE__, p->l.t.t);
4237 s = zbc_lex_next(&p->l);
4238 if (s) RETURN_STATUS(s);
4239 if (p->l.t.t != BC_LEX_LPAREN) RETURN_STATUS(bc_error_bad_token());
4240 s = zbc_lex_next(&p->l);
4241 if (s) RETURN_STATUS(s);
4243 if (p->l.t.t != BC_LEX_SCOLON)
4244 s = zbc_parse_expr(p, 0, bc_parse_next_for);
4246 s = bc_POSIX_does_not_allow_empty_X_expression_in_for("init");
4248 if (s) RETURN_STATUS(s);
4249 if (p->l.t.t != BC_LEX_SCOLON) RETURN_STATUS(bc_error_bad_token());
4250 s = zbc_lex_next(&p->l);
4251 if (s) RETURN_STATUS(s);
4253 cond_idx = p->func->labels.len;
4254 update_idx = cond_idx + 1;
4255 body_idx = update_idx + 1;
4256 exit_idx = body_idx + 1;
4258 bc_vec_push(&p->func->labels, &p->func->code.len);
4260 if (p->l.t.t != BC_LEX_SCOLON)
4261 s = zbc_parse_expr(p, BC_PARSE_REL, bc_parse_next_for);
4263 s = bc_POSIX_does_not_allow_empty_X_expression_in_for("condition");
4265 if (s) RETURN_STATUS(s);
4266 if (p->l.t.t != BC_LEX_SCOLON) RETURN_STATUS(bc_error_bad_token());
4268 s = zbc_lex_next(&p->l);
4269 if (s) RETURN_STATUS(s);
4271 bc_parse_push(p, BC_INST_JUMP_ZERO);
4272 bc_parse_pushIndex(p, exit_idx);
4273 bc_parse_push(p, BC_INST_JUMP);
4274 bc_parse_pushIndex(p, body_idx);
4276 ip.idx = p->func->labels.len;
4278 bc_vec_push(&p->conds, &update_idx);
4279 bc_vec_push(&p->func->labels, &p->func->code.len);
4281 if (p->l.t.t != BC_LEX_RPAREN)
4282 s = zbc_parse_expr(p, 0, bc_parse_next_rel);
4284 s = bc_POSIX_does_not_allow_empty_X_expression_in_for("update");
4286 if (s) RETURN_STATUS(s);
4288 if (p->l.t.t != BC_LEX_RPAREN) RETURN_STATUS(bc_error_bad_token());
4289 bc_parse_push(p, BC_INST_JUMP);
4290 bc_parse_pushIndex(p, cond_idx);
4291 bc_vec_push(&p->func->labels, &p->func->code.len);
4297 bc_vec_push(&p->exits, &ip.idx);
4298 bc_vec_push(&p->func->labels, &ip.idx);
4300 // for(...)<newline>stmt is accepted as well
4301 s = zbc_lex_next_and_skip_NLINE(&p->l);
4302 if (s) RETURN_STATUS(s);
4304 s = zbc_parse_stmt_fail_if_bare_NLINE(p, false, "for");
4305 if (s) RETURN_STATUS(s);
4307 //TODO: commonalize?
4308 dbg_lex("%s:%d BC_INST_JUMP to %d", __func__, __LINE__, update_idx);
4309 bc_parse_push(p, BC_INST_JUMP);
4310 bc_parse_pushIndex(p, update_idx);
4312 label = bc_vec_item(&p->func->labels, ip.idx);
4313 dbg_lex("%s:%d rewriting label: %d -> %d", __func__, __LINE__, *label, p->func->code.len);
4314 *label = p->func->code.len;
4316 bc_vec_pop(&p->exits);
4317 bc_vec_pop(&p->conds);
4319 RETURN_STATUS(BC_STATUS_SUCCESS);
4321 #if ERRORS_ARE_FATAL
4322 # define zbc_parse_for(...) (zbc_parse_for(__VA_ARGS__), BC_STATUS_SUCCESS)
4325 static BC_STATUS zbc_parse_break_or_continue(BcParse *p, BcLexType type)
4330 if (type == BC_LEX_KEY_BREAK) {
4331 if (p->exits.len == 0) // none of the enclosing blocks is a loop
4332 RETURN_STATUS(bc_error_bad_token());
4333 i = *(size_t*)bc_vec_top(&p->exits);
4335 i = *(size_t*)bc_vec_top(&p->conds);
4338 bc_parse_push(p, BC_INST_JUMP);
4339 bc_parse_pushIndex(p, i);
4341 s = zbc_lex_next(&p->l);
4342 if (s) RETURN_STATUS(s);
4344 if (p->l.t.t != BC_LEX_SCOLON && p->l.t.t != BC_LEX_NLINE)
4345 RETURN_STATUS(bc_error_bad_token());
4347 RETURN_STATUS(zbc_lex_next(&p->l));
4349 #if ERRORS_ARE_FATAL
4350 # define zbc_parse_break_or_continue(...) (zbc_parse_break_or_continue(__VA_ARGS__), BC_STATUS_SUCCESS)
4353 static BC_STATUS zbc_parse_funcdef(BcParse *p)
4356 bool var, comma = false;
4359 s = zbc_lex_next(&p->l);
4360 if (s) RETURN_STATUS(s);
4361 if (p->l.t.t != BC_LEX_NAME)
4362 RETURN_STATUS(bc_error("bad function definition"));
4364 name = xstrdup(p->l.t.v.v);
4365 bc_parse_addFunc(p, name, &p->fidx);
4367 s = zbc_lex_next(&p->l);
4368 if (s) RETURN_STATUS(s);
4369 if (p->l.t.t != BC_LEX_LPAREN)
4370 RETURN_STATUS(bc_error("bad function definition"));
4371 s = zbc_lex_next(&p->l);
4372 if (s) RETURN_STATUS(s);
4374 while (p->l.t.t != BC_LEX_RPAREN) {
4375 if (p->l.t.t != BC_LEX_NAME)
4376 RETURN_STATUS(bc_error("bad function definition"));
4380 name = xstrdup(p->l.t.v.v);
4381 s = zbc_lex_next(&p->l);
4384 var = p->l.t.t != BC_LEX_LBRACKET;
4387 s = zbc_lex_next(&p->l);
4390 if (p->l.t.t != BC_LEX_RBRACKET) {
4391 s = bc_error("bad function definition");
4395 s = zbc_lex_next(&p->l);
4399 comma = p->l.t.t == BC_LEX_COMMA;
4401 s = zbc_lex_next(&p->l);
4405 s = zbc_func_insert(p->func, name, var);
4409 if (comma) RETURN_STATUS(bc_error("bad function definition"));
4411 s = zbc_lex_next(&p->l);
4412 if (s) RETURN_STATUS(s);
4414 if (p->l.t.t != BC_LEX_LBRACE)
4415 s = bc_POSIX_requires("the left brace be on the same line as the function header");
4417 // Prevent "define z()<newline>" from being interpreted as function with empty stmt as body
4418 s = zbc_lex_skip_if_at_NLINE(&p->l);
4419 if (s) RETURN_STATUS(s);
4420 //TODO: GNU bc requires a {} block even if function body has single stmt, enforce this?
4422 p->in_funcdef++; // to determine whether "return" stmt is allowed, and such
4423 s = zbc_parse_stmt_fail_if_bare_NLINE(p, true, "define");
4425 if (s) RETURN_STATUS(s);
4427 bc_parse_push(p, BC_INST_RET0);
4428 bc_parse_updateFunc(p, BC_PROG_MAIN);
4436 #if ERRORS_ARE_FATAL
4437 # define zbc_parse_funcdef(...) (zbc_parse_funcdef(__VA_ARGS__), BC_STATUS_SUCCESS)
4440 static BC_STATUS zbc_parse_auto(BcParse *p)
4443 bool comma, var, one;
4446 dbg_lex_enter("%s:%d entered", __func__, __LINE__);
4447 s = zbc_lex_next(&p->l);
4448 if (s) RETURN_STATUS(s);
4451 one = p->l.t.t == BC_LEX_NAME;
4453 while (p->l.t.t == BC_LEX_NAME) {
4454 name = xstrdup(p->l.t.v.v);
4455 s = zbc_lex_next(&p->l);
4458 var = p->l.t.t != BC_LEX_LBRACKET;
4460 s = zbc_lex_next(&p->l);
4463 if (p->l.t.t != BC_LEX_RBRACKET) {
4464 s = bc_error("bad function definition");
4468 s = zbc_lex_next(&p->l);
4472 comma = p->l.t.t == BC_LEX_COMMA;
4474 s = zbc_lex_next(&p->l);
4478 s = zbc_func_insert(p->func, name, var);
4482 if (comma) RETURN_STATUS(bc_error("bad function definition"));
4483 if (!one) RETURN_STATUS(bc_error("no auto variable found"));
4485 if (p->l.t.t != BC_LEX_NLINE && p->l.t.t != BC_LEX_SCOLON)
4486 RETURN_STATUS(bc_error_bad_token());
4488 dbg_lex_done("%s:%d done", __func__, __LINE__);
4489 RETURN_STATUS(zbc_lex_next(&p->l));
4493 dbg_lex_done("%s:%d done (ERROR)", __func__, __LINE__);
4496 #if ERRORS_ARE_FATAL
4497 # define zbc_parse_auto(...) (zbc_parse_auto(__VA_ARGS__), BC_STATUS_SUCCESS)
4500 #undef zbc_parse_stmt_possibly_auto
4501 static BC_STATUS zbc_parse_stmt_possibly_auto(BcParse *p, bool auto_allowed)
4503 BcStatus s = BC_STATUS_SUCCESS;
4505 dbg_lex_enter("%s:%d entered, p->l.t.t:%d", __func__, __LINE__, p->l.t.t);
4507 if (p->l.t.t == BC_LEX_NLINE) {
4508 dbg_lex_done("%s:%d done (seen BC_LEX_NLINE)", __func__, __LINE__);
4509 RETURN_STATUS(zbc_lex_next(&p->l));
4511 if (p->l.t.t == BC_LEX_SCOLON) {
4512 dbg_lex_done("%s:%d done (seen BC_LEX_SCOLON)", __func__, __LINE__);
4513 RETURN_STATUS(zbc_lex_next(&p->l));
4516 if (p->l.t.t == BC_LEX_LBRACE) {
4517 dbg_lex("%s:%d BC_LEX_LBRACE: (auto_allowed:%d)", __func__, __LINE__, auto_allowed);
4519 s = zbc_lex_next(&p->l);
4520 if (s) RETURN_STATUS(s);
4521 } while (p->l.t.t == BC_LEX_NLINE);
4522 if (auto_allowed && p->l.t.t == BC_LEX_KEY_AUTO) {
4523 dbg_lex("%s:%d calling zbc_parse_auto()", __func__, __LINE__);
4524 s = zbc_parse_auto(p);
4525 if (s) RETURN_STATUS(s);
4527 while (p->l.t.t != BC_LEX_RBRACE) {
4528 dbg_lex("%s:%d block parsing loop", __func__, __LINE__);
4529 s = zbc_parse_stmt(p);
4530 if (s) RETURN_STATUS(s);
4532 s = zbc_lex_next(&p->l);
4533 dbg_lex_done("%s:%d done (seen BC_LEX_RBRACE)", __func__, __LINE__);
4537 dbg_lex("%s:%d p->l.t.t:%d", __func__, __LINE__, p->l.t.t);
4541 case BC_LEX_OP_MINUS:
4542 case BC_LEX_OP_BOOL_NOT:
4546 case BC_LEX_KEY_IBASE:
4547 case BC_LEX_KEY_LAST:
4548 case BC_LEX_KEY_LENGTH:
4549 case BC_LEX_KEY_OBASE:
4550 case BC_LEX_KEY_READ:
4551 case BC_LEX_KEY_SCALE:
4552 case BC_LEX_KEY_SQRT:
4553 s = zbc_parse_expr(p, BC_PARSE_PRINT, bc_parse_next_expr);
4556 s = zbc_parse_string(p, BC_INST_PRINT_STR);
4558 case BC_LEX_KEY_BREAK:
4559 case BC_LEX_KEY_CONTINUE:
4560 s = zbc_parse_break_or_continue(p, p->l.t.t);
4562 case BC_LEX_KEY_FOR:
4563 s = zbc_parse_for(p);
4565 case BC_LEX_KEY_HALT:
4566 bc_parse_push(p, BC_INST_HALT);
4567 s = zbc_lex_next(&p->l);
4570 s = zbc_parse_if(p);
4572 case BC_LEX_KEY_LIMITS:
4573 // "limits" is a compile-time command,
4574 // the output is produced at _parse time_.
4576 "BC_BASE_MAX = "BC_MAX_OBASE_STR "\n"
4577 "BC_DIM_MAX = "BC_MAX_DIM_STR "\n"
4578 "BC_SCALE_MAX = "BC_MAX_SCALE_STR "\n"
4579 "BC_STRING_MAX = "BC_MAX_STRING_STR"\n"
4580 "BC_NAME_MAX = "BC_MAX_NAME_STR "\n"
4581 "BC_NUM_MAX = "BC_MAX_NUM_STR "\n"
4582 "MAX Exponent = "BC_MAX_EXP_STR "\n"
4583 "Number of vars = "BC_MAX_VARS_STR "\n"
4585 s = zbc_lex_next(&p->l);
4587 case BC_LEX_KEY_PRINT:
4588 s = zbc_parse_print(p);
4590 case BC_LEX_KEY_QUIT:
4591 // "quit" is a compile-time command. For example,
4592 // "if (0 == 1) quit" terminates when parsing the statement,
4593 // not when it is executed
4594 QUIT_OR_RETURN_TO_MAIN;
4595 case BC_LEX_KEY_RETURN:
4597 RETURN_STATUS(bc_error("'return' not in a function"));
4598 s = zbc_parse_return(p);
4600 case BC_LEX_KEY_WHILE:
4601 s = zbc_parse_while(p);
4604 s = bc_error_bad_token();
4608 if (s || G_interrupt) {
4610 s = BC_STATUS_FAILURE;
4613 dbg_lex_done("%s:%d done", __func__, __LINE__);
4616 #if ERRORS_ARE_FATAL
4617 # define zbc_parse_stmt_possibly_auto(...) (zbc_parse_stmt_possibly_auto(__VA_ARGS__), BC_STATUS_SUCCESS)
4620 static BC_STATUS zbc_parse_stmt_or_funcdef(BcParse *p)
4624 dbg_lex_enter("%s:%d entered", __func__, __LINE__);
4625 if (p->l.t.t == BC_LEX_EOF)
4626 s = bc_error("end of file");
4627 else if (p->l.t.t == BC_LEX_KEY_DEFINE) {
4628 dbg_lex("%s:%d p->l.t.t:BC_LEX_KEY_DEFINE", __func__, __LINE__);
4629 s = zbc_parse_funcdef(p);
4631 dbg_lex("%s:%d p->l.t.t:%d (not BC_LEX_KEY_DEFINE)", __func__, __LINE__, p->l.t.t);
4632 s = zbc_parse_stmt(p);
4635 dbg_lex_done("%s:%d done", __func__, __LINE__);
4638 #if ERRORS_ARE_FATAL
4639 # define zbc_parse_stmt_or_funcdef(...) (zbc_parse_stmt_or_funcdef(__VA_ARGS__), BC_STATUS_SUCCESS)
4642 // This is not a "z" function: can also return BC_STATUS_PARSE_EMPTY_EXP
4643 static BcStatus bc_parse_expr_empty_ok(BcParse *p, uint8_t flags, BcParseNext next)
4645 BcStatus s = BC_STATUS_SUCCESS;
4646 BcInst prev = BC_INST_PRINT;
4647 BcLexType top, t = p->l.t.t;
4648 size_t nexprs = 0, ops_bgn = p->ops.len;
4649 unsigned nparens, nrelops;
4650 bool paren_first, paren_expr, rprn, done, get_token, assign, bin_last;
4652 dbg_lex_enter("%s:%d entered", __func__, __LINE__);
4653 paren_first = p->l.t.t == BC_LEX_LPAREN;
4654 nparens = nrelops = 0;
4655 paren_expr = rprn = done = get_token = assign = false;
4658 for (; !G_interrupt && !s && !done && bc_parse_exprs(t); t = p->l.t.t) {
4664 s = zbc_parse_incdec(p, &prev, &paren_expr, &nexprs, flags);
4665 rprn = get_token = bin_last = false;
4669 case BC_LEX_OP_MINUS:
4671 s = zbc_parse_minus(p, &prev, ops_bgn, rprn, &nexprs);
4672 rprn = get_token = false;
4673 bin_last = prev == BC_INST_MINUS;
4677 case BC_LEX_OP_ASSIGN_POWER:
4678 case BC_LEX_OP_ASSIGN_MULTIPLY:
4679 case BC_LEX_OP_ASSIGN_DIVIDE:
4680 case BC_LEX_OP_ASSIGN_MODULUS:
4681 case BC_LEX_OP_ASSIGN_PLUS:
4682 case BC_LEX_OP_ASSIGN_MINUS:
4683 case BC_LEX_OP_ASSIGN:
4685 if (prev != BC_INST_VAR && prev != BC_INST_ARRAY_ELEM &&
4686 prev != BC_INST_SCALE && prev != BC_INST_IBASE &&
4687 prev != BC_INST_OBASE && prev != BC_INST_LAST)
4689 s = bc_error("bad assignment:"
4690 " left side must be variable"
4692 ); // note: shared string
4697 case BC_LEX_OP_POWER:
4698 case BC_LEX_OP_MULTIPLY:
4699 case BC_LEX_OP_DIVIDE:
4700 case BC_LEX_OP_MODULUS:
4701 case BC_LEX_OP_PLUS:
4702 case BC_LEX_OP_REL_EQ:
4703 case BC_LEX_OP_REL_LE:
4704 case BC_LEX_OP_REL_GE:
4705 case BC_LEX_OP_REL_NE:
4706 case BC_LEX_OP_REL_LT:
4707 case BC_LEX_OP_REL_GT:
4708 case BC_LEX_OP_BOOL_NOT:
4709 case BC_LEX_OP_BOOL_OR:
4710 case BC_LEX_OP_BOOL_AND:
4712 if (((t == BC_LEX_OP_BOOL_NOT) != bin_last)
4713 || (t != BC_LEX_OP_BOOL_NOT && prev == BC_INST_BOOL_NOT)
4715 return bc_error_bad_expression();
4718 nrelops += t >= BC_LEX_OP_REL_EQ && t <= BC_LEX_OP_REL_GT;
4719 prev = BC_TOKEN_2_INST(t);
4720 bc_parse_operator(p, t, ops_bgn, &nexprs);
4721 s = zbc_lex_next(&p->l);
4722 rprn = get_token = false;
4723 bin_last = t != BC_LEX_OP_BOOL_NOT;
4730 if (BC_PARSE_LEAF(prev, rprn))
4731 return bc_error_bad_expression();
4733 paren_expr = rprn = bin_last = false;
4735 bc_vec_push(&p->ops, &t);
4742 if (bin_last || prev == BC_INST_BOOL_NOT)
4743 return bc_error_bad_expression();
4746 s = BC_STATUS_SUCCESS;
4751 else if (!paren_expr) {
4752 dbg_lex_done("%s:%d done (returning EMPTY_EXP)", __func__, __LINE__);
4753 return BC_STATUS_PARSE_EMPTY_EXP;
4757 paren_expr = rprn = true;
4758 get_token = bin_last = false;
4760 s = zbc_parse_rightParen(p, ops_bgn, &nexprs);
4767 if (BC_PARSE_LEAF(prev, rprn))
4768 return bc_error_bad_expression();
4770 rprn = get_token = bin_last = false;
4771 s = zbc_parse_name(p, &prev, flags & ~BC_PARSE_NOCALL);
4779 if (BC_PARSE_LEAF(prev, rprn))
4780 return bc_error_bad_expression();
4784 paren_expr = get_token = true;
4785 rprn = bin_last = false;
4790 case BC_LEX_KEY_IBASE:
4791 case BC_LEX_KEY_LAST:
4792 case BC_LEX_KEY_OBASE:
4794 if (BC_PARSE_LEAF(prev, rprn))
4795 return bc_error_bad_expression();
4796 prev = (char) (t - BC_LEX_KEY_IBASE + BC_INST_IBASE);
4797 bc_parse_push(p, (char) prev);
4799 paren_expr = get_token = true;
4800 rprn = bin_last = false;
4806 case BC_LEX_KEY_LENGTH:
4807 case BC_LEX_KEY_SQRT:
4809 if (BC_PARSE_LEAF(prev, rprn))
4810 return bc_error_bad_expression();
4811 s = zbc_parse_builtin(p, t, flags, &prev);
4813 rprn = get_token = bin_last = false;
4819 case BC_LEX_KEY_READ:
4821 if (BC_PARSE_LEAF(prev, rprn))
4822 return bc_error_bad_expression();
4823 else if (flags & BC_PARSE_NOREAD)
4824 s = bc_error_nested_read_call();
4826 s = zbc_parse_read(p);
4829 rprn = get_token = bin_last = false;
4831 prev = BC_INST_READ;
4836 case BC_LEX_KEY_SCALE:
4838 if (BC_PARSE_LEAF(prev, rprn))
4839 return bc_error_bad_expression();
4840 s = zbc_parse_scale(p, &prev, flags);
4842 rprn = get_token = bin_last = false;
4844 prev = BC_INST_SCALE;
4851 s = bc_error_bad_token();
4856 if (!s && get_token) s = zbc_lex_next(&p->l);
4860 if (G_interrupt) return BC_STATUS_FAILURE; // ^C: stop parsing
4862 while (p->ops.len > ops_bgn) {
4864 top = BC_PARSE_TOP_OP(p);
4865 assign = top >= BC_LEX_OP_ASSIGN_POWER && top <= BC_LEX_OP_ASSIGN;
4867 if (top == BC_LEX_LPAREN || top == BC_LEX_RPAREN)
4868 return bc_error_bad_expression();
4870 bc_parse_push(p, BC_TOKEN_2_INST(top));
4872 nexprs -= top != BC_LEX_OP_BOOL_NOT && top != BC_LEX_NEG;
4873 bc_vec_pop(&p->ops);
4876 if (prev == BC_INST_BOOL_NOT || nexprs != 1)
4877 return bc_error_bad_expression();
4879 //TODO: why is this needed at all?
4880 // next is BcParseNext, byte array of up to 4 BC_LEX's, packed into 32-bit word
4882 if (t == (next & 0x7f))
4884 if (next & 0x80) // last element?
4888 if (t != BC_LEX_KEY_ELSE)
4889 return bc_error_bad_expression();
4892 if (!(flags & BC_PARSE_REL) && nrelops) {
4893 s = bc_POSIX_does_not_allow("comparison operators outside if or loops");
4894 ERROR_RETURN(if (s) return s;)
4896 else if ((flags & BC_PARSE_REL) && nrelops > 1) {
4897 s = bc_POSIX_requires("exactly one comparison operator per condition");
4898 ERROR_RETURN(if (s) return s;)
4901 if (flags & BC_PARSE_PRINT) {
4902 if (paren_first || !assign) bc_parse_push(p, BC_INST_PRINT);
4903 bc_parse_push(p, BC_INST_POP);
4906 dbg_lex_done("%s:%d done", __func__, __LINE__);
4910 #undef zbc_parse_expr
4911 static BC_STATUS zbc_parse_expr(BcParse *p, uint8_t flags, BcParseNext next)
4915 s = bc_parse_expr_empty_ok(p, flags, next);
4916 if (s == BC_STATUS_PARSE_EMPTY_EXP)
4917 RETURN_STATUS(bc_error("empty expression"));
4920 #if ERRORS_ARE_FATAL
4921 # define zbc_parse_expr(...) (zbc_parse_expr(__VA_ARGS__), BC_STATUS_SUCCESS)
4928 #define DC_PARSE_BUF_LEN ((int) (sizeof(uint32_t) * CHAR_BIT))
4930 static BC_STATUS zdc_parse_register(BcParse *p)
4934 s = zbc_lex_next(&p->l);
4935 if (s) RETURN_STATUS(s);
4936 if (p->l.t.t != BC_LEX_NAME) RETURN_STATUS(bc_error_bad_token());
4938 bc_parse_pushName(p, p->l.t.v.v);
4942 #if ERRORS_ARE_FATAL
4943 # define zdc_parse_register(...) (zdc_parse_register(__VA_ARGS__), BC_STATUS_SUCCESS)
4946 static BC_STATUS zdc_parse_string(BcParse *p)
4948 char *str, *name, b[DC_PARSE_BUF_LEN + 1];
4949 size_t idx, len = G.prog.strs.len;
4951 sprintf(b, "%0*zu", DC_PARSE_BUF_LEN, len);
4954 str = xstrdup(p->l.t.v.v);
4955 bc_parse_push(p, BC_INST_STR);
4956 bc_parse_pushIndex(p, len);
4957 bc_vec_push(&G.prog.strs, &str);
4958 bc_parse_addFunc(p, name, &idx);
4960 RETURN_STATUS(zbc_lex_next(&p->l));
4962 #if ERRORS_ARE_FATAL
4963 # define zdc_parse_string(...) (zdc_parse_string(__VA_ARGS__), BC_STATUS_SUCCESS)
4966 static BC_STATUS zdc_parse_mem(BcParse *p, uint8_t inst, bool name, bool store)
4970 bc_parse_push(p, inst);
4972 s = zdc_parse_register(p);
4973 if (s) RETURN_STATUS(s);
4977 bc_parse_push(p, BC_INST_SWAP);
4978 bc_parse_push(p, BC_INST_ASSIGN);
4979 bc_parse_push(p, BC_INST_POP);
4982 RETURN_STATUS(zbc_lex_next(&p->l));
4984 #if ERRORS_ARE_FATAL
4985 # define zdc_parse_mem(...) (zdc_parse_mem(__VA_ARGS__), BC_STATUS_SUCCESS)
4988 static BC_STATUS zdc_parse_cond(BcParse *p, uint8_t inst)
4992 bc_parse_push(p, inst);
4993 bc_parse_push(p, BC_INST_EXEC_COND);
4995 s = zdc_parse_register(p);
4996 if (s) RETURN_STATUS(s);
4998 s = zbc_lex_next(&p->l);
4999 if (s) RETURN_STATUS(s);
5001 if (p->l.t.t == BC_LEX_ELSE) {
5002 s = zdc_parse_register(p);
5003 if (s) RETURN_STATUS(s);
5004 s = zbc_lex_next(&p->l);
5007 bc_parse_push(p, BC_PARSE_STREND);
5011 #if ERRORS_ARE_FATAL
5012 # define zdc_parse_cond(...) (zdc_parse_cond(__VA_ARGS__), BC_STATUS_SUCCESS)
5015 static BC_STATUS zdc_parse_token(BcParse *p, BcLexType t, uint8_t flags)
5017 BcStatus s = BC_STATUS_SUCCESS;
5020 bool assign, get_token = false;
5023 case BC_LEX_OP_REL_EQ:
5024 case BC_LEX_OP_REL_LE:
5025 case BC_LEX_OP_REL_GE:
5026 case BC_LEX_OP_REL_NE:
5027 case BC_LEX_OP_REL_LT:
5028 case BC_LEX_OP_REL_GT:
5029 s = zdc_parse_cond(p, t - BC_LEX_OP_REL_EQ + BC_INST_REL_EQ);
5033 s = zdc_parse_mem(p, BC_INST_ARRAY_ELEM, true, t == BC_LEX_COLON);
5036 s = zdc_parse_string(p);
5040 if (t == BC_LEX_NEG) {
5041 s = zbc_lex_next(&p->l);
5042 if (s) RETURN_STATUS(s);
5043 if (p->l.t.t != BC_LEX_NUMBER)
5044 RETURN_STATUS(bc_error_bad_token());
5048 if (t == BC_LEX_NEG) bc_parse_push(p, BC_INST_NEG);
5051 case BC_LEX_KEY_READ:
5052 if (flags & BC_PARSE_NOREAD)
5053 s = bc_error_nested_read_call();
5055 bc_parse_push(p, BC_INST_READ);
5058 case BC_LEX_OP_ASSIGN:
5059 case BC_LEX_STORE_PUSH:
5060 assign = t == BC_LEX_OP_ASSIGN;
5061 inst = assign ? BC_INST_VAR : BC_INST_PUSH_TO_VAR;
5062 s = zdc_parse_mem(p, inst, true, assign);
5065 case BC_LEX_LOAD_POP:
5066 inst = t == BC_LEX_LOAD_POP ? BC_INST_PUSH_VAR : BC_INST_LOAD;
5067 s = zdc_parse_mem(p, inst, true, false);
5069 case BC_LEX_STORE_IBASE:
5070 case BC_LEX_STORE_SCALE:
5071 case BC_LEX_STORE_OBASE:
5072 inst = t - BC_LEX_STORE_IBASE + BC_INST_IBASE;
5073 s = zdc_parse_mem(p, inst, false, true);
5076 s = bc_error_bad_token();
5081 if (!s && get_token) s = zbc_lex_next(&p->l);
5085 #if ERRORS_ARE_FATAL
5086 # define zdc_parse_token(...) (zdc_parse_token(__VA_ARGS__), BC_STATUS_SUCCESS)
5089 static BC_STATUS zdc_parse_expr(BcParse *p, uint8_t flags)
5091 BcStatus s = BC_STATUS_SUCCESS;
5095 for (t = p->l.t.t; !s && t != BC_LEX_EOF; t = p->l.t.t) {
5096 inst = dc_parse_insts[t];
5098 if (inst != BC_INST_INVALID) {
5099 bc_parse_push(p, inst);
5100 s = zbc_lex_next(&p->l);
5102 s = zdc_parse_token(p, t, flags);
5105 if (!s && p->l.t.t == BC_LEX_EOF && (flags & BC_PARSE_NOCALL))
5106 bc_parse_push(p, BC_INST_POP_EXEC);
5110 #if ERRORS_ARE_FATAL
5111 # define zdc_parse_expr(...) (zdc_parse_expr(__VA_ARGS__), BC_STATUS_SUCCESS)
5114 static BC_STATUS zdc_parse_parse(BcParse *p)
5118 if (p->l.t.t == BC_LEX_EOF)
5119 s = bc_error("end of file");
5121 s = zdc_parse_expr(p, 0);
5123 if (s || G_interrupt) {
5125 s = BC_STATUS_FAILURE;
5130 #if ERRORS_ARE_FATAL
5131 # define zdc_parse_parse(...) (zdc_parse_parse(__VA_ARGS__), BC_STATUS_SUCCESS)
5136 static BC_STATUS zcommon_parse_expr(BcParse *p, uint8_t flags)
5139 IF_BC(RETURN_STATUS(zbc_parse_expr(p, flags, bc_parse_next_read)));
5141 IF_DC(RETURN_STATUS(zdc_parse_expr(p, flags)));
5144 #if ERRORS_ARE_FATAL
5145 # define zcommon_parse_expr(...) (zcommon_parse_expr(__VA_ARGS__), BC_STATUS_SUCCESS)
5148 static BcVec* bc_program_search(char *id, bool var)
5156 v = var ? &G.prog.vars : &G.prog.arrs;
5157 map = var ? &G.prog.var_map : &G.prog.arr_map;
5161 new = bc_map_insert(map, &e, &i); // 1 if insertion was successful
5164 bc_array_init(&data.v, var);
5165 bc_vec_push(v, &data.v);
5168 ptr = bc_vec_item(map, i);
5169 if (new) ptr->name = xstrdup(e.name);
5170 return bc_vec_item(v, ptr->idx);
5173 static BC_STATUS zbc_program_num(BcResult *r, BcNum **num, bool hex)
5178 case BC_RESULT_TEMP:
5179 case BC_RESULT_IBASE:
5180 case BC_RESULT_SCALE:
5181 case BC_RESULT_OBASE:
5187 case BC_RESULT_CONSTANT:
5190 char **str = bc_vec_item(&G.prog.consts, r->d.id.idx);
5191 size_t base_t, len = strlen(*str);
5194 bc_num_init(&r->d.n, len);
5196 hex = hex && len == 1;
5197 base = hex ? &G.prog.hexb : &G.prog.ib;
5198 base_t = hex ? BC_NUM_MAX_IBASE : G.prog.ib_t;
5199 s = zbc_num_parse(&r->d.n, *str, base, base_t);
5202 bc_num_free(&r->d.n);
5207 r->t = BC_RESULT_TEMP;
5213 case BC_RESULT_ARRAY:
5214 case BC_RESULT_ARRAY_ELEM:
5218 v = bc_program_search(r->d.id.name, r->t == BC_RESULT_VAR);
5220 if (r->t == BC_RESULT_ARRAY_ELEM) {
5222 if (v->len <= r->d.id.idx) bc_array_expand(v, r->d.id.idx + 1);
5223 *num = bc_vec_item(v, r->d.id.idx);
5226 *num = bc_vec_top(v);
5231 case BC_RESULT_LAST:
5233 *num = &G.prog.last;
5244 RETURN_STATUS(BC_STATUS_SUCCESS);
5246 #if ERRORS_ARE_FATAL
5247 # define zbc_program_num(...) (zbc_program_num(__VA_ARGS__), BC_STATUS_SUCCESS)
5250 static BC_STATUS zbc_program_binOpPrep(BcResult **l, BcNum **ln,
5251 BcResult **r, BcNum **rn, bool assign)
5255 BcResultType lt, rt;
5257 if (!BC_PROG_STACK(&G.prog.results, 2))
5258 RETURN_STATUS(bc_error_stack_has_too_few_elements());
5260 *r = bc_vec_item_rev(&G.prog.results, 0);
5261 *l = bc_vec_item_rev(&G.prog.results, 1);
5265 hex = assign && (lt == BC_RESULT_IBASE || lt == BC_RESULT_OBASE);
5267 s = zbc_program_num(*l, ln, false);
5268 if (s) RETURN_STATUS(s);
5269 s = zbc_program_num(*r, rn, hex);
5270 if (s) RETURN_STATUS(s);
5272 // We run this again under these conditions in case any vector has been
5273 // reallocated out from under the BcNums or arrays we had.
5274 if (lt == rt && (lt == BC_RESULT_VAR || lt == BC_RESULT_ARRAY_ELEM)) {
5275 s = zbc_program_num(*l, ln, false);
5276 if (s) RETURN_STATUS(s);
5279 if (!BC_PROG_NUM((*l), (*ln)) && (!assign || (*l)->t != BC_RESULT_VAR))
5280 RETURN_STATUS(bc_error_variable_is_wrong_type());
5281 if (!assign && !BC_PROG_NUM((*r), (*ln)))
5282 RETURN_STATUS(bc_error_variable_is_wrong_type());
5286 #if ERRORS_ARE_FATAL
5287 # define zbc_program_binOpPrep(...) (zbc_program_binOpPrep(__VA_ARGS__), BC_STATUS_SUCCESS)
5290 static void bc_program_binOpRetire(BcResult *r)
5292 r->t = BC_RESULT_TEMP;
5293 bc_vec_pop(&G.prog.results);
5294 bc_vec_pop(&G.prog.results);
5295 bc_vec_push(&G.prog.results, r);
5298 static BC_STATUS zbc_program_prep(BcResult **r, BcNum **n)
5302 if (!BC_PROG_STACK(&G.prog.results, 1))
5303 RETURN_STATUS(bc_error_stack_has_too_few_elements());
5304 *r = bc_vec_top(&G.prog.results);
5306 s = zbc_program_num(*r, n, false);
5307 if (s) RETURN_STATUS(s);
5309 if (!BC_PROG_NUM((*r), (*n)))
5310 RETURN_STATUS(bc_error_variable_is_wrong_type());
5314 #if ERRORS_ARE_FATAL
5315 # define zbc_program_prep(...) (zbc_program_prep(__VA_ARGS__), BC_STATUS_SUCCESS)
5318 static void bc_program_retire(BcResult *r, BcResultType t)
5321 bc_vec_pop(&G.prog.results);
5322 bc_vec_push(&G.prog.results, r);
5325 static BC_STATUS zbc_program_op(char inst)
5328 BcResult *opd1, *opd2, res;
5329 BcNum *n1, *n2 = NULL;
5331 s = zbc_program_binOpPrep(&opd1, &n1, &opd2, &n2, false);
5332 if (s) RETURN_STATUS(s);
5333 bc_num_init_DEF_SIZE(&res.d.n);
5335 s = BC_STATUS_SUCCESS;
5336 ERROR_RETURN(s =) zbc_program_ops[inst - BC_INST_POWER](n1, n2, &res.d.n, G.prog.scale);
5338 bc_program_binOpRetire(&res);
5343 bc_num_free(&res.d.n);
5346 #if ERRORS_ARE_FATAL
5347 # define zbc_program_op(...) (zbc_program_op(__VA_ARGS__), BC_STATUS_SUCCESS)
5350 static BC_STATUS zbc_program_read(void)
5352 const char *sv_file;
5360 RETURN_STATUS(bc_error_nested_read_call());
5362 f = bc_program_func(BC_PROG_READ);
5363 bc_vec_pop_all(&f->code);
5365 sv_file = G.prog.file;
5369 bc_char_vec_init(&buf);
5372 bc_parse_create(&parse, BC_PROG_READ);
5373 bc_lex_file(&parse.l);
5375 s = zbc_parse_text_init(&parse, buf.v);
5376 if (s) goto exec_err;
5377 s = zcommon_parse_expr(&parse, BC_PARSE_NOREAD);
5378 if (s) goto exec_err;
5380 if (parse.l.t.t != BC_LEX_NLINE && parse.l.t.t != BC_LEX_EOF) {
5381 s = bc_error("bad read() expression");
5385 ip.func = BC_PROG_READ;
5387 ip.len = G.prog.results.len;
5389 // Update this pointer, just in case.
5390 f = bc_program_func(BC_PROG_READ);
5392 bc_vec_pushByte(&f->code, BC_INST_POP_EXEC);
5393 bc_vec_push(&G.prog.stack, &ip);
5396 bc_parse_free(&parse);
5399 G.prog.file = sv_file;
5403 #if ERRORS_ARE_FATAL
5404 # define zbc_program_read(...) (zbc_program_read(__VA_ARGS__), BC_STATUS_SUCCESS)
5407 static size_t bc_program_index(char *code, size_t *bgn)
5409 char amt = code[(*bgn)++], i = 0;
5412 for (; i < amt; ++i, ++(*bgn))
5413 res |= (((size_t)((int) code[*bgn]) & UCHAR_MAX) << (i * CHAR_BIT));
5418 static char *bc_program_name(char *code, size_t *bgn)
5421 char c, *s, *str = code + *bgn, *ptr = strchr(str, BC_PARSE_STREND);
5423 s = xmalloc(ptr - str + 1);
5426 for (i = 0; c != 0 && c != BC_PARSE_STREND; c = code[(*bgn)++], ++i)
5434 static void bc_program_printString(const char *str)
5438 // Example: echo '[]ap' | dc
5439 // should print two bytes: 0x00, 0x0A
5446 if (c != '\\' || !*str)
5466 G.prog.nchars = SIZE_MAX;
5478 // Just print the backslash and following character.
5489 static void bc_num_printNewline(void)
5491 if (G.prog.nchars == G.prog.len - 1) {
5499 static FAST_FUNC void bc_num_printChar(size_t num, size_t width, bool radix)
5502 bb_putchar((char) num);
5503 G.prog.nchars += width;
5507 static FAST_FUNC void bc_num_printDigits(size_t num, size_t width, bool radix)
5511 bc_num_printNewline();
5512 bb_putchar(radix ? '.' : ' ');
5515 bc_num_printNewline();
5516 for (exp = 0, pow = 1; exp < width - 1; ++exp, pow *= 10)
5519 for (exp = 0; exp < width; pow /= 10, ++G.prog.nchars, ++exp) {
5521 bc_num_printNewline();
5524 bb_putchar(((char) dig) + '0');
5528 static FAST_FUNC void bc_num_printHex(size_t num, size_t width, bool radix)
5531 bc_num_printNewline();
5536 bc_num_printNewline();
5537 bb_putchar(bb_hexdigits_upcase[num]);
5538 G.prog.nchars += width;
5541 static void bc_num_printDecimal(BcNum *n)
5543 size_t i, rdx = n->rdx - 1;
5545 if (n->neg) bb_putchar('-');
5546 G.prog.nchars += n->neg;
5548 for (i = n->len - 1; i < n->len; --i)
5549 bc_num_printHex((size_t) n->num[i], 1, i == rdx);
5552 static BC_STATUS zbc_num_printNum(BcNum *n, BcNum *base, size_t width, BcNumDigitOp print)
5556 BcNum intp, fracp, digit, frac_len;
5557 unsigned long dig, *ptr;
5562 print(0, width, false);
5563 RETURN_STATUS(BC_STATUS_SUCCESS);
5566 bc_vec_init(&stack, sizeof(long), NULL);
5567 bc_num_init(&intp, n->len);
5568 bc_num_init(&fracp, n->rdx);
5569 bc_num_init(&digit, width);
5570 bc_num_init(&frac_len, BC_NUM_INT(n));
5571 bc_num_copy(&intp, n);
5572 bc_num_one(&frac_len);
5574 bc_num_truncate(&intp, intp.rdx);
5575 s = zbc_num_sub(n, &intp, &fracp, 0);
5578 while (intp.len != 0) {
5579 s = zbc_num_divmod(&intp, base, &intp, &digit, 0);
5581 s = zbc_num_ulong(&digit, &dig);
5583 bc_vec_push(&stack, &dig);
5586 for (i = 0; i < stack.len; ++i) {
5587 ptr = bc_vec_item_rev(&stack, i);
5588 print(*ptr, width, false);
5591 if (!n->rdx) goto err;
5593 for (radix = true; frac_len.len <= n->rdx; radix = false) {
5594 s = zbc_num_mul(&fracp, base, &fracp, n->rdx);
5596 s = zbc_num_ulong(&fracp, &dig);
5598 bc_num_ulong2num(&intp, dig);
5599 s = zbc_num_sub(&fracp, &intp, &fracp, 0);
5601 print(dig, width, radix);
5602 s = zbc_num_mul(&frac_len, base, &frac_len, 0);
5607 bc_num_free(&frac_len);
5608 bc_num_free(&digit);
5609 bc_num_free(&fracp);
5611 bc_vec_free(&stack);
5614 #if ERRORS_ARE_FATAL
5615 # define zbc_num_printNum(...) (zbc_num_printNum(__VA_ARGS__), BC_STATUS_SUCCESS)
5618 static BC_STATUS zbc_num_printBase(BcNum *n)
5632 if (G.prog.ob_t <= BC_NUM_MAX_IBASE) {
5634 print = bc_num_printHex;
5637 for (i = G.prog.ob_t - 1, width = 0; i != 0; i /= 10, ++width)
5639 print = bc_num_printDigits;
5642 s = zbc_num_printNum(n, &G.prog.ob, width, print);
5647 #if ERRORS_ARE_FATAL
5648 # define zbc_num_printBase(...) (zbc_num_printBase(__VA_ARGS__), BC_STATUS_SUCCESS)
5652 static BC_STATUS zbc_num_stream(BcNum *n, BcNum *base)
5654 RETURN_STATUS(zbc_num_printNum(n, base, 1, bc_num_printChar));
5656 #if ERRORS_ARE_FATAL
5657 # define zbc_num_stream(...) (zbc_num_stream(__VA_ARGS__), BC_STATUS_SUCCESS)
5661 static BC_STATUS zbc_num_print(BcNum *n, bool newline)
5663 BcStatus s = BC_STATUS_SUCCESS;
5665 bc_num_printNewline();
5671 else if (G.prog.ob_t == 10)
5672 bc_num_printDecimal(n);
5674 s = zbc_num_printBase(n);
5683 #if ERRORS_ARE_FATAL
5684 # define zbc_num_print(...) (zbc_num_print(__VA_ARGS__), BC_STATUS_SUCCESS)
5687 static BC_STATUS zbc_program_print(char inst, size_t idx)
5692 bool pop = inst != BC_INST_PRINT;
5694 if (!BC_PROG_STACK(&G.prog.results, idx + 1))
5695 RETURN_STATUS(bc_error_stack_has_too_few_elements());
5697 r = bc_vec_item_rev(&G.prog.results, idx);
5698 num = NULL; // is this NULL necessary?
5699 s = zbc_program_num(r, &num, false);
5700 if (s) RETURN_STATUS(s);
5702 if (BC_PROG_NUM(r, num)) {
5703 s = zbc_num_print(num, !pop);
5704 if (!s) bc_num_copy(&G.prog.last, num);
5709 idx = (r->t == BC_RESULT_STR) ? r->d.id.idx : num->rdx;
5710 str = *bc_program_str(idx);
5712 if (inst == BC_INST_PRINT_STR) {
5715 if (c == '\0') break;
5718 if (c == '\n') G.prog.nchars = 0;
5722 bc_program_printString(str);
5723 if (inst == BC_INST_PRINT) bb_putchar('\n');
5727 if (!s && pop) bc_vec_pop(&G.prog.results);
5731 #if ERRORS_ARE_FATAL
5732 # define zbc_program_print(...) (zbc_program_print(__VA_ARGS__), BC_STATUS_SUCCESS)
5735 static BC_STATUS zbc_program_negate(void)
5741 s = zbc_program_prep(&ptr, &num);
5742 if (s) RETURN_STATUS(s);
5744 bc_num_init(&res.d.n, num->len);
5745 bc_num_copy(&res.d.n, num);
5746 if (res.d.n.len) res.d.n.neg = !res.d.n.neg;
5748 bc_program_retire(&res, BC_RESULT_TEMP);
5752 #if ERRORS_ARE_FATAL
5753 # define zbc_program_negate(...) (zbc_program_negate(__VA_ARGS__), BC_STATUS_SUCCESS)
5756 static BC_STATUS zbc_program_logical(char inst)
5759 BcResult *opd1, *opd2, res;
5763 s = zbc_program_binOpPrep(&opd1, &n1, &opd2, &n2, false);
5764 if (s) RETURN_STATUS(s);
5766 bc_num_init_DEF_SIZE(&res.d.n);
5768 if (inst == BC_INST_BOOL_AND)
5769 cond = bc_num_cmp(n1, &G.prog.zero) && bc_num_cmp(n2, &G.prog.zero);
5770 else if (inst == BC_INST_BOOL_OR)
5771 cond = bc_num_cmp(n1, &G.prog.zero) || bc_num_cmp(n2, &G.prog.zero);
5773 cond = bc_num_cmp(n1, n2);
5775 case BC_INST_REL_EQ:
5778 case BC_INST_REL_LE:
5781 case BC_INST_REL_GE:
5784 case BC_INST_REL_LT:
5787 case BC_INST_REL_GT:
5790 default: // = case BC_INST_REL_NE:
5791 //cond = (cond != 0); - not needed
5796 if (cond) bc_num_one(&res.d.n);
5797 //else bc_num_zero(&res.d.n); - already is
5799 bc_program_binOpRetire(&res);
5803 #if ERRORS_ARE_FATAL
5804 # define zbc_program_logical(...) (zbc_program_logical(__VA_ARGS__), BC_STATUS_SUCCESS)
5808 static BC_STATUS zbc_program_assignStr(BcResult *r, BcVec *v,
5814 memset(&n2, 0, sizeof(BcNum));
5815 n2.rdx = res.d.id.idx = r->d.id.idx;
5816 res.t = BC_RESULT_STR;
5819 if (!BC_PROG_STACK(&G.prog.results, 2))
5820 RETURN_STATUS(bc_error_stack_has_too_few_elements());
5822 bc_vec_pop(&G.prog.results);
5825 bc_vec_pop(&G.prog.results);
5827 bc_vec_push(&G.prog.results, &res);
5828 bc_vec_push(v, &n2);
5830 RETURN_STATUS(BC_STATUS_SUCCESS);
5832 #if ERRORS_ARE_FATAL
5833 # define zbc_program_assignStr(...) (zbc_program_assignStr(__VA_ARGS__), BC_STATUS_SUCCESS)
5837 static BC_STATUS zbc_program_copyToVar(char *name, bool var)
5844 if (!BC_PROG_STACK(&G.prog.results, 1))
5845 RETURN_STATUS(bc_error_stack_has_too_few_elements());
5847 ptr = bc_vec_top(&G.prog.results);
5848 if ((ptr->t == BC_RESULT_ARRAY) != !var)
5849 RETURN_STATUS(bc_error_variable_is_wrong_type());
5850 v = bc_program_search(name, var);
5853 if (ptr->t == BC_RESULT_STR && !var)
5854 RETURN_STATUS(bc_error_variable_is_wrong_type());
5855 if (ptr->t == BC_RESULT_STR)
5856 RETURN_STATUS(zbc_program_assignStr(ptr, v, true));
5859 s = zbc_program_num(ptr, &n, false);
5860 if (s) RETURN_STATUS(s);
5862 // Do this once more to make sure that pointers were not invalidated.
5863 v = bc_program_search(name, var);
5866 bc_num_init_DEF_SIZE(&r.d.n);
5867 bc_num_copy(&r.d.n, n);
5870 bc_array_init(&r.d.v, true);
5871 bc_array_copy(&r.d.v, (BcVec *) n);
5874 bc_vec_push(v, &r.d);
5875 bc_vec_pop(&G.prog.results);
5879 #if ERRORS_ARE_FATAL
5880 # define zbc_program_copyToVar(...) (zbc_program_copyToVar(__VA_ARGS__), BC_STATUS_SUCCESS)
5883 static BC_STATUS zbc_program_assign(char inst)
5886 BcResult *left, *right, res;
5887 BcNum *l = NULL, *r = NULL;
5888 bool assign = inst == BC_INST_ASSIGN, ib, sc;
5890 s = zbc_program_binOpPrep(&left, &l, &right, &r, assign);
5891 if (s) RETURN_STATUS(s);
5893 ib = left->t == BC_RESULT_IBASE;
5894 sc = left->t == BC_RESULT_SCALE;
5898 if (right->t == BC_RESULT_STR) {
5902 if (left->t != BC_RESULT_VAR)
5903 RETURN_STATUS(bc_error_variable_is_wrong_type());
5904 v = bc_program_search(left->d.id.name, true);
5906 RETURN_STATUS(zbc_program_assignStr(right, v, false));
5910 if (left->t == BC_RESULT_CONSTANT || left->t == BC_RESULT_TEMP)
5911 RETURN_STATUS(bc_error("bad assignment:"
5912 " left side must be variable"
5914 )); // note: shared string
5917 if (inst == BC_INST_ASSIGN_DIVIDE && !bc_num_cmp(r, &G.prog.zero))
5918 RETURN_STATUS(bc_error("divide by zero"));
5923 s = BC_STATUS_SUCCESS;
5924 ERROR_RETURN(s =) zbc_program_ops[inst - BC_INST_ASSIGN_POWER](l, r, l, G.prog.scale);
5926 if (s) RETURN_STATUS(s);
5931 if (ib || sc || left->t == BC_RESULT_OBASE) {
5932 static const char *const msg[] = {
5933 "bad ibase; must be [2,16]", //BC_RESULT_IBASE
5934 "bad scale; must be [0,"BC_MAX_SCALE_STR"]", //BC_RESULT_SCALE
5935 NULL, //can't happen //BC_RESULT_LAST
5936 NULL, //can't happen //BC_RESULT_CONSTANT
5937 NULL, //can't happen //BC_RESULT_ONE
5938 "bad obase; must be [2,"BC_MAX_OBASE_STR"]", //BC_RESULT_OBASE
5941 unsigned long val, max;
5943 s = zbc_num_ulong(l, &val);
5944 if (s) RETURN_STATUS(s);
5945 s = left->t - BC_RESULT_IBASE;
5948 ptr = &G.prog.scale;
5951 if (val < BC_NUM_MIN_BASE)
5952 RETURN_STATUS(bc_error(msg[s]));
5953 max = ib ? BC_NUM_MAX_IBASE : BC_MAX_OBASE;
5954 ptr = ib ? &G.prog.ib_t : &G.prog.ob_t;
5958 RETURN_STATUS(bc_error(msg[s]));
5960 bc_num_copy(ib ? &G.prog.ib : &G.prog.ob, l);
5962 *ptr = (size_t) val;
5963 s = BC_STATUS_SUCCESS;
5966 bc_num_init(&res.d.n, l->len);
5967 bc_num_copy(&res.d.n, l);
5968 bc_program_binOpRetire(&res);
5972 #if ERRORS_ARE_FATAL
5973 # define zbc_program_assign(...) (zbc_program_assign(__VA_ARGS__), BC_STATUS_SUCCESS)
5977 #define bc_program_pushVar(code, bgn, pop, copy) \
5978 bc_program_pushVar(code, bgn)
5979 // for bc, 'pop' and 'copy' are always false
5981 static BC_STATUS bc_program_pushVar(char *code, size_t *bgn,
5982 bool pop, bool copy)
5985 char *name = bc_program_name(code, bgn);
5987 r.t = BC_RESULT_VAR;
5992 BcVec *v = bc_program_search(name, true);
5993 BcNum *num = bc_vec_top(v);
5997 if (!BC_PROG_STACK(v, 2 - copy)) {
5999 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6005 if (!BC_PROG_STR(num)) {
6007 r.t = BC_RESULT_TEMP;
6009 bc_num_init_DEF_SIZE(&r.d.n);
6010 bc_num_copy(&r.d.n, num);
6013 r.t = BC_RESULT_STR;
6014 r.d.id.idx = num->rdx;
6017 if (!copy) bc_vec_pop(v);
6022 bc_vec_push(&G.prog.results, &r);
6024 RETURN_STATUS(BC_STATUS_SUCCESS);
6026 #if ERRORS_ARE_FATAL
6027 # define zbc_program_pushVar(...) (bc_program_pushVar(__VA_ARGS__), BC_STATUS_SUCCESS)
6029 # define zbc_program_pushVar(...) bc_program_pushVar(__VA_ARGS__)
6032 static BC_STATUS zbc_program_pushArray(char *code, size_t *bgn,
6035 BcStatus s = BC_STATUS_SUCCESS;
6039 r.d.id.name = bc_program_name(code, bgn);
6041 if (inst == BC_INST_ARRAY) {
6042 r.t = BC_RESULT_ARRAY;
6043 bc_vec_push(&G.prog.results, &r);
6050 s = zbc_program_prep(&operand, &num);
6052 s = zbc_num_ulong(num, &temp);
6055 if (temp > BC_MAX_DIM) {
6056 s = bc_error("array too long; must be [1,"BC_MAX_DIM_STR"]");
6060 r.d.id.idx = (size_t) temp;
6061 bc_program_retire(&r, BC_RESULT_ARRAY_ELEM);
6065 if (s) free(r.d.id.name);
6068 #if ERRORS_ARE_FATAL
6069 # define zbc_program_pushArray(...) (zbc_program_pushArray(__VA_ARGS__), BC_STATUS_SUCCESS)
6073 static BC_STATUS zbc_program_incdec(char inst)
6076 BcResult *ptr, res, copy;
6080 s = zbc_program_prep(&ptr, &num);
6081 if (s) RETURN_STATUS(s);
6083 if (inst == BC_INST_INC_POST || inst == BC_INST_DEC_POST) {
6084 copy.t = BC_RESULT_TEMP;
6085 bc_num_init(©.d.n, num->len);
6086 bc_num_copy(©.d.n, num);
6089 res.t = BC_RESULT_ONE;
6090 inst = inst == BC_INST_INC_PRE || inst == BC_INST_INC_POST ?
6091 BC_INST_ASSIGN_PLUS :
6092 BC_INST_ASSIGN_MINUS;
6094 bc_vec_push(&G.prog.results, &res);
6095 s = zbc_program_assign(inst);
6096 if (s) RETURN_STATUS(s);
6098 if (inst2 == BC_INST_INC_POST || inst2 == BC_INST_DEC_POST) {
6099 bc_vec_pop(&G.prog.results);
6100 bc_vec_push(&G.prog.results, ©);
6105 #if ERRORS_ARE_FATAL
6106 # define zbc_program_incdec(...) (zbc_program_incdec(__VA_ARGS__), BC_STATUS_SUCCESS)
6109 static BC_STATUS zbc_program_call(char *code, size_t *idx)
6112 size_t i, nparams = bc_program_index(code, idx);
6119 ip.func = bc_program_index(code, idx);
6120 func = bc_program_func(ip.func);
6122 if (func->code.len == 0) {
6123 RETURN_STATUS(bc_error("undefined function"));
6125 if (nparams != func->nparams) {
6126 RETURN_STATUS(bc_error_fmt("function has %u parameters, but called with %u", func->nparams, nparams));
6128 ip.len = G.prog.results.len - nparams;
6130 for (i = 0; i < nparams; ++i) {
6133 a = bc_vec_item(&func->autos, nparams - 1 - i);
6134 arg = bc_vec_top(&G.prog.results);
6136 if ((!a->idx) != (arg->t == BC_RESULT_ARRAY) || arg->t == BC_RESULT_STR)
6137 RETURN_STATUS(bc_error_variable_is_wrong_type());
6139 s = zbc_program_copyToVar(a->name, a->idx);
6140 if (s) RETURN_STATUS(s);
6143 for (; i < func->autos.len; ++i) {
6146 a = bc_vec_item(&func->autos, i);
6147 v = bc_program_search(a->name, a->idx);
6150 bc_num_init_DEF_SIZE(¶m.n);
6151 bc_vec_push(v, ¶m.n);
6154 bc_array_init(¶m.v, true);
6155 bc_vec_push(v, ¶m.v);
6159 bc_vec_push(&G.prog.stack, &ip);
6161 RETURN_STATUS(BC_STATUS_SUCCESS);
6163 #if ERRORS_ARE_FATAL
6164 # define zbc_program_call(...) (zbc_program_call(__VA_ARGS__), BC_STATUS_SUCCESS)
6167 static BC_STATUS zbc_program_return(char inst)
6172 BcInstPtr *ip = bc_vec_top(&G.prog.stack);
6174 if (!BC_PROG_STACK(&G.prog.results, ip->len + inst == BC_INST_RET))
6175 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6177 f = bc_program_func(ip->func);
6178 res.t = BC_RESULT_TEMP;
6180 if (inst == BC_INST_RET) {
6183 BcResult *operand = bc_vec_top(&G.prog.results);
6185 s = zbc_program_num(operand, &num, false);
6186 if (s) RETURN_STATUS(s);
6187 bc_num_init(&res.d.n, num->len);
6188 bc_num_copy(&res.d.n, num);
6191 bc_num_init_DEF_SIZE(&res.d.n);
6192 //bc_num_zero(&res.d.n); - already is
6195 // We need to pop arguments as well, so this takes that into account.
6196 for (i = 0; i < f->autos.len; ++i) {
6198 BcId *a = bc_vec_item(&f->autos, i);
6200 v = bc_program_search(a->name, a->idx);
6204 bc_vec_npop(&G.prog.results, G.prog.results.len - ip->len);
6205 bc_vec_push(&G.prog.results, &res);
6206 bc_vec_pop(&G.prog.stack);
6208 RETURN_STATUS(BC_STATUS_SUCCESS);
6210 #if ERRORS_ARE_FATAL
6211 # define zbc_program_return(...) (zbc_program_return(__VA_ARGS__), BC_STATUS_SUCCESS)
6215 static unsigned long bc_program_scale(BcNum *n)
6217 return (unsigned long) n->rdx;
6220 static unsigned long bc_program_len(BcNum *n)
6222 size_t len = n->len;
6224 if (n->rdx != len) return len;
6226 if (len == 0) break;
6228 if (n->num[len] != 0) break;
6233 static BC_STATUS zbc_program_builtin(char inst)
6239 bool len = inst == BC_INST_LENGTH;
6241 if (!BC_PROG_STACK(&G.prog.results, 1))
6242 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6243 opnd = bc_vec_top(&G.prog.results);
6245 s = zbc_program_num(opnd, &num, false);
6246 if (s) RETURN_STATUS(s);
6249 if (!BC_PROG_NUM(opnd, num) && !len)
6250 RETURN_STATUS(bc_error_variable_is_wrong_type());
6253 bc_num_init_DEF_SIZE(&res.d.n);
6255 if (inst == BC_INST_SQRT) s = zbc_num_sqrt(num, &res.d.n, G.prog.scale);
6257 else if (len != 0 && opnd->t == BC_RESULT_ARRAY) {
6258 bc_num_ulong2num(&res.d.n, (unsigned long) ((BcVec *) num)->len);
6262 else if (len != 0 && !BC_PROG_NUM(opnd, num)) {
6264 size_t idx = opnd->t == BC_RESULT_STR ? opnd->d.id.idx : num->rdx;
6266 str = bc_program_str(idx);
6267 bc_num_ulong2num(&res.d.n, strlen(*str));
6271 bc_num_ulong2num(&res.d.n, len ? bc_program_len(num) : bc_program_scale(num));
6274 bc_program_retire(&res, BC_RESULT_TEMP);
6278 #if ERRORS_ARE_FATAL
6279 # define zbc_program_builtin(...) (zbc_program_builtin(__VA_ARGS__), BC_STATUS_SUCCESS)
6283 static BC_STATUS zbc_program_divmod(void)
6286 BcResult *opd1, *opd2, res, res2;
6287 BcNum *n1, *n2 = NULL;
6289 s = zbc_program_binOpPrep(&opd1, &n1, &opd2, &n2, false);
6290 if (s) RETURN_STATUS(s);
6292 bc_num_init_DEF_SIZE(&res.d.n);
6293 bc_num_init(&res2.d.n, n2->len);
6295 s = zbc_num_divmod(n1, n2, &res2.d.n, &res.d.n, G.prog.scale);
6298 bc_program_binOpRetire(&res2);
6299 res.t = BC_RESULT_TEMP;
6300 bc_vec_push(&G.prog.results, &res);
6305 bc_num_free(&res2.d.n);
6306 bc_num_free(&res.d.n);
6309 #if ERRORS_ARE_FATAL
6310 # define zbc_program_divmod(...) (zbc_program_divmod(__VA_ARGS__), BC_STATUS_SUCCESS)
6313 static BC_STATUS zbc_program_modexp(void)
6316 BcResult *r1, *r2, *r3, res;
6317 BcNum *n1, *n2, *n3;
6319 if (!BC_PROG_STACK(&G.prog.results, 3))
6320 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6321 s = zbc_program_binOpPrep(&r2, &n2, &r3, &n3, false);
6322 if (s) RETURN_STATUS(s);
6324 r1 = bc_vec_item_rev(&G.prog.results, 2);
6325 s = zbc_program_num(r1, &n1, false);
6326 if (s) RETURN_STATUS(s);
6327 if (!BC_PROG_NUM(r1, n1))
6328 RETURN_STATUS(bc_error_variable_is_wrong_type());
6330 // Make sure that the values have their pointers updated, if necessary.
6331 if (r1->t == BC_RESULT_VAR || r1->t == BC_RESULT_ARRAY_ELEM) {
6333 if (r1->t == r2->t) {
6334 s = zbc_program_num(r2, &n2, false);
6335 if (s) RETURN_STATUS(s);
6338 if (r1->t == r3->t) {
6339 s = zbc_program_num(r3, &n3, false);
6340 if (s) RETURN_STATUS(s);
6344 bc_num_init(&res.d.n, n3->len);
6345 s = zbc_num_modexp(n1, n2, n3, &res.d.n);
6348 bc_vec_pop(&G.prog.results);
6349 bc_program_binOpRetire(&res);
6354 bc_num_free(&res.d.n);
6357 #if ERRORS_ARE_FATAL
6358 # define zbc_program_modexp(...) (zbc_program_modexp(__VA_ARGS__), BC_STATUS_SUCCESS)
6361 static void bc_program_stackLen(void)
6364 size_t len = G.prog.results.len;
6366 res.t = BC_RESULT_TEMP;
6368 bc_num_init_DEF_SIZE(&res.d.n);
6369 bc_num_ulong2num(&res.d.n, len);
6370 bc_vec_push(&G.prog.results, &res);
6373 static BC_STATUS zbc_program_asciify(void)
6378 char *str, *str2, c;
6379 size_t len = G.prog.strs.len, idx;
6382 if (!BC_PROG_STACK(&G.prog.results, 1))
6383 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6384 r = bc_vec_top(&G.prog.results);
6386 num = NULL; // TODO: is this NULL needed?
6387 s = zbc_program_num(r, &num, false);
6388 if (s) RETURN_STATUS(s);
6390 if (BC_PROG_NUM(r, num)) {
6392 bc_num_init_DEF_SIZE(&n);
6393 bc_num_copy(&n, num);
6394 bc_num_truncate(&n, n.rdx);
6396 s = zbc_num_mod(&n, &G.prog.strmb, &n, 0);
6397 if (s) goto num_err;
6398 s = zbc_num_ulong(&n, &val);
6399 if (s) goto num_err;
6406 idx = (r->t == BC_RESULT_STR) ? r->d.id.idx : num->rdx;
6407 str2 = *bc_program_str(idx);
6413 //str[1] = '\0'; - already is
6415 str2 = xstrdup(str);
6416 bc_program_addFunc(str2, &idx);
6418 if (idx != len + BC_PROG_REQ_FUNCS) {
6419 for (idx = 0; idx < G.prog.strs.len; ++idx) {
6420 if (strcmp(*bc_program_str(idx), str) == 0) {
6429 bc_vec_push(&G.prog.strs, &str);
6431 res.t = BC_RESULT_STR;
6433 bc_vec_pop(&G.prog.results);
6434 bc_vec_push(&G.prog.results, &res);
6436 RETURN_STATUS(BC_STATUS_SUCCESS);
6442 #if ERRORS_ARE_FATAL
6443 # define zbc_program_asciify(...) (zbc_program_asciify(__VA_ARGS__), BC_STATUS_SUCCESS)
6446 static BC_STATUS zbc_program_printStream(void)
6454 if (!BC_PROG_STACK(&G.prog.results, 1))
6455 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6456 r = bc_vec_top(&G.prog.results);
6458 s = zbc_program_num(r, &n, false);
6459 if (s) RETURN_STATUS(s);
6461 if (BC_PROG_NUM(r, n))
6462 s = zbc_num_stream(n, &G.prog.strmb);
6464 idx = (r->t == BC_RESULT_STR) ? r->d.id.idx : n->rdx;
6465 str = *bc_program_str(idx);
6471 #if ERRORS_ARE_FATAL
6472 # define zbc_program_printStream(...) (zbc_program_printStream(__VA_ARGS__), BC_STATUS_SUCCESS)
6475 static BC_STATUS zbc_program_nquit(void)
6482 s = zbc_program_prep(&opnd, &num);
6483 if (s) RETURN_STATUS(s);
6484 s = zbc_num_ulong(num, &val);
6485 if (s) RETURN_STATUS(s);
6487 bc_vec_pop(&G.prog.results);
6489 if (G.prog.stack.len < val)
6490 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6491 if (G.prog.stack.len == val) {
6492 QUIT_OR_RETURN_TO_MAIN;
6495 bc_vec_npop(&G.prog.stack, val);
6499 #if ERRORS_ARE_FATAL
6500 # define zbc_program_nquit(...) (zbc_program_nquit(__VA_ARGS__), BC_STATUS_SUCCESS)
6503 static BC_STATUS zbc_program_execStr(char *code, size_t *bgn,
6506 BcStatus s = BC_STATUS_SUCCESS;
6514 if (!BC_PROG_STACK(&G.prog.results, 1))
6515 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6517 r = bc_vec_top(&G.prog.results);
6520 BcNum *n = n; // for compiler
6523 char *then_name = bc_program_name(code, bgn);
6524 char *else_name = NULL;
6526 if (code[*bgn] == BC_PARSE_STREND)
6529 else_name = bc_program_name(code, bgn);
6531 exec = r->d.n.len != 0;
6533 if (!exec && else_name != NULL) {
6540 v = bc_program_search(name, true);
6547 if (!exec) goto exit;
6548 if (!BC_PROG_STR(n)) {
6549 s = bc_error_variable_is_wrong_type();
6555 if (r->t == BC_RESULT_STR) {
6557 } else if (r->t == BC_RESULT_VAR) {
6559 s = zbc_program_num(r, &n, false);
6560 if (s || !BC_PROG_STR(n)) goto exit;
6566 fidx = sidx + BC_PROG_REQ_FUNCS;
6568 str = bc_program_str(sidx);
6569 f = bc_program_func(fidx);
6571 if (f->code.len == 0) {
6572 bc_parse_create(&prs, fidx);
6573 s = zbc_parse_text_init(&prs, *str);
6575 s = zcommon_parse_expr(&prs, BC_PARSE_NOCALL);
6578 if (prs.l.t.t != BC_LEX_EOF) {
6579 s = bc_error_bad_expression();
6583 bc_parse_free(&prs);
6587 ip.len = G.prog.results.len;
6590 bc_vec_pop(&G.prog.results);
6591 bc_vec_push(&G.prog.stack, &ip);
6593 RETURN_STATUS(BC_STATUS_SUCCESS);
6596 bc_parse_free(&prs);
6597 f = bc_program_func(fidx);
6598 bc_vec_pop_all(&f->code);
6600 bc_vec_pop(&G.prog.results);
6603 #if ERRORS_ARE_FATAL
6604 # define zbc_program_execStr(...) (zbc_program_execStr(__VA_ARGS__), BC_STATUS_SUCCESS)
6608 static void bc_program_pushGlobal(char inst)
6613 res.t = inst - BC_INST_IBASE + BC_RESULT_IBASE;
6614 if (inst == BC_INST_IBASE)
6615 val = (unsigned long) G.prog.ib_t;
6616 else if (inst == BC_INST_SCALE)
6617 val = (unsigned long) G.prog.scale;
6619 val = (unsigned long) G.prog.ob_t;
6621 bc_num_init_DEF_SIZE(&res.d.n);
6622 bc_num_ulong2num(&res.d.n, val);
6623 bc_vec_push(&G.prog.results, &res);
6626 static void bc_program_addFunc(char *name, size_t *idx)
6628 BcId entry, *entry_ptr;
6633 entry.idx = G.prog.fns.len;
6635 inserted = bc_map_insert(&G.prog.fn_map, &entry, idx);
6636 if (!inserted) free(name);
6638 entry_ptr = bc_vec_item(&G.prog.fn_map, *idx);
6639 *idx = entry_ptr->idx;
6643 BcFunc *func = bc_program_func(entry_ptr->idx);
6645 // We need to reset these, so the function can be repopulated.
6647 bc_vec_pop_all(&func->autos);
6648 bc_vec_pop_all(&func->code);
6649 bc_vec_pop_all(&func->labels);
6653 bc_vec_push(&G.prog.fns, &f);
6657 static BC_STATUS zbc_program_exec(void)
6661 BcInstPtr *ip = bc_vec_top(&G.prog.stack);
6662 BcFunc *func = bc_program_func(ip->func);
6663 char *code = func->code.v;
6665 while (ip->idx < func->code.len) {
6666 BcStatus s = BC_STATUS_SUCCESS;
6667 char inst = code[(ip->idx)++];
6669 dbg_exec("inst:%d", inst);
6672 case BC_INST_JUMP_ZERO: {
6674 dbg_exec("BC_INST_JUMP_ZERO:");
6675 s = zbc_program_prep(&ptr, &num);
6676 if (s) RETURN_STATUS(s);
6677 zero = (bc_num_cmp(num, &G.prog.zero) == 0);
6678 bc_vec_pop(&G.prog.results);
6680 bc_program_index(code, &ip->idx);
6683 // else: fall through
6685 case BC_INST_JUMP: {
6686 size_t idx = bc_program_index(code, &ip->idx);
6687 size_t *addr = bc_vec_item(&func->labels, idx);
6688 dbg_exec("BC_INST_JUMP: to %ld", (long)*addr);
6693 dbg_exec("BC_INST_CALL:");
6694 s = zbc_program_call(code, &ip->idx);
6696 case BC_INST_INC_PRE:
6697 case BC_INST_DEC_PRE:
6698 case BC_INST_INC_POST:
6699 case BC_INST_DEC_POST:
6700 dbg_exec("BC_INST_INCDEC:");
6701 s = zbc_program_incdec(inst);
6704 dbg_exec("BC_INST_HALT:");
6705 QUIT_OR_RETURN_TO_MAIN;
6709 dbg_exec("BC_INST_RET[0]:");
6710 s = zbc_program_return(inst);
6712 case BC_INST_BOOL_OR:
6713 case BC_INST_BOOL_AND:
6715 case BC_INST_REL_EQ:
6716 case BC_INST_REL_LE:
6717 case BC_INST_REL_GE:
6718 case BC_INST_REL_NE:
6719 case BC_INST_REL_LT:
6720 case BC_INST_REL_GT:
6721 dbg_exec("BC_INST_BOOL:");
6722 s = zbc_program_logical(inst);
6725 dbg_exec("BC_INST_READ:");
6726 s = zbc_program_read();
6729 dbg_exec("BC_INST_VAR:");
6730 s = zbc_program_pushVar(code, &ip->idx, false, false);
6732 case BC_INST_ARRAY_ELEM:
6734 dbg_exec("BC_INST_ARRAY[_ELEM]:");
6735 s = zbc_program_pushArray(code, &ip->idx, inst);
6738 r.t = BC_RESULT_LAST;
6739 bc_vec_push(&G.prog.results, &r);
6744 bc_program_pushGlobal(inst);
6746 case BC_INST_SCALE_FUNC:
6747 case BC_INST_LENGTH:
6749 dbg_exec("BC_INST_builtin:");
6750 s = zbc_program_builtin(inst);
6753 dbg_exec("BC_INST_NUM:");
6754 r.t = BC_RESULT_CONSTANT;
6755 r.d.id.idx = bc_program_index(code, &ip->idx);
6756 bc_vec_push(&G.prog.results, &r);
6759 dbg_exec("BC_INST_POP:");
6760 if (!BC_PROG_STACK(&G.prog.results, 1))
6761 s = bc_error_stack_has_too_few_elements();
6763 bc_vec_pop(&G.prog.results);
6765 case BC_INST_POP_EXEC:
6766 dbg_exec("BC_INST_POP_EXEC:");
6767 bc_vec_pop(&G.prog.stack);
6770 case BC_INST_PRINT_POP:
6771 case BC_INST_PRINT_STR:
6772 dbg_exec("BC_INST_PRINTxyz:");
6773 s = zbc_program_print(inst, 0);
6776 dbg_exec("BC_INST_STR:");
6777 r.t = BC_RESULT_STR;
6778 r.d.id.idx = bc_program_index(code, &ip->idx);
6779 bc_vec_push(&G.prog.results, &r);
6782 case BC_INST_MULTIPLY:
6783 case BC_INST_DIVIDE:
6784 case BC_INST_MODULUS:
6787 dbg_exec("BC_INST_binaryop:");
6788 s = zbc_program_op(inst);
6790 case BC_INST_BOOL_NOT:
6791 dbg_exec("BC_INST_BOOL_NOT:");
6792 s = zbc_program_prep(&ptr, &num);
6793 if (s) RETURN_STATUS(s);
6794 bc_num_init_DEF_SIZE(&r.d.n);
6795 if (!bc_num_cmp(num, &G.prog.zero))
6797 //else bc_num_zero(&r.d.n); - already is
6798 bc_program_retire(&r, BC_RESULT_TEMP);
6801 dbg_exec("BC_INST_NEG:");
6802 s = zbc_program_negate();
6805 case BC_INST_ASSIGN_POWER:
6806 case BC_INST_ASSIGN_MULTIPLY:
6807 case BC_INST_ASSIGN_DIVIDE:
6808 case BC_INST_ASSIGN_MODULUS:
6809 case BC_INST_ASSIGN_PLUS:
6810 case BC_INST_ASSIGN_MINUS:
6812 case BC_INST_ASSIGN:
6813 dbg_exec("BC_INST_ASSIGNxyz:");
6814 s = zbc_program_assign(inst);
6817 case BC_INST_MODEXP:
6818 s = zbc_program_modexp();
6820 case BC_INST_DIVMOD:
6821 s = zbc_program_divmod();
6823 case BC_INST_EXECUTE:
6824 case BC_INST_EXEC_COND:
6825 s = zbc_program_execStr(code, &ip->idx, inst == BC_INST_EXEC_COND);
6827 case BC_INST_PRINT_STACK: {
6829 for (idx = 0; idx < G.prog.results.len; ++idx) {
6830 s = zbc_program_print(BC_INST_PRINT, idx);
6835 case BC_INST_CLEAR_STACK:
6836 bc_vec_pop_all(&G.prog.results);
6838 case BC_INST_STACK_LEN:
6839 bc_program_stackLen();
6841 case BC_INST_DUPLICATE:
6842 if (!BC_PROG_STACK(&G.prog.results, 1))
6843 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6844 ptr = bc_vec_top(&G.prog.results);
6845 bc_result_copy(&r, ptr);
6846 bc_vec_push(&G.prog.results, &r);
6848 case BC_INST_SWAP: {
6850 if (!BC_PROG_STACK(&G.prog.results, 2))
6851 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6852 ptr = bc_vec_item_rev(&G.prog.results, 0);
6853 ptr2 = bc_vec_item_rev(&G.prog.results, 1);
6854 memcpy(&r, ptr, sizeof(BcResult));
6855 memcpy(ptr, ptr2, sizeof(BcResult));
6856 memcpy(ptr2, &r, sizeof(BcResult));
6859 case BC_INST_ASCIIFY:
6860 s = zbc_program_asciify();
6862 case BC_INST_PRINT_STREAM:
6863 s = zbc_program_printStream();
6866 case BC_INST_PUSH_VAR: {
6867 bool copy = inst == BC_INST_LOAD;
6868 s = zbc_program_pushVar(code, &ip->idx, true, copy);
6871 case BC_INST_PUSH_TO_VAR: {
6872 char *name = bc_program_name(code, &ip->idx);
6873 s = zbc_program_copyToVar(name, true);
6878 dbg_exec("BC_INST_NEG:");
6879 if (G.prog.stack.len <= 2)
6880 QUIT_OR_RETURN_TO_MAIN;
6881 bc_vec_npop(&G.prog.stack, 2);
6884 s = zbc_program_nquit();
6889 if (s || G_interrupt) {
6894 // If the stack has changed, pointers may be invalid.
6895 ip = bc_vec_top(&G.prog.stack);
6896 func = bc_program_func(ip->func);
6897 code = func->code.v;
6900 RETURN_STATUS(BC_STATUS_SUCCESS);
6902 #if ERRORS_ARE_FATAL
6903 # define zbc_program_exec(...) (zbc_program_exec(__VA_ARGS__), BC_STATUS_SUCCESS)
6906 static unsigned bc_vm_envLen(const char *var)
6912 len = BC_NUM_PRINT_WIDTH;
6913 if (!lenv) return len;
6915 len = bb_strtou(lenv, NULL, 10) - 1;
6916 if (errno || len < 2 || len >= INT_MAX)
6917 len = BC_NUM_PRINT_WIDTH;
6922 static BC_STATUS zbc_vm_process(const char *text)
6926 dbg_lex_enter("%s:%d entered", __func__, __LINE__);
6927 s = zbc_parse_text_init(&G.prs, text);
6928 if (s) RETURN_STATUS(s);
6930 while (G.prs.l.t.t != BC_LEX_EOF) {
6931 dbg_lex("%s:%d G.prs.l.t.t:%d", __func__, __LINE__, G.prs.l.t.t);
6932 ERROR_RETURN(s =) zcommon_parse(&G.prs);
6933 if (s) RETURN_STATUS(s);
6934 s = zbc_program_exec();
6942 dbg_lex_done("%s:%d done", __func__, __LINE__);
6945 #if ERRORS_ARE_FATAL
6946 # define zbc_vm_process(...) (zbc_vm_process(__VA_ARGS__), BC_STATUS_SUCCESS)
6949 static BC_STATUS zbc_vm_file(const char *file)
6951 // So far bc/dc have no way to include a file from another file,
6952 // therefore we know G.prog.file == NULL on entry
6953 //const char *sv_file;
6959 data = bc_read_file(file);
6960 if (!data) RETURN_STATUS(bc_error_fmt("file '%s' is not text", file));
6962 //sv_file = G.prog.file;
6964 bc_lex_file(&G.prs.l);
6965 s = zbc_vm_process(data);
6968 main_func = bc_program_func(BC_PROG_MAIN);
6969 ip = bc_vec_item(&G.prog.stack, 0);
6971 if (main_func->code.len < ip->idx)
6972 s = bc_error_fmt("file '%s' is not executable", file);
6975 //G.prog.file = sv_file;
6980 #if ERRORS_ARE_FATAL
6981 # define zbc_vm_file(...) (zbc_vm_file(__VA_ARGS__), BC_STATUS_SUCCESS)
6984 static BC_STATUS zbc_vm_stdin(void)
6988 //G.prog.file = NULL; - already is
6989 bc_lex_file(&G.prs.l);
6993 s = zbc_vm_process("");
6994 // We do not stop looping on errors here.
6995 // Example: start interactive bc and enter "return".
6996 // It should say "'return' not in a function"
6997 // but should not exit.
6998 } while (G.use_stdin);
7001 #if ERRORS_ARE_FATAL
7002 # define zbc_vm_stdin(...) (zbc_vm_stdin(__VA_ARGS__), BC_STATUS_SUCCESS)
7006 static void bc_vm_info(void)
7008 printf("%s "BB_VER"\n"
7009 "Copyright (c) 2018 Gavin D. Howard and contributors\n"
7013 static void bc_args(char **argv)
7019 #if ENABLE_FEATURE_BC_LONG_OPTIONS
7020 opts = option_mask32 |= getopt32long(argv, "wvsqli",
7021 "warn\0" No_argument "w"
7022 "version\0" No_argument "v"
7023 "standard\0" No_argument "s"
7024 "quiet\0" No_argument "q"
7025 "mathlib\0" No_argument "l"
7026 "interactive\0" No_argument "i"
7029 opts = option_mask32 |= getopt32(argv, "wvsqli");
7031 if (getenv("POSIXLY_CORRECT"))
7032 option_mask32 |= BC_FLAG_S;
7034 if (opts & BC_FLAG_V) {
7039 for (i = optind; argv[i]; ++i)
7040 bc_vec_push(&G.files, argv + i);
7043 static void bc_vm_envArgs(void)
7047 char *env_args = getenv("BC_ENV_ARGS");
7049 if (!env_args) return;
7051 G.env_args = xstrdup(env_args);
7054 bc_vec_init(&v, sizeof(char *), NULL);
7056 while (*(buf = skip_whitespace(buf)) != '\0') {
7057 bc_vec_push(&v, &buf);
7058 buf = skip_non_whitespace(buf);
7064 // NULL terminate, and pass argv[] so that first arg is argv[1]
7065 if (sizeof(int) == sizeof(char*)) {
7066 bc_vec_push(&v, &const_int_0);
7068 static char *const nullptr = NULL;
7069 bc_vec_push(&v, &nullptr);
7071 bc_args(((char **)v.v) - 1);
7076 static const char bc_lib[] ALIGN1 = {
7079 "\n" "auto b,s,n,r,d,i,p,f,v"
7080 ////////////////"if(x<0)return(1/e(-x))" // and drop 'n' and x<0 logic below
7081 //^^^^^^^^^^^^^^^^ this would work, and is even more precise than GNU bc:
7082 //e(-.998896): GNU:.36828580434569428695
7083 // above code:.36828580434569428696
7084 // actual value:.3682858043456942869594...
7085 // but for now let's be "GNU compatible"
7094 "\n" "scale=scale(x)+1"
7104 "\n" "for(i=2;v;++i){"
7110 "\n" "while(d--)r*=r"
7113 "\n" "if(n)return(1/r)"
7117 "\n" "auto b,s,r,p,a,q,i,v"
7121 "\n" "r=(1-10^scale)/1"
7132 "\n" "while(x<=.5){"
7136 "\n" "r=a=(x-1)/(x+1)"
7139 "\n" "for(i=3;v;i+=2){"
7150 "\n" "auto b,s,r,a,q,i"
7151 "\n" "if(x<0)return(-s(-x))"
7155 "\n" "scale=1.1*s+2"
7164 "\n" "for(i=3;a;i+=2){"
7165 "\n" "a*=q/(i*(i-1))"
7178 "\n" "x=s(2*a(1)+x)"
7184 "\n" "auto b,s,r,n,a,m,t,f,i,u"
7192 "\n" "if(scale<65){"
7193 "\n" "if(x==1)return(.7853981633974483096156608458198757210492923498437764552437361480/n)"
7194 "\n" "if(x==.2)return(.1973955598498807583700497651947902934475851037878521015176889402/n)"
7204 "\n" "x=(x-.2)/(1+.2*x)"
7209 "\n" "for(i=3;t;i+=2){"
7216 "\n" "return((m*a+r)/n)"
7218 "\n" "define j(n,x){"
7219 "\n" "auto b,s,o,a,i,v,f"
7230 "\n" "for(i=2;i<=n;++i)a*=i"
7232 "\n" "a=(x^n)/2^n/a"
7235 "\n" "scale+=length(a)-scale(a)"
7236 "\n" "for(i=1;v;++i){"
7237 "\n" "v=v*f/i/(n+i)"
7243 "\n" "return(a*r/1)"
7248 static BC_STATUS zbc_vm_exec(void)
7254 if (option_mask32 & BC_FLAG_L) {
7255 // We know that internal library is not buggy,
7256 // thus error checking is normally disabled.
7257 # define DEBUG_LIB 0
7258 bc_lex_file(&G.prs.l);
7259 s = zbc_vm_process(bc_lib);
7260 if (DEBUG_LIB && s) RETURN_STATUS(s);
7264 s = BC_STATUS_SUCCESS;
7265 for (i = 0; !s && i < G.files.len; ++i)
7266 s = zbc_vm_file(*((char **) bc_vec_item(&G.files, i)));
7267 if (ENABLE_FEATURE_CLEAN_UP && s && !G_ttyin) {
7268 // Debug config, non-interactive mode:
7269 // return all the way back to main.
7270 // Non-debug builds do not come here, they exit.
7274 if (IS_BC || (option_mask32 & BC_FLAG_I))
7279 #if ERRORS_ARE_FATAL
7280 # define zbc_vm_exec(...) (zbc_vm_exec(__VA_ARGS__), BC_STATUS_SUCCESS)
7283 #if ENABLE_FEATURE_CLEAN_UP
7284 static void bc_program_free(void)
7286 bc_num_free(&G.prog.ib);
7287 bc_num_free(&G.prog.ob);
7288 bc_num_free(&G.prog.hexb);
7290 bc_num_free(&G.prog.strmb);
7292 bc_vec_free(&G.prog.fns);
7293 bc_vec_free(&G.prog.fn_map);
7294 bc_vec_free(&G.prog.vars);
7295 bc_vec_free(&G.prog.var_map);
7296 bc_vec_free(&G.prog.arrs);
7297 bc_vec_free(&G.prog.arr_map);
7298 bc_vec_free(&G.prog.strs);
7299 bc_vec_free(&G.prog.consts);
7300 bc_vec_free(&G.prog.results);
7301 bc_vec_free(&G.prog.stack);
7302 bc_num_free(&G.prog.last);
7303 bc_num_free(&G.prog.zero);
7304 bc_num_free(&G.prog.one);
7305 bc_vec_free(&G.stdin_buffer);
7308 static void bc_vm_free(void)
7310 bc_vec_free(&G.files);
7312 bc_parse_free(&G.prs);
7317 static void bc_program_init(void)
7322 // memset(&G.prog, 0, sizeof(G.prog)); - already is
7323 memset(&ip, 0, sizeof(BcInstPtr));
7325 // G.prog.nchars = G.prog.scale = 0; - already is
7326 bc_num_init_DEF_SIZE(&G.prog.ib);
7327 bc_num_ten(&G.prog.ib);
7330 bc_num_init_DEF_SIZE(&G.prog.ob);
7331 bc_num_ten(&G.prog.ob);
7334 bc_num_init_DEF_SIZE(&G.prog.hexb);
7335 bc_num_ten(&G.prog.hexb);
7336 G.prog.hexb.num[0] = 6;
7339 bc_num_init_DEF_SIZE(&G.prog.strmb);
7340 bc_num_ulong2num(&G.prog.strmb, UCHAR_MAX + 1);
7343 bc_num_init_DEF_SIZE(&G.prog.last);
7344 //bc_num_zero(&G.prog.last); - already is
7346 bc_num_init_DEF_SIZE(&G.prog.zero);
7347 //bc_num_zero(&G.prog.zero); - already is
7349 bc_num_init_DEF_SIZE(&G.prog.one);
7350 bc_num_one(&G.prog.one);
7352 bc_vec_init(&G.prog.fns, sizeof(BcFunc), bc_func_free);
7353 bc_vec_init(&G.prog.fn_map, sizeof(BcId), bc_id_free);
7355 bc_program_addFunc(xstrdup("(main)"), &idx);
7356 bc_program_addFunc(xstrdup("(read)"), &idx);
7358 bc_vec_init(&G.prog.vars, sizeof(BcVec), bc_vec_free);
7359 bc_vec_init(&G.prog.var_map, sizeof(BcId), bc_id_free);
7361 bc_vec_init(&G.prog.arrs, sizeof(BcVec), bc_vec_free);
7362 bc_vec_init(&G.prog.arr_map, sizeof(BcId), bc_id_free);
7364 bc_vec_init(&G.prog.strs, sizeof(char *), bc_string_free);
7365 bc_vec_init(&G.prog.consts, sizeof(char *), bc_string_free);
7366 bc_vec_init(&G.prog.results, sizeof(BcResult), bc_result_free);
7367 bc_vec_init(&G.prog.stack, sizeof(BcInstPtr), NULL);
7368 bc_vec_push(&G.prog.stack, &ip);
7370 bc_char_vec_init(&G.stdin_buffer);
7373 static int bc_vm_init(const char *env_len)
7375 #if ENABLE_FEATURE_EDITING
7376 G.line_input_state = new_line_input_t(DO_HISTORY);
7378 G.prog.len = bc_vm_envLen(env_len);
7380 bc_vec_init(&G.files, sizeof(char *), NULL);
7381 IF_BC(if (IS_BC) bc_vm_envArgs();)
7383 bc_parse_create(&G.prs, BC_PROG_MAIN);
7385 //TODO: in GNU bc, the check is (isatty(0) && isatty(1)),
7386 //-i option unconditionally enables this regardless of isatty():
7388 #if ENABLE_FEATURE_BC_SIGNALS
7390 // With SA_RESTART, most system calls will restart
7391 // (IOW: they won't fail with EINTR).
7392 // In particular, this means ^C won't cause
7393 // stdout to get into "error state" if SIGINT hits
7394 // within write() syscall.
7396 // The downside is that ^C while tty input is taken
7397 // will only be handled after [Enter] since read()
7398 // from stdin is not interrupted by ^C either,
7399 // it restarts, thus fgetc() does not return on ^C.
7400 // (This problem manifests only if line editing is disabled)
7401 signal_SA_RESTART_empty_mask(SIGINT, record_signo);
7403 // Without SA_RESTART, this exhibits a bug:
7404 // "while (1) print 1" and try ^C-ing it.
7405 // Intermittently, instead of returning to input line,
7406 // you'll get "output error: Interrupted system call"
7408 //signal_no_SA_RESTART_empty_mask(SIGINT, record_signo);
7412 return 0; // "not a tty"
7415 static BcStatus bc_vm_run(void)
7417 BcStatus st = zbc_vm_exec();
7418 #if ENABLE_FEATURE_CLEAN_UP
7419 if (G_exiting) // it was actually "halt" or "quit"
7422 # if ENABLE_FEATURE_EDITING
7423 free_line_input_t(G.line_input_state);
7427 dbg_exec("exiting with exitcode %d", st);
7432 int bc_main(int argc, char **argv) MAIN_EXTERNALLY_VISIBLE;
7433 int bc_main(int argc UNUSED_PARAM, char **argv)
7439 is_tty = bc_vm_init("BC_LINE_LENGTH");
7443 if (is_tty && !(option_mask32 & BC_FLAG_Q))
7451 int dc_main(int argc, char **argv) MAIN_EXTERNALLY_VISIBLE;
7452 int dc_main(int argc UNUSED_PARAM, char **argv)
7458 // TODO: dc (GNU bc 1.07.1) 1.4.1 seems to use width
7459 // 1 char wider than bc from the same package.
7460 // Both default width, and xC_LINE_LENGTH=N are wider:
7461 // "DC_LINE_LENGTH=5 dc -e'123456 p'" prints:
7464 // "echo '123456' | BC_LINE_LENGTH=5 bc" prints:
7467 // Do the same, or it's a bug?
7468 bc_vm_init("DC_LINE_LENGTH");
7470 // Run -e'SCRIPT' and -fFILE in order of appearance, then handle FILEs
7471 noscript = BC_FLAG_I;
7473 int n = getopt(argc, argv, "e:f:x");
7479 n = zbc_vm_process(optarg);
7484 n = zbc_vm_file(optarg);
7488 option_mask32 |= DC_FLAG_X;
7498 bc_vec_push(&G.files, argv++);
7501 option_mask32 |= noscript; // set BC_FLAG_I if we need to interpret stdin
7507 #endif // not DC_SMALL