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
479 BC_LEX_KW_ENTRY("else" , 0), // 4
480 BC_LEX_KW_ENTRY("for" , 1), // 5
481 BC_LEX_KW_ENTRY("halt" , 0), // 6
482 BC_LEX_KW_ENTRY("ibase" , 1), // 7
484 BC_LEX_KW_ENTRY("if" , 1), // 8
485 BC_LEX_KW_ENTRY("last" , 0), // 9
486 BC_LEX_KW_ENTRY("length" , 1), // 10
487 BC_LEX_KW_ENTRY("limits" , 0), // 11
489 BC_LEX_KW_ENTRY("obase" , 1), // 12
490 BC_LEX_KW_ENTRY("print" , 0), // 13
491 BC_LEX_KW_ENTRY("quit" , 1), // 14
492 BC_LEX_KW_ENTRY("read" , 0), // 15
494 BC_LEX_KW_ENTRY("return" , 1), // 16
495 BC_LEX_KW_ENTRY("scale" , 1), // 17
496 BC_LEX_KW_ENTRY("sqrt" , 1), // 18
497 BC_LEX_KW_ENTRY("while" , 1), // 19
499 #undef BC_LEX_KW_ENTRY
527 #define bc_lex_kws_POSIX(i) ((1 << (i)) & POSIX_KWORD_MASK)
530 #if ENABLE_FEATURE_BC_SIGNALS || ENABLE_FEATURE_CLEAN_UP
531 # define BC_STATUS BcStatus
533 # define BC_STATUS void
536 typedef struct BcLex {
552 #define BC_PARSE_STREND ((char) UCHAR_MAX)
554 #define BC_PARSE_REL (1 << 0)
555 #define BC_PARSE_PRINT (1 << 1)
556 #define BC_PARSE_NOCALL (1 << 2)
557 #define BC_PARSE_NOREAD (1 << 3)
558 #define BC_PARSE_ARRAY (1 << 4)
560 #define BC_PARSE_TOP_FLAG_PTR(parse) ((uint8_t *) bc_vec_top(&(parse)->flags))
561 #define BC_PARSE_TOP_FLAG(parse) (*(BC_PARSE_TOP_FLAG_PTR(parse)))
563 #define BC_PARSE_FLAG_FUNC_INNER (1 << 0)
564 #define BC_PARSE_FUNC_INNER(parse) \
565 (BC_PARSE_TOP_FLAG(parse) & BC_PARSE_FLAG_FUNC_INNER)
567 #define BC_PARSE_FLAG_FUNC (1 << 1)
568 #define BC_PARSE_FUNC(parse) (BC_PARSE_TOP_FLAG(parse) & BC_PARSE_FLAG_FUNC)
570 #define BC_PARSE_FLAG_BODY (1 << 2)
571 #define BC_PARSE_BODY(parse) (BC_PARSE_TOP_FLAG(parse) & BC_PARSE_FLAG_BODY)
573 #define BC_PARSE_FLAG_LOOP (1 << 3)
574 #define BC_PARSE_LOOP(parse) (BC_PARSE_TOP_FLAG(parse) & BC_PARSE_FLAG_LOOP)
576 #define BC_PARSE_FLAG_LOOP_INNER (1 << 4)
577 #define BC_PARSE_LOOP_INNER(parse) \
578 (BC_PARSE_TOP_FLAG(parse) & BC_PARSE_FLAG_LOOP_INNER)
580 #define BC_PARSE_FLAG_IF (1 << 5)
581 #define BC_PARSE_IF(parse) (BC_PARSE_TOP_FLAG(parse) & BC_PARSE_FLAG_IF)
583 #define BC_PARSE_FLAG_ELSE (1 << 6)
584 #define BC_PARSE_ELSE(parse) (BC_PARSE_TOP_FLAG(parse) & BC_PARSE_FLAG_ELSE)
586 #define BC_PARSE_FLAG_IF_END (1 << 7)
587 #define BC_PARSE_IF_END(parse) (BC_PARSE_TOP_FLAG(parse) & BC_PARSE_FLAG_IF_END)
589 #define BC_PARSE_CAN_EXEC(parse) \
590 (!(BC_PARSE_TOP_FLAG(parse) & \
591 (BC_PARSE_FLAG_FUNC_INNER | BC_PARSE_FLAG_FUNC | BC_PARSE_FLAG_BODY | \
592 BC_PARSE_FLAG_LOOP | BC_PARSE_FLAG_LOOP_INNER | BC_PARSE_FLAG_IF | \
593 BC_PARSE_FLAG_ELSE | BC_PARSE_FLAG_IF_END)))
599 typedef struct BcParse {
618 typedef struct BcProgram {
659 #define BC_PROG_STACK(s, n) ((s)->len >= ((size_t) n))
661 #define BC_PROG_MAIN (0)
662 #define BC_PROG_READ (1)
664 #define BC_PROG_REQ_FUNCS (2)
667 #define BC_PROG_STR(n) (!(n)->num && !(n)->cap)
668 #define BC_PROG_NUM(r, n) \
669 ((r)->t != BC_RESULT_ARRAY && (r)->t != BC_RESULT_STR && !BC_PROG_STR(n))
671 #define BC_FLAG_W (1 << 0)
672 #define BC_FLAG_V (1 << 1)
673 #define BC_FLAG_S (1 << 2)
674 #define BC_FLAG_Q (1 << 3)
675 #define BC_FLAG_L (1 << 4)
676 #define BC_FLAG_I (1 << 5)
677 #define DC_FLAG_X (1 << 6)
679 #define BC_MAX(a, b) ((a) > (b) ? (a) : (b))
680 #define BC_MIN(a, b) ((a) < (b) ? (a) : (b))
682 #define BC_MAX_OBASE ((unsigned) 999)
683 #define BC_MAX_DIM ((unsigned) INT_MAX)
684 #define BC_MAX_SCALE ((unsigned) UINT_MAX)
685 #define BC_MAX_STRING ((unsigned) UINT_MAX - 1)
686 #define BC_MAX_NUM BC_MAX_STRING
687 // Unused apart from "limits" message. Just show a "biggish number" there.
688 //#define BC_MAX_NAME BC_MAX_STRING
689 //#define BC_MAX_EXP ((unsigned long) LONG_MAX)
690 //#define BC_MAX_VARS ((unsigned long) SIZE_MAX - 1)
691 #define BC_MAX_NAME_STR "999999999"
692 #define BC_MAX_EXP_STR "999999999"
693 #define BC_MAX_VARS_STR "999999999"
695 #define BC_MAX_OBASE_STR "999"
697 #if INT_MAX == 2147483647
698 # define BC_MAX_DIM_STR "2147483647"
699 #elif INT_MAX == 9223372036854775807
700 # define BC_MAX_DIM_STR "9223372036854775807"
702 # error Strange INT_MAX
705 #if UINT_MAX == 4294967295
706 # define BC_MAX_SCALE_STR "4294967295"
707 # define BC_MAX_STRING_STR "4294967294"
708 #elif UINT_MAX == 18446744073709551615
709 # define BC_MAX_SCALE_STR "18446744073709551615"
710 # define BC_MAX_STRING_STR "18446744073709551614"
712 # error Strange UINT_MAX
714 #define BC_MAX_NUM_STR BC_MAX_STRING_STR
717 IF_FEATURE_BC_SIGNALS(smallint ttyin;)
718 IF_FEATURE_CLEAN_UP(smallint exiting;)
726 // For error messages. Can be set to current parsed line,
727 // or [TODO] to current executing line (can be before last parsed one)
734 #if ENABLE_FEATURE_EDITING
735 line_input_t *line_input_state;
738 #define G (*ptr_to_globals)
739 #define INIT_G() do { \
740 SET_PTR_TO_GLOBALS(xzalloc(sizeof(G))); \
742 #define FREE_G() do { \
743 FREE_PTR_TO_GLOBALS(); \
745 #define G_posix (ENABLE_BC && (option_mask32 & BC_FLAG_S))
746 #define G_warn (ENABLE_BC && (option_mask32 & BC_FLAG_W))
747 #define G_exreg (ENABLE_DC && (option_mask32 & DC_FLAG_X))
748 #if ENABLE_FEATURE_BC_SIGNALS
749 # define G_interrupt bb_got_signal
750 # define G_ttyin G.ttyin
752 # define G_interrupt 0
755 #if ENABLE_FEATURE_CLEAN_UP
756 # define G_exiting G.exiting
760 #define IS_BC (ENABLE_BC && (!ENABLE_DC || applet_name[0] == 'b'))
761 #define IS_DC (ENABLE_DC && (!ENABLE_BC || applet_name[0] != 'b'))
765 // This is a bit array that corresponds to token types. An entry is
766 // true if the token is valid in an expression, false otherwise.
768 BC_PARSE_EXPRS_BITS = 0
769 + ((uint64_t)((0 << 0)+(0 << 1)+(1 << 2)+(1 << 3)+(1 << 4)+(1 << 5)+(1 << 6)+(1 << 7)) << (0*8))
770 + ((uint64_t)((1 << 0)+(1 << 1)+(1 << 2)+(1 << 3)+(1 << 4)+(1 << 5)+(1 << 6)+(1 << 7)) << (1*8))
771 + ((uint64_t)((1 << 0)+(1 << 1)+(1 << 2)+(1 << 3)+(1 << 4)+(1 << 5)+(1 << 6)+(1 << 7)) << (2*8))
772 + ((uint64_t)((1 << 0)+(1 << 1)+(1 << 2)+(0 << 3)+(0 << 4)+(1 << 5)+(1 << 6)+(0 << 7)) << (3*8))
773 + ((uint64_t)((0 << 0)+(0 << 1)+(0 << 2)+(0 << 3)+(0 << 4)+(0 << 5)+(1 << 6)+(1 << 7)) << (4*8))
774 + ((uint64_t)((0 << 0)+(0 << 1)+(0 << 2)+(0 << 3)+(0 << 4)+(0 << 5)+(0 << 6)+(1 << 7)) << (5*8))
775 + ((uint64_t)((0 << 0)+(1 << 1)+(1 << 2)+(1 << 3)+(1 << 4)+(0 << 5)+(0 << 6)+(1 << 7)) << (6*8))
776 + ((uint64_t)((0 << 0)+(1 << 1)+(1 << 2)+(0 << 3) ) << (7*8))
778 static ALWAYS_INLINE long bc_parse_exprs(unsigned i)
780 #if ULONG_MAX > 0xffffffff
781 // 64-bit version (will not work correctly for 32-bit longs!)
782 return BC_PARSE_EXPRS_BITS & (1UL << i);
785 unsigned long m = (uint32_t)BC_PARSE_EXPRS_BITS;
787 m = (uint32_t)(BC_PARSE_EXPRS_BITS >> 32);
790 return m & (1UL << i);
794 // This is an array of data for operators that correspond to token types.
795 static const uint8_t bc_parse_ops[] = {
796 #define OP(p,l) ((int)(l) * 0x10 + (p))
797 OP(0, false), OP( 0, false ), // inc dec
800 OP(3, true ), OP( 3, true ), OP( 3, true ), // pow mul div
801 OP(4, true ), OP( 4, true ), // mod + -
802 OP(6, true ), OP( 6, true ), OP( 6, true ), OP( 6, true ), OP( 6, true ), OP( 6, true ), // == <= >= != < >
804 OP(7, true ), OP( 7, true ), // or and
805 OP(5, false), OP( 5, false ), OP( 5, false ), OP( 5, false ), OP( 5, false ), // ^= *= /= %= +=
806 OP(5, false), OP( 5, false ), // -= =
809 #define bc_parse_op_PREC(i) (bc_parse_ops[i] & 0x0f)
810 #define bc_parse_op_LEFT(i) (bc_parse_ops[i] & 0x10)
812 // Byte array of up to 4 BC_LEX's, packed into 32-bit word
813 typedef uint32_t BcParseNext;
815 // These identify what tokens can come after expressions in certain cases.
817 #define BC_PARSE_NEXT4(a,b,c,d) ( (a) | ((b)<<8) | ((c)<<16) | ((((d)|0x80)<<24)) )
818 #define BC_PARSE_NEXT2(a,b) BC_PARSE_NEXT4(a,b,0xff,0xff)
819 #define BC_PARSE_NEXT1(a) BC_PARSE_NEXT4(a,0xff,0xff,0xff)
820 bc_parse_next_expr = BC_PARSE_NEXT4(BC_LEX_NLINE, BC_LEX_SCOLON, BC_LEX_RBRACE, BC_LEX_EOF),
821 bc_parse_next_param = BC_PARSE_NEXT2(BC_LEX_RPAREN, BC_LEX_COMMA),
822 bc_parse_next_print = BC_PARSE_NEXT4(BC_LEX_COMMA, BC_LEX_NLINE, BC_LEX_SCOLON, BC_LEX_EOF),
823 bc_parse_next_rel = BC_PARSE_NEXT1(BC_LEX_RPAREN),
824 bc_parse_next_elem = BC_PARSE_NEXT1(BC_LEX_RBRACKET),
825 bc_parse_next_for = BC_PARSE_NEXT1(BC_LEX_SCOLON),
826 bc_parse_next_read = BC_PARSE_NEXT2(BC_LEX_NLINE, BC_LEX_EOF),
827 #undef BC_PARSE_NEXT4
828 #undef BC_PARSE_NEXT2
829 #undef BC_PARSE_NEXT1
834 static const //BcLexType - should be this type, but narrower type saves size:
837 BC_LEX_OP_REL_EQ, BC_LEX_OP_REL_LE, BC_LEX_OP_REL_GE, BC_LEX_OP_REL_NE,
838 BC_LEX_OP_REL_LT, BC_LEX_OP_REL_GT, BC_LEX_SCOLON, BC_LEX_COLON,
839 BC_LEX_ELSE, BC_LEX_LOAD, BC_LEX_LOAD_POP, BC_LEX_OP_ASSIGN,
843 static const //BcLexType - should be this type
846 BC_LEX_OP_MODULUS, BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_LPAREN,
847 BC_LEX_INVALID, BC_LEX_OP_MULTIPLY, BC_LEX_OP_PLUS, BC_LEX_INVALID,
848 BC_LEX_OP_MINUS, BC_LEX_INVALID, BC_LEX_OP_DIVIDE,
849 BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID,
850 BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID,
851 BC_LEX_INVALID, BC_LEX_INVALID,
852 BC_LEX_COLON, BC_LEX_SCOLON, BC_LEX_OP_REL_GT, BC_LEX_OP_REL_EQ,
853 BC_LEX_OP_REL_LT, BC_LEX_KEY_READ, BC_LEX_INVALID,
854 BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID,
855 BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_EQ_NO_REG, BC_LEX_INVALID,
856 BC_LEX_KEY_IBASE, BC_LEX_INVALID, BC_LEX_KEY_SCALE, BC_LEX_LOAD_POP,
857 BC_LEX_INVALID, BC_LEX_OP_BOOL_NOT, BC_LEX_KEY_OBASE, BC_LEX_PRINT_STREAM,
858 BC_LEX_NQUIT, BC_LEX_POP, BC_LEX_STORE_PUSH, BC_LEX_INVALID, BC_LEX_INVALID,
859 BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_SCALE_FACTOR, BC_LEX_INVALID,
860 BC_LEX_KEY_LENGTH, BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID,
861 BC_LEX_OP_POWER, BC_LEX_NEG, BC_LEX_INVALID,
862 BC_LEX_ASCIIFY, BC_LEX_INVALID, BC_LEX_CLEAR_STACK, BC_LEX_DUPLICATE,
863 BC_LEX_ELSE, BC_LEX_PRINT_STACK, BC_LEX_INVALID, BC_LEX_INVALID,
864 BC_LEX_STORE_IBASE, BC_LEX_INVALID, BC_LEX_STORE_SCALE, BC_LEX_LOAD,
865 BC_LEX_INVALID, BC_LEX_PRINT_POP, BC_LEX_STORE_OBASE, BC_LEX_KEY_PRINT,
866 BC_LEX_KEY_QUIT, BC_LEX_SWAP, BC_LEX_OP_ASSIGN, BC_LEX_INVALID,
867 BC_LEX_INVALID, BC_LEX_KEY_SQRT, BC_LEX_INVALID, BC_LEX_EXECUTE,
868 BC_LEX_INVALID, BC_LEX_STACK_LEVEL,
869 BC_LEX_LBRACE, BC_LEX_OP_MODEXP, BC_LEX_INVALID, BC_LEX_OP_DIVMOD,
873 static const //BcInst - should be this type. Using signed narrow type since BC_INST_INVALID is -1
876 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID, BC_INST_REL_GE,
877 BC_INST_INVALID, BC_INST_POWER, BC_INST_MULTIPLY, BC_INST_DIVIDE,
878 BC_INST_MODULUS, BC_INST_PLUS, BC_INST_MINUS,
879 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID,
880 BC_INST_INVALID, BC_INST_INVALID,
881 BC_INST_BOOL_NOT, BC_INST_INVALID, BC_INST_INVALID,
882 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID,
883 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID,
884 BC_INST_INVALID, BC_INST_INVALID, BC_INST_REL_GT, BC_INST_INVALID,
885 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID, BC_INST_REL_GE,
886 BC_INST_INVALID, BC_INST_INVALID,
887 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID,
888 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID,
889 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID, BC_INST_IBASE,
890 BC_INST_INVALID, BC_INST_INVALID, BC_INST_LENGTH, BC_INST_INVALID,
891 BC_INST_OBASE, BC_INST_PRINT, BC_INST_QUIT, BC_INST_INVALID,
892 BC_INST_INVALID, BC_INST_SCALE, BC_INST_SQRT, BC_INST_INVALID,
893 BC_INST_REL_EQ, BC_INST_MODEXP, BC_INST_DIVMOD, BC_INST_INVALID,
894 BC_INST_INVALID, BC_INST_EXECUTE, BC_INST_PRINT_STACK, BC_INST_CLEAR_STACK,
895 BC_INST_STACK_LEN, BC_INST_DUPLICATE, BC_INST_SWAP, BC_INST_POP,
896 BC_INST_ASCIIFY, BC_INST_PRINT_STREAM, BC_INST_INVALID, BC_INST_INVALID,
897 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID,
898 BC_INST_PRINT, BC_INST_NQUIT, BC_INST_SCALE_FUNC,
902 // In configurations where errors abort instead of propagating error
903 // return code up the call chain, functions returning BC_STATUS
904 // actually don't return anything, they always succeed and return "void".
905 // A macro wrapper is provided, which makes this statement work:
907 // and makes it visible to the compiler that s is always zero,
908 // allowing compiler to optimize dead code after the statement.
910 // To make code more readable, each such function has a "z"
911 // ("always returning zero") prefix, i.e. zbc_foo or zdc_foo.
913 #if ENABLE_FEATURE_BC_SIGNALS || ENABLE_FEATURE_CLEAN_UP
914 # define ERRORS_ARE_FATAL 0
915 # define ERRORFUNC /*nothing*/
916 # define ERROR_RETURN(a) a
917 //moved up: # define BC_STATUS BcStatus
918 # define RETURN_STATUS(v) return (v)
920 # define ERRORS_ARE_FATAL 1
921 # define ERRORFUNC NORETURN
922 # define ERROR_RETURN(a) /*nothing*/
923 //moved up: # define BC_STATUS void
924 # define RETURN_STATUS(v) do { ((void)(v)); return; } while (0)
927 #define BC_NUM_NEG(n, neg) ((((ssize_t)(n)) ^ -((ssize_t)(neg))) + (neg))
928 #define BC_NUM_ONE(n) ((n)->len == 1 && (n)->rdx == 0 && (n)->num[0] == 1)
929 #define BC_NUM_INT(n) ((n)->len - (n)->rdx)
930 //#define BC_NUM_AREQ(a, b) (BC_MAX((a)->rdx, (b)->rdx) + BC_MAX(BC_NUM_INT(a), BC_NUM_INT(b)) + 1)
931 static /*ALWAYS_INLINE*/ size_t BC_NUM_AREQ(BcNum *a, BcNum *b)
933 return BC_MAX(a->rdx, b->rdx) + BC_MAX(BC_NUM_INT(a), BC_NUM_INT(b)) + 1;
935 //#define BC_NUM_MREQ(a, b, scale) (BC_NUM_INT(a) + BC_NUM_INT(b) + BC_MAX((scale), (a)->rdx + (b)->rdx) + 1)
936 static /*ALWAYS_INLINE*/ size_t BC_NUM_MREQ(BcNum *a, BcNum *b, size_t scale)
938 return BC_NUM_INT(a) + BC_NUM_INT(b) + BC_MAX(scale, a->rdx + b->rdx) + 1;
941 typedef void (*BcNumDigitOp)(size_t, size_t, bool) FAST_FUNC;
943 typedef BC_STATUS (*BcNumBinaryOp)(BcNum *, BcNum *, BcNum *, size_t) FAST_FUNC;
945 static BC_STATUS zbc_num_binary(BcNum *a, BcNum *b, BcNum *c, size_t scale,
946 BcNumBinaryOp op, size_t req);
947 static FAST_FUNC BC_STATUS zbc_num_a(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale);
948 static FAST_FUNC BC_STATUS zbc_num_s(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale);
949 static FAST_FUNC BC_STATUS zbc_num_p(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale);
950 static FAST_FUNC BC_STATUS zbc_num_m(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale);
951 static FAST_FUNC BC_STATUS zbc_num_d(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale);
952 static FAST_FUNC BC_STATUS zbc_num_rem(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale);
954 static FAST_FUNC BC_STATUS zbc_num_add(BcNum *a, BcNum *b, BcNum *c, size_t scale)
956 BcNumBinaryOp op = (!a->neg == !b->neg) ? zbc_num_a : zbc_num_s;
958 RETURN_STATUS(zbc_num_binary(a, b, c, false, op, BC_NUM_AREQ(a, b)));
961 static FAST_FUNC BC_STATUS zbc_num_sub(BcNum *a, BcNum *b, BcNum *c, size_t scale)
963 BcNumBinaryOp op = (!a->neg == !b->neg) ? zbc_num_s : zbc_num_a;
965 RETURN_STATUS(zbc_num_binary(a, b, c, true, op, BC_NUM_AREQ(a, b)));
968 static FAST_FUNC BC_STATUS zbc_num_mul(BcNum *a, BcNum *b, BcNum *c, size_t scale)
970 size_t req = BC_NUM_MREQ(a, b, scale);
971 RETURN_STATUS(zbc_num_binary(a, b, c, scale, zbc_num_m, req));
974 static FAST_FUNC BC_STATUS zbc_num_div(BcNum *a, BcNum *b, BcNum *c, size_t scale)
976 size_t req = BC_NUM_MREQ(a, b, scale);
977 RETURN_STATUS(zbc_num_binary(a, b, c, scale, zbc_num_d, req));
980 static FAST_FUNC BC_STATUS zbc_num_mod(BcNum *a, BcNum *b, BcNum *c, size_t scale)
982 size_t req = BC_NUM_MREQ(a, b, scale);
983 RETURN_STATUS(zbc_num_binary(a, b, c, scale, zbc_num_rem, req));
986 static FAST_FUNC BC_STATUS zbc_num_pow(BcNum *a, BcNum *b, BcNum *c, size_t scale)
988 RETURN_STATUS(zbc_num_binary(a, b, c, scale, zbc_num_p, a->len * b->len + 1));
991 static const BcNumBinaryOp zbc_program_ops[] = {
992 zbc_num_pow, zbc_num_mul, zbc_num_div, zbc_num_mod, zbc_num_add, zbc_num_sub,
995 # define zbc_num_add(...) (zbc_num_add(__VA_ARGS__), BC_STATUS_SUCCESS)
996 # define zbc_num_sub(...) (zbc_num_sub(__VA_ARGS__), BC_STATUS_SUCCESS)
997 # define zbc_num_mul(...) (zbc_num_mul(__VA_ARGS__), BC_STATUS_SUCCESS)
998 # define zbc_num_div(...) (zbc_num_div(__VA_ARGS__), BC_STATUS_SUCCESS)
999 # define zbc_num_mod(...) (zbc_num_mod(__VA_ARGS__), BC_STATUS_SUCCESS)
1000 # define zbc_num_pow(...) (zbc_num_pow(__VA_ARGS__), BC_STATUS_SUCCESS)
1003 static void fflush_and_check(void)
1006 if (ferror(stdout) || ferror(stderr))
1007 bb_perror_msg_and_die("output error");
1010 #if ENABLE_FEATURE_CLEAN_UP
1011 #define QUIT_OR_RETURN_TO_MAIN \
1013 IF_FEATURE_BC_SIGNALS(G_ttyin = 0;) /* do not loop in main loop anymore */ \
1015 return BC_STATUS_FAILURE; \
1018 #define QUIT_OR_RETURN_TO_MAIN quit()
1021 static void quit(void) NORETURN;
1022 static void quit(void)
1025 bb_perror_msg_and_die("input error");
1030 static void bc_verror_msg(const char *fmt, va_list p)
1032 const char *sv = sv; /* for compiler */
1035 applet_name = xasprintf("%s: %s:%u", applet_name, G.prog.file, G.err_line);
1037 bb_verror_msg(fmt, p, NULL);
1039 free((char*)applet_name);
1044 static NOINLINE ERRORFUNC int bc_error_fmt(const char *fmt, ...)
1049 bc_verror_msg(fmt, p);
1052 if (!ENABLE_FEATURE_CLEAN_UP && !G_ttyin)
1054 ERROR_RETURN(return BC_STATUS_FAILURE;)
1058 static NOINLINE int bc_posix_error_fmt(const char *fmt, ...)
1062 // Are non-POSIX constructs totally ok?
1063 if (!(option_mask32 & (BC_FLAG_S|BC_FLAG_W)))
1064 return BC_STATUS_SUCCESS; // yes
1067 bc_verror_msg(fmt, p);
1070 // Do we treat non-POSIX constructs as errors?
1071 if (!(option_mask32 & BC_FLAG_S))
1072 return BC_STATUS_SUCCESS; // no, it's a warning
1073 if (!ENABLE_FEATURE_CLEAN_UP && !G_ttyin)
1075 return BC_STATUS_FAILURE;
1079 // We use error functions with "return bc_error(FMT[, PARAMS])" idiom.
1080 // This idiom begs for tail-call optimization, but for it to work,
1081 // function must not have caller-cleaned parameters on stack.
1082 // Unfortunately, vararg function API does exactly that on most arches.
1083 // Thus, use these shims for the cases when we have no vararg PARAMS:
1084 static ERRORFUNC int bc_error(const char *msg)
1086 ERROR_RETURN(return) bc_error_fmt("%s", msg);
1088 static ERRORFUNC int bc_error_bad_character(char c)
1090 ERROR_RETURN(return) bc_error_fmt("bad character '%c'", c);
1092 static ERRORFUNC int bc_error_bad_expression(void)
1094 ERROR_RETURN(return) bc_error("bad expression");
1096 static ERRORFUNC int bc_error_bad_token(void)
1098 ERROR_RETURN(return) bc_error("bad token");
1100 static ERRORFUNC int bc_error_stack_has_too_few_elements(void)
1102 ERROR_RETURN(return) bc_error("stack has too few elements");
1104 static ERRORFUNC int bc_error_variable_is_wrong_type(void)
1106 ERROR_RETURN(return) bc_error("variable is wrong type");
1108 static ERRORFUNC int bc_error_nested_read_call(void)
1110 ERROR_RETURN(return) bc_error("read() call inside of a read() call");
1113 static int bc_POSIX_requires(const char *msg)
1115 return bc_posix_error_fmt("POSIX requires %s", msg);
1117 static int bc_POSIX_does_not_allow(const char *msg)
1119 return bc_posix_error_fmt("%s%s", "POSIX does not allow ", msg);
1121 static int bc_POSIX_does_not_allow_bool_ops_this_is_bad(const char *msg)
1123 return bc_posix_error_fmt("%s%s %s", "POSIX does not allow ", "boolean operators; the following is bad:", msg);
1125 static int bc_POSIX_does_not_allow_empty_X_expression_in_for(const char *msg)
1127 return bc_posix_error_fmt("%san empty %s expression in a for loop", "POSIX does not allow ", msg);
1131 static void bc_vec_grow(BcVec *v, size_t n)
1133 size_t cap = v->cap * 2;
1134 while (cap < v->len + n) cap *= 2;
1135 v->v = xrealloc(v->v, v->size * cap);
1139 static void bc_vec_init(BcVec *v, size_t esize, BcVecFree dtor)
1142 v->cap = BC_VEC_START_CAP;
1145 v->v = xmalloc(esize * BC_VEC_START_CAP);
1148 static void bc_char_vec_init(BcVec *v)
1150 bc_vec_init(v, sizeof(char), NULL);
1153 static void bc_vec_expand(BcVec *v, size_t req)
1156 v->v = xrealloc(v->v, v->size * req);
1161 static void bc_vec_pop(BcVec *v)
1165 v->dtor(v->v + (v->size * v->len));
1168 static void bc_vec_npop(BcVec *v, size_t n)
1173 size_t len = v->len - n;
1174 while (v->len > len) v->dtor(v->v + (v->size * --v->len));
1178 static void bc_vec_pop_all(BcVec *v)
1180 bc_vec_npop(v, v->len);
1183 static void bc_vec_push(BcVec *v, const void *data)
1185 if (v->len + 1 > v->cap) bc_vec_grow(v, 1);
1186 memmove(v->v + (v->size * v->len), data, v->size);
1190 static void bc_vec_pushByte(BcVec *v, char data)
1192 bc_vec_push(v, &data);
1195 static void bc_vec_pushZeroByte(BcVec *v)
1197 //bc_vec_pushByte(v, '\0');
1199 bc_vec_push(v, &const_int_0);
1202 static void bc_vec_pushAt(BcVec *v, const void *data, size_t idx)
1205 bc_vec_push(v, data);
1210 if (v->len == v->cap) bc_vec_grow(v, 1);
1212 ptr = v->v + v->size * idx;
1214 memmove(ptr + v->size, ptr, v->size * (v->len++ - idx));
1215 memmove(ptr, data, v->size);
1219 static void bc_vec_string(BcVec *v, size_t len, const char *str)
1222 bc_vec_expand(v, len + 1);
1223 memcpy(v->v, str, len);
1226 bc_vec_pushZeroByte(v);
1229 static void bc_vec_concat(BcVec *v, const char *str)
1233 if (v->len == 0) bc_vec_pushZeroByte(v);
1236 len = v->len + slen;
1238 if (v->cap < len) bc_vec_grow(v, slen);
1239 strcpy(v->v + v->len - 1, str);
1244 static void *bc_vec_item(const BcVec *v, size_t idx)
1246 return v->v + v->size * idx;
1249 static char** bc_program_str(size_t idx)
1251 return bc_vec_item(&G.prog.strs, idx);
1254 static BcFunc* bc_program_func(size_t idx)
1256 return bc_vec_item(&G.prog.fns, idx);
1259 static void *bc_vec_item_rev(const BcVec *v, size_t idx)
1261 return v->v + v->size * (v->len - idx - 1);
1264 static void *bc_vec_top(const BcVec *v)
1266 return v->v + v->size * (v->len - 1);
1269 static FAST_FUNC void bc_vec_free(void *vec)
1271 BcVec *v = (BcVec *) vec;
1276 static int bc_id_cmp(const void *e1, const void *e2)
1278 return strcmp(((const BcId *) e1)->name, ((const BcId *) e2)->name);
1281 static FAST_FUNC void bc_id_free(void *id)
1283 free(((BcId *) id)->name);
1286 static size_t bc_map_find(const BcVec *v, const void *ptr)
1288 size_t low = 0, high = v->len;
1290 while (low < high) {
1292 size_t mid = (low + high) / 2;
1293 BcId *id = bc_vec_item(v, mid);
1294 int result = bc_id_cmp(ptr, id);
1298 else if (result < 0)
1307 static int bc_map_insert(BcVec *v, const void *ptr, size_t *i)
1309 size_t n = *i = bc_map_find(v, ptr);
1312 bc_vec_push(v, ptr);
1313 else if (!bc_id_cmp(ptr, bc_vec_item(v, n)))
1314 return 0; // "was not inserted"
1316 bc_vec_pushAt(v, ptr, n);
1317 return 1; // "was inserted"
1321 static size_t bc_map_index(const BcVec *v, const void *ptr)
1323 size_t i = bc_map_find(v, ptr);
1324 if (i >= v->len) return BC_VEC_INVALID_IDX;
1325 return bc_id_cmp(ptr, bc_vec_item(v, i)) ? BC_VEC_INVALID_IDX : i;
1329 static int push_input_byte(BcVec *vec, char c)
1331 if ((c < ' ' && c != '\t' && c != '\r' && c != '\n') // also allow '\v' '\f'?
1334 // Bad chars on this line, ignore entire line
1335 bc_error_fmt("illegal character 0x%02x", c);
1338 bc_vec_pushByte(vec, (char)c);
1342 static void bc_read_line(BcVec *vec)
1350 bc_vec_pop_all(vec);
1354 #if ENABLE_FEATURE_BC_SIGNALS
1355 if (G_interrupt) { // ^C was pressed
1358 // GNU bc says "interrupted execution."
1359 // GNU dc says "Interrupt!"
1360 fputs("\ninterrupted execution\n", stderr);
1362 # if ENABLE_FEATURE_EDITING
1365 # define line_buf bb_common_bufsiz1
1366 n = read_line_input(G.line_input_state, "", line_buf, COMMON_BUFSIZE);
1367 if (n <= 0) { // read errors or EOF, or ^D, or ^C
1376 bad_chars |= push_input_byte(vec, c);
1383 IF_FEATURE_BC_SIGNALS(errno = 0;)
1386 #if ENABLE_FEATURE_BC_SIGNALS && !ENABLE_FEATURE_EDITING
1387 // Both conditions appear simultaneously, check both just in case
1388 if (errno == EINTR || G_interrupt) {
1396 quit(); // this emits error message
1397 // Note: EOF does not append '\n', therefore:
1398 // printf 'print 123\n' | bc - works
1399 // printf 'print 123' | bc - fails (syntax error)
1402 bad_chars |= push_input_byte(vec, c);
1403 } while (c != '\n');
1405 } while (bad_chars);
1407 bc_vec_pushZeroByte(vec);
1410 static char* bc_read_file(const char *path)
1413 size_t size = ((size_t) -1);
1416 // Never returns NULL (dies on errors)
1417 buf = xmalloc_xopen_read_close(path, &size);
1419 for (i = 0; i < size; ++i) {
1421 if ((c < ' ' && c != '\t' && c != '\r' && c != '\n') // also allow '\v' '\f'?
1433 static void bc_num_setToZero(BcNum *n, size_t scale)
1440 static void bc_num_zero(BcNum *n)
1442 bc_num_setToZero(n, 0);
1445 static void bc_num_one(BcNum *n)
1447 bc_num_setToZero(n, 0);
1452 static void bc_num_ten(BcNum *n)
1454 bc_num_setToZero(n, 0);
1460 // Note: this also sets BcNum to zero
1461 static void bc_num_init(BcNum *n, size_t req)
1463 req = req >= BC_NUM_DEF_SIZE ? req : BC_NUM_DEF_SIZE;
1464 //memset(n, 0, sizeof(BcNum)); - cleared by assignments below
1465 n->num = xmalloc(req);
1472 static void bc_num_init_DEF_SIZE(BcNum *n)
1474 bc_num_init(n, BC_NUM_DEF_SIZE);
1477 static void bc_num_expand(BcNum *n, size_t req)
1479 req = req >= BC_NUM_DEF_SIZE ? req : BC_NUM_DEF_SIZE;
1481 n->num = xrealloc(n->num, req);
1486 static FAST_FUNC void bc_num_free(void *num)
1488 free(((BcNum *) num)->num);
1491 static void bc_num_copy(BcNum *d, BcNum *s)
1494 bc_num_expand(d, s->cap);
1498 memcpy(d->num, s->num, sizeof(BcDig) * d->len);
1502 static BC_STATUS zbc_num_ulong(BcNum *n, unsigned long *result_p)
1505 unsigned long pow, result;
1507 if (n->neg) RETURN_STATUS(bc_error("negative number"));
1509 for (result = 0, pow = 1, i = n->rdx; i < n->len; ++i) {
1511 unsigned long prev = result, powprev = pow;
1513 result += ((unsigned long) n->num[i]) * pow;
1516 if (result < prev || pow < powprev)
1517 RETURN_STATUS(bc_error("overflow"));
1523 RETURN_STATUS(BC_STATUS_SUCCESS);
1525 #if ERRORS_ARE_FATAL
1526 # define zbc_num_ulong(...) (zbc_num_ulong(__VA_ARGS__), BC_STATUS_SUCCESS)
1529 static void bc_num_ulong2num(BcNum *n, unsigned long val)
1535 if (val == 0) return;
1537 if (ULONG_MAX == 0xffffffffUL)
1538 bc_num_expand(n, 10); // 10 digits: 4294967295
1539 if (ULONG_MAX == 0xffffffffffffffffULL)
1540 bc_num_expand(n, 20); // 20 digits: 18446744073709551615
1541 BUILD_BUG_ON(ULONG_MAX > 0xffffffffffffffffULL);
1548 if (val == 0) break;
1552 static void bc_num_subArrays(BcDig *restrict a, BcDig *restrict b,
1556 for (i = 0; i < len; ++i) {
1557 for (a[i] -= b[i], j = 0; a[i + j] < 0;) {
1564 static ssize_t bc_num_compare(BcDig *restrict a, BcDig *restrict b, size_t len)
1568 for (i = len - 1; i < len && !(c = a[i] - b[i]); --i);
1569 return BC_NUM_NEG(i + 1, c < 0);
1572 static ssize_t bc_num_cmp(BcNum *a, BcNum *b)
1574 size_t i, min, a_int, b_int, diff;
1575 BcDig *max_num, *min_num;
1579 if (a == b) return 0;
1580 if (a->len == 0) return BC_NUM_NEG(!!b->len, !b->neg);
1581 if (b->len == 0) return BC_NUM_NEG(1, a->neg);
1583 if (a->neg != b->neg) // signs of a and b differ
1584 // +a,-b = a>b = 1 or -a,+b = a<b = -1
1585 return (int)b->neg - (int)a->neg;
1586 neg = a->neg; // 1 if both negative, 0 if both positive
1588 a_int = BC_NUM_INT(a);
1589 b_int = BC_NUM_INT(b);
1592 if (a_int != 0) return (ssize_t) a_int;
1594 a_max = (a->rdx > b->rdx);
1597 diff = a->rdx - b->rdx;
1598 max_num = a->num + diff;
1600 // neg = (a_max == neg); - NOP (maps 1->1 and 0->0)
1603 diff = b->rdx - a->rdx;
1604 max_num = b->num + diff;
1606 neg = !neg; // same as "neg = (a_max == neg)"
1609 cmp = bc_num_compare(max_num, min_num, b_int + min);
1610 if (cmp != 0) return BC_NUM_NEG(cmp, neg);
1612 for (max_num -= diff, i = diff - 1; i < diff; --i) {
1613 if (max_num[i]) return BC_NUM_NEG(1, neg);
1619 static void bc_num_truncate(BcNum *n, size_t places)
1621 if (places == 0) return;
1627 memmove(n->num, n->num + places, n->len * sizeof(BcDig));
1631 static void bc_num_extend(BcNum *n, size_t places)
1633 size_t len = n->len + places;
1637 if (n->cap < len) bc_num_expand(n, len);
1639 memmove(n->num + places, n->num, sizeof(BcDig) * n->len);
1640 memset(n->num, 0, sizeof(BcDig) * places);
1647 static void bc_num_clean(BcNum *n)
1649 while (n->len > 0 && n->num[n->len - 1] == 0) --n->len;
1652 else if (n->len < n->rdx)
1656 static void bc_num_retireMul(BcNum *n, size_t scale, bool neg1, bool neg2)
1659 bc_num_extend(n, scale - n->rdx);
1661 bc_num_truncate(n, n->rdx - scale);
1664 if (n->len != 0) n->neg = !neg1 != !neg2;
1667 static void bc_num_split(BcNum *restrict n, size_t idx, BcNum *restrict a,
1672 b->len = n->len - idx;
1674 a->rdx = b->rdx = 0;
1676 memcpy(b->num, n->num + idx, b->len * sizeof(BcDig));
1677 memcpy(a->num, n->num, idx * sizeof(BcDig));
1688 static BC_STATUS zbc_num_shift(BcNum *n, size_t places)
1690 if (places == 0 || n->len == 0) RETURN_STATUS(BC_STATUS_SUCCESS);
1692 // This check makes sense only if size_t is (much) larger than BC_MAX_NUM.
1693 if (SIZE_MAX > (BC_MAX_NUM | 0xff)) {
1694 if (places + n->len > BC_MAX_NUM)
1695 RETURN_STATUS(bc_error("number too long: must be [1,"BC_MAX_NUM_STR"]"));
1698 if (n->rdx >= places)
1701 bc_num_extend(n, places - n->rdx);
1707 RETURN_STATUS(BC_STATUS_SUCCESS);
1709 #if ERRORS_ARE_FATAL
1710 # define zbc_num_shift(...) (zbc_num_shift(__VA_ARGS__), BC_STATUS_SUCCESS)
1713 static BC_STATUS zbc_num_inv(BcNum *a, BcNum *b, size_t scale)
1722 RETURN_STATUS(zbc_num_div(&one, a, b, scale));
1724 #if ERRORS_ARE_FATAL
1725 # define zbc_num_inv(...) (zbc_num_inv(__VA_ARGS__), BC_STATUS_SUCCESS)
1728 static FAST_FUNC BC_STATUS zbc_num_a(BcNum *a, BcNum *b, BcNum *restrict c, size_t sub)
1730 BcDig *ptr, *ptr_a, *ptr_b, *ptr_c;
1731 size_t i, max, min_rdx, min_int, diff, a_int, b_int;
1734 // Because this function doesn't need to use scale (per the bc spec),
1735 // I am hijacking it to say whether it's doing an add or a subtract.
1739 if (sub && c->len) c->neg = !c->neg;
1740 RETURN_STATUS(BC_STATUS_SUCCESS);
1744 RETURN_STATUS(BC_STATUS_SUCCESS);
1748 c->rdx = BC_MAX(a->rdx, b->rdx);
1749 min_rdx = BC_MIN(a->rdx, b->rdx);
1752 if (a->rdx > b->rdx) {
1753 diff = a->rdx - b->rdx;
1755 ptr_a = a->num + diff;
1759 diff = b->rdx - a->rdx;
1762 ptr_b = b->num + diff;
1765 for (ptr_c = c->num, i = 0; i < diff; ++i, ++c->len) ptr_c[i] = ptr[i];
1768 a_int = BC_NUM_INT(a);
1769 b_int = BC_NUM_INT(b);
1771 if (a_int > b_int) {
1782 for (carry = 0, i = 0; i < min_rdx + min_int; ++i, ++c->len) {
1783 in = ((int) ptr_a[i]) + ((int) ptr_b[i]) + carry;
1785 ptr_c[i] = (BcDig)(in % 10);
1788 for (; i < max + min_rdx; ++i, ++c->len) {
1789 in = ((int) ptr[i]) + carry;
1791 ptr_c[i] = (BcDig)(in % 10);
1794 if (carry != 0) c->num[c->len++] = (BcDig) carry;
1796 RETURN_STATUS(BC_STATUS_SUCCESS); // can't make void, see zbc_num_binary()
1799 static FAST_FUNC BC_STATUS zbc_num_s(BcNum *a, BcNum *b, BcNum *restrict c, size_t sub)
1802 BcNum *minuend, *subtrahend;
1804 bool aneg, bneg, neg;
1806 // Because this function doesn't need to use scale (per the bc spec),
1807 // I am hijacking it to say whether it's doing an add or a subtract.
1811 if (sub && c->len) c->neg = !c->neg;
1812 RETURN_STATUS(BC_STATUS_SUCCESS);
1816 RETURN_STATUS(BC_STATUS_SUCCESS);
1821 a->neg = b->neg = false;
1823 cmp = bc_num_cmp(a, b);
1829 bc_num_setToZero(c, BC_MAX(a->rdx, b->rdx));
1830 RETURN_STATUS(BC_STATUS_SUCCESS);
1839 if (sub) neg = !neg;
1844 bc_num_copy(c, minuend);
1847 if (c->rdx < subtrahend->rdx) {
1848 bc_num_extend(c, subtrahend->rdx - c->rdx);
1852 start = c->rdx - subtrahend->rdx;
1854 bc_num_subArrays(c->num + start, subtrahend->num, subtrahend->len);
1858 RETURN_STATUS(BC_STATUS_SUCCESS); // can't make void, see zbc_num_binary()
1861 static FAST_FUNC BC_STATUS zbc_num_k(BcNum *restrict a, BcNum *restrict b,
1863 #if ERRORS_ARE_FATAL
1864 # define zbc_num_k(...) (zbc_num_k(__VA_ARGS__), BC_STATUS_SUCCESS)
1868 size_t max = BC_MAX(a->len, b->len), max2 = (max + 1) / 2;
1869 BcNum l1, h1, l2, h2, m2, m1, z0, z1, z2, temp;
1872 if (a->len == 0 || b->len == 0) {
1874 RETURN_STATUS(BC_STATUS_SUCCESS);
1876 aone = BC_NUM_ONE(a);
1877 if (aone || BC_NUM_ONE(b)) {
1878 bc_num_copy(c, aone ? b : a);
1879 RETURN_STATUS(BC_STATUS_SUCCESS);
1882 if (a->len + b->len < BC_NUM_KARATSUBA_LEN ||
1883 a->len < BC_NUM_KARATSUBA_LEN || b->len < BC_NUM_KARATSUBA_LEN)
1888 bc_num_expand(c, a->len + b->len + 1);
1890 memset(c->num, 0, sizeof(BcDig) * c->cap);
1893 for (i = 0; i < b->len; ++i) {
1896 for (j = 0; j < a->len; ++j) {
1897 unsigned in = c->num[i + j];
1898 in += ((unsigned) a->num[j]) * ((unsigned) b->num[i]) + carry;
1899 // note: compilers prefer _unsigned_ div/const
1901 c->num[i + j] = (BcDig)(in % 10);
1904 c->num[i + j] += (BcDig) carry;
1905 len = BC_MAX(len, i + j + !!carry);
1907 #if ENABLE_FEATURE_BC_SIGNALS
1909 // a*a <- without check below, this will not be interruptible
1910 if (G_interrupt) return BC_STATUS_FAILURE;
1916 RETURN_STATUS(BC_STATUS_SUCCESS);
1919 bc_num_init(&l1, max);
1920 bc_num_init(&h1, max);
1921 bc_num_init(&l2, max);
1922 bc_num_init(&h2, max);
1923 bc_num_init(&m1, max);
1924 bc_num_init(&m2, max);
1925 bc_num_init(&z0, max);
1926 bc_num_init(&z1, max);
1927 bc_num_init(&z2, max);
1928 bc_num_init(&temp, max + max);
1930 bc_num_split(a, max2, &l1, &h1);
1931 bc_num_split(b, max2, &l2, &h2);
1933 s = zbc_num_add(&h1, &l1, &m1, 0);
1935 s = zbc_num_add(&h2, &l2, &m2, 0);
1938 s = zbc_num_k(&h1, &h2, &z0);
1940 s = zbc_num_k(&m1, &m2, &z1);
1942 s = zbc_num_k(&l1, &l2, &z2);
1945 s = zbc_num_sub(&z1, &z0, &temp, 0);
1947 s = zbc_num_sub(&temp, &z2, &z1, 0);
1950 s = zbc_num_shift(&z0, max2 * 2);
1952 s = zbc_num_shift(&z1, max2);
1954 s = zbc_num_add(&z0, &z1, &temp, 0);
1956 s = zbc_num_add(&temp, &z2, c, 0);
1972 static FAST_FUNC BC_STATUS zbc_num_m(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale)
1976 size_t maxrdx = BC_MAX(a->rdx, b->rdx);
1978 scale = BC_MAX(scale, a->rdx);
1979 scale = BC_MAX(scale, b->rdx);
1980 scale = BC_MIN(a->rdx + b->rdx, scale);
1981 maxrdx = BC_MAX(maxrdx, scale);
1983 bc_num_init(&cpa, a->len);
1984 bc_num_init(&cpb, b->len);
1986 bc_num_copy(&cpa, a);
1987 bc_num_copy(&cpb, b);
1988 cpa.neg = cpb.neg = false;
1990 s = zbc_num_shift(&cpa, maxrdx);
1992 s = zbc_num_shift(&cpb, maxrdx);
1994 s = zbc_num_k(&cpa, &cpb, c);
1998 bc_num_expand(c, c->len + maxrdx);
2000 if (c->len < maxrdx) {
2001 memset(c->num + c->len, 0, (c->cap - c->len) * sizeof(BcDig));
2006 bc_num_retireMul(c, scale, a->neg, b->neg);
2013 #if ERRORS_ARE_FATAL
2014 # define zbc_num_m(...) (zbc_num_m(__VA_ARGS__), BC_STATUS_SUCCESS)
2017 static FAST_FUNC BC_STATUS zbc_num_d(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale)
2019 BcStatus s = BC_STATUS_SUCCESS;
2026 RETURN_STATUS(bc_error("divide by zero"));
2028 bc_num_setToZero(c, scale);
2029 RETURN_STATUS(BC_STATUS_SUCCESS);
2031 if (BC_NUM_ONE(b)) {
2033 bc_num_retireMul(c, scale, a->neg, b->neg);
2034 RETURN_STATUS(BC_STATUS_SUCCESS);
2037 bc_num_init(&cp, BC_NUM_MREQ(a, b, scale));
2038 bc_num_copy(&cp, a);
2042 bc_num_expand(&cp, len + 2);
2043 bc_num_extend(&cp, len - cp.len);
2046 if (b->rdx > cp.rdx) bc_num_extend(&cp, b->rdx - cp.rdx);
2048 if (scale > cp.rdx) bc_num_extend(&cp, scale - cp.rdx);
2050 if (b->rdx == b->len) {
2051 for (i = 0; zero && i < len; ++i) zero = !b->num[len - i - 1];
2055 if (cp.cap == cp.len) bc_num_expand(&cp, cp.len + 1);
2057 // We want an extra zero in front to make things simpler.
2058 cp.num[cp.len++] = 0;
2061 bc_num_expand(c, cp.len);
2064 memset(c->num + end, 0, (c->cap - end) * sizeof(BcDig));
2069 for (i = end - 1; !s && i < end; --i) {
2071 for (q = 0; (!s && n[len] != 0) || bc_num_compare(n, p, len) >= 0; ++q)
2072 bc_num_subArrays(n, p, len);
2074 #if ENABLE_FEATURE_BC_SIGNALS
2077 // 1/a <- without check below, this will not be interruptible
2079 s = BC_STATUS_FAILURE;
2085 bc_num_retireMul(c, scale, a->neg, b->neg);
2090 #if ERRORS_ARE_FATAL
2091 # define zbc_num_d(...) (zbc_num_d(__VA_ARGS__), BC_STATUS_SUCCESS)
2094 static FAST_FUNC BC_STATUS zbc_num_r(BcNum *a, BcNum *b, BcNum *restrict c,
2095 BcNum *restrict d, size_t scale, size_t ts)
2102 RETURN_STATUS(bc_error("divide by zero"));
2105 bc_num_setToZero(d, ts);
2106 RETURN_STATUS(BC_STATUS_SUCCESS);
2109 bc_num_init(&temp, d->cap);
2110 s = zbc_num_d(a, b, c, scale);
2113 if (scale != 0) scale = ts;
2115 s = zbc_num_m(c, b, &temp, scale);
2117 s = zbc_num_sub(a, &temp, d, scale);
2120 if (ts > d->rdx && d->len) bc_num_extend(d, ts - d->rdx);
2123 bc_num_retireMul(d, ts, a->neg, b->neg);
2130 #if ERRORS_ARE_FATAL
2131 # define zbc_num_r(...) (zbc_num_r(__VA_ARGS__), BC_STATUS_SUCCESS)
2134 static FAST_FUNC BC_STATUS zbc_num_rem(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale)
2138 size_t ts = BC_MAX(scale + b->rdx, a->rdx), len = BC_NUM_MREQ(a, b, ts);
2140 bc_num_init(&c1, len);
2141 s = zbc_num_r(a, b, &c1, c, scale, ts);
2146 #if ERRORS_ARE_FATAL
2147 # define zbc_num_rem(...) (zbc_num_rem(__VA_ARGS__), BC_STATUS_SUCCESS)
2150 static FAST_FUNC BC_STATUS zbc_num_p(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale)
2152 BcStatus s = BC_STATUS_SUCCESS;
2155 size_t i, powrdx, resrdx;
2158 if (b->rdx) RETURN_STATUS(bc_error("non integer number"));
2162 RETURN_STATUS(BC_STATUS_SUCCESS);
2165 bc_num_setToZero(c, scale);
2166 RETURN_STATUS(BC_STATUS_SUCCESS);
2168 if (BC_NUM_ONE(b)) {
2172 s = zbc_num_inv(a, c, scale);
2179 s = zbc_num_ulong(b, &pow);
2180 if (s) RETURN_STATUS(s);
2182 bc_num_init(©, a->len);
2183 bc_num_copy(©, a);
2188 if (a->rdx * pow < scale)
2189 scale = a->rdx * pow;
2194 for (powrdx = a->rdx; !(pow & 1); pow >>= 1) {
2196 s = zbc_num_mul(©, ©, ©, powrdx);
2198 // Not needed: zbc_num_mul() has a check for ^C:
2199 //if (G_interrupt) {
2200 // s = BC_STATUS_FAILURE;
2205 bc_num_copy(c, ©);
2207 for (resrdx = powrdx, pow >>= 1; pow != 0; pow >>= 1) {
2210 s = zbc_num_mul(©, ©, ©, powrdx);
2215 s = zbc_num_mul(c, ©, c, resrdx);
2218 // Not needed: zbc_num_mul() has a check for ^C:
2219 //if (G_interrupt) {
2220 // s = BC_STATUS_FAILURE;
2226 s = zbc_num_inv(c, c, scale);
2230 if (c->rdx > scale) bc_num_truncate(c, c->rdx - scale);
2232 // We can't use bc_num_clean() here.
2233 for (zero = true, i = 0; zero && i < c->len; ++i) zero = !c->num[i];
2234 if (zero) bc_num_setToZero(c, scale);
2240 #if ERRORS_ARE_FATAL
2241 # define zbc_num_p(...) (zbc_num_p(__VA_ARGS__), BC_STATUS_SUCCESS)
2244 static BC_STATUS zbc_num_binary(BcNum *a, BcNum *b, BcNum *c, size_t scale,
2245 BcNumBinaryOp op, size_t req)
2248 BcNum num2, *ptr_a, *ptr_b;
2253 memcpy(ptr_a, c, sizeof(BcNum));
2262 memcpy(ptr_b, c, sizeof(BcNum));
2270 bc_num_init(c, req);
2272 bc_num_expand(c, req);
2274 s = BC_STATUS_SUCCESS;
2275 ERROR_RETURN(s =) op(ptr_a, ptr_b, c, scale);
2277 if (init) bc_num_free(&num2);
2281 #if ERRORS_ARE_FATAL
2282 # define zbc_num_binary(...) (zbc_num_binary(__VA_ARGS__), BC_STATUS_SUCCESS)
2285 static bool bc_num_strValid(const char *val, size_t base)
2290 b = (BcDig)(base <= 10 ? base + '0' : base - 10 + 'A');
2297 if (radix) return false;
2301 if (c < '0' || c >= b || (c > '9' && c < 'A'))
2307 // Note: n is already "bc_num_zero()"ed,
2308 // leading zeroes in "val" are removed
2309 static void bc_num_parseDecimal(BcNum *n, const char *val)
2318 bc_num_expand(n, len);
2320 ptr = strchr(val, '.');
2324 n->rdx = (size_t)((val + len) - (ptr + 1));
2326 for (i = 0; val[i]; ++i) {
2327 if (val[i] != '0' && val[i] != '.') {
2328 // Not entirely zero value - convert it, and exit
2331 n->num[n->len] = val[i] - '0';
2334 if ((ssize_t)--i == (ssize_t)-1) break;
2335 if (val[i] == '.') goto skip_dot;
2340 // if this is reached, the value is entirely zero
2343 // Note: n is already "bc_num_zero()"ed,
2344 // leading zeroes in "val" are removed
2345 static void bc_num_parseBase(BcNum *n, const char *val, BcNum *base)
2348 BcNum temp, mult, result;
2353 for (i = 0; ; ++i) {
2356 if (val[i] != '.' && val[i] != '0')
2360 bc_num_init_DEF_SIZE(&temp);
2361 bc_num_init_DEF_SIZE(&mult);
2365 if (c == '\0') goto int_err;
2366 if (c == '.') break;
2368 v = (unsigned long) (c <= '9' ? c - '0' : c - 'A' + 10);
2370 s = zbc_num_mul(n, base, &mult, 0);
2371 if (s) goto int_err;
2372 bc_num_ulong2num(&temp, v);
2373 s = zbc_num_add(&mult, &temp, n, 0);
2374 if (s) goto int_err;
2377 bc_num_init(&result, base->len);
2378 //bc_num_zero(&result); - already is
2384 if (c == '\0') break;
2387 v = (unsigned long) (c <= '9' ? c - '0' : c - 'A' + 10);
2389 s = zbc_num_mul(&result, base, &result, 0);
2391 bc_num_ulong2num(&temp, v);
2392 s = zbc_num_add(&result, &temp, &result, 0);
2394 s = zbc_num_mul(&mult, base, &mult, 0);
2398 s = zbc_num_div(&result, &mult, &result, digits);
2400 s = zbc_num_add(n, &result, n, digits);
2404 if (n->rdx < digits) bc_num_extend(n, digits - n->rdx);
2409 bc_num_free(&result);
2415 static BC_STATUS zbc_num_parse(BcNum *n, const char *val, BcNum *base,
2418 if (!bc_num_strValid(val, base_t))
2419 RETURN_STATUS(bc_error("bad number string"));
2422 while (*val == '0') val++;
2425 bc_num_parseDecimal(n, val);
2427 bc_num_parseBase(n, val, base);
2429 RETURN_STATUS(BC_STATUS_SUCCESS);
2431 #if ERRORS_ARE_FATAL
2432 # define zbc_num_parse(...) (zbc_num_parse(__VA_ARGS__), BC_STATUS_SUCCESS)
2435 static BC_STATUS zbc_num_sqrt(BcNum *a, BcNum *restrict b, size_t scale)
2438 BcNum num1, num2, half, f, fprime, *x0, *x1, *temp;
2439 size_t pow, len, digs, digs1, resrdx, req, times = 0;
2440 ssize_t cmp = 1, cmp1 = SSIZE_MAX, cmp2 = SSIZE_MAX;
2442 req = BC_MAX(scale, a->rdx) + ((BC_NUM_INT(a) + 1) >> 1) + 1;
2443 bc_num_expand(b, req);
2446 bc_num_setToZero(b, scale);
2447 RETURN_STATUS(BC_STATUS_SUCCESS);
2450 RETURN_STATUS(bc_error("negative number"));
2451 else if (BC_NUM_ONE(a)) {
2453 bc_num_extend(b, scale);
2454 RETURN_STATUS(BC_STATUS_SUCCESS);
2457 scale = BC_MAX(scale, a->rdx) + 1;
2458 len = a->len + scale;
2460 bc_num_init(&num1, len);
2461 bc_num_init(&num2, len);
2462 bc_num_init_DEF_SIZE(&half);
2468 bc_num_init(&f, len);
2469 bc_num_init(&fprime, len);
2475 pow = BC_NUM_INT(a);
2484 pow -= 2 - (pow & 1);
2486 bc_num_extend(x0, pow);
2488 // Make sure to move the radix back.
2492 x0->rdx = digs = digs1 = 0;
2494 len = BC_NUM_INT(x0) + resrdx - 1;
2496 while (cmp != 0 || digs < len) {
2498 s = zbc_num_div(a, x0, &f, resrdx);
2500 s = zbc_num_add(x0, &f, &fprime, resrdx);
2502 s = zbc_num_mul(&fprime, &half, x1, resrdx);
2505 cmp = bc_num_cmp(x1, x0);
2506 digs = x1->len - (unsigned long long) llabs(cmp);
2508 if (cmp == cmp2 && digs == digs1)
2513 resrdx += times > 4;
2526 if (b->rdx > scale) bc_num_truncate(b, b->rdx - scale);
2529 bc_num_free(&fprime);
2536 #if ERRORS_ARE_FATAL
2537 # define zbc_num_sqrt(...) (zbc_num_sqrt(__VA_ARGS__), BC_STATUS_SUCCESS)
2540 static BC_STATUS zbc_num_divmod(BcNum *a, BcNum *b, BcNum *c, BcNum *d,
2546 size_t ts = BC_MAX(scale + b->rdx, a->rdx), len = BC_NUM_MREQ(a, b, ts);
2549 memcpy(&num2, c, sizeof(BcNum));
2551 bc_num_init(c, len);
2556 bc_num_expand(c, len);
2559 s = zbc_num_r(ptr_a, b, c, d, scale, ts);
2561 if (init) bc_num_free(&num2);
2565 #if ERRORS_ARE_FATAL
2566 # define zbc_num_divmod(...) (zbc_num_divmod(__VA_ARGS__), BC_STATUS_SUCCESS)
2570 static BC_STATUS zbc_num_modexp(BcNum *a, BcNum *b, BcNum *c, BcNum *restrict d)
2573 BcNum base, exp, two, temp;
2576 RETURN_STATUS(bc_error("divide by zero"));
2577 if (a->rdx || b->rdx || c->rdx)
2578 RETURN_STATUS(bc_error("non integer number"));
2580 RETURN_STATUS(bc_error("negative number"));
2582 bc_num_expand(d, c->len);
2583 bc_num_init(&base, c->len);
2584 bc_num_init(&exp, b->len);
2585 bc_num_init_DEF_SIZE(&two);
2586 bc_num_init(&temp, b->len);
2592 s = zbc_num_rem(a, c, &base, 0);
2594 bc_num_copy(&exp, b);
2596 while (exp.len != 0) {
2598 s = zbc_num_divmod(&exp, &two, &exp, &temp, 0);
2601 if (BC_NUM_ONE(&temp)) {
2602 s = zbc_num_mul(d, &base, &temp, 0);
2604 s = zbc_num_rem(&temp, c, d, 0);
2608 s = zbc_num_mul(&base, &base, &temp, 0);
2610 s = zbc_num_rem(&temp, c, &base, 0);
2621 #if ERRORS_ARE_FATAL
2622 # define zbc_num_modexp(...) (zbc_num_modexp(__VA_ARGS__), BC_STATUS_SUCCESS)
2627 static BC_STATUS zbc_func_insert(BcFunc *f, char *name, bool var)
2632 for (i = 0; i < f->autos.len; ++i) {
2633 if (strcmp(name, ((BcId *) bc_vec_item(&f->autos, i))->name) == 0)
2634 RETURN_STATUS(bc_error("function parameter or auto var has the same name as another"));
2640 bc_vec_push(&f->autos, &a);
2642 RETURN_STATUS(BC_STATUS_SUCCESS);
2644 #if ERRORS_ARE_FATAL
2645 # define zbc_func_insert(...) (zbc_func_insert(__VA_ARGS__), BC_STATUS_SUCCESS)
2649 static void bc_func_init(BcFunc *f)
2651 bc_char_vec_init(&f->code);
2652 bc_vec_init(&f->autos, sizeof(BcId), bc_id_free);
2653 bc_vec_init(&f->labels, sizeof(size_t), NULL);
2657 static FAST_FUNC void bc_func_free(void *func)
2659 BcFunc *f = (BcFunc *) func;
2660 bc_vec_free(&f->code);
2661 bc_vec_free(&f->autos);
2662 bc_vec_free(&f->labels);
2665 static void bc_array_expand(BcVec *a, size_t len);
2667 static void bc_array_init(BcVec *a, bool nums)
2670 bc_vec_init(a, sizeof(BcNum), bc_num_free);
2672 bc_vec_init(a, sizeof(BcVec), bc_vec_free);
2673 bc_array_expand(a, 1);
2676 static void bc_array_expand(BcVec *a, size_t len)
2680 if (a->size == sizeof(BcNum) && a->dtor == bc_num_free) {
2681 while (len > a->len) {
2682 bc_num_init_DEF_SIZE(&data.n);
2683 bc_vec_push(a, &data.n);
2687 while (len > a->len) {
2688 bc_array_init(&data.v, true);
2689 bc_vec_push(a, &data.v);
2694 static void bc_array_copy(BcVec *d, const BcVec *s)
2699 bc_vec_expand(d, s->cap);
2702 for (i = 0; i < s->len; ++i) {
2703 BcNum *dnum = bc_vec_item(d, i), *snum = bc_vec_item(s, i);
2704 bc_num_init(dnum, snum->len);
2705 bc_num_copy(dnum, snum);
2709 static FAST_FUNC void bc_string_free(void *string)
2711 free(*((char **) string));
2715 static void bc_result_copy(BcResult *d, BcResult *src)
2721 case BC_RESULT_TEMP:
2722 case BC_RESULT_IBASE:
2723 case BC_RESULT_SCALE:
2724 case BC_RESULT_OBASE:
2726 bc_num_init(&d->d.n, src->d.n.len);
2727 bc_num_copy(&d->d.n, &src->d.n);
2732 case BC_RESULT_ARRAY:
2733 case BC_RESULT_ARRAY_ELEM:
2735 d->d.id.name = xstrdup(src->d.id.name);
2739 case BC_RESULT_CONSTANT:
2740 case BC_RESULT_LAST:
2744 memcpy(&d->d.n, &src->d.n, sizeof(BcNum));
2751 static FAST_FUNC void bc_result_free(void *result)
2753 BcResult *r = (BcResult *) result;
2757 case BC_RESULT_TEMP:
2758 case BC_RESULT_IBASE:
2759 case BC_RESULT_SCALE:
2760 case BC_RESULT_OBASE:
2762 bc_num_free(&r->d.n);
2767 case BC_RESULT_ARRAY:
2768 case BC_RESULT_ARRAY_ELEM:
2782 static void bc_lex_lineComment(BcLex *l)
2784 l->t.t = BC_LEX_WHITESPACE;
2785 while (l->i < l->len && l->buf[l->i++] != '\n');
2789 static void bc_lex_whitespace(BcLex *l)
2792 l->t.t = BC_LEX_WHITESPACE;
2793 for (c = l->buf[l->i]; c != '\n' && isspace(c); c = l->buf[++l->i]);
2796 static BC_STATUS zbc_lex_number(BcLex *l, char start)
2798 const char *buf = l->buf + l->i;
2799 size_t len, bslashes, i, ccnt;
2802 pt = (start == '.');
2803 l->t.t = BC_LEX_NUMBER;
2810 if (c == '\\' && buf[i + 1] == '\n') {
2815 if (!isdigit(c) && (c < 'A' || c > 'F')) {
2816 if (c != '.') break;
2817 // if '.' was already seen, stop on second one:
2821 // buf[i] is one of "0-9A-F."
2826 //i is buf[i] index of the first not-yet-parsed char
2829 //ccnt is the number of chars in the number string, excluding possible
2830 //trailing "." and possible following trailing "\<newline>"(s).
2831 len = ccnt - bslashes * 2 + 1; // +1 byte for NUL termination
2833 // This check makes sense only if size_t is (much) larger than BC_MAX_NUM.
2834 if (SIZE_MAX > (BC_MAX_NUM | 0xff)) {
2835 if (len > BC_MAX_NUM)
2836 RETURN_STATUS(bc_error("number too long: must be [1,"BC_MAX_NUM_STR"]"));
2839 bc_vec_pop_all(&l->t.v);
2840 bc_vec_expand(&l->t.v, 1 + len);
2841 bc_vec_push(&l->t.v, &start);
2844 // If we have hit a backslash, skip it. We don't have
2845 // to check for a newline because it's guaranteed.
2851 bc_vec_push(&l->t.v, buf);
2856 bc_vec_pushZeroByte(&l->t.v);
2858 RETURN_STATUS(BC_STATUS_SUCCESS);
2860 #if ERRORS_ARE_FATAL
2861 # define zbc_lex_number(...) (zbc_lex_number(__VA_ARGS__), BC_STATUS_SUCCESS)
2864 static void bc_lex_name(BcLex *l)
2869 l->t.t = BC_LEX_NAME;
2872 buf = l->buf + l->i - 1;
2875 if ((c < 'a' || c > 'z') && !isdigit(c) && c != '_') break;
2879 #if 0 // We do not protect against people with gigabyte-long names
2880 // This check makes sense only if size_t is (much) larger than BC_MAX_STRING.
2881 if (SIZE_MAX > (BC_MAX_STRING | 0xff)) {
2882 if (i > BC_MAX_STRING)
2883 return bc_error("name too long: must be [1,"BC_MAX_STRING_STR"]");
2886 bc_vec_string(&l->t.v, i, buf);
2888 // Increment the index. We minus 1 because it has already been incremented.
2891 //return BC_STATUS_SUCCESS;
2894 static void bc_lex_init(BcLex *l)
2896 bc_char_vec_init(&l->t.v);
2899 static void bc_lex_free(BcLex *l)
2901 bc_vec_free(&l->t.v);
2904 static void bc_lex_file(BcLex *l)
2906 G.err_line = l->line = 1;
2910 static BC_STATUS zbc_lex_token(BcLex *l);
2911 static BC_STATUS zdc_lex_token(BcLex *l);
2913 static BC_STATUS zcommon_lex_token(BcLex *l)
2916 IF_BC(RETURN_STATUS(zbc_lex_token(l));)
2918 IF_DC(RETURN_STATUS(zdc_lex_token(l));)
2921 static BC_STATUS zbc_lex_next(BcLex *l)
2926 if (l->t.last == BC_LEX_EOF) RETURN_STATUS(bc_error("end of file"));
2928 l->line += l->newline;
2929 G.err_line = l->line;
2930 l->t.t = BC_LEX_EOF;
2932 l->newline = (l->i == l->len);
2933 if (l->newline) RETURN_STATUS(BC_STATUS_SUCCESS);
2935 // Loop until failure or we don't have whitespace. This
2936 // is so the parser doesn't get inundated with whitespace.
2937 s = BC_STATUS_SUCCESS;
2939 //TODO: replace pointer with if(IS_BC)
2940 ERROR_RETURN(s =) zcommon_lex_token(l);
2941 } while (!s && l->t.t == BC_LEX_WHITESPACE);
2945 #if ERRORS_ARE_FATAL
2946 # define zbc_lex_next(...) (zbc_lex_next(__VA_ARGS__), BC_STATUS_SUCCESS)
2949 static BC_STATUS zbc_lex_text(BcLex *l, const char *text)
2953 l->len = strlen(text);
2954 l->t.t = l->t.last = BC_LEX_INVALID;
2955 RETURN_STATUS(zbc_lex_next(l));
2957 #if ERRORS_ARE_FATAL
2958 # define zbc_lex_text(...) (zbc_lex_text(__VA_ARGS__), BC_STATUS_SUCCESS)
2962 static BC_STATUS zbc_lex_identifier(BcLex *l)
2966 const char *buf = l->buf + l->i - 1;
2968 for (i = 0; i < ARRAY_SIZE(bc_lex_kws); ++i) {
2969 const char *keyword8 = bc_lex_kws[i].name8;
2971 while (buf[j] != '\0' && buf[j] == keyword8[j]) {
2973 if (j == 8) goto match;
2975 if (keyword8[j] != '\0')
2978 // buf starts with keyword bc_lex_kws[i]
2979 l->t.t = BC_LEX_KEY_1st_keyword + i;
2980 if (!bc_lex_kws_POSIX(i)) {
2981 s = bc_posix_error_fmt("%sthe '%.8s' keyword", "POSIX does not allow ", bc_lex_kws[i].name8);
2982 ERROR_RETURN(if (s) RETURN_STATUS(s);)
2985 // We minus 1 because the index has already been incremented.
2987 RETURN_STATUS(BC_STATUS_SUCCESS);
2992 if (l->t.v.len > 2) {
2995 // bc: POSIX only allows one character names; the following is bad: 'qwe=1
2997 unsigned len = strchrnul(buf, '\n') - buf;
2998 s = bc_posix_error_fmt("POSIX only allows one character names; the following is bad: '%.*s'", len, buf);
3003 #if ERRORS_ARE_FATAL
3004 # define zbc_lex_identifier(...) (zbc_lex_identifier(__VA_ARGS__), BC_STATUS_SUCCESS)
3007 static BC_STATUS zbc_lex_string(BcLex *l)
3009 size_t len, nls = 0, i = l->i;
3012 l->t.t = BC_LEX_STR;
3014 for (c = l->buf[i]; c != 0 && c != '"'; c = l->buf[++i])
3019 RETURN_STATUS(bc_error("string end could not be found"));
3023 // This check makes sense only if size_t is (much) larger than BC_MAX_STRING.
3024 if (SIZE_MAX > (BC_MAX_STRING | 0xff)) {
3025 if (len > BC_MAX_STRING)
3026 RETURN_STATUS(bc_error("string too long: must be [1,"BC_MAX_STRING_STR"]"));
3028 bc_vec_string(&l->t.v, len, l->buf + l->i);
3032 G.err_line = l->line;
3034 RETURN_STATUS(BC_STATUS_SUCCESS);
3036 #if ERRORS_ARE_FATAL
3037 # define zbc_lex_string(...) (zbc_lex_string(__VA_ARGS__), BC_STATUS_SUCCESS)
3040 static void bc_lex_assign(BcLex *l, BcLexType with, BcLexType without)
3042 if (l->buf[l->i] == '=') {
3050 static BC_STATUS zbc_lex_comment(BcLex *l)
3053 const char *buf = l->buf;
3055 l->t.t = BC_LEX_WHITESPACE;
3068 RETURN_STATUS(bc_error("comment end could not be found"));
3076 G.err_line = l->line;
3078 RETURN_STATUS(BC_STATUS_SUCCESS);
3080 #if ERRORS_ARE_FATAL
3081 # define zbc_lex_comment(...) (zbc_lex_comment(__VA_ARGS__), BC_STATUS_SUCCESS)
3084 static BC_STATUS zbc_lex_token(BcLex *l)
3086 BcStatus s = BC_STATUS_SUCCESS;
3087 char c = l->buf[l->i++], c2;
3089 // This is the workhorse of the lexer.
3094 l->t.t = !c ? BC_LEX_EOF : BC_LEX_NLINE;
3101 bc_lex_whitespace(l);
3104 bc_lex_assign(l, BC_LEX_OP_REL_NE, BC_LEX_OP_BOOL_NOT);
3105 if (l->t.t == BC_LEX_OP_BOOL_NOT) {
3106 s = bc_POSIX_does_not_allow_bool_ops_this_is_bad("!");
3107 ERROR_RETURN(if (s) RETURN_STATUS(s);)
3111 s = zbc_lex_string(l);
3114 s = bc_POSIX_does_not_allow("'#' script comments");
3115 ERROR_RETURN(if (s) RETURN_STATUS(s);)
3116 bc_lex_lineComment(l);
3119 bc_lex_assign(l, BC_LEX_OP_ASSIGN_MODULUS, BC_LEX_OP_MODULUS);
3124 s = bc_POSIX_does_not_allow_bool_ops_this_is_bad("&&");
3125 ERROR_RETURN(if (s) RETURN_STATUS(s);)
3127 l->t.t = BC_LEX_OP_BOOL_AND;
3129 l->t.t = BC_LEX_INVALID;
3130 s = bc_error_bad_character('&');
3135 l->t.t = (BcLexType)(c - '(' + BC_LEX_LPAREN);
3138 bc_lex_assign(l, BC_LEX_OP_ASSIGN_MULTIPLY, BC_LEX_OP_MULTIPLY);
3144 l->t.t = BC_LEX_OP_INC;
3146 bc_lex_assign(l, BC_LEX_OP_ASSIGN_PLUS, BC_LEX_OP_PLUS);
3149 l->t.t = BC_LEX_COMMA;
3155 l->t.t = BC_LEX_OP_DEC;
3157 bc_lex_assign(l, BC_LEX_OP_ASSIGN_MINUS, BC_LEX_OP_MINUS);
3160 if (isdigit(l->buf[l->i]))
3161 s = zbc_lex_number(l, c);
3163 l->t.t = BC_LEX_KEY_LAST;
3164 s = bc_POSIX_does_not_allow("a period ('.') as a shortcut for the last result");
3170 s = zbc_lex_comment(l);
3172 bc_lex_assign(l, BC_LEX_OP_ASSIGN_DIVIDE, BC_LEX_OP_DIVIDE);
3190 s = zbc_lex_number(l, c);
3193 l->t.t = BC_LEX_SCOLON;
3196 bc_lex_assign(l, BC_LEX_OP_REL_LE, BC_LEX_OP_REL_LT);
3199 bc_lex_assign(l, BC_LEX_OP_REL_EQ, BC_LEX_OP_ASSIGN);
3202 bc_lex_assign(l, BC_LEX_OP_REL_GE, BC_LEX_OP_REL_GT);
3206 l->t.t = (BcLexType)(c - '[' + BC_LEX_LBRACKET);
3209 if (l->buf[l->i] == '\n') {
3210 l->t.t = BC_LEX_WHITESPACE;
3213 s = bc_error_bad_character(c);
3216 bc_lex_assign(l, BC_LEX_OP_ASSIGN_POWER, BC_LEX_OP_POWER);
3244 s = zbc_lex_identifier(l);
3248 l->t.t = (BcLexType)(c - '{' + BC_LEX_LBRACE);
3253 s = bc_POSIX_does_not_allow_bool_ops_this_is_bad("||");
3254 ERROR_RETURN(if (s) RETURN_STATUS(s);)
3256 l->t.t = BC_LEX_OP_BOOL_OR;
3258 l->t.t = BC_LEX_INVALID;
3259 s = bc_error_bad_character(c);
3263 l->t.t = BC_LEX_INVALID;
3264 s = bc_error_bad_character(c);
3273 static BC_STATUS zdc_lex_register(BcLex *l)
3275 if (isspace(l->buf[l->i - 1])) {
3276 bc_lex_whitespace(l);
3279 RETURN_STATUS(bc_error("extended register"));
3283 bc_vec_pop_all(&l->t.v);
3284 bc_vec_push(&l->t.v, &l->buf[l->i - 1]);
3285 bc_vec_pushZeroByte(&l->t.v);
3286 l->t.t = BC_LEX_NAME;
3289 RETURN_STATUS(BC_STATUS_SUCCESS);
3291 #if ERRORS_ARE_FATAL
3292 # define zdc_lex_register(...) (zdc_lex_register(__VA_ARGS__), BC_STATUS_SUCCESS)
3295 static BC_STATUS zdc_lex_string(BcLex *l)
3297 size_t depth = 1, nls = 0, i = l->i;
3300 l->t.t = BC_LEX_STR;
3301 bc_vec_pop_all(&l->t.v);
3303 for (c = l->buf[i]; c != 0 && depth; c = l->buf[++i]) {
3305 depth += (c == '[' && (i == l->i || l->buf[i - 1] != '\\'));
3306 depth -= (c == ']' && (i == l->i || l->buf[i - 1] != '\\'));
3309 if (depth) bc_vec_push(&l->t.v, &c);
3314 RETURN_STATUS(bc_error("string end could not be found"));
3317 bc_vec_pushZeroByte(&l->t.v);
3318 // This check makes sense only if size_t is (much) larger than BC_MAX_STRING.
3319 if (SIZE_MAX > (BC_MAX_STRING | 0xff)) {
3320 if (i - l->i > BC_MAX_STRING)
3321 RETURN_STATUS(bc_error("string too long: must be [1,"BC_MAX_STRING_STR"]"));
3326 G.err_line = l->line;
3328 RETURN_STATUS(BC_STATUS_SUCCESS);
3330 #if ERRORS_ARE_FATAL
3331 # define zdc_lex_string(...) (zdc_lex_string(__VA_ARGS__), BC_STATUS_SUCCESS)
3334 static BC_STATUS zdc_lex_token(BcLex *l)
3336 BcStatus s = BC_STATUS_SUCCESS;
3337 char c = l->buf[l->i++], c2;
3340 for (i = 0; i < ARRAY_SIZE(dc_lex_regs); ++i) {
3341 if (l->t.last == dc_lex_regs[i])
3342 RETURN_STATUS(zdc_lex_register(l));
3345 if (c >= '%' && c <= '~'
3346 && (l->t.t = dc_lex_tokens[(c - '%')]) != BC_LEX_INVALID
3351 // This is the workhorse of the lexer.
3354 l->t.t = BC_LEX_EOF;
3362 l->newline = (c == '\n');
3363 bc_lex_whitespace(l);
3368 l->t.t = BC_LEX_OP_REL_NE;
3370 l->t.t = BC_LEX_OP_REL_LE;
3372 l->t.t = BC_LEX_OP_REL_GE;
3374 RETURN_STATUS(bc_error_bad_character(c));
3378 bc_lex_lineComment(l);
3381 if (isdigit(l->buf[l->i]))
3382 s = zbc_lex_number(l, c);
3384 s = bc_error_bad_character(c);
3402 s = zbc_lex_number(l, c);
3405 s = zdc_lex_string(l);
3408 l->t.t = BC_LEX_INVALID;
3409 s = bc_error_bad_character(c);
3417 static void bc_program_addFunc(char *name, size_t *idx);
3419 static void bc_parse_addFunc(BcParse *p, char *name, size_t *idx)
3421 bc_program_addFunc(name, idx);
3422 p->func = bc_program_func(p->fidx);
3425 #define bc_parse_push(p, i) bc_vec_pushByte(&(p)->func->code, (char) (i))
3427 static void bc_parse_pushName(BcParse *p, char *name)
3429 size_t i = 0, len = strlen(name);
3431 for (; i < len; ++i) bc_parse_push(p, name[i]);
3432 bc_parse_push(p, BC_PARSE_STREND);
3437 static void bc_parse_pushIndex(BcParse *p, size_t idx)
3442 mask = ((size_t)0xff) << (sizeof(idx) * 8 - 8);
3445 if (idx & mask) break;
3450 bc_parse_push(p, amt);
3453 bc_parse_push(p, (unsigned char)idx);
3458 static void bc_parse_number(BcParse *p, BcInst *prev, size_t *nexs)
3460 char *num = xstrdup(p->l.t.v.v);
3461 size_t idx = G.prog.consts.len;
3463 bc_vec_push(&G.prog.consts, &num);
3465 bc_parse_push(p, BC_INST_NUM);
3466 bc_parse_pushIndex(p, idx);
3469 (*prev) = BC_INST_NUM;
3472 static BC_STATUS zbc_parse_parse(BcParse *p);
3473 static BC_STATUS zdc_parse_parse(BcParse *p);
3475 static BC_STATUS zcommon_parse(BcParse *p)
3478 IF_BC(RETURN_STATUS(zbc_parse_parse(p));)
3480 IF_DC(RETURN_STATUS(zdc_parse_parse(p));)
3483 static BC_STATUS zbc_parse_text(BcParse *p, const char *text)
3487 p->func = bc_program_func(p->fidx);
3489 if (!text[0] && !BC_PARSE_CAN_EXEC(p)) {
3490 p->l.t.t = BC_LEX_INVALID;
3491 s = BC_STATUS_SUCCESS;
3492 ERROR_RETURN(s =) zcommon_parse(p);
3493 if (s) RETURN_STATUS(s);
3494 if (!BC_PARSE_CAN_EXEC(p))
3495 RETURN_STATUS(bc_error("file is not executable"));
3498 RETURN_STATUS(zbc_lex_text(&p->l, text));
3500 #if ERRORS_ARE_FATAL
3501 # define zbc_parse_text(...) (zbc_parse_text(__VA_ARGS__), BC_STATUS_SUCCESS)
3504 // Called when parsing or execution detects a failure,
3505 // resets execution structures.
3506 static void bc_program_reset(void)
3511 bc_vec_npop(&G.prog.stack, G.prog.stack.len - 1);
3512 bc_vec_pop_all(&G.prog.results);
3514 f = bc_program_func(0);
3515 ip = bc_vec_top(&G.prog.stack);
3516 ip->idx = f->code.len;
3519 #define bc_parse_updateFunc(p, f) \
3520 ((p)->func = bc_program_func((p)->fidx = (f)))
3522 // Called when zbc/zdc_parse_parse() detects a failure,
3523 // resets parsing structures.
3524 static void bc_parse_reset(BcParse *p)
3526 if (p->fidx != BC_PROG_MAIN) {
3527 p->func->nparams = 0;
3528 bc_vec_pop_all(&p->func->code);
3529 bc_vec_pop_all(&p->func->autos);
3530 bc_vec_pop_all(&p->func->labels);
3532 bc_parse_updateFunc(p, BC_PROG_MAIN);
3536 p->l.t.t = BC_LEX_EOF;
3537 p->auto_part = (p->nbraces = 0);
3539 bc_vec_npop(&p->flags, p->flags.len - 1);
3540 bc_vec_pop_all(&p->exits);
3541 bc_vec_pop_all(&p->conds);
3542 bc_vec_pop_all(&p->ops);
3547 static void bc_parse_free(BcParse *p)
3549 bc_vec_free(&p->flags);
3550 bc_vec_free(&p->exits);
3551 bc_vec_free(&p->conds);
3552 bc_vec_free(&p->ops);
3556 static void bc_parse_create(BcParse *p, size_t func)
3558 memset(p, 0, sizeof(BcParse));
3561 bc_vec_init(&p->flags, sizeof(uint8_t), NULL);
3562 bc_vec_init(&p->exits, sizeof(BcInstPtr), NULL);
3563 bc_vec_init(&p->conds, sizeof(size_t), NULL);
3564 bc_vec_pushZeroByte(&p->flags);
3565 bc_vec_init(&p->ops, sizeof(BcLexType), NULL);
3567 // p->auto_part = p->nbraces = 0; - already is
3568 bc_parse_updateFunc(p, func);
3573 #define BC_PARSE_TOP_OP(p) (*((BcLexType *) bc_vec_top(&(p)->ops)))
3574 #define BC_PARSE_LEAF(p, rparen) \
3575 (((p) >= BC_INST_NUM && (p) <= BC_INST_SQRT) || (rparen) || \
3576 (p) == BC_INST_INC_POST || (p) == BC_INST_DEC_POST)
3578 // We can calculate the conversion between tokens and exprs by subtracting the
3579 // position of the first operator in the lex enum and adding the position of the
3580 // first in the expr enum. Note: This only works for binary operators.
3581 #define BC_PARSE_TOKEN_INST(t) ((char) ((t) -BC_LEX_NEG + BC_INST_NEG))
3583 static BC_STATUS zbc_parse_else(BcParse *p);
3584 static BC_STATUS zbc_parse_stmt(BcParse *p);
3585 static BC_STATUS zbc_parse_expr(BcParse *p, uint8_t flags, BcParseNext next);
3586 static BcStatus bc_parse_expr_empty_ok(BcParse *p, uint8_t flags, BcParseNext next);
3587 #if ERRORS_ARE_FATAL
3588 # define zbc_parse_else(...) (zbc_parse_else(__VA_ARGS__), BC_STATUS_SUCCESS)
3589 # define zbc_parse_stmt(...) (zbc_parse_stmt(__VA_ARGS__), BC_STATUS_SUCCESS)
3590 # define zbc_parse_expr(...) (zbc_parse_expr(__VA_ARGS__), BC_STATUS_SUCCESS)
3593 static BC_STATUS zbc_parse_operator(BcParse *p, BcLexType type, size_t start,
3594 size_t *nexprs, bool next)
3596 BcStatus s = BC_STATUS_SUCCESS;
3598 char l, r = bc_parse_op_PREC(type - BC_LEX_OP_INC);
3599 bool left = bc_parse_op_LEFT(type - BC_LEX_OP_INC);
3601 while (p->ops.len > start) {
3603 t = BC_PARSE_TOP_OP(p);
3604 if (t == BC_LEX_LPAREN) break;
3606 l = bc_parse_op_PREC(t - BC_LEX_OP_INC);
3607 if (l >= r && (l != r || !left)) break;
3609 bc_parse_push(p, BC_PARSE_TOKEN_INST(t));
3610 bc_vec_pop(&p->ops);
3611 *nexprs -= t != BC_LEX_OP_BOOL_NOT && t != BC_LEX_NEG;
3614 bc_vec_push(&p->ops, &type);
3615 if (next) s = zbc_lex_next(&p->l);
3619 #if ERRORS_ARE_FATAL
3620 # define zbc_parse_operator(...) (zbc_parse_operator(__VA_ARGS__), BC_STATUS_SUCCESS)
3623 static BC_STATUS zbc_parse_rightParen(BcParse *p, size_t ops_bgn, size_t *nexs)
3627 if (p->ops.len <= ops_bgn)
3628 RETURN_STATUS(bc_error_bad_expression());
3629 top = BC_PARSE_TOP_OP(p);
3631 while (top != BC_LEX_LPAREN) {
3632 bc_parse_push(p, BC_PARSE_TOKEN_INST(top));
3634 bc_vec_pop(&p->ops);
3635 *nexs -= top != BC_LEX_OP_BOOL_NOT && top != BC_LEX_NEG;
3637 if (p->ops.len <= ops_bgn)
3638 RETURN_STATUS(bc_error_bad_expression());
3639 top = BC_PARSE_TOP_OP(p);
3642 bc_vec_pop(&p->ops);
3644 RETURN_STATUS(zbc_lex_next(&p->l));
3646 #if ERRORS_ARE_FATAL
3647 # define zbc_parse_rightParen(...) (zbc_parse_rightParen(__VA_ARGS__), BC_STATUS_SUCCESS)
3650 static BC_STATUS zbc_parse_params(BcParse *p, uint8_t flags)
3656 s = zbc_lex_next(&p->l);
3657 if (s) RETURN_STATUS(s);
3659 for (nparams = 0; p->l.t.t != BC_LEX_RPAREN; ++nparams) {
3660 flags = (flags & ~(BC_PARSE_PRINT | BC_PARSE_REL)) | BC_PARSE_ARRAY;
3661 s = zbc_parse_expr(p, flags, bc_parse_next_param);
3662 if (s) RETURN_STATUS(s);
3664 comma = p->l.t.t == BC_LEX_COMMA;
3666 s = zbc_lex_next(&p->l);
3667 if (s) RETURN_STATUS(s);
3671 if (comma) RETURN_STATUS(bc_error_bad_token());
3672 bc_parse_push(p, BC_INST_CALL);
3673 bc_parse_pushIndex(p, nparams);
3675 RETURN_STATUS(BC_STATUS_SUCCESS);
3677 #if ERRORS_ARE_FATAL
3678 # define zbc_parse_params(...) (zbc_parse_params(__VA_ARGS__), BC_STATUS_SUCCESS)
3681 static BC_STATUS zbc_parse_call(BcParse *p, char *name, uint8_t flags)
3684 BcId entry, *entry_ptr;
3689 s = zbc_parse_params(p, flags);
3692 if (p->l.t.t != BC_LEX_RPAREN) {
3693 s = bc_error_bad_token();
3697 idx = bc_map_index(&G.prog.fn_map, &entry);
3699 if (idx == BC_VEC_INVALID_IDX) {
3700 name = xstrdup(entry.name);
3701 bc_parse_addFunc(p, name, &idx);
3702 idx = bc_map_index(&G.prog.fn_map, &entry);
3707 entry_ptr = bc_vec_item(&G.prog.fn_map, idx);
3708 bc_parse_pushIndex(p, entry_ptr->idx);
3710 RETURN_STATUS(zbc_lex_next(&p->l));
3716 #if ERRORS_ARE_FATAL
3717 # define zbc_parse_call(...) (zbc_parse_call(__VA_ARGS__), BC_STATUS_SUCCESS)
3720 static BC_STATUS zbc_parse_name(BcParse *p, BcInst *type, uint8_t flags)
3725 name = xstrdup(p->l.t.v.v);
3726 s = zbc_lex_next(&p->l);
3729 if (p->l.t.t == BC_LEX_LBRACKET) {
3730 s = zbc_lex_next(&p->l);
3733 if (p->l.t.t == BC_LEX_RBRACKET) {
3734 if (!(flags & BC_PARSE_ARRAY)) {
3735 s = bc_error_bad_expression();
3738 *type = BC_INST_ARRAY;
3740 *type = BC_INST_ARRAY_ELEM;
3741 flags &= ~(BC_PARSE_PRINT | BC_PARSE_REL);
3742 s = zbc_parse_expr(p, flags, bc_parse_next_elem);
3745 s = zbc_lex_next(&p->l);
3747 bc_parse_push(p, *type);
3748 bc_parse_pushName(p, name);
3750 else if (p->l.t.t == BC_LEX_LPAREN) {
3751 if (flags & BC_PARSE_NOCALL) {
3752 s = bc_error_bad_token();
3755 *type = BC_INST_CALL;
3756 s = zbc_parse_call(p, name, flags);
3758 *type = BC_INST_VAR;
3759 bc_parse_push(p, BC_INST_VAR);
3760 bc_parse_pushName(p, name);
3769 #if ERRORS_ARE_FATAL
3770 # define zbc_parse_name(...) (zbc_parse_name(__VA_ARGS__), BC_STATUS_SUCCESS)
3773 static BC_STATUS zbc_parse_read(BcParse *p)
3777 s = zbc_lex_next(&p->l);
3778 if (s) RETURN_STATUS(s);
3779 if (p->l.t.t != BC_LEX_LPAREN) RETURN_STATUS(bc_error_bad_token());
3781 s = zbc_lex_next(&p->l);
3782 if (s) RETURN_STATUS(s);
3783 if (p->l.t.t != BC_LEX_RPAREN) RETURN_STATUS(bc_error_bad_token());
3785 bc_parse_push(p, BC_INST_READ);
3787 RETURN_STATUS(zbc_lex_next(&p->l));
3789 #if ERRORS_ARE_FATAL
3790 # define zbc_parse_read(...) (zbc_parse_read(__VA_ARGS__), BC_STATUS_SUCCESS)
3793 static BC_STATUS zbc_parse_builtin(BcParse *p, BcLexType type, uint8_t flags,
3798 s = zbc_lex_next(&p->l);
3799 if (s) RETURN_STATUS(s);
3800 if (p->l.t.t != BC_LEX_LPAREN) RETURN_STATUS(bc_error_bad_token());
3802 flags = (flags & ~(BC_PARSE_PRINT | BC_PARSE_REL)) | BC_PARSE_ARRAY;
3804 s = zbc_lex_next(&p->l);
3805 if (s) RETURN_STATUS(s);
3807 s = zbc_parse_expr(p, flags, bc_parse_next_rel);
3808 if (s) RETURN_STATUS(s);
3810 if (p->l.t.t != BC_LEX_RPAREN) RETURN_STATUS(bc_error_bad_token());
3812 *prev = (type == BC_LEX_KEY_LENGTH) ? BC_INST_LENGTH : BC_INST_SQRT;
3813 bc_parse_push(p, *prev);
3815 RETURN_STATUS(zbc_lex_next(&p->l));
3817 #if ERRORS_ARE_FATAL
3818 # define zbc_parse_builtin(...) (zbc_parse_builtin(__VA_ARGS__), BC_STATUS_SUCCESS)
3821 static BC_STATUS zbc_parse_scale(BcParse *p, BcInst *type, uint8_t flags)
3825 s = zbc_lex_next(&p->l);
3826 if (s) RETURN_STATUS(s);
3828 if (p->l.t.t != BC_LEX_LPAREN) {
3829 *type = BC_INST_SCALE;
3830 bc_parse_push(p, BC_INST_SCALE);
3831 RETURN_STATUS(BC_STATUS_SUCCESS);
3834 *type = BC_INST_SCALE_FUNC;
3835 flags &= ~(BC_PARSE_PRINT | BC_PARSE_REL);
3837 s = zbc_lex_next(&p->l);
3838 if (s) RETURN_STATUS(s);
3840 s = zbc_parse_expr(p, flags, bc_parse_next_rel);
3841 if (s) RETURN_STATUS(s);
3842 if (p->l.t.t != BC_LEX_RPAREN)
3843 RETURN_STATUS(bc_error_bad_token());
3844 bc_parse_push(p, BC_INST_SCALE_FUNC);
3846 RETURN_STATUS(zbc_lex_next(&p->l));
3848 #if ERRORS_ARE_FATAL
3849 # define zbc_parse_scale(...) (zbc_parse_scale(__VA_ARGS__), BC_STATUS_SUCCESS)
3852 static BC_STATUS zbc_parse_incdec(BcParse *p, BcInst *prev, bool *paren_expr,
3853 size_t *nexprs, uint8_t flags)
3858 BcInst etype = *prev;
3860 if (etype == BC_INST_VAR || etype == BC_INST_ARRAY_ELEM ||
3861 etype == BC_INST_SCALE || etype == BC_INST_LAST ||
3862 etype == BC_INST_IBASE || etype == BC_INST_OBASE)
3864 *prev = inst = BC_INST_INC_POST + (p->l.t.t != BC_LEX_OP_INC);
3865 bc_parse_push(p, inst);
3866 s = zbc_lex_next(&p->l);
3869 *prev = inst = BC_INST_INC_PRE + (p->l.t.t != BC_LEX_OP_INC);
3872 s = zbc_lex_next(&p->l);
3873 if (s) RETURN_STATUS(s);
3876 // Because we parse the next part of the expression
3877 // right here, we need to increment this.
3878 *nexprs = *nexprs + 1;
3882 s = zbc_parse_name(p, prev, flags | BC_PARSE_NOCALL);
3884 case BC_LEX_KEY_IBASE:
3885 case BC_LEX_KEY_LAST:
3886 case BC_LEX_KEY_OBASE:
3887 bc_parse_push(p, type - BC_LEX_KEY_IBASE + BC_INST_IBASE);
3888 s = zbc_lex_next(&p->l);
3890 case BC_LEX_KEY_SCALE:
3891 s = zbc_lex_next(&p->l);
3892 if (s) RETURN_STATUS(s);
3893 if (p->l.t.t == BC_LEX_LPAREN)
3894 s = bc_error_bad_token();
3896 bc_parse_push(p, BC_INST_SCALE);
3899 s = bc_error_bad_token();
3903 if (!s) bc_parse_push(p, inst);
3908 #if ERRORS_ARE_FATAL
3909 # define zbc_parse_incdec(...) (zbc_parse_incdec(__VA_ARGS__), BC_STATUS_SUCCESS)
3912 static BC_STATUS zbc_parse_minus(BcParse *p, BcInst *prev, size_t ops_bgn,
3913 bool rparen, size_t *nexprs)
3917 BcInst etype = *prev;
3919 s = zbc_lex_next(&p->l);
3920 if (s) RETURN_STATUS(s);
3922 type = rparen || etype == BC_INST_INC_POST || etype == BC_INST_DEC_POST ||
3923 (etype >= BC_INST_NUM && etype <= BC_INST_SQRT) ?
3926 *prev = BC_PARSE_TOKEN_INST(type);
3928 // We can just push onto the op stack because this is the largest
3929 // precedence operator that gets pushed. Inc/dec does not.
3930 if (type != BC_LEX_OP_MINUS)
3931 bc_vec_push(&p->ops, &type);
3933 s = zbc_parse_operator(p, type, ops_bgn, nexprs, false);
3937 #if ERRORS_ARE_FATAL
3938 # define zbc_parse_minus(...) (zbc_parse_minus(__VA_ARGS__), BC_STATUS_SUCCESS)
3941 static BC_STATUS zbc_parse_string(BcParse *p, char inst)
3943 char *str = xstrdup(p->l.t.v.v);
3945 bc_parse_push(p, BC_INST_STR);
3946 bc_parse_pushIndex(p, G.prog.strs.len);
3947 bc_vec_push(&G.prog.strs, &str);
3948 bc_parse_push(p, inst);
3950 RETURN_STATUS(zbc_lex_next(&p->l));
3952 #if ERRORS_ARE_FATAL
3953 # define zbc_parse_string(...) (zbc_parse_string(__VA_ARGS__), BC_STATUS_SUCCESS)
3956 static BC_STATUS zbc_parse_print(BcParse *p)
3962 s = zbc_lex_next(&p->l);
3963 if (s) RETURN_STATUS(s);
3967 if (type == BC_LEX_SCOLON || type == BC_LEX_NLINE)
3968 RETURN_STATUS(bc_error("bad print statement"));
3971 while (type != BC_LEX_SCOLON && type != BC_LEX_NLINE) {
3972 if (type == BC_LEX_STR) {
3973 s = zbc_parse_string(p, BC_INST_PRINT_POP);
3974 if (s) RETURN_STATUS(s);
3976 s = zbc_parse_expr(p, 0, bc_parse_next_print);
3977 if (s) RETURN_STATUS(s);
3978 bc_parse_push(p, BC_INST_PRINT_POP);
3981 comma = p->l.t.t == BC_LEX_COMMA;
3983 s = zbc_lex_next(&p->l);
3984 if (s) RETURN_STATUS(s);
3989 if (comma) RETURN_STATUS(bc_error_bad_token());
3991 RETURN_STATUS(zbc_lex_next(&p->l));
3993 #if ERRORS_ARE_FATAL
3994 # define zbc_parse_print(...) (zbc_parse_print(__VA_ARGS__), BC_STATUS_SUCCESS)
3997 static BC_STATUS zbc_parse_return(BcParse *p)
4003 if (!BC_PARSE_FUNC(p)) RETURN_STATUS(bc_error_bad_token());
4005 s = zbc_lex_next(&p->l);
4006 if (s) RETURN_STATUS(s);
4009 paren = t == BC_LEX_LPAREN;
4011 if (t == BC_LEX_NLINE || t == BC_LEX_SCOLON)
4012 bc_parse_push(p, BC_INST_RET0);
4014 s = bc_parse_expr_empty_ok(p, 0, bc_parse_next_expr);
4015 if (s == BC_STATUS_PARSE_EMPTY_EXP) {
4016 bc_parse_push(p, BC_INST_RET0);
4017 s = zbc_lex_next(&p->l);
4019 if (s) RETURN_STATUS(s);
4021 if (!paren || p->l.t.last != BC_LEX_RPAREN) {
4022 s = bc_POSIX_requires("parentheses around return expressions");
4023 ERROR_RETURN(if (s) RETURN_STATUS(s);)
4026 bc_parse_push(p, BC_INST_RET);
4031 #if ERRORS_ARE_FATAL
4032 # define zbc_parse_return(...) (zbc_parse_return(__VA_ARGS__), BC_STATUS_SUCCESS)
4035 static BC_STATUS zbc_parse_endBody(BcParse *p, bool brace)
4037 BcStatus s = BC_STATUS_SUCCESS;
4039 if (p->flags.len <= 1 || (brace && p->nbraces == 0))
4040 RETURN_STATUS(bc_error_bad_token());
4043 if (p->l.t.t != BC_LEX_RBRACE)
4044 RETURN_STATUS(bc_error_bad_token());
4046 RETURN_STATUS(bc_error_bad_token());
4048 s = zbc_lex_next(&p->l);
4049 if (s) RETURN_STATUS(s);
4052 if (BC_PARSE_IF(p)) {
4055 while (p->l.t.t == BC_LEX_NLINE) {
4056 s = zbc_lex_next(&p->l);
4057 if (s) RETURN_STATUS(s);
4060 bc_vec_pop(&p->flags);
4062 flag_ptr = BC_PARSE_TOP_FLAG_PTR(p);
4063 *flag_ptr = (*flag_ptr | BC_PARSE_FLAG_IF_END);
4065 if (p->l.t.t == BC_LEX_KEY_ELSE)
4066 s = zbc_parse_else(p);
4068 else if (BC_PARSE_ELSE(p)) {
4072 bc_vec_pop(&p->flags);
4074 ip = bc_vec_top(&p->exits);
4075 label = bc_vec_item(&p->func->labels, ip->idx);
4076 *label = p->func->code.len;
4078 bc_vec_pop(&p->exits);
4080 else if (BC_PARSE_FUNC_INNER(p)) {
4081 bc_parse_push(p, BC_INST_RET0);
4082 bc_parse_updateFunc(p, BC_PROG_MAIN);
4083 bc_vec_pop(&p->flags);
4086 BcInstPtr *ip = bc_vec_top(&p->exits);
4087 size_t *label = bc_vec_top(&p->conds);
4089 bc_parse_push(p, BC_INST_JUMP);
4090 bc_parse_pushIndex(p, *label);
4092 label = bc_vec_item(&p->func->labels, ip->idx);
4093 *label = p->func->code.len;
4095 bc_vec_pop(&p->flags);
4096 bc_vec_pop(&p->exits);
4097 bc_vec_pop(&p->conds);
4102 #if ERRORS_ARE_FATAL
4103 # define zbc_parse_endBody(...) (zbc_parse_endBody(__VA_ARGS__), BC_STATUS_SUCCESS)
4106 static void bc_parse_startBody(BcParse *p, uint8_t flags)
4108 uint8_t *flag_ptr = BC_PARSE_TOP_FLAG_PTR(p);
4109 flags |= (*flag_ptr & (BC_PARSE_FLAG_FUNC | BC_PARSE_FLAG_LOOP));
4110 flags |= BC_PARSE_FLAG_BODY;
4111 bc_vec_push(&p->flags, &flags);
4114 static void bc_parse_noElse(BcParse *p)
4118 uint8_t *flag_ptr = BC_PARSE_TOP_FLAG_PTR(p);
4120 *flag_ptr = (*flag_ptr & ~(BC_PARSE_FLAG_IF_END));
4122 ip = bc_vec_top(&p->exits);
4123 label = bc_vec_item(&p->func->labels, ip->idx);
4124 *label = p->func->code.len;
4126 bc_vec_pop(&p->exits);
4129 static BC_STATUS zbc_parse_if(BcParse *p)
4134 s = zbc_lex_next(&p->l);
4135 if (s) RETURN_STATUS(s);
4136 if (p->l.t.t != BC_LEX_LPAREN) RETURN_STATUS(bc_error_bad_token());
4138 s = zbc_lex_next(&p->l);
4139 if (s) RETURN_STATUS(s);
4140 s = zbc_parse_expr(p, BC_PARSE_REL, bc_parse_next_rel);
4141 if (s) RETURN_STATUS(s);
4142 if (p->l.t.t != BC_LEX_RPAREN) RETURN_STATUS(bc_error_bad_token());
4144 s = zbc_lex_next(&p->l);
4145 if (s) RETURN_STATUS(s);
4146 bc_parse_push(p, BC_INST_JUMP_ZERO);
4148 ip.idx = p->func->labels.len;
4149 ip.func = ip.len = 0;
4151 bc_parse_pushIndex(p, ip.idx);
4152 bc_vec_push(&p->exits, &ip);
4153 bc_vec_push(&p->func->labels, &ip.idx);
4154 bc_parse_startBody(p, BC_PARSE_FLAG_IF);
4156 RETURN_STATUS(BC_STATUS_SUCCESS);
4158 #if ERRORS_ARE_FATAL
4159 # define zbc_parse_if(...) (zbc_parse_if(__VA_ARGS__), BC_STATUS_SUCCESS)
4162 #undef zbc_parse_else
4163 static BC_STATUS zbc_parse_else(BcParse *p)
4167 if (!BC_PARSE_IF_END(p)) RETURN_STATUS(bc_error_bad_token());
4169 ip.idx = p->func->labels.len;
4170 ip.func = ip.len = 0;
4172 bc_parse_push(p, BC_INST_JUMP);
4173 bc_parse_pushIndex(p, ip.idx);
4177 bc_vec_push(&p->exits, &ip);
4178 bc_vec_push(&p->func->labels, &ip.idx);
4179 bc_parse_startBody(p, BC_PARSE_FLAG_ELSE);
4181 RETURN_STATUS(zbc_lex_next(&p->l));
4183 #if ERRORS_ARE_FATAL
4184 # define zbc_parse_else(...) (zbc_parse_else(__VA_ARGS__), BC_STATUS_SUCCESS)
4187 static BC_STATUS zbc_parse_while(BcParse *p)
4192 s = zbc_lex_next(&p->l);
4193 if (s) RETURN_STATUS(s);
4194 if (p->l.t.t != BC_LEX_LPAREN) RETURN_STATUS(bc_error_bad_token());
4195 s = zbc_lex_next(&p->l);
4196 if (s) RETURN_STATUS(s);
4198 ip.idx = p->func->labels.len;
4200 bc_vec_push(&p->func->labels, &p->func->code.len);
4201 bc_vec_push(&p->conds, &ip.idx);
4203 ip.idx = p->func->labels.len;
4207 bc_vec_push(&p->exits, &ip);
4208 bc_vec_push(&p->func->labels, &ip.idx);
4210 s = zbc_parse_expr(p, BC_PARSE_REL, bc_parse_next_rel);
4211 if (s) RETURN_STATUS(s);
4212 if (p->l.t.t != BC_LEX_RPAREN) RETURN_STATUS(bc_error_bad_token());
4213 s = zbc_lex_next(&p->l);
4214 if (s) RETURN_STATUS(s);
4216 bc_parse_push(p, BC_INST_JUMP_ZERO);
4217 bc_parse_pushIndex(p, ip.idx);
4218 bc_parse_startBody(p, BC_PARSE_FLAG_LOOP | BC_PARSE_FLAG_LOOP_INNER);
4220 RETURN_STATUS(BC_STATUS_SUCCESS);
4222 #if ERRORS_ARE_FATAL
4223 # define zbc_parse_while(...) (zbc_parse_while(__VA_ARGS__), BC_STATUS_SUCCESS)
4226 static BC_STATUS zbc_parse_for(BcParse *p)
4230 size_t cond_idx, exit_idx, body_idx, update_idx;
4232 s = zbc_lex_next(&p->l);
4233 if (s) RETURN_STATUS(s);
4234 if (p->l.t.t != BC_LEX_LPAREN) RETURN_STATUS(bc_error_bad_token());
4235 s = zbc_lex_next(&p->l);
4236 if (s) RETURN_STATUS(s);
4238 if (p->l.t.t != BC_LEX_SCOLON)
4239 s = zbc_parse_expr(p, 0, bc_parse_next_for);
4241 s = bc_POSIX_does_not_allow_empty_X_expression_in_for("init");
4243 if (s) RETURN_STATUS(s);
4244 if (p->l.t.t != BC_LEX_SCOLON) RETURN_STATUS(bc_error_bad_token());
4245 s = zbc_lex_next(&p->l);
4246 if (s) RETURN_STATUS(s);
4248 cond_idx = p->func->labels.len;
4249 update_idx = cond_idx + 1;
4250 body_idx = update_idx + 1;
4251 exit_idx = body_idx + 1;
4253 bc_vec_push(&p->func->labels, &p->func->code.len);
4255 if (p->l.t.t != BC_LEX_SCOLON)
4256 s = zbc_parse_expr(p, BC_PARSE_REL, bc_parse_next_for);
4258 s = bc_POSIX_does_not_allow_empty_X_expression_in_for("condition");
4260 if (s) RETURN_STATUS(s);
4261 if (p->l.t.t != BC_LEX_SCOLON) RETURN_STATUS(bc_error_bad_token());
4263 s = zbc_lex_next(&p->l);
4264 if (s) RETURN_STATUS(s);
4266 bc_parse_push(p, BC_INST_JUMP_ZERO);
4267 bc_parse_pushIndex(p, exit_idx);
4268 bc_parse_push(p, BC_INST_JUMP);
4269 bc_parse_pushIndex(p, body_idx);
4271 ip.idx = p->func->labels.len;
4273 bc_vec_push(&p->conds, &update_idx);
4274 bc_vec_push(&p->func->labels, &p->func->code.len);
4276 if (p->l.t.t != BC_LEX_RPAREN)
4277 s = zbc_parse_expr(p, 0, bc_parse_next_rel);
4279 s = bc_POSIX_does_not_allow_empty_X_expression_in_for("update");
4281 if (s) RETURN_STATUS(s);
4283 if (p->l.t.t != BC_LEX_RPAREN) RETURN_STATUS(bc_error_bad_token());
4284 bc_parse_push(p, BC_INST_JUMP);
4285 bc_parse_pushIndex(p, cond_idx);
4286 bc_vec_push(&p->func->labels, &p->func->code.len);
4292 bc_vec_push(&p->exits, &ip);
4293 bc_vec_push(&p->func->labels, &ip.idx);
4294 s = zbc_lex_next(&p->l);
4295 if (s) RETURN_STATUS(s);
4296 bc_parse_startBody(p, BC_PARSE_FLAG_LOOP | BC_PARSE_FLAG_LOOP_INNER);
4298 RETURN_STATUS(BC_STATUS_SUCCESS);
4300 #if ERRORS_ARE_FATAL
4301 # define zbc_parse_for(...) (zbc_parse_for(__VA_ARGS__), BC_STATUS_SUCCESS)
4304 static BC_STATUS zbc_parse_loopExit(BcParse *p, BcLexType type)
4310 if (!BC_PARSE_LOOP(p)) RETURN_STATUS(bc_error_bad_token());
4312 if (type == BC_LEX_KEY_BREAK) {
4313 if (p->exits.len == 0) RETURN_STATUS(bc_error_bad_token());
4315 i = p->exits.len - 1;
4316 ip = bc_vec_item(&p->exits, i);
4318 while (!ip->func && i < p->exits.len)
4319 ip = bc_vec_item(&p->exits, i--);
4320 if (i >= p->exits.len && !ip->func)
4321 RETURN_STATUS(bc_error_bad_token());
4326 i = *((size_t *) bc_vec_top(&p->conds));
4328 bc_parse_push(p, BC_INST_JUMP);
4329 bc_parse_pushIndex(p, i);
4331 s = zbc_lex_next(&p->l);
4332 if (s) RETURN_STATUS(s);
4334 if (p->l.t.t != BC_LEX_SCOLON && p->l.t.t != BC_LEX_NLINE)
4335 RETURN_STATUS(bc_error_bad_token());
4337 RETURN_STATUS(zbc_lex_next(&p->l));
4339 #if ERRORS_ARE_FATAL
4340 # define zbc_parse_loopExit(...) (zbc_parse_loopExit(__VA_ARGS__), BC_STATUS_SUCCESS)
4343 static BC_STATUS zbc_parse_func(BcParse *p)
4346 bool var, comma = false;
4350 s = zbc_lex_next(&p->l);
4351 if (s) RETURN_STATUS(s);
4352 if (p->l.t.t != BC_LEX_NAME)
4353 RETURN_STATUS(bc_error("bad function definition"));
4355 name = xstrdup(p->l.t.v.v);
4356 bc_parse_addFunc(p, name, &p->fidx);
4358 s = zbc_lex_next(&p->l);
4359 if (s) RETURN_STATUS(s);
4360 if (p->l.t.t != BC_LEX_LPAREN)
4361 RETURN_STATUS(bc_error("bad function definition"));
4362 s = zbc_lex_next(&p->l);
4363 if (s) RETURN_STATUS(s);
4365 while (p->l.t.t != BC_LEX_RPAREN) {
4366 if (p->l.t.t != BC_LEX_NAME)
4367 RETURN_STATUS(bc_error("bad function definition"));
4371 name = xstrdup(p->l.t.v.v);
4372 s = zbc_lex_next(&p->l);
4375 var = p->l.t.t != BC_LEX_LBRACKET;
4378 s = zbc_lex_next(&p->l);
4381 if (p->l.t.t != BC_LEX_RBRACKET) {
4382 s = bc_error("bad function definition");
4386 s = zbc_lex_next(&p->l);
4390 comma = p->l.t.t == BC_LEX_COMMA;
4392 s = zbc_lex_next(&p->l);
4396 s = zbc_func_insert(p->func, name, var);
4400 if (comma) RETURN_STATUS(bc_error("bad function definition"));
4402 flags = BC_PARSE_FLAG_FUNC | BC_PARSE_FLAG_FUNC_INNER | BC_PARSE_FLAG_BODY;
4403 bc_parse_startBody(p, flags);
4405 s = zbc_lex_next(&p->l);
4406 if (s) RETURN_STATUS(s);
4408 if (p->l.t.t != BC_LEX_LBRACE)
4409 s = bc_POSIX_requires("the left brace be on the same line as the function header");
4417 #if ERRORS_ARE_FATAL
4418 # define zbc_parse_func(...) (zbc_parse_func(__VA_ARGS__), BC_STATUS_SUCCESS)
4421 static BC_STATUS zbc_parse_auto(BcParse *p)
4424 bool comma, var, one;
4427 if (!p->auto_part) RETURN_STATUS(bc_error_bad_token());
4429 s = zbc_lex_next(&p->l);
4430 if (s) RETURN_STATUS(s);
4432 p->auto_part = comma = false;
4433 one = p->l.t.t == BC_LEX_NAME;
4435 while (p->l.t.t == BC_LEX_NAME) {
4436 name = xstrdup(p->l.t.v.v);
4437 s = zbc_lex_next(&p->l);
4440 var = p->l.t.t != BC_LEX_LBRACKET;
4442 s = zbc_lex_next(&p->l);
4445 if (p->l.t.t != BC_LEX_RBRACKET) {
4446 s = bc_error("bad function definition");
4450 s = zbc_lex_next(&p->l);
4454 comma = p->l.t.t == BC_LEX_COMMA;
4456 s = zbc_lex_next(&p->l);
4460 s = zbc_func_insert(p->func, name, var);
4464 if (comma) RETURN_STATUS(bc_error("bad function definition"));
4465 if (!one) RETURN_STATUS(bc_error("no auto variable found"));
4467 if (p->l.t.t != BC_LEX_NLINE && p->l.t.t != BC_LEX_SCOLON)
4468 RETURN_STATUS(bc_error_bad_token());
4470 RETURN_STATUS(zbc_lex_next(&p->l));
4476 #if ERRORS_ARE_FATAL
4477 # define zbc_parse_auto(...) (zbc_parse_auto(__VA_ARGS__), BC_STATUS_SUCCESS)
4480 static BC_STATUS zbc_parse_body(BcParse *p, bool brace)
4482 BcStatus s = BC_STATUS_SUCCESS;
4483 uint8_t *flag_ptr = bc_vec_top(&p->flags);
4485 *flag_ptr &= ~(BC_PARSE_FLAG_BODY);
4487 if (*flag_ptr & BC_PARSE_FLAG_FUNC_INNER) {
4488 if (!brace) RETURN_STATUS(bc_error_bad_token());
4490 p->auto_part = p->l.t.t != BC_LEX_KEY_AUTO;
4492 if (!p->auto_part) {
4493 s = zbc_parse_auto(p);
4494 if (s) RETURN_STATUS(s);
4497 if (p->l.t.t == BC_LEX_NLINE) s = zbc_lex_next(&p->l);
4500 s = zbc_parse_stmt(p);
4501 if (!s && !brace) s = zbc_parse_endBody(p, false);
4506 #if ERRORS_ARE_FATAL
4507 # define zbc_parse_body(...) (zbc_parse_body(__VA_ARGS__), BC_STATUS_SUCCESS)
4510 #undef zbc_parse_stmt
4511 static BC_STATUS zbc_parse_stmt(BcParse *p)
4513 BcStatus s = BC_STATUS_SUCCESS;
4517 RETURN_STATUS(zbc_lex_next(&p->l));
4519 case BC_LEX_KEY_ELSE:
4520 p->auto_part = false;
4524 if (!BC_PARSE_BODY(p)) RETURN_STATUS(bc_error_bad_token());
4526 s = zbc_lex_next(&p->l);
4527 if (s) RETURN_STATUS(s);
4528 RETURN_STATUS(zbc_parse_body(p, true));
4530 case BC_LEX_KEY_AUTO:
4531 RETURN_STATUS(zbc_parse_auto(p));
4534 p->auto_part = false;
4535 if (BC_PARSE_IF_END(p)) {
4537 RETURN_STATUS(BC_STATUS_SUCCESS);
4539 if (BC_PARSE_BODY(p))
4540 RETURN_STATUS(zbc_parse_body(p, false));
4547 case BC_LEX_OP_MINUS:
4548 case BC_LEX_OP_BOOL_NOT:
4552 case BC_LEX_KEY_IBASE:
4553 case BC_LEX_KEY_LAST:
4554 case BC_LEX_KEY_LENGTH:
4555 case BC_LEX_KEY_OBASE:
4556 case BC_LEX_KEY_READ:
4557 case BC_LEX_KEY_SCALE:
4558 case BC_LEX_KEY_SQRT:
4559 s = zbc_parse_expr(p, BC_PARSE_PRINT, bc_parse_next_expr);
4561 case BC_LEX_KEY_ELSE:
4562 s = zbc_parse_else(p);
4565 while (!s && p->l.t.t == BC_LEX_SCOLON) s = zbc_lex_next(&p->l);
4568 s = zbc_parse_endBody(p, true);
4571 s = zbc_parse_string(p, BC_INST_PRINT_STR);
4573 case BC_LEX_KEY_BREAK:
4574 case BC_LEX_KEY_CONTINUE:
4575 s = zbc_parse_loopExit(p, p->l.t.t);
4577 case BC_LEX_KEY_FOR:
4578 s = zbc_parse_for(p);
4580 case BC_LEX_KEY_HALT:
4581 bc_parse_push(p, BC_INST_HALT);
4582 s = zbc_lex_next(&p->l);
4585 s = zbc_parse_if(p);
4587 case BC_LEX_KEY_LIMITS:
4588 // "limits" is a compile-time command,
4589 // the output is produced at _parse time_.
4590 s = zbc_lex_next(&p->l);
4591 if (s) RETURN_STATUS(s);
4593 "BC_BASE_MAX = "BC_MAX_OBASE_STR "\n"
4594 "BC_DIM_MAX = "BC_MAX_DIM_STR "\n"
4595 "BC_SCALE_MAX = "BC_MAX_SCALE_STR "\n"
4596 "BC_STRING_MAX = "BC_MAX_STRING_STR"\n"
4597 "BC_NAME_MAX = "BC_MAX_NAME_STR "\n"
4598 "BC_NUM_MAX = "BC_MAX_NUM_STR "\n"
4599 "MAX Exponent = "BC_MAX_EXP_STR "\n"
4600 "Number of vars = "BC_MAX_VARS_STR "\n"
4603 case BC_LEX_KEY_PRINT:
4604 s = zbc_parse_print(p);
4606 case BC_LEX_KEY_QUIT:
4607 // "quit" is a compile-time command. For example,
4608 // "if (0 == 1) quit" terminates when parsing the statement,
4609 // not when it is executed
4610 QUIT_OR_RETURN_TO_MAIN;
4611 case BC_LEX_KEY_RETURN:
4612 s = zbc_parse_return(p);
4614 case BC_LEX_KEY_WHILE:
4615 s = zbc_parse_while(p);
4618 s = bc_error_bad_token();
4624 #if ERRORS_ARE_FATAL
4625 # define zbc_parse_stmt(...) (zbc_parse_stmt(__VA_ARGS__), BC_STATUS_SUCCESS)
4628 static BC_STATUS zbc_parse_parse(BcParse *p)
4632 if (p->l.t.t == BC_LEX_EOF)
4633 s = p->flags.len > 0 ? bc_error("block end could not be found") : bc_error("end of file");
4634 else if (p->l.t.t == BC_LEX_KEY_DEFINE) {
4635 if (!BC_PARSE_CAN_EXEC(p))
4636 RETURN_STATUS(bc_error_bad_token());
4637 s = zbc_parse_func(p);
4639 s = zbc_parse_stmt(p);
4641 if (s || G_interrupt) {
4643 s = BC_STATUS_FAILURE;
4648 #if ERRORS_ARE_FATAL
4649 # define zbc_parse_parse(...) (zbc_parse_parse(__VA_ARGS__), BC_STATUS_SUCCESS)
4652 // This is not a "z" function: can also return BC_STATUS_PARSE_EMPTY_EXP
4653 static BcStatus bc_parse_expr_empty_ok(BcParse *p, uint8_t flags, BcParseNext next)
4655 BcStatus s = BC_STATUS_SUCCESS;
4656 BcInst prev = BC_INST_PRINT;
4657 BcLexType top, t = p->l.t.t;
4658 size_t nexprs = 0, ops_bgn = p->ops.len;
4659 unsigned nparens, nrelops;
4660 bool paren_first, paren_expr, rprn, done, get_token, assign, bin_last;
4662 paren_first = p->l.t.t == BC_LEX_LPAREN;
4663 nparens = nrelops = 0;
4664 paren_expr = rprn = done = get_token = assign = false;
4667 for (; !G_interrupt && !s && !done && bc_parse_exprs(t); t = p->l.t.t) {
4673 s = zbc_parse_incdec(p, &prev, &paren_expr, &nexprs, flags);
4674 rprn = get_token = bin_last = false;
4678 case BC_LEX_OP_MINUS:
4680 s = zbc_parse_minus(p, &prev, ops_bgn, rprn, &nexprs);
4681 rprn = get_token = false;
4682 bin_last = prev == BC_INST_MINUS;
4686 case BC_LEX_OP_ASSIGN_POWER:
4687 case BC_LEX_OP_ASSIGN_MULTIPLY:
4688 case BC_LEX_OP_ASSIGN_DIVIDE:
4689 case BC_LEX_OP_ASSIGN_MODULUS:
4690 case BC_LEX_OP_ASSIGN_PLUS:
4691 case BC_LEX_OP_ASSIGN_MINUS:
4692 case BC_LEX_OP_ASSIGN:
4694 if (prev != BC_INST_VAR && prev != BC_INST_ARRAY_ELEM &&
4695 prev != BC_INST_SCALE && prev != BC_INST_IBASE &&
4696 prev != BC_INST_OBASE && prev != BC_INST_LAST)
4698 s = bc_error("bad assignment:"
4699 " left side must be scale,"
4700 " ibase, obase, last, var,"
4707 case BC_LEX_OP_POWER:
4708 case BC_LEX_OP_MULTIPLY:
4709 case BC_LEX_OP_DIVIDE:
4710 case BC_LEX_OP_MODULUS:
4711 case BC_LEX_OP_PLUS:
4712 case BC_LEX_OP_REL_EQ:
4713 case BC_LEX_OP_REL_LE:
4714 case BC_LEX_OP_REL_GE:
4715 case BC_LEX_OP_REL_NE:
4716 case BC_LEX_OP_REL_LT:
4717 case BC_LEX_OP_REL_GT:
4718 case BC_LEX_OP_BOOL_NOT:
4719 case BC_LEX_OP_BOOL_OR:
4720 case BC_LEX_OP_BOOL_AND:
4722 if (((t == BC_LEX_OP_BOOL_NOT) != bin_last)
4723 || (t != BC_LEX_OP_BOOL_NOT && prev == BC_INST_BOOL_NOT)
4725 return bc_error_bad_expression();
4728 nrelops += t >= BC_LEX_OP_REL_EQ && t <= BC_LEX_OP_REL_GT;
4729 prev = BC_PARSE_TOKEN_INST(t);
4730 s = zbc_parse_operator(p, t, ops_bgn, &nexprs, true);
4731 rprn = get_token = false;
4732 bin_last = t != BC_LEX_OP_BOOL_NOT;
4739 if (BC_PARSE_LEAF(prev, rprn))
4740 return bc_error_bad_expression();
4742 paren_expr = rprn = bin_last = false;
4744 bc_vec_push(&p->ops, &t);
4751 if (bin_last || prev == BC_INST_BOOL_NOT)
4752 return bc_error_bad_expression();
4755 s = BC_STATUS_SUCCESS;
4760 else if (!paren_expr)
4761 return BC_STATUS_PARSE_EMPTY_EXP;
4764 paren_expr = rprn = true;
4765 get_token = bin_last = false;
4767 s = zbc_parse_rightParen(p, ops_bgn, &nexprs);
4774 if (BC_PARSE_LEAF(prev, rprn))
4775 return bc_error_bad_expression();
4777 rprn = get_token = bin_last = false;
4778 s = zbc_parse_name(p, &prev, flags & ~BC_PARSE_NOCALL);
4786 if (BC_PARSE_LEAF(prev, rprn))
4787 return bc_error_bad_expression();
4788 bc_parse_number(p, &prev, &nexprs);
4789 paren_expr = get_token = true;
4790 rprn = bin_last = false;
4795 case BC_LEX_KEY_IBASE:
4796 case BC_LEX_KEY_LAST:
4797 case BC_LEX_KEY_OBASE:
4799 if (BC_PARSE_LEAF(prev, rprn))
4800 return bc_error_bad_expression();
4801 prev = (char) (t - BC_LEX_KEY_IBASE + BC_INST_IBASE);
4802 bc_parse_push(p, (char) prev);
4804 paren_expr = get_token = true;
4805 rprn = bin_last = false;
4811 case BC_LEX_KEY_LENGTH:
4812 case BC_LEX_KEY_SQRT:
4814 if (BC_PARSE_LEAF(prev, rprn))
4815 return bc_error_bad_expression();
4816 s = zbc_parse_builtin(p, t, flags, &prev);
4818 rprn = get_token = bin_last = false;
4824 case BC_LEX_KEY_READ:
4826 if (BC_PARSE_LEAF(prev, rprn))
4827 return bc_error_bad_expression();
4828 else if (flags & BC_PARSE_NOREAD)
4829 s = bc_error_nested_read_call();
4831 s = zbc_parse_read(p);
4834 rprn = get_token = bin_last = false;
4836 prev = BC_INST_READ;
4841 case BC_LEX_KEY_SCALE:
4843 if (BC_PARSE_LEAF(prev, rprn))
4844 return bc_error_bad_expression();
4845 s = zbc_parse_scale(p, &prev, flags);
4847 rprn = get_token = bin_last = false;
4849 prev = BC_INST_SCALE;
4856 s = bc_error_bad_token();
4861 if (!s && get_token) s = zbc_lex_next(&p->l);
4865 if (G_interrupt) return BC_STATUS_FAILURE; // ^C: stop parsing
4867 while (p->ops.len > ops_bgn) {
4869 top = BC_PARSE_TOP_OP(p);
4870 assign = top >= BC_LEX_OP_ASSIGN_POWER && top <= BC_LEX_OP_ASSIGN;
4872 if (top == BC_LEX_LPAREN || top == BC_LEX_RPAREN)
4873 return bc_error_bad_expression();
4875 bc_parse_push(p, BC_PARSE_TOKEN_INST(top));
4877 nexprs -= top != BC_LEX_OP_BOOL_NOT && top != BC_LEX_NEG;
4878 bc_vec_pop(&p->ops);
4881 if (prev == BC_INST_BOOL_NOT || nexprs != 1)
4882 return bc_error_bad_expression();
4884 // next is BcParseNext, byte array of up to 4 BC_LEX's, packed into 32-bit word
4886 if (t == (next & 0x7f))
4888 if (next & 0x80) // last element?
4892 return bc_error_bad_expression();
4895 if (!(flags & BC_PARSE_REL) && nrelops) {
4896 s = bc_POSIX_does_not_allow("comparison operators outside if or loops");
4897 ERROR_RETURN(if (s) return s;)
4899 else if ((flags & BC_PARSE_REL) && nrelops > 1) {
4900 s = bc_POSIX_requires("exactly one comparison operator per condition");
4901 ERROR_RETURN(if (s) return s;)
4904 if (flags & BC_PARSE_PRINT) {
4905 if (paren_first || !assign) bc_parse_push(p, BC_INST_PRINT);
4906 bc_parse_push(p, BC_INST_POP);
4912 #undef zbc_parse_expr
4913 static BC_STATUS zbc_parse_expr(BcParse *p, uint8_t flags, BcParseNext next)
4917 s = bc_parse_expr_empty_ok(p, flags, next);
4918 if (s == BC_STATUS_PARSE_EMPTY_EXP)
4919 RETURN_STATUS(bc_error("empty expression"));
4922 #if ERRORS_ARE_FATAL
4923 # define zbc_parse_expr(...) (zbc_parse_expr(__VA_ARGS__), BC_STATUS_SUCCESS)
4926 static BC_STATUS zbc_parse_expression(BcParse *p, uint8_t flags)
4928 RETURN_STATUS(zbc_parse_expr(p, flags, bc_parse_next_read));
4930 #if ERRORS_ARE_FATAL
4931 # define zbc_parse_expression(...) (zbc_parse_expression(__VA_ARGS__), BC_STATUS_SUCCESS)
4938 #define DC_PARSE_BUF_LEN ((int) (sizeof(uint32_t) * CHAR_BIT))
4940 static BC_STATUS zdc_parse_register(BcParse *p)
4945 s = zbc_lex_next(&p->l);
4946 if (s) RETURN_STATUS(s);
4947 if (p->l.t.t != BC_LEX_NAME) RETURN_STATUS(bc_error_bad_token());
4949 name = xstrdup(p->l.t.v.v);
4950 bc_parse_pushName(p, name);
4954 #if ERRORS_ARE_FATAL
4955 # define zdc_parse_register(...) (zdc_parse_register(__VA_ARGS__), BC_STATUS_SUCCESS)
4958 static BC_STATUS zdc_parse_string(BcParse *p)
4960 char *str, *name, b[DC_PARSE_BUF_LEN + 1];
4961 size_t idx, len = G.prog.strs.len;
4963 sprintf(b, "%0*zu", DC_PARSE_BUF_LEN, len);
4966 str = xstrdup(p->l.t.v.v);
4967 bc_parse_push(p, BC_INST_STR);
4968 bc_parse_pushIndex(p, len);
4969 bc_vec_push(&G.prog.strs, &str);
4970 bc_parse_addFunc(p, name, &idx);
4972 RETURN_STATUS(zbc_lex_next(&p->l));
4974 #if ERRORS_ARE_FATAL
4975 # define zdc_parse_string(...) (zdc_parse_string(__VA_ARGS__), BC_STATUS_SUCCESS)
4978 static BC_STATUS zdc_parse_mem(BcParse *p, uint8_t inst, bool name, bool store)
4982 bc_parse_push(p, inst);
4984 s = zdc_parse_register(p);
4985 if (s) RETURN_STATUS(s);
4989 bc_parse_push(p, BC_INST_SWAP);
4990 bc_parse_push(p, BC_INST_ASSIGN);
4991 bc_parse_push(p, BC_INST_POP);
4994 RETURN_STATUS(zbc_lex_next(&p->l));
4996 #if ERRORS_ARE_FATAL
4997 # define zdc_parse_mem(...) (zdc_parse_mem(__VA_ARGS__), BC_STATUS_SUCCESS)
5000 static BC_STATUS zdc_parse_cond(BcParse *p, uint8_t inst)
5004 bc_parse_push(p, inst);
5005 bc_parse_push(p, BC_INST_EXEC_COND);
5007 s = zdc_parse_register(p);
5008 if (s) RETURN_STATUS(s);
5010 s = zbc_lex_next(&p->l);
5011 if (s) RETURN_STATUS(s);
5013 if (p->l.t.t == BC_LEX_ELSE) {
5014 s = zdc_parse_register(p);
5015 if (s) RETURN_STATUS(s);
5016 s = zbc_lex_next(&p->l);
5019 bc_parse_push(p, BC_PARSE_STREND);
5023 #if ERRORS_ARE_FATAL
5024 # define zdc_parse_cond(...) (zdc_parse_cond(__VA_ARGS__), BC_STATUS_SUCCESS)
5027 static BC_STATUS zdc_parse_token(BcParse *p, BcLexType t, uint8_t flags)
5029 BcStatus s = BC_STATUS_SUCCESS;
5032 bool assign, get_token = false;
5035 case BC_LEX_OP_REL_EQ:
5036 case BC_LEX_OP_REL_LE:
5037 case BC_LEX_OP_REL_GE:
5038 case BC_LEX_OP_REL_NE:
5039 case BC_LEX_OP_REL_LT:
5040 case BC_LEX_OP_REL_GT:
5041 s = zdc_parse_cond(p, t - BC_LEX_OP_REL_EQ + BC_INST_REL_EQ);
5045 s = zdc_parse_mem(p, BC_INST_ARRAY_ELEM, true, t == BC_LEX_COLON);
5048 s = zdc_parse_string(p);
5052 if (t == BC_LEX_NEG) {
5053 s = zbc_lex_next(&p->l);
5054 if (s) RETURN_STATUS(s);
5055 if (p->l.t.t != BC_LEX_NUMBER)
5056 RETURN_STATUS(bc_error_bad_token());
5058 bc_parse_number(p, &prev, &p->nbraces);
5059 if (t == BC_LEX_NEG) bc_parse_push(p, BC_INST_NEG);
5062 case BC_LEX_KEY_READ:
5063 if (flags & BC_PARSE_NOREAD)
5064 s = bc_error_nested_read_call();
5066 bc_parse_push(p, BC_INST_READ);
5069 case BC_LEX_OP_ASSIGN:
5070 case BC_LEX_STORE_PUSH:
5071 assign = t == BC_LEX_OP_ASSIGN;
5072 inst = assign ? BC_INST_VAR : BC_INST_PUSH_TO_VAR;
5073 s = zdc_parse_mem(p, inst, true, assign);
5076 case BC_LEX_LOAD_POP:
5077 inst = t == BC_LEX_LOAD_POP ? BC_INST_PUSH_VAR : BC_INST_LOAD;
5078 s = zdc_parse_mem(p, inst, true, false);
5080 case BC_LEX_STORE_IBASE:
5081 case BC_LEX_STORE_SCALE:
5082 case BC_LEX_STORE_OBASE:
5083 inst = t - BC_LEX_STORE_IBASE + BC_INST_IBASE;
5084 s = zdc_parse_mem(p, inst, false, true);
5087 s = bc_error_bad_token();
5092 if (!s && get_token) s = zbc_lex_next(&p->l);
5096 #if ERRORS_ARE_FATAL
5097 # define zdc_parse_token(...) (zdc_parse_token(__VA_ARGS__), BC_STATUS_SUCCESS)
5100 static BC_STATUS zdc_parse_expr(BcParse *p, uint8_t flags)
5102 BcStatus s = BC_STATUS_SUCCESS;
5106 if (flags & BC_PARSE_NOCALL) p->nbraces = G.prog.results.len;
5108 for (t = p->l.t.t; !s && t != BC_LEX_EOF; t = p->l.t.t) {
5109 inst = dc_parse_insts[t];
5111 if (inst != BC_INST_INVALID) {
5112 bc_parse_push(p, inst);
5113 s = zbc_lex_next(&p->l);
5115 s = zdc_parse_token(p, t, flags);
5118 if (!s && p->l.t.t == BC_LEX_EOF && (flags & BC_PARSE_NOCALL))
5119 bc_parse_push(p, BC_INST_POP_EXEC);
5123 #if ERRORS_ARE_FATAL
5124 # define zdc_parse_expr(...) (zdc_parse_expr(__VA_ARGS__), BC_STATUS_SUCCESS)
5127 static BC_STATUS zdc_parse_parse(BcParse *p)
5131 if (p->l.t.t == BC_LEX_EOF)
5132 s = bc_error("end of file");
5134 s = zdc_parse_expr(p, 0);
5136 if (s || G_interrupt) {
5138 s = BC_STATUS_FAILURE;
5143 #if ERRORS_ARE_FATAL
5144 # define zdc_parse_parse(...) (zdc_parse_parse(__VA_ARGS__), BC_STATUS_SUCCESS)
5149 static BC_STATUS zcommon_parse_expr(BcParse *p, uint8_t flags)
5152 IF_BC(RETURN_STATUS(zbc_parse_expression(p, flags));)
5154 IF_DC(RETURN_STATUS(zdc_parse_expr(p, flags));)
5157 #if ERRORS_ARE_FATAL
5158 # define zcommon_parse_expr(...) (zcommon_parse_expr(__VA_ARGS__), BC_STATUS_SUCCESS)
5161 static BcVec* bc_program_search(char *id, bool var)
5169 v = var ? &G.prog.vars : &G.prog.arrs;
5170 map = var ? &G.prog.var_map : &G.prog.arr_map;
5174 new = bc_map_insert(map, &e, &i); // 1 if insertion was successful
5177 bc_array_init(&data.v, var);
5178 bc_vec_push(v, &data.v);
5181 ptr = bc_vec_item(map, i);
5182 if (new) ptr->name = xstrdup(e.name);
5183 return bc_vec_item(v, ptr->idx);
5186 static BC_STATUS zbc_program_num(BcResult *r, BcNum **num, bool hex)
5191 case BC_RESULT_TEMP:
5192 case BC_RESULT_IBASE:
5193 case BC_RESULT_SCALE:
5194 case BC_RESULT_OBASE:
5200 case BC_RESULT_CONSTANT:
5203 char **str = bc_vec_item(&G.prog.consts, r->d.id.idx);
5204 size_t base_t, len = strlen(*str);
5207 bc_num_init(&r->d.n, len);
5209 hex = hex && len == 1;
5210 base = hex ? &G.prog.hexb : &G.prog.ib;
5211 base_t = hex ? BC_NUM_MAX_IBASE : G.prog.ib_t;
5212 s = zbc_num_parse(&r->d.n, *str, base, base_t);
5215 bc_num_free(&r->d.n);
5220 r->t = BC_RESULT_TEMP;
5226 case BC_RESULT_ARRAY:
5227 case BC_RESULT_ARRAY_ELEM:
5231 v = bc_program_search(r->d.id.name, r->t == BC_RESULT_VAR);
5233 if (r->t == BC_RESULT_ARRAY_ELEM) {
5235 if (v->len <= r->d.id.idx) bc_array_expand(v, r->d.id.idx + 1);
5236 *num = bc_vec_item(v, r->d.id.idx);
5239 *num = bc_vec_top(v);
5244 case BC_RESULT_LAST:
5246 *num = &G.prog.last;
5257 RETURN_STATUS(BC_STATUS_SUCCESS);
5259 #if ERRORS_ARE_FATAL
5260 # define zbc_program_num(...) (zbc_program_num(__VA_ARGS__), BC_STATUS_SUCCESS)
5263 static BC_STATUS zbc_program_binOpPrep(BcResult **l, BcNum **ln,
5264 BcResult **r, BcNum **rn, bool assign)
5268 BcResultType lt, rt;
5270 if (!BC_PROG_STACK(&G.prog.results, 2))
5271 RETURN_STATUS(bc_error_stack_has_too_few_elements());
5273 *r = bc_vec_item_rev(&G.prog.results, 0);
5274 *l = bc_vec_item_rev(&G.prog.results, 1);
5278 hex = assign && (lt == BC_RESULT_IBASE || lt == BC_RESULT_OBASE);
5280 s = zbc_program_num(*l, ln, false);
5281 if (s) RETURN_STATUS(s);
5282 s = zbc_program_num(*r, rn, hex);
5283 if (s) RETURN_STATUS(s);
5285 // We run this again under these conditions in case any vector has been
5286 // reallocated out from under the BcNums or arrays we had.
5287 if (lt == rt && (lt == BC_RESULT_VAR || lt == BC_RESULT_ARRAY_ELEM)) {
5288 s = zbc_program_num(*l, ln, false);
5289 if (s) RETURN_STATUS(s);
5292 if (!BC_PROG_NUM((*l), (*ln)) && (!assign || (*l)->t != BC_RESULT_VAR))
5293 RETURN_STATUS(bc_error_variable_is_wrong_type());
5294 if (!assign && !BC_PROG_NUM((*r), (*ln)))
5295 RETURN_STATUS(bc_error_variable_is_wrong_type());
5299 #if ERRORS_ARE_FATAL
5300 # define zbc_program_binOpPrep(...) (zbc_program_binOpPrep(__VA_ARGS__), BC_STATUS_SUCCESS)
5303 static void bc_program_binOpRetire(BcResult *r)
5305 r->t = BC_RESULT_TEMP;
5306 bc_vec_pop(&G.prog.results);
5307 bc_vec_pop(&G.prog.results);
5308 bc_vec_push(&G.prog.results, r);
5311 static BC_STATUS zbc_program_prep(BcResult **r, BcNum **n)
5315 if (!BC_PROG_STACK(&G.prog.results, 1))
5316 RETURN_STATUS(bc_error_stack_has_too_few_elements());
5317 *r = bc_vec_top(&G.prog.results);
5319 s = zbc_program_num(*r, n, false);
5320 if (s) RETURN_STATUS(s);
5322 if (!BC_PROG_NUM((*r), (*n)))
5323 RETURN_STATUS(bc_error_variable_is_wrong_type());
5327 #if ERRORS_ARE_FATAL
5328 # define zbc_program_prep(...) (zbc_program_prep(__VA_ARGS__), BC_STATUS_SUCCESS)
5331 static void bc_program_retire(BcResult *r, BcResultType t)
5334 bc_vec_pop(&G.prog.results);
5335 bc_vec_push(&G.prog.results, r);
5338 static BC_STATUS zbc_program_op(char inst)
5341 BcResult *opd1, *opd2, res;
5342 BcNum *n1, *n2 = NULL;
5344 s = zbc_program_binOpPrep(&opd1, &n1, &opd2, &n2, false);
5345 if (s) RETURN_STATUS(s);
5346 bc_num_init_DEF_SIZE(&res.d.n);
5348 s = BC_STATUS_SUCCESS;
5349 ERROR_RETURN(s =) zbc_program_ops[inst - BC_INST_POWER](n1, n2, &res.d.n, G.prog.scale);
5351 bc_program_binOpRetire(&res);
5356 bc_num_free(&res.d.n);
5359 #if ERRORS_ARE_FATAL
5360 # define zbc_program_op(...) (zbc_program_op(__VA_ARGS__), BC_STATUS_SUCCESS)
5363 static BC_STATUS zbc_program_read(void)
5365 const char *sv_file;
5373 RETURN_STATUS(bc_error_nested_read_call());
5375 f = bc_program_func(BC_PROG_READ);
5376 bc_vec_pop_all(&f->code);
5377 bc_char_vec_init(&buf);
5379 sv_file = G.prog.file;
5385 bc_parse_create(&parse, BC_PROG_READ);
5386 bc_lex_file(&parse.l);
5388 s = zbc_parse_text(&parse, buf.v);
5389 if (s) goto exec_err;
5390 s = zcommon_parse_expr(&parse, BC_PARSE_NOREAD);
5391 if (s) goto exec_err;
5393 if (parse.l.t.t != BC_LEX_NLINE && parse.l.t.t != BC_LEX_EOF) {
5394 s = bc_error("bad read() expression");
5398 ip.func = BC_PROG_READ;
5400 ip.len = G.prog.results.len;
5402 // Update this pointer, just in case.
5403 f = bc_program_func(BC_PROG_READ);
5405 bc_vec_pushByte(&f->code, BC_INST_POP_EXEC);
5406 bc_vec_push(&G.prog.stack, &ip);
5409 bc_parse_free(&parse);
5412 G.prog.file = sv_file;
5416 #if ERRORS_ARE_FATAL
5417 # define zbc_program_read(...) (zbc_program_read(__VA_ARGS__), BC_STATUS_SUCCESS)
5420 static size_t bc_program_index(char *code, size_t *bgn)
5422 char amt = code[(*bgn)++], i = 0;
5425 for (; i < amt; ++i, ++(*bgn))
5426 res |= (((size_t)((int) code[*bgn]) & UCHAR_MAX) << (i * CHAR_BIT));
5431 static char *bc_program_name(char *code, size_t *bgn)
5434 char c, *s, *str = code + *bgn, *ptr = strchr(str, BC_PARSE_STREND);
5436 s = xmalloc(ptr - str + 1);
5439 for (i = 0; c != 0 && c != BC_PARSE_STREND; c = code[(*bgn)++], ++i)
5447 static void bc_program_printString(const char *str)
5451 // Example: echo '[]ap' | dc
5452 // should print two bytes: 0x00, 0x0A
5459 if (c != '\\' || !*str)
5479 G.prog.nchars = SIZE_MAX;
5491 // Just print the backslash and following character.
5502 static void bc_num_printNewline(void)
5504 if (G.prog.nchars == G.prog.len - 1) {
5512 static FAST_FUNC void bc_num_printChar(size_t num, size_t width, bool radix)
5515 bb_putchar((char) num);
5516 G.prog.nchars += width;
5520 static FAST_FUNC void bc_num_printDigits(size_t num, size_t width, bool radix)
5524 bc_num_printNewline();
5525 bb_putchar(radix ? '.' : ' ');
5528 bc_num_printNewline();
5529 for (exp = 0, pow = 1; exp < width - 1; ++exp, pow *= 10)
5532 for (exp = 0; exp < width; pow /= 10, ++G.prog.nchars, ++exp) {
5534 bc_num_printNewline();
5537 bb_putchar(((char) dig) + '0');
5541 static FAST_FUNC void bc_num_printHex(size_t num, size_t width, bool radix)
5544 bc_num_printNewline();
5549 bc_num_printNewline();
5550 bb_putchar(bb_hexdigits_upcase[num]);
5551 G.prog.nchars += width;
5554 static void bc_num_printDecimal(BcNum *n)
5556 size_t i, rdx = n->rdx - 1;
5558 if (n->neg) bb_putchar('-');
5559 G.prog.nchars += n->neg;
5561 for (i = n->len - 1; i < n->len; --i)
5562 bc_num_printHex((size_t) n->num[i], 1, i == rdx);
5565 static BC_STATUS zbc_num_printNum(BcNum *n, BcNum *base, size_t width, BcNumDigitOp print)
5569 BcNum intp, fracp, digit, frac_len;
5570 unsigned long dig, *ptr;
5575 print(0, width, false);
5576 RETURN_STATUS(BC_STATUS_SUCCESS);
5579 bc_vec_init(&stack, sizeof(long), NULL);
5580 bc_num_init(&intp, n->len);
5581 bc_num_init(&fracp, n->rdx);
5582 bc_num_init(&digit, width);
5583 bc_num_init(&frac_len, BC_NUM_INT(n));
5584 bc_num_copy(&intp, n);
5585 bc_num_one(&frac_len);
5587 bc_num_truncate(&intp, intp.rdx);
5588 s = zbc_num_sub(n, &intp, &fracp, 0);
5591 while (intp.len != 0) {
5592 s = zbc_num_divmod(&intp, base, &intp, &digit, 0);
5594 s = zbc_num_ulong(&digit, &dig);
5596 bc_vec_push(&stack, &dig);
5599 for (i = 0; i < stack.len; ++i) {
5600 ptr = bc_vec_item_rev(&stack, i);
5601 print(*ptr, width, false);
5604 if (!n->rdx) goto err;
5606 for (radix = true; frac_len.len <= n->rdx; radix = false) {
5607 s = zbc_num_mul(&fracp, base, &fracp, n->rdx);
5609 s = zbc_num_ulong(&fracp, &dig);
5611 bc_num_ulong2num(&intp, dig);
5612 s = zbc_num_sub(&fracp, &intp, &fracp, 0);
5614 print(dig, width, radix);
5615 s = zbc_num_mul(&frac_len, base, &frac_len, 0);
5620 bc_num_free(&frac_len);
5621 bc_num_free(&digit);
5622 bc_num_free(&fracp);
5624 bc_vec_free(&stack);
5627 #if ERRORS_ARE_FATAL
5628 # define zbc_num_printNum(...) (zbc_num_printNum(__VA_ARGS__), BC_STATUS_SUCCESS)
5631 static BC_STATUS zbc_num_printBase(BcNum *n)
5645 if (G.prog.ob_t <= BC_NUM_MAX_IBASE) {
5647 print = bc_num_printHex;
5650 for (i = G.prog.ob_t - 1, width = 0; i != 0; i /= 10, ++width)
5652 print = bc_num_printDigits;
5655 s = zbc_num_printNum(n, &G.prog.ob, width, print);
5660 #if ERRORS_ARE_FATAL
5661 # define zbc_num_printBase(...) (zbc_num_printBase(__VA_ARGS__), BC_STATUS_SUCCESS)
5665 static BC_STATUS zbc_num_stream(BcNum *n, BcNum *base)
5667 RETURN_STATUS(zbc_num_printNum(n, base, 1, bc_num_printChar));
5669 #if ERRORS_ARE_FATAL
5670 # define zbc_num_stream(...) (zbc_num_stream(__VA_ARGS__), BC_STATUS_SUCCESS)
5674 static BC_STATUS zbc_num_print(BcNum *n, bool newline)
5676 BcStatus s = BC_STATUS_SUCCESS;
5678 bc_num_printNewline();
5684 else if (G.prog.ob_t == 10)
5685 bc_num_printDecimal(n);
5687 s = zbc_num_printBase(n);
5696 #if ERRORS_ARE_FATAL
5697 # define zbc_num_print(...) (zbc_num_print(__VA_ARGS__), BC_STATUS_SUCCESS)
5700 static BC_STATUS zbc_program_print(char inst, size_t idx)
5705 bool pop = inst != BC_INST_PRINT;
5707 if (!BC_PROG_STACK(&G.prog.results, idx + 1))
5708 RETURN_STATUS(bc_error_stack_has_too_few_elements());
5710 r = bc_vec_item_rev(&G.prog.results, idx);
5711 num = NULL; // is this NULL necessary?
5712 s = zbc_program_num(r, &num, false);
5713 if (s) RETURN_STATUS(s);
5715 if (BC_PROG_NUM(r, num)) {
5716 s = zbc_num_print(num, !pop);
5717 if (!s) bc_num_copy(&G.prog.last, num);
5722 idx = (r->t == BC_RESULT_STR) ? r->d.id.idx : num->rdx;
5723 str = *bc_program_str(idx);
5725 if (inst == BC_INST_PRINT_STR) {
5728 if (c == '\0') break;
5731 if (c == '\n') G.prog.nchars = 0;
5735 bc_program_printString(str);
5736 if (inst == BC_INST_PRINT) bb_putchar('\n');
5740 if (!s && pop) bc_vec_pop(&G.prog.results);
5744 #if ERRORS_ARE_FATAL
5745 # define zbc_program_print(...) (zbc_program_print(__VA_ARGS__), BC_STATUS_SUCCESS)
5748 static BC_STATUS zbc_program_negate(void)
5754 s = zbc_program_prep(&ptr, &num);
5755 if (s) RETURN_STATUS(s);
5757 bc_num_init(&res.d.n, num->len);
5758 bc_num_copy(&res.d.n, num);
5759 if (res.d.n.len) res.d.n.neg = !res.d.n.neg;
5761 bc_program_retire(&res, BC_RESULT_TEMP);
5765 #if ERRORS_ARE_FATAL
5766 # define zbc_program_negate(...) (zbc_program_negate(__VA_ARGS__), BC_STATUS_SUCCESS)
5769 static BC_STATUS zbc_program_logical(char inst)
5772 BcResult *opd1, *opd2, res;
5776 s = zbc_program_binOpPrep(&opd1, &n1, &opd2, &n2, false);
5777 if (s) RETURN_STATUS(s);
5779 bc_num_init_DEF_SIZE(&res.d.n);
5781 if (inst == BC_INST_BOOL_AND)
5782 cond = bc_num_cmp(n1, &G.prog.zero) && bc_num_cmp(n2, &G.prog.zero);
5783 else if (inst == BC_INST_BOOL_OR)
5784 cond = bc_num_cmp(n1, &G.prog.zero) || bc_num_cmp(n2, &G.prog.zero);
5786 cond = bc_num_cmp(n1, n2);
5788 case BC_INST_REL_EQ:
5791 case BC_INST_REL_LE:
5794 case BC_INST_REL_GE:
5797 case BC_INST_REL_LT:
5800 case BC_INST_REL_GT:
5803 default: // = case BC_INST_REL_NE:
5804 //cond = (cond != 0); - not needed
5809 if (cond) bc_num_one(&res.d.n);
5810 //else bc_num_zero(&res.d.n); - already is
5812 bc_program_binOpRetire(&res);
5816 #if ERRORS_ARE_FATAL
5817 # define zbc_program_logical(...) (zbc_program_logical(__VA_ARGS__), BC_STATUS_SUCCESS)
5821 static BC_STATUS zbc_program_assignStr(BcResult *r, BcVec *v,
5827 memset(&n2, 0, sizeof(BcNum));
5828 n2.rdx = res.d.id.idx = r->d.id.idx;
5829 res.t = BC_RESULT_STR;
5832 if (!BC_PROG_STACK(&G.prog.results, 2))
5833 RETURN_STATUS(bc_error_stack_has_too_few_elements());
5835 bc_vec_pop(&G.prog.results);
5838 bc_vec_pop(&G.prog.results);
5840 bc_vec_push(&G.prog.results, &res);
5841 bc_vec_push(v, &n2);
5843 RETURN_STATUS(BC_STATUS_SUCCESS);
5845 #if ERRORS_ARE_FATAL
5846 # define zbc_program_assignStr(...) (zbc_program_assignStr(__VA_ARGS__), BC_STATUS_SUCCESS)
5850 static BC_STATUS zbc_program_copyToVar(char *name, bool var)
5857 if (!BC_PROG_STACK(&G.prog.results, 1))
5858 RETURN_STATUS(bc_error_stack_has_too_few_elements());
5860 ptr = bc_vec_top(&G.prog.results);
5861 if ((ptr->t == BC_RESULT_ARRAY) != !var)
5862 RETURN_STATUS(bc_error_variable_is_wrong_type());
5863 v = bc_program_search(name, var);
5866 if (ptr->t == BC_RESULT_STR && !var)
5867 RETURN_STATUS(bc_error_variable_is_wrong_type());
5868 if (ptr->t == BC_RESULT_STR)
5869 RETURN_STATUS(zbc_program_assignStr(ptr, v, true));
5872 s = zbc_program_num(ptr, &n, false);
5873 if (s) RETURN_STATUS(s);
5875 // Do this once more to make sure that pointers were not invalidated.
5876 v = bc_program_search(name, var);
5879 bc_num_init_DEF_SIZE(&r.d.n);
5880 bc_num_copy(&r.d.n, n);
5883 bc_array_init(&r.d.v, true);
5884 bc_array_copy(&r.d.v, (BcVec *) n);
5887 bc_vec_push(v, &r.d);
5888 bc_vec_pop(&G.prog.results);
5892 #if ERRORS_ARE_FATAL
5893 # define zbc_program_copyToVar(...) (zbc_program_copyToVar(__VA_ARGS__), BC_STATUS_SUCCESS)
5896 static BC_STATUS zbc_program_assign(char inst)
5899 BcResult *left, *right, res;
5900 BcNum *l = NULL, *r = NULL;
5901 bool assign = inst == BC_INST_ASSIGN, ib, sc;
5903 s = zbc_program_binOpPrep(&left, &l, &right, &r, assign);
5904 if (s) RETURN_STATUS(s);
5906 ib = left->t == BC_RESULT_IBASE;
5907 sc = left->t == BC_RESULT_SCALE;
5911 if (right->t == BC_RESULT_STR) {
5915 if (left->t != BC_RESULT_VAR)
5916 RETURN_STATUS(bc_error_variable_is_wrong_type());
5917 v = bc_program_search(left->d.id.name, true);
5919 RETURN_STATUS(zbc_program_assignStr(right, v, false));
5923 if (left->t == BC_RESULT_CONSTANT || left->t == BC_RESULT_TEMP)
5924 RETURN_STATUS(bc_error("bad assignment:"
5925 " left side must be scale,"
5926 " ibase, obase, last, var,"
5931 if (inst == BC_INST_ASSIGN_DIVIDE && !bc_num_cmp(r, &G.prog.zero))
5932 RETURN_STATUS(bc_error("divide by zero"));
5937 s = BC_STATUS_SUCCESS;
5938 ERROR_RETURN(s =) zbc_program_ops[inst - BC_INST_ASSIGN_POWER](l, r, l, G.prog.scale);
5940 if (s) RETURN_STATUS(s);
5945 if (ib || sc || left->t == BC_RESULT_OBASE) {
5946 static const char *const msg[] = {
5947 "bad ibase; must be [2,16]", //BC_RESULT_IBASE
5948 "bad scale; must be [0,"BC_MAX_SCALE_STR"]", //BC_RESULT_SCALE
5949 NULL, //can't happen //BC_RESULT_LAST
5950 NULL, //can't happen //BC_RESULT_CONSTANT
5951 NULL, //can't happen //BC_RESULT_ONE
5952 "bad obase; must be [2,"BC_MAX_OBASE_STR"]", //BC_RESULT_OBASE
5955 unsigned long val, max;
5957 s = zbc_num_ulong(l, &val);
5958 if (s) RETURN_STATUS(s);
5959 s = left->t - BC_RESULT_IBASE;
5962 ptr = &G.prog.scale;
5965 if (val < BC_NUM_MIN_BASE)
5966 RETURN_STATUS(bc_error(msg[s]));
5967 max = ib ? BC_NUM_MAX_IBASE : BC_MAX_OBASE;
5968 ptr = ib ? &G.prog.ib_t : &G.prog.ob_t;
5972 RETURN_STATUS(bc_error(msg[s]));
5974 bc_num_copy(ib ? &G.prog.ib : &G.prog.ob, l);
5976 *ptr = (size_t) val;
5977 s = BC_STATUS_SUCCESS;
5980 bc_num_init(&res.d.n, l->len);
5981 bc_num_copy(&res.d.n, l);
5982 bc_program_binOpRetire(&res);
5986 #if ERRORS_ARE_FATAL
5987 # define zbc_program_assign(...) (zbc_program_assign(__VA_ARGS__), BC_STATUS_SUCCESS)
5991 #define bc_program_pushVar(code, bgn, pop, copy) \
5992 bc_program_pushVar(code, bgn)
5993 // for bc, 'pop' and 'copy' are always false
5995 static BC_STATUS bc_program_pushVar(char *code, size_t *bgn,
5996 bool pop, bool copy)
5999 char *name = bc_program_name(code, bgn);
6001 r.t = BC_RESULT_VAR;
6006 BcVec *v = bc_program_search(name, true);
6007 BcNum *num = bc_vec_top(v);
6011 if (!BC_PROG_STACK(v, 2 - copy)) {
6013 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6019 if (!BC_PROG_STR(num)) {
6021 r.t = BC_RESULT_TEMP;
6023 bc_num_init_DEF_SIZE(&r.d.n);
6024 bc_num_copy(&r.d.n, num);
6027 r.t = BC_RESULT_STR;
6028 r.d.id.idx = num->rdx;
6031 if (!copy) bc_vec_pop(v);
6036 bc_vec_push(&G.prog.results, &r);
6038 RETURN_STATUS(BC_STATUS_SUCCESS);
6040 #if ERRORS_ARE_FATAL
6041 # define zbc_program_pushVar(...) (bc_program_pushVar(__VA_ARGS__), BC_STATUS_SUCCESS)
6043 # define zbc_program_pushVar(...) bc_program_pushVar(__VA_ARGS__)
6046 static BC_STATUS zbc_program_pushArray(char *code, size_t *bgn,
6049 BcStatus s = BC_STATUS_SUCCESS;
6053 r.d.id.name = bc_program_name(code, bgn);
6055 if (inst == BC_INST_ARRAY) {
6056 r.t = BC_RESULT_ARRAY;
6057 bc_vec_push(&G.prog.results, &r);
6064 s = zbc_program_prep(&operand, &num);
6066 s = zbc_num_ulong(num, &temp);
6069 if (temp > BC_MAX_DIM) {
6070 s = bc_error("array too long; must be [1,"BC_MAX_DIM_STR"]");
6074 r.d.id.idx = (size_t) temp;
6075 bc_program_retire(&r, BC_RESULT_ARRAY_ELEM);
6079 if (s) free(r.d.id.name);
6082 #if ERRORS_ARE_FATAL
6083 # define zbc_program_pushArray(...) (zbc_program_pushArray(__VA_ARGS__), BC_STATUS_SUCCESS)
6087 static BC_STATUS zbc_program_incdec(char inst)
6090 BcResult *ptr, res, copy;
6094 s = zbc_program_prep(&ptr, &num);
6095 if (s) RETURN_STATUS(s);
6097 if (inst == BC_INST_INC_POST || inst == BC_INST_DEC_POST) {
6098 copy.t = BC_RESULT_TEMP;
6099 bc_num_init(©.d.n, num->len);
6100 bc_num_copy(©.d.n, num);
6103 res.t = BC_RESULT_ONE;
6104 inst = inst == BC_INST_INC_PRE || inst == BC_INST_INC_POST ?
6105 BC_INST_ASSIGN_PLUS :
6106 BC_INST_ASSIGN_MINUS;
6108 bc_vec_push(&G.prog.results, &res);
6109 s = zbc_program_assign(inst);
6110 if (s) RETURN_STATUS(s);
6112 if (inst2 == BC_INST_INC_POST || inst2 == BC_INST_DEC_POST) {
6113 bc_vec_pop(&G.prog.results);
6114 bc_vec_push(&G.prog.results, ©);
6119 #if ERRORS_ARE_FATAL
6120 # define zbc_program_incdec(...) (zbc_program_incdec(__VA_ARGS__), BC_STATUS_SUCCESS)
6123 static BC_STATUS zbc_program_call(char *code, size_t *idx)
6126 size_t i, nparams = bc_program_index(code, idx);
6133 ip.func = bc_program_index(code, idx);
6134 func = bc_program_func(ip.func);
6136 if (func->code.len == 0) {
6137 RETURN_STATUS(bc_error("undefined function"));
6139 if (nparams != func->nparams) {
6140 RETURN_STATUS(bc_error_fmt("function has %u parameters, but called with %u", func->nparams, nparams));
6142 ip.len = G.prog.results.len - nparams;
6144 for (i = 0; i < nparams; ++i) {
6147 a = bc_vec_item(&func->autos, nparams - 1 - i);
6148 arg = bc_vec_top(&G.prog.results);
6150 if ((!a->idx) != (arg->t == BC_RESULT_ARRAY) || arg->t == BC_RESULT_STR)
6151 RETURN_STATUS(bc_error_variable_is_wrong_type());
6153 s = zbc_program_copyToVar(a->name, a->idx);
6154 if (s) RETURN_STATUS(s);
6157 for (; i < func->autos.len; ++i) {
6160 a = bc_vec_item(&func->autos, i);
6161 v = bc_program_search(a->name, a->idx);
6164 bc_num_init_DEF_SIZE(¶m.n);
6165 bc_vec_push(v, ¶m.n);
6168 bc_array_init(¶m.v, true);
6169 bc_vec_push(v, ¶m.v);
6173 bc_vec_push(&G.prog.stack, &ip);
6175 RETURN_STATUS(BC_STATUS_SUCCESS);
6177 #if ERRORS_ARE_FATAL
6178 # define zbc_program_call(...) (zbc_program_call(__VA_ARGS__), BC_STATUS_SUCCESS)
6181 static BC_STATUS zbc_program_return(char inst)
6186 BcInstPtr *ip = bc_vec_top(&G.prog.stack);
6188 if (!BC_PROG_STACK(&G.prog.results, ip->len + inst == BC_INST_RET))
6189 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6191 f = bc_program_func(ip->func);
6192 res.t = BC_RESULT_TEMP;
6194 if (inst == BC_INST_RET) {
6197 BcResult *operand = bc_vec_top(&G.prog.results);
6199 s = zbc_program_num(operand, &num, false);
6200 if (s) RETURN_STATUS(s);
6201 bc_num_init(&res.d.n, num->len);
6202 bc_num_copy(&res.d.n, num);
6205 bc_num_init_DEF_SIZE(&res.d.n);
6206 //bc_num_zero(&res.d.n); - already is
6209 // We need to pop arguments as well, so this takes that into account.
6210 for (i = 0; i < f->autos.len; ++i) {
6212 BcId *a = bc_vec_item(&f->autos, i);
6214 v = bc_program_search(a->name, a->idx);
6218 bc_vec_npop(&G.prog.results, G.prog.results.len - ip->len);
6219 bc_vec_push(&G.prog.results, &res);
6220 bc_vec_pop(&G.prog.stack);
6222 RETURN_STATUS(BC_STATUS_SUCCESS);
6224 #if ERRORS_ARE_FATAL
6225 # define zbc_program_return(...) (zbc_program_return(__VA_ARGS__), BC_STATUS_SUCCESS)
6229 static unsigned long bc_program_scale(BcNum *n)
6231 return (unsigned long) n->rdx;
6234 static unsigned long bc_program_len(BcNum *n)
6236 size_t len = n->len;
6238 if (n->rdx != len) return len;
6240 if (len == 0) break;
6242 if (n->num[len] != 0) break;
6247 static BC_STATUS zbc_program_builtin(char inst)
6253 bool len = inst == BC_INST_LENGTH;
6255 if (!BC_PROG_STACK(&G.prog.results, 1))
6256 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6257 opnd = bc_vec_top(&G.prog.results);
6259 s = zbc_program_num(opnd, &num, false);
6260 if (s) RETURN_STATUS(s);
6263 if (!BC_PROG_NUM(opnd, num) && !len)
6264 RETURN_STATUS(bc_error_variable_is_wrong_type());
6267 bc_num_init_DEF_SIZE(&res.d.n);
6269 if (inst == BC_INST_SQRT) s = zbc_num_sqrt(num, &res.d.n, G.prog.scale);
6271 else if (len != 0 && opnd->t == BC_RESULT_ARRAY) {
6272 bc_num_ulong2num(&res.d.n, (unsigned long) ((BcVec *) num)->len);
6276 else if (len != 0 && !BC_PROG_NUM(opnd, num)) {
6278 size_t idx = opnd->t == BC_RESULT_STR ? opnd->d.id.idx : num->rdx;
6280 str = bc_program_str(idx);
6281 bc_num_ulong2num(&res.d.n, strlen(*str));
6285 bc_num_ulong2num(&res.d.n, len ? bc_program_len(num) : bc_program_scale(num));
6288 bc_program_retire(&res, BC_RESULT_TEMP);
6292 #if ERRORS_ARE_FATAL
6293 # define zbc_program_builtin(...) (zbc_program_builtin(__VA_ARGS__), BC_STATUS_SUCCESS)
6297 static BC_STATUS zbc_program_divmod(void)
6300 BcResult *opd1, *opd2, res, res2;
6301 BcNum *n1, *n2 = NULL;
6303 s = zbc_program_binOpPrep(&opd1, &n1, &opd2, &n2, false);
6304 if (s) RETURN_STATUS(s);
6306 bc_num_init_DEF_SIZE(&res.d.n);
6307 bc_num_init(&res2.d.n, n2->len);
6309 s = zbc_num_divmod(n1, n2, &res2.d.n, &res.d.n, G.prog.scale);
6312 bc_program_binOpRetire(&res2);
6313 res.t = BC_RESULT_TEMP;
6314 bc_vec_push(&G.prog.results, &res);
6319 bc_num_free(&res2.d.n);
6320 bc_num_free(&res.d.n);
6323 #if ERRORS_ARE_FATAL
6324 # define zbc_program_divmod(...) (zbc_program_divmod(__VA_ARGS__), BC_STATUS_SUCCESS)
6327 static BC_STATUS zbc_program_modexp(void)
6330 BcResult *r1, *r2, *r3, res;
6331 BcNum *n1, *n2, *n3;
6333 if (!BC_PROG_STACK(&G.prog.results, 3))
6334 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6335 s = zbc_program_binOpPrep(&r2, &n2, &r3, &n3, false);
6336 if (s) RETURN_STATUS(s);
6338 r1 = bc_vec_item_rev(&G.prog.results, 2);
6339 s = zbc_program_num(r1, &n1, false);
6340 if (s) RETURN_STATUS(s);
6341 if (!BC_PROG_NUM(r1, n1))
6342 RETURN_STATUS(bc_error_variable_is_wrong_type());
6344 // Make sure that the values have their pointers updated, if necessary.
6345 if (r1->t == BC_RESULT_VAR || r1->t == BC_RESULT_ARRAY_ELEM) {
6347 if (r1->t == r2->t) {
6348 s = zbc_program_num(r2, &n2, false);
6349 if (s) RETURN_STATUS(s);
6352 if (r1->t == r3->t) {
6353 s = zbc_program_num(r3, &n3, false);
6354 if (s) RETURN_STATUS(s);
6358 bc_num_init(&res.d.n, n3->len);
6359 s = zbc_num_modexp(n1, n2, n3, &res.d.n);
6362 bc_vec_pop(&G.prog.results);
6363 bc_program_binOpRetire(&res);
6368 bc_num_free(&res.d.n);
6371 #if ERRORS_ARE_FATAL
6372 # define zbc_program_modexp(...) (zbc_program_modexp(__VA_ARGS__), BC_STATUS_SUCCESS)
6375 static void bc_program_stackLen(void)
6378 size_t len = G.prog.results.len;
6380 res.t = BC_RESULT_TEMP;
6382 bc_num_init_DEF_SIZE(&res.d.n);
6383 bc_num_ulong2num(&res.d.n, len);
6384 bc_vec_push(&G.prog.results, &res);
6387 static BC_STATUS zbc_program_asciify(void)
6392 char *str, *str2, c;
6393 size_t len = G.prog.strs.len, idx;
6396 if (!BC_PROG_STACK(&G.prog.results, 1))
6397 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6398 r = bc_vec_top(&G.prog.results);
6400 num = NULL; // TODO: is this NULL needed?
6401 s = zbc_program_num(r, &num, false);
6402 if (s) RETURN_STATUS(s);
6404 if (BC_PROG_NUM(r, num)) {
6406 bc_num_init_DEF_SIZE(&n);
6407 bc_num_copy(&n, num);
6408 bc_num_truncate(&n, n.rdx);
6410 s = zbc_num_mod(&n, &G.prog.strmb, &n, 0);
6411 if (s) goto num_err;
6412 s = zbc_num_ulong(&n, &val);
6413 if (s) goto num_err;
6420 idx = (r->t == BC_RESULT_STR) ? r->d.id.idx : num->rdx;
6421 str2 = *bc_program_str(idx);
6427 //str[1] = '\0'; - already is
6429 str2 = xstrdup(str);
6430 bc_program_addFunc(str2, &idx);
6432 if (idx != len + BC_PROG_REQ_FUNCS) {
6433 for (idx = 0; idx < G.prog.strs.len; ++idx) {
6434 if (strcmp(*bc_program_str(idx), str) == 0) {
6443 bc_vec_push(&G.prog.strs, &str);
6445 res.t = BC_RESULT_STR;
6447 bc_vec_pop(&G.prog.results);
6448 bc_vec_push(&G.prog.results, &res);
6450 RETURN_STATUS(BC_STATUS_SUCCESS);
6456 #if ERRORS_ARE_FATAL
6457 # define zbc_program_asciify(...) (zbc_program_asciify(__VA_ARGS__), BC_STATUS_SUCCESS)
6460 static BC_STATUS zbc_program_printStream(void)
6468 if (!BC_PROG_STACK(&G.prog.results, 1))
6469 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6470 r = bc_vec_top(&G.prog.results);
6472 s = zbc_program_num(r, &n, false);
6473 if (s) RETURN_STATUS(s);
6475 if (BC_PROG_NUM(r, n))
6476 s = zbc_num_stream(n, &G.prog.strmb);
6478 idx = (r->t == BC_RESULT_STR) ? r->d.id.idx : n->rdx;
6479 str = *bc_program_str(idx);
6485 #if ERRORS_ARE_FATAL
6486 # define zbc_program_printStream(...) (zbc_program_printStream(__VA_ARGS__), BC_STATUS_SUCCESS)
6489 static BC_STATUS zbc_program_nquit(void)
6496 s = zbc_program_prep(&opnd, &num);
6497 if (s) RETURN_STATUS(s);
6498 s = zbc_num_ulong(num, &val);
6499 if (s) RETURN_STATUS(s);
6501 bc_vec_pop(&G.prog.results);
6503 if (G.prog.stack.len < val)
6504 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6505 if (G.prog.stack.len == val) {
6506 QUIT_OR_RETURN_TO_MAIN;
6509 bc_vec_npop(&G.prog.stack, val);
6513 #if ERRORS_ARE_FATAL
6514 # define zbc_program_nquit(...) (zbc_program_nquit(__VA_ARGS__), BC_STATUS_SUCCESS)
6517 static BC_STATUS zbc_program_execStr(char *code, size_t *bgn,
6520 BcStatus s = BC_STATUS_SUCCESS;
6528 if (!BC_PROG_STACK(&G.prog.results, 1))
6529 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6531 r = bc_vec_top(&G.prog.results);
6534 BcNum *n = n; // for compiler
6537 char *then_name = bc_program_name(code, bgn);
6538 char *else_name = NULL;
6540 if (code[*bgn] == BC_PARSE_STREND)
6543 else_name = bc_program_name(code, bgn);
6545 exec = r->d.n.len != 0;
6547 if (!exec && else_name != NULL) {
6554 v = bc_program_search(name, true);
6561 if (!exec) goto exit;
6562 if (!BC_PROG_STR(n)) {
6563 s = bc_error_variable_is_wrong_type();
6569 if (r->t == BC_RESULT_STR) {
6571 } else if (r->t == BC_RESULT_VAR) {
6573 s = zbc_program_num(r, &n, false);
6574 if (s || !BC_PROG_STR(n)) goto exit;
6580 fidx = sidx + BC_PROG_REQ_FUNCS;
6582 str = bc_program_str(sidx);
6583 f = bc_program_func(fidx);
6585 if (f->code.len == 0) {
6586 bc_parse_create(&prs, fidx);
6587 s = zbc_parse_text(&prs, *str);
6589 s = zcommon_parse_expr(&prs, BC_PARSE_NOCALL);
6592 if (prs.l.t.t != BC_LEX_EOF) {
6593 s = bc_error_bad_expression();
6597 bc_parse_free(&prs);
6601 ip.len = G.prog.results.len;
6604 bc_vec_pop(&G.prog.results);
6605 bc_vec_push(&G.prog.stack, &ip);
6607 RETURN_STATUS(BC_STATUS_SUCCESS);
6610 bc_parse_free(&prs);
6611 f = bc_program_func(fidx);
6612 bc_vec_pop_all(&f->code);
6614 bc_vec_pop(&G.prog.results);
6617 #if ERRORS_ARE_FATAL
6618 # define zbc_program_execStr(...) (zbc_program_execStr(__VA_ARGS__), BC_STATUS_SUCCESS)
6622 static void bc_program_pushGlobal(char inst)
6627 res.t = inst - BC_INST_IBASE + BC_RESULT_IBASE;
6628 if (inst == BC_INST_IBASE)
6629 val = (unsigned long) G.prog.ib_t;
6630 else if (inst == BC_INST_SCALE)
6631 val = (unsigned long) G.prog.scale;
6633 val = (unsigned long) G.prog.ob_t;
6635 bc_num_init_DEF_SIZE(&res.d.n);
6636 bc_num_ulong2num(&res.d.n, val);
6637 bc_vec_push(&G.prog.results, &res);
6640 static void bc_program_addFunc(char *name, size_t *idx)
6642 BcId entry, *entry_ptr;
6647 entry.idx = G.prog.fns.len;
6649 inserted = bc_map_insert(&G.prog.fn_map, &entry, idx);
6650 if (!inserted) free(name);
6652 entry_ptr = bc_vec_item(&G.prog.fn_map, *idx);
6653 *idx = entry_ptr->idx;
6657 BcFunc *func = bc_program_func(entry_ptr->idx);
6659 // We need to reset these, so the function can be repopulated.
6661 bc_vec_pop_all(&func->autos);
6662 bc_vec_pop_all(&func->code);
6663 bc_vec_pop_all(&func->labels);
6667 bc_vec_push(&G.prog.fns, &f);
6671 static BC_STATUS zbc_program_exec(void)
6675 BcInstPtr *ip = bc_vec_top(&G.prog.stack);
6676 BcFunc *func = bc_program_func(ip->func);
6677 char *code = func->code.v;
6680 while (ip->idx < func->code.len) {
6681 BcStatus s = BC_STATUS_SUCCESS;
6682 char inst = code[(ip->idx)++];
6686 case BC_INST_JUMP_ZERO:
6687 s = zbc_program_prep(&ptr, &num);
6688 if (s) RETURN_STATUS(s);
6689 cond = !bc_num_cmp(num, &G.prog.zero);
6690 bc_vec_pop(&G.prog.results);
6692 case BC_INST_JUMP: {
6694 size_t idx = bc_program_index(code, &ip->idx);
6695 addr = bc_vec_item(&func->labels, idx);
6696 if (inst == BC_INST_JUMP || cond) ip->idx = *addr;
6700 s = zbc_program_call(code, &ip->idx);
6702 case BC_INST_INC_PRE:
6703 case BC_INST_DEC_PRE:
6704 case BC_INST_INC_POST:
6705 case BC_INST_DEC_POST:
6706 s = zbc_program_incdec(inst);
6709 QUIT_OR_RETURN_TO_MAIN;
6713 s = zbc_program_return(inst);
6715 case BC_INST_BOOL_OR:
6716 case BC_INST_BOOL_AND:
6718 case BC_INST_REL_EQ:
6719 case BC_INST_REL_LE:
6720 case BC_INST_REL_GE:
6721 case BC_INST_REL_NE:
6722 case BC_INST_REL_LT:
6723 case BC_INST_REL_GT:
6724 s = zbc_program_logical(inst);
6727 s = zbc_program_read();
6730 s = zbc_program_pushVar(code, &ip->idx, false, false);
6732 case BC_INST_ARRAY_ELEM:
6734 s = zbc_program_pushArray(code, &ip->idx, inst);
6737 r.t = BC_RESULT_LAST;
6738 bc_vec_push(&G.prog.results, &r);
6743 bc_program_pushGlobal(inst);
6745 case BC_INST_SCALE_FUNC:
6746 case BC_INST_LENGTH:
6748 s = zbc_program_builtin(inst);
6751 r.t = BC_RESULT_CONSTANT;
6752 r.d.id.idx = bc_program_index(code, &ip->idx);
6753 bc_vec_push(&G.prog.results, &r);
6756 if (!BC_PROG_STACK(&G.prog.results, 1))
6757 s = bc_error_stack_has_too_few_elements();
6759 bc_vec_pop(&G.prog.results);
6761 case BC_INST_POP_EXEC:
6762 bc_vec_pop(&G.prog.stack);
6765 case BC_INST_PRINT_POP:
6766 case BC_INST_PRINT_STR:
6767 s = zbc_program_print(inst, 0);
6770 r.t = BC_RESULT_STR;
6771 r.d.id.idx = bc_program_index(code, &ip->idx);
6772 bc_vec_push(&G.prog.results, &r);
6775 case BC_INST_MULTIPLY:
6776 case BC_INST_DIVIDE:
6777 case BC_INST_MODULUS:
6780 s = zbc_program_op(inst);
6782 case BC_INST_BOOL_NOT:
6783 s = zbc_program_prep(&ptr, &num);
6784 if (s) RETURN_STATUS(s);
6785 bc_num_init_DEF_SIZE(&r.d.n);
6786 if (!bc_num_cmp(num, &G.prog.zero))
6788 //else bc_num_zero(&r.d.n); - already is
6789 bc_program_retire(&r, BC_RESULT_TEMP);
6792 s = zbc_program_negate();
6795 case BC_INST_ASSIGN_POWER:
6796 case BC_INST_ASSIGN_MULTIPLY:
6797 case BC_INST_ASSIGN_DIVIDE:
6798 case BC_INST_ASSIGN_MODULUS:
6799 case BC_INST_ASSIGN_PLUS:
6800 case BC_INST_ASSIGN_MINUS:
6802 case BC_INST_ASSIGN:
6803 s = zbc_program_assign(inst);
6806 case BC_INST_MODEXP:
6807 s = zbc_program_modexp();
6809 case BC_INST_DIVMOD:
6810 s = zbc_program_divmod();
6812 case BC_INST_EXECUTE:
6813 case BC_INST_EXEC_COND:
6814 cond = inst == BC_INST_EXEC_COND;
6815 s = zbc_program_execStr(code, &ip->idx, cond);
6817 case BC_INST_PRINT_STACK: {
6819 for (idx = 0; idx < G.prog.results.len; ++idx) {
6820 s = zbc_program_print(BC_INST_PRINT, idx);
6825 case BC_INST_CLEAR_STACK:
6826 bc_vec_pop_all(&G.prog.results);
6828 case BC_INST_STACK_LEN:
6829 bc_program_stackLen();
6831 case BC_INST_DUPLICATE:
6832 if (!BC_PROG_STACK(&G.prog.results, 1))
6833 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6834 ptr = bc_vec_top(&G.prog.results);
6835 bc_result_copy(&r, ptr);
6836 bc_vec_push(&G.prog.results, &r);
6838 case BC_INST_SWAP: {
6840 if (!BC_PROG_STACK(&G.prog.results, 2))
6841 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6842 ptr = bc_vec_item_rev(&G.prog.results, 0);
6843 ptr2 = bc_vec_item_rev(&G.prog.results, 1);
6844 memcpy(&r, ptr, sizeof(BcResult));
6845 memcpy(ptr, ptr2, sizeof(BcResult));
6846 memcpy(ptr2, &r, sizeof(BcResult));
6849 case BC_INST_ASCIIFY:
6850 s = zbc_program_asciify();
6852 case BC_INST_PRINT_STREAM:
6853 s = zbc_program_printStream();
6856 case BC_INST_PUSH_VAR: {
6857 bool copy = inst == BC_INST_LOAD;
6858 s = zbc_program_pushVar(code, &ip->idx, true, copy);
6861 case BC_INST_PUSH_TO_VAR: {
6862 char *name = bc_program_name(code, &ip->idx);
6863 s = zbc_program_copyToVar(name, true);
6868 if (G.prog.stack.len <= 2)
6869 QUIT_OR_RETURN_TO_MAIN;
6870 bc_vec_npop(&G.prog.stack, 2);
6873 s = zbc_program_nquit();
6878 if (s || G_interrupt) {
6883 // If the stack has changed, pointers may be invalid.
6884 ip = bc_vec_top(&G.prog.stack);
6885 func = bc_program_func(ip->func);
6886 code = func->code.v;
6889 RETURN_STATUS(BC_STATUS_SUCCESS);
6891 #if ERRORS_ARE_FATAL
6892 # define zbc_program_exec(...) (zbc_program_exec(__VA_ARGS__), BC_STATUS_SUCCESS)
6896 static void bc_vm_info(void)
6898 printf("%s "BB_VER"\n"
6899 "Copyright (c) 2018 Gavin D. Howard and contributors\n"
6903 static void bc_args(char **argv)
6909 #if ENABLE_FEATURE_BC_LONG_OPTIONS
6910 opts = option_mask32 |= getopt32long(argv, "wvsqli",
6911 "warn\0" No_argument "w"
6912 "version\0" No_argument "v"
6913 "standard\0" No_argument "s"
6914 "quiet\0" No_argument "q"
6915 "mathlib\0" No_argument "l"
6916 "interactive\0" No_argument "i"
6919 opts = option_mask32 |= getopt32(argv, "wvsqli");
6921 if (getenv("POSIXLY_CORRECT"))
6922 option_mask32 |= BC_FLAG_S;
6924 if (opts & BC_FLAG_V) {
6929 for (i = optind; argv[i]; ++i)
6930 bc_vec_push(&G.files, argv + i);
6933 static void bc_vm_envArgs(void)
6937 char *env_args = getenv("BC_ENV_ARGS");
6939 if (!env_args) return;
6941 G.env_args = xstrdup(env_args);
6944 bc_vec_init(&v, sizeof(char *), NULL);
6946 while (*(buf = skip_whitespace(buf)) != '\0') {
6947 bc_vec_push(&v, &buf);
6948 buf = skip_non_whitespace(buf);
6954 // NULL terminate, and pass argv[] so that first arg is argv[1]
6955 if (sizeof(int) == sizeof(char*)) {
6956 bc_vec_push(&v, &const_int_0);
6958 static char *const nullptr = NULL;
6959 bc_vec_push(&v, &nullptr);
6961 bc_args(((char **)v.v) - 1);
6967 static unsigned bc_vm_envLen(const char *var)
6973 len = BC_NUM_PRINT_WIDTH;
6974 if (!lenv) return len;
6976 len = bb_strtou(lenv, NULL, 10) - 1;
6977 if (errno || len < 2 || len >= INT_MAX)
6978 len = BC_NUM_PRINT_WIDTH;
6983 static BC_STATUS zbc_vm_process(const char *text)
6985 BcStatus s = zbc_parse_text(&G.prs, text);
6987 if (s) RETURN_STATUS(s);
6989 while (G.prs.l.t.t != BC_LEX_EOF) {
6990 ERROR_RETURN(s =) zcommon_parse(&G.prs);
6991 if (s) RETURN_STATUS(s);
6994 if (BC_PARSE_CAN_EXEC(&G.prs)) {
6995 s = zbc_program_exec();
7003 #if ERRORS_ARE_FATAL
7004 # define zbc_vm_process(...) (zbc_vm_process(__VA_ARGS__), BC_STATUS_SUCCESS)
7007 static BC_STATUS zbc_vm_file(const char *file)
7009 const char *sv_file;
7015 data = bc_read_file(file);
7016 if (!data) RETURN_STATUS(bc_error_fmt("file '%s' is not text", file));
7018 sv_file = G.prog.file;
7020 bc_lex_file(&G.prs.l);
7021 s = zbc_vm_process(data);
7024 main_func = bc_program_func(BC_PROG_MAIN);
7025 ip = bc_vec_item(&G.prog.stack, 0);
7027 if (main_func->code.len < ip->idx)
7028 s = bc_error_fmt("file '%s' is not executable", file);
7031 G.prog.file = sv_file;
7035 #if ERRORS_ARE_FATAL
7036 # define zbc_vm_file(...) (zbc_vm_file(__VA_ARGS__), BC_STATUS_SUCCESS)
7039 static BC_STATUS zbc_vm_stdin(void)
7047 bc_lex_file(&G.prs.l);
7049 bc_char_vec_init(&buffer);
7050 bc_char_vec_init(&buf);
7051 bc_vec_pushZeroByte(&buffer);
7053 // This loop is complex because the vm tries not to send any lines that end
7054 // with a backslash to the parser. The reason for that is because the parser
7055 // treats a backslash+newline combo as whitespace, per the bc spec. In that
7056 // case, and for strings and comments, the parser will expect more stuff.
7057 s = BC_STATUS_SUCCESS;
7066 if (len == 0) // "" buf means EOF
7070 if (str && buf.v[0] == G.send)
7072 else if (buf.v[0] == G.sbgn)
7077 if (string != buf.v && string[-1] != '\\') {
7078 // checking applet type is cheaper than accessing sbgn/send
7079 if (IS_DC) // dc: sbgn = send = '"'
7081 else { // bc: sbgn = '[', send = ']'
7089 if (c == '/' && *string == '*') {
7093 if (c == '*' && *string == '/')
7096 if (str || comment || string[-2] == '\\') {
7097 bc_vec_concat(&buffer, buf.v);
7102 bc_vec_concat(&buffer, buf.v);
7103 s = zbc_vm_process(buffer.v);
7105 if (ENABLE_FEATURE_CLEAN_UP && !G_ttyin) {
7106 // Debug config, non-interactive mode:
7107 // return all the way back to main.
7108 // Non-debug builds do not come here, they exit.
7113 bc_vec_pop_all(&buffer);
7117 s = bc_error("string end could not be found");
7120 s = bc_error("comment end could not be found");
7124 bc_vec_free(&buffer);
7127 #if ERRORS_ARE_FATAL
7128 # define zbc_vm_stdin(...) (zbc_vm_stdin(__VA_ARGS__), BC_STATUS_SUCCESS)
7132 static const char bc_lib[] = {
7135 "\n" "auto b,s,n,r,d,i,p,f,v"
7144 "\n" "scale=scale(x)+1"
7154 "\n" "for(i=2;v!=0;++i){"
7160 "\n" "while((d--)!=0)r*=r"
7163 "\n" "if(n!=0)return(1/r)"
7167 "\n" "auto b,s,r,p,a,q,i,v"
7171 "\n" "r=(1-10^scale)/1"
7182 "\n" "while(x<=0.5){"
7186 "\n" "r=a=(x-1)/(x+1)"
7189 "\n" "for(i=3;v!=0;i+=2){"
7200 "\n" "auto b,s,r,n,a,q,i"
7204 "\n" "scale=1.1*s+2"
7213 "\n" "if(q%2!=0)x=-x"
7217 "\n" "for(i=3;a!=0;i+=2){"
7218 "\n" "a*=q/(i*(i-1))"
7223 "\n" "if(n!=0)return(-r/1)"
7232 "\n" "x=s(2*a(1)+x)"
7238 "\n" "auto b,s,r,n,a,m,t,f,i,u"
7247 "\n" "if(scale<65){"
7248 "\n" "return(.7853981633974483096156608458198757210492923498437764552437361480/n)"
7252 "\n" "if(scale<65){"
7253 "\n" "return(.1973955598498807583700497651947902934475851037878521015176889402/n)"
7264 "\n" "x=(x-.2)/(1+.2*x)"
7269 "\n" "for(i=3;t!=0;i+=2){"
7276 "\n" "return((m*a+r)/n)"
7278 "\n" "define j(n,x){"
7279 "\n" "auto b,s,o,a,i,v,f"
7287 "\n" "if(n%2==1)o=1"
7290 "\n" "for(i=2;i<=n;++i)a*=i"
7292 "\n" "a=(x^n)/2^n/a"
7295 "\n" "scale=scale+length(a)-scale(a)"
7296 "\n" "for(i=1;v!=0;++i){"
7297 "\n" "v=v*f/i/(n+i)"
7303 "\n" "return(a*r/1)"
7308 static BC_STATUS zbc_vm_exec(void)
7314 if (option_mask32 & BC_FLAG_L) {
7316 // We know that internal library is not buggy,
7317 // thus error checking is normally disabled.
7318 # define DEBUG_LIB 0
7319 bc_lex_file(&G.prs.l);
7320 s = zbc_parse_text(&G.prs, bc_lib);
7321 if (DEBUG_LIB && s) RETURN_STATUS(s);
7323 while (G.prs.l.t.t != BC_LEX_EOF) {
7324 ERROR_RETURN(s =) zcommon_parse(&G.prs);
7325 if (DEBUG_LIB && s) RETURN_STATUS(s);
7327 s = zbc_program_exec();
7328 if (DEBUG_LIB && s) RETURN_STATUS(s);
7332 s = BC_STATUS_SUCCESS;
7333 for (i = 0; !s && i < G.files.len; ++i)
7334 s = zbc_vm_file(*((char **) bc_vec_item(&G.files, i)));
7335 if (ENABLE_FEATURE_CLEAN_UP && s && !G_ttyin) {
7336 // Debug config, non-interactive mode:
7337 // return all the way back to main.
7338 // Non-debug builds do not come here, they exit.
7342 if (IS_BC || (option_mask32 & BC_FLAG_I))
7345 if (!s && !BC_PARSE_CAN_EXEC(&G.prs))
7346 s = zbc_vm_process("");
7350 #if ERRORS_ARE_FATAL
7351 # define zbc_vm_exec(...) (zbc_vm_exec(__VA_ARGS__), BC_STATUS_SUCCESS)
7354 #if ENABLE_FEATURE_CLEAN_UP
7355 static void bc_program_free(void)
7357 bc_num_free(&G.prog.ib);
7358 bc_num_free(&G.prog.ob);
7359 bc_num_free(&G.prog.hexb);
7361 bc_num_free(&G.prog.strmb);
7363 bc_vec_free(&G.prog.fns);
7364 bc_vec_free(&G.prog.fn_map);
7365 bc_vec_free(&G.prog.vars);
7366 bc_vec_free(&G.prog.var_map);
7367 bc_vec_free(&G.prog.arrs);
7368 bc_vec_free(&G.prog.arr_map);
7369 bc_vec_free(&G.prog.strs);
7370 bc_vec_free(&G.prog.consts);
7371 bc_vec_free(&G.prog.results);
7372 bc_vec_free(&G.prog.stack);
7373 bc_num_free(&G.prog.last);
7374 bc_num_free(&G.prog.zero);
7375 bc_num_free(&G.prog.one);
7378 static void bc_vm_free(void)
7380 bc_vec_free(&G.files);
7382 bc_parse_free(&G.prs);
7387 static void bc_program_init(void)
7392 /* memset(&G.prog, 0, sizeof(G.prog)); - already is */
7393 memset(&ip, 0, sizeof(BcInstPtr));
7395 /* G.prog.nchars = G.prog.scale = 0; - already is */
7396 bc_num_init_DEF_SIZE(&G.prog.ib);
7397 bc_num_ten(&G.prog.ib);
7400 bc_num_init_DEF_SIZE(&G.prog.ob);
7401 bc_num_ten(&G.prog.ob);
7404 bc_num_init_DEF_SIZE(&G.prog.hexb);
7405 bc_num_ten(&G.prog.hexb);
7406 G.prog.hexb.num[0] = 6;
7409 bc_num_init_DEF_SIZE(&G.prog.strmb);
7410 bc_num_ulong2num(&G.prog.strmb, UCHAR_MAX + 1);
7413 bc_num_init_DEF_SIZE(&G.prog.last);
7414 //bc_num_zero(&G.prog.last); - already is
7416 bc_num_init_DEF_SIZE(&G.prog.zero);
7417 //bc_num_zero(&G.prog.zero); - already is
7419 bc_num_init_DEF_SIZE(&G.prog.one);
7420 bc_num_one(&G.prog.one);
7422 bc_vec_init(&G.prog.fns, sizeof(BcFunc), bc_func_free);
7423 bc_vec_init(&G.prog.fn_map, sizeof(BcId), bc_id_free);
7425 bc_program_addFunc(xstrdup("(main)"), &idx);
7426 bc_program_addFunc(xstrdup("(read)"), &idx);
7428 bc_vec_init(&G.prog.vars, sizeof(BcVec), bc_vec_free);
7429 bc_vec_init(&G.prog.var_map, sizeof(BcId), bc_id_free);
7431 bc_vec_init(&G.prog.arrs, sizeof(BcVec), bc_vec_free);
7432 bc_vec_init(&G.prog.arr_map, sizeof(BcId), bc_id_free);
7434 bc_vec_init(&G.prog.strs, sizeof(char *), bc_string_free);
7435 bc_vec_init(&G.prog.consts, sizeof(char *), bc_string_free);
7436 bc_vec_init(&G.prog.results, sizeof(BcResult), bc_result_free);
7437 bc_vec_init(&G.prog.stack, sizeof(BcInstPtr), NULL);
7438 bc_vec_push(&G.prog.stack, &ip);
7441 static int bc_vm_init(const char *env_len)
7443 #if ENABLE_FEATURE_EDITING
7444 G.line_input_state = new_line_input_t(DO_HISTORY);
7446 G.prog.len = bc_vm_envLen(env_len);
7448 bc_vec_init(&G.files, sizeof(char *), NULL);
7450 IF_BC(bc_vm_envArgs();)
7452 bc_parse_create(&G.prs, BC_PROG_MAIN);
7454 //TODO: in GNU bc, the check is (isatty(0) && isatty(1)),
7455 //-i option unconditionally enables this regardless of isatty():
7457 #if ENABLE_FEATURE_BC_SIGNALS
7459 // With SA_RESTART, most system calls will restart
7460 // (IOW: they won't fail with EINTR).
7461 // In particular, this means ^C won't cause
7462 // stdout to get into "error state" if SIGINT hits
7463 // within write() syscall.
7465 // The downside is that ^C while tty input is taken
7466 // will only be handled after [Enter] since read()
7467 // from stdin is not interrupted by ^C either,
7468 // it restarts, thus fgetc() does not return on ^C.
7469 // (This problem manifests only if line editing is disabled)
7470 signal_SA_RESTART_empty_mask(SIGINT, record_signo);
7472 // Without SA_RESTART, this exhibits a bug:
7473 // "while (1) print 1" and try ^C-ing it.
7474 // Intermittently, instead of returning to input line,
7475 // you'll get "output error: Interrupted system call"
7477 //signal_no_SA_RESTART_empty_mask(SIGINT, record_signo);
7481 return 0; // "not a tty"
7484 static BcStatus bc_vm_run(void)
7486 BcStatus st = zbc_vm_exec();
7487 #if ENABLE_FEATURE_CLEAN_UP
7488 if (G_exiting) // it was actually "halt" or "quit"
7491 # if ENABLE_FEATURE_EDITING
7492 free_line_input_t(G.line_input_state);
7500 int bc_main(int argc, char **argv) MAIN_EXTERNALLY_VISIBLE;
7501 int bc_main(int argc UNUSED_PARAM, char **argv)
7506 G.sbgn = G.send = '"';
7508 is_tty = bc_vm_init("BC_LINE_LENGTH");
7512 if (is_tty && !(option_mask32 & BC_FLAG_Q))
7520 int dc_main(int argc, char **argv) MAIN_EXTERNALLY_VISIBLE;
7521 int dc_main(int argc UNUSED_PARAM, char **argv)
7529 * TODO: dc (GNU bc 1.07.1) 1.4.1 seems to use width
7530 * 1 char wider than bc from the same package.
7531 * Both default width, and xC_LINE_LENGTH=N are wider:
7532 * "DC_LINE_LENGTH=5 dc -e'123456 p'" prints:
7535 * "echo '123456' | BC_LINE_LENGTH=5 bc" prints:
7538 * Do the same, or it's a bug?
7540 bc_vm_init("DC_LINE_LENGTH");
7542 // Run -e'SCRIPT' and -fFILE in order of appearance, then handle FILEs
7543 noscript = BC_FLAG_I;
7545 int n = getopt(argc, argv, "e:f:x");
7551 n = zbc_vm_process(optarg);
7556 n = zbc_vm_file(optarg);
7560 option_mask32 |= DC_FLAG_X;
7570 bc_vec_push(&G.files, argv++);
7573 option_mask32 |= noscript; // set BC_FLAG_I if we need to interpret stdin
7579 #endif // not DC_SMALL