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: "[-sqlw] FILE..."
115 //usage:#define bc_full_usage "\n"
116 //usage: "\nArbitrary precision calculator"
118 ///////: "\n -i Interactive" - has no effect for now
119 //usage: "\n -q Quiet"
120 //usage: "\n -l Load standard math library"
121 //usage: "\n -s Be POSIX compatible"
122 //usage: "\n -w Warn if extensions are used"
123 ///////: "\n -v Version"
125 //usage: "\n$BC_LINE_LENGTH changes output width"
127 //usage:#define bc_example_usage
128 //usage: "3 + 4.129\n"
129 //usage: "1903 - 2893\n"
130 //usage: "-129 * 213.28935\n"
131 //usage: "12 / -1932\n"
133 //usage: "34 ^ 189\n"
134 //usage: "scale = 13\n"
135 //usage: "ibase = 2\n"
136 //usage: "obase = A\n"
138 //usage:#define dc_trivial_usage
139 //usage: IF_NOT_FEATURE_DC_SMALL("[-x] ")"[-eSCRIPT]... [-fFILE]... [FILE]..."
141 //usage:#define dc_full_usage "\n"
142 //usage: "\nTiny RPN calculator. Operations:"
143 //usage: "\n+, -, *, /, %, ~, ^," IF_NOT_FEATURE_DC_SMALL(" |,")
144 //usage: "\np - print top of the stack (without popping)"
145 //usage: "\nf - print entire stack"
146 //usage: "\nk - pop the value and set the precision"
147 //usage: "\ni - pop the value and set input radix"
148 //usage: "\no - pop the value and set output radix"
149 //usage: "\nExamples: dc -e'2 2 + p' -> 4, dc -e'8 8 * 2 2 + / p' -> 16"
151 //usage:#define dc_example_usage
152 //usage: "$ dc -e'2 2 + p'\n"
154 //usage: "$ dc -e'8 8 \\* 2 2 + / p'\n"
156 //usage: "$ dc -e'0 1 & p'\n"
158 //usage: "$ dc -e'0 1 | p'\n"
160 //usage: "$ echo '72 9 / 8 * p' | dc\n"
164 #include "common_bufsiz.h"
166 #if ENABLE_FEATURE_DC_SMALL
170 #define DEBUG_LEXER 0
171 #define DEBUG_COMPILE 0
175 static uint8_t lex_indent;
176 #define dbg_lex(...) \
178 fprintf(stderr, "%*s", lex_indent, ""); \
179 bb_error_msg(__VA_ARGS__); \
181 #define dbg_lex_enter(...) \
183 dbg_lex(__VA_ARGS__); \
186 #define dbg_lex_done(...) \
189 dbg_lex(__VA_ARGS__); \
192 # define dbg_lex(...) ((void)0)
193 # define dbg_lex_enter(...) ((void)0)
194 # define dbg_lex_done(...) ((void)0)
198 # define dbg_compile(...) bb_error_msg(__VA_ARGS__)
200 # define dbg_compile(...) ((void)0)
204 # define dbg_exec(...) bb_error_msg(__VA_ARGS__)
206 # define dbg_exec(...) ((void)0)
209 typedef enum BcStatus {
210 BC_STATUS_SUCCESS = 0,
211 BC_STATUS_FAILURE = 1,
212 BC_STATUS_PARSE_EMPTY_EXP = 2, // bc_parse_expr_empty_ok() uses this
215 #define BC_VEC_INVALID_IDX ((size_t) -1)
216 #define BC_VEC_START_CAP (1 << 5)
218 typedef void (*BcVecFree)(void *) FAST_FUNC;
220 typedef struct BcVec {
228 typedef signed char BcDig;
230 typedef struct BcNum {
238 #define BC_NUM_MAX_IBASE ((unsigned long) 16)
239 // larger value might speed up BIGNUM calculations a bit:
240 #define BC_NUM_DEF_SIZE (16)
241 #define BC_NUM_PRINT_WIDTH (69)
243 #define BC_NUM_KARATSUBA_LEN (32)
245 typedef enum BcInst {
274 BC_INST_ASSIGN_POWER,
275 BC_INST_ASSIGN_MULTIPLY,
276 BC_INST_ASSIGN_DIVIDE,
277 BC_INST_ASSIGN_MODULUS,
279 BC_INST_ASSIGN_MINUS,
325 BC_INST_PRINT_STREAM,
340 BC_INST_INVALID = -1,
344 typedef struct BcId {
349 typedef struct BcFunc {
356 typedef enum BcResultType {
360 BC_RESULT_ARRAY_ELEM,
369 // These are between to calculate ibase, obase, and last from instructions.
376 typedef union BcResultData {
382 typedef struct BcResult {
387 typedef struct BcInstPtr {
393 // BC_LEX_NEG is not used in lexing; it is only for parsing.
394 typedef enum BcLexType {
421 BC_LEX_OP_ASSIGN_POWER,
422 BC_LEX_OP_ASSIGN_MULTIPLY,
423 BC_LEX_OP_ASSIGN_DIVIDE,
424 BC_LEX_OP_ASSIGN_MODULUS,
425 BC_LEX_OP_ASSIGN_PLUS,
426 BC_LEX_OP_ASSIGN_MINUS,
439 BC_LEX_LBRACE, // '{' is 0x7B, '}' is 0x7D,
441 BC_LEX_RBRACE, // should be LBRACE+2: code uses (c - '{' + BC_LEX_LBRACE)
447 BC_LEX_KEY_1st_keyword,
448 BC_LEX_KEY_AUTO = BC_LEX_KEY_1st_keyword,
455 // code uses "type - BC_LEX_KEY_IBASE + BC_INST_IBASE" construct,
456 BC_LEX_KEY_IBASE, // relative order should match for: BC_INST_IBASE
458 BC_LEX_KEY_LAST, // relative order should match for: BC_INST_LAST
461 BC_LEX_KEY_OBASE, // relative order should match for: BC_INST_OBASE
499 // must match order of BC_LEX_KEY_foo etc above
501 struct BcLexKeyword {
504 #define BC_LEX_KW_ENTRY(a, b) \
505 { .name8 = a /*, .posix = b */ }
506 static const struct BcLexKeyword bc_lex_kws[20] = {
507 BC_LEX_KW_ENTRY("auto" , 1), // 0
508 BC_LEX_KW_ENTRY("break" , 1), // 1
509 BC_LEX_KW_ENTRY("continue", 0), // 2 note: this one has no terminating NUL
510 BC_LEX_KW_ENTRY("define" , 1), // 3
511 BC_LEX_KW_ENTRY("else" , 0), // 4
512 BC_LEX_KW_ENTRY("for" , 1), // 5
513 BC_LEX_KW_ENTRY("halt" , 0), // 6
514 BC_LEX_KW_ENTRY("ibase" , 1), // 7
515 BC_LEX_KW_ENTRY("if" , 1), // 8
516 BC_LEX_KW_ENTRY("last" , 0), // 9
517 BC_LEX_KW_ENTRY("length" , 1), // 10
518 BC_LEX_KW_ENTRY("limits" , 0), // 11
519 BC_LEX_KW_ENTRY("obase" , 1), // 12
520 BC_LEX_KW_ENTRY("print" , 0), // 13
521 BC_LEX_KW_ENTRY("quit" , 1), // 14
522 BC_LEX_KW_ENTRY("read" , 0), // 15
523 BC_LEX_KW_ENTRY("return" , 1), // 16
524 BC_LEX_KW_ENTRY("scale" , 1), // 17
525 BC_LEX_KW_ENTRY("sqrt" , 1), // 18
526 BC_LEX_KW_ENTRY("while" , 1), // 19
528 #undef BC_LEX_KW_ENTRY
529 #define STRING_if (bc_lex_kws[8].name8)
530 #define STRING_else (bc_lex_kws[4].name8)
531 #define STRING_while (bc_lex_kws[19].name8)
532 #define STRING_for (bc_lex_kws[5].name8)
556 #define bc_lex_kws_POSIX(i) ((1 << (i)) & POSIX_KWORD_MASK)
558 // This is a bit array that corresponds to token types. An entry is
559 // true if the token is valid in an expression, false otherwise.
560 // Used to figure out when expr parsing should stop *without error message*
561 // - 0 element indicates this condition. 1 means "this token is to be eaten
562 // as part of the expression", token can them still be determined to be invalid
563 // by later processing.
565 #define EXBITS(a,b,c,d,e,f,g,h) \
566 ((uint64_t)((a << 0)+(b << 1)+(c << 2)+(d << 3)+(e << 4)+(f << 5)+(g << 6)+(h << 7)))
567 BC_PARSE_EXPRS_BITS = 0
568 + (EXBITS(0,0,1,1,1,1,1,1) << (0*8)) // 0: eof inval ++ -- - ^ * /
569 + (EXBITS(1,1,1,1,1,1,1,1) << (1*8)) // 8: % + - == <= >= != <
570 + (EXBITS(1,1,1,1,1,1,1,1) << (2*8)) // 16: > ! || && ^= *= /= %=
571 + (EXBITS(1,1,1,0,0,1,1,0) << (3*8)) // 24: += -= = NL WS ( ) [
572 + (EXBITS(0,0,0,0,0,0,1,1) << (4*8)) // 32: , ] { ; } STR NAME NUM
573 + (EXBITS(0,0,0,0,0,0,0,1) << (5*8)) // 40: auto break cont define else for halt ibase
574 + (EXBITS(0,1,1,1,1,0,0,1) << (6*8)) // 48: if last len limits obase print quit read - bug, why "limits" is allowed?
575 + (EXBITS(0,1,1,0,0,0,0,0) << (7*8)) // 56: return scale sqrt while
578 static ALWAYS_INLINE long bc_parse_exprs(unsigned i)
580 #if ULONG_MAX > 0xffffffff
581 // 64-bit version (will not work correctly for 32-bit longs!)
582 return BC_PARSE_EXPRS_BITS & (1UL << i);
585 unsigned long m = (uint32_t)BC_PARSE_EXPRS_BITS;
587 m = (uint32_t)(BC_PARSE_EXPRS_BITS >> 32);
590 return m & (1UL << i);
594 // This is an array of data for operators that correspond to
595 // [BC_LEX_OP_INC...BC_LEX_OP_ASSIGN] token types.
596 static const uint8_t bc_parse_ops[] = {
597 #define OP(p,l) ((int)(l) * 0x10 + (p))
598 OP(0, false), OP( 0, false ), // inc dec
601 OP(3, true ), OP( 3, true ), OP( 3, true ), // mul div mod
602 OP(4, true ), OP( 4, true ), // + -
603 OP(6, true ), OP( 6, true ), OP( 6, true ), OP( 6, true ), OP( 6, true ), OP( 6, true ), // == <= >= != < >
605 OP(7, true ), OP( 7, true ), // or and
606 OP(5, false), OP( 5, false ), OP( 5, false ), OP( 5, false ), OP( 5, false ), // ^= *= /= %= +=
607 OP(5, false), OP( 5, false ), // -= =
610 #define bc_parse_op_PREC(i) (bc_parse_ops[i] & 0x0f)
611 #define bc_parse_op_LEFT(i) (bc_parse_ops[i] & 0x10)
615 static const //BcInst - should be this type. Using signed narrow type since BC_INST_INVALID is -1
618 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID, BC_INST_REL_GE,
619 BC_INST_INVALID, BC_INST_POWER, BC_INST_MULTIPLY, BC_INST_DIVIDE,
620 BC_INST_MODULUS, BC_INST_PLUS, BC_INST_MINUS,
621 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID,
622 BC_INST_INVALID, BC_INST_INVALID,
623 BC_INST_BOOL_NOT, BC_INST_INVALID, BC_INST_INVALID,
624 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID,
625 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID,
626 BC_INST_INVALID, BC_INST_INVALID, BC_INST_REL_GT, BC_INST_INVALID,
627 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID, BC_INST_REL_GE,
628 BC_INST_INVALID, BC_INST_INVALID,
629 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID,
630 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID,
631 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID, BC_INST_IBASE,
632 BC_INST_INVALID, BC_INST_INVALID, BC_INST_LENGTH, BC_INST_INVALID,
633 BC_INST_OBASE, BC_INST_PRINT, BC_INST_QUIT, BC_INST_INVALID,
634 BC_INST_INVALID, BC_INST_SCALE, BC_INST_SQRT, BC_INST_INVALID,
635 BC_INST_REL_EQ, BC_INST_MODEXP, BC_INST_DIVMOD, BC_INST_INVALID,
636 BC_INST_INVALID, BC_INST_EXECUTE, BC_INST_PRINT_STACK, BC_INST_CLEAR_STACK,
637 BC_INST_STACK_LEN, BC_INST_DUPLICATE, BC_INST_SWAP, BC_INST_POP,
638 BC_INST_ASCIIFY, BC_INST_PRINT_STREAM, BC_INST_INVALID, BC_INST_INVALID,
639 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID,
640 BC_INST_PRINT, BC_INST_NQUIT, BC_INST_SCALE_FUNC,
645 typedef struct BcLex {
658 #define BC_PARSE_STREND ((char) UCHAR_MAX)
660 #define BC_PARSE_REL (1 << 0)
661 #define BC_PARSE_PRINT (1 << 1)
662 #define BC_PARSE_NOCALL (1 << 2)
663 #define BC_PARSE_NOREAD (1 << 3)
664 #define BC_PARSE_ARRAY (1 << 4)
666 typedef struct BcParse {
680 typedef struct BcProgram {
716 #define BC_PROG_STACK(s, n) ((s)->len >= ((size_t) n))
718 #define BC_PROG_MAIN (0)
719 #define BC_PROG_READ (1)
721 #define BC_PROG_REQ_FUNCS (2)
724 #define BC_PROG_STR(n) (!(n)->num && !(n)->cap)
725 #define BC_PROG_NUM(r, n) \
726 ((r)->t != BC_RESULT_ARRAY && (r)->t != BC_RESULT_STR && !BC_PROG_STR(n))
728 #define BC_FLAG_W (1 << 0)
729 #define BC_FLAG_V (1 << 1)
730 #define BC_FLAG_S (1 << 2)
731 #define BC_FLAG_Q (1 << 3)
732 #define BC_FLAG_L (1 << 4)
733 #define BC_FLAG_I (1 << 5)
734 #define DC_FLAG_X (1 << 6)
736 #define BC_MAX(a, b) ((a) > (b) ? (a) : (b))
737 #define BC_MIN(a, b) ((a) < (b) ? (a) : (b))
739 #define BC_MAX_OBASE ((unsigned) 999)
740 #define BC_MAX_DIM ((unsigned) INT_MAX)
741 #define BC_MAX_SCALE ((unsigned) UINT_MAX)
742 #define BC_MAX_STRING ((unsigned) UINT_MAX - 1)
743 #define BC_MAX_NUM BC_MAX_STRING
744 // Unused apart from "limits" message. Just show a "biggish number" there.
745 //#define BC_MAX_NAME BC_MAX_STRING
746 //#define BC_MAX_EXP ((unsigned long) LONG_MAX)
747 //#define BC_MAX_VARS ((unsigned long) SIZE_MAX - 1)
748 #define BC_MAX_NAME_STR "999999999"
749 #define BC_MAX_EXP_STR "999999999"
750 #define BC_MAX_VARS_STR "999999999"
752 #define BC_MAX_OBASE_STR "999"
754 #if INT_MAX == 2147483647
755 # define BC_MAX_DIM_STR "2147483647"
756 #elif INT_MAX == 9223372036854775807
757 # define BC_MAX_DIM_STR "9223372036854775807"
759 # error Strange INT_MAX
762 #if UINT_MAX == 4294967295
763 # define BC_MAX_SCALE_STR "4294967295"
764 # define BC_MAX_STRING_STR "4294967294"
765 #elif UINT_MAX == 18446744073709551615
766 # define BC_MAX_SCALE_STR "18446744073709551615"
767 # define BC_MAX_STRING_STR "18446744073709551614"
769 # error Strange UINT_MAX
771 #define BC_MAX_NUM_STR BC_MAX_STRING_STR
774 IF_FEATURE_BC_SIGNALS(smallint ttyin;)
775 IF_FEATURE_CLEAN_UP(smallint exiting;)
781 // For error messages. Can be set to current parsed line,
782 // or [TODO] to current executing line (can be before last parsed one)
791 #if ENABLE_FEATURE_EDITING
792 line_input_t *line_input_state;
795 #define G (*ptr_to_globals)
796 #define INIT_G() do { \
797 SET_PTR_TO_GLOBALS(xzalloc(sizeof(G))); \
799 #define FREE_G() do { \
800 FREE_PTR_TO_GLOBALS(); \
802 #define G_posix (ENABLE_BC && (option_mask32 & BC_FLAG_S))
803 #define G_warn (ENABLE_BC && (option_mask32 & BC_FLAG_W))
804 #define G_exreg (ENABLE_DC && (option_mask32 & DC_FLAG_X))
805 #if ENABLE_FEATURE_BC_SIGNALS
806 # define G_interrupt bb_got_signal
807 # define G_ttyin G.ttyin
809 # define G_interrupt 0
812 #if ENABLE_FEATURE_CLEAN_UP
813 # define G_exiting G.exiting
817 #define IS_BC (ENABLE_BC && (!ENABLE_DC || applet_name[0] == 'b'))
818 #define IS_DC (ENABLE_DC && (!ENABLE_BC || applet_name[0] != 'b'))
820 // In configurations where errors abort instead of propagating error
821 // return code up the call chain, functions returning BC_STATUS
822 // actually don't return anything, they always succeed and return "void".
823 // A macro wrapper is provided, which makes this statement work:
825 // and makes it visible to the compiler that s is always zero,
826 // allowing compiler to optimize dead code after the statement.
828 // To make code more readable, each such function has a "z"
829 // ("always returning zero") prefix, i.e. zbc_foo or zdc_foo.
831 #if ENABLE_FEATURE_BC_SIGNALS || ENABLE_FEATURE_CLEAN_UP
832 # define ERRORS_ARE_FATAL 0
833 # define ERRORFUNC /*nothing*/
834 # define IF_ERROR_RETURN_POSSIBLE(a) a
835 # define BC_STATUS BcStatus
836 # define RETURN_STATUS(v) return (v)
837 # define COMMA_SUCCESS /*nothing*/
839 # define ERRORS_ARE_FATAL 1
840 # define ERRORFUNC NORETURN
841 # define IF_ERROR_RETURN_POSSIBLE(a) /*nothing*/
842 # define BC_STATUS void
843 # define RETURN_STATUS(v) do { ((void)(v)); return; } while (0)
844 # define COMMA_SUCCESS ,BC_STATUS_SUCCESS
847 #define BC_NUM_NEG(n, neg) ((((ssize_t)(n)) ^ -((ssize_t)(neg))) + (neg))
848 #define BC_NUM_ONE(n) ((n)->len == 1 && (n)->rdx == 0 && (n)->num[0] == 1)
849 #define BC_NUM_INT(n) ((n)->len - (n)->rdx)
850 //#define BC_NUM_AREQ(a, b) (BC_MAX((a)->rdx, (b)->rdx) + BC_MAX(BC_NUM_INT(a), BC_NUM_INT(b)) + 1)
851 static /*ALWAYS_INLINE*/ size_t BC_NUM_AREQ(BcNum *a, BcNum *b)
853 return BC_MAX(a->rdx, b->rdx) + BC_MAX(BC_NUM_INT(a), BC_NUM_INT(b)) + 1;
855 //#define BC_NUM_MREQ(a, b, scale) (BC_NUM_INT(a) + BC_NUM_INT(b) + BC_MAX((scale), (a)->rdx + (b)->rdx) + 1)
856 static /*ALWAYS_INLINE*/ size_t BC_NUM_MREQ(BcNum *a, BcNum *b, size_t scale)
858 return BC_NUM_INT(a) + BC_NUM_INT(b) + BC_MAX(scale, a->rdx + b->rdx) + 1;
861 typedef void (*BcNumDigitOp)(size_t, size_t, bool) FAST_FUNC;
863 typedef BC_STATUS (*BcNumBinaryOp)(BcNum *, BcNum *, BcNum *, size_t) FAST_FUNC;
865 static BC_STATUS zbc_num_binary(BcNum *a, BcNum *b, BcNum *c, size_t scale,
866 BcNumBinaryOp op, size_t req);
867 static FAST_FUNC BC_STATUS zbc_num_a(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale);
868 static FAST_FUNC BC_STATUS zbc_num_s(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale);
869 static FAST_FUNC BC_STATUS zbc_num_p(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale);
870 static FAST_FUNC BC_STATUS zbc_num_m(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale);
871 static FAST_FUNC BC_STATUS zbc_num_d(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale);
872 static FAST_FUNC BC_STATUS zbc_num_rem(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale);
874 static FAST_FUNC BC_STATUS zbc_num_add(BcNum *a, BcNum *b, BcNum *c, size_t scale)
876 BcNumBinaryOp op = (!a->neg == !b->neg) ? zbc_num_a : zbc_num_s;
878 RETURN_STATUS(zbc_num_binary(a, b, c, false, op, BC_NUM_AREQ(a, b)));
881 static FAST_FUNC BC_STATUS zbc_num_sub(BcNum *a, BcNum *b, BcNum *c, size_t scale)
883 BcNumBinaryOp op = (!a->neg == !b->neg) ? zbc_num_s : zbc_num_a;
885 RETURN_STATUS(zbc_num_binary(a, b, c, true, op, BC_NUM_AREQ(a, b)));
888 static FAST_FUNC BC_STATUS zbc_num_mul(BcNum *a, BcNum *b, BcNum *c, size_t scale)
890 size_t req = BC_NUM_MREQ(a, b, scale);
891 RETURN_STATUS(zbc_num_binary(a, b, c, scale, zbc_num_m, req));
894 static FAST_FUNC BC_STATUS zbc_num_div(BcNum *a, BcNum *b, BcNum *c, size_t scale)
896 size_t req = BC_NUM_MREQ(a, b, scale);
897 RETURN_STATUS(zbc_num_binary(a, b, c, scale, zbc_num_d, req));
900 static FAST_FUNC BC_STATUS zbc_num_mod(BcNum *a, BcNum *b, BcNum *c, size_t scale)
902 size_t req = BC_NUM_MREQ(a, b, scale);
903 RETURN_STATUS(zbc_num_binary(a, b, c, scale, zbc_num_rem, req));
906 static FAST_FUNC BC_STATUS zbc_num_pow(BcNum *a, BcNum *b, BcNum *c, size_t scale)
908 RETURN_STATUS(zbc_num_binary(a, b, c, scale, zbc_num_p, a->len * b->len + 1));
911 static const BcNumBinaryOp zbc_program_ops[] = {
912 zbc_num_pow, zbc_num_mul, zbc_num_div, zbc_num_mod, zbc_num_add, zbc_num_sub,
914 #define zbc_num_add(...) (zbc_num_add(__VA_ARGS__) COMMA_SUCCESS)
915 #define zbc_num_sub(...) (zbc_num_sub(__VA_ARGS__) COMMA_SUCCESS)
916 #define zbc_num_mul(...) (zbc_num_mul(__VA_ARGS__) COMMA_SUCCESS)
917 #define zbc_num_div(...) (zbc_num_div(__VA_ARGS__) COMMA_SUCCESS)
918 #define zbc_num_mod(...) (zbc_num_mod(__VA_ARGS__) COMMA_SUCCESS)
919 #define zbc_num_pow(...) (zbc_num_pow(__VA_ARGS__) COMMA_SUCCESS)
921 static void fflush_and_check(void)
924 if (ferror(stdout) || ferror(stderr))
925 bb_perror_msg_and_die("output error");
928 #if ENABLE_FEATURE_CLEAN_UP
929 #define QUIT_OR_RETURN_TO_MAIN \
931 IF_FEATURE_BC_SIGNALS(G_ttyin = 0;) /* do not loop in main loop anymore */ \
933 return BC_STATUS_FAILURE; \
936 #define QUIT_OR_RETURN_TO_MAIN quit()
939 static void quit(void) NORETURN;
940 static void quit(void)
943 bb_perror_msg_and_die("input error");
945 dbg_exec("quit(): exiting with exitcode SUCCESS");
949 static void bc_verror_msg(const char *fmt, va_list p)
951 const char *sv = sv; // for compiler
954 applet_name = xasprintf("%s: %s:%u", applet_name, G.prog.file, G.err_line);
956 bb_verror_msg(fmt, p, NULL);
958 free((char*)applet_name);
963 static NOINLINE ERRORFUNC int bc_error_fmt(const char *fmt, ...)
968 bc_verror_msg(fmt, p);
971 if (ENABLE_FEATURE_CLEAN_UP || G_ttyin)
972 IF_ERROR_RETURN_POSSIBLE(return BC_STATUS_FAILURE);
977 static NOINLINE int bc_posix_error_fmt(const char *fmt, ...)
981 // Are non-POSIX constructs totally ok?
982 if (!(option_mask32 & (BC_FLAG_S|BC_FLAG_W)))
983 return BC_STATUS_SUCCESS; // yes
986 bc_verror_msg(fmt, p);
989 // Do we treat non-POSIX constructs as errors?
990 if (!(option_mask32 & BC_FLAG_S))
991 return BC_STATUS_SUCCESS; // no, it's a warning
992 if (ENABLE_FEATURE_CLEAN_UP || G_ttyin)
993 return BC_STATUS_FAILURE;
998 // We use error functions with "return bc_error(FMT[, PARAMS])" idiom.
999 // This idiom begs for tail-call optimization, but for it to work,
1000 // function must not have caller-cleaned parameters on stack.
1001 // Unfortunately, vararg function API does exactly that on most arches.
1002 // Thus, use these shims for the cases when we have no vararg PARAMS:
1003 static ERRORFUNC int bc_error(const char *msg)
1005 IF_ERROR_RETURN_POSSIBLE(return) bc_error_fmt("%s", msg);
1007 static ERRORFUNC int bc_error_bad_character(char c)
1010 IF_ERROR_RETURN_POSSIBLE(return) bc_error("NUL character");
1011 IF_ERROR_RETURN_POSSIBLE(return) bc_error_fmt("bad character '%c'", c);
1013 static ERRORFUNC int bc_error_bad_expression(void)
1015 IF_ERROR_RETURN_POSSIBLE(return) bc_error("bad expression");
1017 static ERRORFUNC int bc_error_bad_token(void)
1019 IF_ERROR_RETURN_POSSIBLE(return) bc_error("bad token");
1021 static ERRORFUNC int bc_error_stack_has_too_few_elements(void)
1023 IF_ERROR_RETURN_POSSIBLE(return) bc_error("stack has too few elements");
1025 static ERRORFUNC int bc_error_variable_is_wrong_type(void)
1027 IF_ERROR_RETURN_POSSIBLE(return) bc_error("variable is wrong type");
1029 static ERRORFUNC int bc_error_nested_read_call(void)
1031 IF_ERROR_RETURN_POSSIBLE(return) bc_error("read() call inside of a read() call");
1034 static int bc_POSIX_requires(const char *msg)
1036 return bc_posix_error_fmt("POSIX requires %s", msg);
1038 static int bc_POSIX_does_not_allow(const char *msg)
1040 return bc_posix_error_fmt("%s%s", "POSIX does not allow ", msg);
1042 static int bc_POSIX_does_not_allow_bool_ops_this_is_bad(const char *msg)
1044 return bc_posix_error_fmt("%s%s %s", "POSIX does not allow ", "boolean operators; the following is bad:", msg);
1046 static int bc_POSIX_does_not_allow_empty_X_expression_in_for(const char *msg)
1048 return bc_posix_error_fmt("%san empty %s expression in a for loop", "POSIX does not allow ", msg);
1052 static void bc_vec_grow(BcVec *v, size_t n)
1054 size_t cap = v->cap * 2;
1055 while (cap < v->len + n) cap *= 2;
1056 v->v = xrealloc(v->v, v->size * cap);
1060 static void bc_vec_init(BcVec *v, size_t esize, BcVecFree dtor)
1063 v->cap = BC_VEC_START_CAP;
1066 v->v = xmalloc(esize * BC_VEC_START_CAP);
1069 static void bc_char_vec_init(BcVec *v)
1071 bc_vec_init(v, sizeof(char), NULL);
1074 static void bc_vec_expand(BcVec *v, size_t req)
1077 v->v = xrealloc(v->v, v->size * req);
1082 static void bc_vec_pop(BcVec *v)
1086 v->dtor(v->v + (v->size * v->len));
1089 static void bc_vec_npop(BcVec *v, size_t n)
1094 size_t len = v->len - n;
1095 while (v->len > len) v->dtor(v->v + (v->size * --v->len));
1099 static void bc_vec_pop_all(BcVec *v)
1101 bc_vec_npop(v, v->len);
1104 static void bc_vec_push(BcVec *v, const void *data)
1106 if (v->len + 1 > v->cap) bc_vec_grow(v, 1);
1107 memmove(v->v + (v->size * v->len), data, v->size);
1111 static void bc_vec_pushByte(BcVec *v, char data)
1113 bc_vec_push(v, &data);
1116 static void bc_vec_pushZeroByte(BcVec *v)
1118 //bc_vec_pushByte(v, '\0');
1120 bc_vec_push(v, &const_int_0);
1123 static void bc_vec_pushAt(BcVec *v, const void *data, size_t idx)
1126 bc_vec_push(v, data);
1130 if (v->len == v->cap) bc_vec_grow(v, 1);
1132 ptr = v->v + v->size * idx;
1134 memmove(ptr + v->size, ptr, v->size * (v->len++ - idx));
1135 memmove(ptr, data, v->size);
1139 static void bc_vec_string(BcVec *v, size_t len, const char *str)
1142 bc_vec_expand(v, len + 1);
1143 memcpy(v->v, str, len);
1146 bc_vec_pushZeroByte(v);
1149 #if ENABLE_FEATURE_BC_SIGNALS && ENABLE_FEATURE_EDITING
1150 static void bc_vec_concat(BcVec *v, const char *str)
1154 if (v->len == 0) bc_vec_pushZeroByte(v);
1157 len = v->len + slen;
1159 if (v->cap < len) bc_vec_grow(v, slen);
1160 strcpy(v->v + v->len - 1, str);
1166 static void *bc_vec_item(const BcVec *v, size_t idx)
1168 return v->v + v->size * idx;
1171 static char** bc_program_str(size_t idx)
1173 return bc_vec_item(&G.prog.strs, idx);
1176 static BcFunc* bc_program_func(size_t idx)
1178 return bc_vec_item(&G.prog.fns, idx);
1181 static void *bc_vec_item_rev(const BcVec *v, size_t idx)
1183 return v->v + v->size * (v->len - idx - 1);
1186 static void *bc_vec_top(const BcVec *v)
1188 return v->v + v->size * (v->len - 1);
1191 static FAST_FUNC void bc_vec_free(void *vec)
1193 BcVec *v = (BcVec *) vec;
1198 static int bc_id_cmp(const void *e1, const void *e2)
1200 return strcmp(((const BcId *) e1)->name, ((const BcId *) e2)->name);
1203 static FAST_FUNC void bc_id_free(void *id)
1205 free(((BcId *) id)->name);
1208 static size_t bc_map_find(const BcVec *v, const void *ptr)
1210 size_t low = 0, high = v->len;
1212 while (low < high) {
1213 size_t mid = (low + high) / 2;
1214 BcId *id = bc_vec_item(v, mid);
1215 int result = bc_id_cmp(ptr, id);
1219 else if (result < 0)
1228 static int bc_map_insert(BcVec *v, const void *ptr, size_t *i)
1230 size_t n = *i = bc_map_find(v, ptr);
1233 bc_vec_push(v, ptr);
1234 else if (!bc_id_cmp(ptr, bc_vec_item(v, n)))
1235 return 0; // "was not inserted"
1237 bc_vec_pushAt(v, ptr, n);
1238 return 1; // "was inserted"
1242 static size_t bc_map_index(const BcVec *v, const void *ptr)
1244 size_t i = bc_map_find(v, ptr);
1245 if (i >= v->len) return BC_VEC_INVALID_IDX;
1246 return bc_id_cmp(ptr, bc_vec_item(v, i)) ? BC_VEC_INVALID_IDX : i;
1250 static int bad_input_byte(char c)
1252 if ((c < ' ' && c != '\t' && c != '\r' && c != '\n') // also allow '\v' '\f'?
1255 bc_error_fmt("illegal character 0x%02x", c);
1261 // Note: it _appends_ data from fp to vec.
1262 static void bc_read_line(BcVec *vec, FILE *fp)
1267 #if ENABLE_FEATURE_BC_SIGNALS
1268 if (G_interrupt) { // ^C was pressed
1271 // ^C while running a script (bc SCRIPT): die.
1272 // We do not return to interactive prompt:
1273 // user might be running us from a shell,
1274 // and SCRIPT might be intended to terminate
1275 // (e.g. contain a "halt" stmt).
1276 // ^C dropping user into a bc prompt instead of
1277 // the shell would be unexpected.
1280 // ^C while interactive input
1282 // GNU bc says "interrupted execution."
1283 // GNU dc says "Interrupt!"
1284 fputs("\ninterrupted execution\n", stderr);
1287 # if ENABLE_FEATURE_EDITING
1288 if (G_ttyin && fp == stdin) {
1290 # define line_buf bb_common_bufsiz1
1291 n = read_line_input(G.line_input_state, "", line_buf, COMMON_BUFSIZE);
1292 if (n <= 0) { // read errors or EOF, or ^D, or ^C
1295 bc_vec_pushZeroByte(vec); // ^D or EOF (or error)
1300 char c = line_buf[i++];
1302 if (bad_input_byte(c)) goto again;
1304 bc_vec_concat(vec, line_buf);
1312 size_t len = vec->len;
1315 #if ENABLE_FEATURE_BC_SIGNALS
1317 // ^C was pressed: ignore entire line, get another one
1322 do c = fgetc(fp); while (c == '\0');
1325 bb_perror_msg_and_die("input error");
1326 // Note: EOF does not append '\n'
1329 bad_chars |= bad_input_byte(c);
1330 bc_vec_pushByte(vec, (char)c);
1331 } while (c != '\n');
1334 // Bad chars on this line
1335 if (!G.prog.file) { // stdin
1336 // ignore entire line, get another one
1340 bb_perror_msg_and_die("file '%s' is not text", G.prog.file);
1342 bc_vec_pushZeroByte(vec);
1346 static void bc_num_setToZero(BcNum *n, size_t scale)
1353 static void bc_num_zero(BcNum *n)
1355 bc_num_setToZero(n, 0);
1358 static void bc_num_one(BcNum *n)
1360 bc_num_setToZero(n, 0);
1365 // Note: this also sets BcNum to zero
1366 static void bc_num_init(BcNum *n, size_t req)
1368 req = req >= BC_NUM_DEF_SIZE ? req : BC_NUM_DEF_SIZE;
1369 //memset(n, 0, sizeof(BcNum)); - cleared by assignments below
1370 n->num = xmalloc(req);
1377 static void bc_num_init_DEF_SIZE(BcNum *n)
1379 bc_num_init(n, BC_NUM_DEF_SIZE);
1382 static void bc_num_expand(BcNum *n, size_t req)
1384 req = req >= BC_NUM_DEF_SIZE ? req : BC_NUM_DEF_SIZE;
1386 n->num = xrealloc(n->num, req);
1391 static FAST_FUNC void bc_num_free(void *num)
1393 free(((BcNum *) num)->num);
1396 static void bc_num_copy(BcNum *d, BcNum *s)
1399 bc_num_expand(d, s->cap);
1403 memcpy(d->num, s->num, sizeof(BcDig) * d->len);
1407 static BC_STATUS zbc_num_ulong(BcNum *n, unsigned long *result_p)
1410 unsigned long pow, result;
1412 if (n->neg) RETURN_STATUS(bc_error("negative number"));
1414 for (result = 0, pow = 1, i = n->rdx; i < n->len; ++i) {
1415 unsigned long prev = result, powprev = pow;
1417 result += ((unsigned long) n->num[i]) * pow;
1420 if (result < prev || pow < powprev)
1421 RETURN_STATUS(bc_error("overflow"));
1427 RETURN_STATUS(BC_STATUS_SUCCESS);
1429 #define zbc_num_ulong(...) (zbc_num_ulong(__VA_ARGS__) COMMA_SUCCESS)
1431 static void bc_num_ulong2num(BcNum *n, unsigned long val)
1437 if (val == 0) return;
1439 if (ULONG_MAX == 0xffffffffUL)
1440 bc_num_expand(n, 10); // 10 digits: 4294967295
1441 if (ULONG_MAX == 0xffffffffffffffffULL)
1442 bc_num_expand(n, 20); // 20 digits: 18446744073709551615
1443 BUILD_BUG_ON(ULONG_MAX > 0xffffffffffffffffULL);
1450 if (val == 0) break;
1454 static void bc_num_subArrays(BcDig *restrict a, BcDig *restrict b, size_t len)
1457 for (i = 0; i < len; ++i) {
1459 for (j = i; a[j] < 0;) {
1466 static ssize_t bc_num_compare(BcDig *restrict a, BcDig *restrict b, size_t len)
1484 static ssize_t bc_num_cmp(BcNum *a, BcNum *b)
1486 size_t i, min, a_int, b_int, diff;
1487 BcDig *max_num, *min_num;
1491 if (a == b) return 0;
1492 if (a->len == 0) return BC_NUM_NEG(!!b->len, !b->neg);
1493 if (b->len == 0) return BC_NUM_NEG(1, a->neg);
1495 if (a->neg != b->neg) // signs of a and b differ
1496 // +a,-b = a>b = 1 or -a,+b = a<b = -1
1497 return (int)b->neg - (int)a->neg;
1498 neg = a->neg; // 1 if both negative, 0 if both positive
1500 a_int = BC_NUM_INT(a);
1501 b_int = BC_NUM_INT(b);
1504 if (a_int != 0) return (ssize_t) a_int;
1506 a_max = (a->rdx > b->rdx);
1509 diff = a->rdx - b->rdx;
1510 max_num = a->num + diff;
1512 // neg = (a_max == neg); - NOP (maps 1->1 and 0->0)
1515 diff = b->rdx - a->rdx;
1516 max_num = b->num + diff;
1518 neg = !neg; // same as "neg = (a_max == neg)"
1521 cmp = bc_num_compare(max_num, min_num, b_int + min);
1522 if (cmp != 0) return BC_NUM_NEG(cmp, neg);
1524 for (max_num -= diff, i = diff - 1; i < diff; --i) {
1525 if (max_num[i]) return BC_NUM_NEG(1, neg);
1531 static void bc_num_truncate(BcNum *n, size_t places)
1533 if (places == 0) return;
1539 memmove(n->num, n->num + places, n->len * sizeof(BcDig));
1543 static void bc_num_extend(BcNum *n, size_t places)
1545 size_t len = n->len + places;
1548 if (n->cap < len) bc_num_expand(n, len);
1550 memmove(n->num + places, n->num, sizeof(BcDig) * n->len);
1551 memset(n->num, 0, sizeof(BcDig) * places);
1558 static void bc_num_clean(BcNum *n)
1560 while (n->len > 0 && n->num[n->len - 1] == 0) --n->len;
1563 else if (n->len < n->rdx)
1567 static void bc_num_retireMul(BcNum *n, size_t scale, bool neg1, bool neg2)
1570 bc_num_extend(n, scale - n->rdx);
1572 bc_num_truncate(n, n->rdx - scale);
1575 if (n->len != 0) n->neg = !neg1 != !neg2;
1578 static void bc_num_split(BcNum *restrict n, size_t idx, BcNum *restrict a,
1582 b->len = n->len - idx;
1584 a->rdx = b->rdx = 0;
1586 memcpy(b->num, n->num + idx, b->len * sizeof(BcDig));
1587 memcpy(a->num, n->num, idx * sizeof(BcDig));
1597 static BC_STATUS zbc_num_shift(BcNum *n, size_t places)
1599 if (places == 0 || n->len == 0) RETURN_STATUS(BC_STATUS_SUCCESS);
1601 // This check makes sense only if size_t is (much) larger than BC_MAX_NUM.
1602 if (SIZE_MAX > (BC_MAX_NUM | 0xff)) {
1603 if (places + n->len > BC_MAX_NUM)
1604 RETURN_STATUS(bc_error("number too long: must be [1,"BC_MAX_NUM_STR"]"));
1607 if (n->rdx >= places)
1610 bc_num_extend(n, places - n->rdx);
1616 RETURN_STATUS(BC_STATUS_SUCCESS);
1618 #define zbc_num_shift(...) (zbc_num_shift(__VA_ARGS__) COMMA_SUCCESS)
1620 static BC_STATUS zbc_num_inv(BcNum *a, BcNum *b, size_t scale)
1629 RETURN_STATUS(zbc_num_div(&one, a, b, scale));
1631 #define zbc_num_inv(...) (zbc_num_inv(__VA_ARGS__) COMMA_SUCCESS)
1633 static FAST_FUNC BC_STATUS zbc_num_a(BcNum *a, BcNum *b, BcNum *restrict c, size_t sub)
1635 BcDig *ptr, *ptr_a, *ptr_b, *ptr_c;
1636 size_t i, max, min_rdx, min_int, diff, a_int, b_int;
1639 // Because this function doesn't need to use scale (per the bc spec),
1640 // I am hijacking it to say whether it's doing an add or a subtract.
1644 if (sub && c->len) c->neg = !c->neg;
1645 RETURN_STATUS(BC_STATUS_SUCCESS);
1649 RETURN_STATUS(BC_STATUS_SUCCESS);
1653 c->rdx = BC_MAX(a->rdx, b->rdx);
1654 min_rdx = BC_MIN(a->rdx, b->rdx);
1657 if (a->rdx > b->rdx) {
1658 diff = a->rdx - b->rdx;
1660 ptr_a = a->num + diff;
1663 diff = b->rdx - a->rdx;
1666 ptr_b = b->num + diff;
1670 for (i = 0; i < diff; ++i, ++c->len)
1674 a_int = BC_NUM_INT(a);
1675 b_int = BC_NUM_INT(b);
1677 if (a_int > b_int) {
1688 for (i = 0; i < min_rdx + min_int; ++i) {
1689 unsigned in = (unsigned)ptr_a[i] + (unsigned)ptr_b[i] + carry;
1691 ptr_c[i] = (BcDig)(in % 10);
1693 for (; i < max + min_rdx; ++i) {
1694 unsigned in = (unsigned)ptr[i] + carry;
1696 ptr_c[i] = (BcDig)(in % 10);
1700 if (carry != 0) c->num[c->len++] = (BcDig) carry;
1702 RETURN_STATUS(BC_STATUS_SUCCESS); // can't make void, see zbc_num_binary()
1705 static FAST_FUNC BC_STATUS zbc_num_s(BcNum *a, BcNum *b, BcNum *restrict c, size_t sub)
1708 BcNum *minuend, *subtrahend;
1710 bool aneg, bneg, neg;
1712 // Because this function doesn't need to use scale (per the bc spec),
1713 // I am hijacking it to say whether it's doing an add or a subtract.
1717 if (sub && c->len) c->neg = !c->neg;
1718 RETURN_STATUS(BC_STATUS_SUCCESS);
1722 RETURN_STATUS(BC_STATUS_SUCCESS);
1727 a->neg = b->neg = false;
1729 cmp = bc_num_cmp(a, b);
1735 bc_num_setToZero(c, BC_MAX(a->rdx, b->rdx));
1736 RETURN_STATUS(BC_STATUS_SUCCESS);
1744 if (sub) neg = !neg;
1749 bc_num_copy(c, minuend);
1752 if (c->rdx < subtrahend->rdx) {
1753 bc_num_extend(c, subtrahend->rdx - c->rdx);
1756 start = c->rdx - subtrahend->rdx;
1758 bc_num_subArrays(c->num + start, subtrahend->num, subtrahend->len);
1762 RETURN_STATUS(BC_STATUS_SUCCESS); // can't make void, see zbc_num_binary()
1765 static FAST_FUNC BC_STATUS zbc_num_k(BcNum *restrict a, BcNum *restrict b,
1767 #define zbc_num_k(...) (zbc_num_k(__VA_ARGS__) COMMA_SUCCESS)
1770 size_t max = BC_MAX(a->len, b->len), max2 = (max + 1) / 2;
1771 BcNum l1, h1, l2, h2, m2, m1, z0, z1, z2, temp;
1774 if (a->len == 0 || b->len == 0) {
1776 RETURN_STATUS(BC_STATUS_SUCCESS);
1778 aone = BC_NUM_ONE(a);
1779 if (aone || BC_NUM_ONE(b)) {
1780 bc_num_copy(c, aone ? b : a);
1781 RETURN_STATUS(BC_STATUS_SUCCESS);
1784 if (a->len + b->len < BC_NUM_KARATSUBA_LEN
1785 || a->len < BC_NUM_KARATSUBA_LEN
1786 || b->len < BC_NUM_KARATSUBA_LEN
1790 bc_num_expand(c, a->len + b->len + 1);
1792 memset(c->num, 0, sizeof(BcDig) * c->cap);
1795 for (i = 0; i < b->len; ++i) {
1797 for (j = 0; j < a->len; ++j) {
1798 unsigned in = c->num[i + j];
1799 in += (unsigned)a->num[j] * (unsigned)b->num[i] + carry;
1800 // note: compilers prefer _unsigned_ div/const
1802 c->num[i + j] = (BcDig)(in % 10);
1805 c->num[i + j] += (BcDig) carry;
1806 len = BC_MAX(len, i + j + !!carry);
1808 #if ENABLE_FEATURE_BC_SIGNALS
1810 // a*a <- without check below, this will not be interruptible
1811 if (G_interrupt) return BC_STATUS_FAILURE;
1817 RETURN_STATUS(BC_STATUS_SUCCESS);
1820 bc_num_init(&l1, max);
1821 bc_num_init(&h1, max);
1822 bc_num_init(&l2, max);
1823 bc_num_init(&h2, max);
1824 bc_num_init(&m1, max);
1825 bc_num_init(&m2, max);
1826 bc_num_init(&z0, max);
1827 bc_num_init(&z1, max);
1828 bc_num_init(&z2, max);
1829 bc_num_init(&temp, max + max);
1831 bc_num_split(a, max2, &l1, &h1);
1832 bc_num_split(b, max2, &l2, &h2);
1834 s = zbc_num_add(&h1, &l1, &m1, 0);
1836 s = zbc_num_add(&h2, &l2, &m2, 0);
1839 s = zbc_num_k(&h1, &h2, &z0);
1841 s = zbc_num_k(&m1, &m2, &z1);
1843 s = zbc_num_k(&l1, &l2, &z2);
1846 s = zbc_num_sub(&z1, &z0, &temp, 0);
1848 s = zbc_num_sub(&temp, &z2, &z1, 0);
1851 s = zbc_num_shift(&z0, max2 * 2);
1853 s = zbc_num_shift(&z1, max2);
1855 s = zbc_num_add(&z0, &z1, &temp, 0);
1857 s = zbc_num_add(&temp, &z2, c, 0);
1872 static FAST_FUNC BC_STATUS zbc_num_m(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale)
1876 size_t maxrdx = BC_MAX(a->rdx, b->rdx);
1878 scale = BC_MAX(scale, a->rdx);
1879 scale = BC_MAX(scale, b->rdx);
1880 scale = BC_MIN(a->rdx + b->rdx, scale);
1881 maxrdx = BC_MAX(maxrdx, scale);
1883 bc_num_init(&cpa, a->len);
1884 bc_num_init(&cpb, b->len);
1886 bc_num_copy(&cpa, a);
1887 bc_num_copy(&cpb, b);
1888 cpa.neg = cpb.neg = false;
1890 s = zbc_num_shift(&cpa, maxrdx);
1892 s = zbc_num_shift(&cpb, maxrdx);
1894 s = zbc_num_k(&cpa, &cpb, c);
1898 bc_num_expand(c, c->len + maxrdx);
1900 if (c->len < maxrdx) {
1901 memset(c->num + c->len, 0, (c->cap - c->len) * sizeof(BcDig));
1906 bc_num_retireMul(c, scale, a->neg, b->neg);
1912 #define zbc_num_m(...) (zbc_num_m(__VA_ARGS__) COMMA_SUCCESS)
1914 static FAST_FUNC BC_STATUS zbc_num_d(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale)
1921 RETURN_STATUS(bc_error("divide by zero"));
1923 bc_num_setToZero(c, scale);
1924 RETURN_STATUS(BC_STATUS_SUCCESS);
1926 if (BC_NUM_ONE(b)) {
1928 bc_num_retireMul(c, scale, a->neg, b->neg);
1929 RETURN_STATUS(BC_STATUS_SUCCESS);
1932 bc_num_init(&cp, BC_NUM_MREQ(a, b, scale));
1933 bc_num_copy(&cp, a);
1937 bc_num_expand(&cp, len + 2);
1938 bc_num_extend(&cp, len - cp.len);
1941 if (b->rdx > cp.rdx) bc_num_extend(&cp, b->rdx - cp.rdx);
1943 if (scale > cp.rdx) bc_num_extend(&cp, scale - cp.rdx);
1945 if (b->rdx == b->len) {
1947 if (len == 0) break;
1949 if (b->num[len] != 0)
1955 if (cp.cap == cp.len) bc_num_expand(&cp, cp.len + 1);
1957 // We want an extra zero in front to make things simpler.
1958 cp.num[cp.len++] = 0;
1961 bc_num_expand(c, cp.len);
1964 memset(c->num + end, 0, (c->cap - end) * sizeof(BcDig));
1968 s = BC_STATUS_SUCCESS;
1969 for (i = end - 1; i < end; --i) {
1972 for (q = 0; n[len] != 0 || bc_num_compare(n, b->num, len) >= 0; ++q)
1973 bc_num_subArrays(n, b->num, len);
1975 #if ENABLE_FEATURE_BC_SIGNALS
1978 // 1/a <- without check below, this will not be interruptible
1980 s = BC_STATUS_FAILURE;
1986 bc_num_retireMul(c, scale, a->neg, b->neg);
1991 #define zbc_num_d(...) (zbc_num_d(__VA_ARGS__) COMMA_SUCCESS)
1993 static FAST_FUNC BC_STATUS zbc_num_r(BcNum *a, BcNum *b, BcNum *restrict c,
1994 BcNum *restrict d, size_t scale, size_t ts)
2001 RETURN_STATUS(bc_error("divide by zero"));
2004 bc_num_setToZero(d, ts);
2005 RETURN_STATUS(BC_STATUS_SUCCESS);
2008 bc_num_init(&temp, d->cap);
2009 s = zbc_num_d(a, b, c, scale);
2012 if (scale != 0) scale = ts;
2014 s = zbc_num_m(c, b, &temp, scale);
2016 s = zbc_num_sub(a, &temp, d, scale);
2019 if (ts > d->rdx && d->len) bc_num_extend(d, ts - d->rdx);
2022 bc_num_retireMul(d, ts, a->neg, b->neg);
2028 #define zbc_num_r(...) (zbc_num_r(__VA_ARGS__) COMMA_SUCCESS)
2030 static FAST_FUNC BC_STATUS zbc_num_rem(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale)
2034 size_t ts = BC_MAX(scale + b->rdx, a->rdx), len = BC_NUM_MREQ(a, b, ts);
2036 bc_num_init(&c1, len);
2037 s = zbc_num_r(a, b, &c1, c, scale, ts);
2042 #define zbc_num_rem(...) (zbc_num_rem(__VA_ARGS__) COMMA_SUCCESS)
2044 static FAST_FUNC BC_STATUS zbc_num_p(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale)
2046 BcStatus s = BC_STATUS_SUCCESS;
2049 size_t i, powrdx, resrdx;
2052 if (b->rdx) RETURN_STATUS(bc_error("non integer number"));
2056 RETURN_STATUS(BC_STATUS_SUCCESS);
2059 bc_num_setToZero(c, scale);
2060 RETURN_STATUS(BC_STATUS_SUCCESS);
2062 if (BC_NUM_ONE(b)) {
2066 s = zbc_num_inv(a, c, scale);
2073 s = zbc_num_ulong(b, &pow);
2074 if (s) RETURN_STATUS(s);
2076 bc_num_init(©, a->len);
2077 bc_num_copy(©, a);
2082 if (a->rdx * pow < scale)
2083 scale = a->rdx * pow;
2088 for (powrdx = a->rdx; !(pow & 1); pow >>= 1) {
2090 s = zbc_num_mul(©, ©, ©, powrdx);
2092 // Not needed: zbc_num_mul() has a check for ^C:
2093 //if (G_interrupt) {
2094 // s = BC_STATUS_FAILURE;
2099 bc_num_copy(c, ©);
2101 for (resrdx = powrdx, pow >>= 1; pow != 0; pow >>= 1) {
2103 s = zbc_num_mul(©, ©, ©, powrdx);
2108 s = zbc_num_mul(c, ©, c, resrdx);
2111 // Not needed: zbc_num_mul() has a check for ^C:
2112 //if (G_interrupt) {
2113 // s = BC_STATUS_FAILURE;
2119 s = zbc_num_inv(c, c, scale);
2123 if (c->rdx > scale) bc_num_truncate(c, c->rdx - scale);
2125 // We can't use bc_num_clean() here.
2126 for (i = 0; i < c->len; ++i)
2129 bc_num_setToZero(c, scale);
2136 #define zbc_num_p(...) (zbc_num_p(__VA_ARGS__) COMMA_SUCCESS)
2138 static BC_STATUS zbc_num_binary(BcNum *a, BcNum *b, BcNum *c, size_t scale,
2139 BcNumBinaryOp op, size_t req)
2142 BcNum num2, *ptr_a, *ptr_b;
2147 memcpy(ptr_a, c, sizeof(BcNum));
2155 memcpy(ptr_b, c, sizeof(BcNum));
2162 bc_num_init(c, req);
2164 bc_num_expand(c, req);
2166 s = BC_STATUS_SUCCESS;
2167 IF_ERROR_RETURN_POSSIBLE(s =) op(ptr_a, ptr_b, c, scale);
2169 if (init) bc_num_free(&num2);
2173 #define zbc_num_binary(...) (zbc_num_binary(__VA_ARGS__) COMMA_SUCCESS)
2175 static bool bc_num_strValid(const char *val, size_t base)
2180 b = (BcDig)(base <= 10 ? base + '0' : base - 10 + 'A');
2187 if (radix) return false;
2191 if (c < '0' || c >= b || (c > '9' && c < 'A'))
2197 // Note: n is already "bc_num_zero()"ed,
2198 // leading zeroes in "val" are removed
2199 static void bc_num_parseDecimal(BcNum *n, const char *val)
2208 bc_num_expand(n, len);
2210 ptr = strchr(val, '.');
2214 n->rdx = (size_t)((val + len) - (ptr + 1));
2216 for (i = 0; val[i]; ++i) {
2217 if (val[i] != '0' && val[i] != '.') {
2218 // Not entirely zero value - convert it, and exit
2221 n->num[n->len] = val[i] - '0';
2225 if (val[--i] == '.') goto skip_dot;
2230 // if for() exits without hitting if(), the value is entirely zero
2233 // Note: n is already "bc_num_zero()"ed,
2234 // leading zeroes in "val" are removed
2235 static void bc_num_parseBase(BcNum *n, const char *val, unsigned base_t)
2238 BcNum temp, mult, result;
2244 for (i = 0; ; ++i) {
2247 if (val[i] != '.' && val[i] != '0')
2251 bc_num_init_DEF_SIZE(&temp);
2252 bc_num_init_DEF_SIZE(&mult);
2253 //TODO: have BcNumSmall type, with static buffer
2254 bc_num_init_DEF_SIZE(&base);
2255 bc_num_ulong2num(&base, base_t);
2259 if (c == '\0') goto int_err;
2260 if (c == '.') break;
2262 v = (unsigned long) (c <= '9' ? c - '0' : c - 'A' + 10);
2264 s = zbc_num_mul(n, &base, &mult, 0);
2265 if (s) goto int_err;
2266 bc_num_ulong2num(&temp, v);
2267 s = zbc_num_add(&mult, &temp, n, 0);
2268 if (s) goto int_err;
2271 bc_num_init(&result, base.len);
2272 //bc_num_zero(&result); - already is
2278 if (c == '\0') break;
2281 v = (unsigned long) (c <= '9' ? c - '0' : c - 'A' + 10);
2283 s = zbc_num_mul(&result, &base, &result, 0);
2285 bc_num_ulong2num(&temp, v);
2286 s = zbc_num_add(&result, &temp, &result, 0);
2288 s = zbc_num_mul(&mult, &base, &mult, 0);
2292 s = zbc_num_div(&result, &mult, &result, digits);
2294 s = zbc_num_add(n, &result, n, digits);
2298 if (n->rdx < digits)
2299 bc_num_extend(n, digits - n->rdx);
2303 bc_num_free(&result);
2310 static BC_STATUS zbc_num_parse(BcNum *n, const char *val, unsigned base_t)
2312 if (!bc_num_strValid(val, base_t))
2313 RETURN_STATUS(bc_error("bad number string"));
2316 while (*val == '0') val++;
2319 bc_num_parseDecimal(n, val);
2321 bc_num_parseBase(n, val, base_t);
2323 RETURN_STATUS(BC_STATUS_SUCCESS);
2325 #define zbc_num_parse(...) (zbc_num_parse(__VA_ARGS__) COMMA_SUCCESS)
2327 static BC_STATUS zbc_num_sqrt(BcNum *a, BcNum *restrict b, size_t scale)
2330 BcNum num1, num2, half, f, fprime, *x0, *x1, *temp;
2331 size_t pow, len, digs, digs1, resrdx, req, times = 0;
2332 ssize_t cmp = 1, cmp1 = SSIZE_MAX, cmp2 = SSIZE_MAX;
2334 req = BC_MAX(scale, a->rdx) + ((BC_NUM_INT(a) + 1) >> 1) + 1;
2335 bc_num_expand(b, req);
2338 bc_num_setToZero(b, scale);
2339 RETURN_STATUS(BC_STATUS_SUCCESS);
2342 RETURN_STATUS(bc_error("negative number"));
2344 if (BC_NUM_ONE(a)) {
2346 bc_num_extend(b, scale);
2347 RETURN_STATUS(BC_STATUS_SUCCESS);
2350 scale = BC_MAX(scale, a->rdx) + 1;
2351 len = a->len + scale;
2353 bc_num_init(&num1, len);
2354 bc_num_init(&num2, len);
2355 bc_num_init_DEF_SIZE(&half);
2361 bc_num_init(&f, len);
2362 bc_num_init(&fprime, len);
2368 pow = BC_NUM_INT(a);
2376 pow -= 2 - (pow & 1);
2378 bc_num_extend(x0, pow);
2380 // Make sure to move the radix back.
2384 x0->rdx = digs = digs1 = 0;
2386 len = BC_NUM_INT(x0) + resrdx - 1;
2388 while (cmp != 0 || digs < len) {
2389 s = zbc_num_div(a, x0, &f, resrdx);
2391 s = zbc_num_add(x0, &f, &fprime, resrdx);
2393 s = zbc_num_mul(&fprime, &half, x1, resrdx);
2396 cmp = bc_num_cmp(x1, x0);
2397 digs = x1->len - (unsigned long long) llabs(cmp);
2399 if (cmp == cmp2 && digs == digs1)
2404 resrdx += times > 4;
2417 if (b->rdx > scale) bc_num_truncate(b, b->rdx - scale);
2419 bc_num_free(&fprime);
2426 #define zbc_num_sqrt(...) (zbc_num_sqrt(__VA_ARGS__) COMMA_SUCCESS)
2428 static BC_STATUS zbc_num_divmod(BcNum *a, BcNum *b, BcNum *c, BcNum *d,
2434 size_t ts = BC_MAX(scale + b->rdx, a->rdx), len = BC_NUM_MREQ(a, b, ts);
2437 memcpy(&num2, c, sizeof(BcNum));
2439 bc_num_init(c, len);
2443 bc_num_expand(c, len);
2446 s = zbc_num_r(ptr_a, b, c, d, scale, ts);
2448 if (init) bc_num_free(&num2);
2452 #define zbc_num_divmod(...) (zbc_num_divmod(__VA_ARGS__) COMMA_SUCCESS)
2455 static BC_STATUS zbc_num_modexp(BcNum *a, BcNum *b, BcNum *c, BcNum *restrict d)
2458 BcNum base, exp, two, temp;
2461 RETURN_STATUS(bc_error("divide by zero"));
2462 if (a->rdx || b->rdx || c->rdx)
2463 RETURN_STATUS(bc_error("non integer number"));
2465 RETURN_STATUS(bc_error("negative number"));
2467 bc_num_expand(d, c->len);
2468 bc_num_init(&base, c->len);
2469 bc_num_init(&exp, b->len);
2470 bc_num_init_DEF_SIZE(&two);
2471 bc_num_init(&temp, b->len);
2477 s = zbc_num_rem(a, c, &base, 0);
2479 bc_num_copy(&exp, b);
2481 while (exp.len != 0) {
2482 s = zbc_num_divmod(&exp, &two, &exp, &temp, 0);
2485 if (BC_NUM_ONE(&temp)) {
2486 s = zbc_num_mul(d, &base, &temp, 0);
2488 s = zbc_num_rem(&temp, c, d, 0);
2492 s = zbc_num_mul(&base, &base, &temp, 0);
2494 s = zbc_num_rem(&temp, c, &base, 0);
2504 #define zbc_num_modexp(...) (zbc_num_modexp(__VA_ARGS__) COMMA_SUCCESS)
2508 static BC_STATUS zbc_func_insert(BcFunc *f, char *name, bool var)
2513 for (i = 0; i < f->autos.len; ++i) {
2514 if (strcmp(name, ((BcId *) bc_vec_item(&f->autos, i))->name) == 0)
2515 RETURN_STATUS(bc_error("function parameter or auto var has the same name as another"));
2521 bc_vec_push(&f->autos, &a);
2523 RETURN_STATUS(BC_STATUS_SUCCESS);
2525 #define zbc_func_insert(...) (zbc_func_insert(__VA_ARGS__) COMMA_SUCCESS)
2528 static void bc_func_init(BcFunc *f)
2530 bc_char_vec_init(&f->code);
2531 bc_vec_init(&f->autos, sizeof(BcId), bc_id_free);
2532 bc_vec_init(&f->labels, sizeof(size_t), NULL);
2536 static FAST_FUNC void bc_func_free(void *func)
2538 BcFunc *f = (BcFunc *) func;
2539 bc_vec_free(&f->code);
2540 bc_vec_free(&f->autos);
2541 bc_vec_free(&f->labels);
2544 static void bc_array_expand(BcVec *a, size_t len);
2546 static void bc_array_init(BcVec *a, bool nums)
2549 bc_vec_init(a, sizeof(BcNum), bc_num_free);
2551 bc_vec_init(a, sizeof(BcVec), bc_vec_free);
2552 bc_array_expand(a, 1);
2555 static void bc_array_expand(BcVec *a, size_t len)
2557 if (a->dtor == bc_num_free
2558 // && a->size == sizeof(BcNum) - always true
2561 while (len > a->len) {
2562 bc_num_init_DEF_SIZE(&n);
2567 while (len > a->len) {
2568 bc_array_init(&v, true);
2574 static void bc_array_copy(BcVec *d, const BcVec *s)
2579 bc_vec_expand(d, s->cap);
2582 for (i = 0; i < s->len; ++i) {
2583 BcNum *dnum = bc_vec_item(d, i), *snum = bc_vec_item(s, i);
2584 bc_num_init(dnum, snum->len);
2585 bc_num_copy(dnum, snum);
2589 static FAST_FUNC void bc_string_free(void *string)
2591 free(*((char **) string));
2595 static void bc_result_copy(BcResult *d, BcResult *src)
2600 case BC_RESULT_TEMP:
2601 case BC_RESULT_IBASE:
2602 case BC_RESULT_SCALE:
2603 case BC_RESULT_OBASE:
2604 bc_num_init(&d->d.n, src->d.n.len);
2605 bc_num_copy(&d->d.n, &src->d.n);
2608 case BC_RESULT_ARRAY:
2609 case BC_RESULT_ARRAY_ELEM:
2610 d->d.id.name = xstrdup(src->d.id.name);
2612 case BC_RESULT_CONSTANT:
2613 case BC_RESULT_LAST:
2616 memcpy(&d->d.n, &src->d.n, sizeof(BcNum));
2622 static FAST_FUNC void bc_result_free(void *result)
2624 BcResult *r = (BcResult *) result;
2627 case BC_RESULT_TEMP:
2628 case BC_RESULT_IBASE:
2629 case BC_RESULT_SCALE:
2630 case BC_RESULT_OBASE:
2631 bc_num_free(&r->d.n);
2634 case BC_RESULT_ARRAY:
2635 case BC_RESULT_ARRAY_ELEM:
2644 static void bc_lex_lineComment(BcLex *l)
2646 // Try: echo -n '#foo' | bc
2648 l->t.t = BC_LEX_WHITESPACE;
2650 while (i < l->len && l->buf[i] != '\n')
2655 static void bc_lex_whitespace(BcLex *l)
2657 l->t.t = BC_LEX_WHITESPACE;
2659 char c = l->buf[l->i];
2660 if (c == '\n') // this is BC_LEX_NLINE, not BC_LEX_WHITESPACE
2668 static BC_STATUS zbc_lex_number(BcLex *l, char start)
2670 const char *buf = l->buf + l->i;
2671 size_t len, i, ccnt;
2674 pt = (start == '.');
2675 l->t.t = BC_LEX_NUMBER;
2681 if (c == '\\' && buf[i + 1] == '\n') {
2683 //number_of_backslashes++ - see comment below
2686 if (!isdigit(c) && (c < 'A' || c > 'F')) {
2687 if (c != '.') break;
2688 // if '.' was already seen, stop on second one:
2692 // buf[i] is one of "0-9A-F."
2697 //ccnt is the number of chars in the number string, excluding possible
2698 //trailing "[\<newline>].[\<newline>]" (with any number of \<NL> repetitions).
2699 //i is buf[i] index of the first not-yet-parsed char after that.
2702 // This might overestimate the size, if there are "\<NL>"'s
2703 // in the number. Subtracting number_of_backslashes*2 correctly
2704 // is not that easy: consider that in the case of "NNN.\<NL>"
2705 // loop above will count "\<NL>" before it realizes it is not
2706 // in fact *inside* the number:
2707 len = ccnt + 1; // +1 byte for NUL termination
2709 // This check makes sense only if size_t is (much) larger than BC_MAX_NUM.
2710 if (SIZE_MAX > (BC_MAX_NUM | 0xff)) {
2711 if (len > BC_MAX_NUM)
2712 RETURN_STATUS(bc_error("number too long: must be [1,"BC_MAX_NUM_STR"]"));
2715 bc_vec_pop_all(&l->t.v);
2716 bc_vec_expand(&l->t.v, 1 + len);
2717 bc_vec_push(&l->t.v, &start);
2720 // If we have hit a backslash, skip it. We don't have
2721 // to check for a newline because it's guaranteed.
2727 bc_vec_push(&l->t.v, buf);
2732 bc_vec_pushZeroByte(&l->t.v);
2734 RETURN_STATUS(BC_STATUS_SUCCESS);
2736 #define zbc_lex_number(...) (zbc_lex_number(__VA_ARGS__) COMMA_SUCCESS)
2738 static void bc_lex_name(BcLex *l)
2743 l->t.t = BC_LEX_NAME;
2746 buf = l->buf + l->i - 1;
2749 if ((c < 'a' || c > 'z') && !isdigit(c) && c != '_') break;
2753 #if 0 // We do not protect against people with gigabyte-long names
2754 // This check makes sense only if size_t is (much) larger than BC_MAX_STRING.
2755 if (SIZE_MAX > (BC_MAX_STRING | 0xff)) {
2756 if (i > BC_MAX_STRING)
2757 return bc_error("name too long: must be [1,"BC_MAX_STRING_STR"]");
2760 bc_vec_string(&l->t.v, i, buf);
2762 // Increment the index. We minus 1 because it has already been incremented.
2765 //return BC_STATUS_SUCCESS;
2768 static void bc_lex_init(BcLex *l)
2770 bc_char_vec_init(&l->t.v);
2773 static void bc_lex_free(BcLex *l)
2775 bc_vec_free(&l->t.v);
2778 static void bc_lex_file(BcLex *l)
2780 G.err_line = l->line = 1;
2784 IF_BC(static BC_STATUS zbc_lex_token(BcLex *l);)
2785 IF_DC(static BC_STATUS zdc_lex_token(BcLex *l);)
2787 static BC_STATUS zcommon_lex_token(BcLex *l)
2790 IF_BC(RETURN_STATUS(zbc_lex_token(l));)
2792 IF_DC(RETURN_STATUS(zdc_lex_token(l));)
2794 #define zcommon_lex_token(...) (zcommon_lex_token(__VA_ARGS__) COMMA_SUCCESS)
2796 static bool bc_lex_more_input(BcLex *l)
2801 bc_vec_pop_all(&G.input_buffer);
2803 // This loop is complex because the vm tries not to send any lines that end
2804 // with a backslash to the parser. The reason for that is because the parser
2805 // treats a backslash+newline combo as whitespace, per the bc spec. In that
2806 // case, and for strings and comments, the parser will expect more stuff.
2810 size_t prevlen = G.input_buffer.len;
2813 bc_read_line(&G.input_buffer, G.input_fp);
2814 // No more input means EOF
2815 if (G.input_buffer.len <= prevlen + 1) // (we expect +1 for NUL byte)
2818 string = G.input_buffer.v + prevlen;
2821 if (string == G.input_buffer.v || string[-1] != '\\') {
2832 if (c == '/' && *string == '*') {
2837 if (c == '*' && *string == '/') {
2842 if (str != 0 || comment) {
2843 G.input_buffer.len--; // backstep over the trailing NUL byte
2847 // Check for backslash+newline.
2848 // we do not check that last char is '\n' -
2849 // if it is not, then it's EOF, and looping back
2850 // to bc_read_line() will detect it:
2852 if (string >= G.input_buffer.v && *string == '\\') {
2853 G.input_buffer.len--;
2860 l->buf = G.input_buffer.v;
2862 // bb_error_msg("G.input_buffer.len:%d '%s'", G.input_buffer.len, G.input_buffer.v);
2863 l->len = G.input_buffer.len - 1; // do not include NUL
2868 static BC_STATUS zbc_lex_next(BcLex *l)
2873 if (l->t.last == BC_LEX_EOF) RETURN_STATUS(bc_error("end of file"));
2875 l->line += l->newline;
2876 G.err_line = l->line;
2879 // Loop until failure or we don't have whitespace. This
2880 // is so the parser doesn't get inundated with whitespace.
2881 // Comments are also BC_LEX_WHITESPACE tokens and eaten here.
2882 s = BC_STATUS_SUCCESS;
2884 if (l->i == l->len) {
2885 l->t.t = BC_LEX_EOF;
2887 RETURN_STATUS(BC_STATUS_SUCCESS);
2888 if (!bc_lex_more_input(l)) {
2890 RETURN_STATUS(BC_STATUS_SUCCESS);
2892 // here it's guaranteed that l->i is below l->len
2894 dbg_lex("next string to parse:'%.*s'",
2895 (int)(strchrnul(l->buf + l->i, '\n') - (l->buf + l->i)),
2897 s = zcommon_lex_token(l);
2898 } while (!s && l->t.t == BC_LEX_WHITESPACE);
2899 dbg_lex("l->t.t from string:%d", l->t.t);
2903 #define zbc_lex_next(...) (zbc_lex_next(__VA_ARGS__) COMMA_SUCCESS)
2905 static BC_STATUS zbc_lex_skip_if_at_NLINE(BcLex *l)
2907 if (l->t.t == BC_LEX_NLINE)
2908 RETURN_STATUS(zbc_lex_next(l));
2909 RETURN_STATUS(BC_STATUS_SUCCESS);
2911 #define zbc_lex_skip_if_at_NLINE(...) (zbc_lex_skip_if_at_NLINE(__VA_ARGS__) COMMA_SUCCESS)
2913 static BC_STATUS zbc_lex_next_and_skip_NLINE(BcLex *l)
2916 s = zbc_lex_next(l);
2917 if (s) RETURN_STATUS(s);
2918 // if(cond)<newline>stmt is accepted too (but not 2+ newlines)
2919 s = zbc_lex_skip_if_at_NLINE(l);
2922 #define zbc_lex_next_and_skip_NLINE(...) (zbc_lex_next_and_skip_NLINE(__VA_ARGS__) COMMA_SUCCESS)
2924 static BC_STATUS zbc_lex_text_init(BcLex *l, const char *text)
2928 l->len = strlen(text);
2929 l->t.t = l->t.last = BC_LEX_INVALID;
2930 RETURN_STATUS(zbc_lex_next(l));
2932 #define zbc_lex_text_init(...) (zbc_lex_text_init(__VA_ARGS__) COMMA_SUCCESS)
2935 static BC_STATUS zbc_lex_identifier(BcLex *l)
2939 const char *buf = l->buf + l->i - 1;
2941 for (i = 0; i < ARRAY_SIZE(bc_lex_kws); ++i) {
2942 const char *keyword8 = bc_lex_kws[i].name8;
2944 while (buf[j] != '\0' && buf[j] == keyword8[j]) {
2946 if (j == 8) goto match;
2948 if (keyword8[j] != '\0')
2951 // buf starts with keyword bc_lex_kws[i]
2952 l->t.t = BC_LEX_KEY_1st_keyword + i;
2953 if (!bc_lex_kws_POSIX(i)) {
2954 s = bc_posix_error_fmt("%sthe '%.8s' keyword", "POSIX does not allow ", bc_lex_kws[i].name8);
2955 IF_ERROR_RETURN_POSSIBLE(if (s) RETURN_STATUS(s));
2958 // We minus 1 because the index has already been incremented.
2960 RETURN_STATUS(BC_STATUS_SUCCESS);
2964 s = BC_STATUS_SUCCESS;
2966 if (l->t.v.len > 2) {
2969 // bc: POSIX only allows one character names; the following is bad: 'qwe=1
2971 unsigned len = strchrnul(buf, '\n') - buf;
2972 s = bc_posix_error_fmt("POSIX only allows one character names; the following is bad: '%.*s'", len, buf);
2977 #define zbc_lex_identifier(...) (zbc_lex_identifier(__VA_ARGS__) COMMA_SUCCESS)
2979 static BC_STATUS zbc_lex_string(BcLex *l)
2983 l->t.t = BC_LEX_STR;
2991 RETURN_STATUS(bc_error("string end could not be found"));
3000 // This check makes sense only if size_t is (much) larger than BC_MAX_STRING.
3001 if (SIZE_MAX > (BC_MAX_STRING | 0xff)) {
3002 if (len > BC_MAX_STRING)
3003 RETURN_STATUS(bc_error("string too long: must be [1,"BC_MAX_STRING_STR"]"));
3005 bc_vec_string(&l->t.v, len, l->buf + l->i);
3009 G.err_line = l->line;
3011 RETURN_STATUS(BC_STATUS_SUCCESS);
3013 #define zbc_lex_string(...) (zbc_lex_string(__VA_ARGS__) COMMA_SUCCESS)
3015 static void bc_lex_assign(BcLex *l, unsigned with_and_without)
3017 if (l->buf[l->i] == '=') {
3019 with_and_without >>= 8; // store "with" value
3020 } // else store "without" value
3021 l->t.t = (with_and_without & 0xff);
3023 #define bc_lex_assign(l, with, without) \
3024 bc_lex_assign(l, ((with)<<8)|(without))
3026 static BC_STATUS zbc_lex_comment(BcLex *l)
3029 const char *buf = l->buf;
3031 l->t.t = BC_LEX_WHITESPACE;
3032 i = l->i; /* here buf[l->i] is the '*' of opening comment delimiter */
3044 RETURN_STATUS(bc_error("comment end could not be found"));
3051 G.err_line = l->line;
3053 RETURN_STATUS(BC_STATUS_SUCCESS);
3055 #define zbc_lex_comment(...) (zbc_lex_comment(__VA_ARGS__) COMMA_SUCCESS)
3057 static BC_STATUS zbc_lex_token(BcLex *l)
3059 BcStatus s = BC_STATUS_SUCCESS;
3060 char c = l->buf[l->i++], c2;
3062 // This is the workhorse of the lexer.
3064 // case '\0': // probably never reached
3066 // l->t.t = BC_LEX_EOF;
3067 // l->newline = true;
3070 l->t.t = BC_LEX_NLINE;
3078 bc_lex_whitespace(l);
3081 bc_lex_assign(l, BC_LEX_OP_REL_NE, BC_LEX_OP_BOOL_NOT);
3082 if (l->t.t == BC_LEX_OP_BOOL_NOT) {
3083 s = bc_POSIX_does_not_allow_bool_ops_this_is_bad("!");
3084 IF_ERROR_RETURN_POSSIBLE(if (s) RETURN_STATUS(s));
3088 s = zbc_lex_string(l);
3091 s = bc_POSIX_does_not_allow("'#' script comments");
3092 IF_ERROR_RETURN_POSSIBLE(if (s) RETURN_STATUS(s));
3093 bc_lex_lineComment(l);
3096 bc_lex_assign(l, BC_LEX_OP_ASSIGN_MODULUS, BC_LEX_OP_MODULUS);
3101 s = bc_POSIX_does_not_allow_bool_ops_this_is_bad("&&");
3102 IF_ERROR_RETURN_POSSIBLE(if (s) RETURN_STATUS(s));
3104 l->t.t = BC_LEX_OP_BOOL_AND;
3106 l->t.t = BC_LEX_INVALID;
3107 s = bc_error_bad_character('&');
3112 l->t.t = (BcLexType)(c - '(' + BC_LEX_LPAREN);
3115 bc_lex_assign(l, BC_LEX_OP_ASSIGN_MULTIPLY, BC_LEX_OP_MULTIPLY);
3121 l->t.t = BC_LEX_OP_INC;
3123 bc_lex_assign(l, BC_LEX_OP_ASSIGN_PLUS, BC_LEX_OP_PLUS);
3126 l->t.t = BC_LEX_COMMA;
3132 l->t.t = BC_LEX_OP_DEC;
3134 bc_lex_assign(l, BC_LEX_OP_ASSIGN_MINUS, BC_LEX_OP_MINUS);
3137 if (isdigit(l->buf[l->i]))
3138 s = zbc_lex_number(l, c);
3140 l->t.t = BC_LEX_KEY_LAST;
3141 s = bc_POSIX_does_not_allow("a period ('.') as a shortcut for the last result");
3147 s = zbc_lex_comment(l);
3149 bc_lex_assign(l, BC_LEX_OP_ASSIGN_DIVIDE, BC_LEX_OP_DIVIDE);
3167 s = zbc_lex_number(l, c);
3170 l->t.t = BC_LEX_SCOLON;
3173 bc_lex_assign(l, BC_LEX_OP_REL_LE, BC_LEX_OP_REL_LT);
3176 bc_lex_assign(l, BC_LEX_OP_REL_EQ, BC_LEX_OP_ASSIGN);
3179 bc_lex_assign(l, BC_LEX_OP_REL_GE, BC_LEX_OP_REL_GT);
3183 l->t.t = (BcLexType)(c - '[' + BC_LEX_LBRACKET);
3186 if (l->buf[l->i] == '\n') {
3187 l->t.t = BC_LEX_WHITESPACE;
3190 s = bc_error_bad_character(c);
3193 bc_lex_assign(l, BC_LEX_OP_ASSIGN_POWER, BC_LEX_OP_POWER);
3221 s = zbc_lex_identifier(l);
3225 l->t.t = (BcLexType)(c - '{' + BC_LEX_LBRACE);
3230 s = bc_POSIX_does_not_allow_bool_ops_this_is_bad("||");
3231 IF_ERROR_RETURN_POSSIBLE(if (s) RETURN_STATUS(s));
3233 l->t.t = BC_LEX_OP_BOOL_OR;
3235 l->t.t = BC_LEX_INVALID;
3236 s = bc_error_bad_character(c);
3240 l->t.t = BC_LEX_INVALID;
3241 s = bc_error_bad_character(c);
3250 static BC_STATUS zdc_lex_register(BcLex *l)
3252 if (isspace(l->buf[l->i - 1])) {
3253 bc_lex_whitespace(l);
3256 RETURN_STATUS(bc_error("extended register"));
3260 bc_vec_pop_all(&l->t.v);
3261 bc_vec_push(&l->t.v, &l->buf[l->i - 1]);
3262 bc_vec_pushZeroByte(&l->t.v);
3263 l->t.t = BC_LEX_NAME;
3266 RETURN_STATUS(BC_STATUS_SUCCESS);
3268 #define zdc_lex_register(...) (zdc_lex_register(__VA_ARGS__) COMMA_SUCCESS)
3270 static BC_STATUS zdc_lex_string(BcLex *l)
3272 size_t depth, nls, i;
3274 l->t.t = BC_LEX_STR;
3275 bc_vec_pop_all(&l->t.v);
3284 RETURN_STATUS(bc_error("string end could not be found"));
3287 if (i == l->i || l->buf[i - 1] != '\\') {
3288 if (c == '[') depth++;
3293 bc_vec_push(&l->t.v, &l->buf[i]);
3298 bc_vec_pushZeroByte(&l->t.v);
3299 // This check makes sense only if size_t is (much) larger than BC_MAX_STRING.
3300 if (SIZE_MAX > (BC_MAX_STRING | 0xff)) {
3301 if (i - l->i > BC_MAX_STRING)
3302 RETURN_STATUS(bc_error("string too long: must be [1,"BC_MAX_STRING_STR"]"));
3307 G.err_line = l->line;
3309 RETURN_STATUS(BC_STATUS_SUCCESS);
3311 #define zdc_lex_string(...) (zdc_lex_string(__VA_ARGS__) COMMA_SUCCESS)
3313 static BC_STATUS zdc_lex_token(BcLex *l)
3315 static const //BcLexType - should be this type, but narrower type saves size:
3318 BC_LEX_OP_REL_EQ, BC_LEX_OP_REL_LE, BC_LEX_OP_REL_GE, BC_LEX_OP_REL_NE,
3319 BC_LEX_OP_REL_LT, BC_LEX_OP_REL_GT, BC_LEX_SCOLON, BC_LEX_COLON,
3320 BC_LEX_ELSE, BC_LEX_LOAD, BC_LEX_LOAD_POP, BC_LEX_OP_ASSIGN,
3323 static const //BcLexType - should be this type
3327 BC_LEX_OP_MODULUS, BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_LPAREN,
3329 BC_LEX_INVALID, BC_LEX_OP_MULTIPLY, BC_LEX_OP_PLUS, BC_LEX_INVALID,
3331 BC_LEX_OP_MINUS, BC_LEX_INVALID, BC_LEX_OP_DIVIDE,
3333 BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID,
3334 BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID,
3335 BC_LEX_INVALID, BC_LEX_INVALID,
3337 BC_LEX_COLON, BC_LEX_SCOLON, BC_LEX_OP_REL_GT, BC_LEX_OP_REL_EQ,
3338 BC_LEX_OP_REL_LT, BC_LEX_KEY_READ, BC_LEX_INVALID,
3340 BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID,
3341 BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_EQ_NO_REG, BC_LEX_INVALID,
3343 BC_LEX_KEY_IBASE, BC_LEX_INVALID, BC_LEX_KEY_SCALE, BC_LEX_LOAD_POP,
3344 BC_LEX_INVALID, BC_LEX_OP_BOOL_NOT, BC_LEX_KEY_OBASE, BC_LEX_PRINT_STREAM,
3346 BC_LEX_NQUIT, BC_LEX_POP, BC_LEX_STORE_PUSH, BC_LEX_INVALID, BC_LEX_INVALID,
3347 BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_SCALE_FACTOR, BC_LEX_INVALID,
3349 BC_LEX_KEY_LENGTH, BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID,
3351 BC_LEX_OP_POWER, BC_LEX_NEG, BC_LEX_INVALID,
3353 BC_LEX_ASCIIFY, BC_LEX_INVALID, BC_LEX_CLEAR_STACK, BC_LEX_DUPLICATE,
3354 BC_LEX_ELSE, BC_LEX_PRINT_STACK, BC_LEX_INVALID, BC_LEX_INVALID,
3356 BC_LEX_STORE_IBASE, BC_LEX_INVALID, BC_LEX_STORE_SCALE, BC_LEX_LOAD,
3357 BC_LEX_INVALID, BC_LEX_PRINT_POP, BC_LEX_STORE_OBASE, BC_LEX_KEY_PRINT,
3359 BC_LEX_KEY_QUIT, BC_LEX_SWAP, BC_LEX_OP_ASSIGN, BC_LEX_INVALID,
3360 BC_LEX_INVALID, BC_LEX_KEY_SQRT, BC_LEX_INVALID, BC_LEX_EXECUTE,
3362 BC_LEX_INVALID, BC_LEX_STACK_LEVEL,
3364 BC_LEX_LBRACE, BC_LEX_OP_MODEXP, BC_LEX_INVALID, BC_LEX_OP_DIVMOD,
3367 BcStatus s = BC_STATUS_SUCCESS;
3368 char c = l->buf[l->i++], c2;
3371 for (i = 0; i < ARRAY_SIZE(dc_lex_regs); ++i) {
3372 if (l->t.last == dc_lex_regs[i])
3373 RETURN_STATUS(zdc_lex_register(l));
3376 if (c >= '%' && c <= '~'
3377 && (l->t.t = dc_lex_tokens[c - '%']) != BC_LEX_INVALID
3382 // This is the workhorse of the lexer.
3384 // case '\0': // probably never reached
3385 // l->t.t = BC_LEX_EOF;
3393 l->newline = (c == '\n');
3394 bc_lex_whitespace(l);
3399 l->t.t = BC_LEX_OP_REL_NE;
3401 l->t.t = BC_LEX_OP_REL_LE;
3403 l->t.t = BC_LEX_OP_REL_GE;
3405 RETURN_STATUS(bc_error_bad_character(c));
3409 bc_lex_lineComment(l);
3412 if (isdigit(l->buf[l->i]))
3413 s = zbc_lex_number(l, c);
3415 s = bc_error_bad_character(c);
3433 s = zbc_lex_number(l, c);
3436 s = zdc_lex_string(l);
3439 l->t.t = BC_LEX_INVALID;
3440 s = bc_error_bad_character(c);
3448 static void bc_program_addFunc(char *name, size_t *idx);
3450 static void bc_parse_addFunc(BcParse *p, char *name, size_t *idx)
3452 bc_program_addFunc(name, idx);
3453 p->func = bc_program_func(p->fidx);
3456 static void bc_parse_push(BcParse *p, char i)
3458 dbg_compile("%s:%d pushing bytecode %zd:%d", __func__, __LINE__, p->func->code.len, i);
3459 bc_vec_pushByte(&p->func->code, i);
3462 static void bc_parse_pushName(BcParse *p, char *name)
3465 bc_parse_push(p, *name++);
3466 bc_parse_push(p, BC_PARSE_STREND);
3469 static void bc_parse_pushIndex(BcParse *p, size_t idx)
3474 dbg_lex("%s:%d pushing index %zd", __func__, __LINE__, idx);
3475 mask = ((size_t)0xff) << (sizeof(idx) * 8 - 8);
3478 if (idx & mask) break;
3483 bc_parse_push(p, amt);
3486 bc_parse_push(p, (unsigned char)idx);
3491 static void bc_parse_pushJUMP(BcParse *p, size_t idx)
3493 bc_parse_push(p, BC_INST_JUMP);
3494 bc_parse_pushIndex(p, idx);
3497 static void bc_parse_pushJUMP_ZERO(BcParse *p, size_t idx)
3499 bc_parse_push(p, BC_INST_JUMP_ZERO);
3500 bc_parse_pushIndex(p, idx);
3503 static void bc_parse_number(BcParse *p)
3505 char *num = xstrdup(p->l.t.v.v);
3506 size_t idx = G.prog.consts.len;
3508 bc_vec_push(&G.prog.consts, &num);
3510 bc_parse_push(p, BC_INST_NUM);
3511 bc_parse_pushIndex(p, idx);
3514 IF_BC(static BC_STATUS zbc_parse_stmt_or_funcdef(BcParse *p);)
3515 IF_DC(static BC_STATUS zdc_parse_parse(BcParse *p);)
3517 // "Parse" half of "parse,execute,repeat" main loop
3518 static BC_STATUS zcommon_parse(BcParse *p)
3521 // FIXME: "eating" of stmt delemiters is coded inconsistently
3522 // (sometimes zbc_parse_stmt() eats the delimiter, sometimes don't),
3523 // which causes bugs such as "print 1 print 2" erroneously accepted,
3524 // or "print 1 else 2" detecting parse error only after executing
3526 IF_BC(RETURN_STATUS(zbc_parse_stmt_or_funcdef(p));)
3528 IF_DC(RETURN_STATUS(zdc_parse_parse(p));)
3530 #define zcommon_parse(...) (zcommon_parse(__VA_ARGS__) COMMA_SUCCESS)
3532 static BC_STATUS zbc_parse_text_init(BcParse *p, const char *text)
3534 p->func = bc_program_func(p->fidx);
3536 RETURN_STATUS(zbc_lex_text_init(&p->l, text));
3538 #define zbc_parse_text_init(...) (zbc_parse_text_init(__VA_ARGS__) COMMA_SUCCESS)
3540 // Called when parsing or execution detects a failure,
3541 // resets execution structures.
3542 static void bc_program_reset(void)
3547 bc_vec_npop(&G.prog.exestack, G.prog.exestack.len - 1);
3548 bc_vec_pop_all(&G.prog.results);
3550 f = bc_program_func(0);
3551 ip = bc_vec_top(&G.prog.exestack);
3552 ip->idx = f->code.len;
3555 #define bc_parse_updateFunc(p, f) \
3556 ((p)->func = bc_program_func((p)->fidx = (f)))
3558 // Called when zbc/zdc_parse_parse() detects a failure,
3559 // resets parsing structures.
3560 static void bc_parse_reset(BcParse *p)
3562 if (p->fidx != BC_PROG_MAIN) {
3563 p->func->nparams = 0;
3564 bc_vec_pop_all(&p->func->code);
3565 bc_vec_pop_all(&p->func->autos);
3566 bc_vec_pop_all(&p->func->labels);
3568 bc_parse_updateFunc(p, BC_PROG_MAIN);
3572 p->l.t.t = BC_LEX_EOF;
3574 bc_vec_pop_all(&p->exits);
3575 bc_vec_pop_all(&p->conds);
3576 bc_vec_pop_all(&p->ops);
3581 static void bc_parse_free(BcParse *p)
3583 bc_vec_free(&p->exits);
3584 bc_vec_free(&p->conds);
3585 bc_vec_free(&p->ops);
3589 static void bc_parse_create(BcParse *p, size_t func)
3591 memset(p, 0, sizeof(BcParse));
3594 bc_vec_init(&p->exits, sizeof(size_t), NULL);
3595 bc_vec_init(&p->conds, sizeof(size_t), NULL);
3596 bc_vec_init(&p->ops, sizeof(BcLexType), NULL);
3598 bc_parse_updateFunc(p, func);
3603 #define BC_PARSE_TOP_OP(p) (*((BcLexType *) bc_vec_top(&(p)->ops)))
3604 #define BC_PARSE_LEAF(p, rparen) \
3605 (((p) >= BC_INST_NUM && (p) <= BC_INST_SQRT) || (rparen) || \
3606 (p) == BC_INST_INC_POST || (p) == BC_INST_DEC_POST)
3608 // We can calculate the conversion between tokens and exprs by subtracting the
3609 // position of the first operator in the lex enum and adding the position of the
3610 // first in the expr enum. Note: This only works for binary operators.
3611 #define BC_TOKEN_2_INST(t) ((char) ((t) - BC_LEX_NEG + BC_INST_NEG))
3613 static BcStatus bc_parse_expr_empty_ok(BcParse *p, uint8_t flags);
3615 static BC_STATUS zbc_parse_expr(BcParse *p, uint8_t flags)
3619 s = bc_parse_expr_empty_ok(p, flags);
3620 if (s == BC_STATUS_PARSE_EMPTY_EXP)
3621 RETURN_STATUS(bc_error("empty expression"));
3624 #define zbc_parse_expr(...) (zbc_parse_expr(__VA_ARGS__) COMMA_SUCCESS)
3626 static BC_STATUS zbc_parse_stmt_possibly_auto(BcParse *p, bool auto_allowed);
3627 #define zbc_parse_stmt_possibly_auto(...) (zbc_parse_stmt_possibly_auto(__VA_ARGS__) COMMA_SUCCESS)
3629 static BC_STATUS zbc_parse_stmt(BcParse *p)
3631 RETURN_STATUS(zbc_parse_stmt_possibly_auto(p, false));
3633 #define zbc_parse_stmt(...) (zbc_parse_stmt(__VA_ARGS__) COMMA_SUCCESS)
3635 static BC_STATUS zbc_parse_stmt_allow_NLINE_before(BcParse *p, const char *after_X)
3637 // "if(cond)<newline>stmt" is accepted too, but not 2+ newlines.
3638 // Same for "else", "while()", "for()".
3639 BcStatus s = zbc_lex_next_and_skip_NLINE(&p->l);
3640 if (s) RETURN_STATUS(s);
3641 if (p->l.t.t == BC_LEX_NLINE)
3642 RETURN_STATUS(bc_error_fmt("no statement after '%s'", after_X));
3644 RETURN_STATUS(zbc_parse_stmt(p));
3646 #define zbc_parse_stmt_allow_NLINE_before(...) (zbc_parse_stmt_allow_NLINE_before(__VA_ARGS__) COMMA_SUCCESS)
3648 static void bc_parse_operator(BcParse *p, BcLexType type, size_t start,
3651 char l, r = bc_parse_op_PREC(type - BC_LEX_OP_INC);
3652 bool left = bc_parse_op_LEFT(type - BC_LEX_OP_INC);
3654 while (p->ops.len > start) {
3655 BcLexType t = BC_PARSE_TOP_OP(p);
3656 if (t == BC_LEX_LPAREN) break;
3658 l = bc_parse_op_PREC(t - BC_LEX_OP_INC);
3659 if (l >= r && (l != r || !left)) break;
3661 bc_parse_push(p, BC_TOKEN_2_INST(t));
3662 bc_vec_pop(&p->ops);
3663 *nexprs -= (t != BC_LEX_OP_BOOL_NOT && t != BC_LEX_NEG);
3666 bc_vec_push(&p->ops, &type);
3669 static BC_STATUS zbc_parse_rightParen(BcParse *p, size_t ops_bgn, size_t *nexs)
3673 if (p->ops.len <= ops_bgn)
3674 RETURN_STATUS(bc_error_bad_expression());
3675 top = BC_PARSE_TOP_OP(p);
3677 while (top != BC_LEX_LPAREN) {
3678 bc_parse_push(p, BC_TOKEN_2_INST(top));
3680 bc_vec_pop(&p->ops);
3681 *nexs -= top != BC_LEX_OP_BOOL_NOT && top != BC_LEX_NEG;
3683 if (p->ops.len <= ops_bgn)
3684 RETURN_STATUS(bc_error_bad_expression());
3685 top = BC_PARSE_TOP_OP(p);
3688 bc_vec_pop(&p->ops);
3690 RETURN_STATUS(zbc_lex_next(&p->l));
3692 #define zbc_parse_rightParen(...) (zbc_parse_rightParen(__VA_ARGS__) COMMA_SUCCESS)
3694 static BC_STATUS zbc_parse_params(BcParse *p, uint8_t flags)
3699 dbg_lex("%s:%d p->l.t.t:%d", __func__, __LINE__, p->l.t.t);
3700 flags = (flags & ~(BC_PARSE_PRINT | BC_PARSE_REL)) | BC_PARSE_ARRAY;
3702 s = zbc_lex_next(&p->l);
3703 if (s) RETURN_STATUS(s);
3706 if (p->l.t.t != BC_LEX_RPAREN) {
3708 s = zbc_parse_expr(p, flags);
3709 if (s) RETURN_STATUS(s);
3711 if (p->l.t.t != BC_LEX_COMMA) {
3712 if (p->l.t.t == BC_LEX_RPAREN)
3714 RETURN_STATUS(bc_error_bad_token());
3716 s = zbc_lex_next(&p->l);
3717 if (s) RETURN_STATUS(s);
3721 bc_parse_push(p, BC_INST_CALL);
3722 bc_parse_pushIndex(p, nparams);
3724 RETURN_STATUS(BC_STATUS_SUCCESS);
3726 #define zbc_parse_params(...) (zbc_parse_params(__VA_ARGS__) COMMA_SUCCESS)
3728 static BC_STATUS zbc_parse_call(BcParse *p, char *name, uint8_t flags)
3731 BcId entry, *entry_ptr;
3736 s = zbc_parse_params(p, flags);
3739 if (p->l.t.t != BC_LEX_RPAREN) {
3740 s = bc_error_bad_token();
3744 idx = bc_map_index(&G.prog.fn_map, &entry);
3746 if (idx == BC_VEC_INVALID_IDX) {
3747 name = xstrdup(entry.name);
3748 bc_parse_addFunc(p, name, &idx);
3749 idx = bc_map_index(&G.prog.fn_map, &entry);
3754 entry_ptr = bc_vec_item(&G.prog.fn_map, idx);
3755 bc_parse_pushIndex(p, entry_ptr->idx);
3757 RETURN_STATUS(zbc_lex_next(&p->l));
3762 #define zbc_parse_call(...) (zbc_parse_call(__VA_ARGS__) COMMA_SUCCESS)
3764 static BC_STATUS zbc_parse_name(BcParse *p, BcInst *type, uint8_t flags)
3769 name = xstrdup(p->l.t.v.v);
3770 s = zbc_lex_next(&p->l);
3773 if (p->l.t.t == BC_LEX_LBRACKET) {
3774 s = zbc_lex_next(&p->l);
3777 if (p->l.t.t == BC_LEX_RBRACKET) {
3778 if (!(flags & BC_PARSE_ARRAY)) {
3779 s = bc_error_bad_expression();
3782 *type = BC_INST_ARRAY;
3784 *type = BC_INST_ARRAY_ELEM;
3785 flags &= ~(BC_PARSE_PRINT | BC_PARSE_REL);
3786 s = zbc_parse_expr(p, flags);
3789 s = zbc_lex_next(&p->l);
3791 bc_parse_push(p, *type);
3792 bc_parse_pushName(p, name);
3794 } else if (p->l.t.t == BC_LEX_LPAREN) {
3795 if (flags & BC_PARSE_NOCALL) {
3796 s = bc_error_bad_token();
3799 *type = BC_INST_CALL;
3800 s = zbc_parse_call(p, name, flags);
3802 *type = BC_INST_VAR;
3803 bc_parse_push(p, BC_INST_VAR);
3804 bc_parse_pushName(p, name);
3813 #define zbc_parse_name(...) (zbc_parse_name(__VA_ARGS__) COMMA_SUCCESS)
3815 static BC_STATUS zbc_parse_read(BcParse *p)
3819 s = zbc_lex_next(&p->l);
3820 if (s) RETURN_STATUS(s);
3821 if (p->l.t.t != BC_LEX_LPAREN) RETURN_STATUS(bc_error_bad_token());
3823 s = zbc_lex_next(&p->l);
3824 if (s) RETURN_STATUS(s);
3825 if (p->l.t.t != BC_LEX_RPAREN) RETURN_STATUS(bc_error_bad_token());
3827 bc_parse_push(p, BC_INST_READ);
3829 RETURN_STATUS(zbc_lex_next(&p->l));
3831 #define zbc_parse_read(...) (zbc_parse_read(__VA_ARGS__) COMMA_SUCCESS)
3833 static BC_STATUS zbc_parse_builtin(BcParse *p, BcLexType type, uint8_t flags,
3838 s = zbc_lex_next(&p->l);
3839 if (s) RETURN_STATUS(s);
3840 if (p->l.t.t != BC_LEX_LPAREN) RETURN_STATUS(bc_error_bad_token());
3842 flags = (flags & ~(BC_PARSE_PRINT | BC_PARSE_REL)) | BC_PARSE_ARRAY;
3844 s = zbc_lex_next(&p->l);
3845 if (s) RETURN_STATUS(s);
3847 s = zbc_parse_expr(p, flags);
3848 if (s) RETURN_STATUS(s);
3850 if (p->l.t.t != BC_LEX_RPAREN) RETURN_STATUS(bc_error_bad_token());
3852 *prev = (type == BC_LEX_KEY_LENGTH) ? BC_INST_LENGTH : BC_INST_SQRT;
3853 bc_parse_push(p, *prev);
3855 RETURN_STATUS(zbc_lex_next(&p->l));
3857 #define zbc_parse_builtin(...) (zbc_parse_builtin(__VA_ARGS__) COMMA_SUCCESS)
3859 static BC_STATUS zbc_parse_scale(BcParse *p, BcInst *type, uint8_t flags)
3863 s = zbc_lex_next(&p->l);
3864 if (s) RETURN_STATUS(s);
3866 if (p->l.t.t != BC_LEX_LPAREN) {
3867 *type = BC_INST_SCALE;
3868 bc_parse_push(p, BC_INST_SCALE);
3869 RETURN_STATUS(BC_STATUS_SUCCESS);
3872 *type = BC_INST_SCALE_FUNC;
3873 flags &= ~(BC_PARSE_PRINT | BC_PARSE_REL);
3875 s = zbc_lex_next(&p->l);
3876 if (s) RETURN_STATUS(s);
3878 s = zbc_parse_expr(p, flags);
3879 if (s) RETURN_STATUS(s);
3880 if (p->l.t.t != BC_LEX_RPAREN)
3881 RETURN_STATUS(bc_error_bad_token());
3882 bc_parse_push(p, BC_INST_SCALE_FUNC);
3884 RETURN_STATUS(zbc_lex_next(&p->l));
3886 #define zbc_parse_scale(...) (zbc_parse_scale(__VA_ARGS__) COMMA_SUCCESS)
3888 static BC_STATUS zbc_parse_incdec(BcParse *p, BcInst *prev, bool *paren_expr,
3889 size_t *nexprs, uint8_t flags)
3894 BcInst etype = *prev;
3896 if (etype == BC_INST_VAR || etype == BC_INST_ARRAY_ELEM
3897 || etype == BC_INST_SCALE || etype == BC_INST_LAST
3898 || etype == BC_INST_IBASE || etype == BC_INST_OBASE
3900 *prev = inst = BC_INST_INC_POST + (p->l.t.t != BC_LEX_OP_INC);
3901 bc_parse_push(p, inst);
3902 s = zbc_lex_next(&p->l);
3904 *prev = inst = BC_INST_INC_PRE + (p->l.t.t != BC_LEX_OP_INC);
3907 s = zbc_lex_next(&p->l);
3908 if (s) RETURN_STATUS(s);
3911 // Because we parse the next part of the expression
3912 // right here, we need to increment this.
3913 *nexprs = *nexprs + 1;
3917 s = zbc_parse_name(p, prev, flags | BC_PARSE_NOCALL);
3919 case BC_LEX_KEY_IBASE:
3920 case BC_LEX_KEY_LAST:
3921 case BC_LEX_KEY_OBASE:
3922 bc_parse_push(p, type - BC_LEX_KEY_IBASE + BC_INST_IBASE);
3923 s = zbc_lex_next(&p->l);
3925 case BC_LEX_KEY_SCALE:
3926 s = zbc_lex_next(&p->l);
3927 if (s) RETURN_STATUS(s);
3928 if (p->l.t.t == BC_LEX_LPAREN)
3929 s = bc_error_bad_token();
3931 bc_parse_push(p, BC_INST_SCALE);
3934 s = bc_error_bad_token();
3938 if (!s) bc_parse_push(p, inst);
3943 #define zbc_parse_incdec(...) (zbc_parse_incdec(__VA_ARGS__) COMMA_SUCCESS)
3945 static BC_STATUS zbc_parse_minus(BcParse *p, BcInst *prev, size_t ops_bgn,
3946 bool rparen, size_t *nexprs)
3950 BcInst etype = *prev;
3952 s = zbc_lex_next(&p->l);
3953 if (s) RETURN_STATUS(s);
3955 type = rparen || etype == BC_INST_INC_POST || etype == BC_INST_DEC_POST ||
3956 (etype >= BC_INST_NUM && etype <= BC_INST_SQRT) ?
3959 *prev = BC_TOKEN_2_INST(type);
3961 // We can just push onto the op stack because this is the largest
3962 // precedence operator that gets pushed. Inc/dec does not.
3963 if (type != BC_LEX_OP_MINUS)
3964 bc_vec_push(&p->ops, &type);
3966 bc_parse_operator(p, type, ops_bgn, nexprs);
3970 #define zbc_parse_minus(...) (zbc_parse_minus(__VA_ARGS__) COMMA_SUCCESS)
3972 static BC_STATUS zbc_parse_string(BcParse *p, char inst)
3974 char *str = xstrdup(p->l.t.v.v);
3976 bc_parse_push(p, BC_INST_STR);
3977 bc_parse_pushIndex(p, G.prog.strs.len);
3978 bc_vec_push(&G.prog.strs, &str);
3979 bc_parse_push(p, inst);
3981 RETURN_STATUS(zbc_lex_next(&p->l));
3983 #define zbc_parse_string(...) (zbc_parse_string(__VA_ARGS__) COMMA_SUCCESS)
3985 static BC_STATUS zbc_parse_print(BcParse *p)
3991 s = zbc_lex_next(&p->l);
3992 if (s) RETURN_STATUS(s);
3994 if (type == BC_LEX_STR) {
3995 s = zbc_parse_string(p, BC_INST_PRINT_POP);
3997 s = zbc_parse_expr(p, 0);
3998 bc_parse_push(p, BC_INST_PRINT_POP);
4000 if (s) RETURN_STATUS(s);
4001 if (p->l.t.t != BC_LEX_COMMA)
4007 #define zbc_parse_print(...) (zbc_parse_print(__VA_ARGS__) COMMA_SUCCESS)
4009 static BC_STATUS zbc_parse_return(BcParse *p)
4014 dbg_lex_enter("%s:%d entered", __func__, __LINE__);
4015 s = zbc_lex_next(&p->l);
4016 if (s) RETURN_STATUS(s);
4019 if (t == BC_LEX_NLINE || t == BC_LEX_SCOLON)
4020 bc_parse_push(p, BC_INST_RET0);
4022 bool paren = (t == BC_LEX_LPAREN);
4023 s = bc_parse_expr_empty_ok(p, 0);
4024 if (s == BC_STATUS_PARSE_EMPTY_EXP) {
4025 bc_parse_push(p, BC_INST_RET0);
4026 s = zbc_lex_next(&p->l);
4028 if (s) RETURN_STATUS(s);
4030 if (!paren || p->l.t.last != BC_LEX_RPAREN) {
4031 s = bc_POSIX_requires("parentheses around return expressions");
4032 IF_ERROR_RETURN_POSSIBLE(if (s) RETURN_STATUS(s));
4035 bc_parse_push(p, BC_INST_RET);
4038 dbg_lex_done("%s:%d done", __func__, __LINE__);
4041 #define zbc_parse_return(...) (zbc_parse_return(__VA_ARGS__) COMMA_SUCCESS)
4043 static void rewrite_label_to_current(BcParse *p, size_t idx)
4045 size_t *label = bc_vec_item(&p->func->labels, idx);
4046 *label = p->func->code.len;
4049 static BC_STATUS zbc_parse_if(BcParse *p)
4054 dbg_lex_enter("%s:%d entered", __func__, __LINE__);
4055 s = zbc_lex_next(&p->l);
4056 if (s) RETURN_STATUS(s);
4057 if (p->l.t.t != BC_LEX_LPAREN) RETURN_STATUS(bc_error_bad_token());
4059 s = zbc_lex_next(&p->l);
4060 if (s) RETURN_STATUS(s);
4061 s = zbc_parse_expr(p, BC_PARSE_REL);
4062 if (s) RETURN_STATUS(s);
4064 if (p->l.t.t != BC_LEX_RPAREN) RETURN_STATUS(bc_error_bad_token());
4066 ip_idx = p->func->labels.len;
4067 bc_parse_pushJUMP_ZERO(p, ip_idx);
4068 bc_vec_push(&p->func->labels, &ip_idx);
4070 s = zbc_parse_stmt_allow_NLINE_before(p, STRING_if);
4071 if (s) RETURN_STATUS(s);
4073 dbg_lex("%s:%d in if after stmt: p->l.t.t:%d", __func__, __LINE__, p->l.t.t);
4074 if (p->l.t.t == BC_LEX_KEY_ELSE) {
4077 ip2_idx = p->func->labels.len;
4079 dbg_lex("%s:%d after if() body: BC_INST_JUMP to %zd", __func__, __LINE__, ip2_idx);
4080 bc_parse_pushJUMP(p, ip2_idx);
4082 dbg_lex("%s:%d rewriting 'if_zero' label to jump to 'else'-> %zd", __func__, __LINE__, p->func->code.len);
4083 rewrite_label_to_current(p, ip_idx);
4085 bc_vec_push(&p->func->labels, &ip2_idx);
4088 s = zbc_parse_stmt_allow_NLINE_before(p, STRING_else);
4089 if (s) RETURN_STATUS(s);
4092 dbg_lex("%s:%d rewriting label to jump after 'if' body-> %zd", __func__, __LINE__, p->func->code.len);
4093 rewrite_label_to_current(p, ip_idx);
4095 dbg_lex_done("%s:%d done", __func__, __LINE__);
4098 #define zbc_parse_if(...) (zbc_parse_if(__VA_ARGS__) COMMA_SUCCESS)
4100 static BC_STATUS zbc_parse_while(BcParse *p)
4106 s = zbc_lex_next(&p->l);
4107 if (s) RETURN_STATUS(s);
4108 if (p->l.t.t != BC_LEX_LPAREN) RETURN_STATUS(bc_error_bad_token());
4109 s = zbc_lex_next(&p->l);
4110 if (s) RETURN_STATUS(s);
4112 cond_idx = p->func->labels.len;
4113 ip_idx = cond_idx + 1;
4115 bc_vec_push(&p->func->labels, &p->func->code.len);
4116 bc_vec_push(&p->conds, &cond_idx);
4118 bc_vec_push(&p->exits, &ip_idx);
4119 bc_vec_push(&p->func->labels, &ip_idx);
4121 s = zbc_parse_expr(p, BC_PARSE_REL);
4122 if (s) RETURN_STATUS(s);
4123 if (p->l.t.t != BC_LEX_RPAREN) RETURN_STATUS(bc_error_bad_token());
4125 bc_parse_pushJUMP_ZERO(p, ip_idx);
4127 s = zbc_parse_stmt_allow_NLINE_before(p, STRING_while);
4128 if (s) RETURN_STATUS(s);
4130 dbg_lex("%s:%d BC_INST_JUMP to %zd", __func__, __LINE__, cond_idx);
4131 bc_parse_pushJUMP(p, cond_idx);
4133 dbg_lex("%s:%d rewriting label-> %zd", __func__, __LINE__, p->func->code.len);
4134 rewrite_label_to_current(p, ip_idx);
4136 bc_vec_pop(&p->exits);
4137 bc_vec_pop(&p->conds);
4141 #define zbc_parse_while(...) (zbc_parse_while(__VA_ARGS__) COMMA_SUCCESS)
4143 static BC_STATUS zbc_parse_for(BcParse *p)
4146 size_t cond_idx, exit_idx, body_idx, update_idx;
4148 dbg_lex("%s:%d p->l.t.t:%d", __func__, __LINE__, p->l.t.t);
4149 s = zbc_lex_next(&p->l);
4150 if (s) RETURN_STATUS(s);
4151 if (p->l.t.t != BC_LEX_LPAREN) RETURN_STATUS(bc_error_bad_token());
4152 s = zbc_lex_next(&p->l);
4153 if (s) RETURN_STATUS(s);
4155 if (p->l.t.t != BC_LEX_SCOLON)
4156 s = zbc_parse_expr(p, 0);
4158 s = bc_POSIX_does_not_allow_empty_X_expression_in_for("init");
4160 if (s) RETURN_STATUS(s);
4161 if (p->l.t.t != BC_LEX_SCOLON) RETURN_STATUS(bc_error_bad_token());
4162 s = zbc_lex_next(&p->l);
4163 if (s) RETURN_STATUS(s);
4165 cond_idx = p->func->labels.len;
4166 update_idx = cond_idx + 1;
4167 body_idx = update_idx + 1;
4168 exit_idx = body_idx + 1;
4170 bc_vec_push(&p->func->labels, &p->func->code.len);
4172 if (p->l.t.t != BC_LEX_SCOLON)
4173 s = zbc_parse_expr(p, BC_PARSE_REL);
4175 s = bc_POSIX_does_not_allow_empty_X_expression_in_for("condition");
4177 if (s) RETURN_STATUS(s);
4178 if (p->l.t.t != BC_LEX_SCOLON) RETURN_STATUS(bc_error_bad_token());
4180 s = zbc_lex_next(&p->l);
4181 if (s) RETURN_STATUS(s);
4183 bc_parse_pushJUMP_ZERO(p, exit_idx);
4184 bc_parse_pushJUMP(p, body_idx);
4186 bc_vec_push(&p->conds, &update_idx);
4187 bc_vec_push(&p->func->labels, &p->func->code.len);
4189 if (p->l.t.t != BC_LEX_RPAREN)
4190 s = zbc_parse_expr(p, 0);
4192 s = bc_POSIX_does_not_allow_empty_X_expression_in_for("update");
4194 if (s) RETURN_STATUS(s);
4196 if (p->l.t.t != BC_LEX_RPAREN) RETURN_STATUS(bc_error_bad_token());
4197 bc_parse_pushJUMP(p, cond_idx);
4198 bc_vec_push(&p->func->labels, &p->func->code.len);
4200 bc_vec_push(&p->exits, &exit_idx);
4201 bc_vec_push(&p->func->labels, &exit_idx);
4203 s = zbc_parse_stmt_allow_NLINE_before(p, STRING_for);
4204 if (s) RETURN_STATUS(s);
4206 dbg_lex("%s:%d BC_INST_JUMP to %zd", __func__, __LINE__, update_idx);
4207 bc_parse_pushJUMP(p, update_idx);
4209 dbg_lex("%s:%d rewriting label-> %zd", __func__, __LINE__, p->func->code.len);
4210 rewrite_label_to_current(p, exit_idx);
4212 bc_vec_pop(&p->exits);
4213 bc_vec_pop(&p->conds);
4215 RETURN_STATUS(BC_STATUS_SUCCESS);
4217 #define zbc_parse_for(...) (zbc_parse_for(__VA_ARGS__) COMMA_SUCCESS)
4219 static BC_STATUS zbc_parse_break_or_continue(BcParse *p, BcLexType type)
4224 if (type == BC_LEX_KEY_BREAK) {
4225 if (p->exits.len == 0) // none of the enclosing blocks is a loop
4226 RETURN_STATUS(bc_error_bad_token());
4227 i = *(size_t*)bc_vec_top(&p->exits);
4229 i = *(size_t*)bc_vec_top(&p->conds);
4232 bc_parse_pushJUMP(p, i);
4234 s = zbc_lex_next(&p->l);
4235 if (s) RETURN_STATUS(s);
4237 if (p->l.t.t != BC_LEX_SCOLON && p->l.t.t != BC_LEX_NLINE)
4238 RETURN_STATUS(bc_error_bad_token());
4240 RETURN_STATUS(zbc_lex_next(&p->l));
4242 #define zbc_parse_break_or_continue(...) (zbc_parse_break_or_continue(__VA_ARGS__) COMMA_SUCCESS)
4244 static BC_STATUS zbc_parse_funcdef(BcParse *p)
4247 bool var, comma = false;
4250 dbg_lex_enter("%s:%d entered", __func__, __LINE__);
4251 s = zbc_lex_next(&p->l);
4252 if (s) RETURN_STATUS(s);
4253 if (p->l.t.t != BC_LEX_NAME)
4254 RETURN_STATUS(bc_error("bad function definition"));
4256 name = xstrdup(p->l.t.v.v);
4257 bc_parse_addFunc(p, name, &p->fidx);
4259 s = zbc_lex_next(&p->l);
4260 if (s) RETURN_STATUS(s);
4261 if (p->l.t.t != BC_LEX_LPAREN)
4262 RETURN_STATUS(bc_error("bad function definition"));
4263 s = zbc_lex_next(&p->l);
4264 if (s) RETURN_STATUS(s);
4266 while (p->l.t.t != BC_LEX_RPAREN) {
4267 if (p->l.t.t != BC_LEX_NAME)
4268 RETURN_STATUS(bc_error("bad function definition"));
4272 name = xstrdup(p->l.t.v.v);
4273 s = zbc_lex_next(&p->l);
4276 var = p->l.t.t != BC_LEX_LBRACKET;
4279 s = zbc_lex_next(&p->l);
4282 if (p->l.t.t != BC_LEX_RBRACKET) {
4283 s = bc_error("bad function definition");
4287 s = zbc_lex_next(&p->l);
4291 comma = p->l.t.t == BC_LEX_COMMA;
4293 s = zbc_lex_next(&p->l);
4297 s = zbc_func_insert(p->func, name, var);
4301 if (comma) RETURN_STATUS(bc_error("bad function definition"));
4303 s = zbc_lex_next(&p->l);
4304 if (s) RETURN_STATUS(s);
4306 if (p->l.t.t != BC_LEX_LBRACE)
4307 s = bc_POSIX_requires("the left brace be on the same line as the function header");
4309 // Prevent "define z()<newline>" from being interpreted as function with empty stmt as body
4310 s = zbc_lex_skip_if_at_NLINE(&p->l);
4311 if (s) RETURN_STATUS(s);
4312 //GNU bc requires a {} block even if function body has single stmt, enforce this?
4313 if (p->l.t.t != BC_LEX_LBRACE)
4314 RETURN_STATUS(bc_error("function { body } expected"));
4316 p->in_funcdef++; // to determine whether "return" stmt is allowed, and such
4317 s = zbc_parse_stmt_possibly_auto(p, true);
4319 if (s) RETURN_STATUS(s);
4321 bc_parse_push(p, BC_INST_RET0);
4322 bc_parse_updateFunc(p, BC_PROG_MAIN);
4324 dbg_lex_done("%s:%d done", __func__, __LINE__);
4327 dbg_lex_done("%s:%d done (error)", __func__, __LINE__);
4331 #define zbc_parse_funcdef(...) (zbc_parse_funcdef(__VA_ARGS__) COMMA_SUCCESS)
4333 static BC_STATUS zbc_parse_auto(BcParse *p)
4336 bool comma, var, one;
4339 dbg_lex_enter("%s:%d entered", __func__, __LINE__);
4340 s = zbc_lex_next(&p->l);
4341 if (s) RETURN_STATUS(s);
4344 one = p->l.t.t == BC_LEX_NAME;
4346 while (p->l.t.t == BC_LEX_NAME) {
4347 name = xstrdup(p->l.t.v.v);
4348 s = zbc_lex_next(&p->l);
4351 var = p->l.t.t != BC_LEX_LBRACKET;
4353 s = zbc_lex_next(&p->l);
4356 if (p->l.t.t != BC_LEX_RBRACKET) {
4357 s = bc_error("bad function definition");
4361 s = zbc_lex_next(&p->l);
4365 comma = p->l.t.t == BC_LEX_COMMA;
4367 s = zbc_lex_next(&p->l);
4371 s = zbc_func_insert(p->func, name, var);
4375 if (comma) RETURN_STATUS(bc_error("bad function definition"));
4376 if (!one) RETURN_STATUS(bc_error("no auto variable found"));
4378 if (p->l.t.t != BC_LEX_NLINE && p->l.t.t != BC_LEX_SCOLON)
4379 RETURN_STATUS(bc_error_bad_token());
4381 dbg_lex_done("%s:%d done", __func__, __LINE__);
4382 RETURN_STATUS(zbc_lex_next(&p->l));
4385 dbg_lex_done("%s:%d done (ERROR)", __func__, __LINE__);
4388 #define zbc_parse_auto(...) (zbc_parse_auto(__VA_ARGS__) COMMA_SUCCESS)
4390 #undef zbc_parse_stmt_possibly_auto
4391 static BC_STATUS zbc_parse_stmt_possibly_auto(BcParse *p, bool auto_allowed)
4393 BcStatus s = BC_STATUS_SUCCESS;
4395 dbg_lex_enter("%s:%d entered, p->l.t.t:%d", __func__, __LINE__, p->l.t.t);
4397 if (p->l.t.t == BC_LEX_NLINE) {
4398 dbg_lex_done("%s:%d done (seen BC_LEX_NLINE)", __func__, __LINE__);
4399 RETURN_STATUS(zbc_lex_next(&p->l));
4401 if (p->l.t.t == BC_LEX_SCOLON) {
4402 dbg_lex_done("%s:%d done (seen BC_LEX_SCOLON)", __func__, __LINE__);
4403 RETURN_STATUS(zbc_lex_next(&p->l));
4406 if (p->l.t.t == BC_LEX_LBRACE) {
4407 dbg_lex("%s:%d BC_LEX_LBRACE: (auto_allowed:%d)", __func__, __LINE__, auto_allowed);
4409 s = zbc_lex_next(&p->l);
4410 if (s) RETURN_STATUS(s);
4411 } while (p->l.t.t == BC_LEX_NLINE);
4412 if (auto_allowed && p->l.t.t == BC_LEX_KEY_AUTO) {
4413 dbg_lex("%s:%d calling zbc_parse_auto()", __func__, __LINE__);
4414 s = zbc_parse_auto(p);
4415 if (s) RETURN_STATUS(s);
4417 while (p->l.t.t != BC_LEX_RBRACE) {
4418 dbg_lex("%s:%d block parsing loop", __func__, __LINE__);
4419 s = zbc_parse_stmt(p);
4420 if (s) RETURN_STATUS(s);
4422 s = zbc_lex_next(&p->l);
4423 dbg_lex_done("%s:%d done (seen BC_LEX_RBRACE)", __func__, __LINE__);
4427 dbg_lex("%s:%d p->l.t.t:%d", __func__, __LINE__, p->l.t.t);
4431 case BC_LEX_OP_MINUS:
4432 case BC_LEX_OP_BOOL_NOT:
4436 case BC_LEX_KEY_IBASE:
4437 case BC_LEX_KEY_LAST:
4438 case BC_LEX_KEY_LENGTH:
4439 case BC_LEX_KEY_OBASE:
4440 case BC_LEX_KEY_READ:
4441 case BC_LEX_KEY_SCALE:
4442 case BC_LEX_KEY_SQRT:
4443 s = zbc_parse_expr(p, BC_PARSE_PRINT);
4446 s = zbc_parse_string(p, BC_INST_PRINT_STR);
4448 case BC_LEX_KEY_BREAK:
4449 case BC_LEX_KEY_CONTINUE:
4450 s = zbc_parse_break_or_continue(p, p->l.t.t);
4452 case BC_LEX_KEY_FOR:
4453 s = zbc_parse_for(p);
4455 case BC_LEX_KEY_HALT:
4456 bc_parse_push(p, BC_INST_HALT);
4457 s = zbc_lex_next(&p->l);
4460 s = zbc_parse_if(p);
4462 case BC_LEX_KEY_LIMITS:
4463 // "limits" is a compile-time command,
4464 // the output is produced at _parse time_.
4466 "BC_BASE_MAX = "BC_MAX_OBASE_STR "\n"
4467 "BC_DIM_MAX = "BC_MAX_DIM_STR "\n"
4468 "BC_SCALE_MAX = "BC_MAX_SCALE_STR "\n"
4469 "BC_STRING_MAX = "BC_MAX_STRING_STR"\n"
4470 "BC_NAME_MAX = "BC_MAX_NAME_STR "\n"
4471 "BC_NUM_MAX = "BC_MAX_NUM_STR "\n"
4472 "MAX Exponent = "BC_MAX_EXP_STR "\n"
4473 "Number of vars = "BC_MAX_VARS_STR "\n"
4475 s = zbc_lex_next(&p->l);
4477 case BC_LEX_KEY_PRINT:
4478 s = zbc_parse_print(p);
4480 case BC_LEX_KEY_QUIT:
4481 // "quit" is a compile-time command. For example,
4482 // "if (0 == 1) quit" terminates when parsing the statement,
4483 // not when it is executed
4484 QUIT_OR_RETURN_TO_MAIN;
4485 case BC_LEX_KEY_RETURN:
4487 RETURN_STATUS(bc_error("'return' not in a function"));
4488 s = zbc_parse_return(p);
4490 case BC_LEX_KEY_WHILE:
4491 s = zbc_parse_while(p);
4494 s = bc_error_bad_token();
4498 if (s || G_interrupt) {
4500 s = BC_STATUS_FAILURE;
4503 dbg_lex_done("%s:%d done", __func__, __LINE__);
4506 #define zbc_parse_stmt_possibly_auto(...) (zbc_parse_stmt_possibly_auto(__VA_ARGS__) COMMA_SUCCESS)
4508 static BC_STATUS zbc_parse_stmt_or_funcdef(BcParse *p)
4512 dbg_lex_enter("%s:%d entered", __func__, __LINE__);
4513 if (p->l.t.t == BC_LEX_EOF)
4514 s = bc_error("end of file");
4515 else if (p->l.t.t == BC_LEX_KEY_DEFINE) {
4516 dbg_lex("%s:%d p->l.t.t:BC_LEX_KEY_DEFINE", __func__, __LINE__);
4517 s = zbc_parse_funcdef(p);
4519 dbg_lex("%s:%d p->l.t.t:%d (not BC_LEX_KEY_DEFINE)", __func__, __LINE__, p->l.t.t);
4520 s = zbc_parse_stmt(p);
4523 dbg_lex_done("%s:%d done", __func__, __LINE__);
4526 #define zbc_parse_stmt_or_funcdef(...) (zbc_parse_stmt_or_funcdef(__VA_ARGS__) COMMA_SUCCESS)
4528 // This is not a "z" function: can also return BC_STATUS_PARSE_EMPTY_EXP
4529 static BcStatus bc_parse_expr_empty_ok(BcParse *p, uint8_t flags)
4531 BcStatus s = BC_STATUS_SUCCESS;
4532 BcInst prev = BC_INST_PRINT;
4533 BcLexType top, t = p->l.t.t;
4534 size_t nexprs = 0, ops_bgn = p->ops.len;
4535 unsigned nparens, nrelops;
4536 bool paren_first, paren_expr, rprn, done, get_token, assign, bin_last;
4538 dbg_lex_enter("%s:%d entered", __func__, __LINE__);
4539 paren_first = p->l.t.t == BC_LEX_LPAREN;
4540 nparens = nrelops = 0;
4541 paren_expr = rprn = done = get_token = assign = false;
4544 for (; !G_interrupt && !s && !done && bc_parse_exprs(t); t = p->l.t.t) {
4548 s = zbc_parse_incdec(p, &prev, &paren_expr, &nexprs, flags);
4549 rprn = get_token = bin_last = false;
4551 case BC_LEX_OP_MINUS:
4552 s = zbc_parse_minus(p, &prev, ops_bgn, rprn, &nexprs);
4553 rprn = get_token = false;
4554 bin_last = prev == BC_INST_MINUS;
4556 case BC_LEX_OP_ASSIGN_POWER:
4557 case BC_LEX_OP_ASSIGN_MULTIPLY:
4558 case BC_LEX_OP_ASSIGN_DIVIDE:
4559 case BC_LEX_OP_ASSIGN_MODULUS:
4560 case BC_LEX_OP_ASSIGN_PLUS:
4561 case BC_LEX_OP_ASSIGN_MINUS:
4562 case BC_LEX_OP_ASSIGN:
4563 if (prev != BC_INST_VAR && prev != BC_INST_ARRAY_ELEM
4564 && prev != BC_INST_SCALE && prev != BC_INST_IBASE
4565 && prev != BC_INST_OBASE && prev != BC_INST_LAST
4567 s = bc_error("bad assignment:"
4568 " left side must be variable"
4570 ); // note: shared string
4574 case BC_LEX_OP_POWER:
4575 case BC_LEX_OP_MULTIPLY:
4576 case BC_LEX_OP_DIVIDE:
4577 case BC_LEX_OP_MODULUS:
4578 case BC_LEX_OP_PLUS:
4579 case BC_LEX_OP_REL_EQ:
4580 case BC_LEX_OP_REL_LE:
4581 case BC_LEX_OP_REL_GE:
4582 case BC_LEX_OP_REL_NE:
4583 case BC_LEX_OP_REL_LT:
4584 case BC_LEX_OP_REL_GT:
4585 case BC_LEX_OP_BOOL_NOT:
4586 case BC_LEX_OP_BOOL_OR:
4587 case BC_LEX_OP_BOOL_AND:
4588 if (((t == BC_LEX_OP_BOOL_NOT) != bin_last)
4589 || (t != BC_LEX_OP_BOOL_NOT && prev == BC_INST_BOOL_NOT)
4591 return bc_error_bad_expression();
4593 nrelops += t >= BC_LEX_OP_REL_EQ && t <= BC_LEX_OP_REL_GT;
4594 prev = BC_TOKEN_2_INST(t);
4595 bc_parse_operator(p, t, ops_bgn, &nexprs);
4596 s = zbc_lex_next(&p->l);
4597 rprn = get_token = false;
4598 bin_last = t != BC_LEX_OP_BOOL_NOT;
4601 if (BC_PARSE_LEAF(prev, rprn))
4602 return bc_error_bad_expression();
4604 paren_expr = rprn = bin_last = false;
4606 bc_vec_push(&p->ops, &t);
4609 if (bin_last || prev == BC_INST_BOOL_NOT)
4610 return bc_error_bad_expression();
4612 s = BC_STATUS_SUCCESS;
4618 dbg_lex_done("%s:%d done (returning EMPTY_EXP)", __func__, __LINE__);
4619 return BC_STATUS_PARSE_EMPTY_EXP;
4622 paren_expr = rprn = true;
4623 get_token = bin_last = false;
4624 s = zbc_parse_rightParen(p, ops_bgn, &nexprs);
4627 if (BC_PARSE_LEAF(prev, rprn))
4628 return bc_error_bad_expression();
4630 rprn = get_token = bin_last = false;
4631 s = zbc_parse_name(p, &prev, flags & ~BC_PARSE_NOCALL);
4635 if (BC_PARSE_LEAF(prev, rprn))
4636 return bc_error_bad_expression();
4640 paren_expr = get_token = true;
4641 rprn = bin_last = false;
4643 case BC_LEX_KEY_IBASE:
4644 case BC_LEX_KEY_LAST:
4645 case BC_LEX_KEY_OBASE:
4646 if (BC_PARSE_LEAF(prev, rprn))
4647 return bc_error_bad_expression();
4648 prev = (char) (t - BC_LEX_KEY_IBASE + BC_INST_IBASE);
4649 bc_parse_push(p, (char) prev);
4650 paren_expr = get_token = true;
4651 rprn = bin_last = false;
4654 case BC_LEX_KEY_LENGTH:
4655 case BC_LEX_KEY_SQRT:
4656 if (BC_PARSE_LEAF(prev, rprn))
4657 return bc_error_bad_expression();
4658 s = zbc_parse_builtin(p, t, flags, &prev);
4660 rprn = get_token = bin_last = false;
4663 case BC_LEX_KEY_READ:
4664 if (BC_PARSE_LEAF(prev, rprn))
4665 return bc_error_bad_expression();
4666 else if (flags & BC_PARSE_NOREAD)
4667 s = bc_error_nested_read_call();
4669 s = zbc_parse_read(p);
4671 rprn = get_token = bin_last = false;
4673 prev = BC_INST_READ;
4675 case BC_LEX_KEY_SCALE:
4676 if (BC_PARSE_LEAF(prev, rprn))
4677 return bc_error_bad_expression();
4678 s = zbc_parse_scale(p, &prev, flags);
4680 rprn = get_token = bin_last = false;
4682 prev = BC_INST_SCALE;
4685 s = bc_error_bad_token();
4689 if (!s && get_token) s = zbc_lex_next(&p->l);
4693 if (G_interrupt) return BC_STATUS_FAILURE; // ^C: stop parsing
4695 while (p->ops.len > ops_bgn) {
4696 top = BC_PARSE_TOP_OP(p);
4697 assign = top >= BC_LEX_OP_ASSIGN_POWER && top <= BC_LEX_OP_ASSIGN;
4699 if (top == BC_LEX_LPAREN || top == BC_LEX_RPAREN)
4700 return bc_error_bad_expression();
4702 bc_parse_push(p, BC_TOKEN_2_INST(top));
4704 nexprs -= top != BC_LEX_OP_BOOL_NOT && top != BC_LEX_NEG;
4705 bc_vec_pop(&p->ops);
4708 if (prev == BC_INST_BOOL_NOT || nexprs != 1)
4709 return bc_error_bad_expression();
4711 if (!(flags & BC_PARSE_REL) && nrelops) {
4712 s = bc_POSIX_does_not_allow("comparison operators outside if or loops");
4713 IF_ERROR_RETURN_POSSIBLE(if (s) return s);
4714 } else if ((flags & BC_PARSE_REL) && nrelops > 1) {
4715 s = bc_POSIX_requires("exactly one comparison operator per condition");
4716 IF_ERROR_RETURN_POSSIBLE(if (s) return s);
4719 if (flags & BC_PARSE_PRINT) {
4720 if (paren_first || !assign) bc_parse_push(p, BC_INST_PRINT);
4721 bc_parse_push(p, BC_INST_POP);
4724 dbg_lex_done("%s:%d done", __func__, __LINE__);
4732 static BC_STATUS zdc_parse_register(BcParse *p)
4736 s = zbc_lex_next(&p->l);
4737 if (s) RETURN_STATUS(s);
4738 if (p->l.t.t != BC_LEX_NAME) RETURN_STATUS(bc_error_bad_token());
4740 bc_parse_pushName(p, p->l.t.v.v);
4744 #define zdc_parse_register(...) (zdc_parse_register(__VA_ARGS__) COMMA_SUCCESS)
4746 static BC_STATUS zdc_parse_string(BcParse *p)
4749 size_t idx, len = G.prog.strs.len;
4751 //why pad to 32 zeros??
4752 name = xasprintf("%032lu", (unsigned long)len);
4754 str = xstrdup(p->l.t.v.v);
4755 bc_parse_push(p, BC_INST_STR);
4756 bc_parse_pushIndex(p, len);
4757 bc_vec_push(&G.prog.strs, &str);
4758 bc_parse_addFunc(p, name, &idx);
4760 RETURN_STATUS(zbc_lex_next(&p->l));
4762 #define zdc_parse_string(...) (zdc_parse_string(__VA_ARGS__) COMMA_SUCCESS)
4764 static BC_STATUS zdc_parse_mem(BcParse *p, uint8_t inst, bool name, bool store)
4768 bc_parse_push(p, inst);
4770 s = zdc_parse_register(p);
4771 if (s) RETURN_STATUS(s);
4775 bc_parse_push(p, BC_INST_SWAP);
4776 bc_parse_push(p, BC_INST_ASSIGN);
4777 bc_parse_push(p, BC_INST_POP);
4780 RETURN_STATUS(zbc_lex_next(&p->l));
4782 #define zdc_parse_mem(...) (zdc_parse_mem(__VA_ARGS__) COMMA_SUCCESS)
4784 static BC_STATUS zdc_parse_cond(BcParse *p, uint8_t inst)
4788 bc_parse_push(p, inst);
4789 bc_parse_push(p, BC_INST_EXEC_COND);
4791 s = zdc_parse_register(p);
4792 if (s) RETURN_STATUS(s);
4794 s = zbc_lex_next(&p->l);
4795 if (s) RETURN_STATUS(s);
4797 if (p->l.t.t == BC_LEX_ELSE) {
4798 s = zdc_parse_register(p);
4799 if (s) RETURN_STATUS(s);
4800 s = zbc_lex_next(&p->l);
4802 bc_parse_push(p, BC_PARSE_STREND);
4806 #define zdc_parse_cond(...) (zdc_parse_cond(__VA_ARGS__) COMMA_SUCCESS)
4808 static BC_STATUS zdc_parse_token(BcParse *p, BcLexType t, uint8_t flags)
4810 BcStatus s = BC_STATUS_SUCCESS;
4812 bool assign, get_token = false;
4815 case BC_LEX_OP_REL_EQ:
4816 case BC_LEX_OP_REL_LE:
4817 case BC_LEX_OP_REL_GE:
4818 case BC_LEX_OP_REL_NE:
4819 case BC_LEX_OP_REL_LT:
4820 case BC_LEX_OP_REL_GT:
4821 s = zdc_parse_cond(p, t - BC_LEX_OP_REL_EQ + BC_INST_REL_EQ);
4825 s = zdc_parse_mem(p, BC_INST_ARRAY_ELEM, true, t == BC_LEX_COLON);
4828 s = zdc_parse_string(p);
4832 if (t == BC_LEX_NEG) {
4833 s = zbc_lex_next(&p->l);
4834 if (s) RETURN_STATUS(s);
4835 if (p->l.t.t != BC_LEX_NUMBER)
4836 RETURN_STATUS(bc_error_bad_token());
4839 if (t == BC_LEX_NEG) bc_parse_push(p, BC_INST_NEG);
4842 case BC_LEX_KEY_READ:
4843 if (flags & BC_PARSE_NOREAD)
4844 s = bc_error_nested_read_call();
4846 bc_parse_push(p, BC_INST_READ);
4849 case BC_LEX_OP_ASSIGN:
4850 case BC_LEX_STORE_PUSH:
4851 assign = t == BC_LEX_OP_ASSIGN;
4852 inst = assign ? BC_INST_VAR : BC_INST_PUSH_TO_VAR;
4853 s = zdc_parse_mem(p, inst, true, assign);
4856 case BC_LEX_LOAD_POP:
4857 inst = t == BC_LEX_LOAD_POP ? BC_INST_PUSH_VAR : BC_INST_LOAD;
4858 s = zdc_parse_mem(p, inst, true, false);
4860 case BC_LEX_STORE_IBASE:
4861 case BC_LEX_STORE_SCALE:
4862 case BC_LEX_STORE_OBASE:
4863 inst = t - BC_LEX_STORE_IBASE + BC_INST_IBASE;
4864 s = zdc_parse_mem(p, inst, false, true);
4867 s = bc_error_bad_token();
4872 if (!s && get_token) s = zbc_lex_next(&p->l);
4876 #define zdc_parse_token(...) (zdc_parse_token(__VA_ARGS__) COMMA_SUCCESS)
4878 static BC_STATUS zdc_parse_expr(BcParse *p, uint8_t flags)
4887 if (t == BC_LEX_EOF) break;
4889 inst = dc_parse_insts[t];
4890 if (inst != BC_INST_INVALID) {
4891 bc_parse_push(p, inst);
4892 s = zbc_lex_next(&p->l);
4894 s = zdc_parse_token(p, t, flags);
4896 if (s) RETURN_STATUS(s);
4899 if (flags & BC_PARSE_NOCALL)
4900 bc_parse_push(p, BC_INST_POP_EXEC);
4902 RETURN_STATUS(BC_STATUS_SUCCESS);
4904 #define zdc_parse_expr(...) (zdc_parse_expr(__VA_ARGS__) COMMA_SUCCESS)
4906 static BC_STATUS zdc_parse_parse(BcParse *p)
4910 if (p->l.t.t == BC_LEX_EOF)
4911 s = bc_error("end of file");
4913 s = zdc_parse_expr(p, 0);
4915 if (s || G_interrupt) {
4917 s = BC_STATUS_FAILURE;
4922 #define zdc_parse_parse(...) (zdc_parse_parse(__VA_ARGS__) COMMA_SUCCESS)
4926 static BC_STATUS zcommon_parse_expr(BcParse *p, uint8_t flags)
4929 IF_BC(RETURN_STATUS(zbc_parse_expr(p, flags)));
4931 IF_DC(RETURN_STATUS(zdc_parse_expr(p, flags)));
4934 #define zcommon_parse_expr(...) (zcommon_parse_expr(__VA_ARGS__) COMMA_SUCCESS)
4936 static BcVec* bc_program_search(char *id, bool var)
4944 v = var ? &G.prog.vars : &G.prog.arrs;
4945 map = var ? &G.prog.var_map : &G.prog.arr_map;
4949 new = bc_map_insert(map, &e, &i); // 1 if insertion was successful
4952 bc_array_init(&data.v, var);
4953 bc_vec_push(v, &data.v);
4956 ptr = bc_vec_item(map, i);
4957 if (new) ptr->name = xstrdup(e.name);
4958 return bc_vec_item(v, ptr->idx);
4961 static BC_STATUS zbc_program_num(BcResult *r, BcNum **num, bool hex)
4965 case BC_RESULT_TEMP:
4966 case BC_RESULT_IBASE:
4967 case BC_RESULT_SCALE:
4968 case BC_RESULT_OBASE:
4971 case BC_RESULT_CONSTANT: {
4973 char **str = bc_vec_item(&G.prog.consts, r->d.id.idx);
4975 size_t len = strlen(*str);
4977 bc_num_init(&r->d.n, len);
4979 hex = hex && len == 1;
4980 base_t = hex ? 16 : G.prog.ib_t;
4981 s = zbc_num_parse(&r->d.n, *str, base_t);
4984 bc_num_free(&r->d.n);
4989 r->t = BC_RESULT_TEMP;
4993 case BC_RESULT_ARRAY:
4994 case BC_RESULT_ARRAY_ELEM: {
4997 v = bc_program_search(r->d.id.name, r->t == BC_RESULT_VAR);
4999 if (r->t == BC_RESULT_ARRAY_ELEM) {
5001 if (v->len <= r->d.id.idx) bc_array_expand(v, r->d.id.idx + 1);
5002 *num = bc_vec_item(v, r->d.id.idx);
5004 *num = bc_vec_top(v);
5007 case BC_RESULT_LAST:
5008 *num = &G.prog.last;
5015 RETURN_STATUS(BC_STATUS_SUCCESS);
5017 #define zbc_program_num(...) (zbc_program_num(__VA_ARGS__) COMMA_SUCCESS)
5019 static BC_STATUS zbc_program_binOpPrep(BcResult **l, BcNum **ln,
5020 BcResult **r, BcNum **rn, bool assign)
5024 BcResultType lt, rt;
5026 if (!BC_PROG_STACK(&G.prog.results, 2))
5027 RETURN_STATUS(bc_error_stack_has_too_few_elements());
5029 *r = bc_vec_item_rev(&G.prog.results, 0);
5030 *l = bc_vec_item_rev(&G.prog.results, 1);
5034 hex = assign && (lt == BC_RESULT_IBASE || lt == BC_RESULT_OBASE);
5036 s = zbc_program_num(*l, ln, false);
5037 if (s) RETURN_STATUS(s);
5038 s = zbc_program_num(*r, rn, hex);
5039 if (s) RETURN_STATUS(s);
5041 // We run this again under these conditions in case any vector has been
5042 // reallocated out from under the BcNums or arrays we had.
5043 if (lt == rt && (lt == BC_RESULT_VAR || lt == BC_RESULT_ARRAY_ELEM)) {
5044 s = zbc_program_num(*l, ln, false);
5045 if (s) RETURN_STATUS(s);
5048 if (!BC_PROG_NUM((*l), (*ln)) && (!assign || (*l)->t != BC_RESULT_VAR))
5049 RETURN_STATUS(bc_error_variable_is_wrong_type());
5050 if (!assign && !BC_PROG_NUM((*r), (*ln)))
5051 RETURN_STATUS(bc_error_variable_is_wrong_type());
5055 #define zbc_program_binOpPrep(...) (zbc_program_binOpPrep(__VA_ARGS__) COMMA_SUCCESS)
5057 static void bc_program_binOpRetire(BcResult *r)
5059 r->t = BC_RESULT_TEMP;
5060 bc_vec_pop(&G.prog.results);
5061 bc_vec_pop(&G.prog.results);
5062 bc_vec_push(&G.prog.results, r);
5065 static BC_STATUS zbc_program_prep(BcResult **r, BcNum **n)
5069 if (!BC_PROG_STACK(&G.prog.results, 1))
5070 RETURN_STATUS(bc_error_stack_has_too_few_elements());
5071 *r = bc_vec_top(&G.prog.results);
5073 s = zbc_program_num(*r, n, false);
5074 if (s) RETURN_STATUS(s);
5076 if (!BC_PROG_NUM((*r), (*n)))
5077 RETURN_STATUS(bc_error_variable_is_wrong_type());
5081 #define zbc_program_prep(...) (zbc_program_prep(__VA_ARGS__) COMMA_SUCCESS)
5083 static void bc_program_retire(BcResult *r, BcResultType t)
5086 bc_vec_pop(&G.prog.results);
5087 bc_vec_push(&G.prog.results, r);
5090 static BC_STATUS zbc_program_op(char inst)
5093 BcResult *opd1, *opd2, res;
5094 BcNum *n1, *n2 = NULL;
5096 s = zbc_program_binOpPrep(&opd1, &n1, &opd2, &n2, false);
5097 if (s) RETURN_STATUS(s);
5098 bc_num_init_DEF_SIZE(&res.d.n);
5100 s = BC_STATUS_SUCCESS;
5101 IF_ERROR_RETURN_POSSIBLE(s =) zbc_program_ops[inst - BC_INST_POWER](n1, n2, &res.d.n, G.prog.scale);
5103 bc_program_binOpRetire(&res);
5107 bc_num_free(&res.d.n);
5110 #define zbc_program_op(...) (zbc_program_op(__VA_ARGS__) COMMA_SUCCESS)
5112 static BC_STATUS zbc_program_read(void)
5114 const char *sv_file;
5122 RETURN_STATUS(bc_error_nested_read_call());
5124 f = bc_program_func(BC_PROG_READ);
5125 bc_vec_pop_all(&f->code);
5127 sv_file = G.prog.file;
5131 bc_char_vec_init(&buf);
5132 bc_read_line(&buf, stdin);
5134 bc_parse_create(&parse, BC_PROG_READ);
5135 bc_lex_file(&parse.l);
5137 s = zbc_parse_text_init(&parse, buf.v);
5138 if (s) goto exec_err;
5139 s = zcommon_parse_expr(&parse, BC_PARSE_NOREAD);
5140 if (s) goto exec_err;
5142 if (parse.l.t.t != BC_LEX_NLINE && parse.l.t.t != BC_LEX_EOF) {
5143 s = bc_error("bad read() expression");
5147 ip.func = BC_PROG_READ;
5149 ip.len = G.prog.results.len;
5151 // Update this pointer, just in case.
5152 f = bc_program_func(BC_PROG_READ);
5154 bc_vec_pushByte(&f->code, BC_INST_POP_EXEC);
5155 bc_vec_push(&G.prog.exestack, &ip);
5157 bc_parse_free(&parse);
5159 G.prog.file = sv_file;
5163 #define zbc_program_read(...) (zbc_program_read(__VA_ARGS__) COMMA_SUCCESS)
5165 static size_t bc_program_index(char *code, size_t *bgn)
5167 unsigned char *bytes = (void*)(code + *bgn);
5177 for (i = 0; i < amt; i += 8)
5178 res |= (size_t)(*bytes++) << i;
5183 static char *bc_program_name(char *code, size_t *bgn)
5189 s = xmalloc(strchr(code, BC_PARSE_STREND) - code + 1);
5193 if (c == BC_PARSE_STREND)
5203 static void bc_program_printString(const char *str)
5207 // Example: echo '[]ap' | dc
5208 // should print two bytes: 0x00, 0x0A
5215 if (c != '\\' || !*str)
5235 G.prog.nchars = SIZE_MAX;
5247 // Just print the backslash and following character.
5258 static void bc_num_printNewline(void)
5260 if (G.prog.nchars == G.prog.len - 1) {
5268 static FAST_FUNC void bc_num_printChar(size_t num, size_t width, bool radix)
5271 bb_putchar((char) num);
5272 G.prog.nchars += width;
5276 static FAST_FUNC void bc_num_printDigits(size_t num, size_t width, bool radix)
5280 bc_num_printNewline();
5281 bb_putchar(radix ? '.' : ' ');
5284 bc_num_printNewline();
5285 for (exp = 0, pow = 1; exp < width - 1; ++exp, pow *= 10)
5288 for (exp = 0; exp < width; pow /= 10, ++G.prog.nchars, ++exp) {
5290 bc_num_printNewline();
5293 bb_putchar(((char) dig) + '0');
5297 static FAST_FUNC void bc_num_printHex(size_t num, size_t width, bool radix)
5300 bc_num_printNewline();
5305 bc_num_printNewline();
5306 bb_putchar(bb_hexdigits_upcase[num]);
5307 G.prog.nchars += width;
5310 static void bc_num_printDecimal(BcNum *n)
5312 size_t i, rdx = n->rdx - 1;
5319 for (i = n->len - 1; i < n->len; --i)
5320 bc_num_printHex((size_t) n->num[i], 1, i == rdx);
5323 static BC_STATUS zbc_num_printNum(BcNum *n, unsigned base_t, size_t width, BcNumDigitOp print)
5328 BcNum intp, fracp, digit, frac_len;
5329 unsigned long dig, *ptr;
5334 print(0, width, false);
5335 RETURN_STATUS(BC_STATUS_SUCCESS);
5338 bc_vec_init(&stack, sizeof(long), NULL);
5339 bc_num_init(&intp, n->len);
5340 bc_num_init(&fracp, n->rdx);
5341 bc_num_init(&digit, width);
5342 bc_num_init(&frac_len, BC_NUM_INT(n));
5343 bc_num_copy(&intp, n);
5344 bc_num_one(&frac_len);
5345 //TODO: have BcNumSmall type, with static buffer
5346 bc_num_init_DEF_SIZE(&base);
5347 bc_num_ulong2num(&base, base_t);
5349 bc_num_truncate(&intp, intp.rdx);
5350 s = zbc_num_sub(n, &intp, &fracp, 0);
5353 while (intp.len != 0) {
5354 s = zbc_num_divmod(&intp, &base, &intp, &digit, 0);
5356 s = zbc_num_ulong(&digit, &dig);
5358 bc_vec_push(&stack, &dig);
5361 for (i = 0; i < stack.len; ++i) {
5362 ptr = bc_vec_item_rev(&stack, i);
5363 print(*ptr, width, false);
5366 if (!n->rdx) goto err;
5368 for (radix = true; frac_len.len <= n->rdx; radix = false) {
5369 s = zbc_num_mul(&fracp, &base, &fracp, n->rdx);
5371 s = zbc_num_ulong(&fracp, &dig);
5373 bc_num_ulong2num(&intp, dig);
5374 s = zbc_num_sub(&fracp, &intp, &fracp, 0);
5376 print(dig, width, radix);
5377 s = zbc_num_mul(&frac_len, &base, &frac_len, 0);
5382 bc_num_free(&frac_len);
5383 bc_num_free(&digit);
5384 bc_num_free(&fracp);
5386 bc_vec_free(&stack);
5389 #define zbc_num_printNum(...) (zbc_num_printNum(__VA_ARGS__) COMMA_SUCCESS)
5391 static BC_STATUS zbc_num_printBase(BcNum *n)
5405 if (G.prog.ob_t <= BC_NUM_MAX_IBASE) {
5407 print = bc_num_printHex;
5409 unsigned i = G.prog.ob_t - 1;
5417 print = bc_num_printDigits;
5420 s = zbc_num_printNum(n, G.prog.ob_t, width, print);
5425 #define zbc_num_printBase(...) (zbc_num_printBase(__VA_ARGS__) COMMA_SUCCESS)
5427 static BC_STATUS zbc_num_print(BcNum *n, bool newline)
5429 BcStatus s = BC_STATUS_SUCCESS;
5431 bc_num_printNewline();
5436 } else if (G.prog.ob_t == 10)
5437 bc_num_printDecimal(n);
5439 s = zbc_num_printBase(n);
5448 #define zbc_num_print(...) (zbc_num_print(__VA_ARGS__) COMMA_SUCCESS)
5450 static BC_STATUS zbc_program_print(char inst, size_t idx)
5455 bool pop = inst != BC_INST_PRINT;
5457 if (!BC_PROG_STACK(&G.prog.results, idx + 1))
5458 RETURN_STATUS(bc_error_stack_has_too_few_elements());
5460 r = bc_vec_item_rev(&G.prog.results, idx);
5461 num = NULL; // is this NULL necessary?
5462 s = zbc_program_num(r, &num, false);
5463 if (s) RETURN_STATUS(s);
5465 if (BC_PROG_NUM(r, num)) {
5466 s = zbc_num_print(num, !pop);
5467 if (!s) bc_num_copy(&G.prog.last, num);
5471 idx = (r->t == BC_RESULT_STR) ? r->d.id.idx : num->rdx;
5472 str = *bc_program_str(idx);
5474 if (inst == BC_INST_PRINT_STR) {
5477 if (c == '\0') break;
5480 if (c == '\n') G.prog.nchars = 0;
5483 bc_program_printString(str);
5484 if (inst == BC_INST_PRINT) bb_putchar('\n');
5488 if (!s && pop) bc_vec_pop(&G.prog.results);
5492 #define zbc_program_print(...) (zbc_program_print(__VA_ARGS__) COMMA_SUCCESS)
5494 static BC_STATUS zbc_program_negate(void)
5500 s = zbc_program_prep(&ptr, &num);
5501 if (s) RETURN_STATUS(s);
5503 bc_num_init(&res.d.n, num->len);
5504 bc_num_copy(&res.d.n, num);
5505 if (res.d.n.len) res.d.n.neg = !res.d.n.neg;
5507 bc_program_retire(&res, BC_RESULT_TEMP);
5511 #define zbc_program_negate(...) (zbc_program_negate(__VA_ARGS__) COMMA_SUCCESS)
5513 static BC_STATUS zbc_program_logical(char inst)
5516 BcResult *opd1, *opd2, res;
5520 s = zbc_program_binOpPrep(&opd1, &n1, &opd2, &n2, false);
5521 if (s) RETURN_STATUS(s);
5523 bc_num_init_DEF_SIZE(&res.d.n);
5525 if (inst == BC_INST_BOOL_AND)
5526 cond = bc_num_cmp(n1, &G.prog.zero) && bc_num_cmp(n2, &G.prog.zero);
5527 else if (inst == BC_INST_BOOL_OR)
5528 cond = bc_num_cmp(n1, &G.prog.zero) || bc_num_cmp(n2, &G.prog.zero);
5530 cond = bc_num_cmp(n1, n2);
5532 case BC_INST_REL_EQ:
5535 case BC_INST_REL_LE:
5538 case BC_INST_REL_GE:
5541 case BC_INST_REL_LT:
5544 case BC_INST_REL_GT:
5547 default: // = case BC_INST_REL_NE:
5548 //cond = (cond != 0); - not needed
5553 if (cond) bc_num_one(&res.d.n);
5554 //else bc_num_zero(&res.d.n); - already is
5556 bc_program_binOpRetire(&res);
5560 #define zbc_program_logical(...) (zbc_program_logical(__VA_ARGS__) COMMA_SUCCESS)
5563 static BC_STATUS zbc_program_assignStr(BcResult *r, BcVec *v, bool push)
5568 memset(&n2, 0, sizeof(BcNum));
5569 n2.rdx = res.d.id.idx = r->d.id.idx;
5570 res.t = BC_RESULT_STR;
5573 if (!BC_PROG_STACK(&G.prog.results, 2))
5574 RETURN_STATUS(bc_error_stack_has_too_few_elements());
5576 bc_vec_pop(&G.prog.results);
5579 bc_vec_pop(&G.prog.results);
5581 bc_vec_push(&G.prog.results, &res);
5582 bc_vec_push(v, &n2);
5584 RETURN_STATUS(BC_STATUS_SUCCESS);
5586 #define zbc_program_assignStr(...) (zbc_program_assignStr(__VA_ARGS__) COMMA_SUCCESS)
5589 static BC_STATUS zbc_program_copyToVar(char *name, bool var)
5596 if (!BC_PROG_STACK(&G.prog.results, 1))
5597 RETURN_STATUS(bc_error_stack_has_too_few_elements());
5599 ptr = bc_vec_top(&G.prog.results);
5600 if ((ptr->t == BC_RESULT_ARRAY) != !var)
5601 RETURN_STATUS(bc_error_variable_is_wrong_type());
5602 v = bc_program_search(name, var);
5605 if (ptr->t == BC_RESULT_STR && !var)
5606 RETURN_STATUS(bc_error_variable_is_wrong_type());
5607 if (ptr->t == BC_RESULT_STR)
5608 RETURN_STATUS(zbc_program_assignStr(ptr, v, true));
5611 s = zbc_program_num(ptr, &n, false);
5612 if (s) RETURN_STATUS(s);
5614 // Do this once more to make sure that pointers were not invalidated.
5615 v = bc_program_search(name, var);
5618 bc_num_init_DEF_SIZE(&r.d.n);
5619 bc_num_copy(&r.d.n, n);
5621 bc_array_init(&r.d.v, true);
5622 bc_array_copy(&r.d.v, (BcVec *) n);
5625 bc_vec_push(v, &r.d);
5626 bc_vec_pop(&G.prog.results);
5630 #define zbc_program_copyToVar(...) (zbc_program_copyToVar(__VA_ARGS__) COMMA_SUCCESS)
5632 static BC_STATUS zbc_program_assign(char inst)
5635 BcResult *left, *right, res;
5636 BcNum *l = NULL, *r = NULL;
5637 bool assign = inst == BC_INST_ASSIGN, ib, sc;
5639 s = zbc_program_binOpPrep(&left, &l, &right, &r, assign);
5640 if (s) RETURN_STATUS(s);
5642 ib = left->t == BC_RESULT_IBASE;
5643 sc = left->t == BC_RESULT_SCALE;
5646 if (right->t == BC_RESULT_STR) {
5649 if (left->t != BC_RESULT_VAR)
5650 RETURN_STATUS(bc_error_variable_is_wrong_type());
5651 v = bc_program_search(left->d.id.name, true);
5653 RETURN_STATUS(zbc_program_assignStr(right, v, false));
5657 if (left->t == BC_RESULT_CONSTANT || left->t == BC_RESULT_TEMP)
5658 RETURN_STATUS(bc_error("bad assignment:"
5659 " left side must be variable"
5661 )); // note: shared string
5664 if (inst == BC_INST_ASSIGN_DIVIDE && !bc_num_cmp(r, &G.prog.zero))
5665 RETURN_STATUS(bc_error("divide by zero"));
5670 s = BC_STATUS_SUCCESS;
5671 IF_ERROR_RETURN_POSSIBLE(s =) zbc_program_ops[inst - BC_INST_ASSIGN_POWER](l, r, l, G.prog.scale);
5673 if (s) RETURN_STATUS(s);
5678 if (ib || sc || left->t == BC_RESULT_OBASE) {
5679 static const char *const msg[] = {
5680 "bad ibase; must be [2,16]", //BC_RESULT_IBASE
5681 "bad scale; must be [0,"BC_MAX_SCALE_STR"]", //BC_RESULT_SCALE
5682 NULL, //can't happen //BC_RESULT_LAST
5683 NULL, //can't happen //BC_RESULT_CONSTANT
5684 NULL, //can't happen //BC_RESULT_ONE
5685 "bad obase; must be [2,"BC_MAX_OBASE_STR"]", //BC_RESULT_OBASE
5691 s = zbc_num_ulong(l, &val);
5692 if (s) RETURN_STATUS(s);
5693 s = left->t - BC_RESULT_IBASE;
5696 ptr = &G.prog.scale;
5699 RETURN_STATUS(bc_error(msg[s]));
5700 max = ib ? BC_NUM_MAX_IBASE : BC_MAX_OBASE;
5701 ptr = ib ? &G.prog.ib_t : &G.prog.ob_t;
5705 RETURN_STATUS(bc_error(msg[s]));
5707 *ptr = (size_t) val;
5708 s = BC_STATUS_SUCCESS;
5711 bc_num_init(&res.d.n, l->len);
5712 bc_num_copy(&res.d.n, l);
5713 bc_program_binOpRetire(&res);
5717 #define zbc_program_assign(...) (zbc_program_assign(__VA_ARGS__) COMMA_SUCCESS)
5720 #define bc_program_pushVar(code, bgn, pop, copy) \
5721 bc_program_pushVar(code, bgn)
5722 // for bc, 'pop' and 'copy' are always false
5724 static BC_STATUS bc_program_pushVar(char *code, size_t *bgn,
5725 bool pop, bool copy)
5728 char *name = bc_program_name(code, bgn);
5730 r.t = BC_RESULT_VAR;
5735 BcVec *v = bc_program_search(name, true);
5736 BcNum *num = bc_vec_top(v);
5739 if (!BC_PROG_STACK(v, 2 - copy)) {
5740 RETURN_STATUS(bc_error_stack_has_too_few_elements());
5743 if (!BC_PROG_STR(num)) {
5744 r.t = BC_RESULT_TEMP;
5745 bc_num_init_DEF_SIZE(&r.d.n);
5746 bc_num_copy(&r.d.n, num);
5748 r.t = BC_RESULT_STR;
5749 r.d.id.idx = num->rdx;
5752 if (!copy) bc_vec_pop(v);
5756 bc_vec_push(&G.prog.results, &r);
5758 RETURN_STATUS(BC_STATUS_SUCCESS);
5760 #define zbc_program_pushVar(...) (bc_program_pushVar(__VA_ARGS__) COMMA_SUCCESS)
5762 static BC_STATUS zbc_program_pushArray(char *code, size_t *bgn, char inst)
5764 BcStatus s = BC_STATUS_SUCCESS;
5768 r.d.id.name = bc_program_name(code, bgn);
5770 if (inst == BC_INST_ARRAY) {
5771 r.t = BC_RESULT_ARRAY;
5772 bc_vec_push(&G.prog.results, &r);
5777 s = zbc_program_prep(&operand, &num);
5779 s = zbc_num_ulong(num, &temp);
5782 if (temp > BC_MAX_DIM) {
5783 s = bc_error("array too long; must be [1,"BC_MAX_DIM_STR"]");
5787 r.d.id.idx = (size_t) temp;
5788 bc_program_retire(&r, BC_RESULT_ARRAY_ELEM);
5791 if (s) free(r.d.id.name);
5794 #define zbc_program_pushArray(...) (zbc_program_pushArray(__VA_ARGS__) COMMA_SUCCESS)
5797 static BC_STATUS zbc_program_incdec(char inst)
5800 BcResult *ptr, res, copy;
5804 s = zbc_program_prep(&ptr, &num);
5805 if (s) RETURN_STATUS(s);
5807 if (inst == BC_INST_INC_POST || inst == BC_INST_DEC_POST) {
5808 copy.t = BC_RESULT_TEMP;
5809 bc_num_init(©.d.n, num->len);
5810 bc_num_copy(©.d.n, num);
5813 res.t = BC_RESULT_ONE;
5814 inst = inst == BC_INST_INC_PRE || inst == BC_INST_INC_POST ?
5815 BC_INST_ASSIGN_PLUS :
5816 BC_INST_ASSIGN_MINUS;
5818 bc_vec_push(&G.prog.results, &res);
5819 s = zbc_program_assign(inst);
5820 if (s) RETURN_STATUS(s);
5822 if (inst2 == BC_INST_INC_POST || inst2 == BC_INST_DEC_POST) {
5823 bc_vec_pop(&G.prog.results);
5824 bc_vec_push(&G.prog.results, ©);
5829 #define zbc_program_incdec(...) (zbc_program_incdec(__VA_ARGS__) COMMA_SUCCESS)
5831 static BC_STATUS zbc_program_call(char *code, size_t *idx)
5840 nparams = bc_program_index(code, idx);
5842 ip.func = bc_program_index(code, idx);
5843 func = bc_program_func(ip.func);
5845 if (func->code.len == 0) {
5846 RETURN_STATUS(bc_error("undefined function"));
5848 if (nparams != func->nparams) {
5849 RETURN_STATUS(bc_error_fmt("function has %u parameters, but called with %u", func->nparams, nparams));
5851 ip.len = G.prog.results.len - nparams;
5853 for (i = 0; i < nparams; ++i) {
5856 a = bc_vec_item(&func->autos, nparams - 1 - i);
5857 arg = bc_vec_top(&G.prog.results);
5859 if ((!a->idx) != (arg->t == BC_RESULT_ARRAY) || arg->t == BC_RESULT_STR)
5860 RETURN_STATUS(bc_error_variable_is_wrong_type());
5862 s = zbc_program_copyToVar(a->name, a->idx);
5863 if (s) RETURN_STATUS(s);
5866 for (; i < func->autos.len; ++i) {
5869 a = bc_vec_item(&func->autos, i);
5870 v = bc_program_search(a->name, a->idx);
5873 bc_num_init_DEF_SIZE(¶m.n);
5874 bc_vec_push(v, ¶m.n);
5876 bc_array_init(¶m.v, true);
5877 bc_vec_push(v, ¶m.v);
5881 bc_vec_push(&G.prog.exestack, &ip);
5883 RETURN_STATUS(BC_STATUS_SUCCESS);
5885 #define zbc_program_call(...) (zbc_program_call(__VA_ARGS__) COMMA_SUCCESS)
5887 static BC_STATUS zbc_program_return(char inst)
5892 BcInstPtr *ip = bc_vec_top(&G.prog.exestack);
5894 if (!BC_PROG_STACK(&G.prog.results, ip->len + inst == BC_INST_RET))
5895 RETURN_STATUS(bc_error_stack_has_too_few_elements());
5897 f = bc_program_func(ip->func);
5898 res.t = BC_RESULT_TEMP;
5900 if (inst == BC_INST_RET) {
5903 BcResult *operand = bc_vec_top(&G.prog.results);
5905 s = zbc_program_num(operand, &num, false);
5906 if (s) RETURN_STATUS(s);
5907 bc_num_init(&res.d.n, num->len);
5908 bc_num_copy(&res.d.n, num);
5910 bc_num_init_DEF_SIZE(&res.d.n);
5911 //bc_num_zero(&res.d.n); - already is
5914 // We need to pop arguments as well, so this takes that into account.
5915 for (i = 0; i < f->autos.len; ++i) {
5917 BcId *a = bc_vec_item(&f->autos, i);
5919 v = bc_program_search(a->name, a->idx);
5923 bc_vec_npop(&G.prog.results, G.prog.results.len - ip->len);
5924 bc_vec_push(&G.prog.results, &res);
5925 bc_vec_pop(&G.prog.exestack);
5927 RETURN_STATUS(BC_STATUS_SUCCESS);
5929 #define zbc_program_return(...) (zbc_program_return(__VA_ARGS__) COMMA_SUCCESS)
5932 static unsigned long bc_program_scale(BcNum *n)
5934 return (unsigned long) n->rdx;
5937 static unsigned long bc_program_len(BcNum *n)
5939 size_t len = n->len;
5941 if (n->rdx != len) return len;
5943 if (len == 0) break;
5945 if (n->num[len] != 0) break;
5950 static BC_STATUS zbc_program_builtin(char inst)
5956 bool len = inst == BC_INST_LENGTH;
5958 if (!BC_PROG_STACK(&G.prog.results, 1))
5959 RETURN_STATUS(bc_error_stack_has_too_few_elements());
5960 opnd = bc_vec_top(&G.prog.results);
5962 s = zbc_program_num(opnd, &num, false);
5963 if (s) RETURN_STATUS(s);
5966 if (!BC_PROG_NUM(opnd, num) && !len)
5967 RETURN_STATUS(bc_error_variable_is_wrong_type());
5970 bc_num_init_DEF_SIZE(&res.d.n);
5972 if (inst == BC_INST_SQRT)
5973 s = zbc_num_sqrt(num, &res.d.n, G.prog.scale);
5975 else if (len != 0 && opnd->t == BC_RESULT_ARRAY) {
5976 bc_num_ulong2num(&res.d.n, (unsigned long) ((BcVec *) num)->len);
5980 else if (len != 0 && !BC_PROG_NUM(opnd, num)) {
5982 size_t idx = opnd->t == BC_RESULT_STR ? opnd->d.id.idx : num->rdx;
5984 str = bc_program_str(idx);
5985 bc_num_ulong2num(&res.d.n, strlen(*str));
5989 bc_num_ulong2num(&res.d.n, len ? bc_program_len(num) : bc_program_scale(num));
5992 bc_program_retire(&res, BC_RESULT_TEMP);
5996 #define zbc_program_builtin(...) (zbc_program_builtin(__VA_ARGS__) COMMA_SUCCESS)
5999 static BC_STATUS zbc_program_divmod(void)
6002 BcResult *opd1, *opd2, res, res2;
6003 BcNum *n1, *n2 = NULL;
6005 s = zbc_program_binOpPrep(&opd1, &n1, &opd2, &n2, false);
6006 if (s) RETURN_STATUS(s);
6008 bc_num_init_DEF_SIZE(&res.d.n);
6009 bc_num_init(&res2.d.n, n2->len);
6011 s = zbc_num_divmod(n1, n2, &res2.d.n, &res.d.n, G.prog.scale);
6014 bc_program_binOpRetire(&res2);
6015 res.t = BC_RESULT_TEMP;
6016 bc_vec_push(&G.prog.results, &res);
6020 bc_num_free(&res2.d.n);
6021 bc_num_free(&res.d.n);
6024 #define zbc_program_divmod(...) (zbc_program_divmod(__VA_ARGS__) COMMA_SUCCESS)
6026 static BC_STATUS zbc_program_modexp(void)
6029 BcResult *r1, *r2, *r3, res;
6030 BcNum *n1, *n2, *n3;
6032 if (!BC_PROG_STACK(&G.prog.results, 3))
6033 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6034 s = zbc_program_binOpPrep(&r2, &n2, &r3, &n3, false);
6035 if (s) RETURN_STATUS(s);
6037 r1 = bc_vec_item_rev(&G.prog.results, 2);
6038 s = zbc_program_num(r1, &n1, false);
6039 if (s) RETURN_STATUS(s);
6040 if (!BC_PROG_NUM(r1, n1))
6041 RETURN_STATUS(bc_error_variable_is_wrong_type());
6043 // Make sure that the values have their pointers updated, if necessary.
6044 if (r1->t == BC_RESULT_VAR || r1->t == BC_RESULT_ARRAY_ELEM) {
6045 if (r1->t == r2->t) {
6046 s = zbc_program_num(r2, &n2, false);
6047 if (s) RETURN_STATUS(s);
6049 if (r1->t == r3->t) {
6050 s = zbc_program_num(r3, &n3, false);
6051 if (s) RETURN_STATUS(s);
6055 bc_num_init(&res.d.n, n3->len);
6056 s = zbc_num_modexp(n1, n2, n3, &res.d.n);
6059 bc_vec_pop(&G.prog.results);
6060 bc_program_binOpRetire(&res);
6064 bc_num_free(&res.d.n);
6067 #define zbc_program_modexp(...) (zbc_program_modexp(__VA_ARGS__) COMMA_SUCCESS)
6069 static void bc_program_stackLen(void)
6072 size_t len = G.prog.results.len;
6074 res.t = BC_RESULT_TEMP;
6076 bc_num_init_DEF_SIZE(&res.d.n);
6077 bc_num_ulong2num(&res.d.n, len);
6078 bc_vec_push(&G.prog.results, &res);
6081 static BC_STATUS zbc_program_asciify(void)
6086 char *str, *str2, c;
6087 size_t len = G.prog.strs.len, idx;
6090 if (!BC_PROG_STACK(&G.prog.results, 1))
6091 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6092 r = bc_vec_top(&G.prog.results);
6094 num = NULL; // TODO: is this NULL needed?
6095 s = zbc_program_num(r, &num, false);
6096 if (s) RETURN_STATUS(s);
6098 if (BC_PROG_NUM(r, num)) {
6101 bc_num_init_DEF_SIZE(&n);
6102 bc_num_copy(&n, num);
6103 bc_num_truncate(&n, n.rdx);
6105 //TODO: have BcNumSmall type, with static buffer
6106 bc_num_init_DEF_SIZE(&strmb);
6107 bc_num_ulong2num(&strmb, 0x100);
6108 s = zbc_num_mod(&n, &strmb, &n, 0);
6109 bc_num_free(&strmb);
6111 if (s) goto num_err;
6112 s = zbc_num_ulong(&n, &val);
6113 if (s) goto num_err;
6119 idx = (r->t == BC_RESULT_STR) ? r->d.id.idx : num->rdx;
6120 str2 = *bc_program_str(idx);
6126 //str[1] = '\0'; - already is
6128 str2 = xstrdup(str);
6129 bc_program_addFunc(str2, &idx);
6131 if (idx != len + BC_PROG_REQ_FUNCS) {
6132 for (idx = 0; idx < G.prog.strs.len; ++idx) {
6133 if (strcmp(*bc_program_str(idx), str) == 0) {
6140 bc_vec_push(&G.prog.strs, &str);
6142 res.t = BC_RESULT_STR;
6144 bc_vec_pop(&G.prog.results);
6145 bc_vec_push(&G.prog.results, &res);
6147 RETURN_STATUS(BC_STATUS_SUCCESS);
6152 #define zbc_program_asciify(...) (zbc_program_asciify(__VA_ARGS__) COMMA_SUCCESS)
6154 static BC_STATUS zbc_program_printStream(void)
6162 if (!BC_PROG_STACK(&G.prog.results, 1))
6163 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6164 r = bc_vec_top(&G.prog.results);
6166 s = zbc_program_num(r, &n, false);
6167 if (s) RETURN_STATUS(s);
6169 if (BC_PROG_NUM(r, n)) {
6170 s = zbc_num_printNum(n, 0x100, 1, bc_num_printChar);
6172 idx = (r->t == BC_RESULT_STR) ? r->d.id.idx : n->rdx;
6173 str = *bc_program_str(idx);
6179 #define zbc_program_printStream(...) (zbc_program_printStream(__VA_ARGS__) COMMA_SUCCESS)
6181 static BC_STATUS zbc_program_nquit(void)
6188 s = zbc_program_prep(&opnd, &num);
6189 if (s) RETURN_STATUS(s);
6190 s = zbc_num_ulong(num, &val);
6191 if (s) RETURN_STATUS(s);
6193 bc_vec_pop(&G.prog.results);
6195 if (G.prog.exestack.len < val)
6196 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6197 if (G.prog.exestack.len == val) {
6198 QUIT_OR_RETURN_TO_MAIN;
6201 bc_vec_npop(&G.prog.exestack, val);
6205 #define zbc_program_nquit(...) (zbc_program_nquit(__VA_ARGS__) COMMA_SUCCESS)
6207 static BC_STATUS zbc_program_execStr(char *code, size_t *bgn, bool cond)
6209 BcStatus s = BC_STATUS_SUCCESS;
6217 if (!BC_PROG_STACK(&G.prog.results, 1))
6218 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6220 r = bc_vec_top(&G.prog.results);
6223 BcNum *n = n; // for compiler
6226 char *then_name = bc_program_name(code, bgn);
6227 char *else_name = NULL;
6229 if (code[*bgn] == BC_PARSE_STREND)
6232 else_name = bc_program_name(code, bgn);
6234 exec = r->d.n.len != 0;
6236 if (!exec && else_name != NULL) {
6243 v = bc_program_search(name, true);
6250 if (!exec) goto exit;
6251 if (!BC_PROG_STR(n)) {
6252 s = bc_error_variable_is_wrong_type();
6258 if (r->t == BC_RESULT_STR) {
6260 } else if (r->t == BC_RESULT_VAR) {
6262 s = zbc_program_num(r, &n, false);
6263 if (s || !BC_PROG_STR(n)) goto exit;
6269 fidx = sidx + BC_PROG_REQ_FUNCS;
6271 str = bc_program_str(sidx);
6272 f = bc_program_func(fidx);
6274 if (f->code.len == 0) {
6275 bc_parse_create(&prs, fidx);
6276 s = zbc_parse_text_init(&prs, *str);
6278 s = zcommon_parse_expr(&prs, BC_PARSE_NOCALL);
6281 if (prs.l.t.t != BC_LEX_EOF) {
6282 s = bc_error_bad_expression();
6286 bc_parse_free(&prs);
6290 ip.len = G.prog.results.len;
6293 bc_vec_pop(&G.prog.results);
6294 bc_vec_push(&G.prog.exestack, &ip);
6296 RETURN_STATUS(BC_STATUS_SUCCESS);
6298 bc_parse_free(&prs);
6299 f = bc_program_func(fidx);
6300 bc_vec_pop_all(&f->code);
6302 bc_vec_pop(&G.prog.results);
6305 #define zbc_program_execStr(...) (zbc_program_execStr(__VA_ARGS__) COMMA_SUCCESS)
6308 static void bc_program_pushGlobal(char inst)
6313 res.t = inst - BC_INST_IBASE + BC_RESULT_IBASE;
6314 if (inst == BC_INST_IBASE)
6315 val = (unsigned long) G.prog.ib_t;
6316 else if (inst == BC_INST_SCALE)
6317 val = (unsigned long) G.prog.scale;
6319 val = (unsigned long) G.prog.ob_t;
6321 bc_num_init_DEF_SIZE(&res.d.n);
6322 bc_num_ulong2num(&res.d.n, val);
6323 bc_vec_push(&G.prog.results, &res);
6326 static void bc_program_addFunc(char *name, size_t *idx)
6328 BcId entry, *entry_ptr;
6333 entry.idx = G.prog.fns.len;
6335 inserted = bc_map_insert(&G.prog.fn_map, &entry, idx);
6336 if (!inserted) free(name);
6338 entry_ptr = bc_vec_item(&G.prog.fn_map, *idx);
6339 *idx = entry_ptr->idx;
6342 BcFunc *func = bc_program_func(entry_ptr->idx);
6344 // We need to reset these, so the function can be repopulated.
6346 bc_vec_pop_all(&func->autos);
6347 bc_vec_pop_all(&func->code);
6348 bc_vec_pop_all(&func->labels);
6351 bc_vec_push(&G.prog.fns, &f);
6355 static BC_STATUS zbc_program_exec(void)
6359 BcInstPtr *ip = bc_vec_top(&G.prog.exestack);
6360 BcFunc *func = bc_program_func(ip->func);
6361 char *code = func->code.v;
6363 dbg_exec("func:%zd bytes:%zd ip:%zd", ip->func, func->code.len, ip->idx);
6364 while (ip->idx < func->code.len) {
6365 BcStatus s = BC_STATUS_SUCCESS;
6366 char inst = code[ip->idx++];
6368 dbg_exec("inst at %zd:%d", ip->idx - 1, inst);
6371 case BC_INST_JUMP_ZERO: {
6373 dbg_exec("BC_INST_JUMP_ZERO:");
6374 s = zbc_program_prep(&ptr, &num);
6375 if (s) RETURN_STATUS(s);
6376 zero = (bc_num_cmp(num, &G.prog.zero) == 0);
6377 bc_vec_pop(&G.prog.results);
6379 bc_program_index(code, &ip->idx);
6382 // else: fall through
6384 case BC_INST_JUMP: {
6385 size_t idx = bc_program_index(code, &ip->idx);
6386 size_t *addr = bc_vec_item(&func->labels, idx);
6387 dbg_exec("BC_INST_JUMP: to %ld", (long)*addr);
6392 dbg_exec("BC_INST_CALL:");
6393 s = zbc_program_call(code, &ip->idx);
6394 goto read_updated_ip;
6395 case BC_INST_INC_PRE:
6396 case BC_INST_DEC_PRE:
6397 case BC_INST_INC_POST:
6398 case BC_INST_DEC_POST:
6399 dbg_exec("BC_INST_INCDEC:");
6400 s = zbc_program_incdec(inst);
6403 dbg_exec("BC_INST_HALT:");
6404 QUIT_OR_RETURN_TO_MAIN;
6408 dbg_exec("BC_INST_RET[0]:");
6409 s = zbc_program_return(inst);
6410 goto read_updated_ip;
6411 case BC_INST_BOOL_OR:
6412 case BC_INST_BOOL_AND:
6414 case BC_INST_REL_EQ:
6415 case BC_INST_REL_LE:
6416 case BC_INST_REL_GE:
6417 case BC_INST_REL_NE:
6418 case BC_INST_REL_LT:
6419 case BC_INST_REL_GT:
6420 dbg_exec("BC_INST_BOOL:");
6421 s = zbc_program_logical(inst);
6424 dbg_exec("BC_INST_READ:");
6425 s = zbc_program_read();
6426 goto read_updated_ip;
6428 dbg_exec("BC_INST_VAR:");
6429 s = zbc_program_pushVar(code, &ip->idx, false, false);
6431 case BC_INST_ARRAY_ELEM:
6433 dbg_exec("BC_INST_ARRAY[_ELEM]:");
6434 s = zbc_program_pushArray(code, &ip->idx, inst);
6437 r.t = BC_RESULT_LAST;
6438 bc_vec_push(&G.prog.results, &r);
6443 bc_program_pushGlobal(inst);
6445 case BC_INST_SCALE_FUNC:
6446 case BC_INST_LENGTH:
6448 dbg_exec("BC_INST_builtin:");
6449 s = zbc_program_builtin(inst);
6452 dbg_exec("BC_INST_NUM:");
6453 r.t = BC_RESULT_CONSTANT;
6454 r.d.id.idx = bc_program_index(code, &ip->idx);
6455 bc_vec_push(&G.prog.results, &r);
6458 dbg_exec("BC_INST_POP:");
6459 if (!BC_PROG_STACK(&G.prog.results, 1))
6460 s = bc_error_stack_has_too_few_elements();
6462 bc_vec_pop(&G.prog.results);
6464 case BC_INST_POP_EXEC:
6465 dbg_exec("BC_INST_POP_EXEC:");
6466 bc_vec_pop(&G.prog.exestack);
6469 case BC_INST_PRINT_POP:
6470 case BC_INST_PRINT_STR:
6471 dbg_exec("BC_INST_PRINTxyz:");
6472 s = zbc_program_print(inst, 0);
6475 dbg_exec("BC_INST_STR:");
6476 r.t = BC_RESULT_STR;
6477 r.d.id.idx = bc_program_index(code, &ip->idx);
6478 bc_vec_push(&G.prog.results, &r);
6481 case BC_INST_MULTIPLY:
6482 case BC_INST_DIVIDE:
6483 case BC_INST_MODULUS:
6486 dbg_exec("BC_INST_binaryop:");
6487 s = zbc_program_op(inst);
6489 case BC_INST_BOOL_NOT:
6490 dbg_exec("BC_INST_BOOL_NOT:");
6491 s = zbc_program_prep(&ptr, &num);
6492 if (s) RETURN_STATUS(s);
6493 bc_num_init_DEF_SIZE(&r.d.n);
6494 if (!bc_num_cmp(num, &G.prog.zero))
6496 //else bc_num_zero(&r.d.n); - already is
6497 bc_program_retire(&r, BC_RESULT_TEMP);
6500 dbg_exec("BC_INST_NEG:");
6501 s = zbc_program_negate();
6504 case BC_INST_ASSIGN_POWER:
6505 case BC_INST_ASSIGN_MULTIPLY:
6506 case BC_INST_ASSIGN_DIVIDE:
6507 case BC_INST_ASSIGN_MODULUS:
6508 case BC_INST_ASSIGN_PLUS:
6509 case BC_INST_ASSIGN_MINUS:
6511 case BC_INST_ASSIGN:
6512 dbg_exec("BC_INST_ASSIGNxyz:");
6513 s = zbc_program_assign(inst);
6516 case BC_INST_MODEXP:
6517 s = zbc_program_modexp();
6519 case BC_INST_DIVMOD:
6520 s = zbc_program_divmod();
6522 case BC_INST_EXECUTE:
6523 case BC_INST_EXEC_COND:
6524 s = zbc_program_execStr(code, &ip->idx, inst == BC_INST_EXEC_COND);
6525 goto read_updated_ip;
6526 case BC_INST_PRINT_STACK: {
6528 for (idx = 0; idx < G.prog.results.len; ++idx) {
6529 s = zbc_program_print(BC_INST_PRINT, idx);
6534 case BC_INST_CLEAR_STACK:
6535 bc_vec_pop_all(&G.prog.results);
6537 case BC_INST_STACK_LEN:
6538 bc_program_stackLen();
6540 case BC_INST_DUPLICATE:
6541 if (!BC_PROG_STACK(&G.prog.results, 1))
6542 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6543 ptr = bc_vec_top(&G.prog.results);
6544 bc_result_copy(&r, ptr);
6545 bc_vec_push(&G.prog.results, &r);
6547 case BC_INST_SWAP: {
6549 if (!BC_PROG_STACK(&G.prog.results, 2))
6550 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6551 ptr = bc_vec_item_rev(&G.prog.results, 0);
6552 ptr2 = bc_vec_item_rev(&G.prog.results, 1);
6553 memcpy(&r, ptr, sizeof(BcResult));
6554 memcpy(ptr, ptr2, sizeof(BcResult));
6555 memcpy(ptr2, &r, sizeof(BcResult));
6558 case BC_INST_ASCIIFY:
6559 s = zbc_program_asciify();
6561 case BC_INST_PRINT_STREAM:
6562 s = zbc_program_printStream();
6565 case BC_INST_PUSH_VAR: {
6566 bool copy = inst == BC_INST_LOAD;
6567 s = zbc_program_pushVar(code, &ip->idx, true, copy);
6570 case BC_INST_PUSH_TO_VAR: {
6571 char *name = bc_program_name(code, &ip->idx);
6572 s = zbc_program_copyToVar(name, true);
6577 dbg_exec("BC_INST_NEG:");
6578 if (G.prog.exestack.len <= 2)
6579 QUIT_OR_RETURN_TO_MAIN;
6580 bc_vec_npop(&G.prog.exestack, 2);
6583 s = zbc_program_nquit();
6584 //goto read_updated_ip; - just fall through to it
6587 // Instruction stack has changed, read new pointers
6588 ip = bc_vec_top(&G.prog.exestack);
6589 func = bc_program_func(ip->func);
6590 code = func->code.v;
6591 dbg_exec("func:%zd bytes:%zd ip:%zd", ip->func, func->code.len, ip->idx);
6594 if (s || G_interrupt) {
6603 RETURN_STATUS(BC_STATUS_SUCCESS);
6605 #define zbc_program_exec(...) (zbc_program_exec(__VA_ARGS__) COMMA_SUCCESS)
6607 static unsigned bc_vm_envLen(const char *var)
6613 len = BC_NUM_PRINT_WIDTH;
6614 if (!lenv) return len;
6616 len = bb_strtou(lenv, NULL, 10) - 1;
6617 if (errno || len < 2 || len >= INT_MAX)
6618 len = BC_NUM_PRINT_WIDTH;
6623 static BC_STATUS zbc_vm_process(const char *text)
6627 dbg_lex_enter("%s:%d entered", __func__, __LINE__);
6628 s = zbc_parse_text_init(&G.prs, text);
6629 if (s) RETURN_STATUS(s);
6631 while (G.prs.l.t.t != BC_LEX_EOF) {
6632 dbg_lex("%s:%d G.prs.l.t.t:%d", __func__, __LINE__, G.prs.l.t.t);
6633 s = zcommon_parse(&G.prs);
6634 if (s) RETURN_STATUS(s);
6635 s = zbc_program_exec();
6642 dbg_lex_done("%s:%d done", __func__, __LINE__);
6645 #define zbc_vm_process(...) (zbc_vm_process(__VA_ARGS__) COMMA_SUCCESS)
6647 static BC_STATUS zbc_vm_execute_FILE(FILE *fp, const char *filename)
6649 // So far bc/dc have no way to include a file from another file,
6650 // therefore we know G.prog.file == NULL on entry
6651 //const char *sv_file;
6654 G.prog.file = filename;
6656 bc_lex_file(&G.prs.l);
6659 s = zbc_vm_process("");
6660 // We do not stop looping on errors here if reading stdin.
6661 // Example: start interactive bc and enter "return".
6662 // It should say "'return' not in a function"
6663 // but should not exit.
6664 } while (G.input_fp == stdin);
6668 #define zbc_vm_execute_FILE(...) (zbc_vm_execute_FILE(__VA_ARGS__) COMMA_SUCCESS)
6670 static BC_STATUS zbc_vm_file(const char *file)
6675 fp = xfopen_for_read(file);
6676 s = zbc_vm_execute_FILE(fp, file);
6681 #define zbc_vm_file(...) (zbc_vm_file(__VA_ARGS__) COMMA_SUCCESS)
6684 static void bc_vm_info(void)
6686 printf("%s "BB_VER"\n"
6687 "Copyright (c) 2018 Gavin D. Howard and contributors\n"
6691 static void bc_args(char **argv)
6697 #if ENABLE_FEATURE_BC_LONG_OPTIONS
6698 opts = option_mask32 |= getopt32long(argv, "wvsqli",
6699 "warn\0" No_argument "w"
6700 "version\0" No_argument "v"
6701 "standard\0" No_argument "s"
6702 "quiet\0" No_argument "q"
6703 "mathlib\0" No_argument "l"
6704 "interactive\0" No_argument "i"
6707 opts = option_mask32 |= getopt32(argv, "wvsqli");
6709 if (getenv("POSIXLY_CORRECT"))
6710 option_mask32 |= BC_FLAG_S;
6712 if (opts & BC_FLAG_V) {
6717 for (i = optind; argv[i]; ++i)
6718 bc_vec_push(&G.files, argv + i);
6721 static void bc_vm_envArgs(void)
6725 char *env_args = getenv("BC_ENV_ARGS");
6727 if (!env_args) return;
6729 G.env_args = xstrdup(env_args);
6732 bc_vec_init(&v, sizeof(char *), NULL);
6734 while (*(buf = skip_whitespace(buf)) != '\0') {
6735 bc_vec_push(&v, &buf);
6736 buf = skip_non_whitespace(buf);
6742 // NULL terminate, and pass argv[] so that first arg is argv[1]
6743 if (sizeof(int) == sizeof(char*)) {
6744 bc_vec_push(&v, &const_int_0);
6746 static char *const nullptr = NULL;
6747 bc_vec_push(&v, &nullptr);
6749 bc_args(((char **)v.v) - 1);
6754 static const char bc_lib[] ALIGN1 = {
6757 "\n" "auto b,s,n,r,d,i,p,f,v"
6758 ////////////////"if(x<0)return(1/e(-x))" // and drop 'n' and x<0 logic below
6759 //^^^^^^^^^^^^^^^^ this would work, and is even more precise than GNU bc:
6760 //e(-.998896): GNU:.36828580434569428695
6761 // above code:.36828580434569428696
6762 // actual value:.3682858043456942869594...
6763 // but for now let's be "GNU compatible"
6772 "\n" "scale=scale(x)+1"
6782 "\n" "for(i=2;v;++i){"
6788 "\n" "while(d--)r*=r"
6791 "\n" "if(n)return(1/r)"
6795 "\n" "auto b,s,r,p,a,q,i,v"
6799 "\n" "r=(1-10^scale)/1"
6810 "\n" "while(x<=.5){"
6814 "\n" "r=a=(x-1)/(x+1)"
6817 "\n" "for(i=3;v;i+=2){"
6828 "\n" "auto b,s,r,a,q,i"
6829 "\n" "if(x<0)return(-s(-x))"
6833 "\n" "scale=1.1*s+2"
6842 "\n" "for(i=3;a;i+=2){"
6843 "\n" "a*=q/(i*(i-1))"
6856 "\n" "x=s(2*a(1)+x)"
6862 "\n" "auto b,s,r,n,a,m,t,f,i,u"
6870 "\n" "if(scale<65){"
6871 "\n" "if(x==1)return(.7853981633974483096156608458198757210492923498437764552437361480/n)"
6872 "\n" "if(x==.2)return(.1973955598498807583700497651947902934475851037878521015176889402/n)"
6882 "\n" "x=(x-.2)/(1+.2*x)"
6887 "\n" "for(i=3;t;i+=2){"
6894 "\n" "return((m*a+r)/n)"
6896 "\n" "define j(n,x){"
6897 "\n" "auto b,s,o,a,i,v,f"
6908 "\n" "for(i=2;i<=n;++i)a*=i"
6910 "\n" "a=(x^n)/2^n/a"
6913 "\n" "scale+=length(a)-scale(a)"
6914 "\n" "for(i=1;v;++i){"
6915 "\n" "v=v*f/i/(n+i)"
6921 "\n" "return(a*r/1)"
6926 static BC_STATUS zbc_vm_exec(void)
6932 if (option_mask32 & BC_FLAG_L) {
6933 // We know that internal library is not buggy,
6934 // thus error checking is normally disabled.
6935 # define DEBUG_LIB 0
6936 bc_lex_file(&G.prs.l);
6937 s = zbc_vm_process(bc_lib);
6938 if (DEBUG_LIB && s) RETURN_STATUS(s);
6942 s = BC_STATUS_SUCCESS;
6943 for (i = 0; !s && i < G.files.len; ++i)
6944 s = zbc_vm_file(*((char **) bc_vec_item(&G.files, i)));
6945 if (ENABLE_FEATURE_CLEAN_UP && s && !G_ttyin) {
6946 // Debug config, non-interactive mode:
6947 // return all the way back to main.
6948 // Non-debug builds do not come here, they exit.
6952 if (IS_BC || (option_mask32 & BC_FLAG_I))
6953 s = zbc_vm_execute_FILE(stdin, /*filename:*/ NULL);
6957 #define zbc_vm_exec(...) (zbc_vm_exec(__VA_ARGS__) COMMA_SUCCESS)
6959 #if ENABLE_FEATURE_CLEAN_UP
6960 static void bc_program_free(void)
6962 bc_vec_free(&G.prog.fns);
6963 bc_vec_free(&G.prog.fn_map);
6964 bc_vec_free(&G.prog.vars);
6965 bc_vec_free(&G.prog.var_map);
6966 bc_vec_free(&G.prog.arrs);
6967 bc_vec_free(&G.prog.arr_map);
6968 bc_vec_free(&G.prog.strs);
6969 bc_vec_free(&G.prog.consts);
6970 bc_vec_free(&G.prog.results);
6971 bc_vec_free(&G.prog.exestack);
6972 bc_num_free(&G.prog.last);
6973 bc_num_free(&G.prog.zero);
6974 bc_num_free(&G.prog.one);
6975 bc_vec_free(&G.input_buffer);
6978 static void bc_vm_free(void)
6980 bc_vec_free(&G.files);
6982 bc_parse_free(&G.prs);
6987 static void bc_program_init(void)
6992 // memset(&G.prog, 0, sizeof(G.prog)); - already is
6993 memset(&ip, 0, sizeof(BcInstPtr));
6995 // G.prog.nchars = G.prog.scale = 0; - already is
6999 bc_num_init_DEF_SIZE(&G.prog.last);
7000 //bc_num_zero(&G.prog.last); - already is
7002 bc_num_init_DEF_SIZE(&G.prog.zero);
7003 //bc_num_zero(&G.prog.zero); - already is
7005 bc_num_init_DEF_SIZE(&G.prog.one);
7006 bc_num_one(&G.prog.one);
7008 bc_vec_init(&G.prog.fns, sizeof(BcFunc), bc_func_free);
7009 bc_vec_init(&G.prog.fn_map, sizeof(BcId), bc_id_free);
7011 bc_program_addFunc(xstrdup("(main)"), &idx);
7012 bc_program_addFunc(xstrdup("(read)"), &idx);
7014 bc_vec_init(&G.prog.vars, sizeof(BcVec), bc_vec_free);
7015 bc_vec_init(&G.prog.var_map, sizeof(BcId), bc_id_free);
7017 bc_vec_init(&G.prog.arrs, sizeof(BcVec), bc_vec_free);
7018 bc_vec_init(&G.prog.arr_map, sizeof(BcId), bc_id_free);
7020 bc_vec_init(&G.prog.strs, sizeof(char *), bc_string_free);
7021 bc_vec_init(&G.prog.consts, sizeof(char *), bc_string_free);
7022 bc_vec_init(&G.prog.results, sizeof(BcResult), bc_result_free);
7023 bc_vec_init(&G.prog.exestack, sizeof(BcInstPtr), NULL);
7024 bc_vec_push(&G.prog.exestack, &ip);
7026 bc_char_vec_init(&G.input_buffer);
7029 static int bc_vm_init(const char *env_len)
7031 #if ENABLE_FEATURE_EDITING
7032 G.line_input_state = new_line_input_t(DO_HISTORY);
7034 G.prog.len = bc_vm_envLen(env_len);
7036 bc_vec_init(&G.files, sizeof(char *), NULL);
7037 IF_BC(if (IS_BC) bc_vm_envArgs();)
7039 bc_parse_create(&G.prs, BC_PROG_MAIN);
7041 //TODO: in GNU bc, the check is (isatty(0) && isatty(1)),
7042 //-i option unconditionally enables this regardless of isatty():
7044 #if ENABLE_FEATURE_BC_SIGNALS
7046 // With SA_RESTART, most system calls will restart
7047 // (IOW: they won't fail with EINTR).
7048 // In particular, this means ^C won't cause
7049 // stdout to get into "error state" if SIGINT hits
7050 // within write() syscall.
7052 // The downside is that ^C while tty input is taken
7053 // will only be handled after [Enter] since read()
7054 // from stdin is not interrupted by ^C either,
7055 // it restarts, thus fgetc() does not return on ^C.
7056 // (This problem manifests only if line editing is disabled)
7057 signal_SA_RESTART_empty_mask(SIGINT, record_signo);
7059 // Without SA_RESTART, this exhibits a bug:
7060 // "while (1) print 1" and try ^C-ing it.
7061 // Intermittently, instead of returning to input line,
7062 // you'll get "output error: Interrupted system call"
7064 //signal_no_SA_RESTART_empty_mask(SIGINT, record_signo);
7068 return 0; // "not a tty"
7071 static BcStatus bc_vm_run(void)
7073 BcStatus st = zbc_vm_exec();
7074 #if ENABLE_FEATURE_CLEAN_UP
7075 if (G_exiting) // it was actually "halt" or "quit"
7078 # if ENABLE_FEATURE_EDITING
7079 free_line_input_t(G.line_input_state);
7083 dbg_exec("exiting with exitcode %d", st);
7088 int bc_main(int argc, char **argv) MAIN_EXTERNALLY_VISIBLE;
7089 int bc_main(int argc UNUSED_PARAM, char **argv)
7095 is_tty = bc_vm_init("BC_LINE_LENGTH");
7099 if (is_tty && !(option_mask32 & BC_FLAG_Q))
7107 int dc_main(int argc, char **argv) MAIN_EXTERNALLY_VISIBLE;
7108 int dc_main(int argc UNUSED_PARAM, char **argv)
7114 // TODO: dc (GNU bc 1.07.1) 1.4.1 seems to use width
7115 // 1 char wider than bc from the same package.
7116 // Both default width, and xC_LINE_LENGTH=N are wider:
7117 // "DC_LINE_LENGTH=5 dc -e'123456 p'" prints:
7120 // "echo '123456' | BC_LINE_LENGTH=5 bc" prints:
7123 // Do the same, or it's a bug?
7124 bc_vm_init("DC_LINE_LENGTH");
7126 // Run -e'SCRIPT' and -fFILE in order of appearance, then handle FILEs
7127 noscript = BC_FLAG_I;
7129 int n = getopt(argc, argv, "e:f:x");
7135 n = zbc_vm_process(optarg);
7140 n = zbc_vm_file(optarg);
7144 option_mask32 |= DC_FLAG_X;
7154 bc_vec_push(&G.files, argv++);
7157 option_mask32 |= noscript; // set BC_FLAG_I if we need to interpret stdin
7163 #endif // not DC_SMALL