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; 49 kb when combined with dc)"
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 (38 kb; 49 kb when combined with bc)"
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 5D
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[] = {
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
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[] = { // starts at XC_LEX_OP_POWER // corresponding XC/DC_LEX_xyz:
678 XC_INST_POWER, XC_INST_MULTIPLY, // OP_POWER OP_MULTIPLY
679 XC_INST_DIVIDE, XC_INST_MODULUS, // OP_DIVIDE OP_MODULUS
680 XC_INST_PLUS, XC_INST_MINUS, // OP_PLUS 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, // OP_MODEXP OP_DIVMOD
696 DC_INST_INVALID, DC_INST_INVALID, // COLON ELSE
697 DC_INST_EXECUTE, // EXECUTE
698 DC_INST_PRINT_STACK, DC_INST_CLEAR_STACK, // PRINT_STACK CLEAR_STACK
699 DC_INST_STACK_LEN, DC_INST_DUPLICATE, // STACK_LEVEL DUPLICATE
700 DC_INST_SWAP, XC_INST_POP, // SWAP POP
701 DC_INST_ASCIIFY, DC_INST_PRINT_STREAM, // ASCIIFY PRINT_STREAM
702 DC_INST_INVALID, DC_INST_INVALID, // STORE_IBASE STORE_OBASE
703 DC_INST_INVALID, DC_INST_INVALID, // STORE_SCALE LOAD
704 DC_INST_INVALID, DC_INST_INVALID, // LOAD_POP STORE_PUSH
705 XC_INST_PRINT, DC_INST_NQUIT, // PRINT_POP NQUIT
706 XC_INST_SCALE_FUNC, // 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'))
806 #define BC_PARSE_STREND (0xff)
809 # define BC_PARSE_REL (1 << 0)
810 # define BC_PARSE_PRINT (1 << 1)
811 # define BC_PARSE_ARRAY (1 << 2)
812 # define BC_PARSE_NOCALL (1 << 3)
815 #define BC_PROG_MAIN (0)
816 #define BC_PROG_READ (1)
818 #define BC_PROG_REQ_FUNCS (2)
821 #define BC_PROG_STR(n) (!(n)->num && !(n)->cap)
822 #define BC_PROG_NUM(r, n) \
823 ((r)->t != XC_RESULT_ARRAY && (r)->t != XC_RESULT_STR && !BC_PROG_STR(n))
825 #define BC_FLAG_W (1 << 0)
826 #define BC_FLAG_V (1 << 1)
827 #define BC_FLAG_S (1 << 2)
828 #define BC_FLAG_Q (1 << 3)
829 #define BC_FLAG_L (1 << 4)
830 #define BC_FLAG_I (1 << 5)
831 #define DC_FLAG_X (1 << 6)
833 #define BC_MAX(a, b) ((a) > (b) ? (a) : (b))
834 #define BC_MIN(a, b) ((a) < (b) ? (a) : (b))
836 #define BC_MAX_OBASE ((unsigned) 999)
837 #define BC_MAX_DIM ((unsigned) INT_MAX)
838 #define BC_MAX_SCALE ((unsigned) UINT_MAX)
839 #define BC_MAX_STRING ((unsigned) UINT_MAX - 1)
840 #define BC_MAX_NUM BC_MAX_STRING
841 // Unused apart from "limits" message. Just show a "biggish number" there.
842 //#define BC_MAX_NAME BC_MAX_STRING
843 //#define BC_MAX_EXP ((unsigned long) LONG_MAX)
844 //#define BC_MAX_VARS ((unsigned long) SIZE_MAX - 1)
845 #define BC_MAX_NAME_STR "999999999"
846 #define BC_MAX_EXP_STR "999999999"
847 #define BC_MAX_VARS_STR "999999999"
849 #define BC_MAX_OBASE_STR "999"
851 #if INT_MAX == 2147483647
852 # define BC_MAX_DIM_STR "2147483647"
853 #elif INT_MAX == 9223372036854775807
854 # define BC_MAX_DIM_STR "9223372036854775807"
856 # error Strange INT_MAX
859 #if UINT_MAX == 4294967295
860 # define BC_MAX_SCALE_STR "4294967295"
861 # define BC_MAX_STRING_STR "4294967294"
862 #elif UINT_MAX == 18446744073709551615
863 # define BC_MAX_SCALE_STR "18446744073709551615"
864 # define BC_MAX_STRING_STR "18446744073709551614"
866 # error Strange UINT_MAX
868 #define BC_MAX_NUM_STR BC_MAX_STRING_STR
870 // In configurations where errors abort instead of propagating error
871 // return code up the call chain, functions returning BC_STATUS
872 // actually don't return anything, they always succeed and return "void".
873 // A macro wrapper is provided, which makes this statement work:
875 // and makes it visible to the compiler that s is always zero,
876 // allowing compiler to optimize dead code after the statement.
878 // To make code more readable, each such function has a "z"
879 // ("always returning zero") prefix, i.e. zbc_foo or zdc_foo.
881 #if ENABLE_FEATURE_BC_SIGNALS || ENABLE_FEATURE_CLEAN_UP
882 # define ERRORS_ARE_FATAL 0
883 # define ERRORFUNC /*nothing*/
884 # define IF_ERROR_RETURN_POSSIBLE(a) a
885 # define BC_STATUS BcStatus
886 # define RETURN_STATUS(v) return (v)
887 # define COMMA_SUCCESS /*nothing*/
889 # define ERRORS_ARE_FATAL 1
890 # define ERRORFUNC NORETURN
891 # define IF_ERROR_RETURN_POSSIBLE(a) /*nothing*/
892 # define BC_STATUS void
893 # define RETURN_STATUS(v) do { ((void)(v)); return; } while (0)
894 # define COMMA_SUCCESS ,BC_STATUS_SUCCESS
901 static void fflush_and_check(void)
904 if (ferror(stdout) || ferror(stderr))
905 bb_perror_msg_and_die("output error");
908 #if ENABLE_FEATURE_CLEAN_UP
909 #define QUIT_OR_RETURN_TO_MAIN \
911 IF_FEATURE_BC_SIGNALS(G_ttyin = 0;) /* do not loop in main loop anymore */ \
913 return BC_STATUS_FAILURE; \
916 #define QUIT_OR_RETURN_TO_MAIN quit()
919 static void quit(void) NORETURN;
920 static void quit(void)
923 bb_perror_msg_and_die("input error");
925 dbg_exec("quit(): exiting with exitcode SUCCESS");
929 static void bc_verror_msg(const char *fmt, va_list p)
931 const char *sv = sv; // for compiler
932 if (G.prs.lex_filename) {
934 applet_name = xasprintf("%s: %s:%u", applet_name, G.prs.lex_filename, G.err_line);
936 bb_verror_msg(fmt, p, NULL);
937 if (G.prs.lex_filename) {
938 free((char*)applet_name);
943 static NOINLINE ERRORFUNC int bc_error_fmt(const char *fmt, ...)
948 bc_verror_msg(fmt, p);
951 if (ENABLE_FEATURE_CLEAN_UP || G_ttyin)
952 IF_ERROR_RETURN_POSSIBLE(return BC_STATUS_FAILURE);
957 static NOINLINE BC_STATUS zbc_posix_error_fmt(const char *fmt, ...)
961 // Are non-POSIX constructs totally ok?
962 if (!(option_mask32 & (BC_FLAG_S|BC_FLAG_W)))
963 RETURN_STATUS(BC_STATUS_SUCCESS); // yes
966 bc_verror_msg(fmt, p);
969 // Do we treat non-POSIX constructs as errors?
970 if (!(option_mask32 & BC_FLAG_S))
971 RETURN_STATUS(BC_STATUS_SUCCESS); // no, it's a warning
973 if (ENABLE_FEATURE_CLEAN_UP || G_ttyin)
974 RETURN_STATUS(BC_STATUS_FAILURE);
977 #define zbc_posix_error_fmt(...) (zbc_posix_error_fmt(__VA_ARGS__) COMMA_SUCCESS)
980 // We use error functions with "return bc_error(FMT[, PARAMS])" idiom.
981 // This idiom begs for tail-call optimization, but for it to work,
982 // function must not have caller-cleaned parameters on stack.
983 // Unfortunately, vararg function API does exactly that on most arches.
984 // Thus, use these shims for the cases when we have no vararg PARAMS:
985 static ERRORFUNC int bc_error(const char *msg)
987 IF_ERROR_RETURN_POSSIBLE(return) bc_error_fmt("%s", msg);
989 static ERRORFUNC int bc_error_bad_character(char c)
992 IF_ERROR_RETURN_POSSIBLE(return) bc_error("NUL character");
993 IF_ERROR_RETURN_POSSIBLE(return) bc_error_fmt("bad character '%c'", c);
995 static ERRORFUNC int bc_error_bad_expression(void)
997 IF_ERROR_RETURN_POSSIBLE(return) bc_error("bad expression");
999 static ERRORFUNC int bc_error_bad_token(void)
1001 IF_ERROR_RETURN_POSSIBLE(return) bc_error("bad token");
1003 static ERRORFUNC int bc_error_stack_has_too_few_elements(void)
1005 IF_ERROR_RETURN_POSSIBLE(return) bc_error("stack has too few elements");
1007 static ERRORFUNC int bc_error_variable_is_wrong_type(void)
1009 IF_ERROR_RETURN_POSSIBLE(return) bc_error("variable is wrong type");
1012 static BC_STATUS zbc_POSIX_requires(const char *msg)
1014 RETURN_STATUS(zbc_posix_error_fmt("POSIX requires %s", msg));
1016 #define zbc_POSIX_requires(...) (zbc_POSIX_requires(__VA_ARGS__) COMMA_SUCCESS)
1017 static BC_STATUS zbc_POSIX_does_not_allow(const char *msg)
1019 RETURN_STATUS(zbc_posix_error_fmt("%s%s", "POSIX does not allow ", msg));
1021 #define zbc_POSIX_does_not_allow(...) (zbc_POSIX_does_not_allow(__VA_ARGS__) COMMA_SUCCESS)
1022 static BC_STATUS zbc_POSIX_does_not_allow_bool_ops_this_is_bad(const char *msg)
1024 RETURN_STATUS(zbc_posix_error_fmt("%s%s %s", "POSIX does not allow ", "boolean operators; this is bad:", msg));
1026 #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)
1027 static BC_STATUS zbc_POSIX_does_not_allow_empty_X_expression_in_for(const char *msg)
1029 RETURN_STATUS(zbc_posix_error_fmt("%san empty %s expression in 'for()'", "POSIX does not allow ", msg));
1031 #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)
1034 static void bc_vec_grow(BcVec *v, size_t n)
1036 size_t cap = v->cap * 2;
1037 while (cap < v->len + n) cap *= 2;
1038 v->v = xrealloc(v->v, v->size * cap);
1042 static void bc_vec_init(BcVec *v, size_t esize, BcVecFree dtor)
1045 v->cap = BC_VEC_START_CAP;
1048 v->v = xmalloc(esize * BC_VEC_START_CAP);
1051 static void bc_char_vec_init(BcVec *v)
1053 bc_vec_init(v, sizeof(char), NULL);
1056 static void bc_vec_expand(BcVec *v, size_t req)
1059 v->v = xrealloc(v->v, v->size * req);
1064 static void bc_vec_pop(BcVec *v)
1068 v->dtor(v->v + (v->size * v->len));
1071 static void bc_vec_npop(BcVec *v, size_t n)
1076 size_t len = v->len - n;
1077 while (v->len > len) v->dtor(v->v + (v->size * --v->len));
1081 static void bc_vec_pop_all(BcVec *v)
1083 bc_vec_npop(v, v->len);
1086 static size_t bc_vec_push(BcVec *v, const void *data)
1088 size_t len = v->len;
1089 if (len >= v->cap) bc_vec_grow(v, 1);
1090 memmove(v->v + (v->size * len), data, v->size);
1095 // G.prog.results often needs "pop old operand, push result" idiom.
1096 // Can do this without a few extra ops
1097 static size_t bc_result_pop_and_push(const void *data)
1099 BcVec *v = &G.prog.results;
1101 size_t len = v->len - 1;
1103 last = v->v + (v->size * len);
1106 memmove(last, data, v->size);
1110 static size_t bc_vec_pushByte(BcVec *v, char data)
1112 return bc_vec_push(v, &data);
1115 static size_t bc_vec_pushZeroByte(BcVec *v)
1117 //return bc_vec_pushByte(v, '\0');
1119 return bc_vec_push(v, &const_int_0);
1122 static void bc_vec_pushAt(BcVec *v, const void *data, size_t idx)
1125 bc_vec_push(v, data);
1129 if (v->len == v->cap) bc_vec_grow(v, 1);
1131 ptr = v->v + v->size * idx;
1133 memmove(ptr + v->size, ptr, v->size * (v->len++ - idx));
1134 memmove(ptr, data, v->size);
1138 static void bc_vec_string(BcVec *v, size_t len, const char *str)
1141 bc_vec_expand(v, len + 1);
1142 memcpy(v->v, str, len);
1145 bc_vec_pushZeroByte(v);
1148 static void *bc_vec_item(const BcVec *v, size_t idx)
1150 return v->v + v->size * idx;
1153 static void *bc_vec_item_rev(const BcVec *v, size_t idx)
1155 return v->v + v->size * (v->len - idx - 1);
1158 static void *bc_vec_top(const BcVec *v)
1160 return v->v + v->size * (v->len - 1);
1163 static FAST_FUNC void bc_vec_free(void *vec)
1165 BcVec *v = (BcVec *) vec;
1170 static BcFunc* bc_program_func(size_t idx)
1172 return bc_vec_item(&G.prog.fns, idx);
1174 // BC_PROG_MAIN is zeroth element, so:
1175 #define bc_program_func_BC_PROG_MAIN() ((BcFunc*)(G.prog.fns.v))
1178 static BcFunc* bc_program_current_func(void)
1180 BcInstPtr *ip = bc_vec_top(&G.prog.exestack);
1181 BcFunc *func = bc_program_func(ip->func);
1186 static char** bc_program_str(size_t idx)
1190 BcFunc *func = bc_program_current_func();
1191 return bc_vec_item(&func->strs, idx);
1194 IF_DC(return bc_vec_item(&G.prog.strs, idx);)
1197 static char** bc_program_const(size_t idx)
1201 BcFunc *func = bc_program_current_func();
1202 return bc_vec_item(&func->consts, idx);
1205 IF_DC(return bc_vec_item(&G.prog.consts, idx);)
1208 static int bc_id_cmp(const void *e1, const void *e2)
1210 return strcmp(((const BcId *) e1)->name, ((const BcId *) e2)->name);
1213 static FAST_FUNC void bc_id_free(void *id)
1215 free(((BcId *) id)->name);
1218 static size_t bc_map_find_ge(const BcVec *v, const void *ptr)
1220 size_t low = 0, high = v->len;
1222 while (low < high) {
1223 size_t mid = (low + high) / 2;
1224 BcId *id = bc_vec_item(v, mid);
1225 int result = bc_id_cmp(ptr, id);
1238 static int bc_map_insert(BcVec *v, const void *ptr, size_t *i)
1240 size_t n = *i = bc_map_find_ge(v, ptr);
1243 bc_vec_push(v, ptr);
1244 else if (!bc_id_cmp(ptr, bc_vec_item(v, n)))
1245 return 0; // "was not inserted"
1247 bc_vec_pushAt(v, ptr, n);
1248 return 1; // "was inserted"
1252 static size_t bc_map_find_exact(const BcVec *v, const void *ptr)
1254 size_t i = bc_map_find_ge(v, ptr);
1255 if (i >= v->len) return BC_VEC_INVALID_IDX;
1256 return bc_id_cmp(ptr, bc_vec_item(v, i)) ? BC_VEC_INVALID_IDX : i;
1260 static void bc_num_setToZero(BcNum *n, size_t scale)
1267 static void bc_num_zero(BcNum *n)
1269 bc_num_setToZero(n, 0);
1272 static void bc_num_one(BcNum *n)
1274 bc_num_setToZero(n, 0);
1279 // Note: this also sets BcNum to zero
1280 static void bc_num_init(BcNum *n, size_t req)
1282 req = req >= BC_NUM_DEF_SIZE ? req : BC_NUM_DEF_SIZE;
1283 //memset(n, 0, sizeof(BcNum)); - cleared by assignments below
1284 n->num = xmalloc(req);
1291 static void bc_num_init_DEF_SIZE(BcNum *n)
1293 bc_num_init(n, BC_NUM_DEF_SIZE);
1296 static void bc_num_expand(BcNum *n, size_t req)
1298 req = req >= BC_NUM_DEF_SIZE ? req : BC_NUM_DEF_SIZE;
1300 n->num = xrealloc(n->num, req);
1305 static FAST_FUNC void bc_num_free(void *num)
1307 free(((BcNum *) num)->num);
1310 static void bc_num_copy(BcNum *d, BcNum *s)
1313 bc_num_expand(d, s->cap);
1317 memcpy(d->num, s->num, sizeof(BcDig) * d->len);
1321 static BC_STATUS zbc_num_ulong_abs(BcNum *n, unsigned long *result_p)
1324 unsigned long result;
1328 while (i > n->rdx) {
1329 unsigned long prev = result;
1330 result = result * 10 + n->num[--i];
1331 // Even overflowed N*10 can still satisfy N*10>=N. For example,
1332 // 0x1ff00000 * 10 is 0x13f600000,
1333 // or 0x3f600000 truncated to 32 bits. Which is larger.
1334 // However, (N*10)/8 < N check is always correct.
1335 if ((result / 8) < prev)
1336 RETURN_STATUS(bc_error("overflow"));
1340 RETURN_STATUS(BC_STATUS_SUCCESS);
1342 #define zbc_num_ulong_abs(...) (zbc_num_ulong_abs(__VA_ARGS__) COMMA_SUCCESS)
1344 static BC_STATUS zbc_num_ulong(BcNum *n, unsigned long *result_p)
1346 if (n->neg) RETURN_STATUS(bc_error("negative number"));
1348 RETURN_STATUS(zbc_num_ulong_abs(n, result_p));
1350 #define zbc_num_ulong(...) (zbc_num_ulong(__VA_ARGS__) COMMA_SUCCESS)
1352 #if ULONG_MAX == 0xffffffffUL // 10 digits: 4294967295
1353 # define ULONG_NUM_BUFSIZE (10 > BC_NUM_DEF_SIZE ? 10 : BC_NUM_DEF_SIZE)
1354 #elif ULONG_MAX == 0xffffffffffffffffULL // 20 digits: 18446744073709551615
1355 # define ULONG_NUM_BUFSIZE (20 > BC_NUM_DEF_SIZE ? 20 : BC_NUM_DEF_SIZE)
1357 // minimum BC_NUM_DEF_SIZE, so that bc_num_expand() in bc_num_ulong2num()
1358 // would not hit realloc() code path - not good if num[] is not malloced
1360 static void bc_num_ulong2num(BcNum *n, unsigned long val)
1366 if (val == 0) return;
1368 bc_num_expand(n, ULONG_NUM_BUFSIZE);
1375 if (val == 0) break;
1379 static void bc_num_subArrays(BcDig *restrict a, BcDig *restrict b, size_t len)
1382 for (i = 0; i < len; ++i) {
1384 for (j = i; a[j] < 0;) {
1391 static ssize_t bc_num_compare(BcDig *restrict a, BcDig *restrict b, size_t len)
1409 #define BC_NUM_NEG(n, neg) ((((ssize_t)(n)) ^ -((ssize_t)(neg))) + (neg))
1410 #define BC_NUM_ONE(n) ((n)->len == 1 && (n)->rdx == 0 && (n)->num[0] == 1)
1411 #define BC_NUM_INT(n) ((n)->len - (n)->rdx)
1412 //#define BC_NUM_AREQ(a, b) (BC_MAX((a)->rdx, (b)->rdx) + BC_MAX(BC_NUM_INT(a), BC_NUM_INT(b)) + 1)
1413 static /*ALWAYS_INLINE*/ size_t BC_NUM_AREQ(BcNum *a, BcNum *b)
1415 return BC_MAX(a->rdx, b->rdx) + BC_MAX(BC_NUM_INT(a), BC_NUM_INT(b)) + 1;
1417 //#define BC_NUM_MREQ(a, b, scale) (BC_NUM_INT(a) + BC_NUM_INT(b) + BC_MAX((scale), (a)->rdx + (b)->rdx) + 1)
1418 static /*ALWAYS_INLINE*/ size_t BC_NUM_MREQ(BcNum *a, BcNum *b, size_t scale)
1420 return BC_NUM_INT(a) + BC_NUM_INT(b) + BC_MAX(scale, a->rdx + b->rdx) + 1;
1423 static ssize_t bc_num_cmp(BcNum *a, BcNum *b)
1425 size_t i, min, a_int, b_int, diff;
1426 BcDig *max_num, *min_num;
1430 if (a == b) return 0;
1431 if (a->len == 0) return BC_NUM_NEG(!!b->len, !b->neg);
1432 if (b->len == 0) return BC_NUM_NEG(1, a->neg);
1434 if (a->neg != b->neg) // signs of a and b differ
1435 // +a,-b = a>b = 1 or -a,+b = a<b = -1
1436 return (int)b->neg - (int)a->neg;
1437 neg = a->neg; // 1 if both negative, 0 if both positive
1439 a_int = BC_NUM_INT(a);
1440 b_int = BC_NUM_INT(b);
1443 if (a_int != 0) return (ssize_t) a_int;
1445 a_max = (a->rdx > b->rdx);
1448 diff = a->rdx - b->rdx;
1449 max_num = a->num + diff;
1451 // neg = (a_max == neg); - NOP (maps 1->1 and 0->0)
1454 diff = b->rdx - a->rdx;
1455 max_num = b->num + diff;
1457 neg = !neg; // same as "neg = (a_max == neg)"
1460 cmp = bc_num_compare(max_num, min_num, b_int + min);
1461 if (cmp != 0) return BC_NUM_NEG(cmp, neg);
1463 for (max_num -= diff, i = diff - 1; i < diff; --i) {
1464 if (max_num[i]) return BC_NUM_NEG(1, neg);
1470 static void bc_num_truncate(BcNum *n, size_t places)
1472 if (places == 0) return;
1478 memmove(n->num, n->num + places, n->len * sizeof(BcDig));
1482 static void bc_num_extend(BcNum *n, size_t places)
1484 size_t len = n->len + places;
1487 if (n->cap < len) bc_num_expand(n, len);
1489 memmove(n->num + places, n->num, sizeof(BcDig) * n->len);
1490 memset(n->num, 0, sizeof(BcDig) * places);
1497 static void bc_num_clean(BcNum *n)
1499 while (n->len > 0 && n->num[n->len - 1] == 0) --n->len;
1502 else if (n->len < n->rdx)
1506 static void bc_num_retireMul(BcNum *n, size_t scale, bool neg1, bool neg2)
1509 bc_num_extend(n, scale - n->rdx);
1511 bc_num_truncate(n, n->rdx - scale);
1514 if (n->len != 0) n->neg = !neg1 != !neg2;
1517 static void bc_num_split(BcNum *restrict n, size_t idx, BcNum *restrict a,
1521 b->len = n->len - idx;
1523 a->rdx = b->rdx = 0;
1525 memcpy(b->num, n->num + idx, b->len * sizeof(BcDig));
1526 memcpy(a->num, n->num, idx * sizeof(BcDig));
1536 static BC_STATUS zbc_num_shift(BcNum *n, size_t places)
1538 if (places == 0 || n->len == 0) RETURN_STATUS(BC_STATUS_SUCCESS);
1540 // This check makes sense only if size_t is (much) larger than BC_MAX_NUM.
1541 if (SIZE_MAX > (BC_MAX_NUM | 0xff)) {
1542 if (places + n->len > BC_MAX_NUM)
1543 RETURN_STATUS(bc_error("number too long: must be [1,"BC_MAX_NUM_STR"]"));
1546 if (n->rdx >= places)
1549 bc_num_extend(n, places - n->rdx);
1555 RETURN_STATUS(BC_STATUS_SUCCESS);
1557 #define zbc_num_shift(...) (zbc_num_shift(__VA_ARGS__) COMMA_SUCCESS)
1559 typedef BC_STATUS (*BcNumBinaryOp)(BcNum *, BcNum *, BcNum *, size_t) FAST_FUNC;
1561 static BC_STATUS zbc_num_binary(BcNum *a, BcNum *b, BcNum *c, size_t scale,
1562 BcNumBinaryOp op, size_t req)
1565 BcNum num2, *ptr_a, *ptr_b;
1570 memcpy(ptr_a, c, sizeof(BcNum));
1578 memcpy(ptr_b, c, sizeof(BcNum));
1585 bc_num_init(c, req);
1587 bc_num_expand(c, req);
1589 s = BC_STATUS_SUCCESS;
1590 IF_ERROR_RETURN_POSSIBLE(s =) op(ptr_a, ptr_b, c, scale);
1592 if (init) bc_num_free(&num2);
1596 #define zbc_num_binary(...) (zbc_num_binary(__VA_ARGS__) COMMA_SUCCESS)
1598 static FAST_FUNC BC_STATUS zbc_num_a(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale);
1599 static FAST_FUNC BC_STATUS zbc_num_s(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale);
1600 static FAST_FUNC BC_STATUS zbc_num_p(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale);
1601 static FAST_FUNC BC_STATUS zbc_num_m(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale);
1602 static FAST_FUNC BC_STATUS zbc_num_d(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale);
1603 static FAST_FUNC BC_STATUS zbc_num_rem(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale);
1605 static FAST_FUNC BC_STATUS zbc_num_add(BcNum *a, BcNum *b, BcNum *c, size_t scale)
1607 BcNumBinaryOp op = (!a->neg == !b->neg) ? zbc_num_a : zbc_num_s;
1609 RETURN_STATUS(zbc_num_binary(a, b, c, false, op, BC_NUM_AREQ(a, b)));
1612 static FAST_FUNC BC_STATUS zbc_num_sub(BcNum *a, BcNum *b, BcNum *c, size_t scale)
1614 BcNumBinaryOp op = (!a->neg == !b->neg) ? zbc_num_s : zbc_num_a;
1616 RETURN_STATUS(zbc_num_binary(a, b, c, true, op, BC_NUM_AREQ(a, b)));
1619 static FAST_FUNC BC_STATUS zbc_num_mul(BcNum *a, BcNum *b, BcNum *c, size_t scale)
1621 size_t req = BC_NUM_MREQ(a, b, scale);
1622 RETURN_STATUS(zbc_num_binary(a, b, c, scale, zbc_num_m, req));
1625 static FAST_FUNC BC_STATUS zbc_num_div(BcNum *a, BcNum *b, BcNum *c, size_t scale)
1627 size_t req = BC_NUM_MREQ(a, b, scale);
1628 RETURN_STATUS(zbc_num_binary(a, b, c, scale, zbc_num_d, req));
1631 static FAST_FUNC BC_STATUS zbc_num_mod(BcNum *a, BcNum *b, BcNum *c, size_t scale)
1633 size_t req = BC_NUM_MREQ(a, b, scale);
1634 RETURN_STATUS(zbc_num_binary(a, b, c, scale, zbc_num_rem, req));
1637 static FAST_FUNC BC_STATUS zbc_num_pow(BcNum *a, BcNum *b, BcNum *c, size_t scale)
1639 RETURN_STATUS(zbc_num_binary(a, b, c, scale, zbc_num_p, a->len * b->len + 1));
1642 static const BcNumBinaryOp zbc_program_ops[] = {
1643 zbc_num_pow, zbc_num_mul, zbc_num_div, zbc_num_mod, zbc_num_add, zbc_num_sub,
1645 #define zbc_num_add(...) (zbc_num_add(__VA_ARGS__) COMMA_SUCCESS)
1646 #define zbc_num_sub(...) (zbc_num_sub(__VA_ARGS__) COMMA_SUCCESS)
1647 #define zbc_num_mul(...) (zbc_num_mul(__VA_ARGS__) COMMA_SUCCESS)
1648 #define zbc_num_div(...) (zbc_num_div(__VA_ARGS__) COMMA_SUCCESS)
1649 #define zbc_num_mod(...) (zbc_num_mod(__VA_ARGS__) COMMA_SUCCESS)
1650 #define zbc_num_pow(...) (zbc_num_pow(__VA_ARGS__) COMMA_SUCCESS)
1652 static BC_STATUS zbc_num_inv(BcNum *a, BcNum *b, size_t scale)
1661 RETURN_STATUS(zbc_num_div(&one, a, b, scale));
1663 #define zbc_num_inv(...) (zbc_num_inv(__VA_ARGS__) COMMA_SUCCESS)
1665 static FAST_FUNC BC_STATUS zbc_num_a(BcNum *a, BcNum *b, BcNum *restrict c, size_t sub)
1667 BcDig *ptr, *ptr_a, *ptr_b, *ptr_c;
1668 size_t i, max, min_rdx, min_int, diff, a_int, b_int;
1671 // Because this function doesn't need to use scale (per the bc spec),
1672 // I am hijacking it to say whether it's doing an add or a subtract.
1676 if (sub && c->len) c->neg = !c->neg;
1677 RETURN_STATUS(BC_STATUS_SUCCESS);
1681 RETURN_STATUS(BC_STATUS_SUCCESS);
1685 c->rdx = BC_MAX(a->rdx, b->rdx);
1686 min_rdx = BC_MIN(a->rdx, b->rdx);
1689 if (a->rdx > b->rdx) {
1690 diff = a->rdx - b->rdx;
1692 ptr_a = a->num + diff;
1695 diff = b->rdx - a->rdx;
1698 ptr_b = b->num + diff;
1702 for (i = 0; i < diff; ++i, ++c->len)
1706 a_int = BC_NUM_INT(a);
1707 b_int = BC_NUM_INT(b);
1709 if (a_int > b_int) {
1720 for (i = 0; i < min_rdx + min_int; ++i) {
1721 unsigned in = (unsigned)ptr_a[i] + (unsigned)ptr_b[i] + carry;
1723 ptr_c[i] = (BcDig)(in % 10);
1725 for (; i < max + min_rdx; ++i) {
1726 unsigned in = (unsigned)ptr[i] + carry;
1728 ptr_c[i] = (BcDig)(in % 10);
1732 if (carry != 0) c->num[c->len++] = (BcDig) carry;
1734 RETURN_STATUS(BC_STATUS_SUCCESS); // can't make void, see zbc_num_binary()
1737 static FAST_FUNC BC_STATUS zbc_num_s(BcNum *a, BcNum *b, BcNum *restrict c, size_t sub)
1740 BcNum *minuend, *subtrahend;
1742 bool aneg, bneg, neg;
1744 // Because this function doesn't need to use scale (per the bc spec),
1745 // I am hijacking it to say whether it's doing an add or a subtract.
1749 if (sub && c->len) c->neg = !c->neg;
1750 RETURN_STATUS(BC_STATUS_SUCCESS);
1754 RETURN_STATUS(BC_STATUS_SUCCESS);
1759 a->neg = b->neg = false;
1761 cmp = bc_num_cmp(a, b);
1767 bc_num_setToZero(c, BC_MAX(a->rdx, b->rdx));
1768 RETURN_STATUS(BC_STATUS_SUCCESS);
1776 if (sub) neg = !neg;
1781 bc_num_copy(c, minuend);
1784 if (c->rdx < subtrahend->rdx) {
1785 bc_num_extend(c, subtrahend->rdx - c->rdx);
1788 start = c->rdx - subtrahend->rdx;
1790 bc_num_subArrays(c->num + start, subtrahend->num, subtrahend->len);
1794 RETURN_STATUS(BC_STATUS_SUCCESS); // can't make void, see zbc_num_binary()
1797 static FAST_FUNC BC_STATUS zbc_num_k(BcNum *restrict a, BcNum *restrict b,
1799 #define zbc_num_k(...) (zbc_num_k(__VA_ARGS__) COMMA_SUCCESS)
1802 size_t max = BC_MAX(a->len, b->len), max2 = (max + 1) / 2;
1803 BcNum l1, h1, l2, h2, m2, m1, z0, z1, z2, temp;
1806 if (a->len == 0 || b->len == 0) {
1808 RETURN_STATUS(BC_STATUS_SUCCESS);
1810 aone = BC_NUM_ONE(a);
1811 if (aone || BC_NUM_ONE(b)) {
1812 bc_num_copy(c, aone ? b : a);
1813 RETURN_STATUS(BC_STATUS_SUCCESS);
1816 if (a->len + b->len < BC_NUM_KARATSUBA_LEN
1817 || a->len < BC_NUM_KARATSUBA_LEN
1818 || b->len < BC_NUM_KARATSUBA_LEN
1822 bc_num_expand(c, a->len + b->len + 1);
1824 memset(c->num, 0, sizeof(BcDig) * c->cap);
1827 for (i = 0; i < b->len; ++i) {
1829 for (j = 0; j < a->len; ++j) {
1830 unsigned in = c->num[i + j];
1831 in += (unsigned)a->num[j] * (unsigned)b->num[i] + carry;
1832 // note: compilers prefer _unsigned_ div/const
1834 c->num[i + j] = (BcDig)(in % 10);
1837 c->num[i + j] += (BcDig) carry;
1838 len = BC_MAX(len, i + j + !!carry);
1840 #if ENABLE_FEATURE_BC_SIGNALS
1842 // a*a <- without check below, this will not be interruptible
1843 if (G_interrupt) return BC_STATUS_FAILURE;
1849 RETURN_STATUS(BC_STATUS_SUCCESS);
1852 bc_num_init(&l1, max);
1853 bc_num_init(&h1, max);
1854 bc_num_init(&l2, max);
1855 bc_num_init(&h2, max);
1856 bc_num_init(&m1, max);
1857 bc_num_init(&m2, max);
1858 bc_num_init(&z0, max);
1859 bc_num_init(&z1, max);
1860 bc_num_init(&z2, max);
1861 bc_num_init(&temp, max + max);
1863 bc_num_split(a, max2, &l1, &h1);
1864 bc_num_split(b, max2, &l2, &h2);
1866 s = zbc_num_add(&h1, &l1, &m1, 0);
1868 s = zbc_num_add(&h2, &l2, &m2, 0);
1871 s = zbc_num_k(&h1, &h2, &z0);
1873 s = zbc_num_k(&m1, &m2, &z1);
1875 s = zbc_num_k(&l1, &l2, &z2);
1878 s = zbc_num_sub(&z1, &z0, &temp, 0);
1880 s = zbc_num_sub(&temp, &z2, &z1, 0);
1883 s = zbc_num_shift(&z0, max2 * 2);
1885 s = zbc_num_shift(&z1, max2);
1887 s = zbc_num_add(&z0, &z1, &temp, 0);
1889 s = zbc_num_add(&temp, &z2, c, 0);
1904 static FAST_FUNC BC_STATUS zbc_num_m(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale)
1908 size_t maxrdx = BC_MAX(a->rdx, b->rdx);
1910 scale = BC_MAX(scale, a->rdx);
1911 scale = BC_MAX(scale, b->rdx);
1912 scale = BC_MIN(a->rdx + b->rdx, scale);
1913 maxrdx = BC_MAX(maxrdx, scale);
1915 bc_num_init(&cpa, a->len);
1916 bc_num_init(&cpb, b->len);
1918 bc_num_copy(&cpa, a);
1919 bc_num_copy(&cpb, b);
1920 cpa.neg = cpb.neg = false;
1922 s = zbc_num_shift(&cpa, maxrdx);
1924 s = zbc_num_shift(&cpb, maxrdx);
1926 s = zbc_num_k(&cpa, &cpb, c);
1930 bc_num_expand(c, c->len + maxrdx);
1932 if (c->len < maxrdx) {
1933 memset(c->num + c->len, 0, (c->cap - c->len) * sizeof(BcDig));
1938 bc_num_retireMul(c, scale, a->neg, b->neg);
1944 #define zbc_num_m(...) (zbc_num_m(__VA_ARGS__) COMMA_SUCCESS)
1946 static FAST_FUNC BC_STATUS zbc_num_d(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale)
1953 RETURN_STATUS(bc_error("divide by zero"));
1955 bc_num_setToZero(c, scale);
1956 RETURN_STATUS(BC_STATUS_SUCCESS);
1958 if (BC_NUM_ONE(b)) {
1960 bc_num_retireMul(c, scale, a->neg, b->neg);
1961 RETURN_STATUS(BC_STATUS_SUCCESS);
1964 bc_num_init(&cp, BC_NUM_MREQ(a, b, scale));
1965 bc_num_copy(&cp, a);
1969 bc_num_expand(&cp, len + 2);
1970 bc_num_extend(&cp, len - cp.len);
1973 if (b->rdx > cp.rdx) bc_num_extend(&cp, b->rdx - cp.rdx);
1975 if (scale > cp.rdx) bc_num_extend(&cp, scale - cp.rdx);
1977 if (b->rdx == b->len) {
1979 if (len == 0) break;
1981 if (b->num[len] != 0)
1987 if (cp.cap == cp.len) bc_num_expand(&cp, cp.len + 1);
1989 // We want an extra zero in front to make things simpler.
1990 cp.num[cp.len++] = 0;
1993 bc_num_expand(c, cp.len);
1996 memset(c->num + end, 0, (c->cap - end) * sizeof(BcDig));
2000 s = BC_STATUS_SUCCESS;
2001 for (i = end - 1; i < end; --i) {
2004 for (q = 0; n[len] != 0 || bc_num_compare(n, b->num, len) >= 0; ++q)
2005 bc_num_subArrays(n, b->num, len);
2007 #if ENABLE_FEATURE_BC_SIGNALS
2010 // 1/a <- without check below, this will not be interruptible
2012 s = BC_STATUS_FAILURE;
2018 bc_num_retireMul(c, scale, a->neg, b->neg);
2023 #define zbc_num_d(...) (zbc_num_d(__VA_ARGS__) COMMA_SUCCESS)
2025 static FAST_FUNC BC_STATUS zbc_num_r(BcNum *a, BcNum *b, BcNum *restrict c,
2026 BcNum *restrict d, size_t scale, size_t ts)
2033 RETURN_STATUS(bc_error("divide by zero"));
2036 bc_num_setToZero(d, ts);
2037 RETURN_STATUS(BC_STATUS_SUCCESS);
2040 bc_num_init(&temp, d->cap);
2041 s = zbc_num_d(a, b, c, scale);
2044 if (scale != 0) scale = ts;
2046 s = zbc_num_m(c, b, &temp, scale);
2048 s = zbc_num_sub(a, &temp, d, scale);
2051 if (ts > d->rdx && d->len) bc_num_extend(d, ts - d->rdx);
2054 bc_num_retireMul(d, ts, a->neg, b->neg);
2060 #define zbc_num_r(...) (zbc_num_r(__VA_ARGS__) COMMA_SUCCESS)
2062 static FAST_FUNC BC_STATUS zbc_num_rem(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale)
2066 size_t ts = BC_MAX(scale + b->rdx, a->rdx), len = BC_NUM_MREQ(a, b, ts);
2068 bc_num_init(&c1, len);
2069 s = zbc_num_r(a, b, &c1, c, scale, ts);
2074 #define zbc_num_rem(...) (zbc_num_rem(__VA_ARGS__) COMMA_SUCCESS)
2076 static FAST_FUNC BC_STATUS zbc_num_p(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale)
2078 BcStatus s = BC_STATUS_SUCCESS;
2081 size_t i, powrdx, resrdx;
2084 // GNU bc does not allow 2^2.0 - we do
2085 for (i = 0; i < b->rdx; i++)
2087 RETURN_STATUS(bc_error("not an integer"));
2091 RETURN_STATUS(BC_STATUS_SUCCESS);
2094 bc_num_setToZero(c, scale);
2095 RETURN_STATUS(BC_STATUS_SUCCESS);
2097 if (BC_NUM_ONE(b)) {
2101 s = zbc_num_inv(a, c, scale);
2106 s = zbc_num_ulong_abs(b, &pow);
2107 if (s) RETURN_STATUS(s);
2108 // b is not used beyond this point
2110 bc_num_init(©, a->len);
2111 bc_num_copy(©, a);
2116 if (a->rdx * pow < scale)
2117 scale = a->rdx * pow;
2121 for (powrdx = a->rdx; !(pow & 1); pow >>= 1) {
2123 s = zbc_num_mul(©, ©, ©, powrdx);
2125 // Not needed: zbc_num_mul() has a check for ^C:
2126 //if (G_interrupt) {
2127 // s = BC_STATUS_FAILURE;
2132 bc_num_copy(c, ©);
2134 for (resrdx = powrdx, pow >>= 1; pow != 0; pow >>= 1) {
2136 s = zbc_num_mul(©, ©, ©, powrdx);
2141 s = zbc_num_mul(c, ©, c, resrdx);
2144 // Not needed: zbc_num_mul() has a check for ^C:
2145 //if (G_interrupt) {
2146 // s = BC_STATUS_FAILURE;
2152 s = zbc_num_inv(c, c, scale);
2156 if (c->rdx > scale) bc_num_truncate(c, c->rdx - scale);
2158 // We can't use bc_num_clean() here.
2159 for (i = 0; i < c->len; ++i)
2162 bc_num_setToZero(c, scale);
2169 #define zbc_num_p(...) (zbc_num_p(__VA_ARGS__) COMMA_SUCCESS)
2171 static BC_STATUS zbc_num_sqrt(BcNum *a, BcNum *restrict b, size_t scale)
2174 BcNum num1, num2, half, f, fprime, *x0, *x1, *temp;
2175 size_t pow, len, digs, digs1, resrdx, req, times = 0;
2176 ssize_t cmp = 1, cmp1 = SSIZE_MAX, cmp2 = SSIZE_MAX;
2178 req = BC_MAX(scale, a->rdx) + ((BC_NUM_INT(a) + 1) >> 1) + 1;
2179 bc_num_expand(b, req);
2182 bc_num_setToZero(b, scale);
2183 RETURN_STATUS(BC_STATUS_SUCCESS);
2186 RETURN_STATUS(bc_error("negative number"));
2188 if (BC_NUM_ONE(a)) {
2190 bc_num_extend(b, scale);
2191 RETURN_STATUS(BC_STATUS_SUCCESS);
2194 scale = BC_MAX(scale, a->rdx) + 1;
2195 len = a->len + scale;
2197 bc_num_init(&num1, len);
2198 bc_num_init(&num2, len);
2199 bc_num_init_DEF_SIZE(&half);
2205 bc_num_init(&f, len);
2206 bc_num_init(&fprime, len);
2212 pow = BC_NUM_INT(a);
2220 pow -= 2 - (pow & 1);
2222 bc_num_extend(x0, pow);
2224 // Make sure to move the radix back.
2228 x0->rdx = digs = digs1 = 0;
2230 len = BC_NUM_INT(x0) + resrdx - 1;
2232 while (cmp != 0 || digs < len) {
2233 s = zbc_num_div(a, x0, &f, resrdx);
2235 s = zbc_num_add(x0, &f, &fprime, resrdx);
2237 s = zbc_num_mul(&fprime, &half, x1, resrdx);
2240 cmp = bc_num_cmp(x1, x0);
2241 digs = x1->len - (unsigned long long) llabs(cmp);
2243 if (cmp == cmp2 && digs == digs1)
2248 resrdx += times > 4;
2261 if (b->rdx > scale) bc_num_truncate(b, b->rdx - scale);
2263 bc_num_free(&fprime);
2270 #define zbc_num_sqrt(...) (zbc_num_sqrt(__VA_ARGS__) COMMA_SUCCESS)
2272 static BC_STATUS zbc_num_divmod(BcNum *a, BcNum *b, BcNum *c, BcNum *d,
2278 size_t ts = BC_MAX(scale + b->rdx, a->rdx), len = BC_NUM_MREQ(a, b, ts);
2281 memcpy(&num2, c, sizeof(BcNum));
2283 bc_num_init(c, len);
2287 bc_num_expand(c, len);
2290 s = zbc_num_r(ptr_a, b, c, d, scale, ts);
2292 if (init) bc_num_free(&num2);
2296 #define zbc_num_divmod(...) (zbc_num_divmod(__VA_ARGS__) COMMA_SUCCESS)
2299 static BC_STATUS zdc_num_modexp(BcNum *a, BcNum *b, BcNum *c, BcNum *restrict d)
2302 BcNum base, exp, two, temp;
2306 RETURN_STATUS(bc_error("divide by zero"));
2307 if (a->rdx || b->rdx || c->rdx)
2308 RETURN_STATUS(bc_error("not an integer"));
2310 RETURN_STATUS(bc_error("negative number"));
2312 bc_num_expand(d, c->len);
2313 bc_num_init(&base, c->len);
2314 bc_num_init(&exp, b->len);
2315 bc_num_init(&temp, b->len);
2317 two.cap = ARRAY_SIZE(two_digs);
2324 s = zbc_num_rem(a, c, &base, 0);
2326 bc_num_copy(&exp, b);
2328 while (exp.len != 0) {
2329 s = zbc_num_divmod(&exp, &two, &exp, &temp, 0);
2332 if (BC_NUM_ONE(&temp)) {
2333 s = zbc_num_mul(d, &base, &temp, 0);
2335 s = zbc_num_rem(&temp, c, d, 0);
2339 s = zbc_num_mul(&base, &base, &temp, 0);
2341 s = zbc_num_rem(&temp, c, &base, 0);
2350 #define zdc_num_modexp(...) (zdc_num_modexp(__VA_ARGS__) COMMA_SUCCESS)
2353 static FAST_FUNC void bc_string_free(void *string)
2355 free(*(char**)string);
2358 static void bc_func_init(BcFunc *f)
2360 bc_char_vec_init(&f->code);
2361 IF_BC(bc_vec_init(&f->labels, sizeof(size_t), NULL);)
2362 IF_BC(bc_vec_init(&f->autos, sizeof(BcId), bc_id_free);)
2363 IF_BC(bc_vec_init(&f->strs, sizeof(char *), bc_string_free);)
2364 IF_BC(bc_vec_init(&f->consts, sizeof(char *), bc_string_free);)
2365 IF_BC(f->nparams = 0;)
2368 static FAST_FUNC void bc_func_free(void *func)
2370 BcFunc *f = (BcFunc *) func;
2371 bc_vec_free(&f->code);
2372 IF_BC(bc_vec_free(&f->labels);)
2373 IF_BC(bc_vec_free(&f->autos);)
2374 IF_BC(bc_vec_free(&f->strs);)
2375 IF_BC(bc_vec_free(&f->consts);)
2378 static void bc_array_expand(BcVec *a, size_t len);
2380 static void bc_array_init(BcVec *a, bool nums)
2383 bc_vec_init(a, sizeof(BcNum), bc_num_free);
2385 bc_vec_init(a, sizeof(BcVec), bc_vec_free);
2386 bc_array_expand(a, 1);
2389 static void bc_array_expand(BcVec *a, size_t len)
2391 if (a->dtor == bc_num_free
2392 // && a->size == sizeof(BcNum) - always true
2395 while (len > a->len) {
2396 bc_num_init_DEF_SIZE(&n);
2401 while (len > a->len) {
2402 bc_array_init(&v, true);
2408 static void bc_array_copy(BcVec *d, const BcVec *s)
2414 bc_vec_expand(d, s->cap);
2419 for (i = 0; i < s->len; i++, dnum++, snum++) {
2420 bc_num_init(dnum, snum->len);
2421 bc_num_copy(dnum, snum);
2426 static void dc_result_copy(BcResult *d, BcResult *src)
2431 case XC_RESULT_TEMP:
2432 case XC_RESULT_IBASE:
2433 case XC_RESULT_SCALE:
2434 case XC_RESULT_OBASE:
2435 bc_num_init(&d->d.n, src->d.n.len);
2436 bc_num_copy(&d->d.n, &src->d.n);
2439 case XC_RESULT_ARRAY:
2440 case XC_RESULT_ARRAY_ELEM:
2441 d->d.id.name = xstrdup(src->d.id.name);
2443 case XC_RESULT_CONSTANT:
2444 IF_BC(case BC_RESULT_LAST:)
2445 IF_BC(case BC_RESULT_ONE:)
2447 memcpy(&d->d.n, &src->d.n, sizeof(BcNum));
2453 static FAST_FUNC void bc_result_free(void *result)
2455 BcResult *r = (BcResult *) result;
2458 case XC_RESULT_TEMP:
2459 case XC_RESULT_IBASE:
2460 case XC_RESULT_SCALE:
2461 case XC_RESULT_OBASE:
2462 bc_num_free(&r->d.n);
2465 case XC_RESULT_ARRAY:
2466 case XC_RESULT_ARRAY_ELEM:
2475 static int bad_input_byte(char c)
2477 if ((c < ' ' && c != '\t' && c != '\r' && c != '\n') // also allow '\v' '\f'?
2480 bc_error_fmt("illegal character 0x%02x", c);
2486 static void bc_read_line(BcVec *vec, FILE *fp)
2489 bc_vec_pop_all(vec);
2492 #if ENABLE_FEATURE_BC_SIGNALS
2493 if (G_interrupt) { // ^C was pressed
2496 // ^C while running a script (bc SCRIPT): die.
2497 // We do not return to interactive prompt:
2498 // user might be running us from a shell,
2499 // and SCRIPT might be intended to terminate
2500 // (e.g. contain a "halt" stmt).
2501 // ^C dropping user into a bc prompt instead of
2502 // the shell would be unexpected.
2505 // ^C while interactive input
2507 // GNU bc says "interrupted execution."
2508 // GNU dc says "Interrupt!"
2509 fputs("\ninterrupted execution\n", stderr);
2512 # if ENABLE_FEATURE_EDITING
2513 if (G_ttyin && fp == stdin) {
2515 # define line_buf bb_common_bufsiz1
2516 n = read_line_input(G.line_input_state, "", line_buf, COMMON_BUFSIZE);
2517 if (n <= 0) { // read errors or EOF, or ^D, or ^C
2520 bc_vec_pushZeroByte(vec); // ^D or EOF (or error)
2525 char c = line_buf[i++];
2527 if (bad_input_byte(c)) goto again;
2529 bc_vec_string(vec, n, line_buf);
2539 #if ENABLE_FEATURE_BC_SIGNALS
2541 // ^C was pressed: ignore entire line, get another one
2542 bc_vec_pop_all(vec);
2546 do c = fgetc(fp); while (c == '\0');
2549 bb_perror_msg_and_die("input error");
2550 // Note: EOF does not append '\n'
2553 bad_chars |= bad_input_byte(c);
2554 bc_vec_pushByte(vec, (char)c);
2555 } while (c != '\n');
2558 // Bad chars on this line
2559 if (!G.prs.lex_filename) { // stdin
2560 // ignore entire line, get another one
2563 bb_perror_msg_and_die("file '%s' is not text", G.prs.lex_filename);
2565 bc_vec_pushZeroByte(vec);
2573 static bool bc_num_strValid(const char *val, size_t base)
2578 b = (BcDig)(base <= 10 ? base + '0' : base - 10 + 'A');
2585 if (radix) return false;
2589 if (c < '0' || c >= b || (c > '9' && c < 'A'))
2595 // Note: n is already "bc_num_zero()"ed,
2596 // leading zeroes in "val" are removed
2597 static void bc_num_parseDecimal(BcNum *n, const char *val)
2606 bc_num_expand(n, len);
2608 ptr = strchr(val, '.');
2612 n->rdx = (size_t)((val + len) - (ptr + 1));
2614 for (i = 0; val[i]; ++i) {
2615 if (val[i] != '0' && val[i] != '.') {
2616 // Not entirely zero value - convert it, and exit
2619 n->num[n->len] = val[i] - '0';
2623 if (val[--i] == '.') goto skip_dot;
2628 // if for() exits without hitting if(), the value is entirely zero
2631 // Note: n is already "bc_num_zero()"ed,
2632 // leading zeroes in "val" are removed
2633 static void bc_num_parseBase(BcNum *n, const char *val, unsigned base_t)
2636 BcNum temp, mult, result;
2638 BcDig base_digs[ULONG_NUM_BUFSIZE];
2643 for (i = 0; ; ++i) {
2646 if (val[i] != '.' && val[i] != '0')
2650 bc_num_init_DEF_SIZE(&temp);
2651 bc_num_init_DEF_SIZE(&mult);
2652 base.cap = ARRAY_SIZE(base_digs);
2653 base.num = base_digs;
2654 bc_num_ulong2num(&base, base_t);
2658 if (c == '\0') goto int_err;
2659 if (c == '.') break;
2661 v = (unsigned long) (c <= '9' ? c - '0' : c - 'A' + 10);
2663 s = zbc_num_mul(n, &base, &mult, 0);
2664 if (s) goto int_err;
2665 bc_num_ulong2num(&temp, v);
2666 s = zbc_num_add(&mult, &temp, n, 0);
2667 if (s) goto int_err;
2670 bc_num_init(&result, base.len);
2671 //bc_num_zero(&result); - already is
2677 if (c == '\0') break;
2680 v = (unsigned long) (c <= '9' ? c - '0' : c - 'A' + 10);
2682 s = zbc_num_mul(&result, &base, &result, 0);
2684 bc_num_ulong2num(&temp, v);
2685 s = zbc_num_add(&result, &temp, &result, 0);
2687 s = zbc_num_mul(&mult, &base, &mult, 0);
2691 s = zbc_num_div(&result, &mult, &result, digits);
2693 s = zbc_num_add(n, &result, n, digits);
2697 if (n->rdx < digits)
2698 bc_num_extend(n, digits - n->rdx);
2702 bc_num_free(&result);
2708 static BC_STATUS zbc_num_parse(BcNum *n, const char *val, unsigned base_t)
2710 if (!bc_num_strValid(val, base_t))
2711 RETURN_STATUS(bc_error("bad number string"));
2714 while (*val == '0') val++;
2717 bc_num_parseDecimal(n, val);
2719 bc_num_parseBase(n, val, base_t);
2721 RETURN_STATUS(BC_STATUS_SUCCESS);
2723 #define zbc_num_parse(...) (zbc_num_parse(__VA_ARGS__) COMMA_SUCCESS)
2725 static bool bc_lex_more_input(void)
2727 BcParse *p = &G.prs;
2729 bc_vec_pop_all(&G.input_buffer);
2731 bc_read_line(&G.input_buffer, G.prs.lex_input_fp);
2733 p->lex_inbuf = G.input_buffer.v;
2734 // bb_error_msg("G.input_buffer.len:%d '%s'", G.input_buffer.len, G.input_buffer.v);
2736 return G.input_buffer.len > 1;
2739 // p->lex_inbuf points to the current string to be parsed.
2740 // if p->lex_inbuf points to '\0', it's either EOF or it points after
2741 // last processed line's terminating '\n' (and more reading needs to be done
2742 // to get next character).
2744 // If you are in a situation where that is a possibility, call peek_inbuf().
2745 // If necessary, it performs more reading and changes p->lex_inbuf,
2746 // then it returns *p->lex_inbuf (which will be '\0' only if it's EOF).
2747 // After it, just referencing *p->lex_inbuf is valid, and if it wasn't '\0',
2748 // it's ok to do p->lex_inbuf++ once without end-of-buffer checking.
2750 // eat_inbuf() is equvalent to "peek_inbuf(); if (c) p->lex_inbuf++":
2751 // it returns current char and advances the pointer (if not EOF).
2752 // After eat_inbuf(), referencing p->lex_inbuf[-1] and *p->lex_inbuf is valid.
2754 // In many cases, you can use fast *p->lex_inbuf instead of peek_inbuf():
2755 // unless prev char might have been '\n', *p->lex_inbuf is '\0' ONLY
2756 // on real EOF, not end-of-buffer.
2758 // bc cases to test interactively:
2759 // 1 #comment\ - prints "1<newline>" at once (comment is not continued)
2760 // 1 #comment/* - prints "1<newline>" at once
2761 // 1 #comment" - prints "1<newline>" at once
2762 // 1\#comment - error at once (\ is not a line continuation)
2763 // 1 + /*"*/2 - prints "3<newline>" at once
2764 // 1 + /*#*/2 - prints "3<newline>" at once
2765 // "str\" - prints "str\" at once
2766 // "str#" - prints "str#" at once
2767 // "str/*" - prints "str/*" at once
2768 // "str#\ - waits for second line
2769 // end" - ...prints "str#\<newline>end"
2770 static char peek_inbuf(void)
2772 if (*G.prs.lex_inbuf == '\0') {
2773 if (G.prs.lex_input_fp)
2774 if (!bc_lex_more_input())
2775 G.prs.lex_input_fp = NULL;
2777 return *G.prs.lex_inbuf;
2779 static char eat_inbuf(void)
2781 char c = peek_inbuf();
2782 if (c) G.prs.lex_inbuf++;
2786 static void bc_lex_lineComment(void)
2788 BcParse *p = &G.prs;
2791 // Try: echo -n '#foo' | bc
2792 p->lex = XC_LEX_WHITESPACE;
2794 // We depend here on input being done in whole lines:
2795 // '\0' which isn't the EOF can only be seen after '\n'.
2796 while ((c = *p->lex_inbuf) != '\n' && c != '\0')
2800 static void bc_lex_whitespace(void)
2802 BcParse *p = &G.prs;
2804 p->lex = XC_LEX_WHITESPACE;
2806 // We depend here on input being done in whole lines:
2807 // '\0' which isn't the EOF can only be seen after '\n'.
2808 char c = *p->lex_inbuf;
2809 if (c == '\n') // this is XC_LEX_NLINE, not XC_LEX_WHITESPACE
2817 static BC_STATUS zbc_lex_number(char last)
2819 BcParse *p = &G.prs;
2822 bc_vec_pop_all(&p->lex_strnumbuf);
2823 bc_vec_pushByte(&p->lex_strnumbuf, last);
2826 p->lex = XC_LEX_NUMBER;
2828 // We depend here on input being done in whole lines:
2829 // '\0' which isn't the EOF can only be seen after '\n'.
2830 char c = *p->lex_inbuf;
2834 if (c == '\\' && p->lex_inbuf[1] == '\n') {
2837 c = peek_inbuf(); // force next line to be read
2840 if (!isdigit(c) && (c < 'A' || c > 'F')) {
2841 if (c != '.') break;
2842 // if '.' was already seen, stop on second one:
2846 // c is one of "0-9A-F."
2848 bc_vec_push(&p->lex_strnumbuf, p->lex_inbuf);
2851 if (last == '.') // remove trailing '.' if any
2852 bc_vec_pop(&p->lex_strnumbuf);
2853 bc_vec_pushZeroByte(&p->lex_strnumbuf);
2855 G.err_line = G.prs.lex_line;
2856 RETURN_STATUS(BC_STATUS_SUCCESS);
2858 #define zbc_lex_number(...) (zbc_lex_number(__VA_ARGS__) COMMA_SUCCESS)
2860 static void bc_lex_name(void)
2862 BcParse *p = &G.prs;
2866 p->lex = XC_LEX_NAME;
2868 // Since names can't cross lines with \<newline>,
2869 // we depend on the fact that whole line is in the buffer
2871 buf = p->lex_inbuf - 1;
2874 if ((c < 'a' || c > 'z') && !isdigit(c) && c != '_') break;
2878 #if 0 // We do not protect against people with gigabyte-long names
2879 // This check makes sense only if size_t is (much) larger than BC_MAX_STRING.
2880 if (SIZE_MAX > (BC_MAX_STRING | 0xff)) {
2881 if (i > BC_MAX_STRING)
2882 return bc_error("name too long: must be [1,"BC_MAX_STRING_STR"]");
2885 bc_vec_string(&p->lex_strnumbuf, i, buf);
2887 // Increment the index. We minus 1 because it has already been incremented.
2888 p->lex_inbuf += i - 1;
2890 //return BC_STATUS_SUCCESS;
2893 IF_BC(static BC_STATUS zbc_lex_token(void);)
2894 IF_DC(static BC_STATUS zdc_lex_token(void);)
2895 #define zbc_lex_token(...) (zbc_lex_token(__VA_ARGS__) COMMA_SUCCESS)
2896 #define zdc_lex_token(...) (zdc_lex_token(__VA_ARGS__) COMMA_SUCCESS)
2898 static BC_STATUS zbc_lex_next(void)
2900 BcParse *p = &G.prs;
2903 p->lex_last = p->lex;
2905 // if (p->lex_last == XC_LEX_EOF)
2906 // RETURN_STATUS(bc_error("end of file"));
2908 // Loop until failure or we don't have whitespace. This
2909 // is so the parser doesn't get inundated with whitespace.
2910 // Comments are also XC_LEX_WHITESPACE tokens and eaten here.
2911 s = BC_STATUS_SUCCESS;
2913 if (*p->lex_inbuf == '\0') {
2914 p->lex = XC_LEX_EOF;
2915 if (peek_inbuf() == '\0')
2916 RETURN_STATUS(BC_STATUS_SUCCESS);
2918 p->lex_next_at = p->lex_inbuf;
2919 dbg_lex("next string to parse:'%.*s'",
2920 (int)(strchrnul(p->lex_next_at, '\n') - p->lex_next_at),
2924 IF_BC(s = zbc_lex_token());
2926 IF_DC(s = zdc_lex_token());
2928 } while (!s && p->lex == XC_LEX_WHITESPACE);
2929 dbg_lex("p->lex from string:%d", p->lex);
2933 #define zbc_lex_next(...) (zbc_lex_next(__VA_ARGS__) COMMA_SUCCESS)
2936 static BC_STATUS zbc_lex_skip_if_at_NLINE(void)
2938 if (G.prs.lex == XC_LEX_NLINE)
2939 RETURN_STATUS(zbc_lex_next());
2940 RETURN_STATUS(BC_STATUS_SUCCESS);
2942 #define zbc_lex_skip_if_at_NLINE(...) (zbc_lex_skip_if_at_NLINE(__VA_ARGS__) COMMA_SUCCESS)
2944 static BC_STATUS zbc_lex_next_and_skip_NLINE(void)
2948 if (s) RETURN_STATUS(s);
2949 // if(cond)<newline>stmt is accepted too (but not 2+ newlines)
2950 s = zbc_lex_skip_if_at_NLINE();
2953 #define zbc_lex_next_and_skip_NLINE(...) (zbc_lex_next_and_skip_NLINE(__VA_ARGS__) COMMA_SUCCESS)
2956 static BC_STATUS zbc_lex_text_init(const char *text)
2958 G.prs.lex_inbuf = text;
2959 G.prs.lex = G.prs.lex_last = XC_LEX_INVALID;
2960 RETURN_STATUS(zbc_lex_next());
2962 #define zbc_lex_text_init(...) (zbc_lex_text_init(__VA_ARGS__) COMMA_SUCCESS)
2965 static BC_STATUS zbc_lex_identifier(void)
2967 BcParse *p = &G.prs;
2970 const char *buf = p->lex_inbuf - 1;
2972 for (i = 0; i < ARRAY_SIZE(bc_lex_kws); ++i) {
2973 const char *keyword8 = bc_lex_kws[i].name8;
2975 while (buf[j] != '\0' && buf[j] == keyword8[j]) {
2977 if (j == 8) goto match;
2979 if (keyword8[j] != '\0')
2982 // buf starts with keyword bc_lex_kws[i]
2983 if (isalnum(buf[j]) || buf[j]=='_')
2984 continue; // "ifz" does not match "if" keyword, "if." does
2985 p->lex = BC_LEX_KEY_1st_keyword + i;
2986 if (!keyword_is_POSIX(i)) {
2987 s = zbc_posix_error_fmt("%sthe '%.8s' keyword", "POSIX does not allow ", bc_lex_kws[i].name8);
2988 if (s) RETURN_STATUS(s);
2991 // We minus 1 because the index has already been incremented.
2992 p->lex_inbuf += j - 1;
2993 RETURN_STATUS(BC_STATUS_SUCCESS);
2997 s = BC_STATUS_SUCCESS;
2999 if (p->lex_strnumbuf.len > 2) {
3002 // bc: POSIX only allows one character names; this is bad: 'qwe=1
3004 unsigned len = strchrnul(buf, '\n') - buf;
3005 s = zbc_posix_error_fmt("POSIX only allows one character names; this is bad: '%.*s'", len, buf);
3010 #define zbc_lex_identifier(...) (zbc_lex_identifier(__VA_ARGS__) COMMA_SUCCESS)
3012 static BC_STATUS zbc_lex_string(void)
3014 BcParse *p = &G.prs;
3016 p->lex = XC_LEX_STR;
3017 bc_vec_pop_all(&p->lex_strnumbuf);
3019 char c = peek_inbuf(); // strings can cross lines
3021 RETURN_STATUS(bc_error("unterminated string1"));
3027 bc_vec_push(&p->lex_strnumbuf, p->lex_inbuf);
3030 bc_vec_pushZeroByte(&p->lex_strnumbuf);
3033 G.err_line = p->lex_line;
3034 RETURN_STATUS(BC_STATUS_SUCCESS);
3036 #define zbc_lex_string(...) (zbc_lex_string(__VA_ARGS__) COMMA_SUCCESS)
3038 static void parse_lex_by_checking_eq_sign(unsigned with_and_without)
3040 BcParse *p = &G.prs;
3041 if (*p->lex_inbuf == '=') {
3042 // ^^^ not using peek_inbuf() since '==' etc can't be split across lines
3044 with_and_without >>= 8; // store "with" value
3045 } // else store "without" value
3046 p->lex = (with_and_without & 0xff);
3048 #define parse_lex_by_checking_eq_sign(with, without) \
3049 parse_lex_by_checking_eq_sign(((with)<<8)|(without))
3051 static BC_STATUS zbc_lex_comment(void)
3053 BcParse *p = &G.prs;
3055 p->lex = XC_LEX_WHITESPACE;
3056 // here lex_inbuf is at '*' of opening comment delimiter
3071 RETURN_STATUS(bc_error("unterminated comment"));
3076 p->lex_inbuf++; // skip trailing '/'
3078 G.err_line = p->lex_line;
3079 RETURN_STATUS(BC_STATUS_SUCCESS);
3081 #define zbc_lex_comment(...) (zbc_lex_comment(__VA_ARGS__) COMMA_SUCCESS)
3083 #undef zbc_lex_token
3084 static BC_STATUS zbc_lex_token(void)
3086 BcParse *p = &G.prs;
3087 BcStatus s = BC_STATUS_SUCCESS;
3088 char c = eat_inbuf();
3091 // This is the workhorse of the lexer.
3093 // case '\0': // probably never reached
3095 // p->lex = XC_LEX_EOF;
3099 p->lex = XC_LEX_NLINE;
3106 bc_lex_whitespace();
3109 parse_lex_by_checking_eq_sign(XC_LEX_OP_REL_NE, BC_LEX_OP_BOOL_NOT);
3110 if (p->lex == BC_LEX_OP_BOOL_NOT) {
3111 s = zbc_POSIX_does_not_allow_bool_ops_this_is_bad("!");
3112 if (s) RETURN_STATUS(s);
3116 s = zbc_lex_string();
3119 s = zbc_POSIX_does_not_allow("'#' script comments");
3120 if (s) RETURN_STATUS(s);
3121 bc_lex_lineComment();
3124 parse_lex_by_checking_eq_sign(BC_LEX_OP_ASSIGN_MODULUS, XC_LEX_OP_MODULUS);
3129 s = zbc_POSIX_does_not_allow_bool_ops_this_is_bad("&&");
3130 if (s) RETURN_STATUS(s);
3132 p->lex = BC_LEX_OP_BOOL_AND;
3134 p->lex = XC_LEX_INVALID;
3135 s = bc_error_bad_character('&');
3140 p->lex = (BcLexType)(c - '(' + BC_LEX_LPAREN);
3143 parse_lex_by_checking_eq_sign(BC_LEX_OP_ASSIGN_MULTIPLY, XC_LEX_OP_MULTIPLY);
3149 p->lex = BC_LEX_OP_INC;
3151 parse_lex_by_checking_eq_sign(BC_LEX_OP_ASSIGN_PLUS, XC_LEX_OP_PLUS);
3154 p->lex = BC_LEX_COMMA;
3160 p->lex = BC_LEX_OP_DEC;
3162 parse_lex_by_checking_eq_sign(BC_LEX_OP_ASSIGN_MINUS, XC_LEX_OP_MINUS);
3165 if (isdigit(*p->lex_inbuf))
3166 s = zbc_lex_number(c);
3168 p->lex = BC_LEX_KEY_LAST;
3169 s = zbc_POSIX_does_not_allow("'.' as 'last'");
3175 s = zbc_lex_comment();
3177 parse_lex_by_checking_eq_sign(BC_LEX_OP_ASSIGN_DIVIDE, XC_LEX_OP_DIVIDE);
3195 s = zbc_lex_number(c);
3198 p->lex = BC_LEX_SCOLON;
3201 parse_lex_by_checking_eq_sign(XC_LEX_OP_REL_LE, XC_LEX_OP_REL_LT);
3204 parse_lex_by_checking_eq_sign(XC_LEX_OP_REL_EQ, BC_LEX_OP_ASSIGN);
3207 parse_lex_by_checking_eq_sign(XC_LEX_OP_REL_GE, XC_LEX_OP_REL_GT);
3211 p->lex = (BcLexType)(c - '[' + BC_LEX_LBRACKET);
3214 if (*p->lex_inbuf == '\n') {
3215 p->lex = XC_LEX_WHITESPACE;
3218 s = bc_error_bad_character(c);
3221 parse_lex_by_checking_eq_sign(BC_LEX_OP_ASSIGN_POWER, XC_LEX_OP_POWER);
3249 s = zbc_lex_identifier();
3253 p->lex = (BcLexType)(c - '{' + BC_LEX_LBRACE);
3258 s = zbc_POSIX_does_not_allow_bool_ops_this_is_bad("||");
3259 if (s) RETURN_STATUS(s);
3261 p->lex = BC_LEX_OP_BOOL_OR;
3263 p->lex = XC_LEX_INVALID;
3264 s = bc_error_bad_character(c);
3268 p->lex = XC_LEX_INVALID;
3269 s = bc_error_bad_character(c);
3275 #define zbc_lex_token(...) (zbc_lex_token(__VA_ARGS__) COMMA_SUCCESS)
3279 static BC_STATUS zdc_lex_register(void)
3281 BcParse *p = &G.prs;
3282 if (G_exreg && isspace(*p->lex_inbuf)) {
3283 bc_lex_whitespace(); // eats whitespace (but not newline)
3284 p->lex_inbuf++; // bc_lex_name() expects this
3287 bc_vec_pop_all(&p->lex_strnumbuf);
3288 bc_vec_push(&p->lex_strnumbuf, p->lex_inbuf++);
3289 bc_vec_pushZeroByte(&p->lex_strnumbuf);
3290 p->lex = XC_LEX_NAME;
3293 RETURN_STATUS(BC_STATUS_SUCCESS);
3295 #define zdc_lex_register(...) (zdc_lex_register(__VA_ARGS__) COMMA_SUCCESS)
3297 static BC_STATUS zdc_lex_string(void)
3299 BcParse *p = &G.prs;
3302 p->lex = XC_LEX_STR;
3303 bc_vec_pop_all(&p->lex_strnumbuf);
3307 char c = peek_inbuf();
3309 RETURN_STATUS(bc_error("unterminated string"));
3311 if (c == '[') depth++;
3317 bc_vec_push(&p->lex_strnumbuf, p->lex_inbuf);
3320 bc_vec_pushZeroByte(&p->lex_strnumbuf);
3321 p->lex_inbuf++; // skip trailing ']'
3323 G.err_line = p->lex_line;
3324 RETURN_STATUS(BC_STATUS_SUCCESS);
3326 #define zdc_lex_string(...) (zdc_lex_string(__VA_ARGS__) COMMA_SUCCESS)
3328 #undef zdc_lex_token
3329 static BC_STATUS zdc_lex_token(void)
3331 BcParse *p = &G.prs;
3332 static const //BcLexType - should be this type, but narrower type saves size:
3335 XC_LEX_OP_REL_EQ, XC_LEX_OP_REL_LE, XC_LEX_OP_REL_GE, XC_LEX_OP_REL_NE,
3336 XC_LEX_OP_REL_LT, XC_LEX_OP_REL_GT, DC_LEX_SCOLON, DC_LEX_COLON,
3337 DC_LEX_ELSE, DC_LEX_LOAD, DC_LEX_LOAD_POP, DC_LEX_OP_ASSIGN,
3345 for (i = 0; i < ARRAY_SIZE(dc_lex_regs); ++i) {
3346 if (p->lex_last == dc_lex_regs[i])
3347 RETURN_STATUS(zdc_lex_register());
3350 s = BC_STATUS_SUCCESS;
3352 if (c >= '%' && c <= '~'
3353 && (p->lex = dc_char_to_LEX[c - '%']) != XC_LEX_INVALID
3358 // This is the workhorse of the lexer.
3360 // case '\0': // probably never reached
3361 // p->lex = XC_LEX_EOF;
3364 // '\n' is XC_LEX_NLINE, not XC_LEX_WHITESPACE
3365 // (and "case '\n':" is not just empty here)
3366 // only to allow interactive dc have a way to exit
3367 // "parse" stage of "parse,execute" loop
3368 // on <enter>, not on _next_ token (which would mean
3369 // commands are not executed on pressing <enter>).
3370 // IOW: typing "1p<enter>" should print "1" _at once_,
3371 // not after some more input.
3373 p->lex = XC_LEX_NLINE;
3380 bc_lex_whitespace();
3385 p->lex = XC_LEX_OP_REL_NE;
3387 p->lex = XC_LEX_OP_REL_LE;
3389 p->lex = XC_LEX_OP_REL_GE;
3391 RETURN_STATUS(bc_error_bad_character(c));
3395 bc_lex_lineComment();
3398 if (isdigit(*p->lex_inbuf))
3399 s = zbc_lex_number(c);
3401 s = bc_error_bad_character(c);
3419 s = zbc_lex_number(c);
3422 s = zdc_lex_string();
3425 p->lex = XC_LEX_INVALID;
3426 s = bc_error_bad_character(c);
3432 #define zdc_lex_token(...) (zdc_lex_token(__VA_ARGS__) COMMA_SUCCESS)
3435 static void bc_parse_push(char i)
3437 BcParse *p = &G.prs;
3438 dbg_compile("%s:%d pushing bytecode %zd:%d", __func__, __LINE__, p->func->code.len, i);
3439 bc_vec_pushByte(&p->func->code, i);
3442 static void bc_parse_pushName(char *name)
3445 bc_parse_push(*name++);
3446 bc_parse_push(BC_PARSE_STREND);
3449 static void bc_parse_pushIndex(size_t idx)
3454 dbg_lex("%s:%d pushing index %zd", __func__, __LINE__, idx);
3455 mask = ((size_t)0xff) << (sizeof(idx) * 8 - 8);
3458 if (idx & mask) break;
3466 bc_parse_push((unsigned char)idx);
3472 static void bc_parse_pushJUMP(size_t idx)
3474 bc_parse_push(BC_INST_JUMP);
3475 bc_parse_pushIndex(idx);
3478 static void bc_parse_pushJUMP_ZERO(size_t idx)
3480 bc_parse_push(BC_INST_JUMP_ZERO);
3481 bc_parse_pushIndex(idx);
3484 static BC_STATUS zbc_parse_pushSTR(void)
3486 BcParse *p = &G.prs;
3487 char *str = xstrdup(p->lex_strnumbuf.v);
3489 bc_parse_push(XC_INST_STR);
3490 bc_parse_pushIndex(p->func->strs.len);
3491 bc_vec_push(&p->func->strs, &str);
3493 RETURN_STATUS(zbc_lex_next());
3495 #define zbc_parse_pushSTR(...) (zbc_parse_pushSTR(__VA_ARGS__) COMMA_SUCCESS)
3498 static void bc_parse_pushNUM(void)
3500 BcParse *p = &G.prs;
3501 char *num = xstrdup(p->lex_strnumbuf.v);
3502 #if ENABLE_BC && ENABLE_DC
3503 size_t idx = bc_vec_push(IS_BC ? &p->func->consts : &G.prog.consts, &num);
3505 size_t idx = bc_vec_push(&p->func->consts, &num);
3507 size_t idx = bc_vec_push(&G.prog.consts, &num);
3509 bc_parse_push(XC_INST_NUM);
3510 bc_parse_pushIndex(idx);
3513 static BC_STATUS zbc_parse_text_init(const char *text)
3515 BcParse *p = &G.prs;
3516 p->func = bc_program_func(p->fidx);
3518 RETURN_STATUS(zbc_lex_text_init(text));
3520 #define zbc_parse_text_init(...) (zbc_parse_text_init(__VA_ARGS__) COMMA_SUCCESS)
3522 // Called when parsing or execution detects a failure,
3523 // resets execution structures.
3524 static void bc_program_reset(void)
3529 bc_vec_npop(&G.prog.exestack, G.prog.exestack.len - 1);
3530 bc_vec_pop_all(&G.prog.results);
3532 f = bc_program_func_BC_PROG_MAIN();
3533 ip = bc_vec_top(&G.prog.exestack);
3534 ip->inst_idx = f->code.len;
3537 // Called when parsing code detects a failure,
3538 // resets parsing structures.
3539 static void bc_parse_reset(void)
3541 BcParse *p = &G.prs;
3542 if (p->fidx != BC_PROG_MAIN) {
3543 bc_func_free(p->func);
3544 bc_func_init(p->func);
3546 p->fidx = BC_PROG_MAIN;
3547 p->func = bc_program_func_BC_PROG_MAIN();
3550 p->lex_inbuf += strlen(p->lex_inbuf);
3551 p->lex = XC_LEX_EOF;
3553 IF_BC(bc_vec_pop_all(&p->exits);)
3554 IF_BC(bc_vec_pop_all(&p->conds);)
3555 IF_BC(bc_vec_pop_all(&p->ops);)
3560 static void bc_parse_free(void)
3562 IF_BC(BcParse *p = &G.prs;)
3563 IF_BC(bc_vec_free(&p->exits);)
3564 IF_BC(bc_vec_free(&p->conds);)
3565 IF_BC(bc_vec_free(&p->ops);)
3566 bc_vec_free(&G.prs.lex_strnumbuf);
3569 static void bc_parse_create(size_t fidx)
3571 BcParse *p = &G.prs;
3572 memset(p, 0, sizeof(BcParse));
3574 bc_char_vec_init(&G.prs.lex_strnumbuf);
3575 IF_BC(bc_vec_init(&p->exits, sizeof(size_t), NULL);)
3576 IF_BC(bc_vec_init(&p->conds, sizeof(size_t), NULL);)
3577 IF_BC(bc_vec_init(&p->ops, sizeof(BcLexType), NULL);)
3580 p->func = bc_program_func(fidx);
3583 static void bc_program_add_fn(void)
3589 bc_vec_push(&G.prog.fns, &f);
3595 // Note: takes ownership of 'name' (must be malloced)
3596 static size_t bc_program_addFunc(char *name)
3599 BcId entry, *entry_ptr;
3603 entry.idx = G.prog.fns.len;
3605 inserted = bc_map_insert(&G.prog.fn_map, &entry, &idx);
3606 if (!inserted) free(name);
3608 entry_ptr = bc_vec_item(&G.prog.fn_map, idx);
3609 idx = entry_ptr->idx;
3612 // There is already a function with this name.
3613 // It'll be redefined now, clear old definition.
3614 BcFunc *func = bc_program_func(entry_ptr->idx);
3618 bc_program_add_fn();
3624 #define BC_PARSE_TOP_OP(p) (*(BcLexType*)bc_vec_top(&(p)->ops))
3625 // We can calculate the conversion between tokens and exprs by subtracting the
3626 // position of the first operator in the lex enum and adding the position of the
3627 // first in the expr enum. Note: This only works for binary operators.
3628 #define BC_TOKEN_2_INST(t) ((char) ((t) - XC_LEX_OP_POWER + XC_INST_POWER))
3630 static BcStatus bc_parse_expr_empty_ok(uint8_t flags);
3632 static BC_STATUS zbc_parse_expr(uint8_t flags)
3636 s = bc_parse_expr_empty_ok(flags);
3637 if (s == BC_STATUS_PARSE_EMPTY_EXP)
3638 RETURN_STATUS(bc_error("empty expression"));
3641 #define zbc_parse_expr(...) (zbc_parse_expr(__VA_ARGS__) COMMA_SUCCESS)
3643 static BC_STATUS zbc_parse_stmt_possibly_auto(bool auto_allowed);
3644 #define zbc_parse_stmt_possibly_auto(...) (zbc_parse_stmt_possibly_auto(__VA_ARGS__) COMMA_SUCCESS)
3646 static BC_STATUS zbc_parse_stmt(void)
3648 RETURN_STATUS(zbc_parse_stmt_possibly_auto(false));
3650 #define zbc_parse_stmt(...) (zbc_parse_stmt(__VA_ARGS__) COMMA_SUCCESS)
3652 static BC_STATUS zbc_parse_stmt_allow_NLINE_before(const char *after_X)
3654 BcParse *p = &G.prs;
3655 // "if(cond)<newline>stmt" is accepted too, but not 2+ newlines.
3656 // Same for "else", "while()", "for()".
3657 BcStatus s = zbc_lex_next_and_skip_NLINE();
3658 if (s) RETURN_STATUS(s);
3659 if (p->lex == XC_LEX_NLINE)
3660 RETURN_STATUS(bc_error_fmt("no statement after '%s'", after_X));
3662 RETURN_STATUS(zbc_parse_stmt());
3664 #define zbc_parse_stmt_allow_NLINE_before(...) (zbc_parse_stmt_allow_NLINE_before(__VA_ARGS__) COMMA_SUCCESS)
3666 static void bc_parse_operator(BcLexType type, size_t start, size_t *nexprs)
3668 BcParse *p = &G.prs;
3669 char l, r = bc_parse_op_PREC(type - XC_LEX_1st_op);
3670 bool left = bc_parse_op_LEFT(type - XC_LEX_1st_op);
3672 while (p->ops.len > start) {
3673 BcLexType t = BC_PARSE_TOP_OP(p);
3674 if (t == BC_LEX_LPAREN) break;
3676 l = bc_parse_op_PREC(t - XC_LEX_1st_op);
3677 if (l >= r && (l != r || !left)) break;
3679 bc_parse_push(BC_TOKEN_2_INST(t));
3680 bc_vec_pop(&p->ops);
3681 *nexprs -= (t != BC_LEX_OP_BOOL_NOT && t != XC_LEX_NEG);
3684 bc_vec_push(&p->ops, &type);
3687 static BC_STATUS zbc_parse_rightParen(size_t ops_bgn, size_t *nexs)
3689 BcParse *p = &G.prs;
3692 if (p->ops.len <= ops_bgn)
3693 RETURN_STATUS(bc_error_bad_expression());
3694 top = BC_PARSE_TOP_OP(p);
3696 while (top != BC_LEX_LPAREN) {
3697 bc_parse_push(BC_TOKEN_2_INST(top));
3699 bc_vec_pop(&p->ops);
3700 *nexs -= (top != BC_LEX_OP_BOOL_NOT && top != XC_LEX_NEG);
3702 if (p->ops.len <= ops_bgn)
3703 RETURN_STATUS(bc_error_bad_expression());
3704 top = BC_PARSE_TOP_OP(p);
3707 bc_vec_pop(&p->ops);
3709 RETURN_STATUS(BC_STATUS_SUCCESS);
3711 #define zbc_parse_rightParen(...) (zbc_parse_rightParen(__VA_ARGS__) COMMA_SUCCESS)
3713 static BC_STATUS zbc_parse_params(uint8_t flags)
3715 BcParse *p = &G.prs;
3719 dbg_lex("%s:%d p->lex:%d", __func__, __LINE__, p->lex);
3720 flags = (flags & ~(BC_PARSE_PRINT | BC_PARSE_REL)) | BC_PARSE_ARRAY;
3723 if (s) RETURN_STATUS(s);
3726 if (p->lex != BC_LEX_RPAREN) {
3728 s = zbc_parse_expr(flags);
3729 if (s) RETURN_STATUS(s);
3731 if (p->lex != BC_LEX_COMMA) {
3732 if (p->lex == BC_LEX_RPAREN)
3734 RETURN_STATUS(bc_error_bad_token());
3737 if (s) RETURN_STATUS(s);
3741 bc_parse_push(BC_INST_CALL);
3742 bc_parse_pushIndex(nparams);
3744 RETURN_STATUS(BC_STATUS_SUCCESS);
3746 #define zbc_parse_params(...) (zbc_parse_params(__VA_ARGS__) COMMA_SUCCESS)
3748 // Note: takes ownership of 'name' (must be malloced)
3749 static BC_STATUS zbc_parse_call(char *name, uint8_t flags)
3751 BcParse *p = &G.prs;
3753 BcId entry, *entry_ptr;
3758 s = zbc_parse_params(flags);
3761 if (p->lex != BC_LEX_RPAREN) {
3762 s = bc_error_bad_token();
3766 idx = bc_map_find_exact(&G.prog.fn_map, &entry);
3768 if (idx == BC_VEC_INVALID_IDX) {
3769 // No such function exists, create an empty one
3770 bc_program_addFunc(name);
3771 idx = bc_map_find_exact(&G.prog.fn_map, &entry);
3775 entry_ptr = bc_vec_item(&G.prog.fn_map, idx);
3776 bc_parse_pushIndex(entry_ptr->idx);
3778 RETURN_STATUS(zbc_lex_next());
3783 #define zbc_parse_call(...) (zbc_parse_call(__VA_ARGS__) COMMA_SUCCESS)
3785 static BC_STATUS zbc_parse_name(BcInst *type, uint8_t flags)
3787 BcParse *p = &G.prs;
3791 name = xstrdup(p->lex_strnumbuf.v);
3795 if (p->lex == BC_LEX_LBRACKET) {
3799 if (p->lex == BC_LEX_RBRACKET) {
3800 if (!(flags & BC_PARSE_ARRAY)) {
3801 s = bc_error_bad_expression();
3804 *type = XC_INST_ARRAY;
3806 *type = XC_INST_ARRAY_ELEM;
3807 flags &= ~(BC_PARSE_PRINT | BC_PARSE_REL);
3808 s = zbc_parse_expr(flags);
3813 bc_parse_push(*type);
3814 bc_parse_pushName(name);
3816 } else if (p->lex == BC_LEX_LPAREN) {
3817 if (flags & BC_PARSE_NOCALL) {
3818 s = bc_error_bad_token();
3821 *type = BC_INST_CALL;
3822 s = zbc_parse_call(name, flags);
3824 *type = XC_INST_VAR;
3825 bc_parse_push(XC_INST_VAR);
3826 bc_parse_pushName(name);
3835 #define zbc_parse_name(...) (zbc_parse_name(__VA_ARGS__) COMMA_SUCCESS)
3837 static BC_STATUS zbc_parse_read(void)
3839 BcParse *p = &G.prs;
3843 if (s) RETURN_STATUS(s);
3844 if (p->lex != BC_LEX_LPAREN) RETURN_STATUS(bc_error_bad_token());
3847 if (s) RETURN_STATUS(s);
3848 if (p->lex != BC_LEX_RPAREN) RETURN_STATUS(bc_error_bad_token());
3850 bc_parse_push(XC_INST_READ);
3854 #define zbc_parse_read(...) (zbc_parse_read(__VA_ARGS__) COMMA_SUCCESS)
3856 static BC_STATUS zbc_parse_builtin(BcLexType type, uint8_t flags, BcInst *prev)
3858 BcParse *p = &G.prs;
3862 if (s) RETURN_STATUS(s);
3863 if (p->lex != BC_LEX_LPAREN) RETURN_STATUS(bc_error_bad_token());
3865 flags = (flags & ~(BC_PARSE_PRINT | BC_PARSE_REL)) | BC_PARSE_ARRAY;
3868 if (s) RETURN_STATUS(s);
3870 s = zbc_parse_expr(flags);
3871 if (s) RETURN_STATUS(s);
3873 if (p->lex != BC_LEX_RPAREN) RETURN_STATUS(bc_error_bad_token());
3875 *prev = (type == BC_LEX_KEY_LENGTH) ? XC_INST_LENGTH : XC_INST_SQRT;
3876 bc_parse_push(*prev);
3880 #define zbc_parse_builtin(...) (zbc_parse_builtin(__VA_ARGS__) COMMA_SUCCESS)
3882 static BC_STATUS zbc_parse_scale(BcInst *type, uint8_t flags)
3884 BcParse *p = &G.prs;
3888 if (s) RETURN_STATUS(s);
3890 if (p->lex != BC_LEX_LPAREN) {
3891 *type = XC_INST_SCALE;
3892 bc_parse_push(XC_INST_SCALE);
3893 RETURN_STATUS(BC_STATUS_SUCCESS);
3896 *type = XC_INST_SCALE_FUNC;
3897 flags &= ~(BC_PARSE_PRINT | BC_PARSE_REL);
3900 if (s) RETURN_STATUS(s);
3902 s = zbc_parse_expr(flags);
3903 if (s) RETURN_STATUS(s);
3904 if (p->lex != BC_LEX_RPAREN)
3905 RETURN_STATUS(bc_error_bad_token());
3906 bc_parse_push(XC_INST_SCALE_FUNC);
3908 RETURN_STATUS(zbc_lex_next());
3910 #define zbc_parse_scale(...) (zbc_parse_scale(__VA_ARGS__) COMMA_SUCCESS)
3912 static BC_STATUS zbc_parse_incdec(BcInst *prev, bool *paren_expr,
3913 size_t *nexprs, uint8_t flags)
3915 BcParse *p = &G.prs;
3919 BcInst etype = *prev;
3921 if (etype == XC_INST_VAR || etype == XC_INST_ARRAY_ELEM
3922 || etype == XC_INST_SCALE || etype == BC_INST_LAST
3923 || etype == XC_INST_IBASE || etype == XC_INST_OBASE
3925 *prev = inst = BC_INST_INC_POST + (p->lex != BC_LEX_OP_INC);
3926 bc_parse_push(inst);
3929 *prev = inst = BC_INST_INC_PRE + (p->lex != BC_LEX_OP_INC);
3933 if (s) RETURN_STATUS(s);
3936 // Because we parse the next part of the expression
3937 // right here, we need to increment this.
3938 *nexprs = *nexprs + 1;
3942 s = zbc_parse_name(prev, flags | BC_PARSE_NOCALL);
3944 case BC_LEX_KEY_IBASE:
3945 case BC_LEX_KEY_LAST:
3946 case BC_LEX_KEY_OBASE:
3947 bc_parse_push(type - BC_LEX_KEY_IBASE + XC_INST_IBASE);
3950 case BC_LEX_KEY_SCALE:
3952 if (s) RETURN_STATUS(s);
3953 if (p->lex == BC_LEX_LPAREN)
3954 s = bc_error_bad_token();
3956 bc_parse_push(XC_INST_SCALE);
3959 s = bc_error_bad_token();
3963 if (!s) bc_parse_push(inst);
3968 #define zbc_parse_incdec(...) (zbc_parse_incdec(__VA_ARGS__) COMMA_SUCCESS)
3971 #define BC_PARSE_LEAF(p, rparen) \
3973 || ((p) >= XC_INST_NUM && (p) <= XC_INST_SQRT) \
3974 || (p) == BC_INST_INC_POST \
3975 || (p) == BC_INST_DEC_POST \
3978 static int ok_in_expr(BcInst p)
3980 return (p >= XC_INST_NUM && p <= XC_INST_SQRT)
3981 || p == BC_INST_INC_POST
3982 || p == BC_INST_DEC_POST
3985 #define BC_PARSE_LEAF(p, rparen) ((rparen) || ok_in_expr(p))
3988 static BC_STATUS zbc_parse_minus(BcInst *prev, size_t ops_bgn,
3989 bool rparen, size_t *nexprs)
3991 BcParse *p = &G.prs;
3994 BcInst etype = *prev;
3997 if (s) RETURN_STATUS(s);
3999 type = BC_PARSE_LEAF(etype, rparen) ? XC_LEX_OP_MINUS : XC_LEX_NEG;
4000 *prev = BC_TOKEN_2_INST(type);
4002 // We can just push onto the op stack because this is the largest
4003 // precedence operator that gets pushed. Inc/dec does not.
4004 if (type != XC_LEX_OP_MINUS)
4005 bc_vec_push(&p->ops, &type);
4007 bc_parse_operator(type, ops_bgn, nexprs);
4011 #define zbc_parse_minus(...) (zbc_parse_minus(__VA_ARGS__) COMMA_SUCCESS)
4013 static BC_STATUS zbc_parse_print(void)
4015 BcParse *p = &G.prs;
4021 if (s) RETURN_STATUS(s);
4023 if (type == XC_LEX_STR) {
4024 s = zbc_parse_pushSTR();
4026 s = zbc_parse_expr(0);
4028 if (s) RETURN_STATUS(s);
4029 bc_parse_push(XC_INST_PRINT_POP);
4030 if (p->lex != BC_LEX_COMMA)
4036 #define zbc_parse_print(...) (zbc_parse_print(__VA_ARGS__) COMMA_SUCCESS)
4038 static BC_STATUS zbc_parse_return(void)
4040 BcParse *p = &G.prs;
4044 dbg_lex_enter("%s:%d entered", __func__, __LINE__);
4046 if (s) RETURN_STATUS(s);
4049 if (t == XC_LEX_NLINE || t == BC_LEX_SCOLON)
4050 bc_parse_push(BC_INST_RET0);
4052 bool paren = (t == BC_LEX_LPAREN);
4053 s = bc_parse_expr_empty_ok(0);
4054 if (s == BC_STATUS_PARSE_EMPTY_EXP) {
4055 bc_parse_push(BC_INST_RET0);
4058 if (s) RETURN_STATUS(s);
4060 if (!paren || p->lex_last != BC_LEX_RPAREN) {
4061 s = zbc_POSIX_requires("parentheses around return expressions");
4062 if (s) RETURN_STATUS(s);
4065 bc_parse_push(XC_INST_RET);
4068 dbg_lex_done("%s:%d done", __func__, __LINE__);
4071 #define zbc_parse_return(...) (zbc_parse_return(__VA_ARGS__) COMMA_SUCCESS)
4073 static void rewrite_label_to_current(size_t idx)
4075 BcParse *p = &G.prs;
4076 size_t *label = bc_vec_item(&p->func->labels, idx);
4077 *label = p->func->code.len;
4080 static BC_STATUS zbc_parse_if(void)
4082 BcParse *p = &G.prs;
4086 dbg_lex_enter("%s:%d entered", __func__, __LINE__);
4088 if (s) RETURN_STATUS(s);
4089 if (p->lex != BC_LEX_LPAREN) RETURN_STATUS(bc_error_bad_token());
4092 if (s) RETURN_STATUS(s);
4093 s = zbc_parse_expr(BC_PARSE_REL);
4094 if (s) RETURN_STATUS(s);
4095 if (p->lex != BC_LEX_RPAREN) RETURN_STATUS(bc_error_bad_token());
4097 // Encode "if zero, jump to ..."
4098 // Pushed value (destination of the jump) is uninitialized,
4099 // will be rewritten to be address of "end of if()" or of "else".
4100 ip_idx = bc_vec_push(&p->func->labels, &ip_idx);
4101 bc_parse_pushJUMP_ZERO(ip_idx);
4103 s = zbc_parse_stmt_allow_NLINE_before(STRING_if);
4104 if (s) RETURN_STATUS(s);
4106 dbg_lex("%s:%d in if after stmt: p->lex:%d", __func__, __LINE__, p->lex);
4107 if (p->lex == BC_LEX_KEY_ELSE) {
4110 // Encode "after then_stmt, jump to end of if()"
4111 ip2_idx = bc_vec_push(&p->func->labels, &ip2_idx);
4112 dbg_lex("%s:%d after if() then_stmt: BC_INST_JUMP to %zd", __func__, __LINE__, ip2_idx);
4113 bc_parse_pushJUMP(ip2_idx);
4115 dbg_lex("%s:%d rewriting 'if_zero' label to jump to 'else'-> %zd", __func__, __LINE__, p->func->code.len);
4116 rewrite_label_to_current(ip_idx);
4120 s = zbc_parse_stmt_allow_NLINE_before(STRING_else);
4121 if (s) RETURN_STATUS(s);
4124 dbg_lex("%s:%d rewriting label to jump after 'if' body-> %zd", __func__, __LINE__, p->func->code.len);
4125 rewrite_label_to_current(ip_idx);
4127 dbg_lex_done("%s:%d done", __func__, __LINE__);
4130 #define zbc_parse_if(...) (zbc_parse_if(__VA_ARGS__) COMMA_SUCCESS)
4132 static BC_STATUS zbc_parse_while(void)
4134 BcParse *p = &G.prs;
4140 if (s) RETURN_STATUS(s);
4141 if (p->lex != BC_LEX_LPAREN) RETURN_STATUS(bc_error_bad_token());
4143 if (s) RETURN_STATUS(s);
4145 cond_idx = bc_vec_push(&p->func->labels, &p->func->code.len);
4146 ip_idx = cond_idx + 1;
4147 bc_vec_push(&p->conds, &cond_idx);
4149 bc_vec_push(&p->exits, &ip_idx);
4150 bc_vec_push(&p->func->labels, &ip_idx);
4152 s = zbc_parse_expr(BC_PARSE_REL);
4153 if (s) RETURN_STATUS(s);
4154 if (p->lex != BC_LEX_RPAREN) RETURN_STATUS(bc_error_bad_token());
4156 bc_parse_pushJUMP_ZERO(ip_idx);
4158 s = zbc_parse_stmt_allow_NLINE_before(STRING_while);
4159 if (s) RETURN_STATUS(s);
4161 dbg_lex("%s:%d BC_INST_JUMP to %zd", __func__, __LINE__, cond_idx);
4162 bc_parse_pushJUMP(cond_idx);
4164 dbg_lex("%s:%d rewriting label-> %zd", __func__, __LINE__, p->func->code.len);
4165 rewrite_label_to_current(ip_idx);
4167 bc_vec_pop(&p->exits);
4168 bc_vec_pop(&p->conds);
4172 #define zbc_parse_while(...) (zbc_parse_while(__VA_ARGS__) COMMA_SUCCESS)
4174 static BC_STATUS zbc_parse_for(void)
4176 BcParse *p = &G.prs;
4178 size_t cond_idx, exit_idx, body_idx, update_idx;
4180 dbg_lex("%s:%d p->lex:%d", __func__, __LINE__, p->lex);
4182 if (s) RETURN_STATUS(s);
4183 if (p->lex != BC_LEX_LPAREN) RETURN_STATUS(bc_error_bad_token());
4185 if (s) RETURN_STATUS(s);
4187 if (p->lex != BC_LEX_SCOLON) {
4188 s = zbc_parse_expr(0);
4189 bc_parse_push(XC_INST_POP);
4190 if (s) RETURN_STATUS(s);
4192 s = zbc_POSIX_does_not_allow_empty_X_expression_in_for("init");
4193 if (s) RETURN_STATUS(s);
4196 if (p->lex != BC_LEX_SCOLON) RETURN_STATUS(bc_error_bad_token());
4198 if (s) RETURN_STATUS(s);
4200 cond_idx = bc_vec_push(&p->func->labels, &p->func->code.len);
4201 update_idx = cond_idx + 1;
4202 body_idx = update_idx + 1;
4203 exit_idx = body_idx + 1;
4205 if (p->lex != BC_LEX_SCOLON)
4206 s = zbc_parse_expr(BC_PARSE_REL);
4208 // Set this for the next call to bc_parse_pushNUM().
4209 // This is safe to set because the current token is a semicolon,
4210 // which has no string requirement.
4211 bc_vec_string(&p->lex_strnumbuf, 1, "1");
4213 s = zbc_POSIX_does_not_allow_empty_X_expression_in_for("condition");
4215 if (s) RETURN_STATUS(s);
4217 if (p->lex != BC_LEX_SCOLON) RETURN_STATUS(bc_error_bad_token());
4220 if (s) RETURN_STATUS(s);
4222 bc_parse_pushJUMP_ZERO(exit_idx);
4223 bc_parse_pushJUMP(body_idx);
4225 bc_vec_push(&p->conds, &update_idx);
4226 bc_vec_push(&p->func->labels, &p->func->code.len);
4228 if (p->lex != BC_LEX_RPAREN) {
4229 s = zbc_parse_expr(0);
4230 if (s) RETURN_STATUS(s);
4231 if (p->lex != BC_LEX_RPAREN) RETURN_STATUS(bc_error_bad_token());
4232 bc_parse_push(XC_INST_POP);
4234 s = zbc_POSIX_does_not_allow_empty_X_expression_in_for("update");
4235 if (s) RETURN_STATUS(s);
4238 bc_parse_pushJUMP(cond_idx);
4239 bc_vec_push(&p->func->labels, &p->func->code.len);
4241 bc_vec_push(&p->exits, &exit_idx);
4242 bc_vec_push(&p->func->labels, &exit_idx);
4244 s = zbc_parse_stmt_allow_NLINE_before(STRING_for);
4245 if (s) RETURN_STATUS(s);
4247 dbg_lex("%s:%d BC_INST_JUMP to %zd", __func__, __LINE__, update_idx);
4248 bc_parse_pushJUMP(update_idx);
4250 dbg_lex("%s:%d rewriting label-> %zd", __func__, __LINE__, p->func->code.len);
4251 rewrite_label_to_current(exit_idx);
4253 bc_vec_pop(&p->exits);
4254 bc_vec_pop(&p->conds);
4256 RETURN_STATUS(BC_STATUS_SUCCESS);
4258 #define zbc_parse_for(...) (zbc_parse_for(__VA_ARGS__) COMMA_SUCCESS)
4260 static BC_STATUS zbc_parse_break_or_continue(BcLexType type)
4262 BcParse *p = &G.prs;
4265 if (type == BC_LEX_KEY_BREAK) {
4266 if (p->exits.len == 0) // none of the enclosing blocks is a loop
4267 RETURN_STATUS(bc_error_bad_token());
4268 i = *(size_t*)bc_vec_top(&p->exits);
4270 i = *(size_t*)bc_vec_top(&p->conds);
4272 bc_parse_pushJUMP(i);
4274 RETURN_STATUS(zbc_lex_next());
4276 #define zbc_parse_break_or_continue(...) (zbc_parse_break_or_continue(__VA_ARGS__) COMMA_SUCCESS)
4278 static BC_STATUS zbc_func_insert(BcFunc *f, char *name, bool var)
4284 autoid = (void*)f->autos.v;
4285 for (i = 0; i < f->autos.len; i++, autoid++) {
4286 if (strcmp(name, autoid->name) == 0)
4287 RETURN_STATUS(bc_error("duplicate function parameter or auto name"));
4293 bc_vec_push(&f->autos, &a);
4295 RETURN_STATUS(BC_STATUS_SUCCESS);
4297 #define zbc_func_insert(...) (zbc_func_insert(__VA_ARGS__) COMMA_SUCCESS)
4299 static BC_STATUS zbc_parse_funcdef(void)
4301 BcParse *p = &G.prs;
4303 bool var, comma = false;
4306 dbg_lex_enter("%s:%d entered", __func__, __LINE__);
4308 if (s) RETURN_STATUS(s);
4309 if (p->lex != XC_LEX_NAME)
4310 RETURN_STATUS(bc_error("bad function definition"));
4312 name = xstrdup(p->lex_strnumbuf.v);
4313 p->fidx = bc_program_addFunc(name);
4314 p->func = bc_program_func(p->fidx);
4317 if (s) RETURN_STATUS(s);
4318 if (p->lex != BC_LEX_LPAREN)
4319 RETURN_STATUS(bc_error("bad function definition"));
4321 if (s) RETURN_STATUS(s);
4323 while (p->lex != BC_LEX_RPAREN) {
4324 if (p->lex != XC_LEX_NAME)
4325 RETURN_STATUS(bc_error("bad function definition"));
4329 name = xstrdup(p->lex_strnumbuf.v);
4333 var = p->lex != BC_LEX_LBRACKET;
4339 if (p->lex != BC_LEX_RBRACKET) {
4340 s = bc_error("bad function definition");
4348 comma = p->lex == BC_LEX_COMMA;
4354 s = zbc_func_insert(p->func, name, var);
4358 if (comma) RETURN_STATUS(bc_error("bad function definition"));
4361 if (s) RETURN_STATUS(s);
4363 if (p->lex != BC_LEX_LBRACE) {
4364 s = zbc_POSIX_requires("the left brace be on the same line as the function header");
4365 if (s) RETURN_STATUS(s);
4368 // Prevent "define z()<newline>" from being interpreted as function with empty stmt as body
4369 s = zbc_lex_skip_if_at_NLINE();
4370 if (s) RETURN_STATUS(s);
4371 //GNU bc requires a {} block even if function body has single stmt, enforce this?
4372 if (p->lex != BC_LEX_LBRACE)
4373 RETURN_STATUS(bc_error("function { body } expected"));
4375 p->in_funcdef++; // to determine whether "return" stmt is allowed, and such
4376 s = zbc_parse_stmt_possibly_auto(true);
4378 if (s) RETURN_STATUS(s);
4380 bc_parse_push(BC_INST_RET0);
4382 // Subsequent code generation is into main program
4383 p->fidx = BC_PROG_MAIN;
4384 p->func = bc_program_func_BC_PROG_MAIN();
4386 dbg_lex_done("%s:%d done", __func__, __LINE__);
4389 dbg_lex_done("%s:%d done (error)", __func__, __LINE__);
4393 #define zbc_parse_funcdef(...) (zbc_parse_funcdef(__VA_ARGS__) COMMA_SUCCESS)
4395 static BC_STATUS zbc_parse_auto(void)
4397 BcParse *p = &G.prs;
4401 dbg_lex_enter("%s:%d entered", __func__, __LINE__);
4403 if (s) RETURN_STATUS(s);
4408 if (p->lex != XC_LEX_NAME)
4409 RETURN_STATUS(bc_error("bad 'auto' syntax"));
4411 name = xstrdup(p->lex_strnumbuf.v);
4415 var = (p->lex != BC_LEX_LBRACKET);
4420 if (p->lex != BC_LEX_RBRACKET) {
4421 s = bc_error("bad 'auto' syntax");
4428 s = zbc_func_insert(p->func, name, var);
4431 if (p->lex == XC_LEX_NLINE
4432 || p->lex == BC_LEX_SCOLON
4433 //|| p->lex == BC_LEX_RBRACE // allow "define f() {auto a}"
4437 if (p->lex != BC_LEX_COMMA)
4438 RETURN_STATUS(bc_error("bad 'auto' syntax"));
4439 s = zbc_lex_next(); // skip comma
4440 if (s) RETURN_STATUS(s);
4443 dbg_lex_done("%s:%d done", __func__, __LINE__);
4444 RETURN_STATUS(BC_STATUS_SUCCESS);
4447 dbg_lex_done("%s:%d done (ERROR)", __func__, __LINE__);
4450 #define zbc_parse_auto(...) (zbc_parse_auto(__VA_ARGS__) COMMA_SUCCESS)
4452 #undef zbc_parse_stmt_possibly_auto
4453 static BC_STATUS zbc_parse_stmt_possibly_auto(bool auto_allowed)
4455 BcParse *p = &G.prs;
4456 BcStatus s = BC_STATUS_SUCCESS;
4458 dbg_lex_enter("%s:%d entered, p->lex:%d", __func__, __LINE__, p->lex);
4460 if (p->lex == XC_LEX_NLINE) {
4461 dbg_lex_done("%s:%d done (seen XC_LEX_NLINE)", __func__, __LINE__);
4462 RETURN_STATUS(zbc_lex_next());
4464 if (p->lex == BC_LEX_SCOLON) {
4465 dbg_lex_done("%s:%d done (seen BC_LEX_SCOLON)", __func__, __LINE__);
4466 RETURN_STATUS(zbc_lex_next());
4469 if (p->lex == BC_LEX_LBRACE) {
4470 dbg_lex("%s:%d BC_LEX_LBRACE: (auto_allowed:%d)", __func__, __LINE__, auto_allowed);
4473 if (s) RETURN_STATUS(s);
4474 } while (p->lex == XC_LEX_NLINE);
4475 if (auto_allowed && p->lex == BC_LEX_KEY_AUTO) {
4476 dbg_lex("%s:%d calling zbc_parse_auto()", __func__, __LINE__);
4477 s = zbc_parse_auto();
4478 if (s) RETURN_STATUS(s);
4480 while (p->lex != BC_LEX_RBRACE) {
4481 dbg_lex("%s:%d block parsing loop", __func__, __LINE__);
4482 s = zbc_parse_stmt();
4483 if (s) RETURN_STATUS(s);
4486 dbg_lex_done("%s:%d done (seen BC_LEX_RBRACE)", __func__, __LINE__);
4490 dbg_lex("%s:%d p->lex:%d", __func__, __LINE__, p->lex);
4492 case XC_LEX_OP_MINUS:
4495 case BC_LEX_OP_BOOL_NOT:
4499 case BC_LEX_KEY_IBASE:
4500 case BC_LEX_KEY_LAST:
4501 case BC_LEX_KEY_LENGTH:
4502 case BC_LEX_KEY_OBASE:
4503 case BC_LEX_KEY_READ:
4504 case BC_LEX_KEY_SCALE:
4505 case BC_LEX_KEY_SQRT:
4506 s = zbc_parse_expr(BC_PARSE_PRINT);
4509 s = zbc_parse_pushSTR();
4510 bc_parse_push(XC_INST_PRINT_STR);
4512 case BC_LEX_KEY_BREAK:
4513 case BC_LEX_KEY_CONTINUE:
4514 s = zbc_parse_break_or_continue(p->lex);
4516 case BC_LEX_KEY_FOR:
4517 s = zbc_parse_for();
4519 case BC_LEX_KEY_HALT:
4520 bc_parse_push(BC_INST_HALT);
4526 case BC_LEX_KEY_LIMITS:
4527 // "limits" is a compile-time command,
4528 // the output is produced at _parse time_.
4530 "BC_BASE_MAX = "BC_MAX_OBASE_STR "\n"
4531 "BC_DIM_MAX = "BC_MAX_DIM_STR "\n"
4532 "BC_SCALE_MAX = "BC_MAX_SCALE_STR "\n"
4533 "BC_STRING_MAX = "BC_MAX_STRING_STR"\n"
4534 "BC_NAME_MAX = "BC_MAX_NAME_STR "\n"
4535 "BC_NUM_MAX = "BC_MAX_NUM_STR "\n"
4536 "MAX Exponent = "BC_MAX_EXP_STR "\n"
4537 "Number of vars = "BC_MAX_VARS_STR "\n"
4541 case BC_LEX_KEY_PRINT:
4542 s = zbc_parse_print();
4544 case BC_LEX_KEY_QUIT:
4545 // "quit" is a compile-time command. For example,
4546 // "if (0 == 1) quit" terminates when parsing the statement,
4547 // not when it is executed
4548 QUIT_OR_RETURN_TO_MAIN;
4549 case BC_LEX_KEY_RETURN:
4551 RETURN_STATUS(bc_error("'return' not in a function"));
4552 s = zbc_parse_return();
4554 case BC_LEX_KEY_WHILE:
4555 s = zbc_parse_while();
4558 s = bc_error_bad_token();
4562 dbg_lex_done("%s:%d done", __func__, __LINE__);
4565 #define zbc_parse_stmt_possibly_auto(...) (zbc_parse_stmt_possibly_auto(__VA_ARGS__) COMMA_SUCCESS)
4567 static BC_STATUS zbc_parse_stmt_or_funcdef(void)
4569 BcParse *p = &G.prs;
4572 dbg_lex_enter("%s:%d entered", __func__, __LINE__);
4573 if (p->lex == XC_LEX_EOF)
4574 s = bc_error("end of file");
4575 else if (p->lex == BC_LEX_KEY_DEFINE) {
4576 dbg_lex("%s:%d p->lex:BC_LEX_KEY_DEFINE", __func__, __LINE__);
4577 s = zbc_parse_funcdef();
4579 dbg_lex("%s:%d p->lex:%d (not BC_LEX_KEY_DEFINE)", __func__, __LINE__, p->lex);
4580 s = zbc_parse_stmt();
4583 dbg_lex_done("%s:%d done", __func__, __LINE__);
4586 #define zbc_parse_stmt_or_funcdef(...) (zbc_parse_stmt_or_funcdef(__VA_ARGS__) COMMA_SUCCESS)
4588 // This is not a "z" function: can also return BC_STATUS_PARSE_EMPTY_EXP
4589 static BcStatus bc_parse_expr_empty_ok(uint8_t flags)
4591 BcParse *p = &G.prs;
4592 BcInst prev = XC_INST_PRINT;
4593 size_t nexprs = 0, ops_bgn = p->ops.len;
4594 unsigned nparens, nrelops;
4595 bool paren_first, paren_expr, rprn, assign, bin_last;
4597 dbg_lex_enter("%s:%d entered", __func__, __LINE__);
4598 paren_first = (p->lex == BC_LEX_LPAREN);
4599 nparens = nrelops = 0;
4600 paren_expr = rprn = assign = false;
4606 BcLexType t = p->lex;
4608 if (!lex_allowed_in_bc_expr(t))
4611 dbg_lex("%s:%d t:%d", __func__, __LINE__, t);
4613 s = BC_STATUS_SUCCESS;
4617 dbg_lex("%s:%d LEX_OP_INC/DEC", __func__, __LINE__);
4618 s = zbc_parse_incdec(&prev, &paren_expr, &nexprs, flags);
4619 rprn = bin_last = false;
4620 //get_token = false; - already is
4622 case XC_LEX_OP_MINUS:
4623 dbg_lex("%s:%d LEX_OP_MINUS", __func__, __LINE__);
4624 s = zbc_parse_minus(&prev, ops_bgn, rprn, &nexprs);
4626 //get_token = false; - already is
4627 bin_last = (prev == XC_INST_MINUS);
4629 case BC_LEX_OP_ASSIGN_POWER:
4630 case BC_LEX_OP_ASSIGN_MULTIPLY:
4631 case BC_LEX_OP_ASSIGN_DIVIDE:
4632 case BC_LEX_OP_ASSIGN_MODULUS:
4633 case BC_LEX_OP_ASSIGN_PLUS:
4634 case BC_LEX_OP_ASSIGN_MINUS:
4635 case BC_LEX_OP_ASSIGN:
4636 dbg_lex("%s:%d LEX_ASSIGNxyz", __func__, __LINE__);
4637 if (prev != XC_INST_VAR && prev != XC_INST_ARRAY_ELEM
4638 && prev != XC_INST_SCALE && prev != XC_INST_IBASE
4639 && prev != XC_INST_OBASE && prev != BC_INST_LAST
4641 return bc_error("bad assignment:"
4642 " left side must be variable"
4644 ); // note: shared string
4647 case XC_LEX_OP_POWER:
4648 case XC_LEX_OP_MULTIPLY:
4649 case XC_LEX_OP_DIVIDE:
4650 case XC_LEX_OP_MODULUS:
4651 case XC_LEX_OP_PLUS:
4652 case XC_LEX_OP_REL_EQ:
4653 case XC_LEX_OP_REL_LE:
4654 case XC_LEX_OP_REL_GE:
4655 case XC_LEX_OP_REL_NE:
4656 case XC_LEX_OP_REL_LT:
4657 case XC_LEX_OP_REL_GT:
4658 case BC_LEX_OP_BOOL_NOT:
4659 case BC_LEX_OP_BOOL_OR:
4660 case BC_LEX_OP_BOOL_AND:
4661 dbg_lex("%s:%d LEX_OP_xyz", __func__, __LINE__);
4662 if (((t == BC_LEX_OP_BOOL_NOT) != bin_last)
4663 || (t != BC_LEX_OP_BOOL_NOT && prev == XC_INST_BOOL_NOT)
4665 return bc_error_bad_expression();
4667 nrelops += (t >= XC_LEX_OP_REL_EQ && t <= XC_LEX_OP_REL_GT);
4668 prev = BC_TOKEN_2_INST(t);
4669 bc_parse_operator(t, ops_bgn, &nexprs);
4672 //get_token = false; - already is
4673 bin_last = (t != BC_LEX_OP_BOOL_NOT);
4676 dbg_lex("%s:%d LEX_LPAREN", __func__, __LINE__);
4677 if (BC_PARSE_LEAF(prev, rprn))
4678 return bc_error_bad_expression();
4679 bc_vec_push(&p->ops, &t);
4683 rprn = bin_last = false;
4686 dbg_lex("%s:%d LEX_RPAREN", __func__, __LINE__);
4687 if (bin_last || prev == XC_INST_BOOL_NOT)
4688 return bc_error_bad_expression();
4693 dbg_lex_done("%s:%d done (returning EMPTY_EXP)", __func__, __LINE__);
4694 return BC_STATUS_PARSE_EMPTY_EXP;
4696 s = zbc_parse_rightParen(ops_bgn, &nexprs);
4699 paren_expr = rprn = true;
4703 dbg_lex("%s:%d LEX_NAME", __func__, __LINE__);
4704 if (BC_PARSE_LEAF(prev, rprn))
4705 return bc_error_bad_expression();
4706 s = zbc_parse_name(&prev, flags & ~BC_PARSE_NOCALL);
4708 rprn = bin_last = false;
4709 //get_token = false; - already is
4713 dbg_lex("%s:%d LEX_NUMBER", __func__, __LINE__);
4714 if (BC_PARSE_LEAF(prev, rprn))
4715 return bc_error_bad_expression();
4720 rprn = bin_last = false;
4723 case BC_LEX_KEY_IBASE:
4724 case BC_LEX_KEY_LAST:
4725 case BC_LEX_KEY_OBASE:
4726 dbg_lex("%s:%d LEX_IBASE/LAST/OBASE", __func__, __LINE__);
4727 if (BC_PARSE_LEAF(prev, rprn))
4728 return bc_error_bad_expression();
4729 prev = (char) (t - BC_LEX_KEY_IBASE + XC_INST_IBASE);
4730 bc_parse_push((char) prev);
4733 rprn = bin_last = false;
4736 case BC_LEX_KEY_LENGTH:
4737 case BC_LEX_KEY_SQRT:
4738 dbg_lex("%s:%d LEX_LEN/SQRT", __func__, __LINE__);
4739 if (BC_PARSE_LEAF(prev, rprn))
4740 return bc_error_bad_expression();
4741 s = zbc_parse_builtin(t, flags, &prev);
4744 rprn = bin_last = false;
4747 case BC_LEX_KEY_READ:
4748 dbg_lex("%s:%d LEX_READ", __func__, __LINE__);
4749 if (BC_PARSE_LEAF(prev, rprn))
4750 return bc_error_bad_expression();
4751 s = zbc_parse_read();
4752 prev = XC_INST_READ;
4755 rprn = bin_last = false;
4758 case BC_LEX_KEY_SCALE:
4759 dbg_lex("%s:%d LEX_SCALE", __func__, __LINE__);
4760 if (BC_PARSE_LEAF(prev, rprn))
4761 return bc_error_bad_expression();
4762 s = zbc_parse_scale(&prev, flags);
4763 prev = XC_INST_SCALE;
4764 //get_token = false; - already is
4766 rprn = bin_last = false;
4770 return bc_error_bad_token();
4773 if (s || G_interrupt) // error, or ^C: stop parsing
4774 return BC_STATUS_FAILURE;
4782 while (p->ops.len > ops_bgn) {
4783 BcLexType top = BC_PARSE_TOP_OP(p);
4784 assign = (top >= BC_LEX_OP_ASSIGN_POWER && top <= BC_LEX_OP_ASSIGN);
4786 if (top == BC_LEX_LPAREN || top == BC_LEX_RPAREN)
4787 return bc_error_bad_expression();
4789 bc_parse_push(BC_TOKEN_2_INST(top));
4791 nexprs -= (top != BC_LEX_OP_BOOL_NOT && top != XC_LEX_NEG);
4792 bc_vec_pop(&p->ops);
4795 if (prev == XC_INST_BOOL_NOT || nexprs != 1)
4796 return bc_error_bad_expression();
4798 if (!(flags & BC_PARSE_REL) && nrelops) {
4800 s = zbc_POSIX_does_not_allow("comparison operators outside if or loops");
4802 } else if ((flags & BC_PARSE_REL) && nrelops > 1) {
4804 s = zbc_POSIX_requires("exactly one comparison operator per condition");
4808 if (flags & BC_PARSE_PRINT) {
4809 if (paren_first || !assign)
4810 bc_parse_push(XC_INST_PRINT);
4811 bc_parse_push(XC_INST_POP);
4814 dbg_lex_done("%s:%d done", __func__, __LINE__);
4815 return BC_STATUS_SUCCESS;
4822 static BC_STATUS zdc_parse_register(void)
4824 BcParse *p = &G.prs;
4828 if (s) RETURN_STATUS(s);
4829 if (p->lex != XC_LEX_NAME) RETURN_STATUS(bc_error_bad_token());
4831 bc_parse_pushName(p->lex_strnumbuf.v);
4835 #define zdc_parse_register(...) (zdc_parse_register(__VA_ARGS__) COMMA_SUCCESS)
4837 static void dc_parse_string(void)
4839 BcParse *p = &G.prs;
4841 size_t len = G.prog.strs.len;
4843 dbg_lex_enter("%s:%d entered", __func__, __LINE__);
4845 str = xstrdup(p->lex_strnumbuf.v);
4846 bc_parse_push(XC_INST_STR);
4847 bc_parse_pushIndex(len);
4848 bc_vec_push(&G.prog.strs, &str);
4850 // Explanation needed here
4851 bc_program_add_fn();
4852 p->func = bc_program_func(p->fidx);
4854 dbg_lex_done("%s:%d done", __func__, __LINE__);
4857 static BC_STATUS zdc_parse_mem(uint8_t inst, bool name, bool store)
4861 bc_parse_push(inst);
4863 s = zdc_parse_register();
4864 if (s) RETURN_STATUS(s);
4868 bc_parse_push(DC_INST_SWAP);
4869 bc_parse_push(XC_INST_ASSIGN);
4870 bc_parse_push(XC_INST_POP);
4873 RETURN_STATUS(BC_STATUS_SUCCESS);
4875 #define zdc_parse_mem(...) (zdc_parse_mem(__VA_ARGS__) COMMA_SUCCESS)
4877 static BC_STATUS zdc_parse_cond(uint8_t inst)
4879 BcParse *p = &G.prs;
4882 bc_parse_push(inst);
4883 bc_parse_push(DC_INST_EXEC_COND);
4885 s = zdc_parse_register();
4886 if (s) RETURN_STATUS(s);
4889 if (s) RETURN_STATUS(s);
4891 // Note that 'else' part can not be on the next line:
4892 // echo -e '[1p]sa [2p]sb 2 1>a eb' | dc - OK, prints "2"
4893 // echo -e '[1p]sa [2p]sb 2 1>a\neb' | dc - parse error
4894 if (p->lex == DC_LEX_ELSE) {
4895 s = zdc_parse_register();
4896 if (s) RETURN_STATUS(s);
4899 bc_parse_push(BC_PARSE_STREND);
4904 #define zdc_parse_cond(...) (zdc_parse_cond(__VA_ARGS__) COMMA_SUCCESS)
4906 static BC_STATUS zdc_parse_token(BcLexType t)
4910 bool assign, get_token;
4912 dbg_lex_enter("%s:%d entered", __func__, __LINE__);
4913 s = BC_STATUS_SUCCESS;
4916 case XC_LEX_OP_REL_EQ:
4917 case XC_LEX_OP_REL_LE:
4918 case XC_LEX_OP_REL_GE:
4919 case XC_LEX_OP_REL_NE:
4920 case XC_LEX_OP_REL_LT:
4921 case XC_LEX_OP_REL_GT:
4922 dbg_lex("%s:%d LEX_OP_REL_xyz", __func__, __LINE__);
4923 s = zdc_parse_cond(t - XC_LEX_OP_REL_EQ + XC_INST_REL_EQ);
4928 dbg_lex("%s:%d LEX_[S]COLON", __func__, __LINE__);
4929 s = zdc_parse_mem(XC_INST_ARRAY_ELEM, true, t == DC_LEX_COLON);
4932 dbg_lex("%s:%d LEX_STR", __func__, __LINE__);
4936 dbg_lex("%s:%d LEX_NEG", __func__, __LINE__);
4938 if (s) RETURN_STATUS(s);
4939 if (G.prs.lex != XC_LEX_NUMBER)
4940 RETURN_STATUS(bc_error_bad_token());
4942 bc_parse_push(XC_INST_NEG);
4945 dbg_lex("%s:%d LEX_NUMBER", __func__, __LINE__);
4949 dbg_lex("%s:%d LEX_KEY_READ", __func__, __LINE__);
4950 bc_parse_push(XC_INST_READ);
4952 case DC_LEX_OP_ASSIGN:
4953 case DC_LEX_STORE_PUSH:
4954 dbg_lex("%s:%d LEX_OP_ASSIGN/STORE_PUSH", __func__, __LINE__);
4955 assign = (t == DC_LEX_OP_ASSIGN);
4956 inst = assign ? XC_INST_VAR : DC_INST_PUSH_TO_VAR;
4957 s = zdc_parse_mem(inst, true, assign);
4960 case DC_LEX_LOAD_POP:
4961 dbg_lex("%s:%d LEX_OP_LOAD[_POP]", __func__, __LINE__);
4962 inst = t == DC_LEX_LOAD_POP ? DC_INST_PUSH_VAR : DC_INST_LOAD;
4963 s = zdc_parse_mem(inst, true, false);
4965 case DC_LEX_STORE_IBASE:
4966 case DC_LEX_STORE_SCALE:
4967 case DC_LEX_STORE_OBASE:
4968 dbg_lex("%s:%d LEX_OP_STORE_I/OBASE/SCALE", __func__, __LINE__);
4969 inst = t - DC_LEX_STORE_IBASE + XC_INST_IBASE;
4970 s = zdc_parse_mem(inst, false, true);
4973 dbg_lex_done("%s:%d done (bad token)", __func__, __LINE__);
4974 RETURN_STATUS(bc_error_bad_token());
4977 if (!s && get_token) s = zbc_lex_next();
4979 dbg_lex_done("%s:%d done", __func__, __LINE__);
4982 #define zdc_parse_token(...) (zdc_parse_token(__VA_ARGS__) COMMA_SUCCESS)
4984 static BC_STATUS zdc_parse_expr(void)
4986 BcParse *p = &G.prs;
4989 i = (int)p->lex - (int)XC_LEX_OP_POWER;
4991 BcInst inst = dc_LEX_to_INST[i];
4992 if (inst != DC_INST_INVALID) {
4993 bc_parse_push(inst);
4994 RETURN_STATUS(zbc_lex_next());
4997 RETURN_STATUS(zdc_parse_token(p->lex));
4999 #define zdc_parse_expr(...) (zdc_parse_expr(__VA_ARGS__) COMMA_SUCCESS)
5001 static BC_STATUS zdc_parse_exprs_until_eof(void)
5003 BcParse *p = &G.prs;
5004 dbg_lex_enter("%s:%d entered, p->lex:%d", __func__, __LINE__, p->lex);
5005 while (p->lex != XC_LEX_EOF) {
5006 BcStatus s = zdc_parse_expr();
5007 if (s) RETURN_STATUS(s);
5010 dbg_lex_done("%s:%d done", __func__, __LINE__);
5011 RETURN_STATUS(BC_STATUS_SUCCESS);
5013 #define zdc_parse_exprs_until_eof(...) (zdc_parse_exprs_until_eof(__VA_ARGS__) COMMA_SUCCESS)
5021 #define STACK_HAS_MORE_THAN(s, n) ((s)->len > ((size_t)(n)))
5022 #define STACK_HAS_EQUAL_OR_MORE_THAN(s, n) ((s)->len >= ((size_t)(n)))
5024 static BcVec* bc_program_search(char *id, bool var)
5031 v = var ? &G.prog.vars : &G.prog.arrs;
5032 map = var ? &G.prog.var_map : &G.prog.arr_map;
5036 new = bc_map_insert(map, &e, &i); // 1 if insertion was successful
5040 bc_array_init(&v2, var);
5041 bc_vec_push(v, &v2);
5044 ptr = bc_vec_item(map, i);
5045 if (new) ptr->name = xstrdup(e.name);
5046 return bc_vec_item(v, ptr->idx);
5049 // 'num' need not be initialized on entry
5050 static BC_STATUS zbc_program_num(BcResult *r, BcNum **num, bool hex)
5054 case XC_RESULT_TEMP:
5055 case XC_RESULT_IBASE:
5056 case XC_RESULT_SCALE:
5057 case XC_RESULT_OBASE:
5060 case XC_RESULT_CONSTANT: {
5066 str = *bc_program_const(r->d.id.idx);
5069 bc_num_init(&r->d.n, len);
5071 hex = hex && len == 1;
5072 base_t = hex ? 16 : G.prog.ib_t;
5073 s = zbc_num_parse(&r->d.n, str, base_t);
5075 bc_num_free(&r->d.n);
5079 r->t = XC_RESULT_TEMP;
5083 case XC_RESULT_ARRAY:
5084 case XC_RESULT_ARRAY_ELEM: {
5087 v = bc_program_search(r->d.id.name, r->t == XC_RESULT_VAR);
5089 if (r->t == XC_RESULT_ARRAY_ELEM) {
5091 if (v->len <= r->d.id.idx) bc_array_expand(v, r->d.id.idx + 1);
5092 *num = bc_vec_item(v, r->d.id.idx);
5094 *num = bc_vec_top(v);
5098 case BC_RESULT_LAST:
5099 *num = &G.prog.last;
5107 // Testing the theory that dc does not reach LAST/ONE
5108 bb_error_msg_and_die("BUG:%d", r->t);
5112 RETURN_STATUS(BC_STATUS_SUCCESS);
5114 #define zbc_program_num(...) (zbc_program_num(__VA_ARGS__) COMMA_SUCCESS)
5116 static BC_STATUS zbc_program_binOpPrep(BcResult **l, BcNum **ln,
5117 BcResult **r, BcNum **rn, bool assign)
5121 BcResultType lt, rt;
5123 if (!STACK_HAS_MORE_THAN(&G.prog.results, 1))
5124 RETURN_STATUS(bc_error_stack_has_too_few_elements());
5126 *r = bc_vec_item_rev(&G.prog.results, 0);
5127 *l = bc_vec_item_rev(&G.prog.results, 1);
5131 hex = assign && (lt == XC_RESULT_IBASE || lt == XC_RESULT_OBASE);
5133 s = zbc_program_num(*l, ln, false);
5134 if (s) RETURN_STATUS(s);
5135 s = zbc_program_num(*r, rn, hex);
5136 if (s) RETURN_STATUS(s);
5138 // We run this again under these conditions in case any vector has been
5139 // reallocated out from under the BcNums or arrays we had.
5140 if (lt == rt && (lt == XC_RESULT_VAR || lt == XC_RESULT_ARRAY_ELEM)) {
5141 s = zbc_program_num(*l, ln, false);
5142 if (s) RETURN_STATUS(s);
5145 if (!BC_PROG_NUM((*l), (*ln)) && (!assign || (*l)->t != XC_RESULT_VAR))
5146 RETURN_STATUS(bc_error_variable_is_wrong_type());
5147 if (!assign && !BC_PROG_NUM((*r), (*ln)))
5148 RETURN_STATUS(bc_error_variable_is_wrong_type());
5152 #define zbc_program_binOpPrep(...) (zbc_program_binOpPrep(__VA_ARGS__) COMMA_SUCCESS)
5154 static void bc_program_binOpRetire(BcResult *r)
5156 r->t = XC_RESULT_TEMP;
5157 bc_vec_pop(&G.prog.results);
5158 bc_result_pop_and_push(r);
5161 // Note: *r and *n need not be initialized by caller
5162 static BC_STATUS zbc_program_prep(BcResult **r, BcNum **n)
5166 if (!STACK_HAS_MORE_THAN(&G.prog.results, 0))
5167 RETURN_STATUS(bc_error_stack_has_too_few_elements());
5168 *r = bc_vec_top(&G.prog.results);
5170 s = zbc_program_num(*r, n, false);
5171 if (s) RETURN_STATUS(s);
5173 if (!BC_PROG_NUM((*r), (*n)))
5174 RETURN_STATUS(bc_error_variable_is_wrong_type());
5178 #define zbc_program_prep(...) (zbc_program_prep(__VA_ARGS__) COMMA_SUCCESS)
5180 static void bc_program_retire(BcResult *r, BcResultType t)
5183 bc_result_pop_and_push(r);
5186 static BC_STATUS zbc_program_op(char inst)
5189 BcResult *opd1, *opd2, res;
5192 s = zbc_program_binOpPrep(&opd1, &n1, &opd2, &n2, false);
5193 if (s) RETURN_STATUS(s);
5194 bc_num_init_DEF_SIZE(&res.d.n);
5196 s = BC_STATUS_SUCCESS;
5197 IF_ERROR_RETURN_POSSIBLE(s =) zbc_program_ops[inst - XC_INST_POWER](n1, n2, &res.d.n, G.prog.scale);
5199 bc_program_binOpRetire(&res);
5203 bc_num_free(&res.d.n);
5206 #define zbc_program_op(...) (zbc_program_op(__VA_ARGS__) COMMA_SUCCESS)
5208 static BC_STATUS zbc_program_read(void)
5216 bc_char_vec_init(&buf);
5217 bc_read_line(&buf, stdin);
5219 f = bc_program_func(BC_PROG_READ);
5220 bc_vec_pop_all(&f->code);
5222 sv_parse = G.prs; // struct copy
5223 bc_parse_create(BC_PROG_READ);
5224 //G.err_line = G.prs.lex_line = 1; - not needed, error line info is not printed for read()
5226 s = zbc_parse_text_init(buf.v);
5227 if (s) goto exec_err;
5229 IF_BC(s = zbc_parse_expr(0));
5231 IF_DC(s = zdc_parse_exprs_until_eof());
5233 if (s) goto exec_err;
5235 if (G.prs.lex != XC_LEX_NLINE && G.prs.lex != XC_LEX_EOF) {
5236 s = bc_error("bad read() expression");
5240 ip.func = BC_PROG_READ;
5242 IF_BC(ip.results_len_before_call = G.prog.results.len;)
5244 bc_parse_push(XC_INST_RET);
5245 bc_vec_push(&G.prog.exestack, &ip);
5249 G.prs = sv_parse; // struct copy
5253 #define zbc_program_read(...) (zbc_program_read(__VA_ARGS__) COMMA_SUCCESS)
5255 static size_t bc_program_index(char *code, size_t *bgn)
5257 unsigned char *bytes = (void*)(code + *bgn);
5267 for (i = 0; i < amt; i += 8)
5268 res |= (size_t)(*bytes++) << i;
5273 static char *bc_program_name(char *code, size_t *bgn)
5279 s = xmalloc(strchr(code, BC_PARSE_STREND) - code + 1);
5283 if (c == BC_PARSE_STREND)
5293 static void bc_program_printString(const char *str)
5297 // Example: echo '[]ap' | dc
5298 // should print two bytes: 0x00, 0x0A
5305 if (c != '\\' || !*str)
5325 G.prog.nchars = SIZE_MAX;
5337 // Just print the backslash and following character.
5348 static void bc_num_printNewline(void)
5350 if (G.prog.nchars == G.prog.len - 1) {
5358 static FAST_FUNC void dc_num_printChar(size_t num, size_t width, bool radix)
5361 bb_putchar((char) num);
5362 G.prog.nchars += width;
5366 static FAST_FUNC void bc_num_printDigits(size_t num, size_t width, bool radix)
5370 bc_num_printNewline();
5371 bb_putchar(radix ? '.' : ' ');
5374 bc_num_printNewline();
5375 for (exp = 0, pow = 1; exp < width - 1; ++exp, pow *= 10)
5378 for (exp = 0; exp < width; pow /= 10, ++G.prog.nchars, ++exp) {
5380 bc_num_printNewline();
5383 bb_putchar(((char) dig) + '0');
5387 static FAST_FUNC void bc_num_printHex(size_t num, size_t width, bool radix)
5390 bc_num_printNewline();
5395 bc_num_printNewline();
5396 bb_putchar(bb_hexdigits_upcase[num]);
5397 G.prog.nchars += width;
5400 static void bc_num_printDecimal(BcNum *n)
5402 size_t i, rdx = n->rdx - 1;
5409 for (i = n->len - 1; i < n->len; --i)
5410 bc_num_printHex((size_t) n->num[i], 1, i == rdx);
5413 typedef void (*BcNumDigitOp)(size_t, size_t, bool) FAST_FUNC;
5415 static BC_STATUS zbc_num_printNum(BcNum *n, unsigned base_t, size_t width, BcNumDigitOp print)
5420 BcDig base_digs[ULONG_NUM_BUFSIZE];
5421 BcNum intp, fracp, digit, frac_len;
5422 unsigned long dig, *ptr;
5427 print(0, width, false);
5428 RETURN_STATUS(BC_STATUS_SUCCESS);
5431 bc_vec_init(&stack, sizeof(long), NULL);
5432 bc_num_init(&intp, n->len);
5433 bc_num_init(&fracp, n->rdx);
5434 bc_num_init(&digit, width);
5435 bc_num_init(&frac_len, BC_NUM_INT(n));
5436 bc_num_copy(&intp, n);
5437 bc_num_one(&frac_len);
5438 base.cap = ARRAY_SIZE(base_digs);
5439 base.num = base_digs;
5440 bc_num_ulong2num(&base, base_t);
5442 bc_num_truncate(&intp, intp.rdx);
5443 s = zbc_num_sub(n, &intp, &fracp, 0);
5446 while (intp.len != 0) {
5447 s = zbc_num_divmod(&intp, &base, &intp, &digit, 0);
5449 s = zbc_num_ulong(&digit, &dig);
5451 bc_vec_push(&stack, &dig);
5454 for (i = 0; i < stack.len; ++i) {
5455 ptr = bc_vec_item_rev(&stack, i);
5456 print(*ptr, width, false);
5459 if (!n->rdx) goto err;
5461 for (radix = true; frac_len.len <= n->rdx; radix = false) {
5462 s = zbc_num_mul(&fracp, &base, &fracp, n->rdx);
5464 s = zbc_num_ulong(&fracp, &dig);
5466 bc_num_ulong2num(&intp, dig);
5467 s = zbc_num_sub(&fracp, &intp, &fracp, 0);
5469 print(dig, width, radix);
5470 s = zbc_num_mul(&frac_len, &base, &frac_len, 0);
5474 bc_num_free(&frac_len);
5475 bc_num_free(&digit);
5476 bc_num_free(&fracp);
5478 bc_vec_free(&stack);
5481 #define zbc_num_printNum(...) (zbc_num_printNum(__VA_ARGS__) COMMA_SUCCESS)
5483 static BC_STATUS zbc_num_printBase(BcNum *n)
5497 if (G.prog.ob_t <= BC_NUM_MAX_IBASE) {
5499 print = bc_num_printHex;
5501 unsigned i = G.prog.ob_t - 1;
5509 print = bc_num_printDigits;
5512 s = zbc_num_printNum(n, G.prog.ob_t, width, print);
5517 #define zbc_num_printBase(...) (zbc_num_printBase(__VA_ARGS__) COMMA_SUCCESS)
5519 static BC_STATUS zbc_num_print(BcNum *n, bool newline)
5521 BcStatus s = BC_STATUS_SUCCESS;
5523 bc_num_printNewline();
5528 } else if (G.prog.ob_t == 10)
5529 bc_num_printDecimal(n);
5531 s = zbc_num_printBase(n);
5540 #define zbc_num_print(...) (zbc_num_print(__VA_ARGS__) COMMA_SUCCESS)
5542 static BC_STATUS zbc_program_print(char inst, size_t idx)
5547 bool pop = (inst != XC_INST_PRINT);
5549 if (!STACK_HAS_MORE_THAN(&G.prog.results, idx))
5550 RETURN_STATUS(bc_error_stack_has_too_few_elements());
5552 r = bc_vec_item_rev(&G.prog.results, idx);
5553 s = zbc_program_num(r, &num, false);
5554 if (s) RETURN_STATUS(s);
5556 if (BC_PROG_NUM(r, num)) {
5557 s = zbc_num_print(num, !pop);
5559 if (!s && IS_BC) bc_num_copy(&G.prog.last, num);
5564 idx = (r->t == XC_RESULT_STR) ? r->d.id.idx : num->rdx;
5565 str = *bc_program_str(idx);
5567 if (inst == XC_INST_PRINT_STR) {
5570 if (c == '\0') break;
5573 if (c == '\n') G.prog.nchars = 0;
5576 bc_program_printString(str);
5577 if (inst == XC_INST_PRINT) bb_putchar('\n');
5581 if (!s && pop) bc_vec_pop(&G.prog.results);
5585 #define zbc_program_print(...) (zbc_program_print(__VA_ARGS__) COMMA_SUCCESS)
5587 static BC_STATUS zbc_program_negate(void)
5593 s = zbc_program_prep(&ptr, &num);
5594 if (s) RETURN_STATUS(s);
5596 bc_num_init(&res.d.n, num->len);
5597 bc_num_copy(&res.d.n, num);
5598 if (res.d.n.len) res.d.n.neg = !res.d.n.neg;
5600 bc_program_retire(&res, XC_RESULT_TEMP);
5604 #define zbc_program_negate(...) (zbc_program_negate(__VA_ARGS__) COMMA_SUCCESS)
5606 static BC_STATUS zbc_program_logical(char inst)
5609 BcResult *opd1, *opd2, res;
5613 s = zbc_program_binOpPrep(&opd1, &n1, &opd2, &n2, false);
5614 if (s) RETURN_STATUS(s);
5616 bc_num_init_DEF_SIZE(&res.d.n);
5618 if (inst == XC_INST_BOOL_AND)
5619 cond = bc_num_cmp(n1, &G.prog.zero) && bc_num_cmp(n2, &G.prog.zero);
5620 else if (inst == XC_INST_BOOL_OR)
5621 cond = bc_num_cmp(n1, &G.prog.zero) || bc_num_cmp(n2, &G.prog.zero);
5623 cond = bc_num_cmp(n1, n2);
5625 case XC_INST_REL_EQ:
5628 case XC_INST_REL_LE:
5631 case XC_INST_REL_GE:
5634 case XC_INST_REL_LT:
5637 case XC_INST_REL_GT:
5640 default: // = case XC_INST_REL_NE:
5641 //cond = (cond != 0); - not needed
5646 if (cond) bc_num_one(&res.d.n);
5647 //else bc_num_zero(&res.d.n); - already is
5649 bc_program_binOpRetire(&res);
5653 #define zbc_program_logical(...) (zbc_program_logical(__VA_ARGS__) COMMA_SUCCESS)
5656 static BC_STATUS zdc_program_assignStr(BcResult *r, BcVec *v, bool push)
5661 memset(&n2, 0, sizeof(BcNum));
5662 n2.rdx = res.d.id.idx = r->d.id.idx;
5663 res.t = XC_RESULT_STR;
5666 if (!STACK_HAS_MORE_THAN(&G.prog.results, 1))
5667 RETURN_STATUS(bc_error_stack_has_too_few_elements());
5669 bc_vec_pop(&G.prog.results);
5672 bc_result_pop_and_push(&res);
5673 bc_vec_push(v, &n2);
5675 RETURN_STATUS(BC_STATUS_SUCCESS);
5677 #define zdc_program_assignStr(...) (zdc_program_assignStr(__VA_ARGS__) COMMA_SUCCESS)
5680 static BC_STATUS zbc_program_copyToVar(char *name, bool var)
5687 if (!STACK_HAS_MORE_THAN(&G.prog.results, 0))
5688 RETURN_STATUS(bc_error_stack_has_too_few_elements());
5690 ptr = bc_vec_top(&G.prog.results);
5691 if ((ptr->t == XC_RESULT_ARRAY) != !var)
5692 RETURN_STATUS(bc_error_variable_is_wrong_type());
5693 v = bc_program_search(name, var);
5696 if (ptr->t == XC_RESULT_STR && !var)
5697 RETURN_STATUS(bc_error_variable_is_wrong_type());
5698 if (ptr->t == XC_RESULT_STR)
5699 RETURN_STATUS(zdc_program_assignStr(ptr, v, true));
5702 s = zbc_program_num(ptr, &n, false);
5703 if (s) RETURN_STATUS(s);
5705 // Do this once more to make sure that pointers were not invalidated.
5706 v = bc_program_search(name, var);
5709 bc_num_init_DEF_SIZE(&r.d.n);
5710 bc_num_copy(&r.d.n, n);
5712 bc_array_init(&r.d.v, true);
5713 bc_array_copy(&r.d.v, (BcVec *) n);
5716 bc_vec_push(v, &r.d);
5717 bc_vec_pop(&G.prog.results);
5721 #define zbc_program_copyToVar(...) (zbc_program_copyToVar(__VA_ARGS__) COMMA_SUCCESS)
5723 static BC_STATUS zbc_program_assign(char inst)
5726 BcResult *left, *right, res;
5728 bool assign = (inst == XC_INST_ASSIGN);
5731 s = zbc_program_binOpPrep(&left, &l, &right, &r, assign);
5732 if (s) RETURN_STATUS(s);
5734 ib = left->t == XC_RESULT_IBASE;
5735 sc = left->t == XC_RESULT_SCALE;
5738 if (right->t == XC_RESULT_STR) {
5741 if (left->t != XC_RESULT_VAR)
5742 RETURN_STATUS(bc_error_variable_is_wrong_type());
5743 v = bc_program_search(left->d.id.name, true);
5745 RETURN_STATUS(zdc_program_assignStr(right, v, false));
5749 if (left->t == XC_RESULT_CONSTANT || left->t == XC_RESULT_TEMP)
5750 RETURN_STATUS(bc_error("bad assignment:"
5751 " left side must be variable"
5753 )); // note: shared string
5756 if (inst == BC_INST_ASSIGN_DIVIDE && !bc_num_cmp(r, &G.prog.zero))
5757 RETURN_STATUS(bc_error("divide by zero"));
5762 s = BC_STATUS_SUCCESS;
5763 IF_ERROR_RETURN_POSSIBLE(s =) zbc_program_ops[inst - BC_INST_ASSIGN_POWER](l, r, l, G.prog.scale);
5765 if (s) RETURN_STATUS(s);
5770 if (ib || sc || left->t == XC_RESULT_OBASE) {
5771 static const char *const msg[] = {
5772 "bad ibase; must be [2,16]", //XC_RESULT_IBASE
5773 "bad obase; must be [2,"BC_MAX_OBASE_STR"]", //XC_RESULT_OBASE
5774 "bad scale; must be [0,"BC_MAX_SCALE_STR"]", //XC_RESULT_SCALE
5780 s = zbc_num_ulong(l, &val);
5781 if (s) RETURN_STATUS(s);
5782 s = left->t - XC_RESULT_IBASE;
5785 ptr = &G.prog.scale;
5788 RETURN_STATUS(bc_error(msg[s]));
5789 max = ib ? BC_NUM_MAX_IBASE : BC_MAX_OBASE;
5790 ptr = ib ? &G.prog.ib_t : &G.prog.ob_t;
5794 RETURN_STATUS(bc_error(msg[s]));
5796 *ptr = (size_t) val;
5797 s = BC_STATUS_SUCCESS;
5800 bc_num_init(&res.d.n, l->len);
5801 bc_num_copy(&res.d.n, l);
5802 bc_program_binOpRetire(&res);
5806 #define zbc_program_assign(...) (zbc_program_assign(__VA_ARGS__) COMMA_SUCCESS)
5809 #define bc_program_pushVar(code, bgn, pop, copy) \
5810 bc_program_pushVar(code, bgn)
5811 // for bc, 'pop' and 'copy' are always false
5813 static BC_STATUS bc_program_pushVar(char *code, size_t *bgn,
5814 bool pop, bool copy)
5817 char *name = bc_program_name(code, bgn);
5819 r.t = XC_RESULT_VAR;
5824 BcVec *v = bc_program_search(name, true);
5825 BcNum *num = bc_vec_top(v);
5828 if (!STACK_HAS_MORE_THAN(v, 1 - copy)) {
5829 RETURN_STATUS(bc_error_stack_has_too_few_elements());
5832 if (!BC_PROG_STR(num)) {
5833 r.t = XC_RESULT_TEMP;
5834 bc_num_init_DEF_SIZE(&r.d.n);
5835 bc_num_copy(&r.d.n, num);
5837 r.t = XC_RESULT_STR;
5838 r.d.id.idx = num->rdx;
5841 if (!copy) bc_vec_pop(v);
5845 bc_vec_push(&G.prog.results, &r);
5847 RETURN_STATUS(BC_STATUS_SUCCESS);
5849 #define zbc_program_pushVar(...) (bc_program_pushVar(__VA_ARGS__) COMMA_SUCCESS)
5851 static BC_STATUS zbc_program_pushArray(char *code, size_t *bgn, char inst)
5853 BcStatus s = BC_STATUS_SUCCESS;
5857 r.d.id.name = bc_program_name(code, bgn);
5859 if (inst == XC_INST_ARRAY) {
5860 r.t = XC_RESULT_ARRAY;
5861 bc_vec_push(&G.prog.results, &r);
5866 s = zbc_program_prep(&operand, &num);
5868 s = zbc_num_ulong(num, &temp);
5871 if (temp > BC_MAX_DIM) {
5872 s = bc_error("array too long; must be [1,"BC_MAX_DIM_STR"]");
5876 r.d.id.idx = (size_t) temp;
5877 bc_program_retire(&r, XC_RESULT_ARRAY_ELEM);
5880 if (s) free(r.d.id.name);
5883 #define zbc_program_pushArray(...) (zbc_program_pushArray(__VA_ARGS__) COMMA_SUCCESS)
5886 static BC_STATUS zbc_program_incdec(char inst)
5889 BcResult *ptr, res, copy;
5893 s = zbc_program_prep(&ptr, &num);
5894 if (s) RETURN_STATUS(s);
5896 if (inst == BC_INST_INC_POST || inst == BC_INST_DEC_POST) {
5897 copy.t = XC_RESULT_TEMP;
5898 bc_num_init(©.d.n, num->len);
5899 bc_num_copy(©.d.n, num);
5902 res.t = BC_RESULT_ONE;
5903 inst = (inst == BC_INST_INC_PRE || inst == BC_INST_INC_POST)
5904 ? BC_INST_ASSIGN_PLUS
5905 : BC_INST_ASSIGN_MINUS;
5907 bc_vec_push(&G.prog.results, &res);
5908 s = zbc_program_assign(inst);
5909 if (s) RETURN_STATUS(s);
5911 if (inst2 == BC_INST_INC_POST || inst2 == BC_INST_DEC_POST) {
5912 bc_result_pop_and_push(©);
5917 #define zbc_program_incdec(...) (zbc_program_incdec(__VA_ARGS__) COMMA_SUCCESS)
5919 static BC_STATUS zbc_program_call(char *code, size_t *idx)
5927 nparams = bc_program_index(code, idx);
5929 ip.func = bc_program_index(code, idx);
5930 func = bc_program_func(ip.func);
5932 if (func->code.len == 0) {
5933 RETURN_STATUS(bc_error("undefined function"));
5935 if (nparams != func->nparams) {
5936 RETURN_STATUS(bc_error_fmt("function has %u parameters, but called with %u", func->nparams, nparams));
5938 ip.results_len_before_call = G.prog.results.len - nparams;
5940 for (i = 0; i < nparams; ++i) {
5943 a = bc_vec_item(&func->autos, nparams - 1 - i);
5944 arg = bc_vec_top(&G.prog.results);
5946 if ((!a->idx) != (arg->t == XC_RESULT_ARRAY) || arg->t == XC_RESULT_STR)
5947 RETURN_STATUS(bc_error_variable_is_wrong_type());
5949 s = zbc_program_copyToVar(a->name, a->idx);
5950 if (s) RETURN_STATUS(s);
5953 a = bc_vec_item(&func->autos, i);
5954 for (; i < func->autos.len; i++, a++) {
5957 v = bc_program_search(a->name, a->idx);
5960 bc_num_init_DEF_SIZE(&n2);
5961 bc_vec_push(v, &n2);
5964 bc_array_init(&v2, true);
5965 bc_vec_push(v, &v2);
5969 bc_vec_push(&G.prog.exestack, &ip);
5971 RETURN_STATUS(BC_STATUS_SUCCESS);
5973 #define zbc_program_call(...) (zbc_program_call(__VA_ARGS__) COMMA_SUCCESS)
5975 static BC_STATUS zbc_program_return(char inst)
5981 BcInstPtr *ip = bc_vec_top(&G.prog.exestack);
5983 if (!STACK_HAS_EQUAL_OR_MORE_THAN(&G.prog.results, ip->results_len_before_call + (inst == XC_INST_RET)))
5984 RETURN_STATUS(bc_error_stack_has_too_few_elements());
5986 f = bc_program_func(ip->func);
5987 res.t = XC_RESULT_TEMP;
5989 if (inst == XC_INST_RET) {
5992 BcResult *operand = bc_vec_top(&G.prog.results);
5994 s = zbc_program_num(operand, &num, false);
5995 if (s) RETURN_STATUS(s);
5996 bc_num_init(&res.d.n, num->len);
5997 bc_num_copy(&res.d.n, num);
5999 bc_num_init_DEF_SIZE(&res.d.n);
6000 //bc_num_zero(&res.d.n); - already is
6003 // We need to pop arguments as well, so this takes that into account.
6004 a = (void*)f->autos.v;
6005 for (i = 0; i < f->autos.len; i++, a++) {
6007 v = bc_program_search(a->name, a->idx);
6011 bc_vec_npop(&G.prog.results, G.prog.results.len - ip->results_len_before_call);
6012 bc_vec_push(&G.prog.results, &res);
6013 bc_vec_pop(&G.prog.exestack);
6015 RETURN_STATUS(BC_STATUS_SUCCESS);
6017 #define zbc_program_return(...) (zbc_program_return(__VA_ARGS__) COMMA_SUCCESS)
6020 static unsigned long bc_program_scale(BcNum *n)
6022 return (unsigned long) n->rdx;
6025 static unsigned long bc_program_len(BcNum *n)
6027 size_t len = n->len;
6029 if (n->rdx != len) return len;
6031 if (len == 0) break;
6033 if (n->num[len] != 0) break;
6038 static BC_STATUS zbc_program_builtin(char inst)
6044 bool len = (inst == XC_INST_LENGTH);
6046 if (!STACK_HAS_MORE_THAN(&G.prog.results, 0))
6047 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6048 opnd = bc_vec_top(&G.prog.results);
6050 s = zbc_program_num(opnd, &num, false);
6051 if (s) RETURN_STATUS(s);
6054 if (!BC_PROG_NUM(opnd, num) && !len)
6055 RETURN_STATUS(bc_error_variable_is_wrong_type());
6058 bc_num_init_DEF_SIZE(&res.d.n);
6060 if (inst == XC_INST_SQRT)
6061 s = zbc_num_sqrt(num, &res.d.n, G.prog.scale);
6063 else if (len != 0 && opnd->t == XC_RESULT_ARRAY) {
6064 bc_num_ulong2num(&res.d.n, (unsigned long) ((BcVec *) num)->len);
6068 else if (len != 0 && !BC_PROG_NUM(opnd, num)) {
6070 size_t idx = opnd->t == XC_RESULT_STR ? opnd->d.id.idx : num->rdx;
6072 str = bc_program_str(idx);
6073 bc_num_ulong2num(&res.d.n, strlen(*str));
6077 bc_num_ulong2num(&res.d.n, len ? bc_program_len(num) : bc_program_scale(num));
6080 bc_program_retire(&res, XC_RESULT_TEMP);
6084 #define zbc_program_builtin(...) (zbc_program_builtin(__VA_ARGS__) COMMA_SUCCESS)
6087 static BC_STATUS zdc_program_divmod(void)
6090 BcResult *opd1, *opd2, res, res2;
6093 s = zbc_program_binOpPrep(&opd1, &n1, &opd2, &n2, false);
6094 if (s) RETURN_STATUS(s);
6096 bc_num_init_DEF_SIZE(&res.d.n);
6097 bc_num_init(&res2.d.n, n2->len);
6099 s = zbc_num_divmod(n1, n2, &res2.d.n, &res.d.n, G.prog.scale);
6102 bc_program_binOpRetire(&res2);
6103 res.t = XC_RESULT_TEMP;
6104 bc_vec_push(&G.prog.results, &res);
6108 bc_num_free(&res2.d.n);
6109 bc_num_free(&res.d.n);
6112 #define zdc_program_divmod(...) (zdc_program_divmod(__VA_ARGS__) COMMA_SUCCESS)
6114 static BC_STATUS zdc_program_modexp(void)
6117 BcResult *r1, *r2, *r3, res;
6118 BcNum *n1, *n2, *n3;
6120 if (!STACK_HAS_MORE_THAN(&G.prog.results, 2))
6121 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6122 s = zbc_program_binOpPrep(&r2, &n2, &r3, &n3, false);
6123 if (s) RETURN_STATUS(s);
6125 r1 = bc_vec_item_rev(&G.prog.results, 2);
6126 s = zbc_program_num(r1, &n1, false);
6127 if (s) RETURN_STATUS(s);
6128 if (!BC_PROG_NUM(r1, n1))
6129 RETURN_STATUS(bc_error_variable_is_wrong_type());
6131 // Make sure that the values have their pointers updated, if necessary.
6132 if (r1->t == XC_RESULT_VAR || r1->t == XC_RESULT_ARRAY_ELEM) {
6133 if (r1->t == r2->t) {
6134 s = zbc_program_num(r2, &n2, false);
6135 if (s) RETURN_STATUS(s);
6137 if (r1->t == r3->t) {
6138 s = zbc_program_num(r3, &n3, false);
6139 if (s) RETURN_STATUS(s);
6143 bc_num_init(&res.d.n, n3->len);
6144 s = zdc_num_modexp(n1, n2, n3, &res.d.n);
6147 bc_vec_pop(&G.prog.results);
6148 bc_program_binOpRetire(&res);
6152 bc_num_free(&res.d.n);
6155 #define zdc_program_modexp(...) (zdc_program_modexp(__VA_ARGS__) COMMA_SUCCESS)
6157 static void dc_program_stackLen(void)
6160 size_t len = G.prog.results.len;
6162 res.t = XC_RESULT_TEMP;
6164 bc_num_init_DEF_SIZE(&res.d.n);
6165 bc_num_ulong2num(&res.d.n, len);
6166 bc_vec_push(&G.prog.results, &res);
6169 static BC_STATUS zdc_program_asciify(void)
6179 if (!STACK_HAS_MORE_THAN(&G.prog.results, 0))
6180 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6181 r = bc_vec_top(&G.prog.results);
6183 s = zbc_program_num(r, &num, false);
6184 if (s) RETURN_STATUS(s);
6186 if (BC_PROG_NUM(r, num)) {
6189 BcDig strmb_digs[ULONG_NUM_BUFSIZE];
6191 bc_num_init_DEF_SIZE(&n);
6192 bc_num_copy(&n, num);
6193 bc_num_truncate(&n, n.rdx);
6195 strmb.cap = ARRAY_SIZE(strmb_digs);
6196 strmb.num = strmb_digs;
6197 bc_num_ulong2num(&strmb, 0x100);
6198 s = zbc_num_mod(&n, &strmb, &n, 0);
6200 if (s) goto num_err;
6201 s = zbc_num_ulong(&n, &val);
6202 if (s) goto num_err;
6209 idx = (r->t == XC_RESULT_STR) ? r->d.id.idx : num->rdx;
6210 sp = *bc_program_str(idx);
6214 strs = (void*)G.prog.strs.v;
6215 for (idx = 0; idx < G.prog.strs.len; idx++) {
6216 if (strs[idx][0] == c && strs[idx][1] == '\0') {
6222 //str[1] = '\0'; - already is
6223 bc_vec_push(&G.prog.strs, &str);
6225 res.t = XC_RESULT_STR;
6227 bc_result_pop_and_push(&res);
6229 RETURN_STATUS(BC_STATUS_SUCCESS);
6234 #define zdc_program_asciify(...) (zdc_program_asciify(__VA_ARGS__) COMMA_SUCCESS)
6236 static BC_STATUS zdc_program_printStream(void)
6243 if (!STACK_HAS_MORE_THAN(&G.prog.results, 0))
6244 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6245 r = bc_vec_top(&G.prog.results);
6247 s = zbc_program_num(r, &n, false);
6248 if (s) RETURN_STATUS(s);
6250 if (BC_PROG_NUM(r, n)) {
6251 s = zbc_num_printNum(n, 0x100, 1, dc_num_printChar);
6254 idx = (r->t == XC_RESULT_STR) ? r->d.id.idx : n->rdx;
6255 str = *bc_program_str(idx);
6261 #define zdc_program_printStream(...) (zdc_program_printStream(__VA_ARGS__) COMMA_SUCCESS)
6263 static BC_STATUS zdc_program_nquit(void)
6270 s = zbc_program_prep(&opnd, &num);
6271 if (s) RETURN_STATUS(s);
6272 s = zbc_num_ulong(num, &val);
6273 if (s) RETURN_STATUS(s);
6275 bc_vec_pop(&G.prog.results);
6277 if (G.prog.exestack.len < val)
6278 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6279 if (G.prog.exestack.len == val) {
6280 QUIT_OR_RETURN_TO_MAIN;
6283 bc_vec_npop(&G.prog.exestack, val);
6287 #define zdc_program_nquit(...) (zdc_program_nquit(__VA_ARGS__) COMMA_SUCCESS)
6289 static BC_STATUS zdc_program_execStr(char *code, size_t *bgn, bool cond)
6291 BcStatus s = BC_STATUS_SUCCESS;
6297 if (!STACK_HAS_MORE_THAN(&G.prog.results, 0))
6298 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6300 r = bc_vec_top(&G.prog.results);
6303 BcNum *n = n; // for compiler
6306 char *then_name = bc_program_name(code, bgn);
6307 char *else_name = NULL;
6309 if (code[*bgn] == BC_PARSE_STREND)
6312 else_name = bc_program_name(code, bgn);
6314 exec = r->d.n.len != 0;
6316 if (!exec && else_name != NULL) {
6323 v = bc_program_search(name, true);
6330 if (!exec) goto exit;
6331 if (!BC_PROG_STR(n)) {
6332 s = bc_error_variable_is_wrong_type();
6338 if (r->t == XC_RESULT_STR) {
6340 } else if (r->t == XC_RESULT_VAR) {
6342 s = zbc_program_num(r, &n, false);
6343 if (s || !BC_PROG_STR(n)) goto exit;
6349 fidx = sidx + BC_PROG_REQ_FUNCS;
6351 f = bc_program_func(fidx);
6353 if (f->code.len == 0) {
6357 sv_parse = G.prs; // struct copy
6358 bc_parse_create(fidx);
6359 str = *bc_program_str(sidx);
6360 s = zbc_parse_text_init(str);
6363 s = zdc_parse_exprs_until_eof();
6365 bc_parse_push(DC_INST_POP_EXEC);
6366 if (G.prs.lex != XC_LEX_EOF)
6367 s = bc_error_bad_expression();
6369 G.prs = sv_parse; // struct copy
6372 bc_vec_pop_all(&f->code);
6380 bc_vec_pop(&G.prog.results);
6381 bc_vec_push(&G.prog.exestack, &ip);
6383 RETURN_STATUS(BC_STATUS_SUCCESS);
6385 bc_vec_pop(&G.prog.results);
6388 #define zdc_program_execStr(...) (zdc_program_execStr(__VA_ARGS__) COMMA_SUCCESS)
6391 static void bc_program_pushGlobal(char inst)
6396 res.t = inst - XC_INST_IBASE + XC_RESULT_IBASE;
6397 if (inst == XC_INST_IBASE)
6398 val = (unsigned long) G.prog.ib_t;
6399 else if (inst == XC_INST_SCALE)
6400 val = (unsigned long) G.prog.scale;
6402 val = (unsigned long) G.prog.ob_t;
6404 bc_num_init_DEF_SIZE(&res.d.n);
6405 bc_num_ulong2num(&res.d.n, val);
6406 bc_vec_push(&G.prog.results, &res);
6409 static BC_STATUS zbc_program_exec(void)
6412 BcInstPtr *ip = bc_vec_top(&G.prog.exestack);
6413 BcFunc *func = bc_program_func(ip->func);
6414 char *code = func->code.v;
6416 dbg_exec("func:%zd bytes:%zd ip:%zd results.len:%d",
6417 ip->func, func->code.len, ip->inst_idx, G.prog.results.len);
6418 while (ip->inst_idx < func->code.len) {
6419 BcStatus s = BC_STATUS_SUCCESS;
6420 char inst = code[ip->inst_idx++];
6422 dbg_exec("inst at %zd:%d results.len:%d", ip->inst_idx - 1, inst, G.prog.results.len);
6425 case BC_INST_JUMP_ZERO: {
6428 dbg_exec("BC_INST_JUMP_ZERO:");
6429 s = zbc_program_prep(&ptr, &num);
6430 if (s) RETURN_STATUS(s);
6431 zero = (bc_num_cmp(num, &G.prog.zero) == 0);
6432 bc_vec_pop(&G.prog.results);
6434 bc_program_index(code, &ip->inst_idx);
6437 // else: fall through
6439 case BC_INST_JUMP: {
6440 size_t idx = bc_program_index(code, &ip->inst_idx);
6441 size_t *addr = bc_vec_item(&func->labels, idx);
6442 dbg_exec("BC_INST_JUMP: to %ld", (long)*addr);
6443 ip->inst_idx = *addr;
6447 dbg_exec("BC_INST_CALL:");
6448 s = zbc_program_call(code, &ip->inst_idx);
6449 goto read_updated_ip;
6450 case BC_INST_INC_PRE:
6451 case BC_INST_DEC_PRE:
6452 case BC_INST_INC_POST:
6453 case BC_INST_DEC_POST:
6454 dbg_exec("BC_INST_INCDEC:");
6455 s = zbc_program_incdec(inst);
6458 dbg_exec("BC_INST_HALT:");
6459 QUIT_OR_RETURN_TO_MAIN;
6463 dbg_exec("BC_INST_RET[0]:");
6464 s = zbc_program_return(inst);
6465 goto read_updated_ip;
6466 case XC_INST_BOOL_OR:
6467 case XC_INST_BOOL_AND:
6469 case XC_INST_REL_EQ:
6470 case XC_INST_REL_LE:
6471 case XC_INST_REL_GE:
6472 case XC_INST_REL_NE:
6473 case XC_INST_REL_LT:
6474 case XC_INST_REL_GT:
6475 dbg_exec("BC_INST_BOOL:");
6476 s = zbc_program_logical(inst);
6479 dbg_exec("XC_INST_READ:");
6480 s = zbc_program_read();
6481 goto read_updated_ip;
6483 dbg_exec("XC_INST_VAR:");
6484 s = zbc_program_pushVar(code, &ip->inst_idx, false, false);
6486 case XC_INST_ARRAY_ELEM:
6488 dbg_exec("XC_INST_ARRAY[_ELEM]:");
6489 s = zbc_program_pushArray(code, &ip->inst_idx, inst);
6493 dbg_exec("BC_INST_LAST:");
6494 r.t = BC_RESULT_LAST;
6495 bc_vec_push(&G.prog.results, &r);
6501 dbg_exec("XC_INST_internalvar(%d):", inst - XC_INST_IBASE);
6502 bc_program_pushGlobal(inst);
6504 case XC_INST_SCALE_FUNC:
6505 case XC_INST_LENGTH:
6507 dbg_exec("BC_INST_builtin:");
6508 s = zbc_program_builtin(inst);
6511 dbg_exec("XC_INST_NUM:");
6512 r.t = XC_RESULT_CONSTANT;
6513 r.d.id.idx = bc_program_index(code, &ip->inst_idx);
6514 bc_vec_push(&G.prog.results, &r);
6517 dbg_exec("XC_INST_POP:");
6518 if (!STACK_HAS_MORE_THAN(&G.prog.results, 0))
6519 s = bc_error_stack_has_too_few_elements();
6521 bc_vec_pop(&G.prog.results);
6524 case XC_INST_PRINT_POP:
6525 case XC_INST_PRINT_STR:
6526 dbg_exec("XC_INST_PRINTxyz:");
6527 s = zbc_program_print(inst, 0);
6530 dbg_exec("XC_INST_STR:");
6531 r.t = XC_RESULT_STR;
6532 r.d.id.idx = bc_program_index(code, &ip->inst_idx);
6533 bc_vec_push(&G.prog.results, &r);
6536 case XC_INST_MULTIPLY:
6537 case XC_INST_DIVIDE:
6538 case XC_INST_MODULUS:
6541 dbg_exec("BC_INST_binaryop:");
6542 s = zbc_program_op(inst);
6544 case XC_INST_BOOL_NOT: {
6546 dbg_exec("XC_INST_BOOL_NOT:");
6547 s = zbc_program_prep(&ptr, &num);
6548 if (s) RETURN_STATUS(s);
6549 bc_num_init_DEF_SIZE(&r.d.n);
6550 if (bc_num_cmp(num, &G.prog.zero) == 0)
6552 //else bc_num_zero(&r.d.n); - already is
6553 bc_program_retire(&r, XC_RESULT_TEMP);
6557 dbg_exec("XC_INST_NEG:");
6558 s = zbc_program_negate();
6561 case BC_INST_ASSIGN_POWER:
6562 case BC_INST_ASSIGN_MULTIPLY:
6563 case BC_INST_ASSIGN_DIVIDE:
6564 case BC_INST_ASSIGN_MODULUS:
6565 case BC_INST_ASSIGN_PLUS:
6566 case BC_INST_ASSIGN_MINUS:
6568 case XC_INST_ASSIGN:
6569 dbg_exec("BC_INST_ASSIGNxyz:");
6570 s = zbc_program_assign(inst);
6573 case DC_INST_POP_EXEC:
6574 dbg_exec("DC_INST_POP_EXEC:");
6575 bc_vec_pop(&G.prog.exestack);
6576 goto read_updated_ip;
6577 case DC_INST_MODEXP:
6578 dbg_exec("DC_INST_MODEXP:");
6579 s = zdc_program_modexp();
6581 case DC_INST_DIVMOD:
6582 dbg_exec("DC_INST_DIVMOD:");
6583 s = zdc_program_divmod();
6585 case DC_INST_EXECUTE:
6586 case DC_INST_EXEC_COND:
6587 dbg_exec("DC_INST_EXEC[_COND]:");
6588 s = zdc_program_execStr(code, &ip->inst_idx, inst == DC_INST_EXEC_COND);
6589 goto read_updated_ip;
6590 case DC_INST_PRINT_STACK: {
6592 dbg_exec("DC_INST_PRINT_STACK:");
6593 for (idx = 0; idx < G.prog.results.len; ++idx) {
6594 s = zbc_program_print(XC_INST_PRINT, idx);
6599 case DC_INST_CLEAR_STACK:
6600 dbg_exec("DC_INST_CLEAR_STACK:");
6601 bc_vec_pop_all(&G.prog.results);
6603 case DC_INST_STACK_LEN:
6604 dbg_exec("DC_INST_STACK_LEN:");
6605 dc_program_stackLen();
6607 case DC_INST_DUPLICATE:
6608 dbg_exec("DC_INST_DUPLICATE:");
6609 if (!STACK_HAS_MORE_THAN(&G.prog.results, 0))
6610 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6611 ptr = bc_vec_top(&G.prog.results);
6612 dc_result_copy(&r, ptr);
6613 bc_vec_push(&G.prog.results, &r);
6615 case DC_INST_SWAP: {
6617 dbg_exec("DC_INST_SWAP:");
6618 if (!STACK_HAS_MORE_THAN(&G.prog.results, 1))
6619 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6620 ptr = bc_vec_item_rev(&G.prog.results, 0);
6621 ptr2 = bc_vec_item_rev(&G.prog.results, 1);
6622 memcpy(&r, ptr, sizeof(BcResult));
6623 memcpy(ptr, ptr2, sizeof(BcResult));
6624 memcpy(ptr2, &r, sizeof(BcResult));
6627 case DC_INST_ASCIIFY:
6628 dbg_exec("DC_INST_ASCIIFY:");
6629 s = zdc_program_asciify();
6631 case DC_INST_PRINT_STREAM:
6632 dbg_exec("DC_INST_PRINT_STREAM:");
6633 s = zdc_program_printStream();
6636 case DC_INST_PUSH_VAR: {
6637 bool copy = inst == DC_INST_LOAD;
6638 s = zbc_program_pushVar(code, &ip->inst_idx, true, copy);
6641 case DC_INST_PUSH_TO_VAR: {
6642 char *name = bc_program_name(code, &ip->inst_idx);
6643 s = zbc_program_copyToVar(name, true);
6648 dbg_exec("DC_INST_QUIT:");
6649 if (G.prog.exestack.len <= 2)
6650 QUIT_OR_RETURN_TO_MAIN;
6651 bc_vec_npop(&G.prog.exestack, 2);
6652 goto read_updated_ip;
6654 dbg_exec("DC_INST_NQUIT:");
6655 s = zdc_program_nquit();
6656 //goto read_updated_ip; - just fall through to it
6659 // Instruction stack has changed, read new pointers
6660 ip = bc_vec_top(&G.prog.exestack);
6661 func = bc_program_func(ip->func);
6662 code = func->code.v;
6663 dbg_exec("func:%zd bytes:%zd ip:%zd", ip->func, func->code.len, ip->inst_idx);
6666 if (s || G_interrupt) {
6674 RETURN_STATUS(BC_STATUS_SUCCESS);
6676 #define zbc_program_exec(...) (zbc_program_exec(__VA_ARGS__) COMMA_SUCCESS)
6678 static unsigned bc_vm_envLen(const char *var)
6684 len = BC_NUM_PRINT_WIDTH;
6685 if (!lenv) return len;
6687 len = bb_strtou(lenv, NULL, 10) - 1;
6688 if (errno || len < 2 || len >= INT_MAX)
6689 len = BC_NUM_PRINT_WIDTH;
6694 static BC_STATUS zbc_vm_process(const char *text)
6698 dbg_lex_enter("%s:%d entered", __func__, __LINE__);
6699 s = zbc_parse_text_init(text); // does the first zbc_lex_next()
6700 if (s) RETURN_STATUS(s);
6703 while (G.prs.lex != XC_LEX_EOF) {
6707 dbg_lex("%s:%d G.prs.lex:%d, parsing...", __func__, __LINE__, G.prs.lex);
6710 if (G.prs.lex == BC_LEX_SCOLON
6711 || G.prs.lex == XC_LEX_NLINE
6718 s = zbc_parse_stmt_or_funcdef();
6721 // Check that next token is a correct stmt delimiter -
6722 // disallows "print 1 print 2" and such.
6723 if (G.prs.lex != BC_LEX_SCOLON
6724 && G.prs.lex != XC_LEX_NLINE
6725 && G.prs.lex != XC_LEX_EOF
6728 //TODO: commonalize for other parse errors:
6729 err_at = G.prs.lex_next_at ? G.prs.lex_next_at : "UNKNOWN";
6730 bc_error_fmt("bad statement terminator at '%.*s'",
6731 (int)(strchrnul(err_at, '\n') - err_at),
6736 // The above logic is fragile. Check these examples:
6737 // - interative read() still works
6741 // Most of dc parsing assumes all whitespace,
6742 // including '\n', is eaten.
6743 while (G.prs.lex == XC_LEX_NLINE) {
6746 if (G.prs.lex == XC_LEX_EOF)
6749 s = zdc_parse_expr();
6752 if (s || G_interrupt) {
6754 bc_parse_reset(); // includes bc_program_reset()
6755 RETURN_STATUS(BC_STATUS_FAILURE);
6758 dbg_lex("%s:%d executing...", __func__, __LINE__);
6759 s = zbc_program_exec();
6765 ip = (void*)G.prog.exestack.v;
6767 if (G.prog.exestack.len != 1) // should have only main's IP
6768 bb_error_msg_and_die("BUG:call stack");
6769 if (ip->func != BC_PROG_MAIN)
6770 bb_error_msg_and_die("BUG:not MAIN");
6772 f = bc_program_func_BC_PROG_MAIN();
6773 // bc discards strings, constants and code after each
6774 // top-level statement in the "main program".
6775 // This prevents "yes 1 | bc" from growing its memory
6776 // without bound. This can be done because data stack
6777 // is empty and thus can't hold any references to
6778 // strings or constants, there is no generated code
6779 // which can hold references (after we discard one
6780 // we just executed). Code of functions can have references,
6781 // but bc stores function strings/constants in per-function
6785 if (G.prog.results.len != 0) // should be empty
6786 bb_error_msg_and_die("BUG:data stack");
6788 IF_BC(bc_vec_pop_all(&f->strs);)
6789 IF_BC(bc_vec_pop_all(&f->consts);)
6791 if (G.prog.results.len == 0
6792 && G.prog.vars.len == 0
6794 // If stack is empty and no registers exist (TODO: or they are all empty),
6795 // we can get rid of accumulated strings and constants.
6796 // In this example dc process should not grow
6797 // its memory consumption with time:
6799 IF_DC(bc_vec_pop_all(&G.prog.strs);)
6800 IF_DC(bc_vec_pop_all(&G.prog.consts);)
6802 // The code is discarded always (below), thus this example
6803 // should also not grow its memory consumption with time,
6804 // even though its data stack is not empty:
6805 // { echo 1; yes dk; } | dc
6807 // We drop generated and executed code for both bc and dc:
6808 bc_vec_pop_all(&f->code);
6812 dbg_lex_done("%s:%d done", __func__, __LINE__);
6815 #define zbc_vm_process(...) (zbc_vm_process(__VA_ARGS__) COMMA_SUCCESS)
6817 static BC_STATUS zbc_vm_execute_FILE(FILE *fp, const char *filename)
6819 // So far bc/dc have no way to include a file from another file,
6820 // therefore we know G.prs.lex_filename == NULL on entry
6821 //const char *sv_file;
6824 G.prs.lex_filename = filename;
6825 G.prs.lex_input_fp = fp;
6826 G.err_line = G.prs.lex_line = 1;
6829 s = zbc_vm_process("");
6830 // We do not stop looping on errors here if reading stdin.
6831 // Example: start interactive bc and enter "return".
6832 // It should say "'return' not in a function"
6833 // but should not exit.
6834 } while (G.prs.lex_input_fp == stdin);
6835 G.prs.lex_filename = NULL;
6838 #define zbc_vm_execute_FILE(...) (zbc_vm_execute_FILE(__VA_ARGS__) COMMA_SUCCESS)
6840 static BC_STATUS zbc_vm_file(const char *file)
6845 fp = xfopen_for_read(file);
6846 s = zbc_vm_execute_FILE(fp, file);
6851 #define zbc_vm_file(...) (zbc_vm_file(__VA_ARGS__) COMMA_SUCCESS)
6854 static void bc_vm_info(void)
6856 printf("%s "BB_VER"\n"
6857 "Adapted from https://github.com/gavinhoward/bc\n"
6858 "Original code (c) 2018 Gavin D. Howard and contributors\n"
6862 static void bc_args(char **argv)
6868 #if ENABLE_FEATURE_BC_LONG_OPTIONS
6869 opts = option_mask32 |= getopt32long(argv, "wvsqli",
6870 "warn\0" No_argument "w"
6871 "version\0" No_argument "v"
6872 "standard\0" No_argument "s"
6873 "quiet\0" No_argument "q"
6874 "mathlib\0" No_argument "l"
6875 "interactive\0" No_argument "i"
6878 opts = option_mask32 |= getopt32(argv, "wvsqli");
6880 if (getenv("POSIXLY_CORRECT"))
6881 option_mask32 |= BC_FLAG_S;
6883 if (opts & BC_FLAG_V) {
6888 for (i = optind; argv[i]; ++i)
6889 bc_vec_push(&G.files, argv + i);
6892 static void bc_vm_envArgs(void)
6896 char *env_args = getenv("BC_ENV_ARGS");
6898 if (!env_args) return;
6900 G.env_args = xstrdup(env_args);
6903 bc_vec_init(&v, sizeof(char *), NULL);
6905 while (*(buf = skip_whitespace(buf)) != '\0') {
6906 bc_vec_push(&v, &buf);
6907 buf = skip_non_whitespace(buf);
6913 // NULL terminate, and pass argv[] so that first arg is argv[1]
6914 if (sizeof(int) == sizeof(char*)) {
6915 bc_vec_push(&v, &const_int_0);
6917 static char *const nullptr = NULL;
6918 bc_vec_push(&v, &nullptr);
6920 bc_args(((char **)v.v) - 1);
6925 static const char bc_lib[] ALIGN1 = {
6928 "\n" "auto b,s,n,r,d,i,p,f,v"
6929 ////////////////"if(x<0)return(1/e(-x))" // and drop 'n' and x<0 logic below
6930 //^^^^^^^^^^^^^^^^ this would work, and is even more precise than GNU bc:
6931 //e(-.998896): GNU:.36828580434569428695
6932 // above code:.36828580434569428696
6933 // actual value:.3682858043456942869594...
6934 // but for now let's be "GNU compatible"
6943 "\n" "scale=scale(x)+1"
6953 "\n" "for(i=2;v;++i){"
6959 "\n" "while(d--)r*=r"
6962 "\n" "if(n)return(1/r)"
6966 "\n" "auto b,s,r,p,a,q,i,v"
6970 "\n" "r=(1-10^scale)/1"
6981 "\n" "while(x<=.5){"
6985 "\n" "r=a=(x-1)/(x+1)"
6988 "\n" "for(i=3;v;i+=2){"
6999 "\n" "auto b,s,r,a,q,i"
7000 "\n" "if(x<0)return(-s(-x))"
7004 "\n" "scale=1.1*s+2"
7013 "\n" "for(i=3;a;i+=2){"
7014 "\n" "a*=q/(i*(i-1))"
7027 "\n" "x=s(2*a(1)+x)"
7033 "\n" "auto b,s,r,n,a,m,t,f,i,u"
7041 "\n" "if(scale<65){"
7042 "\n" "if(x==1)return(.7853981633974483096156608458198757210492923498437764552437361480/n)"
7043 "\n" "if(x==.2)return(.1973955598498807583700497651947902934475851037878521015176889402/n)"
7053 "\n" "x=(x-.2)/(1+.2*x)"
7058 "\n" "for(i=3;t;i+=2){"
7065 "\n" "return((m*a+r)/n)"
7067 "\n" "define j(n,x){"
7068 "\n" "auto b,s,o,a,i,v,f"
7079 "\n" "for(i=2;i<=n;++i)a*=i"
7081 "\n" "a=(x^n)/2^n/a"
7084 "\n" "scale+=length(a)-scale(a)"
7085 "\n" "for(i=1;v;++i){"
7086 "\n" "v=v*f/i/(n+i)"
7092 "\n" "return(a*r/1)"
7097 static BC_STATUS zbc_vm_exec(void)
7104 if (option_mask32 & BC_FLAG_L) {
7105 // We know that internal library is not buggy,
7106 // thus error checking is normally disabled.
7107 # define DEBUG_LIB 0
7108 s = zbc_vm_process(bc_lib);
7109 if (DEBUG_LIB && s) RETURN_STATUS(s);
7113 s = BC_STATUS_SUCCESS;
7114 fname = (void*)G.files.v;
7115 for (i = 0; i < G.files.len; i++) {
7116 s = zbc_vm_file(*fname++);
7117 if (ENABLE_FEATURE_CLEAN_UP && !G_ttyin && s) {
7118 // Debug config, non-interactive mode:
7119 // return all the way back to main.
7120 // Non-debug builds do not come here
7121 // in non-interactive mode, they exit.
7126 if (IS_BC || (option_mask32 & BC_FLAG_I))
7127 s = zbc_vm_execute_FILE(stdin, /*filename:*/ NULL);
7131 #define zbc_vm_exec(...) (zbc_vm_exec(__VA_ARGS__) COMMA_SUCCESS)
7133 #if ENABLE_FEATURE_CLEAN_UP
7134 static void bc_program_free(void)
7136 bc_vec_free(&G.prog.fns);
7137 IF_BC(bc_vec_free(&G.prog.fn_map);)
7138 bc_vec_free(&G.prog.vars);
7139 bc_vec_free(&G.prog.var_map);
7140 bc_vec_free(&G.prog.arrs);
7141 bc_vec_free(&G.prog.arr_map);
7142 IF_DC(bc_vec_free(&G.prog.strs);)
7143 IF_DC(bc_vec_free(&G.prog.consts);)
7144 bc_vec_free(&G.prog.results);
7145 bc_vec_free(&G.prog.exestack);
7146 IF_BC(bc_num_free(&G.prog.last);)
7147 IF_BC(bc_num_free(&G.prog.zero);)
7148 IF_BC(bc_num_free(&G.prog.one);)
7149 bc_vec_free(&G.input_buffer);
7152 static void bc_vm_free(void)
7154 bc_vec_free(&G.files);
7161 static void bc_program_init(void)
7165 // memset(&G.prog, 0, sizeof(G.prog)); - already is
7166 memset(&ip, 0, sizeof(BcInstPtr));
7168 // G.prog.nchars = G.prog.scale = 0; - already is
7172 IF_BC(bc_num_init_DEF_SIZE(&G.prog.last);)
7173 //IF_BC(bc_num_zero(&G.prog.last);) - already is
7175 bc_num_init_DEF_SIZE(&G.prog.zero);
7176 //bc_num_zero(&G.prog.zero); - already is
7178 IF_BC(bc_num_init_DEF_SIZE(&G.prog.one);)
7179 IF_BC(bc_num_one(&G.prog.one);)
7181 bc_vec_init(&G.prog.fns, sizeof(BcFunc), bc_func_free);
7182 IF_BC(bc_vec_init(&G.prog.fn_map, sizeof(BcId), bc_id_free);)
7185 // Names are chosen simply to be distinct and never match
7186 // a valid function name (and be short)
7187 IF_BC(bc_program_addFunc(xstrdup(""))); // func #0: main
7188 IF_BC(bc_program_addFunc(xstrdup("1"))); // func #1: for read()
7190 // in dc, functions have no names
7191 bc_program_add_fn();
7192 bc_program_add_fn();
7195 bc_vec_init(&G.prog.vars, sizeof(BcVec), bc_vec_free);
7196 bc_vec_init(&G.prog.var_map, sizeof(BcId), bc_id_free);
7198 bc_vec_init(&G.prog.arrs, sizeof(BcVec), bc_vec_free);
7199 bc_vec_init(&G.prog.arr_map, sizeof(BcId), bc_id_free);
7201 IF_DC(bc_vec_init(&G.prog.strs, sizeof(char *), bc_string_free);)
7202 IF_DC(bc_vec_init(&G.prog.consts, sizeof(char *), bc_string_free);)
7203 bc_vec_init(&G.prog.results, sizeof(BcResult), bc_result_free);
7204 bc_vec_init(&G.prog.exestack, sizeof(BcInstPtr), NULL);
7205 bc_vec_push(&G.prog.exestack, &ip);
7207 bc_char_vec_init(&G.input_buffer);
7210 static int bc_vm_init(const char *env_len)
7212 #if ENABLE_FEATURE_EDITING
7213 G.line_input_state = new_line_input_t(DO_HISTORY);
7215 G.prog.len = bc_vm_envLen(env_len);
7217 bc_vec_init(&G.files, sizeof(char *), NULL);
7218 IF_BC(if (IS_BC) bc_vm_envArgs();)
7220 bc_parse_create(BC_PROG_MAIN);
7222 //TODO: in GNU bc, the check is (isatty(0) && isatty(1)),
7223 //-i option unconditionally enables this regardless of isatty():
7225 #if ENABLE_FEATURE_BC_SIGNALS
7227 // With SA_RESTART, most system calls will restart
7228 // (IOW: they won't fail with EINTR).
7229 // In particular, this means ^C won't cause
7230 // stdout to get into "error state" if SIGINT hits
7231 // within write() syscall.
7233 // The downside is that ^C while tty input is taken
7234 // will only be handled after [Enter] since read()
7235 // from stdin is not interrupted by ^C either,
7236 // it restarts, thus fgetc() does not return on ^C.
7237 // (This problem manifests only if line editing is disabled)
7238 signal_SA_RESTART_empty_mask(SIGINT, record_signo);
7240 // Without SA_RESTART, this exhibits a bug:
7241 // "while (1) print 1" and try ^C-ing it.
7242 // Intermittently, instead of returning to input line,
7243 // you'll get "output error: Interrupted system call"
7245 //signal_no_SA_RESTART_empty_mask(SIGINT, record_signo);
7249 return 0; // "not a tty"
7252 static BcStatus bc_vm_run(void)
7254 BcStatus st = zbc_vm_exec();
7255 #if ENABLE_FEATURE_CLEAN_UP
7256 if (G_exiting) // it was actually "halt" or "quit"
7259 # if ENABLE_FEATURE_EDITING
7260 free_line_input_t(G.line_input_state);
7264 dbg_exec("exiting with exitcode %d", st);
7269 int bc_main(int argc, char **argv) MAIN_EXTERNALLY_VISIBLE;
7270 int bc_main(int argc UNUSED_PARAM, char **argv)
7276 is_tty = bc_vm_init("BC_LINE_LENGTH");
7280 if (is_tty && !(option_mask32 & BC_FLAG_Q))
7288 int dc_main(int argc, char **argv) MAIN_EXTERNALLY_VISIBLE;
7289 int dc_main(int argc UNUSED_PARAM, char **argv)
7295 // TODO: dc (GNU bc 1.07.1) 1.4.1 seems to use width
7296 // 1 char wider than bc from the same package.
7297 // Both default width, and xC_LINE_LENGTH=N are wider:
7298 // "DC_LINE_LENGTH=5 dc -e'123456 p'" prints:
7301 // "echo '123456' | BC_LINE_LENGTH=5 bc" prints:
7304 // Do the same, or it's a bug?
7305 bc_vm_init("DC_LINE_LENGTH");
7307 // Run -e'SCRIPT' and -fFILE in order of appearance, then handle FILEs
7308 noscript = BC_FLAG_I;
7310 int n = getopt(argc, argv, "e:f:x");
7316 n = zbc_vm_process(optarg);
7321 n = zbc_vm_file(optarg);
7325 option_mask32 |= DC_FLAG_X;
7335 bc_vec_push(&G.files, argv++);
7338 option_mask32 |= noscript; // set BC_FLAG_I if we need to interpret stdin
7344 #endif // not DC_SMALL