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 typedef enum BcStatus {
171 BC_STATUS_SUCCESS = 0,
172 BC_STATUS_FAILURE = 1,
173 BC_STATUS_PARSE_EMPTY_EXP = 2, // bc_parse_expr_empty_ok() uses this
176 #define BC_VEC_INVALID_IDX ((size_t) -1)
177 #define BC_VEC_START_CAP (1 << 5)
179 typedef void (*BcVecFree)(void *) FAST_FUNC;
181 typedef struct BcVec {
189 typedef signed char BcDig;
191 typedef struct BcNum {
199 #define BC_NUM_MIN_BASE ((unsigned long) 2)
200 #define BC_NUM_MAX_IBASE ((unsigned long) 16)
201 // larger value might speed up BIGNUM calculations a bit:
202 #define BC_NUM_DEF_SIZE (16)
203 #define BC_NUM_PRINT_WIDTH (69)
205 #define BC_NUM_KARATSUBA_LEN (32)
207 typedef enum BcInst {
237 BC_INST_ASSIGN_POWER,
238 BC_INST_ASSIGN_MULTIPLY,
239 BC_INST_ASSIGN_DIVIDE,
240 BC_INST_ASSIGN_MODULUS,
242 BC_INST_ASSIGN_MINUS,
288 BC_INST_PRINT_STREAM,
303 BC_INST_INVALID = -1,
308 typedef struct BcId {
313 typedef struct BcFunc {
320 typedef enum BcResultType {
325 BC_RESULT_ARRAY_ELEM,
334 // These are between to calculate ibase, obase, and last from instructions.
342 typedef union BcResultData {
348 typedef struct BcResult {
353 typedef struct BcInstPtr {
359 // BC_LEX_NEG is not used in lexing; it is only for parsing.
360 typedef enum BcLexType {
388 BC_LEX_OP_ASSIGN_POWER,
389 BC_LEX_OP_ASSIGN_MULTIPLY,
390 BC_LEX_OP_ASSIGN_DIVIDE,
391 BC_LEX_OP_ASSIGN_MODULUS,
392 BC_LEX_OP_ASSIGN_PLUS,
393 BC_LEX_OP_ASSIGN_MINUS,
414 BC_LEX_KEY_1st_keyword,
415 BC_LEX_KEY_AUTO = BC_LEX_KEY_1st_keyword,
422 // code uses "type - BC_LEX_KEY_IBASE + BC_INST_IBASE" construct,
423 BC_LEX_KEY_IBASE, // relative order should match for: BC_INST_IBASE
425 BC_LEX_KEY_LAST, // relative order should match for: BC_INST_LAST
428 BC_LEX_KEY_OBASE, // relative order should match for: BC_INST_OBASE
466 // must match order of BC_LEX_KEY_foo etc above
468 struct BcLexKeyword {
471 #define BC_LEX_KW_ENTRY(a, b) \
472 { .name8 = a /*, .posix = b */ }
473 static const struct BcLexKeyword bc_lex_kws[20] = {
474 BC_LEX_KW_ENTRY("auto" , 1), // 0
475 BC_LEX_KW_ENTRY("break" , 1), // 1
476 BC_LEX_KW_ENTRY("continue", 0), // 2 note: this one has no terminating NUL
477 BC_LEX_KW_ENTRY("define" , 1), // 3
478 BC_LEX_KW_ENTRY("else" , 0), // 4
479 BC_LEX_KW_ENTRY("for" , 1), // 5
480 BC_LEX_KW_ENTRY("halt" , 0), // 6
481 BC_LEX_KW_ENTRY("ibase" , 1), // 7
482 BC_LEX_KW_ENTRY("if" , 1), // 8
483 BC_LEX_KW_ENTRY("last" , 0), // 9
484 BC_LEX_KW_ENTRY("length" , 1), // 10
485 BC_LEX_KW_ENTRY("limits" , 0), // 11
486 BC_LEX_KW_ENTRY("obase" , 1), // 12
487 BC_LEX_KW_ENTRY("print" , 0), // 13
488 BC_LEX_KW_ENTRY("quit" , 1), // 14
489 BC_LEX_KW_ENTRY("read" , 0), // 15
490 BC_LEX_KW_ENTRY("return" , 1), // 16
491 BC_LEX_KW_ENTRY("scale" , 1), // 17
492 BC_LEX_KW_ENTRY("sqrt" , 1), // 18
493 BC_LEX_KW_ENTRY("while" , 1), // 19
495 #undef BC_LEX_KW_ENTRY
519 #define bc_lex_kws_POSIX(i) ((1 << (i)) & POSIX_KWORD_MASK)
522 #if ENABLE_FEATURE_BC_SIGNALS || ENABLE_FEATURE_CLEAN_UP
523 # define BC_STATUS BcStatus
525 # define BC_STATUS void
528 typedef struct BcLex {
544 #define BC_PARSE_STREND ((char) UCHAR_MAX)
546 #define BC_PARSE_REL (1 << 0)
547 #define BC_PARSE_PRINT (1 << 1)
548 #define BC_PARSE_NOCALL (1 << 2)
549 #define BC_PARSE_NOREAD (1 << 3)
550 #define BC_PARSE_ARRAY (1 << 4)
552 #define BC_PARSE_TOP_FLAG_PTR(parse) ((uint8_t *) bc_vec_top(&(parse)->flags))
553 #define BC_PARSE_TOP_FLAG(parse) (*(BC_PARSE_TOP_FLAG_PTR(parse)))
555 #define BC_PARSE_FLAG_FUNC_INNER (1 << 0)
556 #define BC_PARSE_FUNC_INNER(parse) \
557 (BC_PARSE_TOP_FLAG(parse) & BC_PARSE_FLAG_FUNC_INNER)
559 #define BC_PARSE_FLAG_FUNC (1 << 1)
560 #define BC_PARSE_FUNC(parse) (BC_PARSE_TOP_FLAG(parse) & BC_PARSE_FLAG_FUNC)
562 #define BC_PARSE_FLAG_BODY (1 << 2)
563 #define BC_PARSE_BODY(parse) (BC_PARSE_TOP_FLAG(parse) & BC_PARSE_FLAG_BODY)
565 #define BC_PARSE_FLAG_LOOP (1 << 3)
566 #define BC_PARSE_LOOP(parse) (BC_PARSE_TOP_FLAG(parse) & BC_PARSE_FLAG_LOOP)
568 #define BC_PARSE_FLAG_LOOP_INNER (1 << 4)
569 #define BC_PARSE_LOOP_INNER(parse) \
570 (BC_PARSE_TOP_FLAG(parse) & BC_PARSE_FLAG_LOOP_INNER)
572 #define BC_PARSE_FLAG_IF (1 << 5)
573 #define BC_PARSE_IF(parse) (BC_PARSE_TOP_FLAG(parse) & BC_PARSE_FLAG_IF)
575 #define BC_PARSE_FLAG_ELSE (1 << 6)
576 #define BC_PARSE_ELSE(parse) (BC_PARSE_TOP_FLAG(parse) & BC_PARSE_FLAG_ELSE)
578 #define BC_PARSE_FLAG_IF_END (1 << 7)
579 #define BC_PARSE_IF_END(parse) (BC_PARSE_TOP_FLAG(parse) & BC_PARSE_FLAG_IF_END)
581 #define BC_PARSE_CAN_EXEC(parse) \
582 (!(BC_PARSE_TOP_FLAG(parse) & \
583 (BC_PARSE_FLAG_FUNC_INNER | BC_PARSE_FLAG_FUNC | BC_PARSE_FLAG_BODY | \
584 BC_PARSE_FLAG_LOOP | BC_PARSE_FLAG_LOOP_INNER | BC_PARSE_FLAG_IF | \
585 BC_PARSE_FLAG_ELSE | BC_PARSE_FLAG_IF_END)))
591 typedef struct BcParse {
610 typedef struct BcProgram {
651 #define BC_PROG_STACK(s, n) ((s)->len >= ((size_t) n))
653 #define BC_PROG_MAIN (0)
654 #define BC_PROG_READ (1)
656 #define BC_PROG_REQ_FUNCS (2)
659 #define BC_PROG_STR(n) (!(n)->num && !(n)->cap)
660 #define BC_PROG_NUM(r, n) \
661 ((r)->t != BC_RESULT_ARRAY && (r)->t != BC_RESULT_STR && !BC_PROG_STR(n))
663 #define BC_FLAG_W (1 << 0)
664 #define BC_FLAG_V (1 << 1)
665 #define BC_FLAG_S (1 << 2)
666 #define BC_FLAG_Q (1 << 3)
667 #define BC_FLAG_L (1 << 4)
668 #define BC_FLAG_I (1 << 5)
669 #define DC_FLAG_X (1 << 6)
671 #define BC_MAX(a, b) ((a) > (b) ? (a) : (b))
672 #define BC_MIN(a, b) ((a) < (b) ? (a) : (b))
674 #define BC_MAX_OBASE ((unsigned) 999)
675 #define BC_MAX_DIM ((unsigned) INT_MAX)
676 #define BC_MAX_SCALE ((unsigned) UINT_MAX)
677 #define BC_MAX_STRING ((unsigned) UINT_MAX - 1)
678 #define BC_MAX_NUM BC_MAX_STRING
679 // Unused apart from "limits" message. Just show a "biggish number" there.
680 //#define BC_MAX_NAME BC_MAX_STRING
681 //#define BC_MAX_EXP ((unsigned long) LONG_MAX)
682 //#define BC_MAX_VARS ((unsigned long) SIZE_MAX - 1)
683 #define BC_MAX_NAME_STR "999999999"
684 #define BC_MAX_EXP_STR "999999999"
685 #define BC_MAX_VARS_STR "999999999"
687 #define BC_MAX_OBASE_STR "999"
689 #if INT_MAX == 2147483647
690 # define BC_MAX_DIM_STR "2147483647"
691 #elif INT_MAX == 9223372036854775807
692 # define BC_MAX_DIM_STR "9223372036854775807"
694 # error Strange INT_MAX
697 #if UINT_MAX == 4294967295
698 # define BC_MAX_SCALE_STR "4294967295"
699 # define BC_MAX_STRING_STR "4294967294"
700 #elif UINT_MAX == 18446744073709551615
701 # define BC_MAX_SCALE_STR "18446744073709551615"
702 # define BC_MAX_STRING_STR "18446744073709551614"
704 # error Strange UINT_MAX
706 #define BC_MAX_NUM_STR BC_MAX_STRING_STR
709 IF_FEATURE_BC_SIGNALS(smallint ttyin;)
710 IF_FEATURE_CLEAN_UP(smallint exiting;)
716 // For error messages. Can be set to current parsed line,
717 // or [TODO] to current executing line (can be before last parsed one)
724 #if ENABLE_FEATURE_EDITING
725 line_input_t *line_input_state;
728 #define G (*ptr_to_globals)
729 #define INIT_G() do { \
730 SET_PTR_TO_GLOBALS(xzalloc(sizeof(G))); \
732 #define FREE_G() do { \
733 FREE_PTR_TO_GLOBALS(); \
735 #define G_posix (ENABLE_BC && (option_mask32 & BC_FLAG_S))
736 #define G_warn (ENABLE_BC && (option_mask32 & BC_FLAG_W))
737 #define G_exreg (ENABLE_DC && (option_mask32 & DC_FLAG_X))
738 #if ENABLE_FEATURE_BC_SIGNALS
739 # define G_interrupt bb_got_signal
740 # define G_ttyin G.ttyin
742 # define G_interrupt 0
745 #if ENABLE_FEATURE_CLEAN_UP
746 # define G_exiting G.exiting
750 #define IS_BC (ENABLE_BC && (!ENABLE_DC || applet_name[0] == 'b'))
751 #define IS_DC (ENABLE_DC && (!ENABLE_BC || applet_name[0] != 'b'))
755 // This is a bit array that corresponds to token types. An entry is
756 // true if the token is valid in an expression, false otherwise.
758 BC_PARSE_EXPRS_BITS = 0
759 + ((uint64_t)((0 << 0)+(0 << 1)+(1 << 2)+(1 << 3)+(1 << 4)+(1 << 5)+(1 << 6)+(1 << 7)) << (0*8))
760 + ((uint64_t)((1 << 0)+(1 << 1)+(1 << 2)+(1 << 3)+(1 << 4)+(1 << 5)+(1 << 6)+(1 << 7)) << (1*8))
761 + ((uint64_t)((1 << 0)+(1 << 1)+(1 << 2)+(1 << 3)+(1 << 4)+(1 << 5)+(1 << 6)+(1 << 7)) << (2*8))
762 + ((uint64_t)((1 << 0)+(1 << 1)+(1 << 2)+(0 << 3)+(0 << 4)+(1 << 5)+(1 << 6)+(0 << 7)) << (3*8))
763 + ((uint64_t)((0 << 0)+(0 << 1)+(0 << 2)+(0 << 3)+(0 << 4)+(0 << 5)+(1 << 6)+(1 << 7)) << (4*8))
764 + ((uint64_t)((0 << 0)+(0 << 1)+(0 << 2)+(0 << 3)+(0 << 4)+(0 << 5)+(0 << 6)+(1 << 7)) << (5*8))
765 + ((uint64_t)((0 << 0)+(1 << 1)+(1 << 2)+(1 << 3)+(1 << 4)+(0 << 5)+(0 << 6)+(1 << 7)) << (6*8))
766 + ((uint64_t)((0 << 0)+(1 << 1)+(1 << 2)+(0 << 3) ) << (7*8))
768 static ALWAYS_INLINE long bc_parse_exprs(unsigned i)
770 #if ULONG_MAX > 0xffffffff
771 // 64-bit version (will not work correctly for 32-bit longs!)
772 return BC_PARSE_EXPRS_BITS & (1UL << i);
775 unsigned long m = (uint32_t)BC_PARSE_EXPRS_BITS;
777 m = (uint32_t)(BC_PARSE_EXPRS_BITS >> 32);
780 return m & (1UL << i);
784 // This is an array of data for operators that correspond to token types.
785 static const uint8_t bc_parse_ops[] = {
786 #define OP(p,l) ((int)(l) * 0x10 + (p))
787 OP(0, false), OP( 0, false ), // inc dec
790 OP(3, true ), OP( 3, true ), OP( 3, true ), // pow mul div
791 OP(4, true ), OP( 4, true ), // mod + -
792 OP(6, true ), OP( 6, true ), OP( 6, true ), OP( 6, true ), OP( 6, true ), OP( 6, true ), // == <= >= != < >
794 OP(7, true ), OP( 7, true ), // or and
795 OP(5, false), OP( 5, false ), OP( 5, false ), OP( 5, false ), OP( 5, false ), // ^= *= /= %= +=
796 OP(5, false), OP( 5, false ), // -= =
799 #define bc_parse_op_PREC(i) (bc_parse_ops[i] & 0x0f)
800 #define bc_parse_op_LEFT(i) (bc_parse_ops[i] & 0x10)
802 // Byte array of up to 4 BC_LEX's, packed into 32-bit word
803 typedef uint32_t BcParseNext;
805 // These identify what tokens can come after expressions in certain cases.
807 #define BC_PARSE_NEXT4(a,b,c,d) ( (a) | ((b)<<8) | ((c)<<16) | ((((d)|0x80)<<24)) )
808 #define BC_PARSE_NEXT2(a,b) BC_PARSE_NEXT4(a,b,0xff,0xff)
809 #define BC_PARSE_NEXT1(a) BC_PARSE_NEXT4(a,0xff,0xff,0xff)
810 bc_parse_next_expr = BC_PARSE_NEXT4(BC_LEX_NLINE, BC_LEX_SCOLON, BC_LEX_RBRACE, BC_LEX_EOF),
811 bc_parse_next_param = BC_PARSE_NEXT2(BC_LEX_RPAREN, BC_LEX_COMMA),
812 bc_parse_next_print = BC_PARSE_NEXT4(BC_LEX_COMMA, BC_LEX_NLINE, BC_LEX_SCOLON, BC_LEX_EOF),
813 bc_parse_next_rel = BC_PARSE_NEXT1(BC_LEX_RPAREN),
814 bc_parse_next_elem = BC_PARSE_NEXT1(BC_LEX_RBRACKET),
815 bc_parse_next_for = BC_PARSE_NEXT1(BC_LEX_SCOLON),
816 bc_parse_next_read = BC_PARSE_NEXT2(BC_LEX_NLINE, BC_LEX_EOF),
817 #undef BC_PARSE_NEXT4
818 #undef BC_PARSE_NEXT2
819 #undef BC_PARSE_NEXT1
824 static const //BcLexType - should be this type, but narrower type saves size:
827 BC_LEX_OP_REL_EQ, BC_LEX_OP_REL_LE, BC_LEX_OP_REL_GE, BC_LEX_OP_REL_NE,
828 BC_LEX_OP_REL_LT, BC_LEX_OP_REL_GT, BC_LEX_SCOLON, BC_LEX_COLON,
829 BC_LEX_ELSE, BC_LEX_LOAD, BC_LEX_LOAD_POP, BC_LEX_OP_ASSIGN,
833 static const //BcLexType - should be this type
836 BC_LEX_OP_MODULUS, BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_LPAREN,
837 BC_LEX_INVALID, BC_LEX_OP_MULTIPLY, BC_LEX_OP_PLUS, BC_LEX_INVALID,
838 BC_LEX_OP_MINUS, BC_LEX_INVALID, BC_LEX_OP_DIVIDE,
839 BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID,
840 BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID,
841 BC_LEX_INVALID, BC_LEX_INVALID,
842 BC_LEX_COLON, BC_LEX_SCOLON, BC_LEX_OP_REL_GT, BC_LEX_OP_REL_EQ,
843 BC_LEX_OP_REL_LT, BC_LEX_KEY_READ, BC_LEX_INVALID,
844 BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID,
845 BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_EQ_NO_REG, BC_LEX_INVALID,
846 BC_LEX_KEY_IBASE, BC_LEX_INVALID, BC_LEX_KEY_SCALE, BC_LEX_LOAD_POP,
847 BC_LEX_INVALID, BC_LEX_OP_BOOL_NOT, BC_LEX_KEY_OBASE, BC_LEX_PRINT_STREAM,
848 BC_LEX_NQUIT, BC_LEX_POP, BC_LEX_STORE_PUSH, BC_LEX_INVALID, BC_LEX_INVALID,
849 BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_SCALE_FACTOR, BC_LEX_INVALID,
850 BC_LEX_KEY_LENGTH, BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID,
851 BC_LEX_OP_POWER, BC_LEX_NEG, BC_LEX_INVALID,
852 BC_LEX_ASCIIFY, BC_LEX_INVALID, BC_LEX_CLEAR_STACK, BC_LEX_DUPLICATE,
853 BC_LEX_ELSE, BC_LEX_PRINT_STACK, BC_LEX_INVALID, BC_LEX_INVALID,
854 BC_LEX_STORE_IBASE, BC_LEX_INVALID, BC_LEX_STORE_SCALE, BC_LEX_LOAD,
855 BC_LEX_INVALID, BC_LEX_PRINT_POP, BC_LEX_STORE_OBASE, BC_LEX_KEY_PRINT,
856 BC_LEX_KEY_QUIT, BC_LEX_SWAP, BC_LEX_OP_ASSIGN, BC_LEX_INVALID,
857 BC_LEX_INVALID, BC_LEX_KEY_SQRT, BC_LEX_INVALID, BC_LEX_EXECUTE,
858 BC_LEX_INVALID, BC_LEX_STACK_LEVEL,
859 BC_LEX_LBRACE, BC_LEX_OP_MODEXP, BC_LEX_INVALID, BC_LEX_OP_DIVMOD,
863 static const //BcInst - should be this type. Using signed narrow type since BC_INST_INVALID is -1
866 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID, BC_INST_REL_GE,
867 BC_INST_INVALID, BC_INST_POWER, BC_INST_MULTIPLY, BC_INST_DIVIDE,
868 BC_INST_MODULUS, BC_INST_PLUS, BC_INST_MINUS,
869 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID,
870 BC_INST_INVALID, BC_INST_INVALID,
871 BC_INST_BOOL_NOT, BC_INST_INVALID, BC_INST_INVALID,
872 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID,
873 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID,
874 BC_INST_INVALID, BC_INST_INVALID, BC_INST_REL_GT, BC_INST_INVALID,
875 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID, BC_INST_REL_GE,
876 BC_INST_INVALID, BC_INST_INVALID,
877 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID,
878 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID,
879 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID, BC_INST_IBASE,
880 BC_INST_INVALID, BC_INST_INVALID, BC_INST_LENGTH, BC_INST_INVALID,
881 BC_INST_OBASE, BC_INST_PRINT, BC_INST_QUIT, BC_INST_INVALID,
882 BC_INST_INVALID, BC_INST_SCALE, BC_INST_SQRT, BC_INST_INVALID,
883 BC_INST_REL_EQ, BC_INST_MODEXP, BC_INST_DIVMOD, BC_INST_INVALID,
884 BC_INST_INVALID, BC_INST_EXECUTE, BC_INST_PRINT_STACK, BC_INST_CLEAR_STACK,
885 BC_INST_STACK_LEN, BC_INST_DUPLICATE, BC_INST_SWAP, BC_INST_POP,
886 BC_INST_ASCIIFY, BC_INST_PRINT_STREAM, BC_INST_INVALID, BC_INST_INVALID,
887 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID,
888 BC_INST_PRINT, BC_INST_NQUIT, BC_INST_SCALE_FUNC,
892 // In configurations where errors abort instead of propagating error
893 // return code up the call chain, functions returning BC_STATUS
894 // actually don't return anything, they always succeed and return "void".
895 // A macro wrapper is provided, which makes this statement work:
897 // and makes it visible to the compiler that s is always zero,
898 // allowing compiler to optimize dead code after the statement.
900 // To make code more readable, each such function has a "z"
901 // ("always returning zero") prefix, i.e. zbc_foo or zdc_foo.
903 #if ENABLE_FEATURE_BC_SIGNALS || ENABLE_FEATURE_CLEAN_UP
904 # define ERRORS_ARE_FATAL 0
905 # define ERRORFUNC /*nothing*/
906 # define ERROR_RETURN(a) a
907 //moved up: # define BC_STATUS BcStatus
908 # define RETURN_STATUS(v) return (v)
910 # define ERRORS_ARE_FATAL 1
911 # define ERRORFUNC NORETURN
912 # define ERROR_RETURN(a) /*nothing*/
913 //moved up: # define BC_STATUS void
914 # define RETURN_STATUS(v) do { ((void)(v)); return; } while (0)
917 #define BC_NUM_NEG(n, neg) ((((ssize_t)(n)) ^ -((ssize_t)(neg))) + (neg))
918 #define BC_NUM_ONE(n) ((n)->len == 1 && (n)->rdx == 0 && (n)->num[0] == 1)
919 #define BC_NUM_INT(n) ((n)->len - (n)->rdx)
920 //#define BC_NUM_AREQ(a, b) (BC_MAX((a)->rdx, (b)->rdx) + BC_MAX(BC_NUM_INT(a), BC_NUM_INT(b)) + 1)
921 static /*ALWAYS_INLINE*/ size_t BC_NUM_AREQ(BcNum *a, BcNum *b)
923 return BC_MAX(a->rdx, b->rdx) + BC_MAX(BC_NUM_INT(a), BC_NUM_INT(b)) + 1;
925 //#define BC_NUM_MREQ(a, b, scale) (BC_NUM_INT(a) + BC_NUM_INT(b) + BC_MAX((scale), (a)->rdx + (b)->rdx) + 1)
926 static /*ALWAYS_INLINE*/ size_t BC_NUM_MREQ(BcNum *a, BcNum *b, size_t scale)
928 return BC_NUM_INT(a) + BC_NUM_INT(b) + BC_MAX(scale, a->rdx + b->rdx) + 1;
931 typedef void (*BcNumDigitOp)(size_t, size_t, bool) FAST_FUNC;
933 typedef BC_STATUS (*BcNumBinaryOp)(BcNum *, BcNum *, BcNum *, size_t) FAST_FUNC;
935 static BC_STATUS zbc_num_binary(BcNum *a, BcNum *b, BcNum *c, size_t scale,
936 BcNumBinaryOp op, size_t req);
937 static FAST_FUNC BC_STATUS zbc_num_a(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale);
938 static FAST_FUNC BC_STATUS zbc_num_s(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale);
939 static FAST_FUNC BC_STATUS zbc_num_p(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale);
940 static FAST_FUNC BC_STATUS zbc_num_m(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale);
941 static FAST_FUNC BC_STATUS zbc_num_d(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale);
942 static FAST_FUNC BC_STATUS zbc_num_rem(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale);
944 static FAST_FUNC BC_STATUS zbc_num_add(BcNum *a, BcNum *b, BcNum *c, size_t scale)
946 BcNumBinaryOp op = (!a->neg == !b->neg) ? zbc_num_a : zbc_num_s;
948 RETURN_STATUS(zbc_num_binary(a, b, c, false, op, BC_NUM_AREQ(a, b)));
951 static FAST_FUNC BC_STATUS zbc_num_sub(BcNum *a, BcNum *b, BcNum *c, size_t scale)
953 BcNumBinaryOp op = (!a->neg == !b->neg) ? zbc_num_s : zbc_num_a;
955 RETURN_STATUS(zbc_num_binary(a, b, c, true, op, BC_NUM_AREQ(a, b)));
958 static FAST_FUNC BC_STATUS zbc_num_mul(BcNum *a, BcNum *b, BcNum *c, size_t scale)
960 size_t req = BC_NUM_MREQ(a, b, scale);
961 RETURN_STATUS(zbc_num_binary(a, b, c, scale, zbc_num_m, req));
964 static FAST_FUNC BC_STATUS zbc_num_div(BcNum *a, BcNum *b, BcNum *c, size_t scale)
966 size_t req = BC_NUM_MREQ(a, b, scale);
967 RETURN_STATUS(zbc_num_binary(a, b, c, scale, zbc_num_d, req));
970 static FAST_FUNC BC_STATUS zbc_num_mod(BcNum *a, BcNum *b, BcNum *c, size_t scale)
972 size_t req = BC_NUM_MREQ(a, b, scale);
973 RETURN_STATUS(zbc_num_binary(a, b, c, scale, zbc_num_rem, req));
976 static FAST_FUNC BC_STATUS zbc_num_pow(BcNum *a, BcNum *b, BcNum *c, size_t scale)
978 RETURN_STATUS(zbc_num_binary(a, b, c, scale, zbc_num_p, a->len * b->len + 1));
981 static const BcNumBinaryOp zbc_program_ops[] = {
982 zbc_num_pow, zbc_num_mul, zbc_num_div, zbc_num_mod, zbc_num_add, zbc_num_sub,
985 # define zbc_num_add(...) (zbc_num_add(__VA_ARGS__), BC_STATUS_SUCCESS)
986 # define zbc_num_sub(...) (zbc_num_sub(__VA_ARGS__), BC_STATUS_SUCCESS)
987 # define zbc_num_mul(...) (zbc_num_mul(__VA_ARGS__), BC_STATUS_SUCCESS)
988 # define zbc_num_div(...) (zbc_num_div(__VA_ARGS__), BC_STATUS_SUCCESS)
989 # define zbc_num_mod(...) (zbc_num_mod(__VA_ARGS__), BC_STATUS_SUCCESS)
990 # define zbc_num_pow(...) (zbc_num_pow(__VA_ARGS__), BC_STATUS_SUCCESS)
993 static void fflush_and_check(void)
996 if (ferror(stdout) || ferror(stderr))
997 bb_perror_msg_and_die("output error");
1000 #if ENABLE_FEATURE_CLEAN_UP
1001 #define QUIT_OR_RETURN_TO_MAIN \
1003 IF_FEATURE_BC_SIGNALS(G_ttyin = 0;) /* do not loop in main loop anymore */ \
1005 return BC_STATUS_FAILURE; \
1008 #define QUIT_OR_RETURN_TO_MAIN quit()
1011 static void quit(void) NORETURN;
1012 static void quit(void)
1015 bb_perror_msg_and_die("input error");
1020 static void bc_verror_msg(const char *fmt, va_list p)
1022 const char *sv = sv; // for compiler
1025 applet_name = xasprintf("%s: %s:%u", applet_name, G.prog.file, G.err_line);
1027 bb_verror_msg(fmt, p, NULL);
1029 free((char*)applet_name);
1034 static NOINLINE ERRORFUNC int bc_error_fmt(const char *fmt, ...)
1039 bc_verror_msg(fmt, p);
1042 if (!ENABLE_FEATURE_CLEAN_UP && !G_ttyin)
1044 ERROR_RETURN(return BC_STATUS_FAILURE;)
1048 static NOINLINE int bc_posix_error_fmt(const char *fmt, ...)
1052 // Are non-POSIX constructs totally ok?
1053 if (!(option_mask32 & (BC_FLAG_S|BC_FLAG_W)))
1054 return BC_STATUS_SUCCESS; // yes
1057 bc_verror_msg(fmt, p);
1060 // Do we treat non-POSIX constructs as errors?
1061 if (!(option_mask32 & BC_FLAG_S))
1062 return BC_STATUS_SUCCESS; // no, it's a warning
1063 if (!ENABLE_FEATURE_CLEAN_UP && !G_ttyin)
1065 return BC_STATUS_FAILURE;
1069 // We use error functions with "return bc_error(FMT[, PARAMS])" idiom.
1070 // This idiom begs for tail-call optimization, but for it to work,
1071 // function must not have caller-cleaned parameters on stack.
1072 // Unfortunately, vararg function API does exactly that on most arches.
1073 // Thus, use these shims for the cases when we have no vararg PARAMS:
1074 static ERRORFUNC int bc_error(const char *msg)
1076 ERROR_RETURN(return) bc_error_fmt("%s", msg);
1078 static ERRORFUNC int bc_error_bad_character(char c)
1080 ERROR_RETURN(return) bc_error_fmt("bad character '%c'", c);
1082 static ERRORFUNC int bc_error_bad_expression(void)
1084 ERROR_RETURN(return) bc_error("bad expression");
1086 static ERRORFUNC int bc_error_bad_token(void)
1088 ERROR_RETURN(return) bc_error("bad token");
1090 static ERRORFUNC int bc_error_stack_has_too_few_elements(void)
1092 ERROR_RETURN(return) bc_error("stack has too few elements");
1094 static ERRORFUNC int bc_error_variable_is_wrong_type(void)
1096 ERROR_RETURN(return) bc_error("variable is wrong type");
1098 static ERRORFUNC int bc_error_nested_read_call(void)
1100 ERROR_RETURN(return) bc_error("read() call inside of a read() call");
1103 static int bc_POSIX_requires(const char *msg)
1105 return bc_posix_error_fmt("POSIX requires %s", msg);
1107 static int bc_POSIX_does_not_allow(const char *msg)
1109 return bc_posix_error_fmt("%s%s", "POSIX does not allow ", msg);
1111 static int bc_POSIX_does_not_allow_bool_ops_this_is_bad(const char *msg)
1113 return bc_posix_error_fmt("%s%s %s", "POSIX does not allow ", "boolean operators; the following is bad:", msg);
1115 static int bc_POSIX_does_not_allow_empty_X_expression_in_for(const char *msg)
1117 return bc_posix_error_fmt("%san empty %s expression in a for loop", "POSIX does not allow ", msg);
1121 static void bc_vec_grow(BcVec *v, size_t n)
1123 size_t cap = v->cap * 2;
1124 while (cap < v->len + n) cap *= 2;
1125 v->v = xrealloc(v->v, v->size * cap);
1129 static void bc_vec_init(BcVec *v, size_t esize, BcVecFree dtor)
1132 v->cap = BC_VEC_START_CAP;
1135 v->v = xmalloc(esize * BC_VEC_START_CAP);
1138 static void bc_char_vec_init(BcVec *v)
1140 bc_vec_init(v, sizeof(char), NULL);
1143 static void bc_vec_expand(BcVec *v, size_t req)
1146 v->v = xrealloc(v->v, v->size * req);
1151 static void bc_vec_pop(BcVec *v)
1155 v->dtor(v->v + (v->size * v->len));
1158 static void bc_vec_npop(BcVec *v, size_t n)
1163 size_t len = v->len - n;
1164 while (v->len > len) v->dtor(v->v + (v->size * --v->len));
1168 static void bc_vec_pop_all(BcVec *v)
1170 bc_vec_npop(v, v->len);
1173 static void bc_vec_push(BcVec *v, const void *data)
1175 if (v->len + 1 > v->cap) bc_vec_grow(v, 1);
1176 memmove(v->v + (v->size * v->len), data, v->size);
1180 static void bc_vec_pushByte(BcVec *v, char data)
1182 bc_vec_push(v, &data);
1185 static void bc_vec_pushZeroByte(BcVec *v)
1187 //bc_vec_pushByte(v, '\0');
1189 bc_vec_push(v, &const_int_0);
1192 static void bc_vec_pushAt(BcVec *v, const void *data, size_t idx)
1195 bc_vec_push(v, data);
1200 if (v->len == v->cap) bc_vec_grow(v, 1);
1202 ptr = v->v + v->size * idx;
1204 memmove(ptr + v->size, ptr, v->size * (v->len++ - idx));
1205 memmove(ptr, data, v->size);
1209 static void bc_vec_string(BcVec *v, size_t len, const char *str)
1212 bc_vec_expand(v, len + 1);
1213 memcpy(v->v, str, len);
1216 bc_vec_pushZeroByte(v);
1219 #if ENABLE_FEATURE_BC_SIGNALS && ENABLE_FEATURE_EDITING
1220 static void bc_vec_concat(BcVec *v, const char *str)
1224 if (v->len == 0) bc_vec_pushZeroByte(v);
1227 len = v->len + slen;
1229 if (v->cap < len) bc_vec_grow(v, slen);
1230 strcpy(v->v + v->len - 1, str);
1236 static void *bc_vec_item(const BcVec *v, size_t idx)
1238 return v->v + v->size * idx;
1241 static char** bc_program_str(size_t idx)
1243 return bc_vec_item(&G.prog.strs, idx);
1246 static BcFunc* bc_program_func(size_t idx)
1248 return bc_vec_item(&G.prog.fns, idx);
1251 static void *bc_vec_item_rev(const BcVec *v, size_t idx)
1253 return v->v + v->size * (v->len - idx - 1);
1256 static void *bc_vec_top(const BcVec *v)
1258 return v->v + v->size * (v->len - 1);
1261 static FAST_FUNC void bc_vec_free(void *vec)
1263 BcVec *v = (BcVec *) vec;
1268 static int bc_id_cmp(const void *e1, const void *e2)
1270 return strcmp(((const BcId *) e1)->name, ((const BcId *) e2)->name);
1273 static FAST_FUNC void bc_id_free(void *id)
1275 free(((BcId *) id)->name);
1278 static size_t bc_map_find(const BcVec *v, const void *ptr)
1280 size_t low = 0, high = v->len;
1282 while (low < high) {
1284 size_t mid = (low + high) / 2;
1285 BcId *id = bc_vec_item(v, mid);
1286 int result = bc_id_cmp(ptr, id);
1290 else if (result < 0)
1299 static int bc_map_insert(BcVec *v, const void *ptr, size_t *i)
1301 size_t n = *i = bc_map_find(v, ptr);
1304 bc_vec_push(v, ptr);
1305 else if (!bc_id_cmp(ptr, bc_vec_item(v, n)))
1306 return 0; // "was not inserted"
1308 bc_vec_pushAt(v, ptr, n);
1309 return 1; // "was inserted"
1313 static size_t bc_map_index(const BcVec *v, const void *ptr)
1315 size_t i = bc_map_find(v, ptr);
1316 if (i >= v->len) return BC_VEC_INVALID_IDX;
1317 return bc_id_cmp(ptr, bc_vec_item(v, i)) ? BC_VEC_INVALID_IDX : i;
1321 static int bad_input_byte(char c)
1323 if ((c < ' ' && c != '\t' && c != '\r' && c != '\n') // also allow '\v' '\f'?
1326 bc_error_fmt("illegal character 0x%02x", c);
1332 // Note: it _appends_ data from the stdin to vec.
1333 static void bc_read_line(BcVec *vec)
1338 #if ENABLE_FEATURE_BC_SIGNALS
1339 if (G_interrupt) { // ^C was pressed
1342 // GNU bc says "interrupted execution."
1343 // GNU dc says "Interrupt!"
1344 fputs("\ninterrupted execution\n", stderr);
1347 # if ENABLE_FEATURE_EDITING
1350 # define line_buf bb_common_bufsiz1
1351 n = read_line_input(G.line_input_state, "", line_buf, COMMON_BUFSIZE);
1352 if (n <= 0) { // read errors or EOF, or ^D, or ^C
1355 bc_vec_pushZeroByte(vec);
1360 char c = line_buf[i++];
1362 if (bad_input_byte(c)) goto again;
1364 bc_vec_concat(vec, line_buf);
1372 size_t len = vec->len;
1374 IF_FEATURE_BC_SIGNALS(errno = 0;)
1377 #if ENABLE_FEATURE_BC_SIGNALS && !ENABLE_FEATURE_EDITING
1378 // Both conditions appear simultaneously, check both just in case
1379 if (errno == EINTR || G_interrupt) {
1387 quit(); // this emits error message
1388 // Note: EOF does not append '\n', therefore:
1389 // printf 'print 123\n' | bc - works
1390 // printf 'print 123' | bc - fails (syntax error)
1393 bad_chars |= bad_input_byte(c);
1394 bc_vec_pushByte(vec, (char)c);
1395 } while (c != '\n');
1397 // Bad chars on this line, ignore entire line
1401 bc_vec_pushZeroByte(vec);
1405 static char* bc_read_file(const char *path)
1408 size_t size = ((size_t) -1);
1411 // Never returns NULL (dies on errors)
1412 buf = xmalloc_xopen_read_close(path, &size);
1414 for (i = 0; i < size; ++i) {
1416 if ((c < ' ' && c != '\t' && c != '\r' && c != '\n') // also allow '\v' '\f'?
1428 static void bc_num_setToZero(BcNum *n, size_t scale)
1435 static void bc_num_zero(BcNum *n)
1437 bc_num_setToZero(n, 0);
1440 static void bc_num_one(BcNum *n)
1442 bc_num_setToZero(n, 0);
1447 static void bc_num_ten(BcNum *n)
1449 bc_num_setToZero(n, 0);
1455 // Note: this also sets BcNum to zero
1456 static void bc_num_init(BcNum *n, size_t req)
1458 req = req >= BC_NUM_DEF_SIZE ? req : BC_NUM_DEF_SIZE;
1459 //memset(n, 0, sizeof(BcNum)); - cleared by assignments below
1460 n->num = xmalloc(req);
1467 static void bc_num_init_DEF_SIZE(BcNum *n)
1469 bc_num_init(n, BC_NUM_DEF_SIZE);
1472 static void bc_num_expand(BcNum *n, size_t req)
1474 req = req >= BC_NUM_DEF_SIZE ? req : BC_NUM_DEF_SIZE;
1476 n->num = xrealloc(n->num, req);
1481 static FAST_FUNC void bc_num_free(void *num)
1483 free(((BcNum *) num)->num);
1486 static void bc_num_copy(BcNum *d, BcNum *s)
1489 bc_num_expand(d, s->cap);
1493 memcpy(d->num, s->num, sizeof(BcDig) * d->len);
1497 static BC_STATUS zbc_num_ulong(BcNum *n, unsigned long *result_p)
1500 unsigned long pow, result;
1502 if (n->neg) RETURN_STATUS(bc_error("negative number"));
1504 for (result = 0, pow = 1, i = n->rdx; i < n->len; ++i) {
1506 unsigned long prev = result, powprev = pow;
1508 result += ((unsigned long) n->num[i]) * pow;
1511 if (result < prev || pow < powprev)
1512 RETURN_STATUS(bc_error("overflow"));
1518 RETURN_STATUS(BC_STATUS_SUCCESS);
1520 #if ERRORS_ARE_FATAL
1521 # define zbc_num_ulong(...) (zbc_num_ulong(__VA_ARGS__), BC_STATUS_SUCCESS)
1524 static void bc_num_ulong2num(BcNum *n, unsigned long val)
1530 if (val == 0) return;
1532 if (ULONG_MAX == 0xffffffffUL)
1533 bc_num_expand(n, 10); // 10 digits: 4294967295
1534 if (ULONG_MAX == 0xffffffffffffffffULL)
1535 bc_num_expand(n, 20); // 20 digits: 18446744073709551615
1536 BUILD_BUG_ON(ULONG_MAX > 0xffffffffffffffffULL);
1543 if (val == 0) break;
1547 static void bc_num_subArrays(BcDig *restrict a, BcDig *restrict b,
1551 for (i = 0; i < len; ++i) {
1552 for (a[i] -= b[i], j = 0; a[i + j] < 0;) {
1559 static ssize_t bc_num_compare(BcDig *restrict a, BcDig *restrict b, size_t len)
1563 for (i = len - 1; i < len && !(c = a[i] - b[i]); --i);
1564 return BC_NUM_NEG(i + 1, c < 0);
1567 static ssize_t bc_num_cmp(BcNum *a, BcNum *b)
1569 size_t i, min, a_int, b_int, diff;
1570 BcDig *max_num, *min_num;
1574 if (a == b) return 0;
1575 if (a->len == 0) return BC_NUM_NEG(!!b->len, !b->neg);
1576 if (b->len == 0) return BC_NUM_NEG(1, a->neg);
1578 if (a->neg != b->neg) // signs of a and b differ
1579 // +a,-b = a>b = 1 or -a,+b = a<b = -1
1580 return (int)b->neg - (int)a->neg;
1581 neg = a->neg; // 1 if both negative, 0 if both positive
1583 a_int = BC_NUM_INT(a);
1584 b_int = BC_NUM_INT(b);
1587 if (a_int != 0) return (ssize_t) a_int;
1589 a_max = (a->rdx > b->rdx);
1592 diff = a->rdx - b->rdx;
1593 max_num = a->num + diff;
1595 // neg = (a_max == neg); - NOP (maps 1->1 and 0->0)
1598 diff = b->rdx - a->rdx;
1599 max_num = b->num + diff;
1601 neg = !neg; // same as "neg = (a_max == neg)"
1604 cmp = bc_num_compare(max_num, min_num, b_int + min);
1605 if (cmp != 0) return BC_NUM_NEG(cmp, neg);
1607 for (max_num -= diff, i = diff - 1; i < diff; --i) {
1608 if (max_num[i]) return BC_NUM_NEG(1, neg);
1614 static void bc_num_truncate(BcNum *n, size_t places)
1616 if (places == 0) return;
1622 memmove(n->num, n->num + places, n->len * sizeof(BcDig));
1626 static void bc_num_extend(BcNum *n, size_t places)
1628 size_t len = n->len + places;
1632 if (n->cap < len) bc_num_expand(n, len);
1634 memmove(n->num + places, n->num, sizeof(BcDig) * n->len);
1635 memset(n->num, 0, sizeof(BcDig) * places);
1642 static void bc_num_clean(BcNum *n)
1644 while (n->len > 0 && n->num[n->len - 1] == 0) --n->len;
1647 else if (n->len < n->rdx)
1651 static void bc_num_retireMul(BcNum *n, size_t scale, bool neg1, bool neg2)
1654 bc_num_extend(n, scale - n->rdx);
1656 bc_num_truncate(n, n->rdx - scale);
1659 if (n->len != 0) n->neg = !neg1 != !neg2;
1662 static void bc_num_split(BcNum *restrict n, size_t idx, BcNum *restrict a,
1667 b->len = n->len - idx;
1669 a->rdx = b->rdx = 0;
1671 memcpy(b->num, n->num + idx, b->len * sizeof(BcDig));
1672 memcpy(a->num, n->num, idx * sizeof(BcDig));
1683 static BC_STATUS zbc_num_shift(BcNum *n, size_t places)
1685 if (places == 0 || n->len == 0) RETURN_STATUS(BC_STATUS_SUCCESS);
1687 // This check makes sense only if size_t is (much) larger than BC_MAX_NUM.
1688 if (SIZE_MAX > (BC_MAX_NUM | 0xff)) {
1689 if (places + n->len > BC_MAX_NUM)
1690 RETURN_STATUS(bc_error("number too long: must be [1,"BC_MAX_NUM_STR"]"));
1693 if (n->rdx >= places)
1696 bc_num_extend(n, places - n->rdx);
1702 RETURN_STATUS(BC_STATUS_SUCCESS);
1704 #if ERRORS_ARE_FATAL
1705 # define zbc_num_shift(...) (zbc_num_shift(__VA_ARGS__), BC_STATUS_SUCCESS)
1708 static BC_STATUS zbc_num_inv(BcNum *a, BcNum *b, size_t scale)
1717 RETURN_STATUS(zbc_num_div(&one, a, b, scale));
1719 #if ERRORS_ARE_FATAL
1720 # define zbc_num_inv(...) (zbc_num_inv(__VA_ARGS__), BC_STATUS_SUCCESS)
1723 static FAST_FUNC BC_STATUS zbc_num_a(BcNum *a, BcNum *b, BcNum *restrict c, size_t sub)
1725 BcDig *ptr, *ptr_a, *ptr_b, *ptr_c;
1726 size_t i, max, min_rdx, min_int, diff, a_int, b_int;
1729 // Because this function doesn't need to use scale (per the bc spec),
1730 // I am hijacking it to say whether it's doing an add or a subtract.
1734 if (sub && c->len) c->neg = !c->neg;
1735 RETURN_STATUS(BC_STATUS_SUCCESS);
1739 RETURN_STATUS(BC_STATUS_SUCCESS);
1743 c->rdx = BC_MAX(a->rdx, b->rdx);
1744 min_rdx = BC_MIN(a->rdx, b->rdx);
1747 if (a->rdx > b->rdx) {
1748 diff = a->rdx - b->rdx;
1750 ptr_a = a->num + diff;
1754 diff = b->rdx - a->rdx;
1757 ptr_b = b->num + diff;
1760 for (ptr_c = c->num, i = 0; i < diff; ++i, ++c->len) ptr_c[i] = ptr[i];
1763 a_int = BC_NUM_INT(a);
1764 b_int = BC_NUM_INT(b);
1766 if (a_int > b_int) {
1777 for (carry = 0, i = 0; i < min_rdx + min_int; ++i, ++c->len) {
1778 in = ((int) ptr_a[i]) + ((int) ptr_b[i]) + carry;
1780 ptr_c[i] = (BcDig)(in % 10);
1783 for (; i < max + min_rdx; ++i, ++c->len) {
1784 in = ((int) ptr[i]) + carry;
1786 ptr_c[i] = (BcDig)(in % 10);
1789 if (carry != 0) c->num[c->len++] = (BcDig) carry;
1791 RETURN_STATUS(BC_STATUS_SUCCESS); // can't make void, see zbc_num_binary()
1794 static FAST_FUNC BC_STATUS zbc_num_s(BcNum *a, BcNum *b, BcNum *restrict c, size_t sub)
1797 BcNum *minuend, *subtrahend;
1799 bool aneg, bneg, neg;
1801 // Because this function doesn't need to use scale (per the bc spec),
1802 // I am hijacking it to say whether it's doing an add or a subtract.
1806 if (sub && c->len) c->neg = !c->neg;
1807 RETURN_STATUS(BC_STATUS_SUCCESS);
1811 RETURN_STATUS(BC_STATUS_SUCCESS);
1816 a->neg = b->neg = false;
1818 cmp = bc_num_cmp(a, b);
1824 bc_num_setToZero(c, BC_MAX(a->rdx, b->rdx));
1825 RETURN_STATUS(BC_STATUS_SUCCESS);
1834 if (sub) neg = !neg;
1839 bc_num_copy(c, minuend);
1842 if (c->rdx < subtrahend->rdx) {
1843 bc_num_extend(c, subtrahend->rdx - c->rdx);
1847 start = c->rdx - subtrahend->rdx;
1849 bc_num_subArrays(c->num + start, subtrahend->num, subtrahend->len);
1853 RETURN_STATUS(BC_STATUS_SUCCESS); // can't make void, see zbc_num_binary()
1856 static FAST_FUNC BC_STATUS zbc_num_k(BcNum *restrict a, BcNum *restrict b,
1858 #if ERRORS_ARE_FATAL
1859 # define zbc_num_k(...) (zbc_num_k(__VA_ARGS__), BC_STATUS_SUCCESS)
1863 size_t max = BC_MAX(a->len, b->len), max2 = (max + 1) / 2;
1864 BcNum l1, h1, l2, h2, m2, m1, z0, z1, z2, temp;
1867 if (a->len == 0 || b->len == 0) {
1869 RETURN_STATUS(BC_STATUS_SUCCESS);
1871 aone = BC_NUM_ONE(a);
1872 if (aone || BC_NUM_ONE(b)) {
1873 bc_num_copy(c, aone ? b : a);
1874 RETURN_STATUS(BC_STATUS_SUCCESS);
1877 if (a->len + b->len < BC_NUM_KARATSUBA_LEN ||
1878 a->len < BC_NUM_KARATSUBA_LEN || b->len < BC_NUM_KARATSUBA_LEN)
1883 bc_num_expand(c, a->len + b->len + 1);
1885 memset(c->num, 0, sizeof(BcDig) * c->cap);
1888 for (i = 0; i < b->len; ++i) {
1891 for (j = 0; j < a->len; ++j) {
1892 unsigned in = c->num[i + j];
1893 in += ((unsigned) a->num[j]) * ((unsigned) b->num[i]) + carry;
1894 // note: compilers prefer _unsigned_ div/const
1896 c->num[i + j] = (BcDig)(in % 10);
1899 c->num[i + j] += (BcDig) carry;
1900 len = BC_MAX(len, i + j + !!carry);
1902 #if ENABLE_FEATURE_BC_SIGNALS
1904 // a*a <- without check below, this will not be interruptible
1905 if (G_interrupt) return BC_STATUS_FAILURE;
1911 RETURN_STATUS(BC_STATUS_SUCCESS);
1914 bc_num_init(&l1, max);
1915 bc_num_init(&h1, max);
1916 bc_num_init(&l2, max);
1917 bc_num_init(&h2, max);
1918 bc_num_init(&m1, max);
1919 bc_num_init(&m2, max);
1920 bc_num_init(&z0, max);
1921 bc_num_init(&z1, max);
1922 bc_num_init(&z2, max);
1923 bc_num_init(&temp, max + max);
1925 bc_num_split(a, max2, &l1, &h1);
1926 bc_num_split(b, max2, &l2, &h2);
1928 s = zbc_num_add(&h1, &l1, &m1, 0);
1930 s = zbc_num_add(&h2, &l2, &m2, 0);
1933 s = zbc_num_k(&h1, &h2, &z0);
1935 s = zbc_num_k(&m1, &m2, &z1);
1937 s = zbc_num_k(&l1, &l2, &z2);
1940 s = zbc_num_sub(&z1, &z0, &temp, 0);
1942 s = zbc_num_sub(&temp, &z2, &z1, 0);
1945 s = zbc_num_shift(&z0, max2 * 2);
1947 s = zbc_num_shift(&z1, max2);
1949 s = zbc_num_add(&z0, &z1, &temp, 0);
1951 s = zbc_num_add(&temp, &z2, c, 0);
1967 static FAST_FUNC BC_STATUS zbc_num_m(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale)
1971 size_t maxrdx = BC_MAX(a->rdx, b->rdx);
1973 scale = BC_MAX(scale, a->rdx);
1974 scale = BC_MAX(scale, b->rdx);
1975 scale = BC_MIN(a->rdx + b->rdx, scale);
1976 maxrdx = BC_MAX(maxrdx, scale);
1978 bc_num_init(&cpa, a->len);
1979 bc_num_init(&cpb, b->len);
1981 bc_num_copy(&cpa, a);
1982 bc_num_copy(&cpb, b);
1983 cpa.neg = cpb.neg = false;
1985 s = zbc_num_shift(&cpa, maxrdx);
1987 s = zbc_num_shift(&cpb, maxrdx);
1989 s = zbc_num_k(&cpa, &cpb, c);
1993 bc_num_expand(c, c->len + maxrdx);
1995 if (c->len < maxrdx) {
1996 memset(c->num + c->len, 0, (c->cap - c->len) * sizeof(BcDig));
2001 bc_num_retireMul(c, scale, a->neg, b->neg);
2008 #if ERRORS_ARE_FATAL
2009 # define zbc_num_m(...) (zbc_num_m(__VA_ARGS__), BC_STATUS_SUCCESS)
2012 static FAST_FUNC BC_STATUS zbc_num_d(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale)
2014 BcStatus s = BC_STATUS_SUCCESS;
2021 RETURN_STATUS(bc_error("divide by zero"));
2023 bc_num_setToZero(c, scale);
2024 RETURN_STATUS(BC_STATUS_SUCCESS);
2026 if (BC_NUM_ONE(b)) {
2028 bc_num_retireMul(c, scale, a->neg, b->neg);
2029 RETURN_STATUS(BC_STATUS_SUCCESS);
2032 bc_num_init(&cp, BC_NUM_MREQ(a, b, scale));
2033 bc_num_copy(&cp, a);
2037 bc_num_expand(&cp, len + 2);
2038 bc_num_extend(&cp, len - cp.len);
2041 if (b->rdx > cp.rdx) bc_num_extend(&cp, b->rdx - cp.rdx);
2043 if (scale > cp.rdx) bc_num_extend(&cp, scale - cp.rdx);
2045 if (b->rdx == b->len) {
2046 for (i = 0; zero && i < len; ++i) zero = !b->num[len - i - 1];
2050 if (cp.cap == cp.len) bc_num_expand(&cp, cp.len + 1);
2052 // We want an extra zero in front to make things simpler.
2053 cp.num[cp.len++] = 0;
2056 bc_num_expand(c, cp.len);
2059 memset(c->num + end, 0, (c->cap - end) * sizeof(BcDig));
2064 for (i = end - 1; !s && i < end; --i) {
2066 for (q = 0; (!s && n[len] != 0) || bc_num_compare(n, p, len) >= 0; ++q)
2067 bc_num_subArrays(n, p, len);
2069 #if ENABLE_FEATURE_BC_SIGNALS
2072 // 1/a <- without check below, this will not be interruptible
2074 s = BC_STATUS_FAILURE;
2080 bc_num_retireMul(c, scale, a->neg, b->neg);
2085 #if ERRORS_ARE_FATAL
2086 # define zbc_num_d(...) (zbc_num_d(__VA_ARGS__), BC_STATUS_SUCCESS)
2089 static FAST_FUNC BC_STATUS zbc_num_r(BcNum *a, BcNum *b, BcNum *restrict c,
2090 BcNum *restrict d, size_t scale, size_t ts)
2097 RETURN_STATUS(bc_error("divide by zero"));
2100 bc_num_setToZero(d, ts);
2101 RETURN_STATUS(BC_STATUS_SUCCESS);
2104 bc_num_init(&temp, d->cap);
2105 s = zbc_num_d(a, b, c, scale);
2108 if (scale != 0) scale = ts;
2110 s = zbc_num_m(c, b, &temp, scale);
2112 s = zbc_num_sub(a, &temp, d, scale);
2115 if (ts > d->rdx && d->len) bc_num_extend(d, ts - d->rdx);
2118 bc_num_retireMul(d, ts, a->neg, b->neg);
2125 #if ERRORS_ARE_FATAL
2126 # define zbc_num_r(...) (zbc_num_r(__VA_ARGS__), BC_STATUS_SUCCESS)
2129 static FAST_FUNC BC_STATUS zbc_num_rem(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale)
2133 size_t ts = BC_MAX(scale + b->rdx, a->rdx), len = BC_NUM_MREQ(a, b, ts);
2135 bc_num_init(&c1, len);
2136 s = zbc_num_r(a, b, &c1, c, scale, ts);
2141 #if ERRORS_ARE_FATAL
2142 # define zbc_num_rem(...) (zbc_num_rem(__VA_ARGS__), BC_STATUS_SUCCESS)
2145 static FAST_FUNC BC_STATUS zbc_num_p(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale)
2147 BcStatus s = BC_STATUS_SUCCESS;
2150 size_t i, powrdx, resrdx;
2153 if (b->rdx) RETURN_STATUS(bc_error("non integer number"));
2157 RETURN_STATUS(BC_STATUS_SUCCESS);
2160 bc_num_setToZero(c, scale);
2161 RETURN_STATUS(BC_STATUS_SUCCESS);
2163 if (BC_NUM_ONE(b)) {
2167 s = zbc_num_inv(a, c, scale);
2174 s = zbc_num_ulong(b, &pow);
2175 if (s) RETURN_STATUS(s);
2177 bc_num_init(©, a->len);
2178 bc_num_copy(©, a);
2183 if (a->rdx * pow < scale)
2184 scale = a->rdx * pow;
2189 for (powrdx = a->rdx; !(pow & 1); pow >>= 1) {
2191 s = zbc_num_mul(©, ©, ©, powrdx);
2193 // Not needed: zbc_num_mul() has a check for ^C:
2194 //if (G_interrupt) {
2195 // s = BC_STATUS_FAILURE;
2200 bc_num_copy(c, ©);
2202 for (resrdx = powrdx, pow >>= 1; pow != 0; pow >>= 1) {
2205 s = zbc_num_mul(©, ©, ©, powrdx);
2210 s = zbc_num_mul(c, ©, c, resrdx);
2213 // Not needed: zbc_num_mul() has a check for ^C:
2214 //if (G_interrupt) {
2215 // s = BC_STATUS_FAILURE;
2221 s = zbc_num_inv(c, c, scale);
2225 if (c->rdx > scale) bc_num_truncate(c, c->rdx - scale);
2227 // We can't use bc_num_clean() here.
2228 for (zero = true, i = 0; zero && i < c->len; ++i) zero = !c->num[i];
2229 if (zero) bc_num_setToZero(c, scale);
2235 #if ERRORS_ARE_FATAL
2236 # define zbc_num_p(...) (zbc_num_p(__VA_ARGS__), BC_STATUS_SUCCESS)
2239 static BC_STATUS zbc_num_binary(BcNum *a, BcNum *b, BcNum *c, size_t scale,
2240 BcNumBinaryOp op, size_t req)
2243 BcNum num2, *ptr_a, *ptr_b;
2248 memcpy(ptr_a, c, sizeof(BcNum));
2257 memcpy(ptr_b, c, sizeof(BcNum));
2265 bc_num_init(c, req);
2267 bc_num_expand(c, req);
2269 s = BC_STATUS_SUCCESS;
2270 ERROR_RETURN(s =) op(ptr_a, ptr_b, c, scale);
2272 if (init) bc_num_free(&num2);
2276 #if ERRORS_ARE_FATAL
2277 # define zbc_num_binary(...) (zbc_num_binary(__VA_ARGS__), BC_STATUS_SUCCESS)
2280 static bool bc_num_strValid(const char *val, size_t base)
2285 b = (BcDig)(base <= 10 ? base + '0' : base - 10 + 'A');
2292 if (radix) return false;
2296 if (c < '0' || c >= b || (c > '9' && c < 'A'))
2302 // Note: n is already "bc_num_zero()"ed,
2303 // leading zeroes in "val" are removed
2304 static void bc_num_parseDecimal(BcNum *n, const char *val)
2313 bc_num_expand(n, len);
2315 ptr = strchr(val, '.');
2319 n->rdx = (size_t)((val + len) - (ptr + 1));
2321 for (i = 0; val[i]; ++i) {
2322 if (val[i] != '0' && val[i] != '.') {
2323 // Not entirely zero value - convert it, and exit
2326 n->num[n->len] = val[i] - '0';
2330 if (val[--i] == '.') goto skip_dot;
2335 // if for() exits without hitting if(), the value is entirely zero
2338 // Note: n is already "bc_num_zero()"ed,
2339 // leading zeroes in "val" are removed
2340 static void bc_num_parseBase(BcNum *n, const char *val, BcNum *base)
2343 BcNum temp, mult, result;
2348 for (i = 0; ; ++i) {
2351 if (val[i] != '.' && val[i] != '0')
2355 bc_num_init_DEF_SIZE(&temp);
2356 bc_num_init_DEF_SIZE(&mult);
2360 if (c == '\0') goto int_err;
2361 if (c == '.') break;
2363 v = (unsigned long) (c <= '9' ? c - '0' : c - 'A' + 10);
2365 s = zbc_num_mul(n, base, &mult, 0);
2366 if (s) goto int_err;
2367 bc_num_ulong2num(&temp, v);
2368 s = zbc_num_add(&mult, &temp, n, 0);
2369 if (s) goto int_err;
2372 bc_num_init(&result, base->len);
2373 //bc_num_zero(&result); - already is
2379 if (c == '\0') break;
2382 v = (unsigned long) (c <= '9' ? c - '0' : c - 'A' + 10);
2384 s = zbc_num_mul(&result, base, &result, 0);
2386 bc_num_ulong2num(&temp, v);
2387 s = zbc_num_add(&result, &temp, &result, 0);
2389 s = zbc_num_mul(&mult, base, &mult, 0);
2393 s = zbc_num_div(&result, &mult, &result, digits);
2395 s = zbc_num_add(n, &result, n, digits);
2399 if (n->rdx < digits) bc_num_extend(n, digits - n->rdx);
2404 bc_num_free(&result);
2410 static BC_STATUS zbc_num_parse(BcNum *n, const char *val, BcNum *base,
2413 if (!bc_num_strValid(val, base_t))
2414 RETURN_STATUS(bc_error("bad number string"));
2417 while (*val == '0') val++;
2420 bc_num_parseDecimal(n, val);
2422 bc_num_parseBase(n, val, base);
2424 RETURN_STATUS(BC_STATUS_SUCCESS);
2426 #if ERRORS_ARE_FATAL
2427 # define zbc_num_parse(...) (zbc_num_parse(__VA_ARGS__), BC_STATUS_SUCCESS)
2430 static BC_STATUS zbc_num_sqrt(BcNum *a, BcNum *restrict b, size_t scale)
2433 BcNum num1, num2, half, f, fprime, *x0, *x1, *temp;
2434 size_t pow, len, digs, digs1, resrdx, req, times = 0;
2435 ssize_t cmp = 1, cmp1 = SSIZE_MAX, cmp2 = SSIZE_MAX;
2437 req = BC_MAX(scale, a->rdx) + ((BC_NUM_INT(a) + 1) >> 1) + 1;
2438 bc_num_expand(b, req);
2441 bc_num_setToZero(b, scale);
2442 RETURN_STATUS(BC_STATUS_SUCCESS);
2445 RETURN_STATUS(bc_error("negative number"));
2446 else if (BC_NUM_ONE(a)) {
2448 bc_num_extend(b, scale);
2449 RETURN_STATUS(BC_STATUS_SUCCESS);
2452 scale = BC_MAX(scale, a->rdx) + 1;
2453 len = a->len + scale;
2455 bc_num_init(&num1, len);
2456 bc_num_init(&num2, len);
2457 bc_num_init_DEF_SIZE(&half);
2463 bc_num_init(&f, len);
2464 bc_num_init(&fprime, len);
2470 pow = BC_NUM_INT(a);
2479 pow -= 2 - (pow & 1);
2481 bc_num_extend(x0, pow);
2483 // Make sure to move the radix back.
2487 x0->rdx = digs = digs1 = 0;
2489 len = BC_NUM_INT(x0) + resrdx - 1;
2491 while (cmp != 0 || digs < len) {
2493 s = zbc_num_div(a, x0, &f, resrdx);
2495 s = zbc_num_add(x0, &f, &fprime, resrdx);
2497 s = zbc_num_mul(&fprime, &half, x1, resrdx);
2500 cmp = bc_num_cmp(x1, x0);
2501 digs = x1->len - (unsigned long long) llabs(cmp);
2503 if (cmp == cmp2 && digs == digs1)
2508 resrdx += times > 4;
2521 if (b->rdx > scale) bc_num_truncate(b, b->rdx - scale);
2524 bc_num_free(&fprime);
2531 #if ERRORS_ARE_FATAL
2532 # define zbc_num_sqrt(...) (zbc_num_sqrt(__VA_ARGS__), BC_STATUS_SUCCESS)
2535 static BC_STATUS zbc_num_divmod(BcNum *a, BcNum *b, BcNum *c, BcNum *d,
2541 size_t ts = BC_MAX(scale + b->rdx, a->rdx), len = BC_NUM_MREQ(a, b, ts);
2544 memcpy(&num2, c, sizeof(BcNum));
2546 bc_num_init(c, len);
2551 bc_num_expand(c, len);
2554 s = zbc_num_r(ptr_a, b, c, d, scale, ts);
2556 if (init) bc_num_free(&num2);
2560 #if ERRORS_ARE_FATAL
2561 # define zbc_num_divmod(...) (zbc_num_divmod(__VA_ARGS__), BC_STATUS_SUCCESS)
2565 static BC_STATUS zbc_num_modexp(BcNum *a, BcNum *b, BcNum *c, BcNum *restrict d)
2568 BcNum base, exp, two, temp;
2571 RETURN_STATUS(bc_error("divide by zero"));
2572 if (a->rdx || b->rdx || c->rdx)
2573 RETURN_STATUS(bc_error("non integer number"));
2575 RETURN_STATUS(bc_error("negative number"));
2577 bc_num_expand(d, c->len);
2578 bc_num_init(&base, c->len);
2579 bc_num_init(&exp, b->len);
2580 bc_num_init_DEF_SIZE(&two);
2581 bc_num_init(&temp, b->len);
2587 s = zbc_num_rem(a, c, &base, 0);
2589 bc_num_copy(&exp, b);
2591 while (exp.len != 0) {
2593 s = zbc_num_divmod(&exp, &two, &exp, &temp, 0);
2596 if (BC_NUM_ONE(&temp)) {
2597 s = zbc_num_mul(d, &base, &temp, 0);
2599 s = zbc_num_rem(&temp, c, d, 0);
2603 s = zbc_num_mul(&base, &base, &temp, 0);
2605 s = zbc_num_rem(&temp, c, &base, 0);
2616 #if ERRORS_ARE_FATAL
2617 # define zbc_num_modexp(...) (zbc_num_modexp(__VA_ARGS__), BC_STATUS_SUCCESS)
2622 static BC_STATUS zbc_func_insert(BcFunc *f, char *name, bool var)
2627 for (i = 0; i < f->autos.len; ++i) {
2628 if (strcmp(name, ((BcId *) bc_vec_item(&f->autos, i))->name) == 0)
2629 RETURN_STATUS(bc_error("function parameter or auto var has the same name as another"));
2635 bc_vec_push(&f->autos, &a);
2637 RETURN_STATUS(BC_STATUS_SUCCESS);
2639 #if ERRORS_ARE_FATAL
2640 # define zbc_func_insert(...) (zbc_func_insert(__VA_ARGS__), BC_STATUS_SUCCESS)
2644 static void bc_func_init(BcFunc *f)
2646 bc_char_vec_init(&f->code);
2647 bc_vec_init(&f->autos, sizeof(BcId), bc_id_free);
2648 bc_vec_init(&f->labels, sizeof(size_t), NULL);
2652 static FAST_FUNC void bc_func_free(void *func)
2654 BcFunc *f = (BcFunc *) func;
2655 bc_vec_free(&f->code);
2656 bc_vec_free(&f->autos);
2657 bc_vec_free(&f->labels);
2660 static void bc_array_expand(BcVec *a, size_t len);
2662 static void bc_array_init(BcVec *a, bool nums)
2665 bc_vec_init(a, sizeof(BcNum), bc_num_free);
2667 bc_vec_init(a, sizeof(BcVec), bc_vec_free);
2668 bc_array_expand(a, 1);
2671 static void bc_array_expand(BcVec *a, size_t len)
2675 if (a->size == sizeof(BcNum) && a->dtor == bc_num_free) {
2676 while (len > a->len) {
2677 bc_num_init_DEF_SIZE(&data.n);
2678 bc_vec_push(a, &data.n);
2682 while (len > a->len) {
2683 bc_array_init(&data.v, true);
2684 bc_vec_push(a, &data.v);
2689 static void bc_array_copy(BcVec *d, const BcVec *s)
2694 bc_vec_expand(d, s->cap);
2697 for (i = 0; i < s->len; ++i) {
2698 BcNum *dnum = bc_vec_item(d, i), *snum = bc_vec_item(s, i);
2699 bc_num_init(dnum, snum->len);
2700 bc_num_copy(dnum, snum);
2704 static FAST_FUNC void bc_string_free(void *string)
2706 free(*((char **) string));
2710 static void bc_result_copy(BcResult *d, BcResult *src)
2716 case BC_RESULT_TEMP:
2717 case BC_RESULT_IBASE:
2718 case BC_RESULT_SCALE:
2719 case BC_RESULT_OBASE:
2721 bc_num_init(&d->d.n, src->d.n.len);
2722 bc_num_copy(&d->d.n, &src->d.n);
2727 case BC_RESULT_ARRAY:
2728 case BC_RESULT_ARRAY_ELEM:
2730 d->d.id.name = xstrdup(src->d.id.name);
2734 case BC_RESULT_CONSTANT:
2735 case BC_RESULT_LAST:
2739 memcpy(&d->d.n, &src->d.n, sizeof(BcNum));
2746 static FAST_FUNC void bc_result_free(void *result)
2748 BcResult *r = (BcResult *) result;
2752 case BC_RESULT_TEMP:
2753 case BC_RESULT_IBASE:
2754 case BC_RESULT_SCALE:
2755 case BC_RESULT_OBASE:
2757 bc_num_free(&r->d.n);
2762 case BC_RESULT_ARRAY:
2763 case BC_RESULT_ARRAY_ELEM:
2777 static void bc_lex_lineComment(BcLex *l)
2779 l->t.t = BC_LEX_WHITESPACE;
2780 while (l->i < l->len && l->buf[l->i++] != '\n');
2784 static void bc_lex_whitespace(BcLex *l)
2786 l->t.t = BC_LEX_WHITESPACE;
2788 char c = l->buf[l->i];
2789 if (c == '\n' || !isspace(c))
2795 static BC_STATUS zbc_lex_number(BcLex *l, char start)
2797 const char *buf = l->buf + l->i;
2798 size_t len, bslashes, i, ccnt;
2801 pt = (start == '.');
2802 l->t.t = BC_LEX_NUMBER;
2809 if (c == '\\' && buf[i + 1] == '\n') {
2814 if (!isdigit(c) && (c < 'A' || c > 'F')) {
2815 if (c != '.') break;
2816 // if '.' was already seen, stop on second one:
2820 // buf[i] is one of "0-9A-F."
2825 //i is buf[i] index of the first not-yet-parsed char
2828 //ccnt is the number of chars in the number string, excluding possible
2829 //trailing "." and possible following trailing "\<newline>"(s).
2830 len = ccnt - bslashes * 2 + 1; // +1 byte for NUL termination
2832 // This check makes sense only if size_t is (much) larger than BC_MAX_NUM.
2833 if (SIZE_MAX > (BC_MAX_NUM | 0xff)) {
2834 if (len > BC_MAX_NUM)
2835 RETURN_STATUS(bc_error("number too long: must be [1,"BC_MAX_NUM_STR"]"));
2838 bc_vec_pop_all(&l->t.v);
2839 bc_vec_expand(&l->t.v, 1 + len);
2840 bc_vec_push(&l->t.v, &start);
2843 // If we have hit a backslash, skip it. We don't have
2844 // to check for a newline because it's guaranteed.
2850 bc_vec_push(&l->t.v, buf);
2855 bc_vec_pushZeroByte(&l->t.v);
2857 RETURN_STATUS(BC_STATUS_SUCCESS);
2859 #if ERRORS_ARE_FATAL
2860 # define zbc_lex_number(...) (zbc_lex_number(__VA_ARGS__), BC_STATUS_SUCCESS)
2863 static void bc_lex_name(BcLex *l)
2868 l->t.t = BC_LEX_NAME;
2871 buf = l->buf + l->i - 1;
2874 if ((c < 'a' || c > 'z') && !isdigit(c) && c != '_') break;
2878 #if 0 // We do not protect against people with gigabyte-long names
2879 // This check makes sense only if size_t is (much) larger than BC_MAX_STRING.
2880 if (SIZE_MAX > (BC_MAX_STRING | 0xff)) {
2881 if (i > BC_MAX_STRING)
2882 return bc_error("name too long: must be [1,"BC_MAX_STRING_STR"]");
2885 bc_vec_string(&l->t.v, i, buf);
2887 // Increment the index. We minus 1 because it has already been incremented.
2890 //return BC_STATUS_SUCCESS;
2893 static void bc_lex_init(BcLex *l)
2895 bc_char_vec_init(&l->t.v);
2898 static void bc_lex_free(BcLex *l)
2900 bc_vec_free(&l->t.v);
2903 static void bc_lex_file(BcLex *l)
2905 G.err_line = l->line = 1;
2909 IF_BC(static BC_STATUS zbc_lex_token(BcLex *l);)
2910 IF_DC(static BC_STATUS zdc_lex_token(BcLex *l);)
2912 static BC_STATUS zcommon_lex_token(BcLex *l)
2915 IF_BC(RETURN_STATUS(zbc_lex_token(l));)
2917 IF_DC(RETURN_STATUS(zdc_lex_token(l));)
2920 static BC_STATUS zbc_lex_next(BcLex *l)
2925 if (l->t.last == BC_LEX_EOF) RETURN_STATUS(bc_error("end of file"));
2927 l->line += l->newline;
2928 G.err_line = l->line;
2929 l->t.t = BC_LEX_EOF;
2931 l->newline = (l->i == l->len);
2932 if (l->newline) RETURN_STATUS(BC_STATUS_SUCCESS);
2934 // Loop until failure or we don't have whitespace. This
2935 // is so the parser doesn't get inundated with whitespace.
2936 s = BC_STATUS_SUCCESS;
2938 ERROR_RETURN(s =) zcommon_lex_token(l);
2939 } while (!s && l->t.t == BC_LEX_WHITESPACE);
2943 #if ERRORS_ARE_FATAL
2944 # define zbc_lex_next(...) (zbc_lex_next(__VA_ARGS__), BC_STATUS_SUCCESS)
2947 static BC_STATUS zbc_lex_text(BcLex *l, const char *text)
2951 l->len = strlen(text);
2952 l->t.t = l->t.last = BC_LEX_INVALID;
2953 RETURN_STATUS(zbc_lex_next(l));
2955 #if ERRORS_ARE_FATAL
2956 # define zbc_lex_text(...) (zbc_lex_text(__VA_ARGS__), BC_STATUS_SUCCESS)
2960 static BC_STATUS zbc_lex_identifier(BcLex *l)
2964 const char *buf = l->buf + l->i - 1;
2966 for (i = 0; i < ARRAY_SIZE(bc_lex_kws); ++i) {
2967 const char *keyword8 = bc_lex_kws[i].name8;
2969 while (buf[j] != '\0' && buf[j] == keyword8[j]) {
2971 if (j == 8) goto match;
2973 if (keyword8[j] != '\0')
2976 // buf starts with keyword bc_lex_kws[i]
2977 l->t.t = BC_LEX_KEY_1st_keyword + i;
2978 if (!bc_lex_kws_POSIX(i)) {
2979 s = bc_posix_error_fmt("%sthe '%.8s' keyword", "POSIX does not allow ", bc_lex_kws[i].name8);
2980 ERROR_RETURN(if (s) RETURN_STATUS(s);)
2983 // We minus 1 because the index has already been incremented.
2985 RETURN_STATUS(BC_STATUS_SUCCESS);
2990 if (l->t.v.len > 2) {
2993 // bc: POSIX only allows one character names; the following is bad: 'qwe=1
2995 unsigned len = strchrnul(buf, '\n') - buf;
2996 s = bc_posix_error_fmt("POSIX only allows one character names; the following is bad: '%.*s'", len, buf);
3001 #if ERRORS_ARE_FATAL
3002 # define zbc_lex_identifier(...) (zbc_lex_identifier(__VA_ARGS__), BC_STATUS_SUCCESS)
3005 static BC_STATUS zbc_lex_string(BcLex *l)
3007 size_t len, nls = 0, i = l->i;
3010 l->t.t = BC_LEX_STR;
3012 for (c = l->buf[i]; c != 0 && c != '"'; c = l->buf[++i])
3017 RETURN_STATUS(bc_error("string end could not be found"));
3021 // This check makes sense only if size_t is (much) larger than BC_MAX_STRING.
3022 if (SIZE_MAX > (BC_MAX_STRING | 0xff)) {
3023 if (len > BC_MAX_STRING)
3024 RETURN_STATUS(bc_error("string too long: must be [1,"BC_MAX_STRING_STR"]"));
3026 bc_vec_string(&l->t.v, len, l->buf + l->i);
3030 G.err_line = l->line;
3032 RETURN_STATUS(BC_STATUS_SUCCESS);
3034 #if ERRORS_ARE_FATAL
3035 # define zbc_lex_string(...) (zbc_lex_string(__VA_ARGS__), BC_STATUS_SUCCESS)
3038 static void bc_lex_assign(BcLex *l, BcLexType with, BcLexType without)
3040 if (l->buf[l->i] == '=') {
3048 static BC_STATUS zbc_lex_comment(BcLex *l)
3051 const char *buf = l->buf;
3053 l->t.t = BC_LEX_WHITESPACE;
3066 RETURN_STATUS(bc_error("comment end could not be found"));
3074 G.err_line = l->line;
3076 RETURN_STATUS(BC_STATUS_SUCCESS);
3078 #if ERRORS_ARE_FATAL
3079 # define zbc_lex_comment(...) (zbc_lex_comment(__VA_ARGS__), BC_STATUS_SUCCESS)
3082 static BC_STATUS zbc_lex_token(BcLex *l)
3084 BcStatus s = BC_STATUS_SUCCESS;
3085 char c = l->buf[l->i++], c2;
3087 // This is the workhorse of the lexer.
3092 l->t.t = !c ? BC_LEX_EOF : BC_LEX_NLINE;
3099 bc_lex_whitespace(l);
3102 bc_lex_assign(l, BC_LEX_OP_REL_NE, BC_LEX_OP_BOOL_NOT);
3103 if (l->t.t == BC_LEX_OP_BOOL_NOT) {
3104 s = bc_POSIX_does_not_allow_bool_ops_this_is_bad("!");
3105 ERROR_RETURN(if (s) RETURN_STATUS(s);)
3109 s = zbc_lex_string(l);
3112 s = bc_POSIX_does_not_allow("'#' script comments");
3113 ERROR_RETURN(if (s) RETURN_STATUS(s);)
3114 bc_lex_lineComment(l);
3117 bc_lex_assign(l, BC_LEX_OP_ASSIGN_MODULUS, BC_LEX_OP_MODULUS);
3122 s = bc_POSIX_does_not_allow_bool_ops_this_is_bad("&&");
3123 ERROR_RETURN(if (s) RETURN_STATUS(s);)
3125 l->t.t = BC_LEX_OP_BOOL_AND;
3127 l->t.t = BC_LEX_INVALID;
3128 s = bc_error_bad_character('&');
3133 l->t.t = (BcLexType)(c - '(' + BC_LEX_LPAREN);
3136 bc_lex_assign(l, BC_LEX_OP_ASSIGN_MULTIPLY, BC_LEX_OP_MULTIPLY);
3142 l->t.t = BC_LEX_OP_INC;
3144 bc_lex_assign(l, BC_LEX_OP_ASSIGN_PLUS, BC_LEX_OP_PLUS);
3147 l->t.t = BC_LEX_COMMA;
3153 l->t.t = BC_LEX_OP_DEC;
3155 bc_lex_assign(l, BC_LEX_OP_ASSIGN_MINUS, BC_LEX_OP_MINUS);
3158 if (isdigit(l->buf[l->i]))
3159 s = zbc_lex_number(l, c);
3161 l->t.t = BC_LEX_KEY_LAST;
3162 s = bc_POSIX_does_not_allow("a period ('.') as a shortcut for the last result");
3168 s = zbc_lex_comment(l);
3170 bc_lex_assign(l, BC_LEX_OP_ASSIGN_DIVIDE, BC_LEX_OP_DIVIDE);
3188 s = zbc_lex_number(l, c);
3191 l->t.t = BC_LEX_SCOLON;
3194 bc_lex_assign(l, BC_LEX_OP_REL_LE, BC_LEX_OP_REL_LT);
3197 bc_lex_assign(l, BC_LEX_OP_REL_EQ, BC_LEX_OP_ASSIGN);
3200 bc_lex_assign(l, BC_LEX_OP_REL_GE, BC_LEX_OP_REL_GT);
3204 l->t.t = (BcLexType)(c - '[' + BC_LEX_LBRACKET);
3207 if (l->buf[l->i] == '\n') {
3208 l->t.t = BC_LEX_WHITESPACE;
3211 s = bc_error_bad_character(c);
3214 bc_lex_assign(l, BC_LEX_OP_ASSIGN_POWER, BC_LEX_OP_POWER);
3242 s = zbc_lex_identifier(l);
3246 l->t.t = (BcLexType)(c - '{' + BC_LEX_LBRACE);
3251 s = bc_POSIX_does_not_allow_bool_ops_this_is_bad("||");
3252 ERROR_RETURN(if (s) RETURN_STATUS(s);)
3254 l->t.t = BC_LEX_OP_BOOL_OR;
3256 l->t.t = BC_LEX_INVALID;
3257 s = bc_error_bad_character(c);
3261 l->t.t = BC_LEX_INVALID;
3262 s = bc_error_bad_character(c);
3271 static BC_STATUS zdc_lex_register(BcLex *l)
3273 if (isspace(l->buf[l->i - 1])) {
3274 bc_lex_whitespace(l);
3277 RETURN_STATUS(bc_error("extended register"));
3281 bc_vec_pop_all(&l->t.v);
3282 bc_vec_push(&l->t.v, &l->buf[l->i - 1]);
3283 bc_vec_pushZeroByte(&l->t.v);
3284 l->t.t = BC_LEX_NAME;
3287 RETURN_STATUS(BC_STATUS_SUCCESS);
3289 #if ERRORS_ARE_FATAL
3290 # define zdc_lex_register(...) (zdc_lex_register(__VA_ARGS__), BC_STATUS_SUCCESS)
3293 static BC_STATUS zdc_lex_string(BcLex *l)
3295 size_t depth = 1, nls = 0, i = l->i;
3298 l->t.t = BC_LEX_STR;
3299 bc_vec_pop_all(&l->t.v);
3301 for (c = l->buf[i]; c != 0 && depth; c = l->buf[++i]) {
3303 depth += (c == '[' && (i == l->i || l->buf[i - 1] != '\\'));
3304 depth -= (c == ']' && (i == l->i || l->buf[i - 1] != '\\'));
3307 if (depth) bc_vec_push(&l->t.v, &c);
3312 RETURN_STATUS(bc_error("string end could not be found"));
3315 bc_vec_pushZeroByte(&l->t.v);
3316 // This check makes sense only if size_t is (much) larger than BC_MAX_STRING.
3317 if (SIZE_MAX > (BC_MAX_STRING | 0xff)) {
3318 if (i - l->i > BC_MAX_STRING)
3319 RETURN_STATUS(bc_error("string too long: must be [1,"BC_MAX_STRING_STR"]"));
3324 G.err_line = l->line;
3326 RETURN_STATUS(BC_STATUS_SUCCESS);
3328 #if ERRORS_ARE_FATAL
3329 # define zdc_lex_string(...) (zdc_lex_string(__VA_ARGS__), BC_STATUS_SUCCESS)
3332 static BC_STATUS zdc_lex_token(BcLex *l)
3334 BcStatus s = BC_STATUS_SUCCESS;
3335 char c = l->buf[l->i++], c2;
3338 for (i = 0; i < ARRAY_SIZE(dc_lex_regs); ++i) {
3339 if (l->t.last == dc_lex_regs[i])
3340 RETURN_STATUS(zdc_lex_register(l));
3343 if (c >= '%' && c <= '~'
3344 && (l->t.t = dc_lex_tokens[(c - '%')]) != BC_LEX_INVALID
3349 // This is the workhorse of the lexer.
3352 l->t.t = BC_LEX_EOF;
3360 l->newline = (c == '\n');
3361 bc_lex_whitespace(l);
3366 l->t.t = BC_LEX_OP_REL_NE;
3368 l->t.t = BC_LEX_OP_REL_LE;
3370 l->t.t = BC_LEX_OP_REL_GE;
3372 RETURN_STATUS(bc_error_bad_character(c));
3376 bc_lex_lineComment(l);
3379 if (isdigit(l->buf[l->i]))
3380 s = zbc_lex_number(l, c);
3382 s = bc_error_bad_character(c);
3400 s = zbc_lex_number(l, c);
3403 s = zdc_lex_string(l);
3406 l->t.t = BC_LEX_INVALID;
3407 s = bc_error_bad_character(c);
3415 static void bc_program_addFunc(char *name, size_t *idx);
3417 static void bc_parse_addFunc(BcParse *p, char *name, size_t *idx)
3419 bc_program_addFunc(name, idx);
3420 p->func = bc_program_func(p->fidx);
3423 #define bc_parse_push(p, i) bc_vec_pushByte(&(p)->func->code, (char) (i))
3425 static void bc_parse_pushName(BcParse *p, char *name)
3427 size_t i = 0, len = strlen(name);
3429 for (; i < len; ++i) bc_parse_push(p, name[i]);
3430 bc_parse_push(p, BC_PARSE_STREND);
3435 static void bc_parse_pushIndex(BcParse *p, size_t idx)
3440 mask = ((size_t)0xff) << (sizeof(idx) * 8 - 8);
3443 if (idx & mask) break;
3448 bc_parse_push(p, amt);
3451 bc_parse_push(p, (unsigned char)idx);
3456 static void bc_parse_number(BcParse *p, BcInst *prev, size_t *nexs)
3458 char *num = xstrdup(p->l.t.v.v);
3459 size_t idx = G.prog.consts.len;
3461 bc_vec_push(&G.prog.consts, &num);
3463 bc_parse_push(p, BC_INST_NUM);
3464 bc_parse_pushIndex(p, idx);
3467 (*prev) = BC_INST_NUM;
3470 IF_BC(static BC_STATUS zbc_parse_parse(BcParse *p);)
3471 IF_DC(static BC_STATUS zdc_parse_parse(BcParse *p);)
3473 static BC_STATUS zcommon_parse(BcParse *p)
3476 IF_BC(RETURN_STATUS(zbc_parse_parse(p));)
3478 IF_DC(RETURN_STATUS(zdc_parse_parse(p));)
3481 static BC_STATUS zbc_parse_text(BcParse *p, const char *text)
3485 p->func = bc_program_func(p->fidx);
3487 if (!text[0] && !BC_PARSE_CAN_EXEC(p)) {
3488 p->l.t.t = BC_LEX_INVALID;
3489 s = BC_STATUS_SUCCESS;
3490 ERROR_RETURN(s =) zcommon_parse(p);
3491 if (s) RETURN_STATUS(s);
3492 if (!BC_PARSE_CAN_EXEC(p))
3493 RETURN_STATUS(bc_error("file is not executable"));
3496 RETURN_STATUS(zbc_lex_text(&p->l, text));
3498 #if ERRORS_ARE_FATAL
3499 # define zbc_parse_text(...) (zbc_parse_text(__VA_ARGS__), BC_STATUS_SUCCESS)
3502 // Called when parsing or execution detects a failure,
3503 // resets execution structures.
3504 static void bc_program_reset(void)
3509 bc_vec_npop(&G.prog.stack, G.prog.stack.len - 1);
3510 bc_vec_pop_all(&G.prog.results);
3512 f = bc_program_func(0);
3513 ip = bc_vec_top(&G.prog.stack);
3514 ip->idx = f->code.len;
3517 #define bc_parse_updateFunc(p, f) \
3518 ((p)->func = bc_program_func((p)->fidx = (f)))
3520 // Called when zbc/zdc_parse_parse() detects a failure,
3521 // resets parsing structures.
3522 static void bc_parse_reset(BcParse *p)
3524 if (p->fidx != BC_PROG_MAIN) {
3525 p->func->nparams = 0;
3526 bc_vec_pop_all(&p->func->code);
3527 bc_vec_pop_all(&p->func->autos);
3528 bc_vec_pop_all(&p->func->labels);
3530 bc_parse_updateFunc(p, BC_PROG_MAIN);
3534 p->l.t.t = BC_LEX_EOF;
3535 p->auto_part = (p->nbraces = 0);
3537 bc_vec_npop(&p->flags, p->flags.len - 1);
3538 bc_vec_pop_all(&p->exits);
3539 bc_vec_pop_all(&p->conds);
3540 bc_vec_pop_all(&p->ops);
3545 static void bc_parse_free(BcParse *p)
3547 bc_vec_free(&p->flags);
3548 bc_vec_free(&p->exits);
3549 bc_vec_free(&p->conds);
3550 bc_vec_free(&p->ops);
3554 static void bc_parse_create(BcParse *p, size_t func)
3556 memset(p, 0, sizeof(BcParse));
3559 bc_vec_init(&p->flags, sizeof(uint8_t), NULL);
3560 bc_vec_init(&p->exits, sizeof(BcInstPtr), NULL);
3561 bc_vec_init(&p->conds, sizeof(size_t), NULL);
3562 bc_vec_pushZeroByte(&p->flags);
3563 bc_vec_init(&p->ops, sizeof(BcLexType), NULL);
3565 // p->auto_part = p->nbraces = 0; - already is
3566 bc_parse_updateFunc(p, func);
3571 #define BC_PARSE_TOP_OP(p) (*((BcLexType *) bc_vec_top(&(p)->ops)))
3572 #define BC_PARSE_LEAF(p, rparen) \
3573 (((p) >= BC_INST_NUM && (p) <= BC_INST_SQRT) || (rparen) || \
3574 (p) == BC_INST_INC_POST || (p) == BC_INST_DEC_POST)
3576 // We can calculate the conversion between tokens and exprs by subtracting the
3577 // position of the first operator in the lex enum and adding the position of the
3578 // first in the expr enum. Note: This only works for binary operators.
3579 #define BC_PARSE_TOKEN_INST(t) ((char) ((t) -BC_LEX_NEG + BC_INST_NEG))
3581 static BC_STATUS zbc_parse_else(BcParse *p);
3582 static BC_STATUS zbc_parse_stmt(BcParse *p);
3583 static BC_STATUS zbc_parse_expr(BcParse *p, uint8_t flags, BcParseNext next);
3584 static BcStatus bc_parse_expr_empty_ok(BcParse *p, uint8_t flags, BcParseNext next);
3585 #if ERRORS_ARE_FATAL
3586 # define zbc_parse_else(...) (zbc_parse_else(__VA_ARGS__), BC_STATUS_SUCCESS)
3587 # define zbc_parse_stmt(...) (zbc_parse_stmt(__VA_ARGS__), BC_STATUS_SUCCESS)
3588 # define zbc_parse_expr(...) (zbc_parse_expr(__VA_ARGS__), BC_STATUS_SUCCESS)
3591 static BC_STATUS zbc_parse_operator(BcParse *p, BcLexType type, size_t start,
3592 size_t *nexprs, bool next)
3594 BcStatus s = BC_STATUS_SUCCESS;
3596 char l, r = bc_parse_op_PREC(type - BC_LEX_OP_INC);
3597 bool left = bc_parse_op_LEFT(type - BC_LEX_OP_INC);
3599 while (p->ops.len > start) {
3601 t = BC_PARSE_TOP_OP(p);
3602 if (t == BC_LEX_LPAREN) break;
3604 l = bc_parse_op_PREC(t - BC_LEX_OP_INC);
3605 if (l >= r && (l != r || !left)) break;
3607 bc_parse_push(p, BC_PARSE_TOKEN_INST(t));
3608 bc_vec_pop(&p->ops);
3609 *nexprs -= t != BC_LEX_OP_BOOL_NOT && t != BC_LEX_NEG;
3612 bc_vec_push(&p->ops, &type);
3613 if (next) s = zbc_lex_next(&p->l);
3617 #if ERRORS_ARE_FATAL
3618 # define zbc_parse_operator(...) (zbc_parse_operator(__VA_ARGS__), BC_STATUS_SUCCESS)
3621 static BC_STATUS zbc_parse_rightParen(BcParse *p, size_t ops_bgn, size_t *nexs)
3625 if (p->ops.len <= ops_bgn)
3626 RETURN_STATUS(bc_error_bad_expression());
3627 top = BC_PARSE_TOP_OP(p);
3629 while (top != BC_LEX_LPAREN) {
3630 bc_parse_push(p, BC_PARSE_TOKEN_INST(top));
3632 bc_vec_pop(&p->ops);
3633 *nexs -= top != BC_LEX_OP_BOOL_NOT && top != BC_LEX_NEG;
3635 if (p->ops.len <= ops_bgn)
3636 RETURN_STATUS(bc_error_bad_expression());
3637 top = BC_PARSE_TOP_OP(p);
3640 bc_vec_pop(&p->ops);
3642 RETURN_STATUS(zbc_lex_next(&p->l));
3644 #if ERRORS_ARE_FATAL
3645 # define zbc_parse_rightParen(...) (zbc_parse_rightParen(__VA_ARGS__), BC_STATUS_SUCCESS)
3648 static BC_STATUS zbc_parse_params(BcParse *p, uint8_t flags)
3654 s = zbc_lex_next(&p->l);
3655 if (s) RETURN_STATUS(s);
3657 for (nparams = 0; p->l.t.t != BC_LEX_RPAREN; ++nparams) {
3658 flags = (flags & ~(BC_PARSE_PRINT | BC_PARSE_REL)) | BC_PARSE_ARRAY;
3659 s = zbc_parse_expr(p, flags, bc_parse_next_param);
3660 if (s) RETURN_STATUS(s);
3662 comma = p->l.t.t == BC_LEX_COMMA;
3664 s = zbc_lex_next(&p->l);
3665 if (s) RETURN_STATUS(s);
3669 if (comma) RETURN_STATUS(bc_error_bad_token());
3670 bc_parse_push(p, BC_INST_CALL);
3671 bc_parse_pushIndex(p, nparams);
3673 RETURN_STATUS(BC_STATUS_SUCCESS);
3675 #if ERRORS_ARE_FATAL
3676 # define zbc_parse_params(...) (zbc_parse_params(__VA_ARGS__), BC_STATUS_SUCCESS)
3679 static BC_STATUS zbc_parse_call(BcParse *p, char *name, uint8_t flags)
3682 BcId entry, *entry_ptr;
3687 s = zbc_parse_params(p, flags);
3690 if (p->l.t.t != BC_LEX_RPAREN) {
3691 s = bc_error_bad_token();
3695 idx = bc_map_index(&G.prog.fn_map, &entry);
3697 if (idx == BC_VEC_INVALID_IDX) {
3698 name = xstrdup(entry.name);
3699 bc_parse_addFunc(p, name, &idx);
3700 idx = bc_map_index(&G.prog.fn_map, &entry);
3705 entry_ptr = bc_vec_item(&G.prog.fn_map, idx);
3706 bc_parse_pushIndex(p, entry_ptr->idx);
3708 RETURN_STATUS(zbc_lex_next(&p->l));
3714 #if ERRORS_ARE_FATAL
3715 # define zbc_parse_call(...) (zbc_parse_call(__VA_ARGS__), BC_STATUS_SUCCESS)
3718 static BC_STATUS zbc_parse_name(BcParse *p, BcInst *type, uint8_t flags)
3723 name = xstrdup(p->l.t.v.v);
3724 s = zbc_lex_next(&p->l);
3727 if (p->l.t.t == BC_LEX_LBRACKET) {
3728 s = zbc_lex_next(&p->l);
3731 if (p->l.t.t == BC_LEX_RBRACKET) {
3732 if (!(flags & BC_PARSE_ARRAY)) {
3733 s = bc_error_bad_expression();
3736 *type = BC_INST_ARRAY;
3738 *type = BC_INST_ARRAY_ELEM;
3739 flags &= ~(BC_PARSE_PRINT | BC_PARSE_REL);
3740 s = zbc_parse_expr(p, flags, bc_parse_next_elem);
3743 s = zbc_lex_next(&p->l);
3745 bc_parse_push(p, *type);
3746 bc_parse_pushName(p, name);
3748 else if (p->l.t.t == BC_LEX_LPAREN) {
3749 if (flags & BC_PARSE_NOCALL) {
3750 s = bc_error_bad_token();
3753 *type = BC_INST_CALL;
3754 s = zbc_parse_call(p, name, flags);
3756 *type = BC_INST_VAR;
3757 bc_parse_push(p, BC_INST_VAR);
3758 bc_parse_pushName(p, name);
3767 #if ERRORS_ARE_FATAL
3768 # define zbc_parse_name(...) (zbc_parse_name(__VA_ARGS__), BC_STATUS_SUCCESS)
3771 static BC_STATUS zbc_parse_read(BcParse *p)
3775 s = zbc_lex_next(&p->l);
3776 if (s) RETURN_STATUS(s);
3777 if (p->l.t.t != BC_LEX_LPAREN) RETURN_STATUS(bc_error_bad_token());
3779 s = zbc_lex_next(&p->l);
3780 if (s) RETURN_STATUS(s);
3781 if (p->l.t.t != BC_LEX_RPAREN) RETURN_STATUS(bc_error_bad_token());
3783 bc_parse_push(p, BC_INST_READ);
3785 RETURN_STATUS(zbc_lex_next(&p->l));
3787 #if ERRORS_ARE_FATAL
3788 # define zbc_parse_read(...) (zbc_parse_read(__VA_ARGS__), BC_STATUS_SUCCESS)
3791 static BC_STATUS zbc_parse_builtin(BcParse *p, BcLexType type, uint8_t flags,
3796 s = zbc_lex_next(&p->l);
3797 if (s) RETURN_STATUS(s);
3798 if (p->l.t.t != BC_LEX_LPAREN) RETURN_STATUS(bc_error_bad_token());
3800 flags = (flags & ~(BC_PARSE_PRINT | BC_PARSE_REL)) | BC_PARSE_ARRAY;
3802 s = zbc_lex_next(&p->l);
3803 if (s) RETURN_STATUS(s);
3805 s = zbc_parse_expr(p, flags, bc_parse_next_rel);
3806 if (s) RETURN_STATUS(s);
3808 if (p->l.t.t != BC_LEX_RPAREN) RETURN_STATUS(bc_error_bad_token());
3810 *prev = (type == BC_LEX_KEY_LENGTH) ? BC_INST_LENGTH : BC_INST_SQRT;
3811 bc_parse_push(p, *prev);
3813 RETURN_STATUS(zbc_lex_next(&p->l));
3815 #if ERRORS_ARE_FATAL
3816 # define zbc_parse_builtin(...) (zbc_parse_builtin(__VA_ARGS__), BC_STATUS_SUCCESS)
3819 static BC_STATUS zbc_parse_scale(BcParse *p, BcInst *type, uint8_t flags)
3823 s = zbc_lex_next(&p->l);
3824 if (s) RETURN_STATUS(s);
3826 if (p->l.t.t != BC_LEX_LPAREN) {
3827 *type = BC_INST_SCALE;
3828 bc_parse_push(p, BC_INST_SCALE);
3829 RETURN_STATUS(BC_STATUS_SUCCESS);
3832 *type = BC_INST_SCALE_FUNC;
3833 flags &= ~(BC_PARSE_PRINT | BC_PARSE_REL);
3835 s = zbc_lex_next(&p->l);
3836 if (s) RETURN_STATUS(s);
3838 s = zbc_parse_expr(p, flags, bc_parse_next_rel);
3839 if (s) RETURN_STATUS(s);
3840 if (p->l.t.t != BC_LEX_RPAREN)
3841 RETURN_STATUS(bc_error_bad_token());
3842 bc_parse_push(p, BC_INST_SCALE_FUNC);
3844 RETURN_STATUS(zbc_lex_next(&p->l));
3846 #if ERRORS_ARE_FATAL
3847 # define zbc_parse_scale(...) (zbc_parse_scale(__VA_ARGS__), BC_STATUS_SUCCESS)
3850 static BC_STATUS zbc_parse_incdec(BcParse *p, BcInst *prev, bool *paren_expr,
3851 size_t *nexprs, uint8_t flags)
3856 BcInst etype = *prev;
3858 if (etype == BC_INST_VAR || etype == BC_INST_ARRAY_ELEM ||
3859 etype == BC_INST_SCALE || etype == BC_INST_LAST ||
3860 etype == BC_INST_IBASE || etype == BC_INST_OBASE)
3862 *prev = inst = BC_INST_INC_POST + (p->l.t.t != BC_LEX_OP_INC);
3863 bc_parse_push(p, inst);
3864 s = zbc_lex_next(&p->l);
3867 *prev = inst = BC_INST_INC_PRE + (p->l.t.t != BC_LEX_OP_INC);
3870 s = zbc_lex_next(&p->l);
3871 if (s) RETURN_STATUS(s);
3874 // Because we parse the next part of the expression
3875 // right here, we need to increment this.
3876 *nexprs = *nexprs + 1;
3880 s = zbc_parse_name(p, prev, flags | BC_PARSE_NOCALL);
3882 case BC_LEX_KEY_IBASE:
3883 case BC_LEX_KEY_LAST:
3884 case BC_LEX_KEY_OBASE:
3885 bc_parse_push(p, type - BC_LEX_KEY_IBASE + BC_INST_IBASE);
3886 s = zbc_lex_next(&p->l);
3888 case BC_LEX_KEY_SCALE:
3889 s = zbc_lex_next(&p->l);
3890 if (s) RETURN_STATUS(s);
3891 if (p->l.t.t == BC_LEX_LPAREN)
3892 s = bc_error_bad_token();
3894 bc_parse_push(p, BC_INST_SCALE);
3897 s = bc_error_bad_token();
3901 if (!s) bc_parse_push(p, inst);
3906 #if ERRORS_ARE_FATAL
3907 # define zbc_parse_incdec(...) (zbc_parse_incdec(__VA_ARGS__), BC_STATUS_SUCCESS)
3910 static BC_STATUS zbc_parse_minus(BcParse *p, BcInst *prev, size_t ops_bgn,
3911 bool rparen, size_t *nexprs)
3915 BcInst etype = *prev;
3917 s = zbc_lex_next(&p->l);
3918 if (s) RETURN_STATUS(s);
3920 type = rparen || etype == BC_INST_INC_POST || etype == BC_INST_DEC_POST ||
3921 (etype >= BC_INST_NUM && etype <= BC_INST_SQRT) ?
3924 *prev = BC_PARSE_TOKEN_INST(type);
3926 // We can just push onto the op stack because this is the largest
3927 // precedence operator that gets pushed. Inc/dec does not.
3928 if (type != BC_LEX_OP_MINUS)
3929 bc_vec_push(&p->ops, &type);
3931 s = zbc_parse_operator(p, type, ops_bgn, nexprs, false);
3935 #if ERRORS_ARE_FATAL
3936 # define zbc_parse_minus(...) (zbc_parse_minus(__VA_ARGS__), BC_STATUS_SUCCESS)
3939 static BC_STATUS zbc_parse_string(BcParse *p, char inst)
3941 char *str = xstrdup(p->l.t.v.v);
3943 bc_parse_push(p, BC_INST_STR);
3944 bc_parse_pushIndex(p, G.prog.strs.len);
3945 bc_vec_push(&G.prog.strs, &str);
3946 bc_parse_push(p, inst);
3948 RETURN_STATUS(zbc_lex_next(&p->l));
3950 #if ERRORS_ARE_FATAL
3951 # define zbc_parse_string(...) (zbc_parse_string(__VA_ARGS__), BC_STATUS_SUCCESS)
3954 static BC_STATUS zbc_parse_print(BcParse *p)
3960 s = zbc_lex_next(&p->l);
3961 if (s) RETURN_STATUS(s);
3965 if (type == BC_LEX_SCOLON || type == BC_LEX_NLINE)
3966 RETURN_STATUS(bc_error("bad print statement"));
3969 while (type != BC_LEX_SCOLON && type != BC_LEX_NLINE) {
3970 if (type == BC_LEX_STR) {
3971 s = zbc_parse_string(p, BC_INST_PRINT_POP);
3972 if (s) RETURN_STATUS(s);
3974 s = zbc_parse_expr(p, 0, bc_parse_next_print);
3975 if (s) RETURN_STATUS(s);
3976 bc_parse_push(p, BC_INST_PRINT_POP);
3979 comma = p->l.t.t == BC_LEX_COMMA;
3981 s = zbc_lex_next(&p->l);
3982 if (s) RETURN_STATUS(s);
3987 if (comma) RETURN_STATUS(bc_error_bad_token());
3989 RETURN_STATUS(zbc_lex_next(&p->l));
3991 #if ERRORS_ARE_FATAL
3992 # define zbc_parse_print(...) (zbc_parse_print(__VA_ARGS__), BC_STATUS_SUCCESS)
3995 static BC_STATUS zbc_parse_return(BcParse *p)
4001 if (!BC_PARSE_FUNC(p)) RETURN_STATUS(bc_error_bad_token());
4003 s = zbc_lex_next(&p->l);
4004 if (s) RETURN_STATUS(s);
4007 paren = t == BC_LEX_LPAREN;
4009 if (t == BC_LEX_NLINE || t == BC_LEX_SCOLON)
4010 bc_parse_push(p, BC_INST_RET0);
4012 s = bc_parse_expr_empty_ok(p, 0, bc_parse_next_expr);
4013 if (s == BC_STATUS_PARSE_EMPTY_EXP) {
4014 bc_parse_push(p, BC_INST_RET0);
4015 s = zbc_lex_next(&p->l);
4017 if (s) RETURN_STATUS(s);
4019 if (!paren || p->l.t.last != BC_LEX_RPAREN) {
4020 s = bc_POSIX_requires("parentheses around return expressions");
4021 ERROR_RETURN(if (s) RETURN_STATUS(s);)
4024 bc_parse_push(p, BC_INST_RET);
4029 #if ERRORS_ARE_FATAL
4030 # define zbc_parse_return(...) (zbc_parse_return(__VA_ARGS__), BC_STATUS_SUCCESS)
4033 static BC_STATUS zbc_parse_endBody(BcParse *p, bool brace)
4035 BcStatus s = BC_STATUS_SUCCESS;
4037 if (p->flags.len <= 1 || (brace && p->nbraces == 0))
4038 RETURN_STATUS(bc_error_bad_token());
4041 if (p->l.t.t != BC_LEX_RBRACE)
4042 RETURN_STATUS(bc_error_bad_token());
4044 RETURN_STATUS(bc_error_bad_token());
4046 s = zbc_lex_next(&p->l);
4047 if (s) RETURN_STATUS(s);
4050 if (BC_PARSE_IF(p)) {
4053 while (p->l.t.t == BC_LEX_NLINE) {
4054 s = zbc_lex_next(&p->l);
4055 if (s) RETURN_STATUS(s);
4058 bc_vec_pop(&p->flags);
4060 flag_ptr = BC_PARSE_TOP_FLAG_PTR(p);
4061 *flag_ptr = (*flag_ptr | BC_PARSE_FLAG_IF_END);
4063 if (p->l.t.t == BC_LEX_KEY_ELSE)
4064 s = zbc_parse_else(p);
4066 else if (BC_PARSE_ELSE(p)) {
4070 bc_vec_pop(&p->flags);
4072 ip = bc_vec_top(&p->exits);
4073 label = bc_vec_item(&p->func->labels, ip->idx);
4074 *label = p->func->code.len;
4076 bc_vec_pop(&p->exits);
4078 else if (BC_PARSE_FUNC_INNER(p)) {
4079 bc_parse_push(p, BC_INST_RET0);
4080 bc_parse_updateFunc(p, BC_PROG_MAIN);
4081 bc_vec_pop(&p->flags);
4084 BcInstPtr *ip = bc_vec_top(&p->exits);
4085 size_t *label = bc_vec_top(&p->conds);
4087 bc_parse_push(p, BC_INST_JUMP);
4088 bc_parse_pushIndex(p, *label);
4090 label = bc_vec_item(&p->func->labels, ip->idx);
4091 *label = p->func->code.len;
4093 bc_vec_pop(&p->flags);
4094 bc_vec_pop(&p->exits);
4095 bc_vec_pop(&p->conds);
4100 #if ERRORS_ARE_FATAL
4101 # define zbc_parse_endBody(...) (zbc_parse_endBody(__VA_ARGS__), BC_STATUS_SUCCESS)
4104 static void bc_parse_startBody(BcParse *p, uint8_t flags)
4106 uint8_t *flag_ptr = BC_PARSE_TOP_FLAG_PTR(p);
4107 flags |= (*flag_ptr & (BC_PARSE_FLAG_FUNC | BC_PARSE_FLAG_LOOP));
4108 flags |= BC_PARSE_FLAG_BODY;
4109 bc_vec_push(&p->flags, &flags);
4112 static void bc_parse_noElse(BcParse *p)
4116 uint8_t *flag_ptr = BC_PARSE_TOP_FLAG_PTR(p);
4118 *flag_ptr = (*flag_ptr & ~(BC_PARSE_FLAG_IF_END));
4120 ip = bc_vec_top(&p->exits);
4121 label = bc_vec_item(&p->func->labels, ip->idx);
4122 *label = p->func->code.len;
4124 bc_vec_pop(&p->exits);
4127 static BC_STATUS zbc_parse_if(BcParse *p)
4132 s = zbc_lex_next(&p->l);
4133 if (s) RETURN_STATUS(s);
4134 if (p->l.t.t != BC_LEX_LPAREN) RETURN_STATUS(bc_error_bad_token());
4136 s = zbc_lex_next(&p->l);
4137 if (s) RETURN_STATUS(s);
4138 s = zbc_parse_expr(p, BC_PARSE_REL, bc_parse_next_rel);
4139 if (s) RETURN_STATUS(s);
4140 if (p->l.t.t != BC_LEX_RPAREN) RETURN_STATUS(bc_error_bad_token());
4142 s = zbc_lex_next(&p->l);
4143 if (s) RETURN_STATUS(s);
4144 bc_parse_push(p, BC_INST_JUMP_ZERO);
4146 ip.idx = p->func->labels.len;
4147 ip.func = ip.len = 0;
4149 bc_parse_pushIndex(p, ip.idx);
4150 bc_vec_push(&p->exits, &ip);
4151 bc_vec_push(&p->func->labels, &ip.idx);
4152 bc_parse_startBody(p, BC_PARSE_FLAG_IF);
4154 RETURN_STATUS(BC_STATUS_SUCCESS);
4156 #if ERRORS_ARE_FATAL
4157 # define zbc_parse_if(...) (zbc_parse_if(__VA_ARGS__), BC_STATUS_SUCCESS)
4160 #undef zbc_parse_else
4161 static BC_STATUS zbc_parse_else(BcParse *p)
4165 if (!BC_PARSE_IF_END(p)) RETURN_STATUS(bc_error_bad_token());
4167 ip.idx = p->func->labels.len;
4168 ip.func = ip.len = 0;
4170 bc_parse_push(p, BC_INST_JUMP);
4171 bc_parse_pushIndex(p, ip.idx);
4175 bc_vec_push(&p->exits, &ip);
4176 bc_vec_push(&p->func->labels, &ip.idx);
4177 bc_parse_startBody(p, BC_PARSE_FLAG_ELSE);
4179 RETURN_STATUS(zbc_lex_next(&p->l));
4181 #if ERRORS_ARE_FATAL
4182 # define zbc_parse_else(...) (zbc_parse_else(__VA_ARGS__), BC_STATUS_SUCCESS)
4185 static BC_STATUS zbc_parse_while(BcParse *p)
4190 s = zbc_lex_next(&p->l);
4191 if (s) RETURN_STATUS(s);
4192 if (p->l.t.t != BC_LEX_LPAREN) RETURN_STATUS(bc_error_bad_token());
4193 s = zbc_lex_next(&p->l);
4194 if (s) RETURN_STATUS(s);
4196 ip.idx = p->func->labels.len;
4198 bc_vec_push(&p->func->labels, &p->func->code.len);
4199 bc_vec_push(&p->conds, &ip.idx);
4201 ip.idx = p->func->labels.len;
4205 bc_vec_push(&p->exits, &ip);
4206 bc_vec_push(&p->func->labels, &ip.idx);
4208 s = zbc_parse_expr(p, BC_PARSE_REL, bc_parse_next_rel);
4209 if (s) RETURN_STATUS(s);
4210 if (p->l.t.t != BC_LEX_RPAREN) RETURN_STATUS(bc_error_bad_token());
4211 s = zbc_lex_next(&p->l);
4212 if (s) RETURN_STATUS(s);
4214 bc_parse_push(p, BC_INST_JUMP_ZERO);
4215 bc_parse_pushIndex(p, ip.idx);
4216 bc_parse_startBody(p, BC_PARSE_FLAG_LOOP | BC_PARSE_FLAG_LOOP_INNER);
4218 RETURN_STATUS(BC_STATUS_SUCCESS);
4220 #if ERRORS_ARE_FATAL
4221 # define zbc_parse_while(...) (zbc_parse_while(__VA_ARGS__), BC_STATUS_SUCCESS)
4224 static BC_STATUS zbc_parse_for(BcParse *p)
4228 size_t cond_idx, exit_idx, body_idx, update_idx;
4230 s = zbc_lex_next(&p->l);
4231 if (s) RETURN_STATUS(s);
4232 if (p->l.t.t != BC_LEX_LPAREN) RETURN_STATUS(bc_error_bad_token());
4233 s = zbc_lex_next(&p->l);
4234 if (s) RETURN_STATUS(s);
4236 if (p->l.t.t != BC_LEX_SCOLON)
4237 s = zbc_parse_expr(p, 0, bc_parse_next_for);
4239 s = bc_POSIX_does_not_allow_empty_X_expression_in_for("init");
4241 if (s) RETURN_STATUS(s);
4242 if (p->l.t.t != BC_LEX_SCOLON) RETURN_STATUS(bc_error_bad_token());
4243 s = zbc_lex_next(&p->l);
4244 if (s) RETURN_STATUS(s);
4246 cond_idx = p->func->labels.len;
4247 update_idx = cond_idx + 1;
4248 body_idx = update_idx + 1;
4249 exit_idx = body_idx + 1;
4251 bc_vec_push(&p->func->labels, &p->func->code.len);
4253 if (p->l.t.t != BC_LEX_SCOLON)
4254 s = zbc_parse_expr(p, BC_PARSE_REL, bc_parse_next_for);
4256 s = bc_POSIX_does_not_allow_empty_X_expression_in_for("condition");
4258 if (s) RETURN_STATUS(s);
4259 if (p->l.t.t != BC_LEX_SCOLON) RETURN_STATUS(bc_error_bad_token());
4261 s = zbc_lex_next(&p->l);
4262 if (s) RETURN_STATUS(s);
4264 bc_parse_push(p, BC_INST_JUMP_ZERO);
4265 bc_parse_pushIndex(p, exit_idx);
4266 bc_parse_push(p, BC_INST_JUMP);
4267 bc_parse_pushIndex(p, body_idx);
4269 ip.idx = p->func->labels.len;
4271 bc_vec_push(&p->conds, &update_idx);
4272 bc_vec_push(&p->func->labels, &p->func->code.len);
4274 if (p->l.t.t != BC_LEX_RPAREN)
4275 s = zbc_parse_expr(p, 0, bc_parse_next_rel);
4277 s = bc_POSIX_does_not_allow_empty_X_expression_in_for("update");
4279 if (s) RETURN_STATUS(s);
4281 if (p->l.t.t != BC_LEX_RPAREN) RETURN_STATUS(bc_error_bad_token());
4282 bc_parse_push(p, BC_INST_JUMP);
4283 bc_parse_pushIndex(p, cond_idx);
4284 bc_vec_push(&p->func->labels, &p->func->code.len);
4290 bc_vec_push(&p->exits, &ip);
4291 bc_vec_push(&p->func->labels, &ip.idx);
4292 s = zbc_lex_next(&p->l);
4293 if (s) RETURN_STATUS(s);
4294 bc_parse_startBody(p, BC_PARSE_FLAG_LOOP | BC_PARSE_FLAG_LOOP_INNER);
4296 RETURN_STATUS(BC_STATUS_SUCCESS);
4298 #if ERRORS_ARE_FATAL
4299 # define zbc_parse_for(...) (zbc_parse_for(__VA_ARGS__), BC_STATUS_SUCCESS)
4302 static BC_STATUS zbc_parse_loopExit(BcParse *p, BcLexType type)
4308 if (!BC_PARSE_LOOP(p)) RETURN_STATUS(bc_error_bad_token());
4310 if (type == BC_LEX_KEY_BREAK) {
4311 if (p->exits.len == 0) RETURN_STATUS(bc_error_bad_token());
4313 i = p->exits.len - 1;
4314 ip = bc_vec_item(&p->exits, i);
4316 while (!ip->func && i < p->exits.len)
4317 ip = bc_vec_item(&p->exits, i--);
4318 if (i >= p->exits.len && !ip->func)
4319 RETURN_STATUS(bc_error_bad_token());
4324 i = *((size_t *) bc_vec_top(&p->conds));
4326 bc_parse_push(p, BC_INST_JUMP);
4327 bc_parse_pushIndex(p, i);
4329 s = zbc_lex_next(&p->l);
4330 if (s) RETURN_STATUS(s);
4332 if (p->l.t.t != BC_LEX_SCOLON && p->l.t.t != BC_LEX_NLINE)
4333 RETURN_STATUS(bc_error_bad_token());
4335 RETURN_STATUS(zbc_lex_next(&p->l));
4337 #if ERRORS_ARE_FATAL
4338 # define zbc_parse_loopExit(...) (zbc_parse_loopExit(__VA_ARGS__), BC_STATUS_SUCCESS)
4341 static BC_STATUS zbc_parse_func(BcParse *p)
4344 bool var, comma = false;
4348 s = zbc_lex_next(&p->l);
4349 if (s) RETURN_STATUS(s);
4350 if (p->l.t.t != BC_LEX_NAME)
4351 RETURN_STATUS(bc_error("bad function definition"));
4353 name = xstrdup(p->l.t.v.v);
4354 bc_parse_addFunc(p, name, &p->fidx);
4356 s = zbc_lex_next(&p->l);
4357 if (s) RETURN_STATUS(s);
4358 if (p->l.t.t != BC_LEX_LPAREN)
4359 RETURN_STATUS(bc_error("bad function definition"));
4360 s = zbc_lex_next(&p->l);
4361 if (s) RETURN_STATUS(s);
4363 while (p->l.t.t != BC_LEX_RPAREN) {
4364 if (p->l.t.t != BC_LEX_NAME)
4365 RETURN_STATUS(bc_error("bad function definition"));
4369 name = xstrdup(p->l.t.v.v);
4370 s = zbc_lex_next(&p->l);
4373 var = p->l.t.t != BC_LEX_LBRACKET;
4376 s = zbc_lex_next(&p->l);
4379 if (p->l.t.t != BC_LEX_RBRACKET) {
4380 s = bc_error("bad function definition");
4384 s = zbc_lex_next(&p->l);
4388 comma = p->l.t.t == BC_LEX_COMMA;
4390 s = zbc_lex_next(&p->l);
4394 s = zbc_func_insert(p->func, name, var);
4398 if (comma) RETURN_STATUS(bc_error("bad function definition"));
4400 flags = BC_PARSE_FLAG_FUNC | BC_PARSE_FLAG_FUNC_INNER | BC_PARSE_FLAG_BODY;
4401 bc_parse_startBody(p, flags);
4403 s = zbc_lex_next(&p->l);
4404 if (s) RETURN_STATUS(s);
4406 if (p->l.t.t != BC_LEX_LBRACE)
4407 s = bc_POSIX_requires("the left brace be on the same line as the function header");
4415 #if ERRORS_ARE_FATAL
4416 # define zbc_parse_func(...) (zbc_parse_func(__VA_ARGS__), BC_STATUS_SUCCESS)
4419 static BC_STATUS zbc_parse_auto(BcParse *p)
4422 bool comma, var, one;
4425 if (!p->auto_part) RETURN_STATUS(bc_error_bad_token());
4427 s = zbc_lex_next(&p->l);
4428 if (s) RETURN_STATUS(s);
4430 p->auto_part = comma = false;
4431 one = p->l.t.t == BC_LEX_NAME;
4433 while (p->l.t.t == BC_LEX_NAME) {
4434 name = xstrdup(p->l.t.v.v);
4435 s = zbc_lex_next(&p->l);
4438 var = p->l.t.t != BC_LEX_LBRACKET;
4440 s = zbc_lex_next(&p->l);
4443 if (p->l.t.t != BC_LEX_RBRACKET) {
4444 s = bc_error("bad function definition");
4448 s = zbc_lex_next(&p->l);
4452 comma = p->l.t.t == BC_LEX_COMMA;
4454 s = zbc_lex_next(&p->l);
4458 s = zbc_func_insert(p->func, name, var);
4462 if (comma) RETURN_STATUS(bc_error("bad function definition"));
4463 if (!one) RETURN_STATUS(bc_error("no auto variable found"));
4465 if (p->l.t.t != BC_LEX_NLINE && p->l.t.t != BC_LEX_SCOLON)
4466 RETURN_STATUS(bc_error_bad_token());
4468 RETURN_STATUS(zbc_lex_next(&p->l));
4474 #if ERRORS_ARE_FATAL
4475 # define zbc_parse_auto(...) (zbc_parse_auto(__VA_ARGS__), BC_STATUS_SUCCESS)
4478 static BC_STATUS zbc_parse_body(BcParse *p, bool brace)
4480 BcStatus s = BC_STATUS_SUCCESS;
4481 uint8_t *flag_ptr = bc_vec_top(&p->flags);
4483 *flag_ptr &= ~(BC_PARSE_FLAG_BODY);
4485 if (*flag_ptr & BC_PARSE_FLAG_FUNC_INNER) {
4486 if (!brace) RETURN_STATUS(bc_error_bad_token());
4488 p->auto_part = p->l.t.t != BC_LEX_KEY_AUTO;
4490 if (!p->auto_part) {
4491 s = zbc_parse_auto(p);
4492 if (s) RETURN_STATUS(s);
4495 if (p->l.t.t == BC_LEX_NLINE) s = zbc_lex_next(&p->l);
4498 s = zbc_parse_stmt(p);
4499 if (!s && !brace) s = zbc_parse_endBody(p, false);
4504 #if ERRORS_ARE_FATAL
4505 # define zbc_parse_body(...) (zbc_parse_body(__VA_ARGS__), BC_STATUS_SUCCESS)
4508 #undef zbc_parse_stmt
4509 static BC_STATUS zbc_parse_stmt(BcParse *p)
4511 BcStatus s = BC_STATUS_SUCCESS;
4515 RETURN_STATUS(zbc_lex_next(&p->l));
4517 case BC_LEX_KEY_ELSE:
4518 p->auto_part = false;
4522 if (!BC_PARSE_BODY(p)) RETURN_STATUS(bc_error_bad_token());
4524 s = zbc_lex_next(&p->l);
4525 if (s) RETURN_STATUS(s);
4526 RETURN_STATUS(zbc_parse_body(p, true));
4528 case BC_LEX_KEY_AUTO:
4529 RETURN_STATUS(zbc_parse_auto(p));
4532 p->auto_part = false;
4533 if (BC_PARSE_IF_END(p)) {
4535 RETURN_STATUS(BC_STATUS_SUCCESS);
4537 if (BC_PARSE_BODY(p))
4538 RETURN_STATUS(zbc_parse_body(p, false));
4545 case BC_LEX_OP_MINUS:
4546 case BC_LEX_OP_BOOL_NOT:
4550 case BC_LEX_KEY_IBASE:
4551 case BC_LEX_KEY_LAST:
4552 case BC_LEX_KEY_LENGTH:
4553 case BC_LEX_KEY_OBASE:
4554 case BC_LEX_KEY_READ:
4555 case BC_LEX_KEY_SCALE:
4556 case BC_LEX_KEY_SQRT:
4557 s = zbc_parse_expr(p, BC_PARSE_PRINT, bc_parse_next_expr);
4559 case BC_LEX_KEY_ELSE:
4560 s = zbc_parse_else(p);
4563 while (!s && p->l.t.t == BC_LEX_SCOLON) s = zbc_lex_next(&p->l);
4566 s = zbc_parse_endBody(p, true);
4569 s = zbc_parse_string(p, BC_INST_PRINT_STR);
4571 case BC_LEX_KEY_BREAK:
4572 case BC_LEX_KEY_CONTINUE:
4573 s = zbc_parse_loopExit(p, p->l.t.t);
4575 case BC_LEX_KEY_FOR:
4576 s = zbc_parse_for(p);
4578 case BC_LEX_KEY_HALT:
4579 bc_parse_push(p, BC_INST_HALT);
4580 s = zbc_lex_next(&p->l);
4583 s = zbc_parse_if(p);
4585 case BC_LEX_KEY_LIMITS:
4586 // "limits" is a compile-time command,
4587 // the output is produced at _parse time_.
4588 s = zbc_lex_next(&p->l);
4589 if (s) RETURN_STATUS(s);
4591 "BC_BASE_MAX = "BC_MAX_OBASE_STR "\n"
4592 "BC_DIM_MAX = "BC_MAX_DIM_STR "\n"
4593 "BC_SCALE_MAX = "BC_MAX_SCALE_STR "\n"
4594 "BC_STRING_MAX = "BC_MAX_STRING_STR"\n"
4595 "BC_NAME_MAX = "BC_MAX_NAME_STR "\n"
4596 "BC_NUM_MAX = "BC_MAX_NUM_STR "\n"
4597 "MAX Exponent = "BC_MAX_EXP_STR "\n"
4598 "Number of vars = "BC_MAX_VARS_STR "\n"
4601 case BC_LEX_KEY_PRINT:
4602 s = zbc_parse_print(p);
4604 case BC_LEX_KEY_QUIT:
4605 // "quit" is a compile-time command. For example,
4606 // "if (0 == 1) quit" terminates when parsing the statement,
4607 // not when it is executed
4608 QUIT_OR_RETURN_TO_MAIN;
4609 case BC_LEX_KEY_RETURN:
4610 s = zbc_parse_return(p);
4612 case BC_LEX_KEY_WHILE:
4613 s = zbc_parse_while(p);
4616 s = bc_error_bad_token();
4622 #if ERRORS_ARE_FATAL
4623 # define zbc_parse_stmt(...) (zbc_parse_stmt(__VA_ARGS__), BC_STATUS_SUCCESS)
4626 static BC_STATUS zbc_parse_parse(BcParse *p)
4630 if (p->l.t.t == BC_LEX_EOF)
4631 s = p->flags.len > 0 ? bc_error("block end could not be found") : bc_error("end of file");
4632 else if (p->l.t.t == BC_LEX_KEY_DEFINE) {
4633 if (!BC_PARSE_CAN_EXEC(p))
4634 RETURN_STATUS(bc_error_bad_token());
4635 s = zbc_parse_func(p);
4637 s = zbc_parse_stmt(p);
4639 if (s || G_interrupt) {
4641 s = BC_STATUS_FAILURE;
4646 #if ERRORS_ARE_FATAL
4647 # define zbc_parse_parse(...) (zbc_parse_parse(__VA_ARGS__), BC_STATUS_SUCCESS)
4650 // This is not a "z" function: can also return BC_STATUS_PARSE_EMPTY_EXP
4651 static BcStatus bc_parse_expr_empty_ok(BcParse *p, uint8_t flags, BcParseNext next)
4653 BcStatus s = BC_STATUS_SUCCESS;
4654 BcInst prev = BC_INST_PRINT;
4655 BcLexType top, t = p->l.t.t;
4656 size_t nexprs = 0, ops_bgn = p->ops.len;
4657 unsigned nparens, nrelops;
4658 bool paren_first, paren_expr, rprn, done, get_token, assign, bin_last;
4660 paren_first = p->l.t.t == BC_LEX_LPAREN;
4661 nparens = nrelops = 0;
4662 paren_expr = rprn = done = get_token = assign = false;
4665 for (; !G_interrupt && !s && !done && bc_parse_exprs(t); t = p->l.t.t) {
4671 s = zbc_parse_incdec(p, &prev, &paren_expr, &nexprs, flags);
4672 rprn = get_token = bin_last = false;
4676 case BC_LEX_OP_MINUS:
4678 s = zbc_parse_minus(p, &prev, ops_bgn, rprn, &nexprs);
4679 rprn = get_token = false;
4680 bin_last = prev == BC_INST_MINUS;
4684 case BC_LEX_OP_ASSIGN_POWER:
4685 case BC_LEX_OP_ASSIGN_MULTIPLY:
4686 case BC_LEX_OP_ASSIGN_DIVIDE:
4687 case BC_LEX_OP_ASSIGN_MODULUS:
4688 case BC_LEX_OP_ASSIGN_PLUS:
4689 case BC_LEX_OP_ASSIGN_MINUS:
4690 case BC_LEX_OP_ASSIGN:
4692 if (prev != BC_INST_VAR && prev != BC_INST_ARRAY_ELEM &&
4693 prev != BC_INST_SCALE && prev != BC_INST_IBASE &&
4694 prev != BC_INST_OBASE && prev != BC_INST_LAST)
4696 s = bc_error("bad assignment:"
4697 " left side must be scale,"
4698 " ibase, obase, last, var,"
4705 case BC_LEX_OP_POWER:
4706 case BC_LEX_OP_MULTIPLY:
4707 case BC_LEX_OP_DIVIDE:
4708 case BC_LEX_OP_MODULUS:
4709 case BC_LEX_OP_PLUS:
4710 case BC_LEX_OP_REL_EQ:
4711 case BC_LEX_OP_REL_LE:
4712 case BC_LEX_OP_REL_GE:
4713 case BC_LEX_OP_REL_NE:
4714 case BC_LEX_OP_REL_LT:
4715 case BC_LEX_OP_REL_GT:
4716 case BC_LEX_OP_BOOL_NOT:
4717 case BC_LEX_OP_BOOL_OR:
4718 case BC_LEX_OP_BOOL_AND:
4720 if (((t == BC_LEX_OP_BOOL_NOT) != bin_last)
4721 || (t != BC_LEX_OP_BOOL_NOT && prev == BC_INST_BOOL_NOT)
4723 return bc_error_bad_expression();
4726 nrelops += t >= BC_LEX_OP_REL_EQ && t <= BC_LEX_OP_REL_GT;
4727 prev = BC_PARSE_TOKEN_INST(t);
4728 s = zbc_parse_operator(p, t, ops_bgn, &nexprs, true);
4729 rprn = get_token = false;
4730 bin_last = t != BC_LEX_OP_BOOL_NOT;
4737 if (BC_PARSE_LEAF(prev, rprn))
4738 return bc_error_bad_expression();
4740 paren_expr = rprn = bin_last = false;
4742 bc_vec_push(&p->ops, &t);
4749 if (bin_last || prev == BC_INST_BOOL_NOT)
4750 return bc_error_bad_expression();
4753 s = BC_STATUS_SUCCESS;
4758 else if (!paren_expr)
4759 return BC_STATUS_PARSE_EMPTY_EXP;
4762 paren_expr = rprn = true;
4763 get_token = bin_last = false;
4765 s = zbc_parse_rightParen(p, ops_bgn, &nexprs);
4772 if (BC_PARSE_LEAF(prev, rprn))
4773 return bc_error_bad_expression();
4775 rprn = get_token = bin_last = false;
4776 s = zbc_parse_name(p, &prev, flags & ~BC_PARSE_NOCALL);
4784 if (BC_PARSE_LEAF(prev, rprn))
4785 return bc_error_bad_expression();
4786 bc_parse_number(p, &prev, &nexprs);
4787 paren_expr = get_token = true;
4788 rprn = bin_last = false;
4793 case BC_LEX_KEY_IBASE:
4794 case BC_LEX_KEY_LAST:
4795 case BC_LEX_KEY_OBASE:
4797 if (BC_PARSE_LEAF(prev, rprn))
4798 return bc_error_bad_expression();
4799 prev = (char) (t - BC_LEX_KEY_IBASE + BC_INST_IBASE);
4800 bc_parse_push(p, (char) prev);
4802 paren_expr = get_token = true;
4803 rprn = bin_last = false;
4809 case BC_LEX_KEY_LENGTH:
4810 case BC_LEX_KEY_SQRT:
4812 if (BC_PARSE_LEAF(prev, rprn))
4813 return bc_error_bad_expression();
4814 s = zbc_parse_builtin(p, t, flags, &prev);
4816 rprn = get_token = bin_last = false;
4822 case BC_LEX_KEY_READ:
4824 if (BC_PARSE_LEAF(prev, rprn))
4825 return bc_error_bad_expression();
4826 else if (flags & BC_PARSE_NOREAD)
4827 s = bc_error_nested_read_call();
4829 s = zbc_parse_read(p);
4832 rprn = get_token = bin_last = false;
4834 prev = BC_INST_READ;
4839 case BC_LEX_KEY_SCALE:
4841 if (BC_PARSE_LEAF(prev, rprn))
4842 return bc_error_bad_expression();
4843 s = zbc_parse_scale(p, &prev, flags);
4845 rprn = get_token = bin_last = false;
4847 prev = BC_INST_SCALE;
4854 s = bc_error_bad_token();
4859 if (!s && get_token) s = zbc_lex_next(&p->l);
4863 if (G_interrupt) return BC_STATUS_FAILURE; // ^C: stop parsing
4865 while (p->ops.len > ops_bgn) {
4867 top = BC_PARSE_TOP_OP(p);
4868 assign = top >= BC_LEX_OP_ASSIGN_POWER && top <= BC_LEX_OP_ASSIGN;
4870 if (top == BC_LEX_LPAREN || top == BC_LEX_RPAREN)
4871 return bc_error_bad_expression();
4873 bc_parse_push(p, BC_PARSE_TOKEN_INST(top));
4875 nexprs -= top != BC_LEX_OP_BOOL_NOT && top != BC_LEX_NEG;
4876 bc_vec_pop(&p->ops);
4879 if (prev == BC_INST_BOOL_NOT || nexprs != 1)
4880 return bc_error_bad_expression();
4882 // next is BcParseNext, byte array of up to 4 BC_LEX's, packed into 32-bit word
4884 if (t == (next & 0x7f))
4886 if (next & 0x80) // last element?
4890 return bc_error_bad_expression();
4893 if (!(flags & BC_PARSE_REL) && nrelops) {
4894 s = bc_POSIX_does_not_allow("comparison operators outside if or loops");
4895 ERROR_RETURN(if (s) return s;)
4897 else if ((flags & BC_PARSE_REL) && nrelops > 1) {
4898 s = bc_POSIX_requires("exactly one comparison operator per condition");
4899 ERROR_RETURN(if (s) return s;)
4902 if (flags & BC_PARSE_PRINT) {
4903 if (paren_first || !assign) bc_parse_push(p, BC_INST_PRINT);
4904 bc_parse_push(p, BC_INST_POP);
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)
4924 static BC_STATUS zbc_parse_expression(BcParse *p, uint8_t flags)
4926 RETURN_STATUS(zbc_parse_expr(p, flags, bc_parse_next_read));
4928 #if ERRORS_ARE_FATAL
4929 # define zbc_parse_expression(...) (zbc_parse_expression(__VA_ARGS__), BC_STATUS_SUCCESS)
4936 #define DC_PARSE_BUF_LEN ((int) (sizeof(uint32_t) * CHAR_BIT))
4938 static BC_STATUS zdc_parse_register(BcParse *p)
4943 s = zbc_lex_next(&p->l);
4944 if (s) RETURN_STATUS(s);
4945 if (p->l.t.t != BC_LEX_NAME) RETURN_STATUS(bc_error_bad_token());
4947 name = xstrdup(p->l.t.v.v);
4948 bc_parse_pushName(p, name);
4952 #if ERRORS_ARE_FATAL
4953 # define zdc_parse_register(...) (zdc_parse_register(__VA_ARGS__), BC_STATUS_SUCCESS)
4956 static BC_STATUS zdc_parse_string(BcParse *p)
4958 char *str, *name, b[DC_PARSE_BUF_LEN + 1];
4959 size_t idx, len = G.prog.strs.len;
4961 sprintf(b, "%0*zu", DC_PARSE_BUF_LEN, len);
4964 str = xstrdup(p->l.t.v.v);
4965 bc_parse_push(p, BC_INST_STR);
4966 bc_parse_pushIndex(p, len);
4967 bc_vec_push(&G.prog.strs, &str);
4968 bc_parse_addFunc(p, name, &idx);
4970 RETURN_STATUS(zbc_lex_next(&p->l));
4972 #if ERRORS_ARE_FATAL
4973 # define zdc_parse_string(...) (zdc_parse_string(__VA_ARGS__), BC_STATUS_SUCCESS)
4976 static BC_STATUS zdc_parse_mem(BcParse *p, uint8_t inst, bool name, bool store)
4980 bc_parse_push(p, inst);
4982 s = zdc_parse_register(p);
4983 if (s) RETURN_STATUS(s);
4987 bc_parse_push(p, BC_INST_SWAP);
4988 bc_parse_push(p, BC_INST_ASSIGN);
4989 bc_parse_push(p, BC_INST_POP);
4992 RETURN_STATUS(zbc_lex_next(&p->l));
4994 #if ERRORS_ARE_FATAL
4995 # define zdc_parse_mem(...) (zdc_parse_mem(__VA_ARGS__), BC_STATUS_SUCCESS)
4998 static BC_STATUS zdc_parse_cond(BcParse *p, uint8_t inst)
5002 bc_parse_push(p, inst);
5003 bc_parse_push(p, BC_INST_EXEC_COND);
5005 s = zdc_parse_register(p);
5006 if (s) RETURN_STATUS(s);
5008 s = zbc_lex_next(&p->l);
5009 if (s) RETURN_STATUS(s);
5011 if (p->l.t.t == BC_LEX_ELSE) {
5012 s = zdc_parse_register(p);
5013 if (s) RETURN_STATUS(s);
5014 s = zbc_lex_next(&p->l);
5017 bc_parse_push(p, BC_PARSE_STREND);
5021 #if ERRORS_ARE_FATAL
5022 # define zdc_parse_cond(...) (zdc_parse_cond(__VA_ARGS__), BC_STATUS_SUCCESS)
5025 static BC_STATUS zdc_parse_token(BcParse *p, BcLexType t, uint8_t flags)
5027 BcStatus s = BC_STATUS_SUCCESS;
5030 bool assign, get_token = false;
5033 case BC_LEX_OP_REL_EQ:
5034 case BC_LEX_OP_REL_LE:
5035 case BC_LEX_OP_REL_GE:
5036 case BC_LEX_OP_REL_NE:
5037 case BC_LEX_OP_REL_LT:
5038 case BC_LEX_OP_REL_GT:
5039 s = zdc_parse_cond(p, t - BC_LEX_OP_REL_EQ + BC_INST_REL_EQ);
5043 s = zdc_parse_mem(p, BC_INST_ARRAY_ELEM, true, t == BC_LEX_COLON);
5046 s = zdc_parse_string(p);
5050 if (t == BC_LEX_NEG) {
5051 s = zbc_lex_next(&p->l);
5052 if (s) RETURN_STATUS(s);
5053 if (p->l.t.t != BC_LEX_NUMBER)
5054 RETURN_STATUS(bc_error_bad_token());
5056 bc_parse_number(p, &prev, &p->nbraces);
5057 if (t == BC_LEX_NEG) bc_parse_push(p, BC_INST_NEG);
5060 case BC_LEX_KEY_READ:
5061 if (flags & BC_PARSE_NOREAD)
5062 s = bc_error_nested_read_call();
5064 bc_parse_push(p, BC_INST_READ);
5067 case BC_LEX_OP_ASSIGN:
5068 case BC_LEX_STORE_PUSH:
5069 assign = t == BC_LEX_OP_ASSIGN;
5070 inst = assign ? BC_INST_VAR : BC_INST_PUSH_TO_VAR;
5071 s = zdc_parse_mem(p, inst, true, assign);
5074 case BC_LEX_LOAD_POP:
5075 inst = t == BC_LEX_LOAD_POP ? BC_INST_PUSH_VAR : BC_INST_LOAD;
5076 s = zdc_parse_mem(p, inst, true, false);
5078 case BC_LEX_STORE_IBASE:
5079 case BC_LEX_STORE_SCALE:
5080 case BC_LEX_STORE_OBASE:
5081 inst = t - BC_LEX_STORE_IBASE + BC_INST_IBASE;
5082 s = zdc_parse_mem(p, inst, false, true);
5085 s = bc_error_bad_token();
5090 if (!s && get_token) s = zbc_lex_next(&p->l);
5094 #if ERRORS_ARE_FATAL
5095 # define zdc_parse_token(...) (zdc_parse_token(__VA_ARGS__), BC_STATUS_SUCCESS)
5098 static BC_STATUS zdc_parse_expr(BcParse *p, uint8_t flags)
5100 BcStatus s = BC_STATUS_SUCCESS;
5104 if (flags & BC_PARSE_NOCALL) p->nbraces = G.prog.results.len;
5106 for (t = p->l.t.t; !s && t != BC_LEX_EOF; t = p->l.t.t) {
5107 inst = dc_parse_insts[t];
5109 if (inst != BC_INST_INVALID) {
5110 bc_parse_push(p, inst);
5111 s = zbc_lex_next(&p->l);
5113 s = zdc_parse_token(p, t, flags);
5116 if (!s && p->l.t.t == BC_LEX_EOF && (flags & BC_PARSE_NOCALL))
5117 bc_parse_push(p, BC_INST_POP_EXEC);
5121 #if ERRORS_ARE_FATAL
5122 # define zdc_parse_expr(...) (zdc_parse_expr(__VA_ARGS__), BC_STATUS_SUCCESS)
5125 static BC_STATUS zdc_parse_parse(BcParse *p)
5129 if (p->l.t.t == BC_LEX_EOF)
5130 s = bc_error("end of file");
5132 s = zdc_parse_expr(p, 0);
5134 if (s || G_interrupt) {
5136 s = BC_STATUS_FAILURE;
5141 #if ERRORS_ARE_FATAL
5142 # define zdc_parse_parse(...) (zdc_parse_parse(__VA_ARGS__), BC_STATUS_SUCCESS)
5147 static BC_STATUS zcommon_parse_expr(BcParse *p, uint8_t flags)
5150 IF_BC(RETURN_STATUS(zbc_parse_expression(p, flags));)
5152 IF_DC(RETURN_STATUS(zdc_parse_expr(p, flags));)
5155 #if ERRORS_ARE_FATAL
5156 # define zcommon_parse_expr(...) (zcommon_parse_expr(__VA_ARGS__), BC_STATUS_SUCCESS)
5159 static BcVec* bc_program_search(char *id, bool var)
5167 v = var ? &G.prog.vars : &G.prog.arrs;
5168 map = var ? &G.prog.var_map : &G.prog.arr_map;
5172 new = bc_map_insert(map, &e, &i); // 1 if insertion was successful
5175 bc_array_init(&data.v, var);
5176 bc_vec_push(v, &data.v);
5179 ptr = bc_vec_item(map, i);
5180 if (new) ptr->name = xstrdup(e.name);
5181 return bc_vec_item(v, ptr->idx);
5184 static BC_STATUS zbc_program_num(BcResult *r, BcNum **num, bool hex)
5189 case BC_RESULT_TEMP:
5190 case BC_RESULT_IBASE:
5191 case BC_RESULT_SCALE:
5192 case BC_RESULT_OBASE:
5198 case BC_RESULT_CONSTANT:
5201 char **str = bc_vec_item(&G.prog.consts, r->d.id.idx);
5202 size_t base_t, len = strlen(*str);
5205 bc_num_init(&r->d.n, len);
5207 hex = hex && len == 1;
5208 base = hex ? &G.prog.hexb : &G.prog.ib;
5209 base_t = hex ? BC_NUM_MAX_IBASE : G.prog.ib_t;
5210 s = zbc_num_parse(&r->d.n, *str, base, base_t);
5213 bc_num_free(&r->d.n);
5218 r->t = BC_RESULT_TEMP;
5224 case BC_RESULT_ARRAY:
5225 case BC_RESULT_ARRAY_ELEM:
5229 v = bc_program_search(r->d.id.name, r->t == BC_RESULT_VAR);
5231 if (r->t == BC_RESULT_ARRAY_ELEM) {
5233 if (v->len <= r->d.id.idx) bc_array_expand(v, r->d.id.idx + 1);
5234 *num = bc_vec_item(v, r->d.id.idx);
5237 *num = bc_vec_top(v);
5242 case BC_RESULT_LAST:
5244 *num = &G.prog.last;
5255 RETURN_STATUS(BC_STATUS_SUCCESS);
5257 #if ERRORS_ARE_FATAL
5258 # define zbc_program_num(...) (zbc_program_num(__VA_ARGS__), BC_STATUS_SUCCESS)
5261 static BC_STATUS zbc_program_binOpPrep(BcResult **l, BcNum **ln,
5262 BcResult **r, BcNum **rn, bool assign)
5266 BcResultType lt, rt;
5268 if (!BC_PROG_STACK(&G.prog.results, 2))
5269 RETURN_STATUS(bc_error_stack_has_too_few_elements());
5271 *r = bc_vec_item_rev(&G.prog.results, 0);
5272 *l = bc_vec_item_rev(&G.prog.results, 1);
5276 hex = assign && (lt == BC_RESULT_IBASE || lt == BC_RESULT_OBASE);
5278 s = zbc_program_num(*l, ln, false);
5279 if (s) RETURN_STATUS(s);
5280 s = zbc_program_num(*r, rn, hex);
5281 if (s) RETURN_STATUS(s);
5283 // We run this again under these conditions in case any vector has been
5284 // reallocated out from under the BcNums or arrays we had.
5285 if (lt == rt && (lt == BC_RESULT_VAR || lt == BC_RESULT_ARRAY_ELEM)) {
5286 s = zbc_program_num(*l, ln, false);
5287 if (s) RETURN_STATUS(s);
5290 if (!BC_PROG_NUM((*l), (*ln)) && (!assign || (*l)->t != BC_RESULT_VAR))
5291 RETURN_STATUS(bc_error_variable_is_wrong_type());
5292 if (!assign && !BC_PROG_NUM((*r), (*ln)))
5293 RETURN_STATUS(bc_error_variable_is_wrong_type());
5297 #if ERRORS_ARE_FATAL
5298 # define zbc_program_binOpPrep(...) (zbc_program_binOpPrep(__VA_ARGS__), BC_STATUS_SUCCESS)
5301 static void bc_program_binOpRetire(BcResult *r)
5303 r->t = BC_RESULT_TEMP;
5304 bc_vec_pop(&G.prog.results);
5305 bc_vec_pop(&G.prog.results);
5306 bc_vec_push(&G.prog.results, r);
5309 static BC_STATUS zbc_program_prep(BcResult **r, BcNum **n)
5313 if (!BC_PROG_STACK(&G.prog.results, 1))
5314 RETURN_STATUS(bc_error_stack_has_too_few_elements());
5315 *r = bc_vec_top(&G.prog.results);
5317 s = zbc_program_num(*r, n, false);
5318 if (s) RETURN_STATUS(s);
5320 if (!BC_PROG_NUM((*r), (*n)))
5321 RETURN_STATUS(bc_error_variable_is_wrong_type());
5325 #if ERRORS_ARE_FATAL
5326 # define zbc_program_prep(...) (zbc_program_prep(__VA_ARGS__), BC_STATUS_SUCCESS)
5329 static void bc_program_retire(BcResult *r, BcResultType t)
5332 bc_vec_pop(&G.prog.results);
5333 bc_vec_push(&G.prog.results, r);
5336 static BC_STATUS zbc_program_op(char inst)
5339 BcResult *opd1, *opd2, res;
5340 BcNum *n1, *n2 = NULL;
5342 s = zbc_program_binOpPrep(&opd1, &n1, &opd2, &n2, false);
5343 if (s) RETURN_STATUS(s);
5344 bc_num_init_DEF_SIZE(&res.d.n);
5346 s = BC_STATUS_SUCCESS;
5347 ERROR_RETURN(s =) zbc_program_ops[inst - BC_INST_POWER](n1, n2, &res.d.n, G.prog.scale);
5349 bc_program_binOpRetire(&res);
5354 bc_num_free(&res.d.n);
5357 #if ERRORS_ARE_FATAL
5358 # define zbc_program_op(...) (zbc_program_op(__VA_ARGS__), BC_STATUS_SUCCESS)
5361 static BC_STATUS zbc_program_read(void)
5363 const char *sv_file;
5371 RETURN_STATUS(bc_error_nested_read_call());
5373 f = bc_program_func(BC_PROG_READ);
5374 bc_vec_pop_all(&f->code);
5376 sv_file = G.prog.file;
5380 bc_char_vec_init(&buf);
5383 bc_parse_create(&parse, BC_PROG_READ);
5384 bc_lex_file(&parse.l);
5386 s = zbc_parse_text(&parse, buf.v);
5387 if (s) goto exec_err;
5388 s = zcommon_parse_expr(&parse, BC_PARSE_NOREAD);
5389 if (s) goto exec_err;
5391 if (parse.l.t.t != BC_LEX_NLINE && parse.l.t.t != BC_LEX_EOF) {
5392 s = bc_error("bad read() expression");
5396 ip.func = BC_PROG_READ;
5398 ip.len = G.prog.results.len;
5400 // Update this pointer, just in case.
5401 f = bc_program_func(BC_PROG_READ);
5403 bc_vec_pushByte(&f->code, BC_INST_POP_EXEC);
5404 bc_vec_push(&G.prog.stack, &ip);
5407 bc_parse_free(&parse);
5410 G.prog.file = sv_file;
5414 #if ERRORS_ARE_FATAL
5415 # define zbc_program_read(...) (zbc_program_read(__VA_ARGS__), BC_STATUS_SUCCESS)
5418 static size_t bc_program_index(char *code, size_t *bgn)
5420 char amt = code[(*bgn)++], i = 0;
5423 for (; i < amt; ++i, ++(*bgn))
5424 res |= (((size_t)((int) code[*bgn]) & UCHAR_MAX) << (i * CHAR_BIT));
5429 static char *bc_program_name(char *code, size_t *bgn)
5432 char c, *s, *str = code + *bgn, *ptr = strchr(str, BC_PARSE_STREND);
5434 s = xmalloc(ptr - str + 1);
5437 for (i = 0; c != 0 && c != BC_PARSE_STREND; c = code[(*bgn)++], ++i)
5445 static void bc_program_printString(const char *str)
5449 // Example: echo '[]ap' | dc
5450 // should print two bytes: 0x00, 0x0A
5457 if (c != '\\' || !*str)
5477 G.prog.nchars = SIZE_MAX;
5489 // Just print the backslash and following character.
5500 static void bc_num_printNewline(void)
5502 if (G.prog.nchars == G.prog.len - 1) {
5510 static FAST_FUNC void bc_num_printChar(size_t num, size_t width, bool radix)
5513 bb_putchar((char) num);
5514 G.prog.nchars += width;
5518 static FAST_FUNC void bc_num_printDigits(size_t num, size_t width, bool radix)
5522 bc_num_printNewline();
5523 bb_putchar(radix ? '.' : ' ');
5526 bc_num_printNewline();
5527 for (exp = 0, pow = 1; exp < width - 1; ++exp, pow *= 10)
5530 for (exp = 0; exp < width; pow /= 10, ++G.prog.nchars, ++exp) {
5532 bc_num_printNewline();
5535 bb_putchar(((char) dig) + '0');
5539 static FAST_FUNC void bc_num_printHex(size_t num, size_t width, bool radix)
5542 bc_num_printNewline();
5547 bc_num_printNewline();
5548 bb_putchar(bb_hexdigits_upcase[num]);
5549 G.prog.nchars += width;
5552 static void bc_num_printDecimal(BcNum *n)
5554 size_t i, rdx = n->rdx - 1;
5556 if (n->neg) bb_putchar('-');
5557 G.prog.nchars += n->neg;
5559 for (i = n->len - 1; i < n->len; --i)
5560 bc_num_printHex((size_t) n->num[i], 1, i == rdx);
5563 static BC_STATUS zbc_num_printNum(BcNum *n, BcNum *base, size_t width, BcNumDigitOp print)
5567 BcNum intp, fracp, digit, frac_len;
5568 unsigned long dig, *ptr;
5573 print(0, width, false);
5574 RETURN_STATUS(BC_STATUS_SUCCESS);
5577 bc_vec_init(&stack, sizeof(long), NULL);
5578 bc_num_init(&intp, n->len);
5579 bc_num_init(&fracp, n->rdx);
5580 bc_num_init(&digit, width);
5581 bc_num_init(&frac_len, BC_NUM_INT(n));
5582 bc_num_copy(&intp, n);
5583 bc_num_one(&frac_len);
5585 bc_num_truncate(&intp, intp.rdx);
5586 s = zbc_num_sub(n, &intp, &fracp, 0);
5589 while (intp.len != 0) {
5590 s = zbc_num_divmod(&intp, base, &intp, &digit, 0);
5592 s = zbc_num_ulong(&digit, &dig);
5594 bc_vec_push(&stack, &dig);
5597 for (i = 0; i < stack.len; ++i) {
5598 ptr = bc_vec_item_rev(&stack, i);
5599 print(*ptr, width, false);
5602 if (!n->rdx) goto err;
5604 for (radix = true; frac_len.len <= n->rdx; radix = false) {
5605 s = zbc_num_mul(&fracp, base, &fracp, n->rdx);
5607 s = zbc_num_ulong(&fracp, &dig);
5609 bc_num_ulong2num(&intp, dig);
5610 s = zbc_num_sub(&fracp, &intp, &fracp, 0);
5612 print(dig, width, radix);
5613 s = zbc_num_mul(&frac_len, base, &frac_len, 0);
5618 bc_num_free(&frac_len);
5619 bc_num_free(&digit);
5620 bc_num_free(&fracp);
5622 bc_vec_free(&stack);
5625 #if ERRORS_ARE_FATAL
5626 # define zbc_num_printNum(...) (zbc_num_printNum(__VA_ARGS__), BC_STATUS_SUCCESS)
5629 static BC_STATUS zbc_num_printBase(BcNum *n)
5643 if (G.prog.ob_t <= BC_NUM_MAX_IBASE) {
5645 print = bc_num_printHex;
5648 for (i = G.prog.ob_t - 1, width = 0; i != 0; i /= 10, ++width)
5650 print = bc_num_printDigits;
5653 s = zbc_num_printNum(n, &G.prog.ob, width, print);
5658 #if ERRORS_ARE_FATAL
5659 # define zbc_num_printBase(...) (zbc_num_printBase(__VA_ARGS__), BC_STATUS_SUCCESS)
5663 static BC_STATUS zbc_num_stream(BcNum *n, BcNum *base)
5665 RETURN_STATUS(zbc_num_printNum(n, base, 1, bc_num_printChar));
5667 #if ERRORS_ARE_FATAL
5668 # define zbc_num_stream(...) (zbc_num_stream(__VA_ARGS__), BC_STATUS_SUCCESS)
5672 static BC_STATUS zbc_num_print(BcNum *n, bool newline)
5674 BcStatus s = BC_STATUS_SUCCESS;
5676 bc_num_printNewline();
5682 else if (G.prog.ob_t == 10)
5683 bc_num_printDecimal(n);
5685 s = zbc_num_printBase(n);
5694 #if ERRORS_ARE_FATAL
5695 # define zbc_num_print(...) (zbc_num_print(__VA_ARGS__), BC_STATUS_SUCCESS)
5698 static BC_STATUS zbc_program_print(char inst, size_t idx)
5703 bool pop = inst != BC_INST_PRINT;
5705 if (!BC_PROG_STACK(&G.prog.results, idx + 1))
5706 RETURN_STATUS(bc_error_stack_has_too_few_elements());
5708 r = bc_vec_item_rev(&G.prog.results, idx);
5709 num = NULL; // is this NULL necessary?
5710 s = zbc_program_num(r, &num, false);
5711 if (s) RETURN_STATUS(s);
5713 if (BC_PROG_NUM(r, num)) {
5714 s = zbc_num_print(num, !pop);
5715 if (!s) bc_num_copy(&G.prog.last, num);
5720 idx = (r->t == BC_RESULT_STR) ? r->d.id.idx : num->rdx;
5721 str = *bc_program_str(idx);
5723 if (inst == BC_INST_PRINT_STR) {
5726 if (c == '\0') break;
5729 if (c == '\n') G.prog.nchars = 0;
5733 bc_program_printString(str);
5734 if (inst == BC_INST_PRINT) bb_putchar('\n');
5738 if (!s && pop) bc_vec_pop(&G.prog.results);
5742 #if ERRORS_ARE_FATAL
5743 # define zbc_program_print(...) (zbc_program_print(__VA_ARGS__), BC_STATUS_SUCCESS)
5746 static BC_STATUS zbc_program_negate(void)
5752 s = zbc_program_prep(&ptr, &num);
5753 if (s) RETURN_STATUS(s);
5755 bc_num_init(&res.d.n, num->len);
5756 bc_num_copy(&res.d.n, num);
5757 if (res.d.n.len) res.d.n.neg = !res.d.n.neg;
5759 bc_program_retire(&res, BC_RESULT_TEMP);
5763 #if ERRORS_ARE_FATAL
5764 # define zbc_program_negate(...) (zbc_program_negate(__VA_ARGS__), BC_STATUS_SUCCESS)
5767 static BC_STATUS zbc_program_logical(char inst)
5770 BcResult *opd1, *opd2, res;
5774 s = zbc_program_binOpPrep(&opd1, &n1, &opd2, &n2, false);
5775 if (s) RETURN_STATUS(s);
5777 bc_num_init_DEF_SIZE(&res.d.n);
5779 if (inst == BC_INST_BOOL_AND)
5780 cond = bc_num_cmp(n1, &G.prog.zero) && bc_num_cmp(n2, &G.prog.zero);
5781 else if (inst == BC_INST_BOOL_OR)
5782 cond = bc_num_cmp(n1, &G.prog.zero) || bc_num_cmp(n2, &G.prog.zero);
5784 cond = bc_num_cmp(n1, n2);
5786 case BC_INST_REL_EQ:
5789 case BC_INST_REL_LE:
5792 case BC_INST_REL_GE:
5795 case BC_INST_REL_LT:
5798 case BC_INST_REL_GT:
5801 default: // = case BC_INST_REL_NE:
5802 //cond = (cond != 0); - not needed
5807 if (cond) bc_num_one(&res.d.n);
5808 //else bc_num_zero(&res.d.n); - already is
5810 bc_program_binOpRetire(&res);
5814 #if ERRORS_ARE_FATAL
5815 # define zbc_program_logical(...) (zbc_program_logical(__VA_ARGS__), BC_STATUS_SUCCESS)
5819 static BC_STATUS zbc_program_assignStr(BcResult *r, BcVec *v,
5825 memset(&n2, 0, sizeof(BcNum));
5826 n2.rdx = res.d.id.idx = r->d.id.idx;
5827 res.t = BC_RESULT_STR;
5830 if (!BC_PROG_STACK(&G.prog.results, 2))
5831 RETURN_STATUS(bc_error_stack_has_too_few_elements());
5833 bc_vec_pop(&G.prog.results);
5836 bc_vec_pop(&G.prog.results);
5838 bc_vec_push(&G.prog.results, &res);
5839 bc_vec_push(v, &n2);
5841 RETURN_STATUS(BC_STATUS_SUCCESS);
5843 #if ERRORS_ARE_FATAL
5844 # define zbc_program_assignStr(...) (zbc_program_assignStr(__VA_ARGS__), BC_STATUS_SUCCESS)
5848 static BC_STATUS zbc_program_copyToVar(char *name, bool var)
5855 if (!BC_PROG_STACK(&G.prog.results, 1))
5856 RETURN_STATUS(bc_error_stack_has_too_few_elements());
5858 ptr = bc_vec_top(&G.prog.results);
5859 if ((ptr->t == BC_RESULT_ARRAY) != !var)
5860 RETURN_STATUS(bc_error_variable_is_wrong_type());
5861 v = bc_program_search(name, var);
5864 if (ptr->t == BC_RESULT_STR && !var)
5865 RETURN_STATUS(bc_error_variable_is_wrong_type());
5866 if (ptr->t == BC_RESULT_STR)
5867 RETURN_STATUS(zbc_program_assignStr(ptr, v, true));
5870 s = zbc_program_num(ptr, &n, false);
5871 if (s) RETURN_STATUS(s);
5873 // Do this once more to make sure that pointers were not invalidated.
5874 v = bc_program_search(name, var);
5877 bc_num_init_DEF_SIZE(&r.d.n);
5878 bc_num_copy(&r.d.n, n);
5881 bc_array_init(&r.d.v, true);
5882 bc_array_copy(&r.d.v, (BcVec *) n);
5885 bc_vec_push(v, &r.d);
5886 bc_vec_pop(&G.prog.results);
5890 #if ERRORS_ARE_FATAL
5891 # define zbc_program_copyToVar(...) (zbc_program_copyToVar(__VA_ARGS__), BC_STATUS_SUCCESS)
5894 static BC_STATUS zbc_program_assign(char inst)
5897 BcResult *left, *right, res;
5898 BcNum *l = NULL, *r = NULL;
5899 bool assign = inst == BC_INST_ASSIGN, ib, sc;
5901 s = zbc_program_binOpPrep(&left, &l, &right, &r, assign);
5902 if (s) RETURN_STATUS(s);
5904 ib = left->t == BC_RESULT_IBASE;
5905 sc = left->t == BC_RESULT_SCALE;
5909 if (right->t == BC_RESULT_STR) {
5913 if (left->t != BC_RESULT_VAR)
5914 RETURN_STATUS(bc_error_variable_is_wrong_type());
5915 v = bc_program_search(left->d.id.name, true);
5917 RETURN_STATUS(zbc_program_assignStr(right, v, false));
5921 if (left->t == BC_RESULT_CONSTANT || left->t == BC_RESULT_TEMP)
5922 RETURN_STATUS(bc_error("bad assignment:"
5923 " left side must be scale,"
5924 " ibase, obase, last, var,"
5929 if (inst == BC_INST_ASSIGN_DIVIDE && !bc_num_cmp(r, &G.prog.zero))
5930 RETURN_STATUS(bc_error("divide by zero"));
5935 s = BC_STATUS_SUCCESS;
5936 ERROR_RETURN(s =) zbc_program_ops[inst - BC_INST_ASSIGN_POWER](l, r, l, G.prog.scale);
5938 if (s) RETURN_STATUS(s);
5943 if (ib || sc || left->t == BC_RESULT_OBASE) {
5944 static const char *const msg[] = {
5945 "bad ibase; must be [2,16]", //BC_RESULT_IBASE
5946 "bad scale; must be [0,"BC_MAX_SCALE_STR"]", //BC_RESULT_SCALE
5947 NULL, //can't happen //BC_RESULT_LAST
5948 NULL, //can't happen //BC_RESULT_CONSTANT
5949 NULL, //can't happen //BC_RESULT_ONE
5950 "bad obase; must be [2,"BC_MAX_OBASE_STR"]", //BC_RESULT_OBASE
5953 unsigned long val, max;
5955 s = zbc_num_ulong(l, &val);
5956 if (s) RETURN_STATUS(s);
5957 s = left->t - BC_RESULT_IBASE;
5960 ptr = &G.prog.scale;
5963 if (val < BC_NUM_MIN_BASE)
5964 RETURN_STATUS(bc_error(msg[s]));
5965 max = ib ? BC_NUM_MAX_IBASE : BC_MAX_OBASE;
5966 ptr = ib ? &G.prog.ib_t : &G.prog.ob_t;
5970 RETURN_STATUS(bc_error(msg[s]));
5972 bc_num_copy(ib ? &G.prog.ib : &G.prog.ob, l);
5974 *ptr = (size_t) val;
5975 s = BC_STATUS_SUCCESS;
5978 bc_num_init(&res.d.n, l->len);
5979 bc_num_copy(&res.d.n, l);
5980 bc_program_binOpRetire(&res);
5984 #if ERRORS_ARE_FATAL
5985 # define zbc_program_assign(...) (zbc_program_assign(__VA_ARGS__), BC_STATUS_SUCCESS)
5989 #define bc_program_pushVar(code, bgn, pop, copy) \
5990 bc_program_pushVar(code, bgn)
5991 // for bc, 'pop' and 'copy' are always false
5993 static BC_STATUS bc_program_pushVar(char *code, size_t *bgn,
5994 bool pop, bool copy)
5997 char *name = bc_program_name(code, bgn);
5999 r.t = BC_RESULT_VAR;
6004 BcVec *v = bc_program_search(name, true);
6005 BcNum *num = bc_vec_top(v);
6009 if (!BC_PROG_STACK(v, 2 - copy)) {
6011 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6017 if (!BC_PROG_STR(num)) {
6019 r.t = BC_RESULT_TEMP;
6021 bc_num_init_DEF_SIZE(&r.d.n);
6022 bc_num_copy(&r.d.n, num);
6025 r.t = BC_RESULT_STR;
6026 r.d.id.idx = num->rdx;
6029 if (!copy) bc_vec_pop(v);
6034 bc_vec_push(&G.prog.results, &r);
6036 RETURN_STATUS(BC_STATUS_SUCCESS);
6038 #if ERRORS_ARE_FATAL
6039 # define zbc_program_pushVar(...) (bc_program_pushVar(__VA_ARGS__), BC_STATUS_SUCCESS)
6041 # define zbc_program_pushVar(...) bc_program_pushVar(__VA_ARGS__)
6044 static BC_STATUS zbc_program_pushArray(char *code, size_t *bgn,
6047 BcStatus s = BC_STATUS_SUCCESS;
6051 r.d.id.name = bc_program_name(code, bgn);
6053 if (inst == BC_INST_ARRAY) {
6054 r.t = BC_RESULT_ARRAY;
6055 bc_vec_push(&G.prog.results, &r);
6062 s = zbc_program_prep(&operand, &num);
6064 s = zbc_num_ulong(num, &temp);
6067 if (temp > BC_MAX_DIM) {
6068 s = bc_error("array too long; must be [1,"BC_MAX_DIM_STR"]");
6072 r.d.id.idx = (size_t) temp;
6073 bc_program_retire(&r, BC_RESULT_ARRAY_ELEM);
6077 if (s) free(r.d.id.name);
6080 #if ERRORS_ARE_FATAL
6081 # define zbc_program_pushArray(...) (zbc_program_pushArray(__VA_ARGS__), BC_STATUS_SUCCESS)
6085 static BC_STATUS zbc_program_incdec(char inst)
6088 BcResult *ptr, res, copy;
6092 s = zbc_program_prep(&ptr, &num);
6093 if (s) RETURN_STATUS(s);
6095 if (inst == BC_INST_INC_POST || inst == BC_INST_DEC_POST) {
6096 copy.t = BC_RESULT_TEMP;
6097 bc_num_init(©.d.n, num->len);
6098 bc_num_copy(©.d.n, num);
6101 res.t = BC_RESULT_ONE;
6102 inst = inst == BC_INST_INC_PRE || inst == BC_INST_INC_POST ?
6103 BC_INST_ASSIGN_PLUS :
6104 BC_INST_ASSIGN_MINUS;
6106 bc_vec_push(&G.prog.results, &res);
6107 s = zbc_program_assign(inst);
6108 if (s) RETURN_STATUS(s);
6110 if (inst2 == BC_INST_INC_POST || inst2 == BC_INST_DEC_POST) {
6111 bc_vec_pop(&G.prog.results);
6112 bc_vec_push(&G.prog.results, ©);
6117 #if ERRORS_ARE_FATAL
6118 # define zbc_program_incdec(...) (zbc_program_incdec(__VA_ARGS__), BC_STATUS_SUCCESS)
6121 static BC_STATUS zbc_program_call(char *code, size_t *idx)
6124 size_t i, nparams = bc_program_index(code, idx);
6131 ip.func = bc_program_index(code, idx);
6132 func = bc_program_func(ip.func);
6134 if (func->code.len == 0) {
6135 RETURN_STATUS(bc_error("undefined function"));
6137 if (nparams != func->nparams) {
6138 RETURN_STATUS(bc_error_fmt("function has %u parameters, but called with %u", func->nparams, nparams));
6140 ip.len = G.prog.results.len - nparams;
6142 for (i = 0; i < nparams; ++i) {
6145 a = bc_vec_item(&func->autos, nparams - 1 - i);
6146 arg = bc_vec_top(&G.prog.results);
6148 if ((!a->idx) != (arg->t == BC_RESULT_ARRAY) || arg->t == BC_RESULT_STR)
6149 RETURN_STATUS(bc_error_variable_is_wrong_type());
6151 s = zbc_program_copyToVar(a->name, a->idx);
6152 if (s) RETURN_STATUS(s);
6155 for (; i < func->autos.len; ++i) {
6158 a = bc_vec_item(&func->autos, i);
6159 v = bc_program_search(a->name, a->idx);
6162 bc_num_init_DEF_SIZE(¶m.n);
6163 bc_vec_push(v, ¶m.n);
6166 bc_array_init(¶m.v, true);
6167 bc_vec_push(v, ¶m.v);
6171 bc_vec_push(&G.prog.stack, &ip);
6173 RETURN_STATUS(BC_STATUS_SUCCESS);
6175 #if ERRORS_ARE_FATAL
6176 # define zbc_program_call(...) (zbc_program_call(__VA_ARGS__), BC_STATUS_SUCCESS)
6179 static BC_STATUS zbc_program_return(char inst)
6184 BcInstPtr *ip = bc_vec_top(&G.prog.stack);
6186 if (!BC_PROG_STACK(&G.prog.results, ip->len + inst == BC_INST_RET))
6187 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6189 f = bc_program_func(ip->func);
6190 res.t = BC_RESULT_TEMP;
6192 if (inst == BC_INST_RET) {
6195 BcResult *operand = bc_vec_top(&G.prog.results);
6197 s = zbc_program_num(operand, &num, false);
6198 if (s) RETURN_STATUS(s);
6199 bc_num_init(&res.d.n, num->len);
6200 bc_num_copy(&res.d.n, num);
6203 bc_num_init_DEF_SIZE(&res.d.n);
6204 //bc_num_zero(&res.d.n); - already is
6207 // We need to pop arguments as well, so this takes that into account.
6208 for (i = 0; i < f->autos.len; ++i) {
6210 BcId *a = bc_vec_item(&f->autos, i);
6212 v = bc_program_search(a->name, a->idx);
6216 bc_vec_npop(&G.prog.results, G.prog.results.len - ip->len);
6217 bc_vec_push(&G.prog.results, &res);
6218 bc_vec_pop(&G.prog.stack);
6220 RETURN_STATUS(BC_STATUS_SUCCESS);
6222 #if ERRORS_ARE_FATAL
6223 # define zbc_program_return(...) (zbc_program_return(__VA_ARGS__), BC_STATUS_SUCCESS)
6227 static unsigned long bc_program_scale(BcNum *n)
6229 return (unsigned long) n->rdx;
6232 static unsigned long bc_program_len(BcNum *n)
6234 size_t len = n->len;
6236 if (n->rdx != len) return len;
6238 if (len == 0) break;
6240 if (n->num[len] != 0) break;
6245 static BC_STATUS zbc_program_builtin(char inst)
6251 bool len = inst == BC_INST_LENGTH;
6253 if (!BC_PROG_STACK(&G.prog.results, 1))
6254 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6255 opnd = bc_vec_top(&G.prog.results);
6257 s = zbc_program_num(opnd, &num, false);
6258 if (s) RETURN_STATUS(s);
6261 if (!BC_PROG_NUM(opnd, num) && !len)
6262 RETURN_STATUS(bc_error_variable_is_wrong_type());
6265 bc_num_init_DEF_SIZE(&res.d.n);
6267 if (inst == BC_INST_SQRT) s = zbc_num_sqrt(num, &res.d.n, G.prog.scale);
6269 else if (len != 0 && opnd->t == BC_RESULT_ARRAY) {
6270 bc_num_ulong2num(&res.d.n, (unsigned long) ((BcVec *) num)->len);
6274 else if (len != 0 && !BC_PROG_NUM(opnd, num)) {
6276 size_t idx = opnd->t == BC_RESULT_STR ? opnd->d.id.idx : num->rdx;
6278 str = bc_program_str(idx);
6279 bc_num_ulong2num(&res.d.n, strlen(*str));
6283 bc_num_ulong2num(&res.d.n, len ? bc_program_len(num) : bc_program_scale(num));
6286 bc_program_retire(&res, BC_RESULT_TEMP);
6290 #if ERRORS_ARE_FATAL
6291 # define zbc_program_builtin(...) (zbc_program_builtin(__VA_ARGS__), BC_STATUS_SUCCESS)
6295 static BC_STATUS zbc_program_divmod(void)
6298 BcResult *opd1, *opd2, res, res2;
6299 BcNum *n1, *n2 = NULL;
6301 s = zbc_program_binOpPrep(&opd1, &n1, &opd2, &n2, false);
6302 if (s) RETURN_STATUS(s);
6304 bc_num_init_DEF_SIZE(&res.d.n);
6305 bc_num_init(&res2.d.n, n2->len);
6307 s = zbc_num_divmod(n1, n2, &res2.d.n, &res.d.n, G.prog.scale);
6310 bc_program_binOpRetire(&res2);
6311 res.t = BC_RESULT_TEMP;
6312 bc_vec_push(&G.prog.results, &res);
6317 bc_num_free(&res2.d.n);
6318 bc_num_free(&res.d.n);
6321 #if ERRORS_ARE_FATAL
6322 # define zbc_program_divmod(...) (zbc_program_divmod(__VA_ARGS__), BC_STATUS_SUCCESS)
6325 static BC_STATUS zbc_program_modexp(void)
6328 BcResult *r1, *r2, *r3, res;
6329 BcNum *n1, *n2, *n3;
6331 if (!BC_PROG_STACK(&G.prog.results, 3))
6332 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6333 s = zbc_program_binOpPrep(&r2, &n2, &r3, &n3, false);
6334 if (s) RETURN_STATUS(s);
6336 r1 = bc_vec_item_rev(&G.prog.results, 2);
6337 s = zbc_program_num(r1, &n1, false);
6338 if (s) RETURN_STATUS(s);
6339 if (!BC_PROG_NUM(r1, n1))
6340 RETURN_STATUS(bc_error_variable_is_wrong_type());
6342 // Make sure that the values have their pointers updated, if necessary.
6343 if (r1->t == BC_RESULT_VAR || r1->t == BC_RESULT_ARRAY_ELEM) {
6345 if (r1->t == r2->t) {
6346 s = zbc_program_num(r2, &n2, false);
6347 if (s) RETURN_STATUS(s);
6350 if (r1->t == r3->t) {
6351 s = zbc_program_num(r3, &n3, false);
6352 if (s) RETURN_STATUS(s);
6356 bc_num_init(&res.d.n, n3->len);
6357 s = zbc_num_modexp(n1, n2, n3, &res.d.n);
6360 bc_vec_pop(&G.prog.results);
6361 bc_program_binOpRetire(&res);
6366 bc_num_free(&res.d.n);
6369 #if ERRORS_ARE_FATAL
6370 # define zbc_program_modexp(...) (zbc_program_modexp(__VA_ARGS__), BC_STATUS_SUCCESS)
6373 static void bc_program_stackLen(void)
6376 size_t len = G.prog.results.len;
6378 res.t = BC_RESULT_TEMP;
6380 bc_num_init_DEF_SIZE(&res.d.n);
6381 bc_num_ulong2num(&res.d.n, len);
6382 bc_vec_push(&G.prog.results, &res);
6385 static BC_STATUS zbc_program_asciify(void)
6390 char *str, *str2, c;
6391 size_t len = G.prog.strs.len, idx;
6394 if (!BC_PROG_STACK(&G.prog.results, 1))
6395 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6396 r = bc_vec_top(&G.prog.results);
6398 num = NULL; // TODO: is this NULL needed?
6399 s = zbc_program_num(r, &num, false);
6400 if (s) RETURN_STATUS(s);
6402 if (BC_PROG_NUM(r, num)) {
6404 bc_num_init_DEF_SIZE(&n);
6405 bc_num_copy(&n, num);
6406 bc_num_truncate(&n, n.rdx);
6408 s = zbc_num_mod(&n, &G.prog.strmb, &n, 0);
6409 if (s) goto num_err;
6410 s = zbc_num_ulong(&n, &val);
6411 if (s) goto num_err;
6418 idx = (r->t == BC_RESULT_STR) ? r->d.id.idx : num->rdx;
6419 str2 = *bc_program_str(idx);
6425 //str[1] = '\0'; - already is
6427 str2 = xstrdup(str);
6428 bc_program_addFunc(str2, &idx);
6430 if (idx != len + BC_PROG_REQ_FUNCS) {
6431 for (idx = 0; idx < G.prog.strs.len; ++idx) {
6432 if (strcmp(*bc_program_str(idx), str) == 0) {
6441 bc_vec_push(&G.prog.strs, &str);
6443 res.t = BC_RESULT_STR;
6445 bc_vec_pop(&G.prog.results);
6446 bc_vec_push(&G.prog.results, &res);
6448 RETURN_STATUS(BC_STATUS_SUCCESS);
6454 #if ERRORS_ARE_FATAL
6455 # define zbc_program_asciify(...) (zbc_program_asciify(__VA_ARGS__), BC_STATUS_SUCCESS)
6458 static BC_STATUS zbc_program_printStream(void)
6466 if (!BC_PROG_STACK(&G.prog.results, 1))
6467 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6468 r = bc_vec_top(&G.prog.results);
6470 s = zbc_program_num(r, &n, false);
6471 if (s) RETURN_STATUS(s);
6473 if (BC_PROG_NUM(r, n))
6474 s = zbc_num_stream(n, &G.prog.strmb);
6476 idx = (r->t == BC_RESULT_STR) ? r->d.id.idx : n->rdx;
6477 str = *bc_program_str(idx);
6483 #if ERRORS_ARE_FATAL
6484 # define zbc_program_printStream(...) (zbc_program_printStream(__VA_ARGS__), BC_STATUS_SUCCESS)
6487 static BC_STATUS zbc_program_nquit(void)
6494 s = zbc_program_prep(&opnd, &num);
6495 if (s) RETURN_STATUS(s);
6496 s = zbc_num_ulong(num, &val);
6497 if (s) RETURN_STATUS(s);
6499 bc_vec_pop(&G.prog.results);
6501 if (G.prog.stack.len < val)
6502 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6503 if (G.prog.stack.len == val) {
6504 QUIT_OR_RETURN_TO_MAIN;
6507 bc_vec_npop(&G.prog.stack, val);
6511 #if ERRORS_ARE_FATAL
6512 # define zbc_program_nquit(...) (zbc_program_nquit(__VA_ARGS__), BC_STATUS_SUCCESS)
6515 static BC_STATUS zbc_program_execStr(char *code, size_t *bgn,
6518 BcStatus s = BC_STATUS_SUCCESS;
6526 if (!BC_PROG_STACK(&G.prog.results, 1))
6527 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6529 r = bc_vec_top(&G.prog.results);
6532 BcNum *n = n; // for compiler
6535 char *then_name = bc_program_name(code, bgn);
6536 char *else_name = NULL;
6538 if (code[*bgn] == BC_PARSE_STREND)
6541 else_name = bc_program_name(code, bgn);
6543 exec = r->d.n.len != 0;
6545 if (!exec && else_name != NULL) {
6552 v = bc_program_search(name, true);
6559 if (!exec) goto exit;
6560 if (!BC_PROG_STR(n)) {
6561 s = bc_error_variable_is_wrong_type();
6567 if (r->t == BC_RESULT_STR) {
6569 } else if (r->t == BC_RESULT_VAR) {
6571 s = zbc_program_num(r, &n, false);
6572 if (s || !BC_PROG_STR(n)) goto exit;
6578 fidx = sidx + BC_PROG_REQ_FUNCS;
6580 str = bc_program_str(sidx);
6581 f = bc_program_func(fidx);
6583 if (f->code.len == 0) {
6584 bc_parse_create(&prs, fidx);
6585 s = zbc_parse_text(&prs, *str);
6587 s = zcommon_parse_expr(&prs, BC_PARSE_NOCALL);
6590 if (prs.l.t.t != BC_LEX_EOF) {
6591 s = bc_error_bad_expression();
6595 bc_parse_free(&prs);
6599 ip.len = G.prog.results.len;
6602 bc_vec_pop(&G.prog.results);
6603 bc_vec_push(&G.prog.stack, &ip);
6605 RETURN_STATUS(BC_STATUS_SUCCESS);
6608 bc_parse_free(&prs);
6609 f = bc_program_func(fidx);
6610 bc_vec_pop_all(&f->code);
6612 bc_vec_pop(&G.prog.results);
6615 #if ERRORS_ARE_FATAL
6616 # define zbc_program_execStr(...) (zbc_program_execStr(__VA_ARGS__), BC_STATUS_SUCCESS)
6620 static void bc_program_pushGlobal(char inst)
6625 res.t = inst - BC_INST_IBASE + BC_RESULT_IBASE;
6626 if (inst == BC_INST_IBASE)
6627 val = (unsigned long) G.prog.ib_t;
6628 else if (inst == BC_INST_SCALE)
6629 val = (unsigned long) G.prog.scale;
6631 val = (unsigned long) G.prog.ob_t;
6633 bc_num_init_DEF_SIZE(&res.d.n);
6634 bc_num_ulong2num(&res.d.n, val);
6635 bc_vec_push(&G.prog.results, &res);
6638 static void bc_program_addFunc(char *name, size_t *idx)
6640 BcId entry, *entry_ptr;
6645 entry.idx = G.prog.fns.len;
6647 inserted = bc_map_insert(&G.prog.fn_map, &entry, idx);
6648 if (!inserted) free(name);
6650 entry_ptr = bc_vec_item(&G.prog.fn_map, *idx);
6651 *idx = entry_ptr->idx;
6655 BcFunc *func = bc_program_func(entry_ptr->idx);
6657 // We need to reset these, so the function can be repopulated.
6659 bc_vec_pop_all(&func->autos);
6660 bc_vec_pop_all(&func->code);
6661 bc_vec_pop_all(&func->labels);
6665 bc_vec_push(&G.prog.fns, &f);
6669 static BC_STATUS zbc_program_exec(void)
6673 BcInstPtr *ip = bc_vec_top(&G.prog.stack);
6674 BcFunc *func = bc_program_func(ip->func);
6675 char *code = func->code.v;
6678 while (ip->idx < func->code.len) {
6679 BcStatus s = BC_STATUS_SUCCESS;
6680 char inst = code[(ip->idx)++];
6684 case BC_INST_JUMP_ZERO:
6685 s = zbc_program_prep(&ptr, &num);
6686 if (s) RETURN_STATUS(s);
6687 cond = !bc_num_cmp(num, &G.prog.zero);
6688 bc_vec_pop(&G.prog.results);
6690 case BC_INST_JUMP: {
6692 size_t idx = bc_program_index(code, &ip->idx);
6693 addr = bc_vec_item(&func->labels, idx);
6694 if (inst == BC_INST_JUMP || cond) ip->idx = *addr;
6698 s = zbc_program_call(code, &ip->idx);
6700 case BC_INST_INC_PRE:
6701 case BC_INST_DEC_PRE:
6702 case BC_INST_INC_POST:
6703 case BC_INST_DEC_POST:
6704 s = zbc_program_incdec(inst);
6707 QUIT_OR_RETURN_TO_MAIN;
6711 s = zbc_program_return(inst);
6713 case BC_INST_BOOL_OR:
6714 case BC_INST_BOOL_AND:
6716 case BC_INST_REL_EQ:
6717 case BC_INST_REL_LE:
6718 case BC_INST_REL_GE:
6719 case BC_INST_REL_NE:
6720 case BC_INST_REL_LT:
6721 case BC_INST_REL_GT:
6722 s = zbc_program_logical(inst);
6725 s = zbc_program_read();
6728 s = zbc_program_pushVar(code, &ip->idx, false, false);
6730 case BC_INST_ARRAY_ELEM:
6732 s = zbc_program_pushArray(code, &ip->idx, inst);
6735 r.t = BC_RESULT_LAST;
6736 bc_vec_push(&G.prog.results, &r);
6741 bc_program_pushGlobal(inst);
6743 case BC_INST_SCALE_FUNC:
6744 case BC_INST_LENGTH:
6746 s = zbc_program_builtin(inst);
6749 r.t = BC_RESULT_CONSTANT;
6750 r.d.id.idx = bc_program_index(code, &ip->idx);
6751 bc_vec_push(&G.prog.results, &r);
6754 if (!BC_PROG_STACK(&G.prog.results, 1))
6755 s = bc_error_stack_has_too_few_elements();
6757 bc_vec_pop(&G.prog.results);
6759 case BC_INST_POP_EXEC:
6760 bc_vec_pop(&G.prog.stack);
6763 case BC_INST_PRINT_POP:
6764 case BC_INST_PRINT_STR:
6765 s = zbc_program_print(inst, 0);
6768 r.t = BC_RESULT_STR;
6769 r.d.id.idx = bc_program_index(code, &ip->idx);
6770 bc_vec_push(&G.prog.results, &r);
6773 case BC_INST_MULTIPLY:
6774 case BC_INST_DIVIDE:
6775 case BC_INST_MODULUS:
6778 s = zbc_program_op(inst);
6780 case BC_INST_BOOL_NOT:
6781 s = zbc_program_prep(&ptr, &num);
6782 if (s) RETURN_STATUS(s);
6783 bc_num_init_DEF_SIZE(&r.d.n);
6784 if (!bc_num_cmp(num, &G.prog.zero))
6786 //else bc_num_zero(&r.d.n); - already is
6787 bc_program_retire(&r, BC_RESULT_TEMP);
6790 s = zbc_program_negate();
6793 case BC_INST_ASSIGN_POWER:
6794 case BC_INST_ASSIGN_MULTIPLY:
6795 case BC_INST_ASSIGN_DIVIDE:
6796 case BC_INST_ASSIGN_MODULUS:
6797 case BC_INST_ASSIGN_PLUS:
6798 case BC_INST_ASSIGN_MINUS:
6800 case BC_INST_ASSIGN:
6801 s = zbc_program_assign(inst);
6804 case BC_INST_MODEXP:
6805 s = zbc_program_modexp();
6807 case BC_INST_DIVMOD:
6808 s = zbc_program_divmod();
6810 case BC_INST_EXECUTE:
6811 case BC_INST_EXEC_COND:
6812 cond = inst == BC_INST_EXEC_COND;
6813 s = zbc_program_execStr(code, &ip->idx, cond);
6815 case BC_INST_PRINT_STACK: {
6817 for (idx = 0; idx < G.prog.results.len; ++idx) {
6818 s = zbc_program_print(BC_INST_PRINT, idx);
6823 case BC_INST_CLEAR_STACK:
6824 bc_vec_pop_all(&G.prog.results);
6826 case BC_INST_STACK_LEN:
6827 bc_program_stackLen();
6829 case BC_INST_DUPLICATE:
6830 if (!BC_PROG_STACK(&G.prog.results, 1))
6831 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6832 ptr = bc_vec_top(&G.prog.results);
6833 bc_result_copy(&r, ptr);
6834 bc_vec_push(&G.prog.results, &r);
6836 case BC_INST_SWAP: {
6838 if (!BC_PROG_STACK(&G.prog.results, 2))
6839 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6840 ptr = bc_vec_item_rev(&G.prog.results, 0);
6841 ptr2 = bc_vec_item_rev(&G.prog.results, 1);
6842 memcpy(&r, ptr, sizeof(BcResult));
6843 memcpy(ptr, ptr2, sizeof(BcResult));
6844 memcpy(ptr2, &r, sizeof(BcResult));
6847 case BC_INST_ASCIIFY:
6848 s = zbc_program_asciify();
6850 case BC_INST_PRINT_STREAM:
6851 s = zbc_program_printStream();
6854 case BC_INST_PUSH_VAR: {
6855 bool copy = inst == BC_INST_LOAD;
6856 s = zbc_program_pushVar(code, &ip->idx, true, copy);
6859 case BC_INST_PUSH_TO_VAR: {
6860 char *name = bc_program_name(code, &ip->idx);
6861 s = zbc_program_copyToVar(name, true);
6866 if (G.prog.stack.len <= 2)
6867 QUIT_OR_RETURN_TO_MAIN;
6868 bc_vec_npop(&G.prog.stack, 2);
6871 s = zbc_program_nquit();
6876 if (s || G_interrupt) {
6881 // If the stack has changed, pointers may be invalid.
6882 ip = bc_vec_top(&G.prog.stack);
6883 func = bc_program_func(ip->func);
6884 code = func->code.v;
6887 RETURN_STATUS(BC_STATUS_SUCCESS);
6889 #if ERRORS_ARE_FATAL
6890 # define zbc_program_exec(...) (zbc_program_exec(__VA_ARGS__), BC_STATUS_SUCCESS)
6893 static unsigned bc_vm_envLen(const char *var)
6899 len = BC_NUM_PRINT_WIDTH;
6900 if (!lenv) return len;
6902 len = bb_strtou(lenv, NULL, 10) - 1;
6903 if (errno || len < 2 || len >= INT_MAX)
6904 len = BC_NUM_PRINT_WIDTH;
6909 static BC_STATUS zbc_vm_process(const char *text)
6911 BcStatus s = zbc_parse_text(&G.prs, text);
6913 if (s) RETURN_STATUS(s);
6915 while (G.prs.l.t.t != BC_LEX_EOF) {
6916 ERROR_RETURN(s =) zcommon_parse(&G.prs);
6917 if (s) RETURN_STATUS(s);
6920 if (BC_PARSE_CAN_EXEC(&G.prs)) {
6921 s = zbc_program_exec();
6929 #if ERRORS_ARE_FATAL
6930 # define zbc_vm_process(...) (zbc_vm_process(__VA_ARGS__), BC_STATUS_SUCCESS)
6933 static BC_STATUS zbc_vm_file(const char *file)
6935 // So far bc/dc have no way to include a file from another file,
6936 // therefore we know G.prog.file == NULL on entry
6937 //const char *sv_file;
6943 data = bc_read_file(file);
6944 if (!data) RETURN_STATUS(bc_error_fmt("file '%s' is not text", file));
6946 //sv_file = G.prog.file;
6948 bc_lex_file(&G.prs.l);
6949 s = zbc_vm_process(data);
6952 main_func = bc_program_func(BC_PROG_MAIN);
6953 ip = bc_vec_item(&G.prog.stack, 0);
6955 if (main_func->code.len < ip->idx)
6956 s = bc_error_fmt("file '%s' is not executable", file);
6959 //G.prog.file = sv_file;
6964 #if ERRORS_ARE_FATAL
6965 # define zbc_vm_file(...) (zbc_vm_file(__VA_ARGS__), BC_STATUS_SUCCESS)
6968 static BC_STATUS zbc_vm_stdin(void)
6975 //G.prog.file = NULL; - already is
6976 bc_lex_file(&G.prs.l);
6978 bc_char_vec_init(&buffer);
6980 // This loop is complex because the vm tries not to send any lines that end
6981 // with a backslash to the parser. The reason for that is because the parser
6982 // treats a backslash+newline combo as whitespace, per the bc spec. In that
6983 // case, and for strings and comments, the parser will expect more stuff.
6984 s = BC_STATUS_SUCCESS;
6988 size_t prevlen = buffer.len;
6991 bc_read_line(&buffer);
6992 // No more input means EOF
6993 if (buffer.len <= prevlen + 1) // (we expect +1 for NUL byte)
6996 string = buffer.v + prevlen;
6999 if (string == buffer.v || string[-1] != '\\') {
7010 if (c == '/' && *string == '*') {
7015 if (c == '*' && *string == '/') {
7020 if (str || comment) {
7021 buffer.len--; // backstep over the trailing NUL byte
7025 // Check for backslash+newline.
7026 // we do not check that last char is '\n' -
7027 // if it is not, then it's EOF, and looping back
7028 // to bc_read_line() will detect it:
7030 if (string >= buffer.v && *string == '\\') {
7035 s = zbc_vm_process(buffer.v);
7037 if (ENABLE_FEATURE_CLEAN_UP && !G_ttyin) {
7038 // Debug config, non-interactive mode:
7039 // return all the way back to main.
7040 // Non-debug builds do not come here, they exit.
7045 bc_vec_pop_all(&buffer);
7049 s = bc_error("string end could not be found");
7052 s = bc_error("comment end could not be found");
7055 bc_vec_free(&buffer);
7058 #if ERRORS_ARE_FATAL
7059 # define zbc_vm_stdin(...) (zbc_vm_stdin(__VA_ARGS__), BC_STATUS_SUCCESS)
7063 static void bc_vm_info(void)
7065 printf("%s "BB_VER"\n"
7066 "Copyright (c) 2018 Gavin D. Howard and contributors\n"
7070 static void bc_args(char **argv)
7076 #if ENABLE_FEATURE_BC_LONG_OPTIONS
7077 opts = option_mask32 |= getopt32long(argv, "wvsqli",
7078 "warn\0" No_argument "w"
7079 "version\0" No_argument "v"
7080 "standard\0" No_argument "s"
7081 "quiet\0" No_argument "q"
7082 "mathlib\0" No_argument "l"
7083 "interactive\0" No_argument "i"
7086 opts = option_mask32 |= getopt32(argv, "wvsqli");
7088 if (getenv("POSIXLY_CORRECT"))
7089 option_mask32 |= BC_FLAG_S;
7091 if (opts & BC_FLAG_V) {
7096 for (i = optind; argv[i]; ++i)
7097 bc_vec_push(&G.files, argv + i);
7100 static void bc_vm_envArgs(void)
7104 char *env_args = getenv("BC_ENV_ARGS");
7106 if (!env_args) return;
7108 G.env_args = xstrdup(env_args);
7111 bc_vec_init(&v, sizeof(char *), NULL);
7113 while (*(buf = skip_whitespace(buf)) != '\0') {
7114 bc_vec_push(&v, &buf);
7115 buf = skip_non_whitespace(buf);
7121 // NULL terminate, and pass argv[] so that first arg is argv[1]
7122 if (sizeof(int) == sizeof(char*)) {
7123 bc_vec_push(&v, &const_int_0);
7125 static char *const nullptr = NULL;
7126 bc_vec_push(&v, &nullptr);
7128 bc_args(((char **)v.v) - 1);
7133 static const char bc_lib[] ALIGN1 = {
7136 "\n" "auto b,s,n,r,d,i,p,f,v"
7137 ////////////////"if(x<0)return(1/e(-x))" // and drop 'n' and x<0 logic below
7138 //^^^^^^^^^^^^^^^^ this would work, and is even more precise than GNU bc:
7139 //e(-.998896): GNU:.36828580434569428695
7140 // above code:.36828580434569428696
7141 // actual value:.3682858043456942869594...
7142 // but for now let's be "GNU compatible"
7151 "\n" "scale=scale(x)+1"
7161 "\n" "for(i=2;v;++i){"
7167 "\n" "while(d--)r*=r"
7170 "\n" "if(n)return(1/r)"
7174 "\n" "auto b,s,r,p,a,q,i,v"
7178 "\n" "r=(1-10^scale)/1"
7189 "\n" "while(x<=0.5){"
7193 "\n" "r=a=(x-1)/(x+1)"
7196 "\n" "for(i=3;v;i+=2){"
7207 "\n" "auto b,s,r,a,q,i"
7208 "\n" "if(x<0)return(-s(-x))"
7212 "\n" "scale=1.1*s+2"
7221 "\n" "for(i=3;a;i+=2){"
7222 "\n" "a*=q/(i*(i-1))"
7235 "\n" "x=s(2*a(1)+x)"
7241 "\n" "auto b,s,r,n,a,m,t,f,i,u"
7249 "\n" "if(scale<65){"
7250 "\n" "if(x==1)return(.7853981633974483096156608458198757210492923498437764552437361480/n)"
7251 "\n" "if(x==.2)return(.1973955598498807583700497651947902934475851037878521015176889402/n)"
7261 "\n" "x=(x-.2)/(1+.2*x)"
7266 "\n" "for(i=3;t;i+=2){"
7273 "\n" "return((m*a+r)/n)"
7275 "\n" "define j(n,x){"
7276 "\n" "auto b,s,o,a,i,v,f"
7287 "\n" "for(i=2;i<=n;++i)a*=i"
7289 "\n" "a=(x^n)/2^n/a"
7292 "\n" "scale+=length(a)-scale(a)"
7293 "\n" "for(i=1;v;++i){"
7294 "\n" "v=v*f/i/(n+i)"
7300 "\n" "return(a*r/1)"
7305 static BC_STATUS zbc_vm_exec(void)
7311 if (option_mask32 & BC_FLAG_L) {
7313 // We know that internal library is not buggy,
7314 // thus error checking is normally disabled.
7315 # define DEBUG_LIB 0
7316 bc_lex_file(&G.prs.l);
7317 s = zbc_parse_text(&G.prs, bc_lib);
7318 if (DEBUG_LIB && s) RETURN_STATUS(s);
7320 while (G.prs.l.t.t != BC_LEX_EOF) {
7321 ERROR_RETURN(s =) zcommon_parse(&G.prs);
7322 if (DEBUG_LIB && s) RETURN_STATUS(s);
7324 s = zbc_program_exec();
7325 if (DEBUG_LIB && s) RETURN_STATUS(s);
7329 s = BC_STATUS_SUCCESS;
7330 for (i = 0; !s && i < G.files.len; ++i)
7331 s = zbc_vm_file(*((char **) bc_vec_item(&G.files, i)));
7332 if (ENABLE_FEATURE_CLEAN_UP && s && !G_ttyin) {
7333 // Debug config, non-interactive mode:
7334 // return all the way back to main.
7335 // Non-debug builds do not come here, they exit.
7339 if (IS_BC || (option_mask32 & BC_FLAG_I))
7342 if (!s && !BC_PARSE_CAN_EXEC(&G.prs))
7343 s = zbc_vm_process("");
7347 #if ERRORS_ARE_FATAL
7348 # define zbc_vm_exec(...) (zbc_vm_exec(__VA_ARGS__), BC_STATUS_SUCCESS)
7351 #if ENABLE_FEATURE_CLEAN_UP
7352 static void bc_program_free(void)
7354 bc_num_free(&G.prog.ib);
7355 bc_num_free(&G.prog.ob);
7356 bc_num_free(&G.prog.hexb);
7358 bc_num_free(&G.prog.strmb);
7360 bc_vec_free(&G.prog.fns);
7361 bc_vec_free(&G.prog.fn_map);
7362 bc_vec_free(&G.prog.vars);
7363 bc_vec_free(&G.prog.var_map);
7364 bc_vec_free(&G.prog.arrs);
7365 bc_vec_free(&G.prog.arr_map);
7366 bc_vec_free(&G.prog.strs);
7367 bc_vec_free(&G.prog.consts);
7368 bc_vec_free(&G.prog.results);
7369 bc_vec_free(&G.prog.stack);
7370 bc_num_free(&G.prog.last);
7371 bc_num_free(&G.prog.zero);
7372 bc_num_free(&G.prog.one);
7375 static void bc_vm_free(void)
7377 bc_vec_free(&G.files);
7379 bc_parse_free(&G.prs);
7384 static void bc_program_init(void)
7389 // memset(&G.prog, 0, sizeof(G.prog)); - already is
7390 memset(&ip, 0, sizeof(BcInstPtr));
7392 // G.prog.nchars = G.prog.scale = 0; - already is
7393 bc_num_init_DEF_SIZE(&G.prog.ib);
7394 bc_num_ten(&G.prog.ib);
7397 bc_num_init_DEF_SIZE(&G.prog.ob);
7398 bc_num_ten(&G.prog.ob);
7401 bc_num_init_DEF_SIZE(&G.prog.hexb);
7402 bc_num_ten(&G.prog.hexb);
7403 G.prog.hexb.num[0] = 6;
7406 bc_num_init_DEF_SIZE(&G.prog.strmb);
7407 bc_num_ulong2num(&G.prog.strmb, UCHAR_MAX + 1);
7410 bc_num_init_DEF_SIZE(&G.prog.last);
7411 //bc_num_zero(&G.prog.last); - already is
7413 bc_num_init_DEF_SIZE(&G.prog.zero);
7414 //bc_num_zero(&G.prog.zero); - already is
7416 bc_num_init_DEF_SIZE(&G.prog.one);
7417 bc_num_one(&G.prog.one);
7419 bc_vec_init(&G.prog.fns, sizeof(BcFunc), bc_func_free);
7420 bc_vec_init(&G.prog.fn_map, sizeof(BcId), bc_id_free);
7422 bc_program_addFunc(xstrdup("(main)"), &idx);
7423 bc_program_addFunc(xstrdup("(read)"), &idx);
7425 bc_vec_init(&G.prog.vars, sizeof(BcVec), bc_vec_free);
7426 bc_vec_init(&G.prog.var_map, sizeof(BcId), bc_id_free);
7428 bc_vec_init(&G.prog.arrs, sizeof(BcVec), bc_vec_free);
7429 bc_vec_init(&G.prog.arr_map, sizeof(BcId), bc_id_free);
7431 bc_vec_init(&G.prog.strs, sizeof(char *), bc_string_free);
7432 bc_vec_init(&G.prog.consts, sizeof(char *), bc_string_free);
7433 bc_vec_init(&G.prog.results, sizeof(BcResult), bc_result_free);
7434 bc_vec_init(&G.prog.stack, sizeof(BcInstPtr), NULL);
7435 bc_vec_push(&G.prog.stack, &ip);
7438 static int bc_vm_init(const char *env_len)
7440 #if ENABLE_FEATURE_EDITING
7441 G.line_input_state = new_line_input_t(DO_HISTORY);
7443 G.prog.len = bc_vm_envLen(env_len);
7445 bc_vec_init(&G.files, sizeof(char *), NULL);
7446 IF_BC(if (IS_BC) bc_vm_envArgs();)
7448 bc_parse_create(&G.prs, BC_PROG_MAIN);
7450 //TODO: in GNU bc, the check is (isatty(0) && isatty(1)),
7451 //-i option unconditionally enables this regardless of isatty():
7453 #if ENABLE_FEATURE_BC_SIGNALS
7455 // With SA_RESTART, most system calls will restart
7456 // (IOW: they won't fail with EINTR).
7457 // In particular, this means ^C won't cause
7458 // stdout to get into "error state" if SIGINT hits
7459 // within write() syscall.
7461 // The downside is that ^C while tty input is taken
7462 // will only be handled after [Enter] since read()
7463 // from stdin is not interrupted by ^C either,
7464 // it restarts, thus fgetc() does not return on ^C.
7465 // (This problem manifests only if line editing is disabled)
7466 signal_SA_RESTART_empty_mask(SIGINT, record_signo);
7468 // Without SA_RESTART, this exhibits a bug:
7469 // "while (1) print 1" and try ^C-ing it.
7470 // Intermittently, instead of returning to input line,
7471 // you'll get "output error: Interrupted system call"
7473 //signal_no_SA_RESTART_empty_mask(SIGINT, record_signo);
7477 return 0; // "not a tty"
7480 static BcStatus bc_vm_run(void)
7482 BcStatus st = zbc_vm_exec();
7483 #if ENABLE_FEATURE_CLEAN_UP
7484 if (G_exiting) // it was actually "halt" or "quit"
7487 # if ENABLE_FEATURE_EDITING
7488 free_line_input_t(G.line_input_state);
7496 int bc_main(int argc, char **argv) MAIN_EXTERNALLY_VISIBLE;
7497 int bc_main(int argc UNUSED_PARAM, char **argv)
7503 is_tty = bc_vm_init("BC_LINE_LENGTH");
7507 if (is_tty && !(option_mask32 & BC_FLAG_Q))
7515 int dc_main(int argc, char **argv) MAIN_EXTERNALLY_VISIBLE;
7516 int dc_main(int argc UNUSED_PARAM, char **argv)
7522 // TODO: dc (GNU bc 1.07.1) 1.4.1 seems to use width
7523 // 1 char wider than bc from the same package.
7524 // Both default width, and xC_LINE_LENGTH=N are wider:
7525 // "DC_LINE_LENGTH=5 dc -e'123456 p'" prints:
7528 // "echo '123456' | BC_LINE_LENGTH=5 bc" prints:
7531 // Do the same, or it's a bug?
7532 bc_vm_init("DC_LINE_LENGTH");
7534 // Run -e'SCRIPT' and -fFILE in order of appearance, then handle FILEs
7535 noscript = BC_FLAG_I;
7537 int n = getopt(argc, argv, "e:f:x");
7543 n = zbc_vm_process(optarg);
7548 n = zbc_vm_file(optarg);
7552 option_mask32 |= DC_FLAG_X;
7562 bc_vec_push(&G.files, argv++);
7565 option_mask32 |= noscript; // set BC_FLAG_I if we need to interpret stdin
7571 #endif // not DC_SMALL