1 /* vi: set sw=4 ts=4: */
3 * Licensed under GPLv2 or later, see file LICENSE in this source tree.
4 * Copyright (c) 2018 Gavin D. Howard and contributors.
7 //config: bool "bc (45 kb; 49 kb when combined with dc)"
10 //config: bc is a command-line, arbitrary-precision calculator with a
11 //config: Turing-complete language. See the GNU bc manual
12 //config: (https://www.gnu.org/software/bc/manual/bc.html) and bc spec
13 //config: (http://pubs.opengroup.org/onlinepubs/9699919799/utilities/bc.html).
15 //config: This bc has five differences to the GNU bc:
16 //config: 1) The period (.) is a shortcut for "last", as in the BSD bc.
17 //config: 2) Arrays are copied before being passed as arguments to
18 //config: functions. This behavior is required by the bc spec.
19 //config: 3) Arrays can be passed to the builtin "length" function to get
20 //config: the number of elements in the array. This prints "1":
21 //config: a[0] = 0; length(a[])
22 //config: 4) The precedence of the boolean "not" operator (!) is equal to
23 //config: that of the unary minus (-) negation operator. This still
24 //config: allows POSIX-compliant scripts to work while somewhat
25 //config: preserving expected behavior (versus C) and making parsing
27 //config: 5) "read()" accepts expressions, not only numeric literals.
30 //config: -i --interactive force interactive mode
31 //config: -q --quiet don't print version and copyright
32 //config: -s --standard error if any non-POSIX extensions are used
33 //config: -w --warn warn if any non-POSIX extensions are used
34 //config: -l --mathlib use predefined math routines:
35 //config: s(expr) sine in radians
36 //config: c(expr) cosine in radians
37 //config: a(expr) arctangent, returning radians
38 //config: l(expr) natural log
39 //config: e(expr) raises e to the power of expr
40 //config: j(n, x) Bessel function of integer order n of x
43 //config: bool "dc (38 kb; 49 kb when combined with bc)"
46 //config: dc is a reverse-polish notation command-line calculator which
47 //config: supports unlimited precision arithmetic. See the FreeBSD man page
48 //config: (https://www.unix.com/man-page/FreeBSD/1/dc/) and GNU dc manual
49 //config: (https://www.gnu.org/software/bc/manual/dc-1.05/html_mono/dc.html).
51 //config: This dc has a few differences from the two above:
52 //config: 1) When printing a byte stream (command "P"), this dc follows what
53 //config: the FreeBSD dc does.
54 //config: 2) Implements the GNU extensions for divmod ("~") and
55 //config: modular exponentiation ("|").
56 //config: 3) Implements all FreeBSD extensions, except for "J" and "M".
57 //config: 4) Like the FreeBSD dc, this dc supports extended registers.
58 //config: However, they are implemented differently. When it encounters
59 //config: whitespace where a register should be, it skips the whitespace.
60 //config: If the character following is not a lowercase letter, an error
61 //config: is issued. Otherwise, the register name is parsed by the
62 //config: following regex:
63 //config: [a-z][a-z0-9_]*
64 //config: This generally means that register names will be surrounded by
65 //config: whitespace. Examples:
66 //config: l idx s temp L index S temp2 < do_thing
67 //config: Also note that, like the FreeBSD dc, extended registers are not
68 //config: allowed unless the "-x" option is given.
70 //config:config FEATURE_DC_SMALL
71 //config: bool "Minimal dc implementation (4.2 kb), not using bc code base"
72 //config: depends on DC && !BC
75 //config:config FEATURE_DC_LIBM
76 //config: bool "Enable power and exp functions (requires libm)"
78 //config: depends on FEATURE_DC_SMALL
80 //config: Enable power and exp functions.
81 //config: NOTE: This will require libm to be present for linking.
83 //config:config FEATURE_BC_SIGNALS
84 //config: bool "Interactive mode (+4kb)"
86 //config: depends on (BC || DC) && !FEATURE_DC_SMALL
88 //config: Enable interactive mode: when started on a tty,
89 //config: ^C interrupts execution and returns to command line,
90 //config: errors also return to command line instead of exiting,
91 //config: line editing with history is available.
93 //config: With this option off, input can still be taken from tty,
94 //config: but all errors are fatal, ^C is fatal,
95 //config: tty is treated exactly the same as any other
96 //config: standard input (IOW: no line editing).
98 //config:config FEATURE_BC_LONG_OPTIONS
99 //config: bool "Enable bc/dc long options"
101 //config: depends on (BC || DC) && !FEATURE_DC_SMALL
103 //config: Enable long options for bc and dc.
105 //applet:IF_BC(APPLET(bc, BB_DIR_USR_BIN, BB_SUID_DROP))
106 //applet:IF_DC(APPLET(dc, BB_DIR_USR_BIN, BB_SUID_DROP))
108 //kbuild:lib-$(CONFIG_BC) += bc.o
109 //kbuild:lib-$(CONFIG_DC) += bc.o
111 //See www.gnu.org/software/bc/manual/bc.html
112 //usage:#define bc_trivial_usage
113 //usage: "[-sqlw] FILE..."
115 //usage:#define bc_full_usage "\n"
116 //usage: "\nArbitrary precision calculator"
118 ///////: "\n -i Interactive" - has no effect for now
119 //usage: "\n -q Quiet"
120 //usage: "\n -l Load standard math library"
121 //usage: "\n -s Be POSIX compatible"
122 //usage: "\n -w Warn if extensions are used"
123 ///////: "\n -v Version"
125 //usage: "\n$BC_LINE_LENGTH changes output width"
127 //usage:#define bc_example_usage
128 //usage: "3 + 4.129\n"
129 //usage: "1903 - 2893\n"
130 //usage: "-129 * 213.28935\n"
131 //usage: "12 / -1932\n"
133 //usage: "34 ^ 189\n"
134 //usage: "scale = 13\n"
135 //usage: "ibase = 2\n"
136 //usage: "obase = A\n"
138 //usage:#define dc_trivial_usage
139 //usage: IF_NOT_FEATURE_DC_SMALL("[-x] ")"[-eSCRIPT]... [-fFILE]... [FILE]..."
141 //usage:#define dc_full_usage "\n"
142 //usage: "\nTiny RPN calculator. Operations:"
143 //usage: "\n+, -, *, /, %, ~, ^," IF_NOT_FEATURE_DC_SMALL(" |,")
144 //usage: "\np - print top of the stack without popping"
145 //usage: "\nf - print entire stack"
146 //usage: "\nk - pop the value and set the precision"
147 //usage: "\ni - pop the value and set input radix"
148 //usage: "\no - pop the value and set output radix"
149 //usage: "\nExamples: dc -e'2 2 + p' -> 4, dc -e'8 8 * 2 2 + / p' -> 16"
151 //usage:#define dc_example_usage
152 //usage: "$ dc -e'2 2 + p'\n"
154 //usage: "$ dc -e'8 8 \\* 2 2 + / p'\n"
156 //usage: "$ dc -e'0 1 & p'\n"
158 //usage: "$ dc -e'0 1 | p'\n"
160 //usage: "$ echo '72 9 / 8 * p' | dc\n"
164 #include "common_bufsiz.h"
166 #if ENABLE_FEATURE_DC_SMALL
170 #define DEBUG_LEXER 0
171 #define DEBUG_COMPILE 0
173 // This can be left enabled for production as well:
174 #define SANITY_CHECKS 1
177 static uint8_t lex_indent;
178 #define dbg_lex(...) \
180 fprintf(stderr, "%*s", lex_indent, ""); \
181 bb_error_msg(__VA_ARGS__); \
183 #define dbg_lex_enter(...) \
185 dbg_lex(__VA_ARGS__); \
188 #define dbg_lex_done(...) \
191 dbg_lex(__VA_ARGS__); \
194 # define dbg_lex(...) ((void)0)
195 # define dbg_lex_enter(...) ((void)0)
196 # define dbg_lex_done(...) ((void)0)
200 # define dbg_compile(...) bb_error_msg(__VA_ARGS__)
202 # define dbg_compile(...) ((void)0)
206 # define dbg_exec(...) bb_error_msg(__VA_ARGS__)
208 # define dbg_exec(...) ((void)0)
211 typedef enum BcStatus {
212 BC_STATUS_SUCCESS = 0,
213 BC_STATUS_FAILURE = 1,
214 BC_STATUS_PARSE_EMPTY_EXP = 2, // bc_parse_expr_empty_ok() uses this
217 #define BC_VEC_INVALID_IDX ((size_t) -1)
218 #define BC_VEC_START_CAP (1 << 5)
220 typedef void (*BcVecFree)(void *) FAST_FUNC;
222 typedef struct BcVec {
230 typedef signed char BcDig;
232 typedef struct BcNum {
240 #define BC_NUM_MAX_IBASE ((unsigned long) 16)
241 // larger value might speed up BIGNUM calculations a bit:
242 #define BC_NUM_DEF_SIZE (16)
243 #define BC_NUM_PRINT_WIDTH (69)
245 #define BC_NUM_KARATSUBA_LEN (32)
247 typedef enum BcInst {
254 XC_INST_NEG, // order
256 XC_INST_REL_EQ, // should
257 XC_INST_REL_LE, // match
258 XC_INST_REL_GE, // LEX
259 XC_INST_REL_NE, // constants
260 XC_INST_REL_LT, // for
261 XC_INST_REL_GT, // these
263 XC_INST_POWER, // operations
264 XC_INST_MULTIPLY, // |
266 XC_INST_MODULUS, // |
270 XC_INST_BOOL_NOT, // |
271 XC_INST_BOOL_OR, // |
272 XC_INST_BOOL_AND, // |
274 BC_INST_ASSIGN_POWER, // |
275 BC_INST_ASSIGN_MULTIPLY,// |
276 BC_INST_ASSIGN_DIVIDE, // |
277 BC_INST_ASSIGN_MODULUS, // |
278 BC_INST_ASSIGN_PLUS, // |
279 BC_INST_ASSIGN_MINUS, // |
289 XC_INST_IBASE, // order of these constans should match other enums
290 XC_INST_OBASE, // order of these constans should match other enums
291 XC_INST_SCALE, // order of these constans should match other enums
292 IF_BC(BC_INST_LAST,) // order of these constans should match other enums
323 DC_INST_PRINT_STREAM,
338 DC_INST_INVALID = -1,
342 typedef struct BcId {
347 typedef struct BcFunc {
353 IF_BC(size_t nparams;)
356 typedef enum BcResultType {
360 XC_RESULT_ARRAY_ELEM,
365 //code uses "inst - XC_INST_IBASE + XC_RESULT_IBASE" construct,
366 XC_RESULT_IBASE, // relative order should match for: XC_INST_IBASE
367 XC_RESULT_OBASE, // relative order should match for: XC_INST_OBASE
368 XC_RESULT_SCALE, // relative order should match for: XC_INST_SCALE
369 IF_BC(BC_RESULT_LAST,) // relative order should match for: BC_INST_LAST
371 IF_BC(BC_RESULT_ONE,)
374 typedef union BcResultData {
380 typedef struct BcResult {
385 typedef struct BcInstPtr {
388 IF_BC(size_t results_len_before_call;)
391 typedef enum BcLexType {
402 XC_LEX_NEG = XC_LEX_1st_op, // order
404 XC_LEX_OP_REL_EQ, // should
405 XC_LEX_OP_REL_LE, // match
406 XC_LEX_OP_REL_GE, // INST
407 XC_LEX_OP_REL_NE, // constants
408 XC_LEX_OP_REL_LT, // for
409 XC_LEX_OP_REL_GT, // these
411 XC_LEX_OP_POWER, // operations
412 XC_LEX_OP_MULTIPLY, // |
413 XC_LEX_OP_DIVIDE, // |
414 XC_LEX_OP_MODULUS, // |
416 XC_LEX_OP_MINUS, // |
417 XC_LEX_OP_last = XC_LEX_OP_MINUS,
419 BC_LEX_OP_BOOL_NOT, // |
420 BC_LEX_OP_BOOL_OR, // |
421 BC_LEX_OP_BOOL_AND, // |
423 BC_LEX_OP_ASSIGN_POWER, // |
424 BC_LEX_OP_ASSIGN_MULTIPLY, // |
425 BC_LEX_OP_ASSIGN_DIVIDE, // |
426 BC_LEX_OP_ASSIGN_MODULUS, // |
427 BC_LEX_OP_ASSIGN_PLUS, // |
428 BC_LEX_OP_ASSIGN_MINUS, // |
430 BC_LEX_OP_ASSIGN, // V
435 BC_LEX_LPAREN, // () are 0x28 and 0x29
436 BC_LEX_RPAREN, // must be LPAREN+1: code uses (c - '(' + BC_LEX_LPAREN)
438 BC_LEX_LBRACKET, // [] are 0x5B and 5D
440 BC_LEX_RBRACKET, // must be LBRACKET+2: code uses (c - '[' + BC_LEX_LBRACKET)
442 BC_LEX_LBRACE, // {} are 0x7B and 0x7D
444 BC_LEX_RBRACE, // must be LBRACE+2: code uses (c - '{' + BC_LEX_LBRACE)
446 BC_LEX_KEY_1st_keyword,
447 BC_LEX_KEY_AUTO = BC_LEX_KEY_1st_keyword,
454 // code uses "type - BC_LEX_KEY_IBASE + XC_INST_IBASE" construct,
455 BC_LEX_KEY_IBASE, // relative order should match for: XC_INST_IBASE
456 BC_LEX_KEY_OBASE, // relative order should match for: XC_INST_OBASE
458 IF_BC(BC_LEX_KEY_LAST,) // relative order should match for: BC_INST_LAST
471 DC_LEX_OP_BOOL_NOT = XC_LEX_OP_last + 1,
503 // code uses "t - DC_LEX_STORE_IBASE + XC_INST_IBASE" construct,
504 DC_LEX_STORE_IBASE, // relative order should match for: XC_INST_IBASE
505 DC_LEX_STORE_OBASE, // relative order should match for: XC_INST_OBASE
506 DC_LEX_STORE_SCALE, // relative order should match for: XC_INST_SCALE
515 // must match order of BC_LEX_KEY_foo etc above
517 struct BcLexKeyword {
520 #define BC_LEX_KW_ENTRY(a, b) \
521 { .name8 = a /*, .posix = b */ }
522 static const struct BcLexKeyword bc_lex_kws[20] = {
523 BC_LEX_KW_ENTRY("auto" , 1), // 0
524 BC_LEX_KW_ENTRY("break" , 1), // 1
525 BC_LEX_KW_ENTRY("continue", 0), // 2 note: this one has no terminating NUL
526 BC_LEX_KW_ENTRY("define" , 1), // 3
527 BC_LEX_KW_ENTRY("else" , 0), // 4
528 BC_LEX_KW_ENTRY("for" , 1), // 5
529 BC_LEX_KW_ENTRY("halt" , 0), // 6
530 BC_LEX_KW_ENTRY("ibase" , 1), // 7
531 BC_LEX_KW_ENTRY("obase" , 1), // 8
532 BC_LEX_KW_ENTRY("if" , 1), // 9
533 BC_LEX_KW_ENTRY("last" , 0), // 10
534 BC_LEX_KW_ENTRY("length" , 1), // 11
535 BC_LEX_KW_ENTRY("limits" , 0), // 12
536 BC_LEX_KW_ENTRY("print" , 0), // 13
537 BC_LEX_KW_ENTRY("quit" , 1), // 14
538 BC_LEX_KW_ENTRY("read" , 0), // 15
539 BC_LEX_KW_ENTRY("return" , 1), // 16
540 BC_LEX_KW_ENTRY("scale" , 1), // 17
541 BC_LEX_KW_ENTRY("sqrt" , 1), // 18
542 BC_LEX_KW_ENTRY("while" , 1), // 19
544 #undef BC_LEX_KW_ENTRY
545 #define STRING_else (bc_lex_kws[4].name8)
546 #define STRING_for (bc_lex_kws[5].name8)
547 #define STRING_if (bc_lex_kws[9].name8)
548 #define STRING_while (bc_lex_kws[19].name8)
572 #define bc_lex_kws_POSIX(i) ((1 << (i)) & POSIX_KWORD_MASK)
574 // This is a bit array that corresponds to token types. An entry is
575 // true if the token is valid in an expression, false otherwise.
576 // Used to figure out when expr parsing should stop *without error message*
577 // - 0 element indicates this condition. 1 means "this token is to be eaten
578 // as part of the expression", it can then still be determined to be invalid
579 // by later processing.
581 #define EXBITS(a,b,c,d,e,f,g,h) \
582 ((uint64_t)((a << 0)+(b << 1)+(c << 2)+(d << 3)+(e << 4)+(f << 5)+(g << 6)+(h << 7)))
583 BC_PARSE_EXPRS_BITS = 0 // corresponding BC_LEX_xyz:
584 + (EXBITS(0,0,0,0,0,1,1,1) << (0*8)) // 0: EOF INVAL NL WS STR NAME NUM -
585 + (EXBITS(1,1,1,1,1,1,1,1) << (1*8)) // 8: == <= >= != < > ^ *
586 + (EXBITS(1,1,1,1,1,1,1,1) << (2*8)) // 16: / % + - ! || && ^=
587 + (EXBITS(1,1,1,1,1,1,1,1) << (3*8)) // 24: *= /= %= += -= = ++ --
588 + (EXBITS(1,1,0,0,0,0,0,0) << (4*8)) // 32: ( ) [ , ] { ; }
589 + (EXBITS(0,0,0,0,0,0,0,1) << (5*8)) // 40: auto break cont define else for halt ibase
590 + (EXBITS(1,0,1,1,0,0,0,1) << (6*8)) // 48: obase if last length limits print quit read
591 + (EXBITS(0,1,1,0,0,0,0,0) << (7*8)) // 56: return scale sqrt while
594 static ALWAYS_INLINE long lex_allowed_in_bc_expr(unsigned i)
596 #if ULONG_MAX > 0xffffffff
597 // 64-bit version (will not work correctly for 32-bit longs!)
598 return BC_PARSE_EXPRS_BITS & (1UL << i);
601 unsigned long m = (uint32_t)BC_PARSE_EXPRS_BITS;
603 m = (uint32_t)(BC_PARSE_EXPRS_BITS >> 32);
606 return m & (1UL << i);
610 // This is an array of data for operators that correspond to
611 // [XC_LEX_1st_op...] token types.
612 static const uint8_t bc_parse_ops[] = {
613 #define OP(p,l) ((int)(l) * 0x10 + (p))
615 OP(6, true ), OP( 6, true ), OP( 6, true ), OP( 6, true ), OP( 6, true ), OP( 6, true ), // == <= >= != < >
617 OP(3, true ), OP( 3, true ), OP( 3, true ), // mul div mod
618 OP(4, true ), OP( 4, true ), // + -
620 OP(7, true ), OP( 7, true ), // or and
621 OP(5, false), OP( 5, false ), OP( 5, false ), OP( 5, false ), OP( 5, false ), // ^= *= /= %= +=
622 OP(5, false), OP( 5, false ), // -= =
623 OP(0, false), OP( 0, false ), // inc dec
626 #define bc_parse_op_PREC(i) (bc_parse_ops[i] & 0x0f)
627 #define bc_parse_op_LEFT(i) (bc_parse_ops[i] & 0x10)
631 static const //BcLexType - should be this type
635 XC_LEX_OP_MODULUS, XC_LEX_INVALID, XC_LEX_INVALID, DC_LEX_LPAREN,
637 XC_LEX_INVALID, XC_LEX_OP_MULTIPLY, XC_LEX_OP_PLUS, XC_LEX_INVALID,
639 XC_LEX_OP_MINUS, XC_LEX_INVALID, XC_LEX_OP_DIVIDE,
641 XC_LEX_INVALID, XC_LEX_INVALID, XC_LEX_INVALID, XC_LEX_INVALID,
642 XC_LEX_INVALID, XC_LEX_INVALID, XC_LEX_INVALID, XC_LEX_INVALID,
643 XC_LEX_INVALID, XC_LEX_INVALID,
645 DC_LEX_COLON, DC_LEX_SCOLON, XC_LEX_OP_REL_GT, XC_LEX_OP_REL_EQ,
646 XC_LEX_OP_REL_LT, DC_LEX_READ, XC_LEX_INVALID,
648 XC_LEX_INVALID, XC_LEX_INVALID, XC_LEX_INVALID, XC_LEX_INVALID,
649 XC_LEX_INVALID, XC_LEX_INVALID, DC_LEX_EQ_NO_REG, XC_LEX_INVALID,
651 DC_LEX_IBASE, XC_LEX_INVALID, DC_LEX_SCALE, DC_LEX_LOAD_POP,
652 XC_LEX_INVALID, DC_LEX_OP_BOOL_NOT, DC_LEX_OBASE, DC_LEX_PRINT_STREAM,
654 DC_LEX_NQUIT, DC_LEX_POP, DC_LEX_STORE_PUSH, XC_LEX_INVALID, XC_LEX_INVALID,
655 XC_LEX_INVALID, XC_LEX_INVALID, DC_LEX_SCALE_FACTOR, XC_LEX_INVALID,
657 DC_LEX_LENGTH, XC_LEX_INVALID, XC_LEX_INVALID, XC_LEX_INVALID,
659 XC_LEX_OP_POWER, XC_LEX_NEG, XC_LEX_INVALID,
661 DC_LEX_ASCIIFY, XC_LEX_INVALID, DC_LEX_CLEAR_STACK, DC_LEX_DUPLICATE,
662 DC_LEX_ELSE, DC_LEX_PRINT_STACK, XC_LEX_INVALID, XC_LEX_INVALID,
664 DC_LEX_STORE_IBASE, XC_LEX_INVALID, DC_LEX_STORE_SCALE, DC_LEX_LOAD,
665 XC_LEX_INVALID, DC_LEX_PRINT_POP, DC_LEX_STORE_OBASE, DC_LEX_PRINT,
667 DC_LEX_QUIT, DC_LEX_SWAP, DC_LEX_OP_ASSIGN, XC_LEX_INVALID,
668 XC_LEX_INVALID, DC_LEX_SQRT, XC_LEX_INVALID, DC_LEX_EXECUTE,
670 XC_LEX_INVALID, DC_LEX_STACK_LEVEL,
672 DC_LEX_LBRACE, DC_LEX_OP_MODEXP, XC_LEX_INVALID, DC_LEX_OP_DIVMOD,
674 static const //BcInst - should be this type. Using signed narrow type since DC_INST_INVALID is -1
676 dc_LEX_to_INST[] = { // starts at XC_LEX_OP_POWER // corresponding XC/DC_LEX_xyz:
677 XC_INST_POWER, XC_INST_MULTIPLY, // OP_POWER OP_MULTIPLY
678 XC_INST_DIVIDE, XC_INST_MODULUS, // OP_DIVIDE OP_MODULUS
679 XC_INST_PLUS, XC_INST_MINUS, // OP_PLUS OP_MINUS
680 XC_INST_BOOL_NOT, // DC_LEX_OP_BOOL_NOT
681 DC_INST_INVALID, // DC_LEX_OP_ASSIGN
682 XC_INST_REL_GT, // DC_LEX_LPAREN
683 DC_INST_INVALID, // DC_LEX_SCOLON
684 DC_INST_INVALID, // DC_LEX_READ
685 XC_INST_IBASE, // DC_LEX_IBASE
686 XC_INST_SCALE, // DC_LEX_SCALE
687 XC_INST_OBASE, // DC_LEX_OBASE
688 XC_INST_LENGTH, // DC_LEX_LENGTH
689 XC_INST_PRINT, // DC_LEX_PRINT
690 DC_INST_QUIT, // DC_LEX_QUIT
691 XC_INST_SQRT, // DC_LEX_SQRT
692 XC_INST_REL_GE, // DC_LEX_LBRACE
693 XC_INST_REL_EQ, // DC_LEX_EQ_NO_REG
694 DC_INST_MODEXP, DC_INST_DIVMOD, // OP_MODEXP OP_DIVMOD
695 DC_INST_INVALID, DC_INST_INVALID, // COLON ELSE
696 DC_INST_EXECUTE, // EXECUTE
697 DC_INST_PRINT_STACK, DC_INST_CLEAR_STACK, // PRINT_STACK CLEAR_STACK
698 DC_INST_STACK_LEN, DC_INST_DUPLICATE, // STACK_LEVEL DUPLICATE
699 DC_INST_SWAP, XC_INST_POP, // SWAP POP
700 DC_INST_ASCIIFY, DC_INST_PRINT_STREAM, // ASCIIFY PRINT_STREAM
701 DC_INST_INVALID, DC_INST_INVALID, // STORE_IBASE STORE_OBASE
702 DC_INST_INVALID, DC_INST_INVALID, // STORE_SCALE LOAD
703 DC_INST_INVALID, DC_INST_INVALID, // LOAD_POP STORE_PUSH
704 XC_INST_PRINT, DC_INST_NQUIT, // PRINT_POP NQUIT
705 XC_INST_SCALE_FUNC, // SCALE_FACTOR
706 // DC_INST_INVALID in this table either means that corresponding LEX
707 // is not possible for dc, or that it does not compile one-to-one
712 typedef struct BcLex {
714 const char *lex_next_at; // last lex_next() was called at this string
719 smallint lex; // was BcLexType
720 smallint lex_last; // was BcLexType
724 #define BC_PARSE_STREND (0xff)
727 # define BC_PARSE_REL (1 << 0)
728 # define BC_PARSE_PRINT (1 << 1)
729 # define BC_PARSE_ARRAY (1 << 2)
730 # define BC_PARSE_NOCALL (1 << 3)
733 typedef struct BcParse {
740 const char *filename;
746 IF_BC(size_t in_funcdef;)
749 typedef struct BcProgram {
777 #define BC_PROG_MAIN (0)
778 #define BC_PROG_READ (1)
780 #define BC_PROG_REQ_FUNCS (2)
783 #define BC_PROG_STR(n) (!(n)->num && !(n)->cap)
784 #define BC_PROG_NUM(r, n) \
785 ((r)->t != XC_RESULT_ARRAY && (r)->t != XC_RESULT_STR && !BC_PROG_STR(n))
787 #define BC_FLAG_W (1 << 0)
788 #define BC_FLAG_V (1 << 1)
789 #define BC_FLAG_S (1 << 2)
790 #define BC_FLAG_Q (1 << 3)
791 #define BC_FLAG_L (1 << 4)
792 #define BC_FLAG_I (1 << 5)
793 #define DC_FLAG_X (1 << 6)
795 #define BC_MAX(a, b) ((a) > (b) ? (a) : (b))
796 #define BC_MIN(a, b) ((a) < (b) ? (a) : (b))
798 #define BC_MAX_OBASE ((unsigned) 999)
799 #define BC_MAX_DIM ((unsigned) INT_MAX)
800 #define BC_MAX_SCALE ((unsigned) UINT_MAX)
801 #define BC_MAX_STRING ((unsigned) UINT_MAX - 1)
802 #define BC_MAX_NUM BC_MAX_STRING
803 // Unused apart from "limits" message. Just show a "biggish number" there.
804 //#define BC_MAX_NAME BC_MAX_STRING
805 //#define BC_MAX_EXP ((unsigned long) LONG_MAX)
806 //#define BC_MAX_VARS ((unsigned long) SIZE_MAX - 1)
807 #define BC_MAX_NAME_STR "999999999"
808 #define BC_MAX_EXP_STR "999999999"
809 #define BC_MAX_VARS_STR "999999999"
811 #define BC_MAX_OBASE_STR "999"
813 #if INT_MAX == 2147483647
814 # define BC_MAX_DIM_STR "2147483647"
815 #elif INT_MAX == 9223372036854775807
816 # define BC_MAX_DIM_STR "9223372036854775807"
818 # error Strange INT_MAX
821 #if UINT_MAX == 4294967295
822 # define BC_MAX_SCALE_STR "4294967295"
823 # define BC_MAX_STRING_STR "4294967294"
824 #elif UINT_MAX == 18446744073709551615
825 # define BC_MAX_SCALE_STR "18446744073709551615"
826 # define BC_MAX_STRING_STR "18446744073709551614"
828 # error Strange UINT_MAX
830 #define BC_MAX_NUM_STR BC_MAX_STRING_STR
833 IF_FEATURE_BC_SIGNALS(smallint ttyin;)
834 IF_FEATURE_CLEAN_UP(smallint exiting;)
839 // For error messages. Can be set to current parsed line,
840 // or [TODO] to current executing line (can be before last parsed one)
848 #if ENABLE_FEATURE_EDITING
849 line_input_t *line_input_state;
852 #define G (*ptr_to_globals)
853 #define INIT_G() do { \
854 SET_PTR_TO_GLOBALS(xzalloc(sizeof(G))); \
856 #define FREE_G() do { \
857 FREE_PTR_TO_GLOBALS(); \
859 #define G_posix (ENABLE_BC && (option_mask32 & BC_FLAG_S))
860 #define G_warn (ENABLE_BC && (option_mask32 & BC_FLAG_W))
861 #define G_exreg (ENABLE_DC && (option_mask32 & DC_FLAG_X))
862 #if ENABLE_FEATURE_BC_SIGNALS
863 # define G_interrupt bb_got_signal
864 # define G_ttyin G.ttyin
866 # define G_interrupt 0
869 #if ENABLE_FEATURE_CLEAN_UP
870 # define G_exiting G.exiting
874 #define IS_BC (ENABLE_BC && (!ENABLE_DC || applet_name[0] == 'b'))
875 #define IS_DC (ENABLE_DC && (!ENABLE_BC || applet_name[0] != 'b'))
877 // In configurations where errors abort instead of propagating error
878 // return code up the call chain, functions returning BC_STATUS
879 // actually don't return anything, they always succeed and return "void".
880 // A macro wrapper is provided, which makes this statement work:
882 // and makes it visible to the compiler that s is always zero,
883 // allowing compiler to optimize dead code after the statement.
885 // To make code more readable, each such function has a "z"
886 // ("always returning zero") prefix, i.e. zbc_foo or zdc_foo.
888 #if ENABLE_FEATURE_BC_SIGNALS || ENABLE_FEATURE_CLEAN_UP
889 # define ERRORS_ARE_FATAL 0
890 # define ERRORFUNC /*nothing*/
891 # define IF_ERROR_RETURN_POSSIBLE(a) a
892 # define BC_STATUS BcStatus
893 # define RETURN_STATUS(v) return (v)
894 # define COMMA_SUCCESS /*nothing*/
896 # define ERRORS_ARE_FATAL 1
897 # define ERRORFUNC NORETURN
898 # define IF_ERROR_RETURN_POSSIBLE(a) /*nothing*/
899 # define BC_STATUS void
900 # define RETURN_STATUS(v) do { ((void)(v)); return; } while (0)
901 # define COMMA_SUCCESS ,BC_STATUS_SUCCESS
908 static void fflush_and_check(void)
911 if (ferror(stdout) || ferror(stderr))
912 bb_perror_msg_and_die("output error");
915 #if ENABLE_FEATURE_CLEAN_UP
916 #define QUIT_OR_RETURN_TO_MAIN \
918 IF_FEATURE_BC_SIGNALS(G_ttyin = 0;) /* do not loop in main loop anymore */ \
920 return BC_STATUS_FAILURE; \
923 #define QUIT_OR_RETURN_TO_MAIN quit()
926 static void quit(void) NORETURN;
927 static void quit(void)
930 bb_perror_msg_and_die("input error");
932 dbg_exec("quit(): exiting with exitcode SUCCESS");
936 static void bc_verror_msg(const char *fmt, va_list p)
938 const char *sv = sv; // for compiler
939 if (G.prs.filename) {
941 applet_name = xasprintf("%s: %s:%u", applet_name, G.prs.filename, G.err_line);
943 bb_verror_msg(fmt, p, NULL);
944 if (G.prs.filename) {
945 free((char*)applet_name);
950 static NOINLINE ERRORFUNC int bc_error_fmt(const char *fmt, ...)
955 bc_verror_msg(fmt, p);
958 if (ENABLE_FEATURE_CLEAN_UP || G_ttyin)
959 IF_ERROR_RETURN_POSSIBLE(return BC_STATUS_FAILURE);
964 static NOINLINE BC_STATUS zbc_posix_error_fmt(const char *fmt, ...)
968 // Are non-POSIX constructs totally ok?
969 if (!(option_mask32 & (BC_FLAG_S|BC_FLAG_W)))
970 RETURN_STATUS(BC_STATUS_SUCCESS); // yes
973 bc_verror_msg(fmt, p);
976 // Do we treat non-POSIX constructs as errors?
977 if (!(option_mask32 & BC_FLAG_S))
978 RETURN_STATUS(BC_STATUS_SUCCESS); // no, it's a warning
980 if (ENABLE_FEATURE_CLEAN_UP || G_ttyin)
981 RETURN_STATUS(BC_STATUS_FAILURE);
984 #define zbc_posix_error_fmt(...) (zbc_posix_error_fmt(__VA_ARGS__) COMMA_SUCCESS)
987 // We use error functions with "return bc_error(FMT[, PARAMS])" idiom.
988 // This idiom begs for tail-call optimization, but for it to work,
989 // function must not have caller-cleaned parameters on stack.
990 // Unfortunately, vararg function API does exactly that on most arches.
991 // Thus, use these shims for the cases when we have no vararg PARAMS:
992 static ERRORFUNC int bc_error(const char *msg)
994 IF_ERROR_RETURN_POSSIBLE(return) bc_error_fmt("%s", msg);
996 static ERRORFUNC int bc_error_bad_character(char c)
999 IF_ERROR_RETURN_POSSIBLE(return) bc_error("NUL character");
1000 IF_ERROR_RETURN_POSSIBLE(return) bc_error_fmt("bad character '%c'", c);
1002 static ERRORFUNC int bc_error_bad_expression(void)
1004 IF_ERROR_RETURN_POSSIBLE(return) bc_error("bad expression");
1006 static ERRORFUNC int bc_error_bad_token(void)
1008 IF_ERROR_RETURN_POSSIBLE(return) bc_error("bad token");
1010 static ERRORFUNC int bc_error_stack_has_too_few_elements(void)
1012 IF_ERROR_RETURN_POSSIBLE(return) bc_error("stack has too few elements");
1014 static ERRORFUNC int bc_error_variable_is_wrong_type(void)
1016 IF_ERROR_RETURN_POSSIBLE(return) bc_error("variable is wrong type");
1019 static BC_STATUS zbc_POSIX_requires(const char *msg)
1021 RETURN_STATUS(zbc_posix_error_fmt("POSIX requires %s", msg));
1023 #define zbc_POSIX_requires(...) (zbc_POSIX_requires(__VA_ARGS__) COMMA_SUCCESS)
1024 static BC_STATUS zbc_POSIX_does_not_allow(const char *msg)
1026 RETURN_STATUS(zbc_posix_error_fmt("%s%s", "POSIX does not allow ", msg));
1028 #define zbc_POSIX_does_not_allow(...) (zbc_POSIX_does_not_allow(__VA_ARGS__) COMMA_SUCCESS)
1029 static BC_STATUS zbc_POSIX_does_not_allow_bool_ops_this_is_bad(const char *msg)
1031 RETURN_STATUS(zbc_posix_error_fmt("%s%s %s", "POSIX does not allow ", "boolean operators; the following is bad:", msg));
1033 #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)
1034 static BC_STATUS zbc_POSIX_does_not_allow_empty_X_expression_in_for(const char *msg)
1036 RETURN_STATUS(zbc_posix_error_fmt("%san empty %s expression in a for loop", "POSIX does not allow ", msg));
1038 #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)
1041 static void bc_vec_grow(BcVec *v, size_t n)
1043 size_t cap = v->cap * 2;
1044 while (cap < v->len + n) cap *= 2;
1045 v->v = xrealloc(v->v, v->size * cap);
1049 static void bc_vec_init(BcVec *v, size_t esize, BcVecFree dtor)
1052 v->cap = BC_VEC_START_CAP;
1055 v->v = xmalloc(esize * BC_VEC_START_CAP);
1058 static void bc_char_vec_init(BcVec *v)
1060 bc_vec_init(v, sizeof(char), NULL);
1063 static void bc_vec_expand(BcVec *v, size_t req)
1066 v->v = xrealloc(v->v, v->size * req);
1071 static void bc_vec_pop(BcVec *v)
1075 v->dtor(v->v + (v->size * v->len));
1078 static void bc_vec_npop(BcVec *v, size_t n)
1083 size_t len = v->len - n;
1084 while (v->len > len) v->dtor(v->v + (v->size * --v->len));
1088 static void bc_vec_pop_all(BcVec *v)
1090 bc_vec_npop(v, v->len);
1093 static size_t bc_vec_push(BcVec *v, const void *data)
1095 size_t len = v->len;
1096 if (len >= v->cap) bc_vec_grow(v, 1);
1097 memmove(v->v + (v->size * len), data, v->size);
1102 // G.prog.results often needs "pop old operand, push result" idiom.
1103 // Can do this without a few extra ops
1104 static size_t bc_result_pop_and_push(const void *data)
1106 BcVec *v = &G.prog.results;
1108 size_t len = v->len - 1;
1110 last = v->v + (v->size * len);
1113 memmove(last, data, v->size);
1117 static size_t bc_vec_pushByte(BcVec *v, char data)
1119 return bc_vec_push(v, &data);
1122 static size_t bc_vec_pushZeroByte(BcVec *v)
1124 //return bc_vec_pushByte(v, '\0');
1126 return bc_vec_push(v, &const_int_0);
1129 static void bc_vec_pushAt(BcVec *v, const void *data, size_t idx)
1132 bc_vec_push(v, data);
1136 if (v->len == v->cap) bc_vec_grow(v, 1);
1138 ptr = v->v + v->size * idx;
1140 memmove(ptr + v->size, ptr, v->size * (v->len++ - idx));
1141 memmove(ptr, data, v->size);
1145 static void bc_vec_string(BcVec *v, size_t len, const char *str)
1148 bc_vec_expand(v, len + 1);
1149 memcpy(v->v, str, len);
1152 bc_vec_pushZeroByte(v);
1155 #if ENABLE_FEATURE_BC_SIGNALS && ENABLE_FEATURE_EDITING
1156 static void bc_vec_concat(BcVec *v, const char *str)
1160 if (v->len == 0) bc_vec_pushZeroByte(v);
1163 len = v->len + slen;
1165 if (v->cap < len) bc_vec_grow(v, slen);
1166 strcpy(v->v + v->len - 1, str);
1172 static void *bc_vec_item(const BcVec *v, size_t idx)
1174 return v->v + v->size * idx;
1177 static void *bc_vec_item_rev(const BcVec *v, size_t idx)
1179 return v->v + v->size * (v->len - idx - 1);
1182 static void *bc_vec_top(const BcVec *v)
1184 return v->v + v->size * (v->len - 1);
1187 static FAST_FUNC void bc_vec_free(void *vec)
1189 BcVec *v = (BcVec *) vec;
1194 static BcFunc* bc_program_func(size_t idx)
1196 return bc_vec_item(&G.prog.fns, idx);
1198 // BC_PROG_MAIN is zeroth element, so:
1199 #define bc_program_func_BC_PROG_MAIN() ((BcFunc*)(G.prog.fns.v))
1202 static BcFunc* bc_program_current_func(void)
1204 BcInstPtr *ip = bc_vec_top(&G.prog.exestack);
1205 BcFunc *func = bc_program_func(ip->func);
1210 static char** bc_program_str(size_t idx)
1214 BcFunc *func = bc_program_current_func();
1215 return bc_vec_item(&func->strs, idx);
1218 IF_DC(return bc_vec_item(&G.prog.strs, idx);)
1221 static char** bc_program_const(size_t idx)
1225 BcFunc *func = bc_program_current_func();
1226 return bc_vec_item(&func->consts, idx);
1229 IF_DC(return bc_vec_item(&G.prog.consts, idx);)
1232 static int bc_id_cmp(const void *e1, const void *e2)
1234 return strcmp(((const BcId *) e1)->name, ((const BcId *) e2)->name);
1237 static FAST_FUNC void bc_id_free(void *id)
1239 free(((BcId *) id)->name);
1242 static size_t bc_map_find_ge(const BcVec *v, const void *ptr)
1244 size_t low = 0, high = v->len;
1246 while (low < high) {
1247 size_t mid = (low + high) / 2;
1248 BcId *id = bc_vec_item(v, mid);
1249 int result = bc_id_cmp(ptr, id);
1262 static int bc_map_insert(BcVec *v, const void *ptr, size_t *i)
1264 size_t n = *i = bc_map_find_ge(v, ptr);
1267 bc_vec_push(v, ptr);
1268 else if (!bc_id_cmp(ptr, bc_vec_item(v, n)))
1269 return 0; // "was not inserted"
1271 bc_vec_pushAt(v, ptr, n);
1272 return 1; // "was inserted"
1276 static size_t bc_map_find_exact(const BcVec *v, const void *ptr)
1278 size_t i = bc_map_find_ge(v, ptr);
1279 if (i >= v->len) return BC_VEC_INVALID_IDX;
1280 return bc_id_cmp(ptr, bc_vec_item(v, i)) ? BC_VEC_INVALID_IDX : i;
1284 static void bc_num_setToZero(BcNum *n, size_t scale)
1291 static void bc_num_zero(BcNum *n)
1293 bc_num_setToZero(n, 0);
1296 static void bc_num_one(BcNum *n)
1298 bc_num_setToZero(n, 0);
1303 // Note: this also sets BcNum to zero
1304 static void bc_num_init(BcNum *n, size_t req)
1306 req = req >= BC_NUM_DEF_SIZE ? req : BC_NUM_DEF_SIZE;
1307 //memset(n, 0, sizeof(BcNum)); - cleared by assignments below
1308 n->num = xmalloc(req);
1315 static void bc_num_init_DEF_SIZE(BcNum *n)
1317 bc_num_init(n, BC_NUM_DEF_SIZE);
1320 static void bc_num_expand(BcNum *n, size_t req)
1322 req = req >= BC_NUM_DEF_SIZE ? req : BC_NUM_DEF_SIZE;
1324 n->num = xrealloc(n->num, req);
1329 static FAST_FUNC void bc_num_free(void *num)
1331 free(((BcNum *) num)->num);
1334 static void bc_num_copy(BcNum *d, BcNum *s)
1337 bc_num_expand(d, s->cap);
1341 memcpy(d->num, s->num, sizeof(BcDig) * d->len);
1345 static BC_STATUS zbc_num_ulong_abs(BcNum *n, unsigned long *result_p)
1348 unsigned long result;
1352 while (i > n->rdx) {
1353 unsigned long prev = result;
1354 result = result * 10 + n->num[--i];
1355 // Even overflowed N*10 can still satisfy N*10>=N. For example,
1356 // 0x1ff00000 * 10 is 0x13f600000,
1357 // or 0x3f600000 truncated to 32 bits. Which is larger.
1358 // However, (N*10)/8 < N check is always correct.
1359 if ((result / 8) < prev)
1360 RETURN_STATUS(bc_error("overflow"));
1364 RETURN_STATUS(BC_STATUS_SUCCESS);
1366 #define zbc_num_ulong_abs(...) (zbc_num_ulong_abs(__VA_ARGS__) COMMA_SUCCESS)
1368 static BC_STATUS zbc_num_ulong(BcNum *n, unsigned long *result_p)
1370 if (n->neg) RETURN_STATUS(bc_error("negative number"));
1372 RETURN_STATUS(zbc_num_ulong_abs(n, result_p));
1374 #define zbc_num_ulong(...) (zbc_num_ulong(__VA_ARGS__) COMMA_SUCCESS)
1376 #if ULONG_MAX == 0xffffffffUL // 10 digits: 4294967295
1377 # define ULONG_NUM_BUFSIZE (10 > BC_NUM_DEF_SIZE ? 10 : BC_NUM_DEF_SIZE)
1378 #elif ULONG_MAX == 0xffffffffffffffffULL // 20 digits: 18446744073709551615
1379 # define ULONG_NUM_BUFSIZE (20 > BC_NUM_DEF_SIZE ? 20 : BC_NUM_DEF_SIZE)
1381 // minimum BC_NUM_DEF_SIZE, so that bc_num_expand() in bc_num_ulong2num()
1382 // would not hit realloc() code path - not good if num[] is not malloced
1384 static void bc_num_ulong2num(BcNum *n, unsigned long val)
1390 if (val == 0) return;
1392 bc_num_expand(n, ULONG_NUM_BUFSIZE);
1399 if (val == 0) break;
1403 static void bc_num_subArrays(BcDig *restrict a, BcDig *restrict b, size_t len)
1406 for (i = 0; i < len; ++i) {
1408 for (j = i; a[j] < 0;) {
1415 static ssize_t bc_num_compare(BcDig *restrict a, BcDig *restrict b, size_t len)
1433 #define BC_NUM_NEG(n, neg) ((((ssize_t)(n)) ^ -((ssize_t)(neg))) + (neg))
1434 #define BC_NUM_ONE(n) ((n)->len == 1 && (n)->rdx == 0 && (n)->num[0] == 1)
1435 #define BC_NUM_INT(n) ((n)->len - (n)->rdx)
1436 //#define BC_NUM_AREQ(a, b) (BC_MAX((a)->rdx, (b)->rdx) + BC_MAX(BC_NUM_INT(a), BC_NUM_INT(b)) + 1)
1437 static /*ALWAYS_INLINE*/ size_t BC_NUM_AREQ(BcNum *a, BcNum *b)
1439 return BC_MAX(a->rdx, b->rdx) + BC_MAX(BC_NUM_INT(a), BC_NUM_INT(b)) + 1;
1441 //#define BC_NUM_MREQ(a, b, scale) (BC_NUM_INT(a) + BC_NUM_INT(b) + BC_MAX((scale), (a)->rdx + (b)->rdx) + 1)
1442 static /*ALWAYS_INLINE*/ size_t BC_NUM_MREQ(BcNum *a, BcNum *b, size_t scale)
1444 return BC_NUM_INT(a) + BC_NUM_INT(b) + BC_MAX(scale, a->rdx + b->rdx) + 1;
1447 static ssize_t bc_num_cmp(BcNum *a, BcNum *b)
1449 size_t i, min, a_int, b_int, diff;
1450 BcDig *max_num, *min_num;
1454 if (a == b) return 0;
1455 if (a->len == 0) return BC_NUM_NEG(!!b->len, !b->neg);
1456 if (b->len == 0) return BC_NUM_NEG(1, a->neg);
1458 if (a->neg != b->neg) // signs of a and b differ
1459 // +a,-b = a>b = 1 or -a,+b = a<b = -1
1460 return (int)b->neg - (int)a->neg;
1461 neg = a->neg; // 1 if both negative, 0 if both positive
1463 a_int = BC_NUM_INT(a);
1464 b_int = BC_NUM_INT(b);
1467 if (a_int != 0) return (ssize_t) a_int;
1469 a_max = (a->rdx > b->rdx);
1472 diff = a->rdx - b->rdx;
1473 max_num = a->num + diff;
1475 // neg = (a_max == neg); - NOP (maps 1->1 and 0->0)
1478 diff = b->rdx - a->rdx;
1479 max_num = b->num + diff;
1481 neg = !neg; // same as "neg = (a_max == neg)"
1484 cmp = bc_num_compare(max_num, min_num, b_int + min);
1485 if (cmp != 0) return BC_NUM_NEG(cmp, neg);
1487 for (max_num -= diff, i = diff - 1; i < diff; --i) {
1488 if (max_num[i]) return BC_NUM_NEG(1, neg);
1494 static void bc_num_truncate(BcNum *n, size_t places)
1496 if (places == 0) return;
1502 memmove(n->num, n->num + places, n->len * sizeof(BcDig));
1506 static void bc_num_extend(BcNum *n, size_t places)
1508 size_t len = n->len + places;
1511 if (n->cap < len) bc_num_expand(n, len);
1513 memmove(n->num + places, n->num, sizeof(BcDig) * n->len);
1514 memset(n->num, 0, sizeof(BcDig) * places);
1521 static void bc_num_clean(BcNum *n)
1523 while (n->len > 0 && n->num[n->len - 1] == 0) --n->len;
1526 else if (n->len < n->rdx)
1530 static void bc_num_retireMul(BcNum *n, size_t scale, bool neg1, bool neg2)
1533 bc_num_extend(n, scale - n->rdx);
1535 bc_num_truncate(n, n->rdx - scale);
1538 if (n->len != 0) n->neg = !neg1 != !neg2;
1541 static void bc_num_split(BcNum *restrict n, size_t idx, BcNum *restrict a,
1545 b->len = n->len - idx;
1547 a->rdx = b->rdx = 0;
1549 memcpy(b->num, n->num + idx, b->len * sizeof(BcDig));
1550 memcpy(a->num, n->num, idx * sizeof(BcDig));
1560 static BC_STATUS zbc_num_shift(BcNum *n, size_t places)
1562 if (places == 0 || n->len == 0) RETURN_STATUS(BC_STATUS_SUCCESS);
1564 // This check makes sense only if size_t is (much) larger than BC_MAX_NUM.
1565 if (SIZE_MAX > (BC_MAX_NUM | 0xff)) {
1566 if (places + n->len > BC_MAX_NUM)
1567 RETURN_STATUS(bc_error("number too long: must be [1,"BC_MAX_NUM_STR"]"));
1570 if (n->rdx >= places)
1573 bc_num_extend(n, places - n->rdx);
1579 RETURN_STATUS(BC_STATUS_SUCCESS);
1581 #define zbc_num_shift(...) (zbc_num_shift(__VA_ARGS__) COMMA_SUCCESS)
1583 typedef BC_STATUS (*BcNumBinaryOp)(BcNum *, BcNum *, BcNum *, size_t) FAST_FUNC;
1585 static BC_STATUS zbc_num_binary(BcNum *a, BcNum *b, BcNum *c, size_t scale,
1586 BcNumBinaryOp op, size_t req)
1589 BcNum num2, *ptr_a, *ptr_b;
1594 memcpy(ptr_a, c, sizeof(BcNum));
1602 memcpy(ptr_b, c, sizeof(BcNum));
1609 bc_num_init(c, req);
1611 bc_num_expand(c, req);
1613 s = BC_STATUS_SUCCESS;
1614 IF_ERROR_RETURN_POSSIBLE(s =) op(ptr_a, ptr_b, c, scale);
1616 if (init) bc_num_free(&num2);
1620 #define zbc_num_binary(...) (zbc_num_binary(__VA_ARGS__) COMMA_SUCCESS)
1622 static FAST_FUNC BC_STATUS zbc_num_a(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale);
1623 static FAST_FUNC BC_STATUS zbc_num_s(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale);
1624 static FAST_FUNC BC_STATUS zbc_num_p(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale);
1625 static FAST_FUNC BC_STATUS zbc_num_m(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale);
1626 static FAST_FUNC BC_STATUS zbc_num_d(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale);
1627 static FAST_FUNC BC_STATUS zbc_num_rem(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale);
1629 static FAST_FUNC BC_STATUS zbc_num_add(BcNum *a, BcNum *b, BcNum *c, size_t scale)
1631 BcNumBinaryOp op = (!a->neg == !b->neg) ? zbc_num_a : zbc_num_s;
1633 RETURN_STATUS(zbc_num_binary(a, b, c, false, op, BC_NUM_AREQ(a, b)));
1636 static FAST_FUNC BC_STATUS zbc_num_sub(BcNum *a, BcNum *b, BcNum *c, size_t scale)
1638 BcNumBinaryOp op = (!a->neg == !b->neg) ? zbc_num_s : zbc_num_a;
1640 RETURN_STATUS(zbc_num_binary(a, b, c, true, op, BC_NUM_AREQ(a, b)));
1643 static FAST_FUNC BC_STATUS zbc_num_mul(BcNum *a, BcNum *b, BcNum *c, size_t scale)
1645 size_t req = BC_NUM_MREQ(a, b, scale);
1646 RETURN_STATUS(zbc_num_binary(a, b, c, scale, zbc_num_m, req));
1649 static FAST_FUNC BC_STATUS zbc_num_div(BcNum *a, BcNum *b, BcNum *c, size_t scale)
1651 size_t req = BC_NUM_MREQ(a, b, scale);
1652 RETURN_STATUS(zbc_num_binary(a, b, c, scale, zbc_num_d, req));
1655 static FAST_FUNC BC_STATUS zbc_num_mod(BcNum *a, BcNum *b, BcNum *c, size_t scale)
1657 size_t req = BC_NUM_MREQ(a, b, scale);
1658 RETURN_STATUS(zbc_num_binary(a, b, c, scale, zbc_num_rem, req));
1661 static FAST_FUNC BC_STATUS zbc_num_pow(BcNum *a, BcNum *b, BcNum *c, size_t scale)
1663 RETURN_STATUS(zbc_num_binary(a, b, c, scale, zbc_num_p, a->len * b->len + 1));
1666 static const BcNumBinaryOp zbc_program_ops[] = {
1667 zbc_num_pow, zbc_num_mul, zbc_num_div, zbc_num_mod, zbc_num_add, zbc_num_sub,
1669 #define zbc_num_add(...) (zbc_num_add(__VA_ARGS__) COMMA_SUCCESS)
1670 #define zbc_num_sub(...) (zbc_num_sub(__VA_ARGS__) COMMA_SUCCESS)
1671 #define zbc_num_mul(...) (zbc_num_mul(__VA_ARGS__) COMMA_SUCCESS)
1672 #define zbc_num_div(...) (zbc_num_div(__VA_ARGS__) COMMA_SUCCESS)
1673 #define zbc_num_mod(...) (zbc_num_mod(__VA_ARGS__) COMMA_SUCCESS)
1674 #define zbc_num_pow(...) (zbc_num_pow(__VA_ARGS__) COMMA_SUCCESS)
1676 static BC_STATUS zbc_num_inv(BcNum *a, BcNum *b, size_t scale)
1685 RETURN_STATUS(zbc_num_div(&one, a, b, scale));
1687 #define zbc_num_inv(...) (zbc_num_inv(__VA_ARGS__) COMMA_SUCCESS)
1689 static FAST_FUNC BC_STATUS zbc_num_a(BcNum *a, BcNum *b, BcNum *restrict c, size_t sub)
1691 BcDig *ptr, *ptr_a, *ptr_b, *ptr_c;
1692 size_t i, max, min_rdx, min_int, diff, a_int, b_int;
1695 // Because this function doesn't need to use scale (per the bc spec),
1696 // I am hijacking it to say whether it's doing an add or a subtract.
1700 if (sub && c->len) c->neg = !c->neg;
1701 RETURN_STATUS(BC_STATUS_SUCCESS);
1705 RETURN_STATUS(BC_STATUS_SUCCESS);
1709 c->rdx = BC_MAX(a->rdx, b->rdx);
1710 min_rdx = BC_MIN(a->rdx, b->rdx);
1713 if (a->rdx > b->rdx) {
1714 diff = a->rdx - b->rdx;
1716 ptr_a = a->num + diff;
1719 diff = b->rdx - a->rdx;
1722 ptr_b = b->num + diff;
1726 for (i = 0; i < diff; ++i, ++c->len)
1730 a_int = BC_NUM_INT(a);
1731 b_int = BC_NUM_INT(b);
1733 if (a_int > b_int) {
1744 for (i = 0; i < min_rdx + min_int; ++i) {
1745 unsigned in = (unsigned)ptr_a[i] + (unsigned)ptr_b[i] + carry;
1747 ptr_c[i] = (BcDig)(in % 10);
1749 for (; i < max + min_rdx; ++i) {
1750 unsigned in = (unsigned)ptr[i] + carry;
1752 ptr_c[i] = (BcDig)(in % 10);
1756 if (carry != 0) c->num[c->len++] = (BcDig) carry;
1758 RETURN_STATUS(BC_STATUS_SUCCESS); // can't make void, see zbc_num_binary()
1761 static FAST_FUNC BC_STATUS zbc_num_s(BcNum *a, BcNum *b, BcNum *restrict c, size_t sub)
1764 BcNum *minuend, *subtrahend;
1766 bool aneg, bneg, neg;
1768 // Because this function doesn't need to use scale (per the bc spec),
1769 // I am hijacking it to say whether it's doing an add or a subtract.
1773 if (sub && c->len) c->neg = !c->neg;
1774 RETURN_STATUS(BC_STATUS_SUCCESS);
1778 RETURN_STATUS(BC_STATUS_SUCCESS);
1783 a->neg = b->neg = false;
1785 cmp = bc_num_cmp(a, b);
1791 bc_num_setToZero(c, BC_MAX(a->rdx, b->rdx));
1792 RETURN_STATUS(BC_STATUS_SUCCESS);
1800 if (sub) neg = !neg;
1805 bc_num_copy(c, minuend);
1808 if (c->rdx < subtrahend->rdx) {
1809 bc_num_extend(c, subtrahend->rdx - c->rdx);
1812 start = c->rdx - subtrahend->rdx;
1814 bc_num_subArrays(c->num + start, subtrahend->num, subtrahend->len);
1818 RETURN_STATUS(BC_STATUS_SUCCESS); // can't make void, see zbc_num_binary()
1821 static FAST_FUNC BC_STATUS zbc_num_k(BcNum *restrict a, BcNum *restrict b,
1823 #define zbc_num_k(...) (zbc_num_k(__VA_ARGS__) COMMA_SUCCESS)
1826 size_t max = BC_MAX(a->len, b->len), max2 = (max + 1) / 2;
1827 BcNum l1, h1, l2, h2, m2, m1, z0, z1, z2, temp;
1830 if (a->len == 0 || b->len == 0) {
1832 RETURN_STATUS(BC_STATUS_SUCCESS);
1834 aone = BC_NUM_ONE(a);
1835 if (aone || BC_NUM_ONE(b)) {
1836 bc_num_copy(c, aone ? b : a);
1837 RETURN_STATUS(BC_STATUS_SUCCESS);
1840 if (a->len + b->len < BC_NUM_KARATSUBA_LEN
1841 || a->len < BC_NUM_KARATSUBA_LEN
1842 || b->len < BC_NUM_KARATSUBA_LEN
1846 bc_num_expand(c, a->len + b->len + 1);
1848 memset(c->num, 0, sizeof(BcDig) * c->cap);
1851 for (i = 0; i < b->len; ++i) {
1853 for (j = 0; j < a->len; ++j) {
1854 unsigned in = c->num[i + j];
1855 in += (unsigned)a->num[j] * (unsigned)b->num[i] + carry;
1856 // note: compilers prefer _unsigned_ div/const
1858 c->num[i + j] = (BcDig)(in % 10);
1861 c->num[i + j] += (BcDig) carry;
1862 len = BC_MAX(len, i + j + !!carry);
1864 #if ENABLE_FEATURE_BC_SIGNALS
1866 // a*a <- without check below, this will not be interruptible
1867 if (G_interrupt) return BC_STATUS_FAILURE;
1873 RETURN_STATUS(BC_STATUS_SUCCESS);
1876 bc_num_init(&l1, max);
1877 bc_num_init(&h1, max);
1878 bc_num_init(&l2, max);
1879 bc_num_init(&h2, max);
1880 bc_num_init(&m1, max);
1881 bc_num_init(&m2, max);
1882 bc_num_init(&z0, max);
1883 bc_num_init(&z1, max);
1884 bc_num_init(&z2, max);
1885 bc_num_init(&temp, max + max);
1887 bc_num_split(a, max2, &l1, &h1);
1888 bc_num_split(b, max2, &l2, &h2);
1890 s = zbc_num_add(&h1, &l1, &m1, 0);
1892 s = zbc_num_add(&h2, &l2, &m2, 0);
1895 s = zbc_num_k(&h1, &h2, &z0);
1897 s = zbc_num_k(&m1, &m2, &z1);
1899 s = zbc_num_k(&l1, &l2, &z2);
1902 s = zbc_num_sub(&z1, &z0, &temp, 0);
1904 s = zbc_num_sub(&temp, &z2, &z1, 0);
1907 s = zbc_num_shift(&z0, max2 * 2);
1909 s = zbc_num_shift(&z1, max2);
1911 s = zbc_num_add(&z0, &z1, &temp, 0);
1913 s = zbc_num_add(&temp, &z2, c, 0);
1928 static FAST_FUNC BC_STATUS zbc_num_m(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale)
1932 size_t maxrdx = BC_MAX(a->rdx, b->rdx);
1934 scale = BC_MAX(scale, a->rdx);
1935 scale = BC_MAX(scale, b->rdx);
1936 scale = BC_MIN(a->rdx + b->rdx, scale);
1937 maxrdx = BC_MAX(maxrdx, scale);
1939 bc_num_init(&cpa, a->len);
1940 bc_num_init(&cpb, b->len);
1942 bc_num_copy(&cpa, a);
1943 bc_num_copy(&cpb, b);
1944 cpa.neg = cpb.neg = false;
1946 s = zbc_num_shift(&cpa, maxrdx);
1948 s = zbc_num_shift(&cpb, maxrdx);
1950 s = zbc_num_k(&cpa, &cpb, c);
1954 bc_num_expand(c, c->len + maxrdx);
1956 if (c->len < maxrdx) {
1957 memset(c->num + c->len, 0, (c->cap - c->len) * sizeof(BcDig));
1962 bc_num_retireMul(c, scale, a->neg, b->neg);
1968 #define zbc_num_m(...) (zbc_num_m(__VA_ARGS__) COMMA_SUCCESS)
1970 static FAST_FUNC BC_STATUS zbc_num_d(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale)
1977 RETURN_STATUS(bc_error("divide by zero"));
1979 bc_num_setToZero(c, scale);
1980 RETURN_STATUS(BC_STATUS_SUCCESS);
1982 if (BC_NUM_ONE(b)) {
1984 bc_num_retireMul(c, scale, a->neg, b->neg);
1985 RETURN_STATUS(BC_STATUS_SUCCESS);
1988 bc_num_init(&cp, BC_NUM_MREQ(a, b, scale));
1989 bc_num_copy(&cp, a);
1993 bc_num_expand(&cp, len + 2);
1994 bc_num_extend(&cp, len - cp.len);
1997 if (b->rdx > cp.rdx) bc_num_extend(&cp, b->rdx - cp.rdx);
1999 if (scale > cp.rdx) bc_num_extend(&cp, scale - cp.rdx);
2001 if (b->rdx == b->len) {
2003 if (len == 0) break;
2005 if (b->num[len] != 0)
2011 if (cp.cap == cp.len) bc_num_expand(&cp, cp.len + 1);
2013 // We want an extra zero in front to make things simpler.
2014 cp.num[cp.len++] = 0;
2017 bc_num_expand(c, cp.len);
2020 memset(c->num + end, 0, (c->cap - end) * sizeof(BcDig));
2024 s = BC_STATUS_SUCCESS;
2025 for (i = end - 1; i < end; --i) {
2028 for (q = 0; n[len] != 0 || bc_num_compare(n, b->num, len) >= 0; ++q)
2029 bc_num_subArrays(n, b->num, len);
2031 #if ENABLE_FEATURE_BC_SIGNALS
2034 // 1/a <- without check below, this will not be interruptible
2036 s = BC_STATUS_FAILURE;
2042 bc_num_retireMul(c, scale, a->neg, b->neg);
2047 #define zbc_num_d(...) (zbc_num_d(__VA_ARGS__) COMMA_SUCCESS)
2049 static FAST_FUNC BC_STATUS zbc_num_r(BcNum *a, BcNum *b, BcNum *restrict c,
2050 BcNum *restrict d, size_t scale, size_t ts)
2057 RETURN_STATUS(bc_error("divide by zero"));
2060 bc_num_setToZero(d, ts);
2061 RETURN_STATUS(BC_STATUS_SUCCESS);
2064 bc_num_init(&temp, d->cap);
2065 s = zbc_num_d(a, b, c, scale);
2068 if (scale != 0) scale = ts;
2070 s = zbc_num_m(c, b, &temp, scale);
2072 s = zbc_num_sub(a, &temp, d, scale);
2075 if (ts > d->rdx && d->len) bc_num_extend(d, ts - d->rdx);
2078 bc_num_retireMul(d, ts, a->neg, b->neg);
2084 #define zbc_num_r(...) (zbc_num_r(__VA_ARGS__) COMMA_SUCCESS)
2086 static FAST_FUNC BC_STATUS zbc_num_rem(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale)
2090 size_t ts = BC_MAX(scale + b->rdx, a->rdx), len = BC_NUM_MREQ(a, b, ts);
2092 bc_num_init(&c1, len);
2093 s = zbc_num_r(a, b, &c1, c, scale, ts);
2098 #define zbc_num_rem(...) (zbc_num_rem(__VA_ARGS__) COMMA_SUCCESS)
2100 static FAST_FUNC BC_STATUS zbc_num_p(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale)
2102 BcStatus s = BC_STATUS_SUCCESS;
2105 size_t i, powrdx, resrdx;
2108 // GNU bc does not allow 2^2.0 - we do
2109 for (i = 0; i < b->rdx; i++)
2111 RETURN_STATUS(bc_error("not an integer"));
2115 RETURN_STATUS(BC_STATUS_SUCCESS);
2118 bc_num_setToZero(c, scale);
2119 RETURN_STATUS(BC_STATUS_SUCCESS);
2121 if (BC_NUM_ONE(b)) {
2125 s = zbc_num_inv(a, c, scale);
2130 s = zbc_num_ulong_abs(b, &pow);
2131 if (s) RETURN_STATUS(s);
2132 // b is not used beyond this point
2134 bc_num_init(©, a->len);
2135 bc_num_copy(©, a);
2140 if (a->rdx * pow < scale)
2141 scale = a->rdx * pow;
2145 for (powrdx = a->rdx; !(pow & 1); pow >>= 1) {
2147 s = zbc_num_mul(©, ©, ©, powrdx);
2149 // Not needed: zbc_num_mul() has a check for ^C:
2150 //if (G_interrupt) {
2151 // s = BC_STATUS_FAILURE;
2156 bc_num_copy(c, ©);
2158 for (resrdx = powrdx, pow >>= 1; pow != 0; pow >>= 1) {
2160 s = zbc_num_mul(©, ©, ©, powrdx);
2165 s = zbc_num_mul(c, ©, c, resrdx);
2168 // Not needed: zbc_num_mul() has a check for ^C:
2169 //if (G_interrupt) {
2170 // s = BC_STATUS_FAILURE;
2176 s = zbc_num_inv(c, c, scale);
2180 if (c->rdx > scale) bc_num_truncate(c, c->rdx - scale);
2182 // We can't use bc_num_clean() here.
2183 for (i = 0; i < c->len; ++i)
2186 bc_num_setToZero(c, scale);
2193 #define zbc_num_p(...) (zbc_num_p(__VA_ARGS__) COMMA_SUCCESS)
2195 static BC_STATUS zbc_num_sqrt(BcNum *a, BcNum *restrict b, size_t scale)
2198 BcNum num1, num2, half, f, fprime, *x0, *x1, *temp;
2199 size_t pow, len, digs, digs1, resrdx, req, times = 0;
2200 ssize_t cmp = 1, cmp1 = SSIZE_MAX, cmp2 = SSIZE_MAX;
2202 req = BC_MAX(scale, a->rdx) + ((BC_NUM_INT(a) + 1) >> 1) + 1;
2203 bc_num_expand(b, req);
2206 bc_num_setToZero(b, scale);
2207 RETURN_STATUS(BC_STATUS_SUCCESS);
2210 RETURN_STATUS(bc_error("negative number"));
2212 if (BC_NUM_ONE(a)) {
2214 bc_num_extend(b, scale);
2215 RETURN_STATUS(BC_STATUS_SUCCESS);
2218 scale = BC_MAX(scale, a->rdx) + 1;
2219 len = a->len + scale;
2221 bc_num_init(&num1, len);
2222 bc_num_init(&num2, len);
2223 bc_num_init_DEF_SIZE(&half);
2229 bc_num_init(&f, len);
2230 bc_num_init(&fprime, len);
2236 pow = BC_NUM_INT(a);
2244 pow -= 2 - (pow & 1);
2246 bc_num_extend(x0, pow);
2248 // Make sure to move the radix back.
2252 x0->rdx = digs = digs1 = 0;
2254 len = BC_NUM_INT(x0) + resrdx - 1;
2256 while (cmp != 0 || digs < len) {
2257 s = zbc_num_div(a, x0, &f, resrdx);
2259 s = zbc_num_add(x0, &f, &fprime, resrdx);
2261 s = zbc_num_mul(&fprime, &half, x1, resrdx);
2264 cmp = bc_num_cmp(x1, x0);
2265 digs = x1->len - (unsigned long long) llabs(cmp);
2267 if (cmp == cmp2 && digs == digs1)
2272 resrdx += times > 4;
2285 if (b->rdx > scale) bc_num_truncate(b, b->rdx - scale);
2287 bc_num_free(&fprime);
2294 #define zbc_num_sqrt(...) (zbc_num_sqrt(__VA_ARGS__) COMMA_SUCCESS)
2296 static BC_STATUS zbc_num_divmod(BcNum *a, BcNum *b, BcNum *c, BcNum *d,
2302 size_t ts = BC_MAX(scale + b->rdx, a->rdx), len = BC_NUM_MREQ(a, b, ts);
2305 memcpy(&num2, c, sizeof(BcNum));
2307 bc_num_init(c, len);
2311 bc_num_expand(c, len);
2314 s = zbc_num_r(ptr_a, b, c, d, scale, ts);
2316 if (init) bc_num_free(&num2);
2320 #define zbc_num_divmod(...) (zbc_num_divmod(__VA_ARGS__) COMMA_SUCCESS)
2323 static BC_STATUS zdc_num_modexp(BcNum *a, BcNum *b, BcNum *c, BcNum *restrict d)
2326 BcNum base, exp, two, temp;
2330 RETURN_STATUS(bc_error("divide by zero"));
2331 if (a->rdx || b->rdx || c->rdx)
2332 RETURN_STATUS(bc_error("not an integer"));
2334 RETURN_STATUS(bc_error("negative number"));
2336 bc_num_expand(d, c->len);
2337 bc_num_init(&base, c->len);
2338 bc_num_init(&exp, b->len);
2339 bc_num_init(&temp, b->len);
2341 two.cap = ARRAY_SIZE(two_digs);
2348 s = zbc_num_rem(a, c, &base, 0);
2350 bc_num_copy(&exp, b);
2352 while (exp.len != 0) {
2353 s = zbc_num_divmod(&exp, &two, &exp, &temp, 0);
2356 if (BC_NUM_ONE(&temp)) {
2357 s = zbc_num_mul(d, &base, &temp, 0);
2359 s = zbc_num_rem(&temp, c, d, 0);
2363 s = zbc_num_mul(&base, &base, &temp, 0);
2365 s = zbc_num_rem(&temp, c, &base, 0);
2374 #define zdc_num_modexp(...) (zdc_num_modexp(__VA_ARGS__) COMMA_SUCCESS)
2377 static FAST_FUNC void bc_string_free(void *string)
2379 free(*(char**)string);
2382 static void bc_func_init(BcFunc *f)
2384 bc_char_vec_init(&f->code);
2385 IF_BC(bc_vec_init(&f->labels, sizeof(size_t), NULL);)
2386 IF_BC(bc_vec_init(&f->autos, sizeof(BcId), bc_id_free);)
2387 IF_BC(bc_vec_init(&f->strs, sizeof(char *), bc_string_free);)
2388 IF_BC(bc_vec_init(&f->consts, sizeof(char *), bc_string_free);)
2389 IF_BC(f->nparams = 0;)
2392 static FAST_FUNC void bc_func_free(void *func)
2394 BcFunc *f = (BcFunc *) func;
2395 bc_vec_free(&f->code);
2396 IF_BC(bc_vec_free(&f->labels);)
2397 IF_BC(bc_vec_free(&f->autos);)
2398 IF_BC(bc_vec_free(&f->strs);)
2399 IF_BC(bc_vec_free(&f->consts);)
2402 static void bc_array_expand(BcVec *a, size_t len);
2404 static void bc_array_init(BcVec *a, bool nums)
2407 bc_vec_init(a, sizeof(BcNum), bc_num_free);
2409 bc_vec_init(a, sizeof(BcVec), bc_vec_free);
2410 bc_array_expand(a, 1);
2413 static void bc_array_expand(BcVec *a, size_t len)
2415 if (a->dtor == bc_num_free
2416 // && a->size == sizeof(BcNum) - always true
2419 while (len > a->len) {
2420 bc_num_init_DEF_SIZE(&n);
2425 while (len > a->len) {
2426 bc_array_init(&v, true);
2432 static void bc_array_copy(BcVec *d, const BcVec *s)
2438 bc_vec_expand(d, s->cap);
2443 for (i = 0; i < s->len; i++, dnum++, snum++) {
2444 bc_num_init(dnum, snum->len);
2445 bc_num_copy(dnum, snum);
2450 static void dc_result_copy(BcResult *d, BcResult *src)
2455 case XC_RESULT_TEMP:
2456 case XC_RESULT_IBASE:
2457 case XC_RESULT_SCALE:
2458 case XC_RESULT_OBASE:
2459 bc_num_init(&d->d.n, src->d.n.len);
2460 bc_num_copy(&d->d.n, &src->d.n);
2463 case XC_RESULT_ARRAY:
2464 case XC_RESULT_ARRAY_ELEM:
2465 d->d.id.name = xstrdup(src->d.id.name);
2467 case XC_RESULT_CONSTANT:
2468 IF_BC(case BC_RESULT_LAST:)
2469 IF_BC(case BC_RESULT_ONE:)
2471 memcpy(&d->d.n, &src->d.n, sizeof(BcNum));
2477 static FAST_FUNC void bc_result_free(void *result)
2479 BcResult *r = (BcResult *) result;
2482 case XC_RESULT_TEMP:
2483 case XC_RESULT_IBASE:
2484 case XC_RESULT_SCALE:
2485 case XC_RESULT_OBASE:
2486 bc_num_free(&r->d.n);
2489 case XC_RESULT_ARRAY:
2490 case XC_RESULT_ARRAY_ELEM:
2499 static int bad_input_byte(char c)
2501 if ((c < ' ' && c != '\t' && c != '\r' && c != '\n') // also allow '\v' '\f'?
2504 bc_error_fmt("illegal character 0x%02x", c);
2510 // Note: it _appends_ data from fp to vec.
2511 static void bc_read_line(BcVec *vec, FILE *fp)
2516 #if ENABLE_FEATURE_BC_SIGNALS
2517 if (G_interrupt) { // ^C was pressed
2520 // ^C while running a script (bc SCRIPT): die.
2521 // We do not return to interactive prompt:
2522 // user might be running us from a shell,
2523 // and SCRIPT might be intended to terminate
2524 // (e.g. contain a "halt" stmt).
2525 // ^C dropping user into a bc prompt instead of
2526 // the shell would be unexpected.
2529 // ^C while interactive input
2531 // GNU bc says "interrupted execution."
2532 // GNU dc says "Interrupt!"
2533 fputs("\ninterrupted execution\n", stderr);
2536 # if ENABLE_FEATURE_EDITING
2537 if (G_ttyin && fp == stdin) {
2539 # define line_buf bb_common_bufsiz1
2540 n = read_line_input(G.line_input_state, "", line_buf, COMMON_BUFSIZE);
2541 if (n <= 0) { // read errors or EOF, or ^D, or ^C
2544 bc_vec_pushZeroByte(vec); // ^D or EOF (or error)
2549 char c = line_buf[i++];
2551 if (bad_input_byte(c)) goto again;
2553 bc_vec_concat(vec, line_buf);
2561 size_t len = vec->len;
2564 #if ENABLE_FEATURE_BC_SIGNALS
2566 // ^C was pressed: ignore entire line, get another one
2571 do c = fgetc(fp); while (c == '\0');
2574 bb_perror_msg_and_die("input error");
2575 // Note: EOF does not append '\n'
2578 bad_chars |= bad_input_byte(c);
2579 bc_vec_pushByte(vec, (char)c);
2580 } while (c != '\n');
2583 // Bad chars on this line
2584 if (!G.prs.filename) { // stdin
2585 // ignore entire line, get another one
2589 bb_perror_msg_and_die("file '%s' is not text", G.prs.filename);
2591 bc_vec_pushZeroByte(vec);
2599 static bool bc_num_strValid(const char *val, size_t base)
2604 b = (BcDig)(base <= 10 ? base + '0' : base - 10 + 'A');
2611 if (radix) return false;
2615 if (c < '0' || c >= b || (c > '9' && c < 'A'))
2621 // Note: n is already "bc_num_zero()"ed,
2622 // leading zeroes in "val" are removed
2623 static void bc_num_parseDecimal(BcNum *n, const char *val)
2632 bc_num_expand(n, len);
2634 ptr = strchr(val, '.');
2638 n->rdx = (size_t)((val + len) - (ptr + 1));
2640 for (i = 0; val[i]; ++i) {
2641 if (val[i] != '0' && val[i] != '.') {
2642 // Not entirely zero value - convert it, and exit
2645 n->num[n->len] = val[i] - '0';
2649 if (val[--i] == '.') goto skip_dot;
2654 // if for() exits without hitting if(), the value is entirely zero
2657 // Note: n is already "bc_num_zero()"ed,
2658 // leading zeroes in "val" are removed
2659 static void bc_num_parseBase(BcNum *n, const char *val, unsigned base_t)
2662 BcNum temp, mult, result;
2664 BcDig base_digs[ULONG_NUM_BUFSIZE];
2669 for (i = 0; ; ++i) {
2672 if (val[i] != '.' && val[i] != '0')
2676 bc_num_init_DEF_SIZE(&temp);
2677 bc_num_init_DEF_SIZE(&mult);
2678 base.cap = ARRAY_SIZE(base_digs);
2679 base.num = base_digs;
2680 bc_num_ulong2num(&base, base_t);
2684 if (c == '\0') goto int_err;
2685 if (c == '.') break;
2687 v = (unsigned long) (c <= '9' ? c - '0' : c - 'A' + 10);
2689 s = zbc_num_mul(n, &base, &mult, 0);
2690 if (s) goto int_err;
2691 bc_num_ulong2num(&temp, v);
2692 s = zbc_num_add(&mult, &temp, n, 0);
2693 if (s) goto int_err;
2696 bc_num_init(&result, base.len);
2697 //bc_num_zero(&result); - already is
2703 if (c == '\0') break;
2706 v = (unsigned long) (c <= '9' ? c - '0' : c - 'A' + 10);
2708 s = zbc_num_mul(&result, &base, &result, 0);
2710 bc_num_ulong2num(&temp, v);
2711 s = zbc_num_add(&result, &temp, &result, 0);
2713 s = zbc_num_mul(&mult, &base, &mult, 0);
2717 s = zbc_num_div(&result, &mult, &result, digits);
2719 s = zbc_num_add(n, &result, n, digits);
2723 if (n->rdx < digits)
2724 bc_num_extend(n, digits - n->rdx);
2728 bc_num_free(&result);
2734 static BC_STATUS zbc_num_parse(BcNum *n, const char *val, unsigned base_t)
2736 if (!bc_num_strValid(val, base_t))
2737 RETURN_STATUS(bc_error("bad number string"));
2740 while (*val == '0') val++;
2743 bc_num_parseDecimal(n, val);
2745 bc_num_parseBase(n, val, base_t);
2747 RETURN_STATUS(BC_STATUS_SUCCESS);
2749 #define zbc_num_parse(...) (zbc_num_parse(__VA_ARGS__) COMMA_SUCCESS)
2751 static void bc_lex_lineComment(void)
2753 BcLex *l = &G.prs.l;
2754 // Try: echo -n '#foo' | bc
2756 l->lex = XC_LEX_WHITESPACE;
2758 while (i < l->len && l->buf[i] != '\n')
2763 static void bc_lex_whitespace(void)
2765 BcLex *l = &G.prs.l;
2766 l->lex = XC_LEX_WHITESPACE;
2768 char c = l->buf[l->i];
2769 if (c == '\n') // this is XC_LEX_NLINE, not XC_LEX_WHITESPACE
2777 static BC_STATUS zbc_lex_number(char start)
2779 BcLex *l = &G.prs.l;
2780 const char *buf = l->buf + l->i;
2781 size_t len, i, ccnt;
2784 pt = (start == '.');
2785 l->lex = XC_LEX_NUMBER;
2791 if (c == '\\' && buf[i + 1] == '\n') {
2793 //number_of_backslashes++ - see comment below
2796 if (!isdigit(c) && (c < 'A' || c > 'F')) {
2797 if (c != '.') break;
2798 // if '.' was already seen, stop on second one:
2802 // buf[i] is one of "0-9A-F."
2807 //ccnt is the number of chars in the number string, excluding possible
2808 //trailing "[\<newline>].[\<newline>]" (with any number of \<NL> repetitions).
2809 //i is buf[i] index of the first not-yet-parsed char after that.
2812 // This might overestimate the size, if there are "\<NL>"'s
2813 // in the number. Subtracting number_of_backslashes*2 correctly
2814 // is not that easy: consider that in the case of "NNN.\<NL>"
2815 // loop above will count "\<NL>" before it realizes it is not
2816 // in fact *inside* the number:
2817 len = ccnt + 1; // +1 byte for NUL termination
2819 // This check makes sense only if size_t is (much) larger than BC_MAX_NUM.
2820 if (SIZE_MAX > (BC_MAX_NUM | 0xff)) {
2821 if (len > BC_MAX_NUM)
2822 RETURN_STATUS(bc_error("number too long: must be [1,"BC_MAX_NUM_STR"]"));
2825 bc_vec_pop_all(&l->lex_buf);
2826 bc_vec_expand(&l->lex_buf, 1 + len);
2827 bc_vec_push(&l->lex_buf, &start);
2830 // If we have hit a backslash, skip it. We don't have
2831 // to check for a newline because it's guaranteed.
2837 bc_vec_push(&l->lex_buf, buf);
2842 bc_vec_pushZeroByte(&l->lex_buf);
2844 RETURN_STATUS(BC_STATUS_SUCCESS);
2846 #define zbc_lex_number(...) (zbc_lex_number(__VA_ARGS__) COMMA_SUCCESS)
2848 static void bc_lex_name(void)
2850 BcLex *l = &G.prs.l;
2854 l->lex = XC_LEX_NAME;
2857 buf = l->buf + l->i - 1;
2860 if ((c < 'a' || c > 'z') && !isdigit(c) && c != '_') break;
2864 #if 0 // We do not protect against people with gigabyte-long names
2865 // This check makes sense only if size_t is (much) larger than BC_MAX_STRING.
2866 if (SIZE_MAX > (BC_MAX_STRING | 0xff)) {
2867 if (i > BC_MAX_STRING)
2868 return bc_error("name too long: must be [1,"BC_MAX_STRING_STR"]");
2871 bc_vec_string(&l->lex_buf, i, buf);
2873 // Increment the index. We minus 1 because it has already been incremented.
2876 //return BC_STATUS_SUCCESS;
2879 static void bc_lex_init(void)
2881 bc_char_vec_init(&G.prs.l.lex_buf);
2884 static void bc_lex_free(void)
2886 bc_vec_free(&G.prs.l.lex_buf);
2889 static void bc_lex_file(void)
2891 G.err_line = G.prs.l.line = 1;
2892 G.prs.l.newline = false;
2895 static bool bc_lex_more_input(void)
2897 BcLex *l = &G.prs.l;
2901 bc_vec_pop_all(&G.input_buffer);
2903 // This loop is complex because the vm tries not to send any lines that end
2904 // with a backslash to the parser. The reason for that is because the parser
2905 // treats a backslash+newline combo as whitespace, per the bc spec. In that
2906 // case, and for strings and comments, the parser will expect more stuff.
2910 size_t prevlen = G.input_buffer.len;
2913 bc_read_line(&G.input_buffer, G.prs.input_fp);
2914 // No more input means EOF
2915 if (G.input_buffer.len <= prevlen + 1) // (we expect +1 for NUL byte)
2918 string = G.input_buffer.v + prevlen;
2921 if (string == G.input_buffer.v || string[-1] != '\\') {
2932 if (c == '/' && *string == '*') {
2937 if (c == '*' && *string == '/') {
2942 if (str != 0 || comment) {
2943 G.input_buffer.len--; // backstep over the trailing NUL byte
2947 // Check for backslash+newline.
2948 // we do not check that last char is '\n' -
2949 // if it is not, then it's EOF, and looping back
2950 // to bc_read_line() will detect it:
2952 if (string >= G.input_buffer.v && *string == '\\') {
2953 G.input_buffer.len--;
2960 l->buf = G.input_buffer.v;
2962 // bb_error_msg("G.input_buffer.len:%d '%s'", G.input_buffer.len, G.input_buffer.v);
2963 l->len = G.input_buffer.len - 1; // do not include NUL
2968 IF_BC(static BC_STATUS zbc_lex_token(void);)
2969 IF_DC(static BC_STATUS zdc_lex_token(void);)
2970 #define zbc_lex_token(...) (zbc_lex_token(__VA_ARGS__) COMMA_SUCCESS)
2971 #define zdc_lex_token(...) (zdc_lex_token(__VA_ARGS__) COMMA_SUCCESS)
2973 static BC_STATUS zbc_lex_next(void)
2975 BcLex *l = &G.prs.l;
2978 l->lex_last = l->lex;
2979 if (l->lex_last == XC_LEX_EOF) RETURN_STATUS(bc_error("end of file"));
2981 l->line += l->newline;
2982 G.err_line = l->line;
2985 // Loop until failure or we don't have whitespace. This
2986 // is so the parser doesn't get inundated with whitespace.
2987 // Comments are also XC_LEX_WHITESPACE tokens and eaten here.
2988 s = BC_STATUS_SUCCESS;
2990 if (l->i == l->len) {
2991 l->lex = XC_LEX_EOF;
2992 if (!G.prs.input_fp)
2993 RETURN_STATUS(BC_STATUS_SUCCESS);
2994 if (!bc_lex_more_input()) {
2995 G.prs.input_fp = NULL;
2996 RETURN_STATUS(BC_STATUS_SUCCESS);
2998 // here it's guaranteed that l->i is below l->len
3000 l->lex_next_at = l->buf + l->i;
3001 dbg_lex("next string to parse:'%.*s'",
3002 (int)(strchrnul(l->lex_next_at, '\n') - l->lex_next_at),
3006 IF_BC(s = zbc_lex_token());
3008 IF_DC(s = zdc_lex_token());
3010 } while (!s && l->lex == XC_LEX_WHITESPACE);
3011 dbg_lex("l->lex from string:%d", l->lex);
3015 #define zbc_lex_next(...) (zbc_lex_next(__VA_ARGS__) COMMA_SUCCESS)
3018 static BC_STATUS zbc_lex_skip_if_at_NLINE(void)
3020 if (G.prs.l.lex == XC_LEX_NLINE)
3021 RETURN_STATUS(zbc_lex_next());
3022 RETURN_STATUS(BC_STATUS_SUCCESS);
3024 #define zbc_lex_skip_if_at_NLINE(...) (zbc_lex_skip_if_at_NLINE(__VA_ARGS__) COMMA_SUCCESS)
3026 static BC_STATUS zbc_lex_next_and_skip_NLINE(void)
3030 if (s) RETURN_STATUS(s);
3031 // if(cond)<newline>stmt is accepted too (but not 2+ newlines)
3032 s = zbc_lex_skip_if_at_NLINE();
3035 #define zbc_lex_next_and_skip_NLINE(...) (zbc_lex_next_and_skip_NLINE(__VA_ARGS__) COMMA_SUCCESS)
3038 static BC_STATUS zbc_lex_text_init(const char *text)
3042 G.prs.l.len = strlen(text);
3043 G.prs.l.lex = G.prs.l.lex_last = XC_LEX_INVALID;
3044 RETURN_STATUS(zbc_lex_next());
3046 #define zbc_lex_text_init(...) (zbc_lex_text_init(__VA_ARGS__) COMMA_SUCCESS)
3049 static BC_STATUS zbc_lex_identifier(void)
3051 BcLex *l = &G.prs.l;
3054 const char *buf = l->buf + l->i - 1;
3056 for (i = 0; i < ARRAY_SIZE(bc_lex_kws); ++i) {
3057 const char *keyword8 = bc_lex_kws[i].name8;
3059 while (buf[j] != '\0' && buf[j] == keyword8[j]) {
3061 if (j == 8) goto match;
3063 if (keyword8[j] != '\0')
3066 // buf starts with keyword bc_lex_kws[i]
3067 if (isalnum(buf[j]) || buf[j]=='_')
3068 continue; // "ifz" does not match "if" keyword, "if." does
3069 l->lex = BC_LEX_KEY_1st_keyword + i;
3070 if (!bc_lex_kws_POSIX(i)) {
3071 s = zbc_posix_error_fmt("%sthe '%.8s' keyword", "POSIX does not allow ", bc_lex_kws[i].name8);
3072 if (s) RETURN_STATUS(s);
3075 // We minus 1 because the index has already been incremented.
3077 RETURN_STATUS(BC_STATUS_SUCCESS);
3081 s = BC_STATUS_SUCCESS;
3083 if (l->lex_buf.len > 2) {
3086 // bc: POSIX only allows one character names; the following is bad: 'qwe=1
3088 unsigned len = strchrnul(buf, '\n') - buf;
3089 s = zbc_posix_error_fmt("POSIX only allows one character names; the following is bad: '%.*s'", len, buf);
3094 #define zbc_lex_identifier(...) (zbc_lex_identifier(__VA_ARGS__) COMMA_SUCCESS)
3096 static BC_STATUS zbc_lex_string(void)
3098 BcLex *l = &G.prs.l;
3101 l->lex = XC_LEX_STR;
3109 RETURN_STATUS(bc_error("string end could not be found"));
3118 // This check makes sense only if size_t is (much) larger than BC_MAX_STRING.
3119 if (SIZE_MAX > (BC_MAX_STRING | 0xff)) {
3120 if (len > BC_MAX_STRING)
3121 RETURN_STATUS(bc_error("string too long: must be [1,"BC_MAX_STRING_STR"]"));
3123 bc_vec_string(&l->lex_buf, len, l->buf + l->i);
3127 G.err_line = l->line;
3129 RETURN_STATUS(BC_STATUS_SUCCESS);
3131 #define zbc_lex_string(...) (zbc_lex_string(__VA_ARGS__) COMMA_SUCCESS)
3133 static void bc_lex_assign(unsigned with_and_without)
3135 BcLex *l = &G.prs.l;
3136 if (l->buf[l->i] == '=') {
3138 with_and_without >>= 8; // store "with" value
3139 } // else store "without" value
3140 l->lex = (with_and_without & 0xff);
3142 #define bc_lex_assign(with, without) \
3143 bc_lex_assign(((with)<<8)|(without))
3145 static BC_STATUS zbc_lex_comment(void)
3147 BcLex *l = &G.prs.l;
3149 const char *buf = l->buf;
3151 l->lex = XC_LEX_WHITESPACE;
3152 i = l->i; /* here buf[l->i] is the '*' of opening comment delimiter */
3164 RETURN_STATUS(bc_error("comment end could not be found"));
3171 G.err_line = l->line;
3173 RETURN_STATUS(BC_STATUS_SUCCESS);
3175 #define zbc_lex_comment(...) (zbc_lex_comment(__VA_ARGS__) COMMA_SUCCESS)
3177 #undef zbc_lex_token
3178 static BC_STATUS zbc_lex_token(void)
3180 BcLex *l = &G.prs.l;
3181 BcStatus s = BC_STATUS_SUCCESS;
3182 char c = l->buf[l->i++], c2;
3184 // This is the workhorse of the lexer.
3186 // case '\0': // probably never reached
3188 // l->lex = XC_LEX_EOF;
3189 // l->newline = true;
3192 l->lex = XC_LEX_NLINE;
3200 bc_lex_whitespace();
3203 bc_lex_assign(XC_LEX_OP_REL_NE, BC_LEX_OP_BOOL_NOT);
3204 if (l->lex == BC_LEX_OP_BOOL_NOT) {
3205 s = zbc_POSIX_does_not_allow_bool_ops_this_is_bad("!");
3206 if (s) RETURN_STATUS(s);
3210 s = zbc_lex_string();
3213 s = zbc_POSIX_does_not_allow("'#' script comments");
3214 if (s) RETURN_STATUS(s);
3215 bc_lex_lineComment();
3218 bc_lex_assign(BC_LEX_OP_ASSIGN_MODULUS, XC_LEX_OP_MODULUS);
3223 s = zbc_POSIX_does_not_allow_bool_ops_this_is_bad("&&");
3224 if (s) RETURN_STATUS(s);
3226 l->lex = BC_LEX_OP_BOOL_AND;
3228 l->lex = XC_LEX_INVALID;
3229 s = bc_error_bad_character('&');
3234 l->lex = (BcLexType)(c - '(' + BC_LEX_LPAREN);
3237 bc_lex_assign(BC_LEX_OP_ASSIGN_MULTIPLY, XC_LEX_OP_MULTIPLY);
3243 l->lex = BC_LEX_OP_INC;
3245 bc_lex_assign(BC_LEX_OP_ASSIGN_PLUS, XC_LEX_OP_PLUS);
3248 l->lex = BC_LEX_COMMA;
3254 l->lex = BC_LEX_OP_DEC;
3256 bc_lex_assign(BC_LEX_OP_ASSIGN_MINUS, XC_LEX_OP_MINUS);
3259 if (isdigit(l->buf[l->i]))
3260 s = zbc_lex_number(c);
3262 l->lex = BC_LEX_KEY_LAST;
3263 s = zbc_POSIX_does_not_allow("a period ('.') as a shortcut for the last result");
3269 s = zbc_lex_comment();
3271 bc_lex_assign(BC_LEX_OP_ASSIGN_DIVIDE, XC_LEX_OP_DIVIDE);
3289 s = zbc_lex_number(c);
3292 l->lex = BC_LEX_SCOLON;
3295 bc_lex_assign(XC_LEX_OP_REL_LE, XC_LEX_OP_REL_LT);
3298 bc_lex_assign(XC_LEX_OP_REL_EQ, BC_LEX_OP_ASSIGN);
3301 bc_lex_assign(XC_LEX_OP_REL_GE, XC_LEX_OP_REL_GT);
3305 l->lex = (BcLexType)(c - '[' + BC_LEX_LBRACKET);
3308 if (l->buf[l->i] == '\n') {
3309 l->lex = XC_LEX_WHITESPACE;
3312 s = bc_error_bad_character(c);
3315 bc_lex_assign(BC_LEX_OP_ASSIGN_POWER, XC_LEX_OP_POWER);
3343 s = zbc_lex_identifier();
3347 l->lex = (BcLexType)(c - '{' + BC_LEX_LBRACE);
3352 s = zbc_POSIX_does_not_allow_bool_ops_this_is_bad("||");
3353 if (s) RETURN_STATUS(s);
3355 l->lex = BC_LEX_OP_BOOL_OR;
3357 l->lex = XC_LEX_INVALID;
3358 s = bc_error_bad_character(c);
3362 l->lex = XC_LEX_INVALID;
3363 s = bc_error_bad_character(c);
3369 #define zbc_lex_token(...) (zbc_lex_token(__VA_ARGS__) COMMA_SUCCESS)
3373 static BC_STATUS zdc_lex_register(void)
3375 BcLex *l = &G.prs.l;
3376 if (G_exreg && isspace(l->buf[l->i])) {
3377 bc_lex_whitespace(); // eats whitespace (but not newline)
3378 l->i++; // bc_lex_name() expects this
3381 bc_vec_pop_all(&l->lex_buf);
3382 bc_vec_push(&l->lex_buf, &l->buf[l->i++]);
3383 bc_vec_pushZeroByte(&l->lex_buf);
3384 l->lex = XC_LEX_NAME;
3387 RETURN_STATUS(BC_STATUS_SUCCESS);
3389 #define zdc_lex_register(...) (zdc_lex_register(__VA_ARGS__) COMMA_SUCCESS)
3391 static BC_STATUS zdc_lex_string(void)
3393 BcLex *l = &G.prs.l;
3394 size_t depth, nls, i;
3396 l->lex = XC_LEX_STR;
3397 bc_vec_pop_all(&l->lex_buf);
3406 RETURN_STATUS(bc_error("string end could not be found"));
3409 if (i == l->i || l->buf[i - 1] != '\\') {
3410 if (c == '[') depth++;
3415 bc_vec_push(&l->lex_buf, &l->buf[i]);
3420 bc_vec_pushZeroByte(&l->lex_buf);
3421 // This check makes sense only if size_t is (much) larger than BC_MAX_STRING.
3422 if (SIZE_MAX > (BC_MAX_STRING | 0xff)) {
3423 if (i - l->i > BC_MAX_STRING)
3424 RETURN_STATUS(bc_error("string too long: must be [1,"BC_MAX_STRING_STR"]"));
3429 G.err_line = l->line;
3431 RETURN_STATUS(BC_STATUS_SUCCESS);
3433 #define zdc_lex_string(...) (zdc_lex_string(__VA_ARGS__) COMMA_SUCCESS)
3435 #undef zdc_lex_token
3436 static BC_STATUS zdc_lex_token(void)
3438 BcLex *l = &G.prs.l;
3439 static const //BcLexType - should be this type, but narrower type saves size:
3442 XC_LEX_OP_REL_EQ, XC_LEX_OP_REL_LE, XC_LEX_OP_REL_GE, XC_LEX_OP_REL_NE,
3443 XC_LEX_OP_REL_LT, XC_LEX_OP_REL_GT, DC_LEX_SCOLON, DC_LEX_COLON,
3444 DC_LEX_ELSE, DC_LEX_LOAD, DC_LEX_LOAD_POP, DC_LEX_OP_ASSIGN,
3452 for (i = 0; i < ARRAY_SIZE(dc_lex_regs); ++i) {
3453 if (l->lex_last == dc_lex_regs[i])
3454 RETURN_STATUS(zdc_lex_register());
3457 s = BC_STATUS_SUCCESS;
3459 if (c >= '%' && c <= '~'
3460 && (l->lex = dc_char_to_LEX[c - '%']) != XC_LEX_INVALID
3465 // This is the workhorse of the lexer.
3467 // case '\0': // probably never reached
3468 // l->lex = XC_LEX_EOF;
3471 // '\n' is XC_LEX_NLINE, not XC_LEX_WHITESPACE
3472 // (and "case '\n':" is not just empty here)
3473 // only to allow interactive dc have a way to exit
3474 // "parse" stage of "parse,execute" loop
3475 // on <enter>, not on _next_ token (which would mean
3476 // commands are not executed on pressing <enter>).
3477 // IOW: typing "1p<enter>" should print "1" _at once_,
3478 // not after some more input.
3479 l->lex = XC_LEX_NLINE;
3487 l->newline = 0; // was (c == '\n')
3488 bc_lex_whitespace();
3493 l->lex = XC_LEX_OP_REL_NE;
3495 l->lex = XC_LEX_OP_REL_LE;
3497 l->lex = XC_LEX_OP_REL_GE;
3499 RETURN_STATUS(bc_error_bad_character(c));
3503 bc_lex_lineComment();
3506 if (isdigit(l->buf[l->i]))
3507 s = zbc_lex_number(c);
3509 s = bc_error_bad_character(c);
3527 s = zbc_lex_number(c);
3530 s = zdc_lex_string();
3533 l->lex = XC_LEX_INVALID;
3534 s = bc_error_bad_character(c);
3540 #define zdc_lex_token(...) (zdc_lex_token(__VA_ARGS__) COMMA_SUCCESS)
3543 static void bc_parse_push(char i)
3545 BcParse *p = &G.prs;
3546 dbg_compile("%s:%d pushing bytecode %zd:%d", __func__, __LINE__, p->func->code.len, i);
3547 bc_vec_pushByte(&p->func->code, i);
3550 static void bc_parse_pushName(char *name)
3553 bc_parse_push(*name++);
3554 bc_parse_push(BC_PARSE_STREND);
3557 static void bc_parse_pushIndex(size_t idx)
3562 dbg_lex("%s:%d pushing index %zd", __func__, __LINE__, idx);
3563 mask = ((size_t)0xff) << (sizeof(idx) * 8 - 8);
3566 if (idx & mask) break;
3574 bc_parse_push((unsigned char)idx);
3580 static void bc_parse_pushJUMP(size_t idx)
3582 bc_parse_push(BC_INST_JUMP);
3583 bc_parse_pushIndex(idx);
3586 static void bc_parse_pushJUMP_ZERO(size_t idx)
3588 bc_parse_push(BC_INST_JUMP_ZERO);
3589 bc_parse_pushIndex(idx);
3592 static BC_STATUS zbc_parse_pushSTR(void)
3594 BcParse *p = &G.prs;
3595 char *str = xstrdup(p->l.lex_buf.v);
3597 bc_parse_push(XC_INST_STR);
3598 bc_parse_pushIndex(p->func->strs.len);
3599 bc_vec_push(&p->func->strs, &str);
3601 RETURN_STATUS(zbc_lex_next());
3603 #define zbc_parse_pushSTR(...) (zbc_parse_pushSTR(__VA_ARGS__) COMMA_SUCCESS)
3606 static void bc_parse_pushNUM(void)
3608 BcParse *p = &G.prs;
3609 char *num = xstrdup(p->l.lex_buf.v);
3610 #if ENABLE_BC && ENABLE_DC
3611 size_t idx = bc_vec_push(IS_BC ? &p->func->consts : &G.prog.consts, &num);
3613 size_t idx = bc_vec_push(&p->func->consts, &num);
3615 size_t idx = bc_vec_push(&G.prog.consts, &num);
3617 bc_parse_push(XC_INST_NUM);
3618 bc_parse_pushIndex(idx);
3621 static BC_STATUS zbc_parse_text_init(const char *text)
3623 BcParse *p = &G.prs;
3624 p->func = bc_program_func(p->fidx);
3626 RETURN_STATUS(zbc_lex_text_init(text));
3628 #define zbc_parse_text_init(...) (zbc_parse_text_init(__VA_ARGS__) COMMA_SUCCESS)
3630 // Called when parsing or execution detects a failure,
3631 // resets execution structures.
3632 static void bc_program_reset(void)
3637 bc_vec_npop(&G.prog.exestack, G.prog.exestack.len - 1);
3638 bc_vec_pop_all(&G.prog.results);
3640 f = bc_program_func_BC_PROG_MAIN();
3641 ip = bc_vec_top(&G.prog.exestack);
3642 ip->inst_idx = f->code.len;
3645 // Called when parsing code detects a failure,
3646 // resets parsing structures.
3647 static void bc_parse_reset(void)
3649 BcParse *p = &G.prs;
3650 if (p->fidx != BC_PROG_MAIN) {
3651 bc_func_free(p->func);
3652 bc_func_init(p->func);
3654 p->fidx = BC_PROG_MAIN;
3655 p->func = bc_program_func_BC_PROG_MAIN();
3659 p->l.lex = XC_LEX_EOF;
3661 IF_BC(bc_vec_pop_all(&p->exits);)
3662 IF_BC(bc_vec_pop_all(&p->conds);)
3663 IF_BC(bc_vec_pop_all(&p->ops);)
3668 static void bc_parse_free(void)
3670 BcParse *p = &G.prs;
3671 IF_BC(bc_vec_free(&p->exits);)
3672 IF_BC(bc_vec_free(&p->conds);)
3673 IF_BC(bc_vec_free(&p->ops);)
3677 static void bc_parse_create(size_t fidx)
3679 BcParse *p = &G.prs;
3680 memset(p, 0, sizeof(BcParse));
3683 IF_BC(bc_vec_init(&p->exits, sizeof(size_t), NULL);)
3684 IF_BC(bc_vec_init(&p->conds, sizeof(size_t), NULL);)
3685 IF_BC(bc_vec_init(&p->ops, sizeof(BcLexType), NULL);)
3688 p->func = bc_program_func(fidx);
3691 static void bc_program_add_fn(void)
3697 bc_vec_push(&G.prog.fns, &f);
3703 // Note: takes ownership of 'name' (must be malloced)
3704 static size_t bc_program_addFunc(char *name)
3707 BcId entry, *entry_ptr;
3711 entry.idx = G.prog.fns.len;
3713 inserted = bc_map_insert(&G.prog.fn_map, &entry, &idx);
3714 if (!inserted) free(name);
3716 entry_ptr = bc_vec_item(&G.prog.fn_map, idx);
3717 idx = entry_ptr->idx;
3720 // There is already a function with this name.
3721 // It'll be redefined now, clear old definition.
3722 BcFunc *func = bc_program_func(entry_ptr->idx);
3726 bc_program_add_fn();
3732 #define BC_PARSE_TOP_OP(p) (*(BcLexType*)bc_vec_top(&(p)->ops))
3733 // We can calculate the conversion between tokens and exprs by subtracting the
3734 // position of the first operator in the lex enum and adding the position of the
3735 // first in the expr enum. Note: This only works for binary operators.
3736 #define BC_TOKEN_2_INST(t) ((char) ((t) - XC_LEX_OP_POWER + XC_INST_POWER))
3738 static BcStatus bc_parse_expr_empty_ok(uint8_t flags);
3740 static BC_STATUS zbc_parse_expr(uint8_t flags)
3744 s = bc_parse_expr_empty_ok(flags);
3745 if (s == BC_STATUS_PARSE_EMPTY_EXP)
3746 RETURN_STATUS(bc_error("empty expression"));
3749 #define zbc_parse_expr(...) (zbc_parse_expr(__VA_ARGS__) COMMA_SUCCESS)
3751 static BC_STATUS zbc_parse_stmt_possibly_auto(bool auto_allowed);
3752 #define zbc_parse_stmt_possibly_auto(...) (zbc_parse_stmt_possibly_auto(__VA_ARGS__) COMMA_SUCCESS)
3754 static BC_STATUS zbc_parse_stmt(void)
3756 RETURN_STATUS(zbc_parse_stmt_possibly_auto(false));
3758 #define zbc_parse_stmt(...) (zbc_parse_stmt(__VA_ARGS__) COMMA_SUCCESS)
3760 static BC_STATUS zbc_parse_stmt_allow_NLINE_before(const char *after_X)
3762 BcParse *p = &G.prs;
3763 // "if(cond)<newline>stmt" is accepted too, but not 2+ newlines.
3764 // Same for "else", "while()", "for()".
3765 BcStatus s = zbc_lex_next_and_skip_NLINE();
3766 if (s) RETURN_STATUS(s);
3767 if (p->l.lex == XC_LEX_NLINE)
3768 RETURN_STATUS(bc_error_fmt("no statement after '%s'", after_X));
3770 RETURN_STATUS(zbc_parse_stmt());
3772 #define zbc_parse_stmt_allow_NLINE_before(...) (zbc_parse_stmt_allow_NLINE_before(__VA_ARGS__) COMMA_SUCCESS)
3774 static void bc_parse_operator(BcLexType type, size_t start, size_t *nexprs)
3776 BcParse *p = &G.prs;
3777 char l, r = bc_parse_op_PREC(type - XC_LEX_1st_op);
3778 bool left = bc_parse_op_LEFT(type - XC_LEX_1st_op);
3780 while (p->ops.len > start) {
3781 BcLexType t = BC_PARSE_TOP_OP(p);
3782 if (t == BC_LEX_LPAREN) break;
3784 l = bc_parse_op_PREC(t - XC_LEX_1st_op);
3785 if (l >= r && (l != r || !left)) break;
3787 bc_parse_push(BC_TOKEN_2_INST(t));
3788 bc_vec_pop(&p->ops);
3789 *nexprs -= (t != BC_LEX_OP_BOOL_NOT && t != XC_LEX_NEG);
3792 bc_vec_push(&p->ops, &type);
3795 static BC_STATUS zbc_parse_rightParen(size_t ops_bgn, size_t *nexs)
3797 BcParse *p = &G.prs;
3800 if (p->ops.len <= ops_bgn)
3801 RETURN_STATUS(bc_error_bad_expression());
3802 top = BC_PARSE_TOP_OP(p);
3804 while (top != BC_LEX_LPAREN) {
3805 bc_parse_push(BC_TOKEN_2_INST(top));
3807 bc_vec_pop(&p->ops);
3808 *nexs -= (top != BC_LEX_OP_BOOL_NOT && top != XC_LEX_NEG);
3810 if (p->ops.len <= ops_bgn)
3811 RETURN_STATUS(bc_error_bad_expression());
3812 top = BC_PARSE_TOP_OP(p);
3815 bc_vec_pop(&p->ops);
3817 RETURN_STATUS(BC_STATUS_SUCCESS);
3819 #define zbc_parse_rightParen(...) (zbc_parse_rightParen(__VA_ARGS__) COMMA_SUCCESS)
3821 static BC_STATUS zbc_parse_params(uint8_t flags)
3823 BcParse *p = &G.prs;
3827 dbg_lex("%s:%d p->l.lex:%d", __func__, __LINE__, p->l.lex);
3828 flags = (flags & ~(BC_PARSE_PRINT | BC_PARSE_REL)) | BC_PARSE_ARRAY;
3831 if (s) RETURN_STATUS(s);
3834 if (p->l.lex != BC_LEX_RPAREN) {
3836 s = zbc_parse_expr(flags);
3837 if (s) RETURN_STATUS(s);
3839 if (p->l.lex != BC_LEX_COMMA) {
3840 if (p->l.lex == BC_LEX_RPAREN)
3842 RETURN_STATUS(bc_error_bad_token());
3845 if (s) RETURN_STATUS(s);
3849 bc_parse_push(BC_INST_CALL);
3850 bc_parse_pushIndex(nparams);
3852 RETURN_STATUS(BC_STATUS_SUCCESS);
3854 #define zbc_parse_params(...) (zbc_parse_params(__VA_ARGS__) COMMA_SUCCESS)
3856 // Note: takes ownership of 'name' (must be malloced)
3857 static BC_STATUS zbc_parse_call(char *name, uint8_t flags)
3859 BcParse *p = &G.prs;
3861 BcId entry, *entry_ptr;
3866 s = zbc_parse_params(flags);
3869 if (p->l.lex != BC_LEX_RPAREN) {
3870 s = bc_error_bad_token();
3874 idx = bc_map_find_exact(&G.prog.fn_map, &entry);
3876 if (idx == BC_VEC_INVALID_IDX) {
3877 // No such function exists, create an empty one
3878 bc_program_addFunc(name);
3879 idx = bc_map_find_exact(&G.prog.fn_map, &entry);
3883 entry_ptr = bc_vec_item(&G.prog.fn_map, idx);
3884 bc_parse_pushIndex(entry_ptr->idx);
3886 RETURN_STATUS(zbc_lex_next());
3891 #define zbc_parse_call(...) (zbc_parse_call(__VA_ARGS__) COMMA_SUCCESS)
3893 static BC_STATUS zbc_parse_name(BcInst *type, uint8_t flags)
3895 BcParse *p = &G.prs;
3899 name = xstrdup(p->l.lex_buf.v);
3903 if (p->l.lex == BC_LEX_LBRACKET) {
3907 if (p->l.lex == BC_LEX_RBRACKET) {
3908 if (!(flags & BC_PARSE_ARRAY)) {
3909 s = bc_error_bad_expression();
3912 *type = XC_INST_ARRAY;
3914 *type = XC_INST_ARRAY_ELEM;
3915 flags &= ~(BC_PARSE_PRINT | BC_PARSE_REL);
3916 s = zbc_parse_expr(flags);
3921 bc_parse_push(*type);
3922 bc_parse_pushName(name);
3924 } else if (p->l.lex == BC_LEX_LPAREN) {
3925 if (flags & BC_PARSE_NOCALL) {
3926 s = bc_error_bad_token();
3929 *type = BC_INST_CALL;
3930 s = zbc_parse_call(name, flags);
3932 *type = XC_INST_VAR;
3933 bc_parse_push(XC_INST_VAR);
3934 bc_parse_pushName(name);
3943 #define zbc_parse_name(...) (zbc_parse_name(__VA_ARGS__) COMMA_SUCCESS)
3945 static BC_STATUS zbc_parse_read(void)
3947 BcParse *p = &G.prs;
3951 if (s) RETURN_STATUS(s);
3952 if (p->l.lex != BC_LEX_LPAREN) RETURN_STATUS(bc_error_bad_token());
3955 if (s) RETURN_STATUS(s);
3956 if (p->l.lex != BC_LEX_RPAREN) RETURN_STATUS(bc_error_bad_token());
3958 bc_parse_push(XC_INST_READ);
3962 #define zbc_parse_read(...) (zbc_parse_read(__VA_ARGS__) COMMA_SUCCESS)
3964 static BC_STATUS zbc_parse_builtin(BcLexType type, uint8_t flags, BcInst *prev)
3966 BcParse *p = &G.prs;
3970 if (s) RETURN_STATUS(s);
3971 if (p->l.lex != BC_LEX_LPAREN) RETURN_STATUS(bc_error_bad_token());
3973 flags = (flags & ~(BC_PARSE_PRINT | BC_PARSE_REL)) | BC_PARSE_ARRAY;
3976 if (s) RETURN_STATUS(s);
3978 s = zbc_parse_expr(flags);
3979 if (s) RETURN_STATUS(s);
3981 if (p->l.lex != BC_LEX_RPAREN) RETURN_STATUS(bc_error_bad_token());
3983 *prev = (type == BC_LEX_KEY_LENGTH) ? XC_INST_LENGTH : XC_INST_SQRT;
3984 bc_parse_push(*prev);
3988 #define zbc_parse_builtin(...) (zbc_parse_builtin(__VA_ARGS__) COMMA_SUCCESS)
3990 static BC_STATUS zbc_parse_scale(BcInst *type, uint8_t flags)
3992 BcParse *p = &G.prs;
3996 if (s) RETURN_STATUS(s);
3998 if (p->l.lex != BC_LEX_LPAREN) {
3999 *type = XC_INST_SCALE;
4000 bc_parse_push(XC_INST_SCALE);
4001 RETURN_STATUS(BC_STATUS_SUCCESS);
4004 *type = XC_INST_SCALE_FUNC;
4005 flags &= ~(BC_PARSE_PRINT | BC_PARSE_REL);
4008 if (s) RETURN_STATUS(s);
4010 s = zbc_parse_expr(flags);
4011 if (s) RETURN_STATUS(s);
4012 if (p->l.lex != BC_LEX_RPAREN)
4013 RETURN_STATUS(bc_error_bad_token());
4014 bc_parse_push(XC_INST_SCALE_FUNC);
4016 RETURN_STATUS(zbc_lex_next());
4018 #define zbc_parse_scale(...) (zbc_parse_scale(__VA_ARGS__) COMMA_SUCCESS)
4020 static BC_STATUS zbc_parse_incdec(BcInst *prev, bool *paren_expr,
4021 size_t *nexprs, uint8_t flags)
4023 BcParse *p = &G.prs;
4027 BcInst etype = *prev;
4029 if (etype == XC_INST_VAR || etype == XC_INST_ARRAY_ELEM
4030 || etype == XC_INST_SCALE || etype == BC_INST_LAST
4031 || etype == XC_INST_IBASE || etype == XC_INST_OBASE
4033 *prev = inst = BC_INST_INC_POST + (p->l.lex != BC_LEX_OP_INC);
4034 bc_parse_push(inst);
4037 *prev = inst = BC_INST_INC_PRE + (p->l.lex != BC_LEX_OP_INC);
4041 if (s) RETURN_STATUS(s);
4044 // Because we parse the next part of the expression
4045 // right here, we need to increment this.
4046 *nexprs = *nexprs + 1;
4050 s = zbc_parse_name(prev, flags | BC_PARSE_NOCALL);
4052 case BC_LEX_KEY_IBASE:
4053 case BC_LEX_KEY_LAST:
4054 case BC_LEX_KEY_OBASE:
4055 bc_parse_push(type - BC_LEX_KEY_IBASE + XC_INST_IBASE);
4058 case BC_LEX_KEY_SCALE:
4060 if (s) RETURN_STATUS(s);
4061 if (p->l.lex == BC_LEX_LPAREN)
4062 s = bc_error_bad_token();
4064 bc_parse_push(XC_INST_SCALE);
4067 s = bc_error_bad_token();
4071 if (!s) bc_parse_push(inst);
4076 #define zbc_parse_incdec(...) (zbc_parse_incdec(__VA_ARGS__) COMMA_SUCCESS)
4079 #define BC_PARSE_LEAF(p, rparen) \
4081 || ((p) >= XC_INST_NUM && (p) <= XC_INST_SQRT) \
4082 || (p) == BC_INST_INC_POST \
4083 || (p) == BC_INST_DEC_POST \
4086 static int ok_in_expr(BcInst p)
4088 return (p >= XC_INST_NUM && p <= XC_INST_SQRT)
4089 || p == BC_INST_INC_POST
4090 || p == BC_INST_DEC_POST
4093 #define BC_PARSE_LEAF(p, rparen) ((rparen) || ok_in_expr(p))
4096 static BC_STATUS zbc_parse_minus(BcInst *prev, size_t ops_bgn,
4097 bool rparen, size_t *nexprs)
4099 BcParse *p = &G.prs;
4102 BcInst etype = *prev;
4105 if (s) RETURN_STATUS(s);
4107 type = BC_PARSE_LEAF(etype, rparen) ? XC_LEX_OP_MINUS : XC_LEX_NEG;
4108 *prev = BC_TOKEN_2_INST(type);
4110 // We can just push onto the op stack because this is the largest
4111 // precedence operator that gets pushed. Inc/dec does not.
4112 if (type != XC_LEX_OP_MINUS)
4113 bc_vec_push(&p->ops, &type);
4115 bc_parse_operator(type, ops_bgn, nexprs);
4119 #define zbc_parse_minus(...) (zbc_parse_minus(__VA_ARGS__) COMMA_SUCCESS)
4121 static BC_STATUS zbc_parse_print(void)
4123 BcParse *p = &G.prs;
4129 if (s) RETURN_STATUS(s);
4131 if (type == XC_LEX_STR) {
4132 s = zbc_parse_pushSTR();
4134 s = zbc_parse_expr(0);
4136 if (s) RETURN_STATUS(s);
4137 bc_parse_push(XC_INST_PRINT_POP);
4138 if (p->l.lex != BC_LEX_COMMA)
4144 #define zbc_parse_print(...) (zbc_parse_print(__VA_ARGS__) COMMA_SUCCESS)
4146 static BC_STATUS zbc_parse_return(void)
4148 BcParse *p = &G.prs;
4152 dbg_lex_enter("%s:%d entered", __func__, __LINE__);
4154 if (s) RETURN_STATUS(s);
4157 if (t == XC_LEX_NLINE || t == BC_LEX_SCOLON)
4158 bc_parse_push(BC_INST_RET0);
4160 bool paren = (t == BC_LEX_LPAREN);
4161 s = bc_parse_expr_empty_ok(0);
4162 if (s == BC_STATUS_PARSE_EMPTY_EXP) {
4163 bc_parse_push(BC_INST_RET0);
4166 if (s) RETURN_STATUS(s);
4168 if (!paren || p->l.lex_last != BC_LEX_RPAREN) {
4169 s = zbc_POSIX_requires("parentheses around return expressions");
4170 if (s) RETURN_STATUS(s);
4173 bc_parse_push(XC_INST_RET);
4176 dbg_lex_done("%s:%d done", __func__, __LINE__);
4179 #define zbc_parse_return(...) (zbc_parse_return(__VA_ARGS__) COMMA_SUCCESS)
4181 static void rewrite_label_to_current(size_t idx)
4183 BcParse *p = &G.prs;
4184 size_t *label = bc_vec_item(&p->func->labels, idx);
4185 *label = p->func->code.len;
4188 static BC_STATUS zbc_parse_if(void)
4190 BcParse *p = &G.prs;
4194 dbg_lex_enter("%s:%d entered", __func__, __LINE__);
4196 if (s) RETURN_STATUS(s);
4197 if (p->l.lex != BC_LEX_LPAREN) RETURN_STATUS(bc_error_bad_token());
4200 if (s) RETURN_STATUS(s);
4201 s = zbc_parse_expr(BC_PARSE_REL);
4202 if (s) RETURN_STATUS(s);
4203 if (p->l.lex != BC_LEX_RPAREN) RETURN_STATUS(bc_error_bad_token());
4205 // Encode "if zero, jump to ..."
4206 // Pushed value (destination of the jump) is uninitialized,
4207 // will be rewritten to be address of "end of if()" or of "else".
4208 ip_idx = bc_vec_push(&p->func->labels, &ip_idx);
4209 bc_parse_pushJUMP_ZERO(ip_idx);
4211 s = zbc_parse_stmt_allow_NLINE_before(STRING_if);
4212 if (s) RETURN_STATUS(s);
4214 dbg_lex("%s:%d in if after stmt: p->l.lex:%d", __func__, __LINE__, p->l.lex);
4215 if (p->l.lex == BC_LEX_KEY_ELSE) {
4218 // Encode "after then_stmt, jump to end of if()"
4219 ip2_idx = bc_vec_push(&p->func->labels, &ip2_idx);
4220 dbg_lex("%s:%d after if() then_stmt: BC_INST_JUMP to %zd", __func__, __LINE__, ip2_idx);
4221 bc_parse_pushJUMP(ip2_idx);
4223 dbg_lex("%s:%d rewriting 'if_zero' label to jump to 'else'-> %zd", __func__, __LINE__, p->func->code.len);
4224 rewrite_label_to_current(ip_idx);
4228 s = zbc_parse_stmt_allow_NLINE_before(STRING_else);
4229 if (s) RETURN_STATUS(s);
4232 dbg_lex("%s:%d rewriting label to jump after 'if' body-> %zd", __func__, __LINE__, p->func->code.len);
4233 rewrite_label_to_current(ip_idx);
4235 dbg_lex_done("%s:%d done", __func__, __LINE__);
4238 #define zbc_parse_if(...) (zbc_parse_if(__VA_ARGS__) COMMA_SUCCESS)
4240 static BC_STATUS zbc_parse_while(void)
4242 BcParse *p = &G.prs;
4248 if (s) RETURN_STATUS(s);
4249 if (p->l.lex != BC_LEX_LPAREN) RETURN_STATUS(bc_error_bad_token());
4251 if (s) RETURN_STATUS(s);
4253 cond_idx = bc_vec_push(&p->func->labels, &p->func->code.len);
4254 ip_idx = cond_idx + 1;
4255 bc_vec_push(&p->conds, &cond_idx);
4257 bc_vec_push(&p->exits, &ip_idx);
4258 bc_vec_push(&p->func->labels, &ip_idx);
4260 s = zbc_parse_expr(BC_PARSE_REL);
4261 if (s) RETURN_STATUS(s);
4262 if (p->l.lex != BC_LEX_RPAREN) RETURN_STATUS(bc_error_bad_token());
4264 bc_parse_pushJUMP_ZERO(ip_idx);
4266 s = zbc_parse_stmt_allow_NLINE_before(STRING_while);
4267 if (s) RETURN_STATUS(s);
4269 dbg_lex("%s:%d BC_INST_JUMP to %zd", __func__, __LINE__, cond_idx);
4270 bc_parse_pushJUMP(cond_idx);
4272 dbg_lex("%s:%d rewriting label-> %zd", __func__, __LINE__, p->func->code.len);
4273 rewrite_label_to_current(ip_idx);
4275 bc_vec_pop(&p->exits);
4276 bc_vec_pop(&p->conds);
4280 #define zbc_parse_while(...) (zbc_parse_while(__VA_ARGS__) COMMA_SUCCESS)
4282 static BC_STATUS zbc_parse_for(void)
4284 BcParse *p = &G.prs;
4286 size_t cond_idx, exit_idx, body_idx, update_idx;
4288 dbg_lex("%s:%d p->l.lex:%d", __func__, __LINE__, p->l.lex);
4290 if (s) RETURN_STATUS(s);
4291 if (p->l.lex != BC_LEX_LPAREN) RETURN_STATUS(bc_error_bad_token());
4293 if (s) RETURN_STATUS(s);
4295 if (p->l.lex != BC_LEX_SCOLON) {
4296 s = zbc_parse_expr(0);
4297 bc_parse_push(XC_INST_POP);
4298 if (s) RETURN_STATUS(s);
4300 s = zbc_POSIX_does_not_allow_empty_X_expression_in_for("init");
4301 if (s) RETURN_STATUS(s);
4304 if (p->l.lex != BC_LEX_SCOLON) RETURN_STATUS(bc_error_bad_token());
4306 if (s) RETURN_STATUS(s);
4308 cond_idx = bc_vec_push(&p->func->labels, &p->func->code.len);
4309 update_idx = cond_idx + 1;
4310 body_idx = update_idx + 1;
4311 exit_idx = body_idx + 1;
4313 if (p->l.lex != BC_LEX_SCOLON)
4314 s = zbc_parse_expr(BC_PARSE_REL);
4316 // Set this for the next call to bc_parse_pushNUM().
4317 // This is safe to set because the current token is a semicolon,
4318 // which has no string requirement.
4319 bc_vec_string(&p->l.lex_buf, 1, "1");
4321 s = zbc_POSIX_does_not_allow_empty_X_expression_in_for("condition");
4323 if (s) RETURN_STATUS(s);
4325 if (p->l.lex != BC_LEX_SCOLON) RETURN_STATUS(bc_error_bad_token());
4328 if (s) RETURN_STATUS(s);
4330 bc_parse_pushJUMP_ZERO(exit_idx);
4331 bc_parse_pushJUMP(body_idx);
4333 bc_vec_push(&p->conds, &update_idx);
4334 bc_vec_push(&p->func->labels, &p->func->code.len);
4336 if (p->l.lex != BC_LEX_RPAREN) {
4337 s = zbc_parse_expr(0);
4338 if (s) RETURN_STATUS(s);
4339 if (p->l.lex != BC_LEX_RPAREN) RETURN_STATUS(bc_error_bad_token());
4340 bc_parse_push(XC_INST_POP);
4342 s = zbc_POSIX_does_not_allow_empty_X_expression_in_for("update");
4343 if (s) RETURN_STATUS(s);
4346 bc_parse_pushJUMP(cond_idx);
4347 bc_vec_push(&p->func->labels, &p->func->code.len);
4349 bc_vec_push(&p->exits, &exit_idx);
4350 bc_vec_push(&p->func->labels, &exit_idx);
4352 s = zbc_parse_stmt_allow_NLINE_before(STRING_for);
4353 if (s) RETURN_STATUS(s);
4355 dbg_lex("%s:%d BC_INST_JUMP to %zd", __func__, __LINE__, update_idx);
4356 bc_parse_pushJUMP(update_idx);
4358 dbg_lex("%s:%d rewriting label-> %zd", __func__, __LINE__, p->func->code.len);
4359 rewrite_label_to_current(exit_idx);
4361 bc_vec_pop(&p->exits);
4362 bc_vec_pop(&p->conds);
4364 RETURN_STATUS(BC_STATUS_SUCCESS);
4366 #define zbc_parse_for(...) (zbc_parse_for(__VA_ARGS__) COMMA_SUCCESS)
4368 static BC_STATUS zbc_parse_break_or_continue(BcLexType type)
4370 BcParse *p = &G.prs;
4373 if (type == BC_LEX_KEY_BREAK) {
4374 if (p->exits.len == 0) // none of the enclosing blocks is a loop
4375 RETURN_STATUS(bc_error_bad_token());
4376 i = *(size_t*)bc_vec_top(&p->exits);
4378 i = *(size_t*)bc_vec_top(&p->conds);
4380 bc_parse_pushJUMP(i);
4382 RETURN_STATUS(zbc_lex_next());
4384 #define zbc_parse_break_or_continue(...) (zbc_parse_break_or_continue(__VA_ARGS__) COMMA_SUCCESS)
4386 static BC_STATUS zbc_func_insert(BcFunc *f, char *name, bool var)
4392 autoid = (void*)f->autos.v;
4393 for (i = 0; i < f->autos.len; i++, autoid++) {
4394 if (strcmp(name, autoid->name) == 0)
4395 RETURN_STATUS(bc_error("function parameter or auto var has the same name as another"));
4401 bc_vec_push(&f->autos, &a);
4403 RETURN_STATUS(BC_STATUS_SUCCESS);
4405 #define zbc_func_insert(...) (zbc_func_insert(__VA_ARGS__) COMMA_SUCCESS)
4407 static BC_STATUS zbc_parse_funcdef(void)
4409 BcParse *p = &G.prs;
4411 bool var, comma = false;
4414 dbg_lex_enter("%s:%d entered", __func__, __LINE__);
4416 if (s) RETURN_STATUS(s);
4417 if (p->l.lex != XC_LEX_NAME)
4418 RETURN_STATUS(bc_error("bad function definition"));
4420 name = xstrdup(p->l.lex_buf.v);
4421 p->fidx = bc_program_addFunc(name);
4422 p->func = bc_program_func(p->fidx);
4425 if (s) RETURN_STATUS(s);
4426 if (p->l.lex != BC_LEX_LPAREN)
4427 RETURN_STATUS(bc_error("bad function definition"));
4429 if (s) RETURN_STATUS(s);
4431 while (p->l.lex != BC_LEX_RPAREN) {
4432 if (p->l.lex != XC_LEX_NAME)
4433 RETURN_STATUS(bc_error("bad function definition"));
4437 name = xstrdup(p->l.lex_buf.v);
4441 var = p->l.lex != BC_LEX_LBRACKET;
4447 if (p->l.lex != BC_LEX_RBRACKET) {
4448 s = bc_error("bad function definition");
4456 comma = p->l.lex == BC_LEX_COMMA;
4462 s = zbc_func_insert(p->func, name, var);
4466 if (comma) RETURN_STATUS(bc_error("bad function definition"));
4469 if (s) RETURN_STATUS(s);
4471 if (p->l.lex != BC_LEX_LBRACE) {
4472 s = zbc_POSIX_requires("the left brace be on the same line as the function header");
4473 if (s) RETURN_STATUS(s);
4476 // Prevent "define z()<newline>" from being interpreted as function with empty stmt as body
4477 s = zbc_lex_skip_if_at_NLINE();
4478 if (s) RETURN_STATUS(s);
4479 //GNU bc requires a {} block even if function body has single stmt, enforce this?
4480 if (p->l.lex != BC_LEX_LBRACE)
4481 RETURN_STATUS(bc_error("function { body } expected"));
4483 p->in_funcdef++; // to determine whether "return" stmt is allowed, and such
4484 s = zbc_parse_stmt_possibly_auto(true);
4486 if (s) RETURN_STATUS(s);
4488 bc_parse_push(BC_INST_RET0);
4490 // Subsequent code generation is into main program
4491 p->fidx = BC_PROG_MAIN;
4492 p->func = bc_program_func_BC_PROG_MAIN();
4494 dbg_lex_done("%s:%d done", __func__, __LINE__);
4497 dbg_lex_done("%s:%d done (error)", __func__, __LINE__);
4501 #define zbc_parse_funcdef(...) (zbc_parse_funcdef(__VA_ARGS__) COMMA_SUCCESS)
4503 static BC_STATUS zbc_parse_auto(void)
4505 BcParse *p = &G.prs;
4509 dbg_lex_enter("%s:%d entered", __func__, __LINE__);
4511 if (s) RETURN_STATUS(s);
4516 if (p->l.lex != XC_LEX_NAME)
4517 RETURN_STATUS(bc_error("bad 'auto' syntax"));
4519 name = xstrdup(p->l.lex_buf.v);
4523 var = (p->l.lex != BC_LEX_LBRACKET);
4528 if (p->l.lex != BC_LEX_RBRACKET) {
4529 s = bc_error("bad 'auto' syntax");
4536 s = zbc_func_insert(p->func, name, var);
4539 if (p->l.lex == XC_LEX_NLINE
4540 || p->l.lex == BC_LEX_SCOLON
4541 //|| p->l.lex == BC_LEX_RBRACE // allow "define f() {auto a}"
4545 if (p->l.lex != BC_LEX_COMMA)
4546 RETURN_STATUS(bc_error("bad 'auto' syntax"));
4547 s = zbc_lex_next(); // skip comma
4548 if (s) RETURN_STATUS(s);
4551 dbg_lex_done("%s:%d done", __func__, __LINE__);
4552 RETURN_STATUS(BC_STATUS_SUCCESS);
4555 dbg_lex_done("%s:%d done (ERROR)", __func__, __LINE__);
4558 #define zbc_parse_auto(...) (zbc_parse_auto(__VA_ARGS__) COMMA_SUCCESS)
4560 #undef zbc_parse_stmt_possibly_auto
4561 static BC_STATUS zbc_parse_stmt_possibly_auto(bool auto_allowed)
4563 BcParse *p = &G.prs;
4564 BcStatus s = BC_STATUS_SUCCESS;
4566 dbg_lex_enter("%s:%d entered, p->l.lex:%d", __func__, __LINE__, p->l.lex);
4568 if (p->l.lex == XC_LEX_NLINE) {
4569 dbg_lex_done("%s:%d done (seen XC_LEX_NLINE)", __func__, __LINE__);
4570 RETURN_STATUS(zbc_lex_next());
4572 if (p->l.lex == BC_LEX_SCOLON) {
4573 dbg_lex_done("%s:%d done (seen BC_LEX_SCOLON)", __func__, __LINE__);
4574 RETURN_STATUS(zbc_lex_next());
4577 if (p->l.lex == BC_LEX_LBRACE) {
4578 dbg_lex("%s:%d BC_LEX_LBRACE: (auto_allowed:%d)", __func__, __LINE__, auto_allowed);
4581 if (s) RETURN_STATUS(s);
4582 } while (p->l.lex == XC_LEX_NLINE);
4583 if (auto_allowed && p->l.lex == BC_LEX_KEY_AUTO) {
4584 dbg_lex("%s:%d calling zbc_parse_auto()", __func__, __LINE__);
4585 s = zbc_parse_auto();
4586 if (s) RETURN_STATUS(s);
4588 while (p->l.lex != BC_LEX_RBRACE) {
4589 dbg_lex("%s:%d block parsing loop", __func__, __LINE__);
4590 s = zbc_parse_stmt();
4591 if (s) RETURN_STATUS(s);
4594 dbg_lex_done("%s:%d done (seen BC_LEX_RBRACE)", __func__, __LINE__);
4598 dbg_lex("%s:%d p->l.lex:%d", __func__, __LINE__, p->l.lex);
4600 case XC_LEX_OP_MINUS:
4603 case BC_LEX_OP_BOOL_NOT:
4607 case BC_LEX_KEY_IBASE:
4608 case BC_LEX_KEY_LAST:
4609 case BC_LEX_KEY_LENGTH:
4610 case BC_LEX_KEY_OBASE:
4611 case BC_LEX_KEY_READ:
4612 case BC_LEX_KEY_SCALE:
4613 case BC_LEX_KEY_SQRT:
4614 s = zbc_parse_expr(BC_PARSE_PRINT);
4617 s = zbc_parse_pushSTR();
4618 bc_parse_push(XC_INST_PRINT_STR);
4620 case BC_LEX_KEY_BREAK:
4621 case BC_LEX_KEY_CONTINUE:
4622 s = zbc_parse_break_or_continue(p->l.lex);
4624 case BC_LEX_KEY_FOR:
4625 s = zbc_parse_for();
4627 case BC_LEX_KEY_HALT:
4628 bc_parse_push(BC_INST_HALT);
4634 case BC_LEX_KEY_LIMITS:
4635 // "limits" is a compile-time command,
4636 // the output is produced at _parse time_.
4638 "BC_BASE_MAX = "BC_MAX_OBASE_STR "\n"
4639 "BC_DIM_MAX = "BC_MAX_DIM_STR "\n"
4640 "BC_SCALE_MAX = "BC_MAX_SCALE_STR "\n"
4641 "BC_STRING_MAX = "BC_MAX_STRING_STR"\n"
4642 "BC_NAME_MAX = "BC_MAX_NAME_STR "\n"
4643 "BC_NUM_MAX = "BC_MAX_NUM_STR "\n"
4644 "MAX Exponent = "BC_MAX_EXP_STR "\n"
4645 "Number of vars = "BC_MAX_VARS_STR "\n"
4649 case BC_LEX_KEY_PRINT:
4650 s = zbc_parse_print();
4652 case BC_LEX_KEY_QUIT:
4653 // "quit" is a compile-time command. For example,
4654 // "if (0 == 1) quit" terminates when parsing the statement,
4655 // not when it is executed
4656 QUIT_OR_RETURN_TO_MAIN;
4657 case BC_LEX_KEY_RETURN:
4659 RETURN_STATUS(bc_error("'return' not in a function"));
4660 s = zbc_parse_return();
4662 case BC_LEX_KEY_WHILE:
4663 s = zbc_parse_while();
4666 s = bc_error_bad_token();
4670 dbg_lex_done("%s:%d done", __func__, __LINE__);
4673 #define zbc_parse_stmt_possibly_auto(...) (zbc_parse_stmt_possibly_auto(__VA_ARGS__) COMMA_SUCCESS)
4675 static BC_STATUS zbc_parse_stmt_or_funcdef(void)
4677 BcParse *p = &G.prs;
4680 dbg_lex_enter("%s:%d entered", __func__, __LINE__);
4681 if (p->l.lex == XC_LEX_EOF)
4682 s = bc_error("end of file");
4683 else if (p->l.lex == BC_LEX_KEY_DEFINE) {
4684 dbg_lex("%s:%d p->l.lex:BC_LEX_KEY_DEFINE", __func__, __LINE__);
4685 s = zbc_parse_funcdef();
4687 dbg_lex("%s:%d p->l.lex:%d (not BC_LEX_KEY_DEFINE)", __func__, __LINE__, p->l.lex);
4688 s = zbc_parse_stmt();
4691 dbg_lex_done("%s:%d done", __func__, __LINE__);
4694 #define zbc_parse_stmt_or_funcdef(...) (zbc_parse_stmt_or_funcdef(__VA_ARGS__) COMMA_SUCCESS)
4696 // This is not a "z" function: can also return BC_STATUS_PARSE_EMPTY_EXP
4697 static BcStatus bc_parse_expr_empty_ok(uint8_t flags)
4699 BcParse *p = &G.prs;
4700 BcInst prev = XC_INST_PRINT;
4701 size_t nexprs = 0, ops_bgn = p->ops.len;
4702 unsigned nparens, nrelops;
4703 bool paren_first, paren_expr, rprn, assign, bin_last;
4705 dbg_lex_enter("%s:%d entered", __func__, __LINE__);
4706 paren_first = (p->l.lex == BC_LEX_LPAREN);
4707 nparens = nrelops = 0;
4708 paren_expr = rprn = assign = false;
4714 BcLexType t = p->l.lex;
4716 if (!lex_allowed_in_bc_expr(t))
4719 dbg_lex("%s:%d t:%d", __func__, __LINE__, t);
4721 s = BC_STATUS_SUCCESS;
4725 s = zbc_parse_incdec(&prev, &paren_expr, &nexprs, flags);
4726 rprn = bin_last = false;
4727 //get_token = false; - already is
4729 case XC_LEX_OP_MINUS:
4730 s = zbc_parse_minus(&prev, ops_bgn, rprn, &nexprs);
4732 //get_token = false; - already is
4733 bin_last = (prev == XC_INST_MINUS);
4735 case BC_LEX_OP_ASSIGN_POWER:
4736 case BC_LEX_OP_ASSIGN_MULTIPLY:
4737 case BC_LEX_OP_ASSIGN_DIVIDE:
4738 case BC_LEX_OP_ASSIGN_MODULUS:
4739 case BC_LEX_OP_ASSIGN_PLUS:
4740 case BC_LEX_OP_ASSIGN_MINUS:
4741 case BC_LEX_OP_ASSIGN:
4742 if (prev != XC_INST_VAR && prev != XC_INST_ARRAY_ELEM
4743 && prev != XC_INST_SCALE && prev != XC_INST_IBASE
4744 && prev != XC_INST_OBASE && prev != BC_INST_LAST
4746 return bc_error("bad assignment:"
4747 " left side must be variable"
4749 ); // note: shared string
4752 case XC_LEX_OP_POWER:
4753 case XC_LEX_OP_MULTIPLY:
4754 case XC_LEX_OP_DIVIDE:
4755 case XC_LEX_OP_MODULUS:
4756 case XC_LEX_OP_PLUS:
4757 case XC_LEX_OP_REL_EQ:
4758 case XC_LEX_OP_REL_LE:
4759 case XC_LEX_OP_REL_GE:
4760 case XC_LEX_OP_REL_NE:
4761 case XC_LEX_OP_REL_LT:
4762 case XC_LEX_OP_REL_GT:
4763 case BC_LEX_OP_BOOL_NOT:
4764 case BC_LEX_OP_BOOL_OR:
4765 case BC_LEX_OP_BOOL_AND:
4766 if (((t == BC_LEX_OP_BOOL_NOT) != bin_last)
4767 || (t != BC_LEX_OP_BOOL_NOT && prev == XC_INST_BOOL_NOT)
4769 return bc_error_bad_expression();
4771 nrelops += (t >= XC_LEX_OP_REL_EQ && t <= XC_LEX_OP_REL_GT);
4772 prev = BC_TOKEN_2_INST(t);
4773 bc_parse_operator(t, ops_bgn, &nexprs);
4776 //get_token = false; - already is
4777 bin_last = (t != BC_LEX_OP_BOOL_NOT);
4780 if (BC_PARSE_LEAF(prev, rprn))
4781 return bc_error_bad_expression();
4782 bc_vec_push(&p->ops, &t);
4786 rprn = bin_last = false;
4789 if (bin_last || prev == XC_INST_BOOL_NOT)
4790 return bc_error_bad_expression();
4795 dbg_lex_done("%s:%d done (returning EMPTY_EXP)", __func__, __LINE__);
4796 return BC_STATUS_PARSE_EMPTY_EXP;
4798 s = zbc_parse_rightParen(ops_bgn, &nexprs);
4801 paren_expr = rprn = true;
4805 if (BC_PARSE_LEAF(prev, rprn))
4806 return bc_error_bad_expression();
4807 s = zbc_parse_name(&prev, flags & ~BC_PARSE_NOCALL);
4809 rprn = bin_last = false;
4810 //get_token = false; - already is
4814 if (BC_PARSE_LEAF(prev, rprn))
4815 return bc_error_bad_expression();
4820 rprn = bin_last = false;
4823 case BC_LEX_KEY_IBASE:
4824 case BC_LEX_KEY_LAST:
4825 case BC_LEX_KEY_OBASE:
4826 if (BC_PARSE_LEAF(prev, rprn))
4827 return bc_error_bad_expression();
4828 prev = (char) (t - BC_LEX_KEY_IBASE + XC_INST_IBASE);
4829 bc_parse_push((char) prev);
4832 rprn = bin_last = false;
4835 case BC_LEX_KEY_LENGTH:
4836 case BC_LEX_KEY_SQRT:
4837 if (BC_PARSE_LEAF(prev, rprn))
4838 return bc_error_bad_expression();
4839 s = zbc_parse_builtin(t, flags, &prev);
4842 rprn = bin_last = false;
4845 case BC_LEX_KEY_READ:
4846 if (BC_PARSE_LEAF(prev, rprn))
4847 return bc_error_bad_expression();
4848 s = zbc_parse_read();
4849 prev = XC_INST_READ;
4852 rprn = bin_last = false;
4855 case BC_LEX_KEY_SCALE:
4856 if (BC_PARSE_LEAF(prev, rprn))
4857 return bc_error_bad_expression();
4858 s = zbc_parse_scale(&prev, flags);
4859 prev = XC_INST_SCALE;
4860 //get_token = false; - already is
4862 rprn = bin_last = false;
4866 return bc_error_bad_token();
4869 if (s || G_interrupt) // error, or ^C: stop parsing
4870 return BC_STATUS_FAILURE;
4878 while (p->ops.len > ops_bgn) {
4879 BcLexType top = BC_PARSE_TOP_OP(p);
4880 assign = (top >= BC_LEX_OP_ASSIGN_POWER && top <= BC_LEX_OP_ASSIGN);
4882 if (top == BC_LEX_LPAREN || top == BC_LEX_RPAREN)
4883 return bc_error_bad_expression();
4885 bc_parse_push(BC_TOKEN_2_INST(top));
4887 nexprs -= (top != BC_LEX_OP_BOOL_NOT && top != XC_LEX_NEG);
4888 bc_vec_pop(&p->ops);
4891 if (prev == XC_INST_BOOL_NOT || nexprs != 1)
4892 return bc_error_bad_expression();
4894 if (!(flags & BC_PARSE_REL) && nrelops) {
4896 s = zbc_POSIX_does_not_allow("comparison operators outside if or loops");
4898 } else if ((flags & BC_PARSE_REL) && nrelops > 1) {
4900 s = zbc_POSIX_requires("exactly one comparison operator per condition");
4904 if (flags & BC_PARSE_PRINT) {
4905 if (paren_first || !assign)
4906 bc_parse_push(XC_INST_PRINT);
4907 bc_parse_push(XC_INST_POP);
4910 dbg_lex_done("%s:%d done", __func__, __LINE__);
4911 return BC_STATUS_SUCCESS;
4918 static BC_STATUS zdc_parse_register(void)
4920 BcParse *p = &G.prs;
4924 if (s) RETURN_STATUS(s);
4925 if (p->l.lex != XC_LEX_NAME) RETURN_STATUS(bc_error_bad_token());
4927 bc_parse_pushName(p->l.lex_buf.v);
4931 #define zdc_parse_register(...) (zdc_parse_register(__VA_ARGS__) COMMA_SUCCESS)
4933 static void dc_parse_string(void)
4935 BcParse *p = &G.prs;
4937 size_t len = G.prog.strs.len;
4939 dbg_lex_enter("%s:%d entered", __func__, __LINE__);
4941 str = xstrdup(p->l.lex_buf.v);
4942 bc_parse_push(XC_INST_STR);
4943 bc_parse_pushIndex(len);
4944 bc_vec_push(&G.prog.strs, &str);
4946 // Explanation needed here
4947 bc_program_add_fn();
4948 p->func = bc_program_func(p->fidx);
4950 dbg_lex_done("%s:%d done", __func__, __LINE__);
4953 static BC_STATUS zdc_parse_mem(uint8_t inst, bool name, bool store)
4957 bc_parse_push(inst);
4959 s = zdc_parse_register();
4960 if (s) RETURN_STATUS(s);
4964 bc_parse_push(DC_INST_SWAP);
4965 bc_parse_push(XC_INST_ASSIGN);
4966 bc_parse_push(XC_INST_POP);
4969 RETURN_STATUS(BC_STATUS_SUCCESS);
4971 #define zdc_parse_mem(...) (zdc_parse_mem(__VA_ARGS__) COMMA_SUCCESS)
4973 static BC_STATUS zdc_parse_cond(uint8_t inst)
4975 BcParse *p = &G.prs;
4978 bc_parse_push(inst);
4979 bc_parse_push(DC_INST_EXEC_COND);
4981 s = zdc_parse_register();
4982 if (s) RETURN_STATUS(s);
4985 if (s) RETURN_STATUS(s);
4987 // Note that 'else' part can not be on the next line:
4988 // echo -e '[1p]sa [2p]sb 2 1>a eb' | dc - OK, prints "2"
4989 // echo -e '[1p]sa [2p]sb 2 1>a\neb' | dc - parse error
4990 if (p->l.lex == DC_LEX_ELSE) {
4991 s = zdc_parse_register();
4992 if (s) RETURN_STATUS(s);
4995 bc_parse_push(BC_PARSE_STREND);
5000 #define zdc_parse_cond(...) (zdc_parse_cond(__VA_ARGS__) COMMA_SUCCESS)
5002 static BC_STATUS zdc_parse_token(BcLexType t)
5006 bool assign, get_token;
5008 dbg_lex_enter("%s:%d entered", __func__, __LINE__);
5009 s = BC_STATUS_SUCCESS;
5012 case XC_LEX_OP_REL_EQ:
5013 case XC_LEX_OP_REL_LE:
5014 case XC_LEX_OP_REL_GE:
5015 case XC_LEX_OP_REL_NE:
5016 case XC_LEX_OP_REL_LT:
5017 case XC_LEX_OP_REL_GT:
5018 dbg_lex("%s:%d LEX_OP_REL_xyz", __func__, __LINE__);
5019 s = zdc_parse_cond(t - XC_LEX_OP_REL_EQ + XC_INST_REL_EQ);
5024 dbg_lex("%s:%d LEX_[S]COLON", __func__, __LINE__);
5025 s = zdc_parse_mem(XC_INST_ARRAY_ELEM, true, t == DC_LEX_COLON);
5028 dbg_lex("%s:%d LEX_STR", __func__, __LINE__);
5032 dbg_lex("%s:%d LEX_NEG", __func__, __LINE__);
5034 if (s) RETURN_STATUS(s);
5035 if (G.prs.l.lex != XC_LEX_NUMBER)
5036 RETURN_STATUS(bc_error_bad_token());
5038 bc_parse_push(XC_INST_NEG);
5041 dbg_lex("%s:%d LEX_NUMBER", __func__, __LINE__);
5045 dbg_lex("%s:%d LEX_KEY_READ", __func__, __LINE__);
5046 bc_parse_push(XC_INST_READ);
5048 case DC_LEX_OP_ASSIGN:
5049 case DC_LEX_STORE_PUSH:
5050 dbg_lex("%s:%d LEX_OP_ASSIGN/STORE_PUSH", __func__, __LINE__);
5051 assign = (t == DC_LEX_OP_ASSIGN);
5052 inst = assign ? XC_INST_VAR : DC_INST_PUSH_TO_VAR;
5053 s = zdc_parse_mem(inst, true, assign);
5056 case DC_LEX_LOAD_POP:
5057 dbg_lex("%s:%d LEX_OP_LOAD[_POP]", __func__, __LINE__);
5058 inst = t == DC_LEX_LOAD_POP ? DC_INST_PUSH_VAR : DC_INST_LOAD;
5059 s = zdc_parse_mem(inst, true, false);
5061 case DC_LEX_STORE_IBASE:
5062 case DC_LEX_STORE_SCALE:
5063 case DC_LEX_STORE_OBASE:
5064 dbg_lex("%s:%d LEX_OP_STORE_I/OBASE/SCALE", __func__, __LINE__);
5065 inst = t - DC_LEX_STORE_IBASE + XC_INST_IBASE;
5066 s = zdc_parse_mem(inst, false, true);
5069 dbg_lex_done("%s:%d done (bad token)", __func__, __LINE__);
5070 RETURN_STATUS(bc_error_bad_token());
5073 if (!s && get_token) s = zbc_lex_next();
5075 dbg_lex_done("%s:%d done", __func__, __LINE__);
5078 #define zdc_parse_token(...) (zdc_parse_token(__VA_ARGS__) COMMA_SUCCESS)
5080 static BC_STATUS zdc_parse_expr(void)
5082 BcParse *p = &G.prs;
5085 i = (int)p->l.lex - (int)XC_LEX_OP_POWER;
5087 BcInst inst = dc_LEX_to_INST[i];
5088 if (inst != DC_INST_INVALID) {
5089 bc_parse_push(inst);
5090 RETURN_STATUS(zbc_lex_next());
5093 RETURN_STATUS(zdc_parse_token(p->l.lex));
5095 #define zdc_parse_expr(...) (zdc_parse_expr(__VA_ARGS__) COMMA_SUCCESS)
5097 static BC_STATUS zdc_parse_exprs_until_eof(void)
5099 BcParse *p = &G.prs;
5100 dbg_lex_enter("%s:%d entered, p->l.lex:%d", __func__, __LINE__, p->l.lex);
5101 while (p->l.lex != XC_LEX_EOF) {
5102 BcStatus s = zdc_parse_expr();
5103 if (s) RETURN_STATUS(s);
5106 dbg_lex_done("%s:%d done", __func__, __LINE__);
5107 RETURN_STATUS(BC_STATUS_SUCCESS);
5109 #define zdc_parse_exprs_until_eof(...) (zdc_parse_exprs_until_eof(__VA_ARGS__) COMMA_SUCCESS)
5117 #define STACK_HAS_MORE_THAN(s, n) ((s)->len > ((size_t)(n)))
5118 #define STACK_HAS_EQUAL_OR_MORE_THAN(s, n) ((s)->len >= ((size_t)(n)))
5120 static BcVec* bc_program_search(char *id, bool var)
5127 v = var ? &G.prog.vars : &G.prog.arrs;
5128 map = var ? &G.prog.var_map : &G.prog.arr_map;
5132 new = bc_map_insert(map, &e, &i); // 1 if insertion was successful
5136 bc_array_init(&v2, var);
5137 bc_vec_push(v, &v2);
5140 ptr = bc_vec_item(map, i);
5141 if (new) ptr->name = xstrdup(e.name);
5142 return bc_vec_item(v, ptr->idx);
5145 // 'num' need not be initialized on entry
5146 static BC_STATUS zbc_program_num(BcResult *r, BcNum **num, bool hex)
5150 case XC_RESULT_TEMP:
5151 case XC_RESULT_IBASE:
5152 case XC_RESULT_SCALE:
5153 case XC_RESULT_OBASE:
5156 case XC_RESULT_CONSTANT: {
5162 str = *bc_program_const(r->d.id.idx);
5165 bc_num_init(&r->d.n, len);
5167 hex = hex && len == 1;
5168 base_t = hex ? 16 : G.prog.ib_t;
5169 s = zbc_num_parse(&r->d.n, str, base_t);
5171 bc_num_free(&r->d.n);
5175 r->t = XC_RESULT_TEMP;
5179 case XC_RESULT_ARRAY:
5180 case XC_RESULT_ARRAY_ELEM: {
5183 v = bc_program_search(r->d.id.name, r->t == XC_RESULT_VAR);
5185 if (r->t == XC_RESULT_ARRAY_ELEM) {
5187 if (v->len <= r->d.id.idx) bc_array_expand(v, r->d.id.idx + 1);
5188 *num = bc_vec_item(v, r->d.id.idx);
5190 *num = bc_vec_top(v);
5194 case BC_RESULT_LAST:
5195 *num = &G.prog.last;
5203 // Testing the theory that dc does not reach LAST/ONE
5204 bb_error_msg_and_die("BUG:%d", r->t);
5208 RETURN_STATUS(BC_STATUS_SUCCESS);
5210 #define zbc_program_num(...) (zbc_program_num(__VA_ARGS__) COMMA_SUCCESS)
5212 static BC_STATUS zbc_program_binOpPrep(BcResult **l, BcNum **ln,
5213 BcResult **r, BcNum **rn, bool assign)
5217 BcResultType lt, rt;
5219 if (!STACK_HAS_MORE_THAN(&G.prog.results, 1))
5220 RETURN_STATUS(bc_error_stack_has_too_few_elements());
5222 *r = bc_vec_item_rev(&G.prog.results, 0);
5223 *l = bc_vec_item_rev(&G.prog.results, 1);
5227 hex = assign && (lt == XC_RESULT_IBASE || lt == XC_RESULT_OBASE);
5229 s = zbc_program_num(*l, ln, false);
5230 if (s) RETURN_STATUS(s);
5231 s = zbc_program_num(*r, rn, hex);
5232 if (s) RETURN_STATUS(s);
5234 // We run this again under these conditions in case any vector has been
5235 // reallocated out from under the BcNums or arrays we had.
5236 if (lt == rt && (lt == XC_RESULT_VAR || lt == XC_RESULT_ARRAY_ELEM)) {
5237 s = zbc_program_num(*l, ln, false);
5238 if (s) RETURN_STATUS(s);
5241 if (!BC_PROG_NUM((*l), (*ln)) && (!assign || (*l)->t != XC_RESULT_VAR))
5242 RETURN_STATUS(bc_error_variable_is_wrong_type());
5243 if (!assign && !BC_PROG_NUM((*r), (*ln)))
5244 RETURN_STATUS(bc_error_variable_is_wrong_type());
5248 #define zbc_program_binOpPrep(...) (zbc_program_binOpPrep(__VA_ARGS__) COMMA_SUCCESS)
5250 static void bc_program_binOpRetire(BcResult *r)
5252 r->t = XC_RESULT_TEMP;
5253 bc_vec_pop(&G.prog.results);
5254 bc_result_pop_and_push(r);
5257 // Note: *r and *n need not be initialized by caller
5258 static BC_STATUS zbc_program_prep(BcResult **r, BcNum **n)
5262 if (!STACK_HAS_MORE_THAN(&G.prog.results, 0))
5263 RETURN_STATUS(bc_error_stack_has_too_few_elements());
5264 *r = bc_vec_top(&G.prog.results);
5266 s = zbc_program_num(*r, n, false);
5267 if (s) RETURN_STATUS(s);
5269 if (!BC_PROG_NUM((*r), (*n)))
5270 RETURN_STATUS(bc_error_variable_is_wrong_type());
5274 #define zbc_program_prep(...) (zbc_program_prep(__VA_ARGS__) COMMA_SUCCESS)
5276 static void bc_program_retire(BcResult *r, BcResultType t)
5279 bc_result_pop_and_push(r);
5282 static BC_STATUS zbc_program_op(char inst)
5285 BcResult *opd1, *opd2, res;
5288 s = zbc_program_binOpPrep(&opd1, &n1, &opd2, &n2, false);
5289 if (s) RETURN_STATUS(s);
5290 bc_num_init_DEF_SIZE(&res.d.n);
5292 s = BC_STATUS_SUCCESS;
5293 IF_ERROR_RETURN_POSSIBLE(s =) zbc_program_ops[inst - XC_INST_POWER](n1, n2, &res.d.n, G.prog.scale);
5295 bc_program_binOpRetire(&res);
5299 bc_num_free(&res.d.n);
5302 #define zbc_program_op(...) (zbc_program_op(__VA_ARGS__) COMMA_SUCCESS)
5304 static BC_STATUS zbc_program_read(void)
5312 bc_char_vec_init(&buf);
5313 bc_read_line(&buf, stdin);
5315 f = bc_program_func(BC_PROG_READ);
5316 bc_vec_pop_all(&f->code);
5318 sv_parse = G.prs; // struct copy
5319 bc_parse_create(BC_PROG_READ);
5320 //bc_lex_file(&G.prs.l); - not needed, error line info is not printed for read()
5322 s = zbc_parse_text_init(buf.v);
5323 if (s) goto exec_err;
5325 IF_BC(s = zbc_parse_expr(0));
5327 IF_DC(s = zdc_parse_exprs_until_eof());
5329 if (s) goto exec_err;
5331 if (G.prs.l.lex != XC_LEX_NLINE && G.prs.l.lex != XC_LEX_EOF) {
5332 s = bc_error("bad read() expression");
5336 ip.func = BC_PROG_READ;
5338 IF_BC(ip.results_len_before_call = G.prog.results.len;)
5340 bc_parse_push(XC_INST_RET);
5341 bc_vec_push(&G.prog.exestack, &ip);
5345 G.prs = sv_parse; // struct copy
5349 #define zbc_program_read(...) (zbc_program_read(__VA_ARGS__) COMMA_SUCCESS)
5351 static size_t bc_program_index(char *code, size_t *bgn)
5353 unsigned char *bytes = (void*)(code + *bgn);
5363 for (i = 0; i < amt; i += 8)
5364 res |= (size_t)(*bytes++) << i;
5369 static char *bc_program_name(char *code, size_t *bgn)
5375 s = xmalloc(strchr(code, BC_PARSE_STREND) - code + 1);
5379 if (c == BC_PARSE_STREND)
5389 static void bc_program_printString(const char *str)
5393 // Example: echo '[]ap' | dc
5394 // should print two bytes: 0x00, 0x0A
5401 if (c != '\\' || !*str)
5421 G.prog.nchars = SIZE_MAX;
5433 // Just print the backslash and following character.
5444 static void bc_num_printNewline(void)
5446 if (G.prog.nchars == G.prog.len - 1) {
5454 static FAST_FUNC void dc_num_printChar(size_t num, size_t width, bool radix)
5457 bb_putchar((char) num);
5458 G.prog.nchars += width;
5462 static FAST_FUNC void bc_num_printDigits(size_t num, size_t width, bool radix)
5466 bc_num_printNewline();
5467 bb_putchar(radix ? '.' : ' ');
5470 bc_num_printNewline();
5471 for (exp = 0, pow = 1; exp < width - 1; ++exp, pow *= 10)
5474 for (exp = 0; exp < width; pow /= 10, ++G.prog.nchars, ++exp) {
5476 bc_num_printNewline();
5479 bb_putchar(((char) dig) + '0');
5483 static FAST_FUNC void bc_num_printHex(size_t num, size_t width, bool radix)
5486 bc_num_printNewline();
5491 bc_num_printNewline();
5492 bb_putchar(bb_hexdigits_upcase[num]);
5493 G.prog.nchars += width;
5496 static void bc_num_printDecimal(BcNum *n)
5498 size_t i, rdx = n->rdx - 1;
5505 for (i = n->len - 1; i < n->len; --i)
5506 bc_num_printHex((size_t) n->num[i], 1, i == rdx);
5509 typedef void (*BcNumDigitOp)(size_t, size_t, bool) FAST_FUNC;
5511 static BC_STATUS zbc_num_printNum(BcNum *n, unsigned base_t, size_t width, BcNumDigitOp print)
5516 BcDig base_digs[ULONG_NUM_BUFSIZE];
5517 BcNum intp, fracp, digit, frac_len;
5518 unsigned long dig, *ptr;
5523 print(0, width, false);
5524 RETURN_STATUS(BC_STATUS_SUCCESS);
5527 bc_vec_init(&stack, sizeof(long), NULL);
5528 bc_num_init(&intp, n->len);
5529 bc_num_init(&fracp, n->rdx);
5530 bc_num_init(&digit, width);
5531 bc_num_init(&frac_len, BC_NUM_INT(n));
5532 bc_num_copy(&intp, n);
5533 bc_num_one(&frac_len);
5534 base.cap = ARRAY_SIZE(base_digs);
5535 base.num = base_digs;
5536 bc_num_ulong2num(&base, base_t);
5538 bc_num_truncate(&intp, intp.rdx);
5539 s = zbc_num_sub(n, &intp, &fracp, 0);
5542 while (intp.len != 0) {
5543 s = zbc_num_divmod(&intp, &base, &intp, &digit, 0);
5545 s = zbc_num_ulong(&digit, &dig);
5547 bc_vec_push(&stack, &dig);
5550 for (i = 0; i < stack.len; ++i) {
5551 ptr = bc_vec_item_rev(&stack, i);
5552 print(*ptr, width, false);
5555 if (!n->rdx) goto err;
5557 for (radix = true; frac_len.len <= n->rdx; radix = false) {
5558 s = zbc_num_mul(&fracp, &base, &fracp, n->rdx);
5560 s = zbc_num_ulong(&fracp, &dig);
5562 bc_num_ulong2num(&intp, dig);
5563 s = zbc_num_sub(&fracp, &intp, &fracp, 0);
5565 print(dig, width, radix);
5566 s = zbc_num_mul(&frac_len, &base, &frac_len, 0);
5570 bc_num_free(&frac_len);
5571 bc_num_free(&digit);
5572 bc_num_free(&fracp);
5574 bc_vec_free(&stack);
5577 #define zbc_num_printNum(...) (zbc_num_printNum(__VA_ARGS__) COMMA_SUCCESS)
5579 static BC_STATUS zbc_num_printBase(BcNum *n)
5593 if (G.prog.ob_t <= BC_NUM_MAX_IBASE) {
5595 print = bc_num_printHex;
5597 unsigned i = G.prog.ob_t - 1;
5605 print = bc_num_printDigits;
5608 s = zbc_num_printNum(n, G.prog.ob_t, width, print);
5613 #define zbc_num_printBase(...) (zbc_num_printBase(__VA_ARGS__) COMMA_SUCCESS)
5615 static BC_STATUS zbc_num_print(BcNum *n, bool newline)
5617 BcStatus s = BC_STATUS_SUCCESS;
5619 bc_num_printNewline();
5624 } else if (G.prog.ob_t == 10)
5625 bc_num_printDecimal(n);
5627 s = zbc_num_printBase(n);
5636 #define zbc_num_print(...) (zbc_num_print(__VA_ARGS__) COMMA_SUCCESS)
5638 static BC_STATUS zbc_program_print(char inst, size_t idx)
5643 bool pop = (inst != XC_INST_PRINT);
5645 if (!STACK_HAS_MORE_THAN(&G.prog.results, idx))
5646 RETURN_STATUS(bc_error_stack_has_too_few_elements());
5648 r = bc_vec_item_rev(&G.prog.results, idx);
5649 s = zbc_program_num(r, &num, false);
5650 if (s) RETURN_STATUS(s);
5652 if (BC_PROG_NUM(r, num)) {
5653 s = zbc_num_print(num, !pop);
5655 if (!s && IS_BC) bc_num_copy(&G.prog.last, num);
5660 idx = (r->t == XC_RESULT_STR) ? r->d.id.idx : num->rdx;
5661 str = *bc_program_str(idx);
5663 if (inst == XC_INST_PRINT_STR) {
5666 if (c == '\0') break;
5669 if (c == '\n') G.prog.nchars = 0;
5672 bc_program_printString(str);
5673 if (inst == XC_INST_PRINT) bb_putchar('\n');
5677 if (!s && pop) bc_vec_pop(&G.prog.results);
5681 #define zbc_program_print(...) (zbc_program_print(__VA_ARGS__) COMMA_SUCCESS)
5683 static BC_STATUS zbc_program_negate(void)
5689 s = zbc_program_prep(&ptr, &num);
5690 if (s) RETURN_STATUS(s);
5692 bc_num_init(&res.d.n, num->len);
5693 bc_num_copy(&res.d.n, num);
5694 if (res.d.n.len) res.d.n.neg = !res.d.n.neg;
5696 bc_program_retire(&res, XC_RESULT_TEMP);
5700 #define zbc_program_negate(...) (zbc_program_negate(__VA_ARGS__) COMMA_SUCCESS)
5702 static BC_STATUS zbc_program_logical(char inst)
5705 BcResult *opd1, *opd2, res;
5709 s = zbc_program_binOpPrep(&opd1, &n1, &opd2, &n2, false);
5710 if (s) RETURN_STATUS(s);
5712 bc_num_init_DEF_SIZE(&res.d.n);
5714 if (inst == XC_INST_BOOL_AND)
5715 cond = bc_num_cmp(n1, &G.prog.zero) && bc_num_cmp(n2, &G.prog.zero);
5716 else if (inst == XC_INST_BOOL_OR)
5717 cond = bc_num_cmp(n1, &G.prog.zero) || bc_num_cmp(n2, &G.prog.zero);
5719 cond = bc_num_cmp(n1, n2);
5721 case XC_INST_REL_EQ:
5724 case XC_INST_REL_LE:
5727 case XC_INST_REL_GE:
5730 case XC_INST_REL_LT:
5733 case XC_INST_REL_GT:
5736 default: // = case XC_INST_REL_NE:
5737 //cond = (cond != 0); - not needed
5742 if (cond) bc_num_one(&res.d.n);
5743 //else bc_num_zero(&res.d.n); - already is
5745 bc_program_binOpRetire(&res);
5749 #define zbc_program_logical(...) (zbc_program_logical(__VA_ARGS__) COMMA_SUCCESS)
5752 static BC_STATUS zdc_program_assignStr(BcResult *r, BcVec *v, bool push)
5757 memset(&n2, 0, sizeof(BcNum));
5758 n2.rdx = res.d.id.idx = r->d.id.idx;
5759 res.t = XC_RESULT_STR;
5762 if (!STACK_HAS_MORE_THAN(&G.prog.results, 1))
5763 RETURN_STATUS(bc_error_stack_has_too_few_elements());
5765 bc_vec_pop(&G.prog.results);
5768 bc_result_pop_and_push(&res);
5769 bc_vec_push(v, &n2);
5771 RETURN_STATUS(BC_STATUS_SUCCESS);
5773 #define zdc_program_assignStr(...) (zdc_program_assignStr(__VA_ARGS__) COMMA_SUCCESS)
5776 static BC_STATUS zbc_program_copyToVar(char *name, bool var)
5783 if (!STACK_HAS_MORE_THAN(&G.prog.results, 0))
5784 RETURN_STATUS(bc_error_stack_has_too_few_elements());
5786 ptr = bc_vec_top(&G.prog.results);
5787 if ((ptr->t == XC_RESULT_ARRAY) != !var)
5788 RETURN_STATUS(bc_error_variable_is_wrong_type());
5789 v = bc_program_search(name, var);
5792 if (ptr->t == XC_RESULT_STR && !var)
5793 RETURN_STATUS(bc_error_variable_is_wrong_type());
5794 if (ptr->t == XC_RESULT_STR)
5795 RETURN_STATUS(zdc_program_assignStr(ptr, v, true));
5798 s = zbc_program_num(ptr, &n, false);
5799 if (s) RETURN_STATUS(s);
5801 // Do this once more to make sure that pointers were not invalidated.
5802 v = bc_program_search(name, var);
5805 bc_num_init_DEF_SIZE(&r.d.n);
5806 bc_num_copy(&r.d.n, n);
5808 bc_array_init(&r.d.v, true);
5809 bc_array_copy(&r.d.v, (BcVec *) n);
5812 bc_vec_push(v, &r.d);
5813 bc_vec_pop(&G.prog.results);
5817 #define zbc_program_copyToVar(...) (zbc_program_copyToVar(__VA_ARGS__) COMMA_SUCCESS)
5819 static BC_STATUS zbc_program_assign(char inst)
5822 BcResult *left, *right, res;
5824 bool assign = (inst == XC_INST_ASSIGN);
5827 s = zbc_program_binOpPrep(&left, &l, &right, &r, assign);
5828 if (s) RETURN_STATUS(s);
5830 ib = left->t == XC_RESULT_IBASE;
5831 sc = left->t == XC_RESULT_SCALE;
5834 if (right->t == XC_RESULT_STR) {
5837 if (left->t != XC_RESULT_VAR)
5838 RETURN_STATUS(bc_error_variable_is_wrong_type());
5839 v = bc_program_search(left->d.id.name, true);
5841 RETURN_STATUS(zdc_program_assignStr(right, v, false));
5845 if (left->t == XC_RESULT_CONSTANT || left->t == XC_RESULT_TEMP)
5846 RETURN_STATUS(bc_error("bad assignment:"
5847 " left side must be variable"
5849 )); // note: shared string
5852 if (inst == BC_INST_ASSIGN_DIVIDE && !bc_num_cmp(r, &G.prog.zero))
5853 RETURN_STATUS(bc_error("divide by zero"));
5858 s = BC_STATUS_SUCCESS;
5859 IF_ERROR_RETURN_POSSIBLE(s =) zbc_program_ops[inst - BC_INST_ASSIGN_POWER](l, r, l, G.prog.scale);
5861 if (s) RETURN_STATUS(s);
5866 if (ib || sc || left->t == XC_RESULT_OBASE) {
5867 static const char *const msg[] = {
5868 "bad ibase; must be [2,16]", //XC_RESULT_IBASE
5869 "bad obase; must be [2,"BC_MAX_OBASE_STR"]", //XC_RESULT_OBASE
5870 "bad scale; must be [0,"BC_MAX_SCALE_STR"]", //XC_RESULT_SCALE
5876 s = zbc_num_ulong(l, &val);
5877 if (s) RETURN_STATUS(s);
5878 s = left->t - XC_RESULT_IBASE;
5881 ptr = &G.prog.scale;
5884 RETURN_STATUS(bc_error(msg[s]));
5885 max = ib ? BC_NUM_MAX_IBASE : BC_MAX_OBASE;
5886 ptr = ib ? &G.prog.ib_t : &G.prog.ob_t;
5890 RETURN_STATUS(bc_error(msg[s]));
5892 *ptr = (size_t) val;
5893 s = BC_STATUS_SUCCESS;
5896 bc_num_init(&res.d.n, l->len);
5897 bc_num_copy(&res.d.n, l);
5898 bc_program_binOpRetire(&res);
5902 #define zbc_program_assign(...) (zbc_program_assign(__VA_ARGS__) COMMA_SUCCESS)
5905 #define bc_program_pushVar(code, bgn, pop, copy) \
5906 bc_program_pushVar(code, bgn)
5907 // for bc, 'pop' and 'copy' are always false
5909 static BC_STATUS bc_program_pushVar(char *code, size_t *bgn,
5910 bool pop, bool copy)
5913 char *name = bc_program_name(code, bgn);
5915 r.t = XC_RESULT_VAR;
5920 BcVec *v = bc_program_search(name, true);
5921 BcNum *num = bc_vec_top(v);
5924 if (!STACK_HAS_MORE_THAN(v, 1 - copy)) {
5925 RETURN_STATUS(bc_error_stack_has_too_few_elements());
5928 if (!BC_PROG_STR(num)) {
5929 r.t = XC_RESULT_TEMP;
5930 bc_num_init_DEF_SIZE(&r.d.n);
5931 bc_num_copy(&r.d.n, num);
5933 r.t = XC_RESULT_STR;
5934 r.d.id.idx = num->rdx;
5937 if (!copy) bc_vec_pop(v);
5941 bc_vec_push(&G.prog.results, &r);
5943 RETURN_STATUS(BC_STATUS_SUCCESS);
5945 #define zbc_program_pushVar(...) (bc_program_pushVar(__VA_ARGS__) COMMA_SUCCESS)
5947 static BC_STATUS zbc_program_pushArray(char *code, size_t *bgn, char inst)
5949 BcStatus s = BC_STATUS_SUCCESS;
5953 r.d.id.name = bc_program_name(code, bgn);
5955 if (inst == XC_INST_ARRAY) {
5956 r.t = XC_RESULT_ARRAY;
5957 bc_vec_push(&G.prog.results, &r);
5962 s = zbc_program_prep(&operand, &num);
5964 s = zbc_num_ulong(num, &temp);
5967 if (temp > BC_MAX_DIM) {
5968 s = bc_error("array too long; must be [1,"BC_MAX_DIM_STR"]");
5972 r.d.id.idx = (size_t) temp;
5973 bc_program_retire(&r, XC_RESULT_ARRAY_ELEM);
5976 if (s) free(r.d.id.name);
5979 #define zbc_program_pushArray(...) (zbc_program_pushArray(__VA_ARGS__) COMMA_SUCCESS)
5982 static BC_STATUS zbc_program_incdec(char inst)
5985 BcResult *ptr, res, copy;
5989 s = zbc_program_prep(&ptr, &num);
5990 if (s) RETURN_STATUS(s);
5992 if (inst == BC_INST_INC_POST || inst == BC_INST_DEC_POST) {
5993 copy.t = XC_RESULT_TEMP;
5994 bc_num_init(©.d.n, num->len);
5995 bc_num_copy(©.d.n, num);
5998 res.t = BC_RESULT_ONE;
5999 inst = (inst == BC_INST_INC_PRE || inst == BC_INST_INC_POST)
6000 ? BC_INST_ASSIGN_PLUS
6001 : BC_INST_ASSIGN_MINUS;
6003 bc_vec_push(&G.prog.results, &res);
6004 s = zbc_program_assign(inst);
6005 if (s) RETURN_STATUS(s);
6007 if (inst2 == BC_INST_INC_POST || inst2 == BC_INST_DEC_POST) {
6008 bc_result_pop_and_push(©);
6013 #define zbc_program_incdec(...) (zbc_program_incdec(__VA_ARGS__) COMMA_SUCCESS)
6015 static BC_STATUS zbc_program_call(char *code, size_t *idx)
6023 nparams = bc_program_index(code, idx);
6025 ip.func = bc_program_index(code, idx);
6026 func = bc_program_func(ip.func);
6028 if (func->code.len == 0) {
6029 RETURN_STATUS(bc_error("undefined function"));
6031 if (nparams != func->nparams) {
6032 RETURN_STATUS(bc_error_fmt("function has %u parameters, but called with %u", func->nparams, nparams));
6034 ip.results_len_before_call = G.prog.results.len - nparams;
6036 for (i = 0; i < nparams; ++i) {
6039 a = bc_vec_item(&func->autos, nparams - 1 - i);
6040 arg = bc_vec_top(&G.prog.results);
6042 if ((!a->idx) != (arg->t == XC_RESULT_ARRAY) || arg->t == XC_RESULT_STR)
6043 RETURN_STATUS(bc_error_variable_is_wrong_type());
6045 s = zbc_program_copyToVar(a->name, a->idx);
6046 if (s) RETURN_STATUS(s);
6049 a = bc_vec_item(&func->autos, i);
6050 for (; i < func->autos.len; i++, a++) {
6053 v = bc_program_search(a->name, a->idx);
6056 bc_num_init_DEF_SIZE(&n2);
6057 bc_vec_push(v, &n2);
6060 bc_array_init(&v2, true);
6061 bc_vec_push(v, &v2);
6065 bc_vec_push(&G.prog.exestack, &ip);
6067 RETURN_STATUS(BC_STATUS_SUCCESS);
6069 #define zbc_program_call(...) (zbc_program_call(__VA_ARGS__) COMMA_SUCCESS)
6071 static BC_STATUS zbc_program_return(char inst)
6077 BcInstPtr *ip = bc_vec_top(&G.prog.exestack);
6079 if (!STACK_HAS_EQUAL_OR_MORE_THAN(&G.prog.results, ip->results_len_before_call + (inst == XC_INST_RET)))
6080 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6082 f = bc_program_func(ip->func);
6083 res.t = XC_RESULT_TEMP;
6085 if (inst == XC_INST_RET) {
6088 BcResult *operand = bc_vec_top(&G.prog.results);
6090 s = zbc_program_num(operand, &num, false);
6091 if (s) RETURN_STATUS(s);
6092 bc_num_init(&res.d.n, num->len);
6093 bc_num_copy(&res.d.n, num);
6095 bc_num_init_DEF_SIZE(&res.d.n);
6096 //bc_num_zero(&res.d.n); - already is
6099 // We need to pop arguments as well, so this takes that into account.
6100 a = (void*)f->autos.v;
6101 for (i = 0; i < f->autos.len; i++, a++) {
6103 v = bc_program_search(a->name, a->idx);
6107 bc_vec_npop(&G.prog.results, G.prog.results.len - ip->results_len_before_call);
6108 bc_vec_push(&G.prog.results, &res);
6109 bc_vec_pop(&G.prog.exestack);
6111 RETURN_STATUS(BC_STATUS_SUCCESS);
6113 #define zbc_program_return(...) (zbc_program_return(__VA_ARGS__) COMMA_SUCCESS)
6116 static unsigned long bc_program_scale(BcNum *n)
6118 return (unsigned long) n->rdx;
6121 static unsigned long bc_program_len(BcNum *n)
6123 size_t len = n->len;
6125 if (n->rdx != len) return len;
6127 if (len == 0) break;
6129 if (n->num[len] != 0) break;
6134 static BC_STATUS zbc_program_builtin(char inst)
6140 bool len = (inst == XC_INST_LENGTH);
6142 if (!STACK_HAS_MORE_THAN(&G.prog.results, 0))
6143 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6144 opnd = bc_vec_top(&G.prog.results);
6146 s = zbc_program_num(opnd, &num, false);
6147 if (s) RETURN_STATUS(s);
6150 if (!BC_PROG_NUM(opnd, num) && !len)
6151 RETURN_STATUS(bc_error_variable_is_wrong_type());
6154 bc_num_init_DEF_SIZE(&res.d.n);
6156 if (inst == XC_INST_SQRT)
6157 s = zbc_num_sqrt(num, &res.d.n, G.prog.scale);
6159 else if (len != 0 && opnd->t == XC_RESULT_ARRAY) {
6160 bc_num_ulong2num(&res.d.n, (unsigned long) ((BcVec *) num)->len);
6164 else if (len != 0 && !BC_PROG_NUM(opnd, num)) {
6166 size_t idx = opnd->t == XC_RESULT_STR ? opnd->d.id.idx : num->rdx;
6168 str = bc_program_str(idx);
6169 bc_num_ulong2num(&res.d.n, strlen(*str));
6173 bc_num_ulong2num(&res.d.n, len ? bc_program_len(num) : bc_program_scale(num));
6176 bc_program_retire(&res, XC_RESULT_TEMP);
6180 #define zbc_program_builtin(...) (zbc_program_builtin(__VA_ARGS__) COMMA_SUCCESS)
6183 static BC_STATUS zdc_program_divmod(void)
6186 BcResult *opd1, *opd2, res, res2;
6189 s = zbc_program_binOpPrep(&opd1, &n1, &opd2, &n2, false);
6190 if (s) RETURN_STATUS(s);
6192 bc_num_init_DEF_SIZE(&res.d.n);
6193 bc_num_init(&res2.d.n, n2->len);
6195 s = zbc_num_divmod(n1, n2, &res2.d.n, &res.d.n, G.prog.scale);
6198 bc_program_binOpRetire(&res2);
6199 res.t = XC_RESULT_TEMP;
6200 bc_vec_push(&G.prog.results, &res);
6204 bc_num_free(&res2.d.n);
6205 bc_num_free(&res.d.n);
6208 #define zdc_program_divmod(...) (zdc_program_divmod(__VA_ARGS__) COMMA_SUCCESS)
6210 static BC_STATUS zdc_program_modexp(void)
6213 BcResult *r1, *r2, *r3, res;
6214 BcNum *n1, *n2, *n3;
6216 if (!STACK_HAS_MORE_THAN(&G.prog.results, 2))
6217 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6218 s = zbc_program_binOpPrep(&r2, &n2, &r3, &n3, false);
6219 if (s) RETURN_STATUS(s);
6221 r1 = bc_vec_item_rev(&G.prog.results, 2);
6222 s = zbc_program_num(r1, &n1, false);
6223 if (s) RETURN_STATUS(s);
6224 if (!BC_PROG_NUM(r1, n1))
6225 RETURN_STATUS(bc_error_variable_is_wrong_type());
6227 // Make sure that the values have their pointers updated, if necessary.
6228 if (r1->t == XC_RESULT_VAR || r1->t == XC_RESULT_ARRAY_ELEM) {
6229 if (r1->t == r2->t) {
6230 s = zbc_program_num(r2, &n2, false);
6231 if (s) RETURN_STATUS(s);
6233 if (r1->t == r3->t) {
6234 s = zbc_program_num(r3, &n3, false);
6235 if (s) RETURN_STATUS(s);
6239 bc_num_init(&res.d.n, n3->len);
6240 s = zdc_num_modexp(n1, n2, n3, &res.d.n);
6243 bc_vec_pop(&G.prog.results);
6244 bc_program_binOpRetire(&res);
6248 bc_num_free(&res.d.n);
6251 #define zdc_program_modexp(...) (zdc_program_modexp(__VA_ARGS__) COMMA_SUCCESS)
6253 static void dc_program_stackLen(void)
6256 size_t len = G.prog.results.len;
6258 res.t = XC_RESULT_TEMP;
6260 bc_num_init_DEF_SIZE(&res.d.n);
6261 bc_num_ulong2num(&res.d.n, len);
6262 bc_vec_push(&G.prog.results, &res);
6265 static BC_STATUS zdc_program_asciify(void)
6275 if (!STACK_HAS_MORE_THAN(&G.prog.results, 0))
6276 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6277 r = bc_vec_top(&G.prog.results);
6279 s = zbc_program_num(r, &num, false);
6280 if (s) RETURN_STATUS(s);
6282 if (BC_PROG_NUM(r, num)) {
6285 BcDig strmb_digs[ULONG_NUM_BUFSIZE];
6287 bc_num_init_DEF_SIZE(&n);
6288 bc_num_copy(&n, num);
6289 bc_num_truncate(&n, n.rdx);
6291 strmb.cap = ARRAY_SIZE(strmb_digs);
6292 strmb.num = strmb_digs;
6293 bc_num_ulong2num(&strmb, 0x100);
6294 s = zbc_num_mod(&n, &strmb, &n, 0);
6296 if (s) goto num_err;
6297 s = zbc_num_ulong(&n, &val);
6298 if (s) goto num_err;
6305 idx = (r->t == XC_RESULT_STR) ? r->d.id.idx : num->rdx;
6306 sp = *bc_program_str(idx);
6310 strs = (void*)G.prog.strs.v;
6311 for (idx = 0; idx < G.prog.strs.len; idx++) {
6312 if (strs[idx][0] == c && strs[idx][1] == '\0') {
6318 //str[1] = '\0'; - already is
6319 bc_vec_push(&G.prog.strs, &str);
6321 res.t = XC_RESULT_STR;
6323 bc_result_pop_and_push(&res);
6325 RETURN_STATUS(BC_STATUS_SUCCESS);
6330 #define zdc_program_asciify(...) (zdc_program_asciify(__VA_ARGS__) COMMA_SUCCESS)
6332 static BC_STATUS zdc_program_printStream(void)
6339 if (!STACK_HAS_MORE_THAN(&G.prog.results, 0))
6340 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6341 r = bc_vec_top(&G.prog.results);
6343 s = zbc_program_num(r, &n, false);
6344 if (s) RETURN_STATUS(s);
6346 if (BC_PROG_NUM(r, n)) {
6347 s = zbc_num_printNum(n, 0x100, 1, dc_num_printChar);
6350 idx = (r->t == XC_RESULT_STR) ? r->d.id.idx : n->rdx;
6351 str = *bc_program_str(idx);
6357 #define zdc_program_printStream(...) (zdc_program_printStream(__VA_ARGS__) COMMA_SUCCESS)
6359 static BC_STATUS zdc_program_nquit(void)
6366 s = zbc_program_prep(&opnd, &num);
6367 if (s) RETURN_STATUS(s);
6368 s = zbc_num_ulong(num, &val);
6369 if (s) RETURN_STATUS(s);
6371 bc_vec_pop(&G.prog.results);
6373 if (G.prog.exestack.len < val)
6374 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6375 if (G.prog.exestack.len == val) {
6376 QUIT_OR_RETURN_TO_MAIN;
6379 bc_vec_npop(&G.prog.exestack, val);
6383 #define zdc_program_nquit(...) (zdc_program_nquit(__VA_ARGS__) COMMA_SUCCESS)
6385 static BC_STATUS zdc_program_execStr(char *code, size_t *bgn, bool cond)
6387 BcStatus s = BC_STATUS_SUCCESS;
6393 if (!STACK_HAS_MORE_THAN(&G.prog.results, 0))
6394 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6396 r = bc_vec_top(&G.prog.results);
6399 BcNum *n = n; // for compiler
6402 char *then_name = bc_program_name(code, bgn);
6403 char *else_name = NULL;
6405 if (code[*bgn] == BC_PARSE_STREND)
6408 else_name = bc_program_name(code, bgn);
6410 exec = r->d.n.len != 0;
6412 if (!exec && else_name != NULL) {
6419 v = bc_program_search(name, true);
6426 if (!exec) goto exit;
6427 if (!BC_PROG_STR(n)) {
6428 s = bc_error_variable_is_wrong_type();
6434 if (r->t == XC_RESULT_STR) {
6436 } else if (r->t == XC_RESULT_VAR) {
6438 s = zbc_program_num(r, &n, false);
6439 if (s || !BC_PROG_STR(n)) goto exit;
6445 fidx = sidx + BC_PROG_REQ_FUNCS;
6447 f = bc_program_func(fidx);
6449 if (f->code.len == 0) {
6453 sv_parse = G.prs; // struct copy
6454 bc_parse_create(fidx);
6455 str = *bc_program_str(sidx);
6456 s = zbc_parse_text_init(str);
6459 s = zdc_parse_exprs_until_eof();
6461 bc_parse_push(DC_INST_POP_EXEC);
6462 if (G.prs.l.lex != XC_LEX_EOF)
6463 s = bc_error_bad_expression();
6465 G.prs = sv_parse; // struct copy
6468 bc_vec_pop_all(&f->code);
6476 bc_vec_pop(&G.prog.results);
6477 bc_vec_push(&G.prog.exestack, &ip);
6479 RETURN_STATUS(BC_STATUS_SUCCESS);
6481 bc_vec_pop(&G.prog.results);
6484 #define zdc_program_execStr(...) (zdc_program_execStr(__VA_ARGS__) COMMA_SUCCESS)
6487 static void bc_program_pushGlobal(char inst)
6492 res.t = inst - XC_INST_IBASE + XC_RESULT_IBASE;
6493 if (inst == XC_INST_IBASE)
6494 val = (unsigned long) G.prog.ib_t;
6495 else if (inst == XC_INST_SCALE)
6496 val = (unsigned long) G.prog.scale;
6498 val = (unsigned long) G.prog.ob_t;
6500 bc_num_init_DEF_SIZE(&res.d.n);
6501 bc_num_ulong2num(&res.d.n, val);
6502 bc_vec_push(&G.prog.results, &res);
6505 static BC_STATUS zbc_program_exec(void)
6508 BcInstPtr *ip = bc_vec_top(&G.prog.exestack);
6509 BcFunc *func = bc_program_func(ip->func);
6510 char *code = func->code.v;
6512 dbg_exec("func:%zd bytes:%zd ip:%zd results.len:%d",
6513 ip->func, func->code.len, ip->inst_idx, G.prog.results.len);
6514 while (ip->inst_idx < func->code.len) {
6515 BcStatus s = BC_STATUS_SUCCESS;
6516 char inst = code[ip->inst_idx++];
6518 dbg_exec("inst at %zd:%d results.len:%d", ip->inst_idx - 1, inst, G.prog.results.len);
6521 case BC_INST_JUMP_ZERO: {
6524 dbg_exec("BC_INST_JUMP_ZERO:");
6525 s = zbc_program_prep(&ptr, &num);
6526 if (s) RETURN_STATUS(s);
6527 zero = (bc_num_cmp(num, &G.prog.zero) == 0);
6528 bc_vec_pop(&G.prog.results);
6530 bc_program_index(code, &ip->inst_idx);
6533 // else: fall through
6535 case BC_INST_JUMP: {
6536 size_t idx = bc_program_index(code, &ip->inst_idx);
6537 size_t *addr = bc_vec_item(&func->labels, idx);
6538 dbg_exec("BC_INST_JUMP: to %ld", (long)*addr);
6539 ip->inst_idx = *addr;
6543 dbg_exec("BC_INST_CALL:");
6544 s = zbc_program_call(code, &ip->inst_idx);
6545 goto read_updated_ip;
6546 case BC_INST_INC_PRE:
6547 case BC_INST_DEC_PRE:
6548 case BC_INST_INC_POST:
6549 case BC_INST_DEC_POST:
6550 dbg_exec("BC_INST_INCDEC:");
6551 s = zbc_program_incdec(inst);
6554 dbg_exec("BC_INST_HALT:");
6555 QUIT_OR_RETURN_TO_MAIN;
6559 dbg_exec("BC_INST_RET[0]:");
6560 s = zbc_program_return(inst);
6561 goto read_updated_ip;
6562 case XC_INST_BOOL_OR:
6563 case XC_INST_BOOL_AND:
6565 case XC_INST_REL_EQ:
6566 case XC_INST_REL_LE:
6567 case XC_INST_REL_GE:
6568 case XC_INST_REL_NE:
6569 case XC_INST_REL_LT:
6570 case XC_INST_REL_GT:
6571 dbg_exec("BC_INST_BOOL:");
6572 s = zbc_program_logical(inst);
6575 dbg_exec("XC_INST_READ:");
6576 s = zbc_program_read();
6577 goto read_updated_ip;
6579 dbg_exec("XC_INST_VAR:");
6580 s = zbc_program_pushVar(code, &ip->inst_idx, false, false);
6582 case XC_INST_ARRAY_ELEM:
6584 dbg_exec("XC_INST_ARRAY[_ELEM]:");
6585 s = zbc_program_pushArray(code, &ip->inst_idx, inst);
6589 dbg_exec("BC_INST_LAST:");
6590 r.t = BC_RESULT_LAST;
6591 bc_vec_push(&G.prog.results, &r);
6597 dbg_exec("XC_INST_internalvar(%d):", inst - XC_INST_IBASE);
6598 bc_program_pushGlobal(inst);
6600 case XC_INST_SCALE_FUNC:
6601 case XC_INST_LENGTH:
6603 dbg_exec("BC_INST_builtin:");
6604 s = zbc_program_builtin(inst);
6607 dbg_exec("XC_INST_NUM:");
6608 r.t = XC_RESULT_CONSTANT;
6609 r.d.id.idx = bc_program_index(code, &ip->inst_idx);
6610 bc_vec_push(&G.prog.results, &r);
6613 dbg_exec("XC_INST_POP:");
6614 if (!STACK_HAS_MORE_THAN(&G.prog.results, 0))
6615 s = bc_error_stack_has_too_few_elements();
6617 bc_vec_pop(&G.prog.results);
6620 case XC_INST_PRINT_POP:
6621 case XC_INST_PRINT_STR:
6622 dbg_exec("XC_INST_PRINTxyz:");
6623 s = zbc_program_print(inst, 0);
6626 dbg_exec("XC_INST_STR:");
6627 r.t = XC_RESULT_STR;
6628 r.d.id.idx = bc_program_index(code, &ip->inst_idx);
6629 bc_vec_push(&G.prog.results, &r);
6632 case XC_INST_MULTIPLY:
6633 case XC_INST_DIVIDE:
6634 case XC_INST_MODULUS:
6637 dbg_exec("BC_INST_binaryop:");
6638 s = zbc_program_op(inst);
6640 case XC_INST_BOOL_NOT: {
6642 dbg_exec("XC_INST_BOOL_NOT:");
6643 s = zbc_program_prep(&ptr, &num);
6644 if (s) RETURN_STATUS(s);
6645 bc_num_init_DEF_SIZE(&r.d.n);
6646 if (bc_num_cmp(num, &G.prog.zero) == 0)
6648 //else bc_num_zero(&r.d.n); - already is
6649 bc_program_retire(&r, XC_RESULT_TEMP);
6653 dbg_exec("XC_INST_NEG:");
6654 s = zbc_program_negate();
6657 case BC_INST_ASSIGN_POWER:
6658 case BC_INST_ASSIGN_MULTIPLY:
6659 case BC_INST_ASSIGN_DIVIDE:
6660 case BC_INST_ASSIGN_MODULUS:
6661 case BC_INST_ASSIGN_PLUS:
6662 case BC_INST_ASSIGN_MINUS:
6664 case XC_INST_ASSIGN:
6665 dbg_exec("BC_INST_ASSIGNxyz:");
6666 s = zbc_program_assign(inst);
6669 case DC_INST_POP_EXEC:
6670 dbg_exec("DC_INST_POP_EXEC:");
6671 bc_vec_pop(&G.prog.exestack);
6672 goto read_updated_ip;
6673 case DC_INST_MODEXP:
6674 dbg_exec("DC_INST_MODEXP:");
6675 s = zdc_program_modexp();
6677 case DC_INST_DIVMOD:
6678 dbg_exec("DC_INST_DIVMOD:");
6679 s = zdc_program_divmod();
6681 case DC_INST_EXECUTE:
6682 case DC_INST_EXEC_COND:
6683 dbg_exec("DC_INST_EXEC[_COND]:");
6684 s = zdc_program_execStr(code, &ip->inst_idx, inst == DC_INST_EXEC_COND);
6685 goto read_updated_ip;
6686 case DC_INST_PRINT_STACK: {
6688 dbg_exec("DC_INST_PRINT_STACK:");
6689 for (idx = 0; idx < G.prog.results.len; ++idx) {
6690 s = zbc_program_print(XC_INST_PRINT, idx);
6695 case DC_INST_CLEAR_STACK:
6696 dbg_exec("DC_INST_CLEAR_STACK:");
6697 bc_vec_pop_all(&G.prog.results);
6699 case DC_INST_STACK_LEN:
6700 dbg_exec("DC_INST_STACK_LEN:");
6701 dc_program_stackLen();
6703 case DC_INST_DUPLICATE:
6704 dbg_exec("DC_INST_DUPLICATE:");
6705 if (!STACK_HAS_MORE_THAN(&G.prog.results, 0))
6706 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6707 ptr = bc_vec_top(&G.prog.results);
6708 dc_result_copy(&r, ptr);
6709 bc_vec_push(&G.prog.results, &r);
6711 case DC_INST_SWAP: {
6713 dbg_exec("DC_INST_SWAP:");
6714 if (!STACK_HAS_MORE_THAN(&G.prog.results, 1))
6715 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6716 ptr = bc_vec_item_rev(&G.prog.results, 0);
6717 ptr2 = bc_vec_item_rev(&G.prog.results, 1);
6718 memcpy(&r, ptr, sizeof(BcResult));
6719 memcpy(ptr, ptr2, sizeof(BcResult));
6720 memcpy(ptr2, &r, sizeof(BcResult));
6723 case DC_INST_ASCIIFY:
6724 dbg_exec("DC_INST_ASCIIFY:");
6725 s = zdc_program_asciify();
6727 case DC_INST_PRINT_STREAM:
6728 dbg_exec("DC_INST_PRINT_STREAM:");
6729 s = zdc_program_printStream();
6732 case DC_INST_PUSH_VAR: {
6733 bool copy = inst == DC_INST_LOAD;
6734 s = zbc_program_pushVar(code, &ip->inst_idx, true, copy);
6737 case DC_INST_PUSH_TO_VAR: {
6738 char *name = bc_program_name(code, &ip->inst_idx);
6739 s = zbc_program_copyToVar(name, true);
6744 dbg_exec("DC_INST_QUIT:");
6745 if (G.prog.exestack.len <= 2)
6746 QUIT_OR_RETURN_TO_MAIN;
6747 bc_vec_npop(&G.prog.exestack, 2);
6748 goto read_updated_ip;
6750 dbg_exec("DC_INST_NQUIT:");
6751 s = zdc_program_nquit();
6752 //goto read_updated_ip; - just fall through to it
6755 // Instruction stack has changed, read new pointers
6756 ip = bc_vec_top(&G.prog.exestack);
6757 func = bc_program_func(ip->func);
6758 code = func->code.v;
6759 dbg_exec("func:%zd bytes:%zd ip:%zd", ip->func, func->code.len, ip->inst_idx);
6762 if (s || G_interrupt) {
6770 RETURN_STATUS(BC_STATUS_SUCCESS);
6772 #define zbc_program_exec(...) (zbc_program_exec(__VA_ARGS__) COMMA_SUCCESS)
6774 static unsigned bc_vm_envLen(const char *var)
6780 len = BC_NUM_PRINT_WIDTH;
6781 if (!lenv) return len;
6783 len = bb_strtou(lenv, NULL, 10) - 1;
6784 if (errno || len < 2 || len >= INT_MAX)
6785 len = BC_NUM_PRINT_WIDTH;
6790 static BC_STATUS zbc_vm_process(const char *text)
6794 dbg_lex_enter("%s:%d entered", __func__, __LINE__);
6795 s = zbc_parse_text_init(text); // does the first zbc_lex_next()
6796 if (s) RETURN_STATUS(s);
6799 while (G.prs.l.lex != XC_LEX_EOF) {
6803 dbg_lex("%s:%d G.prs.l.lex:%d, parsing...", __func__, __LINE__, G.prs.l.lex);
6806 if (G.prs.l.lex == BC_LEX_SCOLON
6807 || G.prs.l.lex == XC_LEX_NLINE
6814 s = zbc_parse_stmt_or_funcdef();
6817 // Check that next token is a correct stmt delimiter -
6818 // disallows "print 1 print 2" and such.
6819 if (G.prs.l.lex != BC_LEX_SCOLON
6820 && G.prs.l.lex != XC_LEX_NLINE
6821 && G.prs.l.lex != XC_LEX_EOF
6824 //TODO: commonalize for other parse errors:
6825 err_at = G.prs.l.lex_next_at ? G.prs.l.lex_next_at : "UNKNOWN";
6826 bc_error_fmt("bad statement terminator at '%.*s'",
6827 (int)(strchrnul(err_at, '\n') - err_at),
6832 // The above logic is fragile. Check these examples:
6833 // - interative read() still works
6837 // Most of dc parsing assumes all whitespace,
6838 // including '\n', is eaten.
6839 while (G.prs.l.lex == XC_LEX_NLINE) {
6842 if (G.prs.l.lex == XC_LEX_EOF)
6845 s = zdc_parse_expr();
6848 if (s || G_interrupt) {
6850 bc_parse_reset(); // includes bc_program_reset()
6851 RETURN_STATUS(BC_STATUS_FAILURE);
6854 dbg_lex("%s:%d executing...", __func__, __LINE__);
6855 s = zbc_program_exec();
6861 ip = (void*)G.prog.exestack.v;
6863 if (G.prog.exestack.len != 1) // should have only main's IP
6864 bb_error_msg_and_die("BUG:call stack");
6865 if (ip->func != BC_PROG_MAIN)
6866 bb_error_msg_and_die("BUG:not MAIN");
6868 f = bc_program_func_BC_PROG_MAIN();
6869 // bc discards strings, constants and code after each
6870 // top-level statement in the "main program".
6871 // This prevents "yes 1 | bc" from growing its memory
6872 // without bound. This can be done because data stack
6873 // is empty and thus can't hold any references to
6874 // strings or constants, there is no generated code
6875 // which can hold references (after we discard one
6876 // we just executed). Code of functions can have references,
6877 // but bc stores function strings/constants in per-function
6881 if (G.prog.results.len != 0) // should be empty
6882 bb_error_msg_and_die("BUG:data stack");
6884 IF_BC(bc_vec_pop_all(&f->strs);)
6885 IF_BC(bc_vec_pop_all(&f->consts);)
6887 if (G.prog.results.len == 0
6888 && G.prog.vars.len == 0
6890 // If stack is empty and no registers exist (TODO: or they are all empty),
6891 // we can get rid of accumulated strings and constants.
6892 // In this example dc process should not grow
6893 // its memory consumption with time:
6895 IF_DC(bc_vec_pop_all(&G.prog.strs);)
6896 IF_DC(bc_vec_pop_all(&G.prog.consts);)
6898 // The code is discarded always (below), thus this example
6899 // should also not grow its memory consumption with time,
6900 // even though its data stack is not empty:
6901 // { echo 1; yes dk; } | dc
6903 // We drop generated and executed code for both bc and dc:
6904 bc_vec_pop_all(&f->code);
6908 dbg_lex_done("%s:%d done", __func__, __LINE__);
6911 #define zbc_vm_process(...) (zbc_vm_process(__VA_ARGS__) COMMA_SUCCESS)
6913 static BC_STATUS zbc_vm_execute_FILE(FILE *fp, const char *filename)
6915 // So far bc/dc have no way to include a file from another file,
6916 // therefore we know G.prs.filename == NULL on entry
6917 //const char *sv_file;
6920 G.prs.filename = filename;
6921 G.prs.input_fp = fp;
6925 s = zbc_vm_process("");
6926 // We do not stop looping on errors here if reading stdin.
6927 // Example: start interactive bc and enter "return".
6928 // It should say "'return' not in a function"
6929 // but should not exit.
6930 } while (G.prs.input_fp == stdin);
6931 G.prs.filename = NULL;
6934 #define zbc_vm_execute_FILE(...) (zbc_vm_execute_FILE(__VA_ARGS__) COMMA_SUCCESS)
6936 static BC_STATUS zbc_vm_file(const char *file)
6941 fp = xfopen_for_read(file);
6942 s = zbc_vm_execute_FILE(fp, file);
6947 #define zbc_vm_file(...) (zbc_vm_file(__VA_ARGS__) COMMA_SUCCESS)
6950 static void bc_vm_info(void)
6952 printf("%s "BB_VER"\n"
6953 "Copyright (c) 2018 Gavin D. Howard and contributors\n"
6957 static void bc_args(char **argv)
6963 #if ENABLE_FEATURE_BC_LONG_OPTIONS
6964 opts = option_mask32 |= getopt32long(argv, "wvsqli",
6965 "warn\0" No_argument "w"
6966 "version\0" No_argument "v"
6967 "standard\0" No_argument "s"
6968 "quiet\0" No_argument "q"
6969 "mathlib\0" No_argument "l"
6970 "interactive\0" No_argument "i"
6973 opts = option_mask32 |= getopt32(argv, "wvsqli");
6975 if (getenv("POSIXLY_CORRECT"))
6976 option_mask32 |= BC_FLAG_S;
6978 if (opts & BC_FLAG_V) {
6983 for (i = optind; argv[i]; ++i)
6984 bc_vec_push(&G.files, argv + i);
6987 static void bc_vm_envArgs(void)
6991 char *env_args = getenv("BC_ENV_ARGS");
6993 if (!env_args) return;
6995 G.env_args = xstrdup(env_args);
6998 bc_vec_init(&v, sizeof(char *), NULL);
7000 while (*(buf = skip_whitespace(buf)) != '\0') {
7001 bc_vec_push(&v, &buf);
7002 buf = skip_non_whitespace(buf);
7008 // NULL terminate, and pass argv[] so that first arg is argv[1]
7009 if (sizeof(int) == sizeof(char*)) {
7010 bc_vec_push(&v, &const_int_0);
7012 static char *const nullptr = NULL;
7013 bc_vec_push(&v, &nullptr);
7015 bc_args(((char **)v.v) - 1);
7020 static const char bc_lib[] ALIGN1 = {
7023 "\n" "auto b,s,n,r,d,i,p,f,v"
7024 ////////////////"if(x<0)return(1/e(-x))" // and drop 'n' and x<0 logic below
7025 //^^^^^^^^^^^^^^^^ this would work, and is even more precise than GNU bc:
7026 //e(-.998896): GNU:.36828580434569428695
7027 // above code:.36828580434569428696
7028 // actual value:.3682858043456942869594...
7029 // but for now let's be "GNU compatible"
7038 "\n" "scale=scale(x)+1"
7048 "\n" "for(i=2;v;++i){"
7054 "\n" "while(d--)r*=r"
7057 "\n" "if(n)return(1/r)"
7061 "\n" "auto b,s,r,p,a,q,i,v"
7065 "\n" "r=(1-10^scale)/1"
7076 "\n" "while(x<=.5){"
7080 "\n" "r=a=(x-1)/(x+1)"
7083 "\n" "for(i=3;v;i+=2){"
7094 "\n" "auto b,s,r,a,q,i"
7095 "\n" "if(x<0)return(-s(-x))"
7099 "\n" "scale=1.1*s+2"
7108 "\n" "for(i=3;a;i+=2){"
7109 "\n" "a*=q/(i*(i-1))"
7122 "\n" "x=s(2*a(1)+x)"
7128 "\n" "auto b,s,r,n,a,m,t,f,i,u"
7136 "\n" "if(scale<65){"
7137 "\n" "if(x==1)return(.7853981633974483096156608458198757210492923498437764552437361480/n)"
7138 "\n" "if(x==.2)return(.1973955598498807583700497651947902934475851037878521015176889402/n)"
7148 "\n" "x=(x-.2)/(1+.2*x)"
7153 "\n" "for(i=3;t;i+=2){"
7160 "\n" "return((m*a+r)/n)"
7162 "\n" "define j(n,x){"
7163 "\n" "auto b,s,o,a,i,v,f"
7174 "\n" "for(i=2;i<=n;++i)a*=i"
7176 "\n" "a=(x^n)/2^n/a"
7179 "\n" "scale+=length(a)-scale(a)"
7180 "\n" "for(i=1;v;++i){"
7181 "\n" "v=v*f/i/(n+i)"
7187 "\n" "return(a*r/1)"
7192 static BC_STATUS zbc_vm_exec(void)
7199 if (option_mask32 & BC_FLAG_L) {
7200 // We know that internal library is not buggy,
7201 // thus error checking is normally disabled.
7202 # define DEBUG_LIB 0
7204 s = zbc_vm_process(bc_lib);
7205 if (DEBUG_LIB && s) RETURN_STATUS(s);
7209 s = BC_STATUS_SUCCESS;
7210 fname = (void*)G.files.v;
7211 for (i = 0; i < G.files.len; i++) {
7212 s = zbc_vm_file(*fname++);
7213 if (ENABLE_FEATURE_CLEAN_UP && !G_ttyin && s) {
7214 // Debug config, non-interactive mode:
7215 // return all the way back to main.
7216 // Non-debug builds do not come here
7217 // in non-interactive mode, they exit.
7222 if (IS_BC || (option_mask32 & BC_FLAG_I))
7223 s = zbc_vm_execute_FILE(stdin, /*filename:*/ NULL);
7227 #define zbc_vm_exec(...) (zbc_vm_exec(__VA_ARGS__) COMMA_SUCCESS)
7229 #if ENABLE_FEATURE_CLEAN_UP
7230 static void bc_program_free(void)
7232 bc_vec_free(&G.prog.fns);
7233 IF_BC(bc_vec_free(&G.prog.fn_map);)
7234 bc_vec_free(&G.prog.vars);
7235 bc_vec_free(&G.prog.var_map);
7236 bc_vec_free(&G.prog.arrs);
7237 bc_vec_free(&G.prog.arr_map);
7238 IF_DC(bc_vec_free(&G.prog.strs);)
7239 IF_DC(bc_vec_free(&G.prog.consts);)
7240 bc_vec_free(&G.prog.results);
7241 bc_vec_free(&G.prog.exestack);
7242 IF_BC(bc_num_free(&G.prog.last);)
7243 IF_BC(bc_num_free(&G.prog.zero);)
7244 IF_BC(bc_num_free(&G.prog.one);)
7245 bc_vec_free(&G.input_buffer);
7248 static void bc_vm_free(void)
7250 bc_vec_free(&G.files);
7257 static void bc_program_init(void)
7261 // memset(&G.prog, 0, sizeof(G.prog)); - already is
7262 memset(&ip, 0, sizeof(BcInstPtr));
7264 // G.prog.nchars = G.prog.scale = 0; - already is
7268 IF_BC(bc_num_init_DEF_SIZE(&G.prog.last);)
7269 //IF_BC(bc_num_zero(&G.prog.last);) - already is
7271 bc_num_init_DEF_SIZE(&G.prog.zero);
7272 //bc_num_zero(&G.prog.zero); - already is
7274 IF_BC(bc_num_init_DEF_SIZE(&G.prog.one);)
7275 IF_BC(bc_num_one(&G.prog.one);)
7277 bc_vec_init(&G.prog.fns, sizeof(BcFunc), bc_func_free);
7278 IF_BC(bc_vec_init(&G.prog.fn_map, sizeof(BcId), bc_id_free);)
7281 // Names are chosen simply to be distinct and never match
7282 // a valid function name (and be short)
7283 IF_BC(bc_program_addFunc(xstrdup(""))); // func #0: main
7284 IF_BC(bc_program_addFunc(xstrdup("1"))); // func #1: for read()
7286 // in dc, functions have no names
7287 bc_program_add_fn();
7288 bc_program_add_fn();
7291 bc_vec_init(&G.prog.vars, sizeof(BcVec), bc_vec_free);
7292 bc_vec_init(&G.prog.var_map, sizeof(BcId), bc_id_free);
7294 bc_vec_init(&G.prog.arrs, sizeof(BcVec), bc_vec_free);
7295 bc_vec_init(&G.prog.arr_map, sizeof(BcId), bc_id_free);
7297 IF_DC(bc_vec_init(&G.prog.strs, sizeof(char *), bc_string_free);)
7298 IF_DC(bc_vec_init(&G.prog.consts, sizeof(char *), bc_string_free);)
7299 bc_vec_init(&G.prog.results, sizeof(BcResult), bc_result_free);
7300 bc_vec_init(&G.prog.exestack, sizeof(BcInstPtr), NULL);
7301 bc_vec_push(&G.prog.exestack, &ip);
7303 bc_char_vec_init(&G.input_buffer);
7306 static int bc_vm_init(const char *env_len)
7308 #if ENABLE_FEATURE_EDITING
7309 G.line_input_state = new_line_input_t(DO_HISTORY);
7311 G.prog.len = bc_vm_envLen(env_len);
7313 bc_vec_init(&G.files, sizeof(char *), NULL);
7314 IF_BC(if (IS_BC) bc_vm_envArgs();)
7316 bc_parse_create(BC_PROG_MAIN);
7318 //TODO: in GNU bc, the check is (isatty(0) && isatty(1)),
7319 //-i option unconditionally enables this regardless of isatty():
7321 #if ENABLE_FEATURE_BC_SIGNALS
7323 // With SA_RESTART, most system calls will restart
7324 // (IOW: they won't fail with EINTR).
7325 // In particular, this means ^C won't cause
7326 // stdout to get into "error state" if SIGINT hits
7327 // within write() syscall.
7329 // The downside is that ^C while tty input is taken
7330 // will only be handled after [Enter] since read()
7331 // from stdin is not interrupted by ^C either,
7332 // it restarts, thus fgetc() does not return on ^C.
7333 // (This problem manifests only if line editing is disabled)
7334 signal_SA_RESTART_empty_mask(SIGINT, record_signo);
7336 // Without SA_RESTART, this exhibits a bug:
7337 // "while (1) print 1" and try ^C-ing it.
7338 // Intermittently, instead of returning to input line,
7339 // you'll get "output error: Interrupted system call"
7341 //signal_no_SA_RESTART_empty_mask(SIGINT, record_signo);
7345 return 0; // "not a tty"
7348 static BcStatus bc_vm_run(void)
7350 BcStatus st = zbc_vm_exec();
7351 #if ENABLE_FEATURE_CLEAN_UP
7352 if (G_exiting) // it was actually "halt" or "quit"
7355 # if ENABLE_FEATURE_EDITING
7356 free_line_input_t(G.line_input_state);
7360 dbg_exec("exiting with exitcode %d", st);
7365 int bc_main(int argc, char **argv) MAIN_EXTERNALLY_VISIBLE;
7366 int bc_main(int argc UNUSED_PARAM, char **argv)
7372 is_tty = bc_vm_init("BC_LINE_LENGTH");
7376 if (is_tty && !(option_mask32 & BC_FLAG_Q))
7384 int dc_main(int argc, char **argv) MAIN_EXTERNALLY_VISIBLE;
7385 int dc_main(int argc UNUSED_PARAM, char **argv)
7391 // TODO: dc (GNU bc 1.07.1) 1.4.1 seems to use width
7392 // 1 char wider than bc from the same package.
7393 // Both default width, and xC_LINE_LENGTH=N are wider:
7394 // "DC_LINE_LENGTH=5 dc -e'123456 p'" prints:
7397 // "echo '123456' | BC_LINE_LENGTH=5 bc" prints:
7400 // Do the same, or it's a bug?
7401 bc_vm_init("DC_LINE_LENGTH");
7403 // Run -e'SCRIPT' and -fFILE in order of appearance, then handle FILEs
7404 noscript = BC_FLAG_I;
7406 int n = getopt(argc, argv, "e:f:x");
7412 n = zbc_vm_process(optarg);
7417 n = zbc_vm_file(optarg);
7421 option_mask32 |= DC_FLAG_X;
7431 bc_vec_push(&G.files, argv++);
7434 option_mask32 |= noscript; // set BC_FLAG_I if we need to interpret stdin
7440 #endif // not DC_SMALL