1 /* vi: set sw=4 ts=4: */
3 * Licensed under GPLv2 or later, see file LICENSE in this source tree.
4 * Adapted from https://github.com/gavinhoward/bc
5 * Original code copyright (c) 2018 Gavin D. Howard and contributors.
8 //config: bool "bc (45 kb)"
11 //config: bc is a command-line, arbitrary-precision calculator with a
12 //config: Turing-complete language. See the GNU bc manual
13 //config: (https://www.gnu.org/software/bc/manual/bc.html) and bc spec
14 //config: (http://pubs.opengroup.org/onlinepubs/9699919799/utilities/bc.html).
16 //config: This bc has five differences to the GNU bc:
17 //config: 1) The period (.) is a shortcut for "last", as in the BSD bc.
18 //config: 2) Arrays are copied before being passed as arguments to
19 //config: functions. This behavior is required by the bc spec.
20 //config: 3) Arrays can be passed to the builtin "length" function to get
21 //config: the number of elements in the array. This prints "1":
22 //config: a[0] = 0; length(a[])
23 //config: 4) The precedence of the boolean "not" operator (!) is equal to
24 //config: that of the unary minus (-) negation operator. This still
25 //config: allows POSIX-compliant scripts to work while somewhat
26 //config: preserving expected behavior (versus C) and making parsing
28 //config: 5) "read()" accepts expressions, not only numeric literals.
31 //config: -i --interactive force interactive mode
32 //config: -q --quiet don't print version and copyright
33 //config: -s --standard error if any non-POSIX extensions are used
34 //config: -w --warn warn if any non-POSIX extensions are used
35 //config: -l --mathlib use predefined math routines:
36 //config: s(expr) sine in radians
37 //config: c(expr) cosine in radians
38 //config: a(expr) arctangent, returning radians
39 //config: l(expr) natural log
40 //config: e(expr) raises e to the power of expr
41 //config: j(n, x) Bessel function of integer order n of x
44 //config: bool "dc (36 kb)"
47 //config: dc is a reverse-polish notation command-line calculator which
48 //config: supports unlimited precision arithmetic. See the FreeBSD man page
49 //config: (https://www.unix.com/man-page/FreeBSD/1/dc/) and GNU dc manual
50 //config: (https://www.gnu.org/software/bc/manual/dc-1.05/html_mono/dc.html).
52 //config: This dc has a few differences from the two above:
53 //config: 1) When printing a byte stream (command "P"), this dc follows what
54 //config: the FreeBSD dc does.
55 //config: 2) Implements the GNU extensions for divmod ("~") and
56 //config: modular exponentiation ("|").
57 //config: 3) Implements all FreeBSD extensions, except for "J" and "M".
58 //config: 4) Like the FreeBSD dc, this dc supports extended registers.
59 //config: However, they are implemented differently. When it encounters
60 //config: whitespace where a register should be, it skips the whitespace.
61 //config: If the character following is not a lowercase letter, an error
62 //config: is issued. Otherwise, the register name is parsed by the
63 //config: following regex:
64 //config: [a-z][a-z0-9_]*
65 //config: This generally means that register names will be surrounded by
66 //config: whitespace. Examples:
67 //config: l idx s temp L index S temp2 < do_thing
68 //config: Also note that, like the FreeBSD dc, extended registers are not
69 //config: allowed unless the "-x" option is given.
71 //config:config FEATURE_DC_SMALL
72 //config: bool "Minimal dc implementation (4.2 kb), not using bc code base"
73 //config: depends on DC && !BC
76 //config:config FEATURE_DC_LIBM
77 //config: bool "Enable power and exp functions (requires libm)"
79 //config: depends on FEATURE_DC_SMALL
81 //config: Enable power and exp functions.
82 //config: NOTE: This will require libm to be present for linking.
84 //config:config FEATURE_BC_SIGNALS
85 //config: bool "Interactive mode (+4kb)"
87 //config: depends on (BC || DC) && !FEATURE_DC_SMALL
89 //config: Enable interactive mode: when started on a tty,
90 //config: ^C interrupts execution and returns to command line,
91 //config: errors also return to command line instead of exiting,
92 //config: line editing with history is available.
94 //config: With this option off, input can still be taken from tty,
95 //config: but all errors are fatal, ^C is fatal,
96 //config: tty is treated exactly the same as any other
97 //config: standard input (IOW: no line editing).
99 //config:config FEATURE_BC_LONG_OPTIONS
100 //config: bool "Enable bc/dc long options"
102 //config: depends on (BC || DC) && !FEATURE_DC_SMALL
104 //config: Enable long options for bc and dc.
106 //applet:IF_BC(APPLET(bc, BB_DIR_USR_BIN, BB_SUID_DROP))
107 //applet:IF_DC(APPLET(dc, BB_DIR_USR_BIN, BB_SUID_DROP))
109 //kbuild:lib-$(CONFIG_BC) += bc.o
110 //kbuild:lib-$(CONFIG_DC) += bc.o
112 //See www.gnu.org/software/bc/manual/bc.html
113 //usage:#define bc_trivial_usage
114 //usage: "[-sqlw] FILE..."
116 //usage:#define bc_full_usage "\n"
117 //usage: "\nArbitrary precision calculator"
119 ///////: "\n -i Interactive" - has no effect for now
120 //usage: "\n -q Quiet"
121 //usage: "\n -l Load standard math library"
122 //usage: "\n -s Be POSIX compatible"
123 //usage: "\n -w Warn if extensions are used"
124 ///////: "\n -v Version"
126 //usage: "\n$BC_LINE_LENGTH changes output width"
128 //usage:#define bc_example_usage
129 //usage: "3 + 4.129\n"
130 //usage: "1903 - 2893\n"
131 //usage: "-129 * 213.28935\n"
132 //usage: "12 / -1932\n"
134 //usage: "34 ^ 189\n"
135 //usage: "scale = 13\n"
136 //usage: "ibase = 2\n"
137 //usage: "obase = A\n"
139 //usage:#define dc_trivial_usage
140 //usage: IF_NOT_FEATURE_DC_SMALL("[-x] ")"[-eSCRIPT]... [-fFILE]... [FILE]..."
142 //usage:#define dc_full_usage "\n"
143 //usage: "\nTiny RPN calculator. Operations:"
144 //usage: "\n+, -, *, /, %, ~, ^," IF_NOT_FEATURE_DC_SMALL(" |,")
145 //usage: "\np - print top of the stack without popping"
146 //usage: "\nf - print entire stack"
147 //usage: "\nk - pop the value and set the precision"
148 //usage: "\ni - pop the value and set input radix"
149 //usage: "\no - pop the value and set output radix"
150 //usage: "\nExamples: dc -e'2 2 + p' -> 4, dc -e'8 8 * 2 2 + / p' -> 16"
152 //usage:#define dc_example_usage
153 //usage: "$ dc -e'2 2 + p'\n"
155 //usage: "$ dc -e'8 8 \\* 2 2 + / p'\n"
157 //usage: "$ dc -e'0 1 & p'\n"
159 //usage: "$ dc -e'0 1 | p'\n"
161 //usage: "$ echo '72 9 / 8 * p' | dc\n"
165 #include "common_bufsiz.h"
167 #if ENABLE_FEATURE_DC_SMALL
171 #define DEBUG_LEXER 0
172 #define DEBUG_COMPILE 0
174 // This can be left enabled for production as well:
175 #define SANITY_CHECKS 1
178 static uint8_t lex_indent;
179 #define dbg_lex(...) \
181 fprintf(stderr, "%*s", lex_indent, ""); \
182 bb_error_msg(__VA_ARGS__); \
184 #define dbg_lex_enter(...) \
186 dbg_lex(__VA_ARGS__); \
189 #define dbg_lex_done(...) \
192 dbg_lex(__VA_ARGS__); \
195 # define dbg_lex(...) ((void)0)
196 # define dbg_lex_enter(...) ((void)0)
197 # define dbg_lex_done(...) ((void)0)
201 # define dbg_compile(...) bb_error_msg(__VA_ARGS__)
203 # define dbg_compile(...) ((void)0)
207 # define dbg_exec(...) bb_error_msg(__VA_ARGS__)
209 # define dbg_exec(...) ((void)0)
212 typedef enum BcStatus {
213 BC_STATUS_SUCCESS = 0,
214 BC_STATUS_FAILURE = 1,
215 BC_STATUS_PARSE_EMPTY_EXP = 2, // bc_parse_expr_empty_ok() uses this
218 #define BC_VEC_INVALID_IDX ((size_t) -1)
219 #define BC_VEC_START_CAP (1 << 5)
221 typedef void (*BcVecFree)(void *) FAST_FUNC;
223 typedef struct BcVec {
231 typedef signed char BcDig;
233 typedef struct BcNum {
241 #define BC_NUM_MAX_IBASE ((unsigned long) 16)
242 // larger value might speed up BIGNUM calculations a bit:
243 #define BC_NUM_DEF_SIZE (16)
244 #define BC_NUM_PRINT_WIDTH (69)
246 #define BC_NUM_KARATSUBA_LEN (32)
248 typedef enum BcInst {
255 XC_INST_NEG, // order
257 XC_INST_REL_EQ, // should
258 XC_INST_REL_LE, // match
259 XC_INST_REL_GE, // LEX
260 XC_INST_REL_NE, // constants
261 XC_INST_REL_LT, // for
262 XC_INST_REL_GT, // these
264 XC_INST_POWER, // operations
265 XC_INST_MULTIPLY, // |
267 XC_INST_MODULUS, // |
271 XC_INST_BOOL_NOT, // |
272 XC_INST_BOOL_OR, // |
273 XC_INST_BOOL_AND, // |
275 BC_INST_ASSIGN_POWER, // |
276 BC_INST_ASSIGN_MULTIPLY,// |
277 BC_INST_ASSIGN_DIVIDE, // |
278 BC_INST_ASSIGN_MODULUS, // |
279 BC_INST_ASSIGN_PLUS, // |
280 BC_INST_ASSIGN_MINUS, // |
290 XC_INST_IBASE, // order of these constans should match other enums
291 XC_INST_OBASE, // order of these constans should match other enums
292 XC_INST_SCALE, // order of these constans should match other enums
293 IF_BC(BC_INST_LAST,) // order of these constans should match other enums
324 DC_INST_PRINT_STREAM,
339 DC_INST_INVALID = -1,
343 typedef struct BcId {
348 typedef struct BcFunc {
354 IF_BC(size_t nparams;)
357 typedef enum BcResultType {
361 XC_RESULT_ARRAY_ELEM,
366 //code uses "inst - XC_INST_IBASE + XC_RESULT_IBASE" construct,
367 XC_RESULT_IBASE, // relative order should match for: XC_INST_IBASE
368 XC_RESULT_OBASE, // relative order should match for: XC_INST_OBASE
369 XC_RESULT_SCALE, // relative order should match for: XC_INST_SCALE
370 IF_BC(BC_RESULT_LAST,) // relative order should match for: BC_INST_LAST
372 IF_BC(BC_RESULT_ONE,)
375 typedef union BcResultData {
381 typedef struct BcResult {
386 typedef struct BcInstPtr {
389 IF_BC(size_t results_len_before_call;)
392 typedef enum BcLexType {
403 XC_LEX_NEG = XC_LEX_1st_op, // order
405 XC_LEX_OP_REL_EQ, // should
406 XC_LEX_OP_REL_LE, // match
407 XC_LEX_OP_REL_GE, // INST
408 XC_LEX_OP_REL_NE, // constants
409 XC_LEX_OP_REL_LT, // for
410 XC_LEX_OP_REL_GT, // these
412 XC_LEX_OP_POWER, // operations
413 XC_LEX_OP_MULTIPLY, // |
414 XC_LEX_OP_DIVIDE, // |
415 XC_LEX_OP_MODULUS, // |
417 XC_LEX_OP_MINUS, // |
418 XC_LEX_OP_last = XC_LEX_OP_MINUS,
420 BC_LEX_OP_BOOL_NOT, // |
421 BC_LEX_OP_BOOL_OR, // |
422 BC_LEX_OP_BOOL_AND, // |
424 BC_LEX_OP_ASSIGN_POWER, // |
425 BC_LEX_OP_ASSIGN_MULTIPLY, // |
426 BC_LEX_OP_ASSIGN_DIVIDE, // |
427 BC_LEX_OP_ASSIGN_MODULUS, // |
428 BC_LEX_OP_ASSIGN_PLUS, // |
429 BC_LEX_OP_ASSIGN_MINUS, // |
431 BC_LEX_OP_ASSIGN, // V
436 BC_LEX_LPAREN, // () are 0x28 and 0x29
437 BC_LEX_RPAREN, // must be LPAREN+1: code uses (c - '(' + BC_LEX_LPAREN)
439 BC_LEX_LBRACKET, // [] are 0x5B and 0x5D
441 BC_LEX_RBRACKET, // must be LBRACKET+2: code uses (c - '[' + BC_LEX_LBRACKET)
443 BC_LEX_LBRACE, // {} are 0x7B and 0x7D
445 BC_LEX_RBRACE, // must be LBRACE+2: code uses (c - '{' + BC_LEX_LBRACE)
447 BC_LEX_KEY_1st_keyword,
448 BC_LEX_KEY_AUTO = BC_LEX_KEY_1st_keyword,
455 // code uses "type - BC_LEX_KEY_IBASE + XC_INST_IBASE" construct,
456 BC_LEX_KEY_IBASE, // relative order should match for: XC_INST_IBASE
457 BC_LEX_KEY_OBASE, // relative order should match for: XC_INST_OBASE
459 IF_BC(BC_LEX_KEY_LAST,) // relative order should match for: BC_INST_LAST
472 DC_LEX_OP_BOOL_NOT = XC_LEX_OP_last + 1,
504 // code uses "t - DC_LEX_STORE_IBASE + XC_INST_IBASE" construct,
505 DC_LEX_STORE_IBASE, // relative order should match for: XC_INST_IBASE
506 DC_LEX_STORE_OBASE, // relative order should match for: XC_INST_OBASE
507 DC_LEX_STORE_SCALE, // relative order should match for: XC_INST_SCALE
516 // must match order of BC_LEX_KEY_foo etc above
518 struct BcLexKeyword {
521 #define LEX_KW_ENTRY(a, b) \
522 { .name8 = a /*, .posix = b */ }
523 static const struct BcLexKeyword bc_lex_kws[20] = {
524 LEX_KW_ENTRY("auto" , 1), // 0
525 LEX_KW_ENTRY("break" , 1), // 1
526 LEX_KW_ENTRY("continue", 0), // 2 note: this one has no terminating NUL
527 LEX_KW_ENTRY("define" , 1), // 3
528 LEX_KW_ENTRY("else" , 0), // 4
529 LEX_KW_ENTRY("for" , 1), // 5
530 LEX_KW_ENTRY("halt" , 0), // 6
531 LEX_KW_ENTRY("ibase" , 1), // 7
532 LEX_KW_ENTRY("obase" , 1), // 8
533 LEX_KW_ENTRY("if" , 1), // 9
534 LEX_KW_ENTRY("last" , 0), // 10
535 LEX_KW_ENTRY("length" , 1), // 11
536 LEX_KW_ENTRY("limits" , 0), // 12
537 LEX_KW_ENTRY("print" , 0), // 13
538 LEX_KW_ENTRY("quit" , 1), // 14
539 LEX_KW_ENTRY("read" , 0), // 15
540 LEX_KW_ENTRY("return" , 1), // 16
541 LEX_KW_ENTRY("scale" , 1), // 17
542 LEX_KW_ENTRY("sqrt" , 1), // 18
543 LEX_KW_ENTRY("while" , 1), // 19
546 #define STRING_else (bc_lex_kws[4].name8)
547 #define STRING_for (bc_lex_kws[5].name8)
548 #define STRING_if (bc_lex_kws[9].name8)
549 #define STRING_while (bc_lex_kws[19].name8)
573 #define keyword_is_POSIX(i) ((1 << (i)) & POSIX_KWORD_MASK)
575 // This is a bit array that corresponds to token types. An entry is
576 // true if the token is valid in an expression, false otherwise.
577 // Used to figure out when expr parsing should stop *without error message*
578 // - 0 element indicates this condition. 1 means "this token is to be eaten
579 // as part of the expression", it can then still be determined to be invalid
580 // by later processing.
582 #define EXBITS(a,b,c,d,e,f,g,h) \
583 ((uint64_t)((a << 0)+(b << 1)+(c << 2)+(d << 3)+(e << 4)+(f << 5)+(g << 6)+(h << 7)))
584 BC_PARSE_EXPRS_BITS = 0 // corresponding BC_LEX_xyz:
585 + (EXBITS(0,0,0,0,0,1,1,1) << (0*8)) // 0: EOF INVAL NL WS STR NAME NUM -
586 + (EXBITS(1,1,1,1,1,1,1,1) << (1*8)) // 8: == <= >= != < > ^ *
587 + (EXBITS(1,1,1,1,1,1,1,1) << (2*8)) // 16: / % + - ! || && ^=
588 + (EXBITS(1,1,1,1,1,1,1,1) << (3*8)) // 24: *= /= %= += -= = ++ --
589 + (EXBITS(1,1,0,0,0,0,0,0) << (4*8)) // 32: ( ) [ , ] { ; }
590 + (EXBITS(0,0,0,0,0,0,0,1) << (5*8)) // 40: auto break cont define else for halt ibase
591 + (EXBITS(1,0,1,1,0,0,0,1) << (6*8)) // 48: obase if last length limits print quit read
592 + (EXBITS(0,1,1,0,0,0,0,0) << (7*8)) // 56: return scale sqrt while
595 static ALWAYS_INLINE long lex_allowed_in_bc_expr(unsigned i)
597 #if ULONG_MAX > 0xffffffff
598 // 64-bit version (will not work correctly for 32-bit longs!)
599 return BC_PARSE_EXPRS_BITS & (1UL << i);
602 unsigned long m = (uint32_t)BC_PARSE_EXPRS_BITS;
604 m = (uint32_t)(BC_PARSE_EXPRS_BITS >> 32);
607 return m & (1UL << i);
611 // This is an array of data for operators that correspond to
612 // [XC_LEX_1st_op...] token types.
613 static const uint8_t bc_parse_ops[] ALIGN1 = {
614 #define OP(p,l) ((int)(l) * 0x10 + (p))
616 OP(6, true ), OP( 6, true ), OP( 6, true ), OP( 6, true ), OP( 6, true ), OP( 6, true ), // == <= >= != < >
618 OP(3, true ), OP( 3, true ), OP( 3, true ), // mul div mod
619 OP(4, true ), OP( 4, true ), // + -
621 OP(7, true ), OP( 7, true ), // or and
622 OP(5, false), OP( 5, false ), OP( 5, false ), OP( 5, false ), OP( 5, false ), // ^= *= /= %= +=
623 OP(5, false), OP( 5, false ), // -= =
624 OP(0, false), OP( 0, false ), // inc dec
627 #define bc_parse_op_PREC(i) (bc_parse_ops[i] & 0x0f)
628 #define bc_parse_op_LEFT(i) (bc_parse_ops[i] & 0x10)
632 static const //BcLexType - should be this type
634 dc_char_to_LEX[] ALIGN1 = {
636 XC_LEX_OP_MODULUS, XC_LEX_INVALID, XC_LEX_INVALID, DC_LEX_LPAREN,
638 XC_LEX_INVALID, XC_LEX_OP_MULTIPLY, XC_LEX_OP_PLUS, XC_LEX_INVALID,
640 XC_LEX_OP_MINUS, XC_LEX_INVALID, XC_LEX_OP_DIVIDE,
642 XC_LEX_INVALID, XC_LEX_INVALID, XC_LEX_INVALID, XC_LEX_INVALID,
643 XC_LEX_INVALID, XC_LEX_INVALID, XC_LEX_INVALID, XC_LEX_INVALID,
644 XC_LEX_INVALID, XC_LEX_INVALID,
646 DC_LEX_COLON, DC_LEX_SCOLON, XC_LEX_OP_REL_GT, XC_LEX_OP_REL_EQ,
647 XC_LEX_OP_REL_LT, DC_LEX_READ, XC_LEX_INVALID,
649 XC_LEX_INVALID, XC_LEX_INVALID, XC_LEX_INVALID, XC_LEX_INVALID,
650 XC_LEX_INVALID, XC_LEX_INVALID, DC_LEX_EQ_NO_REG, XC_LEX_INVALID,
652 DC_LEX_IBASE, XC_LEX_INVALID, DC_LEX_SCALE, DC_LEX_LOAD_POP,
653 XC_LEX_INVALID, DC_LEX_OP_BOOL_NOT, DC_LEX_OBASE, DC_LEX_PRINT_STREAM,
655 DC_LEX_NQUIT, DC_LEX_POP, DC_LEX_STORE_PUSH, XC_LEX_INVALID, XC_LEX_INVALID,
656 XC_LEX_INVALID, XC_LEX_INVALID, DC_LEX_SCALE_FACTOR, XC_LEX_INVALID,
658 DC_LEX_LENGTH, XC_LEX_INVALID, XC_LEX_INVALID, XC_LEX_INVALID,
660 XC_LEX_OP_POWER, XC_LEX_NEG, XC_LEX_INVALID,
662 DC_LEX_ASCIIFY, XC_LEX_INVALID, DC_LEX_CLEAR_STACK, DC_LEX_DUPLICATE,
663 DC_LEX_ELSE, DC_LEX_PRINT_STACK, XC_LEX_INVALID, XC_LEX_INVALID,
665 DC_LEX_STORE_IBASE, XC_LEX_INVALID, DC_LEX_STORE_SCALE, DC_LEX_LOAD,
666 XC_LEX_INVALID, DC_LEX_PRINT_POP, DC_LEX_STORE_OBASE, DC_LEX_PRINT,
668 DC_LEX_QUIT, DC_LEX_SWAP, DC_LEX_OP_ASSIGN, XC_LEX_INVALID,
669 XC_LEX_INVALID, DC_LEX_SQRT, XC_LEX_INVALID, DC_LEX_EXECUTE,
671 XC_LEX_INVALID, DC_LEX_STACK_LEVEL,
673 DC_LEX_LBRACE, DC_LEX_OP_MODEXP, XC_LEX_INVALID, DC_LEX_OP_DIVMOD,
675 static const //BcInst - should be this type. Using signed narrow type since DC_INST_INVALID is -1
677 dc_LEX_to_INST[] ALIGN1 = { //starts at XC_LEX_OP_POWER // corresponding XC/DC_LEX_xyz:
678 XC_INST_POWER, XC_INST_MULTIPLY, // XC_LEX_OP_POWER XC_LEX_OP_MULTIPLY
679 XC_INST_DIVIDE, XC_INST_MODULUS, // XC_LEX_OP_DIVIDE XC_LEX_OP_MODULUS
680 XC_INST_PLUS, XC_INST_MINUS, // XC_LEX_OP_PLUS XC_LEX_OP_MINUS
681 XC_INST_BOOL_NOT, // DC_LEX_OP_BOOL_NOT
682 DC_INST_INVALID, // DC_LEX_OP_ASSIGN
683 XC_INST_REL_GT, // DC_LEX_LPAREN
684 DC_INST_INVALID, // DC_LEX_SCOLON
685 DC_INST_INVALID, // DC_LEX_READ
686 XC_INST_IBASE, // DC_LEX_IBASE
687 XC_INST_SCALE, // DC_LEX_SCALE
688 XC_INST_OBASE, // DC_LEX_OBASE
689 XC_INST_LENGTH, // DC_LEX_LENGTH
690 XC_INST_PRINT, // DC_LEX_PRINT
691 DC_INST_QUIT, // DC_LEX_QUIT
692 XC_INST_SQRT, // DC_LEX_SQRT
693 XC_INST_REL_GE, // DC_LEX_LBRACE
694 XC_INST_REL_EQ, // DC_LEX_EQ_NO_REG
695 DC_INST_MODEXP, DC_INST_DIVMOD, // DC_LEX_OP_MODEXP DC_LEX_OP_DIVMOD
696 DC_INST_INVALID, DC_INST_INVALID, // DC_LEX_COLON DC_LEX_ELSE
697 DC_INST_EXECUTE, // DC_LEX_EXECUTE
698 DC_INST_PRINT_STACK, DC_INST_CLEAR_STACK, // DC_LEX_PRINT_STACK DC_LEX_CLEAR_STACK
699 DC_INST_STACK_LEN, DC_INST_DUPLICATE, // DC_LEX_STACK_LEVEL DC_LEX_DUPLICATE
700 DC_INST_SWAP, XC_INST_POP, // DC_LEX_SWAP DC_LEX_POP
701 DC_INST_ASCIIFY, DC_INST_PRINT_STREAM, // DC_LEX_ASCIIFY DC_LEX_PRINT_STREAM
702 DC_INST_INVALID, DC_INST_INVALID, // DC_LEX_STORE_IBASE DC_LEX_STORE_OBASE
703 DC_INST_INVALID, DC_INST_INVALID, // DC_LEX_STORE_SCALE DC_LEX_LOAD
704 DC_INST_INVALID, DC_INST_INVALID, // DC_LEX_LOAD_POP DC_LEX_STORE_PUSH
705 XC_INST_PRINT, DC_INST_NQUIT, // DC_LEX_PRINT_POP DC_LEX_NQUIT
706 XC_INST_SCALE_FUNC, // DC_LEX_SCALE_FACTOR
707 // DC_INST_INVALID in this table either means that corresponding LEX
708 // is not possible for dc, or that it does not compile one-to-one
713 typedef struct BcParse {
714 smallint lex; // was BcLexType // first member is most used
715 smallint lex_last; // was BcLexType
717 const char *lex_inbuf;
718 const char *lex_next_at; // last lex_next() was called at this string
719 const char *lex_filename;
725 IF_BC(size_t in_funcdef;)
731 typedef struct BcProgram {
760 BcParse prs; // first member is most used
762 // For error messages. Can be set to current parsed line,
763 // or [TODO] to current executing line (can be before last parsed one)
768 IF_FEATURE_BC_SIGNALS(smallint ttyin;)
769 IF_FEATURE_CLEAN_UP(smallint exiting;)
777 #if ENABLE_FEATURE_EDITING
778 line_input_t *line_input_state;
781 #define G (*ptr_to_globals)
782 #define INIT_G() do { \
783 SET_PTR_TO_GLOBALS(xzalloc(sizeof(G))); \
785 #define FREE_G() do { \
786 FREE_PTR_TO_GLOBALS(); \
788 #define G_posix (ENABLE_BC && (option_mask32 & BC_FLAG_S))
789 #define G_warn (ENABLE_BC && (option_mask32 & BC_FLAG_W))
790 #define G_exreg (ENABLE_DC && (option_mask32 & DC_FLAG_X))
791 #if ENABLE_FEATURE_BC_SIGNALS
792 # define G_interrupt bb_got_signal
793 # define G_ttyin G.ttyin
795 # define G_interrupt 0
798 #if ENABLE_FEATURE_CLEAN_UP
799 # define G_exiting G.exiting
803 #define IS_BC (ENABLE_BC && (!ENABLE_DC || applet_name[0] == 'b'))
804 #define IS_DC (ENABLE_DC && (!ENABLE_BC || applet_name[0] != 'b'))
807 # define BC_PARSE_REL (1 << 0)
808 # define BC_PARSE_PRINT (1 << 1)
809 # define BC_PARSE_ARRAY (1 << 2)
810 # define BC_PARSE_NOCALL (1 << 3)
813 #define BC_PROG_MAIN (0)
814 #define BC_PROG_READ (1)
816 #define BC_PROG_REQ_FUNCS (2)
819 #define BC_PROG_STR(n) (!(n)->num && !(n)->cap)
820 #define BC_PROG_NUM(r, n) \
821 ((r)->t != XC_RESULT_ARRAY && (r)->t != XC_RESULT_STR && !BC_PROG_STR(n))
823 #define BC_FLAG_W (1 << 0)
824 #define BC_FLAG_V (1 << 1)
825 #define BC_FLAG_S (1 << 2)
826 #define BC_FLAG_Q (1 << 3)
827 #define BC_FLAG_L (1 << 4)
828 #define BC_FLAG_I ((1 << 5) * ENABLE_DC)
829 #define DC_FLAG_X ((1 << 6) * ENABLE_DC)
831 #define BC_MAX(a, b) ((a) > (b) ? (a) : (b))
832 #define BC_MIN(a, b) ((a) < (b) ? (a) : (b))
834 #define BC_MAX_OBASE ((unsigned) 999)
835 #define BC_MAX_DIM ((unsigned) INT_MAX)
836 #define BC_MAX_SCALE ((unsigned) UINT_MAX)
837 #define BC_MAX_STRING ((unsigned) UINT_MAX - 1)
838 #define BC_MAX_NUM BC_MAX_STRING
839 // Unused apart from "limits" message. Just show a "biggish number" there.
840 //#define BC_MAX_NAME BC_MAX_STRING
841 //#define BC_MAX_EXP ((unsigned long) LONG_MAX)
842 //#define BC_MAX_VARS ((unsigned long) SIZE_MAX - 1)
843 #define BC_MAX_NAME_STR "999999999"
844 #define BC_MAX_EXP_STR "999999999"
845 #define BC_MAX_VARS_STR "999999999"
847 #define BC_MAX_OBASE_STR "999"
849 #if INT_MAX == 2147483647
850 # define BC_MAX_DIM_STR "2147483647"
851 #elif INT_MAX == 9223372036854775807
852 # define BC_MAX_DIM_STR "9223372036854775807"
854 # error Strange INT_MAX
857 #if UINT_MAX == 4294967295
858 # define BC_MAX_SCALE_STR "4294967295"
859 # define BC_MAX_STRING_STR "4294967294"
860 #elif UINT_MAX == 18446744073709551615
861 # define BC_MAX_SCALE_STR "18446744073709551615"
862 # define BC_MAX_STRING_STR "18446744073709551614"
864 # error Strange UINT_MAX
866 #define BC_MAX_NUM_STR BC_MAX_STRING_STR
868 // In configurations where errors abort instead of propagating error
869 // return code up the call chain, functions returning BC_STATUS
870 // actually don't return anything, they always succeed and return "void".
871 // A macro wrapper is provided, which makes this statement work:
873 // and makes it visible to the compiler that s is always zero,
874 // allowing compiler to optimize dead code after the statement.
876 // To make code more readable, each such function has a "z"
877 // ("always returning zero") prefix, i.e. zbc_foo or zdc_foo.
879 #if ENABLE_FEATURE_BC_SIGNALS || ENABLE_FEATURE_CLEAN_UP
880 # define ERRORS_ARE_FATAL 0
881 # define ERRORFUNC /*nothing*/
882 # define IF_ERROR_RETURN_POSSIBLE(a) a
883 # define BC_STATUS BcStatus
884 # define RETURN_STATUS(v) return (v)
885 # define COMMA_SUCCESS /*nothing*/
887 # define ERRORS_ARE_FATAL 1
888 # define ERRORFUNC NORETURN
889 # define IF_ERROR_RETURN_POSSIBLE(a) /*nothing*/
890 # define BC_STATUS void
891 # define RETURN_STATUS(v) do { ((void)(v)); return; } while (0)
892 # define COMMA_SUCCESS ,BC_STATUS_SUCCESS
899 static void fflush_and_check(void)
902 if (ferror(stdout) || ferror(stderr))
903 bb_perror_msg_and_die("output error");
906 #if ENABLE_FEATURE_CLEAN_UP
907 #define QUIT_OR_RETURN_TO_MAIN \
909 IF_FEATURE_BC_SIGNALS(G_ttyin = 0;) /* do not loop in main loop anymore */ \
911 return BC_STATUS_FAILURE; \
914 static void quit(void) NORETURN;
915 static void quit(void)
918 bb_perror_msg_and_die("input error");
920 dbg_exec("quit(): exiting with exitcode SUCCESS");
923 #define QUIT_OR_RETURN_TO_MAIN quit()
926 static void bc_verror_msg(const char *fmt, va_list p)
928 const char *sv = sv; // for compiler
929 if (G.prs.lex_filename) {
931 applet_name = xasprintf("%s: %s:%u", applet_name, G.prs.lex_filename, G.err_line);
933 bb_verror_msg(fmt, p, NULL);
934 if (G.prs.lex_filename) {
935 free((char*)applet_name);
940 static NOINLINE ERRORFUNC int bc_error_fmt(const char *fmt, ...)
945 bc_verror_msg(fmt, p);
948 if (ENABLE_FEATURE_CLEAN_UP || G_ttyin)
949 IF_ERROR_RETURN_POSSIBLE(return BC_STATUS_FAILURE);
954 static NOINLINE BC_STATUS zbc_posix_error_fmt(const char *fmt, ...)
958 // Are non-POSIX constructs totally ok?
959 if (!(option_mask32 & (BC_FLAG_S|BC_FLAG_W)))
960 RETURN_STATUS(BC_STATUS_SUCCESS); // yes
963 bc_verror_msg(fmt, p);
966 // Do we treat non-POSIX constructs as errors?
967 if (!(option_mask32 & BC_FLAG_S))
968 RETURN_STATUS(BC_STATUS_SUCCESS); // no, it's a warning
970 if (ENABLE_FEATURE_CLEAN_UP || G_ttyin)
971 RETURN_STATUS(BC_STATUS_FAILURE);
974 #define zbc_posix_error_fmt(...) (zbc_posix_error_fmt(__VA_ARGS__) COMMA_SUCCESS)
977 // We use error functions with "return bc_error(FMT[, PARAMS])" idiom.
978 // This idiom begs for tail-call optimization, but for it to work,
979 // function must not have caller-cleaned parameters on stack.
980 // Unfortunately, vararg function API does exactly that on most arches.
981 // Thus, use these shims for the cases when we have no vararg PARAMS:
982 static ERRORFUNC int bc_error(const char *msg)
984 IF_ERROR_RETURN_POSSIBLE(return) bc_error_fmt("%s", msg);
986 static ERRORFUNC int bc_error_bad_character(char c)
989 IF_ERROR_RETURN_POSSIBLE(return) bc_error("NUL character");
990 IF_ERROR_RETURN_POSSIBLE(return) bc_error_fmt("bad character '%c'", c);
992 static ERRORFUNC int bc_error_bad_expression(void)
994 IF_ERROR_RETURN_POSSIBLE(return) bc_error("bad expression");
996 static ERRORFUNC int bc_error_bad_token(void)
998 IF_ERROR_RETURN_POSSIBLE(return) bc_error("bad token");
1000 static ERRORFUNC int bc_error_stack_has_too_few_elements(void)
1002 IF_ERROR_RETURN_POSSIBLE(return) bc_error("stack has too few elements");
1004 static ERRORFUNC int bc_error_variable_is_wrong_type(void)
1006 IF_ERROR_RETURN_POSSIBLE(return) bc_error("variable is wrong type");
1009 static BC_STATUS zbc_POSIX_requires(const char *msg)
1011 RETURN_STATUS(zbc_posix_error_fmt("POSIX requires %s", msg));
1013 #define zbc_POSIX_requires(...) (zbc_POSIX_requires(__VA_ARGS__) COMMA_SUCCESS)
1014 static BC_STATUS zbc_POSIX_does_not_allow(const char *msg)
1016 RETURN_STATUS(zbc_posix_error_fmt("%s%s", "POSIX does not allow ", msg));
1018 #define zbc_POSIX_does_not_allow(...) (zbc_POSIX_does_not_allow(__VA_ARGS__) COMMA_SUCCESS)
1019 static BC_STATUS zbc_POSIX_does_not_allow_bool_ops_this_is_bad(const char *msg)
1021 RETURN_STATUS(zbc_posix_error_fmt("%s%s %s", "POSIX does not allow ", "boolean operators; this is bad:", msg));
1023 #define zbc_POSIX_does_not_allow_bool_ops_this_is_bad(...) (zbc_POSIX_does_not_allow_bool_ops_this_is_bad(__VA_ARGS__) COMMA_SUCCESS)
1024 static BC_STATUS zbc_POSIX_does_not_allow_empty_X_expression_in_for(const char *msg)
1026 RETURN_STATUS(zbc_posix_error_fmt("%san empty %s expression in 'for()'", "POSIX does not allow ", msg));
1028 #define zbc_POSIX_does_not_allow_empty_X_expression_in_for(...) (zbc_POSIX_does_not_allow_empty_X_expression_in_for(__VA_ARGS__) COMMA_SUCCESS)
1031 static void bc_vec_grow(BcVec *v, size_t n)
1033 size_t cap = v->cap * 2;
1034 while (cap < v->len + n) cap *= 2;
1035 v->v = xrealloc(v->v, v->size * cap);
1039 static void bc_vec_init(BcVec *v, size_t esize, BcVecFree dtor)
1042 v->cap = BC_VEC_START_CAP;
1045 v->v = xmalloc(esize * BC_VEC_START_CAP);
1048 static void bc_char_vec_init(BcVec *v)
1050 bc_vec_init(v, sizeof(char), NULL);
1053 static void bc_vec_expand(BcVec *v, size_t req)
1056 v->v = xrealloc(v->v, v->size * req);
1061 static void bc_vec_pop(BcVec *v)
1065 v->dtor(v->v + (v->size * v->len));
1068 static void bc_vec_npop(BcVec *v, size_t n)
1073 size_t len = v->len - n;
1074 while (v->len > len) v->dtor(v->v + (v->size * --v->len));
1078 static void bc_vec_pop_all(BcVec *v)
1080 bc_vec_npop(v, v->len);
1083 static size_t bc_vec_push(BcVec *v, const void *data)
1085 size_t len = v->len;
1086 if (len >= v->cap) bc_vec_grow(v, 1);
1087 memmove(v->v + (v->size * len), data, v->size);
1092 // G.prog.results often needs "pop old operand, push result" idiom.
1093 // Can do this without a few extra ops
1094 static size_t bc_result_pop_and_push(const void *data)
1096 BcVec *v = &G.prog.results;
1098 size_t len = v->len - 1;
1100 last = v->v + (v->size * len);
1103 memmove(last, data, v->size);
1107 static size_t bc_vec_pushByte(BcVec *v, char data)
1109 return bc_vec_push(v, &data);
1112 static size_t bc_vec_pushZeroByte(BcVec *v)
1114 //return bc_vec_pushByte(v, '\0');
1116 return bc_vec_push(v, &const_int_0);
1119 static void bc_vec_pushAt(BcVec *v, const void *data, size_t idx)
1122 bc_vec_push(v, data);
1126 if (v->len == v->cap) bc_vec_grow(v, 1);
1128 ptr = v->v + v->size * idx;
1130 memmove(ptr + v->size, ptr, v->size * (v->len++ - idx));
1131 memmove(ptr, data, v->size);
1135 static void bc_vec_string(BcVec *v, size_t len, const char *str)
1138 bc_vec_expand(v, len + 1);
1139 memcpy(v->v, str, len);
1142 bc_vec_pushZeroByte(v);
1145 static void *bc_vec_item(const BcVec *v, size_t idx)
1147 return v->v + v->size * idx;
1150 static void *bc_vec_item_rev(const BcVec *v, size_t idx)
1152 return v->v + v->size * (v->len - idx - 1);
1155 static void *bc_vec_top(const BcVec *v)
1157 return v->v + v->size * (v->len - 1);
1160 static FAST_FUNC void bc_vec_free(void *vec)
1162 BcVec *v = (BcVec *) vec;
1167 static BcFunc* xc_program_func(size_t idx)
1169 return bc_vec_item(&G.prog.fns, idx);
1171 // BC_PROG_MAIN is zeroth element, so:
1172 #define xc_program_func_BC_PROG_MAIN() ((BcFunc*)(G.prog.fns.v))
1175 static BcFunc* bc_program_current_func(void)
1177 BcInstPtr *ip = bc_vec_top(&G.prog.exestack);
1178 BcFunc *func = xc_program_func(ip->func);
1183 static char** xc_program_str(size_t idx)
1187 BcFunc *func = bc_program_current_func();
1188 return bc_vec_item(&func->strs, idx);
1191 IF_DC(return bc_vec_item(&G.prog.strs, idx);)
1194 static char** xc_program_const(size_t idx)
1198 BcFunc *func = bc_program_current_func();
1199 return bc_vec_item(&func->consts, idx);
1202 IF_DC(return bc_vec_item(&G.prog.consts, idx);)
1205 static int bc_id_cmp(const void *e1, const void *e2)
1207 return strcmp(((const BcId *) e1)->name, ((const BcId *) e2)->name);
1210 static FAST_FUNC void bc_id_free(void *id)
1212 free(((BcId *) id)->name);
1215 static size_t bc_map_find_ge(const BcVec *v, const void *ptr)
1217 size_t low = 0, high = v->len;
1219 while (low < high) {
1220 size_t mid = (low + high) / 2;
1221 BcId *id = bc_vec_item(v, mid);
1222 int result = bc_id_cmp(ptr, id);
1235 static int bc_map_insert(BcVec *v, const void *ptr, size_t *i)
1237 size_t n = *i = bc_map_find_ge(v, ptr);
1240 bc_vec_push(v, ptr);
1241 else if (!bc_id_cmp(ptr, bc_vec_item(v, n)))
1242 return 0; // "was not inserted"
1244 bc_vec_pushAt(v, ptr, n);
1245 return 1; // "was inserted"
1249 static size_t bc_map_find_exact(const BcVec *v, const void *ptr)
1251 size_t i = bc_map_find_ge(v, ptr);
1252 if (i >= v->len) return BC_VEC_INVALID_IDX;
1253 return bc_id_cmp(ptr, bc_vec_item(v, i)) ? BC_VEC_INVALID_IDX : i;
1257 static void bc_num_setToZero(BcNum *n, size_t scale)
1264 static void bc_num_zero(BcNum *n)
1266 bc_num_setToZero(n, 0);
1269 static void bc_num_one(BcNum *n)
1271 bc_num_setToZero(n, 0);
1276 // Note: this also sets BcNum to zero
1277 static void bc_num_init(BcNum *n, size_t req)
1279 req = req >= BC_NUM_DEF_SIZE ? req : BC_NUM_DEF_SIZE;
1280 //memset(n, 0, sizeof(BcNum)); - cleared by assignments below
1281 n->num = xmalloc(req);
1288 static void bc_num_init_DEF_SIZE(BcNum *n)
1290 bc_num_init(n, BC_NUM_DEF_SIZE);
1293 static void bc_num_expand(BcNum *n, size_t req)
1295 req = req >= BC_NUM_DEF_SIZE ? req : BC_NUM_DEF_SIZE;
1297 n->num = xrealloc(n->num, req);
1302 static FAST_FUNC void bc_num_free(void *num)
1304 free(((BcNum *) num)->num);
1307 static void bc_num_copy(BcNum *d, BcNum *s)
1310 bc_num_expand(d, s->cap);
1314 memcpy(d->num, s->num, sizeof(BcDig) * d->len);
1318 static BC_STATUS zbc_num_ulong_abs(BcNum *n, unsigned long *result_p)
1321 unsigned long result;
1325 while (i > n->rdx) {
1326 unsigned long prev = result;
1327 result = result * 10 + n->num[--i];
1328 // Even overflowed N*10 can still satisfy N*10>=N. For example,
1329 // 0x1ff00000 * 10 is 0x13f600000,
1330 // or 0x3f600000 truncated to 32 bits. Which is larger.
1331 // However, (N*10)/8 < N check is always correct.
1332 if ((result / 8) < prev)
1333 RETURN_STATUS(bc_error("overflow"));
1337 RETURN_STATUS(BC_STATUS_SUCCESS);
1339 #define zbc_num_ulong_abs(...) (zbc_num_ulong_abs(__VA_ARGS__) COMMA_SUCCESS)
1341 static BC_STATUS zbc_num_ulong(BcNum *n, unsigned long *result_p)
1343 if (n->neg) RETURN_STATUS(bc_error("negative number"));
1345 RETURN_STATUS(zbc_num_ulong_abs(n, result_p));
1347 #define zbc_num_ulong(...) (zbc_num_ulong(__VA_ARGS__) COMMA_SUCCESS)
1349 #if ULONG_MAX == 0xffffffffUL // 10 digits: 4294967295
1350 # define ULONG_NUM_BUFSIZE (10 > BC_NUM_DEF_SIZE ? 10 : BC_NUM_DEF_SIZE)
1351 #elif ULONG_MAX == 0xffffffffffffffffULL // 20 digits: 18446744073709551615
1352 # define ULONG_NUM_BUFSIZE (20 > BC_NUM_DEF_SIZE ? 20 : BC_NUM_DEF_SIZE)
1354 // minimum BC_NUM_DEF_SIZE, so that bc_num_expand() in bc_num_ulong2num()
1355 // would not hit realloc() code path - not good if num[] is not malloced
1357 static void bc_num_ulong2num(BcNum *n, unsigned long val)
1363 if (val == 0) return;
1365 bc_num_expand(n, ULONG_NUM_BUFSIZE);
1372 if (val == 0) break;
1376 static void bc_num_subArrays(BcDig *restrict a, BcDig *restrict b, size_t len)
1379 for (i = 0; i < len; ++i) {
1381 for (j = i; a[j] < 0;) {
1388 static ssize_t bc_num_compare(BcDig *restrict a, BcDig *restrict b, size_t len)
1406 #define BC_NUM_NEG(n, neg) ((((ssize_t)(n)) ^ -((ssize_t)(neg))) + (neg))
1407 #define BC_NUM_ONE(n) ((n)->len == 1 && (n)->rdx == 0 && (n)->num[0] == 1)
1408 #define BC_NUM_INT(n) ((n)->len - (n)->rdx)
1409 //#define BC_NUM_AREQ(a, b) (BC_MAX((a)->rdx, (b)->rdx) + BC_MAX(BC_NUM_INT(a), BC_NUM_INT(b)) + 1)
1410 static /*ALWAYS_INLINE*/ size_t BC_NUM_AREQ(BcNum *a, BcNum *b)
1412 return BC_MAX(a->rdx, b->rdx) + BC_MAX(BC_NUM_INT(a), BC_NUM_INT(b)) + 1;
1414 //#define BC_NUM_MREQ(a, b, scale) (BC_NUM_INT(a) + BC_NUM_INT(b) + BC_MAX((scale), (a)->rdx + (b)->rdx) + 1)
1415 static /*ALWAYS_INLINE*/ size_t BC_NUM_MREQ(BcNum *a, BcNum *b, size_t scale)
1417 return BC_NUM_INT(a) + BC_NUM_INT(b) + BC_MAX(scale, a->rdx + b->rdx) + 1;
1420 static ssize_t bc_num_cmp(BcNum *a, BcNum *b)
1422 size_t i, min, a_int, b_int, diff;
1423 BcDig *max_num, *min_num;
1427 if (a == b) return 0;
1428 if (a->len == 0) return BC_NUM_NEG(!!b->len, !b->neg);
1429 if (b->len == 0) return BC_NUM_NEG(1, a->neg);
1431 if (a->neg != b->neg) // signs of a and b differ
1432 // +a,-b = a>b = 1 or -a,+b = a<b = -1
1433 return (int)b->neg - (int)a->neg;
1434 neg = a->neg; // 1 if both negative, 0 if both positive
1436 a_int = BC_NUM_INT(a);
1437 b_int = BC_NUM_INT(b);
1440 if (a_int != 0) return (ssize_t) a_int;
1442 a_max = (a->rdx > b->rdx);
1445 diff = a->rdx - b->rdx;
1446 max_num = a->num + diff;
1448 // neg = (a_max == neg); - NOP (maps 1->1 and 0->0)
1451 diff = b->rdx - a->rdx;
1452 max_num = b->num + diff;
1454 neg = !neg; // same as "neg = (a_max == neg)"
1457 cmp = bc_num_compare(max_num, min_num, b_int + min);
1458 if (cmp != 0) return BC_NUM_NEG(cmp, neg);
1460 for (max_num -= diff, i = diff - 1; i < diff; --i) {
1461 if (max_num[i]) return BC_NUM_NEG(1, neg);
1467 static void bc_num_truncate(BcNum *n, size_t places)
1469 if (places == 0) return;
1475 memmove(n->num, n->num + places, n->len * sizeof(BcDig));
1479 static void bc_num_extend(BcNum *n, size_t places)
1481 size_t len = n->len + places;
1484 if (n->cap < len) bc_num_expand(n, len);
1486 memmove(n->num + places, n->num, sizeof(BcDig) * n->len);
1487 memset(n->num, 0, sizeof(BcDig) * places);
1494 static void bc_num_clean(BcNum *n)
1496 while (n->len > 0 && n->num[n->len - 1] == 0) --n->len;
1499 else if (n->len < n->rdx)
1503 static void bc_num_retireMul(BcNum *n, size_t scale, bool neg1, bool neg2)
1506 bc_num_extend(n, scale - n->rdx);
1508 bc_num_truncate(n, n->rdx - scale);
1511 if (n->len != 0) n->neg = !neg1 != !neg2;
1514 static void bc_num_split(BcNum *restrict n, size_t idx, BcNum *restrict a,
1518 b->len = n->len - idx;
1520 a->rdx = b->rdx = 0;
1522 memcpy(b->num, n->num + idx, b->len * sizeof(BcDig));
1523 memcpy(a->num, n->num, idx * sizeof(BcDig));
1533 static BC_STATUS zbc_num_shift(BcNum *n, size_t places)
1535 if (places == 0 || n->len == 0) RETURN_STATUS(BC_STATUS_SUCCESS);
1537 // This check makes sense only if size_t is (much) larger than BC_MAX_NUM.
1538 if (SIZE_MAX > (BC_MAX_NUM | 0xff)) {
1539 if (places + n->len > BC_MAX_NUM)
1540 RETURN_STATUS(bc_error("number too long: must be [1,"BC_MAX_NUM_STR"]"));
1543 if (n->rdx >= places)
1546 bc_num_extend(n, places - n->rdx);
1552 RETURN_STATUS(BC_STATUS_SUCCESS);
1554 #define zbc_num_shift(...) (zbc_num_shift(__VA_ARGS__) COMMA_SUCCESS)
1556 typedef BC_STATUS (*BcNumBinaryOp)(BcNum *, BcNum *, BcNum *, size_t) FAST_FUNC;
1558 static BC_STATUS zbc_num_binary(BcNum *a, BcNum *b, BcNum *c, size_t scale,
1559 BcNumBinaryOp op, size_t req)
1562 BcNum num2, *ptr_a, *ptr_b;
1567 memcpy(ptr_a, c, sizeof(BcNum));
1575 memcpy(ptr_b, c, sizeof(BcNum));
1582 bc_num_init(c, req);
1584 bc_num_expand(c, req);
1586 s = BC_STATUS_SUCCESS;
1587 IF_ERROR_RETURN_POSSIBLE(s =) op(ptr_a, ptr_b, c, scale);
1589 if (init) bc_num_free(&num2);
1593 #define zbc_num_binary(...) (zbc_num_binary(__VA_ARGS__) COMMA_SUCCESS)
1595 static FAST_FUNC BC_STATUS zbc_num_a(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale);
1596 static FAST_FUNC BC_STATUS zbc_num_s(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale);
1597 static FAST_FUNC BC_STATUS zbc_num_p(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale);
1598 static FAST_FUNC BC_STATUS zbc_num_m(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale);
1599 static FAST_FUNC BC_STATUS zbc_num_d(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale);
1600 static FAST_FUNC BC_STATUS zbc_num_rem(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale);
1602 static FAST_FUNC BC_STATUS zbc_num_add(BcNum *a, BcNum *b, BcNum *c, size_t scale)
1604 BcNumBinaryOp op = (!a->neg == !b->neg) ? zbc_num_a : zbc_num_s;
1606 RETURN_STATUS(zbc_num_binary(a, b, c, false, op, BC_NUM_AREQ(a, b)));
1609 static FAST_FUNC BC_STATUS zbc_num_sub(BcNum *a, BcNum *b, BcNum *c, size_t scale)
1611 BcNumBinaryOp op = (!a->neg == !b->neg) ? zbc_num_s : zbc_num_a;
1613 RETURN_STATUS(zbc_num_binary(a, b, c, true, op, BC_NUM_AREQ(a, b)));
1616 static FAST_FUNC BC_STATUS zbc_num_mul(BcNum *a, BcNum *b, BcNum *c, size_t scale)
1618 size_t req = BC_NUM_MREQ(a, b, scale);
1619 RETURN_STATUS(zbc_num_binary(a, b, c, scale, zbc_num_m, req));
1622 static FAST_FUNC BC_STATUS zbc_num_div(BcNum *a, BcNum *b, BcNum *c, size_t scale)
1624 size_t req = BC_NUM_MREQ(a, b, scale);
1625 RETURN_STATUS(zbc_num_binary(a, b, c, scale, zbc_num_d, req));
1628 static FAST_FUNC BC_STATUS zbc_num_mod(BcNum *a, BcNum *b, BcNum *c, size_t scale)
1630 size_t req = BC_NUM_MREQ(a, b, scale);
1631 RETURN_STATUS(zbc_num_binary(a, b, c, scale, zbc_num_rem, req));
1634 static FAST_FUNC BC_STATUS zbc_num_pow(BcNum *a, BcNum *b, BcNum *c, size_t scale)
1636 RETURN_STATUS(zbc_num_binary(a, b, c, scale, zbc_num_p, a->len * b->len + 1));
1639 static const BcNumBinaryOp zxc_program_ops[] = {
1640 zbc_num_pow, zbc_num_mul, zbc_num_div, zbc_num_mod, zbc_num_add, zbc_num_sub,
1642 #define zbc_num_add(...) (zbc_num_add(__VA_ARGS__) COMMA_SUCCESS)
1643 #define zbc_num_sub(...) (zbc_num_sub(__VA_ARGS__) COMMA_SUCCESS)
1644 #define zbc_num_mul(...) (zbc_num_mul(__VA_ARGS__) COMMA_SUCCESS)
1645 #define zbc_num_div(...) (zbc_num_div(__VA_ARGS__) COMMA_SUCCESS)
1646 #define zbc_num_mod(...) (zbc_num_mod(__VA_ARGS__) COMMA_SUCCESS)
1647 #define zbc_num_pow(...) (zbc_num_pow(__VA_ARGS__) COMMA_SUCCESS)
1649 static BC_STATUS zbc_num_inv(BcNum *a, BcNum *b, size_t scale)
1658 RETURN_STATUS(zbc_num_div(&one, a, b, scale));
1660 #define zbc_num_inv(...) (zbc_num_inv(__VA_ARGS__) COMMA_SUCCESS)
1662 static FAST_FUNC BC_STATUS zbc_num_a(BcNum *a, BcNum *b, BcNum *restrict c, size_t sub)
1664 BcDig *ptr, *ptr_a, *ptr_b, *ptr_c;
1665 size_t i, max, min_rdx, min_int, diff, a_int, b_int;
1668 // Because this function doesn't need to use scale (per the bc spec),
1669 // I am hijacking it to say whether it's doing an add or a subtract.
1673 if (sub && c->len) c->neg = !c->neg;
1674 RETURN_STATUS(BC_STATUS_SUCCESS);
1678 RETURN_STATUS(BC_STATUS_SUCCESS);
1682 c->rdx = BC_MAX(a->rdx, b->rdx);
1683 min_rdx = BC_MIN(a->rdx, b->rdx);
1686 if (a->rdx > b->rdx) {
1687 diff = a->rdx - b->rdx;
1689 ptr_a = a->num + diff;
1692 diff = b->rdx - a->rdx;
1695 ptr_b = b->num + diff;
1699 for (i = 0; i < diff; ++i, ++c->len)
1703 a_int = BC_NUM_INT(a);
1704 b_int = BC_NUM_INT(b);
1706 if (a_int > b_int) {
1717 for (i = 0; i < min_rdx + min_int; ++i) {
1718 unsigned in = (unsigned)ptr_a[i] + (unsigned)ptr_b[i] + carry;
1720 ptr_c[i] = (BcDig)(in % 10);
1722 for (; i < max + min_rdx; ++i) {
1723 unsigned in = (unsigned)ptr[i] + carry;
1725 ptr_c[i] = (BcDig)(in % 10);
1729 if (carry != 0) c->num[c->len++] = (BcDig) carry;
1731 RETURN_STATUS(BC_STATUS_SUCCESS); // can't make void, see zbc_num_binary()
1734 static FAST_FUNC BC_STATUS zbc_num_s(BcNum *a, BcNum *b, BcNum *restrict c, size_t sub)
1737 BcNum *minuend, *subtrahend;
1739 bool aneg, bneg, neg;
1741 // Because this function doesn't need to use scale (per the bc spec),
1742 // I am hijacking it to say whether it's doing an add or a subtract.
1746 if (sub && c->len) c->neg = !c->neg;
1747 RETURN_STATUS(BC_STATUS_SUCCESS);
1751 RETURN_STATUS(BC_STATUS_SUCCESS);
1756 a->neg = b->neg = false;
1758 cmp = bc_num_cmp(a, b);
1764 bc_num_setToZero(c, BC_MAX(a->rdx, b->rdx));
1765 RETURN_STATUS(BC_STATUS_SUCCESS);
1773 if (sub) neg = !neg;
1778 bc_num_copy(c, minuend);
1781 if (c->rdx < subtrahend->rdx) {
1782 bc_num_extend(c, subtrahend->rdx - c->rdx);
1785 start = c->rdx - subtrahend->rdx;
1787 bc_num_subArrays(c->num + start, subtrahend->num, subtrahend->len);
1791 RETURN_STATUS(BC_STATUS_SUCCESS); // can't make void, see zbc_num_binary()
1794 static FAST_FUNC BC_STATUS zbc_num_k(BcNum *restrict a, BcNum *restrict b,
1796 #define zbc_num_k(...) (zbc_num_k(__VA_ARGS__) COMMA_SUCCESS)
1799 size_t max = BC_MAX(a->len, b->len), max2 = (max + 1) / 2;
1800 BcNum l1, h1, l2, h2, m2, m1, z0, z1, z2, temp;
1803 if (a->len == 0 || b->len == 0) {
1805 RETURN_STATUS(BC_STATUS_SUCCESS);
1807 aone = BC_NUM_ONE(a);
1808 if (aone || BC_NUM_ONE(b)) {
1809 bc_num_copy(c, aone ? b : a);
1810 RETURN_STATUS(BC_STATUS_SUCCESS);
1813 if (a->len + b->len < BC_NUM_KARATSUBA_LEN
1814 || a->len < BC_NUM_KARATSUBA_LEN
1815 || b->len < BC_NUM_KARATSUBA_LEN
1819 bc_num_expand(c, a->len + b->len + 1);
1821 memset(c->num, 0, sizeof(BcDig) * c->cap);
1824 for (i = 0; i < b->len; ++i) {
1826 for (j = 0; j < a->len; ++j) {
1827 unsigned in = c->num[i + j];
1828 in += (unsigned)a->num[j] * (unsigned)b->num[i] + carry;
1829 // note: compilers prefer _unsigned_ div/const
1831 c->num[i + j] = (BcDig)(in % 10);
1834 c->num[i + j] += (BcDig) carry;
1835 len = BC_MAX(len, i + j + !!carry);
1837 #if ENABLE_FEATURE_BC_SIGNALS
1839 // a*a <- without check below, this will not be interruptible
1840 if (G_interrupt) return BC_STATUS_FAILURE;
1846 RETURN_STATUS(BC_STATUS_SUCCESS);
1849 bc_num_init(&l1, max);
1850 bc_num_init(&h1, max);
1851 bc_num_init(&l2, max);
1852 bc_num_init(&h2, max);
1853 bc_num_init(&m1, max);
1854 bc_num_init(&m2, max);
1855 bc_num_init(&z0, max);
1856 bc_num_init(&z1, max);
1857 bc_num_init(&z2, max);
1858 bc_num_init(&temp, max + max);
1860 bc_num_split(a, max2, &l1, &h1);
1861 bc_num_split(b, max2, &l2, &h2);
1863 s = zbc_num_add(&h1, &l1, &m1, 0);
1865 s = zbc_num_add(&h2, &l2, &m2, 0);
1868 s = zbc_num_k(&h1, &h2, &z0);
1870 s = zbc_num_k(&m1, &m2, &z1);
1872 s = zbc_num_k(&l1, &l2, &z2);
1875 s = zbc_num_sub(&z1, &z0, &temp, 0);
1877 s = zbc_num_sub(&temp, &z2, &z1, 0);
1880 s = zbc_num_shift(&z0, max2 * 2);
1882 s = zbc_num_shift(&z1, max2);
1884 s = zbc_num_add(&z0, &z1, &temp, 0);
1886 s = zbc_num_add(&temp, &z2, c, 0);
1901 static FAST_FUNC BC_STATUS zbc_num_m(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale)
1905 size_t maxrdx = BC_MAX(a->rdx, b->rdx);
1907 scale = BC_MAX(scale, a->rdx);
1908 scale = BC_MAX(scale, b->rdx);
1909 scale = BC_MIN(a->rdx + b->rdx, scale);
1910 maxrdx = BC_MAX(maxrdx, scale);
1912 bc_num_init(&cpa, a->len);
1913 bc_num_init(&cpb, b->len);
1915 bc_num_copy(&cpa, a);
1916 bc_num_copy(&cpb, b);
1917 cpa.neg = cpb.neg = false;
1919 s = zbc_num_shift(&cpa, maxrdx);
1921 s = zbc_num_shift(&cpb, maxrdx);
1923 s = zbc_num_k(&cpa, &cpb, c);
1927 bc_num_expand(c, c->len + maxrdx);
1929 if (c->len < maxrdx) {
1930 memset(c->num + c->len, 0, (c->cap - c->len) * sizeof(BcDig));
1935 bc_num_retireMul(c, scale, a->neg, b->neg);
1941 #define zbc_num_m(...) (zbc_num_m(__VA_ARGS__) COMMA_SUCCESS)
1943 static FAST_FUNC BC_STATUS zbc_num_d(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale)
1950 RETURN_STATUS(bc_error("divide by zero"));
1952 bc_num_setToZero(c, scale);
1953 RETURN_STATUS(BC_STATUS_SUCCESS);
1955 if (BC_NUM_ONE(b)) {
1957 bc_num_retireMul(c, scale, a->neg, b->neg);
1958 RETURN_STATUS(BC_STATUS_SUCCESS);
1961 bc_num_init(&cp, BC_NUM_MREQ(a, b, scale));
1962 bc_num_copy(&cp, a);
1966 bc_num_expand(&cp, len + 2);
1967 bc_num_extend(&cp, len - cp.len);
1970 if (b->rdx > cp.rdx) bc_num_extend(&cp, b->rdx - cp.rdx);
1972 if (scale > cp.rdx) bc_num_extend(&cp, scale - cp.rdx);
1974 if (b->rdx == b->len) {
1976 if (len == 0) break;
1978 if (b->num[len] != 0)
1984 if (cp.cap == cp.len) bc_num_expand(&cp, cp.len + 1);
1986 // We want an extra zero in front to make things simpler.
1987 cp.num[cp.len++] = 0;
1990 bc_num_expand(c, cp.len);
1993 memset(c->num + end, 0, (c->cap - end) * sizeof(BcDig));
1997 s = BC_STATUS_SUCCESS;
1998 for (i = end - 1; i < end; --i) {
2001 for (q = 0; n[len] != 0 || bc_num_compare(n, b->num, len) >= 0; ++q)
2002 bc_num_subArrays(n, b->num, len);
2004 #if ENABLE_FEATURE_BC_SIGNALS
2007 // 1/a <- without check below, this will not be interruptible
2009 s = BC_STATUS_FAILURE;
2015 bc_num_retireMul(c, scale, a->neg, b->neg);
2020 #define zbc_num_d(...) (zbc_num_d(__VA_ARGS__) COMMA_SUCCESS)
2022 static FAST_FUNC BC_STATUS zbc_num_r(BcNum *a, BcNum *b, BcNum *restrict c,
2023 BcNum *restrict d, size_t scale, size_t ts)
2030 RETURN_STATUS(bc_error("divide by zero"));
2033 bc_num_setToZero(d, ts);
2034 RETURN_STATUS(BC_STATUS_SUCCESS);
2037 bc_num_init(&temp, d->cap);
2038 s = zbc_num_d(a, b, c, scale);
2041 if (scale != 0) scale = ts;
2043 s = zbc_num_m(c, b, &temp, scale);
2045 s = zbc_num_sub(a, &temp, d, scale);
2048 if (ts > d->rdx && d->len) bc_num_extend(d, ts - d->rdx);
2051 bc_num_retireMul(d, ts, a->neg, b->neg);
2057 #define zbc_num_r(...) (zbc_num_r(__VA_ARGS__) COMMA_SUCCESS)
2059 static FAST_FUNC BC_STATUS zbc_num_rem(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale)
2063 size_t ts = BC_MAX(scale + b->rdx, a->rdx), len = BC_NUM_MREQ(a, b, ts);
2065 bc_num_init(&c1, len);
2066 s = zbc_num_r(a, b, &c1, c, scale, ts);
2071 #define zbc_num_rem(...) (zbc_num_rem(__VA_ARGS__) COMMA_SUCCESS)
2073 static FAST_FUNC BC_STATUS zbc_num_p(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale)
2075 BcStatus s = BC_STATUS_SUCCESS;
2078 size_t i, powrdx, resrdx;
2081 // GNU bc does not allow 2^2.0 - we do
2082 for (i = 0; i < b->rdx; i++)
2084 RETURN_STATUS(bc_error("not an integer"));
2088 RETURN_STATUS(BC_STATUS_SUCCESS);
2091 bc_num_setToZero(c, scale);
2092 RETURN_STATUS(BC_STATUS_SUCCESS);
2094 if (BC_NUM_ONE(b)) {
2098 s = zbc_num_inv(a, c, scale);
2103 s = zbc_num_ulong_abs(b, &pow);
2104 if (s) RETURN_STATUS(s);
2105 // b is not used beyond this point
2107 bc_num_init(©, a->len);
2108 bc_num_copy(©, a);
2113 if (a->rdx * pow < scale)
2114 scale = a->rdx * pow;
2118 for (powrdx = a->rdx; !(pow & 1); pow >>= 1) {
2120 s = zbc_num_mul(©, ©, ©, powrdx);
2122 // Not needed: zbc_num_mul() has a check for ^C:
2123 //if (G_interrupt) {
2124 // s = BC_STATUS_FAILURE;
2129 bc_num_copy(c, ©);
2131 for (resrdx = powrdx, pow >>= 1; pow != 0; pow >>= 1) {
2133 s = zbc_num_mul(©, ©, ©, powrdx);
2138 s = zbc_num_mul(c, ©, c, resrdx);
2141 // Not needed: zbc_num_mul() has a check for ^C:
2142 //if (G_interrupt) {
2143 // s = BC_STATUS_FAILURE;
2149 s = zbc_num_inv(c, c, scale);
2153 if (c->rdx > scale) bc_num_truncate(c, c->rdx - scale);
2155 // We can't use bc_num_clean() here.
2156 for (i = 0; i < c->len; ++i)
2159 bc_num_setToZero(c, scale);
2166 #define zbc_num_p(...) (zbc_num_p(__VA_ARGS__) COMMA_SUCCESS)
2168 static BC_STATUS zbc_num_sqrt(BcNum *a, BcNum *restrict b, size_t scale)
2171 BcNum num1, num2, half, f, fprime, *x0, *x1, *temp;
2172 size_t pow, len, digs, digs1, resrdx, req, times = 0;
2173 ssize_t cmp = 1, cmp1 = SSIZE_MAX, cmp2 = SSIZE_MAX;
2175 req = BC_MAX(scale, a->rdx) + ((BC_NUM_INT(a) + 1) >> 1) + 1;
2176 bc_num_expand(b, req);
2179 bc_num_setToZero(b, scale);
2180 RETURN_STATUS(BC_STATUS_SUCCESS);
2183 RETURN_STATUS(bc_error("negative number"));
2185 if (BC_NUM_ONE(a)) {
2187 bc_num_extend(b, scale);
2188 RETURN_STATUS(BC_STATUS_SUCCESS);
2191 scale = BC_MAX(scale, a->rdx) + 1;
2192 len = a->len + scale;
2194 bc_num_init(&num1, len);
2195 bc_num_init(&num2, len);
2196 bc_num_init_DEF_SIZE(&half);
2202 bc_num_init(&f, len);
2203 bc_num_init(&fprime, len);
2209 pow = BC_NUM_INT(a);
2217 pow -= 2 - (pow & 1);
2219 bc_num_extend(x0, pow);
2221 // Make sure to move the radix back.
2225 x0->rdx = digs = digs1 = 0;
2227 len = BC_NUM_INT(x0) + resrdx - 1;
2229 while (cmp != 0 || digs < len) {
2230 s = zbc_num_div(a, x0, &f, resrdx);
2232 s = zbc_num_add(x0, &f, &fprime, resrdx);
2234 s = zbc_num_mul(&fprime, &half, x1, resrdx);
2237 cmp = bc_num_cmp(x1, x0);
2238 digs = x1->len - (unsigned long long) llabs(cmp);
2240 if (cmp == cmp2 && digs == digs1)
2245 resrdx += times > 4;
2258 if (b->rdx > scale) bc_num_truncate(b, b->rdx - scale);
2260 bc_num_free(&fprime);
2267 #define zbc_num_sqrt(...) (zbc_num_sqrt(__VA_ARGS__) COMMA_SUCCESS)
2269 static BC_STATUS zbc_num_divmod(BcNum *a, BcNum *b, BcNum *c, BcNum *d,
2275 size_t ts = BC_MAX(scale + b->rdx, a->rdx), len = BC_NUM_MREQ(a, b, ts);
2278 memcpy(&num2, c, sizeof(BcNum));
2280 bc_num_init(c, len);
2284 bc_num_expand(c, len);
2287 s = zbc_num_r(ptr_a, b, c, d, scale, ts);
2289 if (init) bc_num_free(&num2);
2293 #define zbc_num_divmod(...) (zbc_num_divmod(__VA_ARGS__) COMMA_SUCCESS)
2296 static BC_STATUS zdc_num_modexp(BcNum *a, BcNum *b, BcNum *c, BcNum *restrict d)
2299 BcNum base, exp, two, temp;
2303 RETURN_STATUS(bc_error("divide by zero"));
2304 if (a->rdx || b->rdx || c->rdx)
2305 RETURN_STATUS(bc_error("not an integer"));
2307 RETURN_STATUS(bc_error("negative number"));
2309 bc_num_expand(d, c->len);
2310 bc_num_init(&base, c->len);
2311 bc_num_init(&exp, b->len);
2312 bc_num_init(&temp, b->len);
2314 two.cap = ARRAY_SIZE(two_digs);
2321 s = zbc_num_rem(a, c, &base, 0);
2323 bc_num_copy(&exp, b);
2325 while (exp.len != 0) {
2326 s = zbc_num_divmod(&exp, &two, &exp, &temp, 0);
2329 if (BC_NUM_ONE(&temp)) {
2330 s = zbc_num_mul(d, &base, &temp, 0);
2332 s = zbc_num_rem(&temp, c, d, 0);
2336 s = zbc_num_mul(&base, &base, &temp, 0);
2338 s = zbc_num_rem(&temp, c, &base, 0);
2347 #define zdc_num_modexp(...) (zdc_num_modexp(__VA_ARGS__) COMMA_SUCCESS)
2350 static FAST_FUNC void bc_string_free(void *string)
2352 free(*(char**)string);
2355 static void bc_func_init(BcFunc *f)
2357 bc_char_vec_init(&f->code);
2358 IF_BC(bc_vec_init(&f->labels, sizeof(size_t), NULL);)
2359 IF_BC(bc_vec_init(&f->autos, sizeof(BcId), bc_id_free);)
2360 IF_BC(bc_vec_init(&f->strs, sizeof(char *), bc_string_free);)
2361 IF_BC(bc_vec_init(&f->consts, sizeof(char *), bc_string_free);)
2362 IF_BC(f->nparams = 0;)
2365 static FAST_FUNC void bc_func_free(void *func)
2367 BcFunc *f = (BcFunc *) func;
2368 bc_vec_free(&f->code);
2369 IF_BC(bc_vec_free(&f->labels);)
2370 IF_BC(bc_vec_free(&f->autos);)
2371 IF_BC(bc_vec_free(&f->strs);)
2372 IF_BC(bc_vec_free(&f->consts);)
2375 static void bc_array_expand(BcVec *a, size_t len);
2377 static void bc_array_init(BcVec *a, bool nums)
2380 bc_vec_init(a, sizeof(BcNum), bc_num_free);
2382 bc_vec_init(a, sizeof(BcVec), bc_vec_free);
2383 bc_array_expand(a, 1);
2386 static void bc_array_expand(BcVec *a, size_t len)
2388 if (a->dtor == bc_num_free
2389 // && a->size == sizeof(BcNum) - always true
2392 while (len > a->len) {
2393 bc_num_init_DEF_SIZE(&n);
2398 while (len > a->len) {
2399 bc_array_init(&v, true);
2405 static void bc_array_copy(BcVec *d, const BcVec *s)
2411 bc_vec_expand(d, s->cap);
2416 for (i = 0; i < s->len; i++, dnum++, snum++) {
2417 bc_num_init(dnum, snum->len);
2418 bc_num_copy(dnum, snum);
2423 static void dc_result_copy(BcResult *d, BcResult *src)
2428 case XC_RESULT_TEMP:
2429 case XC_RESULT_IBASE:
2430 case XC_RESULT_SCALE:
2431 case XC_RESULT_OBASE:
2432 bc_num_init(&d->d.n, src->d.n.len);
2433 bc_num_copy(&d->d.n, &src->d.n);
2436 case XC_RESULT_ARRAY:
2437 case XC_RESULT_ARRAY_ELEM:
2438 d->d.id.name = xstrdup(src->d.id.name);
2440 case XC_RESULT_CONSTANT:
2441 IF_BC(case BC_RESULT_LAST:)
2442 IF_BC(case BC_RESULT_ONE:)
2444 memcpy(&d->d.n, &src->d.n, sizeof(BcNum));
2450 static FAST_FUNC void bc_result_free(void *result)
2452 BcResult *r = (BcResult *) result;
2455 case XC_RESULT_TEMP:
2456 case XC_RESULT_IBASE:
2457 case XC_RESULT_SCALE:
2458 case XC_RESULT_OBASE:
2459 bc_num_free(&r->d.n);
2462 case XC_RESULT_ARRAY:
2463 case XC_RESULT_ARRAY_ELEM:
2472 static int bad_input_byte(char c)
2474 if ((c < ' ' && c != '\t' && c != '\r' && c != '\n') // also allow '\v' '\f'?
2477 bc_error_fmt("illegal character 0x%02x", c);
2483 static void xc_read_line(BcVec *vec, FILE *fp)
2486 bc_vec_pop_all(vec);
2489 #if ENABLE_FEATURE_BC_SIGNALS
2490 if (G_interrupt) { // ^C was pressed
2493 // ^C while running a script (bc SCRIPT): die.
2494 // We do not return to interactive prompt:
2495 // user might be running us from a shell,
2496 // and SCRIPT might be intended to terminate
2497 // (e.g. contain a "halt" stmt).
2498 // ^C dropping user into a bc prompt instead of
2499 // the shell would be unexpected.
2502 // ^C while interactive input
2504 // GNU bc says "interrupted execution."
2505 // GNU dc says "Interrupt!"
2506 fputs("\ninterrupted execution\n", stderr);
2509 # if ENABLE_FEATURE_EDITING
2510 if (G_ttyin && fp == stdin) {
2512 # define line_buf bb_common_bufsiz1
2513 n = read_line_input(G.line_input_state, "", line_buf, COMMON_BUFSIZE);
2514 if (n <= 0) { // read errors or EOF, or ^D, or ^C
2517 bc_vec_pushZeroByte(vec); // ^D or EOF (or error)
2522 char c = line_buf[i++];
2524 if (bad_input_byte(c)) goto again;
2526 bc_vec_string(vec, n, line_buf);
2536 #if ENABLE_FEATURE_BC_SIGNALS
2538 // ^C was pressed: ignore entire line, get another one
2539 bc_vec_pop_all(vec);
2543 do c = fgetc(fp); while (c == '\0');
2546 bb_perror_msg_and_die("input error");
2547 // Note: EOF does not append '\n'
2550 bad_chars |= bad_input_byte(c);
2551 bc_vec_pushByte(vec, (char)c);
2552 } while (c != '\n');
2555 // Bad chars on this line
2556 if (!G.prs.lex_filename) { // stdin
2557 // ignore entire line, get another one
2560 bb_perror_msg_and_die("file '%s' is not text", G.prs.lex_filename);
2562 bc_vec_pushZeroByte(vec);
2570 static bool xc_num_strValid(const char *val, size_t base)
2575 b = (BcDig)(base <= 10 ? base + '0' : base - 10 + 'A');
2582 if (radix) return false;
2586 if (c < '0' || c >= b || (c > '9' && c < 'A'))
2592 // Note: n is already "bc_num_zero()"ed,
2593 // leading zeroes in "val" are removed
2594 static void bc_num_parseDecimal(BcNum *n, const char *val)
2603 bc_num_expand(n, len);
2605 ptr = strchr(val, '.');
2609 n->rdx = (size_t)((val + len) - (ptr + 1));
2611 for (i = 0; val[i]; ++i) {
2612 if (val[i] != '0' && val[i] != '.') {
2613 // Not entirely zero value - convert it, and exit
2616 n->num[n->len] = val[i] - '0';
2620 if (val[--i] == '.') goto skip_dot;
2625 // if for() exits without hitting if(), the value is entirely zero
2628 // Note: n is already "bc_num_zero()"ed,
2629 // leading zeroes in "val" are removed
2630 static void bc_num_parseBase(BcNum *n, const char *val, unsigned base_t)
2633 BcNum temp, mult, result;
2635 BcDig base_digs[ULONG_NUM_BUFSIZE];
2640 for (i = 0; ; ++i) {
2643 if (val[i] != '.' && val[i] != '0')
2647 bc_num_init_DEF_SIZE(&temp);
2648 bc_num_init_DEF_SIZE(&mult);
2649 base.cap = ARRAY_SIZE(base_digs);
2650 base.num = base_digs;
2651 bc_num_ulong2num(&base, base_t);
2655 if (c == '\0') goto int_err;
2656 if (c == '.') break;
2658 v = (unsigned long) (c <= '9' ? c - '0' : c - 'A' + 10);
2660 s = zbc_num_mul(n, &base, &mult, 0);
2661 if (s) goto int_err;
2662 bc_num_ulong2num(&temp, v);
2663 s = zbc_num_add(&mult, &temp, n, 0);
2664 if (s) goto int_err;
2667 bc_num_init(&result, base.len);
2668 //bc_num_zero(&result); - already is
2674 if (c == '\0') break;
2677 v = (unsigned long) (c <= '9' ? c - '0' : c - 'A' + 10);
2679 s = zbc_num_mul(&result, &base, &result, 0);
2681 bc_num_ulong2num(&temp, v);
2682 s = zbc_num_add(&result, &temp, &result, 0);
2684 s = zbc_num_mul(&mult, &base, &mult, 0);
2688 s = zbc_num_div(&result, &mult, &result, digits);
2690 s = zbc_num_add(n, &result, n, digits);
2694 if (n->rdx < digits)
2695 bc_num_extend(n, digits - n->rdx);
2699 bc_num_free(&result);
2705 static BC_STATUS zxc_num_parse(BcNum *n, const char *val, unsigned base_t)
2707 if (!xc_num_strValid(val, base_t))
2708 RETURN_STATUS(bc_error("bad number string"));
2711 while (*val == '0') val++;
2714 bc_num_parseDecimal(n, val);
2716 bc_num_parseBase(n, val, base_t);
2718 RETURN_STATUS(BC_STATUS_SUCCESS);
2720 #define zxc_num_parse(...) (zxc_num_parse(__VA_ARGS__) COMMA_SUCCESS)
2722 static bool xc_lex_more_input(void)
2724 BcParse *p = &G.prs;
2726 bc_vec_pop_all(&G.input_buffer);
2728 xc_read_line(&G.input_buffer, G.prs.lex_input_fp);
2730 p->lex_inbuf = G.input_buffer.v;
2731 // bb_error_msg("G.input_buffer.len:%d '%s'", G.input_buffer.len, G.input_buffer.v);
2733 return G.input_buffer.len > 1;
2736 // p->lex_inbuf points to the current string to be parsed.
2737 // if p->lex_inbuf points to '\0', it's either EOF or it points after
2738 // last processed line's terminating '\n' (and more reading needs to be done
2739 // to get next character).
2741 // If you are in a situation where that is a possibility, call peek_inbuf().
2742 // If necessary, it performs more reading and changes p->lex_inbuf,
2743 // then it returns *p->lex_inbuf (which will be '\0' only if it's EOF).
2744 // After it, just referencing *p->lex_inbuf is valid, and if it wasn't '\0',
2745 // it's ok to do p->lex_inbuf++ once without end-of-buffer checking.
2747 // eat_inbuf() is equvalent to "peek_inbuf(); if (c) p->lex_inbuf++":
2748 // it returns current char and advances the pointer (if not EOF).
2749 // After eat_inbuf(), referencing p->lex_inbuf[-1] and *p->lex_inbuf is valid.
2751 // In many cases, you can use fast *p->lex_inbuf instead of peek_inbuf():
2752 // unless prev char might have been '\n', *p->lex_inbuf is '\0' ONLY
2753 // on real EOF, not end-of-buffer.
2755 // bc cases to test interactively:
2756 // 1 #comment\ - prints "1<newline>" at once (comment is not continued)
2757 // 1 #comment/* - prints "1<newline>" at once
2758 // 1 #comment" - prints "1<newline>" at once
2759 // 1\#comment - error at once (\ is not a line continuation)
2760 // 1 + /*"*/2 - prints "3<newline>" at once
2761 // 1 + /*#*/2 - prints "3<newline>" at once
2762 // "str\" - prints "str\" at once
2763 // "str#" - prints "str#" at once
2764 // "str/*" - prints "str/*" at once
2765 // "str#\ - waits for second line
2766 // end" - ...prints "str#\<newline>end"
2767 static char peek_inbuf(void)
2769 if (*G.prs.lex_inbuf == '\0') {
2770 if (G.prs.lex_input_fp)
2771 if (!xc_lex_more_input())
2772 G.prs.lex_input_fp = NULL;
2774 return *G.prs.lex_inbuf;
2776 static char eat_inbuf(void)
2778 char c = peek_inbuf();
2779 if (c) G.prs.lex_inbuf++;
2783 static void xc_lex_lineComment(void)
2785 BcParse *p = &G.prs;
2788 // Try: echo -n '#foo' | bc
2789 p->lex = XC_LEX_WHITESPACE;
2791 // We depend here on input being done in whole lines:
2792 // '\0' which isn't the EOF can only be seen after '\n'.
2793 while ((c = *p->lex_inbuf) != '\n' && c != '\0')
2797 static void xc_lex_whitespace(void)
2799 BcParse *p = &G.prs;
2801 p->lex = XC_LEX_WHITESPACE;
2803 // We depend here on input being done in whole lines:
2804 // '\0' which isn't the EOF can only be seen after '\n'.
2805 char c = *p->lex_inbuf;
2806 if (c == '\n') // this is XC_LEX_NLINE, not XC_LEX_WHITESPACE
2814 static BC_STATUS zxc_lex_number(char last)
2816 BcParse *p = &G.prs;
2819 bc_vec_pop_all(&p->lex_strnumbuf);
2820 bc_vec_pushByte(&p->lex_strnumbuf, last);
2823 p->lex = XC_LEX_NUMBER;
2825 // We depend here on input being done in whole lines:
2826 // '\0' which isn't the EOF can only be seen after '\n'.
2827 char c = *p->lex_inbuf;
2831 if (c == '\\' && p->lex_inbuf[1] == '\n') {
2834 c = peek_inbuf(); // force next line to be read
2837 if (!isdigit(c) && (c < 'A' || c > 'F')) {
2838 if (c != '.') break;
2839 // if '.' was already seen, stop on second one:
2843 // c is one of "0-9A-F."
2845 bc_vec_push(&p->lex_strnumbuf, p->lex_inbuf);
2848 if (last == '.') // remove trailing '.' if any
2849 bc_vec_pop(&p->lex_strnumbuf);
2850 bc_vec_pushZeroByte(&p->lex_strnumbuf);
2852 G.err_line = G.prs.lex_line;
2853 RETURN_STATUS(BC_STATUS_SUCCESS);
2855 #define zxc_lex_number(...) (zxc_lex_number(__VA_ARGS__) COMMA_SUCCESS)
2857 static void xc_lex_name(void)
2859 BcParse *p = &G.prs;
2863 p->lex = XC_LEX_NAME;
2865 // Since names can't cross lines with \<newline>,
2866 // we depend on the fact that whole line is in the buffer
2868 buf = p->lex_inbuf - 1;
2871 if ((c < 'a' || c > 'z') && !isdigit(c) && c != '_') break;
2875 #if 0 // We do not protect against people with gigabyte-long names
2876 // This check makes sense only if size_t is (much) larger than BC_MAX_STRING.
2877 if (SIZE_MAX > (BC_MAX_STRING | 0xff)) {
2878 if (i > BC_MAX_STRING)
2879 return bc_error("name too long: must be [1,"BC_MAX_STRING_STR"]");
2882 bc_vec_string(&p->lex_strnumbuf, i, buf);
2884 // Increment the index. We minus 1 because it has already been incremented.
2885 p->lex_inbuf += i - 1;
2887 //return BC_STATUS_SUCCESS;
2890 IF_BC(static BC_STATUS zbc_lex_token(void);)
2891 IF_DC(static BC_STATUS zdc_lex_token(void);)
2892 #define zbc_lex_token(...) (zbc_lex_token(__VA_ARGS__) COMMA_SUCCESS)
2893 #define zdc_lex_token(...) (zdc_lex_token(__VA_ARGS__) COMMA_SUCCESS)
2895 static BC_STATUS zxc_lex_next(void)
2897 BcParse *p = &G.prs;
2900 p->lex_last = p->lex;
2902 // if (p->lex_last == XC_LEX_EOF)
2903 // RETURN_STATUS(bc_error("end of file"));
2905 // Loop until failure or we don't have whitespace. This
2906 // is so the parser doesn't get inundated with whitespace.
2907 // Comments are also XC_LEX_WHITESPACE tokens and eaten here.
2908 s = BC_STATUS_SUCCESS;
2910 if (*p->lex_inbuf == '\0') {
2911 p->lex = XC_LEX_EOF;
2912 if (peek_inbuf() == '\0')
2913 RETURN_STATUS(BC_STATUS_SUCCESS);
2915 p->lex_next_at = p->lex_inbuf;
2916 dbg_lex("next string to parse:'%.*s'",
2917 (int)(strchrnul(p->lex_next_at, '\n') - p->lex_next_at),
2921 IF_BC(s = zbc_lex_token());
2923 IF_DC(s = zdc_lex_token());
2925 } while (!s && p->lex == XC_LEX_WHITESPACE);
2926 dbg_lex("p->lex from string:%d", p->lex);
2930 #define zxc_lex_next(...) (zxc_lex_next(__VA_ARGS__) COMMA_SUCCESS)
2933 static BC_STATUS zbc_lex_skip_if_at_NLINE(void)
2935 if (G.prs.lex == XC_LEX_NLINE)
2936 RETURN_STATUS(zxc_lex_next());
2937 RETURN_STATUS(BC_STATUS_SUCCESS);
2939 #define zbc_lex_skip_if_at_NLINE(...) (zbc_lex_skip_if_at_NLINE(__VA_ARGS__) COMMA_SUCCESS)
2941 static BC_STATUS zbc_lex_next_and_skip_NLINE(void)
2945 if (s) RETURN_STATUS(s);
2946 // if(cond)<newline>stmt is accepted too (but not 2+ newlines)
2947 s = zbc_lex_skip_if_at_NLINE();
2950 #define zbc_lex_next_and_skip_NLINE(...) (zbc_lex_next_and_skip_NLINE(__VA_ARGS__) COMMA_SUCCESS)
2952 static BC_STATUS zbc_lex_identifier(void)
2954 BcParse *p = &G.prs;
2957 const char *buf = p->lex_inbuf - 1;
2959 for (i = 0; i < ARRAY_SIZE(bc_lex_kws); ++i) {
2960 const char *keyword8 = bc_lex_kws[i].name8;
2962 while (buf[j] != '\0' && buf[j] == keyword8[j]) {
2964 if (j == 8) goto match;
2966 if (keyword8[j] != '\0')
2969 // buf starts with keyword bc_lex_kws[i]
2970 if (isalnum(buf[j]) || buf[j]=='_')
2971 continue; // "ifz" does not match "if" keyword, "if." does
2972 p->lex = BC_LEX_KEY_1st_keyword + i;
2973 if (!keyword_is_POSIX(i)) {
2974 s = zbc_posix_error_fmt("%sthe '%.8s' keyword", "POSIX does not allow ", bc_lex_kws[i].name8);
2975 if (s) RETURN_STATUS(s);
2978 // We minus 1 because the index has already been incremented.
2979 p->lex_inbuf += j - 1;
2980 RETURN_STATUS(BC_STATUS_SUCCESS);
2984 s = BC_STATUS_SUCCESS;
2986 if (p->lex_strnumbuf.len > 2) {
2989 // bc: POSIX only allows one character names; this is bad: 'qwe=1
2991 unsigned len = strchrnul(buf, '\n') - buf;
2992 s = zbc_posix_error_fmt("POSIX only allows one character names; this is bad: '%.*s'", len, buf);
2997 #define zbc_lex_identifier(...) (zbc_lex_identifier(__VA_ARGS__) COMMA_SUCCESS)
2999 static BC_STATUS zbc_lex_string(void)
3001 BcParse *p = &G.prs;
3003 p->lex = XC_LEX_STR;
3004 bc_vec_pop_all(&p->lex_strnumbuf);
3006 char c = peek_inbuf(); // strings can cross lines
3008 RETURN_STATUS(bc_error("unterminated string"));
3014 bc_vec_push(&p->lex_strnumbuf, p->lex_inbuf);
3017 bc_vec_pushZeroByte(&p->lex_strnumbuf);
3020 G.err_line = p->lex_line;
3021 RETURN_STATUS(BC_STATUS_SUCCESS);
3023 #define zbc_lex_string(...) (zbc_lex_string(__VA_ARGS__) COMMA_SUCCESS)
3025 static void parse_lex_by_checking_eq_sign(unsigned with_and_without)
3027 BcParse *p = &G.prs;
3028 if (*p->lex_inbuf == '=') {
3029 // ^^^ not using peek_inbuf() since '==' etc can't be split across lines
3031 with_and_without >>= 8; // store "with" value
3032 } // else store "without" value
3033 p->lex = (with_and_without & 0xff);
3035 #define parse_lex_by_checking_eq_sign(with, without) \
3036 parse_lex_by_checking_eq_sign(((with)<<8)|(without))
3038 static BC_STATUS zbc_lex_comment(void)
3040 BcParse *p = &G.prs;
3042 p->lex = XC_LEX_WHITESPACE;
3043 // here lex_inbuf is at '*' of opening comment delimiter
3052 c = *p->lex_inbuf; // no need to peek_inbuf()
3058 RETURN_STATUS(bc_error("unterminated comment"));
3063 p->lex_inbuf++; // skip trailing '/'
3065 G.err_line = p->lex_line;
3066 RETURN_STATUS(BC_STATUS_SUCCESS);
3068 #define zbc_lex_comment(...) (zbc_lex_comment(__VA_ARGS__) COMMA_SUCCESS)
3070 #undef zbc_lex_token
3071 static BC_STATUS zbc_lex_token(void)
3073 BcParse *p = &G.prs;
3074 BcStatus s = BC_STATUS_SUCCESS;
3075 char c = eat_inbuf();
3078 // This is the workhorse of the lexer.
3080 // case '\0': // probably never reached
3082 // p->lex = XC_LEX_EOF;
3086 p->lex = XC_LEX_NLINE;
3093 xc_lex_whitespace();
3096 parse_lex_by_checking_eq_sign(XC_LEX_OP_REL_NE, BC_LEX_OP_BOOL_NOT);
3097 if (p->lex == BC_LEX_OP_BOOL_NOT) {
3098 s = zbc_POSIX_does_not_allow_bool_ops_this_is_bad("!");
3099 if (s) RETURN_STATUS(s);
3103 s = zbc_lex_string();
3106 s = zbc_POSIX_does_not_allow("'#' script comments");
3107 if (s) RETURN_STATUS(s);
3108 xc_lex_lineComment();
3111 parse_lex_by_checking_eq_sign(BC_LEX_OP_ASSIGN_MODULUS, XC_LEX_OP_MODULUS);
3116 s = zbc_POSIX_does_not_allow_bool_ops_this_is_bad("&&");
3117 if (s) RETURN_STATUS(s);
3119 p->lex = BC_LEX_OP_BOOL_AND;
3121 p->lex = XC_LEX_INVALID;
3122 s = bc_error_bad_character('&');
3127 p->lex = (BcLexType)(c - '(' + BC_LEX_LPAREN);
3130 parse_lex_by_checking_eq_sign(BC_LEX_OP_ASSIGN_MULTIPLY, XC_LEX_OP_MULTIPLY);
3136 p->lex = BC_LEX_OP_INC;
3138 parse_lex_by_checking_eq_sign(BC_LEX_OP_ASSIGN_PLUS, XC_LEX_OP_PLUS);
3141 p->lex = BC_LEX_COMMA;
3147 p->lex = BC_LEX_OP_DEC;
3149 parse_lex_by_checking_eq_sign(BC_LEX_OP_ASSIGN_MINUS, XC_LEX_OP_MINUS);
3152 if (isdigit(*p->lex_inbuf))
3153 s = zxc_lex_number(c);
3155 p->lex = BC_LEX_KEY_LAST;
3156 s = zbc_POSIX_does_not_allow("'.' as 'last'");
3162 s = zbc_lex_comment();
3164 parse_lex_by_checking_eq_sign(BC_LEX_OP_ASSIGN_DIVIDE, XC_LEX_OP_DIVIDE);
3182 s = zxc_lex_number(c);
3185 p->lex = BC_LEX_SCOLON;
3188 parse_lex_by_checking_eq_sign(XC_LEX_OP_REL_LE, XC_LEX_OP_REL_LT);
3191 parse_lex_by_checking_eq_sign(XC_LEX_OP_REL_EQ, BC_LEX_OP_ASSIGN);
3194 parse_lex_by_checking_eq_sign(XC_LEX_OP_REL_GE, XC_LEX_OP_REL_GT);
3198 p->lex = (BcLexType)(c - '[' + BC_LEX_LBRACKET);
3201 if (*p->lex_inbuf == '\n') {
3202 p->lex = XC_LEX_WHITESPACE;
3205 s = bc_error_bad_character(c);
3208 parse_lex_by_checking_eq_sign(BC_LEX_OP_ASSIGN_POWER, XC_LEX_OP_POWER);
3236 s = zbc_lex_identifier();
3240 p->lex = (BcLexType)(c - '{' + BC_LEX_LBRACE);
3245 s = zbc_POSIX_does_not_allow_bool_ops_this_is_bad("||");
3246 if (s) RETURN_STATUS(s);
3248 p->lex = BC_LEX_OP_BOOL_OR;
3250 p->lex = XC_LEX_INVALID;
3251 s = bc_error_bad_character(c);
3255 p->lex = XC_LEX_INVALID;
3256 s = bc_error_bad_character(c);
3262 #define zbc_lex_token(...) (zbc_lex_token(__VA_ARGS__) COMMA_SUCCESS)
3266 static BC_STATUS zdc_lex_register(void)
3268 BcParse *p = &G.prs;
3269 if (G_exreg && isspace(*p->lex_inbuf)) {
3270 xc_lex_whitespace(); // eats whitespace (but not newline)
3271 p->lex_inbuf++; // xc_lex_name() expects this
3274 bc_vec_pop_all(&p->lex_strnumbuf);
3275 bc_vec_push(&p->lex_strnumbuf, p->lex_inbuf++);
3276 bc_vec_pushZeroByte(&p->lex_strnumbuf);
3277 p->lex = XC_LEX_NAME;
3280 RETURN_STATUS(BC_STATUS_SUCCESS);
3282 #define zdc_lex_register(...) (zdc_lex_register(__VA_ARGS__) COMMA_SUCCESS)
3284 static BC_STATUS zdc_lex_string(void)
3286 BcParse *p = &G.prs;
3289 p->lex = XC_LEX_STR;
3290 bc_vec_pop_all(&p->lex_strnumbuf);
3294 char c = peek_inbuf();
3296 RETURN_STATUS(bc_error("unterminated string"));
3298 if (c == '[') depth++;
3304 bc_vec_push(&p->lex_strnumbuf, p->lex_inbuf);
3307 bc_vec_pushZeroByte(&p->lex_strnumbuf);
3308 p->lex_inbuf++; // skip trailing ']'
3310 G.err_line = p->lex_line;
3311 RETURN_STATUS(BC_STATUS_SUCCESS);
3313 #define zdc_lex_string(...) (zdc_lex_string(__VA_ARGS__) COMMA_SUCCESS)
3315 #undef zdc_lex_token
3316 static BC_STATUS zdc_lex_token(void)
3318 static const //BcLexType - should be this type, but narrower type saves size:
3320 dc_lex_regs[] ALIGN1 = {
3321 XC_LEX_OP_REL_EQ, XC_LEX_OP_REL_LE, XC_LEX_OP_REL_GE, XC_LEX_OP_REL_NE,
3322 XC_LEX_OP_REL_LT, XC_LEX_OP_REL_GT, DC_LEX_SCOLON, DC_LEX_COLON,
3323 DC_LEX_ELSE, DC_LEX_LOAD, DC_LEX_LOAD_POP, DC_LEX_OP_ASSIGN,
3327 BcParse *p = &G.prs;
3332 for (i = 0; i < ARRAY_SIZE(dc_lex_regs); ++i) {
3333 if (p->lex_last == dc_lex_regs[i])
3334 RETURN_STATUS(zdc_lex_register());
3337 s = BC_STATUS_SUCCESS;
3339 if (c >= '%' && c <= '~'
3340 && (p->lex = dc_char_to_LEX[c - '%']) != XC_LEX_INVALID
3345 // This is the workhorse of the lexer.
3347 // case '\0': // probably never reached
3348 // p->lex = XC_LEX_EOF;
3351 // '\n' is XC_LEX_NLINE, not XC_LEX_WHITESPACE
3352 // (and "case '\n':" is not just empty here)
3353 // only to allow interactive dc have a way to exit
3354 // "parse" stage of "parse,execute" loop
3355 // on <enter>, not on _next_ token (which would mean
3356 // commands are not executed on pressing <enter>).
3357 // IOW: typing "1p<enter>" should print "1" _at once_,
3358 // not after some more input.
3360 p->lex = XC_LEX_NLINE;
3367 xc_lex_whitespace();
3372 p->lex = XC_LEX_OP_REL_NE;
3374 p->lex = XC_LEX_OP_REL_LE;
3376 p->lex = XC_LEX_OP_REL_GE;
3378 RETURN_STATUS(bc_error_bad_character(c));
3382 xc_lex_lineComment();
3385 if (isdigit(*p->lex_inbuf))
3386 s = zxc_lex_number(c);
3388 s = bc_error_bad_character(c);
3406 s = zxc_lex_number(c);
3409 s = zdc_lex_string();
3412 p->lex = XC_LEX_INVALID;
3413 s = bc_error_bad_character(c);
3419 #define zdc_lex_token(...) (zdc_lex_token(__VA_ARGS__) COMMA_SUCCESS)
3422 static void xc_parse_push(char i)
3424 BcVec *code = &G.prs.func->code;
3425 dbg_compile("%s:%d pushing bytecode %zd:%d", __func__, __LINE__, code->len, i);
3426 bc_vec_pushByte(code, i);
3429 static void xc_parse_pushName(char *name)
3432 BcVec *code = &G.prs.func->code;
3433 size_t pos = code->len;
3434 size_t len = strlen(name) + 1;
3436 bc_vec_expand(code, pos + len);
3437 strcpy(code->v + pos, name);
3438 code->len = pos + len;
3440 // Smaller code, but way slow:
3442 xc_parse_push(*name);
3447 // Indexes < 0xfc are encoded verbatim, else first byte is
3448 // 0xfc, 0xfd, 0xfe or 0xff, encoding "1..4 bytes",
3449 // followed by that many bytes, lsb first.
3450 // (The above describes 32-bit case).
3451 #define SMALL_INDEX_LIMIT (0x100 - sizeof(size_t))
3453 static void xc_parse_pushIndex(size_t idx)
3458 dbg_lex("%s:%d pushing index %zd", __func__, __LINE__, idx);
3459 if (idx < SMALL_INDEX_LIMIT) {
3463 mask = ((size_t)0xff) << (sizeof(idx) * 8 - 8);
3466 if (idx & mask) break;
3471 xc_parse_push(SMALL_INDEX_LIMIT + amt);
3475 xc_parse_push((unsigned char)idx);
3481 static void bc_parse_pushJUMP(size_t idx)
3483 xc_parse_push(BC_INST_JUMP);
3484 xc_parse_pushIndex(idx);
3487 static void bc_parse_pushJUMP_ZERO(size_t idx)
3489 xc_parse_push(BC_INST_JUMP_ZERO);
3490 xc_parse_pushIndex(idx);
3493 static BC_STATUS zbc_parse_pushSTR(void)
3495 BcParse *p = &G.prs;
3496 char *str = xstrdup(p->lex_strnumbuf.v);
3498 xc_parse_push(XC_INST_STR);
3499 xc_parse_pushIndex(p->func->strs.len);
3500 bc_vec_push(&p->func->strs, &str);
3502 RETURN_STATUS(zxc_lex_next());
3504 #define zbc_parse_pushSTR(...) (zbc_parse_pushSTR(__VA_ARGS__) COMMA_SUCCESS)
3507 static void xc_parse_pushNUM(void)
3509 BcParse *p = &G.prs;
3510 char *num = xstrdup(p->lex_strnumbuf.v);
3511 #if ENABLE_BC && ENABLE_DC
3512 size_t idx = bc_vec_push(IS_BC ? &p->func->consts : &G.prog.consts, &num);
3514 size_t idx = bc_vec_push(&p->func->consts, &num);
3516 size_t idx = bc_vec_push(&G.prog.consts, &num);
3518 xc_parse_push(XC_INST_NUM);
3519 xc_parse_pushIndex(idx);
3522 static BC_STATUS zxc_parse_text_init(const char *text)
3524 G.prs.func = xc_program_func(G.prs.fidx);
3525 G.prs.lex_inbuf = text;
3526 G.prs.lex = G.prs.lex_last = XC_LEX_INVALID;
3527 RETURN_STATUS(zxc_lex_next());
3529 #define zxc_parse_text_init(...) (zxc_parse_text_init(__VA_ARGS__) COMMA_SUCCESS)
3531 // Called when parsing or execution detects a failure,
3532 // resets execution structures.
3533 static void xc_program_reset(void)
3538 bc_vec_npop(&G.prog.exestack, G.prog.exestack.len - 1);
3539 bc_vec_pop_all(&G.prog.results);
3541 f = xc_program_func_BC_PROG_MAIN();
3542 ip = bc_vec_top(&G.prog.exestack);
3543 ip->inst_idx = f->code.len;
3546 // Called when parsing code detects a failure,
3547 // resets parsing structures.
3548 static void xc_parse_reset(void)
3550 BcParse *p = &G.prs;
3551 if (p->fidx != BC_PROG_MAIN) {
3552 bc_func_free(p->func);
3553 bc_func_init(p->func);
3555 p->fidx = BC_PROG_MAIN;
3556 p->func = xc_program_func_BC_PROG_MAIN();
3559 p->lex_inbuf += strlen(p->lex_inbuf);
3560 p->lex = XC_LEX_EOF;
3562 IF_BC(bc_vec_pop_all(&p->exits);)
3563 IF_BC(bc_vec_pop_all(&p->conds);)
3564 IF_BC(bc_vec_pop_all(&p->ops);)
3569 static void xc_parse_free(void)
3571 IF_BC(bc_vec_free(&G.prs.exits);)
3572 IF_BC(bc_vec_free(&G.prs.conds);)
3573 IF_BC(bc_vec_free(&G.prs.ops);)
3574 bc_vec_free(&G.prs.lex_strnumbuf);
3577 static void xc_parse_create(size_t fidx)
3579 BcParse *p = &G.prs;
3580 memset(p, 0, sizeof(BcParse));
3582 bc_char_vec_init(&p->lex_strnumbuf);
3583 IF_BC(bc_vec_init(&p->exits, sizeof(size_t), NULL);)
3584 IF_BC(bc_vec_init(&p->conds, sizeof(size_t), NULL);)
3585 IF_BC(bc_vec_init(&p->ops, sizeof(BcLexType), NULL);)
3588 p->func = xc_program_func(fidx);
3591 static void xc_program_add_fn(void)
3597 bc_vec_push(&G.prog.fns, &f);
3603 // Note: takes ownership of 'name' (must be malloced)
3604 static size_t bc_program_addFunc(char *name)
3607 BcId entry, *entry_ptr;
3611 entry.idx = G.prog.fns.len;
3613 inserted = bc_map_insert(&G.prog.fn_map, &entry, &idx);
3614 if (!inserted) free(name);
3616 entry_ptr = bc_vec_item(&G.prog.fn_map, idx);
3617 idx = entry_ptr->idx;
3620 // There is already a function with this name.
3621 // It'll be redefined now, clear old definition.
3622 BcFunc *func = xc_program_func(entry_ptr->idx);
3626 xc_program_add_fn();
3632 #define BC_PARSE_TOP_OP(p) (*(BcLexType*)bc_vec_top(&(p)->ops))
3633 // We can calculate the conversion between tokens and exprs by subtracting the
3634 // position of the first operator in the lex enum and adding the position of the
3635 // first in the expr enum. Note: This only works for binary operators.
3636 #define BC_TOKEN_2_INST(t) ((char) ((t) - XC_LEX_OP_POWER + XC_INST_POWER))
3638 static BcStatus bc_parse_expr_empty_ok(uint8_t flags);
3640 static BC_STATUS zbc_parse_expr(uint8_t flags)
3644 s = bc_parse_expr_empty_ok(flags);
3645 if (s == BC_STATUS_PARSE_EMPTY_EXP)
3646 RETURN_STATUS(bc_error("empty expression"));
3649 #define zbc_parse_expr(...) (zbc_parse_expr(__VA_ARGS__) COMMA_SUCCESS)
3651 static BC_STATUS zbc_parse_stmt_possibly_auto(bool auto_allowed);
3652 #define zbc_parse_stmt_possibly_auto(...) (zbc_parse_stmt_possibly_auto(__VA_ARGS__) COMMA_SUCCESS)
3654 static BC_STATUS zbc_parse_stmt(void)
3656 RETURN_STATUS(zbc_parse_stmt_possibly_auto(false));
3658 #define zbc_parse_stmt(...) (zbc_parse_stmt(__VA_ARGS__) COMMA_SUCCESS)
3660 static BC_STATUS zbc_parse_stmt_allow_NLINE_before(const char *after_X)
3662 BcParse *p = &G.prs;
3663 // "if(cond)<newline>stmt" is accepted too, but not 2+ newlines.
3664 // Same for "else", "while()", "for()".
3665 BcStatus s = zbc_lex_next_and_skip_NLINE();
3666 if (s) RETURN_STATUS(s);
3667 if (p->lex == XC_LEX_NLINE)
3668 RETURN_STATUS(bc_error_fmt("no statement after '%s'", after_X));
3670 RETURN_STATUS(zbc_parse_stmt());
3672 #define zbc_parse_stmt_allow_NLINE_before(...) (zbc_parse_stmt_allow_NLINE_before(__VA_ARGS__) COMMA_SUCCESS)
3674 static void bc_parse_operator(BcLexType type, size_t start, size_t *nexprs)
3676 BcParse *p = &G.prs;
3677 char l, r = bc_parse_op_PREC(type - XC_LEX_1st_op);
3678 bool left = bc_parse_op_LEFT(type - XC_LEX_1st_op);
3680 while (p->ops.len > start) {
3681 BcLexType t = BC_PARSE_TOP_OP(p);
3682 if (t == BC_LEX_LPAREN) break;
3684 l = bc_parse_op_PREC(t - XC_LEX_1st_op);
3685 if (l >= r && (l != r || !left)) break;
3687 xc_parse_push(BC_TOKEN_2_INST(t));
3688 bc_vec_pop(&p->ops);
3689 *nexprs -= (t != BC_LEX_OP_BOOL_NOT && t != XC_LEX_NEG);
3692 bc_vec_push(&p->ops, &type);
3695 static BC_STATUS zbc_parse_rightParen(size_t ops_bgn, size_t *nexs)
3697 BcParse *p = &G.prs;
3700 if (p->ops.len <= ops_bgn)
3701 RETURN_STATUS(bc_error_bad_expression());
3702 top = BC_PARSE_TOP_OP(p);
3704 while (top != BC_LEX_LPAREN) {
3705 xc_parse_push(BC_TOKEN_2_INST(top));
3707 bc_vec_pop(&p->ops);
3708 *nexs -= (top != BC_LEX_OP_BOOL_NOT && top != XC_LEX_NEG);
3710 if (p->ops.len <= ops_bgn)
3711 RETURN_STATUS(bc_error_bad_expression());
3712 top = BC_PARSE_TOP_OP(p);
3715 bc_vec_pop(&p->ops);
3717 RETURN_STATUS(BC_STATUS_SUCCESS);
3719 #define zbc_parse_rightParen(...) (zbc_parse_rightParen(__VA_ARGS__) COMMA_SUCCESS)
3721 static BC_STATUS zbc_parse_params(uint8_t flags)
3723 BcParse *p = &G.prs;
3727 dbg_lex("%s:%d p->lex:%d", __func__, __LINE__, p->lex);
3728 flags = (flags & ~(BC_PARSE_PRINT | BC_PARSE_REL)) | BC_PARSE_ARRAY;
3731 if (s) RETURN_STATUS(s);
3734 if (p->lex != BC_LEX_RPAREN) {
3736 s = zbc_parse_expr(flags);
3737 if (s) RETURN_STATUS(s);
3739 if (p->lex != BC_LEX_COMMA) {
3740 if (p->lex == BC_LEX_RPAREN)
3742 RETURN_STATUS(bc_error_bad_token());
3745 if (s) RETURN_STATUS(s);
3749 xc_parse_push(BC_INST_CALL);
3750 xc_parse_pushIndex(nparams);
3752 RETURN_STATUS(BC_STATUS_SUCCESS);
3754 #define zbc_parse_params(...) (zbc_parse_params(__VA_ARGS__) COMMA_SUCCESS)
3756 // Note: takes ownership of 'name' (must be malloced)
3757 static BC_STATUS zbc_parse_call(char *name, uint8_t flags)
3759 BcParse *p = &G.prs;
3761 BcId entry, *entry_ptr;
3766 s = zbc_parse_params(flags);
3769 if (p->lex != BC_LEX_RPAREN) {
3770 s = bc_error_bad_token();
3774 idx = bc_map_find_exact(&G.prog.fn_map, &entry);
3776 if (idx == BC_VEC_INVALID_IDX) {
3777 // No such function exists, create an empty one
3778 bc_program_addFunc(name);
3779 idx = bc_map_find_exact(&G.prog.fn_map, &entry);
3783 entry_ptr = bc_vec_item(&G.prog.fn_map, idx);
3784 xc_parse_pushIndex(entry_ptr->idx);
3786 RETURN_STATUS(zxc_lex_next());
3791 #define zbc_parse_call(...) (zbc_parse_call(__VA_ARGS__) COMMA_SUCCESS)
3793 static BC_STATUS zbc_parse_name(BcInst *type, uint8_t flags)
3795 BcParse *p = &G.prs;
3799 name = xstrdup(p->lex_strnumbuf.v);
3803 if (p->lex == BC_LEX_LBRACKET) {
3807 if (p->lex == BC_LEX_RBRACKET) {
3808 if (!(flags & BC_PARSE_ARRAY)) {
3809 s = bc_error_bad_expression();
3812 *type = XC_INST_ARRAY;
3814 *type = XC_INST_ARRAY_ELEM;
3815 flags &= ~(BC_PARSE_PRINT | BC_PARSE_REL);
3816 s = zbc_parse_expr(flags);
3821 xc_parse_push(*type);
3822 xc_parse_pushName(name);
3824 } else if (p->lex == BC_LEX_LPAREN) {
3825 if (flags & BC_PARSE_NOCALL) {
3826 s = bc_error_bad_token();
3829 *type = BC_INST_CALL;
3830 s = zbc_parse_call(name, flags);
3832 *type = XC_INST_VAR;
3833 xc_parse_push(XC_INST_VAR);
3834 xc_parse_pushName(name);
3843 #define zbc_parse_name(...) (zbc_parse_name(__VA_ARGS__) COMMA_SUCCESS)
3845 static BC_STATUS zbc_parse_read(void)
3847 BcParse *p = &G.prs;
3851 if (s) RETURN_STATUS(s);
3852 if (p->lex != BC_LEX_LPAREN) RETURN_STATUS(bc_error_bad_token());
3855 if (s) RETURN_STATUS(s);
3856 if (p->lex != BC_LEX_RPAREN) RETURN_STATUS(bc_error_bad_token());
3858 xc_parse_push(XC_INST_READ);
3862 #define zbc_parse_read(...) (zbc_parse_read(__VA_ARGS__) COMMA_SUCCESS)
3864 static BC_STATUS zbc_parse_builtin(BcLexType type, uint8_t flags, BcInst *prev)
3866 BcParse *p = &G.prs;
3870 if (s) RETURN_STATUS(s);
3871 if (p->lex != BC_LEX_LPAREN) RETURN_STATUS(bc_error_bad_token());
3873 flags = (flags & ~(BC_PARSE_PRINT | BC_PARSE_REL)) | BC_PARSE_ARRAY;
3876 if (s) RETURN_STATUS(s);
3878 s = zbc_parse_expr(flags);
3879 if (s) RETURN_STATUS(s);
3881 if (p->lex != BC_LEX_RPAREN) RETURN_STATUS(bc_error_bad_token());
3883 *prev = (type == BC_LEX_KEY_LENGTH) ? XC_INST_LENGTH : XC_INST_SQRT;
3884 xc_parse_push(*prev);
3888 #define zbc_parse_builtin(...) (zbc_parse_builtin(__VA_ARGS__) COMMA_SUCCESS)
3890 static BC_STATUS zbc_parse_scale(BcInst *type, uint8_t flags)
3892 BcParse *p = &G.prs;
3896 if (s) RETURN_STATUS(s);
3898 if (p->lex != BC_LEX_LPAREN) {
3899 *type = XC_INST_SCALE;
3900 xc_parse_push(XC_INST_SCALE);
3901 RETURN_STATUS(BC_STATUS_SUCCESS);
3904 *type = XC_INST_SCALE_FUNC;
3905 flags &= ~(BC_PARSE_PRINT | BC_PARSE_REL);
3908 if (s) RETURN_STATUS(s);
3910 s = zbc_parse_expr(flags);
3911 if (s) RETURN_STATUS(s);
3912 if (p->lex != BC_LEX_RPAREN)
3913 RETURN_STATUS(bc_error_bad_token());
3914 xc_parse_push(XC_INST_SCALE_FUNC);
3916 RETURN_STATUS(zxc_lex_next());
3918 #define zbc_parse_scale(...) (zbc_parse_scale(__VA_ARGS__) COMMA_SUCCESS)
3920 static BC_STATUS zbc_parse_incdec(BcInst *prev, bool *paren_expr,
3921 size_t *nexprs, uint8_t flags)
3923 BcParse *p = &G.prs;
3927 BcInst etype = *prev;
3929 if (etype == XC_INST_VAR || etype == XC_INST_ARRAY_ELEM
3930 || etype == XC_INST_SCALE || etype == BC_INST_LAST
3931 || etype == XC_INST_IBASE || etype == XC_INST_OBASE
3933 *prev = inst = BC_INST_INC_POST + (p->lex != BC_LEX_OP_INC);
3934 xc_parse_push(inst);
3937 *prev = inst = BC_INST_INC_PRE + (p->lex != BC_LEX_OP_INC);
3941 if (s) RETURN_STATUS(s);
3944 // Because we parse the next part of the expression
3945 // right here, we need to increment this.
3946 *nexprs = *nexprs + 1;
3950 s = zbc_parse_name(prev, flags | BC_PARSE_NOCALL);
3952 case BC_LEX_KEY_IBASE:
3953 case BC_LEX_KEY_LAST:
3954 case BC_LEX_KEY_OBASE:
3955 xc_parse_push(type - BC_LEX_KEY_IBASE + XC_INST_IBASE);
3958 case BC_LEX_KEY_SCALE:
3960 if (s) RETURN_STATUS(s);
3961 if (p->lex == BC_LEX_LPAREN)
3962 s = bc_error_bad_token();
3964 xc_parse_push(XC_INST_SCALE);
3967 s = bc_error_bad_token();
3971 if (!s) xc_parse_push(inst);
3976 #define zbc_parse_incdec(...) (zbc_parse_incdec(__VA_ARGS__) COMMA_SUCCESS)
3979 #define BC_PARSE_LEAF(p, rparen) \
3981 || ((p) >= XC_INST_NUM && (p) <= XC_INST_SQRT) \
3982 || (p) == BC_INST_INC_POST \
3983 || (p) == BC_INST_DEC_POST \
3986 static int ok_in_expr(BcInst p)
3988 return (p >= XC_INST_NUM && p <= XC_INST_SQRT)
3989 || p == BC_INST_INC_POST
3990 || p == BC_INST_DEC_POST
3993 #define BC_PARSE_LEAF(p, rparen) ((rparen) || ok_in_expr(p))
3996 static BC_STATUS zbc_parse_minus(BcInst *prev, size_t ops_bgn,
3997 bool rparen, size_t *nexprs)
3999 BcParse *p = &G.prs;
4002 BcInst etype = *prev;
4005 if (s) RETURN_STATUS(s);
4007 type = BC_PARSE_LEAF(etype, rparen) ? XC_LEX_OP_MINUS : XC_LEX_NEG;
4008 *prev = BC_TOKEN_2_INST(type);
4010 // We can just push onto the op stack because this is the largest
4011 // precedence operator that gets pushed. Inc/dec does not.
4012 if (type != XC_LEX_OP_MINUS)
4013 bc_vec_push(&p->ops, &type);
4015 bc_parse_operator(type, ops_bgn, nexprs);
4019 #define zbc_parse_minus(...) (zbc_parse_minus(__VA_ARGS__) COMMA_SUCCESS)
4021 static BC_STATUS zbc_parse_print(void)
4023 BcParse *p = &G.prs;
4029 if (s) RETURN_STATUS(s);
4031 if (type == XC_LEX_STR) {
4032 s = zbc_parse_pushSTR();
4034 s = zbc_parse_expr(0);
4036 if (s) RETURN_STATUS(s);
4037 xc_parse_push(XC_INST_PRINT_POP);
4038 if (p->lex != BC_LEX_COMMA)
4044 #define zbc_parse_print(...) (zbc_parse_print(__VA_ARGS__) COMMA_SUCCESS)
4046 static BC_STATUS zbc_parse_return(void)
4048 BcParse *p = &G.prs;
4052 dbg_lex_enter("%s:%d entered", __func__, __LINE__);
4054 if (s) RETURN_STATUS(s);
4057 if (t == XC_LEX_NLINE || t == BC_LEX_SCOLON)
4058 xc_parse_push(BC_INST_RET0);
4060 bool paren = (t == BC_LEX_LPAREN);
4061 s = bc_parse_expr_empty_ok(0);
4062 if (s == BC_STATUS_PARSE_EMPTY_EXP) {
4063 xc_parse_push(BC_INST_RET0);
4066 if (s) RETURN_STATUS(s);
4068 if (!paren || p->lex_last != BC_LEX_RPAREN) {
4069 s = zbc_POSIX_requires("parentheses around return expressions");
4070 if (s) RETURN_STATUS(s);
4073 xc_parse_push(XC_INST_RET);
4076 dbg_lex_done("%s:%d done", __func__, __LINE__);
4079 #define zbc_parse_return(...) (zbc_parse_return(__VA_ARGS__) COMMA_SUCCESS)
4081 static void rewrite_label_to_current(size_t idx)
4083 BcParse *p = &G.prs;
4084 size_t *label = bc_vec_item(&p->func->labels, idx);
4085 *label = p->func->code.len;
4088 static BC_STATUS zbc_parse_if(void)
4090 BcParse *p = &G.prs;
4094 dbg_lex_enter("%s:%d entered", __func__, __LINE__);
4096 if (s) RETURN_STATUS(s);
4097 if (p->lex != BC_LEX_LPAREN) RETURN_STATUS(bc_error_bad_token());
4100 if (s) RETURN_STATUS(s);
4101 s = zbc_parse_expr(BC_PARSE_REL);
4102 if (s) RETURN_STATUS(s);
4103 if (p->lex != BC_LEX_RPAREN) RETURN_STATUS(bc_error_bad_token());
4105 // Encode "if zero, jump to ..."
4106 // Pushed value (destination of the jump) is uninitialized,
4107 // will be rewritten to be address of "end of if()" or of "else".
4108 ip_idx = bc_vec_push(&p->func->labels, &ip_idx);
4109 bc_parse_pushJUMP_ZERO(ip_idx);
4111 s = zbc_parse_stmt_allow_NLINE_before(STRING_if);
4112 if (s) RETURN_STATUS(s);
4114 dbg_lex("%s:%d in if after stmt: p->lex:%d", __func__, __LINE__, p->lex);
4115 if (p->lex == BC_LEX_KEY_ELSE) {
4118 // Encode "after then_stmt, jump to end of if()"
4119 ip2_idx = bc_vec_push(&p->func->labels, &ip2_idx);
4120 dbg_lex("%s:%d after if() then_stmt: BC_INST_JUMP to %zd", __func__, __LINE__, ip2_idx);
4121 bc_parse_pushJUMP(ip2_idx);
4123 dbg_lex("%s:%d rewriting 'if_zero' label to jump to 'else'-> %zd", __func__, __LINE__, p->func->code.len);
4124 rewrite_label_to_current(ip_idx);
4128 s = zbc_parse_stmt_allow_NLINE_before(STRING_else);
4129 if (s) RETURN_STATUS(s);
4132 dbg_lex("%s:%d rewriting label to jump after 'if' body-> %zd", __func__, __LINE__, p->func->code.len);
4133 rewrite_label_to_current(ip_idx);
4135 dbg_lex_done("%s:%d done", __func__, __LINE__);
4138 #define zbc_parse_if(...) (zbc_parse_if(__VA_ARGS__) COMMA_SUCCESS)
4140 static BC_STATUS zbc_parse_while(void)
4142 BcParse *p = &G.prs;
4148 if (s) RETURN_STATUS(s);
4149 if (p->lex != BC_LEX_LPAREN) RETURN_STATUS(bc_error_bad_token());
4151 if (s) RETURN_STATUS(s);
4153 cond_idx = bc_vec_push(&p->func->labels, &p->func->code.len);
4154 ip_idx = cond_idx + 1;
4155 bc_vec_push(&p->conds, &cond_idx);
4157 bc_vec_push(&p->exits, &ip_idx);
4158 bc_vec_push(&p->func->labels, &ip_idx);
4160 s = zbc_parse_expr(BC_PARSE_REL);
4161 if (s) RETURN_STATUS(s);
4162 if (p->lex != BC_LEX_RPAREN) RETURN_STATUS(bc_error_bad_token());
4164 bc_parse_pushJUMP_ZERO(ip_idx);
4166 s = zbc_parse_stmt_allow_NLINE_before(STRING_while);
4167 if (s) RETURN_STATUS(s);
4169 dbg_lex("%s:%d BC_INST_JUMP to %zd", __func__, __LINE__, cond_idx);
4170 bc_parse_pushJUMP(cond_idx);
4172 dbg_lex("%s:%d rewriting label-> %zd", __func__, __LINE__, p->func->code.len);
4173 rewrite_label_to_current(ip_idx);
4175 bc_vec_pop(&p->exits);
4176 bc_vec_pop(&p->conds);
4180 #define zbc_parse_while(...) (zbc_parse_while(__VA_ARGS__) COMMA_SUCCESS)
4182 static BC_STATUS zbc_parse_for(void)
4184 BcParse *p = &G.prs;
4186 size_t cond_idx, exit_idx, body_idx, update_idx;
4188 dbg_lex("%s:%d p->lex:%d", __func__, __LINE__, p->lex);
4190 if (s) RETURN_STATUS(s);
4191 if (p->lex != BC_LEX_LPAREN) RETURN_STATUS(bc_error_bad_token());
4193 if (s) RETURN_STATUS(s);
4195 if (p->lex != BC_LEX_SCOLON) {
4196 s = zbc_parse_expr(0);
4197 xc_parse_push(XC_INST_POP);
4198 if (s) RETURN_STATUS(s);
4200 s = zbc_POSIX_does_not_allow_empty_X_expression_in_for("init");
4201 if (s) RETURN_STATUS(s);
4204 if (p->lex != BC_LEX_SCOLON) RETURN_STATUS(bc_error_bad_token());
4206 if (s) RETURN_STATUS(s);
4208 cond_idx = bc_vec_push(&p->func->labels, &p->func->code.len);
4209 update_idx = cond_idx + 1;
4210 body_idx = update_idx + 1;
4211 exit_idx = body_idx + 1;
4213 if (p->lex != BC_LEX_SCOLON)
4214 s = zbc_parse_expr(BC_PARSE_REL);
4216 // Set this for the next call to xc_parse_pushNUM().
4217 // This is safe to set because the current token is a semicolon,
4218 // which has no string requirement.
4219 bc_vec_string(&p->lex_strnumbuf, 1, "1");
4221 s = zbc_POSIX_does_not_allow_empty_X_expression_in_for("condition");
4223 if (s) RETURN_STATUS(s);
4225 if (p->lex != BC_LEX_SCOLON) RETURN_STATUS(bc_error_bad_token());
4228 if (s) RETURN_STATUS(s);
4230 bc_parse_pushJUMP_ZERO(exit_idx);
4231 bc_parse_pushJUMP(body_idx);
4233 bc_vec_push(&p->conds, &update_idx);
4234 bc_vec_push(&p->func->labels, &p->func->code.len);
4236 if (p->lex != BC_LEX_RPAREN) {
4237 s = zbc_parse_expr(0);
4238 if (s) RETURN_STATUS(s);
4239 if (p->lex != BC_LEX_RPAREN) RETURN_STATUS(bc_error_bad_token());
4240 xc_parse_push(XC_INST_POP);
4242 s = zbc_POSIX_does_not_allow_empty_X_expression_in_for("update");
4243 if (s) RETURN_STATUS(s);
4246 bc_parse_pushJUMP(cond_idx);
4247 bc_vec_push(&p->func->labels, &p->func->code.len);
4249 bc_vec_push(&p->exits, &exit_idx);
4250 bc_vec_push(&p->func->labels, &exit_idx);
4252 s = zbc_parse_stmt_allow_NLINE_before(STRING_for);
4253 if (s) RETURN_STATUS(s);
4255 dbg_lex("%s:%d BC_INST_JUMP to %zd", __func__, __LINE__, update_idx);
4256 bc_parse_pushJUMP(update_idx);
4258 dbg_lex("%s:%d rewriting label-> %zd", __func__, __LINE__, p->func->code.len);
4259 rewrite_label_to_current(exit_idx);
4261 bc_vec_pop(&p->exits);
4262 bc_vec_pop(&p->conds);
4264 RETURN_STATUS(BC_STATUS_SUCCESS);
4266 #define zbc_parse_for(...) (zbc_parse_for(__VA_ARGS__) COMMA_SUCCESS)
4268 static BC_STATUS zbc_parse_break_or_continue(BcLexType type)
4270 BcParse *p = &G.prs;
4273 if (type == BC_LEX_KEY_BREAK) {
4274 if (p->exits.len == 0) // none of the enclosing blocks is a loop
4275 RETURN_STATUS(bc_error_bad_token());
4276 i = *(size_t*)bc_vec_top(&p->exits);
4278 i = *(size_t*)bc_vec_top(&p->conds);
4280 bc_parse_pushJUMP(i);
4282 RETURN_STATUS(zxc_lex_next());
4284 #define zbc_parse_break_or_continue(...) (zbc_parse_break_or_continue(__VA_ARGS__) COMMA_SUCCESS)
4286 static BC_STATUS zbc_func_insert(BcFunc *f, char *name, bool var)
4292 autoid = (void*)f->autos.v;
4293 for (i = 0; i < f->autos.len; i++, autoid++) {
4294 if (strcmp(name, autoid->name) == 0)
4295 RETURN_STATUS(bc_error("duplicate function parameter or auto name"));
4301 bc_vec_push(&f->autos, &a);
4303 RETURN_STATUS(BC_STATUS_SUCCESS);
4305 #define zbc_func_insert(...) (zbc_func_insert(__VA_ARGS__) COMMA_SUCCESS)
4307 static BC_STATUS zbc_parse_funcdef(void)
4309 BcParse *p = &G.prs;
4311 bool var, comma = false;
4314 dbg_lex_enter("%s:%d entered", __func__, __LINE__);
4316 if (s) RETURN_STATUS(s);
4317 if (p->lex != XC_LEX_NAME)
4318 RETURN_STATUS(bc_error("bad function definition"));
4320 name = xstrdup(p->lex_strnumbuf.v);
4321 p->fidx = bc_program_addFunc(name);
4322 p->func = xc_program_func(p->fidx);
4325 if (s) RETURN_STATUS(s);
4326 if (p->lex != BC_LEX_LPAREN)
4327 RETURN_STATUS(bc_error("bad function definition"));
4329 if (s) RETURN_STATUS(s);
4331 while (p->lex != BC_LEX_RPAREN) {
4332 if (p->lex != XC_LEX_NAME)
4333 RETURN_STATUS(bc_error("bad function definition"));
4337 name = xstrdup(p->lex_strnumbuf.v);
4341 var = p->lex != BC_LEX_LBRACKET;
4347 if (p->lex != BC_LEX_RBRACKET) {
4348 s = bc_error("bad function definition");
4356 comma = p->lex == BC_LEX_COMMA;
4362 s = zbc_func_insert(p->func, name, var);
4366 if (comma) RETURN_STATUS(bc_error("bad function definition"));
4369 if (s) RETURN_STATUS(s);
4371 if (p->lex != BC_LEX_LBRACE) {
4372 s = zbc_POSIX_requires("the left brace be on the same line as the function header");
4373 if (s) RETURN_STATUS(s);
4376 // Prevent "define z()<newline>" from being interpreted as function with empty stmt as body
4377 s = zbc_lex_skip_if_at_NLINE();
4378 if (s) RETURN_STATUS(s);
4379 //GNU bc requires a {} block even if function body has single stmt, enforce this?
4380 if (p->lex != BC_LEX_LBRACE)
4381 RETURN_STATUS(bc_error("function { body } expected"));
4383 p->in_funcdef++; // to determine whether "return" stmt is allowed, and such
4384 s = zbc_parse_stmt_possibly_auto(true);
4386 if (s) RETURN_STATUS(s);
4388 xc_parse_push(BC_INST_RET0);
4390 // Subsequent code generation is into main program
4391 p->fidx = BC_PROG_MAIN;
4392 p->func = xc_program_func_BC_PROG_MAIN();
4394 dbg_lex_done("%s:%d done", __func__, __LINE__);
4397 dbg_lex_done("%s:%d done (error)", __func__, __LINE__);
4401 #define zbc_parse_funcdef(...) (zbc_parse_funcdef(__VA_ARGS__) COMMA_SUCCESS)
4403 static BC_STATUS zbc_parse_auto(void)
4405 BcParse *p = &G.prs;
4409 dbg_lex_enter("%s:%d entered", __func__, __LINE__);
4411 if (s) RETURN_STATUS(s);
4416 if (p->lex != XC_LEX_NAME)
4417 RETURN_STATUS(bc_error("bad 'auto' syntax"));
4419 name = xstrdup(p->lex_strnumbuf.v);
4423 var = (p->lex != BC_LEX_LBRACKET);
4428 if (p->lex != BC_LEX_RBRACKET) {
4429 s = bc_error("bad 'auto' syntax");
4436 s = zbc_func_insert(p->func, name, var);
4439 if (p->lex == XC_LEX_NLINE
4440 || p->lex == BC_LEX_SCOLON
4441 //|| p->lex == BC_LEX_RBRACE // allow "define f() {auto a}"
4445 if (p->lex != BC_LEX_COMMA)
4446 RETURN_STATUS(bc_error("bad 'auto' syntax"));
4447 s = zxc_lex_next(); // skip comma
4448 if (s) RETURN_STATUS(s);
4451 dbg_lex_done("%s:%d done", __func__, __LINE__);
4452 RETURN_STATUS(BC_STATUS_SUCCESS);
4455 dbg_lex_done("%s:%d done (ERROR)", __func__, __LINE__);
4458 #define zbc_parse_auto(...) (zbc_parse_auto(__VA_ARGS__) COMMA_SUCCESS)
4460 #undef zbc_parse_stmt_possibly_auto
4461 static BC_STATUS zbc_parse_stmt_possibly_auto(bool auto_allowed)
4463 BcParse *p = &G.prs;
4464 BcStatus s = BC_STATUS_SUCCESS;
4466 dbg_lex_enter("%s:%d entered, p->lex:%d", __func__, __LINE__, p->lex);
4468 if (p->lex == XC_LEX_NLINE) {
4469 dbg_lex_done("%s:%d done (seen XC_LEX_NLINE)", __func__, __LINE__);
4470 RETURN_STATUS(zxc_lex_next());
4472 if (p->lex == BC_LEX_SCOLON) {
4473 dbg_lex_done("%s:%d done (seen BC_LEX_SCOLON)", __func__, __LINE__);
4474 RETURN_STATUS(zxc_lex_next());
4477 if (p->lex == BC_LEX_LBRACE) {
4478 dbg_lex("%s:%d BC_LEX_LBRACE: (auto_allowed:%d)", __func__, __LINE__, auto_allowed);
4481 if (s) RETURN_STATUS(s);
4482 } while (p->lex == XC_LEX_NLINE);
4483 if (auto_allowed && p->lex == BC_LEX_KEY_AUTO) {
4484 dbg_lex("%s:%d calling zbc_parse_auto()", __func__, __LINE__);
4485 s = zbc_parse_auto();
4486 if (s) RETURN_STATUS(s);
4488 while (p->lex != BC_LEX_RBRACE) {
4489 dbg_lex("%s:%d block parsing loop", __func__, __LINE__);
4490 s = zbc_parse_stmt();
4491 if (s) RETURN_STATUS(s);
4494 dbg_lex_done("%s:%d done (seen BC_LEX_RBRACE)", __func__, __LINE__);
4498 dbg_lex("%s:%d p->lex:%d", __func__, __LINE__, p->lex);
4500 case XC_LEX_OP_MINUS:
4503 case BC_LEX_OP_BOOL_NOT:
4507 case BC_LEX_KEY_IBASE:
4508 case BC_LEX_KEY_LAST:
4509 case BC_LEX_KEY_LENGTH:
4510 case BC_LEX_KEY_OBASE:
4511 case BC_LEX_KEY_READ:
4512 case BC_LEX_KEY_SCALE:
4513 case BC_LEX_KEY_SQRT:
4514 s = zbc_parse_expr(BC_PARSE_PRINT);
4517 s = zbc_parse_pushSTR();
4518 xc_parse_push(XC_INST_PRINT_STR);
4520 case BC_LEX_KEY_BREAK:
4521 case BC_LEX_KEY_CONTINUE:
4522 s = zbc_parse_break_or_continue(p->lex);
4524 case BC_LEX_KEY_FOR:
4525 s = zbc_parse_for();
4527 case BC_LEX_KEY_HALT:
4528 xc_parse_push(BC_INST_HALT);
4534 case BC_LEX_KEY_LIMITS:
4535 // "limits" is a compile-time command,
4536 // the output is produced at _parse time_.
4538 "BC_BASE_MAX = "BC_MAX_OBASE_STR "\n"
4539 "BC_DIM_MAX = "BC_MAX_DIM_STR "\n"
4540 "BC_SCALE_MAX = "BC_MAX_SCALE_STR "\n"
4541 "BC_STRING_MAX = "BC_MAX_STRING_STR"\n"
4542 "BC_NAME_MAX = "BC_MAX_NAME_STR "\n"
4543 "BC_NUM_MAX = "BC_MAX_NUM_STR "\n"
4544 "MAX Exponent = "BC_MAX_EXP_STR "\n"
4545 "Number of vars = "BC_MAX_VARS_STR "\n"
4549 case BC_LEX_KEY_PRINT:
4550 s = zbc_parse_print();
4552 case BC_LEX_KEY_QUIT:
4553 // "quit" is a compile-time command. For example,
4554 // "if (0 == 1) quit" terminates when parsing the statement,
4555 // not when it is executed
4556 QUIT_OR_RETURN_TO_MAIN;
4557 case BC_LEX_KEY_RETURN:
4559 RETURN_STATUS(bc_error("'return' not in a function"));
4560 s = zbc_parse_return();
4562 case BC_LEX_KEY_WHILE:
4563 s = zbc_parse_while();
4566 s = bc_error_bad_token();
4570 dbg_lex_done("%s:%d done", __func__, __LINE__);
4573 #define zbc_parse_stmt_possibly_auto(...) (zbc_parse_stmt_possibly_auto(__VA_ARGS__) COMMA_SUCCESS)
4575 static BC_STATUS zbc_parse_stmt_or_funcdef(void)
4577 BcParse *p = &G.prs;
4580 dbg_lex_enter("%s:%d entered", __func__, __LINE__);
4581 if (p->lex == XC_LEX_EOF)
4582 s = bc_error("end of file");
4583 else if (p->lex == BC_LEX_KEY_DEFINE) {
4584 dbg_lex("%s:%d p->lex:BC_LEX_KEY_DEFINE", __func__, __LINE__);
4585 s = zbc_parse_funcdef();
4587 dbg_lex("%s:%d p->lex:%d (not BC_LEX_KEY_DEFINE)", __func__, __LINE__, p->lex);
4588 s = zbc_parse_stmt();
4591 dbg_lex_done("%s:%d done", __func__, __LINE__);
4594 #define zbc_parse_stmt_or_funcdef(...) (zbc_parse_stmt_or_funcdef(__VA_ARGS__) COMMA_SUCCESS)
4596 // This is not a "z" function: can also return BC_STATUS_PARSE_EMPTY_EXP
4597 static BcStatus bc_parse_expr_empty_ok(uint8_t flags)
4599 BcParse *p = &G.prs;
4600 BcInst prev = XC_INST_PRINT;
4601 size_t nexprs = 0, ops_bgn = p->ops.len;
4602 unsigned nparens, nrelops;
4603 bool paren_first, paren_expr, rprn, assign, bin_last;
4605 dbg_lex_enter("%s:%d entered", __func__, __LINE__);
4606 paren_first = (p->lex == BC_LEX_LPAREN);
4607 nparens = nrelops = 0;
4608 paren_expr = rprn = assign = false;
4614 BcLexType t = p->lex;
4616 if (!lex_allowed_in_bc_expr(t))
4619 dbg_lex("%s:%d t:%d", __func__, __LINE__, t);
4621 s = BC_STATUS_SUCCESS;
4625 dbg_lex("%s:%d LEX_OP_INC/DEC", __func__, __LINE__);
4626 s = zbc_parse_incdec(&prev, &paren_expr, &nexprs, flags);
4627 rprn = bin_last = false;
4628 //get_token = false; - already is
4630 case XC_LEX_OP_MINUS:
4631 dbg_lex("%s:%d LEX_OP_MINUS", __func__, __LINE__);
4632 s = zbc_parse_minus(&prev, ops_bgn, rprn, &nexprs);
4634 //get_token = false; - already is
4635 bin_last = (prev == XC_INST_MINUS);
4637 case BC_LEX_OP_ASSIGN_POWER:
4638 case BC_LEX_OP_ASSIGN_MULTIPLY:
4639 case BC_LEX_OP_ASSIGN_DIVIDE:
4640 case BC_LEX_OP_ASSIGN_MODULUS:
4641 case BC_LEX_OP_ASSIGN_PLUS:
4642 case BC_LEX_OP_ASSIGN_MINUS:
4643 case BC_LEX_OP_ASSIGN:
4644 dbg_lex("%s:%d LEX_ASSIGNxyz", __func__, __LINE__);
4645 if (prev != XC_INST_VAR && prev != XC_INST_ARRAY_ELEM
4646 && prev != XC_INST_SCALE && prev != XC_INST_IBASE
4647 && prev != XC_INST_OBASE && prev != BC_INST_LAST
4649 return bc_error("bad assignment:"
4650 " left side must be variable"
4652 ); // note: shared string
4655 case XC_LEX_OP_POWER:
4656 case XC_LEX_OP_MULTIPLY:
4657 case XC_LEX_OP_DIVIDE:
4658 case XC_LEX_OP_MODULUS:
4659 case XC_LEX_OP_PLUS:
4660 case XC_LEX_OP_REL_EQ:
4661 case XC_LEX_OP_REL_LE:
4662 case XC_LEX_OP_REL_GE:
4663 case XC_LEX_OP_REL_NE:
4664 case XC_LEX_OP_REL_LT:
4665 case XC_LEX_OP_REL_GT:
4666 case BC_LEX_OP_BOOL_NOT:
4667 case BC_LEX_OP_BOOL_OR:
4668 case BC_LEX_OP_BOOL_AND:
4669 dbg_lex("%s:%d LEX_OP_xyz", __func__, __LINE__);
4670 if (((t == BC_LEX_OP_BOOL_NOT) != bin_last)
4671 || (t != BC_LEX_OP_BOOL_NOT && prev == XC_INST_BOOL_NOT)
4673 return bc_error_bad_expression();
4675 nrelops += (t >= XC_LEX_OP_REL_EQ && t <= XC_LEX_OP_REL_GT);
4676 prev = BC_TOKEN_2_INST(t);
4677 bc_parse_operator(t, ops_bgn, &nexprs);
4680 //get_token = false; - already is
4681 bin_last = (t != BC_LEX_OP_BOOL_NOT);
4684 dbg_lex("%s:%d LEX_LPAREN", __func__, __LINE__);
4685 if (BC_PARSE_LEAF(prev, rprn))
4686 return bc_error_bad_expression();
4687 bc_vec_push(&p->ops, &t);
4691 rprn = bin_last = false;
4694 dbg_lex("%s:%d LEX_RPAREN", __func__, __LINE__);
4695 if (bin_last || prev == XC_INST_BOOL_NOT)
4696 return bc_error_bad_expression();
4701 dbg_lex_done("%s:%d done (returning EMPTY_EXP)", __func__, __LINE__);
4702 return BC_STATUS_PARSE_EMPTY_EXP;
4704 s = zbc_parse_rightParen(ops_bgn, &nexprs);
4707 paren_expr = rprn = true;
4711 dbg_lex("%s:%d LEX_NAME", __func__, __LINE__);
4712 if (BC_PARSE_LEAF(prev, rprn))
4713 return bc_error_bad_expression();
4714 s = zbc_parse_name(&prev, flags & ~BC_PARSE_NOCALL);
4716 rprn = bin_last = false;
4717 //get_token = false; - already is
4721 dbg_lex("%s:%d LEX_NUMBER", __func__, __LINE__);
4722 if (BC_PARSE_LEAF(prev, rprn))
4723 return bc_error_bad_expression();
4728 rprn = bin_last = false;
4731 case BC_LEX_KEY_IBASE:
4732 case BC_LEX_KEY_LAST:
4733 case BC_LEX_KEY_OBASE:
4734 dbg_lex("%s:%d LEX_IBASE/LAST/OBASE", __func__, __LINE__);
4735 if (BC_PARSE_LEAF(prev, rprn))
4736 return bc_error_bad_expression();
4737 prev = (char) (t - BC_LEX_KEY_IBASE + XC_INST_IBASE);
4738 xc_parse_push((char) prev);
4741 rprn = bin_last = false;
4744 case BC_LEX_KEY_LENGTH:
4745 case BC_LEX_KEY_SQRT:
4746 dbg_lex("%s:%d LEX_LEN/SQRT", __func__, __LINE__);
4747 if (BC_PARSE_LEAF(prev, rprn))
4748 return bc_error_bad_expression();
4749 s = zbc_parse_builtin(t, flags, &prev);
4752 rprn = bin_last = false;
4755 case BC_LEX_KEY_READ:
4756 dbg_lex("%s:%d LEX_READ", __func__, __LINE__);
4757 if (BC_PARSE_LEAF(prev, rprn))
4758 return bc_error_bad_expression();
4759 s = zbc_parse_read();
4760 prev = XC_INST_READ;
4763 rprn = bin_last = false;
4766 case BC_LEX_KEY_SCALE:
4767 dbg_lex("%s:%d LEX_SCALE", __func__, __LINE__);
4768 if (BC_PARSE_LEAF(prev, rprn))
4769 return bc_error_bad_expression();
4770 s = zbc_parse_scale(&prev, flags);
4771 prev = XC_INST_SCALE;
4772 //get_token = false; - already is
4774 rprn = bin_last = false;
4778 return bc_error_bad_token();
4781 if (s || G_interrupt) // error, or ^C: stop parsing
4782 return BC_STATUS_FAILURE;
4790 while (p->ops.len > ops_bgn) {
4791 BcLexType top = BC_PARSE_TOP_OP(p);
4792 assign = (top >= BC_LEX_OP_ASSIGN_POWER && top <= BC_LEX_OP_ASSIGN);
4794 if (top == BC_LEX_LPAREN || top == BC_LEX_RPAREN)
4795 return bc_error_bad_expression();
4797 xc_parse_push(BC_TOKEN_2_INST(top));
4799 nexprs -= (top != BC_LEX_OP_BOOL_NOT && top != XC_LEX_NEG);
4800 bc_vec_pop(&p->ops);
4803 if (prev == XC_INST_BOOL_NOT || nexprs != 1)
4804 return bc_error_bad_expression();
4806 if (!(flags & BC_PARSE_REL) && nrelops) {
4808 s = zbc_POSIX_does_not_allow("comparison operators outside if or loops");
4810 } else if ((flags & BC_PARSE_REL) && nrelops > 1) {
4812 s = zbc_POSIX_requires("exactly one comparison operator per condition");
4816 if (flags & BC_PARSE_PRINT) {
4817 if (paren_first || !assign)
4818 xc_parse_push(XC_INST_PRINT);
4819 xc_parse_push(XC_INST_POP);
4822 dbg_lex_done("%s:%d done", __func__, __LINE__);
4823 return BC_STATUS_SUCCESS;
4830 static BC_STATUS zdc_parse_register(void)
4832 BcParse *p = &G.prs;
4836 if (s) RETURN_STATUS(s);
4837 if (p->lex != XC_LEX_NAME) RETURN_STATUS(bc_error_bad_token());
4839 xc_parse_pushName(p->lex_strnumbuf.v);
4843 #define zdc_parse_register(...) (zdc_parse_register(__VA_ARGS__) COMMA_SUCCESS)
4845 static void dc_parse_string(void)
4847 BcParse *p = &G.prs;
4849 size_t len = G.prog.strs.len;
4851 dbg_lex_enter("%s:%d entered", __func__, __LINE__);
4853 str = xstrdup(p->lex_strnumbuf.v);
4854 xc_parse_push(XC_INST_STR);
4855 xc_parse_pushIndex(len);
4856 bc_vec_push(&G.prog.strs, &str);
4858 // Explanation needed here
4859 xc_program_add_fn();
4860 p->func = xc_program_func(p->fidx);
4862 dbg_lex_done("%s:%d done", __func__, __LINE__);
4865 static BC_STATUS zdc_parse_mem(uint8_t inst, bool name, bool store)
4869 xc_parse_push(inst);
4871 s = zdc_parse_register();
4872 if (s) RETURN_STATUS(s);
4876 xc_parse_push(DC_INST_SWAP);
4877 xc_parse_push(XC_INST_ASSIGN);
4878 xc_parse_push(XC_INST_POP);
4881 RETURN_STATUS(BC_STATUS_SUCCESS);
4883 #define zdc_parse_mem(...) (zdc_parse_mem(__VA_ARGS__) COMMA_SUCCESS)
4885 static BC_STATUS zdc_parse_cond(uint8_t inst)
4887 BcParse *p = &G.prs;
4890 xc_parse_push(inst);
4891 xc_parse_push(DC_INST_EXEC_COND);
4893 s = zdc_parse_register();
4894 if (s) RETURN_STATUS(s);
4897 if (s) RETURN_STATUS(s);
4899 // Note that 'else' part can not be on the next line:
4900 // echo -e '[1p]sa [2p]sb 2 1>a eb' | dc - OK, prints "2"
4901 // echo -e '[1p]sa [2p]sb 2 1>a\neb' | dc - parse error
4902 if (p->lex == DC_LEX_ELSE) {
4903 s = zdc_parse_register();
4904 if (s) RETURN_STATUS(s);
4907 xc_parse_push('\0');
4912 #define zdc_parse_cond(...) (zdc_parse_cond(__VA_ARGS__) COMMA_SUCCESS)
4914 static BC_STATUS zdc_parse_token(BcLexType t)
4918 bool assign, get_token;
4920 dbg_lex_enter("%s:%d entered", __func__, __LINE__);
4921 s = BC_STATUS_SUCCESS;
4924 case XC_LEX_OP_REL_EQ:
4925 case XC_LEX_OP_REL_LE:
4926 case XC_LEX_OP_REL_GE:
4927 case XC_LEX_OP_REL_NE:
4928 case XC_LEX_OP_REL_LT:
4929 case XC_LEX_OP_REL_GT:
4930 dbg_lex("%s:%d LEX_OP_REL_xyz", __func__, __LINE__);
4931 s = zdc_parse_cond(t - XC_LEX_OP_REL_EQ + XC_INST_REL_EQ);
4936 dbg_lex("%s:%d LEX_[S]COLON", __func__, __LINE__);
4937 s = zdc_parse_mem(XC_INST_ARRAY_ELEM, true, t == DC_LEX_COLON);
4940 dbg_lex("%s:%d LEX_STR", __func__, __LINE__);
4944 dbg_lex("%s:%d LEX_NEG", __func__, __LINE__);
4946 if (s) RETURN_STATUS(s);
4947 if (G.prs.lex != XC_LEX_NUMBER)
4948 RETURN_STATUS(bc_error_bad_token());
4950 xc_parse_push(XC_INST_NEG);
4953 dbg_lex("%s:%d LEX_NUMBER", __func__, __LINE__);
4957 dbg_lex("%s:%d LEX_KEY_READ", __func__, __LINE__);
4958 xc_parse_push(XC_INST_READ);
4960 case DC_LEX_OP_ASSIGN:
4961 case DC_LEX_STORE_PUSH:
4962 dbg_lex("%s:%d LEX_OP_ASSIGN/STORE_PUSH", __func__, __LINE__);
4963 assign = (t == DC_LEX_OP_ASSIGN);
4964 inst = assign ? XC_INST_VAR : DC_INST_PUSH_TO_VAR;
4965 s = zdc_parse_mem(inst, true, assign);
4968 case DC_LEX_LOAD_POP:
4969 dbg_lex("%s:%d LEX_OP_LOAD[_POP]", __func__, __LINE__);
4970 inst = t == DC_LEX_LOAD_POP ? DC_INST_PUSH_VAR : DC_INST_LOAD;
4971 s = zdc_parse_mem(inst, true, false);
4973 case DC_LEX_STORE_IBASE:
4974 case DC_LEX_STORE_SCALE:
4975 case DC_LEX_STORE_OBASE:
4976 dbg_lex("%s:%d LEX_OP_STORE_I/OBASE/SCALE", __func__, __LINE__);
4977 inst = t - DC_LEX_STORE_IBASE + XC_INST_IBASE;
4978 s = zdc_parse_mem(inst, false, true);
4981 dbg_lex_done("%s:%d done (bad token)", __func__, __LINE__);
4982 RETURN_STATUS(bc_error_bad_token());
4985 if (!s && get_token) s = zxc_lex_next();
4987 dbg_lex_done("%s:%d done", __func__, __LINE__);
4990 #define zdc_parse_token(...) (zdc_parse_token(__VA_ARGS__) COMMA_SUCCESS)
4992 static BC_STATUS zdc_parse_expr(void)
4994 BcParse *p = &G.prs;
4997 i = (int)p->lex - (int)XC_LEX_OP_POWER;
4999 BcInst inst = dc_LEX_to_INST[i];
5000 if (inst != DC_INST_INVALID) {
5001 xc_parse_push(inst);
5002 RETURN_STATUS(zxc_lex_next());
5005 RETURN_STATUS(zdc_parse_token(p->lex));
5007 #define zdc_parse_expr(...) (zdc_parse_expr(__VA_ARGS__) COMMA_SUCCESS)
5009 static BC_STATUS zdc_parse_exprs_until_eof(void)
5011 BcParse *p = &G.prs;
5012 dbg_lex_enter("%s:%d entered, p->lex:%d", __func__, __LINE__, p->lex);
5013 while (p->lex != XC_LEX_EOF) {
5014 BcStatus s = zdc_parse_expr();
5015 if (s) RETURN_STATUS(s);
5018 dbg_lex_done("%s:%d done", __func__, __LINE__);
5019 RETURN_STATUS(BC_STATUS_SUCCESS);
5021 #define zdc_parse_exprs_until_eof(...) (zdc_parse_exprs_until_eof(__VA_ARGS__) COMMA_SUCCESS)
5029 #define STACK_HAS_MORE_THAN(s, n) ((s)->len > ((size_t)(n)))
5030 #define STACK_HAS_EQUAL_OR_MORE_THAN(s, n) ((s)->len >= ((size_t)(n)))
5032 static BcVec* xc_program_search(char *id, bool var)
5039 v = var ? &G.prog.vars : &G.prog.arrs;
5040 map = var ? &G.prog.var_map : &G.prog.arr_map;
5044 new = bc_map_insert(map, &e, &i); // 1 if insertion was successful
5048 bc_array_init(&v2, var);
5049 bc_vec_push(v, &v2);
5052 ptr = bc_vec_item(map, i);
5053 if (new) ptr->name = xstrdup(e.name);
5054 return bc_vec_item(v, ptr->idx);
5057 // 'num' need not be initialized on entry
5058 static BC_STATUS zxc_program_num(BcResult *r, BcNum **num, bool hex)
5062 case XC_RESULT_TEMP:
5063 case XC_RESULT_IBASE:
5064 case XC_RESULT_SCALE:
5065 case XC_RESULT_OBASE:
5068 case XC_RESULT_CONSTANT: {
5074 str = *xc_program_const(r->d.id.idx);
5077 bc_num_init(&r->d.n, len);
5079 hex = hex && len == 1;
5080 base_t = hex ? 16 : G.prog.ib_t;
5081 s = zxc_num_parse(&r->d.n, str, base_t);
5083 bc_num_free(&r->d.n);
5087 r->t = XC_RESULT_TEMP;
5091 case XC_RESULT_ARRAY:
5092 case XC_RESULT_ARRAY_ELEM: {
5095 v = xc_program_search(r->d.id.name, r->t == XC_RESULT_VAR);
5097 if (r->t == XC_RESULT_ARRAY_ELEM) {
5099 if (v->len <= r->d.id.idx) bc_array_expand(v, r->d.id.idx + 1);
5100 *num = bc_vec_item(v, r->d.id.idx);
5102 *num = bc_vec_top(v);
5106 case BC_RESULT_LAST:
5107 *num = &G.prog.last;
5115 // Testing the theory that dc does not reach LAST/ONE
5116 bb_error_msg_and_die("BUG:%d", r->t);
5120 RETURN_STATUS(BC_STATUS_SUCCESS);
5122 #define zxc_program_num(...) (zxc_program_num(__VA_ARGS__) COMMA_SUCCESS)
5124 static BC_STATUS zxc_program_binOpPrep(BcResult **l, BcNum **ln,
5125 BcResult **r, BcNum **rn, bool assign)
5129 BcResultType lt, rt;
5131 if (!STACK_HAS_MORE_THAN(&G.prog.results, 1))
5132 RETURN_STATUS(bc_error_stack_has_too_few_elements());
5134 *r = bc_vec_item_rev(&G.prog.results, 0);
5135 *l = bc_vec_item_rev(&G.prog.results, 1);
5139 hex = assign && (lt == XC_RESULT_IBASE || lt == XC_RESULT_OBASE);
5141 s = zxc_program_num(*l, ln, false);
5142 if (s) RETURN_STATUS(s);
5143 s = zxc_program_num(*r, rn, hex);
5144 if (s) RETURN_STATUS(s);
5146 // We run this again under these conditions in case any vector has been
5147 // reallocated out from under the BcNums or arrays we had.
5148 if (lt == rt && (lt == XC_RESULT_VAR || lt == XC_RESULT_ARRAY_ELEM)) {
5149 s = zxc_program_num(*l, ln, false);
5150 if (s) RETURN_STATUS(s);
5153 if (!BC_PROG_NUM((*l), (*ln)) && (!assign || (*l)->t != XC_RESULT_VAR))
5154 RETURN_STATUS(bc_error_variable_is_wrong_type());
5155 if (!assign && !BC_PROG_NUM((*r), (*ln)))
5156 RETURN_STATUS(bc_error_variable_is_wrong_type());
5160 #define zxc_program_binOpPrep(...) (zxc_program_binOpPrep(__VA_ARGS__) COMMA_SUCCESS)
5162 static void xc_program_binOpRetire(BcResult *r)
5164 r->t = XC_RESULT_TEMP;
5165 bc_vec_pop(&G.prog.results);
5166 bc_result_pop_and_push(r);
5169 // Note: *r and *n need not be initialized by caller
5170 static BC_STATUS zxc_program_prep(BcResult **r, BcNum **n)
5174 if (!STACK_HAS_MORE_THAN(&G.prog.results, 0))
5175 RETURN_STATUS(bc_error_stack_has_too_few_elements());
5176 *r = bc_vec_top(&G.prog.results);
5178 s = zxc_program_num(*r, n, false);
5179 if (s) RETURN_STATUS(s);
5181 if (!BC_PROG_NUM((*r), (*n)))
5182 RETURN_STATUS(bc_error_variable_is_wrong_type());
5186 #define zxc_program_prep(...) (zxc_program_prep(__VA_ARGS__) COMMA_SUCCESS)
5188 static void xc_program_retire(BcResult *r, BcResultType t)
5191 bc_result_pop_and_push(r);
5194 static BC_STATUS zxc_program_op(char inst)
5197 BcResult *opd1, *opd2, res;
5200 s = zxc_program_binOpPrep(&opd1, &n1, &opd2, &n2, false);
5201 if (s) RETURN_STATUS(s);
5202 bc_num_init_DEF_SIZE(&res.d.n);
5204 s = BC_STATUS_SUCCESS;
5205 IF_ERROR_RETURN_POSSIBLE(s =) zxc_program_ops[inst - XC_INST_POWER](n1, n2, &res.d.n, G.prog.scale);
5207 xc_program_binOpRetire(&res);
5211 bc_num_free(&res.d.n);
5214 #define zxc_program_op(...) (zxc_program_op(__VA_ARGS__) COMMA_SUCCESS)
5216 static BC_STATUS zxc_program_read(void)
5224 bc_char_vec_init(&buf);
5225 xc_read_line(&buf, stdin);
5227 f = xc_program_func(BC_PROG_READ);
5228 bc_vec_pop_all(&f->code);
5230 sv_parse = G.prs; // struct copy
5231 xc_parse_create(BC_PROG_READ);
5232 //G.err_line = G.prs.lex_line = 1; - not needed, error line info is not printed for read()
5234 s = zxc_parse_text_init(buf.v);
5235 if (s) goto exec_err;
5237 IF_BC(s = zbc_parse_expr(0));
5239 IF_DC(s = zdc_parse_exprs_until_eof());
5241 if (s) goto exec_err;
5243 if (G.prs.lex != XC_LEX_NLINE && G.prs.lex != XC_LEX_EOF) {
5244 s = bc_error("bad read() expression");
5248 ip.func = BC_PROG_READ;
5250 IF_BC(ip.results_len_before_call = G.prog.results.len;)
5252 xc_parse_push(XC_INST_RET);
5253 bc_vec_push(&G.prog.exestack, &ip);
5257 G.prs = sv_parse; // struct copy
5261 #define zxc_program_read(...) (zxc_program_read(__VA_ARGS__) COMMA_SUCCESS)
5263 static size_t xc_program_index(char *code, size_t *bgn)
5265 unsigned char *bytes = (void*)(code + *bgn);
5271 if (amt < SMALL_INDEX_LIMIT) {
5275 amt -= SMALL_INDEX_LIMIT;
5280 for (i = 0; i < amt; i += 8)
5281 res |= (size_t)(*bytes++) << i;
5286 static char *xc_program_name(char *code, size_t *bgn)
5289 *bgn += strlen(code) + 1;
5291 return xstrdup(code);
5294 static void xc_program_printString(const char *str)
5298 // Example: echo '[]ap' | dc
5299 // should print two bytes: 0x00, 0x0A
5306 if (c != '\\' || !*str)
5326 G.prog.nchars = SIZE_MAX;
5338 // Just print the backslash and following character.
5349 static void bc_num_printNewline(void)
5351 if (G.prog.nchars == G.prog.len - 1) {
5359 static FAST_FUNC void dc_num_printChar(size_t num, size_t width, bool radix)
5362 bb_putchar((char) num);
5363 G.prog.nchars += width;
5367 static FAST_FUNC void bc_num_printDigits(size_t num, size_t width, bool radix)
5371 bc_num_printNewline();
5372 bb_putchar(radix ? '.' : ' ');
5375 bc_num_printNewline();
5376 for (exp = 0, pow = 1; exp < width - 1; ++exp, pow *= 10)
5379 for (exp = 0; exp < width; pow /= 10, ++G.prog.nchars, ++exp) {
5381 bc_num_printNewline();
5384 bb_putchar(((char) dig) + '0');
5388 static FAST_FUNC void bc_num_printHex(size_t num, size_t width, bool radix)
5391 bc_num_printNewline();
5396 bc_num_printNewline();
5397 bb_putchar(bb_hexdigits_upcase[num]);
5398 G.prog.nchars += width;
5401 static void bc_num_printDecimal(BcNum *n)
5403 size_t i, rdx = n->rdx - 1;
5410 for (i = n->len - 1; i < n->len; --i)
5411 bc_num_printHex((size_t) n->num[i], 1, i == rdx);
5414 typedef void (*BcNumDigitOp)(size_t, size_t, bool) FAST_FUNC;
5416 static BC_STATUS zxc_num_printNum(BcNum *n, unsigned base_t, size_t width, BcNumDigitOp print)
5421 BcDig base_digs[ULONG_NUM_BUFSIZE];
5422 BcNum intp, fracp, digit, frac_len;
5423 unsigned long dig, *ptr;
5428 print(0, width, false);
5429 RETURN_STATUS(BC_STATUS_SUCCESS);
5432 bc_vec_init(&stack, sizeof(long), NULL);
5433 bc_num_init(&intp, n->len);
5434 bc_num_init(&fracp, n->rdx);
5435 bc_num_init(&digit, width);
5436 bc_num_init(&frac_len, BC_NUM_INT(n));
5437 bc_num_copy(&intp, n);
5438 bc_num_one(&frac_len);
5439 base.cap = ARRAY_SIZE(base_digs);
5440 base.num = base_digs;
5441 bc_num_ulong2num(&base, base_t);
5443 bc_num_truncate(&intp, intp.rdx);
5444 s = zbc_num_sub(n, &intp, &fracp, 0);
5447 while (intp.len != 0) {
5448 s = zbc_num_divmod(&intp, &base, &intp, &digit, 0);
5450 s = zbc_num_ulong(&digit, &dig);
5452 bc_vec_push(&stack, &dig);
5455 for (i = 0; i < stack.len; ++i) {
5456 ptr = bc_vec_item_rev(&stack, i);
5457 print(*ptr, width, false);
5460 if (!n->rdx) goto err;
5462 for (radix = true; frac_len.len <= n->rdx; radix = false) {
5463 s = zbc_num_mul(&fracp, &base, &fracp, n->rdx);
5465 s = zbc_num_ulong(&fracp, &dig);
5467 bc_num_ulong2num(&intp, dig);
5468 s = zbc_num_sub(&fracp, &intp, &fracp, 0);
5470 print(dig, width, radix);
5471 s = zbc_num_mul(&frac_len, &base, &frac_len, 0);
5475 bc_num_free(&frac_len);
5476 bc_num_free(&digit);
5477 bc_num_free(&fracp);
5479 bc_vec_free(&stack);
5482 #define zxc_num_printNum(...) (zxc_num_printNum(__VA_ARGS__) COMMA_SUCCESS)
5484 static BC_STATUS zxc_num_printBase(BcNum *n)
5498 if (G.prog.ob_t <= BC_NUM_MAX_IBASE) {
5500 print = bc_num_printHex;
5502 unsigned i = G.prog.ob_t - 1;
5510 print = bc_num_printDigits;
5513 s = zxc_num_printNum(n, G.prog.ob_t, width, print);
5518 #define zxc_num_printBase(...) (zxc_num_printBase(__VA_ARGS__) COMMA_SUCCESS)
5520 static BC_STATUS zxc_num_print(BcNum *n, bool newline)
5522 BcStatus s = BC_STATUS_SUCCESS;
5524 bc_num_printNewline();
5529 } else if (G.prog.ob_t == 10)
5530 bc_num_printDecimal(n);
5532 s = zxc_num_printBase(n);
5541 #define zxc_num_print(...) (zxc_num_print(__VA_ARGS__) COMMA_SUCCESS)
5543 static BC_STATUS zxc_program_print(char inst, size_t idx)
5548 bool pop = (inst != XC_INST_PRINT);
5550 if (!STACK_HAS_MORE_THAN(&G.prog.results, idx))
5551 RETURN_STATUS(bc_error_stack_has_too_few_elements());
5553 r = bc_vec_item_rev(&G.prog.results, idx);
5554 s = zxc_program_num(r, &num, false);
5555 if (s) RETURN_STATUS(s);
5557 if (BC_PROG_NUM(r, num)) {
5558 s = zxc_num_print(num, !pop);
5560 if (!s && IS_BC) bc_num_copy(&G.prog.last, num);
5565 idx = (r->t == XC_RESULT_STR) ? r->d.id.idx : num->rdx;
5566 str = *xc_program_str(idx);
5568 if (inst == XC_INST_PRINT_STR) {
5571 if (c == '\0') break;
5574 if (c == '\n') G.prog.nchars = 0;
5577 xc_program_printString(str);
5578 if (inst == XC_INST_PRINT) bb_putchar('\n');
5582 if (!s && pop) bc_vec_pop(&G.prog.results);
5586 #define zxc_program_print(...) (zxc_program_print(__VA_ARGS__) COMMA_SUCCESS)
5588 static BC_STATUS zxc_program_negate(void)
5594 s = zxc_program_prep(&ptr, &num);
5595 if (s) RETURN_STATUS(s);
5597 bc_num_init(&res.d.n, num->len);
5598 bc_num_copy(&res.d.n, num);
5599 if (res.d.n.len) res.d.n.neg = !res.d.n.neg;
5601 xc_program_retire(&res, XC_RESULT_TEMP);
5605 #define zxc_program_negate(...) (zxc_program_negate(__VA_ARGS__) COMMA_SUCCESS)
5607 static BC_STATUS zxc_program_logical(char inst)
5610 BcResult *opd1, *opd2, res;
5614 s = zxc_program_binOpPrep(&opd1, &n1, &opd2, &n2, false);
5615 if (s) RETURN_STATUS(s);
5617 bc_num_init_DEF_SIZE(&res.d.n);
5619 if (inst == XC_INST_BOOL_AND)
5620 cond = bc_num_cmp(n1, &G.prog.zero) && bc_num_cmp(n2, &G.prog.zero);
5621 else if (inst == XC_INST_BOOL_OR)
5622 cond = bc_num_cmp(n1, &G.prog.zero) || bc_num_cmp(n2, &G.prog.zero);
5624 cond = bc_num_cmp(n1, n2);
5626 case XC_INST_REL_EQ:
5629 case XC_INST_REL_LE:
5632 case XC_INST_REL_GE:
5635 case XC_INST_REL_LT:
5638 case XC_INST_REL_GT:
5641 default: // = case XC_INST_REL_NE:
5642 //cond = (cond != 0); - not needed
5647 if (cond) bc_num_one(&res.d.n);
5648 //else bc_num_zero(&res.d.n); - already is
5650 xc_program_binOpRetire(&res);
5654 #define zxc_program_logical(...) (zxc_program_logical(__VA_ARGS__) COMMA_SUCCESS)
5657 static BC_STATUS zdc_program_assignStr(BcResult *r, BcVec *v, bool push)
5662 memset(&n2, 0, sizeof(BcNum));
5663 n2.rdx = res.d.id.idx = r->d.id.idx;
5664 res.t = XC_RESULT_STR;
5667 if (!STACK_HAS_MORE_THAN(&G.prog.results, 1))
5668 RETURN_STATUS(bc_error_stack_has_too_few_elements());
5670 bc_vec_pop(&G.prog.results);
5673 bc_result_pop_and_push(&res);
5674 bc_vec_push(v, &n2);
5676 RETURN_STATUS(BC_STATUS_SUCCESS);
5678 #define zdc_program_assignStr(...) (zdc_program_assignStr(__VA_ARGS__) COMMA_SUCCESS)
5681 static BC_STATUS zxc_program_copyToVar(char *name, bool var)
5688 if (!STACK_HAS_MORE_THAN(&G.prog.results, 0))
5689 RETURN_STATUS(bc_error_stack_has_too_few_elements());
5691 ptr = bc_vec_top(&G.prog.results);
5692 if ((ptr->t == XC_RESULT_ARRAY) != !var)
5693 RETURN_STATUS(bc_error_variable_is_wrong_type());
5694 v = xc_program_search(name, var);
5697 if (ptr->t == XC_RESULT_STR && !var)
5698 RETURN_STATUS(bc_error_variable_is_wrong_type());
5699 if (ptr->t == XC_RESULT_STR)
5700 RETURN_STATUS(zdc_program_assignStr(ptr, v, true));
5703 s = zxc_program_num(ptr, &n, false);
5704 if (s) RETURN_STATUS(s);
5706 // Do this once more to make sure that pointers were not invalidated.
5707 v = xc_program_search(name, var);
5710 bc_num_init_DEF_SIZE(&r.d.n);
5711 bc_num_copy(&r.d.n, n);
5713 bc_array_init(&r.d.v, true);
5714 bc_array_copy(&r.d.v, (BcVec *) n);
5717 bc_vec_push(v, &r.d);
5718 bc_vec_pop(&G.prog.results);
5722 #define zxc_program_copyToVar(...) (zxc_program_copyToVar(__VA_ARGS__) COMMA_SUCCESS)
5724 static BC_STATUS zxc_program_assign(char inst)
5727 BcResult *left, *right, res;
5729 bool assign = (inst == XC_INST_ASSIGN);
5732 s = zxc_program_binOpPrep(&left, &l, &right, &r, assign);
5733 if (s) RETURN_STATUS(s);
5735 ib = left->t == XC_RESULT_IBASE;
5736 sc = left->t == XC_RESULT_SCALE;
5739 if (right->t == XC_RESULT_STR) {
5742 if (left->t != XC_RESULT_VAR)
5743 RETURN_STATUS(bc_error_variable_is_wrong_type());
5744 v = xc_program_search(left->d.id.name, true);
5746 RETURN_STATUS(zdc_program_assignStr(right, v, false));
5750 if (left->t == XC_RESULT_CONSTANT || left->t == XC_RESULT_TEMP)
5751 RETURN_STATUS(bc_error("bad assignment:"
5752 " left side must be variable"
5754 )); // note: shared string
5757 if (inst == BC_INST_ASSIGN_DIVIDE && !bc_num_cmp(r, &G.prog.zero))
5758 RETURN_STATUS(bc_error("divide by zero"));
5763 s = BC_STATUS_SUCCESS;
5764 IF_ERROR_RETURN_POSSIBLE(s =) zxc_program_ops[inst - BC_INST_ASSIGN_POWER](l, r, l, G.prog.scale);
5766 if (s) RETURN_STATUS(s);
5771 if (ib || sc || left->t == XC_RESULT_OBASE) {
5772 static const char *const msg[] = {
5773 "bad ibase; must be [2,16]", //XC_RESULT_IBASE
5774 "bad obase; must be [2,"BC_MAX_OBASE_STR"]", //XC_RESULT_OBASE
5775 "bad scale; must be [0,"BC_MAX_SCALE_STR"]", //XC_RESULT_SCALE
5781 s = zbc_num_ulong(l, &val);
5782 if (s) RETURN_STATUS(s);
5783 s = left->t - XC_RESULT_IBASE;
5786 ptr = &G.prog.scale;
5789 RETURN_STATUS(bc_error(msg[s]));
5790 max = ib ? BC_NUM_MAX_IBASE : BC_MAX_OBASE;
5791 ptr = ib ? &G.prog.ib_t : &G.prog.ob_t;
5795 RETURN_STATUS(bc_error(msg[s]));
5797 *ptr = (size_t) val;
5798 s = BC_STATUS_SUCCESS;
5801 bc_num_init(&res.d.n, l->len);
5802 bc_num_copy(&res.d.n, l);
5803 xc_program_binOpRetire(&res);
5807 #define zxc_program_assign(...) (zxc_program_assign(__VA_ARGS__) COMMA_SUCCESS)
5810 #define xc_program_pushVar(code, bgn, pop, copy) \
5811 xc_program_pushVar(code, bgn)
5812 // for bc, 'pop' and 'copy' are always false
5814 static BC_STATUS xc_program_pushVar(char *code, size_t *bgn,
5815 bool pop, bool copy)
5818 char *name = xc_program_name(code, bgn);
5820 r.t = XC_RESULT_VAR;
5825 BcVec *v = xc_program_search(name, true);
5826 BcNum *num = bc_vec_top(v);
5829 if (!STACK_HAS_MORE_THAN(v, 1 - copy)) {
5830 RETURN_STATUS(bc_error_stack_has_too_few_elements());
5833 if (!BC_PROG_STR(num)) {
5834 r.t = XC_RESULT_TEMP;
5835 bc_num_init_DEF_SIZE(&r.d.n);
5836 bc_num_copy(&r.d.n, num);
5838 r.t = XC_RESULT_STR;
5839 r.d.id.idx = num->rdx;
5842 if (!copy) bc_vec_pop(v);
5846 bc_vec_push(&G.prog.results, &r);
5848 RETURN_STATUS(BC_STATUS_SUCCESS);
5850 #define zxc_program_pushVar(...) (xc_program_pushVar(__VA_ARGS__) COMMA_SUCCESS)
5852 static BC_STATUS zbc_program_pushArray(char *code, size_t *bgn, char inst)
5854 BcStatus s = BC_STATUS_SUCCESS;
5858 r.d.id.name = xc_program_name(code, bgn);
5860 if (inst == XC_INST_ARRAY) {
5861 r.t = XC_RESULT_ARRAY;
5862 bc_vec_push(&G.prog.results, &r);
5867 s = zxc_program_prep(&operand, &num);
5869 s = zbc_num_ulong(num, &temp);
5872 if (temp > BC_MAX_DIM) {
5873 s = bc_error("array too long; must be [1,"BC_MAX_DIM_STR"]");
5877 r.d.id.idx = (size_t) temp;
5878 xc_program_retire(&r, XC_RESULT_ARRAY_ELEM);
5881 if (s) free(r.d.id.name);
5884 #define zbc_program_pushArray(...) (zbc_program_pushArray(__VA_ARGS__) COMMA_SUCCESS)
5887 static BC_STATUS zbc_program_incdec(char inst)
5890 BcResult *ptr, res, copy;
5894 s = zxc_program_prep(&ptr, &num);
5895 if (s) RETURN_STATUS(s);
5897 if (inst == BC_INST_INC_POST || inst == BC_INST_DEC_POST) {
5898 copy.t = XC_RESULT_TEMP;
5899 bc_num_init(©.d.n, num->len);
5900 bc_num_copy(©.d.n, num);
5903 res.t = BC_RESULT_ONE;
5904 inst = (inst == BC_INST_INC_PRE || inst == BC_INST_INC_POST)
5905 ? BC_INST_ASSIGN_PLUS
5906 : BC_INST_ASSIGN_MINUS;
5908 bc_vec_push(&G.prog.results, &res);
5909 s = zxc_program_assign(inst);
5910 if (s) RETURN_STATUS(s);
5912 if (inst2 == BC_INST_INC_POST || inst2 == BC_INST_DEC_POST) {
5913 bc_result_pop_and_push(©);
5918 #define zbc_program_incdec(...) (zbc_program_incdec(__VA_ARGS__) COMMA_SUCCESS)
5920 static BC_STATUS zbc_program_call(char *code, size_t *idx)
5928 nparams = xc_program_index(code, idx);
5930 ip.func = xc_program_index(code, idx);
5931 func = xc_program_func(ip.func);
5933 if (func->code.len == 0) {
5934 RETURN_STATUS(bc_error("undefined function"));
5936 if (nparams != func->nparams) {
5937 RETURN_STATUS(bc_error_fmt("function has %u parameters, but called with %u", func->nparams, nparams));
5939 ip.results_len_before_call = G.prog.results.len - nparams;
5941 for (i = 0; i < nparams; ++i) {
5944 a = bc_vec_item(&func->autos, nparams - 1 - i);
5945 arg = bc_vec_top(&G.prog.results);
5947 if ((!a->idx) != (arg->t == XC_RESULT_ARRAY) || arg->t == XC_RESULT_STR)
5948 RETURN_STATUS(bc_error_variable_is_wrong_type());
5950 s = zxc_program_copyToVar(a->name, a->idx);
5951 if (s) RETURN_STATUS(s);
5954 a = bc_vec_item(&func->autos, i);
5955 for (; i < func->autos.len; i++, a++) {
5958 v = xc_program_search(a->name, a->idx);
5961 bc_num_init_DEF_SIZE(&n2);
5962 bc_vec_push(v, &n2);
5965 bc_array_init(&v2, true);
5966 bc_vec_push(v, &v2);
5970 bc_vec_push(&G.prog.exestack, &ip);
5972 RETURN_STATUS(BC_STATUS_SUCCESS);
5974 #define zbc_program_call(...) (zbc_program_call(__VA_ARGS__) COMMA_SUCCESS)
5976 static BC_STATUS zbc_program_return(char inst)
5982 BcInstPtr *ip = bc_vec_top(&G.prog.exestack);
5984 if (!STACK_HAS_EQUAL_OR_MORE_THAN(&G.prog.results, ip->results_len_before_call + (inst == XC_INST_RET)))
5985 RETURN_STATUS(bc_error_stack_has_too_few_elements());
5987 f = xc_program_func(ip->func);
5988 res.t = XC_RESULT_TEMP;
5990 if (inst == XC_INST_RET) {
5993 BcResult *operand = bc_vec_top(&G.prog.results);
5995 s = zxc_program_num(operand, &num, false);
5996 if (s) RETURN_STATUS(s);
5997 bc_num_init(&res.d.n, num->len);
5998 bc_num_copy(&res.d.n, num);
6000 bc_num_init_DEF_SIZE(&res.d.n);
6001 //bc_num_zero(&res.d.n); - already is
6004 // We need to pop arguments as well, so this takes that into account.
6005 a = (void*)f->autos.v;
6006 for (i = 0; i < f->autos.len; i++, a++) {
6008 v = xc_program_search(a->name, a->idx);
6012 bc_vec_npop(&G.prog.results, G.prog.results.len - ip->results_len_before_call);
6013 bc_vec_push(&G.prog.results, &res);
6014 bc_vec_pop(&G.prog.exestack);
6016 RETURN_STATUS(BC_STATUS_SUCCESS);
6018 #define zbc_program_return(...) (zbc_program_return(__VA_ARGS__) COMMA_SUCCESS)
6021 static unsigned long xc_program_scale(BcNum *n)
6023 return (unsigned long) n->rdx;
6026 static unsigned long xc_program_len(BcNum *n)
6028 size_t len = n->len;
6030 if (n->rdx != len) return len;
6032 if (len == 0) break;
6034 if (n->num[len] != 0) break;
6039 static BC_STATUS zxc_program_builtin(char inst)
6045 bool len = (inst == XC_INST_LENGTH);
6047 if (!STACK_HAS_MORE_THAN(&G.prog.results, 0))
6048 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6049 opnd = bc_vec_top(&G.prog.results);
6051 s = zxc_program_num(opnd, &num, false);
6052 if (s) RETURN_STATUS(s);
6055 if (!BC_PROG_NUM(opnd, num) && !len)
6056 RETURN_STATUS(bc_error_variable_is_wrong_type());
6059 bc_num_init_DEF_SIZE(&res.d.n);
6061 if (inst == XC_INST_SQRT)
6062 s = zbc_num_sqrt(num, &res.d.n, G.prog.scale);
6064 else if (len != 0 && opnd->t == XC_RESULT_ARRAY) {
6065 bc_num_ulong2num(&res.d.n, (unsigned long) ((BcVec *) num)->len);
6069 else if (len != 0 && !BC_PROG_NUM(opnd, num)) {
6071 size_t idx = opnd->t == XC_RESULT_STR ? opnd->d.id.idx : num->rdx;
6073 str = xc_program_str(idx);
6074 bc_num_ulong2num(&res.d.n, strlen(*str));
6078 bc_num_ulong2num(&res.d.n, len ? xc_program_len(num) : xc_program_scale(num));
6081 xc_program_retire(&res, XC_RESULT_TEMP);
6085 #define zxc_program_builtin(...) (zxc_program_builtin(__VA_ARGS__) COMMA_SUCCESS)
6088 static BC_STATUS zdc_program_divmod(void)
6091 BcResult *opd1, *opd2, res, res2;
6094 s = zxc_program_binOpPrep(&opd1, &n1, &opd2, &n2, false);
6095 if (s) RETURN_STATUS(s);
6097 bc_num_init_DEF_SIZE(&res.d.n);
6098 bc_num_init(&res2.d.n, n2->len);
6100 s = zbc_num_divmod(n1, n2, &res2.d.n, &res.d.n, G.prog.scale);
6103 xc_program_binOpRetire(&res2);
6104 res.t = XC_RESULT_TEMP;
6105 bc_vec_push(&G.prog.results, &res);
6109 bc_num_free(&res2.d.n);
6110 bc_num_free(&res.d.n);
6113 #define zdc_program_divmod(...) (zdc_program_divmod(__VA_ARGS__) COMMA_SUCCESS)
6115 static BC_STATUS zdc_program_modexp(void)
6118 BcResult *r1, *r2, *r3, res;
6119 BcNum *n1, *n2, *n3;
6121 if (!STACK_HAS_MORE_THAN(&G.prog.results, 2))
6122 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6123 s = zxc_program_binOpPrep(&r2, &n2, &r3, &n3, false);
6124 if (s) RETURN_STATUS(s);
6126 r1 = bc_vec_item_rev(&G.prog.results, 2);
6127 s = zxc_program_num(r1, &n1, false);
6128 if (s) RETURN_STATUS(s);
6129 if (!BC_PROG_NUM(r1, n1))
6130 RETURN_STATUS(bc_error_variable_is_wrong_type());
6132 // Make sure that the values have their pointers updated, if necessary.
6133 if (r1->t == XC_RESULT_VAR || r1->t == XC_RESULT_ARRAY_ELEM) {
6134 if (r1->t == r2->t) {
6135 s = zxc_program_num(r2, &n2, false);
6136 if (s) RETURN_STATUS(s);
6138 if (r1->t == r3->t) {
6139 s = zxc_program_num(r3, &n3, false);
6140 if (s) RETURN_STATUS(s);
6144 bc_num_init(&res.d.n, n3->len);
6145 s = zdc_num_modexp(n1, n2, n3, &res.d.n);
6148 bc_vec_pop(&G.prog.results);
6149 xc_program_binOpRetire(&res);
6153 bc_num_free(&res.d.n);
6156 #define zdc_program_modexp(...) (zdc_program_modexp(__VA_ARGS__) COMMA_SUCCESS)
6158 static void dc_program_stackLen(void)
6161 size_t len = G.prog.results.len;
6163 res.t = XC_RESULT_TEMP;
6165 bc_num_init_DEF_SIZE(&res.d.n);
6166 bc_num_ulong2num(&res.d.n, len);
6167 bc_vec_push(&G.prog.results, &res);
6170 static BC_STATUS zdc_program_asciify(void)
6180 if (!STACK_HAS_MORE_THAN(&G.prog.results, 0))
6181 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6182 r = bc_vec_top(&G.prog.results);
6184 s = zxc_program_num(r, &num, false);
6185 if (s) RETURN_STATUS(s);
6187 if (BC_PROG_NUM(r, num)) {
6190 BcDig strmb_digs[ULONG_NUM_BUFSIZE];
6192 bc_num_init_DEF_SIZE(&n);
6193 bc_num_copy(&n, num);
6194 bc_num_truncate(&n, n.rdx);
6196 strmb.cap = ARRAY_SIZE(strmb_digs);
6197 strmb.num = strmb_digs;
6198 bc_num_ulong2num(&strmb, 0x100);
6199 s = zbc_num_mod(&n, &strmb, &n, 0);
6201 if (s) goto num_err;
6202 s = zbc_num_ulong(&n, &val);
6203 if (s) goto num_err;
6210 idx = (r->t == XC_RESULT_STR) ? r->d.id.idx : num->rdx;
6211 sp = *xc_program_str(idx);
6215 strs = (void*)G.prog.strs.v;
6216 for (idx = 0; idx < G.prog.strs.len; idx++) {
6217 if (strs[idx][0] == c && strs[idx][1] == '\0') {
6223 //str[1] = '\0'; - already is
6224 bc_vec_push(&G.prog.strs, &str);
6226 res.t = XC_RESULT_STR;
6228 bc_result_pop_and_push(&res);
6230 RETURN_STATUS(BC_STATUS_SUCCESS);
6235 #define zdc_program_asciify(...) (zdc_program_asciify(__VA_ARGS__) COMMA_SUCCESS)
6237 static BC_STATUS zdc_program_printStream(void)
6244 if (!STACK_HAS_MORE_THAN(&G.prog.results, 0))
6245 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6246 r = bc_vec_top(&G.prog.results);
6248 s = zxc_program_num(r, &n, false);
6249 if (s) RETURN_STATUS(s);
6251 if (BC_PROG_NUM(r, n)) {
6252 s = zxc_num_printNum(n, 0x100, 1, dc_num_printChar);
6255 idx = (r->t == XC_RESULT_STR) ? r->d.id.idx : n->rdx;
6256 str = *xc_program_str(idx);
6262 #define zdc_program_printStream(...) (zdc_program_printStream(__VA_ARGS__) COMMA_SUCCESS)
6264 static BC_STATUS zdc_program_nquit(void)
6271 s = zxc_program_prep(&opnd, &num);
6272 if (s) RETURN_STATUS(s);
6273 s = zbc_num_ulong(num, &val);
6274 if (s) RETURN_STATUS(s);
6276 bc_vec_pop(&G.prog.results);
6278 if (G.prog.exestack.len < val)
6279 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6280 if (G.prog.exestack.len == val) {
6281 QUIT_OR_RETURN_TO_MAIN;
6284 bc_vec_npop(&G.prog.exestack, val);
6288 #define zdc_program_nquit(...) (zdc_program_nquit(__VA_ARGS__) COMMA_SUCCESS)
6290 static BC_STATUS zdc_program_execStr(char *code, size_t *bgn, bool cond)
6292 BcStatus s = BC_STATUS_SUCCESS;
6298 if (!STACK_HAS_MORE_THAN(&G.prog.results, 0))
6299 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6301 r = bc_vec_top(&G.prog.results);
6304 BcNum *n = n; // for compiler
6307 char *then_name = xc_program_name(code, bgn);
6308 char *else_name = NULL;
6310 if (code[*bgn] == '\0')
6313 else_name = xc_program_name(code, bgn);
6315 exec = r->d.n.len != 0;
6317 if (!exec && else_name != NULL) {
6324 v = xc_program_search(name, true);
6331 if (!exec) goto exit;
6332 if (!BC_PROG_STR(n)) {
6333 s = bc_error_variable_is_wrong_type();
6339 if (r->t == XC_RESULT_STR) {
6341 } else if (r->t == XC_RESULT_VAR) {
6343 s = zxc_program_num(r, &n, false);
6344 if (s || !BC_PROG_STR(n)) goto exit;
6350 fidx = sidx + BC_PROG_REQ_FUNCS;
6352 f = xc_program_func(fidx);
6354 if (f->code.len == 0) {
6358 sv_parse = G.prs; // struct copy
6359 xc_parse_create(fidx);
6360 str = *xc_program_str(sidx);
6361 s = zxc_parse_text_init(str);
6364 s = zdc_parse_exprs_until_eof();
6366 xc_parse_push(DC_INST_POP_EXEC);
6367 if (G.prs.lex != XC_LEX_EOF)
6368 s = bc_error_bad_expression();
6370 G.prs = sv_parse; // struct copy
6373 bc_vec_pop_all(&f->code);
6381 bc_vec_pop(&G.prog.results);
6382 bc_vec_push(&G.prog.exestack, &ip);
6384 RETURN_STATUS(BC_STATUS_SUCCESS);
6386 bc_vec_pop(&G.prog.results);
6389 #define zdc_program_execStr(...) (zdc_program_execStr(__VA_ARGS__) COMMA_SUCCESS)
6392 static void xc_program_pushGlobal(char inst)
6397 res.t = inst - XC_INST_IBASE + XC_RESULT_IBASE;
6398 if (inst == XC_INST_IBASE)
6399 val = (unsigned long) G.prog.ib_t;
6400 else if (inst == XC_INST_SCALE)
6401 val = (unsigned long) G.prog.scale;
6403 val = (unsigned long) G.prog.ob_t;
6405 bc_num_init_DEF_SIZE(&res.d.n);
6406 bc_num_ulong2num(&res.d.n, val);
6407 bc_vec_push(&G.prog.results, &res);
6410 static BC_STATUS zxc_program_exec(void)
6413 BcInstPtr *ip = bc_vec_top(&G.prog.exestack);
6414 BcFunc *func = xc_program_func(ip->func);
6415 char *code = func->code.v;
6417 dbg_exec("func:%zd bytes:%zd ip:%zd results.len:%d",
6418 ip->func, func->code.len, ip->inst_idx, G.prog.results.len);
6419 while (ip->inst_idx < func->code.len) {
6420 BcStatus s = BC_STATUS_SUCCESS;
6421 char inst = code[ip->inst_idx++];
6423 dbg_exec("inst at %zd:%d results.len:%d", ip->inst_idx - 1, inst, G.prog.results.len);
6426 case BC_INST_JUMP_ZERO: {
6429 dbg_exec("BC_INST_JUMP_ZERO:");
6430 s = zxc_program_prep(&ptr, &num);
6431 if (s) RETURN_STATUS(s);
6432 zero = (bc_num_cmp(num, &G.prog.zero) == 0);
6433 bc_vec_pop(&G.prog.results);
6435 xc_program_index(code, &ip->inst_idx);
6438 // else: fall through
6440 case BC_INST_JUMP: {
6441 size_t idx = xc_program_index(code, &ip->inst_idx);
6442 size_t *addr = bc_vec_item(&func->labels, idx);
6443 dbg_exec("BC_INST_JUMP: to %ld", (long)*addr);
6444 ip->inst_idx = *addr;
6448 dbg_exec("BC_INST_CALL:");
6449 s = zbc_program_call(code, &ip->inst_idx);
6450 goto read_updated_ip;
6451 case BC_INST_INC_PRE:
6452 case BC_INST_DEC_PRE:
6453 case BC_INST_INC_POST:
6454 case BC_INST_DEC_POST:
6455 dbg_exec("BC_INST_INCDEC:");
6456 s = zbc_program_incdec(inst);
6459 dbg_exec("BC_INST_HALT:");
6460 QUIT_OR_RETURN_TO_MAIN;
6464 dbg_exec("BC_INST_RET[0]:");
6465 s = zbc_program_return(inst);
6466 goto read_updated_ip;
6467 case XC_INST_BOOL_OR:
6468 case XC_INST_BOOL_AND:
6470 case XC_INST_REL_EQ:
6471 case XC_INST_REL_LE:
6472 case XC_INST_REL_GE:
6473 case XC_INST_REL_NE:
6474 case XC_INST_REL_LT:
6475 case XC_INST_REL_GT:
6476 dbg_exec("BC_INST_BOOL:");
6477 s = zxc_program_logical(inst);
6480 dbg_exec("XC_INST_READ:");
6481 s = zxc_program_read();
6482 goto read_updated_ip;
6484 dbg_exec("XC_INST_VAR:");
6485 s = zxc_program_pushVar(code, &ip->inst_idx, false, false);
6487 case XC_INST_ARRAY_ELEM:
6489 dbg_exec("XC_INST_ARRAY[_ELEM]:");
6490 s = zbc_program_pushArray(code, &ip->inst_idx, inst);
6494 dbg_exec("BC_INST_LAST:");
6495 r.t = BC_RESULT_LAST;
6496 bc_vec_push(&G.prog.results, &r);
6502 dbg_exec("XC_INST_internalvar(%d):", inst - XC_INST_IBASE);
6503 xc_program_pushGlobal(inst);
6505 case XC_INST_SCALE_FUNC:
6506 case XC_INST_LENGTH:
6508 dbg_exec("BC_INST_builtin:");
6509 s = zxc_program_builtin(inst);
6512 dbg_exec("XC_INST_NUM:");
6513 r.t = XC_RESULT_CONSTANT;
6514 r.d.id.idx = xc_program_index(code, &ip->inst_idx);
6515 bc_vec_push(&G.prog.results, &r);
6518 dbg_exec("XC_INST_POP:");
6519 if (!STACK_HAS_MORE_THAN(&G.prog.results, 0))
6520 s = bc_error_stack_has_too_few_elements();
6522 bc_vec_pop(&G.prog.results);
6525 case XC_INST_PRINT_POP:
6526 case XC_INST_PRINT_STR:
6527 dbg_exec("XC_INST_PRINTxyz:");
6528 s = zxc_program_print(inst, 0);
6531 dbg_exec("XC_INST_STR:");
6532 r.t = XC_RESULT_STR;
6533 r.d.id.idx = xc_program_index(code, &ip->inst_idx);
6534 bc_vec_push(&G.prog.results, &r);
6537 case XC_INST_MULTIPLY:
6538 case XC_INST_DIVIDE:
6539 case XC_INST_MODULUS:
6542 dbg_exec("BC_INST_binaryop:");
6543 s = zxc_program_op(inst);
6545 case XC_INST_BOOL_NOT: {
6547 dbg_exec("XC_INST_BOOL_NOT:");
6548 s = zxc_program_prep(&ptr, &num);
6549 if (s) RETURN_STATUS(s);
6550 bc_num_init_DEF_SIZE(&r.d.n);
6551 if (bc_num_cmp(num, &G.prog.zero) == 0)
6553 //else bc_num_zero(&r.d.n); - already is
6554 xc_program_retire(&r, XC_RESULT_TEMP);
6558 dbg_exec("XC_INST_NEG:");
6559 s = zxc_program_negate();
6562 case BC_INST_ASSIGN_POWER:
6563 case BC_INST_ASSIGN_MULTIPLY:
6564 case BC_INST_ASSIGN_DIVIDE:
6565 case BC_INST_ASSIGN_MODULUS:
6566 case BC_INST_ASSIGN_PLUS:
6567 case BC_INST_ASSIGN_MINUS:
6569 case XC_INST_ASSIGN:
6570 dbg_exec("BC_INST_ASSIGNxyz:");
6571 s = zxc_program_assign(inst);
6574 case DC_INST_POP_EXEC:
6575 dbg_exec("DC_INST_POP_EXEC:");
6576 bc_vec_pop(&G.prog.exestack);
6577 goto read_updated_ip;
6578 case DC_INST_MODEXP:
6579 dbg_exec("DC_INST_MODEXP:");
6580 s = zdc_program_modexp();
6582 case DC_INST_DIVMOD:
6583 dbg_exec("DC_INST_DIVMOD:");
6584 s = zdc_program_divmod();
6586 case DC_INST_EXECUTE:
6587 case DC_INST_EXEC_COND:
6588 dbg_exec("DC_INST_EXEC[_COND]:");
6589 s = zdc_program_execStr(code, &ip->inst_idx, inst == DC_INST_EXEC_COND);
6590 goto read_updated_ip;
6591 case DC_INST_PRINT_STACK: {
6593 dbg_exec("DC_INST_PRINT_STACK:");
6594 for (idx = 0; idx < G.prog.results.len; ++idx) {
6595 s = zxc_program_print(XC_INST_PRINT, idx);
6600 case DC_INST_CLEAR_STACK:
6601 dbg_exec("DC_INST_CLEAR_STACK:");
6602 bc_vec_pop_all(&G.prog.results);
6604 case DC_INST_STACK_LEN:
6605 dbg_exec("DC_INST_STACK_LEN:");
6606 dc_program_stackLen();
6608 case DC_INST_DUPLICATE:
6609 dbg_exec("DC_INST_DUPLICATE:");
6610 if (!STACK_HAS_MORE_THAN(&G.prog.results, 0))
6611 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6612 ptr = bc_vec_top(&G.prog.results);
6613 dc_result_copy(&r, ptr);
6614 bc_vec_push(&G.prog.results, &r);
6616 case DC_INST_SWAP: {
6618 dbg_exec("DC_INST_SWAP:");
6619 if (!STACK_HAS_MORE_THAN(&G.prog.results, 1))
6620 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6621 ptr = bc_vec_item_rev(&G.prog.results, 0);
6622 ptr2 = bc_vec_item_rev(&G.prog.results, 1);
6623 memcpy(&r, ptr, sizeof(BcResult));
6624 memcpy(ptr, ptr2, sizeof(BcResult));
6625 memcpy(ptr2, &r, sizeof(BcResult));
6628 case DC_INST_ASCIIFY:
6629 dbg_exec("DC_INST_ASCIIFY:");
6630 s = zdc_program_asciify();
6632 case DC_INST_PRINT_STREAM:
6633 dbg_exec("DC_INST_PRINT_STREAM:");
6634 s = zdc_program_printStream();
6637 case DC_INST_PUSH_VAR: {
6638 bool copy = inst == DC_INST_LOAD;
6639 s = zxc_program_pushVar(code, &ip->inst_idx, true, copy);
6642 case DC_INST_PUSH_TO_VAR: {
6643 char *name = xc_program_name(code, &ip->inst_idx);
6644 s = zxc_program_copyToVar(name, true);
6649 dbg_exec("DC_INST_QUIT:");
6650 if (G.prog.exestack.len <= 2)
6651 QUIT_OR_RETURN_TO_MAIN;
6652 bc_vec_npop(&G.prog.exestack, 2);
6653 goto read_updated_ip;
6655 dbg_exec("DC_INST_NQUIT:");
6656 s = zdc_program_nquit();
6657 //goto read_updated_ip; - just fall through to it
6660 // Instruction stack has changed, read new pointers
6661 ip = bc_vec_top(&G.prog.exestack);
6662 func = xc_program_func(ip->func);
6663 code = func->code.v;
6664 dbg_exec("func:%zd bytes:%zd ip:%zd", ip->func, func->code.len, ip->inst_idx);
6667 if (s || G_interrupt) {
6675 RETURN_STATUS(BC_STATUS_SUCCESS);
6677 #define zxc_program_exec(...) (zxc_program_exec(__VA_ARGS__) COMMA_SUCCESS)
6679 static unsigned xc_vm_envLen(const char *var)
6685 len = BC_NUM_PRINT_WIDTH;
6686 if (!lenv) return len;
6688 len = bb_strtou(lenv, NULL, 10) - 1;
6689 if (errno || len < 2 || len >= INT_MAX)
6690 len = BC_NUM_PRINT_WIDTH;
6695 static BC_STATUS zxc_vm_process(const char *text)
6699 dbg_lex_enter("%s:%d entered", __func__, __LINE__);
6700 s = zxc_parse_text_init(text); // does the first zxc_lex_next()
6701 if (s) RETURN_STATUS(s);
6704 while (G.prs.lex != XC_LEX_EOF) {
6708 dbg_lex("%s:%d G.prs.lex:%d, parsing...", __func__, __LINE__, G.prs.lex);
6711 if (G.prs.lex == BC_LEX_SCOLON
6712 || G.prs.lex == XC_LEX_NLINE
6719 s = zbc_parse_stmt_or_funcdef();
6722 // Check that next token is a correct stmt delimiter -
6723 // disallows "print 1 print 2" and such.
6724 if (G.prs.lex != BC_LEX_SCOLON
6725 && G.prs.lex != XC_LEX_NLINE
6726 && G.prs.lex != XC_LEX_EOF
6729 //TODO: commonalize for other parse errors:
6730 err_at = G.prs.lex_next_at ? G.prs.lex_next_at : "UNKNOWN";
6731 bc_error_fmt("bad statement terminator at '%.*s'",
6732 (int)(strchrnul(err_at, '\n') - err_at),
6737 // The above logic is fragile. Check these examples:
6738 // - interactive read() still works
6742 // Most of dc parsing assumes all whitespace,
6743 // including '\n', is eaten.
6744 while (G.prs.lex == XC_LEX_NLINE) {
6747 if (G.prs.lex == XC_LEX_EOF)
6750 s = zdc_parse_expr();
6753 if (s || G_interrupt) {
6755 xc_parse_reset(); // includes xc_program_reset()
6756 RETURN_STATUS(BC_STATUS_FAILURE);
6759 dbg_lex("%s:%d executing...", __func__, __LINE__);
6760 s = zxc_program_exec();
6766 ip = (void*)G.prog.exestack.v;
6768 if (G.prog.exestack.len != 1) // should have only main's IP
6769 bb_error_msg_and_die("BUG:call stack");
6770 if (ip->func != BC_PROG_MAIN)
6771 bb_error_msg_and_die("BUG:not MAIN");
6773 f = xc_program_func_BC_PROG_MAIN();
6774 // bc discards strings, constants and code after each
6775 // top-level statement in the "main program".
6776 // This prevents "yes 1 | bc" from growing its memory
6777 // without bound. This can be done because data stack
6778 // is empty and thus can't hold any references to
6779 // strings or constants, there is no generated code
6780 // which can hold references (after we discard one
6781 // we just executed). Code of functions can have references,
6782 // but bc stores function strings/constants in per-function
6786 if (G.prog.results.len != 0) // should be empty
6787 bb_error_msg_and_die("BUG:data stack");
6789 IF_BC(bc_vec_pop_all(&f->strs);)
6790 IF_BC(bc_vec_pop_all(&f->consts);)
6792 if (G.prog.results.len == 0
6793 && G.prog.vars.len == 0
6795 // If stack is empty and no registers exist (TODO: or they are all empty),
6796 // we can get rid of accumulated strings and constants.
6797 // In this example dc process should not grow
6798 // its memory consumption with time:
6800 IF_DC(bc_vec_pop_all(&G.prog.strs);)
6801 IF_DC(bc_vec_pop_all(&G.prog.consts);)
6803 // The code is discarded always (below), thus this example
6804 // should also not grow its memory consumption with time,
6805 // even though its data stack is not empty:
6806 // { echo 1; yes dk; } | dc
6808 // We drop generated and executed code for both bc and dc:
6809 bc_vec_pop_all(&f->code);
6813 dbg_lex_done("%s:%d done", __func__, __LINE__);
6816 #define zxc_vm_process(...) (zxc_vm_process(__VA_ARGS__) COMMA_SUCCESS)
6818 static BC_STATUS zxc_vm_execute_FILE(FILE *fp, const char *filename)
6820 // So far bc/dc have no way to include a file from another file,
6821 // therefore we know G.prs.lex_filename == NULL on entry
6822 //const char *sv_file;
6825 G.prs.lex_filename = filename;
6826 G.prs.lex_input_fp = fp;
6827 G.err_line = G.prs.lex_line = 1;
6830 s = zxc_vm_process("");
6831 // We do not stop looping on errors here if reading stdin.
6832 // Example: start interactive bc and enter "return".
6833 // It should say "'return' not in a function"
6834 // but should not exit.
6835 } while (G.prs.lex_input_fp == stdin);
6836 G.prs.lex_filename = NULL;
6839 #define zxc_vm_execute_FILE(...) (zxc_vm_execute_FILE(__VA_ARGS__) COMMA_SUCCESS)
6841 static BC_STATUS zxc_vm_file(const char *file)
6846 fp = xfopen_for_read(file);
6847 s = zxc_vm_execute_FILE(fp, file);
6852 #define zxc_vm_file(...) (zxc_vm_file(__VA_ARGS__) COMMA_SUCCESS)
6855 static void bc_vm_info(void)
6857 printf("%s "BB_VER"\n"
6858 "Adapted from https://github.com/gavinhoward/bc\n"
6859 "Original code (c) 2018 Gavin D. Howard and contributors\n"
6863 static void bc_args(char **argv)
6869 #if ENABLE_FEATURE_BC_LONG_OPTIONS
6870 opts = option_mask32 |= getopt32long(argv, "wvsqli",
6871 "warn\0" No_argument "w"
6872 "version\0" No_argument "v"
6873 "standard\0" No_argument "s"
6874 "quiet\0" No_argument "q"
6875 "mathlib\0" No_argument "l"
6876 "interactive\0" No_argument "i"
6879 opts = option_mask32 |= getopt32(argv, "wvsqli");
6881 if (getenv("POSIXLY_CORRECT"))
6882 option_mask32 |= BC_FLAG_S;
6884 if (opts & BC_FLAG_V) {
6889 for (i = optind; argv[i]; ++i)
6890 bc_vec_push(&G.files, argv + i);
6893 static void bc_vm_envArgs(void)
6897 char *env_args = getenv("BC_ENV_ARGS");
6899 if (!env_args) return;
6901 G.env_args = xstrdup(env_args);
6904 bc_vec_init(&v, sizeof(char *), NULL);
6906 while (*(buf = skip_whitespace(buf)) != '\0') {
6907 bc_vec_push(&v, &buf);
6908 buf = skip_non_whitespace(buf);
6914 // NULL terminate, and pass argv[] so that first arg is argv[1]
6915 if (sizeof(int) == sizeof(char*)) {
6916 bc_vec_push(&v, &const_int_0);
6918 static char *const nullptr = NULL;
6919 bc_vec_push(&v, &nullptr);
6921 bc_args(((char **)v.v) - 1);
6926 static const char bc_lib[] ALIGN1 = {
6929 "\n" "auto b,s,n,r,d,i,p,f,v"
6930 ////////////////"if(x<0)return(1/e(-x))" // and drop 'n' and x<0 logic below
6931 //^^^^^^^^^^^^^^^^ this would work, and is even more precise than GNU bc:
6932 //e(-.998896): GNU:.36828580434569428695
6933 // above code:.36828580434569428696
6934 // actual value:.3682858043456942869594...
6935 // but for now let's be "GNU compatible"
6944 "\n" "scale=scale(x)+1"
6954 "\n" "for(i=2;v;++i){"
6960 "\n" "while(d--)r*=r"
6963 "\n" "if(n)return(1/r)"
6967 "\n" "auto b,s,r,p,a,q,i,v"
6971 "\n" "r=(1-10^scale)/1"
6982 "\n" "while(x<=.5){"
6986 "\n" "r=a=(x-1)/(x+1)"
6989 "\n" "for(i=3;v;i+=2){"
7000 "\n" "auto b,s,r,a,q,i"
7001 "\n" "if(x<0)return(-s(-x))"
7005 "\n" "scale=1.1*s+2"
7014 "\n" "for(i=3;a;i+=2){"
7015 "\n" "a*=q/(i*(i-1))"
7028 "\n" "x=s(2*a(1)+x)"
7034 "\n" "auto b,s,r,n,a,m,t,f,i,u"
7042 "\n" "if(scale<65){"
7043 "\n" "if(x==1)return(.7853981633974483096156608458198757210492923498437764552437361480/n)"
7044 "\n" "if(x==.2)return(.1973955598498807583700497651947902934475851037878521015176889402/n)"
7054 "\n" "x=(x-.2)/(1+.2*x)"
7059 "\n" "for(i=3;t;i+=2){"
7066 "\n" "return((m*a+r)/n)"
7068 "\n" "define j(n,x){"
7069 "\n" "auto b,s,o,a,i,v,f"
7080 "\n" "for(i=2;i<=n;++i)a*=i"
7082 "\n" "a=(x^n)/2^n/a"
7085 "\n" "scale+=length(a)-scale(a)"
7086 "\n" "for(i=1;v;++i){"
7087 "\n" "v=v*f/i/(n+i)"
7093 "\n" "return(a*r/1)"
7098 static BC_STATUS zxc_vm_exec(void)
7105 if (option_mask32 & BC_FLAG_L) {
7106 // We know that internal library is not buggy,
7107 // thus error checking is normally disabled.
7108 # define DEBUG_LIB 0
7109 s = zxc_vm_process(bc_lib);
7110 if (DEBUG_LIB && s) RETURN_STATUS(s);
7114 s = BC_STATUS_SUCCESS;
7115 fname = (void*)G.files.v;
7116 for (i = 0; i < G.files.len; i++) {
7117 s = zxc_vm_file(*fname++);
7118 if (ENABLE_FEATURE_CLEAN_UP && !G_ttyin && s) {
7119 // Debug config, non-interactive mode:
7120 // return all the way back to main.
7121 // Non-debug builds do not come here
7122 // in non-interactive mode, they exit.
7127 if (IS_BC || (option_mask32 & BC_FLAG_I))
7128 s = zxc_vm_execute_FILE(stdin, /*filename:*/ NULL);
7132 #define zxc_vm_exec(...) (zxc_vm_exec(__VA_ARGS__) COMMA_SUCCESS)
7134 #if ENABLE_FEATURE_CLEAN_UP
7135 static void xc_program_free(void)
7137 bc_vec_free(&G.prog.fns);
7138 IF_BC(bc_vec_free(&G.prog.fn_map);)
7139 bc_vec_free(&G.prog.vars);
7140 bc_vec_free(&G.prog.var_map);
7141 bc_vec_free(&G.prog.arrs);
7142 bc_vec_free(&G.prog.arr_map);
7143 IF_DC(bc_vec_free(&G.prog.strs);)
7144 IF_DC(bc_vec_free(&G.prog.consts);)
7145 bc_vec_free(&G.prog.results);
7146 bc_vec_free(&G.prog.exestack);
7147 IF_BC(bc_num_free(&G.prog.last);)
7148 //IF_BC(bc_num_free(&G.prog.zero);)
7149 IF_BC(bc_num_free(&G.prog.one);)
7150 bc_vec_free(&G.input_buffer);
7153 static void xc_vm_free(void)
7155 bc_vec_free(&G.files);
7162 static void xc_program_init(void)
7166 // memset(&G.prog, 0, sizeof(G.prog)); - already is
7167 memset(&ip, 0, sizeof(BcInstPtr));
7169 // G.prog.nchars = G.prog.scale = 0; - already is
7173 IF_BC(bc_num_init_DEF_SIZE(&G.prog.last);)
7174 //IF_BC(bc_num_zero(&G.prog.last);) - already is
7176 //bc_num_init_DEF_SIZE(&G.prog.zero); - not needed
7177 //bc_num_zero(&G.prog.zero); - already is
7179 IF_BC(bc_num_init_DEF_SIZE(&G.prog.one);)
7180 IF_BC(bc_num_one(&G.prog.one);)
7182 bc_vec_init(&G.prog.fns, sizeof(BcFunc), bc_func_free);
7183 IF_BC(bc_vec_init(&G.prog.fn_map, sizeof(BcId), bc_id_free);)
7186 // Names are chosen simply to be distinct and never match
7187 // a valid function name (and be short)
7188 IF_BC(bc_program_addFunc(xstrdup(""))); // func #0: main
7189 IF_BC(bc_program_addFunc(xstrdup("1"))); // func #1: for read()
7191 // in dc, functions have no names
7192 xc_program_add_fn();
7193 xc_program_add_fn();
7196 bc_vec_init(&G.prog.vars, sizeof(BcVec), bc_vec_free);
7197 bc_vec_init(&G.prog.var_map, sizeof(BcId), bc_id_free);
7199 bc_vec_init(&G.prog.arrs, sizeof(BcVec), bc_vec_free);
7200 bc_vec_init(&G.prog.arr_map, sizeof(BcId), bc_id_free);
7202 IF_DC(bc_vec_init(&G.prog.strs, sizeof(char *), bc_string_free);)
7203 IF_DC(bc_vec_init(&G.prog.consts, sizeof(char *), bc_string_free);)
7204 bc_vec_init(&G.prog.results, sizeof(BcResult), bc_result_free);
7205 bc_vec_init(&G.prog.exestack, sizeof(BcInstPtr), NULL);
7206 bc_vec_push(&G.prog.exestack, &ip);
7208 bc_char_vec_init(&G.input_buffer);
7211 static int xc_vm_init(const char *env_len)
7213 #if ENABLE_FEATURE_EDITING
7214 G.line_input_state = new_line_input_t(DO_HISTORY);
7216 G.prog.len = xc_vm_envLen(env_len);
7218 bc_vec_init(&G.files, sizeof(char *), NULL);
7220 IF_BC(if (IS_BC) bc_vm_envArgs();)
7221 xc_parse_create(BC_PROG_MAIN);
7223 //TODO: in GNU bc, the check is (isatty(0) && isatty(1)),
7224 //-i option unconditionally enables this regardless of isatty():
7226 #if ENABLE_FEATURE_BC_SIGNALS
7228 // With SA_RESTART, most system calls will restart
7229 // (IOW: they won't fail with EINTR).
7230 // In particular, this means ^C won't cause
7231 // stdout to get into "error state" if SIGINT hits
7232 // within write() syscall.
7234 // The downside is that ^C while tty input is taken
7235 // will only be handled after [Enter] since read()
7236 // from stdin is not interrupted by ^C either,
7237 // it restarts, thus fgetc() does not return on ^C.
7238 // (This problem manifests only if line editing is disabled)
7239 signal_SA_RESTART_empty_mask(SIGINT, record_signo);
7241 // Without SA_RESTART, this exhibits a bug:
7242 // "while (1) print 1" and try ^C-ing it.
7243 // Intermittently, instead of returning to input line,
7244 // you'll get "output error: Interrupted system call"
7246 //signal_no_SA_RESTART_empty_mask(SIGINT, record_signo);
7250 return 0; // "not a tty"
7253 static BcStatus xc_vm_run(void)
7255 BcStatus st = zxc_vm_exec();
7256 #if ENABLE_FEATURE_CLEAN_UP
7257 if (G_exiting) // it was actually "halt" or "quit"
7260 # if ENABLE_FEATURE_EDITING
7261 free_line_input_t(G.line_input_state);
7265 dbg_exec("exiting with exitcode %d", st);
7270 int bc_main(int argc, char **argv) MAIN_EXTERNALLY_VISIBLE;
7271 int bc_main(int argc UNUSED_PARAM, char **argv)
7277 is_tty = xc_vm_init("BC_LINE_LENGTH");
7281 if (is_tty && !(option_mask32 & BC_FLAG_Q))
7289 int dc_main(int argc, char **argv) MAIN_EXTERNALLY_VISIBLE;
7290 int dc_main(int argc UNUSED_PARAM, char **argv)
7296 // TODO: dc (GNU bc 1.07.1) 1.4.1 seems to use width
7297 // 1 char wider than bc from the same package.
7298 // Both default width, and xC_LINE_LENGTH=N are wider:
7299 // "DC_LINE_LENGTH=5 dc -e'123456 p'" prints:
7302 // "echo '123456' | BC_LINE_LENGTH=5 bc" prints:
7305 // Do the same, or it's a bug?
7306 xc_vm_init("DC_LINE_LENGTH");
7308 // Run -e'SCRIPT' and -fFILE in order of appearance, then handle FILEs
7309 noscript = BC_FLAG_I;
7311 int n = getopt(argc, argv, "e:f:x");
7317 n = zxc_vm_process(optarg);
7322 n = zxc_vm_file(optarg);
7326 option_mask32 |= DC_FLAG_X;
7336 bc_vec_push(&G.files, argv++);
7339 option_mask32 |= noscript; // set BC_FLAG_I if we need to interpret stdin
7345 #endif // not DC_SMALL