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)
2991 l->t.t = BC_LEX_STR;
2999 RETURN_STATUS(bc_error("string end could not be found"));
3008 // This check makes sense only if size_t is (much) larger than BC_MAX_STRING.
3009 if (SIZE_MAX > (BC_MAX_STRING | 0xff)) {
3010 if (len > BC_MAX_STRING)
3011 RETURN_STATUS(bc_error("string too long: must be [1,"BC_MAX_STRING_STR"]"));
3013 bc_vec_string(&l->t.v, len, l->buf + l->i);
3017 G.err_line = l->line;
3019 RETURN_STATUS(BC_STATUS_SUCCESS);
3021 #define zbc_lex_string(...) (zbc_lex_string(__VA_ARGS__) COMMA_SUCCESS)
3023 static void bc_lex_assign(BcLex *l, unsigned with_and_without)
3025 if (l->buf[l->i] == '=') {
3027 with_and_without >>= 8; // store "with" value
3028 } // else store "without" value
3029 l->t.t = (with_and_without & 0xff);
3031 #define bc_lex_assign(l, with, without) \
3032 bc_lex_assign(l, ((with)<<8)|(without))
3034 static BC_STATUS zbc_lex_comment(BcLex *l)
3037 const char *buf = l->buf;
3039 l->t.t = BC_LEX_WHITESPACE;
3040 i = l->i; /* here buf[l->i] is the '*' of opening comment delimiter */
3052 RETURN_STATUS(bc_error("comment end could not be found"));
3059 G.err_line = l->line;
3061 RETURN_STATUS(BC_STATUS_SUCCESS);
3063 #define zbc_lex_comment(...) (zbc_lex_comment(__VA_ARGS__) COMMA_SUCCESS)
3065 static BC_STATUS zbc_lex_token(BcLex *l)
3067 BcStatus s = BC_STATUS_SUCCESS;
3068 char c = l->buf[l->i++], c2;
3070 // This is the workhorse of the lexer.
3072 // case '\0': // probably never reached
3074 // l->t.t = BC_LEX_EOF;
3075 // l->newline = true;
3078 l->t.t = BC_LEX_NLINE;
3086 bc_lex_whitespace(l);
3089 bc_lex_assign(l, BC_LEX_OP_REL_NE, BC_LEX_OP_BOOL_NOT);
3090 if (l->t.t == BC_LEX_OP_BOOL_NOT) {
3091 s = bc_POSIX_does_not_allow_bool_ops_this_is_bad("!");
3092 IF_ERROR_RETURN_POSSIBLE(if (s) RETURN_STATUS(s));
3096 s = zbc_lex_string(l);
3099 s = bc_POSIX_does_not_allow("'#' script comments");
3100 IF_ERROR_RETURN_POSSIBLE(if (s) RETURN_STATUS(s));
3101 bc_lex_lineComment(l);
3104 bc_lex_assign(l, BC_LEX_OP_ASSIGN_MODULUS, BC_LEX_OP_MODULUS);
3109 s = bc_POSIX_does_not_allow_bool_ops_this_is_bad("&&");
3110 IF_ERROR_RETURN_POSSIBLE(if (s) RETURN_STATUS(s));
3112 l->t.t = BC_LEX_OP_BOOL_AND;
3114 l->t.t = BC_LEX_INVALID;
3115 s = bc_error_bad_character('&');
3120 l->t.t = (BcLexType)(c - '(' + BC_LEX_LPAREN);
3123 bc_lex_assign(l, BC_LEX_OP_ASSIGN_MULTIPLY, BC_LEX_OP_MULTIPLY);
3129 l->t.t = BC_LEX_OP_INC;
3131 bc_lex_assign(l, BC_LEX_OP_ASSIGN_PLUS, BC_LEX_OP_PLUS);
3134 l->t.t = BC_LEX_COMMA;
3140 l->t.t = BC_LEX_OP_DEC;
3142 bc_lex_assign(l, BC_LEX_OP_ASSIGN_MINUS, BC_LEX_OP_MINUS);
3145 if (isdigit(l->buf[l->i]))
3146 s = zbc_lex_number(l, c);
3148 l->t.t = BC_LEX_KEY_LAST;
3149 s = bc_POSIX_does_not_allow("a period ('.') as a shortcut for the last result");
3155 s = zbc_lex_comment(l);
3157 bc_lex_assign(l, BC_LEX_OP_ASSIGN_DIVIDE, BC_LEX_OP_DIVIDE);
3175 s = zbc_lex_number(l, c);
3178 l->t.t = BC_LEX_SCOLON;
3181 bc_lex_assign(l, BC_LEX_OP_REL_LE, BC_LEX_OP_REL_LT);
3184 bc_lex_assign(l, BC_LEX_OP_REL_EQ, BC_LEX_OP_ASSIGN);
3187 bc_lex_assign(l, BC_LEX_OP_REL_GE, BC_LEX_OP_REL_GT);
3191 l->t.t = (BcLexType)(c - '[' + BC_LEX_LBRACKET);
3194 if (l->buf[l->i] == '\n') {
3195 l->t.t = BC_LEX_WHITESPACE;
3198 s = bc_error_bad_character(c);
3201 bc_lex_assign(l, BC_LEX_OP_ASSIGN_POWER, BC_LEX_OP_POWER);
3229 s = zbc_lex_identifier(l);
3233 l->t.t = (BcLexType)(c - '{' + BC_LEX_LBRACE);
3238 s = bc_POSIX_does_not_allow_bool_ops_this_is_bad("||");
3239 IF_ERROR_RETURN_POSSIBLE(if (s) RETURN_STATUS(s));
3241 l->t.t = BC_LEX_OP_BOOL_OR;
3243 l->t.t = BC_LEX_INVALID;
3244 s = bc_error_bad_character(c);
3248 l->t.t = BC_LEX_INVALID;
3249 s = bc_error_bad_character(c);
3258 static BC_STATUS zdc_lex_register(BcLex *l)
3260 if (isspace(l->buf[l->i - 1])) {
3261 bc_lex_whitespace(l);
3264 RETURN_STATUS(bc_error("extended register"));
3268 bc_vec_pop_all(&l->t.v);
3269 bc_vec_push(&l->t.v, &l->buf[l->i - 1]);
3270 bc_vec_pushZeroByte(&l->t.v);
3271 l->t.t = BC_LEX_NAME;
3274 RETURN_STATUS(BC_STATUS_SUCCESS);
3276 #define zdc_lex_register(...) (zdc_lex_register(__VA_ARGS__) COMMA_SUCCESS)
3278 static BC_STATUS zdc_lex_string(BcLex *l)
3280 size_t depth, nls, i;
3282 l->t.t = BC_LEX_STR;
3283 bc_vec_pop_all(&l->t.v);
3292 RETURN_STATUS(bc_error("string end could not be found"));
3295 if (i == l->i || l->buf[i - 1] != '\\') {
3296 if (c == '[') depth++;
3301 bc_vec_push(&l->t.v, &l->buf[i]);
3306 bc_vec_pushZeroByte(&l->t.v);
3307 // This check makes sense only if size_t is (much) larger than BC_MAX_STRING.
3308 if (SIZE_MAX > (BC_MAX_STRING | 0xff)) {
3309 if (i - l->i > BC_MAX_STRING)
3310 RETURN_STATUS(bc_error("string too long: must be [1,"BC_MAX_STRING_STR"]"));
3315 G.err_line = l->line;
3317 RETURN_STATUS(BC_STATUS_SUCCESS);
3319 #define zdc_lex_string(...) (zdc_lex_string(__VA_ARGS__) COMMA_SUCCESS)
3321 static BC_STATUS zdc_lex_token(BcLex *l)
3323 static const //BcLexType - should be this type, but narrower type saves size:
3326 BC_LEX_OP_REL_EQ, BC_LEX_OP_REL_LE, BC_LEX_OP_REL_GE, BC_LEX_OP_REL_NE,
3327 BC_LEX_OP_REL_LT, BC_LEX_OP_REL_GT, BC_LEX_SCOLON, BC_LEX_COLON,
3328 BC_LEX_ELSE, BC_LEX_LOAD, BC_LEX_LOAD_POP, BC_LEX_OP_ASSIGN,
3331 static const //BcLexType - should be this type
3335 BC_LEX_OP_MODULUS, BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_LPAREN,
3337 BC_LEX_INVALID, BC_LEX_OP_MULTIPLY, BC_LEX_OP_PLUS, BC_LEX_INVALID,
3339 BC_LEX_OP_MINUS, BC_LEX_INVALID, BC_LEX_OP_DIVIDE,
3341 BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID,
3342 BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID,
3343 BC_LEX_INVALID, BC_LEX_INVALID,
3345 BC_LEX_COLON, BC_LEX_SCOLON, BC_LEX_OP_REL_GT, BC_LEX_OP_REL_EQ,
3346 BC_LEX_OP_REL_LT, BC_LEX_KEY_READ, BC_LEX_INVALID,
3348 BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID,
3349 BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_EQ_NO_REG, BC_LEX_INVALID,
3351 BC_LEX_KEY_IBASE, BC_LEX_INVALID, BC_LEX_KEY_SCALE, BC_LEX_LOAD_POP,
3352 BC_LEX_INVALID, BC_LEX_OP_BOOL_NOT, BC_LEX_KEY_OBASE, BC_LEX_PRINT_STREAM,
3354 BC_LEX_NQUIT, BC_LEX_POP, BC_LEX_STORE_PUSH, BC_LEX_INVALID, BC_LEX_INVALID,
3355 BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_SCALE_FACTOR, BC_LEX_INVALID,
3357 BC_LEX_KEY_LENGTH, BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID,
3359 BC_LEX_OP_POWER, BC_LEX_NEG, BC_LEX_INVALID,
3361 BC_LEX_ASCIIFY, BC_LEX_INVALID, BC_LEX_CLEAR_STACK, BC_LEX_DUPLICATE,
3362 BC_LEX_ELSE, BC_LEX_PRINT_STACK, BC_LEX_INVALID, BC_LEX_INVALID,
3364 BC_LEX_STORE_IBASE, BC_LEX_INVALID, BC_LEX_STORE_SCALE, BC_LEX_LOAD,
3365 BC_LEX_INVALID, BC_LEX_PRINT_POP, BC_LEX_STORE_OBASE, BC_LEX_KEY_PRINT,
3367 BC_LEX_KEY_QUIT, BC_LEX_SWAP, BC_LEX_OP_ASSIGN, BC_LEX_INVALID,
3368 BC_LEX_INVALID, BC_LEX_KEY_SQRT, BC_LEX_INVALID, BC_LEX_EXECUTE,
3370 BC_LEX_INVALID, BC_LEX_STACK_LEVEL,
3372 BC_LEX_LBRACE, BC_LEX_OP_MODEXP, BC_LEX_INVALID, BC_LEX_OP_DIVMOD,
3375 BcStatus s = BC_STATUS_SUCCESS;
3376 char c = l->buf[l->i++], c2;
3379 for (i = 0; i < ARRAY_SIZE(dc_lex_regs); ++i) {
3380 if (l->t.last == dc_lex_regs[i])
3381 RETURN_STATUS(zdc_lex_register(l));
3384 if (c >= '%' && c <= '~'
3385 && (l->t.t = dc_lex_tokens[c - '%']) != BC_LEX_INVALID
3390 // This is the workhorse of the lexer.
3392 // case '\0': // probably never reached
3393 // l->t.t = BC_LEX_EOF;
3401 l->newline = (c == '\n');
3402 bc_lex_whitespace(l);
3407 l->t.t = BC_LEX_OP_REL_NE;
3409 l->t.t = BC_LEX_OP_REL_LE;
3411 l->t.t = BC_LEX_OP_REL_GE;
3413 RETURN_STATUS(bc_error_bad_character(c));
3417 bc_lex_lineComment(l);
3420 if (isdigit(l->buf[l->i]))
3421 s = zbc_lex_number(l, c);
3423 s = bc_error_bad_character(c);
3441 s = zbc_lex_number(l, c);
3444 s = zdc_lex_string(l);
3447 l->t.t = BC_LEX_INVALID;
3448 s = bc_error_bad_character(c);
3456 static void bc_program_addFunc(char *name, size_t *idx);
3458 static void bc_parse_addFunc(BcParse *p, char *name, size_t *idx)
3460 bc_program_addFunc(name, idx);
3461 p->func = bc_program_func(p->fidx);
3464 static void bc_parse_push(BcParse *p, char i)
3466 dbg_lex("%s:%d pushing opcode %d", __func__, __LINE__, i);
3467 bc_vec_pushByte(&p->func->code, i);
3470 static void bc_parse_pushName(BcParse *p, char *name)
3473 bc_parse_push(p, *name++);
3474 bc_parse_push(p, BC_PARSE_STREND);
3477 static void bc_parse_pushIndex(BcParse *p, size_t idx)
3482 dbg_lex("%s:%d pushing index %zd", __func__, __LINE__, idx);
3483 mask = ((size_t)0xff) << (sizeof(idx) * 8 - 8);
3486 if (idx & mask) break;
3491 bc_parse_push(p, amt);
3494 bc_parse_push(p, (unsigned char)idx);
3499 static void bc_parse_pushJUMP(BcParse *p, size_t idx)
3501 bc_parse_push(p, BC_INST_JUMP);
3502 bc_parse_pushIndex(p, idx);
3505 static void bc_parse_pushJUMP_ZERO(BcParse *p, size_t idx)
3507 bc_parse_push(p, BC_INST_JUMP_ZERO);
3508 bc_parse_pushIndex(p, idx);
3511 static void bc_parse_number(BcParse *p)
3513 char *num = xstrdup(p->l.t.v.v);
3514 size_t idx = G.prog.consts.len;
3516 bc_vec_push(&G.prog.consts, &num);
3518 bc_parse_push(p, BC_INST_NUM);
3519 bc_parse_pushIndex(p, idx);
3522 IF_BC(static BC_STATUS zbc_parse_stmt_or_funcdef(BcParse *p);)
3523 IF_DC(static BC_STATUS zdc_parse_parse(BcParse *p);)
3525 // "Parse" half of "parse,execute,repeat" main loop
3526 static BC_STATUS zcommon_parse(BcParse *p)
3529 // FIXME: "eating" of stmt delemiters is coded inconsistently
3530 // (sometimes zbc_parse_stmt() eats the delimiter, sometimes don't),
3531 // which causes bugs such as "print 1 print 2" erroneously accepted,
3532 // or "print 1 else 2" detecting parse error only after executing
3534 IF_BC(RETURN_STATUS(zbc_parse_stmt_or_funcdef(p));)
3536 IF_DC(RETURN_STATUS(zdc_parse_parse(p));)
3538 #define zcommon_parse(...) (zcommon_parse(__VA_ARGS__) COMMA_SUCCESS)
3540 static BC_STATUS zbc_parse_text_init(BcParse *p, const char *text)
3542 p->func = bc_program_func(p->fidx);
3544 RETURN_STATUS(zbc_lex_text_init(&p->l, text));
3546 #define zbc_parse_text_init(...) (zbc_parse_text_init(__VA_ARGS__) COMMA_SUCCESS)
3548 // Called when parsing or execution detects a failure,
3549 // resets execution structures.
3550 static void bc_program_reset(void)
3555 bc_vec_npop(&G.prog.stack, G.prog.stack.len - 1);
3556 bc_vec_pop_all(&G.prog.results);
3558 f = bc_program_func(0);
3559 ip = bc_vec_top(&G.prog.stack);
3560 ip->idx = f->code.len;
3563 #define bc_parse_updateFunc(p, f) \
3564 ((p)->func = bc_program_func((p)->fidx = (f)))
3566 // Called when zbc/zdc_parse_parse() detects a failure,
3567 // resets parsing structures.
3568 static void bc_parse_reset(BcParse *p)
3570 if (p->fidx != BC_PROG_MAIN) {
3571 p->func->nparams = 0;
3572 bc_vec_pop_all(&p->func->code);
3573 bc_vec_pop_all(&p->func->autos);
3574 bc_vec_pop_all(&p->func->labels);
3576 bc_parse_updateFunc(p, BC_PROG_MAIN);
3580 p->l.t.t = BC_LEX_EOF;
3582 bc_vec_pop_all(&p->exits);
3583 bc_vec_pop_all(&p->conds);
3584 bc_vec_pop_all(&p->ops);
3589 static void bc_parse_free(BcParse *p)
3591 bc_vec_free(&p->exits);
3592 bc_vec_free(&p->conds);
3593 bc_vec_free(&p->ops);
3597 static void bc_parse_create(BcParse *p, size_t func)
3599 memset(p, 0, sizeof(BcParse));
3602 bc_vec_init(&p->exits, sizeof(size_t), NULL);
3603 bc_vec_init(&p->conds, sizeof(size_t), NULL);
3604 bc_vec_init(&p->ops, sizeof(BcLexType), NULL);
3606 bc_parse_updateFunc(p, func);
3611 #define BC_PARSE_TOP_OP(p) (*((BcLexType *) bc_vec_top(&(p)->ops)))
3612 #define BC_PARSE_LEAF(p, rparen) \
3613 (((p) >= BC_INST_NUM && (p) <= BC_INST_SQRT) || (rparen) || \
3614 (p) == BC_INST_INC_POST || (p) == BC_INST_DEC_POST)
3616 // We can calculate the conversion between tokens and exprs by subtracting the
3617 // position of the first operator in the lex enum and adding the position of the
3618 // first in the expr enum. Note: This only works for binary operators.
3619 #define BC_TOKEN_2_INST(t) ((char) ((t) - BC_LEX_NEG + BC_INST_NEG))
3621 static BcStatus bc_parse_expr_empty_ok(BcParse *p, uint8_t flags);
3623 static BC_STATUS zbc_parse_expr(BcParse *p, uint8_t flags)
3627 s = bc_parse_expr_empty_ok(p, flags);
3628 if (s == BC_STATUS_PARSE_EMPTY_EXP)
3629 RETURN_STATUS(bc_error("empty expression"));
3632 #define zbc_parse_expr(...) (zbc_parse_expr(__VA_ARGS__) COMMA_SUCCESS)
3634 static BC_STATUS zbc_parse_stmt_possibly_auto(BcParse *p, bool auto_allowed);
3635 #define zbc_parse_stmt_possibly_auto(...) (zbc_parse_stmt_possibly_auto(__VA_ARGS__) COMMA_SUCCESS)
3637 static BC_STATUS zbc_parse_stmt(BcParse *p)
3639 RETURN_STATUS(zbc_parse_stmt_possibly_auto(p, false));
3641 #define zbc_parse_stmt(...) (zbc_parse_stmt(__VA_ARGS__) COMMA_SUCCESS)
3643 static BC_STATUS zbc_parse_stmt_allow_NLINE_before(BcParse *p, const char *after_X)
3645 // "if(cond)<newline>stmt" is accepted too, but not 2+ newlines.
3646 // Same for "else", "while()", "for()".
3647 BcStatus s = zbc_lex_next_and_skip_NLINE(&p->l);
3648 if (s) RETURN_STATUS(s);
3649 if (p->l.t.t == BC_LEX_NLINE)
3650 RETURN_STATUS(bc_error_fmt("no statement after '%s'", after_X));
3652 RETURN_STATUS(zbc_parse_stmt(p));
3654 #define zbc_parse_stmt_allow_NLINE_before(...) (zbc_parse_stmt_allow_NLINE_before(__VA_ARGS__) COMMA_SUCCESS)
3656 static void bc_parse_operator(BcParse *p, BcLexType type, size_t start,
3659 char l, r = bc_parse_op_PREC(type - BC_LEX_OP_INC);
3660 bool left = bc_parse_op_LEFT(type - BC_LEX_OP_INC);
3662 while (p->ops.len > start) {
3663 BcLexType t = BC_PARSE_TOP_OP(p);
3664 if (t == BC_LEX_LPAREN) break;
3666 l = bc_parse_op_PREC(t - BC_LEX_OP_INC);
3667 if (l >= r && (l != r || !left)) break;
3669 bc_parse_push(p, BC_TOKEN_2_INST(t));
3670 bc_vec_pop(&p->ops);
3671 *nexprs -= (t != BC_LEX_OP_BOOL_NOT && t != BC_LEX_NEG);
3674 bc_vec_push(&p->ops, &type);
3677 static BC_STATUS zbc_parse_rightParen(BcParse *p, size_t ops_bgn, size_t *nexs)
3681 if (p->ops.len <= ops_bgn)
3682 RETURN_STATUS(bc_error_bad_expression());
3683 top = BC_PARSE_TOP_OP(p);
3685 while (top != BC_LEX_LPAREN) {
3686 bc_parse_push(p, BC_TOKEN_2_INST(top));
3688 bc_vec_pop(&p->ops);
3689 *nexs -= top != BC_LEX_OP_BOOL_NOT && top != BC_LEX_NEG;
3691 if (p->ops.len <= ops_bgn)
3692 RETURN_STATUS(bc_error_bad_expression());
3693 top = BC_PARSE_TOP_OP(p);
3696 bc_vec_pop(&p->ops);
3698 RETURN_STATUS(zbc_lex_next(&p->l));
3700 #define zbc_parse_rightParen(...) (zbc_parse_rightParen(__VA_ARGS__) COMMA_SUCCESS)
3702 static BC_STATUS zbc_parse_params(BcParse *p, uint8_t flags)
3707 dbg_lex("%s:%d p->l.t.t:%d", __func__, __LINE__, p->l.t.t);
3708 flags = (flags & ~(BC_PARSE_PRINT | BC_PARSE_REL)) | BC_PARSE_ARRAY;
3710 s = zbc_lex_next(&p->l);
3711 if (s) RETURN_STATUS(s);
3714 if (p->l.t.t != BC_LEX_RPAREN) {
3716 s = zbc_parse_expr(p, flags);
3717 if (s) RETURN_STATUS(s);
3719 if (p->l.t.t != BC_LEX_COMMA) {
3720 if (p->l.t.t == BC_LEX_RPAREN)
3722 RETURN_STATUS(bc_error_bad_token());
3724 s = zbc_lex_next(&p->l);
3725 if (s) RETURN_STATUS(s);
3729 bc_parse_push(p, BC_INST_CALL);
3730 bc_parse_pushIndex(p, nparams);
3732 RETURN_STATUS(BC_STATUS_SUCCESS);
3734 #define zbc_parse_params(...) (zbc_parse_params(__VA_ARGS__) COMMA_SUCCESS)
3736 static BC_STATUS zbc_parse_call(BcParse *p, char *name, uint8_t flags)
3739 BcId entry, *entry_ptr;
3744 s = zbc_parse_params(p, flags);
3747 if (p->l.t.t != BC_LEX_RPAREN) {
3748 s = bc_error_bad_token();
3752 idx = bc_map_index(&G.prog.fn_map, &entry);
3754 if (idx == BC_VEC_INVALID_IDX) {
3755 name = xstrdup(entry.name);
3756 bc_parse_addFunc(p, name, &idx);
3757 idx = bc_map_index(&G.prog.fn_map, &entry);
3762 entry_ptr = bc_vec_item(&G.prog.fn_map, idx);
3763 bc_parse_pushIndex(p, entry_ptr->idx);
3765 RETURN_STATUS(zbc_lex_next(&p->l));
3771 #define zbc_parse_call(...) (zbc_parse_call(__VA_ARGS__) COMMA_SUCCESS)
3773 static BC_STATUS zbc_parse_name(BcParse *p, BcInst *type, uint8_t flags)
3778 name = xstrdup(p->l.t.v.v);
3779 s = zbc_lex_next(&p->l);
3782 if (p->l.t.t == BC_LEX_LBRACKET) {
3783 s = zbc_lex_next(&p->l);
3786 if (p->l.t.t == BC_LEX_RBRACKET) {
3787 if (!(flags & BC_PARSE_ARRAY)) {
3788 s = bc_error_bad_expression();
3791 *type = BC_INST_ARRAY;
3793 *type = BC_INST_ARRAY_ELEM;
3794 flags &= ~(BC_PARSE_PRINT | BC_PARSE_REL);
3795 s = zbc_parse_expr(p, flags);
3798 s = zbc_lex_next(&p->l);
3800 bc_parse_push(p, *type);
3801 bc_parse_pushName(p, name);
3804 else if (p->l.t.t == BC_LEX_LPAREN) {
3805 if (flags & BC_PARSE_NOCALL) {
3806 s = bc_error_bad_token();
3809 *type = BC_INST_CALL;
3810 s = zbc_parse_call(p, name, flags);
3812 *type = BC_INST_VAR;
3813 bc_parse_push(p, BC_INST_VAR);
3814 bc_parse_pushName(p, name);
3824 #define zbc_parse_name(...) (zbc_parse_name(__VA_ARGS__) COMMA_SUCCESS)
3826 static BC_STATUS zbc_parse_read(BcParse *p)
3830 s = zbc_lex_next(&p->l);
3831 if (s) RETURN_STATUS(s);
3832 if (p->l.t.t != BC_LEX_LPAREN) RETURN_STATUS(bc_error_bad_token());
3834 s = zbc_lex_next(&p->l);
3835 if (s) RETURN_STATUS(s);
3836 if (p->l.t.t != BC_LEX_RPAREN) RETURN_STATUS(bc_error_bad_token());
3838 bc_parse_push(p, BC_INST_READ);
3840 RETURN_STATUS(zbc_lex_next(&p->l));
3842 #define zbc_parse_read(...) (zbc_parse_read(__VA_ARGS__) COMMA_SUCCESS)
3844 static BC_STATUS zbc_parse_builtin(BcParse *p, BcLexType type, uint8_t flags,
3849 s = zbc_lex_next(&p->l);
3850 if (s) RETURN_STATUS(s);
3851 if (p->l.t.t != BC_LEX_LPAREN) RETURN_STATUS(bc_error_bad_token());
3853 flags = (flags & ~(BC_PARSE_PRINT | BC_PARSE_REL)) | BC_PARSE_ARRAY;
3855 s = zbc_lex_next(&p->l);
3856 if (s) RETURN_STATUS(s);
3858 s = zbc_parse_expr(p, flags);
3859 if (s) RETURN_STATUS(s);
3861 if (p->l.t.t != BC_LEX_RPAREN) RETURN_STATUS(bc_error_bad_token());
3863 *prev = (type == BC_LEX_KEY_LENGTH) ? BC_INST_LENGTH : BC_INST_SQRT;
3864 bc_parse_push(p, *prev);
3866 RETURN_STATUS(zbc_lex_next(&p->l));
3868 #define zbc_parse_builtin(...) (zbc_parse_builtin(__VA_ARGS__) COMMA_SUCCESS)
3870 static BC_STATUS zbc_parse_scale(BcParse *p, BcInst *type, uint8_t flags)
3874 s = zbc_lex_next(&p->l);
3875 if (s) RETURN_STATUS(s);
3877 if (p->l.t.t != BC_LEX_LPAREN) {
3878 *type = BC_INST_SCALE;
3879 bc_parse_push(p, BC_INST_SCALE);
3880 RETURN_STATUS(BC_STATUS_SUCCESS);
3883 *type = BC_INST_SCALE_FUNC;
3884 flags &= ~(BC_PARSE_PRINT | BC_PARSE_REL);
3886 s = zbc_lex_next(&p->l);
3887 if (s) RETURN_STATUS(s);
3889 s = zbc_parse_expr(p, flags);
3890 if (s) RETURN_STATUS(s);
3891 if (p->l.t.t != BC_LEX_RPAREN)
3892 RETURN_STATUS(bc_error_bad_token());
3893 bc_parse_push(p, BC_INST_SCALE_FUNC);
3895 RETURN_STATUS(zbc_lex_next(&p->l));
3897 #define zbc_parse_scale(...) (zbc_parse_scale(__VA_ARGS__) COMMA_SUCCESS)
3899 static BC_STATUS zbc_parse_incdec(BcParse *p, BcInst *prev, bool *paren_expr,
3900 size_t *nexprs, uint8_t flags)
3905 BcInst etype = *prev;
3907 if (etype == BC_INST_VAR || etype == BC_INST_ARRAY_ELEM ||
3908 etype == BC_INST_SCALE || etype == BC_INST_LAST ||
3909 etype == BC_INST_IBASE || etype == BC_INST_OBASE)
3911 *prev = inst = BC_INST_INC_POST + (p->l.t.t != BC_LEX_OP_INC);
3912 bc_parse_push(p, inst);
3913 s = zbc_lex_next(&p->l);
3916 *prev = inst = BC_INST_INC_PRE + (p->l.t.t != BC_LEX_OP_INC);
3919 s = zbc_lex_next(&p->l);
3920 if (s) RETURN_STATUS(s);
3923 // Because we parse the next part of the expression
3924 // right here, we need to increment this.
3925 *nexprs = *nexprs + 1;
3929 s = zbc_parse_name(p, prev, flags | BC_PARSE_NOCALL);
3931 case BC_LEX_KEY_IBASE:
3932 case BC_LEX_KEY_LAST:
3933 case BC_LEX_KEY_OBASE:
3934 bc_parse_push(p, type - BC_LEX_KEY_IBASE + BC_INST_IBASE);
3935 s = zbc_lex_next(&p->l);
3937 case BC_LEX_KEY_SCALE:
3938 s = zbc_lex_next(&p->l);
3939 if (s) RETURN_STATUS(s);
3940 if (p->l.t.t == BC_LEX_LPAREN)
3941 s = bc_error_bad_token();
3943 bc_parse_push(p, BC_INST_SCALE);
3946 s = bc_error_bad_token();
3950 if (!s) bc_parse_push(p, inst);
3955 #define zbc_parse_incdec(...) (zbc_parse_incdec(__VA_ARGS__) COMMA_SUCCESS)
3957 static BC_STATUS zbc_parse_minus(BcParse *p, BcInst *prev, size_t ops_bgn,
3958 bool rparen, size_t *nexprs)
3962 BcInst etype = *prev;
3964 s = zbc_lex_next(&p->l);
3965 if (s) RETURN_STATUS(s);
3967 type = rparen || etype == BC_INST_INC_POST || etype == BC_INST_DEC_POST ||
3968 (etype >= BC_INST_NUM && etype <= BC_INST_SQRT) ?
3971 *prev = BC_TOKEN_2_INST(type);
3973 // We can just push onto the op stack because this is the largest
3974 // precedence operator that gets pushed. Inc/dec does not.
3975 if (type != BC_LEX_OP_MINUS)
3976 bc_vec_push(&p->ops, &type);
3978 bc_parse_operator(p, type, ops_bgn, nexprs);
3982 #define zbc_parse_minus(...) (zbc_parse_minus(__VA_ARGS__) COMMA_SUCCESS)
3984 static BC_STATUS zbc_parse_string(BcParse *p, char inst)
3986 char *str = xstrdup(p->l.t.v.v);
3988 bc_parse_push(p, BC_INST_STR);
3989 bc_parse_pushIndex(p, G.prog.strs.len);
3990 bc_vec_push(&G.prog.strs, &str);
3991 bc_parse_push(p, inst);
3993 RETURN_STATUS(zbc_lex_next(&p->l));
3995 #define zbc_parse_string(...) (zbc_parse_string(__VA_ARGS__) COMMA_SUCCESS)
3997 static BC_STATUS zbc_parse_print(BcParse *p)
4003 s = zbc_lex_next(&p->l);
4004 if (s) RETURN_STATUS(s);
4006 if (type == BC_LEX_STR) {
4007 s = zbc_parse_string(p, BC_INST_PRINT_POP);
4009 s = zbc_parse_expr(p, 0);
4010 bc_parse_push(p, BC_INST_PRINT_POP);
4012 if (s) RETURN_STATUS(s);
4013 if (p->l.t.t != BC_LEX_COMMA)
4019 #define zbc_parse_print(...) (zbc_parse_print(__VA_ARGS__) COMMA_SUCCESS)
4021 static BC_STATUS zbc_parse_return(BcParse *p)
4026 dbg_lex_enter("%s:%d entered", __func__, __LINE__);
4027 s = zbc_lex_next(&p->l);
4028 if (s) RETURN_STATUS(s);
4031 if (t == BC_LEX_NLINE || t == BC_LEX_SCOLON)
4032 bc_parse_push(p, BC_INST_RET0);
4034 bool paren = (t == BC_LEX_LPAREN);
4035 s = bc_parse_expr_empty_ok(p, 0);
4036 if (s == BC_STATUS_PARSE_EMPTY_EXP) {
4037 bc_parse_push(p, BC_INST_RET0);
4038 s = zbc_lex_next(&p->l);
4040 if (s) RETURN_STATUS(s);
4042 if (!paren || p->l.t.last != BC_LEX_RPAREN) {
4043 s = bc_POSIX_requires("parentheses around return expressions");
4044 IF_ERROR_RETURN_POSSIBLE(if (s) RETURN_STATUS(s));
4047 bc_parse_push(p, BC_INST_RET);
4050 dbg_lex_done("%s:%d done", __func__, __LINE__);
4053 #define zbc_parse_return(...) (zbc_parse_return(__VA_ARGS__) COMMA_SUCCESS)
4055 static void rewrite_label_to_current(BcParse *p, size_t idx)
4057 size_t *label = bc_vec_item(&p->func->labels, idx);
4058 *label = p->func->code.len;
4061 static BC_STATUS zbc_parse_if(BcParse *p)
4066 dbg_lex_enter("%s:%d entered", __func__, __LINE__);
4067 s = zbc_lex_next(&p->l);
4068 if (s) RETURN_STATUS(s);
4069 if (p->l.t.t != BC_LEX_LPAREN) RETURN_STATUS(bc_error_bad_token());
4071 s = zbc_lex_next(&p->l);
4072 if (s) RETURN_STATUS(s);
4073 s = zbc_parse_expr(p, BC_PARSE_REL);
4074 if (s) RETURN_STATUS(s);
4076 if (p->l.t.t != BC_LEX_RPAREN) RETURN_STATUS(bc_error_bad_token());
4078 ip_idx = p->func->labels.len;
4079 bc_parse_pushJUMP_ZERO(p, ip_idx);
4080 bc_vec_push(&p->func->labels, &ip_idx);
4082 s = zbc_parse_stmt_allow_NLINE_before(p, STRING_if);
4083 if (s) RETURN_STATUS(s);
4085 dbg_lex("%s:%d in if after stmt: p->l.t.t:%d", __func__, __LINE__, p->l.t.t);
4086 if (p->l.t.t == BC_LEX_KEY_ELSE) {
4089 ip2_idx = p->func->labels.len;
4091 dbg_lex("%s:%d after if() body: BC_INST_JUMP to %zd", __func__, __LINE__, ip2_idx);
4092 bc_parse_pushJUMP(p, ip2_idx);
4094 dbg_lex("%s:%d rewriting 'if_zero' label to jump to 'else'-> %zd", __func__, __LINE__, p->func->code.len);
4095 rewrite_label_to_current(p, ip_idx);
4097 bc_vec_push(&p->func->labels, &ip2_idx);
4100 s = zbc_parse_stmt_allow_NLINE_before(p, STRING_else);
4101 if (s) RETURN_STATUS(s);
4104 dbg_lex("%s:%d rewriting label to jump after 'if' body-> %zd", __func__, __LINE__, p->func->code.len);
4105 rewrite_label_to_current(p, ip_idx);
4107 dbg_lex_done("%s:%d done", __func__, __LINE__);
4110 #define zbc_parse_if(...) (zbc_parse_if(__VA_ARGS__) COMMA_SUCCESS)
4112 static BC_STATUS zbc_parse_while(BcParse *p)
4118 s = zbc_lex_next(&p->l);
4119 if (s) RETURN_STATUS(s);
4120 if (p->l.t.t != BC_LEX_LPAREN) RETURN_STATUS(bc_error_bad_token());
4121 s = zbc_lex_next(&p->l);
4122 if (s) RETURN_STATUS(s);
4124 cond_idx = p->func->labels.len;
4125 ip_idx = cond_idx + 1;
4127 bc_vec_push(&p->func->labels, &p->func->code.len);
4128 bc_vec_push(&p->conds, &cond_idx);
4130 bc_vec_push(&p->exits, &ip_idx);
4131 bc_vec_push(&p->func->labels, &ip_idx);
4133 s = zbc_parse_expr(p, BC_PARSE_REL);
4134 if (s) RETURN_STATUS(s);
4135 if (p->l.t.t != BC_LEX_RPAREN) RETURN_STATUS(bc_error_bad_token());
4137 bc_parse_pushJUMP_ZERO(p, ip_idx);
4139 s = zbc_parse_stmt_allow_NLINE_before(p, STRING_while);
4140 if (s) RETURN_STATUS(s);
4142 dbg_lex("%s:%d BC_INST_JUMP to %zd", __func__, __LINE__, cond_idx);
4143 bc_parse_pushJUMP(p, cond_idx);
4145 dbg_lex("%s:%d rewriting label-> %zd", __func__, __LINE__, p->func->code.len);
4146 rewrite_label_to_current(p, ip_idx);
4148 bc_vec_pop(&p->exits);
4149 bc_vec_pop(&p->conds);
4153 #define zbc_parse_while(...) (zbc_parse_while(__VA_ARGS__) COMMA_SUCCESS)
4155 static BC_STATUS zbc_parse_for(BcParse *p)
4158 size_t cond_idx, exit_idx, body_idx, update_idx;
4160 dbg_lex("%s:%d p->l.t.t:%d", __func__, __LINE__, p->l.t.t);
4161 s = zbc_lex_next(&p->l);
4162 if (s) RETURN_STATUS(s);
4163 if (p->l.t.t != BC_LEX_LPAREN) RETURN_STATUS(bc_error_bad_token());
4164 s = zbc_lex_next(&p->l);
4165 if (s) RETURN_STATUS(s);
4167 if (p->l.t.t != BC_LEX_SCOLON)
4168 s = zbc_parse_expr(p, 0);
4170 s = bc_POSIX_does_not_allow_empty_X_expression_in_for("init");
4172 if (s) RETURN_STATUS(s);
4173 if (p->l.t.t != BC_LEX_SCOLON) RETURN_STATUS(bc_error_bad_token());
4174 s = zbc_lex_next(&p->l);
4175 if (s) RETURN_STATUS(s);
4177 cond_idx = p->func->labels.len;
4178 update_idx = cond_idx + 1;
4179 body_idx = update_idx + 1;
4180 exit_idx = body_idx + 1;
4182 bc_vec_push(&p->func->labels, &p->func->code.len);
4184 if (p->l.t.t != BC_LEX_SCOLON)
4185 s = zbc_parse_expr(p, BC_PARSE_REL);
4187 s = bc_POSIX_does_not_allow_empty_X_expression_in_for("condition");
4189 if (s) RETURN_STATUS(s);
4190 if (p->l.t.t != BC_LEX_SCOLON) RETURN_STATUS(bc_error_bad_token());
4192 s = zbc_lex_next(&p->l);
4193 if (s) RETURN_STATUS(s);
4195 bc_parse_pushJUMP_ZERO(p, exit_idx);
4196 bc_parse_pushJUMP(p, body_idx);
4198 bc_vec_push(&p->conds, &update_idx);
4199 bc_vec_push(&p->func->labels, &p->func->code.len);
4201 if (p->l.t.t != BC_LEX_RPAREN)
4202 s = zbc_parse_expr(p, 0);
4204 s = bc_POSIX_does_not_allow_empty_X_expression_in_for("update");
4206 if (s) RETURN_STATUS(s);
4208 if (p->l.t.t != BC_LEX_RPAREN) RETURN_STATUS(bc_error_bad_token());
4209 bc_parse_pushJUMP(p, cond_idx);
4210 bc_vec_push(&p->func->labels, &p->func->code.len);
4212 bc_vec_push(&p->exits, &exit_idx);
4213 bc_vec_push(&p->func->labels, &exit_idx);
4215 s = zbc_parse_stmt_allow_NLINE_before(p, STRING_for);
4216 if (s) RETURN_STATUS(s);
4218 dbg_lex("%s:%d BC_INST_JUMP to %zd", __func__, __LINE__, update_idx);
4219 bc_parse_pushJUMP(p, update_idx);
4221 dbg_lex("%s:%d rewriting label-> %zd", __func__, __LINE__, p->func->code.len);
4222 rewrite_label_to_current(p, exit_idx);
4224 bc_vec_pop(&p->exits);
4225 bc_vec_pop(&p->conds);
4227 RETURN_STATUS(BC_STATUS_SUCCESS);
4229 #define zbc_parse_for(...) (zbc_parse_for(__VA_ARGS__) COMMA_SUCCESS)
4231 static BC_STATUS zbc_parse_break_or_continue(BcParse *p, BcLexType type)
4236 if (type == BC_LEX_KEY_BREAK) {
4237 if (p->exits.len == 0) // none of the enclosing blocks is a loop
4238 RETURN_STATUS(bc_error_bad_token());
4239 i = *(size_t*)bc_vec_top(&p->exits);
4241 i = *(size_t*)bc_vec_top(&p->conds);
4244 bc_parse_pushJUMP(p, i);
4246 s = zbc_lex_next(&p->l);
4247 if (s) RETURN_STATUS(s);
4249 if (p->l.t.t != BC_LEX_SCOLON && p->l.t.t != BC_LEX_NLINE)
4250 RETURN_STATUS(bc_error_bad_token());
4252 RETURN_STATUS(zbc_lex_next(&p->l));
4254 #define zbc_parse_break_or_continue(...) (zbc_parse_break_or_continue(__VA_ARGS__) COMMA_SUCCESS)
4256 static BC_STATUS zbc_parse_funcdef(BcParse *p)
4259 bool var, comma = false;
4262 dbg_lex_enter("%s:%d entered", __func__, __LINE__);
4263 s = zbc_lex_next(&p->l);
4264 if (s) RETURN_STATUS(s);
4265 if (p->l.t.t != BC_LEX_NAME)
4266 RETURN_STATUS(bc_error("bad function definition"));
4268 name = xstrdup(p->l.t.v.v);
4269 bc_parse_addFunc(p, name, &p->fidx);
4271 s = zbc_lex_next(&p->l);
4272 if (s) RETURN_STATUS(s);
4273 if (p->l.t.t != BC_LEX_LPAREN)
4274 RETURN_STATUS(bc_error("bad function definition"));
4275 s = zbc_lex_next(&p->l);
4276 if (s) RETURN_STATUS(s);
4278 while (p->l.t.t != BC_LEX_RPAREN) {
4279 if (p->l.t.t != BC_LEX_NAME)
4280 RETURN_STATUS(bc_error("bad function definition"));
4284 name = xstrdup(p->l.t.v.v);
4285 s = zbc_lex_next(&p->l);
4288 var = p->l.t.t != BC_LEX_LBRACKET;
4291 s = zbc_lex_next(&p->l);
4294 if (p->l.t.t != BC_LEX_RBRACKET) {
4295 s = bc_error("bad function definition");
4299 s = zbc_lex_next(&p->l);
4303 comma = p->l.t.t == BC_LEX_COMMA;
4305 s = zbc_lex_next(&p->l);
4309 s = zbc_func_insert(p->func, name, var);
4313 if (comma) RETURN_STATUS(bc_error("bad function definition"));
4315 s = zbc_lex_next(&p->l);
4316 if (s) RETURN_STATUS(s);
4318 if (p->l.t.t != BC_LEX_LBRACE)
4319 s = bc_POSIX_requires("the left brace be on the same line as the function header");
4321 // Prevent "define z()<newline>" from being interpreted as function with empty stmt as body
4322 s = zbc_lex_skip_if_at_NLINE(&p->l);
4323 if (s) RETURN_STATUS(s);
4324 //GNU bc requires a {} block even if function body has single stmt, enforce this?
4325 if (p->l.t.t != BC_LEX_LBRACE)
4326 RETURN_STATUS(bc_error("function { body } expected"));
4328 p->in_funcdef++; // to determine whether "return" stmt is allowed, and such
4329 s = zbc_parse_stmt_possibly_auto(p, true);
4331 if (s) RETURN_STATUS(s);
4333 bc_parse_push(p, BC_INST_RET0);
4334 bc_parse_updateFunc(p, BC_PROG_MAIN);
4336 dbg_lex_done("%s:%d done", __func__, __LINE__);
4340 dbg_lex_done("%s:%d done (error)", __func__, __LINE__);
4344 #define zbc_parse_funcdef(...) (zbc_parse_funcdef(__VA_ARGS__) COMMA_SUCCESS)
4346 static BC_STATUS zbc_parse_auto(BcParse *p)
4349 bool comma, var, one;
4352 dbg_lex_enter("%s:%d entered", __func__, __LINE__);
4353 s = zbc_lex_next(&p->l);
4354 if (s) RETURN_STATUS(s);
4357 one = p->l.t.t == BC_LEX_NAME;
4359 while (p->l.t.t == BC_LEX_NAME) {
4360 name = xstrdup(p->l.t.v.v);
4361 s = zbc_lex_next(&p->l);
4364 var = p->l.t.t != BC_LEX_LBRACKET;
4366 s = zbc_lex_next(&p->l);
4369 if (p->l.t.t != BC_LEX_RBRACKET) {
4370 s = bc_error("bad function definition");
4374 s = zbc_lex_next(&p->l);
4378 comma = p->l.t.t == BC_LEX_COMMA;
4380 s = zbc_lex_next(&p->l);
4384 s = zbc_func_insert(p->func, name, var);
4388 if (comma) RETURN_STATUS(bc_error("bad function definition"));
4389 if (!one) RETURN_STATUS(bc_error("no auto variable found"));
4391 if (p->l.t.t != BC_LEX_NLINE && p->l.t.t != BC_LEX_SCOLON)
4392 RETURN_STATUS(bc_error_bad_token());
4394 dbg_lex_done("%s:%d done", __func__, __LINE__);
4395 RETURN_STATUS(zbc_lex_next(&p->l));
4399 dbg_lex_done("%s:%d done (ERROR)", __func__, __LINE__);
4402 #define zbc_parse_auto(...) (zbc_parse_auto(__VA_ARGS__) COMMA_SUCCESS)
4404 #undef zbc_parse_stmt_possibly_auto
4405 static BC_STATUS zbc_parse_stmt_possibly_auto(BcParse *p, bool auto_allowed)
4407 BcStatus s = BC_STATUS_SUCCESS;
4409 dbg_lex_enter("%s:%d entered, p->l.t.t:%d", __func__, __LINE__, p->l.t.t);
4411 if (p->l.t.t == BC_LEX_NLINE) {
4412 dbg_lex_done("%s:%d done (seen BC_LEX_NLINE)", __func__, __LINE__);
4413 RETURN_STATUS(zbc_lex_next(&p->l));
4415 if (p->l.t.t == BC_LEX_SCOLON) {
4416 dbg_lex_done("%s:%d done (seen BC_LEX_SCOLON)", __func__, __LINE__);
4417 RETURN_STATUS(zbc_lex_next(&p->l));
4420 if (p->l.t.t == BC_LEX_LBRACE) {
4421 dbg_lex("%s:%d BC_LEX_LBRACE: (auto_allowed:%d)", __func__, __LINE__, auto_allowed);
4423 s = zbc_lex_next(&p->l);
4424 if (s) RETURN_STATUS(s);
4425 } while (p->l.t.t == BC_LEX_NLINE);
4426 if (auto_allowed && p->l.t.t == BC_LEX_KEY_AUTO) {
4427 dbg_lex("%s:%d calling zbc_parse_auto()", __func__, __LINE__);
4428 s = zbc_parse_auto(p);
4429 if (s) RETURN_STATUS(s);
4431 while (p->l.t.t != BC_LEX_RBRACE) {
4432 dbg_lex("%s:%d block parsing loop", __func__, __LINE__);
4433 s = zbc_parse_stmt(p);
4434 if (s) RETURN_STATUS(s);
4436 s = zbc_lex_next(&p->l);
4437 dbg_lex_done("%s:%d done (seen BC_LEX_RBRACE)", __func__, __LINE__);
4441 dbg_lex("%s:%d p->l.t.t:%d", __func__, __LINE__, p->l.t.t);
4445 case BC_LEX_OP_MINUS:
4446 case BC_LEX_OP_BOOL_NOT:
4450 case BC_LEX_KEY_IBASE:
4451 case BC_LEX_KEY_LAST:
4452 case BC_LEX_KEY_LENGTH:
4453 case BC_LEX_KEY_OBASE:
4454 case BC_LEX_KEY_READ:
4455 case BC_LEX_KEY_SCALE:
4456 case BC_LEX_KEY_SQRT:
4457 s = zbc_parse_expr(p, BC_PARSE_PRINT);
4460 s = zbc_parse_string(p, BC_INST_PRINT_STR);
4462 case BC_LEX_KEY_BREAK:
4463 case BC_LEX_KEY_CONTINUE:
4464 s = zbc_parse_break_or_continue(p, p->l.t.t);
4466 case BC_LEX_KEY_FOR:
4467 s = zbc_parse_for(p);
4469 case BC_LEX_KEY_HALT:
4470 bc_parse_push(p, BC_INST_HALT);
4471 s = zbc_lex_next(&p->l);
4474 s = zbc_parse_if(p);
4476 case BC_LEX_KEY_LIMITS:
4477 // "limits" is a compile-time command,
4478 // the output is produced at _parse time_.
4480 "BC_BASE_MAX = "BC_MAX_OBASE_STR "\n"
4481 "BC_DIM_MAX = "BC_MAX_DIM_STR "\n"
4482 "BC_SCALE_MAX = "BC_MAX_SCALE_STR "\n"
4483 "BC_STRING_MAX = "BC_MAX_STRING_STR"\n"
4484 "BC_NAME_MAX = "BC_MAX_NAME_STR "\n"
4485 "BC_NUM_MAX = "BC_MAX_NUM_STR "\n"
4486 "MAX Exponent = "BC_MAX_EXP_STR "\n"
4487 "Number of vars = "BC_MAX_VARS_STR "\n"
4489 s = zbc_lex_next(&p->l);
4491 case BC_LEX_KEY_PRINT:
4492 s = zbc_parse_print(p);
4494 case BC_LEX_KEY_QUIT:
4495 // "quit" is a compile-time command. For example,
4496 // "if (0 == 1) quit" terminates when parsing the statement,
4497 // not when it is executed
4498 QUIT_OR_RETURN_TO_MAIN;
4499 case BC_LEX_KEY_RETURN:
4501 RETURN_STATUS(bc_error("'return' not in a function"));
4502 s = zbc_parse_return(p);
4504 case BC_LEX_KEY_WHILE:
4505 s = zbc_parse_while(p);
4508 s = bc_error_bad_token();
4512 if (s || G_interrupt) {
4514 s = BC_STATUS_FAILURE;
4517 dbg_lex_done("%s:%d done", __func__, __LINE__);
4520 #define zbc_parse_stmt_possibly_auto(...) (zbc_parse_stmt_possibly_auto(__VA_ARGS__) COMMA_SUCCESS)
4522 static BC_STATUS zbc_parse_stmt_or_funcdef(BcParse *p)
4526 dbg_lex_enter("%s:%d entered", __func__, __LINE__);
4527 if (p->l.t.t == BC_LEX_EOF)
4528 s = bc_error("end of file");
4529 else if (p->l.t.t == BC_LEX_KEY_DEFINE) {
4530 dbg_lex("%s:%d p->l.t.t:BC_LEX_KEY_DEFINE", __func__, __LINE__);
4531 s = zbc_parse_funcdef(p);
4533 dbg_lex("%s:%d p->l.t.t:%d (not BC_LEX_KEY_DEFINE)", __func__, __LINE__, p->l.t.t);
4534 s = zbc_parse_stmt(p);
4537 dbg_lex_done("%s:%d done", __func__, __LINE__);
4540 #define zbc_parse_stmt_or_funcdef(...) (zbc_parse_stmt_or_funcdef(__VA_ARGS__) COMMA_SUCCESS)
4542 // This is not a "z" function: can also return BC_STATUS_PARSE_EMPTY_EXP
4543 static BcStatus bc_parse_expr_empty_ok(BcParse *p, uint8_t flags)
4545 BcStatus s = BC_STATUS_SUCCESS;
4546 BcInst prev = BC_INST_PRINT;
4547 BcLexType top, t = p->l.t.t;
4548 size_t nexprs = 0, ops_bgn = p->ops.len;
4549 unsigned nparens, nrelops;
4550 bool paren_first, paren_expr, rprn, done, get_token, assign, bin_last;
4552 dbg_lex_enter("%s:%d entered", __func__, __LINE__);
4553 paren_first = p->l.t.t == BC_LEX_LPAREN;
4554 nparens = nrelops = 0;
4555 paren_expr = rprn = done = get_token = assign = false;
4558 for (; !G_interrupt && !s && !done && bc_parse_exprs(t); t = p->l.t.t) {
4564 s = zbc_parse_incdec(p, &prev, &paren_expr, &nexprs, flags);
4565 rprn = get_token = bin_last = false;
4569 case BC_LEX_OP_MINUS:
4571 s = zbc_parse_minus(p, &prev, ops_bgn, rprn, &nexprs);
4572 rprn = get_token = false;
4573 bin_last = prev == BC_INST_MINUS;
4577 case BC_LEX_OP_ASSIGN_POWER:
4578 case BC_LEX_OP_ASSIGN_MULTIPLY:
4579 case BC_LEX_OP_ASSIGN_DIVIDE:
4580 case BC_LEX_OP_ASSIGN_MODULUS:
4581 case BC_LEX_OP_ASSIGN_PLUS:
4582 case BC_LEX_OP_ASSIGN_MINUS:
4583 case BC_LEX_OP_ASSIGN:
4585 if (prev != BC_INST_VAR && prev != BC_INST_ARRAY_ELEM &&
4586 prev != BC_INST_SCALE && prev != BC_INST_IBASE &&
4587 prev != BC_INST_OBASE && prev != BC_INST_LAST)
4589 s = bc_error("bad assignment:"
4590 " left side must be variable"
4592 ); // note: shared string
4597 case BC_LEX_OP_POWER:
4598 case BC_LEX_OP_MULTIPLY:
4599 case BC_LEX_OP_DIVIDE:
4600 case BC_LEX_OP_MODULUS:
4601 case BC_LEX_OP_PLUS:
4602 case BC_LEX_OP_REL_EQ:
4603 case BC_LEX_OP_REL_LE:
4604 case BC_LEX_OP_REL_GE:
4605 case BC_LEX_OP_REL_NE:
4606 case BC_LEX_OP_REL_LT:
4607 case BC_LEX_OP_REL_GT:
4608 case BC_LEX_OP_BOOL_NOT:
4609 case BC_LEX_OP_BOOL_OR:
4610 case BC_LEX_OP_BOOL_AND:
4612 if (((t == BC_LEX_OP_BOOL_NOT) != bin_last)
4613 || (t != BC_LEX_OP_BOOL_NOT && prev == BC_INST_BOOL_NOT)
4615 return bc_error_bad_expression();
4618 nrelops += t >= BC_LEX_OP_REL_EQ && t <= BC_LEX_OP_REL_GT;
4619 prev = BC_TOKEN_2_INST(t);
4620 bc_parse_operator(p, t, ops_bgn, &nexprs);
4621 s = zbc_lex_next(&p->l);
4622 rprn = get_token = false;
4623 bin_last = t != BC_LEX_OP_BOOL_NOT;
4630 if (BC_PARSE_LEAF(prev, rprn))
4631 return bc_error_bad_expression();
4633 paren_expr = rprn = bin_last = false;
4635 bc_vec_push(&p->ops, &t);
4642 if (bin_last || prev == BC_INST_BOOL_NOT)
4643 return bc_error_bad_expression();
4646 s = BC_STATUS_SUCCESS;
4651 else if (!paren_expr) {
4652 dbg_lex_done("%s:%d done (returning EMPTY_EXP)", __func__, __LINE__);
4653 return BC_STATUS_PARSE_EMPTY_EXP;
4657 paren_expr = rprn = true;
4658 get_token = bin_last = false;
4660 s = zbc_parse_rightParen(p, ops_bgn, &nexprs);
4667 if (BC_PARSE_LEAF(prev, rprn))
4668 return bc_error_bad_expression();
4670 rprn = get_token = bin_last = false;
4671 s = zbc_parse_name(p, &prev, flags & ~BC_PARSE_NOCALL);
4679 if (BC_PARSE_LEAF(prev, rprn))
4680 return bc_error_bad_expression();
4684 paren_expr = get_token = true;
4685 rprn = bin_last = false;
4690 case BC_LEX_KEY_IBASE:
4691 case BC_LEX_KEY_LAST:
4692 case BC_LEX_KEY_OBASE:
4694 if (BC_PARSE_LEAF(prev, rprn))
4695 return bc_error_bad_expression();
4696 prev = (char) (t - BC_LEX_KEY_IBASE + BC_INST_IBASE);
4697 bc_parse_push(p, (char) prev);
4699 paren_expr = get_token = true;
4700 rprn = bin_last = false;
4706 case BC_LEX_KEY_LENGTH:
4707 case BC_LEX_KEY_SQRT:
4709 if (BC_PARSE_LEAF(prev, rprn))
4710 return bc_error_bad_expression();
4711 s = zbc_parse_builtin(p, t, flags, &prev);
4713 rprn = get_token = bin_last = false;
4719 case BC_LEX_KEY_READ:
4721 if (BC_PARSE_LEAF(prev, rprn))
4722 return bc_error_bad_expression();
4723 else if (flags & BC_PARSE_NOREAD)
4724 s = bc_error_nested_read_call();
4726 s = zbc_parse_read(p);
4729 rprn = get_token = bin_last = false;
4731 prev = BC_INST_READ;
4736 case BC_LEX_KEY_SCALE:
4738 if (BC_PARSE_LEAF(prev, rprn))
4739 return bc_error_bad_expression();
4740 s = zbc_parse_scale(p, &prev, flags);
4742 rprn = get_token = bin_last = false;
4744 prev = BC_INST_SCALE;
4751 s = bc_error_bad_token();
4756 if (!s && get_token) s = zbc_lex_next(&p->l);
4760 if (G_interrupt) return BC_STATUS_FAILURE; // ^C: stop parsing
4762 while (p->ops.len > ops_bgn) {
4764 top = BC_PARSE_TOP_OP(p);
4765 assign = top >= BC_LEX_OP_ASSIGN_POWER && top <= BC_LEX_OP_ASSIGN;
4767 if (top == BC_LEX_LPAREN || top == BC_LEX_RPAREN)
4768 return bc_error_bad_expression();
4770 bc_parse_push(p, BC_TOKEN_2_INST(top));
4772 nexprs -= top != BC_LEX_OP_BOOL_NOT && top != BC_LEX_NEG;
4773 bc_vec_pop(&p->ops);
4776 if (prev == BC_INST_BOOL_NOT || nexprs != 1)
4777 return bc_error_bad_expression();
4779 if (!(flags & BC_PARSE_REL) && nrelops) {
4780 s = bc_POSIX_does_not_allow("comparison operators outside if or loops");
4781 IF_ERROR_RETURN_POSSIBLE(if (s) return s);
4783 else if ((flags & BC_PARSE_REL) && nrelops > 1) {
4784 s = bc_POSIX_requires("exactly one comparison operator per condition");
4785 IF_ERROR_RETURN_POSSIBLE(if (s) return s);
4788 if (flags & BC_PARSE_PRINT) {
4789 if (paren_first || !assign) bc_parse_push(p, BC_INST_PRINT);
4790 bc_parse_push(p, BC_INST_POP);
4793 dbg_lex_done("%s:%d done", __func__, __LINE__);
4801 static BC_STATUS zdc_parse_register(BcParse *p)
4805 s = zbc_lex_next(&p->l);
4806 if (s) RETURN_STATUS(s);
4807 if (p->l.t.t != BC_LEX_NAME) RETURN_STATUS(bc_error_bad_token());
4809 bc_parse_pushName(p, p->l.t.v.v);
4813 #define zdc_parse_register(...) (zdc_parse_register(__VA_ARGS__) COMMA_SUCCESS)
4815 static BC_STATUS zdc_parse_string(BcParse *p)
4818 size_t idx, len = G.prog.strs.len;
4820 //why pad to 32 zeros??
4821 name = xasprintf("%032lu", (unsigned long)len);
4823 str = xstrdup(p->l.t.v.v);
4824 bc_parse_push(p, BC_INST_STR);
4825 bc_parse_pushIndex(p, len);
4826 bc_vec_push(&G.prog.strs, &str);
4827 bc_parse_addFunc(p, name, &idx);
4829 RETURN_STATUS(zbc_lex_next(&p->l));
4831 #define zdc_parse_string(...) (zdc_parse_string(__VA_ARGS__) COMMA_SUCCESS)
4833 static BC_STATUS zdc_parse_mem(BcParse *p, uint8_t inst, bool name, bool store)
4837 bc_parse_push(p, inst);
4839 s = zdc_parse_register(p);
4840 if (s) RETURN_STATUS(s);
4844 bc_parse_push(p, BC_INST_SWAP);
4845 bc_parse_push(p, BC_INST_ASSIGN);
4846 bc_parse_push(p, BC_INST_POP);
4849 RETURN_STATUS(zbc_lex_next(&p->l));
4851 #define zdc_parse_mem(...) (zdc_parse_mem(__VA_ARGS__) COMMA_SUCCESS)
4853 static BC_STATUS zdc_parse_cond(BcParse *p, uint8_t inst)
4857 bc_parse_push(p, inst);
4858 bc_parse_push(p, BC_INST_EXEC_COND);
4860 s = zdc_parse_register(p);
4861 if (s) RETURN_STATUS(s);
4863 s = zbc_lex_next(&p->l);
4864 if (s) RETURN_STATUS(s);
4866 if (p->l.t.t == BC_LEX_ELSE) {
4867 s = zdc_parse_register(p);
4868 if (s) RETURN_STATUS(s);
4869 s = zbc_lex_next(&p->l);
4872 bc_parse_push(p, BC_PARSE_STREND);
4876 #define zdc_parse_cond(...) (zdc_parse_cond(__VA_ARGS__) COMMA_SUCCESS)
4878 static BC_STATUS zdc_parse_token(BcParse *p, BcLexType t, uint8_t flags)
4880 BcStatus s = BC_STATUS_SUCCESS;
4882 bool assign, get_token = false;
4885 case BC_LEX_OP_REL_EQ:
4886 case BC_LEX_OP_REL_LE:
4887 case BC_LEX_OP_REL_GE:
4888 case BC_LEX_OP_REL_NE:
4889 case BC_LEX_OP_REL_LT:
4890 case BC_LEX_OP_REL_GT:
4891 s = zdc_parse_cond(p, t - BC_LEX_OP_REL_EQ + BC_INST_REL_EQ);
4895 s = zdc_parse_mem(p, BC_INST_ARRAY_ELEM, true, t == BC_LEX_COLON);
4898 s = zdc_parse_string(p);
4902 if (t == BC_LEX_NEG) {
4903 s = zbc_lex_next(&p->l);
4904 if (s) RETURN_STATUS(s);
4905 if (p->l.t.t != BC_LEX_NUMBER)
4906 RETURN_STATUS(bc_error_bad_token());
4909 if (t == BC_LEX_NEG) bc_parse_push(p, BC_INST_NEG);
4912 case BC_LEX_KEY_READ:
4913 if (flags & BC_PARSE_NOREAD)
4914 s = bc_error_nested_read_call();
4916 bc_parse_push(p, BC_INST_READ);
4919 case BC_LEX_OP_ASSIGN:
4920 case BC_LEX_STORE_PUSH:
4921 assign = t == BC_LEX_OP_ASSIGN;
4922 inst = assign ? BC_INST_VAR : BC_INST_PUSH_TO_VAR;
4923 s = zdc_parse_mem(p, inst, true, assign);
4926 case BC_LEX_LOAD_POP:
4927 inst = t == BC_LEX_LOAD_POP ? BC_INST_PUSH_VAR : BC_INST_LOAD;
4928 s = zdc_parse_mem(p, inst, true, false);
4930 case BC_LEX_STORE_IBASE:
4931 case BC_LEX_STORE_SCALE:
4932 case BC_LEX_STORE_OBASE:
4933 inst = t - BC_LEX_STORE_IBASE + BC_INST_IBASE;
4934 s = zdc_parse_mem(p, inst, false, true);
4937 s = bc_error_bad_token();
4942 if (!s && get_token) s = zbc_lex_next(&p->l);
4946 #define zdc_parse_token(...) (zdc_parse_token(__VA_ARGS__) COMMA_SUCCESS)
4948 static BC_STATUS zdc_parse_expr(BcParse *p, uint8_t flags)
4957 if (t == BC_LEX_EOF) break;
4959 inst = dc_parse_insts[t];
4960 if (inst != BC_INST_INVALID) {
4961 bc_parse_push(p, inst);
4962 s = zbc_lex_next(&p->l);
4964 s = zdc_parse_token(p, t, flags);
4966 if (s) RETURN_STATUS(s);
4969 if (flags & BC_PARSE_NOCALL)
4970 bc_parse_push(p, BC_INST_POP_EXEC);
4972 RETURN_STATUS(BC_STATUS_SUCCESS);
4974 #define zdc_parse_expr(...) (zdc_parse_expr(__VA_ARGS__) COMMA_SUCCESS)
4976 static BC_STATUS zdc_parse_parse(BcParse *p)
4980 if (p->l.t.t == BC_LEX_EOF)
4981 s = bc_error("end of file");
4983 s = zdc_parse_expr(p, 0);
4985 if (s || G_interrupt) {
4987 s = BC_STATUS_FAILURE;
4992 #define zdc_parse_parse(...) (zdc_parse_parse(__VA_ARGS__) COMMA_SUCCESS)
4996 static BC_STATUS zcommon_parse_expr(BcParse *p, uint8_t flags)
4999 IF_BC(RETURN_STATUS(zbc_parse_expr(p, flags)));
5001 IF_DC(RETURN_STATUS(zdc_parse_expr(p, flags)));
5004 #define zcommon_parse_expr(...) (zcommon_parse_expr(__VA_ARGS__) COMMA_SUCCESS)
5006 static BcVec* bc_program_search(char *id, bool var)
5014 v = var ? &G.prog.vars : &G.prog.arrs;
5015 map = var ? &G.prog.var_map : &G.prog.arr_map;
5019 new = bc_map_insert(map, &e, &i); // 1 if insertion was successful
5022 bc_array_init(&data.v, var);
5023 bc_vec_push(v, &data.v);
5026 ptr = bc_vec_item(map, i);
5027 if (new) ptr->name = xstrdup(e.name);
5028 return bc_vec_item(v, ptr->idx);
5031 static BC_STATUS zbc_program_num(BcResult *r, BcNum **num, bool hex)
5036 case BC_RESULT_TEMP:
5037 case BC_RESULT_IBASE:
5038 case BC_RESULT_SCALE:
5039 case BC_RESULT_OBASE:
5045 case BC_RESULT_CONSTANT:
5048 char **str = bc_vec_item(&G.prog.consts, r->d.id.idx);
5050 size_t len = strlen(*str);
5052 bc_num_init(&r->d.n, len);
5054 hex = hex && len == 1;
5055 base_t = hex ? 16 : G.prog.ib_t;
5056 s = zbc_num_parse(&r->d.n, *str, base_t);
5059 bc_num_free(&r->d.n);
5064 r->t = BC_RESULT_TEMP;
5070 case BC_RESULT_ARRAY:
5071 case BC_RESULT_ARRAY_ELEM:
5075 v = bc_program_search(r->d.id.name, r->t == BC_RESULT_VAR);
5077 if (r->t == BC_RESULT_ARRAY_ELEM) {
5079 if (v->len <= r->d.id.idx) bc_array_expand(v, r->d.id.idx + 1);
5080 *num = bc_vec_item(v, r->d.id.idx);
5083 *num = bc_vec_top(v);
5088 case BC_RESULT_LAST:
5090 *num = &G.prog.last;
5101 RETURN_STATUS(BC_STATUS_SUCCESS);
5103 #define zbc_program_num(...) (zbc_program_num(__VA_ARGS__) COMMA_SUCCESS)
5105 static BC_STATUS zbc_program_binOpPrep(BcResult **l, BcNum **ln,
5106 BcResult **r, BcNum **rn, bool assign)
5110 BcResultType lt, rt;
5112 if (!BC_PROG_STACK(&G.prog.results, 2))
5113 RETURN_STATUS(bc_error_stack_has_too_few_elements());
5115 *r = bc_vec_item_rev(&G.prog.results, 0);
5116 *l = bc_vec_item_rev(&G.prog.results, 1);
5120 hex = assign && (lt == BC_RESULT_IBASE || lt == BC_RESULT_OBASE);
5122 s = zbc_program_num(*l, ln, false);
5123 if (s) RETURN_STATUS(s);
5124 s = zbc_program_num(*r, rn, hex);
5125 if (s) RETURN_STATUS(s);
5127 // We run this again under these conditions in case any vector has been
5128 // reallocated out from under the BcNums or arrays we had.
5129 if (lt == rt && (lt == BC_RESULT_VAR || lt == BC_RESULT_ARRAY_ELEM)) {
5130 s = zbc_program_num(*l, ln, false);
5131 if (s) RETURN_STATUS(s);
5134 if (!BC_PROG_NUM((*l), (*ln)) && (!assign || (*l)->t != BC_RESULT_VAR))
5135 RETURN_STATUS(bc_error_variable_is_wrong_type());
5136 if (!assign && !BC_PROG_NUM((*r), (*ln)))
5137 RETURN_STATUS(bc_error_variable_is_wrong_type());
5141 #define zbc_program_binOpPrep(...) (zbc_program_binOpPrep(__VA_ARGS__) COMMA_SUCCESS)
5143 static void bc_program_binOpRetire(BcResult *r)
5145 r->t = BC_RESULT_TEMP;
5146 bc_vec_pop(&G.prog.results);
5147 bc_vec_pop(&G.prog.results);
5148 bc_vec_push(&G.prog.results, r);
5151 static BC_STATUS zbc_program_prep(BcResult **r, BcNum **n)
5155 if (!BC_PROG_STACK(&G.prog.results, 1))
5156 RETURN_STATUS(bc_error_stack_has_too_few_elements());
5157 *r = bc_vec_top(&G.prog.results);
5159 s = zbc_program_num(*r, n, false);
5160 if (s) RETURN_STATUS(s);
5162 if (!BC_PROG_NUM((*r), (*n)))
5163 RETURN_STATUS(bc_error_variable_is_wrong_type());
5167 #define zbc_program_prep(...) (zbc_program_prep(__VA_ARGS__) COMMA_SUCCESS)
5169 static void bc_program_retire(BcResult *r, BcResultType t)
5172 bc_vec_pop(&G.prog.results);
5173 bc_vec_push(&G.prog.results, r);
5176 static BC_STATUS zbc_program_op(char inst)
5179 BcResult *opd1, *opd2, res;
5180 BcNum *n1, *n2 = NULL;
5182 s = zbc_program_binOpPrep(&opd1, &n1, &opd2, &n2, false);
5183 if (s) RETURN_STATUS(s);
5184 bc_num_init_DEF_SIZE(&res.d.n);
5186 s = BC_STATUS_SUCCESS;
5187 IF_ERROR_RETURN_POSSIBLE(s =) zbc_program_ops[inst - BC_INST_POWER](n1, n2, &res.d.n, G.prog.scale);
5189 bc_program_binOpRetire(&res);
5194 bc_num_free(&res.d.n);
5197 #define zbc_program_op(...) (zbc_program_op(__VA_ARGS__) COMMA_SUCCESS)
5199 static BC_STATUS zbc_program_read(void)
5201 const char *sv_file;
5209 RETURN_STATUS(bc_error_nested_read_call());
5211 f = bc_program_func(BC_PROG_READ);
5212 bc_vec_pop_all(&f->code);
5214 sv_file = G.prog.file;
5218 bc_char_vec_init(&buf);
5219 bc_read_line(&buf, stdin);
5221 bc_parse_create(&parse, BC_PROG_READ);
5222 bc_lex_file(&parse.l);
5224 s = zbc_parse_text_init(&parse, buf.v);
5225 if (s) goto exec_err;
5226 s = zcommon_parse_expr(&parse, BC_PARSE_NOREAD);
5227 if (s) goto exec_err;
5229 if (parse.l.t.t != BC_LEX_NLINE && parse.l.t.t != BC_LEX_EOF) {
5230 s = bc_error("bad read() expression");
5234 ip.func = BC_PROG_READ;
5236 ip.len = G.prog.results.len;
5238 // Update this pointer, just in case.
5239 f = bc_program_func(BC_PROG_READ);
5241 bc_vec_pushByte(&f->code, BC_INST_POP_EXEC);
5242 bc_vec_push(&G.prog.stack, &ip);
5245 bc_parse_free(&parse);
5247 G.prog.file = sv_file;
5251 #define zbc_program_read(...) (zbc_program_read(__VA_ARGS__) COMMA_SUCCESS)
5253 static size_t bc_program_index(char *code, size_t *bgn)
5255 char amt = code[(*bgn)++], i = 0;
5258 for (; i < amt; ++i, ++(*bgn))
5259 res |= (((size_t)((int) code[*bgn]) & UCHAR_MAX) << (i * CHAR_BIT));
5264 static char *bc_program_name(char *code, size_t *bgn)
5267 char *s, *str = code + *bgn, *ptr = strchr(str, BC_PARSE_STREND);
5269 s = xmalloc(ptr - str + 1);
5272 char c = code[(*bgn)++];
5273 if (c == '\0' || c == BC_PARSE_STREND)
5282 static void bc_program_printString(const char *str)
5286 // Example: echo '[]ap' | dc
5287 // should print two bytes: 0x00, 0x0A
5294 if (c != '\\' || !*str)
5314 G.prog.nchars = SIZE_MAX;
5326 // Just print the backslash and following character.
5337 static void bc_num_printNewline(void)
5339 if (G.prog.nchars == G.prog.len - 1) {
5347 static FAST_FUNC void bc_num_printChar(size_t num, size_t width, bool radix)
5350 bb_putchar((char) num);
5351 G.prog.nchars += width;
5355 static FAST_FUNC void bc_num_printDigits(size_t num, size_t width, bool radix)
5359 bc_num_printNewline();
5360 bb_putchar(radix ? '.' : ' ');
5363 bc_num_printNewline();
5364 for (exp = 0, pow = 1; exp < width - 1; ++exp, pow *= 10)
5367 for (exp = 0; exp < width; pow /= 10, ++G.prog.nchars, ++exp) {
5369 bc_num_printNewline();
5372 bb_putchar(((char) dig) + '0');
5376 static FAST_FUNC void bc_num_printHex(size_t num, size_t width, bool radix)
5379 bc_num_printNewline();
5384 bc_num_printNewline();
5385 bb_putchar(bb_hexdigits_upcase[num]);
5386 G.prog.nchars += width;
5389 static void bc_num_printDecimal(BcNum *n)
5391 size_t i, rdx = n->rdx - 1;
5393 if (n->neg) bb_putchar('-');
5394 G.prog.nchars += n->neg;
5396 for (i = n->len - 1; i < n->len; --i)
5397 bc_num_printHex((size_t) n->num[i], 1, i == rdx);
5400 static BC_STATUS zbc_num_printNum(BcNum *n, BcNum *base, size_t width, BcNumDigitOp print)
5404 BcNum intp, fracp, digit, frac_len;
5405 unsigned long dig, *ptr;
5410 print(0, width, false);
5411 RETURN_STATUS(BC_STATUS_SUCCESS);
5414 bc_vec_init(&stack, sizeof(long), NULL);
5415 bc_num_init(&intp, n->len);
5416 bc_num_init(&fracp, n->rdx);
5417 bc_num_init(&digit, width);
5418 bc_num_init(&frac_len, BC_NUM_INT(n));
5419 bc_num_copy(&intp, n);
5420 bc_num_one(&frac_len);
5422 bc_num_truncate(&intp, intp.rdx);
5423 s = zbc_num_sub(n, &intp, &fracp, 0);
5426 while (intp.len != 0) {
5427 s = zbc_num_divmod(&intp, base, &intp, &digit, 0);
5429 s = zbc_num_ulong(&digit, &dig);
5431 bc_vec_push(&stack, &dig);
5434 for (i = 0; i < stack.len; ++i) {
5435 ptr = bc_vec_item_rev(&stack, i);
5436 print(*ptr, width, false);
5439 if (!n->rdx) goto err;
5441 for (radix = true; frac_len.len <= n->rdx; radix = false) {
5442 s = zbc_num_mul(&fracp, base, &fracp, n->rdx);
5444 s = zbc_num_ulong(&fracp, &dig);
5446 bc_num_ulong2num(&intp, dig);
5447 s = zbc_num_sub(&fracp, &intp, &fracp, 0);
5449 print(dig, width, radix);
5450 s = zbc_num_mul(&frac_len, base, &frac_len, 0);
5455 bc_num_free(&frac_len);
5456 bc_num_free(&digit);
5457 bc_num_free(&fracp);
5459 bc_vec_free(&stack);
5462 #define zbc_num_printNum(...) (zbc_num_printNum(__VA_ARGS__) COMMA_SUCCESS)
5464 static BC_STATUS zbc_num_printBase(BcNum *n)
5478 if (G.prog.ob_t <= BC_NUM_MAX_IBASE) {
5480 print = bc_num_printHex;
5482 unsigned i = G.prog.ob_t - 1;
5490 print = bc_num_printDigits;
5493 s = zbc_num_printNum(n, &G.prog.ob, width, print);
5498 #define zbc_num_printBase(...) (zbc_num_printBase(__VA_ARGS__) COMMA_SUCCESS)
5500 static BC_STATUS zbc_num_print(BcNum *n, bool newline)
5502 BcStatus s = BC_STATUS_SUCCESS;
5504 bc_num_printNewline();
5509 } else if (G.prog.ob_t == 10)
5510 bc_num_printDecimal(n);
5512 s = zbc_num_printBase(n);
5521 #define zbc_num_print(...) (zbc_num_print(__VA_ARGS__) COMMA_SUCCESS)
5523 static BC_STATUS zbc_program_print(char inst, size_t idx)
5528 bool pop = inst != BC_INST_PRINT;
5530 if (!BC_PROG_STACK(&G.prog.results, idx + 1))
5531 RETURN_STATUS(bc_error_stack_has_too_few_elements());
5533 r = bc_vec_item_rev(&G.prog.results, idx);
5534 num = NULL; // is this NULL necessary?
5535 s = zbc_program_num(r, &num, false);
5536 if (s) RETURN_STATUS(s);
5538 if (BC_PROG_NUM(r, num)) {
5539 s = zbc_num_print(num, !pop);
5540 if (!s) bc_num_copy(&G.prog.last, num);
5545 idx = (r->t == BC_RESULT_STR) ? r->d.id.idx : num->rdx;
5546 str = *bc_program_str(idx);
5548 if (inst == BC_INST_PRINT_STR) {
5551 if (c == '\0') break;
5554 if (c == '\n') G.prog.nchars = 0;
5558 bc_program_printString(str);
5559 if (inst == BC_INST_PRINT) bb_putchar('\n');
5563 if (!s && pop) bc_vec_pop(&G.prog.results);
5567 #define zbc_program_print(...) (zbc_program_print(__VA_ARGS__) COMMA_SUCCESS)
5569 static BC_STATUS zbc_program_negate(void)
5575 s = zbc_program_prep(&ptr, &num);
5576 if (s) RETURN_STATUS(s);
5578 bc_num_init(&res.d.n, num->len);
5579 bc_num_copy(&res.d.n, num);
5580 if (res.d.n.len) res.d.n.neg = !res.d.n.neg;
5582 bc_program_retire(&res, BC_RESULT_TEMP);
5586 #define zbc_program_negate(...) (zbc_program_negate(__VA_ARGS__) COMMA_SUCCESS)
5588 static BC_STATUS zbc_program_logical(char inst)
5591 BcResult *opd1, *opd2, res;
5595 s = zbc_program_binOpPrep(&opd1, &n1, &opd2, &n2, false);
5596 if (s) RETURN_STATUS(s);
5598 bc_num_init_DEF_SIZE(&res.d.n);
5600 if (inst == BC_INST_BOOL_AND)
5601 cond = bc_num_cmp(n1, &G.prog.zero) && bc_num_cmp(n2, &G.prog.zero);
5602 else if (inst == BC_INST_BOOL_OR)
5603 cond = bc_num_cmp(n1, &G.prog.zero) || bc_num_cmp(n2, &G.prog.zero);
5605 cond = bc_num_cmp(n1, n2);
5607 case BC_INST_REL_EQ:
5610 case BC_INST_REL_LE:
5613 case BC_INST_REL_GE:
5616 case BC_INST_REL_LT:
5619 case BC_INST_REL_GT:
5622 default: // = case BC_INST_REL_NE:
5623 //cond = (cond != 0); - not needed
5628 if (cond) bc_num_one(&res.d.n);
5629 //else bc_num_zero(&res.d.n); - already is
5631 bc_program_binOpRetire(&res);
5635 #define zbc_program_logical(...) (zbc_program_logical(__VA_ARGS__) COMMA_SUCCESS)
5638 static BC_STATUS zbc_program_assignStr(BcResult *r, BcVec *v,
5644 memset(&n2, 0, sizeof(BcNum));
5645 n2.rdx = res.d.id.idx = r->d.id.idx;
5646 res.t = BC_RESULT_STR;
5649 if (!BC_PROG_STACK(&G.prog.results, 2))
5650 RETURN_STATUS(bc_error_stack_has_too_few_elements());
5652 bc_vec_pop(&G.prog.results);
5655 bc_vec_pop(&G.prog.results);
5657 bc_vec_push(&G.prog.results, &res);
5658 bc_vec_push(v, &n2);
5660 RETURN_STATUS(BC_STATUS_SUCCESS);
5662 #define zbc_program_assignStr(...) (zbc_program_assignStr(__VA_ARGS__) COMMA_SUCCESS)
5665 static BC_STATUS zbc_program_copyToVar(char *name, bool var)
5672 if (!BC_PROG_STACK(&G.prog.results, 1))
5673 RETURN_STATUS(bc_error_stack_has_too_few_elements());
5675 ptr = bc_vec_top(&G.prog.results);
5676 if ((ptr->t == BC_RESULT_ARRAY) != !var)
5677 RETURN_STATUS(bc_error_variable_is_wrong_type());
5678 v = bc_program_search(name, var);
5681 if (ptr->t == BC_RESULT_STR && !var)
5682 RETURN_STATUS(bc_error_variable_is_wrong_type());
5683 if (ptr->t == BC_RESULT_STR)
5684 RETURN_STATUS(zbc_program_assignStr(ptr, v, true));
5687 s = zbc_program_num(ptr, &n, false);
5688 if (s) RETURN_STATUS(s);
5690 // Do this once more to make sure that pointers were not invalidated.
5691 v = bc_program_search(name, var);
5694 bc_num_init_DEF_SIZE(&r.d.n);
5695 bc_num_copy(&r.d.n, n);
5698 bc_array_init(&r.d.v, true);
5699 bc_array_copy(&r.d.v, (BcVec *) n);
5702 bc_vec_push(v, &r.d);
5703 bc_vec_pop(&G.prog.results);
5707 #define zbc_program_copyToVar(...) (zbc_program_copyToVar(__VA_ARGS__) COMMA_SUCCESS)
5709 static BC_STATUS zbc_program_assign(char inst)
5712 BcResult *left, *right, res;
5713 BcNum *l = NULL, *r = NULL;
5714 bool assign = inst == BC_INST_ASSIGN, ib, sc;
5716 s = zbc_program_binOpPrep(&left, &l, &right, &r, assign);
5717 if (s) RETURN_STATUS(s);
5719 ib = left->t == BC_RESULT_IBASE;
5720 sc = left->t == BC_RESULT_SCALE;
5724 if (right->t == BC_RESULT_STR) {
5728 if (left->t != BC_RESULT_VAR)
5729 RETURN_STATUS(bc_error_variable_is_wrong_type());
5730 v = bc_program_search(left->d.id.name, true);
5732 RETURN_STATUS(zbc_program_assignStr(right, v, false));
5736 if (left->t == BC_RESULT_CONSTANT || left->t == BC_RESULT_TEMP)
5737 RETURN_STATUS(bc_error("bad assignment:"
5738 " left side must be variable"
5740 )); // note: shared string
5743 if (inst == BC_INST_ASSIGN_DIVIDE && !bc_num_cmp(r, &G.prog.zero))
5744 RETURN_STATUS(bc_error("divide by zero"));
5749 s = BC_STATUS_SUCCESS;
5750 IF_ERROR_RETURN_POSSIBLE(s =) zbc_program_ops[inst - BC_INST_ASSIGN_POWER](l, r, l, G.prog.scale);
5752 if (s) RETURN_STATUS(s);
5757 if (ib || sc || left->t == BC_RESULT_OBASE) {
5758 static const char *const msg[] = {
5759 "bad ibase; must be [2,16]", //BC_RESULT_IBASE
5760 "bad scale; must be [0,"BC_MAX_SCALE_STR"]", //BC_RESULT_SCALE
5761 NULL, //can't happen //BC_RESULT_LAST
5762 NULL, //can't happen //BC_RESULT_CONSTANT
5763 NULL, //can't happen //BC_RESULT_ONE
5764 "bad obase; must be [2,"BC_MAX_OBASE_STR"]", //BC_RESULT_OBASE
5770 s = zbc_num_ulong(l, &val);
5771 if (s) RETURN_STATUS(s);
5772 s = left->t - BC_RESULT_IBASE;
5775 ptr = &G.prog.scale;
5778 RETURN_STATUS(bc_error(msg[s]));
5779 max = ib ? BC_NUM_MAX_IBASE : BC_MAX_OBASE;
5780 ptr = ib ? &G.prog.ib_t : &G.prog.ob_t;
5784 RETURN_STATUS(bc_error(msg[s]));
5786 bc_num_copy(&G.prog.ob, l);
5788 *ptr = (size_t) val;
5789 s = BC_STATUS_SUCCESS;
5792 bc_num_init(&res.d.n, l->len);
5793 bc_num_copy(&res.d.n, l);
5794 bc_program_binOpRetire(&res);
5798 #define zbc_program_assign(...) (zbc_program_assign(__VA_ARGS__) COMMA_SUCCESS)
5801 #define bc_program_pushVar(code, bgn, pop, copy) \
5802 bc_program_pushVar(code, bgn)
5803 // for bc, 'pop' and 'copy' are always false
5805 static BC_STATUS bc_program_pushVar(char *code, size_t *bgn,
5806 bool pop, bool copy)
5809 char *name = bc_program_name(code, bgn);
5811 r.t = BC_RESULT_VAR;
5816 BcVec *v = bc_program_search(name, true);
5817 BcNum *num = bc_vec_top(v);
5821 if (!BC_PROG_STACK(v, 2 - copy)) {
5823 RETURN_STATUS(bc_error_stack_has_too_few_elements());
5829 if (!BC_PROG_STR(num)) {
5831 r.t = BC_RESULT_TEMP;
5833 bc_num_init_DEF_SIZE(&r.d.n);
5834 bc_num_copy(&r.d.n, num);
5837 r.t = BC_RESULT_STR;
5838 r.d.id.idx = num->rdx;
5841 if (!copy) bc_vec_pop(v);
5846 bc_vec_push(&G.prog.results, &r);
5848 RETURN_STATUS(BC_STATUS_SUCCESS);
5850 #define zbc_program_pushVar(...) (bc_program_pushVar(__VA_ARGS__) COMMA_SUCCESS)
5852 static BC_STATUS zbc_program_pushArray(char *code, size_t *bgn,
5855 BcStatus s = BC_STATUS_SUCCESS;
5859 r.d.id.name = bc_program_name(code, bgn);
5861 if (inst == BC_INST_ARRAY) {
5862 r.t = BC_RESULT_ARRAY;
5863 bc_vec_push(&G.prog.results, &r);
5870 s = zbc_program_prep(&operand, &num);
5872 s = zbc_num_ulong(num, &temp);
5875 if (temp > BC_MAX_DIM) {
5876 s = bc_error("array too long; must be [1,"BC_MAX_DIM_STR"]");
5880 r.d.id.idx = (size_t) temp;
5881 bc_program_retire(&r, BC_RESULT_ARRAY_ELEM);
5885 if (s) free(r.d.id.name);
5888 #define zbc_program_pushArray(...) (zbc_program_pushArray(__VA_ARGS__) COMMA_SUCCESS)
5891 static BC_STATUS zbc_program_incdec(char inst)
5894 BcResult *ptr, res, copy;
5898 s = zbc_program_prep(&ptr, &num);
5899 if (s) RETURN_STATUS(s);
5901 if (inst == BC_INST_INC_POST || inst == BC_INST_DEC_POST) {
5902 copy.t = BC_RESULT_TEMP;
5903 bc_num_init(©.d.n, num->len);
5904 bc_num_copy(©.d.n, num);
5907 res.t = BC_RESULT_ONE;
5908 inst = inst == BC_INST_INC_PRE || inst == BC_INST_INC_POST ?
5909 BC_INST_ASSIGN_PLUS :
5910 BC_INST_ASSIGN_MINUS;
5912 bc_vec_push(&G.prog.results, &res);
5913 s = zbc_program_assign(inst);
5914 if (s) RETURN_STATUS(s);
5916 if (inst2 == BC_INST_INC_POST || inst2 == BC_INST_DEC_POST) {
5917 bc_vec_pop(&G.prog.results);
5918 bc_vec_push(&G.prog.results, ©);
5923 #define zbc_program_incdec(...) (zbc_program_incdec(__VA_ARGS__) COMMA_SUCCESS)
5925 static BC_STATUS zbc_program_call(char *code, size_t *idx)
5928 size_t i, nparams = bc_program_index(code, idx);
5935 ip.func = bc_program_index(code, idx);
5936 func = bc_program_func(ip.func);
5938 if (func->code.len == 0) {
5939 RETURN_STATUS(bc_error("undefined function"));
5941 if (nparams != func->nparams) {
5942 RETURN_STATUS(bc_error_fmt("function has %u parameters, but called with %u", func->nparams, nparams));
5944 ip.len = G.prog.results.len - nparams;
5946 for (i = 0; i < nparams; ++i) {
5949 a = bc_vec_item(&func->autos, nparams - 1 - i);
5950 arg = bc_vec_top(&G.prog.results);
5952 if ((!a->idx) != (arg->t == BC_RESULT_ARRAY) || arg->t == BC_RESULT_STR)
5953 RETURN_STATUS(bc_error_variable_is_wrong_type());
5955 s = zbc_program_copyToVar(a->name, a->idx);
5956 if (s) RETURN_STATUS(s);
5959 for (; i < func->autos.len; ++i) {
5962 a = bc_vec_item(&func->autos, i);
5963 v = bc_program_search(a->name, a->idx);
5966 bc_num_init_DEF_SIZE(¶m.n);
5967 bc_vec_push(v, ¶m.n);
5970 bc_array_init(¶m.v, true);
5971 bc_vec_push(v, ¶m.v);
5975 bc_vec_push(&G.prog.stack, &ip);
5977 RETURN_STATUS(BC_STATUS_SUCCESS);
5979 #define zbc_program_call(...) (zbc_program_call(__VA_ARGS__) COMMA_SUCCESS)
5981 static BC_STATUS zbc_program_return(char inst)
5986 BcInstPtr *ip = bc_vec_top(&G.prog.stack);
5988 if (!BC_PROG_STACK(&G.prog.results, ip->len + inst == BC_INST_RET))
5989 RETURN_STATUS(bc_error_stack_has_too_few_elements());
5991 f = bc_program_func(ip->func);
5992 res.t = BC_RESULT_TEMP;
5994 if (inst == BC_INST_RET) {
5997 BcResult *operand = bc_vec_top(&G.prog.results);
5999 s = zbc_program_num(operand, &num, false);
6000 if (s) RETURN_STATUS(s);
6001 bc_num_init(&res.d.n, num->len);
6002 bc_num_copy(&res.d.n, num);
6005 bc_num_init_DEF_SIZE(&res.d.n);
6006 //bc_num_zero(&res.d.n); - already is
6009 // We need to pop arguments as well, so this takes that into account.
6010 for (i = 0; i < f->autos.len; ++i) {
6012 BcId *a = bc_vec_item(&f->autos, i);
6014 v = bc_program_search(a->name, a->idx);
6018 bc_vec_npop(&G.prog.results, G.prog.results.len - ip->len);
6019 bc_vec_push(&G.prog.results, &res);
6020 bc_vec_pop(&G.prog.stack);
6022 RETURN_STATUS(BC_STATUS_SUCCESS);
6024 #define zbc_program_return(...) (zbc_program_return(__VA_ARGS__) COMMA_SUCCESS)
6027 static unsigned long bc_program_scale(BcNum *n)
6029 return (unsigned long) n->rdx;
6032 static unsigned long bc_program_len(BcNum *n)
6034 size_t len = n->len;
6036 if (n->rdx != len) return len;
6038 if (len == 0) break;
6040 if (n->num[len] != 0) break;
6045 static BC_STATUS zbc_program_builtin(char inst)
6051 bool len = inst == BC_INST_LENGTH;
6053 if (!BC_PROG_STACK(&G.prog.results, 1))
6054 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6055 opnd = bc_vec_top(&G.prog.results);
6057 s = zbc_program_num(opnd, &num, false);
6058 if (s) RETURN_STATUS(s);
6061 if (!BC_PROG_NUM(opnd, num) && !len)
6062 RETURN_STATUS(bc_error_variable_is_wrong_type());
6065 bc_num_init_DEF_SIZE(&res.d.n);
6067 if (inst == BC_INST_SQRT) s = zbc_num_sqrt(num, &res.d.n, G.prog.scale);
6069 else if (len != 0 && opnd->t == BC_RESULT_ARRAY) {
6070 bc_num_ulong2num(&res.d.n, (unsigned long) ((BcVec *) num)->len);
6074 else if (len != 0 && !BC_PROG_NUM(opnd, num)) {
6076 size_t idx = opnd->t == BC_RESULT_STR ? opnd->d.id.idx : num->rdx;
6078 str = bc_program_str(idx);
6079 bc_num_ulong2num(&res.d.n, strlen(*str));
6083 bc_num_ulong2num(&res.d.n, len ? bc_program_len(num) : bc_program_scale(num));
6086 bc_program_retire(&res, BC_RESULT_TEMP);
6090 #define zbc_program_builtin(...) (zbc_program_builtin(__VA_ARGS__) COMMA_SUCCESS)
6093 static BC_STATUS zbc_program_divmod(void)
6096 BcResult *opd1, *opd2, res, res2;
6097 BcNum *n1, *n2 = NULL;
6099 s = zbc_program_binOpPrep(&opd1, &n1, &opd2, &n2, false);
6100 if (s) RETURN_STATUS(s);
6102 bc_num_init_DEF_SIZE(&res.d.n);
6103 bc_num_init(&res2.d.n, n2->len);
6105 s = zbc_num_divmod(n1, n2, &res2.d.n, &res.d.n, G.prog.scale);
6108 bc_program_binOpRetire(&res2);
6109 res.t = BC_RESULT_TEMP;
6110 bc_vec_push(&G.prog.results, &res);
6115 bc_num_free(&res2.d.n);
6116 bc_num_free(&res.d.n);
6119 #define zbc_program_divmod(...) (zbc_program_divmod(__VA_ARGS__) COMMA_SUCCESS)
6121 static BC_STATUS zbc_program_modexp(void)
6124 BcResult *r1, *r2, *r3, res;
6125 BcNum *n1, *n2, *n3;
6127 if (!BC_PROG_STACK(&G.prog.results, 3))
6128 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6129 s = zbc_program_binOpPrep(&r2, &n2, &r3, &n3, false);
6130 if (s) RETURN_STATUS(s);
6132 r1 = bc_vec_item_rev(&G.prog.results, 2);
6133 s = zbc_program_num(r1, &n1, false);
6134 if (s) RETURN_STATUS(s);
6135 if (!BC_PROG_NUM(r1, n1))
6136 RETURN_STATUS(bc_error_variable_is_wrong_type());
6138 // Make sure that the values have their pointers updated, if necessary.
6139 if (r1->t == BC_RESULT_VAR || r1->t == BC_RESULT_ARRAY_ELEM) {
6141 if (r1->t == r2->t) {
6142 s = zbc_program_num(r2, &n2, false);
6143 if (s) RETURN_STATUS(s);
6146 if (r1->t == r3->t) {
6147 s = zbc_program_num(r3, &n3, false);
6148 if (s) RETURN_STATUS(s);
6152 bc_num_init(&res.d.n, n3->len);
6153 s = zbc_num_modexp(n1, n2, n3, &res.d.n);
6156 bc_vec_pop(&G.prog.results);
6157 bc_program_binOpRetire(&res);
6162 bc_num_free(&res.d.n);
6165 #define zbc_program_modexp(...) (zbc_program_modexp(__VA_ARGS__) COMMA_SUCCESS)
6167 static void bc_program_stackLen(void)
6170 size_t len = G.prog.results.len;
6172 res.t = BC_RESULT_TEMP;
6174 bc_num_init_DEF_SIZE(&res.d.n);
6175 bc_num_ulong2num(&res.d.n, len);
6176 bc_vec_push(&G.prog.results, &res);
6179 static BC_STATUS zbc_program_asciify(void)
6184 char *str, *str2, c;
6185 size_t len = G.prog.strs.len, idx;
6188 if (!BC_PROG_STACK(&G.prog.results, 1))
6189 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6190 r = bc_vec_top(&G.prog.results);
6192 num = NULL; // TODO: is this NULL needed?
6193 s = zbc_program_num(r, &num, false);
6194 if (s) RETURN_STATUS(s);
6196 if (BC_PROG_NUM(r, num)) {
6198 bc_num_init_DEF_SIZE(&n);
6199 bc_num_copy(&n, num);
6200 bc_num_truncate(&n, n.rdx);
6202 s = zbc_num_mod(&n, &G.prog.strmb, &n, 0);
6203 if (s) goto num_err;
6204 s = zbc_num_ulong(&n, &val);
6205 if (s) goto num_err;
6212 idx = (r->t == BC_RESULT_STR) ? r->d.id.idx : num->rdx;
6213 str2 = *bc_program_str(idx);
6219 //str[1] = '\0'; - already is
6221 str2 = xstrdup(str);
6222 bc_program_addFunc(str2, &idx);
6224 if (idx != len + BC_PROG_REQ_FUNCS) {
6225 for (idx = 0; idx < G.prog.strs.len; ++idx) {
6226 if (strcmp(*bc_program_str(idx), str) == 0) {
6235 bc_vec_push(&G.prog.strs, &str);
6237 res.t = BC_RESULT_STR;
6239 bc_vec_pop(&G.prog.results);
6240 bc_vec_push(&G.prog.results, &res);
6242 RETURN_STATUS(BC_STATUS_SUCCESS);
6248 #define zbc_program_asciify(...) (zbc_program_asciify(__VA_ARGS__) COMMA_SUCCESS)
6250 static BC_STATUS zbc_program_printStream(void)
6258 if (!BC_PROG_STACK(&G.prog.results, 1))
6259 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6260 r = bc_vec_top(&G.prog.results);
6262 s = zbc_program_num(r, &n, false);
6263 if (s) RETURN_STATUS(s);
6265 if (BC_PROG_NUM(r, n)) {
6266 s = zbc_num_printNum(n, &G.prog.strmb, 1, bc_num_printChar);
6268 idx = (r->t == BC_RESULT_STR) ? r->d.id.idx : n->rdx;
6269 str = *bc_program_str(idx);
6275 #define zbc_program_printStream(...) (zbc_program_printStream(__VA_ARGS__) COMMA_SUCCESS)
6277 static BC_STATUS zbc_program_nquit(void)
6284 s = zbc_program_prep(&opnd, &num);
6285 if (s) RETURN_STATUS(s);
6286 s = zbc_num_ulong(num, &val);
6287 if (s) RETURN_STATUS(s);
6289 bc_vec_pop(&G.prog.results);
6291 if (G.prog.stack.len < val)
6292 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6293 if (G.prog.stack.len == val) {
6294 QUIT_OR_RETURN_TO_MAIN;
6297 bc_vec_npop(&G.prog.stack, val);
6301 #define zbc_program_nquit(...) (zbc_program_nquit(__VA_ARGS__) COMMA_SUCCESS)
6303 static BC_STATUS zbc_program_execStr(char *code, size_t *bgn,
6306 BcStatus s = BC_STATUS_SUCCESS;
6314 if (!BC_PROG_STACK(&G.prog.results, 1))
6315 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6317 r = bc_vec_top(&G.prog.results);
6320 BcNum *n = n; // for compiler
6323 char *then_name = bc_program_name(code, bgn);
6324 char *else_name = NULL;
6326 if (code[*bgn] == BC_PARSE_STREND)
6329 else_name = bc_program_name(code, bgn);
6331 exec = r->d.n.len != 0;
6333 if (!exec && else_name != NULL) {
6340 v = bc_program_search(name, true);
6347 if (!exec) goto exit;
6348 if (!BC_PROG_STR(n)) {
6349 s = bc_error_variable_is_wrong_type();
6355 if (r->t == BC_RESULT_STR) {
6357 } else if (r->t == BC_RESULT_VAR) {
6359 s = zbc_program_num(r, &n, false);
6360 if (s || !BC_PROG_STR(n)) goto exit;
6366 fidx = sidx + BC_PROG_REQ_FUNCS;
6368 str = bc_program_str(sidx);
6369 f = bc_program_func(fidx);
6371 if (f->code.len == 0) {
6372 bc_parse_create(&prs, fidx);
6373 s = zbc_parse_text_init(&prs, *str);
6375 s = zcommon_parse_expr(&prs, BC_PARSE_NOCALL);
6378 if (prs.l.t.t != BC_LEX_EOF) {
6379 s = bc_error_bad_expression();
6383 bc_parse_free(&prs);
6387 ip.len = G.prog.results.len;
6390 bc_vec_pop(&G.prog.results);
6391 bc_vec_push(&G.prog.stack, &ip);
6393 RETURN_STATUS(BC_STATUS_SUCCESS);
6396 bc_parse_free(&prs);
6397 f = bc_program_func(fidx);
6398 bc_vec_pop_all(&f->code);
6400 bc_vec_pop(&G.prog.results);
6403 #define zbc_program_execStr(...) (zbc_program_execStr(__VA_ARGS__) COMMA_SUCCESS)
6406 static void bc_program_pushGlobal(char inst)
6411 res.t = inst - BC_INST_IBASE + BC_RESULT_IBASE;
6412 if (inst == BC_INST_IBASE)
6413 val = (unsigned long) G.prog.ib_t;
6414 else if (inst == BC_INST_SCALE)
6415 val = (unsigned long) G.prog.scale;
6417 val = (unsigned long) G.prog.ob_t;
6419 bc_num_init_DEF_SIZE(&res.d.n);
6420 bc_num_ulong2num(&res.d.n, val);
6421 bc_vec_push(&G.prog.results, &res);
6424 static void bc_program_addFunc(char *name, size_t *idx)
6426 BcId entry, *entry_ptr;
6431 entry.idx = G.prog.fns.len;
6433 inserted = bc_map_insert(&G.prog.fn_map, &entry, idx);
6434 if (!inserted) free(name);
6436 entry_ptr = bc_vec_item(&G.prog.fn_map, *idx);
6437 *idx = entry_ptr->idx;
6441 BcFunc *func = bc_program_func(entry_ptr->idx);
6443 // We need to reset these, so the function can be repopulated.
6445 bc_vec_pop_all(&func->autos);
6446 bc_vec_pop_all(&func->code);
6447 bc_vec_pop_all(&func->labels);
6451 bc_vec_push(&G.prog.fns, &f);
6455 static BC_STATUS zbc_program_exec(void)
6459 BcInstPtr *ip = bc_vec_top(&G.prog.stack);
6460 BcFunc *func = bc_program_func(ip->func);
6461 char *code = func->code.v;
6463 while (ip->idx < func->code.len) {
6464 BcStatus s = BC_STATUS_SUCCESS;
6465 char inst = code[(ip->idx)++];
6467 dbg_exec("inst:%d", inst);
6470 case BC_INST_JUMP_ZERO: {
6472 dbg_exec("BC_INST_JUMP_ZERO:");
6473 s = zbc_program_prep(&ptr, &num);
6474 if (s) RETURN_STATUS(s);
6475 zero = (bc_num_cmp(num, &G.prog.zero) == 0);
6476 bc_vec_pop(&G.prog.results);
6478 bc_program_index(code, &ip->idx);
6481 // else: fall through
6483 case BC_INST_JUMP: {
6484 size_t idx = bc_program_index(code, &ip->idx);
6485 size_t *addr = bc_vec_item(&func->labels, idx);
6486 dbg_exec("BC_INST_JUMP: to %ld", (long)*addr);
6491 dbg_exec("BC_INST_CALL:");
6492 s = zbc_program_call(code, &ip->idx);
6494 case BC_INST_INC_PRE:
6495 case BC_INST_DEC_PRE:
6496 case BC_INST_INC_POST:
6497 case BC_INST_DEC_POST:
6498 dbg_exec("BC_INST_INCDEC:");
6499 s = zbc_program_incdec(inst);
6502 dbg_exec("BC_INST_HALT:");
6503 QUIT_OR_RETURN_TO_MAIN;
6507 dbg_exec("BC_INST_RET[0]:");
6508 s = zbc_program_return(inst);
6510 case BC_INST_BOOL_OR:
6511 case BC_INST_BOOL_AND:
6513 case BC_INST_REL_EQ:
6514 case BC_INST_REL_LE:
6515 case BC_INST_REL_GE:
6516 case BC_INST_REL_NE:
6517 case BC_INST_REL_LT:
6518 case BC_INST_REL_GT:
6519 dbg_exec("BC_INST_BOOL:");
6520 s = zbc_program_logical(inst);
6523 dbg_exec("BC_INST_READ:");
6524 s = zbc_program_read();
6527 dbg_exec("BC_INST_VAR:");
6528 s = zbc_program_pushVar(code, &ip->idx, false, false);
6530 case BC_INST_ARRAY_ELEM:
6532 dbg_exec("BC_INST_ARRAY[_ELEM]:");
6533 s = zbc_program_pushArray(code, &ip->idx, inst);
6536 r.t = BC_RESULT_LAST;
6537 bc_vec_push(&G.prog.results, &r);
6542 bc_program_pushGlobal(inst);
6544 case BC_INST_SCALE_FUNC:
6545 case BC_INST_LENGTH:
6547 dbg_exec("BC_INST_builtin:");
6548 s = zbc_program_builtin(inst);
6551 dbg_exec("BC_INST_NUM:");
6552 r.t = BC_RESULT_CONSTANT;
6553 r.d.id.idx = bc_program_index(code, &ip->idx);
6554 bc_vec_push(&G.prog.results, &r);
6557 dbg_exec("BC_INST_POP:");
6558 if (!BC_PROG_STACK(&G.prog.results, 1))
6559 s = bc_error_stack_has_too_few_elements();
6561 bc_vec_pop(&G.prog.results);
6563 case BC_INST_POP_EXEC:
6564 dbg_exec("BC_INST_POP_EXEC:");
6565 bc_vec_pop(&G.prog.stack);
6568 case BC_INST_PRINT_POP:
6569 case BC_INST_PRINT_STR:
6570 dbg_exec("BC_INST_PRINTxyz:");
6571 s = zbc_program_print(inst, 0);
6574 dbg_exec("BC_INST_STR:");
6575 r.t = BC_RESULT_STR;
6576 r.d.id.idx = bc_program_index(code, &ip->idx);
6577 bc_vec_push(&G.prog.results, &r);
6580 case BC_INST_MULTIPLY:
6581 case BC_INST_DIVIDE:
6582 case BC_INST_MODULUS:
6585 dbg_exec("BC_INST_binaryop:");
6586 s = zbc_program_op(inst);
6588 case BC_INST_BOOL_NOT:
6589 dbg_exec("BC_INST_BOOL_NOT:");
6590 s = zbc_program_prep(&ptr, &num);
6591 if (s) RETURN_STATUS(s);
6592 bc_num_init_DEF_SIZE(&r.d.n);
6593 if (!bc_num_cmp(num, &G.prog.zero))
6595 //else bc_num_zero(&r.d.n); - already is
6596 bc_program_retire(&r, BC_RESULT_TEMP);
6599 dbg_exec("BC_INST_NEG:");
6600 s = zbc_program_negate();
6603 case BC_INST_ASSIGN_POWER:
6604 case BC_INST_ASSIGN_MULTIPLY:
6605 case BC_INST_ASSIGN_DIVIDE:
6606 case BC_INST_ASSIGN_MODULUS:
6607 case BC_INST_ASSIGN_PLUS:
6608 case BC_INST_ASSIGN_MINUS:
6610 case BC_INST_ASSIGN:
6611 dbg_exec("BC_INST_ASSIGNxyz:");
6612 s = zbc_program_assign(inst);
6615 case BC_INST_MODEXP:
6616 s = zbc_program_modexp();
6618 case BC_INST_DIVMOD:
6619 s = zbc_program_divmod();
6621 case BC_INST_EXECUTE:
6622 case BC_INST_EXEC_COND:
6623 s = zbc_program_execStr(code, &ip->idx, inst == BC_INST_EXEC_COND);
6625 case BC_INST_PRINT_STACK: {
6627 for (idx = 0; idx < G.prog.results.len; ++idx) {
6628 s = zbc_program_print(BC_INST_PRINT, idx);
6633 case BC_INST_CLEAR_STACK:
6634 bc_vec_pop_all(&G.prog.results);
6636 case BC_INST_STACK_LEN:
6637 bc_program_stackLen();
6639 case BC_INST_DUPLICATE:
6640 if (!BC_PROG_STACK(&G.prog.results, 1))
6641 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6642 ptr = bc_vec_top(&G.prog.results);
6643 bc_result_copy(&r, ptr);
6644 bc_vec_push(&G.prog.results, &r);
6646 case BC_INST_SWAP: {
6648 if (!BC_PROG_STACK(&G.prog.results, 2))
6649 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6650 ptr = bc_vec_item_rev(&G.prog.results, 0);
6651 ptr2 = bc_vec_item_rev(&G.prog.results, 1);
6652 memcpy(&r, ptr, sizeof(BcResult));
6653 memcpy(ptr, ptr2, sizeof(BcResult));
6654 memcpy(ptr2, &r, sizeof(BcResult));
6657 case BC_INST_ASCIIFY:
6658 s = zbc_program_asciify();
6660 case BC_INST_PRINT_STREAM:
6661 s = zbc_program_printStream();
6664 case BC_INST_PUSH_VAR: {
6665 bool copy = inst == BC_INST_LOAD;
6666 s = zbc_program_pushVar(code, &ip->idx, true, copy);
6669 case BC_INST_PUSH_TO_VAR: {
6670 char *name = bc_program_name(code, &ip->idx);
6671 s = zbc_program_copyToVar(name, true);
6676 dbg_exec("BC_INST_NEG:");
6677 if (G.prog.stack.len <= 2)
6678 QUIT_OR_RETURN_TO_MAIN;
6679 bc_vec_npop(&G.prog.stack, 2);
6682 s = zbc_program_nquit();
6687 if (s || G_interrupt) {
6694 // If the stack has changed, pointers may be invalid.
6695 ip = bc_vec_top(&G.prog.stack);
6696 func = bc_program_func(ip->func);
6697 code = func->code.v;
6700 RETURN_STATUS(BC_STATUS_SUCCESS);
6702 #define zbc_program_exec(...) (zbc_program_exec(__VA_ARGS__) COMMA_SUCCESS)
6704 static unsigned bc_vm_envLen(const char *var)
6710 len = BC_NUM_PRINT_WIDTH;
6711 if (!lenv) return len;
6713 len = bb_strtou(lenv, NULL, 10) - 1;
6714 if (errno || len < 2 || len >= INT_MAX)
6715 len = BC_NUM_PRINT_WIDTH;
6720 static BC_STATUS zbc_vm_process(const char *text)
6724 dbg_lex_enter("%s:%d entered", __func__, __LINE__);
6725 s = zbc_parse_text_init(&G.prs, text);
6726 if (s) RETURN_STATUS(s);
6728 while (G.prs.l.t.t != BC_LEX_EOF) {
6729 dbg_lex("%s:%d G.prs.l.t.t:%d", __func__, __LINE__, G.prs.l.t.t);
6730 s = zcommon_parse(&G.prs);
6731 if (s) RETURN_STATUS(s);
6732 s = zbc_program_exec();
6739 dbg_lex_done("%s:%d done", __func__, __LINE__);
6742 #define zbc_vm_process(...) (zbc_vm_process(__VA_ARGS__) COMMA_SUCCESS)
6744 static BC_STATUS zbc_vm_execute_FILE(FILE *fp, const char *filename)
6746 // So far bc/dc have no way to include a file from another file,
6747 // therefore we know G.prog.file == NULL on entry
6748 //const char *sv_file;
6751 G.prog.file = filename;
6753 bc_lex_file(&G.prs.l);
6756 s = zbc_vm_process("");
6757 // We do not stop looping on errors here if reading stdin.
6758 // Example: start interactive bc and enter "return".
6759 // It should say "'return' not in a function"
6760 // but should not exit.
6761 } while (G.input_fp == stdin);
6765 #define zbc_vm_execute_FILE(...) (zbc_vm_execute_FILE(__VA_ARGS__) COMMA_SUCCESS)
6767 static BC_STATUS zbc_vm_file(const char *file)
6772 fp = xfopen_for_read(file);
6773 s = zbc_vm_execute_FILE(fp, file);
6778 #define zbc_vm_file(...) (zbc_vm_file(__VA_ARGS__) COMMA_SUCCESS)
6781 static void bc_vm_info(void)
6783 printf("%s "BB_VER"\n"
6784 "Copyright (c) 2018 Gavin D. Howard and contributors\n"
6788 static void bc_args(char **argv)
6794 #if ENABLE_FEATURE_BC_LONG_OPTIONS
6795 opts = option_mask32 |= getopt32long(argv, "wvsqli",
6796 "warn\0" No_argument "w"
6797 "version\0" No_argument "v"
6798 "standard\0" No_argument "s"
6799 "quiet\0" No_argument "q"
6800 "mathlib\0" No_argument "l"
6801 "interactive\0" No_argument "i"
6804 opts = option_mask32 |= getopt32(argv, "wvsqli");
6806 if (getenv("POSIXLY_CORRECT"))
6807 option_mask32 |= BC_FLAG_S;
6809 if (opts & BC_FLAG_V) {
6814 for (i = optind; argv[i]; ++i)
6815 bc_vec_push(&G.files, argv + i);
6818 static void bc_vm_envArgs(void)
6822 char *env_args = getenv("BC_ENV_ARGS");
6824 if (!env_args) return;
6826 G.env_args = xstrdup(env_args);
6829 bc_vec_init(&v, sizeof(char *), NULL);
6831 while (*(buf = skip_whitespace(buf)) != '\0') {
6832 bc_vec_push(&v, &buf);
6833 buf = skip_non_whitespace(buf);
6839 // NULL terminate, and pass argv[] so that first arg is argv[1]
6840 if (sizeof(int) == sizeof(char*)) {
6841 bc_vec_push(&v, &const_int_0);
6843 static char *const nullptr = NULL;
6844 bc_vec_push(&v, &nullptr);
6846 bc_args(((char **)v.v) - 1);
6851 static const char bc_lib[] ALIGN1 = {
6854 "\n" "auto b,s,n,r,d,i,p,f,v"
6855 ////////////////"if(x<0)return(1/e(-x))" // and drop 'n' and x<0 logic below
6856 //^^^^^^^^^^^^^^^^ this would work, and is even more precise than GNU bc:
6857 //e(-.998896): GNU:.36828580434569428695
6858 // above code:.36828580434569428696
6859 // actual value:.3682858043456942869594...
6860 // but for now let's be "GNU compatible"
6869 "\n" "scale=scale(x)+1"
6879 "\n" "for(i=2;v;++i){"
6885 "\n" "while(d--)r*=r"
6888 "\n" "if(n)return(1/r)"
6892 "\n" "auto b,s,r,p,a,q,i,v"
6896 "\n" "r=(1-10^scale)/1"
6907 "\n" "while(x<=.5){"
6911 "\n" "r=a=(x-1)/(x+1)"
6914 "\n" "for(i=3;v;i+=2){"
6925 "\n" "auto b,s,r,a,q,i"
6926 "\n" "if(x<0)return(-s(-x))"
6930 "\n" "scale=1.1*s+2"
6939 "\n" "for(i=3;a;i+=2){"
6940 "\n" "a*=q/(i*(i-1))"
6953 "\n" "x=s(2*a(1)+x)"
6959 "\n" "auto b,s,r,n,a,m,t,f,i,u"
6967 "\n" "if(scale<65){"
6968 "\n" "if(x==1)return(.7853981633974483096156608458198757210492923498437764552437361480/n)"
6969 "\n" "if(x==.2)return(.1973955598498807583700497651947902934475851037878521015176889402/n)"
6979 "\n" "x=(x-.2)/(1+.2*x)"
6984 "\n" "for(i=3;t;i+=2){"
6991 "\n" "return((m*a+r)/n)"
6993 "\n" "define j(n,x){"
6994 "\n" "auto b,s,o,a,i,v,f"
7005 "\n" "for(i=2;i<=n;++i)a*=i"
7007 "\n" "a=(x^n)/2^n/a"
7010 "\n" "scale+=length(a)-scale(a)"
7011 "\n" "for(i=1;v;++i){"
7012 "\n" "v=v*f/i/(n+i)"
7018 "\n" "return(a*r/1)"
7023 static BC_STATUS zbc_vm_exec(void)
7029 if (option_mask32 & BC_FLAG_L) {
7030 // We know that internal library is not buggy,
7031 // thus error checking is normally disabled.
7032 # define DEBUG_LIB 0
7033 bc_lex_file(&G.prs.l);
7034 s = zbc_vm_process(bc_lib);
7035 if (DEBUG_LIB && s) RETURN_STATUS(s);
7039 s = BC_STATUS_SUCCESS;
7040 for (i = 0; !s && i < G.files.len; ++i)
7041 s = zbc_vm_file(*((char **) bc_vec_item(&G.files, i)));
7042 if (ENABLE_FEATURE_CLEAN_UP && s && !G_ttyin) {
7043 // Debug config, non-interactive mode:
7044 // return all the way back to main.
7045 // Non-debug builds do not come here, they exit.
7049 if (IS_BC || (option_mask32 & BC_FLAG_I))
7050 s = zbc_vm_execute_FILE(stdin, /*filename:*/ NULL);
7054 #define zbc_vm_exec(...) (zbc_vm_exec(__VA_ARGS__) COMMA_SUCCESS)
7056 #if ENABLE_FEATURE_CLEAN_UP
7057 static void bc_program_free(void)
7059 bc_num_free(&G.prog.ob);
7061 bc_num_free(&G.prog.strmb);
7063 bc_vec_free(&G.prog.fns);
7064 bc_vec_free(&G.prog.fn_map);
7065 bc_vec_free(&G.prog.vars);
7066 bc_vec_free(&G.prog.var_map);
7067 bc_vec_free(&G.prog.arrs);
7068 bc_vec_free(&G.prog.arr_map);
7069 bc_vec_free(&G.prog.strs);
7070 bc_vec_free(&G.prog.consts);
7071 bc_vec_free(&G.prog.results);
7072 bc_vec_free(&G.prog.stack);
7073 bc_num_free(&G.prog.last);
7074 bc_num_free(&G.prog.zero);
7075 bc_num_free(&G.prog.one);
7076 bc_vec_free(&G.input_buffer);
7079 static void bc_vm_free(void)
7081 bc_vec_free(&G.files);
7083 bc_parse_free(&G.prs);
7088 static void bc_program_init(void)
7093 // memset(&G.prog, 0, sizeof(G.prog)); - already is
7094 memset(&ip, 0, sizeof(BcInstPtr));
7096 // G.prog.nchars = G.prog.scale = 0; - already is
7099 bc_num_init_DEF_SIZE(&G.prog.ob);
7100 bc_num_ten(&G.prog.ob);
7104 bc_num_init_DEF_SIZE(&G.prog.strmb);
7105 bc_num_ulong2num(&G.prog.strmb, UCHAR_MAX + 1);
7108 bc_num_init_DEF_SIZE(&G.prog.last);
7109 //bc_num_zero(&G.prog.last); - already is
7111 bc_num_init_DEF_SIZE(&G.prog.zero);
7112 //bc_num_zero(&G.prog.zero); - already is
7114 bc_num_init_DEF_SIZE(&G.prog.one);
7115 bc_num_one(&G.prog.one);
7117 bc_vec_init(&G.prog.fns, sizeof(BcFunc), bc_func_free);
7118 bc_vec_init(&G.prog.fn_map, sizeof(BcId), bc_id_free);
7120 bc_program_addFunc(xstrdup("(main)"), &idx);
7121 bc_program_addFunc(xstrdup("(read)"), &idx);
7123 bc_vec_init(&G.prog.vars, sizeof(BcVec), bc_vec_free);
7124 bc_vec_init(&G.prog.var_map, sizeof(BcId), bc_id_free);
7126 bc_vec_init(&G.prog.arrs, sizeof(BcVec), bc_vec_free);
7127 bc_vec_init(&G.prog.arr_map, sizeof(BcId), bc_id_free);
7129 bc_vec_init(&G.prog.strs, sizeof(char *), bc_string_free);
7130 bc_vec_init(&G.prog.consts, sizeof(char *), bc_string_free);
7131 bc_vec_init(&G.prog.results, sizeof(BcResult), bc_result_free);
7132 bc_vec_init(&G.prog.stack, sizeof(BcInstPtr), NULL);
7133 bc_vec_push(&G.prog.stack, &ip);
7135 bc_char_vec_init(&G.input_buffer);
7138 static int bc_vm_init(const char *env_len)
7140 #if ENABLE_FEATURE_EDITING
7141 G.line_input_state = new_line_input_t(DO_HISTORY);
7143 G.prog.len = bc_vm_envLen(env_len);
7145 bc_vec_init(&G.files, sizeof(char *), NULL);
7146 IF_BC(if (IS_BC) bc_vm_envArgs();)
7148 bc_parse_create(&G.prs, BC_PROG_MAIN);
7150 //TODO: in GNU bc, the check is (isatty(0) && isatty(1)),
7151 //-i option unconditionally enables this regardless of isatty():
7153 #if ENABLE_FEATURE_BC_SIGNALS
7155 // With SA_RESTART, most system calls will restart
7156 // (IOW: they won't fail with EINTR).
7157 // In particular, this means ^C won't cause
7158 // stdout to get into "error state" if SIGINT hits
7159 // within write() syscall.
7161 // The downside is that ^C while tty input is taken
7162 // will only be handled after [Enter] since read()
7163 // from stdin is not interrupted by ^C either,
7164 // it restarts, thus fgetc() does not return on ^C.
7165 // (This problem manifests only if line editing is disabled)
7166 signal_SA_RESTART_empty_mask(SIGINT, record_signo);
7168 // Without SA_RESTART, this exhibits a bug:
7169 // "while (1) print 1" and try ^C-ing it.
7170 // Intermittently, instead of returning to input line,
7171 // you'll get "output error: Interrupted system call"
7173 //signal_no_SA_RESTART_empty_mask(SIGINT, record_signo);
7177 return 0; // "not a tty"
7180 static BcStatus bc_vm_run(void)
7182 BcStatus st = zbc_vm_exec();
7183 #if ENABLE_FEATURE_CLEAN_UP
7184 if (G_exiting) // it was actually "halt" or "quit"
7187 # if ENABLE_FEATURE_EDITING
7188 free_line_input_t(G.line_input_state);
7192 dbg_exec("exiting with exitcode %d", st);
7197 int bc_main(int argc, char **argv) MAIN_EXTERNALLY_VISIBLE;
7198 int bc_main(int argc UNUSED_PARAM, char **argv)
7204 is_tty = bc_vm_init("BC_LINE_LENGTH");
7208 if (is_tty && !(option_mask32 & BC_FLAG_Q))
7216 int dc_main(int argc, char **argv) MAIN_EXTERNALLY_VISIBLE;
7217 int dc_main(int argc UNUSED_PARAM, char **argv)
7223 // TODO: dc (GNU bc 1.07.1) 1.4.1 seems to use width
7224 // 1 char wider than bc from the same package.
7225 // Both default width, and xC_LINE_LENGTH=N are wider:
7226 // "DC_LINE_LENGTH=5 dc -e'123456 p'" prints:
7229 // "echo '123456' | BC_LINE_LENGTH=5 bc" prints:
7232 // Do the same, or it's a bug?
7233 bc_vm_init("DC_LINE_LENGTH");
7235 // Run -e'SCRIPT' and -fFILE in order of appearance, then handle FILEs
7236 noscript = BC_FLAG_I;
7238 int n = getopt(argc, argv, "e:f:x");
7244 n = zbc_vm_process(optarg);
7249 n = zbc_vm_file(optarg);
7253 option_mask32 |= DC_FLAG_X;
7263 bc_vec_push(&G.files, argv++);
7266 option_mask32 |= noscript; // set BC_FLAG_I if we need to interpret stdin
7272 #endif // not DC_SMALL