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) {
1469 for (a[i] -= b[i], j = 0; a[i + j] < 0;) {
1476 static ssize_t bc_num_compare(BcDig *restrict a, BcDig *restrict b, size_t len)
1480 for (i = len - 1; i < len && !(c = a[i] - b[i]); --i);
1481 return BC_NUM_NEG(i + 1, c < 0);
1484 static ssize_t bc_num_cmp(BcNum *a, BcNum *b)
1486 size_t i, min, a_int, b_int, diff;
1487 BcDig *max_num, *min_num;
1491 if (a == b) return 0;
1492 if (a->len == 0) return BC_NUM_NEG(!!b->len, !b->neg);
1493 if (b->len == 0) return BC_NUM_NEG(1, a->neg);
1495 if (a->neg != b->neg) // signs of a and b differ
1496 // +a,-b = a>b = 1 or -a,+b = a<b = -1
1497 return (int)b->neg - (int)a->neg;
1498 neg = a->neg; // 1 if both negative, 0 if both positive
1500 a_int = BC_NUM_INT(a);
1501 b_int = BC_NUM_INT(b);
1504 if (a_int != 0) return (ssize_t) a_int;
1506 a_max = (a->rdx > b->rdx);
1509 diff = a->rdx - b->rdx;
1510 max_num = a->num + diff;
1512 // neg = (a_max == neg); - NOP (maps 1->1 and 0->0)
1515 diff = b->rdx - a->rdx;
1516 max_num = b->num + diff;
1518 neg = !neg; // same as "neg = (a_max == neg)"
1521 cmp = bc_num_compare(max_num, min_num, b_int + min);
1522 if (cmp != 0) return BC_NUM_NEG(cmp, neg);
1524 for (max_num -= diff, i = diff - 1; i < diff; --i) {
1525 if (max_num[i]) return BC_NUM_NEG(1, neg);
1531 static void bc_num_truncate(BcNum *n, size_t places)
1533 if (places == 0) return;
1539 memmove(n->num, n->num + places, n->len * sizeof(BcDig));
1543 static void bc_num_extend(BcNum *n, size_t places)
1545 size_t len = n->len + places;
1549 if (n->cap < len) bc_num_expand(n, len);
1551 memmove(n->num + places, n->num, sizeof(BcDig) * n->len);
1552 memset(n->num, 0, sizeof(BcDig) * places);
1559 static void bc_num_clean(BcNum *n)
1561 while (n->len > 0 && n->num[n->len - 1] == 0) --n->len;
1564 else if (n->len < n->rdx)
1568 static void bc_num_retireMul(BcNum *n, size_t scale, bool neg1, bool neg2)
1571 bc_num_extend(n, scale - n->rdx);
1573 bc_num_truncate(n, n->rdx - scale);
1576 if (n->len != 0) n->neg = !neg1 != !neg2;
1579 static void bc_num_split(BcNum *restrict n, size_t idx, BcNum *restrict a,
1584 b->len = n->len - idx;
1586 a->rdx = b->rdx = 0;
1588 memcpy(b->num, n->num + idx, b->len * sizeof(BcDig));
1589 memcpy(a->num, n->num, idx * sizeof(BcDig));
1600 static BC_STATUS zbc_num_shift(BcNum *n, size_t places)
1602 if (places == 0 || n->len == 0) RETURN_STATUS(BC_STATUS_SUCCESS);
1604 // This check makes sense only if size_t is (much) larger than BC_MAX_NUM.
1605 if (SIZE_MAX > (BC_MAX_NUM | 0xff)) {
1606 if (places + n->len > BC_MAX_NUM)
1607 RETURN_STATUS(bc_error("number too long: must be [1,"BC_MAX_NUM_STR"]"));
1610 if (n->rdx >= places)
1613 bc_num_extend(n, places - n->rdx);
1619 RETURN_STATUS(BC_STATUS_SUCCESS);
1621 #define zbc_num_shift(...) (zbc_num_shift(__VA_ARGS__) COMMA_SUCCESS)
1623 static BC_STATUS zbc_num_inv(BcNum *a, BcNum *b, size_t scale)
1632 RETURN_STATUS(zbc_num_div(&one, a, b, scale));
1634 #define zbc_num_inv(...) (zbc_num_inv(__VA_ARGS__) COMMA_SUCCESS)
1636 static FAST_FUNC BC_STATUS zbc_num_a(BcNum *a, BcNum *b, BcNum *restrict c, size_t sub)
1638 BcDig *ptr, *ptr_a, *ptr_b, *ptr_c;
1639 size_t i, max, min_rdx, min_int, diff, a_int, b_int;
1642 // Because this function doesn't need to use scale (per the bc spec),
1643 // I am hijacking it to say whether it's doing an add or a subtract.
1647 if (sub && c->len) c->neg = !c->neg;
1648 RETURN_STATUS(BC_STATUS_SUCCESS);
1652 RETURN_STATUS(BC_STATUS_SUCCESS);
1656 c->rdx = BC_MAX(a->rdx, b->rdx);
1657 min_rdx = BC_MIN(a->rdx, b->rdx);
1660 if (a->rdx > b->rdx) {
1661 diff = a->rdx - b->rdx;
1663 ptr_a = a->num + diff;
1667 diff = b->rdx - a->rdx;
1670 ptr_b = b->num + diff;
1673 for (ptr_c = c->num, i = 0; i < diff; ++i, ++c->len) ptr_c[i] = ptr[i];
1676 a_int = BC_NUM_INT(a);
1677 b_int = BC_NUM_INT(b);
1679 if (a_int > b_int) {
1690 for (carry = 0, i = 0; i < min_rdx + min_int; ++i, ++c->len) {
1691 in = ((int) ptr_a[i]) + ((int) ptr_b[i]) + carry;
1693 ptr_c[i] = (BcDig)(in % 10);
1696 for (; i < max + min_rdx; ++i, ++c->len) {
1697 in = ((int) ptr[i]) + carry;
1699 ptr_c[i] = (BcDig)(in % 10);
1702 if (carry != 0) c->num[c->len++] = (BcDig) carry;
1704 RETURN_STATUS(BC_STATUS_SUCCESS); // can't make void, see zbc_num_binary()
1707 static FAST_FUNC BC_STATUS zbc_num_s(BcNum *a, BcNum *b, BcNum *restrict c, size_t sub)
1710 BcNum *minuend, *subtrahend;
1712 bool aneg, bneg, neg;
1714 // Because this function doesn't need to use scale (per the bc spec),
1715 // I am hijacking it to say whether it's doing an add or a subtract.
1719 if (sub && c->len) c->neg = !c->neg;
1720 RETURN_STATUS(BC_STATUS_SUCCESS);
1724 RETURN_STATUS(BC_STATUS_SUCCESS);
1729 a->neg = b->neg = false;
1731 cmp = bc_num_cmp(a, b);
1737 bc_num_setToZero(c, BC_MAX(a->rdx, b->rdx));
1738 RETURN_STATUS(BC_STATUS_SUCCESS);
1747 if (sub) neg = !neg;
1752 bc_num_copy(c, minuend);
1755 if (c->rdx < subtrahend->rdx) {
1756 bc_num_extend(c, subtrahend->rdx - c->rdx);
1760 start = c->rdx - subtrahend->rdx;
1762 bc_num_subArrays(c->num + start, subtrahend->num, subtrahend->len);
1766 RETURN_STATUS(BC_STATUS_SUCCESS); // can't make void, see zbc_num_binary()
1769 static FAST_FUNC BC_STATUS zbc_num_k(BcNum *restrict a, BcNum *restrict b,
1771 #define zbc_num_k(...) (zbc_num_k(__VA_ARGS__) COMMA_SUCCESS)
1774 size_t max = BC_MAX(a->len, b->len), max2 = (max + 1) / 2;
1775 BcNum l1, h1, l2, h2, m2, m1, z0, z1, z2, temp;
1778 if (a->len == 0 || b->len == 0) {
1780 RETURN_STATUS(BC_STATUS_SUCCESS);
1782 aone = BC_NUM_ONE(a);
1783 if (aone || BC_NUM_ONE(b)) {
1784 bc_num_copy(c, aone ? b : a);
1785 RETURN_STATUS(BC_STATUS_SUCCESS);
1788 if (a->len + b->len < BC_NUM_KARATSUBA_LEN ||
1789 a->len < BC_NUM_KARATSUBA_LEN || b->len < BC_NUM_KARATSUBA_LEN)
1794 bc_num_expand(c, a->len + b->len + 1);
1796 memset(c->num, 0, sizeof(BcDig) * c->cap);
1799 for (i = 0; i < b->len; ++i) {
1802 for (j = 0; j < a->len; ++j) {
1803 unsigned in = c->num[i + j];
1804 in += ((unsigned) a->num[j]) * ((unsigned) b->num[i]) + carry;
1805 // note: compilers prefer _unsigned_ div/const
1807 c->num[i + j] = (BcDig)(in % 10);
1810 c->num[i + j] += (BcDig) carry;
1811 len = BC_MAX(len, i + j + !!carry);
1813 #if ENABLE_FEATURE_BC_SIGNALS
1815 // a*a <- without check below, this will not be interruptible
1816 if (G_interrupt) return BC_STATUS_FAILURE;
1822 RETURN_STATUS(BC_STATUS_SUCCESS);
1825 bc_num_init(&l1, max);
1826 bc_num_init(&h1, max);
1827 bc_num_init(&l2, max);
1828 bc_num_init(&h2, max);
1829 bc_num_init(&m1, max);
1830 bc_num_init(&m2, max);
1831 bc_num_init(&z0, max);
1832 bc_num_init(&z1, max);
1833 bc_num_init(&z2, max);
1834 bc_num_init(&temp, max + max);
1836 bc_num_split(a, max2, &l1, &h1);
1837 bc_num_split(b, max2, &l2, &h2);
1839 s = zbc_num_add(&h1, &l1, &m1, 0);
1841 s = zbc_num_add(&h2, &l2, &m2, 0);
1844 s = zbc_num_k(&h1, &h2, &z0);
1846 s = zbc_num_k(&m1, &m2, &z1);
1848 s = zbc_num_k(&l1, &l2, &z2);
1851 s = zbc_num_sub(&z1, &z0, &temp, 0);
1853 s = zbc_num_sub(&temp, &z2, &z1, 0);
1856 s = zbc_num_shift(&z0, max2 * 2);
1858 s = zbc_num_shift(&z1, max2);
1860 s = zbc_num_add(&z0, &z1, &temp, 0);
1862 s = zbc_num_add(&temp, &z2, c, 0);
1878 static FAST_FUNC BC_STATUS zbc_num_m(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale)
1882 size_t maxrdx = BC_MAX(a->rdx, b->rdx);
1884 scale = BC_MAX(scale, a->rdx);
1885 scale = BC_MAX(scale, b->rdx);
1886 scale = BC_MIN(a->rdx + b->rdx, scale);
1887 maxrdx = BC_MAX(maxrdx, scale);
1889 bc_num_init(&cpa, a->len);
1890 bc_num_init(&cpb, b->len);
1892 bc_num_copy(&cpa, a);
1893 bc_num_copy(&cpb, b);
1894 cpa.neg = cpb.neg = false;
1896 s = zbc_num_shift(&cpa, maxrdx);
1898 s = zbc_num_shift(&cpb, maxrdx);
1900 s = zbc_num_k(&cpa, &cpb, c);
1904 bc_num_expand(c, c->len + maxrdx);
1906 if (c->len < maxrdx) {
1907 memset(c->num + c->len, 0, (c->cap - c->len) * sizeof(BcDig));
1912 bc_num_retireMul(c, scale, a->neg, b->neg);
1919 #define zbc_num_m(...) (zbc_num_m(__VA_ARGS__) COMMA_SUCCESS)
1921 static FAST_FUNC BC_STATUS zbc_num_d(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale)
1923 BcStatus s = BC_STATUS_SUCCESS;
1930 RETURN_STATUS(bc_error("divide by zero"));
1932 bc_num_setToZero(c, scale);
1933 RETURN_STATUS(BC_STATUS_SUCCESS);
1935 if (BC_NUM_ONE(b)) {
1937 bc_num_retireMul(c, scale, a->neg, b->neg);
1938 RETURN_STATUS(BC_STATUS_SUCCESS);
1941 bc_num_init(&cp, BC_NUM_MREQ(a, b, scale));
1942 bc_num_copy(&cp, a);
1946 bc_num_expand(&cp, len + 2);
1947 bc_num_extend(&cp, len - cp.len);
1950 if (b->rdx > cp.rdx) bc_num_extend(&cp, b->rdx - cp.rdx);
1952 if (scale > cp.rdx) bc_num_extend(&cp, scale - cp.rdx);
1954 if (b->rdx == b->len) {
1955 for (i = 0; zero && i < len; ++i) zero = !b->num[len - i - 1];
1959 if (cp.cap == cp.len) bc_num_expand(&cp, cp.len + 1);
1961 // We want an extra zero in front to make things simpler.
1962 cp.num[cp.len++] = 0;
1965 bc_num_expand(c, cp.len);
1968 memset(c->num + end, 0, (c->cap - end) * sizeof(BcDig));
1973 for (i = end - 1; !s && i < end; --i) {
1975 for (q = 0; (!s && n[len] != 0) || bc_num_compare(n, p, len) >= 0; ++q)
1976 bc_num_subArrays(n, p, len);
1978 #if ENABLE_FEATURE_BC_SIGNALS
1981 // 1/a <- without check below, this will not be interruptible
1983 s = BC_STATUS_FAILURE;
1989 bc_num_retireMul(c, scale, a->neg, b->neg);
1994 #define zbc_num_d(...) (zbc_num_d(__VA_ARGS__) COMMA_SUCCESS)
1996 static FAST_FUNC BC_STATUS zbc_num_r(BcNum *a, BcNum *b, BcNum *restrict c,
1997 BcNum *restrict d, size_t scale, size_t ts)
2004 RETURN_STATUS(bc_error("divide by zero"));
2007 bc_num_setToZero(d, ts);
2008 RETURN_STATUS(BC_STATUS_SUCCESS);
2011 bc_num_init(&temp, d->cap);
2012 s = zbc_num_d(a, b, c, scale);
2015 if (scale != 0) scale = ts;
2017 s = zbc_num_m(c, b, &temp, scale);
2019 s = zbc_num_sub(a, &temp, d, scale);
2022 if (ts > d->rdx && d->len) bc_num_extend(d, ts - d->rdx);
2025 bc_num_retireMul(d, ts, a->neg, b->neg);
2032 #define zbc_num_r(...) (zbc_num_r(__VA_ARGS__) COMMA_SUCCESS)
2034 static FAST_FUNC BC_STATUS zbc_num_rem(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale)
2038 size_t ts = BC_MAX(scale + b->rdx, a->rdx), len = BC_NUM_MREQ(a, b, ts);
2040 bc_num_init(&c1, len);
2041 s = zbc_num_r(a, b, &c1, c, scale, ts);
2046 #define zbc_num_rem(...) (zbc_num_rem(__VA_ARGS__) COMMA_SUCCESS)
2048 static FAST_FUNC BC_STATUS zbc_num_p(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale)
2050 BcStatus s = BC_STATUS_SUCCESS;
2053 size_t i, powrdx, resrdx;
2056 if (b->rdx) RETURN_STATUS(bc_error("non integer number"));
2060 RETURN_STATUS(BC_STATUS_SUCCESS);
2063 bc_num_setToZero(c, scale);
2064 RETURN_STATUS(BC_STATUS_SUCCESS);
2066 if (BC_NUM_ONE(b)) {
2070 s = zbc_num_inv(a, c, scale);
2077 s = zbc_num_ulong(b, &pow);
2078 if (s) RETURN_STATUS(s);
2080 bc_num_init(©, a->len);
2081 bc_num_copy(©, a);
2086 if (a->rdx * pow < scale)
2087 scale = a->rdx * pow;
2092 for (powrdx = a->rdx; !(pow & 1); pow >>= 1) {
2094 s = zbc_num_mul(©, ©, ©, powrdx);
2096 // Not needed: zbc_num_mul() has a check for ^C:
2097 //if (G_interrupt) {
2098 // s = BC_STATUS_FAILURE;
2103 bc_num_copy(c, ©);
2105 for (resrdx = powrdx, pow >>= 1; pow != 0; pow >>= 1) {
2108 s = zbc_num_mul(©, ©, ©, powrdx);
2113 s = zbc_num_mul(c, ©, c, resrdx);
2116 // Not needed: zbc_num_mul() has a check for ^C:
2117 //if (G_interrupt) {
2118 // s = BC_STATUS_FAILURE;
2124 s = zbc_num_inv(c, c, scale);
2128 if (c->rdx > scale) bc_num_truncate(c, c->rdx - scale);
2130 // We can't use bc_num_clean() here.
2131 for (zero = true, i = 0; zero && i < c->len; ++i) zero = !c->num[i];
2132 if (zero) bc_num_setToZero(c, scale);
2138 #define zbc_num_p(...) (zbc_num_p(__VA_ARGS__) COMMA_SUCCESS)
2140 static BC_STATUS zbc_num_binary(BcNum *a, BcNum *b, BcNum *c, size_t scale,
2141 BcNumBinaryOp op, size_t req)
2144 BcNum num2, *ptr_a, *ptr_b;
2149 memcpy(ptr_a, c, sizeof(BcNum));
2158 memcpy(ptr_b, c, sizeof(BcNum));
2166 bc_num_init(c, req);
2168 bc_num_expand(c, req);
2170 s = BC_STATUS_SUCCESS;
2171 IF_ERROR_RETURN_POSSIBLE(s =) op(ptr_a, ptr_b, c, scale);
2173 if (init) bc_num_free(&num2);
2177 #define zbc_num_binary(...) (zbc_num_binary(__VA_ARGS__) COMMA_SUCCESS)
2179 static bool bc_num_strValid(const char *val, size_t base)
2184 b = (BcDig)(base <= 10 ? base + '0' : base - 10 + 'A');
2191 if (radix) return false;
2195 if (c < '0' || c >= b || (c > '9' && c < 'A'))
2201 // Note: n is already "bc_num_zero()"ed,
2202 // leading zeroes in "val" are removed
2203 static void bc_num_parseDecimal(BcNum *n, const char *val)
2212 bc_num_expand(n, len);
2214 ptr = strchr(val, '.');
2218 n->rdx = (size_t)((val + len) - (ptr + 1));
2220 for (i = 0; val[i]; ++i) {
2221 if (val[i] != '0' && val[i] != '.') {
2222 // Not entirely zero value - convert it, and exit
2225 n->num[n->len] = val[i] - '0';
2229 if (val[--i] == '.') goto skip_dot;
2234 // if for() exits without hitting if(), the value is entirely zero
2237 // Note: n is already "bc_num_zero()"ed,
2238 // leading zeroes in "val" are removed
2239 static void bc_num_parseBase(BcNum *n, const char *val, unsigned base_t)
2242 BcNum temp, mult, result;
2248 for (i = 0; ; ++i) {
2251 if (val[i] != '.' && val[i] != '0')
2255 bc_num_init_DEF_SIZE(&temp);
2256 bc_num_init_DEF_SIZE(&mult);
2257 bc_num_init_DEF_SIZE(&base);
2258 bc_num_ulong2num(&base, base_t);
2262 if (c == '\0') goto int_err;
2263 if (c == '.') break;
2265 v = (unsigned long) (c <= '9' ? c - '0' : c - 'A' + 10);
2267 s = zbc_num_mul(n, &base, &mult, 0);
2268 if (s) goto int_err;
2269 bc_num_ulong2num(&temp, v);
2270 s = zbc_num_add(&mult, &temp, n, 0);
2271 if (s) goto int_err;
2274 bc_num_init(&result, base.len);
2275 //bc_num_zero(&result); - already is
2281 if (c == '\0') break;
2284 v = (unsigned long) (c <= '9' ? c - '0' : c - 'A' + 10);
2286 s = zbc_num_mul(&result, &base, &result, 0);
2288 bc_num_ulong2num(&temp, v);
2289 s = zbc_num_add(&result, &temp, &result, 0);
2291 s = zbc_num_mul(&mult, &base, &mult, 0);
2295 s = zbc_num_div(&result, &mult, &result, digits);
2297 s = zbc_num_add(n, &result, n, digits);
2301 if (n->rdx < digits) bc_num_extend(n, digits - n->rdx);
2306 bc_num_free(&result);
2313 static BC_STATUS zbc_num_parse(BcNum *n, const char *val, unsigned base_t)
2315 if (!bc_num_strValid(val, base_t))
2316 RETURN_STATUS(bc_error("bad number string"));
2319 while (*val == '0') val++;
2322 bc_num_parseDecimal(n, val);
2324 bc_num_parseBase(n, val, base_t);
2326 RETURN_STATUS(BC_STATUS_SUCCESS);
2328 #define zbc_num_parse(...) (zbc_num_parse(__VA_ARGS__) COMMA_SUCCESS)
2330 static BC_STATUS zbc_num_sqrt(BcNum *a, BcNum *restrict b, size_t scale)
2333 BcNum num1, num2, half, f, fprime, *x0, *x1, *temp;
2334 size_t pow, len, digs, digs1, resrdx, req, times = 0;
2335 ssize_t cmp = 1, cmp1 = SSIZE_MAX, cmp2 = SSIZE_MAX;
2337 req = BC_MAX(scale, a->rdx) + ((BC_NUM_INT(a) + 1) >> 1) + 1;
2338 bc_num_expand(b, req);
2341 bc_num_setToZero(b, scale);
2342 RETURN_STATUS(BC_STATUS_SUCCESS);
2345 RETURN_STATUS(bc_error("negative number"));
2346 else if (BC_NUM_ONE(a)) {
2348 bc_num_extend(b, scale);
2349 RETURN_STATUS(BC_STATUS_SUCCESS);
2352 scale = BC_MAX(scale, a->rdx) + 1;
2353 len = a->len + scale;
2355 bc_num_init(&num1, len);
2356 bc_num_init(&num2, len);
2357 bc_num_init_DEF_SIZE(&half);
2363 bc_num_init(&f, len);
2364 bc_num_init(&fprime, len);
2370 pow = BC_NUM_INT(a);
2379 pow -= 2 - (pow & 1);
2381 bc_num_extend(x0, pow);
2383 // Make sure to move the radix back.
2387 x0->rdx = digs = digs1 = 0;
2389 len = BC_NUM_INT(x0) + resrdx - 1;
2391 while (cmp != 0 || digs < len) {
2393 s = zbc_num_div(a, x0, &f, resrdx);
2395 s = zbc_num_add(x0, &f, &fprime, resrdx);
2397 s = zbc_num_mul(&fprime, &half, x1, resrdx);
2400 cmp = bc_num_cmp(x1, x0);
2401 digs = x1->len - (unsigned long long) llabs(cmp);
2403 if (cmp == cmp2 && digs == digs1)
2408 resrdx += times > 4;
2421 if (b->rdx > scale) bc_num_truncate(b, b->rdx - scale);
2424 bc_num_free(&fprime);
2431 #define zbc_num_sqrt(...) (zbc_num_sqrt(__VA_ARGS__) COMMA_SUCCESS)
2433 static BC_STATUS zbc_num_divmod(BcNum *a, BcNum *b, BcNum *c, BcNum *d,
2439 size_t ts = BC_MAX(scale + b->rdx, a->rdx), len = BC_NUM_MREQ(a, b, ts);
2442 memcpy(&num2, c, sizeof(BcNum));
2444 bc_num_init(c, len);
2449 bc_num_expand(c, len);
2452 s = zbc_num_r(ptr_a, b, c, d, scale, ts);
2454 if (init) bc_num_free(&num2);
2458 #define zbc_num_divmod(...) (zbc_num_divmod(__VA_ARGS__) COMMA_SUCCESS)
2461 static BC_STATUS zbc_num_modexp(BcNum *a, BcNum *b, BcNum *c, BcNum *restrict d)
2464 BcNum base, exp, two, temp;
2467 RETURN_STATUS(bc_error("divide by zero"));
2468 if (a->rdx || b->rdx || c->rdx)
2469 RETURN_STATUS(bc_error("non integer number"));
2471 RETURN_STATUS(bc_error("negative number"));
2473 bc_num_expand(d, c->len);
2474 bc_num_init(&base, c->len);
2475 bc_num_init(&exp, b->len);
2476 bc_num_init_DEF_SIZE(&two);
2477 bc_num_init(&temp, b->len);
2483 s = zbc_num_rem(a, c, &base, 0);
2485 bc_num_copy(&exp, b);
2487 while (exp.len != 0) {
2489 s = zbc_num_divmod(&exp, &two, &exp, &temp, 0);
2492 if (BC_NUM_ONE(&temp)) {
2493 s = zbc_num_mul(d, &base, &temp, 0);
2495 s = zbc_num_rem(&temp, c, d, 0);
2499 s = zbc_num_mul(&base, &base, &temp, 0);
2501 s = zbc_num_rem(&temp, c, &base, 0);
2512 #define zbc_num_modexp(...) (zbc_num_modexp(__VA_ARGS__) COMMA_SUCCESS)
2516 static BC_STATUS zbc_func_insert(BcFunc *f, char *name, bool var)
2521 for (i = 0; i < f->autos.len; ++i) {
2522 if (strcmp(name, ((BcId *) bc_vec_item(&f->autos, i))->name) == 0)
2523 RETURN_STATUS(bc_error("function parameter or auto var has the same name as another"));
2529 bc_vec_push(&f->autos, &a);
2531 RETURN_STATUS(BC_STATUS_SUCCESS);
2533 #define zbc_func_insert(...) (zbc_func_insert(__VA_ARGS__) COMMA_SUCCESS)
2536 static void bc_func_init(BcFunc *f)
2538 bc_char_vec_init(&f->code);
2539 bc_vec_init(&f->autos, sizeof(BcId), bc_id_free);
2540 bc_vec_init(&f->labels, sizeof(size_t), NULL);
2544 static FAST_FUNC void bc_func_free(void *func)
2546 BcFunc *f = (BcFunc *) func;
2547 bc_vec_free(&f->code);
2548 bc_vec_free(&f->autos);
2549 bc_vec_free(&f->labels);
2552 static void bc_array_expand(BcVec *a, size_t len);
2554 static void bc_array_init(BcVec *a, bool nums)
2557 bc_vec_init(a, sizeof(BcNum), bc_num_free);
2559 bc_vec_init(a, sizeof(BcVec), bc_vec_free);
2560 bc_array_expand(a, 1);
2563 static void bc_array_expand(BcVec *a, size_t len)
2567 if (a->size == sizeof(BcNum) && a->dtor == bc_num_free) {
2568 while (len > a->len) {
2569 bc_num_init_DEF_SIZE(&data.n);
2570 bc_vec_push(a, &data.n);
2574 while (len > a->len) {
2575 bc_array_init(&data.v, true);
2576 bc_vec_push(a, &data.v);
2581 static void bc_array_copy(BcVec *d, const BcVec *s)
2586 bc_vec_expand(d, s->cap);
2589 for (i = 0; i < s->len; ++i) {
2590 BcNum *dnum = bc_vec_item(d, i), *snum = bc_vec_item(s, i);
2591 bc_num_init(dnum, snum->len);
2592 bc_num_copy(dnum, snum);
2596 static FAST_FUNC void bc_string_free(void *string)
2598 free(*((char **) string));
2602 static void bc_result_copy(BcResult *d, BcResult *src)
2608 case BC_RESULT_TEMP:
2609 case BC_RESULT_IBASE:
2610 case BC_RESULT_SCALE:
2611 case BC_RESULT_OBASE:
2613 bc_num_init(&d->d.n, src->d.n.len);
2614 bc_num_copy(&d->d.n, &src->d.n);
2619 case BC_RESULT_ARRAY:
2620 case BC_RESULT_ARRAY_ELEM:
2622 d->d.id.name = xstrdup(src->d.id.name);
2626 case BC_RESULT_CONSTANT:
2627 case BC_RESULT_LAST:
2631 memcpy(&d->d.n, &src->d.n, sizeof(BcNum));
2638 static FAST_FUNC void bc_result_free(void *result)
2640 BcResult *r = (BcResult *) result;
2644 case BC_RESULT_TEMP:
2645 case BC_RESULT_IBASE:
2646 case BC_RESULT_SCALE:
2647 case BC_RESULT_OBASE:
2649 bc_num_free(&r->d.n);
2654 case BC_RESULT_ARRAY:
2655 case BC_RESULT_ARRAY_ELEM:
2669 static void bc_lex_lineComment(BcLex *l)
2671 l->t.t = BC_LEX_WHITESPACE;
2672 while (l->i < l->len && l->buf[l->i++] != '\n');
2676 static void bc_lex_whitespace(BcLex *l)
2678 l->t.t = BC_LEX_WHITESPACE;
2680 char c = l->buf[l->i];
2681 if (c == '\n') // this is BC_LEX_NLINE, not BC_LEX_WHITESPACE
2689 static BC_STATUS zbc_lex_number(BcLex *l, char start)
2691 const char *buf = l->buf + l->i;
2692 size_t len, i, ccnt;
2695 pt = (start == '.');
2696 l->t.t = BC_LEX_NUMBER;
2702 if (c == '\\' && buf[i + 1] == '\n') {
2704 //number_of_backslashes++ - see comment below
2707 if (!isdigit(c) && (c < 'A' || c > 'F')) {
2708 if (c != '.') break;
2709 // if '.' was already seen, stop on second one:
2713 // buf[i] is one of "0-9A-F."
2718 //ccnt is the number of chars in the number string, excluding possible
2719 //trailing "[\<newline>].[\<newline>]" (with any number of \<NL> repetitions).
2720 //i is buf[i] index of the first not-yet-parsed char after that.
2723 // This might overestimate the size, if there are "\<NL>"'s
2724 // in the number. Subtracting number_of_backslashes*2 correctly
2725 // is not that easy: consider that in the case of "NNN.\<NL>"
2726 // loop above will count "\<NL>" before it realizes it is not
2727 // in fact *inside* the number:
2728 len = ccnt + 1; // +1 byte for NUL termination
2730 // This check makes sense only if size_t is (much) larger than BC_MAX_NUM.
2731 if (SIZE_MAX > (BC_MAX_NUM | 0xff)) {
2732 if (len > BC_MAX_NUM)
2733 RETURN_STATUS(bc_error("number too long: must be [1,"BC_MAX_NUM_STR"]"));
2736 bc_vec_pop_all(&l->t.v);
2737 bc_vec_expand(&l->t.v, 1 + len);
2738 bc_vec_push(&l->t.v, &start);
2741 // If we have hit a backslash, skip it. We don't have
2742 // to check for a newline because it's guaranteed.
2748 bc_vec_push(&l->t.v, buf);
2753 bc_vec_pushZeroByte(&l->t.v);
2755 RETURN_STATUS(BC_STATUS_SUCCESS);
2757 #define zbc_lex_number(...) (zbc_lex_number(__VA_ARGS__) COMMA_SUCCESS)
2759 static void bc_lex_name(BcLex *l)
2764 l->t.t = BC_LEX_NAME;
2767 buf = l->buf + l->i - 1;
2770 if ((c < 'a' || c > 'z') && !isdigit(c) && c != '_') break;
2774 #if 0 // We do not protect against people with gigabyte-long names
2775 // This check makes sense only if size_t is (much) larger than BC_MAX_STRING.
2776 if (SIZE_MAX > (BC_MAX_STRING | 0xff)) {
2777 if (i > BC_MAX_STRING)
2778 return bc_error("name too long: must be [1,"BC_MAX_STRING_STR"]");
2781 bc_vec_string(&l->t.v, i, buf);
2783 // Increment the index. We minus 1 because it has already been incremented.
2786 //return BC_STATUS_SUCCESS;
2789 static void bc_lex_init(BcLex *l)
2791 bc_char_vec_init(&l->t.v);
2794 static void bc_lex_free(BcLex *l)
2796 bc_vec_free(&l->t.v);
2799 static void bc_lex_file(BcLex *l)
2801 G.err_line = l->line = 1;
2805 IF_BC(static BC_STATUS zbc_lex_token(BcLex *l);)
2806 IF_DC(static BC_STATUS zdc_lex_token(BcLex *l);)
2808 static BC_STATUS zcommon_lex_token(BcLex *l)
2811 IF_BC(RETURN_STATUS(zbc_lex_token(l));)
2813 IF_DC(RETURN_STATUS(zdc_lex_token(l));)
2815 #define zcommon_lex_token(...) (zcommon_lex_token(__VA_ARGS__) COMMA_SUCCESS)
2817 static bool bc_lex_more_input(BcLex *l)
2822 bc_vec_pop_all(&G.input_buffer);
2824 // This loop is complex because the vm tries not to send any lines that end
2825 // with a backslash to the parser. The reason for that is because the parser
2826 // treats a backslash+newline combo as whitespace, per the bc spec. In that
2827 // case, and for strings and comments, the parser will expect more stuff.
2831 size_t prevlen = G.input_buffer.len;
2834 bc_read_line(&G.input_buffer, G.input_fp);
2835 // No more input means EOF
2836 if (G.input_buffer.len <= prevlen + 1) // (we expect +1 for NUL byte)
2839 string = G.input_buffer.v + prevlen;
2842 if (string == G.input_buffer.v || string[-1] != '\\') {
2853 if (c == '/' && *string == '*') {
2858 if (c == '*' && *string == '/') {
2863 if (str != 0 || comment) {
2864 G.input_buffer.len--; // backstep over the trailing NUL byte
2868 // Check for backslash+newline.
2869 // we do not check that last char is '\n' -
2870 // if it is not, then it's EOF, and looping back
2871 // to bc_read_line() will detect it:
2873 if (string >= G.input_buffer.v && *string == '\\') {
2874 G.input_buffer.len--;
2881 l->buf = G.input_buffer.v;
2883 // bb_error_msg("G.input_buffer.len:%d '%s'", G.input_buffer.len, G.input_buffer.v);
2884 l->len = G.input_buffer.len - 1; // do not include NUL
2889 static BC_STATUS zbc_lex_next(BcLex *l)
2894 if (l->t.last == BC_LEX_EOF) RETURN_STATUS(bc_error("end of file"));
2896 l->line += l->newline;
2897 G.err_line = l->line;
2900 // Loop until failure or we don't have whitespace. This
2901 // is so the parser doesn't get inundated with whitespace.
2902 // Comments are also BC_LEX_WHITESPACE tokens and eaten here.
2903 s = BC_STATUS_SUCCESS;
2905 l->t.t = BC_LEX_EOF;
2906 if (l->i == l->len) {
2908 RETURN_STATUS(BC_STATUS_SUCCESS);
2909 if (!bc_lex_more_input(l)) {
2911 RETURN_STATUS(BC_STATUS_SUCCESS);
2913 // here it's guaranteed that l->i is below l->len
2915 dbg_lex("next string to parse:'%.*s'",
2916 (int)(strchrnul(l->buf + l->i, '\n') - (l->buf + l->i)),
2918 s = zcommon_lex_token(l);
2919 } while (!s && l->t.t == BC_LEX_WHITESPACE);
2920 dbg_lex("l->t.t from string:%d", l->t.t);
2924 #define zbc_lex_next(...) (zbc_lex_next(__VA_ARGS__) COMMA_SUCCESS)
2926 static BC_STATUS zbc_lex_skip_if_at_NLINE(BcLex *l)
2928 if (l->t.t == BC_LEX_NLINE)
2929 RETURN_STATUS(zbc_lex_next(l));
2930 RETURN_STATUS(BC_STATUS_SUCCESS);
2932 #define zbc_lex_skip_if_at_NLINE(...) (zbc_lex_skip_if_at_NLINE(__VA_ARGS__) COMMA_SUCCESS)
2934 static BC_STATUS zbc_lex_next_and_skip_NLINE(BcLex *l)
2937 s = zbc_lex_next(l);
2938 if (s) RETURN_STATUS(s);
2939 // if(cond)<newline>stmt is accepted too (but not 2+ newlines)
2940 s = zbc_lex_skip_if_at_NLINE(l);
2943 #define zbc_lex_next_and_skip_NLINE(...) (zbc_lex_next_and_skip_NLINE(__VA_ARGS__) COMMA_SUCCESS)
2945 static BC_STATUS zbc_lex_text_init(BcLex *l, const char *text)
2949 l->len = strlen(text);
2950 l->t.t = l->t.last = BC_LEX_INVALID;
2951 RETURN_STATUS(zbc_lex_next(l));
2953 #define zbc_lex_text_init(...) (zbc_lex_text_init(__VA_ARGS__) COMMA_SUCCESS)
2956 static BC_STATUS zbc_lex_identifier(BcLex *l)
2960 const char *buf = l->buf + l->i - 1;
2962 for (i = 0; i < ARRAY_SIZE(bc_lex_kws); ++i) {
2963 const char *keyword8 = bc_lex_kws[i].name8;
2965 while (buf[j] != '\0' && buf[j] == keyword8[j]) {
2967 if (j == 8) goto match;
2969 if (keyword8[j] != '\0')
2972 // buf starts with keyword bc_lex_kws[i]
2973 l->t.t = BC_LEX_KEY_1st_keyword + i;
2974 if (!bc_lex_kws_POSIX(i)) {
2975 s = bc_posix_error_fmt("%sthe '%.8s' keyword", "POSIX does not allow ", bc_lex_kws[i].name8);
2976 IF_ERROR_RETURN_POSSIBLE(if (s) RETURN_STATUS(s));
2979 // We minus 1 because the index has already been incremented.
2981 RETURN_STATUS(BC_STATUS_SUCCESS);
2985 s = BC_STATUS_SUCCESS;
2987 if (l->t.v.len > 2) {
2990 // bc: POSIX only allows one character names; the following is bad: 'qwe=1
2992 unsigned len = strchrnul(buf, '\n') - buf;
2993 s = bc_posix_error_fmt("POSIX only allows one character names; the following is bad: '%.*s'", len, buf);
2998 #define zbc_lex_identifier(...) (zbc_lex_identifier(__VA_ARGS__) COMMA_SUCCESS)
3000 static BC_STATUS zbc_lex_string(BcLex *l)
3002 size_t len, nls = 0, i = l->i;
3005 l->t.t = BC_LEX_STR;
3007 for (c = l->buf[i]; c != 0 && c != '"'; c = l->buf[++i])
3012 RETURN_STATUS(bc_error("string end could not be found"));
3016 // This check makes sense only if size_t is (much) larger than BC_MAX_STRING.
3017 if (SIZE_MAX > (BC_MAX_STRING | 0xff)) {
3018 if (len > BC_MAX_STRING)
3019 RETURN_STATUS(bc_error("string too long: must be [1,"BC_MAX_STRING_STR"]"));
3021 bc_vec_string(&l->t.v, len, l->buf + l->i);
3025 G.err_line = l->line;
3027 RETURN_STATUS(BC_STATUS_SUCCESS);
3029 #define zbc_lex_string(...) (zbc_lex_string(__VA_ARGS__) COMMA_SUCCESS)
3031 static void bc_lex_assign(BcLex *l, unsigned with_and_without)
3033 if (l->buf[l->i] == '=') {
3035 with_and_without >>= 8; // store "with" value
3036 } // else store "without" value
3037 l->t.t = (with_and_without & 0xff);
3039 #define bc_lex_assign(l, with, without) \
3040 bc_lex_assign(l, ((with)<<8)|(without))
3042 static BC_STATUS zbc_lex_comment(BcLex *l)
3045 const char *buf = l->buf;
3047 l->t.t = BC_LEX_WHITESPACE;
3048 i = l->i; /* here buf[l->i] is the '*' of opening comment delimiter */
3060 RETURN_STATUS(bc_error("comment end could not be found"));
3067 G.err_line = l->line;
3069 RETURN_STATUS(BC_STATUS_SUCCESS);
3071 #define zbc_lex_comment(...) (zbc_lex_comment(__VA_ARGS__) COMMA_SUCCESS)
3073 static BC_STATUS zbc_lex_token(BcLex *l)
3075 BcStatus s = BC_STATUS_SUCCESS;
3076 char c = l->buf[l->i++], c2;
3078 // This is the workhorse of the lexer.
3080 // case '\0': // probably never reached
3082 // l->t.t = BC_LEX_EOF;
3083 // l->newline = true;
3086 l->t.t = BC_LEX_NLINE;
3094 bc_lex_whitespace(l);
3097 bc_lex_assign(l, BC_LEX_OP_REL_NE, BC_LEX_OP_BOOL_NOT);
3098 if (l->t.t == BC_LEX_OP_BOOL_NOT) {
3099 s = bc_POSIX_does_not_allow_bool_ops_this_is_bad("!");
3100 IF_ERROR_RETURN_POSSIBLE(if (s) RETURN_STATUS(s));
3104 s = zbc_lex_string(l);
3107 s = bc_POSIX_does_not_allow("'#' script comments");
3108 IF_ERROR_RETURN_POSSIBLE(if (s) RETURN_STATUS(s));
3109 bc_lex_lineComment(l);
3112 bc_lex_assign(l, BC_LEX_OP_ASSIGN_MODULUS, BC_LEX_OP_MODULUS);
3117 s = bc_POSIX_does_not_allow_bool_ops_this_is_bad("&&");
3118 IF_ERROR_RETURN_POSSIBLE(if (s) RETURN_STATUS(s));
3120 l->t.t = BC_LEX_OP_BOOL_AND;
3122 l->t.t = BC_LEX_INVALID;
3123 s = bc_error_bad_character('&');
3128 l->t.t = (BcLexType)(c - '(' + BC_LEX_LPAREN);
3131 bc_lex_assign(l, BC_LEX_OP_ASSIGN_MULTIPLY, BC_LEX_OP_MULTIPLY);
3137 l->t.t = BC_LEX_OP_INC;
3139 bc_lex_assign(l, BC_LEX_OP_ASSIGN_PLUS, BC_LEX_OP_PLUS);
3142 l->t.t = BC_LEX_COMMA;
3148 l->t.t = BC_LEX_OP_DEC;
3150 bc_lex_assign(l, BC_LEX_OP_ASSIGN_MINUS, BC_LEX_OP_MINUS);
3153 if (isdigit(l->buf[l->i]))
3154 s = zbc_lex_number(l, c);
3156 l->t.t = BC_LEX_KEY_LAST;
3157 s = bc_POSIX_does_not_allow("a period ('.') as a shortcut for the last result");
3163 s = zbc_lex_comment(l);
3165 bc_lex_assign(l, BC_LEX_OP_ASSIGN_DIVIDE, BC_LEX_OP_DIVIDE);
3183 s = zbc_lex_number(l, c);
3186 l->t.t = BC_LEX_SCOLON;
3189 bc_lex_assign(l, BC_LEX_OP_REL_LE, BC_LEX_OP_REL_LT);
3192 bc_lex_assign(l, BC_LEX_OP_REL_EQ, BC_LEX_OP_ASSIGN);
3195 bc_lex_assign(l, BC_LEX_OP_REL_GE, BC_LEX_OP_REL_GT);
3199 l->t.t = (BcLexType)(c - '[' + BC_LEX_LBRACKET);
3202 if (l->buf[l->i] == '\n') {
3203 l->t.t = BC_LEX_WHITESPACE;
3206 s = bc_error_bad_character(c);
3209 bc_lex_assign(l, BC_LEX_OP_ASSIGN_POWER, BC_LEX_OP_POWER);
3237 s = zbc_lex_identifier(l);
3241 l->t.t = (BcLexType)(c - '{' + BC_LEX_LBRACE);
3246 s = bc_POSIX_does_not_allow_bool_ops_this_is_bad("||");
3247 IF_ERROR_RETURN_POSSIBLE(if (s) RETURN_STATUS(s));
3249 l->t.t = BC_LEX_OP_BOOL_OR;
3251 l->t.t = BC_LEX_INVALID;
3252 s = bc_error_bad_character(c);
3256 l->t.t = BC_LEX_INVALID;
3257 s = bc_error_bad_character(c);
3266 static BC_STATUS zdc_lex_register(BcLex *l)
3268 if (isspace(l->buf[l->i - 1])) {
3269 bc_lex_whitespace(l);
3272 RETURN_STATUS(bc_error("extended register"));
3276 bc_vec_pop_all(&l->t.v);
3277 bc_vec_push(&l->t.v, &l->buf[l->i - 1]);
3278 bc_vec_pushZeroByte(&l->t.v);
3279 l->t.t = BC_LEX_NAME;
3282 RETURN_STATUS(BC_STATUS_SUCCESS);
3284 #define zdc_lex_register(...) (zdc_lex_register(__VA_ARGS__) COMMA_SUCCESS)
3286 static BC_STATUS zdc_lex_string(BcLex *l)
3288 size_t depth = 1, nls = 0, i = l->i;
3291 l->t.t = BC_LEX_STR;
3292 bc_vec_pop_all(&l->t.v);
3294 for (c = l->buf[i]; c != 0 && depth; c = l->buf[++i]) {
3296 depth += (c == '[' && (i == l->i || l->buf[i - 1] != '\\'));
3297 depth -= (c == ']' && (i == l->i || l->buf[i - 1] != '\\'));
3300 if (depth) bc_vec_push(&l->t.v, &c);
3305 RETURN_STATUS(bc_error("string end could not be found"));
3308 bc_vec_pushZeroByte(&l->t.v);
3309 // This check makes sense only if size_t is (much) larger than BC_MAX_STRING.
3310 if (SIZE_MAX > (BC_MAX_STRING | 0xff)) {
3311 if (i - l->i > BC_MAX_STRING)
3312 RETURN_STATUS(bc_error("string too long: must be [1,"BC_MAX_STRING_STR"]"));
3317 G.err_line = l->line;
3319 RETURN_STATUS(BC_STATUS_SUCCESS);
3321 #define zdc_lex_string(...) (zdc_lex_string(__VA_ARGS__) COMMA_SUCCESS)
3323 static BC_STATUS zdc_lex_token(BcLex *l)
3325 static const //BcLexType - should be this type, but narrower type saves size:
3328 BC_LEX_OP_REL_EQ, BC_LEX_OP_REL_LE, BC_LEX_OP_REL_GE, BC_LEX_OP_REL_NE,
3329 BC_LEX_OP_REL_LT, BC_LEX_OP_REL_GT, BC_LEX_SCOLON, BC_LEX_COLON,
3330 BC_LEX_ELSE, BC_LEX_LOAD, BC_LEX_LOAD_POP, BC_LEX_OP_ASSIGN,
3333 static const //BcLexType - should be this type
3337 BC_LEX_OP_MODULUS, BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_LPAREN,
3339 BC_LEX_INVALID, BC_LEX_OP_MULTIPLY, BC_LEX_OP_PLUS, BC_LEX_INVALID,
3341 BC_LEX_OP_MINUS, BC_LEX_INVALID, BC_LEX_OP_DIVIDE,
3343 BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID,
3344 BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID,
3345 BC_LEX_INVALID, BC_LEX_INVALID,
3347 BC_LEX_COLON, BC_LEX_SCOLON, BC_LEX_OP_REL_GT, BC_LEX_OP_REL_EQ,
3348 BC_LEX_OP_REL_LT, BC_LEX_KEY_READ, BC_LEX_INVALID,
3350 BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID,
3351 BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_EQ_NO_REG, BC_LEX_INVALID,
3353 BC_LEX_KEY_IBASE, BC_LEX_INVALID, BC_LEX_KEY_SCALE, BC_LEX_LOAD_POP,
3354 BC_LEX_INVALID, BC_LEX_OP_BOOL_NOT, BC_LEX_KEY_OBASE, BC_LEX_PRINT_STREAM,
3356 BC_LEX_NQUIT, BC_LEX_POP, BC_LEX_STORE_PUSH, BC_LEX_INVALID, BC_LEX_INVALID,
3357 BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_SCALE_FACTOR, BC_LEX_INVALID,
3359 BC_LEX_KEY_LENGTH, BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID,
3361 BC_LEX_OP_POWER, BC_LEX_NEG, BC_LEX_INVALID,
3363 BC_LEX_ASCIIFY, BC_LEX_INVALID, BC_LEX_CLEAR_STACK, BC_LEX_DUPLICATE,
3364 BC_LEX_ELSE, BC_LEX_PRINT_STACK, BC_LEX_INVALID, BC_LEX_INVALID,
3366 BC_LEX_STORE_IBASE, BC_LEX_INVALID, BC_LEX_STORE_SCALE, BC_LEX_LOAD,
3367 BC_LEX_INVALID, BC_LEX_PRINT_POP, BC_LEX_STORE_OBASE, BC_LEX_KEY_PRINT,
3369 BC_LEX_KEY_QUIT, BC_LEX_SWAP, BC_LEX_OP_ASSIGN, BC_LEX_INVALID,
3370 BC_LEX_INVALID, BC_LEX_KEY_SQRT, BC_LEX_INVALID, BC_LEX_EXECUTE,
3372 BC_LEX_INVALID, BC_LEX_STACK_LEVEL,
3374 BC_LEX_LBRACE, BC_LEX_OP_MODEXP, BC_LEX_INVALID, BC_LEX_OP_DIVMOD,
3377 BcStatus s = BC_STATUS_SUCCESS;
3378 char c = l->buf[l->i++], c2;
3381 for (i = 0; i < ARRAY_SIZE(dc_lex_regs); ++i) {
3382 if (l->t.last == dc_lex_regs[i])
3383 RETURN_STATUS(zdc_lex_register(l));
3386 if (c >= '%' && c <= '~'
3387 && (l->t.t = dc_lex_tokens[c - '%']) != BC_LEX_INVALID
3392 // This is the workhorse of the lexer.
3394 // case '\0': // probably never reached
3395 // l->t.t = BC_LEX_EOF;
3403 l->newline = (c == '\n');
3404 bc_lex_whitespace(l);
3409 l->t.t = BC_LEX_OP_REL_NE;
3411 l->t.t = BC_LEX_OP_REL_LE;
3413 l->t.t = BC_LEX_OP_REL_GE;
3415 RETURN_STATUS(bc_error_bad_character(c));
3419 bc_lex_lineComment(l);
3422 if (isdigit(l->buf[l->i]))
3423 s = zbc_lex_number(l, c);
3425 s = bc_error_bad_character(c);
3443 s = zbc_lex_number(l, c);
3446 s = zdc_lex_string(l);
3449 l->t.t = BC_LEX_INVALID;
3450 s = bc_error_bad_character(c);
3458 static void bc_program_addFunc(char *name, size_t *idx);
3460 static void bc_parse_addFunc(BcParse *p, char *name, size_t *idx)
3462 bc_program_addFunc(name, idx);
3463 p->func = bc_program_func(p->fidx);
3466 static void bc_parse_push(BcParse *p, char i)
3468 dbg_lex("%s:%d pushing opcode %d", __func__, __LINE__, i);
3469 bc_vec_pushByte(&p->func->code, i);
3472 static void bc_parse_pushName(BcParse *p, char *name)
3475 bc_parse_push(p, *name++);
3476 bc_parse_push(p, BC_PARSE_STREND);
3479 static void bc_parse_pushIndex(BcParse *p, size_t idx)
3484 dbg_lex("%s:%d pushing index %zd", __func__, __LINE__, idx);
3485 mask = ((size_t)0xff) << (sizeof(idx) * 8 - 8);
3488 if (idx & mask) break;
3493 bc_parse_push(p, amt);
3496 bc_parse_push(p, (unsigned char)idx);
3501 static void bc_parse_pushJUMP(BcParse *p, size_t idx)
3503 bc_parse_push(p, BC_INST_JUMP);
3504 bc_parse_pushIndex(p, idx);
3507 static void bc_parse_pushJUMP_ZERO(BcParse *p, size_t idx)
3509 bc_parse_push(p, BC_INST_JUMP_ZERO);
3510 bc_parse_pushIndex(p, idx);
3513 static void bc_parse_number(BcParse *p)
3515 char *num = xstrdup(p->l.t.v.v);
3516 size_t idx = G.prog.consts.len;
3518 bc_vec_push(&G.prog.consts, &num);
3520 bc_parse_push(p, BC_INST_NUM);
3521 bc_parse_pushIndex(p, idx);
3524 IF_BC(static BC_STATUS zbc_parse_stmt_or_funcdef(BcParse *p);)
3525 IF_DC(static BC_STATUS zdc_parse_parse(BcParse *p);)
3527 // "Parse" half of "parse,execute,repeat" main loop
3528 static BC_STATUS zcommon_parse(BcParse *p)
3531 // FIXME: "eating" of stmt delemiters is coded inconsistently
3532 // (sometimes zbc_parse_stmt() eats the delimiter, sometimes don't),
3533 // which causes bugs such as "print 1 print 2" erroneously accepted,
3534 // or "print 1 else 2" detecting parse error only after executing
3536 IF_BC(RETURN_STATUS(zbc_parse_stmt_or_funcdef(p));)
3538 IF_DC(RETURN_STATUS(zdc_parse_parse(p));)
3540 #define zcommon_parse(...) (zcommon_parse(__VA_ARGS__) COMMA_SUCCESS)
3542 static BC_STATUS zbc_parse_text_init(BcParse *p, const char *text)
3544 p->func = bc_program_func(p->fidx);
3546 RETURN_STATUS(zbc_lex_text_init(&p->l, text));
3548 #define zbc_parse_text_init(...) (zbc_parse_text_init(__VA_ARGS__) COMMA_SUCCESS)
3550 // Called when parsing or execution detects a failure,
3551 // resets execution structures.
3552 static void bc_program_reset(void)
3557 bc_vec_npop(&G.prog.stack, G.prog.stack.len - 1);
3558 bc_vec_pop_all(&G.prog.results);
3560 f = bc_program_func(0);
3561 ip = bc_vec_top(&G.prog.stack);
3562 ip->idx = f->code.len;
3565 #define bc_parse_updateFunc(p, f) \
3566 ((p)->func = bc_program_func((p)->fidx = (f)))
3568 // Called when zbc/zdc_parse_parse() detects a failure,
3569 // resets parsing structures.
3570 static void bc_parse_reset(BcParse *p)
3572 if (p->fidx != BC_PROG_MAIN) {
3573 p->func->nparams = 0;
3574 bc_vec_pop_all(&p->func->code);
3575 bc_vec_pop_all(&p->func->autos);
3576 bc_vec_pop_all(&p->func->labels);
3578 bc_parse_updateFunc(p, BC_PROG_MAIN);
3582 p->l.t.t = BC_LEX_EOF;
3584 bc_vec_pop_all(&p->exits);
3585 bc_vec_pop_all(&p->conds);
3586 bc_vec_pop_all(&p->ops);
3591 static void bc_parse_free(BcParse *p)
3593 bc_vec_free(&p->exits);
3594 bc_vec_free(&p->conds);
3595 bc_vec_free(&p->ops);
3599 static void bc_parse_create(BcParse *p, size_t func)
3601 memset(p, 0, sizeof(BcParse));
3604 bc_vec_init(&p->exits, sizeof(size_t), NULL);
3605 bc_vec_init(&p->conds, sizeof(size_t), NULL);
3606 bc_vec_init(&p->ops, sizeof(BcLexType), NULL);
3608 bc_parse_updateFunc(p, func);
3613 #define BC_PARSE_TOP_OP(p) (*((BcLexType *) bc_vec_top(&(p)->ops)))
3614 #define BC_PARSE_LEAF(p, rparen) \
3615 (((p) >= BC_INST_NUM && (p) <= BC_INST_SQRT) || (rparen) || \
3616 (p) == BC_INST_INC_POST || (p) == BC_INST_DEC_POST)
3618 // We can calculate the conversion between tokens and exprs by subtracting the
3619 // position of the first operator in the lex enum and adding the position of the
3620 // first in the expr enum. Note: This only works for binary operators.
3621 #define BC_TOKEN_2_INST(t) ((char) ((t) - BC_LEX_NEG + BC_INST_NEG))
3623 static BcStatus bc_parse_expr_empty_ok(BcParse *p, uint8_t flags);
3625 static BC_STATUS zbc_parse_expr(BcParse *p, uint8_t flags)
3629 s = bc_parse_expr_empty_ok(p, flags);
3630 if (s == BC_STATUS_PARSE_EMPTY_EXP)
3631 RETURN_STATUS(bc_error("empty expression"));
3634 #define zbc_parse_expr(...) (zbc_parse_expr(__VA_ARGS__) COMMA_SUCCESS)
3636 static BC_STATUS zbc_parse_stmt_possibly_auto(BcParse *p, bool auto_allowed);
3637 #define zbc_parse_stmt_possibly_auto(...) (zbc_parse_stmt_possibly_auto(__VA_ARGS__) COMMA_SUCCESS)
3639 static BC_STATUS zbc_parse_stmt(BcParse *p)
3641 RETURN_STATUS(zbc_parse_stmt_possibly_auto(p, false));
3643 #define zbc_parse_stmt(...) (zbc_parse_stmt(__VA_ARGS__) COMMA_SUCCESS)
3645 static BC_STATUS zbc_parse_stmt_allow_NLINE_before(BcParse *p, const char *after_X)
3647 // "if(cond)<newline>stmt" is accepted too, but not 2+ newlines.
3648 // Same for "else", "while()", "for()".
3649 BcStatus s = zbc_lex_next_and_skip_NLINE(&p->l);
3650 if (s) RETURN_STATUS(s);
3651 if (p->l.t.t == BC_LEX_NLINE)
3652 RETURN_STATUS(bc_error_fmt("no statement after '%s'", after_X));
3654 RETURN_STATUS(zbc_parse_stmt(p));
3656 #define zbc_parse_stmt_allow_NLINE_before(...) (zbc_parse_stmt_allow_NLINE_before(__VA_ARGS__) COMMA_SUCCESS)
3658 static void bc_parse_operator(BcParse *p, BcLexType type, size_t start,
3661 char l, r = bc_parse_op_PREC(type - BC_LEX_OP_INC);
3662 bool left = bc_parse_op_LEFT(type - BC_LEX_OP_INC);
3664 while (p->ops.len > start) {
3665 BcLexType t = BC_PARSE_TOP_OP(p);
3666 if (t == BC_LEX_LPAREN) break;
3668 l = bc_parse_op_PREC(t - BC_LEX_OP_INC);
3669 if (l >= r && (l != r || !left)) break;
3671 bc_parse_push(p, BC_TOKEN_2_INST(t));
3672 bc_vec_pop(&p->ops);
3673 *nexprs -= (t != BC_LEX_OP_BOOL_NOT && t != BC_LEX_NEG);
3676 bc_vec_push(&p->ops, &type);
3679 static BC_STATUS zbc_parse_rightParen(BcParse *p, size_t ops_bgn, size_t *nexs)
3683 if (p->ops.len <= ops_bgn)
3684 RETURN_STATUS(bc_error_bad_expression());
3685 top = BC_PARSE_TOP_OP(p);
3687 while (top != BC_LEX_LPAREN) {
3688 bc_parse_push(p, BC_TOKEN_2_INST(top));
3690 bc_vec_pop(&p->ops);
3691 *nexs -= top != BC_LEX_OP_BOOL_NOT && top != BC_LEX_NEG;
3693 if (p->ops.len <= ops_bgn)
3694 RETURN_STATUS(bc_error_bad_expression());
3695 top = BC_PARSE_TOP_OP(p);
3698 bc_vec_pop(&p->ops);
3700 RETURN_STATUS(zbc_lex_next(&p->l));
3702 #define zbc_parse_rightParen(...) (zbc_parse_rightParen(__VA_ARGS__) COMMA_SUCCESS)
3704 static BC_STATUS zbc_parse_params(BcParse *p, uint8_t flags)
3709 dbg_lex("%s:%d p->l.t.t:%d", __func__, __LINE__, p->l.t.t);
3710 flags = (flags & ~(BC_PARSE_PRINT | BC_PARSE_REL)) | BC_PARSE_ARRAY;
3712 s = zbc_lex_next(&p->l);
3713 if (s) RETURN_STATUS(s);
3716 if (p->l.t.t != BC_LEX_RPAREN) {
3718 s = zbc_parse_expr(p, flags);
3719 if (s) RETURN_STATUS(s);
3721 if (p->l.t.t != BC_LEX_COMMA) {
3722 if (p->l.t.t == BC_LEX_RPAREN)
3724 RETURN_STATUS(bc_error_bad_token());
3726 s = zbc_lex_next(&p->l);
3727 if (s) RETURN_STATUS(s);
3731 bc_parse_push(p, BC_INST_CALL);
3732 bc_parse_pushIndex(p, nparams);
3734 RETURN_STATUS(BC_STATUS_SUCCESS);
3736 #define zbc_parse_params(...) (zbc_parse_params(__VA_ARGS__) COMMA_SUCCESS)
3738 static BC_STATUS zbc_parse_call(BcParse *p, char *name, uint8_t flags)
3741 BcId entry, *entry_ptr;
3746 s = zbc_parse_params(p, flags);
3749 if (p->l.t.t != BC_LEX_RPAREN) {
3750 s = bc_error_bad_token();
3754 idx = bc_map_index(&G.prog.fn_map, &entry);
3756 if (idx == BC_VEC_INVALID_IDX) {
3757 name = xstrdup(entry.name);
3758 bc_parse_addFunc(p, name, &idx);
3759 idx = bc_map_index(&G.prog.fn_map, &entry);
3764 entry_ptr = bc_vec_item(&G.prog.fn_map, idx);
3765 bc_parse_pushIndex(p, entry_ptr->idx);
3767 RETURN_STATUS(zbc_lex_next(&p->l));
3773 #define zbc_parse_call(...) (zbc_parse_call(__VA_ARGS__) COMMA_SUCCESS)
3775 static BC_STATUS zbc_parse_name(BcParse *p, BcInst *type, uint8_t flags)
3780 name = xstrdup(p->l.t.v.v);
3781 s = zbc_lex_next(&p->l);
3784 if (p->l.t.t == BC_LEX_LBRACKET) {
3785 s = zbc_lex_next(&p->l);
3788 if (p->l.t.t == BC_LEX_RBRACKET) {
3789 if (!(flags & BC_PARSE_ARRAY)) {
3790 s = bc_error_bad_expression();
3793 *type = BC_INST_ARRAY;
3795 *type = BC_INST_ARRAY_ELEM;
3796 flags &= ~(BC_PARSE_PRINT | BC_PARSE_REL);
3797 s = zbc_parse_expr(p, flags);
3800 s = zbc_lex_next(&p->l);
3802 bc_parse_push(p, *type);
3803 bc_parse_pushName(p, name);
3806 else if (p->l.t.t == BC_LEX_LPAREN) {
3807 if (flags & BC_PARSE_NOCALL) {
3808 s = bc_error_bad_token();
3811 *type = BC_INST_CALL;
3812 s = zbc_parse_call(p, name, flags);
3814 *type = BC_INST_VAR;
3815 bc_parse_push(p, BC_INST_VAR);
3816 bc_parse_pushName(p, name);
3826 #define zbc_parse_name(...) (zbc_parse_name(__VA_ARGS__) COMMA_SUCCESS)
3828 static BC_STATUS zbc_parse_read(BcParse *p)
3832 s = zbc_lex_next(&p->l);
3833 if (s) RETURN_STATUS(s);
3834 if (p->l.t.t != BC_LEX_LPAREN) RETURN_STATUS(bc_error_bad_token());
3836 s = zbc_lex_next(&p->l);
3837 if (s) RETURN_STATUS(s);
3838 if (p->l.t.t != BC_LEX_RPAREN) RETURN_STATUS(bc_error_bad_token());
3840 bc_parse_push(p, BC_INST_READ);
3842 RETURN_STATUS(zbc_lex_next(&p->l));
3844 #define zbc_parse_read(...) (zbc_parse_read(__VA_ARGS__) COMMA_SUCCESS)
3846 static BC_STATUS zbc_parse_builtin(BcParse *p, BcLexType type, uint8_t flags,
3851 s = zbc_lex_next(&p->l);
3852 if (s) RETURN_STATUS(s);
3853 if (p->l.t.t != BC_LEX_LPAREN) RETURN_STATUS(bc_error_bad_token());
3855 flags = (flags & ~(BC_PARSE_PRINT | BC_PARSE_REL)) | BC_PARSE_ARRAY;
3857 s = zbc_lex_next(&p->l);
3858 if (s) RETURN_STATUS(s);
3860 s = zbc_parse_expr(p, flags);
3861 if (s) RETURN_STATUS(s);
3863 if (p->l.t.t != BC_LEX_RPAREN) RETURN_STATUS(bc_error_bad_token());
3865 *prev = (type == BC_LEX_KEY_LENGTH) ? BC_INST_LENGTH : BC_INST_SQRT;
3866 bc_parse_push(p, *prev);
3868 RETURN_STATUS(zbc_lex_next(&p->l));
3870 #define zbc_parse_builtin(...) (zbc_parse_builtin(__VA_ARGS__) COMMA_SUCCESS)
3872 static BC_STATUS zbc_parse_scale(BcParse *p, BcInst *type, uint8_t flags)
3876 s = zbc_lex_next(&p->l);
3877 if (s) RETURN_STATUS(s);
3879 if (p->l.t.t != BC_LEX_LPAREN) {
3880 *type = BC_INST_SCALE;
3881 bc_parse_push(p, BC_INST_SCALE);
3882 RETURN_STATUS(BC_STATUS_SUCCESS);
3885 *type = BC_INST_SCALE_FUNC;
3886 flags &= ~(BC_PARSE_PRINT | BC_PARSE_REL);
3888 s = zbc_lex_next(&p->l);
3889 if (s) RETURN_STATUS(s);
3891 s = zbc_parse_expr(p, flags);
3892 if (s) RETURN_STATUS(s);
3893 if (p->l.t.t != BC_LEX_RPAREN)
3894 RETURN_STATUS(bc_error_bad_token());
3895 bc_parse_push(p, BC_INST_SCALE_FUNC);
3897 RETURN_STATUS(zbc_lex_next(&p->l));
3899 #define zbc_parse_scale(...) (zbc_parse_scale(__VA_ARGS__) COMMA_SUCCESS)
3901 static BC_STATUS zbc_parse_incdec(BcParse *p, BcInst *prev, bool *paren_expr,
3902 size_t *nexprs, uint8_t flags)
3907 BcInst etype = *prev;
3909 if (etype == BC_INST_VAR || etype == BC_INST_ARRAY_ELEM ||
3910 etype == BC_INST_SCALE || etype == BC_INST_LAST ||
3911 etype == BC_INST_IBASE || etype == BC_INST_OBASE)
3913 *prev = inst = BC_INST_INC_POST + (p->l.t.t != BC_LEX_OP_INC);
3914 bc_parse_push(p, inst);
3915 s = zbc_lex_next(&p->l);
3918 *prev = inst = BC_INST_INC_PRE + (p->l.t.t != BC_LEX_OP_INC);
3921 s = zbc_lex_next(&p->l);
3922 if (s) RETURN_STATUS(s);
3925 // Because we parse the next part of the expression
3926 // right here, we need to increment this.
3927 *nexprs = *nexprs + 1;
3931 s = zbc_parse_name(p, prev, flags | BC_PARSE_NOCALL);
3933 case BC_LEX_KEY_IBASE:
3934 case BC_LEX_KEY_LAST:
3935 case BC_LEX_KEY_OBASE:
3936 bc_parse_push(p, type - BC_LEX_KEY_IBASE + BC_INST_IBASE);
3937 s = zbc_lex_next(&p->l);
3939 case BC_LEX_KEY_SCALE:
3940 s = zbc_lex_next(&p->l);
3941 if (s) RETURN_STATUS(s);
3942 if (p->l.t.t == BC_LEX_LPAREN)
3943 s = bc_error_bad_token();
3945 bc_parse_push(p, BC_INST_SCALE);
3948 s = bc_error_bad_token();
3952 if (!s) bc_parse_push(p, inst);
3957 #define zbc_parse_incdec(...) (zbc_parse_incdec(__VA_ARGS__) COMMA_SUCCESS)
3959 static BC_STATUS zbc_parse_minus(BcParse *p, BcInst *prev, size_t ops_bgn,
3960 bool rparen, size_t *nexprs)
3964 BcInst etype = *prev;
3966 s = zbc_lex_next(&p->l);
3967 if (s) RETURN_STATUS(s);
3969 type = rparen || etype == BC_INST_INC_POST || etype == BC_INST_DEC_POST ||
3970 (etype >= BC_INST_NUM && etype <= BC_INST_SQRT) ?
3973 *prev = BC_TOKEN_2_INST(type);
3975 // We can just push onto the op stack because this is the largest
3976 // precedence operator that gets pushed. Inc/dec does not.
3977 if (type != BC_LEX_OP_MINUS)
3978 bc_vec_push(&p->ops, &type);
3980 bc_parse_operator(p, type, ops_bgn, nexprs);
3984 #define zbc_parse_minus(...) (zbc_parse_minus(__VA_ARGS__) COMMA_SUCCESS)
3986 static BC_STATUS zbc_parse_string(BcParse *p, char inst)
3988 char *str = xstrdup(p->l.t.v.v);
3990 bc_parse_push(p, BC_INST_STR);
3991 bc_parse_pushIndex(p, G.prog.strs.len);
3992 bc_vec_push(&G.prog.strs, &str);
3993 bc_parse_push(p, inst);
3995 RETURN_STATUS(zbc_lex_next(&p->l));
3997 #define zbc_parse_string(...) (zbc_parse_string(__VA_ARGS__) COMMA_SUCCESS)
3999 static BC_STATUS zbc_parse_print(BcParse *p)
4005 s = zbc_lex_next(&p->l);
4006 if (s) RETURN_STATUS(s);
4008 if (type == BC_LEX_STR) {
4009 s = zbc_parse_string(p, BC_INST_PRINT_POP);
4011 s = zbc_parse_expr(p, 0);
4012 bc_parse_push(p, BC_INST_PRINT_POP);
4014 if (s) RETURN_STATUS(s);
4015 if (p->l.t.t != BC_LEX_COMMA)
4021 #define zbc_parse_print(...) (zbc_parse_print(__VA_ARGS__) COMMA_SUCCESS)
4023 static BC_STATUS zbc_parse_return(BcParse *p)
4028 dbg_lex_enter("%s:%d entered", __func__, __LINE__);
4029 s = zbc_lex_next(&p->l);
4030 if (s) RETURN_STATUS(s);
4033 if (t == BC_LEX_NLINE || t == BC_LEX_SCOLON)
4034 bc_parse_push(p, BC_INST_RET0);
4036 bool paren = (t == BC_LEX_LPAREN);
4037 s = bc_parse_expr_empty_ok(p, 0);
4038 if (s == BC_STATUS_PARSE_EMPTY_EXP) {
4039 bc_parse_push(p, BC_INST_RET0);
4040 s = zbc_lex_next(&p->l);
4042 if (s) RETURN_STATUS(s);
4044 if (!paren || p->l.t.last != BC_LEX_RPAREN) {
4045 s = bc_POSIX_requires("parentheses around return expressions");
4046 IF_ERROR_RETURN_POSSIBLE(if (s) RETURN_STATUS(s));
4049 bc_parse_push(p, BC_INST_RET);
4052 dbg_lex_done("%s:%d done", __func__, __LINE__);
4055 #define zbc_parse_return(...) (zbc_parse_return(__VA_ARGS__) COMMA_SUCCESS)
4057 static void rewrite_label_to_current(BcParse *p, size_t idx)
4059 size_t *label = bc_vec_item(&p->func->labels, idx);
4060 *label = p->func->code.len;
4063 static BC_STATUS zbc_parse_if(BcParse *p)
4068 dbg_lex_enter("%s:%d entered", __func__, __LINE__);
4069 s = zbc_lex_next(&p->l);
4070 if (s) RETURN_STATUS(s);
4071 if (p->l.t.t != BC_LEX_LPAREN) RETURN_STATUS(bc_error_bad_token());
4073 s = zbc_lex_next(&p->l);
4074 if (s) RETURN_STATUS(s);
4075 s = zbc_parse_expr(p, BC_PARSE_REL);
4076 if (s) RETURN_STATUS(s);
4078 if (p->l.t.t != BC_LEX_RPAREN) RETURN_STATUS(bc_error_bad_token());
4080 ip_idx = p->func->labels.len;
4081 bc_parse_pushJUMP_ZERO(p, ip_idx);
4082 bc_vec_push(&p->func->labels, &ip_idx);
4084 s = zbc_parse_stmt_allow_NLINE_before(p, STRING_if);
4085 if (s) RETURN_STATUS(s);
4087 dbg_lex("%s:%d in if after stmt: p->l.t.t:%d", __func__, __LINE__, p->l.t.t);
4088 if (p->l.t.t == BC_LEX_KEY_ELSE) {
4091 ip2_idx = p->func->labels.len;
4093 dbg_lex("%s:%d after if() body: BC_INST_JUMP to %zd", __func__, __LINE__, ip2_idx);
4094 bc_parse_pushJUMP(p, ip2_idx);
4096 dbg_lex("%s:%d rewriting 'if_zero' label to jump to 'else'-> %zd", __func__, __LINE__, p->func->code.len);
4097 rewrite_label_to_current(p, ip_idx);
4099 bc_vec_push(&p->func->labels, &ip2_idx);
4102 s = zbc_parse_stmt_allow_NLINE_before(p, STRING_else);
4103 if (s) RETURN_STATUS(s);
4106 dbg_lex("%s:%d rewriting label to jump after 'if' body-> %zd", __func__, __LINE__, p->func->code.len);
4107 rewrite_label_to_current(p, ip_idx);
4109 dbg_lex_done("%s:%d done", __func__, __LINE__);
4112 #define zbc_parse_if(...) (zbc_parse_if(__VA_ARGS__) COMMA_SUCCESS)
4114 static BC_STATUS zbc_parse_while(BcParse *p)
4120 s = zbc_lex_next(&p->l);
4121 if (s) RETURN_STATUS(s);
4122 if (p->l.t.t != BC_LEX_LPAREN) RETURN_STATUS(bc_error_bad_token());
4123 s = zbc_lex_next(&p->l);
4124 if (s) RETURN_STATUS(s);
4126 cond_idx = p->func->labels.len;
4127 ip_idx = cond_idx + 1;
4129 bc_vec_push(&p->func->labels, &p->func->code.len);
4130 bc_vec_push(&p->conds, &cond_idx);
4132 bc_vec_push(&p->exits, &ip_idx);
4133 bc_vec_push(&p->func->labels, &ip_idx);
4135 s = zbc_parse_expr(p, BC_PARSE_REL);
4136 if (s) RETURN_STATUS(s);
4137 if (p->l.t.t != BC_LEX_RPAREN) RETURN_STATUS(bc_error_bad_token());
4139 bc_parse_pushJUMP_ZERO(p, ip_idx);
4141 s = zbc_parse_stmt_allow_NLINE_before(p, STRING_while);
4142 if (s) RETURN_STATUS(s);
4144 dbg_lex("%s:%d BC_INST_JUMP to %zd", __func__, __LINE__, cond_idx);
4145 bc_parse_pushJUMP(p, cond_idx);
4147 dbg_lex("%s:%d rewriting label-> %zd", __func__, __LINE__, p->func->code.len);
4148 rewrite_label_to_current(p, ip_idx);
4150 bc_vec_pop(&p->exits);
4151 bc_vec_pop(&p->conds);
4155 #define zbc_parse_while(...) (zbc_parse_while(__VA_ARGS__) COMMA_SUCCESS)
4157 static BC_STATUS zbc_parse_for(BcParse *p)
4160 size_t cond_idx, exit_idx, body_idx, update_idx;
4162 dbg_lex("%s:%d p->l.t.t:%d", __func__, __LINE__, p->l.t.t);
4163 s = zbc_lex_next(&p->l);
4164 if (s) RETURN_STATUS(s);
4165 if (p->l.t.t != BC_LEX_LPAREN) RETURN_STATUS(bc_error_bad_token());
4166 s = zbc_lex_next(&p->l);
4167 if (s) RETURN_STATUS(s);
4169 if (p->l.t.t != BC_LEX_SCOLON)
4170 s = zbc_parse_expr(p, 0);
4172 s = bc_POSIX_does_not_allow_empty_X_expression_in_for("init");
4174 if (s) RETURN_STATUS(s);
4175 if (p->l.t.t != BC_LEX_SCOLON) RETURN_STATUS(bc_error_bad_token());
4176 s = zbc_lex_next(&p->l);
4177 if (s) RETURN_STATUS(s);
4179 cond_idx = p->func->labels.len;
4180 update_idx = cond_idx + 1;
4181 body_idx = update_idx + 1;
4182 exit_idx = body_idx + 1;
4184 bc_vec_push(&p->func->labels, &p->func->code.len);
4186 if (p->l.t.t != BC_LEX_SCOLON)
4187 s = zbc_parse_expr(p, BC_PARSE_REL);
4189 s = bc_POSIX_does_not_allow_empty_X_expression_in_for("condition");
4191 if (s) RETURN_STATUS(s);
4192 if (p->l.t.t != BC_LEX_SCOLON) RETURN_STATUS(bc_error_bad_token());
4194 s = zbc_lex_next(&p->l);
4195 if (s) RETURN_STATUS(s);
4197 bc_parse_pushJUMP_ZERO(p, exit_idx);
4198 bc_parse_pushJUMP(p, body_idx);
4200 bc_vec_push(&p->conds, &update_idx);
4201 bc_vec_push(&p->func->labels, &p->func->code.len);
4203 if (p->l.t.t != BC_LEX_RPAREN)
4204 s = zbc_parse_expr(p, 0);
4206 s = bc_POSIX_does_not_allow_empty_X_expression_in_for("update");
4208 if (s) RETURN_STATUS(s);
4210 if (p->l.t.t != BC_LEX_RPAREN) RETURN_STATUS(bc_error_bad_token());
4211 bc_parse_pushJUMP(p, cond_idx);
4212 bc_vec_push(&p->func->labels, &p->func->code.len);
4214 bc_vec_push(&p->exits, &exit_idx);
4215 bc_vec_push(&p->func->labels, &exit_idx);
4217 s = zbc_parse_stmt_allow_NLINE_before(p, STRING_for);
4218 if (s) RETURN_STATUS(s);
4220 dbg_lex("%s:%d BC_INST_JUMP to %zd", __func__, __LINE__, update_idx);
4221 bc_parse_pushJUMP(p, update_idx);
4223 dbg_lex("%s:%d rewriting label-> %zd", __func__, __LINE__, p->func->code.len);
4224 rewrite_label_to_current(p, exit_idx);
4226 bc_vec_pop(&p->exits);
4227 bc_vec_pop(&p->conds);
4229 RETURN_STATUS(BC_STATUS_SUCCESS);
4231 #define zbc_parse_for(...) (zbc_parse_for(__VA_ARGS__) COMMA_SUCCESS)
4233 static BC_STATUS zbc_parse_break_or_continue(BcParse *p, BcLexType type)
4238 if (type == BC_LEX_KEY_BREAK) {
4239 if (p->exits.len == 0) // none of the enclosing blocks is a loop
4240 RETURN_STATUS(bc_error_bad_token());
4241 i = *(size_t*)bc_vec_top(&p->exits);
4243 i = *(size_t*)bc_vec_top(&p->conds);
4246 bc_parse_pushJUMP(p, i);
4248 s = zbc_lex_next(&p->l);
4249 if (s) RETURN_STATUS(s);
4251 if (p->l.t.t != BC_LEX_SCOLON && p->l.t.t != BC_LEX_NLINE)
4252 RETURN_STATUS(bc_error_bad_token());
4254 RETURN_STATUS(zbc_lex_next(&p->l));
4256 #define zbc_parse_break_or_continue(...) (zbc_parse_break_or_continue(__VA_ARGS__) COMMA_SUCCESS)
4258 static BC_STATUS zbc_parse_funcdef(BcParse *p)
4261 bool var, comma = false;
4264 dbg_lex_enter("%s:%d entered", __func__, __LINE__);
4265 s = zbc_lex_next(&p->l);
4266 if (s) RETURN_STATUS(s);
4267 if (p->l.t.t != BC_LEX_NAME)
4268 RETURN_STATUS(bc_error("bad function definition"));
4270 name = xstrdup(p->l.t.v.v);
4271 bc_parse_addFunc(p, name, &p->fidx);
4273 s = zbc_lex_next(&p->l);
4274 if (s) RETURN_STATUS(s);
4275 if (p->l.t.t != BC_LEX_LPAREN)
4276 RETURN_STATUS(bc_error("bad function definition"));
4277 s = zbc_lex_next(&p->l);
4278 if (s) RETURN_STATUS(s);
4280 while (p->l.t.t != BC_LEX_RPAREN) {
4281 if (p->l.t.t != BC_LEX_NAME)
4282 RETURN_STATUS(bc_error("bad function definition"));
4286 name = xstrdup(p->l.t.v.v);
4287 s = zbc_lex_next(&p->l);
4290 var = p->l.t.t != BC_LEX_LBRACKET;
4293 s = zbc_lex_next(&p->l);
4296 if (p->l.t.t != BC_LEX_RBRACKET) {
4297 s = bc_error("bad function definition");
4301 s = zbc_lex_next(&p->l);
4305 comma = p->l.t.t == BC_LEX_COMMA;
4307 s = zbc_lex_next(&p->l);
4311 s = zbc_func_insert(p->func, name, var);
4315 if (comma) RETURN_STATUS(bc_error("bad function definition"));
4317 s = zbc_lex_next(&p->l);
4318 if (s) RETURN_STATUS(s);
4320 if (p->l.t.t != BC_LEX_LBRACE)
4321 s = bc_POSIX_requires("the left brace be on the same line as the function header");
4323 // Prevent "define z()<newline>" from being interpreted as function with empty stmt as body
4324 s = zbc_lex_skip_if_at_NLINE(&p->l);
4325 if (s) RETURN_STATUS(s);
4326 //GNU bc requires a {} block even if function body has single stmt, enforce this?
4327 if (p->l.t.t != BC_LEX_LBRACE)
4328 RETURN_STATUS(bc_error("function { body } expected"));
4330 p->in_funcdef++; // to determine whether "return" stmt is allowed, and such
4331 s = zbc_parse_stmt_possibly_auto(p, true);
4333 if (s) RETURN_STATUS(s);
4335 bc_parse_push(p, BC_INST_RET0);
4336 bc_parse_updateFunc(p, BC_PROG_MAIN);
4338 dbg_lex_done("%s:%d done", __func__, __LINE__);
4342 dbg_lex_done("%s:%d done (error)", __func__, __LINE__);
4346 #define zbc_parse_funcdef(...) (zbc_parse_funcdef(__VA_ARGS__) COMMA_SUCCESS)
4348 static BC_STATUS zbc_parse_auto(BcParse *p)
4351 bool comma, var, one;
4354 dbg_lex_enter("%s:%d entered", __func__, __LINE__);
4355 s = zbc_lex_next(&p->l);
4356 if (s) RETURN_STATUS(s);
4359 one = p->l.t.t == BC_LEX_NAME;
4361 while (p->l.t.t == BC_LEX_NAME) {
4362 name = xstrdup(p->l.t.v.v);
4363 s = zbc_lex_next(&p->l);
4366 var = p->l.t.t != BC_LEX_LBRACKET;
4368 s = zbc_lex_next(&p->l);
4371 if (p->l.t.t != BC_LEX_RBRACKET) {
4372 s = bc_error("bad function definition");
4376 s = zbc_lex_next(&p->l);
4380 comma = p->l.t.t == BC_LEX_COMMA;
4382 s = zbc_lex_next(&p->l);
4386 s = zbc_func_insert(p->func, name, var);
4390 if (comma) RETURN_STATUS(bc_error("bad function definition"));
4391 if (!one) RETURN_STATUS(bc_error("no auto variable found"));
4393 if (p->l.t.t != BC_LEX_NLINE && p->l.t.t != BC_LEX_SCOLON)
4394 RETURN_STATUS(bc_error_bad_token());
4396 dbg_lex_done("%s:%d done", __func__, __LINE__);
4397 RETURN_STATUS(zbc_lex_next(&p->l));
4401 dbg_lex_done("%s:%d done (ERROR)", __func__, __LINE__);
4404 #define zbc_parse_auto(...) (zbc_parse_auto(__VA_ARGS__) COMMA_SUCCESS)
4406 #undef zbc_parse_stmt_possibly_auto
4407 static BC_STATUS zbc_parse_stmt_possibly_auto(BcParse *p, bool auto_allowed)
4409 BcStatus s = BC_STATUS_SUCCESS;
4411 dbg_lex_enter("%s:%d entered, p->l.t.t:%d", __func__, __LINE__, p->l.t.t);
4413 if (p->l.t.t == BC_LEX_NLINE) {
4414 dbg_lex_done("%s:%d done (seen BC_LEX_NLINE)", __func__, __LINE__);
4415 RETURN_STATUS(zbc_lex_next(&p->l));
4417 if (p->l.t.t == BC_LEX_SCOLON) {
4418 dbg_lex_done("%s:%d done (seen BC_LEX_SCOLON)", __func__, __LINE__);
4419 RETURN_STATUS(zbc_lex_next(&p->l));
4422 if (p->l.t.t == BC_LEX_LBRACE) {
4423 dbg_lex("%s:%d BC_LEX_LBRACE: (auto_allowed:%d)", __func__, __LINE__, auto_allowed);
4425 s = zbc_lex_next(&p->l);
4426 if (s) RETURN_STATUS(s);
4427 } while (p->l.t.t == BC_LEX_NLINE);
4428 if (auto_allowed && p->l.t.t == BC_LEX_KEY_AUTO) {
4429 dbg_lex("%s:%d calling zbc_parse_auto()", __func__, __LINE__);
4430 s = zbc_parse_auto(p);
4431 if (s) RETURN_STATUS(s);
4433 while (p->l.t.t != BC_LEX_RBRACE) {
4434 dbg_lex("%s:%d block parsing loop", __func__, __LINE__);
4435 s = zbc_parse_stmt(p);
4436 if (s) RETURN_STATUS(s);
4438 s = zbc_lex_next(&p->l);
4439 dbg_lex_done("%s:%d done (seen BC_LEX_RBRACE)", __func__, __LINE__);
4443 dbg_lex("%s:%d p->l.t.t:%d", __func__, __LINE__, p->l.t.t);
4447 case BC_LEX_OP_MINUS:
4448 case BC_LEX_OP_BOOL_NOT:
4452 case BC_LEX_KEY_IBASE:
4453 case BC_LEX_KEY_LAST:
4454 case BC_LEX_KEY_LENGTH:
4455 case BC_LEX_KEY_OBASE:
4456 case BC_LEX_KEY_READ:
4457 case BC_LEX_KEY_SCALE:
4458 case BC_LEX_KEY_SQRT:
4459 s = zbc_parse_expr(p, BC_PARSE_PRINT);
4462 s = zbc_parse_string(p, BC_INST_PRINT_STR);
4464 case BC_LEX_KEY_BREAK:
4465 case BC_LEX_KEY_CONTINUE:
4466 s = zbc_parse_break_or_continue(p, p->l.t.t);
4468 case BC_LEX_KEY_FOR:
4469 s = zbc_parse_for(p);
4471 case BC_LEX_KEY_HALT:
4472 bc_parse_push(p, BC_INST_HALT);
4473 s = zbc_lex_next(&p->l);
4476 s = zbc_parse_if(p);
4478 case BC_LEX_KEY_LIMITS:
4479 // "limits" is a compile-time command,
4480 // the output is produced at _parse time_.
4482 "BC_BASE_MAX = "BC_MAX_OBASE_STR "\n"
4483 "BC_DIM_MAX = "BC_MAX_DIM_STR "\n"
4484 "BC_SCALE_MAX = "BC_MAX_SCALE_STR "\n"
4485 "BC_STRING_MAX = "BC_MAX_STRING_STR"\n"
4486 "BC_NAME_MAX = "BC_MAX_NAME_STR "\n"
4487 "BC_NUM_MAX = "BC_MAX_NUM_STR "\n"
4488 "MAX Exponent = "BC_MAX_EXP_STR "\n"
4489 "Number of vars = "BC_MAX_VARS_STR "\n"
4491 s = zbc_lex_next(&p->l);
4493 case BC_LEX_KEY_PRINT:
4494 s = zbc_parse_print(p);
4496 case BC_LEX_KEY_QUIT:
4497 // "quit" is a compile-time command. For example,
4498 // "if (0 == 1) quit" terminates when parsing the statement,
4499 // not when it is executed
4500 QUIT_OR_RETURN_TO_MAIN;
4501 case BC_LEX_KEY_RETURN:
4503 RETURN_STATUS(bc_error("'return' not in a function"));
4504 s = zbc_parse_return(p);
4506 case BC_LEX_KEY_WHILE:
4507 s = zbc_parse_while(p);
4510 s = bc_error_bad_token();
4514 if (s || G_interrupt) {
4516 s = BC_STATUS_FAILURE;
4519 dbg_lex_done("%s:%d done", __func__, __LINE__);
4522 #define zbc_parse_stmt_possibly_auto(...) (zbc_parse_stmt_possibly_auto(__VA_ARGS__) COMMA_SUCCESS)
4524 static BC_STATUS zbc_parse_stmt_or_funcdef(BcParse *p)
4528 dbg_lex_enter("%s:%d entered", __func__, __LINE__);
4529 if (p->l.t.t == BC_LEX_EOF)
4530 s = bc_error("end of file");
4531 else if (p->l.t.t == BC_LEX_KEY_DEFINE) {
4532 dbg_lex("%s:%d p->l.t.t:BC_LEX_KEY_DEFINE", __func__, __LINE__);
4533 s = zbc_parse_funcdef(p);
4535 dbg_lex("%s:%d p->l.t.t:%d (not BC_LEX_KEY_DEFINE)", __func__, __LINE__, p->l.t.t);
4536 s = zbc_parse_stmt(p);
4539 dbg_lex_done("%s:%d done", __func__, __LINE__);
4542 #define zbc_parse_stmt_or_funcdef(...) (zbc_parse_stmt_or_funcdef(__VA_ARGS__) COMMA_SUCCESS)
4544 // This is not a "z" function: can also return BC_STATUS_PARSE_EMPTY_EXP
4545 static BcStatus bc_parse_expr_empty_ok(BcParse *p, uint8_t flags)
4547 BcStatus s = BC_STATUS_SUCCESS;
4548 BcInst prev = BC_INST_PRINT;
4549 BcLexType top, t = p->l.t.t;
4550 size_t nexprs = 0, ops_bgn = p->ops.len;
4551 unsigned nparens, nrelops;
4552 bool paren_first, paren_expr, rprn, done, get_token, assign, bin_last;
4554 dbg_lex_enter("%s:%d entered", __func__, __LINE__);
4555 paren_first = p->l.t.t == BC_LEX_LPAREN;
4556 nparens = nrelops = 0;
4557 paren_expr = rprn = done = get_token = assign = false;
4560 for (; !G_interrupt && !s && !done && bc_parse_exprs(t); t = p->l.t.t) {
4566 s = zbc_parse_incdec(p, &prev, &paren_expr, &nexprs, flags);
4567 rprn = get_token = bin_last = false;
4571 case BC_LEX_OP_MINUS:
4573 s = zbc_parse_minus(p, &prev, ops_bgn, rprn, &nexprs);
4574 rprn = get_token = false;
4575 bin_last = prev == BC_INST_MINUS;
4579 case BC_LEX_OP_ASSIGN_POWER:
4580 case BC_LEX_OP_ASSIGN_MULTIPLY:
4581 case BC_LEX_OP_ASSIGN_DIVIDE:
4582 case BC_LEX_OP_ASSIGN_MODULUS:
4583 case BC_LEX_OP_ASSIGN_PLUS:
4584 case BC_LEX_OP_ASSIGN_MINUS:
4585 case BC_LEX_OP_ASSIGN:
4587 if (prev != BC_INST_VAR && prev != BC_INST_ARRAY_ELEM &&
4588 prev != BC_INST_SCALE && prev != BC_INST_IBASE &&
4589 prev != BC_INST_OBASE && prev != BC_INST_LAST)
4591 s = bc_error("bad assignment:"
4592 " left side must be variable"
4594 ); // note: shared string
4599 case BC_LEX_OP_POWER:
4600 case BC_LEX_OP_MULTIPLY:
4601 case BC_LEX_OP_DIVIDE:
4602 case BC_LEX_OP_MODULUS:
4603 case BC_LEX_OP_PLUS:
4604 case BC_LEX_OP_REL_EQ:
4605 case BC_LEX_OP_REL_LE:
4606 case BC_LEX_OP_REL_GE:
4607 case BC_LEX_OP_REL_NE:
4608 case BC_LEX_OP_REL_LT:
4609 case BC_LEX_OP_REL_GT:
4610 case BC_LEX_OP_BOOL_NOT:
4611 case BC_LEX_OP_BOOL_OR:
4612 case BC_LEX_OP_BOOL_AND:
4614 if (((t == BC_LEX_OP_BOOL_NOT) != bin_last)
4615 || (t != BC_LEX_OP_BOOL_NOT && prev == BC_INST_BOOL_NOT)
4617 return bc_error_bad_expression();
4620 nrelops += t >= BC_LEX_OP_REL_EQ && t <= BC_LEX_OP_REL_GT;
4621 prev = BC_TOKEN_2_INST(t);
4622 bc_parse_operator(p, t, ops_bgn, &nexprs);
4623 s = zbc_lex_next(&p->l);
4624 rprn = get_token = false;
4625 bin_last = t != BC_LEX_OP_BOOL_NOT;
4632 if (BC_PARSE_LEAF(prev, rprn))
4633 return bc_error_bad_expression();
4635 paren_expr = rprn = bin_last = false;
4637 bc_vec_push(&p->ops, &t);
4644 if (bin_last || prev == BC_INST_BOOL_NOT)
4645 return bc_error_bad_expression();
4648 s = BC_STATUS_SUCCESS;
4653 else if (!paren_expr) {
4654 dbg_lex_done("%s:%d done (returning EMPTY_EXP)", __func__, __LINE__);
4655 return BC_STATUS_PARSE_EMPTY_EXP;
4659 paren_expr = rprn = true;
4660 get_token = bin_last = false;
4662 s = zbc_parse_rightParen(p, ops_bgn, &nexprs);
4669 if (BC_PARSE_LEAF(prev, rprn))
4670 return bc_error_bad_expression();
4672 rprn = get_token = bin_last = false;
4673 s = zbc_parse_name(p, &prev, flags & ~BC_PARSE_NOCALL);
4681 if (BC_PARSE_LEAF(prev, rprn))
4682 return bc_error_bad_expression();
4686 paren_expr = get_token = true;
4687 rprn = bin_last = false;
4692 case BC_LEX_KEY_IBASE:
4693 case BC_LEX_KEY_LAST:
4694 case BC_LEX_KEY_OBASE:
4696 if (BC_PARSE_LEAF(prev, rprn))
4697 return bc_error_bad_expression();
4698 prev = (char) (t - BC_LEX_KEY_IBASE + BC_INST_IBASE);
4699 bc_parse_push(p, (char) prev);
4701 paren_expr = get_token = true;
4702 rprn = bin_last = false;
4708 case BC_LEX_KEY_LENGTH:
4709 case BC_LEX_KEY_SQRT:
4711 if (BC_PARSE_LEAF(prev, rprn))
4712 return bc_error_bad_expression();
4713 s = zbc_parse_builtin(p, t, flags, &prev);
4715 rprn = get_token = bin_last = false;
4721 case BC_LEX_KEY_READ:
4723 if (BC_PARSE_LEAF(prev, rprn))
4724 return bc_error_bad_expression();
4725 else if (flags & BC_PARSE_NOREAD)
4726 s = bc_error_nested_read_call();
4728 s = zbc_parse_read(p);
4731 rprn = get_token = bin_last = false;
4733 prev = BC_INST_READ;
4738 case BC_LEX_KEY_SCALE:
4740 if (BC_PARSE_LEAF(prev, rprn))
4741 return bc_error_bad_expression();
4742 s = zbc_parse_scale(p, &prev, flags);
4744 rprn = get_token = bin_last = false;
4746 prev = BC_INST_SCALE;
4753 s = bc_error_bad_token();
4758 if (!s && get_token) s = zbc_lex_next(&p->l);
4762 if (G_interrupt) return BC_STATUS_FAILURE; // ^C: stop parsing
4764 while (p->ops.len > ops_bgn) {
4766 top = BC_PARSE_TOP_OP(p);
4767 assign = top >= BC_LEX_OP_ASSIGN_POWER && top <= BC_LEX_OP_ASSIGN;
4769 if (top == BC_LEX_LPAREN || top == BC_LEX_RPAREN)
4770 return bc_error_bad_expression();
4772 bc_parse_push(p, BC_TOKEN_2_INST(top));
4774 nexprs -= top != BC_LEX_OP_BOOL_NOT && top != BC_LEX_NEG;
4775 bc_vec_pop(&p->ops);
4778 if (prev == BC_INST_BOOL_NOT || nexprs != 1)
4779 return bc_error_bad_expression();
4781 if (!(flags & BC_PARSE_REL) && nrelops) {
4782 s = bc_POSIX_does_not_allow("comparison operators outside if or loops");
4783 IF_ERROR_RETURN_POSSIBLE(if (s) return s);
4785 else if ((flags & BC_PARSE_REL) && nrelops > 1) {
4786 s = bc_POSIX_requires("exactly one comparison operator per condition");
4787 IF_ERROR_RETURN_POSSIBLE(if (s) return s);
4790 if (flags & BC_PARSE_PRINT) {
4791 if (paren_first || !assign) bc_parse_push(p, BC_INST_PRINT);
4792 bc_parse_push(p, BC_INST_POP);
4795 dbg_lex_done("%s:%d done", __func__, __LINE__);
4803 static BC_STATUS zdc_parse_register(BcParse *p)
4807 s = zbc_lex_next(&p->l);
4808 if (s) RETURN_STATUS(s);
4809 if (p->l.t.t != BC_LEX_NAME) RETURN_STATUS(bc_error_bad_token());
4811 bc_parse_pushName(p, p->l.t.v.v);
4815 #define zdc_parse_register(...) (zdc_parse_register(__VA_ARGS__) COMMA_SUCCESS)
4817 static BC_STATUS zdc_parse_string(BcParse *p)
4820 size_t idx, len = G.prog.strs.len;
4822 //why pad to 32 zeros??
4823 name = xasprintf("%032lu", (unsigned long)len);
4825 str = xstrdup(p->l.t.v.v);
4826 bc_parse_push(p, BC_INST_STR);
4827 bc_parse_pushIndex(p, len);
4828 bc_vec_push(&G.prog.strs, &str);
4829 bc_parse_addFunc(p, name, &idx);
4831 RETURN_STATUS(zbc_lex_next(&p->l));
4833 #define zdc_parse_string(...) (zdc_parse_string(__VA_ARGS__) COMMA_SUCCESS)
4835 static BC_STATUS zdc_parse_mem(BcParse *p, uint8_t inst, bool name, bool store)
4839 bc_parse_push(p, inst);
4841 s = zdc_parse_register(p);
4842 if (s) RETURN_STATUS(s);
4846 bc_parse_push(p, BC_INST_SWAP);
4847 bc_parse_push(p, BC_INST_ASSIGN);
4848 bc_parse_push(p, BC_INST_POP);
4851 RETURN_STATUS(zbc_lex_next(&p->l));
4853 #define zdc_parse_mem(...) (zdc_parse_mem(__VA_ARGS__) COMMA_SUCCESS)
4855 static BC_STATUS zdc_parse_cond(BcParse *p, uint8_t inst)
4859 bc_parse_push(p, inst);
4860 bc_parse_push(p, BC_INST_EXEC_COND);
4862 s = zdc_parse_register(p);
4863 if (s) RETURN_STATUS(s);
4865 s = zbc_lex_next(&p->l);
4866 if (s) RETURN_STATUS(s);
4868 if (p->l.t.t == BC_LEX_ELSE) {
4869 s = zdc_parse_register(p);
4870 if (s) RETURN_STATUS(s);
4871 s = zbc_lex_next(&p->l);
4874 bc_parse_push(p, BC_PARSE_STREND);
4878 #define zdc_parse_cond(...) (zdc_parse_cond(__VA_ARGS__) COMMA_SUCCESS)
4880 static BC_STATUS zdc_parse_token(BcParse *p, BcLexType t, uint8_t flags)
4882 BcStatus s = BC_STATUS_SUCCESS;
4884 bool assign, get_token = false;
4887 case BC_LEX_OP_REL_EQ:
4888 case BC_LEX_OP_REL_LE:
4889 case BC_LEX_OP_REL_GE:
4890 case BC_LEX_OP_REL_NE:
4891 case BC_LEX_OP_REL_LT:
4892 case BC_LEX_OP_REL_GT:
4893 s = zdc_parse_cond(p, t - BC_LEX_OP_REL_EQ + BC_INST_REL_EQ);
4897 s = zdc_parse_mem(p, BC_INST_ARRAY_ELEM, true, t == BC_LEX_COLON);
4900 s = zdc_parse_string(p);
4904 if (t == BC_LEX_NEG) {
4905 s = zbc_lex_next(&p->l);
4906 if (s) RETURN_STATUS(s);
4907 if (p->l.t.t != BC_LEX_NUMBER)
4908 RETURN_STATUS(bc_error_bad_token());
4911 if (t == BC_LEX_NEG) bc_parse_push(p, BC_INST_NEG);
4914 case BC_LEX_KEY_READ:
4915 if (flags & BC_PARSE_NOREAD)
4916 s = bc_error_nested_read_call();
4918 bc_parse_push(p, BC_INST_READ);
4921 case BC_LEX_OP_ASSIGN:
4922 case BC_LEX_STORE_PUSH:
4923 assign = t == BC_LEX_OP_ASSIGN;
4924 inst = assign ? BC_INST_VAR : BC_INST_PUSH_TO_VAR;
4925 s = zdc_parse_mem(p, inst, true, assign);
4928 case BC_LEX_LOAD_POP:
4929 inst = t == BC_LEX_LOAD_POP ? BC_INST_PUSH_VAR : BC_INST_LOAD;
4930 s = zdc_parse_mem(p, inst, true, false);
4932 case BC_LEX_STORE_IBASE:
4933 case BC_LEX_STORE_SCALE:
4934 case BC_LEX_STORE_OBASE:
4935 inst = t - BC_LEX_STORE_IBASE + BC_INST_IBASE;
4936 s = zdc_parse_mem(p, inst, false, true);
4939 s = bc_error_bad_token();
4944 if (!s && get_token) s = zbc_lex_next(&p->l);
4948 #define zdc_parse_token(...) (zdc_parse_token(__VA_ARGS__) COMMA_SUCCESS)
4950 static BC_STATUS zdc_parse_expr(BcParse *p, uint8_t flags)
4952 BcStatus s = BC_STATUS_SUCCESS;
4956 for (t = p->l.t.t; !s && t != BC_LEX_EOF; t = p->l.t.t) {
4957 inst = dc_parse_insts[t];
4959 if (inst != BC_INST_INVALID) {
4960 bc_parse_push(p, inst);
4961 s = zbc_lex_next(&p->l);
4963 s = zdc_parse_token(p, t, flags);
4966 if (!s && p->l.t.t == BC_LEX_EOF && (flags & BC_PARSE_NOCALL))
4967 bc_parse_push(p, BC_INST_POP_EXEC);
4971 #define zdc_parse_expr(...) (zdc_parse_expr(__VA_ARGS__) COMMA_SUCCESS)
4973 static BC_STATUS zdc_parse_parse(BcParse *p)
4977 if (p->l.t.t == BC_LEX_EOF)
4978 s = bc_error("end of file");
4980 s = zdc_parse_expr(p, 0);
4982 if (s || G_interrupt) {
4984 s = BC_STATUS_FAILURE;
4989 #define zdc_parse_parse(...) (zdc_parse_parse(__VA_ARGS__) COMMA_SUCCESS)
4993 static BC_STATUS zcommon_parse_expr(BcParse *p, uint8_t flags)
4996 IF_BC(RETURN_STATUS(zbc_parse_expr(p, flags)));
4998 IF_DC(RETURN_STATUS(zdc_parse_expr(p, flags)));
5001 #define zcommon_parse_expr(...) (zcommon_parse_expr(__VA_ARGS__) COMMA_SUCCESS)
5003 static BcVec* bc_program_search(char *id, bool var)
5011 v = var ? &G.prog.vars : &G.prog.arrs;
5012 map = var ? &G.prog.var_map : &G.prog.arr_map;
5016 new = bc_map_insert(map, &e, &i); // 1 if insertion was successful
5019 bc_array_init(&data.v, var);
5020 bc_vec_push(v, &data.v);
5023 ptr = bc_vec_item(map, i);
5024 if (new) ptr->name = xstrdup(e.name);
5025 return bc_vec_item(v, ptr->idx);
5028 static BC_STATUS zbc_program_num(BcResult *r, BcNum **num, bool hex)
5033 case BC_RESULT_TEMP:
5034 case BC_RESULT_IBASE:
5035 case BC_RESULT_SCALE:
5036 case BC_RESULT_OBASE:
5042 case BC_RESULT_CONSTANT:
5045 char **str = bc_vec_item(&G.prog.consts, r->d.id.idx);
5047 size_t len = strlen(*str);
5049 bc_num_init(&r->d.n, len);
5051 hex = hex && len == 1;
5052 base_t = hex ? 16 : G.prog.ib_t;
5053 s = zbc_num_parse(&r->d.n, *str, base_t);
5056 bc_num_free(&r->d.n);
5061 r->t = BC_RESULT_TEMP;
5067 case BC_RESULT_ARRAY:
5068 case BC_RESULT_ARRAY_ELEM:
5072 v = bc_program_search(r->d.id.name, r->t == BC_RESULT_VAR);
5074 if (r->t == BC_RESULT_ARRAY_ELEM) {
5076 if (v->len <= r->d.id.idx) bc_array_expand(v, r->d.id.idx + 1);
5077 *num = bc_vec_item(v, r->d.id.idx);
5080 *num = bc_vec_top(v);
5085 case BC_RESULT_LAST:
5087 *num = &G.prog.last;
5098 RETURN_STATUS(BC_STATUS_SUCCESS);
5100 #define zbc_program_num(...) (zbc_program_num(__VA_ARGS__) COMMA_SUCCESS)
5102 static BC_STATUS zbc_program_binOpPrep(BcResult **l, BcNum **ln,
5103 BcResult **r, BcNum **rn, bool assign)
5107 BcResultType lt, rt;
5109 if (!BC_PROG_STACK(&G.prog.results, 2))
5110 RETURN_STATUS(bc_error_stack_has_too_few_elements());
5112 *r = bc_vec_item_rev(&G.prog.results, 0);
5113 *l = bc_vec_item_rev(&G.prog.results, 1);
5117 hex = assign && (lt == BC_RESULT_IBASE || lt == BC_RESULT_OBASE);
5119 s = zbc_program_num(*l, ln, false);
5120 if (s) RETURN_STATUS(s);
5121 s = zbc_program_num(*r, rn, hex);
5122 if (s) RETURN_STATUS(s);
5124 // We run this again under these conditions in case any vector has been
5125 // reallocated out from under the BcNums or arrays we had.
5126 if (lt == rt && (lt == BC_RESULT_VAR || lt == BC_RESULT_ARRAY_ELEM)) {
5127 s = zbc_program_num(*l, ln, false);
5128 if (s) RETURN_STATUS(s);
5131 if (!BC_PROG_NUM((*l), (*ln)) && (!assign || (*l)->t != BC_RESULT_VAR))
5132 RETURN_STATUS(bc_error_variable_is_wrong_type());
5133 if (!assign && !BC_PROG_NUM((*r), (*ln)))
5134 RETURN_STATUS(bc_error_variable_is_wrong_type());
5138 #define zbc_program_binOpPrep(...) (zbc_program_binOpPrep(__VA_ARGS__) COMMA_SUCCESS)
5140 static void bc_program_binOpRetire(BcResult *r)
5142 r->t = BC_RESULT_TEMP;
5143 bc_vec_pop(&G.prog.results);
5144 bc_vec_pop(&G.prog.results);
5145 bc_vec_push(&G.prog.results, r);
5148 static BC_STATUS zbc_program_prep(BcResult **r, BcNum **n)
5152 if (!BC_PROG_STACK(&G.prog.results, 1))
5153 RETURN_STATUS(bc_error_stack_has_too_few_elements());
5154 *r = bc_vec_top(&G.prog.results);
5156 s = zbc_program_num(*r, n, false);
5157 if (s) RETURN_STATUS(s);
5159 if (!BC_PROG_NUM((*r), (*n)))
5160 RETURN_STATUS(bc_error_variable_is_wrong_type());
5164 #define zbc_program_prep(...) (zbc_program_prep(__VA_ARGS__) COMMA_SUCCESS)
5166 static void bc_program_retire(BcResult *r, BcResultType t)
5169 bc_vec_pop(&G.prog.results);
5170 bc_vec_push(&G.prog.results, r);
5173 static BC_STATUS zbc_program_op(char inst)
5176 BcResult *opd1, *opd2, res;
5177 BcNum *n1, *n2 = NULL;
5179 s = zbc_program_binOpPrep(&opd1, &n1, &opd2, &n2, false);
5180 if (s) RETURN_STATUS(s);
5181 bc_num_init_DEF_SIZE(&res.d.n);
5183 s = BC_STATUS_SUCCESS;
5184 IF_ERROR_RETURN_POSSIBLE(s =) zbc_program_ops[inst - BC_INST_POWER](n1, n2, &res.d.n, G.prog.scale);
5186 bc_program_binOpRetire(&res);
5191 bc_num_free(&res.d.n);
5194 #define zbc_program_op(...) (zbc_program_op(__VA_ARGS__) COMMA_SUCCESS)
5196 static BC_STATUS zbc_program_read(void)
5198 const char *sv_file;
5206 RETURN_STATUS(bc_error_nested_read_call());
5208 f = bc_program_func(BC_PROG_READ);
5209 bc_vec_pop_all(&f->code);
5211 sv_file = G.prog.file;
5215 bc_char_vec_init(&buf);
5216 bc_read_line(&buf, stdin);
5218 bc_parse_create(&parse, BC_PROG_READ);
5219 bc_lex_file(&parse.l);
5221 s = zbc_parse_text_init(&parse, buf.v);
5222 if (s) goto exec_err;
5223 s = zcommon_parse_expr(&parse, BC_PARSE_NOREAD);
5224 if (s) goto exec_err;
5226 if (parse.l.t.t != BC_LEX_NLINE && parse.l.t.t != BC_LEX_EOF) {
5227 s = bc_error("bad read() expression");
5231 ip.func = BC_PROG_READ;
5233 ip.len = G.prog.results.len;
5235 // Update this pointer, just in case.
5236 f = bc_program_func(BC_PROG_READ);
5238 bc_vec_pushByte(&f->code, BC_INST_POP_EXEC);
5239 bc_vec_push(&G.prog.stack, &ip);
5242 bc_parse_free(&parse);
5244 G.prog.file = sv_file;
5248 #define zbc_program_read(...) (zbc_program_read(__VA_ARGS__) COMMA_SUCCESS)
5250 static size_t bc_program_index(char *code, size_t *bgn)
5252 char amt = code[(*bgn)++], i = 0;
5255 for (; i < amt; ++i, ++(*bgn))
5256 res |= (((size_t)((int) code[*bgn]) & UCHAR_MAX) << (i * CHAR_BIT));
5261 static char *bc_program_name(char *code, size_t *bgn)
5264 char c, *s, *str = code + *bgn, *ptr = strchr(str, BC_PARSE_STREND);
5266 s = xmalloc(ptr - str + 1);
5269 for (i = 0; c != 0 && c != BC_PARSE_STREND; c = code[(*bgn)++], ++i)
5277 static void bc_program_printString(const char *str)
5281 // Example: echo '[]ap' | dc
5282 // should print two bytes: 0x00, 0x0A
5289 if (c != '\\' || !*str)
5309 G.prog.nchars = SIZE_MAX;
5321 // Just print the backslash and following character.
5332 static void bc_num_printNewline(void)
5334 if (G.prog.nchars == G.prog.len - 1) {
5342 static FAST_FUNC void bc_num_printChar(size_t num, size_t width, bool radix)
5345 bb_putchar((char) num);
5346 G.prog.nchars += width;
5350 static FAST_FUNC void bc_num_printDigits(size_t num, size_t width, bool radix)
5354 bc_num_printNewline();
5355 bb_putchar(radix ? '.' : ' ');
5358 bc_num_printNewline();
5359 for (exp = 0, pow = 1; exp < width - 1; ++exp, pow *= 10)
5362 for (exp = 0; exp < width; pow /= 10, ++G.prog.nchars, ++exp) {
5364 bc_num_printNewline();
5367 bb_putchar(((char) dig) + '0');
5371 static FAST_FUNC void bc_num_printHex(size_t num, size_t width, bool radix)
5374 bc_num_printNewline();
5379 bc_num_printNewline();
5380 bb_putchar(bb_hexdigits_upcase[num]);
5381 G.prog.nchars += width;
5384 static void bc_num_printDecimal(BcNum *n)
5386 size_t i, rdx = n->rdx - 1;
5388 if (n->neg) bb_putchar('-');
5389 G.prog.nchars += n->neg;
5391 for (i = n->len - 1; i < n->len; --i)
5392 bc_num_printHex((size_t) n->num[i], 1, i == rdx);
5395 static BC_STATUS zbc_num_printNum(BcNum *n, BcNum *base, size_t width, BcNumDigitOp print)
5399 BcNum intp, fracp, digit, frac_len;
5400 unsigned long dig, *ptr;
5405 print(0, width, false);
5406 RETURN_STATUS(BC_STATUS_SUCCESS);
5409 bc_vec_init(&stack, sizeof(long), NULL);
5410 bc_num_init(&intp, n->len);
5411 bc_num_init(&fracp, n->rdx);
5412 bc_num_init(&digit, width);
5413 bc_num_init(&frac_len, BC_NUM_INT(n));
5414 bc_num_copy(&intp, n);
5415 bc_num_one(&frac_len);
5417 bc_num_truncate(&intp, intp.rdx);
5418 s = zbc_num_sub(n, &intp, &fracp, 0);
5421 while (intp.len != 0) {
5422 s = zbc_num_divmod(&intp, base, &intp, &digit, 0);
5424 s = zbc_num_ulong(&digit, &dig);
5426 bc_vec_push(&stack, &dig);
5429 for (i = 0; i < stack.len; ++i) {
5430 ptr = bc_vec_item_rev(&stack, i);
5431 print(*ptr, width, false);
5434 if (!n->rdx) goto err;
5436 for (radix = true; frac_len.len <= n->rdx; radix = false) {
5437 s = zbc_num_mul(&fracp, base, &fracp, n->rdx);
5439 s = zbc_num_ulong(&fracp, &dig);
5441 bc_num_ulong2num(&intp, dig);
5442 s = zbc_num_sub(&fracp, &intp, &fracp, 0);
5444 print(dig, width, radix);
5445 s = zbc_num_mul(&frac_len, base, &frac_len, 0);
5450 bc_num_free(&frac_len);
5451 bc_num_free(&digit);
5452 bc_num_free(&fracp);
5454 bc_vec_free(&stack);
5457 #define zbc_num_printNum(...) (zbc_num_printNum(__VA_ARGS__) COMMA_SUCCESS)
5459 static BC_STATUS zbc_num_printBase(BcNum *n)
5473 if (G.prog.ob_t <= BC_NUM_MAX_IBASE) {
5475 print = bc_num_printHex;
5477 for (i = G.prog.ob_t - 1, width = 0; i != 0; i /= 10, ++width)
5479 print = bc_num_printDigits;
5482 s = zbc_num_printNum(n, &G.prog.ob, width, print);
5487 #define zbc_num_printBase(...) (zbc_num_printBase(__VA_ARGS__) COMMA_SUCCESS)
5489 static BC_STATUS zbc_num_print(BcNum *n, bool newline)
5491 BcStatus s = BC_STATUS_SUCCESS;
5493 bc_num_printNewline();
5498 } else if (G.prog.ob_t == 10)
5499 bc_num_printDecimal(n);
5501 s = zbc_num_printBase(n);
5510 #define zbc_num_print(...) (zbc_num_print(__VA_ARGS__) COMMA_SUCCESS)
5512 static BC_STATUS zbc_program_print(char inst, size_t idx)
5517 bool pop = inst != BC_INST_PRINT;
5519 if (!BC_PROG_STACK(&G.prog.results, idx + 1))
5520 RETURN_STATUS(bc_error_stack_has_too_few_elements());
5522 r = bc_vec_item_rev(&G.prog.results, idx);
5523 num = NULL; // is this NULL necessary?
5524 s = zbc_program_num(r, &num, false);
5525 if (s) RETURN_STATUS(s);
5527 if (BC_PROG_NUM(r, num)) {
5528 s = zbc_num_print(num, !pop);
5529 if (!s) bc_num_copy(&G.prog.last, num);
5534 idx = (r->t == BC_RESULT_STR) ? r->d.id.idx : num->rdx;
5535 str = *bc_program_str(idx);
5537 if (inst == BC_INST_PRINT_STR) {
5540 if (c == '\0') break;
5543 if (c == '\n') G.prog.nchars = 0;
5547 bc_program_printString(str);
5548 if (inst == BC_INST_PRINT) bb_putchar('\n');
5552 if (!s && pop) bc_vec_pop(&G.prog.results);
5556 #define zbc_program_print(...) (zbc_program_print(__VA_ARGS__) COMMA_SUCCESS)
5558 static BC_STATUS zbc_program_negate(void)
5564 s = zbc_program_prep(&ptr, &num);
5565 if (s) RETURN_STATUS(s);
5567 bc_num_init(&res.d.n, num->len);
5568 bc_num_copy(&res.d.n, num);
5569 if (res.d.n.len) res.d.n.neg = !res.d.n.neg;
5571 bc_program_retire(&res, BC_RESULT_TEMP);
5575 #define zbc_program_negate(...) (zbc_program_negate(__VA_ARGS__) COMMA_SUCCESS)
5577 static BC_STATUS zbc_program_logical(char inst)
5580 BcResult *opd1, *opd2, res;
5584 s = zbc_program_binOpPrep(&opd1, &n1, &opd2, &n2, false);
5585 if (s) RETURN_STATUS(s);
5587 bc_num_init_DEF_SIZE(&res.d.n);
5589 if (inst == BC_INST_BOOL_AND)
5590 cond = bc_num_cmp(n1, &G.prog.zero) && bc_num_cmp(n2, &G.prog.zero);
5591 else if (inst == BC_INST_BOOL_OR)
5592 cond = bc_num_cmp(n1, &G.prog.zero) || bc_num_cmp(n2, &G.prog.zero);
5594 cond = bc_num_cmp(n1, n2);
5596 case BC_INST_REL_EQ:
5599 case BC_INST_REL_LE:
5602 case BC_INST_REL_GE:
5605 case BC_INST_REL_LT:
5608 case BC_INST_REL_GT:
5611 default: // = case BC_INST_REL_NE:
5612 //cond = (cond != 0); - not needed
5617 if (cond) bc_num_one(&res.d.n);
5618 //else bc_num_zero(&res.d.n); - already is
5620 bc_program_binOpRetire(&res);
5624 #define zbc_program_logical(...) (zbc_program_logical(__VA_ARGS__) COMMA_SUCCESS)
5627 static BC_STATUS zbc_program_assignStr(BcResult *r, BcVec *v,
5633 memset(&n2, 0, sizeof(BcNum));
5634 n2.rdx = res.d.id.idx = r->d.id.idx;
5635 res.t = BC_RESULT_STR;
5638 if (!BC_PROG_STACK(&G.prog.results, 2))
5639 RETURN_STATUS(bc_error_stack_has_too_few_elements());
5641 bc_vec_pop(&G.prog.results);
5644 bc_vec_pop(&G.prog.results);
5646 bc_vec_push(&G.prog.results, &res);
5647 bc_vec_push(v, &n2);
5649 RETURN_STATUS(BC_STATUS_SUCCESS);
5651 #define zbc_program_assignStr(...) (zbc_program_assignStr(__VA_ARGS__) COMMA_SUCCESS)
5654 static BC_STATUS zbc_program_copyToVar(char *name, bool var)
5661 if (!BC_PROG_STACK(&G.prog.results, 1))
5662 RETURN_STATUS(bc_error_stack_has_too_few_elements());
5664 ptr = bc_vec_top(&G.prog.results);
5665 if ((ptr->t == BC_RESULT_ARRAY) != !var)
5666 RETURN_STATUS(bc_error_variable_is_wrong_type());
5667 v = bc_program_search(name, var);
5670 if (ptr->t == BC_RESULT_STR && !var)
5671 RETURN_STATUS(bc_error_variable_is_wrong_type());
5672 if (ptr->t == BC_RESULT_STR)
5673 RETURN_STATUS(zbc_program_assignStr(ptr, v, true));
5676 s = zbc_program_num(ptr, &n, false);
5677 if (s) RETURN_STATUS(s);
5679 // Do this once more to make sure that pointers were not invalidated.
5680 v = bc_program_search(name, var);
5683 bc_num_init_DEF_SIZE(&r.d.n);
5684 bc_num_copy(&r.d.n, n);
5687 bc_array_init(&r.d.v, true);
5688 bc_array_copy(&r.d.v, (BcVec *) n);
5691 bc_vec_push(v, &r.d);
5692 bc_vec_pop(&G.prog.results);
5696 #define zbc_program_copyToVar(...) (zbc_program_copyToVar(__VA_ARGS__) COMMA_SUCCESS)
5698 static BC_STATUS zbc_program_assign(char inst)
5701 BcResult *left, *right, res;
5702 BcNum *l = NULL, *r = NULL;
5703 bool assign = inst == BC_INST_ASSIGN, ib, sc;
5705 s = zbc_program_binOpPrep(&left, &l, &right, &r, assign);
5706 if (s) RETURN_STATUS(s);
5708 ib = left->t == BC_RESULT_IBASE;
5709 sc = left->t == BC_RESULT_SCALE;
5713 if (right->t == BC_RESULT_STR) {
5717 if (left->t != BC_RESULT_VAR)
5718 RETURN_STATUS(bc_error_variable_is_wrong_type());
5719 v = bc_program_search(left->d.id.name, true);
5721 RETURN_STATUS(zbc_program_assignStr(right, v, false));
5725 if (left->t == BC_RESULT_CONSTANT || left->t == BC_RESULT_TEMP)
5726 RETURN_STATUS(bc_error("bad assignment:"
5727 " left side must be variable"
5729 )); // note: shared string
5732 if (inst == BC_INST_ASSIGN_DIVIDE && !bc_num_cmp(r, &G.prog.zero))
5733 RETURN_STATUS(bc_error("divide by zero"));
5738 s = BC_STATUS_SUCCESS;
5739 IF_ERROR_RETURN_POSSIBLE(s =) zbc_program_ops[inst - BC_INST_ASSIGN_POWER](l, r, l, G.prog.scale);
5741 if (s) RETURN_STATUS(s);
5746 if (ib || sc || left->t == BC_RESULT_OBASE) {
5747 static const char *const msg[] = {
5748 "bad ibase; must be [2,16]", //BC_RESULT_IBASE
5749 "bad scale; must be [0,"BC_MAX_SCALE_STR"]", //BC_RESULT_SCALE
5750 NULL, //can't happen //BC_RESULT_LAST
5751 NULL, //can't happen //BC_RESULT_CONSTANT
5752 NULL, //can't happen //BC_RESULT_ONE
5753 "bad obase; must be [2,"BC_MAX_OBASE_STR"]", //BC_RESULT_OBASE
5759 s = zbc_num_ulong(l, &val);
5760 if (s) RETURN_STATUS(s);
5761 s = left->t - BC_RESULT_IBASE;
5764 ptr = &G.prog.scale;
5767 RETURN_STATUS(bc_error(msg[s]));
5768 max = ib ? BC_NUM_MAX_IBASE : BC_MAX_OBASE;
5769 ptr = ib ? &G.prog.ib_t : &G.prog.ob_t;
5773 RETURN_STATUS(bc_error(msg[s]));
5775 bc_num_copy(&G.prog.ob, l);
5777 *ptr = (size_t) val;
5778 s = BC_STATUS_SUCCESS;
5781 bc_num_init(&res.d.n, l->len);
5782 bc_num_copy(&res.d.n, l);
5783 bc_program_binOpRetire(&res);
5787 #define zbc_program_assign(...) (zbc_program_assign(__VA_ARGS__) COMMA_SUCCESS)
5790 #define bc_program_pushVar(code, bgn, pop, copy) \
5791 bc_program_pushVar(code, bgn)
5792 // for bc, 'pop' and 'copy' are always false
5794 static BC_STATUS bc_program_pushVar(char *code, size_t *bgn,
5795 bool pop, bool copy)
5798 char *name = bc_program_name(code, bgn);
5800 r.t = BC_RESULT_VAR;
5805 BcVec *v = bc_program_search(name, true);
5806 BcNum *num = bc_vec_top(v);
5810 if (!BC_PROG_STACK(v, 2 - copy)) {
5812 RETURN_STATUS(bc_error_stack_has_too_few_elements());
5818 if (!BC_PROG_STR(num)) {
5820 r.t = BC_RESULT_TEMP;
5822 bc_num_init_DEF_SIZE(&r.d.n);
5823 bc_num_copy(&r.d.n, num);
5826 r.t = BC_RESULT_STR;
5827 r.d.id.idx = num->rdx;
5830 if (!copy) bc_vec_pop(v);
5835 bc_vec_push(&G.prog.results, &r);
5837 RETURN_STATUS(BC_STATUS_SUCCESS);
5839 #define zbc_program_pushVar(...) (bc_program_pushVar(__VA_ARGS__) COMMA_SUCCESS)
5841 static BC_STATUS zbc_program_pushArray(char *code, size_t *bgn,
5844 BcStatus s = BC_STATUS_SUCCESS;
5848 r.d.id.name = bc_program_name(code, bgn);
5850 if (inst == BC_INST_ARRAY) {
5851 r.t = BC_RESULT_ARRAY;
5852 bc_vec_push(&G.prog.results, &r);
5859 s = zbc_program_prep(&operand, &num);
5861 s = zbc_num_ulong(num, &temp);
5864 if (temp > BC_MAX_DIM) {
5865 s = bc_error("array too long; must be [1,"BC_MAX_DIM_STR"]");
5869 r.d.id.idx = (size_t) temp;
5870 bc_program_retire(&r, BC_RESULT_ARRAY_ELEM);
5874 if (s) free(r.d.id.name);
5877 #define zbc_program_pushArray(...) (zbc_program_pushArray(__VA_ARGS__) COMMA_SUCCESS)
5880 static BC_STATUS zbc_program_incdec(char inst)
5883 BcResult *ptr, res, copy;
5887 s = zbc_program_prep(&ptr, &num);
5888 if (s) RETURN_STATUS(s);
5890 if (inst == BC_INST_INC_POST || inst == BC_INST_DEC_POST) {
5891 copy.t = BC_RESULT_TEMP;
5892 bc_num_init(©.d.n, num->len);
5893 bc_num_copy(©.d.n, num);
5896 res.t = BC_RESULT_ONE;
5897 inst = inst == BC_INST_INC_PRE || inst == BC_INST_INC_POST ?
5898 BC_INST_ASSIGN_PLUS :
5899 BC_INST_ASSIGN_MINUS;
5901 bc_vec_push(&G.prog.results, &res);
5902 s = zbc_program_assign(inst);
5903 if (s) RETURN_STATUS(s);
5905 if (inst2 == BC_INST_INC_POST || inst2 == BC_INST_DEC_POST) {
5906 bc_vec_pop(&G.prog.results);
5907 bc_vec_push(&G.prog.results, ©);
5912 #define zbc_program_incdec(...) (zbc_program_incdec(__VA_ARGS__) COMMA_SUCCESS)
5914 static BC_STATUS zbc_program_call(char *code, size_t *idx)
5917 size_t i, nparams = bc_program_index(code, idx);
5924 ip.func = bc_program_index(code, idx);
5925 func = bc_program_func(ip.func);
5927 if (func->code.len == 0) {
5928 RETURN_STATUS(bc_error("undefined function"));
5930 if (nparams != func->nparams) {
5931 RETURN_STATUS(bc_error_fmt("function has %u parameters, but called with %u", func->nparams, nparams));
5933 ip.len = G.prog.results.len - nparams;
5935 for (i = 0; i < nparams; ++i) {
5938 a = bc_vec_item(&func->autos, nparams - 1 - i);
5939 arg = bc_vec_top(&G.prog.results);
5941 if ((!a->idx) != (arg->t == BC_RESULT_ARRAY) || arg->t == BC_RESULT_STR)
5942 RETURN_STATUS(bc_error_variable_is_wrong_type());
5944 s = zbc_program_copyToVar(a->name, a->idx);
5945 if (s) RETURN_STATUS(s);
5948 for (; i < func->autos.len; ++i) {
5951 a = bc_vec_item(&func->autos, i);
5952 v = bc_program_search(a->name, a->idx);
5955 bc_num_init_DEF_SIZE(¶m.n);
5956 bc_vec_push(v, ¶m.n);
5959 bc_array_init(¶m.v, true);
5960 bc_vec_push(v, ¶m.v);
5964 bc_vec_push(&G.prog.stack, &ip);
5966 RETURN_STATUS(BC_STATUS_SUCCESS);
5968 #define zbc_program_call(...) (zbc_program_call(__VA_ARGS__) COMMA_SUCCESS)
5970 static BC_STATUS zbc_program_return(char inst)
5975 BcInstPtr *ip = bc_vec_top(&G.prog.stack);
5977 if (!BC_PROG_STACK(&G.prog.results, ip->len + inst == BC_INST_RET))
5978 RETURN_STATUS(bc_error_stack_has_too_few_elements());
5980 f = bc_program_func(ip->func);
5981 res.t = BC_RESULT_TEMP;
5983 if (inst == BC_INST_RET) {
5986 BcResult *operand = bc_vec_top(&G.prog.results);
5988 s = zbc_program_num(operand, &num, false);
5989 if (s) RETURN_STATUS(s);
5990 bc_num_init(&res.d.n, num->len);
5991 bc_num_copy(&res.d.n, num);
5994 bc_num_init_DEF_SIZE(&res.d.n);
5995 //bc_num_zero(&res.d.n); - already is
5998 // We need to pop arguments as well, so this takes that into account.
5999 for (i = 0; i < f->autos.len; ++i) {
6001 BcId *a = bc_vec_item(&f->autos, i);
6003 v = bc_program_search(a->name, a->idx);
6007 bc_vec_npop(&G.prog.results, G.prog.results.len - ip->len);
6008 bc_vec_push(&G.prog.results, &res);
6009 bc_vec_pop(&G.prog.stack);
6011 RETURN_STATUS(BC_STATUS_SUCCESS);
6013 #define zbc_program_return(...) (zbc_program_return(__VA_ARGS__) COMMA_SUCCESS)
6016 static unsigned long bc_program_scale(BcNum *n)
6018 return (unsigned long) n->rdx;
6021 static unsigned long bc_program_len(BcNum *n)
6023 size_t len = n->len;
6025 if (n->rdx != len) return len;
6027 if (len == 0) break;
6029 if (n->num[len] != 0) break;
6034 static BC_STATUS zbc_program_builtin(char inst)
6040 bool len = inst == BC_INST_LENGTH;
6042 if (!BC_PROG_STACK(&G.prog.results, 1))
6043 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6044 opnd = bc_vec_top(&G.prog.results);
6046 s = zbc_program_num(opnd, &num, false);
6047 if (s) RETURN_STATUS(s);
6050 if (!BC_PROG_NUM(opnd, num) && !len)
6051 RETURN_STATUS(bc_error_variable_is_wrong_type());
6054 bc_num_init_DEF_SIZE(&res.d.n);
6056 if (inst == BC_INST_SQRT) s = zbc_num_sqrt(num, &res.d.n, G.prog.scale);
6058 else if (len != 0 && opnd->t == BC_RESULT_ARRAY) {
6059 bc_num_ulong2num(&res.d.n, (unsigned long) ((BcVec *) num)->len);
6063 else if (len != 0 && !BC_PROG_NUM(opnd, num)) {
6065 size_t idx = opnd->t == BC_RESULT_STR ? opnd->d.id.idx : num->rdx;
6067 str = bc_program_str(idx);
6068 bc_num_ulong2num(&res.d.n, strlen(*str));
6072 bc_num_ulong2num(&res.d.n, len ? bc_program_len(num) : bc_program_scale(num));
6075 bc_program_retire(&res, BC_RESULT_TEMP);
6079 #define zbc_program_builtin(...) (zbc_program_builtin(__VA_ARGS__) COMMA_SUCCESS)
6082 static BC_STATUS zbc_program_divmod(void)
6085 BcResult *opd1, *opd2, res, res2;
6086 BcNum *n1, *n2 = NULL;
6088 s = zbc_program_binOpPrep(&opd1, &n1, &opd2, &n2, false);
6089 if (s) RETURN_STATUS(s);
6091 bc_num_init_DEF_SIZE(&res.d.n);
6092 bc_num_init(&res2.d.n, n2->len);
6094 s = zbc_num_divmod(n1, n2, &res2.d.n, &res.d.n, G.prog.scale);
6097 bc_program_binOpRetire(&res2);
6098 res.t = BC_RESULT_TEMP;
6099 bc_vec_push(&G.prog.results, &res);
6104 bc_num_free(&res2.d.n);
6105 bc_num_free(&res.d.n);
6108 #define zbc_program_divmod(...) (zbc_program_divmod(__VA_ARGS__) COMMA_SUCCESS)
6110 static BC_STATUS zbc_program_modexp(void)
6113 BcResult *r1, *r2, *r3, res;
6114 BcNum *n1, *n2, *n3;
6116 if (!BC_PROG_STACK(&G.prog.results, 3))
6117 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6118 s = zbc_program_binOpPrep(&r2, &n2, &r3, &n3, false);
6119 if (s) RETURN_STATUS(s);
6121 r1 = bc_vec_item_rev(&G.prog.results, 2);
6122 s = zbc_program_num(r1, &n1, false);
6123 if (s) RETURN_STATUS(s);
6124 if (!BC_PROG_NUM(r1, n1))
6125 RETURN_STATUS(bc_error_variable_is_wrong_type());
6127 // Make sure that the values have their pointers updated, if necessary.
6128 if (r1->t == BC_RESULT_VAR || r1->t == BC_RESULT_ARRAY_ELEM) {
6130 if (r1->t == r2->t) {
6131 s = zbc_program_num(r2, &n2, false);
6132 if (s) RETURN_STATUS(s);
6135 if (r1->t == r3->t) {
6136 s = zbc_program_num(r3, &n3, false);
6137 if (s) RETURN_STATUS(s);
6141 bc_num_init(&res.d.n, n3->len);
6142 s = zbc_num_modexp(n1, n2, n3, &res.d.n);
6145 bc_vec_pop(&G.prog.results);
6146 bc_program_binOpRetire(&res);
6151 bc_num_free(&res.d.n);
6154 #define zbc_program_modexp(...) (zbc_program_modexp(__VA_ARGS__) COMMA_SUCCESS)
6156 static void bc_program_stackLen(void)
6159 size_t len = G.prog.results.len;
6161 res.t = BC_RESULT_TEMP;
6163 bc_num_init_DEF_SIZE(&res.d.n);
6164 bc_num_ulong2num(&res.d.n, len);
6165 bc_vec_push(&G.prog.results, &res);
6168 static BC_STATUS zbc_program_asciify(void)
6173 char *str, *str2, c;
6174 size_t len = G.prog.strs.len, idx;
6177 if (!BC_PROG_STACK(&G.prog.results, 1))
6178 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6179 r = bc_vec_top(&G.prog.results);
6181 num = NULL; // TODO: is this NULL needed?
6182 s = zbc_program_num(r, &num, false);
6183 if (s) RETURN_STATUS(s);
6185 if (BC_PROG_NUM(r, num)) {
6187 bc_num_init_DEF_SIZE(&n);
6188 bc_num_copy(&n, num);
6189 bc_num_truncate(&n, n.rdx);
6191 s = zbc_num_mod(&n, &G.prog.strmb, &n, 0);
6192 if (s) goto num_err;
6193 s = zbc_num_ulong(&n, &val);
6194 if (s) goto num_err;
6201 idx = (r->t == BC_RESULT_STR) ? r->d.id.idx : num->rdx;
6202 str2 = *bc_program_str(idx);
6208 //str[1] = '\0'; - already is
6210 str2 = xstrdup(str);
6211 bc_program_addFunc(str2, &idx);
6213 if (idx != len + BC_PROG_REQ_FUNCS) {
6214 for (idx = 0; idx < G.prog.strs.len; ++idx) {
6215 if (strcmp(*bc_program_str(idx), str) == 0) {
6224 bc_vec_push(&G.prog.strs, &str);
6226 res.t = BC_RESULT_STR;
6228 bc_vec_pop(&G.prog.results);
6229 bc_vec_push(&G.prog.results, &res);
6231 RETURN_STATUS(BC_STATUS_SUCCESS);
6237 #define zbc_program_asciify(...) (zbc_program_asciify(__VA_ARGS__) COMMA_SUCCESS)
6239 static BC_STATUS zbc_program_printStream(void)
6247 if (!BC_PROG_STACK(&G.prog.results, 1))
6248 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6249 r = bc_vec_top(&G.prog.results);
6251 s = zbc_program_num(r, &n, false);
6252 if (s) RETURN_STATUS(s);
6254 if (BC_PROG_NUM(r, n)) {
6255 s = zbc_num_printNum(n, &G.prog.strmb, 1, bc_num_printChar);
6257 idx = (r->t == BC_RESULT_STR) ? r->d.id.idx : n->rdx;
6258 str = *bc_program_str(idx);
6264 #define zbc_program_printStream(...) (zbc_program_printStream(__VA_ARGS__) COMMA_SUCCESS)
6266 static BC_STATUS zbc_program_nquit(void)
6273 s = zbc_program_prep(&opnd, &num);
6274 if (s) RETURN_STATUS(s);
6275 s = zbc_num_ulong(num, &val);
6276 if (s) RETURN_STATUS(s);
6278 bc_vec_pop(&G.prog.results);
6280 if (G.prog.stack.len < val)
6281 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6282 if (G.prog.stack.len == val) {
6283 QUIT_OR_RETURN_TO_MAIN;
6286 bc_vec_npop(&G.prog.stack, val);
6290 #define zbc_program_nquit(...) (zbc_program_nquit(__VA_ARGS__) COMMA_SUCCESS)
6292 static BC_STATUS zbc_program_execStr(char *code, size_t *bgn,
6295 BcStatus s = BC_STATUS_SUCCESS;
6303 if (!BC_PROG_STACK(&G.prog.results, 1))
6304 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6306 r = bc_vec_top(&G.prog.results);
6309 BcNum *n = n; // for compiler
6312 char *then_name = bc_program_name(code, bgn);
6313 char *else_name = NULL;
6315 if (code[*bgn] == BC_PARSE_STREND)
6318 else_name = bc_program_name(code, bgn);
6320 exec = r->d.n.len != 0;
6322 if (!exec && else_name != NULL) {
6329 v = bc_program_search(name, true);
6336 if (!exec) goto exit;
6337 if (!BC_PROG_STR(n)) {
6338 s = bc_error_variable_is_wrong_type();
6344 if (r->t == BC_RESULT_STR) {
6346 } else if (r->t == BC_RESULT_VAR) {
6348 s = zbc_program_num(r, &n, false);
6349 if (s || !BC_PROG_STR(n)) goto exit;
6355 fidx = sidx + BC_PROG_REQ_FUNCS;
6357 str = bc_program_str(sidx);
6358 f = bc_program_func(fidx);
6360 if (f->code.len == 0) {
6361 bc_parse_create(&prs, fidx);
6362 s = zbc_parse_text_init(&prs, *str);
6364 s = zcommon_parse_expr(&prs, BC_PARSE_NOCALL);
6367 if (prs.l.t.t != BC_LEX_EOF) {
6368 s = bc_error_bad_expression();
6372 bc_parse_free(&prs);
6376 ip.len = G.prog.results.len;
6379 bc_vec_pop(&G.prog.results);
6380 bc_vec_push(&G.prog.stack, &ip);
6382 RETURN_STATUS(BC_STATUS_SUCCESS);
6385 bc_parse_free(&prs);
6386 f = bc_program_func(fidx);
6387 bc_vec_pop_all(&f->code);
6389 bc_vec_pop(&G.prog.results);
6392 #define zbc_program_execStr(...) (zbc_program_execStr(__VA_ARGS__) COMMA_SUCCESS)
6395 static void bc_program_pushGlobal(char inst)
6400 res.t = inst - BC_INST_IBASE + BC_RESULT_IBASE;
6401 if (inst == BC_INST_IBASE)
6402 val = (unsigned long) G.prog.ib_t;
6403 else if (inst == BC_INST_SCALE)
6404 val = (unsigned long) G.prog.scale;
6406 val = (unsigned long) G.prog.ob_t;
6408 bc_num_init_DEF_SIZE(&res.d.n);
6409 bc_num_ulong2num(&res.d.n, val);
6410 bc_vec_push(&G.prog.results, &res);
6413 static void bc_program_addFunc(char *name, size_t *idx)
6415 BcId entry, *entry_ptr;
6420 entry.idx = G.prog.fns.len;
6422 inserted = bc_map_insert(&G.prog.fn_map, &entry, idx);
6423 if (!inserted) free(name);
6425 entry_ptr = bc_vec_item(&G.prog.fn_map, *idx);
6426 *idx = entry_ptr->idx;
6430 BcFunc *func = bc_program_func(entry_ptr->idx);
6432 // We need to reset these, so the function can be repopulated.
6434 bc_vec_pop_all(&func->autos);
6435 bc_vec_pop_all(&func->code);
6436 bc_vec_pop_all(&func->labels);
6440 bc_vec_push(&G.prog.fns, &f);
6444 static BC_STATUS zbc_program_exec(void)
6448 BcInstPtr *ip = bc_vec_top(&G.prog.stack);
6449 BcFunc *func = bc_program_func(ip->func);
6450 char *code = func->code.v;
6452 while (ip->idx < func->code.len) {
6453 BcStatus s = BC_STATUS_SUCCESS;
6454 char inst = code[(ip->idx)++];
6456 dbg_exec("inst:%d", inst);
6459 case BC_INST_JUMP_ZERO: {
6461 dbg_exec("BC_INST_JUMP_ZERO:");
6462 s = zbc_program_prep(&ptr, &num);
6463 if (s) RETURN_STATUS(s);
6464 zero = (bc_num_cmp(num, &G.prog.zero) == 0);
6465 bc_vec_pop(&G.prog.results);
6467 bc_program_index(code, &ip->idx);
6470 // else: fall through
6472 case BC_INST_JUMP: {
6473 size_t idx = bc_program_index(code, &ip->idx);
6474 size_t *addr = bc_vec_item(&func->labels, idx);
6475 dbg_exec("BC_INST_JUMP: to %ld", (long)*addr);
6480 dbg_exec("BC_INST_CALL:");
6481 s = zbc_program_call(code, &ip->idx);
6483 case BC_INST_INC_PRE:
6484 case BC_INST_DEC_PRE:
6485 case BC_INST_INC_POST:
6486 case BC_INST_DEC_POST:
6487 dbg_exec("BC_INST_INCDEC:");
6488 s = zbc_program_incdec(inst);
6491 dbg_exec("BC_INST_HALT:");
6492 QUIT_OR_RETURN_TO_MAIN;
6496 dbg_exec("BC_INST_RET[0]:");
6497 s = zbc_program_return(inst);
6499 case BC_INST_BOOL_OR:
6500 case BC_INST_BOOL_AND:
6502 case BC_INST_REL_EQ:
6503 case BC_INST_REL_LE:
6504 case BC_INST_REL_GE:
6505 case BC_INST_REL_NE:
6506 case BC_INST_REL_LT:
6507 case BC_INST_REL_GT:
6508 dbg_exec("BC_INST_BOOL:");
6509 s = zbc_program_logical(inst);
6512 dbg_exec("BC_INST_READ:");
6513 s = zbc_program_read();
6516 dbg_exec("BC_INST_VAR:");
6517 s = zbc_program_pushVar(code, &ip->idx, false, false);
6519 case BC_INST_ARRAY_ELEM:
6521 dbg_exec("BC_INST_ARRAY[_ELEM]:");
6522 s = zbc_program_pushArray(code, &ip->idx, inst);
6525 r.t = BC_RESULT_LAST;
6526 bc_vec_push(&G.prog.results, &r);
6531 bc_program_pushGlobal(inst);
6533 case BC_INST_SCALE_FUNC:
6534 case BC_INST_LENGTH:
6536 dbg_exec("BC_INST_builtin:");
6537 s = zbc_program_builtin(inst);
6540 dbg_exec("BC_INST_NUM:");
6541 r.t = BC_RESULT_CONSTANT;
6542 r.d.id.idx = bc_program_index(code, &ip->idx);
6543 bc_vec_push(&G.prog.results, &r);
6546 dbg_exec("BC_INST_POP:");
6547 if (!BC_PROG_STACK(&G.prog.results, 1))
6548 s = bc_error_stack_has_too_few_elements();
6550 bc_vec_pop(&G.prog.results);
6552 case BC_INST_POP_EXEC:
6553 dbg_exec("BC_INST_POP_EXEC:");
6554 bc_vec_pop(&G.prog.stack);
6557 case BC_INST_PRINT_POP:
6558 case BC_INST_PRINT_STR:
6559 dbg_exec("BC_INST_PRINTxyz:");
6560 s = zbc_program_print(inst, 0);
6563 dbg_exec("BC_INST_STR:");
6564 r.t = BC_RESULT_STR;
6565 r.d.id.idx = bc_program_index(code, &ip->idx);
6566 bc_vec_push(&G.prog.results, &r);
6569 case BC_INST_MULTIPLY:
6570 case BC_INST_DIVIDE:
6571 case BC_INST_MODULUS:
6574 dbg_exec("BC_INST_binaryop:");
6575 s = zbc_program_op(inst);
6577 case BC_INST_BOOL_NOT:
6578 dbg_exec("BC_INST_BOOL_NOT:");
6579 s = zbc_program_prep(&ptr, &num);
6580 if (s) RETURN_STATUS(s);
6581 bc_num_init_DEF_SIZE(&r.d.n);
6582 if (!bc_num_cmp(num, &G.prog.zero))
6584 //else bc_num_zero(&r.d.n); - already is
6585 bc_program_retire(&r, BC_RESULT_TEMP);
6588 dbg_exec("BC_INST_NEG:");
6589 s = zbc_program_negate();
6592 case BC_INST_ASSIGN_POWER:
6593 case BC_INST_ASSIGN_MULTIPLY:
6594 case BC_INST_ASSIGN_DIVIDE:
6595 case BC_INST_ASSIGN_MODULUS:
6596 case BC_INST_ASSIGN_PLUS:
6597 case BC_INST_ASSIGN_MINUS:
6599 case BC_INST_ASSIGN:
6600 dbg_exec("BC_INST_ASSIGNxyz:");
6601 s = zbc_program_assign(inst);
6604 case BC_INST_MODEXP:
6605 s = zbc_program_modexp();
6607 case BC_INST_DIVMOD:
6608 s = zbc_program_divmod();
6610 case BC_INST_EXECUTE:
6611 case BC_INST_EXEC_COND:
6612 s = zbc_program_execStr(code, &ip->idx, inst == BC_INST_EXEC_COND);
6614 case BC_INST_PRINT_STACK: {
6616 for (idx = 0; idx < G.prog.results.len; ++idx) {
6617 s = zbc_program_print(BC_INST_PRINT, idx);
6622 case BC_INST_CLEAR_STACK:
6623 bc_vec_pop_all(&G.prog.results);
6625 case BC_INST_STACK_LEN:
6626 bc_program_stackLen();
6628 case BC_INST_DUPLICATE:
6629 if (!BC_PROG_STACK(&G.prog.results, 1))
6630 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6631 ptr = bc_vec_top(&G.prog.results);
6632 bc_result_copy(&r, ptr);
6633 bc_vec_push(&G.prog.results, &r);
6635 case BC_INST_SWAP: {
6637 if (!BC_PROG_STACK(&G.prog.results, 2))
6638 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6639 ptr = bc_vec_item_rev(&G.prog.results, 0);
6640 ptr2 = bc_vec_item_rev(&G.prog.results, 1);
6641 memcpy(&r, ptr, sizeof(BcResult));
6642 memcpy(ptr, ptr2, sizeof(BcResult));
6643 memcpy(ptr2, &r, sizeof(BcResult));
6646 case BC_INST_ASCIIFY:
6647 s = zbc_program_asciify();
6649 case BC_INST_PRINT_STREAM:
6650 s = zbc_program_printStream();
6653 case BC_INST_PUSH_VAR: {
6654 bool copy = inst == BC_INST_LOAD;
6655 s = zbc_program_pushVar(code, &ip->idx, true, copy);
6658 case BC_INST_PUSH_TO_VAR: {
6659 char *name = bc_program_name(code, &ip->idx);
6660 s = zbc_program_copyToVar(name, true);
6665 dbg_exec("BC_INST_NEG:");
6666 if (G.prog.stack.len <= 2)
6667 QUIT_OR_RETURN_TO_MAIN;
6668 bc_vec_npop(&G.prog.stack, 2);
6671 s = zbc_program_nquit();
6676 if (s || G_interrupt) {
6683 // If the stack has changed, pointers may be invalid.
6684 ip = bc_vec_top(&G.prog.stack);
6685 func = bc_program_func(ip->func);
6686 code = func->code.v;
6689 RETURN_STATUS(BC_STATUS_SUCCESS);
6691 #define zbc_program_exec(...) (zbc_program_exec(__VA_ARGS__) COMMA_SUCCESS)
6693 static unsigned bc_vm_envLen(const char *var)
6699 len = BC_NUM_PRINT_WIDTH;
6700 if (!lenv) return len;
6702 len = bb_strtou(lenv, NULL, 10) - 1;
6703 if (errno || len < 2 || len >= INT_MAX)
6704 len = BC_NUM_PRINT_WIDTH;
6709 static BC_STATUS zbc_vm_process(const char *text)
6713 dbg_lex_enter("%s:%d entered", __func__, __LINE__);
6714 s = zbc_parse_text_init(&G.prs, text);
6715 if (s) RETURN_STATUS(s);
6717 while (G.prs.l.t.t != BC_LEX_EOF) {
6718 dbg_lex("%s:%d G.prs.l.t.t:%d", __func__, __LINE__, G.prs.l.t.t);
6719 s = zcommon_parse(&G.prs);
6720 if (s) RETURN_STATUS(s);
6721 s = zbc_program_exec();
6728 dbg_lex_done("%s:%d done", __func__, __LINE__);
6731 #define zbc_vm_process(...) (zbc_vm_process(__VA_ARGS__) COMMA_SUCCESS)
6733 static BC_STATUS zbc_vm_execute_FILE(FILE *fp, const char *filename)
6735 // So far bc/dc have no way to include a file from another file,
6736 // therefore we know G.prog.file == NULL on entry
6737 //const char *sv_file;
6740 G.prog.file = filename;
6742 bc_lex_file(&G.prs.l);
6745 s = zbc_vm_process("");
6746 // We do not stop looping on errors here if reading stdin.
6747 // Example: start interactive bc and enter "return".
6748 // It should say "'return' not in a function"
6749 // but should not exit.
6750 } while (G.input_fp == stdin);
6754 #define zbc_vm_execute_FILE(...) (zbc_vm_execute_FILE(__VA_ARGS__) COMMA_SUCCESS)
6756 static BC_STATUS zbc_vm_file(const char *file)
6761 fp = xfopen_for_read(file);
6762 s = zbc_vm_execute_FILE(fp, file);
6767 #define zbc_vm_file(...) (zbc_vm_file(__VA_ARGS__) COMMA_SUCCESS)
6770 static void bc_vm_info(void)
6772 printf("%s "BB_VER"\n"
6773 "Copyright (c) 2018 Gavin D. Howard and contributors\n"
6777 static void bc_args(char **argv)
6783 #if ENABLE_FEATURE_BC_LONG_OPTIONS
6784 opts = option_mask32 |= getopt32long(argv, "wvsqli",
6785 "warn\0" No_argument "w"
6786 "version\0" No_argument "v"
6787 "standard\0" No_argument "s"
6788 "quiet\0" No_argument "q"
6789 "mathlib\0" No_argument "l"
6790 "interactive\0" No_argument "i"
6793 opts = option_mask32 |= getopt32(argv, "wvsqli");
6795 if (getenv("POSIXLY_CORRECT"))
6796 option_mask32 |= BC_FLAG_S;
6798 if (opts & BC_FLAG_V) {
6803 for (i = optind; argv[i]; ++i)
6804 bc_vec_push(&G.files, argv + i);
6807 static void bc_vm_envArgs(void)
6811 char *env_args = getenv("BC_ENV_ARGS");
6813 if (!env_args) return;
6815 G.env_args = xstrdup(env_args);
6818 bc_vec_init(&v, sizeof(char *), NULL);
6820 while (*(buf = skip_whitespace(buf)) != '\0') {
6821 bc_vec_push(&v, &buf);
6822 buf = skip_non_whitespace(buf);
6828 // NULL terminate, and pass argv[] so that first arg is argv[1]
6829 if (sizeof(int) == sizeof(char*)) {
6830 bc_vec_push(&v, &const_int_0);
6832 static char *const nullptr = NULL;
6833 bc_vec_push(&v, &nullptr);
6835 bc_args(((char **)v.v) - 1);
6840 static const char bc_lib[] ALIGN1 = {
6843 "\n" "auto b,s,n,r,d,i,p,f,v"
6844 ////////////////"if(x<0)return(1/e(-x))" // and drop 'n' and x<0 logic below
6845 //^^^^^^^^^^^^^^^^ this would work, and is even more precise than GNU bc:
6846 //e(-.998896): GNU:.36828580434569428695
6847 // above code:.36828580434569428696
6848 // actual value:.3682858043456942869594...
6849 // but for now let's be "GNU compatible"
6858 "\n" "scale=scale(x)+1"
6868 "\n" "for(i=2;v;++i){"
6874 "\n" "while(d--)r*=r"
6877 "\n" "if(n)return(1/r)"
6881 "\n" "auto b,s,r,p,a,q,i,v"
6885 "\n" "r=(1-10^scale)/1"
6896 "\n" "while(x<=.5){"
6900 "\n" "r=a=(x-1)/(x+1)"
6903 "\n" "for(i=3;v;i+=2){"
6914 "\n" "auto b,s,r,a,q,i"
6915 "\n" "if(x<0)return(-s(-x))"
6919 "\n" "scale=1.1*s+2"
6928 "\n" "for(i=3;a;i+=2){"
6929 "\n" "a*=q/(i*(i-1))"
6942 "\n" "x=s(2*a(1)+x)"
6948 "\n" "auto b,s,r,n,a,m,t,f,i,u"
6956 "\n" "if(scale<65){"
6957 "\n" "if(x==1)return(.7853981633974483096156608458198757210492923498437764552437361480/n)"
6958 "\n" "if(x==.2)return(.1973955598498807583700497651947902934475851037878521015176889402/n)"
6968 "\n" "x=(x-.2)/(1+.2*x)"
6973 "\n" "for(i=3;t;i+=2){"
6980 "\n" "return((m*a+r)/n)"
6982 "\n" "define j(n,x){"
6983 "\n" "auto b,s,o,a,i,v,f"
6994 "\n" "for(i=2;i<=n;++i)a*=i"
6996 "\n" "a=(x^n)/2^n/a"
6999 "\n" "scale+=length(a)-scale(a)"
7000 "\n" "for(i=1;v;++i){"
7001 "\n" "v=v*f/i/(n+i)"
7007 "\n" "return(a*r/1)"
7012 static BC_STATUS zbc_vm_exec(void)
7018 if (option_mask32 & BC_FLAG_L) {
7019 // We know that internal library is not buggy,
7020 // thus error checking is normally disabled.
7021 # define DEBUG_LIB 0
7022 bc_lex_file(&G.prs.l);
7023 s = zbc_vm_process(bc_lib);
7024 if (DEBUG_LIB && s) RETURN_STATUS(s);
7028 s = BC_STATUS_SUCCESS;
7029 for (i = 0; !s && i < G.files.len; ++i)
7030 s = zbc_vm_file(*((char **) bc_vec_item(&G.files, i)));
7031 if (ENABLE_FEATURE_CLEAN_UP && s && !G_ttyin) {
7032 // Debug config, non-interactive mode:
7033 // return all the way back to main.
7034 // Non-debug builds do not come here, they exit.
7038 if (IS_BC || (option_mask32 & BC_FLAG_I))
7039 s = zbc_vm_execute_FILE(stdin, /*filename:*/ NULL);
7043 #define zbc_vm_exec(...) (zbc_vm_exec(__VA_ARGS__) COMMA_SUCCESS)
7045 #if ENABLE_FEATURE_CLEAN_UP
7046 static void bc_program_free(void)
7048 bc_num_free(&G.prog.ob);
7050 bc_num_free(&G.prog.strmb);
7052 bc_vec_free(&G.prog.fns);
7053 bc_vec_free(&G.prog.fn_map);
7054 bc_vec_free(&G.prog.vars);
7055 bc_vec_free(&G.prog.var_map);
7056 bc_vec_free(&G.prog.arrs);
7057 bc_vec_free(&G.prog.arr_map);
7058 bc_vec_free(&G.prog.strs);
7059 bc_vec_free(&G.prog.consts);
7060 bc_vec_free(&G.prog.results);
7061 bc_vec_free(&G.prog.stack);
7062 bc_num_free(&G.prog.last);
7063 bc_num_free(&G.prog.zero);
7064 bc_num_free(&G.prog.one);
7065 bc_vec_free(&G.input_buffer);
7068 static void bc_vm_free(void)
7070 bc_vec_free(&G.files);
7072 bc_parse_free(&G.prs);
7077 static void bc_program_init(void)
7082 // memset(&G.prog, 0, sizeof(G.prog)); - already is
7083 memset(&ip, 0, sizeof(BcInstPtr));
7085 // G.prog.nchars = G.prog.scale = 0; - already is
7088 bc_num_init_DEF_SIZE(&G.prog.ob);
7089 bc_num_ten(&G.prog.ob);
7093 bc_num_init_DEF_SIZE(&G.prog.strmb);
7094 bc_num_ulong2num(&G.prog.strmb, UCHAR_MAX + 1);
7097 bc_num_init_DEF_SIZE(&G.prog.last);
7098 //bc_num_zero(&G.prog.last); - already is
7100 bc_num_init_DEF_SIZE(&G.prog.zero);
7101 //bc_num_zero(&G.prog.zero); - already is
7103 bc_num_init_DEF_SIZE(&G.prog.one);
7104 bc_num_one(&G.prog.one);
7106 bc_vec_init(&G.prog.fns, sizeof(BcFunc), bc_func_free);
7107 bc_vec_init(&G.prog.fn_map, sizeof(BcId), bc_id_free);
7109 bc_program_addFunc(xstrdup("(main)"), &idx);
7110 bc_program_addFunc(xstrdup("(read)"), &idx);
7112 bc_vec_init(&G.prog.vars, sizeof(BcVec), bc_vec_free);
7113 bc_vec_init(&G.prog.var_map, sizeof(BcId), bc_id_free);
7115 bc_vec_init(&G.prog.arrs, sizeof(BcVec), bc_vec_free);
7116 bc_vec_init(&G.prog.arr_map, sizeof(BcId), bc_id_free);
7118 bc_vec_init(&G.prog.strs, sizeof(char *), bc_string_free);
7119 bc_vec_init(&G.prog.consts, sizeof(char *), bc_string_free);
7120 bc_vec_init(&G.prog.results, sizeof(BcResult), bc_result_free);
7121 bc_vec_init(&G.prog.stack, sizeof(BcInstPtr), NULL);
7122 bc_vec_push(&G.prog.stack, &ip);
7124 bc_char_vec_init(&G.input_buffer);
7127 static int bc_vm_init(const char *env_len)
7129 #if ENABLE_FEATURE_EDITING
7130 G.line_input_state = new_line_input_t(DO_HISTORY);
7132 G.prog.len = bc_vm_envLen(env_len);
7134 bc_vec_init(&G.files, sizeof(char *), NULL);
7135 IF_BC(if (IS_BC) bc_vm_envArgs();)
7137 bc_parse_create(&G.prs, BC_PROG_MAIN);
7139 //TODO: in GNU bc, the check is (isatty(0) && isatty(1)),
7140 //-i option unconditionally enables this regardless of isatty():
7142 #if ENABLE_FEATURE_BC_SIGNALS
7144 // With SA_RESTART, most system calls will restart
7145 // (IOW: they won't fail with EINTR).
7146 // In particular, this means ^C won't cause
7147 // stdout to get into "error state" if SIGINT hits
7148 // within write() syscall.
7150 // The downside is that ^C while tty input is taken
7151 // will only be handled after [Enter] since read()
7152 // from stdin is not interrupted by ^C either,
7153 // it restarts, thus fgetc() does not return on ^C.
7154 // (This problem manifests only if line editing is disabled)
7155 signal_SA_RESTART_empty_mask(SIGINT, record_signo);
7157 // Without SA_RESTART, this exhibits a bug:
7158 // "while (1) print 1" and try ^C-ing it.
7159 // Intermittently, instead of returning to input line,
7160 // you'll get "output error: Interrupted system call"
7162 //signal_no_SA_RESTART_empty_mask(SIGINT, record_signo);
7166 return 0; // "not a tty"
7169 static BcStatus bc_vm_run(void)
7171 BcStatus st = zbc_vm_exec();
7172 #if ENABLE_FEATURE_CLEAN_UP
7173 if (G_exiting) // it was actually "halt" or "quit"
7176 # if ENABLE_FEATURE_EDITING
7177 free_line_input_t(G.line_input_state);
7181 dbg_exec("exiting with exitcode %d", st);
7186 int bc_main(int argc, char **argv) MAIN_EXTERNALLY_VISIBLE;
7187 int bc_main(int argc UNUSED_PARAM, char **argv)
7193 is_tty = bc_vm_init("BC_LINE_LENGTH");
7197 if (is_tty && !(option_mask32 & BC_FLAG_Q))
7205 int dc_main(int argc, char **argv) MAIN_EXTERNALLY_VISIBLE;
7206 int dc_main(int argc UNUSED_PARAM, char **argv)
7212 // TODO: dc (GNU bc 1.07.1) 1.4.1 seems to use width
7213 // 1 char wider than bc from the same package.
7214 // Both default width, and xC_LINE_LENGTH=N are wider:
7215 // "DC_LINE_LENGTH=5 dc -e'123456 p'" prints:
7218 // "echo '123456' | BC_LINE_LENGTH=5 bc" prints:
7221 // Do the same, or it's a bug?
7222 bc_vm_init("DC_LINE_LENGTH");
7224 // Run -e'SCRIPT' and -fFILE in order of appearance, then handle FILEs
7225 noscript = BC_FLAG_I;
7227 int n = getopt(argc, argv, "e:f:x");
7233 n = zbc_vm_process(optarg);
7238 n = zbc_vm_file(optarg);
7242 option_mask32 |= DC_FLAG_X;
7252 bc_vec_push(&G.files, argv++);
7255 option_mask32 |= noscript; // set BC_FLAG_I if we need to interpret stdin
7261 #endif // not DC_SMALL