1 /* vi: set sw=4 ts=4: */
3 * Licensed under GPLv2 or later, see file LICENSE in this source tree.
4 * Copyright (c) 2018 Gavin D. Howard and contributors.
7 //config: bool "bc (45 kb; 49 kb when combined with dc)"
10 //config: bc is a command-line, arbitrary-precision calculator with a
11 //config: Turing-complete language. See the GNU bc manual
12 //config: (https://www.gnu.org/software/bc/manual/bc.html) and bc spec
13 //config: (http://pubs.opengroup.org/onlinepubs/9699919799/utilities/bc.html).
15 //config: This bc has five differences to the GNU bc:
16 //config: 1) The period (.) is a shortcut for "last", as in the BSD bc.
17 //config: 2) Arrays are copied before being passed as arguments to
18 //config: functions. This behavior is required by the bc spec.
19 //config: 3) Arrays can be passed to the builtin "length" function to get
20 //config: the number of elements in the array. This prints "1":
21 //config: a[0] = 0; length(a[])
22 //config: 4) The precedence of the boolean "not" operator (!) is equal to
23 //config: that of the unary minus (-) negation operator. This still
24 //config: allows POSIX-compliant scripts to work while somewhat
25 //config: preserving expected behavior (versus C) and making parsing
27 //config: 5) "read()" accepts expressions, not only numeric literals.
30 //config: -i --interactive force interactive mode
31 //config: -q --quiet don't print version and copyright
32 //config: -s --standard error if any non-POSIX extensions are used
33 //config: -w --warn warn if any non-POSIX extensions are used
34 //config: -l --mathlib use predefined math routines:
35 //config: s(expr) sine in radians
36 //config: c(expr) cosine in radians
37 //config: a(expr) arctangent, returning radians
38 //config: l(expr) natural log
39 //config: e(expr) raises e to the power of expr
40 //config: j(n, x) Bessel function of integer order n of x
43 //config: bool "dc (38 kb; 49 kb when combined with bc)"
46 //config: dc is a reverse-polish notation command-line calculator which
47 //config: supports unlimited precision arithmetic. See the FreeBSD man page
48 //config: (https://www.unix.com/man-page/FreeBSD/1/dc/) and GNU dc manual
49 //config: (https://www.gnu.org/software/bc/manual/dc-1.05/html_mono/dc.html).
51 //config: This dc has a few differences from the two above:
52 //config: 1) When printing a byte stream (command "P"), this dc follows what
53 //config: the FreeBSD dc does.
54 //config: 2) Implements the GNU extensions for divmod ("~") and
55 //config: modular exponentiation ("|").
56 //config: 3) Implements all FreeBSD extensions, except for "J" and "M".
57 //config: 4) Like the FreeBSD dc, this dc supports extended registers.
58 //config: However, they are implemented differently. When it encounters
59 //config: whitespace where a register should be, it skips the whitespace.
60 //config: If the character following is not a lowercase letter, an error
61 //config: is issued. Otherwise, the register name is parsed by the
62 //config: following regex:
63 //config: [a-z][a-z0-9_]*
64 //config: This generally means that register names will be surrounded by
65 //config: whitespace. Examples:
66 //config: l idx s temp L index S temp2 < do_thing
67 //config: Also note that, like the FreeBSD dc, extended registers are not
68 //config: allowed unless the "-x" option is given.
70 //config:config FEATURE_DC_SMALL
71 //config: bool "Minimal dc implementation (4.2 kb), not using bc code base"
72 //config: depends on DC && !BC
75 //config:config FEATURE_DC_LIBM
76 //config: bool "Enable power and exp functions (requires libm)"
78 //config: depends on FEATURE_DC_SMALL
80 //config: Enable power and exp functions.
81 //config: NOTE: This will require libm to be present for linking.
83 //config:config FEATURE_BC_SIGNALS
84 //config: bool "Interactive mode (+4kb)"
86 //config: depends on (BC || DC) && !FEATURE_DC_SMALL
88 //config: Enable interactive mode: when started on a tty,
89 //config: ^C interrupts execution and returns to command line,
90 //config: errors also return to command line instead of exiting,
91 //config: line editing with history is available.
93 //config: With this option off, input can still be taken from tty,
94 //config: but all errors are fatal, ^C is fatal,
95 //config: tty is treated exactly the same as any other
96 //config: standard input (IOW: no line editing).
98 //config:config FEATURE_BC_LONG_OPTIONS
99 //config: bool "Enable bc/dc long options"
101 //config: depends on (BC || DC) && !FEATURE_DC_SMALL
103 //config: Enable long options for bc and dc.
105 //applet:IF_BC(APPLET(bc, BB_DIR_USR_BIN, BB_SUID_DROP))
106 //applet:IF_DC(APPLET(dc, BB_DIR_USR_BIN, BB_SUID_DROP))
108 //kbuild:lib-$(CONFIG_BC) += bc.o
109 //kbuild:lib-$(CONFIG_DC) += bc.o
111 //See www.gnu.org/software/bc/manual/bc.html
112 //usage:#define bc_trivial_usage
113 //usage: "[-sqlw] FILE..."
115 //usage:#define bc_full_usage "\n"
116 //usage: "\nArbitrary precision calculator"
118 ///////: "\n -i Interactive" - has no effect for now
119 //usage: "\n -q Quiet"
120 //usage: "\n -l Load standard math library"
121 //usage: "\n -s Be POSIX compatible"
122 //usage: "\n -w Warn if extensions are used"
123 ///////: "\n -v Version"
125 //usage: "\n$BC_LINE_LENGTH changes output width"
127 //usage:#define bc_example_usage
128 //usage: "3 + 4.129\n"
129 //usage: "1903 - 2893\n"
130 //usage: "-129 * 213.28935\n"
131 //usage: "12 / -1932\n"
133 //usage: "34 ^ 189\n"
134 //usage: "scale = 13\n"
135 //usage: "ibase = 2\n"
136 //usage: "obase = A\n"
138 //usage:#define dc_trivial_usage
139 //usage: IF_NOT_FEATURE_DC_SMALL("[-x] ")"[-eSCRIPT]... [-fFILE]... [FILE]..."
141 //usage:#define dc_full_usage "\n"
142 //usage: "\nTiny RPN calculator. Operations:"
143 //usage: "\n+, -, *, /, %, ~, ^," IF_NOT_FEATURE_DC_SMALL(" |,")
144 //usage: "\np - print top of the stack (without popping)"
145 //usage: "\nf - print entire stack"
146 //usage: "\nk - pop the value and set the precision"
147 //usage: "\ni - pop the value and set input radix"
148 //usage: "\no - pop the value and set output radix"
149 //usage: "\nExamples: dc -e'2 2 + p' -> 4, dc -e'8 8 * 2 2 + / p' -> 16"
151 //usage:#define dc_example_usage
152 //usage: "$ dc -e'2 2 + p'\n"
154 //usage: "$ dc -e'8 8 \\* 2 2 + / p'\n"
156 //usage: "$ dc -e'0 1 & p'\n"
158 //usage: "$ dc -e'0 1 | p'\n"
160 //usage: "$ echo '72 9 / 8 * p' | dc\n"
164 #include "common_bufsiz.h"
166 #if ENABLE_FEATURE_DC_SMALL
170 #define DEBUG_LEXER 0
171 #define DEBUG_COMPILE 0
175 static uint8_t lex_indent;
176 #define dbg_lex(...) \
178 fprintf(stderr, "%*s", lex_indent, ""); \
179 bb_error_msg(__VA_ARGS__); \
181 #define dbg_lex_enter(...) \
183 dbg_lex(__VA_ARGS__); \
186 #define dbg_lex_done(...) \
189 dbg_lex(__VA_ARGS__); \
192 # define dbg_lex(...) ((void)0)
193 # define dbg_lex_enter(...) ((void)0)
194 # define dbg_lex_done(...) ((void)0)
198 # define dbg_compile(...) bb_error_msg(__VA_ARGS__)
200 # define dbg_compile(...) ((void)0)
204 # define dbg_exec(...) bb_error_msg(__VA_ARGS__)
206 # define dbg_exec(...) ((void)0)
209 typedef enum BcStatus {
210 BC_STATUS_SUCCESS = 0,
211 BC_STATUS_FAILURE = 1,
212 BC_STATUS_PARSE_EMPTY_EXP = 2, // bc_parse_expr_empty_ok() uses this
215 #define BC_VEC_INVALID_IDX ((size_t) -1)
216 #define BC_VEC_START_CAP (1 << 5)
218 typedef void (*BcVecFree)(void *) FAST_FUNC;
220 typedef struct BcVec {
228 typedef signed char BcDig;
230 typedef struct BcNum {
238 #define BC_NUM_MAX_IBASE ((unsigned long) 16)
239 // larger value might speed up BIGNUM calculations a bit:
240 #define BC_NUM_DEF_SIZE (16)
241 #define BC_NUM_PRINT_WIDTH (69)
243 #define BC_NUM_KARATSUBA_LEN (32)
245 typedef enum BcInst {
274 BC_INST_ASSIGN_POWER,
275 BC_INST_ASSIGN_MULTIPLY,
276 BC_INST_ASSIGN_DIVIDE,
277 BC_INST_ASSIGN_MODULUS,
279 BC_INST_ASSIGN_MINUS,
325 BC_INST_PRINT_STREAM,
340 BC_INST_INVALID = -1,
344 typedef struct BcId {
349 typedef struct BcFunc {
356 typedef enum BcResultType {
360 BC_RESULT_ARRAY_ELEM,
365 //code uses "inst - BC_INST_IBASE + BC_RESULT_IBASE" construct,
366 BC_RESULT_IBASE, // relative order should match for: BC_INST_IBASE
367 BC_RESULT_SCALE, // relative order should match for: BC_INST_SCALE
368 BC_RESULT_LAST, // relative order should match for: BC_INST_LAST
371 BC_RESULT_OBASE, // relative order should match for: BC_INST_OBASE
374 typedef union BcResultData {
380 typedef struct BcResult {
385 typedef struct BcInstPtr {
391 // BC_LEX_NEG is not used in lexing; it is only for parsing.
392 typedef enum BcLexType {
419 BC_LEX_OP_ASSIGN_POWER,
420 BC_LEX_OP_ASSIGN_MULTIPLY,
421 BC_LEX_OP_ASSIGN_DIVIDE,
422 BC_LEX_OP_ASSIGN_MODULUS,
423 BC_LEX_OP_ASSIGN_PLUS,
424 BC_LEX_OP_ASSIGN_MINUS,
437 BC_LEX_LBRACE, // '{' is 0x7B, '}' is 0x7D,
439 BC_LEX_RBRACE, // should be LBRACE+2: code uses (c - '{' + BC_LEX_LBRACE)
445 BC_LEX_KEY_1st_keyword,
446 BC_LEX_KEY_AUTO = BC_LEX_KEY_1st_keyword,
453 // code uses "type - BC_LEX_KEY_IBASE + BC_INST_IBASE" construct,
454 BC_LEX_KEY_IBASE, // relative order should match for: BC_INST_IBASE
456 BC_LEX_KEY_LAST, // relative order should match for: BC_INST_LAST
459 BC_LEX_KEY_OBASE, // relative order should match for: BC_INST_OBASE
486 // code uses "t - BC_LEX_STORE_IBASE + BC_INST_IBASE" construct,
487 BC_LEX_STORE_IBASE, // relative order should match for: BC_INST_IBASE
488 BC_LEX_STORE_SCALE, // relative order should match for: BC_INST_SCALE
492 BC_LEX_STORE_OBASE, // relative order should match for: BC_INST_OBASE
498 // must match order of BC_LEX_KEY_foo etc above
500 struct BcLexKeyword {
503 #define BC_LEX_KW_ENTRY(a, b) \
504 { .name8 = a /*, .posix = b */ }
505 static const struct BcLexKeyword bc_lex_kws[20] = {
506 BC_LEX_KW_ENTRY("auto" , 1), // 0
507 BC_LEX_KW_ENTRY("break" , 1), // 1
508 BC_LEX_KW_ENTRY("continue", 0), // 2 note: this one has no terminating NUL
509 BC_LEX_KW_ENTRY("define" , 1), // 3
510 BC_LEX_KW_ENTRY("else" , 0), // 4
511 BC_LEX_KW_ENTRY("for" , 1), // 5
512 BC_LEX_KW_ENTRY("halt" , 0), // 6
513 BC_LEX_KW_ENTRY("ibase" , 1), // 7
514 BC_LEX_KW_ENTRY("if" , 1), // 8
515 BC_LEX_KW_ENTRY("last" , 0), // 9
516 BC_LEX_KW_ENTRY("length" , 1), // 10
517 BC_LEX_KW_ENTRY("limits" , 0), // 11
518 BC_LEX_KW_ENTRY("obase" , 1), // 12
519 BC_LEX_KW_ENTRY("print" , 0), // 13
520 BC_LEX_KW_ENTRY("quit" , 1), // 14
521 BC_LEX_KW_ENTRY("read" , 0), // 15
522 BC_LEX_KW_ENTRY("return" , 1), // 16
523 BC_LEX_KW_ENTRY("scale" , 1), // 17
524 BC_LEX_KW_ENTRY("sqrt" , 1), // 18
525 BC_LEX_KW_ENTRY("while" , 1), // 19
527 #undef BC_LEX_KW_ENTRY
528 #define STRING_if (bc_lex_kws[8].name8)
529 #define STRING_else (bc_lex_kws[4].name8)
530 #define STRING_while (bc_lex_kws[19].name8)
531 #define STRING_for (bc_lex_kws[5].name8)
555 #define bc_lex_kws_POSIX(i) ((1 << (i)) & POSIX_KWORD_MASK)
557 // This is a bit array that corresponds to token types. An entry is
558 // true if the token is valid in an expression, false otherwise.
559 // Used to figure out when expr parsing should stop *without error message*
560 // - 0 element indicates this condition. 1 means "this token is to be eaten
561 // as part of the expression", token can them still be determined to be invalid
562 // by later processing.
564 #define EXBITS(a,b,c,d,e,f,g,h) \
565 ((uint64_t)((a << 0)+(b << 1)+(c << 2)+(d << 3)+(e << 4)+(f << 5)+(g << 6)+(h << 7)))
566 BC_PARSE_EXPRS_BITS = 0
567 + (EXBITS(0,0,1,1,1,1,1,1) << (0*8)) // 0: eof inval ++ -- - ^ * /
568 + (EXBITS(1,1,1,1,1,1,1,1) << (1*8)) // 8: % + - == <= >= != <
569 + (EXBITS(1,1,1,1,1,1,1,1) << (2*8)) // 16: > ! || && ^= *= /= %=
570 + (EXBITS(1,1,1,0,0,1,1,0) << (3*8)) // 24: += -= = NL WS ( ) [
571 + (EXBITS(0,0,0,0,0,0,1,1) << (4*8)) // 32: , ] { ; } STR NAME NUM
572 + (EXBITS(0,0,0,0,0,0,0,1) << (5*8)) // 40: auto break cont define else for halt ibase
573 + (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?
574 + (EXBITS(0,1,1,0,0,0,0,0) << (7*8)) // 56: return scale sqrt while
577 static ALWAYS_INLINE long bc_parse_exprs(unsigned i)
579 #if ULONG_MAX > 0xffffffff
580 // 64-bit version (will not work correctly for 32-bit longs!)
581 return BC_PARSE_EXPRS_BITS & (1UL << i);
584 unsigned long m = (uint32_t)BC_PARSE_EXPRS_BITS;
586 m = (uint32_t)(BC_PARSE_EXPRS_BITS >> 32);
589 return m & (1UL << i);
593 // This is an array of data for operators that correspond to
594 // [BC_LEX_OP_INC...BC_LEX_OP_ASSIGN] token types.
595 static const uint8_t bc_parse_ops[] = {
596 #define OP(p,l) ((int)(l) * 0x10 + (p))
597 OP(0, false), OP( 0, false ), // inc dec
600 OP(3, true ), OP( 3, true ), OP( 3, true ), // mul div mod
601 OP(4, true ), OP( 4, true ), // + -
602 OP(6, true ), OP( 6, true ), OP( 6, true ), OP( 6, true ), OP( 6, true ), OP( 6, true ), // == <= >= != < >
604 OP(7, true ), OP( 7, true ), // or and
605 OP(5, false), OP( 5, false ), OP( 5, false ), OP( 5, false ), OP( 5, false ), // ^= *= /= %= +=
606 OP(5, false), OP( 5, false ), // -= =
609 #define bc_parse_op_PREC(i) (bc_parse_ops[i] & 0x0f)
610 #define bc_parse_op_LEFT(i) (bc_parse_ops[i] & 0x10)
614 static const //BcInst - should be this type. Using signed narrow type since BC_INST_INVALID is -1
617 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID, BC_INST_REL_GE,
618 BC_INST_INVALID, BC_INST_POWER, BC_INST_MULTIPLY, BC_INST_DIVIDE,
619 BC_INST_MODULUS, BC_INST_PLUS, BC_INST_MINUS,
620 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID,
621 BC_INST_INVALID, BC_INST_INVALID,
622 BC_INST_BOOL_NOT, BC_INST_INVALID, BC_INST_INVALID,
623 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID,
624 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID,
625 BC_INST_INVALID, BC_INST_INVALID, BC_INST_REL_GT, BC_INST_INVALID,
626 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID, BC_INST_REL_GE,
627 BC_INST_INVALID, BC_INST_INVALID,
628 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID,
629 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID,
630 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID, BC_INST_IBASE,
631 BC_INST_INVALID, BC_INST_INVALID, BC_INST_LENGTH, BC_INST_INVALID,
632 BC_INST_OBASE, BC_INST_PRINT, BC_INST_QUIT, BC_INST_INVALID,
633 BC_INST_INVALID, BC_INST_SCALE, BC_INST_SQRT, BC_INST_INVALID,
634 BC_INST_REL_EQ, BC_INST_MODEXP, BC_INST_DIVMOD, BC_INST_INVALID,
635 BC_INST_INVALID, BC_INST_EXECUTE, BC_INST_PRINT_STACK, BC_INST_CLEAR_STACK,
636 BC_INST_STACK_LEN, BC_INST_DUPLICATE, BC_INST_SWAP, BC_INST_POP,
637 BC_INST_ASCIIFY, BC_INST_PRINT_STREAM, BC_INST_INVALID, BC_INST_INVALID,
638 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID,
639 BC_INST_PRINT, BC_INST_NQUIT, BC_INST_SCALE_FUNC,
643 typedef struct BcLex {
656 #define BC_PARSE_STREND (0xff)
658 #define BC_PARSE_REL (1 << 0)
659 #define BC_PARSE_PRINT (1 << 1)
660 #define BC_PARSE_NOCALL (1 << 2)
661 #define BC_PARSE_NOREAD (1 << 3)
662 #define BC_PARSE_ARRAY (1 << 4)
664 typedef struct BcParse {
678 typedef struct BcProgram {
710 #define BC_PROG_MAIN (0)
711 #define BC_PROG_READ (1)
713 #define BC_PROG_REQ_FUNCS (2)
716 #define BC_PROG_STR(n) (!(n)->num && !(n)->cap)
717 #define BC_PROG_NUM(r, n) \
718 ((r)->t != BC_RESULT_ARRAY && (r)->t != BC_RESULT_STR && !BC_PROG_STR(n))
720 #define BC_FLAG_W (1 << 0)
721 #define BC_FLAG_V (1 << 1)
722 #define BC_FLAG_S (1 << 2)
723 #define BC_FLAG_Q (1 << 3)
724 #define BC_FLAG_L (1 << 4)
725 #define BC_FLAG_I (1 << 5)
726 #define DC_FLAG_X (1 << 6)
728 #define BC_MAX(a, b) ((a) > (b) ? (a) : (b))
729 #define BC_MIN(a, b) ((a) < (b) ? (a) : (b))
731 #define BC_MAX_OBASE ((unsigned) 999)
732 #define BC_MAX_DIM ((unsigned) INT_MAX)
733 #define BC_MAX_SCALE ((unsigned) UINT_MAX)
734 #define BC_MAX_STRING ((unsigned) UINT_MAX - 1)
735 #define BC_MAX_NUM BC_MAX_STRING
736 // Unused apart from "limits" message. Just show a "biggish number" there.
737 //#define BC_MAX_NAME BC_MAX_STRING
738 //#define BC_MAX_EXP ((unsigned long) LONG_MAX)
739 //#define BC_MAX_VARS ((unsigned long) SIZE_MAX - 1)
740 #define BC_MAX_NAME_STR "999999999"
741 #define BC_MAX_EXP_STR "999999999"
742 #define BC_MAX_VARS_STR "999999999"
744 #define BC_MAX_OBASE_STR "999"
746 #if INT_MAX == 2147483647
747 # define BC_MAX_DIM_STR "2147483647"
748 #elif INT_MAX == 9223372036854775807
749 # define BC_MAX_DIM_STR "9223372036854775807"
751 # error Strange INT_MAX
754 #if UINT_MAX == 4294967295
755 # define BC_MAX_SCALE_STR "4294967295"
756 # define BC_MAX_STRING_STR "4294967294"
757 #elif UINT_MAX == 18446744073709551615
758 # define BC_MAX_SCALE_STR "18446744073709551615"
759 # define BC_MAX_STRING_STR "18446744073709551614"
761 # error Strange UINT_MAX
763 #define BC_MAX_NUM_STR BC_MAX_STRING_STR
766 IF_FEATURE_BC_SIGNALS(smallint ttyin;)
767 IF_FEATURE_CLEAN_UP(smallint exiting;)
773 // For error messages. Can be set to current parsed line,
774 // or [TODO] to current executing line (can be before last parsed one)
783 #if ENABLE_FEATURE_EDITING
784 line_input_t *line_input_state;
787 #define G (*ptr_to_globals)
788 #define INIT_G() do { \
789 SET_PTR_TO_GLOBALS(xzalloc(sizeof(G))); \
791 #define FREE_G() do { \
792 FREE_PTR_TO_GLOBALS(); \
794 #define G_posix (ENABLE_BC && (option_mask32 & BC_FLAG_S))
795 #define G_warn (ENABLE_BC && (option_mask32 & BC_FLAG_W))
796 #define G_exreg (ENABLE_DC && (option_mask32 & DC_FLAG_X))
797 #if ENABLE_FEATURE_BC_SIGNALS
798 # define G_interrupt bb_got_signal
799 # define G_ttyin G.ttyin
801 # define G_interrupt 0
804 #if ENABLE_FEATURE_CLEAN_UP
805 # define G_exiting G.exiting
809 #define IS_BC (ENABLE_BC && (!ENABLE_DC || applet_name[0] == 'b'))
810 #define IS_DC (ENABLE_DC && (!ENABLE_BC || applet_name[0] != 'b'))
812 // In configurations where errors abort instead of propagating error
813 // return code up the call chain, functions returning BC_STATUS
814 // actually don't return anything, they always succeed and return "void".
815 // A macro wrapper is provided, which makes this statement work:
817 // and makes it visible to the compiler that s is always zero,
818 // allowing compiler to optimize dead code after the statement.
820 // To make code more readable, each such function has a "z"
821 // ("always returning zero") prefix, i.e. zbc_foo or zdc_foo.
823 #if ENABLE_FEATURE_BC_SIGNALS || ENABLE_FEATURE_CLEAN_UP
824 # define ERRORS_ARE_FATAL 0
825 # define ERRORFUNC /*nothing*/
826 # define IF_ERROR_RETURN_POSSIBLE(a) a
827 # define BC_STATUS BcStatus
828 # define RETURN_STATUS(v) return (v)
829 # define COMMA_SUCCESS /*nothing*/
831 # define ERRORS_ARE_FATAL 1
832 # define ERRORFUNC NORETURN
833 # define IF_ERROR_RETURN_POSSIBLE(a) /*nothing*/
834 # define BC_STATUS void
835 # define RETURN_STATUS(v) do { ((void)(v)); return; } while (0)
836 # define COMMA_SUCCESS ,BC_STATUS_SUCCESS
839 #define STACK_HAS_MORE_THAN(s, n) ((s)->len > ((size_t)(n)))
840 #define STACK_HAS_EQUAL_OR_MORE_THAN(s, n) ((s)->len >= ((size_t)(n)))
842 #define BC_NUM_NEG(n, neg) ((((ssize_t)(n)) ^ -((ssize_t)(neg))) + (neg))
843 #define BC_NUM_ONE(n) ((n)->len == 1 && (n)->rdx == 0 && (n)->num[0] == 1)
844 #define BC_NUM_INT(n) ((n)->len - (n)->rdx)
845 //#define BC_NUM_AREQ(a, b) (BC_MAX((a)->rdx, (b)->rdx) + BC_MAX(BC_NUM_INT(a), BC_NUM_INT(b)) + 1)
846 static /*ALWAYS_INLINE*/ size_t BC_NUM_AREQ(BcNum *a, BcNum *b)
848 return BC_MAX(a->rdx, b->rdx) + BC_MAX(BC_NUM_INT(a), BC_NUM_INT(b)) + 1;
850 //#define BC_NUM_MREQ(a, b, scale) (BC_NUM_INT(a) + BC_NUM_INT(b) + BC_MAX((scale), (a)->rdx + (b)->rdx) + 1)
851 static /*ALWAYS_INLINE*/ size_t BC_NUM_MREQ(BcNum *a, BcNum *b, size_t scale)
853 return BC_NUM_INT(a) + BC_NUM_INT(b) + BC_MAX(scale, a->rdx + b->rdx) + 1;
856 typedef void (*BcNumDigitOp)(size_t, size_t, bool) FAST_FUNC;
858 typedef BC_STATUS (*BcNumBinaryOp)(BcNum *, BcNum *, BcNum *, size_t) FAST_FUNC;
860 static BC_STATUS zbc_num_binary(BcNum *a, BcNum *b, BcNum *c, size_t scale,
861 BcNumBinaryOp op, size_t req);
862 static FAST_FUNC BC_STATUS zbc_num_a(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale);
863 static FAST_FUNC BC_STATUS zbc_num_s(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale);
864 static FAST_FUNC BC_STATUS zbc_num_p(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale);
865 static FAST_FUNC BC_STATUS zbc_num_m(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale);
866 static FAST_FUNC BC_STATUS zbc_num_d(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale);
867 static FAST_FUNC BC_STATUS zbc_num_rem(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale);
869 static FAST_FUNC BC_STATUS zbc_num_add(BcNum *a, BcNum *b, BcNum *c, size_t scale)
871 BcNumBinaryOp op = (!a->neg == !b->neg) ? zbc_num_a : zbc_num_s;
873 RETURN_STATUS(zbc_num_binary(a, b, c, false, op, BC_NUM_AREQ(a, b)));
876 static FAST_FUNC BC_STATUS zbc_num_sub(BcNum *a, BcNum *b, BcNum *c, size_t scale)
878 BcNumBinaryOp op = (!a->neg == !b->neg) ? zbc_num_s : zbc_num_a;
880 RETURN_STATUS(zbc_num_binary(a, b, c, true, op, BC_NUM_AREQ(a, b)));
883 static FAST_FUNC BC_STATUS zbc_num_mul(BcNum *a, BcNum *b, BcNum *c, size_t scale)
885 size_t req = BC_NUM_MREQ(a, b, scale);
886 RETURN_STATUS(zbc_num_binary(a, b, c, scale, zbc_num_m, req));
889 static FAST_FUNC BC_STATUS zbc_num_div(BcNum *a, BcNum *b, BcNum *c, size_t scale)
891 size_t req = BC_NUM_MREQ(a, b, scale);
892 RETURN_STATUS(zbc_num_binary(a, b, c, scale, zbc_num_d, req));
895 static FAST_FUNC BC_STATUS zbc_num_mod(BcNum *a, BcNum *b, BcNum *c, size_t scale)
897 size_t req = BC_NUM_MREQ(a, b, scale);
898 RETURN_STATUS(zbc_num_binary(a, b, c, scale, zbc_num_rem, req));
901 static FAST_FUNC BC_STATUS zbc_num_pow(BcNum *a, BcNum *b, BcNum *c, size_t scale)
903 RETURN_STATUS(zbc_num_binary(a, b, c, scale, zbc_num_p, a->len * b->len + 1));
906 static const BcNumBinaryOp zbc_program_ops[] = {
907 zbc_num_pow, zbc_num_mul, zbc_num_div, zbc_num_mod, zbc_num_add, zbc_num_sub,
909 #define zbc_num_add(...) (zbc_num_add(__VA_ARGS__) COMMA_SUCCESS)
910 #define zbc_num_sub(...) (zbc_num_sub(__VA_ARGS__) COMMA_SUCCESS)
911 #define zbc_num_mul(...) (zbc_num_mul(__VA_ARGS__) COMMA_SUCCESS)
912 #define zbc_num_div(...) (zbc_num_div(__VA_ARGS__) COMMA_SUCCESS)
913 #define zbc_num_mod(...) (zbc_num_mod(__VA_ARGS__) COMMA_SUCCESS)
914 #define zbc_num_pow(...) (zbc_num_pow(__VA_ARGS__) COMMA_SUCCESS)
916 static void fflush_and_check(void)
919 if (ferror(stdout) || ferror(stderr))
920 bb_perror_msg_and_die("output error");
923 #if ENABLE_FEATURE_CLEAN_UP
924 #define QUIT_OR_RETURN_TO_MAIN \
926 IF_FEATURE_BC_SIGNALS(G_ttyin = 0;) /* do not loop in main loop anymore */ \
928 return BC_STATUS_FAILURE; \
931 #define QUIT_OR_RETURN_TO_MAIN quit()
934 static void quit(void) NORETURN;
935 static void quit(void)
938 bb_perror_msg_and_die("input error");
940 dbg_exec("quit(): exiting with exitcode SUCCESS");
944 static void bc_verror_msg(const char *fmt, va_list p)
946 const char *sv = sv; // for compiler
949 applet_name = xasprintf("%s: %s:%u", applet_name, G.prog.file, G.err_line);
951 bb_verror_msg(fmt, p, NULL);
953 free((char*)applet_name);
958 static NOINLINE ERRORFUNC int bc_error_fmt(const char *fmt, ...)
963 bc_verror_msg(fmt, p);
966 if (ENABLE_FEATURE_CLEAN_UP || G_ttyin)
967 IF_ERROR_RETURN_POSSIBLE(return BC_STATUS_FAILURE);
972 static NOINLINE int bc_posix_error_fmt(const char *fmt, ...)
976 // Are non-POSIX constructs totally ok?
977 if (!(option_mask32 & (BC_FLAG_S|BC_FLAG_W)))
978 return BC_STATUS_SUCCESS; // yes
981 bc_verror_msg(fmt, p);
984 // Do we treat non-POSIX constructs as errors?
985 if (!(option_mask32 & BC_FLAG_S))
986 return BC_STATUS_SUCCESS; // no, it's a warning
987 if (ENABLE_FEATURE_CLEAN_UP || G_ttyin)
988 return BC_STATUS_FAILURE;
993 // We use error functions with "return bc_error(FMT[, PARAMS])" idiom.
994 // This idiom begs for tail-call optimization, but for it to work,
995 // function must not have caller-cleaned parameters on stack.
996 // Unfortunately, vararg function API does exactly that on most arches.
997 // Thus, use these shims for the cases when we have no vararg PARAMS:
998 static ERRORFUNC int bc_error(const char *msg)
1000 IF_ERROR_RETURN_POSSIBLE(return) bc_error_fmt("%s", msg);
1002 static ERRORFUNC int bc_error_bad_character(char c)
1005 IF_ERROR_RETURN_POSSIBLE(return) bc_error("NUL character");
1006 IF_ERROR_RETURN_POSSIBLE(return) bc_error_fmt("bad character '%c'", c);
1008 static ERRORFUNC int bc_error_bad_expression(void)
1010 IF_ERROR_RETURN_POSSIBLE(return) bc_error("bad expression");
1012 static ERRORFUNC int bc_error_bad_token(void)
1014 IF_ERROR_RETURN_POSSIBLE(return) bc_error("bad token");
1016 static ERRORFUNC int bc_error_stack_has_too_few_elements(void)
1018 IF_ERROR_RETURN_POSSIBLE(return) bc_error("stack has too few elements");
1020 static ERRORFUNC int bc_error_variable_is_wrong_type(void)
1022 IF_ERROR_RETURN_POSSIBLE(return) bc_error("variable is wrong type");
1024 static ERRORFUNC int bc_error_nested_read_call(void)
1026 IF_ERROR_RETURN_POSSIBLE(return) bc_error("read() call inside of a read() call");
1029 static int bc_POSIX_requires(const char *msg)
1031 return bc_posix_error_fmt("POSIX requires %s", msg);
1033 static int bc_POSIX_does_not_allow(const char *msg)
1035 return bc_posix_error_fmt("%s%s", "POSIX does not allow ", msg);
1037 static int bc_POSIX_does_not_allow_bool_ops_this_is_bad(const char *msg)
1039 return bc_posix_error_fmt("%s%s %s", "POSIX does not allow ", "boolean operators; the following is bad:", msg);
1041 static int bc_POSIX_does_not_allow_empty_X_expression_in_for(const char *msg)
1043 return bc_posix_error_fmt("%san empty %s expression in a for loop", "POSIX does not allow ", msg);
1047 static void bc_vec_grow(BcVec *v, size_t n)
1049 size_t cap = v->cap * 2;
1050 while (cap < v->len + n) cap *= 2;
1051 v->v = xrealloc(v->v, v->size * cap);
1055 static void bc_vec_init(BcVec *v, size_t esize, BcVecFree dtor)
1058 v->cap = BC_VEC_START_CAP;
1061 v->v = xmalloc(esize * BC_VEC_START_CAP);
1064 static void bc_char_vec_init(BcVec *v)
1066 bc_vec_init(v, sizeof(char), NULL);
1069 static void bc_vec_expand(BcVec *v, size_t req)
1072 v->v = xrealloc(v->v, v->size * req);
1077 static void bc_vec_pop(BcVec *v)
1081 v->dtor(v->v + (v->size * v->len));
1084 static void bc_vec_npop(BcVec *v, size_t n)
1089 size_t len = v->len - n;
1090 while (v->len > len) v->dtor(v->v + (v->size * --v->len));
1094 static void bc_vec_pop_all(BcVec *v)
1096 bc_vec_npop(v, v->len);
1099 static void bc_vec_push(BcVec *v, const void *data)
1101 if (v->len + 1 > v->cap) bc_vec_grow(v, 1);
1102 memmove(v->v + (v->size * v->len), data, v->size);
1106 static void bc_vec_pushByte(BcVec *v, char data)
1108 bc_vec_push(v, &data);
1111 static void bc_vec_pushZeroByte(BcVec *v)
1113 //bc_vec_pushByte(v, '\0');
1115 bc_vec_push(v, &const_int_0);
1118 static void bc_vec_pushAt(BcVec *v, const void *data, size_t idx)
1121 bc_vec_push(v, data);
1125 if (v->len == v->cap) bc_vec_grow(v, 1);
1127 ptr = v->v + v->size * idx;
1129 memmove(ptr + v->size, ptr, v->size * (v->len++ - idx));
1130 memmove(ptr, data, v->size);
1134 static void bc_vec_string(BcVec *v, size_t len, const char *str)
1137 bc_vec_expand(v, len + 1);
1138 memcpy(v->v, str, len);
1141 bc_vec_pushZeroByte(v);
1144 #if ENABLE_FEATURE_BC_SIGNALS && ENABLE_FEATURE_EDITING
1145 static void bc_vec_concat(BcVec *v, const char *str)
1149 if (v->len == 0) bc_vec_pushZeroByte(v);
1152 len = v->len + slen;
1154 if (v->cap < len) bc_vec_grow(v, slen);
1155 strcpy(v->v + v->len - 1, str);
1161 static void *bc_vec_item(const BcVec *v, size_t idx)
1163 return v->v + v->size * idx;
1166 static char** bc_program_str(size_t idx)
1168 return bc_vec_item(&G.prog.strs, idx);
1171 static BcFunc* bc_program_func(size_t idx)
1173 return bc_vec_item(&G.prog.fns, idx);
1175 // BC_PROG_MAIN is zeroth element, so:
1176 #define bc_program_func_BC_PROG_MAIN() ((BcFunc*)(G.prog.fns.v))
1178 static void *bc_vec_item_rev(const BcVec *v, size_t idx)
1180 return v->v + v->size * (v->len - idx - 1);
1183 static void *bc_vec_top(const BcVec *v)
1185 return v->v + v->size * (v->len - 1);
1188 static FAST_FUNC void bc_vec_free(void *vec)
1190 BcVec *v = (BcVec *) vec;
1195 static int bc_id_cmp(const void *e1, const void *e2)
1197 return strcmp(((const BcId *) e1)->name, ((const BcId *) e2)->name);
1200 static FAST_FUNC void bc_id_free(void *id)
1202 free(((BcId *) id)->name);
1205 static size_t bc_map_find_ge(const BcVec *v, const void *ptr)
1207 size_t low = 0, high = v->len;
1209 while (low < high) {
1210 size_t mid = (low + high) / 2;
1211 BcId *id = bc_vec_item(v, mid);
1212 int result = bc_id_cmp(ptr, id);
1225 static int bc_map_insert(BcVec *v, const void *ptr, size_t *i)
1227 size_t n = *i = bc_map_find_ge(v, ptr);
1230 bc_vec_push(v, ptr);
1231 else if (!bc_id_cmp(ptr, bc_vec_item(v, n)))
1232 return 0; // "was not inserted"
1234 bc_vec_pushAt(v, ptr, n);
1235 return 1; // "was inserted"
1239 static size_t bc_map_find_exact(const BcVec *v, const void *ptr)
1241 size_t i = bc_map_find_ge(v, ptr);
1242 if (i >= v->len) return BC_VEC_INVALID_IDX;
1243 return bc_id_cmp(ptr, bc_vec_item(v, i)) ? BC_VEC_INVALID_IDX : i;
1247 static int bad_input_byte(char c)
1249 if ((c < ' ' && c != '\t' && c != '\r' && c != '\n') // also allow '\v' '\f'?
1252 bc_error_fmt("illegal character 0x%02x", c);
1258 // Note: it _appends_ data from fp to vec.
1259 static void bc_read_line(BcVec *vec, FILE *fp)
1264 #if ENABLE_FEATURE_BC_SIGNALS
1265 if (G_interrupt) { // ^C was pressed
1268 // ^C while running a script (bc SCRIPT): die.
1269 // We do not return to interactive prompt:
1270 // user might be running us from a shell,
1271 // and SCRIPT might be intended to terminate
1272 // (e.g. contain a "halt" stmt).
1273 // ^C dropping user into a bc prompt instead of
1274 // the shell would be unexpected.
1277 // ^C while interactive input
1279 // GNU bc says "interrupted execution."
1280 // GNU dc says "Interrupt!"
1281 fputs("\ninterrupted execution\n", stderr);
1284 # if ENABLE_FEATURE_EDITING
1285 if (G_ttyin && fp == stdin) {
1287 # define line_buf bb_common_bufsiz1
1288 n = read_line_input(G.line_input_state, "", line_buf, COMMON_BUFSIZE);
1289 if (n <= 0) { // read errors or EOF, or ^D, or ^C
1292 bc_vec_pushZeroByte(vec); // ^D or EOF (or error)
1297 char c = line_buf[i++];
1299 if (bad_input_byte(c)) goto again;
1301 bc_vec_concat(vec, line_buf);
1309 size_t len = vec->len;
1312 #if ENABLE_FEATURE_BC_SIGNALS
1314 // ^C was pressed: ignore entire line, get another one
1319 do c = fgetc(fp); while (c == '\0');
1322 bb_perror_msg_and_die("input error");
1323 // Note: EOF does not append '\n'
1326 bad_chars |= bad_input_byte(c);
1327 bc_vec_pushByte(vec, (char)c);
1328 } while (c != '\n');
1331 // Bad chars on this line
1332 if (!G.prog.file) { // stdin
1333 // ignore entire line, get another one
1337 bb_perror_msg_and_die("file '%s' is not text", G.prog.file);
1339 bc_vec_pushZeroByte(vec);
1343 static void bc_num_setToZero(BcNum *n, size_t scale)
1350 static void bc_num_zero(BcNum *n)
1352 bc_num_setToZero(n, 0);
1355 static void bc_num_one(BcNum *n)
1357 bc_num_setToZero(n, 0);
1362 // Note: this also sets BcNum to zero
1363 static void bc_num_init(BcNum *n, size_t req)
1365 req = req >= BC_NUM_DEF_SIZE ? req : BC_NUM_DEF_SIZE;
1366 //memset(n, 0, sizeof(BcNum)); - cleared by assignments below
1367 n->num = xmalloc(req);
1374 static void bc_num_init_DEF_SIZE(BcNum *n)
1376 bc_num_init(n, BC_NUM_DEF_SIZE);
1379 static void bc_num_expand(BcNum *n, size_t req)
1381 req = req >= BC_NUM_DEF_SIZE ? req : BC_NUM_DEF_SIZE;
1383 n->num = xrealloc(n->num, req);
1388 static FAST_FUNC void bc_num_free(void *num)
1390 free(((BcNum *) num)->num);
1393 static void bc_num_copy(BcNum *d, BcNum *s)
1396 bc_num_expand(d, s->cap);
1400 memcpy(d->num, s->num, sizeof(BcDig) * d->len);
1404 static BC_STATUS zbc_num_ulong(BcNum *n, unsigned long *result_p)
1407 unsigned long pow, result;
1409 if (n->neg) RETURN_STATUS(bc_error("negative number"));
1411 for (result = 0, pow = 1, i = n->rdx; i < n->len; ++i) {
1412 unsigned long prev = result, powprev = pow;
1414 result += ((unsigned long) n->num[i]) * pow;
1417 if (result < prev || pow < powprev)
1418 RETURN_STATUS(bc_error("overflow"));
1424 RETURN_STATUS(BC_STATUS_SUCCESS);
1426 #define zbc_num_ulong(...) (zbc_num_ulong(__VA_ARGS__) COMMA_SUCCESS)
1428 static void bc_num_ulong2num(BcNum *n, unsigned long val)
1434 if (val == 0) return;
1436 if (ULONG_MAX == 0xffffffffUL)
1437 bc_num_expand(n, 10); // 10 digits: 4294967295
1438 if (ULONG_MAX == 0xffffffffffffffffULL)
1439 bc_num_expand(n, 20); // 20 digits: 18446744073709551615
1440 BUILD_BUG_ON(ULONG_MAX > 0xffffffffffffffffULL);
1447 if (val == 0) break;
1451 static void bc_num_subArrays(BcDig *restrict a, BcDig *restrict b, size_t len)
1454 for (i = 0; i < len; ++i) {
1456 for (j = i; a[j] < 0;) {
1463 static ssize_t bc_num_compare(BcDig *restrict a, BcDig *restrict b, size_t len)
1481 static ssize_t bc_num_cmp(BcNum *a, BcNum *b)
1483 size_t i, min, a_int, b_int, diff;
1484 BcDig *max_num, *min_num;
1488 if (a == b) return 0;
1489 if (a->len == 0) return BC_NUM_NEG(!!b->len, !b->neg);
1490 if (b->len == 0) return BC_NUM_NEG(1, a->neg);
1492 if (a->neg != b->neg) // signs of a and b differ
1493 // +a,-b = a>b = 1 or -a,+b = a<b = -1
1494 return (int)b->neg - (int)a->neg;
1495 neg = a->neg; // 1 if both negative, 0 if both positive
1497 a_int = BC_NUM_INT(a);
1498 b_int = BC_NUM_INT(b);
1501 if (a_int != 0) return (ssize_t) a_int;
1503 a_max = (a->rdx > b->rdx);
1506 diff = a->rdx - b->rdx;
1507 max_num = a->num + diff;
1509 // neg = (a_max == neg); - NOP (maps 1->1 and 0->0)
1512 diff = b->rdx - a->rdx;
1513 max_num = b->num + diff;
1515 neg = !neg; // same as "neg = (a_max == neg)"
1518 cmp = bc_num_compare(max_num, min_num, b_int + min);
1519 if (cmp != 0) return BC_NUM_NEG(cmp, neg);
1521 for (max_num -= diff, i = diff - 1; i < diff; --i) {
1522 if (max_num[i]) return BC_NUM_NEG(1, neg);
1528 static void bc_num_truncate(BcNum *n, size_t places)
1530 if (places == 0) return;
1536 memmove(n->num, n->num + places, n->len * sizeof(BcDig));
1540 static void bc_num_extend(BcNum *n, size_t places)
1542 size_t len = n->len + places;
1545 if (n->cap < len) bc_num_expand(n, len);
1547 memmove(n->num + places, n->num, sizeof(BcDig) * n->len);
1548 memset(n->num, 0, sizeof(BcDig) * places);
1555 static void bc_num_clean(BcNum *n)
1557 while (n->len > 0 && n->num[n->len - 1] == 0) --n->len;
1560 else if (n->len < n->rdx)
1564 static void bc_num_retireMul(BcNum *n, size_t scale, bool neg1, bool neg2)
1567 bc_num_extend(n, scale - n->rdx);
1569 bc_num_truncate(n, n->rdx - scale);
1572 if (n->len != 0) n->neg = !neg1 != !neg2;
1575 static void bc_num_split(BcNum *restrict n, size_t idx, BcNum *restrict a,
1579 b->len = n->len - idx;
1581 a->rdx = b->rdx = 0;
1583 memcpy(b->num, n->num + idx, b->len * sizeof(BcDig));
1584 memcpy(a->num, n->num, idx * sizeof(BcDig));
1594 static BC_STATUS zbc_num_shift(BcNum *n, size_t places)
1596 if (places == 0 || n->len == 0) RETURN_STATUS(BC_STATUS_SUCCESS);
1598 // This check makes sense only if size_t is (much) larger than BC_MAX_NUM.
1599 if (SIZE_MAX > (BC_MAX_NUM | 0xff)) {
1600 if (places + n->len > BC_MAX_NUM)
1601 RETURN_STATUS(bc_error("number too long: must be [1,"BC_MAX_NUM_STR"]"));
1604 if (n->rdx >= places)
1607 bc_num_extend(n, places - n->rdx);
1613 RETURN_STATUS(BC_STATUS_SUCCESS);
1615 #define zbc_num_shift(...) (zbc_num_shift(__VA_ARGS__) COMMA_SUCCESS)
1617 static BC_STATUS zbc_num_inv(BcNum *a, BcNum *b, size_t scale)
1626 RETURN_STATUS(zbc_num_div(&one, a, b, scale));
1628 #define zbc_num_inv(...) (zbc_num_inv(__VA_ARGS__) COMMA_SUCCESS)
1630 static FAST_FUNC BC_STATUS zbc_num_a(BcNum *a, BcNum *b, BcNum *restrict c, size_t sub)
1632 BcDig *ptr, *ptr_a, *ptr_b, *ptr_c;
1633 size_t i, max, min_rdx, min_int, diff, a_int, b_int;
1636 // Because this function doesn't need to use scale (per the bc spec),
1637 // I am hijacking it to say whether it's doing an add or a subtract.
1641 if (sub && c->len) c->neg = !c->neg;
1642 RETURN_STATUS(BC_STATUS_SUCCESS);
1646 RETURN_STATUS(BC_STATUS_SUCCESS);
1650 c->rdx = BC_MAX(a->rdx, b->rdx);
1651 min_rdx = BC_MIN(a->rdx, b->rdx);
1654 if (a->rdx > b->rdx) {
1655 diff = a->rdx - b->rdx;
1657 ptr_a = a->num + diff;
1660 diff = b->rdx - a->rdx;
1663 ptr_b = b->num + diff;
1667 for (i = 0; i < diff; ++i, ++c->len)
1671 a_int = BC_NUM_INT(a);
1672 b_int = BC_NUM_INT(b);
1674 if (a_int > b_int) {
1685 for (i = 0; i < min_rdx + min_int; ++i) {
1686 unsigned in = (unsigned)ptr_a[i] + (unsigned)ptr_b[i] + carry;
1688 ptr_c[i] = (BcDig)(in % 10);
1690 for (; i < max + min_rdx; ++i) {
1691 unsigned in = (unsigned)ptr[i] + carry;
1693 ptr_c[i] = (BcDig)(in % 10);
1697 if (carry != 0) c->num[c->len++] = (BcDig) carry;
1699 RETURN_STATUS(BC_STATUS_SUCCESS); // can't make void, see zbc_num_binary()
1702 static FAST_FUNC BC_STATUS zbc_num_s(BcNum *a, BcNum *b, BcNum *restrict c, size_t sub)
1705 BcNum *minuend, *subtrahend;
1707 bool aneg, bneg, neg;
1709 // Because this function doesn't need to use scale (per the bc spec),
1710 // I am hijacking it to say whether it's doing an add or a subtract.
1714 if (sub && c->len) c->neg = !c->neg;
1715 RETURN_STATUS(BC_STATUS_SUCCESS);
1719 RETURN_STATUS(BC_STATUS_SUCCESS);
1724 a->neg = b->neg = false;
1726 cmp = bc_num_cmp(a, b);
1732 bc_num_setToZero(c, BC_MAX(a->rdx, b->rdx));
1733 RETURN_STATUS(BC_STATUS_SUCCESS);
1741 if (sub) neg = !neg;
1746 bc_num_copy(c, minuend);
1749 if (c->rdx < subtrahend->rdx) {
1750 bc_num_extend(c, subtrahend->rdx - c->rdx);
1753 start = c->rdx - subtrahend->rdx;
1755 bc_num_subArrays(c->num + start, subtrahend->num, subtrahend->len);
1759 RETURN_STATUS(BC_STATUS_SUCCESS); // can't make void, see zbc_num_binary()
1762 static FAST_FUNC BC_STATUS zbc_num_k(BcNum *restrict a, BcNum *restrict b,
1764 #define zbc_num_k(...) (zbc_num_k(__VA_ARGS__) COMMA_SUCCESS)
1767 size_t max = BC_MAX(a->len, b->len), max2 = (max + 1) / 2;
1768 BcNum l1, h1, l2, h2, m2, m1, z0, z1, z2, temp;
1771 if (a->len == 0 || b->len == 0) {
1773 RETURN_STATUS(BC_STATUS_SUCCESS);
1775 aone = BC_NUM_ONE(a);
1776 if (aone || BC_NUM_ONE(b)) {
1777 bc_num_copy(c, aone ? b : a);
1778 RETURN_STATUS(BC_STATUS_SUCCESS);
1781 if (a->len + b->len < BC_NUM_KARATSUBA_LEN
1782 || a->len < BC_NUM_KARATSUBA_LEN
1783 || b->len < BC_NUM_KARATSUBA_LEN
1787 bc_num_expand(c, a->len + b->len + 1);
1789 memset(c->num, 0, sizeof(BcDig) * c->cap);
1792 for (i = 0; i < b->len; ++i) {
1794 for (j = 0; j < a->len; ++j) {
1795 unsigned in = c->num[i + j];
1796 in += (unsigned)a->num[j] * (unsigned)b->num[i] + carry;
1797 // note: compilers prefer _unsigned_ div/const
1799 c->num[i + j] = (BcDig)(in % 10);
1802 c->num[i + j] += (BcDig) carry;
1803 len = BC_MAX(len, i + j + !!carry);
1805 #if ENABLE_FEATURE_BC_SIGNALS
1807 // a*a <- without check below, this will not be interruptible
1808 if (G_interrupt) return BC_STATUS_FAILURE;
1814 RETURN_STATUS(BC_STATUS_SUCCESS);
1817 bc_num_init(&l1, max);
1818 bc_num_init(&h1, max);
1819 bc_num_init(&l2, max);
1820 bc_num_init(&h2, max);
1821 bc_num_init(&m1, max);
1822 bc_num_init(&m2, max);
1823 bc_num_init(&z0, max);
1824 bc_num_init(&z1, max);
1825 bc_num_init(&z2, max);
1826 bc_num_init(&temp, max + max);
1828 bc_num_split(a, max2, &l1, &h1);
1829 bc_num_split(b, max2, &l2, &h2);
1831 s = zbc_num_add(&h1, &l1, &m1, 0);
1833 s = zbc_num_add(&h2, &l2, &m2, 0);
1836 s = zbc_num_k(&h1, &h2, &z0);
1838 s = zbc_num_k(&m1, &m2, &z1);
1840 s = zbc_num_k(&l1, &l2, &z2);
1843 s = zbc_num_sub(&z1, &z0, &temp, 0);
1845 s = zbc_num_sub(&temp, &z2, &z1, 0);
1848 s = zbc_num_shift(&z0, max2 * 2);
1850 s = zbc_num_shift(&z1, max2);
1852 s = zbc_num_add(&z0, &z1, &temp, 0);
1854 s = zbc_num_add(&temp, &z2, c, 0);
1869 static FAST_FUNC BC_STATUS zbc_num_m(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale)
1873 size_t maxrdx = BC_MAX(a->rdx, b->rdx);
1875 scale = BC_MAX(scale, a->rdx);
1876 scale = BC_MAX(scale, b->rdx);
1877 scale = BC_MIN(a->rdx + b->rdx, scale);
1878 maxrdx = BC_MAX(maxrdx, scale);
1880 bc_num_init(&cpa, a->len);
1881 bc_num_init(&cpb, b->len);
1883 bc_num_copy(&cpa, a);
1884 bc_num_copy(&cpb, b);
1885 cpa.neg = cpb.neg = false;
1887 s = zbc_num_shift(&cpa, maxrdx);
1889 s = zbc_num_shift(&cpb, maxrdx);
1891 s = zbc_num_k(&cpa, &cpb, c);
1895 bc_num_expand(c, c->len + maxrdx);
1897 if (c->len < maxrdx) {
1898 memset(c->num + c->len, 0, (c->cap - c->len) * sizeof(BcDig));
1903 bc_num_retireMul(c, scale, a->neg, b->neg);
1909 #define zbc_num_m(...) (zbc_num_m(__VA_ARGS__) COMMA_SUCCESS)
1911 static FAST_FUNC BC_STATUS zbc_num_d(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale)
1918 RETURN_STATUS(bc_error("divide by zero"));
1920 bc_num_setToZero(c, scale);
1921 RETURN_STATUS(BC_STATUS_SUCCESS);
1923 if (BC_NUM_ONE(b)) {
1925 bc_num_retireMul(c, scale, a->neg, b->neg);
1926 RETURN_STATUS(BC_STATUS_SUCCESS);
1929 bc_num_init(&cp, BC_NUM_MREQ(a, b, scale));
1930 bc_num_copy(&cp, a);
1934 bc_num_expand(&cp, len + 2);
1935 bc_num_extend(&cp, len - cp.len);
1938 if (b->rdx > cp.rdx) bc_num_extend(&cp, b->rdx - cp.rdx);
1940 if (scale > cp.rdx) bc_num_extend(&cp, scale - cp.rdx);
1942 if (b->rdx == b->len) {
1944 if (len == 0) break;
1946 if (b->num[len] != 0)
1952 if (cp.cap == cp.len) bc_num_expand(&cp, cp.len + 1);
1954 // We want an extra zero in front to make things simpler.
1955 cp.num[cp.len++] = 0;
1958 bc_num_expand(c, cp.len);
1961 memset(c->num + end, 0, (c->cap - end) * sizeof(BcDig));
1965 s = BC_STATUS_SUCCESS;
1966 for (i = end - 1; i < end; --i) {
1969 for (q = 0; n[len] != 0 || bc_num_compare(n, b->num, len) >= 0; ++q)
1970 bc_num_subArrays(n, b->num, len);
1972 #if ENABLE_FEATURE_BC_SIGNALS
1975 // 1/a <- without check below, this will not be interruptible
1977 s = BC_STATUS_FAILURE;
1983 bc_num_retireMul(c, scale, a->neg, b->neg);
1988 #define zbc_num_d(...) (zbc_num_d(__VA_ARGS__) COMMA_SUCCESS)
1990 static FAST_FUNC BC_STATUS zbc_num_r(BcNum *a, BcNum *b, BcNum *restrict c,
1991 BcNum *restrict d, size_t scale, size_t ts)
1998 RETURN_STATUS(bc_error("divide by zero"));
2001 bc_num_setToZero(d, ts);
2002 RETURN_STATUS(BC_STATUS_SUCCESS);
2005 bc_num_init(&temp, d->cap);
2006 s = zbc_num_d(a, b, c, scale);
2009 if (scale != 0) scale = ts;
2011 s = zbc_num_m(c, b, &temp, scale);
2013 s = zbc_num_sub(a, &temp, d, scale);
2016 if (ts > d->rdx && d->len) bc_num_extend(d, ts - d->rdx);
2019 bc_num_retireMul(d, ts, a->neg, b->neg);
2025 #define zbc_num_r(...) (zbc_num_r(__VA_ARGS__) COMMA_SUCCESS)
2027 static FAST_FUNC BC_STATUS zbc_num_rem(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale)
2031 size_t ts = BC_MAX(scale + b->rdx, a->rdx), len = BC_NUM_MREQ(a, b, ts);
2033 bc_num_init(&c1, len);
2034 s = zbc_num_r(a, b, &c1, c, scale, ts);
2039 #define zbc_num_rem(...) (zbc_num_rem(__VA_ARGS__) COMMA_SUCCESS)
2041 static FAST_FUNC BC_STATUS zbc_num_p(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale)
2043 BcStatus s = BC_STATUS_SUCCESS;
2046 size_t i, powrdx, resrdx;
2049 if (b->rdx) RETURN_STATUS(bc_error("non integer number"));
2053 RETURN_STATUS(BC_STATUS_SUCCESS);
2056 bc_num_setToZero(c, scale);
2057 RETURN_STATUS(BC_STATUS_SUCCESS);
2059 if (BC_NUM_ONE(b)) {
2063 s = zbc_num_inv(a, c, scale);
2070 s = zbc_num_ulong(b, &pow);
2071 if (s) RETURN_STATUS(s);
2073 bc_num_init(©, a->len);
2074 bc_num_copy(©, a);
2079 if (a->rdx * pow < scale)
2080 scale = a->rdx * pow;
2085 for (powrdx = a->rdx; !(pow & 1); pow >>= 1) {
2087 s = zbc_num_mul(©, ©, ©, powrdx);
2089 // Not needed: zbc_num_mul() has a check for ^C:
2090 //if (G_interrupt) {
2091 // s = BC_STATUS_FAILURE;
2096 bc_num_copy(c, ©);
2098 for (resrdx = powrdx, pow >>= 1; pow != 0; pow >>= 1) {
2100 s = zbc_num_mul(©, ©, ©, powrdx);
2105 s = zbc_num_mul(c, ©, c, resrdx);
2108 // Not needed: zbc_num_mul() has a check for ^C:
2109 //if (G_interrupt) {
2110 // s = BC_STATUS_FAILURE;
2116 s = zbc_num_inv(c, c, scale);
2120 if (c->rdx > scale) bc_num_truncate(c, c->rdx - scale);
2122 // We can't use bc_num_clean() here.
2123 for (i = 0; i < c->len; ++i)
2126 bc_num_setToZero(c, scale);
2133 #define zbc_num_p(...) (zbc_num_p(__VA_ARGS__) COMMA_SUCCESS)
2135 static BC_STATUS zbc_num_binary(BcNum *a, BcNum *b, BcNum *c, size_t scale,
2136 BcNumBinaryOp op, size_t req)
2139 BcNum num2, *ptr_a, *ptr_b;
2144 memcpy(ptr_a, c, sizeof(BcNum));
2152 memcpy(ptr_b, c, sizeof(BcNum));
2159 bc_num_init(c, req);
2161 bc_num_expand(c, req);
2163 s = BC_STATUS_SUCCESS;
2164 IF_ERROR_RETURN_POSSIBLE(s =) op(ptr_a, ptr_b, c, scale);
2166 if (init) bc_num_free(&num2);
2170 #define zbc_num_binary(...) (zbc_num_binary(__VA_ARGS__) COMMA_SUCCESS)
2172 static bool bc_num_strValid(const char *val, size_t base)
2177 b = (BcDig)(base <= 10 ? base + '0' : base - 10 + 'A');
2184 if (radix) return false;
2188 if (c < '0' || c >= b || (c > '9' && c < 'A'))
2194 // Note: n is already "bc_num_zero()"ed,
2195 // leading zeroes in "val" are removed
2196 static void bc_num_parseDecimal(BcNum *n, const char *val)
2205 bc_num_expand(n, len);
2207 ptr = strchr(val, '.');
2211 n->rdx = (size_t)((val + len) - (ptr + 1));
2213 for (i = 0; val[i]; ++i) {
2214 if (val[i] != '0' && val[i] != '.') {
2215 // Not entirely zero value - convert it, and exit
2218 n->num[n->len] = val[i] - '0';
2222 if (val[--i] == '.') goto skip_dot;
2227 // if for() exits without hitting if(), the value is entirely zero
2230 // Note: n is already "bc_num_zero()"ed,
2231 // leading zeroes in "val" are removed
2232 static void bc_num_parseBase(BcNum *n, const char *val, unsigned base_t)
2235 BcNum temp, mult, result;
2241 for (i = 0; ; ++i) {
2244 if (val[i] != '.' && val[i] != '0')
2248 bc_num_init_DEF_SIZE(&temp);
2249 bc_num_init_DEF_SIZE(&mult);
2250 //TODO: have BcNumSmall type, with static buffer
2251 bc_num_init_DEF_SIZE(&base);
2252 bc_num_ulong2num(&base, base_t);
2256 if (c == '\0') goto int_err;
2257 if (c == '.') break;
2259 v = (unsigned long) (c <= '9' ? c - '0' : c - 'A' + 10);
2261 s = zbc_num_mul(n, &base, &mult, 0);
2262 if (s) goto int_err;
2263 bc_num_ulong2num(&temp, v);
2264 s = zbc_num_add(&mult, &temp, n, 0);
2265 if (s) goto int_err;
2268 bc_num_init(&result, base.len);
2269 //bc_num_zero(&result); - already is
2275 if (c == '\0') break;
2278 v = (unsigned long) (c <= '9' ? c - '0' : c - 'A' + 10);
2280 s = zbc_num_mul(&result, &base, &result, 0);
2282 bc_num_ulong2num(&temp, v);
2283 s = zbc_num_add(&result, &temp, &result, 0);
2285 s = zbc_num_mul(&mult, &base, &mult, 0);
2289 s = zbc_num_div(&result, &mult, &result, digits);
2291 s = zbc_num_add(n, &result, n, digits);
2295 if (n->rdx < digits)
2296 bc_num_extend(n, digits - n->rdx);
2300 bc_num_free(&result);
2307 static BC_STATUS zbc_num_parse(BcNum *n, const char *val, unsigned base_t)
2309 if (!bc_num_strValid(val, base_t))
2310 RETURN_STATUS(bc_error("bad number string"));
2313 while (*val == '0') val++;
2316 bc_num_parseDecimal(n, val);
2318 bc_num_parseBase(n, val, base_t);
2320 RETURN_STATUS(BC_STATUS_SUCCESS);
2322 #define zbc_num_parse(...) (zbc_num_parse(__VA_ARGS__) COMMA_SUCCESS)
2324 static BC_STATUS zbc_num_sqrt(BcNum *a, BcNum *restrict b, size_t scale)
2327 BcNum num1, num2, half, f, fprime, *x0, *x1, *temp;
2328 size_t pow, len, digs, digs1, resrdx, req, times = 0;
2329 ssize_t cmp = 1, cmp1 = SSIZE_MAX, cmp2 = SSIZE_MAX;
2331 req = BC_MAX(scale, a->rdx) + ((BC_NUM_INT(a) + 1) >> 1) + 1;
2332 bc_num_expand(b, req);
2335 bc_num_setToZero(b, scale);
2336 RETURN_STATUS(BC_STATUS_SUCCESS);
2339 RETURN_STATUS(bc_error("negative number"));
2341 if (BC_NUM_ONE(a)) {
2343 bc_num_extend(b, scale);
2344 RETURN_STATUS(BC_STATUS_SUCCESS);
2347 scale = BC_MAX(scale, a->rdx) + 1;
2348 len = a->len + scale;
2350 bc_num_init(&num1, len);
2351 bc_num_init(&num2, len);
2352 bc_num_init_DEF_SIZE(&half);
2358 bc_num_init(&f, len);
2359 bc_num_init(&fprime, len);
2365 pow = BC_NUM_INT(a);
2373 pow -= 2 - (pow & 1);
2375 bc_num_extend(x0, pow);
2377 // Make sure to move the radix back.
2381 x0->rdx = digs = digs1 = 0;
2383 len = BC_NUM_INT(x0) + resrdx - 1;
2385 while (cmp != 0 || digs < len) {
2386 s = zbc_num_div(a, x0, &f, resrdx);
2388 s = zbc_num_add(x0, &f, &fprime, resrdx);
2390 s = zbc_num_mul(&fprime, &half, x1, resrdx);
2393 cmp = bc_num_cmp(x1, x0);
2394 digs = x1->len - (unsigned long long) llabs(cmp);
2396 if (cmp == cmp2 && digs == digs1)
2401 resrdx += times > 4;
2414 if (b->rdx > scale) bc_num_truncate(b, b->rdx - scale);
2416 bc_num_free(&fprime);
2423 #define zbc_num_sqrt(...) (zbc_num_sqrt(__VA_ARGS__) COMMA_SUCCESS)
2425 static BC_STATUS zbc_num_divmod(BcNum *a, BcNum *b, BcNum *c, BcNum *d,
2431 size_t ts = BC_MAX(scale + b->rdx, a->rdx), len = BC_NUM_MREQ(a, b, ts);
2434 memcpy(&num2, c, sizeof(BcNum));
2436 bc_num_init(c, len);
2440 bc_num_expand(c, len);
2443 s = zbc_num_r(ptr_a, b, c, d, scale, ts);
2445 if (init) bc_num_free(&num2);
2449 #define zbc_num_divmod(...) (zbc_num_divmod(__VA_ARGS__) COMMA_SUCCESS)
2452 static BC_STATUS zbc_num_modexp(BcNum *a, BcNum *b, BcNum *c, BcNum *restrict d)
2455 BcNum base, exp, two, temp;
2458 RETURN_STATUS(bc_error("divide by zero"));
2459 if (a->rdx || b->rdx || c->rdx)
2460 RETURN_STATUS(bc_error("non integer number"));
2462 RETURN_STATUS(bc_error("negative number"));
2464 bc_num_expand(d, c->len);
2465 bc_num_init(&base, c->len);
2466 bc_num_init(&exp, b->len);
2467 bc_num_init_DEF_SIZE(&two);
2468 bc_num_init(&temp, b->len);
2474 s = zbc_num_rem(a, c, &base, 0);
2476 bc_num_copy(&exp, b);
2478 while (exp.len != 0) {
2479 s = zbc_num_divmod(&exp, &two, &exp, &temp, 0);
2482 if (BC_NUM_ONE(&temp)) {
2483 s = zbc_num_mul(d, &base, &temp, 0);
2485 s = zbc_num_rem(&temp, c, d, 0);
2489 s = zbc_num_mul(&base, &base, &temp, 0);
2491 s = zbc_num_rem(&temp, c, &base, 0);
2501 #define zbc_num_modexp(...) (zbc_num_modexp(__VA_ARGS__) COMMA_SUCCESS)
2505 static BC_STATUS zbc_func_insert(BcFunc *f, char *name, bool var)
2511 autoid = (void*)f->autos.v;
2512 for (i = 0; i < f->autos.len; i++, autoid++) {
2513 if (strcmp(name, autoid->name) == 0)
2514 RETURN_STATUS(bc_error("function parameter or auto var has the same name as another"));
2520 bc_vec_push(&f->autos, &a);
2522 RETURN_STATUS(BC_STATUS_SUCCESS);
2524 #define zbc_func_insert(...) (zbc_func_insert(__VA_ARGS__) COMMA_SUCCESS)
2527 static void bc_func_init(BcFunc *f)
2529 bc_char_vec_init(&f->code);
2530 bc_vec_init(&f->autos, sizeof(BcId), bc_id_free);
2531 bc_vec_init(&f->labels, sizeof(size_t), NULL);
2535 static FAST_FUNC void bc_func_free(void *func)
2537 BcFunc *f = (BcFunc *) func;
2538 bc_vec_free(&f->code);
2539 bc_vec_free(&f->autos);
2540 bc_vec_free(&f->labels);
2543 static void bc_array_expand(BcVec *a, size_t len);
2545 static void bc_array_init(BcVec *a, bool nums)
2548 bc_vec_init(a, sizeof(BcNum), bc_num_free);
2550 bc_vec_init(a, sizeof(BcVec), bc_vec_free);
2551 bc_array_expand(a, 1);
2554 static void bc_array_expand(BcVec *a, size_t len)
2556 if (a->dtor == bc_num_free
2557 // && a->size == sizeof(BcNum) - always true
2560 while (len > a->len) {
2561 bc_num_init_DEF_SIZE(&n);
2566 while (len > a->len) {
2567 bc_array_init(&v, true);
2573 static void bc_array_copy(BcVec *d, const BcVec *s)
2579 bc_vec_expand(d, s->cap);
2584 for (i = 0; i < s->len; i++, dnum++, snum++) {
2585 bc_num_init(dnum, snum->len);
2586 bc_num_copy(dnum, snum);
2590 static FAST_FUNC void bc_string_free(void *string)
2592 free(*((char **) string));
2596 static void bc_result_copy(BcResult *d, BcResult *src)
2601 case BC_RESULT_TEMP:
2602 case BC_RESULT_IBASE:
2603 case BC_RESULT_SCALE:
2604 case BC_RESULT_OBASE:
2605 bc_num_init(&d->d.n, src->d.n.len);
2606 bc_num_copy(&d->d.n, &src->d.n);
2609 case BC_RESULT_ARRAY:
2610 case BC_RESULT_ARRAY_ELEM:
2611 d->d.id.name = xstrdup(src->d.id.name);
2613 case BC_RESULT_CONSTANT:
2614 case BC_RESULT_LAST:
2617 memcpy(&d->d.n, &src->d.n, sizeof(BcNum));
2623 static FAST_FUNC void bc_result_free(void *result)
2625 BcResult *r = (BcResult *) result;
2628 case BC_RESULT_TEMP:
2629 case BC_RESULT_IBASE:
2630 case BC_RESULT_SCALE:
2631 case BC_RESULT_OBASE:
2632 bc_num_free(&r->d.n);
2635 case BC_RESULT_ARRAY:
2636 case BC_RESULT_ARRAY_ELEM:
2645 static void bc_lex_lineComment(BcLex *l)
2647 // Try: echo -n '#foo' | bc
2649 l->t.t = BC_LEX_WHITESPACE;
2651 while (i < l->len && l->buf[i] != '\n')
2656 static void bc_lex_whitespace(BcLex *l)
2658 l->t.t = BC_LEX_WHITESPACE;
2660 char c = l->buf[l->i];
2661 if (c == '\n') // this is BC_LEX_NLINE, not BC_LEX_WHITESPACE
2669 static BC_STATUS zbc_lex_number(BcLex *l, char start)
2671 const char *buf = l->buf + l->i;
2672 size_t len, i, ccnt;
2675 pt = (start == '.');
2676 l->t.t = BC_LEX_NUMBER;
2682 if (c == '\\' && buf[i + 1] == '\n') {
2684 //number_of_backslashes++ - see comment below
2687 if (!isdigit(c) && (c < 'A' || c > 'F')) {
2688 if (c != '.') break;
2689 // if '.' was already seen, stop on second one:
2693 // buf[i] is one of "0-9A-F."
2698 //ccnt is the number of chars in the number string, excluding possible
2699 //trailing "[\<newline>].[\<newline>]" (with any number of \<NL> repetitions).
2700 //i is buf[i] index of the first not-yet-parsed char after that.
2703 // This might overestimate the size, if there are "\<NL>"'s
2704 // in the number. Subtracting number_of_backslashes*2 correctly
2705 // is not that easy: consider that in the case of "NNN.\<NL>"
2706 // loop above will count "\<NL>" before it realizes it is not
2707 // in fact *inside* the number:
2708 len = ccnt + 1; // +1 byte for NUL termination
2710 // This check makes sense only if size_t is (much) larger than BC_MAX_NUM.
2711 if (SIZE_MAX > (BC_MAX_NUM | 0xff)) {
2712 if (len > BC_MAX_NUM)
2713 RETURN_STATUS(bc_error("number too long: must be [1,"BC_MAX_NUM_STR"]"));
2716 bc_vec_pop_all(&l->t.v);
2717 bc_vec_expand(&l->t.v, 1 + len);
2718 bc_vec_push(&l->t.v, &start);
2721 // If we have hit a backslash, skip it. We don't have
2722 // to check for a newline because it's guaranteed.
2728 bc_vec_push(&l->t.v, buf);
2733 bc_vec_pushZeroByte(&l->t.v);
2735 RETURN_STATUS(BC_STATUS_SUCCESS);
2737 #define zbc_lex_number(...) (zbc_lex_number(__VA_ARGS__) COMMA_SUCCESS)
2739 static void bc_lex_name(BcLex *l)
2744 l->t.t = BC_LEX_NAME;
2747 buf = l->buf + l->i - 1;
2750 if ((c < 'a' || c > 'z') && !isdigit(c) && c != '_') break;
2754 #if 0 // We do not protect against people with gigabyte-long names
2755 // This check makes sense only if size_t is (much) larger than BC_MAX_STRING.
2756 if (SIZE_MAX > (BC_MAX_STRING | 0xff)) {
2757 if (i > BC_MAX_STRING)
2758 return bc_error("name too long: must be [1,"BC_MAX_STRING_STR"]");
2761 bc_vec_string(&l->t.v, i, buf);
2763 // Increment the index. We minus 1 because it has already been incremented.
2766 //return BC_STATUS_SUCCESS;
2769 static void bc_lex_init(BcLex *l)
2771 bc_char_vec_init(&l->t.v);
2774 static void bc_lex_free(BcLex *l)
2776 bc_vec_free(&l->t.v);
2779 static void bc_lex_file(BcLex *l)
2781 G.err_line = l->line = 1;
2785 IF_BC(static BC_STATUS zbc_lex_token(BcLex *l);)
2786 IF_DC(static BC_STATUS zdc_lex_token(BcLex *l);)
2788 static BC_STATUS zcommon_lex_token(BcLex *l)
2791 IF_BC(RETURN_STATUS(zbc_lex_token(l));)
2793 IF_DC(RETURN_STATUS(zdc_lex_token(l));)
2795 #define zcommon_lex_token(...) (zcommon_lex_token(__VA_ARGS__) COMMA_SUCCESS)
2797 static bool bc_lex_more_input(BcLex *l)
2802 bc_vec_pop_all(&G.input_buffer);
2804 // This loop is complex because the vm tries not to send any lines that end
2805 // with a backslash to the parser. The reason for that is because the parser
2806 // treats a backslash+newline combo as whitespace, per the bc spec. In that
2807 // case, and for strings and comments, the parser will expect more stuff.
2811 size_t prevlen = G.input_buffer.len;
2814 bc_read_line(&G.input_buffer, G.input_fp);
2815 // No more input means EOF
2816 if (G.input_buffer.len <= prevlen + 1) // (we expect +1 for NUL byte)
2819 string = G.input_buffer.v + prevlen;
2822 if (string == G.input_buffer.v || string[-1] != '\\') {
2833 if (c == '/' && *string == '*') {
2838 if (c == '*' && *string == '/') {
2843 if (str != 0 || comment) {
2844 G.input_buffer.len--; // backstep over the trailing NUL byte
2848 // Check for backslash+newline.
2849 // we do not check that last char is '\n' -
2850 // if it is not, then it's EOF, and looping back
2851 // to bc_read_line() will detect it:
2853 if (string >= G.input_buffer.v && *string == '\\') {
2854 G.input_buffer.len--;
2861 l->buf = G.input_buffer.v;
2863 // bb_error_msg("G.input_buffer.len:%d '%s'", G.input_buffer.len, G.input_buffer.v);
2864 l->len = G.input_buffer.len - 1; // do not include NUL
2869 static BC_STATUS zbc_lex_next(BcLex *l)
2874 if (l->t.last == BC_LEX_EOF) RETURN_STATUS(bc_error("end of file"));
2876 l->line += l->newline;
2877 G.err_line = l->line;
2880 // Loop until failure or we don't have whitespace. This
2881 // is so the parser doesn't get inundated with whitespace.
2882 // Comments are also BC_LEX_WHITESPACE tokens and eaten here.
2883 s = BC_STATUS_SUCCESS;
2885 if (l->i == l->len) {
2886 l->t.t = BC_LEX_EOF;
2888 RETURN_STATUS(BC_STATUS_SUCCESS);
2889 if (!bc_lex_more_input(l)) {
2891 RETURN_STATUS(BC_STATUS_SUCCESS);
2893 // here it's guaranteed that l->i is below l->len
2895 dbg_lex("next string to parse:'%.*s'",
2896 (int)(strchrnul(l->buf + l->i, '\n') - (l->buf + l->i)),
2898 s = zcommon_lex_token(l);
2899 } while (!s && l->t.t == BC_LEX_WHITESPACE);
2900 dbg_lex("l->t.t from string:%d", l->t.t);
2904 #define zbc_lex_next(...) (zbc_lex_next(__VA_ARGS__) COMMA_SUCCESS)
2906 static BC_STATUS zbc_lex_skip_if_at_NLINE(BcLex *l)
2908 if (l->t.t == BC_LEX_NLINE)
2909 RETURN_STATUS(zbc_lex_next(l));
2910 RETURN_STATUS(BC_STATUS_SUCCESS);
2912 #define zbc_lex_skip_if_at_NLINE(...) (zbc_lex_skip_if_at_NLINE(__VA_ARGS__) COMMA_SUCCESS)
2914 static BC_STATUS zbc_lex_next_and_skip_NLINE(BcLex *l)
2917 s = zbc_lex_next(l);
2918 if (s) RETURN_STATUS(s);
2919 // if(cond)<newline>stmt is accepted too (but not 2+ newlines)
2920 s = zbc_lex_skip_if_at_NLINE(l);
2923 #define zbc_lex_next_and_skip_NLINE(...) (zbc_lex_next_and_skip_NLINE(__VA_ARGS__) COMMA_SUCCESS)
2925 static BC_STATUS zbc_lex_text_init(BcLex *l, const char *text)
2929 l->len = strlen(text);
2930 l->t.t = l->t.last = BC_LEX_INVALID;
2931 RETURN_STATUS(zbc_lex_next(l));
2933 #define zbc_lex_text_init(...) (zbc_lex_text_init(__VA_ARGS__) COMMA_SUCCESS)
2936 static BC_STATUS zbc_lex_identifier(BcLex *l)
2940 const char *buf = l->buf + l->i - 1;
2942 for (i = 0; i < ARRAY_SIZE(bc_lex_kws); ++i) {
2943 const char *keyword8 = bc_lex_kws[i].name8;
2945 while (buf[j] != '\0' && buf[j] == keyword8[j]) {
2947 if (j == 8) goto match;
2949 if (keyword8[j] != '\0')
2952 // buf starts with keyword bc_lex_kws[i]
2953 l->t.t = BC_LEX_KEY_1st_keyword + i;
2954 if (!bc_lex_kws_POSIX(i)) {
2955 s = bc_posix_error_fmt("%sthe '%.8s' keyword", "POSIX does not allow ", bc_lex_kws[i].name8);
2956 IF_ERROR_RETURN_POSSIBLE(if (s) RETURN_STATUS(s));
2959 // We minus 1 because the index has already been incremented.
2961 RETURN_STATUS(BC_STATUS_SUCCESS);
2965 s = BC_STATUS_SUCCESS;
2967 if (l->t.v.len > 2) {
2970 // bc: POSIX only allows one character names; the following is bad: 'qwe=1
2972 unsigned len = strchrnul(buf, '\n') - buf;
2973 s = bc_posix_error_fmt("POSIX only allows one character names; the following is bad: '%.*s'", len, buf);
2978 #define zbc_lex_identifier(...) (zbc_lex_identifier(__VA_ARGS__) COMMA_SUCCESS)
2980 static BC_STATUS zbc_lex_string(BcLex *l)
2984 l->t.t = BC_LEX_STR;
2992 RETURN_STATUS(bc_error("string end could not be found"));
3001 // This check makes sense only if size_t is (much) larger than BC_MAX_STRING.
3002 if (SIZE_MAX > (BC_MAX_STRING | 0xff)) {
3003 if (len > BC_MAX_STRING)
3004 RETURN_STATUS(bc_error("string too long: must be [1,"BC_MAX_STRING_STR"]"));
3006 bc_vec_string(&l->t.v, len, l->buf + l->i);
3010 G.err_line = l->line;
3012 RETURN_STATUS(BC_STATUS_SUCCESS);
3014 #define zbc_lex_string(...) (zbc_lex_string(__VA_ARGS__) COMMA_SUCCESS)
3016 static void bc_lex_assign(BcLex *l, unsigned with_and_without)
3018 if (l->buf[l->i] == '=') {
3020 with_and_without >>= 8; // store "with" value
3021 } // else store "without" value
3022 l->t.t = (with_and_without & 0xff);
3024 #define bc_lex_assign(l, with, without) \
3025 bc_lex_assign(l, ((with)<<8)|(without))
3027 static BC_STATUS zbc_lex_comment(BcLex *l)
3030 const char *buf = l->buf;
3032 l->t.t = BC_LEX_WHITESPACE;
3033 i = l->i; /* here buf[l->i] is the '*' of opening comment delimiter */
3045 RETURN_STATUS(bc_error("comment end could not be found"));
3052 G.err_line = l->line;
3054 RETURN_STATUS(BC_STATUS_SUCCESS);
3056 #define zbc_lex_comment(...) (zbc_lex_comment(__VA_ARGS__) COMMA_SUCCESS)
3058 static BC_STATUS zbc_lex_token(BcLex *l)
3060 BcStatus s = BC_STATUS_SUCCESS;
3061 char c = l->buf[l->i++], c2;
3063 // This is the workhorse of the lexer.
3065 // case '\0': // probably never reached
3067 // l->t.t = BC_LEX_EOF;
3068 // l->newline = true;
3071 l->t.t = BC_LEX_NLINE;
3079 bc_lex_whitespace(l);
3082 bc_lex_assign(l, BC_LEX_OP_REL_NE, BC_LEX_OP_BOOL_NOT);
3083 if (l->t.t == BC_LEX_OP_BOOL_NOT) {
3084 s = bc_POSIX_does_not_allow_bool_ops_this_is_bad("!");
3085 IF_ERROR_RETURN_POSSIBLE(if (s) RETURN_STATUS(s));
3089 s = zbc_lex_string(l);
3092 s = bc_POSIX_does_not_allow("'#' script comments");
3093 IF_ERROR_RETURN_POSSIBLE(if (s) RETURN_STATUS(s));
3094 bc_lex_lineComment(l);
3097 bc_lex_assign(l, BC_LEX_OP_ASSIGN_MODULUS, BC_LEX_OP_MODULUS);
3102 s = bc_POSIX_does_not_allow_bool_ops_this_is_bad("&&");
3103 IF_ERROR_RETURN_POSSIBLE(if (s) RETURN_STATUS(s));
3105 l->t.t = BC_LEX_OP_BOOL_AND;
3107 l->t.t = BC_LEX_INVALID;
3108 s = bc_error_bad_character('&');
3113 l->t.t = (BcLexType)(c - '(' + BC_LEX_LPAREN);
3116 bc_lex_assign(l, BC_LEX_OP_ASSIGN_MULTIPLY, BC_LEX_OP_MULTIPLY);
3122 l->t.t = BC_LEX_OP_INC;
3124 bc_lex_assign(l, BC_LEX_OP_ASSIGN_PLUS, BC_LEX_OP_PLUS);
3127 l->t.t = BC_LEX_COMMA;
3133 l->t.t = BC_LEX_OP_DEC;
3135 bc_lex_assign(l, BC_LEX_OP_ASSIGN_MINUS, BC_LEX_OP_MINUS);
3138 if (isdigit(l->buf[l->i]))
3139 s = zbc_lex_number(l, c);
3141 l->t.t = BC_LEX_KEY_LAST;
3142 s = bc_POSIX_does_not_allow("a period ('.') as a shortcut for the last result");
3148 s = zbc_lex_comment(l);
3150 bc_lex_assign(l, BC_LEX_OP_ASSIGN_DIVIDE, BC_LEX_OP_DIVIDE);
3168 s = zbc_lex_number(l, c);
3171 l->t.t = BC_LEX_SCOLON;
3174 bc_lex_assign(l, BC_LEX_OP_REL_LE, BC_LEX_OP_REL_LT);
3177 bc_lex_assign(l, BC_LEX_OP_REL_EQ, BC_LEX_OP_ASSIGN);
3180 bc_lex_assign(l, BC_LEX_OP_REL_GE, BC_LEX_OP_REL_GT);
3184 l->t.t = (BcLexType)(c - '[' + BC_LEX_LBRACKET);
3187 if (l->buf[l->i] == '\n') {
3188 l->t.t = BC_LEX_WHITESPACE;
3191 s = bc_error_bad_character(c);
3194 bc_lex_assign(l, BC_LEX_OP_ASSIGN_POWER, BC_LEX_OP_POWER);
3222 s = zbc_lex_identifier(l);
3226 l->t.t = (BcLexType)(c - '{' + BC_LEX_LBRACE);
3231 s = bc_POSIX_does_not_allow_bool_ops_this_is_bad("||");
3232 IF_ERROR_RETURN_POSSIBLE(if (s) RETURN_STATUS(s));
3234 l->t.t = BC_LEX_OP_BOOL_OR;
3236 l->t.t = BC_LEX_INVALID;
3237 s = bc_error_bad_character(c);
3241 l->t.t = BC_LEX_INVALID;
3242 s = bc_error_bad_character(c);
3251 static BC_STATUS zdc_lex_register(BcLex *l)
3253 if (isspace(l->buf[l->i - 1])) {
3254 bc_lex_whitespace(l);
3257 RETURN_STATUS(bc_error("extended register"));
3261 bc_vec_pop_all(&l->t.v);
3262 bc_vec_push(&l->t.v, &l->buf[l->i - 1]);
3263 bc_vec_pushZeroByte(&l->t.v);
3264 l->t.t = BC_LEX_NAME;
3267 RETURN_STATUS(BC_STATUS_SUCCESS);
3269 #define zdc_lex_register(...) (zdc_lex_register(__VA_ARGS__) COMMA_SUCCESS)
3271 static BC_STATUS zdc_lex_string(BcLex *l)
3273 size_t depth, nls, i;
3275 l->t.t = BC_LEX_STR;
3276 bc_vec_pop_all(&l->t.v);
3285 RETURN_STATUS(bc_error("string end could not be found"));
3288 if (i == l->i || l->buf[i - 1] != '\\') {
3289 if (c == '[') depth++;
3294 bc_vec_push(&l->t.v, &l->buf[i]);
3299 bc_vec_pushZeroByte(&l->t.v);
3300 // This check makes sense only if size_t is (much) larger than BC_MAX_STRING.
3301 if (SIZE_MAX > (BC_MAX_STRING | 0xff)) {
3302 if (i - l->i > BC_MAX_STRING)
3303 RETURN_STATUS(bc_error("string too long: must be [1,"BC_MAX_STRING_STR"]"));
3308 G.err_line = l->line;
3310 RETURN_STATUS(BC_STATUS_SUCCESS);
3312 #define zdc_lex_string(...) (zdc_lex_string(__VA_ARGS__) COMMA_SUCCESS)
3314 static BC_STATUS zdc_lex_token(BcLex *l)
3316 static const //BcLexType - should be this type, but narrower type saves size:
3319 BC_LEX_OP_REL_EQ, BC_LEX_OP_REL_LE, BC_LEX_OP_REL_GE, BC_LEX_OP_REL_NE,
3320 BC_LEX_OP_REL_LT, BC_LEX_OP_REL_GT, BC_LEX_SCOLON, BC_LEX_COLON,
3321 BC_LEX_ELSE, BC_LEX_LOAD, BC_LEX_LOAD_POP, BC_LEX_OP_ASSIGN,
3324 static const //BcLexType - should be this type
3328 BC_LEX_OP_MODULUS, BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_LPAREN,
3330 BC_LEX_INVALID, BC_LEX_OP_MULTIPLY, BC_LEX_OP_PLUS, BC_LEX_INVALID,
3332 BC_LEX_OP_MINUS, BC_LEX_INVALID, BC_LEX_OP_DIVIDE,
3334 BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID,
3335 BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID,
3336 BC_LEX_INVALID, BC_LEX_INVALID,
3338 BC_LEX_COLON, BC_LEX_SCOLON, BC_LEX_OP_REL_GT, BC_LEX_OP_REL_EQ,
3339 BC_LEX_OP_REL_LT, BC_LEX_KEY_READ, BC_LEX_INVALID,
3341 BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID,
3342 BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_EQ_NO_REG, BC_LEX_INVALID,
3344 BC_LEX_KEY_IBASE, BC_LEX_INVALID, BC_LEX_KEY_SCALE, BC_LEX_LOAD_POP,
3345 BC_LEX_INVALID, BC_LEX_OP_BOOL_NOT, BC_LEX_KEY_OBASE, BC_LEX_PRINT_STREAM,
3347 BC_LEX_NQUIT, BC_LEX_POP, BC_LEX_STORE_PUSH, BC_LEX_INVALID, BC_LEX_INVALID,
3348 BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_SCALE_FACTOR, BC_LEX_INVALID,
3350 BC_LEX_KEY_LENGTH, BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID,
3352 BC_LEX_OP_POWER, BC_LEX_NEG, BC_LEX_INVALID,
3354 BC_LEX_ASCIIFY, BC_LEX_INVALID, BC_LEX_CLEAR_STACK, BC_LEX_DUPLICATE,
3355 BC_LEX_ELSE, BC_LEX_PRINT_STACK, BC_LEX_INVALID, BC_LEX_INVALID,
3357 BC_LEX_STORE_IBASE, BC_LEX_INVALID, BC_LEX_STORE_SCALE, BC_LEX_LOAD,
3358 BC_LEX_INVALID, BC_LEX_PRINT_POP, BC_LEX_STORE_OBASE, BC_LEX_KEY_PRINT,
3360 BC_LEX_KEY_QUIT, BC_LEX_SWAP, BC_LEX_OP_ASSIGN, BC_LEX_INVALID,
3361 BC_LEX_INVALID, BC_LEX_KEY_SQRT, BC_LEX_INVALID, BC_LEX_EXECUTE,
3363 BC_LEX_INVALID, BC_LEX_STACK_LEVEL,
3365 BC_LEX_LBRACE, BC_LEX_OP_MODEXP, BC_LEX_INVALID, BC_LEX_OP_DIVMOD,
3368 BcStatus s = BC_STATUS_SUCCESS;
3369 char c = l->buf[l->i++], c2;
3372 for (i = 0; i < ARRAY_SIZE(dc_lex_regs); ++i) {
3373 if (l->t.last == dc_lex_regs[i])
3374 RETURN_STATUS(zdc_lex_register(l));
3377 if (c >= '%' && c <= '~'
3378 && (l->t.t = dc_lex_tokens[c - '%']) != BC_LEX_INVALID
3383 // This is the workhorse of the lexer.
3385 // case '\0': // probably never reached
3386 // l->t.t = BC_LEX_EOF;
3394 l->newline = (c == '\n');
3395 bc_lex_whitespace(l);
3400 l->t.t = BC_LEX_OP_REL_NE;
3402 l->t.t = BC_LEX_OP_REL_LE;
3404 l->t.t = BC_LEX_OP_REL_GE;
3406 RETURN_STATUS(bc_error_bad_character(c));
3410 bc_lex_lineComment(l);
3413 if (isdigit(l->buf[l->i]))
3414 s = zbc_lex_number(l, c);
3416 s = bc_error_bad_character(c);
3434 s = zbc_lex_number(l, c);
3437 s = zdc_lex_string(l);
3440 l->t.t = BC_LEX_INVALID;
3441 s = bc_error_bad_character(c);
3449 static void bc_parse_push(BcParse *p, char i)
3451 dbg_compile("%s:%d pushing bytecode %zd:%d", __func__, __LINE__, p->func->code.len, i);
3452 bc_vec_pushByte(&p->func->code, i);
3455 static void bc_parse_pushName(BcParse *p, char *name)
3458 bc_parse_push(p, *name++);
3459 bc_parse_push(p, BC_PARSE_STREND);
3462 static void bc_parse_pushIndex(BcParse *p, size_t idx)
3467 dbg_lex("%s:%d pushing index %zd", __func__, __LINE__, idx);
3468 mask = ((size_t)0xff) << (sizeof(idx) * 8 - 8);
3471 if (idx & mask) break;
3476 bc_parse_push(p, amt);
3479 bc_parse_push(p, (unsigned char)idx);
3484 static void bc_parse_pushJUMP(BcParse *p, size_t idx)
3486 bc_parse_push(p, BC_INST_JUMP);
3487 bc_parse_pushIndex(p, idx);
3490 static void bc_parse_pushJUMP_ZERO(BcParse *p, size_t idx)
3492 bc_parse_push(p, BC_INST_JUMP_ZERO);
3493 bc_parse_pushIndex(p, idx);
3496 static void bc_parse_pushNUM(BcParse *p)
3498 char *num = xstrdup(p->l.t.v.v);
3499 size_t idx = G.prog.consts.len;
3501 bc_vec_push(&G.prog.consts, &num);
3503 bc_parse_push(p, BC_INST_NUM);
3504 bc_parse_pushIndex(p, idx);
3507 static BC_STATUS bc_parse_pushSTR(BcParse *p)
3509 char *str = xstrdup(p->l.t.v.v);
3511 bc_parse_push(p, BC_INST_STR);
3512 bc_parse_pushIndex(p, G.prog.strs.len);
3513 bc_vec_push(&G.prog.strs, &str);
3515 RETURN_STATUS(zbc_lex_next(&p->l));
3517 #define bc_parse_pushSTR(...) (bc_parse_pushSTR(__VA_ARGS__) COMMA_SUCCESS)
3519 IF_BC(static BC_STATUS zbc_parse_stmt_or_funcdef(BcParse *p);)
3520 IF_DC(static BC_STATUS zdc_parse_parse(BcParse *p);)
3522 // "Parse" half of "parse,execute,repeat" main loop
3523 static BC_STATUS zcommon_parse(BcParse *p)
3526 // FIXME: "eating" of stmt delemiters is coded inconsistently
3527 // (sometimes zbc_parse_stmt() eats the delimiter, sometimes don't),
3528 // which causes bugs such as "print 1 print 2" erroneously accepted,
3529 // or "print 1 else 2" detecting parse error only after executing
3531 IF_BC(RETURN_STATUS(zbc_parse_stmt_or_funcdef(p));)
3533 IF_DC(RETURN_STATUS(zdc_parse_parse(p));)
3535 #define zcommon_parse(...) (zcommon_parse(__VA_ARGS__) COMMA_SUCCESS)
3537 static BC_STATUS zbc_parse_text_init(BcParse *p, const char *text)
3539 p->func = bc_program_func(p->fidx);
3541 RETURN_STATUS(zbc_lex_text_init(&p->l, text));
3543 #define zbc_parse_text_init(...) (zbc_parse_text_init(__VA_ARGS__) COMMA_SUCCESS)
3545 // Called when parsing or execution detects a failure,
3546 // resets execution structures.
3547 static void bc_program_reset(void)
3552 bc_vec_npop(&G.prog.exestack, G.prog.exestack.len - 1);
3553 bc_vec_pop_all(&G.prog.results);
3555 f = bc_program_func(0);
3556 ip = bc_vec_top(&G.prog.exestack);
3557 ip->idx = f->code.len;
3560 // Called when zbc/zdc_parse_parse() detects a failure,
3561 // resets parsing structures.
3562 static void bc_parse_reset(BcParse *p)
3564 if (p->fidx != BC_PROG_MAIN) {
3565 p->func->nparams = 0;
3566 bc_vec_pop_all(&p->func->code);
3567 bc_vec_pop_all(&p->func->autos);
3568 bc_vec_pop_all(&p->func->labels);
3570 p->fidx = BC_PROG_MAIN;
3571 p->func = bc_program_func_BC_PROG_MAIN();
3575 p->l.t.t = BC_LEX_EOF;
3577 bc_vec_pop_all(&p->exits);
3578 bc_vec_pop_all(&p->conds);
3579 bc_vec_pop_all(&p->ops);
3584 static void bc_parse_free(BcParse *p)
3586 bc_vec_free(&p->exits);
3587 bc_vec_free(&p->conds);
3588 bc_vec_free(&p->ops);
3592 static void bc_parse_create(BcParse *p, size_t func)
3594 memset(p, 0, sizeof(BcParse));
3597 bc_vec_init(&p->exits, sizeof(size_t), NULL);
3598 bc_vec_init(&p->conds, sizeof(size_t), NULL);
3599 bc_vec_init(&p->ops, sizeof(BcLexType), NULL);
3602 p->func = bc_program_func(func);
3607 #define BC_PARSE_TOP_OP(p) (*((BcLexType *) bc_vec_top(&(p)->ops)))
3608 #define BC_PARSE_LEAF(p, rparen) \
3609 (((p) >= BC_INST_NUM && (p) <= BC_INST_SQRT) || (rparen) || \
3610 (p) == BC_INST_INC_POST || (p) == BC_INST_DEC_POST)
3612 // We can calculate the conversion between tokens and exprs by subtracting the
3613 // position of the first operator in the lex enum and adding the position of the
3614 // first in the expr enum. Note: This only works for binary operators.
3615 #define BC_TOKEN_2_INST(t) ((char) ((t) - BC_LEX_NEG + BC_INST_NEG))
3617 static BcStatus bc_parse_expr_empty_ok(BcParse *p, uint8_t flags);
3619 static BC_STATUS zbc_parse_expr(BcParse *p, uint8_t flags)
3623 s = bc_parse_expr_empty_ok(p, flags);
3624 if (s == BC_STATUS_PARSE_EMPTY_EXP)
3625 RETURN_STATUS(bc_error("empty expression"));
3628 #define zbc_parse_expr(...) (zbc_parse_expr(__VA_ARGS__) COMMA_SUCCESS)
3630 static BC_STATUS zbc_parse_stmt_possibly_auto(BcParse *p, bool auto_allowed);
3631 #define zbc_parse_stmt_possibly_auto(...) (zbc_parse_stmt_possibly_auto(__VA_ARGS__) COMMA_SUCCESS)
3633 static BC_STATUS zbc_parse_stmt(BcParse *p)
3635 RETURN_STATUS(zbc_parse_stmt_possibly_auto(p, false));
3637 #define zbc_parse_stmt(...) (zbc_parse_stmt(__VA_ARGS__) COMMA_SUCCESS)
3639 static BC_STATUS zbc_parse_stmt_allow_NLINE_before(BcParse *p, const char *after_X)
3641 // "if(cond)<newline>stmt" is accepted too, but not 2+ newlines.
3642 // Same for "else", "while()", "for()".
3643 BcStatus s = zbc_lex_next_and_skip_NLINE(&p->l);
3644 if (s) RETURN_STATUS(s);
3645 if (p->l.t.t == BC_LEX_NLINE)
3646 RETURN_STATUS(bc_error_fmt("no statement after '%s'", after_X));
3648 RETURN_STATUS(zbc_parse_stmt(p));
3650 #define zbc_parse_stmt_allow_NLINE_before(...) (zbc_parse_stmt_allow_NLINE_before(__VA_ARGS__) COMMA_SUCCESS)
3652 static void bc_parse_operator(BcParse *p, BcLexType type, size_t start,
3655 char l, r = bc_parse_op_PREC(type - BC_LEX_OP_INC);
3656 bool left = bc_parse_op_LEFT(type - BC_LEX_OP_INC);
3658 while (p->ops.len > start) {
3659 BcLexType t = BC_PARSE_TOP_OP(p);
3660 if (t == BC_LEX_LPAREN) break;
3662 l = bc_parse_op_PREC(t - BC_LEX_OP_INC);
3663 if (l >= r && (l != r || !left)) break;
3665 bc_parse_push(p, BC_TOKEN_2_INST(t));
3666 bc_vec_pop(&p->ops);
3667 *nexprs -= (t != BC_LEX_OP_BOOL_NOT && t != BC_LEX_NEG);
3670 bc_vec_push(&p->ops, &type);
3673 static BC_STATUS zbc_parse_rightParen(BcParse *p, size_t ops_bgn, size_t *nexs)
3677 if (p->ops.len <= ops_bgn)
3678 RETURN_STATUS(bc_error_bad_expression());
3679 top = BC_PARSE_TOP_OP(p);
3681 while (top != BC_LEX_LPAREN) {
3682 bc_parse_push(p, BC_TOKEN_2_INST(top));
3684 bc_vec_pop(&p->ops);
3685 *nexs -= top != BC_LEX_OP_BOOL_NOT && top != BC_LEX_NEG;
3687 if (p->ops.len <= ops_bgn)
3688 RETURN_STATUS(bc_error_bad_expression());
3689 top = BC_PARSE_TOP_OP(p);
3692 bc_vec_pop(&p->ops);
3694 RETURN_STATUS(zbc_lex_next(&p->l));
3696 #define zbc_parse_rightParen(...) (zbc_parse_rightParen(__VA_ARGS__) COMMA_SUCCESS)
3698 static BC_STATUS zbc_parse_params(BcParse *p, uint8_t flags)
3703 dbg_lex("%s:%d p->l.t.t:%d", __func__, __LINE__, p->l.t.t);
3704 flags = (flags & ~(BC_PARSE_PRINT | BC_PARSE_REL)) | BC_PARSE_ARRAY;
3706 s = zbc_lex_next(&p->l);
3707 if (s) RETURN_STATUS(s);
3710 if (p->l.t.t != BC_LEX_RPAREN) {
3712 s = zbc_parse_expr(p, flags);
3713 if (s) RETURN_STATUS(s);
3715 if (p->l.t.t != BC_LEX_COMMA) {
3716 if (p->l.t.t == BC_LEX_RPAREN)
3718 RETURN_STATUS(bc_error_bad_token());
3720 s = zbc_lex_next(&p->l);
3721 if (s) RETURN_STATUS(s);
3725 bc_parse_push(p, BC_INST_CALL);
3726 bc_parse_pushIndex(p, nparams);
3728 RETURN_STATUS(BC_STATUS_SUCCESS);
3730 #define zbc_parse_params(...) (zbc_parse_params(__VA_ARGS__) COMMA_SUCCESS)
3732 // Note: takes ownership of 'name' (must be malloced)
3733 static size_t bc_program_addFunc(char *name)
3736 BcId entry, *entry_ptr;
3741 entry.idx = G.prog.fns.len;
3743 inserted = bc_map_insert(&G.prog.fn_map, &entry, &idx);
3744 if (!inserted) free(name);
3746 entry_ptr = bc_vec_item(&G.prog.fn_map, idx);
3747 idx = entry_ptr->idx;
3750 BcFunc *func = bc_program_func(entry_ptr->idx);
3752 // We need to reset these, so the function can be repopulated.
3754 bc_vec_pop_all(&func->autos);
3755 bc_vec_pop_all(&func->code);
3756 bc_vec_pop_all(&func->labels);
3759 bc_vec_push(&G.prog.fns, &f);
3765 // Note: takes ownership of 'name' (must be malloced)
3766 static BC_STATUS zbc_parse_call(BcParse *p, char *name, uint8_t flags)
3769 BcId entry, *entry_ptr;
3774 s = zbc_parse_params(p, flags);
3777 if (p->l.t.t != BC_LEX_RPAREN) {
3778 s = bc_error_bad_token();
3782 idx = bc_map_find_exact(&G.prog.fn_map, &entry);
3784 if (idx == BC_VEC_INVALID_IDX) {
3785 // No such function exists, create an empty one
3786 bc_program_addFunc(name);
3787 idx = bc_map_find_exact(&G.prog.fn_map, &entry);
3791 entry_ptr = bc_vec_item(&G.prog.fn_map, idx);
3792 bc_parse_pushIndex(p, entry_ptr->idx);
3794 RETURN_STATUS(zbc_lex_next(&p->l));
3799 #define zbc_parse_call(...) (zbc_parse_call(__VA_ARGS__) COMMA_SUCCESS)
3801 static BC_STATUS zbc_parse_name(BcParse *p, BcInst *type, uint8_t flags)
3806 name = xstrdup(p->l.t.v.v);
3807 s = zbc_lex_next(&p->l);
3810 if (p->l.t.t == BC_LEX_LBRACKET) {
3811 s = zbc_lex_next(&p->l);
3814 if (p->l.t.t == BC_LEX_RBRACKET) {
3815 if (!(flags & BC_PARSE_ARRAY)) {
3816 s = bc_error_bad_expression();
3819 *type = BC_INST_ARRAY;
3821 *type = BC_INST_ARRAY_ELEM;
3822 flags &= ~(BC_PARSE_PRINT | BC_PARSE_REL);
3823 s = zbc_parse_expr(p, flags);
3826 s = zbc_lex_next(&p->l);
3828 bc_parse_push(p, *type);
3829 bc_parse_pushName(p, name);
3831 } else if (p->l.t.t == BC_LEX_LPAREN) {
3832 if (flags & BC_PARSE_NOCALL) {
3833 s = bc_error_bad_token();
3836 *type = BC_INST_CALL;
3837 s = zbc_parse_call(p, name, flags);
3839 *type = BC_INST_VAR;
3840 bc_parse_push(p, BC_INST_VAR);
3841 bc_parse_pushName(p, name);
3850 #define zbc_parse_name(...) (zbc_parse_name(__VA_ARGS__) COMMA_SUCCESS)
3852 static BC_STATUS zbc_parse_read(BcParse *p)
3856 s = zbc_lex_next(&p->l);
3857 if (s) RETURN_STATUS(s);
3858 if (p->l.t.t != BC_LEX_LPAREN) RETURN_STATUS(bc_error_bad_token());
3860 s = zbc_lex_next(&p->l);
3861 if (s) RETURN_STATUS(s);
3862 if (p->l.t.t != BC_LEX_RPAREN) RETURN_STATUS(bc_error_bad_token());
3864 bc_parse_push(p, BC_INST_READ);
3866 RETURN_STATUS(zbc_lex_next(&p->l));
3868 #define zbc_parse_read(...) (zbc_parse_read(__VA_ARGS__) COMMA_SUCCESS)
3870 static BC_STATUS zbc_parse_builtin(BcParse *p, BcLexType type, uint8_t flags,
3875 s = zbc_lex_next(&p->l);
3876 if (s) RETURN_STATUS(s);
3877 if (p->l.t.t != BC_LEX_LPAREN) RETURN_STATUS(bc_error_bad_token());
3879 flags = (flags & ~(BC_PARSE_PRINT | BC_PARSE_REL)) | BC_PARSE_ARRAY;
3881 s = zbc_lex_next(&p->l);
3882 if (s) RETURN_STATUS(s);
3884 s = zbc_parse_expr(p, flags);
3885 if (s) RETURN_STATUS(s);
3887 if (p->l.t.t != BC_LEX_RPAREN) RETURN_STATUS(bc_error_bad_token());
3889 *prev = (type == BC_LEX_KEY_LENGTH) ? BC_INST_LENGTH : BC_INST_SQRT;
3890 bc_parse_push(p, *prev);
3892 RETURN_STATUS(zbc_lex_next(&p->l));
3894 #define zbc_parse_builtin(...) (zbc_parse_builtin(__VA_ARGS__) COMMA_SUCCESS)
3896 static BC_STATUS zbc_parse_scale(BcParse *p, BcInst *type, uint8_t flags)
3900 s = zbc_lex_next(&p->l);
3901 if (s) RETURN_STATUS(s);
3903 if (p->l.t.t != BC_LEX_LPAREN) {
3904 *type = BC_INST_SCALE;
3905 bc_parse_push(p, BC_INST_SCALE);
3906 RETURN_STATUS(BC_STATUS_SUCCESS);
3909 *type = BC_INST_SCALE_FUNC;
3910 flags &= ~(BC_PARSE_PRINT | BC_PARSE_REL);
3912 s = zbc_lex_next(&p->l);
3913 if (s) RETURN_STATUS(s);
3915 s = zbc_parse_expr(p, flags);
3916 if (s) RETURN_STATUS(s);
3917 if (p->l.t.t != BC_LEX_RPAREN)
3918 RETURN_STATUS(bc_error_bad_token());
3919 bc_parse_push(p, BC_INST_SCALE_FUNC);
3921 RETURN_STATUS(zbc_lex_next(&p->l));
3923 #define zbc_parse_scale(...) (zbc_parse_scale(__VA_ARGS__) COMMA_SUCCESS)
3925 static BC_STATUS zbc_parse_incdec(BcParse *p, BcInst *prev, bool *paren_expr,
3926 size_t *nexprs, uint8_t flags)
3931 BcInst etype = *prev;
3933 if (etype == BC_INST_VAR || etype == BC_INST_ARRAY_ELEM
3934 || etype == BC_INST_SCALE || etype == BC_INST_LAST
3935 || etype == BC_INST_IBASE || etype == BC_INST_OBASE
3937 *prev = inst = BC_INST_INC_POST + (p->l.t.t != BC_LEX_OP_INC);
3938 bc_parse_push(p, inst);
3939 s = zbc_lex_next(&p->l);
3941 *prev = inst = BC_INST_INC_PRE + (p->l.t.t != BC_LEX_OP_INC);
3944 s = zbc_lex_next(&p->l);
3945 if (s) RETURN_STATUS(s);
3948 // Because we parse the next part of the expression
3949 // right here, we need to increment this.
3950 *nexprs = *nexprs + 1;
3954 s = zbc_parse_name(p, prev, flags | BC_PARSE_NOCALL);
3956 case BC_LEX_KEY_IBASE:
3957 case BC_LEX_KEY_LAST:
3958 case BC_LEX_KEY_OBASE:
3959 bc_parse_push(p, type - BC_LEX_KEY_IBASE + BC_INST_IBASE);
3960 s = zbc_lex_next(&p->l);
3962 case BC_LEX_KEY_SCALE:
3963 s = zbc_lex_next(&p->l);
3964 if (s) RETURN_STATUS(s);
3965 if (p->l.t.t == BC_LEX_LPAREN)
3966 s = bc_error_bad_token();
3968 bc_parse_push(p, BC_INST_SCALE);
3971 s = bc_error_bad_token();
3975 if (!s) bc_parse_push(p, inst);
3980 #define zbc_parse_incdec(...) (zbc_parse_incdec(__VA_ARGS__) COMMA_SUCCESS)
3982 static BC_STATUS zbc_parse_minus(BcParse *p, BcInst *prev, size_t ops_bgn,
3983 bool rparen, size_t *nexprs)
3987 BcInst etype = *prev;
3989 s = zbc_lex_next(&p->l);
3990 if (s) RETURN_STATUS(s);
3992 type = rparen || etype == BC_INST_INC_POST || etype == BC_INST_DEC_POST ||
3993 (etype >= BC_INST_NUM && etype <= BC_INST_SQRT) ?
3996 *prev = BC_TOKEN_2_INST(type);
3998 // We can just push onto the op stack because this is the largest
3999 // precedence operator that gets pushed. Inc/dec does not.
4000 if (type != BC_LEX_OP_MINUS)
4001 bc_vec_push(&p->ops, &type);
4003 bc_parse_operator(p, type, ops_bgn, nexprs);
4007 #define zbc_parse_minus(...) (zbc_parse_minus(__VA_ARGS__) COMMA_SUCCESS)
4009 static BC_STATUS zbc_parse_print(BcParse *p)
4015 s = zbc_lex_next(&p->l);
4016 if (s) RETURN_STATUS(s);
4018 if (type == BC_LEX_STR) {
4019 s = bc_parse_pushSTR(p);
4021 s = zbc_parse_expr(p, 0);
4023 if (s) RETURN_STATUS(s);
4024 bc_parse_push(p, BC_INST_PRINT_POP);
4025 if (p->l.t.t != BC_LEX_COMMA)
4031 #define zbc_parse_print(...) (zbc_parse_print(__VA_ARGS__) COMMA_SUCCESS)
4033 static BC_STATUS zbc_parse_return(BcParse *p)
4038 dbg_lex_enter("%s:%d entered", __func__, __LINE__);
4039 s = zbc_lex_next(&p->l);
4040 if (s) RETURN_STATUS(s);
4043 if (t == BC_LEX_NLINE || t == BC_LEX_SCOLON)
4044 bc_parse_push(p, BC_INST_RET0);
4046 bool paren = (t == BC_LEX_LPAREN);
4047 s = bc_parse_expr_empty_ok(p, 0);
4048 if (s == BC_STATUS_PARSE_EMPTY_EXP) {
4049 bc_parse_push(p, BC_INST_RET0);
4050 s = zbc_lex_next(&p->l);
4052 if (s) RETURN_STATUS(s);
4054 if (!paren || p->l.t.last != BC_LEX_RPAREN) {
4055 s = bc_POSIX_requires("parentheses around return expressions");
4056 IF_ERROR_RETURN_POSSIBLE(if (s) RETURN_STATUS(s));
4059 bc_parse_push(p, BC_INST_RET);
4062 dbg_lex_done("%s:%d done", __func__, __LINE__);
4065 #define zbc_parse_return(...) (zbc_parse_return(__VA_ARGS__) COMMA_SUCCESS)
4067 static void rewrite_label_to_current(BcParse *p, size_t idx)
4069 size_t *label = bc_vec_item(&p->func->labels, idx);
4070 *label = p->func->code.len;
4073 static BC_STATUS zbc_parse_if(BcParse *p)
4078 dbg_lex_enter("%s:%d entered", __func__, __LINE__);
4079 s = zbc_lex_next(&p->l);
4080 if (s) RETURN_STATUS(s);
4081 if (p->l.t.t != BC_LEX_LPAREN) RETURN_STATUS(bc_error_bad_token());
4083 s = zbc_lex_next(&p->l);
4084 if (s) RETURN_STATUS(s);
4085 s = zbc_parse_expr(p, BC_PARSE_REL);
4086 if (s) RETURN_STATUS(s);
4088 if (p->l.t.t != BC_LEX_RPAREN) RETURN_STATUS(bc_error_bad_token());
4090 ip_idx = p->func->labels.len;
4091 bc_parse_pushJUMP_ZERO(p, ip_idx);
4092 bc_vec_push(&p->func->labels, &ip_idx);
4094 s = zbc_parse_stmt_allow_NLINE_before(p, STRING_if);
4095 if (s) RETURN_STATUS(s);
4097 dbg_lex("%s:%d in if after stmt: p->l.t.t:%d", __func__, __LINE__, p->l.t.t);
4098 if (p->l.t.t == BC_LEX_KEY_ELSE) {
4101 ip2_idx = p->func->labels.len;
4103 dbg_lex("%s:%d after if() body: BC_INST_JUMP to %zd", __func__, __LINE__, ip2_idx);
4104 bc_parse_pushJUMP(p, ip2_idx);
4106 dbg_lex("%s:%d rewriting 'if_zero' label to jump to 'else'-> %zd", __func__, __LINE__, p->func->code.len);
4107 rewrite_label_to_current(p, ip_idx);
4109 bc_vec_push(&p->func->labels, &ip2_idx);
4112 s = zbc_parse_stmt_allow_NLINE_before(p, STRING_else);
4113 if (s) RETURN_STATUS(s);
4116 dbg_lex("%s:%d rewriting label to jump after 'if' body-> %zd", __func__, __LINE__, p->func->code.len);
4117 rewrite_label_to_current(p, ip_idx);
4119 dbg_lex_done("%s:%d done", __func__, __LINE__);
4122 #define zbc_parse_if(...) (zbc_parse_if(__VA_ARGS__) COMMA_SUCCESS)
4124 static BC_STATUS zbc_parse_while(BcParse *p)
4130 s = zbc_lex_next(&p->l);
4131 if (s) RETURN_STATUS(s);
4132 if (p->l.t.t != BC_LEX_LPAREN) RETURN_STATUS(bc_error_bad_token());
4133 s = zbc_lex_next(&p->l);
4134 if (s) RETURN_STATUS(s);
4136 cond_idx = p->func->labels.len;
4137 ip_idx = cond_idx + 1;
4139 bc_vec_push(&p->func->labels, &p->func->code.len);
4140 bc_vec_push(&p->conds, &cond_idx);
4142 bc_vec_push(&p->exits, &ip_idx);
4143 bc_vec_push(&p->func->labels, &ip_idx);
4145 s = zbc_parse_expr(p, BC_PARSE_REL);
4146 if (s) RETURN_STATUS(s);
4147 if (p->l.t.t != BC_LEX_RPAREN) RETURN_STATUS(bc_error_bad_token());
4149 bc_parse_pushJUMP_ZERO(p, ip_idx);
4151 s = zbc_parse_stmt_allow_NLINE_before(p, STRING_while);
4152 if (s) RETURN_STATUS(s);
4154 dbg_lex("%s:%d BC_INST_JUMP to %zd", __func__, __LINE__, cond_idx);
4155 bc_parse_pushJUMP(p, cond_idx);
4157 dbg_lex("%s:%d rewriting label-> %zd", __func__, __LINE__, p->func->code.len);
4158 rewrite_label_to_current(p, ip_idx);
4160 bc_vec_pop(&p->exits);
4161 bc_vec_pop(&p->conds);
4165 #define zbc_parse_while(...) (zbc_parse_while(__VA_ARGS__) COMMA_SUCCESS)
4167 static BC_STATUS zbc_parse_for(BcParse *p)
4170 size_t cond_idx, exit_idx, body_idx, update_idx;
4172 dbg_lex("%s:%d p->l.t.t:%d", __func__, __LINE__, p->l.t.t);
4173 s = zbc_lex_next(&p->l);
4174 if (s) RETURN_STATUS(s);
4175 if (p->l.t.t != BC_LEX_LPAREN) RETURN_STATUS(bc_error_bad_token());
4176 s = zbc_lex_next(&p->l);
4177 if (s) RETURN_STATUS(s);
4179 if (p->l.t.t != BC_LEX_SCOLON)
4180 s = zbc_parse_expr(p, 0);
4182 s = bc_POSIX_does_not_allow_empty_X_expression_in_for("init");
4184 if (s) RETURN_STATUS(s);
4185 if (p->l.t.t != BC_LEX_SCOLON) RETURN_STATUS(bc_error_bad_token());
4186 s = zbc_lex_next(&p->l);
4187 if (s) RETURN_STATUS(s);
4189 cond_idx = p->func->labels.len;
4190 update_idx = cond_idx + 1;
4191 body_idx = update_idx + 1;
4192 exit_idx = body_idx + 1;
4194 bc_vec_push(&p->func->labels, &p->func->code.len);
4196 if (p->l.t.t != BC_LEX_SCOLON)
4197 s = zbc_parse_expr(p, BC_PARSE_REL);
4199 s = bc_POSIX_does_not_allow_empty_X_expression_in_for("condition");
4201 if (s) RETURN_STATUS(s);
4202 if (p->l.t.t != BC_LEX_SCOLON) RETURN_STATUS(bc_error_bad_token());
4204 s = zbc_lex_next(&p->l);
4205 if (s) RETURN_STATUS(s);
4207 bc_parse_pushJUMP_ZERO(p, exit_idx);
4208 bc_parse_pushJUMP(p, body_idx);
4210 bc_vec_push(&p->conds, &update_idx);
4211 bc_vec_push(&p->func->labels, &p->func->code.len);
4213 if (p->l.t.t != BC_LEX_RPAREN)
4214 s = zbc_parse_expr(p, 0);
4216 s = bc_POSIX_does_not_allow_empty_X_expression_in_for("update");
4218 if (s) RETURN_STATUS(s);
4220 if (p->l.t.t != BC_LEX_RPAREN) RETURN_STATUS(bc_error_bad_token());
4221 bc_parse_pushJUMP(p, cond_idx);
4222 bc_vec_push(&p->func->labels, &p->func->code.len);
4224 bc_vec_push(&p->exits, &exit_idx);
4225 bc_vec_push(&p->func->labels, &exit_idx);
4227 s = zbc_parse_stmt_allow_NLINE_before(p, STRING_for);
4228 if (s) RETURN_STATUS(s);
4230 dbg_lex("%s:%d BC_INST_JUMP to %zd", __func__, __LINE__, update_idx);
4231 bc_parse_pushJUMP(p, update_idx);
4233 dbg_lex("%s:%d rewriting label-> %zd", __func__, __LINE__, p->func->code.len);
4234 rewrite_label_to_current(p, exit_idx);
4236 bc_vec_pop(&p->exits);
4237 bc_vec_pop(&p->conds);
4239 RETURN_STATUS(BC_STATUS_SUCCESS);
4241 #define zbc_parse_for(...) (zbc_parse_for(__VA_ARGS__) COMMA_SUCCESS)
4243 static BC_STATUS zbc_parse_break_or_continue(BcParse *p, BcLexType type)
4248 if (type == BC_LEX_KEY_BREAK) {
4249 if (p->exits.len == 0) // none of the enclosing blocks is a loop
4250 RETURN_STATUS(bc_error_bad_token());
4251 i = *(size_t*)bc_vec_top(&p->exits);
4253 i = *(size_t*)bc_vec_top(&p->conds);
4256 bc_parse_pushJUMP(p, i);
4258 s = zbc_lex_next(&p->l);
4259 if (s) RETURN_STATUS(s);
4261 if (p->l.t.t != BC_LEX_SCOLON && p->l.t.t != BC_LEX_NLINE)
4262 RETURN_STATUS(bc_error_bad_token());
4264 RETURN_STATUS(zbc_lex_next(&p->l));
4266 #define zbc_parse_break_or_continue(...) (zbc_parse_break_or_continue(__VA_ARGS__) COMMA_SUCCESS)
4268 static BC_STATUS zbc_parse_funcdef(BcParse *p)
4271 bool var, comma = false;
4274 dbg_lex_enter("%s:%d entered", __func__, __LINE__);
4275 s = zbc_lex_next(&p->l);
4276 if (s) RETURN_STATUS(s);
4277 if (p->l.t.t != BC_LEX_NAME)
4278 RETURN_STATUS(bc_error("bad function definition"));
4280 name = xstrdup(p->l.t.v.v);
4281 p->fidx = bc_program_addFunc(name);
4282 p->func = bc_program_func(p->fidx);
4284 s = zbc_lex_next(&p->l);
4285 if (s) RETURN_STATUS(s);
4286 if (p->l.t.t != BC_LEX_LPAREN)
4287 RETURN_STATUS(bc_error("bad function definition"));
4288 s = zbc_lex_next(&p->l);
4289 if (s) RETURN_STATUS(s);
4291 while (p->l.t.t != BC_LEX_RPAREN) {
4292 if (p->l.t.t != BC_LEX_NAME)
4293 RETURN_STATUS(bc_error("bad function definition"));
4297 name = xstrdup(p->l.t.v.v);
4298 s = zbc_lex_next(&p->l);
4301 var = p->l.t.t != BC_LEX_LBRACKET;
4304 s = zbc_lex_next(&p->l);
4307 if (p->l.t.t != BC_LEX_RBRACKET) {
4308 s = bc_error("bad function definition");
4312 s = zbc_lex_next(&p->l);
4316 comma = p->l.t.t == BC_LEX_COMMA;
4318 s = zbc_lex_next(&p->l);
4322 s = zbc_func_insert(p->func, name, var);
4326 if (comma) RETURN_STATUS(bc_error("bad function definition"));
4328 s = zbc_lex_next(&p->l);
4329 if (s) RETURN_STATUS(s);
4331 if (p->l.t.t != BC_LEX_LBRACE)
4332 s = bc_POSIX_requires("the left brace be on the same line as the function header");
4334 // Prevent "define z()<newline>" from being interpreted as function with empty stmt as body
4335 s = zbc_lex_skip_if_at_NLINE(&p->l);
4336 if (s) RETURN_STATUS(s);
4337 //GNU bc requires a {} block even if function body has single stmt, enforce this?
4338 if (p->l.t.t != BC_LEX_LBRACE)
4339 RETURN_STATUS(bc_error("function { body } expected"));
4341 p->in_funcdef++; // to determine whether "return" stmt is allowed, and such
4342 s = zbc_parse_stmt_possibly_auto(p, true);
4344 if (s) RETURN_STATUS(s);
4346 bc_parse_push(p, BC_INST_RET0);
4348 // Subsequent code generation is into main program
4349 p->fidx = BC_PROG_MAIN;
4350 p->func = bc_program_func_BC_PROG_MAIN();
4352 dbg_lex_done("%s:%d done", __func__, __LINE__);
4355 dbg_lex_done("%s:%d done (error)", __func__, __LINE__);
4359 #define zbc_parse_funcdef(...) (zbc_parse_funcdef(__VA_ARGS__) COMMA_SUCCESS)
4361 static BC_STATUS zbc_parse_auto(BcParse *p)
4364 bool comma, var, one;
4367 dbg_lex_enter("%s:%d entered", __func__, __LINE__);
4368 s = zbc_lex_next(&p->l);
4369 if (s) RETURN_STATUS(s);
4372 one = p->l.t.t == BC_LEX_NAME;
4374 while (p->l.t.t == BC_LEX_NAME) {
4375 name = xstrdup(p->l.t.v.v);
4376 s = zbc_lex_next(&p->l);
4379 var = p->l.t.t != BC_LEX_LBRACKET;
4381 s = zbc_lex_next(&p->l);
4384 if (p->l.t.t != BC_LEX_RBRACKET) {
4385 s = bc_error("bad function definition");
4389 s = zbc_lex_next(&p->l);
4393 comma = p->l.t.t == BC_LEX_COMMA;
4395 s = zbc_lex_next(&p->l);
4399 s = zbc_func_insert(p->func, name, var);
4403 if (comma) RETURN_STATUS(bc_error("bad function definition"));
4404 if (!one) RETURN_STATUS(bc_error("no auto variable found"));
4406 if (p->l.t.t != BC_LEX_NLINE && p->l.t.t != BC_LEX_SCOLON)
4407 RETURN_STATUS(bc_error_bad_token());
4409 dbg_lex_done("%s:%d done", __func__, __LINE__);
4410 RETURN_STATUS(zbc_lex_next(&p->l));
4413 dbg_lex_done("%s:%d done (ERROR)", __func__, __LINE__);
4416 #define zbc_parse_auto(...) (zbc_parse_auto(__VA_ARGS__) COMMA_SUCCESS)
4418 #undef zbc_parse_stmt_possibly_auto
4419 static BC_STATUS zbc_parse_stmt_possibly_auto(BcParse *p, bool auto_allowed)
4421 BcStatus s = BC_STATUS_SUCCESS;
4423 dbg_lex_enter("%s:%d entered, p->l.t.t:%d", __func__, __LINE__, p->l.t.t);
4425 if (p->l.t.t == BC_LEX_NLINE) {
4426 dbg_lex_done("%s:%d done (seen BC_LEX_NLINE)", __func__, __LINE__);
4427 RETURN_STATUS(zbc_lex_next(&p->l));
4429 if (p->l.t.t == BC_LEX_SCOLON) {
4430 dbg_lex_done("%s:%d done (seen BC_LEX_SCOLON)", __func__, __LINE__);
4431 RETURN_STATUS(zbc_lex_next(&p->l));
4434 if (p->l.t.t == BC_LEX_LBRACE) {
4435 dbg_lex("%s:%d BC_LEX_LBRACE: (auto_allowed:%d)", __func__, __LINE__, auto_allowed);
4437 s = zbc_lex_next(&p->l);
4438 if (s) RETURN_STATUS(s);
4439 } while (p->l.t.t == BC_LEX_NLINE);
4440 if (auto_allowed && p->l.t.t == BC_LEX_KEY_AUTO) {
4441 dbg_lex("%s:%d calling zbc_parse_auto()", __func__, __LINE__);
4442 s = zbc_parse_auto(p);
4443 if (s) RETURN_STATUS(s);
4445 while (p->l.t.t != BC_LEX_RBRACE) {
4446 dbg_lex("%s:%d block parsing loop", __func__, __LINE__);
4447 s = zbc_parse_stmt(p);
4448 if (s) RETURN_STATUS(s);
4450 s = zbc_lex_next(&p->l);
4451 dbg_lex_done("%s:%d done (seen BC_LEX_RBRACE)", __func__, __LINE__);
4455 dbg_lex("%s:%d p->l.t.t:%d", __func__, __LINE__, p->l.t.t);
4459 case BC_LEX_OP_MINUS:
4460 case BC_LEX_OP_BOOL_NOT:
4464 case BC_LEX_KEY_IBASE:
4465 case BC_LEX_KEY_LAST:
4466 case BC_LEX_KEY_LENGTH:
4467 case BC_LEX_KEY_OBASE:
4468 case BC_LEX_KEY_READ:
4469 case BC_LEX_KEY_SCALE:
4470 case BC_LEX_KEY_SQRT:
4471 s = zbc_parse_expr(p, BC_PARSE_PRINT);
4474 s = bc_parse_pushSTR(p);
4475 bc_parse_push(p, BC_INST_PRINT_STR);
4477 case BC_LEX_KEY_BREAK:
4478 case BC_LEX_KEY_CONTINUE:
4479 s = zbc_parse_break_or_continue(p, p->l.t.t);
4481 case BC_LEX_KEY_FOR:
4482 s = zbc_parse_for(p);
4484 case BC_LEX_KEY_HALT:
4485 bc_parse_push(p, BC_INST_HALT);
4486 s = zbc_lex_next(&p->l);
4489 s = zbc_parse_if(p);
4491 case BC_LEX_KEY_LIMITS:
4492 // "limits" is a compile-time command,
4493 // the output is produced at _parse time_.
4495 "BC_BASE_MAX = "BC_MAX_OBASE_STR "\n"
4496 "BC_DIM_MAX = "BC_MAX_DIM_STR "\n"
4497 "BC_SCALE_MAX = "BC_MAX_SCALE_STR "\n"
4498 "BC_STRING_MAX = "BC_MAX_STRING_STR"\n"
4499 "BC_NAME_MAX = "BC_MAX_NAME_STR "\n"
4500 "BC_NUM_MAX = "BC_MAX_NUM_STR "\n"
4501 "MAX Exponent = "BC_MAX_EXP_STR "\n"
4502 "Number of vars = "BC_MAX_VARS_STR "\n"
4504 s = zbc_lex_next(&p->l);
4506 case BC_LEX_KEY_PRINT:
4507 s = zbc_parse_print(p);
4509 case BC_LEX_KEY_QUIT:
4510 // "quit" is a compile-time command. For example,
4511 // "if (0 == 1) quit" terminates when parsing the statement,
4512 // not when it is executed
4513 QUIT_OR_RETURN_TO_MAIN;
4514 case BC_LEX_KEY_RETURN:
4516 RETURN_STATUS(bc_error("'return' not in a function"));
4517 s = zbc_parse_return(p);
4519 case BC_LEX_KEY_WHILE:
4520 s = zbc_parse_while(p);
4523 s = bc_error_bad_token();
4527 if (s || G_interrupt) {
4529 s = BC_STATUS_FAILURE;
4532 dbg_lex_done("%s:%d done", __func__, __LINE__);
4535 #define zbc_parse_stmt_possibly_auto(...) (zbc_parse_stmt_possibly_auto(__VA_ARGS__) COMMA_SUCCESS)
4537 static BC_STATUS zbc_parse_stmt_or_funcdef(BcParse *p)
4541 dbg_lex_enter("%s:%d entered", __func__, __LINE__);
4542 if (p->l.t.t == BC_LEX_EOF)
4543 s = bc_error("end of file");
4544 else if (p->l.t.t == BC_LEX_KEY_DEFINE) {
4545 dbg_lex("%s:%d p->l.t.t:BC_LEX_KEY_DEFINE", __func__, __LINE__);
4546 s = zbc_parse_funcdef(p);
4548 dbg_lex("%s:%d p->l.t.t:%d (not BC_LEX_KEY_DEFINE)", __func__, __LINE__, p->l.t.t);
4549 s = zbc_parse_stmt(p);
4552 dbg_lex_done("%s:%d done", __func__, __LINE__);
4555 #define zbc_parse_stmt_or_funcdef(...) (zbc_parse_stmt_or_funcdef(__VA_ARGS__) COMMA_SUCCESS)
4557 // This is not a "z" function: can also return BC_STATUS_PARSE_EMPTY_EXP
4558 static BcStatus bc_parse_expr_empty_ok(BcParse *p, uint8_t flags)
4560 BcStatus s = BC_STATUS_SUCCESS;
4561 BcInst prev = BC_INST_PRINT;
4562 BcLexType top, t = p->l.t.t;
4563 size_t nexprs = 0, ops_bgn = p->ops.len;
4564 unsigned nparens, nrelops;
4565 bool paren_first, paren_expr, rprn, done, get_token, assign, bin_last;
4567 dbg_lex_enter("%s:%d entered", __func__, __LINE__);
4568 paren_first = p->l.t.t == BC_LEX_LPAREN;
4569 nparens = nrelops = 0;
4570 paren_expr = rprn = done = get_token = assign = false;
4573 for (; !G_interrupt && !s && !done && bc_parse_exprs(t); t = p->l.t.t) {
4577 s = zbc_parse_incdec(p, &prev, &paren_expr, &nexprs, flags);
4578 rprn = get_token = bin_last = false;
4580 case BC_LEX_OP_MINUS:
4581 s = zbc_parse_minus(p, &prev, ops_bgn, rprn, &nexprs);
4582 rprn = get_token = false;
4583 bin_last = prev == BC_INST_MINUS;
4585 case BC_LEX_OP_ASSIGN_POWER:
4586 case BC_LEX_OP_ASSIGN_MULTIPLY:
4587 case BC_LEX_OP_ASSIGN_DIVIDE:
4588 case BC_LEX_OP_ASSIGN_MODULUS:
4589 case BC_LEX_OP_ASSIGN_PLUS:
4590 case BC_LEX_OP_ASSIGN_MINUS:
4591 case BC_LEX_OP_ASSIGN:
4592 if (prev != BC_INST_VAR && prev != BC_INST_ARRAY_ELEM
4593 && prev != BC_INST_SCALE && prev != BC_INST_IBASE
4594 && prev != BC_INST_OBASE && prev != BC_INST_LAST
4596 s = bc_error("bad assignment:"
4597 " left side must be variable"
4599 ); // note: shared string
4603 case BC_LEX_OP_POWER:
4604 case BC_LEX_OP_MULTIPLY:
4605 case BC_LEX_OP_DIVIDE:
4606 case BC_LEX_OP_MODULUS:
4607 case BC_LEX_OP_PLUS:
4608 case BC_LEX_OP_REL_EQ:
4609 case BC_LEX_OP_REL_LE:
4610 case BC_LEX_OP_REL_GE:
4611 case BC_LEX_OP_REL_NE:
4612 case BC_LEX_OP_REL_LT:
4613 case BC_LEX_OP_REL_GT:
4614 case BC_LEX_OP_BOOL_NOT:
4615 case BC_LEX_OP_BOOL_OR:
4616 case BC_LEX_OP_BOOL_AND:
4617 if (((t == BC_LEX_OP_BOOL_NOT) != bin_last)
4618 || (t != BC_LEX_OP_BOOL_NOT && prev == BC_INST_BOOL_NOT)
4620 return bc_error_bad_expression();
4622 nrelops += t >= BC_LEX_OP_REL_EQ && t <= BC_LEX_OP_REL_GT;
4623 prev = BC_TOKEN_2_INST(t);
4624 bc_parse_operator(p, t, ops_bgn, &nexprs);
4625 s = zbc_lex_next(&p->l);
4626 rprn = get_token = false;
4627 bin_last = t != BC_LEX_OP_BOOL_NOT;
4630 if (BC_PARSE_LEAF(prev, rprn))
4631 return bc_error_bad_expression();
4633 paren_expr = rprn = bin_last = false;
4635 bc_vec_push(&p->ops, &t);
4638 if (bin_last || prev == BC_INST_BOOL_NOT)
4639 return bc_error_bad_expression();
4641 s = BC_STATUS_SUCCESS;
4647 dbg_lex_done("%s:%d done (returning EMPTY_EXP)", __func__, __LINE__);
4648 return BC_STATUS_PARSE_EMPTY_EXP;
4651 paren_expr = rprn = true;
4652 get_token = bin_last = false;
4653 s = zbc_parse_rightParen(p, ops_bgn, &nexprs);
4656 if (BC_PARSE_LEAF(prev, rprn))
4657 return bc_error_bad_expression();
4659 rprn = get_token = bin_last = false;
4660 s = zbc_parse_name(p, &prev, flags & ~BC_PARSE_NOCALL);
4664 if (BC_PARSE_LEAF(prev, rprn))
4665 return bc_error_bad_expression();
4666 bc_parse_pushNUM(p);
4669 paren_expr = get_token = true;
4670 rprn = bin_last = false;
4672 case BC_LEX_KEY_IBASE:
4673 case BC_LEX_KEY_LAST:
4674 case BC_LEX_KEY_OBASE:
4675 if (BC_PARSE_LEAF(prev, rprn))
4676 return bc_error_bad_expression();
4677 prev = (char) (t - BC_LEX_KEY_IBASE + BC_INST_IBASE);
4678 bc_parse_push(p, (char) prev);
4679 paren_expr = get_token = true;
4680 rprn = bin_last = false;
4683 case BC_LEX_KEY_LENGTH:
4684 case BC_LEX_KEY_SQRT:
4685 if (BC_PARSE_LEAF(prev, rprn))
4686 return bc_error_bad_expression();
4687 s = zbc_parse_builtin(p, t, flags, &prev);
4689 rprn = get_token = bin_last = false;
4692 case BC_LEX_KEY_READ:
4693 if (BC_PARSE_LEAF(prev, rprn))
4694 return bc_error_bad_expression();
4695 else if (flags & BC_PARSE_NOREAD)
4696 s = bc_error_nested_read_call();
4698 s = zbc_parse_read(p);
4700 rprn = get_token = bin_last = false;
4702 prev = BC_INST_READ;
4704 case BC_LEX_KEY_SCALE:
4705 if (BC_PARSE_LEAF(prev, rprn))
4706 return bc_error_bad_expression();
4707 s = zbc_parse_scale(p, &prev, flags);
4709 rprn = get_token = bin_last = false;
4711 prev = BC_INST_SCALE;
4714 s = bc_error_bad_token();
4718 if (!s && get_token) s = zbc_lex_next(&p->l);
4722 if (G_interrupt) return BC_STATUS_FAILURE; // ^C: stop parsing
4724 while (p->ops.len > ops_bgn) {
4725 top = BC_PARSE_TOP_OP(p);
4726 assign = top >= BC_LEX_OP_ASSIGN_POWER && top <= BC_LEX_OP_ASSIGN;
4728 if (top == BC_LEX_LPAREN || top == BC_LEX_RPAREN)
4729 return bc_error_bad_expression();
4731 bc_parse_push(p, BC_TOKEN_2_INST(top));
4733 nexprs -= top != BC_LEX_OP_BOOL_NOT && top != BC_LEX_NEG;
4734 bc_vec_pop(&p->ops);
4737 if (prev == BC_INST_BOOL_NOT || nexprs != 1)
4738 return bc_error_bad_expression();
4740 if (!(flags & BC_PARSE_REL) && nrelops) {
4741 s = bc_POSIX_does_not_allow("comparison operators outside if or loops");
4742 IF_ERROR_RETURN_POSSIBLE(if (s) return s);
4743 } else if ((flags & BC_PARSE_REL) && nrelops > 1) {
4744 s = bc_POSIX_requires("exactly one comparison operator per condition");
4745 IF_ERROR_RETURN_POSSIBLE(if (s) return s);
4748 if (flags & BC_PARSE_PRINT) {
4749 if (paren_first || !assign) bc_parse_push(p, BC_INST_PRINT);
4750 bc_parse_push(p, BC_INST_POP);
4753 dbg_lex_done("%s:%d done", __func__, __LINE__);
4761 static BC_STATUS zdc_parse_register(BcParse *p)
4765 s = zbc_lex_next(&p->l);
4766 if (s) RETURN_STATUS(s);
4767 if (p->l.t.t != BC_LEX_NAME) RETURN_STATUS(bc_error_bad_token());
4769 bc_parse_pushName(p, p->l.t.v.v);
4773 #define zdc_parse_register(...) (zdc_parse_register(__VA_ARGS__) COMMA_SUCCESS)
4775 static BC_STATUS zdc_parse_string(BcParse *p)
4778 size_t len = G.prog.strs.len;
4780 //why pad to 32 zeros??
4781 name = xasprintf("%032lu", (unsigned long)len);
4783 str = xstrdup(p->l.t.v.v);
4784 bc_parse_push(p, BC_INST_STR);
4785 bc_parse_pushIndex(p, len);
4786 bc_vec_push(&G.prog.strs, &str);
4787 bc_program_addFunc(name);
4788 p->func = bc_program_func(p->fidx);
4790 RETURN_STATUS(zbc_lex_next(&p->l));
4792 #define zdc_parse_string(...) (zdc_parse_string(__VA_ARGS__) COMMA_SUCCESS)
4794 static BC_STATUS zdc_parse_mem(BcParse *p, uint8_t inst, bool name, bool store)
4798 bc_parse_push(p, inst);
4800 s = zdc_parse_register(p);
4801 if (s) RETURN_STATUS(s);
4805 bc_parse_push(p, BC_INST_SWAP);
4806 bc_parse_push(p, BC_INST_ASSIGN);
4807 bc_parse_push(p, BC_INST_POP);
4810 RETURN_STATUS(zbc_lex_next(&p->l));
4812 #define zdc_parse_mem(...) (zdc_parse_mem(__VA_ARGS__) COMMA_SUCCESS)
4814 static BC_STATUS zdc_parse_cond(BcParse *p, uint8_t inst)
4818 bc_parse_push(p, inst);
4819 bc_parse_push(p, BC_INST_EXEC_COND);
4821 s = zdc_parse_register(p);
4822 if (s) RETURN_STATUS(s);
4824 s = zbc_lex_next(&p->l);
4825 if (s) RETURN_STATUS(s);
4827 if (p->l.t.t == BC_LEX_ELSE) {
4828 s = zdc_parse_register(p);
4829 if (s) RETURN_STATUS(s);
4830 s = zbc_lex_next(&p->l);
4832 bc_parse_push(p, BC_PARSE_STREND);
4836 #define zdc_parse_cond(...) (zdc_parse_cond(__VA_ARGS__) COMMA_SUCCESS)
4838 static BC_STATUS zdc_parse_token(BcParse *p, BcLexType t, uint8_t flags)
4840 BcStatus s = BC_STATUS_SUCCESS;
4842 bool assign, get_token = false;
4845 case BC_LEX_OP_REL_EQ:
4846 case BC_LEX_OP_REL_LE:
4847 case BC_LEX_OP_REL_GE:
4848 case BC_LEX_OP_REL_NE:
4849 case BC_LEX_OP_REL_LT:
4850 case BC_LEX_OP_REL_GT:
4851 s = zdc_parse_cond(p, t - BC_LEX_OP_REL_EQ + BC_INST_REL_EQ);
4855 s = zdc_parse_mem(p, BC_INST_ARRAY_ELEM, true, t == BC_LEX_COLON);
4858 s = zdc_parse_string(p);
4862 if (t == BC_LEX_NEG) {
4863 s = zbc_lex_next(&p->l);
4864 if (s) RETURN_STATUS(s);
4865 if (p->l.t.t != BC_LEX_NUMBER)
4866 RETURN_STATUS(bc_error_bad_token());
4868 bc_parse_pushNUM(p);
4869 if (t == BC_LEX_NEG) bc_parse_push(p, BC_INST_NEG);
4872 case BC_LEX_KEY_READ:
4873 if (flags & BC_PARSE_NOREAD)
4874 s = bc_error_nested_read_call();
4876 bc_parse_push(p, BC_INST_READ);
4879 case BC_LEX_OP_ASSIGN:
4880 case BC_LEX_STORE_PUSH:
4881 assign = t == BC_LEX_OP_ASSIGN;
4882 inst = assign ? BC_INST_VAR : BC_INST_PUSH_TO_VAR;
4883 s = zdc_parse_mem(p, inst, true, assign);
4886 case BC_LEX_LOAD_POP:
4887 inst = t == BC_LEX_LOAD_POP ? BC_INST_PUSH_VAR : BC_INST_LOAD;
4888 s = zdc_parse_mem(p, inst, true, false);
4890 case BC_LEX_STORE_IBASE:
4891 case BC_LEX_STORE_SCALE:
4892 case BC_LEX_STORE_OBASE:
4893 inst = t - BC_LEX_STORE_IBASE + BC_INST_IBASE;
4894 s = zdc_parse_mem(p, inst, false, true);
4897 s = bc_error_bad_token();
4902 if (!s && get_token) s = zbc_lex_next(&p->l);
4906 #define zdc_parse_token(...) (zdc_parse_token(__VA_ARGS__) COMMA_SUCCESS)
4908 static BC_STATUS zdc_parse_expr(BcParse *p, uint8_t flags)
4917 if (t == BC_LEX_EOF) break;
4919 inst = dc_parse_insts[t];
4920 if (inst != BC_INST_INVALID) {
4921 bc_parse_push(p, inst);
4922 s = zbc_lex_next(&p->l);
4924 s = zdc_parse_token(p, t, flags);
4926 if (s) RETURN_STATUS(s);
4929 if (flags & BC_PARSE_NOCALL)
4930 bc_parse_push(p, BC_INST_POP_EXEC);
4932 RETURN_STATUS(BC_STATUS_SUCCESS);
4934 #define zdc_parse_expr(...) (zdc_parse_expr(__VA_ARGS__) COMMA_SUCCESS)
4936 static BC_STATUS zdc_parse_parse(BcParse *p)
4940 if (p->l.t.t == BC_LEX_EOF)
4941 s = bc_error("end of file");
4943 s = zdc_parse_expr(p, 0);
4945 if (s || G_interrupt) {
4947 s = BC_STATUS_FAILURE;
4952 #define zdc_parse_parse(...) (zdc_parse_parse(__VA_ARGS__) COMMA_SUCCESS)
4956 static BC_STATUS zcommon_parse_expr(BcParse *p, uint8_t flags)
4959 IF_BC(RETURN_STATUS(zbc_parse_expr(p, flags)));
4961 IF_DC(RETURN_STATUS(zdc_parse_expr(p, flags)));
4964 #define zcommon_parse_expr(...) (zcommon_parse_expr(__VA_ARGS__) COMMA_SUCCESS)
4966 static BcVec* bc_program_search(char *id, bool var)
4973 v = var ? &G.prog.vars : &G.prog.arrs;
4974 map = var ? &G.prog.var_map : &G.prog.arr_map;
4978 new = bc_map_insert(map, &e, &i); // 1 if insertion was successful
4982 bc_array_init(&v2, var);
4983 bc_vec_push(v, &v2);
4986 ptr = bc_vec_item(map, i);
4987 if (new) ptr->name = xstrdup(e.name);
4988 return bc_vec_item(v, ptr->idx);
4991 static BC_STATUS zbc_program_num(BcResult *r, BcNum **num, bool hex)
4995 case BC_RESULT_TEMP:
4996 case BC_RESULT_IBASE:
4997 case BC_RESULT_SCALE:
4998 case BC_RESULT_OBASE:
5001 case BC_RESULT_CONSTANT: {
5003 char *str = *(char**)bc_vec_item(&G.prog.consts, r->d.id.idx);
5005 size_t len = strlen(str);
5007 bc_num_init(&r->d.n, len);
5009 hex = hex && len == 1;
5010 base_t = hex ? 16 : G.prog.ib_t;
5011 s = zbc_num_parse(&r->d.n, str, base_t);
5014 bc_num_free(&r->d.n);
5019 r->t = BC_RESULT_TEMP;
5023 case BC_RESULT_ARRAY:
5024 case BC_RESULT_ARRAY_ELEM: {
5027 v = bc_program_search(r->d.id.name, r->t == BC_RESULT_VAR);
5029 if (r->t == BC_RESULT_ARRAY_ELEM) {
5031 if (v->len <= r->d.id.idx) bc_array_expand(v, r->d.id.idx + 1);
5032 *num = bc_vec_item(v, r->d.id.idx);
5034 *num = bc_vec_top(v);
5037 case BC_RESULT_LAST:
5038 *num = &G.prog.last;
5045 RETURN_STATUS(BC_STATUS_SUCCESS);
5047 #define zbc_program_num(...) (zbc_program_num(__VA_ARGS__) COMMA_SUCCESS)
5049 static BC_STATUS zbc_program_binOpPrep(BcResult **l, BcNum **ln,
5050 BcResult **r, BcNum **rn, bool assign)
5054 BcResultType lt, rt;
5056 if (!STACK_HAS_MORE_THAN(&G.prog.results, 1))
5057 RETURN_STATUS(bc_error_stack_has_too_few_elements());
5059 *r = bc_vec_item_rev(&G.prog.results, 0);
5060 *l = bc_vec_item_rev(&G.prog.results, 1);
5064 hex = assign && (lt == BC_RESULT_IBASE || lt == BC_RESULT_OBASE);
5066 s = zbc_program_num(*l, ln, false);
5067 if (s) RETURN_STATUS(s);
5068 s = zbc_program_num(*r, rn, hex);
5069 if (s) RETURN_STATUS(s);
5071 // We run this again under these conditions in case any vector has been
5072 // reallocated out from under the BcNums or arrays we had.
5073 if (lt == rt && (lt == BC_RESULT_VAR || lt == BC_RESULT_ARRAY_ELEM)) {
5074 s = zbc_program_num(*l, ln, false);
5075 if (s) RETURN_STATUS(s);
5078 if (!BC_PROG_NUM((*l), (*ln)) && (!assign || (*l)->t != BC_RESULT_VAR))
5079 RETURN_STATUS(bc_error_variable_is_wrong_type());
5080 if (!assign && !BC_PROG_NUM((*r), (*ln)))
5081 RETURN_STATUS(bc_error_variable_is_wrong_type());
5085 #define zbc_program_binOpPrep(...) (zbc_program_binOpPrep(__VA_ARGS__) COMMA_SUCCESS)
5087 static void bc_program_binOpRetire(BcResult *r)
5089 r->t = BC_RESULT_TEMP;
5090 bc_vec_pop(&G.prog.results);
5091 bc_vec_pop(&G.prog.results);
5092 bc_vec_push(&G.prog.results, r);
5095 static BC_STATUS zbc_program_prep(BcResult **r, BcNum **n)
5099 if (!STACK_HAS_MORE_THAN(&G.prog.results, 0))
5100 RETURN_STATUS(bc_error_stack_has_too_few_elements());
5101 *r = bc_vec_top(&G.prog.results);
5103 s = zbc_program_num(*r, n, false);
5104 if (s) RETURN_STATUS(s);
5106 if (!BC_PROG_NUM((*r), (*n)))
5107 RETURN_STATUS(bc_error_variable_is_wrong_type());
5111 #define zbc_program_prep(...) (zbc_program_prep(__VA_ARGS__) COMMA_SUCCESS)
5113 static void bc_program_retire(BcResult *r, BcResultType t)
5116 bc_vec_pop(&G.prog.results);
5117 bc_vec_push(&G.prog.results, r);
5120 static BC_STATUS zbc_program_op(char inst)
5123 BcResult *opd1, *opd2, res;
5124 BcNum *n1, *n2 = NULL;
5126 s = zbc_program_binOpPrep(&opd1, &n1, &opd2, &n2, false);
5127 if (s) RETURN_STATUS(s);
5128 bc_num_init_DEF_SIZE(&res.d.n);
5130 s = BC_STATUS_SUCCESS;
5131 IF_ERROR_RETURN_POSSIBLE(s =) zbc_program_ops[inst - BC_INST_POWER](n1, n2, &res.d.n, G.prog.scale);
5133 bc_program_binOpRetire(&res);
5137 bc_num_free(&res.d.n);
5140 #define zbc_program_op(...) (zbc_program_op(__VA_ARGS__) COMMA_SUCCESS)
5142 static BC_STATUS zbc_program_read(void)
5144 const char *sv_file;
5152 RETURN_STATUS(bc_error_nested_read_call());
5154 f = bc_program_func(BC_PROG_READ);
5155 bc_vec_pop_all(&f->code);
5157 sv_file = G.prog.file;
5161 bc_char_vec_init(&buf);
5162 bc_read_line(&buf, stdin);
5164 bc_parse_create(&parse, BC_PROG_READ);
5165 bc_lex_file(&parse.l);
5167 s = zbc_parse_text_init(&parse, buf.v);
5168 if (s) goto exec_err;
5169 s = zcommon_parse_expr(&parse, BC_PARSE_NOREAD);
5170 if (s) goto exec_err;
5172 if (parse.l.t.t != BC_LEX_NLINE && parse.l.t.t != BC_LEX_EOF) {
5173 s = bc_error("bad read() expression");
5177 ip.func = BC_PROG_READ;
5179 ip.len = G.prog.results.len;
5181 // Update this pointer, just in case.
5182 f = bc_program_func(BC_PROG_READ);
5184 bc_vec_pushByte(&f->code, BC_INST_POP_EXEC);
5185 bc_vec_push(&G.prog.exestack, &ip);
5187 bc_parse_free(&parse);
5189 G.prog.file = sv_file;
5193 #define zbc_program_read(...) (zbc_program_read(__VA_ARGS__) COMMA_SUCCESS)
5195 static size_t bc_program_index(char *code, size_t *bgn)
5197 unsigned char *bytes = (void*)(code + *bgn);
5207 for (i = 0; i < amt; i += 8)
5208 res |= (size_t)(*bytes++) << i;
5213 static char *bc_program_name(char *code, size_t *bgn)
5219 s = xmalloc(strchr(code, BC_PARSE_STREND) - code + 1);
5223 if (c == BC_PARSE_STREND)
5233 static void bc_program_printString(const char *str)
5237 // Example: echo '[]ap' | dc
5238 // should print two bytes: 0x00, 0x0A
5245 if (c != '\\' || !*str)
5265 G.prog.nchars = SIZE_MAX;
5277 // Just print the backslash and following character.
5288 static void bc_num_printNewline(void)
5290 if (G.prog.nchars == G.prog.len - 1) {
5298 static FAST_FUNC void bc_num_printChar(size_t num, size_t width, bool radix)
5301 bb_putchar((char) num);
5302 G.prog.nchars += width;
5306 static FAST_FUNC void bc_num_printDigits(size_t num, size_t width, bool radix)
5310 bc_num_printNewline();
5311 bb_putchar(radix ? '.' : ' ');
5314 bc_num_printNewline();
5315 for (exp = 0, pow = 1; exp < width - 1; ++exp, pow *= 10)
5318 for (exp = 0; exp < width; pow /= 10, ++G.prog.nchars, ++exp) {
5320 bc_num_printNewline();
5323 bb_putchar(((char) dig) + '0');
5327 static FAST_FUNC void bc_num_printHex(size_t num, size_t width, bool radix)
5330 bc_num_printNewline();
5335 bc_num_printNewline();
5336 bb_putchar(bb_hexdigits_upcase[num]);
5337 G.prog.nchars += width;
5340 static void bc_num_printDecimal(BcNum *n)
5342 size_t i, rdx = n->rdx - 1;
5349 for (i = n->len - 1; i < n->len; --i)
5350 bc_num_printHex((size_t) n->num[i], 1, i == rdx);
5353 static BC_STATUS zbc_num_printNum(BcNum *n, unsigned base_t, size_t width, BcNumDigitOp print)
5358 BcNum intp, fracp, digit, frac_len;
5359 unsigned long dig, *ptr;
5364 print(0, width, false);
5365 RETURN_STATUS(BC_STATUS_SUCCESS);
5368 bc_vec_init(&stack, sizeof(long), NULL);
5369 bc_num_init(&intp, n->len);
5370 bc_num_init(&fracp, n->rdx);
5371 bc_num_init(&digit, width);
5372 bc_num_init(&frac_len, BC_NUM_INT(n));
5373 bc_num_copy(&intp, n);
5374 bc_num_one(&frac_len);
5375 //TODO: have BcNumSmall type, with static buffer
5376 bc_num_init_DEF_SIZE(&base);
5377 bc_num_ulong2num(&base, base_t);
5379 bc_num_truncate(&intp, intp.rdx);
5380 s = zbc_num_sub(n, &intp, &fracp, 0);
5383 while (intp.len != 0) {
5384 s = zbc_num_divmod(&intp, &base, &intp, &digit, 0);
5386 s = zbc_num_ulong(&digit, &dig);
5388 bc_vec_push(&stack, &dig);
5391 for (i = 0; i < stack.len; ++i) {
5392 ptr = bc_vec_item_rev(&stack, i);
5393 print(*ptr, width, false);
5396 if (!n->rdx) goto err;
5398 for (radix = true; frac_len.len <= n->rdx; radix = false) {
5399 s = zbc_num_mul(&fracp, &base, &fracp, n->rdx);
5401 s = zbc_num_ulong(&fracp, &dig);
5403 bc_num_ulong2num(&intp, dig);
5404 s = zbc_num_sub(&fracp, &intp, &fracp, 0);
5406 print(dig, width, radix);
5407 s = zbc_num_mul(&frac_len, &base, &frac_len, 0);
5412 bc_num_free(&frac_len);
5413 bc_num_free(&digit);
5414 bc_num_free(&fracp);
5416 bc_vec_free(&stack);
5419 #define zbc_num_printNum(...) (zbc_num_printNum(__VA_ARGS__) COMMA_SUCCESS)
5421 static BC_STATUS zbc_num_printBase(BcNum *n)
5435 if (G.prog.ob_t <= BC_NUM_MAX_IBASE) {
5437 print = bc_num_printHex;
5439 unsigned i = G.prog.ob_t - 1;
5447 print = bc_num_printDigits;
5450 s = zbc_num_printNum(n, G.prog.ob_t, width, print);
5455 #define zbc_num_printBase(...) (zbc_num_printBase(__VA_ARGS__) COMMA_SUCCESS)
5457 static BC_STATUS zbc_num_print(BcNum *n, bool newline)
5459 BcStatus s = BC_STATUS_SUCCESS;
5461 bc_num_printNewline();
5466 } else if (G.prog.ob_t == 10)
5467 bc_num_printDecimal(n);
5469 s = zbc_num_printBase(n);
5478 #define zbc_num_print(...) (zbc_num_print(__VA_ARGS__) COMMA_SUCCESS)
5480 static BC_STATUS zbc_program_print(char inst, size_t idx)
5485 bool pop = inst != BC_INST_PRINT;
5487 if (!STACK_HAS_MORE_THAN(&G.prog.results, idx))
5488 RETURN_STATUS(bc_error_stack_has_too_few_elements());
5490 r = bc_vec_item_rev(&G.prog.results, idx);
5491 num = NULL; // is this NULL necessary?
5492 s = zbc_program_num(r, &num, false);
5493 if (s) RETURN_STATUS(s);
5495 if (BC_PROG_NUM(r, num)) {
5496 s = zbc_num_print(num, !pop);
5497 if (!s) bc_num_copy(&G.prog.last, num);
5501 idx = (r->t == BC_RESULT_STR) ? r->d.id.idx : num->rdx;
5502 str = *bc_program_str(idx);
5504 if (inst == BC_INST_PRINT_STR) {
5507 if (c == '\0') break;
5510 if (c == '\n') G.prog.nchars = 0;
5513 bc_program_printString(str);
5514 if (inst == BC_INST_PRINT) bb_putchar('\n');
5518 if (!s && pop) bc_vec_pop(&G.prog.results);
5522 #define zbc_program_print(...) (zbc_program_print(__VA_ARGS__) COMMA_SUCCESS)
5524 static BC_STATUS zbc_program_negate(void)
5530 s = zbc_program_prep(&ptr, &num);
5531 if (s) RETURN_STATUS(s);
5533 bc_num_init(&res.d.n, num->len);
5534 bc_num_copy(&res.d.n, num);
5535 if (res.d.n.len) res.d.n.neg = !res.d.n.neg;
5537 bc_program_retire(&res, BC_RESULT_TEMP);
5541 #define zbc_program_negate(...) (zbc_program_negate(__VA_ARGS__) COMMA_SUCCESS)
5543 static BC_STATUS zbc_program_logical(char inst)
5546 BcResult *opd1, *opd2, res;
5550 s = zbc_program_binOpPrep(&opd1, &n1, &opd2, &n2, false);
5551 if (s) RETURN_STATUS(s);
5553 bc_num_init_DEF_SIZE(&res.d.n);
5555 if (inst == BC_INST_BOOL_AND)
5556 cond = bc_num_cmp(n1, &G.prog.zero) && bc_num_cmp(n2, &G.prog.zero);
5557 else if (inst == BC_INST_BOOL_OR)
5558 cond = bc_num_cmp(n1, &G.prog.zero) || bc_num_cmp(n2, &G.prog.zero);
5560 cond = bc_num_cmp(n1, n2);
5562 case BC_INST_REL_EQ:
5565 case BC_INST_REL_LE:
5568 case BC_INST_REL_GE:
5571 case BC_INST_REL_LT:
5574 case BC_INST_REL_GT:
5577 default: // = case BC_INST_REL_NE:
5578 //cond = (cond != 0); - not needed
5583 if (cond) bc_num_one(&res.d.n);
5584 //else bc_num_zero(&res.d.n); - already is
5586 bc_program_binOpRetire(&res);
5590 #define zbc_program_logical(...) (zbc_program_logical(__VA_ARGS__) COMMA_SUCCESS)
5593 static BC_STATUS zbc_program_assignStr(BcResult *r, BcVec *v, bool push)
5598 memset(&n2, 0, sizeof(BcNum));
5599 n2.rdx = res.d.id.idx = r->d.id.idx;
5600 res.t = BC_RESULT_STR;
5603 if (!STACK_HAS_MORE_THAN(&G.prog.results, 1))
5604 RETURN_STATUS(bc_error_stack_has_too_few_elements());
5606 bc_vec_pop(&G.prog.results);
5609 bc_vec_pop(&G.prog.results);
5611 bc_vec_push(&G.prog.results, &res);
5612 bc_vec_push(v, &n2);
5614 RETURN_STATUS(BC_STATUS_SUCCESS);
5616 #define zbc_program_assignStr(...) (zbc_program_assignStr(__VA_ARGS__) COMMA_SUCCESS)
5619 static BC_STATUS zbc_program_copyToVar(char *name, bool var)
5626 if (!STACK_HAS_MORE_THAN(&G.prog.results, 0))
5627 RETURN_STATUS(bc_error_stack_has_too_few_elements());
5629 ptr = bc_vec_top(&G.prog.results);
5630 if ((ptr->t == BC_RESULT_ARRAY) != !var)
5631 RETURN_STATUS(bc_error_variable_is_wrong_type());
5632 v = bc_program_search(name, var);
5635 if (ptr->t == BC_RESULT_STR && !var)
5636 RETURN_STATUS(bc_error_variable_is_wrong_type());
5637 if (ptr->t == BC_RESULT_STR)
5638 RETURN_STATUS(zbc_program_assignStr(ptr, v, true));
5641 s = zbc_program_num(ptr, &n, false);
5642 if (s) RETURN_STATUS(s);
5644 // Do this once more to make sure that pointers were not invalidated.
5645 v = bc_program_search(name, var);
5648 bc_num_init_DEF_SIZE(&r.d.n);
5649 bc_num_copy(&r.d.n, n);
5651 bc_array_init(&r.d.v, true);
5652 bc_array_copy(&r.d.v, (BcVec *) n);
5655 bc_vec_push(v, &r.d);
5656 bc_vec_pop(&G.prog.results);
5660 #define zbc_program_copyToVar(...) (zbc_program_copyToVar(__VA_ARGS__) COMMA_SUCCESS)
5662 static BC_STATUS zbc_program_assign(char inst)
5665 BcResult *left, *right, res;
5666 BcNum *l = NULL, *r = NULL;
5667 bool assign = inst == BC_INST_ASSIGN, ib, sc;
5669 s = zbc_program_binOpPrep(&left, &l, &right, &r, assign);
5670 if (s) RETURN_STATUS(s);
5672 ib = left->t == BC_RESULT_IBASE;
5673 sc = left->t == BC_RESULT_SCALE;
5676 if (right->t == BC_RESULT_STR) {
5679 if (left->t != BC_RESULT_VAR)
5680 RETURN_STATUS(bc_error_variable_is_wrong_type());
5681 v = bc_program_search(left->d.id.name, true);
5683 RETURN_STATUS(zbc_program_assignStr(right, v, false));
5687 if (left->t == BC_RESULT_CONSTANT || left->t == BC_RESULT_TEMP)
5688 RETURN_STATUS(bc_error("bad assignment:"
5689 " left side must be variable"
5691 )); // note: shared string
5694 if (inst == BC_INST_ASSIGN_DIVIDE && !bc_num_cmp(r, &G.prog.zero))
5695 RETURN_STATUS(bc_error("divide by zero"));
5700 s = BC_STATUS_SUCCESS;
5701 IF_ERROR_RETURN_POSSIBLE(s =) zbc_program_ops[inst - BC_INST_ASSIGN_POWER](l, r, l, G.prog.scale);
5703 if (s) RETURN_STATUS(s);
5708 if (ib || sc || left->t == BC_RESULT_OBASE) {
5709 static const char *const msg[] = {
5710 "bad ibase; must be [2,16]", //BC_RESULT_IBASE
5711 "bad scale; must be [0,"BC_MAX_SCALE_STR"]", //BC_RESULT_SCALE
5712 NULL, //can't happen //BC_RESULT_LAST
5713 NULL, //can't happen //BC_RESULT_CONSTANT
5714 NULL, //can't happen //BC_RESULT_ONE
5715 "bad obase; must be [2,"BC_MAX_OBASE_STR"]", //BC_RESULT_OBASE
5721 s = zbc_num_ulong(l, &val);
5722 if (s) RETURN_STATUS(s);
5723 s = left->t - BC_RESULT_IBASE;
5726 ptr = &G.prog.scale;
5729 RETURN_STATUS(bc_error(msg[s]));
5730 max = ib ? BC_NUM_MAX_IBASE : BC_MAX_OBASE;
5731 ptr = ib ? &G.prog.ib_t : &G.prog.ob_t;
5735 RETURN_STATUS(bc_error(msg[s]));
5737 *ptr = (size_t) val;
5738 s = BC_STATUS_SUCCESS;
5741 bc_num_init(&res.d.n, l->len);
5742 bc_num_copy(&res.d.n, l);
5743 bc_program_binOpRetire(&res);
5747 #define zbc_program_assign(...) (zbc_program_assign(__VA_ARGS__) COMMA_SUCCESS)
5750 #define bc_program_pushVar(code, bgn, pop, copy) \
5751 bc_program_pushVar(code, bgn)
5752 // for bc, 'pop' and 'copy' are always false
5754 static BC_STATUS bc_program_pushVar(char *code, size_t *bgn,
5755 bool pop, bool copy)
5758 char *name = bc_program_name(code, bgn);
5760 r.t = BC_RESULT_VAR;
5765 BcVec *v = bc_program_search(name, true);
5766 BcNum *num = bc_vec_top(v);
5769 if (!STACK_HAS_MORE_THAN(v, 1 - copy)) {
5770 RETURN_STATUS(bc_error_stack_has_too_few_elements());
5773 if (!BC_PROG_STR(num)) {
5774 r.t = BC_RESULT_TEMP;
5775 bc_num_init_DEF_SIZE(&r.d.n);
5776 bc_num_copy(&r.d.n, num);
5778 r.t = BC_RESULT_STR;
5779 r.d.id.idx = num->rdx;
5782 if (!copy) bc_vec_pop(v);
5786 bc_vec_push(&G.prog.results, &r);
5788 RETURN_STATUS(BC_STATUS_SUCCESS);
5790 #define zbc_program_pushVar(...) (bc_program_pushVar(__VA_ARGS__) COMMA_SUCCESS)
5792 static BC_STATUS zbc_program_pushArray(char *code, size_t *bgn, char inst)
5794 BcStatus s = BC_STATUS_SUCCESS;
5798 r.d.id.name = bc_program_name(code, bgn);
5800 if (inst == BC_INST_ARRAY) {
5801 r.t = BC_RESULT_ARRAY;
5802 bc_vec_push(&G.prog.results, &r);
5807 s = zbc_program_prep(&operand, &num);
5809 s = zbc_num_ulong(num, &temp);
5812 if (temp > BC_MAX_DIM) {
5813 s = bc_error("array too long; must be [1,"BC_MAX_DIM_STR"]");
5817 r.d.id.idx = (size_t) temp;
5818 bc_program_retire(&r, BC_RESULT_ARRAY_ELEM);
5821 if (s) free(r.d.id.name);
5824 #define zbc_program_pushArray(...) (zbc_program_pushArray(__VA_ARGS__) COMMA_SUCCESS)
5827 static BC_STATUS zbc_program_incdec(char inst)
5830 BcResult *ptr, res, copy;
5834 s = zbc_program_prep(&ptr, &num);
5835 if (s) RETURN_STATUS(s);
5837 if (inst == BC_INST_INC_POST || inst == BC_INST_DEC_POST) {
5838 copy.t = BC_RESULT_TEMP;
5839 bc_num_init(©.d.n, num->len);
5840 bc_num_copy(©.d.n, num);
5843 res.t = BC_RESULT_ONE;
5844 inst = inst == BC_INST_INC_PRE || inst == BC_INST_INC_POST ?
5845 BC_INST_ASSIGN_PLUS :
5846 BC_INST_ASSIGN_MINUS;
5848 bc_vec_push(&G.prog.results, &res);
5849 s = zbc_program_assign(inst);
5850 if (s) RETURN_STATUS(s);
5852 if (inst2 == BC_INST_INC_POST || inst2 == BC_INST_DEC_POST) {
5853 bc_vec_pop(&G.prog.results);
5854 bc_vec_push(&G.prog.results, ©);
5859 #define zbc_program_incdec(...) (zbc_program_incdec(__VA_ARGS__) COMMA_SUCCESS)
5861 static BC_STATUS zbc_program_call(char *code, size_t *idx)
5869 nparams = bc_program_index(code, idx);
5871 ip.func = bc_program_index(code, idx);
5872 func = bc_program_func(ip.func);
5874 if (func->code.len == 0) {
5875 RETURN_STATUS(bc_error("undefined function"));
5877 if (nparams != func->nparams) {
5878 RETURN_STATUS(bc_error_fmt("function has %u parameters, but called with %u", func->nparams, nparams));
5880 ip.len = G.prog.results.len - nparams;
5882 for (i = 0; i < nparams; ++i) {
5885 a = bc_vec_item(&func->autos, nparams - 1 - i);
5886 arg = bc_vec_top(&G.prog.results);
5888 if ((!a->idx) != (arg->t == BC_RESULT_ARRAY) || arg->t == BC_RESULT_STR)
5889 RETURN_STATUS(bc_error_variable_is_wrong_type());
5891 s = zbc_program_copyToVar(a->name, a->idx);
5892 if (s) RETURN_STATUS(s);
5895 a = bc_vec_item(&func->autos, i);
5896 for (; i < func->autos.len; i++, a++) {
5899 v = bc_program_search(a->name, a->idx);
5902 bc_num_init_DEF_SIZE(&n2);
5903 bc_vec_push(v, &n2);
5906 bc_array_init(&v2, true);
5907 bc_vec_push(v, &v2);
5911 bc_vec_push(&G.prog.exestack, &ip);
5913 RETURN_STATUS(BC_STATUS_SUCCESS);
5915 #define zbc_program_call(...) (zbc_program_call(__VA_ARGS__) COMMA_SUCCESS)
5917 static BC_STATUS zbc_program_return(char inst)
5923 BcInstPtr *ip = bc_vec_top(&G.prog.exestack);
5925 if (!STACK_HAS_EQUAL_OR_MORE_THAN(&G.prog.results, ip->len + (inst == BC_INST_RET)))
5926 RETURN_STATUS(bc_error_stack_has_too_few_elements());
5928 f = bc_program_func(ip->func);
5929 res.t = BC_RESULT_TEMP;
5931 if (inst == BC_INST_RET) {
5934 BcResult *operand = bc_vec_top(&G.prog.results);
5936 s = zbc_program_num(operand, &num, false);
5937 if (s) RETURN_STATUS(s);
5938 bc_num_init(&res.d.n, num->len);
5939 bc_num_copy(&res.d.n, num);
5941 bc_num_init_DEF_SIZE(&res.d.n);
5942 //bc_num_zero(&res.d.n); - already is
5945 // We need to pop arguments as well, so this takes that into account.
5946 a = (void*)f->autos.v;
5947 for (i = 0; i < f->autos.len; i++, a++) {
5949 v = bc_program_search(a->name, a->idx);
5953 bc_vec_npop(&G.prog.results, G.prog.results.len - ip->len);
5954 bc_vec_push(&G.prog.results, &res);
5955 bc_vec_pop(&G.prog.exestack);
5957 RETURN_STATUS(BC_STATUS_SUCCESS);
5959 #define zbc_program_return(...) (zbc_program_return(__VA_ARGS__) COMMA_SUCCESS)
5962 static unsigned long bc_program_scale(BcNum *n)
5964 return (unsigned long) n->rdx;
5967 static unsigned long bc_program_len(BcNum *n)
5969 size_t len = n->len;
5971 if (n->rdx != len) return len;
5973 if (len == 0) break;
5975 if (n->num[len] != 0) break;
5980 static BC_STATUS zbc_program_builtin(char inst)
5986 bool len = inst == BC_INST_LENGTH;
5988 if (!STACK_HAS_MORE_THAN(&G.prog.results, 0))
5989 RETURN_STATUS(bc_error_stack_has_too_few_elements());
5990 opnd = bc_vec_top(&G.prog.results);
5992 s = zbc_program_num(opnd, &num, false);
5993 if (s) RETURN_STATUS(s);
5996 if (!BC_PROG_NUM(opnd, num) && !len)
5997 RETURN_STATUS(bc_error_variable_is_wrong_type());
6000 bc_num_init_DEF_SIZE(&res.d.n);
6002 if (inst == BC_INST_SQRT)
6003 s = zbc_num_sqrt(num, &res.d.n, G.prog.scale);
6005 else if (len != 0 && opnd->t == BC_RESULT_ARRAY) {
6006 bc_num_ulong2num(&res.d.n, (unsigned long) ((BcVec *) num)->len);
6010 else if (len != 0 && !BC_PROG_NUM(opnd, num)) {
6012 size_t idx = opnd->t == BC_RESULT_STR ? opnd->d.id.idx : num->rdx;
6014 str = bc_program_str(idx);
6015 bc_num_ulong2num(&res.d.n, strlen(*str));
6019 bc_num_ulong2num(&res.d.n, len ? bc_program_len(num) : bc_program_scale(num));
6022 bc_program_retire(&res, BC_RESULT_TEMP);
6026 #define zbc_program_builtin(...) (zbc_program_builtin(__VA_ARGS__) COMMA_SUCCESS)
6029 static BC_STATUS zbc_program_divmod(void)
6032 BcResult *opd1, *opd2, res, res2;
6033 BcNum *n1, *n2 = NULL;
6035 s = zbc_program_binOpPrep(&opd1, &n1, &opd2, &n2, false);
6036 if (s) RETURN_STATUS(s);
6038 bc_num_init_DEF_SIZE(&res.d.n);
6039 bc_num_init(&res2.d.n, n2->len);
6041 s = zbc_num_divmod(n1, n2, &res2.d.n, &res.d.n, G.prog.scale);
6044 bc_program_binOpRetire(&res2);
6045 res.t = BC_RESULT_TEMP;
6046 bc_vec_push(&G.prog.results, &res);
6050 bc_num_free(&res2.d.n);
6051 bc_num_free(&res.d.n);
6054 #define zbc_program_divmod(...) (zbc_program_divmod(__VA_ARGS__) COMMA_SUCCESS)
6056 static BC_STATUS zbc_program_modexp(void)
6059 BcResult *r1, *r2, *r3, res;
6060 BcNum *n1, *n2, *n3;
6062 if (!STACK_HAS_MORE_THAN(&G.prog.results, 2))
6063 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6064 s = zbc_program_binOpPrep(&r2, &n2, &r3, &n3, false);
6065 if (s) RETURN_STATUS(s);
6067 r1 = bc_vec_item_rev(&G.prog.results, 2);
6068 s = zbc_program_num(r1, &n1, false);
6069 if (s) RETURN_STATUS(s);
6070 if (!BC_PROG_NUM(r1, n1))
6071 RETURN_STATUS(bc_error_variable_is_wrong_type());
6073 // Make sure that the values have their pointers updated, if necessary.
6074 if (r1->t == BC_RESULT_VAR || r1->t == BC_RESULT_ARRAY_ELEM) {
6075 if (r1->t == r2->t) {
6076 s = zbc_program_num(r2, &n2, false);
6077 if (s) RETURN_STATUS(s);
6079 if (r1->t == r3->t) {
6080 s = zbc_program_num(r3, &n3, false);
6081 if (s) RETURN_STATUS(s);
6085 bc_num_init(&res.d.n, n3->len);
6086 s = zbc_num_modexp(n1, n2, n3, &res.d.n);
6089 bc_vec_pop(&G.prog.results);
6090 bc_program_binOpRetire(&res);
6094 bc_num_free(&res.d.n);
6097 #define zbc_program_modexp(...) (zbc_program_modexp(__VA_ARGS__) COMMA_SUCCESS)
6099 static void bc_program_stackLen(void)
6102 size_t len = G.prog.results.len;
6104 res.t = BC_RESULT_TEMP;
6106 bc_num_init_DEF_SIZE(&res.d.n);
6107 bc_num_ulong2num(&res.d.n, len);
6108 bc_vec_push(&G.prog.results, &res);
6111 static BC_STATUS zbc_program_asciify(void)
6116 char *str, *str2, c;
6117 size_t len = G.prog.strs.len, idx;
6120 if (!STACK_HAS_MORE_THAN(&G.prog.results, 0))
6121 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6122 r = bc_vec_top(&G.prog.results);
6124 num = NULL; // TODO: is this NULL needed?
6125 s = zbc_program_num(r, &num, false);
6126 if (s) RETURN_STATUS(s);
6128 if (BC_PROG_NUM(r, num)) {
6131 bc_num_init_DEF_SIZE(&n);
6132 bc_num_copy(&n, num);
6133 bc_num_truncate(&n, n.rdx);
6135 //TODO: have BcNumSmall type, with static buffer
6136 bc_num_init_DEF_SIZE(&strmb);
6137 bc_num_ulong2num(&strmb, 0x100);
6138 s = zbc_num_mod(&n, &strmb, &n, 0);
6139 bc_num_free(&strmb);
6141 if (s) goto num_err;
6142 s = zbc_num_ulong(&n, &val);
6143 if (s) goto num_err;
6149 idx = (r->t == BC_RESULT_STR) ? r->d.id.idx : num->rdx;
6150 str2 = *bc_program_str(idx);
6156 //str[1] = '\0'; - already is
6158 str2 = xstrdup(str);
6159 idx = bc_program_addFunc(str2);
6161 if (idx != len + BC_PROG_REQ_FUNCS) {
6162 for (idx = 0; idx < G.prog.strs.len; ++idx) {
6163 if (strcmp(*bc_program_str(idx), str) == 0) {
6170 bc_vec_push(&G.prog.strs, &str);
6172 res.t = BC_RESULT_STR;
6174 bc_vec_pop(&G.prog.results);
6175 bc_vec_push(&G.prog.results, &res);
6177 RETURN_STATUS(BC_STATUS_SUCCESS);
6182 #define zbc_program_asciify(...) (zbc_program_asciify(__VA_ARGS__) COMMA_SUCCESS)
6184 static BC_STATUS zbc_program_printStream(void)
6192 if (!STACK_HAS_MORE_THAN(&G.prog.results, 0))
6193 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6194 r = bc_vec_top(&G.prog.results);
6196 s = zbc_program_num(r, &n, false);
6197 if (s) RETURN_STATUS(s);
6199 if (BC_PROG_NUM(r, n)) {
6200 s = zbc_num_printNum(n, 0x100, 1, bc_num_printChar);
6202 idx = (r->t == BC_RESULT_STR) ? r->d.id.idx : n->rdx;
6203 str = *bc_program_str(idx);
6209 #define zbc_program_printStream(...) (zbc_program_printStream(__VA_ARGS__) COMMA_SUCCESS)
6211 static BC_STATUS zbc_program_nquit(void)
6218 s = zbc_program_prep(&opnd, &num);
6219 if (s) RETURN_STATUS(s);
6220 s = zbc_num_ulong(num, &val);
6221 if (s) RETURN_STATUS(s);
6223 bc_vec_pop(&G.prog.results);
6225 if (G.prog.exestack.len < val)
6226 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6227 if (G.prog.exestack.len == val) {
6228 QUIT_OR_RETURN_TO_MAIN;
6231 bc_vec_npop(&G.prog.exestack, val);
6235 #define zbc_program_nquit(...) (zbc_program_nquit(__VA_ARGS__) COMMA_SUCCESS)
6237 static BC_STATUS zbc_program_execStr(char *code, size_t *bgn, bool cond)
6239 BcStatus s = BC_STATUS_SUCCESS;
6247 if (!STACK_HAS_MORE_THAN(&G.prog.results, 0))
6248 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6250 r = bc_vec_top(&G.prog.results);
6253 BcNum *n = n; // for compiler
6256 char *then_name = bc_program_name(code, bgn);
6257 char *else_name = NULL;
6259 if (code[*bgn] == BC_PARSE_STREND)
6262 else_name = bc_program_name(code, bgn);
6264 exec = r->d.n.len != 0;
6266 if (!exec && else_name != NULL) {
6273 v = bc_program_search(name, true);
6280 if (!exec) goto exit;
6281 if (!BC_PROG_STR(n)) {
6282 s = bc_error_variable_is_wrong_type();
6288 if (r->t == BC_RESULT_STR) {
6290 } else if (r->t == BC_RESULT_VAR) {
6292 s = zbc_program_num(r, &n, false);
6293 if (s || !BC_PROG_STR(n)) goto exit;
6299 fidx = sidx + BC_PROG_REQ_FUNCS;
6301 str = bc_program_str(sidx);
6302 f = bc_program_func(fidx);
6304 if (f->code.len == 0) {
6305 bc_parse_create(&prs, fidx);
6306 s = zbc_parse_text_init(&prs, *str);
6308 s = zcommon_parse_expr(&prs, BC_PARSE_NOCALL);
6311 if (prs.l.t.t != BC_LEX_EOF) {
6312 s = bc_error_bad_expression();
6316 bc_parse_free(&prs);
6320 ip.len = G.prog.results.len;
6323 bc_vec_pop(&G.prog.results);
6324 bc_vec_push(&G.prog.exestack, &ip);
6326 RETURN_STATUS(BC_STATUS_SUCCESS);
6328 bc_parse_free(&prs);
6329 f = bc_program_func(fidx);
6330 bc_vec_pop_all(&f->code);
6332 bc_vec_pop(&G.prog.results);
6335 #define zbc_program_execStr(...) (zbc_program_execStr(__VA_ARGS__) COMMA_SUCCESS)
6338 static void bc_program_pushGlobal(char inst)
6343 res.t = inst - BC_INST_IBASE + BC_RESULT_IBASE;
6344 if (inst == BC_INST_IBASE)
6345 val = (unsigned long) G.prog.ib_t;
6346 else if (inst == BC_INST_SCALE)
6347 val = (unsigned long) G.prog.scale;
6349 val = (unsigned long) G.prog.ob_t;
6351 bc_num_init_DEF_SIZE(&res.d.n);
6352 bc_num_ulong2num(&res.d.n, val);
6353 bc_vec_push(&G.prog.results, &res);
6356 static BC_STATUS zbc_program_exec(void)
6360 BcInstPtr *ip = bc_vec_top(&G.prog.exestack);
6361 BcFunc *func = bc_program_func(ip->func);
6362 char *code = func->code.v;
6364 dbg_exec("func:%zd bytes:%zd ip:%zd", ip->func, func->code.len, ip->idx);
6365 while (ip->idx < func->code.len) {
6366 BcStatus s = BC_STATUS_SUCCESS;
6367 char inst = code[ip->idx++];
6369 dbg_exec("inst at %zd:%d", ip->idx - 1, inst);
6372 case BC_INST_JUMP_ZERO: {
6374 dbg_exec("BC_INST_JUMP_ZERO:");
6375 s = zbc_program_prep(&ptr, &num);
6376 if (s) RETURN_STATUS(s);
6377 zero = (bc_num_cmp(num, &G.prog.zero) == 0);
6378 bc_vec_pop(&G.prog.results);
6380 bc_program_index(code, &ip->idx);
6383 // else: fall through
6385 case BC_INST_JUMP: {
6386 size_t idx = bc_program_index(code, &ip->idx);
6387 size_t *addr = bc_vec_item(&func->labels, idx);
6388 dbg_exec("BC_INST_JUMP: to %ld", (long)*addr);
6393 dbg_exec("BC_INST_CALL:");
6394 s = zbc_program_call(code, &ip->idx);
6395 goto read_updated_ip;
6396 case BC_INST_INC_PRE:
6397 case BC_INST_DEC_PRE:
6398 case BC_INST_INC_POST:
6399 case BC_INST_DEC_POST:
6400 dbg_exec("BC_INST_INCDEC:");
6401 s = zbc_program_incdec(inst);
6404 dbg_exec("BC_INST_HALT:");
6405 QUIT_OR_RETURN_TO_MAIN;
6409 dbg_exec("BC_INST_RET[0]:");
6410 s = zbc_program_return(inst);
6411 goto read_updated_ip;
6412 case BC_INST_BOOL_OR:
6413 case BC_INST_BOOL_AND:
6415 case BC_INST_REL_EQ:
6416 case BC_INST_REL_LE:
6417 case BC_INST_REL_GE:
6418 case BC_INST_REL_NE:
6419 case BC_INST_REL_LT:
6420 case BC_INST_REL_GT:
6421 dbg_exec("BC_INST_BOOL:");
6422 s = zbc_program_logical(inst);
6425 dbg_exec("BC_INST_READ:");
6426 s = zbc_program_read();
6427 goto read_updated_ip;
6429 dbg_exec("BC_INST_VAR:");
6430 s = zbc_program_pushVar(code, &ip->idx, false, false);
6432 case BC_INST_ARRAY_ELEM:
6434 dbg_exec("BC_INST_ARRAY[_ELEM]:");
6435 s = zbc_program_pushArray(code, &ip->idx, inst);
6438 r.t = BC_RESULT_LAST;
6439 bc_vec_push(&G.prog.results, &r);
6444 bc_program_pushGlobal(inst);
6446 case BC_INST_SCALE_FUNC:
6447 case BC_INST_LENGTH:
6449 dbg_exec("BC_INST_builtin:");
6450 s = zbc_program_builtin(inst);
6453 dbg_exec("BC_INST_NUM:");
6454 r.t = BC_RESULT_CONSTANT;
6455 r.d.id.idx = bc_program_index(code, &ip->idx);
6456 bc_vec_push(&G.prog.results, &r);
6459 dbg_exec("BC_INST_POP:");
6460 if (!STACK_HAS_MORE_THAN(&G.prog.results, 0))
6461 s = bc_error_stack_has_too_few_elements();
6463 bc_vec_pop(&G.prog.results);
6465 case BC_INST_POP_EXEC:
6466 dbg_exec("BC_INST_POP_EXEC:");
6467 bc_vec_pop(&G.prog.exestack);
6468 goto read_updated_ip;
6470 case BC_INST_PRINT_POP:
6471 case BC_INST_PRINT_STR:
6472 dbg_exec("BC_INST_PRINTxyz:");
6473 s = zbc_program_print(inst, 0);
6476 dbg_exec("BC_INST_STR:");
6477 r.t = BC_RESULT_STR;
6478 r.d.id.idx = bc_program_index(code, &ip->idx);
6479 bc_vec_push(&G.prog.results, &r);
6482 case BC_INST_MULTIPLY:
6483 case BC_INST_DIVIDE:
6484 case BC_INST_MODULUS:
6487 dbg_exec("BC_INST_binaryop:");
6488 s = zbc_program_op(inst);
6490 case BC_INST_BOOL_NOT:
6491 dbg_exec("BC_INST_BOOL_NOT:");
6492 s = zbc_program_prep(&ptr, &num);
6493 if (s) RETURN_STATUS(s);
6494 bc_num_init_DEF_SIZE(&r.d.n);
6495 if (!bc_num_cmp(num, &G.prog.zero))
6497 //else bc_num_zero(&r.d.n); - already is
6498 bc_program_retire(&r, BC_RESULT_TEMP);
6501 dbg_exec("BC_INST_NEG:");
6502 s = zbc_program_negate();
6505 case BC_INST_ASSIGN_POWER:
6506 case BC_INST_ASSIGN_MULTIPLY:
6507 case BC_INST_ASSIGN_DIVIDE:
6508 case BC_INST_ASSIGN_MODULUS:
6509 case BC_INST_ASSIGN_PLUS:
6510 case BC_INST_ASSIGN_MINUS:
6512 case BC_INST_ASSIGN:
6513 dbg_exec("BC_INST_ASSIGNxyz:");
6514 s = zbc_program_assign(inst);
6517 case BC_INST_MODEXP:
6518 s = zbc_program_modexp();
6520 case BC_INST_DIVMOD:
6521 s = zbc_program_divmod();
6523 case BC_INST_EXECUTE:
6524 case BC_INST_EXEC_COND:
6525 s = zbc_program_execStr(code, &ip->idx, inst == BC_INST_EXEC_COND);
6526 goto read_updated_ip;
6527 case BC_INST_PRINT_STACK: {
6529 for (idx = 0; idx < G.prog.results.len; ++idx) {
6530 s = zbc_program_print(BC_INST_PRINT, idx);
6535 case BC_INST_CLEAR_STACK:
6536 bc_vec_pop_all(&G.prog.results);
6538 case BC_INST_STACK_LEN:
6539 bc_program_stackLen();
6541 case BC_INST_DUPLICATE:
6542 if (!STACK_HAS_MORE_THAN(&G.prog.results, 0))
6543 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6544 ptr = bc_vec_top(&G.prog.results);
6545 bc_result_copy(&r, ptr);
6546 bc_vec_push(&G.prog.results, &r);
6548 case BC_INST_SWAP: {
6550 if (!STACK_HAS_MORE_THAN(&G.prog.results, 1))
6551 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6552 ptr = bc_vec_item_rev(&G.prog.results, 0);
6553 ptr2 = bc_vec_item_rev(&G.prog.results, 1);
6554 memcpy(&r, ptr, sizeof(BcResult));
6555 memcpy(ptr, ptr2, sizeof(BcResult));
6556 memcpy(ptr2, &r, sizeof(BcResult));
6559 case BC_INST_ASCIIFY:
6560 s = zbc_program_asciify();
6562 case BC_INST_PRINT_STREAM:
6563 s = zbc_program_printStream();
6566 case BC_INST_PUSH_VAR: {
6567 bool copy = inst == BC_INST_LOAD;
6568 s = zbc_program_pushVar(code, &ip->idx, true, copy);
6571 case BC_INST_PUSH_TO_VAR: {
6572 char *name = bc_program_name(code, &ip->idx);
6573 s = zbc_program_copyToVar(name, true);
6578 dbg_exec("BC_INST_QUIT:");
6579 if (G.prog.exestack.len <= 2)
6580 QUIT_OR_RETURN_TO_MAIN;
6581 bc_vec_npop(&G.prog.exestack, 2);
6582 goto read_updated_ip;
6584 s = zbc_program_nquit();
6585 //goto read_updated_ip; - just fall through to it
6588 // Instruction stack has changed, read new pointers
6589 ip = bc_vec_top(&G.prog.exestack);
6590 func = bc_program_func(ip->func);
6591 code = func->code.v;
6592 dbg_exec("func:%zd bytes:%zd ip:%zd", ip->func, func->code.len, ip->idx);
6595 if (s || G_interrupt) {
6604 RETURN_STATUS(BC_STATUS_SUCCESS);
6606 #define zbc_program_exec(...) (zbc_program_exec(__VA_ARGS__) COMMA_SUCCESS)
6608 static unsigned bc_vm_envLen(const char *var)
6614 len = BC_NUM_PRINT_WIDTH;
6615 if (!lenv) return len;
6617 len = bb_strtou(lenv, NULL, 10) - 1;
6618 if (errno || len < 2 || len >= INT_MAX)
6619 len = BC_NUM_PRINT_WIDTH;
6624 static BC_STATUS zbc_vm_process(const char *text)
6628 dbg_lex_enter("%s:%d entered", __func__, __LINE__);
6629 s = zbc_parse_text_init(&G.prs, text);
6630 if (s) RETURN_STATUS(s);
6632 while (G.prs.l.t.t != BC_LEX_EOF) {
6633 dbg_lex("%s:%d G.prs.l.t.t:%d", __func__, __LINE__, G.prs.l.t.t);
6634 s = zcommon_parse(&G.prs);
6635 if (s) RETURN_STATUS(s);
6636 s = zbc_program_exec();
6643 dbg_lex_done("%s:%d done", __func__, __LINE__);
6646 #define zbc_vm_process(...) (zbc_vm_process(__VA_ARGS__) COMMA_SUCCESS)
6648 static BC_STATUS zbc_vm_execute_FILE(FILE *fp, const char *filename)
6650 // So far bc/dc have no way to include a file from another file,
6651 // therefore we know G.prog.file == NULL on entry
6652 //const char *sv_file;
6655 G.prog.file = filename;
6657 bc_lex_file(&G.prs.l);
6660 s = zbc_vm_process("");
6661 // We do not stop looping on errors here if reading stdin.
6662 // Example: start interactive bc and enter "return".
6663 // It should say "'return' not in a function"
6664 // but should not exit.
6665 } while (G.input_fp == stdin);
6669 #define zbc_vm_execute_FILE(...) (zbc_vm_execute_FILE(__VA_ARGS__) COMMA_SUCCESS)
6671 static BC_STATUS zbc_vm_file(const char *file)
6676 fp = xfopen_for_read(file);
6677 s = zbc_vm_execute_FILE(fp, file);
6682 #define zbc_vm_file(...) (zbc_vm_file(__VA_ARGS__) COMMA_SUCCESS)
6685 static void bc_vm_info(void)
6687 printf("%s "BB_VER"\n"
6688 "Copyright (c) 2018 Gavin D. Howard and contributors\n"
6692 static void bc_args(char **argv)
6698 #if ENABLE_FEATURE_BC_LONG_OPTIONS
6699 opts = option_mask32 |= getopt32long(argv, "wvsqli",
6700 "warn\0" No_argument "w"
6701 "version\0" No_argument "v"
6702 "standard\0" No_argument "s"
6703 "quiet\0" No_argument "q"
6704 "mathlib\0" No_argument "l"
6705 "interactive\0" No_argument "i"
6708 opts = option_mask32 |= getopt32(argv, "wvsqli");
6710 if (getenv("POSIXLY_CORRECT"))
6711 option_mask32 |= BC_FLAG_S;
6713 if (opts & BC_FLAG_V) {
6718 for (i = optind; argv[i]; ++i)
6719 bc_vec_push(&G.files, argv + i);
6722 static void bc_vm_envArgs(void)
6726 char *env_args = getenv("BC_ENV_ARGS");
6728 if (!env_args) return;
6730 G.env_args = xstrdup(env_args);
6733 bc_vec_init(&v, sizeof(char *), NULL);
6735 while (*(buf = skip_whitespace(buf)) != '\0') {
6736 bc_vec_push(&v, &buf);
6737 buf = skip_non_whitespace(buf);
6743 // NULL terminate, and pass argv[] so that first arg is argv[1]
6744 if (sizeof(int) == sizeof(char*)) {
6745 bc_vec_push(&v, &const_int_0);
6747 static char *const nullptr = NULL;
6748 bc_vec_push(&v, &nullptr);
6750 bc_args(((char **)v.v) - 1);
6755 static const char bc_lib[] ALIGN1 = {
6758 "\n" "auto b,s,n,r,d,i,p,f,v"
6759 ////////////////"if(x<0)return(1/e(-x))" // and drop 'n' and x<0 logic below
6760 //^^^^^^^^^^^^^^^^ this would work, and is even more precise than GNU bc:
6761 //e(-.998896): GNU:.36828580434569428695
6762 // above code:.36828580434569428696
6763 // actual value:.3682858043456942869594...
6764 // but for now let's be "GNU compatible"
6773 "\n" "scale=scale(x)+1"
6783 "\n" "for(i=2;v;++i){"
6789 "\n" "while(d--)r*=r"
6792 "\n" "if(n)return(1/r)"
6796 "\n" "auto b,s,r,p,a,q,i,v"
6800 "\n" "r=(1-10^scale)/1"
6811 "\n" "while(x<=.5){"
6815 "\n" "r=a=(x-1)/(x+1)"
6818 "\n" "for(i=3;v;i+=2){"
6829 "\n" "auto b,s,r,a,q,i"
6830 "\n" "if(x<0)return(-s(-x))"
6834 "\n" "scale=1.1*s+2"
6843 "\n" "for(i=3;a;i+=2){"
6844 "\n" "a*=q/(i*(i-1))"
6857 "\n" "x=s(2*a(1)+x)"
6863 "\n" "auto b,s,r,n,a,m,t,f,i,u"
6871 "\n" "if(scale<65){"
6872 "\n" "if(x==1)return(.7853981633974483096156608458198757210492923498437764552437361480/n)"
6873 "\n" "if(x==.2)return(.1973955598498807583700497651947902934475851037878521015176889402/n)"
6883 "\n" "x=(x-.2)/(1+.2*x)"
6888 "\n" "for(i=3;t;i+=2){"
6895 "\n" "return((m*a+r)/n)"
6897 "\n" "define j(n,x){"
6898 "\n" "auto b,s,o,a,i,v,f"
6909 "\n" "for(i=2;i<=n;++i)a*=i"
6911 "\n" "a=(x^n)/2^n/a"
6914 "\n" "scale+=length(a)-scale(a)"
6915 "\n" "for(i=1;v;++i){"
6916 "\n" "v=v*f/i/(n+i)"
6922 "\n" "return(a*r/1)"
6927 static BC_STATUS zbc_vm_exec(void)
6934 if (option_mask32 & BC_FLAG_L) {
6935 // We know that internal library is not buggy,
6936 // thus error checking is normally disabled.
6937 # define DEBUG_LIB 0
6938 bc_lex_file(&G.prs.l);
6939 s = zbc_vm_process(bc_lib);
6940 if (DEBUG_LIB && s) RETURN_STATUS(s);
6944 s = BC_STATUS_SUCCESS;
6945 fname = (void*)G.files.v;
6946 for (i = 0; i < G.files.len; i++) {
6947 s = zbc_vm_file(*fname++);
6948 if (ENABLE_FEATURE_CLEAN_UP && !G_ttyin && s) {
6949 // Debug config, non-interactive mode:
6950 // return all the way back to main.
6951 // Non-debug builds do not come here
6952 // in non-interactive mode, they exit.
6957 if (IS_BC || (option_mask32 & BC_FLAG_I))
6958 s = zbc_vm_execute_FILE(stdin, /*filename:*/ NULL);
6962 #define zbc_vm_exec(...) (zbc_vm_exec(__VA_ARGS__) COMMA_SUCCESS)
6964 #if ENABLE_FEATURE_CLEAN_UP
6965 static void bc_program_free(void)
6967 bc_vec_free(&G.prog.fns);
6968 bc_vec_free(&G.prog.fn_map);
6969 bc_vec_free(&G.prog.vars);
6970 bc_vec_free(&G.prog.var_map);
6971 bc_vec_free(&G.prog.arrs);
6972 bc_vec_free(&G.prog.arr_map);
6973 bc_vec_free(&G.prog.strs);
6974 bc_vec_free(&G.prog.consts);
6975 bc_vec_free(&G.prog.results);
6976 bc_vec_free(&G.prog.exestack);
6977 bc_num_free(&G.prog.last);
6978 bc_num_free(&G.prog.zero);
6979 bc_num_free(&G.prog.one);
6980 bc_vec_free(&G.input_buffer);
6983 static void bc_vm_free(void)
6985 bc_vec_free(&G.files);
6987 bc_parse_free(&G.prs);
6992 static void bc_program_init(void)
6996 // memset(&G.prog, 0, sizeof(G.prog)); - already is
6997 memset(&ip, 0, sizeof(BcInstPtr));
6999 // G.prog.nchars = G.prog.scale = 0; - already is
7003 bc_num_init_DEF_SIZE(&G.prog.last);
7004 //bc_num_zero(&G.prog.last); - already is
7006 bc_num_init_DEF_SIZE(&G.prog.zero);
7007 //bc_num_zero(&G.prog.zero); - already is
7009 bc_num_init_DEF_SIZE(&G.prog.one);
7010 bc_num_one(&G.prog.one);
7012 bc_vec_init(&G.prog.fns, sizeof(BcFunc), bc_func_free);
7013 bc_vec_init(&G.prog.fn_map, sizeof(BcId), bc_id_free);
7015 //TODO: with "", dc_strings.dc enters infinite loop, ??!
7016 bc_program_addFunc(xstrdup("(m)")); // func #0: main
7017 bc_program_addFunc(xstrdup("(r)")); // func #1: for read()
7019 bc_vec_init(&G.prog.vars, sizeof(BcVec), bc_vec_free);
7020 bc_vec_init(&G.prog.var_map, sizeof(BcId), bc_id_free);
7022 bc_vec_init(&G.prog.arrs, sizeof(BcVec), bc_vec_free);
7023 bc_vec_init(&G.prog.arr_map, sizeof(BcId), bc_id_free);
7025 bc_vec_init(&G.prog.strs, sizeof(char *), bc_string_free);
7026 bc_vec_init(&G.prog.consts, sizeof(char *), bc_string_free);
7027 bc_vec_init(&G.prog.results, sizeof(BcResult), bc_result_free);
7028 bc_vec_init(&G.prog.exestack, sizeof(BcInstPtr), NULL);
7029 bc_vec_push(&G.prog.exestack, &ip);
7031 bc_char_vec_init(&G.input_buffer);
7034 static int bc_vm_init(const char *env_len)
7036 #if ENABLE_FEATURE_EDITING
7037 G.line_input_state = new_line_input_t(DO_HISTORY);
7039 G.prog.len = bc_vm_envLen(env_len);
7041 bc_vec_init(&G.files, sizeof(char *), NULL);
7042 IF_BC(if (IS_BC) bc_vm_envArgs();)
7044 bc_parse_create(&G.prs, BC_PROG_MAIN);
7046 //TODO: in GNU bc, the check is (isatty(0) && isatty(1)),
7047 //-i option unconditionally enables this regardless of isatty():
7049 #if ENABLE_FEATURE_BC_SIGNALS
7051 // With SA_RESTART, most system calls will restart
7052 // (IOW: they won't fail with EINTR).
7053 // In particular, this means ^C won't cause
7054 // stdout to get into "error state" if SIGINT hits
7055 // within write() syscall.
7057 // The downside is that ^C while tty input is taken
7058 // will only be handled after [Enter] since read()
7059 // from stdin is not interrupted by ^C either,
7060 // it restarts, thus fgetc() does not return on ^C.
7061 // (This problem manifests only if line editing is disabled)
7062 signal_SA_RESTART_empty_mask(SIGINT, record_signo);
7064 // Without SA_RESTART, this exhibits a bug:
7065 // "while (1) print 1" and try ^C-ing it.
7066 // Intermittently, instead of returning to input line,
7067 // you'll get "output error: Interrupted system call"
7069 //signal_no_SA_RESTART_empty_mask(SIGINT, record_signo);
7073 return 0; // "not a tty"
7076 static BcStatus bc_vm_run(void)
7078 BcStatus st = zbc_vm_exec();
7079 #if ENABLE_FEATURE_CLEAN_UP
7080 if (G_exiting) // it was actually "halt" or "quit"
7083 # if ENABLE_FEATURE_EDITING
7084 free_line_input_t(G.line_input_state);
7088 dbg_exec("exiting with exitcode %d", st);
7093 int bc_main(int argc, char **argv) MAIN_EXTERNALLY_VISIBLE;
7094 int bc_main(int argc UNUSED_PARAM, char **argv)
7100 is_tty = bc_vm_init("BC_LINE_LENGTH");
7104 if (is_tty && !(option_mask32 & BC_FLAG_Q))
7112 int dc_main(int argc, char **argv) MAIN_EXTERNALLY_VISIBLE;
7113 int dc_main(int argc UNUSED_PARAM, char **argv)
7119 // TODO: dc (GNU bc 1.07.1) 1.4.1 seems to use width
7120 // 1 char wider than bc from the same package.
7121 // Both default width, and xC_LINE_LENGTH=N are wider:
7122 // "DC_LINE_LENGTH=5 dc -e'123456 p'" prints:
7125 // "echo '123456' | BC_LINE_LENGTH=5 bc" prints:
7128 // Do the same, or it's a bug?
7129 bc_vm_init("DC_LINE_LENGTH");
7131 // Run -e'SCRIPT' and -fFILE in order of appearance, then handle FILEs
7132 noscript = BC_FLAG_I;
7134 int n = getopt(argc, argv, "e:f:x");
7140 n = zbc_vm_process(optarg);
7145 n = zbc_vm_file(optarg);
7149 option_mask32 |= DC_FLAG_X;
7159 bc_vec_push(&G.files, argv++);
7162 option_mask32 |= noscript; // set BC_FLAG_I if we need to interpret stdin
7168 #endif // not DC_SMALL