1 /* vi: set sw=4 ts=4: */
3 * Licensed under GPLv2 or later, see file LICENSE in this source tree.
4 * Copyright (c) 2018 Gavin D. Howard and contributors.
7 //config: bool "bc (45 kb; 49 kb when combined with dc)"
10 //config: bc is a command-line, arbitrary-precision calculator with a
11 //config: Turing-complete language. See the GNU bc manual
12 //config: (https://www.gnu.org/software/bc/manual/bc.html) and bc spec
13 //config: (http://pubs.opengroup.org/onlinepubs/9699919799/utilities/bc.html).
15 //config: This bc has five differences to the GNU bc:
16 //config: 1) The period (.) is a shortcut for "last", as in the BSD bc.
17 //config: 2) Arrays are copied before being passed as arguments to
18 //config: functions. This behavior is required by the bc spec.
19 //config: 3) Arrays can be passed to the builtin "length" function to get
20 //config: the number of elements in the array. This prints "1":
21 //config: a[0] = 0; length(a[])
22 //config: 4) The precedence of the boolean "not" operator (!) is equal to
23 //config: that of the unary minus (-) negation operator. This still
24 //config: allows POSIX-compliant scripts to work while somewhat
25 //config: preserving expected behavior (versus C) and making parsing
27 //config: 5) "read()" accepts expressions, not only numeric literals.
30 //config: -i --interactive force interactive mode
31 //config: -q --quiet don't print version and copyright
32 //config: -s --standard error if any non-POSIX extensions are used
33 //config: -w --warn warn if any non-POSIX extensions are used
34 //config: -l --mathlib use predefined math routines:
35 //config: s(expr) sine in radians
36 //config: c(expr) cosine in radians
37 //config: a(expr) arctangent, returning radians
38 //config: l(expr) natural log
39 //config: e(expr) raises e to the power of expr
40 //config: j(n, x) Bessel function of integer order n of x
43 //config: bool "dc (38 kb; 49 kb when combined with bc)"
46 //config: dc is a reverse-polish notation command-line calculator which
47 //config: supports unlimited precision arithmetic. See the FreeBSD man page
48 //config: (https://www.unix.com/man-page/FreeBSD/1/dc/) and GNU dc manual
49 //config: (https://www.gnu.org/software/bc/manual/dc-1.05/html_mono/dc.html).
51 //config: This dc has a few differences from the two above:
52 //config: 1) When printing a byte stream (command "P"), this dc follows what
53 //config: the FreeBSD dc does.
54 //config: 2) Implements the GNU extensions for divmod ("~") and
55 //config: modular exponentiation ("|").
56 //config: 3) Implements all FreeBSD extensions, except for "J" and "M".
57 //config: 4) Like the FreeBSD dc, this dc supports extended registers.
58 //config: However, they are implemented differently. When it encounters
59 //config: whitespace where a register should be, it skips the whitespace.
60 //config: If the character following is not a lowercase letter, an error
61 //config: is issued. Otherwise, the register name is parsed by the
62 //config: following regex:
63 //config: [a-z][a-z0-9_]*
64 //config: This generally means that register names will be surrounded by
65 //config: whitespace. Examples:
66 //config: l idx s temp L index S temp2 < do_thing
67 //config: Also note that, like the FreeBSD dc, extended registers are not
68 //config: allowed unless the "-x" option is given.
70 //config:config FEATURE_DC_SMALL
71 //config: bool "Minimal dc implementation (4.2 kb), not using bc code base"
72 //config: depends on DC && !BC
75 //config:config FEATURE_DC_LIBM
76 //config: bool "Enable power and exp functions (requires libm)"
78 //config: depends on FEATURE_DC_SMALL
80 //config: Enable power and exp functions.
81 //config: NOTE: This will require libm to be present for linking.
83 //config:config FEATURE_BC_SIGNALS
84 //config: bool "Interactive mode (+4kb)"
86 //config: depends on (BC || DC) && !FEATURE_DC_SMALL
88 //config: Enable interactive mode: when started on a tty,
89 //config: ^C interrupts execution and returns to command line,
90 //config: errors also return to command line instead of exiting,
91 //config: line editing with history is available.
93 //config: With this option off, input can still be taken from tty,
94 //config: but all errors are fatal, ^C is fatal,
95 //config: tty is treated exactly the same as any other
96 //config: standard input (IOW: no line editing).
98 //config:config FEATURE_BC_LONG_OPTIONS
99 //config: bool "Enable bc/dc long options"
101 //config: depends on (BC || DC) && !FEATURE_DC_SMALL
103 //config: Enable long options for bc and dc.
105 //applet:IF_BC(APPLET(bc, BB_DIR_USR_BIN, BB_SUID_DROP))
106 //applet:IF_DC(APPLET(dc, BB_DIR_USR_BIN, BB_SUID_DROP))
108 //kbuild:lib-$(CONFIG_BC) += bc.o
109 //kbuild:lib-$(CONFIG_DC) += bc.o
111 //See www.gnu.org/software/bc/manual/bc.html
112 //usage:#define bc_trivial_usage
113 //usage: "[-sqliw] FILE..."
115 //usage:#define bc_full_usage "\n"
116 //usage: "\nArbitrary precision calculator"
118 ///////: "\n -i Interactive" - has no effect for now
119 //usage: "\n -q Quiet"
120 //usage: "\n -l Load standard math library"
121 //usage: "\n -s Be POSIX compatible"
122 //usage: "\n -w Warn if extensions are used"
123 ///////: "\n -v Version"
125 //usage: "\n$BC_LINE_LENGTH changes output width"
127 //usage:#define bc_example_usage
128 //usage: "3 + 4.129\n"
129 //usage: "1903 - 2893\n"
130 //usage: "-129 * 213.28935\n"
131 //usage: "12 / -1932\n"
133 //usage: "34 ^ 189\n"
134 //usage: "scale = 13\n"
135 //usage: "ibase = 2\n"
136 //usage: "obase = A\n"
138 //usage:#define dc_trivial_usage
139 //usage: IF_NOT_FEATURE_DC_SMALL("[-x] ")"[-eSCRIPT]... [-fFILE]... [FILE]..."
141 //usage:#define dc_full_usage "\n"
142 //usage: "\nTiny RPN calculator. Operations:"
143 //usage: "\n+, -, *, /, %, ~, ^," IF_NOT_FEATURE_DC_SMALL(" |,")
144 //usage: "\np - print top of the stack (without popping)"
145 //usage: "\nf - print entire stack"
146 //usage: "\nk - pop the value and set the precision"
147 //usage: "\ni - pop the value and set input radix"
148 //usage: "\no - pop the value and set output radix"
149 //usage: "\nExamples: dc -e'2 2 + p' -> 4, dc -e'8 8 * 2 2 + / p' -> 16"
151 //usage:#define dc_example_usage
152 //usage: "$ dc -e'2 2 + p'\n"
154 //usage: "$ dc -e'8 8 \\* 2 2 + / p'\n"
156 //usage: "$ dc -e'0 1 & p'\n"
158 //usage: "$ dc -e'0 1 | p'\n"
160 //usage: "$ echo '72 9 / 8 * p' | dc\n"
164 #include "common_bufsiz.h"
166 #if ENABLE_FEATURE_DC_SMALL
170 #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 {
268 BC_INST_ASSIGN_POWER,
269 BC_INST_ASSIGN_MULTIPLY,
270 BC_INST_ASSIGN_DIVIDE,
271 BC_INST_ASSIGN_MODULUS,
273 BC_INST_ASSIGN_MINUS,
319 BC_INST_PRINT_STREAM,
334 BC_INST_INVALID = -1,
339 typedef struct BcId {
344 typedef struct BcFunc {
351 typedef enum BcResultType {
356 BC_RESULT_ARRAY_ELEM,
365 // These are between to calculate ibase, obase, and last from instructions.
373 typedef union BcResultData {
379 typedef struct BcResult {
384 typedef struct BcInstPtr {
390 // BC_LEX_NEG is not used in lexing; it is only for parsing.
391 typedef enum BcLexType {
418 BC_LEX_OP_ASSIGN_POWER,
419 BC_LEX_OP_ASSIGN_MULTIPLY,
420 BC_LEX_OP_ASSIGN_DIVIDE,
421 BC_LEX_OP_ASSIGN_MODULUS,
422 BC_LEX_OP_ASSIGN_PLUS,
423 BC_LEX_OP_ASSIGN_MINUS,
436 BC_LEX_LBRACE, // '{' is 0x7B, '}' is 0x7D,
438 BC_LEX_RBRACE, // should be LBRACE+2: code uses (c - '{' + BC_LEX_LBRACE)
444 BC_LEX_KEY_1st_keyword,
445 BC_LEX_KEY_AUTO = BC_LEX_KEY_1st_keyword,
452 // code uses "type - BC_LEX_KEY_IBASE + BC_INST_IBASE" construct,
453 BC_LEX_KEY_IBASE, // relative order should match for: BC_INST_IBASE
455 BC_LEX_KEY_LAST, // relative order should match for: BC_INST_LAST
458 BC_LEX_KEY_OBASE, // relative order should match for: BC_INST_OBASE
496 // must match order of BC_LEX_KEY_foo etc above
498 struct BcLexKeyword {
501 #define BC_LEX_KW_ENTRY(a, b) \
502 { .name8 = a /*, .posix = b */ }
503 static const struct BcLexKeyword bc_lex_kws[20] = {
504 BC_LEX_KW_ENTRY("auto" , 1), // 0
505 BC_LEX_KW_ENTRY("break" , 1), // 1
506 BC_LEX_KW_ENTRY("continue", 0), // 2 note: this one has no terminating NUL
507 BC_LEX_KW_ENTRY("define" , 1), // 3
508 BC_LEX_KW_ENTRY("else" , 0), // 4
509 BC_LEX_KW_ENTRY("for" , 1), // 5
510 BC_LEX_KW_ENTRY("halt" , 0), // 6
511 BC_LEX_KW_ENTRY("ibase" , 1), // 7
512 BC_LEX_KW_ENTRY("if" , 1), // 8
513 BC_LEX_KW_ENTRY("last" , 0), // 9
514 BC_LEX_KW_ENTRY("length" , 1), // 10
515 BC_LEX_KW_ENTRY("limits" , 0), // 11
516 BC_LEX_KW_ENTRY("obase" , 1), // 12
517 BC_LEX_KW_ENTRY("print" , 0), // 13
518 BC_LEX_KW_ENTRY("quit" , 1), // 14
519 BC_LEX_KW_ENTRY("read" , 0), // 15
520 BC_LEX_KW_ENTRY("return" , 1), // 16
521 BC_LEX_KW_ENTRY("scale" , 1), // 17
522 BC_LEX_KW_ENTRY("sqrt" , 1), // 18
523 BC_LEX_KW_ENTRY("while" , 1), // 19
525 #undef BC_LEX_KW_ENTRY
526 #define STRING_if (bc_lex_kws[8].name8)
527 #define STRING_else (bc_lex_kws[4].name8)
528 #define STRING_while (bc_lex_kws[19].name8)
529 #define STRING_for (bc_lex_kws[5].name8)
553 #define bc_lex_kws_POSIX(i) ((1 << (i)) & POSIX_KWORD_MASK)
555 // This is a bit array that corresponds to token types. An entry is
556 // true if the token is valid in an expression, false otherwise.
557 // Used to figure out when expr parsing should stop *without error message*
558 // - 0 element indicates this condition. 1 means "this token is to be eaten
559 // as part of the expression", token can them still be determined to be invalid
560 // by later processing.
562 #define EXBITS(a,b,c,d,e,f,g,h) \
563 ((uint64_t)((a << 0)+(b << 1)+(c << 2)+(d << 3)+(e << 4)+(f << 5)+(g << 6)+(h << 7)))
564 BC_PARSE_EXPRS_BITS = 0
565 + (EXBITS(0,0,1,1,1,1,1,1) << (0*8)) // 0: eof inval ++ -- - ^ * /
566 + (EXBITS(1,1,1,1,1,1,1,1) << (1*8)) // 8: % + - == <= >= != <
567 + (EXBITS(1,1,1,1,1,1,1,1) << (2*8)) // 16: > ! || && ^= *= /= %=
568 + (EXBITS(1,1,1,0,0,1,1,0) << (3*8)) // 24: += -= = NL WS ( ) [
569 + (EXBITS(0,0,0,0,0,0,1,1) << (4*8)) // 32: , ] { ; } STR NAME NUM
570 + (EXBITS(0,0,0,0,0,0,0,1) << (5*8)) // 40: auto break cont define else for halt ibase
571 + (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?
572 + (EXBITS(0,1,1,0,0,0,0,0) << (7*8)) // 56: return scale sqrt while
575 static ALWAYS_INLINE long bc_parse_exprs(unsigned i)
577 #if ULONG_MAX > 0xffffffff
578 // 64-bit version (will not work correctly for 32-bit longs!)
579 return BC_PARSE_EXPRS_BITS & (1UL << i);
582 unsigned long m = (uint32_t)BC_PARSE_EXPRS_BITS;
584 m = (uint32_t)(BC_PARSE_EXPRS_BITS >> 32);
587 return m & (1UL << i);
591 // This is an array of data for operators that correspond to
592 // [BC_LEX_OP_INC...BC_LEX_OP_ASSIGN] token types.
593 static const uint8_t bc_parse_ops[] = {
594 #define OP(p,l) ((int)(l) * 0x10 + (p))
595 OP(0, false), OP( 0, false ), // inc dec
598 OP(3, true ), OP( 3, true ), OP( 3, true ), // mul div mod
599 OP(4, true ), OP( 4, true ), // + -
600 OP(6, true ), OP( 6, true ), OP( 6, true ), OP( 6, true ), OP( 6, true ), OP( 6, true ), // == <= >= != < >
602 OP(7, true ), OP( 7, true ), // or and
603 OP(5, false), OP( 5, false ), OP( 5, false ), OP( 5, false ), OP( 5, false ), // ^= *= /= %= +=
604 OP(5, false), OP( 5, false ), // -= =
607 #define bc_parse_op_PREC(i) (bc_parse_ops[i] & 0x0f)
608 #define bc_parse_op_LEFT(i) (bc_parse_ops[i] & 0x10)
612 static const //BcInst - should be this type. Using signed narrow type since BC_INST_INVALID is -1
615 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID, BC_INST_REL_GE,
616 BC_INST_INVALID, BC_INST_POWER, BC_INST_MULTIPLY, BC_INST_DIVIDE,
617 BC_INST_MODULUS, BC_INST_PLUS, BC_INST_MINUS,
618 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID,
619 BC_INST_INVALID, BC_INST_INVALID,
620 BC_INST_BOOL_NOT, BC_INST_INVALID, BC_INST_INVALID,
621 BC_INST_INVALID, BC_INST_INVALID, 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_REL_GT, BC_INST_INVALID,
624 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID, BC_INST_REL_GE,
625 BC_INST_INVALID, BC_INST_INVALID,
626 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID,
627 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID,
628 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID, BC_INST_IBASE,
629 BC_INST_INVALID, BC_INST_INVALID, BC_INST_LENGTH, BC_INST_INVALID,
630 BC_INST_OBASE, BC_INST_PRINT, BC_INST_QUIT, BC_INST_INVALID,
631 BC_INST_INVALID, BC_INST_SCALE, BC_INST_SQRT, BC_INST_INVALID,
632 BC_INST_REL_EQ, BC_INST_MODEXP, BC_INST_DIVMOD, BC_INST_INVALID,
633 BC_INST_INVALID, BC_INST_EXECUTE, BC_INST_PRINT_STACK, BC_INST_CLEAR_STACK,
634 BC_INST_STACK_LEN, BC_INST_DUPLICATE, BC_INST_SWAP, BC_INST_POP,
635 BC_INST_ASCIIFY, BC_INST_PRINT_STREAM, BC_INST_INVALID, BC_INST_INVALID,
636 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID,
637 BC_INST_PRINT, BC_INST_NQUIT, BC_INST_SCALE_FUNC,
642 typedef struct BcLex {
655 #define BC_PARSE_STREND ((char) UCHAR_MAX)
657 #define BC_PARSE_REL (1 << 0)
658 #define BC_PARSE_PRINT (1 << 1)
659 #define BC_PARSE_NOCALL (1 << 2)
660 #define BC_PARSE_NOREAD (1 << 3)
661 #define BC_PARSE_ARRAY (1 << 4)
663 typedef struct BcParse {
677 typedef struct BcProgram {
715 #define BC_PROG_STACK(s, n) ((s)->len >= ((size_t) n))
717 #define BC_PROG_MAIN (0)
718 #define BC_PROG_READ (1)
720 #define BC_PROG_REQ_FUNCS (2)
723 #define BC_PROG_STR(n) (!(n)->num && !(n)->cap)
724 #define BC_PROG_NUM(r, n) \
725 ((r)->t != BC_RESULT_ARRAY && (r)->t != BC_RESULT_STR && !BC_PROG_STR(n))
727 #define BC_FLAG_W (1 << 0)
728 #define BC_FLAG_V (1 << 1)
729 #define BC_FLAG_S (1 << 2)
730 #define BC_FLAG_Q (1 << 3)
731 #define BC_FLAG_L (1 << 4)
732 #define BC_FLAG_I (1 << 5)
733 #define DC_FLAG_X (1 << 6)
735 #define BC_MAX(a, b) ((a) > (b) ? (a) : (b))
736 #define BC_MIN(a, b) ((a) < (b) ? (a) : (b))
738 #define BC_MAX_OBASE ((unsigned) 999)
739 #define BC_MAX_DIM ((unsigned) INT_MAX)
740 #define BC_MAX_SCALE ((unsigned) UINT_MAX)
741 #define BC_MAX_STRING ((unsigned) UINT_MAX - 1)
742 #define BC_MAX_NUM BC_MAX_STRING
743 // Unused apart from "limits" message. Just show a "biggish number" there.
744 //#define BC_MAX_NAME BC_MAX_STRING
745 //#define BC_MAX_EXP ((unsigned long) LONG_MAX)
746 //#define BC_MAX_VARS ((unsigned long) SIZE_MAX - 1)
747 #define BC_MAX_NAME_STR "999999999"
748 #define BC_MAX_EXP_STR "999999999"
749 #define BC_MAX_VARS_STR "999999999"
751 #define BC_MAX_OBASE_STR "999"
753 #if INT_MAX == 2147483647
754 # define BC_MAX_DIM_STR "2147483647"
755 #elif INT_MAX == 9223372036854775807
756 # define BC_MAX_DIM_STR "9223372036854775807"
758 # error Strange INT_MAX
761 #if UINT_MAX == 4294967295
762 # define BC_MAX_SCALE_STR "4294967295"
763 # define BC_MAX_STRING_STR "4294967294"
764 #elif UINT_MAX == 18446744073709551615
765 # define BC_MAX_SCALE_STR "18446744073709551615"
766 # define BC_MAX_STRING_STR "18446744073709551614"
768 # error Strange UINT_MAX
770 #define BC_MAX_NUM_STR BC_MAX_STRING_STR
773 IF_FEATURE_BC_SIGNALS(smallint ttyin;)
774 IF_FEATURE_CLEAN_UP(smallint exiting;)
780 // For error messages. Can be set to current parsed line,
781 // or [TODO] to current executing line (can be before last parsed one)
790 #if ENABLE_FEATURE_EDITING
791 line_input_t *line_input_state;
794 #define G (*ptr_to_globals)
795 #define INIT_G() do { \
796 SET_PTR_TO_GLOBALS(xzalloc(sizeof(G))); \
798 #define FREE_G() do { \
799 FREE_PTR_TO_GLOBALS(); \
801 #define G_posix (ENABLE_BC && (option_mask32 & BC_FLAG_S))
802 #define G_warn (ENABLE_BC && (option_mask32 & BC_FLAG_W))
803 #define G_exreg (ENABLE_DC && (option_mask32 & DC_FLAG_X))
804 #if ENABLE_FEATURE_BC_SIGNALS
805 # define G_interrupt bb_got_signal
806 # define G_ttyin G.ttyin
808 # define G_interrupt 0
811 #if ENABLE_FEATURE_CLEAN_UP
812 # define G_exiting G.exiting
816 #define IS_BC (ENABLE_BC && (!ENABLE_DC || applet_name[0] == 'b'))
817 #define IS_DC (ENABLE_DC && (!ENABLE_BC || applet_name[0] != 'b'))
819 // In configurations where errors abort instead of propagating error
820 // return code up the call chain, functions returning BC_STATUS
821 // actually don't return anything, they always succeed and return "void".
822 // A macro wrapper is provided, which makes this statement work:
824 // and makes it visible to the compiler that s is always zero,
825 // allowing compiler to optimize dead code after the statement.
827 // To make code more readable, each such function has a "z"
828 // ("always returning zero") prefix, i.e. zbc_foo or zdc_foo.
830 #if ENABLE_FEATURE_BC_SIGNALS || ENABLE_FEATURE_CLEAN_UP
831 # define ERRORS_ARE_FATAL 0
832 # define ERRORFUNC /*nothing*/
833 # define IF_ERROR_RETURN_POSSIBLE(a) a
834 # define BC_STATUS BcStatus
835 # define RETURN_STATUS(v) return (v)
836 # define COMMA_SUCCESS /*nothing*/
838 # define ERRORS_ARE_FATAL 1
839 # define ERRORFUNC NORETURN
840 # define IF_ERROR_RETURN_POSSIBLE(a) /*nothing*/
841 # define BC_STATUS void
842 # define RETURN_STATUS(v) do { ((void)(v)); return; } while (0)
843 # define COMMA_SUCCESS ,BC_STATUS_SUCCESS
846 #define BC_NUM_NEG(n, neg) ((((ssize_t)(n)) ^ -((ssize_t)(neg))) + (neg))
847 #define BC_NUM_ONE(n) ((n)->len == 1 && (n)->rdx == 0 && (n)->num[0] == 1)
848 #define BC_NUM_INT(n) ((n)->len - (n)->rdx)
849 //#define BC_NUM_AREQ(a, b) (BC_MAX((a)->rdx, (b)->rdx) + BC_MAX(BC_NUM_INT(a), BC_NUM_INT(b)) + 1)
850 static /*ALWAYS_INLINE*/ size_t BC_NUM_AREQ(BcNum *a, BcNum *b)
852 return BC_MAX(a->rdx, b->rdx) + BC_MAX(BC_NUM_INT(a), BC_NUM_INT(b)) + 1;
854 //#define BC_NUM_MREQ(a, b, scale) (BC_NUM_INT(a) + BC_NUM_INT(b) + BC_MAX((scale), (a)->rdx + (b)->rdx) + 1)
855 static /*ALWAYS_INLINE*/ size_t BC_NUM_MREQ(BcNum *a, BcNum *b, size_t scale)
857 return BC_NUM_INT(a) + BC_NUM_INT(b) + BC_MAX(scale, a->rdx + b->rdx) + 1;
860 typedef void (*BcNumDigitOp)(size_t, size_t, bool) FAST_FUNC;
862 typedef BC_STATUS (*BcNumBinaryOp)(BcNum *, BcNum *, BcNum *, size_t) FAST_FUNC;
864 static BC_STATUS zbc_num_binary(BcNum *a, BcNum *b, BcNum *c, size_t scale,
865 BcNumBinaryOp op, size_t req);
866 static FAST_FUNC BC_STATUS zbc_num_a(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale);
867 static FAST_FUNC BC_STATUS zbc_num_s(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale);
868 static FAST_FUNC BC_STATUS zbc_num_p(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale);
869 static FAST_FUNC BC_STATUS zbc_num_m(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale);
870 static FAST_FUNC BC_STATUS zbc_num_d(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale);
871 static FAST_FUNC BC_STATUS zbc_num_rem(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale);
873 static FAST_FUNC BC_STATUS zbc_num_add(BcNum *a, BcNum *b, BcNum *c, size_t scale)
875 BcNumBinaryOp op = (!a->neg == !b->neg) ? zbc_num_a : zbc_num_s;
877 RETURN_STATUS(zbc_num_binary(a, b, c, false, op, BC_NUM_AREQ(a, b)));
880 static FAST_FUNC BC_STATUS zbc_num_sub(BcNum *a, BcNum *b, BcNum *c, size_t scale)
882 BcNumBinaryOp op = (!a->neg == !b->neg) ? zbc_num_s : zbc_num_a;
884 RETURN_STATUS(zbc_num_binary(a, b, c, true, op, BC_NUM_AREQ(a, b)));
887 static FAST_FUNC BC_STATUS zbc_num_mul(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_m, req));
893 static FAST_FUNC BC_STATUS zbc_num_div(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_d, req));
899 static FAST_FUNC BC_STATUS zbc_num_mod(BcNum *a, BcNum *b, BcNum *c, size_t scale)
901 size_t req = BC_NUM_MREQ(a, b, scale);
902 RETURN_STATUS(zbc_num_binary(a, b, c, scale, zbc_num_rem, req));
905 static FAST_FUNC BC_STATUS zbc_num_pow(BcNum *a, BcNum *b, BcNum *c, size_t scale)
907 RETURN_STATUS(zbc_num_binary(a, b, c, scale, zbc_num_p, a->len * b->len + 1));
910 static const BcNumBinaryOp zbc_program_ops[] = {
911 zbc_num_pow, zbc_num_mul, zbc_num_div, zbc_num_mod, zbc_num_add, zbc_num_sub,
913 #define zbc_num_add(...) (zbc_num_add(__VA_ARGS__) COMMA_SUCCESS)
914 #define zbc_num_sub(...) (zbc_num_sub(__VA_ARGS__) COMMA_SUCCESS)
915 #define zbc_num_mul(...) (zbc_num_mul(__VA_ARGS__) COMMA_SUCCESS)
916 #define zbc_num_div(...) (zbc_num_div(__VA_ARGS__) COMMA_SUCCESS)
917 #define zbc_num_mod(...) (zbc_num_mod(__VA_ARGS__) COMMA_SUCCESS)
918 #define zbc_num_pow(...) (zbc_num_pow(__VA_ARGS__) COMMA_SUCCESS)
920 static void fflush_and_check(void)
923 if (ferror(stdout) || ferror(stderr))
924 bb_perror_msg_and_die("output error");
927 #if ENABLE_FEATURE_CLEAN_UP
928 #define QUIT_OR_RETURN_TO_MAIN \
930 IF_FEATURE_BC_SIGNALS(G_ttyin = 0;) /* do not loop in main loop anymore */ \
932 return BC_STATUS_FAILURE; \
935 #define QUIT_OR_RETURN_TO_MAIN quit()
938 static void quit(void) NORETURN;
939 static void quit(void)
942 bb_perror_msg_and_die("input error");
944 dbg_exec("quit(): exiting with exitcode SUCCESS");
948 static void bc_verror_msg(const char *fmt, va_list p)
950 const char *sv = sv; // for compiler
953 applet_name = xasprintf("%s: %s:%u", applet_name, G.prog.file, G.err_line);
955 bb_verror_msg(fmt, p, NULL);
957 free((char*)applet_name);
962 static NOINLINE ERRORFUNC int bc_error_fmt(const char *fmt, ...)
967 bc_verror_msg(fmt, p);
970 if (ENABLE_FEATURE_CLEAN_UP || G_ttyin)
971 IF_ERROR_RETURN_POSSIBLE(return BC_STATUS_FAILURE);
976 static NOINLINE int bc_posix_error_fmt(const char *fmt, ...)
980 // Are non-POSIX constructs totally ok?
981 if (!(option_mask32 & (BC_FLAG_S|BC_FLAG_W)))
982 return BC_STATUS_SUCCESS; // yes
985 bc_verror_msg(fmt, p);
988 // Do we treat non-POSIX constructs as errors?
989 if (!(option_mask32 & BC_FLAG_S))
990 return BC_STATUS_SUCCESS; // no, it's a warning
991 if (ENABLE_FEATURE_CLEAN_UP || G_ttyin)
992 return BC_STATUS_FAILURE;
997 // We use error functions with "return bc_error(FMT[, PARAMS])" idiom.
998 // This idiom begs for tail-call optimization, but for it to work,
999 // function must not have caller-cleaned parameters on stack.
1000 // Unfortunately, vararg function API does exactly that on most arches.
1001 // Thus, use these shims for the cases when we have no vararg PARAMS:
1002 static ERRORFUNC int bc_error(const char *msg)
1004 IF_ERROR_RETURN_POSSIBLE(return) bc_error_fmt("%s", msg);
1006 static ERRORFUNC int bc_error_bad_character(char c)
1009 IF_ERROR_RETURN_POSSIBLE(return) bc_error("NUL character");
1010 IF_ERROR_RETURN_POSSIBLE(return) bc_error_fmt("bad character '%c'", c);
1012 static ERRORFUNC int bc_error_bad_expression(void)
1014 IF_ERROR_RETURN_POSSIBLE(return) bc_error("bad expression");
1016 static ERRORFUNC int bc_error_bad_token(void)
1018 IF_ERROR_RETURN_POSSIBLE(return) bc_error("bad token");
1020 static ERRORFUNC int bc_error_stack_has_too_few_elements(void)
1022 IF_ERROR_RETURN_POSSIBLE(return) bc_error("stack has too few elements");
1024 static ERRORFUNC int bc_error_variable_is_wrong_type(void)
1026 IF_ERROR_RETURN_POSSIBLE(return) bc_error("variable is wrong type");
1028 static ERRORFUNC int bc_error_nested_read_call(void)
1030 IF_ERROR_RETURN_POSSIBLE(return) bc_error("read() call inside of a read() call");
1033 static int bc_POSIX_requires(const char *msg)
1035 return bc_posix_error_fmt("POSIX requires %s", msg);
1037 static int bc_POSIX_does_not_allow(const char *msg)
1039 return bc_posix_error_fmt("%s%s", "POSIX does not allow ", msg);
1041 static int bc_POSIX_does_not_allow_bool_ops_this_is_bad(const char *msg)
1043 return bc_posix_error_fmt("%s%s %s", "POSIX does not allow ", "boolean operators; the following is bad:", msg);
1045 static int bc_POSIX_does_not_allow_empty_X_expression_in_for(const char *msg)
1047 return bc_posix_error_fmt("%san empty %s expression in a for loop", "POSIX does not allow ", msg);
1051 static void bc_vec_grow(BcVec *v, size_t n)
1053 size_t cap = v->cap * 2;
1054 while (cap < v->len + n) cap *= 2;
1055 v->v = xrealloc(v->v, v->size * cap);
1059 static void bc_vec_init(BcVec *v, size_t esize, BcVecFree dtor)
1062 v->cap = BC_VEC_START_CAP;
1065 v->v = xmalloc(esize * BC_VEC_START_CAP);
1068 static void bc_char_vec_init(BcVec *v)
1070 bc_vec_init(v, sizeof(char), NULL);
1073 static void bc_vec_expand(BcVec *v, size_t req)
1076 v->v = xrealloc(v->v, v->size * req);
1081 static void bc_vec_pop(BcVec *v)
1085 v->dtor(v->v + (v->size * v->len));
1088 static void bc_vec_npop(BcVec *v, size_t n)
1093 size_t len = v->len - n;
1094 while (v->len > len) v->dtor(v->v + (v->size * --v->len));
1098 static void bc_vec_pop_all(BcVec *v)
1100 bc_vec_npop(v, v->len);
1103 static void bc_vec_push(BcVec *v, const void *data)
1105 if (v->len + 1 > v->cap) bc_vec_grow(v, 1);
1106 memmove(v->v + (v->size * v->len), data, v->size);
1110 static void bc_vec_pushByte(BcVec *v, char data)
1112 bc_vec_push(v, &data);
1115 static void bc_vec_pushZeroByte(BcVec *v)
1117 //bc_vec_pushByte(v, '\0');
1119 bc_vec_push(v, &const_int_0);
1122 static void bc_vec_pushAt(BcVec *v, const void *data, size_t idx)
1125 bc_vec_push(v, data);
1130 if (v->len == v->cap) bc_vec_grow(v, 1);
1132 ptr = v->v + v->size * idx;
1134 memmove(ptr + v->size, ptr, v->size * (v->len++ - idx));
1135 memmove(ptr, data, v->size);
1139 static void bc_vec_string(BcVec *v, size_t len, const char *str)
1142 bc_vec_expand(v, len + 1);
1143 memcpy(v->v, str, len);
1146 bc_vec_pushZeroByte(v);
1149 #if ENABLE_FEATURE_BC_SIGNALS && ENABLE_FEATURE_EDITING
1150 static void bc_vec_concat(BcVec *v, const char *str)
1154 if (v->len == 0) bc_vec_pushZeroByte(v);
1157 len = v->len + slen;
1159 if (v->cap < len) bc_vec_grow(v, slen);
1160 strcpy(v->v + v->len - 1, str);
1166 static void *bc_vec_item(const BcVec *v, size_t idx)
1168 return v->v + v->size * idx;
1171 static char** bc_program_str(size_t idx)
1173 return bc_vec_item(&G.prog.strs, idx);
1176 static BcFunc* bc_program_func(size_t idx)
1178 return bc_vec_item(&G.prog.fns, idx);
1181 static void *bc_vec_item_rev(const BcVec *v, size_t idx)
1183 return v->v + v->size * (v->len - idx - 1);
1186 static void *bc_vec_top(const BcVec *v)
1188 return v->v + v->size * (v->len - 1);
1191 static FAST_FUNC void bc_vec_free(void *vec)
1193 BcVec *v = (BcVec *) vec;
1198 static int bc_id_cmp(const void *e1, const void *e2)
1200 return strcmp(((const BcId *) e1)->name, ((const BcId *) e2)->name);
1203 static FAST_FUNC void bc_id_free(void *id)
1205 free(((BcId *) id)->name);
1208 static size_t bc_map_find(const BcVec *v, const void *ptr)
1210 size_t low = 0, high = v->len;
1212 while (low < high) {
1214 size_t mid = (low + high) / 2;
1215 BcId *id = bc_vec_item(v, mid);
1216 int result = bc_id_cmp(ptr, id);
1220 else if (result < 0)
1229 static int bc_map_insert(BcVec *v, const void *ptr, size_t *i)
1231 size_t n = *i = bc_map_find(v, ptr);
1234 bc_vec_push(v, ptr);
1235 else if (!bc_id_cmp(ptr, bc_vec_item(v, n)))
1236 return 0; // "was not inserted"
1238 bc_vec_pushAt(v, ptr, n);
1239 return 1; // "was inserted"
1243 static size_t bc_map_index(const BcVec *v, const void *ptr)
1245 size_t i = bc_map_find(v, ptr);
1246 if (i >= v->len) return BC_VEC_INVALID_IDX;
1247 return bc_id_cmp(ptr, bc_vec_item(v, i)) ? BC_VEC_INVALID_IDX : i;
1251 static int bad_input_byte(char c)
1253 if ((c < ' ' && c != '\t' && c != '\r' && c != '\n') // also allow '\v' '\f'?
1256 bc_error_fmt("illegal character 0x%02x", c);
1262 // Note: it _appends_ data from fp to vec.
1263 static void bc_read_line(BcVec *vec, FILE *fp)
1268 #if ENABLE_FEATURE_BC_SIGNALS
1269 if (G_interrupt) { // ^C was pressed
1272 // ^C while running a script (bc SCRIPT): die.
1273 // We do not return to interactive prompt:
1274 // user might be running us from a shell,
1275 // and SCRIPT might be intended to terminate
1276 // (e.g. contain a "halt" stmt).
1277 // ^C dropping user into a bc prompt instead of
1278 // the shell would be unexpected.
1281 // ^C while interactive input
1283 // GNU bc says "interrupted execution."
1284 // GNU dc says "Interrupt!"
1285 fputs("\ninterrupted execution\n", stderr);
1288 # if ENABLE_FEATURE_EDITING
1289 if (G_ttyin && fp == stdin) {
1291 # define line_buf bb_common_bufsiz1
1292 n = read_line_input(G.line_input_state, "", line_buf, COMMON_BUFSIZE);
1293 if (n <= 0) { // read errors or EOF, or ^D, or ^C
1296 bc_vec_pushZeroByte(vec); // ^D or EOF (or error)
1301 char c = line_buf[i++];
1303 if (bad_input_byte(c)) goto again;
1305 bc_vec_concat(vec, line_buf);
1313 size_t len = vec->len;
1316 #if ENABLE_FEATURE_BC_SIGNALS
1318 // ^C was pressed: ignore entire line, get another one
1323 do c = fgetc(fp); while (c == '\0');
1326 bb_perror_msg_and_die("input error");
1327 // Note: EOF does not append '\n'
1330 bad_chars |= bad_input_byte(c);
1331 bc_vec_pushByte(vec, (char)c);
1332 } while (c != '\n');
1335 // Bad chars on this line
1336 if (!G.prog.file) { // stdin
1337 // ignore entire line, get another one
1341 bb_perror_msg_and_die("file '%s' is not text", G.prog.file);
1343 bc_vec_pushZeroByte(vec);
1347 static void bc_num_setToZero(BcNum *n, size_t scale)
1354 static void bc_num_zero(BcNum *n)
1356 bc_num_setToZero(n, 0);
1359 static void bc_num_one(BcNum *n)
1361 bc_num_setToZero(n, 0);
1366 static void bc_num_ten(BcNum *n)
1368 bc_num_setToZero(n, 0);
1374 // Note: this also sets BcNum to zero
1375 static void bc_num_init(BcNum *n, size_t req)
1377 req = req >= BC_NUM_DEF_SIZE ? req : BC_NUM_DEF_SIZE;
1378 //memset(n, 0, sizeof(BcNum)); - cleared by assignments below
1379 n->num = xmalloc(req);
1386 static void bc_num_init_DEF_SIZE(BcNum *n)
1388 bc_num_init(n, BC_NUM_DEF_SIZE);
1391 static void bc_num_expand(BcNum *n, size_t req)
1393 req = req >= BC_NUM_DEF_SIZE ? req : BC_NUM_DEF_SIZE;
1395 n->num = xrealloc(n->num, req);
1400 static FAST_FUNC void bc_num_free(void *num)
1402 free(((BcNum *) num)->num);
1405 static void bc_num_copy(BcNum *d, BcNum *s)
1408 bc_num_expand(d, s->cap);
1412 memcpy(d->num, s->num, sizeof(BcDig) * d->len);
1416 static BC_STATUS zbc_num_ulong(BcNum *n, unsigned long *result_p)
1419 unsigned long pow, result;
1421 if (n->neg) RETURN_STATUS(bc_error("negative number"));
1423 for (result = 0, pow = 1, i = n->rdx; i < n->len; ++i) {
1425 unsigned long prev = result, powprev = pow;
1427 result += ((unsigned long) n->num[i]) * pow;
1430 if (result < prev || pow < powprev)
1431 RETURN_STATUS(bc_error("overflow"));
1437 RETURN_STATUS(BC_STATUS_SUCCESS);
1439 #define zbc_num_ulong(...) (zbc_num_ulong(__VA_ARGS__) COMMA_SUCCESS)
1441 static void bc_num_ulong2num(BcNum *n, unsigned long val)
1447 if (val == 0) return;
1449 if (ULONG_MAX == 0xffffffffUL)
1450 bc_num_expand(n, 10); // 10 digits: 4294967295
1451 if (ULONG_MAX == 0xffffffffffffffffULL)
1452 bc_num_expand(n, 20); // 20 digits: 18446744073709551615
1453 BUILD_BUG_ON(ULONG_MAX > 0xffffffffffffffffULL);
1460 if (val == 0) break;
1464 static void bc_num_subArrays(BcDig *restrict a, BcDig *restrict b,
1468 for (i = 0; i < len; ++i) {
1470 for (j = i; a[j] < 0;) {
1477 static ssize_t bc_num_compare(BcDig *restrict a, BcDig *restrict b, size_t len)
1495 static ssize_t bc_num_cmp(BcNum *a, BcNum *b)
1497 size_t i, min, a_int, b_int, diff;
1498 BcDig *max_num, *min_num;
1502 if (a == b) return 0;
1503 if (a->len == 0) return BC_NUM_NEG(!!b->len, !b->neg);
1504 if (b->len == 0) return BC_NUM_NEG(1, a->neg);
1506 if (a->neg != b->neg) // signs of a and b differ
1507 // +a,-b = a>b = 1 or -a,+b = a<b = -1
1508 return (int)b->neg - (int)a->neg;
1509 neg = a->neg; // 1 if both negative, 0 if both positive
1511 a_int = BC_NUM_INT(a);
1512 b_int = BC_NUM_INT(b);
1515 if (a_int != 0) return (ssize_t) a_int;
1517 a_max = (a->rdx > b->rdx);
1520 diff = a->rdx - b->rdx;
1521 max_num = a->num + diff;
1523 // neg = (a_max == neg); - NOP (maps 1->1 and 0->0)
1526 diff = b->rdx - a->rdx;
1527 max_num = b->num + diff;
1529 neg = !neg; // same as "neg = (a_max == neg)"
1532 cmp = bc_num_compare(max_num, min_num, b_int + min);
1533 if (cmp != 0) return BC_NUM_NEG(cmp, neg);
1535 for (max_num -= diff, i = diff - 1; i < diff; --i) {
1536 if (max_num[i]) return BC_NUM_NEG(1, neg);
1542 static void bc_num_truncate(BcNum *n, size_t places)
1544 if (places == 0) return;
1550 memmove(n->num, n->num + places, n->len * sizeof(BcDig));
1554 static void bc_num_extend(BcNum *n, size_t places)
1556 size_t len = n->len + places;
1560 if (n->cap < len) bc_num_expand(n, len);
1562 memmove(n->num + places, n->num, sizeof(BcDig) * n->len);
1563 memset(n->num, 0, sizeof(BcDig) * places);
1570 static void bc_num_clean(BcNum *n)
1572 while (n->len > 0 && n->num[n->len - 1] == 0) --n->len;
1575 else if (n->len < n->rdx)
1579 static void bc_num_retireMul(BcNum *n, size_t scale, bool neg1, bool neg2)
1582 bc_num_extend(n, scale - n->rdx);
1584 bc_num_truncate(n, n->rdx - scale);
1587 if (n->len != 0) n->neg = !neg1 != !neg2;
1590 static void bc_num_split(BcNum *restrict n, size_t idx, BcNum *restrict a,
1595 b->len = n->len - idx;
1597 a->rdx = b->rdx = 0;
1599 memcpy(b->num, n->num + idx, b->len * sizeof(BcDig));
1600 memcpy(a->num, n->num, idx * sizeof(BcDig));
1611 static BC_STATUS zbc_num_shift(BcNum *n, size_t places)
1613 if (places == 0 || n->len == 0) RETURN_STATUS(BC_STATUS_SUCCESS);
1615 // This check makes sense only if size_t is (much) larger than BC_MAX_NUM.
1616 if (SIZE_MAX > (BC_MAX_NUM | 0xff)) {
1617 if (places + n->len > BC_MAX_NUM)
1618 RETURN_STATUS(bc_error("number too long: must be [1,"BC_MAX_NUM_STR"]"));
1621 if (n->rdx >= places)
1624 bc_num_extend(n, places - n->rdx);
1630 RETURN_STATUS(BC_STATUS_SUCCESS);
1632 #define zbc_num_shift(...) (zbc_num_shift(__VA_ARGS__) COMMA_SUCCESS)
1634 static BC_STATUS zbc_num_inv(BcNum *a, BcNum *b, size_t scale)
1643 RETURN_STATUS(zbc_num_div(&one, a, b, scale));
1645 #define zbc_num_inv(...) (zbc_num_inv(__VA_ARGS__) COMMA_SUCCESS)
1647 static FAST_FUNC BC_STATUS zbc_num_a(BcNum *a, BcNum *b, BcNum *restrict c, size_t sub)
1649 BcDig *ptr, *ptr_a, *ptr_b, *ptr_c;
1650 size_t i, max, min_rdx, min_int, diff, a_int, b_int;
1653 // Because this function doesn't need to use scale (per the bc spec),
1654 // I am hijacking it to say whether it's doing an add or a subtract.
1658 if (sub && c->len) c->neg = !c->neg;
1659 RETURN_STATUS(BC_STATUS_SUCCESS);
1663 RETURN_STATUS(BC_STATUS_SUCCESS);
1667 c->rdx = BC_MAX(a->rdx, b->rdx);
1668 min_rdx = BC_MIN(a->rdx, b->rdx);
1671 if (a->rdx > b->rdx) {
1672 diff = a->rdx - b->rdx;
1674 ptr_a = a->num + diff;
1677 diff = b->rdx - a->rdx;
1680 ptr_b = b->num + diff;
1684 for (i = 0; i < diff; ++i, ++c->len)
1688 a_int = BC_NUM_INT(a);
1689 b_int = BC_NUM_INT(b);
1691 if (a_int > b_int) {
1702 for (i = 0; i < min_rdx + min_int; ++i) {
1703 unsigned in = (unsigned)ptr_a[i] + (unsigned)ptr_b[i] + carry;
1705 ptr_c[i] = (BcDig)(in % 10);
1707 for (; i < max + min_rdx; ++i) {
1708 unsigned in = (unsigned)ptr[i] + carry;
1710 ptr_c[i] = (BcDig)(in % 10);
1714 if (carry != 0) c->num[c->len++] = (BcDig) carry;
1716 RETURN_STATUS(BC_STATUS_SUCCESS); // can't make void, see zbc_num_binary()
1719 static FAST_FUNC BC_STATUS zbc_num_s(BcNum *a, BcNum *b, BcNum *restrict c, size_t sub)
1722 BcNum *minuend, *subtrahend;
1724 bool aneg, bneg, neg;
1726 // Because this function doesn't need to use scale (per the bc spec),
1727 // I am hijacking it to say whether it's doing an add or a subtract.
1731 if (sub && c->len) c->neg = !c->neg;
1732 RETURN_STATUS(BC_STATUS_SUCCESS);
1736 RETURN_STATUS(BC_STATUS_SUCCESS);
1741 a->neg = b->neg = false;
1743 cmp = bc_num_cmp(a, b);
1749 bc_num_setToZero(c, BC_MAX(a->rdx, b->rdx));
1750 RETURN_STATUS(BC_STATUS_SUCCESS);
1758 if (sub) neg = !neg;
1763 bc_num_copy(c, minuend);
1766 if (c->rdx < subtrahend->rdx) {
1767 bc_num_extend(c, subtrahend->rdx - c->rdx);
1770 start = c->rdx - subtrahend->rdx;
1772 bc_num_subArrays(c->num + start, subtrahend->num, subtrahend->len);
1776 RETURN_STATUS(BC_STATUS_SUCCESS); // can't make void, see zbc_num_binary()
1779 static FAST_FUNC BC_STATUS zbc_num_k(BcNum *restrict a, BcNum *restrict b,
1781 #define zbc_num_k(...) (zbc_num_k(__VA_ARGS__) COMMA_SUCCESS)
1784 size_t max = BC_MAX(a->len, b->len), max2 = (max + 1) / 2;
1785 BcNum l1, h1, l2, h2, m2, m1, z0, z1, z2, temp;
1788 if (a->len == 0 || b->len == 0) {
1790 RETURN_STATUS(BC_STATUS_SUCCESS);
1792 aone = BC_NUM_ONE(a);
1793 if (aone || BC_NUM_ONE(b)) {
1794 bc_num_copy(c, aone ? b : a);
1795 RETURN_STATUS(BC_STATUS_SUCCESS);
1798 if (a->len + b->len < BC_NUM_KARATSUBA_LEN
1799 || a->len < BC_NUM_KARATSUBA_LEN
1800 || b->len < BC_NUM_KARATSUBA_LEN
1804 bc_num_expand(c, a->len + b->len + 1);
1806 memset(c->num, 0, sizeof(BcDig) * c->cap);
1809 for (i = 0; i < b->len; ++i) {
1811 for (j = 0; j < a->len; ++j) {
1812 unsigned in = c->num[i + j];
1813 in += (unsigned)a->num[j] * (unsigned)b->num[i] + carry;
1814 // note: compilers prefer _unsigned_ div/const
1816 c->num[i + j] = (BcDig)(in % 10);
1819 c->num[i + j] += (BcDig) carry;
1820 len = BC_MAX(len, i + j + !!carry);
1822 #if ENABLE_FEATURE_BC_SIGNALS
1824 // a*a <- without check below, this will not be interruptible
1825 if (G_interrupt) return BC_STATUS_FAILURE;
1831 RETURN_STATUS(BC_STATUS_SUCCESS);
1834 bc_num_init(&l1, max);
1835 bc_num_init(&h1, max);
1836 bc_num_init(&l2, max);
1837 bc_num_init(&h2, max);
1838 bc_num_init(&m1, max);
1839 bc_num_init(&m2, max);
1840 bc_num_init(&z0, max);
1841 bc_num_init(&z1, max);
1842 bc_num_init(&z2, max);
1843 bc_num_init(&temp, max + max);
1845 bc_num_split(a, max2, &l1, &h1);
1846 bc_num_split(b, max2, &l2, &h2);
1848 s = zbc_num_add(&h1, &l1, &m1, 0);
1850 s = zbc_num_add(&h2, &l2, &m2, 0);
1853 s = zbc_num_k(&h1, &h2, &z0);
1855 s = zbc_num_k(&m1, &m2, &z1);
1857 s = zbc_num_k(&l1, &l2, &z2);
1860 s = zbc_num_sub(&z1, &z0, &temp, 0);
1862 s = zbc_num_sub(&temp, &z2, &z1, 0);
1865 s = zbc_num_shift(&z0, max2 * 2);
1867 s = zbc_num_shift(&z1, max2);
1869 s = zbc_num_add(&z0, &z1, &temp, 0);
1871 s = zbc_num_add(&temp, &z2, c, 0);
1887 static FAST_FUNC BC_STATUS zbc_num_m(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale)
1891 size_t maxrdx = BC_MAX(a->rdx, b->rdx);
1893 scale = BC_MAX(scale, a->rdx);
1894 scale = BC_MAX(scale, b->rdx);
1895 scale = BC_MIN(a->rdx + b->rdx, scale);
1896 maxrdx = BC_MAX(maxrdx, scale);
1898 bc_num_init(&cpa, a->len);
1899 bc_num_init(&cpb, b->len);
1901 bc_num_copy(&cpa, a);
1902 bc_num_copy(&cpb, b);
1903 cpa.neg = cpb.neg = false;
1905 s = zbc_num_shift(&cpa, maxrdx);
1907 s = zbc_num_shift(&cpb, maxrdx);
1909 s = zbc_num_k(&cpa, &cpb, c);
1913 bc_num_expand(c, c->len + maxrdx);
1915 if (c->len < maxrdx) {
1916 memset(c->num + c->len, 0, (c->cap - c->len) * sizeof(BcDig));
1921 bc_num_retireMul(c, scale, a->neg, b->neg);
1928 #define zbc_num_m(...) (zbc_num_m(__VA_ARGS__) COMMA_SUCCESS)
1930 static FAST_FUNC BC_STATUS zbc_num_d(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale)
1937 RETURN_STATUS(bc_error("divide by zero"));
1939 bc_num_setToZero(c, scale);
1940 RETURN_STATUS(BC_STATUS_SUCCESS);
1942 if (BC_NUM_ONE(b)) {
1944 bc_num_retireMul(c, scale, a->neg, b->neg);
1945 RETURN_STATUS(BC_STATUS_SUCCESS);
1948 bc_num_init(&cp, BC_NUM_MREQ(a, b, scale));
1949 bc_num_copy(&cp, a);
1953 bc_num_expand(&cp, len + 2);
1954 bc_num_extend(&cp, len - cp.len);
1957 if (b->rdx > cp.rdx) bc_num_extend(&cp, b->rdx - cp.rdx);
1959 if (scale > cp.rdx) bc_num_extend(&cp, scale - cp.rdx);
1961 if (b->rdx == b->len) {
1963 if (len == 0) break;
1965 if (b->num[len] != 0)
1971 if (cp.cap == cp.len) bc_num_expand(&cp, cp.len + 1);
1973 // We want an extra zero in front to make things simpler.
1974 cp.num[cp.len++] = 0;
1977 bc_num_expand(c, cp.len);
1980 memset(c->num + end, 0, (c->cap - end) * sizeof(BcDig));
1984 s = BC_STATUS_SUCCESS;
1985 for (i = end - 1; i < end; --i) {
1988 for (q = 0; n[len] != 0 || bc_num_compare(n, b->num, len) >= 0; ++q)
1989 bc_num_subArrays(n, b->num, len);
1991 #if ENABLE_FEATURE_BC_SIGNALS
1994 // 1/a <- without check below, this will not be interruptible
1996 s = BC_STATUS_FAILURE;
2002 bc_num_retireMul(c, scale, a->neg, b->neg);
2007 #define zbc_num_d(...) (zbc_num_d(__VA_ARGS__) COMMA_SUCCESS)
2009 static FAST_FUNC BC_STATUS zbc_num_r(BcNum *a, BcNum *b, BcNum *restrict c,
2010 BcNum *restrict d, size_t scale, size_t ts)
2017 RETURN_STATUS(bc_error("divide by zero"));
2020 bc_num_setToZero(d, ts);
2021 RETURN_STATUS(BC_STATUS_SUCCESS);
2024 bc_num_init(&temp, d->cap);
2025 s = zbc_num_d(a, b, c, scale);
2028 if (scale != 0) scale = ts;
2030 s = zbc_num_m(c, b, &temp, scale);
2032 s = zbc_num_sub(a, &temp, d, scale);
2035 if (ts > d->rdx && d->len) bc_num_extend(d, ts - d->rdx);
2038 bc_num_retireMul(d, ts, a->neg, b->neg);
2045 #define zbc_num_r(...) (zbc_num_r(__VA_ARGS__) COMMA_SUCCESS)
2047 static FAST_FUNC BC_STATUS zbc_num_rem(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale)
2051 size_t ts = BC_MAX(scale + b->rdx, a->rdx), len = BC_NUM_MREQ(a, b, ts);
2053 bc_num_init(&c1, len);
2054 s = zbc_num_r(a, b, &c1, c, scale, ts);
2059 #define zbc_num_rem(...) (zbc_num_rem(__VA_ARGS__) COMMA_SUCCESS)
2061 static FAST_FUNC BC_STATUS zbc_num_p(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale)
2063 BcStatus s = BC_STATUS_SUCCESS;
2066 size_t i, powrdx, resrdx;
2069 if (b->rdx) RETURN_STATUS(bc_error("non integer number"));
2073 RETURN_STATUS(BC_STATUS_SUCCESS);
2076 bc_num_setToZero(c, scale);
2077 RETURN_STATUS(BC_STATUS_SUCCESS);
2079 if (BC_NUM_ONE(b)) {
2083 s = zbc_num_inv(a, c, scale);
2090 s = zbc_num_ulong(b, &pow);
2091 if (s) RETURN_STATUS(s);
2093 bc_num_init(©, a->len);
2094 bc_num_copy(©, a);
2099 if (a->rdx * pow < scale)
2100 scale = a->rdx * pow;
2105 for (powrdx = a->rdx; !(pow & 1); pow >>= 1) {
2107 s = zbc_num_mul(©, ©, ©, powrdx);
2109 // Not needed: zbc_num_mul() has a check for ^C:
2110 //if (G_interrupt) {
2111 // s = BC_STATUS_FAILURE;
2116 bc_num_copy(c, ©);
2118 for (resrdx = powrdx, pow >>= 1; pow != 0; pow >>= 1) {
2120 s = zbc_num_mul(©, ©, ©, powrdx);
2125 s = zbc_num_mul(c, ©, c, resrdx);
2128 // Not needed: zbc_num_mul() has a check for ^C:
2129 //if (G_interrupt) {
2130 // s = BC_STATUS_FAILURE;
2136 s = zbc_num_inv(c, c, scale);
2140 if (c->rdx > scale) bc_num_truncate(c, c->rdx - scale);
2142 // We can't use bc_num_clean() here.
2143 for (i = 0; i < c->len; ++i)
2146 bc_num_setToZero(c, scale);
2153 #define zbc_num_p(...) (zbc_num_p(__VA_ARGS__) COMMA_SUCCESS)
2155 static BC_STATUS zbc_num_binary(BcNum *a, BcNum *b, BcNum *c, size_t scale,
2156 BcNumBinaryOp op, size_t req)
2159 BcNum num2, *ptr_a, *ptr_b;
2164 memcpy(ptr_a, c, sizeof(BcNum));
2172 memcpy(ptr_b, c, sizeof(BcNum));
2179 bc_num_init(c, req);
2181 bc_num_expand(c, req);
2183 s = BC_STATUS_SUCCESS;
2184 IF_ERROR_RETURN_POSSIBLE(s =) op(ptr_a, ptr_b, c, scale);
2186 if (init) bc_num_free(&num2);
2190 #define zbc_num_binary(...) (zbc_num_binary(__VA_ARGS__) COMMA_SUCCESS)
2192 static bool bc_num_strValid(const char *val, size_t base)
2197 b = (BcDig)(base <= 10 ? base + '0' : base - 10 + 'A');
2204 if (radix) return false;
2208 if (c < '0' || c >= b || (c > '9' && c < 'A'))
2214 // Note: n is already "bc_num_zero()"ed,
2215 // leading zeroes in "val" are removed
2216 static void bc_num_parseDecimal(BcNum *n, const char *val)
2225 bc_num_expand(n, len);
2227 ptr = strchr(val, '.');
2231 n->rdx = (size_t)((val + len) - (ptr + 1));
2233 for (i = 0; val[i]; ++i) {
2234 if (val[i] != '0' && val[i] != '.') {
2235 // Not entirely zero value - convert it, and exit
2238 n->num[n->len] = val[i] - '0';
2242 if (val[--i] == '.') goto skip_dot;
2247 // if for() exits without hitting if(), the value is entirely zero
2250 // Note: n is already "bc_num_zero()"ed,
2251 // leading zeroes in "val" are removed
2252 static void bc_num_parseBase(BcNum *n, const char *val, unsigned base_t)
2255 BcNum temp, mult, result;
2261 for (i = 0; ; ++i) {
2264 if (val[i] != '.' && val[i] != '0')
2268 bc_num_init_DEF_SIZE(&temp);
2269 bc_num_init_DEF_SIZE(&mult);
2270 bc_num_init_DEF_SIZE(&base);
2271 bc_num_ulong2num(&base, base_t);
2275 if (c == '\0') goto int_err;
2276 if (c == '.') break;
2278 v = (unsigned long) (c <= '9' ? c - '0' : c - 'A' + 10);
2280 s = zbc_num_mul(n, &base, &mult, 0);
2281 if (s) goto int_err;
2282 bc_num_ulong2num(&temp, v);
2283 s = zbc_num_add(&mult, &temp, n, 0);
2284 if (s) goto int_err;
2287 bc_num_init(&result, base.len);
2288 //bc_num_zero(&result); - already is
2294 if (c == '\0') break;
2297 v = (unsigned long) (c <= '9' ? c - '0' : c - 'A' + 10);
2299 s = zbc_num_mul(&result, &base, &result, 0);
2301 bc_num_ulong2num(&temp, v);
2302 s = zbc_num_add(&result, &temp, &result, 0);
2304 s = zbc_num_mul(&mult, &base, &mult, 0);
2308 s = zbc_num_div(&result, &mult, &result, digits);
2310 s = zbc_num_add(n, &result, n, digits);
2314 if (n->rdx < digits) bc_num_extend(n, digits - n->rdx);
2319 bc_num_free(&result);
2326 static BC_STATUS zbc_num_parse(BcNum *n, const char *val, unsigned base_t)
2328 if (!bc_num_strValid(val, base_t))
2329 RETURN_STATUS(bc_error("bad number string"));
2332 while (*val == '0') val++;
2335 bc_num_parseDecimal(n, val);
2337 bc_num_parseBase(n, val, base_t);
2339 RETURN_STATUS(BC_STATUS_SUCCESS);
2341 #define zbc_num_parse(...) (zbc_num_parse(__VA_ARGS__) COMMA_SUCCESS)
2343 static BC_STATUS zbc_num_sqrt(BcNum *a, BcNum *restrict b, size_t scale)
2346 BcNum num1, num2, half, f, fprime, *x0, *x1, *temp;
2347 size_t pow, len, digs, digs1, resrdx, req, times = 0;
2348 ssize_t cmp = 1, cmp1 = SSIZE_MAX, cmp2 = SSIZE_MAX;
2350 req = BC_MAX(scale, a->rdx) + ((BC_NUM_INT(a) + 1) >> 1) + 1;
2351 bc_num_expand(b, req);
2354 bc_num_setToZero(b, scale);
2355 RETURN_STATUS(BC_STATUS_SUCCESS);
2356 } else if (a->neg) {
2357 RETURN_STATUS(bc_error("negative number"));
2358 } else if (BC_NUM_ONE(a)) {
2360 bc_num_extend(b, scale);
2361 RETURN_STATUS(BC_STATUS_SUCCESS);
2364 scale = BC_MAX(scale, a->rdx) + 1;
2365 len = a->len + scale;
2367 bc_num_init(&num1, len);
2368 bc_num_init(&num2, len);
2369 bc_num_init_DEF_SIZE(&half);
2375 bc_num_init(&f, len);
2376 bc_num_init(&fprime, len);
2382 pow = BC_NUM_INT(a);
2390 pow -= 2 - (pow & 1);
2392 bc_num_extend(x0, pow);
2394 // Make sure to move the radix back.
2398 x0->rdx = digs = digs1 = 0;
2400 len = BC_NUM_INT(x0) + resrdx - 1;
2402 while (cmp != 0 || digs < len) {
2403 s = zbc_num_div(a, x0, &f, resrdx);
2405 s = zbc_num_add(x0, &f, &fprime, resrdx);
2407 s = zbc_num_mul(&fprime, &half, x1, resrdx);
2410 cmp = bc_num_cmp(x1, x0);
2411 digs = x1->len - (unsigned long long) llabs(cmp);
2413 if (cmp == cmp2 && digs == digs1)
2418 resrdx += times > 4;
2431 if (b->rdx > scale) bc_num_truncate(b, b->rdx - scale);
2433 bc_num_free(&fprime);
2440 #define zbc_num_sqrt(...) (zbc_num_sqrt(__VA_ARGS__) COMMA_SUCCESS)
2442 static BC_STATUS zbc_num_divmod(BcNum *a, BcNum *b, BcNum *c, BcNum *d,
2448 size_t ts = BC_MAX(scale + b->rdx, a->rdx), len = BC_NUM_MREQ(a, b, ts);
2451 memcpy(&num2, c, sizeof(BcNum));
2453 bc_num_init(c, len);
2457 bc_num_expand(c, len);
2460 s = zbc_num_r(ptr_a, b, c, d, scale, ts);
2462 if (init) bc_num_free(&num2);
2466 #define zbc_num_divmod(...) (zbc_num_divmod(__VA_ARGS__) COMMA_SUCCESS)
2469 static BC_STATUS zbc_num_modexp(BcNum *a, BcNum *b, BcNum *c, BcNum *restrict d)
2472 BcNum base, exp, two, temp;
2475 RETURN_STATUS(bc_error("divide by zero"));
2476 if (a->rdx || b->rdx || c->rdx)
2477 RETURN_STATUS(bc_error("non integer number"));
2479 RETURN_STATUS(bc_error("negative number"));
2481 bc_num_expand(d, c->len);
2482 bc_num_init(&base, c->len);
2483 bc_num_init(&exp, b->len);
2484 bc_num_init_DEF_SIZE(&two);
2485 bc_num_init(&temp, b->len);
2491 s = zbc_num_rem(a, c, &base, 0);
2493 bc_num_copy(&exp, b);
2495 while (exp.len != 0) {
2496 s = zbc_num_divmod(&exp, &two, &exp, &temp, 0);
2499 if (BC_NUM_ONE(&temp)) {
2500 s = zbc_num_mul(d, &base, &temp, 0);
2502 s = zbc_num_rem(&temp, c, d, 0);
2506 s = zbc_num_mul(&base, &base, &temp, 0);
2508 s = zbc_num_rem(&temp, c, &base, 0);
2518 #define zbc_num_modexp(...) (zbc_num_modexp(__VA_ARGS__) COMMA_SUCCESS)
2522 static BC_STATUS zbc_func_insert(BcFunc *f, char *name, bool var)
2527 for (i = 0; i < f->autos.len; ++i) {
2528 if (strcmp(name, ((BcId *) bc_vec_item(&f->autos, i))->name) == 0)
2529 RETURN_STATUS(bc_error("function parameter or auto var has the same name as another"));
2535 bc_vec_push(&f->autos, &a);
2537 RETURN_STATUS(BC_STATUS_SUCCESS);
2539 #define zbc_func_insert(...) (zbc_func_insert(__VA_ARGS__) COMMA_SUCCESS)
2542 static void bc_func_init(BcFunc *f)
2544 bc_char_vec_init(&f->code);
2545 bc_vec_init(&f->autos, sizeof(BcId), bc_id_free);
2546 bc_vec_init(&f->labels, sizeof(size_t), NULL);
2550 static FAST_FUNC void bc_func_free(void *func)
2552 BcFunc *f = (BcFunc *) func;
2553 bc_vec_free(&f->code);
2554 bc_vec_free(&f->autos);
2555 bc_vec_free(&f->labels);
2558 static void bc_array_expand(BcVec *a, size_t len);
2560 static void bc_array_init(BcVec *a, bool nums)
2563 bc_vec_init(a, sizeof(BcNum), bc_num_free);
2565 bc_vec_init(a, sizeof(BcVec), bc_vec_free);
2566 bc_array_expand(a, 1);
2569 static void bc_array_expand(BcVec *a, size_t len)
2573 if (a->size == sizeof(BcNum) && a->dtor == bc_num_free) {
2574 while (len > a->len) {
2575 bc_num_init_DEF_SIZE(&data.n);
2576 bc_vec_push(a, &data.n);
2579 while (len > a->len) {
2580 bc_array_init(&data.v, true);
2581 bc_vec_push(a, &data.v);
2586 static void bc_array_copy(BcVec *d, const BcVec *s)
2591 bc_vec_expand(d, s->cap);
2594 for (i = 0; i < s->len; ++i) {
2595 BcNum *dnum = bc_vec_item(d, i), *snum = bc_vec_item(s, i);
2596 bc_num_init(dnum, snum->len);
2597 bc_num_copy(dnum, snum);
2601 static FAST_FUNC void bc_string_free(void *string)
2603 free(*((char **) string));
2607 static void bc_result_copy(BcResult *d, BcResult *src)
2612 case BC_RESULT_TEMP:
2613 case BC_RESULT_IBASE:
2614 case BC_RESULT_SCALE:
2615 case BC_RESULT_OBASE:
2616 bc_num_init(&d->d.n, src->d.n.len);
2617 bc_num_copy(&d->d.n, &src->d.n);
2620 case BC_RESULT_ARRAY:
2621 case BC_RESULT_ARRAY_ELEM:
2622 d->d.id.name = xstrdup(src->d.id.name);
2624 case BC_RESULT_CONSTANT:
2625 case BC_RESULT_LAST:
2628 memcpy(&d->d.n, &src->d.n, sizeof(BcNum));
2634 static FAST_FUNC void bc_result_free(void *result)
2636 BcResult *r = (BcResult *) result;
2639 case BC_RESULT_TEMP:
2640 case BC_RESULT_IBASE:
2641 case BC_RESULT_SCALE:
2642 case BC_RESULT_OBASE:
2643 bc_num_free(&r->d.n);
2646 case BC_RESULT_ARRAY:
2647 case BC_RESULT_ARRAY_ELEM:
2656 static void bc_lex_lineComment(BcLex *l)
2658 l->t.t = BC_LEX_WHITESPACE;
2659 while (l->i < l->len && l->buf[l->i++] != '\n');
2663 static void bc_lex_whitespace(BcLex *l)
2665 l->t.t = BC_LEX_WHITESPACE;
2667 char c = l->buf[l->i];
2668 if (c == '\n') // this is BC_LEX_NLINE, not BC_LEX_WHITESPACE
2676 static BC_STATUS zbc_lex_number(BcLex *l, char start)
2678 const char *buf = l->buf + l->i;
2679 size_t len, i, ccnt;
2682 pt = (start == '.');
2683 l->t.t = BC_LEX_NUMBER;
2689 if (c == '\\' && buf[i + 1] == '\n') {
2691 //number_of_backslashes++ - see comment below
2694 if (!isdigit(c) && (c < 'A' || c > 'F')) {
2695 if (c != '.') break;
2696 // if '.' was already seen, stop on second one:
2700 // buf[i] is one of "0-9A-F."
2705 //ccnt is the number of chars in the number string, excluding possible
2706 //trailing "[\<newline>].[\<newline>]" (with any number of \<NL> repetitions).
2707 //i is buf[i] index of the first not-yet-parsed char after that.
2710 // This might overestimate the size, if there are "\<NL>"'s
2711 // in the number. Subtracting number_of_backslashes*2 correctly
2712 // is not that easy: consider that in the case of "NNN.\<NL>"
2713 // loop above will count "\<NL>" before it realizes it is not
2714 // in fact *inside* the number:
2715 len = ccnt + 1; // +1 byte for NUL termination
2717 // This check makes sense only if size_t is (much) larger than BC_MAX_NUM.
2718 if (SIZE_MAX > (BC_MAX_NUM | 0xff)) {
2719 if (len > BC_MAX_NUM)
2720 RETURN_STATUS(bc_error("number too long: must be [1,"BC_MAX_NUM_STR"]"));
2723 bc_vec_pop_all(&l->t.v);
2724 bc_vec_expand(&l->t.v, 1 + len);
2725 bc_vec_push(&l->t.v, &start);
2728 // If we have hit a backslash, skip it. We don't have
2729 // to check for a newline because it's guaranteed.
2735 bc_vec_push(&l->t.v, buf);
2740 bc_vec_pushZeroByte(&l->t.v);
2742 RETURN_STATUS(BC_STATUS_SUCCESS);
2744 #define zbc_lex_number(...) (zbc_lex_number(__VA_ARGS__) COMMA_SUCCESS)
2746 static void bc_lex_name(BcLex *l)
2751 l->t.t = BC_LEX_NAME;
2754 buf = l->buf + l->i - 1;
2757 if ((c < 'a' || c > 'z') && !isdigit(c) && c != '_') break;
2761 #if 0 // We do not protect against people with gigabyte-long names
2762 // This check makes sense only if size_t is (much) larger than BC_MAX_STRING.
2763 if (SIZE_MAX > (BC_MAX_STRING | 0xff)) {
2764 if (i > BC_MAX_STRING)
2765 return bc_error("name too long: must be [1,"BC_MAX_STRING_STR"]");
2768 bc_vec_string(&l->t.v, i, buf);
2770 // Increment the index. We minus 1 because it has already been incremented.
2773 //return BC_STATUS_SUCCESS;
2776 static void bc_lex_init(BcLex *l)
2778 bc_char_vec_init(&l->t.v);
2781 static void bc_lex_free(BcLex *l)
2783 bc_vec_free(&l->t.v);
2786 static void bc_lex_file(BcLex *l)
2788 G.err_line = l->line = 1;
2792 IF_BC(static BC_STATUS zbc_lex_token(BcLex *l);)
2793 IF_DC(static BC_STATUS zdc_lex_token(BcLex *l);)
2795 static BC_STATUS zcommon_lex_token(BcLex *l)
2798 IF_BC(RETURN_STATUS(zbc_lex_token(l));)
2800 IF_DC(RETURN_STATUS(zdc_lex_token(l));)
2802 #define zcommon_lex_token(...) (zcommon_lex_token(__VA_ARGS__) COMMA_SUCCESS)
2804 static bool bc_lex_more_input(BcLex *l)
2809 bc_vec_pop_all(&G.input_buffer);
2811 // This loop is complex because the vm tries not to send any lines that end
2812 // with a backslash to the parser. The reason for that is because the parser
2813 // treats a backslash+newline combo as whitespace, per the bc spec. In that
2814 // case, and for strings and comments, the parser will expect more stuff.
2818 size_t prevlen = G.input_buffer.len;
2821 bc_read_line(&G.input_buffer, G.input_fp);
2822 // No more input means EOF
2823 if (G.input_buffer.len <= prevlen + 1) // (we expect +1 for NUL byte)
2826 string = G.input_buffer.v + prevlen;
2829 if (string == G.input_buffer.v || string[-1] != '\\') {
2840 if (c == '/' && *string == '*') {
2845 if (c == '*' && *string == '/') {
2850 if (str != 0 || comment) {
2851 G.input_buffer.len--; // backstep over the trailing NUL byte
2855 // Check for backslash+newline.
2856 // we do not check that last char is '\n' -
2857 // if it is not, then it's EOF, and looping back
2858 // to bc_read_line() will detect it:
2860 if (string >= G.input_buffer.v && *string == '\\') {
2861 G.input_buffer.len--;
2868 l->buf = G.input_buffer.v;
2870 // bb_error_msg("G.input_buffer.len:%d '%s'", G.input_buffer.len, G.input_buffer.v);
2871 l->len = G.input_buffer.len - 1; // do not include NUL
2876 static BC_STATUS zbc_lex_next(BcLex *l)
2881 if (l->t.last == BC_LEX_EOF) RETURN_STATUS(bc_error("end of file"));
2883 l->line += l->newline;
2884 G.err_line = l->line;
2887 // Loop until failure or we don't have whitespace. This
2888 // is so the parser doesn't get inundated with whitespace.
2889 // Comments are also BC_LEX_WHITESPACE tokens and eaten here.
2890 s = BC_STATUS_SUCCESS;
2892 l->t.t = BC_LEX_EOF;
2893 if (l->i == l->len) {
2895 RETURN_STATUS(BC_STATUS_SUCCESS);
2896 if (!bc_lex_more_input(l)) {
2898 RETURN_STATUS(BC_STATUS_SUCCESS);
2900 // here it's guaranteed that l->i is below l->len
2902 dbg_lex("next string to parse:'%.*s'",
2903 (int)(strchrnul(l->buf + l->i, '\n') - (l->buf + l->i)),
2905 s = zcommon_lex_token(l);
2906 } while (!s && l->t.t == BC_LEX_WHITESPACE);
2907 dbg_lex("l->t.t from string:%d", l->t.t);
2911 #define zbc_lex_next(...) (zbc_lex_next(__VA_ARGS__) COMMA_SUCCESS)
2913 static BC_STATUS zbc_lex_skip_if_at_NLINE(BcLex *l)
2915 if (l->t.t == BC_LEX_NLINE)
2916 RETURN_STATUS(zbc_lex_next(l));
2917 RETURN_STATUS(BC_STATUS_SUCCESS);
2919 #define zbc_lex_skip_if_at_NLINE(...) (zbc_lex_skip_if_at_NLINE(__VA_ARGS__) COMMA_SUCCESS)
2921 static BC_STATUS zbc_lex_next_and_skip_NLINE(BcLex *l)
2924 s = zbc_lex_next(l);
2925 if (s) RETURN_STATUS(s);
2926 // if(cond)<newline>stmt is accepted too (but not 2+ newlines)
2927 s = zbc_lex_skip_if_at_NLINE(l);
2930 #define zbc_lex_next_and_skip_NLINE(...) (zbc_lex_next_and_skip_NLINE(__VA_ARGS__) COMMA_SUCCESS)
2932 static BC_STATUS zbc_lex_text_init(BcLex *l, const char *text)
2936 l->len = strlen(text);
2937 l->t.t = l->t.last = BC_LEX_INVALID;
2938 RETURN_STATUS(zbc_lex_next(l));
2940 #define zbc_lex_text_init(...) (zbc_lex_text_init(__VA_ARGS__) COMMA_SUCCESS)
2943 static BC_STATUS zbc_lex_identifier(BcLex *l)
2947 const char *buf = l->buf + l->i - 1;
2949 for (i = 0; i < ARRAY_SIZE(bc_lex_kws); ++i) {
2950 const char *keyword8 = bc_lex_kws[i].name8;
2952 while (buf[j] != '\0' && buf[j] == keyword8[j]) {
2954 if (j == 8) goto match;
2956 if (keyword8[j] != '\0')
2959 // buf starts with keyword bc_lex_kws[i]
2960 l->t.t = BC_LEX_KEY_1st_keyword + i;
2961 if (!bc_lex_kws_POSIX(i)) {
2962 s = bc_posix_error_fmt("%sthe '%.8s' keyword", "POSIX does not allow ", bc_lex_kws[i].name8);
2963 IF_ERROR_RETURN_POSSIBLE(if (s) RETURN_STATUS(s));
2966 // We minus 1 because the index has already been incremented.
2968 RETURN_STATUS(BC_STATUS_SUCCESS);
2972 s = BC_STATUS_SUCCESS;
2974 if (l->t.v.len > 2) {
2977 // bc: POSIX only allows one character names; the following is bad: 'qwe=1
2979 unsigned len = strchrnul(buf, '\n') - buf;
2980 s = bc_posix_error_fmt("POSIX only allows one character names; the following is bad: '%.*s'", len, buf);
2985 #define zbc_lex_identifier(...) (zbc_lex_identifier(__VA_ARGS__) COMMA_SUCCESS)
2987 static BC_STATUS zbc_lex_string(BcLex *l)
2989 size_t len, nls = 0, i = l->i;
2992 l->t.t = BC_LEX_STR;
2994 for (c = l->buf[i]; c != '\0' && c != '"'; c = l->buf[++i])
2999 RETURN_STATUS(bc_error("string end could not be found"));
3003 // This check makes sense only if size_t is (much) larger than BC_MAX_STRING.
3004 if (SIZE_MAX > (BC_MAX_STRING | 0xff)) {
3005 if (len > BC_MAX_STRING)
3006 RETURN_STATUS(bc_error("string too long: must be [1,"BC_MAX_STRING_STR"]"));
3008 bc_vec_string(&l->t.v, len, l->buf + l->i);
3012 G.err_line = l->line;
3014 RETURN_STATUS(BC_STATUS_SUCCESS);
3016 #define zbc_lex_string(...) (zbc_lex_string(__VA_ARGS__) COMMA_SUCCESS)
3018 static void bc_lex_assign(BcLex *l, unsigned with_and_without)
3020 if (l->buf[l->i] == '=') {
3022 with_and_without >>= 8; // store "with" value
3023 } // else store "without" value
3024 l->t.t = (with_and_without & 0xff);
3026 #define bc_lex_assign(l, with, without) \
3027 bc_lex_assign(l, ((with)<<8)|(without))
3029 static BC_STATUS zbc_lex_comment(BcLex *l)
3032 const char *buf = l->buf;
3034 l->t.t = BC_LEX_WHITESPACE;
3035 i = l->i; /* here buf[l->i] is the '*' of opening comment delimiter */
3047 RETURN_STATUS(bc_error("comment end could not be found"));
3054 G.err_line = l->line;
3056 RETURN_STATUS(BC_STATUS_SUCCESS);
3058 #define zbc_lex_comment(...) (zbc_lex_comment(__VA_ARGS__) COMMA_SUCCESS)
3060 static BC_STATUS zbc_lex_token(BcLex *l)
3062 BcStatus s = BC_STATUS_SUCCESS;
3063 char c = l->buf[l->i++], c2;
3065 // This is the workhorse of the lexer.
3067 // case '\0': // probably never reached
3069 // l->t.t = BC_LEX_EOF;
3070 // l->newline = true;
3073 l->t.t = BC_LEX_NLINE;
3081 bc_lex_whitespace(l);
3084 bc_lex_assign(l, BC_LEX_OP_REL_NE, BC_LEX_OP_BOOL_NOT);
3085 if (l->t.t == BC_LEX_OP_BOOL_NOT) {
3086 s = bc_POSIX_does_not_allow_bool_ops_this_is_bad("!");
3087 IF_ERROR_RETURN_POSSIBLE(if (s) RETURN_STATUS(s));
3091 s = zbc_lex_string(l);
3094 s = bc_POSIX_does_not_allow("'#' script comments");
3095 IF_ERROR_RETURN_POSSIBLE(if (s) RETURN_STATUS(s));
3096 bc_lex_lineComment(l);
3099 bc_lex_assign(l, BC_LEX_OP_ASSIGN_MODULUS, BC_LEX_OP_MODULUS);
3104 s = bc_POSIX_does_not_allow_bool_ops_this_is_bad("&&");
3105 IF_ERROR_RETURN_POSSIBLE(if (s) RETURN_STATUS(s));
3107 l->t.t = BC_LEX_OP_BOOL_AND;
3109 l->t.t = BC_LEX_INVALID;
3110 s = bc_error_bad_character('&');
3115 l->t.t = (BcLexType)(c - '(' + BC_LEX_LPAREN);
3118 bc_lex_assign(l, BC_LEX_OP_ASSIGN_MULTIPLY, BC_LEX_OP_MULTIPLY);
3124 l->t.t = BC_LEX_OP_INC;
3126 bc_lex_assign(l, BC_LEX_OP_ASSIGN_PLUS, BC_LEX_OP_PLUS);
3129 l->t.t = BC_LEX_COMMA;
3135 l->t.t = BC_LEX_OP_DEC;
3137 bc_lex_assign(l, BC_LEX_OP_ASSIGN_MINUS, BC_LEX_OP_MINUS);
3140 if (isdigit(l->buf[l->i]))
3141 s = zbc_lex_number(l, c);
3143 l->t.t = BC_LEX_KEY_LAST;
3144 s = bc_POSIX_does_not_allow("a period ('.') as a shortcut for the last result");
3150 s = zbc_lex_comment(l);
3152 bc_lex_assign(l, BC_LEX_OP_ASSIGN_DIVIDE, BC_LEX_OP_DIVIDE);
3170 s = zbc_lex_number(l, c);
3173 l->t.t = BC_LEX_SCOLON;
3176 bc_lex_assign(l, BC_LEX_OP_REL_LE, BC_LEX_OP_REL_LT);
3179 bc_lex_assign(l, BC_LEX_OP_REL_EQ, BC_LEX_OP_ASSIGN);
3182 bc_lex_assign(l, BC_LEX_OP_REL_GE, BC_LEX_OP_REL_GT);
3186 l->t.t = (BcLexType)(c - '[' + BC_LEX_LBRACKET);
3189 if (l->buf[l->i] == '\n') {
3190 l->t.t = BC_LEX_WHITESPACE;
3193 s = bc_error_bad_character(c);
3196 bc_lex_assign(l, BC_LEX_OP_ASSIGN_POWER, BC_LEX_OP_POWER);
3224 s = zbc_lex_identifier(l);
3228 l->t.t = (BcLexType)(c - '{' + BC_LEX_LBRACE);
3233 s = bc_POSIX_does_not_allow_bool_ops_this_is_bad("||");
3234 IF_ERROR_RETURN_POSSIBLE(if (s) RETURN_STATUS(s));
3236 l->t.t = BC_LEX_OP_BOOL_OR;
3238 l->t.t = BC_LEX_INVALID;
3239 s = bc_error_bad_character(c);
3243 l->t.t = BC_LEX_INVALID;
3244 s = bc_error_bad_character(c);
3253 static BC_STATUS zdc_lex_register(BcLex *l)
3255 if (isspace(l->buf[l->i - 1])) {
3256 bc_lex_whitespace(l);
3259 RETURN_STATUS(bc_error("extended register"));
3263 bc_vec_pop_all(&l->t.v);
3264 bc_vec_push(&l->t.v, &l->buf[l->i - 1]);
3265 bc_vec_pushZeroByte(&l->t.v);
3266 l->t.t = BC_LEX_NAME;
3269 RETURN_STATUS(BC_STATUS_SUCCESS);
3271 #define zdc_lex_register(...) (zdc_lex_register(__VA_ARGS__) COMMA_SUCCESS)
3273 static BC_STATUS zdc_lex_string(BcLex *l)
3275 size_t depth = 1, nls = 0, i = l->i;
3278 l->t.t = BC_LEX_STR;
3279 bc_vec_pop_all(&l->t.v);
3281 for (c = l->buf[i]; c != 0 && depth; c = l->buf[++i]) {
3283 depth += (c == '[' && (i == l->i || l->buf[i - 1] != '\\'));
3284 depth -= (c == ']' && (i == l->i || l->buf[i - 1] != '\\'));
3287 if (depth) bc_vec_push(&l->t.v, &c);
3292 RETURN_STATUS(bc_error("string end could not be found"));
3295 bc_vec_pushZeroByte(&l->t.v);
3296 // This check makes sense only if size_t is (much) larger than BC_MAX_STRING.
3297 if (SIZE_MAX > (BC_MAX_STRING | 0xff)) {
3298 if (i - l->i > BC_MAX_STRING)
3299 RETURN_STATUS(bc_error("string too long: must be [1,"BC_MAX_STRING_STR"]"));
3304 G.err_line = l->line;
3306 RETURN_STATUS(BC_STATUS_SUCCESS);
3308 #define zdc_lex_string(...) (zdc_lex_string(__VA_ARGS__) COMMA_SUCCESS)
3310 static BC_STATUS zdc_lex_token(BcLex *l)
3312 static const //BcLexType - should be this type, but narrower type saves size:
3315 BC_LEX_OP_REL_EQ, BC_LEX_OP_REL_LE, BC_LEX_OP_REL_GE, BC_LEX_OP_REL_NE,
3316 BC_LEX_OP_REL_LT, BC_LEX_OP_REL_GT, BC_LEX_SCOLON, BC_LEX_COLON,
3317 BC_LEX_ELSE, BC_LEX_LOAD, BC_LEX_LOAD_POP, BC_LEX_OP_ASSIGN,
3320 static const //BcLexType - should be this type
3324 BC_LEX_OP_MODULUS, BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_LPAREN,
3326 BC_LEX_INVALID, BC_LEX_OP_MULTIPLY, BC_LEX_OP_PLUS, BC_LEX_INVALID,
3328 BC_LEX_OP_MINUS, BC_LEX_INVALID, BC_LEX_OP_DIVIDE,
3330 BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID,
3331 BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID,
3332 BC_LEX_INVALID, BC_LEX_INVALID,
3334 BC_LEX_COLON, BC_LEX_SCOLON, BC_LEX_OP_REL_GT, BC_LEX_OP_REL_EQ,
3335 BC_LEX_OP_REL_LT, BC_LEX_KEY_READ, BC_LEX_INVALID,
3337 BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID,
3338 BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_EQ_NO_REG, BC_LEX_INVALID,
3340 BC_LEX_KEY_IBASE, BC_LEX_INVALID, BC_LEX_KEY_SCALE, BC_LEX_LOAD_POP,
3341 BC_LEX_INVALID, BC_LEX_OP_BOOL_NOT, BC_LEX_KEY_OBASE, BC_LEX_PRINT_STREAM,
3343 BC_LEX_NQUIT, BC_LEX_POP, BC_LEX_STORE_PUSH, BC_LEX_INVALID, BC_LEX_INVALID,
3344 BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_SCALE_FACTOR, BC_LEX_INVALID,
3346 BC_LEX_KEY_LENGTH, BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID,
3348 BC_LEX_OP_POWER, BC_LEX_NEG, BC_LEX_INVALID,
3350 BC_LEX_ASCIIFY, BC_LEX_INVALID, BC_LEX_CLEAR_STACK, BC_LEX_DUPLICATE,
3351 BC_LEX_ELSE, BC_LEX_PRINT_STACK, BC_LEX_INVALID, BC_LEX_INVALID,
3353 BC_LEX_STORE_IBASE, BC_LEX_INVALID, BC_LEX_STORE_SCALE, BC_LEX_LOAD,
3354 BC_LEX_INVALID, BC_LEX_PRINT_POP, BC_LEX_STORE_OBASE, BC_LEX_KEY_PRINT,
3356 BC_LEX_KEY_QUIT, BC_LEX_SWAP, BC_LEX_OP_ASSIGN, BC_LEX_INVALID,
3357 BC_LEX_INVALID, BC_LEX_KEY_SQRT, BC_LEX_INVALID, BC_LEX_EXECUTE,
3359 BC_LEX_INVALID, BC_LEX_STACK_LEVEL,
3361 BC_LEX_LBRACE, BC_LEX_OP_MODEXP, BC_LEX_INVALID, BC_LEX_OP_DIVMOD,
3364 BcStatus s = BC_STATUS_SUCCESS;
3365 char c = l->buf[l->i++], c2;
3368 for (i = 0; i < ARRAY_SIZE(dc_lex_regs); ++i) {
3369 if (l->t.last == dc_lex_regs[i])
3370 RETURN_STATUS(zdc_lex_register(l));
3373 if (c >= '%' && c <= '~'
3374 && (l->t.t = dc_lex_tokens[c - '%']) != BC_LEX_INVALID
3379 // This is the workhorse of the lexer.
3381 // case '\0': // probably never reached
3382 // l->t.t = BC_LEX_EOF;
3390 l->newline = (c == '\n');
3391 bc_lex_whitespace(l);
3396 l->t.t = BC_LEX_OP_REL_NE;
3398 l->t.t = BC_LEX_OP_REL_LE;
3400 l->t.t = BC_LEX_OP_REL_GE;
3402 RETURN_STATUS(bc_error_bad_character(c));
3406 bc_lex_lineComment(l);
3409 if (isdigit(l->buf[l->i]))
3410 s = zbc_lex_number(l, c);
3412 s = bc_error_bad_character(c);
3430 s = zbc_lex_number(l, c);
3433 s = zdc_lex_string(l);
3436 l->t.t = BC_LEX_INVALID;
3437 s = bc_error_bad_character(c);
3445 static void bc_program_addFunc(char *name, size_t *idx);
3447 static void bc_parse_addFunc(BcParse *p, char *name, size_t *idx)
3449 bc_program_addFunc(name, idx);
3450 p->func = bc_program_func(p->fidx);
3453 static void bc_parse_push(BcParse *p, char i)
3455 dbg_lex("%s:%d pushing opcode %d", __func__, __LINE__, i);
3456 bc_vec_pushByte(&p->func->code, i);
3459 static void bc_parse_pushName(BcParse *p, char *name)
3462 bc_parse_push(p, *name++);
3463 bc_parse_push(p, BC_PARSE_STREND);
3466 static void bc_parse_pushIndex(BcParse *p, size_t idx)
3471 dbg_lex("%s:%d pushing index %zd", __func__, __LINE__, idx);
3472 mask = ((size_t)0xff) << (sizeof(idx) * 8 - 8);
3475 if (idx & mask) break;
3480 bc_parse_push(p, amt);
3483 bc_parse_push(p, (unsigned char)idx);
3488 static void bc_parse_pushJUMP(BcParse *p, size_t idx)
3490 bc_parse_push(p, BC_INST_JUMP);
3491 bc_parse_pushIndex(p, idx);
3494 static void bc_parse_pushJUMP_ZERO(BcParse *p, size_t idx)
3496 bc_parse_push(p, BC_INST_JUMP_ZERO);
3497 bc_parse_pushIndex(p, idx);
3500 static void bc_parse_number(BcParse *p)
3502 char *num = xstrdup(p->l.t.v.v);
3503 size_t idx = G.prog.consts.len;
3505 bc_vec_push(&G.prog.consts, &num);
3507 bc_parse_push(p, BC_INST_NUM);
3508 bc_parse_pushIndex(p, idx);
3511 IF_BC(static BC_STATUS zbc_parse_stmt_or_funcdef(BcParse *p);)
3512 IF_DC(static BC_STATUS zdc_parse_parse(BcParse *p);)
3514 // "Parse" half of "parse,execute,repeat" main loop
3515 static BC_STATUS zcommon_parse(BcParse *p)
3518 // FIXME: "eating" of stmt delemiters is coded inconsistently
3519 // (sometimes zbc_parse_stmt() eats the delimiter, sometimes don't),
3520 // which causes bugs such as "print 1 print 2" erroneously accepted,
3521 // or "print 1 else 2" detecting parse error only after executing
3523 IF_BC(RETURN_STATUS(zbc_parse_stmt_or_funcdef(p));)
3525 IF_DC(RETURN_STATUS(zdc_parse_parse(p));)
3527 #define zcommon_parse(...) (zcommon_parse(__VA_ARGS__) COMMA_SUCCESS)
3529 static BC_STATUS zbc_parse_text_init(BcParse *p, const char *text)
3531 p->func = bc_program_func(p->fidx);
3533 RETURN_STATUS(zbc_lex_text_init(&p->l, text));
3535 #define zbc_parse_text_init(...) (zbc_parse_text_init(__VA_ARGS__) COMMA_SUCCESS)
3537 // Called when parsing or execution detects a failure,
3538 // resets execution structures.
3539 static void bc_program_reset(void)
3544 bc_vec_npop(&G.prog.stack, G.prog.stack.len - 1);
3545 bc_vec_pop_all(&G.prog.results);
3547 f = bc_program_func(0);
3548 ip = bc_vec_top(&G.prog.stack);
3549 ip->idx = f->code.len;
3552 #define bc_parse_updateFunc(p, f) \
3553 ((p)->func = bc_program_func((p)->fidx = (f)))
3555 // Called when zbc/zdc_parse_parse() detects a failure,
3556 // resets parsing structures.
3557 static void bc_parse_reset(BcParse *p)
3559 if (p->fidx != BC_PROG_MAIN) {
3560 p->func->nparams = 0;
3561 bc_vec_pop_all(&p->func->code);
3562 bc_vec_pop_all(&p->func->autos);
3563 bc_vec_pop_all(&p->func->labels);
3565 bc_parse_updateFunc(p, BC_PROG_MAIN);
3569 p->l.t.t = BC_LEX_EOF;
3571 bc_vec_pop_all(&p->exits);
3572 bc_vec_pop_all(&p->conds);
3573 bc_vec_pop_all(&p->ops);
3578 static void bc_parse_free(BcParse *p)
3580 bc_vec_free(&p->exits);
3581 bc_vec_free(&p->conds);
3582 bc_vec_free(&p->ops);
3586 static void bc_parse_create(BcParse *p, size_t func)
3588 memset(p, 0, sizeof(BcParse));
3591 bc_vec_init(&p->exits, sizeof(size_t), NULL);
3592 bc_vec_init(&p->conds, sizeof(size_t), NULL);
3593 bc_vec_init(&p->ops, sizeof(BcLexType), NULL);
3595 bc_parse_updateFunc(p, func);
3600 #define BC_PARSE_TOP_OP(p) (*((BcLexType *) bc_vec_top(&(p)->ops)))
3601 #define BC_PARSE_LEAF(p, rparen) \
3602 (((p) >= BC_INST_NUM && (p) <= BC_INST_SQRT) || (rparen) || \
3603 (p) == BC_INST_INC_POST || (p) == BC_INST_DEC_POST)
3605 // We can calculate the conversion between tokens and exprs by subtracting the
3606 // position of the first operator in the lex enum and adding the position of the
3607 // first in the expr enum. Note: This only works for binary operators.
3608 #define BC_TOKEN_2_INST(t) ((char) ((t) - BC_LEX_NEG + BC_INST_NEG))
3610 static BcStatus bc_parse_expr_empty_ok(BcParse *p, uint8_t flags);
3612 static BC_STATUS zbc_parse_expr(BcParse *p, uint8_t flags)
3616 s = bc_parse_expr_empty_ok(p, flags);
3617 if (s == BC_STATUS_PARSE_EMPTY_EXP)
3618 RETURN_STATUS(bc_error("empty expression"));
3621 #define zbc_parse_expr(...) (zbc_parse_expr(__VA_ARGS__) COMMA_SUCCESS)
3623 static BC_STATUS zbc_parse_stmt_possibly_auto(BcParse *p, bool auto_allowed);
3624 #define zbc_parse_stmt_possibly_auto(...) (zbc_parse_stmt_possibly_auto(__VA_ARGS__) COMMA_SUCCESS)
3626 static BC_STATUS zbc_parse_stmt(BcParse *p)
3628 RETURN_STATUS(zbc_parse_stmt_possibly_auto(p, false));
3630 #define zbc_parse_stmt(...) (zbc_parse_stmt(__VA_ARGS__) COMMA_SUCCESS)
3632 static BC_STATUS zbc_parse_stmt_allow_NLINE_before(BcParse *p, const char *after_X)
3634 // "if(cond)<newline>stmt" is accepted too, but not 2+ newlines.
3635 // Same for "else", "while()", "for()".
3636 BcStatus s = zbc_lex_next_and_skip_NLINE(&p->l);
3637 if (s) RETURN_STATUS(s);
3638 if (p->l.t.t == BC_LEX_NLINE)
3639 RETURN_STATUS(bc_error_fmt("no statement after '%s'", after_X));
3641 RETURN_STATUS(zbc_parse_stmt(p));
3643 #define zbc_parse_stmt_allow_NLINE_before(...) (zbc_parse_stmt_allow_NLINE_before(__VA_ARGS__) COMMA_SUCCESS)
3645 static void bc_parse_operator(BcParse *p, BcLexType type, size_t start,
3648 char l, r = bc_parse_op_PREC(type - BC_LEX_OP_INC);
3649 bool left = bc_parse_op_LEFT(type - BC_LEX_OP_INC);
3651 while (p->ops.len > start) {
3652 BcLexType t = BC_PARSE_TOP_OP(p);
3653 if (t == BC_LEX_LPAREN) break;
3655 l = bc_parse_op_PREC(t - BC_LEX_OP_INC);
3656 if (l >= r && (l != r || !left)) break;
3658 bc_parse_push(p, BC_TOKEN_2_INST(t));
3659 bc_vec_pop(&p->ops);
3660 *nexprs -= (t != BC_LEX_OP_BOOL_NOT && t != BC_LEX_NEG);
3663 bc_vec_push(&p->ops, &type);
3666 static BC_STATUS zbc_parse_rightParen(BcParse *p, size_t ops_bgn, size_t *nexs)
3670 if (p->ops.len <= ops_bgn)
3671 RETURN_STATUS(bc_error_bad_expression());
3672 top = BC_PARSE_TOP_OP(p);
3674 while (top != BC_LEX_LPAREN) {
3675 bc_parse_push(p, BC_TOKEN_2_INST(top));
3677 bc_vec_pop(&p->ops);
3678 *nexs -= top != BC_LEX_OP_BOOL_NOT && top != BC_LEX_NEG;
3680 if (p->ops.len <= ops_bgn)
3681 RETURN_STATUS(bc_error_bad_expression());
3682 top = BC_PARSE_TOP_OP(p);
3685 bc_vec_pop(&p->ops);
3687 RETURN_STATUS(zbc_lex_next(&p->l));
3689 #define zbc_parse_rightParen(...) (zbc_parse_rightParen(__VA_ARGS__) COMMA_SUCCESS)
3691 static BC_STATUS zbc_parse_params(BcParse *p, uint8_t flags)
3696 dbg_lex("%s:%d p->l.t.t:%d", __func__, __LINE__, p->l.t.t);
3697 flags = (flags & ~(BC_PARSE_PRINT | BC_PARSE_REL)) | BC_PARSE_ARRAY;
3699 s = zbc_lex_next(&p->l);
3700 if (s) RETURN_STATUS(s);
3703 if (p->l.t.t != BC_LEX_RPAREN) {
3705 s = zbc_parse_expr(p, flags);
3706 if (s) RETURN_STATUS(s);
3708 if (p->l.t.t != BC_LEX_COMMA) {
3709 if (p->l.t.t == BC_LEX_RPAREN)
3711 RETURN_STATUS(bc_error_bad_token());
3713 s = zbc_lex_next(&p->l);
3714 if (s) RETURN_STATUS(s);
3718 bc_parse_push(p, BC_INST_CALL);
3719 bc_parse_pushIndex(p, nparams);
3721 RETURN_STATUS(BC_STATUS_SUCCESS);
3723 #define zbc_parse_params(...) (zbc_parse_params(__VA_ARGS__) COMMA_SUCCESS)
3725 static BC_STATUS zbc_parse_call(BcParse *p, char *name, uint8_t flags)
3728 BcId entry, *entry_ptr;
3733 s = zbc_parse_params(p, flags);
3736 if (p->l.t.t != BC_LEX_RPAREN) {
3737 s = bc_error_bad_token();
3741 idx = bc_map_index(&G.prog.fn_map, &entry);
3743 if (idx == BC_VEC_INVALID_IDX) {
3744 name = xstrdup(entry.name);
3745 bc_parse_addFunc(p, name, &idx);
3746 idx = bc_map_index(&G.prog.fn_map, &entry);
3751 entry_ptr = bc_vec_item(&G.prog.fn_map, idx);
3752 bc_parse_pushIndex(p, entry_ptr->idx);
3754 RETURN_STATUS(zbc_lex_next(&p->l));
3760 #define zbc_parse_call(...) (zbc_parse_call(__VA_ARGS__) COMMA_SUCCESS)
3762 static BC_STATUS zbc_parse_name(BcParse *p, BcInst *type, uint8_t flags)
3767 name = xstrdup(p->l.t.v.v);
3768 s = zbc_lex_next(&p->l);
3771 if (p->l.t.t == BC_LEX_LBRACKET) {
3772 s = zbc_lex_next(&p->l);
3775 if (p->l.t.t == BC_LEX_RBRACKET) {
3776 if (!(flags & BC_PARSE_ARRAY)) {
3777 s = bc_error_bad_expression();
3780 *type = BC_INST_ARRAY;
3782 *type = BC_INST_ARRAY_ELEM;
3783 flags &= ~(BC_PARSE_PRINT | BC_PARSE_REL);
3784 s = zbc_parse_expr(p, flags);
3787 s = zbc_lex_next(&p->l);
3789 bc_parse_push(p, *type);
3790 bc_parse_pushName(p, name);
3793 else if (p->l.t.t == BC_LEX_LPAREN) {
3794 if (flags & BC_PARSE_NOCALL) {
3795 s = bc_error_bad_token();
3798 *type = BC_INST_CALL;
3799 s = zbc_parse_call(p, name, flags);
3801 *type = BC_INST_VAR;
3802 bc_parse_push(p, BC_INST_VAR);
3803 bc_parse_pushName(p, name);
3813 #define zbc_parse_name(...) (zbc_parse_name(__VA_ARGS__) COMMA_SUCCESS)
3815 static BC_STATUS zbc_parse_read(BcParse *p)
3819 s = zbc_lex_next(&p->l);
3820 if (s) RETURN_STATUS(s);
3821 if (p->l.t.t != BC_LEX_LPAREN) RETURN_STATUS(bc_error_bad_token());
3823 s = zbc_lex_next(&p->l);
3824 if (s) RETURN_STATUS(s);
3825 if (p->l.t.t != BC_LEX_RPAREN) RETURN_STATUS(bc_error_bad_token());
3827 bc_parse_push(p, BC_INST_READ);
3829 RETURN_STATUS(zbc_lex_next(&p->l));
3831 #define zbc_parse_read(...) (zbc_parse_read(__VA_ARGS__) COMMA_SUCCESS)
3833 static BC_STATUS zbc_parse_builtin(BcParse *p, BcLexType type, uint8_t flags,
3838 s = zbc_lex_next(&p->l);
3839 if (s) RETURN_STATUS(s);
3840 if (p->l.t.t != BC_LEX_LPAREN) RETURN_STATUS(bc_error_bad_token());
3842 flags = (flags & ~(BC_PARSE_PRINT | BC_PARSE_REL)) | BC_PARSE_ARRAY;
3844 s = zbc_lex_next(&p->l);
3845 if (s) RETURN_STATUS(s);
3847 s = zbc_parse_expr(p, flags);
3848 if (s) RETURN_STATUS(s);
3850 if (p->l.t.t != BC_LEX_RPAREN) RETURN_STATUS(bc_error_bad_token());
3852 *prev = (type == BC_LEX_KEY_LENGTH) ? BC_INST_LENGTH : BC_INST_SQRT;
3853 bc_parse_push(p, *prev);
3855 RETURN_STATUS(zbc_lex_next(&p->l));
3857 #define zbc_parse_builtin(...) (zbc_parse_builtin(__VA_ARGS__) COMMA_SUCCESS)
3859 static BC_STATUS zbc_parse_scale(BcParse *p, BcInst *type, uint8_t flags)
3863 s = zbc_lex_next(&p->l);
3864 if (s) RETURN_STATUS(s);
3866 if (p->l.t.t != BC_LEX_LPAREN) {
3867 *type = BC_INST_SCALE;
3868 bc_parse_push(p, BC_INST_SCALE);
3869 RETURN_STATUS(BC_STATUS_SUCCESS);
3872 *type = BC_INST_SCALE_FUNC;
3873 flags &= ~(BC_PARSE_PRINT | BC_PARSE_REL);
3875 s = zbc_lex_next(&p->l);
3876 if (s) RETURN_STATUS(s);
3878 s = zbc_parse_expr(p, flags);
3879 if (s) RETURN_STATUS(s);
3880 if (p->l.t.t != BC_LEX_RPAREN)
3881 RETURN_STATUS(bc_error_bad_token());
3882 bc_parse_push(p, BC_INST_SCALE_FUNC);
3884 RETURN_STATUS(zbc_lex_next(&p->l));
3886 #define zbc_parse_scale(...) (zbc_parse_scale(__VA_ARGS__) COMMA_SUCCESS)
3888 static BC_STATUS zbc_parse_incdec(BcParse *p, BcInst *prev, bool *paren_expr,
3889 size_t *nexprs, uint8_t flags)
3894 BcInst etype = *prev;
3896 if (etype == BC_INST_VAR || etype == BC_INST_ARRAY_ELEM ||
3897 etype == BC_INST_SCALE || etype == BC_INST_LAST ||
3898 etype == BC_INST_IBASE || etype == BC_INST_OBASE)
3900 *prev = inst = BC_INST_INC_POST + (p->l.t.t != BC_LEX_OP_INC);
3901 bc_parse_push(p, inst);
3902 s = zbc_lex_next(&p->l);
3905 *prev = inst = BC_INST_INC_PRE + (p->l.t.t != BC_LEX_OP_INC);
3908 s = zbc_lex_next(&p->l);
3909 if (s) RETURN_STATUS(s);
3912 // Because we parse the next part of the expression
3913 // right here, we need to increment this.
3914 *nexprs = *nexprs + 1;
3918 s = zbc_parse_name(p, prev, flags | BC_PARSE_NOCALL);
3920 case BC_LEX_KEY_IBASE:
3921 case BC_LEX_KEY_LAST:
3922 case BC_LEX_KEY_OBASE:
3923 bc_parse_push(p, type - BC_LEX_KEY_IBASE + BC_INST_IBASE);
3924 s = zbc_lex_next(&p->l);
3926 case BC_LEX_KEY_SCALE:
3927 s = zbc_lex_next(&p->l);
3928 if (s) RETURN_STATUS(s);
3929 if (p->l.t.t == BC_LEX_LPAREN)
3930 s = bc_error_bad_token();
3932 bc_parse_push(p, BC_INST_SCALE);
3935 s = bc_error_bad_token();
3939 if (!s) bc_parse_push(p, inst);
3944 #define zbc_parse_incdec(...) (zbc_parse_incdec(__VA_ARGS__) COMMA_SUCCESS)
3946 static BC_STATUS zbc_parse_minus(BcParse *p, BcInst *prev, size_t ops_bgn,
3947 bool rparen, size_t *nexprs)
3951 BcInst etype = *prev;
3953 s = zbc_lex_next(&p->l);
3954 if (s) RETURN_STATUS(s);
3956 type = rparen || etype == BC_INST_INC_POST || etype == BC_INST_DEC_POST ||
3957 (etype >= BC_INST_NUM && etype <= BC_INST_SQRT) ?
3960 *prev = BC_TOKEN_2_INST(type);
3962 // We can just push onto the op stack because this is the largest
3963 // precedence operator that gets pushed. Inc/dec does not.
3964 if (type != BC_LEX_OP_MINUS)
3965 bc_vec_push(&p->ops, &type);
3967 bc_parse_operator(p, type, ops_bgn, nexprs);
3971 #define zbc_parse_minus(...) (zbc_parse_minus(__VA_ARGS__) COMMA_SUCCESS)
3973 static BC_STATUS zbc_parse_string(BcParse *p, char inst)
3975 char *str = xstrdup(p->l.t.v.v);
3977 bc_parse_push(p, BC_INST_STR);
3978 bc_parse_pushIndex(p, G.prog.strs.len);
3979 bc_vec_push(&G.prog.strs, &str);
3980 bc_parse_push(p, inst);
3982 RETURN_STATUS(zbc_lex_next(&p->l));
3984 #define zbc_parse_string(...) (zbc_parse_string(__VA_ARGS__) COMMA_SUCCESS)
3986 static BC_STATUS zbc_parse_print(BcParse *p)
3992 s = zbc_lex_next(&p->l);
3993 if (s) RETURN_STATUS(s);
3995 if (type == BC_LEX_STR) {
3996 s = zbc_parse_string(p, BC_INST_PRINT_POP);
3998 s = zbc_parse_expr(p, 0);
3999 bc_parse_push(p, BC_INST_PRINT_POP);
4001 if (s) RETURN_STATUS(s);
4002 if (p->l.t.t != BC_LEX_COMMA)
4008 #define zbc_parse_print(...) (zbc_parse_print(__VA_ARGS__) COMMA_SUCCESS)
4010 static BC_STATUS zbc_parse_return(BcParse *p)
4015 dbg_lex_enter("%s:%d entered", __func__, __LINE__);
4016 s = zbc_lex_next(&p->l);
4017 if (s) RETURN_STATUS(s);
4020 if (t == BC_LEX_NLINE || t == BC_LEX_SCOLON)
4021 bc_parse_push(p, BC_INST_RET0);
4023 bool paren = (t == BC_LEX_LPAREN);
4024 s = bc_parse_expr_empty_ok(p, 0);
4025 if (s == BC_STATUS_PARSE_EMPTY_EXP) {
4026 bc_parse_push(p, BC_INST_RET0);
4027 s = zbc_lex_next(&p->l);
4029 if (s) RETURN_STATUS(s);
4031 if (!paren || p->l.t.last != BC_LEX_RPAREN) {
4032 s = bc_POSIX_requires("parentheses around return expressions");
4033 IF_ERROR_RETURN_POSSIBLE(if (s) RETURN_STATUS(s));
4036 bc_parse_push(p, BC_INST_RET);
4039 dbg_lex_done("%s:%d done", __func__, __LINE__);
4042 #define zbc_parse_return(...) (zbc_parse_return(__VA_ARGS__) COMMA_SUCCESS)
4044 static void rewrite_label_to_current(BcParse *p, size_t idx)
4046 size_t *label = bc_vec_item(&p->func->labels, idx);
4047 *label = p->func->code.len;
4050 static BC_STATUS zbc_parse_if(BcParse *p)
4055 dbg_lex_enter("%s:%d entered", __func__, __LINE__);
4056 s = zbc_lex_next(&p->l);
4057 if (s) RETURN_STATUS(s);
4058 if (p->l.t.t != BC_LEX_LPAREN) RETURN_STATUS(bc_error_bad_token());
4060 s = zbc_lex_next(&p->l);
4061 if (s) RETURN_STATUS(s);
4062 s = zbc_parse_expr(p, BC_PARSE_REL);
4063 if (s) RETURN_STATUS(s);
4065 if (p->l.t.t != BC_LEX_RPAREN) RETURN_STATUS(bc_error_bad_token());
4067 ip_idx = p->func->labels.len;
4068 bc_parse_pushJUMP_ZERO(p, ip_idx);
4069 bc_vec_push(&p->func->labels, &ip_idx);
4071 s = zbc_parse_stmt_allow_NLINE_before(p, STRING_if);
4072 if (s) RETURN_STATUS(s);
4074 dbg_lex("%s:%d in if after stmt: p->l.t.t:%d", __func__, __LINE__, p->l.t.t);
4075 if (p->l.t.t == BC_LEX_KEY_ELSE) {
4078 ip2_idx = p->func->labels.len;
4080 dbg_lex("%s:%d after if() body: BC_INST_JUMP to %zd", __func__, __LINE__, ip2_idx);
4081 bc_parse_pushJUMP(p, ip2_idx);
4083 dbg_lex("%s:%d rewriting 'if_zero' label to jump to 'else'-> %zd", __func__, __LINE__, p->func->code.len);
4084 rewrite_label_to_current(p, ip_idx);
4086 bc_vec_push(&p->func->labels, &ip2_idx);
4089 s = zbc_parse_stmt_allow_NLINE_before(p, STRING_else);
4090 if (s) RETURN_STATUS(s);
4093 dbg_lex("%s:%d rewriting label to jump after 'if' body-> %zd", __func__, __LINE__, p->func->code.len);
4094 rewrite_label_to_current(p, ip_idx);
4096 dbg_lex_done("%s:%d done", __func__, __LINE__);
4099 #define zbc_parse_if(...) (zbc_parse_if(__VA_ARGS__) COMMA_SUCCESS)
4101 static BC_STATUS zbc_parse_while(BcParse *p)
4107 s = zbc_lex_next(&p->l);
4108 if (s) RETURN_STATUS(s);
4109 if (p->l.t.t != BC_LEX_LPAREN) RETURN_STATUS(bc_error_bad_token());
4110 s = zbc_lex_next(&p->l);
4111 if (s) RETURN_STATUS(s);
4113 cond_idx = p->func->labels.len;
4114 ip_idx = cond_idx + 1;
4116 bc_vec_push(&p->func->labels, &p->func->code.len);
4117 bc_vec_push(&p->conds, &cond_idx);
4119 bc_vec_push(&p->exits, &ip_idx);
4120 bc_vec_push(&p->func->labels, &ip_idx);
4122 s = zbc_parse_expr(p, BC_PARSE_REL);
4123 if (s) RETURN_STATUS(s);
4124 if (p->l.t.t != BC_LEX_RPAREN) RETURN_STATUS(bc_error_bad_token());
4126 bc_parse_pushJUMP_ZERO(p, ip_idx);
4128 s = zbc_parse_stmt_allow_NLINE_before(p, STRING_while);
4129 if (s) RETURN_STATUS(s);
4131 dbg_lex("%s:%d BC_INST_JUMP to %zd", __func__, __LINE__, cond_idx);
4132 bc_parse_pushJUMP(p, cond_idx);
4134 dbg_lex("%s:%d rewriting label-> %zd", __func__, __LINE__, p->func->code.len);
4135 rewrite_label_to_current(p, ip_idx);
4137 bc_vec_pop(&p->exits);
4138 bc_vec_pop(&p->conds);
4142 #define zbc_parse_while(...) (zbc_parse_while(__VA_ARGS__) COMMA_SUCCESS)
4144 static BC_STATUS zbc_parse_for(BcParse *p)
4147 size_t cond_idx, exit_idx, body_idx, update_idx;
4149 dbg_lex("%s:%d p->l.t.t:%d", __func__, __LINE__, p->l.t.t);
4150 s = zbc_lex_next(&p->l);
4151 if (s) RETURN_STATUS(s);
4152 if (p->l.t.t != BC_LEX_LPAREN) RETURN_STATUS(bc_error_bad_token());
4153 s = zbc_lex_next(&p->l);
4154 if (s) RETURN_STATUS(s);
4156 if (p->l.t.t != BC_LEX_SCOLON)
4157 s = zbc_parse_expr(p, 0);
4159 s = bc_POSIX_does_not_allow_empty_X_expression_in_for("init");
4161 if (s) RETURN_STATUS(s);
4162 if (p->l.t.t != BC_LEX_SCOLON) RETURN_STATUS(bc_error_bad_token());
4163 s = zbc_lex_next(&p->l);
4164 if (s) RETURN_STATUS(s);
4166 cond_idx = p->func->labels.len;
4167 update_idx = cond_idx + 1;
4168 body_idx = update_idx + 1;
4169 exit_idx = body_idx + 1;
4171 bc_vec_push(&p->func->labels, &p->func->code.len);
4173 if (p->l.t.t != BC_LEX_SCOLON)
4174 s = zbc_parse_expr(p, BC_PARSE_REL);
4176 s = bc_POSIX_does_not_allow_empty_X_expression_in_for("condition");
4178 if (s) RETURN_STATUS(s);
4179 if (p->l.t.t != BC_LEX_SCOLON) RETURN_STATUS(bc_error_bad_token());
4181 s = zbc_lex_next(&p->l);
4182 if (s) RETURN_STATUS(s);
4184 bc_parse_pushJUMP_ZERO(p, exit_idx);
4185 bc_parse_pushJUMP(p, body_idx);
4187 bc_vec_push(&p->conds, &update_idx);
4188 bc_vec_push(&p->func->labels, &p->func->code.len);
4190 if (p->l.t.t != BC_LEX_RPAREN)
4191 s = zbc_parse_expr(p, 0);
4193 s = bc_POSIX_does_not_allow_empty_X_expression_in_for("update");
4195 if (s) RETURN_STATUS(s);
4197 if (p->l.t.t != BC_LEX_RPAREN) RETURN_STATUS(bc_error_bad_token());
4198 bc_parse_pushJUMP(p, cond_idx);
4199 bc_vec_push(&p->func->labels, &p->func->code.len);
4201 bc_vec_push(&p->exits, &exit_idx);
4202 bc_vec_push(&p->func->labels, &exit_idx);
4204 s = zbc_parse_stmt_allow_NLINE_before(p, STRING_for);
4205 if (s) RETURN_STATUS(s);
4207 dbg_lex("%s:%d BC_INST_JUMP to %zd", __func__, __LINE__, update_idx);
4208 bc_parse_pushJUMP(p, update_idx);
4210 dbg_lex("%s:%d rewriting label-> %zd", __func__, __LINE__, p->func->code.len);
4211 rewrite_label_to_current(p, exit_idx);
4213 bc_vec_pop(&p->exits);
4214 bc_vec_pop(&p->conds);
4216 RETURN_STATUS(BC_STATUS_SUCCESS);
4218 #define zbc_parse_for(...) (zbc_parse_for(__VA_ARGS__) COMMA_SUCCESS)
4220 static BC_STATUS zbc_parse_break_or_continue(BcParse *p, BcLexType type)
4225 if (type == BC_LEX_KEY_BREAK) {
4226 if (p->exits.len == 0) // none of the enclosing blocks is a loop
4227 RETURN_STATUS(bc_error_bad_token());
4228 i = *(size_t*)bc_vec_top(&p->exits);
4230 i = *(size_t*)bc_vec_top(&p->conds);
4233 bc_parse_pushJUMP(p, i);
4235 s = zbc_lex_next(&p->l);
4236 if (s) RETURN_STATUS(s);
4238 if (p->l.t.t != BC_LEX_SCOLON && p->l.t.t != BC_LEX_NLINE)
4239 RETURN_STATUS(bc_error_bad_token());
4241 RETURN_STATUS(zbc_lex_next(&p->l));
4243 #define zbc_parse_break_or_continue(...) (zbc_parse_break_or_continue(__VA_ARGS__) COMMA_SUCCESS)
4245 static BC_STATUS zbc_parse_funcdef(BcParse *p)
4248 bool var, comma = false;
4251 dbg_lex_enter("%s:%d entered", __func__, __LINE__);
4252 s = zbc_lex_next(&p->l);
4253 if (s) RETURN_STATUS(s);
4254 if (p->l.t.t != BC_LEX_NAME)
4255 RETURN_STATUS(bc_error("bad function definition"));
4257 name = xstrdup(p->l.t.v.v);
4258 bc_parse_addFunc(p, name, &p->fidx);
4260 s = zbc_lex_next(&p->l);
4261 if (s) RETURN_STATUS(s);
4262 if (p->l.t.t != BC_LEX_LPAREN)
4263 RETURN_STATUS(bc_error("bad function definition"));
4264 s = zbc_lex_next(&p->l);
4265 if (s) RETURN_STATUS(s);
4267 while (p->l.t.t != BC_LEX_RPAREN) {
4268 if (p->l.t.t != BC_LEX_NAME)
4269 RETURN_STATUS(bc_error("bad function definition"));
4273 name = xstrdup(p->l.t.v.v);
4274 s = zbc_lex_next(&p->l);
4277 var = p->l.t.t != BC_LEX_LBRACKET;
4280 s = zbc_lex_next(&p->l);
4283 if (p->l.t.t != BC_LEX_RBRACKET) {
4284 s = bc_error("bad function definition");
4288 s = zbc_lex_next(&p->l);
4292 comma = p->l.t.t == BC_LEX_COMMA;
4294 s = zbc_lex_next(&p->l);
4298 s = zbc_func_insert(p->func, name, var);
4302 if (comma) RETURN_STATUS(bc_error("bad function definition"));
4304 s = zbc_lex_next(&p->l);
4305 if (s) RETURN_STATUS(s);
4307 if (p->l.t.t != BC_LEX_LBRACE)
4308 s = bc_POSIX_requires("the left brace be on the same line as the function header");
4310 // Prevent "define z()<newline>" from being interpreted as function with empty stmt as body
4311 s = zbc_lex_skip_if_at_NLINE(&p->l);
4312 if (s) RETURN_STATUS(s);
4313 //GNU bc requires a {} block even if function body has single stmt, enforce this?
4314 if (p->l.t.t != BC_LEX_LBRACE)
4315 RETURN_STATUS(bc_error("function { body } expected"));
4317 p->in_funcdef++; // to determine whether "return" stmt is allowed, and such
4318 s = zbc_parse_stmt_possibly_auto(p, true);
4320 if (s) RETURN_STATUS(s);
4322 bc_parse_push(p, BC_INST_RET0);
4323 bc_parse_updateFunc(p, BC_PROG_MAIN);
4325 dbg_lex_done("%s:%d done", __func__, __LINE__);
4329 dbg_lex_done("%s:%d done (error)", __func__, __LINE__);
4333 #define zbc_parse_funcdef(...) (zbc_parse_funcdef(__VA_ARGS__) COMMA_SUCCESS)
4335 static BC_STATUS zbc_parse_auto(BcParse *p)
4338 bool comma, var, one;
4341 dbg_lex_enter("%s:%d entered", __func__, __LINE__);
4342 s = zbc_lex_next(&p->l);
4343 if (s) RETURN_STATUS(s);
4346 one = p->l.t.t == BC_LEX_NAME;
4348 while (p->l.t.t == BC_LEX_NAME) {
4349 name = xstrdup(p->l.t.v.v);
4350 s = zbc_lex_next(&p->l);
4353 var = p->l.t.t != BC_LEX_LBRACKET;
4355 s = zbc_lex_next(&p->l);
4358 if (p->l.t.t != BC_LEX_RBRACKET) {
4359 s = bc_error("bad function definition");
4363 s = zbc_lex_next(&p->l);
4367 comma = p->l.t.t == BC_LEX_COMMA;
4369 s = zbc_lex_next(&p->l);
4373 s = zbc_func_insert(p->func, name, var);
4377 if (comma) RETURN_STATUS(bc_error("bad function definition"));
4378 if (!one) RETURN_STATUS(bc_error("no auto variable found"));
4380 if (p->l.t.t != BC_LEX_NLINE && p->l.t.t != BC_LEX_SCOLON)
4381 RETURN_STATUS(bc_error_bad_token());
4383 dbg_lex_done("%s:%d done", __func__, __LINE__);
4384 RETURN_STATUS(zbc_lex_next(&p->l));
4388 dbg_lex_done("%s:%d done (ERROR)", __func__, __LINE__);
4391 #define zbc_parse_auto(...) (zbc_parse_auto(__VA_ARGS__) COMMA_SUCCESS)
4393 #undef zbc_parse_stmt_possibly_auto
4394 static BC_STATUS zbc_parse_stmt_possibly_auto(BcParse *p, bool auto_allowed)
4396 BcStatus s = BC_STATUS_SUCCESS;
4398 dbg_lex_enter("%s:%d entered, p->l.t.t:%d", __func__, __LINE__, p->l.t.t);
4400 if (p->l.t.t == BC_LEX_NLINE) {
4401 dbg_lex_done("%s:%d done (seen BC_LEX_NLINE)", __func__, __LINE__);
4402 RETURN_STATUS(zbc_lex_next(&p->l));
4404 if (p->l.t.t == BC_LEX_SCOLON) {
4405 dbg_lex_done("%s:%d done (seen BC_LEX_SCOLON)", __func__, __LINE__);
4406 RETURN_STATUS(zbc_lex_next(&p->l));
4409 if (p->l.t.t == BC_LEX_LBRACE) {
4410 dbg_lex("%s:%d BC_LEX_LBRACE: (auto_allowed:%d)", __func__, __LINE__, auto_allowed);
4412 s = zbc_lex_next(&p->l);
4413 if (s) RETURN_STATUS(s);
4414 } while (p->l.t.t == BC_LEX_NLINE);
4415 if (auto_allowed && p->l.t.t == BC_LEX_KEY_AUTO) {
4416 dbg_lex("%s:%d calling zbc_parse_auto()", __func__, __LINE__);
4417 s = zbc_parse_auto(p);
4418 if (s) RETURN_STATUS(s);
4420 while (p->l.t.t != BC_LEX_RBRACE) {
4421 dbg_lex("%s:%d block parsing loop", __func__, __LINE__);
4422 s = zbc_parse_stmt(p);
4423 if (s) RETURN_STATUS(s);
4425 s = zbc_lex_next(&p->l);
4426 dbg_lex_done("%s:%d done (seen BC_LEX_RBRACE)", __func__, __LINE__);
4430 dbg_lex("%s:%d p->l.t.t:%d", __func__, __LINE__, p->l.t.t);
4434 case BC_LEX_OP_MINUS:
4435 case BC_LEX_OP_BOOL_NOT:
4439 case BC_LEX_KEY_IBASE:
4440 case BC_LEX_KEY_LAST:
4441 case BC_LEX_KEY_LENGTH:
4442 case BC_LEX_KEY_OBASE:
4443 case BC_LEX_KEY_READ:
4444 case BC_LEX_KEY_SCALE:
4445 case BC_LEX_KEY_SQRT:
4446 s = zbc_parse_expr(p, BC_PARSE_PRINT);
4449 s = zbc_parse_string(p, BC_INST_PRINT_STR);
4451 case BC_LEX_KEY_BREAK:
4452 case BC_LEX_KEY_CONTINUE:
4453 s = zbc_parse_break_or_continue(p, p->l.t.t);
4455 case BC_LEX_KEY_FOR:
4456 s = zbc_parse_for(p);
4458 case BC_LEX_KEY_HALT:
4459 bc_parse_push(p, BC_INST_HALT);
4460 s = zbc_lex_next(&p->l);
4463 s = zbc_parse_if(p);
4465 case BC_LEX_KEY_LIMITS:
4466 // "limits" is a compile-time command,
4467 // the output is produced at _parse time_.
4469 "BC_BASE_MAX = "BC_MAX_OBASE_STR "\n"
4470 "BC_DIM_MAX = "BC_MAX_DIM_STR "\n"
4471 "BC_SCALE_MAX = "BC_MAX_SCALE_STR "\n"
4472 "BC_STRING_MAX = "BC_MAX_STRING_STR"\n"
4473 "BC_NAME_MAX = "BC_MAX_NAME_STR "\n"
4474 "BC_NUM_MAX = "BC_MAX_NUM_STR "\n"
4475 "MAX Exponent = "BC_MAX_EXP_STR "\n"
4476 "Number of vars = "BC_MAX_VARS_STR "\n"
4478 s = zbc_lex_next(&p->l);
4480 case BC_LEX_KEY_PRINT:
4481 s = zbc_parse_print(p);
4483 case BC_LEX_KEY_QUIT:
4484 // "quit" is a compile-time command. For example,
4485 // "if (0 == 1) quit" terminates when parsing the statement,
4486 // not when it is executed
4487 QUIT_OR_RETURN_TO_MAIN;
4488 case BC_LEX_KEY_RETURN:
4490 RETURN_STATUS(bc_error("'return' not in a function"));
4491 s = zbc_parse_return(p);
4493 case BC_LEX_KEY_WHILE:
4494 s = zbc_parse_while(p);
4497 s = bc_error_bad_token();
4501 if (s || G_interrupt) {
4503 s = BC_STATUS_FAILURE;
4506 dbg_lex_done("%s:%d done", __func__, __LINE__);
4509 #define zbc_parse_stmt_possibly_auto(...) (zbc_parse_stmt_possibly_auto(__VA_ARGS__) COMMA_SUCCESS)
4511 static BC_STATUS zbc_parse_stmt_or_funcdef(BcParse *p)
4515 dbg_lex_enter("%s:%d entered", __func__, __LINE__);
4516 if (p->l.t.t == BC_LEX_EOF)
4517 s = bc_error("end of file");
4518 else if (p->l.t.t == BC_LEX_KEY_DEFINE) {
4519 dbg_lex("%s:%d p->l.t.t:BC_LEX_KEY_DEFINE", __func__, __LINE__);
4520 s = zbc_parse_funcdef(p);
4522 dbg_lex("%s:%d p->l.t.t:%d (not BC_LEX_KEY_DEFINE)", __func__, __LINE__, p->l.t.t);
4523 s = zbc_parse_stmt(p);
4526 dbg_lex_done("%s:%d done", __func__, __LINE__);
4529 #define zbc_parse_stmt_or_funcdef(...) (zbc_parse_stmt_or_funcdef(__VA_ARGS__) COMMA_SUCCESS)
4531 // This is not a "z" function: can also return BC_STATUS_PARSE_EMPTY_EXP
4532 static BcStatus bc_parse_expr_empty_ok(BcParse *p, uint8_t flags)
4534 BcStatus s = BC_STATUS_SUCCESS;
4535 BcInst prev = BC_INST_PRINT;
4536 BcLexType top, t = p->l.t.t;
4537 size_t nexprs = 0, ops_bgn = p->ops.len;
4538 unsigned nparens, nrelops;
4539 bool paren_first, paren_expr, rprn, done, get_token, assign, bin_last;
4541 dbg_lex_enter("%s:%d entered", __func__, __LINE__);
4542 paren_first = p->l.t.t == BC_LEX_LPAREN;
4543 nparens = nrelops = 0;
4544 paren_expr = rprn = done = get_token = assign = false;
4547 for (; !G_interrupt && !s && !done && bc_parse_exprs(t); t = p->l.t.t) {
4553 s = zbc_parse_incdec(p, &prev, &paren_expr, &nexprs, flags);
4554 rprn = get_token = bin_last = false;
4558 case BC_LEX_OP_MINUS:
4560 s = zbc_parse_minus(p, &prev, ops_bgn, rprn, &nexprs);
4561 rprn = get_token = false;
4562 bin_last = prev == BC_INST_MINUS;
4566 case BC_LEX_OP_ASSIGN_POWER:
4567 case BC_LEX_OP_ASSIGN_MULTIPLY:
4568 case BC_LEX_OP_ASSIGN_DIVIDE:
4569 case BC_LEX_OP_ASSIGN_MODULUS:
4570 case BC_LEX_OP_ASSIGN_PLUS:
4571 case BC_LEX_OP_ASSIGN_MINUS:
4572 case BC_LEX_OP_ASSIGN:
4574 if (prev != BC_INST_VAR && prev != BC_INST_ARRAY_ELEM &&
4575 prev != BC_INST_SCALE && prev != BC_INST_IBASE &&
4576 prev != BC_INST_OBASE && prev != BC_INST_LAST)
4578 s = bc_error("bad assignment:"
4579 " left side must be variable"
4581 ); // note: shared string
4586 case BC_LEX_OP_POWER:
4587 case BC_LEX_OP_MULTIPLY:
4588 case BC_LEX_OP_DIVIDE:
4589 case BC_LEX_OP_MODULUS:
4590 case BC_LEX_OP_PLUS:
4591 case BC_LEX_OP_REL_EQ:
4592 case BC_LEX_OP_REL_LE:
4593 case BC_LEX_OP_REL_GE:
4594 case BC_LEX_OP_REL_NE:
4595 case BC_LEX_OP_REL_LT:
4596 case BC_LEX_OP_REL_GT:
4597 case BC_LEX_OP_BOOL_NOT:
4598 case BC_LEX_OP_BOOL_OR:
4599 case BC_LEX_OP_BOOL_AND:
4601 if (((t == BC_LEX_OP_BOOL_NOT) != bin_last)
4602 || (t != BC_LEX_OP_BOOL_NOT && prev == BC_INST_BOOL_NOT)
4604 return bc_error_bad_expression();
4607 nrelops += t >= BC_LEX_OP_REL_EQ && t <= BC_LEX_OP_REL_GT;
4608 prev = BC_TOKEN_2_INST(t);
4609 bc_parse_operator(p, t, ops_bgn, &nexprs);
4610 s = zbc_lex_next(&p->l);
4611 rprn = get_token = false;
4612 bin_last = t != BC_LEX_OP_BOOL_NOT;
4619 if (BC_PARSE_LEAF(prev, rprn))
4620 return bc_error_bad_expression();
4622 paren_expr = rprn = bin_last = false;
4624 bc_vec_push(&p->ops, &t);
4631 if (bin_last || prev == BC_INST_BOOL_NOT)
4632 return bc_error_bad_expression();
4635 s = BC_STATUS_SUCCESS;
4640 else if (!paren_expr) {
4641 dbg_lex_done("%s:%d done (returning EMPTY_EXP)", __func__, __LINE__);
4642 return BC_STATUS_PARSE_EMPTY_EXP;
4646 paren_expr = rprn = true;
4647 get_token = bin_last = false;
4649 s = zbc_parse_rightParen(p, ops_bgn, &nexprs);
4656 if (BC_PARSE_LEAF(prev, rprn))
4657 return bc_error_bad_expression();
4659 rprn = get_token = bin_last = false;
4660 s = zbc_parse_name(p, &prev, flags & ~BC_PARSE_NOCALL);
4668 if (BC_PARSE_LEAF(prev, rprn))
4669 return bc_error_bad_expression();
4673 paren_expr = get_token = true;
4674 rprn = bin_last = false;
4679 case BC_LEX_KEY_IBASE:
4680 case BC_LEX_KEY_LAST:
4681 case BC_LEX_KEY_OBASE:
4683 if (BC_PARSE_LEAF(prev, rprn))
4684 return bc_error_bad_expression();
4685 prev = (char) (t - BC_LEX_KEY_IBASE + BC_INST_IBASE);
4686 bc_parse_push(p, (char) prev);
4688 paren_expr = get_token = true;
4689 rprn = bin_last = false;
4695 case BC_LEX_KEY_LENGTH:
4696 case BC_LEX_KEY_SQRT:
4698 if (BC_PARSE_LEAF(prev, rprn))
4699 return bc_error_bad_expression();
4700 s = zbc_parse_builtin(p, t, flags, &prev);
4702 rprn = get_token = bin_last = false;
4708 case BC_LEX_KEY_READ:
4710 if (BC_PARSE_LEAF(prev, rprn))
4711 return bc_error_bad_expression();
4712 else if (flags & BC_PARSE_NOREAD)
4713 s = bc_error_nested_read_call();
4715 s = zbc_parse_read(p);
4718 rprn = get_token = bin_last = false;
4720 prev = BC_INST_READ;
4725 case BC_LEX_KEY_SCALE:
4727 if (BC_PARSE_LEAF(prev, rprn))
4728 return bc_error_bad_expression();
4729 s = zbc_parse_scale(p, &prev, flags);
4731 rprn = get_token = bin_last = false;
4733 prev = BC_INST_SCALE;
4740 s = bc_error_bad_token();
4745 if (!s && get_token) s = zbc_lex_next(&p->l);
4749 if (G_interrupt) return BC_STATUS_FAILURE; // ^C: stop parsing
4751 while (p->ops.len > ops_bgn) {
4753 top = BC_PARSE_TOP_OP(p);
4754 assign = top >= BC_LEX_OP_ASSIGN_POWER && top <= BC_LEX_OP_ASSIGN;
4756 if (top == BC_LEX_LPAREN || top == BC_LEX_RPAREN)
4757 return bc_error_bad_expression();
4759 bc_parse_push(p, BC_TOKEN_2_INST(top));
4761 nexprs -= top != BC_LEX_OP_BOOL_NOT && top != BC_LEX_NEG;
4762 bc_vec_pop(&p->ops);
4765 if (prev == BC_INST_BOOL_NOT || nexprs != 1)
4766 return bc_error_bad_expression();
4768 if (!(flags & BC_PARSE_REL) && nrelops) {
4769 s = bc_POSIX_does_not_allow("comparison operators outside if or loops");
4770 IF_ERROR_RETURN_POSSIBLE(if (s) return s);
4772 else if ((flags & BC_PARSE_REL) && nrelops > 1) {
4773 s = bc_POSIX_requires("exactly one comparison operator per condition");
4774 IF_ERROR_RETURN_POSSIBLE(if (s) return s);
4777 if (flags & BC_PARSE_PRINT) {
4778 if (paren_first || !assign) bc_parse_push(p, BC_INST_PRINT);
4779 bc_parse_push(p, BC_INST_POP);
4782 dbg_lex_done("%s:%d done", __func__, __LINE__);
4790 static BC_STATUS zdc_parse_register(BcParse *p)
4794 s = zbc_lex_next(&p->l);
4795 if (s) RETURN_STATUS(s);
4796 if (p->l.t.t != BC_LEX_NAME) RETURN_STATUS(bc_error_bad_token());
4798 bc_parse_pushName(p, p->l.t.v.v);
4802 #define zdc_parse_register(...) (zdc_parse_register(__VA_ARGS__) COMMA_SUCCESS)
4804 static BC_STATUS zdc_parse_string(BcParse *p)
4807 size_t idx, len = G.prog.strs.len;
4809 //why pad to 32 zeros??
4810 name = xasprintf("%032lu", (unsigned long)len);
4812 str = xstrdup(p->l.t.v.v);
4813 bc_parse_push(p, BC_INST_STR);
4814 bc_parse_pushIndex(p, len);
4815 bc_vec_push(&G.prog.strs, &str);
4816 bc_parse_addFunc(p, name, &idx);
4818 RETURN_STATUS(zbc_lex_next(&p->l));
4820 #define zdc_parse_string(...) (zdc_parse_string(__VA_ARGS__) COMMA_SUCCESS)
4822 static BC_STATUS zdc_parse_mem(BcParse *p, uint8_t inst, bool name, bool store)
4826 bc_parse_push(p, inst);
4828 s = zdc_parse_register(p);
4829 if (s) RETURN_STATUS(s);
4833 bc_parse_push(p, BC_INST_SWAP);
4834 bc_parse_push(p, BC_INST_ASSIGN);
4835 bc_parse_push(p, BC_INST_POP);
4838 RETURN_STATUS(zbc_lex_next(&p->l));
4840 #define zdc_parse_mem(...) (zdc_parse_mem(__VA_ARGS__) COMMA_SUCCESS)
4842 static BC_STATUS zdc_parse_cond(BcParse *p, uint8_t inst)
4846 bc_parse_push(p, inst);
4847 bc_parse_push(p, BC_INST_EXEC_COND);
4849 s = zdc_parse_register(p);
4850 if (s) RETURN_STATUS(s);
4852 s = zbc_lex_next(&p->l);
4853 if (s) RETURN_STATUS(s);
4855 if (p->l.t.t == BC_LEX_ELSE) {
4856 s = zdc_parse_register(p);
4857 if (s) RETURN_STATUS(s);
4858 s = zbc_lex_next(&p->l);
4861 bc_parse_push(p, BC_PARSE_STREND);
4865 #define zdc_parse_cond(...) (zdc_parse_cond(__VA_ARGS__) COMMA_SUCCESS)
4867 static BC_STATUS zdc_parse_token(BcParse *p, BcLexType t, uint8_t flags)
4869 BcStatus s = BC_STATUS_SUCCESS;
4871 bool assign, get_token = false;
4874 case BC_LEX_OP_REL_EQ:
4875 case BC_LEX_OP_REL_LE:
4876 case BC_LEX_OP_REL_GE:
4877 case BC_LEX_OP_REL_NE:
4878 case BC_LEX_OP_REL_LT:
4879 case BC_LEX_OP_REL_GT:
4880 s = zdc_parse_cond(p, t - BC_LEX_OP_REL_EQ + BC_INST_REL_EQ);
4884 s = zdc_parse_mem(p, BC_INST_ARRAY_ELEM, true, t == BC_LEX_COLON);
4887 s = zdc_parse_string(p);
4891 if (t == BC_LEX_NEG) {
4892 s = zbc_lex_next(&p->l);
4893 if (s) RETURN_STATUS(s);
4894 if (p->l.t.t != BC_LEX_NUMBER)
4895 RETURN_STATUS(bc_error_bad_token());
4898 if (t == BC_LEX_NEG) bc_parse_push(p, BC_INST_NEG);
4901 case BC_LEX_KEY_READ:
4902 if (flags & BC_PARSE_NOREAD)
4903 s = bc_error_nested_read_call();
4905 bc_parse_push(p, BC_INST_READ);
4908 case BC_LEX_OP_ASSIGN:
4909 case BC_LEX_STORE_PUSH:
4910 assign = t == BC_LEX_OP_ASSIGN;
4911 inst = assign ? BC_INST_VAR : BC_INST_PUSH_TO_VAR;
4912 s = zdc_parse_mem(p, inst, true, assign);
4915 case BC_LEX_LOAD_POP:
4916 inst = t == BC_LEX_LOAD_POP ? BC_INST_PUSH_VAR : BC_INST_LOAD;
4917 s = zdc_parse_mem(p, inst, true, false);
4919 case BC_LEX_STORE_IBASE:
4920 case BC_LEX_STORE_SCALE:
4921 case BC_LEX_STORE_OBASE:
4922 inst = t - BC_LEX_STORE_IBASE + BC_INST_IBASE;
4923 s = zdc_parse_mem(p, inst, false, true);
4926 s = bc_error_bad_token();
4931 if (!s && get_token) s = zbc_lex_next(&p->l);
4935 #define zdc_parse_token(...) (zdc_parse_token(__VA_ARGS__) COMMA_SUCCESS)
4937 static BC_STATUS zdc_parse_expr(BcParse *p, uint8_t flags)
4939 BcStatus s = BC_STATUS_SUCCESS;
4943 for (t = p->l.t.t; !s && t != BC_LEX_EOF; t = p->l.t.t) {
4944 inst = dc_parse_insts[t];
4946 if (inst != BC_INST_INVALID) {
4947 bc_parse_push(p, inst);
4948 s = zbc_lex_next(&p->l);
4950 s = zdc_parse_token(p, t, flags);
4953 if (!s && p->l.t.t == BC_LEX_EOF && (flags & BC_PARSE_NOCALL))
4954 bc_parse_push(p, BC_INST_POP_EXEC);
4958 #define zdc_parse_expr(...) (zdc_parse_expr(__VA_ARGS__) COMMA_SUCCESS)
4960 static BC_STATUS zdc_parse_parse(BcParse *p)
4964 if (p->l.t.t == BC_LEX_EOF)
4965 s = bc_error("end of file");
4967 s = zdc_parse_expr(p, 0);
4969 if (s || G_interrupt) {
4971 s = BC_STATUS_FAILURE;
4976 #define zdc_parse_parse(...) (zdc_parse_parse(__VA_ARGS__) COMMA_SUCCESS)
4980 static BC_STATUS zcommon_parse_expr(BcParse *p, uint8_t flags)
4983 IF_BC(RETURN_STATUS(zbc_parse_expr(p, flags)));
4985 IF_DC(RETURN_STATUS(zdc_parse_expr(p, flags)));
4988 #define zcommon_parse_expr(...) (zcommon_parse_expr(__VA_ARGS__) COMMA_SUCCESS)
4990 static BcVec* bc_program_search(char *id, bool var)
4998 v = var ? &G.prog.vars : &G.prog.arrs;
4999 map = var ? &G.prog.var_map : &G.prog.arr_map;
5003 new = bc_map_insert(map, &e, &i); // 1 if insertion was successful
5006 bc_array_init(&data.v, var);
5007 bc_vec_push(v, &data.v);
5010 ptr = bc_vec_item(map, i);
5011 if (new) ptr->name = xstrdup(e.name);
5012 return bc_vec_item(v, ptr->idx);
5015 static BC_STATUS zbc_program_num(BcResult *r, BcNum **num, bool hex)
5020 case BC_RESULT_TEMP:
5021 case BC_RESULT_IBASE:
5022 case BC_RESULT_SCALE:
5023 case BC_RESULT_OBASE:
5029 case BC_RESULT_CONSTANT:
5032 char **str = bc_vec_item(&G.prog.consts, r->d.id.idx);
5034 size_t len = strlen(*str);
5036 bc_num_init(&r->d.n, len);
5038 hex = hex && len == 1;
5039 base_t = hex ? 16 : G.prog.ib_t;
5040 s = zbc_num_parse(&r->d.n, *str, base_t);
5043 bc_num_free(&r->d.n);
5048 r->t = BC_RESULT_TEMP;
5054 case BC_RESULT_ARRAY:
5055 case BC_RESULT_ARRAY_ELEM:
5059 v = bc_program_search(r->d.id.name, r->t == BC_RESULT_VAR);
5061 if (r->t == BC_RESULT_ARRAY_ELEM) {
5063 if (v->len <= r->d.id.idx) bc_array_expand(v, r->d.id.idx + 1);
5064 *num = bc_vec_item(v, r->d.id.idx);
5067 *num = bc_vec_top(v);
5072 case BC_RESULT_LAST:
5074 *num = &G.prog.last;
5085 RETURN_STATUS(BC_STATUS_SUCCESS);
5087 #define zbc_program_num(...) (zbc_program_num(__VA_ARGS__) COMMA_SUCCESS)
5089 static BC_STATUS zbc_program_binOpPrep(BcResult **l, BcNum **ln,
5090 BcResult **r, BcNum **rn, bool assign)
5094 BcResultType lt, rt;
5096 if (!BC_PROG_STACK(&G.prog.results, 2))
5097 RETURN_STATUS(bc_error_stack_has_too_few_elements());
5099 *r = bc_vec_item_rev(&G.prog.results, 0);
5100 *l = bc_vec_item_rev(&G.prog.results, 1);
5104 hex = assign && (lt == BC_RESULT_IBASE || lt == BC_RESULT_OBASE);
5106 s = zbc_program_num(*l, ln, false);
5107 if (s) RETURN_STATUS(s);
5108 s = zbc_program_num(*r, rn, hex);
5109 if (s) RETURN_STATUS(s);
5111 // We run this again under these conditions in case any vector has been
5112 // reallocated out from under the BcNums or arrays we had.
5113 if (lt == rt && (lt == BC_RESULT_VAR || lt == BC_RESULT_ARRAY_ELEM)) {
5114 s = zbc_program_num(*l, ln, false);
5115 if (s) RETURN_STATUS(s);
5118 if (!BC_PROG_NUM((*l), (*ln)) && (!assign || (*l)->t != BC_RESULT_VAR))
5119 RETURN_STATUS(bc_error_variable_is_wrong_type());
5120 if (!assign && !BC_PROG_NUM((*r), (*ln)))
5121 RETURN_STATUS(bc_error_variable_is_wrong_type());
5125 #define zbc_program_binOpPrep(...) (zbc_program_binOpPrep(__VA_ARGS__) COMMA_SUCCESS)
5127 static void bc_program_binOpRetire(BcResult *r)
5129 r->t = BC_RESULT_TEMP;
5130 bc_vec_pop(&G.prog.results);
5131 bc_vec_pop(&G.prog.results);
5132 bc_vec_push(&G.prog.results, r);
5135 static BC_STATUS zbc_program_prep(BcResult **r, BcNum **n)
5139 if (!BC_PROG_STACK(&G.prog.results, 1))
5140 RETURN_STATUS(bc_error_stack_has_too_few_elements());
5141 *r = bc_vec_top(&G.prog.results);
5143 s = zbc_program_num(*r, n, false);
5144 if (s) RETURN_STATUS(s);
5146 if (!BC_PROG_NUM((*r), (*n)))
5147 RETURN_STATUS(bc_error_variable_is_wrong_type());
5151 #define zbc_program_prep(...) (zbc_program_prep(__VA_ARGS__) COMMA_SUCCESS)
5153 static void bc_program_retire(BcResult *r, BcResultType t)
5156 bc_vec_pop(&G.prog.results);
5157 bc_vec_push(&G.prog.results, r);
5160 static BC_STATUS zbc_program_op(char inst)
5163 BcResult *opd1, *opd2, res;
5164 BcNum *n1, *n2 = NULL;
5166 s = zbc_program_binOpPrep(&opd1, &n1, &opd2, &n2, false);
5167 if (s) RETURN_STATUS(s);
5168 bc_num_init_DEF_SIZE(&res.d.n);
5170 s = BC_STATUS_SUCCESS;
5171 IF_ERROR_RETURN_POSSIBLE(s =) zbc_program_ops[inst - BC_INST_POWER](n1, n2, &res.d.n, G.prog.scale);
5173 bc_program_binOpRetire(&res);
5178 bc_num_free(&res.d.n);
5181 #define zbc_program_op(...) (zbc_program_op(__VA_ARGS__) COMMA_SUCCESS)
5183 static BC_STATUS zbc_program_read(void)
5185 const char *sv_file;
5193 RETURN_STATUS(bc_error_nested_read_call());
5195 f = bc_program_func(BC_PROG_READ);
5196 bc_vec_pop_all(&f->code);
5198 sv_file = G.prog.file;
5202 bc_char_vec_init(&buf);
5203 bc_read_line(&buf, stdin);
5205 bc_parse_create(&parse, BC_PROG_READ);
5206 bc_lex_file(&parse.l);
5208 s = zbc_parse_text_init(&parse, buf.v);
5209 if (s) goto exec_err;
5210 s = zcommon_parse_expr(&parse, BC_PARSE_NOREAD);
5211 if (s) goto exec_err;
5213 if (parse.l.t.t != BC_LEX_NLINE && parse.l.t.t != BC_LEX_EOF) {
5214 s = bc_error("bad read() expression");
5218 ip.func = BC_PROG_READ;
5220 ip.len = G.prog.results.len;
5222 // Update this pointer, just in case.
5223 f = bc_program_func(BC_PROG_READ);
5225 bc_vec_pushByte(&f->code, BC_INST_POP_EXEC);
5226 bc_vec_push(&G.prog.stack, &ip);
5229 bc_parse_free(&parse);
5231 G.prog.file = sv_file;
5235 #define zbc_program_read(...) (zbc_program_read(__VA_ARGS__) COMMA_SUCCESS)
5237 static size_t bc_program_index(char *code, size_t *bgn)
5239 char amt = code[(*bgn)++], i = 0;
5242 for (; i < amt; ++i, ++(*bgn))
5243 res |= (((size_t)((int) code[*bgn]) & UCHAR_MAX) << (i * CHAR_BIT));
5248 static char *bc_program_name(char *code, size_t *bgn)
5251 char *s, *str = code + *bgn, *ptr = strchr(str, BC_PARSE_STREND);
5253 s = xmalloc(ptr - str + 1);
5256 char c = code[(*bgn)++];
5257 if (c == '\0' || c == BC_PARSE_STREND)
5266 static void bc_program_printString(const char *str)
5270 // Example: echo '[]ap' | dc
5271 // should print two bytes: 0x00, 0x0A
5278 if (c != '\\' || !*str)
5298 G.prog.nchars = SIZE_MAX;
5310 // Just print the backslash and following character.
5321 static void bc_num_printNewline(void)
5323 if (G.prog.nchars == G.prog.len - 1) {
5331 static FAST_FUNC void bc_num_printChar(size_t num, size_t width, bool radix)
5334 bb_putchar((char) num);
5335 G.prog.nchars += width;
5339 static FAST_FUNC void bc_num_printDigits(size_t num, size_t width, bool radix)
5343 bc_num_printNewline();
5344 bb_putchar(radix ? '.' : ' ');
5347 bc_num_printNewline();
5348 for (exp = 0, pow = 1; exp < width - 1; ++exp, pow *= 10)
5351 for (exp = 0; exp < width; pow /= 10, ++G.prog.nchars, ++exp) {
5353 bc_num_printNewline();
5356 bb_putchar(((char) dig) + '0');
5360 static FAST_FUNC void bc_num_printHex(size_t num, size_t width, bool radix)
5363 bc_num_printNewline();
5368 bc_num_printNewline();
5369 bb_putchar(bb_hexdigits_upcase[num]);
5370 G.prog.nchars += width;
5373 static void bc_num_printDecimal(BcNum *n)
5375 size_t i, rdx = n->rdx - 1;
5377 if (n->neg) bb_putchar('-');
5378 G.prog.nchars += n->neg;
5380 for (i = n->len - 1; i < n->len; --i)
5381 bc_num_printHex((size_t) n->num[i], 1, i == rdx);
5384 static BC_STATUS zbc_num_printNum(BcNum *n, BcNum *base, size_t width, BcNumDigitOp print)
5388 BcNum intp, fracp, digit, frac_len;
5389 unsigned long dig, *ptr;
5394 print(0, width, false);
5395 RETURN_STATUS(BC_STATUS_SUCCESS);
5398 bc_vec_init(&stack, sizeof(long), NULL);
5399 bc_num_init(&intp, n->len);
5400 bc_num_init(&fracp, n->rdx);
5401 bc_num_init(&digit, width);
5402 bc_num_init(&frac_len, BC_NUM_INT(n));
5403 bc_num_copy(&intp, n);
5404 bc_num_one(&frac_len);
5406 bc_num_truncate(&intp, intp.rdx);
5407 s = zbc_num_sub(n, &intp, &fracp, 0);
5410 while (intp.len != 0) {
5411 s = zbc_num_divmod(&intp, base, &intp, &digit, 0);
5413 s = zbc_num_ulong(&digit, &dig);
5415 bc_vec_push(&stack, &dig);
5418 for (i = 0; i < stack.len; ++i) {
5419 ptr = bc_vec_item_rev(&stack, i);
5420 print(*ptr, width, false);
5423 if (!n->rdx) goto err;
5425 for (radix = true; frac_len.len <= n->rdx; radix = false) {
5426 s = zbc_num_mul(&fracp, base, &fracp, n->rdx);
5428 s = zbc_num_ulong(&fracp, &dig);
5430 bc_num_ulong2num(&intp, dig);
5431 s = zbc_num_sub(&fracp, &intp, &fracp, 0);
5433 print(dig, width, radix);
5434 s = zbc_num_mul(&frac_len, base, &frac_len, 0);
5439 bc_num_free(&frac_len);
5440 bc_num_free(&digit);
5441 bc_num_free(&fracp);
5443 bc_vec_free(&stack);
5446 #define zbc_num_printNum(...) (zbc_num_printNum(__VA_ARGS__) COMMA_SUCCESS)
5448 static BC_STATUS zbc_num_printBase(BcNum *n)
5462 if (G.prog.ob_t <= BC_NUM_MAX_IBASE) {
5464 print = bc_num_printHex;
5466 unsigned i = G.prog.ob_t - 1;
5474 print = bc_num_printDigits;
5477 s = zbc_num_printNum(n, &G.prog.ob, width, print);
5482 #define zbc_num_printBase(...) (zbc_num_printBase(__VA_ARGS__) COMMA_SUCCESS)
5484 static BC_STATUS zbc_num_print(BcNum *n, bool newline)
5486 BcStatus s = BC_STATUS_SUCCESS;
5488 bc_num_printNewline();
5493 } else if (G.prog.ob_t == 10)
5494 bc_num_printDecimal(n);
5496 s = zbc_num_printBase(n);
5505 #define zbc_num_print(...) (zbc_num_print(__VA_ARGS__) COMMA_SUCCESS)
5507 static BC_STATUS zbc_program_print(char inst, size_t idx)
5512 bool pop = inst != BC_INST_PRINT;
5514 if (!BC_PROG_STACK(&G.prog.results, idx + 1))
5515 RETURN_STATUS(bc_error_stack_has_too_few_elements());
5517 r = bc_vec_item_rev(&G.prog.results, idx);
5518 num = NULL; // is this NULL necessary?
5519 s = zbc_program_num(r, &num, false);
5520 if (s) RETURN_STATUS(s);
5522 if (BC_PROG_NUM(r, num)) {
5523 s = zbc_num_print(num, !pop);
5524 if (!s) bc_num_copy(&G.prog.last, num);
5529 idx = (r->t == BC_RESULT_STR) ? r->d.id.idx : num->rdx;
5530 str = *bc_program_str(idx);
5532 if (inst == BC_INST_PRINT_STR) {
5535 if (c == '\0') break;
5538 if (c == '\n') G.prog.nchars = 0;
5542 bc_program_printString(str);
5543 if (inst == BC_INST_PRINT) bb_putchar('\n');
5547 if (!s && pop) bc_vec_pop(&G.prog.results);
5551 #define zbc_program_print(...) (zbc_program_print(__VA_ARGS__) COMMA_SUCCESS)
5553 static BC_STATUS zbc_program_negate(void)
5559 s = zbc_program_prep(&ptr, &num);
5560 if (s) RETURN_STATUS(s);
5562 bc_num_init(&res.d.n, num->len);
5563 bc_num_copy(&res.d.n, num);
5564 if (res.d.n.len) res.d.n.neg = !res.d.n.neg;
5566 bc_program_retire(&res, BC_RESULT_TEMP);
5570 #define zbc_program_negate(...) (zbc_program_negate(__VA_ARGS__) COMMA_SUCCESS)
5572 static BC_STATUS zbc_program_logical(char inst)
5575 BcResult *opd1, *opd2, res;
5579 s = zbc_program_binOpPrep(&opd1, &n1, &opd2, &n2, false);
5580 if (s) RETURN_STATUS(s);
5582 bc_num_init_DEF_SIZE(&res.d.n);
5584 if (inst == BC_INST_BOOL_AND)
5585 cond = bc_num_cmp(n1, &G.prog.zero) && bc_num_cmp(n2, &G.prog.zero);
5586 else if (inst == BC_INST_BOOL_OR)
5587 cond = bc_num_cmp(n1, &G.prog.zero) || bc_num_cmp(n2, &G.prog.zero);
5589 cond = bc_num_cmp(n1, n2);
5591 case BC_INST_REL_EQ:
5594 case BC_INST_REL_LE:
5597 case BC_INST_REL_GE:
5600 case BC_INST_REL_LT:
5603 case BC_INST_REL_GT:
5606 default: // = case BC_INST_REL_NE:
5607 //cond = (cond != 0); - not needed
5612 if (cond) bc_num_one(&res.d.n);
5613 //else bc_num_zero(&res.d.n); - already is
5615 bc_program_binOpRetire(&res);
5619 #define zbc_program_logical(...) (zbc_program_logical(__VA_ARGS__) COMMA_SUCCESS)
5622 static BC_STATUS zbc_program_assignStr(BcResult *r, BcVec *v,
5628 memset(&n2, 0, sizeof(BcNum));
5629 n2.rdx = res.d.id.idx = r->d.id.idx;
5630 res.t = BC_RESULT_STR;
5633 if (!BC_PROG_STACK(&G.prog.results, 2))
5634 RETURN_STATUS(bc_error_stack_has_too_few_elements());
5636 bc_vec_pop(&G.prog.results);
5639 bc_vec_pop(&G.prog.results);
5641 bc_vec_push(&G.prog.results, &res);
5642 bc_vec_push(v, &n2);
5644 RETURN_STATUS(BC_STATUS_SUCCESS);
5646 #define zbc_program_assignStr(...) (zbc_program_assignStr(__VA_ARGS__) COMMA_SUCCESS)
5649 static BC_STATUS zbc_program_copyToVar(char *name, bool var)
5656 if (!BC_PROG_STACK(&G.prog.results, 1))
5657 RETURN_STATUS(bc_error_stack_has_too_few_elements());
5659 ptr = bc_vec_top(&G.prog.results);
5660 if ((ptr->t == BC_RESULT_ARRAY) != !var)
5661 RETURN_STATUS(bc_error_variable_is_wrong_type());
5662 v = bc_program_search(name, var);
5665 if (ptr->t == BC_RESULT_STR && !var)
5666 RETURN_STATUS(bc_error_variable_is_wrong_type());
5667 if (ptr->t == BC_RESULT_STR)
5668 RETURN_STATUS(zbc_program_assignStr(ptr, v, true));
5671 s = zbc_program_num(ptr, &n, false);
5672 if (s) RETURN_STATUS(s);
5674 // Do this once more to make sure that pointers were not invalidated.
5675 v = bc_program_search(name, var);
5678 bc_num_init_DEF_SIZE(&r.d.n);
5679 bc_num_copy(&r.d.n, n);
5682 bc_array_init(&r.d.v, true);
5683 bc_array_copy(&r.d.v, (BcVec *) n);
5686 bc_vec_push(v, &r.d);
5687 bc_vec_pop(&G.prog.results);
5691 #define zbc_program_copyToVar(...) (zbc_program_copyToVar(__VA_ARGS__) COMMA_SUCCESS)
5693 static BC_STATUS zbc_program_assign(char inst)
5696 BcResult *left, *right, res;
5697 BcNum *l = NULL, *r = NULL;
5698 bool assign = inst == BC_INST_ASSIGN, ib, sc;
5700 s = zbc_program_binOpPrep(&left, &l, &right, &r, assign);
5701 if (s) RETURN_STATUS(s);
5703 ib = left->t == BC_RESULT_IBASE;
5704 sc = left->t == BC_RESULT_SCALE;
5708 if (right->t == BC_RESULT_STR) {
5712 if (left->t != BC_RESULT_VAR)
5713 RETURN_STATUS(bc_error_variable_is_wrong_type());
5714 v = bc_program_search(left->d.id.name, true);
5716 RETURN_STATUS(zbc_program_assignStr(right, v, false));
5720 if (left->t == BC_RESULT_CONSTANT || left->t == BC_RESULT_TEMP)
5721 RETURN_STATUS(bc_error("bad assignment:"
5722 " left side must be variable"
5724 )); // note: shared string
5727 if (inst == BC_INST_ASSIGN_DIVIDE && !bc_num_cmp(r, &G.prog.zero))
5728 RETURN_STATUS(bc_error("divide by zero"));
5733 s = BC_STATUS_SUCCESS;
5734 IF_ERROR_RETURN_POSSIBLE(s =) zbc_program_ops[inst - BC_INST_ASSIGN_POWER](l, r, l, G.prog.scale);
5736 if (s) RETURN_STATUS(s);
5741 if (ib || sc || left->t == BC_RESULT_OBASE) {
5742 static const char *const msg[] = {
5743 "bad ibase; must be [2,16]", //BC_RESULT_IBASE
5744 "bad scale; must be [0,"BC_MAX_SCALE_STR"]", //BC_RESULT_SCALE
5745 NULL, //can't happen //BC_RESULT_LAST
5746 NULL, //can't happen //BC_RESULT_CONSTANT
5747 NULL, //can't happen //BC_RESULT_ONE
5748 "bad obase; must be [2,"BC_MAX_OBASE_STR"]", //BC_RESULT_OBASE
5754 s = zbc_num_ulong(l, &val);
5755 if (s) RETURN_STATUS(s);
5756 s = left->t - BC_RESULT_IBASE;
5759 ptr = &G.prog.scale;
5762 RETURN_STATUS(bc_error(msg[s]));
5763 max = ib ? BC_NUM_MAX_IBASE : BC_MAX_OBASE;
5764 ptr = ib ? &G.prog.ib_t : &G.prog.ob_t;
5768 RETURN_STATUS(bc_error(msg[s]));
5770 bc_num_copy(&G.prog.ob, l);
5772 *ptr = (size_t) val;
5773 s = BC_STATUS_SUCCESS;
5776 bc_num_init(&res.d.n, l->len);
5777 bc_num_copy(&res.d.n, l);
5778 bc_program_binOpRetire(&res);
5782 #define zbc_program_assign(...) (zbc_program_assign(__VA_ARGS__) COMMA_SUCCESS)
5785 #define bc_program_pushVar(code, bgn, pop, copy) \
5786 bc_program_pushVar(code, bgn)
5787 // for bc, 'pop' and 'copy' are always false
5789 static BC_STATUS bc_program_pushVar(char *code, size_t *bgn,
5790 bool pop, bool copy)
5793 char *name = bc_program_name(code, bgn);
5795 r.t = BC_RESULT_VAR;
5800 BcVec *v = bc_program_search(name, true);
5801 BcNum *num = bc_vec_top(v);
5805 if (!BC_PROG_STACK(v, 2 - copy)) {
5807 RETURN_STATUS(bc_error_stack_has_too_few_elements());
5813 if (!BC_PROG_STR(num)) {
5815 r.t = BC_RESULT_TEMP;
5817 bc_num_init_DEF_SIZE(&r.d.n);
5818 bc_num_copy(&r.d.n, num);
5821 r.t = BC_RESULT_STR;
5822 r.d.id.idx = num->rdx;
5825 if (!copy) bc_vec_pop(v);
5830 bc_vec_push(&G.prog.results, &r);
5832 RETURN_STATUS(BC_STATUS_SUCCESS);
5834 #define zbc_program_pushVar(...) (bc_program_pushVar(__VA_ARGS__) COMMA_SUCCESS)
5836 static BC_STATUS zbc_program_pushArray(char *code, size_t *bgn,
5839 BcStatus s = BC_STATUS_SUCCESS;
5843 r.d.id.name = bc_program_name(code, bgn);
5845 if (inst == BC_INST_ARRAY) {
5846 r.t = BC_RESULT_ARRAY;
5847 bc_vec_push(&G.prog.results, &r);
5854 s = zbc_program_prep(&operand, &num);
5856 s = zbc_num_ulong(num, &temp);
5859 if (temp > BC_MAX_DIM) {
5860 s = bc_error("array too long; must be [1,"BC_MAX_DIM_STR"]");
5864 r.d.id.idx = (size_t) temp;
5865 bc_program_retire(&r, BC_RESULT_ARRAY_ELEM);
5869 if (s) free(r.d.id.name);
5872 #define zbc_program_pushArray(...) (zbc_program_pushArray(__VA_ARGS__) COMMA_SUCCESS)
5875 static BC_STATUS zbc_program_incdec(char inst)
5878 BcResult *ptr, res, copy;
5882 s = zbc_program_prep(&ptr, &num);
5883 if (s) RETURN_STATUS(s);
5885 if (inst == BC_INST_INC_POST || inst == BC_INST_DEC_POST) {
5886 copy.t = BC_RESULT_TEMP;
5887 bc_num_init(©.d.n, num->len);
5888 bc_num_copy(©.d.n, num);
5891 res.t = BC_RESULT_ONE;
5892 inst = inst == BC_INST_INC_PRE || inst == BC_INST_INC_POST ?
5893 BC_INST_ASSIGN_PLUS :
5894 BC_INST_ASSIGN_MINUS;
5896 bc_vec_push(&G.prog.results, &res);
5897 s = zbc_program_assign(inst);
5898 if (s) RETURN_STATUS(s);
5900 if (inst2 == BC_INST_INC_POST || inst2 == BC_INST_DEC_POST) {
5901 bc_vec_pop(&G.prog.results);
5902 bc_vec_push(&G.prog.results, ©);
5907 #define zbc_program_incdec(...) (zbc_program_incdec(__VA_ARGS__) COMMA_SUCCESS)
5909 static BC_STATUS zbc_program_call(char *code, size_t *idx)
5912 size_t i, nparams = bc_program_index(code, idx);
5919 ip.func = bc_program_index(code, idx);
5920 func = bc_program_func(ip.func);
5922 if (func->code.len == 0) {
5923 RETURN_STATUS(bc_error("undefined function"));
5925 if (nparams != func->nparams) {
5926 RETURN_STATUS(bc_error_fmt("function has %u parameters, but called with %u", func->nparams, nparams));
5928 ip.len = G.prog.results.len - nparams;
5930 for (i = 0; i < nparams; ++i) {
5933 a = bc_vec_item(&func->autos, nparams - 1 - i);
5934 arg = bc_vec_top(&G.prog.results);
5936 if ((!a->idx) != (arg->t == BC_RESULT_ARRAY) || arg->t == BC_RESULT_STR)
5937 RETURN_STATUS(bc_error_variable_is_wrong_type());
5939 s = zbc_program_copyToVar(a->name, a->idx);
5940 if (s) RETURN_STATUS(s);
5943 for (; i < func->autos.len; ++i) {
5946 a = bc_vec_item(&func->autos, i);
5947 v = bc_program_search(a->name, a->idx);
5950 bc_num_init_DEF_SIZE(¶m.n);
5951 bc_vec_push(v, ¶m.n);
5954 bc_array_init(¶m.v, true);
5955 bc_vec_push(v, ¶m.v);
5959 bc_vec_push(&G.prog.stack, &ip);
5961 RETURN_STATUS(BC_STATUS_SUCCESS);
5963 #define zbc_program_call(...) (zbc_program_call(__VA_ARGS__) COMMA_SUCCESS)
5965 static BC_STATUS zbc_program_return(char inst)
5970 BcInstPtr *ip = bc_vec_top(&G.prog.stack);
5972 if (!BC_PROG_STACK(&G.prog.results, ip->len + inst == BC_INST_RET))
5973 RETURN_STATUS(bc_error_stack_has_too_few_elements());
5975 f = bc_program_func(ip->func);
5976 res.t = BC_RESULT_TEMP;
5978 if (inst == BC_INST_RET) {
5981 BcResult *operand = bc_vec_top(&G.prog.results);
5983 s = zbc_program_num(operand, &num, false);
5984 if (s) RETURN_STATUS(s);
5985 bc_num_init(&res.d.n, num->len);
5986 bc_num_copy(&res.d.n, num);
5989 bc_num_init_DEF_SIZE(&res.d.n);
5990 //bc_num_zero(&res.d.n); - already is
5993 // We need to pop arguments as well, so this takes that into account.
5994 for (i = 0; i < f->autos.len; ++i) {
5996 BcId *a = bc_vec_item(&f->autos, i);
5998 v = bc_program_search(a->name, a->idx);
6002 bc_vec_npop(&G.prog.results, G.prog.results.len - ip->len);
6003 bc_vec_push(&G.prog.results, &res);
6004 bc_vec_pop(&G.prog.stack);
6006 RETURN_STATUS(BC_STATUS_SUCCESS);
6008 #define zbc_program_return(...) (zbc_program_return(__VA_ARGS__) COMMA_SUCCESS)
6011 static unsigned long bc_program_scale(BcNum *n)
6013 return (unsigned long) n->rdx;
6016 static unsigned long bc_program_len(BcNum *n)
6018 size_t len = n->len;
6020 if (n->rdx != len) return len;
6022 if (len == 0) break;
6024 if (n->num[len] != 0) break;
6029 static BC_STATUS zbc_program_builtin(char inst)
6035 bool len = inst == BC_INST_LENGTH;
6037 if (!BC_PROG_STACK(&G.prog.results, 1))
6038 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6039 opnd = bc_vec_top(&G.prog.results);
6041 s = zbc_program_num(opnd, &num, false);
6042 if (s) RETURN_STATUS(s);
6045 if (!BC_PROG_NUM(opnd, num) && !len)
6046 RETURN_STATUS(bc_error_variable_is_wrong_type());
6049 bc_num_init_DEF_SIZE(&res.d.n);
6051 if (inst == BC_INST_SQRT) s = zbc_num_sqrt(num, &res.d.n, G.prog.scale);
6053 else if (len != 0 && opnd->t == BC_RESULT_ARRAY) {
6054 bc_num_ulong2num(&res.d.n, (unsigned long) ((BcVec *) num)->len);
6058 else if (len != 0 && !BC_PROG_NUM(opnd, num)) {
6060 size_t idx = opnd->t == BC_RESULT_STR ? opnd->d.id.idx : num->rdx;
6062 str = bc_program_str(idx);
6063 bc_num_ulong2num(&res.d.n, strlen(*str));
6067 bc_num_ulong2num(&res.d.n, len ? bc_program_len(num) : bc_program_scale(num));
6070 bc_program_retire(&res, BC_RESULT_TEMP);
6074 #define zbc_program_builtin(...) (zbc_program_builtin(__VA_ARGS__) COMMA_SUCCESS)
6077 static BC_STATUS zbc_program_divmod(void)
6080 BcResult *opd1, *opd2, res, res2;
6081 BcNum *n1, *n2 = NULL;
6083 s = zbc_program_binOpPrep(&opd1, &n1, &opd2, &n2, false);
6084 if (s) RETURN_STATUS(s);
6086 bc_num_init_DEF_SIZE(&res.d.n);
6087 bc_num_init(&res2.d.n, n2->len);
6089 s = zbc_num_divmod(n1, n2, &res2.d.n, &res.d.n, G.prog.scale);
6092 bc_program_binOpRetire(&res2);
6093 res.t = BC_RESULT_TEMP;
6094 bc_vec_push(&G.prog.results, &res);
6099 bc_num_free(&res2.d.n);
6100 bc_num_free(&res.d.n);
6103 #define zbc_program_divmod(...) (zbc_program_divmod(__VA_ARGS__) COMMA_SUCCESS)
6105 static BC_STATUS zbc_program_modexp(void)
6108 BcResult *r1, *r2, *r3, res;
6109 BcNum *n1, *n2, *n3;
6111 if (!BC_PROG_STACK(&G.prog.results, 3))
6112 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6113 s = zbc_program_binOpPrep(&r2, &n2, &r3, &n3, false);
6114 if (s) RETURN_STATUS(s);
6116 r1 = bc_vec_item_rev(&G.prog.results, 2);
6117 s = zbc_program_num(r1, &n1, false);
6118 if (s) RETURN_STATUS(s);
6119 if (!BC_PROG_NUM(r1, n1))
6120 RETURN_STATUS(bc_error_variable_is_wrong_type());
6122 // Make sure that the values have their pointers updated, if necessary.
6123 if (r1->t == BC_RESULT_VAR || r1->t == BC_RESULT_ARRAY_ELEM) {
6125 if (r1->t == r2->t) {
6126 s = zbc_program_num(r2, &n2, false);
6127 if (s) RETURN_STATUS(s);
6130 if (r1->t == r3->t) {
6131 s = zbc_program_num(r3, &n3, false);
6132 if (s) RETURN_STATUS(s);
6136 bc_num_init(&res.d.n, n3->len);
6137 s = zbc_num_modexp(n1, n2, n3, &res.d.n);
6140 bc_vec_pop(&G.prog.results);
6141 bc_program_binOpRetire(&res);
6146 bc_num_free(&res.d.n);
6149 #define zbc_program_modexp(...) (zbc_program_modexp(__VA_ARGS__) COMMA_SUCCESS)
6151 static void bc_program_stackLen(void)
6154 size_t len = G.prog.results.len;
6156 res.t = BC_RESULT_TEMP;
6158 bc_num_init_DEF_SIZE(&res.d.n);
6159 bc_num_ulong2num(&res.d.n, len);
6160 bc_vec_push(&G.prog.results, &res);
6163 static BC_STATUS zbc_program_asciify(void)
6168 char *str, *str2, c;
6169 size_t len = G.prog.strs.len, idx;
6172 if (!BC_PROG_STACK(&G.prog.results, 1))
6173 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6174 r = bc_vec_top(&G.prog.results);
6176 num = NULL; // TODO: is this NULL needed?
6177 s = zbc_program_num(r, &num, false);
6178 if (s) RETURN_STATUS(s);
6180 if (BC_PROG_NUM(r, num)) {
6182 bc_num_init_DEF_SIZE(&n);
6183 bc_num_copy(&n, num);
6184 bc_num_truncate(&n, n.rdx);
6186 s = zbc_num_mod(&n, &G.prog.strmb, &n, 0);
6187 if (s) goto num_err;
6188 s = zbc_num_ulong(&n, &val);
6189 if (s) goto num_err;
6196 idx = (r->t == BC_RESULT_STR) ? r->d.id.idx : num->rdx;
6197 str2 = *bc_program_str(idx);
6203 //str[1] = '\0'; - already is
6205 str2 = xstrdup(str);
6206 bc_program_addFunc(str2, &idx);
6208 if (idx != len + BC_PROG_REQ_FUNCS) {
6209 for (idx = 0; idx < G.prog.strs.len; ++idx) {
6210 if (strcmp(*bc_program_str(idx), str) == 0) {
6219 bc_vec_push(&G.prog.strs, &str);
6221 res.t = BC_RESULT_STR;
6223 bc_vec_pop(&G.prog.results);
6224 bc_vec_push(&G.prog.results, &res);
6226 RETURN_STATUS(BC_STATUS_SUCCESS);
6232 #define zbc_program_asciify(...) (zbc_program_asciify(__VA_ARGS__) COMMA_SUCCESS)
6234 static BC_STATUS zbc_program_printStream(void)
6242 if (!BC_PROG_STACK(&G.prog.results, 1))
6243 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6244 r = bc_vec_top(&G.prog.results);
6246 s = zbc_program_num(r, &n, false);
6247 if (s) RETURN_STATUS(s);
6249 if (BC_PROG_NUM(r, n)) {
6250 s = zbc_num_printNum(n, &G.prog.strmb, 1, bc_num_printChar);
6252 idx = (r->t == BC_RESULT_STR) ? r->d.id.idx : n->rdx;
6253 str = *bc_program_str(idx);
6259 #define zbc_program_printStream(...) (zbc_program_printStream(__VA_ARGS__) COMMA_SUCCESS)
6261 static BC_STATUS zbc_program_nquit(void)
6268 s = zbc_program_prep(&opnd, &num);
6269 if (s) RETURN_STATUS(s);
6270 s = zbc_num_ulong(num, &val);
6271 if (s) RETURN_STATUS(s);
6273 bc_vec_pop(&G.prog.results);
6275 if (G.prog.stack.len < val)
6276 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6277 if (G.prog.stack.len == val) {
6278 QUIT_OR_RETURN_TO_MAIN;
6281 bc_vec_npop(&G.prog.stack, val);
6285 #define zbc_program_nquit(...) (zbc_program_nquit(__VA_ARGS__) COMMA_SUCCESS)
6287 static BC_STATUS zbc_program_execStr(char *code, size_t *bgn,
6290 BcStatus s = BC_STATUS_SUCCESS;
6298 if (!BC_PROG_STACK(&G.prog.results, 1))
6299 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6301 r = bc_vec_top(&G.prog.results);
6304 BcNum *n = n; // for compiler
6307 char *then_name = bc_program_name(code, bgn);
6308 char *else_name = NULL;
6310 if (code[*bgn] == BC_PARSE_STREND)
6313 else_name = bc_program_name(code, bgn);
6315 exec = r->d.n.len != 0;
6317 if (!exec && else_name != NULL) {
6324 v = bc_program_search(name, true);
6331 if (!exec) goto exit;
6332 if (!BC_PROG_STR(n)) {
6333 s = bc_error_variable_is_wrong_type();
6339 if (r->t == BC_RESULT_STR) {
6341 } else if (r->t == BC_RESULT_VAR) {
6343 s = zbc_program_num(r, &n, false);
6344 if (s || !BC_PROG_STR(n)) goto exit;
6350 fidx = sidx + BC_PROG_REQ_FUNCS;
6352 str = bc_program_str(sidx);
6353 f = bc_program_func(fidx);
6355 if (f->code.len == 0) {
6356 bc_parse_create(&prs, fidx);
6357 s = zbc_parse_text_init(&prs, *str);
6359 s = zcommon_parse_expr(&prs, BC_PARSE_NOCALL);
6362 if (prs.l.t.t != BC_LEX_EOF) {
6363 s = bc_error_bad_expression();
6367 bc_parse_free(&prs);
6371 ip.len = G.prog.results.len;
6374 bc_vec_pop(&G.prog.results);
6375 bc_vec_push(&G.prog.stack, &ip);
6377 RETURN_STATUS(BC_STATUS_SUCCESS);
6380 bc_parse_free(&prs);
6381 f = bc_program_func(fidx);
6382 bc_vec_pop_all(&f->code);
6384 bc_vec_pop(&G.prog.results);
6387 #define zbc_program_execStr(...) (zbc_program_execStr(__VA_ARGS__) COMMA_SUCCESS)
6390 static void bc_program_pushGlobal(char inst)
6395 res.t = inst - BC_INST_IBASE + BC_RESULT_IBASE;
6396 if (inst == BC_INST_IBASE)
6397 val = (unsigned long) G.prog.ib_t;
6398 else if (inst == BC_INST_SCALE)
6399 val = (unsigned long) G.prog.scale;
6401 val = (unsigned long) G.prog.ob_t;
6403 bc_num_init_DEF_SIZE(&res.d.n);
6404 bc_num_ulong2num(&res.d.n, val);
6405 bc_vec_push(&G.prog.results, &res);
6408 static void bc_program_addFunc(char *name, size_t *idx)
6410 BcId entry, *entry_ptr;
6415 entry.idx = G.prog.fns.len;
6417 inserted = bc_map_insert(&G.prog.fn_map, &entry, idx);
6418 if (!inserted) free(name);
6420 entry_ptr = bc_vec_item(&G.prog.fn_map, *idx);
6421 *idx = entry_ptr->idx;
6425 BcFunc *func = bc_program_func(entry_ptr->idx);
6427 // We need to reset these, so the function can be repopulated.
6429 bc_vec_pop_all(&func->autos);
6430 bc_vec_pop_all(&func->code);
6431 bc_vec_pop_all(&func->labels);
6435 bc_vec_push(&G.prog.fns, &f);
6439 static BC_STATUS zbc_program_exec(void)
6443 BcInstPtr *ip = bc_vec_top(&G.prog.stack);
6444 BcFunc *func = bc_program_func(ip->func);
6445 char *code = func->code.v;
6447 while (ip->idx < func->code.len) {
6448 BcStatus s = BC_STATUS_SUCCESS;
6449 char inst = code[(ip->idx)++];
6451 dbg_exec("inst:%d", inst);
6454 case BC_INST_JUMP_ZERO: {
6456 dbg_exec("BC_INST_JUMP_ZERO:");
6457 s = zbc_program_prep(&ptr, &num);
6458 if (s) RETURN_STATUS(s);
6459 zero = (bc_num_cmp(num, &G.prog.zero) == 0);
6460 bc_vec_pop(&G.prog.results);
6462 bc_program_index(code, &ip->idx);
6465 // else: fall through
6467 case BC_INST_JUMP: {
6468 size_t idx = bc_program_index(code, &ip->idx);
6469 size_t *addr = bc_vec_item(&func->labels, idx);
6470 dbg_exec("BC_INST_JUMP: to %ld", (long)*addr);
6475 dbg_exec("BC_INST_CALL:");
6476 s = zbc_program_call(code, &ip->idx);
6478 case BC_INST_INC_PRE:
6479 case BC_INST_DEC_PRE:
6480 case BC_INST_INC_POST:
6481 case BC_INST_DEC_POST:
6482 dbg_exec("BC_INST_INCDEC:");
6483 s = zbc_program_incdec(inst);
6486 dbg_exec("BC_INST_HALT:");
6487 QUIT_OR_RETURN_TO_MAIN;
6491 dbg_exec("BC_INST_RET[0]:");
6492 s = zbc_program_return(inst);
6494 case BC_INST_BOOL_OR:
6495 case BC_INST_BOOL_AND:
6497 case BC_INST_REL_EQ:
6498 case BC_INST_REL_LE:
6499 case BC_INST_REL_GE:
6500 case BC_INST_REL_NE:
6501 case BC_INST_REL_LT:
6502 case BC_INST_REL_GT:
6503 dbg_exec("BC_INST_BOOL:");
6504 s = zbc_program_logical(inst);
6507 dbg_exec("BC_INST_READ:");
6508 s = zbc_program_read();
6511 dbg_exec("BC_INST_VAR:");
6512 s = zbc_program_pushVar(code, &ip->idx, false, false);
6514 case BC_INST_ARRAY_ELEM:
6516 dbg_exec("BC_INST_ARRAY[_ELEM]:");
6517 s = zbc_program_pushArray(code, &ip->idx, inst);
6520 r.t = BC_RESULT_LAST;
6521 bc_vec_push(&G.prog.results, &r);
6526 bc_program_pushGlobal(inst);
6528 case BC_INST_SCALE_FUNC:
6529 case BC_INST_LENGTH:
6531 dbg_exec("BC_INST_builtin:");
6532 s = zbc_program_builtin(inst);
6535 dbg_exec("BC_INST_NUM:");
6536 r.t = BC_RESULT_CONSTANT;
6537 r.d.id.idx = bc_program_index(code, &ip->idx);
6538 bc_vec_push(&G.prog.results, &r);
6541 dbg_exec("BC_INST_POP:");
6542 if (!BC_PROG_STACK(&G.prog.results, 1))
6543 s = bc_error_stack_has_too_few_elements();
6545 bc_vec_pop(&G.prog.results);
6547 case BC_INST_POP_EXEC:
6548 dbg_exec("BC_INST_POP_EXEC:");
6549 bc_vec_pop(&G.prog.stack);
6552 case BC_INST_PRINT_POP:
6553 case BC_INST_PRINT_STR:
6554 dbg_exec("BC_INST_PRINTxyz:");
6555 s = zbc_program_print(inst, 0);
6558 dbg_exec("BC_INST_STR:");
6559 r.t = BC_RESULT_STR;
6560 r.d.id.idx = bc_program_index(code, &ip->idx);
6561 bc_vec_push(&G.prog.results, &r);
6564 case BC_INST_MULTIPLY:
6565 case BC_INST_DIVIDE:
6566 case BC_INST_MODULUS:
6569 dbg_exec("BC_INST_binaryop:");
6570 s = zbc_program_op(inst);
6572 case BC_INST_BOOL_NOT:
6573 dbg_exec("BC_INST_BOOL_NOT:");
6574 s = zbc_program_prep(&ptr, &num);
6575 if (s) RETURN_STATUS(s);
6576 bc_num_init_DEF_SIZE(&r.d.n);
6577 if (!bc_num_cmp(num, &G.prog.zero))
6579 //else bc_num_zero(&r.d.n); - already is
6580 bc_program_retire(&r, BC_RESULT_TEMP);
6583 dbg_exec("BC_INST_NEG:");
6584 s = zbc_program_negate();
6587 case BC_INST_ASSIGN_POWER:
6588 case BC_INST_ASSIGN_MULTIPLY:
6589 case BC_INST_ASSIGN_DIVIDE:
6590 case BC_INST_ASSIGN_MODULUS:
6591 case BC_INST_ASSIGN_PLUS:
6592 case BC_INST_ASSIGN_MINUS:
6594 case BC_INST_ASSIGN:
6595 dbg_exec("BC_INST_ASSIGNxyz:");
6596 s = zbc_program_assign(inst);
6599 case BC_INST_MODEXP:
6600 s = zbc_program_modexp();
6602 case BC_INST_DIVMOD:
6603 s = zbc_program_divmod();
6605 case BC_INST_EXECUTE:
6606 case BC_INST_EXEC_COND:
6607 s = zbc_program_execStr(code, &ip->idx, inst == BC_INST_EXEC_COND);
6609 case BC_INST_PRINT_STACK: {
6611 for (idx = 0; idx < G.prog.results.len; ++idx) {
6612 s = zbc_program_print(BC_INST_PRINT, idx);
6617 case BC_INST_CLEAR_STACK:
6618 bc_vec_pop_all(&G.prog.results);
6620 case BC_INST_STACK_LEN:
6621 bc_program_stackLen();
6623 case BC_INST_DUPLICATE:
6624 if (!BC_PROG_STACK(&G.prog.results, 1))
6625 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6626 ptr = bc_vec_top(&G.prog.results);
6627 bc_result_copy(&r, ptr);
6628 bc_vec_push(&G.prog.results, &r);
6630 case BC_INST_SWAP: {
6632 if (!BC_PROG_STACK(&G.prog.results, 2))
6633 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6634 ptr = bc_vec_item_rev(&G.prog.results, 0);
6635 ptr2 = bc_vec_item_rev(&G.prog.results, 1);
6636 memcpy(&r, ptr, sizeof(BcResult));
6637 memcpy(ptr, ptr2, sizeof(BcResult));
6638 memcpy(ptr2, &r, sizeof(BcResult));
6641 case BC_INST_ASCIIFY:
6642 s = zbc_program_asciify();
6644 case BC_INST_PRINT_STREAM:
6645 s = zbc_program_printStream();
6648 case BC_INST_PUSH_VAR: {
6649 bool copy = inst == BC_INST_LOAD;
6650 s = zbc_program_pushVar(code, &ip->idx, true, copy);
6653 case BC_INST_PUSH_TO_VAR: {
6654 char *name = bc_program_name(code, &ip->idx);
6655 s = zbc_program_copyToVar(name, true);
6660 dbg_exec("BC_INST_NEG:");
6661 if (G.prog.stack.len <= 2)
6662 QUIT_OR_RETURN_TO_MAIN;
6663 bc_vec_npop(&G.prog.stack, 2);
6666 s = zbc_program_nquit();
6671 if (s || G_interrupt) {
6678 // If the stack has changed, pointers may be invalid.
6679 ip = bc_vec_top(&G.prog.stack);
6680 func = bc_program_func(ip->func);
6681 code = func->code.v;
6684 RETURN_STATUS(BC_STATUS_SUCCESS);
6686 #define zbc_program_exec(...) (zbc_program_exec(__VA_ARGS__) COMMA_SUCCESS)
6688 static unsigned bc_vm_envLen(const char *var)
6694 len = BC_NUM_PRINT_WIDTH;
6695 if (!lenv) return len;
6697 len = bb_strtou(lenv, NULL, 10) - 1;
6698 if (errno || len < 2 || len >= INT_MAX)
6699 len = BC_NUM_PRINT_WIDTH;
6704 static BC_STATUS zbc_vm_process(const char *text)
6708 dbg_lex_enter("%s:%d entered", __func__, __LINE__);
6709 s = zbc_parse_text_init(&G.prs, text);
6710 if (s) RETURN_STATUS(s);
6712 while (G.prs.l.t.t != BC_LEX_EOF) {
6713 dbg_lex("%s:%d G.prs.l.t.t:%d", __func__, __LINE__, G.prs.l.t.t);
6714 s = zcommon_parse(&G.prs);
6715 if (s) RETURN_STATUS(s);
6716 s = zbc_program_exec();
6723 dbg_lex_done("%s:%d done", __func__, __LINE__);
6726 #define zbc_vm_process(...) (zbc_vm_process(__VA_ARGS__) COMMA_SUCCESS)
6728 static BC_STATUS zbc_vm_execute_FILE(FILE *fp, const char *filename)
6730 // So far bc/dc have no way to include a file from another file,
6731 // therefore we know G.prog.file == NULL on entry
6732 //const char *sv_file;
6735 G.prog.file = filename;
6737 bc_lex_file(&G.prs.l);
6740 s = zbc_vm_process("");
6741 // We do not stop looping on errors here if reading stdin.
6742 // Example: start interactive bc and enter "return".
6743 // It should say "'return' not in a function"
6744 // but should not exit.
6745 } while (G.input_fp == stdin);
6749 #define zbc_vm_execute_FILE(...) (zbc_vm_execute_FILE(__VA_ARGS__) COMMA_SUCCESS)
6751 static BC_STATUS zbc_vm_file(const char *file)
6756 fp = xfopen_for_read(file);
6757 s = zbc_vm_execute_FILE(fp, file);
6762 #define zbc_vm_file(...) (zbc_vm_file(__VA_ARGS__) COMMA_SUCCESS)
6765 static void bc_vm_info(void)
6767 printf("%s "BB_VER"\n"
6768 "Copyright (c) 2018 Gavin D. Howard and contributors\n"
6772 static void bc_args(char **argv)
6778 #if ENABLE_FEATURE_BC_LONG_OPTIONS
6779 opts = option_mask32 |= getopt32long(argv, "wvsqli",
6780 "warn\0" No_argument "w"
6781 "version\0" No_argument "v"
6782 "standard\0" No_argument "s"
6783 "quiet\0" No_argument "q"
6784 "mathlib\0" No_argument "l"
6785 "interactive\0" No_argument "i"
6788 opts = option_mask32 |= getopt32(argv, "wvsqli");
6790 if (getenv("POSIXLY_CORRECT"))
6791 option_mask32 |= BC_FLAG_S;
6793 if (opts & BC_FLAG_V) {
6798 for (i = optind; argv[i]; ++i)
6799 bc_vec_push(&G.files, argv + i);
6802 static void bc_vm_envArgs(void)
6806 char *env_args = getenv("BC_ENV_ARGS");
6808 if (!env_args) return;
6810 G.env_args = xstrdup(env_args);
6813 bc_vec_init(&v, sizeof(char *), NULL);
6815 while (*(buf = skip_whitespace(buf)) != '\0') {
6816 bc_vec_push(&v, &buf);
6817 buf = skip_non_whitespace(buf);
6823 // NULL terminate, and pass argv[] so that first arg is argv[1]
6824 if (sizeof(int) == sizeof(char*)) {
6825 bc_vec_push(&v, &const_int_0);
6827 static char *const nullptr = NULL;
6828 bc_vec_push(&v, &nullptr);
6830 bc_args(((char **)v.v) - 1);
6835 static const char bc_lib[] ALIGN1 = {
6838 "\n" "auto b,s,n,r,d,i,p,f,v"
6839 ////////////////"if(x<0)return(1/e(-x))" // and drop 'n' and x<0 logic below
6840 //^^^^^^^^^^^^^^^^ this would work, and is even more precise than GNU bc:
6841 //e(-.998896): GNU:.36828580434569428695
6842 // above code:.36828580434569428696
6843 // actual value:.3682858043456942869594...
6844 // but for now let's be "GNU compatible"
6853 "\n" "scale=scale(x)+1"
6863 "\n" "for(i=2;v;++i){"
6869 "\n" "while(d--)r*=r"
6872 "\n" "if(n)return(1/r)"
6876 "\n" "auto b,s,r,p,a,q,i,v"
6880 "\n" "r=(1-10^scale)/1"
6891 "\n" "while(x<=.5){"
6895 "\n" "r=a=(x-1)/(x+1)"
6898 "\n" "for(i=3;v;i+=2){"
6909 "\n" "auto b,s,r,a,q,i"
6910 "\n" "if(x<0)return(-s(-x))"
6914 "\n" "scale=1.1*s+2"
6923 "\n" "for(i=3;a;i+=2){"
6924 "\n" "a*=q/(i*(i-1))"
6937 "\n" "x=s(2*a(1)+x)"
6943 "\n" "auto b,s,r,n,a,m,t,f,i,u"
6951 "\n" "if(scale<65){"
6952 "\n" "if(x==1)return(.7853981633974483096156608458198757210492923498437764552437361480/n)"
6953 "\n" "if(x==.2)return(.1973955598498807583700497651947902934475851037878521015176889402/n)"
6963 "\n" "x=(x-.2)/(1+.2*x)"
6968 "\n" "for(i=3;t;i+=2){"
6975 "\n" "return((m*a+r)/n)"
6977 "\n" "define j(n,x){"
6978 "\n" "auto b,s,o,a,i,v,f"
6989 "\n" "for(i=2;i<=n;++i)a*=i"
6991 "\n" "a=(x^n)/2^n/a"
6994 "\n" "scale+=length(a)-scale(a)"
6995 "\n" "for(i=1;v;++i){"
6996 "\n" "v=v*f/i/(n+i)"
7002 "\n" "return(a*r/1)"
7007 static BC_STATUS zbc_vm_exec(void)
7013 if (option_mask32 & BC_FLAG_L) {
7014 // We know that internal library is not buggy,
7015 // thus error checking is normally disabled.
7016 # define DEBUG_LIB 0
7017 bc_lex_file(&G.prs.l);
7018 s = zbc_vm_process(bc_lib);
7019 if (DEBUG_LIB && s) RETURN_STATUS(s);
7023 s = BC_STATUS_SUCCESS;
7024 for (i = 0; !s && i < G.files.len; ++i)
7025 s = zbc_vm_file(*((char **) bc_vec_item(&G.files, i)));
7026 if (ENABLE_FEATURE_CLEAN_UP && s && !G_ttyin) {
7027 // Debug config, non-interactive mode:
7028 // return all the way back to main.
7029 // Non-debug builds do not come here, they exit.
7033 if (IS_BC || (option_mask32 & BC_FLAG_I))
7034 s = zbc_vm_execute_FILE(stdin, /*filename:*/ NULL);
7038 #define zbc_vm_exec(...) (zbc_vm_exec(__VA_ARGS__) COMMA_SUCCESS)
7040 #if ENABLE_FEATURE_CLEAN_UP
7041 static void bc_program_free(void)
7043 bc_num_free(&G.prog.ob);
7045 bc_num_free(&G.prog.strmb);
7047 bc_vec_free(&G.prog.fns);
7048 bc_vec_free(&G.prog.fn_map);
7049 bc_vec_free(&G.prog.vars);
7050 bc_vec_free(&G.prog.var_map);
7051 bc_vec_free(&G.prog.arrs);
7052 bc_vec_free(&G.prog.arr_map);
7053 bc_vec_free(&G.prog.strs);
7054 bc_vec_free(&G.prog.consts);
7055 bc_vec_free(&G.prog.results);
7056 bc_vec_free(&G.prog.stack);
7057 bc_num_free(&G.prog.last);
7058 bc_num_free(&G.prog.zero);
7059 bc_num_free(&G.prog.one);
7060 bc_vec_free(&G.input_buffer);
7063 static void bc_vm_free(void)
7065 bc_vec_free(&G.files);
7067 bc_parse_free(&G.prs);
7072 static void bc_program_init(void)
7077 // memset(&G.prog, 0, sizeof(G.prog)); - already is
7078 memset(&ip, 0, sizeof(BcInstPtr));
7080 // G.prog.nchars = G.prog.scale = 0; - already is
7083 bc_num_init_DEF_SIZE(&G.prog.ob);
7084 bc_num_ten(&G.prog.ob);
7088 bc_num_init_DEF_SIZE(&G.prog.strmb);
7089 bc_num_ulong2num(&G.prog.strmb, UCHAR_MAX + 1);
7092 bc_num_init_DEF_SIZE(&G.prog.last);
7093 //bc_num_zero(&G.prog.last); - already is
7095 bc_num_init_DEF_SIZE(&G.prog.zero);
7096 //bc_num_zero(&G.prog.zero); - already is
7098 bc_num_init_DEF_SIZE(&G.prog.one);
7099 bc_num_one(&G.prog.one);
7101 bc_vec_init(&G.prog.fns, sizeof(BcFunc), bc_func_free);
7102 bc_vec_init(&G.prog.fn_map, sizeof(BcId), bc_id_free);
7104 bc_program_addFunc(xstrdup("(main)"), &idx);
7105 bc_program_addFunc(xstrdup("(read)"), &idx);
7107 bc_vec_init(&G.prog.vars, sizeof(BcVec), bc_vec_free);
7108 bc_vec_init(&G.prog.var_map, sizeof(BcId), bc_id_free);
7110 bc_vec_init(&G.prog.arrs, sizeof(BcVec), bc_vec_free);
7111 bc_vec_init(&G.prog.arr_map, sizeof(BcId), bc_id_free);
7113 bc_vec_init(&G.prog.strs, sizeof(char *), bc_string_free);
7114 bc_vec_init(&G.prog.consts, sizeof(char *), bc_string_free);
7115 bc_vec_init(&G.prog.results, sizeof(BcResult), bc_result_free);
7116 bc_vec_init(&G.prog.stack, sizeof(BcInstPtr), NULL);
7117 bc_vec_push(&G.prog.stack, &ip);
7119 bc_char_vec_init(&G.input_buffer);
7122 static int bc_vm_init(const char *env_len)
7124 #if ENABLE_FEATURE_EDITING
7125 G.line_input_state = new_line_input_t(DO_HISTORY);
7127 G.prog.len = bc_vm_envLen(env_len);
7129 bc_vec_init(&G.files, sizeof(char *), NULL);
7130 IF_BC(if (IS_BC) bc_vm_envArgs();)
7132 bc_parse_create(&G.prs, BC_PROG_MAIN);
7134 //TODO: in GNU bc, the check is (isatty(0) && isatty(1)),
7135 //-i option unconditionally enables this regardless of isatty():
7137 #if ENABLE_FEATURE_BC_SIGNALS
7139 // With SA_RESTART, most system calls will restart
7140 // (IOW: they won't fail with EINTR).
7141 // In particular, this means ^C won't cause
7142 // stdout to get into "error state" if SIGINT hits
7143 // within write() syscall.
7145 // The downside is that ^C while tty input is taken
7146 // will only be handled after [Enter] since read()
7147 // from stdin is not interrupted by ^C either,
7148 // it restarts, thus fgetc() does not return on ^C.
7149 // (This problem manifests only if line editing is disabled)
7150 signal_SA_RESTART_empty_mask(SIGINT, record_signo);
7152 // Without SA_RESTART, this exhibits a bug:
7153 // "while (1) print 1" and try ^C-ing it.
7154 // Intermittently, instead of returning to input line,
7155 // you'll get "output error: Interrupted system call"
7157 //signal_no_SA_RESTART_empty_mask(SIGINT, record_signo);
7161 return 0; // "not a tty"
7164 static BcStatus bc_vm_run(void)
7166 BcStatus st = zbc_vm_exec();
7167 #if ENABLE_FEATURE_CLEAN_UP
7168 if (G_exiting) // it was actually "halt" or "quit"
7171 # if ENABLE_FEATURE_EDITING
7172 free_line_input_t(G.line_input_state);
7176 dbg_exec("exiting with exitcode %d", st);
7181 int bc_main(int argc, char **argv) MAIN_EXTERNALLY_VISIBLE;
7182 int bc_main(int argc UNUSED_PARAM, char **argv)
7188 is_tty = bc_vm_init("BC_LINE_LENGTH");
7192 if (is_tty && !(option_mask32 & BC_FLAG_Q))
7200 int dc_main(int argc, char **argv) MAIN_EXTERNALLY_VISIBLE;
7201 int dc_main(int argc UNUSED_PARAM, char **argv)
7207 // TODO: dc (GNU bc 1.07.1) 1.4.1 seems to use width
7208 // 1 char wider than bc from the same package.
7209 // Both default width, and xC_LINE_LENGTH=N are wider:
7210 // "DC_LINE_LENGTH=5 dc -e'123456 p'" prints:
7213 // "echo '123456' | BC_LINE_LENGTH=5 bc" prints:
7216 // Do the same, or it's a bug?
7217 bc_vm_init("DC_LINE_LENGTH");
7219 // Run -e'SCRIPT' and -fFILE in order of appearance, then handle FILEs
7220 noscript = BC_FLAG_I;
7222 int n = getopt(argc, argv, "e:f:x");
7228 n = zbc_vm_process(optarg);
7233 n = zbc_vm_file(optarg);
7237 option_mask32 |= DC_FLAG_X;
7247 bc_vec_push(&G.files, argv++);
7250 option_mask32 |= noscript; // set BC_FLAG_I if we need to interpret stdin
7256 #endif // not DC_SMALL