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;)
724 // For error messages. Can be set to current parsed line,
725 // or [TODO] to current executing line (can be before last parsed one)
732 #if ENABLE_FEATURE_EDITING
733 line_input_t *line_input_state;
736 #define G (*ptr_to_globals)
737 #define INIT_G() do { \
738 SET_PTR_TO_GLOBALS(xzalloc(sizeof(G))); \
740 #define FREE_G() do { \
741 FREE_PTR_TO_GLOBALS(); \
743 #define G_posix (ENABLE_BC && (option_mask32 & BC_FLAG_S))
744 #define G_warn (ENABLE_BC && (option_mask32 & BC_FLAG_W))
745 #define G_exreg (ENABLE_DC && (option_mask32 & DC_FLAG_X))
746 #if ENABLE_FEATURE_BC_SIGNALS
747 # define G_interrupt bb_got_signal
748 # define G_ttyin G.ttyin
750 # define G_interrupt 0
753 #if ENABLE_FEATURE_CLEAN_UP
754 # define G_exiting G.exiting
758 #define IS_BC (ENABLE_BC && (!ENABLE_DC || applet_name[0] == 'b'))
759 #define IS_DC (ENABLE_DC && (!ENABLE_BC || applet_name[0] != 'b'))
763 // This is a bit array that corresponds to token types. An entry is
764 // true if the token is valid in an expression, false otherwise.
766 BC_PARSE_EXPRS_BITS = 0
767 + ((uint64_t)((0 << 0)+(0 << 1)+(1 << 2)+(1 << 3)+(1 << 4)+(1 << 5)+(1 << 6)+(1 << 7)) << (0*8))
768 + ((uint64_t)((1 << 0)+(1 << 1)+(1 << 2)+(1 << 3)+(1 << 4)+(1 << 5)+(1 << 6)+(1 << 7)) << (1*8))
769 + ((uint64_t)((1 << 0)+(1 << 1)+(1 << 2)+(1 << 3)+(1 << 4)+(1 << 5)+(1 << 6)+(1 << 7)) << (2*8))
770 + ((uint64_t)((1 << 0)+(1 << 1)+(1 << 2)+(0 << 3)+(0 << 4)+(1 << 5)+(1 << 6)+(0 << 7)) << (3*8))
771 + ((uint64_t)((0 << 0)+(0 << 1)+(0 << 2)+(0 << 3)+(0 << 4)+(0 << 5)+(1 << 6)+(1 << 7)) << (4*8))
772 + ((uint64_t)((0 << 0)+(0 << 1)+(0 << 2)+(0 << 3)+(0 << 4)+(0 << 5)+(0 << 6)+(1 << 7)) << (5*8))
773 + ((uint64_t)((0 << 0)+(1 << 1)+(1 << 2)+(1 << 3)+(1 << 4)+(0 << 5)+(0 << 6)+(1 << 7)) << (6*8))
774 + ((uint64_t)((0 << 0)+(1 << 1)+(1 << 2)+(0 << 3) ) << (7*8))
776 static ALWAYS_INLINE long bc_parse_exprs(unsigned i)
778 #if ULONG_MAX > 0xffffffff
779 // 64-bit version (will not work correctly for 32-bit longs!)
780 return BC_PARSE_EXPRS_BITS & (1UL << i);
783 unsigned long m = (uint32_t)BC_PARSE_EXPRS_BITS;
785 m = (uint32_t)(BC_PARSE_EXPRS_BITS >> 32);
788 return m & (1UL << i);
792 // This is an array of data for operators that correspond to token types.
793 static const uint8_t bc_parse_ops[] = {
794 #define OP(p,l) ((int)(l) * 0x10 + (p))
795 OP(0, false), OP( 0, false ), // inc dec
798 OP(3, true ), OP( 3, true ), OP( 3, true ), // pow mul div
799 OP(4, true ), OP( 4, true ), // mod + -
800 OP(6, true ), OP( 6, true ), OP( 6, true ), OP( 6, true ), OP( 6, true ), OP( 6, true ), // == <= >= != < >
802 OP(7, true ), OP( 7, true ), // or and
803 OP(5, false), OP( 5, false ), OP( 5, false ), OP( 5, false ), OP( 5, false ), // ^= *= /= %= +=
804 OP(5, false), OP( 5, false ), // -= =
807 #define bc_parse_op_PREC(i) (bc_parse_ops[i] & 0x0f)
808 #define bc_parse_op_LEFT(i) (bc_parse_ops[i] & 0x10)
810 // Byte array of up to 4 BC_LEX's, packed into 32-bit word
811 typedef uint32_t BcParseNext;
813 // These identify what tokens can come after expressions in certain cases.
815 #define BC_PARSE_NEXT4(a,b,c,d) ( (a) | ((b)<<8) | ((c)<<16) | ((((d)|0x80)<<24)) )
816 #define BC_PARSE_NEXT2(a,b) BC_PARSE_NEXT4(a,b,0xff,0xff)
817 #define BC_PARSE_NEXT1(a) BC_PARSE_NEXT4(a,0xff,0xff,0xff)
818 bc_parse_next_expr = BC_PARSE_NEXT4(BC_LEX_NLINE, BC_LEX_SCOLON, BC_LEX_RBRACE, BC_LEX_EOF),
819 bc_parse_next_param = BC_PARSE_NEXT2(BC_LEX_RPAREN, BC_LEX_COMMA),
820 bc_parse_next_print = BC_PARSE_NEXT4(BC_LEX_COMMA, BC_LEX_NLINE, BC_LEX_SCOLON, BC_LEX_EOF),
821 bc_parse_next_rel = BC_PARSE_NEXT1(BC_LEX_RPAREN),
822 bc_parse_next_elem = BC_PARSE_NEXT1(BC_LEX_RBRACKET),
823 bc_parse_next_for = BC_PARSE_NEXT1(BC_LEX_SCOLON),
824 bc_parse_next_read = BC_PARSE_NEXT2(BC_LEX_NLINE, BC_LEX_EOF),
825 #undef BC_PARSE_NEXT4
826 #undef BC_PARSE_NEXT2
827 #undef BC_PARSE_NEXT1
832 static const //BcLexType - should be this type, but narrower type saves size:
835 BC_LEX_OP_REL_EQ, BC_LEX_OP_REL_LE, BC_LEX_OP_REL_GE, BC_LEX_OP_REL_NE,
836 BC_LEX_OP_REL_LT, BC_LEX_OP_REL_GT, BC_LEX_SCOLON, BC_LEX_COLON,
837 BC_LEX_ELSE, BC_LEX_LOAD, BC_LEX_LOAD_POP, BC_LEX_OP_ASSIGN,
841 static const //BcLexType - should be this type
844 BC_LEX_OP_MODULUS, BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_LPAREN,
845 BC_LEX_INVALID, BC_LEX_OP_MULTIPLY, BC_LEX_OP_PLUS, BC_LEX_INVALID,
846 BC_LEX_OP_MINUS, BC_LEX_INVALID, BC_LEX_OP_DIVIDE,
847 BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID,
848 BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID,
849 BC_LEX_INVALID, BC_LEX_INVALID,
850 BC_LEX_COLON, BC_LEX_SCOLON, BC_LEX_OP_REL_GT, BC_LEX_OP_REL_EQ,
851 BC_LEX_OP_REL_LT, BC_LEX_KEY_READ, BC_LEX_INVALID,
852 BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID,
853 BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_EQ_NO_REG, BC_LEX_INVALID,
854 BC_LEX_KEY_IBASE, BC_LEX_INVALID, BC_LEX_KEY_SCALE, BC_LEX_LOAD_POP,
855 BC_LEX_INVALID, BC_LEX_OP_BOOL_NOT, BC_LEX_KEY_OBASE, BC_LEX_PRINT_STREAM,
856 BC_LEX_NQUIT, BC_LEX_POP, BC_LEX_STORE_PUSH, BC_LEX_INVALID, BC_LEX_INVALID,
857 BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_SCALE_FACTOR, BC_LEX_INVALID,
858 BC_LEX_KEY_LENGTH, BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID,
859 BC_LEX_OP_POWER, BC_LEX_NEG, BC_LEX_INVALID,
860 BC_LEX_ASCIIFY, BC_LEX_INVALID, BC_LEX_CLEAR_STACK, BC_LEX_DUPLICATE,
861 BC_LEX_ELSE, BC_LEX_PRINT_STACK, BC_LEX_INVALID, BC_LEX_INVALID,
862 BC_LEX_STORE_IBASE, BC_LEX_INVALID, BC_LEX_STORE_SCALE, BC_LEX_LOAD,
863 BC_LEX_INVALID, BC_LEX_PRINT_POP, BC_LEX_STORE_OBASE, BC_LEX_KEY_PRINT,
864 BC_LEX_KEY_QUIT, BC_LEX_SWAP, BC_LEX_OP_ASSIGN, BC_LEX_INVALID,
865 BC_LEX_INVALID, BC_LEX_KEY_SQRT, BC_LEX_INVALID, BC_LEX_EXECUTE,
866 BC_LEX_INVALID, BC_LEX_STACK_LEVEL,
867 BC_LEX_LBRACE, BC_LEX_OP_MODEXP, BC_LEX_INVALID, BC_LEX_OP_DIVMOD,
871 static const //BcInst - should be this type. Using signed narrow type since BC_INST_INVALID is -1
874 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID, BC_INST_REL_GE,
875 BC_INST_INVALID, BC_INST_POWER, BC_INST_MULTIPLY, BC_INST_DIVIDE,
876 BC_INST_MODULUS, BC_INST_PLUS, BC_INST_MINUS,
877 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID,
878 BC_INST_INVALID, BC_INST_INVALID,
879 BC_INST_BOOL_NOT, BC_INST_INVALID, BC_INST_INVALID,
880 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID,
881 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID,
882 BC_INST_INVALID, BC_INST_INVALID, BC_INST_REL_GT, BC_INST_INVALID,
883 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID, BC_INST_REL_GE,
884 BC_INST_INVALID, BC_INST_INVALID,
885 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID,
886 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID,
887 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID, BC_INST_IBASE,
888 BC_INST_INVALID, BC_INST_INVALID, BC_INST_LENGTH, BC_INST_INVALID,
889 BC_INST_OBASE, BC_INST_PRINT, BC_INST_QUIT, BC_INST_INVALID,
890 BC_INST_INVALID, BC_INST_SCALE, BC_INST_SQRT, BC_INST_INVALID,
891 BC_INST_REL_EQ, BC_INST_MODEXP, BC_INST_DIVMOD, BC_INST_INVALID,
892 BC_INST_INVALID, BC_INST_EXECUTE, BC_INST_PRINT_STACK, BC_INST_CLEAR_STACK,
893 BC_INST_STACK_LEN, BC_INST_DUPLICATE, BC_INST_SWAP, BC_INST_POP,
894 BC_INST_ASCIIFY, BC_INST_PRINT_STREAM, BC_INST_INVALID, BC_INST_INVALID,
895 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID,
896 BC_INST_PRINT, BC_INST_NQUIT, BC_INST_SCALE_FUNC,
900 // In configurations where errors abort instead of propagating error
901 // return code up the call chain, functions returning BC_STATUS
902 // actually don't return anything, they always succeed and return "void".
903 // A macro wrapper is provided, which makes this statement work:
905 // and makes it visible to the compiler that s is always zero,
906 // allowing compiler to optimize dead code after the statement.
908 // To make code more readable, each such function has a "z"
909 // ("always returning zero") prefix, i.e. zbc_foo or zdc_foo.
911 #if ENABLE_FEATURE_BC_SIGNALS || ENABLE_FEATURE_CLEAN_UP
912 # define ERRORS_ARE_FATAL 0
913 # define ERRORFUNC /*nothing*/
914 # define ERROR_RETURN(a) a
915 //moved up: # define BC_STATUS BcStatus
916 # define RETURN_STATUS(v) return (v)
918 # define ERRORS_ARE_FATAL 1
919 # define ERRORFUNC NORETURN
920 # define ERROR_RETURN(a) /*nothing*/
921 //moved up: # define BC_STATUS void
922 # define RETURN_STATUS(v) do { ((void)(v)); return; } while (0)
925 #define BC_NUM_NEG(n, neg) ((((ssize_t)(n)) ^ -((ssize_t)(neg))) + (neg))
926 #define BC_NUM_ONE(n) ((n)->len == 1 && (n)->rdx == 0 && (n)->num[0] == 1)
927 #define BC_NUM_INT(n) ((n)->len - (n)->rdx)
928 //#define BC_NUM_AREQ(a, b) (BC_MAX((a)->rdx, (b)->rdx) + BC_MAX(BC_NUM_INT(a), BC_NUM_INT(b)) + 1)
929 static /*ALWAYS_INLINE*/ size_t BC_NUM_AREQ(BcNum *a, BcNum *b)
931 return BC_MAX(a->rdx, b->rdx) + BC_MAX(BC_NUM_INT(a), BC_NUM_INT(b)) + 1;
933 //#define BC_NUM_MREQ(a, b, scale) (BC_NUM_INT(a) + BC_NUM_INT(b) + BC_MAX((scale), (a)->rdx + (b)->rdx) + 1)
934 static /*ALWAYS_INLINE*/ size_t BC_NUM_MREQ(BcNum *a, BcNum *b, size_t scale)
936 return BC_NUM_INT(a) + BC_NUM_INT(b) + BC_MAX(scale, a->rdx + b->rdx) + 1;
939 typedef void (*BcNumDigitOp)(size_t, size_t, bool) FAST_FUNC;
941 typedef BC_STATUS (*BcNumBinaryOp)(BcNum *, BcNum *, BcNum *, size_t) FAST_FUNC;
943 static BC_STATUS zbc_num_binary(BcNum *a, BcNum *b, BcNum *c, size_t scale,
944 BcNumBinaryOp op, size_t req);
945 static FAST_FUNC BC_STATUS zbc_num_a(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale);
946 static FAST_FUNC BC_STATUS zbc_num_s(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale);
947 static FAST_FUNC BC_STATUS zbc_num_p(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale);
948 static FAST_FUNC BC_STATUS zbc_num_m(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale);
949 static FAST_FUNC BC_STATUS zbc_num_d(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale);
950 static FAST_FUNC BC_STATUS zbc_num_rem(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale);
952 static FAST_FUNC BC_STATUS zbc_num_add(BcNum *a, BcNum *b, BcNum *c, size_t scale)
954 BcNumBinaryOp op = (!a->neg == !b->neg) ? zbc_num_a : zbc_num_s;
956 RETURN_STATUS(zbc_num_binary(a, b, c, false, op, BC_NUM_AREQ(a, b)));
959 static FAST_FUNC BC_STATUS zbc_num_sub(BcNum *a, BcNum *b, BcNum *c, size_t scale)
961 BcNumBinaryOp op = (!a->neg == !b->neg) ? zbc_num_s : zbc_num_a;
963 RETURN_STATUS(zbc_num_binary(a, b, c, true, op, BC_NUM_AREQ(a, b)));
966 static FAST_FUNC BC_STATUS zbc_num_mul(BcNum *a, BcNum *b, BcNum *c, size_t scale)
968 size_t req = BC_NUM_MREQ(a, b, scale);
969 RETURN_STATUS(zbc_num_binary(a, b, c, scale, zbc_num_m, req));
972 static FAST_FUNC BC_STATUS zbc_num_div(BcNum *a, BcNum *b, BcNum *c, size_t scale)
974 size_t req = BC_NUM_MREQ(a, b, scale);
975 RETURN_STATUS(zbc_num_binary(a, b, c, scale, zbc_num_d, req));
978 static FAST_FUNC BC_STATUS zbc_num_mod(BcNum *a, BcNum *b, BcNum *c, size_t scale)
980 size_t req = BC_NUM_MREQ(a, b, scale);
981 RETURN_STATUS(zbc_num_binary(a, b, c, scale, zbc_num_rem, req));
984 static FAST_FUNC BC_STATUS zbc_num_pow(BcNum *a, BcNum *b, BcNum *c, size_t scale)
986 RETURN_STATUS(zbc_num_binary(a, b, c, scale, zbc_num_p, a->len * b->len + 1));
989 static const BcNumBinaryOp zbc_program_ops[] = {
990 zbc_num_pow, zbc_num_mul, zbc_num_div, zbc_num_mod, zbc_num_add, zbc_num_sub,
993 # define zbc_num_add(...) (zbc_num_add(__VA_ARGS__), BC_STATUS_SUCCESS)
994 # define zbc_num_sub(...) (zbc_num_sub(__VA_ARGS__), BC_STATUS_SUCCESS)
995 # define zbc_num_mul(...) (zbc_num_mul(__VA_ARGS__), BC_STATUS_SUCCESS)
996 # define zbc_num_div(...) (zbc_num_div(__VA_ARGS__), BC_STATUS_SUCCESS)
997 # define zbc_num_mod(...) (zbc_num_mod(__VA_ARGS__), BC_STATUS_SUCCESS)
998 # define zbc_num_pow(...) (zbc_num_pow(__VA_ARGS__), BC_STATUS_SUCCESS)
1001 static void fflush_and_check(void)
1004 if (ferror(stdout) || ferror(stderr))
1005 bb_perror_msg_and_die("output error");
1008 #if ENABLE_FEATURE_CLEAN_UP
1009 #define QUIT_OR_RETURN_TO_MAIN \
1011 IF_FEATURE_BC_SIGNALS(G_ttyin = 0;) /* do not loop in main loop anymore */ \
1013 return BC_STATUS_FAILURE; \
1016 #define QUIT_OR_RETURN_TO_MAIN quit()
1019 static void quit(void) NORETURN;
1020 static void quit(void)
1023 bb_perror_msg_and_die("input error");
1028 static void bc_verror_msg(const char *fmt, va_list p)
1030 const char *sv = sv; /* for compiler */
1033 applet_name = xasprintf("%s: %s:%u", applet_name, G.prog.file, G.err_line);
1035 bb_verror_msg(fmt, p, NULL);
1037 free((char*)applet_name);
1042 static NOINLINE ERRORFUNC int bc_error_fmt(const char *fmt, ...)
1047 bc_verror_msg(fmt, p);
1050 if (!ENABLE_FEATURE_CLEAN_UP && !G_ttyin)
1052 ERROR_RETURN(return BC_STATUS_FAILURE;)
1056 static NOINLINE int bc_posix_error_fmt(const char *fmt, ...)
1060 // Are non-POSIX constructs totally ok?
1061 if (!(option_mask32 & (BC_FLAG_S|BC_FLAG_W)))
1062 return BC_STATUS_SUCCESS; // yes
1065 bc_verror_msg(fmt, p);
1068 // Do we treat non-POSIX constructs as errors?
1069 if (!(option_mask32 & BC_FLAG_S))
1070 return BC_STATUS_SUCCESS; // no, it's a warning
1071 if (!ENABLE_FEATURE_CLEAN_UP && !G_ttyin)
1073 return BC_STATUS_FAILURE;
1077 // We use error functions with "return bc_error(FMT[, PARAMS])" idiom.
1078 // This idiom begs for tail-call optimization, but for it to work,
1079 // function must not have caller-cleaned parameters on stack.
1080 // Unfortunately, vararg function API does exactly that on most arches.
1081 // Thus, use these shims for the cases when we have no vararg PARAMS:
1082 static ERRORFUNC int bc_error(const char *msg)
1084 ERROR_RETURN(return) bc_error_fmt("%s", msg);
1086 static ERRORFUNC int bc_error_bad_character(char c)
1088 ERROR_RETURN(return) bc_error_fmt("bad character '%c'", c);
1090 static ERRORFUNC int bc_error_bad_expression(void)
1092 ERROR_RETURN(return) bc_error("bad expression");
1094 static ERRORFUNC int bc_error_bad_token(void)
1096 ERROR_RETURN(return) bc_error("bad token");
1098 static ERRORFUNC int bc_error_stack_has_too_few_elements(void)
1100 ERROR_RETURN(return) bc_error("stack has too few elements");
1102 static ERRORFUNC int bc_error_variable_is_wrong_type(void)
1104 ERROR_RETURN(return) bc_error("variable is wrong type");
1106 static ERRORFUNC int bc_error_nested_read_call(void)
1108 ERROR_RETURN(return) bc_error("read() call inside of a read() call");
1111 static int bc_POSIX_requires(const char *msg)
1113 return bc_posix_error_fmt("POSIX requires %s", msg);
1115 static int bc_POSIX_does_not_allow(const char *msg)
1117 return bc_posix_error_fmt("%s%s", "POSIX does not allow ", msg);
1119 static int bc_POSIX_does_not_allow_bool_ops_this_is_bad(const char *msg)
1121 return bc_posix_error_fmt("%s%s %s", "POSIX does not allow ", "boolean operators; the following is bad:", msg);
1123 static int bc_POSIX_does_not_allow_empty_X_expression_in_for(const char *msg)
1125 return bc_posix_error_fmt("%san empty %s expression in a for loop", "POSIX does not allow ", msg);
1129 static void bc_vec_grow(BcVec *v, size_t n)
1131 size_t cap = v->cap * 2;
1132 while (cap < v->len + n) cap *= 2;
1133 v->v = xrealloc(v->v, v->size * cap);
1137 static void bc_vec_init(BcVec *v, size_t esize, BcVecFree dtor)
1140 v->cap = BC_VEC_START_CAP;
1143 v->v = xmalloc(esize * BC_VEC_START_CAP);
1146 static void bc_char_vec_init(BcVec *v)
1148 bc_vec_init(v, sizeof(char), NULL);
1151 static void bc_vec_expand(BcVec *v, size_t req)
1154 v->v = xrealloc(v->v, v->size * req);
1159 static void bc_vec_pop(BcVec *v)
1163 v->dtor(v->v + (v->size * v->len));
1166 static void bc_vec_npop(BcVec *v, size_t n)
1171 size_t len = v->len - n;
1172 while (v->len > len) v->dtor(v->v + (v->size * --v->len));
1176 static void bc_vec_pop_all(BcVec *v)
1178 bc_vec_npop(v, v->len);
1181 static void bc_vec_push(BcVec *v, const void *data)
1183 if (v->len + 1 > v->cap) bc_vec_grow(v, 1);
1184 memmove(v->v + (v->size * v->len), data, v->size);
1188 static void bc_vec_pushByte(BcVec *v, char data)
1190 bc_vec_push(v, &data);
1193 static void bc_vec_pushZeroByte(BcVec *v)
1195 //bc_vec_pushByte(v, '\0');
1197 bc_vec_push(v, &const_int_0);
1200 static void bc_vec_pushAt(BcVec *v, const void *data, size_t idx)
1203 bc_vec_push(v, data);
1208 if (v->len == v->cap) bc_vec_grow(v, 1);
1210 ptr = v->v + v->size * idx;
1212 memmove(ptr + v->size, ptr, v->size * (v->len++ - idx));
1213 memmove(ptr, data, v->size);
1217 static void bc_vec_string(BcVec *v, size_t len, const char *str)
1220 bc_vec_expand(v, len + 1);
1221 memcpy(v->v, str, len);
1224 bc_vec_pushZeroByte(v);
1227 #if ENABLE_FEATURE_BC_SIGNALS && ENABLE_FEATURE_EDITING
1228 static void bc_vec_concat(BcVec *v, const char *str)
1232 if (v->len == 0) bc_vec_pushZeroByte(v);
1235 len = v->len + slen;
1237 if (v->cap < len) bc_vec_grow(v, slen);
1238 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 bad_input_byte(char c)
1331 if ((c < ' ' && c != '\t' && c != '\r' && c != '\n') // also allow '\v' '\f'?
1334 bc_error_fmt("illegal character 0x%02x", c);
1340 // Note: it _appends_ data from the stdin to vec.
1341 static void bc_read_line(BcVec *vec)
1346 #if ENABLE_FEATURE_BC_SIGNALS
1347 if (G_interrupt) { // ^C was pressed
1350 // GNU bc says "interrupted execution."
1351 // GNU dc says "Interrupt!"
1352 fputs("\ninterrupted execution\n", stderr);
1355 # if ENABLE_FEATURE_EDITING
1358 # define line_buf bb_common_bufsiz1
1359 n = read_line_input(G.line_input_state, "", line_buf, COMMON_BUFSIZE);
1360 if (n <= 0) { // read errors or EOF, or ^D, or ^C
1363 bc_vec_pushZeroByte(vec);
1368 char c = line_buf[i++];
1370 if (bad_input_byte(c)) goto again;
1372 bc_vec_concat(vec, line_buf);
1380 size_t len = vec->len;
1382 IF_FEATURE_BC_SIGNALS(errno = 0;)
1385 #if ENABLE_FEATURE_BC_SIGNALS && !ENABLE_FEATURE_EDITING
1386 // Both conditions appear simultaneously, check both just in case
1387 if (errno == EINTR || G_interrupt) {
1395 quit(); // this emits error message
1396 // Note: EOF does not append '\n', therefore:
1397 // printf 'print 123\n' | bc - works
1398 // printf 'print 123' | bc - fails (syntax error)
1401 bad_chars |= bad_input_byte(c);
1402 bc_vec_pushByte(vec, (char)c);
1403 } while (c != '\n');
1405 // Bad chars on this line, ignore entire line
1409 bc_vec_pushZeroByte(vec);
1413 static char* bc_read_file(const char *path)
1416 size_t size = ((size_t) -1);
1419 // Never returns NULL (dies on errors)
1420 buf = xmalloc_xopen_read_close(path, &size);
1422 for (i = 0; i < size; ++i) {
1424 if ((c < ' ' && c != '\t' && c != '\r' && c != '\n') // also allow '\v' '\f'?
1436 static void bc_num_setToZero(BcNum *n, size_t scale)
1443 static void bc_num_zero(BcNum *n)
1445 bc_num_setToZero(n, 0);
1448 static void bc_num_one(BcNum *n)
1450 bc_num_setToZero(n, 0);
1455 static void bc_num_ten(BcNum *n)
1457 bc_num_setToZero(n, 0);
1463 // Note: this also sets BcNum to zero
1464 static void bc_num_init(BcNum *n, size_t req)
1466 req = req >= BC_NUM_DEF_SIZE ? req : BC_NUM_DEF_SIZE;
1467 //memset(n, 0, sizeof(BcNum)); - cleared by assignments below
1468 n->num = xmalloc(req);
1475 static void bc_num_init_DEF_SIZE(BcNum *n)
1477 bc_num_init(n, BC_NUM_DEF_SIZE);
1480 static void bc_num_expand(BcNum *n, size_t req)
1482 req = req >= BC_NUM_DEF_SIZE ? req : BC_NUM_DEF_SIZE;
1484 n->num = xrealloc(n->num, req);
1489 static FAST_FUNC void bc_num_free(void *num)
1491 free(((BcNum *) num)->num);
1494 static void bc_num_copy(BcNum *d, BcNum *s)
1497 bc_num_expand(d, s->cap);
1501 memcpy(d->num, s->num, sizeof(BcDig) * d->len);
1505 static BC_STATUS zbc_num_ulong(BcNum *n, unsigned long *result_p)
1508 unsigned long pow, result;
1510 if (n->neg) RETURN_STATUS(bc_error("negative number"));
1512 for (result = 0, pow = 1, i = n->rdx; i < n->len; ++i) {
1514 unsigned long prev = result, powprev = pow;
1516 result += ((unsigned long) n->num[i]) * pow;
1519 if (result < prev || pow < powprev)
1520 RETURN_STATUS(bc_error("overflow"));
1526 RETURN_STATUS(BC_STATUS_SUCCESS);
1528 #if ERRORS_ARE_FATAL
1529 # define zbc_num_ulong(...) (zbc_num_ulong(__VA_ARGS__), BC_STATUS_SUCCESS)
1532 static void bc_num_ulong2num(BcNum *n, unsigned long val)
1538 if (val == 0) return;
1540 if (ULONG_MAX == 0xffffffffUL)
1541 bc_num_expand(n, 10); // 10 digits: 4294967295
1542 if (ULONG_MAX == 0xffffffffffffffffULL)
1543 bc_num_expand(n, 20); // 20 digits: 18446744073709551615
1544 BUILD_BUG_ON(ULONG_MAX > 0xffffffffffffffffULL);
1551 if (val == 0) break;
1555 static void bc_num_subArrays(BcDig *restrict a, BcDig *restrict b,
1559 for (i = 0; i < len; ++i) {
1560 for (a[i] -= b[i], j = 0; a[i + j] < 0;) {
1567 static ssize_t bc_num_compare(BcDig *restrict a, BcDig *restrict b, size_t len)
1571 for (i = len - 1; i < len && !(c = a[i] - b[i]); --i);
1572 return BC_NUM_NEG(i + 1, c < 0);
1575 static ssize_t bc_num_cmp(BcNum *a, BcNum *b)
1577 size_t i, min, a_int, b_int, diff;
1578 BcDig *max_num, *min_num;
1582 if (a == b) return 0;
1583 if (a->len == 0) return BC_NUM_NEG(!!b->len, !b->neg);
1584 if (b->len == 0) return BC_NUM_NEG(1, a->neg);
1586 if (a->neg != b->neg) // signs of a and b differ
1587 // +a,-b = a>b = 1 or -a,+b = a<b = -1
1588 return (int)b->neg - (int)a->neg;
1589 neg = a->neg; // 1 if both negative, 0 if both positive
1591 a_int = BC_NUM_INT(a);
1592 b_int = BC_NUM_INT(b);
1595 if (a_int != 0) return (ssize_t) a_int;
1597 a_max = (a->rdx > b->rdx);
1600 diff = a->rdx - b->rdx;
1601 max_num = a->num + diff;
1603 // neg = (a_max == neg); - NOP (maps 1->1 and 0->0)
1606 diff = b->rdx - a->rdx;
1607 max_num = b->num + diff;
1609 neg = !neg; // same as "neg = (a_max == neg)"
1612 cmp = bc_num_compare(max_num, min_num, b_int + min);
1613 if (cmp != 0) return BC_NUM_NEG(cmp, neg);
1615 for (max_num -= diff, i = diff - 1; i < diff; --i) {
1616 if (max_num[i]) return BC_NUM_NEG(1, neg);
1622 static void bc_num_truncate(BcNum *n, size_t places)
1624 if (places == 0) return;
1630 memmove(n->num, n->num + places, n->len * sizeof(BcDig));
1634 static void bc_num_extend(BcNum *n, size_t places)
1636 size_t len = n->len + places;
1640 if (n->cap < len) bc_num_expand(n, len);
1642 memmove(n->num + places, n->num, sizeof(BcDig) * n->len);
1643 memset(n->num, 0, sizeof(BcDig) * places);
1650 static void bc_num_clean(BcNum *n)
1652 while (n->len > 0 && n->num[n->len - 1] == 0) --n->len;
1655 else if (n->len < n->rdx)
1659 static void bc_num_retireMul(BcNum *n, size_t scale, bool neg1, bool neg2)
1662 bc_num_extend(n, scale - n->rdx);
1664 bc_num_truncate(n, n->rdx - scale);
1667 if (n->len != 0) n->neg = !neg1 != !neg2;
1670 static void bc_num_split(BcNum *restrict n, size_t idx, BcNum *restrict a,
1675 b->len = n->len - idx;
1677 a->rdx = b->rdx = 0;
1679 memcpy(b->num, n->num + idx, b->len * sizeof(BcDig));
1680 memcpy(a->num, n->num, idx * sizeof(BcDig));
1691 static BC_STATUS zbc_num_shift(BcNum *n, size_t places)
1693 if (places == 0 || n->len == 0) RETURN_STATUS(BC_STATUS_SUCCESS);
1695 // This check makes sense only if size_t is (much) larger than BC_MAX_NUM.
1696 if (SIZE_MAX > (BC_MAX_NUM | 0xff)) {
1697 if (places + n->len > BC_MAX_NUM)
1698 RETURN_STATUS(bc_error("number too long: must be [1,"BC_MAX_NUM_STR"]"));
1701 if (n->rdx >= places)
1704 bc_num_extend(n, places - n->rdx);
1710 RETURN_STATUS(BC_STATUS_SUCCESS);
1712 #if ERRORS_ARE_FATAL
1713 # define zbc_num_shift(...) (zbc_num_shift(__VA_ARGS__), BC_STATUS_SUCCESS)
1716 static BC_STATUS zbc_num_inv(BcNum *a, BcNum *b, size_t scale)
1725 RETURN_STATUS(zbc_num_div(&one, a, b, scale));
1727 #if ERRORS_ARE_FATAL
1728 # define zbc_num_inv(...) (zbc_num_inv(__VA_ARGS__), BC_STATUS_SUCCESS)
1731 static FAST_FUNC BC_STATUS zbc_num_a(BcNum *a, BcNum *b, BcNum *restrict c, size_t sub)
1733 BcDig *ptr, *ptr_a, *ptr_b, *ptr_c;
1734 size_t i, max, min_rdx, min_int, diff, a_int, b_int;
1737 // Because this function doesn't need to use scale (per the bc spec),
1738 // I am hijacking it to say whether it's doing an add or a subtract.
1742 if (sub && c->len) c->neg = !c->neg;
1743 RETURN_STATUS(BC_STATUS_SUCCESS);
1747 RETURN_STATUS(BC_STATUS_SUCCESS);
1751 c->rdx = BC_MAX(a->rdx, b->rdx);
1752 min_rdx = BC_MIN(a->rdx, b->rdx);
1755 if (a->rdx > b->rdx) {
1756 diff = a->rdx - b->rdx;
1758 ptr_a = a->num + diff;
1762 diff = b->rdx - a->rdx;
1765 ptr_b = b->num + diff;
1768 for (ptr_c = c->num, i = 0; i < diff; ++i, ++c->len) ptr_c[i] = ptr[i];
1771 a_int = BC_NUM_INT(a);
1772 b_int = BC_NUM_INT(b);
1774 if (a_int > b_int) {
1785 for (carry = 0, i = 0; i < min_rdx + min_int; ++i, ++c->len) {
1786 in = ((int) ptr_a[i]) + ((int) ptr_b[i]) + carry;
1788 ptr_c[i] = (BcDig)(in % 10);
1791 for (; i < max + min_rdx; ++i, ++c->len) {
1792 in = ((int) ptr[i]) + carry;
1794 ptr_c[i] = (BcDig)(in % 10);
1797 if (carry != 0) c->num[c->len++] = (BcDig) carry;
1799 RETURN_STATUS(BC_STATUS_SUCCESS); // can't make void, see zbc_num_binary()
1802 static FAST_FUNC BC_STATUS zbc_num_s(BcNum *a, BcNum *b, BcNum *restrict c, size_t sub)
1805 BcNum *minuend, *subtrahend;
1807 bool aneg, bneg, neg;
1809 // Because this function doesn't need to use scale (per the bc spec),
1810 // I am hijacking it to say whether it's doing an add or a subtract.
1814 if (sub && c->len) c->neg = !c->neg;
1815 RETURN_STATUS(BC_STATUS_SUCCESS);
1819 RETURN_STATUS(BC_STATUS_SUCCESS);
1824 a->neg = b->neg = false;
1826 cmp = bc_num_cmp(a, b);
1832 bc_num_setToZero(c, BC_MAX(a->rdx, b->rdx));
1833 RETURN_STATUS(BC_STATUS_SUCCESS);
1842 if (sub) neg = !neg;
1847 bc_num_copy(c, minuend);
1850 if (c->rdx < subtrahend->rdx) {
1851 bc_num_extend(c, subtrahend->rdx - c->rdx);
1855 start = c->rdx - subtrahend->rdx;
1857 bc_num_subArrays(c->num + start, subtrahend->num, subtrahend->len);
1861 RETURN_STATUS(BC_STATUS_SUCCESS); // can't make void, see zbc_num_binary()
1864 static FAST_FUNC BC_STATUS zbc_num_k(BcNum *restrict a, BcNum *restrict b,
1866 #if ERRORS_ARE_FATAL
1867 # define zbc_num_k(...) (zbc_num_k(__VA_ARGS__), BC_STATUS_SUCCESS)
1871 size_t max = BC_MAX(a->len, b->len), max2 = (max + 1) / 2;
1872 BcNum l1, h1, l2, h2, m2, m1, z0, z1, z2, temp;
1875 if (a->len == 0 || b->len == 0) {
1877 RETURN_STATUS(BC_STATUS_SUCCESS);
1879 aone = BC_NUM_ONE(a);
1880 if (aone || BC_NUM_ONE(b)) {
1881 bc_num_copy(c, aone ? b : a);
1882 RETURN_STATUS(BC_STATUS_SUCCESS);
1885 if (a->len + b->len < BC_NUM_KARATSUBA_LEN ||
1886 a->len < BC_NUM_KARATSUBA_LEN || b->len < BC_NUM_KARATSUBA_LEN)
1891 bc_num_expand(c, a->len + b->len + 1);
1893 memset(c->num, 0, sizeof(BcDig) * c->cap);
1896 for (i = 0; i < b->len; ++i) {
1899 for (j = 0; j < a->len; ++j) {
1900 unsigned in = c->num[i + j];
1901 in += ((unsigned) a->num[j]) * ((unsigned) b->num[i]) + carry;
1902 // note: compilers prefer _unsigned_ div/const
1904 c->num[i + j] = (BcDig)(in % 10);
1907 c->num[i + j] += (BcDig) carry;
1908 len = BC_MAX(len, i + j + !!carry);
1910 #if ENABLE_FEATURE_BC_SIGNALS
1912 // a*a <- without check below, this will not be interruptible
1913 if (G_interrupt) return BC_STATUS_FAILURE;
1919 RETURN_STATUS(BC_STATUS_SUCCESS);
1922 bc_num_init(&l1, max);
1923 bc_num_init(&h1, max);
1924 bc_num_init(&l2, max);
1925 bc_num_init(&h2, max);
1926 bc_num_init(&m1, max);
1927 bc_num_init(&m2, max);
1928 bc_num_init(&z0, max);
1929 bc_num_init(&z1, max);
1930 bc_num_init(&z2, max);
1931 bc_num_init(&temp, max + max);
1933 bc_num_split(a, max2, &l1, &h1);
1934 bc_num_split(b, max2, &l2, &h2);
1936 s = zbc_num_add(&h1, &l1, &m1, 0);
1938 s = zbc_num_add(&h2, &l2, &m2, 0);
1941 s = zbc_num_k(&h1, &h2, &z0);
1943 s = zbc_num_k(&m1, &m2, &z1);
1945 s = zbc_num_k(&l1, &l2, &z2);
1948 s = zbc_num_sub(&z1, &z0, &temp, 0);
1950 s = zbc_num_sub(&temp, &z2, &z1, 0);
1953 s = zbc_num_shift(&z0, max2 * 2);
1955 s = zbc_num_shift(&z1, max2);
1957 s = zbc_num_add(&z0, &z1, &temp, 0);
1959 s = zbc_num_add(&temp, &z2, c, 0);
1975 static FAST_FUNC BC_STATUS zbc_num_m(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale)
1979 size_t maxrdx = BC_MAX(a->rdx, b->rdx);
1981 scale = BC_MAX(scale, a->rdx);
1982 scale = BC_MAX(scale, b->rdx);
1983 scale = BC_MIN(a->rdx + b->rdx, scale);
1984 maxrdx = BC_MAX(maxrdx, scale);
1986 bc_num_init(&cpa, a->len);
1987 bc_num_init(&cpb, b->len);
1989 bc_num_copy(&cpa, a);
1990 bc_num_copy(&cpb, b);
1991 cpa.neg = cpb.neg = false;
1993 s = zbc_num_shift(&cpa, maxrdx);
1995 s = zbc_num_shift(&cpb, maxrdx);
1997 s = zbc_num_k(&cpa, &cpb, c);
2001 bc_num_expand(c, c->len + maxrdx);
2003 if (c->len < maxrdx) {
2004 memset(c->num + c->len, 0, (c->cap - c->len) * sizeof(BcDig));
2009 bc_num_retireMul(c, scale, a->neg, b->neg);
2016 #if ERRORS_ARE_FATAL
2017 # define zbc_num_m(...) (zbc_num_m(__VA_ARGS__), BC_STATUS_SUCCESS)
2020 static FAST_FUNC BC_STATUS zbc_num_d(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale)
2022 BcStatus s = BC_STATUS_SUCCESS;
2029 RETURN_STATUS(bc_error("divide by zero"));
2031 bc_num_setToZero(c, scale);
2032 RETURN_STATUS(BC_STATUS_SUCCESS);
2034 if (BC_NUM_ONE(b)) {
2036 bc_num_retireMul(c, scale, a->neg, b->neg);
2037 RETURN_STATUS(BC_STATUS_SUCCESS);
2040 bc_num_init(&cp, BC_NUM_MREQ(a, b, scale));
2041 bc_num_copy(&cp, a);
2045 bc_num_expand(&cp, len + 2);
2046 bc_num_extend(&cp, len - cp.len);
2049 if (b->rdx > cp.rdx) bc_num_extend(&cp, b->rdx - cp.rdx);
2051 if (scale > cp.rdx) bc_num_extend(&cp, scale - cp.rdx);
2053 if (b->rdx == b->len) {
2054 for (i = 0; zero && i < len; ++i) zero = !b->num[len - i - 1];
2058 if (cp.cap == cp.len) bc_num_expand(&cp, cp.len + 1);
2060 // We want an extra zero in front to make things simpler.
2061 cp.num[cp.len++] = 0;
2064 bc_num_expand(c, cp.len);
2067 memset(c->num + end, 0, (c->cap - end) * sizeof(BcDig));
2072 for (i = end - 1; !s && i < end; --i) {
2074 for (q = 0; (!s && n[len] != 0) || bc_num_compare(n, p, len) >= 0; ++q)
2075 bc_num_subArrays(n, p, len);
2077 #if ENABLE_FEATURE_BC_SIGNALS
2080 // 1/a <- without check below, this will not be interruptible
2082 s = BC_STATUS_FAILURE;
2088 bc_num_retireMul(c, scale, a->neg, b->neg);
2093 #if ERRORS_ARE_FATAL
2094 # define zbc_num_d(...) (zbc_num_d(__VA_ARGS__), BC_STATUS_SUCCESS)
2097 static FAST_FUNC BC_STATUS zbc_num_r(BcNum *a, BcNum *b, BcNum *restrict c,
2098 BcNum *restrict d, size_t scale, size_t ts)
2105 RETURN_STATUS(bc_error("divide by zero"));
2108 bc_num_setToZero(d, ts);
2109 RETURN_STATUS(BC_STATUS_SUCCESS);
2112 bc_num_init(&temp, d->cap);
2113 s = zbc_num_d(a, b, c, scale);
2116 if (scale != 0) scale = ts;
2118 s = zbc_num_m(c, b, &temp, scale);
2120 s = zbc_num_sub(a, &temp, d, scale);
2123 if (ts > d->rdx && d->len) bc_num_extend(d, ts - d->rdx);
2126 bc_num_retireMul(d, ts, a->neg, b->neg);
2133 #if ERRORS_ARE_FATAL
2134 # define zbc_num_r(...) (zbc_num_r(__VA_ARGS__), BC_STATUS_SUCCESS)
2137 static FAST_FUNC BC_STATUS zbc_num_rem(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale)
2141 size_t ts = BC_MAX(scale + b->rdx, a->rdx), len = BC_NUM_MREQ(a, b, ts);
2143 bc_num_init(&c1, len);
2144 s = zbc_num_r(a, b, &c1, c, scale, ts);
2149 #if ERRORS_ARE_FATAL
2150 # define zbc_num_rem(...) (zbc_num_rem(__VA_ARGS__), BC_STATUS_SUCCESS)
2153 static FAST_FUNC BC_STATUS zbc_num_p(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale)
2155 BcStatus s = BC_STATUS_SUCCESS;
2158 size_t i, powrdx, resrdx;
2161 if (b->rdx) RETURN_STATUS(bc_error("non integer number"));
2165 RETURN_STATUS(BC_STATUS_SUCCESS);
2168 bc_num_setToZero(c, scale);
2169 RETURN_STATUS(BC_STATUS_SUCCESS);
2171 if (BC_NUM_ONE(b)) {
2175 s = zbc_num_inv(a, c, scale);
2182 s = zbc_num_ulong(b, &pow);
2183 if (s) RETURN_STATUS(s);
2185 bc_num_init(©, a->len);
2186 bc_num_copy(©, a);
2191 if (a->rdx * pow < scale)
2192 scale = a->rdx * pow;
2197 for (powrdx = a->rdx; !(pow & 1); pow >>= 1) {
2199 s = zbc_num_mul(©, ©, ©, powrdx);
2201 // Not needed: zbc_num_mul() has a check for ^C:
2202 //if (G_interrupt) {
2203 // s = BC_STATUS_FAILURE;
2208 bc_num_copy(c, ©);
2210 for (resrdx = powrdx, pow >>= 1; pow != 0; pow >>= 1) {
2213 s = zbc_num_mul(©, ©, ©, powrdx);
2218 s = zbc_num_mul(c, ©, c, resrdx);
2221 // Not needed: zbc_num_mul() has a check for ^C:
2222 //if (G_interrupt) {
2223 // s = BC_STATUS_FAILURE;
2229 s = zbc_num_inv(c, c, scale);
2233 if (c->rdx > scale) bc_num_truncate(c, c->rdx - scale);
2235 // We can't use bc_num_clean() here.
2236 for (zero = true, i = 0; zero && i < c->len; ++i) zero = !c->num[i];
2237 if (zero) bc_num_setToZero(c, scale);
2243 #if ERRORS_ARE_FATAL
2244 # define zbc_num_p(...) (zbc_num_p(__VA_ARGS__), BC_STATUS_SUCCESS)
2247 static BC_STATUS zbc_num_binary(BcNum *a, BcNum *b, BcNum *c, size_t scale,
2248 BcNumBinaryOp op, size_t req)
2251 BcNum num2, *ptr_a, *ptr_b;
2256 memcpy(ptr_a, c, sizeof(BcNum));
2265 memcpy(ptr_b, c, sizeof(BcNum));
2273 bc_num_init(c, req);
2275 bc_num_expand(c, req);
2277 s = BC_STATUS_SUCCESS;
2278 ERROR_RETURN(s =) op(ptr_a, ptr_b, c, scale);
2280 if (init) bc_num_free(&num2);
2284 #if ERRORS_ARE_FATAL
2285 # define zbc_num_binary(...) (zbc_num_binary(__VA_ARGS__), BC_STATUS_SUCCESS)
2288 static bool bc_num_strValid(const char *val, size_t base)
2293 b = (BcDig)(base <= 10 ? base + '0' : base - 10 + 'A');
2300 if (radix) return false;
2304 if (c < '0' || c >= b || (c > '9' && c < 'A'))
2310 // Note: n is already "bc_num_zero()"ed,
2311 // leading zeroes in "val" are removed
2312 static void bc_num_parseDecimal(BcNum *n, const char *val)
2321 bc_num_expand(n, len);
2323 ptr = strchr(val, '.');
2327 n->rdx = (size_t)((val + len) - (ptr + 1));
2329 for (i = 0; val[i]; ++i) {
2330 if (val[i] != '0' && val[i] != '.') {
2331 // Not entirely zero value - convert it, and exit
2334 n->num[n->len] = val[i] - '0';
2337 if ((ssize_t)--i == (ssize_t)-1) break;
2338 if (val[i] == '.') goto skip_dot;
2343 // if this is reached, the value is entirely zero
2346 // Note: n is already "bc_num_zero()"ed,
2347 // leading zeroes in "val" are removed
2348 static void bc_num_parseBase(BcNum *n, const char *val, BcNum *base)
2351 BcNum temp, mult, result;
2356 for (i = 0; ; ++i) {
2359 if (val[i] != '.' && val[i] != '0')
2363 bc_num_init_DEF_SIZE(&temp);
2364 bc_num_init_DEF_SIZE(&mult);
2368 if (c == '\0') goto int_err;
2369 if (c == '.') break;
2371 v = (unsigned long) (c <= '9' ? c - '0' : c - 'A' + 10);
2373 s = zbc_num_mul(n, base, &mult, 0);
2374 if (s) goto int_err;
2375 bc_num_ulong2num(&temp, v);
2376 s = zbc_num_add(&mult, &temp, n, 0);
2377 if (s) goto int_err;
2380 bc_num_init(&result, base->len);
2381 //bc_num_zero(&result); - already is
2387 if (c == '\0') break;
2390 v = (unsigned long) (c <= '9' ? c - '0' : c - 'A' + 10);
2392 s = zbc_num_mul(&result, base, &result, 0);
2394 bc_num_ulong2num(&temp, v);
2395 s = zbc_num_add(&result, &temp, &result, 0);
2397 s = zbc_num_mul(&mult, base, &mult, 0);
2401 s = zbc_num_div(&result, &mult, &result, digits);
2403 s = zbc_num_add(n, &result, n, digits);
2407 if (n->rdx < digits) bc_num_extend(n, digits - n->rdx);
2412 bc_num_free(&result);
2418 static BC_STATUS zbc_num_parse(BcNum *n, const char *val, BcNum *base,
2421 if (!bc_num_strValid(val, base_t))
2422 RETURN_STATUS(bc_error("bad number string"));
2425 while (*val == '0') val++;
2428 bc_num_parseDecimal(n, val);
2430 bc_num_parseBase(n, val, base);
2432 RETURN_STATUS(BC_STATUS_SUCCESS);
2434 #if ERRORS_ARE_FATAL
2435 # define zbc_num_parse(...) (zbc_num_parse(__VA_ARGS__), BC_STATUS_SUCCESS)
2438 static BC_STATUS zbc_num_sqrt(BcNum *a, BcNum *restrict b, size_t scale)
2441 BcNum num1, num2, half, f, fprime, *x0, *x1, *temp;
2442 size_t pow, len, digs, digs1, resrdx, req, times = 0;
2443 ssize_t cmp = 1, cmp1 = SSIZE_MAX, cmp2 = SSIZE_MAX;
2445 req = BC_MAX(scale, a->rdx) + ((BC_NUM_INT(a) + 1) >> 1) + 1;
2446 bc_num_expand(b, req);
2449 bc_num_setToZero(b, scale);
2450 RETURN_STATUS(BC_STATUS_SUCCESS);
2453 RETURN_STATUS(bc_error("negative number"));
2454 else if (BC_NUM_ONE(a)) {
2456 bc_num_extend(b, scale);
2457 RETURN_STATUS(BC_STATUS_SUCCESS);
2460 scale = BC_MAX(scale, a->rdx) + 1;
2461 len = a->len + scale;
2463 bc_num_init(&num1, len);
2464 bc_num_init(&num2, len);
2465 bc_num_init_DEF_SIZE(&half);
2471 bc_num_init(&f, len);
2472 bc_num_init(&fprime, len);
2478 pow = BC_NUM_INT(a);
2487 pow -= 2 - (pow & 1);
2489 bc_num_extend(x0, pow);
2491 // Make sure to move the radix back.
2495 x0->rdx = digs = digs1 = 0;
2497 len = BC_NUM_INT(x0) + resrdx - 1;
2499 while (cmp != 0 || digs < len) {
2501 s = zbc_num_div(a, x0, &f, resrdx);
2503 s = zbc_num_add(x0, &f, &fprime, resrdx);
2505 s = zbc_num_mul(&fprime, &half, x1, resrdx);
2508 cmp = bc_num_cmp(x1, x0);
2509 digs = x1->len - (unsigned long long) llabs(cmp);
2511 if (cmp == cmp2 && digs == digs1)
2516 resrdx += times > 4;
2529 if (b->rdx > scale) bc_num_truncate(b, b->rdx - scale);
2532 bc_num_free(&fprime);
2539 #if ERRORS_ARE_FATAL
2540 # define zbc_num_sqrt(...) (zbc_num_sqrt(__VA_ARGS__), BC_STATUS_SUCCESS)
2543 static BC_STATUS zbc_num_divmod(BcNum *a, BcNum *b, BcNum *c, BcNum *d,
2549 size_t ts = BC_MAX(scale + b->rdx, a->rdx), len = BC_NUM_MREQ(a, b, ts);
2552 memcpy(&num2, c, sizeof(BcNum));
2554 bc_num_init(c, len);
2559 bc_num_expand(c, len);
2562 s = zbc_num_r(ptr_a, b, c, d, scale, ts);
2564 if (init) bc_num_free(&num2);
2568 #if ERRORS_ARE_FATAL
2569 # define zbc_num_divmod(...) (zbc_num_divmod(__VA_ARGS__), BC_STATUS_SUCCESS)
2573 static BC_STATUS zbc_num_modexp(BcNum *a, BcNum *b, BcNum *c, BcNum *restrict d)
2576 BcNum base, exp, two, temp;
2579 RETURN_STATUS(bc_error("divide by zero"));
2580 if (a->rdx || b->rdx || c->rdx)
2581 RETURN_STATUS(bc_error("non integer number"));
2583 RETURN_STATUS(bc_error("negative number"));
2585 bc_num_expand(d, c->len);
2586 bc_num_init(&base, c->len);
2587 bc_num_init(&exp, b->len);
2588 bc_num_init_DEF_SIZE(&two);
2589 bc_num_init(&temp, b->len);
2595 s = zbc_num_rem(a, c, &base, 0);
2597 bc_num_copy(&exp, b);
2599 while (exp.len != 0) {
2601 s = zbc_num_divmod(&exp, &two, &exp, &temp, 0);
2604 if (BC_NUM_ONE(&temp)) {
2605 s = zbc_num_mul(d, &base, &temp, 0);
2607 s = zbc_num_rem(&temp, c, d, 0);
2611 s = zbc_num_mul(&base, &base, &temp, 0);
2613 s = zbc_num_rem(&temp, c, &base, 0);
2624 #if ERRORS_ARE_FATAL
2625 # define zbc_num_modexp(...) (zbc_num_modexp(__VA_ARGS__), BC_STATUS_SUCCESS)
2630 static BC_STATUS zbc_func_insert(BcFunc *f, char *name, bool var)
2635 for (i = 0; i < f->autos.len; ++i) {
2636 if (strcmp(name, ((BcId *) bc_vec_item(&f->autos, i))->name) == 0)
2637 RETURN_STATUS(bc_error("function parameter or auto var has the same name as another"));
2643 bc_vec_push(&f->autos, &a);
2645 RETURN_STATUS(BC_STATUS_SUCCESS);
2647 #if ERRORS_ARE_FATAL
2648 # define zbc_func_insert(...) (zbc_func_insert(__VA_ARGS__), BC_STATUS_SUCCESS)
2652 static void bc_func_init(BcFunc *f)
2654 bc_char_vec_init(&f->code);
2655 bc_vec_init(&f->autos, sizeof(BcId), bc_id_free);
2656 bc_vec_init(&f->labels, sizeof(size_t), NULL);
2660 static FAST_FUNC void bc_func_free(void *func)
2662 BcFunc *f = (BcFunc *) func;
2663 bc_vec_free(&f->code);
2664 bc_vec_free(&f->autos);
2665 bc_vec_free(&f->labels);
2668 static void bc_array_expand(BcVec *a, size_t len);
2670 static void bc_array_init(BcVec *a, bool nums)
2673 bc_vec_init(a, sizeof(BcNum), bc_num_free);
2675 bc_vec_init(a, sizeof(BcVec), bc_vec_free);
2676 bc_array_expand(a, 1);
2679 static void bc_array_expand(BcVec *a, size_t len)
2683 if (a->size == sizeof(BcNum) && a->dtor == bc_num_free) {
2684 while (len > a->len) {
2685 bc_num_init_DEF_SIZE(&data.n);
2686 bc_vec_push(a, &data.n);
2690 while (len > a->len) {
2691 bc_array_init(&data.v, true);
2692 bc_vec_push(a, &data.v);
2697 static void bc_array_copy(BcVec *d, const BcVec *s)
2702 bc_vec_expand(d, s->cap);
2705 for (i = 0; i < s->len; ++i) {
2706 BcNum *dnum = bc_vec_item(d, i), *snum = bc_vec_item(s, i);
2707 bc_num_init(dnum, snum->len);
2708 bc_num_copy(dnum, snum);
2712 static FAST_FUNC void bc_string_free(void *string)
2714 free(*((char **) string));
2718 static void bc_result_copy(BcResult *d, BcResult *src)
2724 case BC_RESULT_TEMP:
2725 case BC_RESULT_IBASE:
2726 case BC_RESULT_SCALE:
2727 case BC_RESULT_OBASE:
2729 bc_num_init(&d->d.n, src->d.n.len);
2730 bc_num_copy(&d->d.n, &src->d.n);
2735 case BC_RESULT_ARRAY:
2736 case BC_RESULT_ARRAY_ELEM:
2738 d->d.id.name = xstrdup(src->d.id.name);
2742 case BC_RESULT_CONSTANT:
2743 case BC_RESULT_LAST:
2747 memcpy(&d->d.n, &src->d.n, sizeof(BcNum));
2754 static FAST_FUNC void bc_result_free(void *result)
2756 BcResult *r = (BcResult *) result;
2760 case BC_RESULT_TEMP:
2761 case BC_RESULT_IBASE:
2762 case BC_RESULT_SCALE:
2763 case BC_RESULT_OBASE:
2765 bc_num_free(&r->d.n);
2770 case BC_RESULT_ARRAY:
2771 case BC_RESULT_ARRAY_ELEM:
2785 static void bc_lex_lineComment(BcLex *l)
2787 l->t.t = BC_LEX_WHITESPACE;
2788 while (l->i < l->len && l->buf[l->i++] != '\n');
2792 static void bc_lex_whitespace(BcLex *l)
2794 l->t.t = BC_LEX_WHITESPACE;
2796 char c = l->buf[l->i];
2797 if (c == '\n' || !isspace(c))
2803 static BC_STATUS zbc_lex_number(BcLex *l, char start)
2805 const char *buf = l->buf + l->i;
2806 size_t len, bslashes, i, ccnt;
2809 pt = (start == '.');
2810 l->t.t = BC_LEX_NUMBER;
2817 if (c == '\\' && buf[i + 1] == '\n') {
2822 if (!isdigit(c) && (c < 'A' || c > 'F')) {
2823 if (c != '.') break;
2824 // if '.' was already seen, stop on second one:
2828 // buf[i] is one of "0-9A-F."
2833 //i is buf[i] index of the first not-yet-parsed char
2836 //ccnt is the number of chars in the number string, excluding possible
2837 //trailing "." and possible following trailing "\<newline>"(s).
2838 len = ccnt - bslashes * 2 + 1; // +1 byte for NUL termination
2840 // This check makes sense only if size_t is (much) larger than BC_MAX_NUM.
2841 if (SIZE_MAX > (BC_MAX_NUM | 0xff)) {
2842 if (len > BC_MAX_NUM)
2843 RETURN_STATUS(bc_error("number too long: must be [1,"BC_MAX_NUM_STR"]"));
2846 bc_vec_pop_all(&l->t.v);
2847 bc_vec_expand(&l->t.v, 1 + len);
2848 bc_vec_push(&l->t.v, &start);
2851 // If we have hit a backslash, skip it. We don't have
2852 // to check for a newline because it's guaranteed.
2858 bc_vec_push(&l->t.v, buf);
2863 bc_vec_pushZeroByte(&l->t.v);
2865 RETURN_STATUS(BC_STATUS_SUCCESS);
2867 #if ERRORS_ARE_FATAL
2868 # define zbc_lex_number(...) (zbc_lex_number(__VA_ARGS__), BC_STATUS_SUCCESS)
2871 static void bc_lex_name(BcLex *l)
2876 l->t.t = BC_LEX_NAME;
2879 buf = l->buf + l->i - 1;
2882 if ((c < 'a' || c > 'z') && !isdigit(c) && c != '_') break;
2886 #if 0 // We do not protect against people with gigabyte-long names
2887 // This check makes sense only if size_t is (much) larger than BC_MAX_STRING.
2888 if (SIZE_MAX > (BC_MAX_STRING | 0xff)) {
2889 if (i > BC_MAX_STRING)
2890 return bc_error("name too long: must be [1,"BC_MAX_STRING_STR"]");
2893 bc_vec_string(&l->t.v, i, buf);
2895 // Increment the index. We minus 1 because it has already been incremented.
2898 //return BC_STATUS_SUCCESS;
2901 static void bc_lex_init(BcLex *l)
2903 bc_char_vec_init(&l->t.v);
2906 static void bc_lex_free(BcLex *l)
2908 bc_vec_free(&l->t.v);
2911 static void bc_lex_file(BcLex *l)
2913 G.err_line = l->line = 1;
2917 IF_BC(static BC_STATUS zbc_lex_token(BcLex *l);)
2918 IF_DC(static BC_STATUS zdc_lex_token(BcLex *l);)
2920 static BC_STATUS zcommon_lex_token(BcLex *l)
2923 IF_BC(RETURN_STATUS(zbc_lex_token(l));)
2925 IF_DC(RETURN_STATUS(zdc_lex_token(l));)
2928 static BC_STATUS zbc_lex_next(BcLex *l)
2933 if (l->t.last == BC_LEX_EOF) RETURN_STATUS(bc_error("end of file"));
2935 l->line += l->newline;
2936 G.err_line = l->line;
2937 l->t.t = BC_LEX_EOF;
2939 l->newline = (l->i == l->len);
2940 if (l->newline) RETURN_STATUS(BC_STATUS_SUCCESS);
2942 // Loop until failure or we don't have whitespace. This
2943 // is so the parser doesn't get inundated with whitespace.
2944 s = BC_STATUS_SUCCESS;
2946 //TODO: replace pointer with if(IS_BC)
2947 ERROR_RETURN(s =) zcommon_lex_token(l);
2948 } while (!s && l->t.t == BC_LEX_WHITESPACE);
2952 #if ERRORS_ARE_FATAL
2953 # define zbc_lex_next(...) (zbc_lex_next(__VA_ARGS__), BC_STATUS_SUCCESS)
2956 static BC_STATUS zbc_lex_text(BcLex *l, const char *text)
2960 l->len = strlen(text);
2961 l->t.t = l->t.last = BC_LEX_INVALID;
2962 RETURN_STATUS(zbc_lex_next(l));
2964 #if ERRORS_ARE_FATAL
2965 # define zbc_lex_text(...) (zbc_lex_text(__VA_ARGS__), BC_STATUS_SUCCESS)
2969 static BC_STATUS zbc_lex_identifier(BcLex *l)
2973 const char *buf = l->buf + l->i - 1;
2975 for (i = 0; i < ARRAY_SIZE(bc_lex_kws); ++i) {
2976 const char *keyword8 = bc_lex_kws[i].name8;
2978 while (buf[j] != '\0' && buf[j] == keyword8[j]) {
2980 if (j == 8) goto match;
2982 if (keyword8[j] != '\0')
2985 // buf starts with keyword bc_lex_kws[i]
2986 l->t.t = BC_LEX_KEY_1st_keyword + i;
2987 if (!bc_lex_kws_POSIX(i)) {
2988 s = bc_posix_error_fmt("%sthe '%.8s' keyword", "POSIX does not allow ", bc_lex_kws[i].name8);
2989 ERROR_RETURN(if (s) RETURN_STATUS(s);)
2992 // We minus 1 because the index has already been incremented.
2994 RETURN_STATUS(BC_STATUS_SUCCESS);
2999 if (l->t.v.len > 2) {
3002 // bc: POSIX only allows one character names; the following is bad: 'qwe=1
3004 unsigned len = strchrnul(buf, '\n') - buf;
3005 s = bc_posix_error_fmt("POSIX only allows one character names; the following is bad: '%.*s'", len, buf);
3010 #if ERRORS_ARE_FATAL
3011 # define zbc_lex_identifier(...) (zbc_lex_identifier(__VA_ARGS__), BC_STATUS_SUCCESS)
3014 static BC_STATUS zbc_lex_string(BcLex *l)
3016 size_t len, nls = 0, i = l->i;
3019 l->t.t = BC_LEX_STR;
3021 for (c = l->buf[i]; c != 0 && c != '"'; c = l->buf[++i])
3026 RETURN_STATUS(bc_error("string end could not be found"));
3030 // This check makes sense only if size_t is (much) larger than BC_MAX_STRING.
3031 if (SIZE_MAX > (BC_MAX_STRING | 0xff)) {
3032 if (len > BC_MAX_STRING)
3033 RETURN_STATUS(bc_error("string too long: must be [1,"BC_MAX_STRING_STR"]"));
3035 bc_vec_string(&l->t.v, len, l->buf + l->i);
3039 G.err_line = l->line;
3041 RETURN_STATUS(BC_STATUS_SUCCESS);
3043 #if ERRORS_ARE_FATAL
3044 # define zbc_lex_string(...) (zbc_lex_string(__VA_ARGS__), BC_STATUS_SUCCESS)
3047 static void bc_lex_assign(BcLex *l, BcLexType with, BcLexType without)
3049 if (l->buf[l->i] == '=') {
3057 static BC_STATUS zbc_lex_comment(BcLex *l)
3060 const char *buf = l->buf;
3062 l->t.t = BC_LEX_WHITESPACE;
3075 RETURN_STATUS(bc_error("comment end could not be found"));
3083 G.err_line = l->line;
3085 RETURN_STATUS(BC_STATUS_SUCCESS);
3087 #if ERRORS_ARE_FATAL
3088 # define zbc_lex_comment(...) (zbc_lex_comment(__VA_ARGS__), BC_STATUS_SUCCESS)
3091 static BC_STATUS zbc_lex_token(BcLex *l)
3093 BcStatus s = BC_STATUS_SUCCESS;
3094 char c = l->buf[l->i++], c2;
3096 // This is the workhorse of the lexer.
3101 l->t.t = !c ? BC_LEX_EOF : BC_LEX_NLINE;
3108 bc_lex_whitespace(l);
3111 bc_lex_assign(l, BC_LEX_OP_REL_NE, BC_LEX_OP_BOOL_NOT);
3112 if (l->t.t == BC_LEX_OP_BOOL_NOT) {
3113 s = bc_POSIX_does_not_allow_bool_ops_this_is_bad("!");
3114 ERROR_RETURN(if (s) RETURN_STATUS(s);)
3118 s = zbc_lex_string(l);
3121 s = bc_POSIX_does_not_allow("'#' script comments");
3122 ERROR_RETURN(if (s) RETURN_STATUS(s);)
3123 bc_lex_lineComment(l);
3126 bc_lex_assign(l, BC_LEX_OP_ASSIGN_MODULUS, BC_LEX_OP_MODULUS);
3131 s = bc_POSIX_does_not_allow_bool_ops_this_is_bad("&&");
3132 ERROR_RETURN(if (s) RETURN_STATUS(s);)
3134 l->t.t = BC_LEX_OP_BOOL_AND;
3136 l->t.t = BC_LEX_INVALID;
3137 s = bc_error_bad_character('&');
3142 l->t.t = (BcLexType)(c - '(' + BC_LEX_LPAREN);
3145 bc_lex_assign(l, BC_LEX_OP_ASSIGN_MULTIPLY, BC_LEX_OP_MULTIPLY);
3151 l->t.t = BC_LEX_OP_INC;
3153 bc_lex_assign(l, BC_LEX_OP_ASSIGN_PLUS, BC_LEX_OP_PLUS);
3156 l->t.t = BC_LEX_COMMA;
3162 l->t.t = BC_LEX_OP_DEC;
3164 bc_lex_assign(l, BC_LEX_OP_ASSIGN_MINUS, BC_LEX_OP_MINUS);
3167 if (isdigit(l->buf[l->i]))
3168 s = zbc_lex_number(l, c);
3170 l->t.t = BC_LEX_KEY_LAST;
3171 s = bc_POSIX_does_not_allow("a period ('.') as a shortcut for the last result");
3177 s = zbc_lex_comment(l);
3179 bc_lex_assign(l, BC_LEX_OP_ASSIGN_DIVIDE, BC_LEX_OP_DIVIDE);
3197 s = zbc_lex_number(l, c);
3200 l->t.t = BC_LEX_SCOLON;
3203 bc_lex_assign(l, BC_LEX_OP_REL_LE, BC_LEX_OP_REL_LT);
3206 bc_lex_assign(l, BC_LEX_OP_REL_EQ, BC_LEX_OP_ASSIGN);
3209 bc_lex_assign(l, BC_LEX_OP_REL_GE, BC_LEX_OP_REL_GT);
3213 l->t.t = (BcLexType)(c - '[' + BC_LEX_LBRACKET);
3216 if (l->buf[l->i] == '\n') {
3217 l->t.t = BC_LEX_WHITESPACE;
3220 s = bc_error_bad_character(c);
3223 bc_lex_assign(l, BC_LEX_OP_ASSIGN_POWER, BC_LEX_OP_POWER);
3251 s = zbc_lex_identifier(l);
3255 l->t.t = (BcLexType)(c - '{' + BC_LEX_LBRACE);
3260 s = bc_POSIX_does_not_allow_bool_ops_this_is_bad("||");
3261 ERROR_RETURN(if (s) RETURN_STATUS(s);)
3263 l->t.t = BC_LEX_OP_BOOL_OR;
3265 l->t.t = BC_LEX_INVALID;
3266 s = bc_error_bad_character(c);
3270 l->t.t = BC_LEX_INVALID;
3271 s = bc_error_bad_character(c);
3280 static BC_STATUS zdc_lex_register(BcLex *l)
3282 if (isspace(l->buf[l->i - 1])) {
3283 bc_lex_whitespace(l);
3286 RETURN_STATUS(bc_error("extended register"));
3290 bc_vec_pop_all(&l->t.v);
3291 bc_vec_push(&l->t.v, &l->buf[l->i - 1]);
3292 bc_vec_pushZeroByte(&l->t.v);
3293 l->t.t = BC_LEX_NAME;
3296 RETURN_STATUS(BC_STATUS_SUCCESS);
3298 #if ERRORS_ARE_FATAL
3299 # define zdc_lex_register(...) (zdc_lex_register(__VA_ARGS__), BC_STATUS_SUCCESS)
3302 static BC_STATUS zdc_lex_string(BcLex *l)
3304 size_t depth = 1, nls = 0, i = l->i;
3307 l->t.t = BC_LEX_STR;
3308 bc_vec_pop_all(&l->t.v);
3310 for (c = l->buf[i]; c != 0 && depth; c = l->buf[++i]) {
3312 depth += (c == '[' && (i == l->i || l->buf[i - 1] != '\\'));
3313 depth -= (c == ']' && (i == l->i || l->buf[i - 1] != '\\'));
3316 if (depth) bc_vec_push(&l->t.v, &c);
3321 RETURN_STATUS(bc_error("string end could not be found"));
3324 bc_vec_pushZeroByte(&l->t.v);
3325 // This check makes sense only if size_t is (much) larger than BC_MAX_STRING.
3326 if (SIZE_MAX > (BC_MAX_STRING | 0xff)) {
3327 if (i - l->i > BC_MAX_STRING)
3328 RETURN_STATUS(bc_error("string too long: must be [1,"BC_MAX_STRING_STR"]"));
3333 G.err_line = l->line;
3335 RETURN_STATUS(BC_STATUS_SUCCESS);
3337 #if ERRORS_ARE_FATAL
3338 # define zdc_lex_string(...) (zdc_lex_string(__VA_ARGS__), BC_STATUS_SUCCESS)
3341 static BC_STATUS zdc_lex_token(BcLex *l)
3343 BcStatus s = BC_STATUS_SUCCESS;
3344 char c = l->buf[l->i++], c2;
3347 for (i = 0; i < ARRAY_SIZE(dc_lex_regs); ++i) {
3348 if (l->t.last == dc_lex_regs[i])
3349 RETURN_STATUS(zdc_lex_register(l));
3352 if (c >= '%' && c <= '~'
3353 && (l->t.t = dc_lex_tokens[(c - '%')]) != BC_LEX_INVALID
3358 // This is the workhorse of the lexer.
3361 l->t.t = BC_LEX_EOF;
3369 l->newline = (c == '\n');
3370 bc_lex_whitespace(l);
3375 l->t.t = BC_LEX_OP_REL_NE;
3377 l->t.t = BC_LEX_OP_REL_LE;
3379 l->t.t = BC_LEX_OP_REL_GE;
3381 RETURN_STATUS(bc_error_bad_character(c));
3385 bc_lex_lineComment(l);
3388 if (isdigit(l->buf[l->i]))
3389 s = zbc_lex_number(l, c);
3391 s = bc_error_bad_character(c);
3409 s = zbc_lex_number(l, c);
3412 s = zdc_lex_string(l);
3415 l->t.t = BC_LEX_INVALID;
3416 s = bc_error_bad_character(c);
3424 static void bc_program_addFunc(char *name, size_t *idx);
3426 static void bc_parse_addFunc(BcParse *p, char *name, size_t *idx)
3428 bc_program_addFunc(name, idx);
3429 p->func = bc_program_func(p->fidx);
3432 #define bc_parse_push(p, i) bc_vec_pushByte(&(p)->func->code, (char) (i))
3434 static void bc_parse_pushName(BcParse *p, char *name)
3436 size_t i = 0, len = strlen(name);
3438 for (; i < len; ++i) bc_parse_push(p, name[i]);
3439 bc_parse_push(p, BC_PARSE_STREND);
3444 static void bc_parse_pushIndex(BcParse *p, size_t idx)
3449 mask = ((size_t)0xff) << (sizeof(idx) * 8 - 8);
3452 if (idx & mask) break;
3457 bc_parse_push(p, amt);
3460 bc_parse_push(p, (unsigned char)idx);
3465 static void bc_parse_number(BcParse *p, BcInst *prev, size_t *nexs)
3467 char *num = xstrdup(p->l.t.v.v);
3468 size_t idx = G.prog.consts.len;
3470 bc_vec_push(&G.prog.consts, &num);
3472 bc_parse_push(p, BC_INST_NUM);
3473 bc_parse_pushIndex(p, idx);
3476 (*prev) = BC_INST_NUM;
3479 IF_BC(static BC_STATUS zbc_parse_parse(BcParse *p);)
3480 IF_DC(static BC_STATUS zdc_parse_parse(BcParse *p);)
3482 static BC_STATUS zcommon_parse(BcParse *p)
3485 IF_BC(RETURN_STATUS(zbc_parse_parse(p));)
3487 IF_DC(RETURN_STATUS(zdc_parse_parse(p));)
3490 static BC_STATUS zbc_parse_text(BcParse *p, const char *text)
3494 p->func = bc_program_func(p->fidx);
3496 if (!text[0] && !BC_PARSE_CAN_EXEC(p)) {
3497 p->l.t.t = BC_LEX_INVALID;
3498 s = BC_STATUS_SUCCESS;
3499 ERROR_RETURN(s =) zcommon_parse(p);
3500 if (s) RETURN_STATUS(s);
3501 if (!BC_PARSE_CAN_EXEC(p))
3502 RETURN_STATUS(bc_error("file is not executable"));
3505 RETURN_STATUS(zbc_lex_text(&p->l, text));
3507 #if ERRORS_ARE_FATAL
3508 # define zbc_parse_text(...) (zbc_parse_text(__VA_ARGS__), BC_STATUS_SUCCESS)
3511 // Called when parsing or execution detects a failure,
3512 // resets execution structures.
3513 static void bc_program_reset(void)
3518 bc_vec_npop(&G.prog.stack, G.prog.stack.len - 1);
3519 bc_vec_pop_all(&G.prog.results);
3521 f = bc_program_func(0);
3522 ip = bc_vec_top(&G.prog.stack);
3523 ip->idx = f->code.len;
3526 #define bc_parse_updateFunc(p, f) \
3527 ((p)->func = bc_program_func((p)->fidx = (f)))
3529 // Called when zbc/zdc_parse_parse() detects a failure,
3530 // resets parsing structures.
3531 static void bc_parse_reset(BcParse *p)
3533 if (p->fidx != BC_PROG_MAIN) {
3534 p->func->nparams = 0;
3535 bc_vec_pop_all(&p->func->code);
3536 bc_vec_pop_all(&p->func->autos);
3537 bc_vec_pop_all(&p->func->labels);
3539 bc_parse_updateFunc(p, BC_PROG_MAIN);
3543 p->l.t.t = BC_LEX_EOF;
3544 p->auto_part = (p->nbraces = 0);
3546 bc_vec_npop(&p->flags, p->flags.len - 1);
3547 bc_vec_pop_all(&p->exits);
3548 bc_vec_pop_all(&p->conds);
3549 bc_vec_pop_all(&p->ops);
3554 static void bc_parse_free(BcParse *p)
3556 bc_vec_free(&p->flags);
3557 bc_vec_free(&p->exits);
3558 bc_vec_free(&p->conds);
3559 bc_vec_free(&p->ops);
3563 static void bc_parse_create(BcParse *p, size_t func)
3565 memset(p, 0, sizeof(BcParse));
3568 bc_vec_init(&p->flags, sizeof(uint8_t), NULL);
3569 bc_vec_init(&p->exits, sizeof(BcInstPtr), NULL);
3570 bc_vec_init(&p->conds, sizeof(size_t), NULL);
3571 bc_vec_pushZeroByte(&p->flags);
3572 bc_vec_init(&p->ops, sizeof(BcLexType), NULL);
3574 // p->auto_part = p->nbraces = 0; - already is
3575 bc_parse_updateFunc(p, func);
3580 #define BC_PARSE_TOP_OP(p) (*((BcLexType *) bc_vec_top(&(p)->ops)))
3581 #define BC_PARSE_LEAF(p, rparen) \
3582 (((p) >= BC_INST_NUM && (p) <= BC_INST_SQRT) || (rparen) || \
3583 (p) == BC_INST_INC_POST || (p) == BC_INST_DEC_POST)
3585 // We can calculate the conversion between tokens and exprs by subtracting the
3586 // position of the first operator in the lex enum and adding the position of the
3587 // first in the expr enum. Note: This only works for binary operators.
3588 #define BC_PARSE_TOKEN_INST(t) ((char) ((t) -BC_LEX_NEG + BC_INST_NEG))
3590 static BC_STATUS zbc_parse_else(BcParse *p);
3591 static BC_STATUS zbc_parse_stmt(BcParse *p);
3592 static BC_STATUS zbc_parse_expr(BcParse *p, uint8_t flags, BcParseNext next);
3593 static BcStatus bc_parse_expr_empty_ok(BcParse *p, uint8_t flags, BcParseNext next);
3594 #if ERRORS_ARE_FATAL
3595 # define zbc_parse_else(...) (zbc_parse_else(__VA_ARGS__), BC_STATUS_SUCCESS)
3596 # define zbc_parse_stmt(...) (zbc_parse_stmt(__VA_ARGS__), BC_STATUS_SUCCESS)
3597 # define zbc_parse_expr(...) (zbc_parse_expr(__VA_ARGS__), BC_STATUS_SUCCESS)
3600 static BC_STATUS zbc_parse_operator(BcParse *p, BcLexType type, size_t start,
3601 size_t *nexprs, bool next)
3603 BcStatus s = BC_STATUS_SUCCESS;
3605 char l, r = bc_parse_op_PREC(type - BC_LEX_OP_INC);
3606 bool left = bc_parse_op_LEFT(type - BC_LEX_OP_INC);
3608 while (p->ops.len > start) {
3610 t = BC_PARSE_TOP_OP(p);
3611 if (t == BC_LEX_LPAREN) break;
3613 l = bc_parse_op_PREC(t - BC_LEX_OP_INC);
3614 if (l >= r && (l != r || !left)) break;
3616 bc_parse_push(p, BC_PARSE_TOKEN_INST(t));
3617 bc_vec_pop(&p->ops);
3618 *nexprs -= t != BC_LEX_OP_BOOL_NOT && t != BC_LEX_NEG;
3621 bc_vec_push(&p->ops, &type);
3622 if (next) s = zbc_lex_next(&p->l);
3626 #if ERRORS_ARE_FATAL
3627 # define zbc_parse_operator(...) (zbc_parse_operator(__VA_ARGS__), BC_STATUS_SUCCESS)
3630 static BC_STATUS zbc_parse_rightParen(BcParse *p, size_t ops_bgn, size_t *nexs)
3634 if (p->ops.len <= ops_bgn)
3635 RETURN_STATUS(bc_error_bad_expression());
3636 top = BC_PARSE_TOP_OP(p);
3638 while (top != BC_LEX_LPAREN) {
3639 bc_parse_push(p, BC_PARSE_TOKEN_INST(top));
3641 bc_vec_pop(&p->ops);
3642 *nexs -= top != BC_LEX_OP_BOOL_NOT && top != BC_LEX_NEG;
3644 if (p->ops.len <= ops_bgn)
3645 RETURN_STATUS(bc_error_bad_expression());
3646 top = BC_PARSE_TOP_OP(p);
3649 bc_vec_pop(&p->ops);
3651 RETURN_STATUS(zbc_lex_next(&p->l));
3653 #if ERRORS_ARE_FATAL
3654 # define zbc_parse_rightParen(...) (zbc_parse_rightParen(__VA_ARGS__), BC_STATUS_SUCCESS)
3657 static BC_STATUS zbc_parse_params(BcParse *p, uint8_t flags)
3663 s = zbc_lex_next(&p->l);
3664 if (s) RETURN_STATUS(s);
3666 for (nparams = 0; p->l.t.t != BC_LEX_RPAREN; ++nparams) {
3667 flags = (flags & ~(BC_PARSE_PRINT | BC_PARSE_REL)) | BC_PARSE_ARRAY;
3668 s = zbc_parse_expr(p, flags, bc_parse_next_param);
3669 if (s) RETURN_STATUS(s);
3671 comma = p->l.t.t == BC_LEX_COMMA;
3673 s = zbc_lex_next(&p->l);
3674 if (s) RETURN_STATUS(s);
3678 if (comma) RETURN_STATUS(bc_error_bad_token());
3679 bc_parse_push(p, BC_INST_CALL);
3680 bc_parse_pushIndex(p, nparams);
3682 RETURN_STATUS(BC_STATUS_SUCCESS);
3684 #if ERRORS_ARE_FATAL
3685 # define zbc_parse_params(...) (zbc_parse_params(__VA_ARGS__), BC_STATUS_SUCCESS)
3688 static BC_STATUS zbc_parse_call(BcParse *p, char *name, uint8_t flags)
3691 BcId entry, *entry_ptr;
3696 s = zbc_parse_params(p, flags);
3699 if (p->l.t.t != BC_LEX_RPAREN) {
3700 s = bc_error_bad_token();
3704 idx = bc_map_index(&G.prog.fn_map, &entry);
3706 if (idx == BC_VEC_INVALID_IDX) {
3707 name = xstrdup(entry.name);
3708 bc_parse_addFunc(p, name, &idx);
3709 idx = bc_map_index(&G.prog.fn_map, &entry);
3714 entry_ptr = bc_vec_item(&G.prog.fn_map, idx);
3715 bc_parse_pushIndex(p, entry_ptr->idx);
3717 RETURN_STATUS(zbc_lex_next(&p->l));
3723 #if ERRORS_ARE_FATAL
3724 # define zbc_parse_call(...) (zbc_parse_call(__VA_ARGS__), BC_STATUS_SUCCESS)
3727 static BC_STATUS zbc_parse_name(BcParse *p, BcInst *type, uint8_t flags)
3732 name = xstrdup(p->l.t.v.v);
3733 s = zbc_lex_next(&p->l);
3736 if (p->l.t.t == BC_LEX_LBRACKET) {
3737 s = zbc_lex_next(&p->l);
3740 if (p->l.t.t == BC_LEX_RBRACKET) {
3741 if (!(flags & BC_PARSE_ARRAY)) {
3742 s = bc_error_bad_expression();
3745 *type = BC_INST_ARRAY;
3747 *type = BC_INST_ARRAY_ELEM;
3748 flags &= ~(BC_PARSE_PRINT | BC_PARSE_REL);
3749 s = zbc_parse_expr(p, flags, bc_parse_next_elem);
3752 s = zbc_lex_next(&p->l);
3754 bc_parse_push(p, *type);
3755 bc_parse_pushName(p, name);
3757 else if (p->l.t.t == BC_LEX_LPAREN) {
3758 if (flags & BC_PARSE_NOCALL) {
3759 s = bc_error_bad_token();
3762 *type = BC_INST_CALL;
3763 s = zbc_parse_call(p, name, flags);
3765 *type = BC_INST_VAR;
3766 bc_parse_push(p, BC_INST_VAR);
3767 bc_parse_pushName(p, name);
3776 #if ERRORS_ARE_FATAL
3777 # define zbc_parse_name(...) (zbc_parse_name(__VA_ARGS__), BC_STATUS_SUCCESS)
3780 static BC_STATUS zbc_parse_read(BcParse *p)
3784 s = zbc_lex_next(&p->l);
3785 if (s) RETURN_STATUS(s);
3786 if (p->l.t.t != BC_LEX_LPAREN) RETURN_STATUS(bc_error_bad_token());
3788 s = zbc_lex_next(&p->l);
3789 if (s) RETURN_STATUS(s);
3790 if (p->l.t.t != BC_LEX_RPAREN) RETURN_STATUS(bc_error_bad_token());
3792 bc_parse_push(p, BC_INST_READ);
3794 RETURN_STATUS(zbc_lex_next(&p->l));
3796 #if ERRORS_ARE_FATAL
3797 # define zbc_parse_read(...) (zbc_parse_read(__VA_ARGS__), BC_STATUS_SUCCESS)
3800 static BC_STATUS zbc_parse_builtin(BcParse *p, BcLexType type, uint8_t flags,
3805 s = zbc_lex_next(&p->l);
3806 if (s) RETURN_STATUS(s);
3807 if (p->l.t.t != BC_LEX_LPAREN) RETURN_STATUS(bc_error_bad_token());
3809 flags = (flags & ~(BC_PARSE_PRINT | BC_PARSE_REL)) | BC_PARSE_ARRAY;
3811 s = zbc_lex_next(&p->l);
3812 if (s) RETURN_STATUS(s);
3814 s = zbc_parse_expr(p, flags, bc_parse_next_rel);
3815 if (s) RETURN_STATUS(s);
3817 if (p->l.t.t != BC_LEX_RPAREN) RETURN_STATUS(bc_error_bad_token());
3819 *prev = (type == BC_LEX_KEY_LENGTH) ? BC_INST_LENGTH : BC_INST_SQRT;
3820 bc_parse_push(p, *prev);
3822 RETURN_STATUS(zbc_lex_next(&p->l));
3824 #if ERRORS_ARE_FATAL
3825 # define zbc_parse_builtin(...) (zbc_parse_builtin(__VA_ARGS__), BC_STATUS_SUCCESS)
3828 static BC_STATUS zbc_parse_scale(BcParse *p, BcInst *type, uint8_t flags)
3832 s = zbc_lex_next(&p->l);
3833 if (s) RETURN_STATUS(s);
3835 if (p->l.t.t != BC_LEX_LPAREN) {
3836 *type = BC_INST_SCALE;
3837 bc_parse_push(p, BC_INST_SCALE);
3838 RETURN_STATUS(BC_STATUS_SUCCESS);
3841 *type = BC_INST_SCALE_FUNC;
3842 flags &= ~(BC_PARSE_PRINT | BC_PARSE_REL);
3844 s = zbc_lex_next(&p->l);
3845 if (s) RETURN_STATUS(s);
3847 s = zbc_parse_expr(p, flags, bc_parse_next_rel);
3848 if (s) RETURN_STATUS(s);
3849 if (p->l.t.t != BC_LEX_RPAREN)
3850 RETURN_STATUS(bc_error_bad_token());
3851 bc_parse_push(p, BC_INST_SCALE_FUNC);
3853 RETURN_STATUS(zbc_lex_next(&p->l));
3855 #if ERRORS_ARE_FATAL
3856 # define zbc_parse_scale(...) (zbc_parse_scale(__VA_ARGS__), BC_STATUS_SUCCESS)
3859 static BC_STATUS zbc_parse_incdec(BcParse *p, BcInst *prev, bool *paren_expr,
3860 size_t *nexprs, uint8_t flags)
3865 BcInst etype = *prev;
3867 if (etype == BC_INST_VAR || etype == BC_INST_ARRAY_ELEM ||
3868 etype == BC_INST_SCALE || etype == BC_INST_LAST ||
3869 etype == BC_INST_IBASE || etype == BC_INST_OBASE)
3871 *prev = inst = BC_INST_INC_POST + (p->l.t.t != BC_LEX_OP_INC);
3872 bc_parse_push(p, inst);
3873 s = zbc_lex_next(&p->l);
3876 *prev = inst = BC_INST_INC_PRE + (p->l.t.t != BC_LEX_OP_INC);
3879 s = zbc_lex_next(&p->l);
3880 if (s) RETURN_STATUS(s);
3883 // Because we parse the next part of the expression
3884 // right here, we need to increment this.
3885 *nexprs = *nexprs + 1;
3889 s = zbc_parse_name(p, prev, flags | BC_PARSE_NOCALL);
3891 case BC_LEX_KEY_IBASE:
3892 case BC_LEX_KEY_LAST:
3893 case BC_LEX_KEY_OBASE:
3894 bc_parse_push(p, type - BC_LEX_KEY_IBASE + BC_INST_IBASE);
3895 s = zbc_lex_next(&p->l);
3897 case BC_LEX_KEY_SCALE:
3898 s = zbc_lex_next(&p->l);
3899 if (s) RETURN_STATUS(s);
3900 if (p->l.t.t == BC_LEX_LPAREN)
3901 s = bc_error_bad_token();
3903 bc_parse_push(p, BC_INST_SCALE);
3906 s = bc_error_bad_token();
3910 if (!s) bc_parse_push(p, inst);
3915 #if ERRORS_ARE_FATAL
3916 # define zbc_parse_incdec(...) (zbc_parse_incdec(__VA_ARGS__), BC_STATUS_SUCCESS)
3919 static BC_STATUS zbc_parse_minus(BcParse *p, BcInst *prev, size_t ops_bgn,
3920 bool rparen, size_t *nexprs)
3924 BcInst etype = *prev;
3926 s = zbc_lex_next(&p->l);
3927 if (s) RETURN_STATUS(s);
3929 type = rparen || etype == BC_INST_INC_POST || etype == BC_INST_DEC_POST ||
3930 (etype >= BC_INST_NUM && etype <= BC_INST_SQRT) ?
3933 *prev = BC_PARSE_TOKEN_INST(type);
3935 // We can just push onto the op stack because this is the largest
3936 // precedence operator that gets pushed. Inc/dec does not.
3937 if (type != BC_LEX_OP_MINUS)
3938 bc_vec_push(&p->ops, &type);
3940 s = zbc_parse_operator(p, type, ops_bgn, nexprs, false);
3944 #if ERRORS_ARE_FATAL
3945 # define zbc_parse_minus(...) (zbc_parse_minus(__VA_ARGS__), BC_STATUS_SUCCESS)
3948 static BC_STATUS zbc_parse_string(BcParse *p, char inst)
3950 char *str = xstrdup(p->l.t.v.v);
3952 bc_parse_push(p, BC_INST_STR);
3953 bc_parse_pushIndex(p, G.prog.strs.len);
3954 bc_vec_push(&G.prog.strs, &str);
3955 bc_parse_push(p, inst);
3957 RETURN_STATUS(zbc_lex_next(&p->l));
3959 #if ERRORS_ARE_FATAL
3960 # define zbc_parse_string(...) (zbc_parse_string(__VA_ARGS__), BC_STATUS_SUCCESS)
3963 static BC_STATUS zbc_parse_print(BcParse *p)
3969 s = zbc_lex_next(&p->l);
3970 if (s) RETURN_STATUS(s);
3974 if (type == BC_LEX_SCOLON || type == BC_LEX_NLINE)
3975 RETURN_STATUS(bc_error("bad print statement"));
3978 while (type != BC_LEX_SCOLON && type != BC_LEX_NLINE) {
3979 if (type == BC_LEX_STR) {
3980 s = zbc_parse_string(p, BC_INST_PRINT_POP);
3981 if (s) RETURN_STATUS(s);
3983 s = zbc_parse_expr(p, 0, bc_parse_next_print);
3984 if (s) RETURN_STATUS(s);
3985 bc_parse_push(p, BC_INST_PRINT_POP);
3988 comma = p->l.t.t == BC_LEX_COMMA;
3990 s = zbc_lex_next(&p->l);
3991 if (s) RETURN_STATUS(s);
3996 if (comma) RETURN_STATUS(bc_error_bad_token());
3998 RETURN_STATUS(zbc_lex_next(&p->l));
4000 #if ERRORS_ARE_FATAL
4001 # define zbc_parse_print(...) (zbc_parse_print(__VA_ARGS__), BC_STATUS_SUCCESS)
4004 static BC_STATUS zbc_parse_return(BcParse *p)
4010 if (!BC_PARSE_FUNC(p)) RETURN_STATUS(bc_error_bad_token());
4012 s = zbc_lex_next(&p->l);
4013 if (s) RETURN_STATUS(s);
4016 paren = t == BC_LEX_LPAREN;
4018 if (t == BC_LEX_NLINE || t == BC_LEX_SCOLON)
4019 bc_parse_push(p, BC_INST_RET0);
4021 s = bc_parse_expr_empty_ok(p, 0, bc_parse_next_expr);
4022 if (s == BC_STATUS_PARSE_EMPTY_EXP) {
4023 bc_parse_push(p, BC_INST_RET0);
4024 s = zbc_lex_next(&p->l);
4026 if (s) RETURN_STATUS(s);
4028 if (!paren || p->l.t.last != BC_LEX_RPAREN) {
4029 s = bc_POSIX_requires("parentheses around return expressions");
4030 ERROR_RETURN(if (s) RETURN_STATUS(s);)
4033 bc_parse_push(p, BC_INST_RET);
4038 #if ERRORS_ARE_FATAL
4039 # define zbc_parse_return(...) (zbc_parse_return(__VA_ARGS__), BC_STATUS_SUCCESS)
4042 static BC_STATUS zbc_parse_endBody(BcParse *p, bool brace)
4044 BcStatus s = BC_STATUS_SUCCESS;
4046 if (p->flags.len <= 1 || (brace && p->nbraces == 0))
4047 RETURN_STATUS(bc_error_bad_token());
4050 if (p->l.t.t != BC_LEX_RBRACE)
4051 RETURN_STATUS(bc_error_bad_token());
4053 RETURN_STATUS(bc_error_bad_token());
4055 s = zbc_lex_next(&p->l);
4056 if (s) RETURN_STATUS(s);
4059 if (BC_PARSE_IF(p)) {
4062 while (p->l.t.t == BC_LEX_NLINE) {
4063 s = zbc_lex_next(&p->l);
4064 if (s) RETURN_STATUS(s);
4067 bc_vec_pop(&p->flags);
4069 flag_ptr = BC_PARSE_TOP_FLAG_PTR(p);
4070 *flag_ptr = (*flag_ptr | BC_PARSE_FLAG_IF_END);
4072 if (p->l.t.t == BC_LEX_KEY_ELSE)
4073 s = zbc_parse_else(p);
4075 else if (BC_PARSE_ELSE(p)) {
4079 bc_vec_pop(&p->flags);
4081 ip = bc_vec_top(&p->exits);
4082 label = bc_vec_item(&p->func->labels, ip->idx);
4083 *label = p->func->code.len;
4085 bc_vec_pop(&p->exits);
4087 else if (BC_PARSE_FUNC_INNER(p)) {
4088 bc_parse_push(p, BC_INST_RET0);
4089 bc_parse_updateFunc(p, BC_PROG_MAIN);
4090 bc_vec_pop(&p->flags);
4093 BcInstPtr *ip = bc_vec_top(&p->exits);
4094 size_t *label = bc_vec_top(&p->conds);
4096 bc_parse_push(p, BC_INST_JUMP);
4097 bc_parse_pushIndex(p, *label);
4099 label = bc_vec_item(&p->func->labels, ip->idx);
4100 *label = p->func->code.len;
4102 bc_vec_pop(&p->flags);
4103 bc_vec_pop(&p->exits);
4104 bc_vec_pop(&p->conds);
4109 #if ERRORS_ARE_FATAL
4110 # define zbc_parse_endBody(...) (zbc_parse_endBody(__VA_ARGS__), BC_STATUS_SUCCESS)
4113 static void bc_parse_startBody(BcParse *p, uint8_t flags)
4115 uint8_t *flag_ptr = BC_PARSE_TOP_FLAG_PTR(p);
4116 flags |= (*flag_ptr & (BC_PARSE_FLAG_FUNC | BC_PARSE_FLAG_LOOP));
4117 flags |= BC_PARSE_FLAG_BODY;
4118 bc_vec_push(&p->flags, &flags);
4121 static void bc_parse_noElse(BcParse *p)
4125 uint8_t *flag_ptr = BC_PARSE_TOP_FLAG_PTR(p);
4127 *flag_ptr = (*flag_ptr & ~(BC_PARSE_FLAG_IF_END));
4129 ip = bc_vec_top(&p->exits);
4130 label = bc_vec_item(&p->func->labels, ip->idx);
4131 *label = p->func->code.len;
4133 bc_vec_pop(&p->exits);
4136 static BC_STATUS zbc_parse_if(BcParse *p)
4141 s = zbc_lex_next(&p->l);
4142 if (s) RETURN_STATUS(s);
4143 if (p->l.t.t != BC_LEX_LPAREN) RETURN_STATUS(bc_error_bad_token());
4145 s = zbc_lex_next(&p->l);
4146 if (s) RETURN_STATUS(s);
4147 s = zbc_parse_expr(p, BC_PARSE_REL, bc_parse_next_rel);
4148 if (s) RETURN_STATUS(s);
4149 if (p->l.t.t != BC_LEX_RPAREN) RETURN_STATUS(bc_error_bad_token());
4151 s = zbc_lex_next(&p->l);
4152 if (s) RETURN_STATUS(s);
4153 bc_parse_push(p, BC_INST_JUMP_ZERO);
4155 ip.idx = p->func->labels.len;
4156 ip.func = ip.len = 0;
4158 bc_parse_pushIndex(p, ip.idx);
4159 bc_vec_push(&p->exits, &ip);
4160 bc_vec_push(&p->func->labels, &ip.idx);
4161 bc_parse_startBody(p, BC_PARSE_FLAG_IF);
4163 RETURN_STATUS(BC_STATUS_SUCCESS);
4165 #if ERRORS_ARE_FATAL
4166 # define zbc_parse_if(...) (zbc_parse_if(__VA_ARGS__), BC_STATUS_SUCCESS)
4169 #undef zbc_parse_else
4170 static BC_STATUS zbc_parse_else(BcParse *p)
4174 if (!BC_PARSE_IF_END(p)) RETURN_STATUS(bc_error_bad_token());
4176 ip.idx = p->func->labels.len;
4177 ip.func = ip.len = 0;
4179 bc_parse_push(p, BC_INST_JUMP);
4180 bc_parse_pushIndex(p, ip.idx);
4184 bc_vec_push(&p->exits, &ip);
4185 bc_vec_push(&p->func->labels, &ip.idx);
4186 bc_parse_startBody(p, BC_PARSE_FLAG_ELSE);
4188 RETURN_STATUS(zbc_lex_next(&p->l));
4190 #if ERRORS_ARE_FATAL
4191 # define zbc_parse_else(...) (zbc_parse_else(__VA_ARGS__), BC_STATUS_SUCCESS)
4194 static BC_STATUS zbc_parse_while(BcParse *p)
4199 s = zbc_lex_next(&p->l);
4200 if (s) RETURN_STATUS(s);
4201 if (p->l.t.t != BC_LEX_LPAREN) RETURN_STATUS(bc_error_bad_token());
4202 s = zbc_lex_next(&p->l);
4203 if (s) RETURN_STATUS(s);
4205 ip.idx = p->func->labels.len;
4207 bc_vec_push(&p->func->labels, &p->func->code.len);
4208 bc_vec_push(&p->conds, &ip.idx);
4210 ip.idx = p->func->labels.len;
4214 bc_vec_push(&p->exits, &ip);
4215 bc_vec_push(&p->func->labels, &ip.idx);
4217 s = zbc_parse_expr(p, BC_PARSE_REL, bc_parse_next_rel);
4218 if (s) RETURN_STATUS(s);
4219 if (p->l.t.t != BC_LEX_RPAREN) RETURN_STATUS(bc_error_bad_token());
4220 s = zbc_lex_next(&p->l);
4221 if (s) RETURN_STATUS(s);
4223 bc_parse_push(p, BC_INST_JUMP_ZERO);
4224 bc_parse_pushIndex(p, ip.idx);
4225 bc_parse_startBody(p, BC_PARSE_FLAG_LOOP | BC_PARSE_FLAG_LOOP_INNER);
4227 RETURN_STATUS(BC_STATUS_SUCCESS);
4229 #if ERRORS_ARE_FATAL
4230 # define zbc_parse_while(...) (zbc_parse_while(__VA_ARGS__), BC_STATUS_SUCCESS)
4233 static BC_STATUS zbc_parse_for(BcParse *p)
4237 size_t cond_idx, exit_idx, body_idx, update_idx;
4239 s = zbc_lex_next(&p->l);
4240 if (s) RETURN_STATUS(s);
4241 if (p->l.t.t != BC_LEX_LPAREN) RETURN_STATUS(bc_error_bad_token());
4242 s = zbc_lex_next(&p->l);
4243 if (s) RETURN_STATUS(s);
4245 if (p->l.t.t != BC_LEX_SCOLON)
4246 s = zbc_parse_expr(p, 0, bc_parse_next_for);
4248 s = bc_POSIX_does_not_allow_empty_X_expression_in_for("init");
4250 if (s) RETURN_STATUS(s);
4251 if (p->l.t.t != BC_LEX_SCOLON) RETURN_STATUS(bc_error_bad_token());
4252 s = zbc_lex_next(&p->l);
4253 if (s) RETURN_STATUS(s);
4255 cond_idx = p->func->labels.len;
4256 update_idx = cond_idx + 1;
4257 body_idx = update_idx + 1;
4258 exit_idx = body_idx + 1;
4260 bc_vec_push(&p->func->labels, &p->func->code.len);
4262 if (p->l.t.t != BC_LEX_SCOLON)
4263 s = zbc_parse_expr(p, BC_PARSE_REL, bc_parse_next_for);
4265 s = bc_POSIX_does_not_allow_empty_X_expression_in_for("condition");
4267 if (s) RETURN_STATUS(s);
4268 if (p->l.t.t != BC_LEX_SCOLON) RETURN_STATUS(bc_error_bad_token());
4270 s = zbc_lex_next(&p->l);
4271 if (s) RETURN_STATUS(s);
4273 bc_parse_push(p, BC_INST_JUMP_ZERO);
4274 bc_parse_pushIndex(p, exit_idx);
4275 bc_parse_push(p, BC_INST_JUMP);
4276 bc_parse_pushIndex(p, body_idx);
4278 ip.idx = p->func->labels.len;
4280 bc_vec_push(&p->conds, &update_idx);
4281 bc_vec_push(&p->func->labels, &p->func->code.len);
4283 if (p->l.t.t != BC_LEX_RPAREN)
4284 s = zbc_parse_expr(p, 0, bc_parse_next_rel);
4286 s = bc_POSIX_does_not_allow_empty_X_expression_in_for("update");
4288 if (s) RETURN_STATUS(s);
4290 if (p->l.t.t != BC_LEX_RPAREN) RETURN_STATUS(bc_error_bad_token());
4291 bc_parse_push(p, BC_INST_JUMP);
4292 bc_parse_pushIndex(p, cond_idx);
4293 bc_vec_push(&p->func->labels, &p->func->code.len);
4299 bc_vec_push(&p->exits, &ip);
4300 bc_vec_push(&p->func->labels, &ip.idx);
4301 s = zbc_lex_next(&p->l);
4302 if (s) RETURN_STATUS(s);
4303 bc_parse_startBody(p, BC_PARSE_FLAG_LOOP | BC_PARSE_FLAG_LOOP_INNER);
4305 RETURN_STATUS(BC_STATUS_SUCCESS);
4307 #if ERRORS_ARE_FATAL
4308 # define zbc_parse_for(...) (zbc_parse_for(__VA_ARGS__), BC_STATUS_SUCCESS)
4311 static BC_STATUS zbc_parse_loopExit(BcParse *p, BcLexType type)
4317 if (!BC_PARSE_LOOP(p)) RETURN_STATUS(bc_error_bad_token());
4319 if (type == BC_LEX_KEY_BREAK) {
4320 if (p->exits.len == 0) RETURN_STATUS(bc_error_bad_token());
4322 i = p->exits.len - 1;
4323 ip = bc_vec_item(&p->exits, i);
4325 while (!ip->func && i < p->exits.len)
4326 ip = bc_vec_item(&p->exits, i--);
4327 if (i >= p->exits.len && !ip->func)
4328 RETURN_STATUS(bc_error_bad_token());
4333 i = *((size_t *) bc_vec_top(&p->conds));
4335 bc_parse_push(p, BC_INST_JUMP);
4336 bc_parse_pushIndex(p, i);
4338 s = zbc_lex_next(&p->l);
4339 if (s) RETURN_STATUS(s);
4341 if (p->l.t.t != BC_LEX_SCOLON && p->l.t.t != BC_LEX_NLINE)
4342 RETURN_STATUS(bc_error_bad_token());
4344 RETURN_STATUS(zbc_lex_next(&p->l));
4346 #if ERRORS_ARE_FATAL
4347 # define zbc_parse_loopExit(...) (zbc_parse_loopExit(__VA_ARGS__), BC_STATUS_SUCCESS)
4350 static BC_STATUS zbc_parse_func(BcParse *p)
4353 bool var, comma = false;
4357 s = zbc_lex_next(&p->l);
4358 if (s) RETURN_STATUS(s);
4359 if (p->l.t.t != BC_LEX_NAME)
4360 RETURN_STATUS(bc_error("bad function definition"));
4362 name = xstrdup(p->l.t.v.v);
4363 bc_parse_addFunc(p, name, &p->fidx);
4365 s = zbc_lex_next(&p->l);
4366 if (s) RETURN_STATUS(s);
4367 if (p->l.t.t != BC_LEX_LPAREN)
4368 RETURN_STATUS(bc_error("bad function definition"));
4369 s = zbc_lex_next(&p->l);
4370 if (s) RETURN_STATUS(s);
4372 while (p->l.t.t != BC_LEX_RPAREN) {
4373 if (p->l.t.t != BC_LEX_NAME)
4374 RETURN_STATUS(bc_error("bad function definition"));
4378 name = xstrdup(p->l.t.v.v);
4379 s = zbc_lex_next(&p->l);
4382 var = p->l.t.t != BC_LEX_LBRACKET;
4385 s = zbc_lex_next(&p->l);
4388 if (p->l.t.t != BC_LEX_RBRACKET) {
4389 s = bc_error("bad function definition");
4393 s = zbc_lex_next(&p->l);
4397 comma = p->l.t.t == BC_LEX_COMMA;
4399 s = zbc_lex_next(&p->l);
4403 s = zbc_func_insert(p->func, name, var);
4407 if (comma) RETURN_STATUS(bc_error("bad function definition"));
4409 flags = BC_PARSE_FLAG_FUNC | BC_PARSE_FLAG_FUNC_INNER | BC_PARSE_FLAG_BODY;
4410 bc_parse_startBody(p, flags);
4412 s = zbc_lex_next(&p->l);
4413 if (s) RETURN_STATUS(s);
4415 if (p->l.t.t != BC_LEX_LBRACE)
4416 s = bc_POSIX_requires("the left brace be on the same line as the function header");
4424 #if ERRORS_ARE_FATAL
4425 # define zbc_parse_func(...) (zbc_parse_func(__VA_ARGS__), BC_STATUS_SUCCESS)
4428 static BC_STATUS zbc_parse_auto(BcParse *p)
4431 bool comma, var, one;
4434 if (!p->auto_part) RETURN_STATUS(bc_error_bad_token());
4436 s = zbc_lex_next(&p->l);
4437 if (s) RETURN_STATUS(s);
4439 p->auto_part = comma = false;
4440 one = p->l.t.t == BC_LEX_NAME;
4442 while (p->l.t.t == BC_LEX_NAME) {
4443 name = xstrdup(p->l.t.v.v);
4444 s = zbc_lex_next(&p->l);
4447 var = p->l.t.t != BC_LEX_LBRACKET;
4449 s = zbc_lex_next(&p->l);
4452 if (p->l.t.t != BC_LEX_RBRACKET) {
4453 s = bc_error("bad function definition");
4457 s = zbc_lex_next(&p->l);
4461 comma = p->l.t.t == BC_LEX_COMMA;
4463 s = zbc_lex_next(&p->l);
4467 s = zbc_func_insert(p->func, name, var);
4471 if (comma) RETURN_STATUS(bc_error("bad function definition"));
4472 if (!one) RETURN_STATUS(bc_error("no auto variable found"));
4474 if (p->l.t.t != BC_LEX_NLINE && p->l.t.t != BC_LEX_SCOLON)
4475 RETURN_STATUS(bc_error_bad_token());
4477 RETURN_STATUS(zbc_lex_next(&p->l));
4483 #if ERRORS_ARE_FATAL
4484 # define zbc_parse_auto(...) (zbc_parse_auto(__VA_ARGS__), BC_STATUS_SUCCESS)
4487 static BC_STATUS zbc_parse_body(BcParse *p, bool brace)
4489 BcStatus s = BC_STATUS_SUCCESS;
4490 uint8_t *flag_ptr = bc_vec_top(&p->flags);
4492 *flag_ptr &= ~(BC_PARSE_FLAG_BODY);
4494 if (*flag_ptr & BC_PARSE_FLAG_FUNC_INNER) {
4495 if (!brace) RETURN_STATUS(bc_error_bad_token());
4497 p->auto_part = p->l.t.t != BC_LEX_KEY_AUTO;
4499 if (!p->auto_part) {
4500 s = zbc_parse_auto(p);
4501 if (s) RETURN_STATUS(s);
4504 if (p->l.t.t == BC_LEX_NLINE) s = zbc_lex_next(&p->l);
4507 s = zbc_parse_stmt(p);
4508 if (!s && !brace) s = zbc_parse_endBody(p, false);
4513 #if ERRORS_ARE_FATAL
4514 # define zbc_parse_body(...) (zbc_parse_body(__VA_ARGS__), BC_STATUS_SUCCESS)
4517 #undef zbc_parse_stmt
4518 static BC_STATUS zbc_parse_stmt(BcParse *p)
4520 BcStatus s = BC_STATUS_SUCCESS;
4524 RETURN_STATUS(zbc_lex_next(&p->l));
4526 case BC_LEX_KEY_ELSE:
4527 p->auto_part = false;
4531 if (!BC_PARSE_BODY(p)) RETURN_STATUS(bc_error_bad_token());
4533 s = zbc_lex_next(&p->l);
4534 if (s) RETURN_STATUS(s);
4535 RETURN_STATUS(zbc_parse_body(p, true));
4537 case BC_LEX_KEY_AUTO:
4538 RETURN_STATUS(zbc_parse_auto(p));
4541 p->auto_part = false;
4542 if (BC_PARSE_IF_END(p)) {
4544 RETURN_STATUS(BC_STATUS_SUCCESS);
4546 if (BC_PARSE_BODY(p))
4547 RETURN_STATUS(zbc_parse_body(p, false));
4554 case BC_LEX_OP_MINUS:
4555 case BC_LEX_OP_BOOL_NOT:
4559 case BC_LEX_KEY_IBASE:
4560 case BC_LEX_KEY_LAST:
4561 case BC_LEX_KEY_LENGTH:
4562 case BC_LEX_KEY_OBASE:
4563 case BC_LEX_KEY_READ:
4564 case BC_LEX_KEY_SCALE:
4565 case BC_LEX_KEY_SQRT:
4566 s = zbc_parse_expr(p, BC_PARSE_PRINT, bc_parse_next_expr);
4568 case BC_LEX_KEY_ELSE:
4569 s = zbc_parse_else(p);
4572 while (!s && p->l.t.t == BC_LEX_SCOLON) s = zbc_lex_next(&p->l);
4575 s = zbc_parse_endBody(p, true);
4578 s = zbc_parse_string(p, BC_INST_PRINT_STR);
4580 case BC_LEX_KEY_BREAK:
4581 case BC_LEX_KEY_CONTINUE:
4582 s = zbc_parse_loopExit(p, p->l.t.t);
4584 case BC_LEX_KEY_FOR:
4585 s = zbc_parse_for(p);
4587 case BC_LEX_KEY_HALT:
4588 bc_parse_push(p, BC_INST_HALT);
4589 s = zbc_lex_next(&p->l);
4592 s = zbc_parse_if(p);
4594 case BC_LEX_KEY_LIMITS:
4595 // "limits" is a compile-time command,
4596 // the output is produced at _parse time_.
4597 s = zbc_lex_next(&p->l);
4598 if (s) RETURN_STATUS(s);
4600 "BC_BASE_MAX = "BC_MAX_OBASE_STR "\n"
4601 "BC_DIM_MAX = "BC_MAX_DIM_STR "\n"
4602 "BC_SCALE_MAX = "BC_MAX_SCALE_STR "\n"
4603 "BC_STRING_MAX = "BC_MAX_STRING_STR"\n"
4604 "BC_NAME_MAX = "BC_MAX_NAME_STR "\n"
4605 "BC_NUM_MAX = "BC_MAX_NUM_STR "\n"
4606 "MAX Exponent = "BC_MAX_EXP_STR "\n"
4607 "Number of vars = "BC_MAX_VARS_STR "\n"
4610 case BC_LEX_KEY_PRINT:
4611 s = zbc_parse_print(p);
4613 case BC_LEX_KEY_QUIT:
4614 // "quit" is a compile-time command. For example,
4615 // "if (0 == 1) quit" terminates when parsing the statement,
4616 // not when it is executed
4617 QUIT_OR_RETURN_TO_MAIN;
4618 case BC_LEX_KEY_RETURN:
4619 s = zbc_parse_return(p);
4621 case BC_LEX_KEY_WHILE:
4622 s = zbc_parse_while(p);
4625 s = bc_error_bad_token();
4631 #if ERRORS_ARE_FATAL
4632 # define zbc_parse_stmt(...) (zbc_parse_stmt(__VA_ARGS__), BC_STATUS_SUCCESS)
4635 static BC_STATUS zbc_parse_parse(BcParse *p)
4639 if (p->l.t.t == BC_LEX_EOF)
4640 s = p->flags.len > 0 ? bc_error("block end could not be found") : bc_error("end of file");
4641 else if (p->l.t.t == BC_LEX_KEY_DEFINE) {
4642 if (!BC_PARSE_CAN_EXEC(p))
4643 RETURN_STATUS(bc_error_bad_token());
4644 s = zbc_parse_func(p);
4646 s = zbc_parse_stmt(p);
4648 if (s || G_interrupt) {
4650 s = BC_STATUS_FAILURE;
4655 #if ERRORS_ARE_FATAL
4656 # define zbc_parse_parse(...) (zbc_parse_parse(__VA_ARGS__), BC_STATUS_SUCCESS)
4659 // This is not a "z" function: can also return BC_STATUS_PARSE_EMPTY_EXP
4660 static BcStatus bc_parse_expr_empty_ok(BcParse *p, uint8_t flags, BcParseNext next)
4662 BcStatus s = BC_STATUS_SUCCESS;
4663 BcInst prev = BC_INST_PRINT;
4664 BcLexType top, t = p->l.t.t;
4665 size_t nexprs = 0, ops_bgn = p->ops.len;
4666 unsigned nparens, nrelops;
4667 bool paren_first, paren_expr, rprn, done, get_token, assign, bin_last;
4669 paren_first = p->l.t.t == BC_LEX_LPAREN;
4670 nparens = nrelops = 0;
4671 paren_expr = rprn = done = get_token = assign = false;
4674 for (; !G_interrupt && !s && !done && bc_parse_exprs(t); t = p->l.t.t) {
4680 s = zbc_parse_incdec(p, &prev, &paren_expr, &nexprs, flags);
4681 rprn = get_token = bin_last = false;
4685 case BC_LEX_OP_MINUS:
4687 s = zbc_parse_minus(p, &prev, ops_bgn, rprn, &nexprs);
4688 rprn = get_token = false;
4689 bin_last = prev == BC_INST_MINUS;
4693 case BC_LEX_OP_ASSIGN_POWER:
4694 case BC_LEX_OP_ASSIGN_MULTIPLY:
4695 case BC_LEX_OP_ASSIGN_DIVIDE:
4696 case BC_LEX_OP_ASSIGN_MODULUS:
4697 case BC_LEX_OP_ASSIGN_PLUS:
4698 case BC_LEX_OP_ASSIGN_MINUS:
4699 case BC_LEX_OP_ASSIGN:
4701 if (prev != BC_INST_VAR && prev != BC_INST_ARRAY_ELEM &&
4702 prev != BC_INST_SCALE && prev != BC_INST_IBASE &&
4703 prev != BC_INST_OBASE && prev != BC_INST_LAST)
4705 s = bc_error("bad assignment:"
4706 " left side must be scale,"
4707 " ibase, obase, last, var,"
4714 case BC_LEX_OP_POWER:
4715 case BC_LEX_OP_MULTIPLY:
4716 case BC_LEX_OP_DIVIDE:
4717 case BC_LEX_OP_MODULUS:
4718 case BC_LEX_OP_PLUS:
4719 case BC_LEX_OP_REL_EQ:
4720 case BC_LEX_OP_REL_LE:
4721 case BC_LEX_OP_REL_GE:
4722 case BC_LEX_OP_REL_NE:
4723 case BC_LEX_OP_REL_LT:
4724 case BC_LEX_OP_REL_GT:
4725 case BC_LEX_OP_BOOL_NOT:
4726 case BC_LEX_OP_BOOL_OR:
4727 case BC_LEX_OP_BOOL_AND:
4729 if (((t == BC_LEX_OP_BOOL_NOT) != bin_last)
4730 || (t != BC_LEX_OP_BOOL_NOT && prev == BC_INST_BOOL_NOT)
4732 return bc_error_bad_expression();
4735 nrelops += t >= BC_LEX_OP_REL_EQ && t <= BC_LEX_OP_REL_GT;
4736 prev = BC_PARSE_TOKEN_INST(t);
4737 s = zbc_parse_operator(p, t, ops_bgn, &nexprs, true);
4738 rprn = get_token = false;
4739 bin_last = t != BC_LEX_OP_BOOL_NOT;
4746 if (BC_PARSE_LEAF(prev, rprn))
4747 return bc_error_bad_expression();
4749 paren_expr = rprn = bin_last = false;
4751 bc_vec_push(&p->ops, &t);
4758 if (bin_last || prev == BC_INST_BOOL_NOT)
4759 return bc_error_bad_expression();
4762 s = BC_STATUS_SUCCESS;
4767 else if (!paren_expr)
4768 return BC_STATUS_PARSE_EMPTY_EXP;
4771 paren_expr = rprn = true;
4772 get_token = bin_last = false;
4774 s = zbc_parse_rightParen(p, ops_bgn, &nexprs);
4781 if (BC_PARSE_LEAF(prev, rprn))
4782 return bc_error_bad_expression();
4784 rprn = get_token = bin_last = false;
4785 s = zbc_parse_name(p, &prev, flags & ~BC_PARSE_NOCALL);
4793 if (BC_PARSE_LEAF(prev, rprn))
4794 return bc_error_bad_expression();
4795 bc_parse_number(p, &prev, &nexprs);
4796 paren_expr = get_token = true;
4797 rprn = bin_last = false;
4802 case BC_LEX_KEY_IBASE:
4803 case BC_LEX_KEY_LAST:
4804 case BC_LEX_KEY_OBASE:
4806 if (BC_PARSE_LEAF(prev, rprn))
4807 return bc_error_bad_expression();
4808 prev = (char) (t - BC_LEX_KEY_IBASE + BC_INST_IBASE);
4809 bc_parse_push(p, (char) prev);
4811 paren_expr = get_token = true;
4812 rprn = bin_last = false;
4818 case BC_LEX_KEY_LENGTH:
4819 case BC_LEX_KEY_SQRT:
4821 if (BC_PARSE_LEAF(prev, rprn))
4822 return bc_error_bad_expression();
4823 s = zbc_parse_builtin(p, t, flags, &prev);
4825 rprn = get_token = bin_last = false;
4831 case BC_LEX_KEY_READ:
4833 if (BC_PARSE_LEAF(prev, rprn))
4834 return bc_error_bad_expression();
4835 else if (flags & BC_PARSE_NOREAD)
4836 s = bc_error_nested_read_call();
4838 s = zbc_parse_read(p);
4841 rprn = get_token = bin_last = false;
4843 prev = BC_INST_READ;
4848 case BC_LEX_KEY_SCALE:
4850 if (BC_PARSE_LEAF(prev, rprn))
4851 return bc_error_bad_expression();
4852 s = zbc_parse_scale(p, &prev, flags);
4854 rprn = get_token = bin_last = false;
4856 prev = BC_INST_SCALE;
4863 s = bc_error_bad_token();
4868 if (!s && get_token) s = zbc_lex_next(&p->l);
4872 if (G_interrupt) return BC_STATUS_FAILURE; // ^C: stop parsing
4874 while (p->ops.len > ops_bgn) {
4876 top = BC_PARSE_TOP_OP(p);
4877 assign = top >= BC_LEX_OP_ASSIGN_POWER && top <= BC_LEX_OP_ASSIGN;
4879 if (top == BC_LEX_LPAREN || top == BC_LEX_RPAREN)
4880 return bc_error_bad_expression();
4882 bc_parse_push(p, BC_PARSE_TOKEN_INST(top));
4884 nexprs -= top != BC_LEX_OP_BOOL_NOT && top != BC_LEX_NEG;
4885 bc_vec_pop(&p->ops);
4888 if (prev == BC_INST_BOOL_NOT || nexprs != 1)
4889 return bc_error_bad_expression();
4891 // next is BcParseNext, byte array of up to 4 BC_LEX's, packed into 32-bit word
4893 if (t == (next & 0x7f))
4895 if (next & 0x80) // last element?
4899 return bc_error_bad_expression();
4902 if (!(flags & BC_PARSE_REL) && nrelops) {
4903 s = bc_POSIX_does_not_allow("comparison operators outside if or loops");
4904 ERROR_RETURN(if (s) return s;)
4906 else if ((flags & BC_PARSE_REL) && nrelops > 1) {
4907 s = bc_POSIX_requires("exactly one comparison operator per condition");
4908 ERROR_RETURN(if (s) return s;)
4911 if (flags & BC_PARSE_PRINT) {
4912 if (paren_first || !assign) bc_parse_push(p, BC_INST_PRINT);
4913 bc_parse_push(p, BC_INST_POP);
4919 #undef zbc_parse_expr
4920 static BC_STATUS zbc_parse_expr(BcParse *p, uint8_t flags, BcParseNext next)
4924 s = bc_parse_expr_empty_ok(p, flags, next);
4925 if (s == BC_STATUS_PARSE_EMPTY_EXP)
4926 RETURN_STATUS(bc_error("empty expression"));
4929 #if ERRORS_ARE_FATAL
4930 # define zbc_parse_expr(...) (zbc_parse_expr(__VA_ARGS__), BC_STATUS_SUCCESS)
4933 static BC_STATUS zbc_parse_expression(BcParse *p, uint8_t flags)
4935 RETURN_STATUS(zbc_parse_expr(p, flags, bc_parse_next_read));
4937 #if ERRORS_ARE_FATAL
4938 # define zbc_parse_expression(...) (zbc_parse_expression(__VA_ARGS__), BC_STATUS_SUCCESS)
4945 #define DC_PARSE_BUF_LEN ((int) (sizeof(uint32_t) * CHAR_BIT))
4947 static BC_STATUS zdc_parse_register(BcParse *p)
4952 s = zbc_lex_next(&p->l);
4953 if (s) RETURN_STATUS(s);
4954 if (p->l.t.t != BC_LEX_NAME) RETURN_STATUS(bc_error_bad_token());
4956 name = xstrdup(p->l.t.v.v);
4957 bc_parse_pushName(p, name);
4961 #if ERRORS_ARE_FATAL
4962 # define zdc_parse_register(...) (zdc_parse_register(__VA_ARGS__), BC_STATUS_SUCCESS)
4965 static BC_STATUS zdc_parse_string(BcParse *p)
4967 char *str, *name, b[DC_PARSE_BUF_LEN + 1];
4968 size_t idx, len = G.prog.strs.len;
4970 sprintf(b, "%0*zu", DC_PARSE_BUF_LEN, len);
4973 str = xstrdup(p->l.t.v.v);
4974 bc_parse_push(p, BC_INST_STR);
4975 bc_parse_pushIndex(p, len);
4976 bc_vec_push(&G.prog.strs, &str);
4977 bc_parse_addFunc(p, name, &idx);
4979 RETURN_STATUS(zbc_lex_next(&p->l));
4981 #if ERRORS_ARE_FATAL
4982 # define zdc_parse_string(...) (zdc_parse_string(__VA_ARGS__), BC_STATUS_SUCCESS)
4985 static BC_STATUS zdc_parse_mem(BcParse *p, uint8_t inst, bool name, bool store)
4989 bc_parse_push(p, inst);
4991 s = zdc_parse_register(p);
4992 if (s) RETURN_STATUS(s);
4996 bc_parse_push(p, BC_INST_SWAP);
4997 bc_parse_push(p, BC_INST_ASSIGN);
4998 bc_parse_push(p, BC_INST_POP);
5001 RETURN_STATUS(zbc_lex_next(&p->l));
5003 #if ERRORS_ARE_FATAL
5004 # define zdc_parse_mem(...) (zdc_parse_mem(__VA_ARGS__), BC_STATUS_SUCCESS)
5007 static BC_STATUS zdc_parse_cond(BcParse *p, uint8_t inst)
5011 bc_parse_push(p, inst);
5012 bc_parse_push(p, BC_INST_EXEC_COND);
5014 s = zdc_parse_register(p);
5015 if (s) RETURN_STATUS(s);
5017 s = zbc_lex_next(&p->l);
5018 if (s) RETURN_STATUS(s);
5020 if (p->l.t.t == BC_LEX_ELSE) {
5021 s = zdc_parse_register(p);
5022 if (s) RETURN_STATUS(s);
5023 s = zbc_lex_next(&p->l);
5026 bc_parse_push(p, BC_PARSE_STREND);
5030 #if ERRORS_ARE_FATAL
5031 # define zdc_parse_cond(...) (zdc_parse_cond(__VA_ARGS__), BC_STATUS_SUCCESS)
5034 static BC_STATUS zdc_parse_token(BcParse *p, BcLexType t, uint8_t flags)
5036 BcStatus s = BC_STATUS_SUCCESS;
5039 bool assign, get_token = false;
5042 case BC_LEX_OP_REL_EQ:
5043 case BC_LEX_OP_REL_LE:
5044 case BC_LEX_OP_REL_GE:
5045 case BC_LEX_OP_REL_NE:
5046 case BC_LEX_OP_REL_LT:
5047 case BC_LEX_OP_REL_GT:
5048 s = zdc_parse_cond(p, t - BC_LEX_OP_REL_EQ + BC_INST_REL_EQ);
5052 s = zdc_parse_mem(p, BC_INST_ARRAY_ELEM, true, t == BC_LEX_COLON);
5055 s = zdc_parse_string(p);
5059 if (t == BC_LEX_NEG) {
5060 s = zbc_lex_next(&p->l);
5061 if (s) RETURN_STATUS(s);
5062 if (p->l.t.t != BC_LEX_NUMBER)
5063 RETURN_STATUS(bc_error_bad_token());
5065 bc_parse_number(p, &prev, &p->nbraces);
5066 if (t == BC_LEX_NEG) bc_parse_push(p, BC_INST_NEG);
5069 case BC_LEX_KEY_READ:
5070 if (flags & BC_PARSE_NOREAD)
5071 s = bc_error_nested_read_call();
5073 bc_parse_push(p, BC_INST_READ);
5076 case BC_LEX_OP_ASSIGN:
5077 case BC_LEX_STORE_PUSH:
5078 assign = t == BC_LEX_OP_ASSIGN;
5079 inst = assign ? BC_INST_VAR : BC_INST_PUSH_TO_VAR;
5080 s = zdc_parse_mem(p, inst, true, assign);
5083 case BC_LEX_LOAD_POP:
5084 inst = t == BC_LEX_LOAD_POP ? BC_INST_PUSH_VAR : BC_INST_LOAD;
5085 s = zdc_parse_mem(p, inst, true, false);
5087 case BC_LEX_STORE_IBASE:
5088 case BC_LEX_STORE_SCALE:
5089 case BC_LEX_STORE_OBASE:
5090 inst = t - BC_LEX_STORE_IBASE + BC_INST_IBASE;
5091 s = zdc_parse_mem(p, inst, false, true);
5094 s = bc_error_bad_token();
5099 if (!s && get_token) s = zbc_lex_next(&p->l);
5103 #if ERRORS_ARE_FATAL
5104 # define zdc_parse_token(...) (zdc_parse_token(__VA_ARGS__), BC_STATUS_SUCCESS)
5107 static BC_STATUS zdc_parse_expr(BcParse *p, uint8_t flags)
5109 BcStatus s = BC_STATUS_SUCCESS;
5113 if (flags & BC_PARSE_NOCALL) p->nbraces = G.prog.results.len;
5115 for (t = p->l.t.t; !s && t != BC_LEX_EOF; t = p->l.t.t) {
5116 inst = dc_parse_insts[t];
5118 if (inst != BC_INST_INVALID) {
5119 bc_parse_push(p, inst);
5120 s = zbc_lex_next(&p->l);
5122 s = zdc_parse_token(p, t, flags);
5125 if (!s && p->l.t.t == BC_LEX_EOF && (flags & BC_PARSE_NOCALL))
5126 bc_parse_push(p, BC_INST_POP_EXEC);
5130 #if ERRORS_ARE_FATAL
5131 # define zdc_parse_expr(...) (zdc_parse_expr(__VA_ARGS__), BC_STATUS_SUCCESS)
5134 static BC_STATUS zdc_parse_parse(BcParse *p)
5138 if (p->l.t.t == BC_LEX_EOF)
5139 s = bc_error("end of file");
5141 s = zdc_parse_expr(p, 0);
5143 if (s || G_interrupt) {
5145 s = BC_STATUS_FAILURE;
5150 #if ERRORS_ARE_FATAL
5151 # define zdc_parse_parse(...) (zdc_parse_parse(__VA_ARGS__), BC_STATUS_SUCCESS)
5156 static BC_STATUS zcommon_parse_expr(BcParse *p, uint8_t flags)
5159 IF_BC(RETURN_STATUS(zbc_parse_expression(p, flags));)
5161 IF_DC(RETURN_STATUS(zdc_parse_expr(p, flags));)
5164 #if ERRORS_ARE_FATAL
5165 # define zcommon_parse_expr(...) (zcommon_parse_expr(__VA_ARGS__), BC_STATUS_SUCCESS)
5168 static BcVec* bc_program_search(char *id, bool var)
5176 v = var ? &G.prog.vars : &G.prog.arrs;
5177 map = var ? &G.prog.var_map : &G.prog.arr_map;
5181 new = bc_map_insert(map, &e, &i); // 1 if insertion was successful
5184 bc_array_init(&data.v, var);
5185 bc_vec_push(v, &data.v);
5188 ptr = bc_vec_item(map, i);
5189 if (new) ptr->name = xstrdup(e.name);
5190 return bc_vec_item(v, ptr->idx);
5193 static BC_STATUS zbc_program_num(BcResult *r, BcNum **num, bool hex)
5198 case BC_RESULT_TEMP:
5199 case BC_RESULT_IBASE:
5200 case BC_RESULT_SCALE:
5201 case BC_RESULT_OBASE:
5207 case BC_RESULT_CONSTANT:
5210 char **str = bc_vec_item(&G.prog.consts, r->d.id.idx);
5211 size_t base_t, len = strlen(*str);
5214 bc_num_init(&r->d.n, len);
5216 hex = hex && len == 1;
5217 base = hex ? &G.prog.hexb : &G.prog.ib;
5218 base_t = hex ? BC_NUM_MAX_IBASE : G.prog.ib_t;
5219 s = zbc_num_parse(&r->d.n, *str, base, base_t);
5222 bc_num_free(&r->d.n);
5227 r->t = BC_RESULT_TEMP;
5233 case BC_RESULT_ARRAY:
5234 case BC_RESULT_ARRAY_ELEM:
5238 v = bc_program_search(r->d.id.name, r->t == BC_RESULT_VAR);
5240 if (r->t == BC_RESULT_ARRAY_ELEM) {
5242 if (v->len <= r->d.id.idx) bc_array_expand(v, r->d.id.idx + 1);
5243 *num = bc_vec_item(v, r->d.id.idx);
5246 *num = bc_vec_top(v);
5251 case BC_RESULT_LAST:
5253 *num = &G.prog.last;
5264 RETURN_STATUS(BC_STATUS_SUCCESS);
5266 #if ERRORS_ARE_FATAL
5267 # define zbc_program_num(...) (zbc_program_num(__VA_ARGS__), BC_STATUS_SUCCESS)
5270 static BC_STATUS zbc_program_binOpPrep(BcResult **l, BcNum **ln,
5271 BcResult **r, BcNum **rn, bool assign)
5275 BcResultType lt, rt;
5277 if (!BC_PROG_STACK(&G.prog.results, 2))
5278 RETURN_STATUS(bc_error_stack_has_too_few_elements());
5280 *r = bc_vec_item_rev(&G.prog.results, 0);
5281 *l = bc_vec_item_rev(&G.prog.results, 1);
5285 hex = assign && (lt == BC_RESULT_IBASE || lt == BC_RESULT_OBASE);
5287 s = zbc_program_num(*l, ln, false);
5288 if (s) RETURN_STATUS(s);
5289 s = zbc_program_num(*r, rn, hex);
5290 if (s) RETURN_STATUS(s);
5292 // We run this again under these conditions in case any vector has been
5293 // reallocated out from under the BcNums or arrays we had.
5294 if (lt == rt && (lt == BC_RESULT_VAR || lt == BC_RESULT_ARRAY_ELEM)) {
5295 s = zbc_program_num(*l, ln, false);
5296 if (s) RETURN_STATUS(s);
5299 if (!BC_PROG_NUM((*l), (*ln)) && (!assign || (*l)->t != BC_RESULT_VAR))
5300 RETURN_STATUS(bc_error_variable_is_wrong_type());
5301 if (!assign && !BC_PROG_NUM((*r), (*ln)))
5302 RETURN_STATUS(bc_error_variable_is_wrong_type());
5306 #if ERRORS_ARE_FATAL
5307 # define zbc_program_binOpPrep(...) (zbc_program_binOpPrep(__VA_ARGS__), BC_STATUS_SUCCESS)
5310 static void bc_program_binOpRetire(BcResult *r)
5312 r->t = BC_RESULT_TEMP;
5313 bc_vec_pop(&G.prog.results);
5314 bc_vec_pop(&G.prog.results);
5315 bc_vec_push(&G.prog.results, r);
5318 static BC_STATUS zbc_program_prep(BcResult **r, BcNum **n)
5322 if (!BC_PROG_STACK(&G.prog.results, 1))
5323 RETURN_STATUS(bc_error_stack_has_too_few_elements());
5324 *r = bc_vec_top(&G.prog.results);
5326 s = zbc_program_num(*r, n, false);
5327 if (s) RETURN_STATUS(s);
5329 if (!BC_PROG_NUM((*r), (*n)))
5330 RETURN_STATUS(bc_error_variable_is_wrong_type());
5334 #if ERRORS_ARE_FATAL
5335 # define zbc_program_prep(...) (zbc_program_prep(__VA_ARGS__), BC_STATUS_SUCCESS)
5338 static void bc_program_retire(BcResult *r, BcResultType t)
5341 bc_vec_pop(&G.prog.results);
5342 bc_vec_push(&G.prog.results, r);
5345 static BC_STATUS zbc_program_op(char inst)
5348 BcResult *opd1, *opd2, res;
5349 BcNum *n1, *n2 = NULL;
5351 s = zbc_program_binOpPrep(&opd1, &n1, &opd2, &n2, false);
5352 if (s) RETURN_STATUS(s);
5353 bc_num_init_DEF_SIZE(&res.d.n);
5355 s = BC_STATUS_SUCCESS;
5356 ERROR_RETURN(s =) zbc_program_ops[inst - BC_INST_POWER](n1, n2, &res.d.n, G.prog.scale);
5358 bc_program_binOpRetire(&res);
5363 bc_num_free(&res.d.n);
5366 #if ERRORS_ARE_FATAL
5367 # define zbc_program_op(...) (zbc_program_op(__VA_ARGS__), BC_STATUS_SUCCESS)
5370 static BC_STATUS zbc_program_read(void)
5372 const char *sv_file;
5380 RETURN_STATUS(bc_error_nested_read_call());
5382 f = bc_program_func(BC_PROG_READ);
5383 bc_vec_pop_all(&f->code);
5385 sv_file = G.prog.file;
5389 bc_char_vec_init(&buf);
5392 bc_parse_create(&parse, BC_PROG_READ);
5393 bc_lex_file(&parse.l);
5395 s = zbc_parse_text(&parse, buf.v);
5396 if (s) goto exec_err;
5397 s = zcommon_parse_expr(&parse, BC_PARSE_NOREAD);
5398 if (s) goto exec_err;
5400 if (parse.l.t.t != BC_LEX_NLINE && parse.l.t.t != BC_LEX_EOF) {
5401 s = bc_error("bad read() expression");
5405 ip.func = BC_PROG_READ;
5407 ip.len = G.prog.results.len;
5409 // Update this pointer, just in case.
5410 f = bc_program_func(BC_PROG_READ);
5412 bc_vec_pushByte(&f->code, BC_INST_POP_EXEC);
5413 bc_vec_push(&G.prog.stack, &ip);
5416 bc_parse_free(&parse);
5419 G.prog.file = sv_file;
5423 #if ERRORS_ARE_FATAL
5424 # define zbc_program_read(...) (zbc_program_read(__VA_ARGS__), BC_STATUS_SUCCESS)
5427 static size_t bc_program_index(char *code, size_t *bgn)
5429 char amt = code[(*bgn)++], i = 0;
5432 for (; i < amt; ++i, ++(*bgn))
5433 res |= (((size_t)((int) code[*bgn]) & UCHAR_MAX) << (i * CHAR_BIT));
5438 static char *bc_program_name(char *code, size_t *bgn)
5441 char c, *s, *str = code + *bgn, *ptr = strchr(str, BC_PARSE_STREND);
5443 s = xmalloc(ptr - str + 1);
5446 for (i = 0; c != 0 && c != BC_PARSE_STREND; c = code[(*bgn)++], ++i)
5454 static void bc_program_printString(const char *str)
5458 // Example: echo '[]ap' | dc
5459 // should print two bytes: 0x00, 0x0A
5466 if (c != '\\' || !*str)
5486 G.prog.nchars = SIZE_MAX;
5498 // Just print the backslash and following character.
5509 static void bc_num_printNewline(void)
5511 if (G.prog.nchars == G.prog.len - 1) {
5519 static FAST_FUNC void bc_num_printChar(size_t num, size_t width, bool radix)
5522 bb_putchar((char) num);
5523 G.prog.nchars += width;
5527 static FAST_FUNC void bc_num_printDigits(size_t num, size_t width, bool radix)
5531 bc_num_printNewline();
5532 bb_putchar(radix ? '.' : ' ');
5535 bc_num_printNewline();
5536 for (exp = 0, pow = 1; exp < width - 1; ++exp, pow *= 10)
5539 for (exp = 0; exp < width; pow /= 10, ++G.prog.nchars, ++exp) {
5541 bc_num_printNewline();
5544 bb_putchar(((char) dig) + '0');
5548 static FAST_FUNC void bc_num_printHex(size_t num, size_t width, bool radix)
5551 bc_num_printNewline();
5556 bc_num_printNewline();
5557 bb_putchar(bb_hexdigits_upcase[num]);
5558 G.prog.nchars += width;
5561 static void bc_num_printDecimal(BcNum *n)
5563 size_t i, rdx = n->rdx - 1;
5565 if (n->neg) bb_putchar('-');
5566 G.prog.nchars += n->neg;
5568 for (i = n->len - 1; i < n->len; --i)
5569 bc_num_printHex((size_t) n->num[i], 1, i == rdx);
5572 static BC_STATUS zbc_num_printNum(BcNum *n, BcNum *base, size_t width, BcNumDigitOp print)
5576 BcNum intp, fracp, digit, frac_len;
5577 unsigned long dig, *ptr;
5582 print(0, width, false);
5583 RETURN_STATUS(BC_STATUS_SUCCESS);
5586 bc_vec_init(&stack, sizeof(long), NULL);
5587 bc_num_init(&intp, n->len);
5588 bc_num_init(&fracp, n->rdx);
5589 bc_num_init(&digit, width);
5590 bc_num_init(&frac_len, BC_NUM_INT(n));
5591 bc_num_copy(&intp, n);
5592 bc_num_one(&frac_len);
5594 bc_num_truncate(&intp, intp.rdx);
5595 s = zbc_num_sub(n, &intp, &fracp, 0);
5598 while (intp.len != 0) {
5599 s = zbc_num_divmod(&intp, base, &intp, &digit, 0);
5601 s = zbc_num_ulong(&digit, &dig);
5603 bc_vec_push(&stack, &dig);
5606 for (i = 0; i < stack.len; ++i) {
5607 ptr = bc_vec_item_rev(&stack, i);
5608 print(*ptr, width, false);
5611 if (!n->rdx) goto err;
5613 for (radix = true; frac_len.len <= n->rdx; radix = false) {
5614 s = zbc_num_mul(&fracp, base, &fracp, n->rdx);
5616 s = zbc_num_ulong(&fracp, &dig);
5618 bc_num_ulong2num(&intp, dig);
5619 s = zbc_num_sub(&fracp, &intp, &fracp, 0);
5621 print(dig, width, radix);
5622 s = zbc_num_mul(&frac_len, base, &frac_len, 0);
5627 bc_num_free(&frac_len);
5628 bc_num_free(&digit);
5629 bc_num_free(&fracp);
5631 bc_vec_free(&stack);
5634 #if ERRORS_ARE_FATAL
5635 # define zbc_num_printNum(...) (zbc_num_printNum(__VA_ARGS__), BC_STATUS_SUCCESS)
5638 static BC_STATUS zbc_num_printBase(BcNum *n)
5652 if (G.prog.ob_t <= BC_NUM_MAX_IBASE) {
5654 print = bc_num_printHex;
5657 for (i = G.prog.ob_t - 1, width = 0; i != 0; i /= 10, ++width)
5659 print = bc_num_printDigits;
5662 s = zbc_num_printNum(n, &G.prog.ob, width, print);
5667 #if ERRORS_ARE_FATAL
5668 # define zbc_num_printBase(...) (zbc_num_printBase(__VA_ARGS__), BC_STATUS_SUCCESS)
5672 static BC_STATUS zbc_num_stream(BcNum *n, BcNum *base)
5674 RETURN_STATUS(zbc_num_printNum(n, base, 1, bc_num_printChar));
5676 #if ERRORS_ARE_FATAL
5677 # define zbc_num_stream(...) (zbc_num_stream(__VA_ARGS__), BC_STATUS_SUCCESS)
5681 static BC_STATUS zbc_num_print(BcNum *n, bool newline)
5683 BcStatus s = BC_STATUS_SUCCESS;
5685 bc_num_printNewline();
5691 else if (G.prog.ob_t == 10)
5692 bc_num_printDecimal(n);
5694 s = zbc_num_printBase(n);
5703 #if ERRORS_ARE_FATAL
5704 # define zbc_num_print(...) (zbc_num_print(__VA_ARGS__), BC_STATUS_SUCCESS)
5707 static BC_STATUS zbc_program_print(char inst, size_t idx)
5712 bool pop = inst != BC_INST_PRINT;
5714 if (!BC_PROG_STACK(&G.prog.results, idx + 1))
5715 RETURN_STATUS(bc_error_stack_has_too_few_elements());
5717 r = bc_vec_item_rev(&G.prog.results, idx);
5718 num = NULL; // is this NULL necessary?
5719 s = zbc_program_num(r, &num, false);
5720 if (s) RETURN_STATUS(s);
5722 if (BC_PROG_NUM(r, num)) {
5723 s = zbc_num_print(num, !pop);
5724 if (!s) bc_num_copy(&G.prog.last, num);
5729 idx = (r->t == BC_RESULT_STR) ? r->d.id.idx : num->rdx;
5730 str = *bc_program_str(idx);
5732 if (inst == BC_INST_PRINT_STR) {
5735 if (c == '\0') break;
5738 if (c == '\n') G.prog.nchars = 0;
5742 bc_program_printString(str);
5743 if (inst == BC_INST_PRINT) bb_putchar('\n');
5747 if (!s && pop) bc_vec_pop(&G.prog.results);
5751 #if ERRORS_ARE_FATAL
5752 # define zbc_program_print(...) (zbc_program_print(__VA_ARGS__), BC_STATUS_SUCCESS)
5755 static BC_STATUS zbc_program_negate(void)
5761 s = zbc_program_prep(&ptr, &num);
5762 if (s) RETURN_STATUS(s);
5764 bc_num_init(&res.d.n, num->len);
5765 bc_num_copy(&res.d.n, num);
5766 if (res.d.n.len) res.d.n.neg = !res.d.n.neg;
5768 bc_program_retire(&res, BC_RESULT_TEMP);
5772 #if ERRORS_ARE_FATAL
5773 # define zbc_program_negate(...) (zbc_program_negate(__VA_ARGS__), BC_STATUS_SUCCESS)
5776 static BC_STATUS zbc_program_logical(char inst)
5779 BcResult *opd1, *opd2, res;
5783 s = zbc_program_binOpPrep(&opd1, &n1, &opd2, &n2, false);
5784 if (s) RETURN_STATUS(s);
5786 bc_num_init_DEF_SIZE(&res.d.n);
5788 if (inst == BC_INST_BOOL_AND)
5789 cond = bc_num_cmp(n1, &G.prog.zero) && bc_num_cmp(n2, &G.prog.zero);
5790 else if (inst == BC_INST_BOOL_OR)
5791 cond = bc_num_cmp(n1, &G.prog.zero) || bc_num_cmp(n2, &G.prog.zero);
5793 cond = bc_num_cmp(n1, n2);
5795 case BC_INST_REL_EQ:
5798 case BC_INST_REL_LE:
5801 case BC_INST_REL_GE:
5804 case BC_INST_REL_LT:
5807 case BC_INST_REL_GT:
5810 default: // = case BC_INST_REL_NE:
5811 //cond = (cond != 0); - not needed
5816 if (cond) bc_num_one(&res.d.n);
5817 //else bc_num_zero(&res.d.n); - already is
5819 bc_program_binOpRetire(&res);
5823 #if ERRORS_ARE_FATAL
5824 # define zbc_program_logical(...) (zbc_program_logical(__VA_ARGS__), BC_STATUS_SUCCESS)
5828 static BC_STATUS zbc_program_assignStr(BcResult *r, BcVec *v,
5834 memset(&n2, 0, sizeof(BcNum));
5835 n2.rdx = res.d.id.idx = r->d.id.idx;
5836 res.t = BC_RESULT_STR;
5839 if (!BC_PROG_STACK(&G.prog.results, 2))
5840 RETURN_STATUS(bc_error_stack_has_too_few_elements());
5842 bc_vec_pop(&G.prog.results);
5845 bc_vec_pop(&G.prog.results);
5847 bc_vec_push(&G.prog.results, &res);
5848 bc_vec_push(v, &n2);
5850 RETURN_STATUS(BC_STATUS_SUCCESS);
5852 #if ERRORS_ARE_FATAL
5853 # define zbc_program_assignStr(...) (zbc_program_assignStr(__VA_ARGS__), BC_STATUS_SUCCESS)
5857 static BC_STATUS zbc_program_copyToVar(char *name, bool var)
5864 if (!BC_PROG_STACK(&G.prog.results, 1))
5865 RETURN_STATUS(bc_error_stack_has_too_few_elements());
5867 ptr = bc_vec_top(&G.prog.results);
5868 if ((ptr->t == BC_RESULT_ARRAY) != !var)
5869 RETURN_STATUS(bc_error_variable_is_wrong_type());
5870 v = bc_program_search(name, var);
5873 if (ptr->t == BC_RESULT_STR && !var)
5874 RETURN_STATUS(bc_error_variable_is_wrong_type());
5875 if (ptr->t == BC_RESULT_STR)
5876 RETURN_STATUS(zbc_program_assignStr(ptr, v, true));
5879 s = zbc_program_num(ptr, &n, false);
5880 if (s) RETURN_STATUS(s);
5882 // Do this once more to make sure that pointers were not invalidated.
5883 v = bc_program_search(name, var);
5886 bc_num_init_DEF_SIZE(&r.d.n);
5887 bc_num_copy(&r.d.n, n);
5890 bc_array_init(&r.d.v, true);
5891 bc_array_copy(&r.d.v, (BcVec *) n);
5894 bc_vec_push(v, &r.d);
5895 bc_vec_pop(&G.prog.results);
5899 #if ERRORS_ARE_FATAL
5900 # define zbc_program_copyToVar(...) (zbc_program_copyToVar(__VA_ARGS__), BC_STATUS_SUCCESS)
5903 static BC_STATUS zbc_program_assign(char inst)
5906 BcResult *left, *right, res;
5907 BcNum *l = NULL, *r = NULL;
5908 bool assign = inst == BC_INST_ASSIGN, ib, sc;
5910 s = zbc_program_binOpPrep(&left, &l, &right, &r, assign);
5911 if (s) RETURN_STATUS(s);
5913 ib = left->t == BC_RESULT_IBASE;
5914 sc = left->t == BC_RESULT_SCALE;
5918 if (right->t == BC_RESULT_STR) {
5922 if (left->t != BC_RESULT_VAR)
5923 RETURN_STATUS(bc_error_variable_is_wrong_type());
5924 v = bc_program_search(left->d.id.name, true);
5926 RETURN_STATUS(zbc_program_assignStr(right, v, false));
5930 if (left->t == BC_RESULT_CONSTANT || left->t == BC_RESULT_TEMP)
5931 RETURN_STATUS(bc_error("bad assignment:"
5932 " left side must be scale,"
5933 " ibase, obase, last, var,"
5938 if (inst == BC_INST_ASSIGN_DIVIDE && !bc_num_cmp(r, &G.prog.zero))
5939 RETURN_STATUS(bc_error("divide by zero"));
5944 s = BC_STATUS_SUCCESS;
5945 ERROR_RETURN(s =) zbc_program_ops[inst - BC_INST_ASSIGN_POWER](l, r, l, G.prog.scale);
5947 if (s) RETURN_STATUS(s);
5952 if (ib || sc || left->t == BC_RESULT_OBASE) {
5953 static const char *const msg[] = {
5954 "bad ibase; must be [2,16]", //BC_RESULT_IBASE
5955 "bad scale; must be [0,"BC_MAX_SCALE_STR"]", //BC_RESULT_SCALE
5956 NULL, //can't happen //BC_RESULT_LAST
5957 NULL, //can't happen //BC_RESULT_CONSTANT
5958 NULL, //can't happen //BC_RESULT_ONE
5959 "bad obase; must be [2,"BC_MAX_OBASE_STR"]", //BC_RESULT_OBASE
5962 unsigned long val, max;
5964 s = zbc_num_ulong(l, &val);
5965 if (s) RETURN_STATUS(s);
5966 s = left->t - BC_RESULT_IBASE;
5969 ptr = &G.prog.scale;
5972 if (val < BC_NUM_MIN_BASE)
5973 RETURN_STATUS(bc_error(msg[s]));
5974 max = ib ? BC_NUM_MAX_IBASE : BC_MAX_OBASE;
5975 ptr = ib ? &G.prog.ib_t : &G.prog.ob_t;
5979 RETURN_STATUS(bc_error(msg[s]));
5981 bc_num_copy(ib ? &G.prog.ib : &G.prog.ob, l);
5983 *ptr = (size_t) val;
5984 s = BC_STATUS_SUCCESS;
5987 bc_num_init(&res.d.n, l->len);
5988 bc_num_copy(&res.d.n, l);
5989 bc_program_binOpRetire(&res);
5993 #if ERRORS_ARE_FATAL
5994 # define zbc_program_assign(...) (zbc_program_assign(__VA_ARGS__), BC_STATUS_SUCCESS)
5998 #define bc_program_pushVar(code, bgn, pop, copy) \
5999 bc_program_pushVar(code, bgn)
6000 // for bc, 'pop' and 'copy' are always false
6002 static BC_STATUS bc_program_pushVar(char *code, size_t *bgn,
6003 bool pop, bool copy)
6006 char *name = bc_program_name(code, bgn);
6008 r.t = BC_RESULT_VAR;
6013 BcVec *v = bc_program_search(name, true);
6014 BcNum *num = bc_vec_top(v);
6018 if (!BC_PROG_STACK(v, 2 - copy)) {
6020 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6026 if (!BC_PROG_STR(num)) {
6028 r.t = BC_RESULT_TEMP;
6030 bc_num_init_DEF_SIZE(&r.d.n);
6031 bc_num_copy(&r.d.n, num);
6034 r.t = BC_RESULT_STR;
6035 r.d.id.idx = num->rdx;
6038 if (!copy) bc_vec_pop(v);
6043 bc_vec_push(&G.prog.results, &r);
6045 RETURN_STATUS(BC_STATUS_SUCCESS);
6047 #if ERRORS_ARE_FATAL
6048 # define zbc_program_pushVar(...) (bc_program_pushVar(__VA_ARGS__), BC_STATUS_SUCCESS)
6050 # define zbc_program_pushVar(...) bc_program_pushVar(__VA_ARGS__)
6053 static BC_STATUS zbc_program_pushArray(char *code, size_t *bgn,
6056 BcStatus s = BC_STATUS_SUCCESS;
6060 r.d.id.name = bc_program_name(code, bgn);
6062 if (inst == BC_INST_ARRAY) {
6063 r.t = BC_RESULT_ARRAY;
6064 bc_vec_push(&G.prog.results, &r);
6071 s = zbc_program_prep(&operand, &num);
6073 s = zbc_num_ulong(num, &temp);
6076 if (temp > BC_MAX_DIM) {
6077 s = bc_error("array too long; must be [1,"BC_MAX_DIM_STR"]");
6081 r.d.id.idx = (size_t) temp;
6082 bc_program_retire(&r, BC_RESULT_ARRAY_ELEM);
6086 if (s) free(r.d.id.name);
6089 #if ERRORS_ARE_FATAL
6090 # define zbc_program_pushArray(...) (zbc_program_pushArray(__VA_ARGS__), BC_STATUS_SUCCESS)
6094 static BC_STATUS zbc_program_incdec(char inst)
6097 BcResult *ptr, res, copy;
6101 s = zbc_program_prep(&ptr, &num);
6102 if (s) RETURN_STATUS(s);
6104 if (inst == BC_INST_INC_POST || inst == BC_INST_DEC_POST) {
6105 copy.t = BC_RESULT_TEMP;
6106 bc_num_init(©.d.n, num->len);
6107 bc_num_copy(©.d.n, num);
6110 res.t = BC_RESULT_ONE;
6111 inst = inst == BC_INST_INC_PRE || inst == BC_INST_INC_POST ?
6112 BC_INST_ASSIGN_PLUS :
6113 BC_INST_ASSIGN_MINUS;
6115 bc_vec_push(&G.prog.results, &res);
6116 s = zbc_program_assign(inst);
6117 if (s) RETURN_STATUS(s);
6119 if (inst2 == BC_INST_INC_POST || inst2 == BC_INST_DEC_POST) {
6120 bc_vec_pop(&G.prog.results);
6121 bc_vec_push(&G.prog.results, ©);
6126 #if ERRORS_ARE_FATAL
6127 # define zbc_program_incdec(...) (zbc_program_incdec(__VA_ARGS__), BC_STATUS_SUCCESS)
6130 static BC_STATUS zbc_program_call(char *code, size_t *idx)
6133 size_t i, nparams = bc_program_index(code, idx);
6140 ip.func = bc_program_index(code, idx);
6141 func = bc_program_func(ip.func);
6143 if (func->code.len == 0) {
6144 RETURN_STATUS(bc_error("undefined function"));
6146 if (nparams != func->nparams) {
6147 RETURN_STATUS(bc_error_fmt("function has %u parameters, but called with %u", func->nparams, nparams));
6149 ip.len = G.prog.results.len - nparams;
6151 for (i = 0; i < nparams; ++i) {
6154 a = bc_vec_item(&func->autos, nparams - 1 - i);
6155 arg = bc_vec_top(&G.prog.results);
6157 if ((!a->idx) != (arg->t == BC_RESULT_ARRAY) || arg->t == BC_RESULT_STR)
6158 RETURN_STATUS(bc_error_variable_is_wrong_type());
6160 s = zbc_program_copyToVar(a->name, a->idx);
6161 if (s) RETURN_STATUS(s);
6164 for (; i < func->autos.len; ++i) {
6167 a = bc_vec_item(&func->autos, i);
6168 v = bc_program_search(a->name, a->idx);
6171 bc_num_init_DEF_SIZE(¶m.n);
6172 bc_vec_push(v, ¶m.n);
6175 bc_array_init(¶m.v, true);
6176 bc_vec_push(v, ¶m.v);
6180 bc_vec_push(&G.prog.stack, &ip);
6182 RETURN_STATUS(BC_STATUS_SUCCESS);
6184 #if ERRORS_ARE_FATAL
6185 # define zbc_program_call(...) (zbc_program_call(__VA_ARGS__), BC_STATUS_SUCCESS)
6188 static BC_STATUS zbc_program_return(char inst)
6193 BcInstPtr *ip = bc_vec_top(&G.prog.stack);
6195 if (!BC_PROG_STACK(&G.prog.results, ip->len + inst == BC_INST_RET))
6196 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6198 f = bc_program_func(ip->func);
6199 res.t = BC_RESULT_TEMP;
6201 if (inst == BC_INST_RET) {
6204 BcResult *operand = bc_vec_top(&G.prog.results);
6206 s = zbc_program_num(operand, &num, false);
6207 if (s) RETURN_STATUS(s);
6208 bc_num_init(&res.d.n, num->len);
6209 bc_num_copy(&res.d.n, num);
6212 bc_num_init_DEF_SIZE(&res.d.n);
6213 //bc_num_zero(&res.d.n); - already is
6216 // We need to pop arguments as well, so this takes that into account.
6217 for (i = 0; i < f->autos.len; ++i) {
6219 BcId *a = bc_vec_item(&f->autos, i);
6221 v = bc_program_search(a->name, a->idx);
6225 bc_vec_npop(&G.prog.results, G.prog.results.len - ip->len);
6226 bc_vec_push(&G.prog.results, &res);
6227 bc_vec_pop(&G.prog.stack);
6229 RETURN_STATUS(BC_STATUS_SUCCESS);
6231 #if ERRORS_ARE_FATAL
6232 # define zbc_program_return(...) (zbc_program_return(__VA_ARGS__), BC_STATUS_SUCCESS)
6236 static unsigned long bc_program_scale(BcNum *n)
6238 return (unsigned long) n->rdx;
6241 static unsigned long bc_program_len(BcNum *n)
6243 size_t len = n->len;
6245 if (n->rdx != len) return len;
6247 if (len == 0) break;
6249 if (n->num[len] != 0) break;
6254 static BC_STATUS zbc_program_builtin(char inst)
6260 bool len = inst == BC_INST_LENGTH;
6262 if (!BC_PROG_STACK(&G.prog.results, 1))
6263 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6264 opnd = bc_vec_top(&G.prog.results);
6266 s = zbc_program_num(opnd, &num, false);
6267 if (s) RETURN_STATUS(s);
6270 if (!BC_PROG_NUM(opnd, num) && !len)
6271 RETURN_STATUS(bc_error_variable_is_wrong_type());
6274 bc_num_init_DEF_SIZE(&res.d.n);
6276 if (inst == BC_INST_SQRT) s = zbc_num_sqrt(num, &res.d.n, G.prog.scale);
6278 else if (len != 0 && opnd->t == BC_RESULT_ARRAY) {
6279 bc_num_ulong2num(&res.d.n, (unsigned long) ((BcVec *) num)->len);
6283 else if (len != 0 && !BC_PROG_NUM(opnd, num)) {
6285 size_t idx = opnd->t == BC_RESULT_STR ? opnd->d.id.idx : num->rdx;
6287 str = bc_program_str(idx);
6288 bc_num_ulong2num(&res.d.n, strlen(*str));
6292 bc_num_ulong2num(&res.d.n, len ? bc_program_len(num) : bc_program_scale(num));
6295 bc_program_retire(&res, BC_RESULT_TEMP);
6299 #if ERRORS_ARE_FATAL
6300 # define zbc_program_builtin(...) (zbc_program_builtin(__VA_ARGS__), BC_STATUS_SUCCESS)
6304 static BC_STATUS zbc_program_divmod(void)
6307 BcResult *opd1, *opd2, res, res2;
6308 BcNum *n1, *n2 = NULL;
6310 s = zbc_program_binOpPrep(&opd1, &n1, &opd2, &n2, false);
6311 if (s) RETURN_STATUS(s);
6313 bc_num_init_DEF_SIZE(&res.d.n);
6314 bc_num_init(&res2.d.n, n2->len);
6316 s = zbc_num_divmod(n1, n2, &res2.d.n, &res.d.n, G.prog.scale);
6319 bc_program_binOpRetire(&res2);
6320 res.t = BC_RESULT_TEMP;
6321 bc_vec_push(&G.prog.results, &res);
6326 bc_num_free(&res2.d.n);
6327 bc_num_free(&res.d.n);
6330 #if ERRORS_ARE_FATAL
6331 # define zbc_program_divmod(...) (zbc_program_divmod(__VA_ARGS__), BC_STATUS_SUCCESS)
6334 static BC_STATUS zbc_program_modexp(void)
6337 BcResult *r1, *r2, *r3, res;
6338 BcNum *n1, *n2, *n3;
6340 if (!BC_PROG_STACK(&G.prog.results, 3))
6341 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6342 s = zbc_program_binOpPrep(&r2, &n2, &r3, &n3, false);
6343 if (s) RETURN_STATUS(s);
6345 r1 = bc_vec_item_rev(&G.prog.results, 2);
6346 s = zbc_program_num(r1, &n1, false);
6347 if (s) RETURN_STATUS(s);
6348 if (!BC_PROG_NUM(r1, n1))
6349 RETURN_STATUS(bc_error_variable_is_wrong_type());
6351 // Make sure that the values have their pointers updated, if necessary.
6352 if (r1->t == BC_RESULT_VAR || r1->t == BC_RESULT_ARRAY_ELEM) {
6354 if (r1->t == r2->t) {
6355 s = zbc_program_num(r2, &n2, false);
6356 if (s) RETURN_STATUS(s);
6359 if (r1->t == r3->t) {
6360 s = zbc_program_num(r3, &n3, false);
6361 if (s) RETURN_STATUS(s);
6365 bc_num_init(&res.d.n, n3->len);
6366 s = zbc_num_modexp(n1, n2, n3, &res.d.n);
6369 bc_vec_pop(&G.prog.results);
6370 bc_program_binOpRetire(&res);
6375 bc_num_free(&res.d.n);
6378 #if ERRORS_ARE_FATAL
6379 # define zbc_program_modexp(...) (zbc_program_modexp(__VA_ARGS__), BC_STATUS_SUCCESS)
6382 static void bc_program_stackLen(void)
6385 size_t len = G.prog.results.len;
6387 res.t = BC_RESULT_TEMP;
6389 bc_num_init_DEF_SIZE(&res.d.n);
6390 bc_num_ulong2num(&res.d.n, len);
6391 bc_vec_push(&G.prog.results, &res);
6394 static BC_STATUS zbc_program_asciify(void)
6399 char *str, *str2, c;
6400 size_t len = G.prog.strs.len, idx;
6403 if (!BC_PROG_STACK(&G.prog.results, 1))
6404 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6405 r = bc_vec_top(&G.prog.results);
6407 num = NULL; // TODO: is this NULL needed?
6408 s = zbc_program_num(r, &num, false);
6409 if (s) RETURN_STATUS(s);
6411 if (BC_PROG_NUM(r, num)) {
6413 bc_num_init_DEF_SIZE(&n);
6414 bc_num_copy(&n, num);
6415 bc_num_truncate(&n, n.rdx);
6417 s = zbc_num_mod(&n, &G.prog.strmb, &n, 0);
6418 if (s) goto num_err;
6419 s = zbc_num_ulong(&n, &val);
6420 if (s) goto num_err;
6427 idx = (r->t == BC_RESULT_STR) ? r->d.id.idx : num->rdx;
6428 str2 = *bc_program_str(idx);
6434 //str[1] = '\0'; - already is
6436 str2 = xstrdup(str);
6437 bc_program_addFunc(str2, &idx);
6439 if (idx != len + BC_PROG_REQ_FUNCS) {
6440 for (idx = 0; idx < G.prog.strs.len; ++idx) {
6441 if (strcmp(*bc_program_str(idx), str) == 0) {
6450 bc_vec_push(&G.prog.strs, &str);
6452 res.t = BC_RESULT_STR;
6454 bc_vec_pop(&G.prog.results);
6455 bc_vec_push(&G.prog.results, &res);
6457 RETURN_STATUS(BC_STATUS_SUCCESS);
6463 #if ERRORS_ARE_FATAL
6464 # define zbc_program_asciify(...) (zbc_program_asciify(__VA_ARGS__), BC_STATUS_SUCCESS)
6467 static BC_STATUS zbc_program_printStream(void)
6475 if (!BC_PROG_STACK(&G.prog.results, 1))
6476 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6477 r = bc_vec_top(&G.prog.results);
6479 s = zbc_program_num(r, &n, false);
6480 if (s) RETURN_STATUS(s);
6482 if (BC_PROG_NUM(r, n))
6483 s = zbc_num_stream(n, &G.prog.strmb);
6485 idx = (r->t == BC_RESULT_STR) ? r->d.id.idx : n->rdx;
6486 str = *bc_program_str(idx);
6492 #if ERRORS_ARE_FATAL
6493 # define zbc_program_printStream(...) (zbc_program_printStream(__VA_ARGS__), BC_STATUS_SUCCESS)
6496 static BC_STATUS zbc_program_nquit(void)
6503 s = zbc_program_prep(&opnd, &num);
6504 if (s) RETURN_STATUS(s);
6505 s = zbc_num_ulong(num, &val);
6506 if (s) RETURN_STATUS(s);
6508 bc_vec_pop(&G.prog.results);
6510 if (G.prog.stack.len < val)
6511 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6512 if (G.prog.stack.len == val) {
6513 QUIT_OR_RETURN_TO_MAIN;
6516 bc_vec_npop(&G.prog.stack, val);
6520 #if ERRORS_ARE_FATAL
6521 # define zbc_program_nquit(...) (zbc_program_nquit(__VA_ARGS__), BC_STATUS_SUCCESS)
6524 static BC_STATUS zbc_program_execStr(char *code, size_t *bgn,
6527 BcStatus s = BC_STATUS_SUCCESS;
6535 if (!BC_PROG_STACK(&G.prog.results, 1))
6536 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6538 r = bc_vec_top(&G.prog.results);
6541 BcNum *n = n; // for compiler
6544 char *then_name = bc_program_name(code, bgn);
6545 char *else_name = NULL;
6547 if (code[*bgn] == BC_PARSE_STREND)
6550 else_name = bc_program_name(code, bgn);
6552 exec = r->d.n.len != 0;
6554 if (!exec && else_name != NULL) {
6561 v = bc_program_search(name, true);
6568 if (!exec) goto exit;
6569 if (!BC_PROG_STR(n)) {
6570 s = bc_error_variable_is_wrong_type();
6576 if (r->t == BC_RESULT_STR) {
6578 } else if (r->t == BC_RESULT_VAR) {
6580 s = zbc_program_num(r, &n, false);
6581 if (s || !BC_PROG_STR(n)) goto exit;
6587 fidx = sidx + BC_PROG_REQ_FUNCS;
6589 str = bc_program_str(sidx);
6590 f = bc_program_func(fidx);
6592 if (f->code.len == 0) {
6593 bc_parse_create(&prs, fidx);
6594 s = zbc_parse_text(&prs, *str);
6596 s = zcommon_parse_expr(&prs, BC_PARSE_NOCALL);
6599 if (prs.l.t.t != BC_LEX_EOF) {
6600 s = bc_error_bad_expression();
6604 bc_parse_free(&prs);
6608 ip.len = G.prog.results.len;
6611 bc_vec_pop(&G.prog.results);
6612 bc_vec_push(&G.prog.stack, &ip);
6614 RETURN_STATUS(BC_STATUS_SUCCESS);
6617 bc_parse_free(&prs);
6618 f = bc_program_func(fidx);
6619 bc_vec_pop_all(&f->code);
6621 bc_vec_pop(&G.prog.results);
6624 #if ERRORS_ARE_FATAL
6625 # define zbc_program_execStr(...) (zbc_program_execStr(__VA_ARGS__), BC_STATUS_SUCCESS)
6629 static void bc_program_pushGlobal(char inst)
6634 res.t = inst - BC_INST_IBASE + BC_RESULT_IBASE;
6635 if (inst == BC_INST_IBASE)
6636 val = (unsigned long) G.prog.ib_t;
6637 else if (inst == BC_INST_SCALE)
6638 val = (unsigned long) G.prog.scale;
6640 val = (unsigned long) G.prog.ob_t;
6642 bc_num_init_DEF_SIZE(&res.d.n);
6643 bc_num_ulong2num(&res.d.n, val);
6644 bc_vec_push(&G.prog.results, &res);
6647 static void bc_program_addFunc(char *name, size_t *idx)
6649 BcId entry, *entry_ptr;
6654 entry.idx = G.prog.fns.len;
6656 inserted = bc_map_insert(&G.prog.fn_map, &entry, idx);
6657 if (!inserted) free(name);
6659 entry_ptr = bc_vec_item(&G.prog.fn_map, *idx);
6660 *idx = entry_ptr->idx;
6664 BcFunc *func = bc_program_func(entry_ptr->idx);
6666 // We need to reset these, so the function can be repopulated.
6668 bc_vec_pop_all(&func->autos);
6669 bc_vec_pop_all(&func->code);
6670 bc_vec_pop_all(&func->labels);
6674 bc_vec_push(&G.prog.fns, &f);
6678 static BC_STATUS zbc_program_exec(void)
6682 BcInstPtr *ip = bc_vec_top(&G.prog.stack);
6683 BcFunc *func = bc_program_func(ip->func);
6684 char *code = func->code.v;
6687 while (ip->idx < func->code.len) {
6688 BcStatus s = BC_STATUS_SUCCESS;
6689 char inst = code[(ip->idx)++];
6693 case BC_INST_JUMP_ZERO:
6694 s = zbc_program_prep(&ptr, &num);
6695 if (s) RETURN_STATUS(s);
6696 cond = !bc_num_cmp(num, &G.prog.zero);
6697 bc_vec_pop(&G.prog.results);
6699 case BC_INST_JUMP: {
6701 size_t idx = bc_program_index(code, &ip->idx);
6702 addr = bc_vec_item(&func->labels, idx);
6703 if (inst == BC_INST_JUMP || cond) ip->idx = *addr;
6707 s = zbc_program_call(code, &ip->idx);
6709 case BC_INST_INC_PRE:
6710 case BC_INST_DEC_PRE:
6711 case BC_INST_INC_POST:
6712 case BC_INST_DEC_POST:
6713 s = zbc_program_incdec(inst);
6716 QUIT_OR_RETURN_TO_MAIN;
6720 s = zbc_program_return(inst);
6722 case BC_INST_BOOL_OR:
6723 case BC_INST_BOOL_AND:
6725 case BC_INST_REL_EQ:
6726 case BC_INST_REL_LE:
6727 case BC_INST_REL_GE:
6728 case BC_INST_REL_NE:
6729 case BC_INST_REL_LT:
6730 case BC_INST_REL_GT:
6731 s = zbc_program_logical(inst);
6734 s = zbc_program_read();
6737 s = zbc_program_pushVar(code, &ip->idx, false, false);
6739 case BC_INST_ARRAY_ELEM:
6741 s = zbc_program_pushArray(code, &ip->idx, inst);
6744 r.t = BC_RESULT_LAST;
6745 bc_vec_push(&G.prog.results, &r);
6750 bc_program_pushGlobal(inst);
6752 case BC_INST_SCALE_FUNC:
6753 case BC_INST_LENGTH:
6755 s = zbc_program_builtin(inst);
6758 r.t = BC_RESULT_CONSTANT;
6759 r.d.id.idx = bc_program_index(code, &ip->idx);
6760 bc_vec_push(&G.prog.results, &r);
6763 if (!BC_PROG_STACK(&G.prog.results, 1))
6764 s = bc_error_stack_has_too_few_elements();
6766 bc_vec_pop(&G.prog.results);
6768 case BC_INST_POP_EXEC:
6769 bc_vec_pop(&G.prog.stack);
6772 case BC_INST_PRINT_POP:
6773 case BC_INST_PRINT_STR:
6774 s = zbc_program_print(inst, 0);
6777 r.t = BC_RESULT_STR;
6778 r.d.id.idx = bc_program_index(code, &ip->idx);
6779 bc_vec_push(&G.prog.results, &r);
6782 case BC_INST_MULTIPLY:
6783 case BC_INST_DIVIDE:
6784 case BC_INST_MODULUS:
6787 s = zbc_program_op(inst);
6789 case BC_INST_BOOL_NOT:
6790 s = zbc_program_prep(&ptr, &num);
6791 if (s) RETURN_STATUS(s);
6792 bc_num_init_DEF_SIZE(&r.d.n);
6793 if (!bc_num_cmp(num, &G.prog.zero))
6795 //else bc_num_zero(&r.d.n); - already is
6796 bc_program_retire(&r, BC_RESULT_TEMP);
6799 s = zbc_program_negate();
6802 case BC_INST_ASSIGN_POWER:
6803 case BC_INST_ASSIGN_MULTIPLY:
6804 case BC_INST_ASSIGN_DIVIDE:
6805 case BC_INST_ASSIGN_MODULUS:
6806 case BC_INST_ASSIGN_PLUS:
6807 case BC_INST_ASSIGN_MINUS:
6809 case BC_INST_ASSIGN:
6810 s = zbc_program_assign(inst);
6813 case BC_INST_MODEXP:
6814 s = zbc_program_modexp();
6816 case BC_INST_DIVMOD:
6817 s = zbc_program_divmod();
6819 case BC_INST_EXECUTE:
6820 case BC_INST_EXEC_COND:
6821 cond = inst == BC_INST_EXEC_COND;
6822 s = zbc_program_execStr(code, &ip->idx, cond);
6824 case BC_INST_PRINT_STACK: {
6826 for (idx = 0; idx < G.prog.results.len; ++idx) {
6827 s = zbc_program_print(BC_INST_PRINT, idx);
6832 case BC_INST_CLEAR_STACK:
6833 bc_vec_pop_all(&G.prog.results);
6835 case BC_INST_STACK_LEN:
6836 bc_program_stackLen();
6838 case BC_INST_DUPLICATE:
6839 if (!BC_PROG_STACK(&G.prog.results, 1))
6840 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6841 ptr = bc_vec_top(&G.prog.results);
6842 bc_result_copy(&r, ptr);
6843 bc_vec_push(&G.prog.results, &r);
6845 case BC_INST_SWAP: {
6847 if (!BC_PROG_STACK(&G.prog.results, 2))
6848 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6849 ptr = bc_vec_item_rev(&G.prog.results, 0);
6850 ptr2 = bc_vec_item_rev(&G.prog.results, 1);
6851 memcpy(&r, ptr, sizeof(BcResult));
6852 memcpy(ptr, ptr2, sizeof(BcResult));
6853 memcpy(ptr2, &r, sizeof(BcResult));
6856 case BC_INST_ASCIIFY:
6857 s = zbc_program_asciify();
6859 case BC_INST_PRINT_STREAM:
6860 s = zbc_program_printStream();
6863 case BC_INST_PUSH_VAR: {
6864 bool copy = inst == BC_INST_LOAD;
6865 s = zbc_program_pushVar(code, &ip->idx, true, copy);
6868 case BC_INST_PUSH_TO_VAR: {
6869 char *name = bc_program_name(code, &ip->idx);
6870 s = zbc_program_copyToVar(name, true);
6875 if (G.prog.stack.len <= 2)
6876 QUIT_OR_RETURN_TO_MAIN;
6877 bc_vec_npop(&G.prog.stack, 2);
6880 s = zbc_program_nquit();
6885 if (s || G_interrupt) {
6890 // If the stack has changed, pointers may be invalid.
6891 ip = bc_vec_top(&G.prog.stack);
6892 func = bc_program_func(ip->func);
6893 code = func->code.v;
6896 RETURN_STATUS(BC_STATUS_SUCCESS);
6898 #if ERRORS_ARE_FATAL
6899 # define zbc_program_exec(...) (zbc_program_exec(__VA_ARGS__), BC_STATUS_SUCCESS)
6902 static unsigned bc_vm_envLen(const char *var)
6908 len = BC_NUM_PRINT_WIDTH;
6909 if (!lenv) return len;
6911 len = bb_strtou(lenv, NULL, 10) - 1;
6912 if (errno || len < 2 || len >= INT_MAX)
6913 len = BC_NUM_PRINT_WIDTH;
6918 static BC_STATUS zbc_vm_process(const char *text)
6920 BcStatus s = zbc_parse_text(&G.prs, text);
6922 if (s) RETURN_STATUS(s);
6924 while (G.prs.l.t.t != BC_LEX_EOF) {
6925 ERROR_RETURN(s =) zcommon_parse(&G.prs);
6926 if (s) RETURN_STATUS(s);
6929 if (BC_PARSE_CAN_EXEC(&G.prs)) {
6930 s = zbc_program_exec();
6938 #if ERRORS_ARE_FATAL
6939 # define zbc_vm_process(...) (zbc_vm_process(__VA_ARGS__), BC_STATUS_SUCCESS)
6942 static BC_STATUS zbc_vm_file(const char *file)
6944 // So far bc/dc have no way to include a file from another file,
6945 // therefore we know G.prog.file == NULL on entry
6946 //const char *sv_file;
6952 data = bc_read_file(file);
6953 if (!data) RETURN_STATUS(bc_error_fmt("file '%s' is not text", file));
6955 //sv_file = G.prog.file;
6957 bc_lex_file(&G.prs.l);
6958 s = zbc_vm_process(data);
6961 main_func = bc_program_func(BC_PROG_MAIN);
6962 ip = bc_vec_item(&G.prog.stack, 0);
6964 if (main_func->code.len < ip->idx)
6965 s = bc_error_fmt("file '%s' is not executable", file);
6968 //G.prog.file = sv_file;
6973 #if ERRORS_ARE_FATAL
6974 # define zbc_vm_file(...) (zbc_vm_file(__VA_ARGS__), BC_STATUS_SUCCESS)
6977 static BC_STATUS zbc_vm_stdin(void)
6984 //G.prog.file = NULL; - already is
6985 bc_lex_file(&G.prs.l);
6987 bc_char_vec_init(&buffer);
6989 // This loop is complex because the vm tries not to send any lines that end
6990 // with a backslash to the parser. The reason for that is because the parser
6991 // treats a backslash+newline combo as whitespace, per the bc spec. In that
6992 // case, and for strings and comments, the parser will expect more stuff.
6993 s = BC_STATUS_SUCCESS;
6997 size_t prevlen = buffer.len;
7000 bc_read_line(&buffer);
7001 // No more input means EOF
7002 if (buffer.len <= prevlen + 1) // (we expect +1 for NUL byte)
7005 string = buffer.v + prevlen;
7008 if (string == buffer.v || string[-1] != '\\') {
7019 if (c == '/' && *string == '*') {
7024 if (c == '*' && *string == '/') {
7029 if (str || comment) {
7030 buffer.len--; // backstep over the trailing NUL byte
7034 // Check for backslash+newline.
7035 // we do not check that last char is '\n' -
7036 // if it is not, then it's EOF, and looping back
7037 // to bc_read_line() will detect it:
7039 if (string >= buffer.v && *string == '\\') {
7044 s = zbc_vm_process(buffer.v);
7046 if (ENABLE_FEATURE_CLEAN_UP && !G_ttyin) {
7047 // Debug config, non-interactive mode:
7048 // return all the way back to main.
7049 // Non-debug builds do not come here, they exit.
7054 bc_vec_pop_all(&buffer);
7058 s = bc_error("string end could not be found");
7061 s = bc_error("comment end could not be found");
7064 bc_vec_free(&buffer);
7067 #if ERRORS_ARE_FATAL
7068 # define zbc_vm_stdin(...) (zbc_vm_stdin(__VA_ARGS__), BC_STATUS_SUCCESS)
7072 static void bc_vm_info(void)
7074 printf("%s "BB_VER"\n"
7075 "Copyright (c) 2018 Gavin D. Howard and contributors\n"
7079 static void bc_args(char **argv)
7085 #if ENABLE_FEATURE_BC_LONG_OPTIONS
7086 opts = option_mask32 |= getopt32long(argv, "wvsqli",
7087 "warn\0" No_argument "w"
7088 "version\0" No_argument "v"
7089 "standard\0" No_argument "s"
7090 "quiet\0" No_argument "q"
7091 "mathlib\0" No_argument "l"
7092 "interactive\0" No_argument "i"
7095 opts = option_mask32 |= getopt32(argv, "wvsqli");
7097 if (getenv("POSIXLY_CORRECT"))
7098 option_mask32 |= BC_FLAG_S;
7100 if (opts & BC_FLAG_V) {
7105 for (i = optind; argv[i]; ++i)
7106 bc_vec_push(&G.files, argv + i);
7109 static void bc_vm_envArgs(void)
7113 char *env_args = getenv("BC_ENV_ARGS");
7115 if (!env_args) return;
7117 G.env_args = xstrdup(env_args);
7120 bc_vec_init(&v, sizeof(char *), NULL);
7122 while (*(buf = skip_whitespace(buf)) != '\0') {
7123 bc_vec_push(&v, &buf);
7124 buf = skip_non_whitespace(buf);
7130 // NULL terminate, and pass argv[] so that first arg is argv[1]
7131 if (sizeof(int) == sizeof(char*)) {
7132 bc_vec_push(&v, &const_int_0);
7134 static char *const nullptr = NULL;
7135 bc_vec_push(&v, &nullptr);
7137 bc_args(((char **)v.v) - 1);
7142 static const char bc_lib[] ALIGN1 = {
7145 "\n" "auto b,s,n,r,d,i,p,f,v"
7154 "\n" "scale=scale(x)+1"
7164 "\n" "for(i=2;v;++i){"
7170 "\n" "while(d--)r*=r"
7173 "\n" "if(n)return(1/r)"
7177 "\n" "auto b,s,r,p,a,q,i,v"
7181 "\n" "r=(1-10^scale)/1"
7192 "\n" "while(x<=0.5){"
7196 "\n" "r=a=(x-1)/(x+1)"
7199 "\n" "for(i=3;v;i+=2){"
7210 "\n" "auto b,s,r,n,a,q,i"
7214 "\n" "scale=1.1*s+2"
7227 "\n" "for(i=3;a;i+=2){"
7228 "\n" "a*=q/(i*(i-1))"
7233 "\n" "if(n)return(-r/1)"
7242 "\n" "x=s(2*a(1)+x)"
7248 "\n" "auto b,s,r,n,a,m,t,f,i,u"
7256 "\n" "if(scale<65){"
7257 "\n" "if(x==1)return(.7853981633974483096156608458198757210492923498437764552437361480/n)"
7258 "\n" "if(x==.2)return(.1973955598498807583700497651947902934475851037878521015176889402/n)"
7268 "\n" "x=(x-.2)/(1+.2*x)"
7273 "\n" "for(i=3;t;i+=2){"
7280 "\n" "return((m*a+r)/n)"
7282 "\n" "define j(n,x){"
7283 "\n" "auto b,s,o,a,i,v,f"
7291 "\n" "if(n%2==1)o=1"
7294 "\n" "for(i=2;i<=n;++i)a*=i"
7296 "\n" "a=(x^n)/2^n/a"
7299 "\n" "scale=scale+length(a)-scale(a)"
7300 "\n" "for(i=1;v;++i){"
7301 "\n" "v=v*f/i/(n+i)"
7307 "\n" "return(a*r/1)"
7312 static BC_STATUS zbc_vm_exec(void)
7318 if (option_mask32 & BC_FLAG_L) {
7320 // We know that internal library is not buggy,
7321 // thus error checking is normally disabled.
7322 # define DEBUG_LIB 0
7323 bc_lex_file(&G.prs.l);
7324 s = zbc_parse_text(&G.prs, bc_lib);
7325 if (DEBUG_LIB && s) RETURN_STATUS(s);
7327 while (G.prs.l.t.t != BC_LEX_EOF) {
7328 ERROR_RETURN(s =) zcommon_parse(&G.prs);
7329 if (DEBUG_LIB && s) RETURN_STATUS(s);
7331 s = zbc_program_exec();
7332 if (DEBUG_LIB && s) RETURN_STATUS(s);
7336 s = BC_STATUS_SUCCESS;
7337 for (i = 0; !s && i < G.files.len; ++i)
7338 s = zbc_vm_file(*((char **) bc_vec_item(&G.files, i)));
7339 if (ENABLE_FEATURE_CLEAN_UP && s && !G_ttyin) {
7340 // Debug config, non-interactive mode:
7341 // return all the way back to main.
7342 // Non-debug builds do not come here, they exit.
7346 if (IS_BC || (option_mask32 & BC_FLAG_I))
7349 if (!s && !BC_PARSE_CAN_EXEC(&G.prs))
7350 s = zbc_vm_process("");
7354 #if ERRORS_ARE_FATAL
7355 # define zbc_vm_exec(...) (zbc_vm_exec(__VA_ARGS__), BC_STATUS_SUCCESS)
7358 #if ENABLE_FEATURE_CLEAN_UP
7359 static void bc_program_free(void)
7361 bc_num_free(&G.prog.ib);
7362 bc_num_free(&G.prog.ob);
7363 bc_num_free(&G.prog.hexb);
7365 bc_num_free(&G.prog.strmb);
7367 bc_vec_free(&G.prog.fns);
7368 bc_vec_free(&G.prog.fn_map);
7369 bc_vec_free(&G.prog.vars);
7370 bc_vec_free(&G.prog.var_map);
7371 bc_vec_free(&G.prog.arrs);
7372 bc_vec_free(&G.prog.arr_map);
7373 bc_vec_free(&G.prog.strs);
7374 bc_vec_free(&G.prog.consts);
7375 bc_vec_free(&G.prog.results);
7376 bc_vec_free(&G.prog.stack);
7377 bc_num_free(&G.prog.last);
7378 bc_num_free(&G.prog.zero);
7379 bc_num_free(&G.prog.one);
7382 static void bc_vm_free(void)
7384 bc_vec_free(&G.files);
7386 bc_parse_free(&G.prs);
7391 static void bc_program_init(void)
7396 /* memset(&G.prog, 0, sizeof(G.prog)); - already is */
7397 memset(&ip, 0, sizeof(BcInstPtr));
7399 /* G.prog.nchars = G.prog.scale = 0; - already is */
7400 bc_num_init_DEF_SIZE(&G.prog.ib);
7401 bc_num_ten(&G.prog.ib);
7404 bc_num_init_DEF_SIZE(&G.prog.ob);
7405 bc_num_ten(&G.prog.ob);
7408 bc_num_init_DEF_SIZE(&G.prog.hexb);
7409 bc_num_ten(&G.prog.hexb);
7410 G.prog.hexb.num[0] = 6;
7413 bc_num_init_DEF_SIZE(&G.prog.strmb);
7414 bc_num_ulong2num(&G.prog.strmb, UCHAR_MAX + 1);
7417 bc_num_init_DEF_SIZE(&G.prog.last);
7418 //bc_num_zero(&G.prog.last); - already is
7420 bc_num_init_DEF_SIZE(&G.prog.zero);
7421 //bc_num_zero(&G.prog.zero); - already is
7423 bc_num_init_DEF_SIZE(&G.prog.one);
7424 bc_num_one(&G.prog.one);
7426 bc_vec_init(&G.prog.fns, sizeof(BcFunc), bc_func_free);
7427 bc_vec_init(&G.prog.fn_map, sizeof(BcId), bc_id_free);
7429 bc_program_addFunc(xstrdup("(main)"), &idx);
7430 bc_program_addFunc(xstrdup("(read)"), &idx);
7432 bc_vec_init(&G.prog.vars, sizeof(BcVec), bc_vec_free);
7433 bc_vec_init(&G.prog.var_map, sizeof(BcId), bc_id_free);
7435 bc_vec_init(&G.prog.arrs, sizeof(BcVec), bc_vec_free);
7436 bc_vec_init(&G.prog.arr_map, sizeof(BcId), bc_id_free);
7438 bc_vec_init(&G.prog.strs, sizeof(char *), bc_string_free);
7439 bc_vec_init(&G.prog.consts, sizeof(char *), bc_string_free);
7440 bc_vec_init(&G.prog.results, sizeof(BcResult), bc_result_free);
7441 bc_vec_init(&G.prog.stack, sizeof(BcInstPtr), NULL);
7442 bc_vec_push(&G.prog.stack, &ip);
7445 static int bc_vm_init(const char *env_len)
7447 #if ENABLE_FEATURE_EDITING
7448 G.line_input_state = new_line_input_t(DO_HISTORY);
7450 G.prog.len = bc_vm_envLen(env_len);
7452 bc_vec_init(&G.files, sizeof(char *), NULL);
7453 IF_BC(if (IS_BC) bc_vm_envArgs();)
7455 bc_parse_create(&G.prs, BC_PROG_MAIN);
7457 //TODO: in GNU bc, the check is (isatty(0) && isatty(1)),
7458 //-i option unconditionally enables this regardless of isatty():
7460 #if ENABLE_FEATURE_BC_SIGNALS
7462 // With SA_RESTART, most system calls will restart
7463 // (IOW: they won't fail with EINTR).
7464 // In particular, this means ^C won't cause
7465 // stdout to get into "error state" if SIGINT hits
7466 // within write() syscall.
7468 // The downside is that ^C while tty input is taken
7469 // will only be handled after [Enter] since read()
7470 // from stdin is not interrupted by ^C either,
7471 // it restarts, thus fgetc() does not return on ^C.
7472 // (This problem manifests only if line editing is disabled)
7473 signal_SA_RESTART_empty_mask(SIGINT, record_signo);
7475 // Without SA_RESTART, this exhibits a bug:
7476 // "while (1) print 1" and try ^C-ing it.
7477 // Intermittently, instead of returning to input line,
7478 // you'll get "output error: Interrupted system call"
7480 //signal_no_SA_RESTART_empty_mask(SIGINT, record_signo);
7484 return 0; // "not a tty"
7487 static BcStatus bc_vm_run(void)
7489 BcStatus st = zbc_vm_exec();
7490 #if ENABLE_FEATURE_CLEAN_UP
7491 if (G_exiting) // it was actually "halt" or "quit"
7494 # if ENABLE_FEATURE_EDITING
7495 free_line_input_t(G.line_input_state);
7503 int bc_main(int argc, char **argv) MAIN_EXTERNALLY_VISIBLE;
7504 int bc_main(int argc UNUSED_PARAM, char **argv)
7510 is_tty = bc_vm_init("BC_LINE_LENGTH");
7514 if (is_tty && !(option_mask32 & BC_FLAG_Q))
7522 int dc_main(int argc, char **argv) MAIN_EXTERNALLY_VISIBLE;
7523 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