1 /* vi: set sw=4 ts=4: */
3 * Licensed under GPLv2 or later, see file LICENSE in this source tree.
4 * Adapted from https://github.com/gavinhoward/bc
5 * Original code copyright (c) 2018 Gavin D. Howard and contributors.
7 //TODO: GNU extensions:
8 // support "define void f()..."
9 // support "define f(*param[])" - "pass array by reference" syntax
12 #define DEBUG_COMPILE 0
14 // This can be left enabled for production as well:
15 #define SANITY_CHECKS 1
18 //config: bool "bc (45 kb)"
20 //config: select FEATURE_DC_BIG
22 //config: bc is a command-line, arbitrary-precision calculator with a
23 //config: Turing-complete language. See the GNU bc manual
24 //config: (https://www.gnu.org/software/bc/manual/bc.html) and bc spec
25 //config: (http://pubs.opengroup.org/onlinepubs/9699919799/utilities/bc.html).
27 //config: This bc has five differences to the GNU bc:
28 //config: 1) The period (.) is a shortcut for "last", as in the BSD bc.
29 //config: 2) Arrays are copied before being passed as arguments to
30 //config: functions. This behavior is required by the bc spec.
31 //config: 3) Arrays can be passed to the builtin "length" function to get
32 //config: the number of elements in the array. This prints "1":
33 //config: a[0] = 0; length(a[])
34 //config: 4) The precedence of the boolean "not" operator (!) is equal to
35 //config: that of the unary minus (-) negation operator. This still
36 //config: allows POSIX-compliant scripts to work while somewhat
37 //config: preserving expected behavior (versus C) and making parsing
39 //config: 5) "read()" accepts expressions, not only numeric literals.
42 //config: bool "dc (36 kb)"
45 //config: dc is a reverse-polish notation command-line calculator which
46 //config: supports unlimited precision arithmetic. See the FreeBSD man page
47 //config: (https://www.unix.com/man-page/FreeBSD/1/dc/) and GNU dc manual
48 //config: (https://www.gnu.org/software/bc/manual/dc-1.05/html_mono/dc.html).
50 //config: This dc has a few differences from the two above:
51 //config: 1) When printing a byte stream (command "P"), this dc follows what
52 //config: the FreeBSD dc does.
53 //config: 2) Implements the GNU extensions for divmod ("~") and
54 //config: modular exponentiation ("|").
55 //config: 3) Implements all FreeBSD extensions, except for "J" and "M".
56 //config: 4) Like the FreeBSD dc, this dc supports extended registers.
57 //config: However, they are implemented differently. When it encounters
58 //config: whitespace where a register should be, it skips the whitespace.
59 //config: If the character following is not a lowercase letter, an error
60 //config: is issued. Otherwise, the register name is parsed by the
61 //config: following regex: [a-z][a-z0-9_]*
62 //config: This generally means that register names will be surrounded by
63 //config: whitespace. Examples:
64 //config: l idx s temp L index S temp2 < do_thing
65 //config: Also note that, like the FreeBSD dc, extended registers are not
66 //config: allowed unless the "-x" option is given.
68 //config:if BC || DC # for menuconfig indenting
70 //config:config FEATURE_DC_BIG
71 //config: bool "Use bc code base for dc (larger, more features)"
74 //config:config FEATURE_DC_LIBM
75 //config: bool "Enable power and exp functions (requires libm)"
77 //config: depends on DC && !BC && !FEATURE_DC_BIG
79 //config: Enable power and exp functions.
80 //config: NOTE: This will require libm to be present for linking.
82 //config:config FEATURE_BC_INTERACTIVE
83 //config: bool "Interactive mode (+4kb)"
85 //config: depends on BC || (DC && FEATURE_DC_BIG)
87 //config: Enable interactive mode: when started on a tty,
88 //config: ^C interrupts execution and returns to command line,
89 //config: errors also return to command line instead of exiting,
90 //config: line editing with history is available.
92 //config: With this option off, input can still be taken from tty,
93 //config: but all errors are fatal, ^C is fatal,
94 //config: tty is treated exactly the same as any other
95 //config: standard input (IOW: no line editing).
97 //config:config FEATURE_BC_LONG_OPTIONS
98 //config: bool "Enable bc/dc long options"
100 //config: depends on BC || (DC && FEATURE_DC_BIG)
104 //applet:IF_BC(APPLET(bc, BB_DIR_USR_BIN, BB_SUID_DROP))
105 //applet:IF_DC(APPLET(dc, BB_DIR_USR_BIN, BB_SUID_DROP))
107 //kbuild:lib-$(CONFIG_BC) += bc.o
108 //kbuild:lib-$(CONFIG_DC) += bc.o
110 //See www.gnu.org/software/bc/manual/bc.html
111 //usage:#define bc_trivial_usage
112 //usage: "[-sqlw] FILE..."
114 //usage:#define bc_full_usage "\n"
115 //usage: "\nArbitrary precision calculator"
117 ///////: "\n -i Interactive" - has no effect for now
118 //usage: "\n -q Quiet"
119 //usage: "\n -l Load standard math library"
120 //usage: "\n -s Be POSIX compatible"
121 //usage: "\n -w Warn if extensions are used"
122 ///////: "\n -v Version"
124 //usage: "\n$BC_LINE_LENGTH changes output width"
126 //usage:#define bc_example_usage
127 //usage: "3 + 4.129\n"
128 //usage: "1903 - 2893\n"
129 //usage: "-129 * 213.28935\n"
130 //usage: "12 / -1932\n"
132 //usage: "34 ^ 189\n"
133 //usage: "scale = 13\n"
134 //usage: "ibase = 2\n"
135 //usage: "obase = A\n"
137 //usage:#define dc_trivial_usage
138 //usage: IF_FEATURE_DC_BIG("[-x] ")"[-eSCRIPT]... [-fFILE]... [FILE]..."
140 //usage:#define dc_full_usage "\n"
141 //usage: "\nTiny RPN calculator. Operations:"
142 //usage: "\n+, -, *, /, %, ~, ^," IF_FEATURE_DC_BIG(" |,")
143 //usage: "\np - print top of the stack without popping"
144 //usage: "\nf - print entire stack"
145 //usage: "\nk - pop the value and set the precision"
146 //usage: "\ni - pop the value and set input radix"
147 //usage: "\no - pop the value and set output radix"
148 //usage: "\nExamples: dc -e'2 2 + p' -> 4, dc -e'8 8 * 2 2 + / p' -> 16"
150 //usage:#define dc_example_usage
151 //usage: "$ dc -e'2 2 + p'\n"
153 //usage: "$ dc -e'8 8 \\* 2 2 + / p'\n"
155 //usage: "$ dc -e'0 1 & p'\n"
157 //usage: "$ dc -e'0 1 | p'\n"
159 //usage: "$ echo '72 9 / 8 * p' | dc\n"
163 #include "common_bufsiz.h"
165 #if !ENABLE_BC && !ENABLE_FEATURE_DC_BIG
170 static uint8_t lex_indent;
171 #define dbg_lex(...) \
173 fprintf(stderr, "%*s", lex_indent, ""); \
174 bb_error_msg(__VA_ARGS__); \
176 #define dbg_lex_enter(...) \
178 dbg_lex(__VA_ARGS__); \
181 #define dbg_lex_done(...) \
184 dbg_lex(__VA_ARGS__); \
187 # define dbg_lex(...) ((void)0)
188 # define dbg_lex_enter(...) ((void)0)
189 # define dbg_lex_done(...) ((void)0)
193 # define dbg_compile(...) bb_error_msg(__VA_ARGS__)
195 # define dbg_compile(...) ((void)0)
199 # define dbg_exec(...) bb_error_msg(__VA_ARGS__)
201 # define dbg_exec(...) ((void)0)
204 typedef enum BcStatus {
205 BC_STATUS_SUCCESS = 0,
206 BC_STATUS_FAILURE = 1,
207 BC_STATUS_PARSE_EMPTY_EXP = 2, // bc_parse_expr_empty_ok() uses this
210 #define BC_VEC_INVALID_IDX ((size_t) -1)
211 #define BC_VEC_START_CAP (1 << 5)
213 typedef void (*BcVecFree)(void *) FAST_FUNC;
215 typedef struct BcVec {
223 typedef signed char BcDig;
225 typedef struct BcNum {
233 #define BC_NUM_MAX_IBASE 36
234 // larger value might speed up BIGNUM calculations a bit:
235 #define BC_NUM_DEF_SIZE 16
236 #define BC_NUM_PRINT_WIDTH 69
238 #define BC_NUM_KARATSUBA_LEN 32
240 typedef enum BcInst {
247 XC_INST_NEG, // order
249 XC_INST_REL_EQ, // should
250 XC_INST_REL_LE, // match
251 XC_INST_REL_GE, // LEX
252 XC_INST_REL_NE, // constants
253 XC_INST_REL_LT, // for
254 XC_INST_REL_GT, // these
256 XC_INST_POWER, // operations
257 XC_INST_MULTIPLY, // |
259 XC_INST_MODULUS, // |
263 XC_INST_BOOL_NOT, // |
264 XC_INST_BOOL_OR, // |
265 XC_INST_BOOL_AND, // |
267 BC_INST_ASSIGN_POWER, // |
268 BC_INST_ASSIGN_MULTIPLY,// |
269 BC_INST_ASSIGN_DIVIDE, // |
270 BC_INST_ASSIGN_MODULUS, // |
271 BC_INST_ASSIGN_PLUS, // |
272 BC_INST_ASSIGN_MINUS, // |
282 XC_INST_IBASE, // order of these constans should match other enums
283 XC_INST_OBASE, // order of these constans should match other enums
284 XC_INST_SCALE, // order of these constans should match other enums
285 IF_BC(BC_INST_LAST,) // order of these constans should match other enums
316 DC_INST_PRINT_STREAM,
331 DC_INST_INVALID = -1,
335 typedef struct BcId {
340 typedef struct BcFunc {
346 IF_BC(size_t nparams;)
349 typedef enum BcResultType {
353 XC_RESULT_ARRAY_ELEM,
358 //code uses "inst - XC_INST_IBASE + XC_RESULT_IBASE" construct,
359 XC_RESULT_IBASE, // relative order should match for: XC_INST_IBASE
360 XC_RESULT_OBASE, // relative order should match for: XC_INST_OBASE
361 XC_RESULT_SCALE, // relative order should match for: XC_INST_SCALE
362 IF_BC(BC_RESULT_LAST,) // relative order should match for: BC_INST_LAST
364 IF_BC(BC_RESULT_ONE,)
367 typedef union BcResultData {
373 typedef struct BcResult {
378 typedef struct BcInstPtr {
383 typedef enum BcLexType {
394 XC_LEX_NEG = XC_LEX_1st_op, // order
396 XC_LEX_OP_REL_EQ, // should
397 XC_LEX_OP_REL_LE, // match
398 XC_LEX_OP_REL_GE, // INST
399 XC_LEX_OP_REL_NE, // constants
400 XC_LEX_OP_REL_LT, // for
401 XC_LEX_OP_REL_GT, // these
403 XC_LEX_OP_POWER, // operations
404 XC_LEX_OP_MULTIPLY, // |
405 XC_LEX_OP_DIVIDE, // |
406 XC_LEX_OP_MODULUS, // |
408 XC_LEX_OP_MINUS, // |
409 XC_LEX_OP_last = XC_LEX_OP_MINUS,
411 BC_LEX_OP_BOOL_NOT, // |
412 BC_LEX_OP_BOOL_OR, // |
413 BC_LEX_OP_BOOL_AND, // |
415 BC_LEX_OP_ASSIGN_POWER, // |
416 BC_LEX_OP_ASSIGN_MULTIPLY, // |
417 BC_LEX_OP_ASSIGN_DIVIDE, // |
418 BC_LEX_OP_ASSIGN_MODULUS, // |
419 BC_LEX_OP_ASSIGN_PLUS, // |
420 BC_LEX_OP_ASSIGN_MINUS, // |
422 BC_LEX_OP_ASSIGN, // V
427 BC_LEX_LPAREN, // () are 0x28 and 0x29
428 BC_LEX_RPAREN, // must be LPAREN+1: code uses (c - '(' + BC_LEX_LPAREN)
430 BC_LEX_LBRACKET, // [] are 0x5B and 0x5D
432 BC_LEX_RBRACKET, // must be LBRACKET+2: code uses (c - '[' + BC_LEX_LBRACKET)
434 BC_LEX_LBRACE, // {} are 0x7B and 0x7D
436 BC_LEX_RBRACE, // must be LBRACE+2: code uses (c - '{' + BC_LEX_LBRACE)
438 BC_LEX_KEY_1st_keyword,
439 BC_LEX_KEY_AUTO = BC_LEX_KEY_1st_keyword,
446 // code uses "type - BC_LEX_KEY_IBASE + XC_INST_IBASE" construct,
447 BC_LEX_KEY_IBASE, // relative order should match for: XC_INST_IBASE
448 BC_LEX_KEY_OBASE, // relative order should match for: XC_INST_OBASE
450 BC_LEX_KEY_LAST, // relative order should match for: BC_INST_LAST
463 DC_LEX_OP_BOOL_NOT = XC_LEX_OP_last + 1,
495 // code uses "t - DC_LEX_STORE_IBASE + XC_INST_IBASE" construct,
496 DC_LEX_STORE_IBASE, // relative order should match for: XC_INST_IBASE
497 DC_LEX_STORE_OBASE, // relative order should match for: XC_INST_OBASE
498 DC_LEX_STORE_SCALE, // relative order should match for: XC_INST_SCALE
507 // must match order of BC_LEX_KEY_foo etc above
509 struct BcLexKeyword {
512 #define LEX_KW_ENTRY(a, b) \
513 { .name8 = a /*, .posix = b */ }
514 static const struct BcLexKeyword bc_lex_kws[20] = {
515 LEX_KW_ENTRY("auto" , 1), // 0
516 LEX_KW_ENTRY("break" , 1), // 1
517 LEX_KW_ENTRY("continue", 0), // 2 note: this one has no terminating NUL
518 LEX_KW_ENTRY("define" , 1), // 3
519 LEX_KW_ENTRY("else" , 0), // 4
520 LEX_KW_ENTRY("for" , 1), // 5
521 LEX_KW_ENTRY("halt" , 0), // 6
522 LEX_KW_ENTRY("ibase" , 1), // 7
523 LEX_KW_ENTRY("obase" , 1), // 8
524 LEX_KW_ENTRY("if" , 1), // 9
525 LEX_KW_ENTRY("last" , 0), // 10
526 LEX_KW_ENTRY("length" , 1), // 11
527 LEX_KW_ENTRY("limits" , 0), // 12
528 LEX_KW_ENTRY("print" , 0), // 13
529 LEX_KW_ENTRY("quit" , 1), // 14
530 LEX_KW_ENTRY("read" , 0), // 15
531 LEX_KW_ENTRY("return" , 1), // 16
532 LEX_KW_ENTRY("scale" , 1), // 17
533 LEX_KW_ENTRY("sqrt" , 1), // 18
534 LEX_KW_ENTRY("while" , 1), // 19
537 #define STRING_else (bc_lex_kws[4].name8)
538 #define STRING_for (bc_lex_kws[5].name8)
539 #define STRING_if (bc_lex_kws[9].name8)
540 #define STRING_while (bc_lex_kws[19].name8)
564 #define keyword_is_POSIX(i) ((1 << (i)) & POSIX_KWORD_MASK)
566 // This is a bit array that corresponds to token types. An entry is
567 // true if the token is valid in an expression, false otherwise.
568 // Used to figure out when expr parsing should stop *without error message*
569 // - 0 element indicates this condition. 1 means "this token is to be eaten
570 // as part of the expression", it can then still be determined to be invalid
571 // by later processing.
573 #define EXBITS(a,b,c,d,e,f,g,h) \
574 ((uint64_t)((a << 0)+(b << 1)+(c << 2)+(d << 3)+(e << 4)+(f << 5)+(g << 6)+(h << 7)))
575 BC_PARSE_EXPRS_BITS = 0 // corresponding BC_LEX_xyz:
576 + (EXBITS(0,0,0,0,0,1,1,1) << (0*8)) // 0: EOF INVAL NL WS STR NAME NUM -
577 + (EXBITS(1,1,1,1,1,1,1,1) << (1*8)) // 8: == <= >= != < > ^ *
578 + (EXBITS(1,1,1,1,1,1,1,1) << (2*8)) // 16: / % + - ! || && ^=
579 + (EXBITS(1,1,1,1,1,1,1,1) << (3*8)) // 24: *= /= %= += -= = ++ --
580 + (EXBITS(1,1,0,0,0,0,0,0) << (4*8)) // 32: ( ) [ , ] { ; }
581 + (EXBITS(0,0,0,0,0,0,0,1) << (5*8)) // 40: auto break cont define else for halt ibase
582 + (EXBITS(1,0,1,1,0,0,0,1) << (6*8)) // 48: obase if last length limits print quit read
583 + (EXBITS(0,1,1,0,0,0,0,0) << (7*8)) // 56: return scale sqrt while
586 static ALWAYS_INLINE long lex_allowed_in_bc_expr(unsigned i)
588 #if ULONG_MAX > 0xffffffff
589 // 64-bit version (will not work correctly for 32-bit longs!)
590 return BC_PARSE_EXPRS_BITS & (1UL << i);
593 unsigned long m = (uint32_t)BC_PARSE_EXPRS_BITS;
595 m = (uint32_t)(BC_PARSE_EXPRS_BITS >> 32);
598 return m & (1UL << i);
602 // This is an array of data for operators that correspond to
603 // [XC_LEX_1st_op...] token types.
604 static const uint8_t bc_ops_prec_and_assoc[] ALIGN1 = {
605 #define OP(p,l) ((int)(l) * 0x10 + (p))
607 OP(6, true ), OP( 6, true ), OP( 6, true ), OP( 6, true ), OP( 6, true ), OP( 6, true ), // == <= >= != < >
609 OP(3, true ), OP( 3, true ), OP( 3, true ), // mul div mod
610 OP(4, true ), OP( 4, true ), // + -
612 OP(7, true ), OP( 7, true ), // or and
613 OP(5, false), OP( 5, false ), OP( 5, false ), OP( 5, false ), OP( 5, false ), // ^= *= /= %= +=
614 OP(5, false), OP( 5, false ), // -= =
615 OP(0, false), OP( 0, false ), // inc dec
618 #define bc_operation_PREC(i) (bc_ops_prec_and_assoc[i] & 0x0f)
619 #define bc_operation_LEFT(i) (bc_ops_prec_and_assoc[i] & 0x10)
623 static const //BcLexType - should be this type
625 dc_char_to_LEX[] ALIGN1 = {
627 XC_LEX_OP_MODULUS, XC_LEX_INVALID, XC_LEX_INVALID, DC_LEX_LPAREN,
629 XC_LEX_INVALID, XC_LEX_OP_MULTIPLY, XC_LEX_OP_PLUS, XC_LEX_INVALID,
631 XC_LEX_OP_MINUS, XC_LEX_INVALID, XC_LEX_OP_DIVIDE,
633 XC_LEX_INVALID, XC_LEX_INVALID, XC_LEX_INVALID, XC_LEX_INVALID,
634 XC_LEX_INVALID, XC_LEX_INVALID, XC_LEX_INVALID, XC_LEX_INVALID,
635 XC_LEX_INVALID, XC_LEX_INVALID,
637 DC_LEX_COLON, DC_LEX_SCOLON, XC_LEX_OP_REL_GT, XC_LEX_OP_REL_EQ,
638 XC_LEX_OP_REL_LT, DC_LEX_READ, XC_LEX_INVALID,
640 XC_LEX_INVALID, XC_LEX_INVALID, XC_LEX_INVALID, XC_LEX_INVALID,
641 XC_LEX_INVALID, XC_LEX_INVALID, DC_LEX_EQ_NO_REG, XC_LEX_INVALID,
643 DC_LEX_IBASE, XC_LEX_INVALID, DC_LEX_SCALE, DC_LEX_LOAD_POP,
644 XC_LEX_INVALID, DC_LEX_OP_BOOL_NOT, DC_LEX_OBASE, DC_LEX_PRINT_STREAM,
646 DC_LEX_NQUIT, DC_LEX_POP, DC_LEX_STORE_PUSH, XC_LEX_INVALID, XC_LEX_INVALID,
647 XC_LEX_INVALID, XC_LEX_INVALID, DC_LEX_SCALE_FACTOR, XC_LEX_INVALID,
649 DC_LEX_LENGTH, XC_LEX_INVALID, XC_LEX_INVALID, XC_LEX_INVALID,
651 XC_LEX_OP_POWER, XC_LEX_NEG, XC_LEX_INVALID,
653 DC_LEX_ASCIIFY, XC_LEX_INVALID, DC_LEX_CLEAR_STACK, DC_LEX_DUPLICATE,
654 DC_LEX_ELSE, DC_LEX_PRINT_STACK, XC_LEX_INVALID, XC_LEX_INVALID,
656 DC_LEX_STORE_IBASE, XC_LEX_INVALID, DC_LEX_STORE_SCALE, DC_LEX_LOAD,
657 XC_LEX_INVALID, DC_LEX_PRINT_POP, DC_LEX_STORE_OBASE, DC_LEX_PRINT,
659 DC_LEX_QUIT, DC_LEX_SWAP, DC_LEX_OP_ASSIGN, XC_LEX_INVALID,
660 XC_LEX_INVALID, DC_LEX_SQRT, XC_LEX_INVALID, DC_LEX_EXECUTE,
662 XC_LEX_INVALID, DC_LEX_STACK_LEVEL,
664 DC_LEX_LBRACE, DC_LEX_OP_MODEXP, XC_LEX_INVALID, DC_LEX_OP_DIVMOD,
666 static const //BcInst - should be this type. Using signed narrow type since DC_INST_INVALID is -1
668 dc_LEX_to_INST[] ALIGN1 = { //starts at XC_LEX_OP_POWER // corresponding XC/DC_LEX_xyz:
669 XC_INST_POWER, XC_INST_MULTIPLY, // XC_LEX_OP_POWER XC_LEX_OP_MULTIPLY
670 XC_INST_DIVIDE, XC_INST_MODULUS, // XC_LEX_OP_DIVIDE XC_LEX_OP_MODULUS
671 XC_INST_PLUS, XC_INST_MINUS, // XC_LEX_OP_PLUS XC_LEX_OP_MINUS
672 XC_INST_BOOL_NOT, // DC_LEX_OP_BOOL_NOT
673 DC_INST_INVALID, // DC_LEX_OP_ASSIGN
674 XC_INST_REL_GT, // DC_LEX_LPAREN
675 DC_INST_INVALID, // DC_LEX_SCOLON
676 DC_INST_INVALID, // DC_LEX_READ
677 XC_INST_IBASE, // DC_LEX_IBASE
678 XC_INST_SCALE, // DC_LEX_SCALE
679 XC_INST_OBASE, // DC_LEX_OBASE
680 XC_INST_LENGTH, // DC_LEX_LENGTH
681 XC_INST_PRINT, // DC_LEX_PRINT
682 DC_INST_QUIT, // DC_LEX_QUIT
683 XC_INST_SQRT, // DC_LEX_SQRT
684 XC_INST_REL_GE, // DC_LEX_LBRACE
685 XC_INST_REL_EQ, // DC_LEX_EQ_NO_REG
686 DC_INST_MODEXP, DC_INST_DIVMOD, // DC_LEX_OP_MODEXP DC_LEX_OP_DIVMOD
687 DC_INST_INVALID, DC_INST_INVALID, // DC_LEX_COLON DC_LEX_ELSE
688 DC_INST_EXECUTE, // DC_LEX_EXECUTE
689 DC_INST_PRINT_STACK, DC_INST_CLEAR_STACK, // DC_LEX_PRINT_STACK DC_LEX_CLEAR_STACK
690 DC_INST_STACK_LEN, DC_INST_DUPLICATE, // DC_LEX_STACK_LEVEL DC_LEX_DUPLICATE
691 DC_INST_SWAP, XC_INST_POP, // DC_LEX_SWAP DC_LEX_POP
692 DC_INST_ASCIIFY, DC_INST_PRINT_STREAM, // DC_LEX_ASCIIFY DC_LEX_PRINT_STREAM
693 DC_INST_INVALID, DC_INST_INVALID, // DC_LEX_STORE_IBASE DC_LEX_STORE_OBASE
694 DC_INST_INVALID, DC_INST_INVALID, // DC_LEX_STORE_SCALE DC_LEX_LOAD
695 DC_INST_INVALID, DC_INST_INVALID, // DC_LEX_LOAD_POP DC_LEX_STORE_PUSH
696 XC_INST_PRINT, DC_INST_NQUIT, // DC_LEX_PRINT_POP DC_LEX_NQUIT
697 XC_INST_SCALE_FUNC, // DC_LEX_SCALE_FACTOR
698 // DC_INST_INVALID in this table either means that corresponding LEX
699 // is not possible for dc, or that it does not compile one-to-one
704 typedef struct BcParse {
705 smallint lex; // was BcLexType // first member is most used
706 smallint lex_last; // was BcLexType
708 const char *lex_inbuf;
709 const char *lex_next_at; // last lex_next() was called at this string
710 const char *lex_filename;
716 IF_BC(size_t in_funcdef;)
722 typedef struct BcProgram {
751 BcParse prs; // first member is most used
753 // For error messages. Can be set to current parsed line,
754 // or [TODO] to current executing line (can be before last parsed one)
759 IF_FEATURE_BC_INTERACTIVE(smallint ttyin;)
760 IF_FEATURE_CLEAN_UP(smallint exiting;)
768 #if ENABLE_FEATURE_EDITING
769 line_input_t *line_input_state;
772 #define G (*ptr_to_globals)
773 #define INIT_G() do { \
774 SET_PTR_TO_GLOBALS(xzalloc(sizeof(G))); \
776 #define FREE_G() do { \
777 FREE_PTR_TO_GLOBALS(); \
779 #define G_posix (ENABLE_BC && (option_mask32 & BC_FLAG_S))
780 #define G_warn (ENABLE_BC && (option_mask32 & BC_FLAG_W))
781 #define G_exreg (ENABLE_DC && (option_mask32 & DC_FLAG_X))
782 #if ENABLE_FEATURE_BC_INTERACTIVE
783 # define G_interrupt bb_got_signal
784 # define G_ttyin G.ttyin
786 # define G_interrupt 0
789 #if ENABLE_FEATURE_CLEAN_UP
790 # define G_exiting G.exiting
794 #define IS_BC (ENABLE_BC && (!ENABLE_DC || applet_name[0] == 'b'))
795 #define IS_DC (ENABLE_DC && (!ENABLE_BC || applet_name[0] != 'b'))
798 # define BC_PARSE_REL (1 << 0)
799 # define BC_PARSE_PRINT (1 << 1)
800 # define BC_PARSE_ARRAY (1 << 2)
801 # define BC_PARSE_NOCALL (1 << 3)
804 #define BC_PROG_MAIN 0
805 #define BC_PROG_READ 1
807 #define BC_PROG_REQ_FUNCS 2
810 #define BC_FLAG_W (1 << 0)
811 #define BC_FLAG_V (1 << 1)
812 #define BC_FLAG_S (1 << 2)
813 #define BC_FLAG_Q (1 << 3)
814 #define BC_FLAG_L (1 << 4)
815 #define BC_FLAG_I ((1 << 5) * ENABLE_DC)
816 #define DC_FLAG_X ((1 << 6) * ENABLE_DC)
818 #define BC_MAX_OBASE ((unsigned) 999)
819 #define BC_MAX_DIM ((unsigned) INT_MAX)
820 #define BC_MAX_SCALE ((unsigned) UINT_MAX)
821 #define BC_MAX_STRING ((unsigned) UINT_MAX - 1)
822 #define BC_MAX_NUM BC_MAX_STRING
823 // Unused apart from "limits" message. Just show a "biggish number" there.
824 //#define BC_MAX_NAME BC_MAX_STRING
825 //#define BC_MAX_EXP ((unsigned long) LONG_MAX)
826 //#define BC_MAX_VARS ((unsigned long) SIZE_MAX - 1)
827 #define BC_MAX_NAME_STR "999999999"
828 #define BC_MAX_EXP_STR "999999999"
829 #define BC_MAX_VARS_STR "999999999"
831 #define BC_MAX_OBASE_STR "999"
833 #if INT_MAX == 2147483647
834 # define BC_MAX_DIM_STR "2147483647"
835 #elif INT_MAX == 9223372036854775807
836 # define BC_MAX_DIM_STR "9223372036854775807"
838 # error Strange INT_MAX
841 #if UINT_MAX == 4294967295
842 # define BC_MAX_SCALE_STR "4294967295"
843 # define BC_MAX_STRING_STR "4294967294"
844 #elif UINT_MAX == 18446744073709551615
845 # define BC_MAX_SCALE_STR "18446744073709551615"
846 # define BC_MAX_STRING_STR "18446744073709551614"
848 # error Strange UINT_MAX
850 #define BC_MAX_NUM_STR BC_MAX_STRING_STR
852 // In configurations where errors abort instead of propagating error
853 // return code up the call chain, functions returning BC_STATUS
854 // actually don't return anything, they always succeed and return "void".
855 // A macro wrapper is provided, which makes this statement work:
857 // and makes it visible to the compiler that s is always zero,
858 // allowing compiler to optimize dead code after the statement.
860 // To make code more readable, each such function has a "z"
861 // ("always returning zero") prefix, i.e. zbc_foo or zdc_foo.
863 #if ENABLE_FEATURE_BC_INTERACTIVE || ENABLE_FEATURE_CLEAN_UP
864 # define ERRORS_ARE_FATAL 0
865 # define ERRORFUNC /*nothing*/
866 # define IF_ERROR_RETURN_POSSIBLE(a) a
867 # define BC_STATUS BcStatus
868 # define RETURN_STATUS(v) return (v)
869 # define COMMA_SUCCESS /*nothing*/
871 # define ERRORS_ARE_FATAL 1
872 # define ERRORFUNC NORETURN
873 # define IF_ERROR_RETURN_POSSIBLE(a) /*nothing*/
874 # define BC_STATUS void
875 # define RETURN_STATUS(v) do { ((void)(v)); return; } while (0)
876 # define COMMA_SUCCESS ,BC_STATUS_SUCCESS
883 #define BC_MAX(a, b) ((a) > (b) ? (a) : (b))
884 #define BC_MIN(a, b) ((a) < (b) ? (a) : (b))
886 static void fflush_and_check(void)
889 if (ferror(stdout) || ferror(stderr))
890 bb_perror_msg_and_die("output error");
893 #if ENABLE_FEATURE_CLEAN_UP
894 #define QUIT_OR_RETURN_TO_MAIN \
896 IF_FEATURE_BC_INTERACTIVE(G_ttyin = 0;) /* do not loop in main loop anymore */ \
898 return BC_STATUS_FAILURE; \
901 static void quit(void) NORETURN;
902 static void quit(void)
905 bb_perror_msg_and_die("input error");
907 dbg_exec("quit(): exiting with exitcode SUCCESS");
910 #define QUIT_OR_RETURN_TO_MAIN quit()
913 static void bc_verror_msg(const char *fmt, va_list p)
915 const char *sv = sv; // for compiler
916 if (G.prs.lex_filename) {
918 applet_name = xasprintf("%s: %s:%lu", applet_name,
919 G.prs.lex_filename, (unsigned long)G.err_line
922 bb_verror_msg(fmt, p, NULL);
923 if (G.prs.lex_filename) {
924 free((char*)applet_name);
929 static NOINLINE ERRORFUNC int bc_error_fmt(const char *fmt, ...)
934 bc_verror_msg(fmt, p);
937 if (ENABLE_FEATURE_CLEAN_UP || G_ttyin)
938 IF_ERROR_RETURN_POSSIBLE(return BC_STATUS_FAILURE);
943 static NOINLINE BC_STATUS zbc_posix_error_fmt(const char *fmt, ...)
947 // Are non-POSIX constructs totally ok?
948 if (!(option_mask32 & (BC_FLAG_S|BC_FLAG_W)))
949 RETURN_STATUS(BC_STATUS_SUCCESS); // yes
952 bc_verror_msg(fmt, p);
955 // Do we treat non-POSIX constructs as errors?
956 if (!(option_mask32 & BC_FLAG_S))
957 RETURN_STATUS(BC_STATUS_SUCCESS); // no, it's a warning
959 if (ENABLE_FEATURE_CLEAN_UP || G_ttyin)
960 RETURN_STATUS(BC_STATUS_FAILURE);
963 #define zbc_posix_error_fmt(...) (zbc_posix_error_fmt(__VA_ARGS__) COMMA_SUCCESS)
966 // We use error functions with "return bc_error(FMT[, PARAMS])" idiom.
967 // This idiom begs for tail-call optimization, but for it to work,
968 // function must not have caller-cleaned parameters on stack.
969 // Unfortunately, vararg function API does exactly that on most arches.
970 // Thus, use these shims for the cases when we have no vararg PARAMS:
971 static ERRORFUNC int bc_error(const char *msg)
973 IF_ERROR_RETURN_POSSIBLE(return) bc_error_fmt("%s", msg);
975 static ERRORFUNC int bc_error_at(const char *msg)
977 const char *err_at = G.prs.lex_next_at;
979 IF_ERROR_RETURN_POSSIBLE(return) bc_error_fmt(
982 (int)(strchrnul(err_at, '\n') - err_at),
986 IF_ERROR_RETURN_POSSIBLE(return) bc_error_fmt("%s", msg);
988 static ERRORFUNC int bc_error_bad_character(char c)
991 IF_ERROR_RETURN_POSSIBLE(return) bc_error("NUL character");
992 IF_ERROR_RETURN_POSSIBLE(return) bc_error_fmt("bad character '%c'", c);
994 static ERRORFUNC int bc_error_bad_function_definition(void)
996 IF_ERROR_RETURN_POSSIBLE(return) bc_error_at("bad function definition");
998 static ERRORFUNC int bc_error_bad_expression(void)
1000 IF_ERROR_RETURN_POSSIBLE(return) bc_error_at("bad expression");
1002 static ERRORFUNC int bc_error_bad_assignment(void)
1004 IF_ERROR_RETURN_POSSIBLE(return) bc_error_at(
1005 "bad assignment: left side must be variable or array element"
1008 static ERRORFUNC int bc_error_bad_token(void)
1010 IF_ERROR_RETURN_POSSIBLE(return) bc_error_at("bad token");
1012 static ERRORFUNC int bc_error_stack_has_too_few_elements(void)
1014 IF_ERROR_RETURN_POSSIBLE(return) bc_error("stack has too few elements");
1016 static ERRORFUNC int bc_error_variable_is_wrong_type(void)
1018 IF_ERROR_RETURN_POSSIBLE(return) bc_error("variable is wrong type");
1021 static BC_STATUS zbc_POSIX_requires(const char *msg)
1023 RETURN_STATUS(zbc_posix_error_fmt("POSIX requires %s", msg));
1025 #define zbc_POSIX_requires(...) (zbc_POSIX_requires(__VA_ARGS__) COMMA_SUCCESS)
1026 static BC_STATUS zbc_POSIX_does_not_allow(const char *msg)
1028 RETURN_STATUS(zbc_posix_error_fmt("%s%s", "POSIX does not allow ", msg));
1030 #define zbc_POSIX_does_not_allow(...) (zbc_POSIX_does_not_allow(__VA_ARGS__) COMMA_SUCCESS)
1031 static BC_STATUS zbc_POSIX_does_not_allow_bool_ops_this_is_bad(const char *msg)
1033 RETURN_STATUS(zbc_posix_error_fmt("%s%s %s", "POSIX does not allow ", "boolean operators; this is bad:", msg));
1035 #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)
1036 static BC_STATUS zbc_POSIX_does_not_allow_empty_X_expression_in_for(const char *msg)
1038 RETURN_STATUS(zbc_posix_error_fmt("%san empty %s expression in 'for()'", "POSIX does not allow ", msg));
1040 #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)
1043 static void bc_vec_grow(BcVec *v, size_t n)
1045 size_t cap = v->cap * 2;
1046 while (cap < v->len + n) cap *= 2;
1047 v->v = xrealloc(v->v, v->size * cap);
1051 static void bc_vec_init(BcVec *v, size_t esize, BcVecFree dtor)
1054 v->cap = BC_VEC_START_CAP;
1057 v->v = xmalloc(esize * BC_VEC_START_CAP);
1060 static void bc_char_vec_init(BcVec *v)
1062 bc_vec_init(v, sizeof(char), NULL);
1065 static void bc_vec_expand(BcVec *v, size_t req)
1068 v->v = xrealloc(v->v, v->size * req);
1073 static void bc_vec_pop(BcVec *v)
1077 v->dtor(v->v + (v->size * v->len));
1080 static void bc_vec_npop(BcVec *v, size_t n)
1085 size_t len = v->len - n;
1086 while (v->len > len) v->dtor(v->v + (v->size * --v->len));
1090 static void bc_vec_pop_all(BcVec *v)
1092 bc_vec_npop(v, v->len);
1095 static size_t bc_vec_push(BcVec *v, const void *data)
1097 size_t len = v->len;
1098 if (len >= v->cap) bc_vec_grow(v, 1);
1099 memmove(v->v + (v->size * len), data, v->size);
1104 // G.prog.results often needs "pop old operand, push result" idiom.
1105 // Can do this without a few extra ops
1106 static size_t bc_result_pop_and_push(const void *data)
1108 BcVec *v = &G.prog.results;
1110 size_t len = v->len - 1;
1112 last = v->v + (v->size * len);
1115 memmove(last, data, v->size);
1119 static size_t bc_vec_pushByte(BcVec *v, char data)
1121 return bc_vec_push(v, &data);
1124 static size_t bc_vec_pushZeroByte(BcVec *v)
1126 //return bc_vec_pushByte(v, '\0');
1128 return bc_vec_push(v, &const_int_0);
1131 static void bc_vec_pushAt(BcVec *v, const void *data, size_t idx)
1134 bc_vec_push(v, data);
1138 if (v->len == v->cap) bc_vec_grow(v, 1);
1140 ptr = v->v + v->size * idx;
1142 memmove(ptr + v->size, ptr, v->size * (v->len++ - idx));
1143 memmove(ptr, data, v->size);
1147 static void bc_vec_string(BcVec *v, size_t len, const char *str)
1150 bc_vec_expand(v, len + 1);
1151 memcpy(v->v, str, len);
1154 bc_vec_pushZeroByte(v);
1157 static void *bc_vec_item(const BcVec *v, size_t idx)
1159 return v->v + v->size * idx;
1162 static void *bc_vec_item_rev(const BcVec *v, size_t idx)
1164 return v->v + v->size * (v->len - idx - 1);
1167 static void *bc_vec_top(const BcVec *v)
1169 return v->v + v->size * (v->len - 1);
1172 static FAST_FUNC void bc_vec_free(void *vec)
1174 BcVec *v = (BcVec *) vec;
1179 static BcFunc* xc_program_func(size_t idx)
1181 return bc_vec_item(&G.prog.fns, idx);
1183 // BC_PROG_MAIN is zeroth element, so:
1184 #define xc_program_func_BC_PROG_MAIN() ((BcFunc*)(G.prog.fns.v))
1187 static BcFunc* bc_program_current_func(void)
1189 BcInstPtr *ip = bc_vec_top(&G.prog.exestack);
1190 BcFunc *func = xc_program_func(ip->func);
1195 static char** xc_program_str(size_t idx)
1199 BcFunc *func = bc_program_current_func();
1200 return bc_vec_item(&func->strs, idx);
1203 IF_DC(return bc_vec_item(&G.prog.strs, idx);)
1206 static char** xc_program_const(size_t idx)
1210 BcFunc *func = bc_program_current_func();
1211 return bc_vec_item(&func->consts, idx);
1214 IF_DC(return bc_vec_item(&G.prog.consts, idx);)
1217 static int bc_id_cmp(const void *e1, const void *e2)
1219 return strcmp(((const BcId *) e1)->name, ((const BcId *) e2)->name);
1222 static FAST_FUNC void bc_id_free(void *id)
1224 free(((BcId *) id)->name);
1227 static size_t bc_map_find_ge(const BcVec *v, const void *ptr)
1229 size_t low = 0, high = v->len;
1231 while (low < high) {
1232 size_t mid = (low + high) / 2;
1233 BcId *id = bc_vec_item(v, mid);
1234 int result = bc_id_cmp(ptr, id);
1247 static int bc_map_insert(BcVec *v, const void *ptr, size_t *i)
1249 size_t n = *i = bc_map_find_ge(v, ptr);
1252 bc_vec_push(v, ptr);
1253 else if (!bc_id_cmp(ptr, bc_vec_item(v, n)))
1254 return 0; // "was not inserted"
1256 bc_vec_pushAt(v, ptr, n);
1257 return 1; // "was inserted"
1261 static size_t bc_map_find_exact(const BcVec *v, const void *ptr)
1263 size_t i = bc_map_find_ge(v, ptr);
1264 if (i >= v->len) return BC_VEC_INVALID_IDX;
1265 return bc_id_cmp(ptr, bc_vec_item(v, i)) ? BC_VEC_INVALID_IDX : i;
1269 static void bc_num_setToZero(BcNum *n, size_t scale)
1276 static void bc_num_zero(BcNum *n)
1278 bc_num_setToZero(n, 0);
1281 static void bc_num_one(BcNum *n)
1283 bc_num_setToZero(n, 0);
1288 // Note: this also sets BcNum to zero
1289 static void bc_num_init(BcNum *n, size_t req)
1291 req = req >= BC_NUM_DEF_SIZE ? req : BC_NUM_DEF_SIZE;
1292 //memset(n, 0, sizeof(BcNum)); - cleared by assignments below
1293 n->num = xmalloc(req);
1300 static void bc_num_init_DEF_SIZE(BcNum *n)
1302 bc_num_init(n, BC_NUM_DEF_SIZE);
1305 static void bc_num_expand(BcNum *n, size_t req)
1307 req = req >= BC_NUM_DEF_SIZE ? req : BC_NUM_DEF_SIZE;
1309 n->num = xrealloc(n->num, req);
1314 static FAST_FUNC void bc_num_free(void *num)
1316 free(((BcNum *) num)->num);
1319 static void bc_num_copy(BcNum *d, BcNum *s)
1322 bc_num_expand(d, s->cap);
1326 memcpy(d->num, s->num, sizeof(BcDig) * d->len);
1330 static BC_STATUS zbc_num_ulong_abs(BcNum *n, unsigned long *result_p)
1333 unsigned long result;
1337 while (i > n->rdx) {
1338 unsigned long prev = result;
1339 result = result * 10 + n->num[--i];
1340 // Even overflowed N*10 can still satisfy N*10>=N. For example,
1341 // 0x1ff00000 * 10 is 0x13f600000,
1342 // or 0x3f600000 truncated to 32 bits. Which is larger.
1343 // However, (N*10)/8 < N check is always correct.
1344 if ((result / 8) < prev)
1345 RETURN_STATUS(bc_error("overflow"));
1349 RETURN_STATUS(BC_STATUS_SUCCESS);
1351 #define zbc_num_ulong_abs(...) (zbc_num_ulong_abs(__VA_ARGS__) COMMA_SUCCESS)
1353 static BC_STATUS zbc_num_ulong(BcNum *n, unsigned long *result_p)
1355 if (n->neg) RETURN_STATUS(bc_error("negative number"));
1357 RETURN_STATUS(zbc_num_ulong_abs(n, result_p));
1359 #define zbc_num_ulong(...) (zbc_num_ulong(__VA_ARGS__) COMMA_SUCCESS)
1361 #if ULONG_MAX == 0xffffffffUL // 10 digits: 4294967295
1362 # define ULONG_NUM_BUFSIZE (10 > BC_NUM_DEF_SIZE ? 10 : BC_NUM_DEF_SIZE)
1363 #elif ULONG_MAX == 0xffffffffffffffffULL // 20 digits: 18446744073709551615
1364 # define ULONG_NUM_BUFSIZE (20 > BC_NUM_DEF_SIZE ? 20 : BC_NUM_DEF_SIZE)
1366 // minimum BC_NUM_DEF_SIZE, so that bc_num_expand() in bc_num_ulong2num()
1367 // would not hit realloc() code path - not good if num[] is not malloced
1369 static void bc_num_ulong2num(BcNum *n, unsigned long val)
1375 if (val == 0) return;
1377 bc_num_expand(n, ULONG_NUM_BUFSIZE);
1384 if (val == 0) break;
1388 static void bc_num_subArrays(BcDig *restrict a, BcDig *restrict b, size_t len)
1391 for (i = 0; i < len; ++i) {
1393 for (j = i; a[j] < 0;) {
1400 static ssize_t bc_num_compare(BcDig *restrict a, BcDig *restrict b, size_t len)
1418 #define BC_NUM_NEG(n, neg) ((((ssize_t)(n)) ^ -((ssize_t)(neg))) + (neg))
1419 #define BC_NUM_ONE(n) ((n)->len == 1 && (n)->rdx == 0 && (n)->num[0] == 1)
1420 #define BC_NUM_INT(n) ((n)->len - (n)->rdx)
1421 //#define BC_NUM_AREQ(a, b) (BC_MAX((a)->rdx, (b)->rdx) + BC_MAX(BC_NUM_INT(a), BC_NUM_INT(b)) + 1)
1422 static /*ALWAYS_INLINE*/ size_t BC_NUM_AREQ(BcNum *a, BcNum *b)
1424 return BC_MAX(a->rdx, b->rdx) + BC_MAX(BC_NUM_INT(a), BC_NUM_INT(b)) + 1;
1426 //#define BC_NUM_MREQ(a, b, scale) (BC_NUM_INT(a) + BC_NUM_INT(b) + BC_MAX((scale), (a)->rdx + (b)->rdx) + 1)
1427 static /*ALWAYS_INLINE*/ size_t BC_NUM_MREQ(BcNum *a, BcNum *b, size_t scale)
1429 return BC_NUM_INT(a) + BC_NUM_INT(b) + BC_MAX(scale, a->rdx + b->rdx) + 1;
1432 static ssize_t bc_num_cmp(BcNum *a, BcNum *b)
1434 size_t i, min, a_int, b_int, diff;
1435 BcDig *max_num, *min_num;
1439 if (a == b) return 0;
1440 if (a->len == 0) return BC_NUM_NEG(!!b->len, !b->neg);
1441 if (b->len == 0) return BC_NUM_NEG(1, a->neg);
1443 if (a->neg != b->neg) // signs of a and b differ
1444 // +a,-b = a>b = 1 or -a,+b = a<b = -1
1445 return (int)b->neg - (int)a->neg;
1446 neg = a->neg; // 1 if both negative, 0 if both positive
1448 a_int = BC_NUM_INT(a);
1449 b_int = BC_NUM_INT(b);
1452 if (a_int != 0) return (ssize_t) a_int;
1454 a_max = (a->rdx > b->rdx);
1457 diff = a->rdx - b->rdx;
1458 max_num = a->num + diff;
1460 // neg = (a_max == neg); - NOP (maps 1->1 and 0->0)
1463 diff = b->rdx - a->rdx;
1464 max_num = b->num + diff;
1466 neg = !neg; // same as "neg = (a_max == neg)"
1469 cmp = bc_num_compare(max_num, min_num, b_int + min);
1470 if (cmp != 0) return BC_NUM_NEG(cmp, neg);
1472 for (max_num -= diff, i = diff - 1; i < diff; --i) {
1473 if (max_num[i]) return BC_NUM_NEG(1, neg);
1479 static void bc_num_truncate(BcNum *n, size_t places)
1481 if (places == 0) return;
1487 memmove(n->num, n->num + places, n->len * sizeof(BcDig));
1491 static void bc_num_extend(BcNum *n, size_t places)
1493 size_t len = n->len + places;
1496 if (n->cap < len) bc_num_expand(n, len);
1498 memmove(n->num + places, n->num, sizeof(BcDig) * n->len);
1499 memset(n->num, 0, sizeof(BcDig) * places);
1506 static void bc_num_clean(BcNum *n)
1508 while (n->len > 0 && n->num[n->len - 1] == 0) --n->len;
1511 else if (n->len < n->rdx)
1515 static void bc_num_retireMul(BcNum *n, size_t scale, bool neg1, bool neg2)
1518 bc_num_extend(n, scale - n->rdx);
1520 bc_num_truncate(n, n->rdx - scale);
1523 if (n->len != 0) n->neg = !neg1 != !neg2;
1526 static void bc_num_split(BcNum *restrict n, size_t idx, BcNum *restrict a,
1530 b->len = n->len - idx;
1532 a->rdx = b->rdx = 0;
1534 memcpy(b->num, n->num + idx, b->len * sizeof(BcDig));
1535 memcpy(a->num, n->num, idx * sizeof(BcDig));
1545 static BC_STATUS zbc_num_shift(BcNum *n, size_t places)
1547 if (places == 0 || n->len == 0) RETURN_STATUS(BC_STATUS_SUCCESS);
1549 // This check makes sense only if size_t is (much) larger than BC_MAX_NUM.
1550 if (SIZE_MAX > (BC_MAX_NUM | 0xff)) {
1551 if (places + n->len > BC_MAX_NUM)
1552 RETURN_STATUS(bc_error("number too long: must be [1,"BC_MAX_NUM_STR"]"));
1555 if (n->rdx >= places)
1558 bc_num_extend(n, places - n->rdx);
1564 RETURN_STATUS(BC_STATUS_SUCCESS);
1566 #define zbc_num_shift(...) (zbc_num_shift(__VA_ARGS__) COMMA_SUCCESS)
1568 typedef BC_STATUS (*BcNumBinaryOp)(BcNum *, BcNum *, BcNum *, size_t) FAST_FUNC;
1570 static BC_STATUS zbc_num_binary(BcNum *a, BcNum *b, BcNum *c, size_t scale,
1571 BcNumBinaryOp op, size_t req)
1574 BcNum num2, *ptr_a, *ptr_b;
1579 memcpy(ptr_a, c, sizeof(BcNum));
1587 memcpy(ptr_b, c, sizeof(BcNum));
1594 bc_num_init(c, req);
1596 bc_num_expand(c, req);
1598 s = BC_STATUS_SUCCESS;
1599 IF_ERROR_RETURN_POSSIBLE(s =) op(ptr_a, ptr_b, c, scale);
1601 if (init) bc_num_free(&num2);
1605 #define zbc_num_binary(...) (zbc_num_binary(__VA_ARGS__) COMMA_SUCCESS)
1607 static FAST_FUNC BC_STATUS zbc_num_a(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale);
1608 static FAST_FUNC BC_STATUS zbc_num_s(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale);
1609 static FAST_FUNC BC_STATUS zbc_num_p(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale);
1610 static FAST_FUNC BC_STATUS zbc_num_m(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale);
1611 static FAST_FUNC BC_STATUS zbc_num_d(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale);
1612 static FAST_FUNC BC_STATUS zbc_num_rem(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale);
1614 static FAST_FUNC BC_STATUS zbc_num_add(BcNum *a, BcNum *b, BcNum *c, size_t scale)
1616 BcNumBinaryOp op = (!a->neg == !b->neg) ? zbc_num_a : zbc_num_s;
1618 RETURN_STATUS(zbc_num_binary(a, b, c, false, op, BC_NUM_AREQ(a, b)));
1621 static FAST_FUNC BC_STATUS zbc_num_sub(BcNum *a, BcNum *b, BcNum *c, size_t scale)
1623 BcNumBinaryOp op = (!a->neg == !b->neg) ? zbc_num_s : zbc_num_a;
1625 RETURN_STATUS(zbc_num_binary(a, b, c, true, op, BC_NUM_AREQ(a, b)));
1628 static FAST_FUNC BC_STATUS zbc_num_mul(BcNum *a, BcNum *b, BcNum *c, size_t scale)
1630 size_t req = BC_NUM_MREQ(a, b, scale);
1631 RETURN_STATUS(zbc_num_binary(a, b, c, scale, zbc_num_m, req));
1634 static FAST_FUNC BC_STATUS zbc_num_div(BcNum *a, BcNum *b, BcNum *c, size_t scale)
1636 size_t req = BC_NUM_MREQ(a, b, scale);
1637 RETURN_STATUS(zbc_num_binary(a, b, c, scale, zbc_num_d, req));
1640 static FAST_FUNC BC_STATUS zbc_num_mod(BcNum *a, BcNum *b, BcNum *c, size_t scale)
1642 size_t req = BC_NUM_MREQ(a, b, scale);
1643 RETURN_STATUS(zbc_num_binary(a, b, c, scale, zbc_num_rem, req));
1646 static FAST_FUNC BC_STATUS zbc_num_pow(BcNum *a, BcNum *b, BcNum *c, size_t scale)
1648 RETURN_STATUS(zbc_num_binary(a, b, c, scale, zbc_num_p, a->len * b->len + 1));
1651 static const BcNumBinaryOp zxc_program_ops[] = {
1652 zbc_num_pow, zbc_num_mul, zbc_num_div, zbc_num_mod, zbc_num_add, zbc_num_sub,
1654 #define zbc_num_add(...) (zbc_num_add(__VA_ARGS__) COMMA_SUCCESS)
1655 #define zbc_num_sub(...) (zbc_num_sub(__VA_ARGS__) COMMA_SUCCESS)
1656 #define zbc_num_mul(...) (zbc_num_mul(__VA_ARGS__) COMMA_SUCCESS)
1657 #define zbc_num_div(...) (zbc_num_div(__VA_ARGS__) COMMA_SUCCESS)
1658 #define zbc_num_mod(...) (zbc_num_mod(__VA_ARGS__) COMMA_SUCCESS)
1659 #define zbc_num_pow(...) (zbc_num_pow(__VA_ARGS__) COMMA_SUCCESS)
1661 static BC_STATUS zbc_num_inv(BcNum *a, BcNum *b, size_t scale)
1670 RETURN_STATUS(zbc_num_div(&one, a, b, scale));
1672 #define zbc_num_inv(...) (zbc_num_inv(__VA_ARGS__) COMMA_SUCCESS)
1674 static FAST_FUNC BC_STATUS zbc_num_a(BcNum *a, BcNum *b, BcNum *restrict c, size_t sub)
1676 BcDig *ptr, *ptr_a, *ptr_b, *ptr_c;
1677 size_t i, max, min_rdx, min_int, diff, a_int, b_int;
1680 // Because this function doesn't need to use scale (per the bc spec),
1681 // I am hijacking it to say whether it's doing an add or a subtract.
1685 if (sub && c->len) c->neg = !c->neg;
1686 RETURN_STATUS(BC_STATUS_SUCCESS);
1690 RETURN_STATUS(BC_STATUS_SUCCESS);
1694 c->rdx = BC_MAX(a->rdx, b->rdx);
1695 min_rdx = BC_MIN(a->rdx, b->rdx);
1698 if (a->rdx > b->rdx) {
1699 diff = a->rdx - b->rdx;
1701 ptr_a = a->num + diff;
1704 diff = b->rdx - a->rdx;
1707 ptr_b = b->num + diff;
1711 for (i = 0; i < diff; ++i, ++c->len)
1715 a_int = BC_NUM_INT(a);
1716 b_int = BC_NUM_INT(b);
1718 if (a_int > b_int) {
1729 for (i = 0; i < min_rdx + min_int; ++i) {
1730 unsigned in = (unsigned)ptr_a[i] + (unsigned)ptr_b[i] + carry;
1732 ptr_c[i] = (BcDig)(in % 10);
1734 for (; i < max + min_rdx; ++i) {
1735 unsigned in = (unsigned)ptr[i] + carry;
1737 ptr_c[i] = (BcDig)(in % 10);
1741 if (carry != 0) c->num[c->len++] = (BcDig) carry;
1743 RETURN_STATUS(BC_STATUS_SUCCESS); // can't make void, see zbc_num_binary()
1746 static FAST_FUNC BC_STATUS zbc_num_s(BcNum *a, BcNum *b, BcNum *restrict c, size_t sub)
1749 BcNum *minuend, *subtrahend;
1751 bool aneg, bneg, neg;
1753 // Because this function doesn't need to use scale (per the bc spec),
1754 // I am hijacking it to say whether it's doing an add or a subtract.
1758 if (sub && c->len) c->neg = !c->neg;
1759 RETURN_STATUS(BC_STATUS_SUCCESS);
1763 RETURN_STATUS(BC_STATUS_SUCCESS);
1768 a->neg = b->neg = false;
1770 cmp = bc_num_cmp(a, b);
1776 bc_num_setToZero(c, BC_MAX(a->rdx, b->rdx));
1777 RETURN_STATUS(BC_STATUS_SUCCESS);
1785 if (sub) neg = !neg;
1790 bc_num_copy(c, minuend);
1793 if (c->rdx < subtrahend->rdx) {
1794 bc_num_extend(c, subtrahend->rdx - c->rdx);
1797 start = c->rdx - subtrahend->rdx;
1799 bc_num_subArrays(c->num + start, subtrahend->num, subtrahend->len);
1803 RETURN_STATUS(BC_STATUS_SUCCESS); // can't make void, see zbc_num_binary()
1806 static FAST_FUNC BC_STATUS zbc_num_k(BcNum *restrict a, BcNum *restrict b,
1808 #define zbc_num_k(...) (zbc_num_k(__VA_ARGS__) COMMA_SUCCESS)
1811 size_t max = BC_MAX(a->len, b->len), max2 = (max + 1) / 2;
1812 BcNum l1, h1, l2, h2, m2, m1, z0, z1, z2, temp;
1815 if (a->len == 0 || b->len == 0) {
1817 RETURN_STATUS(BC_STATUS_SUCCESS);
1819 aone = BC_NUM_ONE(a);
1820 if (aone || BC_NUM_ONE(b)) {
1821 bc_num_copy(c, aone ? b : a);
1822 RETURN_STATUS(BC_STATUS_SUCCESS);
1825 if (a->len + b->len < BC_NUM_KARATSUBA_LEN
1826 || a->len < BC_NUM_KARATSUBA_LEN
1827 || b->len < BC_NUM_KARATSUBA_LEN
1831 bc_num_expand(c, a->len + b->len + 1);
1833 memset(c->num, 0, sizeof(BcDig) * c->cap);
1836 for (i = 0; i < b->len; ++i) {
1838 for (j = 0; j < a->len; ++j) {
1839 unsigned in = c->num[i + j];
1840 in += (unsigned)a->num[j] * (unsigned)b->num[i] + carry;
1841 // note: compilers prefer _unsigned_ div/const
1843 c->num[i + j] = (BcDig)(in % 10);
1846 c->num[i + j] += (BcDig) carry;
1847 len = BC_MAX(len, i + j + !!carry);
1849 #if ENABLE_FEATURE_BC_INTERACTIVE
1851 // a*a <- without check below, this will not be interruptible
1852 if (G_interrupt) return BC_STATUS_FAILURE;
1858 RETURN_STATUS(BC_STATUS_SUCCESS);
1861 bc_num_init(&l1, max);
1862 bc_num_init(&h1, max);
1863 bc_num_init(&l2, max);
1864 bc_num_init(&h2, max);
1865 bc_num_init(&m1, max);
1866 bc_num_init(&m2, max);
1867 bc_num_init(&z0, max);
1868 bc_num_init(&z1, max);
1869 bc_num_init(&z2, max);
1870 bc_num_init(&temp, max + max);
1872 bc_num_split(a, max2, &l1, &h1);
1873 bc_num_split(b, max2, &l2, &h2);
1875 s = zbc_num_add(&h1, &l1, &m1, 0);
1877 s = zbc_num_add(&h2, &l2, &m2, 0);
1880 s = zbc_num_k(&h1, &h2, &z0);
1882 s = zbc_num_k(&m1, &m2, &z1);
1884 s = zbc_num_k(&l1, &l2, &z2);
1887 s = zbc_num_sub(&z1, &z0, &temp, 0);
1889 s = zbc_num_sub(&temp, &z2, &z1, 0);
1892 s = zbc_num_shift(&z0, max2 * 2);
1894 s = zbc_num_shift(&z1, max2);
1896 s = zbc_num_add(&z0, &z1, &temp, 0);
1898 s = zbc_num_add(&temp, &z2, c, 0);
1913 static FAST_FUNC BC_STATUS zbc_num_m(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale)
1917 size_t maxrdx = BC_MAX(a->rdx, b->rdx);
1919 scale = BC_MAX(scale, a->rdx);
1920 scale = BC_MAX(scale, b->rdx);
1921 scale = BC_MIN(a->rdx + b->rdx, scale);
1922 maxrdx = BC_MAX(maxrdx, scale);
1924 bc_num_init(&cpa, a->len);
1925 bc_num_init(&cpb, b->len);
1927 bc_num_copy(&cpa, a);
1928 bc_num_copy(&cpb, b);
1929 cpa.neg = cpb.neg = false;
1931 s = zbc_num_shift(&cpa, maxrdx);
1933 s = zbc_num_shift(&cpb, maxrdx);
1935 s = zbc_num_k(&cpa, &cpb, c);
1939 bc_num_expand(c, c->len + maxrdx);
1941 if (c->len < maxrdx) {
1942 memset(c->num + c->len, 0, (c->cap - c->len) * sizeof(BcDig));
1947 bc_num_retireMul(c, scale, a->neg, b->neg);
1953 #define zbc_num_m(...) (zbc_num_m(__VA_ARGS__) COMMA_SUCCESS)
1955 static FAST_FUNC BC_STATUS zbc_num_d(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale)
1962 RETURN_STATUS(bc_error("divide by zero"));
1964 bc_num_setToZero(c, scale);
1965 RETURN_STATUS(BC_STATUS_SUCCESS);
1967 if (BC_NUM_ONE(b)) {
1969 bc_num_retireMul(c, scale, a->neg, b->neg);
1970 RETURN_STATUS(BC_STATUS_SUCCESS);
1973 bc_num_init(&cp, BC_NUM_MREQ(a, b, scale));
1974 bc_num_copy(&cp, a);
1978 bc_num_expand(&cp, len + 2);
1979 bc_num_extend(&cp, len - cp.len);
1982 if (b->rdx > cp.rdx) bc_num_extend(&cp, b->rdx - cp.rdx);
1984 if (scale > cp.rdx) bc_num_extend(&cp, scale - cp.rdx);
1986 if (b->rdx == b->len) {
1988 if (len == 0) break;
1990 if (b->num[len] != 0)
1996 if (cp.cap == cp.len) bc_num_expand(&cp, cp.len + 1);
1998 // We want an extra zero in front to make things simpler.
1999 cp.num[cp.len++] = 0;
2002 bc_num_expand(c, cp.len);
2005 memset(c->num + end, 0, (c->cap - end) * sizeof(BcDig));
2009 s = BC_STATUS_SUCCESS;
2010 for (i = end - 1; i < end; --i) {
2013 for (q = 0; n[len] != 0 || bc_num_compare(n, b->num, len) >= 0; ++q)
2014 bc_num_subArrays(n, b->num, len);
2016 #if ENABLE_FEATURE_BC_INTERACTIVE
2019 // 1/a <- without check below, this will not be interruptible
2021 s = BC_STATUS_FAILURE;
2027 bc_num_retireMul(c, scale, a->neg, b->neg);
2032 #define zbc_num_d(...) (zbc_num_d(__VA_ARGS__) COMMA_SUCCESS)
2034 static FAST_FUNC BC_STATUS zbc_num_r(BcNum *a, BcNum *b, BcNum *restrict c,
2035 BcNum *restrict d, size_t scale, size_t ts)
2042 RETURN_STATUS(bc_error("divide by zero"));
2045 bc_num_setToZero(d, ts);
2046 RETURN_STATUS(BC_STATUS_SUCCESS);
2049 bc_num_init(&temp, d->cap);
2050 s = zbc_num_d(a, b, c, scale);
2053 if (scale != 0) scale = ts;
2055 s = zbc_num_m(c, b, &temp, scale);
2057 s = zbc_num_sub(a, &temp, d, scale);
2060 if (ts > d->rdx && d->len) bc_num_extend(d, ts - d->rdx);
2063 bc_num_retireMul(d, ts, a->neg, b->neg);
2069 #define zbc_num_r(...) (zbc_num_r(__VA_ARGS__) COMMA_SUCCESS)
2071 static FAST_FUNC BC_STATUS zbc_num_rem(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale)
2075 size_t ts = BC_MAX(scale + b->rdx, a->rdx), len = BC_NUM_MREQ(a, b, ts);
2077 bc_num_init(&c1, len);
2078 s = zbc_num_r(a, b, &c1, c, scale, ts);
2083 #define zbc_num_rem(...) (zbc_num_rem(__VA_ARGS__) COMMA_SUCCESS)
2085 static FAST_FUNC BC_STATUS zbc_num_p(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale)
2087 BcStatus s = BC_STATUS_SUCCESS;
2090 size_t i, powrdx, resrdx;
2093 // GNU bc does not allow 2^2.0 - we do
2094 for (i = 0; i < b->rdx; i++)
2096 RETURN_STATUS(bc_error("not an integer"));
2100 RETURN_STATUS(BC_STATUS_SUCCESS);
2103 bc_num_setToZero(c, scale);
2104 RETURN_STATUS(BC_STATUS_SUCCESS);
2106 if (BC_NUM_ONE(b)) {
2110 s = zbc_num_inv(a, c, scale);
2115 s = zbc_num_ulong_abs(b, &pow);
2116 if (s) RETURN_STATUS(s);
2117 // b is not used beyond this point
2119 bc_num_init(©, a->len);
2120 bc_num_copy(©, a);
2125 if (a->rdx * pow < scale)
2126 scale = a->rdx * pow;
2130 for (powrdx = a->rdx; !(pow & 1); pow >>= 1) {
2132 s = zbc_num_mul(©, ©, ©, powrdx);
2134 // Not needed: zbc_num_mul() has a check for ^C:
2135 //if (G_interrupt) {
2136 // s = BC_STATUS_FAILURE;
2141 bc_num_copy(c, ©);
2143 for (resrdx = powrdx, pow >>= 1; pow != 0; pow >>= 1) {
2145 s = zbc_num_mul(©, ©, ©, powrdx);
2150 s = zbc_num_mul(c, ©, c, resrdx);
2153 // Not needed: zbc_num_mul() has a check for ^C:
2154 //if (G_interrupt) {
2155 // s = BC_STATUS_FAILURE;
2161 s = zbc_num_inv(c, c, scale);
2165 if (c->rdx > scale) bc_num_truncate(c, c->rdx - scale);
2167 // We can't use bc_num_clean() here.
2168 for (i = 0; i < c->len; ++i)
2171 bc_num_setToZero(c, scale);
2178 #define zbc_num_p(...) (zbc_num_p(__VA_ARGS__) COMMA_SUCCESS)
2180 static BC_STATUS zbc_num_sqrt(BcNum *a, BcNum *restrict b, size_t scale)
2183 BcNum num1, num2, half, f, fprime, *x0, *x1, *temp;
2185 size_t pow, len, digs, digs1, resrdx, req, times = 0;
2186 ssize_t cmp = 1, cmp1 = SSIZE_MAX, cmp2 = SSIZE_MAX;
2188 req = BC_MAX(scale, a->rdx) + ((BC_NUM_INT(a) + 1) >> 1) + 1;
2189 bc_num_expand(b, req);
2192 bc_num_setToZero(b, scale);
2193 RETURN_STATUS(BC_STATUS_SUCCESS);
2196 RETURN_STATUS(bc_error("negative number"));
2198 if (BC_NUM_ONE(a)) {
2200 bc_num_extend(b, scale);
2201 RETURN_STATUS(BC_STATUS_SUCCESS);
2204 scale = BC_MAX(scale, a->rdx) + 1;
2205 len = a->len + scale;
2207 bc_num_init(&num1, len);
2208 bc_num_init(&num2, len);
2210 half.cap = ARRAY_SIZE(half_digs);
2211 half.num = half_digs;
2216 bc_num_init(&f, len);
2217 bc_num_init(&fprime, len);
2223 pow = BC_NUM_INT(a);
2231 pow -= 2 - (pow & 1);
2233 bc_num_extend(x0, pow);
2235 // Make sure to move the radix back.
2239 x0->rdx = digs = digs1 = 0;
2241 len = BC_NUM_INT(x0) + resrdx - 1;
2243 while (cmp != 0 || digs < len) {
2244 s = zbc_num_div(a, x0, &f, resrdx);
2246 s = zbc_num_add(x0, &f, &fprime, resrdx);
2248 s = zbc_num_mul(&fprime, &half, x1, resrdx);
2251 cmp = bc_num_cmp(x1, x0);
2252 digs = x1->len - (unsigned long long) llabs(cmp);
2254 if (cmp == cmp2 && digs == digs1)
2259 resrdx += times > 4;
2272 if (b->rdx > scale) bc_num_truncate(b, b->rdx - scale);
2274 bc_num_free(&fprime);
2280 #define zbc_num_sqrt(...) (zbc_num_sqrt(__VA_ARGS__) COMMA_SUCCESS)
2282 static BC_STATUS zbc_num_divmod(BcNum *a, BcNum *b, BcNum *c, BcNum *d,
2288 size_t ts = BC_MAX(scale + b->rdx, a->rdx), len = BC_NUM_MREQ(a, b, ts);
2291 memcpy(&num2, c, sizeof(BcNum));
2293 bc_num_init(c, len);
2297 bc_num_expand(c, len);
2300 s = zbc_num_r(ptr_a, b, c, d, scale, ts);
2302 if (init) bc_num_free(&num2);
2306 #define zbc_num_divmod(...) (zbc_num_divmod(__VA_ARGS__) COMMA_SUCCESS)
2309 static BC_STATUS zdc_num_modexp(BcNum *a, BcNum *b, BcNum *c, BcNum *restrict d)
2312 BcNum base, exp, two, temp;
2316 RETURN_STATUS(bc_error("divide by zero"));
2317 if (a->rdx || b->rdx || c->rdx)
2318 RETURN_STATUS(bc_error("not an integer"));
2320 RETURN_STATUS(bc_error("negative number"));
2322 bc_num_expand(d, c->len);
2323 bc_num_init(&base, c->len);
2324 bc_num_init(&exp, b->len);
2325 bc_num_init(&temp, b->len);
2327 two.cap = ARRAY_SIZE(two_digs);
2334 s = zbc_num_rem(a, c, &base, 0);
2336 bc_num_copy(&exp, b);
2338 while (exp.len != 0) {
2339 s = zbc_num_divmod(&exp, &two, &exp, &temp, 0);
2342 if (BC_NUM_ONE(&temp)) {
2343 s = zbc_num_mul(d, &base, &temp, 0);
2345 s = zbc_num_rem(&temp, c, d, 0);
2349 s = zbc_num_mul(&base, &base, &temp, 0);
2351 s = zbc_num_rem(&temp, c, &base, 0);
2360 #define zdc_num_modexp(...) (zdc_num_modexp(__VA_ARGS__) COMMA_SUCCESS)
2363 static FAST_FUNC void bc_string_free(void *string)
2365 free(*(char**)string);
2368 static void bc_func_init(BcFunc *f)
2370 bc_char_vec_init(&f->code);
2371 IF_BC(bc_vec_init(&f->labels, sizeof(size_t), NULL);)
2372 IF_BC(bc_vec_init(&f->autos, sizeof(BcId), bc_id_free);)
2373 IF_BC(bc_vec_init(&f->strs, sizeof(char *), bc_string_free);)
2374 IF_BC(bc_vec_init(&f->consts, sizeof(char *), bc_string_free);)
2375 IF_BC(f->nparams = 0;)
2378 static FAST_FUNC void bc_func_free(void *func)
2380 BcFunc *f = (BcFunc *) func;
2381 bc_vec_free(&f->code);
2382 IF_BC(bc_vec_free(&f->labels);)
2383 IF_BC(bc_vec_free(&f->autos);)
2384 IF_BC(bc_vec_free(&f->strs);)
2385 IF_BC(bc_vec_free(&f->consts);)
2388 static void bc_array_expand(BcVec *a, size_t len);
2390 static void bc_array_init(BcVec *a, bool nums)
2393 bc_vec_init(a, sizeof(BcNum), bc_num_free);
2395 bc_vec_init(a, sizeof(BcVec), bc_vec_free);
2396 bc_array_expand(a, 1);
2399 static void bc_array_expand(BcVec *a, size_t len)
2401 if (a->dtor == bc_num_free
2402 // && a->size == sizeof(BcNum) - always true
2405 while (len > a->len) {
2406 bc_num_init_DEF_SIZE(&n);
2411 while (len > a->len) {
2412 bc_array_init(&v, true);
2418 static void bc_array_copy(BcVec *d, const BcVec *s)
2424 bc_vec_expand(d, s->cap);
2429 for (i = 0; i < s->len; i++, dnum++, snum++) {
2430 bc_num_init(dnum, snum->len);
2431 bc_num_copy(dnum, snum);
2436 static void dc_result_copy(BcResult *d, BcResult *src)
2441 case XC_RESULT_TEMP:
2442 case XC_RESULT_IBASE:
2443 case XC_RESULT_SCALE:
2444 case XC_RESULT_OBASE:
2445 bc_num_init(&d->d.n, src->d.n.len);
2446 bc_num_copy(&d->d.n, &src->d.n);
2449 case XC_RESULT_ARRAY:
2450 case XC_RESULT_ARRAY_ELEM:
2451 d->d.id.name = xstrdup(src->d.id.name);
2453 case XC_RESULT_CONSTANT:
2454 IF_BC(case BC_RESULT_LAST:)
2455 IF_BC(case BC_RESULT_ONE:)
2457 memcpy(&d->d.n, &src->d.n, sizeof(BcNum));
2463 static FAST_FUNC void bc_result_free(void *result)
2465 BcResult *r = (BcResult *) result;
2468 case XC_RESULT_TEMP:
2469 case XC_RESULT_IBASE:
2470 case XC_RESULT_SCALE:
2471 case XC_RESULT_OBASE:
2472 bc_num_free(&r->d.n);
2475 case XC_RESULT_ARRAY:
2476 case XC_RESULT_ARRAY_ELEM:
2485 static int bad_input_byte(char c)
2487 if ((c < ' ' && c != '\t' && c != '\r' && c != '\n') // also allow '\v' '\f'?
2490 bc_error_fmt("illegal character 0x%02x", c);
2496 static void xc_read_line(BcVec *vec, FILE *fp)
2499 bc_vec_pop_all(vec);
2502 #if ENABLE_FEATURE_BC_INTERACTIVE
2503 if (G_interrupt) { // ^C was pressed
2506 // ^C while running a script (bc SCRIPT): die.
2507 // We do not return to interactive prompt:
2508 // user might be running us from a shell,
2509 // and SCRIPT might be intended to terminate
2510 // (e.g. contain a "halt" stmt).
2511 // ^C dropping user into a bc prompt instead of
2512 // the shell would be unexpected.
2515 // ^C while interactive input
2517 // GNU bc says "interrupted execution."
2518 // GNU dc says "Interrupt!"
2519 fputs("\ninterrupted execution\n", stderr);
2522 # if ENABLE_FEATURE_EDITING
2523 if (G_ttyin && fp == stdin) {
2525 # define line_buf bb_common_bufsiz1
2526 n = read_line_input(G.line_input_state, "", line_buf, COMMON_BUFSIZE);
2527 if (n <= 0) { // read errors or EOF, or ^D, or ^C
2530 bc_vec_pushZeroByte(vec); // ^D or EOF (or error)
2535 char c = line_buf[i++];
2536 if (c == '\0') break;
2537 if (bad_input_byte(c)) goto again;
2539 bc_vec_string(vec, n, line_buf);
2550 #if ENABLE_FEATURE_BC_INTERACTIVE
2552 // ^C was pressed: ignore entire line, get another one
2561 bb_perror_msg_and_die("input error");
2562 // Note: EOF does not append '\n'
2565 bad_chars |= bad_input_byte(c);
2566 bc_vec_pushByte(vec, (char)c);
2567 } while (c != '\n');
2570 // Bad chars on this line
2571 if (!G.prs.lex_filename) { // stdin
2572 // ignore entire line, get another one
2575 bb_perror_msg_and_die("file '%s' is not text", G.prs.lex_filename);
2577 bc_vec_pushZeroByte(vec);
2585 // "Input numbers may contain the characters 0-9 and A-Z.
2586 // (Note: They must be capitals. Lower case letters are variable names.)
2587 // Single digit numbers always have the value of the digit regardless of
2588 // the value of ibase. (i.e. A = 10.) For multi-digit numbers, bc changes
2589 // all input digits greater or equal to ibase to the value of ibase-1.
2590 // This makes the number ZZZ always be the largest 3 digit number of the
2592 static bool xc_num_strValid(const char *val)
2600 if (radix) return false;
2604 if ((c < '0' || c > '9') && (c < 'A' || c > 'Z'))
2610 // Note: n is already "bc_num_zero()"ed,
2611 // leading zeroes in "val" are removed
2612 static void bc_num_parseDecimal(BcNum *n, const char *val)
2621 bc_num_expand(n, len + 1); // +1 for e.g. "A" converting into 10
2623 ptr = strchr(val, '.');
2627 n->rdx = (size_t)((val + len) - (ptr + 1));
2629 for (i = 0; val[i]; ++i) {
2630 if (val[i] != '0' && val[i] != '.') {
2631 // Not entirely zero value - convert it, and exit
2633 unsigned c = val[0] - '0';
2635 if (c > 9) { // A-Z => 10-36
2637 c -= ('A' - '9' - 1);
2646 char c = val[i] - '0';
2647 if (c > 9) // A-Z => 9
2653 if (val[--i] == '.') goto skip_dot;
2658 // if for() exits without hitting if(), the value is entirely zero
2661 // Note: n is already "bc_num_zero()"ed,
2662 // leading zeroes in "val" are removed
2663 static void bc_num_parseBase(BcNum *n, const char *val, unsigned base_t)
2669 BcDig temp_digs[ULONG_NUM_BUFSIZE];
2670 BcDig base_digs[ULONG_NUM_BUFSIZE];
2673 bc_num_init_DEF_SIZE(&mult);
2675 temp.cap = ARRAY_SIZE(temp_digs);
2676 temp.num = temp_digs;
2678 base.cap = ARRAY_SIZE(base_digs);
2679 base.num = base_digs;
2680 bc_num_ulong2num(&base, base_t);
2688 if (c == '\0') goto int_err;
2689 if (c == '.') break;
2691 v = (unsigned)(c <= '9' ? c - '0' : c - 'A' + 10);
2692 if (v > base_t) v = base_t;
2694 s = zbc_num_mul(n, &base, &mult, 0);
2695 if (s) goto int_err;
2696 bc_num_ulong2num(&temp, v);
2697 s = zbc_num_add(&mult, &temp, n, 0);
2698 if (s) goto int_err;
2701 bc_num_init(&result, base.len);
2702 //bc_num_zero(&result); - already is
2711 if (c == '\0') break;
2714 v = (unsigned)(c <= '9' ? c - '0' : c - 'A' + 10);
2715 if (v > base_t) v = base_t;
2717 s = zbc_num_mul(&result, &base, &result, 0);
2719 bc_num_ulong2num(&temp, v);
2720 s = zbc_num_add(&result, &temp, &result, 0);
2722 s = zbc_num_mul(&mult, &base, &mult, 0);
2726 s = zbc_num_div(&result, &mult, &result, digits);
2728 s = zbc_num_add(n, &result, n, digits);
2732 if (n->rdx < digits)
2733 bc_num_extend(n, digits - n->rdx);
2737 bc_num_free(&result);
2742 static BC_STATUS zxc_num_parse(BcNum *n, const char *val, unsigned base_t)
2746 if (!xc_num_strValid(val))
2747 RETURN_STATUS(bc_error("bad number string"));
2752 for (i = 0; ; ++i) {
2754 RETURN_STATUS(BC_STATUS_SUCCESS);
2755 if (val[i] != '.' && val[i] != '0')
2759 if (base_t == 10 || val[1] == '\0')
2760 // Decimal, or single-digit number
2761 bc_num_parseDecimal(n, val);
2763 bc_num_parseBase(n, val, base_t);
2765 RETURN_STATUS(BC_STATUS_SUCCESS);
2767 #define zxc_num_parse(...) (zxc_num_parse(__VA_ARGS__) COMMA_SUCCESS)
2769 // p->lex_inbuf points to the current string to be parsed.
2770 // if p->lex_inbuf points to '\0', it's either EOF or it points after
2771 // last processed line's terminating '\n' (and more reading needs to be done
2772 // to get next character).
2774 // If you are in a situation where that is a possibility, call peek_inbuf().
2775 // If necessary, it performs more reading and changes p->lex_inbuf,
2776 // then it returns *p->lex_inbuf (which will be '\0' only if it's EOF).
2777 // After it, just referencing *p->lex_inbuf is valid, and if it wasn't '\0',
2778 // it's ok to do p->lex_inbuf++ once without end-of-buffer checking.
2780 // eat_inbuf() is equvalent to "peek_inbuf(); if (c) p->lex_inbuf++":
2781 // it returns current char and advances the pointer (if not EOF).
2782 // After eat_inbuf(), referencing p->lex_inbuf[-1] and *p->lex_inbuf is valid.
2784 // In many cases, you can use fast *p->lex_inbuf instead of peek_inbuf():
2785 // unless prev char might have been '\n', *p->lex_inbuf is '\0' ONLY
2786 // on real EOF, not end-of-buffer.
2788 // bc cases to test interactively:
2789 // 1 #comment\ - prints "1<newline>" at once (comment is not continued)
2790 // 1 #comment/* - prints "1<newline>" at once
2791 // 1 #comment" - prints "1<newline>" at once
2792 // 1\#comment - error at once (\ is not a line continuation)
2793 // 1 + /*"*/2 - prints "3<newline>" at once
2794 // 1 + /*#*/2 - prints "3<newline>" at once
2795 // "str\" - prints "str\" at once
2796 // "str#" - prints "str#" at once
2797 // "str/*" - prints "str/*" at once
2798 // "str#\ - waits for second line
2799 // end" - ...prints "str#\<newline>end"
2800 static char peek_inbuf(void)
2802 if (*G.prs.lex_inbuf == '\0'
2803 && G.prs.lex_input_fp
2805 xc_read_line(&G.input_buffer, G.prs.lex_input_fp);
2806 G.prs.lex_inbuf = G.input_buffer.v;
2807 if (G.input_buffer.len <= 1) // on EOF, len is 1 (NUL byte)
2808 G.prs.lex_input_fp = NULL;
2810 return *G.prs.lex_inbuf;
2812 static char eat_inbuf(void)
2814 char c = peek_inbuf();
2815 if (c) G.prs.lex_inbuf++;
2819 static void xc_lex_lineComment(void)
2821 BcParse *p = &G.prs;
2824 // Try: echo -n '#foo' | bc
2825 p->lex = XC_LEX_WHITESPACE;
2827 // Not peek_inbuf(): we depend on input being done in whole lines:
2828 // '\0' which isn't the EOF can only be seen after '\n'.
2829 while ((c = *p->lex_inbuf) != '\n' && c != '\0')
2833 static void xc_lex_whitespace(void)
2835 BcParse *p = &G.prs;
2837 p->lex = XC_LEX_WHITESPACE;
2839 // We depend here on input being done in whole lines:
2840 // '\0' which isn't the EOF can only be seen after '\n'.
2841 char c = *p->lex_inbuf;
2842 if (c == '\n') // this is XC_LEX_NLINE, not XC_LEX_WHITESPACE
2850 static BC_STATUS zxc_lex_number(char last)
2852 BcParse *p = &G.prs;
2856 bc_vec_pop_all(&p->lex_strnumbuf);
2857 bc_vec_pushByte(&p->lex_strnumbuf, last);
2859 // bc: "Input numbers may contain the characters 0-9 and A-Z.
2860 // (Note: They must be capitals. Lower case letters are variable names.)
2861 // Single digit numbers always have the value of the digit regardless of
2862 // the value of ibase. (i.e. A = 10.) For multi-digit numbers, bc changes
2863 // all input digits greater or equal to ibase to the value of ibase-1.
2864 // This makes the number ZZZ always be the largest 3 digit number of the
2866 // dc only allows A-F, the rules about single-char and multi-char are the same.
2867 last_valid_ch = (IS_BC ? 'Z' : 'F');
2869 p->lex = XC_LEX_NUMBER;
2871 // We depend here on input being done in whole lines:
2872 // '\0' which isn't the EOF can only be seen after '\n'.
2873 char c = *p->lex_inbuf;
2877 if (c == '\\' && p->lex_inbuf[1] == '\n') {
2880 dbg_lex("++p->lex_line=%zd", p->lex_line);
2881 c = peek_inbuf(); // force next line to be read
2884 if (!isdigit(c) && (c < 'A' || c > last_valid_ch)) {
2885 if (c != '.') break;
2886 // if '.' was already seen, stop on second one:
2890 // c is one of "0-9A-Z."
2892 bc_vec_push(&p->lex_strnumbuf, p->lex_inbuf);
2895 if (last == '.') // remove trailing '.' if any
2896 bc_vec_pop(&p->lex_strnumbuf);
2897 bc_vec_pushZeroByte(&p->lex_strnumbuf);
2899 G.err_line = G.prs.lex_line;
2900 RETURN_STATUS(BC_STATUS_SUCCESS);
2902 #define zxc_lex_number(...) (zxc_lex_number(__VA_ARGS__) COMMA_SUCCESS)
2904 static void xc_lex_name(void)
2906 BcParse *p = &G.prs;
2910 p->lex = XC_LEX_NAME;
2912 // Since names can't cross lines with \<newline>,
2913 // we depend on the fact that whole line is in the buffer
2915 buf = p->lex_inbuf - 1;
2918 if ((c < 'a' || c > 'z') && !isdigit(c) && c != '_') break;
2922 #if 0 // We do not protect against people with gigabyte-long names
2923 // This check makes sense only if size_t is (much) larger than BC_MAX_STRING.
2924 if (SIZE_MAX > (BC_MAX_STRING | 0xff)) {
2925 if (i > BC_MAX_STRING)
2926 return bc_error("name too long: must be [1,"BC_MAX_STRING_STR"]");
2929 bc_vec_string(&p->lex_strnumbuf, i, buf);
2931 // Increment the index. We minus 1 because it has already been incremented.
2932 p->lex_inbuf += i - 1;
2934 //return BC_STATUS_SUCCESS;
2937 IF_BC(static BC_STATUS zbc_lex_token(void);)
2938 IF_DC(static BC_STATUS zdc_lex_token(void);)
2939 #define zbc_lex_token(...) (zbc_lex_token(__VA_ARGS__) COMMA_SUCCESS)
2940 #define zdc_lex_token(...) (zdc_lex_token(__VA_ARGS__) COMMA_SUCCESS)
2942 static BC_STATUS zxc_lex_next(void)
2944 BcParse *p = &G.prs;
2947 G.err_line = p->lex_line;
2948 p->lex_last = p->lex;
2950 // if (p->lex_last == XC_LEX_EOF)
2951 // RETURN_STATUS(bc_error("end of file"));
2953 // Loop until failure or we don't have whitespace. This
2954 // is so the parser doesn't get inundated with whitespace.
2955 // Comments are also XC_LEX_WHITESPACE tokens and eaten here.
2956 s = BC_STATUS_SUCCESS;
2958 if (*p->lex_inbuf == '\0') {
2959 p->lex = XC_LEX_EOF;
2960 if (peek_inbuf() == '\0')
2961 RETURN_STATUS(BC_STATUS_SUCCESS);
2963 p->lex_next_at = p->lex_inbuf;
2964 dbg_lex("next string to parse:'%.*s'",
2965 (int)(strchrnul(p->lex_next_at, '\n') - p->lex_next_at),
2969 IF_BC(s = zbc_lex_token());
2971 IF_DC(s = zdc_lex_token());
2973 } while (!s && p->lex == XC_LEX_WHITESPACE);
2974 dbg_lex("p->lex from string:%d", p->lex);
2978 #define zxc_lex_next(...) (zxc_lex_next(__VA_ARGS__) COMMA_SUCCESS)
2981 static BC_STATUS zbc_lex_skip_if_at_NLINE(void)
2983 if (G.prs.lex == XC_LEX_NLINE)
2984 RETURN_STATUS(zxc_lex_next());
2985 RETURN_STATUS(BC_STATUS_SUCCESS);
2987 #define zbc_lex_skip_if_at_NLINE(...) (zbc_lex_skip_if_at_NLINE(__VA_ARGS__) COMMA_SUCCESS)
2989 static BC_STATUS zbc_lex_next_and_skip_NLINE(void)
2993 if (s) RETURN_STATUS(s);
2994 // if(cond)<newline>stmt is accepted too (but not 2+ newlines)
2995 s = zbc_lex_skip_if_at_NLINE();
2998 #define zbc_lex_next_and_skip_NLINE(...) (zbc_lex_next_and_skip_NLINE(__VA_ARGS__) COMMA_SUCCESS)
3000 static BC_STATUS zbc_lex_identifier(void)
3002 BcParse *p = &G.prs;
3005 const char *buf = p->lex_inbuf - 1;
3007 for (i = 0; i < ARRAY_SIZE(bc_lex_kws); ++i) {
3008 const char *keyword8 = bc_lex_kws[i].name8;
3010 while (buf[j] != '\0' && buf[j] == keyword8[j]) {
3012 if (j == 8) goto match;
3014 if (keyword8[j] != '\0')
3017 // buf starts with keyword bc_lex_kws[i]
3018 if (isalnum(buf[j]) || buf[j]=='_')
3019 continue; // "ifz" does not match "if" keyword, "if." does
3020 p->lex = BC_LEX_KEY_1st_keyword + i;
3021 if (!keyword_is_POSIX(i)) {
3022 s = zbc_posix_error_fmt("%sthe '%.8s' keyword", "POSIX does not allow ", bc_lex_kws[i].name8);
3023 if (s) RETURN_STATUS(s);
3026 // We minus 1 because the index has already been incremented.
3027 p->lex_inbuf += j - 1;
3028 RETURN_STATUS(BC_STATUS_SUCCESS);
3032 s = BC_STATUS_SUCCESS;
3034 if (p->lex_strnumbuf.len > 2) {
3037 // bc: POSIX only allows one character names; this is bad: 'qwe=1
3039 unsigned len = strchrnul(buf, '\n') - buf;
3040 s = zbc_posix_error_fmt("POSIX only allows one character names; this is bad: '%.*s'", len, buf);
3045 #define zbc_lex_identifier(...) (zbc_lex_identifier(__VA_ARGS__) COMMA_SUCCESS)
3047 static BC_STATUS zbc_lex_string(void)
3049 BcParse *p = &G.prs;
3051 p->lex = XC_LEX_STR;
3052 bc_vec_pop_all(&p->lex_strnumbuf);
3054 char c = peek_inbuf(); // strings can cross lines
3056 RETURN_STATUS(bc_error("unterminated string"));
3062 dbg_lex("++p->lex_line=%zd", p->lex_line);
3064 bc_vec_push(&p->lex_strnumbuf, p->lex_inbuf);
3067 bc_vec_pushZeroByte(&p->lex_strnumbuf);
3070 G.err_line = p->lex_line;
3071 RETURN_STATUS(BC_STATUS_SUCCESS);
3073 #define zbc_lex_string(...) (zbc_lex_string(__VA_ARGS__) COMMA_SUCCESS)
3075 static void parse_lex_by_checking_eq_sign(unsigned with_and_without)
3077 BcParse *p = &G.prs;
3078 if (*p->lex_inbuf == '=') {
3079 // ^^^ not using peek_inbuf() since '==' etc can't be split across lines
3081 with_and_without >>= 8; // store "with" value
3082 } // else store "without" value
3083 p->lex = (with_and_without & 0xff);
3085 #define parse_lex_by_checking_eq_sign(with, without) \
3086 parse_lex_by_checking_eq_sign(((with)<<8)|(without))
3088 static BC_STATUS zbc_lex_comment(void)
3090 BcParse *p = &G.prs;
3092 p->lex = XC_LEX_WHITESPACE;
3093 // here lex_inbuf is at '*' of opening comment delimiter
3102 c = *p->lex_inbuf; // no need to peek_inbuf()
3108 RETURN_STATUS(bc_error("unterminated comment"));
3112 dbg_lex("++p->lex_line=%zd", p->lex_line);
3115 p->lex_inbuf++; // skip trailing '/'
3117 G.err_line = p->lex_line;
3118 RETURN_STATUS(BC_STATUS_SUCCESS);
3120 #define zbc_lex_comment(...) (zbc_lex_comment(__VA_ARGS__) COMMA_SUCCESS)
3122 #undef zbc_lex_token
3123 static BC_STATUS zbc_lex_token(void)
3125 BcParse *p = &G.prs;
3126 BcStatus s = BC_STATUS_SUCCESS;
3127 char c = eat_inbuf();
3130 // This is the workhorse of the lexer.
3132 // case '\0': // probably never reached
3134 // p->lex = XC_LEX_EOF;
3138 dbg_lex("++p->lex_line=%zd", p->lex_line);
3139 p->lex = XC_LEX_NLINE;
3146 xc_lex_whitespace();
3149 parse_lex_by_checking_eq_sign(XC_LEX_OP_REL_NE, BC_LEX_OP_BOOL_NOT);
3150 if (p->lex == BC_LEX_OP_BOOL_NOT) {
3151 s = zbc_POSIX_does_not_allow_bool_ops_this_is_bad("!");
3152 if (s) RETURN_STATUS(s);
3156 s = zbc_lex_string();
3159 s = zbc_POSIX_does_not_allow("'#' script comments");
3160 if (s) RETURN_STATUS(s);
3161 xc_lex_lineComment();
3164 parse_lex_by_checking_eq_sign(BC_LEX_OP_ASSIGN_MODULUS, XC_LEX_OP_MODULUS);
3169 s = zbc_POSIX_does_not_allow_bool_ops_this_is_bad("&&");
3170 if (s) RETURN_STATUS(s);
3172 p->lex = BC_LEX_OP_BOOL_AND;
3174 p->lex = XC_LEX_INVALID;
3175 s = bc_error_bad_character('&');
3180 p->lex = (BcLexType)(c - '(' + BC_LEX_LPAREN);
3183 parse_lex_by_checking_eq_sign(BC_LEX_OP_ASSIGN_MULTIPLY, XC_LEX_OP_MULTIPLY);
3189 p->lex = BC_LEX_OP_INC;
3191 parse_lex_by_checking_eq_sign(BC_LEX_OP_ASSIGN_PLUS, XC_LEX_OP_PLUS);
3194 p->lex = BC_LEX_COMMA;
3200 p->lex = BC_LEX_OP_DEC;
3202 parse_lex_by_checking_eq_sign(BC_LEX_OP_ASSIGN_MINUS, XC_LEX_OP_MINUS);
3205 if (isdigit(*p->lex_inbuf))
3206 s = zxc_lex_number(c);
3208 p->lex = BC_LEX_KEY_LAST;
3209 s = zbc_POSIX_does_not_allow("'.' as 'last'");
3215 s = zbc_lex_comment();
3217 parse_lex_by_checking_eq_sign(BC_LEX_OP_ASSIGN_DIVIDE, XC_LEX_OP_DIVIDE);
3255 s = zxc_lex_number(c);
3258 p->lex = BC_LEX_SCOLON;
3261 parse_lex_by_checking_eq_sign(XC_LEX_OP_REL_LE, XC_LEX_OP_REL_LT);
3264 parse_lex_by_checking_eq_sign(XC_LEX_OP_REL_EQ, BC_LEX_OP_ASSIGN);
3267 parse_lex_by_checking_eq_sign(XC_LEX_OP_REL_GE, XC_LEX_OP_REL_GT);
3271 p->lex = (BcLexType)(c - '[' + BC_LEX_LBRACKET);
3274 if (*p->lex_inbuf == '\n') {
3275 p->lex = XC_LEX_WHITESPACE;
3278 s = bc_error_bad_character(c);
3281 parse_lex_by_checking_eq_sign(BC_LEX_OP_ASSIGN_POWER, XC_LEX_OP_POWER);
3309 s = zbc_lex_identifier();
3313 p->lex = (BcLexType)(c - '{' + BC_LEX_LBRACE);
3318 s = zbc_POSIX_does_not_allow_bool_ops_this_is_bad("||");
3319 if (s) RETURN_STATUS(s);
3321 p->lex = BC_LEX_OP_BOOL_OR;
3323 p->lex = XC_LEX_INVALID;
3324 s = bc_error_bad_character(c);
3328 p->lex = XC_LEX_INVALID;
3329 s = bc_error_bad_character(c);
3335 #define zbc_lex_token(...) (zbc_lex_token(__VA_ARGS__) COMMA_SUCCESS)
3339 static BC_STATUS zdc_lex_register(void)
3341 BcParse *p = &G.prs;
3342 if (G_exreg && isspace(*p->lex_inbuf)) {
3343 xc_lex_whitespace(); // eats whitespace (but not newline)
3344 p->lex_inbuf++; // xc_lex_name() expects this
3347 bc_vec_pop_all(&p->lex_strnumbuf);
3348 bc_vec_push(&p->lex_strnumbuf, p->lex_inbuf++);
3349 bc_vec_pushZeroByte(&p->lex_strnumbuf);
3350 p->lex = XC_LEX_NAME;
3353 RETURN_STATUS(BC_STATUS_SUCCESS);
3355 #define zdc_lex_register(...) (zdc_lex_register(__VA_ARGS__) COMMA_SUCCESS)
3357 static BC_STATUS zdc_lex_string(void)
3359 BcParse *p = &G.prs;
3362 p->lex = XC_LEX_STR;
3363 bc_vec_pop_all(&p->lex_strnumbuf);
3367 char c = peek_inbuf();
3369 RETURN_STATUS(bc_error("unterminated string"));
3371 if (c == '[') depth++;
3377 dbg_lex("++p->lex_line=%zd", p->lex_line);
3379 bc_vec_push(&p->lex_strnumbuf, p->lex_inbuf);
3382 bc_vec_pushZeroByte(&p->lex_strnumbuf);
3383 p->lex_inbuf++; // skip trailing ']'
3385 G.err_line = p->lex_line;
3386 RETURN_STATUS(BC_STATUS_SUCCESS);
3388 #define zdc_lex_string(...) (zdc_lex_string(__VA_ARGS__) COMMA_SUCCESS)
3390 #undef zdc_lex_token
3391 static BC_STATUS zdc_lex_token(void)
3393 static const //BcLexType - should be this type, but narrower type saves size:
3395 dc_lex_regs[] ALIGN1 = {
3396 XC_LEX_OP_REL_EQ, XC_LEX_OP_REL_LE, XC_LEX_OP_REL_GE, XC_LEX_OP_REL_NE,
3397 XC_LEX_OP_REL_LT, XC_LEX_OP_REL_GT, DC_LEX_SCOLON, DC_LEX_COLON,
3398 DC_LEX_ELSE, DC_LEX_LOAD, DC_LEX_LOAD_POP, DC_LEX_OP_ASSIGN,
3402 BcParse *p = &G.prs;
3407 for (i = 0; i < ARRAY_SIZE(dc_lex_regs); ++i) {
3408 if (p->lex_last == dc_lex_regs[i])
3409 RETURN_STATUS(zdc_lex_register());
3412 s = BC_STATUS_SUCCESS;
3414 if (c >= '%' && c <= '~'
3415 && (p->lex = dc_char_to_LEX[c - '%']) != XC_LEX_INVALID
3420 // This is the workhorse of the lexer.
3422 // case '\0': // probably never reached
3423 // p->lex = XC_LEX_EOF;
3426 // '\n' is XC_LEX_NLINE, not XC_LEX_WHITESPACE
3427 // (and "case '\n':" is not just empty here)
3428 // only to allow interactive dc have a way to exit
3429 // "parse" stage of "parse,execute" loop
3430 // on <enter>, not on _next_ token (which would mean
3431 // commands are not executed on pressing <enter>).
3432 // IOW: typing "1p<enter>" should print "1" _at once_,
3433 // not after some more input.
3435 dbg_lex("++p->lex_line=%zd", p->lex_line);
3436 p->lex = XC_LEX_NLINE;
3443 xc_lex_whitespace();
3448 p->lex = XC_LEX_OP_REL_NE;
3450 p->lex = XC_LEX_OP_REL_LE;
3452 p->lex = XC_LEX_OP_REL_GE;
3454 RETURN_STATUS(bc_error_bad_character(c));
3458 xc_lex_lineComment();
3461 if (isdigit(*p->lex_inbuf))
3462 s = zxc_lex_number(c);
3464 s = bc_error_bad_character(c);
3482 s = zxc_lex_number(c);
3485 s = zdc_lex_string();
3488 p->lex = XC_LEX_INVALID;
3489 s = bc_error_bad_character(c);
3495 #define zdc_lex_token(...) (zdc_lex_token(__VA_ARGS__) COMMA_SUCCESS)
3498 static void xc_parse_push(char i)
3500 BcVec *code = &G.prs.func->code;
3501 dbg_compile("%s:%d pushing bytecode %zd:%d", __func__, __LINE__, code->len, i);
3502 bc_vec_pushByte(code, i);
3505 static void xc_parse_pushName(char *name)
3508 BcVec *code = &G.prs.func->code;
3509 size_t pos = code->len;
3510 size_t len = strlen(name) + 1;
3512 bc_vec_expand(code, pos + len);
3513 strcpy(code->v + pos, name);
3514 code->len = pos + len;
3516 // Smaller code, but way slow:
3518 xc_parse_push(*name);
3523 // Indexes < 0xfc are encoded verbatim, else first byte is
3524 // 0xfc, 0xfd, 0xfe or 0xff, encoding "1..4 bytes",
3525 // followed by that many bytes, lsb first.
3526 // (The above describes 32-bit case).
3527 #define SMALL_INDEX_LIMIT (0x100 - sizeof(size_t))
3529 static void xc_parse_pushIndex(size_t idx)
3534 dbg_lex("%s:%d pushing index %zd", __func__, __LINE__, idx);
3535 if (idx < SMALL_INDEX_LIMIT) {
3540 mask = ((size_t)0xff) << (sizeof(idx) * 8 - 8);
3543 if (idx & mask) break;
3547 // amt is at least 1 here - "one byte of length data follows"
3549 xc_parse_push((SMALL_INDEX_LIMIT - 1) + amt);
3552 xc_parse_push((unsigned char)idx);
3558 static void bc_parse_pushJUMP(size_t idx)
3560 xc_parse_push(BC_INST_JUMP);
3561 xc_parse_pushIndex(idx);
3564 static void bc_parse_pushJUMP_ZERO(size_t idx)
3566 xc_parse_push(BC_INST_JUMP_ZERO);
3567 xc_parse_pushIndex(idx);
3570 static BC_STATUS zbc_parse_pushSTR(void)
3572 BcParse *p = &G.prs;
3573 char *str = xstrdup(p->lex_strnumbuf.v);
3575 xc_parse_push(XC_INST_STR);
3576 xc_parse_pushIndex(p->func->strs.len);
3577 bc_vec_push(&p->func->strs, &str);
3579 RETURN_STATUS(zxc_lex_next());
3581 #define zbc_parse_pushSTR(...) (zbc_parse_pushSTR(__VA_ARGS__) COMMA_SUCCESS)
3584 static void xc_parse_pushNUM(void)
3586 BcParse *p = &G.prs;
3587 char *num = xstrdup(p->lex_strnumbuf.v);
3588 #if ENABLE_BC && ENABLE_DC
3589 size_t idx = bc_vec_push(IS_BC ? &p->func->consts : &G.prog.consts, &num);
3591 size_t idx = bc_vec_push(&p->func->consts, &num);
3593 size_t idx = bc_vec_push(&G.prog.consts, &num);
3595 xc_parse_push(XC_INST_NUM);
3596 xc_parse_pushIndex(idx);
3599 static BC_STATUS zxc_parse_text_init(const char *text)
3601 G.prs.func = xc_program_func(G.prs.fidx);
3602 G.prs.lex_inbuf = text;
3603 G.prs.lex = G.prs.lex_last = XC_LEX_INVALID;
3604 RETURN_STATUS(zxc_lex_next());
3606 #define zxc_parse_text_init(...) (zxc_parse_text_init(__VA_ARGS__) COMMA_SUCCESS)
3608 // Called when parsing or execution detects a failure,
3609 // resets execution structures.
3610 static void xc_program_reset(void)
3615 bc_vec_npop(&G.prog.exestack, G.prog.exestack.len - 1);
3616 bc_vec_pop_all(&G.prog.results);
3618 f = xc_program_func_BC_PROG_MAIN();
3619 ip = bc_vec_top(&G.prog.exestack);
3620 ip->inst_idx = f->code.len;
3623 // Called when parsing code detects a failure,
3624 // resets parsing structures.
3625 static void xc_parse_reset(void)
3627 BcParse *p = &G.prs;
3628 if (p->fidx != BC_PROG_MAIN) {
3629 bc_func_free(p->func);
3630 bc_func_init(p->func);
3632 p->fidx = BC_PROG_MAIN;
3633 p->func = xc_program_func_BC_PROG_MAIN();
3636 p->lex_inbuf += strlen(p->lex_inbuf);
3637 p->lex = XC_LEX_EOF;
3639 IF_BC(bc_vec_pop_all(&p->exits);)
3640 IF_BC(bc_vec_pop_all(&p->conds);)
3641 IF_BC(bc_vec_pop_all(&p->ops);)
3646 static void xc_parse_free(void)
3648 IF_BC(bc_vec_free(&G.prs.exits);)
3649 IF_BC(bc_vec_free(&G.prs.conds);)
3650 IF_BC(bc_vec_free(&G.prs.ops);)
3651 bc_vec_free(&G.prs.lex_strnumbuf);
3654 static void xc_parse_create(size_t fidx)
3656 BcParse *p = &G.prs;
3657 memset(p, 0, sizeof(BcParse));
3659 bc_char_vec_init(&p->lex_strnumbuf);
3660 IF_BC(bc_vec_init(&p->exits, sizeof(size_t), NULL);)
3661 IF_BC(bc_vec_init(&p->conds, sizeof(size_t), NULL);)
3662 IF_BC(bc_vec_init(&p->ops, sizeof(BcLexType), NULL);)
3665 p->func = xc_program_func(fidx);
3668 static void xc_program_add_fn(void)
3674 bc_vec_push(&G.prog.fns, &f);
3680 // Note: takes ownership of 'name' (must be malloced)
3681 static size_t bc_program_addFunc(char *name)
3684 BcId entry, *entry_ptr;
3688 entry.idx = G.prog.fns.len;
3690 inserted = bc_map_insert(&G.prog.fn_map, &entry, &idx);
3691 if (!inserted) free(name);
3693 entry_ptr = bc_vec_item(&G.prog.fn_map, idx);
3694 idx = entry_ptr->idx;
3697 // There is already a function with this name.
3698 // It'll be redefined now, clear old definition.
3699 BcFunc *func = xc_program_func(entry_ptr->idx);
3703 xc_program_add_fn();
3709 #define BC_PARSE_TOP_OP(p) (*(BcLexType*)bc_vec_top(&(p)->ops))
3710 // We can calculate the conversion between tokens and exprs by subtracting the
3711 // position of the first operator in the lex enum and adding the position of the
3712 // first in the expr enum. Note: This only works for binary operators.
3713 #define BC_TOKEN_2_INST(t) ((char) ((t) - XC_LEX_OP_POWER + XC_INST_POWER))
3715 static BcStatus bc_parse_expr_empty_ok(uint8_t flags);
3717 static BC_STATUS zbc_parse_expr(uint8_t flags)
3721 s = bc_parse_expr_empty_ok(flags);
3722 if (s == BC_STATUS_PARSE_EMPTY_EXP)
3723 RETURN_STATUS(bc_error("empty expression"));
3726 #define zbc_parse_expr(...) (zbc_parse_expr(__VA_ARGS__) COMMA_SUCCESS)
3728 static BC_STATUS zbc_parse_stmt_possibly_auto(bool auto_allowed);
3729 #define zbc_parse_stmt_possibly_auto(...) (zbc_parse_stmt_possibly_auto(__VA_ARGS__) COMMA_SUCCESS)
3731 static BC_STATUS zbc_parse_stmt(void)
3733 RETURN_STATUS(zbc_parse_stmt_possibly_auto(false));
3735 #define zbc_parse_stmt(...) (zbc_parse_stmt(__VA_ARGS__) COMMA_SUCCESS)
3737 static BC_STATUS zbc_parse_stmt_allow_NLINE_before(const char *after_X)
3739 BcParse *p = &G.prs;
3740 // "if(cond)<newline>stmt" is accepted too, but not 2+ newlines.
3741 // Same for "else", "while()", "for()".
3742 BcStatus s = zbc_lex_next_and_skip_NLINE();
3743 if (s) RETURN_STATUS(s);
3744 if (p->lex == XC_LEX_NLINE)
3745 RETURN_STATUS(bc_error_fmt("no statement after '%s'", after_X));
3747 RETURN_STATUS(zbc_parse_stmt());
3749 #define zbc_parse_stmt_allow_NLINE_before(...) (zbc_parse_stmt_allow_NLINE_before(__VA_ARGS__) COMMA_SUCCESS)
3751 static void bc_parse_operator(BcLexType type, size_t start, size_t *nexprs)
3753 BcParse *p = &G.prs;
3754 char l, r = bc_operation_PREC(type - XC_LEX_1st_op);
3755 bool left = bc_operation_LEFT(type - XC_LEX_1st_op);
3757 while (p->ops.len > start) {
3758 BcLexType t = BC_PARSE_TOP_OP(p);
3759 if (t == BC_LEX_LPAREN) break;
3761 l = bc_operation_PREC(t - XC_LEX_1st_op);
3762 if (l >= r && (l != r || !left)) break;
3764 xc_parse_push(BC_TOKEN_2_INST(t));
3765 bc_vec_pop(&p->ops);
3766 *nexprs -= (t != BC_LEX_OP_BOOL_NOT && t != XC_LEX_NEG);
3769 bc_vec_push(&p->ops, &type);
3772 static BC_STATUS zbc_parse_rightParen(size_t ops_bgn, size_t *nexs)
3774 BcParse *p = &G.prs;
3777 if (p->ops.len <= ops_bgn)
3778 RETURN_STATUS(bc_error_bad_expression());
3779 top = BC_PARSE_TOP_OP(p);
3781 while (top != BC_LEX_LPAREN) {
3782 xc_parse_push(BC_TOKEN_2_INST(top));
3784 bc_vec_pop(&p->ops);
3785 *nexs -= (top != BC_LEX_OP_BOOL_NOT && top != XC_LEX_NEG);
3787 if (p->ops.len <= ops_bgn)
3788 RETURN_STATUS(bc_error_bad_expression());
3789 top = BC_PARSE_TOP_OP(p);
3792 bc_vec_pop(&p->ops);
3794 RETURN_STATUS(BC_STATUS_SUCCESS);
3796 #define zbc_parse_rightParen(...) (zbc_parse_rightParen(__VA_ARGS__) COMMA_SUCCESS)
3798 static BC_STATUS zbc_parse_params(uint8_t flags)
3800 BcParse *p = &G.prs;
3804 dbg_lex("%s:%d p->lex:%d", __func__, __LINE__, p->lex);
3805 flags = (flags & ~(BC_PARSE_PRINT | BC_PARSE_REL)) | BC_PARSE_ARRAY;
3808 if (s) RETURN_STATUS(s);
3811 if (p->lex != BC_LEX_RPAREN) {
3813 s = zbc_parse_expr(flags);
3814 if (s) RETURN_STATUS(s);
3816 if (p->lex != BC_LEX_COMMA) {
3817 if (p->lex == BC_LEX_RPAREN)
3819 RETURN_STATUS(bc_error_bad_token());
3822 if (s) RETURN_STATUS(s);
3826 xc_parse_push(BC_INST_CALL);
3827 xc_parse_pushIndex(nparams);
3829 RETURN_STATUS(BC_STATUS_SUCCESS);
3831 #define zbc_parse_params(...) (zbc_parse_params(__VA_ARGS__) COMMA_SUCCESS)
3833 // Note: takes ownership of 'name' (must be malloced)
3834 static BC_STATUS zbc_parse_call(char *name, uint8_t flags)
3836 BcParse *p = &G.prs;
3838 BcId entry, *entry_ptr;
3843 s = zbc_parse_params(flags);
3846 if (p->lex != BC_LEX_RPAREN) {
3847 s = bc_error_bad_token();
3851 idx = bc_map_find_exact(&G.prog.fn_map, &entry);
3853 if (idx == BC_VEC_INVALID_IDX) {
3854 // No such function exists, create an empty one
3855 bc_program_addFunc(name);
3856 idx = bc_map_find_exact(&G.prog.fn_map, &entry);
3860 entry_ptr = bc_vec_item(&G.prog.fn_map, idx);
3861 xc_parse_pushIndex(entry_ptr->idx);
3863 RETURN_STATUS(zxc_lex_next());
3868 #define zbc_parse_call(...) (zbc_parse_call(__VA_ARGS__) COMMA_SUCCESS)
3870 static BC_STATUS zbc_parse_name(BcInst *type, uint8_t flags)
3872 BcParse *p = &G.prs;
3876 name = xstrdup(p->lex_strnumbuf.v);
3880 if (p->lex == BC_LEX_LBRACKET) {
3884 if (p->lex == BC_LEX_RBRACKET) {
3885 if (!(flags & BC_PARSE_ARRAY)) {
3886 s = bc_error_bad_expression();
3889 *type = XC_INST_ARRAY;
3891 *type = XC_INST_ARRAY_ELEM;
3892 flags &= ~(BC_PARSE_PRINT | BC_PARSE_REL);
3893 s = zbc_parse_expr(flags);
3898 xc_parse_push(*type);
3899 xc_parse_pushName(name);
3901 } else if (p->lex == BC_LEX_LPAREN) {
3902 if (flags & BC_PARSE_NOCALL) {
3903 s = bc_error_bad_token();
3906 *type = BC_INST_CALL;
3907 s = zbc_parse_call(name, flags);
3909 *type = XC_INST_VAR;
3910 xc_parse_push(XC_INST_VAR);
3911 xc_parse_pushName(name);
3920 #define zbc_parse_name(...) (zbc_parse_name(__VA_ARGS__) COMMA_SUCCESS)
3922 static BC_STATUS zbc_parse_read(void)
3924 BcParse *p = &G.prs;
3928 if (s) RETURN_STATUS(s);
3929 if (p->lex != BC_LEX_LPAREN) RETURN_STATUS(bc_error_bad_token());
3932 if (s) RETURN_STATUS(s);
3933 if (p->lex != BC_LEX_RPAREN) RETURN_STATUS(bc_error_bad_token());
3935 xc_parse_push(XC_INST_READ);
3939 #define zbc_parse_read(...) (zbc_parse_read(__VA_ARGS__) COMMA_SUCCESS)
3941 static BC_STATUS zbc_parse_builtin(BcLexType type, uint8_t flags, BcInst *prev)
3943 BcParse *p = &G.prs;
3947 if (s) RETURN_STATUS(s);
3948 if (p->lex != BC_LEX_LPAREN) RETURN_STATUS(bc_error_bad_token());
3950 flags = (flags & ~(BC_PARSE_PRINT | BC_PARSE_REL)) | BC_PARSE_ARRAY;
3953 if (s) RETURN_STATUS(s);
3955 s = zbc_parse_expr(flags);
3956 if (s) RETURN_STATUS(s);
3958 if (p->lex != BC_LEX_RPAREN) RETURN_STATUS(bc_error_bad_token());
3960 *prev = (type == BC_LEX_KEY_LENGTH) ? XC_INST_LENGTH : XC_INST_SQRT;
3961 xc_parse_push(*prev);
3965 #define zbc_parse_builtin(...) (zbc_parse_builtin(__VA_ARGS__) COMMA_SUCCESS)
3967 static BC_STATUS zbc_parse_scale(BcInst *type, uint8_t flags)
3969 BcParse *p = &G.prs;
3973 if (s) RETURN_STATUS(s);
3975 if (p->lex != BC_LEX_LPAREN) {
3976 *type = XC_INST_SCALE;
3977 xc_parse_push(XC_INST_SCALE);
3978 RETURN_STATUS(BC_STATUS_SUCCESS);
3981 *type = XC_INST_SCALE_FUNC;
3982 flags &= ~(BC_PARSE_PRINT | BC_PARSE_REL);
3985 if (s) RETURN_STATUS(s);
3987 s = zbc_parse_expr(flags);
3988 if (s) RETURN_STATUS(s);
3989 if (p->lex != BC_LEX_RPAREN)
3990 RETURN_STATUS(bc_error_bad_token());
3991 xc_parse_push(XC_INST_SCALE_FUNC);
3993 RETURN_STATUS(zxc_lex_next());
3995 #define zbc_parse_scale(...) (zbc_parse_scale(__VA_ARGS__) COMMA_SUCCESS)
3997 static BC_STATUS zbc_parse_incdec(BcInst *prev, size_t *nexs, uint8_t flags)
3999 BcParse *p = &G.prs;
4003 BcInst etype = *prev;
4005 if (etype == XC_INST_VAR || etype == XC_INST_ARRAY_ELEM
4006 || etype == XC_INST_SCALE || etype == BC_INST_LAST
4007 || etype == XC_INST_IBASE || etype == XC_INST_OBASE
4009 *prev = inst = BC_INST_INC_POST + (p->lex != BC_LEX_OP_INC);
4010 xc_parse_push(inst);
4013 *prev = inst = BC_INST_INC_PRE + (p->lex != BC_LEX_OP_INC);
4016 if (s) RETURN_STATUS(s);
4019 // Because we parse the next part of the expression
4020 // right here, we need to increment this.
4025 s = zbc_parse_name(prev, flags | BC_PARSE_NOCALL);
4027 case BC_LEX_KEY_IBASE:
4028 case BC_LEX_KEY_LAST:
4029 case BC_LEX_KEY_OBASE:
4030 xc_parse_push(type - BC_LEX_KEY_IBASE + XC_INST_IBASE);
4033 case BC_LEX_KEY_SCALE:
4035 if (s) RETURN_STATUS(s);
4036 if (p->lex == BC_LEX_LPAREN)
4037 s = bc_error_bad_token();
4039 xc_parse_push(XC_INST_SCALE);
4042 s = bc_error_bad_token();
4046 if (!s) xc_parse_push(inst);
4051 #define zbc_parse_incdec(...) (zbc_parse_incdec(__VA_ARGS__) COMMA_SUCCESS)
4053 static int bc_parse_inst_isLeaf(BcInst p)
4055 return (p >= XC_INST_NUM && p <= XC_INST_SQRT)
4056 || p == BC_INST_INC_POST
4057 || p == BC_INST_DEC_POST
4060 #define BC_PARSE_LEAF(prev, bin_last, rparen) \
4061 (!(bin_last) && ((rparen) || bc_parse_inst_isLeaf(prev)))
4063 static BC_STATUS zbc_parse_minus(BcInst *prev, size_t ops_bgn,
4064 bool rparen, bool bin_last, size_t *nexprs)
4066 BcParse *p = &G.prs;
4071 if (s) RETURN_STATUS(s);
4073 type = BC_PARSE_LEAF(*prev, bin_last, rparen) ? XC_LEX_OP_MINUS : XC_LEX_NEG;
4074 *prev = BC_TOKEN_2_INST(type);
4076 // We can just push onto the op stack because this is the largest
4077 // precedence operator that gets pushed. Inc/dec does not.
4078 if (type != XC_LEX_OP_MINUS)
4079 bc_vec_push(&p->ops, &type);
4081 bc_parse_operator(type, ops_bgn, nexprs);
4085 #define zbc_parse_minus(...) (zbc_parse_minus(__VA_ARGS__) COMMA_SUCCESS)
4087 static BC_STATUS zbc_parse_print(void)
4089 BcParse *p = &G.prs;
4095 if (s) RETURN_STATUS(s);
4097 if (type == XC_LEX_STR) {
4098 s = zbc_parse_pushSTR();
4100 s = zbc_parse_expr(0);
4102 if (s) RETURN_STATUS(s);
4103 xc_parse_push(XC_INST_PRINT_POP);
4104 if (p->lex != BC_LEX_COMMA)
4110 #define zbc_parse_print(...) (zbc_parse_print(__VA_ARGS__) COMMA_SUCCESS)
4112 static BC_STATUS zbc_parse_return(void)
4114 BcParse *p = &G.prs;
4118 dbg_lex_enter("%s:%d entered", __func__, __LINE__);
4120 if (s) RETURN_STATUS(s);
4123 if (t == XC_LEX_NLINE || t == BC_LEX_SCOLON || t == BC_LEX_RBRACE)
4124 xc_parse_push(BC_INST_RET0);
4126 s = zbc_parse_expr(0);
4127 if (s) RETURN_STATUS(s);
4129 if (t != BC_LEX_LPAREN // "return EXPR", no ()
4130 || p->lex_last != BC_LEX_RPAREN // example: "return (a) + b"
4132 s = zbc_POSIX_requires("parentheses around return expressions");
4133 if (s) RETURN_STATUS(s);
4136 xc_parse_push(XC_INST_RET);
4139 dbg_lex_done("%s:%d done", __func__, __LINE__);
4142 #define zbc_parse_return(...) (zbc_parse_return(__VA_ARGS__) COMMA_SUCCESS)
4144 static void rewrite_label_to_current(size_t idx)
4146 BcParse *p = &G.prs;
4147 size_t *label = bc_vec_item(&p->func->labels, idx);
4148 *label = p->func->code.len;
4151 static BC_STATUS zbc_parse_if(void)
4153 BcParse *p = &G.prs;
4157 dbg_lex_enter("%s:%d entered", __func__, __LINE__);
4159 if (s) RETURN_STATUS(s);
4160 if (p->lex != BC_LEX_LPAREN) RETURN_STATUS(bc_error_bad_token());
4163 if (s) RETURN_STATUS(s);
4164 s = zbc_parse_expr(BC_PARSE_REL);
4165 if (s) RETURN_STATUS(s);
4166 if (p->lex != BC_LEX_RPAREN) RETURN_STATUS(bc_error_bad_token());
4168 // Encode "if zero, jump to ..."
4169 // Pushed value (destination of the jump) is uninitialized,
4170 // will be rewritten to be address of "end of if()" or of "else".
4171 ip_idx = bc_vec_push(&p->func->labels, &ip_idx);
4172 bc_parse_pushJUMP_ZERO(ip_idx);
4174 s = zbc_parse_stmt_allow_NLINE_before(STRING_if);
4175 if (s) RETURN_STATUS(s);
4177 dbg_lex("%s:%d in if after stmt: p->lex:%d", __func__, __LINE__, p->lex);
4178 if (p->lex == BC_LEX_KEY_ELSE) {
4181 // Encode "after then_stmt, jump to end of if()"
4182 ip2_idx = bc_vec_push(&p->func->labels, &ip2_idx);
4183 dbg_lex("%s:%d after if() then_stmt: BC_INST_JUMP to %zd", __func__, __LINE__, ip2_idx);
4184 bc_parse_pushJUMP(ip2_idx);
4186 dbg_lex("%s:%d rewriting 'if_zero' label to jump to 'else'-> %zd", __func__, __LINE__, p->func->code.len);
4187 rewrite_label_to_current(ip_idx);
4191 s = zbc_parse_stmt_allow_NLINE_before(STRING_else);
4192 if (s) RETURN_STATUS(s);
4195 dbg_lex("%s:%d rewriting label to jump after 'if' body-> %zd", __func__, __LINE__, p->func->code.len);
4196 rewrite_label_to_current(ip_idx);
4198 dbg_lex_done("%s:%d done", __func__, __LINE__);
4201 #define zbc_parse_if(...) (zbc_parse_if(__VA_ARGS__) COMMA_SUCCESS)
4203 static BC_STATUS zbc_parse_while(void)
4205 BcParse *p = &G.prs;
4211 if (s) RETURN_STATUS(s);
4212 if (p->lex != BC_LEX_LPAREN) RETURN_STATUS(bc_error_bad_token());
4214 if (s) RETURN_STATUS(s);
4216 cond_idx = bc_vec_push(&p->func->labels, &p->func->code.len);
4217 ip_idx = cond_idx + 1;
4218 bc_vec_push(&p->conds, &cond_idx);
4220 bc_vec_push(&p->exits, &ip_idx);
4221 bc_vec_push(&p->func->labels, &ip_idx);
4223 s = zbc_parse_expr(BC_PARSE_REL);
4224 if (s) RETURN_STATUS(s);
4225 if (p->lex != BC_LEX_RPAREN) RETURN_STATUS(bc_error_bad_token());
4227 bc_parse_pushJUMP_ZERO(ip_idx);
4229 s = zbc_parse_stmt_allow_NLINE_before(STRING_while);
4230 if (s) RETURN_STATUS(s);
4232 dbg_lex("%s:%d BC_INST_JUMP to %zd", __func__, __LINE__, cond_idx);
4233 bc_parse_pushJUMP(cond_idx);
4235 dbg_lex("%s:%d rewriting label-> %zd", __func__, __LINE__, p->func->code.len);
4236 rewrite_label_to_current(ip_idx);
4238 bc_vec_pop(&p->exits);
4239 bc_vec_pop(&p->conds);
4243 #define zbc_parse_while(...) (zbc_parse_while(__VA_ARGS__) COMMA_SUCCESS)
4245 static BC_STATUS zbc_parse_for(void)
4247 BcParse *p = &G.prs;
4249 size_t cond_idx, exit_idx, body_idx, update_idx;
4251 dbg_lex("%s:%d p->lex:%d", __func__, __LINE__, p->lex);
4253 if (s) RETURN_STATUS(s);
4254 if (p->lex != BC_LEX_LPAREN) RETURN_STATUS(bc_error_bad_token());
4256 if (s) RETURN_STATUS(s);
4258 if (p->lex != BC_LEX_SCOLON) {
4259 s = zbc_parse_expr(0);
4260 xc_parse_push(XC_INST_POP);
4261 if (s) RETURN_STATUS(s);
4263 s = zbc_POSIX_does_not_allow_empty_X_expression_in_for("init");
4264 if (s) RETURN_STATUS(s);
4267 if (p->lex != BC_LEX_SCOLON) RETURN_STATUS(bc_error_bad_token());
4269 if (s) RETURN_STATUS(s);
4271 cond_idx = bc_vec_push(&p->func->labels, &p->func->code.len);
4272 update_idx = cond_idx + 1;
4273 body_idx = update_idx + 1;
4274 exit_idx = body_idx + 1;
4276 if (p->lex != BC_LEX_SCOLON)
4277 s = zbc_parse_expr(BC_PARSE_REL);
4279 // Set this for the next call to xc_parse_pushNUM().
4280 // This is safe to set because the current token is a semicolon,
4281 // which has no string requirement.
4282 bc_vec_string(&p->lex_strnumbuf, 1, "1");
4284 s = zbc_POSIX_does_not_allow_empty_X_expression_in_for("condition");
4286 if (s) RETURN_STATUS(s);
4288 if (p->lex != BC_LEX_SCOLON) RETURN_STATUS(bc_error_bad_token());
4291 if (s) RETURN_STATUS(s);
4293 bc_parse_pushJUMP_ZERO(exit_idx);
4294 bc_parse_pushJUMP(body_idx);
4296 bc_vec_push(&p->conds, &update_idx);
4297 bc_vec_push(&p->func->labels, &p->func->code.len);
4299 if (p->lex != BC_LEX_RPAREN) {
4300 s = zbc_parse_expr(0);
4301 if (s) RETURN_STATUS(s);
4302 if (p->lex != BC_LEX_RPAREN) RETURN_STATUS(bc_error_bad_token());
4303 xc_parse_push(XC_INST_POP);
4305 s = zbc_POSIX_does_not_allow_empty_X_expression_in_for("update");
4306 if (s) RETURN_STATUS(s);
4309 bc_parse_pushJUMP(cond_idx);
4310 bc_vec_push(&p->func->labels, &p->func->code.len);
4312 bc_vec_push(&p->exits, &exit_idx);
4313 bc_vec_push(&p->func->labels, &exit_idx);
4315 s = zbc_parse_stmt_allow_NLINE_before(STRING_for);
4316 if (s) RETURN_STATUS(s);
4318 dbg_lex("%s:%d BC_INST_JUMP to %zd", __func__, __LINE__, update_idx);
4319 bc_parse_pushJUMP(update_idx);
4321 dbg_lex("%s:%d rewriting label-> %zd", __func__, __LINE__, p->func->code.len);
4322 rewrite_label_to_current(exit_idx);
4324 bc_vec_pop(&p->exits);
4325 bc_vec_pop(&p->conds);
4327 RETURN_STATUS(BC_STATUS_SUCCESS);
4329 #define zbc_parse_for(...) (zbc_parse_for(__VA_ARGS__) COMMA_SUCCESS)
4331 static BC_STATUS zbc_parse_break_or_continue(BcLexType type)
4333 BcParse *p = &G.prs;
4336 if (type == BC_LEX_KEY_BREAK) {
4337 if (p->exits.len == 0) // none of the enclosing blocks is a loop
4338 RETURN_STATUS(bc_error_bad_token());
4339 i = *(size_t*)bc_vec_top(&p->exits);
4341 i = *(size_t*)bc_vec_top(&p->conds);
4343 bc_parse_pushJUMP(i);
4345 RETURN_STATUS(zxc_lex_next());
4347 #define zbc_parse_break_or_continue(...) (zbc_parse_break_or_continue(__VA_ARGS__) COMMA_SUCCESS)
4349 static BC_STATUS zbc_func_insert(BcFunc *f, char *name, bool var)
4355 autoid = (void*)f->autos.v;
4356 for (i = 0; i < f->autos.len; i++, autoid++) {
4357 if (strcmp(name, autoid->name) == 0
4358 && var == autoid->idx
4360 RETURN_STATUS(bc_error("duplicate function parameter or auto name"));
4367 bc_vec_push(&f->autos, &a);
4369 RETURN_STATUS(BC_STATUS_SUCCESS);
4371 #define zbc_func_insert(...) (zbc_func_insert(__VA_ARGS__) COMMA_SUCCESS)
4373 static BC_STATUS zbc_parse_funcdef(void)
4375 BcParse *p = &G.prs;
4377 bool var, comma = false;
4380 dbg_lex_enter("%s:%d entered", __func__, __LINE__);
4382 if (s) RETURN_STATUS(s);
4383 if (p->lex != XC_LEX_NAME)
4384 RETURN_STATUS(bc_error_bad_function_definition());
4386 name = xstrdup(p->lex_strnumbuf.v);
4387 p->fidx = bc_program_addFunc(name);
4388 p->func = xc_program_func(p->fidx);
4391 if (s) RETURN_STATUS(s);
4392 if (p->lex != BC_LEX_LPAREN)
4393 RETURN_STATUS(bc_error_bad_function_definition());
4395 if (s) RETURN_STATUS(s);
4397 while (p->lex != BC_LEX_RPAREN) {
4398 if (p->lex != XC_LEX_NAME)
4399 RETURN_STATUS(bc_error_bad_function_definition());
4403 name = xstrdup(p->lex_strnumbuf.v);
4407 var = p->lex != BC_LEX_LBRACKET;
4413 if (p->lex != BC_LEX_RBRACKET) {
4414 s = bc_error_bad_function_definition();
4422 comma = p->lex == BC_LEX_COMMA;
4428 s = zbc_func_insert(p->func, name, var);
4432 if (comma) RETURN_STATUS(bc_error_bad_function_definition());
4435 if (s) RETURN_STATUS(s);
4437 if (p->lex != BC_LEX_LBRACE) {
4438 s = zbc_POSIX_requires("the left brace be on the same line as the function header");
4439 if (s) RETURN_STATUS(s);
4442 // Prevent "define z()<newline>" from being interpreted as function with empty stmt as body
4443 s = zbc_lex_skip_if_at_NLINE();
4444 if (s) RETURN_STATUS(s);
4445 //GNU bc requires a {} block even if function body has single stmt, enforce this?
4446 if (p->lex != BC_LEX_LBRACE)
4447 RETURN_STATUS(bc_error("function { body } expected"));
4449 p->in_funcdef++; // to determine whether "return" stmt is allowed, and such
4450 s = zbc_parse_stmt_possibly_auto(true);
4452 if (s) RETURN_STATUS(s);
4454 xc_parse_push(BC_INST_RET0);
4456 // Subsequent code generation is into main program
4457 p->fidx = BC_PROG_MAIN;
4458 p->func = xc_program_func_BC_PROG_MAIN();
4460 dbg_lex_done("%s:%d done", __func__, __LINE__);
4463 dbg_lex_done("%s:%d done (error)", __func__, __LINE__);
4467 #define zbc_parse_funcdef(...) (zbc_parse_funcdef(__VA_ARGS__) COMMA_SUCCESS)
4469 static BC_STATUS zbc_parse_auto(void)
4471 BcParse *p = &G.prs;
4475 dbg_lex_enter("%s:%d entered", __func__, __LINE__);
4477 if (s) RETURN_STATUS(s);
4482 if (p->lex != XC_LEX_NAME)
4483 RETURN_STATUS(bc_error_at("bad 'auto' syntax"));
4485 name = xstrdup(p->lex_strnumbuf.v);
4489 var = (p->lex != BC_LEX_LBRACKET);
4494 if (p->lex != BC_LEX_RBRACKET) {
4495 s = bc_error_at("bad 'auto' syntax");
4502 s = zbc_func_insert(p->func, name, var);
4505 if (p->lex == XC_LEX_NLINE
4506 || p->lex == BC_LEX_SCOLON
4507 //|| p->lex == BC_LEX_RBRACE // allow "define f() {auto a}"
4511 if (p->lex != BC_LEX_COMMA)
4512 RETURN_STATUS(bc_error_at("bad 'auto' syntax"));
4513 s = zxc_lex_next(); // skip comma
4514 if (s) RETURN_STATUS(s);
4517 dbg_lex_done("%s:%d done", __func__, __LINE__);
4518 RETURN_STATUS(BC_STATUS_SUCCESS);
4521 dbg_lex_done("%s:%d done (ERROR)", __func__, __LINE__);
4524 #define zbc_parse_auto(...) (zbc_parse_auto(__VA_ARGS__) COMMA_SUCCESS)
4526 #undef zbc_parse_stmt_possibly_auto
4527 static BC_STATUS zbc_parse_stmt_possibly_auto(bool auto_allowed)
4529 BcParse *p = &G.prs;
4530 BcStatus s = BC_STATUS_SUCCESS;
4532 dbg_lex_enter("%s:%d entered, p->lex:%d", __func__, __LINE__, p->lex);
4534 if (p->lex == XC_LEX_NLINE) {
4535 dbg_lex_done("%s:%d done (seen XC_LEX_NLINE)", __func__, __LINE__);
4536 RETURN_STATUS(zxc_lex_next());
4538 if (p->lex == BC_LEX_SCOLON) {
4539 dbg_lex_done("%s:%d done (seen BC_LEX_SCOLON)", __func__, __LINE__);
4540 RETURN_STATUS(zxc_lex_next());
4543 if (p->lex == BC_LEX_LBRACE) {
4544 dbg_lex("%s:%d BC_LEX_LBRACE: (auto_allowed:%d)", __func__, __LINE__, auto_allowed);
4547 if (s) RETURN_STATUS(s);
4548 } while (p->lex == XC_LEX_NLINE);
4549 if (auto_allowed && p->lex == BC_LEX_KEY_AUTO) {
4550 dbg_lex("%s:%d calling zbc_parse_auto()", __func__, __LINE__);
4551 s = zbc_parse_auto();
4552 if (s) RETURN_STATUS(s);
4554 while (p->lex != BC_LEX_RBRACE) {
4555 dbg_lex("%s:%d block parsing loop", __func__, __LINE__);
4556 s = zbc_parse_stmt();
4557 if (s) RETURN_STATUS(s);
4560 dbg_lex_done("%s:%d done (seen BC_LEX_RBRACE)", __func__, __LINE__);
4564 dbg_lex("%s:%d p->lex:%d", __func__, __LINE__, p->lex);
4566 case XC_LEX_OP_MINUS:
4569 case BC_LEX_OP_BOOL_NOT:
4573 case BC_LEX_KEY_IBASE:
4574 case BC_LEX_KEY_LAST:
4575 case BC_LEX_KEY_LENGTH:
4576 case BC_LEX_KEY_OBASE:
4577 case BC_LEX_KEY_READ:
4578 case BC_LEX_KEY_SCALE:
4579 case BC_LEX_KEY_SQRT:
4580 s = zbc_parse_expr(BC_PARSE_PRINT);
4583 s = zbc_parse_pushSTR();
4584 xc_parse_push(XC_INST_PRINT_STR);
4586 case BC_LEX_KEY_BREAK:
4587 case BC_LEX_KEY_CONTINUE:
4588 s = zbc_parse_break_or_continue(p->lex);
4590 case BC_LEX_KEY_FOR:
4591 s = zbc_parse_for();
4593 case BC_LEX_KEY_HALT:
4594 xc_parse_push(BC_INST_HALT);
4600 case BC_LEX_KEY_LIMITS:
4601 // "limits" is a compile-time command,
4602 // the output is produced at _parse time_.
4604 "BC_BASE_MAX = "BC_MAX_OBASE_STR "\n"
4605 "BC_DIM_MAX = "BC_MAX_DIM_STR "\n"
4606 "BC_SCALE_MAX = "BC_MAX_SCALE_STR "\n"
4607 "BC_STRING_MAX = "BC_MAX_STRING_STR"\n"
4608 "BC_NAME_MAX = "BC_MAX_NAME_STR "\n"
4609 "BC_NUM_MAX = "BC_MAX_NUM_STR "\n"
4610 "MAX Exponent = "BC_MAX_EXP_STR "\n"
4611 "Number of vars = "BC_MAX_VARS_STR "\n"
4615 case BC_LEX_KEY_PRINT:
4616 s = zbc_parse_print();
4618 case BC_LEX_KEY_QUIT:
4619 // "quit" is a compile-time command. For example,
4620 // "if (0 == 1) quit" terminates when parsing the statement,
4621 // not when it is executed
4622 QUIT_OR_RETURN_TO_MAIN;
4623 case BC_LEX_KEY_RETURN:
4625 RETURN_STATUS(bc_error("'return' not in a function"));
4626 s = zbc_parse_return();
4628 case BC_LEX_KEY_WHILE:
4629 s = zbc_parse_while();
4632 s = bc_error_bad_token();
4636 dbg_lex_done("%s:%d done", __func__, __LINE__);
4639 #define zbc_parse_stmt_possibly_auto(...) (zbc_parse_stmt_possibly_auto(__VA_ARGS__) COMMA_SUCCESS)
4641 static BC_STATUS zbc_parse_stmt_or_funcdef(void)
4643 BcParse *p = &G.prs;
4646 dbg_lex_enter("%s:%d entered", __func__, __LINE__);
4647 if (p->lex == XC_LEX_EOF)
4648 s = bc_error("end of file");
4649 else if (p->lex == BC_LEX_KEY_DEFINE) {
4650 dbg_lex("%s:%d p->lex:BC_LEX_KEY_DEFINE", __func__, __LINE__);
4651 s = zbc_parse_funcdef();
4653 dbg_lex("%s:%d p->lex:%d (not BC_LEX_KEY_DEFINE)", __func__, __LINE__, p->lex);
4654 s = zbc_parse_stmt();
4657 dbg_lex_done("%s:%d done", __func__, __LINE__);
4660 #define zbc_parse_stmt_or_funcdef(...) (zbc_parse_stmt_or_funcdef(__VA_ARGS__) COMMA_SUCCESS)
4662 // This is not a "z" function: can also return BC_STATUS_PARSE_EMPTY_EXP
4663 static BcStatus bc_parse_expr_empty_ok(uint8_t flags)
4665 BcParse *p = &G.prs;
4666 BcInst prev = XC_INST_PRINT;
4667 size_t nexprs = 0, ops_bgn = p->ops.len;
4668 unsigned nparens, nrelops;
4669 bool paren_first, rprn, assign, bin_last, incdec;
4671 dbg_lex_enter("%s:%d entered", __func__, __LINE__);
4672 paren_first = (p->lex == BC_LEX_LPAREN);
4673 nparens = nrelops = 0;
4674 rprn = assign = incdec = false;
4680 BcLexType t = p->lex;
4682 if (!lex_allowed_in_bc_expr(t))
4685 dbg_lex("%s:%d t:%d", __func__, __LINE__, t);
4687 s = BC_STATUS_SUCCESS;
4691 dbg_lex("%s:%d LEX_OP_INC/DEC", __func__, __LINE__);
4692 if (incdec) return bc_error_bad_assignment();
4693 s = zbc_parse_incdec(&prev, &nexprs, flags);
4695 rprn = bin_last = false;
4696 //get_token = false; - already is
4698 case XC_LEX_OP_MINUS:
4699 dbg_lex("%s:%d LEX_OP_MINUS", __func__, __LINE__);
4700 s = zbc_parse_minus(&prev, ops_bgn, rprn, bin_last, &nexprs);
4702 //get_token = false; - already is
4703 bin_last = (prev == XC_INST_MINUS);
4704 if (bin_last) incdec = false;
4706 case BC_LEX_OP_ASSIGN_POWER:
4707 case BC_LEX_OP_ASSIGN_MULTIPLY:
4708 case BC_LEX_OP_ASSIGN_DIVIDE:
4709 case BC_LEX_OP_ASSIGN_MODULUS:
4710 case BC_LEX_OP_ASSIGN_PLUS:
4711 case BC_LEX_OP_ASSIGN_MINUS:
4712 case BC_LEX_OP_ASSIGN:
4713 dbg_lex("%s:%d LEX_ASSIGNxyz", __func__, __LINE__);
4714 if (prev != XC_INST_VAR && prev != XC_INST_ARRAY_ELEM
4715 && prev != XC_INST_SCALE && prev != XC_INST_IBASE
4716 && prev != XC_INST_OBASE && prev != BC_INST_LAST
4718 return bc_error_bad_assignment();
4721 case XC_LEX_OP_POWER:
4722 case XC_LEX_OP_MULTIPLY:
4723 case XC_LEX_OP_DIVIDE:
4724 case XC_LEX_OP_MODULUS:
4725 case XC_LEX_OP_PLUS:
4726 case XC_LEX_OP_REL_EQ:
4727 case XC_LEX_OP_REL_LE:
4728 case XC_LEX_OP_REL_GE:
4729 case XC_LEX_OP_REL_NE:
4730 case XC_LEX_OP_REL_LT:
4731 case XC_LEX_OP_REL_GT:
4732 case BC_LEX_OP_BOOL_NOT:
4733 case BC_LEX_OP_BOOL_OR:
4734 case BC_LEX_OP_BOOL_AND:
4735 dbg_lex("%s:%d LEX_OP_xyz", __func__, __LINE__);
4736 if (t == BC_LEX_OP_BOOL_NOT) {
4737 if (!bin_last && p->lex_last != BC_LEX_OP_BOOL_NOT)
4738 return bc_error_bad_expression();
4739 } else if (prev == XC_INST_BOOL_NOT) {
4740 return bc_error_bad_expression();
4743 nrelops += (t >= XC_LEX_OP_REL_EQ && t <= XC_LEX_OP_REL_GT);
4744 prev = BC_TOKEN_2_INST(t);
4745 bc_parse_operator(t, ops_bgn, &nexprs);
4746 rprn = incdec = false;
4748 bin_last = (t != BC_LEX_OP_BOOL_NOT);
4751 dbg_lex("%s:%d LEX_LPAREN", __func__, __LINE__);
4752 if (BC_PARSE_LEAF(prev, bin_last, rprn))
4753 return bc_error_bad_expression();
4754 bc_vec_push(&p->ops, &t);
4757 rprn = incdec = false;
4760 dbg_lex("%s:%d LEX_RPAREN", __func__, __LINE__);
4761 if (p->lex_last == BC_LEX_LPAREN) {
4762 dbg_lex_done("%s:%d done (returning EMPTY_EXP)", __func__, __LINE__);
4763 return BC_STATUS_PARSE_EMPTY_EXP;
4765 if (bin_last || prev == XC_INST_BOOL_NOT)
4766 return bc_error_bad_expression();
4770 s = zbc_parse_rightParen(ops_bgn, &nexprs);
4774 bin_last = incdec = false;
4777 dbg_lex("%s:%d LEX_NAME", __func__, __LINE__);
4778 if (BC_PARSE_LEAF(prev, bin_last, rprn))
4779 return bc_error_bad_expression();
4780 s = zbc_parse_name(&prev, flags & ~BC_PARSE_NOCALL);
4781 rprn = (prev == BC_INST_CALL);
4783 //get_token = false; - already is
4787 dbg_lex("%s:%d LEX_NUMBER", __func__, __LINE__);
4788 if (BC_PARSE_LEAF(prev, bin_last, rprn))
4789 return bc_error_bad_expression();
4793 rprn = bin_last = false;
4796 case BC_LEX_KEY_IBASE:
4797 case BC_LEX_KEY_LAST:
4798 case BC_LEX_KEY_OBASE:
4799 dbg_lex("%s:%d LEX_IBASE/LAST/OBASE", __func__, __LINE__);
4800 if (BC_PARSE_LEAF(prev, bin_last, rprn))
4801 return bc_error_bad_expression();
4802 prev = (char) (t - BC_LEX_KEY_IBASE + XC_INST_IBASE);
4803 xc_parse_push((char) prev);
4805 rprn = bin_last = false;
4808 case BC_LEX_KEY_LENGTH:
4809 case BC_LEX_KEY_SQRT:
4810 dbg_lex("%s:%d LEX_LEN/SQRT", __func__, __LINE__);
4811 if (BC_PARSE_LEAF(prev, bin_last, rprn))
4812 return bc_error_bad_expression();
4813 s = zbc_parse_builtin(t, flags, &prev);
4815 rprn = bin_last = incdec = false;
4818 case BC_LEX_KEY_READ:
4819 dbg_lex("%s:%d LEX_READ", __func__, __LINE__);
4820 if (BC_PARSE_LEAF(prev, bin_last, rprn))
4821 return bc_error_bad_expression();
4822 s = zbc_parse_read();
4823 prev = XC_INST_READ;
4825 rprn = bin_last = incdec = false;
4828 case BC_LEX_KEY_SCALE:
4829 dbg_lex("%s:%d LEX_SCALE", __func__, __LINE__);
4830 if (BC_PARSE_LEAF(prev, bin_last, rprn))
4831 return bc_error_bad_expression();
4832 s = zbc_parse_scale(&prev, flags);
4833 //get_token = false; - already is
4834 rprn = bin_last = false;
4838 return bc_error_bad_token();
4841 if (s || G_interrupt) // error, or ^C: stop parsing
4842 return BC_STATUS_FAILURE;
4850 while (p->ops.len > ops_bgn) {
4851 BcLexType top = BC_PARSE_TOP_OP(p);
4852 assign = (top >= BC_LEX_OP_ASSIGN_POWER && top <= BC_LEX_OP_ASSIGN);
4854 if (top == BC_LEX_LPAREN || top == BC_LEX_RPAREN)
4855 return bc_error_bad_expression();
4857 xc_parse_push(BC_TOKEN_2_INST(top));
4859 nexprs -= (top != BC_LEX_OP_BOOL_NOT && top != XC_LEX_NEG);
4860 bc_vec_pop(&p->ops);
4863 if (prev == XC_INST_BOOL_NOT || nexprs != 1)
4864 return bc_error_bad_expression();
4866 if (!(flags & BC_PARSE_REL) && nrelops) {
4868 s = zbc_POSIX_does_not_allow("comparison operators outside if or loops");
4870 } else if ((flags & BC_PARSE_REL) && nrelops > 1) {
4872 s = zbc_POSIX_requires("exactly one comparison operator per condition");
4876 if (flags & BC_PARSE_PRINT) {
4877 if (paren_first || !assign)
4878 xc_parse_push(XC_INST_PRINT);
4879 xc_parse_push(XC_INST_POP);
4882 dbg_lex_done("%s:%d done", __func__, __LINE__);
4883 return BC_STATUS_SUCCESS;
4890 static BC_STATUS zdc_parse_register(void)
4892 BcParse *p = &G.prs;
4896 if (s) RETURN_STATUS(s);
4897 if (p->lex != XC_LEX_NAME) RETURN_STATUS(bc_error_bad_token());
4899 xc_parse_pushName(p->lex_strnumbuf.v);
4903 #define zdc_parse_register(...) (zdc_parse_register(__VA_ARGS__) COMMA_SUCCESS)
4905 static void dc_parse_string(void)
4907 BcParse *p = &G.prs;
4909 size_t len = G.prog.strs.len;
4911 dbg_lex_enter("%s:%d entered", __func__, __LINE__);
4913 str = xstrdup(p->lex_strnumbuf.v);
4914 xc_parse_push(XC_INST_STR);
4915 xc_parse_pushIndex(len);
4916 bc_vec_push(&G.prog.strs, &str);
4918 // Explanation needed here
4919 xc_program_add_fn();
4920 p->func = xc_program_func(p->fidx);
4922 dbg_lex_done("%s:%d done", __func__, __LINE__);
4925 static BC_STATUS zdc_parse_mem(uint8_t inst, bool name, bool store)
4929 xc_parse_push(inst);
4931 s = zdc_parse_register();
4932 if (s) RETURN_STATUS(s);
4936 xc_parse_push(DC_INST_SWAP);
4937 xc_parse_push(XC_INST_ASSIGN);
4938 xc_parse_push(XC_INST_POP);
4941 RETURN_STATUS(BC_STATUS_SUCCESS);
4943 #define zdc_parse_mem(...) (zdc_parse_mem(__VA_ARGS__) COMMA_SUCCESS)
4945 static BC_STATUS zdc_parse_cond(uint8_t inst)
4947 BcParse *p = &G.prs;
4950 xc_parse_push(inst);
4951 xc_parse_push(DC_INST_EXEC_COND);
4953 s = zdc_parse_register();
4954 if (s) RETURN_STATUS(s);
4957 if (s) RETURN_STATUS(s);
4959 // Note that 'else' part can not be on the next line:
4960 // echo -e '[1p]sa [2p]sb 2 1>a eb' | dc - OK, prints "2"
4961 // echo -e '[1p]sa [2p]sb 2 1>a\neb' | dc - parse error
4962 if (p->lex == DC_LEX_ELSE) {
4963 s = zdc_parse_register();
4964 if (s) RETURN_STATUS(s);
4967 xc_parse_push('\0');
4972 #define zdc_parse_cond(...) (zdc_parse_cond(__VA_ARGS__) COMMA_SUCCESS)
4974 static BC_STATUS zdc_parse_token(BcLexType t)
4978 bool assign, get_token;
4980 dbg_lex_enter("%s:%d entered", __func__, __LINE__);
4981 s = BC_STATUS_SUCCESS;
4984 case XC_LEX_OP_REL_EQ:
4985 case XC_LEX_OP_REL_LE:
4986 case XC_LEX_OP_REL_GE:
4987 case XC_LEX_OP_REL_NE:
4988 case XC_LEX_OP_REL_LT:
4989 case XC_LEX_OP_REL_GT:
4990 dbg_lex("%s:%d LEX_OP_REL_xyz", __func__, __LINE__);
4991 s = zdc_parse_cond(t - XC_LEX_OP_REL_EQ + XC_INST_REL_EQ);
4996 dbg_lex("%s:%d LEX_[S]COLON", __func__, __LINE__);
4997 s = zdc_parse_mem(XC_INST_ARRAY_ELEM, true, t == DC_LEX_COLON);
5000 dbg_lex("%s:%d LEX_STR", __func__, __LINE__);
5004 dbg_lex("%s:%d LEX_NEG", __func__, __LINE__);
5006 if (s) RETURN_STATUS(s);
5007 if (G.prs.lex != XC_LEX_NUMBER)
5008 RETURN_STATUS(bc_error_bad_token());
5010 xc_parse_push(XC_INST_NEG);
5013 dbg_lex("%s:%d LEX_NUMBER", __func__, __LINE__);
5017 dbg_lex("%s:%d LEX_KEY_READ", __func__, __LINE__);
5018 xc_parse_push(XC_INST_READ);
5020 case DC_LEX_OP_ASSIGN:
5021 case DC_LEX_STORE_PUSH:
5022 dbg_lex("%s:%d LEX_OP_ASSIGN/STORE_PUSH", __func__, __LINE__);
5023 assign = (t == DC_LEX_OP_ASSIGN);
5024 inst = assign ? XC_INST_VAR : DC_INST_PUSH_TO_VAR;
5025 s = zdc_parse_mem(inst, true, assign);
5028 case DC_LEX_LOAD_POP:
5029 dbg_lex("%s:%d LEX_OP_LOAD[_POP]", __func__, __LINE__);
5030 inst = t == DC_LEX_LOAD_POP ? DC_INST_PUSH_VAR : DC_INST_LOAD;
5031 s = zdc_parse_mem(inst, true, false);
5033 case DC_LEX_STORE_IBASE:
5034 case DC_LEX_STORE_SCALE:
5035 case DC_LEX_STORE_OBASE:
5036 dbg_lex("%s:%d LEX_OP_STORE_I/OBASE/SCALE", __func__, __LINE__);
5037 inst = t - DC_LEX_STORE_IBASE + XC_INST_IBASE;
5038 s = zdc_parse_mem(inst, false, true);
5041 dbg_lex_done("%s:%d done (bad token)", __func__, __LINE__);
5042 RETURN_STATUS(bc_error_bad_token());
5045 if (!s && get_token) s = zxc_lex_next();
5047 dbg_lex_done("%s:%d done", __func__, __LINE__);
5050 #define zdc_parse_token(...) (zdc_parse_token(__VA_ARGS__) COMMA_SUCCESS)
5052 static BC_STATUS zdc_parse_expr(void)
5054 BcParse *p = &G.prs;
5057 if (p->lex == XC_LEX_NLINE)
5058 RETURN_STATUS(zxc_lex_next());
5060 i = (int)p->lex - (int)XC_LEX_OP_POWER;
5062 BcInst inst = dc_LEX_to_INST[i];
5063 if (inst != DC_INST_INVALID) {
5064 xc_parse_push(inst);
5065 RETURN_STATUS(zxc_lex_next());
5068 RETURN_STATUS(zdc_parse_token(p->lex));
5070 #define zdc_parse_expr(...) (zdc_parse_expr(__VA_ARGS__) COMMA_SUCCESS)
5072 static BC_STATUS zdc_parse_exprs_until_eof(void)
5074 BcParse *p = &G.prs;
5075 dbg_lex_enter("%s:%d entered, p->lex:%d", __func__, __LINE__, p->lex);
5076 while (p->lex != XC_LEX_EOF) {
5077 BcStatus s = zdc_parse_expr();
5078 if (s) RETURN_STATUS(s);
5081 dbg_lex_done("%s:%d done", __func__, __LINE__);
5082 RETURN_STATUS(BC_STATUS_SUCCESS);
5084 #define zdc_parse_exprs_until_eof(...) (zdc_parse_exprs_until_eof(__VA_ARGS__) COMMA_SUCCESS)
5092 #define BC_PROG_STR(n) (!(n)->num && !(n)->cap)
5093 #define BC_PROG_NUM(r, n) \
5094 ((r)->t != XC_RESULT_ARRAY && (r)->t != XC_RESULT_STR && !BC_PROG_STR(n))
5096 #define STACK_HAS_MORE_THAN(s, n) ((s)->len > ((size_t)(n)))
5097 #define STACK_HAS_EQUAL_OR_MORE_THAN(s, n) ((s)->len >= ((size_t)(n)))
5099 static BcVec* xc_program_search(char *id, bool var)
5106 v = var ? &G.prog.vars : &G.prog.arrs;
5107 map = var ? &G.prog.var_map : &G.prog.arr_map;
5111 new = bc_map_insert(map, &e, &i); // 1 if insertion was successful
5115 bc_array_init(&v2, var);
5116 bc_vec_push(v, &v2);
5119 ptr = bc_vec_item(map, i);
5120 if (new) ptr->name = xstrdup(e.name);
5121 return bc_vec_item(v, ptr->idx);
5124 // 'num' need not be initialized on entry
5125 static BC_STATUS zxc_program_num(BcResult *r, BcNum **num)
5129 case XC_RESULT_TEMP:
5130 case XC_RESULT_IBASE:
5131 case XC_RESULT_SCALE:
5132 case XC_RESULT_OBASE:
5135 case XC_RESULT_CONSTANT: {
5140 str = *xc_program_const(r->d.id.idx);
5143 bc_num_init(&r->d.n, len);
5145 s = zxc_num_parse(&r->d.n, str, G.prog.ib_t);
5147 bc_num_free(&r->d.n);
5151 r->t = XC_RESULT_TEMP;
5155 case XC_RESULT_ARRAY:
5156 case XC_RESULT_ARRAY_ELEM: {
5159 v = xc_program_search(r->d.id.name, r->t == XC_RESULT_VAR);
5160 // dc variables are all stacks, so here we have this:
5162 // TODO: eliminate these stacks for bc-only config?
5163 if (r->t == XC_RESULT_ARRAY_ELEM) {
5165 if (v->len <= r->d.id.idx)
5166 bc_array_expand(v, r->d.id.idx + 1);
5167 *num = bc_vec_item(v, r->d.id.idx);
5174 case BC_RESULT_LAST:
5175 *num = &G.prog.last;
5183 // Testing the theory that dc does not reach LAST/ONE
5184 bb_error_msg_and_die("BUG:%d", r->t);
5188 RETURN_STATUS(BC_STATUS_SUCCESS);
5190 #define zxc_program_num(...) (zxc_program_num(__VA_ARGS__) COMMA_SUCCESS)
5192 static BC_STATUS zxc_program_binOpPrep(BcResult **l, BcNum **ln,
5193 BcResult **r, BcNum **rn, bool assign)
5196 BcResultType lt, rt;
5198 if (!STACK_HAS_MORE_THAN(&G.prog.results, 1))
5199 RETURN_STATUS(bc_error_stack_has_too_few_elements());
5201 *r = bc_vec_item_rev(&G.prog.results, 0);
5202 *l = bc_vec_item_rev(&G.prog.results, 1);
5204 s = zxc_program_num(*l, ln);
5205 if (s) RETURN_STATUS(s);
5206 s = zxc_program_num(*r, rn);
5207 if (s) RETURN_STATUS(s);
5212 // We run this again under these conditions in case any vector has been
5213 // reallocated out from under the BcNums or arrays we had.
5214 if (lt == rt && (lt == XC_RESULT_VAR || lt == XC_RESULT_ARRAY_ELEM)) {
5215 s = zxc_program_num(*l, ln);
5216 if (s) RETURN_STATUS(s);
5219 if (!BC_PROG_NUM((*l), (*ln)) && (!assign || (*l)->t != XC_RESULT_VAR))
5220 RETURN_STATUS(bc_error_variable_is_wrong_type());
5221 if (!assign && !BC_PROG_NUM((*r), (*ln)))
5222 RETURN_STATUS(bc_error_variable_is_wrong_type());
5226 #define zxc_program_binOpPrep(...) (zxc_program_binOpPrep(__VA_ARGS__) COMMA_SUCCESS)
5228 static void xc_program_binOpRetire(BcResult *r)
5230 r->t = XC_RESULT_TEMP;
5231 bc_vec_pop(&G.prog.results);
5232 bc_result_pop_and_push(r);
5235 // Note: *r and *n need not be initialized by caller
5236 static BC_STATUS zxc_program_prep(BcResult **r, BcNum **n)
5240 if (!STACK_HAS_MORE_THAN(&G.prog.results, 0))
5241 RETURN_STATUS(bc_error_stack_has_too_few_elements());
5242 *r = bc_vec_top(&G.prog.results);
5244 s = zxc_program_num(*r, n);
5245 if (s) RETURN_STATUS(s);
5247 if (!BC_PROG_NUM((*r), (*n)))
5248 RETURN_STATUS(bc_error_variable_is_wrong_type());
5252 #define zxc_program_prep(...) (zxc_program_prep(__VA_ARGS__) COMMA_SUCCESS)
5254 static void xc_program_retire(BcResult *r, BcResultType t)
5257 bc_result_pop_and_push(r);
5260 static BC_STATUS zxc_program_op(char inst)
5263 BcResult *opd1, *opd2, res;
5266 s = zxc_program_binOpPrep(&opd1, &n1, &opd2, &n2, false);
5267 if (s) RETURN_STATUS(s);
5268 bc_num_init_DEF_SIZE(&res.d.n);
5270 s = BC_STATUS_SUCCESS;
5271 IF_ERROR_RETURN_POSSIBLE(s =) zxc_program_ops[inst - XC_INST_POWER](n1, n2, &res.d.n, G.prog.scale);
5273 xc_program_binOpRetire(&res);
5277 bc_num_free(&res.d.n);
5280 #define zxc_program_op(...) (zxc_program_op(__VA_ARGS__) COMMA_SUCCESS)
5282 static BC_STATUS zxc_program_read(void)
5290 bc_char_vec_init(&buf);
5291 xc_read_line(&buf, stdin);
5293 f = xc_program_func(BC_PROG_READ);
5294 bc_vec_pop_all(&f->code);
5296 sv_parse = G.prs; // struct copy
5297 xc_parse_create(BC_PROG_READ);
5298 //G.err_line = G.prs.lex_line = 1; - not needed, error line info is not printed for read()
5300 s = zxc_parse_text_init(buf.v);
5301 if (s) goto exec_err;
5303 IF_BC(s = zbc_parse_expr(0));
5305 IF_DC(s = zdc_parse_exprs_until_eof());
5307 if (s) goto exec_err;
5308 if (G.prs.lex != XC_LEX_NLINE && G.prs.lex != XC_LEX_EOF) {
5309 s = bc_error_at("bad read() expression");
5312 xc_parse_push(XC_INST_RET);
5314 ip.func = BC_PROG_READ;
5316 bc_vec_push(&G.prog.exestack, &ip);
5320 G.prs = sv_parse; // struct copy
5324 #define zxc_program_read(...) (zxc_program_read(__VA_ARGS__) COMMA_SUCCESS)
5326 static size_t xc_program_index(char *code, size_t *bgn)
5328 unsigned char *bytes = (void*)(code + *bgn);
5334 if (amt < SMALL_INDEX_LIMIT) {
5338 amt -= (SMALL_INDEX_LIMIT - 1); // amt is 1 or more here
5344 res |= (size_t)(*bytes++) << i;
5346 } while (--amt != 0);
5351 static char *xc_program_name(char *code, size_t *bgn)
5354 *bgn += strlen(code) + 1;
5356 return xstrdup(code);
5359 static void xc_program_printString(const char *str)
5362 if (!str[0] && IS_DC) {
5363 // Example: echo '[]ap' | dc
5364 // should print two bytes: 0x00, 0x0A
5372 static const char esc[] ALIGN1 = "nabfrt""e\\";
5376 n = strchr(esc, c); // note: c can be NUL
5378 // Just print the backslash and following character
5382 if (n - esc == 0) // "\n" ?
5383 G.prog.nchars = SIZE_MAX;
5384 c = "\n\a\b\f\r\t""\\\\""\\"[n - esc];
5385 // n a b f r t e \ \<end of line>
5393 static void bc_num_printNewline(void)
5395 if (G.prog.nchars == G.prog.len - 1) {
5403 static FAST_FUNC void dc_num_printChar(size_t num, size_t width, bool radix)
5406 bb_putchar((char) num);
5407 G.prog.nchars += width;
5411 static FAST_FUNC void bc_num_printDigits(size_t num, size_t width, bool radix)
5415 bc_num_printNewline();
5416 bb_putchar(radix ? '.' : ' ');
5419 bc_num_printNewline();
5420 for (exp = 0, pow = 1; exp < width - 1; ++exp, pow *= 10)
5423 for (exp = 0; exp < width; pow /= 10, ++G.prog.nchars, ++exp) {
5425 bc_num_printNewline();
5428 bb_putchar(((char) dig) + '0');
5432 static FAST_FUNC void bc_num_printHex(size_t num, size_t width, bool radix)
5435 bc_num_printNewline();
5440 bc_num_printNewline();
5441 bb_putchar(bb_hexdigits_upcase[num]);
5442 G.prog.nchars += width;
5445 static void bc_num_printDecimal(BcNum *n)
5447 size_t i, rdx = n->rdx - 1;
5454 for (i = n->len - 1; i < n->len; --i)
5455 bc_num_printHex((size_t) n->num[i], 1, i == rdx);
5458 typedef void (*BcNumDigitOp)(size_t, size_t, bool) FAST_FUNC;
5460 static BC_STATUS zxc_num_printNum(BcNum *n, unsigned base_t, size_t width, BcNumDigitOp print)
5465 BcDig base_digs[ULONG_NUM_BUFSIZE];
5466 BcNum intp, fracp, digit, frac_len;
5467 unsigned long dig, *ptr;
5472 print(0, width, false);
5473 RETURN_STATUS(BC_STATUS_SUCCESS);
5476 bc_vec_init(&stack, sizeof(long), NULL);
5477 bc_num_init(&intp, n->len);
5478 bc_num_init(&fracp, n->rdx);
5479 bc_num_init(&digit, width);
5480 bc_num_init(&frac_len, BC_NUM_INT(n));
5481 bc_num_copy(&intp, n);
5482 bc_num_one(&frac_len);
5483 base.cap = ARRAY_SIZE(base_digs);
5484 base.num = base_digs;
5485 bc_num_ulong2num(&base, base_t);
5487 bc_num_truncate(&intp, intp.rdx);
5488 s = zbc_num_sub(n, &intp, &fracp, 0);
5491 while (intp.len != 0) {
5492 s = zbc_num_divmod(&intp, &base, &intp, &digit, 0);
5494 s = zbc_num_ulong(&digit, &dig);
5496 bc_vec_push(&stack, &dig);
5499 for (i = 0; i < stack.len; ++i) {
5500 ptr = bc_vec_item_rev(&stack, i);
5501 print(*ptr, width, false);
5504 if (!n->rdx) goto err;
5506 for (radix = true; frac_len.len <= n->rdx; radix = false) {
5507 s = zbc_num_mul(&fracp, &base, &fracp, n->rdx);
5509 s = zbc_num_ulong(&fracp, &dig);
5511 bc_num_ulong2num(&intp, dig);
5512 s = zbc_num_sub(&fracp, &intp, &fracp, 0);
5514 print(dig, width, radix);
5515 s = zbc_num_mul(&frac_len, &base, &frac_len, 0);
5519 bc_num_free(&frac_len);
5520 bc_num_free(&digit);
5521 bc_num_free(&fracp);
5523 bc_vec_free(&stack);
5526 #define zxc_num_printNum(...) (zxc_num_printNum(__VA_ARGS__) COMMA_SUCCESS)
5528 static BC_STATUS zxc_num_printBase(BcNum *n)
5542 if (G.prog.ob_t <= 16) {
5544 print = bc_num_printHex;
5546 unsigned i = G.prog.ob_t - 1;
5554 print = bc_num_printDigits;
5557 s = zxc_num_printNum(n, G.prog.ob_t, width, print);
5562 #define zxc_num_printBase(...) (zxc_num_printBase(__VA_ARGS__) COMMA_SUCCESS)
5564 static BC_STATUS zxc_num_print(BcNum *n, bool newline)
5566 BcStatus s = BC_STATUS_SUCCESS;
5568 bc_num_printNewline();
5573 } else if (G.prog.ob_t == 10)
5574 bc_num_printDecimal(n);
5576 s = zxc_num_printBase(n);
5585 #define zxc_num_print(...) (zxc_num_print(__VA_ARGS__) COMMA_SUCCESS)
5587 static BC_STATUS zxc_program_print(char inst, size_t idx)
5592 bool pop = (inst != XC_INST_PRINT);
5594 if (!STACK_HAS_MORE_THAN(&G.prog.results, idx))
5595 RETURN_STATUS(bc_error_stack_has_too_few_elements());
5597 r = bc_vec_item_rev(&G.prog.results, idx);
5598 s = zxc_program_num(r, &num);
5599 if (s) RETURN_STATUS(s);
5601 if (BC_PROG_NUM(r, num)) {
5602 s = zxc_num_print(num, !pop);
5604 if (!s && IS_BC) bc_num_copy(&G.prog.last, num);
5609 idx = (r->t == XC_RESULT_STR) ? r->d.id.idx : num->rdx;
5610 str = *xc_program_str(idx);
5612 if (inst == XC_INST_PRINT_STR) {
5614 G.prog.nchars += printf("%s", str);
5615 nl = strrchr(str, '\n');
5617 G.prog.nchars = strlen(nl + 1);
5619 xc_program_printString(str);
5620 if (inst == XC_INST_PRINT)
5625 if (!s && pop) bc_vec_pop(&G.prog.results);
5629 #define zxc_program_print(...) (zxc_program_print(__VA_ARGS__) COMMA_SUCCESS)
5631 static BC_STATUS zxc_program_negate(void)
5637 s = zxc_program_prep(&ptr, &num);
5638 if (s) RETURN_STATUS(s);
5640 bc_num_init(&res.d.n, num->len);
5641 bc_num_copy(&res.d.n, num);
5642 if (res.d.n.len) res.d.n.neg = !res.d.n.neg;
5644 xc_program_retire(&res, XC_RESULT_TEMP);
5648 #define zxc_program_negate(...) (zxc_program_negate(__VA_ARGS__) COMMA_SUCCESS)
5650 static BC_STATUS zxc_program_logical(char inst)
5653 BcResult *opd1, *opd2, res;
5657 s = zxc_program_binOpPrep(&opd1, &n1, &opd2, &n2, false);
5658 if (s) RETURN_STATUS(s);
5660 bc_num_init_DEF_SIZE(&res.d.n);
5662 if (inst == XC_INST_BOOL_AND)
5663 cond = bc_num_cmp(n1, &G.prog.zero) && bc_num_cmp(n2, &G.prog.zero);
5664 else if (inst == XC_INST_BOOL_OR)
5665 cond = bc_num_cmp(n1, &G.prog.zero) || bc_num_cmp(n2, &G.prog.zero);
5667 cond = bc_num_cmp(n1, n2);
5669 case XC_INST_REL_EQ:
5672 case XC_INST_REL_LE:
5675 case XC_INST_REL_GE:
5678 case XC_INST_REL_LT:
5681 case XC_INST_REL_GT:
5684 default: // = case XC_INST_REL_NE:
5685 //cond = (cond != 0); - not needed
5690 if (cond) bc_num_one(&res.d.n);
5691 //else bc_num_zero(&res.d.n); - already is
5693 xc_program_binOpRetire(&res);
5697 #define zxc_program_logical(...) (zxc_program_logical(__VA_ARGS__) COMMA_SUCCESS)
5700 static BC_STATUS zdc_program_assignStr(BcResult *r, BcVec *v, bool push)
5705 memset(&n2, 0, sizeof(BcNum));
5706 n2.rdx = res.d.id.idx = r->d.id.idx;
5707 res.t = XC_RESULT_STR;
5710 if (!STACK_HAS_MORE_THAN(&G.prog.results, 1))
5711 RETURN_STATUS(bc_error_stack_has_too_few_elements());
5713 bc_vec_pop(&G.prog.results);
5716 bc_result_pop_and_push(&res);
5717 bc_vec_push(v, &n2);
5719 RETURN_STATUS(BC_STATUS_SUCCESS);
5721 #define zdc_program_assignStr(...) (zdc_program_assignStr(__VA_ARGS__) COMMA_SUCCESS)
5724 static BC_STATUS zxc_program_popResultAndCopyToVar(char *name, bool var)
5731 if (!STACK_HAS_MORE_THAN(&G.prog.results, 0))
5732 RETURN_STATUS(bc_error_stack_has_too_few_elements());
5734 ptr = bc_vec_top(&G.prog.results);
5735 if ((ptr->t == XC_RESULT_ARRAY) != !var)
5736 RETURN_STATUS(bc_error_variable_is_wrong_type());
5737 v = xc_program_search(name, var);
5740 if (ptr->t == XC_RESULT_STR && !var)
5741 RETURN_STATUS(bc_error_variable_is_wrong_type());
5742 if (ptr->t == XC_RESULT_STR)
5743 RETURN_STATUS(zdc_program_assignStr(ptr, v, true));
5746 s = zxc_program_num(ptr, &n);
5747 if (s) RETURN_STATUS(s);
5749 // Do this once more to make sure that pointers were not invalidated.
5750 v = xc_program_search(name, var);
5753 bc_num_init_DEF_SIZE(&r.d.n);
5754 bc_num_copy(&r.d.n, n);
5756 bc_array_init(&r.d.v, true);
5757 bc_array_copy(&r.d.v, (BcVec *) n);
5760 bc_vec_push(v, &r.d);
5761 bc_vec_pop(&G.prog.results);
5765 #define zxc_program_popResultAndCopyToVar(...) (zxc_program_popResultAndCopyToVar(__VA_ARGS__) COMMA_SUCCESS)
5767 static BC_STATUS zxc_program_assign(char inst)
5770 BcResult *left, *right, res;
5772 bool assign = (inst == XC_INST_ASSIGN);
5775 s = zxc_program_binOpPrep(&left, &l, &right, &r, assign);
5776 if (s) RETURN_STATUS(s);
5778 ib = left->t == XC_RESULT_IBASE;
5779 sc = left->t == XC_RESULT_SCALE;
5782 if (right->t == XC_RESULT_STR) {
5785 if (left->t != XC_RESULT_VAR)
5786 RETURN_STATUS(bc_error_variable_is_wrong_type());
5787 v = xc_program_search(left->d.id.name, true);
5789 RETURN_STATUS(zdc_program_assignStr(right, v, false));
5793 if (left->t == XC_RESULT_CONSTANT || left->t == XC_RESULT_TEMP)
5794 RETURN_STATUS(bc_error_bad_assignment());
5800 s = BC_STATUS_SUCCESS;
5801 IF_ERROR_RETURN_POSSIBLE(s =) zxc_program_ops[inst - BC_INST_ASSIGN_POWER](l, r, l, G.prog.scale);
5803 if (s) RETURN_STATUS(s);
5808 if (ib || sc || left->t == XC_RESULT_OBASE) {
5809 static const char *const msg[] = {
5810 "bad ibase; must be [2,16]", //XC_RESULT_IBASE
5811 "bad obase; must be [2,"BC_MAX_OBASE_STR"]", //XC_RESULT_OBASE
5812 "bad scale; must be [0,"BC_MAX_SCALE_STR"]", //XC_RESULT_SCALE
5818 s = zbc_num_ulong(l, &val);
5819 if (s) RETURN_STATUS(s);
5820 s = left->t - XC_RESULT_IBASE;
5823 ptr = &G.prog.scale;
5826 RETURN_STATUS(bc_error(msg[s]));
5827 max = ib ? BC_NUM_MAX_IBASE : BC_MAX_OBASE;
5828 ptr = ib ? &G.prog.ib_t : &G.prog.ob_t;
5832 RETURN_STATUS(bc_error(msg[s]));
5834 *ptr = (size_t) val;
5835 s = BC_STATUS_SUCCESS;
5838 bc_num_init(&res.d.n, l->len);
5839 bc_num_copy(&res.d.n, l);
5840 xc_program_binOpRetire(&res);
5844 #define zxc_program_assign(...) (zxc_program_assign(__VA_ARGS__) COMMA_SUCCESS)
5847 #define xc_program_pushVar(code, bgn, pop, copy) \
5848 xc_program_pushVar(code, bgn)
5849 // for bc, 'pop' and 'copy' are always false
5851 static BC_STATUS xc_program_pushVar(char *code, size_t *bgn,
5852 bool pop, bool copy)
5855 char *name = xc_program_name(code, bgn);
5857 r.t = XC_RESULT_VAR;
5862 BcVec *v = xc_program_search(name, true);
5863 BcNum *num = bc_vec_top(v);
5866 if (!STACK_HAS_MORE_THAN(v, 1 - copy)) {
5867 RETURN_STATUS(bc_error_stack_has_too_few_elements());
5870 if (!BC_PROG_STR(num)) {
5871 r.t = XC_RESULT_TEMP;
5872 bc_num_init_DEF_SIZE(&r.d.n);
5873 bc_num_copy(&r.d.n, num);
5875 r.t = XC_RESULT_STR;
5876 r.d.id.idx = num->rdx;
5879 if (!copy) bc_vec_pop(v);
5883 bc_vec_push(&G.prog.results, &r);
5885 RETURN_STATUS(BC_STATUS_SUCCESS);
5887 #define zxc_program_pushVar(...) (xc_program_pushVar(__VA_ARGS__) COMMA_SUCCESS)
5889 static BC_STATUS zbc_program_pushArray(char *code, size_t *bgn, char inst)
5891 BcStatus s = BC_STATUS_SUCCESS;
5895 r.d.id.name = xc_program_name(code, bgn);
5897 if (inst == XC_INST_ARRAY) {
5898 r.t = XC_RESULT_ARRAY;
5899 bc_vec_push(&G.prog.results, &r);
5904 s = zxc_program_prep(&operand, &num);
5906 s = zbc_num_ulong(num, &temp);
5909 if (temp > BC_MAX_DIM) {
5910 s = bc_error("array too long; must be [1,"BC_MAX_DIM_STR"]");
5914 r.d.id.idx = (size_t) temp;
5915 xc_program_retire(&r, XC_RESULT_ARRAY_ELEM);
5918 if (s) free(r.d.id.name);
5921 #define zbc_program_pushArray(...) (zbc_program_pushArray(__VA_ARGS__) COMMA_SUCCESS)
5924 static BC_STATUS zbc_program_incdec(char inst)
5927 BcResult *ptr, res, copy;
5931 s = zxc_program_prep(&ptr, &num);
5932 if (s) RETURN_STATUS(s);
5934 if (inst == BC_INST_INC_POST || inst == BC_INST_DEC_POST) {
5935 copy.t = XC_RESULT_TEMP;
5936 bc_num_init(©.d.n, num->len);
5937 bc_num_copy(©.d.n, num);
5940 res.t = BC_RESULT_ONE;
5941 inst = (inst == BC_INST_INC_PRE || inst == BC_INST_INC_POST)
5942 ? BC_INST_ASSIGN_PLUS
5943 : BC_INST_ASSIGN_MINUS;
5945 bc_vec_push(&G.prog.results, &res);
5946 s = zxc_program_assign(inst);
5947 if (s) RETURN_STATUS(s);
5949 if (inst2 == BC_INST_INC_POST || inst2 == BC_INST_DEC_POST) {
5950 bc_result_pop_and_push(©);
5955 #define zbc_program_incdec(...) (zbc_program_incdec(__VA_ARGS__) COMMA_SUCCESS)
5957 static BC_STATUS zbc_program_call(char *code, size_t *idx)
5964 nparams = xc_program_index(code, idx);
5965 ip.func = xc_program_index(code, idx);
5966 func = xc_program_func(ip.func);
5968 if (func->code.len == 0) {
5969 RETURN_STATUS(bc_error("undefined function"));
5971 if (nparams != func->nparams) {
5972 RETURN_STATUS(bc_error_fmt("function has %u parameters, but called with %u", func->nparams, nparams));
5976 for (i = 0; i < nparams; ++i) {
5980 a = bc_vec_item(&func->autos, nparams - 1 - i);
5981 arg = bc_vec_top(&G.prog.results);
5983 if ((!a->idx) != (arg->t == XC_RESULT_ARRAY) // array/variable mismatch
5984 // || arg->t == XC_RESULT_STR - impossible, f("str") is not a legal syntax (strings are not bc expressions)
5986 RETURN_STATUS(bc_error_variable_is_wrong_type());
5988 s = zxc_program_popResultAndCopyToVar(a->name, a->idx);
5989 if (s) RETURN_STATUS(s);
5992 a = bc_vec_item(&func->autos, i);
5993 for (; i < func->autos.len; i++, a++) {
5996 v = xc_program_search(a->name, a->idx);
5999 bc_num_init_DEF_SIZE(&n2);
6000 bc_vec_push(v, &n2);
6003 bc_array_init(&v2, true);
6004 bc_vec_push(v, &v2);
6008 bc_vec_push(&G.prog.exestack, &ip);
6010 RETURN_STATUS(BC_STATUS_SUCCESS);
6012 #define zbc_program_call(...) (zbc_program_call(__VA_ARGS__) COMMA_SUCCESS)
6014 static BC_STATUS zbc_program_return(char inst)
6020 BcInstPtr *ip = bc_vec_top(&G.prog.exestack);
6022 if (inst == XC_INST_RET) {
6023 // bc needs this for e.g. RESULT_CONSTANT ("return 5")
6024 // because bc constants are per-function.
6025 // TODO: maybe avoid if value is already RESULT_TEMP?
6028 BcResult *operand = bc_vec_top(&G.prog.results);
6030 s = zxc_program_num(operand, &num);
6031 if (s) RETURN_STATUS(s);
6032 bc_num_init(&res.d.n, num->len);
6033 bc_num_copy(&res.d.n, num);
6034 bc_vec_pop(&G.prog.results);
6035 //} else if (f->void_func) {
6036 //prepare "void" result in res
6038 bc_num_init_DEF_SIZE(&res.d.n);
6039 //bc_num_zero(&res.d.n); - already is
6041 res.t = XC_RESULT_TEMP;
6042 bc_vec_push(&G.prog.results, &res);
6044 bc_vec_pop(&G.prog.exestack);
6046 // We need to pop arguments as well, so this takes that into account.
6047 f = xc_program_func(ip->func);
6048 a = (void*)f->autos.v;
6049 for (i = 0; i < f->autos.len; i++, a++) {
6051 v = xc_program_search(a->name, a->idx);
6055 RETURN_STATUS(BC_STATUS_SUCCESS);
6057 #define zbc_program_return(...) (zbc_program_return(__VA_ARGS__) COMMA_SUCCESS)
6060 static unsigned long xc_program_scale(BcNum *n)
6062 return (unsigned long) n->rdx;
6065 static unsigned long xc_program_len(BcNum *n)
6067 size_t len = n->len;
6069 if (n->rdx != len) return len;
6071 if (len == 0) break;
6073 if (n->num[len] != 0) break;
6078 static BC_STATUS zxc_program_builtin(char inst)
6084 bool len = (inst == XC_INST_LENGTH);
6086 if (!STACK_HAS_MORE_THAN(&G.prog.results, 0))
6087 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6088 opnd = bc_vec_top(&G.prog.results);
6090 s = zxc_program_num(opnd, &num);
6091 if (s) RETURN_STATUS(s);
6094 if (!BC_PROG_NUM(opnd, num) && !len)
6095 RETURN_STATUS(bc_error_variable_is_wrong_type());
6098 bc_num_init_DEF_SIZE(&res.d.n);
6100 if (inst == XC_INST_SQRT)
6101 s = zbc_num_sqrt(num, &res.d.n, G.prog.scale);
6103 else if (len != 0 && opnd->t == XC_RESULT_ARRAY) {
6104 bc_num_ulong2num(&res.d.n, (unsigned long) ((BcVec *) num)->len);
6108 else if (len != 0 && !BC_PROG_NUM(opnd, num)) {
6110 size_t idx = opnd->t == XC_RESULT_STR ? opnd->d.id.idx : num->rdx;
6112 str = xc_program_str(idx);
6113 bc_num_ulong2num(&res.d.n, strlen(*str));
6117 bc_num_ulong2num(&res.d.n, len ? xc_program_len(num) : xc_program_scale(num));
6120 xc_program_retire(&res, XC_RESULT_TEMP);
6124 #define zxc_program_builtin(...) (zxc_program_builtin(__VA_ARGS__) COMMA_SUCCESS)
6127 static BC_STATUS zdc_program_divmod(void)
6130 BcResult *opd1, *opd2, res, res2;
6133 s = zxc_program_binOpPrep(&opd1, &n1, &opd2, &n2, false);
6134 if (s) RETURN_STATUS(s);
6136 bc_num_init_DEF_SIZE(&res.d.n);
6137 bc_num_init(&res2.d.n, n2->len);
6139 s = zbc_num_divmod(n1, n2, &res2.d.n, &res.d.n, G.prog.scale);
6142 xc_program_binOpRetire(&res2);
6143 res.t = XC_RESULT_TEMP;
6144 bc_vec_push(&G.prog.results, &res);
6148 bc_num_free(&res2.d.n);
6149 bc_num_free(&res.d.n);
6152 #define zdc_program_divmod(...) (zdc_program_divmod(__VA_ARGS__) COMMA_SUCCESS)
6154 static BC_STATUS zdc_program_modexp(void)
6157 BcResult *r1, *r2, *r3, res;
6158 BcNum *n1, *n2, *n3;
6160 if (!STACK_HAS_MORE_THAN(&G.prog.results, 2))
6161 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6162 s = zxc_program_binOpPrep(&r2, &n2, &r3, &n3, false);
6163 if (s) RETURN_STATUS(s);
6165 r1 = bc_vec_item_rev(&G.prog.results, 2);
6166 s = zxc_program_num(r1, &n1);
6167 if (s) RETURN_STATUS(s);
6168 if (!BC_PROG_NUM(r1, n1))
6169 RETURN_STATUS(bc_error_variable_is_wrong_type());
6171 // Make sure that the values have their pointers updated, if necessary.
6172 if (r1->t == XC_RESULT_VAR || r1->t == XC_RESULT_ARRAY_ELEM) {
6173 if (r1->t == r2->t) {
6174 s = zxc_program_num(r2, &n2);
6175 if (s) RETURN_STATUS(s);
6177 if (r1->t == r3->t) {
6178 s = zxc_program_num(r3, &n3);
6179 if (s) RETURN_STATUS(s);
6183 bc_num_init(&res.d.n, n3->len);
6184 s = zdc_num_modexp(n1, n2, n3, &res.d.n);
6187 bc_vec_pop(&G.prog.results);
6188 xc_program_binOpRetire(&res);
6192 bc_num_free(&res.d.n);
6195 #define zdc_program_modexp(...) (zdc_program_modexp(__VA_ARGS__) COMMA_SUCCESS)
6197 static void dc_program_stackLen(void)
6200 size_t len = G.prog.results.len;
6202 res.t = XC_RESULT_TEMP;
6204 bc_num_init_DEF_SIZE(&res.d.n);
6205 bc_num_ulong2num(&res.d.n, len);
6206 bc_vec_push(&G.prog.results, &res);
6209 static BC_STATUS zdc_program_asciify(void)
6219 if (!STACK_HAS_MORE_THAN(&G.prog.results, 0))
6220 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6222 r = bc_vec_top(&G.prog.results);
6223 s = zxc_program_num(r, &num);
6224 if (s) RETURN_STATUS(s);
6226 if (BC_PROG_NUM(r, num)) {
6229 BcDig strmb_digs[ULONG_NUM_BUFSIZE];
6231 bc_num_init_DEF_SIZE(&n);
6232 bc_num_copy(&n, num);
6233 bc_num_truncate(&n, n.rdx);
6235 strmb.cap = ARRAY_SIZE(strmb_digs);
6236 strmb.num = strmb_digs;
6237 bc_num_ulong2num(&strmb, 0x100);
6239 s = zbc_num_mod(&n, &strmb, &n, 0);
6240 if (s) goto num_err;
6241 s = zbc_num_ulong(&n, &val);
6242 if (s) goto num_err;
6249 idx = (r->t == XC_RESULT_STR) ? r->d.id.idx : num->rdx;
6250 sp = *xc_program_str(idx);
6254 strs = (void*)G.prog.strs.v;
6255 for (idx = 0; idx < G.prog.strs.len; idx++) {
6256 if (strs[idx][0] == c && strs[idx][1] == '\0') {
6262 //str[1] = '\0'; - already is
6263 bc_vec_push(&G.prog.strs, &str);
6265 res.t = XC_RESULT_STR;
6267 bc_result_pop_and_push(&res);
6269 RETURN_STATUS(BC_STATUS_SUCCESS);
6274 #define zdc_program_asciify(...) (zdc_program_asciify(__VA_ARGS__) COMMA_SUCCESS)
6276 static BC_STATUS zdc_program_printStream(void)
6283 if (!STACK_HAS_MORE_THAN(&G.prog.results, 0))
6284 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6285 r = bc_vec_top(&G.prog.results);
6287 s = zxc_program_num(r, &n);
6288 if (s) RETURN_STATUS(s);
6290 if (BC_PROG_NUM(r, n)) {
6291 s = zxc_num_printNum(n, 0x100, 1, dc_num_printChar);
6294 idx = (r->t == XC_RESULT_STR) ? r->d.id.idx : n->rdx;
6295 str = *xc_program_str(idx);
6301 #define zdc_program_printStream(...) (zdc_program_printStream(__VA_ARGS__) COMMA_SUCCESS)
6303 static BC_STATUS zdc_program_nquit(void)
6310 s = zxc_program_prep(&opnd, &num);
6311 if (s) RETURN_STATUS(s);
6312 s = zbc_num_ulong(num, &val);
6313 if (s) RETURN_STATUS(s);
6315 bc_vec_pop(&G.prog.results);
6317 if (G.prog.exestack.len < val)
6318 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6319 if (G.prog.exestack.len == val) {
6320 QUIT_OR_RETURN_TO_MAIN;
6323 bc_vec_npop(&G.prog.exestack, val);
6327 #define zdc_program_nquit(...) (zdc_program_nquit(__VA_ARGS__) COMMA_SUCCESS)
6329 static BC_STATUS zdc_program_execStr(char *code, size_t *bgn, bool cond)
6331 BcStatus s = BC_STATUS_SUCCESS;
6337 if (!STACK_HAS_MORE_THAN(&G.prog.results, 0))
6338 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6340 r = bc_vec_top(&G.prog.results);
6343 BcNum *n = n; // for compiler
6346 char *then_name = xc_program_name(code, bgn);
6347 char *else_name = NULL;
6349 if (code[*bgn] == '\0')
6352 else_name = xc_program_name(code, bgn);
6354 exec = r->d.n.len != 0;
6356 if (!exec && else_name != NULL) {
6363 v = xc_program_search(name, true);
6370 if (!exec) goto exit;
6371 if (!BC_PROG_STR(n)) {
6372 s = bc_error_variable_is_wrong_type();
6378 if (r->t == XC_RESULT_STR) {
6380 } else if (r->t == XC_RESULT_VAR) {
6382 s = zxc_program_num(r, &n);
6383 if (s || !BC_PROG_STR(n)) goto exit;
6389 fidx = sidx + BC_PROG_REQ_FUNCS;
6391 f = xc_program_func(fidx);
6393 if (f->code.len == 0) {
6397 sv_parse = G.prs; // struct copy
6398 xc_parse_create(fidx);
6399 str = *xc_program_str(sidx);
6400 s = zxc_parse_text_init(str);
6403 s = zdc_parse_exprs_until_eof();
6405 xc_parse_push(DC_INST_POP_EXEC);
6406 if (G.prs.lex != XC_LEX_EOF)
6407 s = bc_error_bad_expression();
6409 G.prs = sv_parse; // struct copy
6412 bc_vec_pop_all(&f->code);
6420 bc_vec_pop(&G.prog.results);
6421 bc_vec_push(&G.prog.exestack, &ip);
6423 RETURN_STATUS(BC_STATUS_SUCCESS);
6425 bc_vec_pop(&G.prog.results);
6428 #define zdc_program_execStr(...) (zdc_program_execStr(__VA_ARGS__) COMMA_SUCCESS)
6431 static void xc_program_pushGlobal(char inst)
6436 res.t = inst - XC_INST_IBASE + XC_RESULT_IBASE;
6437 if (inst == XC_INST_IBASE)
6438 val = (unsigned long) G.prog.ib_t;
6439 else if (inst == XC_INST_SCALE)
6440 val = (unsigned long) G.prog.scale;
6442 val = (unsigned long) G.prog.ob_t;
6444 bc_num_init_DEF_SIZE(&res.d.n);
6445 bc_num_ulong2num(&res.d.n, val);
6446 bc_vec_push(&G.prog.results, &res);
6449 static BC_STATUS zxc_program_exec(void)
6452 BcInstPtr *ip = bc_vec_top(&G.prog.exestack);
6453 BcFunc *func = xc_program_func(ip->func);
6454 char *code = func->code.v;
6456 dbg_exec("func:%zd bytes:%zd ip:%zd results.len:%d",
6457 ip->func, func->code.len, ip->inst_idx, G.prog.results.len);
6458 while (ip->inst_idx < func->code.len) {
6459 BcStatus s = BC_STATUS_SUCCESS;
6460 char inst = code[ip->inst_idx++];
6462 dbg_exec("inst at %zd:%d results.len:%d", ip->inst_idx - 1, inst, G.prog.results.len);
6465 if (IS_DC) { // end of '?' reached
6466 bc_vec_pop(&G.prog.exestack);
6467 goto read_updated_ip;
6472 dbg_exec("BC_INST_RET[0]:");
6473 s = zbc_program_return(inst);
6474 goto read_updated_ip;
6475 case BC_INST_JUMP_ZERO: {
6478 dbg_exec("BC_INST_JUMP_ZERO:");
6479 s = zxc_program_prep(&ptr, &num);
6480 if (s) RETURN_STATUS(s);
6481 zero = (bc_num_cmp(num, &G.prog.zero) == 0);
6482 bc_vec_pop(&G.prog.results);
6484 xc_program_index(code, &ip->inst_idx);
6487 // else: fall through
6489 case BC_INST_JUMP: {
6490 size_t idx = xc_program_index(code, &ip->inst_idx);
6491 size_t *addr = bc_vec_item(&func->labels, idx);
6492 dbg_exec("BC_INST_JUMP: to %ld", (long)*addr);
6493 ip->inst_idx = *addr;
6497 dbg_exec("BC_INST_CALL:");
6498 s = zbc_program_call(code, &ip->inst_idx);
6499 goto read_updated_ip;
6500 case BC_INST_INC_PRE:
6501 case BC_INST_DEC_PRE:
6502 case BC_INST_INC_POST:
6503 case BC_INST_DEC_POST:
6504 dbg_exec("BC_INST_INCDEC:");
6505 s = zbc_program_incdec(inst);
6508 dbg_exec("BC_INST_HALT:");
6509 QUIT_OR_RETURN_TO_MAIN;
6511 case XC_INST_BOOL_OR:
6512 case XC_INST_BOOL_AND:
6514 case XC_INST_REL_EQ:
6515 case XC_INST_REL_LE:
6516 case XC_INST_REL_GE:
6517 case XC_INST_REL_NE:
6518 case XC_INST_REL_LT:
6519 case XC_INST_REL_GT:
6520 dbg_exec("BC_INST_BOOL:");
6521 s = zxc_program_logical(inst);
6524 dbg_exec("XC_INST_READ:");
6525 s = zxc_program_read();
6526 goto read_updated_ip;
6528 dbg_exec("XC_INST_VAR:");
6529 s = zxc_program_pushVar(code, &ip->inst_idx, false, false);
6531 case XC_INST_ARRAY_ELEM:
6533 dbg_exec("XC_INST_ARRAY[_ELEM]:");
6534 s = zbc_program_pushArray(code, &ip->inst_idx, inst);
6538 dbg_exec("BC_INST_LAST:");
6539 r.t = BC_RESULT_LAST;
6540 bc_vec_push(&G.prog.results, &r);
6546 dbg_exec("XC_INST_internalvar(%d):", inst - XC_INST_IBASE);
6547 xc_program_pushGlobal(inst);
6549 case XC_INST_SCALE_FUNC:
6550 case XC_INST_LENGTH:
6552 dbg_exec("BC_INST_builtin:");
6553 s = zxc_program_builtin(inst);
6556 dbg_exec("XC_INST_NUM:");
6557 r.t = XC_RESULT_CONSTANT;
6558 r.d.id.idx = xc_program_index(code, &ip->inst_idx);
6559 bc_vec_push(&G.prog.results, &r);
6562 dbg_exec("XC_INST_POP:");
6563 if (!STACK_HAS_MORE_THAN(&G.prog.results, 0))
6564 s = bc_error_stack_has_too_few_elements();
6566 bc_vec_pop(&G.prog.results);
6569 case XC_INST_PRINT_POP:
6570 case XC_INST_PRINT_STR:
6571 dbg_exec("XC_INST_PRINTxyz:");
6572 s = zxc_program_print(inst, 0);
6575 dbg_exec("XC_INST_STR:");
6576 r.t = XC_RESULT_STR;
6577 r.d.id.idx = xc_program_index(code, &ip->inst_idx);
6578 bc_vec_push(&G.prog.results, &r);
6581 case XC_INST_MULTIPLY:
6582 case XC_INST_DIVIDE:
6583 case XC_INST_MODULUS:
6586 dbg_exec("BC_INST_binaryop:");
6587 s = zxc_program_op(inst);
6589 case XC_INST_BOOL_NOT: {
6591 dbg_exec("XC_INST_BOOL_NOT:");
6592 s = zxc_program_prep(&ptr, &num);
6593 if (s) RETURN_STATUS(s);
6594 bc_num_init_DEF_SIZE(&r.d.n);
6595 if (bc_num_cmp(num, &G.prog.zero) == 0)
6597 //else bc_num_zero(&r.d.n); - already is
6598 xc_program_retire(&r, XC_RESULT_TEMP);
6602 dbg_exec("XC_INST_NEG:");
6603 s = zxc_program_negate();
6606 case BC_INST_ASSIGN_POWER:
6607 case BC_INST_ASSIGN_MULTIPLY:
6608 case BC_INST_ASSIGN_DIVIDE:
6609 case BC_INST_ASSIGN_MODULUS:
6610 case BC_INST_ASSIGN_PLUS:
6611 case BC_INST_ASSIGN_MINUS:
6613 case XC_INST_ASSIGN:
6614 dbg_exec("BC_INST_ASSIGNxyz:");
6615 s = zxc_program_assign(inst);
6618 case DC_INST_POP_EXEC:
6619 dbg_exec("DC_INST_POP_EXEC:");
6620 bc_vec_pop(&G.prog.exestack);
6621 goto read_updated_ip;
6622 case DC_INST_MODEXP:
6623 dbg_exec("DC_INST_MODEXP:");
6624 s = zdc_program_modexp();
6626 case DC_INST_DIVMOD:
6627 dbg_exec("DC_INST_DIVMOD:");
6628 s = zdc_program_divmod();
6630 case DC_INST_EXECUTE:
6631 case DC_INST_EXEC_COND:
6632 dbg_exec("DC_INST_EXEC[_COND]:");
6633 s = zdc_program_execStr(code, &ip->inst_idx, inst == DC_INST_EXEC_COND);
6634 goto read_updated_ip;
6635 case DC_INST_PRINT_STACK: {
6637 dbg_exec("DC_INST_PRINT_STACK:");
6638 for (idx = 0; idx < G.prog.results.len; ++idx) {
6639 s = zxc_program_print(XC_INST_PRINT, idx);
6644 case DC_INST_CLEAR_STACK:
6645 dbg_exec("DC_INST_CLEAR_STACK:");
6646 bc_vec_pop_all(&G.prog.results);
6648 case DC_INST_STACK_LEN:
6649 dbg_exec("DC_INST_STACK_LEN:");
6650 dc_program_stackLen();
6652 case DC_INST_DUPLICATE:
6653 dbg_exec("DC_INST_DUPLICATE:");
6654 if (!STACK_HAS_MORE_THAN(&G.prog.results, 0))
6655 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6656 ptr = bc_vec_top(&G.prog.results);
6657 dc_result_copy(&r, ptr);
6658 bc_vec_push(&G.prog.results, &r);
6660 case DC_INST_SWAP: {
6662 dbg_exec("DC_INST_SWAP:");
6663 if (!STACK_HAS_MORE_THAN(&G.prog.results, 1))
6664 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6665 ptr = bc_vec_item_rev(&G.prog.results, 0);
6666 ptr2 = bc_vec_item_rev(&G.prog.results, 1);
6667 memcpy(&r, ptr, sizeof(BcResult));
6668 memcpy(ptr, ptr2, sizeof(BcResult));
6669 memcpy(ptr2, &r, sizeof(BcResult));
6672 case DC_INST_ASCIIFY:
6673 dbg_exec("DC_INST_ASCIIFY:");
6674 s = zdc_program_asciify();
6676 case DC_INST_PRINT_STREAM:
6677 dbg_exec("DC_INST_PRINT_STREAM:");
6678 s = zdc_program_printStream();
6681 case DC_INST_PUSH_VAR: {
6682 bool copy = inst == DC_INST_LOAD;
6683 s = zxc_program_pushVar(code, &ip->inst_idx, true, copy);
6686 case DC_INST_PUSH_TO_VAR: {
6687 char *name = xc_program_name(code, &ip->inst_idx);
6688 s = zxc_program_popResultAndCopyToVar(name, true);
6693 dbg_exec("DC_INST_QUIT:");
6694 if (G.prog.exestack.len <= 2)
6695 QUIT_OR_RETURN_TO_MAIN;
6696 bc_vec_npop(&G.prog.exestack, 2);
6697 goto read_updated_ip;
6699 dbg_exec("DC_INST_NQUIT:");
6700 s = zdc_program_nquit();
6701 //goto read_updated_ip; - just fall through to it
6704 // Instruction stack has changed, read new pointers
6705 ip = bc_vec_top(&G.prog.exestack);
6706 func = xc_program_func(ip->func);
6707 code = func->code.v;
6708 dbg_exec("func:%zd bytes:%zd ip:%zd", ip->func, func->code.len, ip->inst_idx);
6711 if (s || G_interrupt) {
6719 RETURN_STATUS(BC_STATUS_SUCCESS);
6721 #define zxc_program_exec(...) (zxc_program_exec(__VA_ARGS__) COMMA_SUCCESS)
6723 static unsigned xc_vm_envLen(const char *var)
6729 len = BC_NUM_PRINT_WIDTH;
6730 if (!lenv) return len;
6732 len = bb_strtou(lenv, NULL, 10) - 1;
6733 if (errno || len < 2 || len >= INT_MAX)
6734 len = BC_NUM_PRINT_WIDTH;
6739 static BC_STATUS zxc_vm_process(const char *text)
6743 dbg_lex_enter("%s:%d entered", __func__, __LINE__);
6744 s = zxc_parse_text_init(text); // does the first zxc_lex_next()
6745 if (s) RETURN_STATUS(s);
6748 while (G.prs.lex != XC_LEX_EOF) {
6752 dbg_lex("%s:%d G.prs.lex:%d, parsing...", __func__, __LINE__, G.prs.lex);
6755 if (G.prs.lex == BC_LEX_SCOLON
6756 || G.prs.lex == XC_LEX_NLINE
6763 s = zbc_parse_stmt_or_funcdef();
6766 // Check that next token is a correct stmt delimiter -
6767 // disallows "print 1 print 2" and such.
6768 if (G.prs.lex != BC_LEX_SCOLON
6769 && G.prs.lex != XC_LEX_NLINE
6770 && G.prs.lex != XC_LEX_EOF
6772 bc_error_at("bad statement terminator");
6775 // The above logic is fragile. Check these examples:
6776 // - interactive read() still works
6780 s = zdc_parse_expr();
6783 if (s || G_interrupt) {
6785 xc_parse_reset(); // includes xc_program_reset()
6786 RETURN_STATUS(BC_STATUS_FAILURE);
6789 dbg_lex("%s:%d executing...", __func__, __LINE__);
6790 s = zxc_program_exec();
6796 ip = (void*)G.prog.exestack.v;
6798 if (G.prog.exestack.len != 1) // should have only main's IP
6799 bb_error_msg_and_die("BUG:call stack");
6800 if (ip->func != BC_PROG_MAIN)
6801 bb_error_msg_and_die("BUG:not MAIN");
6803 f = xc_program_func_BC_PROG_MAIN();
6804 // bc discards strings, constants and code after each
6805 // top-level statement in the "main program".
6806 // This prevents "yes 1 | bc" from growing its memory
6807 // without bound. This can be done because data stack
6808 // is empty and thus can't hold any references to
6809 // strings or constants, there is no generated code
6810 // which can hold references (after we discard one
6811 // we just executed). Code of functions can have references,
6812 // but bc stores function strings/constants in per-function
6816 if (G.prog.results.len != 0) // should be empty
6817 bb_error_msg_and_die("BUG:data stack");
6819 IF_BC(bc_vec_pop_all(&f->strs);)
6820 IF_BC(bc_vec_pop_all(&f->consts);)
6822 if (G.prog.results.len == 0
6823 && G.prog.vars.len == 0
6825 // If stack is empty and no registers exist (TODO: or they are all empty),
6826 // we can get rid of accumulated strings and constants.
6827 // In this example dc process should not grow
6828 // its memory consumption with time:
6830 IF_DC(bc_vec_pop_all(&G.prog.strs);)
6831 IF_DC(bc_vec_pop_all(&G.prog.consts);)
6833 // The code is discarded always (below), thus this example
6834 // should also not grow its memory consumption with time,
6835 // even though its data stack is not empty:
6836 // { echo 1; yes dk; } | dc
6838 // We drop generated and executed code for both bc and dc:
6839 bc_vec_pop_all(&f->code);
6843 dbg_lex_done("%s:%d done", __func__, __LINE__);
6846 #define zxc_vm_process(...) (zxc_vm_process(__VA_ARGS__) COMMA_SUCCESS)
6848 static BC_STATUS zxc_vm_execute_FILE(FILE *fp, const char *filename)
6850 // So far bc/dc have no way to include a file from another file,
6851 // therefore we know G.prs.lex_filename == NULL on entry
6852 //const char *sv_file;
6855 G.prs.lex_filename = filename;
6856 G.prs.lex_input_fp = fp;
6857 G.err_line = G.prs.lex_line = 1;
6858 dbg_lex("p->lex_line reset to 1");
6861 s = zxc_vm_process("");
6862 // We do not stop looping on errors here if reading stdin.
6863 // Example: start interactive bc and enter "return".
6864 // It should say "'return' not in a function"
6865 // but should not exit.
6866 } while (G.prs.lex_input_fp == stdin);
6867 G.prs.lex_filename = NULL;
6870 #define zxc_vm_execute_FILE(...) (zxc_vm_execute_FILE(__VA_ARGS__) COMMA_SUCCESS)
6872 static BC_STATUS zxc_vm_file(const char *file)
6877 fp = xfopen_for_read(file);
6878 s = zxc_vm_execute_FILE(fp, file);
6883 #define zxc_vm_file(...) (zxc_vm_file(__VA_ARGS__) COMMA_SUCCESS)
6886 static void bc_vm_info(void)
6888 printf("%s "BB_VER"\n"
6889 "Adapted from https://github.com/gavinhoward/bc\n"
6890 "Original code (c) 2018 Gavin D. Howard and contributors\n"
6894 static void bc_args(char **argv)
6900 #if ENABLE_FEATURE_BC_LONG_OPTIONS
6901 opts = option_mask32 |= getopt32long(argv, "wvsqli",
6902 "warn\0" No_argument "w"
6903 "version\0" No_argument "v"
6904 "standard\0" No_argument "s"
6905 "quiet\0" No_argument "q"
6906 "mathlib\0" No_argument "l"
6907 "interactive\0" No_argument "i"
6910 opts = option_mask32 |= getopt32(argv, "wvsqli");
6912 if (getenv("POSIXLY_CORRECT"))
6913 option_mask32 |= BC_FLAG_S;
6915 if (opts & BC_FLAG_V) {
6920 for (i = optind; argv[i]; ++i)
6921 bc_vec_push(&G.files, argv + i);
6924 static void bc_vm_envArgs(void)
6928 char *env_args = getenv("BC_ENV_ARGS");
6930 if (!env_args) return;
6932 G.env_args = xstrdup(env_args);
6935 bc_vec_init(&v, sizeof(char *), NULL);
6937 while (*(buf = skip_whitespace(buf)) != '\0') {
6938 bc_vec_push(&v, &buf);
6939 buf = skip_non_whitespace(buf);
6945 // NULL terminate, and pass argv[] so that first arg is argv[1]
6946 if (sizeof(int) == sizeof(char*)) {
6947 bc_vec_push(&v, &const_int_0);
6949 static char *const nullptr = NULL;
6950 bc_vec_push(&v, &nullptr);
6952 bc_args(((char **)v.v) - 1);
6957 static const char bc_lib[] ALIGN1 = {
6960 "\n" "auto b,s,n,r,d,i,p,f,v"
6961 ////////////////"if(x<0)return(1/e(-x))" // and drop 'n' and x<0 logic below
6962 //^^^^^^^^^^^^^^^^ this would work, and is even more precise than GNU bc:
6963 //e(-.998896): GNU:.36828580434569428695
6964 // above code:.36828580434569428696
6965 // actual value:.3682858043456942869594...
6966 // but for now let's be "GNU compatible"
6975 "\n" "scale=scale(x)+1"
6985 "\n" "for(i=2;v;++i){"
6991 "\n" "while(d--)r*=r"
6994 "\n" "if(n)return(1/r)"
6998 "\n" "auto b,s,r,p,a,q,i,v"
7002 "\n" "r=(1-10^scale)/1"
7013 "\n" "while(x<=.5){"
7017 "\n" "r=a=(x-1)/(x+1)"
7020 "\n" "for(i=3;v;i+=2){"
7031 "\n" "auto b,s,r,a,q,i"
7032 "\n" "if(x<0)return(-s(-x))"
7036 "\n" "scale=1.1*s+2"
7045 "\n" "for(i=3;a;i+=2){"
7046 "\n" "a*=q/(i*(i-1))"
7059 "\n" "x=s(2*a(1)+x)"
7065 "\n" "auto b,s,r,n,a,m,t,f,i,u"
7073 "\n" "if(scale<65){"
7074 "\n" "if(x==1)return(.7853981633974483096156608458198757210492923498437764552437361480/n)"
7075 "\n" "if(x==.2)return(.1973955598498807583700497651947902934475851037878521015176889402/n)"
7085 "\n" "x=(x-.2)/(1+.2*x)"
7090 "\n" "for(i=3;t;i+=2){"
7097 "\n" "return((m*a+r)/n)"
7099 "\n" "define j(n,x){"
7100 "\n" "auto b,s,o,a,i,v,f"
7111 "\n" "for(i=2;i<=n;++i)a*=i"
7113 "\n" "a=(x^n)/2^n/a"
7116 "\n" "scale+=length(a)-scale(a)"
7117 "\n" "for(i=1;v;++i){"
7118 "\n" "v=v*f/i/(n+i)"
7124 "\n" "return(a*r/1)"
7129 static BC_STATUS zxc_vm_exec(void)
7136 if (option_mask32 & BC_FLAG_L) {
7137 // We know that internal library is not buggy,
7138 // thus error checking is normally disabled.
7139 # define DEBUG_LIB 0
7140 s = zxc_vm_process(bc_lib);
7141 if (DEBUG_LIB && s) RETURN_STATUS(s);
7145 s = BC_STATUS_SUCCESS;
7146 fname = (void*)G.files.v;
7147 for (i = 0; i < G.files.len; i++) {
7148 s = zxc_vm_file(*fname++);
7149 if (ENABLE_FEATURE_CLEAN_UP && !G_ttyin && s) {
7150 // Debug config, non-interactive mode:
7151 // return all the way back to main.
7152 // Non-debug builds do not come here
7153 // in non-interactive mode, they exit.
7158 if (IS_BC || (option_mask32 & BC_FLAG_I))
7159 s = zxc_vm_execute_FILE(stdin, /*filename:*/ NULL);
7163 #define zxc_vm_exec(...) (zxc_vm_exec(__VA_ARGS__) COMMA_SUCCESS)
7165 #if ENABLE_FEATURE_CLEAN_UP
7166 static void xc_program_free(void)
7168 bc_vec_free(&G.prog.fns);
7169 IF_BC(bc_vec_free(&G.prog.fn_map);)
7170 bc_vec_free(&G.prog.vars);
7171 bc_vec_free(&G.prog.var_map);
7172 bc_vec_free(&G.prog.arrs);
7173 bc_vec_free(&G.prog.arr_map);
7174 IF_DC(bc_vec_free(&G.prog.strs);)
7175 IF_DC(bc_vec_free(&G.prog.consts);)
7176 bc_vec_free(&G.prog.results);
7177 bc_vec_free(&G.prog.exestack);
7178 IF_BC(bc_num_free(&G.prog.last);)
7179 //IF_BC(bc_num_free(&G.prog.zero);)
7180 IF_BC(bc_num_free(&G.prog.one);)
7181 bc_vec_free(&G.input_buffer);
7185 static void xc_program_init(void)
7189 // memset(&G.prog, 0, sizeof(G.prog)); - already is
7190 memset(&ip, 0, sizeof(BcInstPtr));
7192 // G.prog.nchars = G.prog.scale = 0; - already is
7196 IF_BC(bc_num_init_DEF_SIZE(&G.prog.last);)
7197 //IF_BC(bc_num_zero(&G.prog.last);) - already is
7199 //bc_num_init_DEF_SIZE(&G.prog.zero); - not needed
7200 //bc_num_zero(&G.prog.zero); - already is
7202 IF_BC(bc_num_init_DEF_SIZE(&G.prog.one);)
7203 IF_BC(bc_num_one(&G.prog.one);)
7205 bc_vec_init(&G.prog.fns, sizeof(BcFunc), bc_func_free);
7206 IF_BC(bc_vec_init(&G.prog.fn_map, sizeof(BcId), bc_id_free);)
7209 // Names are chosen simply to be distinct and never match
7210 // a valid function name (and be short)
7211 IF_BC(bc_program_addFunc(xstrdup(""))); // func #0: main
7212 IF_BC(bc_program_addFunc(xstrdup("1"))); // func #1: for read()
7214 // in dc, functions have no names
7215 xc_program_add_fn();
7216 xc_program_add_fn();
7219 bc_vec_init(&G.prog.vars, sizeof(BcVec), bc_vec_free);
7220 bc_vec_init(&G.prog.var_map, sizeof(BcId), bc_id_free);
7222 bc_vec_init(&G.prog.arrs, sizeof(BcVec), bc_vec_free);
7223 bc_vec_init(&G.prog.arr_map, sizeof(BcId), bc_id_free);
7225 IF_DC(bc_vec_init(&G.prog.strs, sizeof(char *), bc_string_free);)
7226 IF_DC(bc_vec_init(&G.prog.consts, sizeof(char *), bc_string_free);)
7227 bc_vec_init(&G.prog.results, sizeof(BcResult), bc_result_free);
7228 bc_vec_init(&G.prog.exestack, sizeof(BcInstPtr), NULL);
7229 bc_vec_push(&G.prog.exestack, &ip);
7231 bc_char_vec_init(&G.input_buffer);
7234 static int xc_vm_init(const char *env_len)
7236 G.prog.len = xc_vm_envLen(env_len);
7237 #if ENABLE_FEATURE_EDITING
7238 G.line_input_state = new_line_input_t(DO_HISTORY);
7240 bc_vec_init(&G.files, sizeof(char *), NULL);
7243 IF_BC(if (IS_BC) bc_vm_envArgs();)
7244 xc_parse_create(BC_PROG_MAIN);
7246 //TODO: in GNU bc, the check is (isatty(0) && isatty(1)),
7247 //-i option unconditionally enables this regardless of isatty():
7249 #if ENABLE_FEATURE_BC_INTERACTIVE
7251 // With SA_RESTART, most system calls will restart
7252 // (IOW: they won't fail with EINTR).
7253 // In particular, this means ^C won't cause
7254 // stdout to get into "error state" if SIGINT hits
7255 // within write() syscall.
7257 // The downside is that ^C while tty input is taken
7258 // will only be handled after [Enter] since read()
7259 // from stdin is not interrupted by ^C either,
7260 // it restarts, thus fgetc() does not return on ^C.
7261 // (This problem manifests only if line editing is disabled)
7262 signal_SA_RESTART_empty_mask(SIGINT, record_signo);
7264 // Without SA_RESTART, this exhibits a bug:
7265 // "while (1) print 1" and try ^C-ing it.
7266 // Intermittently, instead of returning to input line,
7267 // you'll get "output error: Interrupted system call"
7269 //signal_no_SA_RESTART_empty_mask(SIGINT, record_signo);
7273 return 0; // "not a tty"
7276 static BcStatus xc_vm_run(void)
7278 BcStatus st = zxc_vm_exec();
7279 #if ENABLE_FEATURE_CLEAN_UP
7280 if (G_exiting) // it was actually "halt" or "quit"
7283 bc_vec_free(&G.files);
7287 # if ENABLE_FEATURE_EDITING
7288 free_line_input_t(G.line_input_state);
7292 dbg_exec("exiting with exitcode %d", st);
7297 int bc_main(int argc, char **argv) MAIN_EXTERNALLY_VISIBLE;
7298 int bc_main(int argc UNUSED_PARAM, char **argv)
7304 is_tty = xc_vm_init("BC_LINE_LENGTH");
7308 if (is_tty && !(option_mask32 & BC_FLAG_Q))
7316 int dc_main(int argc, char **argv) MAIN_EXTERNALLY_VISIBLE;
7317 int dc_main(int argc UNUSED_PARAM, char **argv)
7323 // TODO: dc (GNU bc 1.07.1) 1.4.1 seems to use width
7324 // 1 char wider than bc from the same package.
7325 // Both default width, and xC_LINE_LENGTH=N are wider:
7326 // "DC_LINE_LENGTH=5 dc -e'123456 p'" prints:
7329 // "echo '123456' | BC_LINE_LENGTH=5 bc" prints:
7332 // Do the same, or it's a bug?
7333 xc_vm_init("DC_LINE_LENGTH");
7335 // Run -e'SCRIPT' and -fFILE in order of appearance, then handle FILEs
7336 noscript = BC_FLAG_I;
7338 int n = getopt(argc, argv, "e:f:x");
7344 n = zxc_vm_process(optarg);
7349 n = zxc_vm_file(optarg);
7353 option_mask32 |= DC_FLAG_X;
7363 bc_vec_push(&G.files, argv++);
7366 option_mask32 |= noscript; // set BC_FLAG_I if we need to interpret stdin