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 {
381 IF_BC(size_t results_len_before_call;)
384 typedef enum BcLexType {
395 XC_LEX_NEG = XC_LEX_1st_op, // order
397 XC_LEX_OP_REL_EQ, // should
398 XC_LEX_OP_REL_LE, // match
399 XC_LEX_OP_REL_GE, // INST
400 XC_LEX_OP_REL_NE, // constants
401 XC_LEX_OP_REL_LT, // for
402 XC_LEX_OP_REL_GT, // these
404 XC_LEX_OP_POWER, // operations
405 XC_LEX_OP_MULTIPLY, // |
406 XC_LEX_OP_DIVIDE, // |
407 XC_LEX_OP_MODULUS, // |
409 XC_LEX_OP_MINUS, // |
410 XC_LEX_OP_last = XC_LEX_OP_MINUS,
412 BC_LEX_OP_BOOL_NOT, // |
413 BC_LEX_OP_BOOL_OR, // |
414 BC_LEX_OP_BOOL_AND, // |
416 BC_LEX_OP_ASSIGN_POWER, // |
417 BC_LEX_OP_ASSIGN_MULTIPLY, // |
418 BC_LEX_OP_ASSIGN_DIVIDE, // |
419 BC_LEX_OP_ASSIGN_MODULUS, // |
420 BC_LEX_OP_ASSIGN_PLUS, // |
421 BC_LEX_OP_ASSIGN_MINUS, // |
423 BC_LEX_OP_ASSIGN, // V
428 BC_LEX_LPAREN, // () are 0x28 and 0x29
429 BC_LEX_RPAREN, // must be LPAREN+1: code uses (c - '(' + BC_LEX_LPAREN)
431 BC_LEX_LBRACKET, // [] are 0x5B and 0x5D
433 BC_LEX_RBRACKET, // must be LBRACKET+2: code uses (c - '[' + BC_LEX_LBRACKET)
435 BC_LEX_LBRACE, // {} are 0x7B and 0x7D
437 BC_LEX_RBRACE, // must be LBRACE+2: code uses (c - '{' + BC_LEX_LBRACE)
439 BC_LEX_KEY_1st_keyword,
440 BC_LEX_KEY_AUTO = BC_LEX_KEY_1st_keyword,
447 // code uses "type - BC_LEX_KEY_IBASE + XC_INST_IBASE" construct,
448 BC_LEX_KEY_IBASE, // relative order should match for: XC_INST_IBASE
449 BC_LEX_KEY_OBASE, // relative order should match for: XC_INST_OBASE
451 BC_LEX_KEY_LAST, // relative order should match for: BC_INST_LAST
464 DC_LEX_OP_BOOL_NOT = XC_LEX_OP_last + 1,
496 // code uses "t - DC_LEX_STORE_IBASE + XC_INST_IBASE" construct,
497 DC_LEX_STORE_IBASE, // relative order should match for: XC_INST_IBASE
498 DC_LEX_STORE_OBASE, // relative order should match for: XC_INST_OBASE
499 DC_LEX_STORE_SCALE, // relative order should match for: XC_INST_SCALE
508 // must match order of BC_LEX_KEY_foo etc above
510 struct BcLexKeyword {
513 #define LEX_KW_ENTRY(a, b) \
514 { .name8 = a /*, .posix = b */ }
515 static const struct BcLexKeyword bc_lex_kws[20] = {
516 LEX_KW_ENTRY("auto" , 1), // 0
517 LEX_KW_ENTRY("break" , 1), // 1
518 LEX_KW_ENTRY("continue", 0), // 2 note: this one has no terminating NUL
519 LEX_KW_ENTRY("define" , 1), // 3
520 LEX_KW_ENTRY("else" , 0), // 4
521 LEX_KW_ENTRY("for" , 1), // 5
522 LEX_KW_ENTRY("halt" , 0), // 6
523 LEX_KW_ENTRY("ibase" , 1), // 7
524 LEX_KW_ENTRY("obase" , 1), // 8
525 LEX_KW_ENTRY("if" , 1), // 9
526 LEX_KW_ENTRY("last" , 0), // 10
527 LEX_KW_ENTRY("length" , 1), // 11
528 LEX_KW_ENTRY("limits" , 0), // 12
529 LEX_KW_ENTRY("print" , 0), // 13
530 LEX_KW_ENTRY("quit" , 1), // 14
531 LEX_KW_ENTRY("read" , 0), // 15
532 LEX_KW_ENTRY("return" , 1), // 16
533 LEX_KW_ENTRY("scale" , 1), // 17
534 LEX_KW_ENTRY("sqrt" , 1), // 18
535 LEX_KW_ENTRY("while" , 1), // 19
538 #define STRING_else (bc_lex_kws[4].name8)
539 #define STRING_for (bc_lex_kws[5].name8)
540 #define STRING_if (bc_lex_kws[9].name8)
541 #define STRING_while (bc_lex_kws[19].name8)
565 #define keyword_is_POSIX(i) ((1 << (i)) & POSIX_KWORD_MASK)
567 // This is a bit array that corresponds to token types. An entry is
568 // true if the token is valid in an expression, false otherwise.
569 // Used to figure out when expr parsing should stop *without error message*
570 // - 0 element indicates this condition. 1 means "this token is to be eaten
571 // as part of the expression", it can then still be determined to be invalid
572 // by later processing.
574 #define EXBITS(a,b,c,d,e,f,g,h) \
575 ((uint64_t)((a << 0)+(b << 1)+(c << 2)+(d << 3)+(e << 4)+(f << 5)+(g << 6)+(h << 7)))
576 BC_PARSE_EXPRS_BITS = 0 // corresponding BC_LEX_xyz:
577 + (EXBITS(0,0,0,0,0,1,1,1) << (0*8)) // 0: EOF INVAL NL WS STR NAME NUM -
578 + (EXBITS(1,1,1,1,1,1,1,1) << (1*8)) // 8: == <= >= != < > ^ *
579 + (EXBITS(1,1,1,1,1,1,1,1) << (2*8)) // 16: / % + - ! || && ^=
580 + (EXBITS(1,1,1,1,1,1,1,1) << (3*8)) // 24: *= /= %= += -= = ++ --
581 + (EXBITS(1,1,0,0,0,0,0,0) << (4*8)) // 32: ( ) [ , ] { ; }
582 + (EXBITS(0,0,0,0,0,0,0,1) << (5*8)) // 40: auto break cont define else for halt ibase
583 + (EXBITS(1,0,1,1,0,0,0,1) << (6*8)) // 48: obase if last length limits print quit read
584 + (EXBITS(0,1,1,0,0,0,0,0) << (7*8)) // 56: return scale sqrt while
587 static ALWAYS_INLINE long lex_allowed_in_bc_expr(unsigned i)
589 #if ULONG_MAX > 0xffffffff
590 // 64-bit version (will not work correctly for 32-bit longs!)
591 return BC_PARSE_EXPRS_BITS & (1UL << i);
594 unsigned long m = (uint32_t)BC_PARSE_EXPRS_BITS;
596 m = (uint32_t)(BC_PARSE_EXPRS_BITS >> 32);
599 return m & (1UL << i);
603 // This is an array of data for operators that correspond to
604 // [XC_LEX_1st_op...] token types.
605 static const uint8_t bc_ops_prec_and_assoc[] ALIGN1 = {
606 #define OP(p,l) ((int)(l) * 0x10 + (p))
608 OP(6, true ), OP( 6, true ), OP( 6, true ), OP( 6, true ), OP( 6, true ), OP( 6, true ), // == <= >= != < >
610 OP(3, true ), OP( 3, true ), OP( 3, true ), // mul div mod
611 OP(4, true ), OP( 4, true ), // + -
613 OP(7, true ), OP( 7, true ), // or and
614 OP(5, false), OP( 5, false ), OP( 5, false ), OP( 5, false ), OP( 5, false ), // ^= *= /= %= +=
615 OP(5, false), OP( 5, false ), // -= =
616 OP(0, false), OP( 0, false ), // inc dec
619 #define bc_operation_PREC(i) (bc_ops_prec_and_assoc[i] & 0x0f)
620 #define bc_operation_LEFT(i) (bc_ops_prec_and_assoc[i] & 0x10)
624 static const //BcLexType - should be this type
626 dc_char_to_LEX[] ALIGN1 = {
628 XC_LEX_OP_MODULUS, XC_LEX_INVALID, XC_LEX_INVALID, DC_LEX_LPAREN,
630 XC_LEX_INVALID, XC_LEX_OP_MULTIPLY, XC_LEX_OP_PLUS, XC_LEX_INVALID,
632 XC_LEX_OP_MINUS, XC_LEX_INVALID, XC_LEX_OP_DIVIDE,
634 XC_LEX_INVALID, XC_LEX_INVALID, XC_LEX_INVALID, XC_LEX_INVALID,
635 XC_LEX_INVALID, XC_LEX_INVALID, XC_LEX_INVALID, XC_LEX_INVALID,
636 XC_LEX_INVALID, XC_LEX_INVALID,
638 DC_LEX_COLON, DC_LEX_SCOLON, XC_LEX_OP_REL_GT, XC_LEX_OP_REL_EQ,
639 XC_LEX_OP_REL_LT, DC_LEX_READ, XC_LEX_INVALID,
641 XC_LEX_INVALID, XC_LEX_INVALID, XC_LEX_INVALID, XC_LEX_INVALID,
642 XC_LEX_INVALID, XC_LEX_INVALID, DC_LEX_EQ_NO_REG, XC_LEX_INVALID,
644 DC_LEX_IBASE, XC_LEX_INVALID, DC_LEX_SCALE, DC_LEX_LOAD_POP,
645 XC_LEX_INVALID, DC_LEX_OP_BOOL_NOT, DC_LEX_OBASE, DC_LEX_PRINT_STREAM,
647 DC_LEX_NQUIT, DC_LEX_POP, DC_LEX_STORE_PUSH, XC_LEX_INVALID, XC_LEX_INVALID,
648 XC_LEX_INVALID, XC_LEX_INVALID, DC_LEX_SCALE_FACTOR, XC_LEX_INVALID,
650 DC_LEX_LENGTH, XC_LEX_INVALID, XC_LEX_INVALID, XC_LEX_INVALID,
652 XC_LEX_OP_POWER, XC_LEX_NEG, XC_LEX_INVALID,
654 DC_LEX_ASCIIFY, XC_LEX_INVALID, DC_LEX_CLEAR_STACK, DC_LEX_DUPLICATE,
655 DC_LEX_ELSE, DC_LEX_PRINT_STACK, XC_LEX_INVALID, XC_LEX_INVALID,
657 DC_LEX_STORE_IBASE, XC_LEX_INVALID, DC_LEX_STORE_SCALE, DC_LEX_LOAD,
658 XC_LEX_INVALID, DC_LEX_PRINT_POP, DC_LEX_STORE_OBASE, DC_LEX_PRINT,
660 DC_LEX_QUIT, DC_LEX_SWAP, DC_LEX_OP_ASSIGN, XC_LEX_INVALID,
661 XC_LEX_INVALID, DC_LEX_SQRT, XC_LEX_INVALID, DC_LEX_EXECUTE,
663 XC_LEX_INVALID, DC_LEX_STACK_LEVEL,
665 DC_LEX_LBRACE, DC_LEX_OP_MODEXP, XC_LEX_INVALID, DC_LEX_OP_DIVMOD,
667 static const //BcInst - should be this type. Using signed narrow type since DC_INST_INVALID is -1
669 dc_LEX_to_INST[] ALIGN1 = { //starts at XC_LEX_OP_POWER // corresponding XC/DC_LEX_xyz:
670 XC_INST_POWER, XC_INST_MULTIPLY, // XC_LEX_OP_POWER XC_LEX_OP_MULTIPLY
671 XC_INST_DIVIDE, XC_INST_MODULUS, // XC_LEX_OP_DIVIDE XC_LEX_OP_MODULUS
672 XC_INST_PLUS, XC_INST_MINUS, // XC_LEX_OP_PLUS XC_LEX_OP_MINUS
673 XC_INST_BOOL_NOT, // DC_LEX_OP_BOOL_NOT
674 DC_INST_INVALID, // DC_LEX_OP_ASSIGN
675 XC_INST_REL_GT, // DC_LEX_LPAREN
676 DC_INST_INVALID, // DC_LEX_SCOLON
677 DC_INST_INVALID, // DC_LEX_READ
678 XC_INST_IBASE, // DC_LEX_IBASE
679 XC_INST_SCALE, // DC_LEX_SCALE
680 XC_INST_OBASE, // DC_LEX_OBASE
681 XC_INST_LENGTH, // DC_LEX_LENGTH
682 XC_INST_PRINT, // DC_LEX_PRINT
683 DC_INST_QUIT, // DC_LEX_QUIT
684 XC_INST_SQRT, // DC_LEX_SQRT
685 XC_INST_REL_GE, // DC_LEX_LBRACE
686 XC_INST_REL_EQ, // DC_LEX_EQ_NO_REG
687 DC_INST_MODEXP, DC_INST_DIVMOD, // DC_LEX_OP_MODEXP DC_LEX_OP_DIVMOD
688 DC_INST_INVALID, DC_INST_INVALID, // DC_LEX_COLON DC_LEX_ELSE
689 DC_INST_EXECUTE, // DC_LEX_EXECUTE
690 DC_INST_PRINT_STACK, DC_INST_CLEAR_STACK, // DC_LEX_PRINT_STACK DC_LEX_CLEAR_STACK
691 DC_INST_STACK_LEN, DC_INST_DUPLICATE, // DC_LEX_STACK_LEVEL DC_LEX_DUPLICATE
692 DC_INST_SWAP, XC_INST_POP, // DC_LEX_SWAP DC_LEX_POP
693 DC_INST_ASCIIFY, DC_INST_PRINT_STREAM, // DC_LEX_ASCIIFY DC_LEX_PRINT_STREAM
694 DC_INST_INVALID, DC_INST_INVALID, // DC_LEX_STORE_IBASE DC_LEX_STORE_OBASE
695 DC_INST_INVALID, DC_INST_INVALID, // DC_LEX_STORE_SCALE DC_LEX_LOAD
696 DC_INST_INVALID, DC_INST_INVALID, // DC_LEX_LOAD_POP DC_LEX_STORE_PUSH
697 XC_INST_PRINT, DC_INST_NQUIT, // DC_LEX_PRINT_POP DC_LEX_NQUIT
698 XC_INST_SCALE_FUNC, // DC_LEX_SCALE_FACTOR
699 // DC_INST_INVALID in this table either means that corresponding LEX
700 // is not possible for dc, or that it does not compile one-to-one
705 typedef struct BcParse {
706 smallint lex; // was BcLexType // first member is most used
707 smallint lex_last; // was BcLexType
709 const char *lex_inbuf;
710 const char *lex_next_at; // last lex_next() was called at this string
711 const char *lex_filename;
717 IF_BC(size_t in_funcdef;)
723 typedef struct BcProgram {
752 BcParse prs; // first member is most used
754 // For error messages. Can be set to current parsed line,
755 // or [TODO] to current executing line (can be before last parsed one)
760 IF_FEATURE_BC_INTERACTIVE(smallint ttyin;)
761 IF_FEATURE_CLEAN_UP(smallint exiting;)
769 #if ENABLE_FEATURE_EDITING
770 line_input_t *line_input_state;
773 #define G (*ptr_to_globals)
774 #define INIT_G() do { \
775 SET_PTR_TO_GLOBALS(xzalloc(sizeof(G))); \
777 #define FREE_G() do { \
778 FREE_PTR_TO_GLOBALS(); \
780 #define G_posix (ENABLE_BC && (option_mask32 & BC_FLAG_S))
781 #define G_warn (ENABLE_BC && (option_mask32 & BC_FLAG_W))
782 #define G_exreg (ENABLE_DC && (option_mask32 & DC_FLAG_X))
783 #if ENABLE_FEATURE_BC_INTERACTIVE
784 # define G_interrupt bb_got_signal
785 # define G_ttyin G.ttyin
787 # define G_interrupt 0
790 #if ENABLE_FEATURE_CLEAN_UP
791 # define G_exiting G.exiting
795 #define IS_BC (ENABLE_BC && (!ENABLE_DC || applet_name[0] == 'b'))
796 #define IS_DC (ENABLE_DC && (!ENABLE_BC || applet_name[0] != 'b'))
799 # define BC_PARSE_REL (1 << 0)
800 # define BC_PARSE_PRINT (1 << 1)
801 # define BC_PARSE_ARRAY (1 << 2)
802 # define BC_PARSE_NOCALL (1 << 3)
805 #define BC_PROG_MAIN 0
806 #define BC_PROG_READ 1
808 #define BC_PROG_REQ_FUNCS 2
811 #define BC_FLAG_W (1 << 0)
812 #define BC_FLAG_V (1 << 1)
813 #define BC_FLAG_S (1 << 2)
814 #define BC_FLAG_Q (1 << 3)
815 #define BC_FLAG_L (1 << 4)
816 #define BC_FLAG_I ((1 << 5) * ENABLE_DC)
817 #define DC_FLAG_X ((1 << 6) * ENABLE_DC)
819 #define BC_MAX_OBASE ((unsigned) 999)
820 #define BC_MAX_DIM ((unsigned) INT_MAX)
821 #define BC_MAX_SCALE ((unsigned) UINT_MAX)
822 #define BC_MAX_STRING ((unsigned) UINT_MAX - 1)
823 #define BC_MAX_NUM BC_MAX_STRING
824 // Unused apart from "limits" message. Just show a "biggish number" there.
825 //#define BC_MAX_NAME BC_MAX_STRING
826 //#define BC_MAX_EXP ((unsigned long) LONG_MAX)
827 //#define BC_MAX_VARS ((unsigned long) SIZE_MAX - 1)
828 #define BC_MAX_NAME_STR "999999999"
829 #define BC_MAX_EXP_STR "999999999"
830 #define BC_MAX_VARS_STR "999999999"
832 #define BC_MAX_OBASE_STR "999"
834 #if INT_MAX == 2147483647
835 # define BC_MAX_DIM_STR "2147483647"
836 #elif INT_MAX == 9223372036854775807
837 # define BC_MAX_DIM_STR "9223372036854775807"
839 # error Strange INT_MAX
842 #if UINT_MAX == 4294967295
843 # define BC_MAX_SCALE_STR "4294967295"
844 # define BC_MAX_STRING_STR "4294967294"
845 #elif UINT_MAX == 18446744073709551615
846 # define BC_MAX_SCALE_STR "18446744073709551615"
847 # define BC_MAX_STRING_STR "18446744073709551614"
849 # error Strange UINT_MAX
851 #define BC_MAX_NUM_STR BC_MAX_STRING_STR
853 // In configurations where errors abort instead of propagating error
854 // return code up the call chain, functions returning BC_STATUS
855 // actually don't return anything, they always succeed and return "void".
856 // A macro wrapper is provided, which makes this statement work:
858 // and makes it visible to the compiler that s is always zero,
859 // allowing compiler to optimize dead code after the statement.
861 // To make code more readable, each such function has a "z"
862 // ("always returning zero") prefix, i.e. zbc_foo or zdc_foo.
864 #if ENABLE_FEATURE_BC_INTERACTIVE || ENABLE_FEATURE_CLEAN_UP
865 # define ERRORS_ARE_FATAL 0
866 # define ERRORFUNC /*nothing*/
867 # define IF_ERROR_RETURN_POSSIBLE(a) a
868 # define BC_STATUS BcStatus
869 # define RETURN_STATUS(v) return (v)
870 # define COMMA_SUCCESS /*nothing*/
872 # define ERRORS_ARE_FATAL 1
873 # define ERRORFUNC NORETURN
874 # define IF_ERROR_RETURN_POSSIBLE(a) /*nothing*/
875 # define BC_STATUS void
876 # define RETURN_STATUS(v) do { ((void)(v)); return; } while (0)
877 # define COMMA_SUCCESS ,BC_STATUS_SUCCESS
884 #define BC_MAX(a, b) ((a) > (b) ? (a) : (b))
885 #define BC_MIN(a, b) ((a) < (b) ? (a) : (b))
887 static void fflush_and_check(void)
890 if (ferror(stdout) || ferror(stderr))
891 bb_perror_msg_and_die("output error");
894 #if ENABLE_FEATURE_CLEAN_UP
895 #define QUIT_OR_RETURN_TO_MAIN \
897 IF_FEATURE_BC_INTERACTIVE(G_ttyin = 0;) /* do not loop in main loop anymore */ \
899 return BC_STATUS_FAILURE; \
902 static void quit(void) NORETURN;
903 static void quit(void)
906 bb_perror_msg_and_die("input error");
908 dbg_exec("quit(): exiting with exitcode SUCCESS");
911 #define QUIT_OR_RETURN_TO_MAIN quit()
914 static void bc_verror_msg(const char *fmt, va_list p)
916 const char *sv = sv; // for compiler
917 if (G.prs.lex_filename) {
919 applet_name = xasprintf("%s: %s:%lu", applet_name,
920 G.prs.lex_filename, (unsigned long)G.err_line
923 bb_verror_msg(fmt, p, NULL);
924 if (G.prs.lex_filename) {
925 free((char*)applet_name);
930 static NOINLINE ERRORFUNC int bc_error_fmt(const char *fmt, ...)
935 bc_verror_msg(fmt, p);
938 if (ENABLE_FEATURE_CLEAN_UP || G_ttyin)
939 IF_ERROR_RETURN_POSSIBLE(return BC_STATUS_FAILURE);
944 static NOINLINE BC_STATUS zbc_posix_error_fmt(const char *fmt, ...)
948 // Are non-POSIX constructs totally ok?
949 if (!(option_mask32 & (BC_FLAG_S|BC_FLAG_W)))
950 RETURN_STATUS(BC_STATUS_SUCCESS); // yes
953 bc_verror_msg(fmt, p);
956 // Do we treat non-POSIX constructs as errors?
957 if (!(option_mask32 & BC_FLAG_S))
958 RETURN_STATUS(BC_STATUS_SUCCESS); // no, it's a warning
960 if (ENABLE_FEATURE_CLEAN_UP || G_ttyin)
961 RETURN_STATUS(BC_STATUS_FAILURE);
964 #define zbc_posix_error_fmt(...) (zbc_posix_error_fmt(__VA_ARGS__) COMMA_SUCCESS)
967 // We use error functions with "return bc_error(FMT[, PARAMS])" idiom.
968 // This idiom begs for tail-call optimization, but for it to work,
969 // function must not have caller-cleaned parameters on stack.
970 // Unfortunately, vararg function API does exactly that on most arches.
971 // Thus, use these shims for the cases when we have no vararg PARAMS:
972 static ERRORFUNC int bc_error(const char *msg)
974 IF_ERROR_RETURN_POSSIBLE(return) bc_error_fmt("%s", msg);
976 static ERRORFUNC int bc_error_at(const char *msg)
978 const char *err_at = G.prs.lex_next_at;
980 IF_ERROR_RETURN_POSSIBLE(return) bc_error_fmt(
983 (int)(strchrnul(err_at, '\n') - err_at),
987 IF_ERROR_RETURN_POSSIBLE(return) bc_error_fmt("%s", msg);
989 static ERRORFUNC int bc_error_bad_character(char c)
992 IF_ERROR_RETURN_POSSIBLE(return) bc_error("NUL character");
993 IF_ERROR_RETURN_POSSIBLE(return) bc_error_fmt("bad character '%c'", c);
995 static ERRORFUNC int bc_error_bad_function_definition(void)
997 IF_ERROR_RETURN_POSSIBLE(return) bc_error_at("bad function definition");
999 static ERRORFUNC int bc_error_bad_expression(void)
1001 IF_ERROR_RETURN_POSSIBLE(return) bc_error_at("bad expression");
1003 static ERRORFUNC int bc_error_bad_assignment(void)
1005 IF_ERROR_RETURN_POSSIBLE(return) bc_error_at(
1006 "bad assignment: left side must be variable or array element"
1009 static ERRORFUNC int bc_error_bad_token(void)
1011 IF_ERROR_RETURN_POSSIBLE(return) bc_error_at("bad token");
1013 static ERRORFUNC int bc_error_stack_has_too_few_elements(void)
1015 IF_ERROR_RETURN_POSSIBLE(return) bc_error("stack has too few elements");
1017 static ERRORFUNC int bc_error_variable_is_wrong_type(void)
1019 IF_ERROR_RETURN_POSSIBLE(return) bc_error("variable is wrong type");
1022 static BC_STATUS zbc_POSIX_requires(const char *msg)
1024 RETURN_STATUS(zbc_posix_error_fmt("POSIX requires %s", msg));
1026 #define zbc_POSIX_requires(...) (zbc_POSIX_requires(__VA_ARGS__) COMMA_SUCCESS)
1027 static BC_STATUS zbc_POSIX_does_not_allow(const char *msg)
1029 RETURN_STATUS(zbc_posix_error_fmt("%s%s", "POSIX does not allow ", msg));
1031 #define zbc_POSIX_does_not_allow(...) (zbc_POSIX_does_not_allow(__VA_ARGS__) COMMA_SUCCESS)
1032 static BC_STATUS zbc_POSIX_does_not_allow_bool_ops_this_is_bad(const char *msg)
1034 RETURN_STATUS(zbc_posix_error_fmt("%s%s %s", "POSIX does not allow ", "boolean operators; this is bad:", msg));
1036 #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)
1037 static BC_STATUS zbc_POSIX_does_not_allow_empty_X_expression_in_for(const char *msg)
1039 RETURN_STATUS(zbc_posix_error_fmt("%san empty %s expression in 'for()'", "POSIX does not allow ", msg));
1041 #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)
1044 static void bc_vec_grow(BcVec *v, size_t n)
1046 size_t cap = v->cap * 2;
1047 while (cap < v->len + n) cap *= 2;
1048 v->v = xrealloc(v->v, v->size * cap);
1052 static void bc_vec_init(BcVec *v, size_t esize, BcVecFree dtor)
1055 v->cap = BC_VEC_START_CAP;
1058 v->v = xmalloc(esize * BC_VEC_START_CAP);
1061 static void bc_char_vec_init(BcVec *v)
1063 bc_vec_init(v, sizeof(char), NULL);
1066 static void bc_vec_expand(BcVec *v, size_t req)
1069 v->v = xrealloc(v->v, v->size * req);
1074 static void bc_vec_pop(BcVec *v)
1078 v->dtor(v->v + (v->size * v->len));
1081 static void bc_vec_npop(BcVec *v, size_t n)
1086 size_t len = v->len - n;
1087 while (v->len > len) v->dtor(v->v + (v->size * --v->len));
1091 static void bc_vec_pop_all(BcVec *v)
1093 bc_vec_npop(v, v->len);
1096 static size_t bc_vec_push(BcVec *v, const void *data)
1098 size_t len = v->len;
1099 if (len >= v->cap) bc_vec_grow(v, 1);
1100 memmove(v->v + (v->size * len), data, v->size);
1105 // G.prog.results often needs "pop old operand, push result" idiom.
1106 // Can do this without a few extra ops
1107 static size_t bc_result_pop_and_push(const void *data)
1109 BcVec *v = &G.prog.results;
1111 size_t len = v->len - 1;
1113 last = v->v + (v->size * len);
1116 memmove(last, data, v->size);
1120 static size_t bc_vec_pushByte(BcVec *v, char data)
1122 return bc_vec_push(v, &data);
1125 static size_t bc_vec_pushZeroByte(BcVec *v)
1127 //return bc_vec_pushByte(v, '\0');
1129 return bc_vec_push(v, &const_int_0);
1132 static void bc_vec_pushAt(BcVec *v, const void *data, size_t idx)
1135 bc_vec_push(v, data);
1139 if (v->len == v->cap) bc_vec_grow(v, 1);
1141 ptr = v->v + v->size * idx;
1143 memmove(ptr + v->size, ptr, v->size * (v->len++ - idx));
1144 memmove(ptr, data, v->size);
1148 static void bc_vec_string(BcVec *v, size_t len, const char *str)
1151 bc_vec_expand(v, len + 1);
1152 memcpy(v->v, str, len);
1155 bc_vec_pushZeroByte(v);
1158 static void *bc_vec_item(const BcVec *v, size_t idx)
1160 return v->v + v->size * idx;
1163 static void *bc_vec_item_rev(const BcVec *v, size_t idx)
1165 return v->v + v->size * (v->len - idx - 1);
1168 static void *bc_vec_top(const BcVec *v)
1170 return v->v + v->size * (v->len - 1);
1173 static FAST_FUNC void bc_vec_free(void *vec)
1175 BcVec *v = (BcVec *) vec;
1180 static BcFunc* xc_program_func(size_t idx)
1182 return bc_vec_item(&G.prog.fns, idx);
1184 // BC_PROG_MAIN is zeroth element, so:
1185 #define xc_program_func_BC_PROG_MAIN() ((BcFunc*)(G.prog.fns.v))
1188 static BcFunc* bc_program_current_func(void)
1190 BcInstPtr *ip = bc_vec_top(&G.prog.exestack);
1191 BcFunc *func = xc_program_func(ip->func);
1196 static char** xc_program_str(size_t idx)
1200 BcFunc *func = bc_program_current_func();
1201 return bc_vec_item(&func->strs, idx);
1204 IF_DC(return bc_vec_item(&G.prog.strs, idx);)
1207 static char** xc_program_const(size_t idx)
1211 BcFunc *func = bc_program_current_func();
1212 return bc_vec_item(&func->consts, idx);
1215 IF_DC(return bc_vec_item(&G.prog.consts, idx);)
1218 static int bc_id_cmp(const void *e1, const void *e2)
1220 return strcmp(((const BcId *) e1)->name, ((const BcId *) e2)->name);
1223 static FAST_FUNC void bc_id_free(void *id)
1225 free(((BcId *) id)->name);
1228 static size_t bc_map_find_ge(const BcVec *v, const void *ptr)
1230 size_t low = 0, high = v->len;
1232 while (low < high) {
1233 size_t mid = (low + high) / 2;
1234 BcId *id = bc_vec_item(v, mid);
1235 int result = bc_id_cmp(ptr, id);
1248 static int bc_map_insert(BcVec *v, const void *ptr, size_t *i)
1250 size_t n = *i = bc_map_find_ge(v, ptr);
1253 bc_vec_push(v, ptr);
1254 else if (!bc_id_cmp(ptr, bc_vec_item(v, n)))
1255 return 0; // "was not inserted"
1257 bc_vec_pushAt(v, ptr, n);
1258 return 1; // "was inserted"
1262 static size_t bc_map_find_exact(const BcVec *v, const void *ptr)
1264 size_t i = bc_map_find_ge(v, ptr);
1265 if (i >= v->len) return BC_VEC_INVALID_IDX;
1266 return bc_id_cmp(ptr, bc_vec_item(v, i)) ? BC_VEC_INVALID_IDX : i;
1270 static void bc_num_setToZero(BcNum *n, size_t scale)
1277 static void bc_num_zero(BcNum *n)
1279 bc_num_setToZero(n, 0);
1282 static void bc_num_one(BcNum *n)
1284 bc_num_setToZero(n, 0);
1289 // Note: this also sets BcNum to zero
1290 static void bc_num_init(BcNum *n, size_t req)
1292 req = req >= BC_NUM_DEF_SIZE ? req : BC_NUM_DEF_SIZE;
1293 //memset(n, 0, sizeof(BcNum)); - cleared by assignments below
1294 n->num = xmalloc(req);
1301 static void bc_num_init_DEF_SIZE(BcNum *n)
1303 bc_num_init(n, BC_NUM_DEF_SIZE);
1306 static void bc_num_expand(BcNum *n, size_t req)
1308 req = req >= BC_NUM_DEF_SIZE ? req : BC_NUM_DEF_SIZE;
1310 n->num = xrealloc(n->num, req);
1315 static FAST_FUNC void bc_num_free(void *num)
1317 free(((BcNum *) num)->num);
1320 static void bc_num_copy(BcNum *d, BcNum *s)
1323 bc_num_expand(d, s->cap);
1327 memcpy(d->num, s->num, sizeof(BcDig) * d->len);
1331 static BC_STATUS zbc_num_ulong_abs(BcNum *n, unsigned long *result_p)
1334 unsigned long result;
1338 while (i > n->rdx) {
1339 unsigned long prev = result;
1340 result = result * 10 + n->num[--i];
1341 // Even overflowed N*10 can still satisfy N*10>=N. For example,
1342 // 0x1ff00000 * 10 is 0x13f600000,
1343 // or 0x3f600000 truncated to 32 bits. Which is larger.
1344 // However, (N*10)/8 < N check is always correct.
1345 if ((result / 8) < prev)
1346 RETURN_STATUS(bc_error("overflow"));
1350 RETURN_STATUS(BC_STATUS_SUCCESS);
1352 #define zbc_num_ulong_abs(...) (zbc_num_ulong_abs(__VA_ARGS__) COMMA_SUCCESS)
1354 static BC_STATUS zbc_num_ulong(BcNum *n, unsigned long *result_p)
1356 if (n->neg) RETURN_STATUS(bc_error("negative number"));
1358 RETURN_STATUS(zbc_num_ulong_abs(n, result_p));
1360 #define zbc_num_ulong(...) (zbc_num_ulong(__VA_ARGS__) COMMA_SUCCESS)
1362 #if ULONG_MAX == 0xffffffffUL // 10 digits: 4294967295
1363 # define ULONG_NUM_BUFSIZE (10 > BC_NUM_DEF_SIZE ? 10 : BC_NUM_DEF_SIZE)
1364 #elif ULONG_MAX == 0xffffffffffffffffULL // 20 digits: 18446744073709551615
1365 # define ULONG_NUM_BUFSIZE (20 > BC_NUM_DEF_SIZE ? 20 : BC_NUM_DEF_SIZE)
1367 // minimum BC_NUM_DEF_SIZE, so that bc_num_expand() in bc_num_ulong2num()
1368 // would not hit realloc() code path - not good if num[] is not malloced
1370 static void bc_num_ulong2num(BcNum *n, unsigned long val)
1376 if (val == 0) return;
1378 bc_num_expand(n, ULONG_NUM_BUFSIZE);
1385 if (val == 0) break;
1389 static void bc_num_subArrays(BcDig *restrict a, BcDig *restrict b, size_t len)
1392 for (i = 0; i < len; ++i) {
1394 for (j = i; a[j] < 0;) {
1401 static ssize_t bc_num_compare(BcDig *restrict a, BcDig *restrict b, size_t len)
1419 #define BC_NUM_NEG(n, neg) ((((ssize_t)(n)) ^ -((ssize_t)(neg))) + (neg))
1420 #define BC_NUM_ONE(n) ((n)->len == 1 && (n)->rdx == 0 && (n)->num[0] == 1)
1421 #define BC_NUM_INT(n) ((n)->len - (n)->rdx)
1422 //#define BC_NUM_AREQ(a, b) (BC_MAX((a)->rdx, (b)->rdx) + BC_MAX(BC_NUM_INT(a), BC_NUM_INT(b)) + 1)
1423 static /*ALWAYS_INLINE*/ size_t BC_NUM_AREQ(BcNum *a, BcNum *b)
1425 return BC_MAX(a->rdx, b->rdx) + BC_MAX(BC_NUM_INT(a), BC_NUM_INT(b)) + 1;
1427 //#define BC_NUM_MREQ(a, b, scale) (BC_NUM_INT(a) + BC_NUM_INT(b) + BC_MAX((scale), (a)->rdx + (b)->rdx) + 1)
1428 static /*ALWAYS_INLINE*/ size_t BC_NUM_MREQ(BcNum *a, BcNum *b, size_t scale)
1430 return BC_NUM_INT(a) + BC_NUM_INT(b) + BC_MAX(scale, a->rdx + b->rdx) + 1;
1433 static ssize_t bc_num_cmp(BcNum *a, BcNum *b)
1435 size_t i, min, a_int, b_int, diff;
1436 BcDig *max_num, *min_num;
1440 if (a == b) return 0;
1441 if (a->len == 0) return BC_NUM_NEG(!!b->len, !b->neg);
1442 if (b->len == 0) return BC_NUM_NEG(1, a->neg);
1444 if (a->neg != b->neg) // signs of a and b differ
1445 // +a,-b = a>b = 1 or -a,+b = a<b = -1
1446 return (int)b->neg - (int)a->neg;
1447 neg = a->neg; // 1 if both negative, 0 if both positive
1449 a_int = BC_NUM_INT(a);
1450 b_int = BC_NUM_INT(b);
1453 if (a_int != 0) return (ssize_t) a_int;
1455 a_max = (a->rdx > b->rdx);
1458 diff = a->rdx - b->rdx;
1459 max_num = a->num + diff;
1461 // neg = (a_max == neg); - NOP (maps 1->1 and 0->0)
1464 diff = b->rdx - a->rdx;
1465 max_num = b->num + diff;
1467 neg = !neg; // same as "neg = (a_max == neg)"
1470 cmp = bc_num_compare(max_num, min_num, b_int + min);
1471 if (cmp != 0) return BC_NUM_NEG(cmp, neg);
1473 for (max_num -= diff, i = diff - 1; i < diff; --i) {
1474 if (max_num[i]) return BC_NUM_NEG(1, neg);
1480 static void bc_num_truncate(BcNum *n, size_t places)
1482 if (places == 0) return;
1488 memmove(n->num, n->num + places, n->len * sizeof(BcDig));
1492 static void bc_num_extend(BcNum *n, size_t places)
1494 size_t len = n->len + places;
1497 if (n->cap < len) bc_num_expand(n, len);
1499 memmove(n->num + places, n->num, sizeof(BcDig) * n->len);
1500 memset(n->num, 0, sizeof(BcDig) * places);
1507 static void bc_num_clean(BcNum *n)
1509 while (n->len > 0 && n->num[n->len - 1] == 0) --n->len;
1512 else if (n->len < n->rdx)
1516 static void bc_num_retireMul(BcNum *n, size_t scale, bool neg1, bool neg2)
1519 bc_num_extend(n, scale - n->rdx);
1521 bc_num_truncate(n, n->rdx - scale);
1524 if (n->len != 0) n->neg = !neg1 != !neg2;
1527 static void bc_num_split(BcNum *restrict n, size_t idx, BcNum *restrict a,
1531 b->len = n->len - idx;
1533 a->rdx = b->rdx = 0;
1535 memcpy(b->num, n->num + idx, b->len * sizeof(BcDig));
1536 memcpy(a->num, n->num, idx * sizeof(BcDig));
1546 static BC_STATUS zbc_num_shift(BcNum *n, size_t places)
1548 if (places == 0 || n->len == 0) RETURN_STATUS(BC_STATUS_SUCCESS);
1550 // This check makes sense only if size_t is (much) larger than BC_MAX_NUM.
1551 if (SIZE_MAX > (BC_MAX_NUM | 0xff)) {
1552 if (places + n->len > BC_MAX_NUM)
1553 RETURN_STATUS(bc_error("number too long: must be [1,"BC_MAX_NUM_STR"]"));
1556 if (n->rdx >= places)
1559 bc_num_extend(n, places - n->rdx);
1565 RETURN_STATUS(BC_STATUS_SUCCESS);
1567 #define zbc_num_shift(...) (zbc_num_shift(__VA_ARGS__) COMMA_SUCCESS)
1569 typedef BC_STATUS (*BcNumBinaryOp)(BcNum *, BcNum *, BcNum *, size_t) FAST_FUNC;
1571 static BC_STATUS zbc_num_binary(BcNum *a, BcNum *b, BcNum *c, size_t scale,
1572 BcNumBinaryOp op, size_t req)
1575 BcNum num2, *ptr_a, *ptr_b;
1580 memcpy(ptr_a, c, sizeof(BcNum));
1588 memcpy(ptr_b, c, sizeof(BcNum));
1595 bc_num_init(c, req);
1597 bc_num_expand(c, req);
1599 s = BC_STATUS_SUCCESS;
1600 IF_ERROR_RETURN_POSSIBLE(s =) op(ptr_a, ptr_b, c, scale);
1602 if (init) bc_num_free(&num2);
1606 #define zbc_num_binary(...) (zbc_num_binary(__VA_ARGS__) COMMA_SUCCESS)
1608 static FAST_FUNC BC_STATUS zbc_num_a(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale);
1609 static FAST_FUNC BC_STATUS zbc_num_s(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale);
1610 static FAST_FUNC BC_STATUS zbc_num_p(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale);
1611 static FAST_FUNC BC_STATUS zbc_num_m(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale);
1612 static FAST_FUNC BC_STATUS zbc_num_d(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale);
1613 static FAST_FUNC BC_STATUS zbc_num_rem(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale);
1615 static FAST_FUNC BC_STATUS zbc_num_add(BcNum *a, BcNum *b, BcNum *c, size_t scale)
1617 BcNumBinaryOp op = (!a->neg == !b->neg) ? zbc_num_a : zbc_num_s;
1619 RETURN_STATUS(zbc_num_binary(a, b, c, false, op, BC_NUM_AREQ(a, b)));
1622 static FAST_FUNC BC_STATUS zbc_num_sub(BcNum *a, BcNum *b, BcNum *c, size_t scale)
1624 BcNumBinaryOp op = (!a->neg == !b->neg) ? zbc_num_s : zbc_num_a;
1626 RETURN_STATUS(zbc_num_binary(a, b, c, true, op, BC_NUM_AREQ(a, b)));
1629 static FAST_FUNC BC_STATUS zbc_num_mul(BcNum *a, BcNum *b, BcNum *c, size_t scale)
1631 size_t req = BC_NUM_MREQ(a, b, scale);
1632 RETURN_STATUS(zbc_num_binary(a, b, c, scale, zbc_num_m, req));
1635 static FAST_FUNC BC_STATUS zbc_num_div(BcNum *a, BcNum *b, BcNum *c, size_t scale)
1637 size_t req = BC_NUM_MREQ(a, b, scale);
1638 RETURN_STATUS(zbc_num_binary(a, b, c, scale, zbc_num_d, req));
1641 static FAST_FUNC BC_STATUS zbc_num_mod(BcNum *a, BcNum *b, BcNum *c, size_t scale)
1643 size_t req = BC_NUM_MREQ(a, b, scale);
1644 RETURN_STATUS(zbc_num_binary(a, b, c, scale, zbc_num_rem, req));
1647 static FAST_FUNC BC_STATUS zbc_num_pow(BcNum *a, BcNum *b, BcNum *c, size_t scale)
1649 RETURN_STATUS(zbc_num_binary(a, b, c, scale, zbc_num_p, a->len * b->len + 1));
1652 static const BcNumBinaryOp zxc_program_ops[] = {
1653 zbc_num_pow, zbc_num_mul, zbc_num_div, zbc_num_mod, zbc_num_add, zbc_num_sub,
1655 #define zbc_num_add(...) (zbc_num_add(__VA_ARGS__) COMMA_SUCCESS)
1656 #define zbc_num_sub(...) (zbc_num_sub(__VA_ARGS__) COMMA_SUCCESS)
1657 #define zbc_num_mul(...) (zbc_num_mul(__VA_ARGS__) COMMA_SUCCESS)
1658 #define zbc_num_div(...) (zbc_num_div(__VA_ARGS__) COMMA_SUCCESS)
1659 #define zbc_num_mod(...) (zbc_num_mod(__VA_ARGS__) COMMA_SUCCESS)
1660 #define zbc_num_pow(...) (zbc_num_pow(__VA_ARGS__) COMMA_SUCCESS)
1662 static BC_STATUS zbc_num_inv(BcNum *a, BcNum *b, size_t scale)
1671 RETURN_STATUS(zbc_num_div(&one, a, b, scale));
1673 #define zbc_num_inv(...) (zbc_num_inv(__VA_ARGS__) COMMA_SUCCESS)
1675 static FAST_FUNC BC_STATUS zbc_num_a(BcNum *a, BcNum *b, BcNum *restrict c, size_t sub)
1677 BcDig *ptr, *ptr_a, *ptr_b, *ptr_c;
1678 size_t i, max, min_rdx, min_int, diff, a_int, b_int;
1681 // Because this function doesn't need to use scale (per the bc spec),
1682 // I am hijacking it to say whether it's doing an add or a subtract.
1686 if (sub && c->len) c->neg = !c->neg;
1687 RETURN_STATUS(BC_STATUS_SUCCESS);
1691 RETURN_STATUS(BC_STATUS_SUCCESS);
1695 c->rdx = BC_MAX(a->rdx, b->rdx);
1696 min_rdx = BC_MIN(a->rdx, b->rdx);
1699 if (a->rdx > b->rdx) {
1700 diff = a->rdx - b->rdx;
1702 ptr_a = a->num + diff;
1705 diff = b->rdx - a->rdx;
1708 ptr_b = b->num + diff;
1712 for (i = 0; i < diff; ++i, ++c->len)
1716 a_int = BC_NUM_INT(a);
1717 b_int = BC_NUM_INT(b);
1719 if (a_int > b_int) {
1730 for (i = 0; i < min_rdx + min_int; ++i) {
1731 unsigned in = (unsigned)ptr_a[i] + (unsigned)ptr_b[i] + carry;
1733 ptr_c[i] = (BcDig)(in % 10);
1735 for (; i < max + min_rdx; ++i) {
1736 unsigned in = (unsigned)ptr[i] + carry;
1738 ptr_c[i] = (BcDig)(in % 10);
1742 if (carry != 0) c->num[c->len++] = (BcDig) carry;
1744 RETURN_STATUS(BC_STATUS_SUCCESS); // can't make void, see zbc_num_binary()
1747 static FAST_FUNC BC_STATUS zbc_num_s(BcNum *a, BcNum *b, BcNum *restrict c, size_t sub)
1750 BcNum *minuend, *subtrahend;
1752 bool aneg, bneg, neg;
1754 // Because this function doesn't need to use scale (per the bc spec),
1755 // I am hijacking it to say whether it's doing an add or a subtract.
1759 if (sub && c->len) c->neg = !c->neg;
1760 RETURN_STATUS(BC_STATUS_SUCCESS);
1764 RETURN_STATUS(BC_STATUS_SUCCESS);
1769 a->neg = b->neg = false;
1771 cmp = bc_num_cmp(a, b);
1777 bc_num_setToZero(c, BC_MAX(a->rdx, b->rdx));
1778 RETURN_STATUS(BC_STATUS_SUCCESS);
1786 if (sub) neg = !neg;
1791 bc_num_copy(c, minuend);
1794 if (c->rdx < subtrahend->rdx) {
1795 bc_num_extend(c, subtrahend->rdx - c->rdx);
1798 start = c->rdx - subtrahend->rdx;
1800 bc_num_subArrays(c->num + start, subtrahend->num, subtrahend->len);
1804 RETURN_STATUS(BC_STATUS_SUCCESS); // can't make void, see zbc_num_binary()
1807 static FAST_FUNC BC_STATUS zbc_num_k(BcNum *restrict a, BcNum *restrict b,
1809 #define zbc_num_k(...) (zbc_num_k(__VA_ARGS__) COMMA_SUCCESS)
1812 size_t max = BC_MAX(a->len, b->len), max2 = (max + 1) / 2;
1813 BcNum l1, h1, l2, h2, m2, m1, z0, z1, z2, temp;
1816 if (a->len == 0 || b->len == 0) {
1818 RETURN_STATUS(BC_STATUS_SUCCESS);
1820 aone = BC_NUM_ONE(a);
1821 if (aone || BC_NUM_ONE(b)) {
1822 bc_num_copy(c, aone ? b : a);
1823 RETURN_STATUS(BC_STATUS_SUCCESS);
1826 if (a->len + b->len < BC_NUM_KARATSUBA_LEN
1827 || a->len < BC_NUM_KARATSUBA_LEN
1828 || b->len < BC_NUM_KARATSUBA_LEN
1832 bc_num_expand(c, a->len + b->len + 1);
1834 memset(c->num, 0, sizeof(BcDig) * c->cap);
1837 for (i = 0; i < b->len; ++i) {
1839 for (j = 0; j < a->len; ++j) {
1840 unsigned in = c->num[i + j];
1841 in += (unsigned)a->num[j] * (unsigned)b->num[i] + carry;
1842 // note: compilers prefer _unsigned_ div/const
1844 c->num[i + j] = (BcDig)(in % 10);
1847 c->num[i + j] += (BcDig) carry;
1848 len = BC_MAX(len, i + j + !!carry);
1850 #if ENABLE_FEATURE_BC_INTERACTIVE
1852 // a*a <- without check below, this will not be interruptible
1853 if (G_interrupt) return BC_STATUS_FAILURE;
1859 RETURN_STATUS(BC_STATUS_SUCCESS);
1862 bc_num_init(&l1, max);
1863 bc_num_init(&h1, max);
1864 bc_num_init(&l2, max);
1865 bc_num_init(&h2, max);
1866 bc_num_init(&m1, max);
1867 bc_num_init(&m2, max);
1868 bc_num_init(&z0, max);
1869 bc_num_init(&z1, max);
1870 bc_num_init(&z2, max);
1871 bc_num_init(&temp, max + max);
1873 bc_num_split(a, max2, &l1, &h1);
1874 bc_num_split(b, max2, &l2, &h2);
1876 s = zbc_num_add(&h1, &l1, &m1, 0);
1878 s = zbc_num_add(&h2, &l2, &m2, 0);
1881 s = zbc_num_k(&h1, &h2, &z0);
1883 s = zbc_num_k(&m1, &m2, &z1);
1885 s = zbc_num_k(&l1, &l2, &z2);
1888 s = zbc_num_sub(&z1, &z0, &temp, 0);
1890 s = zbc_num_sub(&temp, &z2, &z1, 0);
1893 s = zbc_num_shift(&z0, max2 * 2);
1895 s = zbc_num_shift(&z1, max2);
1897 s = zbc_num_add(&z0, &z1, &temp, 0);
1899 s = zbc_num_add(&temp, &z2, c, 0);
1914 static FAST_FUNC BC_STATUS zbc_num_m(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale)
1918 size_t maxrdx = BC_MAX(a->rdx, b->rdx);
1920 scale = BC_MAX(scale, a->rdx);
1921 scale = BC_MAX(scale, b->rdx);
1922 scale = BC_MIN(a->rdx + b->rdx, scale);
1923 maxrdx = BC_MAX(maxrdx, scale);
1925 bc_num_init(&cpa, a->len);
1926 bc_num_init(&cpb, b->len);
1928 bc_num_copy(&cpa, a);
1929 bc_num_copy(&cpb, b);
1930 cpa.neg = cpb.neg = false;
1932 s = zbc_num_shift(&cpa, maxrdx);
1934 s = zbc_num_shift(&cpb, maxrdx);
1936 s = zbc_num_k(&cpa, &cpb, c);
1940 bc_num_expand(c, c->len + maxrdx);
1942 if (c->len < maxrdx) {
1943 memset(c->num + c->len, 0, (c->cap - c->len) * sizeof(BcDig));
1948 bc_num_retireMul(c, scale, a->neg, b->neg);
1954 #define zbc_num_m(...) (zbc_num_m(__VA_ARGS__) COMMA_SUCCESS)
1956 static FAST_FUNC BC_STATUS zbc_num_d(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale)
1963 RETURN_STATUS(bc_error("divide by zero"));
1965 bc_num_setToZero(c, scale);
1966 RETURN_STATUS(BC_STATUS_SUCCESS);
1968 if (BC_NUM_ONE(b)) {
1970 bc_num_retireMul(c, scale, a->neg, b->neg);
1971 RETURN_STATUS(BC_STATUS_SUCCESS);
1974 bc_num_init(&cp, BC_NUM_MREQ(a, b, scale));
1975 bc_num_copy(&cp, a);
1979 bc_num_expand(&cp, len + 2);
1980 bc_num_extend(&cp, len - cp.len);
1983 if (b->rdx > cp.rdx) bc_num_extend(&cp, b->rdx - cp.rdx);
1985 if (scale > cp.rdx) bc_num_extend(&cp, scale - cp.rdx);
1987 if (b->rdx == b->len) {
1989 if (len == 0) break;
1991 if (b->num[len] != 0)
1997 if (cp.cap == cp.len) bc_num_expand(&cp, cp.len + 1);
1999 // We want an extra zero in front to make things simpler.
2000 cp.num[cp.len++] = 0;
2003 bc_num_expand(c, cp.len);
2006 memset(c->num + end, 0, (c->cap - end) * sizeof(BcDig));
2010 s = BC_STATUS_SUCCESS;
2011 for (i = end - 1; i < end; --i) {
2014 for (q = 0; n[len] != 0 || bc_num_compare(n, b->num, len) >= 0; ++q)
2015 bc_num_subArrays(n, b->num, len);
2017 #if ENABLE_FEATURE_BC_INTERACTIVE
2020 // 1/a <- without check below, this will not be interruptible
2022 s = BC_STATUS_FAILURE;
2028 bc_num_retireMul(c, scale, a->neg, b->neg);
2033 #define zbc_num_d(...) (zbc_num_d(__VA_ARGS__) COMMA_SUCCESS)
2035 static FAST_FUNC BC_STATUS zbc_num_r(BcNum *a, BcNum *b, BcNum *restrict c,
2036 BcNum *restrict d, size_t scale, size_t ts)
2043 RETURN_STATUS(bc_error("divide by zero"));
2046 bc_num_setToZero(d, ts);
2047 RETURN_STATUS(BC_STATUS_SUCCESS);
2050 bc_num_init(&temp, d->cap);
2051 s = zbc_num_d(a, b, c, scale);
2054 if (scale != 0) scale = ts;
2056 s = zbc_num_m(c, b, &temp, scale);
2058 s = zbc_num_sub(a, &temp, d, scale);
2061 if (ts > d->rdx && d->len) bc_num_extend(d, ts - d->rdx);
2064 bc_num_retireMul(d, ts, a->neg, b->neg);
2070 #define zbc_num_r(...) (zbc_num_r(__VA_ARGS__) COMMA_SUCCESS)
2072 static FAST_FUNC BC_STATUS zbc_num_rem(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale)
2076 size_t ts = BC_MAX(scale + b->rdx, a->rdx), len = BC_NUM_MREQ(a, b, ts);
2078 bc_num_init(&c1, len);
2079 s = zbc_num_r(a, b, &c1, c, scale, ts);
2084 #define zbc_num_rem(...) (zbc_num_rem(__VA_ARGS__) COMMA_SUCCESS)
2086 static FAST_FUNC BC_STATUS zbc_num_p(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale)
2088 BcStatus s = BC_STATUS_SUCCESS;
2091 size_t i, powrdx, resrdx;
2094 // GNU bc does not allow 2^2.0 - we do
2095 for (i = 0; i < b->rdx; i++)
2097 RETURN_STATUS(bc_error("not an integer"));
2101 RETURN_STATUS(BC_STATUS_SUCCESS);
2104 bc_num_setToZero(c, scale);
2105 RETURN_STATUS(BC_STATUS_SUCCESS);
2107 if (BC_NUM_ONE(b)) {
2111 s = zbc_num_inv(a, c, scale);
2116 s = zbc_num_ulong_abs(b, &pow);
2117 if (s) RETURN_STATUS(s);
2118 // b is not used beyond this point
2120 bc_num_init(©, a->len);
2121 bc_num_copy(©, a);
2126 if (a->rdx * pow < scale)
2127 scale = a->rdx * pow;
2131 for (powrdx = a->rdx; !(pow & 1); pow >>= 1) {
2133 s = zbc_num_mul(©, ©, ©, powrdx);
2135 // Not needed: zbc_num_mul() has a check for ^C:
2136 //if (G_interrupt) {
2137 // s = BC_STATUS_FAILURE;
2142 bc_num_copy(c, ©);
2144 for (resrdx = powrdx, pow >>= 1; pow != 0; pow >>= 1) {
2146 s = zbc_num_mul(©, ©, ©, powrdx);
2151 s = zbc_num_mul(c, ©, c, resrdx);
2154 // Not needed: zbc_num_mul() has a check for ^C:
2155 //if (G_interrupt) {
2156 // s = BC_STATUS_FAILURE;
2162 s = zbc_num_inv(c, c, scale);
2166 if (c->rdx > scale) bc_num_truncate(c, c->rdx - scale);
2168 // We can't use bc_num_clean() here.
2169 for (i = 0; i < c->len; ++i)
2172 bc_num_setToZero(c, scale);
2179 #define zbc_num_p(...) (zbc_num_p(__VA_ARGS__) COMMA_SUCCESS)
2181 static BC_STATUS zbc_num_sqrt(BcNum *a, BcNum *restrict b, size_t scale)
2184 BcNum num1, num2, half, f, fprime, *x0, *x1, *temp;
2186 size_t pow, len, digs, digs1, resrdx, req, times = 0;
2187 ssize_t cmp = 1, cmp1 = SSIZE_MAX, cmp2 = SSIZE_MAX;
2189 req = BC_MAX(scale, a->rdx) + ((BC_NUM_INT(a) + 1) >> 1) + 1;
2190 bc_num_expand(b, req);
2193 bc_num_setToZero(b, scale);
2194 RETURN_STATUS(BC_STATUS_SUCCESS);
2197 RETURN_STATUS(bc_error("negative number"));
2199 if (BC_NUM_ONE(a)) {
2201 bc_num_extend(b, scale);
2202 RETURN_STATUS(BC_STATUS_SUCCESS);
2205 scale = BC_MAX(scale, a->rdx) + 1;
2206 len = a->len + scale;
2208 bc_num_init(&num1, len);
2209 bc_num_init(&num2, len);
2211 half.cap = ARRAY_SIZE(half_digs);
2212 half.num = half_digs;
2217 bc_num_init(&f, len);
2218 bc_num_init(&fprime, len);
2224 pow = BC_NUM_INT(a);
2232 pow -= 2 - (pow & 1);
2234 bc_num_extend(x0, pow);
2236 // Make sure to move the radix back.
2240 x0->rdx = digs = digs1 = 0;
2242 len = BC_NUM_INT(x0) + resrdx - 1;
2244 while (cmp != 0 || digs < len) {
2245 s = zbc_num_div(a, x0, &f, resrdx);
2247 s = zbc_num_add(x0, &f, &fprime, resrdx);
2249 s = zbc_num_mul(&fprime, &half, x1, resrdx);
2252 cmp = bc_num_cmp(x1, x0);
2253 digs = x1->len - (unsigned long long) llabs(cmp);
2255 if (cmp == cmp2 && digs == digs1)
2260 resrdx += times > 4;
2273 if (b->rdx > scale) bc_num_truncate(b, b->rdx - scale);
2275 bc_num_free(&fprime);
2281 #define zbc_num_sqrt(...) (zbc_num_sqrt(__VA_ARGS__) COMMA_SUCCESS)
2283 static BC_STATUS zbc_num_divmod(BcNum *a, BcNum *b, BcNum *c, BcNum *d,
2289 size_t ts = BC_MAX(scale + b->rdx, a->rdx), len = BC_NUM_MREQ(a, b, ts);
2292 memcpy(&num2, c, sizeof(BcNum));
2294 bc_num_init(c, len);
2298 bc_num_expand(c, len);
2301 s = zbc_num_r(ptr_a, b, c, d, scale, ts);
2303 if (init) bc_num_free(&num2);
2307 #define zbc_num_divmod(...) (zbc_num_divmod(__VA_ARGS__) COMMA_SUCCESS)
2310 static BC_STATUS zdc_num_modexp(BcNum *a, BcNum *b, BcNum *c, BcNum *restrict d)
2313 BcNum base, exp, two, temp;
2317 RETURN_STATUS(bc_error("divide by zero"));
2318 if (a->rdx || b->rdx || c->rdx)
2319 RETURN_STATUS(bc_error("not an integer"));
2321 RETURN_STATUS(bc_error("negative number"));
2323 bc_num_expand(d, c->len);
2324 bc_num_init(&base, c->len);
2325 bc_num_init(&exp, b->len);
2326 bc_num_init(&temp, b->len);
2328 two.cap = ARRAY_SIZE(two_digs);
2335 s = zbc_num_rem(a, c, &base, 0);
2337 bc_num_copy(&exp, b);
2339 while (exp.len != 0) {
2340 s = zbc_num_divmod(&exp, &two, &exp, &temp, 0);
2343 if (BC_NUM_ONE(&temp)) {
2344 s = zbc_num_mul(d, &base, &temp, 0);
2346 s = zbc_num_rem(&temp, c, d, 0);
2350 s = zbc_num_mul(&base, &base, &temp, 0);
2352 s = zbc_num_rem(&temp, c, &base, 0);
2361 #define zdc_num_modexp(...) (zdc_num_modexp(__VA_ARGS__) COMMA_SUCCESS)
2364 static FAST_FUNC void bc_string_free(void *string)
2366 free(*(char**)string);
2369 static void bc_func_init(BcFunc *f)
2371 bc_char_vec_init(&f->code);
2372 IF_BC(bc_vec_init(&f->labels, sizeof(size_t), NULL);)
2373 IF_BC(bc_vec_init(&f->autos, sizeof(BcId), bc_id_free);)
2374 IF_BC(bc_vec_init(&f->strs, sizeof(char *), bc_string_free);)
2375 IF_BC(bc_vec_init(&f->consts, sizeof(char *), bc_string_free);)
2376 IF_BC(f->nparams = 0;)
2379 static FAST_FUNC void bc_func_free(void *func)
2381 BcFunc *f = (BcFunc *) func;
2382 bc_vec_free(&f->code);
2383 IF_BC(bc_vec_free(&f->labels);)
2384 IF_BC(bc_vec_free(&f->autos);)
2385 IF_BC(bc_vec_free(&f->strs);)
2386 IF_BC(bc_vec_free(&f->consts);)
2389 static void bc_array_expand(BcVec *a, size_t len);
2391 static void bc_array_init(BcVec *a, bool nums)
2394 bc_vec_init(a, sizeof(BcNum), bc_num_free);
2396 bc_vec_init(a, sizeof(BcVec), bc_vec_free);
2397 bc_array_expand(a, 1);
2400 static void bc_array_expand(BcVec *a, size_t len)
2402 if (a->dtor == bc_num_free
2403 // && a->size == sizeof(BcNum) - always true
2406 while (len > a->len) {
2407 bc_num_init_DEF_SIZE(&n);
2412 while (len > a->len) {
2413 bc_array_init(&v, true);
2419 static void bc_array_copy(BcVec *d, const BcVec *s)
2425 bc_vec_expand(d, s->cap);
2430 for (i = 0; i < s->len; i++, dnum++, snum++) {
2431 bc_num_init(dnum, snum->len);
2432 bc_num_copy(dnum, snum);
2437 static void dc_result_copy(BcResult *d, BcResult *src)
2442 case XC_RESULT_TEMP:
2443 case XC_RESULT_IBASE:
2444 case XC_RESULT_SCALE:
2445 case XC_RESULT_OBASE:
2446 bc_num_init(&d->d.n, src->d.n.len);
2447 bc_num_copy(&d->d.n, &src->d.n);
2450 case XC_RESULT_ARRAY:
2451 case XC_RESULT_ARRAY_ELEM:
2452 d->d.id.name = xstrdup(src->d.id.name);
2454 case XC_RESULT_CONSTANT:
2455 IF_BC(case BC_RESULT_LAST:)
2456 IF_BC(case BC_RESULT_ONE:)
2458 memcpy(&d->d.n, &src->d.n, sizeof(BcNum));
2464 static FAST_FUNC void bc_result_free(void *result)
2466 BcResult *r = (BcResult *) result;
2469 case XC_RESULT_TEMP:
2470 case XC_RESULT_IBASE:
2471 case XC_RESULT_SCALE:
2472 case XC_RESULT_OBASE:
2473 bc_num_free(&r->d.n);
2476 case XC_RESULT_ARRAY:
2477 case XC_RESULT_ARRAY_ELEM:
2486 static int bad_input_byte(char c)
2488 if ((c < ' ' && c != '\t' && c != '\r' && c != '\n') // also allow '\v' '\f'?
2491 bc_error_fmt("illegal character 0x%02x", c);
2497 static void xc_read_line(BcVec *vec, FILE *fp)
2500 bc_vec_pop_all(vec);
2503 #if ENABLE_FEATURE_BC_INTERACTIVE
2504 if (G_interrupt) { // ^C was pressed
2507 // ^C while running a script (bc SCRIPT): die.
2508 // We do not return to interactive prompt:
2509 // user might be running us from a shell,
2510 // and SCRIPT might be intended to terminate
2511 // (e.g. contain a "halt" stmt).
2512 // ^C dropping user into a bc prompt instead of
2513 // the shell would be unexpected.
2516 // ^C while interactive input
2518 // GNU bc says "interrupted execution."
2519 // GNU dc says "Interrupt!"
2520 fputs("\ninterrupted execution\n", stderr);
2523 # if ENABLE_FEATURE_EDITING
2524 if (G_ttyin && fp == stdin) {
2526 # define line_buf bb_common_bufsiz1
2527 n = read_line_input(G.line_input_state, "", line_buf, COMMON_BUFSIZE);
2528 if (n <= 0) { // read errors or EOF, or ^D, or ^C
2531 bc_vec_pushZeroByte(vec); // ^D or EOF (or error)
2536 char c = line_buf[i++];
2537 if (c == '\0') break;
2538 if (bad_input_byte(c)) goto again;
2540 bc_vec_string(vec, n, line_buf);
2551 #if ENABLE_FEATURE_BC_INTERACTIVE
2553 // ^C was pressed: ignore entire line, get another one
2562 bb_perror_msg_and_die("input error");
2563 // Note: EOF does not append '\n'
2566 bad_chars |= bad_input_byte(c);
2567 bc_vec_pushByte(vec, (char)c);
2568 } while (c != '\n');
2571 // Bad chars on this line
2572 if (!G.prs.lex_filename) { // stdin
2573 // ignore entire line, get another one
2576 bb_perror_msg_and_die("file '%s' is not text", G.prs.lex_filename);
2578 bc_vec_pushZeroByte(vec);
2586 // "Input numbers may contain the characters 0-9 and A-Z.
2587 // (Note: They must be capitals. Lower case letters are variable names.)
2588 // Single digit numbers always have the value of the digit regardless of
2589 // the value of ibase. (i.e. A = 10.) For multi-digit numbers, bc changes
2590 // all input digits greater or equal to ibase to the value of ibase-1.
2591 // This makes the number ZZZ always be the largest 3 digit number of the
2593 static bool xc_num_strValid(const char *val)
2601 if (radix) return false;
2605 if ((c < '0' || c > '9') && (c < 'A' || c > 'Z'))
2611 // Note: n is already "bc_num_zero()"ed,
2612 // leading zeroes in "val" are removed
2613 static void bc_num_parseDecimal(BcNum *n, const char *val)
2622 bc_num_expand(n, len + 1); // +1 for e.g. "A" converting into 10
2624 ptr = strchr(val, '.');
2628 n->rdx = (size_t)((val + len) - (ptr + 1));
2630 for (i = 0; val[i]; ++i) {
2631 if (val[i] != '0' && val[i] != '.') {
2632 // Not entirely zero value - convert it, and exit
2634 unsigned c = val[0] - '0';
2636 if (c > 9) { // A-Z => 10-36
2638 c -= ('A' - '9' - 1);
2647 char c = val[i] - '0';
2648 if (c > 9) // A-Z => 9
2654 if (val[--i] == '.') goto skip_dot;
2659 // if for() exits without hitting if(), the value is entirely zero
2662 // Note: n is already "bc_num_zero()"ed,
2663 // leading zeroes in "val" are removed
2664 static void bc_num_parseBase(BcNum *n, const char *val, unsigned base_t)
2670 BcDig temp_digs[ULONG_NUM_BUFSIZE];
2671 BcDig base_digs[ULONG_NUM_BUFSIZE];
2674 bc_num_init_DEF_SIZE(&mult);
2676 temp.cap = ARRAY_SIZE(temp_digs);
2677 temp.num = temp_digs;
2679 base.cap = ARRAY_SIZE(base_digs);
2680 base.num = base_digs;
2681 bc_num_ulong2num(&base, base_t);
2689 if (c == '\0') goto int_err;
2690 if (c == '.') break;
2692 v = (unsigned)(c <= '9' ? c - '0' : c - 'A' + 10);
2693 if (v > base_t) v = base_t;
2695 s = zbc_num_mul(n, &base, &mult, 0);
2696 if (s) goto int_err;
2697 bc_num_ulong2num(&temp, v);
2698 s = zbc_num_add(&mult, &temp, n, 0);
2699 if (s) goto int_err;
2702 bc_num_init(&result, base.len);
2703 //bc_num_zero(&result); - already is
2712 if (c == '\0') break;
2715 v = (unsigned)(c <= '9' ? c - '0' : c - 'A' + 10);
2716 if (v > base_t) v = base_t;
2718 s = zbc_num_mul(&result, &base, &result, 0);
2720 bc_num_ulong2num(&temp, v);
2721 s = zbc_num_add(&result, &temp, &result, 0);
2723 s = zbc_num_mul(&mult, &base, &mult, 0);
2727 s = zbc_num_div(&result, &mult, &result, digits);
2729 s = zbc_num_add(n, &result, n, digits);
2733 if (n->rdx < digits)
2734 bc_num_extend(n, digits - n->rdx);
2738 bc_num_free(&result);
2743 static BC_STATUS zxc_num_parse(BcNum *n, const char *val, unsigned base_t)
2747 if (!xc_num_strValid(val))
2748 RETURN_STATUS(bc_error("bad number string"));
2753 for (i = 0; ; ++i) {
2755 RETURN_STATUS(BC_STATUS_SUCCESS);
2756 if (val[i] != '.' && val[i] != '0')
2760 if (base_t == 10 || val[1] == '\0')
2761 // Decimal, or single-digit number
2762 bc_num_parseDecimal(n, val);
2764 bc_num_parseBase(n, val, base_t);
2766 RETURN_STATUS(BC_STATUS_SUCCESS);
2768 #define zxc_num_parse(...) (zxc_num_parse(__VA_ARGS__) COMMA_SUCCESS)
2770 // p->lex_inbuf points to the current string to be parsed.
2771 // if p->lex_inbuf points to '\0', it's either EOF or it points after
2772 // last processed line's terminating '\n' (and more reading needs to be done
2773 // to get next character).
2775 // If you are in a situation where that is a possibility, call peek_inbuf().
2776 // If necessary, it performs more reading and changes p->lex_inbuf,
2777 // then it returns *p->lex_inbuf (which will be '\0' only if it's EOF).
2778 // After it, just referencing *p->lex_inbuf is valid, and if it wasn't '\0',
2779 // it's ok to do p->lex_inbuf++ once without end-of-buffer checking.
2781 // eat_inbuf() is equvalent to "peek_inbuf(); if (c) p->lex_inbuf++":
2782 // it returns current char and advances the pointer (if not EOF).
2783 // After eat_inbuf(), referencing p->lex_inbuf[-1] and *p->lex_inbuf is valid.
2785 // In many cases, you can use fast *p->lex_inbuf instead of peek_inbuf():
2786 // unless prev char might have been '\n', *p->lex_inbuf is '\0' ONLY
2787 // on real EOF, not end-of-buffer.
2789 // bc cases to test interactively:
2790 // 1 #comment\ - prints "1<newline>" at once (comment is not continued)
2791 // 1 #comment/* - prints "1<newline>" at once
2792 // 1 #comment" - prints "1<newline>" at once
2793 // 1\#comment - error at once (\ is not a line continuation)
2794 // 1 + /*"*/2 - prints "3<newline>" at once
2795 // 1 + /*#*/2 - prints "3<newline>" at once
2796 // "str\" - prints "str\" at once
2797 // "str#" - prints "str#" at once
2798 // "str/*" - prints "str/*" at once
2799 // "str#\ - waits for second line
2800 // end" - ...prints "str#\<newline>end"
2801 static char peek_inbuf(void)
2803 if (*G.prs.lex_inbuf == '\0'
2804 && G.prs.lex_input_fp
2806 xc_read_line(&G.input_buffer, G.prs.lex_input_fp);
2807 G.prs.lex_inbuf = G.input_buffer.v;
2808 if (G.input_buffer.len <= 1) // on EOF, len is 1 (NUL byte)
2809 G.prs.lex_input_fp = NULL;
2811 return *G.prs.lex_inbuf;
2813 static char eat_inbuf(void)
2815 char c = peek_inbuf();
2816 if (c) G.prs.lex_inbuf++;
2820 static void xc_lex_lineComment(void)
2822 BcParse *p = &G.prs;
2825 // Try: echo -n '#foo' | bc
2826 p->lex = XC_LEX_WHITESPACE;
2828 // Not peek_inbuf(): we depend on input being done in whole lines:
2829 // '\0' which isn't the EOF can only be seen after '\n'.
2830 while ((c = *p->lex_inbuf) != '\n' && c != '\0')
2834 static void xc_lex_whitespace(void)
2836 BcParse *p = &G.prs;
2838 p->lex = XC_LEX_WHITESPACE;
2840 // We depend here on input being done in whole lines:
2841 // '\0' which isn't the EOF can only be seen after '\n'.
2842 char c = *p->lex_inbuf;
2843 if (c == '\n') // this is XC_LEX_NLINE, not XC_LEX_WHITESPACE
2851 static BC_STATUS zxc_lex_number(char last)
2853 BcParse *p = &G.prs;
2857 bc_vec_pop_all(&p->lex_strnumbuf);
2858 bc_vec_pushByte(&p->lex_strnumbuf, last);
2860 // bc: "Input numbers may contain the characters 0-9 and A-Z.
2861 // (Note: They must be capitals. Lower case letters are variable names.)
2862 // Single digit numbers always have the value of the digit regardless of
2863 // the value of ibase. (i.e. A = 10.) For multi-digit numbers, bc changes
2864 // all input digits greater or equal to ibase to the value of ibase-1.
2865 // This makes the number ZZZ always be the largest 3 digit number of the
2867 // dc only allows A-F, the rules about single-char and multi-char are the same.
2868 last_valid_ch = (IS_BC ? 'Z' : 'F');
2870 p->lex = XC_LEX_NUMBER;
2872 // We depend here on input being done in whole lines:
2873 // '\0' which isn't the EOF can only be seen after '\n'.
2874 char c = *p->lex_inbuf;
2878 if (c == '\\' && p->lex_inbuf[1] == '\n') {
2881 dbg_lex("++p->lex_line=%zd", p->lex_line);
2882 c = peek_inbuf(); // force next line to be read
2885 if (!isdigit(c) && (c < 'A' || c > last_valid_ch)) {
2886 if (c != '.') break;
2887 // if '.' was already seen, stop on second one:
2891 // c is one of "0-9A-Z."
2893 bc_vec_push(&p->lex_strnumbuf, p->lex_inbuf);
2896 if (last == '.') // remove trailing '.' if any
2897 bc_vec_pop(&p->lex_strnumbuf);
2898 bc_vec_pushZeroByte(&p->lex_strnumbuf);
2900 G.err_line = G.prs.lex_line;
2901 RETURN_STATUS(BC_STATUS_SUCCESS);
2903 #define zxc_lex_number(...) (zxc_lex_number(__VA_ARGS__) COMMA_SUCCESS)
2905 static void xc_lex_name(void)
2907 BcParse *p = &G.prs;
2911 p->lex = XC_LEX_NAME;
2913 // Since names can't cross lines with \<newline>,
2914 // we depend on the fact that whole line is in the buffer
2916 buf = p->lex_inbuf - 1;
2919 if ((c < 'a' || c > 'z') && !isdigit(c) && c != '_') break;
2923 #if 0 // We do not protect against people with gigabyte-long names
2924 // This check makes sense only if size_t is (much) larger than BC_MAX_STRING.
2925 if (SIZE_MAX > (BC_MAX_STRING | 0xff)) {
2926 if (i > BC_MAX_STRING)
2927 return bc_error("name too long: must be [1,"BC_MAX_STRING_STR"]");
2930 bc_vec_string(&p->lex_strnumbuf, i, buf);
2932 // Increment the index. We minus 1 because it has already been incremented.
2933 p->lex_inbuf += i - 1;
2935 //return BC_STATUS_SUCCESS;
2938 IF_BC(static BC_STATUS zbc_lex_token(void);)
2939 IF_DC(static BC_STATUS zdc_lex_token(void);)
2940 #define zbc_lex_token(...) (zbc_lex_token(__VA_ARGS__) COMMA_SUCCESS)
2941 #define zdc_lex_token(...) (zdc_lex_token(__VA_ARGS__) COMMA_SUCCESS)
2943 static BC_STATUS zxc_lex_next(void)
2945 BcParse *p = &G.prs;
2948 G.err_line = p->lex_line;
2949 p->lex_last = p->lex;
2951 // if (p->lex_last == XC_LEX_EOF)
2952 // RETURN_STATUS(bc_error("end of file"));
2954 // Loop until failure or we don't have whitespace. This
2955 // is so the parser doesn't get inundated with whitespace.
2956 // Comments are also XC_LEX_WHITESPACE tokens and eaten here.
2957 s = BC_STATUS_SUCCESS;
2959 if (*p->lex_inbuf == '\0') {
2960 p->lex = XC_LEX_EOF;
2961 if (peek_inbuf() == '\0')
2962 RETURN_STATUS(BC_STATUS_SUCCESS);
2964 p->lex_next_at = p->lex_inbuf;
2965 dbg_lex("next string to parse:'%.*s'",
2966 (int)(strchrnul(p->lex_next_at, '\n') - p->lex_next_at),
2970 IF_BC(s = zbc_lex_token());
2972 IF_DC(s = zdc_lex_token());
2974 } while (!s && p->lex == XC_LEX_WHITESPACE);
2975 dbg_lex("p->lex from string:%d", p->lex);
2979 #define zxc_lex_next(...) (zxc_lex_next(__VA_ARGS__) COMMA_SUCCESS)
2982 static BC_STATUS zbc_lex_skip_if_at_NLINE(void)
2984 if (G.prs.lex == XC_LEX_NLINE)
2985 RETURN_STATUS(zxc_lex_next());
2986 RETURN_STATUS(BC_STATUS_SUCCESS);
2988 #define zbc_lex_skip_if_at_NLINE(...) (zbc_lex_skip_if_at_NLINE(__VA_ARGS__) COMMA_SUCCESS)
2990 static BC_STATUS zbc_lex_next_and_skip_NLINE(void)
2994 if (s) RETURN_STATUS(s);
2995 // if(cond)<newline>stmt is accepted too (but not 2+ newlines)
2996 s = zbc_lex_skip_if_at_NLINE();
2999 #define zbc_lex_next_and_skip_NLINE(...) (zbc_lex_next_and_skip_NLINE(__VA_ARGS__) COMMA_SUCCESS)
3001 static BC_STATUS zbc_lex_identifier(void)
3003 BcParse *p = &G.prs;
3006 const char *buf = p->lex_inbuf - 1;
3008 for (i = 0; i < ARRAY_SIZE(bc_lex_kws); ++i) {
3009 const char *keyword8 = bc_lex_kws[i].name8;
3011 while (buf[j] != '\0' && buf[j] == keyword8[j]) {
3013 if (j == 8) goto match;
3015 if (keyword8[j] != '\0')
3018 // buf starts with keyword bc_lex_kws[i]
3019 if (isalnum(buf[j]) || buf[j]=='_')
3020 continue; // "ifz" does not match "if" keyword, "if." does
3021 p->lex = BC_LEX_KEY_1st_keyword + i;
3022 if (!keyword_is_POSIX(i)) {
3023 s = zbc_posix_error_fmt("%sthe '%.8s' keyword", "POSIX does not allow ", bc_lex_kws[i].name8);
3024 if (s) RETURN_STATUS(s);
3027 // We minus 1 because the index has already been incremented.
3028 p->lex_inbuf += j - 1;
3029 RETURN_STATUS(BC_STATUS_SUCCESS);
3033 s = BC_STATUS_SUCCESS;
3035 if (p->lex_strnumbuf.len > 2) {
3038 // bc: POSIX only allows one character names; this is bad: 'qwe=1
3040 unsigned len = strchrnul(buf, '\n') - buf;
3041 s = zbc_posix_error_fmt("POSIX only allows one character names; this is bad: '%.*s'", len, buf);
3046 #define zbc_lex_identifier(...) (zbc_lex_identifier(__VA_ARGS__) COMMA_SUCCESS)
3048 static BC_STATUS zbc_lex_string(void)
3050 BcParse *p = &G.prs;
3052 p->lex = XC_LEX_STR;
3053 bc_vec_pop_all(&p->lex_strnumbuf);
3055 char c = peek_inbuf(); // strings can cross lines
3057 RETURN_STATUS(bc_error("unterminated string"));
3063 dbg_lex("++p->lex_line=%zd", p->lex_line);
3065 bc_vec_push(&p->lex_strnumbuf, p->lex_inbuf);
3068 bc_vec_pushZeroByte(&p->lex_strnumbuf);
3071 G.err_line = p->lex_line;
3072 RETURN_STATUS(BC_STATUS_SUCCESS);
3074 #define zbc_lex_string(...) (zbc_lex_string(__VA_ARGS__) COMMA_SUCCESS)
3076 static void parse_lex_by_checking_eq_sign(unsigned with_and_without)
3078 BcParse *p = &G.prs;
3079 if (*p->lex_inbuf == '=') {
3080 // ^^^ not using peek_inbuf() since '==' etc can't be split across lines
3082 with_and_without >>= 8; // store "with" value
3083 } // else store "without" value
3084 p->lex = (with_and_without & 0xff);
3086 #define parse_lex_by_checking_eq_sign(with, without) \
3087 parse_lex_by_checking_eq_sign(((with)<<8)|(without))
3089 static BC_STATUS zbc_lex_comment(void)
3091 BcParse *p = &G.prs;
3093 p->lex = XC_LEX_WHITESPACE;
3094 // here lex_inbuf is at '*' of opening comment delimiter
3103 c = *p->lex_inbuf; // no need to peek_inbuf()
3109 RETURN_STATUS(bc_error("unterminated comment"));
3113 dbg_lex("++p->lex_line=%zd", p->lex_line);
3116 p->lex_inbuf++; // skip trailing '/'
3118 G.err_line = p->lex_line;
3119 RETURN_STATUS(BC_STATUS_SUCCESS);
3121 #define zbc_lex_comment(...) (zbc_lex_comment(__VA_ARGS__) COMMA_SUCCESS)
3123 #undef zbc_lex_token
3124 static BC_STATUS zbc_lex_token(void)
3126 BcParse *p = &G.prs;
3127 BcStatus s = BC_STATUS_SUCCESS;
3128 char c = eat_inbuf();
3131 // This is the workhorse of the lexer.
3133 // case '\0': // probably never reached
3135 // p->lex = XC_LEX_EOF;
3139 dbg_lex("++p->lex_line=%zd", p->lex_line);
3140 p->lex = XC_LEX_NLINE;
3147 xc_lex_whitespace();
3150 parse_lex_by_checking_eq_sign(XC_LEX_OP_REL_NE, BC_LEX_OP_BOOL_NOT);
3151 if (p->lex == BC_LEX_OP_BOOL_NOT) {
3152 s = zbc_POSIX_does_not_allow_bool_ops_this_is_bad("!");
3153 if (s) RETURN_STATUS(s);
3157 s = zbc_lex_string();
3160 s = zbc_POSIX_does_not_allow("'#' script comments");
3161 if (s) RETURN_STATUS(s);
3162 xc_lex_lineComment();
3165 parse_lex_by_checking_eq_sign(BC_LEX_OP_ASSIGN_MODULUS, XC_LEX_OP_MODULUS);
3170 s = zbc_POSIX_does_not_allow_bool_ops_this_is_bad("&&");
3171 if (s) RETURN_STATUS(s);
3173 p->lex = BC_LEX_OP_BOOL_AND;
3175 p->lex = XC_LEX_INVALID;
3176 s = bc_error_bad_character('&');
3181 p->lex = (BcLexType)(c - '(' + BC_LEX_LPAREN);
3184 parse_lex_by_checking_eq_sign(BC_LEX_OP_ASSIGN_MULTIPLY, XC_LEX_OP_MULTIPLY);
3190 p->lex = BC_LEX_OP_INC;
3192 parse_lex_by_checking_eq_sign(BC_LEX_OP_ASSIGN_PLUS, XC_LEX_OP_PLUS);
3195 p->lex = BC_LEX_COMMA;
3201 p->lex = BC_LEX_OP_DEC;
3203 parse_lex_by_checking_eq_sign(BC_LEX_OP_ASSIGN_MINUS, XC_LEX_OP_MINUS);
3206 if (isdigit(*p->lex_inbuf))
3207 s = zxc_lex_number(c);
3209 p->lex = BC_LEX_KEY_LAST;
3210 s = zbc_POSIX_does_not_allow("'.' as 'last'");
3216 s = zbc_lex_comment();
3218 parse_lex_by_checking_eq_sign(BC_LEX_OP_ASSIGN_DIVIDE, XC_LEX_OP_DIVIDE);
3256 s = zxc_lex_number(c);
3259 p->lex = BC_LEX_SCOLON;
3262 parse_lex_by_checking_eq_sign(XC_LEX_OP_REL_LE, XC_LEX_OP_REL_LT);
3265 parse_lex_by_checking_eq_sign(XC_LEX_OP_REL_EQ, BC_LEX_OP_ASSIGN);
3268 parse_lex_by_checking_eq_sign(XC_LEX_OP_REL_GE, XC_LEX_OP_REL_GT);
3272 p->lex = (BcLexType)(c - '[' + BC_LEX_LBRACKET);
3275 if (*p->lex_inbuf == '\n') {
3276 p->lex = XC_LEX_WHITESPACE;
3279 s = bc_error_bad_character(c);
3282 parse_lex_by_checking_eq_sign(BC_LEX_OP_ASSIGN_POWER, XC_LEX_OP_POWER);
3310 s = zbc_lex_identifier();
3314 p->lex = (BcLexType)(c - '{' + BC_LEX_LBRACE);
3319 s = zbc_POSIX_does_not_allow_bool_ops_this_is_bad("||");
3320 if (s) RETURN_STATUS(s);
3322 p->lex = BC_LEX_OP_BOOL_OR;
3324 p->lex = XC_LEX_INVALID;
3325 s = bc_error_bad_character(c);
3329 p->lex = XC_LEX_INVALID;
3330 s = bc_error_bad_character(c);
3336 #define zbc_lex_token(...) (zbc_lex_token(__VA_ARGS__) COMMA_SUCCESS)
3340 static BC_STATUS zdc_lex_register(void)
3342 BcParse *p = &G.prs;
3343 if (G_exreg && isspace(*p->lex_inbuf)) {
3344 xc_lex_whitespace(); // eats whitespace (but not newline)
3345 p->lex_inbuf++; // xc_lex_name() expects this
3348 bc_vec_pop_all(&p->lex_strnumbuf);
3349 bc_vec_push(&p->lex_strnumbuf, p->lex_inbuf++);
3350 bc_vec_pushZeroByte(&p->lex_strnumbuf);
3351 p->lex = XC_LEX_NAME;
3354 RETURN_STATUS(BC_STATUS_SUCCESS);
3356 #define zdc_lex_register(...) (zdc_lex_register(__VA_ARGS__) COMMA_SUCCESS)
3358 static BC_STATUS zdc_lex_string(void)
3360 BcParse *p = &G.prs;
3363 p->lex = XC_LEX_STR;
3364 bc_vec_pop_all(&p->lex_strnumbuf);
3368 char c = peek_inbuf();
3370 RETURN_STATUS(bc_error("unterminated string"));
3372 if (c == '[') depth++;
3378 dbg_lex("++p->lex_line=%zd", p->lex_line);
3380 bc_vec_push(&p->lex_strnumbuf, p->lex_inbuf);
3383 bc_vec_pushZeroByte(&p->lex_strnumbuf);
3384 p->lex_inbuf++; // skip trailing ']'
3386 G.err_line = p->lex_line;
3387 RETURN_STATUS(BC_STATUS_SUCCESS);
3389 #define zdc_lex_string(...) (zdc_lex_string(__VA_ARGS__) COMMA_SUCCESS)
3391 #undef zdc_lex_token
3392 static BC_STATUS zdc_lex_token(void)
3394 static const //BcLexType - should be this type, but narrower type saves size:
3396 dc_lex_regs[] ALIGN1 = {
3397 XC_LEX_OP_REL_EQ, XC_LEX_OP_REL_LE, XC_LEX_OP_REL_GE, XC_LEX_OP_REL_NE,
3398 XC_LEX_OP_REL_LT, XC_LEX_OP_REL_GT, DC_LEX_SCOLON, DC_LEX_COLON,
3399 DC_LEX_ELSE, DC_LEX_LOAD, DC_LEX_LOAD_POP, DC_LEX_OP_ASSIGN,
3403 BcParse *p = &G.prs;
3408 for (i = 0; i < ARRAY_SIZE(dc_lex_regs); ++i) {
3409 if (p->lex_last == dc_lex_regs[i])
3410 RETURN_STATUS(zdc_lex_register());
3413 s = BC_STATUS_SUCCESS;
3415 if (c >= '%' && c <= '~'
3416 && (p->lex = dc_char_to_LEX[c - '%']) != XC_LEX_INVALID
3421 // This is the workhorse of the lexer.
3423 // case '\0': // probably never reached
3424 // p->lex = XC_LEX_EOF;
3427 // '\n' is XC_LEX_NLINE, not XC_LEX_WHITESPACE
3428 // (and "case '\n':" is not just empty here)
3429 // only to allow interactive dc have a way to exit
3430 // "parse" stage of "parse,execute" loop
3431 // on <enter>, not on _next_ token (which would mean
3432 // commands are not executed on pressing <enter>).
3433 // IOW: typing "1p<enter>" should print "1" _at once_,
3434 // not after some more input.
3436 dbg_lex("++p->lex_line=%zd", p->lex_line);
3437 p->lex = XC_LEX_NLINE;
3444 xc_lex_whitespace();
3449 p->lex = XC_LEX_OP_REL_NE;
3451 p->lex = XC_LEX_OP_REL_LE;
3453 p->lex = XC_LEX_OP_REL_GE;
3455 RETURN_STATUS(bc_error_bad_character(c));
3459 xc_lex_lineComment();
3462 if (isdigit(*p->lex_inbuf))
3463 s = zxc_lex_number(c);
3465 s = bc_error_bad_character(c);
3483 s = zxc_lex_number(c);
3486 s = zdc_lex_string();
3489 p->lex = XC_LEX_INVALID;
3490 s = bc_error_bad_character(c);
3496 #define zdc_lex_token(...) (zdc_lex_token(__VA_ARGS__) COMMA_SUCCESS)
3499 static void xc_parse_push(char i)
3501 BcVec *code = &G.prs.func->code;
3502 dbg_compile("%s:%d pushing bytecode %zd:%d", __func__, __LINE__, code->len, i);
3503 bc_vec_pushByte(code, i);
3506 static void xc_parse_pushName(char *name)
3509 BcVec *code = &G.prs.func->code;
3510 size_t pos = code->len;
3511 size_t len = strlen(name) + 1;
3513 bc_vec_expand(code, pos + len);
3514 strcpy(code->v + pos, name);
3515 code->len = pos + len;
3517 // Smaller code, but way slow:
3519 xc_parse_push(*name);
3524 // Indexes < 0xfc are encoded verbatim, else first byte is
3525 // 0xfc, 0xfd, 0xfe or 0xff, encoding "1..4 bytes",
3526 // followed by that many bytes, lsb first.
3527 // (The above describes 32-bit case).
3528 #define SMALL_INDEX_LIMIT (0x100 - sizeof(size_t))
3530 static void xc_parse_pushIndex(size_t idx)
3535 dbg_lex("%s:%d pushing index %zd", __func__, __LINE__, idx);
3536 if (idx < SMALL_INDEX_LIMIT) {
3541 mask = ((size_t)0xff) << (sizeof(idx) * 8 - 8);
3544 if (idx & mask) break;
3548 // amt is at least 1 here - "one byte of length data follows"
3550 xc_parse_push((SMALL_INDEX_LIMIT - 1) + amt);
3553 xc_parse_push((unsigned char)idx);
3559 static void bc_parse_pushJUMP(size_t idx)
3561 xc_parse_push(BC_INST_JUMP);
3562 xc_parse_pushIndex(idx);
3565 static void bc_parse_pushJUMP_ZERO(size_t idx)
3567 xc_parse_push(BC_INST_JUMP_ZERO);
3568 xc_parse_pushIndex(idx);
3571 static BC_STATUS zbc_parse_pushSTR(void)
3573 BcParse *p = &G.prs;
3574 char *str = xstrdup(p->lex_strnumbuf.v);
3576 xc_parse_push(XC_INST_STR);
3577 xc_parse_pushIndex(p->func->strs.len);
3578 bc_vec_push(&p->func->strs, &str);
3580 RETURN_STATUS(zxc_lex_next());
3582 #define zbc_parse_pushSTR(...) (zbc_parse_pushSTR(__VA_ARGS__) COMMA_SUCCESS)
3585 static void xc_parse_pushNUM(void)
3587 BcParse *p = &G.prs;
3588 char *num = xstrdup(p->lex_strnumbuf.v);
3589 #if ENABLE_BC && ENABLE_DC
3590 size_t idx = bc_vec_push(IS_BC ? &p->func->consts : &G.prog.consts, &num);
3592 size_t idx = bc_vec_push(&p->func->consts, &num);
3594 size_t idx = bc_vec_push(&G.prog.consts, &num);
3596 xc_parse_push(XC_INST_NUM);
3597 xc_parse_pushIndex(idx);
3600 static BC_STATUS zxc_parse_text_init(const char *text)
3602 G.prs.func = xc_program_func(G.prs.fidx);
3603 G.prs.lex_inbuf = text;
3604 G.prs.lex = G.prs.lex_last = XC_LEX_INVALID;
3605 RETURN_STATUS(zxc_lex_next());
3607 #define zxc_parse_text_init(...) (zxc_parse_text_init(__VA_ARGS__) COMMA_SUCCESS)
3609 // Called when parsing or execution detects a failure,
3610 // resets execution structures.
3611 static void xc_program_reset(void)
3616 bc_vec_npop(&G.prog.exestack, G.prog.exestack.len - 1);
3617 bc_vec_pop_all(&G.prog.results);
3619 f = xc_program_func_BC_PROG_MAIN();
3620 ip = bc_vec_top(&G.prog.exestack);
3621 ip->inst_idx = f->code.len;
3624 // Called when parsing code detects a failure,
3625 // resets parsing structures.
3626 static void xc_parse_reset(void)
3628 BcParse *p = &G.prs;
3629 if (p->fidx != BC_PROG_MAIN) {
3630 bc_func_free(p->func);
3631 bc_func_init(p->func);
3633 p->fidx = BC_PROG_MAIN;
3634 p->func = xc_program_func_BC_PROG_MAIN();
3637 p->lex_inbuf += strlen(p->lex_inbuf);
3638 p->lex = XC_LEX_EOF;
3640 IF_BC(bc_vec_pop_all(&p->exits);)
3641 IF_BC(bc_vec_pop_all(&p->conds);)
3642 IF_BC(bc_vec_pop_all(&p->ops);)
3647 static void xc_parse_free(void)
3649 IF_BC(bc_vec_free(&G.prs.exits);)
3650 IF_BC(bc_vec_free(&G.prs.conds);)
3651 IF_BC(bc_vec_free(&G.prs.ops);)
3652 bc_vec_free(&G.prs.lex_strnumbuf);
3655 static void xc_parse_create(size_t fidx)
3657 BcParse *p = &G.prs;
3658 memset(p, 0, sizeof(BcParse));
3660 bc_char_vec_init(&p->lex_strnumbuf);
3661 IF_BC(bc_vec_init(&p->exits, sizeof(size_t), NULL);)
3662 IF_BC(bc_vec_init(&p->conds, sizeof(size_t), NULL);)
3663 IF_BC(bc_vec_init(&p->ops, sizeof(BcLexType), NULL);)
3666 p->func = xc_program_func(fidx);
3669 static void xc_program_add_fn(void)
3675 bc_vec_push(&G.prog.fns, &f);
3681 // Note: takes ownership of 'name' (must be malloced)
3682 static size_t bc_program_addFunc(char *name)
3685 BcId entry, *entry_ptr;
3689 entry.idx = G.prog.fns.len;
3691 inserted = bc_map_insert(&G.prog.fn_map, &entry, &idx);
3692 if (!inserted) free(name);
3694 entry_ptr = bc_vec_item(&G.prog.fn_map, idx);
3695 idx = entry_ptr->idx;
3698 // There is already a function with this name.
3699 // It'll be redefined now, clear old definition.
3700 BcFunc *func = xc_program_func(entry_ptr->idx);
3704 xc_program_add_fn();
3710 #define BC_PARSE_TOP_OP(p) (*(BcLexType*)bc_vec_top(&(p)->ops))
3711 // We can calculate the conversion between tokens and exprs by subtracting the
3712 // position of the first operator in the lex enum and adding the position of the
3713 // first in the expr enum. Note: This only works for binary operators.
3714 #define BC_TOKEN_2_INST(t) ((char) ((t) - XC_LEX_OP_POWER + XC_INST_POWER))
3716 static BcStatus bc_parse_expr_empty_ok(uint8_t flags);
3718 static BC_STATUS zbc_parse_expr(uint8_t flags)
3722 s = bc_parse_expr_empty_ok(flags);
3723 if (s == BC_STATUS_PARSE_EMPTY_EXP)
3724 RETURN_STATUS(bc_error("empty expression"));
3727 #define zbc_parse_expr(...) (zbc_parse_expr(__VA_ARGS__) COMMA_SUCCESS)
3729 static BC_STATUS zbc_parse_stmt_possibly_auto(bool auto_allowed);
3730 #define zbc_parse_stmt_possibly_auto(...) (zbc_parse_stmt_possibly_auto(__VA_ARGS__) COMMA_SUCCESS)
3732 static BC_STATUS zbc_parse_stmt(void)
3734 RETURN_STATUS(zbc_parse_stmt_possibly_auto(false));
3736 #define zbc_parse_stmt(...) (zbc_parse_stmt(__VA_ARGS__) COMMA_SUCCESS)
3738 static BC_STATUS zbc_parse_stmt_allow_NLINE_before(const char *after_X)
3740 BcParse *p = &G.prs;
3741 // "if(cond)<newline>stmt" is accepted too, but not 2+ newlines.
3742 // Same for "else", "while()", "for()".
3743 BcStatus s = zbc_lex_next_and_skip_NLINE();
3744 if (s) RETURN_STATUS(s);
3745 if (p->lex == XC_LEX_NLINE)
3746 RETURN_STATUS(bc_error_fmt("no statement after '%s'", after_X));
3748 RETURN_STATUS(zbc_parse_stmt());
3750 #define zbc_parse_stmt_allow_NLINE_before(...) (zbc_parse_stmt_allow_NLINE_before(__VA_ARGS__) COMMA_SUCCESS)
3752 static void bc_parse_operator(BcLexType type, size_t start, size_t *nexprs)
3754 BcParse *p = &G.prs;
3755 char l, r = bc_operation_PREC(type - XC_LEX_1st_op);
3756 bool left = bc_operation_LEFT(type - XC_LEX_1st_op);
3758 while (p->ops.len > start) {
3759 BcLexType t = BC_PARSE_TOP_OP(p);
3760 if (t == BC_LEX_LPAREN) break;
3762 l = bc_operation_PREC(t - XC_LEX_1st_op);
3763 if (l >= r && (l != r || !left)) break;
3765 xc_parse_push(BC_TOKEN_2_INST(t));
3766 bc_vec_pop(&p->ops);
3767 *nexprs -= (t != BC_LEX_OP_BOOL_NOT && t != XC_LEX_NEG);
3770 bc_vec_push(&p->ops, &type);
3773 static BC_STATUS zbc_parse_rightParen(size_t ops_bgn, size_t *nexs)
3775 BcParse *p = &G.prs;
3778 if (p->ops.len <= ops_bgn)
3779 RETURN_STATUS(bc_error_bad_expression());
3780 top = BC_PARSE_TOP_OP(p);
3782 while (top != BC_LEX_LPAREN) {
3783 xc_parse_push(BC_TOKEN_2_INST(top));
3785 bc_vec_pop(&p->ops);
3786 *nexs -= (top != BC_LEX_OP_BOOL_NOT && top != XC_LEX_NEG);
3788 if (p->ops.len <= ops_bgn)
3789 RETURN_STATUS(bc_error_bad_expression());
3790 top = BC_PARSE_TOP_OP(p);
3793 bc_vec_pop(&p->ops);
3795 RETURN_STATUS(BC_STATUS_SUCCESS);
3797 #define zbc_parse_rightParen(...) (zbc_parse_rightParen(__VA_ARGS__) COMMA_SUCCESS)
3799 static BC_STATUS zbc_parse_params(uint8_t flags)
3801 BcParse *p = &G.prs;
3805 dbg_lex("%s:%d p->lex:%d", __func__, __LINE__, p->lex);
3806 flags = (flags & ~(BC_PARSE_PRINT | BC_PARSE_REL)) | BC_PARSE_ARRAY;
3809 if (s) RETURN_STATUS(s);
3812 if (p->lex != BC_LEX_RPAREN) {
3814 s = zbc_parse_expr(flags);
3815 if (s) RETURN_STATUS(s);
3817 if (p->lex != BC_LEX_COMMA) {
3818 if (p->lex == BC_LEX_RPAREN)
3820 RETURN_STATUS(bc_error_bad_token());
3823 if (s) RETURN_STATUS(s);
3827 xc_parse_push(BC_INST_CALL);
3828 xc_parse_pushIndex(nparams);
3830 RETURN_STATUS(BC_STATUS_SUCCESS);
3832 #define zbc_parse_params(...) (zbc_parse_params(__VA_ARGS__) COMMA_SUCCESS)
3834 // Note: takes ownership of 'name' (must be malloced)
3835 static BC_STATUS zbc_parse_call(char *name, uint8_t flags)
3837 BcParse *p = &G.prs;
3839 BcId entry, *entry_ptr;
3844 s = zbc_parse_params(flags);
3847 if (p->lex != BC_LEX_RPAREN) {
3848 s = bc_error_bad_token();
3852 idx = bc_map_find_exact(&G.prog.fn_map, &entry);
3854 if (idx == BC_VEC_INVALID_IDX) {
3855 // No such function exists, create an empty one
3856 bc_program_addFunc(name);
3857 idx = bc_map_find_exact(&G.prog.fn_map, &entry);
3861 entry_ptr = bc_vec_item(&G.prog.fn_map, idx);
3862 xc_parse_pushIndex(entry_ptr->idx);
3864 RETURN_STATUS(zxc_lex_next());
3869 #define zbc_parse_call(...) (zbc_parse_call(__VA_ARGS__) COMMA_SUCCESS)
3871 static BC_STATUS zbc_parse_name(BcInst *type, uint8_t flags)
3873 BcParse *p = &G.prs;
3877 name = xstrdup(p->lex_strnumbuf.v);
3881 if (p->lex == BC_LEX_LBRACKET) {
3885 if (p->lex == BC_LEX_RBRACKET) {
3886 if (!(flags & BC_PARSE_ARRAY)) {
3887 s = bc_error_bad_expression();
3890 *type = XC_INST_ARRAY;
3892 *type = XC_INST_ARRAY_ELEM;
3893 flags &= ~(BC_PARSE_PRINT | BC_PARSE_REL);
3894 s = zbc_parse_expr(flags);
3899 xc_parse_push(*type);
3900 xc_parse_pushName(name);
3902 } else if (p->lex == BC_LEX_LPAREN) {
3903 if (flags & BC_PARSE_NOCALL) {
3904 s = bc_error_bad_token();
3907 *type = BC_INST_CALL;
3908 s = zbc_parse_call(name, flags);
3910 *type = XC_INST_VAR;
3911 xc_parse_push(XC_INST_VAR);
3912 xc_parse_pushName(name);
3921 #define zbc_parse_name(...) (zbc_parse_name(__VA_ARGS__) COMMA_SUCCESS)
3923 static BC_STATUS zbc_parse_read(void)
3925 BcParse *p = &G.prs;
3929 if (s) RETURN_STATUS(s);
3930 if (p->lex != BC_LEX_LPAREN) RETURN_STATUS(bc_error_bad_token());
3933 if (s) RETURN_STATUS(s);
3934 if (p->lex != BC_LEX_RPAREN) RETURN_STATUS(bc_error_bad_token());
3936 xc_parse_push(XC_INST_READ);
3940 #define zbc_parse_read(...) (zbc_parse_read(__VA_ARGS__) COMMA_SUCCESS)
3942 static BC_STATUS zbc_parse_builtin(BcLexType type, uint8_t flags, BcInst *prev)
3944 BcParse *p = &G.prs;
3948 if (s) RETURN_STATUS(s);
3949 if (p->lex != BC_LEX_LPAREN) RETURN_STATUS(bc_error_bad_token());
3951 flags = (flags & ~(BC_PARSE_PRINT | BC_PARSE_REL)) | BC_PARSE_ARRAY;
3954 if (s) RETURN_STATUS(s);
3956 s = zbc_parse_expr(flags);
3957 if (s) RETURN_STATUS(s);
3959 if (p->lex != BC_LEX_RPAREN) RETURN_STATUS(bc_error_bad_token());
3961 *prev = (type == BC_LEX_KEY_LENGTH) ? XC_INST_LENGTH : XC_INST_SQRT;
3962 xc_parse_push(*prev);
3966 #define zbc_parse_builtin(...) (zbc_parse_builtin(__VA_ARGS__) COMMA_SUCCESS)
3968 static BC_STATUS zbc_parse_scale(BcInst *type, uint8_t flags)
3970 BcParse *p = &G.prs;
3974 if (s) RETURN_STATUS(s);
3976 if (p->lex != BC_LEX_LPAREN) {
3977 *type = XC_INST_SCALE;
3978 xc_parse_push(XC_INST_SCALE);
3979 RETURN_STATUS(BC_STATUS_SUCCESS);
3982 *type = XC_INST_SCALE_FUNC;
3983 flags &= ~(BC_PARSE_PRINT | BC_PARSE_REL);
3986 if (s) RETURN_STATUS(s);
3988 s = zbc_parse_expr(flags);
3989 if (s) RETURN_STATUS(s);
3990 if (p->lex != BC_LEX_RPAREN)
3991 RETURN_STATUS(bc_error_bad_token());
3992 xc_parse_push(XC_INST_SCALE_FUNC);
3994 RETURN_STATUS(zxc_lex_next());
3996 #define zbc_parse_scale(...) (zbc_parse_scale(__VA_ARGS__) COMMA_SUCCESS)
3998 static BC_STATUS zbc_parse_incdec(BcInst *prev, size_t *nexs, uint8_t flags)
4000 BcParse *p = &G.prs;
4004 BcInst etype = *prev;
4006 if (etype == XC_INST_VAR || etype == XC_INST_ARRAY_ELEM
4007 || etype == XC_INST_SCALE || etype == BC_INST_LAST
4008 || etype == XC_INST_IBASE || etype == XC_INST_OBASE
4010 *prev = inst = BC_INST_INC_POST + (p->lex != BC_LEX_OP_INC);
4011 xc_parse_push(inst);
4014 *prev = inst = BC_INST_INC_PRE + (p->lex != BC_LEX_OP_INC);
4017 if (s) RETURN_STATUS(s);
4020 // Because we parse the next part of the expression
4021 // right here, we need to increment this.
4026 s = zbc_parse_name(prev, flags | BC_PARSE_NOCALL);
4028 case BC_LEX_KEY_IBASE:
4029 case BC_LEX_KEY_LAST:
4030 case BC_LEX_KEY_OBASE:
4031 xc_parse_push(type - BC_LEX_KEY_IBASE + XC_INST_IBASE);
4034 case BC_LEX_KEY_SCALE:
4036 if (s) RETURN_STATUS(s);
4037 if (p->lex == BC_LEX_LPAREN)
4038 s = bc_error_bad_token();
4040 xc_parse_push(XC_INST_SCALE);
4043 s = bc_error_bad_token();
4047 if (!s) xc_parse_push(inst);
4052 #define zbc_parse_incdec(...) (zbc_parse_incdec(__VA_ARGS__) COMMA_SUCCESS)
4054 static int bc_parse_inst_isLeaf(BcInst p)
4056 return (p >= XC_INST_NUM && p <= XC_INST_SQRT)
4057 || p == BC_INST_INC_POST
4058 || p == BC_INST_DEC_POST
4061 #define BC_PARSE_LEAF(prev, bin_last, rparen) \
4062 (!(bin_last) && ((rparen) || bc_parse_inst_isLeaf(prev)))
4064 static BC_STATUS zbc_parse_minus(BcInst *prev, size_t ops_bgn,
4065 bool rparen, bool bin_last, size_t *nexprs)
4067 BcParse *p = &G.prs;
4072 if (s) RETURN_STATUS(s);
4074 type = BC_PARSE_LEAF(*prev, bin_last, rparen) ? XC_LEX_OP_MINUS : XC_LEX_NEG;
4075 *prev = BC_TOKEN_2_INST(type);
4077 // We can just push onto the op stack because this is the largest
4078 // precedence operator that gets pushed. Inc/dec does not.
4079 if (type != XC_LEX_OP_MINUS)
4080 bc_vec_push(&p->ops, &type);
4082 bc_parse_operator(type, ops_bgn, nexprs);
4086 #define zbc_parse_minus(...) (zbc_parse_minus(__VA_ARGS__) COMMA_SUCCESS)
4088 static BC_STATUS zbc_parse_print(void)
4090 BcParse *p = &G.prs;
4096 if (s) RETURN_STATUS(s);
4098 if (type == XC_LEX_STR) {
4099 s = zbc_parse_pushSTR();
4101 s = zbc_parse_expr(0);
4103 if (s) RETURN_STATUS(s);
4104 xc_parse_push(XC_INST_PRINT_POP);
4105 if (p->lex != BC_LEX_COMMA)
4111 #define zbc_parse_print(...) (zbc_parse_print(__VA_ARGS__) COMMA_SUCCESS)
4113 static BC_STATUS zbc_parse_return(void)
4115 BcParse *p = &G.prs;
4119 dbg_lex_enter("%s:%d entered", __func__, __LINE__);
4121 if (s) RETURN_STATUS(s);
4124 if (t == XC_LEX_NLINE || t == BC_LEX_SCOLON || t == BC_LEX_RBRACE)
4125 xc_parse_push(BC_INST_RET0);
4127 s = zbc_parse_expr(0);
4128 if (s) RETURN_STATUS(s);
4130 if (t != BC_LEX_LPAREN // "return EXPR", no ()
4131 || p->lex_last != BC_LEX_RPAREN // example: "return (a) + b"
4133 s = zbc_POSIX_requires("parentheses around return expressions");
4134 if (s) RETURN_STATUS(s);
4137 xc_parse_push(XC_INST_RET);
4140 dbg_lex_done("%s:%d done", __func__, __LINE__);
4143 #define zbc_parse_return(...) (zbc_parse_return(__VA_ARGS__) COMMA_SUCCESS)
4145 static void rewrite_label_to_current(size_t idx)
4147 BcParse *p = &G.prs;
4148 size_t *label = bc_vec_item(&p->func->labels, idx);
4149 *label = p->func->code.len;
4152 static BC_STATUS zbc_parse_if(void)
4154 BcParse *p = &G.prs;
4158 dbg_lex_enter("%s:%d entered", __func__, __LINE__);
4160 if (s) RETURN_STATUS(s);
4161 if (p->lex != BC_LEX_LPAREN) RETURN_STATUS(bc_error_bad_token());
4164 if (s) RETURN_STATUS(s);
4165 s = zbc_parse_expr(BC_PARSE_REL);
4166 if (s) RETURN_STATUS(s);
4167 if (p->lex != BC_LEX_RPAREN) RETURN_STATUS(bc_error_bad_token());
4169 // Encode "if zero, jump to ..."
4170 // Pushed value (destination of the jump) is uninitialized,
4171 // will be rewritten to be address of "end of if()" or of "else".
4172 ip_idx = bc_vec_push(&p->func->labels, &ip_idx);
4173 bc_parse_pushJUMP_ZERO(ip_idx);
4175 s = zbc_parse_stmt_allow_NLINE_before(STRING_if);
4176 if (s) RETURN_STATUS(s);
4178 dbg_lex("%s:%d in if after stmt: p->lex:%d", __func__, __LINE__, p->lex);
4179 if (p->lex == BC_LEX_KEY_ELSE) {
4182 // Encode "after then_stmt, jump to end of if()"
4183 ip2_idx = bc_vec_push(&p->func->labels, &ip2_idx);
4184 dbg_lex("%s:%d after if() then_stmt: BC_INST_JUMP to %zd", __func__, __LINE__, ip2_idx);
4185 bc_parse_pushJUMP(ip2_idx);
4187 dbg_lex("%s:%d rewriting 'if_zero' label to jump to 'else'-> %zd", __func__, __LINE__, p->func->code.len);
4188 rewrite_label_to_current(ip_idx);
4192 s = zbc_parse_stmt_allow_NLINE_before(STRING_else);
4193 if (s) RETURN_STATUS(s);
4196 dbg_lex("%s:%d rewriting label to jump after 'if' body-> %zd", __func__, __LINE__, p->func->code.len);
4197 rewrite_label_to_current(ip_idx);
4199 dbg_lex_done("%s:%d done", __func__, __LINE__);
4202 #define zbc_parse_if(...) (zbc_parse_if(__VA_ARGS__) COMMA_SUCCESS)
4204 static BC_STATUS zbc_parse_while(void)
4206 BcParse *p = &G.prs;
4212 if (s) RETURN_STATUS(s);
4213 if (p->lex != BC_LEX_LPAREN) RETURN_STATUS(bc_error_bad_token());
4215 if (s) RETURN_STATUS(s);
4217 cond_idx = bc_vec_push(&p->func->labels, &p->func->code.len);
4218 ip_idx = cond_idx + 1;
4219 bc_vec_push(&p->conds, &cond_idx);
4221 bc_vec_push(&p->exits, &ip_idx);
4222 bc_vec_push(&p->func->labels, &ip_idx);
4224 s = zbc_parse_expr(BC_PARSE_REL);
4225 if (s) RETURN_STATUS(s);
4226 if (p->lex != BC_LEX_RPAREN) RETURN_STATUS(bc_error_bad_token());
4228 bc_parse_pushJUMP_ZERO(ip_idx);
4230 s = zbc_parse_stmt_allow_NLINE_before(STRING_while);
4231 if (s) RETURN_STATUS(s);
4233 dbg_lex("%s:%d BC_INST_JUMP to %zd", __func__, __LINE__, cond_idx);
4234 bc_parse_pushJUMP(cond_idx);
4236 dbg_lex("%s:%d rewriting label-> %zd", __func__, __LINE__, p->func->code.len);
4237 rewrite_label_to_current(ip_idx);
4239 bc_vec_pop(&p->exits);
4240 bc_vec_pop(&p->conds);
4244 #define zbc_parse_while(...) (zbc_parse_while(__VA_ARGS__) COMMA_SUCCESS)
4246 static BC_STATUS zbc_parse_for(void)
4248 BcParse *p = &G.prs;
4250 size_t cond_idx, exit_idx, body_idx, update_idx;
4252 dbg_lex("%s:%d p->lex:%d", __func__, __LINE__, p->lex);
4254 if (s) RETURN_STATUS(s);
4255 if (p->lex != BC_LEX_LPAREN) RETURN_STATUS(bc_error_bad_token());
4257 if (s) RETURN_STATUS(s);
4259 if (p->lex != BC_LEX_SCOLON) {
4260 s = zbc_parse_expr(0);
4261 xc_parse_push(XC_INST_POP);
4262 if (s) RETURN_STATUS(s);
4264 s = zbc_POSIX_does_not_allow_empty_X_expression_in_for("init");
4265 if (s) RETURN_STATUS(s);
4268 if (p->lex != BC_LEX_SCOLON) RETURN_STATUS(bc_error_bad_token());
4270 if (s) RETURN_STATUS(s);
4272 cond_idx = bc_vec_push(&p->func->labels, &p->func->code.len);
4273 update_idx = cond_idx + 1;
4274 body_idx = update_idx + 1;
4275 exit_idx = body_idx + 1;
4277 if (p->lex != BC_LEX_SCOLON)
4278 s = zbc_parse_expr(BC_PARSE_REL);
4280 // Set this for the next call to xc_parse_pushNUM().
4281 // This is safe to set because the current token is a semicolon,
4282 // which has no string requirement.
4283 bc_vec_string(&p->lex_strnumbuf, 1, "1");
4285 s = zbc_POSIX_does_not_allow_empty_X_expression_in_for("condition");
4287 if (s) RETURN_STATUS(s);
4289 if (p->lex != BC_LEX_SCOLON) RETURN_STATUS(bc_error_bad_token());
4292 if (s) RETURN_STATUS(s);
4294 bc_parse_pushJUMP_ZERO(exit_idx);
4295 bc_parse_pushJUMP(body_idx);
4297 bc_vec_push(&p->conds, &update_idx);
4298 bc_vec_push(&p->func->labels, &p->func->code.len);
4300 if (p->lex != BC_LEX_RPAREN) {
4301 s = zbc_parse_expr(0);
4302 if (s) RETURN_STATUS(s);
4303 if (p->lex != BC_LEX_RPAREN) RETURN_STATUS(bc_error_bad_token());
4304 xc_parse_push(XC_INST_POP);
4306 s = zbc_POSIX_does_not_allow_empty_X_expression_in_for("update");
4307 if (s) RETURN_STATUS(s);
4310 bc_parse_pushJUMP(cond_idx);
4311 bc_vec_push(&p->func->labels, &p->func->code.len);
4313 bc_vec_push(&p->exits, &exit_idx);
4314 bc_vec_push(&p->func->labels, &exit_idx);
4316 s = zbc_parse_stmt_allow_NLINE_before(STRING_for);
4317 if (s) RETURN_STATUS(s);
4319 dbg_lex("%s:%d BC_INST_JUMP to %zd", __func__, __LINE__, update_idx);
4320 bc_parse_pushJUMP(update_idx);
4322 dbg_lex("%s:%d rewriting label-> %zd", __func__, __LINE__, p->func->code.len);
4323 rewrite_label_to_current(exit_idx);
4325 bc_vec_pop(&p->exits);
4326 bc_vec_pop(&p->conds);
4328 RETURN_STATUS(BC_STATUS_SUCCESS);
4330 #define zbc_parse_for(...) (zbc_parse_for(__VA_ARGS__) COMMA_SUCCESS)
4332 static BC_STATUS zbc_parse_break_or_continue(BcLexType type)
4334 BcParse *p = &G.prs;
4337 if (type == BC_LEX_KEY_BREAK) {
4338 if (p->exits.len == 0) // none of the enclosing blocks is a loop
4339 RETURN_STATUS(bc_error_bad_token());
4340 i = *(size_t*)bc_vec_top(&p->exits);
4342 i = *(size_t*)bc_vec_top(&p->conds);
4344 bc_parse_pushJUMP(i);
4346 RETURN_STATUS(zxc_lex_next());
4348 #define zbc_parse_break_or_continue(...) (zbc_parse_break_or_continue(__VA_ARGS__) COMMA_SUCCESS)
4350 static BC_STATUS zbc_func_insert(BcFunc *f, char *name, bool var)
4356 autoid = (void*)f->autos.v;
4357 for (i = 0; i < f->autos.len; i++, autoid++) {
4358 if (strcmp(name, autoid->name) == 0
4359 && var == autoid->idx
4361 RETURN_STATUS(bc_error("duplicate function parameter or auto name"));
4368 bc_vec_push(&f->autos, &a);
4370 RETURN_STATUS(BC_STATUS_SUCCESS);
4372 #define zbc_func_insert(...) (zbc_func_insert(__VA_ARGS__) COMMA_SUCCESS)
4374 static BC_STATUS zbc_parse_funcdef(void)
4376 BcParse *p = &G.prs;
4378 bool var, comma = false;
4381 dbg_lex_enter("%s:%d entered", __func__, __LINE__);
4383 if (s) RETURN_STATUS(s);
4384 if (p->lex != XC_LEX_NAME)
4385 RETURN_STATUS(bc_error_bad_function_definition());
4387 name = xstrdup(p->lex_strnumbuf.v);
4388 p->fidx = bc_program_addFunc(name);
4389 p->func = xc_program_func(p->fidx);
4392 if (s) RETURN_STATUS(s);
4393 if (p->lex != BC_LEX_LPAREN)
4394 RETURN_STATUS(bc_error_bad_function_definition());
4396 if (s) RETURN_STATUS(s);
4398 while (p->lex != BC_LEX_RPAREN) {
4399 if (p->lex != XC_LEX_NAME)
4400 RETURN_STATUS(bc_error_bad_function_definition());
4404 name = xstrdup(p->lex_strnumbuf.v);
4408 var = p->lex != BC_LEX_LBRACKET;
4414 if (p->lex != BC_LEX_RBRACKET) {
4415 s = bc_error_bad_function_definition();
4423 comma = p->lex == BC_LEX_COMMA;
4429 s = zbc_func_insert(p->func, name, var);
4433 if (comma) RETURN_STATUS(bc_error_bad_function_definition());
4436 if (s) RETURN_STATUS(s);
4438 if (p->lex != BC_LEX_LBRACE) {
4439 s = zbc_POSIX_requires("the left brace be on the same line as the function header");
4440 if (s) RETURN_STATUS(s);
4443 // Prevent "define z()<newline>" from being interpreted as function with empty stmt as body
4444 s = zbc_lex_skip_if_at_NLINE();
4445 if (s) RETURN_STATUS(s);
4446 //GNU bc requires a {} block even if function body has single stmt, enforce this?
4447 if (p->lex != BC_LEX_LBRACE)
4448 RETURN_STATUS(bc_error("function { body } expected"));
4450 p->in_funcdef++; // to determine whether "return" stmt is allowed, and such
4451 s = zbc_parse_stmt_possibly_auto(true);
4453 if (s) RETURN_STATUS(s);
4455 xc_parse_push(BC_INST_RET0);
4457 // Subsequent code generation is into main program
4458 p->fidx = BC_PROG_MAIN;
4459 p->func = xc_program_func_BC_PROG_MAIN();
4461 dbg_lex_done("%s:%d done", __func__, __LINE__);
4464 dbg_lex_done("%s:%d done (error)", __func__, __LINE__);
4468 #define zbc_parse_funcdef(...) (zbc_parse_funcdef(__VA_ARGS__) COMMA_SUCCESS)
4470 static BC_STATUS zbc_parse_auto(void)
4472 BcParse *p = &G.prs;
4476 dbg_lex_enter("%s:%d entered", __func__, __LINE__);
4478 if (s) RETURN_STATUS(s);
4483 if (p->lex != XC_LEX_NAME)
4484 RETURN_STATUS(bc_error_at("bad 'auto' syntax"));
4486 name = xstrdup(p->lex_strnumbuf.v);
4490 var = (p->lex != BC_LEX_LBRACKET);
4495 if (p->lex != BC_LEX_RBRACKET) {
4496 s = bc_error_at("bad 'auto' syntax");
4503 s = zbc_func_insert(p->func, name, var);
4506 if (p->lex == XC_LEX_NLINE
4507 || p->lex == BC_LEX_SCOLON
4508 //|| p->lex == BC_LEX_RBRACE // allow "define f() {auto a}"
4512 if (p->lex != BC_LEX_COMMA)
4513 RETURN_STATUS(bc_error_at("bad 'auto' syntax"));
4514 s = zxc_lex_next(); // skip comma
4515 if (s) RETURN_STATUS(s);
4518 dbg_lex_done("%s:%d done", __func__, __LINE__);
4519 RETURN_STATUS(BC_STATUS_SUCCESS);
4522 dbg_lex_done("%s:%d done (ERROR)", __func__, __LINE__);
4525 #define zbc_parse_auto(...) (zbc_parse_auto(__VA_ARGS__) COMMA_SUCCESS)
4527 #undef zbc_parse_stmt_possibly_auto
4528 static BC_STATUS zbc_parse_stmt_possibly_auto(bool auto_allowed)
4530 BcParse *p = &G.prs;
4531 BcStatus s = BC_STATUS_SUCCESS;
4533 dbg_lex_enter("%s:%d entered, p->lex:%d", __func__, __LINE__, p->lex);
4535 if (p->lex == XC_LEX_NLINE) {
4536 dbg_lex_done("%s:%d done (seen XC_LEX_NLINE)", __func__, __LINE__);
4537 RETURN_STATUS(zxc_lex_next());
4539 if (p->lex == BC_LEX_SCOLON) {
4540 dbg_lex_done("%s:%d done (seen BC_LEX_SCOLON)", __func__, __LINE__);
4541 RETURN_STATUS(zxc_lex_next());
4544 if (p->lex == BC_LEX_LBRACE) {
4545 dbg_lex("%s:%d BC_LEX_LBRACE: (auto_allowed:%d)", __func__, __LINE__, auto_allowed);
4548 if (s) RETURN_STATUS(s);
4549 } while (p->lex == XC_LEX_NLINE);
4550 if (auto_allowed && p->lex == BC_LEX_KEY_AUTO) {
4551 dbg_lex("%s:%d calling zbc_parse_auto()", __func__, __LINE__);
4552 s = zbc_parse_auto();
4553 if (s) RETURN_STATUS(s);
4555 while (p->lex != BC_LEX_RBRACE) {
4556 dbg_lex("%s:%d block parsing loop", __func__, __LINE__);
4557 s = zbc_parse_stmt();
4558 if (s) RETURN_STATUS(s);
4561 dbg_lex_done("%s:%d done (seen BC_LEX_RBRACE)", __func__, __LINE__);
4565 dbg_lex("%s:%d p->lex:%d", __func__, __LINE__, p->lex);
4567 case XC_LEX_OP_MINUS:
4570 case BC_LEX_OP_BOOL_NOT:
4574 case BC_LEX_KEY_IBASE:
4575 case BC_LEX_KEY_LAST:
4576 case BC_LEX_KEY_LENGTH:
4577 case BC_LEX_KEY_OBASE:
4578 case BC_LEX_KEY_READ:
4579 case BC_LEX_KEY_SCALE:
4580 case BC_LEX_KEY_SQRT:
4581 s = zbc_parse_expr(BC_PARSE_PRINT);
4584 s = zbc_parse_pushSTR();
4585 xc_parse_push(XC_INST_PRINT_STR);
4587 case BC_LEX_KEY_BREAK:
4588 case BC_LEX_KEY_CONTINUE:
4589 s = zbc_parse_break_or_continue(p->lex);
4591 case BC_LEX_KEY_FOR:
4592 s = zbc_parse_for();
4594 case BC_LEX_KEY_HALT:
4595 xc_parse_push(BC_INST_HALT);
4601 case BC_LEX_KEY_LIMITS:
4602 // "limits" is a compile-time command,
4603 // the output is produced at _parse time_.
4605 "BC_BASE_MAX = "BC_MAX_OBASE_STR "\n"
4606 "BC_DIM_MAX = "BC_MAX_DIM_STR "\n"
4607 "BC_SCALE_MAX = "BC_MAX_SCALE_STR "\n"
4608 "BC_STRING_MAX = "BC_MAX_STRING_STR"\n"
4609 "BC_NAME_MAX = "BC_MAX_NAME_STR "\n"
4610 "BC_NUM_MAX = "BC_MAX_NUM_STR "\n"
4611 "MAX Exponent = "BC_MAX_EXP_STR "\n"
4612 "Number of vars = "BC_MAX_VARS_STR "\n"
4616 case BC_LEX_KEY_PRINT:
4617 s = zbc_parse_print();
4619 case BC_LEX_KEY_QUIT:
4620 // "quit" is a compile-time command. For example,
4621 // "if (0 == 1) quit" terminates when parsing the statement,
4622 // not when it is executed
4623 QUIT_OR_RETURN_TO_MAIN;
4624 case BC_LEX_KEY_RETURN:
4626 RETURN_STATUS(bc_error("'return' not in a function"));
4627 s = zbc_parse_return();
4629 case BC_LEX_KEY_WHILE:
4630 s = zbc_parse_while();
4633 s = bc_error_bad_token();
4637 dbg_lex_done("%s:%d done", __func__, __LINE__);
4640 #define zbc_parse_stmt_possibly_auto(...) (zbc_parse_stmt_possibly_auto(__VA_ARGS__) COMMA_SUCCESS)
4642 static BC_STATUS zbc_parse_stmt_or_funcdef(void)
4644 BcParse *p = &G.prs;
4647 dbg_lex_enter("%s:%d entered", __func__, __LINE__);
4648 if (p->lex == XC_LEX_EOF)
4649 s = bc_error("end of file");
4650 else if (p->lex == BC_LEX_KEY_DEFINE) {
4651 dbg_lex("%s:%d p->lex:BC_LEX_KEY_DEFINE", __func__, __LINE__);
4652 s = zbc_parse_funcdef();
4654 dbg_lex("%s:%d p->lex:%d (not BC_LEX_KEY_DEFINE)", __func__, __LINE__, p->lex);
4655 s = zbc_parse_stmt();
4658 dbg_lex_done("%s:%d done", __func__, __LINE__);
4661 #define zbc_parse_stmt_or_funcdef(...) (zbc_parse_stmt_or_funcdef(__VA_ARGS__) COMMA_SUCCESS)
4663 // This is not a "z" function: can also return BC_STATUS_PARSE_EMPTY_EXP
4664 static BcStatus bc_parse_expr_empty_ok(uint8_t flags)
4666 BcParse *p = &G.prs;
4667 BcInst prev = XC_INST_PRINT;
4668 size_t nexprs = 0, ops_bgn = p->ops.len;
4669 unsigned nparens, nrelops;
4670 bool paren_first, rprn, assign, bin_last, incdec;
4672 dbg_lex_enter("%s:%d entered", __func__, __LINE__);
4673 paren_first = (p->lex == BC_LEX_LPAREN);
4674 nparens = nrelops = 0;
4675 rprn = assign = incdec = false;
4681 BcLexType t = p->lex;
4683 if (!lex_allowed_in_bc_expr(t))
4686 dbg_lex("%s:%d t:%d", __func__, __LINE__, t);
4688 s = BC_STATUS_SUCCESS;
4692 dbg_lex("%s:%d LEX_OP_INC/DEC", __func__, __LINE__);
4693 if (incdec) return bc_error_bad_assignment();
4694 s = zbc_parse_incdec(&prev, &nexprs, flags);
4696 rprn = bin_last = false;
4697 //get_token = false; - already is
4699 case XC_LEX_OP_MINUS:
4700 dbg_lex("%s:%d LEX_OP_MINUS", __func__, __LINE__);
4701 s = zbc_parse_minus(&prev, ops_bgn, rprn, bin_last, &nexprs);
4703 //get_token = false; - already is
4704 bin_last = (prev == XC_INST_MINUS);
4705 if (bin_last) incdec = false;
4707 case BC_LEX_OP_ASSIGN_POWER:
4708 case BC_LEX_OP_ASSIGN_MULTIPLY:
4709 case BC_LEX_OP_ASSIGN_DIVIDE:
4710 case BC_LEX_OP_ASSIGN_MODULUS:
4711 case BC_LEX_OP_ASSIGN_PLUS:
4712 case BC_LEX_OP_ASSIGN_MINUS:
4713 case BC_LEX_OP_ASSIGN:
4714 dbg_lex("%s:%d LEX_ASSIGNxyz", __func__, __LINE__);
4715 if (prev != XC_INST_VAR && prev != XC_INST_ARRAY_ELEM
4716 && prev != XC_INST_SCALE && prev != XC_INST_IBASE
4717 && prev != XC_INST_OBASE && prev != BC_INST_LAST
4719 return bc_error_bad_assignment();
4722 case XC_LEX_OP_POWER:
4723 case XC_LEX_OP_MULTIPLY:
4724 case XC_LEX_OP_DIVIDE:
4725 case XC_LEX_OP_MODULUS:
4726 case XC_LEX_OP_PLUS:
4727 case XC_LEX_OP_REL_EQ:
4728 case XC_LEX_OP_REL_LE:
4729 case XC_LEX_OP_REL_GE:
4730 case XC_LEX_OP_REL_NE:
4731 case XC_LEX_OP_REL_LT:
4732 case XC_LEX_OP_REL_GT:
4733 case BC_LEX_OP_BOOL_NOT:
4734 case BC_LEX_OP_BOOL_OR:
4735 case BC_LEX_OP_BOOL_AND:
4736 dbg_lex("%s:%d LEX_OP_xyz", __func__, __LINE__);
4737 if (t == BC_LEX_OP_BOOL_NOT) {
4738 if (!bin_last && p->lex_last != BC_LEX_OP_BOOL_NOT)
4739 return bc_error_bad_expression();
4740 } else if (prev == XC_INST_BOOL_NOT) {
4741 return bc_error_bad_expression();
4744 nrelops += (t >= XC_LEX_OP_REL_EQ && t <= XC_LEX_OP_REL_GT);
4745 prev = BC_TOKEN_2_INST(t);
4746 bc_parse_operator(t, ops_bgn, &nexprs);
4747 rprn = incdec = false;
4749 bin_last = (t != BC_LEX_OP_BOOL_NOT);
4752 dbg_lex("%s:%d LEX_LPAREN", __func__, __LINE__);
4753 if (BC_PARSE_LEAF(prev, bin_last, rprn))
4754 return bc_error_bad_expression();
4755 bc_vec_push(&p->ops, &t);
4758 rprn = incdec = false;
4761 dbg_lex("%s:%d LEX_RPAREN", __func__, __LINE__);
4762 if (p->lex_last == BC_LEX_LPAREN) {
4763 dbg_lex_done("%s:%d done (returning EMPTY_EXP)", __func__, __LINE__);
4764 return BC_STATUS_PARSE_EMPTY_EXP;
4766 if (bin_last || prev == XC_INST_BOOL_NOT)
4767 return bc_error_bad_expression();
4771 s = zbc_parse_rightParen(ops_bgn, &nexprs);
4775 bin_last = incdec = false;
4778 dbg_lex("%s:%d LEX_NAME", __func__, __LINE__);
4779 if (BC_PARSE_LEAF(prev, bin_last, rprn))
4780 return bc_error_bad_expression();
4781 s = zbc_parse_name(&prev, flags & ~BC_PARSE_NOCALL);
4782 rprn = (prev == BC_INST_CALL);
4784 //get_token = false; - already is
4788 dbg_lex("%s:%d LEX_NUMBER", __func__, __LINE__);
4789 if (BC_PARSE_LEAF(prev, bin_last, rprn))
4790 return bc_error_bad_expression();
4794 rprn = bin_last = false;
4797 case BC_LEX_KEY_IBASE:
4798 case BC_LEX_KEY_LAST:
4799 case BC_LEX_KEY_OBASE:
4800 dbg_lex("%s:%d LEX_IBASE/LAST/OBASE", __func__, __LINE__);
4801 if (BC_PARSE_LEAF(prev, bin_last, rprn))
4802 return bc_error_bad_expression();
4803 prev = (char) (t - BC_LEX_KEY_IBASE + XC_INST_IBASE);
4804 xc_parse_push((char) prev);
4806 rprn = bin_last = false;
4809 case BC_LEX_KEY_LENGTH:
4810 case BC_LEX_KEY_SQRT:
4811 dbg_lex("%s:%d LEX_LEN/SQRT", __func__, __LINE__);
4812 if (BC_PARSE_LEAF(prev, bin_last, rprn))
4813 return bc_error_bad_expression();
4814 s = zbc_parse_builtin(t, flags, &prev);
4816 rprn = bin_last = incdec = false;
4819 case BC_LEX_KEY_READ:
4820 dbg_lex("%s:%d LEX_READ", __func__, __LINE__);
4821 if (BC_PARSE_LEAF(prev, bin_last, rprn))
4822 return bc_error_bad_expression();
4823 s = zbc_parse_read();
4824 prev = XC_INST_READ;
4826 rprn = bin_last = incdec = false;
4829 case BC_LEX_KEY_SCALE:
4830 dbg_lex("%s:%d LEX_SCALE", __func__, __LINE__);
4831 if (BC_PARSE_LEAF(prev, bin_last, rprn))
4832 return bc_error_bad_expression();
4833 s = zbc_parse_scale(&prev, flags);
4834 //get_token = false; - already is
4835 rprn = bin_last = false;
4839 return bc_error_bad_token();
4842 if (s || G_interrupt) // error, or ^C: stop parsing
4843 return BC_STATUS_FAILURE;
4851 while (p->ops.len > ops_bgn) {
4852 BcLexType top = BC_PARSE_TOP_OP(p);
4853 assign = (top >= BC_LEX_OP_ASSIGN_POWER && top <= BC_LEX_OP_ASSIGN);
4855 if (top == BC_LEX_LPAREN || top == BC_LEX_RPAREN)
4856 return bc_error_bad_expression();
4858 xc_parse_push(BC_TOKEN_2_INST(top));
4860 nexprs -= (top != BC_LEX_OP_BOOL_NOT && top != XC_LEX_NEG);
4861 bc_vec_pop(&p->ops);
4864 if (prev == XC_INST_BOOL_NOT || nexprs != 1)
4865 return bc_error_bad_expression();
4867 if (!(flags & BC_PARSE_REL) && nrelops) {
4869 s = zbc_POSIX_does_not_allow("comparison operators outside if or loops");
4871 } else if ((flags & BC_PARSE_REL) && nrelops > 1) {
4873 s = zbc_POSIX_requires("exactly one comparison operator per condition");
4877 if (flags & BC_PARSE_PRINT) {
4878 if (paren_first || !assign)
4879 xc_parse_push(XC_INST_PRINT);
4880 xc_parse_push(XC_INST_POP);
4883 dbg_lex_done("%s:%d done", __func__, __LINE__);
4884 return BC_STATUS_SUCCESS;
4891 static BC_STATUS zdc_parse_register(void)
4893 BcParse *p = &G.prs;
4897 if (s) RETURN_STATUS(s);
4898 if (p->lex != XC_LEX_NAME) RETURN_STATUS(bc_error_bad_token());
4900 xc_parse_pushName(p->lex_strnumbuf.v);
4904 #define zdc_parse_register(...) (zdc_parse_register(__VA_ARGS__) COMMA_SUCCESS)
4906 static void dc_parse_string(void)
4908 BcParse *p = &G.prs;
4910 size_t len = G.prog.strs.len;
4912 dbg_lex_enter("%s:%d entered", __func__, __LINE__);
4914 str = xstrdup(p->lex_strnumbuf.v);
4915 xc_parse_push(XC_INST_STR);
4916 xc_parse_pushIndex(len);
4917 bc_vec_push(&G.prog.strs, &str);
4919 // Explanation needed here
4920 xc_program_add_fn();
4921 p->func = xc_program_func(p->fidx);
4923 dbg_lex_done("%s:%d done", __func__, __LINE__);
4926 static BC_STATUS zdc_parse_mem(uint8_t inst, bool name, bool store)
4930 xc_parse_push(inst);
4932 s = zdc_parse_register();
4933 if (s) RETURN_STATUS(s);
4937 xc_parse_push(DC_INST_SWAP);
4938 xc_parse_push(XC_INST_ASSIGN);
4939 xc_parse_push(XC_INST_POP);
4942 RETURN_STATUS(BC_STATUS_SUCCESS);
4944 #define zdc_parse_mem(...) (zdc_parse_mem(__VA_ARGS__) COMMA_SUCCESS)
4946 static BC_STATUS zdc_parse_cond(uint8_t inst)
4948 BcParse *p = &G.prs;
4951 xc_parse_push(inst);
4952 xc_parse_push(DC_INST_EXEC_COND);
4954 s = zdc_parse_register();
4955 if (s) RETURN_STATUS(s);
4958 if (s) RETURN_STATUS(s);
4960 // Note that 'else' part can not be on the next line:
4961 // echo -e '[1p]sa [2p]sb 2 1>a eb' | dc - OK, prints "2"
4962 // echo -e '[1p]sa [2p]sb 2 1>a\neb' | dc - parse error
4963 if (p->lex == DC_LEX_ELSE) {
4964 s = zdc_parse_register();
4965 if (s) RETURN_STATUS(s);
4968 xc_parse_push('\0');
4973 #define zdc_parse_cond(...) (zdc_parse_cond(__VA_ARGS__) COMMA_SUCCESS)
4975 static BC_STATUS zdc_parse_token(BcLexType t)
4979 bool assign, get_token;
4981 dbg_lex_enter("%s:%d entered", __func__, __LINE__);
4982 s = BC_STATUS_SUCCESS;
4985 case XC_LEX_OP_REL_EQ:
4986 case XC_LEX_OP_REL_LE:
4987 case XC_LEX_OP_REL_GE:
4988 case XC_LEX_OP_REL_NE:
4989 case XC_LEX_OP_REL_LT:
4990 case XC_LEX_OP_REL_GT:
4991 dbg_lex("%s:%d LEX_OP_REL_xyz", __func__, __LINE__);
4992 s = zdc_parse_cond(t - XC_LEX_OP_REL_EQ + XC_INST_REL_EQ);
4997 dbg_lex("%s:%d LEX_[S]COLON", __func__, __LINE__);
4998 s = zdc_parse_mem(XC_INST_ARRAY_ELEM, true, t == DC_LEX_COLON);
5001 dbg_lex("%s:%d LEX_STR", __func__, __LINE__);
5005 dbg_lex("%s:%d LEX_NEG", __func__, __LINE__);
5007 if (s) RETURN_STATUS(s);
5008 if (G.prs.lex != XC_LEX_NUMBER)
5009 RETURN_STATUS(bc_error_bad_token());
5011 xc_parse_push(XC_INST_NEG);
5014 dbg_lex("%s:%d LEX_NUMBER", __func__, __LINE__);
5018 dbg_lex("%s:%d LEX_KEY_READ", __func__, __LINE__);
5019 xc_parse_push(XC_INST_READ);
5021 case DC_LEX_OP_ASSIGN:
5022 case DC_LEX_STORE_PUSH:
5023 dbg_lex("%s:%d LEX_OP_ASSIGN/STORE_PUSH", __func__, __LINE__);
5024 assign = (t == DC_LEX_OP_ASSIGN);
5025 inst = assign ? XC_INST_VAR : DC_INST_PUSH_TO_VAR;
5026 s = zdc_parse_mem(inst, true, assign);
5029 case DC_LEX_LOAD_POP:
5030 dbg_lex("%s:%d LEX_OP_LOAD[_POP]", __func__, __LINE__);
5031 inst = t == DC_LEX_LOAD_POP ? DC_INST_PUSH_VAR : DC_INST_LOAD;
5032 s = zdc_parse_mem(inst, true, false);
5034 case DC_LEX_STORE_IBASE:
5035 case DC_LEX_STORE_SCALE:
5036 case DC_LEX_STORE_OBASE:
5037 dbg_lex("%s:%d LEX_OP_STORE_I/OBASE/SCALE", __func__, __LINE__);
5038 inst = t - DC_LEX_STORE_IBASE + XC_INST_IBASE;
5039 s = zdc_parse_mem(inst, false, true);
5042 dbg_lex_done("%s:%d done (bad token)", __func__, __LINE__);
5043 RETURN_STATUS(bc_error_bad_token());
5046 if (!s && get_token) s = zxc_lex_next();
5048 dbg_lex_done("%s:%d done", __func__, __LINE__);
5051 #define zdc_parse_token(...) (zdc_parse_token(__VA_ARGS__) COMMA_SUCCESS)
5053 static BC_STATUS zdc_parse_expr(void)
5055 BcParse *p = &G.prs;
5058 i = (int)p->lex - (int)XC_LEX_OP_POWER;
5060 BcInst inst = dc_LEX_to_INST[i];
5061 if (inst != DC_INST_INVALID) {
5062 xc_parse_push(inst);
5063 RETURN_STATUS(zxc_lex_next());
5066 RETURN_STATUS(zdc_parse_token(p->lex));
5068 #define zdc_parse_expr(...) (zdc_parse_expr(__VA_ARGS__) COMMA_SUCCESS)
5070 static BC_STATUS zdc_parse_exprs_until_eof(void)
5072 BcParse *p = &G.prs;
5073 dbg_lex_enter("%s:%d entered, p->lex:%d", __func__, __LINE__, p->lex);
5074 while (p->lex != XC_LEX_EOF) {
5075 BcStatus s = zdc_parse_expr();
5076 if (s) RETURN_STATUS(s);
5079 dbg_lex_done("%s:%d done", __func__, __LINE__);
5080 RETURN_STATUS(BC_STATUS_SUCCESS);
5082 #define zdc_parse_exprs_until_eof(...) (zdc_parse_exprs_until_eof(__VA_ARGS__) COMMA_SUCCESS)
5090 #define BC_PROG_STR(n) (!(n)->num && !(n)->cap)
5091 #define BC_PROG_NUM(r, n) \
5092 ((r)->t != XC_RESULT_ARRAY && (r)->t != XC_RESULT_STR && !BC_PROG_STR(n))
5094 #define STACK_HAS_MORE_THAN(s, n) ((s)->len > ((size_t)(n)))
5095 #define STACK_HAS_EQUAL_OR_MORE_THAN(s, n) ((s)->len >= ((size_t)(n)))
5097 static BcVec* xc_program_search(char *id, bool var)
5104 v = var ? &G.prog.vars : &G.prog.arrs;
5105 map = var ? &G.prog.var_map : &G.prog.arr_map;
5109 new = bc_map_insert(map, &e, &i); // 1 if insertion was successful
5113 bc_array_init(&v2, var);
5114 bc_vec_push(v, &v2);
5117 ptr = bc_vec_item(map, i);
5118 if (new) ptr->name = xstrdup(e.name);
5119 return bc_vec_item(v, ptr->idx);
5122 // 'num' need not be initialized on entry
5123 static BC_STATUS zxc_program_num(BcResult *r, BcNum **num)
5127 case XC_RESULT_TEMP:
5128 case XC_RESULT_IBASE:
5129 case XC_RESULT_SCALE:
5130 case XC_RESULT_OBASE:
5133 case XC_RESULT_CONSTANT: {
5138 str = *xc_program_const(r->d.id.idx);
5141 bc_num_init(&r->d.n, len);
5143 s = zxc_num_parse(&r->d.n, str, G.prog.ib_t);
5145 bc_num_free(&r->d.n);
5149 r->t = XC_RESULT_TEMP;
5153 case XC_RESULT_ARRAY:
5154 case XC_RESULT_ARRAY_ELEM: {
5157 v = xc_program_search(r->d.id.name, r->t == XC_RESULT_VAR);
5158 // dc variables are all stacks, so here we have this:
5160 // TODO: eliminate these stacks for bc-only config?
5161 if (r->t == XC_RESULT_ARRAY_ELEM) {
5163 if (v->len <= r->d.id.idx)
5164 bc_array_expand(v, r->d.id.idx + 1);
5165 *num = bc_vec_item(v, r->d.id.idx);
5172 case BC_RESULT_LAST:
5173 *num = &G.prog.last;
5181 // Testing the theory that dc does not reach LAST/ONE
5182 bb_error_msg_and_die("BUG:%d", r->t);
5186 RETURN_STATUS(BC_STATUS_SUCCESS);
5188 #define zxc_program_num(...) (zxc_program_num(__VA_ARGS__) COMMA_SUCCESS)
5190 static BC_STATUS zxc_program_binOpPrep(BcResult **l, BcNum **ln,
5191 BcResult **r, BcNum **rn, bool assign)
5194 BcResultType lt, rt;
5196 if (!STACK_HAS_MORE_THAN(&G.prog.results, 1))
5197 RETURN_STATUS(bc_error_stack_has_too_few_elements());
5199 *r = bc_vec_item_rev(&G.prog.results, 0);
5200 *l = bc_vec_item_rev(&G.prog.results, 1);
5202 s = zxc_program_num(*l, ln);
5203 if (s) RETURN_STATUS(s);
5204 s = zxc_program_num(*r, rn);
5205 if (s) RETURN_STATUS(s);
5210 // We run this again under these conditions in case any vector has been
5211 // reallocated out from under the BcNums or arrays we had.
5212 if (lt == rt && (lt == XC_RESULT_VAR || lt == XC_RESULT_ARRAY_ELEM)) {
5213 s = zxc_program_num(*l, ln);
5214 if (s) RETURN_STATUS(s);
5217 if (!BC_PROG_NUM((*l), (*ln)) && (!assign || (*l)->t != XC_RESULT_VAR))
5218 RETURN_STATUS(bc_error_variable_is_wrong_type());
5219 if (!assign && !BC_PROG_NUM((*r), (*ln)))
5220 RETURN_STATUS(bc_error_variable_is_wrong_type());
5224 #define zxc_program_binOpPrep(...) (zxc_program_binOpPrep(__VA_ARGS__) COMMA_SUCCESS)
5226 static void xc_program_binOpRetire(BcResult *r)
5228 r->t = XC_RESULT_TEMP;
5229 bc_vec_pop(&G.prog.results);
5230 bc_result_pop_and_push(r);
5233 // Note: *r and *n need not be initialized by caller
5234 static BC_STATUS zxc_program_prep(BcResult **r, BcNum **n)
5238 if (!STACK_HAS_MORE_THAN(&G.prog.results, 0))
5239 RETURN_STATUS(bc_error_stack_has_too_few_elements());
5240 *r = bc_vec_top(&G.prog.results);
5242 s = zxc_program_num(*r, n);
5243 if (s) RETURN_STATUS(s);
5245 if (!BC_PROG_NUM((*r), (*n)))
5246 RETURN_STATUS(bc_error_variable_is_wrong_type());
5250 #define zxc_program_prep(...) (zxc_program_prep(__VA_ARGS__) COMMA_SUCCESS)
5252 static void xc_program_retire(BcResult *r, BcResultType t)
5255 bc_result_pop_and_push(r);
5258 static BC_STATUS zxc_program_op(char inst)
5261 BcResult *opd1, *opd2, res;
5264 s = zxc_program_binOpPrep(&opd1, &n1, &opd2, &n2, false);
5265 if (s) RETURN_STATUS(s);
5266 bc_num_init_DEF_SIZE(&res.d.n);
5268 s = BC_STATUS_SUCCESS;
5269 IF_ERROR_RETURN_POSSIBLE(s =) zxc_program_ops[inst - XC_INST_POWER](n1, n2, &res.d.n, G.prog.scale);
5271 xc_program_binOpRetire(&res);
5275 bc_num_free(&res.d.n);
5278 #define zxc_program_op(...) (zxc_program_op(__VA_ARGS__) COMMA_SUCCESS)
5280 static BC_STATUS zxc_program_read(void)
5288 bc_char_vec_init(&buf);
5289 xc_read_line(&buf, stdin);
5291 f = xc_program_func(BC_PROG_READ);
5292 bc_vec_pop_all(&f->code);
5294 sv_parse = G.prs; // struct copy
5295 xc_parse_create(BC_PROG_READ);
5296 //G.err_line = G.prs.lex_line = 1; - not needed, error line info is not printed for read()
5298 s = zxc_parse_text_init(buf.v);
5299 if (s) goto exec_err;
5301 IF_BC(s = zbc_parse_expr(0));
5303 IF_DC(s = zdc_parse_exprs_until_eof());
5305 if (s) goto exec_err;
5306 if (G.prs.lex != XC_LEX_NLINE && G.prs.lex != XC_LEX_EOF) {
5307 s = bc_error_at("bad read() expression");
5310 xc_parse_push(XC_INST_RET);
5312 ip.func = BC_PROG_READ;
5314 IF_BC(ip.results_len_before_call = G.prog.results.len;)
5315 bc_vec_push(&G.prog.exestack, &ip);
5319 G.prs = sv_parse; // struct copy
5323 #define zxc_program_read(...) (zxc_program_read(__VA_ARGS__) COMMA_SUCCESS)
5325 static size_t xc_program_index(char *code, size_t *bgn)
5327 unsigned char *bytes = (void*)(code + *bgn);
5333 if (amt < SMALL_INDEX_LIMIT) {
5337 amt -= (SMALL_INDEX_LIMIT - 1); // amt is 1 or more here
5343 res |= (size_t)(*bytes++) << i;
5345 } while (--amt != 0);
5350 static char *xc_program_name(char *code, size_t *bgn)
5353 *bgn += strlen(code) + 1;
5355 return xstrdup(code);
5358 static void xc_program_printString(const char *str)
5361 if (!str[0] && IS_DC) {
5362 // Example: echo '[]ap' | dc
5363 // should print two bytes: 0x00, 0x0A
5371 static const char esc[] ALIGN1 = "nabfrt""e\\";
5375 n = strchr(esc, c); // note: c can be NUL
5377 // Just print the backslash and following character
5381 if (n - esc == 0) // "\n" ?
5382 G.prog.nchars = SIZE_MAX;
5383 c = "\n\a\b\f\r\t""\\\\""\\"[n - esc];
5384 // n a b f r t e \ \<end of line>
5392 static void bc_num_printNewline(void)
5394 if (G.prog.nchars == G.prog.len - 1) {
5402 static FAST_FUNC void dc_num_printChar(size_t num, size_t width, bool radix)
5405 bb_putchar((char) num);
5406 G.prog.nchars += width;
5410 static FAST_FUNC void bc_num_printDigits(size_t num, size_t width, bool radix)
5414 bc_num_printNewline();
5415 bb_putchar(radix ? '.' : ' ');
5418 bc_num_printNewline();
5419 for (exp = 0, pow = 1; exp < width - 1; ++exp, pow *= 10)
5422 for (exp = 0; exp < width; pow /= 10, ++G.prog.nchars, ++exp) {
5424 bc_num_printNewline();
5427 bb_putchar(((char) dig) + '0');
5431 static FAST_FUNC void bc_num_printHex(size_t num, size_t width, bool radix)
5434 bc_num_printNewline();
5439 bc_num_printNewline();
5440 bb_putchar(bb_hexdigits_upcase[num]);
5441 G.prog.nchars += width;
5444 static void bc_num_printDecimal(BcNum *n)
5446 size_t i, rdx = n->rdx - 1;
5453 for (i = n->len - 1; i < n->len; --i)
5454 bc_num_printHex((size_t) n->num[i], 1, i == rdx);
5457 typedef void (*BcNumDigitOp)(size_t, size_t, bool) FAST_FUNC;
5459 static BC_STATUS zxc_num_printNum(BcNum *n, unsigned base_t, size_t width, BcNumDigitOp print)
5464 BcDig base_digs[ULONG_NUM_BUFSIZE];
5465 BcNum intp, fracp, digit, frac_len;
5466 unsigned long dig, *ptr;
5471 print(0, width, false);
5472 RETURN_STATUS(BC_STATUS_SUCCESS);
5475 bc_vec_init(&stack, sizeof(long), NULL);
5476 bc_num_init(&intp, n->len);
5477 bc_num_init(&fracp, n->rdx);
5478 bc_num_init(&digit, width);
5479 bc_num_init(&frac_len, BC_NUM_INT(n));
5480 bc_num_copy(&intp, n);
5481 bc_num_one(&frac_len);
5482 base.cap = ARRAY_SIZE(base_digs);
5483 base.num = base_digs;
5484 bc_num_ulong2num(&base, base_t);
5486 bc_num_truncate(&intp, intp.rdx);
5487 s = zbc_num_sub(n, &intp, &fracp, 0);
5490 while (intp.len != 0) {
5491 s = zbc_num_divmod(&intp, &base, &intp, &digit, 0);
5493 s = zbc_num_ulong(&digit, &dig);
5495 bc_vec_push(&stack, &dig);
5498 for (i = 0; i < stack.len; ++i) {
5499 ptr = bc_vec_item_rev(&stack, i);
5500 print(*ptr, width, false);
5503 if (!n->rdx) goto err;
5505 for (radix = true; frac_len.len <= n->rdx; radix = false) {
5506 s = zbc_num_mul(&fracp, &base, &fracp, n->rdx);
5508 s = zbc_num_ulong(&fracp, &dig);
5510 bc_num_ulong2num(&intp, dig);
5511 s = zbc_num_sub(&fracp, &intp, &fracp, 0);
5513 print(dig, width, radix);
5514 s = zbc_num_mul(&frac_len, &base, &frac_len, 0);
5518 bc_num_free(&frac_len);
5519 bc_num_free(&digit);
5520 bc_num_free(&fracp);
5522 bc_vec_free(&stack);
5525 #define zxc_num_printNum(...) (zxc_num_printNum(__VA_ARGS__) COMMA_SUCCESS)
5527 static BC_STATUS zxc_num_printBase(BcNum *n)
5541 if (G.prog.ob_t <= 16) {
5543 print = bc_num_printHex;
5545 unsigned i = G.prog.ob_t - 1;
5553 print = bc_num_printDigits;
5556 s = zxc_num_printNum(n, G.prog.ob_t, width, print);
5561 #define zxc_num_printBase(...) (zxc_num_printBase(__VA_ARGS__) COMMA_SUCCESS)
5563 static BC_STATUS zxc_num_print(BcNum *n, bool newline)
5565 BcStatus s = BC_STATUS_SUCCESS;
5567 bc_num_printNewline();
5572 } else if (G.prog.ob_t == 10)
5573 bc_num_printDecimal(n);
5575 s = zxc_num_printBase(n);
5584 #define zxc_num_print(...) (zxc_num_print(__VA_ARGS__) COMMA_SUCCESS)
5586 static BC_STATUS zxc_program_print(char inst, size_t idx)
5591 bool pop = (inst != XC_INST_PRINT);
5593 if (!STACK_HAS_MORE_THAN(&G.prog.results, idx))
5594 RETURN_STATUS(bc_error_stack_has_too_few_elements());
5596 r = bc_vec_item_rev(&G.prog.results, idx);
5597 s = zxc_program_num(r, &num);
5598 if (s) RETURN_STATUS(s);
5600 if (BC_PROG_NUM(r, num)) {
5601 s = zxc_num_print(num, !pop);
5603 if (!s && IS_BC) bc_num_copy(&G.prog.last, num);
5608 idx = (r->t == XC_RESULT_STR) ? r->d.id.idx : num->rdx;
5609 str = *xc_program_str(idx);
5611 if (inst == XC_INST_PRINT_STR) {
5613 G.prog.nchars += printf("%s", str);
5614 nl = strrchr(str, '\n');
5616 G.prog.nchars = strlen(nl + 1);
5618 xc_program_printString(str);
5619 if (inst == XC_INST_PRINT)
5624 if (!s && pop) bc_vec_pop(&G.prog.results);
5628 #define zxc_program_print(...) (zxc_program_print(__VA_ARGS__) COMMA_SUCCESS)
5630 static BC_STATUS zxc_program_negate(void)
5636 s = zxc_program_prep(&ptr, &num);
5637 if (s) RETURN_STATUS(s);
5639 bc_num_init(&res.d.n, num->len);
5640 bc_num_copy(&res.d.n, num);
5641 if (res.d.n.len) res.d.n.neg = !res.d.n.neg;
5643 xc_program_retire(&res, XC_RESULT_TEMP);
5647 #define zxc_program_negate(...) (zxc_program_negate(__VA_ARGS__) COMMA_SUCCESS)
5649 static BC_STATUS zxc_program_logical(char inst)
5652 BcResult *opd1, *opd2, res;
5656 s = zxc_program_binOpPrep(&opd1, &n1, &opd2, &n2, false);
5657 if (s) RETURN_STATUS(s);
5659 bc_num_init_DEF_SIZE(&res.d.n);
5661 if (inst == XC_INST_BOOL_AND)
5662 cond = bc_num_cmp(n1, &G.prog.zero) && bc_num_cmp(n2, &G.prog.zero);
5663 else if (inst == XC_INST_BOOL_OR)
5664 cond = bc_num_cmp(n1, &G.prog.zero) || bc_num_cmp(n2, &G.prog.zero);
5666 cond = bc_num_cmp(n1, n2);
5668 case XC_INST_REL_EQ:
5671 case XC_INST_REL_LE:
5674 case XC_INST_REL_GE:
5677 case XC_INST_REL_LT:
5680 case XC_INST_REL_GT:
5683 default: // = case XC_INST_REL_NE:
5684 //cond = (cond != 0); - not needed
5689 if (cond) bc_num_one(&res.d.n);
5690 //else bc_num_zero(&res.d.n); - already is
5692 xc_program_binOpRetire(&res);
5696 #define zxc_program_logical(...) (zxc_program_logical(__VA_ARGS__) COMMA_SUCCESS)
5699 static BC_STATUS zdc_program_assignStr(BcResult *r, BcVec *v, bool push)
5704 memset(&n2, 0, sizeof(BcNum));
5705 n2.rdx = res.d.id.idx = r->d.id.idx;
5706 res.t = XC_RESULT_STR;
5709 if (!STACK_HAS_MORE_THAN(&G.prog.results, 1))
5710 RETURN_STATUS(bc_error_stack_has_too_few_elements());
5712 bc_vec_pop(&G.prog.results);
5715 bc_result_pop_and_push(&res);
5716 bc_vec_push(v, &n2);
5718 RETURN_STATUS(BC_STATUS_SUCCESS);
5720 #define zdc_program_assignStr(...) (zdc_program_assignStr(__VA_ARGS__) COMMA_SUCCESS)
5723 static BC_STATUS zxc_program_copyToVar(char *name, bool var)
5730 if (!STACK_HAS_MORE_THAN(&G.prog.results, 0))
5731 RETURN_STATUS(bc_error_stack_has_too_few_elements());
5733 ptr = bc_vec_top(&G.prog.results);
5734 if ((ptr->t == XC_RESULT_ARRAY) != !var)
5735 RETURN_STATUS(bc_error_variable_is_wrong_type());
5736 v = xc_program_search(name, var);
5739 if (ptr->t == XC_RESULT_STR && !var)
5740 RETURN_STATUS(bc_error_variable_is_wrong_type());
5741 if (ptr->t == XC_RESULT_STR)
5742 RETURN_STATUS(zdc_program_assignStr(ptr, v, true));
5745 s = zxc_program_num(ptr, &n);
5746 if (s) RETURN_STATUS(s);
5748 // Do this once more to make sure that pointers were not invalidated.
5749 v = xc_program_search(name, var);
5752 bc_num_init_DEF_SIZE(&r.d.n);
5753 bc_num_copy(&r.d.n, n);
5755 bc_array_init(&r.d.v, true);
5756 bc_array_copy(&r.d.v, (BcVec *) n);
5759 bc_vec_push(v, &r.d);
5760 bc_vec_pop(&G.prog.results);
5764 #define zxc_program_copyToVar(...) (zxc_program_copyToVar(__VA_ARGS__) COMMA_SUCCESS)
5766 static BC_STATUS zxc_program_assign(char inst)
5769 BcResult *left, *right, res;
5771 bool assign = (inst == XC_INST_ASSIGN);
5774 s = zxc_program_binOpPrep(&left, &l, &right, &r, assign);
5775 if (s) RETURN_STATUS(s);
5777 ib = left->t == XC_RESULT_IBASE;
5778 sc = left->t == XC_RESULT_SCALE;
5781 if (right->t == XC_RESULT_STR) {
5784 if (left->t != XC_RESULT_VAR)
5785 RETURN_STATUS(bc_error_variable_is_wrong_type());
5786 v = xc_program_search(left->d.id.name, true);
5788 RETURN_STATUS(zdc_program_assignStr(right, v, false));
5792 if (left->t == XC_RESULT_CONSTANT || left->t == XC_RESULT_TEMP)
5793 RETURN_STATUS(bc_error_bad_assignment());
5799 s = BC_STATUS_SUCCESS;
5800 IF_ERROR_RETURN_POSSIBLE(s =) zxc_program_ops[inst - BC_INST_ASSIGN_POWER](l, r, l, G.prog.scale);
5802 if (s) RETURN_STATUS(s);
5807 if (ib || sc || left->t == XC_RESULT_OBASE) {
5808 static const char *const msg[] = {
5809 "bad ibase; must be [2,16]", //XC_RESULT_IBASE
5810 "bad obase; must be [2,"BC_MAX_OBASE_STR"]", //XC_RESULT_OBASE
5811 "bad scale; must be [0,"BC_MAX_SCALE_STR"]", //XC_RESULT_SCALE
5817 s = zbc_num_ulong(l, &val);
5818 if (s) RETURN_STATUS(s);
5819 s = left->t - XC_RESULT_IBASE;
5822 ptr = &G.prog.scale;
5825 RETURN_STATUS(bc_error(msg[s]));
5826 max = ib ? BC_NUM_MAX_IBASE : BC_MAX_OBASE;
5827 ptr = ib ? &G.prog.ib_t : &G.prog.ob_t;
5831 RETURN_STATUS(bc_error(msg[s]));
5833 *ptr = (size_t) val;
5834 s = BC_STATUS_SUCCESS;
5837 bc_num_init(&res.d.n, l->len);
5838 bc_num_copy(&res.d.n, l);
5839 xc_program_binOpRetire(&res);
5843 #define zxc_program_assign(...) (zxc_program_assign(__VA_ARGS__) COMMA_SUCCESS)
5846 #define xc_program_pushVar(code, bgn, pop, copy) \
5847 xc_program_pushVar(code, bgn)
5848 // for bc, 'pop' and 'copy' are always false
5850 static BC_STATUS xc_program_pushVar(char *code, size_t *bgn,
5851 bool pop, bool copy)
5854 char *name = xc_program_name(code, bgn);
5856 r.t = XC_RESULT_VAR;
5861 BcVec *v = xc_program_search(name, true);
5862 BcNum *num = bc_vec_top(v);
5865 if (!STACK_HAS_MORE_THAN(v, 1 - copy)) {
5866 RETURN_STATUS(bc_error_stack_has_too_few_elements());
5869 if (!BC_PROG_STR(num)) {
5870 r.t = XC_RESULT_TEMP;
5871 bc_num_init_DEF_SIZE(&r.d.n);
5872 bc_num_copy(&r.d.n, num);
5874 r.t = XC_RESULT_STR;
5875 r.d.id.idx = num->rdx;
5878 if (!copy) bc_vec_pop(v);
5882 bc_vec_push(&G.prog.results, &r);
5884 RETURN_STATUS(BC_STATUS_SUCCESS);
5886 #define zxc_program_pushVar(...) (xc_program_pushVar(__VA_ARGS__) COMMA_SUCCESS)
5888 static BC_STATUS zbc_program_pushArray(char *code, size_t *bgn, char inst)
5890 BcStatus s = BC_STATUS_SUCCESS;
5894 r.d.id.name = xc_program_name(code, bgn);
5896 if (inst == XC_INST_ARRAY) {
5897 r.t = XC_RESULT_ARRAY;
5898 bc_vec_push(&G.prog.results, &r);
5903 s = zxc_program_prep(&operand, &num);
5905 s = zbc_num_ulong(num, &temp);
5908 if (temp > BC_MAX_DIM) {
5909 s = bc_error("array too long; must be [1,"BC_MAX_DIM_STR"]");
5913 r.d.id.idx = (size_t) temp;
5914 xc_program_retire(&r, XC_RESULT_ARRAY_ELEM);
5917 if (s) free(r.d.id.name);
5920 #define zbc_program_pushArray(...) (zbc_program_pushArray(__VA_ARGS__) COMMA_SUCCESS)
5923 static BC_STATUS zbc_program_incdec(char inst)
5926 BcResult *ptr, res, copy;
5930 s = zxc_program_prep(&ptr, &num);
5931 if (s) RETURN_STATUS(s);
5933 if (inst == BC_INST_INC_POST || inst == BC_INST_DEC_POST) {
5934 copy.t = XC_RESULT_TEMP;
5935 bc_num_init(©.d.n, num->len);
5936 bc_num_copy(©.d.n, num);
5939 res.t = BC_RESULT_ONE;
5940 inst = (inst == BC_INST_INC_PRE || inst == BC_INST_INC_POST)
5941 ? BC_INST_ASSIGN_PLUS
5942 : BC_INST_ASSIGN_MINUS;
5944 bc_vec_push(&G.prog.results, &res);
5945 s = zxc_program_assign(inst);
5946 if (s) RETURN_STATUS(s);
5948 if (inst2 == BC_INST_INC_POST || inst2 == BC_INST_DEC_POST) {
5949 bc_result_pop_and_push(©);
5954 #define zbc_program_incdec(...) (zbc_program_incdec(__VA_ARGS__) COMMA_SUCCESS)
5956 static BC_STATUS zbc_program_call(char *code, size_t *idx)
5963 nparams = xc_program_index(code, idx);
5964 ip.func = xc_program_index(code, idx);
5965 func = xc_program_func(ip.func);
5967 if (func->code.len == 0) {
5968 RETURN_STATUS(bc_error("undefined function"));
5970 if (nparams != func->nparams) {
5971 RETURN_STATUS(bc_error_fmt("function has %u parameters, but called with %u", func->nparams, nparams));
5974 ip.results_len_before_call = G.prog.results.len - 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_copyToVar(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 (!STACK_HAS_EQUAL_OR_MORE_THAN(&G.prog.results, ip->results_len_before_call + (inst == XC_INST_RET)))
6023 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6025 f = xc_program_func(ip->func);
6026 res.t = XC_RESULT_TEMP;
6028 if (inst == XC_INST_RET) {
6031 BcResult *operand = bc_vec_top(&G.prog.results);
6033 s = zxc_program_num(operand, &num);
6034 if (s) RETURN_STATUS(s);
6035 bc_num_init(&res.d.n, num->len);
6036 bc_num_copy(&res.d.n, num);
6038 bc_num_init_DEF_SIZE(&res.d.n);
6039 //bc_num_zero(&res.d.n); - already is
6042 // We need to pop arguments as well, so this takes that into account.
6043 a = (void*)f->autos.v;
6044 for (i = 0; i < f->autos.len; i++, a++) {
6046 v = xc_program_search(a->name, a->idx);
6050 bc_vec_npop(&G.prog.results, G.prog.results.len - ip->results_len_before_call);
6051 bc_vec_push(&G.prog.results, &res);
6052 bc_vec_pop(&G.prog.exestack);
6054 RETURN_STATUS(BC_STATUS_SUCCESS);
6056 #define zbc_program_return(...) (zbc_program_return(__VA_ARGS__) COMMA_SUCCESS)
6059 static unsigned long xc_program_scale(BcNum *n)
6061 return (unsigned long) n->rdx;
6064 static unsigned long xc_program_len(BcNum *n)
6066 size_t len = n->len;
6068 if (n->rdx != len) return len;
6070 if (len == 0) break;
6072 if (n->num[len] != 0) break;
6077 static BC_STATUS zxc_program_builtin(char inst)
6083 bool len = (inst == XC_INST_LENGTH);
6085 if (!STACK_HAS_MORE_THAN(&G.prog.results, 0))
6086 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6087 opnd = bc_vec_top(&G.prog.results);
6089 s = zxc_program_num(opnd, &num);
6090 if (s) RETURN_STATUS(s);
6093 if (!BC_PROG_NUM(opnd, num) && !len)
6094 RETURN_STATUS(bc_error_variable_is_wrong_type());
6097 bc_num_init_DEF_SIZE(&res.d.n);
6099 if (inst == XC_INST_SQRT)
6100 s = zbc_num_sqrt(num, &res.d.n, G.prog.scale);
6102 else if (len != 0 && opnd->t == XC_RESULT_ARRAY) {
6103 bc_num_ulong2num(&res.d.n, (unsigned long) ((BcVec *) num)->len);
6107 else if (len != 0 && !BC_PROG_NUM(opnd, num)) {
6109 size_t idx = opnd->t == XC_RESULT_STR ? opnd->d.id.idx : num->rdx;
6111 str = xc_program_str(idx);
6112 bc_num_ulong2num(&res.d.n, strlen(*str));
6116 bc_num_ulong2num(&res.d.n, len ? xc_program_len(num) : xc_program_scale(num));
6119 xc_program_retire(&res, XC_RESULT_TEMP);
6123 #define zxc_program_builtin(...) (zxc_program_builtin(__VA_ARGS__) COMMA_SUCCESS)
6126 static BC_STATUS zdc_program_divmod(void)
6129 BcResult *opd1, *opd2, res, res2;
6132 s = zxc_program_binOpPrep(&opd1, &n1, &opd2, &n2, false);
6133 if (s) RETURN_STATUS(s);
6135 bc_num_init_DEF_SIZE(&res.d.n);
6136 bc_num_init(&res2.d.n, n2->len);
6138 s = zbc_num_divmod(n1, n2, &res2.d.n, &res.d.n, G.prog.scale);
6141 xc_program_binOpRetire(&res2);
6142 res.t = XC_RESULT_TEMP;
6143 bc_vec_push(&G.prog.results, &res);
6147 bc_num_free(&res2.d.n);
6148 bc_num_free(&res.d.n);
6151 #define zdc_program_divmod(...) (zdc_program_divmod(__VA_ARGS__) COMMA_SUCCESS)
6153 static BC_STATUS zdc_program_modexp(void)
6156 BcResult *r1, *r2, *r3, res;
6157 BcNum *n1, *n2, *n3;
6159 if (!STACK_HAS_MORE_THAN(&G.prog.results, 2))
6160 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6161 s = zxc_program_binOpPrep(&r2, &n2, &r3, &n3, false);
6162 if (s) RETURN_STATUS(s);
6164 r1 = bc_vec_item_rev(&G.prog.results, 2);
6165 s = zxc_program_num(r1, &n1);
6166 if (s) RETURN_STATUS(s);
6167 if (!BC_PROG_NUM(r1, n1))
6168 RETURN_STATUS(bc_error_variable_is_wrong_type());
6170 // Make sure that the values have their pointers updated, if necessary.
6171 if (r1->t == XC_RESULT_VAR || r1->t == XC_RESULT_ARRAY_ELEM) {
6172 if (r1->t == r2->t) {
6173 s = zxc_program_num(r2, &n2);
6174 if (s) RETURN_STATUS(s);
6176 if (r1->t == r3->t) {
6177 s = zxc_program_num(r3, &n3);
6178 if (s) RETURN_STATUS(s);
6182 bc_num_init(&res.d.n, n3->len);
6183 s = zdc_num_modexp(n1, n2, n3, &res.d.n);
6186 bc_vec_pop(&G.prog.results);
6187 xc_program_binOpRetire(&res);
6191 bc_num_free(&res.d.n);
6194 #define zdc_program_modexp(...) (zdc_program_modexp(__VA_ARGS__) COMMA_SUCCESS)
6196 static void dc_program_stackLen(void)
6199 size_t len = G.prog.results.len;
6201 res.t = XC_RESULT_TEMP;
6203 bc_num_init_DEF_SIZE(&res.d.n);
6204 bc_num_ulong2num(&res.d.n, len);
6205 bc_vec_push(&G.prog.results, &res);
6208 static BC_STATUS zdc_program_asciify(void)
6218 if (!STACK_HAS_MORE_THAN(&G.prog.results, 0))
6219 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6221 r = bc_vec_top(&G.prog.results);
6222 s = zxc_program_num(r, &num);
6223 if (s) RETURN_STATUS(s);
6225 if (BC_PROG_NUM(r, num)) {
6228 BcDig strmb_digs[ULONG_NUM_BUFSIZE];
6230 bc_num_init_DEF_SIZE(&n);
6231 bc_num_copy(&n, num);
6232 bc_num_truncate(&n, n.rdx);
6234 strmb.cap = ARRAY_SIZE(strmb_digs);
6235 strmb.num = strmb_digs;
6236 bc_num_ulong2num(&strmb, 0x100);
6238 s = zbc_num_mod(&n, &strmb, &n, 0);
6239 if (s) goto num_err;
6240 s = zbc_num_ulong(&n, &val);
6241 if (s) goto num_err;
6248 idx = (r->t == XC_RESULT_STR) ? r->d.id.idx : num->rdx;
6249 sp = *xc_program_str(idx);
6253 strs = (void*)G.prog.strs.v;
6254 for (idx = 0; idx < G.prog.strs.len; idx++) {
6255 if (strs[idx][0] == c && strs[idx][1] == '\0') {
6261 //str[1] = '\0'; - already is
6262 bc_vec_push(&G.prog.strs, &str);
6264 res.t = XC_RESULT_STR;
6266 bc_result_pop_and_push(&res);
6268 RETURN_STATUS(BC_STATUS_SUCCESS);
6273 #define zdc_program_asciify(...) (zdc_program_asciify(__VA_ARGS__) COMMA_SUCCESS)
6275 static BC_STATUS zdc_program_printStream(void)
6282 if (!STACK_HAS_MORE_THAN(&G.prog.results, 0))
6283 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6284 r = bc_vec_top(&G.prog.results);
6286 s = zxc_program_num(r, &n);
6287 if (s) RETURN_STATUS(s);
6289 if (BC_PROG_NUM(r, n)) {
6290 s = zxc_num_printNum(n, 0x100, 1, dc_num_printChar);
6293 idx = (r->t == XC_RESULT_STR) ? r->d.id.idx : n->rdx;
6294 str = *xc_program_str(idx);
6300 #define zdc_program_printStream(...) (zdc_program_printStream(__VA_ARGS__) COMMA_SUCCESS)
6302 static BC_STATUS zdc_program_nquit(void)
6309 s = zxc_program_prep(&opnd, &num);
6310 if (s) RETURN_STATUS(s);
6311 s = zbc_num_ulong(num, &val);
6312 if (s) RETURN_STATUS(s);
6314 bc_vec_pop(&G.prog.results);
6316 if (G.prog.exestack.len < val)
6317 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6318 if (G.prog.exestack.len == val) {
6319 QUIT_OR_RETURN_TO_MAIN;
6322 bc_vec_npop(&G.prog.exestack, val);
6326 #define zdc_program_nquit(...) (zdc_program_nquit(__VA_ARGS__) COMMA_SUCCESS)
6328 static BC_STATUS zdc_program_execStr(char *code, size_t *bgn, bool cond)
6330 BcStatus s = BC_STATUS_SUCCESS;
6336 if (!STACK_HAS_MORE_THAN(&G.prog.results, 0))
6337 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6339 r = bc_vec_top(&G.prog.results);
6342 BcNum *n = n; // for compiler
6345 char *then_name = xc_program_name(code, bgn);
6346 char *else_name = NULL;
6348 if (code[*bgn] == '\0')
6351 else_name = xc_program_name(code, bgn);
6353 exec = r->d.n.len != 0;
6355 if (!exec && else_name != NULL) {
6362 v = xc_program_search(name, true);
6369 if (!exec) goto exit;
6370 if (!BC_PROG_STR(n)) {
6371 s = bc_error_variable_is_wrong_type();
6377 if (r->t == XC_RESULT_STR) {
6379 } else if (r->t == XC_RESULT_VAR) {
6381 s = zxc_program_num(r, &n);
6382 if (s || !BC_PROG_STR(n)) goto exit;
6388 fidx = sidx + BC_PROG_REQ_FUNCS;
6390 f = xc_program_func(fidx);
6392 if (f->code.len == 0) {
6396 sv_parse = G.prs; // struct copy
6397 xc_parse_create(fidx);
6398 str = *xc_program_str(sidx);
6399 s = zxc_parse_text_init(str);
6402 s = zdc_parse_exprs_until_eof();
6404 xc_parse_push(DC_INST_POP_EXEC);
6405 if (G.prs.lex != XC_LEX_EOF)
6406 s = bc_error_bad_expression();
6408 G.prs = sv_parse; // struct copy
6411 bc_vec_pop_all(&f->code);
6419 bc_vec_pop(&G.prog.results);
6420 bc_vec_push(&G.prog.exestack, &ip);
6422 RETURN_STATUS(BC_STATUS_SUCCESS);
6424 bc_vec_pop(&G.prog.results);
6427 #define zdc_program_execStr(...) (zdc_program_execStr(__VA_ARGS__) COMMA_SUCCESS)
6430 static void xc_program_pushGlobal(char inst)
6435 res.t = inst - XC_INST_IBASE + XC_RESULT_IBASE;
6436 if (inst == XC_INST_IBASE)
6437 val = (unsigned long) G.prog.ib_t;
6438 else if (inst == XC_INST_SCALE)
6439 val = (unsigned long) G.prog.scale;
6441 val = (unsigned long) G.prog.ob_t;
6443 bc_num_init_DEF_SIZE(&res.d.n);
6444 bc_num_ulong2num(&res.d.n, val);
6445 bc_vec_push(&G.prog.results, &res);
6448 static BC_STATUS zxc_program_exec(void)
6451 BcInstPtr *ip = bc_vec_top(&G.prog.exestack);
6452 BcFunc *func = xc_program_func(ip->func);
6453 char *code = func->code.v;
6455 dbg_exec("func:%zd bytes:%zd ip:%zd results.len:%d",
6456 ip->func, func->code.len, ip->inst_idx, G.prog.results.len);
6457 while (ip->inst_idx < func->code.len) {
6458 BcStatus s = BC_STATUS_SUCCESS;
6459 char inst = code[ip->inst_idx++];
6461 dbg_exec("inst at %zd:%d results.len:%d", ip->inst_idx - 1, inst, G.prog.results.len);
6464 case BC_INST_JUMP_ZERO: {
6467 dbg_exec("BC_INST_JUMP_ZERO:");
6468 s = zxc_program_prep(&ptr, &num);
6469 if (s) RETURN_STATUS(s);
6470 zero = (bc_num_cmp(num, &G.prog.zero) == 0);
6471 bc_vec_pop(&G.prog.results);
6473 xc_program_index(code, &ip->inst_idx);
6476 // else: fall through
6478 case BC_INST_JUMP: {
6479 size_t idx = xc_program_index(code, &ip->inst_idx);
6480 size_t *addr = bc_vec_item(&func->labels, idx);
6481 dbg_exec("BC_INST_JUMP: to %ld", (long)*addr);
6482 ip->inst_idx = *addr;
6486 dbg_exec("BC_INST_CALL:");
6487 s = zbc_program_call(code, &ip->inst_idx);
6488 goto read_updated_ip;
6489 case BC_INST_INC_PRE:
6490 case BC_INST_DEC_PRE:
6491 case BC_INST_INC_POST:
6492 case BC_INST_DEC_POST:
6493 dbg_exec("BC_INST_INCDEC:");
6494 s = zbc_program_incdec(inst);
6497 dbg_exec("BC_INST_HALT:");
6498 QUIT_OR_RETURN_TO_MAIN;
6502 dbg_exec("BC_INST_RET[0]:");
6503 s = zbc_program_return(inst);
6504 goto read_updated_ip;
6505 case XC_INST_BOOL_OR:
6506 case XC_INST_BOOL_AND:
6508 case XC_INST_REL_EQ:
6509 case XC_INST_REL_LE:
6510 case XC_INST_REL_GE:
6511 case XC_INST_REL_NE:
6512 case XC_INST_REL_LT:
6513 case XC_INST_REL_GT:
6514 dbg_exec("BC_INST_BOOL:");
6515 s = zxc_program_logical(inst);
6518 dbg_exec("XC_INST_READ:");
6519 s = zxc_program_read();
6520 goto read_updated_ip;
6522 dbg_exec("XC_INST_VAR:");
6523 s = zxc_program_pushVar(code, &ip->inst_idx, false, false);
6525 case XC_INST_ARRAY_ELEM:
6527 dbg_exec("XC_INST_ARRAY[_ELEM]:");
6528 s = zbc_program_pushArray(code, &ip->inst_idx, inst);
6532 dbg_exec("BC_INST_LAST:");
6533 r.t = BC_RESULT_LAST;
6534 bc_vec_push(&G.prog.results, &r);
6540 dbg_exec("XC_INST_internalvar(%d):", inst - XC_INST_IBASE);
6541 xc_program_pushGlobal(inst);
6543 case XC_INST_SCALE_FUNC:
6544 case XC_INST_LENGTH:
6546 dbg_exec("BC_INST_builtin:");
6547 s = zxc_program_builtin(inst);
6550 dbg_exec("XC_INST_NUM:");
6551 r.t = XC_RESULT_CONSTANT;
6552 r.d.id.idx = xc_program_index(code, &ip->inst_idx);
6553 bc_vec_push(&G.prog.results, &r);
6556 dbg_exec("XC_INST_POP:");
6557 if (!STACK_HAS_MORE_THAN(&G.prog.results, 0))
6558 s = bc_error_stack_has_too_few_elements();
6560 bc_vec_pop(&G.prog.results);
6563 case XC_INST_PRINT_POP:
6564 case XC_INST_PRINT_STR:
6565 dbg_exec("XC_INST_PRINTxyz:");
6566 s = zxc_program_print(inst, 0);
6569 dbg_exec("XC_INST_STR:");
6570 r.t = XC_RESULT_STR;
6571 r.d.id.idx = xc_program_index(code, &ip->inst_idx);
6572 bc_vec_push(&G.prog.results, &r);
6575 case XC_INST_MULTIPLY:
6576 case XC_INST_DIVIDE:
6577 case XC_INST_MODULUS:
6580 dbg_exec("BC_INST_binaryop:");
6581 s = zxc_program_op(inst);
6583 case XC_INST_BOOL_NOT: {
6585 dbg_exec("XC_INST_BOOL_NOT:");
6586 s = zxc_program_prep(&ptr, &num);
6587 if (s) RETURN_STATUS(s);
6588 bc_num_init_DEF_SIZE(&r.d.n);
6589 if (bc_num_cmp(num, &G.prog.zero) == 0)
6591 //else bc_num_zero(&r.d.n); - already is
6592 xc_program_retire(&r, XC_RESULT_TEMP);
6596 dbg_exec("XC_INST_NEG:");
6597 s = zxc_program_negate();
6600 case BC_INST_ASSIGN_POWER:
6601 case BC_INST_ASSIGN_MULTIPLY:
6602 case BC_INST_ASSIGN_DIVIDE:
6603 case BC_INST_ASSIGN_MODULUS:
6604 case BC_INST_ASSIGN_PLUS:
6605 case BC_INST_ASSIGN_MINUS:
6607 case XC_INST_ASSIGN:
6608 dbg_exec("BC_INST_ASSIGNxyz:");
6609 s = zxc_program_assign(inst);
6612 case DC_INST_POP_EXEC:
6613 dbg_exec("DC_INST_POP_EXEC:");
6614 bc_vec_pop(&G.prog.exestack);
6615 goto read_updated_ip;
6616 case DC_INST_MODEXP:
6617 dbg_exec("DC_INST_MODEXP:");
6618 s = zdc_program_modexp();
6620 case DC_INST_DIVMOD:
6621 dbg_exec("DC_INST_DIVMOD:");
6622 s = zdc_program_divmod();
6624 case DC_INST_EXECUTE:
6625 case DC_INST_EXEC_COND:
6626 dbg_exec("DC_INST_EXEC[_COND]:");
6627 s = zdc_program_execStr(code, &ip->inst_idx, inst == DC_INST_EXEC_COND);
6628 goto read_updated_ip;
6629 case DC_INST_PRINT_STACK: {
6631 dbg_exec("DC_INST_PRINT_STACK:");
6632 for (idx = 0; idx < G.prog.results.len; ++idx) {
6633 s = zxc_program_print(XC_INST_PRINT, idx);
6638 case DC_INST_CLEAR_STACK:
6639 dbg_exec("DC_INST_CLEAR_STACK:");
6640 bc_vec_pop_all(&G.prog.results);
6642 case DC_INST_STACK_LEN:
6643 dbg_exec("DC_INST_STACK_LEN:");
6644 dc_program_stackLen();
6646 case DC_INST_DUPLICATE:
6647 dbg_exec("DC_INST_DUPLICATE:");
6648 if (!STACK_HAS_MORE_THAN(&G.prog.results, 0))
6649 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6650 ptr = bc_vec_top(&G.prog.results);
6651 dc_result_copy(&r, ptr);
6652 bc_vec_push(&G.prog.results, &r);
6654 case DC_INST_SWAP: {
6656 dbg_exec("DC_INST_SWAP:");
6657 if (!STACK_HAS_MORE_THAN(&G.prog.results, 1))
6658 RETURN_STATUS(bc_error_stack_has_too_few_elements());
6659 ptr = bc_vec_item_rev(&G.prog.results, 0);
6660 ptr2 = bc_vec_item_rev(&G.prog.results, 1);
6661 memcpy(&r, ptr, sizeof(BcResult));
6662 memcpy(ptr, ptr2, sizeof(BcResult));
6663 memcpy(ptr2, &r, sizeof(BcResult));
6666 case DC_INST_ASCIIFY:
6667 dbg_exec("DC_INST_ASCIIFY:");
6668 s = zdc_program_asciify();
6670 case DC_INST_PRINT_STREAM:
6671 dbg_exec("DC_INST_PRINT_STREAM:");
6672 s = zdc_program_printStream();
6675 case DC_INST_PUSH_VAR: {
6676 bool copy = inst == DC_INST_LOAD;
6677 s = zxc_program_pushVar(code, &ip->inst_idx, true, copy);
6680 case DC_INST_PUSH_TO_VAR: {
6681 char *name = xc_program_name(code, &ip->inst_idx);
6682 s = zxc_program_copyToVar(name, true);
6687 dbg_exec("DC_INST_QUIT:");
6688 if (G.prog.exestack.len <= 2)
6689 QUIT_OR_RETURN_TO_MAIN;
6690 bc_vec_npop(&G.prog.exestack, 2);
6691 goto read_updated_ip;
6693 dbg_exec("DC_INST_NQUIT:");
6694 s = zdc_program_nquit();
6695 //goto read_updated_ip; - just fall through to it
6698 // Instruction stack has changed, read new pointers
6699 ip = bc_vec_top(&G.prog.exestack);
6700 func = xc_program_func(ip->func);
6701 code = func->code.v;
6702 dbg_exec("func:%zd bytes:%zd ip:%zd", ip->func, func->code.len, ip->inst_idx);
6705 if (s || G_interrupt) {
6713 RETURN_STATUS(BC_STATUS_SUCCESS);
6715 #define zxc_program_exec(...) (zxc_program_exec(__VA_ARGS__) COMMA_SUCCESS)
6717 static unsigned xc_vm_envLen(const char *var)
6723 len = BC_NUM_PRINT_WIDTH;
6724 if (!lenv) return len;
6726 len = bb_strtou(lenv, NULL, 10) - 1;
6727 if (errno || len < 2 || len >= INT_MAX)
6728 len = BC_NUM_PRINT_WIDTH;
6733 static BC_STATUS zxc_vm_process(const char *text)
6737 dbg_lex_enter("%s:%d entered", __func__, __LINE__);
6738 s = zxc_parse_text_init(text); // does the first zxc_lex_next()
6739 if (s) RETURN_STATUS(s);
6742 while (G.prs.lex != XC_LEX_EOF) {
6746 dbg_lex("%s:%d G.prs.lex:%d, parsing...", __func__, __LINE__, G.prs.lex);
6749 if (G.prs.lex == BC_LEX_SCOLON
6750 || G.prs.lex == XC_LEX_NLINE
6757 s = zbc_parse_stmt_or_funcdef();
6760 // Check that next token is a correct stmt delimiter -
6761 // disallows "print 1 print 2" and such.
6762 if (G.prs.lex != BC_LEX_SCOLON
6763 && G.prs.lex != XC_LEX_NLINE
6764 && G.prs.lex != XC_LEX_EOF
6766 bc_error_at("bad statement terminator");
6769 // The above logic is fragile. Check these examples:
6770 // - interactive read() still works
6774 // Most of dc parsing assumes all whitespace,
6775 // including '\n', is eaten.
6776 while (G.prs.lex == XC_LEX_NLINE) {
6779 if (G.prs.lex == XC_LEX_EOF)
6782 s = zdc_parse_expr();
6785 if (s || G_interrupt) {
6787 xc_parse_reset(); // includes xc_program_reset()
6788 RETURN_STATUS(BC_STATUS_FAILURE);
6791 dbg_lex("%s:%d executing...", __func__, __LINE__);
6792 s = zxc_program_exec();
6798 ip = (void*)G.prog.exestack.v;
6800 if (G.prog.exestack.len != 1) // should have only main's IP
6801 bb_error_msg_and_die("BUG:call stack");
6802 if (ip->func != BC_PROG_MAIN)
6803 bb_error_msg_and_die("BUG:not MAIN");
6805 f = xc_program_func_BC_PROG_MAIN();
6806 // bc discards strings, constants and code after each
6807 // top-level statement in the "main program".
6808 // This prevents "yes 1 | bc" from growing its memory
6809 // without bound. This can be done because data stack
6810 // is empty and thus can't hold any references to
6811 // strings or constants, there is no generated code
6812 // which can hold references (after we discard one
6813 // we just executed). Code of functions can have references,
6814 // but bc stores function strings/constants in per-function
6818 if (G.prog.results.len != 0) // should be empty
6819 bb_error_msg_and_die("BUG:data stack");
6821 IF_BC(bc_vec_pop_all(&f->strs);)
6822 IF_BC(bc_vec_pop_all(&f->consts);)
6824 if (G.prog.results.len == 0
6825 && G.prog.vars.len == 0
6827 // If stack is empty and no registers exist (TODO: or they are all empty),
6828 // we can get rid of accumulated strings and constants.
6829 // In this example dc process should not grow
6830 // its memory consumption with time:
6832 IF_DC(bc_vec_pop_all(&G.prog.strs);)
6833 IF_DC(bc_vec_pop_all(&G.prog.consts);)
6835 // The code is discarded always (below), thus this example
6836 // should also not grow its memory consumption with time,
6837 // even though its data stack is not empty:
6838 // { echo 1; yes dk; } | dc
6840 // We drop generated and executed code for both bc and dc:
6841 bc_vec_pop_all(&f->code);
6845 dbg_lex_done("%s:%d done", __func__, __LINE__);
6848 #define zxc_vm_process(...) (zxc_vm_process(__VA_ARGS__) COMMA_SUCCESS)
6850 static BC_STATUS zxc_vm_execute_FILE(FILE *fp, const char *filename)
6852 // So far bc/dc have no way to include a file from another file,
6853 // therefore we know G.prs.lex_filename == NULL on entry
6854 //const char *sv_file;
6857 G.prs.lex_filename = filename;
6858 G.prs.lex_input_fp = fp;
6859 G.err_line = G.prs.lex_line = 1;
6860 dbg_lex("p->lex_line reset to 1");
6863 s = zxc_vm_process("");
6864 // We do not stop looping on errors here if reading stdin.
6865 // Example: start interactive bc and enter "return".
6866 // It should say "'return' not in a function"
6867 // but should not exit.
6868 } while (G.prs.lex_input_fp == stdin);
6869 G.prs.lex_filename = NULL;
6872 #define zxc_vm_execute_FILE(...) (zxc_vm_execute_FILE(__VA_ARGS__) COMMA_SUCCESS)
6874 static BC_STATUS zxc_vm_file(const char *file)
6879 fp = xfopen_for_read(file);
6880 s = zxc_vm_execute_FILE(fp, file);
6885 #define zxc_vm_file(...) (zxc_vm_file(__VA_ARGS__) COMMA_SUCCESS)
6888 static void bc_vm_info(void)
6890 printf("%s "BB_VER"\n"
6891 "Adapted from https://github.com/gavinhoward/bc\n"
6892 "Original code (c) 2018 Gavin D. Howard and contributors\n"
6896 static void bc_args(char **argv)
6902 #if ENABLE_FEATURE_BC_LONG_OPTIONS
6903 opts = option_mask32 |= getopt32long(argv, "wvsqli",
6904 "warn\0" No_argument "w"
6905 "version\0" No_argument "v"
6906 "standard\0" No_argument "s"
6907 "quiet\0" No_argument "q"
6908 "mathlib\0" No_argument "l"
6909 "interactive\0" No_argument "i"
6912 opts = option_mask32 |= getopt32(argv, "wvsqli");
6914 if (getenv("POSIXLY_CORRECT"))
6915 option_mask32 |= BC_FLAG_S;
6917 if (opts & BC_FLAG_V) {
6922 for (i = optind; argv[i]; ++i)
6923 bc_vec_push(&G.files, argv + i);
6926 static void bc_vm_envArgs(void)
6930 char *env_args = getenv("BC_ENV_ARGS");
6932 if (!env_args) return;
6934 G.env_args = xstrdup(env_args);
6937 bc_vec_init(&v, sizeof(char *), NULL);
6939 while (*(buf = skip_whitespace(buf)) != '\0') {
6940 bc_vec_push(&v, &buf);
6941 buf = skip_non_whitespace(buf);
6947 // NULL terminate, and pass argv[] so that first arg is argv[1]
6948 if (sizeof(int) == sizeof(char*)) {
6949 bc_vec_push(&v, &const_int_0);
6951 static char *const nullptr = NULL;
6952 bc_vec_push(&v, &nullptr);
6954 bc_args(((char **)v.v) - 1);
6959 static const char bc_lib[] ALIGN1 = {
6962 "\n" "auto b,s,n,r,d,i,p,f,v"
6963 ////////////////"if(x<0)return(1/e(-x))" // and drop 'n' and x<0 logic below
6964 //^^^^^^^^^^^^^^^^ this would work, and is even more precise than GNU bc:
6965 //e(-.998896): GNU:.36828580434569428695
6966 // above code:.36828580434569428696
6967 // actual value:.3682858043456942869594...
6968 // but for now let's be "GNU compatible"
6977 "\n" "scale=scale(x)+1"
6987 "\n" "for(i=2;v;++i){"
6993 "\n" "while(d--)r*=r"
6996 "\n" "if(n)return(1/r)"
7000 "\n" "auto b,s,r,p,a,q,i,v"
7004 "\n" "r=(1-10^scale)/1"
7015 "\n" "while(x<=.5){"
7019 "\n" "r=a=(x-1)/(x+1)"
7022 "\n" "for(i=3;v;i+=2){"
7033 "\n" "auto b,s,r,a,q,i"
7034 "\n" "if(x<0)return(-s(-x))"
7038 "\n" "scale=1.1*s+2"
7047 "\n" "for(i=3;a;i+=2){"
7048 "\n" "a*=q/(i*(i-1))"
7061 "\n" "x=s(2*a(1)+x)"
7067 "\n" "auto b,s,r,n,a,m,t,f,i,u"
7075 "\n" "if(scale<65){"
7076 "\n" "if(x==1)return(.7853981633974483096156608458198757210492923498437764552437361480/n)"
7077 "\n" "if(x==.2)return(.1973955598498807583700497651947902934475851037878521015176889402/n)"
7087 "\n" "x=(x-.2)/(1+.2*x)"
7092 "\n" "for(i=3;t;i+=2){"
7099 "\n" "return((m*a+r)/n)"
7101 "\n" "define j(n,x){"
7102 "\n" "auto b,s,o,a,i,v,f"
7113 "\n" "for(i=2;i<=n;++i)a*=i"
7115 "\n" "a=(x^n)/2^n/a"
7118 "\n" "scale+=length(a)-scale(a)"
7119 "\n" "for(i=1;v;++i){"
7120 "\n" "v=v*f/i/(n+i)"
7126 "\n" "return(a*r/1)"
7131 static BC_STATUS zxc_vm_exec(void)
7138 if (option_mask32 & BC_FLAG_L) {
7139 // We know that internal library is not buggy,
7140 // thus error checking is normally disabled.
7141 # define DEBUG_LIB 0
7142 s = zxc_vm_process(bc_lib);
7143 if (DEBUG_LIB && s) RETURN_STATUS(s);
7147 s = BC_STATUS_SUCCESS;
7148 fname = (void*)G.files.v;
7149 for (i = 0; i < G.files.len; i++) {
7150 s = zxc_vm_file(*fname++);
7151 if (ENABLE_FEATURE_CLEAN_UP && !G_ttyin && s) {
7152 // Debug config, non-interactive mode:
7153 // return all the way back to main.
7154 // Non-debug builds do not come here
7155 // in non-interactive mode, they exit.
7160 if (IS_BC || (option_mask32 & BC_FLAG_I))
7161 s = zxc_vm_execute_FILE(stdin, /*filename:*/ NULL);
7165 #define zxc_vm_exec(...) (zxc_vm_exec(__VA_ARGS__) COMMA_SUCCESS)
7167 #if ENABLE_FEATURE_CLEAN_UP
7168 static void xc_program_free(void)
7170 bc_vec_free(&G.prog.fns);
7171 IF_BC(bc_vec_free(&G.prog.fn_map);)
7172 bc_vec_free(&G.prog.vars);
7173 bc_vec_free(&G.prog.var_map);
7174 bc_vec_free(&G.prog.arrs);
7175 bc_vec_free(&G.prog.arr_map);
7176 IF_DC(bc_vec_free(&G.prog.strs);)
7177 IF_DC(bc_vec_free(&G.prog.consts);)
7178 bc_vec_free(&G.prog.results);
7179 bc_vec_free(&G.prog.exestack);
7180 IF_BC(bc_num_free(&G.prog.last);)
7181 //IF_BC(bc_num_free(&G.prog.zero);)
7182 IF_BC(bc_num_free(&G.prog.one);)
7183 bc_vec_free(&G.input_buffer);
7187 static void xc_program_init(void)
7191 // memset(&G.prog, 0, sizeof(G.prog)); - already is
7192 memset(&ip, 0, sizeof(BcInstPtr));
7194 // G.prog.nchars = G.prog.scale = 0; - already is
7198 IF_BC(bc_num_init_DEF_SIZE(&G.prog.last);)
7199 //IF_BC(bc_num_zero(&G.prog.last);) - already is
7201 //bc_num_init_DEF_SIZE(&G.prog.zero); - not needed
7202 //bc_num_zero(&G.prog.zero); - already is
7204 IF_BC(bc_num_init_DEF_SIZE(&G.prog.one);)
7205 IF_BC(bc_num_one(&G.prog.one);)
7207 bc_vec_init(&G.prog.fns, sizeof(BcFunc), bc_func_free);
7208 IF_BC(bc_vec_init(&G.prog.fn_map, sizeof(BcId), bc_id_free);)
7211 // Names are chosen simply to be distinct and never match
7212 // a valid function name (and be short)
7213 IF_BC(bc_program_addFunc(xstrdup(""))); // func #0: main
7214 IF_BC(bc_program_addFunc(xstrdup("1"))); // func #1: for read()
7216 // in dc, functions have no names
7217 xc_program_add_fn();
7218 xc_program_add_fn();
7221 bc_vec_init(&G.prog.vars, sizeof(BcVec), bc_vec_free);
7222 bc_vec_init(&G.prog.var_map, sizeof(BcId), bc_id_free);
7224 bc_vec_init(&G.prog.arrs, sizeof(BcVec), bc_vec_free);
7225 bc_vec_init(&G.prog.arr_map, sizeof(BcId), bc_id_free);
7227 IF_DC(bc_vec_init(&G.prog.strs, sizeof(char *), bc_string_free);)
7228 IF_DC(bc_vec_init(&G.prog.consts, sizeof(char *), bc_string_free);)
7229 bc_vec_init(&G.prog.results, sizeof(BcResult), bc_result_free);
7230 bc_vec_init(&G.prog.exestack, sizeof(BcInstPtr), NULL);
7231 bc_vec_push(&G.prog.exestack, &ip);
7233 bc_char_vec_init(&G.input_buffer);
7236 static int xc_vm_init(const char *env_len)
7238 G.prog.len = xc_vm_envLen(env_len);
7239 #if ENABLE_FEATURE_EDITING
7240 G.line_input_state = new_line_input_t(DO_HISTORY);
7242 bc_vec_init(&G.files, sizeof(char *), NULL);
7245 IF_BC(if (IS_BC) bc_vm_envArgs();)
7246 xc_parse_create(BC_PROG_MAIN);
7248 //TODO: in GNU bc, the check is (isatty(0) && isatty(1)),
7249 //-i option unconditionally enables this regardless of isatty():
7251 #if ENABLE_FEATURE_BC_INTERACTIVE
7253 // With SA_RESTART, most system calls will restart
7254 // (IOW: they won't fail with EINTR).
7255 // In particular, this means ^C won't cause
7256 // stdout to get into "error state" if SIGINT hits
7257 // within write() syscall.
7259 // The downside is that ^C while tty input is taken
7260 // will only be handled after [Enter] since read()
7261 // from stdin is not interrupted by ^C either,
7262 // it restarts, thus fgetc() does not return on ^C.
7263 // (This problem manifests only if line editing is disabled)
7264 signal_SA_RESTART_empty_mask(SIGINT, record_signo);
7266 // Without SA_RESTART, this exhibits a bug:
7267 // "while (1) print 1" and try ^C-ing it.
7268 // Intermittently, instead of returning to input line,
7269 // you'll get "output error: Interrupted system call"
7271 //signal_no_SA_RESTART_empty_mask(SIGINT, record_signo);
7275 return 0; // "not a tty"
7278 static BcStatus xc_vm_run(void)
7280 BcStatus st = zxc_vm_exec();
7281 #if ENABLE_FEATURE_CLEAN_UP
7282 if (G_exiting) // it was actually "halt" or "quit"
7285 bc_vec_free(&G.files);
7289 # if ENABLE_FEATURE_EDITING
7290 free_line_input_t(G.line_input_state);
7294 dbg_exec("exiting with exitcode %d", st);
7299 int bc_main(int argc, char **argv) MAIN_EXTERNALLY_VISIBLE;
7300 int bc_main(int argc UNUSED_PARAM, char **argv)
7306 is_tty = xc_vm_init("BC_LINE_LENGTH");
7310 if (is_tty && !(option_mask32 & BC_FLAG_Q))
7318 int dc_main(int argc, char **argv) MAIN_EXTERNALLY_VISIBLE;
7319 int dc_main(int argc UNUSED_PARAM, char **argv)
7325 // TODO: dc (GNU bc 1.07.1) 1.4.1 seems to use width
7326 // 1 char wider than bc from the same package.
7327 // Both default width, and xC_LINE_LENGTH=N are wider:
7328 // "DC_LINE_LENGTH=5 dc -e'123456 p'" prints:
7331 // "echo '123456' | BC_LINE_LENGTH=5 bc" prints:
7334 // Do the same, or it's a bug?
7335 xc_vm_init("DC_LINE_LENGTH");
7337 // Run -e'SCRIPT' and -fFILE in order of appearance, then handle FILEs
7338 noscript = BC_FLAG_I;
7340 int n = getopt(argc, argv, "e:f:x");
7346 n = zxc_vm_process(optarg);
7351 n = zxc_vm_file(optarg);
7355 option_mask32 |= DC_FLAG_X;
7365 bc_vec_push(&G.files, argv++);
7368 option_mask32 |= noscript; // set BC_FLAG_I if we need to interpret stdin