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
174 static uint8_t lex_indent;
175 #define dbg_lex(...) \
177 fprintf(stderr, "%*s", lex_indent, ""); \
178 bb_error_msg(__VA_ARGS__); \
180 #define dbg_lex_enter(...) \
182 dbg_lex(__VA_ARGS__); \
185 #define dbg_lex_done(...) \
188 dbg_lex(__VA_ARGS__); \
191 # define dbg_lex(...) ((void)0)
192 # define dbg_lex_enter(...) ((void)0)
193 # define dbg_lex_done(...) ((void)0)
197 # define dbg_exec(...) bb_error_msg(__VA_ARGS__)
199 # define dbg_exec(...) ((void)0)
202 typedef enum BcStatus {
203 BC_STATUS_SUCCESS = 0,
204 BC_STATUS_FAILURE = 1,
205 BC_STATUS_PARSE_EMPTY_EXP = 2, // bc_parse_expr_empty_ok() uses this
208 #define BC_VEC_INVALID_IDX ((size_t) -1)
209 #define BC_VEC_START_CAP (1 << 5)
211 typedef void (*BcVecFree)(void *) FAST_FUNC;
213 typedef struct BcVec {
221 typedef signed char BcDig;
223 typedef struct BcNum {
231 #define BC_NUM_MAX_IBASE ((unsigned long) 16)
232 // larger value might speed up BIGNUM calculations a bit:
233 #define BC_NUM_DEF_SIZE (16)
234 #define BC_NUM_PRINT_WIDTH (69)
236 #define BC_NUM_KARATSUBA_LEN (32)
238 typedef enum BcInst {
267 BC_INST_ASSIGN_POWER,
268 BC_INST_ASSIGN_MULTIPLY,
269 BC_INST_ASSIGN_DIVIDE,
270 BC_INST_ASSIGN_MODULUS,
272 BC_INST_ASSIGN_MINUS,
318 BC_INST_PRINT_STREAM,
333 BC_INST_INVALID = -1,
337 typedef struct BcId {
342 typedef struct BcFunc {
349 typedef enum BcResultType {
353 BC_RESULT_ARRAY_ELEM,
362 // These are between to calculate ibase, obase, and last from instructions.
369 typedef union BcResultData {
375 typedef struct BcResult {
380 typedef struct BcInstPtr {
386 // BC_LEX_NEG is not used in lexing; it is only for parsing.
387 typedef enum BcLexType {
414 BC_LEX_OP_ASSIGN_POWER,
415 BC_LEX_OP_ASSIGN_MULTIPLY,
416 BC_LEX_OP_ASSIGN_DIVIDE,
417 BC_LEX_OP_ASSIGN_MODULUS,
418 BC_LEX_OP_ASSIGN_PLUS,
419 BC_LEX_OP_ASSIGN_MINUS,
432 BC_LEX_LBRACE, // '{' is 0x7B, '}' is 0x7D,
434 BC_LEX_RBRACE, // should be LBRACE+2: code uses (c - '{' + BC_LEX_LBRACE)
440 BC_LEX_KEY_1st_keyword,
441 BC_LEX_KEY_AUTO = BC_LEX_KEY_1st_keyword,
448 // code uses "type - BC_LEX_KEY_IBASE + BC_INST_IBASE" construct,
449 BC_LEX_KEY_IBASE, // relative order should match for: BC_INST_IBASE
451 BC_LEX_KEY_LAST, // relative order should match for: BC_INST_LAST
454 BC_LEX_KEY_OBASE, // relative order should match for: BC_INST_OBASE
492 // must match order of BC_LEX_KEY_foo etc above
494 struct BcLexKeyword {
497 #define BC_LEX_KW_ENTRY(a, b) \
498 { .name8 = a /*, .posix = b */ }
499 static const struct BcLexKeyword bc_lex_kws[20] = {
500 BC_LEX_KW_ENTRY("auto" , 1), // 0
501 BC_LEX_KW_ENTRY("break" , 1), // 1
502 BC_LEX_KW_ENTRY("continue", 0), // 2 note: this one has no terminating NUL
503 BC_LEX_KW_ENTRY("define" , 1), // 3
504 BC_LEX_KW_ENTRY("else" , 0), // 4
505 BC_LEX_KW_ENTRY("for" , 1), // 5
506 BC_LEX_KW_ENTRY("halt" , 0), // 6
507 BC_LEX_KW_ENTRY("ibase" , 1), // 7
508 BC_LEX_KW_ENTRY("if" , 1), // 8
509 BC_LEX_KW_ENTRY("last" , 0), // 9
510 BC_LEX_KW_ENTRY("length" , 1), // 10
511 BC_LEX_KW_ENTRY("limits" , 0), // 11
512 BC_LEX_KW_ENTRY("obase" , 1), // 12
513 BC_LEX_KW_ENTRY("print" , 0), // 13
514 BC_LEX_KW_ENTRY("quit" , 1), // 14
515 BC_LEX_KW_ENTRY("read" , 0), // 15
516 BC_LEX_KW_ENTRY("return" , 1), // 16
517 BC_LEX_KW_ENTRY("scale" , 1), // 17
518 BC_LEX_KW_ENTRY("sqrt" , 1), // 18
519 BC_LEX_KW_ENTRY("while" , 1), // 19
521 #undef BC_LEX_KW_ENTRY
522 #define STRING_if (bc_lex_kws[8].name8)
523 #define STRING_else (bc_lex_kws[4].name8)
524 #define STRING_while (bc_lex_kws[19].name8)
525 #define STRING_for (bc_lex_kws[5].name8)
549 #define bc_lex_kws_POSIX(i) ((1 << (i)) & POSIX_KWORD_MASK)
551 // This is a bit array that corresponds to token types. An entry is
552 // true if the token is valid in an expression, false otherwise.
553 // Used to figure out when expr parsing should stop *without error message*
554 // - 0 element indicates this condition. 1 means "this token is to be eaten
555 // as part of the expression", token can them still be determined to be invalid
556 // by later processing.
558 #define EXBITS(a,b,c,d,e,f,g,h) \
559 ((uint64_t)((a << 0)+(b << 1)+(c << 2)+(d << 3)+(e << 4)+(f << 5)+(g << 6)+(h << 7)))
560 BC_PARSE_EXPRS_BITS = 0
561 + (EXBITS(0,0,1,1,1,1,1,1) << (0*8)) // 0: eof inval ++ -- - ^ * /
562 + (EXBITS(1,1,1,1,1,1,1,1) << (1*8)) // 8: % + - == <= >= != <
563 + (EXBITS(1,1,1,1,1,1,1,1) << (2*8)) // 16: > ! || && ^= *= /= %=
564 + (EXBITS(1,1,1,0,0,1,1,0) << (3*8)) // 24: += -= = NL WS ( ) [
565 + (EXBITS(0,0,0,0,0,0,1,1) << (4*8)) // 32: , ] { ; } STR NAME NUM
566 + (EXBITS(0,0,0,0,0,0,0,1) << (5*8)) // 40: auto break cont define else for halt ibase
567 + (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?
568 + (EXBITS(0,1,1,0,0,0,0,0) << (7*8)) // 56: return scale sqrt while
571 static ALWAYS_INLINE long bc_parse_exprs(unsigned i)
573 #if ULONG_MAX > 0xffffffff
574 // 64-bit version (will not work correctly for 32-bit longs!)
575 return BC_PARSE_EXPRS_BITS & (1UL << i);
578 unsigned long m = (uint32_t)BC_PARSE_EXPRS_BITS;
580 m = (uint32_t)(BC_PARSE_EXPRS_BITS >> 32);
583 return m & (1UL << i);
587 // This is an array of data for operators that correspond to
588 // [BC_LEX_OP_INC...BC_LEX_OP_ASSIGN] token types.
589 static const uint8_t bc_parse_ops[] = {
590 #define OP(p,l) ((int)(l) * 0x10 + (p))
591 OP(0, false), OP( 0, false ), // inc dec
594 OP(3, true ), OP( 3, true ), OP( 3, true ), // mul div mod
595 OP(4, true ), OP( 4, true ), // + -
596 OP(6, true ), OP( 6, true ), OP( 6, true ), OP( 6, true ), OP( 6, true ), OP( 6, true ), // == <= >= != < >
598 OP(7, true ), OP( 7, true ), // or and
599 OP(5, false), OP( 5, false ), OP( 5, false ), OP( 5, false ), OP( 5, false ), // ^= *= /= %= +=
600 OP(5, false), OP( 5, false ), // -= =
603 #define bc_parse_op_PREC(i) (bc_parse_ops[i] & 0x0f)
604 #define bc_parse_op_LEFT(i) (bc_parse_ops[i] & 0x10)
608 static const //BcInst - should be this type. Using signed narrow type since BC_INST_INVALID is -1
611 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID, BC_INST_REL_GE,
612 BC_INST_INVALID, BC_INST_POWER, BC_INST_MULTIPLY, BC_INST_DIVIDE,
613 BC_INST_MODULUS, BC_INST_PLUS, BC_INST_MINUS,
614 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID,
615 BC_INST_INVALID, BC_INST_INVALID,
616 BC_INST_BOOL_NOT, BC_INST_INVALID, BC_INST_INVALID,
617 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID,
618 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID,
619 BC_INST_INVALID, BC_INST_INVALID, BC_INST_REL_GT, BC_INST_INVALID,
620 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID, BC_INST_REL_GE,
621 BC_INST_INVALID, BC_INST_INVALID,
622 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID,
623 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID,
624 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID, BC_INST_IBASE,
625 BC_INST_INVALID, BC_INST_INVALID, BC_INST_LENGTH, BC_INST_INVALID,
626 BC_INST_OBASE, BC_INST_PRINT, BC_INST_QUIT, BC_INST_INVALID,
627 BC_INST_INVALID, BC_INST_SCALE, BC_INST_SQRT, BC_INST_INVALID,
628 BC_INST_REL_EQ, BC_INST_MODEXP, BC_INST_DIVMOD, BC_INST_INVALID,
629 BC_INST_INVALID, BC_INST_EXECUTE, BC_INST_PRINT_STACK, BC_INST_CLEAR_STACK,
630 BC_INST_STACK_LEN, BC_INST_DUPLICATE, BC_INST_SWAP, BC_INST_POP,
631 BC_INST_ASCIIFY, BC_INST_PRINT_STREAM, BC_INST_INVALID, BC_INST_INVALID,
632 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID,
633 BC_INST_PRINT, BC_INST_NQUIT, BC_INST_SCALE_FUNC,
638 typedef struct BcLex {
651 #define BC_PARSE_STREND ((char) UCHAR_MAX)
653 #define BC_PARSE_REL (1 << 0)
654 #define BC_PARSE_PRINT (1 << 1)
655 #define BC_PARSE_NOCALL (1 << 2)
656 #define BC_PARSE_NOREAD (1 << 3)
657 #define BC_PARSE_ARRAY (1 << 4)
659 typedef struct BcParse {
673 typedef struct BcProgram {
709 #define BC_PROG_STACK(s, n) ((s)->len >= ((size_t) n))
711 #define BC_PROG_MAIN (0)
712 #define BC_PROG_READ (1)
714 #define BC_PROG_REQ_FUNCS (2)
717 #define BC_PROG_STR(n) (!(n)->num && !(n)->cap)
718 #define BC_PROG_NUM(r, n) \
719 ((r)->t != BC_RESULT_ARRAY && (r)->t != BC_RESULT_STR && !BC_PROG_STR(n))
721 #define BC_FLAG_W (1 << 0)
722 #define BC_FLAG_V (1 << 1)
723 #define BC_FLAG_S (1 << 2)
724 #define BC_FLAG_Q (1 << 3)
725 #define BC_FLAG_L (1 << 4)
726 #define BC_FLAG_I (1 << 5)
727 #define DC_FLAG_X (1 << 6)
729 #define BC_MAX(a, b) ((a) > (b) ? (a) : (b))
730 #define BC_MIN(a, b) ((a) < (b) ? (a) : (b))
732 #define BC_MAX_OBASE ((unsigned) 999)
733 #define BC_MAX_DIM ((unsigned) INT_MAX)
734 #define BC_MAX_SCALE ((unsigned) UINT_MAX)
735 #define BC_MAX_STRING ((unsigned) UINT_MAX - 1)
736 #define BC_MAX_NUM BC_MAX_STRING
737 // Unused apart from "limits" message. Just show a "biggish number" there.
738 //#define BC_MAX_NAME BC_MAX_STRING
739 //#define BC_MAX_EXP ((unsigned long) LONG_MAX)
740 //#define BC_MAX_VARS ((unsigned long) SIZE_MAX - 1)
741 #define BC_MAX_NAME_STR "999999999"
742 #define BC_MAX_EXP_STR "999999999"
743 #define BC_MAX_VARS_STR "999999999"
745 #define BC_MAX_OBASE_STR "999"
747 #if INT_MAX == 2147483647
748 # define BC_MAX_DIM_STR "2147483647"
749 #elif INT_MAX == 9223372036854775807
750 # define BC_MAX_DIM_STR "9223372036854775807"
752 # error Strange INT_MAX
755 #if UINT_MAX == 4294967295
756 # define BC_MAX_SCALE_STR "4294967295"
757 # define BC_MAX_STRING_STR "4294967294"
758 #elif UINT_MAX == 18446744073709551615
759 # define BC_MAX_SCALE_STR "18446744073709551615"
760 # define BC_MAX_STRING_STR "18446744073709551614"
762 # error Strange UINT_MAX
764 #define BC_MAX_NUM_STR BC_MAX_STRING_STR
767 IF_FEATURE_BC_SIGNALS(smallint ttyin;)
768 IF_FEATURE_CLEAN_UP(smallint exiting;)
774 // For error messages. Can be set to current parsed line,
775 // or [TODO] to current executing line (can be before last parsed one)
784 #if ENABLE_FEATURE_EDITING
785 line_input_t *line_input_state;
788 #define G (*ptr_to_globals)
789 #define INIT_G() do { \
790 SET_PTR_TO_GLOBALS(xzalloc(sizeof(G))); \
792 #define FREE_G() do { \
793 FREE_PTR_TO_GLOBALS(); \
795 #define G_posix (ENABLE_BC && (option_mask32 & BC_FLAG_S))
796 #define G_warn (ENABLE_BC && (option_mask32 & BC_FLAG_W))
797 #define G_exreg (ENABLE_DC && (option_mask32 & DC_FLAG_X))
798 #if ENABLE_FEATURE_BC_SIGNALS
799 # define G_interrupt bb_got_signal
800 # define G_ttyin G.ttyin
802 # define G_interrupt 0
805 #if ENABLE_FEATURE_CLEAN_UP
806 # define G_exiting G.exiting
810 #define IS_BC (ENABLE_BC && (!ENABLE_DC || applet_name[0] == 'b'))
811 #define IS_DC (ENABLE_DC && (!ENABLE_BC || applet_name[0] != 'b'))
813 // In configurations where errors abort instead of propagating error
814 // return code up the call chain, functions returning BC_STATUS
815 // actually don't return anything, they always succeed and return "void".
816 // A macro wrapper is provided, which makes this statement work:
818 // and makes it visible to the compiler that s is always zero,
819 // allowing compiler to optimize dead code after the statement.
821 // To make code more readable, each such function has a "z"
822 // ("always returning zero") prefix, i.e. zbc_foo or zdc_foo.
824 #if ENABLE_FEATURE_BC_SIGNALS || ENABLE_FEATURE_CLEAN_UP
825 # define ERRORS_ARE_FATAL 0
826 # define ERRORFUNC /*nothing*/
827 # define IF_ERROR_RETURN_POSSIBLE(a) a
828 # define BC_STATUS BcStatus
829 # define RETURN_STATUS(v) return (v)
830 # define COMMA_SUCCESS /*nothing*/
832 # define ERRORS_ARE_FATAL 1
833 # define ERRORFUNC NORETURN
834 # define IF_ERROR_RETURN_POSSIBLE(a) /*nothing*/
835 # define BC_STATUS void
836 # define RETURN_STATUS(v) do { ((void)(v)); return; } while (0)
837 # define COMMA_SUCCESS ,BC_STATUS_SUCCESS
840 #define BC_NUM_NEG(n, neg) ((((ssize_t)(n)) ^ -((ssize_t)(neg))) + (neg))
841 #define BC_NUM_ONE(n) ((n)->len == 1 && (n)->rdx == 0 && (n)->num[0] == 1)
842 #define BC_NUM_INT(n) ((n)->len - (n)->rdx)
843 //#define BC_NUM_AREQ(a, b) (BC_MAX((a)->rdx, (b)->rdx) + BC_MAX(BC_NUM_INT(a), BC_NUM_INT(b)) + 1)
844 static /*ALWAYS_INLINE*/ size_t BC_NUM_AREQ(BcNum *a, BcNum *b)
846 return BC_MAX(a->rdx, b->rdx) + BC_MAX(BC_NUM_INT(a), BC_NUM_INT(b)) + 1;
848 //#define BC_NUM_MREQ(a, b, scale) (BC_NUM_INT(a) + BC_NUM_INT(b) + BC_MAX((scale), (a)->rdx + (b)->rdx) + 1)
849 static /*ALWAYS_INLINE*/ size_t BC_NUM_MREQ(BcNum *a, BcNum *b, size_t scale)
851 return BC_NUM_INT(a) + BC_NUM_INT(b) + BC_MAX(scale, a->rdx + b->rdx) + 1;
854 typedef void (*BcNumDigitOp)(size_t, size_t, bool) FAST_FUNC;
856 typedef BC_STATUS (*BcNumBinaryOp)(BcNum *, BcNum *, BcNum *, size_t) FAST_FUNC;
858 static BC_STATUS zbc_num_binary(BcNum *a, BcNum *b, BcNum *c, size_t scale,
859 BcNumBinaryOp op, size_t req);
860 static FAST_FUNC BC_STATUS zbc_num_a(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale);
861 static FAST_FUNC BC_STATUS zbc_num_s(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale);
862 static FAST_FUNC BC_STATUS zbc_num_p(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale);
863 static FAST_FUNC BC_STATUS zbc_num_m(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale);
864 static FAST_FUNC BC_STATUS zbc_num_d(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale);
865 static FAST_FUNC BC_STATUS zbc_num_rem(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale);
867 static FAST_FUNC BC_STATUS zbc_num_add(BcNum *a, BcNum *b, BcNum *c, size_t scale)
869 BcNumBinaryOp op = (!a->neg == !b->neg) ? zbc_num_a : zbc_num_s;
871 RETURN_STATUS(zbc_num_binary(a, b, c, false, op, BC_NUM_AREQ(a, b)));
874 static FAST_FUNC BC_STATUS zbc_num_sub(BcNum *a, BcNum *b, BcNum *c, size_t scale)
876 BcNumBinaryOp op = (!a->neg == !b->neg) ? zbc_num_s : zbc_num_a;
878 RETURN_STATUS(zbc_num_binary(a, b, c, true, op, BC_NUM_AREQ(a, b)));
881 static FAST_FUNC BC_STATUS zbc_num_mul(BcNum *a, BcNum *b, BcNum *c, size_t scale)
883 size_t req = BC_NUM_MREQ(a, b, scale);
884 RETURN_STATUS(zbc_num_binary(a, b, c, scale, zbc_num_m, req));
887 static FAST_FUNC BC_STATUS zbc_num_div(BcNum *a, BcNum *b, BcNum *c, size_t scale)
889 size_t req = BC_NUM_MREQ(a, b, scale);
890 RETURN_STATUS(zbc_num_binary(a, b, c, scale, zbc_num_d, req));
893 static FAST_FUNC BC_STATUS zbc_num_mod(BcNum *a, BcNum *b, BcNum *c, size_t scale)
895 size_t req = BC_NUM_MREQ(a, b, scale);
896 RETURN_STATUS(zbc_num_binary(a, b, c, scale, zbc_num_rem, req));
899 static FAST_FUNC BC_STATUS zbc_num_pow(BcNum *a, BcNum *b, BcNum *c, size_t scale)
901 RETURN_STATUS(zbc_num_binary(a, b, c, scale, zbc_num_p, a->len * b->len + 1));
904 static const BcNumBinaryOp zbc_program_ops[] = {
905 zbc_num_pow, zbc_num_mul, zbc_num_div, zbc_num_mod, zbc_num_add, zbc_num_sub,
907 #define zbc_num_add(...) (zbc_num_add(__VA_ARGS__) COMMA_SUCCESS)
908 #define zbc_num_sub(...) (zbc_num_sub(__VA_ARGS__) COMMA_SUCCESS)
909 #define zbc_num_mul(...) (zbc_num_mul(__VA_ARGS__) COMMA_SUCCESS)
910 #define zbc_num_div(...) (zbc_num_div(__VA_ARGS__) COMMA_SUCCESS)
911 #define zbc_num_mod(...) (zbc_num_mod(__VA_ARGS__) COMMA_SUCCESS)
912 #define zbc_num_pow(...) (zbc_num_pow(__VA_ARGS__) COMMA_SUCCESS)
914 static void fflush_and_check(void)
917 if (ferror(stdout) || ferror(stderr))
918 bb_perror_msg_and_die("output error");
921 #if ENABLE_FEATURE_CLEAN_UP
922 #define QUIT_OR_RETURN_TO_MAIN \
924 IF_FEATURE_BC_SIGNALS(G_ttyin = 0;) /* do not loop in main loop anymore */ \
926 return BC_STATUS_FAILURE; \
929 #define QUIT_OR_RETURN_TO_MAIN quit()
932 static void quit(void) NORETURN;
933 static void quit(void)
936 bb_perror_msg_and_die("input error");
938 dbg_exec("quit(): exiting with exitcode SUCCESS");
942 static void bc_verror_msg(const char *fmt, va_list p)
944 const char *sv = sv; // for compiler
947 applet_name = xasprintf("%s: %s:%u", applet_name, G.prog.file, G.err_line);
949 bb_verror_msg(fmt, p, NULL);
951 free((char*)applet_name);
956 static NOINLINE ERRORFUNC int bc_error_fmt(const char *fmt, ...)
961 bc_verror_msg(fmt, p);
964 if (ENABLE_FEATURE_CLEAN_UP || G_ttyin)
965 IF_ERROR_RETURN_POSSIBLE(return BC_STATUS_FAILURE);
970 static NOINLINE int bc_posix_error_fmt(const char *fmt, ...)
974 // Are non-POSIX constructs totally ok?
975 if (!(option_mask32 & (BC_FLAG_S|BC_FLAG_W)))
976 return BC_STATUS_SUCCESS; // yes
979 bc_verror_msg(fmt, p);
982 // Do we treat non-POSIX constructs as errors?
983 if (!(option_mask32 & BC_FLAG_S))
984 return BC_STATUS_SUCCESS; // no, it's a warning
985 if (ENABLE_FEATURE_CLEAN_UP || G_ttyin)
986 return BC_STATUS_FAILURE;
991 // We use error functions with "return bc_error(FMT[, PARAMS])" idiom.
992 // This idiom begs for tail-call optimization, but for it to work,
993 // function must not have caller-cleaned parameters on stack.
994 // Unfortunately, vararg function API does exactly that on most arches.
995 // Thus, use these shims for the cases when we have no vararg PARAMS:
996 static ERRORFUNC int bc_error(const char *msg)
998 IF_ERROR_RETURN_POSSIBLE(return) bc_error_fmt("%s", msg);
1000 static ERRORFUNC int bc_error_bad_character(char c)
1003 IF_ERROR_RETURN_POSSIBLE(return) bc_error("NUL character");
1004 IF_ERROR_RETURN_POSSIBLE(return) bc_error_fmt("bad character '%c'", c);
1006 static ERRORFUNC int bc_error_bad_expression(void)
1008 IF_ERROR_RETURN_POSSIBLE(return) bc_error("bad expression");
1010 static ERRORFUNC int bc_error_bad_token(void)
1012 IF_ERROR_RETURN_POSSIBLE(return) bc_error("bad token");
1014 static ERRORFUNC int bc_error_stack_has_too_few_elements(void)
1016 IF_ERROR_RETURN_POSSIBLE(return) bc_error("stack has too few elements");
1018 static ERRORFUNC int bc_error_variable_is_wrong_type(void)
1020 IF_ERROR_RETURN_POSSIBLE(return) bc_error("variable is wrong type");
1022 static ERRORFUNC int bc_error_nested_read_call(void)
1024 IF_ERROR_RETURN_POSSIBLE(return) bc_error("read() call inside of a read() call");
1027 static int bc_POSIX_requires(const char *msg)
1029 return bc_posix_error_fmt("POSIX requires %s", msg);
1031 static int bc_POSIX_does_not_allow(const char *msg)
1033 return bc_posix_error_fmt("%s%s", "POSIX does not allow ", msg);
1035 static int bc_POSIX_does_not_allow_bool_ops_this_is_bad(const char *msg)
1037 return bc_posix_error_fmt("%s%s %s", "POSIX does not allow ", "boolean operators; the following is bad:", msg);
1039 static int bc_POSIX_does_not_allow_empty_X_expression_in_for(const char *msg)
1041 return bc_posix_error_fmt("%san empty %s expression in a for loop", "POSIX does not allow ", msg);
1045 static void bc_vec_grow(BcVec *v, size_t n)
1047 size_t cap = v->cap * 2;
1048 while (cap < v->len + n) cap *= 2;
1049 v->v = xrealloc(v->v, v->size * cap);
1053 static void bc_vec_init(BcVec *v, size_t esize, BcVecFree dtor)
1056 v->cap = BC_VEC_START_CAP;
1059 v->v = xmalloc(esize * BC_VEC_START_CAP);
1062 static void bc_char_vec_init(BcVec *v)
1064 bc_vec_init(v, sizeof(char), NULL);
1067 static void bc_vec_expand(BcVec *v, size_t req)
1070 v->v = xrealloc(v->v, v->size * req);
1075 static void bc_vec_pop(BcVec *v)
1079 v->dtor(v->v + (v->size * v->len));
1082 static void bc_vec_npop(BcVec *v, size_t n)
1087 size_t len = v->len - n;
1088 while (v->len > len) v->dtor(v->v + (v->size * --v->len));
1092 static void bc_vec_pop_all(BcVec *v)
1094 bc_vec_npop(v, v->len);
1097 static void bc_vec_push(BcVec *v, const void *data)
1099 if (v->len + 1 > v->cap) bc_vec_grow(v, 1);
1100 memmove(v->v + (v->size * v->len), data, v->size);
1104 static void bc_vec_pushByte(BcVec *v, char data)
1106 bc_vec_push(v, &data);
1109 static void bc_vec_pushZeroByte(BcVec *v)
1111 //bc_vec_pushByte(v, '\0');
1113 bc_vec_push(v, &const_int_0);
1116 static void bc_vec_pushAt(BcVec *v, const void *data, size_t idx)
1119 bc_vec_push(v, data);
1123 if (v->len == v->cap) bc_vec_grow(v, 1);
1125 ptr = v->v + v->size * idx;
1127 memmove(ptr + v->size, ptr, v->size * (v->len++ - idx));
1128 memmove(ptr, data, v->size);
1132 static void bc_vec_string(BcVec *v, size_t len, const char *str)
1135 bc_vec_expand(v, len + 1);
1136 memcpy(v->v, str, len);
1139 bc_vec_pushZeroByte(v);
1142 #if ENABLE_FEATURE_BC_SIGNALS && ENABLE_FEATURE_EDITING
1143 static void bc_vec_concat(BcVec *v, const char *str)
1147 if (v->len == 0) bc_vec_pushZeroByte(v);
1150 len = v->len + slen;
1152 if (v->cap < len) bc_vec_grow(v, slen);
1153 strcpy(v->v + v->len - 1, str);
1159 static void *bc_vec_item(const BcVec *v, size_t idx)
1161 return v->v + v->size * idx;
1164 static char** bc_program_str(size_t idx)
1166 return bc_vec_item(&G.prog.strs, idx);
1169 static BcFunc* bc_program_func(size_t idx)
1171 return bc_vec_item(&G.prog.fns, idx);
1174 static void *bc_vec_item_rev(const BcVec *v, size_t idx)
1176 return v->v + v->size * (v->len - idx - 1);
1179 static void *bc_vec_top(const BcVec *v)
1181 return v->v + v->size * (v->len - 1);
1184 static FAST_FUNC void bc_vec_free(void *vec)
1186 BcVec *v = (BcVec *) vec;
1191 static int bc_id_cmp(const void *e1, const void *e2)
1193 return strcmp(((const BcId *) e1)->name, ((const BcId *) e2)->name);
1196 static FAST_FUNC void bc_id_free(void *id)
1198 free(((BcId *) id)->name);
1201 static size_t bc_map_find(const BcVec *v, const void *ptr)
1203 size_t low = 0, high = v->len;
1205 while (low < high) {
1206 size_t mid = (low + high) / 2;
1207 BcId *id = bc_vec_item(v, mid);
1208 int result = bc_id_cmp(ptr, id);
1212 else if (result < 0)
1221 static int bc_map_insert(BcVec *v, const void *ptr, size_t *i)
1223 size_t n = *i = bc_map_find(v, ptr);
1226 bc_vec_push(v, ptr);
1227 else if (!bc_id_cmp(ptr, bc_vec_item(v, n)))
1228 return 0; // "was not inserted"
1230 bc_vec_pushAt(v, ptr, n);
1231 return 1; // "was inserted"
1235 static size_t bc_map_index(const BcVec *v, const void *ptr)
1237 size_t i = bc_map_find(v, ptr);
1238 if (i >= v->len) return BC_VEC_INVALID_IDX;
1239 return bc_id_cmp(ptr, bc_vec_item(v, i)) ? BC_VEC_INVALID_IDX : i;
1243 static int bad_input_byte(char c)
1245 if ((c < ' ' && c != '\t' && c != '\r' && c != '\n') // also allow '\v' '\f'?
1248 bc_error_fmt("illegal character 0x%02x", c);
1254 // Note: it _appends_ data from fp to vec.
1255 static void bc_read_line(BcVec *vec, FILE *fp)
1260 #if ENABLE_FEATURE_BC_SIGNALS
1261 if (G_interrupt) { // ^C was pressed
1264 // ^C while running a script (bc SCRIPT): die.
1265 // We do not return to interactive prompt:
1266 // user might be running us from a shell,
1267 // and SCRIPT might be intended to terminate
1268 // (e.g. contain a "halt" stmt).
1269 // ^C dropping user into a bc prompt instead of
1270 // the shell would be unexpected.
1273 // ^C while interactive input
1275 // GNU bc says "interrupted execution."
1276 // GNU dc says "Interrupt!"
1277 fputs("\ninterrupted execution\n", stderr);
1280 # if ENABLE_FEATURE_EDITING
1281 if (G_ttyin && fp == stdin) {
1283 # define line_buf bb_common_bufsiz1
1284 n = read_line_input(G.line_input_state, "", line_buf, COMMON_BUFSIZE);
1285 if (n <= 0) { // read errors or EOF, or ^D, or ^C
1288 bc_vec_pushZeroByte(vec); // ^D or EOF (or error)
1293 char c = line_buf[i++];
1295 if (bad_input_byte(c)) goto again;
1297 bc_vec_concat(vec, line_buf);
1305 size_t len = vec->len;
1308 #if ENABLE_FEATURE_BC_SIGNALS
1310 // ^C was pressed: ignore entire line, get another one
1315 do c = fgetc(fp); while (c == '\0');
1318 bb_perror_msg_and_die("input error");
1319 // Note: EOF does not append '\n'
1322 bad_chars |= bad_input_byte(c);
1323 bc_vec_pushByte(vec, (char)c);
1324 } while (c != '\n');
1327 // Bad chars on this line
1328 if (!G.prog.file) { // stdin
1329 // ignore entire line, get another one
1333 bb_perror_msg_and_die("file '%s' is not text", G.prog.file);
1335 bc_vec_pushZeroByte(vec);
1339 static void bc_num_setToZero(BcNum *n, size_t scale)
1346 static void bc_num_zero(BcNum *n)
1348 bc_num_setToZero(n, 0);
1351 static void bc_num_one(BcNum *n)
1353 bc_num_setToZero(n, 0);
1358 // Note: this also sets BcNum to zero
1359 static void bc_num_init(BcNum *n, size_t req)
1361 req = req >= BC_NUM_DEF_SIZE ? req : BC_NUM_DEF_SIZE;
1362 //memset(n, 0, sizeof(BcNum)); - cleared by assignments below
1363 n->num = xmalloc(req);
1370 static void bc_num_init_DEF_SIZE(BcNum *n)
1372 bc_num_init(n, BC_NUM_DEF_SIZE);
1375 static void bc_num_expand(BcNum *n, size_t req)
1377 req = req >= BC_NUM_DEF_SIZE ? req : BC_NUM_DEF_SIZE;
1379 n->num = xrealloc(n->num, req);
1384 static FAST_FUNC void bc_num_free(void *num)
1386 free(((BcNum *) num)->num);
1389 static void bc_num_copy(BcNum *d, BcNum *s)
1392 bc_num_expand(d, s->cap);
1396 memcpy(d->num, s->num, sizeof(BcDig) * d->len);
1400 static BC_STATUS zbc_num_ulong(BcNum *n, unsigned long *result_p)
1403 unsigned long pow, result;
1405 if (n->neg) RETURN_STATUS(bc_error("negative number"));
1407 for (result = 0, pow = 1, i = n->rdx; i < n->len; ++i) {
1408 unsigned long prev = result, powprev = pow;
1410 result += ((unsigned long) n->num[i]) * pow;
1413 if (result < prev || pow < powprev)
1414 RETURN_STATUS(bc_error("overflow"));
1420 RETURN_STATUS(BC_STATUS_SUCCESS);
1422 #define zbc_num_ulong(...) (zbc_num_ulong(__VA_ARGS__) COMMA_SUCCESS)
1424 static void bc_num_ulong2num(BcNum *n, unsigned long val)
1430 if (val == 0) return;
1432 if (ULONG_MAX == 0xffffffffUL)
1433 bc_num_expand(n, 10); // 10 digits: 4294967295
1434 if (ULONG_MAX == 0xffffffffffffffffULL)
1435 bc_num_expand(n, 20); // 20 digits: 18446744073709551615
1436 BUILD_BUG_ON(ULONG_MAX > 0xffffffffffffffffULL);
1443 if (val == 0) break;
1447 static void bc_num_subArrays(BcDig *restrict a, BcDig *restrict b, size_t len)
1450 for (i = 0; i < len; ++i) {
1452 for (j = i; a[j] < 0;) {
1459 static ssize_t bc_num_compare(BcDig *restrict a, BcDig *restrict b, size_t len)
1477 static ssize_t bc_num_cmp(BcNum *a, BcNum *b)
1479 size_t i, min, a_int, b_int, diff;
1480 BcDig *max_num, *min_num;
1484 if (a == b) return 0;
1485 if (a->len == 0) return BC_NUM_NEG(!!b->len, !b->neg);
1486 if (b->len == 0) return BC_NUM_NEG(1, a->neg);
1488 if (a->neg != b->neg) // signs of a and b differ
1489 // +a,-b = a>b = 1 or -a,+b = a<b = -1
1490 return (int)b->neg - (int)a->neg;
1491 neg = a->neg; // 1 if both negative, 0 if both positive
1493 a_int = BC_NUM_INT(a);
1494 b_int = BC_NUM_INT(b);
1497 if (a_int != 0) return (ssize_t) a_int;
1499 a_max = (a->rdx > b->rdx);
1502 diff = a->rdx - b->rdx;
1503 max_num = a->num + diff;
1505 // neg = (a_max == neg); - NOP (maps 1->1 and 0->0)
1508 diff = b->rdx - a->rdx;
1509 max_num = b->num + diff;
1511 neg = !neg; // same as "neg = (a_max == neg)"
1514 cmp = bc_num_compare(max_num, min_num, b_int + min);
1515 if (cmp != 0) return BC_NUM_NEG(cmp, neg);
1517 for (max_num -= diff, i = diff - 1; i < diff; --i) {
1518 if (max_num[i]) return BC_NUM_NEG(1, neg);
1524 static void bc_num_truncate(BcNum *n, size_t places)
1526 if (places == 0) return;
1532 memmove(n->num, n->num + places, n->len * sizeof(BcDig));
1536 static void bc_num_extend(BcNum *n, size_t places)
1538 size_t len = n->len + places;
1541 if (n->cap < len) bc_num_expand(n, len);
1543 memmove(n->num + places, n->num, sizeof(BcDig) * n->len);
1544 memset(n->num, 0, sizeof(BcDig) * places);
1551 static void bc_num_clean(BcNum *n)
1553 while (n->len > 0 && n->num[n->len - 1] == 0) --n->len;
1556 else if (n->len < n->rdx)
1560 static void bc_num_retireMul(BcNum *n, size_t scale, bool neg1, bool neg2)
1563 bc_num_extend(n, scale - n->rdx);
1565 bc_num_truncate(n, n->rdx - scale);
1568 if (n->len != 0) n->neg = !neg1 != !neg2;
1571 static void bc_num_split(BcNum *restrict n, size_t idx, BcNum *restrict a,
1575 b->len = n->len - idx;
1577 a->rdx = b->rdx = 0;
1579 memcpy(b->num, n->num + idx, b->len * sizeof(BcDig));
1580 memcpy(a->num, n->num, idx * sizeof(BcDig));
1590 static BC_STATUS zbc_num_shift(BcNum *n, size_t places)
1592 if (places == 0 || n->len == 0) RETURN_STATUS(BC_STATUS_SUCCESS);
1594 // This check makes sense only if size_t is (much) larger than BC_MAX_NUM.
1595 if (SIZE_MAX > (BC_MAX_NUM | 0xff)) {
1596 if (places + n->len > BC_MAX_NUM)
1597 RETURN_STATUS(bc_error("number too long: must be [1,"BC_MAX_NUM_STR"]"));
1600 if (n->rdx >= places)
1603 bc_num_extend(n, places - n->rdx);
1609 RETURN_STATUS(BC_STATUS_SUCCESS);
1611 #define zbc_num_shift(...) (zbc_num_shift(__VA_ARGS__) COMMA_SUCCESS)
1613 static BC_STATUS zbc_num_inv(BcNum *a, BcNum *b, size_t scale)
1622 RETURN_STATUS(zbc_num_div(&one, a, b, scale));
1624 #define zbc_num_inv(...) (zbc_num_inv(__VA_ARGS__) COMMA_SUCCESS)
1626 static FAST_FUNC BC_STATUS zbc_num_a(BcNum *a, BcNum *b, BcNum *restrict c, size_t sub)
1628 BcDig *ptr, *ptr_a, *ptr_b, *ptr_c;
1629 size_t i, max, min_rdx, min_int, diff, a_int, b_int;
1632 // Because this function doesn't need to use scale (per the bc spec),
1633 // I am hijacking it to say whether it's doing an add or a subtract.
1637 if (sub && c->len) c->neg = !c->neg;
1638 RETURN_STATUS(BC_STATUS_SUCCESS);
1642 RETURN_STATUS(BC_STATUS_SUCCESS);
1646 c->rdx = BC_MAX(a->rdx, b->rdx);
1647 min_rdx = BC_MIN(a->rdx, b->rdx);
1650 if (a->rdx > b->rdx) {
1651 diff = a->rdx - b->rdx;
1653 ptr_a = a->num + diff;
1656 diff = b->rdx - a->rdx;
1659 ptr_b = b->num + diff;
1663 for (i = 0; i < diff; ++i, ++c->len)
1667 a_int = BC_NUM_INT(a);
1668 b_int = BC_NUM_INT(b);
1670 if (a_int > b_int) {
1681 for (i = 0; i < min_rdx + min_int; ++i) {
1682 unsigned in = (unsigned)ptr_a[i] + (unsigned)ptr_b[i] + carry;
1684 ptr_c[i] = (BcDig)(in % 10);
1686 for (; i < max + min_rdx; ++i) {
1687 unsigned in = (unsigned)ptr[i] + carry;
1689 ptr_c[i] = (BcDig)(in % 10);
1693 if (carry != 0) c->num[c->len++] = (BcDig) carry;
1695 RETURN_STATUS(BC_STATUS_SUCCESS); // can't make void, see zbc_num_binary()
1698 static FAST_FUNC BC_STATUS zbc_num_s(BcNum *a, BcNum *b, BcNum *restrict c, size_t sub)
1701 BcNum *minuend, *subtrahend;
1703 bool aneg, bneg, neg;
1705 // Because this function doesn't need to use scale (per the bc spec),
1706 // I am hijacking it to say whether it's doing an add or a subtract.
1710 if (sub && c->len) c->neg = !c->neg;
1711 RETURN_STATUS(BC_STATUS_SUCCESS);
1715 RETURN_STATUS(BC_STATUS_SUCCESS);
1720 a->neg = b->neg = false;
1722 cmp = bc_num_cmp(a, b);
1728 bc_num_setToZero(c, BC_MAX(a->rdx, b->rdx));
1729 RETURN_STATUS(BC_STATUS_SUCCESS);
1737 if (sub) neg = !neg;
1742 bc_num_copy(c, minuend);
1745 if (c->rdx < subtrahend->rdx) {
1746 bc_num_extend(c, subtrahend->rdx - c->rdx);
1749 start = c->rdx - subtrahend->rdx;
1751 bc_num_subArrays(c->num + start, subtrahend->num, subtrahend->len);
1755 RETURN_STATUS(BC_STATUS_SUCCESS); // can't make void, see zbc_num_binary()
1758 static FAST_FUNC BC_STATUS zbc_num_k(BcNum *restrict a, BcNum *restrict b,
1760 #define zbc_num_k(...) (zbc_num_k(__VA_ARGS__) COMMA_SUCCESS)
1763 size_t max = BC_MAX(a->len, b->len), max2 = (max + 1) / 2;
1764 BcNum l1, h1, l2, h2, m2, m1, z0, z1, z2, temp;
1767 if (a->len == 0 || b->len == 0) {
1769 RETURN_STATUS(BC_STATUS_SUCCESS);
1771 aone = BC_NUM_ONE(a);
1772 if (aone || BC_NUM_ONE(b)) {
1773 bc_num_copy(c, aone ? b : a);
1774 RETURN_STATUS(BC_STATUS_SUCCESS);
1777 if (a->len + b->len < BC_NUM_KARATSUBA_LEN
1778 || a->len < BC_NUM_KARATSUBA_LEN
1779 || b->len < BC_NUM_KARATSUBA_LEN
1783 bc_num_expand(c, a->len + b->len + 1);
1785 memset(c->num, 0, sizeof(BcDig) * c->cap);
1788 for (i = 0; i < b->len; ++i) {
1790 for (j = 0; j < a->len; ++j) {
1791 unsigned in = c->num[i + j];
1792 in += (unsigned)a->num[j] * (unsigned)b->num[i] + carry;
1793 // note: compilers prefer _unsigned_ div/const
1795 c->num[i + j] = (BcDig)(in % 10);
1798 c->num[i + j] += (BcDig) carry;
1799 len = BC_MAX(len, i + j + !!carry);
1801 #if ENABLE_FEATURE_BC_SIGNALS
1803 // a*a <- without check below, this will not be interruptible
1804 if (G_interrupt) return BC_STATUS_FAILURE;
1810 RETURN_STATUS(BC_STATUS_SUCCESS);
1813 bc_num_init(&l1, max);
1814 bc_num_init(&h1, max);
1815 bc_num_init(&l2, max);
1816 bc_num_init(&h2, max);
1817 bc_num_init(&m1, max);
1818 bc_num_init(&m2, max);
1819 bc_num_init(&z0, max);
1820 bc_num_init(&z1, max);
1821 bc_num_init(&z2, max);
1822 bc_num_init(&temp, max + max);
1824 bc_num_split(a, max2, &l1, &h1);
1825 bc_num_split(b, max2, &l2, &h2);
1827 s = zbc_num_add(&h1, &l1, &m1, 0);
1829 s = zbc_num_add(&h2, &l2, &m2, 0);
1832 s = zbc_num_k(&h1, &h2, &z0);
1834 s = zbc_num_k(&m1, &m2, &z1);
1836 s = zbc_num_k(&l1, &l2, &z2);
1839 s = zbc_num_sub(&z1, &z0, &temp, 0);
1841 s = zbc_num_sub(&temp, &z2, &z1, 0);
1844 s = zbc_num_shift(&z0, max2 * 2);
1846 s = zbc_num_shift(&z1, max2);
1848 s = zbc_num_add(&z0, &z1, &temp, 0);
1850 s = zbc_num_add(&temp, &z2, c, 0);
1865 static FAST_FUNC BC_STATUS zbc_num_m(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale)
1869 size_t maxrdx = BC_MAX(a->rdx, b->rdx);
1871 scale = BC_MAX(scale, a->rdx);
1872 scale = BC_MAX(scale, b->rdx);
1873 scale = BC_MIN(a->rdx + b->rdx, scale);
1874 maxrdx = BC_MAX(maxrdx, scale);
1876 bc_num_init(&cpa, a->len);
1877 bc_num_init(&cpb, b->len);
1879 bc_num_copy(&cpa, a);
1880 bc_num_copy(&cpb, b);
1881 cpa.neg = cpb.neg = false;
1883 s = zbc_num_shift(&cpa, maxrdx);
1885 s = zbc_num_shift(&cpb, maxrdx);
1887 s = zbc_num_k(&cpa, &cpb, c);
1891 bc_num_expand(c, c->len + maxrdx);
1893 if (c->len < maxrdx) {
1894 memset(c->num + c->len, 0, (c->cap - c->len) * sizeof(BcDig));
1899 bc_num_retireMul(c, scale, a->neg, b->neg);
1905 #define zbc_num_m(...) (zbc_num_m(__VA_ARGS__) COMMA_SUCCESS)
1907 static FAST_FUNC BC_STATUS zbc_num_d(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale)
1914 RETURN_STATUS(bc_error("divide by zero"));
1916 bc_num_setToZero(c, scale);
1917 RETURN_STATUS(BC_STATUS_SUCCESS);
1919 if (BC_NUM_ONE(b)) {
1921 bc_num_retireMul(c, scale, a->neg, b->neg);
1922 RETURN_STATUS(BC_STATUS_SUCCESS);
1925 bc_num_init(&cp, BC_NUM_MREQ(a, b, scale));
1926 bc_num_copy(&cp, a);
1930 bc_num_expand(&cp, len + 2);
1931 bc_num_extend(&cp, len - cp.len);
1934 if (b->rdx > cp.rdx) bc_num_extend(&cp, b->rdx - cp.rdx);
1936 if (scale > cp.rdx) bc_num_extend(&cp, scale - cp.rdx);
1938 if (b->rdx == b->len) {
1940 if (len == 0) break;
1942 if (b->num[len] != 0)
1948 if (cp.cap == cp.len) bc_num_expand(&cp, cp.len + 1);
1950 // We want an extra zero in front to make things simpler.
1951 cp.num[cp.len++] = 0;
1954 bc_num_expand(c, cp.len);
1957 memset(c->num + end, 0, (c->cap - end) * sizeof(BcDig));
1961 s = BC_STATUS_SUCCESS;
1962 for (i = end - 1; i < end; --i) {
1965 for (q = 0; n[len] != 0 || bc_num_compare(n, b->num, len) >= 0; ++q)
1966 bc_num_subArrays(n, b->num, len);
1968 #if ENABLE_FEATURE_BC_SIGNALS
1971 // 1/a <- without check below, this will not be interruptible
1973 s = BC_STATUS_FAILURE;
1979 bc_num_retireMul(c, scale, a->neg, b->neg);
1984 #define zbc_num_d(...) (zbc_num_d(__VA_ARGS__) COMMA_SUCCESS)
1986 static FAST_FUNC BC_STATUS zbc_num_r(BcNum *a, BcNum *b, BcNum *restrict c,
1987 BcNum *restrict d, size_t scale, size_t ts)
1994 RETURN_STATUS(bc_error("divide by zero"));
1997 bc_num_setToZero(d, ts);
1998 RETURN_STATUS(BC_STATUS_SUCCESS);
2001 bc_num_init(&temp, d->cap);
2002 s = zbc_num_d(a, b, c, scale);
2005 if (scale != 0) scale = ts;
2007 s = zbc_num_m(c, b, &temp, scale);
2009 s = zbc_num_sub(a, &temp, d, scale);
2012 if (ts > d->rdx && d->len) bc_num_extend(d, ts - d->rdx);
2015 bc_num_retireMul(d, ts, a->neg, b->neg);
2021 #define zbc_num_r(...) (zbc_num_r(__VA_ARGS__) COMMA_SUCCESS)
2023 static FAST_FUNC BC_STATUS zbc_num_rem(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale)
2027 size_t ts = BC_MAX(scale + b->rdx, a->rdx), len = BC_NUM_MREQ(a, b, ts);
2029 bc_num_init(&c1, len);
2030 s = zbc_num_r(a, b, &c1, c, scale, ts);
2035 #define zbc_num_rem(...) (zbc_num_rem(__VA_ARGS__) COMMA_SUCCESS)
2037 static FAST_FUNC BC_STATUS zbc_num_p(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale)
2039 BcStatus s = BC_STATUS_SUCCESS;
2042 size_t i, powrdx, resrdx;
2045 if (b->rdx) RETURN_STATUS(bc_error("non integer number"));
2049 RETURN_STATUS(BC_STATUS_SUCCESS);
2052 bc_num_setToZero(c, scale);
2053 RETURN_STATUS(BC_STATUS_SUCCESS);
2055 if (BC_NUM_ONE(b)) {
2059 s = zbc_num_inv(a, c, scale);
2066 s = zbc_num_ulong(b, &pow);
2067 if (s) RETURN_STATUS(s);
2069 bc_num_init(©, a->len);
2070 bc_num_copy(©, a);
2075 if (a->rdx * pow < scale)
2076 scale = a->rdx * pow;
2081 for (powrdx = a->rdx; !(pow & 1); pow >>= 1) {
2083 s = zbc_num_mul(©, ©, ©, powrdx);
2085 // Not needed: zbc_num_mul() has a check for ^C:
2086 //if (G_interrupt) {
2087 // s = BC_STATUS_FAILURE;
2092 bc_num_copy(c, ©);
2094 for (resrdx = powrdx, pow >>= 1; pow != 0; pow >>= 1) {
2096 s = zbc_num_mul(©, ©, ©, powrdx);
2101 s = zbc_num_mul(c, ©, c, resrdx);
2104 // Not needed: zbc_num_mul() has a check for ^C:
2105 //if (G_interrupt) {
2106 // s = BC_STATUS_FAILURE;
2112 s = zbc_num_inv(c, c, scale);
2116 if (c->rdx > scale) bc_num_truncate(c, c->rdx - scale);
2118 // We can't use bc_num_clean() here.
2119 for (i = 0; i < c->len; ++i)
2122 bc_num_setToZero(c, scale);
2129 #define zbc_num_p(...) (zbc_num_p(__VA_ARGS__) COMMA_SUCCESS)
2131 static BC_STATUS zbc_num_binary(BcNum *a, BcNum *b, BcNum *c, size_t scale,
2132 BcNumBinaryOp op, size_t req)
2135 BcNum num2, *ptr_a, *ptr_b;
2140 memcpy(ptr_a, c, sizeof(BcNum));
2148 memcpy(ptr_b, c, sizeof(BcNum));
2155 bc_num_init(c, req);
2157 bc_num_expand(c, req);
2159 s = BC_STATUS_SUCCESS;
2160 IF_ERROR_RETURN_POSSIBLE(s =) op(ptr_a, ptr_b, c, scale);
2162 if (init) bc_num_free(&num2);
2166 #define zbc_num_binary(...) (zbc_num_binary(__VA_ARGS__) COMMA_SUCCESS)
2168 static bool bc_num_strValid(const char *val, size_t base)
2173 b = (BcDig)(base <= 10 ? base + '0' : base - 10 + 'A');
2180 if (radix) return false;
2184 if (c < '0' || c >= b || (c > '9' && c < 'A'))
2190 // Note: n is already "bc_num_zero()"ed,
2191 // leading zeroes in "val" are removed
2192 static void bc_num_parseDecimal(BcNum *n, const char *val)
2201 bc_num_expand(n, len);
2203 ptr = strchr(val, '.');
2207 n->rdx = (size_t)((val + len) - (ptr + 1));
2209 for (i = 0; val[i]; ++i) {
2210 if (val[i] != '0' && val[i] != '.') {
2211 // Not entirely zero value - convert it, and exit
2214 n->num[n->len] = val[i] - '0';
2218 if (val[--i] == '.') goto skip_dot;
2223 // if for() exits without hitting if(), the value is entirely zero
2226 // Note: n is already "bc_num_zero()"ed,
2227 // leading zeroes in "val" are removed
2228 static void bc_num_parseBase(BcNum *n, const char *val, unsigned base_t)
2231 BcNum temp, mult, result;
2237 for (i = 0; ; ++i) {
2240 if (val[i] != '.' && val[i] != '0')
2244 bc_num_init_DEF_SIZE(&temp);
2245 bc_num_init_DEF_SIZE(&mult);
2246 //TODO: have BcNumSmall type, with static buffer
2247 bc_num_init_DEF_SIZE(&base);
2248 bc_num_ulong2num(&base, base_t);
2252 if (c == '\0') goto int_err;
2253 if (c == '.') break;
2255 v = (unsigned long) (c <= '9' ? c - '0' : c - 'A' + 10);
2257 s = zbc_num_mul(n, &base, &mult, 0);
2258 if (s) goto int_err;
2259 bc_num_ulong2num(&temp, v);
2260 s = zbc_num_add(&mult, &temp, n, 0);
2261 if (s) goto int_err;
2264 bc_num_init(&result, base.len);
2265 //bc_num_zero(&result); - already is
2271 if (c == '\0') break;
2274 v = (unsigned long) (c <= '9' ? c - '0' : c - 'A' + 10);
2276 s = zbc_num_mul(&result, &base, &result, 0);
2278 bc_num_ulong2num(&temp, v);
2279 s = zbc_num_add(&result, &temp, &result, 0);
2281 s = zbc_num_mul(&mult, &base, &mult, 0);
2285 s = zbc_num_div(&result, &mult, &result, digits);
2287 s = zbc_num_add(n, &result, n, digits);
2291 if (n->rdx < digits)
2292 bc_num_extend(n, digits - n->rdx);
2296 bc_num_free(&result);
2303 static BC_STATUS zbc_num_parse(BcNum *n, const char *val, unsigned base_t)
2305 if (!bc_num_strValid(val, base_t))
2306 RETURN_STATUS(bc_error("bad number string"));
2309 while (*val == '0') val++;
2312 bc_num_parseDecimal(n, val);
2314 bc_num_parseBase(n, val, base_t);
2316 RETURN_STATUS(BC_STATUS_SUCCESS);
2318 #define zbc_num_parse(...) (zbc_num_parse(__VA_ARGS__) COMMA_SUCCESS)
2320 static BC_STATUS zbc_num_sqrt(BcNum *a, BcNum *restrict b, size_t scale)
2323 BcNum num1, num2, half, f, fprime, *x0, *x1, *temp;
2324 size_t pow, len, digs, digs1, resrdx, req, times = 0;
2325 ssize_t cmp = 1, cmp1 = SSIZE_MAX, cmp2 = SSIZE_MAX;
2327 req = BC_MAX(scale, a->rdx) + ((BC_NUM_INT(a) + 1) >> 1) + 1;
2328 bc_num_expand(b, req);
2331 bc_num_setToZero(b, scale);
2332 RETURN_STATUS(BC_STATUS_SUCCESS);
2335 RETURN_STATUS(bc_error("negative number"));
2337 if (BC_NUM_ONE(a)) {
2339 bc_num_extend(b, scale);
2340 RETURN_STATUS(BC_STATUS_SUCCESS);
2343 scale = BC_MAX(scale, a->rdx) + 1;
2344 len = a->len + scale;
2346 bc_num_init(&num1, len);
2347 bc_num_init(&num2, len);
2348 bc_num_init_DEF_SIZE(&half);
2354 bc_num_init(&f, len);
2355 bc_num_init(&fprime, len);
2361 pow = BC_NUM_INT(a);
2369 pow -= 2 - (pow & 1);
2371 bc_num_extend(x0, pow);
2373 // Make sure to move the radix back.
2377 x0->rdx = digs = digs1 = 0;
2379 len = BC_NUM_INT(x0) + resrdx - 1;
2381 while (cmp != 0 || digs < len) {
2382 s = zbc_num_div(a, x0, &f, resrdx);
2384 s = zbc_num_add(x0, &f, &fprime, resrdx);
2386 s = zbc_num_mul(&fprime, &half, x1, resrdx);
2389 cmp = bc_num_cmp(x1, x0);
2390 digs = x1->len - (unsigned long long) llabs(cmp);
2392 if (cmp == cmp2 && digs == digs1)
2397 resrdx += times > 4;
2410 if (b->rdx > scale) bc_num_truncate(b, b->rdx - scale);
2412 bc_num_free(&fprime);
2419 #define zbc_num_sqrt(...) (zbc_num_sqrt(__VA_ARGS__) COMMA_SUCCESS)
2421 static BC_STATUS zbc_num_divmod(BcNum *a, BcNum *b, BcNum *c, BcNum *d,
2427 size_t ts = BC_MAX(scale + b->rdx, a->rdx), len = BC_NUM_MREQ(a, b, ts);
2430 memcpy(&num2, c, sizeof(BcNum));
2432 bc_num_init(c, len);
2436 bc_num_expand(c, len);
2439 s = zbc_num_r(ptr_a, b, c, d, scale, ts);
2441 if (init) bc_num_free(&num2);
2445 #define zbc_num_divmod(...) (zbc_num_divmod(__VA_ARGS__) COMMA_SUCCESS)
2448 static BC_STATUS zbc_num_modexp(BcNum *a, BcNum *b, BcNum *c, BcNum *restrict d)
2451 BcNum base, exp, two, temp;
2454 RETURN_STATUS(bc_error("divide by zero"));
2455 if (a->rdx || b->rdx || c->rdx)
2456 RETURN_STATUS(bc_error("non integer number"));
2458 RETURN_STATUS(bc_error("negative number"));
2460 bc_num_expand(d, c->len);
2461 bc_num_init(&base, c->len);
2462 bc_num_init(&exp, b->len);
2463 bc_num_init_DEF_SIZE(&two);
2464 bc_num_init(&temp, b->len);
2470 s = zbc_num_rem(a, c, &base, 0);
2472 bc_num_copy(&exp, b);
2474 while (exp.len != 0) {
2475 s = zbc_num_divmod(&exp, &two, &exp, &temp, 0);
2478 if (BC_NUM_ONE(&temp)) {
2479 s = zbc_num_mul(d, &base, &temp, 0);
2481 s = zbc_num_rem(&temp, c, d, 0);
2485 s = zbc_num_mul(&base, &base, &temp, 0);
2487 s = zbc_num_rem(&temp, c, &base, 0);
2497 #define zbc_num_modexp(...) (zbc_num_modexp(__VA_ARGS__) COMMA_SUCCESS)
2501 static BC_STATUS zbc_func_insert(BcFunc *f, char *name, bool var)
2506 for (i = 0; i < f->autos.len; ++i) {
2507 if (strcmp(name, ((BcId *) bc_vec_item(&f->autos, i))->name) == 0)
2508 RETURN_STATUS(bc_error("function parameter or auto var has the same name as another"));
2514 bc_vec_push(&f->autos, &a);
2516 RETURN_STATUS(BC_STATUS_SUCCESS);
2518 #define zbc_func_insert(...) (zbc_func_insert(__VA_ARGS__) COMMA_SUCCESS)
2521 static void bc_func_init(BcFunc *f)
2523 bc_char_vec_init(&f->code);
2524 bc_vec_init(&f->autos, sizeof(BcId), bc_id_free);
2525 bc_vec_init(&f->labels, sizeof(size_t), NULL);
2529 static FAST_FUNC void bc_func_free(void *func)
2531 BcFunc *f = (BcFunc *) func;
2532 bc_vec_free(&f->code);
2533 bc_vec_free(&f->autos);
2534 bc_vec_free(&f->labels);
2537 static void bc_array_expand(BcVec *a, size_t len);
2539 static void bc_array_init(BcVec *a, bool nums)
2542 bc_vec_init(a, sizeof(BcNum), bc_num_free);
2544 bc_vec_init(a, sizeof(BcVec), bc_vec_free);
2545 bc_array_expand(a, 1);
2548 static void bc_array_expand(BcVec *a, size_t len)
2550 if (a->dtor == bc_num_free
2551 // && a->size == sizeof(BcNum) - always true
2554 while (len > a->len) {
2555 bc_num_init_DEF_SIZE(&n);
2560 while (len > a->len) {
2561 bc_array_init(&v, true);
2567 static void bc_array_copy(BcVec *d, const BcVec *s)
2572 bc_vec_expand(d, s->cap);
2575 for (i = 0; i < s->len; ++i) {
2576 BcNum *dnum = bc_vec_item(d, i), *snum = bc_vec_item(s, i);
2577 bc_num_init(dnum, snum->len);
2578 bc_num_copy(dnum, snum);
2582 static FAST_FUNC void bc_string_free(void *string)
2584 free(*((char **) string));
2588 static void bc_result_copy(BcResult *d, BcResult *src)
2593 case BC_RESULT_TEMP:
2594 case BC_RESULT_IBASE:
2595 case BC_RESULT_SCALE:
2596 case BC_RESULT_OBASE:
2597 bc_num_init(&d->d.n, src->d.n.len);
2598 bc_num_copy(&d->d.n, &src->d.n);
2601 case BC_RESULT_ARRAY:
2602 case BC_RESULT_ARRAY_ELEM:
2603 d->d.id.name = xstrdup(src->d.id.name);
2605 case BC_RESULT_CONSTANT:
2606 case BC_RESULT_LAST:
2609 memcpy(&d->d.n, &src->d.n, sizeof(BcNum));
2615 static FAST_FUNC void bc_result_free(void *result)
2617 BcResult *r = (BcResult *) result;
2620 case BC_RESULT_TEMP:
2621 case BC_RESULT_IBASE:
2622 case BC_RESULT_SCALE:
2623 case BC_RESULT_OBASE:
2624 bc_num_free(&r->d.n);
2627 case BC_RESULT_ARRAY:
2628 case BC_RESULT_ARRAY_ELEM:
2637 static void bc_lex_lineComment(BcLex *l)
2639 // Try: echo -n '#foo' | bc
2641 l->t.t = BC_LEX_WHITESPACE;
2643 while (i < l->len && l->buf[i] != '\n')
2648 static void bc_lex_whitespace(BcLex *l)
2650 l->t.t = BC_LEX_WHITESPACE;
2652 char c = l->buf[l->i];
2653 if (c == '\n') // this is BC_LEX_NLINE, not BC_LEX_WHITESPACE
2661 static BC_STATUS zbc_lex_number(BcLex *l, char start)
2663 const char *buf = l->buf + l->i;
2664 size_t len, i, ccnt;
2667 pt = (start == '.');
2668 l->t.t = BC_LEX_NUMBER;
2674 if (c == '\\' && buf[i + 1] == '\n') {
2676 //number_of_backslashes++ - see comment below
2679 if (!isdigit(c) && (c < 'A' || c > 'F')) {
2680 if (c != '.') break;
2681 // if '.' was already seen, stop on second one:
2685 // buf[i] is one of "0-9A-F."
2690 //ccnt is the number of chars in the number string, excluding possible
2691 //trailing "[\<newline>].[\<newline>]" (with any number of \<NL> repetitions).
2692 //i is buf[i] index of the first not-yet-parsed char after that.
2695 // This might overestimate the size, if there are "\<NL>"'s
2696 // in the number. Subtracting number_of_backslashes*2 correctly
2697 // is not that easy: consider that in the case of "NNN.\<NL>"
2698 // loop above will count "\<NL>" before it realizes it is not
2699 // in fact *inside* the number:
2700 len = ccnt + 1; // +1 byte for NUL termination
2702 // This check makes sense only if size_t is (much) larger than BC_MAX_NUM.
2703 if (SIZE_MAX > (BC_MAX_NUM | 0xff)) {
2704 if (len > BC_MAX_NUM)
2705 RETURN_STATUS(bc_error("number too long: must be [1,"BC_MAX_NUM_STR"]"));
2708 bc_vec_pop_all(&l->t.v);
2709 bc_vec_expand(&l->t.v, 1 + len);
2710 bc_vec_push(&l->t.v, &start);
2713 // If we have hit a backslash, skip it. We don't have
2714 // to check for a newline because it's guaranteed.
2720 bc_vec_push(&l->t.v, buf);
2725 bc_vec_pushZeroByte(&l->t.v);
2727 RETURN_STATUS(BC_STATUS_SUCCESS);
2729 #define zbc_lex_number(...) (zbc_lex_number(__VA_ARGS__) COMMA_SUCCESS)
2731 static void bc_lex_name(BcLex *l)
2736 l->t.t = BC_LEX_NAME;
2739 buf = l->buf + l->i - 1;
2742 if ((c < 'a' || c > 'z') && !isdigit(c) && c != '_') break;
2746 #if 0 // We do not protect against people with gigabyte-long names
2747 // This check makes sense only if size_t is (much) larger than BC_MAX_STRING.
2748 if (SIZE_MAX > (BC_MAX_STRING | 0xff)) {
2749 if (i > BC_MAX_STRING)
2750 return bc_error("name too long: must be [1,"BC_MAX_STRING_STR"]");
2753 bc_vec_string(&l->t.v, i, buf);
2755 // Increment the index. We minus 1 because it has already been incremented.
2758 //return BC_STATUS_SUCCESS;
2761 static void bc_lex_init(BcLex *l)
2763 bc_char_vec_init(&l->t.v);
2766 static void bc_lex_free(BcLex *l)
2768 bc_vec_free(&l->t.v);
2771 static void bc_lex_file(BcLex *l)
2773 G.err_line = l->line = 1;
2777 IF_BC(static BC_STATUS zbc_lex_token(BcLex *l);)
2778 IF_DC(static BC_STATUS zdc_lex_token(BcLex *l);)
2780 static BC_STATUS zcommon_lex_token(BcLex *l)
2783 IF_BC(RETURN_STATUS(zbc_lex_token(l));)
2785 IF_DC(RETURN_STATUS(zdc_lex_token(l));)
2787 #define zcommon_lex_token(...) (zcommon_lex_token(__VA_ARGS__) COMMA_SUCCESS)
2789 static bool bc_lex_more_input(BcLex *l)
2794 bc_vec_pop_all(&G.input_buffer);
2796 // This loop is complex because the vm tries not to send any lines that end
2797 // with a backslash to the parser. The reason for that is because the parser
2798 // treats a backslash+newline combo as whitespace, per the bc spec. In that
2799 // case, and for strings and comments, the parser will expect more stuff.
2803 size_t prevlen = G.input_buffer.len;
2806 bc_read_line(&G.input_buffer, G.input_fp);
2807 // No more input means EOF
2808 if (G.input_buffer.len <= prevlen + 1) // (we expect +1 for NUL byte)
2811 string = G.input_buffer.v + prevlen;
2814 if (string == G.input_buffer.v || string[-1] != '\\') {
2825 if (c == '/' && *string == '*') {
2830 if (c == '*' && *string == '/') {
2835 if (str != 0 || comment) {
2836 G.input_buffer.len--; // backstep over the trailing NUL byte
2840 // Check for backslash+newline.
2841 // we do not check that last char is '\n' -
2842 // if it is not, then it's EOF, and looping back
2843 // to bc_read_line() will detect it:
2845 if (string >= G.input_buffer.v && *string == '\\') {
2846 G.input_buffer.len--;
2853 l->buf = G.input_buffer.v;
2855 // bb_error_msg("G.input_buffer.len:%d '%s'", G.input_buffer.len, G.input_buffer.v);
2856 l->len = G.input_buffer.len - 1; // do not include NUL
2861 static BC_STATUS zbc_lex_next(BcLex *l)
2866 if (l->t.last == BC_LEX_EOF) RETURN_STATUS(bc_error("end of file"));
2868 l->line += l->newline;
2869 G.err_line = l->line;
2872 // Loop until failure or we don't have whitespace. This
2873 // is so the parser doesn't get inundated with whitespace.
2874 // Comments are also BC_LEX_WHITESPACE tokens and eaten here.
2875 s = BC_STATUS_SUCCESS;
2877 if (l->i == l->len) {
2878 l->t.t = BC_LEX_EOF;
2880 RETURN_STATUS(BC_STATUS_SUCCESS);
2881 if (!bc_lex_more_input(l)) {
2883 RETURN_STATUS(BC_STATUS_SUCCESS);
2885 // here it's guaranteed that l->i is below l->len
2887 dbg_lex("next string to parse:'%.*s'",
2888 (int)(strchrnul(l->buf + l->i, '\n') - (l->buf + l->i)),
2890 s = zcommon_lex_token(l);
2891 } while (!s && l->t.t == BC_LEX_WHITESPACE);
2892 dbg_lex("l->t.t from string:%d", l->t.t);
2896 #define zbc_lex_next(...) (zbc_lex_next(__VA_ARGS__) COMMA_SUCCESS)
2898 static BC_STATUS zbc_lex_skip_if_at_NLINE(BcLex *l)
2900 if (l->t.t == BC_LEX_NLINE)
2901 RETURN_STATUS(zbc_lex_next(l));
2902 RETURN_STATUS(BC_STATUS_SUCCESS);
2904 #define zbc_lex_skip_if_at_NLINE(...) (zbc_lex_skip_if_at_NLINE(__VA_ARGS__) COMMA_SUCCESS)
2906 static BC_STATUS zbc_lex_next_and_skip_NLINE(BcLex *l)
2909 s = zbc_lex_next(l);
2910 if (s) RETURN_STATUS(s);
2911 // if(cond)<newline>stmt is accepted too (but not 2+ newlines)
2912 s = zbc_lex_skip_if_at_NLINE(l);
2915 #define zbc_lex_next_and_skip_NLINE(...) (zbc_lex_next_and_skip_NLINE(__VA_ARGS__) COMMA_SUCCESS)
2917 static BC_STATUS zbc_lex_text_init(BcLex *l, const char *text)
2921 l->len = strlen(text);
2922 l->t.t = l->t.last = BC_LEX_INVALID;
2923 RETURN_STATUS(zbc_lex_next(l));
2925 #define zbc_lex_text_init(...) (zbc_lex_text_init(__VA_ARGS__) COMMA_SUCCESS)
2928 static BC_STATUS zbc_lex_identifier(BcLex *l)
2932 const char *buf = l->buf + l->i - 1;
2934 for (i = 0; i < ARRAY_SIZE(bc_lex_kws); ++i) {
2935 const char *keyword8 = bc_lex_kws[i].name8;
2937 while (buf[j] != '\0' && buf[j] == keyword8[j]) {
2939 if (j == 8) goto match;
2941 if (keyword8[j] != '\0')
2944 // buf starts with keyword bc_lex_kws[i]
2945 l->t.t = BC_LEX_KEY_1st_keyword + i;
2946 if (!bc_lex_kws_POSIX(i)) {
2947 s = bc_posix_error_fmt("%sthe '%.8s' keyword", "POSIX does not allow ", bc_lex_kws[i].name8);
2948 IF_ERROR_RETURN_POSSIBLE(if (s) RETURN_STATUS(s));
2951 // We minus 1 because the index has already been incremented.
2953 RETURN_STATUS(BC_STATUS_SUCCESS);
2957 s = BC_STATUS_SUCCESS;
2959 if (l->t.v.len > 2) {
2962 // bc: POSIX only allows one character names; the following is bad: 'qwe=1
2964 unsigned len = strchrnul(buf, '\n') - buf;
2965 s = bc_posix_error_fmt("POSIX only allows one character names; the following is bad: '%.*s'", len, buf);
2970 #define zbc_lex_identifier(...) (zbc_lex_identifier(__VA_ARGS__) COMMA_SUCCESS)
2972 static BC_STATUS zbc_lex_string(BcLex *l)
2976 l->t.t = BC_LEX_STR;
2984 RETURN_STATUS(bc_error("string end could not be found"));
2993 // This check makes sense only if size_t is (much) larger than BC_MAX_STRING.
2994 if (SIZE_MAX > (BC_MAX_STRING | 0xff)) {
2995 if (len > BC_MAX_STRING)
2996 RETURN_STATUS(bc_error("string too long: must be [1,"BC_MAX_STRING_STR"]"));
2998 bc_vec_string(&l->t.v, len, l->buf + l->i);
3002 G.err_line = l->line;
3004 RETURN_STATUS(BC_STATUS_SUCCESS);
3006 #define zbc_lex_string(...) (zbc_lex_string(__VA_ARGS__) COMMA_SUCCESS)
3008 static void bc_lex_assign(BcLex *l, unsigned with_and_without)
3010 if (l->buf[l->i] == '=') {
3012 with_and_without >>= 8; // store "with" value
3013 } // else store "without" value
3014 l->t.t = (with_and_without & 0xff);
3016 #define bc_lex_assign(l, with, without) \
3017 bc_lex_assign(l, ((with)<<8)|(without))
3019 static BC_STATUS zbc_lex_comment(BcLex *l)
3022 const char *buf = l->buf;
3024 l->t.t = BC_LEX_WHITESPACE;
3025 i = l->i; /* here buf[l->i] is the '*' of opening comment delimiter */
3037 RETURN_STATUS(bc_error("comment end could not be found"));
3044 G.err_line = l->line;
3046 RETURN_STATUS(BC_STATUS_SUCCESS);
3048 #define zbc_lex_comment(...) (zbc_lex_comment(__VA_ARGS__) COMMA_SUCCESS)
3050 static BC_STATUS zbc_lex_token(BcLex *l)
3052 BcStatus s = BC_STATUS_SUCCESS;
3053 char c = l->buf[l->i++], c2;
3055 // This is the workhorse of the lexer.
3057 // case '\0': // probably never reached
3059 // l->t.t = BC_LEX_EOF;
3060 // l->newline = true;
3063 l->t.t = BC_LEX_NLINE;
3071 bc_lex_whitespace(l);
3074 bc_lex_assign(l, BC_LEX_OP_REL_NE, BC_LEX_OP_BOOL_NOT);
3075 if (l->t.t == BC_LEX_OP_BOOL_NOT) {
3076 s = bc_POSIX_does_not_allow_bool_ops_this_is_bad("!");
3077 IF_ERROR_RETURN_POSSIBLE(if (s) RETURN_STATUS(s));
3081 s = zbc_lex_string(l);
3084 s = bc_POSIX_does_not_allow("'#' script comments");
3085 IF_ERROR_RETURN_POSSIBLE(if (s) RETURN_STATUS(s));
3086 bc_lex_lineComment(l);
3089 bc_lex_assign(l, BC_LEX_OP_ASSIGN_MODULUS, BC_LEX_OP_MODULUS);
3094 s = bc_POSIX_does_not_allow_bool_ops_this_is_bad("&&");
3095 IF_ERROR_RETURN_POSSIBLE(if (s) RETURN_STATUS(s));
3097 l->t.t = BC_LEX_OP_BOOL_AND;
3099 l->t.t = BC_LEX_INVALID;
3100 s = bc_error_bad_character('&');
3105 l->t.t = (BcLexType)(c - '(' + BC_LEX_LPAREN);
3108 bc_lex_assign(l, BC_LEX_OP_ASSIGN_MULTIPLY, BC_LEX_OP_MULTIPLY);
3114 l->t.t = BC_LEX_OP_INC;
3116 bc_lex_assign(l, BC_LEX_OP_ASSIGN_PLUS, BC_LEX_OP_PLUS);
3119 l->t.t = BC_LEX_COMMA;
3125 l->t.t = BC_LEX_OP_DEC;
3127 bc_lex_assign(l, BC_LEX_OP_ASSIGN_MINUS, BC_LEX_OP_MINUS);
3130 if (isdigit(l->buf[l->i]))
3131 s = zbc_lex_number(l, c);
3133 l->t.t = BC_LEX_KEY_LAST;
3134 s = bc_POSIX_does_not_allow("a period ('.') as a shortcut for the last result");
3140 s = zbc_lex_comment(l);
3142 bc_lex_assign(l, BC_LEX_OP_ASSIGN_DIVIDE, BC_LEX_OP_DIVIDE);
3160 s = zbc_lex_number(l, c);
3163 l->t.t = BC_LEX_SCOLON;
3166 bc_lex_assign(l, BC_LEX_OP_REL_LE, BC_LEX_OP_REL_LT);
3169 bc_lex_assign(l, BC_LEX_OP_REL_EQ, BC_LEX_OP_ASSIGN);
3172 bc_lex_assign(l, BC_LEX_OP_REL_GE, BC_LEX_OP_REL_GT);
3176 l->t.t = (BcLexType)(c - '[' + BC_LEX_LBRACKET);
3179 if (l->buf[l->i] == '\n') {
3180 l->t.t = BC_LEX_WHITESPACE;
3183 s = bc_error_bad_character(c);
3186 bc_lex_assign(l, BC_LEX_OP_ASSIGN_POWER, BC_LEX_OP_POWER);
3214 s = zbc_lex_identifier(l);
3218 l->t.t = (BcLexType)(c - '{' + BC_LEX_LBRACE);
3223 s = bc_POSIX_does_not_allow_bool_ops_this_is_bad("||");
3224 IF_ERROR_RETURN_POSSIBLE(if (s) RETURN_STATUS(s));
3226 l->t.t = BC_LEX_OP_BOOL_OR;
3228 l->t.t = BC_LEX_INVALID;
3229 s = bc_error_bad_character(c);
3233 l->t.t = BC_LEX_INVALID;
3234 s = bc_error_bad_character(c);
3243 static BC_STATUS zdc_lex_register(BcLex *l)
3245 if (isspace(l->buf[l->i - 1])) {
3246 bc_lex_whitespace(l);
3249 RETURN_STATUS(bc_error("extended register"));
3253 bc_vec_pop_all(&l->t.v);
3254 bc_vec_push(&l->t.v, &l->buf[l->i - 1]);
3255 bc_vec_pushZeroByte(&l->t.v);
3256 l->t.t = BC_LEX_NAME;
3259 RETURN_STATUS(BC_STATUS_SUCCESS);
3261 #define zdc_lex_register(...) (zdc_lex_register(__VA_ARGS__) COMMA_SUCCESS)
3263 static BC_STATUS zdc_lex_string(BcLex *l)
3265 size_t depth, nls, i;
3267 l->t.t = BC_LEX_STR;
3268 bc_vec_pop_all(&l->t.v);
3277 RETURN_STATUS(bc_error("string end could not be found"));
3280 if (i == l->i || l->buf[i - 1] != '\\') {
3281 if (c == '[') depth++;
3286 bc_vec_push(&l->t.v, &l->buf[i]);
3291 bc_vec_pushZeroByte(&l->t.v);
3292 // This check makes sense only if size_t is (much) larger than BC_MAX_STRING.
3293 if (SIZE_MAX > (BC_MAX_STRING | 0xff)) {
3294 if (i - l->i > BC_MAX_STRING)
3295 RETURN_STATUS(bc_error("string too long: must be [1,"BC_MAX_STRING_STR"]"));
3300 G.err_line = l->line;
3302 RETURN_STATUS(BC_STATUS_SUCCESS);
3304 #define zdc_lex_string(...) (zdc_lex_string(__VA_ARGS__) COMMA_SUCCESS)
3306 static BC_STATUS zdc_lex_token(BcLex *l)
3308 static const //BcLexType - should be this type, but narrower type saves size:
3311 BC_LEX_OP_REL_EQ, BC_LEX_OP_REL_LE, BC_LEX_OP_REL_GE, BC_LEX_OP_REL_NE,
3312 BC_LEX_OP_REL_LT, BC_LEX_OP_REL_GT, BC_LEX_SCOLON, BC_LEX_COLON,
3313 BC_LEX_ELSE, BC_LEX_LOAD, BC_LEX_LOAD_POP, BC_LEX_OP_ASSIGN,
3316 static const //BcLexType - should be this type
3320 BC_LEX_OP_MODULUS, BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_LPAREN,
3322 BC_LEX_INVALID, BC_LEX_OP_MULTIPLY, BC_LEX_OP_PLUS, BC_LEX_INVALID,
3324 BC_LEX_OP_MINUS, BC_LEX_INVALID, BC_LEX_OP_DIVIDE,
3326 BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID,
3327 BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID,
3328 BC_LEX_INVALID, BC_LEX_INVALID,
3330 BC_LEX_COLON, BC_LEX_SCOLON, BC_LEX_OP_REL_GT, BC_LEX_OP_REL_EQ,
3331 BC_LEX_OP_REL_LT, BC_LEX_KEY_READ, BC_LEX_INVALID,
3333 BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID,
3334 BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_EQ_NO_REG, BC_LEX_INVALID,
3336 BC_LEX_KEY_IBASE, BC_LEX_INVALID, BC_LEX_KEY_SCALE, BC_LEX_LOAD_POP,
3337 BC_LEX_INVALID, BC_LEX_OP_BOOL_NOT, BC_LEX_KEY_OBASE, BC_LEX_PRINT_STREAM,
3339 BC_LEX_NQUIT, BC_LEX_POP, BC_LEX_STORE_PUSH, BC_LEX_INVALID, BC_LEX_INVALID,
3340 BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_SCALE_FACTOR, BC_LEX_INVALID,
3342 BC_LEX_KEY_LENGTH, BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID,
3344 BC_LEX_OP_POWER, BC_LEX_NEG, BC_LEX_INVALID,
3346 BC_LEX_ASCIIFY, BC_LEX_INVALID, BC_LEX_CLEAR_STACK, BC_LEX_DUPLICATE,
3347 BC_LEX_ELSE, BC_LEX_PRINT_STACK, BC_LEX_INVALID, BC_LEX_INVALID,
3349 BC_LEX_STORE_IBASE, BC_LEX_INVALID, BC_LEX_STORE_SCALE, BC_LEX_LOAD,
3350 BC_LEX_INVALID, BC_LEX_PRINT_POP, BC_LEX_STORE_OBASE, BC_LEX_KEY_PRINT,
3352 BC_LEX_KEY_QUIT, BC_LEX_SWAP, BC_LEX_OP_ASSIGN, BC_LEX_INVALID,
3353 BC_LEX_INVALID, BC_LEX_KEY_SQRT, BC_LEX_INVALID, BC_LEX_EXECUTE,
3355 BC_LEX_INVALID, BC_LEX_STACK_LEVEL,
3357 BC_LEX_LBRACE, BC_LEX_OP_MODEXP, BC_LEX_INVALID, BC_LEX_OP_DIVMOD,
3360 BcStatus s = BC_STATUS_SUCCESS;
3361 char c = l->buf[l->i++], c2;
3364 for (i = 0; i < ARRAY_SIZE(dc_lex_regs); ++i) {
3365 if (l->t.last == dc_lex_regs[i])
3366 RETURN_STATUS(zdc_lex_register(l));
3369 if (c >= '%' && c <= '~'
3370 && (l->t.t = dc_lex_tokens[c - '%']) != BC_LEX_INVALID
3375 // This is the workhorse of the lexer.
3377 // case '\0': // probably never reached
3378 // l->t.t = BC_LEX_EOF;
3386 l->newline = (c == '\n');
3387 bc_lex_whitespace(l);
3392 l->t.t = BC_LEX_OP_REL_NE;
3394 l->t.t = BC_LEX_OP_REL_LE;
3396 l->t.t = BC_LEX_OP_REL_GE;
3398 RETURN_STATUS(bc_error_bad_character(c));
3402 bc_lex_lineComment(l);
3405 if (isdigit(l->buf[l->i]))
3406 s = zbc_lex_number(l, c);
3408 s = bc_error_bad_character(c);
3426 s = zbc_lex_number(l, c);
3429 s = zdc_lex_string(l);
3432 l->t.t = BC_LEX_INVALID;
3433 s = bc_error_bad_character(c);
3441 static void bc_program_addFunc(char *name, size_t *idx);
3443 static void bc_parse_addFunc(BcParse *p, char *name, size_t *idx)
3445 bc_program_addFunc(name, idx);
3446 p->func = bc_program_func(p->fidx);
3449 static void bc_parse_push(BcParse *p, char i)
3451 dbg_lex("%s:%d pushing opcode %d", __func__, __LINE__, i);
3452 bc_vec_pushByte(&p->func->code, i);
3455 static void bc_parse_pushName(BcParse *p, char *name)
3458 bc_parse_push(p, *name++);
3459 bc_parse_push(p, BC_PARSE_STREND);
3462 static void bc_parse_pushIndex(BcParse *p, size_t idx)
3467 dbg_lex("%s:%d pushing index %zd", __func__, __LINE__, idx);
3468 mask = ((size_t)0xff) << (sizeof(idx) * 8 - 8);
3471 if (idx & mask) break;
3476 bc_parse_push(p, amt);
3479 bc_parse_push(p, (unsigned char)idx);
3484 static void bc_parse_pushJUMP(BcParse *p, size_t idx)
3486 bc_parse_push(p, BC_INST_JUMP);
3487 bc_parse_pushIndex(p, idx);
3490 static void bc_parse_pushJUMP_ZERO(BcParse *p, size_t idx)
3492 bc_parse_push(p, BC_INST_JUMP_ZERO);
3493 bc_parse_pushIndex(p, idx);
3496 static void bc_parse_number(BcParse *p)
3498 char *num = xstrdup(p->l.t.v.v);
3499 size_t idx = G.prog.consts.len;
3501 bc_vec_push(&G.prog.consts, &num);
3503 bc_parse_push(p, BC_INST_NUM);
3504 bc_parse_pushIndex(p, idx);
3507 IF_BC(static BC_STATUS zbc_parse_stmt_or_funcdef(BcParse *p);)
3508 IF_DC(static BC_STATUS zdc_parse_parse(BcParse *p);)
3510 // "Parse" half of "parse,execute,repeat" main loop
3511 static BC_STATUS zcommon_parse(BcParse *p)
3514 // FIXME: "eating" of stmt delemiters is coded inconsistently
3515 // (sometimes zbc_parse_stmt() eats the delimiter, sometimes don't),
3516 // which causes bugs such as "print 1 print 2" erroneously accepted,
3517 // or "print 1 else 2" detecting parse error only after executing
3519 IF_BC(RETURN_STATUS(zbc_parse_stmt_or_funcdef(p));)
3521 IF_DC(RETURN_STATUS(zdc_parse_parse(p));)
3523 #define zcommon_parse(...) (zcommon_parse(__VA_ARGS__) COMMA_SUCCESS)
3525 static BC_STATUS zbc_parse_text_init(BcParse *p, const char *text)
3527 p->func = bc_program_func(p->fidx);
3529 RETURN_STATUS(zbc_lex_text_init(&p->l, text));
3531 #define zbc_parse_text_init(...) (zbc_parse_text_init(__VA_ARGS__) COMMA_SUCCESS)
3533 // Called when parsing or execution detects a failure,
3534 // resets execution structures.
3535 static void bc_program_reset(void)
3540 bc_vec_npop(&G.prog.stack, G.prog.stack.len - 1);
3541 bc_vec_pop_all(&G.prog.results);
3543 f = bc_program_func(0);
3544 ip = bc_vec_top(&G.prog.stack);
3545 ip->idx = f->code.len;
3548 #define bc_parse_updateFunc(p, f) \
3549 ((p)->func = bc_program_func((p)->fidx = (f)))
3551 // Called when zbc/zdc_parse_parse() detects a failure,
3552 // resets parsing structures.
3553 static void bc_parse_reset(BcParse *p)
3555 if (p->fidx != BC_PROG_MAIN) {
3556 p->func->nparams = 0;
3557 bc_vec_pop_all(&p->func->code);
3558 bc_vec_pop_all(&p->func->autos);
3559 bc_vec_pop_all(&p->func->labels);
3561 bc_parse_updateFunc(p, BC_PROG_MAIN);
3565 p->l.t.t = BC_LEX_EOF;
3567 bc_vec_pop_all(&p->exits);
3568 bc_vec_pop_all(&p->conds);
3569 bc_vec_pop_all(&p->ops);
3574 static void bc_parse_free(BcParse *p)
3576 bc_vec_free(&p->exits);
3577 bc_vec_free(&p->conds);
3578 bc_vec_free(&p->ops);
3582 static void bc_parse_create(BcParse *p, size_t func)
3584 memset(p, 0, sizeof(BcParse));
3587 bc_vec_init(&p->exits, sizeof(size_t), NULL);
3588 bc_vec_init(&p->conds, sizeof(size_t), NULL);
3589 bc_vec_init(&p->ops, sizeof(BcLexType), NULL);
3591 bc_parse_updateFunc(p, func);
3596 #define BC_PARSE_TOP_OP(p) (*((BcLexType *) bc_vec_top(&(p)->ops)))
3597 #define BC_PARSE_LEAF(p, rparen) \
3598 (((p) >= BC_INST_NUM && (p) <= BC_INST_SQRT) || (rparen) || \
3599 (p) == BC_INST_INC_POST || (p) == BC_INST_DEC_POST)
3601 // We can calculate the conversion between tokens and exprs by subtracting the
3602 // position of the first operator in the lex enum and adding the position of the
3603 // first in the expr enum. Note: This only works for binary operators.
3604 #define BC_TOKEN_2_INST(t) ((char) ((t) - BC_LEX_NEG + BC_INST_NEG))
3606 static BcStatus bc_parse_expr_empty_ok(BcParse *p, uint8_t flags);
3608 static BC_STATUS zbc_parse_expr(BcParse *p, uint8_t flags)
3612 s = bc_parse_expr_empty_ok(p, flags);
3613 if (s == BC_STATUS_PARSE_EMPTY_EXP)
3614 RETURN_STATUS(bc_error("empty expression"));
3617 #define zbc_parse_expr(...) (zbc_parse_expr(__VA_ARGS__) COMMA_SUCCESS)
3619 static BC_STATUS zbc_parse_stmt_possibly_auto(BcParse *p, bool auto_allowed);
3620 #define zbc_parse_stmt_possibly_auto(...) (zbc_parse_stmt_possibly_auto(__VA_ARGS__) COMMA_SUCCESS)
3622 static BC_STATUS zbc_parse_stmt(BcParse *p)
3624 RETURN_STATUS(zbc_parse_stmt_possibly_auto(p, false));
3626 #define zbc_parse_stmt(...) (zbc_parse_stmt(__VA_ARGS__) COMMA_SUCCESS)
3628 static BC_STATUS zbc_parse_stmt_allow_NLINE_before(BcParse *p, const char *after_X)
3630 // "if(cond)<newline>stmt" is accepted too, but not 2+ newlines.
3631 // Same for "else", "while()", "for()".
3632 BcStatus s = zbc_lex_next_and_skip_NLINE(&p->l);
3633 if (s) RETURN_STATUS(s);
3634 if (p->l.t.t == BC_LEX_NLINE)
3635 RETURN_STATUS(bc_error_fmt("no statement after '%s'", after_X));
3637 RETURN_STATUS(zbc_parse_stmt(p));
3639 #define zbc_parse_stmt_allow_NLINE_before(...) (zbc_parse_stmt_allow_NLINE_before(__VA_ARGS__) COMMA_SUCCESS)
3641 static void bc_parse_operator(BcParse *p, BcLexType type, size_t start,
3644 char l, r = bc_parse_op_PREC(type - BC_LEX_OP_INC);
3645 bool left = bc_parse_op_LEFT(type - BC_LEX_OP_INC);
3647 while (p->ops.len > start) {
3648 BcLexType t = BC_PARSE_TOP_OP(p);
3649 if (t == BC_LEX_LPAREN) break;
3651 l = bc_parse_op_PREC(t - BC_LEX_OP_INC);
3652 if (l >= r && (l != r || !left)) break;
3654 bc_parse_push(p, BC_TOKEN_2_INST(t));
3655 bc_vec_pop(&p->ops);
3656 *nexprs -= (t != BC_LEX_OP_BOOL_NOT && t != BC_LEX_NEG);
3659 bc_vec_push(&p->ops, &type);
3662 static BC_STATUS zbc_parse_rightParen(BcParse *p, size_t ops_bgn, size_t *nexs)
3666 if (p->ops.len <= ops_bgn)
3667 RETURN_STATUS(bc_error_bad_expression());
3668 top = BC_PARSE_TOP_OP(p);
3670 while (top != BC_LEX_LPAREN) {
3671 bc_parse_push(p, BC_TOKEN_2_INST(top));
3673 bc_vec_pop(&p->ops);
3674 *nexs -= top != BC_LEX_OP_BOOL_NOT && top != BC_LEX_NEG;
3676 if (p->ops.len <= ops_bgn)
3677 RETURN_STATUS(bc_error_bad_expression());
3678 top = BC_PARSE_TOP_OP(p);
3681 bc_vec_pop(&p->ops);
3683 RETURN_STATUS(zbc_lex_next(&p->l));
3685 #define zbc_parse_rightParen(...) (zbc_parse_rightParen(__VA_ARGS__) COMMA_SUCCESS)
3687 static BC_STATUS zbc_parse_params(BcParse *p, uint8_t flags)
3692 dbg_lex("%s:%d p->l.t.t:%d", __func__, __LINE__, p->l.t.t);
3693 flags = (flags & ~(BC_PARSE_PRINT | BC_PARSE_REL)) | BC_PARSE_ARRAY;
3695 s = zbc_lex_next(&p->l);
3696 if (s) RETURN_STATUS(s);
3699 if (p->l.t.t != BC_LEX_RPAREN) {
3701 s = zbc_parse_expr(p, flags);
3702 if (s) RETURN_STATUS(s);
3704 if (p->l.t.t != BC_LEX_COMMA) {
3705 if (p->l.t.t == BC_LEX_RPAREN)
3707 RETURN_STATUS(bc_error_bad_token());
3709 s = zbc_lex_next(&p->l);
3710 if (s) RETURN_STATUS(s);
3714 bc_parse_push(p, BC_INST_CALL);
3715 bc_parse_pushIndex(p, nparams);
3717 RETURN_STATUS(BC_STATUS_SUCCESS);
3719 #define zbc_parse_params(...) (zbc_parse_params(__VA_ARGS__) COMMA_SUCCESS)
3721 static BC_STATUS zbc_parse_call(BcParse *p, char *name, uint8_t flags)
3724 BcId entry, *entry_ptr;
3729 s = zbc_parse_params(p, flags);
3732 if (p->l.t.t != BC_LEX_RPAREN) {
3733 s = bc_error_bad_token();
3737 idx = bc_map_index(&G.prog.fn_map, &entry);
3739 if (idx == BC_VEC_INVALID_IDX) {
3740 name = xstrdup(entry.name);
3741 bc_parse_addFunc(p, name, &idx);
3742 idx = bc_map_index(&G.prog.fn_map, &entry);
3747 entry_ptr = bc_vec_item(&G.prog.fn_map, idx);
3748 bc_parse_pushIndex(p, entry_ptr->idx);
3750 RETURN_STATUS(zbc_lex_next(&p->l));
3755 #define zbc_parse_call(...) (zbc_parse_call(__VA_ARGS__) COMMA_SUCCESS)
3757 static BC_STATUS zbc_parse_name(BcParse *p, BcInst *type, uint8_t flags)
3762 name = xstrdup(p->l.t.v.v);
3763 s = zbc_lex_next(&p->l);
3766 if (p->l.t.t == BC_LEX_LBRACKET) {
3767 s = zbc_lex_next(&p->l);
3770 if (p->l.t.t == BC_LEX_RBRACKET) {
3771 if (!(flags & BC_PARSE_ARRAY)) {
3772 s = bc_error_bad_expression();
3775 *type = BC_INST_ARRAY;
3777 *type = BC_INST_ARRAY_ELEM;
3778 flags &= ~(BC_PARSE_PRINT | BC_PARSE_REL);
3779 s = zbc_parse_expr(p, flags);
3782 s = zbc_lex_next(&p->l);
3784 bc_parse_push(p, *type);
3785 bc_parse_pushName(p, name);
3787 } else if (p->l.t.t == BC_LEX_LPAREN) {
3788 if (flags & BC_PARSE_NOCALL) {
3789 s = bc_error_bad_token();
3792 *type = BC_INST_CALL;
3793 s = zbc_parse_call(p, name, flags);
3795 *type = BC_INST_VAR;
3796 bc_parse_push(p, BC_INST_VAR);
3797 bc_parse_pushName(p, name);
3806 #define zbc_parse_name(...) (zbc_parse_name(__VA_ARGS__) COMMA_SUCCESS)
3808 static BC_STATUS zbc_parse_read(BcParse *p)
3812 s = zbc_lex_next(&p->l);
3813 if (s) RETURN_STATUS(s);
3814 if (p->l.t.t != BC_LEX_LPAREN) RETURN_STATUS(bc_error_bad_token());
3816 s = zbc_lex_next(&p->l);
3817 if (s) RETURN_STATUS(s);
3818 if (p->l.t.t != BC_LEX_RPAREN) RETURN_STATUS(bc_error_bad_token());
3820 bc_parse_push(p, BC_INST_READ);
3822 RETURN_STATUS(zbc_lex_next(&p->l));
3824 #define zbc_parse_read(...) (zbc_parse_read(__VA_ARGS__) COMMA_SUCCESS)
3826 static BC_STATUS zbc_parse_builtin(BcParse *p, BcLexType type, uint8_t flags,
3831 s = zbc_lex_next(&p->l);
3832 if (s) RETURN_STATUS(s);
3833 if (p->l.t.t != BC_LEX_LPAREN) RETURN_STATUS(bc_error_bad_token());
3835 flags = (flags & ~(BC_PARSE_PRINT | BC_PARSE_REL)) | BC_PARSE_ARRAY;
3837 s = zbc_lex_next(&p->l);
3838 if (s) RETURN_STATUS(s);
3840 s = zbc_parse_expr(p, flags);
3841 if (s) RETURN_STATUS(s);
3843 if (p->l.t.t != BC_LEX_RPAREN) RETURN_STATUS(bc_error_bad_token());
3845 *prev = (type == BC_LEX_KEY_LENGTH) ? BC_INST_LENGTH : BC_INST_SQRT;
3846 bc_parse_push(p, *prev);
3848 RETURN_STATUS(zbc_lex_next(&p->l));
3850 #define zbc_parse_builtin(...) (zbc_parse_builtin(__VA_ARGS__) COMMA_SUCCESS)
3852 static BC_STATUS zbc_parse_scale(BcParse *p, BcInst *type, uint8_t flags)
3856 s = zbc_lex_next(&p->l);
3857 if (s) RETURN_STATUS(s);
3859 if (p->l.t.t != BC_LEX_LPAREN) {
3860 *type = BC_INST_SCALE;
3861 bc_parse_push(p, BC_INST_SCALE);
3862 RETURN_STATUS(BC_STATUS_SUCCESS);
3865 *type = BC_INST_SCALE_FUNC;
3866 flags &= ~(BC_PARSE_PRINT | BC_PARSE_REL);
3868 s = zbc_lex_next(&p->l);
3869 if (s) RETURN_STATUS(s);
3871 s = zbc_parse_expr(p, flags);
3872 if (s) RETURN_STATUS(s);
3873 if (p->l.t.t != BC_LEX_RPAREN)
3874 RETURN_STATUS(bc_error_bad_token());
3875 bc_parse_push(p, BC_INST_SCALE_FUNC);
3877 RETURN_STATUS(zbc_lex_next(&p->l));
3879 #define zbc_parse_scale(...) (zbc_parse_scale(__VA_ARGS__) COMMA_SUCCESS)
3881 static BC_STATUS zbc_parse_incdec(BcParse *p, BcInst *prev, bool *paren_expr,
3882 size_t *nexprs, uint8_t flags)
3887 BcInst etype = *prev;
3889 if (etype == BC_INST_VAR || etype == BC_INST_ARRAY_ELEM
3890 || etype == BC_INST_SCALE || etype == BC_INST_LAST
3891 || etype == BC_INST_IBASE || etype == BC_INST_OBASE
3893 *prev = inst = BC_INST_INC_POST + (p->l.t.t != BC_LEX_OP_INC);
3894 bc_parse_push(p, inst);
3895 s = zbc_lex_next(&p->l);
3897 *prev = inst = BC_INST_INC_PRE + (p->l.t.t != BC_LEX_OP_INC);
3900 s = zbc_lex_next(&p->l);
3901 if (s) RETURN_STATUS(s);
3904 // Because we parse the next part of the expression
3905 // right here, we need to increment this.
3906 *nexprs = *nexprs + 1;
3910 s = zbc_parse_name(p, prev, flags | BC_PARSE_NOCALL);
3912 case BC_LEX_KEY_IBASE:
3913 case BC_LEX_KEY_LAST:
3914 case BC_LEX_KEY_OBASE:
3915 bc_parse_push(p, type - BC_LEX_KEY_IBASE + BC_INST_IBASE);
3916 s = zbc_lex_next(&p->l);
3918 case BC_LEX_KEY_SCALE:
3919 s = zbc_lex_next(&p->l);
3920 if (s) RETURN_STATUS(s);
3921 if (p->l.t.t == BC_LEX_LPAREN)
3922 s = bc_error_bad_token();
3924 bc_parse_push(p, BC_INST_SCALE);
3927 s = bc_error_bad_token();
3931 if (!s) bc_parse_push(p, inst);
3936 #define zbc_parse_incdec(...) (zbc_parse_incdec(__VA_ARGS__) COMMA_SUCCESS)
3938 static BC_STATUS zbc_parse_minus(BcParse *p, BcInst *prev, size_t ops_bgn,
3939 bool rparen, size_t *nexprs)
3943 BcInst etype = *prev;
3945 s = zbc_lex_next(&p->l);
3946 if (s) RETURN_STATUS(s);
3948 type = rparen || etype == BC_INST_INC_POST || etype == BC_INST_DEC_POST ||
3949 (etype >= BC_INST_NUM && etype <= BC_INST_SQRT) ?
3952 *prev = BC_TOKEN_2_INST(type);
3954 // We can just push onto the op stack because this is the largest
3955 // precedence operator that gets pushed. Inc/dec does not.
3956 if (type != BC_LEX_OP_MINUS)
3957 bc_vec_push(&p->ops, &type);
3959 bc_parse_operator(p, type, ops_bgn, nexprs);
3963 #define zbc_parse_minus(...) (zbc_parse_minus(__VA_ARGS__) COMMA_SUCCESS)
3965 static BC_STATUS zbc_parse_string(BcParse *p, char inst)
3967 char *str = xstrdup(p->l.t.v.v);
3969 bc_parse_push(p, BC_INST_STR);
3970 bc_parse_pushIndex(p, G.prog.strs.len);
3971 bc_vec_push(&G.prog.strs, &str);
3972 bc_parse_push(p, inst);
3974 RETURN_STATUS(zbc_lex_next(&p->l));
3976 #define zbc_parse_string(...) (zbc_parse_string(__VA_ARGS__) COMMA_SUCCESS)
3978 static BC_STATUS zbc_parse_print(BcParse *p)
3984 s = zbc_lex_next(&p->l);
3985 if (s) RETURN_STATUS(s);
3987 if (type == BC_LEX_STR) {
3988 s = zbc_parse_string(p, BC_INST_PRINT_POP);
3990 s = zbc_parse_expr(p, 0);
3991 bc_parse_push(p, BC_INST_PRINT_POP);
3993 if (s) RETURN_STATUS(s);
3994 if (p->l.t.t != BC_LEX_COMMA)
4000 #define zbc_parse_print(...) (zbc_parse_print(__VA_ARGS__) COMMA_SUCCESS)
4002 static BC_STATUS zbc_parse_return(BcParse *p)
4007 dbg_lex_enter("%s:%d entered", __func__, __LINE__);
4008 s = zbc_lex_next(&p->l);
4009 if (s) RETURN_STATUS(s);
4012 if (t == BC_LEX_NLINE || t == BC_LEX_SCOLON)
4013 bc_parse_push(p, BC_INST_RET0);
4015 bool paren = (t == BC_LEX_LPAREN);
4016 s = bc_parse_expr_empty_ok(p, 0);
4017 if (s == BC_STATUS_PARSE_EMPTY_EXP) {
4018 bc_parse_push(p, BC_INST_RET0);
4019 s = zbc_lex_next(&p->l);
4021 if (s) RETURN_STATUS(s);
4023 if (!paren || p->l.t.last != BC_LEX_RPAREN) {
4024 s = bc_POSIX_requires("parentheses around return expressions");
4025 IF_ERROR_RETURN_POSSIBLE(if (s) RETURN_STATUS(s));
4028 bc_parse_push(p, BC_INST_RET);
4031 dbg_lex_done("%s:%d done", __func__, __LINE__);
4034 #define zbc_parse_return(...) (zbc_parse_return(__VA_ARGS__) COMMA_SUCCESS)
4036 static void rewrite_label_to_current(BcParse *p, size_t idx)
4038 size_t *label = bc_vec_item(&p->func->labels, idx);
4039 *label = p->func->code.len;
4042 static BC_STATUS zbc_parse_if(BcParse *p)
4047 dbg_lex_enter("%s:%d entered", __func__, __LINE__);
4048 s = zbc_lex_next(&p->l);
4049 if (s) RETURN_STATUS(s);
4050 if (p->l.t.t != BC_LEX_LPAREN) RETURN_STATUS(bc_error_bad_token());
4052 s = zbc_lex_next(&p->l);
4053 if (s) RETURN_STATUS(s);
4054 s = zbc_parse_expr(p, BC_PARSE_REL);
4055 if (s) RETURN_STATUS(s);
4057 if (p->l.t.t != BC_LEX_RPAREN) RETURN_STATUS(bc_error_bad_token());
4059 ip_idx = p->func->labels.len;
4060 bc_parse_pushJUMP_ZERO(p, ip_idx);
4061 bc_vec_push(&p->func->labels, &ip_idx);
4063 s = zbc_parse_stmt_allow_NLINE_before(p, STRING_if);
4064 if (s) RETURN_STATUS(s);
4066 dbg_lex("%s:%d in if after stmt: p->l.t.t:%d", __func__, __LINE__, p->l.t.t);
4067 if (p->l.t.t == BC_LEX_KEY_ELSE) {
4070 ip2_idx = p->func->labels.len;
4072 dbg_lex("%s:%d after if() body: BC_INST_JUMP to %zd", __func__, __LINE__, ip2_idx);
4073 bc_parse_pushJUMP(p, ip2_idx);
4075 dbg_lex("%s:%d rewriting 'if_zero' label to jump to 'else'-> %zd", __func__, __LINE__, p->func->code.len);
4076 rewrite_label_to_current(p, ip_idx);
4078 bc_vec_push(&p->func->labels, &ip2_idx);
4081 s = zbc_parse_stmt_allow_NLINE_before(p, STRING_else);
4082 if (s) RETURN_STATUS(s);
4085 dbg_lex("%s:%d rewriting label to jump after 'if' body-> %zd", __func__, __LINE__, p->func->code.len);
4086 rewrite_label_to_current(p, ip_idx);
4088 dbg_lex_done("%s:%d done", __func__, __LINE__);
4091 #define zbc_parse_if(...) (zbc_parse_if(__VA_ARGS__) COMMA_SUCCESS)
4093 static BC_STATUS zbc_parse_while(BcParse *p)
4099 s = zbc_lex_next(&p->l);
4100 if (s) RETURN_STATUS(s);
4101 if (p->l.t.t != BC_LEX_LPAREN) RETURN_STATUS(bc_error_bad_token());
4102 s = zbc_lex_next(&p->l);
4103 if (s) RETURN_STATUS(s);
4105 cond_idx = p->func->labels.len;
4106 ip_idx = cond_idx + 1;
4108 bc_vec_push(&p->func->labels, &p->func->code.len);
4109 bc_vec_push(&p->conds, &cond_idx);
4111 bc_vec_push(&p->exits, &ip_idx);
4112 bc_vec_push(&p->func->labels, &ip_idx);
4114 s = zbc_parse_expr(p, BC_PARSE_REL);
4115 if (s) RETURN_STATUS(s);
4116 if (p->l.t.t != BC_LEX_RPAREN) RETURN_STATUS(bc_error_bad_token());
4118 bc_parse_pushJUMP_ZERO(p, ip_idx);
4120 s = zbc_parse_stmt_allow_NLINE_before(p, STRING_while);
4121 if (s) RETURN_STATUS(s);
4123 dbg_lex("%s:%d BC_INST_JUMP to %zd", __func__, __LINE__, cond_idx);
4124 bc_parse_pushJUMP(p, cond_idx);
4126 dbg_lex("%s:%d rewriting label-> %zd", __func__, __LINE__, p->func->code.len);
4127 rewrite_label_to_current(p, ip_idx);
4129 bc_vec_pop(&p->exits);
4130 bc_vec_pop(&p->conds);
4134 #define zbc_parse_while(...) (zbc_parse_while(__VA_ARGS__) COMMA_SUCCESS)
4136 static BC_STATUS zbc_parse_for(BcParse *p)
4139 size_t cond_idx, exit_idx, body_idx, update_idx;
4141 dbg_lex("%s:%d p->l.t.t:%d", __func__, __LINE__, p->l.t.t);
4142 s = zbc_lex_next(&p->l);
4143 if (s) RETURN_STATUS(s);
4144 if (p->l.t.t != BC_LEX_LPAREN) RETURN_STATUS(bc_error_bad_token());
4145 s = zbc_lex_next(&p->l);
4146 if (s) RETURN_STATUS(s);
4148 if (p->l.t.t != BC_LEX_SCOLON)
4149 s = zbc_parse_expr(p, 0);
4151 s = bc_POSIX_does_not_allow_empty_X_expression_in_for("init");
4153 if (s) RETURN_STATUS(s);
4154 if (p->l.t.t != BC_LEX_SCOLON) RETURN_STATUS(bc_error_bad_token());
4155 s = zbc_lex_next(&p->l);
4156 if (s) RETURN_STATUS(s);
4158 cond_idx = p->func->labels.len;
4159 update_idx = cond_idx + 1;
4160 body_idx = update_idx + 1;
4161 exit_idx = body_idx + 1;
4163 bc_vec_push(&p->func->labels, &p->func->code.len);
4165 if (p->l.t.t != BC_LEX_SCOLON)
4166 s = zbc_parse_expr(p, BC_PARSE_REL);
4168 s = bc_POSIX_does_not_allow_empty_X_expression_in_for("condition");
4170 if (s) RETURN_STATUS(s);
4171 if (p->l.t.t != BC_LEX_SCOLON) RETURN_STATUS(bc_error_bad_token());
4173 s = zbc_lex_next(&p->l);
4174 if (s) RETURN_STATUS(s);
4176 bc_parse_pushJUMP_ZERO(p, exit_idx);
4177 bc_parse_pushJUMP(p, body_idx);
4179 bc_vec_push(&p->conds, &update_idx);
4180 bc_vec_push(&p->func->labels, &p->func->code.len);
4182 if (p->l.t.t != BC_LEX_RPAREN)
4183 s = zbc_parse_expr(p, 0);
4185 s = bc_POSIX_does_not_allow_empty_X_expression_in_for("update");
4187 if (s) RETURN_STATUS(s);
4189 if (p->l.t.t != BC_LEX_RPAREN) RETURN_STATUS(bc_error_bad_token());
4190 bc_parse_pushJUMP(p, cond_idx);
4191 bc_vec_push(&p->func->labels, &p->func->code.len);
4193 bc_vec_push(&p->exits, &exit_idx);
4194 bc_vec_push(&p->func->labels, &exit_idx);
4196 s = zbc_parse_stmt_allow_NLINE_before(p, STRING_for);
4197 if (s) RETURN_STATUS(s);
4199 dbg_lex("%s:%d BC_INST_JUMP to %zd", __func__, __LINE__, update_idx);
4200 bc_parse_pushJUMP(p, update_idx);
4202 dbg_lex("%s:%d rewriting label-> %zd", __func__, __LINE__, p->func->code.len);
4203 rewrite_label_to_current(p, exit_idx);
4205 bc_vec_pop(&p->exits);
4206 bc_vec_pop(&p->conds);
4208 RETURN_STATUS(BC_STATUS_SUCCESS);
4210 #define zbc_parse_for(...) (zbc_parse_for(__VA_ARGS__) COMMA_SUCCESS)
4212 static BC_STATUS zbc_parse_break_or_continue(BcParse *p, BcLexType type)
4217 if (type == BC_LEX_KEY_BREAK) {
4218 if (p->exits.len == 0) // none of the enclosing blocks is a loop
4219 RETURN_STATUS(bc_error_bad_token());
4220 i = *(size_t*)bc_vec_top(&p->exits);
4222 i = *(size_t*)bc_vec_top(&p->conds);
4225 bc_parse_pushJUMP(p, i);
4227 s = zbc_lex_next(&p->l);
4228 if (s) RETURN_STATUS(s);
4230 if (p->l.t.t != BC_LEX_SCOLON && p->l.t.t != BC_LEX_NLINE)
4231 RETURN_STATUS(bc_error_bad_token());
4233 RETURN_STATUS(zbc_lex_next(&p->l));
4235 #define zbc_parse_break_or_continue(...) (zbc_parse_break_or_continue(__VA_ARGS__) COMMA_SUCCESS)
4237 static BC_STATUS zbc_parse_funcdef(BcParse *p)
4240 bool var, comma = false;
4243 dbg_lex_enter("%s:%d entered", __func__, __LINE__);
4244 s = zbc_lex_next(&p->l);
4245 if (s) RETURN_STATUS(s);
4246 if (p->l.t.t != BC_LEX_NAME)
4247 RETURN_STATUS(bc_error("bad function definition"));
4249 name = xstrdup(p->l.t.v.v);
4250 bc_parse_addFunc(p, name, &p->fidx);
4252 s = zbc_lex_next(&p->l);
4253 if (s) RETURN_STATUS(s);
4254 if (p->l.t.t != BC_LEX_LPAREN)
4255 RETURN_STATUS(bc_error("bad function definition"));
4256 s = zbc_lex_next(&p->l);
4257 if (s) RETURN_STATUS(s);
4259 while (p->l.t.t != BC_LEX_RPAREN) {
4260 if (p->l.t.t != BC_LEX_NAME)
4261 RETURN_STATUS(bc_error("bad function definition"));
4265 name = xstrdup(p->l.t.v.v);
4266 s = zbc_lex_next(&p->l);
4269 var = p->l.t.t != BC_LEX_LBRACKET;
4272 s = zbc_lex_next(&p->l);
4275 if (p->l.t.t != BC_LEX_RBRACKET) {
4276 s = bc_error("bad function definition");
4280 s = zbc_lex_next(&p->l);
4284 comma = p->l.t.t == BC_LEX_COMMA;
4286 s = zbc_lex_next(&p->l);
4290 s = zbc_func_insert(p->func, name, var);
4294 if (comma) RETURN_STATUS(bc_error("bad function definition"));
4296 s = zbc_lex_next(&p->l);
4297 if (s) RETURN_STATUS(s);
4299 if (p->l.t.t != BC_LEX_LBRACE)
4300 s = bc_POSIX_requires("the left brace be on the same line as the function header");
4302 // Prevent "define z()<newline>" from being interpreted as function with empty stmt as body
4303 s = zbc_lex_skip_if_at_NLINE(&p->l);
4304 if (s) RETURN_STATUS(s);
4305 //GNU bc requires a {} block even if function body has single stmt, enforce this?
4306 if (p->l.t.t != BC_LEX_LBRACE)
4307 RETURN_STATUS(bc_error("function { body } expected"));
4309 p->in_funcdef++; // to determine whether "return" stmt is allowed, and such
4310 s = zbc_parse_stmt_possibly_auto(p, true);
4312 if (s) RETURN_STATUS(s);
4314 bc_parse_push(p, BC_INST_RET0);
4315 bc_parse_updateFunc(p, BC_PROG_MAIN);
4317 dbg_lex_done("%s:%d done", __func__, __LINE__);
4320 dbg_lex_done("%s:%d done (error)", __func__, __LINE__);
4324 #define zbc_parse_funcdef(...) (zbc_parse_funcdef(__VA_ARGS__) COMMA_SUCCESS)
4326 static BC_STATUS zbc_parse_auto(BcParse *p)
4329 bool comma, var, one;
4332 dbg_lex_enter("%s:%d entered", __func__, __LINE__);
4333 s = zbc_lex_next(&p->l);
4334 if (s) RETURN_STATUS(s);
4337 one = p->l.t.t == BC_LEX_NAME;
4339 while (p->l.t.t == BC_LEX_NAME) {
4340 name = xstrdup(p->l.t.v.v);
4341 s = zbc_lex_next(&p->l);
4344 var = p->l.t.t != BC_LEX_LBRACKET;
4346 s = zbc_lex_next(&p->l);
4349 if (p->l.t.t != BC_LEX_RBRACKET) {
4350 s = bc_error("bad function definition");
4354 s = zbc_lex_next(&p->l);
4358 comma = p->l.t.t == BC_LEX_COMMA;
4360 s = zbc_lex_next(&p->l);
4364 s = zbc_func_insert(p->func, name, var);
4368 if (comma) RETURN_STATUS(bc_error("bad function definition"));
4369 if (!one) RETURN_STATUS(bc_error("no auto variable found"));
4371 if (p->l.t.t != BC_LEX_NLINE && p->l.t.t != BC_LEX_SCOLON)
4372 RETURN_STATUS(bc_error_bad_token());
4374 dbg_lex_done("%s:%d done", __func__, __LINE__);
4375 RETURN_STATUS(zbc_lex_next(&p->l));
4378 dbg_lex_done("%s:%d done (ERROR)", __func__, __LINE__);
4381 #define zbc_parse_auto(...) (zbc_parse_auto(__VA_ARGS__) COMMA_SUCCESS)
4383 #undef zbc_parse_stmt_possibly_auto
4384 static BC_STATUS zbc_parse_stmt_possibly_auto(BcParse *p, bool auto_allowed)
4386 BcStatus s = BC_STATUS_SUCCESS;
4388 dbg_lex_enter("%s:%d entered, p->l.t.t:%d", __func__, __LINE__, p->l.t.t);
4390 if (p->l.t.t == BC_LEX_NLINE) {
4391 dbg_lex_done("%s:%d done (seen BC_LEX_NLINE)", __func__, __LINE__);
4392 RETURN_STATUS(zbc_lex_next(&p->l));
4394 if (p->l.t.t == BC_LEX_SCOLON) {
4395 dbg_lex_done("%s:%d done (seen BC_LEX_SCOLON)", __func__, __LINE__);
4396 RETURN_STATUS(zbc_lex_next(&p->l));
4399 if (p->l.t.t == BC_LEX_LBRACE) {
4400 dbg_lex("%s:%d BC_LEX_LBRACE: (auto_allowed:%d)", __func__, __LINE__, auto_allowed);
4402 s = zbc_lex_next(&p->l);
4403 if (s) RETURN_STATUS(s);
4404 } while (p->l.t.t == BC_LEX_NLINE);
4405 if (auto_allowed && p->l.t.t == BC_LEX_KEY_AUTO) {
4406 dbg_lex("%s:%d calling zbc_parse_auto()", __func__, __LINE__);
4407 s = zbc_parse_auto(p);
4408 if (s) RETURN_STATUS(s);
4410 while (p->l.t.t != BC_LEX_RBRACE) {
4411 dbg_lex("%s:%d block parsing loop", __func__, __LINE__);
4412 s = zbc_parse_stmt(p);
4413 if (s) RETURN_STATUS(s);
4415 s = zbc_lex_next(&p->l);
4416 dbg_lex_done("%s:%d done (seen BC_LEX_RBRACE)", __func__, __LINE__);
4420 dbg_lex("%s:%d p->l.t.t:%d", __func__, __LINE__, p->l.t.t);
4424 case BC_LEX_OP_MINUS:
4425 case BC_LEX_OP_BOOL_NOT:
4429 case BC_LEX_KEY_IBASE:
4430 case BC_LEX_KEY_LAST:
4431 case BC_LEX_KEY_LENGTH:
4432 case BC_LEX_KEY_OBASE:
4433 case BC_LEX_KEY_READ:
4434 case BC_LEX_KEY_SCALE:
4435 case BC_LEX_KEY_SQRT:
4436 s = zbc_parse_expr(p, BC_PARSE_PRINT);
4439 s = zbc_parse_string(p, BC_INST_PRINT_STR);
4441 case BC_LEX_KEY_BREAK:
4442 case BC_LEX_KEY_CONTINUE:
4443 s = zbc_parse_break_or_continue(p, p->l.t.t);
4445 case BC_LEX_KEY_FOR:
4446 s = zbc_parse_for(p);
4448 case BC_LEX_KEY_HALT:
4449 bc_parse_push(p, BC_INST_HALT);
4450 s = zbc_lex_next(&p->l);
4453 s = zbc_parse_if(p);
4455 case BC_LEX_KEY_LIMITS:
4456 // "limits" is a compile-time command,
4457 // the output is produced at _parse time_.
4459 "BC_BASE_MAX = "BC_MAX_OBASE_STR "\n"
4460 "BC_DIM_MAX = "BC_MAX_DIM_STR "\n"
4461 "BC_SCALE_MAX = "BC_MAX_SCALE_STR "\n"
4462 "BC_STRING_MAX = "BC_MAX_STRING_STR"\n"
4463 "BC_NAME_MAX = "BC_MAX_NAME_STR "\n"
4464 "BC_NUM_MAX = "BC_MAX_NUM_STR "\n"
4465 "MAX Exponent = "BC_MAX_EXP_STR "\n"
4466 "Number of vars = "BC_MAX_VARS_STR "\n"
4468 s = zbc_lex_next(&p->l);
4470 case BC_LEX_KEY_PRINT:
4471 s = zbc_parse_print(p);
4473 case BC_LEX_KEY_QUIT:
4474 // "quit" is a compile-time command. For example,
4475 // "if (0 == 1) quit" terminates when parsing the statement,
4476 // not when it is executed
4477 QUIT_OR_RETURN_TO_MAIN;
4478 case BC_LEX_KEY_RETURN:
4480 RETURN_STATUS(bc_error("'return' not in a function"));
4481 s = zbc_parse_return(p);
4483 case BC_LEX_KEY_WHILE:
4484 s = zbc_parse_while(p);
4487 s = bc_error_bad_token();
4491 if (s || G_interrupt) {
4493 s = BC_STATUS_FAILURE;
4496 dbg_lex_done("%s:%d done", __func__, __LINE__);
4499 #define zbc_parse_stmt_possibly_auto(...) (zbc_parse_stmt_possibly_auto(__VA_ARGS__) COMMA_SUCCESS)
4501 static BC_STATUS zbc_parse_stmt_or_funcdef(BcParse *p)
4505 dbg_lex_enter("%s:%d entered", __func__, __LINE__);
4506 if (p->l.t.t == BC_LEX_EOF)
4507 s = bc_error("end of file");
4508 else if (p->l.t.t == BC_LEX_KEY_DEFINE) {
4509 dbg_lex("%s:%d p->l.t.t:BC_LEX_KEY_DEFINE", __func__, __LINE__);
4510 s = zbc_parse_funcdef(p);
4512 dbg_lex("%s:%d p->l.t.t:%d (not BC_LEX_KEY_DEFINE)", __func__, __LINE__, p->l.t.t);
4513 s = zbc_parse_stmt(p);
4516 dbg_lex_done("%s:%d done", __func__, __LINE__);
4519 #define zbc_parse_stmt_or_funcdef(...) (zbc_parse_stmt_or_funcdef(__VA_ARGS__) COMMA_SUCCESS)
4521 // This is not a "z" function: can also return BC_STATUS_PARSE_EMPTY_EXP
4522 static BcStatus bc_parse_expr_empty_ok(BcParse *p, uint8_t flags)
4524 BcStatus s = BC_STATUS_SUCCESS;
4525 BcInst prev = BC_INST_PRINT;
4526 BcLexType top, t = p->l.t.t;
4527 size_t nexprs = 0, ops_bgn = p->ops.len;
4528 unsigned nparens, nrelops;
4529 bool paren_first, paren_expr, rprn, done, get_token, assign, bin_last;
4531 dbg_lex_enter("%s:%d entered", __func__, __LINE__);
4532 paren_first = p->l.t.t == BC_LEX_LPAREN;
4533 nparens = nrelops = 0;
4534 paren_expr = rprn = done = get_token = assign = false;
4537 for (; !G_interrupt && !s && !done && bc_parse_exprs(t); t = p->l.t.t) {
4541 s = zbc_parse_incdec(p, &prev, &paren_expr, &nexprs, flags);
4542 rprn = get_token = bin_last = false;
4544 case BC_LEX_OP_MINUS:
4545 s = zbc_parse_minus(p, &prev, ops_bgn, rprn, &nexprs);
4546 rprn = get_token = false;
4547 bin_last = prev == BC_INST_MINUS;
4549 case BC_LEX_OP_ASSIGN_POWER:
4550 case BC_LEX_OP_ASSIGN_MULTIPLY:
4551 case BC_LEX_OP_ASSIGN_DIVIDE:
4552 case BC_LEX_OP_ASSIGN_MODULUS:
4553 case BC_LEX_OP_ASSIGN_PLUS:
4554 case BC_LEX_OP_ASSIGN_MINUS:
4555 case BC_LEX_OP_ASSIGN:
4556 if (prev != BC_INST_VAR && prev != BC_INST_ARRAY_ELEM
4557 && prev != BC_INST_SCALE && prev != BC_INST_IBASE
4558 && prev != BC_INST_OBASE && prev != BC_INST_LAST
4560 s = bc_error("bad assignment:"
4561 " left side must be variable"
4563 ); // note: shared string
4567 case BC_LEX_OP_POWER:
4568 case BC_LEX_OP_MULTIPLY:
4569 case BC_LEX_OP_DIVIDE:
4570 case BC_LEX_OP_MODULUS:
4571 case BC_LEX_OP_PLUS:
4572 case BC_LEX_OP_REL_EQ:
4573 case BC_LEX_OP_REL_LE:
4574 case BC_LEX_OP_REL_GE:
4575 case BC_LEX_OP_REL_NE:
4576 case BC_LEX_OP_REL_LT:
4577 case BC_LEX_OP_REL_GT:
4578 case BC_LEX_OP_BOOL_NOT:
4579 case BC_LEX_OP_BOOL_OR:
4580 case BC_LEX_OP_BOOL_AND:
4581 if (((t == BC_LEX_OP_BOOL_NOT) != bin_last)
4582 || (t != BC_LEX_OP_BOOL_NOT && prev == BC_INST_BOOL_NOT)
4584 return bc_error_bad_expression();
4586 nrelops += t >= BC_LEX_OP_REL_EQ && t <= BC_LEX_OP_REL_GT;
4587 prev = BC_TOKEN_2_INST(t);
4588 bc_parse_operator(p, t, ops_bgn, &nexprs);
4589 s = zbc_lex_next(&p->l);
4590 rprn = get_token = false;
4591 bin_last = t != BC_LEX_OP_BOOL_NOT;
4594 if (BC_PARSE_LEAF(prev, rprn))
4595 return bc_error_bad_expression();
4597 paren_expr = rprn = bin_last = false;
4599 bc_vec_push(&p->ops, &t);
4602 if (bin_last || prev == BC_INST_BOOL_NOT)
4603 return bc_error_bad_expression();
4605 s = BC_STATUS_SUCCESS;
4611 dbg_lex_done("%s:%d done (returning EMPTY_EXP)", __func__, __LINE__);
4612 return BC_STATUS_PARSE_EMPTY_EXP;
4615 paren_expr = rprn = true;
4616 get_token = bin_last = false;
4617 s = zbc_parse_rightParen(p, ops_bgn, &nexprs);
4620 if (BC_PARSE_LEAF(prev, rprn))
4621 return bc_error_bad_expression();
4623 rprn = get_token = bin_last = false;
4624 s = zbc_parse_name(p, &prev, flags & ~BC_PARSE_NOCALL);
4628 if (BC_PARSE_LEAF(prev, rprn))
4629 return bc_error_bad_expression();
4633 paren_expr = get_token = true;
4634 rprn = bin_last = false;
4636 case BC_LEX_KEY_IBASE:
4637 case BC_LEX_KEY_LAST:
4638 case BC_LEX_KEY_OBASE:
4639 if (BC_PARSE_LEAF(prev, rprn))
4640 return bc_error_bad_expression();
4641 prev = (char) (t - BC_LEX_KEY_IBASE + BC_INST_IBASE);
4642 bc_parse_push(p, (char) prev);
4643 paren_expr = get_token = true;
4644 rprn = bin_last = false;
4647 case BC_LEX_KEY_LENGTH:
4648 case BC_LEX_KEY_SQRT:
4649 if (BC_PARSE_LEAF(prev, rprn))
4650 return bc_error_bad_expression();
4651 s = zbc_parse_builtin(p, t, flags, &prev);
4653 rprn = get_token = bin_last = false;
4656 case BC_LEX_KEY_READ:
4657 if (BC_PARSE_LEAF(prev, rprn))
4658 return bc_error_bad_expression();
4659 else if (flags & BC_PARSE_NOREAD)
4660 s = bc_error_nested_read_call();
4662 s = zbc_parse_read(p);
4664 rprn = get_token = bin_last = false;
4666 prev = BC_INST_READ;
4668 case BC_LEX_KEY_SCALE:
4669 if (BC_PARSE_LEAF(prev, rprn))
4670 return bc_error_bad_expression();
4671 s = zbc_parse_scale(p, &prev, flags);
4673 rprn = get_token = bin_last = false;
4675 prev = BC_INST_SCALE;
4678 s = bc_error_bad_token();
4682 if (!s && get_token) s = zbc_lex_next(&p->l);
4686 if (G_interrupt) return BC_STATUS_FAILURE; // ^C: stop parsing
4688 while (p->ops.len > ops_bgn) {
4689 top = BC_PARSE_TOP_OP(p);
4690 assign = top >= BC_LEX_OP_ASSIGN_POWER && top <= BC_LEX_OP_ASSIGN;
4692 if (top == BC_LEX_LPAREN || top == BC_LEX_RPAREN)
4693 return bc_error_bad_expression();
4695 bc_parse_push(p, BC_TOKEN_2_INST(top));
4697 nexprs -= top != BC_LEX_OP_BOOL_NOT && top != BC_LEX_NEG;
4698 bc_vec_pop(&p->ops);
4701 if (prev == BC_INST_BOOL_NOT || nexprs != 1)
4702 return bc_error_bad_expression();
4704 if (!(flags & BC_PARSE_REL) && nrelops) {
4705 s = bc_POSIX_does_not_allow("comparison operators outside if or loops");
4706 IF_ERROR_RETURN_POSSIBLE(if (s) return s);
4707 } else if ((flags & BC_PARSE_REL) && nrelops > 1) {
4708 s = bc_POSIX_requires("exactly one comparison operator per condition");
4709 IF_ERROR_RETURN_POSSIBLE(if (s) return s);
4712 if (flags & BC_PARSE_PRINT) {
4713 if (paren_first || !assign) bc_parse_push(p, BC_INST_PRINT);
4714 bc_parse_push(p, BC_INST_POP);
4717 dbg_lex_done("%s:%d done", __func__, __LINE__);
4725 static BC_STATUS zdc_parse_register(BcParse *p)
4729 s = zbc_lex_next(&p->l);
4730 if (s) RETURN_STATUS(s);
4731 if (p->l.t.t != BC_LEX_NAME) RETURN_STATUS(bc_error_bad_token());
4733 bc_parse_pushName(p, p->l.t.v.v);
4737 #define zdc_parse_register(...) (zdc_parse_register(__VA_ARGS__) COMMA_SUCCESS)
4739 static BC_STATUS zdc_parse_string(BcParse *p)
4742 size_t idx, len = G.prog.strs.len;
4744 //why pad to 32 zeros??
4745 name = xasprintf("%032lu", (unsigned long)len);
4747 str = xstrdup(p->l.t.v.v);
4748 bc_parse_push(p, BC_INST_STR);
4749 bc_parse_pushIndex(p, len);
4750 bc_vec_push(&G.prog.strs, &str);
4751 bc_parse_addFunc(p, name, &idx);
4753 RETURN_STATUS(zbc_lex_next(&p->l));
4755 #define zdc_parse_string(...) (zdc_parse_string(__VA_ARGS__) COMMA_SUCCESS)
4757 static BC_STATUS zdc_parse_mem(BcParse *p, uint8_t inst, bool name, bool store)
4761 bc_parse_push(p, inst);
4763 s = zdc_parse_register(p);
4764 if (s) RETURN_STATUS(s);
4768 bc_parse_push(p, BC_INST_SWAP);
4769 bc_parse_push(p, BC_INST_ASSIGN);
4770 bc_parse_push(p, BC_INST_POP);
4773 RETURN_STATUS(zbc_lex_next(&p->l));
4775 #define zdc_parse_mem(...) (zdc_parse_mem(__VA_ARGS__) COMMA_SUCCESS)
4777 static BC_STATUS zdc_parse_cond(BcParse *p, uint8_t inst)
4781 bc_parse_push(p, inst);
4782 bc_parse_push(p, BC_INST_EXEC_COND);
4784 s = zdc_parse_register(p);
4785 if (s) RETURN_STATUS(s);
4787 s = zbc_lex_next(&p->l);
4788 if (s) RETURN_STATUS(s);
4790 if (p->l.t.t == BC_LEX_ELSE) {
4791 s = zdc_parse_register(p);
4792 if (s) RETURN_STATUS(s);
4793 s = zbc_lex_next(&p->l);
4795 bc_parse_push(p, BC_PARSE_STREND);
4799 #define zdc_parse_cond(...) (zdc_parse_cond(__VA_ARGS__) COMMA_SUCCESS)
4801 static BC_STATUS zdc_parse_token(BcParse *p, BcLexType t, uint8_t flags)
4803 BcStatus s = BC_STATUS_SUCCESS;
4805 bool assign, get_token = false;
4808 case BC_LEX_OP_REL_EQ:
4809 case BC_LEX_OP_REL_LE:
4810 case BC_LEX_OP_REL_GE:
4811 case BC_LEX_OP_REL_NE:
4812 case BC_LEX_OP_REL_LT:
4813 case BC_LEX_OP_REL_GT:
4814 s = zdc_parse_cond(p, t - BC_LEX_OP_REL_EQ + BC_INST_REL_EQ);
4818 s = zdc_parse_mem(p, BC_INST_ARRAY_ELEM, true, t == BC_LEX_COLON);
4821 s = zdc_parse_string(p);
4825 if (t == BC_LEX_NEG) {
4826 s = zbc_lex_next(&p->l);
4827 if (s) RETURN_STATUS(s);
4828 if (p->l.t.t != BC_LEX_NUMBER)
4829 RETURN_STATUS(bc_error_bad_token());
4832 if (t == BC_LEX_NEG) bc_parse_push(p, BC_INST_NEG);
4835 case BC_LEX_KEY_READ:
4836 if (flags & BC_PARSE_NOREAD)
4837 s = bc_error_nested_read_call();
4839 bc_parse_push(p, BC_INST_READ);
4842 case BC_LEX_OP_ASSIGN:
4843 case BC_LEX_STORE_PUSH:
4844 assign = t == BC_LEX_OP_ASSIGN;
4845 inst = assign ? BC_INST_VAR : BC_INST_PUSH_TO_VAR;
4846 s = zdc_parse_mem(p, inst, true, assign);
4849 case BC_LEX_LOAD_POP:
4850 inst = t == BC_LEX_LOAD_POP ? BC_INST_PUSH_VAR : BC_INST_LOAD;
4851 s = zdc_parse_mem(p, inst, true, false);
4853 case BC_LEX_STORE_IBASE:
4854 case BC_LEX_STORE_SCALE:
4855 case BC_LEX_STORE_OBASE:
4856 inst = t - BC_LEX_STORE_IBASE + BC_INST_IBASE;
4857 s = zdc_parse_mem(p, inst, false, true);
4860 s = bc_error_bad_token();
4865 if (!s && get_token) s = zbc_lex_next(&p->l);
4869 #define zdc_parse_token(...) (zdc_parse_token(__VA_ARGS__) COMMA_SUCCESS)
4871 static BC_STATUS zdc_parse_expr(BcParse *p, uint8_t flags)
4880 if (t == BC_LEX_EOF) break;
4882 inst = dc_parse_insts[t];
4883 if (inst != BC_INST_INVALID) {
4884 bc_parse_push(p, inst);
4885 s = zbc_lex_next(&p->l);
4887 s = zdc_parse_token(p, t, flags);
4889 if (s) RETURN_STATUS(s);
4892 if (flags & BC_PARSE_NOCALL)
4893 bc_parse_push(p, BC_INST_POP_EXEC);
4895 RETURN_STATUS(BC_STATUS_SUCCESS);
4897 #define zdc_parse_expr(...) (zdc_parse_expr(__VA_ARGS__) COMMA_SUCCESS)
4899 static BC_STATUS zdc_parse_parse(BcParse *p)
4903 if (p->l.t.t == BC_LEX_EOF)
4904 s = bc_error("end of file");
4906 s = zdc_parse_expr(p, 0);
4908 if (s || G_interrupt) {
4910 s = BC_STATUS_FAILURE;
4915 #define zdc_parse_parse(...) (zdc_parse_parse(__VA_ARGS__) COMMA_SUCCESS)
4919 static BC_STATUS zcommon_parse_expr(BcParse *p, uint8_t flags)
4922 IF_BC(RETURN_STATUS(zbc_parse_expr(p, flags)));
4924 IF_DC(RETURN_STATUS(zdc_parse_expr(p, flags)));
4927 #define zcommon_parse_expr(...) (zcommon_parse_expr(__VA_ARGS__) COMMA_SUCCESS)
4929 static BcVec* bc_program_search(char *id, bool var)
4937 v = var ? &G.prog.vars : &G.prog.arrs;
4938 map = var ? &G.prog.var_map : &G.prog.arr_map;
4942 new = bc_map_insert(map, &e, &i); // 1 if insertion was successful
4945 bc_array_init(&data.v, var);
4946 bc_vec_push(v, &data.v);
4949 ptr = bc_vec_item(map, i);
4950 if (new) ptr->name = xstrdup(e.name);
4951 return bc_vec_item(v, ptr->idx);
4954 static BC_STATUS zbc_program_num(BcResult *r, BcNum **num, bool hex)
4958 case BC_RESULT_TEMP:
4959 case BC_RESULT_IBASE:
4960 case BC_RESULT_SCALE:
4961 case BC_RESULT_OBASE:
4964 case BC_RESULT_CONSTANT: {
4966 char **str = bc_vec_item(&G.prog.consts, r->d.id.idx);
4968 size_t len = strlen(*str);
4970 bc_num_init(&r->d.n, len);
4972 hex = hex && len == 1;
4973 base_t = hex ? 16 : G.prog.ib_t;
4974 s = zbc_num_parse(&r->d.n, *str, base_t);
4977 bc_num_free(&r->d.n);
4982 r->t = BC_RESULT_TEMP;
4986 case BC_RESULT_ARRAY:
4987 case BC_RESULT_ARRAY_ELEM: {
4990 v = bc_program_search(r->d.id.name, r->t == BC_RESULT_VAR);
4992 if (r->t == BC_RESULT_ARRAY_ELEM) {
4994 if (v->len <= r->d.id.idx) bc_array_expand(v, r->d.id.idx + 1);
4995 *num = bc_vec_item(v, r->d.id.idx);
4997 *num = bc_vec_top(v);
5000 case BC_RESULT_LAST:
5001 *num = &G.prog.last;
5008 RETURN_STATUS(BC_STATUS_SUCCESS);
5010 #define zbc_program_num(...) (zbc_program_num(__VA_ARGS__) COMMA_SUCCESS)
5012 static BC_STATUS zbc_program_binOpPrep(BcResult **l, BcNum **ln,
5013 BcResult **r, BcNum **rn, bool assign)
5017 BcResultType lt, rt;
5019 if (!BC_PROG_STACK(&G.prog.results, 2))
5020 RETURN_STATUS(bc_error_stack_has_too_few_elements());
5022 *r = bc_vec_item_rev(&G.prog.results, 0);
5023 *l = bc_vec_item_rev(&G.prog.results, 1);
5027 hex = assign && (lt == BC_RESULT_IBASE || lt == BC_RESULT_OBASE);
5029 s = zbc_program_num(*l, ln, false);
5030 if (s) RETURN_STATUS(s);
5031 s = zbc_program_num(*r, rn, hex);
5032 if (s) RETURN_STATUS(s);
5034 // We run this again under these conditions in case any vector has been
5035 // reallocated out from under the BcNums or arrays we had.
5036 if (lt == rt && (lt == BC_RESULT_VAR || lt == BC_RESULT_ARRAY_ELEM)) {
5037 s = zbc_program_num(*l, ln, false);
5038 if (s) RETURN_STATUS(s);
5041 if (!BC_PROG_NUM((*l), (*ln)) && (!assign || (*l)->t != BC_RESULT_VAR))
5042 RETURN_STATUS(bc_error_variable_is_wrong_type());
5043 if (!assign && !BC_PROG_NUM((*r), (*ln)))
5044 RETURN_STATUS(bc_error_variable_is_wrong_type());
5048 #define zbc_program_binOpPrep(...) (zbc_program_binOpPrep(__VA_ARGS__) COMMA_SUCCESS)
5050 static void bc_program_binOpRetire(BcResult *r)
5052 r->t = BC_RESULT_TEMP;
5053 bc_vec_pop(&G.prog.results);
5054 bc_vec_pop(&G.prog.results);
5055 bc_vec_push(&G.prog.results, r);
5058 static BC_STATUS zbc_program_prep(BcResult **r, BcNum **n)
5062 if (!BC_PROG_STACK(&G.prog.results, 1))
5063 RETURN_STATUS(bc_error_stack_has_too_few_elements());
5064 *r = bc_vec_top(&G.prog.results);
5066 s = zbc_program_num(*r, n, false);
5067 if (s) RETURN_STATUS(s);
5069 if (!BC_PROG_NUM((*r), (*n)))
5070 RETURN_STATUS(bc_error_variable_is_wrong_type());
5074 #define zbc_program_prep(...) (zbc_program_prep(__VA_ARGS__) COMMA_SUCCESS)
5076 static void bc_program_retire(BcResult *r, BcResultType t)
5079 bc_vec_pop(&G.prog.results);
5080 bc_vec_push(&G.prog.results, r);
5083 static BC_STATUS zbc_program_op(char inst)
5086 BcResult *opd1, *opd2, res;
5087 BcNum *n1, *n2 = NULL;
5089 s = zbc_program_binOpPrep(&opd1, &n1, &opd2, &n2, false);
5090 if (s) RETURN_STATUS(s);
5091 bc_num_init_DEF_SIZE(&res.d.n);
5093 s = BC_STATUS_SUCCESS;
5094 IF_ERROR_RETURN_POSSIBLE(s =) zbc_program_ops[inst - BC_INST_POWER](n1, n2, &res.d.n, G.prog.scale);
5096 bc_program_binOpRetire(&res);
5100 bc_num_free(&res.d.n);
5103 #define zbc_program_op(...) (zbc_program_op(__VA_ARGS__) COMMA_SUCCESS)
5105 static BC_STATUS zbc_program_read(void)
5107 const char *sv_file;
5115 RETURN_STATUS(bc_error_nested_read_call());
5117 f = bc_program_func(BC_PROG_READ);
5118 bc_vec_pop_all(&f->code);
5120 sv_file = G.prog.file;
5124 bc_char_vec_init(&buf);
5125 bc_read_line(&buf, stdin);
5127 bc_parse_create(&parse, BC_PROG_READ);
5128 bc_lex_file(&parse.l);
5130 s = zbc_parse_text_init(&parse, buf.v);
5131 if (s) goto exec_err;
5132 s = zcommon_parse_expr(&parse, BC_PARSE_NOREAD);
5133 if (s) goto exec_err;
5135 if (parse.l.t.t != BC_LEX_NLINE && parse.l.t.t != BC_LEX_EOF) {
5136 s = bc_error("bad read() expression");
5140 ip.func = BC_PROG_READ;
5142 ip.len = G.prog.results.len;
5144 // Update this pointer, just in case.
5145 f = bc_program_func(BC_PROG_READ);
5147 bc_vec_pushByte(&f->code, BC_INST_POP_EXEC);
5148 bc_vec_push(&G.prog.stack, &ip);
5150 bc_parse_free(&parse);
5152 G.prog.file = sv_file;
5156 #define zbc_program_read(...) (zbc_program_read(__VA_ARGS__) COMMA_SUCCESS)
5158 static size_t bc_program_index(char *code, size_t *bgn)
5160 unsigned char *bytes = (void*)(code + *bgn);
5170 for (i = 0; i < amt; i += 8)
5171 res |= (size_t)(*bytes++) << i;
5176 static char *bc_program_name(char *code, size_t *bgn)
5182 s = xmalloc(strchr(code, BC_PARSE_STREND) - code + 1);
5186 if (c == BC_PARSE_STREND)
5196 static void bc_program_printString(const char *str)
5200 // Example: echo '[]ap' | dc
5201 // should print two bytes: 0x00, 0x0A
5208 if (c != '\\' || !*str)
5228 G.prog.nchars = SIZE_MAX;
5240 // Just print the backslash and following character.
5251 static void bc_num_printNewline(void)
5253 if (G.prog.nchars == G.prog.len - 1) {
5261 static FAST_FUNC void bc_num_printChar(size_t num, size_t width, bool radix)
5264 bb_putchar((char) num);
5265 G.prog.nchars += width;
5269 static FAST_FUNC void bc_num_printDigits(size_t num, size_t width, bool radix)
5273 bc_num_printNewline();
5274 bb_putchar(radix ? '.' : ' ');
5277 bc_num_printNewline();
5278 for (exp = 0, pow = 1; exp < width - 1; ++exp, pow *= 10)
5281 for (exp = 0; exp < width; pow /= 10, ++G.prog.nchars, ++exp) {
5283 bc_num_printNewline();
5286 bb_putchar(((char) dig) + '0');
5290 static FAST_FUNC void bc_num_printHex(size_t num, size_t width, bool radix)
5293 bc_num_printNewline();
5298 bc_num_printNewline();
5299 bb_putchar(bb_hexdigits_upcase[num]);
5300 G.prog.nchars += width;
5303 static void bc_num_printDecimal(BcNum *n)
5305 size_t i, rdx = n->rdx - 1;
5312 for (i = n->len - 1; i < n->len; --i)
5313 bc_num_printHex((size_t) n->num[i], 1, i == rdx);
5316 static BC_STATUS zbc_num_printNum(BcNum *n, unsigned base_t, size_t width, BcNumDigitOp print)
5321 BcNum intp, fracp, digit, frac_len;
5322 unsigned long dig, *ptr;
5327 print(0, width, false);
5328 RETURN_STATUS(BC_STATUS_SUCCESS);
5331 bc_vec_init(&stack, sizeof(long), NULL);
5332 bc_num_init(&intp, n->len);
5333 bc_num_init(&fracp, n->rdx);
5334 bc_num_init(&digit, width);
5335 bc_num_init(&frac_len, BC_NUM_INT(n));
5336 bc_num_copy(&intp, n);
5337 bc_num_one(&frac_len);
5338 //TODO: have BcNumSmall type, with static buffer
5339 bc_num_init_DEF_SIZE(&base);
5340 bc_num_ulong2num(&base, base_t);
5342 bc_num_truncate(&intp, intp.rdx);
5343 s = zbc_num_sub(n, &intp, &fracp, 0);
5346 while (intp.len != 0) {
5347 s = zbc_num_divmod(&intp, &base, &intp, &digit, 0);
5349 s = zbc_num_ulong(&digit, &dig);
5351 bc_vec_push(&stack, &dig);
5354 for (i = 0; i < stack.len; ++i) {
5355 ptr = bc_vec_item_rev(&stack, i);
5356 print(*ptr, width, false);
5359 if (!n->rdx) goto err;
5361 for (radix = true; frac_len.len <= n->rdx; radix = false) {
5362 s = zbc_num_mul(&fracp, &base, &fracp, n->rdx);
5364 s = zbc_num_ulong(&fracp, &dig);
5366 bc_num_ulong2num(&intp, dig);
5367 s = zbc_num_sub(&fracp, &intp, &fracp, 0);
5369 print(dig, width, radix);
5370 s = zbc_num_mul(&frac_len, &base, &frac_len, 0);
5375 bc_num_free(&frac_len);
5376 bc_num_free(&digit);
5377 bc_num_free(&fracp);
5379 bc_vec_free(&stack);
5382 #define zbc_num_printNum(...) (zbc_num_printNum(__VA_ARGS__) COMMA_SUCCESS)
5384 static BC_STATUS zbc_num_printBase(BcNum *n)
5398 if (G.prog.ob_t <= BC_NUM_MAX_IBASE) {
5400 print = bc_num_printHex;
5402 unsigned i = G.prog.ob_t - 1;
5410 print = bc_num_printDigits;
5413 s = zbc_num_printNum(n, G.prog.ob_t, width, print);
5418 #define zbc_num_printBase(...) (zbc_num_printBase(__VA_ARGS__) COMMA_SUCCESS)
5420 static BC_STATUS zbc_num_print(BcNum *n, bool newline)
5422 BcStatus s = BC_STATUS_SUCCESS;
5424 bc_num_printNewline();
5429 } else if (G.prog.ob_t == 10)
5430 bc_num_printDecimal(n);
5432 s = zbc_num_printBase(n);
5441 #define zbc_num_print(...) (zbc_num_print(__VA_ARGS__) COMMA_SUCCESS)
5443 static BC_STATUS zbc_program_print(char inst, size_t idx)
5448 bool pop = inst != BC_INST_PRINT;
5450 if (!BC_PROG_STACK(&G.prog.results, idx + 1))
5451 RETURN_STATUS(bc_error_stack_has_too_few_elements());
5453 r = bc_vec_item_rev(&G.prog.results, idx);
5454 num = NULL; // is this NULL necessary?
5455 s = zbc_program_num(r, &num, false);
5456 if (s) RETURN_STATUS(s);
5458 if (BC_PROG_NUM(r, num)) {
5459 s = zbc_num_print(num, !pop);
5460 if (!s) bc_num_copy(&G.prog.last, num);
5464 idx = (r->t == BC_RESULT_STR) ? r->d.id.idx : num->rdx;
5465 str = *bc_program_str(idx);
5467 if (inst == BC_INST_PRINT_STR) {
5470 if (c == '\0') break;
5473 if (c == '\n') G.prog.nchars = 0;
5476 bc_program_printString(str);
5477 if (inst == BC_INST_PRINT) bb_putchar('\n');
5481 if (!s && pop) bc_vec_pop(&G.prog.results);
5485 #define zbc_program_print(...) (zbc_program_print(__VA_ARGS__) COMMA_SUCCESS)
5487 static BC_STATUS zbc_program_negate(void)
5493 s = zbc_program_prep(&ptr, &num);
5494 if (s) RETURN_STATUS(s);
5496 bc_num_init(&res.d.n, num->len);
5497 bc_num_copy(&res.d.n, num);
5498 if (res.d.n.len) res.d.n.neg = !res.d.n.neg;
5500 bc_program_retire(&res, BC_RESULT_TEMP);
5504 #define zbc_program_negate(...) (zbc_program_negate(__VA_ARGS__) COMMA_SUCCESS)
5506 static BC_STATUS zbc_program_logical(char inst)
5509 BcResult *opd1, *opd2, res;
5513 s = zbc_program_binOpPrep(&opd1, &n1, &opd2, &n2, false);
5514 if (s) RETURN_STATUS(s);
5516 bc_num_init_DEF_SIZE(&res.d.n);
5518 if (inst == BC_INST_BOOL_AND)
5519 cond = bc_num_cmp(n1, &G.prog.zero) && bc_num_cmp(n2, &G.prog.zero);
5520 else if (inst == BC_INST_BOOL_OR)
5521 cond = bc_num_cmp(n1, &G.prog.zero) || bc_num_cmp(n2, &G.prog.zero);
5523 cond = bc_num_cmp(n1, n2);
5525 case BC_INST_REL_EQ:
5528 case BC_INST_REL_LE:
5531 case BC_INST_REL_GE:
5534 case BC_INST_REL_LT:
5537 case BC_INST_REL_GT:
5540 default: // = case BC_INST_REL_NE:
5541 //cond = (cond != 0); - not needed
5546 if (cond) bc_num_one(&res.d.n);
5547 //else bc_num_zero(&res.d.n); - already is
5549 bc_program_binOpRetire(&res);
5553 #define zbc_program_logical(...) (zbc_program_logical(__VA_ARGS__) COMMA_SUCCESS)
5556 static BC_STATUS zbc_program_assignStr(BcResult *r, BcVec *v, bool push)
5561 memset(&n2, 0, sizeof(BcNum));
5562 n2.rdx = res.d.id.idx = r->d.id.idx;
5563 res.t = BC_RESULT_STR;
5566 if (!BC_PROG_STACK(&G.prog.results, 2))
5567 RETURN_STATUS(bc_error_stack_has_too_few_elements());
5569 bc_vec_pop(&G.prog.results);
5572 bc_vec_pop(&G.prog.results);
5574 bc_vec_push(&G.prog.results, &res);
5575 bc_vec_push(v, &n2);
5577 RETURN_STATUS(BC_STATUS_SUCCESS);
5579 #define zbc_program_assignStr(...) (zbc_program_assignStr(__VA_ARGS__) COMMA_SUCCESS)
5582 static BC_STATUS zbc_program_copyToVar(char *name, bool var)
5589 if (!BC_PROG_STACK(&G.prog.results, 1))
5590 RETURN_STATUS(bc_error_stack_has_too_few_elements());
5592 ptr = bc_vec_top(&G.prog.results);
5593 if ((ptr->t == BC_RESULT_ARRAY) != !var)
5594 RETURN_STATUS(bc_error_variable_is_wrong_type());
5595 v = bc_program_search(name, var);
5598 if (ptr->t == BC_RESULT_STR && !var)
5599 RETURN_STATUS(bc_error_variable_is_wrong_type());
5600 if (ptr->t == BC_RESULT_STR)
5601 RETURN_STATUS(zbc_program_assignStr(ptr, v, true));
5604 s = zbc_program_num(ptr, &n, false);
5605 if (s) RETURN_STATUS(s);
5607 // Do this once more to make sure that pointers were not invalidated.
5608 v = bc_program_search(name, var);
5611 bc_num_init_DEF_SIZE(&r.d.n);
5612 bc_num_copy(&r.d.n, n);
5614 bc_array_init(&r.d.v, true);
5615 bc_array_copy(&r.d.v, (BcVec *) n);
5618 bc_vec_push(v, &r.d);
5619 bc_vec_pop(&G.prog.results);
5623 #define zbc_program_copyToVar(...) (zbc_program_copyToVar(__VA_ARGS__) COMMA_SUCCESS)
5625 static BC_STATUS zbc_program_assign(char inst)
5628 BcResult *left, *right, res;
5629 BcNum *l = NULL, *r = NULL;
5630 bool assign = inst == BC_INST_ASSIGN, ib, sc;
5632 s = zbc_program_binOpPrep(&left, &l, &right, &r, assign);
5633 if (s) RETURN_STATUS(s);
5635 ib = left->t == BC_RESULT_IBASE;
5636 sc = left->t == BC_RESULT_SCALE;
5639 if (right->t == BC_RESULT_STR) {
5642 if (left->t != BC_RESULT_VAR)
5643 RETURN_STATUS(bc_error_variable_is_wrong_type());
5644 v = bc_program_search(left->d.id.name, true);
5646 RETURN_STATUS(zbc_program_assignStr(right, v, false));
5650 if (left->t == BC_RESULT_CONSTANT || left->t == BC_RESULT_TEMP)
5651 RETURN_STATUS(bc_error("bad assignment:"
5652 " left side must be variable"
5654 )); // note: shared string
5657 if (inst == BC_INST_ASSIGN_DIVIDE && !bc_num_cmp(r, &G.prog.zero))
5658 RETURN_STATUS(bc_error("divide by zero"));
5663 s = BC_STATUS_SUCCESS;
5664 IF_ERROR_RETURN_POSSIBLE(s =) zbc_program_ops[inst - BC_INST_ASSIGN_POWER](l, r, l, G.prog.scale);
5666 if (s) RETURN_STATUS(s);
5671 if (ib || sc || left->t == BC_RESULT_OBASE) {
5672 static const char *const msg[] = {
5673 "bad ibase; must be [2,16]", //BC_RESULT_IBASE
5674 "bad scale; must be [0,"BC_MAX_SCALE_STR"]", //BC_RESULT_SCALE
5675 NULL, //can't happen //BC_RESULT_LAST
5676 NULL, //can't happen //BC_RESULT_CONSTANT
5677 NULL, //can't happen //BC_RESULT_ONE
5678 "bad obase; must be [2,"BC_MAX_OBASE_STR"]", //BC_RESULT_OBASE
5684 s = zbc_num_ulong(l, &val);
5685 if (s) RETURN_STATUS(s);
5686 s = left->t - BC_RESULT_IBASE;
5689 ptr = &G.prog.scale;
5692 RETURN_STATUS(bc_error(msg[s]));
5693 max = ib ? BC_NUM_MAX_IBASE : BC_MAX_OBASE;
5694 ptr = ib ? &G.prog.ib_t : &G.prog.ob_t;
5698 RETURN_STATUS(bc_error(msg[s]));
5700 *ptr = (size_t) val;
5701 s = BC_STATUS_SUCCESS;
5704 bc_num_init(&res.d.n, l->len);
5705 bc_num_copy(&res.d.n, l);
5706 bc_program_binOpRetire(&res);
5710 #define zbc_program_assign(...) (zbc_program_assign(__VA_ARGS__) COMMA_SUCCESS)
5713 #define bc_program_pushVar(code, bgn, pop, copy) \
5714 bc_program_pushVar(code, bgn)
5715 // for bc, 'pop' and 'copy' are always false
5717 static BC_STATUS bc_program_pushVar(char *code, size_t *bgn,
5718 bool pop, bool copy)
5721 char *name = bc_program_name(code, bgn);
5723 r.t = BC_RESULT_VAR;
5728 BcVec *v = bc_program_search(name, true);
5729 BcNum *num = bc_vec_top(v);
5732 if (!BC_PROG_STACK(v, 2 - copy)) {
5733 RETURN_STATUS(bc_error_stack_has_too_few_elements());
5736 if (!BC_PROG_STR(num)) {
5737 r.t = BC_RESULT_TEMP;
5738 bc_num_init_DEF_SIZE(&r.d.n);
5739 bc_num_copy(&r.d.n, num);
5741 r.t = BC_RESULT_STR;
5742 r.d.id.idx = num->rdx;
5745 if (!copy) bc_vec_pop(v);
5749 bc_vec_push(&G.prog.results, &r);
5751 RETURN_STATUS(BC_STATUS_SUCCESS);
5753 #define zbc_program_pushVar(...) (bc_program_pushVar(__VA_ARGS__) COMMA_SUCCESS)
5755 static BC_STATUS zbc_program_pushArray(char *code, size_t *bgn, char inst)
5757 BcStatus s = BC_STATUS_SUCCESS;
5761 r.d.id.name = bc_program_name(code, bgn);
5763 if (inst == BC_INST_ARRAY) {
5764 r.t = BC_RESULT_ARRAY;
5765 bc_vec_push(&G.prog.results, &r);
5770 s = zbc_program_prep(&operand, &num);
5772 s = zbc_num_ulong(num, &temp);
5775 if (temp > BC_MAX_DIM) {
5776 s = bc_error("array too long; must be [1,"BC_MAX_DIM_STR"]");
5780 r.d.id.idx = (size_t) temp;
5781 bc_program_retire(&r, BC_RESULT_ARRAY_ELEM);
5784 if (s) free(r.d.id.name);
5787 #define zbc_program_pushArray(...) (zbc_program_pushArray(__VA_ARGS__) COMMA_SUCCESS)
5790 static BC_STATUS zbc_program_incdec(char inst)
5793 BcResult *ptr, res, copy;
5797 s = zbc_program_prep(&ptr, &num);
5798 if (s) RETURN_STATUS(s);
5800 if (inst == BC_INST_INC_POST || inst == BC_INST_DEC_POST) {
5801 copy.t = BC_RESULT_TEMP;
5802 bc_num_init(©.d.n, num->len);
5803 bc_num_copy(©.d.n, num);
5806 res.t = BC_RESULT_ONE;
5807 inst = inst == BC_INST_INC_PRE || inst == BC_INST_INC_POST ?
5808 BC_INST_ASSIGN_PLUS :
5809 BC_INST_ASSIGN_MINUS;
5811 bc_vec_push(&G.prog.results, &res);
5812 s = zbc_program_assign(inst);
5813 if (s) RETURN_STATUS(s);
5815 if (inst2 == BC_INST_INC_POST || inst2 == BC_INST_DEC_POST) {
5816 bc_vec_pop(&G.prog.results);
5817 bc_vec_push(&G.prog.results, ©);
5822 #define zbc_program_incdec(...) (zbc_program_incdec(__VA_ARGS__) COMMA_SUCCESS)
5824 static BC_STATUS zbc_program_call(char *code, size_t *idx)
5827 size_t i, nparams = bc_program_index(code, idx);
5834 ip.func = bc_program_index(code, idx);
5835 func = bc_program_func(ip.func);
5837 if (func->code.len == 0) {
5838 RETURN_STATUS(bc_error("undefined function"));
5840 if (nparams != func->nparams) {
5841 RETURN_STATUS(bc_error_fmt("function has %u parameters, but called with %u", func->nparams, nparams));
5843 ip.len = G.prog.results.len - nparams;
5845 for (i = 0; i < nparams; ++i) {
5848 a = bc_vec_item(&func->autos, nparams - 1 - i);
5849 arg = bc_vec_top(&G.prog.results);
5851 if ((!a->idx) != (arg->t == BC_RESULT_ARRAY) || arg->t == BC_RESULT_STR)
5852 RETURN_STATUS(bc_error_variable_is_wrong_type());
5854 s = zbc_program_copyToVar(a->name, a->idx);
5855 if (s) RETURN_STATUS(s);
5858 for (; i < func->autos.len; ++i) {
5861 a = bc_vec_item(&func->autos, i);
5862 v = bc_program_search(a->name, a->idx);
5865 bc_num_init_DEF_SIZE(¶m.n);
5866 bc_vec_push(v, ¶m.n);
5868 bc_array_init(¶m.v, true);
5869 bc_vec_push(v, ¶m.v);
5873 bc_vec_push(&G.prog.stack, &ip);
5875 RETURN_STATUS(BC_STATUS_SUCCESS);
5877 #define zbc_program_call(...) (zbc_program_call(__VA_ARGS__) COMMA_SUCCESS)
5879 static BC_STATUS zbc_program_return(char inst)
5884 BcInstPtr *ip = bc_vec_top(&G.prog.stack);
5886 if (!BC_PROG_STACK(&G.prog.results, ip->len + inst == BC_INST_RET))
5887 RETURN_STATUS(bc_error_stack_has_too_few_elements());
5889 f = bc_program_func(ip->func);
5890 res.t = BC_RESULT_TEMP;
5892 if (inst == BC_INST_RET) {
5895 BcResult *operand = bc_vec_top(&G.prog.results);
5897 s = zbc_program_num(operand, &num, false);
5898 if (s) RETURN_STATUS(s);
5899 bc_num_init(&res.d.n, num->len);
5900 bc_num_copy(&res.d.n, num);
5902 bc_num_init_DEF_SIZE(&res.d.n);
5903 //bc_num_zero(&res.d.n); - already is
5906 // We need to pop arguments as well, so this takes that into account.
5907 for (i = 0; i < f->autos.len; ++i) {
5909 BcId *a = bc_vec_item(&f->autos, i);
5911 v = bc_program_search(a->name, a->idx);
5915 bc_vec_npop(&G.prog.results, G.prog.results.len - ip->len);
5916 bc_vec_push(&G.prog.results, &res);
5917 bc_vec_pop(&G.prog.stack);
5919 RETURN_STATUS(BC_STATUS_SUCCESS);
5921 #define zbc_program_return(...) (zbc_program_return(__VA_ARGS__) COMMA_SUCCESS)
5924 static unsigned long bc_program_scale(BcNum *n)
5926 return (unsigned long) n->rdx;
5929 static unsigned long bc_program_len(BcNum *n)
5931 size_t len = n->len;
5933 if (n->rdx != len) return len;
5935 if (len == 0) break;
5937 if (n->num[len] != 0) break;
5942 static BC_STATUS zbc_program_builtin(char inst)
5948 bool len = inst == BC_INST_LENGTH;
5950 if (!BC_PROG_STACK(&G.prog.results, 1))
5951 RETURN_STATUS(bc_error_stack_has_too_few_elements());
5952 opnd = bc_vec_top(&G.prog.results);
5954 s = zbc_program_num(opnd, &num, false);
5955 if (s) RETURN_STATUS(s);
5958 if (!BC_PROG_NUM(opnd, num) && !len)
5959 RETURN_STATUS(bc_error_variable_is_wrong_type());
5962 bc_num_init_DEF_SIZE(&res.d.n);
5964 if (inst == BC_INST_SQRT)
5965 s = zbc_num_sqrt(num, &res.d.n, G.prog.scale);
5967 else if (len != 0 && opnd->t == BC_RESULT_ARRAY) {
5968 bc_num_ulong2num(&res.d.n, (unsigned long) ((BcVec *) num)->len);
5972 else if (len != 0 && !BC_PROG_NUM(opnd, num)) {
5974 size_t idx = opnd->t == BC_RESULT_STR ? opnd->d.id.idx : num->rdx;
5976 str = bc_program_str(idx);
5977 bc_num_ulong2num(&res.d.n, strlen(*str));
5981 bc_num_ulong2num(&res.d.n, len ? bc_program_len(num) : bc_program_scale(num));
5984 bc_program_retire(&res, BC_RESULT_TEMP);
5988 #define zbc_program_builtin(...) (zbc_program_builtin(__VA_ARGS__) COMMA_SUCCESS)
5991 static BC_STATUS zbc_program_divmod(void)
5994 BcResult *opd1, *opd2, res, res2;
5995 BcNum *n1, *n2 = NULL;
5997 s = zbc_program_binOpPrep(&opd1, &n1, &opd2, &n2, false);
5998 if (s) RETURN_STATUS(s);
6000 bc_num_init_DEF_SIZE(&res.d.n);
6001 bc_num_init(&res2.d.n, n2->len);
6003 s = zbc_num_divmod(n1, n2, &res2.d.n, &res.d.n, G.prog.scale);
6006 bc_program_binOpRetire(&res2);
6007 res.t = BC_RESULT_TEMP;
6008 bc_vec_push(&G.prog.results, &res);
6012 bc_num_free(&res2.d.n);
6013 bc_num_free(&res.d.n);
6016 #define zbc_program_divmod(...) (zbc_program_divmod(__VA_ARGS__) COMMA_SUCCESS)
6018 static BC_STATUS zbc_program_modexp(void)
6021 BcResult *r1, *r2, *r3, res;
6022 BcNum *n1, *n2, *n3;
6024 if (!BC_PROG_STACK(&G.prog.results, 3))
6025 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6026 s = zbc_program_binOpPrep(&r2, &n2, &r3, &n3, false);
6027 if (s) RETURN_STATUS(s);
6029 r1 = bc_vec_item_rev(&G.prog.results, 2);
6030 s = zbc_program_num(r1, &n1, false);
6031 if (s) RETURN_STATUS(s);
6032 if (!BC_PROG_NUM(r1, n1))
6033 RETURN_STATUS(bc_error_variable_is_wrong_type());
6035 // Make sure that the values have their pointers updated, if necessary.
6036 if (r1->t == BC_RESULT_VAR || r1->t == BC_RESULT_ARRAY_ELEM) {
6037 if (r1->t == r2->t) {
6038 s = zbc_program_num(r2, &n2, false);
6039 if (s) RETURN_STATUS(s);
6041 if (r1->t == r3->t) {
6042 s = zbc_program_num(r3, &n3, false);
6043 if (s) RETURN_STATUS(s);
6047 bc_num_init(&res.d.n, n3->len);
6048 s = zbc_num_modexp(n1, n2, n3, &res.d.n);
6051 bc_vec_pop(&G.prog.results);
6052 bc_program_binOpRetire(&res);
6056 bc_num_free(&res.d.n);
6059 #define zbc_program_modexp(...) (zbc_program_modexp(__VA_ARGS__) COMMA_SUCCESS)
6061 static void bc_program_stackLen(void)
6064 size_t len = G.prog.results.len;
6066 res.t = BC_RESULT_TEMP;
6068 bc_num_init_DEF_SIZE(&res.d.n);
6069 bc_num_ulong2num(&res.d.n, len);
6070 bc_vec_push(&G.prog.results, &res);
6073 static BC_STATUS zbc_program_asciify(void)
6078 char *str, *str2, c;
6079 size_t len = G.prog.strs.len, idx;
6082 if (!BC_PROG_STACK(&G.prog.results, 1))
6083 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6084 r = bc_vec_top(&G.prog.results);
6086 num = NULL; // TODO: is this NULL needed?
6087 s = zbc_program_num(r, &num, false);
6088 if (s) RETURN_STATUS(s);
6090 if (BC_PROG_NUM(r, num)) {
6093 bc_num_init_DEF_SIZE(&n);
6094 bc_num_copy(&n, num);
6095 bc_num_truncate(&n, n.rdx);
6097 //TODO: have BcNumSmall type, with static buffer
6098 bc_num_init_DEF_SIZE(&strmb);
6099 bc_num_ulong2num(&strmb, 0x100);
6100 s = zbc_num_mod(&n, &strmb, &n, 0);
6101 bc_num_free(&strmb);
6103 if (s) goto num_err;
6104 s = zbc_num_ulong(&n, &val);
6105 if (s) goto num_err;
6111 idx = (r->t == BC_RESULT_STR) ? r->d.id.idx : num->rdx;
6112 str2 = *bc_program_str(idx);
6118 //str[1] = '\0'; - already is
6120 str2 = xstrdup(str);
6121 bc_program_addFunc(str2, &idx);
6123 if (idx != len + BC_PROG_REQ_FUNCS) {
6124 for (idx = 0; idx < G.prog.strs.len; ++idx) {
6125 if (strcmp(*bc_program_str(idx), str) == 0) {
6132 bc_vec_push(&G.prog.strs, &str);
6134 res.t = BC_RESULT_STR;
6136 bc_vec_pop(&G.prog.results);
6137 bc_vec_push(&G.prog.results, &res);
6139 RETURN_STATUS(BC_STATUS_SUCCESS);
6144 #define zbc_program_asciify(...) (zbc_program_asciify(__VA_ARGS__) COMMA_SUCCESS)
6146 static BC_STATUS zbc_program_printStream(void)
6154 if (!BC_PROG_STACK(&G.prog.results, 1))
6155 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6156 r = bc_vec_top(&G.prog.results);
6158 s = zbc_program_num(r, &n, false);
6159 if (s) RETURN_STATUS(s);
6161 if (BC_PROG_NUM(r, n)) {
6162 s = zbc_num_printNum(n, 0x100, 1, bc_num_printChar);
6164 idx = (r->t == BC_RESULT_STR) ? r->d.id.idx : n->rdx;
6165 str = *bc_program_str(idx);
6171 #define zbc_program_printStream(...) (zbc_program_printStream(__VA_ARGS__) COMMA_SUCCESS)
6173 static BC_STATUS zbc_program_nquit(void)
6180 s = zbc_program_prep(&opnd, &num);
6181 if (s) RETURN_STATUS(s);
6182 s = zbc_num_ulong(num, &val);
6183 if (s) RETURN_STATUS(s);
6185 bc_vec_pop(&G.prog.results);
6187 if (G.prog.stack.len < val)
6188 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6189 if (G.prog.stack.len == val) {
6190 QUIT_OR_RETURN_TO_MAIN;
6193 bc_vec_npop(&G.prog.stack, val);
6197 #define zbc_program_nquit(...) (zbc_program_nquit(__VA_ARGS__) COMMA_SUCCESS)
6199 static BC_STATUS zbc_program_execStr(char *code, size_t *bgn, bool cond)
6201 BcStatus s = BC_STATUS_SUCCESS;
6209 if (!BC_PROG_STACK(&G.prog.results, 1))
6210 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6212 r = bc_vec_top(&G.prog.results);
6215 BcNum *n = n; // for compiler
6218 char *then_name = bc_program_name(code, bgn);
6219 char *else_name = NULL;
6221 if (code[*bgn] == BC_PARSE_STREND)
6224 else_name = bc_program_name(code, bgn);
6226 exec = r->d.n.len != 0;
6228 if (!exec && else_name != NULL) {
6235 v = bc_program_search(name, true);
6242 if (!exec) goto exit;
6243 if (!BC_PROG_STR(n)) {
6244 s = bc_error_variable_is_wrong_type();
6250 if (r->t == BC_RESULT_STR) {
6252 } else if (r->t == BC_RESULT_VAR) {
6254 s = zbc_program_num(r, &n, false);
6255 if (s || !BC_PROG_STR(n)) goto exit;
6261 fidx = sidx + BC_PROG_REQ_FUNCS;
6263 str = bc_program_str(sidx);
6264 f = bc_program_func(fidx);
6266 if (f->code.len == 0) {
6267 bc_parse_create(&prs, fidx);
6268 s = zbc_parse_text_init(&prs, *str);
6270 s = zcommon_parse_expr(&prs, BC_PARSE_NOCALL);
6273 if (prs.l.t.t != BC_LEX_EOF) {
6274 s = bc_error_bad_expression();
6278 bc_parse_free(&prs);
6282 ip.len = G.prog.results.len;
6285 bc_vec_pop(&G.prog.results);
6286 bc_vec_push(&G.prog.stack, &ip);
6288 RETURN_STATUS(BC_STATUS_SUCCESS);
6290 bc_parse_free(&prs);
6291 f = bc_program_func(fidx);
6292 bc_vec_pop_all(&f->code);
6294 bc_vec_pop(&G.prog.results);
6297 #define zbc_program_execStr(...) (zbc_program_execStr(__VA_ARGS__) COMMA_SUCCESS)
6300 static void bc_program_pushGlobal(char inst)
6305 res.t = inst - BC_INST_IBASE + BC_RESULT_IBASE;
6306 if (inst == BC_INST_IBASE)
6307 val = (unsigned long) G.prog.ib_t;
6308 else if (inst == BC_INST_SCALE)
6309 val = (unsigned long) G.prog.scale;
6311 val = (unsigned long) G.prog.ob_t;
6313 bc_num_init_DEF_SIZE(&res.d.n);
6314 bc_num_ulong2num(&res.d.n, val);
6315 bc_vec_push(&G.prog.results, &res);
6318 static void bc_program_addFunc(char *name, size_t *idx)
6320 BcId entry, *entry_ptr;
6325 entry.idx = G.prog.fns.len;
6327 inserted = bc_map_insert(&G.prog.fn_map, &entry, idx);
6328 if (!inserted) free(name);
6330 entry_ptr = bc_vec_item(&G.prog.fn_map, *idx);
6331 *idx = entry_ptr->idx;
6334 BcFunc *func = bc_program_func(entry_ptr->idx);
6336 // We need to reset these, so the function can be repopulated.
6338 bc_vec_pop_all(&func->autos);
6339 bc_vec_pop_all(&func->code);
6340 bc_vec_pop_all(&func->labels);
6343 bc_vec_push(&G.prog.fns, &f);
6347 static BC_STATUS zbc_program_exec(void)
6351 BcInstPtr *ip = bc_vec_top(&G.prog.stack);
6352 BcFunc *func = bc_program_func(ip->func);
6353 char *code = func->code.v;
6355 while (ip->idx < func->code.len) {
6356 BcStatus s = BC_STATUS_SUCCESS;
6357 char inst = code[(ip->idx)++];
6359 dbg_exec("inst:%d", inst);
6362 case BC_INST_JUMP_ZERO: {
6364 dbg_exec("BC_INST_JUMP_ZERO:");
6365 s = zbc_program_prep(&ptr, &num);
6366 if (s) RETURN_STATUS(s);
6367 zero = (bc_num_cmp(num, &G.prog.zero) == 0);
6368 bc_vec_pop(&G.prog.results);
6370 bc_program_index(code, &ip->idx);
6373 // else: fall through
6375 case BC_INST_JUMP: {
6376 size_t idx = bc_program_index(code, &ip->idx);
6377 size_t *addr = bc_vec_item(&func->labels, idx);
6378 dbg_exec("BC_INST_JUMP: to %ld", (long)*addr);
6383 dbg_exec("BC_INST_CALL:");
6384 s = zbc_program_call(code, &ip->idx);
6386 case BC_INST_INC_PRE:
6387 case BC_INST_DEC_PRE:
6388 case BC_INST_INC_POST:
6389 case BC_INST_DEC_POST:
6390 dbg_exec("BC_INST_INCDEC:");
6391 s = zbc_program_incdec(inst);
6394 dbg_exec("BC_INST_HALT:");
6395 QUIT_OR_RETURN_TO_MAIN;
6399 dbg_exec("BC_INST_RET[0]:");
6400 s = zbc_program_return(inst);
6402 case BC_INST_BOOL_OR:
6403 case BC_INST_BOOL_AND:
6405 case BC_INST_REL_EQ:
6406 case BC_INST_REL_LE:
6407 case BC_INST_REL_GE:
6408 case BC_INST_REL_NE:
6409 case BC_INST_REL_LT:
6410 case BC_INST_REL_GT:
6411 dbg_exec("BC_INST_BOOL:");
6412 s = zbc_program_logical(inst);
6415 dbg_exec("BC_INST_READ:");
6416 s = zbc_program_read();
6419 dbg_exec("BC_INST_VAR:");
6420 s = zbc_program_pushVar(code, &ip->idx, false, false);
6422 case BC_INST_ARRAY_ELEM:
6424 dbg_exec("BC_INST_ARRAY[_ELEM]:");
6425 s = zbc_program_pushArray(code, &ip->idx, inst);
6428 r.t = BC_RESULT_LAST;
6429 bc_vec_push(&G.prog.results, &r);
6434 bc_program_pushGlobal(inst);
6436 case BC_INST_SCALE_FUNC:
6437 case BC_INST_LENGTH:
6439 dbg_exec("BC_INST_builtin:");
6440 s = zbc_program_builtin(inst);
6443 dbg_exec("BC_INST_NUM:");
6444 r.t = BC_RESULT_CONSTANT;
6445 r.d.id.idx = bc_program_index(code, &ip->idx);
6446 bc_vec_push(&G.prog.results, &r);
6449 dbg_exec("BC_INST_POP:");
6450 if (!BC_PROG_STACK(&G.prog.results, 1))
6451 s = bc_error_stack_has_too_few_elements();
6453 bc_vec_pop(&G.prog.results);
6455 case BC_INST_POP_EXEC:
6456 dbg_exec("BC_INST_POP_EXEC:");
6457 bc_vec_pop(&G.prog.stack);
6460 case BC_INST_PRINT_POP:
6461 case BC_INST_PRINT_STR:
6462 dbg_exec("BC_INST_PRINTxyz:");
6463 s = zbc_program_print(inst, 0);
6466 dbg_exec("BC_INST_STR:");
6467 r.t = BC_RESULT_STR;
6468 r.d.id.idx = bc_program_index(code, &ip->idx);
6469 bc_vec_push(&G.prog.results, &r);
6472 case BC_INST_MULTIPLY:
6473 case BC_INST_DIVIDE:
6474 case BC_INST_MODULUS:
6477 dbg_exec("BC_INST_binaryop:");
6478 s = zbc_program_op(inst);
6480 case BC_INST_BOOL_NOT:
6481 dbg_exec("BC_INST_BOOL_NOT:");
6482 s = zbc_program_prep(&ptr, &num);
6483 if (s) RETURN_STATUS(s);
6484 bc_num_init_DEF_SIZE(&r.d.n);
6485 if (!bc_num_cmp(num, &G.prog.zero))
6487 //else bc_num_zero(&r.d.n); - already is
6488 bc_program_retire(&r, BC_RESULT_TEMP);
6491 dbg_exec("BC_INST_NEG:");
6492 s = zbc_program_negate();
6495 case BC_INST_ASSIGN_POWER:
6496 case BC_INST_ASSIGN_MULTIPLY:
6497 case BC_INST_ASSIGN_DIVIDE:
6498 case BC_INST_ASSIGN_MODULUS:
6499 case BC_INST_ASSIGN_PLUS:
6500 case BC_INST_ASSIGN_MINUS:
6502 case BC_INST_ASSIGN:
6503 dbg_exec("BC_INST_ASSIGNxyz:");
6504 s = zbc_program_assign(inst);
6507 case BC_INST_MODEXP:
6508 s = zbc_program_modexp();
6510 case BC_INST_DIVMOD:
6511 s = zbc_program_divmod();
6513 case BC_INST_EXECUTE:
6514 case BC_INST_EXEC_COND:
6515 s = zbc_program_execStr(code, &ip->idx, inst == BC_INST_EXEC_COND);
6517 case BC_INST_PRINT_STACK: {
6519 for (idx = 0; idx < G.prog.results.len; ++idx) {
6520 s = zbc_program_print(BC_INST_PRINT, idx);
6525 case BC_INST_CLEAR_STACK:
6526 bc_vec_pop_all(&G.prog.results);
6528 case BC_INST_STACK_LEN:
6529 bc_program_stackLen();
6531 case BC_INST_DUPLICATE:
6532 if (!BC_PROG_STACK(&G.prog.results, 1))
6533 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6534 ptr = bc_vec_top(&G.prog.results);
6535 bc_result_copy(&r, ptr);
6536 bc_vec_push(&G.prog.results, &r);
6538 case BC_INST_SWAP: {
6540 if (!BC_PROG_STACK(&G.prog.results, 2))
6541 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6542 ptr = bc_vec_item_rev(&G.prog.results, 0);
6543 ptr2 = bc_vec_item_rev(&G.prog.results, 1);
6544 memcpy(&r, ptr, sizeof(BcResult));
6545 memcpy(ptr, ptr2, sizeof(BcResult));
6546 memcpy(ptr2, &r, sizeof(BcResult));
6549 case BC_INST_ASCIIFY:
6550 s = zbc_program_asciify();
6552 case BC_INST_PRINT_STREAM:
6553 s = zbc_program_printStream();
6556 case BC_INST_PUSH_VAR: {
6557 bool copy = inst == BC_INST_LOAD;
6558 s = zbc_program_pushVar(code, &ip->idx, true, copy);
6561 case BC_INST_PUSH_TO_VAR: {
6562 char *name = bc_program_name(code, &ip->idx);
6563 s = zbc_program_copyToVar(name, true);
6568 dbg_exec("BC_INST_NEG:");
6569 if (G.prog.stack.len <= 2)
6570 QUIT_OR_RETURN_TO_MAIN;
6571 bc_vec_npop(&G.prog.stack, 2);
6574 s = zbc_program_nquit();
6579 if (s || G_interrupt) {
6586 // If the stack has changed, pointers may be invalid.
6587 ip = bc_vec_top(&G.prog.stack);
6588 func = bc_program_func(ip->func);
6589 code = func->code.v;
6592 RETURN_STATUS(BC_STATUS_SUCCESS);
6594 #define zbc_program_exec(...) (zbc_program_exec(__VA_ARGS__) COMMA_SUCCESS)
6596 static unsigned bc_vm_envLen(const char *var)
6602 len = BC_NUM_PRINT_WIDTH;
6603 if (!lenv) return len;
6605 len = bb_strtou(lenv, NULL, 10) - 1;
6606 if (errno || len < 2 || len >= INT_MAX)
6607 len = BC_NUM_PRINT_WIDTH;
6612 static BC_STATUS zbc_vm_process(const char *text)
6616 dbg_lex_enter("%s:%d entered", __func__, __LINE__);
6617 s = zbc_parse_text_init(&G.prs, text);
6618 if (s) RETURN_STATUS(s);
6620 while (G.prs.l.t.t != BC_LEX_EOF) {
6621 dbg_lex("%s:%d G.prs.l.t.t:%d", __func__, __LINE__, G.prs.l.t.t);
6622 s = zcommon_parse(&G.prs);
6623 if (s) RETURN_STATUS(s);
6624 s = zbc_program_exec();
6631 dbg_lex_done("%s:%d done", __func__, __LINE__);
6634 #define zbc_vm_process(...) (zbc_vm_process(__VA_ARGS__) COMMA_SUCCESS)
6636 static BC_STATUS zbc_vm_execute_FILE(FILE *fp, const char *filename)
6638 // So far bc/dc have no way to include a file from another file,
6639 // therefore we know G.prog.file == NULL on entry
6640 //const char *sv_file;
6643 G.prog.file = filename;
6645 bc_lex_file(&G.prs.l);
6648 s = zbc_vm_process("");
6649 // We do not stop looping on errors here if reading stdin.
6650 // Example: start interactive bc and enter "return".
6651 // It should say "'return' not in a function"
6652 // but should not exit.
6653 } while (G.input_fp == stdin);
6657 #define zbc_vm_execute_FILE(...) (zbc_vm_execute_FILE(__VA_ARGS__) COMMA_SUCCESS)
6659 static BC_STATUS zbc_vm_file(const char *file)
6664 fp = xfopen_for_read(file);
6665 s = zbc_vm_execute_FILE(fp, file);
6670 #define zbc_vm_file(...) (zbc_vm_file(__VA_ARGS__) COMMA_SUCCESS)
6673 static void bc_vm_info(void)
6675 printf("%s "BB_VER"\n"
6676 "Copyright (c) 2018 Gavin D. Howard and contributors\n"
6680 static void bc_args(char **argv)
6686 #if ENABLE_FEATURE_BC_LONG_OPTIONS
6687 opts = option_mask32 |= getopt32long(argv, "wvsqli",
6688 "warn\0" No_argument "w"
6689 "version\0" No_argument "v"
6690 "standard\0" No_argument "s"
6691 "quiet\0" No_argument "q"
6692 "mathlib\0" No_argument "l"
6693 "interactive\0" No_argument "i"
6696 opts = option_mask32 |= getopt32(argv, "wvsqli");
6698 if (getenv("POSIXLY_CORRECT"))
6699 option_mask32 |= BC_FLAG_S;
6701 if (opts & BC_FLAG_V) {
6706 for (i = optind; argv[i]; ++i)
6707 bc_vec_push(&G.files, argv + i);
6710 static void bc_vm_envArgs(void)
6714 char *env_args = getenv("BC_ENV_ARGS");
6716 if (!env_args) return;
6718 G.env_args = xstrdup(env_args);
6721 bc_vec_init(&v, sizeof(char *), NULL);
6723 while (*(buf = skip_whitespace(buf)) != '\0') {
6724 bc_vec_push(&v, &buf);
6725 buf = skip_non_whitespace(buf);
6731 // NULL terminate, and pass argv[] so that first arg is argv[1]
6732 if (sizeof(int) == sizeof(char*)) {
6733 bc_vec_push(&v, &const_int_0);
6735 static char *const nullptr = NULL;
6736 bc_vec_push(&v, &nullptr);
6738 bc_args(((char **)v.v) - 1);
6743 static const char bc_lib[] ALIGN1 = {
6746 "\n" "auto b,s,n,r,d,i,p,f,v"
6747 ////////////////"if(x<0)return(1/e(-x))" // and drop 'n' and x<0 logic below
6748 //^^^^^^^^^^^^^^^^ this would work, and is even more precise than GNU bc:
6749 //e(-.998896): GNU:.36828580434569428695
6750 // above code:.36828580434569428696
6751 // actual value:.3682858043456942869594...
6752 // but for now let's be "GNU compatible"
6761 "\n" "scale=scale(x)+1"
6771 "\n" "for(i=2;v;++i){"
6777 "\n" "while(d--)r*=r"
6780 "\n" "if(n)return(1/r)"
6784 "\n" "auto b,s,r,p,a,q,i,v"
6788 "\n" "r=(1-10^scale)/1"
6799 "\n" "while(x<=.5){"
6803 "\n" "r=a=(x-1)/(x+1)"
6806 "\n" "for(i=3;v;i+=2){"
6817 "\n" "auto b,s,r,a,q,i"
6818 "\n" "if(x<0)return(-s(-x))"
6822 "\n" "scale=1.1*s+2"
6831 "\n" "for(i=3;a;i+=2){"
6832 "\n" "a*=q/(i*(i-1))"
6845 "\n" "x=s(2*a(1)+x)"
6851 "\n" "auto b,s,r,n,a,m,t,f,i,u"
6859 "\n" "if(scale<65){"
6860 "\n" "if(x==1)return(.7853981633974483096156608458198757210492923498437764552437361480/n)"
6861 "\n" "if(x==.2)return(.1973955598498807583700497651947902934475851037878521015176889402/n)"
6871 "\n" "x=(x-.2)/(1+.2*x)"
6876 "\n" "for(i=3;t;i+=2){"
6883 "\n" "return((m*a+r)/n)"
6885 "\n" "define j(n,x){"
6886 "\n" "auto b,s,o,a,i,v,f"
6897 "\n" "for(i=2;i<=n;++i)a*=i"
6899 "\n" "a=(x^n)/2^n/a"
6902 "\n" "scale+=length(a)-scale(a)"
6903 "\n" "for(i=1;v;++i){"
6904 "\n" "v=v*f/i/(n+i)"
6910 "\n" "return(a*r/1)"
6915 static BC_STATUS zbc_vm_exec(void)
6921 if (option_mask32 & BC_FLAG_L) {
6922 // We know that internal library is not buggy,
6923 // thus error checking is normally disabled.
6924 # define DEBUG_LIB 0
6925 bc_lex_file(&G.prs.l);
6926 s = zbc_vm_process(bc_lib);
6927 if (DEBUG_LIB && s) RETURN_STATUS(s);
6931 s = BC_STATUS_SUCCESS;
6932 for (i = 0; !s && i < G.files.len; ++i)
6933 s = zbc_vm_file(*((char **) bc_vec_item(&G.files, i)));
6934 if (ENABLE_FEATURE_CLEAN_UP && s && !G_ttyin) {
6935 // Debug config, non-interactive mode:
6936 // return all the way back to main.
6937 // Non-debug builds do not come here, they exit.
6941 if (IS_BC || (option_mask32 & BC_FLAG_I))
6942 s = zbc_vm_execute_FILE(stdin, /*filename:*/ NULL);
6946 #define zbc_vm_exec(...) (zbc_vm_exec(__VA_ARGS__) COMMA_SUCCESS)
6948 #if ENABLE_FEATURE_CLEAN_UP
6949 static void bc_program_free(void)
6951 bc_vec_free(&G.prog.fns);
6952 bc_vec_free(&G.prog.fn_map);
6953 bc_vec_free(&G.prog.vars);
6954 bc_vec_free(&G.prog.var_map);
6955 bc_vec_free(&G.prog.arrs);
6956 bc_vec_free(&G.prog.arr_map);
6957 bc_vec_free(&G.prog.strs);
6958 bc_vec_free(&G.prog.consts);
6959 bc_vec_free(&G.prog.results);
6960 bc_vec_free(&G.prog.stack);
6961 bc_num_free(&G.prog.last);
6962 bc_num_free(&G.prog.zero);
6963 bc_num_free(&G.prog.one);
6964 bc_vec_free(&G.input_buffer);
6967 static void bc_vm_free(void)
6969 bc_vec_free(&G.files);
6971 bc_parse_free(&G.prs);
6976 static void bc_program_init(void)
6981 // memset(&G.prog, 0, sizeof(G.prog)); - already is
6982 memset(&ip, 0, sizeof(BcInstPtr));
6984 // G.prog.nchars = G.prog.scale = 0; - already is
6988 bc_num_init_DEF_SIZE(&G.prog.last);
6989 //bc_num_zero(&G.prog.last); - already is
6991 bc_num_init_DEF_SIZE(&G.prog.zero);
6992 //bc_num_zero(&G.prog.zero); - already is
6994 bc_num_init_DEF_SIZE(&G.prog.one);
6995 bc_num_one(&G.prog.one);
6997 bc_vec_init(&G.prog.fns, sizeof(BcFunc), bc_func_free);
6998 bc_vec_init(&G.prog.fn_map, sizeof(BcId), bc_id_free);
7000 bc_program_addFunc(xstrdup("(main)"), &idx);
7001 bc_program_addFunc(xstrdup("(read)"), &idx);
7003 bc_vec_init(&G.prog.vars, sizeof(BcVec), bc_vec_free);
7004 bc_vec_init(&G.prog.var_map, sizeof(BcId), bc_id_free);
7006 bc_vec_init(&G.prog.arrs, sizeof(BcVec), bc_vec_free);
7007 bc_vec_init(&G.prog.arr_map, sizeof(BcId), bc_id_free);
7009 bc_vec_init(&G.prog.strs, sizeof(char *), bc_string_free);
7010 bc_vec_init(&G.prog.consts, sizeof(char *), bc_string_free);
7011 bc_vec_init(&G.prog.results, sizeof(BcResult), bc_result_free);
7012 bc_vec_init(&G.prog.stack, sizeof(BcInstPtr), NULL);
7013 bc_vec_push(&G.prog.stack, &ip);
7015 bc_char_vec_init(&G.input_buffer);
7018 static int bc_vm_init(const char *env_len)
7020 #if ENABLE_FEATURE_EDITING
7021 G.line_input_state = new_line_input_t(DO_HISTORY);
7023 G.prog.len = bc_vm_envLen(env_len);
7025 bc_vec_init(&G.files, sizeof(char *), NULL);
7026 IF_BC(if (IS_BC) bc_vm_envArgs();)
7028 bc_parse_create(&G.prs, BC_PROG_MAIN);
7030 //TODO: in GNU bc, the check is (isatty(0) && isatty(1)),
7031 //-i option unconditionally enables this regardless of isatty():
7033 #if ENABLE_FEATURE_BC_SIGNALS
7035 // With SA_RESTART, most system calls will restart
7036 // (IOW: they won't fail with EINTR).
7037 // In particular, this means ^C won't cause
7038 // stdout to get into "error state" if SIGINT hits
7039 // within write() syscall.
7041 // The downside is that ^C while tty input is taken
7042 // will only be handled after [Enter] since read()
7043 // from stdin is not interrupted by ^C either,
7044 // it restarts, thus fgetc() does not return on ^C.
7045 // (This problem manifests only if line editing is disabled)
7046 signal_SA_RESTART_empty_mask(SIGINT, record_signo);
7048 // Without SA_RESTART, this exhibits a bug:
7049 // "while (1) print 1" and try ^C-ing it.
7050 // Intermittently, instead of returning to input line,
7051 // you'll get "output error: Interrupted system call"
7053 //signal_no_SA_RESTART_empty_mask(SIGINT, record_signo);
7057 return 0; // "not a tty"
7060 static BcStatus bc_vm_run(void)
7062 BcStatus st = zbc_vm_exec();
7063 #if ENABLE_FEATURE_CLEAN_UP
7064 if (G_exiting) // it was actually "halt" or "quit"
7067 # if ENABLE_FEATURE_EDITING
7068 free_line_input_t(G.line_input_state);
7072 dbg_exec("exiting with exitcode %d", st);
7077 int bc_main(int argc, char **argv) MAIN_EXTERNALLY_VISIBLE;
7078 int bc_main(int argc UNUSED_PARAM, char **argv)
7084 is_tty = bc_vm_init("BC_LINE_LENGTH");
7088 if (is_tty && !(option_mask32 & BC_FLAG_Q))
7096 int dc_main(int argc, char **argv) MAIN_EXTERNALLY_VISIBLE;
7097 int dc_main(int argc UNUSED_PARAM, char **argv)
7103 // TODO: dc (GNU bc 1.07.1) 1.4.1 seems to use width
7104 // 1 char wider than bc from the same package.
7105 // Both default width, and xC_LINE_LENGTH=N are wider:
7106 // "DC_LINE_LENGTH=5 dc -e'123456 p'" prints:
7109 // "echo '123456' | BC_LINE_LENGTH=5 bc" prints:
7112 // Do the same, or it's a bug?
7113 bc_vm_init("DC_LINE_LENGTH");
7115 // Run -e'SCRIPT' and -fFILE in order of appearance, then handle FILEs
7116 noscript = BC_FLAG_I;
7118 int n = getopt(argc, argv, "e:f:x");
7124 n = zbc_vm_process(optarg);
7129 n = zbc_vm_file(optarg);
7133 option_mask32 |= DC_FLAG_X;
7143 bc_vec_push(&G.files, argv++);
7146 option_mask32 |= noscript; // set BC_FLAG_I if we need to interpret stdin
7152 #endif // not DC_SMALL