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
718 const char *lex_inbuf;
720 const char *lex_next_at; // last lex_next() was called at this string
721 const char *lex_filename;
727 IF_BC(size_t in_funcdef;)
733 typedef struct BcProgram {
762 BcParse prs; // first member is most used
764 // For error messages. Can be set to current parsed line,
765 // or [TODO] to current executing line (can be before last parsed one)
770 IF_FEATURE_BC_SIGNALS(smallint ttyin;)
771 IF_FEATURE_CLEAN_UP(smallint exiting;)
779 #if ENABLE_FEATURE_EDITING
780 line_input_t *line_input_state;
783 #define G (*ptr_to_globals)
784 #define INIT_G() do { \
785 SET_PTR_TO_GLOBALS(xzalloc(sizeof(G))); \
787 #define FREE_G() do { \
788 FREE_PTR_TO_GLOBALS(); \
790 #define G_posix (ENABLE_BC && (option_mask32 & BC_FLAG_S))
791 #define G_warn (ENABLE_BC && (option_mask32 & BC_FLAG_W))
792 #define G_exreg (ENABLE_DC && (option_mask32 & DC_FLAG_X))
793 #if ENABLE_FEATURE_BC_SIGNALS
794 # define G_interrupt bb_got_signal
795 # define G_ttyin G.ttyin
797 # define G_interrupt 0
800 #if ENABLE_FEATURE_CLEAN_UP
801 # define G_exiting G.exiting
805 #define IS_BC (ENABLE_BC && (!ENABLE_DC || applet_name[0] == 'b'))
806 #define IS_DC (ENABLE_DC && (!ENABLE_BC || applet_name[0] != 'b'))
808 #define BC_PARSE_STREND (0xff)
811 # define BC_PARSE_REL (1 << 0)
812 # define BC_PARSE_PRINT (1 << 1)
813 # define BC_PARSE_ARRAY (1 << 2)
814 # define BC_PARSE_NOCALL (1 << 3)
817 #define BC_PROG_MAIN (0)
818 #define BC_PROG_READ (1)
820 #define BC_PROG_REQ_FUNCS (2)
823 #define BC_PROG_STR(n) (!(n)->num && !(n)->cap)
824 #define BC_PROG_NUM(r, n) \
825 ((r)->t != XC_RESULT_ARRAY && (r)->t != XC_RESULT_STR && !BC_PROG_STR(n))
827 #define BC_FLAG_W (1 << 0)
828 #define BC_FLAG_V (1 << 1)
829 #define BC_FLAG_S (1 << 2)
830 #define BC_FLAG_Q (1 << 3)
831 #define BC_FLAG_L (1 << 4)
832 #define BC_FLAG_I (1 << 5)
833 #define DC_FLAG_X (1 << 6)
835 #define BC_MAX(a, b) ((a) > (b) ? (a) : (b))
836 #define BC_MIN(a, b) ((a) < (b) ? (a) : (b))
838 #define BC_MAX_OBASE ((unsigned) 999)
839 #define BC_MAX_DIM ((unsigned) INT_MAX)
840 #define BC_MAX_SCALE ((unsigned) UINT_MAX)
841 #define BC_MAX_STRING ((unsigned) UINT_MAX - 1)
842 #define BC_MAX_NUM BC_MAX_STRING
843 // Unused apart from "limits" message. Just show a "biggish number" there.
844 //#define BC_MAX_NAME BC_MAX_STRING
845 //#define BC_MAX_EXP ((unsigned long) LONG_MAX)
846 //#define BC_MAX_VARS ((unsigned long) SIZE_MAX - 1)
847 #define BC_MAX_NAME_STR "999999999"
848 #define BC_MAX_EXP_STR "999999999"
849 #define BC_MAX_VARS_STR "999999999"
851 #define BC_MAX_OBASE_STR "999"
853 #if INT_MAX == 2147483647
854 # define BC_MAX_DIM_STR "2147483647"
855 #elif INT_MAX == 9223372036854775807
856 # define BC_MAX_DIM_STR "9223372036854775807"
858 # error Strange INT_MAX
861 #if UINT_MAX == 4294967295
862 # define BC_MAX_SCALE_STR "4294967295"
863 # define BC_MAX_STRING_STR "4294967294"
864 #elif UINT_MAX == 18446744073709551615
865 # define BC_MAX_SCALE_STR "18446744073709551615"
866 # define BC_MAX_STRING_STR "18446744073709551614"
868 # error Strange UINT_MAX
870 #define BC_MAX_NUM_STR BC_MAX_STRING_STR
872 // In configurations where errors abort instead of propagating error
873 // return code up the call chain, functions returning BC_STATUS
874 // actually don't return anything, they always succeed and return "void".
875 // A macro wrapper is provided, which makes this statement work:
877 // and makes it visible to the compiler that s is always zero,
878 // allowing compiler to optimize dead code after the statement.
880 // To make code more readable, each such function has a "z"
881 // ("always returning zero") prefix, i.e. zbc_foo or zdc_foo.
883 #if ENABLE_FEATURE_BC_SIGNALS || ENABLE_FEATURE_CLEAN_UP
884 # define ERRORS_ARE_FATAL 0
885 # define ERRORFUNC /*nothing*/
886 # define IF_ERROR_RETURN_POSSIBLE(a) a
887 # define BC_STATUS BcStatus
888 # define RETURN_STATUS(v) return (v)
889 # define COMMA_SUCCESS /*nothing*/
891 # define ERRORS_ARE_FATAL 1
892 # define ERRORFUNC NORETURN
893 # define IF_ERROR_RETURN_POSSIBLE(a) /*nothing*/
894 # define BC_STATUS void
895 # define RETURN_STATUS(v) do { ((void)(v)); return; } while (0)
896 # define COMMA_SUCCESS ,BC_STATUS_SUCCESS
903 static void fflush_and_check(void)
906 if (ferror(stdout) || ferror(stderr))
907 bb_perror_msg_and_die("output error");
910 #if ENABLE_FEATURE_CLEAN_UP
911 #define QUIT_OR_RETURN_TO_MAIN \
913 IF_FEATURE_BC_SIGNALS(G_ttyin = 0;) /* do not loop in main loop anymore */ \
915 return BC_STATUS_FAILURE; \
918 #define QUIT_OR_RETURN_TO_MAIN quit()
921 static void quit(void) NORETURN;
922 static void quit(void)
925 bb_perror_msg_and_die("input error");
927 dbg_exec("quit(): exiting with exitcode SUCCESS");
931 static void bc_verror_msg(const char *fmt, va_list p)
933 const char *sv = sv; // for compiler
934 if (G.prs.lex_filename) {
936 applet_name = xasprintf("%s: %s:%u", applet_name, G.prs.lex_filename, G.err_line);
938 bb_verror_msg(fmt, p, NULL);
939 if (G.prs.lex_filename) {
940 free((char*)applet_name);
945 static NOINLINE ERRORFUNC int bc_error_fmt(const char *fmt, ...)
950 bc_verror_msg(fmt, p);
953 if (ENABLE_FEATURE_CLEAN_UP || G_ttyin)
954 IF_ERROR_RETURN_POSSIBLE(return BC_STATUS_FAILURE);
959 static NOINLINE BC_STATUS zbc_posix_error_fmt(const char *fmt, ...)
963 // Are non-POSIX constructs totally ok?
964 if (!(option_mask32 & (BC_FLAG_S|BC_FLAG_W)))
965 RETURN_STATUS(BC_STATUS_SUCCESS); // yes
968 bc_verror_msg(fmt, p);
971 // Do we treat non-POSIX constructs as errors?
972 if (!(option_mask32 & BC_FLAG_S))
973 RETURN_STATUS(BC_STATUS_SUCCESS); // no, it's a warning
975 if (ENABLE_FEATURE_CLEAN_UP || G_ttyin)
976 RETURN_STATUS(BC_STATUS_FAILURE);
979 #define zbc_posix_error_fmt(...) (zbc_posix_error_fmt(__VA_ARGS__) COMMA_SUCCESS)
982 // We use error functions with "return bc_error(FMT[, PARAMS])" idiom.
983 // This idiom begs for tail-call optimization, but for it to work,
984 // function must not have caller-cleaned parameters on stack.
985 // Unfortunately, vararg function API does exactly that on most arches.
986 // Thus, use these shims for the cases when we have no vararg PARAMS:
987 static ERRORFUNC int bc_error(const char *msg)
989 IF_ERROR_RETURN_POSSIBLE(return) bc_error_fmt("%s", msg);
991 static ERRORFUNC int bc_error_bad_character(char c)
994 IF_ERROR_RETURN_POSSIBLE(return) bc_error("NUL character");
995 IF_ERROR_RETURN_POSSIBLE(return) bc_error_fmt("bad character '%c'", c);
997 static ERRORFUNC int bc_error_bad_expression(void)
999 IF_ERROR_RETURN_POSSIBLE(return) bc_error("bad expression");
1001 static ERRORFUNC int bc_error_bad_token(void)
1003 IF_ERROR_RETURN_POSSIBLE(return) bc_error("bad token");
1005 static ERRORFUNC int bc_error_stack_has_too_few_elements(void)
1007 IF_ERROR_RETURN_POSSIBLE(return) bc_error("stack has too few elements");
1009 static ERRORFUNC int bc_error_variable_is_wrong_type(void)
1011 IF_ERROR_RETURN_POSSIBLE(return) bc_error("variable is wrong type");
1014 static BC_STATUS zbc_POSIX_requires(const char *msg)
1016 RETURN_STATUS(zbc_posix_error_fmt("POSIX requires %s", msg));
1018 #define zbc_POSIX_requires(...) (zbc_POSIX_requires(__VA_ARGS__) COMMA_SUCCESS)
1019 static BC_STATUS zbc_POSIX_does_not_allow(const char *msg)
1021 RETURN_STATUS(zbc_posix_error_fmt("%s%s", "POSIX does not allow ", msg));
1023 #define zbc_POSIX_does_not_allow(...) (zbc_POSIX_does_not_allow(__VA_ARGS__) COMMA_SUCCESS)
1024 static BC_STATUS zbc_POSIX_does_not_allow_bool_ops_this_is_bad(const char *msg)
1026 RETURN_STATUS(zbc_posix_error_fmt("%s%s %s", "POSIX does not allow ", "boolean operators; this is bad:", msg));
1028 #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)
1029 static BC_STATUS zbc_POSIX_does_not_allow_empty_X_expression_in_for(const char *msg)
1031 RETURN_STATUS(zbc_posix_error_fmt("%san empty %s expression in 'for()'", "POSIX does not allow ", msg));
1033 #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)
1036 static void bc_vec_grow(BcVec *v, size_t n)
1038 size_t cap = v->cap * 2;
1039 while (cap < v->len + n) cap *= 2;
1040 v->v = xrealloc(v->v, v->size * cap);
1044 static void bc_vec_init(BcVec *v, size_t esize, BcVecFree dtor)
1047 v->cap = BC_VEC_START_CAP;
1050 v->v = xmalloc(esize * BC_VEC_START_CAP);
1053 static void bc_char_vec_init(BcVec *v)
1055 bc_vec_init(v, sizeof(char), NULL);
1058 static void bc_vec_expand(BcVec *v, size_t req)
1061 v->v = xrealloc(v->v, v->size * req);
1066 static void bc_vec_pop(BcVec *v)
1070 v->dtor(v->v + (v->size * v->len));
1073 static void bc_vec_npop(BcVec *v, size_t n)
1078 size_t len = v->len - n;
1079 while (v->len > len) v->dtor(v->v + (v->size * --v->len));
1083 static void bc_vec_pop_all(BcVec *v)
1085 bc_vec_npop(v, v->len);
1088 static size_t bc_vec_push(BcVec *v, const void *data)
1090 size_t len = v->len;
1091 if (len >= v->cap) bc_vec_grow(v, 1);
1092 memmove(v->v + (v->size * len), data, v->size);
1097 // G.prog.results often needs "pop old operand, push result" idiom.
1098 // Can do this without a few extra ops
1099 static size_t bc_result_pop_and_push(const void *data)
1101 BcVec *v = &G.prog.results;
1103 size_t len = v->len - 1;
1105 last = v->v + (v->size * len);
1108 memmove(last, data, v->size);
1112 static size_t bc_vec_pushByte(BcVec *v, char data)
1114 return bc_vec_push(v, &data);
1117 static size_t bc_vec_pushZeroByte(BcVec *v)
1119 //return bc_vec_pushByte(v, '\0');
1121 return bc_vec_push(v, &const_int_0);
1124 static void bc_vec_pushAt(BcVec *v, const void *data, size_t idx)
1127 bc_vec_push(v, data);
1131 if (v->len == v->cap) bc_vec_grow(v, 1);
1133 ptr = v->v + v->size * idx;
1135 memmove(ptr + v->size, ptr, v->size * (v->len++ - idx));
1136 memmove(ptr, data, v->size);
1140 static void bc_vec_string(BcVec *v, size_t len, const char *str)
1143 bc_vec_expand(v, len + 1);
1144 memcpy(v->v, str, len);
1147 bc_vec_pushZeroByte(v);
1150 #if ENABLE_FEATURE_BC_SIGNALS && ENABLE_FEATURE_EDITING
1151 static void bc_vec_concat(BcVec *v, const char *str)
1155 if (v->len == 0) bc_vec_pushZeroByte(v);
1158 len = v->len + slen;
1160 if (v->cap < len) bc_vec_grow(v, slen);
1161 strcpy(v->v + v->len - 1, str);
1167 static void *bc_vec_item(const BcVec *v, size_t idx)
1169 return v->v + v->size * idx;
1172 static void *bc_vec_item_rev(const BcVec *v, size_t idx)
1174 return v->v + v->size * (v->len - idx - 1);
1177 static void *bc_vec_top(const BcVec *v)
1179 return v->v + v->size * (v->len - 1);
1182 static FAST_FUNC void bc_vec_free(void *vec)
1184 BcVec *v = (BcVec *) vec;
1189 static BcFunc* bc_program_func(size_t idx)
1191 return bc_vec_item(&G.prog.fns, idx);
1193 // BC_PROG_MAIN is zeroth element, so:
1194 #define bc_program_func_BC_PROG_MAIN() ((BcFunc*)(G.prog.fns.v))
1197 static BcFunc* bc_program_current_func(void)
1199 BcInstPtr *ip = bc_vec_top(&G.prog.exestack);
1200 BcFunc *func = bc_program_func(ip->func);
1205 static char** bc_program_str(size_t idx)
1209 BcFunc *func = bc_program_current_func();
1210 return bc_vec_item(&func->strs, idx);
1213 IF_DC(return bc_vec_item(&G.prog.strs, idx);)
1216 static char** bc_program_const(size_t idx)
1220 BcFunc *func = bc_program_current_func();
1221 return bc_vec_item(&func->consts, idx);
1224 IF_DC(return bc_vec_item(&G.prog.consts, idx);)
1227 static int bc_id_cmp(const void *e1, const void *e2)
1229 return strcmp(((const BcId *) e1)->name, ((const BcId *) e2)->name);
1232 static FAST_FUNC void bc_id_free(void *id)
1234 free(((BcId *) id)->name);
1237 static size_t bc_map_find_ge(const BcVec *v, const void *ptr)
1239 size_t low = 0, high = v->len;
1241 while (low < high) {
1242 size_t mid = (low + high) / 2;
1243 BcId *id = bc_vec_item(v, mid);
1244 int result = bc_id_cmp(ptr, id);
1257 static int bc_map_insert(BcVec *v, const void *ptr, size_t *i)
1259 size_t n = *i = bc_map_find_ge(v, ptr);
1262 bc_vec_push(v, ptr);
1263 else if (!bc_id_cmp(ptr, bc_vec_item(v, n)))
1264 return 0; // "was not inserted"
1266 bc_vec_pushAt(v, ptr, n);
1267 return 1; // "was inserted"
1271 static size_t bc_map_find_exact(const BcVec *v, const void *ptr)
1273 size_t i = bc_map_find_ge(v, ptr);
1274 if (i >= v->len) return BC_VEC_INVALID_IDX;
1275 return bc_id_cmp(ptr, bc_vec_item(v, i)) ? BC_VEC_INVALID_IDX : i;
1279 static void bc_num_setToZero(BcNum *n, size_t scale)
1286 static void bc_num_zero(BcNum *n)
1288 bc_num_setToZero(n, 0);
1291 static void bc_num_one(BcNum *n)
1293 bc_num_setToZero(n, 0);
1298 // Note: this also sets BcNum to zero
1299 static void bc_num_init(BcNum *n, size_t req)
1301 req = req >= BC_NUM_DEF_SIZE ? req : BC_NUM_DEF_SIZE;
1302 //memset(n, 0, sizeof(BcNum)); - cleared by assignments below
1303 n->num = xmalloc(req);
1310 static void bc_num_init_DEF_SIZE(BcNum *n)
1312 bc_num_init(n, BC_NUM_DEF_SIZE);
1315 static void bc_num_expand(BcNum *n, size_t req)
1317 req = req >= BC_NUM_DEF_SIZE ? req : BC_NUM_DEF_SIZE;
1319 n->num = xrealloc(n->num, req);
1324 static FAST_FUNC void bc_num_free(void *num)
1326 free(((BcNum *) num)->num);
1329 static void bc_num_copy(BcNum *d, BcNum *s)
1332 bc_num_expand(d, s->cap);
1336 memcpy(d->num, s->num, sizeof(BcDig) * d->len);
1340 static BC_STATUS zbc_num_ulong_abs(BcNum *n, unsigned long *result_p)
1343 unsigned long result;
1347 while (i > n->rdx) {
1348 unsigned long prev = result;
1349 result = result * 10 + n->num[--i];
1350 // Even overflowed N*10 can still satisfy N*10>=N. For example,
1351 // 0x1ff00000 * 10 is 0x13f600000,
1352 // or 0x3f600000 truncated to 32 bits. Which is larger.
1353 // However, (N*10)/8 < N check is always correct.
1354 if ((result / 8) < prev)
1355 RETURN_STATUS(bc_error("overflow"));
1359 RETURN_STATUS(BC_STATUS_SUCCESS);
1361 #define zbc_num_ulong_abs(...) (zbc_num_ulong_abs(__VA_ARGS__) COMMA_SUCCESS)
1363 static BC_STATUS zbc_num_ulong(BcNum *n, unsigned long *result_p)
1365 if (n->neg) RETURN_STATUS(bc_error("negative number"));
1367 RETURN_STATUS(zbc_num_ulong_abs(n, result_p));
1369 #define zbc_num_ulong(...) (zbc_num_ulong(__VA_ARGS__) COMMA_SUCCESS)
1371 #if ULONG_MAX == 0xffffffffUL // 10 digits: 4294967295
1372 # define ULONG_NUM_BUFSIZE (10 > BC_NUM_DEF_SIZE ? 10 : BC_NUM_DEF_SIZE)
1373 #elif ULONG_MAX == 0xffffffffffffffffULL // 20 digits: 18446744073709551615
1374 # define ULONG_NUM_BUFSIZE (20 > BC_NUM_DEF_SIZE ? 20 : BC_NUM_DEF_SIZE)
1376 // minimum BC_NUM_DEF_SIZE, so that bc_num_expand() in bc_num_ulong2num()
1377 // would not hit realloc() code path - not good if num[] is not malloced
1379 static void bc_num_ulong2num(BcNum *n, unsigned long val)
1385 if (val == 0) return;
1387 bc_num_expand(n, ULONG_NUM_BUFSIZE);
1394 if (val == 0) break;
1398 static void bc_num_subArrays(BcDig *restrict a, BcDig *restrict b, size_t len)
1401 for (i = 0; i < len; ++i) {
1403 for (j = i; a[j] < 0;) {
1410 static ssize_t bc_num_compare(BcDig *restrict a, BcDig *restrict b, size_t len)
1428 #define BC_NUM_NEG(n, neg) ((((ssize_t)(n)) ^ -((ssize_t)(neg))) + (neg))
1429 #define BC_NUM_ONE(n) ((n)->len == 1 && (n)->rdx == 0 && (n)->num[0] == 1)
1430 #define BC_NUM_INT(n) ((n)->len - (n)->rdx)
1431 //#define BC_NUM_AREQ(a, b) (BC_MAX((a)->rdx, (b)->rdx) + BC_MAX(BC_NUM_INT(a), BC_NUM_INT(b)) + 1)
1432 static /*ALWAYS_INLINE*/ size_t BC_NUM_AREQ(BcNum *a, BcNum *b)
1434 return BC_MAX(a->rdx, b->rdx) + BC_MAX(BC_NUM_INT(a), BC_NUM_INT(b)) + 1;
1436 //#define BC_NUM_MREQ(a, b, scale) (BC_NUM_INT(a) + BC_NUM_INT(b) + BC_MAX((scale), (a)->rdx + (b)->rdx) + 1)
1437 static /*ALWAYS_INLINE*/ size_t BC_NUM_MREQ(BcNum *a, BcNum *b, size_t scale)
1439 return BC_NUM_INT(a) + BC_NUM_INT(b) + BC_MAX(scale, a->rdx + b->rdx) + 1;
1442 static ssize_t bc_num_cmp(BcNum *a, BcNum *b)
1444 size_t i, min, a_int, b_int, diff;
1445 BcDig *max_num, *min_num;
1449 if (a == b) return 0;
1450 if (a->len == 0) return BC_NUM_NEG(!!b->len, !b->neg);
1451 if (b->len == 0) return BC_NUM_NEG(1, a->neg);
1453 if (a->neg != b->neg) // signs of a and b differ
1454 // +a,-b = a>b = 1 or -a,+b = a<b = -1
1455 return (int)b->neg - (int)a->neg;
1456 neg = a->neg; // 1 if both negative, 0 if both positive
1458 a_int = BC_NUM_INT(a);
1459 b_int = BC_NUM_INT(b);
1462 if (a_int != 0) return (ssize_t) a_int;
1464 a_max = (a->rdx > b->rdx);
1467 diff = a->rdx - b->rdx;
1468 max_num = a->num + diff;
1470 // neg = (a_max == neg); - NOP (maps 1->1 and 0->0)
1473 diff = b->rdx - a->rdx;
1474 max_num = b->num + diff;
1476 neg = !neg; // same as "neg = (a_max == neg)"
1479 cmp = bc_num_compare(max_num, min_num, b_int + min);
1480 if (cmp != 0) return BC_NUM_NEG(cmp, neg);
1482 for (max_num -= diff, i = diff - 1; i < diff; --i) {
1483 if (max_num[i]) return BC_NUM_NEG(1, neg);
1489 static void bc_num_truncate(BcNum *n, size_t places)
1491 if (places == 0) return;
1497 memmove(n->num, n->num + places, n->len * sizeof(BcDig));
1501 static void bc_num_extend(BcNum *n, size_t places)
1503 size_t len = n->len + places;
1506 if (n->cap < len) bc_num_expand(n, len);
1508 memmove(n->num + places, n->num, sizeof(BcDig) * n->len);
1509 memset(n->num, 0, sizeof(BcDig) * places);
1516 static void bc_num_clean(BcNum *n)
1518 while (n->len > 0 && n->num[n->len - 1] == 0) --n->len;
1521 else if (n->len < n->rdx)
1525 static void bc_num_retireMul(BcNum *n, size_t scale, bool neg1, bool neg2)
1528 bc_num_extend(n, scale - n->rdx);
1530 bc_num_truncate(n, n->rdx - scale);
1533 if (n->len != 0) n->neg = !neg1 != !neg2;
1536 static void bc_num_split(BcNum *restrict n, size_t idx, BcNum *restrict a,
1540 b->len = n->len - idx;
1542 a->rdx = b->rdx = 0;
1544 memcpy(b->num, n->num + idx, b->len * sizeof(BcDig));
1545 memcpy(a->num, n->num, idx * sizeof(BcDig));
1555 static BC_STATUS zbc_num_shift(BcNum *n, size_t places)
1557 if (places == 0 || n->len == 0) RETURN_STATUS(BC_STATUS_SUCCESS);
1559 // This check makes sense only if size_t is (much) larger than BC_MAX_NUM.
1560 if (SIZE_MAX > (BC_MAX_NUM | 0xff)) {
1561 if (places + n->len > BC_MAX_NUM)
1562 RETURN_STATUS(bc_error("number too long: must be [1,"BC_MAX_NUM_STR"]"));
1565 if (n->rdx >= places)
1568 bc_num_extend(n, places - n->rdx);
1574 RETURN_STATUS(BC_STATUS_SUCCESS);
1576 #define zbc_num_shift(...) (zbc_num_shift(__VA_ARGS__) COMMA_SUCCESS)
1578 typedef BC_STATUS (*BcNumBinaryOp)(BcNum *, BcNum *, BcNum *, size_t) FAST_FUNC;
1580 static BC_STATUS zbc_num_binary(BcNum *a, BcNum *b, BcNum *c, size_t scale,
1581 BcNumBinaryOp op, size_t req)
1584 BcNum num2, *ptr_a, *ptr_b;
1589 memcpy(ptr_a, c, sizeof(BcNum));
1597 memcpy(ptr_b, c, sizeof(BcNum));
1604 bc_num_init(c, req);
1606 bc_num_expand(c, req);
1608 s = BC_STATUS_SUCCESS;
1609 IF_ERROR_RETURN_POSSIBLE(s =) op(ptr_a, ptr_b, c, scale);
1611 if (init) bc_num_free(&num2);
1615 #define zbc_num_binary(...) (zbc_num_binary(__VA_ARGS__) COMMA_SUCCESS)
1617 static FAST_FUNC BC_STATUS zbc_num_a(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale);
1618 static FAST_FUNC BC_STATUS zbc_num_s(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale);
1619 static FAST_FUNC BC_STATUS zbc_num_p(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale);
1620 static FAST_FUNC BC_STATUS zbc_num_m(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale);
1621 static FAST_FUNC BC_STATUS zbc_num_d(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale);
1622 static FAST_FUNC BC_STATUS zbc_num_rem(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale);
1624 static FAST_FUNC BC_STATUS zbc_num_add(BcNum *a, BcNum *b, BcNum *c, size_t scale)
1626 BcNumBinaryOp op = (!a->neg == !b->neg) ? zbc_num_a : zbc_num_s;
1628 RETURN_STATUS(zbc_num_binary(a, b, c, false, op, BC_NUM_AREQ(a, b)));
1631 static FAST_FUNC BC_STATUS zbc_num_sub(BcNum *a, BcNum *b, BcNum *c, size_t scale)
1633 BcNumBinaryOp op = (!a->neg == !b->neg) ? zbc_num_s : zbc_num_a;
1635 RETURN_STATUS(zbc_num_binary(a, b, c, true, op, BC_NUM_AREQ(a, b)));
1638 static FAST_FUNC BC_STATUS zbc_num_mul(BcNum *a, BcNum *b, BcNum *c, size_t scale)
1640 size_t req = BC_NUM_MREQ(a, b, scale);
1641 RETURN_STATUS(zbc_num_binary(a, b, c, scale, zbc_num_m, req));
1644 static FAST_FUNC BC_STATUS zbc_num_div(BcNum *a, BcNum *b, BcNum *c, size_t scale)
1646 size_t req = BC_NUM_MREQ(a, b, scale);
1647 RETURN_STATUS(zbc_num_binary(a, b, c, scale, zbc_num_d, req));
1650 static FAST_FUNC BC_STATUS zbc_num_mod(BcNum *a, BcNum *b, BcNum *c, size_t scale)
1652 size_t req = BC_NUM_MREQ(a, b, scale);
1653 RETURN_STATUS(zbc_num_binary(a, b, c, scale, zbc_num_rem, req));
1656 static FAST_FUNC BC_STATUS zbc_num_pow(BcNum *a, BcNum *b, BcNum *c, size_t scale)
1658 RETURN_STATUS(zbc_num_binary(a, b, c, scale, zbc_num_p, a->len * b->len + 1));
1661 static const BcNumBinaryOp zbc_program_ops[] = {
1662 zbc_num_pow, zbc_num_mul, zbc_num_div, zbc_num_mod, zbc_num_add, zbc_num_sub,
1664 #define zbc_num_add(...) (zbc_num_add(__VA_ARGS__) COMMA_SUCCESS)
1665 #define zbc_num_sub(...) (zbc_num_sub(__VA_ARGS__) COMMA_SUCCESS)
1666 #define zbc_num_mul(...) (zbc_num_mul(__VA_ARGS__) COMMA_SUCCESS)
1667 #define zbc_num_div(...) (zbc_num_div(__VA_ARGS__) COMMA_SUCCESS)
1668 #define zbc_num_mod(...) (zbc_num_mod(__VA_ARGS__) COMMA_SUCCESS)
1669 #define zbc_num_pow(...) (zbc_num_pow(__VA_ARGS__) COMMA_SUCCESS)
1671 static BC_STATUS zbc_num_inv(BcNum *a, BcNum *b, size_t scale)
1680 RETURN_STATUS(zbc_num_div(&one, a, b, scale));
1682 #define zbc_num_inv(...) (zbc_num_inv(__VA_ARGS__) COMMA_SUCCESS)
1684 static FAST_FUNC BC_STATUS zbc_num_a(BcNum *a, BcNum *b, BcNum *restrict c, size_t sub)
1686 BcDig *ptr, *ptr_a, *ptr_b, *ptr_c;
1687 size_t i, max, min_rdx, min_int, diff, a_int, b_int;
1690 // Because this function doesn't need to use scale (per the bc spec),
1691 // I am hijacking it to say whether it's doing an add or a subtract.
1695 if (sub && c->len) c->neg = !c->neg;
1696 RETURN_STATUS(BC_STATUS_SUCCESS);
1700 RETURN_STATUS(BC_STATUS_SUCCESS);
1704 c->rdx = BC_MAX(a->rdx, b->rdx);
1705 min_rdx = BC_MIN(a->rdx, b->rdx);
1708 if (a->rdx > b->rdx) {
1709 diff = a->rdx - b->rdx;
1711 ptr_a = a->num + diff;
1714 diff = b->rdx - a->rdx;
1717 ptr_b = b->num + diff;
1721 for (i = 0; i < diff; ++i, ++c->len)
1725 a_int = BC_NUM_INT(a);
1726 b_int = BC_NUM_INT(b);
1728 if (a_int > b_int) {
1739 for (i = 0; i < min_rdx + min_int; ++i) {
1740 unsigned in = (unsigned)ptr_a[i] + (unsigned)ptr_b[i] + carry;
1742 ptr_c[i] = (BcDig)(in % 10);
1744 for (; i < max + min_rdx; ++i) {
1745 unsigned in = (unsigned)ptr[i] + carry;
1747 ptr_c[i] = (BcDig)(in % 10);
1751 if (carry != 0) c->num[c->len++] = (BcDig) carry;
1753 RETURN_STATUS(BC_STATUS_SUCCESS); // can't make void, see zbc_num_binary()
1756 static FAST_FUNC BC_STATUS zbc_num_s(BcNum *a, BcNum *b, BcNum *restrict c, size_t sub)
1759 BcNum *minuend, *subtrahend;
1761 bool aneg, bneg, neg;
1763 // Because this function doesn't need to use scale (per the bc spec),
1764 // I am hijacking it to say whether it's doing an add or a subtract.
1768 if (sub && c->len) c->neg = !c->neg;
1769 RETURN_STATUS(BC_STATUS_SUCCESS);
1773 RETURN_STATUS(BC_STATUS_SUCCESS);
1778 a->neg = b->neg = false;
1780 cmp = bc_num_cmp(a, b);
1786 bc_num_setToZero(c, BC_MAX(a->rdx, b->rdx));
1787 RETURN_STATUS(BC_STATUS_SUCCESS);
1795 if (sub) neg = !neg;
1800 bc_num_copy(c, minuend);
1803 if (c->rdx < subtrahend->rdx) {
1804 bc_num_extend(c, subtrahend->rdx - c->rdx);
1807 start = c->rdx - subtrahend->rdx;
1809 bc_num_subArrays(c->num + start, subtrahend->num, subtrahend->len);
1813 RETURN_STATUS(BC_STATUS_SUCCESS); // can't make void, see zbc_num_binary()
1816 static FAST_FUNC BC_STATUS zbc_num_k(BcNum *restrict a, BcNum *restrict b,
1818 #define zbc_num_k(...) (zbc_num_k(__VA_ARGS__) COMMA_SUCCESS)
1821 size_t max = BC_MAX(a->len, b->len), max2 = (max + 1) / 2;
1822 BcNum l1, h1, l2, h2, m2, m1, z0, z1, z2, temp;
1825 if (a->len == 0 || b->len == 0) {
1827 RETURN_STATUS(BC_STATUS_SUCCESS);
1829 aone = BC_NUM_ONE(a);
1830 if (aone || BC_NUM_ONE(b)) {
1831 bc_num_copy(c, aone ? b : a);
1832 RETURN_STATUS(BC_STATUS_SUCCESS);
1835 if (a->len + b->len < BC_NUM_KARATSUBA_LEN
1836 || a->len < BC_NUM_KARATSUBA_LEN
1837 || b->len < BC_NUM_KARATSUBA_LEN
1841 bc_num_expand(c, a->len + b->len + 1);
1843 memset(c->num, 0, sizeof(BcDig) * c->cap);
1846 for (i = 0; i < b->len; ++i) {
1848 for (j = 0; j < a->len; ++j) {
1849 unsigned in = c->num[i + j];
1850 in += (unsigned)a->num[j] * (unsigned)b->num[i] + carry;
1851 // note: compilers prefer _unsigned_ div/const
1853 c->num[i + j] = (BcDig)(in % 10);
1856 c->num[i + j] += (BcDig) carry;
1857 len = BC_MAX(len, i + j + !!carry);
1859 #if ENABLE_FEATURE_BC_SIGNALS
1861 // a*a <- without check below, this will not be interruptible
1862 if (G_interrupt) return BC_STATUS_FAILURE;
1868 RETURN_STATUS(BC_STATUS_SUCCESS);
1871 bc_num_init(&l1, max);
1872 bc_num_init(&h1, max);
1873 bc_num_init(&l2, max);
1874 bc_num_init(&h2, max);
1875 bc_num_init(&m1, max);
1876 bc_num_init(&m2, max);
1877 bc_num_init(&z0, max);
1878 bc_num_init(&z1, max);
1879 bc_num_init(&z2, max);
1880 bc_num_init(&temp, max + max);
1882 bc_num_split(a, max2, &l1, &h1);
1883 bc_num_split(b, max2, &l2, &h2);
1885 s = zbc_num_add(&h1, &l1, &m1, 0);
1887 s = zbc_num_add(&h2, &l2, &m2, 0);
1890 s = zbc_num_k(&h1, &h2, &z0);
1892 s = zbc_num_k(&m1, &m2, &z1);
1894 s = zbc_num_k(&l1, &l2, &z2);
1897 s = zbc_num_sub(&z1, &z0, &temp, 0);
1899 s = zbc_num_sub(&temp, &z2, &z1, 0);
1902 s = zbc_num_shift(&z0, max2 * 2);
1904 s = zbc_num_shift(&z1, max2);
1906 s = zbc_num_add(&z0, &z1, &temp, 0);
1908 s = zbc_num_add(&temp, &z2, c, 0);
1923 static FAST_FUNC BC_STATUS zbc_num_m(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale)
1927 size_t maxrdx = BC_MAX(a->rdx, b->rdx);
1929 scale = BC_MAX(scale, a->rdx);
1930 scale = BC_MAX(scale, b->rdx);
1931 scale = BC_MIN(a->rdx + b->rdx, scale);
1932 maxrdx = BC_MAX(maxrdx, scale);
1934 bc_num_init(&cpa, a->len);
1935 bc_num_init(&cpb, b->len);
1937 bc_num_copy(&cpa, a);
1938 bc_num_copy(&cpb, b);
1939 cpa.neg = cpb.neg = false;
1941 s = zbc_num_shift(&cpa, maxrdx);
1943 s = zbc_num_shift(&cpb, maxrdx);
1945 s = zbc_num_k(&cpa, &cpb, c);
1949 bc_num_expand(c, c->len + maxrdx);
1951 if (c->len < maxrdx) {
1952 memset(c->num + c->len, 0, (c->cap - c->len) * sizeof(BcDig));
1957 bc_num_retireMul(c, scale, a->neg, b->neg);
1963 #define zbc_num_m(...) (zbc_num_m(__VA_ARGS__) COMMA_SUCCESS)
1965 static FAST_FUNC BC_STATUS zbc_num_d(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale)
1972 RETURN_STATUS(bc_error("divide by zero"));
1974 bc_num_setToZero(c, scale);
1975 RETURN_STATUS(BC_STATUS_SUCCESS);
1977 if (BC_NUM_ONE(b)) {
1979 bc_num_retireMul(c, scale, a->neg, b->neg);
1980 RETURN_STATUS(BC_STATUS_SUCCESS);
1983 bc_num_init(&cp, BC_NUM_MREQ(a, b, scale));
1984 bc_num_copy(&cp, a);
1988 bc_num_expand(&cp, len + 2);
1989 bc_num_extend(&cp, len - cp.len);
1992 if (b->rdx > cp.rdx) bc_num_extend(&cp, b->rdx - cp.rdx);
1994 if (scale > cp.rdx) bc_num_extend(&cp, scale - cp.rdx);
1996 if (b->rdx == b->len) {
1998 if (len == 0) break;
2000 if (b->num[len] != 0)
2006 if (cp.cap == cp.len) bc_num_expand(&cp, cp.len + 1);
2008 // We want an extra zero in front to make things simpler.
2009 cp.num[cp.len++] = 0;
2012 bc_num_expand(c, cp.len);
2015 memset(c->num + end, 0, (c->cap - end) * sizeof(BcDig));
2019 s = BC_STATUS_SUCCESS;
2020 for (i = end - 1; i < end; --i) {
2023 for (q = 0; n[len] != 0 || bc_num_compare(n, b->num, len) >= 0; ++q)
2024 bc_num_subArrays(n, b->num, len);
2026 #if ENABLE_FEATURE_BC_SIGNALS
2029 // 1/a <- without check below, this will not be interruptible
2031 s = BC_STATUS_FAILURE;
2037 bc_num_retireMul(c, scale, a->neg, b->neg);
2042 #define zbc_num_d(...) (zbc_num_d(__VA_ARGS__) COMMA_SUCCESS)
2044 static FAST_FUNC BC_STATUS zbc_num_r(BcNum *a, BcNum *b, BcNum *restrict c,
2045 BcNum *restrict d, size_t scale, size_t ts)
2052 RETURN_STATUS(bc_error("divide by zero"));
2055 bc_num_setToZero(d, ts);
2056 RETURN_STATUS(BC_STATUS_SUCCESS);
2059 bc_num_init(&temp, d->cap);
2060 s = zbc_num_d(a, b, c, scale);
2063 if (scale != 0) scale = ts;
2065 s = zbc_num_m(c, b, &temp, scale);
2067 s = zbc_num_sub(a, &temp, d, scale);
2070 if (ts > d->rdx && d->len) bc_num_extend(d, ts - d->rdx);
2073 bc_num_retireMul(d, ts, a->neg, b->neg);
2079 #define zbc_num_r(...) (zbc_num_r(__VA_ARGS__) COMMA_SUCCESS)
2081 static FAST_FUNC BC_STATUS zbc_num_rem(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale)
2085 size_t ts = BC_MAX(scale + b->rdx, a->rdx), len = BC_NUM_MREQ(a, b, ts);
2087 bc_num_init(&c1, len);
2088 s = zbc_num_r(a, b, &c1, c, scale, ts);
2093 #define zbc_num_rem(...) (zbc_num_rem(__VA_ARGS__) COMMA_SUCCESS)
2095 static FAST_FUNC BC_STATUS zbc_num_p(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale)
2097 BcStatus s = BC_STATUS_SUCCESS;
2100 size_t i, powrdx, resrdx;
2103 // GNU bc does not allow 2^2.0 - we do
2104 for (i = 0; i < b->rdx; i++)
2106 RETURN_STATUS(bc_error("not an integer"));
2110 RETURN_STATUS(BC_STATUS_SUCCESS);
2113 bc_num_setToZero(c, scale);
2114 RETURN_STATUS(BC_STATUS_SUCCESS);
2116 if (BC_NUM_ONE(b)) {
2120 s = zbc_num_inv(a, c, scale);
2125 s = zbc_num_ulong_abs(b, &pow);
2126 if (s) RETURN_STATUS(s);
2127 // b is not used beyond this point
2129 bc_num_init(©, a->len);
2130 bc_num_copy(©, a);
2135 if (a->rdx * pow < scale)
2136 scale = a->rdx * pow;
2140 for (powrdx = a->rdx; !(pow & 1); pow >>= 1) {
2142 s = zbc_num_mul(©, ©, ©, powrdx);
2144 // Not needed: zbc_num_mul() has a check for ^C:
2145 //if (G_interrupt) {
2146 // s = BC_STATUS_FAILURE;
2151 bc_num_copy(c, ©);
2153 for (resrdx = powrdx, pow >>= 1; pow != 0; pow >>= 1) {
2155 s = zbc_num_mul(©, ©, ©, powrdx);
2160 s = zbc_num_mul(c, ©, c, resrdx);
2163 // Not needed: zbc_num_mul() has a check for ^C:
2164 //if (G_interrupt) {
2165 // s = BC_STATUS_FAILURE;
2171 s = zbc_num_inv(c, c, scale);
2175 if (c->rdx > scale) bc_num_truncate(c, c->rdx - scale);
2177 // We can't use bc_num_clean() here.
2178 for (i = 0; i < c->len; ++i)
2181 bc_num_setToZero(c, scale);
2188 #define zbc_num_p(...) (zbc_num_p(__VA_ARGS__) COMMA_SUCCESS)
2190 static BC_STATUS zbc_num_sqrt(BcNum *a, BcNum *restrict b, size_t scale)
2193 BcNum num1, num2, half, f, fprime, *x0, *x1, *temp;
2194 size_t pow, len, digs, digs1, resrdx, req, times = 0;
2195 ssize_t cmp = 1, cmp1 = SSIZE_MAX, cmp2 = SSIZE_MAX;
2197 req = BC_MAX(scale, a->rdx) + ((BC_NUM_INT(a) + 1) >> 1) + 1;
2198 bc_num_expand(b, req);
2201 bc_num_setToZero(b, scale);
2202 RETURN_STATUS(BC_STATUS_SUCCESS);
2205 RETURN_STATUS(bc_error("negative number"));
2207 if (BC_NUM_ONE(a)) {
2209 bc_num_extend(b, scale);
2210 RETURN_STATUS(BC_STATUS_SUCCESS);
2213 scale = BC_MAX(scale, a->rdx) + 1;
2214 len = a->len + scale;
2216 bc_num_init(&num1, len);
2217 bc_num_init(&num2, len);
2218 bc_num_init_DEF_SIZE(&half);
2224 bc_num_init(&f, len);
2225 bc_num_init(&fprime, len);
2231 pow = BC_NUM_INT(a);
2239 pow -= 2 - (pow & 1);
2241 bc_num_extend(x0, pow);
2243 // Make sure to move the radix back.
2247 x0->rdx = digs = digs1 = 0;
2249 len = BC_NUM_INT(x0) + resrdx - 1;
2251 while (cmp != 0 || digs < len) {
2252 s = zbc_num_div(a, x0, &f, resrdx);
2254 s = zbc_num_add(x0, &f, &fprime, resrdx);
2256 s = zbc_num_mul(&fprime, &half, x1, resrdx);
2259 cmp = bc_num_cmp(x1, x0);
2260 digs = x1->len - (unsigned long long) llabs(cmp);
2262 if (cmp == cmp2 && digs == digs1)
2267 resrdx += times > 4;
2280 if (b->rdx > scale) bc_num_truncate(b, b->rdx - scale);
2282 bc_num_free(&fprime);
2289 #define zbc_num_sqrt(...) (zbc_num_sqrt(__VA_ARGS__) COMMA_SUCCESS)
2291 static BC_STATUS zbc_num_divmod(BcNum *a, BcNum *b, BcNum *c, BcNum *d,
2297 size_t ts = BC_MAX(scale + b->rdx, a->rdx), len = BC_NUM_MREQ(a, b, ts);
2300 memcpy(&num2, c, sizeof(BcNum));
2302 bc_num_init(c, len);
2306 bc_num_expand(c, len);
2309 s = zbc_num_r(ptr_a, b, c, d, scale, ts);
2311 if (init) bc_num_free(&num2);
2315 #define zbc_num_divmod(...) (zbc_num_divmod(__VA_ARGS__) COMMA_SUCCESS)
2318 static BC_STATUS zdc_num_modexp(BcNum *a, BcNum *b, BcNum *c, BcNum *restrict d)
2321 BcNum base, exp, two, temp;
2325 RETURN_STATUS(bc_error("divide by zero"));
2326 if (a->rdx || b->rdx || c->rdx)
2327 RETURN_STATUS(bc_error("not an integer"));
2329 RETURN_STATUS(bc_error("negative number"));
2331 bc_num_expand(d, c->len);
2332 bc_num_init(&base, c->len);
2333 bc_num_init(&exp, b->len);
2334 bc_num_init(&temp, b->len);
2336 two.cap = ARRAY_SIZE(two_digs);
2343 s = zbc_num_rem(a, c, &base, 0);
2345 bc_num_copy(&exp, b);
2347 while (exp.len != 0) {
2348 s = zbc_num_divmod(&exp, &two, &exp, &temp, 0);
2351 if (BC_NUM_ONE(&temp)) {
2352 s = zbc_num_mul(d, &base, &temp, 0);
2354 s = zbc_num_rem(&temp, c, d, 0);
2358 s = zbc_num_mul(&base, &base, &temp, 0);
2360 s = zbc_num_rem(&temp, c, &base, 0);
2369 #define zdc_num_modexp(...) (zdc_num_modexp(__VA_ARGS__) COMMA_SUCCESS)
2372 static FAST_FUNC void bc_string_free(void *string)
2374 free(*(char**)string);
2377 static void bc_func_init(BcFunc *f)
2379 bc_char_vec_init(&f->code);
2380 IF_BC(bc_vec_init(&f->labels, sizeof(size_t), NULL);)
2381 IF_BC(bc_vec_init(&f->autos, sizeof(BcId), bc_id_free);)
2382 IF_BC(bc_vec_init(&f->strs, sizeof(char *), bc_string_free);)
2383 IF_BC(bc_vec_init(&f->consts, sizeof(char *), bc_string_free);)
2384 IF_BC(f->nparams = 0;)
2387 static FAST_FUNC void bc_func_free(void *func)
2389 BcFunc *f = (BcFunc *) func;
2390 bc_vec_free(&f->code);
2391 IF_BC(bc_vec_free(&f->labels);)
2392 IF_BC(bc_vec_free(&f->autos);)
2393 IF_BC(bc_vec_free(&f->strs);)
2394 IF_BC(bc_vec_free(&f->consts);)
2397 static void bc_array_expand(BcVec *a, size_t len);
2399 static void bc_array_init(BcVec *a, bool nums)
2402 bc_vec_init(a, sizeof(BcNum), bc_num_free);
2404 bc_vec_init(a, sizeof(BcVec), bc_vec_free);
2405 bc_array_expand(a, 1);
2408 static void bc_array_expand(BcVec *a, size_t len)
2410 if (a->dtor == bc_num_free
2411 // && a->size == sizeof(BcNum) - always true
2414 while (len > a->len) {
2415 bc_num_init_DEF_SIZE(&n);
2420 while (len > a->len) {
2421 bc_array_init(&v, true);
2427 static void bc_array_copy(BcVec *d, const BcVec *s)
2433 bc_vec_expand(d, s->cap);
2438 for (i = 0; i < s->len; i++, dnum++, snum++) {
2439 bc_num_init(dnum, snum->len);
2440 bc_num_copy(dnum, snum);
2445 static void dc_result_copy(BcResult *d, BcResult *src)
2450 case XC_RESULT_TEMP:
2451 case XC_RESULT_IBASE:
2452 case XC_RESULT_SCALE:
2453 case XC_RESULT_OBASE:
2454 bc_num_init(&d->d.n, src->d.n.len);
2455 bc_num_copy(&d->d.n, &src->d.n);
2458 case XC_RESULT_ARRAY:
2459 case XC_RESULT_ARRAY_ELEM:
2460 d->d.id.name = xstrdup(src->d.id.name);
2462 case XC_RESULT_CONSTANT:
2463 IF_BC(case BC_RESULT_LAST:)
2464 IF_BC(case BC_RESULT_ONE:)
2466 memcpy(&d->d.n, &src->d.n, sizeof(BcNum));
2472 static FAST_FUNC void bc_result_free(void *result)
2474 BcResult *r = (BcResult *) result;
2477 case XC_RESULT_TEMP:
2478 case XC_RESULT_IBASE:
2479 case XC_RESULT_SCALE:
2480 case XC_RESULT_OBASE:
2481 bc_num_free(&r->d.n);
2484 case XC_RESULT_ARRAY:
2485 case XC_RESULT_ARRAY_ELEM:
2494 static int bad_input_byte(char c)
2496 if ((c < ' ' && c != '\t' && c != '\r' && c != '\n') // also allow '\v' '\f'?
2499 bc_error_fmt("illegal character 0x%02x", c);
2505 // Note: it _appends_ data from fp to vec.
2506 static void bc_read_line(BcVec *vec, FILE *fp)
2511 #if ENABLE_FEATURE_BC_SIGNALS
2512 if (G_interrupt) { // ^C was pressed
2515 // ^C while running a script (bc SCRIPT): die.
2516 // We do not return to interactive prompt:
2517 // user might be running us from a shell,
2518 // and SCRIPT might be intended to terminate
2519 // (e.g. contain a "halt" stmt).
2520 // ^C dropping user into a bc prompt instead of
2521 // the shell would be unexpected.
2524 // ^C while interactive input
2526 // GNU bc says "interrupted execution."
2527 // GNU dc says "Interrupt!"
2528 fputs("\ninterrupted execution\n", stderr);
2531 # if ENABLE_FEATURE_EDITING
2532 if (G_ttyin && fp == stdin) {
2534 # define line_buf bb_common_bufsiz1
2535 n = read_line_input(G.line_input_state, "", line_buf, COMMON_BUFSIZE);
2536 if (n <= 0) { // read errors or EOF, or ^D, or ^C
2539 bc_vec_pushZeroByte(vec); // ^D or EOF (or error)
2544 char c = line_buf[i++];
2546 if (bad_input_byte(c)) goto again;
2548 bc_vec_concat(vec, line_buf);
2556 size_t len = vec->len;
2559 #if ENABLE_FEATURE_BC_SIGNALS
2561 // ^C was pressed: ignore entire line, get another one
2566 do c = fgetc(fp); while (c == '\0');
2569 bb_perror_msg_and_die("input error");
2570 // Note: EOF does not append '\n'
2573 bad_chars |= bad_input_byte(c);
2574 bc_vec_pushByte(vec, (char)c);
2575 } while (c != '\n');
2578 // Bad chars on this line
2579 if (!G.prs.lex_filename) { // stdin
2580 // ignore entire line, get another one
2584 bb_perror_msg_and_die("file '%s' is not text", G.prs.lex_filename);
2586 bc_vec_pushZeroByte(vec);
2594 static bool bc_num_strValid(const char *val, size_t base)
2599 b = (BcDig)(base <= 10 ? base + '0' : base - 10 + 'A');
2606 if (radix) return false;
2610 if (c < '0' || c >= b || (c > '9' && c < 'A'))
2616 // Note: n is already "bc_num_zero()"ed,
2617 // leading zeroes in "val" are removed
2618 static void bc_num_parseDecimal(BcNum *n, const char *val)
2627 bc_num_expand(n, len);
2629 ptr = strchr(val, '.');
2633 n->rdx = (size_t)((val + len) - (ptr + 1));
2635 for (i = 0; val[i]; ++i) {
2636 if (val[i] != '0' && val[i] != '.') {
2637 // Not entirely zero value - convert it, and exit
2640 n->num[n->len] = val[i] - '0';
2644 if (val[--i] == '.') goto skip_dot;
2649 // if for() exits without hitting if(), the value is entirely zero
2652 // Note: n is already "bc_num_zero()"ed,
2653 // leading zeroes in "val" are removed
2654 static void bc_num_parseBase(BcNum *n, const char *val, unsigned base_t)
2657 BcNum temp, mult, result;
2659 BcDig base_digs[ULONG_NUM_BUFSIZE];
2664 for (i = 0; ; ++i) {
2667 if (val[i] != '.' && val[i] != '0')
2671 bc_num_init_DEF_SIZE(&temp);
2672 bc_num_init_DEF_SIZE(&mult);
2673 base.cap = ARRAY_SIZE(base_digs);
2674 base.num = base_digs;
2675 bc_num_ulong2num(&base, base_t);
2679 if (c == '\0') goto int_err;
2680 if (c == '.') break;
2682 v = (unsigned long) (c <= '9' ? c - '0' : c - 'A' + 10);
2684 s = zbc_num_mul(n, &base, &mult, 0);
2685 if (s) goto int_err;
2686 bc_num_ulong2num(&temp, v);
2687 s = zbc_num_add(&mult, &temp, n, 0);
2688 if (s) goto int_err;
2691 bc_num_init(&result, base.len);
2692 //bc_num_zero(&result); - already is
2698 if (c == '\0') break;
2701 v = (unsigned long) (c <= '9' ? c - '0' : c - 'A' + 10);
2703 s = zbc_num_mul(&result, &base, &result, 0);
2705 bc_num_ulong2num(&temp, v);
2706 s = zbc_num_add(&result, &temp, &result, 0);
2708 s = zbc_num_mul(&mult, &base, &mult, 0);
2712 s = zbc_num_div(&result, &mult, &result, digits);
2714 s = zbc_num_add(n, &result, n, digits);
2718 if (n->rdx < digits)
2719 bc_num_extend(n, digits - n->rdx);
2723 bc_num_free(&result);
2729 static BC_STATUS zbc_num_parse(BcNum *n, const char *val, unsigned base_t)
2731 if (!bc_num_strValid(val, base_t))
2732 RETURN_STATUS(bc_error("bad number string"));
2735 while (*val == '0') val++;
2738 bc_num_parseDecimal(n, val);
2740 bc_num_parseBase(n, val, base_t);
2742 RETURN_STATUS(BC_STATUS_SUCCESS);
2744 #define zbc_num_parse(...) (zbc_num_parse(__VA_ARGS__) COMMA_SUCCESS)
2746 static void bc_lex_lineComment(void)
2748 BcParse *p = &G.prs;
2749 // Try: echo -n '#foo' | bc
2750 p->lex = XC_LEX_WHITESPACE;
2751 while (p->lex_inbuf < p->lex_end && *p->lex_inbuf != '\n')
2755 static void bc_lex_whitespace(void)
2757 BcParse *p = &G.prs;
2758 p->lex = XC_LEX_WHITESPACE;
2760 char c = *p->lex_inbuf;
2761 if (c == '\n') // this is XC_LEX_NLINE, not XC_LEX_WHITESPACE
2769 static BC_STATUS zbc_lex_number(char start)
2771 BcParse *p = &G.prs;
2772 const char *buf = p->lex_inbuf;
2773 size_t len, i, ccnt;
2776 pt = (start == '.');
2777 p->lex = XC_LEX_NUMBER;
2783 if (c == '\\' && buf[i + 1] == '\n') {
2785 //number_of_backslashes++ - see comment below
2788 if (!isdigit(c) && (c < 'A' || c > 'F')) {
2789 if (c != '.') break;
2790 // if '.' was already seen, stop on second one:
2794 // buf[i] is one of "0-9A-F."
2799 //ccnt is the number of chars in the number string, excluding possible
2800 //trailing "[\<newline>].[\<newline>]" (with any number of \<NL> repetitions).
2801 //i is buf[i] index of the first not-yet-parsed char after that.
2804 // This might overestimate the size, if there are "\<NL>"'s
2805 // in the number. Subtracting number_of_backslashes*2 correctly
2806 // is not that easy: consider that in the case of "NNN.\<NL>"
2807 // loop above will count "\<NL>" before it realizes it is not
2808 // in fact *inside* the number:
2809 len = ccnt + 1; // +1 byte for NUL termination
2811 // This check makes sense only if size_t is (much) larger than BC_MAX_NUM.
2812 if (SIZE_MAX > (BC_MAX_NUM | 0xff)) {
2813 if (len > BC_MAX_NUM)
2814 RETURN_STATUS(bc_error("number too long: must be [1,"BC_MAX_NUM_STR"]"));
2817 bc_vec_pop_all(&p->lex_strnumbuf);
2818 bc_vec_expand(&p->lex_strnumbuf, 1 + len);
2819 bc_vec_push(&p->lex_strnumbuf, &start);
2822 // If we have hit a backslash, skip it. We don't have
2823 // to check for a newline because it's guaranteed.
2829 bc_vec_push(&p->lex_strnumbuf, buf);
2834 bc_vec_pushZeroByte(&p->lex_strnumbuf);
2836 RETURN_STATUS(BC_STATUS_SUCCESS);
2838 #define zbc_lex_number(...) (zbc_lex_number(__VA_ARGS__) COMMA_SUCCESS)
2840 static void bc_lex_name(void)
2842 BcParse *p = &G.prs;
2846 p->lex = XC_LEX_NAME;
2849 buf = p->lex_inbuf - 1;
2852 if ((c < 'a' || c > 'z') && !isdigit(c) && c != '_') break;
2856 #if 0 // We do not protect against people with gigabyte-long names
2857 // This check makes sense only if size_t is (much) larger than BC_MAX_STRING.
2858 if (SIZE_MAX > (BC_MAX_STRING | 0xff)) {
2859 if (i > BC_MAX_STRING)
2860 return bc_error("name too long: must be [1,"BC_MAX_STRING_STR"]");
2863 bc_vec_string(&p->lex_strnumbuf, i, buf);
2865 // Increment the index. We minus 1 because it has already been incremented.
2866 p->lex_inbuf += i - 1;
2868 //return BC_STATUS_SUCCESS;
2871 static void bc_lex_init(void)
2873 bc_char_vec_init(&G.prs.lex_strnumbuf);
2876 static void bc_lex_free(void)
2878 bc_vec_free(&G.prs.lex_strnumbuf);
2881 static void bc_lex_file(void)
2883 G.err_line = G.prs.lex_line = 1;
2884 G.prs.lex_newline = false;
2887 static bool bc_lex_more_input(void)
2889 BcParse *p = &G.prs;
2893 bc_vec_pop_all(&G.input_buffer);
2895 // This loop is complex because the vm tries not to send any lines that end
2896 // with a backslash to the parser. The reason for that is because the parser
2897 // treats a backslash+newline combo as whitespace, per the bc spec. In that
2898 // case, and for strings and comments, the parser will expect more stuff.
2902 size_t prevlen = G.input_buffer.len;
2905 bc_read_line(&G.input_buffer, G.prs.lex_input_fp);
2906 // No more input means EOF
2907 if (G.input_buffer.len <= prevlen + 1) // (we expect +1 for NUL byte)
2910 string = G.input_buffer.v + prevlen;
2914 if (string == G.input_buffer.v || string[-1] != '\\') {
2927 if (c == '/' && *string == '*') {
2932 if (c == '*' && *string == '/') {
2938 if (str != 0 || comment) {
2939 G.input_buffer.len--; // backstep over the trailing NUL byte
2943 // Check for backslash+newline.
2944 // we do not check that last char is '\n' -
2945 // if it is not, then it's EOF, and looping back
2946 // to bc_read_line() will detect it:
2948 if (string >= G.input_buffer.v && *string == '\\') {
2949 G.input_buffer.len--;
2956 p->lex_inbuf = G.input_buffer.v;
2957 // bb_error_msg("G.input_buffer.len:%d '%s'", G.input_buffer.len, G.input_buffer.v);
2958 p->lex_end = p->lex_inbuf + G.input_buffer.len - 1; // do not include NUL
2960 return G.input_buffer.len > 1;
2963 IF_BC(static BC_STATUS zbc_lex_token(void);)
2964 IF_DC(static BC_STATUS zdc_lex_token(void);)
2965 #define zbc_lex_token(...) (zbc_lex_token(__VA_ARGS__) COMMA_SUCCESS)
2966 #define zdc_lex_token(...) (zdc_lex_token(__VA_ARGS__) COMMA_SUCCESS)
2968 static BC_STATUS zbc_lex_next(void)
2970 BcParse *p = &G.prs;
2973 p->lex_last = p->lex;
2974 if (p->lex_last == XC_LEX_EOF) RETURN_STATUS(bc_error("end of file"));
2976 p->lex_line += p->lex_newline;
2977 G.err_line = p->lex_line;
2978 p->lex_newline = false;
2980 // Loop until failure or we don't have whitespace. This
2981 // is so the parser doesn't get inundated with whitespace.
2982 // Comments are also XC_LEX_WHITESPACE tokens and eaten here.
2983 s = BC_STATUS_SUCCESS;
2985 if (p->lex_inbuf == p->lex_end) {
2986 p->lex = XC_LEX_EOF;
2987 if (!G.prs.lex_input_fp)
2988 RETURN_STATUS(BC_STATUS_SUCCESS);
2989 if (!bc_lex_more_input()) {
2990 G.prs.lex_input_fp = NULL;
2991 RETURN_STATUS(BC_STATUS_SUCCESS);
2993 // here it's guaranteed that p->lex_ibuf is below p->lex_end
2995 p->lex_next_at = p->lex_inbuf;
2996 dbg_lex("next string to parse:'%.*s'",
2997 (int)(strchrnul(p->lex_next_at, '\n') - p->lex_next_at),
3001 IF_BC(s = zbc_lex_token());
3003 IF_DC(s = zdc_lex_token());
3005 } while (!s && p->lex == XC_LEX_WHITESPACE);
3006 dbg_lex("p->lex from string:%d", p->lex);
3010 #define zbc_lex_next(...) (zbc_lex_next(__VA_ARGS__) COMMA_SUCCESS)
3013 static BC_STATUS zbc_lex_skip_if_at_NLINE(void)
3015 if (G.prs.lex == XC_LEX_NLINE)
3016 RETURN_STATUS(zbc_lex_next());
3017 RETURN_STATUS(BC_STATUS_SUCCESS);
3019 #define zbc_lex_skip_if_at_NLINE(...) (zbc_lex_skip_if_at_NLINE(__VA_ARGS__) COMMA_SUCCESS)
3021 static BC_STATUS zbc_lex_next_and_skip_NLINE(void)
3025 if (s) RETURN_STATUS(s);
3026 // if(cond)<newline>stmt is accepted too (but not 2+ newlines)
3027 s = zbc_lex_skip_if_at_NLINE();
3030 #define zbc_lex_next_and_skip_NLINE(...) (zbc_lex_next_and_skip_NLINE(__VA_ARGS__) COMMA_SUCCESS)
3033 static BC_STATUS zbc_lex_text_init(const char *text)
3035 G.prs.lex_inbuf = text;
3036 G.prs.lex_end = text + strlen(text);
3037 G.prs.lex = G.prs.lex_last = XC_LEX_INVALID;
3038 RETURN_STATUS(zbc_lex_next());
3040 #define zbc_lex_text_init(...) (zbc_lex_text_init(__VA_ARGS__) COMMA_SUCCESS)
3043 static BC_STATUS zbc_lex_identifier(void)
3045 BcParse *p = &G.prs;
3048 const char *buf = p->lex_inbuf - 1;
3050 for (i = 0; i < ARRAY_SIZE(bc_lex_kws); ++i) {
3051 const char *keyword8 = bc_lex_kws[i].name8;
3053 while (buf[j] != '\0' && buf[j] == keyword8[j]) {
3055 if (j == 8) goto match;
3057 if (keyword8[j] != '\0')
3060 // buf starts with keyword bc_lex_kws[i]
3061 if (isalnum(buf[j]) || buf[j]=='_')
3062 continue; // "ifz" does not match "if" keyword, "if." does
3063 p->lex = BC_LEX_KEY_1st_keyword + i;
3064 if (!keyword_is_POSIX(i)) {
3065 s = zbc_posix_error_fmt("%sthe '%.8s' keyword", "POSIX does not allow ", bc_lex_kws[i].name8);
3066 if (s) RETURN_STATUS(s);
3069 // We minus 1 because the index has already been incremented.
3070 p->lex_inbuf += j - 1;
3071 RETURN_STATUS(BC_STATUS_SUCCESS);
3075 s = BC_STATUS_SUCCESS;
3077 if (p->lex_strnumbuf.len > 2) {
3080 // bc: POSIX only allows one character names; this is bad: 'qwe=1
3082 unsigned len = strchrnul(buf, '\n') - buf;
3083 s = zbc_posix_error_fmt("POSIX only allows one character names; this is bad: '%.*s'", len, buf);
3088 #define zbc_lex_identifier(...) (zbc_lex_identifier(__VA_ARGS__) COMMA_SUCCESS)
3090 static BC_STATUS zbc_lex_string(void)
3092 BcParse *p = &G.prs;
3095 p->lex = XC_LEX_STR;
3100 char c = p->lex_inbuf[i];
3103 RETURN_STATUS(bc_error("unterminated string"));
3112 // This check makes sense only if size_t is (much) larger than BC_MAX_STRING.
3113 if (SIZE_MAX > (BC_MAX_STRING | 0xff)) {
3114 if (len > BC_MAX_STRING)
3115 RETURN_STATUS(bc_error("string too long: must be [1,"BC_MAX_STRING_STR"]"));
3117 bc_vec_string(&p->lex_strnumbuf, len, p->lex_inbuf);
3119 p->lex_inbuf += i + 1;
3121 G.err_line = p->lex_line;
3123 RETURN_STATUS(BC_STATUS_SUCCESS);
3125 #define zbc_lex_string(...) (zbc_lex_string(__VA_ARGS__) COMMA_SUCCESS)
3127 static void bc_lex_assign(unsigned with_and_without)
3129 BcParse *p = &G.prs;
3130 if (*p->lex_inbuf == '=') {
3132 with_and_without >>= 8; // store "with" value
3133 } // else store "without" value
3134 p->lex = (with_and_without & 0xff);
3136 #define bc_lex_assign(with, without) \
3137 bc_lex_assign(((with)<<8)|(without))
3139 static BC_STATUS zbc_lex_comment(void)
3141 BcParse *p = &G.prs;
3143 const char *buf = p->lex_inbuf;
3145 p->lex = XC_LEX_WHITESPACE;
3146 i = 0; /* here lex_inbuf[0] is the '*' of opening comment delimiter */
3158 RETURN_STATUS(bc_error("unterminated comment"));
3163 p->lex_inbuf += i + 1;
3165 G.err_line = p->lex_line;
3167 RETURN_STATUS(BC_STATUS_SUCCESS);
3169 #define zbc_lex_comment(...) (zbc_lex_comment(__VA_ARGS__) COMMA_SUCCESS)
3171 #undef zbc_lex_token
3172 static BC_STATUS zbc_lex_token(void)
3174 BcParse *p = &G.prs;
3175 BcStatus s = BC_STATUS_SUCCESS;
3176 char c = *p->lex_inbuf++;
3179 // This is the workhorse of the lexer.
3181 // case '\0': // probably never reached
3183 // p->lex = XC_LEX_EOF;
3184 // p->lex_newline = true;
3187 p->lex = XC_LEX_NLINE;
3188 p->lex_newline = true;
3195 bc_lex_whitespace();
3198 bc_lex_assign(XC_LEX_OP_REL_NE, BC_LEX_OP_BOOL_NOT);
3199 if (p->lex == BC_LEX_OP_BOOL_NOT) {
3200 s = zbc_POSIX_does_not_allow_bool_ops_this_is_bad("!");
3201 if (s) RETURN_STATUS(s);
3205 s = zbc_lex_string();
3208 s = zbc_POSIX_does_not_allow("'#' script comments");
3209 if (s) RETURN_STATUS(s);
3210 bc_lex_lineComment();
3213 bc_lex_assign(BC_LEX_OP_ASSIGN_MODULUS, XC_LEX_OP_MODULUS);
3218 s = zbc_POSIX_does_not_allow_bool_ops_this_is_bad("&&");
3219 if (s) RETURN_STATUS(s);
3221 p->lex = BC_LEX_OP_BOOL_AND;
3223 p->lex = XC_LEX_INVALID;
3224 s = bc_error_bad_character('&');
3229 p->lex = (BcLexType)(c - '(' + BC_LEX_LPAREN);
3232 bc_lex_assign(BC_LEX_OP_ASSIGN_MULTIPLY, XC_LEX_OP_MULTIPLY);
3238 p->lex = BC_LEX_OP_INC;
3240 bc_lex_assign(BC_LEX_OP_ASSIGN_PLUS, XC_LEX_OP_PLUS);
3243 p->lex = BC_LEX_COMMA;
3249 p->lex = BC_LEX_OP_DEC;
3251 bc_lex_assign(BC_LEX_OP_ASSIGN_MINUS, XC_LEX_OP_MINUS);
3254 if (isdigit(*p->lex_inbuf))
3255 s = zbc_lex_number(c);
3257 p->lex = BC_LEX_KEY_LAST;
3258 s = zbc_POSIX_does_not_allow("'.' as 'last'");
3264 s = zbc_lex_comment();
3266 bc_lex_assign(BC_LEX_OP_ASSIGN_DIVIDE, XC_LEX_OP_DIVIDE);
3284 s = zbc_lex_number(c);
3287 p->lex = BC_LEX_SCOLON;
3290 bc_lex_assign(XC_LEX_OP_REL_LE, XC_LEX_OP_REL_LT);
3293 bc_lex_assign(XC_LEX_OP_REL_EQ, BC_LEX_OP_ASSIGN);
3296 bc_lex_assign(XC_LEX_OP_REL_GE, XC_LEX_OP_REL_GT);
3300 p->lex = (BcLexType)(c - '[' + BC_LEX_LBRACKET);
3303 if (*p->lex_inbuf == '\n') {
3304 p->lex = XC_LEX_WHITESPACE;
3307 s = bc_error_bad_character(c);
3310 bc_lex_assign(BC_LEX_OP_ASSIGN_POWER, XC_LEX_OP_POWER);
3338 s = zbc_lex_identifier();
3342 p->lex = (BcLexType)(c - '{' + BC_LEX_LBRACE);
3347 s = zbc_POSIX_does_not_allow_bool_ops_this_is_bad("||");
3348 if (s) RETURN_STATUS(s);
3350 p->lex = BC_LEX_OP_BOOL_OR;
3352 p->lex = XC_LEX_INVALID;
3353 s = bc_error_bad_character(c);
3357 p->lex = XC_LEX_INVALID;
3358 s = bc_error_bad_character(c);
3364 #define zbc_lex_token(...) (zbc_lex_token(__VA_ARGS__) COMMA_SUCCESS)
3368 static BC_STATUS zdc_lex_register(void)
3370 BcParse *p = &G.prs;
3371 if (G_exreg && isspace(*p->lex_inbuf)) {
3372 bc_lex_whitespace(); // eats whitespace (but not newline)
3373 p->lex_inbuf++; // bc_lex_name() expects this
3376 bc_vec_pop_all(&p->lex_strnumbuf);
3377 bc_vec_push(&p->lex_strnumbuf, p->lex_inbuf++);
3378 bc_vec_pushZeroByte(&p->lex_strnumbuf);
3379 p->lex = XC_LEX_NAME;
3382 RETURN_STATUS(BC_STATUS_SUCCESS);
3384 #define zdc_lex_register(...) (zdc_lex_register(__VA_ARGS__) COMMA_SUCCESS)
3386 static BC_STATUS zdc_lex_string(void)
3388 BcParse *p = &G.prs;
3389 size_t depth, nls, i;
3391 p->lex = XC_LEX_STR;
3392 bc_vec_pop_all(&p->lex_strnumbuf);
3398 char c = p->lex_inbuf[i];
3401 RETURN_STATUS(bc_error("string end could not be found"));
3404 if (i == 0 || p->lex_inbuf[i - 1] != '\\') {
3405 if (c == '[') depth++;
3410 bc_vec_push(&p->lex_strnumbuf, &p->lex_inbuf[i]);
3415 bc_vec_pushZeroByte(&p->lex_strnumbuf);
3416 // This check makes sense only if size_t is (much) larger than BC_MAX_STRING.
3417 if (SIZE_MAX > (BC_MAX_STRING | 0xff)) {
3418 if (i > BC_MAX_STRING)
3419 RETURN_STATUS(bc_error("string too long: must be [1,"BC_MAX_STRING_STR"]"));
3424 G.err_line = p->lex_line;
3426 RETURN_STATUS(BC_STATUS_SUCCESS);
3428 #define zdc_lex_string(...) (zdc_lex_string(__VA_ARGS__) COMMA_SUCCESS)
3430 #undef zdc_lex_token
3431 static BC_STATUS zdc_lex_token(void)
3433 BcParse *p = &G.prs;
3434 static const //BcLexType - should be this type, but narrower type saves size:
3437 XC_LEX_OP_REL_EQ, XC_LEX_OP_REL_LE, XC_LEX_OP_REL_GE, XC_LEX_OP_REL_NE,
3438 XC_LEX_OP_REL_LT, XC_LEX_OP_REL_GT, DC_LEX_SCOLON, DC_LEX_COLON,
3439 DC_LEX_ELSE, DC_LEX_LOAD, DC_LEX_LOAD_POP, DC_LEX_OP_ASSIGN,
3447 for (i = 0; i < ARRAY_SIZE(dc_lex_regs); ++i) {
3448 if (p->lex_last == dc_lex_regs[i])
3449 RETURN_STATUS(zdc_lex_register());
3452 s = BC_STATUS_SUCCESS;
3453 c = *p->lex_inbuf++;
3454 if (c >= '%' && c <= '~'
3455 && (p->lex = dc_char_to_LEX[c - '%']) != XC_LEX_INVALID
3460 // This is the workhorse of the lexer.
3462 // case '\0': // probably never reached
3463 // p->lex = XC_LEX_EOF;
3466 // '\n' is XC_LEX_NLINE, not XC_LEX_WHITESPACE
3467 // (and "case '\n':" is not just empty here)
3468 // only to allow interactive dc have a way to exit
3469 // "parse" stage of "parse,execute" loop
3470 // on <enter>, not on _next_ token (which would mean
3471 // commands are not executed on pressing <enter>).
3472 // IOW: typing "1p<enter>" should print "1" _at once_,
3473 // not after some more input.
3474 p->lex = XC_LEX_NLINE;
3475 p->lex_newline = true;
3482 p->lex_newline = 0; // was (c == '\n')
3483 bc_lex_whitespace();
3488 p->lex = XC_LEX_OP_REL_NE;
3490 p->lex = XC_LEX_OP_REL_LE;
3492 p->lex = XC_LEX_OP_REL_GE;
3494 RETURN_STATUS(bc_error_bad_character(c));
3498 bc_lex_lineComment();
3501 if (isdigit(*p->lex_inbuf))
3502 s = zbc_lex_number(c);
3504 s = bc_error_bad_character(c);
3522 s = zbc_lex_number(c);
3525 s = zdc_lex_string();
3528 p->lex = XC_LEX_INVALID;
3529 s = bc_error_bad_character(c);
3535 #define zdc_lex_token(...) (zdc_lex_token(__VA_ARGS__) COMMA_SUCCESS)
3538 static void bc_parse_push(char i)
3540 BcParse *p = &G.prs;
3541 dbg_compile("%s:%d pushing bytecode %zd:%d", __func__, __LINE__, p->func->code.len, i);
3542 bc_vec_pushByte(&p->func->code, i);
3545 static void bc_parse_pushName(char *name)
3548 bc_parse_push(*name++);
3549 bc_parse_push(BC_PARSE_STREND);
3552 static void bc_parse_pushIndex(size_t idx)
3557 dbg_lex("%s:%d pushing index %zd", __func__, __LINE__, idx);
3558 mask = ((size_t)0xff) << (sizeof(idx) * 8 - 8);
3561 if (idx & mask) break;
3569 bc_parse_push((unsigned char)idx);
3575 static void bc_parse_pushJUMP(size_t idx)
3577 bc_parse_push(BC_INST_JUMP);
3578 bc_parse_pushIndex(idx);
3581 static void bc_parse_pushJUMP_ZERO(size_t idx)
3583 bc_parse_push(BC_INST_JUMP_ZERO);
3584 bc_parse_pushIndex(idx);
3587 static BC_STATUS zbc_parse_pushSTR(void)
3589 BcParse *p = &G.prs;
3590 char *str = xstrdup(p->lex_strnumbuf.v);
3592 bc_parse_push(XC_INST_STR);
3593 bc_parse_pushIndex(p->func->strs.len);
3594 bc_vec_push(&p->func->strs, &str);
3596 RETURN_STATUS(zbc_lex_next());
3598 #define zbc_parse_pushSTR(...) (zbc_parse_pushSTR(__VA_ARGS__) COMMA_SUCCESS)
3601 static void bc_parse_pushNUM(void)
3603 BcParse *p = &G.prs;
3604 char *num = xstrdup(p->lex_strnumbuf.v);
3605 #if ENABLE_BC && ENABLE_DC
3606 size_t idx = bc_vec_push(IS_BC ? &p->func->consts : &G.prog.consts, &num);
3608 size_t idx = bc_vec_push(&p->func->consts, &num);
3610 size_t idx = bc_vec_push(&G.prog.consts, &num);
3612 bc_parse_push(XC_INST_NUM);
3613 bc_parse_pushIndex(idx);
3616 static BC_STATUS zbc_parse_text_init(const char *text)
3618 BcParse *p = &G.prs;
3619 p->func = bc_program_func(p->fidx);
3621 RETURN_STATUS(zbc_lex_text_init(text));
3623 #define zbc_parse_text_init(...) (zbc_parse_text_init(__VA_ARGS__) COMMA_SUCCESS)
3625 // Called when parsing or execution detects a failure,
3626 // resets execution structures.
3627 static void bc_program_reset(void)
3632 bc_vec_npop(&G.prog.exestack, G.prog.exestack.len - 1);
3633 bc_vec_pop_all(&G.prog.results);
3635 f = bc_program_func_BC_PROG_MAIN();
3636 ip = bc_vec_top(&G.prog.exestack);
3637 ip->inst_idx = f->code.len;
3640 // Called when parsing code detects a failure,
3641 // resets parsing structures.
3642 static void bc_parse_reset(void)
3644 BcParse *p = &G.prs;
3645 if (p->fidx != BC_PROG_MAIN) {
3646 bc_func_free(p->func);
3647 bc_func_init(p->func);
3649 p->fidx = BC_PROG_MAIN;
3650 p->func = bc_program_func_BC_PROG_MAIN();
3653 p->lex_inbuf = p->lex_end;
3654 p->lex = XC_LEX_EOF;
3656 IF_BC(bc_vec_pop_all(&p->exits);)
3657 IF_BC(bc_vec_pop_all(&p->conds);)
3658 IF_BC(bc_vec_pop_all(&p->ops);)
3663 static void bc_parse_free(void)
3665 BcParse *p = &G.prs;
3666 IF_BC(bc_vec_free(&p->exits);)
3667 IF_BC(bc_vec_free(&p->conds);)
3668 IF_BC(bc_vec_free(&p->ops);)
3672 static void bc_parse_create(size_t fidx)
3674 BcParse *p = &G.prs;
3675 memset(p, 0, sizeof(BcParse));
3678 IF_BC(bc_vec_init(&p->exits, sizeof(size_t), NULL);)
3679 IF_BC(bc_vec_init(&p->conds, sizeof(size_t), NULL);)
3680 IF_BC(bc_vec_init(&p->ops, sizeof(BcLexType), NULL);)
3683 p->func = bc_program_func(fidx);
3686 static void bc_program_add_fn(void)
3692 bc_vec_push(&G.prog.fns, &f);
3698 // Note: takes ownership of 'name' (must be malloced)
3699 static size_t bc_program_addFunc(char *name)
3702 BcId entry, *entry_ptr;
3706 entry.idx = G.prog.fns.len;
3708 inserted = bc_map_insert(&G.prog.fn_map, &entry, &idx);
3709 if (!inserted) free(name);
3711 entry_ptr = bc_vec_item(&G.prog.fn_map, idx);
3712 idx = entry_ptr->idx;
3715 // There is already a function with this name.
3716 // It'll be redefined now, clear old definition.
3717 BcFunc *func = bc_program_func(entry_ptr->idx);
3721 bc_program_add_fn();
3727 #define BC_PARSE_TOP_OP(p) (*(BcLexType*)bc_vec_top(&(p)->ops))
3728 // We can calculate the conversion between tokens and exprs by subtracting the
3729 // position of the first operator in the lex enum and adding the position of the
3730 // first in the expr enum. Note: This only works for binary operators.
3731 #define BC_TOKEN_2_INST(t) ((char) ((t) - XC_LEX_OP_POWER + XC_INST_POWER))
3733 static BcStatus bc_parse_expr_empty_ok(uint8_t flags);
3735 static BC_STATUS zbc_parse_expr(uint8_t flags)
3739 s = bc_parse_expr_empty_ok(flags);
3740 if (s == BC_STATUS_PARSE_EMPTY_EXP)
3741 RETURN_STATUS(bc_error("empty expression"));
3744 #define zbc_parse_expr(...) (zbc_parse_expr(__VA_ARGS__) COMMA_SUCCESS)
3746 static BC_STATUS zbc_parse_stmt_possibly_auto(bool auto_allowed);
3747 #define zbc_parse_stmt_possibly_auto(...) (zbc_parse_stmt_possibly_auto(__VA_ARGS__) COMMA_SUCCESS)
3749 static BC_STATUS zbc_parse_stmt(void)
3751 RETURN_STATUS(zbc_parse_stmt_possibly_auto(false));
3753 #define zbc_parse_stmt(...) (zbc_parse_stmt(__VA_ARGS__) COMMA_SUCCESS)
3755 static BC_STATUS zbc_parse_stmt_allow_NLINE_before(const char *after_X)
3757 BcParse *p = &G.prs;
3758 // "if(cond)<newline>stmt" is accepted too, but not 2+ newlines.
3759 // Same for "else", "while()", "for()".
3760 BcStatus s = zbc_lex_next_and_skip_NLINE();
3761 if (s) RETURN_STATUS(s);
3762 if (p->lex == XC_LEX_NLINE)
3763 RETURN_STATUS(bc_error_fmt("no statement after '%s'", after_X));
3765 RETURN_STATUS(zbc_parse_stmt());
3767 #define zbc_parse_stmt_allow_NLINE_before(...) (zbc_parse_stmt_allow_NLINE_before(__VA_ARGS__) COMMA_SUCCESS)
3769 static void bc_parse_operator(BcLexType type, size_t start, size_t *nexprs)
3771 BcParse *p = &G.prs;
3772 char l, r = bc_parse_op_PREC(type - XC_LEX_1st_op);
3773 bool left = bc_parse_op_LEFT(type - XC_LEX_1st_op);
3775 while (p->ops.len > start) {
3776 BcLexType t = BC_PARSE_TOP_OP(p);
3777 if (t == BC_LEX_LPAREN) break;
3779 l = bc_parse_op_PREC(t - XC_LEX_1st_op);
3780 if (l >= r && (l != r || !left)) break;
3782 bc_parse_push(BC_TOKEN_2_INST(t));
3783 bc_vec_pop(&p->ops);
3784 *nexprs -= (t != BC_LEX_OP_BOOL_NOT && t != XC_LEX_NEG);
3787 bc_vec_push(&p->ops, &type);
3790 static BC_STATUS zbc_parse_rightParen(size_t ops_bgn, size_t *nexs)
3792 BcParse *p = &G.prs;
3795 if (p->ops.len <= ops_bgn)
3796 RETURN_STATUS(bc_error_bad_expression());
3797 top = BC_PARSE_TOP_OP(p);
3799 while (top != BC_LEX_LPAREN) {
3800 bc_parse_push(BC_TOKEN_2_INST(top));
3802 bc_vec_pop(&p->ops);
3803 *nexs -= (top != BC_LEX_OP_BOOL_NOT && top != XC_LEX_NEG);
3805 if (p->ops.len <= ops_bgn)
3806 RETURN_STATUS(bc_error_bad_expression());
3807 top = BC_PARSE_TOP_OP(p);
3810 bc_vec_pop(&p->ops);
3812 RETURN_STATUS(BC_STATUS_SUCCESS);
3814 #define zbc_parse_rightParen(...) (zbc_parse_rightParen(__VA_ARGS__) COMMA_SUCCESS)
3816 static BC_STATUS zbc_parse_params(uint8_t flags)
3818 BcParse *p = &G.prs;
3822 dbg_lex("%s:%d p->lex:%d", __func__, __LINE__, p->lex);
3823 flags = (flags & ~(BC_PARSE_PRINT | BC_PARSE_REL)) | BC_PARSE_ARRAY;
3826 if (s) RETURN_STATUS(s);
3829 if (p->lex != BC_LEX_RPAREN) {
3831 s = zbc_parse_expr(flags);
3832 if (s) RETURN_STATUS(s);
3834 if (p->lex != BC_LEX_COMMA) {
3835 if (p->lex == BC_LEX_RPAREN)
3837 RETURN_STATUS(bc_error_bad_token());
3840 if (s) RETURN_STATUS(s);
3844 bc_parse_push(BC_INST_CALL);
3845 bc_parse_pushIndex(nparams);
3847 RETURN_STATUS(BC_STATUS_SUCCESS);
3849 #define zbc_parse_params(...) (zbc_parse_params(__VA_ARGS__) COMMA_SUCCESS)
3851 // Note: takes ownership of 'name' (must be malloced)
3852 static BC_STATUS zbc_parse_call(char *name, uint8_t flags)
3854 BcParse *p = &G.prs;
3856 BcId entry, *entry_ptr;
3861 s = zbc_parse_params(flags);
3864 if (p->lex != BC_LEX_RPAREN) {
3865 s = bc_error_bad_token();
3869 idx = bc_map_find_exact(&G.prog.fn_map, &entry);
3871 if (idx == BC_VEC_INVALID_IDX) {
3872 // No such function exists, create an empty one
3873 bc_program_addFunc(name);
3874 idx = bc_map_find_exact(&G.prog.fn_map, &entry);
3878 entry_ptr = bc_vec_item(&G.prog.fn_map, idx);
3879 bc_parse_pushIndex(entry_ptr->idx);
3881 RETURN_STATUS(zbc_lex_next());
3886 #define zbc_parse_call(...) (zbc_parse_call(__VA_ARGS__) COMMA_SUCCESS)
3888 static BC_STATUS zbc_parse_name(BcInst *type, uint8_t flags)
3890 BcParse *p = &G.prs;
3894 name = xstrdup(p->lex_strnumbuf.v);
3898 if (p->lex == BC_LEX_LBRACKET) {
3902 if (p->lex == BC_LEX_RBRACKET) {
3903 if (!(flags & BC_PARSE_ARRAY)) {
3904 s = bc_error_bad_expression();
3907 *type = XC_INST_ARRAY;
3909 *type = XC_INST_ARRAY_ELEM;
3910 flags &= ~(BC_PARSE_PRINT | BC_PARSE_REL);
3911 s = zbc_parse_expr(flags);
3916 bc_parse_push(*type);
3917 bc_parse_pushName(name);
3919 } else if (p->lex == BC_LEX_LPAREN) {
3920 if (flags & BC_PARSE_NOCALL) {
3921 s = bc_error_bad_token();
3924 *type = BC_INST_CALL;
3925 s = zbc_parse_call(name, flags);
3927 *type = XC_INST_VAR;
3928 bc_parse_push(XC_INST_VAR);
3929 bc_parse_pushName(name);
3938 #define zbc_parse_name(...) (zbc_parse_name(__VA_ARGS__) COMMA_SUCCESS)
3940 static BC_STATUS zbc_parse_read(void)
3942 BcParse *p = &G.prs;
3946 if (s) RETURN_STATUS(s);
3947 if (p->lex != BC_LEX_LPAREN) RETURN_STATUS(bc_error_bad_token());
3950 if (s) RETURN_STATUS(s);
3951 if (p->lex != BC_LEX_RPAREN) RETURN_STATUS(bc_error_bad_token());
3953 bc_parse_push(XC_INST_READ);
3957 #define zbc_parse_read(...) (zbc_parse_read(__VA_ARGS__) COMMA_SUCCESS)
3959 static BC_STATUS zbc_parse_builtin(BcLexType type, uint8_t flags, BcInst *prev)
3961 BcParse *p = &G.prs;
3965 if (s) RETURN_STATUS(s);
3966 if (p->lex != BC_LEX_LPAREN) RETURN_STATUS(bc_error_bad_token());
3968 flags = (flags & ~(BC_PARSE_PRINT | BC_PARSE_REL)) | BC_PARSE_ARRAY;
3971 if (s) RETURN_STATUS(s);
3973 s = zbc_parse_expr(flags);
3974 if (s) RETURN_STATUS(s);
3976 if (p->lex != BC_LEX_RPAREN) RETURN_STATUS(bc_error_bad_token());
3978 *prev = (type == BC_LEX_KEY_LENGTH) ? XC_INST_LENGTH : XC_INST_SQRT;
3979 bc_parse_push(*prev);
3983 #define zbc_parse_builtin(...) (zbc_parse_builtin(__VA_ARGS__) COMMA_SUCCESS)
3985 static BC_STATUS zbc_parse_scale(BcInst *type, uint8_t flags)
3987 BcParse *p = &G.prs;
3991 if (s) RETURN_STATUS(s);
3993 if (p->lex != BC_LEX_LPAREN) {
3994 *type = XC_INST_SCALE;
3995 bc_parse_push(XC_INST_SCALE);
3996 RETURN_STATUS(BC_STATUS_SUCCESS);
3999 *type = XC_INST_SCALE_FUNC;
4000 flags &= ~(BC_PARSE_PRINT | BC_PARSE_REL);
4003 if (s) RETURN_STATUS(s);
4005 s = zbc_parse_expr(flags);
4006 if (s) RETURN_STATUS(s);
4007 if (p->lex != BC_LEX_RPAREN)
4008 RETURN_STATUS(bc_error_bad_token());
4009 bc_parse_push(XC_INST_SCALE_FUNC);
4011 RETURN_STATUS(zbc_lex_next());
4013 #define zbc_parse_scale(...) (zbc_parse_scale(__VA_ARGS__) COMMA_SUCCESS)
4015 static BC_STATUS zbc_parse_incdec(BcInst *prev, bool *paren_expr,
4016 size_t *nexprs, uint8_t flags)
4018 BcParse *p = &G.prs;
4022 BcInst etype = *prev;
4024 if (etype == XC_INST_VAR || etype == XC_INST_ARRAY_ELEM
4025 || etype == XC_INST_SCALE || etype == BC_INST_LAST
4026 || etype == XC_INST_IBASE || etype == XC_INST_OBASE
4028 *prev = inst = BC_INST_INC_POST + (p->lex != BC_LEX_OP_INC);
4029 bc_parse_push(inst);
4032 *prev = inst = BC_INST_INC_PRE + (p->lex != BC_LEX_OP_INC);
4036 if (s) RETURN_STATUS(s);
4039 // Because we parse the next part of the expression
4040 // right here, we need to increment this.
4041 *nexprs = *nexprs + 1;
4045 s = zbc_parse_name(prev, flags | BC_PARSE_NOCALL);
4047 case BC_LEX_KEY_IBASE:
4048 case BC_LEX_KEY_LAST:
4049 case BC_LEX_KEY_OBASE:
4050 bc_parse_push(type - BC_LEX_KEY_IBASE + XC_INST_IBASE);
4053 case BC_LEX_KEY_SCALE:
4055 if (s) RETURN_STATUS(s);
4056 if (p->lex == BC_LEX_LPAREN)
4057 s = bc_error_bad_token();
4059 bc_parse_push(XC_INST_SCALE);
4062 s = bc_error_bad_token();
4066 if (!s) bc_parse_push(inst);
4071 #define zbc_parse_incdec(...) (zbc_parse_incdec(__VA_ARGS__) COMMA_SUCCESS)
4074 #define BC_PARSE_LEAF(p, rparen) \
4076 || ((p) >= XC_INST_NUM && (p) <= XC_INST_SQRT) \
4077 || (p) == BC_INST_INC_POST \
4078 || (p) == BC_INST_DEC_POST \
4081 static int ok_in_expr(BcInst p)
4083 return (p >= XC_INST_NUM && p <= XC_INST_SQRT)
4084 || p == BC_INST_INC_POST
4085 || p == BC_INST_DEC_POST
4088 #define BC_PARSE_LEAF(p, rparen) ((rparen) || ok_in_expr(p))
4091 static BC_STATUS zbc_parse_minus(BcInst *prev, size_t ops_bgn,
4092 bool rparen, size_t *nexprs)
4094 BcParse *p = &G.prs;
4097 BcInst etype = *prev;
4100 if (s) RETURN_STATUS(s);
4102 type = BC_PARSE_LEAF(etype, rparen) ? XC_LEX_OP_MINUS : XC_LEX_NEG;
4103 *prev = BC_TOKEN_2_INST(type);
4105 // We can just push onto the op stack because this is the largest
4106 // precedence operator that gets pushed. Inc/dec does not.
4107 if (type != XC_LEX_OP_MINUS)
4108 bc_vec_push(&p->ops, &type);
4110 bc_parse_operator(type, ops_bgn, nexprs);
4114 #define zbc_parse_minus(...) (zbc_parse_minus(__VA_ARGS__) COMMA_SUCCESS)
4116 static BC_STATUS zbc_parse_print(void)
4118 BcParse *p = &G.prs;
4124 if (s) RETURN_STATUS(s);
4126 if (type == XC_LEX_STR) {
4127 s = zbc_parse_pushSTR();
4129 s = zbc_parse_expr(0);
4131 if (s) RETURN_STATUS(s);
4132 bc_parse_push(XC_INST_PRINT_POP);
4133 if (p->lex != BC_LEX_COMMA)
4139 #define zbc_parse_print(...) (zbc_parse_print(__VA_ARGS__) COMMA_SUCCESS)
4141 static BC_STATUS zbc_parse_return(void)
4143 BcParse *p = &G.prs;
4147 dbg_lex_enter("%s:%d entered", __func__, __LINE__);
4149 if (s) RETURN_STATUS(s);
4152 if (t == XC_LEX_NLINE || t == BC_LEX_SCOLON)
4153 bc_parse_push(BC_INST_RET0);
4155 bool paren = (t == BC_LEX_LPAREN);
4156 s = bc_parse_expr_empty_ok(0);
4157 if (s == BC_STATUS_PARSE_EMPTY_EXP) {
4158 bc_parse_push(BC_INST_RET0);
4161 if (s) RETURN_STATUS(s);
4163 if (!paren || p->lex_last != BC_LEX_RPAREN) {
4164 s = zbc_POSIX_requires("parentheses around return expressions");
4165 if (s) RETURN_STATUS(s);
4168 bc_parse_push(XC_INST_RET);
4171 dbg_lex_done("%s:%d done", __func__, __LINE__);
4174 #define zbc_parse_return(...) (zbc_parse_return(__VA_ARGS__) COMMA_SUCCESS)
4176 static void rewrite_label_to_current(size_t idx)
4178 BcParse *p = &G.prs;
4179 size_t *label = bc_vec_item(&p->func->labels, idx);
4180 *label = p->func->code.len;
4183 static BC_STATUS zbc_parse_if(void)
4185 BcParse *p = &G.prs;
4189 dbg_lex_enter("%s:%d entered", __func__, __LINE__);
4191 if (s) RETURN_STATUS(s);
4192 if (p->lex != BC_LEX_LPAREN) RETURN_STATUS(bc_error_bad_token());
4195 if (s) RETURN_STATUS(s);
4196 s = zbc_parse_expr(BC_PARSE_REL);
4197 if (s) RETURN_STATUS(s);
4198 if (p->lex != BC_LEX_RPAREN) RETURN_STATUS(bc_error_bad_token());
4200 // Encode "if zero, jump to ..."
4201 // Pushed value (destination of the jump) is uninitialized,
4202 // will be rewritten to be address of "end of if()" or of "else".
4203 ip_idx = bc_vec_push(&p->func->labels, &ip_idx);
4204 bc_parse_pushJUMP_ZERO(ip_idx);
4206 s = zbc_parse_stmt_allow_NLINE_before(STRING_if);
4207 if (s) RETURN_STATUS(s);
4209 dbg_lex("%s:%d in if after stmt: p->lex:%d", __func__, __LINE__, p->lex);
4210 if (p->lex == BC_LEX_KEY_ELSE) {
4213 // Encode "after then_stmt, jump to end of if()"
4214 ip2_idx = bc_vec_push(&p->func->labels, &ip2_idx);
4215 dbg_lex("%s:%d after if() then_stmt: BC_INST_JUMP to %zd", __func__, __LINE__, ip2_idx);
4216 bc_parse_pushJUMP(ip2_idx);
4218 dbg_lex("%s:%d rewriting 'if_zero' label to jump to 'else'-> %zd", __func__, __LINE__, p->func->code.len);
4219 rewrite_label_to_current(ip_idx);
4223 s = zbc_parse_stmt_allow_NLINE_before(STRING_else);
4224 if (s) RETURN_STATUS(s);
4227 dbg_lex("%s:%d rewriting label to jump after 'if' body-> %zd", __func__, __LINE__, p->func->code.len);
4228 rewrite_label_to_current(ip_idx);
4230 dbg_lex_done("%s:%d done", __func__, __LINE__);
4233 #define zbc_parse_if(...) (zbc_parse_if(__VA_ARGS__) COMMA_SUCCESS)
4235 static BC_STATUS zbc_parse_while(void)
4237 BcParse *p = &G.prs;
4243 if (s) RETURN_STATUS(s);
4244 if (p->lex != BC_LEX_LPAREN) RETURN_STATUS(bc_error_bad_token());
4246 if (s) RETURN_STATUS(s);
4248 cond_idx = bc_vec_push(&p->func->labels, &p->func->code.len);
4249 ip_idx = cond_idx + 1;
4250 bc_vec_push(&p->conds, &cond_idx);
4252 bc_vec_push(&p->exits, &ip_idx);
4253 bc_vec_push(&p->func->labels, &ip_idx);
4255 s = zbc_parse_expr(BC_PARSE_REL);
4256 if (s) RETURN_STATUS(s);
4257 if (p->lex != BC_LEX_RPAREN) RETURN_STATUS(bc_error_bad_token());
4259 bc_parse_pushJUMP_ZERO(ip_idx);
4261 s = zbc_parse_stmt_allow_NLINE_before(STRING_while);
4262 if (s) RETURN_STATUS(s);
4264 dbg_lex("%s:%d BC_INST_JUMP to %zd", __func__, __LINE__, cond_idx);
4265 bc_parse_pushJUMP(cond_idx);
4267 dbg_lex("%s:%d rewriting label-> %zd", __func__, __LINE__, p->func->code.len);
4268 rewrite_label_to_current(ip_idx);
4270 bc_vec_pop(&p->exits);
4271 bc_vec_pop(&p->conds);
4275 #define zbc_parse_while(...) (zbc_parse_while(__VA_ARGS__) COMMA_SUCCESS)
4277 static BC_STATUS zbc_parse_for(void)
4279 BcParse *p = &G.prs;
4281 size_t cond_idx, exit_idx, body_idx, update_idx;
4283 dbg_lex("%s:%d p->lex:%d", __func__, __LINE__, p->lex);
4285 if (s) RETURN_STATUS(s);
4286 if (p->lex != BC_LEX_LPAREN) RETURN_STATUS(bc_error_bad_token());
4288 if (s) RETURN_STATUS(s);
4290 if (p->lex != BC_LEX_SCOLON) {
4291 s = zbc_parse_expr(0);
4292 bc_parse_push(XC_INST_POP);
4293 if (s) RETURN_STATUS(s);
4295 s = zbc_POSIX_does_not_allow_empty_X_expression_in_for("init");
4296 if (s) RETURN_STATUS(s);
4299 if (p->lex != BC_LEX_SCOLON) RETURN_STATUS(bc_error_bad_token());
4301 if (s) RETURN_STATUS(s);
4303 cond_idx = bc_vec_push(&p->func->labels, &p->func->code.len);
4304 update_idx = cond_idx + 1;
4305 body_idx = update_idx + 1;
4306 exit_idx = body_idx + 1;
4308 if (p->lex != BC_LEX_SCOLON)
4309 s = zbc_parse_expr(BC_PARSE_REL);
4311 // Set this for the next call to bc_parse_pushNUM().
4312 // This is safe to set because the current token is a semicolon,
4313 // which has no string requirement.
4314 bc_vec_string(&p->lex_strnumbuf, 1, "1");
4316 s = zbc_POSIX_does_not_allow_empty_X_expression_in_for("condition");
4318 if (s) RETURN_STATUS(s);
4320 if (p->lex != BC_LEX_SCOLON) RETURN_STATUS(bc_error_bad_token());
4323 if (s) RETURN_STATUS(s);
4325 bc_parse_pushJUMP_ZERO(exit_idx);
4326 bc_parse_pushJUMP(body_idx);
4328 bc_vec_push(&p->conds, &update_idx);
4329 bc_vec_push(&p->func->labels, &p->func->code.len);
4331 if (p->lex != BC_LEX_RPAREN) {
4332 s = zbc_parse_expr(0);
4333 if (s) RETURN_STATUS(s);
4334 if (p->lex != BC_LEX_RPAREN) RETURN_STATUS(bc_error_bad_token());
4335 bc_parse_push(XC_INST_POP);
4337 s = zbc_POSIX_does_not_allow_empty_X_expression_in_for("update");
4338 if (s) RETURN_STATUS(s);
4341 bc_parse_pushJUMP(cond_idx);
4342 bc_vec_push(&p->func->labels, &p->func->code.len);
4344 bc_vec_push(&p->exits, &exit_idx);
4345 bc_vec_push(&p->func->labels, &exit_idx);
4347 s = zbc_parse_stmt_allow_NLINE_before(STRING_for);
4348 if (s) RETURN_STATUS(s);
4350 dbg_lex("%s:%d BC_INST_JUMP to %zd", __func__, __LINE__, update_idx);
4351 bc_parse_pushJUMP(update_idx);
4353 dbg_lex("%s:%d rewriting label-> %zd", __func__, __LINE__, p->func->code.len);
4354 rewrite_label_to_current(exit_idx);
4356 bc_vec_pop(&p->exits);
4357 bc_vec_pop(&p->conds);
4359 RETURN_STATUS(BC_STATUS_SUCCESS);
4361 #define zbc_parse_for(...) (zbc_parse_for(__VA_ARGS__) COMMA_SUCCESS)
4363 static BC_STATUS zbc_parse_break_or_continue(BcLexType type)
4365 BcParse *p = &G.prs;
4368 if (type == BC_LEX_KEY_BREAK) {
4369 if (p->exits.len == 0) // none of the enclosing blocks is a loop
4370 RETURN_STATUS(bc_error_bad_token());
4371 i = *(size_t*)bc_vec_top(&p->exits);
4373 i = *(size_t*)bc_vec_top(&p->conds);
4375 bc_parse_pushJUMP(i);
4377 RETURN_STATUS(zbc_lex_next());
4379 #define zbc_parse_break_or_continue(...) (zbc_parse_break_or_continue(__VA_ARGS__) COMMA_SUCCESS)
4381 static BC_STATUS zbc_func_insert(BcFunc *f, char *name, bool var)
4387 autoid = (void*)f->autos.v;
4388 for (i = 0; i < f->autos.len; i++, autoid++) {
4389 if (strcmp(name, autoid->name) == 0)
4390 RETURN_STATUS(bc_error("duplicate function parameter or auto name"));
4396 bc_vec_push(&f->autos, &a);
4398 RETURN_STATUS(BC_STATUS_SUCCESS);
4400 #define zbc_func_insert(...) (zbc_func_insert(__VA_ARGS__) COMMA_SUCCESS)
4402 static BC_STATUS zbc_parse_funcdef(void)
4404 BcParse *p = &G.prs;
4406 bool var, comma = false;
4409 dbg_lex_enter("%s:%d entered", __func__, __LINE__);
4411 if (s) RETURN_STATUS(s);
4412 if (p->lex != XC_LEX_NAME)
4413 RETURN_STATUS(bc_error("bad function definition"));
4415 name = xstrdup(p->lex_strnumbuf.v);
4416 p->fidx = bc_program_addFunc(name);
4417 p->func = bc_program_func(p->fidx);
4420 if (s) RETURN_STATUS(s);
4421 if (p->lex != BC_LEX_LPAREN)
4422 RETURN_STATUS(bc_error("bad function definition"));
4424 if (s) RETURN_STATUS(s);
4426 while (p->lex != BC_LEX_RPAREN) {
4427 if (p->lex != XC_LEX_NAME)
4428 RETURN_STATUS(bc_error("bad function definition"));
4432 name = xstrdup(p->lex_strnumbuf.v);
4436 var = p->lex != BC_LEX_LBRACKET;
4442 if (p->lex != BC_LEX_RBRACKET) {
4443 s = bc_error("bad function definition");
4451 comma = p->lex == BC_LEX_COMMA;
4457 s = zbc_func_insert(p->func, name, var);
4461 if (comma) RETURN_STATUS(bc_error("bad function definition"));
4464 if (s) RETURN_STATUS(s);
4466 if (p->lex != BC_LEX_LBRACE) {
4467 s = zbc_POSIX_requires("the left brace be on the same line as the function header");
4468 if (s) RETURN_STATUS(s);
4471 // Prevent "define z()<newline>" from being interpreted as function with empty stmt as body
4472 s = zbc_lex_skip_if_at_NLINE();
4473 if (s) RETURN_STATUS(s);
4474 //GNU bc requires a {} block even if function body has single stmt, enforce this?
4475 if (p->lex != BC_LEX_LBRACE)
4476 RETURN_STATUS(bc_error("function { body } expected"));
4478 p->in_funcdef++; // to determine whether "return" stmt is allowed, and such
4479 s = zbc_parse_stmt_possibly_auto(true);
4481 if (s) RETURN_STATUS(s);
4483 bc_parse_push(BC_INST_RET0);
4485 // Subsequent code generation is into main program
4486 p->fidx = BC_PROG_MAIN;
4487 p->func = bc_program_func_BC_PROG_MAIN();
4489 dbg_lex_done("%s:%d done", __func__, __LINE__);
4492 dbg_lex_done("%s:%d done (error)", __func__, __LINE__);
4496 #define zbc_parse_funcdef(...) (zbc_parse_funcdef(__VA_ARGS__) COMMA_SUCCESS)
4498 static BC_STATUS zbc_parse_auto(void)
4500 BcParse *p = &G.prs;
4504 dbg_lex_enter("%s:%d entered", __func__, __LINE__);
4506 if (s) RETURN_STATUS(s);
4511 if (p->lex != XC_LEX_NAME)
4512 RETURN_STATUS(bc_error("bad 'auto' syntax"));
4514 name = xstrdup(p->lex_strnumbuf.v);
4518 var = (p->lex != BC_LEX_LBRACKET);
4523 if (p->lex != BC_LEX_RBRACKET) {
4524 s = bc_error("bad 'auto' syntax");
4531 s = zbc_func_insert(p->func, name, var);
4534 if (p->lex == XC_LEX_NLINE
4535 || p->lex == BC_LEX_SCOLON
4536 //|| p->lex == BC_LEX_RBRACE // allow "define f() {auto a}"
4540 if (p->lex != BC_LEX_COMMA)
4541 RETURN_STATUS(bc_error("bad 'auto' syntax"));
4542 s = zbc_lex_next(); // skip comma
4543 if (s) RETURN_STATUS(s);
4546 dbg_lex_done("%s:%d done", __func__, __LINE__);
4547 RETURN_STATUS(BC_STATUS_SUCCESS);
4550 dbg_lex_done("%s:%d done (ERROR)", __func__, __LINE__);
4553 #define zbc_parse_auto(...) (zbc_parse_auto(__VA_ARGS__) COMMA_SUCCESS)
4555 #undef zbc_parse_stmt_possibly_auto
4556 static BC_STATUS zbc_parse_stmt_possibly_auto(bool auto_allowed)
4558 BcParse *p = &G.prs;
4559 BcStatus s = BC_STATUS_SUCCESS;
4561 dbg_lex_enter("%s:%d entered, p->lex:%d", __func__, __LINE__, p->lex);
4563 if (p->lex == XC_LEX_NLINE) {
4564 dbg_lex_done("%s:%d done (seen XC_LEX_NLINE)", __func__, __LINE__);
4565 RETURN_STATUS(zbc_lex_next());
4567 if (p->lex == BC_LEX_SCOLON) {
4568 dbg_lex_done("%s:%d done (seen BC_LEX_SCOLON)", __func__, __LINE__);
4569 RETURN_STATUS(zbc_lex_next());
4572 if (p->lex == BC_LEX_LBRACE) {
4573 dbg_lex("%s:%d BC_LEX_LBRACE: (auto_allowed:%d)", __func__, __LINE__, auto_allowed);
4576 if (s) RETURN_STATUS(s);
4577 } while (p->lex == XC_LEX_NLINE);
4578 if (auto_allowed && p->lex == BC_LEX_KEY_AUTO) {
4579 dbg_lex("%s:%d calling zbc_parse_auto()", __func__, __LINE__);
4580 s = zbc_parse_auto();
4581 if (s) RETURN_STATUS(s);
4583 while (p->lex != BC_LEX_RBRACE) {
4584 dbg_lex("%s:%d block parsing loop", __func__, __LINE__);
4585 s = zbc_parse_stmt();
4586 if (s) RETURN_STATUS(s);
4589 dbg_lex_done("%s:%d done (seen BC_LEX_RBRACE)", __func__, __LINE__);
4593 dbg_lex("%s:%d p->lex:%d", __func__, __LINE__, p->lex);
4595 case XC_LEX_OP_MINUS:
4598 case BC_LEX_OP_BOOL_NOT:
4602 case BC_LEX_KEY_IBASE:
4603 case BC_LEX_KEY_LAST:
4604 case BC_LEX_KEY_LENGTH:
4605 case BC_LEX_KEY_OBASE:
4606 case BC_LEX_KEY_READ:
4607 case BC_LEX_KEY_SCALE:
4608 case BC_LEX_KEY_SQRT:
4609 s = zbc_parse_expr(BC_PARSE_PRINT);
4612 s = zbc_parse_pushSTR();
4613 bc_parse_push(XC_INST_PRINT_STR);
4615 case BC_LEX_KEY_BREAK:
4616 case BC_LEX_KEY_CONTINUE:
4617 s = zbc_parse_break_or_continue(p->lex);
4619 case BC_LEX_KEY_FOR:
4620 s = zbc_parse_for();
4622 case BC_LEX_KEY_HALT:
4623 bc_parse_push(BC_INST_HALT);
4629 case BC_LEX_KEY_LIMITS:
4630 // "limits" is a compile-time command,
4631 // the output is produced at _parse time_.
4633 "BC_BASE_MAX = "BC_MAX_OBASE_STR "\n"
4634 "BC_DIM_MAX = "BC_MAX_DIM_STR "\n"
4635 "BC_SCALE_MAX = "BC_MAX_SCALE_STR "\n"
4636 "BC_STRING_MAX = "BC_MAX_STRING_STR"\n"
4637 "BC_NAME_MAX = "BC_MAX_NAME_STR "\n"
4638 "BC_NUM_MAX = "BC_MAX_NUM_STR "\n"
4639 "MAX Exponent = "BC_MAX_EXP_STR "\n"
4640 "Number of vars = "BC_MAX_VARS_STR "\n"
4644 case BC_LEX_KEY_PRINT:
4645 s = zbc_parse_print();
4647 case BC_LEX_KEY_QUIT:
4648 // "quit" is a compile-time command. For example,
4649 // "if (0 == 1) quit" terminates when parsing the statement,
4650 // not when it is executed
4651 QUIT_OR_RETURN_TO_MAIN;
4652 case BC_LEX_KEY_RETURN:
4654 RETURN_STATUS(bc_error("'return' not in a function"));
4655 s = zbc_parse_return();
4657 case BC_LEX_KEY_WHILE:
4658 s = zbc_parse_while();
4661 s = bc_error_bad_token();
4665 dbg_lex_done("%s:%d done", __func__, __LINE__);
4668 #define zbc_parse_stmt_possibly_auto(...) (zbc_parse_stmt_possibly_auto(__VA_ARGS__) COMMA_SUCCESS)
4670 static BC_STATUS zbc_parse_stmt_or_funcdef(void)
4672 BcParse *p = &G.prs;
4675 dbg_lex_enter("%s:%d entered", __func__, __LINE__);
4676 if (p->lex == XC_LEX_EOF)
4677 s = bc_error("end of file");
4678 else if (p->lex == BC_LEX_KEY_DEFINE) {
4679 dbg_lex("%s:%d p->lex:BC_LEX_KEY_DEFINE", __func__, __LINE__);
4680 s = zbc_parse_funcdef();
4682 dbg_lex("%s:%d p->lex:%d (not BC_LEX_KEY_DEFINE)", __func__, __LINE__, p->lex);
4683 s = zbc_parse_stmt();
4686 dbg_lex_done("%s:%d done", __func__, __LINE__);
4689 #define zbc_parse_stmt_or_funcdef(...) (zbc_parse_stmt_or_funcdef(__VA_ARGS__) COMMA_SUCCESS)
4691 // This is not a "z" function: can also return BC_STATUS_PARSE_EMPTY_EXP
4692 static BcStatus bc_parse_expr_empty_ok(uint8_t flags)
4694 BcParse *p = &G.prs;
4695 BcInst prev = XC_INST_PRINT;
4696 size_t nexprs = 0, ops_bgn = p->ops.len;
4697 unsigned nparens, nrelops;
4698 bool paren_first, paren_expr, rprn, assign, bin_last;
4700 dbg_lex_enter("%s:%d entered", __func__, __LINE__);
4701 paren_first = (p->lex == BC_LEX_LPAREN);
4702 nparens = nrelops = 0;
4703 paren_expr = rprn = assign = false;
4709 BcLexType t = p->lex;
4711 if (!lex_allowed_in_bc_expr(t))
4714 dbg_lex("%s:%d t:%d", __func__, __LINE__, t);
4716 s = BC_STATUS_SUCCESS;
4720 s = zbc_parse_incdec(&prev, &paren_expr, &nexprs, flags);
4721 rprn = bin_last = false;
4722 //get_token = false; - already is
4724 case XC_LEX_OP_MINUS:
4725 s = zbc_parse_minus(&prev, ops_bgn, rprn, &nexprs);
4727 //get_token = false; - already is
4728 bin_last = (prev == XC_INST_MINUS);
4730 case BC_LEX_OP_ASSIGN_POWER:
4731 case BC_LEX_OP_ASSIGN_MULTIPLY:
4732 case BC_LEX_OP_ASSIGN_DIVIDE:
4733 case BC_LEX_OP_ASSIGN_MODULUS:
4734 case BC_LEX_OP_ASSIGN_PLUS:
4735 case BC_LEX_OP_ASSIGN_MINUS:
4736 case BC_LEX_OP_ASSIGN:
4737 if (prev != XC_INST_VAR && prev != XC_INST_ARRAY_ELEM
4738 && prev != XC_INST_SCALE && prev != XC_INST_IBASE
4739 && prev != XC_INST_OBASE && prev != BC_INST_LAST
4741 return bc_error("bad assignment:"
4742 " left side must be variable"
4744 ); // note: shared string
4747 case XC_LEX_OP_POWER:
4748 case XC_LEX_OP_MULTIPLY:
4749 case XC_LEX_OP_DIVIDE:
4750 case XC_LEX_OP_MODULUS:
4751 case XC_LEX_OP_PLUS:
4752 case XC_LEX_OP_REL_EQ:
4753 case XC_LEX_OP_REL_LE:
4754 case XC_LEX_OP_REL_GE:
4755 case XC_LEX_OP_REL_NE:
4756 case XC_LEX_OP_REL_LT:
4757 case XC_LEX_OP_REL_GT:
4758 case BC_LEX_OP_BOOL_NOT:
4759 case BC_LEX_OP_BOOL_OR:
4760 case BC_LEX_OP_BOOL_AND:
4761 if (((t == BC_LEX_OP_BOOL_NOT) != bin_last)
4762 || (t != BC_LEX_OP_BOOL_NOT && prev == XC_INST_BOOL_NOT)
4764 return bc_error_bad_expression();
4766 nrelops += (t >= XC_LEX_OP_REL_EQ && t <= XC_LEX_OP_REL_GT);
4767 prev = BC_TOKEN_2_INST(t);
4768 bc_parse_operator(t, ops_bgn, &nexprs);
4771 //get_token = false; - already is
4772 bin_last = (t != BC_LEX_OP_BOOL_NOT);
4775 if (BC_PARSE_LEAF(prev, rprn))
4776 return bc_error_bad_expression();
4777 bc_vec_push(&p->ops, &t);
4781 rprn = bin_last = false;
4784 if (bin_last || prev == XC_INST_BOOL_NOT)
4785 return bc_error_bad_expression();
4790 dbg_lex_done("%s:%d done (returning EMPTY_EXP)", __func__, __LINE__);
4791 return BC_STATUS_PARSE_EMPTY_EXP;
4793 s = zbc_parse_rightParen(ops_bgn, &nexprs);
4796 paren_expr = rprn = true;
4800 if (BC_PARSE_LEAF(prev, rprn))
4801 return bc_error_bad_expression();
4802 s = zbc_parse_name(&prev, flags & ~BC_PARSE_NOCALL);
4804 rprn = bin_last = false;
4805 //get_token = false; - already is
4809 if (BC_PARSE_LEAF(prev, rprn))
4810 return bc_error_bad_expression();
4815 rprn = bin_last = false;
4818 case BC_LEX_KEY_IBASE:
4819 case BC_LEX_KEY_LAST:
4820 case BC_LEX_KEY_OBASE:
4821 if (BC_PARSE_LEAF(prev, rprn))
4822 return bc_error_bad_expression();
4823 prev = (char) (t - BC_LEX_KEY_IBASE + XC_INST_IBASE);
4824 bc_parse_push((char) prev);
4827 rprn = bin_last = false;
4830 case BC_LEX_KEY_LENGTH:
4831 case BC_LEX_KEY_SQRT:
4832 if (BC_PARSE_LEAF(prev, rprn))
4833 return bc_error_bad_expression();
4834 s = zbc_parse_builtin(t, flags, &prev);
4837 rprn = bin_last = false;
4840 case BC_LEX_KEY_READ:
4841 if (BC_PARSE_LEAF(prev, rprn))
4842 return bc_error_bad_expression();
4843 s = zbc_parse_read();
4844 prev = XC_INST_READ;
4847 rprn = bin_last = false;
4850 case BC_LEX_KEY_SCALE:
4851 if (BC_PARSE_LEAF(prev, rprn))
4852 return bc_error_bad_expression();
4853 s = zbc_parse_scale(&prev, flags);
4854 prev = XC_INST_SCALE;
4855 //get_token = false; - already is
4857 rprn = bin_last = false;
4861 return bc_error_bad_token();
4864 if (s || G_interrupt) // error, or ^C: stop parsing
4865 return BC_STATUS_FAILURE;
4873 while (p->ops.len > ops_bgn) {
4874 BcLexType top = BC_PARSE_TOP_OP(p);
4875 assign = (top >= BC_LEX_OP_ASSIGN_POWER && top <= BC_LEX_OP_ASSIGN);
4877 if (top == BC_LEX_LPAREN || top == BC_LEX_RPAREN)
4878 return bc_error_bad_expression();
4880 bc_parse_push(BC_TOKEN_2_INST(top));
4882 nexprs -= (top != BC_LEX_OP_BOOL_NOT && top != XC_LEX_NEG);
4883 bc_vec_pop(&p->ops);
4886 if (prev == XC_INST_BOOL_NOT || nexprs != 1)
4887 return bc_error_bad_expression();
4889 if (!(flags & BC_PARSE_REL) && nrelops) {
4891 s = zbc_POSIX_does_not_allow("comparison operators outside if or loops");
4893 } else if ((flags & BC_PARSE_REL) && nrelops > 1) {
4895 s = zbc_POSIX_requires("exactly one comparison operator per condition");
4899 if (flags & BC_PARSE_PRINT) {
4900 if (paren_first || !assign)
4901 bc_parse_push(XC_INST_PRINT);
4902 bc_parse_push(XC_INST_POP);
4905 dbg_lex_done("%s:%d done", __func__, __LINE__);
4906 return BC_STATUS_SUCCESS;
4913 static BC_STATUS zdc_parse_register(void)
4915 BcParse *p = &G.prs;
4919 if (s) RETURN_STATUS(s);
4920 if (p->lex != XC_LEX_NAME) RETURN_STATUS(bc_error_bad_token());
4922 bc_parse_pushName(p->lex_strnumbuf.v);
4926 #define zdc_parse_register(...) (zdc_parse_register(__VA_ARGS__) COMMA_SUCCESS)
4928 static void dc_parse_string(void)
4930 BcParse *p = &G.prs;
4932 size_t len = G.prog.strs.len;
4934 dbg_lex_enter("%s:%d entered", __func__, __LINE__);
4936 str = xstrdup(p->lex_strnumbuf.v);
4937 bc_parse_push(XC_INST_STR);
4938 bc_parse_pushIndex(len);
4939 bc_vec_push(&G.prog.strs, &str);
4941 // Explanation needed here
4942 bc_program_add_fn();
4943 p->func = bc_program_func(p->fidx);
4945 dbg_lex_done("%s:%d done", __func__, __LINE__);
4948 static BC_STATUS zdc_parse_mem(uint8_t inst, bool name, bool store)
4952 bc_parse_push(inst);
4954 s = zdc_parse_register();
4955 if (s) RETURN_STATUS(s);
4959 bc_parse_push(DC_INST_SWAP);
4960 bc_parse_push(XC_INST_ASSIGN);
4961 bc_parse_push(XC_INST_POP);
4964 RETURN_STATUS(BC_STATUS_SUCCESS);
4966 #define zdc_parse_mem(...) (zdc_parse_mem(__VA_ARGS__) COMMA_SUCCESS)
4968 static BC_STATUS zdc_parse_cond(uint8_t inst)
4970 BcParse *p = &G.prs;
4973 bc_parse_push(inst);
4974 bc_parse_push(DC_INST_EXEC_COND);
4976 s = zdc_parse_register();
4977 if (s) RETURN_STATUS(s);
4980 if (s) RETURN_STATUS(s);
4982 // Note that 'else' part can not be on the next line:
4983 // echo -e '[1p]sa [2p]sb 2 1>a eb' | dc - OK, prints "2"
4984 // echo -e '[1p]sa [2p]sb 2 1>a\neb' | dc - parse error
4985 if (p->lex == DC_LEX_ELSE) {
4986 s = zdc_parse_register();
4987 if (s) RETURN_STATUS(s);
4990 bc_parse_push(BC_PARSE_STREND);
4995 #define zdc_parse_cond(...) (zdc_parse_cond(__VA_ARGS__) COMMA_SUCCESS)
4997 static BC_STATUS zdc_parse_token(BcLexType t)
5001 bool assign, get_token;
5003 dbg_lex_enter("%s:%d entered", __func__, __LINE__);
5004 s = BC_STATUS_SUCCESS;
5007 case XC_LEX_OP_REL_EQ:
5008 case XC_LEX_OP_REL_LE:
5009 case XC_LEX_OP_REL_GE:
5010 case XC_LEX_OP_REL_NE:
5011 case XC_LEX_OP_REL_LT:
5012 case XC_LEX_OP_REL_GT:
5013 dbg_lex("%s:%d LEX_OP_REL_xyz", __func__, __LINE__);
5014 s = zdc_parse_cond(t - XC_LEX_OP_REL_EQ + XC_INST_REL_EQ);
5019 dbg_lex("%s:%d LEX_[S]COLON", __func__, __LINE__);
5020 s = zdc_parse_mem(XC_INST_ARRAY_ELEM, true, t == DC_LEX_COLON);
5023 dbg_lex("%s:%d LEX_STR", __func__, __LINE__);
5027 dbg_lex("%s:%d LEX_NEG", __func__, __LINE__);
5029 if (s) RETURN_STATUS(s);
5030 if (G.prs.lex != XC_LEX_NUMBER)
5031 RETURN_STATUS(bc_error_bad_token());
5033 bc_parse_push(XC_INST_NEG);
5036 dbg_lex("%s:%d LEX_NUMBER", __func__, __LINE__);
5040 dbg_lex("%s:%d LEX_KEY_READ", __func__, __LINE__);
5041 bc_parse_push(XC_INST_READ);
5043 case DC_LEX_OP_ASSIGN:
5044 case DC_LEX_STORE_PUSH:
5045 dbg_lex("%s:%d LEX_OP_ASSIGN/STORE_PUSH", __func__, __LINE__);
5046 assign = (t == DC_LEX_OP_ASSIGN);
5047 inst = assign ? XC_INST_VAR : DC_INST_PUSH_TO_VAR;
5048 s = zdc_parse_mem(inst, true, assign);
5051 case DC_LEX_LOAD_POP:
5052 dbg_lex("%s:%d LEX_OP_LOAD[_POP]", __func__, __LINE__);
5053 inst = t == DC_LEX_LOAD_POP ? DC_INST_PUSH_VAR : DC_INST_LOAD;
5054 s = zdc_parse_mem(inst, true, false);
5056 case DC_LEX_STORE_IBASE:
5057 case DC_LEX_STORE_SCALE:
5058 case DC_LEX_STORE_OBASE:
5059 dbg_lex("%s:%d LEX_OP_STORE_I/OBASE/SCALE", __func__, __LINE__);
5060 inst = t - DC_LEX_STORE_IBASE + XC_INST_IBASE;
5061 s = zdc_parse_mem(inst, false, true);
5064 dbg_lex_done("%s:%d done (bad token)", __func__, __LINE__);
5065 RETURN_STATUS(bc_error_bad_token());
5068 if (!s && get_token) s = zbc_lex_next();
5070 dbg_lex_done("%s:%d done", __func__, __LINE__);
5073 #define zdc_parse_token(...) (zdc_parse_token(__VA_ARGS__) COMMA_SUCCESS)
5075 static BC_STATUS zdc_parse_expr(void)
5077 BcParse *p = &G.prs;
5080 i = (int)p->lex - (int)XC_LEX_OP_POWER;
5082 BcInst inst = dc_LEX_to_INST[i];
5083 if (inst != DC_INST_INVALID) {
5084 bc_parse_push(inst);
5085 RETURN_STATUS(zbc_lex_next());
5088 RETURN_STATUS(zdc_parse_token(p->lex));
5090 #define zdc_parse_expr(...) (zdc_parse_expr(__VA_ARGS__) COMMA_SUCCESS)
5092 static BC_STATUS zdc_parse_exprs_until_eof(void)
5094 BcParse *p = &G.prs;
5095 dbg_lex_enter("%s:%d entered, p->lex:%d", __func__, __LINE__, p->lex);
5096 while (p->lex != XC_LEX_EOF) {
5097 BcStatus s = zdc_parse_expr();
5098 if (s) RETURN_STATUS(s);
5101 dbg_lex_done("%s:%d done", __func__, __LINE__);
5102 RETURN_STATUS(BC_STATUS_SUCCESS);
5104 #define zdc_parse_exprs_until_eof(...) (zdc_parse_exprs_until_eof(__VA_ARGS__) COMMA_SUCCESS)
5112 #define STACK_HAS_MORE_THAN(s, n) ((s)->len > ((size_t)(n)))
5113 #define STACK_HAS_EQUAL_OR_MORE_THAN(s, n) ((s)->len >= ((size_t)(n)))
5115 static BcVec* bc_program_search(char *id, bool var)
5122 v = var ? &G.prog.vars : &G.prog.arrs;
5123 map = var ? &G.prog.var_map : &G.prog.arr_map;
5127 new = bc_map_insert(map, &e, &i); // 1 if insertion was successful
5131 bc_array_init(&v2, var);
5132 bc_vec_push(v, &v2);
5135 ptr = bc_vec_item(map, i);
5136 if (new) ptr->name = xstrdup(e.name);
5137 return bc_vec_item(v, ptr->idx);
5140 // 'num' need not be initialized on entry
5141 static BC_STATUS zbc_program_num(BcResult *r, BcNum **num, bool hex)
5145 case XC_RESULT_TEMP:
5146 case XC_RESULT_IBASE:
5147 case XC_RESULT_SCALE:
5148 case XC_RESULT_OBASE:
5151 case XC_RESULT_CONSTANT: {
5157 str = *bc_program_const(r->d.id.idx);
5160 bc_num_init(&r->d.n, len);
5162 hex = hex && len == 1;
5163 base_t = hex ? 16 : G.prog.ib_t;
5164 s = zbc_num_parse(&r->d.n, str, base_t);
5166 bc_num_free(&r->d.n);
5170 r->t = XC_RESULT_TEMP;
5174 case XC_RESULT_ARRAY:
5175 case XC_RESULT_ARRAY_ELEM: {
5178 v = bc_program_search(r->d.id.name, r->t == XC_RESULT_VAR);
5180 if (r->t == XC_RESULT_ARRAY_ELEM) {
5182 if (v->len <= r->d.id.idx) bc_array_expand(v, r->d.id.idx + 1);
5183 *num = bc_vec_item(v, r->d.id.idx);
5185 *num = bc_vec_top(v);
5189 case BC_RESULT_LAST:
5190 *num = &G.prog.last;
5198 // Testing the theory that dc does not reach LAST/ONE
5199 bb_error_msg_and_die("BUG:%d", r->t);
5203 RETURN_STATUS(BC_STATUS_SUCCESS);
5205 #define zbc_program_num(...) (zbc_program_num(__VA_ARGS__) COMMA_SUCCESS)
5207 static BC_STATUS zbc_program_binOpPrep(BcResult **l, BcNum **ln,
5208 BcResult **r, BcNum **rn, bool assign)
5212 BcResultType lt, rt;
5214 if (!STACK_HAS_MORE_THAN(&G.prog.results, 1))
5215 RETURN_STATUS(bc_error_stack_has_too_few_elements());
5217 *r = bc_vec_item_rev(&G.prog.results, 0);
5218 *l = bc_vec_item_rev(&G.prog.results, 1);
5222 hex = assign && (lt == XC_RESULT_IBASE || lt == XC_RESULT_OBASE);
5224 s = zbc_program_num(*l, ln, false);
5225 if (s) RETURN_STATUS(s);
5226 s = zbc_program_num(*r, rn, hex);
5227 if (s) RETURN_STATUS(s);
5229 // We run this again under these conditions in case any vector has been
5230 // reallocated out from under the BcNums or arrays we had.
5231 if (lt == rt && (lt == XC_RESULT_VAR || lt == XC_RESULT_ARRAY_ELEM)) {
5232 s = zbc_program_num(*l, ln, false);
5233 if (s) RETURN_STATUS(s);
5236 if (!BC_PROG_NUM((*l), (*ln)) && (!assign || (*l)->t != XC_RESULT_VAR))
5237 RETURN_STATUS(bc_error_variable_is_wrong_type());
5238 if (!assign && !BC_PROG_NUM((*r), (*ln)))
5239 RETURN_STATUS(bc_error_variable_is_wrong_type());
5243 #define zbc_program_binOpPrep(...) (zbc_program_binOpPrep(__VA_ARGS__) COMMA_SUCCESS)
5245 static void bc_program_binOpRetire(BcResult *r)
5247 r->t = XC_RESULT_TEMP;
5248 bc_vec_pop(&G.prog.results);
5249 bc_result_pop_and_push(r);
5252 // Note: *r and *n need not be initialized by caller
5253 static BC_STATUS zbc_program_prep(BcResult **r, BcNum **n)
5257 if (!STACK_HAS_MORE_THAN(&G.prog.results, 0))
5258 RETURN_STATUS(bc_error_stack_has_too_few_elements());
5259 *r = bc_vec_top(&G.prog.results);
5261 s = zbc_program_num(*r, n, false);
5262 if (s) RETURN_STATUS(s);
5264 if (!BC_PROG_NUM((*r), (*n)))
5265 RETURN_STATUS(bc_error_variable_is_wrong_type());
5269 #define zbc_program_prep(...) (zbc_program_prep(__VA_ARGS__) COMMA_SUCCESS)
5271 static void bc_program_retire(BcResult *r, BcResultType t)
5274 bc_result_pop_and_push(r);
5277 static BC_STATUS zbc_program_op(char inst)
5280 BcResult *opd1, *opd2, res;
5283 s = zbc_program_binOpPrep(&opd1, &n1, &opd2, &n2, false);
5284 if (s) RETURN_STATUS(s);
5285 bc_num_init_DEF_SIZE(&res.d.n);
5287 s = BC_STATUS_SUCCESS;
5288 IF_ERROR_RETURN_POSSIBLE(s =) zbc_program_ops[inst - XC_INST_POWER](n1, n2, &res.d.n, G.prog.scale);
5290 bc_program_binOpRetire(&res);
5294 bc_num_free(&res.d.n);
5297 #define zbc_program_op(...) (zbc_program_op(__VA_ARGS__) COMMA_SUCCESS)
5299 static BC_STATUS zbc_program_read(void)
5307 bc_char_vec_init(&buf);
5308 bc_read_line(&buf, stdin);
5310 f = bc_program_func(BC_PROG_READ);
5311 bc_vec_pop_all(&f->code);
5313 sv_parse = G.prs; // struct copy
5314 bc_parse_create(BC_PROG_READ);
5315 //bc_lex_file(&G.prs.l); - not needed, error line info is not printed for read()
5317 s = zbc_parse_text_init(buf.v);
5318 if (s) goto exec_err;
5320 IF_BC(s = zbc_parse_expr(0));
5322 IF_DC(s = zdc_parse_exprs_until_eof());
5324 if (s) goto exec_err;
5326 if (G.prs.lex != XC_LEX_NLINE && G.prs.lex != XC_LEX_EOF) {
5327 s = bc_error("bad read() expression");
5331 ip.func = BC_PROG_READ;
5333 IF_BC(ip.results_len_before_call = G.prog.results.len;)
5335 bc_parse_push(XC_INST_RET);
5336 bc_vec_push(&G.prog.exestack, &ip);
5340 G.prs = sv_parse; // struct copy
5344 #define zbc_program_read(...) (zbc_program_read(__VA_ARGS__) COMMA_SUCCESS)
5346 static size_t bc_program_index(char *code, size_t *bgn)
5348 unsigned char *bytes = (void*)(code + *bgn);
5358 for (i = 0; i < amt; i += 8)
5359 res |= (size_t)(*bytes++) << i;
5364 static char *bc_program_name(char *code, size_t *bgn)
5370 s = xmalloc(strchr(code, BC_PARSE_STREND) - code + 1);
5374 if (c == BC_PARSE_STREND)
5384 static void bc_program_printString(const char *str)
5388 // Example: echo '[]ap' | dc
5389 // should print two bytes: 0x00, 0x0A
5396 if (c != '\\' || !*str)
5416 G.prog.nchars = SIZE_MAX;
5428 // Just print the backslash and following character.
5439 static void bc_num_printNewline(void)
5441 if (G.prog.nchars == G.prog.len - 1) {
5449 static FAST_FUNC void dc_num_printChar(size_t num, size_t width, bool radix)
5452 bb_putchar((char) num);
5453 G.prog.nchars += width;
5457 static FAST_FUNC void bc_num_printDigits(size_t num, size_t width, bool radix)
5461 bc_num_printNewline();
5462 bb_putchar(radix ? '.' : ' ');
5465 bc_num_printNewline();
5466 for (exp = 0, pow = 1; exp < width - 1; ++exp, pow *= 10)
5469 for (exp = 0; exp < width; pow /= 10, ++G.prog.nchars, ++exp) {
5471 bc_num_printNewline();
5474 bb_putchar(((char) dig) + '0');
5478 static FAST_FUNC void bc_num_printHex(size_t num, size_t width, bool radix)
5481 bc_num_printNewline();
5486 bc_num_printNewline();
5487 bb_putchar(bb_hexdigits_upcase[num]);
5488 G.prog.nchars += width;
5491 static void bc_num_printDecimal(BcNum *n)
5493 size_t i, rdx = n->rdx - 1;
5500 for (i = n->len - 1; i < n->len; --i)
5501 bc_num_printHex((size_t) n->num[i], 1, i == rdx);
5504 typedef void (*BcNumDigitOp)(size_t, size_t, bool) FAST_FUNC;
5506 static BC_STATUS zbc_num_printNum(BcNum *n, unsigned base_t, size_t width, BcNumDigitOp print)
5511 BcDig base_digs[ULONG_NUM_BUFSIZE];
5512 BcNum intp, fracp, digit, frac_len;
5513 unsigned long dig, *ptr;
5518 print(0, width, false);
5519 RETURN_STATUS(BC_STATUS_SUCCESS);
5522 bc_vec_init(&stack, sizeof(long), NULL);
5523 bc_num_init(&intp, n->len);
5524 bc_num_init(&fracp, n->rdx);
5525 bc_num_init(&digit, width);
5526 bc_num_init(&frac_len, BC_NUM_INT(n));
5527 bc_num_copy(&intp, n);
5528 bc_num_one(&frac_len);
5529 base.cap = ARRAY_SIZE(base_digs);
5530 base.num = base_digs;
5531 bc_num_ulong2num(&base, base_t);
5533 bc_num_truncate(&intp, intp.rdx);
5534 s = zbc_num_sub(n, &intp, &fracp, 0);
5537 while (intp.len != 0) {
5538 s = zbc_num_divmod(&intp, &base, &intp, &digit, 0);
5540 s = zbc_num_ulong(&digit, &dig);
5542 bc_vec_push(&stack, &dig);
5545 for (i = 0; i < stack.len; ++i) {
5546 ptr = bc_vec_item_rev(&stack, i);
5547 print(*ptr, width, false);
5550 if (!n->rdx) goto err;
5552 for (radix = true; frac_len.len <= n->rdx; radix = false) {
5553 s = zbc_num_mul(&fracp, &base, &fracp, n->rdx);
5555 s = zbc_num_ulong(&fracp, &dig);
5557 bc_num_ulong2num(&intp, dig);
5558 s = zbc_num_sub(&fracp, &intp, &fracp, 0);
5560 print(dig, width, radix);
5561 s = zbc_num_mul(&frac_len, &base, &frac_len, 0);
5565 bc_num_free(&frac_len);
5566 bc_num_free(&digit);
5567 bc_num_free(&fracp);
5569 bc_vec_free(&stack);
5572 #define zbc_num_printNum(...) (zbc_num_printNum(__VA_ARGS__) COMMA_SUCCESS)
5574 static BC_STATUS zbc_num_printBase(BcNum *n)
5588 if (G.prog.ob_t <= BC_NUM_MAX_IBASE) {
5590 print = bc_num_printHex;
5592 unsigned i = G.prog.ob_t - 1;
5600 print = bc_num_printDigits;
5603 s = zbc_num_printNum(n, G.prog.ob_t, width, print);
5608 #define zbc_num_printBase(...) (zbc_num_printBase(__VA_ARGS__) COMMA_SUCCESS)
5610 static BC_STATUS zbc_num_print(BcNum *n, bool newline)
5612 BcStatus s = BC_STATUS_SUCCESS;
5614 bc_num_printNewline();
5619 } else if (G.prog.ob_t == 10)
5620 bc_num_printDecimal(n);
5622 s = zbc_num_printBase(n);
5631 #define zbc_num_print(...) (zbc_num_print(__VA_ARGS__) COMMA_SUCCESS)
5633 static BC_STATUS zbc_program_print(char inst, size_t idx)
5638 bool pop = (inst != XC_INST_PRINT);
5640 if (!STACK_HAS_MORE_THAN(&G.prog.results, idx))
5641 RETURN_STATUS(bc_error_stack_has_too_few_elements());
5643 r = bc_vec_item_rev(&G.prog.results, idx);
5644 s = zbc_program_num(r, &num, false);
5645 if (s) RETURN_STATUS(s);
5647 if (BC_PROG_NUM(r, num)) {
5648 s = zbc_num_print(num, !pop);
5650 if (!s && IS_BC) bc_num_copy(&G.prog.last, num);
5655 idx = (r->t == XC_RESULT_STR) ? r->d.id.idx : num->rdx;
5656 str = *bc_program_str(idx);
5658 if (inst == XC_INST_PRINT_STR) {
5661 if (c == '\0') break;
5664 if (c == '\n') G.prog.nchars = 0;
5667 bc_program_printString(str);
5668 if (inst == XC_INST_PRINT) bb_putchar('\n');
5672 if (!s && pop) bc_vec_pop(&G.prog.results);
5676 #define zbc_program_print(...) (zbc_program_print(__VA_ARGS__) COMMA_SUCCESS)
5678 static BC_STATUS zbc_program_negate(void)
5684 s = zbc_program_prep(&ptr, &num);
5685 if (s) RETURN_STATUS(s);
5687 bc_num_init(&res.d.n, num->len);
5688 bc_num_copy(&res.d.n, num);
5689 if (res.d.n.len) res.d.n.neg = !res.d.n.neg;
5691 bc_program_retire(&res, XC_RESULT_TEMP);
5695 #define zbc_program_negate(...) (zbc_program_negate(__VA_ARGS__) COMMA_SUCCESS)
5697 static BC_STATUS zbc_program_logical(char inst)
5700 BcResult *opd1, *opd2, res;
5704 s = zbc_program_binOpPrep(&opd1, &n1, &opd2, &n2, false);
5705 if (s) RETURN_STATUS(s);
5707 bc_num_init_DEF_SIZE(&res.d.n);
5709 if (inst == XC_INST_BOOL_AND)
5710 cond = bc_num_cmp(n1, &G.prog.zero) && bc_num_cmp(n2, &G.prog.zero);
5711 else if (inst == XC_INST_BOOL_OR)
5712 cond = bc_num_cmp(n1, &G.prog.zero) || bc_num_cmp(n2, &G.prog.zero);
5714 cond = bc_num_cmp(n1, n2);
5716 case XC_INST_REL_EQ:
5719 case XC_INST_REL_LE:
5722 case XC_INST_REL_GE:
5725 case XC_INST_REL_LT:
5728 case XC_INST_REL_GT:
5731 default: // = case XC_INST_REL_NE:
5732 //cond = (cond != 0); - not needed
5737 if (cond) bc_num_one(&res.d.n);
5738 //else bc_num_zero(&res.d.n); - already is
5740 bc_program_binOpRetire(&res);
5744 #define zbc_program_logical(...) (zbc_program_logical(__VA_ARGS__) COMMA_SUCCESS)
5747 static BC_STATUS zdc_program_assignStr(BcResult *r, BcVec *v, bool push)
5752 memset(&n2, 0, sizeof(BcNum));
5753 n2.rdx = res.d.id.idx = r->d.id.idx;
5754 res.t = XC_RESULT_STR;
5757 if (!STACK_HAS_MORE_THAN(&G.prog.results, 1))
5758 RETURN_STATUS(bc_error_stack_has_too_few_elements());
5760 bc_vec_pop(&G.prog.results);
5763 bc_result_pop_and_push(&res);
5764 bc_vec_push(v, &n2);
5766 RETURN_STATUS(BC_STATUS_SUCCESS);
5768 #define zdc_program_assignStr(...) (zdc_program_assignStr(__VA_ARGS__) COMMA_SUCCESS)
5771 static BC_STATUS zbc_program_copyToVar(char *name, bool var)
5778 if (!STACK_HAS_MORE_THAN(&G.prog.results, 0))
5779 RETURN_STATUS(bc_error_stack_has_too_few_elements());
5781 ptr = bc_vec_top(&G.prog.results);
5782 if ((ptr->t == XC_RESULT_ARRAY) != !var)
5783 RETURN_STATUS(bc_error_variable_is_wrong_type());
5784 v = bc_program_search(name, var);
5787 if (ptr->t == XC_RESULT_STR && !var)
5788 RETURN_STATUS(bc_error_variable_is_wrong_type());
5789 if (ptr->t == XC_RESULT_STR)
5790 RETURN_STATUS(zdc_program_assignStr(ptr, v, true));
5793 s = zbc_program_num(ptr, &n, false);
5794 if (s) RETURN_STATUS(s);
5796 // Do this once more to make sure that pointers were not invalidated.
5797 v = bc_program_search(name, var);
5800 bc_num_init_DEF_SIZE(&r.d.n);
5801 bc_num_copy(&r.d.n, n);
5803 bc_array_init(&r.d.v, true);
5804 bc_array_copy(&r.d.v, (BcVec *) n);
5807 bc_vec_push(v, &r.d);
5808 bc_vec_pop(&G.prog.results);
5812 #define zbc_program_copyToVar(...) (zbc_program_copyToVar(__VA_ARGS__) COMMA_SUCCESS)
5814 static BC_STATUS zbc_program_assign(char inst)
5817 BcResult *left, *right, res;
5819 bool assign = (inst == XC_INST_ASSIGN);
5822 s = zbc_program_binOpPrep(&left, &l, &right, &r, assign);
5823 if (s) RETURN_STATUS(s);
5825 ib = left->t == XC_RESULT_IBASE;
5826 sc = left->t == XC_RESULT_SCALE;
5829 if (right->t == XC_RESULT_STR) {
5832 if (left->t != XC_RESULT_VAR)
5833 RETURN_STATUS(bc_error_variable_is_wrong_type());
5834 v = bc_program_search(left->d.id.name, true);
5836 RETURN_STATUS(zdc_program_assignStr(right, v, false));
5840 if (left->t == XC_RESULT_CONSTANT || left->t == XC_RESULT_TEMP)
5841 RETURN_STATUS(bc_error("bad assignment:"
5842 " left side must be variable"
5844 )); // note: shared string
5847 if (inst == BC_INST_ASSIGN_DIVIDE && !bc_num_cmp(r, &G.prog.zero))
5848 RETURN_STATUS(bc_error("divide by zero"));
5853 s = BC_STATUS_SUCCESS;
5854 IF_ERROR_RETURN_POSSIBLE(s =) zbc_program_ops[inst - BC_INST_ASSIGN_POWER](l, r, l, G.prog.scale);
5856 if (s) RETURN_STATUS(s);
5861 if (ib || sc || left->t == XC_RESULT_OBASE) {
5862 static const char *const msg[] = {
5863 "bad ibase; must be [2,16]", //XC_RESULT_IBASE
5864 "bad obase; must be [2,"BC_MAX_OBASE_STR"]", //XC_RESULT_OBASE
5865 "bad scale; must be [0,"BC_MAX_SCALE_STR"]", //XC_RESULT_SCALE
5871 s = zbc_num_ulong(l, &val);
5872 if (s) RETURN_STATUS(s);
5873 s = left->t - XC_RESULT_IBASE;
5876 ptr = &G.prog.scale;
5879 RETURN_STATUS(bc_error(msg[s]));
5880 max = ib ? BC_NUM_MAX_IBASE : BC_MAX_OBASE;
5881 ptr = ib ? &G.prog.ib_t : &G.prog.ob_t;
5885 RETURN_STATUS(bc_error(msg[s]));
5887 *ptr = (size_t) val;
5888 s = BC_STATUS_SUCCESS;
5891 bc_num_init(&res.d.n, l->len);
5892 bc_num_copy(&res.d.n, l);
5893 bc_program_binOpRetire(&res);
5897 #define zbc_program_assign(...) (zbc_program_assign(__VA_ARGS__) COMMA_SUCCESS)
5900 #define bc_program_pushVar(code, bgn, pop, copy) \
5901 bc_program_pushVar(code, bgn)
5902 // for bc, 'pop' and 'copy' are always false
5904 static BC_STATUS bc_program_pushVar(char *code, size_t *bgn,
5905 bool pop, bool copy)
5908 char *name = bc_program_name(code, bgn);
5910 r.t = XC_RESULT_VAR;
5915 BcVec *v = bc_program_search(name, true);
5916 BcNum *num = bc_vec_top(v);
5919 if (!STACK_HAS_MORE_THAN(v, 1 - copy)) {
5920 RETURN_STATUS(bc_error_stack_has_too_few_elements());
5923 if (!BC_PROG_STR(num)) {
5924 r.t = XC_RESULT_TEMP;
5925 bc_num_init_DEF_SIZE(&r.d.n);
5926 bc_num_copy(&r.d.n, num);
5928 r.t = XC_RESULT_STR;
5929 r.d.id.idx = num->rdx;
5932 if (!copy) bc_vec_pop(v);
5936 bc_vec_push(&G.prog.results, &r);
5938 RETURN_STATUS(BC_STATUS_SUCCESS);
5940 #define zbc_program_pushVar(...) (bc_program_pushVar(__VA_ARGS__) COMMA_SUCCESS)
5942 static BC_STATUS zbc_program_pushArray(char *code, size_t *bgn, char inst)
5944 BcStatus s = BC_STATUS_SUCCESS;
5948 r.d.id.name = bc_program_name(code, bgn);
5950 if (inst == XC_INST_ARRAY) {
5951 r.t = XC_RESULT_ARRAY;
5952 bc_vec_push(&G.prog.results, &r);
5957 s = zbc_program_prep(&operand, &num);
5959 s = zbc_num_ulong(num, &temp);
5962 if (temp > BC_MAX_DIM) {
5963 s = bc_error("array too long; must be [1,"BC_MAX_DIM_STR"]");
5967 r.d.id.idx = (size_t) temp;
5968 bc_program_retire(&r, XC_RESULT_ARRAY_ELEM);
5971 if (s) free(r.d.id.name);
5974 #define zbc_program_pushArray(...) (zbc_program_pushArray(__VA_ARGS__) COMMA_SUCCESS)
5977 static BC_STATUS zbc_program_incdec(char inst)
5980 BcResult *ptr, res, copy;
5984 s = zbc_program_prep(&ptr, &num);
5985 if (s) RETURN_STATUS(s);
5987 if (inst == BC_INST_INC_POST || inst == BC_INST_DEC_POST) {
5988 copy.t = XC_RESULT_TEMP;
5989 bc_num_init(©.d.n, num->len);
5990 bc_num_copy(©.d.n, num);
5993 res.t = BC_RESULT_ONE;
5994 inst = (inst == BC_INST_INC_PRE || inst == BC_INST_INC_POST)
5995 ? BC_INST_ASSIGN_PLUS
5996 : BC_INST_ASSIGN_MINUS;
5998 bc_vec_push(&G.prog.results, &res);
5999 s = zbc_program_assign(inst);
6000 if (s) RETURN_STATUS(s);
6002 if (inst2 == BC_INST_INC_POST || inst2 == BC_INST_DEC_POST) {
6003 bc_result_pop_and_push(©);
6008 #define zbc_program_incdec(...) (zbc_program_incdec(__VA_ARGS__) COMMA_SUCCESS)
6010 static BC_STATUS zbc_program_call(char *code, size_t *idx)
6018 nparams = bc_program_index(code, idx);
6020 ip.func = bc_program_index(code, idx);
6021 func = bc_program_func(ip.func);
6023 if (func->code.len == 0) {
6024 RETURN_STATUS(bc_error("undefined function"));
6026 if (nparams != func->nparams) {
6027 RETURN_STATUS(bc_error_fmt("function has %u parameters, but called with %u", func->nparams, nparams));
6029 ip.results_len_before_call = G.prog.results.len - nparams;
6031 for (i = 0; i < nparams; ++i) {
6034 a = bc_vec_item(&func->autos, nparams - 1 - i);
6035 arg = bc_vec_top(&G.prog.results);
6037 if ((!a->idx) != (arg->t == XC_RESULT_ARRAY) || arg->t == XC_RESULT_STR)
6038 RETURN_STATUS(bc_error_variable_is_wrong_type());
6040 s = zbc_program_copyToVar(a->name, a->idx);
6041 if (s) RETURN_STATUS(s);
6044 a = bc_vec_item(&func->autos, i);
6045 for (; i < func->autos.len; i++, a++) {
6048 v = bc_program_search(a->name, a->idx);
6051 bc_num_init_DEF_SIZE(&n2);
6052 bc_vec_push(v, &n2);
6055 bc_array_init(&v2, true);
6056 bc_vec_push(v, &v2);
6060 bc_vec_push(&G.prog.exestack, &ip);
6062 RETURN_STATUS(BC_STATUS_SUCCESS);
6064 #define zbc_program_call(...) (zbc_program_call(__VA_ARGS__) COMMA_SUCCESS)
6066 static BC_STATUS zbc_program_return(char inst)
6072 BcInstPtr *ip = bc_vec_top(&G.prog.exestack);
6074 if (!STACK_HAS_EQUAL_OR_MORE_THAN(&G.prog.results, ip->results_len_before_call + (inst == XC_INST_RET)))
6075 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6077 f = bc_program_func(ip->func);
6078 res.t = XC_RESULT_TEMP;
6080 if (inst == XC_INST_RET) {
6083 BcResult *operand = bc_vec_top(&G.prog.results);
6085 s = zbc_program_num(operand, &num, false);
6086 if (s) RETURN_STATUS(s);
6087 bc_num_init(&res.d.n, num->len);
6088 bc_num_copy(&res.d.n, num);
6090 bc_num_init_DEF_SIZE(&res.d.n);
6091 //bc_num_zero(&res.d.n); - already is
6094 // We need to pop arguments as well, so this takes that into account.
6095 a = (void*)f->autos.v;
6096 for (i = 0; i < f->autos.len; i++, a++) {
6098 v = bc_program_search(a->name, a->idx);
6102 bc_vec_npop(&G.prog.results, G.prog.results.len - ip->results_len_before_call);
6103 bc_vec_push(&G.prog.results, &res);
6104 bc_vec_pop(&G.prog.exestack);
6106 RETURN_STATUS(BC_STATUS_SUCCESS);
6108 #define zbc_program_return(...) (zbc_program_return(__VA_ARGS__) COMMA_SUCCESS)
6111 static unsigned long bc_program_scale(BcNum *n)
6113 return (unsigned long) n->rdx;
6116 static unsigned long bc_program_len(BcNum *n)
6118 size_t len = n->len;
6120 if (n->rdx != len) return len;
6122 if (len == 0) break;
6124 if (n->num[len] != 0) break;
6129 static BC_STATUS zbc_program_builtin(char inst)
6135 bool len = (inst == XC_INST_LENGTH);
6137 if (!STACK_HAS_MORE_THAN(&G.prog.results, 0))
6138 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6139 opnd = bc_vec_top(&G.prog.results);
6141 s = zbc_program_num(opnd, &num, false);
6142 if (s) RETURN_STATUS(s);
6145 if (!BC_PROG_NUM(opnd, num) && !len)
6146 RETURN_STATUS(bc_error_variable_is_wrong_type());
6149 bc_num_init_DEF_SIZE(&res.d.n);
6151 if (inst == XC_INST_SQRT)
6152 s = zbc_num_sqrt(num, &res.d.n, G.prog.scale);
6154 else if (len != 0 && opnd->t == XC_RESULT_ARRAY) {
6155 bc_num_ulong2num(&res.d.n, (unsigned long) ((BcVec *) num)->len);
6159 else if (len != 0 && !BC_PROG_NUM(opnd, num)) {
6161 size_t idx = opnd->t == XC_RESULT_STR ? opnd->d.id.idx : num->rdx;
6163 str = bc_program_str(idx);
6164 bc_num_ulong2num(&res.d.n, strlen(*str));
6168 bc_num_ulong2num(&res.d.n, len ? bc_program_len(num) : bc_program_scale(num));
6171 bc_program_retire(&res, XC_RESULT_TEMP);
6175 #define zbc_program_builtin(...) (zbc_program_builtin(__VA_ARGS__) COMMA_SUCCESS)
6178 static BC_STATUS zdc_program_divmod(void)
6181 BcResult *opd1, *opd2, res, res2;
6184 s = zbc_program_binOpPrep(&opd1, &n1, &opd2, &n2, false);
6185 if (s) RETURN_STATUS(s);
6187 bc_num_init_DEF_SIZE(&res.d.n);
6188 bc_num_init(&res2.d.n, n2->len);
6190 s = zbc_num_divmod(n1, n2, &res2.d.n, &res.d.n, G.prog.scale);
6193 bc_program_binOpRetire(&res2);
6194 res.t = XC_RESULT_TEMP;
6195 bc_vec_push(&G.prog.results, &res);
6199 bc_num_free(&res2.d.n);
6200 bc_num_free(&res.d.n);
6203 #define zdc_program_divmod(...) (zdc_program_divmod(__VA_ARGS__) COMMA_SUCCESS)
6205 static BC_STATUS zdc_program_modexp(void)
6208 BcResult *r1, *r2, *r3, res;
6209 BcNum *n1, *n2, *n3;
6211 if (!STACK_HAS_MORE_THAN(&G.prog.results, 2))
6212 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6213 s = zbc_program_binOpPrep(&r2, &n2, &r3, &n3, false);
6214 if (s) RETURN_STATUS(s);
6216 r1 = bc_vec_item_rev(&G.prog.results, 2);
6217 s = zbc_program_num(r1, &n1, false);
6218 if (s) RETURN_STATUS(s);
6219 if (!BC_PROG_NUM(r1, n1))
6220 RETURN_STATUS(bc_error_variable_is_wrong_type());
6222 // Make sure that the values have their pointers updated, if necessary.
6223 if (r1->t == XC_RESULT_VAR || r1->t == XC_RESULT_ARRAY_ELEM) {
6224 if (r1->t == r2->t) {
6225 s = zbc_program_num(r2, &n2, false);
6226 if (s) RETURN_STATUS(s);
6228 if (r1->t == r3->t) {
6229 s = zbc_program_num(r3, &n3, false);
6230 if (s) RETURN_STATUS(s);
6234 bc_num_init(&res.d.n, n3->len);
6235 s = zdc_num_modexp(n1, n2, n3, &res.d.n);
6238 bc_vec_pop(&G.prog.results);
6239 bc_program_binOpRetire(&res);
6243 bc_num_free(&res.d.n);
6246 #define zdc_program_modexp(...) (zdc_program_modexp(__VA_ARGS__) COMMA_SUCCESS)
6248 static void dc_program_stackLen(void)
6251 size_t len = G.prog.results.len;
6253 res.t = XC_RESULT_TEMP;
6255 bc_num_init_DEF_SIZE(&res.d.n);
6256 bc_num_ulong2num(&res.d.n, len);
6257 bc_vec_push(&G.prog.results, &res);
6260 static BC_STATUS zdc_program_asciify(void)
6270 if (!STACK_HAS_MORE_THAN(&G.prog.results, 0))
6271 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6272 r = bc_vec_top(&G.prog.results);
6274 s = zbc_program_num(r, &num, false);
6275 if (s) RETURN_STATUS(s);
6277 if (BC_PROG_NUM(r, num)) {
6280 BcDig strmb_digs[ULONG_NUM_BUFSIZE];
6282 bc_num_init_DEF_SIZE(&n);
6283 bc_num_copy(&n, num);
6284 bc_num_truncate(&n, n.rdx);
6286 strmb.cap = ARRAY_SIZE(strmb_digs);
6287 strmb.num = strmb_digs;
6288 bc_num_ulong2num(&strmb, 0x100);
6289 s = zbc_num_mod(&n, &strmb, &n, 0);
6291 if (s) goto num_err;
6292 s = zbc_num_ulong(&n, &val);
6293 if (s) goto num_err;
6300 idx = (r->t == XC_RESULT_STR) ? r->d.id.idx : num->rdx;
6301 sp = *bc_program_str(idx);
6305 strs = (void*)G.prog.strs.v;
6306 for (idx = 0; idx < G.prog.strs.len; idx++) {
6307 if (strs[idx][0] == c && strs[idx][1] == '\0') {
6313 //str[1] = '\0'; - already is
6314 bc_vec_push(&G.prog.strs, &str);
6316 res.t = XC_RESULT_STR;
6318 bc_result_pop_and_push(&res);
6320 RETURN_STATUS(BC_STATUS_SUCCESS);
6325 #define zdc_program_asciify(...) (zdc_program_asciify(__VA_ARGS__) COMMA_SUCCESS)
6327 static BC_STATUS zdc_program_printStream(void)
6334 if (!STACK_HAS_MORE_THAN(&G.prog.results, 0))
6335 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6336 r = bc_vec_top(&G.prog.results);
6338 s = zbc_program_num(r, &n, false);
6339 if (s) RETURN_STATUS(s);
6341 if (BC_PROG_NUM(r, n)) {
6342 s = zbc_num_printNum(n, 0x100, 1, dc_num_printChar);
6345 idx = (r->t == XC_RESULT_STR) ? r->d.id.idx : n->rdx;
6346 str = *bc_program_str(idx);
6352 #define zdc_program_printStream(...) (zdc_program_printStream(__VA_ARGS__) COMMA_SUCCESS)
6354 static BC_STATUS zdc_program_nquit(void)
6361 s = zbc_program_prep(&opnd, &num);
6362 if (s) RETURN_STATUS(s);
6363 s = zbc_num_ulong(num, &val);
6364 if (s) RETURN_STATUS(s);
6366 bc_vec_pop(&G.prog.results);
6368 if (G.prog.exestack.len < val)
6369 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6370 if (G.prog.exestack.len == val) {
6371 QUIT_OR_RETURN_TO_MAIN;
6374 bc_vec_npop(&G.prog.exestack, val);
6378 #define zdc_program_nquit(...) (zdc_program_nquit(__VA_ARGS__) COMMA_SUCCESS)
6380 static BC_STATUS zdc_program_execStr(char *code, size_t *bgn, bool cond)
6382 BcStatus s = BC_STATUS_SUCCESS;
6388 if (!STACK_HAS_MORE_THAN(&G.prog.results, 0))
6389 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6391 r = bc_vec_top(&G.prog.results);
6394 BcNum *n = n; // for compiler
6397 char *then_name = bc_program_name(code, bgn);
6398 char *else_name = NULL;
6400 if (code[*bgn] == BC_PARSE_STREND)
6403 else_name = bc_program_name(code, bgn);
6405 exec = r->d.n.len != 0;
6407 if (!exec && else_name != NULL) {
6414 v = bc_program_search(name, true);
6421 if (!exec) goto exit;
6422 if (!BC_PROG_STR(n)) {
6423 s = bc_error_variable_is_wrong_type();
6429 if (r->t == XC_RESULT_STR) {
6431 } else if (r->t == XC_RESULT_VAR) {
6433 s = zbc_program_num(r, &n, false);
6434 if (s || !BC_PROG_STR(n)) goto exit;
6440 fidx = sidx + BC_PROG_REQ_FUNCS;
6442 f = bc_program_func(fidx);
6444 if (f->code.len == 0) {
6448 sv_parse = G.prs; // struct copy
6449 bc_parse_create(fidx);
6450 str = *bc_program_str(sidx);
6451 s = zbc_parse_text_init(str);
6454 s = zdc_parse_exprs_until_eof();
6456 bc_parse_push(DC_INST_POP_EXEC);
6457 if (G.prs.lex != XC_LEX_EOF)
6458 s = bc_error_bad_expression();
6460 G.prs = sv_parse; // struct copy
6463 bc_vec_pop_all(&f->code);
6471 bc_vec_pop(&G.prog.results);
6472 bc_vec_push(&G.prog.exestack, &ip);
6474 RETURN_STATUS(BC_STATUS_SUCCESS);
6476 bc_vec_pop(&G.prog.results);
6479 #define zdc_program_execStr(...) (zdc_program_execStr(__VA_ARGS__) COMMA_SUCCESS)
6482 static void bc_program_pushGlobal(char inst)
6487 res.t = inst - XC_INST_IBASE + XC_RESULT_IBASE;
6488 if (inst == XC_INST_IBASE)
6489 val = (unsigned long) G.prog.ib_t;
6490 else if (inst == XC_INST_SCALE)
6491 val = (unsigned long) G.prog.scale;
6493 val = (unsigned long) G.prog.ob_t;
6495 bc_num_init_DEF_SIZE(&res.d.n);
6496 bc_num_ulong2num(&res.d.n, val);
6497 bc_vec_push(&G.prog.results, &res);
6500 static BC_STATUS zbc_program_exec(void)
6503 BcInstPtr *ip = bc_vec_top(&G.prog.exestack);
6504 BcFunc *func = bc_program_func(ip->func);
6505 char *code = func->code.v;
6507 dbg_exec("func:%zd bytes:%zd ip:%zd results.len:%d",
6508 ip->func, func->code.len, ip->inst_idx, G.prog.results.len);
6509 while (ip->inst_idx < func->code.len) {
6510 BcStatus s = BC_STATUS_SUCCESS;
6511 char inst = code[ip->inst_idx++];
6513 dbg_exec("inst at %zd:%d results.len:%d", ip->inst_idx - 1, inst, G.prog.results.len);
6516 case BC_INST_JUMP_ZERO: {
6519 dbg_exec("BC_INST_JUMP_ZERO:");
6520 s = zbc_program_prep(&ptr, &num);
6521 if (s) RETURN_STATUS(s);
6522 zero = (bc_num_cmp(num, &G.prog.zero) == 0);
6523 bc_vec_pop(&G.prog.results);
6525 bc_program_index(code, &ip->inst_idx);
6528 // else: fall through
6530 case BC_INST_JUMP: {
6531 size_t idx = bc_program_index(code, &ip->inst_idx);
6532 size_t *addr = bc_vec_item(&func->labels, idx);
6533 dbg_exec("BC_INST_JUMP: to %ld", (long)*addr);
6534 ip->inst_idx = *addr;
6538 dbg_exec("BC_INST_CALL:");
6539 s = zbc_program_call(code, &ip->inst_idx);
6540 goto read_updated_ip;
6541 case BC_INST_INC_PRE:
6542 case BC_INST_DEC_PRE:
6543 case BC_INST_INC_POST:
6544 case BC_INST_DEC_POST:
6545 dbg_exec("BC_INST_INCDEC:");
6546 s = zbc_program_incdec(inst);
6549 dbg_exec("BC_INST_HALT:");
6550 QUIT_OR_RETURN_TO_MAIN;
6554 dbg_exec("BC_INST_RET[0]:");
6555 s = zbc_program_return(inst);
6556 goto read_updated_ip;
6557 case XC_INST_BOOL_OR:
6558 case XC_INST_BOOL_AND:
6560 case XC_INST_REL_EQ:
6561 case XC_INST_REL_LE:
6562 case XC_INST_REL_GE:
6563 case XC_INST_REL_NE:
6564 case XC_INST_REL_LT:
6565 case XC_INST_REL_GT:
6566 dbg_exec("BC_INST_BOOL:");
6567 s = zbc_program_logical(inst);
6570 dbg_exec("XC_INST_READ:");
6571 s = zbc_program_read();
6572 goto read_updated_ip;
6574 dbg_exec("XC_INST_VAR:");
6575 s = zbc_program_pushVar(code, &ip->inst_idx, false, false);
6577 case XC_INST_ARRAY_ELEM:
6579 dbg_exec("XC_INST_ARRAY[_ELEM]:");
6580 s = zbc_program_pushArray(code, &ip->inst_idx, inst);
6584 dbg_exec("BC_INST_LAST:");
6585 r.t = BC_RESULT_LAST;
6586 bc_vec_push(&G.prog.results, &r);
6592 dbg_exec("XC_INST_internalvar(%d):", inst - XC_INST_IBASE);
6593 bc_program_pushGlobal(inst);
6595 case XC_INST_SCALE_FUNC:
6596 case XC_INST_LENGTH:
6598 dbg_exec("BC_INST_builtin:");
6599 s = zbc_program_builtin(inst);
6602 dbg_exec("XC_INST_NUM:");
6603 r.t = XC_RESULT_CONSTANT;
6604 r.d.id.idx = bc_program_index(code, &ip->inst_idx);
6605 bc_vec_push(&G.prog.results, &r);
6608 dbg_exec("XC_INST_POP:");
6609 if (!STACK_HAS_MORE_THAN(&G.prog.results, 0))
6610 s = bc_error_stack_has_too_few_elements();
6612 bc_vec_pop(&G.prog.results);
6615 case XC_INST_PRINT_POP:
6616 case XC_INST_PRINT_STR:
6617 dbg_exec("XC_INST_PRINTxyz:");
6618 s = zbc_program_print(inst, 0);
6621 dbg_exec("XC_INST_STR:");
6622 r.t = XC_RESULT_STR;
6623 r.d.id.idx = bc_program_index(code, &ip->inst_idx);
6624 bc_vec_push(&G.prog.results, &r);
6627 case XC_INST_MULTIPLY:
6628 case XC_INST_DIVIDE:
6629 case XC_INST_MODULUS:
6632 dbg_exec("BC_INST_binaryop:");
6633 s = zbc_program_op(inst);
6635 case XC_INST_BOOL_NOT: {
6637 dbg_exec("XC_INST_BOOL_NOT:");
6638 s = zbc_program_prep(&ptr, &num);
6639 if (s) RETURN_STATUS(s);
6640 bc_num_init_DEF_SIZE(&r.d.n);
6641 if (bc_num_cmp(num, &G.prog.zero) == 0)
6643 //else bc_num_zero(&r.d.n); - already is
6644 bc_program_retire(&r, XC_RESULT_TEMP);
6648 dbg_exec("XC_INST_NEG:");
6649 s = zbc_program_negate();
6652 case BC_INST_ASSIGN_POWER:
6653 case BC_INST_ASSIGN_MULTIPLY:
6654 case BC_INST_ASSIGN_DIVIDE:
6655 case BC_INST_ASSIGN_MODULUS:
6656 case BC_INST_ASSIGN_PLUS:
6657 case BC_INST_ASSIGN_MINUS:
6659 case XC_INST_ASSIGN:
6660 dbg_exec("BC_INST_ASSIGNxyz:");
6661 s = zbc_program_assign(inst);
6664 case DC_INST_POP_EXEC:
6665 dbg_exec("DC_INST_POP_EXEC:");
6666 bc_vec_pop(&G.prog.exestack);
6667 goto read_updated_ip;
6668 case DC_INST_MODEXP:
6669 dbg_exec("DC_INST_MODEXP:");
6670 s = zdc_program_modexp();
6672 case DC_INST_DIVMOD:
6673 dbg_exec("DC_INST_DIVMOD:");
6674 s = zdc_program_divmod();
6676 case DC_INST_EXECUTE:
6677 case DC_INST_EXEC_COND:
6678 dbg_exec("DC_INST_EXEC[_COND]:");
6679 s = zdc_program_execStr(code, &ip->inst_idx, inst == DC_INST_EXEC_COND);
6680 goto read_updated_ip;
6681 case DC_INST_PRINT_STACK: {
6683 dbg_exec("DC_INST_PRINT_STACK:");
6684 for (idx = 0; idx < G.prog.results.len; ++idx) {
6685 s = zbc_program_print(XC_INST_PRINT, idx);
6690 case DC_INST_CLEAR_STACK:
6691 dbg_exec("DC_INST_CLEAR_STACK:");
6692 bc_vec_pop_all(&G.prog.results);
6694 case DC_INST_STACK_LEN:
6695 dbg_exec("DC_INST_STACK_LEN:");
6696 dc_program_stackLen();
6698 case DC_INST_DUPLICATE:
6699 dbg_exec("DC_INST_DUPLICATE:");
6700 if (!STACK_HAS_MORE_THAN(&G.prog.results, 0))
6701 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6702 ptr = bc_vec_top(&G.prog.results);
6703 dc_result_copy(&r, ptr);
6704 bc_vec_push(&G.prog.results, &r);
6706 case DC_INST_SWAP: {
6708 dbg_exec("DC_INST_SWAP:");
6709 if (!STACK_HAS_MORE_THAN(&G.prog.results, 1))
6710 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6711 ptr = bc_vec_item_rev(&G.prog.results, 0);
6712 ptr2 = bc_vec_item_rev(&G.prog.results, 1);
6713 memcpy(&r, ptr, sizeof(BcResult));
6714 memcpy(ptr, ptr2, sizeof(BcResult));
6715 memcpy(ptr2, &r, sizeof(BcResult));
6718 case DC_INST_ASCIIFY:
6719 dbg_exec("DC_INST_ASCIIFY:");
6720 s = zdc_program_asciify();
6722 case DC_INST_PRINT_STREAM:
6723 dbg_exec("DC_INST_PRINT_STREAM:");
6724 s = zdc_program_printStream();
6727 case DC_INST_PUSH_VAR: {
6728 bool copy = inst == DC_INST_LOAD;
6729 s = zbc_program_pushVar(code, &ip->inst_idx, true, copy);
6732 case DC_INST_PUSH_TO_VAR: {
6733 char *name = bc_program_name(code, &ip->inst_idx);
6734 s = zbc_program_copyToVar(name, true);
6739 dbg_exec("DC_INST_QUIT:");
6740 if (G.prog.exestack.len <= 2)
6741 QUIT_OR_RETURN_TO_MAIN;
6742 bc_vec_npop(&G.prog.exestack, 2);
6743 goto read_updated_ip;
6745 dbg_exec("DC_INST_NQUIT:");
6746 s = zdc_program_nquit();
6747 //goto read_updated_ip; - just fall through to it
6750 // Instruction stack has changed, read new pointers
6751 ip = bc_vec_top(&G.prog.exestack);
6752 func = bc_program_func(ip->func);
6753 code = func->code.v;
6754 dbg_exec("func:%zd bytes:%zd ip:%zd", ip->func, func->code.len, ip->inst_idx);
6757 if (s || G_interrupt) {
6765 RETURN_STATUS(BC_STATUS_SUCCESS);
6767 #define zbc_program_exec(...) (zbc_program_exec(__VA_ARGS__) COMMA_SUCCESS)
6769 static unsigned bc_vm_envLen(const char *var)
6775 len = BC_NUM_PRINT_WIDTH;
6776 if (!lenv) return len;
6778 len = bb_strtou(lenv, NULL, 10) - 1;
6779 if (errno || len < 2 || len >= INT_MAX)
6780 len = BC_NUM_PRINT_WIDTH;
6785 static BC_STATUS zbc_vm_process(const char *text)
6789 dbg_lex_enter("%s:%d entered", __func__, __LINE__);
6790 s = zbc_parse_text_init(text); // does the first zbc_lex_next()
6791 if (s) RETURN_STATUS(s);
6794 while (G.prs.lex != XC_LEX_EOF) {
6798 dbg_lex("%s:%d G.prs.lex:%d, parsing...", __func__, __LINE__, G.prs.lex);
6801 if (G.prs.lex == BC_LEX_SCOLON
6802 || G.prs.lex == XC_LEX_NLINE
6809 s = zbc_parse_stmt_or_funcdef();
6812 // Check that next token is a correct stmt delimiter -
6813 // disallows "print 1 print 2" and such.
6814 if (G.prs.lex != BC_LEX_SCOLON
6815 && G.prs.lex != XC_LEX_NLINE
6816 && G.prs.lex != XC_LEX_EOF
6819 //TODO: commonalize for other parse errors:
6820 err_at = G.prs.lex_next_at ? G.prs.lex_next_at : "UNKNOWN";
6821 bc_error_fmt("bad statement terminator at '%.*s'",
6822 (int)(strchrnul(err_at, '\n') - err_at),
6827 // The above logic is fragile. Check these examples:
6828 // - interative read() still works
6832 // Most of dc parsing assumes all whitespace,
6833 // including '\n', is eaten.
6834 while (G.prs.lex == XC_LEX_NLINE) {
6837 if (G.prs.lex == XC_LEX_EOF)
6840 s = zdc_parse_expr();
6843 if (s || G_interrupt) {
6845 bc_parse_reset(); // includes bc_program_reset()
6846 RETURN_STATUS(BC_STATUS_FAILURE);
6849 dbg_lex("%s:%d executing...", __func__, __LINE__);
6850 s = zbc_program_exec();
6856 ip = (void*)G.prog.exestack.v;
6858 if (G.prog.exestack.len != 1) // should have only main's IP
6859 bb_error_msg_and_die("BUG:call stack");
6860 if (ip->func != BC_PROG_MAIN)
6861 bb_error_msg_and_die("BUG:not MAIN");
6863 f = bc_program_func_BC_PROG_MAIN();
6864 // bc discards strings, constants and code after each
6865 // top-level statement in the "main program".
6866 // This prevents "yes 1 | bc" from growing its memory
6867 // without bound. This can be done because data stack
6868 // is empty and thus can't hold any references to
6869 // strings or constants, there is no generated code
6870 // which can hold references (after we discard one
6871 // we just executed). Code of functions can have references,
6872 // but bc stores function strings/constants in per-function
6876 if (G.prog.results.len != 0) // should be empty
6877 bb_error_msg_and_die("BUG:data stack");
6879 IF_BC(bc_vec_pop_all(&f->strs);)
6880 IF_BC(bc_vec_pop_all(&f->consts);)
6882 if (G.prog.results.len == 0
6883 && G.prog.vars.len == 0
6885 // If stack is empty and no registers exist (TODO: or they are all empty),
6886 // we can get rid of accumulated strings and constants.
6887 // In this example dc process should not grow
6888 // its memory consumption with time:
6890 IF_DC(bc_vec_pop_all(&G.prog.strs);)
6891 IF_DC(bc_vec_pop_all(&G.prog.consts);)
6893 // The code is discarded always (below), thus this example
6894 // should also not grow its memory consumption with time,
6895 // even though its data stack is not empty:
6896 // { echo 1; yes dk; } | dc
6898 // We drop generated and executed code for both bc and dc:
6899 bc_vec_pop_all(&f->code);
6903 dbg_lex_done("%s:%d done", __func__, __LINE__);
6906 #define zbc_vm_process(...) (zbc_vm_process(__VA_ARGS__) COMMA_SUCCESS)
6908 static BC_STATUS zbc_vm_execute_FILE(FILE *fp, const char *filename)
6910 // So far bc/dc have no way to include a file from another file,
6911 // therefore we know G.prs.lex_filename == NULL on entry
6912 //const char *sv_file;
6915 G.prs.lex_filename = filename;
6916 G.prs.lex_input_fp = fp;
6920 s = zbc_vm_process("");
6921 // We do not stop looping on errors here if reading stdin.
6922 // Example: start interactive bc and enter "return".
6923 // It should say "'return' not in a function"
6924 // but should not exit.
6925 } while (G.prs.lex_input_fp == stdin);
6926 G.prs.lex_filename = NULL;
6929 #define zbc_vm_execute_FILE(...) (zbc_vm_execute_FILE(__VA_ARGS__) COMMA_SUCCESS)
6931 static BC_STATUS zbc_vm_file(const char *file)
6936 fp = xfopen_for_read(file);
6937 s = zbc_vm_execute_FILE(fp, file);
6942 #define zbc_vm_file(...) (zbc_vm_file(__VA_ARGS__) COMMA_SUCCESS)
6945 static void bc_vm_info(void)
6947 printf("%s "BB_VER"\n"
6948 "Adapted from https://github.com/gavinhoward/bc\n"
6949 "Original code (c) 2018 Gavin D. Howard and contributors\n"
6953 static void bc_args(char **argv)
6959 #if ENABLE_FEATURE_BC_LONG_OPTIONS
6960 opts = option_mask32 |= getopt32long(argv, "wvsqli",
6961 "warn\0" No_argument "w"
6962 "version\0" No_argument "v"
6963 "standard\0" No_argument "s"
6964 "quiet\0" No_argument "q"
6965 "mathlib\0" No_argument "l"
6966 "interactive\0" No_argument "i"
6969 opts = option_mask32 |= getopt32(argv, "wvsqli");
6971 if (getenv("POSIXLY_CORRECT"))
6972 option_mask32 |= BC_FLAG_S;
6974 if (opts & BC_FLAG_V) {
6979 for (i = optind; argv[i]; ++i)
6980 bc_vec_push(&G.files, argv + i);
6983 static void bc_vm_envArgs(void)
6987 char *env_args = getenv("BC_ENV_ARGS");
6989 if (!env_args) return;
6991 G.env_args = xstrdup(env_args);
6994 bc_vec_init(&v, sizeof(char *), NULL);
6996 while (*(buf = skip_whitespace(buf)) != '\0') {
6997 bc_vec_push(&v, &buf);
6998 buf = skip_non_whitespace(buf);
7004 // NULL terminate, and pass argv[] so that first arg is argv[1]
7005 if (sizeof(int) == sizeof(char*)) {
7006 bc_vec_push(&v, &const_int_0);
7008 static char *const nullptr = NULL;
7009 bc_vec_push(&v, &nullptr);
7011 bc_args(((char **)v.v) - 1);
7016 static const char bc_lib[] ALIGN1 = {
7019 "\n" "auto b,s,n,r,d,i,p,f,v"
7020 ////////////////"if(x<0)return(1/e(-x))" // and drop 'n' and x<0 logic below
7021 //^^^^^^^^^^^^^^^^ this would work, and is even more precise than GNU bc:
7022 //e(-.998896): GNU:.36828580434569428695
7023 // above code:.36828580434569428696
7024 // actual value:.3682858043456942869594...
7025 // but for now let's be "GNU compatible"
7034 "\n" "scale=scale(x)+1"
7044 "\n" "for(i=2;v;++i){"
7050 "\n" "while(d--)r*=r"
7053 "\n" "if(n)return(1/r)"
7057 "\n" "auto b,s,r,p,a,q,i,v"
7061 "\n" "r=(1-10^scale)/1"
7072 "\n" "while(x<=.5){"
7076 "\n" "r=a=(x-1)/(x+1)"
7079 "\n" "for(i=3;v;i+=2){"
7090 "\n" "auto b,s,r,a,q,i"
7091 "\n" "if(x<0)return(-s(-x))"
7095 "\n" "scale=1.1*s+2"
7104 "\n" "for(i=3;a;i+=2){"
7105 "\n" "a*=q/(i*(i-1))"
7118 "\n" "x=s(2*a(1)+x)"
7124 "\n" "auto b,s,r,n,a,m,t,f,i,u"
7132 "\n" "if(scale<65){"
7133 "\n" "if(x==1)return(.7853981633974483096156608458198757210492923498437764552437361480/n)"
7134 "\n" "if(x==.2)return(.1973955598498807583700497651947902934475851037878521015176889402/n)"
7144 "\n" "x=(x-.2)/(1+.2*x)"
7149 "\n" "for(i=3;t;i+=2){"
7156 "\n" "return((m*a+r)/n)"
7158 "\n" "define j(n,x){"
7159 "\n" "auto b,s,o,a,i,v,f"
7170 "\n" "for(i=2;i<=n;++i)a*=i"
7172 "\n" "a=(x^n)/2^n/a"
7175 "\n" "scale+=length(a)-scale(a)"
7176 "\n" "for(i=1;v;++i){"
7177 "\n" "v=v*f/i/(n+i)"
7183 "\n" "return(a*r/1)"
7188 static BC_STATUS zbc_vm_exec(void)
7195 if (option_mask32 & BC_FLAG_L) {
7196 // We know that internal library is not buggy,
7197 // thus error checking is normally disabled.
7198 # define DEBUG_LIB 0
7200 s = zbc_vm_process(bc_lib);
7201 if (DEBUG_LIB && s) RETURN_STATUS(s);
7205 s = BC_STATUS_SUCCESS;
7206 fname = (void*)G.files.v;
7207 for (i = 0; i < G.files.len; i++) {
7208 s = zbc_vm_file(*fname++);
7209 if (ENABLE_FEATURE_CLEAN_UP && !G_ttyin && s) {
7210 // Debug config, non-interactive mode:
7211 // return all the way back to main.
7212 // Non-debug builds do not come here
7213 // in non-interactive mode, they exit.
7218 if (IS_BC || (option_mask32 & BC_FLAG_I))
7219 s = zbc_vm_execute_FILE(stdin, /*filename:*/ NULL);
7223 #define zbc_vm_exec(...) (zbc_vm_exec(__VA_ARGS__) COMMA_SUCCESS)
7225 #if ENABLE_FEATURE_CLEAN_UP
7226 static void bc_program_free(void)
7228 bc_vec_free(&G.prog.fns);
7229 IF_BC(bc_vec_free(&G.prog.fn_map);)
7230 bc_vec_free(&G.prog.vars);
7231 bc_vec_free(&G.prog.var_map);
7232 bc_vec_free(&G.prog.arrs);
7233 bc_vec_free(&G.prog.arr_map);
7234 IF_DC(bc_vec_free(&G.prog.strs);)
7235 IF_DC(bc_vec_free(&G.prog.consts);)
7236 bc_vec_free(&G.prog.results);
7237 bc_vec_free(&G.prog.exestack);
7238 IF_BC(bc_num_free(&G.prog.last);)
7239 IF_BC(bc_num_free(&G.prog.zero);)
7240 IF_BC(bc_num_free(&G.prog.one);)
7241 bc_vec_free(&G.input_buffer);
7244 static void bc_vm_free(void)
7246 bc_vec_free(&G.files);
7253 static void bc_program_init(void)
7257 // memset(&G.prog, 0, sizeof(G.prog)); - already is
7258 memset(&ip, 0, sizeof(BcInstPtr));
7260 // G.prog.nchars = G.prog.scale = 0; - already is
7264 IF_BC(bc_num_init_DEF_SIZE(&G.prog.last);)
7265 //IF_BC(bc_num_zero(&G.prog.last);) - already is
7267 bc_num_init_DEF_SIZE(&G.prog.zero);
7268 //bc_num_zero(&G.prog.zero); - already is
7270 IF_BC(bc_num_init_DEF_SIZE(&G.prog.one);)
7271 IF_BC(bc_num_one(&G.prog.one);)
7273 bc_vec_init(&G.prog.fns, sizeof(BcFunc), bc_func_free);
7274 IF_BC(bc_vec_init(&G.prog.fn_map, sizeof(BcId), bc_id_free);)
7277 // Names are chosen simply to be distinct and never match
7278 // a valid function name (and be short)
7279 IF_BC(bc_program_addFunc(xstrdup(""))); // func #0: main
7280 IF_BC(bc_program_addFunc(xstrdup("1"))); // func #1: for read()
7282 // in dc, functions have no names
7283 bc_program_add_fn();
7284 bc_program_add_fn();
7287 bc_vec_init(&G.prog.vars, sizeof(BcVec), bc_vec_free);
7288 bc_vec_init(&G.prog.var_map, sizeof(BcId), bc_id_free);
7290 bc_vec_init(&G.prog.arrs, sizeof(BcVec), bc_vec_free);
7291 bc_vec_init(&G.prog.arr_map, sizeof(BcId), bc_id_free);
7293 IF_DC(bc_vec_init(&G.prog.strs, sizeof(char *), bc_string_free);)
7294 IF_DC(bc_vec_init(&G.prog.consts, sizeof(char *), bc_string_free);)
7295 bc_vec_init(&G.prog.results, sizeof(BcResult), bc_result_free);
7296 bc_vec_init(&G.prog.exestack, sizeof(BcInstPtr), NULL);
7297 bc_vec_push(&G.prog.exestack, &ip);
7299 bc_char_vec_init(&G.input_buffer);
7302 static int bc_vm_init(const char *env_len)
7304 #if ENABLE_FEATURE_EDITING
7305 G.line_input_state = new_line_input_t(DO_HISTORY);
7307 G.prog.len = bc_vm_envLen(env_len);
7309 bc_vec_init(&G.files, sizeof(char *), NULL);
7310 IF_BC(if (IS_BC) bc_vm_envArgs();)
7312 bc_parse_create(BC_PROG_MAIN);
7314 //TODO: in GNU bc, the check is (isatty(0) && isatty(1)),
7315 //-i option unconditionally enables this regardless of isatty():
7317 #if ENABLE_FEATURE_BC_SIGNALS
7319 // With SA_RESTART, most system calls will restart
7320 // (IOW: they won't fail with EINTR).
7321 // In particular, this means ^C won't cause
7322 // stdout to get into "error state" if SIGINT hits
7323 // within write() syscall.
7325 // The downside is that ^C while tty input is taken
7326 // will only be handled after [Enter] since read()
7327 // from stdin is not interrupted by ^C either,
7328 // it restarts, thus fgetc() does not return on ^C.
7329 // (This problem manifests only if line editing is disabled)
7330 signal_SA_RESTART_empty_mask(SIGINT, record_signo);
7332 // Without SA_RESTART, this exhibits a bug:
7333 // "while (1) print 1" and try ^C-ing it.
7334 // Intermittently, instead of returning to input line,
7335 // you'll get "output error: Interrupted system call"
7337 //signal_no_SA_RESTART_empty_mask(SIGINT, record_signo);
7341 return 0; // "not a tty"
7344 static BcStatus bc_vm_run(void)
7346 BcStatus st = zbc_vm_exec();
7347 #if ENABLE_FEATURE_CLEAN_UP
7348 if (G_exiting) // it was actually "halt" or "quit"
7351 # if ENABLE_FEATURE_EDITING
7352 free_line_input_t(G.line_input_state);
7356 dbg_exec("exiting with exitcode %d", st);
7361 int bc_main(int argc, char **argv) MAIN_EXTERNALLY_VISIBLE;
7362 int bc_main(int argc UNUSED_PARAM, char **argv)
7368 is_tty = bc_vm_init("BC_LINE_LENGTH");
7372 if (is_tty && !(option_mask32 & BC_FLAG_Q))
7380 int dc_main(int argc, char **argv) MAIN_EXTERNALLY_VISIBLE;
7381 int dc_main(int argc UNUSED_PARAM, char **argv)
7387 // TODO: dc (GNU bc 1.07.1) 1.4.1 seems to use width
7388 // 1 char wider than bc from the same package.
7389 // Both default width, and xC_LINE_LENGTH=N are wider:
7390 // "DC_LINE_LENGTH=5 dc -e'123456 p'" prints:
7393 // "echo '123456' | BC_LINE_LENGTH=5 bc" prints:
7396 // Do the same, or it's a bug?
7397 bc_vm_init("DC_LINE_LENGTH");
7399 // Run -e'SCRIPT' and -fFILE in order of appearance, then handle FILEs
7400 noscript = BC_FLAG_I;
7402 int n = getopt(argc, argv, "e:f:x");
7408 n = zbc_vm_process(optarg);
7413 n = zbc_vm_file(optarg);
7417 option_mask32 |= DC_FLAG_X;
7427 bc_vec_push(&G.files, argv++);
7430 option_mask32 |= noscript; // set BC_FLAG_I if we need to interpret stdin
7436 #endif // not DC_SMALL