1 /* vi: set sw=4 ts=4: */
3 * Licensed under GPLv2 or later, see file LICENSE in this source tree.
4 * Copyright (c) 2018 Gavin D. Howard and contributors.
6 * ** Automatically generated from https://github.com/gavinhoward/bc **
7 * ** Do not edit unless you know what you are doing. **
10 //config: bool "bc (45 kb; 49 kb when combined with dc)"
13 //config: bc is a command-line, arbitrary-precision calculator with a
14 //config: Turing-complete language. See the GNU bc manual
15 //config: (https://www.gnu.org/software/bc/manual/bc.html) and bc spec
16 //config: (http://pubs.opengroup.org/onlinepubs/9699919799/utilities/bc.html)
17 //config: for details.
19 //config: This bc has four differences to the GNU bc:
21 //config: 1) The period (.) can also be used as a shortcut for "last", as in
23 //config: 2) Arrays are copied before being passed as arguments to
24 //config: functions. This behavior is required by the bc spec.
25 //config: 3) Arrays can be passed to the builtin "length" function to get
26 //config: the number of elements currently in the array. The following
27 //config: example prints "1":
32 //config: 4) The precedence of the boolean "not" operator (!) is equal to
33 //config: that of the unary minus (-), or negation, operator. This still
34 //config: allows POSIX-compliant scripts to work while somewhat
35 //config: preserving expected behavior (versus C) and making parsing
40 //config: -i --interactive force interactive mode
41 //config: -l --mathlib use predefined math routines:
43 //config: s(expr) = sine of expr in radians
44 //config: c(expr) = cosine of expr in radians
45 //config: a(expr) = arctangent of expr, returning
47 //config: l(expr) = natural log of expr
48 //config: e(expr) = raises e to the power of expr
49 //config: j(n, x) = Bessel function of integer order
52 //config: -q --quiet don't print version and copyright.
53 //config: -s --standard error if any non-POSIX extensions are used.
54 //config: -w --warn warn if any non-POSIX extensions are used.
55 //config: -v --version print version and copyright and exit.
57 //config: Long options are only available if FEATURE_BC_LONG_OPTIONS is
61 //config: bool "dc (38 kb; 49 kb when combined with bc)"
64 //config: dc is a reverse-polish notation command-line calculator which
65 //config: supports unlimited precision arithmetic. See the FreeBSD man page
66 //config: (https://www.unix.com/man-page/FreeBSD/1/dc/) and GNU dc manual
67 //config: (https://www.gnu.org/software/bc/manual/dc-1.05/html_mono/dc.html)
68 //config: for details.
70 //config: This dc has a few differences from the two above:
72 //config: 1) When printing a byte stream (command "P"), this bc follows what
73 //config: the FreeBSD dc does.
74 //config: 2) This dc implements the GNU extensions for divmod ("~") and
75 //config: modular exponentiation ("|").
76 //config: 3) This dc implements all FreeBSD extensions, except for "J" and
78 //config: 4) Like the FreeBSD dc, this dc supports extended registers.
79 //config: However, they are implemented differently. When it encounters
80 //config: whitespace where a register should be, it skips the whitespace.
81 //config: If the character following is not a lowercase letter, an error
82 //config: is issued. Otherwise, the register name is parsed by the
83 //config: following regex:
85 //config: [a-z][a-z0-9_]*
87 //config: This generally means that register names will be surrounded by
92 //config: l idx s temp L index S temp2 < do_thing
94 //config: Also note that, like the FreeBSD dc, extended registers are not
95 //config: allowed unless the "-x" option is given.
97 //config:config FEATURE_BC_SIGNALS
98 //config: bool "Enable bc/dc signal handling"
100 //config: depends on BC || DC
102 //config: Enable signal handling for bc and dc.
104 //config:config FEATURE_BC_LONG_OPTIONS
105 //config: bool "Enable bc/dc long options"
107 //config: depends on BC || DC
109 //config: Enable long options for bc and dc.
111 //applet:IF_BC(APPLET(bc, BB_DIR_USR_BIN, BB_SUID_DROP))
112 //applet:IF_DC(APPLET(dc, BB_DIR_USR_BIN, BB_SUID_DROP))
114 //kbuild:lib-$(CONFIG_BC) += bc.o
115 //kbuild:lib-$(CONFIG_DC) += bc.o
117 //See www.gnu.org/software/bc/manual/bc.html
118 //usage:#define bc_trivial_usage
119 //usage: "[-sqliw] FILE..."
121 //usage:#define bc_full_usage "\n"
122 //usage: "\nArbitrary precision calculator"
124 //usage: "\n -i Interactive"
125 //usage: "\n -l Load standard math library"
126 //usage: "\n -s Be POSIX compatible"
127 //usage: "\n -q Quiet"
128 //usage: "\n -w Warn if extensions are used"
129 ///////: "\n -v Version"
130 //usage: "\n$BC_LINE_LENGTH changes output width"
132 //usage:#define bc_example_usage
133 //usage: "3 + 4.129\n"
134 //usage: "1903 - 2893\n"
135 //usage: "-129 * 213.28935\n"
136 //usage: "12 / -1932\n"
138 //usage: "34 ^ 189\n"
139 //usage: "scale = 13\n"
140 //usage: "ibase = 2\n"
141 //usage: "obase = A\n"
143 //usage:#define dc_trivial_usage
144 //usage: "EXPRESSION..."
146 //usage:#define dc_full_usage "\n\n"
147 //usage: "Tiny RPN calculator. Operations:\n"
148 //usage: "+, add, -, sub, *, mul, /, div, %, mod, ^, exp, ~, divmod, |, "
149 //usage: "modular exponentiation,\n"
150 //usage: "p - print top of the stack (without popping),\n"
151 //usage: "f - print entire stack,\n"
152 //usage: "k - pop the value and set the precision.\n"
153 //usage: "i - pop the value and set input radix.\n"
154 //usage: "o - pop the value and set output radix.\n"
155 //usage: "Examples: 'dc 2 2 add p' -> 4, 'dc 8 8 mul 2 2 + / p' -> 16"
157 //usage:#define dc_example_usage
158 //usage: "$ dc 2 2 + p\n"
160 //usage: "$ dc 8 8 \\* 2 2 + / p\n"
162 //usage: "$ dc 0 1 and p\n"
164 //usage: "$ dc 0 1 or p\n"
166 //usage: "$ echo 72 9 div 8 mul p | dc\n"
171 typedef enum BcStatus {
172 BC_STATUS_SUCCESS = 0,
173 BC_STATUS_FAILURE = 1,
174 BC_STATUS_PARSE_EMPTY_EXP = 2, // bc_parse_expr() uses this
177 #define BC_VEC_INVALID_IDX ((size_t) -1)
178 #define BC_VEC_START_CAP (1 << 5)
180 typedef void (*BcVecFree)(void *);
182 typedef struct BcVec {
190 #define bc_vec_pop(v) (bc_vec_npop((v), 1))
191 #define bc_vec_top(v) (bc_vec_item_rev((v), 0))
193 typedef signed char BcDig;
195 typedef struct BcNum {
203 #define BC_NUM_MIN_BASE ((unsigned long) 2)
204 #define BC_NUM_MAX_IBASE ((unsigned long) 16)
205 #define BC_NUM_DEF_SIZE (16)
206 #define BC_NUM_PRINT_WIDTH (69)
208 #define BC_NUM_KARATSUBA_LEN (32)
210 #define BC_NUM_NEG(n, neg) ((((ssize_t)(n)) ^ -((ssize_t)(neg))) + (neg))
211 #define BC_NUM_ONE(n) ((n)->len == 1 && (n)->rdx == 0 && (n)->num[0] == 1)
212 #define BC_NUM_INT(n) ((n)->len - (n)->rdx)
213 #define BC_NUM_AREQ(a, b) \
214 (BC_MAX((a)->rdx, (b)->rdx) + BC_MAX(BC_NUM_INT(a), BC_NUM_INT(b)) + 1)
215 #define BC_NUM_MREQ(a, b, scale) \
216 (BC_NUM_INT(a) + BC_NUM_INT(b) + BC_MAX((scale), (a)->rdx + (b)->rdx) + 1)
218 typedef BcStatus (*BcNumBinaryOp)(BcNum *, BcNum *, BcNum *, size_t);
219 typedef void (*BcNumDigitOp)(size_t, size_t, bool, size_t *, size_t);
221 static BcStatus bc_num_add(BcNum *a, BcNum *b, BcNum *c, size_t scale);
222 static BcStatus bc_num_sub(BcNum *a, BcNum *b, BcNum *c, size_t scale);
223 static BcStatus bc_num_mul(BcNum *a, BcNum *b, BcNum *c, size_t scale);
224 static BcStatus bc_num_div(BcNum *a, BcNum *b, BcNum *c, size_t scale);
225 static BcStatus bc_num_mod(BcNum *a, BcNum *b, BcNum *c, size_t scale);
226 static BcStatus bc_num_pow(BcNum *a, BcNum *b, BcNum *c, size_t scale);
227 static BcStatus bc_num_sqrt(BcNum *a, BcNum *b, size_t scale);
228 static BcStatus bc_num_divmod(BcNum *a, BcNum *b, BcNum *c, BcNum *d,
231 typedef enum BcInst {
261 BC_INST_ASSIGN_POWER,
262 BC_INST_ASSIGN_MULTIPLY,
263 BC_INST_ASSIGN_DIVIDE,
264 BC_INST_ASSIGN_MODULUS,
266 BC_INST_ASSIGN_MINUS,
312 BC_INST_PRINT_STREAM,
327 BC_INST_INVALID = -1,
332 typedef struct BcId {
337 typedef struct BcFunc {
344 typedef enum BcResultType {
349 BC_RESULT_ARRAY_ELEM,
358 // These are between to calculate ibase, obase, and last from instructions.
366 typedef union BcResultData {
372 typedef struct BcResult {
377 typedef struct BcInstPtr {
383 // BC_LEX_NEG is not used in lexing; it is only for parsing.
384 typedef enum BcLexType {
412 BC_LEX_OP_ASSIGN_POWER,
413 BC_LEX_OP_ASSIGN_MULTIPLY,
414 BC_LEX_OP_ASSIGN_DIVIDE,
415 BC_LEX_OP_ASSIGN_MODULUS,
416 BC_LEX_OP_ASSIGN_PLUS,
417 BC_LEX_OP_ASSIGN_MINUS,
438 BC_LEX_KEY_1st_keyword,
439 BC_LEX_KEY_AUTO = BC_LEX_KEY_1st_keyword,
446 // code uses "type - BC_LEX_KEY_IBASE + BC_INST_IBASE" construct,
447 BC_LEX_KEY_IBASE, // relative order should match for: BC_INST_IBASE
449 BC_LEX_KEY_LAST, // relative order should match for: BC_INST_LAST
452 BC_LEX_KEY_OBASE, // relative order should match for: BC_INST_OBASE
490 // must match order of BC_LEX_KEY_foo etc above
492 struct BcLexKeyword {
495 #define BC_LEX_KW_ENTRY(a, b, c) \
496 { .name8 = a /*, .len = b, .posix = c*/ }
497 static const struct BcLexKeyword bc_lex_kws[20] = {
498 BC_LEX_KW_ENTRY("auto" , 4, 1), // 0
499 BC_LEX_KW_ENTRY("break" , 5, 1), // 1
500 BC_LEX_KW_ENTRY("continue", 8, 0), // 2 note: this one has no terminating NUL
501 BC_LEX_KW_ENTRY("define" , 6, 1), // 3
503 BC_LEX_KW_ENTRY("else" , 4, 0), // 4
504 BC_LEX_KW_ENTRY("for" , 3, 1), // 5
505 BC_LEX_KW_ENTRY("halt" , 4, 0), // 6
506 BC_LEX_KW_ENTRY("ibase" , 5, 1), // 7
508 BC_LEX_KW_ENTRY("if" , 2, 1), // 8
509 BC_LEX_KW_ENTRY("last" , 4, 0), // 9
510 BC_LEX_KW_ENTRY("length" , 6, 1), // 10
511 BC_LEX_KW_ENTRY("limits" , 6, 0), // 11
513 BC_LEX_KW_ENTRY("obase" , 5, 1), // 12
514 BC_LEX_KW_ENTRY("print" , 5, 0), // 13
515 BC_LEX_KW_ENTRY("quit" , 4, 1), // 14
516 BC_LEX_KW_ENTRY("read" , 4, 0), // 15
518 BC_LEX_KW_ENTRY("return" , 6, 1), // 16
519 BC_LEX_KW_ENTRY("scale" , 5, 1), // 17
520 BC_LEX_KW_ENTRY("sqrt" , 4, 1), // 18
521 BC_LEX_KW_ENTRY("while" , 5, 1), // 19
553 typedef BcStatus (*BcLexNext)(struct BcLex *);
555 typedef struct BcLex {
573 #define BC_PARSE_STREND ((char) UCHAR_MAX)
575 #define bc_parse_push(p, i) (bc_vec_pushByte(&(p)->func->code, (char) (i)))
576 #define bc_parse_updateFunc(p, f) \
577 ((p)->func = bc_vec_item(&G.prog.fns, ((p)->fidx = (f))))
579 #define BC_PARSE_REL (1 << 0)
580 #define BC_PARSE_PRINT (1 << 1)
581 #define BC_PARSE_NOCALL (1 << 2)
582 #define BC_PARSE_NOREAD (1 << 3)
583 #define BC_PARSE_ARRAY (1 << 4)
585 #define BC_PARSE_TOP_FLAG_PTR(parse) ((uint8_t *) bc_vec_top(&(parse)->flags))
586 #define BC_PARSE_TOP_FLAG(parse) (*(BC_PARSE_TOP_FLAG_PTR(parse)))
588 #define BC_PARSE_FLAG_FUNC_INNER (1 << 0)
589 #define BC_PARSE_FUNC_INNER(parse) \
590 (BC_PARSE_TOP_FLAG(parse) & BC_PARSE_FLAG_FUNC_INNER)
592 #define BC_PARSE_FLAG_FUNC (1 << 1)
593 #define BC_PARSE_FUNC(parse) (BC_PARSE_TOP_FLAG(parse) & BC_PARSE_FLAG_FUNC)
595 #define BC_PARSE_FLAG_BODY (1 << 2)
596 #define BC_PARSE_BODY(parse) (BC_PARSE_TOP_FLAG(parse) & BC_PARSE_FLAG_BODY)
598 #define BC_PARSE_FLAG_LOOP (1 << 3)
599 #define BC_PARSE_LOOP(parse) (BC_PARSE_TOP_FLAG(parse) & BC_PARSE_FLAG_LOOP)
601 #define BC_PARSE_FLAG_LOOP_INNER (1 << 4)
602 #define BC_PARSE_LOOP_INNER(parse) \
603 (BC_PARSE_TOP_FLAG(parse) & BC_PARSE_FLAG_LOOP_INNER)
605 #define BC_PARSE_FLAG_IF (1 << 5)
606 #define BC_PARSE_IF(parse) (BC_PARSE_TOP_FLAG(parse) & BC_PARSE_FLAG_IF)
608 #define BC_PARSE_FLAG_ELSE (1 << 6)
609 #define BC_PARSE_ELSE(parse) (BC_PARSE_TOP_FLAG(parse) & BC_PARSE_FLAG_ELSE)
611 #define BC_PARSE_FLAG_IF_END (1 << 7)
612 #define BC_PARSE_IF_END(parse) (BC_PARSE_TOP_FLAG(parse) & BC_PARSE_FLAG_IF_END)
614 #define BC_PARSE_CAN_EXEC(parse) \
615 (!(BC_PARSE_TOP_FLAG(parse) & \
616 (BC_PARSE_FLAG_FUNC_INNER | BC_PARSE_FLAG_FUNC | BC_PARSE_FLAG_BODY | \
617 BC_PARSE_FLAG_LOOP | BC_PARSE_FLAG_LOOP_INNER | BC_PARSE_FLAG_IF | \
618 BC_PARSE_FLAG_ELSE | BC_PARSE_FLAG_IF_END)))
620 typedef struct BcParseNext {
625 #define BC_PARSE_NEXT_TOKENS(...) .tokens = { __VA_ARGS__ }
626 #define BC_PARSE_NEXT(a, ...) \
628 .len = (a), BC_PARSE_NEXT_TOKENS(__VA_ARGS__) \
635 typedef BcStatus (*BcParseParse)(struct BcParse *);
637 typedef struct BcParse {
658 typedef struct BcProgram {
699 #define BC_PROG_STACK(s, n) ((s)->len >= ((size_t) n))
701 #define BC_PROG_MAIN (0)
702 #define BC_PROG_READ (1)
705 #define BC_PROG_REQ_FUNCS (2)
708 #define BC_PROG_STR(n) (!(n)->num && !(n)->cap)
709 #define BC_PROG_NUM(r, n) \
710 ((r)->t != BC_RESULT_ARRAY && (r)->t != BC_RESULT_STR && !BC_PROG_STR(n))
712 typedef unsigned long (*BcProgramBuiltIn)(BcNum *);
714 static void bc_program_addFunc(char *name, size_t *idx);
715 static void bc_program_reset(void);
717 #define BC_FLAG_X (1 << 0)
718 #define BC_FLAG_W (1 << 1)
719 #define BC_FLAG_V (1 << 2)
720 #define BC_FLAG_S (1 << 3)
721 #define BC_FLAG_Q (1 << 4)
722 #define BC_FLAG_L (1 << 5)
723 #define BC_FLAG_I (1 << 6)
725 #define BC_MAX(a, b) ((a) > (b) ? (a) : (b))
726 #define BC_MIN(a, b) ((a) < (b) ? (a) : (b))
728 #define BC_MAX_OBASE ((unsigned) 999)
729 #define BC_MAX_DIM ((unsigned) INT_MAX)
730 #define BC_MAX_SCALE ((unsigned) UINT_MAX)
731 #define BC_MAX_STRING ((unsigned) UINT_MAX - 1)
732 #define BC_MAX_NAME BC_MAX_STRING
733 #define BC_MAX_NUM BC_MAX_STRING
734 #define BC_MAX_EXP ((unsigned long) LONG_MAX)
735 #define BC_MAX_VARS ((unsigned long) SIZE_MAX - 1)
738 IF_FEATURE_BC_SIGNALS(smallint ttyin;)
746 // For error messages. Can be set to current parsed line,
747 // or [TODO] to current executing line (can be before last parsed one)
754 #define G (*ptr_to_globals)
755 #define INIT_G() do { \
756 SET_PTR_TO_GLOBALS(xzalloc(sizeof(G))); \
758 #define FREE_G() do { \
759 FREE_PTR_TO_GLOBALS(); \
761 #define G_posix (ENABLE_BC && (option_mask32 & BC_FLAG_S))
762 #define G_warn (ENABLE_BC && (option_mask32 & BC_FLAG_W))
763 #define G_exreg (ENABLE_DC && (option_mask32 & BC_FLAG_X))
764 #define G_interrupt (ENABLE_FEATURE_BC_SIGNALS ? bb_got_signal : 0)
765 #if ENABLE_FEATURE_BC_SIGNALS
766 # define G_ttyin G.ttyin
770 #define IS_BC (ENABLE_BC && (!ENABLE_DC || applet_name[0] == 'b'))
774 // This is a bit array that corresponds to token types. An entry is
775 // true if the token is valid in an expression, false otherwise.
777 BC_PARSE_EXPRS_BITS = 0
778 + ((uint64_t)((0 << 0)+(0 << 1)+(1 << 2)+(1 << 3)+(1 << 4)+(1 << 5)+(1 << 6)+(1 << 7)) << (0*8))
779 + ((uint64_t)((1 << 0)+(1 << 1)+(1 << 2)+(1 << 3)+(1 << 4)+(1 << 5)+(1 << 6)+(1 << 7)) << (1*8))
780 + ((uint64_t)((1 << 0)+(1 << 1)+(1 << 2)+(1 << 3)+(1 << 4)+(1 << 5)+(1 << 6)+(1 << 7)) << (2*8))
781 + ((uint64_t)((1 << 0)+(1 << 1)+(1 << 2)+(0 << 3)+(0 << 4)+(1 << 5)+(1 << 6)+(0 << 7)) << (3*8))
782 + ((uint64_t)((0 << 0)+(0 << 1)+(0 << 2)+(0 << 3)+(0 << 4)+(0 << 5)+(1 << 6)+(1 << 7)) << (4*8))
783 + ((uint64_t)((0 << 0)+(0 << 1)+(0 << 2)+(0 << 3)+(0 << 4)+(0 << 5)+(0 << 6)+(1 << 7)) << (5*8))
784 + ((uint64_t)((0 << 0)+(1 << 1)+(1 << 2)+(1 << 3)+(1 << 4)+(0 << 5)+(0 << 6)+(1 << 7)) << (6*8))
785 + ((uint64_t)((0 << 0)+(1 << 1)+(1 << 2)+(0 << 3) ) << (7*8))
787 static ALWAYS_INLINE long bc_parse_exprs(unsigned i)
789 #if ULONG_MAX > 0xffffffff
790 // 64-bit version (will not work correctly for 32-bit longs!)
791 return BC_PARSE_EXPRS_BITS & (1UL << i);
794 unsigned long m = (uint32_t)BC_PARSE_EXPRS_BITS;
796 m = (uint32_t)(BC_PARSE_EXPRS_BITS >> 32);
799 return m & (1UL << i);
803 // This is an array of data for operators that correspond to token types.
804 static const uint8_t bc_parse_ops[] = {
805 #define OP(p,l) ((int)(l) * 0x10 + (p))
806 OP(0, false), OP( 0, false ), // inc dec
809 OP(3, true ), OP( 3, true ), OP( 3, true ), // pow mul div
810 OP(4, true ), OP( 4, true ), // mod + -
811 OP(6, true ), OP( 6, true ), OP( 6, true ), OP( 6, true ), OP( 6, true ), OP( 6, true ), // == <= >= != < >
813 OP(7, true ), OP( 7, true ), // or and
814 OP(5, false), OP( 5, false ), OP( 5, false ), OP( 5, false ), OP( 5, false ), // ^= *= /= %= +=
815 OP(5, false), OP( 5, false ), // -= =
818 #define bc_parse_op_PREC(i) (bc_parse_ops[i] & 0x0f)
819 #define bc_parse_op_LEFT(i) (bc_parse_ops[i] & 0x10)
821 // These identify what tokens can come after expressions in certain cases.
822 static const BcParseNext bc_parse_next_expr =
823 BC_PARSE_NEXT(4, BC_LEX_NLINE, BC_LEX_SCOLON, BC_LEX_RBRACE, BC_LEX_EOF);
824 static const BcParseNext bc_parse_next_param =
825 BC_PARSE_NEXT(2, BC_LEX_RPAREN, BC_LEX_COMMA);
826 static const BcParseNext bc_parse_next_print =
827 BC_PARSE_NEXT(4, BC_LEX_COMMA, BC_LEX_NLINE, BC_LEX_SCOLON, BC_LEX_EOF);
828 static const BcParseNext bc_parse_next_rel = BC_PARSE_NEXT(1, BC_LEX_RPAREN);
829 static const BcParseNext bc_parse_next_elem = BC_PARSE_NEXT(1, BC_LEX_RBRACKET);
830 static const BcParseNext bc_parse_next_for = BC_PARSE_NEXT(1, BC_LEX_SCOLON);
831 static const BcParseNext bc_parse_next_read =
832 BC_PARSE_NEXT(2, BC_LEX_NLINE, BC_LEX_EOF);
836 static const BcLexType dc_lex_regs[] = {
837 BC_LEX_OP_REL_EQ, BC_LEX_OP_REL_LE, BC_LEX_OP_REL_GE, BC_LEX_OP_REL_NE,
838 BC_LEX_OP_REL_LT, BC_LEX_OP_REL_GT, BC_LEX_SCOLON, BC_LEX_COLON,
839 BC_LEX_ELSE, BC_LEX_LOAD, BC_LEX_LOAD_POP, BC_LEX_OP_ASSIGN,
843 static const BcLexType dc_lex_tokens[] = {
844 BC_LEX_OP_MODULUS, BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_LPAREN,
845 BC_LEX_INVALID, BC_LEX_OP_MULTIPLY, BC_LEX_OP_PLUS, BC_LEX_INVALID,
846 BC_LEX_OP_MINUS, BC_LEX_INVALID, BC_LEX_OP_DIVIDE,
847 BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID,
848 BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID,
849 BC_LEX_INVALID, BC_LEX_INVALID,
850 BC_LEX_COLON, BC_LEX_SCOLON, BC_LEX_OP_REL_GT, BC_LEX_OP_REL_EQ,
851 BC_LEX_OP_REL_LT, BC_LEX_KEY_READ, BC_LEX_INVALID,
852 BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID,
853 BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_EQ_NO_REG, BC_LEX_INVALID,
854 BC_LEX_KEY_IBASE, BC_LEX_INVALID, BC_LEX_KEY_SCALE, BC_LEX_LOAD_POP,
855 BC_LEX_INVALID, BC_LEX_OP_BOOL_NOT, BC_LEX_KEY_OBASE, BC_LEX_PRINT_STREAM,
856 BC_LEX_NQUIT, BC_LEX_POP, BC_LEX_STORE_PUSH, BC_LEX_INVALID, BC_LEX_INVALID,
857 BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_SCALE_FACTOR, BC_LEX_INVALID,
858 BC_LEX_KEY_LENGTH, BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID,
859 BC_LEX_OP_POWER, BC_LEX_NEG, BC_LEX_INVALID,
860 BC_LEX_ASCIIFY, BC_LEX_INVALID, BC_LEX_CLEAR_STACK, BC_LEX_DUPLICATE,
861 BC_LEX_ELSE, BC_LEX_PRINT_STACK, BC_LEX_INVALID, BC_LEX_INVALID,
862 BC_LEX_STORE_IBASE, BC_LEX_INVALID, BC_LEX_STORE_SCALE, BC_LEX_LOAD,
863 BC_LEX_INVALID, BC_LEX_PRINT_POP, BC_LEX_STORE_OBASE, BC_LEX_KEY_PRINT,
864 BC_LEX_KEY_QUIT, BC_LEX_SWAP, BC_LEX_OP_ASSIGN, BC_LEX_INVALID,
865 BC_LEX_INVALID, BC_LEX_KEY_SQRT, BC_LEX_INVALID, BC_LEX_EXECUTE,
866 BC_LEX_INVALID, BC_LEX_STACK_LEVEL,
867 BC_LEX_LBRACE, BC_LEX_OP_MODEXP, BC_LEX_INVALID, BC_LEX_OP_DIVMOD,
871 static const BcInst dc_parse_insts[] = {
872 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID, BC_INST_REL_GE,
873 BC_INST_INVALID, BC_INST_POWER, BC_INST_MULTIPLY, BC_INST_DIVIDE,
874 BC_INST_MODULUS, BC_INST_PLUS, BC_INST_MINUS,
875 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID,
876 BC_INST_INVALID, BC_INST_INVALID,
877 BC_INST_BOOL_NOT, BC_INST_INVALID, BC_INST_INVALID,
878 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID,
879 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID,
880 BC_INST_INVALID, BC_INST_INVALID, BC_INST_REL_GT, BC_INST_INVALID,
881 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID, BC_INST_REL_GE,
882 BC_INST_INVALID, BC_INST_INVALID,
883 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID,
884 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID,
885 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID, BC_INST_IBASE,
886 BC_INST_INVALID, BC_INST_INVALID, BC_INST_LENGTH, BC_INST_INVALID,
887 BC_INST_OBASE, BC_INST_PRINT, BC_INST_QUIT, BC_INST_INVALID,
888 BC_INST_INVALID, BC_INST_SCALE, BC_INST_SQRT, BC_INST_INVALID,
889 BC_INST_REL_EQ, BC_INST_MODEXP, BC_INST_DIVMOD, BC_INST_INVALID,
890 BC_INST_INVALID, BC_INST_EXECUTE, BC_INST_PRINT_STACK, BC_INST_CLEAR_STACK,
891 BC_INST_STACK_LEN, BC_INST_DUPLICATE, BC_INST_SWAP, BC_INST_POP,
892 BC_INST_ASCIIFY, BC_INST_PRINT_STREAM, BC_INST_INVALID, BC_INST_INVALID,
893 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID,
894 BC_INST_PRINT, BC_INST_NQUIT, BC_INST_SCALE_FUNC,
898 static const BcNumBinaryOp bc_program_ops[] = {
899 bc_num_pow, bc_num_mul, bc_num_div, bc_num_mod, bc_num_add, bc_num_sub,
902 static void fflush_and_check(void)
905 if (ferror(stdout) || ferror(stderr))
906 bb_perror_msg_and_die("output error");
909 #if ENABLE_FEATURE_CLEAN_UP
910 #define quit_or_return_for_exit() \
912 IF_FEATURE_BC_SIGNALS(G_ttyin = 0;) /* do not loop in main loop anymore */ \
913 return BC_STATUS_FAILURE; \
916 #define quit_or_return_for_exit() quit()
919 static void quit(void) NORETURN;
920 static void quit(void)
923 bb_perror_msg_and_die("input error");
928 static void bc_verror_msg(const char *fmt, va_list p)
930 const char *sv = sv; /* for compiler */
933 applet_name = xasprintf("%s: %s:%u", applet_name, G.prog.file, G.err_line);
935 bb_verror_msg(fmt, p, NULL);
937 free((char*)applet_name);
942 static NOINLINE int bc_error_fmt(const char *fmt, ...)
947 bc_verror_msg(fmt, p);
950 if (!ENABLE_FEATURE_CLEAN_UP && !G_ttyin)
952 return BC_STATUS_FAILURE;
955 static NOINLINE int bc_posix_error_fmt(const char *fmt, ...)
959 // Are non-POSIX constructs totally ok?
960 if (!(option_mask32 & (BC_FLAG_S|BC_FLAG_W)))
961 return BC_STATUS_SUCCESS; // yes
964 bc_verror_msg(fmt, p);
967 // Do we treat non-POSIX constructs as errors?
968 if (!(option_mask32 & BC_FLAG_S))
969 return BC_STATUS_SUCCESS; // no, it's a warning
970 if (!ENABLE_FEATURE_CLEAN_UP && !G_ttyin)
972 return BC_STATUS_FAILURE;
975 // We use error functions with "return bc_error(FMT[, PARAMS])" idiom.
976 // This idiom begs for tail-call optimization, but for it to work,
977 // function must not have calller-cleaned parameters on stack.
978 // Unfortunately, vararg functions do exactly that on most arches.
979 // Thus, these shims for the cases when we have no PARAMS:
980 static int bc_error(const char *msg)
982 return bc_error_fmt("%s", msg);
984 static int bc_posix_error(const char *msg)
986 return bc_posix_error_fmt("%s", msg);
988 static int bc_POSIX_does_not_allow(const char *msg)
990 return bc_posix_error_fmt("%s%s", "POSIX does not allow ", msg);
992 static int bc_POSIX_does_not_allow_bool_ops_this_is_bad(const char *msg)
994 return bc_posix_error_fmt("%s%s %s", "POSIX does not allow ", "boolean operators; the following is bad:", msg);
996 static int bc_POSIX_does_not_allow_empty_X_expression_in_for(const char *msg)
998 return bc_posix_error_fmt("%san empty %s expression in a for loop", "POSIX does not allow ", msg);
1000 static int bc_error_bad_character(char c)
1002 return bc_error_fmt("bad character '%c'", c);
1004 static int bc_error_bad_expression(void)
1006 return bc_error("bad expression");
1008 static int bc_error_bad_token(void)
1010 return bc_error("bad token");
1012 static int bc_error_stack_has_too_few_elements(void)
1014 return bc_error("stack has too few elements");
1016 static int bc_error_variable_is_wrong_type(void)
1018 return bc_error("variable is wrong type");
1020 static int bc_error_nested_read_call(void)
1022 return bc_error("read() call inside of a read() call");
1025 static void bc_vec_grow(BcVec *v, size_t n)
1027 size_t cap = v->cap * 2;
1028 while (cap < v->len + n) cap *= 2;
1029 v->v = xrealloc(v->v, v->size * cap);
1033 static void bc_vec_init(BcVec *v, size_t esize, BcVecFree dtor)
1036 v->cap = BC_VEC_START_CAP;
1039 v->v = xmalloc(esize * BC_VEC_START_CAP);
1042 static void bc_char_vec_init(BcVec *v)
1044 bc_vec_init(v, sizeof(char), NULL);
1047 static void bc_vec_expand(BcVec *v, size_t req)
1050 v->v = xrealloc(v->v, v->size * req);
1055 static void bc_vec_npop(BcVec *v, size_t n)
1060 size_t len = v->len - n;
1061 while (v->len > len) v->dtor(v->v + (v->size * --v->len));
1065 static void bc_vec_pop_all(BcVec *v)
1067 bc_vec_npop(v, v->len);
1070 static void bc_vec_push(BcVec *v, const void *data)
1072 if (v->len + 1 > v->cap) bc_vec_grow(v, 1);
1073 memmove(v->v + (v->size * v->len), data, v->size);
1077 static void bc_vec_pushByte(BcVec *v, char data)
1079 bc_vec_push(v, &data);
1082 static void bc_vec_pushZeroByte(BcVec *v)
1084 //bc_vec_pushByte(v, '\0');
1086 bc_vec_push(v, &const_int_0);
1089 static void bc_vec_pushAt(BcVec *v, const void *data, size_t idx)
1092 bc_vec_push(v, data);
1097 if (v->len == v->cap) bc_vec_grow(v, 1);
1099 ptr = v->v + v->size * idx;
1101 memmove(ptr + v->size, ptr, v->size * (v->len++ - idx));
1102 memmove(ptr, data, v->size);
1106 static void bc_vec_string(BcVec *v, size_t len, const char *str)
1109 bc_vec_expand(v, len + 1);
1110 memcpy(v->v, str, len);
1113 bc_vec_pushZeroByte(v);
1116 static void bc_vec_concat(BcVec *v, const char *str)
1120 if (v->len == 0) bc_vec_pushZeroByte(v);
1122 len = v->len + strlen(str);
1124 if (v->cap < len) bc_vec_grow(v, len - v->len);
1130 static void *bc_vec_item(const BcVec *v, size_t idx)
1132 return v->v + v->size * idx;
1135 static void *bc_vec_item_rev(const BcVec *v, size_t idx)
1137 return v->v + v->size * (v->len - idx - 1);
1140 static void bc_vec_free(void *vec)
1142 BcVec *v = (BcVec *) vec;
1147 static int bc_id_cmp(const void *e1, const void *e2)
1149 return strcmp(((const BcId *) e1)->name, ((const BcId *) e2)->name);
1152 static void bc_id_free(void *id)
1154 free(((BcId *) id)->name);
1157 static size_t bc_map_find(const BcVec *v, const void *ptr)
1159 size_t low = 0, high = v->len;
1161 while (low < high) {
1163 size_t mid = (low + high) / 2;
1164 BcId *id = bc_vec_item(v, mid);
1165 int result = bc_id_cmp(ptr, id);
1169 else if (result < 0)
1178 static int bc_map_insert(BcVec *v, const void *ptr, size_t *i)
1180 size_t n = *i = bc_map_find(v, ptr);
1183 bc_vec_push(v, ptr);
1184 else if (!bc_id_cmp(ptr, bc_vec_item(v, n)))
1185 return 0; // "was not inserted"
1187 bc_vec_pushAt(v, ptr, n);
1188 return 1; // "was inserted"
1191 static size_t bc_map_index(const BcVec *v, const void *ptr)
1193 size_t i = bc_map_find(v, ptr);
1194 if (i >= v->len) return BC_VEC_INVALID_IDX;
1195 return bc_id_cmp(ptr, bc_vec_item(v, i)) ? BC_VEC_INVALID_IDX : i;
1198 static BcStatus bc_read_line(BcVec *vec, const char *prompt)
1206 bc_vec_pop_all(vec);
1209 #if ENABLE_FEATURE_BC_SIGNALS
1210 if (bb_got_signal) { // ^C was pressed
1212 bb_got_signal = 0; // resets G_interrupt to zero
1214 ? "\ninterrupt (type \"quit\" to exit)\n"
1215 : "\ninterrupt (type \"q\" to exit)\n"
1219 if (G_ttyin && !G_posix)
1220 fputs(prompt, stderr);
1222 #if ENABLE_FEATURE_BC_SIGNALS
1228 #if ENABLE_FEATURE_BC_SIGNALS
1229 // Both conditions appear simultaneously, check both just in case
1230 if (errno == EINTR || bb_got_signal) {
1237 quit(); // this emits error message
1239 // Note: EOF does not append '\n', therefore:
1240 // printf 'print 123\n' | bc - works
1241 // printf 'print 123' | bc - fails (syntax error)
1245 if ((i < ' ' && i != '\t' && i != '\r' && i != '\n') // also allow '\v' '\f'?
1248 // Bad chars on this line, ignore entire line
1249 bc_error_fmt("illegal character 0x%02x", i);
1252 bc_vec_pushByte(vec, (char)i);
1253 } while (i != '\n');
1254 } while (bad_chars);
1256 bc_vec_pushZeroByte(vec);
1258 return BC_STATUS_SUCCESS;
1261 static char* bc_read_file(const char *path)
1264 size_t size = ((size_t) -1);
1267 buf = xmalloc_open_read_close(path, &size);
1269 for (i = 0; i < size; ++i) {
1271 if ((c < ' ' && c != '\t' && c != '\r' && c != '\n') // also allow '\v' '\f'?
1283 static void bc_num_setToZero(BcNum *n, size_t scale)
1290 static void bc_num_zero(BcNum *n)
1292 bc_num_setToZero(n, 0);
1295 static void bc_num_one(BcNum *n)
1297 bc_num_setToZero(n, 0);
1302 static void bc_num_ten(BcNum *n)
1304 bc_num_setToZero(n, 0);
1310 static void bc_num_init(BcNum *n, size_t req)
1312 req = req >= BC_NUM_DEF_SIZE ? req : BC_NUM_DEF_SIZE;
1313 memset(n, 0, sizeof(BcNum));
1314 n->num = xmalloc(req);
1318 static void bc_num_expand(BcNum *n, size_t req)
1320 req = req >= BC_NUM_DEF_SIZE ? req : BC_NUM_DEF_SIZE;
1322 n->num = xrealloc(n->num, req);
1327 static void bc_num_free(void *num)
1329 free(((BcNum *) num)->num);
1332 static void bc_num_copy(BcNum *d, BcNum *s)
1335 bc_num_expand(d, s->cap);
1339 memcpy(d->num, s->num, sizeof(BcDig) * d->len);
1343 static BcStatus bc_num_ulong(BcNum *n, unsigned long *result)
1348 if (n->neg) return bc_error("negative number");
1350 for (*result = 0, pow = 1, i = n->rdx; i < n->len; ++i) {
1352 unsigned long prev = *result, powprev = pow;
1354 *result += ((unsigned long) n->num[i]) * pow;
1357 if (*result < prev || pow < powprev)
1358 return bc_error("overflow");
1361 return BC_STATUS_SUCCESS;
1364 static void bc_num_ulong2num(BcNum *n, unsigned long val)
1372 if (val == 0) return;
1374 for (len = 1, i = ULONG_MAX; i != 0; i /= 10, ++len) bc_num_expand(n, len);
1375 for (ptr = n->num, i = 0; val; ++i, ++n->len, val /= 10) ptr[i] = val % 10;
1378 static void bc_num_subArrays(BcDig *restrict a, BcDig *restrict b,
1382 for (i = 0; i < len; ++i) {
1383 for (a[i] -= b[i], j = 0; a[i + j] < 0;) {
1390 static ssize_t bc_num_compare(BcDig *restrict a, BcDig *restrict b, size_t len)
1394 for (i = len - 1; i < len && !(c = a[i] - b[i]); --i);
1395 return BC_NUM_NEG(i + 1, c < 0);
1398 static ssize_t bc_num_cmp(BcNum *a, BcNum *b)
1400 size_t i, min, a_int, b_int, diff;
1401 BcDig *max_num, *min_num;
1402 bool a_max, neg = false;
1405 if (a == b) return 0;
1406 if (a->len == 0) return BC_NUM_NEG(!!b->len, !b->neg);
1407 if (b->len == 0) return BC_NUM_NEG(1, a->neg);
1417 a_int = BC_NUM_INT(a);
1418 b_int = BC_NUM_INT(b);
1420 a_max = (a->rdx > b->rdx);
1422 if (a_int != 0) return (ssize_t) a_int;
1426 diff = a->rdx - b->rdx;
1427 max_num = a->num + diff;
1432 diff = b->rdx - a->rdx;
1433 max_num = b->num + diff;
1437 cmp = bc_num_compare(max_num, min_num, b_int + min);
1438 if (cmp != 0) return BC_NUM_NEG(cmp, (!a_max) != neg);
1440 for (max_num -= diff, i = diff - 1; i < diff; --i) {
1441 if (max_num[i]) return BC_NUM_NEG(1, (!a_max) != neg);
1447 static void bc_num_truncate(BcNum *n, size_t places)
1449 if (places == 0) return;
1455 memmove(n->num, n->num + places, n->len * sizeof(BcDig));
1459 static void bc_num_extend(BcNum *n, size_t places)
1461 size_t len = n->len + places;
1465 if (n->cap < len) bc_num_expand(n, len);
1467 memmove(n->num + places, n->num, sizeof(BcDig) * n->len);
1468 memset(n->num, 0, sizeof(BcDig) * places);
1475 static void bc_num_clean(BcNum *n)
1477 while (n->len > 0 && n->num[n->len - 1] == 0) --n->len;
1480 else if (n->len < n->rdx)
1484 static void bc_num_retireMul(BcNum *n, size_t scale, bool neg1, bool neg2)
1487 bc_num_extend(n, scale - n->rdx);
1489 bc_num_truncate(n, n->rdx - scale);
1492 if (n->len != 0) n->neg = !neg1 != !neg2;
1495 static void bc_num_split(BcNum *restrict n, size_t idx, BcNum *restrict a,
1500 b->len = n->len - idx;
1502 a->rdx = b->rdx = 0;
1504 memcpy(b->num, n->num + idx, b->len * sizeof(BcDig));
1505 memcpy(a->num, n->num, idx * sizeof(BcDig));
1516 static BcStatus bc_num_shift(BcNum *n, size_t places)
1518 if (places == 0 || n->len == 0) return BC_STATUS_SUCCESS;
1519 if (places + n->len > BC_MAX_NUM)
1520 return bc_error("number too long: must be [1, BC_NUM_MAX]");
1522 if (n->rdx >= places)
1525 bc_num_extend(n, places - n->rdx);
1531 return BC_STATUS_SUCCESS;
1534 static BcStatus bc_num_inv(BcNum *a, BcNum *b, size_t scale)
1543 return bc_num_div(&one, a, b, scale);
1546 static BcStatus bc_num_a(BcNum *a, BcNum *b, BcNum *restrict c, size_t sub)
1548 BcDig *ptr, *ptr_a, *ptr_b, *ptr_c;
1549 size_t i, max, min_rdx, min_int, diff, a_int, b_int;
1552 // Because this function doesn't need to use scale (per the bc spec),
1553 // I am hijacking it to say whether it's doing an add or a subtract.
1557 if (sub && c->len) c->neg = !c->neg;
1558 return BC_STATUS_SUCCESS;
1560 else if (b->len == 0) {
1562 return BC_STATUS_SUCCESS;
1566 c->rdx = BC_MAX(a->rdx, b->rdx);
1567 min_rdx = BC_MIN(a->rdx, b->rdx);
1570 if (a->rdx > b->rdx) {
1571 diff = a->rdx - b->rdx;
1573 ptr_a = a->num + diff;
1577 diff = b->rdx - a->rdx;
1580 ptr_b = b->num + diff;
1583 for (ptr_c = c->num, i = 0; i < diff; ++i, ++c->len) ptr_c[i] = ptr[i];
1586 a_int = BC_NUM_INT(a);
1587 b_int = BC_NUM_INT(b);
1589 if (a_int > b_int) {
1600 for (carry = 0, i = 0; i < min_rdx + min_int; ++i, ++c->len) {
1601 in = ((int) ptr_a[i]) + ((int) ptr_b[i]) + carry;
1603 ptr_c[i] = (BcDig)(in % 10);
1606 for (; i < max + min_rdx; ++i, ++c->len) {
1607 in = ((int) ptr[i]) + carry;
1609 ptr_c[i] = (BcDig)(in % 10);
1612 if (carry != 0) c->num[c->len++] = (BcDig) carry;
1614 return BC_STATUS_SUCCESS; // can't make void, see bc_num_binary()
1617 static BcStatus bc_num_s(BcNum *a, BcNum *b, BcNum *restrict c, size_t sub)
1620 BcNum *minuend, *subtrahend;
1622 bool aneg, bneg, neg;
1624 // Because this function doesn't need to use scale (per the bc spec),
1625 // I am hijacking it to say whether it's doing an add or a subtract.
1629 if (sub && c->len) c->neg = !c->neg;
1630 return BC_STATUS_SUCCESS;
1632 else if (b->len == 0) {
1634 return BC_STATUS_SUCCESS;
1639 a->neg = b->neg = false;
1641 cmp = bc_num_cmp(a, b);
1647 bc_num_setToZero(c, BC_MAX(a->rdx, b->rdx));
1648 return BC_STATUS_SUCCESS;
1657 if (sub) neg = !neg;
1662 bc_num_copy(c, minuend);
1665 if (c->rdx < subtrahend->rdx) {
1666 bc_num_extend(c, subtrahend->rdx - c->rdx);
1670 start = c->rdx - subtrahend->rdx;
1672 bc_num_subArrays(c->num + start, subtrahend->num, subtrahend->len);
1676 return BC_STATUS_SUCCESS; // can't make void, see bc_num_binary()
1679 static BcStatus bc_num_k(BcNum *restrict a, BcNum *restrict b,
1683 size_t max = BC_MAX(a->len, b->len), max2 = (max + 1) / 2;
1684 BcNum l1, h1, l2, h2, m2, m1, z0, z1, z2, temp;
1687 if (a->len == 0 || b->len == 0) {
1689 return BC_STATUS_SUCCESS;
1691 aone = BC_NUM_ONE(a);
1692 if (aone || BC_NUM_ONE(b)) {
1693 bc_num_copy(c, aone ? b : a);
1694 return BC_STATUS_SUCCESS;
1697 if (a->len + b->len < BC_NUM_KARATSUBA_LEN ||
1698 a->len < BC_NUM_KARATSUBA_LEN || b->len < BC_NUM_KARATSUBA_LEN)
1703 bc_num_expand(c, a->len + b->len + 1);
1705 memset(c->num, 0, sizeof(BcDig) * c->cap);
1708 for (i = 0; i < b->len; ++i) {
1711 for (j = 0; j < a->len; ++j) {
1712 unsigned in = c->num[i + j];
1713 in += ((unsigned) a->num[j]) * ((unsigned) b->num[i]) + carry;
1714 // note: compilers prefer _unsigned_ div/const
1716 c->num[i + j] = (BcDig)(in % 10);
1719 c->num[i + j] += (BcDig) carry;
1720 len = BC_MAX(len, i + j + !!carry);
1723 // a*a <- without check below, this will not be interruptible
1724 if (G_interrupt) return BC_STATUS_FAILURE;
1729 return BC_STATUS_SUCCESS;
1732 bc_num_init(&l1, max);
1733 bc_num_init(&h1, max);
1734 bc_num_init(&l2, max);
1735 bc_num_init(&h2, max);
1736 bc_num_init(&m1, max);
1737 bc_num_init(&m2, max);
1738 bc_num_init(&z0, max);
1739 bc_num_init(&z1, max);
1740 bc_num_init(&z2, max);
1741 bc_num_init(&temp, max + max);
1743 bc_num_split(a, max2, &l1, &h1);
1744 bc_num_split(b, max2, &l2, &h2);
1746 s = bc_num_add(&h1, &l1, &m1, 0);
1748 s = bc_num_add(&h2, &l2, &m2, 0);
1751 s = bc_num_k(&h1, &h2, &z0);
1753 s = bc_num_k(&m1, &m2, &z1);
1755 s = bc_num_k(&l1, &l2, &z2);
1758 s = bc_num_sub(&z1, &z0, &temp, 0);
1760 s = bc_num_sub(&temp, &z2, &z1, 0);
1763 s = bc_num_shift(&z0, max2 * 2);
1765 s = bc_num_shift(&z1, max2);
1767 s = bc_num_add(&z0, &z1, &temp, 0);
1769 s = bc_num_add(&temp, &z2, c, 0);
1785 static BcStatus bc_num_m(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale)
1789 size_t maxrdx = BC_MAX(a->rdx, b->rdx);
1791 scale = BC_MAX(scale, a->rdx);
1792 scale = BC_MAX(scale, b->rdx);
1793 scale = BC_MIN(a->rdx + b->rdx, scale);
1794 maxrdx = BC_MAX(maxrdx, scale);
1796 bc_num_init(&cpa, a->len);
1797 bc_num_init(&cpb, b->len);
1799 bc_num_copy(&cpa, a);
1800 bc_num_copy(&cpb, b);
1801 cpa.neg = cpb.neg = false;
1803 s = bc_num_shift(&cpa, maxrdx);
1805 s = bc_num_shift(&cpb, maxrdx);
1807 s = bc_num_k(&cpa, &cpb, c);
1811 bc_num_expand(c, c->len + maxrdx);
1813 if (c->len < maxrdx) {
1814 memset(c->num + c->len, 0, (c->cap - c->len) * sizeof(BcDig));
1819 bc_num_retireMul(c, scale, a->neg, b->neg);
1827 static BcStatus bc_num_d(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale)
1829 BcStatus s = BC_STATUS_SUCCESS;
1836 return bc_error("divide by zero");
1837 else if (a->len == 0) {
1838 bc_num_setToZero(c, scale);
1839 return BC_STATUS_SUCCESS;
1841 else if (BC_NUM_ONE(b)) {
1843 bc_num_retireMul(c, scale, a->neg, b->neg);
1844 return BC_STATUS_SUCCESS;
1847 bc_num_init(&cp, BC_NUM_MREQ(a, b, scale));
1848 bc_num_copy(&cp, a);
1852 bc_num_expand(&cp, len + 2);
1853 bc_num_extend(&cp, len - cp.len);
1856 if (b->rdx > cp.rdx) bc_num_extend(&cp, b->rdx - cp.rdx);
1858 if (scale > cp.rdx) bc_num_extend(&cp, scale - cp.rdx);
1860 if (b->rdx == b->len) {
1861 for (i = 0; zero && i < len; ++i) zero = !b->num[len - i - 1];
1865 if (cp.cap == cp.len) bc_num_expand(&cp, cp.len + 1);
1867 // We want an extra zero in front to make things simpler.
1868 cp.num[cp.len++] = 0;
1871 bc_num_expand(c, cp.len);
1874 memset(c->num + end, 0, (c->cap - end) * sizeof(BcDig));
1879 for (i = end - 1; !s && i < end; --i) {
1881 for (q = 0; (!s && n[len] != 0) || bc_num_compare(n, p, len) >= 0; ++q)
1882 bc_num_subArrays(n, p, len);
1886 // 1/a <- without check below, this will not be interruptible
1888 s = BC_STATUS_FAILURE;
1893 bc_num_retireMul(c, scale, a->neg, b->neg);
1899 static BcStatus bc_num_r(BcNum *a, BcNum *b, BcNum *restrict c,
1900 BcNum *restrict d, size_t scale, size_t ts)
1907 return bc_error("divide by zero");
1910 bc_num_setToZero(d, ts);
1911 return BC_STATUS_SUCCESS;
1914 bc_num_init(&temp, d->cap);
1915 s = bc_num_d(a, b, c, scale);
1918 if (scale != 0) scale = ts;
1920 s = bc_num_m(c, b, &temp, scale);
1922 s = bc_num_sub(a, &temp, d, scale);
1925 if (ts > d->rdx && d->len) bc_num_extend(d, ts - d->rdx);
1928 bc_num_retireMul(d, ts, a->neg, b->neg);
1936 static BcStatus bc_num_rem(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale)
1940 size_t ts = BC_MAX(scale + b->rdx, a->rdx), len = BC_NUM_MREQ(a, b, ts);
1942 bc_num_init(&c1, len);
1943 s = bc_num_r(a, b, &c1, c, scale, ts);
1949 static BcStatus bc_num_p(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale)
1951 BcStatus s = BC_STATUS_SUCCESS;
1954 size_t i, powrdx, resrdx;
1957 if (b->rdx) return bc_error("non integer number");
1961 return BC_STATUS_SUCCESS;
1963 else if (a->len == 0) {
1964 bc_num_setToZero(c, scale);
1965 return BC_STATUS_SUCCESS;
1967 else if (BC_NUM_ONE(b)) {
1971 s = bc_num_inv(a, c, scale);
1978 s = bc_num_ulong(b, &pow);
1981 bc_num_init(©, a->len);
1982 bc_num_copy(©, a);
1984 if (!neg) scale = BC_MIN(a->rdx * pow, BC_MAX(scale, a->rdx));
1988 for (powrdx = a->rdx; !(pow & 1); pow >>= 1) {
1990 s = bc_num_mul(©, ©, ©, powrdx);
1992 // Not needed: bc_num_mul() has a check for ^C:
1993 //if (G_interrupt) {
1994 // s = BC_STATUS_FAILURE;
1999 bc_num_copy(c, ©);
2001 for (resrdx = powrdx, pow >>= 1; pow != 0; pow >>= 1) {
2004 s = bc_num_mul(©, ©, ©, powrdx);
2009 s = bc_num_mul(c, ©, c, resrdx);
2012 // Not needed: bc_num_mul() has a check for ^C:
2013 //if (G_interrupt) {
2014 // s = BC_STATUS_FAILURE;
2020 s = bc_num_inv(c, c, scale);
2024 if (c->rdx > scale) bc_num_truncate(c, c->rdx - scale);
2026 // We can't use bc_num_clean() here.
2027 for (zero = true, i = 0; zero && i < c->len; ++i) zero = !c->num[i];
2028 if (zero) bc_num_setToZero(c, scale);
2035 static BcStatus bc_num_binary(BcNum *a, BcNum *b, BcNum *c, size_t scale,
2036 BcNumBinaryOp op, size_t req)
2039 BcNum num2, *ptr_a, *ptr_b;
2044 memcpy(ptr_a, c, sizeof(BcNum));
2053 memcpy(ptr_b, c, sizeof(BcNum));
2061 bc_num_init(c, req);
2063 bc_num_expand(c, req);
2065 s = op(ptr_a, ptr_b, c, scale);
2067 if (init) bc_num_free(&num2);
2072 static bool bc_num_strValid(const char *val, size_t base)
2075 bool small, radix = false;
2076 size_t i, len = strlen(val);
2078 if (!len) return true;
2081 b = (BcDig)(small ? base + '0' : base - 10 + 'A');
2083 for (i = 0; i < len; ++i) {
2089 if (radix) return false;
2095 if (c < '0' || (small && c >= b) || (c > '9' && (c < 'A' || c >= b)))
2102 static void bc_num_parseDecimal(BcNum *n, const char *val)
2108 for (i = 0; val[i] == '0'; ++i);
2115 for (i = 0; zero && i < len; ++i) zero = val[i] == '0' || val[i] == '.';
2116 bc_num_expand(n, len);
2119 ptr = strchr(val, '.');
2123 n->rdx = (size_t)((val + len) - (ptr + 1));
2126 for (i = len - 1; i < len; ++n->len, i -= 1 + (i && val[i - 1] == '.'))
2127 n->num[n->len] = val[i] - '0';
2131 static void bc_num_parseBase(BcNum *n, const char *val, BcNum *base)
2134 BcNum temp, mult, result;
2138 size_t i, digits, len = strlen(val);
2142 for (i = 0; zero && i < len; ++i) zero = (val[i] == '.' || val[i] == '0');
2145 bc_num_init(&temp, BC_NUM_DEF_SIZE);
2146 bc_num_init(&mult, BC_NUM_DEF_SIZE);
2148 for (i = 0; i < len; ++i) {
2151 if (c == '.') break;
2153 v = (unsigned long) (c <= '9' ? c - '0' : c - 'A' + 10);
2155 s = bc_num_mul(n, base, &mult, 0);
2156 if (s) goto int_err;
2157 bc_num_ulong2num(&temp, v);
2158 s = bc_num_add(&mult, &temp, n, 0);
2159 if (s) goto int_err;
2164 if (c == 0) goto int_err;
2167 bc_num_init(&result, base->len);
2168 bc_num_zero(&result);
2171 for (i += 1, digits = 0; i < len; ++i, ++digits) {
2176 v = (unsigned long) (c <= '9' ? c - '0' : c - 'A' + 10);
2178 s = bc_num_mul(&result, base, &result, 0);
2180 bc_num_ulong2num(&temp, v);
2181 s = bc_num_add(&result, &temp, &result, 0);
2183 s = bc_num_mul(&mult, base, &mult, 0);
2187 s = bc_num_div(&result, &mult, &result, digits);
2189 s = bc_num_add(n, &result, n, digits);
2193 if (n->rdx < digits) bc_num_extend(n, digits - n->rdx);
2199 bc_num_free(&result);
2205 static void bc_num_printNewline(size_t *nchars, size_t line_len)
2207 if (*nchars == line_len - 1) {
2215 static void bc_num_printChar(size_t num, size_t width, bool radix,
2216 size_t *nchars, size_t line_len)
2218 (void) radix, (void) line_len;
2219 bb_putchar((char) num);
2220 *nchars = *nchars + width;
2224 static void bc_num_printDigits(size_t num, size_t width, bool radix,
2225 size_t *nchars, size_t line_len)
2229 bc_num_printNewline(nchars, line_len);
2230 bb_putchar(radix ? '.' : ' ');
2233 bc_num_printNewline(nchars, line_len);
2234 for (exp = 0, pow = 1; exp < width - 1; ++exp, pow *= 10)
2237 for (exp = 0; exp < width; pow /= 10, ++(*nchars), ++exp) {
2239 bc_num_printNewline(nchars, line_len);
2242 bb_putchar(((char) dig) + '0');
2246 static void bc_num_printHex(size_t num, size_t width, bool radix,
2247 size_t *nchars, size_t line_len)
2250 bc_num_printNewline(nchars, line_len);
2255 bc_num_printNewline(nchars, line_len);
2256 bb_putchar(bb_hexdigits_upcase[num]);
2257 *nchars = *nchars + width;
2260 static void bc_num_printDecimal(BcNum *n, size_t *nchars, size_t len)
2262 size_t i, rdx = n->rdx - 1;
2264 if (n->neg) bb_putchar('-');
2265 (*nchars) += n->neg;
2267 for (i = n->len - 1; i < n->len; --i)
2268 bc_num_printHex((size_t) n->num[i], 1, i == rdx, nchars, len);
2271 static BcStatus bc_num_printNum(BcNum *n, BcNum *base, size_t width,
2272 size_t *nchars, size_t len, BcNumDigitOp print)
2276 BcNum intp, fracp, digit, frac_len;
2277 unsigned long dig, *ptr;
2282 print(0, width, false, nchars, len);
2283 return BC_STATUS_SUCCESS;
2286 bc_vec_init(&stack, sizeof(long), NULL);
2287 bc_num_init(&intp, n->len);
2288 bc_num_init(&fracp, n->rdx);
2289 bc_num_init(&digit, width);
2290 bc_num_init(&frac_len, BC_NUM_INT(n));
2291 bc_num_copy(&intp, n);
2292 bc_num_one(&frac_len);
2294 bc_num_truncate(&intp, intp.rdx);
2295 s = bc_num_sub(n, &intp, &fracp, 0);
2298 while (intp.len != 0) {
2299 s = bc_num_divmod(&intp, base, &intp, &digit, 0);
2301 s = bc_num_ulong(&digit, &dig);
2303 bc_vec_push(&stack, &dig);
2306 for (i = 0; i < stack.len; ++i) {
2307 ptr = bc_vec_item_rev(&stack, i);
2308 print(*ptr, width, false, nchars, len);
2311 if (!n->rdx) goto err;
2313 for (radix = true; frac_len.len <= n->rdx; radix = false) {
2314 s = bc_num_mul(&fracp, base, &fracp, n->rdx);
2316 s = bc_num_ulong(&fracp, &dig);
2318 bc_num_ulong2num(&intp, dig);
2319 s = bc_num_sub(&fracp, &intp, &fracp, 0);
2321 print(dig, width, radix, nchars, len);
2322 s = bc_num_mul(&frac_len, base, &frac_len, 0);
2327 bc_num_free(&frac_len);
2328 bc_num_free(&digit);
2329 bc_num_free(&fracp);
2331 bc_vec_free(&stack);
2335 static BcStatus bc_num_printBase(BcNum *n, BcNum *base, size_t base_t,
2336 size_t *nchars, size_t line_len)
2343 if (neg) bb_putchar('-');
2348 if (base_t <= BC_NUM_MAX_IBASE) {
2350 print = bc_num_printHex;
2353 for (i = base_t - 1, width = 0; i != 0; i /= 10, ++width);
2354 print = bc_num_printDigits;
2357 s = bc_num_printNum(n, base, width, nchars, line_len, print);
2364 static BcStatus bc_num_stream(BcNum *n, BcNum *base, size_t *nchars, size_t len)
2366 return bc_num_printNum(n, base, 1, nchars, len, bc_num_printChar);
2370 static BcStatus bc_num_parse(BcNum *n, const char *val, BcNum *base,
2373 if (!bc_num_strValid(val, base_t))
2374 return bc_error("bad number string");
2377 bc_num_parseDecimal(n, val);
2379 bc_num_parseBase(n, val, base);
2381 return BC_STATUS_SUCCESS;
2384 static BcStatus bc_num_print(BcNum *n, BcNum *base, size_t base_t, bool newline,
2385 size_t *nchars, size_t line_len)
2387 BcStatus s = BC_STATUS_SUCCESS;
2389 bc_num_printNewline(nchars, line_len);
2395 else if (base_t == 10)
2396 bc_num_printDecimal(n, nchars, line_len);
2398 s = bc_num_printBase(n, base, base_t, nchars, line_len);
2408 static BcStatus bc_num_add(BcNum *a, BcNum *b, BcNum *c, size_t scale)
2410 BcNumBinaryOp op = (!a->neg == !b->neg) ? bc_num_a : bc_num_s;
2412 return bc_num_binary(a, b, c, false, op, BC_NUM_AREQ(a, b));
2415 static BcStatus bc_num_sub(BcNum *a, BcNum *b, BcNum *c, size_t scale)
2417 BcNumBinaryOp op = (!a->neg == !b->neg) ? bc_num_s : bc_num_a;
2419 return bc_num_binary(a, b, c, true, op, BC_NUM_AREQ(a, b));
2422 static BcStatus bc_num_mul(BcNum *a, BcNum *b, BcNum *c, size_t scale)
2424 size_t req = BC_NUM_MREQ(a, b, scale);
2425 return bc_num_binary(a, b, c, scale, bc_num_m, req);
2428 static BcStatus bc_num_div(BcNum *a, BcNum *b, BcNum *c, size_t scale)
2430 size_t req = BC_NUM_MREQ(a, b, scale);
2431 return bc_num_binary(a, b, c, scale, bc_num_d, req);
2434 static BcStatus bc_num_mod(BcNum *a, BcNum *b, BcNum *c, size_t scale)
2436 size_t req = BC_NUM_MREQ(a, b, scale);
2437 return bc_num_binary(a, b, c, scale, bc_num_rem, req);
2440 static BcStatus bc_num_pow(BcNum *a, BcNum *b, BcNum *c, size_t scale)
2442 return bc_num_binary(a, b, c, scale, bc_num_p, a->len * b->len + 1);
2445 static BcStatus bc_num_sqrt(BcNum *a, BcNum *restrict b, size_t scale)
2448 BcNum num1, num2, half, f, fprime, *x0, *x1, *temp;
2449 size_t pow, len, digs, digs1, resrdx, req, times = 0;
2450 ssize_t cmp = 1, cmp1 = SSIZE_MAX, cmp2 = SSIZE_MAX;
2452 req = BC_MAX(scale, a->rdx) + ((BC_NUM_INT(a) + 1) >> 1) + 1;
2453 bc_num_expand(b, req);
2456 bc_num_setToZero(b, scale);
2457 return BC_STATUS_SUCCESS;
2460 return bc_error("negative number");
2461 else if (BC_NUM_ONE(a)) {
2463 bc_num_extend(b, scale);
2464 return BC_STATUS_SUCCESS;
2467 scale = BC_MAX(scale, a->rdx) + 1;
2468 len = a->len + scale;
2470 bc_num_init(&num1, len);
2471 bc_num_init(&num2, len);
2472 bc_num_init(&half, BC_NUM_DEF_SIZE);
2478 bc_num_init(&f, len);
2479 bc_num_init(&fprime, len);
2485 pow = BC_NUM_INT(a);
2494 pow -= 2 - (pow & 1);
2496 bc_num_extend(x0, pow);
2498 // Make sure to move the radix back.
2502 x0->rdx = digs = digs1 = 0;
2504 len = BC_NUM_INT(x0) + resrdx - 1;
2506 while (cmp != 0 || digs < len) {
2508 s = bc_num_div(a, x0, &f, resrdx);
2510 s = bc_num_add(x0, &f, &fprime, resrdx);
2512 s = bc_num_mul(&fprime, &half, x1, resrdx);
2515 cmp = bc_num_cmp(x1, x0);
2516 digs = x1->len - (unsigned long long) llabs(cmp);
2518 if (cmp == cmp2 && digs == digs1)
2523 resrdx += times > 4;
2536 if (b->rdx > scale) bc_num_truncate(b, b->rdx - scale);
2539 bc_num_free(&fprime);
2547 static BcStatus bc_num_divmod(BcNum *a, BcNum *b, BcNum *c, BcNum *d,
2553 size_t ts = BC_MAX(scale + b->rdx, a->rdx), len = BC_NUM_MREQ(a, b, ts);
2556 memcpy(&num2, c, sizeof(BcNum));
2558 bc_num_init(c, len);
2563 bc_num_expand(c, len);
2566 s = bc_num_r(ptr_a, b, c, d, scale, ts);
2568 if (init) bc_num_free(&num2);
2574 static BcStatus bc_num_modexp(BcNum *a, BcNum *b, BcNum *c, BcNum *restrict d)
2577 BcNum base, exp, two, temp;
2580 return bc_error("divide by zero");
2581 if (a->rdx || b->rdx || c->rdx)
2582 return bc_error("non integer number");
2584 return bc_error("negative number");
2586 bc_num_expand(d, c->len);
2587 bc_num_init(&base, c->len);
2588 bc_num_init(&exp, b->len);
2589 bc_num_init(&two, BC_NUM_DEF_SIZE);
2590 bc_num_init(&temp, b->len);
2596 s = bc_num_rem(a, c, &base, 0);
2598 bc_num_copy(&exp, b);
2600 while (exp.len != 0) {
2602 s = bc_num_divmod(&exp, &two, &exp, &temp, 0);
2605 if (BC_NUM_ONE(&temp)) {
2606 s = bc_num_mul(d, &base, &temp, 0);
2608 s = bc_num_rem(&temp, c, d, 0);
2612 s = bc_num_mul(&base, &base, &temp, 0);
2614 s = bc_num_rem(&temp, c, &base, 0);
2627 static BcStatus bc_func_insert(BcFunc *f, char *name, bool var)
2632 for (i = 0; i < f->autos.len; ++i) {
2633 if (strcmp(name, ((BcId *) bc_vec_item(&f->autos, i))->name) == 0)
2634 return bc_error("function parameter or auto var has the same name as another");
2640 bc_vec_push(&f->autos, &a);
2642 return BC_STATUS_SUCCESS;
2645 static void bc_func_init(BcFunc *f)
2647 bc_char_vec_init(&f->code);
2648 bc_vec_init(&f->autos, sizeof(BcId), bc_id_free);
2649 bc_vec_init(&f->labels, sizeof(size_t), NULL);
2653 static void bc_func_free(void *func)
2655 BcFunc *f = (BcFunc *) func;
2656 bc_vec_free(&f->code);
2657 bc_vec_free(&f->autos);
2658 bc_vec_free(&f->labels);
2661 static void bc_array_expand(BcVec *a, size_t len);
2663 static void bc_array_init(BcVec *a, bool nums)
2666 bc_vec_init(a, sizeof(BcNum), bc_num_free);
2668 bc_vec_init(a, sizeof(BcVec), bc_vec_free);
2669 bc_array_expand(a, 1);
2672 static void bc_array_expand(BcVec *a, size_t len)
2676 if (a->size == sizeof(BcNum) && a->dtor == bc_num_free) {
2677 while (len > a->len) {
2678 bc_num_init(&data.n, BC_NUM_DEF_SIZE);
2679 bc_vec_push(a, &data.n);
2683 while (len > a->len) {
2684 bc_array_init(&data.v, true);
2685 bc_vec_push(a, &data.v);
2690 static void bc_array_copy(BcVec *d, const BcVec *s)
2695 bc_vec_expand(d, s->cap);
2698 for (i = 0; i < s->len; ++i) {
2699 BcNum *dnum = bc_vec_item(d, i), *snum = bc_vec_item(s, i);
2700 bc_num_init(dnum, snum->len);
2701 bc_num_copy(dnum, snum);
2705 static void bc_string_free(void *string)
2707 free(*((char **) string));
2711 static void bc_result_copy(BcResult *d, BcResult *src)
2717 case BC_RESULT_TEMP:
2718 case BC_RESULT_IBASE:
2719 case BC_RESULT_SCALE:
2720 case BC_RESULT_OBASE:
2722 bc_num_init(&d->d.n, src->d.n.len);
2723 bc_num_copy(&d->d.n, &src->d.n);
2728 case BC_RESULT_ARRAY:
2729 case BC_RESULT_ARRAY_ELEM:
2731 d->d.id.name = xstrdup(src->d.id.name);
2735 case BC_RESULT_CONSTANT:
2736 case BC_RESULT_LAST:
2740 memcpy(&d->d.n, &src->d.n, sizeof(BcNum));
2747 static void bc_result_free(void *result)
2749 BcResult *r = (BcResult *) result;
2753 case BC_RESULT_TEMP:
2754 case BC_RESULT_IBASE:
2755 case BC_RESULT_SCALE:
2756 case BC_RESULT_OBASE:
2758 bc_num_free(&r->d.n);
2763 case BC_RESULT_ARRAY:
2764 case BC_RESULT_ARRAY_ELEM:
2778 static void bc_lex_lineComment(BcLex *l)
2780 l->t.t = BC_LEX_WHITESPACE;
2781 while (l->i < l->len && l->buf[l->i++] != '\n');
2785 static void bc_lex_whitespace(BcLex *l)
2788 l->t.t = BC_LEX_WHITESPACE;
2789 for (c = l->buf[l->i]; c != '\n' && isspace(c); c = l->buf[++l->i]);
2792 static BcStatus bc_lex_number(BcLex *l, char start)
2794 const char *buf = l->buf + l->i;
2795 size_t len, hits = 0, bslashes = 0, i = 0, j;
2797 bool last_pt, pt = start == '.';
2800 l->t.t = BC_LEX_NUMBER;
2802 while (c != 0 && (isdigit(c) || (c >= 'A' && c <= 'F') ||
2803 (c == '.' && !pt) || (c == '\\' && buf[i + 1] == '\n')))
2817 len = i + !last_pt - bslashes * 2;
2818 if (len > BC_MAX_NUM)
2819 return bc_error("number too long: must be [1, BC_NUM_MAX]");
2821 bc_vec_pop_all(&l->t.v);
2822 bc_vec_expand(&l->t.v, len + 1);
2823 bc_vec_push(&l->t.v, &start);
2825 for (buf -= 1, j = 1; j < len + hits * 2; ++j) {
2829 // If we have hit a backslash, skip it. We don't have
2830 // to check for a newline because it's guaranteed.
2831 if (hits < bslashes && c == '\\') {
2837 bc_vec_push(&l->t.v, &c);
2840 bc_vec_pushZeroByte(&l->t.v);
2843 return BC_STATUS_SUCCESS;
2846 static BcStatus bc_lex_name(BcLex *l)
2849 const char *buf = l->buf + l->i - 1;
2852 l->t.t = BC_LEX_NAME;
2854 while ((c >= 'a' && c <= 'z') || isdigit(c) || c == '_') c = buf[++i];
2856 if (i > BC_MAX_STRING)
2857 return bc_error("name too long: must be [1, BC_NAME_MAX]");
2858 bc_vec_string(&l->t.v, i, buf);
2860 // Increment the index. We minus 1 because it has already been incremented.
2863 return BC_STATUS_SUCCESS;
2866 static void bc_lex_init(BcLex *l, BcLexNext next)
2869 bc_char_vec_init(&l->t.v);
2872 static void bc_lex_free(BcLex *l)
2874 bc_vec_free(&l->t.v);
2877 static void bc_lex_file(BcLex *l)
2879 G.err_line = l->line = 1;
2883 static BcStatus bc_lex_next(BcLex *l)
2888 if (l->t.last == BC_LEX_EOF) return bc_error("end of file");
2890 l->line += l->newline;
2891 G.err_line = l->line;
2892 l->t.t = BC_LEX_EOF;
2894 l->newline = (l->i == l->len);
2895 if (l->newline) return BC_STATUS_SUCCESS;
2897 // Loop until failure or we don't have whitespace. This
2898 // is so the parser doesn't get inundated with whitespace.
2901 } while (!s && l->t.t == BC_LEX_WHITESPACE);
2906 static BcStatus bc_lex_text(BcLex *l, const char *text)
2910 l->len = strlen(text);
2911 l->t.t = l->t.last = BC_LEX_INVALID;
2912 return bc_lex_next(l);
2916 static BcStatus bc_lex_identifier(BcLex *l)
2920 const char *buf = l->buf + l->i - 1;
2922 for (i = 0; i < ARRAY_SIZE(bc_lex_kws); ++i) {
2923 const char *keyword8 = bc_lex_kws[i].name8;
2925 while (buf[j] != '\0' && buf[j] == keyword8[j]) {
2927 if (j == 8) goto match;
2929 if (keyword8[j] != '\0')
2932 // buf starts with keyword bc_lex_kws[i]
2933 l->t.t = BC_LEX_KEY_1st_keyword + i;
2934 if (!((1 << i) & POSIX_KWORD_MASK)) {
2935 s = bc_posix_error_fmt("%sthe '%.8s' keyword", "POSIX does not allow ", bc_lex_kws[i].name8);
2939 // We minus 1 because the index has already been incremented.
2941 return BC_STATUS_SUCCESS;
2947 if (l->t.v.len > 2) {
2950 // bc: POSIX only allows one character names; the following is bad: 'qwe=1
2952 unsigned len = strchrnul(buf, '\n') - buf;
2953 s = bc_posix_error_fmt("POSIX only allows one character names; the following is bad: '%.*s'", len, buf);
2959 static BcStatus bc_lex_string(BcLex *l)
2961 size_t len, nls = 0, i = l->i;
2964 l->t.t = BC_LEX_STR;
2966 for (c = l->buf[i]; c != 0 && c != '"'; c = l->buf[++i]) nls += (c == '\n');
2970 return bc_error("string end could not be found");
2974 if (len > BC_MAX_STRING)
2975 return bc_error("string too long: must be [1, BC_STRING_MAX]");
2976 bc_vec_string(&l->t.v, len, l->buf + l->i);
2980 G.err_line = l->line;
2982 return BC_STATUS_SUCCESS;
2985 static void bc_lex_assign(BcLex *l, BcLexType with, BcLexType without)
2987 if (l->buf[l->i] == '=') {
2995 static BcStatus bc_lex_comment(BcLex *l)
2998 const char *buf = l->buf;
3000 l->t.t = BC_LEX_WHITESPACE;
3013 return bc_error("comment end could not be found");
3021 G.err_line = l->line;
3023 return BC_STATUS_SUCCESS;
3026 static BcStatus bc_lex_token(BcLex *l)
3028 BcStatus s = BC_STATUS_SUCCESS;
3029 char c = l->buf[l->i++], c2;
3031 // This is the workhorse of the lexer.
3038 l->t.t = !c ? BC_LEX_EOF : BC_LEX_NLINE;
3048 bc_lex_whitespace(l);
3054 bc_lex_assign(l, BC_LEX_OP_REL_NE, BC_LEX_OP_BOOL_NOT);
3056 if (l->t.t == BC_LEX_OP_BOOL_NOT) {
3057 s = bc_POSIX_does_not_allow_bool_ops_this_is_bad("!");
3066 s = bc_lex_string(l);
3072 s = bc_POSIX_does_not_allow("'#' script comments");
3075 bc_lex_lineComment(l);
3082 bc_lex_assign(l, BC_LEX_OP_ASSIGN_MODULUS, BC_LEX_OP_MODULUS);
3091 s = bc_POSIX_does_not_allow_bool_ops_this_is_bad("&&");
3095 l->t.t = BC_LEX_OP_BOOL_AND;
3098 l->t.t = BC_LEX_INVALID;
3099 s = bc_error_bad_character('&');
3108 l->t.t = (BcLexType)(c - '(' + BC_LEX_LPAREN);
3114 bc_lex_assign(l, BC_LEX_OP_ASSIGN_MULTIPLY, BC_LEX_OP_MULTIPLY);
3123 l->t.t = BC_LEX_OP_INC;
3126 bc_lex_assign(l, BC_LEX_OP_ASSIGN_PLUS, BC_LEX_OP_PLUS);
3132 l->t.t = BC_LEX_COMMA;
3141 l->t.t = BC_LEX_OP_DEC;
3144 bc_lex_assign(l, BC_LEX_OP_ASSIGN_MINUS, BC_LEX_OP_MINUS);
3150 if (isdigit(l->buf[l->i]))
3151 s = bc_lex_number(l, c);
3153 l->t.t = BC_LEX_KEY_LAST;
3154 s = bc_POSIX_does_not_allow("a period ('.') as a shortcut for the last result");
3163 s = bc_lex_comment(l);
3165 bc_lex_assign(l, BC_LEX_OP_ASSIGN_DIVIDE, BC_LEX_OP_DIVIDE);
3186 s = bc_lex_number(l, c);
3192 l->t.t = BC_LEX_SCOLON;
3198 bc_lex_assign(l, BC_LEX_OP_REL_LE, BC_LEX_OP_REL_LT);
3204 bc_lex_assign(l, BC_LEX_OP_REL_EQ, BC_LEX_OP_ASSIGN);
3210 bc_lex_assign(l, BC_LEX_OP_REL_GE, BC_LEX_OP_REL_GT);
3217 l->t.t = (BcLexType)(c - '[' + BC_LEX_LBRACKET);
3223 if (l->buf[l->i] == '\n') {
3224 l->t.t = BC_LEX_WHITESPACE;
3228 s = bc_error_bad_character(c);
3234 bc_lex_assign(l, BC_LEX_OP_ASSIGN_POWER, BC_LEX_OP_POWER);
3265 s = bc_lex_identifier(l);
3272 l->t.t = (BcLexType)(c - '{' + BC_LEX_LBRACE);
3281 s = bc_POSIX_does_not_allow_bool_ops_this_is_bad("||");
3285 l->t.t = BC_LEX_OP_BOOL_OR;
3288 l->t.t = BC_LEX_INVALID;
3289 s = bc_error_bad_character(c);
3297 l->t.t = BC_LEX_INVALID;
3298 s = bc_error_bad_character(c);
3308 static BcStatus dc_lex_register(BcLex *l)
3310 BcStatus s = BC_STATUS_SUCCESS;
3312 if (isspace(l->buf[l->i - 1])) {
3313 bc_lex_whitespace(l);
3316 s = bc_error("extended register");
3321 bc_vec_pop_all(&l->t.v);
3322 bc_vec_pushByte(&l->t.v, l->buf[l->i - 1]);
3323 bc_vec_pushZeroByte(&l->t.v);
3324 l->t.t = BC_LEX_NAME;
3330 static BcStatus dc_lex_string(BcLex *l)
3332 size_t depth = 1, nls = 0, i = l->i;
3335 l->t.t = BC_LEX_STR;
3336 bc_vec_pop_all(&l->t.v);
3338 for (c = l->buf[i]; c != 0 && depth; c = l->buf[++i]) {
3340 depth += (c == '[' && (i == l->i || l->buf[i - 1] != '\\'));
3341 depth -= (c == ']' && (i == l->i || l->buf[i - 1] != '\\'));
3344 if (depth) bc_vec_push(&l->t.v, &c);
3349 return bc_error("string end could not be found");
3352 bc_vec_pushZeroByte(&l->t.v);
3353 if (i - l->i > BC_MAX_STRING)
3354 return bc_error("string too long: must be [1, BC_STRING_MAX]");
3358 G.err_line = l->line;
3360 return BC_STATUS_SUCCESS;
3363 static BcStatus dc_lex_token(BcLex *l)
3365 BcStatus s = BC_STATUS_SUCCESS;
3366 char c = l->buf[l->i++], c2;
3369 for (i = 0; i < ARRAY_SIZE(dc_lex_regs); ++i) {
3370 if (l->t.last == dc_lex_regs[i])
3371 return dc_lex_register(l);
3374 if (c >= '%' && c <= '~' &&
3375 (l->t.t = dc_lex_tokens[(c - '%')]) != BC_LEX_INVALID)
3380 // This is the workhorse of the lexer.
3385 l->t.t = BC_LEX_EOF;
3396 l->newline = (c == '\n');
3397 bc_lex_whitespace(l);
3406 l->t.t = BC_LEX_OP_REL_NE;
3408 l->t.t = BC_LEX_OP_REL_LE;
3410 l->t.t = BC_LEX_OP_REL_GE;
3412 return bc_error_bad_character(c);
3420 bc_lex_lineComment(l);
3426 if (isdigit(l->buf[l->i]))
3427 s = bc_lex_number(l, c);
3429 s = bc_error_bad_character(c);
3450 s = bc_lex_number(l, c);
3456 s = dc_lex_string(l);
3462 l->t.t = BC_LEX_INVALID;
3463 s = bc_error_bad_character(c);
3472 static void bc_parse_addFunc(BcParse *p, char *name, size_t *idx)
3474 bc_program_addFunc(name, idx);
3475 p->func = bc_vec_item(&G.prog.fns, p->fidx);
3478 static void bc_parse_pushName(BcParse *p, char *name)
3480 size_t i = 0, len = strlen(name);
3482 for (; i < len; ++i) bc_parse_push(p, name[i]);
3483 bc_parse_push(p, BC_PARSE_STREND);
3488 static void bc_parse_pushIndex(BcParse *p, size_t idx)
3490 unsigned char amt, i, nums[sizeof(size_t)];
3492 for (amt = 0; idx; ++amt) {
3493 nums[amt] = (char) idx;
3494 idx = (idx & ((unsigned long) ~(UCHAR_MAX))) >> sizeof(char) * CHAR_BIT;
3497 bc_parse_push(p, amt);
3498 for (i = 0; i < amt; ++i) bc_parse_push(p, nums[i]);
3501 static void bc_parse_number(BcParse *p, BcInst *prev, size_t *nexs)
3503 char *num = xstrdup(p->l.t.v.v);
3504 size_t idx = G.prog.consts.len;
3506 bc_vec_push(&G.prog.consts, &num);
3508 bc_parse_push(p, BC_INST_NUM);
3509 bc_parse_pushIndex(p, idx);
3512 (*prev) = BC_INST_NUM;
3515 static BcStatus bc_parse_text(BcParse *p, const char *text)
3519 p->func = bc_vec_item(&G.prog.fns, p->fidx);
3521 if (!text[0] && !BC_PARSE_CAN_EXEC(p)) {
3522 p->l.t.t = BC_LEX_INVALID;
3525 if (!BC_PARSE_CAN_EXEC(p))
3526 return bc_error("file is not executable");
3529 return bc_lex_text(&p->l, text);
3532 // Called when bc/dc_parse_parse() detects a failure,
3533 // resets parsing structures.
3534 static void bc_parse_reset(BcParse *p)
3536 if (p->fidx != BC_PROG_MAIN) {
3537 p->func->nparams = 0;
3538 bc_vec_pop_all(&p->func->code);
3539 bc_vec_pop_all(&p->func->autos);
3540 bc_vec_pop_all(&p->func->labels);
3542 bc_parse_updateFunc(p, BC_PROG_MAIN);
3546 p->l.t.t = BC_LEX_EOF;
3547 p->auto_part = (p->nbraces = 0);
3549 bc_vec_npop(&p->flags, p->flags.len - 1);
3550 bc_vec_pop_all(&p->exits);
3551 bc_vec_pop_all(&p->conds);
3552 bc_vec_pop_all(&p->ops);
3557 static void bc_parse_free(BcParse *p)
3559 bc_vec_free(&p->flags);
3560 bc_vec_free(&p->exits);
3561 bc_vec_free(&p->conds);
3562 bc_vec_free(&p->ops);
3566 static void bc_parse_create(BcParse *p, size_t func,
3567 BcParseParse parse, BcLexNext next)
3569 memset(p, 0, sizeof(BcParse));
3571 bc_lex_init(&p->l, next);
3572 bc_vec_init(&p->flags, sizeof(uint8_t), NULL);
3573 bc_vec_init(&p->exits, sizeof(BcInstPtr), NULL);
3574 bc_vec_init(&p->conds, sizeof(size_t), NULL);
3575 bc_vec_pushZeroByte(&p->flags);
3576 bc_vec_init(&p->ops, sizeof(BcLexType), NULL);
3579 // p->auto_part = p->nbraces = 0; - already is
3580 bc_parse_updateFunc(p, func);
3585 #define BC_PARSE_TOP_OP(p) (*((BcLexType *) bc_vec_top(&(p)->ops)))
3586 #define BC_PARSE_LEAF(p, rparen) \
3587 (((p) >= BC_INST_NUM && (p) <= BC_INST_SQRT) || (rparen) || \
3588 (p) == BC_INST_INC_POST || (p) == BC_INST_DEC_POST)
3590 // We can calculate the conversion between tokens and exprs by subtracting the
3591 // position of the first operator in the lex enum and adding the position of the
3592 // first in the expr enum. Note: This only works for binary operators.
3593 #define BC_PARSE_TOKEN_INST(t) ((char) ((t) -BC_LEX_NEG + BC_INST_NEG))
3595 static BcStatus bc_parse_else(BcParse *p);
3596 static BcStatus bc_parse_stmt(BcParse *p);
3597 static BcStatus bc_parse_expr(BcParse *p, uint8_t flags, BcParseNext next);
3598 static BcStatus bc_parse_expr_empty_ok(BcParse *p, uint8_t flags, BcParseNext next);
3600 static BcStatus bc_parse_operator(BcParse *p, BcLexType type, size_t start,
3601 size_t *nexprs, bool next)
3603 BcStatus s = BC_STATUS_SUCCESS;
3605 char l, r = bc_parse_op_PREC(type - BC_LEX_OP_INC);
3606 bool left = bc_parse_op_LEFT(type - BC_LEX_OP_INC);
3608 while (p->ops.len > start) {
3610 t = BC_PARSE_TOP_OP(p);
3611 if (t == BC_LEX_LPAREN) break;
3613 l = bc_parse_op_PREC(t - BC_LEX_OP_INC);
3614 if (l >= r && (l != r || !left)) break;
3616 bc_parse_push(p, BC_PARSE_TOKEN_INST(t));
3617 bc_vec_pop(&p->ops);
3618 *nexprs -= t != BC_LEX_OP_BOOL_NOT && t != BC_LEX_NEG;
3621 bc_vec_push(&p->ops, &type);
3622 if (next) s = bc_lex_next(&p->l);
3627 static BcStatus bc_parse_rightParen(BcParse *p, size_t ops_bgn, size_t *nexs)
3631 if (p->ops.len <= ops_bgn)
3632 return bc_error_bad_expression();
3633 top = BC_PARSE_TOP_OP(p);
3635 while (top != BC_LEX_LPAREN) {
3637 bc_parse_push(p, BC_PARSE_TOKEN_INST(top));
3639 bc_vec_pop(&p->ops);
3640 *nexs -= top != BC_LEX_OP_BOOL_NOT && top != BC_LEX_NEG;
3642 if (p->ops.len <= ops_bgn)
3643 return bc_error_bad_expression();
3644 top = BC_PARSE_TOP_OP(p);
3647 bc_vec_pop(&p->ops);
3649 return bc_lex_next(&p->l);
3652 static BcStatus bc_parse_params(BcParse *p, uint8_t flags)
3658 s = bc_lex_next(&p->l);
3661 for (nparams = 0; p->l.t.t != BC_LEX_RPAREN; ++nparams) {
3663 flags = (flags & ~(BC_PARSE_PRINT | BC_PARSE_REL)) | BC_PARSE_ARRAY;
3664 s = bc_parse_expr(p, flags, bc_parse_next_param);
3667 comma = p->l.t.t == BC_LEX_COMMA;
3669 s = bc_lex_next(&p->l);
3674 if (comma) return bc_error_bad_token();
3675 bc_parse_push(p, BC_INST_CALL);
3676 bc_parse_pushIndex(p, nparams);
3678 return BC_STATUS_SUCCESS;
3681 static BcStatus bc_parse_call(BcParse *p, char *name, uint8_t flags)
3684 BcId entry, *entry_ptr;
3689 s = bc_parse_params(p, flags);
3692 if (p->l.t.t != BC_LEX_RPAREN) {
3693 s = bc_error_bad_token();
3697 idx = bc_map_index(&G.prog.fn_map, &entry);
3699 if (idx == BC_VEC_INVALID_IDX) {
3700 name = xstrdup(entry.name);
3701 bc_parse_addFunc(p, name, &idx);
3702 idx = bc_map_index(&G.prog.fn_map, &entry);
3708 entry_ptr = bc_vec_item(&G.prog.fn_map, idx);
3709 bc_parse_pushIndex(p, entry_ptr->idx);
3711 return bc_lex_next(&p->l);
3718 static BcStatus bc_parse_name(BcParse *p, BcInst *type, uint8_t flags)
3723 name = xstrdup(p->l.t.v.v);
3724 s = bc_lex_next(&p->l);
3727 if (p->l.t.t == BC_LEX_LBRACKET) {
3729 s = bc_lex_next(&p->l);
3732 if (p->l.t.t == BC_LEX_RBRACKET) {
3734 if (!(flags & BC_PARSE_ARRAY)) {
3735 s = bc_error_bad_expression();
3739 *type = BC_INST_ARRAY;
3743 *type = BC_INST_ARRAY_ELEM;
3745 flags &= ~(BC_PARSE_PRINT | BC_PARSE_REL);
3746 s = bc_parse_expr(p, flags, bc_parse_next_elem);
3750 s = bc_lex_next(&p->l);
3752 bc_parse_push(p, *type);
3753 bc_parse_pushName(p, name);
3755 else if (p->l.t.t == BC_LEX_LPAREN) {
3757 if (flags & BC_PARSE_NOCALL) {
3758 s = bc_error_bad_token();
3762 *type = BC_INST_CALL;
3763 s = bc_parse_call(p, name, flags);
3766 *type = BC_INST_VAR;
3767 bc_parse_push(p, BC_INST_VAR);
3768 bc_parse_pushName(p, name);
3778 static BcStatus bc_parse_read(BcParse *p)
3782 s = bc_lex_next(&p->l);
3784 if (p->l.t.t != BC_LEX_LPAREN) return bc_error_bad_token();
3786 s = bc_lex_next(&p->l);
3788 if (p->l.t.t != BC_LEX_RPAREN) return bc_error_bad_token();
3790 bc_parse_push(p, BC_INST_READ);
3792 return bc_lex_next(&p->l);
3795 static BcStatus bc_parse_builtin(BcParse *p, BcLexType type, uint8_t flags,
3800 s = bc_lex_next(&p->l);
3802 if (p->l.t.t != BC_LEX_LPAREN) return bc_error_bad_token();
3804 flags = (flags & ~(BC_PARSE_PRINT | BC_PARSE_REL)) | BC_PARSE_ARRAY;
3806 s = bc_lex_next(&p->l);
3809 s = bc_parse_expr(p, flags, bc_parse_next_rel);
3812 if (p->l.t.t != BC_LEX_RPAREN) return bc_error_bad_token();
3814 *prev = (type == BC_LEX_KEY_LENGTH) ? BC_INST_LENGTH : BC_INST_SQRT;
3815 bc_parse_push(p, *prev);
3817 return bc_lex_next(&p->l);
3820 static BcStatus bc_parse_scale(BcParse *p, BcInst *type, uint8_t flags)
3824 s = bc_lex_next(&p->l);
3827 if (p->l.t.t != BC_LEX_LPAREN) {
3828 *type = BC_INST_SCALE;
3829 bc_parse_push(p, BC_INST_SCALE);
3830 return BC_STATUS_SUCCESS;
3833 *type = BC_INST_SCALE_FUNC;
3834 flags &= ~(BC_PARSE_PRINT | BC_PARSE_REL);
3836 s = bc_lex_next(&p->l);
3839 s = bc_parse_expr(p, flags, bc_parse_next_rel);
3841 if (p->l.t.t != BC_LEX_RPAREN) return bc_error_bad_token();
3842 bc_parse_push(p, BC_INST_SCALE_FUNC);
3844 return bc_lex_next(&p->l);
3847 static BcStatus bc_parse_incdec(BcParse *p, BcInst *prev, bool *paren_expr,
3848 size_t *nexprs, uint8_t flags)
3853 BcInst etype = *prev;
3855 if (etype == BC_INST_VAR || etype == BC_INST_ARRAY_ELEM ||
3856 etype == BC_INST_SCALE || etype == BC_INST_LAST ||
3857 etype == BC_INST_IBASE || etype == BC_INST_OBASE)
3859 *prev = inst = BC_INST_INC_POST + (p->l.t.t != BC_LEX_OP_INC);
3860 bc_parse_push(p, inst);
3861 s = bc_lex_next(&p->l);
3865 *prev = inst = BC_INST_INC_PRE + (p->l.t.t != BC_LEX_OP_INC);
3868 s = bc_lex_next(&p->l);
3872 // Because we parse the next part of the expression
3873 // right here, we need to increment this.
3874 *nexprs = *nexprs + 1;
3880 s = bc_parse_name(p, prev, flags | BC_PARSE_NOCALL);
3884 case BC_LEX_KEY_IBASE:
3885 case BC_LEX_KEY_LAST:
3886 case BC_LEX_KEY_OBASE:
3888 bc_parse_push(p, type - BC_LEX_KEY_IBASE + BC_INST_IBASE);
3889 s = bc_lex_next(&p->l);
3893 case BC_LEX_KEY_SCALE:
3895 s = bc_lex_next(&p->l);
3897 if (p->l.t.t == BC_LEX_LPAREN)
3898 s = bc_error_bad_token();
3900 bc_parse_push(p, BC_INST_SCALE);
3906 s = bc_error_bad_token();
3911 if (!s) bc_parse_push(p, inst);
3917 static BcStatus bc_parse_minus(BcParse *p, BcInst *prev, size_t ops_bgn,
3918 bool rparen, size_t *nexprs)
3922 BcInst etype = *prev;
3924 s = bc_lex_next(&p->l);
3927 type = rparen || etype == BC_INST_INC_POST || etype == BC_INST_DEC_POST ||
3928 (etype >= BC_INST_NUM && etype <= BC_INST_SQRT) ?
3931 *prev = BC_PARSE_TOKEN_INST(type);
3933 // We can just push onto the op stack because this is the largest
3934 // precedence operator that gets pushed. Inc/dec does not.
3935 if (type != BC_LEX_OP_MINUS)
3936 bc_vec_push(&p->ops, &type);
3938 s = bc_parse_operator(p, type, ops_bgn, nexprs, false);
3943 static BcStatus bc_parse_string(BcParse *p, char inst)
3945 char *str = xstrdup(p->l.t.v.v);
3947 bc_parse_push(p, BC_INST_STR);
3948 bc_parse_pushIndex(p, G.prog.strs.len);
3949 bc_vec_push(&G.prog.strs, &str);
3950 bc_parse_push(p, inst);
3952 return bc_lex_next(&p->l);
3955 static BcStatus bc_parse_print(BcParse *p)
3961 s = bc_lex_next(&p->l);
3966 if (type == BC_LEX_SCOLON || type == BC_LEX_NLINE)
3967 return bc_error("bad print statement");
3969 while (!s && type != BC_LEX_SCOLON && type != BC_LEX_NLINE) {
3971 if (type == BC_LEX_STR)
3972 s = bc_parse_string(p, BC_INST_PRINT_POP);
3974 s = bc_parse_expr(p, 0, bc_parse_next_print);
3976 bc_parse_push(p, BC_INST_PRINT_POP);
3981 comma = p->l.t.t == BC_LEX_COMMA;
3982 if (comma) s = bc_lex_next(&p->l);
3987 if (comma) return bc_error_bad_token();
3989 return bc_lex_next(&p->l);
3992 static BcStatus bc_parse_return(BcParse *p)
3998 if (!BC_PARSE_FUNC(p)) return bc_error_bad_token();
4000 s = bc_lex_next(&p->l);
4004 paren = t == BC_LEX_LPAREN;
4006 if (t == BC_LEX_NLINE || t == BC_LEX_SCOLON)
4007 bc_parse_push(p, BC_INST_RET0);
4010 s = bc_parse_expr_empty_ok(p, 0, bc_parse_next_expr);
4011 if (s == BC_STATUS_PARSE_EMPTY_EXP) {
4012 bc_parse_push(p, BC_INST_RET0);
4013 s = bc_lex_next(&p->l);
4017 if (!paren || p->l.t.last != BC_LEX_RPAREN) {
4018 s = bc_posix_error("POSIX requires parentheses around return expressions");
4022 bc_parse_push(p, BC_INST_RET);
4028 static BcStatus bc_parse_endBody(BcParse *p, bool brace)
4030 BcStatus s = BC_STATUS_SUCCESS;
4032 if (p->flags.len <= 1 || (brace && p->nbraces == 0))
4033 return bc_error_bad_token();
4037 if (p->l.t.t == BC_LEX_RBRACE) {
4038 if (!p->nbraces) return bc_error_bad_token();
4040 s = bc_lex_next(&p->l);
4044 return bc_error_bad_token();
4047 if (BC_PARSE_IF(p)) {
4051 while (p->l.t.t == BC_LEX_NLINE) {
4052 s = bc_lex_next(&p->l);
4056 bc_vec_pop(&p->flags);
4058 flag_ptr = BC_PARSE_TOP_FLAG_PTR(p);
4059 *flag_ptr = (*flag_ptr | BC_PARSE_FLAG_IF_END);
4061 if (p->l.t.t == BC_LEX_KEY_ELSE) s = bc_parse_else(p);
4063 else if (BC_PARSE_ELSE(p)) {
4068 bc_vec_pop(&p->flags);
4070 ip = bc_vec_top(&p->exits);
4071 label = bc_vec_item(&p->func->labels, ip->idx);
4072 *label = p->func->code.len;
4074 bc_vec_pop(&p->exits);
4076 else if (BC_PARSE_FUNC_INNER(p)) {
4077 bc_parse_push(p, BC_INST_RET0);
4078 bc_parse_updateFunc(p, BC_PROG_MAIN);
4079 bc_vec_pop(&p->flags);
4083 BcInstPtr *ip = bc_vec_top(&p->exits);
4084 size_t *label = bc_vec_top(&p->conds);
4086 bc_parse_push(p, BC_INST_JUMP);
4087 bc_parse_pushIndex(p, *label);
4089 label = bc_vec_item(&p->func->labels, ip->idx);
4090 *label = p->func->code.len;
4092 bc_vec_pop(&p->flags);
4093 bc_vec_pop(&p->exits);
4094 bc_vec_pop(&p->conds);
4100 static void bc_parse_startBody(BcParse *p, uint8_t flags)
4102 uint8_t *flag_ptr = BC_PARSE_TOP_FLAG_PTR(p);
4103 flags |= (*flag_ptr & (BC_PARSE_FLAG_FUNC | BC_PARSE_FLAG_LOOP));
4104 flags |= BC_PARSE_FLAG_BODY;
4105 bc_vec_push(&p->flags, &flags);
4108 static void bc_parse_noElse(BcParse *p)
4112 uint8_t *flag_ptr = BC_PARSE_TOP_FLAG_PTR(p);
4114 *flag_ptr = (*flag_ptr & ~(BC_PARSE_FLAG_IF_END));
4116 ip = bc_vec_top(&p->exits);
4117 label = bc_vec_item(&p->func->labels, ip->idx);
4118 *label = p->func->code.len;
4120 bc_vec_pop(&p->exits);
4123 static BcStatus bc_parse_if(BcParse *p)
4128 s = bc_lex_next(&p->l);
4130 if (p->l.t.t != BC_LEX_LPAREN) return bc_error_bad_token();
4132 s = bc_lex_next(&p->l);
4134 s = bc_parse_expr(p, BC_PARSE_REL, bc_parse_next_rel);
4136 if (p->l.t.t != BC_LEX_RPAREN) return bc_error_bad_token();
4138 s = bc_lex_next(&p->l);
4140 bc_parse_push(p, BC_INST_JUMP_ZERO);
4142 ip.idx = p->func->labels.len;
4143 ip.func = ip.len = 0;
4145 bc_parse_pushIndex(p, ip.idx);
4146 bc_vec_push(&p->exits, &ip);
4147 bc_vec_push(&p->func->labels, &ip.idx);
4148 bc_parse_startBody(p, BC_PARSE_FLAG_IF);
4150 return BC_STATUS_SUCCESS;
4153 static BcStatus bc_parse_else(BcParse *p)
4157 if (!BC_PARSE_IF_END(p)) return bc_error_bad_token();
4159 ip.idx = p->func->labels.len;
4160 ip.func = ip.len = 0;
4162 bc_parse_push(p, BC_INST_JUMP);
4163 bc_parse_pushIndex(p, ip.idx);
4167 bc_vec_push(&p->exits, &ip);
4168 bc_vec_push(&p->func->labels, &ip.idx);
4169 bc_parse_startBody(p, BC_PARSE_FLAG_ELSE);
4171 return bc_lex_next(&p->l);
4174 static BcStatus bc_parse_while(BcParse *p)
4179 s = bc_lex_next(&p->l);
4181 if (p->l.t.t != BC_LEX_LPAREN) return bc_error_bad_token();
4182 s = bc_lex_next(&p->l);
4185 ip.idx = p->func->labels.len;
4187 bc_vec_push(&p->func->labels, &p->func->code.len);
4188 bc_vec_push(&p->conds, &ip.idx);
4190 ip.idx = p->func->labels.len;
4194 bc_vec_push(&p->exits, &ip);
4195 bc_vec_push(&p->func->labels, &ip.idx);
4197 s = bc_parse_expr(p, BC_PARSE_REL, bc_parse_next_rel);
4199 if (p->l.t.t != BC_LEX_RPAREN) return bc_error_bad_token();
4200 s = bc_lex_next(&p->l);
4203 bc_parse_push(p, BC_INST_JUMP_ZERO);
4204 bc_parse_pushIndex(p, ip.idx);
4205 bc_parse_startBody(p, BC_PARSE_FLAG_LOOP | BC_PARSE_FLAG_LOOP_INNER);
4207 return BC_STATUS_SUCCESS;
4210 static BcStatus bc_parse_for(BcParse *p)
4214 size_t cond_idx, exit_idx, body_idx, update_idx;
4216 s = bc_lex_next(&p->l);
4218 if (p->l.t.t != BC_LEX_LPAREN) return bc_error_bad_token();
4219 s = bc_lex_next(&p->l);
4222 if (p->l.t.t != BC_LEX_SCOLON)
4223 s = bc_parse_expr(p, 0, bc_parse_next_for);
4225 s = bc_POSIX_does_not_allow_empty_X_expression_in_for("init");
4228 if (p->l.t.t != BC_LEX_SCOLON) return bc_error_bad_token();
4229 s = bc_lex_next(&p->l);
4232 cond_idx = p->func->labels.len;
4233 update_idx = cond_idx + 1;
4234 body_idx = update_idx + 1;
4235 exit_idx = body_idx + 1;
4237 bc_vec_push(&p->func->labels, &p->func->code.len);
4239 if (p->l.t.t != BC_LEX_SCOLON)
4240 s = bc_parse_expr(p, BC_PARSE_REL, bc_parse_next_for);
4242 s = bc_POSIX_does_not_allow_empty_X_expression_in_for("condition");
4245 if (p->l.t.t != BC_LEX_SCOLON) return bc_error_bad_token();
4247 s = bc_lex_next(&p->l);
4250 bc_parse_push(p, BC_INST_JUMP_ZERO);
4251 bc_parse_pushIndex(p, exit_idx);
4252 bc_parse_push(p, BC_INST_JUMP);
4253 bc_parse_pushIndex(p, body_idx);
4255 ip.idx = p->func->labels.len;
4257 bc_vec_push(&p->conds, &update_idx);
4258 bc_vec_push(&p->func->labels, &p->func->code.len);
4260 if (p->l.t.t != BC_LEX_RPAREN)
4261 s = bc_parse_expr(p, 0, bc_parse_next_rel);
4263 s = bc_POSIX_does_not_allow_empty_X_expression_in_for("update");
4267 if (p->l.t.t != BC_LEX_RPAREN) return bc_error_bad_token();
4268 bc_parse_push(p, BC_INST_JUMP);
4269 bc_parse_pushIndex(p, cond_idx);
4270 bc_vec_push(&p->func->labels, &p->func->code.len);
4276 bc_vec_push(&p->exits, &ip);
4277 bc_vec_push(&p->func->labels, &ip.idx);
4279 bc_parse_startBody(p, BC_PARSE_FLAG_LOOP | BC_PARSE_FLAG_LOOP_INNER);
4281 return BC_STATUS_SUCCESS;
4284 static BcStatus bc_parse_loopExit(BcParse *p, BcLexType type)
4290 if (!BC_PARSE_LOOP(p)) return bc_error_bad_token();
4292 if (type == BC_LEX_KEY_BREAK) {
4294 if (p->exits.len == 0) return bc_error_bad_token();
4296 i = p->exits.len - 1;
4297 ip = bc_vec_item(&p->exits, i);
4299 while (!ip->func && i < p->exits.len) ip = bc_vec_item(&p->exits, i--);
4300 if (i >= p->exits.len && !ip->func) return bc_error_bad_token();
4305 i = *((size_t *) bc_vec_top(&p->conds));
4307 bc_parse_push(p, BC_INST_JUMP);
4308 bc_parse_pushIndex(p, i);
4310 s = bc_lex_next(&p->l);
4313 if (p->l.t.t != BC_LEX_SCOLON && p->l.t.t != BC_LEX_NLINE)
4314 return bc_error_bad_token();
4316 return bc_lex_next(&p->l);
4319 static BcStatus bc_parse_func(BcParse *p)
4322 bool var, comma = false;
4326 s = bc_lex_next(&p->l);
4328 if (p->l.t.t != BC_LEX_NAME)
4329 return bc_error("bad function definition");
4331 name = xstrdup(p->l.t.v.v);
4332 bc_parse_addFunc(p, name, &p->fidx);
4334 s = bc_lex_next(&p->l);
4336 if (p->l.t.t != BC_LEX_LPAREN)
4337 return bc_error("bad function definition");
4338 s = bc_lex_next(&p->l);
4341 while (p->l.t.t != BC_LEX_RPAREN) {
4343 if (p->l.t.t != BC_LEX_NAME)
4344 return bc_error("bad function definition");
4348 name = xstrdup(p->l.t.v.v);
4349 s = bc_lex_next(&p->l);
4352 var = p->l.t.t != BC_LEX_LBRACKET;
4356 s = bc_lex_next(&p->l);
4359 if (p->l.t.t != BC_LEX_RBRACKET) {
4360 s = bc_error("bad function definition");
4364 s = bc_lex_next(&p->l);
4368 comma = p->l.t.t == BC_LEX_COMMA;
4370 s = bc_lex_next(&p->l);
4374 s = bc_func_insert(p->func, name, var);
4378 if (comma) return bc_error("bad function definition");
4380 flags = BC_PARSE_FLAG_FUNC | BC_PARSE_FLAG_FUNC_INNER | BC_PARSE_FLAG_BODY;
4381 bc_parse_startBody(p, flags);
4383 s = bc_lex_next(&p->l);
4386 if (p->l.t.t != BC_LEX_LBRACE)
4387 s = bc_posix_error("POSIX requires the left brace be on the same line as the function header");
4396 static BcStatus bc_parse_auto(BcParse *p)
4399 bool comma, var, one;
4402 if (!p->auto_part) return bc_error_bad_token();
4403 s = bc_lex_next(&p->l);
4406 p->auto_part = comma = false;
4407 one = p->l.t.t == BC_LEX_NAME;
4409 while (p->l.t.t == BC_LEX_NAME) {
4411 name = xstrdup(p->l.t.v.v);
4412 s = bc_lex_next(&p->l);
4415 var = p->l.t.t != BC_LEX_LBRACKET;
4418 s = bc_lex_next(&p->l);
4421 if (p->l.t.t != BC_LEX_RBRACKET) {
4422 s = bc_error("bad function definition");
4426 s = bc_lex_next(&p->l);
4430 comma = p->l.t.t == BC_LEX_COMMA;
4432 s = bc_lex_next(&p->l);
4436 s = bc_func_insert(p->func, name, var);
4440 if (comma) return bc_error("bad function definition");
4441 if (!one) return bc_error("no auto variable found");
4443 if (p->l.t.t != BC_LEX_NLINE && p->l.t.t != BC_LEX_SCOLON)
4444 return bc_error_bad_token();
4446 return bc_lex_next(&p->l);
4453 static BcStatus bc_parse_body(BcParse *p, bool brace)
4455 BcStatus s = BC_STATUS_SUCCESS;
4456 uint8_t *flag_ptr = bc_vec_top(&p->flags);
4458 *flag_ptr &= ~(BC_PARSE_FLAG_BODY);
4460 if (*flag_ptr & BC_PARSE_FLAG_FUNC_INNER) {
4462 if (!brace) return bc_error_bad_token();
4463 p->auto_part = p->l.t.t != BC_LEX_KEY_AUTO;
4465 if (!p->auto_part) {
4466 s = bc_parse_auto(p);
4470 if (p->l.t.t == BC_LEX_NLINE) s = bc_lex_next(&p->l);
4473 s = bc_parse_stmt(p);
4474 if (!s && !brace) s = bc_parse_endBody(p, false);
4480 static BcStatus bc_parse_stmt(BcParse *p)
4482 BcStatus s = BC_STATUS_SUCCESS;
4488 return bc_lex_next(&p->l);
4491 case BC_LEX_KEY_ELSE:
4493 p->auto_part = false;
4499 if (!BC_PARSE_BODY(p)) return bc_error_bad_token();
4502 s = bc_lex_next(&p->l);
4505 return bc_parse_body(p, true);
4508 case BC_LEX_KEY_AUTO:
4510 return bc_parse_auto(p);
4515 p->auto_part = false;
4517 if (BC_PARSE_IF_END(p)) {
4519 return BC_STATUS_SUCCESS;
4521 else if (BC_PARSE_BODY(p))
4522 return bc_parse_body(p, false);
4532 case BC_LEX_OP_MINUS:
4533 case BC_LEX_OP_BOOL_NOT:
4537 case BC_LEX_KEY_IBASE:
4538 case BC_LEX_KEY_LAST:
4539 case BC_LEX_KEY_LENGTH:
4540 case BC_LEX_KEY_OBASE:
4541 case BC_LEX_KEY_READ:
4542 case BC_LEX_KEY_SCALE:
4543 case BC_LEX_KEY_SQRT:
4545 s = bc_parse_expr(p, BC_PARSE_PRINT, bc_parse_next_expr);
4549 case BC_LEX_KEY_ELSE:
4551 s = bc_parse_else(p);
4557 while (!s && p->l.t.t == BC_LEX_SCOLON) s = bc_lex_next(&p->l);
4563 s = bc_parse_endBody(p, true);
4569 s = bc_parse_string(p, BC_INST_PRINT_STR);
4573 case BC_LEX_KEY_BREAK:
4574 case BC_LEX_KEY_CONTINUE:
4576 s = bc_parse_loopExit(p, p->l.t.t);
4580 case BC_LEX_KEY_FOR:
4582 s = bc_parse_for(p);
4586 case BC_LEX_KEY_HALT:
4588 bc_parse_push(p, BC_INST_HALT);
4589 s = bc_lex_next(&p->l);
4599 case BC_LEX_KEY_LIMITS:
4601 // "limits" is a compile-time command,
4602 // the output is produced at _parse time_.
4603 s = bc_lex_next(&p->l);
4605 printf("BC_BASE_MAX = %u\n", BC_MAX_OBASE);
4606 printf("BC_DIM_MAX = %u\n", BC_MAX_DIM);
4607 printf("BC_SCALE_MAX = %u\n", BC_MAX_SCALE);
4608 printf("BC_STRING_MAX = %u\n", BC_MAX_STRING);
4609 printf("BC_NAME_MAX = %u\n", BC_MAX_NAME);
4610 printf("BC_NUM_MAX = %u\n", BC_MAX_NUM);
4611 printf("MAX Exponent = %lu\n", BC_MAX_EXP);
4612 printf("Number of vars = %lu\n", BC_MAX_VARS);
4616 case BC_LEX_KEY_PRINT:
4618 s = bc_parse_print(p);
4622 case BC_LEX_KEY_QUIT:
4624 // "quit" is a compile-time command. For example,
4625 // "if (0 == 1) quit" terminates when parsing the statement,
4626 // not when it is executed
4627 quit_or_return_for_exit();
4630 case BC_LEX_KEY_RETURN:
4632 s = bc_parse_return(p);
4636 case BC_LEX_KEY_WHILE:
4638 s = bc_parse_while(p);
4644 s = bc_error_bad_token();
4652 static BcStatus bc_parse_parse(BcParse *p)
4656 if (p->l.t.t == BC_LEX_EOF)
4657 s = p->flags.len > 0 ? bc_error("block end could not be found") : bc_error("end of file");
4658 else if (p->l.t.t == BC_LEX_KEY_DEFINE) {
4659 if (!BC_PARSE_CAN_EXEC(p)) return bc_error_bad_token();
4660 s = bc_parse_func(p);
4663 s = bc_parse_stmt(p);
4665 if (s || G_interrupt) {
4667 s = BC_STATUS_FAILURE;
4673 static BcStatus bc_parse_expr_empty_ok(BcParse *p, uint8_t flags, BcParseNext next)
4675 BcStatus s = BC_STATUS_SUCCESS;
4676 BcInst prev = BC_INST_PRINT;
4677 BcLexType top, t = p->l.t.t;
4678 size_t nexprs = 0, ops_bgn = p->ops.len;
4679 uint32_t i, nparens, nrelops;
4680 bool paren_first, paren_expr, rprn, done, get_token, assign, bin_last;
4682 paren_first = p->l.t.t == BC_LEX_LPAREN;
4683 nparens = nrelops = 0;
4684 paren_expr = rprn = done = get_token = assign = false;
4687 for (; !G_interrupt && !s && !done && bc_parse_exprs(t); t = p->l.t.t) {
4693 s = bc_parse_incdec(p, &prev, &paren_expr, &nexprs, flags);
4694 rprn = get_token = bin_last = false;
4698 case BC_LEX_OP_MINUS:
4700 s = bc_parse_minus(p, &prev, ops_bgn, rprn, &nexprs);
4701 rprn = get_token = false;
4702 bin_last = prev == BC_INST_MINUS;
4706 case BC_LEX_OP_ASSIGN_POWER:
4707 case BC_LEX_OP_ASSIGN_MULTIPLY:
4708 case BC_LEX_OP_ASSIGN_DIVIDE:
4709 case BC_LEX_OP_ASSIGN_MODULUS:
4710 case BC_LEX_OP_ASSIGN_PLUS:
4711 case BC_LEX_OP_ASSIGN_MINUS:
4712 case BC_LEX_OP_ASSIGN:
4714 if (prev != BC_INST_VAR && prev != BC_INST_ARRAY_ELEM &&
4715 prev != BC_INST_SCALE && prev != BC_INST_IBASE &&
4716 prev != BC_INST_OBASE && prev != BC_INST_LAST)
4718 s = bc_error("bad assignment:"
4719 " left side must be scale,"
4720 " ibase, obase, last, var,"
4727 case BC_LEX_OP_POWER:
4728 case BC_LEX_OP_MULTIPLY:
4729 case BC_LEX_OP_DIVIDE:
4730 case BC_LEX_OP_MODULUS:
4731 case BC_LEX_OP_PLUS:
4732 case BC_LEX_OP_REL_EQ:
4733 case BC_LEX_OP_REL_LE:
4734 case BC_LEX_OP_REL_GE:
4735 case BC_LEX_OP_REL_NE:
4736 case BC_LEX_OP_REL_LT:
4737 case BC_LEX_OP_REL_GT:
4738 case BC_LEX_OP_BOOL_NOT:
4739 case BC_LEX_OP_BOOL_OR:
4740 case BC_LEX_OP_BOOL_AND:
4742 if (((t == BC_LEX_OP_BOOL_NOT) != bin_last)
4743 || (t != BC_LEX_OP_BOOL_NOT && prev == BC_INST_BOOL_NOT)
4745 return bc_error_bad_expression();
4748 nrelops += t >= BC_LEX_OP_REL_EQ && t <= BC_LEX_OP_REL_GT;
4749 prev = BC_PARSE_TOKEN_INST(t);
4750 s = bc_parse_operator(p, t, ops_bgn, &nexprs, true);
4751 rprn = get_token = false;
4752 bin_last = t != BC_LEX_OP_BOOL_NOT;
4759 if (BC_PARSE_LEAF(prev, rprn))
4760 return bc_error_bad_expression();
4762 paren_expr = rprn = bin_last = false;
4764 bc_vec_push(&p->ops, &t);
4771 if (bin_last || prev == BC_INST_BOOL_NOT)
4772 return bc_error_bad_expression();
4775 s = BC_STATUS_SUCCESS;
4780 else if (!paren_expr)
4781 return BC_STATUS_PARSE_EMPTY_EXP;
4784 paren_expr = rprn = true;
4785 get_token = bin_last = false;
4787 s = bc_parse_rightParen(p, ops_bgn, &nexprs);
4794 if (BC_PARSE_LEAF(prev, rprn))
4795 return bc_error_bad_expression();
4797 rprn = get_token = bin_last = false;
4798 s = bc_parse_name(p, &prev, flags & ~BC_PARSE_NOCALL);
4806 if (BC_PARSE_LEAF(prev, rprn))
4807 return bc_error_bad_expression();
4808 bc_parse_number(p, &prev, &nexprs);
4809 paren_expr = get_token = true;
4810 rprn = bin_last = false;
4815 case BC_LEX_KEY_IBASE:
4816 case BC_LEX_KEY_LAST:
4817 case BC_LEX_KEY_OBASE:
4819 if (BC_PARSE_LEAF(prev, rprn))
4820 return bc_error_bad_expression();
4821 prev = (char) (t - BC_LEX_KEY_IBASE + BC_INST_IBASE);
4822 bc_parse_push(p, (char) prev);
4824 paren_expr = get_token = true;
4825 rprn = bin_last = false;
4831 case BC_LEX_KEY_LENGTH:
4832 case BC_LEX_KEY_SQRT:
4834 if (BC_PARSE_LEAF(prev, rprn))
4835 return bc_error_bad_expression();
4836 s = bc_parse_builtin(p, t, flags, &prev);
4838 rprn = get_token = bin_last = false;
4844 case BC_LEX_KEY_READ:
4846 if (BC_PARSE_LEAF(prev, rprn))
4847 return bc_error_bad_expression();
4848 else if (flags & BC_PARSE_NOREAD)
4849 s = bc_error_nested_read_call();
4851 s = bc_parse_read(p);
4854 rprn = get_token = bin_last = false;
4856 prev = BC_INST_READ;
4861 case BC_LEX_KEY_SCALE:
4863 if (BC_PARSE_LEAF(prev, rprn))
4864 return bc_error_bad_expression();
4865 s = bc_parse_scale(p, &prev, flags);
4867 rprn = get_token = bin_last = false;
4869 prev = BC_INST_SCALE;
4876 s = bc_error_bad_token();
4881 if (!s && get_token) s = bc_lex_next(&p->l);
4885 if (G_interrupt) return BC_STATUS_FAILURE; // ^C: stop parsing
4887 while (p->ops.len > ops_bgn) {
4889 top = BC_PARSE_TOP_OP(p);
4890 assign = top >= BC_LEX_OP_ASSIGN_POWER && top <= BC_LEX_OP_ASSIGN;
4892 if (top == BC_LEX_LPAREN || top == BC_LEX_RPAREN)
4893 return bc_error_bad_expression();
4895 bc_parse_push(p, BC_PARSE_TOKEN_INST(top));
4897 nexprs -= top != BC_LEX_OP_BOOL_NOT && top != BC_LEX_NEG;
4898 bc_vec_pop(&p->ops);
4901 if (prev == BC_INST_BOOL_NOT || nexprs != 1)
4902 return bc_error_bad_expression();
4904 for (i = 0; i < next.len; ++i)
4905 if (t == next.tokens[i])
4907 return bc_error_bad_expression();
4910 if (!(flags & BC_PARSE_REL) && nrelops) {
4911 s = bc_POSIX_does_not_allow("comparison operators outside if or loops");
4914 else if ((flags & BC_PARSE_REL) && nrelops > 1) {
4915 s = bc_posix_error("POSIX requires exactly one comparison operator per condition");
4919 if (flags & BC_PARSE_PRINT) {
4920 if (paren_first || !assign) bc_parse_push(p, BC_INST_PRINT);
4921 bc_parse_push(p, BC_INST_POP);
4927 static BcStatus bc_parse_expr(BcParse *p, uint8_t flags, BcParseNext next)
4931 s = bc_parse_expr_empty_ok(p, flags, next);
4932 if (s == BC_STATUS_PARSE_EMPTY_EXP)
4933 return bc_error("empty expression");
4937 static void bc_parse_init(BcParse *p, size_t func)
4939 bc_parse_create(p, func, bc_parse_parse, bc_lex_token);
4942 static BcStatus bc_parse_expression(BcParse *p, uint8_t flags)
4944 return bc_parse_expr(p, flags, bc_parse_next_read);
4951 #define DC_PARSE_BUF_LEN ((int) (sizeof(uint32_t) * CHAR_BIT))
4953 static BcStatus dc_parse_register(BcParse *p)
4958 s = bc_lex_next(&p->l);
4960 if (p->l.t.t != BC_LEX_NAME) return bc_error_bad_token();
4962 name = xstrdup(p->l.t.v.v);
4963 bc_parse_pushName(p, name);
4968 static BcStatus dc_parse_string(BcParse *p)
4970 char *str, *name, b[DC_PARSE_BUF_LEN + 1];
4971 size_t idx, len = G.prog.strs.len;
4973 sprintf(b, "%0*zu", DC_PARSE_BUF_LEN, len);
4976 str = xstrdup(p->l.t.v.v);
4977 bc_parse_push(p, BC_INST_STR);
4978 bc_parse_pushIndex(p, len);
4979 bc_vec_push(&G.prog.strs, &str);
4980 bc_parse_addFunc(p, name, &idx);
4982 return bc_lex_next(&p->l);
4985 static BcStatus dc_parse_mem(BcParse *p, uint8_t inst, bool name, bool store)
4989 bc_parse_push(p, inst);
4991 s = dc_parse_register(p);
4996 bc_parse_push(p, BC_INST_SWAP);
4997 bc_parse_push(p, BC_INST_ASSIGN);
4998 bc_parse_push(p, BC_INST_POP);
5001 return bc_lex_next(&p->l);
5004 static BcStatus dc_parse_cond(BcParse *p, uint8_t inst)
5008 bc_parse_push(p, inst);
5009 bc_parse_push(p, BC_INST_EXEC_COND);
5011 s = dc_parse_register(p);
5014 s = bc_lex_next(&p->l);
5017 if (p->l.t.t == BC_LEX_ELSE) {
5018 s = dc_parse_register(p);
5020 s = bc_lex_next(&p->l);
5023 bc_parse_push(p, BC_PARSE_STREND);
5028 static BcStatus dc_parse_token(BcParse *p, BcLexType t, uint8_t flags)
5030 BcStatus s = BC_STATUS_SUCCESS;
5033 bool assign, get_token = false;
5037 case BC_LEX_OP_REL_EQ:
5038 case BC_LEX_OP_REL_LE:
5039 case BC_LEX_OP_REL_GE:
5040 case BC_LEX_OP_REL_NE:
5041 case BC_LEX_OP_REL_LT:
5042 case BC_LEX_OP_REL_GT:
5044 s = dc_parse_cond(p, t - BC_LEX_OP_REL_EQ + BC_INST_REL_EQ);
5051 s = dc_parse_mem(p, BC_INST_ARRAY_ELEM, true, t == BC_LEX_COLON);
5057 s = dc_parse_string(p);
5064 if (t == BC_LEX_NEG) {
5065 s = bc_lex_next(&p->l);
5067 if (p->l.t.t != BC_LEX_NUMBER)
5068 return bc_error_bad_token();
5071 bc_parse_number(p, &prev, &p->nbraces);
5073 if (t == BC_LEX_NEG) bc_parse_push(p, BC_INST_NEG);
5079 case BC_LEX_KEY_READ:
5081 if (flags & BC_PARSE_NOREAD)
5082 s = bc_error_nested_read_call();
5084 bc_parse_push(p, BC_INST_READ);
5089 case BC_LEX_OP_ASSIGN:
5090 case BC_LEX_STORE_PUSH:
5092 assign = t == BC_LEX_OP_ASSIGN;
5093 inst = assign ? BC_INST_VAR : BC_INST_PUSH_TO_VAR;
5094 s = dc_parse_mem(p, inst, true, assign);
5099 case BC_LEX_LOAD_POP:
5101 inst = t == BC_LEX_LOAD_POP ? BC_INST_PUSH_VAR : BC_INST_LOAD;
5102 s = dc_parse_mem(p, inst, true, false);
5106 case BC_LEX_STORE_IBASE:
5107 case BC_LEX_STORE_SCALE:
5108 case BC_LEX_STORE_OBASE:
5110 inst = t - BC_LEX_STORE_IBASE + BC_INST_IBASE;
5111 s = dc_parse_mem(p, inst, false, true);
5117 s = bc_error_bad_token();
5123 if (!s && get_token) s = bc_lex_next(&p->l);
5128 static BcStatus dc_parse_expr(BcParse *p, uint8_t flags)
5130 BcStatus s = BC_STATUS_SUCCESS;
5134 if (flags & BC_PARSE_NOCALL) p->nbraces = G.prog.results.len;
5136 for (t = p->l.t.t; !s && t != BC_LEX_EOF; t = p->l.t.t) {
5138 inst = dc_parse_insts[t];
5140 if (inst != BC_INST_INVALID) {
5141 bc_parse_push(p, inst);
5142 s = bc_lex_next(&p->l);
5145 s = dc_parse_token(p, t, flags);
5148 if (!s && p->l.t.t == BC_LEX_EOF && (flags & BC_PARSE_NOCALL))
5149 bc_parse_push(p, BC_INST_POP_EXEC);
5154 static BcStatus dc_parse_parse(BcParse *p)
5158 if (p->l.t.t == BC_LEX_EOF)
5159 s = bc_error("end of file");
5161 s = dc_parse_expr(p, 0);
5163 if (s || G_interrupt) {
5165 s = BC_STATUS_FAILURE;
5171 static void dc_parse_init(BcParse *p, size_t func)
5173 bc_parse_create(p, func, dc_parse_parse, dc_lex_token);
5178 static void common_parse_init(BcParse *p, size_t func)
5181 bc_parse_init(p, func);
5183 dc_parse_init(p, func);
5187 static BcStatus common_parse_expr(BcParse *p, uint8_t flags)
5190 return bc_parse_expression(p, flags);
5192 return dc_parse_expr(p, flags);
5196 static BcVec* bc_program_search(char *id, bool var)
5204 v = var ? &G.prog.vars : &G.prog.arrs;
5205 map = var ? &G.prog.var_map : &G.prog.arr_map;
5209 new = bc_map_insert(map, &e, &i); // 1 if insertion was successful
5212 bc_array_init(&data.v, var);
5213 bc_vec_push(v, &data.v);
5216 ptr = bc_vec_item(map, i);
5217 if (new) ptr->name = xstrdup(e.name);
5218 return bc_vec_item(v, ptr->idx);
5221 static BcStatus bc_program_num(BcResult *r, BcNum **num, bool hex)
5223 BcStatus s = BC_STATUS_SUCCESS;
5228 case BC_RESULT_TEMP:
5229 case BC_RESULT_IBASE:
5230 case BC_RESULT_SCALE:
5231 case BC_RESULT_OBASE:
5237 case BC_RESULT_CONSTANT:
5239 char **str = bc_vec_item(&G.prog.consts, r->d.id.idx);
5240 size_t base_t, len = strlen(*str);
5243 bc_num_init(&r->d.n, len);
5245 hex = hex && len == 1;
5246 base = hex ? &G.prog.hexb : &G.prog.ib;
5247 base_t = hex ? BC_NUM_MAX_IBASE : G.prog.ib_t;
5248 s = bc_num_parse(&r->d.n, *str, base, base_t);
5251 bc_num_free(&r->d.n);
5256 r->t = BC_RESULT_TEMP;
5262 case BC_RESULT_ARRAY:
5263 case BC_RESULT_ARRAY_ELEM:
5267 v = bc_program_search(r->d.id.name, r->t == BC_RESULT_VAR);
5269 if (r->t == BC_RESULT_ARRAY_ELEM) {
5271 if (v->len <= r->d.id.idx) bc_array_expand(v, r->d.id.idx + 1);
5272 *num = bc_vec_item(v, r->d.id.idx);
5275 *num = bc_vec_top(v);
5280 case BC_RESULT_LAST:
5282 *num = &G.prog.last;
5296 static BcStatus bc_program_binOpPrep(BcResult **l, BcNum **ln,
5297 BcResult **r, BcNum **rn, bool assign)
5301 BcResultType lt, rt;
5303 if (!BC_PROG_STACK(&G.prog.results, 2))
5304 return bc_error_stack_has_too_few_elements();
5306 *r = bc_vec_item_rev(&G.prog.results, 0);
5307 *l = bc_vec_item_rev(&G.prog.results, 1);
5311 hex = assign && (lt == BC_RESULT_IBASE || lt == BC_RESULT_OBASE);
5313 s = bc_program_num(*l, ln, false);
5315 s = bc_program_num(*r, rn, hex);
5318 // We run this again under these conditions in case any vector has been
5319 // reallocated out from under the BcNums or arrays we had.
5320 if (lt == rt && (lt == BC_RESULT_VAR || lt == BC_RESULT_ARRAY_ELEM)) {
5321 s = bc_program_num(*l, ln, false);
5325 if (!BC_PROG_NUM((*l), (*ln)) && (!assign || (*l)->t != BC_RESULT_VAR))
5326 return bc_error_variable_is_wrong_type();
5327 if (!assign && !BC_PROG_NUM((*r), (*ln)))
5328 return bc_error_variable_is_wrong_type();
5333 static void bc_program_binOpRetire(BcResult *r)
5335 r->t = BC_RESULT_TEMP;
5336 bc_vec_pop(&G.prog.results);
5337 bc_vec_pop(&G.prog.results);
5338 bc_vec_push(&G.prog.results, r);
5341 static BcStatus bc_program_prep(BcResult **r, BcNum **n)
5345 if (!BC_PROG_STACK(&G.prog.results, 1))
5346 return bc_error_stack_has_too_few_elements();
5347 *r = bc_vec_top(&G.prog.results);
5349 s = bc_program_num(*r, n, false);
5352 if (!BC_PROG_NUM((*r), (*n)))
5353 return bc_error_variable_is_wrong_type();
5358 static void bc_program_retire(BcResult *r, BcResultType t)
5361 bc_vec_pop(&G.prog.results);
5362 bc_vec_push(&G.prog.results, r);
5365 static BcStatus bc_program_op(char inst)
5368 BcResult *opd1, *opd2, res;
5369 BcNum *n1, *n2 = NULL;
5371 s = bc_program_binOpPrep(&opd1, &n1, &opd2, &n2, false);
5373 bc_num_init(&res.d.n, BC_NUM_DEF_SIZE);
5375 s = bc_program_ops[inst - BC_INST_POWER](n1, n2, &res.d.n, G.prog.scale);
5377 bc_program_binOpRetire(&res);
5382 bc_num_free(&res.d.n);
5386 static BcStatus bc_program_read(void)
5388 const char *sv_file;
5394 BcFunc *f = bc_vec_item(&G.prog.fns, BC_PROG_READ);
5396 for (i = 0; i < G.prog.stack.len; ++i) {
5397 BcInstPtr *ip_ptr = bc_vec_item(&G.prog.stack, i);
5398 if (ip_ptr->func == BC_PROG_READ)
5399 return bc_error_nested_read_call();
5402 bc_vec_pop_all(&f->code);
5403 bc_char_vec_init(&buf);
5405 sv_file = G.prog.file;
5408 s = bc_read_line(&buf, "read> ");
5411 common_parse_init(&parse, BC_PROG_READ);
5412 bc_lex_file(&parse.l);
5414 s = bc_parse_text(&parse, buf.v);
5415 if (s) goto exec_err;
5416 s = common_parse_expr(&parse, BC_PARSE_NOREAD);
5417 if (s) goto exec_err;
5419 if (parse.l.t.t != BC_LEX_NLINE && parse.l.t.t != BC_LEX_EOF) {
5420 s = bc_error("bad read() expression");
5424 ip.func = BC_PROG_READ;
5426 ip.len = G.prog.results.len;
5428 // Update this pointer, just in case.
5429 f = bc_vec_item(&G.prog.fns, BC_PROG_READ);
5431 bc_vec_pushByte(&f->code, BC_INST_POP_EXEC);
5432 bc_vec_push(&G.prog.stack, &ip);
5435 G.prog.file = sv_file;
5436 bc_parse_free(&parse);
5442 static size_t bc_program_index(char *code, size_t *bgn)
5444 char amt = code[(*bgn)++], i = 0;
5447 for (; i < amt; ++i, ++(*bgn))
5448 res |= (((size_t)((int) code[*bgn]) & UCHAR_MAX) << (i * CHAR_BIT));
5453 static char *bc_program_name(char *code, size_t *bgn)
5456 char c, *s, *str = code + *bgn, *ptr = strchr(str, BC_PARSE_STREND);
5458 s = xmalloc(ptr - str + 1);
5461 for (i = 0; c != 0 && c != BC_PARSE_STREND; c = code[(*bgn)++], ++i)
5469 static void bc_program_printString(const char *str, size_t *nchars)
5471 size_t i, len = strlen(str);
5480 for (i = 0; i < len; ++i, ++(*nchars)) {
5484 if (c != '\\' || i == len - 1)
5544 // Just print the backslash and following character.
5555 static BcStatus bc_program_print(char inst, size_t idx)
5557 BcStatus s = BC_STATUS_SUCCESS;
5562 bool pop = inst != BC_INST_PRINT;
5564 if (!BC_PROG_STACK(&G.prog.results, idx + 1))
5565 return bc_error_stack_has_too_few_elements();
5567 r = bc_vec_item_rev(&G.prog.results, idx);
5568 s = bc_program_num(r, &num, false);
5571 if (BC_PROG_NUM(r, num)) {
5572 s = bc_num_print(num, &G.prog.ob, G.prog.ob_t, !pop, &G.prog.nchars, G.prog.len);
5573 if (!s) bc_num_copy(&G.prog.last, num);
5577 idx = (r->t == BC_RESULT_STR) ? r->d.id.idx : num->rdx;
5578 str = *((char **) bc_vec_item(&G.prog.strs, idx));
5580 if (inst == BC_INST_PRINT_STR) {
5581 for (i = 0, len = strlen(str); i < len; ++i) {
5584 if (c == '\n') G.prog.nchars = SIZE_MAX;
5589 bc_program_printString(str, &G.prog.nchars);
5590 if (inst == BC_INST_PRINT) bb_putchar('\n');
5594 if (!s && pop) bc_vec_pop(&G.prog.results);
5599 static BcStatus bc_program_negate(void)
5605 s = bc_program_prep(&ptr, &num);
5608 bc_num_init(&res.d.n, num->len);
5609 bc_num_copy(&res.d.n, num);
5610 if (res.d.n.len) res.d.n.neg = !res.d.n.neg;
5612 bc_program_retire(&res, BC_RESULT_TEMP);
5617 static BcStatus bc_program_logical(char inst)
5620 BcResult *opd1, *opd2, res;
5625 s = bc_program_binOpPrep(&opd1, &n1, &opd2, &n2, false);
5627 bc_num_init(&res.d.n, BC_NUM_DEF_SIZE);
5629 if (inst == BC_INST_BOOL_AND)
5630 cond = bc_num_cmp(n1, &G.prog.zero) && bc_num_cmp(n2, &G.prog.zero);
5631 else if (inst == BC_INST_BOOL_OR)
5632 cond = bc_num_cmp(n1, &G.prog.zero) || bc_num_cmp(n2, &G.prog.zero);
5635 cmp = bc_num_cmp(n1, n2);
5639 case BC_INST_REL_EQ:
5645 case BC_INST_REL_LE:
5651 case BC_INST_REL_GE:
5657 case BC_INST_REL_NE:
5663 case BC_INST_REL_LT:
5669 case BC_INST_REL_GT:
5677 (cond ? bc_num_one : bc_num_zero)(&res.d.n);
5679 bc_program_binOpRetire(&res);
5685 static BcStatus bc_program_assignStr(BcResult *r, BcVec *v,
5691 memset(&n2, 0, sizeof(BcNum));
5692 n2.rdx = res.d.id.idx = r->d.id.idx;
5693 res.t = BC_RESULT_STR;
5696 if (!BC_PROG_STACK(&G.prog.results, 2))
5697 return bc_error_stack_has_too_few_elements();
5699 bc_vec_pop(&G.prog.results);
5702 bc_vec_pop(&G.prog.results);
5704 bc_vec_push(&G.prog.results, &res);
5705 bc_vec_push(v, &n2);
5707 return BC_STATUS_SUCCESS;
5711 static BcStatus bc_program_copyToVar(char *name, bool var)
5718 if (!BC_PROG_STACK(&G.prog.results, 1))
5719 return bc_error_stack_has_too_few_elements();
5721 ptr = bc_vec_top(&G.prog.results);
5722 if ((ptr->t == BC_RESULT_ARRAY) != !var)
5723 return bc_error_variable_is_wrong_type();
5724 v = bc_program_search(name, var);
5727 if (ptr->t == BC_RESULT_STR && !var)
5728 return bc_error_variable_is_wrong_type();
5729 if (ptr->t == BC_RESULT_STR) return bc_program_assignStr(ptr, v, true);
5732 s = bc_program_num(ptr, &n, false);
5735 // Do this once more to make sure that pointers were not invalidated.
5736 v = bc_program_search(name, var);
5739 bc_num_init(&r.d.n, BC_NUM_DEF_SIZE);
5740 bc_num_copy(&r.d.n, n);
5743 bc_array_init(&r.d.v, true);
5744 bc_array_copy(&r.d.v, (BcVec *) n);
5747 bc_vec_push(v, &r.d);
5748 bc_vec_pop(&G.prog.results);
5753 static BcStatus bc_program_assign(char inst)
5756 BcResult *left, *right, res;
5757 BcNum *l = NULL, *r = NULL;
5758 unsigned long val, max;
5759 bool assign = inst == BC_INST_ASSIGN, ib, sc;
5761 s = bc_program_binOpPrep(&left, &l, &right, &r, assign);
5764 ib = left->t == BC_RESULT_IBASE;
5765 sc = left->t == BC_RESULT_SCALE;
5769 if (right->t == BC_RESULT_STR) {
5773 if (left->t != BC_RESULT_VAR)
5774 return bc_error_variable_is_wrong_type();
5775 v = bc_program_search(left->d.id.name, true);
5777 return bc_program_assignStr(right, v, false);
5781 if (left->t == BC_RESULT_CONSTANT || left->t == BC_RESULT_TEMP)
5782 return bc_error("bad assignment:"
5783 " left side must be scale,"
5784 " ibase, obase, last, var,"
5789 if (inst == BC_INST_ASSIGN_DIVIDE && !bc_num_cmp(r, &G.prog.zero))
5790 return bc_error("divide by zero");
5795 s = bc_program_ops[inst - BC_INST_ASSIGN_POWER](l, r, l, G.prog.scale);
5802 if (ib || sc || left->t == BC_RESULT_OBASE) {
5803 static const char *const msg[] = {
5804 "bad ibase; must be [2, 16]", //BC_RESULT_IBASE
5805 "bad scale; must be [0, BC_SCALE_MAX]", //BC_RESULT_SCALE
5806 NULL, //can't happen //BC_RESULT_LAST
5807 NULL, //can't happen //BC_RESULT_CONSTANT
5808 NULL, //can't happen //BC_RESULT_ONE
5809 "bad obase; must be [2, BC_BASE_MAX]", //BC_RESULT_OBASE
5813 s = bc_num_ulong(l, &val);
5816 s = left->t - BC_RESULT_IBASE;
5819 ptr = &G.prog.scale;
5822 if (val < BC_NUM_MIN_BASE)
5823 return bc_error(msg[s]);
5824 max = ib ? BC_NUM_MAX_IBASE : BC_MAX_OBASE;
5825 ptr = ib ? &G.prog.ib_t : &G.prog.ob_t;
5829 return bc_error(msg[s]);
5831 bc_num_copy(ib ? &G.prog.ib : &G.prog.ob, l);
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 bc_program_binOpRetire(&res);
5845 #define bc_program_pushVar(code, bgn, pop, copy) \
5846 bc_program_pushVar(code, bgn)
5847 // for bc, 'pop' and 'copy' are always false
5849 static BcStatus bc_program_pushVar(char *code, size_t *bgn,
5850 bool pop, bool copy)
5852 BcStatus s = BC_STATUS_SUCCESS;
5854 char *name = bc_program_name(code, bgn);
5856 r.t = BC_RESULT_VAR;
5861 BcVec *v = bc_program_search(name, true);
5862 BcNum *num = bc_vec_top(v);
5866 if (!BC_PROG_STACK(v, 2 - copy)) {
5868 return bc_error_stack_has_too_few_elements();
5874 if (!BC_PROG_STR(num)) {
5876 r.t = BC_RESULT_TEMP;
5878 bc_num_init(&r.d.n, BC_NUM_DEF_SIZE);
5879 bc_num_copy(&r.d.n, num);
5882 r.t = BC_RESULT_STR;
5883 r.d.id.idx = num->rdx;
5886 if (!copy) bc_vec_pop(v);
5891 bc_vec_push(&G.prog.results, &r);
5896 static BcStatus bc_program_pushArray(char *code, size_t *bgn,
5899 BcStatus s = BC_STATUS_SUCCESS;
5903 r.d.id.name = bc_program_name(code, bgn);
5905 if (inst == BC_INST_ARRAY) {
5906 r.t = BC_RESULT_ARRAY;
5907 bc_vec_push(&G.prog.results, &r);
5914 s = bc_program_prep(&operand, &num);
5916 s = bc_num_ulong(num, &temp);
5919 if (temp > BC_MAX_DIM) {
5920 s = bc_error("array too long; must be [1, BC_DIM_MAX]");
5924 r.d.id.idx = (size_t) temp;
5925 bc_program_retire(&r, BC_RESULT_ARRAY_ELEM);
5929 if (s) free(r.d.id.name);
5934 static BcStatus bc_program_incdec(char inst)
5937 BcResult *ptr, res, copy;
5941 s = bc_program_prep(&ptr, &num);
5944 if (inst == BC_INST_INC_POST || inst == BC_INST_DEC_POST) {
5945 copy.t = BC_RESULT_TEMP;
5946 bc_num_init(©.d.n, num->len);
5947 bc_num_copy(©.d.n, num);
5950 res.t = BC_RESULT_ONE;
5951 inst = inst == BC_INST_INC_PRE || inst == BC_INST_INC_POST ?
5952 BC_INST_ASSIGN_PLUS :
5953 BC_INST_ASSIGN_MINUS;
5955 bc_vec_push(&G.prog.results, &res);
5956 bc_program_assign(inst);
5958 if (inst2 == BC_INST_INC_POST || inst2 == BC_INST_DEC_POST) {
5959 bc_vec_pop(&G.prog.results);
5960 bc_vec_push(&G.prog.results, ©);
5966 static BcStatus bc_program_call(char *code, size_t *idx)
5968 BcStatus s = BC_STATUS_SUCCESS;
5970 size_t i, nparams = bc_program_index(code, idx);
5977 ip.func = bc_program_index(code, idx);
5978 func = bc_vec_item(&G.prog.fns, ip.func);
5980 if (func->code.len == 0) {
5981 return bc_error("undefined function");
5983 if (nparams != func->nparams) {
5984 return bc_error_fmt("function has %u parameters, but called with %u", func->nparams, nparams);
5986 ip.len = G.prog.results.len - nparams;
5988 for (i = 0; i < nparams; ++i) {
5990 a = bc_vec_item(&func->autos, nparams - 1 - i);
5991 arg = bc_vec_top(&G.prog.results);
5993 if ((!a->idx) != (arg->t == BC_RESULT_ARRAY) || arg->t == BC_RESULT_STR)
5994 return bc_error_variable_is_wrong_type();
5996 s = bc_program_copyToVar(a->name, a->idx);
6000 for (; i < func->autos.len; ++i) {
6003 a = bc_vec_item(&func->autos, i);
6004 v = bc_program_search(a->name, a->idx);
6007 bc_num_init(¶m.n, BC_NUM_DEF_SIZE);
6008 bc_vec_push(v, ¶m.n);
6011 bc_array_init(¶m.v, true);
6012 bc_vec_push(v, ¶m.v);
6016 bc_vec_push(&G.prog.stack, &ip);
6018 return BC_STATUS_SUCCESS;
6021 static BcStatus bc_program_return(char inst)
6027 BcInstPtr *ip = bc_vec_top(&G.prog.stack);
6029 if (!BC_PROG_STACK(&G.prog.results, ip->len + inst == BC_INST_RET))
6030 return bc_error_stack_has_too_few_elements();
6032 f = bc_vec_item(&G.prog.fns, ip->func);
6033 res.t = BC_RESULT_TEMP;
6035 if (inst == BC_INST_RET) {
6038 BcResult *operand = bc_vec_top(&G.prog.results);
6040 s = bc_program_num(operand, &num, false);
6042 bc_num_init(&res.d.n, num->len);
6043 bc_num_copy(&res.d.n, num);
6046 bc_num_init(&res.d.n, BC_NUM_DEF_SIZE);
6047 bc_num_zero(&res.d.n);
6050 // We need to pop arguments as well, so this takes that into account.
6051 for (i = 0; i < f->autos.len; ++i) {
6054 BcId *a = bc_vec_item(&f->autos, i);
6056 v = bc_program_search(a->name, a->idx);
6060 bc_vec_npop(&G.prog.results, G.prog.results.len - ip->len);
6061 bc_vec_push(&G.prog.results, &res);
6062 bc_vec_pop(&G.prog.stack);
6064 return BC_STATUS_SUCCESS;
6068 static unsigned long bc_program_scale(BcNum *n)
6070 return (unsigned long) n->rdx;
6073 static unsigned long bc_program_len(BcNum *n)
6075 unsigned long len = n->len;
6078 if (n->rdx != n->len) return len;
6079 for (i = n->len - 1; i < n->len && n->num[i] == 0; --len, --i);
6084 static BcStatus bc_program_builtin(char inst)
6090 bool len = inst == BC_INST_LENGTH;
6092 if (!BC_PROG_STACK(&G.prog.results, 1))
6093 return bc_error_stack_has_too_few_elements();
6094 opnd = bc_vec_top(&G.prog.results);
6096 s = bc_program_num(opnd, &num, false);
6100 if (!BC_PROG_NUM(opnd, num) && !len)
6101 return bc_error_variable_is_wrong_type();
6104 bc_num_init(&res.d.n, BC_NUM_DEF_SIZE);
6106 if (inst == BC_INST_SQRT) s = bc_num_sqrt(num, &res.d.n, G.prog.scale);
6108 else if (len != 0 && opnd->t == BC_RESULT_ARRAY) {
6109 bc_num_ulong2num(&res.d.n, (unsigned long) ((BcVec *) num)->len);
6113 else if (len != 0 && !BC_PROG_NUM(opnd, num)) {
6116 size_t idx = opnd->t == BC_RESULT_STR ? opnd->d.id.idx : num->rdx;
6118 str = bc_vec_item(&G.prog.strs, idx);
6119 bc_num_ulong2num(&res.d.n, strlen(*str));
6123 BcProgramBuiltIn f = len ? bc_program_len : bc_program_scale;
6124 bc_num_ulong2num(&res.d.n, f(num));
6127 bc_program_retire(&res, BC_RESULT_TEMP);
6133 static BcStatus bc_program_divmod(void)
6136 BcResult *opd1, *opd2, res, res2;
6137 BcNum *n1, *n2 = NULL;
6139 s = bc_program_binOpPrep(&opd1, &n1, &opd2, &n2, false);
6142 bc_num_init(&res.d.n, BC_NUM_DEF_SIZE);
6143 bc_num_init(&res2.d.n, n2->len);
6145 s = bc_num_divmod(n1, n2, &res2.d.n, &res.d.n, G.prog.scale);
6148 bc_program_binOpRetire(&res2);
6149 res.t = BC_RESULT_TEMP;
6150 bc_vec_push(&G.prog.results, &res);
6155 bc_num_free(&res2.d.n);
6156 bc_num_free(&res.d.n);
6160 static BcStatus bc_program_modexp(void)
6163 BcResult *r1, *r2, *r3, res;
6164 BcNum *n1, *n2, *n3;
6166 if (!BC_PROG_STACK(&G.prog.results, 3))
6167 return bc_error_stack_has_too_few_elements();
6168 s = bc_program_binOpPrep(&r2, &n2, &r3, &n3, false);
6171 r1 = bc_vec_item_rev(&G.prog.results, 2);
6172 s = bc_program_num(r1, &n1, false);
6174 if (!BC_PROG_NUM(r1, n1))
6175 return bc_error_variable_is_wrong_type();
6177 // Make sure that the values have their pointers updated, if necessary.
6178 if (r1->t == BC_RESULT_VAR || r1->t == BC_RESULT_ARRAY_ELEM) {
6180 if (r1->t == r2->t) {
6181 s = bc_program_num(r2, &n2, false);
6185 if (r1->t == r3->t) {
6186 s = bc_program_num(r3, &n3, false);
6191 bc_num_init(&res.d.n, n3->len);
6192 s = bc_num_modexp(n1, n2, n3, &res.d.n);
6195 bc_vec_pop(&G.prog.results);
6196 bc_program_binOpRetire(&res);
6201 bc_num_free(&res.d.n);
6205 static void bc_program_stackLen(void)
6208 size_t len = G.prog.results.len;
6210 res.t = BC_RESULT_TEMP;
6212 bc_num_init(&res.d.n, BC_NUM_DEF_SIZE);
6213 bc_num_ulong2num(&res.d.n, len);
6214 bc_vec_push(&G.prog.results, &res);
6217 static BcStatus bc_program_asciify(void)
6221 BcNum *num = NULL, n;
6222 char *str, *str2, c;
6223 size_t len = G.prog.strs.len, idx;
6226 if (!BC_PROG_STACK(&G.prog.results, 1))
6227 return bc_error_stack_has_too_few_elements();
6228 r = bc_vec_top(&G.prog.results);
6230 s = bc_program_num(r, &num, false);
6233 if (BC_PROG_NUM(r, num)) {
6235 bc_num_init(&n, BC_NUM_DEF_SIZE);
6236 bc_num_copy(&n, num);
6237 bc_num_truncate(&n, n.rdx);
6239 s = bc_num_mod(&n, &G.prog.strmb, &n, 0);
6240 if (s) goto num_err;
6241 s = bc_num_ulong(&n, &val);
6242 if (s) goto num_err;
6249 idx = (r->t == BC_RESULT_STR) ? r->d.id.idx : num->rdx;
6250 str2 = *((char **) bc_vec_item(&G.prog.strs, idx));
6258 str2 = xstrdup(str);
6259 bc_program_addFunc(str2, &idx);
6261 if (idx != len + BC_PROG_REQ_FUNCS) {
6263 for (idx = 0; idx < G.prog.strs.len; ++idx) {
6264 if (!strcmp(*((char **) bc_vec_item(&G.prog.strs, idx)), str)) {
6273 bc_vec_push(&G.prog.strs, &str);
6275 res.t = BC_RESULT_STR;
6277 bc_vec_pop(&G.prog.results);
6278 bc_vec_push(&G.prog.results, &res);
6280 return BC_STATUS_SUCCESS;
6287 static BcStatus bc_program_printStream(void)
6295 if (!BC_PROG_STACK(&G.prog.results, 1))
6296 return bc_error_stack_has_too_few_elements();
6297 r = bc_vec_top(&G.prog.results);
6299 s = bc_program_num(r, &n, false);
6302 if (BC_PROG_NUM(r, n))
6303 s = bc_num_stream(n, &G.prog.strmb, &G.prog.nchars, G.prog.len);
6305 idx = (r->t == BC_RESULT_STR) ? r->d.id.idx : n->rdx;
6306 str = *((char **) bc_vec_item(&G.prog.strs, idx));
6313 static BcStatus bc_program_nquit(void)
6320 s = bc_program_prep(&opnd, &num);
6322 s = bc_num_ulong(num, &val);
6325 bc_vec_pop(&G.prog.results);
6327 if (G.prog.stack.len < val)
6328 return bc_error_stack_has_too_few_elements();
6329 if (G.prog.stack.len == val) {
6330 if (ENABLE_FEATURE_CLEAN_UP)
6331 return BC_STATUS_FAILURE;
6335 bc_vec_npop(&G.prog.stack, val);
6340 static BcStatus bc_program_execStr(char *code, size_t *bgn,
6343 BcStatus s = BC_STATUS_SUCCESS;
6353 if (!BC_PROG_STACK(&G.prog.results, 1))
6354 return bc_error_stack_has_too_few_elements();
6356 r = bc_vec_top(&G.prog.results);
6360 char *name, *then_name = bc_program_name(code, bgn), *else_name = NULL;
6362 if (code[*bgn] == BC_PARSE_STREND)
6365 else_name = bc_program_name(code, bgn);
6367 exec = r->d.n.len != 0;
6371 else if (else_name != NULL) {
6378 v = bc_program_search(name, true);
6385 if (!exec) goto exit;
6386 if (!BC_PROG_STR(n)) {
6387 s = bc_error_variable_is_wrong_type();
6395 if (r->t == BC_RESULT_STR)
6397 else if (r->t == BC_RESULT_VAR) {
6398 s = bc_program_num(r, &n, false);
6399 if (s || !BC_PROG_STR(n)) goto exit;
6406 fidx = sidx + BC_PROG_REQ_FUNCS;
6408 str = bc_vec_item(&G.prog.strs, sidx);
6409 f = bc_vec_item(&G.prog.fns, fidx);
6411 if (f->code.len == 0) {
6412 common_parse_init(&prs, fidx);
6413 s = bc_parse_text(&prs, *str);
6415 s = common_parse_expr(&prs, BC_PARSE_NOCALL);
6418 if (prs.l.t.t != BC_LEX_EOF) {
6419 s = bc_error_bad_expression();
6423 bc_parse_free(&prs);
6427 ip.len = G.prog.results.len;
6430 bc_vec_pop(&G.prog.results);
6431 bc_vec_push(&G.prog.stack, &ip);
6433 return BC_STATUS_SUCCESS;
6436 bc_parse_free(&prs);
6437 f = bc_vec_item(&G.prog.fns, fidx);
6438 bc_vec_pop_all(&f->code);
6440 bc_vec_pop(&G.prog.results);
6445 static void bc_program_pushGlobal(char inst)
6450 res.t = inst - BC_INST_IBASE + BC_RESULT_IBASE;
6451 if (inst == BC_INST_IBASE)
6452 val = (unsigned long) G.prog.ib_t;
6453 else if (inst == BC_INST_SCALE)
6454 val = (unsigned long) G.prog.scale;
6456 val = (unsigned long) G.prog.ob_t;
6458 bc_num_init(&res.d.n, BC_NUM_DEF_SIZE);
6459 bc_num_ulong2num(&res.d.n, val);
6460 bc_vec_push(&G.prog.results, &res);
6463 static void bc_program_addFunc(char *name, size_t *idx)
6465 BcId entry, *entry_ptr;
6470 entry.idx = G.prog.fns.len;
6472 inserted = bc_map_insert(&G.prog.fn_map, &entry, idx);
6473 if (!inserted) free(name);
6475 entry_ptr = bc_vec_item(&G.prog.fn_map, *idx);
6476 *idx = entry_ptr->idx;
6480 BcFunc *func = bc_vec_item(&G.prog.fns, entry_ptr->idx);
6482 // We need to reset these, so the function can be repopulated.
6484 bc_vec_pop_all(&func->autos);
6485 bc_vec_pop_all(&func->code);
6486 bc_vec_pop_all(&func->labels);
6490 bc_vec_push(&G.prog.fns, &f);
6494 // Called when parsing or execution detects a failure,
6495 // resets execution structures.
6496 static void bc_program_reset(void)
6501 bc_vec_npop(&G.prog.stack, G.prog.stack.len - 1);
6502 bc_vec_pop_all(&G.prog.results);
6504 f = bc_vec_item(&G.prog.fns, 0);
6505 ip = bc_vec_top(&G.prog.stack);
6506 ip->idx = f->code.len;
6508 // If !tty, no need to check for ^C: we don't have ^C handler,
6509 // we would be killed by a signal and won't reach this place
6512 static BcStatus bc_program_exec(void)
6514 BcStatus s = BC_STATUS_SUCCESS;
6518 BcInstPtr *ip = bc_vec_top(&G.prog.stack);
6519 BcFunc *func = bc_vec_item(&G.prog.fns, ip->func);
6520 char *code = func->code.v;
6523 while (!s && ip->idx < func->code.len) {
6525 char inst = code[(ip->idx)++];
6530 case BC_INST_JUMP_ZERO:
6532 s = bc_program_prep(&ptr, &num);
6534 cond = !bc_num_cmp(num, &G.prog.zero);
6535 bc_vec_pop(&G.prog.results);
6541 idx = bc_program_index(code, &ip->idx);
6542 addr = bc_vec_item(&func->labels, idx);
6543 if (inst == BC_INST_JUMP || cond) ip->idx = *addr;
6549 s = bc_program_call(code, &ip->idx);
6553 case BC_INST_INC_PRE:
6554 case BC_INST_DEC_PRE:
6555 case BC_INST_INC_POST:
6556 case BC_INST_DEC_POST:
6558 s = bc_program_incdec(inst);
6564 quit_or_return_for_exit();
6571 s = bc_program_return(inst);
6575 case BC_INST_BOOL_OR:
6576 case BC_INST_BOOL_AND:
6578 case BC_INST_REL_EQ:
6579 case BC_INST_REL_LE:
6580 case BC_INST_REL_GE:
6581 case BC_INST_REL_NE:
6582 case BC_INST_REL_LT:
6583 case BC_INST_REL_GT:
6585 s = bc_program_logical(inst);
6591 s = bc_program_read();
6597 s = bc_program_pushVar(code, &ip->idx, false, false);
6601 case BC_INST_ARRAY_ELEM:
6604 s = bc_program_pushArray(code, &ip->idx, inst);
6610 r.t = BC_RESULT_LAST;
6611 bc_vec_push(&G.prog.results, &r);
6619 bc_program_pushGlobal(inst);
6623 case BC_INST_SCALE_FUNC:
6624 case BC_INST_LENGTH:
6627 s = bc_program_builtin(inst);
6633 r.t = BC_RESULT_CONSTANT;
6634 r.d.id.idx = bc_program_index(code, &ip->idx);
6635 bc_vec_push(&G.prog.results, &r);
6641 if (!BC_PROG_STACK(&G.prog.results, 1))
6642 s = bc_error_stack_has_too_few_elements();
6644 bc_vec_pop(&G.prog.results);
6648 case BC_INST_POP_EXEC:
6650 bc_vec_pop(&G.prog.stack);
6655 case BC_INST_PRINT_POP:
6656 case BC_INST_PRINT_STR:
6658 s = bc_program_print(inst, 0);
6664 r.t = BC_RESULT_STR;
6665 r.d.id.idx = bc_program_index(code, &ip->idx);
6666 bc_vec_push(&G.prog.results, &r);
6671 case BC_INST_MULTIPLY:
6672 case BC_INST_DIVIDE:
6673 case BC_INST_MODULUS:
6677 s = bc_program_op(inst);
6681 case BC_INST_BOOL_NOT:
6683 s = bc_program_prep(&ptr, &num);
6686 bc_num_init(&r.d.n, BC_NUM_DEF_SIZE);
6687 (!bc_num_cmp(num, &G.prog.zero) ? bc_num_one : bc_num_zero)(&r.d.n);
6688 bc_program_retire(&r, BC_RESULT_TEMP);
6695 s = bc_program_negate();
6700 case BC_INST_ASSIGN_POWER:
6701 case BC_INST_ASSIGN_MULTIPLY:
6702 case BC_INST_ASSIGN_DIVIDE:
6703 case BC_INST_ASSIGN_MODULUS:
6704 case BC_INST_ASSIGN_PLUS:
6705 case BC_INST_ASSIGN_MINUS:
6707 case BC_INST_ASSIGN:
6709 s = bc_program_assign(inst);
6713 case BC_INST_MODEXP:
6715 s = bc_program_modexp();
6719 case BC_INST_DIVMOD:
6721 s = bc_program_divmod();
6725 case BC_INST_EXECUTE:
6726 case BC_INST_EXEC_COND:
6728 cond = inst == BC_INST_EXEC_COND;
6729 s = bc_program_execStr(code, &ip->idx, cond);
6733 case BC_INST_PRINT_STACK:
6735 for (idx = 0; !s && idx < G.prog.results.len; ++idx)
6736 s = bc_program_print(BC_INST_PRINT, idx);
6740 case BC_INST_CLEAR_STACK:
6742 bc_vec_pop_all(&G.prog.results);
6746 case BC_INST_STACK_LEN:
6748 bc_program_stackLen();
6752 case BC_INST_DUPLICATE:
6754 if (!BC_PROG_STACK(&G.prog.results, 1))
6755 return bc_error_stack_has_too_few_elements();
6756 ptr = bc_vec_top(&G.prog.results);
6757 bc_result_copy(&r, ptr);
6758 bc_vec_push(&G.prog.results, &r);
6766 if (!BC_PROG_STACK(&G.prog.results, 2))
6767 return bc_error_stack_has_too_few_elements();
6769 ptr = bc_vec_item_rev(&G.prog.results, 0);
6770 ptr2 = bc_vec_item_rev(&G.prog.results, 1);
6771 memcpy(&r, ptr, sizeof(BcResult));
6772 memcpy(ptr, ptr2, sizeof(BcResult));
6773 memcpy(ptr2, &r, sizeof(BcResult));
6778 case BC_INST_ASCIIFY:
6780 s = bc_program_asciify();
6784 case BC_INST_PRINT_STREAM:
6786 s = bc_program_printStream();
6791 case BC_INST_PUSH_VAR:
6793 bool copy = inst == BC_INST_LOAD;
6794 s = bc_program_pushVar(code, &ip->idx, true, copy);
6798 case BC_INST_PUSH_TO_VAR:
6800 char *name = bc_program_name(code, &ip->idx);
6801 s = bc_program_copyToVar(name, true);
6808 if (G.prog.stack.len <= 2)
6809 quit_or_return_for_exit();
6810 bc_vec_npop(&G.prog.stack, 2);
6816 s = bc_program_nquit();
6822 if (s || G_interrupt) {
6827 // If the stack has changed, pointers may be invalid.
6828 ip = bc_vec_top(&G.prog.stack);
6829 func = bc_vec_item(&G.prog.fns, ip->func);
6830 code = func->code.v;
6836 static void bc_vm_info(void)
6838 printf("%s "BB_VER"\n"
6839 "Copyright (c) 2018 Gavin D. Howard and contributors\n"
6840 "Report bugs at: https://github.com/gavinhoward/bc\n"
6841 "This is free software with ABSOLUTELY NO WARRANTY\n"
6845 static void bc_args(char **argv)
6851 #if ENABLE_FEATURE_BC_LONG_OPTIONS
6852 opts = option_mask32 |= getopt32long(argv, "xwvsqli",
6853 "extended-register\0" No_argument "x"
6854 "warn\0" No_argument "w"
6855 "version\0" No_argument "v"
6856 "standard\0" No_argument "s"
6857 "quiet\0" No_argument "q"
6858 "mathlib\0" No_argument "l"
6859 "interactive\0" No_argument "i"
6862 opts = option_mask32 |= getopt32(argv, "xwvsqli");
6864 if (getenv("POSIXLY_CORRECT"))
6865 option_mask32 |= BC_FLAG_S;
6867 ///should be in bc_vm_run() instead??
6868 if (opts & BC_FLAG_V) {
6873 for (i = optind; argv[i]; ++i)
6874 bc_vec_push(&G.files, argv + i);
6878 static void bc_vm_envArgs(void)
6882 char *env_args = getenv("BC_ENV_ARGS");
6884 if (!env_args) return;
6886 G.env_args = xstrdup(env_args);
6889 bc_vec_init(&v, sizeof(char *), NULL);
6891 while (*(buf = skip_whitespace(buf)) != '\0') {
6892 bc_vec_push(&v, &buf);
6893 buf = skip_non_whitespace(buf);
6899 // NULL terminate, and pass argv[] so that first arg is argv[1]
6900 if (sizeof(int) == sizeof(char*)) {
6901 bc_vec_push(&v, &const_int_0);
6903 static char *const nullptr = NULL;
6904 bc_vec_push(&v, &nullptr);
6906 bc_args(((char **)v.v) - 1);
6912 static unsigned bc_vm_envLen(const char *var)
6918 len = BC_NUM_PRINT_WIDTH;
6919 if (!lenv) return len;
6921 len = bb_strtou(lenv, NULL, 10) - 1;
6922 if (errno || len < 2 || len >= INT_MAX)
6923 len = BC_NUM_PRINT_WIDTH;
6928 static BcStatus bc_vm_process(const char *text)
6930 BcStatus s = bc_parse_text(&G.prs, text);
6934 while (G.prs.l.t.t != BC_LEX_EOF) {
6935 s = G.prs.parse(&G.prs);
6939 if (BC_PARSE_CAN_EXEC(&G.prs)) {
6940 s = bc_program_exec();
6949 static BcStatus bc_vm_file(const char *file)
6951 const char *sv_file;
6957 data = bc_read_file(file);
6958 if (!data) return bc_error_fmt("file '%s' is not text", file);
6960 sv_file = G.prog.file;
6962 bc_lex_file(&G.prs.l);
6963 s = bc_vm_process(data);
6966 main_func = bc_vec_item(&G.prog.fns, BC_PROG_MAIN);
6967 ip = bc_vec_item(&G.prog.stack, 0);
6969 if (main_func->code.len < ip->idx)
6970 s = bc_error_fmt("file '%s' is not executable", file);
6973 G.prog.file = sv_file;
6978 static BcStatus bc_vm_stdin(void)
6982 size_t len, i, str = 0;
6983 bool comment = false;
6986 bc_lex_file(&G.prs.l);
6988 bc_char_vec_init(&buffer);
6989 bc_char_vec_init(&buf);
6990 bc_vec_pushZeroByte(&buffer);
6992 // This loop is complex because the vm tries not to send any lines that end
6993 // with a backslash to the parser. The reason for that is because the parser
6994 // treats a backslash+newline combo as whitespace, per the bc spec. In that
6995 // case, and for strings and comments, the parser will expect more stuff.
6996 s = BC_STATUS_SUCCESS;
6997 while (!G.eof && (s = bc_read_line(&buf, ">>> ")) == BC_STATUS_SUCCESS) {
6999 char *string = buf.v;
7004 if (str && buf.v[0] == G.send)
7006 else if (buf.v[0] == G.sbgn)
7009 else if (len > 1 || comment) {
7011 for (i = 0; i < len; ++i) {
7013 bool notend = len > i + 1;
7016 if (i - 1 > len || string[i - 1] != '\\') {
7017 if (G.sbgn == G.send)
7019 else if (c == G.send)
7021 else if (c == G.sbgn)
7025 if (c == '/' && notend && !comment && string[i + 1] == '*') {
7029 else if (c == '*' && notend && comment && string[i + 1] == '/')
7033 if (str || comment || string[len - 2] == '\\') {
7034 bc_vec_concat(&buffer, buf.v);
7039 bc_vec_concat(&buffer, buf.v);
7040 s = bc_vm_process(buffer.v);
7042 if (ENABLE_FEATURE_CLEAN_UP && !G_ttyin) {
7043 // Debug config, non-interactive mode:
7044 // return all the way back to main.
7045 // Non-debug builds do not come here, they exit.
7049 fputs("ready for more input\n", stderr);
7052 bc_vec_pop_all(&buffer);
7056 s = bc_error("string end could not be found");
7059 s = bc_error("comment end could not be found");
7063 bc_vec_free(&buffer);
7068 static const char bc_lib[] = {
7071 "\n" "auto b,s,n,r,d,i,p,f,v"
7080 "\n" "scale=scale(x)+1"
7090 "\n" "for(i=2;v!=0;++i){"
7096 "\n" "while((d--)!=0)r*=r"
7099 "\n" "if(n!=0)return(1/r)"
7103 "\n" "auto b,s,r,p,a,q,i,v"
7107 "\n" "r=(1-10^scale)/1"
7118 "\n" "while(x<=0.5){"
7122 "\n" "r=a=(x-1)/(x+1)"
7125 "\n" "for(i=3;v!=0;i+=2){"
7136 "\n" "auto b,s,r,n,a,q,i"
7140 "\n" "scale=1.1*s+2"
7149 "\n" "if(q%2!=0)x=-x"
7153 "\n" "for(i=3;a!=0;i+=2){"
7154 "\n" "a*=q/(i*(i-1))"
7159 "\n" "if(n!=0)return(-r/1)"
7168 "\n" "x=s(2*a(1)+x)"
7174 "\n" "auto b,s,r,n,a,m,t,f,i,u"
7183 "\n" "if(scale<65){"
7184 "\n" "return(.7853981633974483096156608458198757210492923498437764552437361480/n)"
7188 "\n" "if(scale<65){"
7189 "\n" "return(.1973955598498807583700497651947902934475851037878521015176889402/n)"
7200 "\n" "x=(x-.2)/(1+.2*x)"
7205 "\n" "for(i=3;t!=0;i+=2){"
7212 "\n" "return((m*a+r)/n)"
7214 "\n" "define j(n,x){"
7215 "\n" "auto b,s,o,a,i,v,f"
7223 "\n" "if(n%2==1)o=1"
7226 "\n" "for(i=2;i<=n;++i)a*=i"
7228 "\n" "a=(x^n)/2^n/a"
7231 "\n" "scale=scale+length(a)-scale(a)"
7232 "\n" "for(i=1;v!=0;++i){"
7233 "\n" "v=v*f/i/(n+i)"
7239 "\n" "return(a*r/1)"
7244 static BcStatus bc_vm_exec(void)
7246 BcStatus s = BC_STATUS_SUCCESS;
7250 if (option_mask32 & BC_FLAG_L) {
7252 // We know that internal library is not buggy,
7253 // thus error checking is normally disabled.
7254 # define DEBUG_LIB 0
7255 bc_lex_file(&G.prs.l);
7256 s = bc_parse_text(&G.prs, bc_lib);
7257 if (DEBUG_LIB && s) return s;
7259 while (G.prs.l.t.t != BC_LEX_EOF) {
7260 s = G.prs.parse(&G.prs);
7261 if (DEBUG_LIB && s) return s;
7263 s = bc_program_exec();
7264 if (DEBUG_LIB && s) return s;
7268 for (i = 0; !s && i < G.files.len; ++i)
7269 s = bc_vm_file(*((char **) bc_vec_item(&G.files, i)));
7271 if (ENABLE_FEATURE_CLEAN_UP && !G_ttyin) {
7272 // Debug config, non-interactive mode:
7273 // return all the way back to main.
7274 // Non-debug builds do not come here, they exit.
7278 fputs("ready for more input\n", stderr);
7281 if (IS_BC || !G.files.len)
7283 if (!s && !BC_PARSE_CAN_EXEC(&G.prs))
7284 s = bc_vm_process("");
7289 #if ENABLE_FEATURE_CLEAN_UP
7290 static void bc_program_free(void)
7292 bc_num_free(&G.prog.ib);
7293 bc_num_free(&G.prog.ob);
7294 bc_num_free(&G.prog.hexb);
7296 bc_num_free(&G.prog.strmb);
7298 bc_vec_free(&G.prog.fns);
7299 bc_vec_free(&G.prog.fn_map);
7300 bc_vec_free(&G.prog.vars);
7301 bc_vec_free(&G.prog.var_map);
7302 bc_vec_free(&G.prog.arrs);
7303 bc_vec_free(&G.prog.arr_map);
7304 bc_vec_free(&G.prog.strs);
7305 bc_vec_free(&G.prog.consts);
7306 bc_vec_free(&G.prog.results);
7307 bc_vec_free(&G.prog.stack);
7308 bc_num_free(&G.prog.last);
7309 bc_num_free(&G.prog.zero);
7310 bc_num_free(&G.prog.one);
7313 static void bc_vm_free(void)
7315 bc_vec_free(&G.files);
7317 bc_parse_free(&G.prs);
7322 static void bc_program_init(void)
7327 /* memset(&G.prog, 0, sizeof(G.prog)); - already is */
7328 memset(&ip, 0, sizeof(BcInstPtr));
7330 /* G.prog.nchars = G.prog.scale = 0; - already is */
7332 bc_num_init(&G.prog.ib, BC_NUM_DEF_SIZE);
7333 bc_num_ten(&G.prog.ib);
7336 bc_num_init(&G.prog.ob, BC_NUM_DEF_SIZE);
7337 bc_num_ten(&G.prog.ob);
7340 bc_num_init(&G.prog.hexb, BC_NUM_DEF_SIZE);
7341 bc_num_ten(&G.prog.hexb);
7342 G.prog.hexb.num[0] = 6;
7345 bc_num_init(&G.prog.strmb, BC_NUM_DEF_SIZE);
7346 bc_num_ulong2num(&G.prog.strmb, UCHAR_MAX + 1);
7349 bc_num_init(&G.prog.last, BC_NUM_DEF_SIZE);
7350 bc_num_zero(&G.prog.last);
7352 bc_num_init(&G.prog.zero, BC_NUM_DEF_SIZE);
7353 bc_num_zero(&G.prog.zero);
7355 bc_num_init(&G.prog.one, BC_NUM_DEF_SIZE);
7356 bc_num_one(&G.prog.one);
7358 bc_vec_init(&G.prog.fns, sizeof(BcFunc), bc_func_free);
7359 bc_vec_init(&G.prog.fn_map, sizeof(BcId), bc_id_free);
7361 bc_program_addFunc(xstrdup("(main)"), &idx);
7362 bc_program_addFunc(xstrdup("(read)"), &idx);
7364 bc_vec_init(&G.prog.vars, sizeof(BcVec), bc_vec_free);
7365 bc_vec_init(&G.prog.var_map, sizeof(BcId), bc_id_free);
7367 bc_vec_init(&G.prog.arrs, sizeof(BcVec), bc_vec_free);
7368 bc_vec_init(&G.prog.arr_map, sizeof(BcId), bc_id_free);
7370 bc_vec_init(&G.prog.strs, sizeof(char *), bc_string_free);
7371 bc_vec_init(&G.prog.consts, sizeof(char *), bc_string_free);
7372 bc_vec_init(&G.prog.results, sizeof(BcResult), bc_result_free);
7373 bc_vec_init(&G.prog.stack, sizeof(BcInstPtr), NULL);
7374 bc_vec_push(&G.prog.stack, &ip);
7377 static void bc_vm_init(void)
7379 bc_vec_init(&G.files, sizeof(char *), NULL);
7384 bc_parse_init(&G.prs, BC_PROG_MAIN);
7386 dc_parse_init(&G.prs, BC_PROG_MAIN);
7390 static BcStatus bc_vm_run(char **argv, const char *env_len)
7394 G.prog.len = bc_vm_envLen(env_len);
7400 #if ENABLE_FEATURE_BC_SIGNALS
7402 // With SA_RESTART, most system calls will restart
7403 // (IOW: they won't fail with EINTR).
7404 // In particular, this means ^C won't cause
7405 // stdout to get into "error state" if SIGINT hits
7406 // within write() syscall.
7407 // The downside is that ^C while line input is taken
7408 // will only be handled after [Enter] since read()
7409 // from stdin is not interrupted by ^C either,
7410 // it restarts, thus fgetc() does not return on ^C.
7411 signal_SA_RESTART_empty_mask(SIGINT, record_signo);
7413 // Without SA_RESTART, this exhibits a bug:
7414 // "while (1) print 1" and try ^C-ing it.
7415 // Intermittently, instead of returning to input line,
7416 // you'll get "output error: Interrupted system call"
7418 //signal_no_SA_RESTART_empty_mask(SIGINT, record_signo);
7420 if (!(option_mask32 & BC_FLAG_Q))
7426 #if ENABLE_FEATURE_CLEAN_UP
7434 int bc_main(int argc, char **argv) MAIN_EXTERNALLY_VISIBLE;
7435 int bc_main(int argc UNUSED_PARAM, char **argv)
7438 G.sbgn = G.send = '"';
7440 return bc_vm_run(argv, "BC_LINE_LENGTH");
7445 int dc_main(int argc, char **argv) MAIN_EXTERNALLY_VISIBLE;
7446 int dc_main(int argc UNUSED_PARAM, char **argv)
7452 return bc_vm_run(argv, "DC_LINE_LENGTH");