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: "[-sqli] 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"
131 //usage:#define bc_example_usage
132 //usage: "3 + 4.129\n"
133 //usage: "1903 - 2893\n"
134 //usage: "-129 * 213.28935\n"
135 //usage: "12 / -1932\n"
137 //usage: "34 ^ 189\n"
138 //usage: "scale = 13\n"
139 //usage: "ibase = 2\n"
140 //usage: "obase = A\n"
142 //usage:#define dc_trivial_usage
143 //usage: "EXPRESSION..."
145 //usage:#define dc_full_usage "\n\n"
146 //usage: "Tiny RPN calculator. Operations:\n"
147 //usage: "+, add, -, sub, *, mul, /, div, %, mod, ^, exp, ~, divmod, |, "
148 //usage: "modular exponentiation,\n"
149 //usage: "p - print top of the stack (without popping),\n"
150 //usage: "f - print entire stack,\n"
151 //usage: "k - pop the value and set the precision.\n"
152 //usage: "i - pop the value and set input radix.\n"
153 //usage: "o - pop the value and set output radix.\n"
154 //usage: "Examples: 'dc 2 2 add p' -> 4, 'dc 8 8 mul 2 2 + / p' -> 16"
156 //usage:#define dc_example_usage
157 //usage: "$ dc 2 2 + p\n"
159 //usage: "$ dc 8 8 \\* 2 2 + / p\n"
161 //usage: "$ dc 0 1 and p\n"
163 //usage: "$ dc 0 1 or p\n"
165 //usage: "$ echo 72 9 div 8 mul p | dc\n"
170 typedef enum BcStatus {
171 BC_STATUS_SUCCESS = 0,
172 BC_STATUS_FAILURE = 1,
173 BC_STATUS_PARSE_EMPTY_EXP = 2, // bc_parse_expr() uses this
176 #define BC_VEC_INVALID_IDX ((size_t) -1)
177 #define BC_VEC_START_CAP (1 << 5)
179 typedef void (*BcVecFree)(void *);
181 typedef struct BcVec {
189 #define bc_vec_pop(v) (bc_vec_npop((v), 1))
190 #define bc_vec_top(v) (bc_vec_item_rev((v), 0))
192 typedef signed char BcDig;
194 typedef struct BcNum {
202 #define BC_NUM_MIN_BASE ((unsigned long) 2)
203 #define BC_NUM_MAX_IBASE ((unsigned long) 16)
204 #define BC_NUM_DEF_SIZE (16)
205 #define BC_NUM_PRINT_WIDTH (69)
207 #define BC_NUM_KARATSUBA_LEN (32)
209 #define BC_NUM_NEG(n, neg) ((((ssize_t)(n)) ^ -((ssize_t)(neg))) + (neg))
210 #define BC_NUM_ONE(n) ((n)->len == 1 && (n)->rdx == 0 && (n)->num[0] == 1)
211 #define BC_NUM_INT(n) ((n)->len - (n)->rdx)
212 #define BC_NUM_AREQ(a, b) \
213 (BC_MAX((a)->rdx, (b)->rdx) + BC_MAX(BC_NUM_INT(a), BC_NUM_INT(b)) + 1)
214 #define BC_NUM_MREQ(a, b, scale) \
215 (BC_NUM_INT(a) + BC_NUM_INT(b) + BC_MAX((scale), (a)->rdx + (b)->rdx) + 1)
217 typedef BcStatus (*BcNumBinaryOp)(BcNum *, BcNum *, BcNum *, size_t);
218 typedef void (*BcNumDigitOp)(size_t, size_t, bool, size_t *, size_t);
220 static void bc_num_init(BcNum *n, size_t req);
221 static void bc_num_expand(BcNum *n, size_t req);
222 static void bc_num_copy(BcNum *d, BcNum *s);
223 static void bc_num_free(void *num);
225 static BcStatus bc_num_ulong(BcNum *n, unsigned long *result);
226 static void bc_num_ulong2num(BcNum *n, unsigned long val);
228 static BcStatus bc_num_add(BcNum *a, BcNum *b, BcNum *c, size_t scale);
229 static BcStatus bc_num_sub(BcNum *a, BcNum *b, BcNum *c, size_t scale);
230 static BcStatus bc_num_mul(BcNum *a, BcNum *b, BcNum *c, size_t scale);
231 static BcStatus bc_num_div(BcNum *a, BcNum *b, BcNum *c, size_t scale);
232 static BcStatus bc_num_mod(BcNum *a, BcNum *b, BcNum *c, size_t scale);
233 static BcStatus bc_num_pow(BcNum *a, BcNum *b, BcNum *c, size_t scale);
234 static BcStatus bc_num_sqrt(BcNum *a, BcNum *b, size_t scale);
235 static BcStatus bc_num_divmod(BcNum *a, BcNum *b, BcNum *c, BcNum *d,
238 typedef enum BcInst {
268 BC_INST_ASSIGN_POWER,
269 BC_INST_ASSIGN_MULTIPLY,
270 BC_INST_ASSIGN_DIVIDE,
271 BC_INST_ASSIGN_MODULUS,
273 BC_INST_ASSIGN_MINUS,
319 BC_INST_PRINT_STREAM,
334 BC_INST_INVALID = -1,
339 typedef struct BcId {
344 typedef struct BcFunc {
351 typedef enum BcResultType {
356 BC_RESULT_ARRAY_ELEM,
365 // These are between to calculate ibase, obase, and last from instructions.
373 typedef union BcResultData {
379 typedef struct BcResult {
384 typedef struct BcInstPtr {
390 static void bc_array_expand(BcVec *a, size_t len);
391 static int bc_id_cmp(const void *e1, const void *e2);
393 // BC_LEX_NEG is not used in lexing; it is only for parsing.
394 typedef enum BcLexType {
422 BC_LEX_OP_ASSIGN_POWER,
423 BC_LEX_OP_ASSIGN_MULTIPLY,
424 BC_LEX_OP_ASSIGN_DIVIDE,
425 BC_LEX_OP_ASSIGN_MODULUS,
426 BC_LEX_OP_ASSIGN_PLUS,
427 BC_LEX_OP_ASSIGN_MINUS,
448 BC_LEX_KEY_1st_keyword,
449 BC_LEX_KEY_AUTO = BC_LEX_KEY_1st_keyword,
456 // code uses "type - BC_LEX_KEY_IBASE + BC_INST_IBASE" construct,
457 BC_LEX_KEY_IBASE, // relative order should match for: BC_INST_IBASE
459 BC_LEX_KEY_LAST, // relative order should match for: BC_INST_LAST
462 BC_LEX_KEY_OBASE, // relative order should match for: BC_INST_OBASE
500 // must match order of BC_LEX_KEY_foo etc above
502 struct BcLexKeyword {
505 #define BC_LEX_KW_ENTRY(a, b, c) \
506 { .name8 = a /*, .len = b, .posix = c*/ }
507 static const struct BcLexKeyword bc_lex_kws[20] = {
508 BC_LEX_KW_ENTRY("auto" , 4, 1), // 0
509 BC_LEX_KW_ENTRY("break" , 5, 1), // 1
510 BC_LEX_KW_ENTRY("continue", 8, 0), // 2 note: this one has no terminating NUL
511 BC_LEX_KW_ENTRY("define" , 6, 1), // 3
513 BC_LEX_KW_ENTRY("else" , 4, 0), // 4
514 BC_LEX_KW_ENTRY("for" , 3, 1), // 5
515 BC_LEX_KW_ENTRY("halt" , 4, 0), // 6
516 BC_LEX_KW_ENTRY("ibase" , 5, 1), // 7
518 BC_LEX_KW_ENTRY("if" , 2, 1), // 8
519 BC_LEX_KW_ENTRY("last" , 4, 0), // 9
520 BC_LEX_KW_ENTRY("length" , 6, 1), // 10
521 BC_LEX_KW_ENTRY("limits" , 6, 0), // 11
523 BC_LEX_KW_ENTRY("obase" , 5, 1), // 12
524 BC_LEX_KW_ENTRY("print" , 5, 0), // 13
525 BC_LEX_KW_ENTRY("quit" , 4, 1), // 14
526 BC_LEX_KW_ENTRY("read" , 4, 0), // 15
528 BC_LEX_KW_ENTRY("return" , 6, 1), // 16
529 BC_LEX_KW_ENTRY("scale" , 5, 1), // 17
530 BC_LEX_KW_ENTRY("sqrt" , 4, 1), // 18
531 BC_LEX_KW_ENTRY("while" , 5, 1), // 19
563 typedef BcStatus (*BcLexNext)(struct BcLex *);
565 typedef struct BcLex {
583 #define BC_PARSE_STREND ((char) UCHAR_MAX)
585 #define bc_parse_push(p, i) (bc_vec_pushByte(&(p)->func->code, (char) (i)))
586 #define bc_parse_updateFunc(p, f) \
587 ((p)->func = bc_vec_item(&G.prog.fns, ((p)->fidx = (f))))
589 #define BC_PARSE_REL (1 << 0)
590 #define BC_PARSE_PRINT (1 << 1)
591 #define BC_PARSE_NOCALL (1 << 2)
592 #define BC_PARSE_NOREAD (1 << 3)
593 #define BC_PARSE_ARRAY (1 << 4)
595 #define BC_PARSE_TOP_FLAG_PTR(parse) ((uint8_t *) bc_vec_top(&(parse)->flags))
596 #define BC_PARSE_TOP_FLAG(parse) (*(BC_PARSE_TOP_FLAG_PTR(parse)))
598 #define BC_PARSE_FLAG_FUNC_INNER (1 << 0)
599 #define BC_PARSE_FUNC_INNER(parse) \
600 (BC_PARSE_TOP_FLAG(parse) & BC_PARSE_FLAG_FUNC_INNER)
602 #define BC_PARSE_FLAG_FUNC (1 << 1)
603 #define BC_PARSE_FUNC(parse) (BC_PARSE_TOP_FLAG(parse) & BC_PARSE_FLAG_FUNC)
605 #define BC_PARSE_FLAG_BODY (1 << 2)
606 #define BC_PARSE_BODY(parse) (BC_PARSE_TOP_FLAG(parse) & BC_PARSE_FLAG_BODY)
608 #define BC_PARSE_FLAG_LOOP (1 << 3)
609 #define BC_PARSE_LOOP(parse) (BC_PARSE_TOP_FLAG(parse) & BC_PARSE_FLAG_LOOP)
611 #define BC_PARSE_FLAG_LOOP_INNER (1 << 4)
612 #define BC_PARSE_LOOP_INNER(parse) \
613 (BC_PARSE_TOP_FLAG(parse) & BC_PARSE_FLAG_LOOP_INNER)
615 #define BC_PARSE_FLAG_IF (1 << 5)
616 #define BC_PARSE_IF(parse) (BC_PARSE_TOP_FLAG(parse) & BC_PARSE_FLAG_IF)
618 #define BC_PARSE_FLAG_ELSE (1 << 6)
619 #define BC_PARSE_ELSE(parse) (BC_PARSE_TOP_FLAG(parse) & BC_PARSE_FLAG_ELSE)
621 #define BC_PARSE_FLAG_IF_END (1 << 7)
622 #define BC_PARSE_IF_END(parse) (BC_PARSE_TOP_FLAG(parse) & BC_PARSE_FLAG_IF_END)
624 #define BC_PARSE_CAN_EXEC(parse) \
625 (!(BC_PARSE_TOP_FLAG(parse) & \
626 (BC_PARSE_FLAG_FUNC_INNER | BC_PARSE_FLAG_FUNC | BC_PARSE_FLAG_BODY | \
627 BC_PARSE_FLAG_LOOP | BC_PARSE_FLAG_LOOP_INNER | BC_PARSE_FLAG_IF | \
628 BC_PARSE_FLAG_ELSE | BC_PARSE_FLAG_IF_END)))
630 typedef struct BcParseNext {
635 #define BC_PARSE_NEXT_TOKENS(...) .tokens = { __VA_ARGS__ }
636 #define BC_PARSE_NEXT(a, ...) \
638 .len = (a), BC_PARSE_NEXT_TOKENS(__VA_ARGS__) \
645 typedef BcStatus (*BcParseParse)(struct BcParse *);
647 typedef struct BcParse {
670 static BcStatus bc_lex_token(BcLex *l);
672 #define BC_PARSE_TOP_OP(p) (*((BcLexType *) bc_vec_top(&(p)->ops)))
673 #define BC_PARSE_LEAF(p, rparen) \
674 (((p) >= BC_INST_NUM && (p) <= BC_INST_SQRT) || (rparen) || \
675 (p) == BC_INST_INC_POST || (p) == BC_INST_DEC_POST)
677 // We can calculate the conversion between tokens and exprs by subtracting the
678 // position of the first operator in the lex enum and adding the position of the
679 // first in the expr enum. Note: This only works for binary operators.
680 #define BC_PARSE_TOKEN_INST(t) ((char) ((t) -BC_LEX_NEG + BC_INST_NEG))
682 static BcStatus bc_parse_expr(BcParse *p, uint8_t flags, BcParseNext next);
688 #define DC_PARSE_BUF_LEN ((int) (sizeof(uint32_t) * CHAR_BIT))
690 static BcStatus dc_lex_token(BcLex *l);
692 static BcStatus dc_parse_expr(BcParse *p, uint8_t flags);
696 typedef struct BcProgram {
737 #define BC_PROG_STACK(s, n) ((s)->len >= ((size_t) n))
739 #define BC_PROG_MAIN (0)
740 #define BC_PROG_READ (1)
743 #define BC_PROG_REQ_FUNCS (2)
746 #define BC_PROG_STR(n) (!(n)->num && !(n)->cap)
747 #define BC_PROG_NUM(r, n) \
748 ((r)->t != BC_RESULT_ARRAY && (r)->t != BC_RESULT_STR && !BC_PROG_STR(n))
750 typedef unsigned long (*BcProgramBuiltIn)(BcNum *);
752 static void bc_program_addFunc(char *name, size_t *idx);
753 static void bc_program_reset(void);
755 #define BC_FLAG_X (1 << 0)
756 #define BC_FLAG_W (1 << 1)
757 #define BC_FLAG_V (1 << 2)
758 #define BC_FLAG_S (1 << 3)
759 #define BC_FLAG_Q (1 << 4)
760 #define BC_FLAG_L (1 << 5)
761 #define BC_FLAG_I (1 << 6)
763 #define BC_MAX(a, b) ((a) > (b) ? (a) : (b))
764 #define BC_MIN(a, b) ((a) < (b) ? (a) : (b))
766 #define BC_MAX_OBASE ((unsigned) 999)
767 #define BC_MAX_DIM ((unsigned) INT_MAX)
768 #define BC_MAX_SCALE ((unsigned) UINT_MAX)
769 #define BC_MAX_STRING ((unsigned) UINT_MAX - 1)
770 #define BC_MAX_NAME BC_MAX_STRING
771 #define BC_MAX_NUM BC_MAX_STRING
772 #define BC_MAX_EXP ((unsigned long) LONG_MAX)
773 #define BC_MAX_VARS ((unsigned long) SIZE_MAX - 1)
784 // For error messages. Can be set to current parsed line,
785 // or [TODO] to current executing line (can be before last parsed one)
792 #define G (*ptr_to_globals)
793 #define INIT_G() do { \
794 SET_PTR_TO_GLOBALS(xzalloc(sizeof(G))); \
796 #define G_posix (ENABLE_BC && (option_mask32 & BC_FLAG_S))
797 #define G_warn (ENABLE_BC && (option_mask32 & BC_FLAG_W))
798 #define G_exreg (ENABLE_DC && (option_mask32 & BC_FLAG_X))
799 #define G_interrupt (ENABLE_FEATURE_BC_SIGNALS ? bb_got_signal : 0)
802 #define IS_BC (ENABLE_BC && (!ENABLE_DC || applet_name[0] == 'b'))
804 static void bc_vm_info(void);
808 // This is a bit array that corresponds to token types. An entry is
809 // true if the token is valid in an expression, false otherwise.
811 BC_PARSE_EXPRS_BITS = 0
812 + ((uint64_t)((0 << 0)+(0 << 1)+(1 << 2)+(1 << 3)+(1 << 4)+(1 << 5)+(1 << 6)+(1 << 7)) << (0*8))
813 + ((uint64_t)((1 << 0)+(1 << 1)+(1 << 2)+(1 << 3)+(1 << 4)+(1 << 5)+(1 << 6)+(1 << 7)) << (1*8))
814 + ((uint64_t)((1 << 0)+(1 << 1)+(1 << 2)+(1 << 3)+(1 << 4)+(1 << 5)+(1 << 6)+(1 << 7)) << (2*8))
815 + ((uint64_t)((1 << 0)+(1 << 1)+(1 << 2)+(0 << 3)+(0 << 4)+(1 << 5)+(1 << 6)+(0 << 7)) << (3*8))
816 + ((uint64_t)((0 << 0)+(0 << 1)+(0 << 2)+(0 << 3)+(0 << 4)+(0 << 5)+(1 << 6)+(1 << 7)) << (4*8))
817 + ((uint64_t)((0 << 0)+(0 << 1)+(0 << 2)+(0 << 3)+(0 << 4)+(0 << 5)+(0 << 6)+(1 << 7)) << (5*8))
818 + ((uint64_t)((0 << 0)+(1 << 1)+(1 << 2)+(1 << 3)+(1 << 4)+(0 << 5)+(0 << 6)+(1 << 7)) << (6*8))
819 + ((uint64_t)((0 << 0)+(1 << 1)+(1 << 2)+(0 << 3) ) << (7*8))
821 static ALWAYS_INLINE long bc_parse_exprs(unsigned i)
823 #if ULONG_MAX > 0xffffffff
824 // 64-bit version (will not work correctly for 32-bit longs!)
825 return BC_PARSE_EXPRS_BITS & (1UL << i);
828 unsigned long m = (uint32_t)BC_PARSE_EXPRS_BITS;
830 m = (uint32_t)(BC_PARSE_EXPRS_BITS >> 32);
833 return m & (1UL << i);
837 // This is an array of data for operators that correspond to token types.
838 static const uint8_t bc_parse_ops[] = {
839 #define OP(p,l) ((int)(l) * 0x10 + (p))
840 OP(0, false), OP( 0, false ), // inc dec
843 OP(3, true ), OP( 3, true ), OP( 3, true ), // pow mul div
844 OP(4, true ), OP( 4, true ), // mod + -
845 OP(6, true ), OP( 6, true ), OP( 6, true ), OP( 6, true ), OP( 6, true ), OP( 6, true ), // == <= >= != < >
847 OP(7, true ), OP( 7, true ), // or and
848 OP(5, false), OP( 5, false ), OP( 5, false ), OP( 5, false ), OP( 5, false ), // ^= *= /= %= +=
849 OP(5, false), OP( 5, false ), // -= =
852 #define bc_parse_op_PREC(i) (bc_parse_ops[i] & 0x0f)
853 #define bc_parse_op_LEFT(i) (bc_parse_ops[i] & 0x10)
855 // These identify what tokens can come after expressions in certain cases.
856 static const BcParseNext bc_parse_next_expr =
857 BC_PARSE_NEXT(4, BC_LEX_NLINE, BC_LEX_SCOLON, BC_LEX_RBRACE, BC_LEX_EOF);
858 static const BcParseNext bc_parse_next_param =
859 BC_PARSE_NEXT(2, BC_LEX_RPAREN, BC_LEX_COMMA);
860 static const BcParseNext bc_parse_next_print =
861 BC_PARSE_NEXT(4, BC_LEX_COMMA, BC_LEX_NLINE, BC_LEX_SCOLON, BC_LEX_EOF);
862 static const BcParseNext bc_parse_next_rel = BC_PARSE_NEXT(1, BC_LEX_RPAREN);
863 static const BcParseNext bc_parse_next_elem = BC_PARSE_NEXT(1, BC_LEX_RBRACKET);
864 static const BcParseNext bc_parse_next_for = BC_PARSE_NEXT(1, BC_LEX_SCOLON);
865 static const BcParseNext bc_parse_next_read =
866 BC_PARSE_NEXT(2, BC_LEX_NLINE, BC_LEX_EOF);
870 static const BcLexType dc_lex_regs[] = {
871 BC_LEX_OP_REL_EQ, BC_LEX_OP_REL_LE, BC_LEX_OP_REL_GE, BC_LEX_OP_REL_NE,
872 BC_LEX_OP_REL_LT, BC_LEX_OP_REL_GT, BC_LEX_SCOLON, BC_LEX_COLON,
873 BC_LEX_ELSE, BC_LEX_LOAD, BC_LEX_LOAD_POP, BC_LEX_OP_ASSIGN,
877 static const BcLexType dc_lex_tokens[] = {
878 BC_LEX_OP_MODULUS, BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_LPAREN,
879 BC_LEX_INVALID, BC_LEX_OP_MULTIPLY, BC_LEX_OP_PLUS, BC_LEX_INVALID,
880 BC_LEX_OP_MINUS, BC_LEX_INVALID, BC_LEX_OP_DIVIDE,
881 BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID,
882 BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID,
883 BC_LEX_INVALID, BC_LEX_INVALID,
884 BC_LEX_COLON, BC_LEX_SCOLON, BC_LEX_OP_REL_GT, BC_LEX_OP_REL_EQ,
885 BC_LEX_OP_REL_LT, BC_LEX_KEY_READ, BC_LEX_INVALID,
886 BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID,
887 BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_EQ_NO_REG, BC_LEX_INVALID,
888 BC_LEX_KEY_IBASE, BC_LEX_INVALID, BC_LEX_KEY_SCALE, BC_LEX_LOAD_POP,
889 BC_LEX_INVALID, BC_LEX_OP_BOOL_NOT, BC_LEX_KEY_OBASE, BC_LEX_PRINT_STREAM,
890 BC_LEX_NQUIT, BC_LEX_POP, BC_LEX_STORE_PUSH, BC_LEX_INVALID, BC_LEX_INVALID,
891 BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_SCALE_FACTOR, BC_LEX_INVALID,
892 BC_LEX_KEY_LENGTH, BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID,
893 BC_LEX_OP_POWER, BC_LEX_NEG, BC_LEX_INVALID,
894 BC_LEX_ASCIIFY, BC_LEX_INVALID, BC_LEX_CLEAR_STACK, BC_LEX_DUPLICATE,
895 BC_LEX_ELSE, BC_LEX_PRINT_STACK, BC_LEX_INVALID, BC_LEX_INVALID,
896 BC_LEX_STORE_IBASE, BC_LEX_INVALID, BC_LEX_STORE_SCALE, BC_LEX_LOAD,
897 BC_LEX_INVALID, BC_LEX_PRINT_POP, BC_LEX_STORE_OBASE, BC_LEX_KEY_PRINT,
898 BC_LEX_KEY_QUIT, BC_LEX_SWAP, BC_LEX_OP_ASSIGN, BC_LEX_INVALID,
899 BC_LEX_INVALID, BC_LEX_KEY_SQRT, BC_LEX_INVALID, BC_LEX_EXECUTE,
900 BC_LEX_INVALID, BC_LEX_STACK_LEVEL,
901 BC_LEX_LBRACE, BC_LEX_OP_MODEXP, BC_LEX_INVALID, BC_LEX_OP_DIVMOD,
905 static const BcInst dc_parse_insts[] = {
906 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID, BC_INST_REL_GE,
907 BC_INST_INVALID, BC_INST_POWER, BC_INST_MULTIPLY, BC_INST_DIVIDE,
908 BC_INST_MODULUS, BC_INST_PLUS, BC_INST_MINUS,
909 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID,
910 BC_INST_INVALID, BC_INST_INVALID,
911 BC_INST_BOOL_NOT, BC_INST_INVALID, BC_INST_INVALID,
912 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID,
913 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID,
914 BC_INST_INVALID, BC_INST_INVALID, BC_INST_REL_GT, BC_INST_INVALID,
915 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID, BC_INST_REL_GE,
916 BC_INST_INVALID, BC_INST_INVALID,
917 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID,
918 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID,
919 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID, BC_INST_IBASE,
920 BC_INST_INVALID, BC_INST_INVALID, BC_INST_LENGTH, BC_INST_INVALID,
921 BC_INST_OBASE, BC_INST_PRINT, BC_INST_QUIT, BC_INST_INVALID,
922 BC_INST_INVALID, BC_INST_SCALE, BC_INST_SQRT, BC_INST_INVALID,
923 BC_INST_REL_EQ, BC_INST_MODEXP, BC_INST_DIVMOD, BC_INST_INVALID,
924 BC_INST_INVALID, BC_INST_EXECUTE, BC_INST_PRINT_STACK, BC_INST_CLEAR_STACK,
925 BC_INST_STACK_LEN, BC_INST_DUPLICATE, BC_INST_SWAP, BC_INST_POP,
926 BC_INST_ASCIIFY, BC_INST_PRINT_STREAM, BC_INST_INVALID, BC_INST_INVALID,
927 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID,
928 BC_INST_PRINT, BC_INST_NQUIT, BC_INST_SCALE_FUNC,
932 static const BcNumBinaryOp bc_program_ops[] = {
933 bc_num_pow, bc_num_mul, bc_num_div, bc_num_mod, bc_num_add, bc_num_sub,
936 static void fflush_and_check(void)
939 if (ferror(stdout) || ferror(stderr))
940 bb_perror_msg_and_die("output error");
943 static void quit(void) NORETURN;
944 static void quit(void)
947 bb_perror_msg_and_die("input error");
952 static void bc_verror_msg(const char *fmt, va_list p)
954 const char *sv = sv; /* for compiler */
957 applet_name = xasprintf("%s: %s:%u", applet_name, G.prog.file, G.err_line);
959 bb_verror_msg(fmt, p, NULL);
961 free((char*)applet_name);
966 static NOINLINE int bc_error_fmt(const char *fmt, ...)
971 bc_verror_msg(fmt, p);
976 return BC_STATUS_FAILURE;
979 static NOINLINE int bc_posix_error_fmt(const char *fmt, ...)
983 // Are non-POSIX constructs totally ok?
984 if (!(option_mask32 & (BC_FLAG_S|BC_FLAG_W)))
985 return BC_STATUS_SUCCESS; // yes
988 bc_verror_msg(fmt, p);
991 // Do we treat non-POSIX constructs as errors?
992 if (!(option_mask32 & BC_FLAG_S))
993 return BC_STATUS_SUCCESS; // no, it's a warning
996 return BC_STATUS_FAILURE;
999 // We use error functions with "return bc_error(FMT[, PARAMS])" idiom.
1000 // This idiom begs for tail-call optimization, but for it to work,
1001 // function must not have calller-cleaned parameters on stack.
1002 // Unfortunately, vararg functions do exactly that on most arches.
1003 // Thus, these shims for the cases when we have no PARAMS:
1004 static int bc_error(const char *msg)
1006 return bc_error_fmt("%s", msg);
1008 static int bc_posix_error(const char *msg)
1010 return bc_posix_error_fmt("%s", msg);
1012 static int bc_POSIX_does_not_allow(const char *msg)
1014 return bc_posix_error_fmt("%s%s", "POSIX does not allow ", msg);
1016 static int bc_POSIX_does_not_allow_bool_ops_this_is_bad(const char *msg)
1018 return bc_posix_error_fmt("%s%s %s", "POSIX does not allow ", "boolean operators; the following is bad:", msg);
1020 static int bc_POSIX_does_not_allow_empty_X_expression_in_for(const char *msg)
1022 return bc_posix_error_fmt("%san empty %s expression in a for loop", "POSIX does not allow ", msg);
1024 static int bc_error_bad_character(char c)
1026 return bc_error_fmt("bad character '%c'", c);
1028 static int bc_error_bad_expression(void)
1030 return bc_error("bad expression");
1032 static int bc_error_bad_token(void)
1034 return bc_error("bad token");
1036 static int bc_error_stack_has_too_few_elements(void)
1038 return bc_error("stack has too few elements");
1040 static int bc_error_variable_is_wrong_type(void)
1042 return bc_error("variable is wrong type");
1044 static int bc_error_nested_read_call(void)
1046 return bc_error("read() call inside of a read() call");
1049 static void bc_vec_grow(BcVec *v, size_t n)
1051 size_t cap = v->cap * 2;
1052 while (cap < v->len + n) cap *= 2;
1053 v->v = xrealloc(v->v, v->size * cap);
1057 static void bc_vec_init(BcVec *v, size_t esize, BcVecFree dtor)
1060 v->cap = BC_VEC_START_CAP;
1063 v->v = xmalloc(esize * BC_VEC_START_CAP);
1066 static void bc_char_vec_init(BcVec *v)
1068 bc_vec_init(v, sizeof(char), NULL);
1071 static void bc_vec_expand(BcVec *v, size_t req)
1074 v->v = xrealloc(v->v, v->size * req);
1079 static void bc_vec_npop(BcVec *v, size_t n)
1084 size_t len = v->len - n;
1085 while (v->len > len) v->dtor(v->v + (v->size * --v->len));
1089 static void bc_vec_pop_all(BcVec *v)
1091 bc_vec_npop(v, v->len);
1094 static void bc_vec_push(BcVec *v, const void *data)
1096 if (v->len + 1 > v->cap) bc_vec_grow(v, 1);
1097 memmove(v->v + (v->size * v->len), data, v->size);
1101 static void bc_vec_pushByte(BcVec *v, char data)
1103 bc_vec_push(v, &data);
1106 static void bc_vec_pushZeroByte(BcVec *v)
1108 //bc_vec_pushByte(v, '\0');
1110 bc_vec_push(v, &const_int_0);
1113 static void bc_vec_pushAt(BcVec *v, const void *data, size_t idx)
1116 bc_vec_push(v, data);
1121 if (v->len == v->cap) bc_vec_grow(v, 1);
1123 ptr = v->v + v->size * idx;
1125 memmove(ptr + v->size, ptr, v->size * (v->len++ - idx));
1126 memmove(ptr, data, v->size);
1130 static void bc_vec_string(BcVec *v, size_t len, const char *str)
1133 bc_vec_expand(v, len + 1);
1134 memcpy(v->v, str, len);
1137 bc_vec_pushZeroByte(v);
1140 static void bc_vec_concat(BcVec *v, const char *str)
1144 if (v->len == 0) bc_vec_pushZeroByte(v);
1146 len = v->len + strlen(str);
1148 if (v->cap < len) bc_vec_grow(v, len - v->len);
1154 static void *bc_vec_item(const BcVec *v, size_t idx)
1156 return v->v + v->size * idx;
1159 static void *bc_vec_item_rev(const BcVec *v, size_t idx)
1161 return v->v + v->size * (v->len - idx - 1);
1164 static void bc_vec_free(void *vec)
1166 BcVec *v = (BcVec *) vec;
1171 static size_t bc_map_find(const BcVec *v, const void *ptr)
1173 size_t low = 0, high = v->len;
1175 while (low < high) {
1177 size_t mid = (low + high) / 2;
1178 BcId *id = bc_vec_item(v, mid);
1179 int result = bc_id_cmp(ptr, id);
1183 else if (result < 0)
1192 static int bc_map_insert(BcVec *v, const void *ptr, size_t *i)
1194 size_t n = *i = bc_map_find(v, ptr);
1197 bc_vec_push(v, ptr);
1198 else if (!bc_id_cmp(ptr, bc_vec_item(v, n)))
1199 return 0; // "was not inserted"
1201 bc_vec_pushAt(v, ptr, n);
1202 return 1; // "was inserted"
1205 static size_t bc_map_index(const BcVec *v, const void *ptr)
1207 size_t i = bc_map_find(v, ptr);
1208 if (i >= v->len) return BC_VEC_INVALID_IDX;
1209 return bc_id_cmp(ptr, bc_vec_item(v, i)) ? BC_VEC_INVALID_IDX : i;
1212 static BcStatus bc_read_line(BcVec *vec, const char *prompt)
1220 bc_vec_pop_all(vec);
1223 #if ENABLE_FEATURE_BC_SIGNALS
1224 if (bb_got_signal) { // ^C was pressed
1226 bb_got_signal = 0; // resets G_interrupt to zero
1228 ? "\ninterrupt (type \"quit\" to exit)\n"
1229 : "\ninterrupt (type \"q\" to exit)\n"
1233 if (G.ttyin && !G_posix)
1234 fputs(prompt, stderr);
1236 #if ENABLE_FEATURE_BC_SIGNALS
1242 #if ENABLE_FEATURE_BC_SIGNALS
1243 // Both conditions appear simultaneously, check both just in case
1244 if (errno == EINTR || bb_got_signal) {
1251 quit(); // this emits error message
1253 // Note: EOF does not append '\n', therefore:
1254 // printf 'print 123\n' | bc - works
1255 // printf 'print 123' | bc - fails (syntax error)
1259 if ((i < ' ' && i != '\t' && i != '\r' && i != '\n') // also allow '\v' '\f'?
1262 // Bad chars on this line, ignore entire line
1263 bc_error_fmt("illegal character 0x%02x", i);
1266 bc_vec_pushByte(vec, (char)i);
1267 } while (i != '\n');
1268 } while (bad_chars);
1270 bc_vec_pushZeroByte(vec);
1272 return BC_STATUS_SUCCESS;
1275 static char* bc_read_file(const char *path)
1278 size_t size = ((size_t) -1);
1281 buf = xmalloc_open_read_close(path, &size);
1283 for (i = 0; i < size; ++i) {
1285 if ((c < ' ' && c != '\t' && c != '\r' && c != '\n') // also allow '\v' '\f'?
1297 static void bc_args(int argc, char **argv)
1303 #if ENABLE_FEATURE_BC_LONG_OPTIONS
1304 opts = getopt32long(argv, "xwvsqli",
1305 "extended-register\0" No_argument "x"
1306 "warn\0" No_argument "w"
1307 "version\0" No_argument "v"
1308 "standard\0" No_argument "s"
1309 "quiet\0" No_argument "q"
1310 "mathlib\0" No_argument "l"
1311 "interactive\0" No_argument "i"
1314 opts = getopt32(argv, "xwvsqli");
1316 if (getenv("POSIXLY_CORRECT"))
1317 option_mask32 |= BC_FLAG_S;
1319 if (opts & BC_FLAG_V) bc_vm_info();
1320 // should not be necessary, getopt32() handles this??
1321 //if (argv[optind] && !strcmp(argv[optind], "--")) ++optind;
1323 for (i = optind; i < argc; ++i)
1324 bc_vec_push(&G.files, argv + i);
1327 static void bc_num_setToZero(BcNum *n, size_t scale)
1334 static void bc_num_zero(BcNum *n)
1336 bc_num_setToZero(n, 0);
1339 static void bc_num_one(BcNum *n)
1341 bc_num_setToZero(n, 0);
1346 static void bc_num_ten(BcNum *n)
1348 bc_num_setToZero(n, 0);
1354 static void bc_num_subArrays(BcDig *restrict a, BcDig *restrict b,
1358 for (i = 0; i < len; ++i) {
1359 for (a[i] -= b[i], j = 0; a[i + j] < 0;) {
1366 static ssize_t bc_num_compare(BcDig *restrict a, BcDig *restrict b, size_t len)
1370 for (i = len - 1; i < len && !(c = a[i] - b[i]); --i);
1371 return BC_NUM_NEG(i + 1, c < 0);
1374 static ssize_t bc_num_cmp(BcNum *a, BcNum *b)
1376 size_t i, min, a_int, b_int, diff;
1377 BcDig *max_num, *min_num;
1378 bool a_max, neg = false;
1381 if (a == b) return 0;
1382 if (a->len == 0) return BC_NUM_NEG(!!b->len, !b->neg);
1383 if (b->len == 0) return BC_NUM_NEG(1, a->neg);
1393 a_int = BC_NUM_INT(a);
1394 b_int = BC_NUM_INT(b);
1396 a_max = (a->rdx > b->rdx);
1398 if (a_int != 0) return (ssize_t) a_int;
1402 diff = a->rdx - b->rdx;
1403 max_num = a->num + diff;
1408 diff = b->rdx - a->rdx;
1409 max_num = b->num + diff;
1413 cmp = bc_num_compare(max_num, min_num, b_int + min);
1414 if (cmp != 0) return BC_NUM_NEG(cmp, (!a_max) != neg);
1416 for (max_num -= diff, i = diff - 1; i < diff; --i) {
1417 if (max_num[i]) return BC_NUM_NEG(1, (!a_max) != neg);
1423 static void bc_num_truncate(BcNum *n, size_t places)
1425 if (places == 0) return;
1431 memmove(n->num, n->num + places, n->len * sizeof(BcDig));
1435 static void bc_num_extend(BcNum *n, size_t places)
1437 size_t len = n->len + places;
1441 if (n->cap < len) bc_num_expand(n, len);
1443 memmove(n->num + places, n->num, sizeof(BcDig) * n->len);
1444 memset(n->num, 0, sizeof(BcDig) * places);
1451 static void bc_num_clean(BcNum *n)
1453 while (n->len > 0 && n->num[n->len - 1] == 0) --n->len;
1456 else if (n->len < n->rdx)
1460 static void bc_num_retireMul(BcNum *n, size_t scale, bool neg1, bool neg2)
1463 bc_num_extend(n, scale - n->rdx);
1465 bc_num_truncate(n, n->rdx - scale);
1468 if (n->len != 0) n->neg = !neg1 != !neg2;
1471 static void bc_num_split(BcNum *restrict n, size_t idx, BcNum *restrict a,
1476 b->len = n->len - idx;
1478 a->rdx = b->rdx = 0;
1480 memcpy(b->num, n->num + idx, b->len * sizeof(BcDig));
1481 memcpy(a->num, n->num, idx * sizeof(BcDig));
1492 static BcStatus bc_num_shift(BcNum *n, size_t places)
1494 if (places == 0 || n->len == 0) return BC_STATUS_SUCCESS;
1495 if (places + n->len > BC_MAX_NUM)
1496 return bc_error("number too long: must be [1, BC_NUM_MAX]");
1498 if (n->rdx >= places)
1501 bc_num_extend(n, places - n->rdx);
1507 return BC_STATUS_SUCCESS;
1510 static BcStatus bc_num_inv(BcNum *a, BcNum *b, size_t scale)
1519 return bc_num_div(&one, a, b, scale);
1522 static BcStatus bc_num_a(BcNum *a, BcNum *b, BcNum *restrict c, size_t sub)
1524 BcDig *ptr, *ptr_a, *ptr_b, *ptr_c;
1525 size_t i, max, min_rdx, min_int, diff, a_int, b_int;
1528 // Because this function doesn't need to use scale (per the bc spec),
1529 // I am hijacking it to say whether it's doing an add or a subtract.
1533 if (sub && c->len) c->neg = !c->neg;
1534 return BC_STATUS_SUCCESS;
1536 else if (b->len == 0) {
1538 return BC_STATUS_SUCCESS;
1542 c->rdx = BC_MAX(a->rdx, b->rdx);
1543 min_rdx = BC_MIN(a->rdx, b->rdx);
1546 if (a->rdx > b->rdx) {
1547 diff = a->rdx - b->rdx;
1549 ptr_a = a->num + diff;
1553 diff = b->rdx - a->rdx;
1556 ptr_b = b->num + diff;
1559 for (ptr_c = c->num, i = 0; i < diff; ++i, ++c->len) ptr_c[i] = ptr[i];
1562 a_int = BC_NUM_INT(a);
1563 b_int = BC_NUM_INT(b);
1565 if (a_int > b_int) {
1576 for (carry = 0, i = 0; i < min_rdx + min_int; ++i, ++c->len) {
1577 in = ((int) ptr_a[i]) + ((int) ptr_b[i]) + carry;
1579 ptr_c[i] = (BcDig)(in % 10);
1582 for (; i < max + min_rdx; ++i, ++c->len) {
1583 in = ((int) ptr[i]) + carry;
1585 ptr_c[i] = (BcDig)(in % 10);
1588 if (carry != 0) c->num[c->len++] = (BcDig) carry;
1590 return BC_STATUS_SUCCESS; // can't make void, see bc_num_binary()
1593 static BcStatus bc_num_s(BcNum *a, BcNum *b, BcNum *restrict c, size_t sub)
1596 BcNum *minuend, *subtrahend;
1598 bool aneg, bneg, neg;
1600 // Because this function doesn't need to use scale (per the bc spec),
1601 // I am hijacking it to say whether it's doing an add or a subtract.
1605 if (sub && c->len) c->neg = !c->neg;
1606 return BC_STATUS_SUCCESS;
1608 else if (b->len == 0) {
1610 return BC_STATUS_SUCCESS;
1615 a->neg = b->neg = false;
1617 cmp = bc_num_cmp(a, b);
1623 bc_num_setToZero(c, BC_MAX(a->rdx, b->rdx));
1624 return BC_STATUS_SUCCESS;
1633 if (sub) neg = !neg;
1638 bc_num_copy(c, minuend);
1641 if (c->rdx < subtrahend->rdx) {
1642 bc_num_extend(c, subtrahend->rdx - c->rdx);
1646 start = c->rdx - subtrahend->rdx;
1648 bc_num_subArrays(c->num + start, subtrahend->num, subtrahend->len);
1652 return BC_STATUS_SUCCESS; // can't make void, see bc_num_binary()
1655 static BcStatus bc_num_k(BcNum *restrict a, BcNum *restrict b,
1659 size_t max = BC_MAX(a->len, b->len), max2 = (max + 1) / 2;
1660 BcNum l1, h1, l2, h2, m2, m1, z0, z1, z2, temp;
1663 if (a->len == 0 || b->len == 0) {
1665 return BC_STATUS_SUCCESS;
1667 aone = BC_NUM_ONE(a);
1668 if (aone || BC_NUM_ONE(b)) {
1669 bc_num_copy(c, aone ? b : a);
1670 return BC_STATUS_SUCCESS;
1673 if (a->len + b->len < BC_NUM_KARATSUBA_LEN ||
1674 a->len < BC_NUM_KARATSUBA_LEN || b->len < BC_NUM_KARATSUBA_LEN)
1679 bc_num_expand(c, a->len + b->len + 1);
1681 memset(c->num, 0, sizeof(BcDig) * c->cap);
1684 for (i = 0; i < b->len; ++i) {
1687 for (j = 0; j < a->len; ++j) {
1688 unsigned in = c->num[i + j];
1689 in += ((unsigned) a->num[j]) * ((unsigned) b->num[i]) + carry;
1690 // note: compilers prefer _unsigned_ div/const
1692 c->num[i + j] = (BcDig)(in % 10);
1695 c->num[i + j] += (BcDig) carry;
1696 len = BC_MAX(len, i + j + !!carry);
1699 // a*a <- without check below, this will not be interruptible
1700 if (G_interrupt) return BC_STATUS_FAILURE;
1705 return BC_STATUS_SUCCESS;
1708 bc_num_init(&l1, max);
1709 bc_num_init(&h1, max);
1710 bc_num_init(&l2, max);
1711 bc_num_init(&h2, max);
1712 bc_num_init(&m1, max);
1713 bc_num_init(&m2, max);
1714 bc_num_init(&z0, max);
1715 bc_num_init(&z1, max);
1716 bc_num_init(&z2, max);
1717 bc_num_init(&temp, max + max);
1719 bc_num_split(a, max2, &l1, &h1);
1720 bc_num_split(b, max2, &l2, &h2);
1722 s = bc_num_add(&h1, &l1, &m1, 0);
1724 s = bc_num_add(&h2, &l2, &m2, 0);
1727 s = bc_num_k(&h1, &h2, &z0);
1729 s = bc_num_k(&m1, &m2, &z1);
1731 s = bc_num_k(&l1, &l2, &z2);
1734 s = bc_num_sub(&z1, &z0, &temp, 0);
1736 s = bc_num_sub(&temp, &z2, &z1, 0);
1739 s = bc_num_shift(&z0, max2 * 2);
1741 s = bc_num_shift(&z1, max2);
1743 s = bc_num_add(&z0, &z1, &temp, 0);
1745 s = bc_num_add(&temp, &z2, c, 0);
1761 static BcStatus bc_num_m(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale)
1765 size_t maxrdx = BC_MAX(a->rdx, b->rdx);
1767 scale = BC_MAX(scale, a->rdx);
1768 scale = BC_MAX(scale, b->rdx);
1769 scale = BC_MIN(a->rdx + b->rdx, scale);
1770 maxrdx = BC_MAX(maxrdx, scale);
1772 bc_num_init(&cpa, a->len);
1773 bc_num_init(&cpb, b->len);
1775 bc_num_copy(&cpa, a);
1776 bc_num_copy(&cpb, b);
1777 cpa.neg = cpb.neg = false;
1779 s = bc_num_shift(&cpa, maxrdx);
1781 s = bc_num_shift(&cpb, maxrdx);
1783 s = bc_num_k(&cpa, &cpb, c);
1787 bc_num_expand(c, c->len + maxrdx);
1789 if (c->len < maxrdx) {
1790 memset(c->num + c->len, 0, (c->cap - c->len) * sizeof(BcDig));
1795 bc_num_retireMul(c, scale, a->neg, b->neg);
1803 static BcStatus bc_num_d(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale)
1805 BcStatus s = BC_STATUS_SUCCESS;
1812 return bc_error("divide by zero");
1813 else if (a->len == 0) {
1814 bc_num_setToZero(c, scale);
1815 return BC_STATUS_SUCCESS;
1817 else if (BC_NUM_ONE(b)) {
1819 bc_num_retireMul(c, scale, a->neg, b->neg);
1820 return BC_STATUS_SUCCESS;
1823 bc_num_init(&cp, BC_NUM_MREQ(a, b, scale));
1824 bc_num_copy(&cp, a);
1828 bc_num_expand(&cp, len + 2);
1829 bc_num_extend(&cp, len - cp.len);
1832 if (b->rdx > cp.rdx) bc_num_extend(&cp, b->rdx - cp.rdx);
1834 if (scale > cp.rdx) bc_num_extend(&cp, scale - cp.rdx);
1836 if (b->rdx == b->len) {
1837 for (i = 0; zero && i < len; ++i) zero = !b->num[len - i - 1];
1841 if (cp.cap == cp.len) bc_num_expand(&cp, cp.len + 1);
1843 // We want an extra zero in front to make things simpler.
1844 cp.num[cp.len++] = 0;
1847 bc_num_expand(c, cp.len);
1850 memset(c->num + end, 0, (c->cap - end) * sizeof(BcDig));
1855 for (i = end - 1; !s && i < end; --i) {
1857 for (q = 0; (!s && n[len] != 0) || bc_num_compare(n, p, len) >= 0; ++q)
1858 bc_num_subArrays(n, p, len);
1862 // 1/a <- without check below, this will not be interruptible
1864 s = BC_STATUS_FAILURE;
1869 bc_num_retireMul(c, scale, a->neg, b->neg);
1875 static BcStatus bc_num_r(BcNum *a, BcNum *b, BcNum *restrict c,
1876 BcNum *restrict d, size_t scale, size_t ts)
1883 return bc_error("divide by zero");
1886 bc_num_setToZero(d, ts);
1887 return BC_STATUS_SUCCESS;
1890 bc_num_init(&temp, d->cap);
1891 s = bc_num_d(a, b, c, scale);
1894 if (scale != 0) scale = ts;
1896 s = bc_num_m(c, b, &temp, scale);
1898 s = bc_num_sub(a, &temp, d, scale);
1901 if (ts > d->rdx && d->len) bc_num_extend(d, ts - d->rdx);
1904 bc_num_retireMul(d, ts, a->neg, b->neg);
1912 static BcStatus bc_num_rem(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale)
1916 size_t ts = BC_MAX(scale + b->rdx, a->rdx), len = BC_NUM_MREQ(a, b, ts);
1918 bc_num_init(&c1, len);
1919 s = bc_num_r(a, b, &c1, c, scale, ts);
1925 static BcStatus bc_num_p(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale)
1927 BcStatus s = BC_STATUS_SUCCESS;
1930 size_t i, powrdx, resrdx;
1933 if (b->rdx) return bc_error("non integer number");
1937 return BC_STATUS_SUCCESS;
1939 else if (a->len == 0) {
1940 bc_num_setToZero(c, scale);
1941 return BC_STATUS_SUCCESS;
1943 else if (BC_NUM_ONE(b)) {
1947 s = bc_num_inv(a, c, scale);
1954 s = bc_num_ulong(b, &pow);
1957 bc_num_init(©, a->len);
1958 bc_num_copy(©, a);
1960 if (!neg) scale = BC_MIN(a->rdx * pow, BC_MAX(scale, a->rdx));
1964 for (powrdx = a->rdx; !(pow & 1); pow >>= 1) {
1966 s = bc_num_mul(©, ©, ©, powrdx);
1968 // Not needed: bc_num_mul() has a check for ^C:
1969 //if (G_interrupt) {
1970 // s = BC_STATUS_FAILURE;
1975 bc_num_copy(c, ©);
1977 for (resrdx = powrdx, pow >>= 1; pow != 0; pow >>= 1) {
1980 s = bc_num_mul(©, ©, ©, powrdx);
1985 s = bc_num_mul(c, ©, c, resrdx);
1988 // Not needed: bc_num_mul() has a check for ^C:
1989 //if (G_interrupt) {
1990 // s = BC_STATUS_FAILURE;
1996 s = bc_num_inv(c, c, scale);
2000 if (c->rdx > scale) bc_num_truncate(c, c->rdx - scale);
2002 // We can't use bc_num_clean() here.
2003 for (zero = true, i = 0; zero && i < c->len; ++i) zero = !c->num[i];
2004 if (zero) bc_num_setToZero(c, scale);
2011 static BcStatus bc_num_binary(BcNum *a, BcNum *b, BcNum *c, size_t scale,
2012 BcNumBinaryOp op, size_t req)
2015 BcNum num2, *ptr_a, *ptr_b;
2020 memcpy(ptr_a, c, sizeof(BcNum));
2029 memcpy(ptr_b, c, sizeof(BcNum));
2037 bc_num_init(c, req);
2039 bc_num_expand(c, req);
2041 s = op(ptr_a, ptr_b, c, scale);
2043 if (init) bc_num_free(&num2);
2048 static bool bc_num_strValid(const char *val, size_t base)
2051 bool small, radix = false;
2052 size_t i, len = strlen(val);
2054 if (!len) return true;
2057 b = (BcDig)(small ? base + '0' : base - 10 + 'A');
2059 for (i = 0; i < len; ++i) {
2065 if (radix) return false;
2071 if (c < '0' || (small && c >= b) || (c > '9' && (c < 'A' || c >= b)))
2078 static void bc_num_parseDecimal(BcNum *n, const char *val)
2084 for (i = 0; val[i] == '0'; ++i);
2091 for (i = 0; zero && i < len; ++i) zero = val[i] == '0' || val[i] == '.';
2092 bc_num_expand(n, len);
2095 ptr = strchr(val, '.');
2099 n->rdx = (size_t)((val + len) - (ptr + 1));
2102 for (i = len - 1; i < len; ++n->len, i -= 1 + (i && val[i - 1] == '.'))
2103 n->num[n->len] = val[i] - '0';
2107 static void bc_num_parseBase(BcNum *n, const char *val, BcNum *base)
2110 BcNum temp, mult, result;
2114 size_t i, digits, len = strlen(val);
2118 for (i = 0; zero && i < len; ++i) zero = (val[i] == '.' || val[i] == '0');
2121 bc_num_init(&temp, BC_NUM_DEF_SIZE);
2122 bc_num_init(&mult, BC_NUM_DEF_SIZE);
2124 for (i = 0; i < len; ++i) {
2127 if (c == '.') break;
2129 v = (unsigned long) (c <= '9' ? c - '0' : c - 'A' + 10);
2131 s = bc_num_mul(n, base, &mult, 0);
2132 if (s) goto int_err;
2133 bc_num_ulong2num(&temp, v);
2134 s = bc_num_add(&mult, &temp, n, 0);
2135 if (s) goto int_err;
2140 if (c == 0) goto int_err;
2143 bc_num_init(&result, base->len);
2144 bc_num_zero(&result);
2147 for (i += 1, digits = 0; i < len; ++i, ++digits) {
2152 v = (unsigned long) (c <= '9' ? c - '0' : c - 'A' + 10);
2154 s = bc_num_mul(&result, base, &result, 0);
2156 bc_num_ulong2num(&temp, v);
2157 s = bc_num_add(&result, &temp, &result, 0);
2159 s = bc_num_mul(&mult, base, &mult, 0);
2163 s = bc_num_div(&result, &mult, &result, digits);
2165 s = bc_num_add(n, &result, n, digits);
2169 if (n->rdx < digits) bc_num_extend(n, digits - n->rdx);
2175 bc_num_free(&result);
2181 static void bc_num_printNewline(size_t *nchars, size_t line_len)
2183 if (*nchars == line_len - 1) {
2191 static void bc_num_printChar(size_t num, size_t width, bool radix,
2192 size_t *nchars, size_t line_len)
2194 (void) radix, (void) line_len;
2195 bb_putchar((char) num);
2196 *nchars = *nchars + width;
2200 static void bc_num_printDigits(size_t num, size_t width, bool radix,
2201 size_t *nchars, size_t line_len)
2205 bc_num_printNewline(nchars, line_len);
2206 bb_putchar(radix ? '.' : ' ');
2209 bc_num_printNewline(nchars, line_len);
2210 for (exp = 0, pow = 1; exp < width - 1; ++exp, pow *= 10)
2213 for (exp = 0; exp < width; pow /= 10, ++(*nchars), ++exp) {
2215 bc_num_printNewline(nchars, line_len);
2218 bb_putchar(((char) dig) + '0');
2222 static void bc_num_printHex(size_t num, size_t width, bool radix,
2223 size_t *nchars, size_t line_len)
2226 bc_num_printNewline(nchars, line_len);
2231 bc_num_printNewline(nchars, line_len);
2232 bb_putchar(bb_hexdigits_upcase[num]);
2233 *nchars = *nchars + width;
2236 static void bc_num_printDecimal(BcNum *n, size_t *nchars, size_t len)
2238 size_t i, rdx = n->rdx - 1;
2240 if (n->neg) bb_putchar('-');
2241 (*nchars) += n->neg;
2243 for (i = n->len - 1; i < n->len; --i)
2244 bc_num_printHex((size_t) n->num[i], 1, i == rdx, nchars, len);
2247 static BcStatus bc_num_printNum(BcNum *n, BcNum *base, size_t width,
2248 size_t *nchars, size_t len, BcNumDigitOp print)
2252 BcNum intp, fracp, digit, frac_len;
2253 unsigned long dig, *ptr;
2258 print(0, width, false, nchars, len);
2259 return BC_STATUS_SUCCESS;
2262 bc_vec_init(&stack, sizeof(long), NULL);
2263 bc_num_init(&intp, n->len);
2264 bc_num_init(&fracp, n->rdx);
2265 bc_num_init(&digit, width);
2266 bc_num_init(&frac_len, BC_NUM_INT(n));
2267 bc_num_copy(&intp, n);
2268 bc_num_one(&frac_len);
2270 bc_num_truncate(&intp, intp.rdx);
2271 s = bc_num_sub(n, &intp, &fracp, 0);
2274 while (intp.len != 0) {
2275 s = bc_num_divmod(&intp, base, &intp, &digit, 0);
2277 s = bc_num_ulong(&digit, &dig);
2279 bc_vec_push(&stack, &dig);
2282 for (i = 0; i < stack.len; ++i) {
2283 ptr = bc_vec_item_rev(&stack, i);
2284 print(*ptr, width, false, nchars, len);
2287 if (!n->rdx) goto err;
2289 for (radix = true; frac_len.len <= n->rdx; radix = false) {
2290 s = bc_num_mul(&fracp, base, &fracp, n->rdx);
2292 s = bc_num_ulong(&fracp, &dig);
2294 bc_num_ulong2num(&intp, dig);
2295 s = bc_num_sub(&fracp, &intp, &fracp, 0);
2297 print(dig, width, radix, nchars, len);
2298 s = bc_num_mul(&frac_len, base, &frac_len, 0);
2303 bc_num_free(&frac_len);
2304 bc_num_free(&digit);
2305 bc_num_free(&fracp);
2307 bc_vec_free(&stack);
2311 static BcStatus bc_num_printBase(BcNum *n, BcNum *base, size_t base_t,
2312 size_t *nchars, size_t line_len)
2319 if (neg) bb_putchar('-');
2324 if (base_t <= BC_NUM_MAX_IBASE) {
2326 print = bc_num_printHex;
2329 for (i = base_t - 1, width = 0; i != 0; i /= 10, ++width);
2330 print = bc_num_printDigits;
2333 s = bc_num_printNum(n, base, width, nchars, line_len, print);
2340 static BcStatus bc_num_stream(BcNum *n, BcNum *base, size_t *nchars, size_t len)
2342 return bc_num_printNum(n, base, 1, nchars, len, bc_num_printChar);
2346 static void bc_num_init(BcNum *n, size_t req)
2348 req = req >= BC_NUM_DEF_SIZE ? req : BC_NUM_DEF_SIZE;
2349 memset(n, 0, sizeof(BcNum));
2350 n->num = xmalloc(req);
2354 static void bc_num_expand(BcNum *n, size_t req)
2356 req = req >= BC_NUM_DEF_SIZE ? req : BC_NUM_DEF_SIZE;
2358 n->num = xrealloc(n->num, req);
2363 static void bc_num_free(void *num)
2365 free(((BcNum *) num)->num);
2368 static void bc_num_copy(BcNum *d, BcNum *s)
2371 bc_num_expand(d, s->cap);
2375 memcpy(d->num, s->num, sizeof(BcDig) * d->len);
2379 static BcStatus bc_num_parse(BcNum *n, const char *val, BcNum *base,
2382 if (!bc_num_strValid(val, base_t))
2383 return bc_error("bad number string");
2386 bc_num_parseDecimal(n, val);
2388 bc_num_parseBase(n, val, base);
2390 return BC_STATUS_SUCCESS;
2393 static BcStatus bc_num_print(BcNum *n, BcNum *base, size_t base_t, bool newline,
2394 size_t *nchars, size_t line_len)
2396 BcStatus s = BC_STATUS_SUCCESS;
2398 bc_num_printNewline(nchars, line_len);
2404 else if (base_t == 10)
2405 bc_num_printDecimal(n, nchars, line_len);
2407 s = bc_num_printBase(n, base, base_t, nchars, line_len);
2417 static BcStatus bc_num_ulong(BcNum *n, unsigned long *result)
2422 if (n->neg) return bc_error("negative number");
2424 for (*result = 0, pow = 1, i = n->rdx; i < n->len; ++i) {
2426 unsigned long prev = *result, powprev = pow;
2428 *result += ((unsigned long) n->num[i]) * pow;
2431 if (*result < prev || pow < powprev)
2432 return bc_error("overflow");
2435 return BC_STATUS_SUCCESS;
2438 static void bc_num_ulong2num(BcNum *n, unsigned long val)
2446 if (val == 0) return;
2448 for (len = 1, i = ULONG_MAX; i != 0; i /= 10, ++len) bc_num_expand(n, len);
2449 for (ptr = n->num, i = 0; val; ++i, ++n->len, val /= 10) ptr[i] = val % 10;
2452 static BcStatus bc_num_add(BcNum *a, BcNum *b, BcNum *c, size_t scale)
2454 BcNumBinaryOp op = (!a->neg == !b->neg) ? bc_num_a : bc_num_s;
2456 return bc_num_binary(a, b, c, false, op, BC_NUM_AREQ(a, b));
2459 static BcStatus bc_num_sub(BcNum *a, BcNum *b, BcNum *c, size_t scale)
2461 BcNumBinaryOp op = (!a->neg == !b->neg) ? bc_num_s : bc_num_a;
2463 return bc_num_binary(a, b, c, true, op, BC_NUM_AREQ(a, b));
2466 static BcStatus bc_num_mul(BcNum *a, BcNum *b, BcNum *c, size_t scale)
2468 size_t req = BC_NUM_MREQ(a, b, scale);
2469 return bc_num_binary(a, b, c, scale, bc_num_m, req);
2472 static BcStatus bc_num_div(BcNum *a, BcNum *b, BcNum *c, size_t scale)
2474 size_t req = BC_NUM_MREQ(a, b, scale);
2475 return bc_num_binary(a, b, c, scale, bc_num_d, req);
2478 static BcStatus bc_num_mod(BcNum *a, BcNum *b, BcNum *c, size_t scale)
2480 size_t req = BC_NUM_MREQ(a, b, scale);
2481 return bc_num_binary(a, b, c, scale, bc_num_rem, req);
2484 static BcStatus bc_num_pow(BcNum *a, BcNum *b, BcNum *c, size_t scale)
2486 return bc_num_binary(a, b, c, scale, bc_num_p, a->len * b->len + 1);
2489 static BcStatus bc_num_sqrt(BcNum *a, BcNum *restrict b, size_t scale)
2492 BcNum num1, num2, half, f, fprime, *x0, *x1, *temp;
2493 size_t pow, len, digs, digs1, resrdx, req, times = 0;
2494 ssize_t cmp = 1, cmp1 = SSIZE_MAX, cmp2 = SSIZE_MAX;
2496 req = BC_MAX(scale, a->rdx) + ((BC_NUM_INT(a) + 1) >> 1) + 1;
2497 bc_num_expand(b, req);
2500 bc_num_setToZero(b, scale);
2501 return BC_STATUS_SUCCESS;
2504 return bc_error("negative number");
2505 else if (BC_NUM_ONE(a)) {
2507 bc_num_extend(b, scale);
2508 return BC_STATUS_SUCCESS;
2511 scale = BC_MAX(scale, a->rdx) + 1;
2512 len = a->len + scale;
2514 bc_num_init(&num1, len);
2515 bc_num_init(&num2, len);
2516 bc_num_init(&half, BC_NUM_DEF_SIZE);
2522 bc_num_init(&f, len);
2523 bc_num_init(&fprime, len);
2529 pow = BC_NUM_INT(a);
2538 pow -= 2 - (pow & 1);
2540 bc_num_extend(x0, pow);
2542 // Make sure to move the radix back.
2546 x0->rdx = digs = digs1 = 0;
2548 len = BC_NUM_INT(x0) + resrdx - 1;
2550 while (cmp != 0 || digs < len) {
2552 s = bc_num_div(a, x0, &f, resrdx);
2554 s = bc_num_add(x0, &f, &fprime, resrdx);
2556 s = bc_num_mul(&fprime, &half, x1, resrdx);
2559 cmp = bc_num_cmp(x1, x0);
2560 digs = x1->len - (unsigned long long) llabs(cmp);
2562 if (cmp == cmp2 && digs == digs1)
2567 resrdx += times > 4;
2580 if (b->rdx > scale) bc_num_truncate(b, b->rdx - scale);
2583 bc_num_free(&fprime);
2591 static BcStatus bc_num_divmod(BcNum *a, BcNum *b, BcNum *c, BcNum *d,
2597 size_t ts = BC_MAX(scale + b->rdx, a->rdx), len = BC_NUM_MREQ(a, b, ts);
2600 memcpy(&num2, c, sizeof(BcNum));
2602 bc_num_init(c, len);
2607 bc_num_expand(c, len);
2610 s = bc_num_r(ptr_a, b, c, d, scale, ts);
2612 if (init) bc_num_free(&num2);
2618 static BcStatus bc_num_modexp(BcNum *a, BcNum *b, BcNum *c, BcNum *restrict d)
2621 BcNum base, exp, two, temp;
2624 return bc_error("divide by zero");
2625 if (a->rdx || b->rdx || c->rdx)
2626 return bc_error("non integer number");
2628 return bc_error("negative number");
2630 bc_num_expand(d, c->len);
2631 bc_num_init(&base, c->len);
2632 bc_num_init(&exp, b->len);
2633 bc_num_init(&two, BC_NUM_DEF_SIZE);
2634 bc_num_init(&temp, b->len);
2640 s = bc_num_rem(a, c, &base, 0);
2642 bc_num_copy(&exp, b);
2644 while (exp.len != 0) {
2646 s = bc_num_divmod(&exp, &two, &exp, &temp, 0);
2649 if (BC_NUM_ONE(&temp)) {
2650 s = bc_num_mul(d, &base, &temp, 0);
2652 s = bc_num_rem(&temp, c, d, 0);
2656 s = bc_num_mul(&base, &base, &temp, 0);
2658 s = bc_num_rem(&temp, c, &base, 0);
2671 static int bc_id_cmp(const void *e1, const void *e2)
2673 return strcmp(((const BcId *) e1)->name, ((const BcId *) e2)->name);
2676 static void bc_id_free(void *id)
2678 free(((BcId *) id)->name);
2681 static BcStatus bc_func_insert(BcFunc *f, char *name, bool var)
2686 for (i = 0; i < f->autos.len; ++i) {
2687 if (strcmp(name, ((BcId *) bc_vec_item(&f->autos, i))->name) == 0)
2688 return bc_error("function parameter or auto var has the same name as another");
2694 bc_vec_push(&f->autos, &a);
2696 return BC_STATUS_SUCCESS;
2699 static void bc_func_init(BcFunc *f)
2701 bc_char_vec_init(&f->code);
2702 bc_vec_init(&f->autos, sizeof(BcId), bc_id_free);
2703 bc_vec_init(&f->labels, sizeof(size_t), NULL);
2707 static void bc_func_free(void *func)
2709 BcFunc *f = (BcFunc *) func;
2710 bc_vec_free(&f->code);
2711 bc_vec_free(&f->autos);
2712 bc_vec_free(&f->labels);
2715 static void bc_array_init(BcVec *a, bool nums)
2718 bc_vec_init(a, sizeof(BcNum), bc_num_free);
2720 bc_vec_init(a, sizeof(BcVec), bc_vec_free);
2721 bc_array_expand(a, 1);
2724 static void bc_array_copy(BcVec *d, const BcVec *s)
2729 bc_vec_expand(d, s->cap);
2732 for (i = 0; i < s->len; ++i) {
2733 BcNum *dnum = bc_vec_item(d, i), *snum = bc_vec_item(s, i);
2734 bc_num_init(dnum, snum->len);
2735 bc_num_copy(dnum, snum);
2739 static void bc_array_expand(BcVec *a, size_t len)
2743 if (a->size == sizeof(BcNum) && a->dtor == bc_num_free) {
2744 while (len > a->len) {
2745 bc_num_init(&data.n, BC_NUM_DEF_SIZE);
2746 bc_vec_push(a, &data.n);
2750 while (len > a->len) {
2751 bc_array_init(&data.v, true);
2752 bc_vec_push(a, &data.v);
2757 static void bc_string_free(void *string)
2759 free(*((char **) string));
2763 static void bc_result_copy(BcResult *d, BcResult *src)
2769 case BC_RESULT_TEMP:
2770 case BC_RESULT_IBASE:
2771 case BC_RESULT_SCALE:
2772 case BC_RESULT_OBASE:
2774 bc_num_init(&d->d.n, src->d.n.len);
2775 bc_num_copy(&d->d.n, &src->d.n);
2780 case BC_RESULT_ARRAY:
2781 case BC_RESULT_ARRAY_ELEM:
2783 d->d.id.name = xstrdup(src->d.id.name);
2787 case BC_RESULT_CONSTANT:
2788 case BC_RESULT_LAST:
2792 memcpy(&d->d.n, &src->d.n, sizeof(BcNum));
2799 static void bc_result_free(void *result)
2801 BcResult *r = (BcResult *) result;
2805 case BC_RESULT_TEMP:
2806 case BC_RESULT_IBASE:
2807 case BC_RESULT_SCALE:
2808 case BC_RESULT_OBASE:
2810 bc_num_free(&r->d.n);
2815 case BC_RESULT_ARRAY:
2816 case BC_RESULT_ARRAY_ELEM:
2830 static void bc_lex_lineComment(BcLex *l)
2832 l->t.t = BC_LEX_WHITESPACE;
2833 while (l->i < l->len && l->buf[l->i++] != '\n');
2837 static void bc_lex_whitespace(BcLex *l)
2840 l->t.t = BC_LEX_WHITESPACE;
2841 for (c = l->buf[l->i]; c != '\n' && isspace(c); c = l->buf[++l->i]);
2844 static BcStatus bc_lex_number(BcLex *l, char start)
2846 const char *buf = l->buf + l->i;
2847 size_t len, hits = 0, bslashes = 0, i = 0, j;
2849 bool last_pt, pt = start == '.';
2852 l->t.t = BC_LEX_NUMBER;
2854 while (c != 0 && (isdigit(c) || (c >= 'A' && c <= 'F') ||
2855 (c == '.' && !pt) || (c == '\\' && buf[i + 1] == '\n')))
2869 len = i + !last_pt - bslashes * 2;
2870 if (len > BC_MAX_NUM)
2871 return bc_error("number too long: must be [1, BC_NUM_MAX]");
2873 bc_vec_pop_all(&l->t.v);
2874 bc_vec_expand(&l->t.v, len + 1);
2875 bc_vec_push(&l->t.v, &start);
2877 for (buf -= 1, j = 1; j < len + hits * 2; ++j) {
2881 // If we have hit a backslash, skip it. We don't have
2882 // to check for a newline because it's guaranteed.
2883 if (hits < bslashes && c == '\\') {
2889 bc_vec_push(&l->t.v, &c);
2892 bc_vec_pushZeroByte(&l->t.v);
2895 return BC_STATUS_SUCCESS;
2898 static BcStatus bc_lex_name(BcLex *l)
2901 const char *buf = l->buf + l->i - 1;
2904 l->t.t = BC_LEX_NAME;
2906 while ((c >= 'a' && c <= 'z') || isdigit(c) || c == '_') c = buf[++i];
2908 if (i > BC_MAX_STRING)
2909 return bc_error("name too long: must be [1, BC_NAME_MAX]");
2910 bc_vec_string(&l->t.v, i, buf);
2912 // Increment the index. We minus 1 because it has already been incremented.
2915 return BC_STATUS_SUCCESS;
2918 static void bc_lex_init(BcLex *l, BcLexNext next)
2921 bc_char_vec_init(&l->t.v);
2924 static void bc_lex_free(BcLex *l)
2926 bc_vec_free(&l->t.v);
2929 static void bc_lex_file(BcLex *l)
2931 G.err_line = l->line = 1;
2935 static BcStatus bc_lex_next(BcLex *l)
2940 if (l->t.last == BC_LEX_EOF) return bc_error("end of file");
2942 l->line += l->newline;
2943 G.err_line = l->line;
2944 l->t.t = BC_LEX_EOF;
2946 l->newline = (l->i == l->len);
2947 if (l->newline) return BC_STATUS_SUCCESS;
2949 // Loop until failure or we don't have whitespace. This
2950 // is so the parser doesn't get inundated with whitespace.
2953 } while (!s && l->t.t == BC_LEX_WHITESPACE);
2958 static BcStatus bc_lex_text(BcLex *l, const char *text)
2962 l->len = strlen(text);
2963 l->t.t = l->t.last = BC_LEX_INVALID;
2964 return bc_lex_next(l);
2968 static BcStatus bc_lex_identifier(BcLex *l)
2972 const char *buf = l->buf + l->i - 1;
2974 for (i = 0; i < ARRAY_SIZE(bc_lex_kws); ++i) {
2975 const char *keyword8 = bc_lex_kws[i].name8;
2977 while (buf[j] != '\0' && buf[j] == keyword8[j]) {
2979 if (j == 8) goto match;
2981 if (keyword8[j] != '\0')
2984 // buf starts with keyword bc_lex_kws[i]
2985 l->t.t = BC_LEX_KEY_1st_keyword + i;
2986 if (!((1 << i) & POSIX_KWORD_MASK)) {
2987 s = bc_posix_error_fmt("%sthe '%.8s' keyword", "POSIX does not allow ", bc_lex_kws[i].name8);
2991 // We minus 1 because the index has already been incremented.
2993 return BC_STATUS_SUCCESS;
2999 if (l->t.v.len > 2) {
3002 // bc: POSIX only allows one character names; the following is bad: 'qwe=1
3004 unsigned len = strchrnul(buf, '\n') - buf;
3005 s = bc_posix_error_fmt("POSIX only allows one character names; the following is bad: '%.*s'", len, buf);
3011 static BcStatus bc_lex_string(BcLex *l)
3013 size_t len, nls = 0, i = l->i;
3016 l->t.t = BC_LEX_STR;
3018 for (c = l->buf[i]; c != 0 && c != '"'; c = l->buf[++i]) nls += (c == '\n');
3022 return bc_error("string end could not be found");
3026 if (len > BC_MAX_STRING)
3027 return bc_error("string too long: must be [1, BC_STRING_MAX]");
3028 bc_vec_string(&l->t.v, len, l->buf + l->i);
3032 G.err_line = l->line;
3034 return BC_STATUS_SUCCESS;
3037 static void bc_lex_assign(BcLex *l, BcLexType with, BcLexType without)
3039 if (l->buf[l->i] == '=') {
3047 static BcStatus bc_lex_comment(BcLex *l)
3050 const char *buf = l->buf;
3052 l->t.t = BC_LEX_WHITESPACE;
3065 return bc_error("comment end could not be found");
3073 G.err_line = l->line;
3075 return BC_STATUS_SUCCESS;
3078 static BcStatus bc_lex_token(BcLex *l)
3080 BcStatus s = BC_STATUS_SUCCESS;
3081 char c = l->buf[l->i++], c2;
3083 // This is the workhorse of the lexer.
3090 l->t.t = !c ? BC_LEX_EOF : BC_LEX_NLINE;
3100 bc_lex_whitespace(l);
3106 bc_lex_assign(l, BC_LEX_OP_REL_NE, BC_LEX_OP_BOOL_NOT);
3108 if (l->t.t == BC_LEX_OP_BOOL_NOT) {
3109 s = bc_POSIX_does_not_allow_bool_ops_this_is_bad("!");
3118 s = bc_lex_string(l);
3124 s = bc_POSIX_does_not_allow("'#' script comments");
3127 bc_lex_lineComment(l);
3134 bc_lex_assign(l, BC_LEX_OP_ASSIGN_MODULUS, BC_LEX_OP_MODULUS);
3143 s = bc_POSIX_does_not_allow_bool_ops_this_is_bad("&&");
3147 l->t.t = BC_LEX_OP_BOOL_AND;
3150 l->t.t = BC_LEX_INVALID;
3151 s = bc_error_bad_character('&');
3160 l->t.t = (BcLexType)(c - '(' + BC_LEX_LPAREN);
3166 bc_lex_assign(l, BC_LEX_OP_ASSIGN_MULTIPLY, BC_LEX_OP_MULTIPLY);
3175 l->t.t = BC_LEX_OP_INC;
3178 bc_lex_assign(l, BC_LEX_OP_ASSIGN_PLUS, BC_LEX_OP_PLUS);
3184 l->t.t = BC_LEX_COMMA;
3193 l->t.t = BC_LEX_OP_DEC;
3196 bc_lex_assign(l, BC_LEX_OP_ASSIGN_MINUS, BC_LEX_OP_MINUS);
3202 if (isdigit(l->buf[l->i]))
3203 s = bc_lex_number(l, c);
3205 l->t.t = BC_LEX_KEY_LAST;
3206 s = bc_POSIX_does_not_allow("a period ('.') as a shortcut for the last result");
3215 s = bc_lex_comment(l);
3217 bc_lex_assign(l, BC_LEX_OP_ASSIGN_DIVIDE, BC_LEX_OP_DIVIDE);
3238 s = bc_lex_number(l, c);
3244 l->t.t = BC_LEX_SCOLON;
3250 bc_lex_assign(l, BC_LEX_OP_REL_LE, BC_LEX_OP_REL_LT);
3256 bc_lex_assign(l, BC_LEX_OP_REL_EQ, BC_LEX_OP_ASSIGN);
3262 bc_lex_assign(l, BC_LEX_OP_REL_GE, BC_LEX_OP_REL_GT);
3269 l->t.t = (BcLexType)(c - '[' + BC_LEX_LBRACKET);
3275 if (l->buf[l->i] == '\n') {
3276 l->t.t = BC_LEX_WHITESPACE;
3280 s = bc_error_bad_character(c);
3286 bc_lex_assign(l, BC_LEX_OP_ASSIGN_POWER, BC_LEX_OP_POWER);
3317 s = bc_lex_identifier(l);
3324 l->t.t = (BcLexType)(c - '{' + BC_LEX_LBRACE);
3333 s = bc_POSIX_does_not_allow_bool_ops_this_is_bad("||");
3337 l->t.t = BC_LEX_OP_BOOL_OR;
3340 l->t.t = BC_LEX_INVALID;
3341 s = bc_error_bad_character(c);
3349 l->t.t = BC_LEX_INVALID;
3350 s = bc_error_bad_character(c);
3360 static BcStatus dc_lex_register(BcLex *l)
3362 BcStatus s = BC_STATUS_SUCCESS;
3364 if (isspace(l->buf[l->i - 1])) {
3365 bc_lex_whitespace(l);
3368 s = bc_error("extended register");
3373 bc_vec_pop_all(&l->t.v);
3374 bc_vec_pushByte(&l->t.v, l->buf[l->i - 1]);
3375 bc_vec_pushZeroByte(&l->t.v);
3376 l->t.t = BC_LEX_NAME;
3382 static BcStatus dc_lex_string(BcLex *l)
3384 size_t depth = 1, nls = 0, i = l->i;
3387 l->t.t = BC_LEX_STR;
3388 bc_vec_pop_all(&l->t.v);
3390 for (c = l->buf[i]; c != 0 && depth; c = l->buf[++i]) {
3392 depth += (c == '[' && (i == l->i || l->buf[i - 1] != '\\'));
3393 depth -= (c == ']' && (i == l->i || l->buf[i - 1] != '\\'));
3396 if (depth) bc_vec_push(&l->t.v, &c);
3401 return bc_error("string end could not be found");
3404 bc_vec_pushZeroByte(&l->t.v);
3405 if (i - l->i > BC_MAX_STRING)
3406 return bc_error("string too long: must be [1, BC_STRING_MAX]");
3410 G.err_line = l->line;
3412 return BC_STATUS_SUCCESS;
3415 static BcStatus dc_lex_token(BcLex *l)
3417 BcStatus s = BC_STATUS_SUCCESS;
3418 char c = l->buf[l->i++], c2;
3421 for (i = 0; i < ARRAY_SIZE(dc_lex_regs); ++i) {
3422 if (l->t.last == dc_lex_regs[i])
3423 return dc_lex_register(l);
3426 if (c >= '%' && c <= '~' &&
3427 (l->t.t = dc_lex_tokens[(c - '%')]) != BC_LEX_INVALID)
3432 // This is the workhorse of the lexer.
3437 l->t.t = BC_LEX_EOF;
3448 l->newline = (c == '\n');
3449 bc_lex_whitespace(l);
3458 l->t.t = BC_LEX_OP_REL_NE;
3460 l->t.t = BC_LEX_OP_REL_LE;
3462 l->t.t = BC_LEX_OP_REL_GE;
3464 return bc_error_bad_character(c);
3472 bc_lex_lineComment(l);
3478 if (isdigit(l->buf[l->i]))
3479 s = bc_lex_number(l, c);
3481 s = bc_error_bad_character(c);
3502 s = bc_lex_number(l, c);
3508 s = dc_lex_string(l);
3514 l->t.t = BC_LEX_INVALID;
3515 s = bc_error_bad_character(c);
3524 static void bc_parse_addFunc(BcParse *p, char *name, size_t *idx)
3526 bc_program_addFunc(name, idx);
3527 p->func = bc_vec_item(&G.prog.fns, p->fidx);
3530 static void bc_parse_pushName(BcParse *p, char *name)
3532 size_t i = 0, len = strlen(name);
3534 for (; i < len; ++i) bc_parse_push(p, name[i]);
3535 bc_parse_push(p, BC_PARSE_STREND);
3540 static void bc_parse_pushIndex(BcParse *p, size_t idx)
3542 unsigned char amt, i, nums[sizeof(size_t)];
3544 for (amt = 0; idx; ++amt) {
3545 nums[amt] = (char) idx;
3546 idx = (idx & ((unsigned long) ~(UCHAR_MAX))) >> sizeof(char) * CHAR_BIT;
3549 bc_parse_push(p, amt);
3550 for (i = 0; i < amt; ++i) bc_parse_push(p, nums[i]);
3553 static void bc_parse_number(BcParse *p, BcInst *prev, size_t *nexs)
3555 char *num = xstrdup(p->l.t.v.v);
3556 size_t idx = G.prog.consts.len;
3558 bc_vec_push(&G.prog.consts, &num);
3560 bc_parse_push(p, BC_INST_NUM);
3561 bc_parse_pushIndex(p, idx);
3564 (*prev) = BC_INST_NUM;
3567 static BcStatus bc_parse_text(BcParse *p, const char *text)
3571 p->func = bc_vec_item(&G.prog.fns, p->fidx);
3573 if (!text[0] && !BC_PARSE_CAN_EXEC(p)) {
3574 p->l.t.t = BC_LEX_INVALID;
3577 if (!BC_PARSE_CAN_EXEC(p))
3578 return bc_error("file is not executable");
3581 return bc_lex_text(&p->l, text);
3584 // Called when bc/dc_parse_parse() detects a failure,
3585 // resets parsing structures.
3586 static void bc_parse_reset(BcParse *p)
3588 if (p->fidx != BC_PROG_MAIN) {
3589 p->func->nparams = 0;
3590 bc_vec_pop_all(&p->func->code);
3591 bc_vec_pop_all(&p->func->autos);
3592 bc_vec_pop_all(&p->func->labels);
3594 bc_parse_updateFunc(p, BC_PROG_MAIN);
3598 p->l.t.t = BC_LEX_EOF;
3599 p->auto_part = (p->nbraces = 0);
3601 bc_vec_npop(&p->flags, p->flags.len - 1);
3602 bc_vec_pop_all(&p->exits);
3603 bc_vec_pop_all(&p->conds);
3604 bc_vec_pop_all(&p->ops);
3609 static void bc_parse_free(BcParse *p)
3611 bc_vec_free(&p->flags);
3612 bc_vec_free(&p->exits);
3613 bc_vec_free(&p->conds);
3614 bc_vec_free(&p->ops);
3618 static void bc_parse_create(BcParse *p, size_t func,
3619 BcParseParse parse, BcLexNext next)
3621 memset(p, 0, sizeof(BcParse));
3623 bc_lex_init(&p->l, next);
3624 bc_vec_init(&p->flags, sizeof(uint8_t), NULL);
3625 bc_vec_init(&p->exits, sizeof(BcInstPtr), NULL);
3626 bc_vec_init(&p->conds, sizeof(size_t), NULL);
3627 bc_vec_pushZeroByte(&p->flags);
3628 bc_vec_init(&p->ops, sizeof(BcLexType), NULL);
3631 // p->auto_part = p->nbraces = 0; - already is
3632 bc_parse_updateFunc(p, func);
3636 static BcStatus bc_parse_else(BcParse *p);
3637 static BcStatus bc_parse_stmt(BcParse *p);
3639 static BcStatus bc_parse_operator(BcParse *p, BcLexType type, size_t start,
3640 size_t *nexprs, bool next)
3642 BcStatus s = BC_STATUS_SUCCESS;
3644 char l, r = bc_parse_op_PREC(type - BC_LEX_OP_INC);
3645 bool left = bc_parse_op_LEFT(type - BC_LEX_OP_INC);
3647 while (p->ops.len > start) {
3649 t = BC_PARSE_TOP_OP(p);
3650 if (t == BC_LEX_LPAREN) break;
3652 l = bc_parse_op_PREC(t - BC_LEX_OP_INC);
3653 if (l >= r && (l != r || !left)) break;
3655 bc_parse_push(p, BC_PARSE_TOKEN_INST(t));
3656 bc_vec_pop(&p->ops);
3657 *nexprs -= t != BC_LEX_OP_BOOL_NOT && t != BC_LEX_NEG;
3660 bc_vec_push(&p->ops, &type);
3661 if (next) s = bc_lex_next(&p->l);
3666 static BcStatus bc_parse_rightParen(BcParse *p, size_t ops_bgn, size_t *nexs)
3670 if (p->ops.len <= ops_bgn)
3671 return bc_error_bad_expression();
3672 top = BC_PARSE_TOP_OP(p);
3674 while (top != BC_LEX_LPAREN) {
3676 bc_parse_push(p, BC_PARSE_TOKEN_INST(top));
3678 bc_vec_pop(&p->ops);
3679 *nexs -= top != BC_LEX_OP_BOOL_NOT && top != BC_LEX_NEG;
3681 if (p->ops.len <= ops_bgn)
3682 return bc_error_bad_expression();
3683 top = BC_PARSE_TOP_OP(p);
3686 bc_vec_pop(&p->ops);
3688 return bc_lex_next(&p->l);
3691 static BcStatus bc_parse_params(BcParse *p, uint8_t flags)
3697 s = bc_lex_next(&p->l);
3700 for (nparams = 0; p->l.t.t != BC_LEX_RPAREN; ++nparams) {
3702 flags = (flags & ~(BC_PARSE_PRINT | BC_PARSE_REL)) | BC_PARSE_ARRAY;
3703 s = bc_parse_expr(p, flags, bc_parse_next_param);
3706 comma = p->l.t.t == BC_LEX_COMMA;
3708 s = bc_lex_next(&p->l);
3713 if (comma) return bc_error_bad_token();
3714 bc_parse_push(p, BC_INST_CALL);
3715 bc_parse_pushIndex(p, nparams);
3717 return BC_STATUS_SUCCESS;
3720 static BcStatus bc_parse_call(BcParse *p, char *name, uint8_t flags)
3723 BcId entry, *entry_ptr;
3728 s = bc_parse_params(p, flags);
3731 if (p->l.t.t != BC_LEX_RPAREN) {
3732 s = bc_error_bad_token();
3736 idx = bc_map_index(&G.prog.fn_map, &entry);
3738 if (idx == BC_VEC_INVALID_IDX) {
3739 name = xstrdup(entry.name);
3740 bc_parse_addFunc(p, name, &idx);
3741 idx = bc_map_index(&G.prog.fn_map, &entry);
3747 entry_ptr = bc_vec_item(&G.prog.fn_map, idx);
3748 bc_parse_pushIndex(p, entry_ptr->idx);
3750 return bc_lex_next(&p->l);
3757 static BcStatus bc_parse_name(BcParse *p, BcInst *type, uint8_t flags)
3762 name = xstrdup(p->l.t.v.v);
3763 s = bc_lex_next(&p->l);
3766 if (p->l.t.t == BC_LEX_LBRACKET) {
3768 s = bc_lex_next(&p->l);
3771 if (p->l.t.t == BC_LEX_RBRACKET) {
3773 if (!(flags & BC_PARSE_ARRAY)) {
3774 s = bc_error_bad_expression();
3778 *type = BC_INST_ARRAY;
3782 *type = BC_INST_ARRAY_ELEM;
3784 flags &= ~(BC_PARSE_PRINT | BC_PARSE_REL);
3785 s = bc_parse_expr(p, flags, bc_parse_next_elem);
3789 s = bc_lex_next(&p->l);
3791 bc_parse_push(p, *type);
3792 bc_parse_pushName(p, name);
3794 else if (p->l.t.t == BC_LEX_LPAREN) {
3796 if (flags & BC_PARSE_NOCALL) {
3797 s = bc_error_bad_token();
3801 *type = BC_INST_CALL;
3802 s = bc_parse_call(p, name, flags);
3805 *type = BC_INST_VAR;
3806 bc_parse_push(p, BC_INST_VAR);
3807 bc_parse_pushName(p, name);
3817 static BcStatus bc_parse_read(BcParse *p)
3821 s = bc_lex_next(&p->l);
3823 if (p->l.t.t != BC_LEX_LPAREN) return bc_error_bad_token();
3825 s = bc_lex_next(&p->l);
3827 if (p->l.t.t != BC_LEX_RPAREN) return bc_error_bad_token();
3829 bc_parse_push(p, BC_INST_READ);
3831 return bc_lex_next(&p->l);
3834 static BcStatus bc_parse_builtin(BcParse *p, BcLexType type, uint8_t flags,
3839 s = bc_lex_next(&p->l);
3841 if (p->l.t.t != BC_LEX_LPAREN) return bc_error_bad_token();
3843 flags = (flags & ~(BC_PARSE_PRINT | BC_PARSE_REL)) | BC_PARSE_ARRAY;
3845 s = bc_lex_next(&p->l);
3848 s = bc_parse_expr(p, flags, bc_parse_next_rel);
3851 if (p->l.t.t != BC_LEX_RPAREN) return bc_error_bad_token();
3853 *prev = (type == BC_LEX_KEY_LENGTH) ? BC_INST_LENGTH : BC_INST_SQRT;
3854 bc_parse_push(p, *prev);
3856 return bc_lex_next(&p->l);
3859 static BcStatus bc_parse_scale(BcParse *p, BcInst *type, uint8_t flags)
3863 s = bc_lex_next(&p->l);
3866 if (p->l.t.t != BC_LEX_LPAREN) {
3867 *type = BC_INST_SCALE;
3868 bc_parse_push(p, BC_INST_SCALE);
3869 return BC_STATUS_SUCCESS;
3872 *type = BC_INST_SCALE_FUNC;
3873 flags &= ~(BC_PARSE_PRINT | BC_PARSE_REL);
3875 s = bc_lex_next(&p->l);
3878 s = bc_parse_expr(p, flags, bc_parse_next_rel);
3880 if (p->l.t.t != BC_LEX_RPAREN) return bc_error_bad_token();
3881 bc_parse_push(p, BC_INST_SCALE_FUNC);
3883 return bc_lex_next(&p->l);
3886 static BcStatus bc_parse_incdec(BcParse *p, BcInst *prev, bool *paren_expr,
3887 size_t *nexprs, uint8_t flags)
3892 BcInst etype = *prev;
3894 if (etype == BC_INST_VAR || etype == BC_INST_ARRAY_ELEM ||
3895 etype == BC_INST_SCALE || etype == BC_INST_LAST ||
3896 etype == BC_INST_IBASE || etype == BC_INST_OBASE)
3898 *prev = inst = BC_INST_INC_POST + (p->l.t.t != BC_LEX_OP_INC);
3899 bc_parse_push(p, inst);
3900 s = bc_lex_next(&p->l);
3904 *prev = inst = BC_INST_INC_PRE + (p->l.t.t != BC_LEX_OP_INC);
3907 s = bc_lex_next(&p->l);
3911 // Because we parse the next part of the expression
3912 // right here, we need to increment this.
3913 *nexprs = *nexprs + 1;
3919 s = bc_parse_name(p, prev, flags | BC_PARSE_NOCALL);
3923 case BC_LEX_KEY_IBASE:
3924 case BC_LEX_KEY_LAST:
3925 case BC_LEX_KEY_OBASE:
3927 bc_parse_push(p, type - BC_LEX_KEY_IBASE + BC_INST_IBASE);
3928 s = bc_lex_next(&p->l);
3932 case BC_LEX_KEY_SCALE:
3934 s = bc_lex_next(&p->l);
3936 if (p->l.t.t == BC_LEX_LPAREN)
3937 s = bc_error_bad_token();
3939 bc_parse_push(p, BC_INST_SCALE);
3945 s = bc_error_bad_token();
3950 if (!s) bc_parse_push(p, inst);
3956 static BcStatus bc_parse_minus(BcParse *p, BcInst *prev, size_t ops_bgn,
3957 bool rparen, size_t *nexprs)
3961 BcInst etype = *prev;
3963 s = bc_lex_next(&p->l);
3966 type = rparen || etype == BC_INST_INC_POST || etype == BC_INST_DEC_POST ||
3967 (etype >= BC_INST_NUM && etype <= BC_INST_SQRT) ?
3970 *prev = BC_PARSE_TOKEN_INST(type);
3972 // We can just push onto the op stack because this is the largest
3973 // precedence operator that gets pushed. Inc/dec does not.
3974 if (type != BC_LEX_OP_MINUS)
3975 bc_vec_push(&p->ops, &type);
3977 s = bc_parse_operator(p, type, ops_bgn, nexprs, false);
3982 static BcStatus bc_parse_string(BcParse *p, char inst)
3984 char *str = xstrdup(p->l.t.v.v);
3986 bc_parse_push(p, BC_INST_STR);
3987 bc_parse_pushIndex(p, G.prog.strs.len);
3988 bc_vec_push(&G.prog.strs, &str);
3989 bc_parse_push(p, inst);
3991 return bc_lex_next(&p->l);
3994 static BcStatus bc_parse_print(BcParse *p)
4000 s = bc_lex_next(&p->l);
4005 if (type == BC_LEX_SCOLON || type == BC_LEX_NLINE)
4006 return bc_error("bad print statement");
4008 while (!s && type != BC_LEX_SCOLON && type != BC_LEX_NLINE) {
4010 if (type == BC_LEX_STR)
4011 s = bc_parse_string(p, BC_INST_PRINT_POP);
4013 s = bc_parse_expr(p, 0, bc_parse_next_print);
4015 bc_parse_push(p, BC_INST_PRINT_POP);
4020 comma = p->l.t.t == BC_LEX_COMMA;
4021 if (comma) s = bc_lex_next(&p->l);
4026 if (comma) return bc_error_bad_token();
4028 return bc_lex_next(&p->l);
4031 static BcStatus bc_parse_return(BcParse *p)
4037 if (!BC_PARSE_FUNC(p)) return bc_error_bad_token();
4039 s = bc_lex_next(&p->l);
4043 paren = t == BC_LEX_LPAREN;
4045 if (t == BC_LEX_NLINE || t == BC_LEX_SCOLON)
4046 bc_parse_push(p, BC_INST_RET0);
4049 s = bc_parse_expr(p, 0, bc_parse_next_expr);
4050 if (s == BC_STATUS_PARSE_EMPTY_EXP) {
4051 bc_parse_push(p, BC_INST_RET0);
4052 s = bc_lex_next(&p->l);
4056 if (!paren || p->l.t.last != BC_LEX_RPAREN) {
4057 s = bc_posix_error("POSIX requires parentheses around return expressions");
4061 bc_parse_push(p, BC_INST_RET);
4067 static BcStatus bc_parse_endBody(BcParse *p, bool brace)
4069 BcStatus s = BC_STATUS_SUCCESS;
4071 if (p->flags.len <= 1 || (brace && p->nbraces == 0))
4072 return bc_error_bad_token();
4076 if (p->l.t.t == BC_LEX_RBRACE) {
4077 if (!p->nbraces) return bc_error_bad_token();
4079 s = bc_lex_next(&p->l);
4083 return bc_error_bad_token();
4086 if (BC_PARSE_IF(p)) {
4090 while (p->l.t.t == BC_LEX_NLINE) {
4091 s = bc_lex_next(&p->l);
4095 bc_vec_pop(&p->flags);
4097 flag_ptr = BC_PARSE_TOP_FLAG_PTR(p);
4098 *flag_ptr = (*flag_ptr | BC_PARSE_FLAG_IF_END);
4100 if (p->l.t.t == BC_LEX_KEY_ELSE) s = bc_parse_else(p);
4102 else if (BC_PARSE_ELSE(p)) {
4107 bc_vec_pop(&p->flags);
4109 ip = bc_vec_top(&p->exits);
4110 label = bc_vec_item(&p->func->labels, ip->idx);
4111 *label = p->func->code.len;
4113 bc_vec_pop(&p->exits);
4115 else if (BC_PARSE_FUNC_INNER(p)) {
4116 bc_parse_push(p, BC_INST_RET0);
4117 bc_parse_updateFunc(p, BC_PROG_MAIN);
4118 bc_vec_pop(&p->flags);
4122 BcInstPtr *ip = bc_vec_top(&p->exits);
4123 size_t *label = bc_vec_top(&p->conds);
4125 bc_parse_push(p, BC_INST_JUMP);
4126 bc_parse_pushIndex(p, *label);
4128 label = bc_vec_item(&p->func->labels, ip->idx);
4129 *label = p->func->code.len;
4131 bc_vec_pop(&p->flags);
4132 bc_vec_pop(&p->exits);
4133 bc_vec_pop(&p->conds);
4139 static void bc_parse_startBody(BcParse *p, uint8_t flags)
4141 uint8_t *flag_ptr = BC_PARSE_TOP_FLAG_PTR(p);
4142 flags |= (*flag_ptr & (BC_PARSE_FLAG_FUNC | BC_PARSE_FLAG_LOOP));
4143 flags |= BC_PARSE_FLAG_BODY;
4144 bc_vec_push(&p->flags, &flags);
4147 static void bc_parse_noElse(BcParse *p)
4151 uint8_t *flag_ptr = BC_PARSE_TOP_FLAG_PTR(p);
4153 *flag_ptr = (*flag_ptr & ~(BC_PARSE_FLAG_IF_END));
4155 ip = bc_vec_top(&p->exits);
4156 label = bc_vec_item(&p->func->labels, ip->idx);
4157 *label = p->func->code.len;
4159 bc_vec_pop(&p->exits);
4162 static BcStatus bc_parse_if(BcParse *p)
4167 s = bc_lex_next(&p->l);
4169 if (p->l.t.t != BC_LEX_LPAREN) return bc_error_bad_token();
4171 s = bc_lex_next(&p->l);
4173 s = bc_parse_expr(p, BC_PARSE_REL, bc_parse_next_rel);
4175 if (p->l.t.t != BC_LEX_RPAREN) return bc_error_bad_token();
4177 s = bc_lex_next(&p->l);
4179 bc_parse_push(p, BC_INST_JUMP_ZERO);
4181 ip.idx = p->func->labels.len;
4182 ip.func = ip.len = 0;
4184 bc_parse_pushIndex(p, ip.idx);
4185 bc_vec_push(&p->exits, &ip);
4186 bc_vec_push(&p->func->labels, &ip.idx);
4187 bc_parse_startBody(p, BC_PARSE_FLAG_IF);
4189 return BC_STATUS_SUCCESS;
4192 static BcStatus bc_parse_else(BcParse *p)
4196 if (!BC_PARSE_IF_END(p)) return bc_error_bad_token();
4198 ip.idx = p->func->labels.len;
4199 ip.func = ip.len = 0;
4201 bc_parse_push(p, BC_INST_JUMP);
4202 bc_parse_pushIndex(p, ip.idx);
4206 bc_vec_push(&p->exits, &ip);
4207 bc_vec_push(&p->func->labels, &ip.idx);
4208 bc_parse_startBody(p, BC_PARSE_FLAG_ELSE);
4210 return bc_lex_next(&p->l);
4213 static BcStatus bc_parse_while(BcParse *p)
4218 s = bc_lex_next(&p->l);
4220 if (p->l.t.t != BC_LEX_LPAREN) return bc_error_bad_token();
4221 s = bc_lex_next(&p->l);
4224 ip.idx = p->func->labels.len;
4226 bc_vec_push(&p->func->labels, &p->func->code.len);
4227 bc_vec_push(&p->conds, &ip.idx);
4229 ip.idx = p->func->labels.len;
4233 bc_vec_push(&p->exits, &ip);
4234 bc_vec_push(&p->func->labels, &ip.idx);
4236 s = bc_parse_expr(p, BC_PARSE_REL, bc_parse_next_rel);
4238 if (p->l.t.t != BC_LEX_RPAREN) return bc_error_bad_token();
4239 s = bc_lex_next(&p->l);
4242 bc_parse_push(p, BC_INST_JUMP_ZERO);
4243 bc_parse_pushIndex(p, ip.idx);
4244 bc_parse_startBody(p, BC_PARSE_FLAG_LOOP | BC_PARSE_FLAG_LOOP_INNER);
4246 return BC_STATUS_SUCCESS;
4249 static BcStatus bc_parse_for(BcParse *p)
4253 size_t cond_idx, exit_idx, body_idx, update_idx;
4255 s = bc_lex_next(&p->l);
4257 if (p->l.t.t != BC_LEX_LPAREN) return bc_error_bad_token();
4258 s = bc_lex_next(&p->l);
4261 if (p->l.t.t != BC_LEX_SCOLON)
4262 s = bc_parse_expr(p, 0, bc_parse_next_for);
4264 s = bc_POSIX_does_not_allow_empty_X_expression_in_for("init");
4267 if (p->l.t.t != BC_LEX_SCOLON) return bc_error_bad_token();
4268 s = bc_lex_next(&p->l);
4271 cond_idx = p->func->labels.len;
4272 update_idx = cond_idx + 1;
4273 body_idx = update_idx + 1;
4274 exit_idx = body_idx + 1;
4276 bc_vec_push(&p->func->labels, &p->func->code.len);
4278 if (p->l.t.t != BC_LEX_SCOLON)
4279 s = bc_parse_expr(p, BC_PARSE_REL, bc_parse_next_for);
4281 s = bc_POSIX_does_not_allow_empty_X_expression_in_for("condition");
4284 if (p->l.t.t != BC_LEX_SCOLON) return bc_error_bad_token();
4286 s = bc_lex_next(&p->l);
4289 bc_parse_push(p, BC_INST_JUMP_ZERO);
4290 bc_parse_pushIndex(p, exit_idx);
4291 bc_parse_push(p, BC_INST_JUMP);
4292 bc_parse_pushIndex(p, body_idx);
4294 ip.idx = p->func->labels.len;
4296 bc_vec_push(&p->conds, &update_idx);
4297 bc_vec_push(&p->func->labels, &p->func->code.len);
4299 if (p->l.t.t != BC_LEX_RPAREN)
4300 s = bc_parse_expr(p, 0, bc_parse_next_rel);
4302 s = bc_POSIX_does_not_allow_empty_X_expression_in_for("update");
4306 if (p->l.t.t != BC_LEX_RPAREN) return bc_error_bad_token();
4307 bc_parse_push(p, BC_INST_JUMP);
4308 bc_parse_pushIndex(p, cond_idx);
4309 bc_vec_push(&p->func->labels, &p->func->code.len);
4315 bc_vec_push(&p->exits, &ip);
4316 bc_vec_push(&p->func->labels, &ip.idx);
4318 bc_parse_startBody(p, BC_PARSE_FLAG_LOOP | BC_PARSE_FLAG_LOOP_INNER);
4320 return BC_STATUS_SUCCESS;
4323 static BcStatus bc_parse_loopExit(BcParse *p, BcLexType type)
4329 if (!BC_PARSE_LOOP(p)) return bc_error_bad_token();
4331 if (type == BC_LEX_KEY_BREAK) {
4333 if (p->exits.len == 0) return bc_error_bad_token();
4335 i = p->exits.len - 1;
4336 ip = bc_vec_item(&p->exits, i);
4338 while (!ip->func && i < p->exits.len) ip = bc_vec_item(&p->exits, i--);
4339 if (i >= p->exits.len && !ip->func) return bc_error_bad_token();
4344 i = *((size_t *) bc_vec_top(&p->conds));
4346 bc_parse_push(p, BC_INST_JUMP);
4347 bc_parse_pushIndex(p, i);
4349 s = bc_lex_next(&p->l);
4352 if (p->l.t.t != BC_LEX_SCOLON && p->l.t.t != BC_LEX_NLINE)
4353 return bc_error_bad_token();
4355 return bc_lex_next(&p->l);
4358 static BcStatus bc_parse_func(BcParse *p)
4361 bool var, comma = false;
4365 s = bc_lex_next(&p->l);
4367 if (p->l.t.t != BC_LEX_NAME)
4368 return bc_error("bad function definition");
4370 name = xstrdup(p->l.t.v.v);
4371 bc_parse_addFunc(p, name, &p->fidx);
4373 s = bc_lex_next(&p->l);
4375 if (p->l.t.t != BC_LEX_LPAREN)
4376 return bc_error("bad function definition");
4377 s = bc_lex_next(&p->l);
4380 while (p->l.t.t != BC_LEX_RPAREN) {
4382 if (p->l.t.t != BC_LEX_NAME)
4383 return bc_error("bad function definition");
4387 name = xstrdup(p->l.t.v.v);
4388 s = bc_lex_next(&p->l);
4391 var = p->l.t.t != BC_LEX_LBRACKET;
4395 s = bc_lex_next(&p->l);
4398 if (p->l.t.t != BC_LEX_RBRACKET) {
4399 s = bc_error("bad function definition");
4403 s = bc_lex_next(&p->l);
4407 comma = p->l.t.t == BC_LEX_COMMA;
4409 s = bc_lex_next(&p->l);
4413 s = bc_func_insert(p->func, name, var);
4417 if (comma) return bc_error("bad function definition");
4419 flags = BC_PARSE_FLAG_FUNC | BC_PARSE_FLAG_FUNC_INNER | BC_PARSE_FLAG_BODY;
4420 bc_parse_startBody(p, flags);
4422 s = bc_lex_next(&p->l);
4425 if (p->l.t.t != BC_LEX_LBRACE)
4426 s = bc_posix_error("POSIX requires the left brace be on the same line as the function header");
4435 static BcStatus bc_parse_auto(BcParse *p)
4438 bool comma, var, one;
4441 if (!p->auto_part) return bc_error_bad_token();
4442 s = bc_lex_next(&p->l);
4445 p->auto_part = comma = false;
4446 one = p->l.t.t == BC_LEX_NAME;
4448 while (p->l.t.t == BC_LEX_NAME) {
4450 name = xstrdup(p->l.t.v.v);
4451 s = bc_lex_next(&p->l);
4454 var = p->l.t.t != BC_LEX_LBRACKET;
4457 s = bc_lex_next(&p->l);
4460 if (p->l.t.t != BC_LEX_RBRACKET) {
4461 s = bc_error("bad function definition");
4465 s = bc_lex_next(&p->l);
4469 comma = p->l.t.t == BC_LEX_COMMA;
4471 s = bc_lex_next(&p->l);
4475 s = bc_func_insert(p->func, name, var);
4479 if (comma) return bc_error("bad function definition");
4480 if (!one) return bc_error("no auto variable found");
4482 if (p->l.t.t != BC_LEX_NLINE && p->l.t.t != BC_LEX_SCOLON)
4483 return bc_error_bad_token();
4485 return bc_lex_next(&p->l);
4492 static BcStatus bc_parse_body(BcParse *p, bool brace)
4494 BcStatus s = BC_STATUS_SUCCESS;
4495 uint8_t *flag_ptr = bc_vec_top(&p->flags);
4497 *flag_ptr &= ~(BC_PARSE_FLAG_BODY);
4499 if (*flag_ptr & BC_PARSE_FLAG_FUNC_INNER) {
4501 if (!brace) return bc_error_bad_token();
4502 p->auto_part = p->l.t.t != BC_LEX_KEY_AUTO;
4504 if (!p->auto_part) {
4505 s = bc_parse_auto(p);
4509 if (p->l.t.t == BC_LEX_NLINE) s = bc_lex_next(&p->l);
4512 s = bc_parse_stmt(p);
4513 if (!s && !brace) s = bc_parse_endBody(p, false);
4519 static BcStatus bc_parse_stmt(BcParse *p)
4521 BcStatus s = BC_STATUS_SUCCESS;
4527 return bc_lex_next(&p->l);
4530 case BC_LEX_KEY_ELSE:
4532 p->auto_part = false;
4538 if (!BC_PARSE_BODY(p)) return bc_error_bad_token();
4541 s = bc_lex_next(&p->l);
4544 return bc_parse_body(p, true);
4547 case BC_LEX_KEY_AUTO:
4549 return bc_parse_auto(p);
4554 p->auto_part = false;
4556 if (BC_PARSE_IF_END(p)) {
4558 return BC_STATUS_SUCCESS;
4560 else if (BC_PARSE_BODY(p))
4561 return bc_parse_body(p, false);
4571 case BC_LEX_OP_MINUS:
4572 case BC_LEX_OP_BOOL_NOT:
4576 case BC_LEX_KEY_IBASE:
4577 case BC_LEX_KEY_LAST:
4578 case BC_LEX_KEY_LENGTH:
4579 case BC_LEX_KEY_OBASE:
4580 case BC_LEX_KEY_READ:
4581 case BC_LEX_KEY_SCALE:
4582 case BC_LEX_KEY_SQRT:
4584 s = bc_parse_expr(p, BC_PARSE_PRINT, bc_parse_next_expr);
4588 case BC_LEX_KEY_ELSE:
4590 s = bc_parse_else(p);
4596 while (!s && p->l.t.t == BC_LEX_SCOLON) s = bc_lex_next(&p->l);
4602 s = bc_parse_endBody(p, true);
4608 s = bc_parse_string(p, BC_INST_PRINT_STR);
4612 case BC_LEX_KEY_BREAK:
4613 case BC_LEX_KEY_CONTINUE:
4615 s = bc_parse_loopExit(p, p->l.t.t);
4619 case BC_LEX_KEY_FOR:
4621 s = bc_parse_for(p);
4625 case BC_LEX_KEY_HALT:
4627 bc_parse_push(p, BC_INST_HALT);
4628 s = bc_lex_next(&p->l);
4638 case BC_LEX_KEY_LIMITS:
4640 // "limits" is a compile-time command,
4641 // the output is produced at _parse time_.
4642 s = bc_lex_next(&p->l);
4644 printf("BC_BASE_MAX = %u\n", BC_MAX_OBASE);
4645 printf("BC_DIM_MAX = %u\n", BC_MAX_DIM);
4646 printf("BC_SCALE_MAX = %u\n", BC_MAX_SCALE);
4647 printf("BC_STRING_MAX = %u\n", BC_MAX_STRING);
4648 printf("BC_NAME_MAX = %u\n", BC_MAX_NAME);
4649 printf("BC_NUM_MAX = %u\n", BC_MAX_NUM);
4650 printf("MAX Exponent = %lu\n", BC_MAX_EXP);
4651 printf("Number of vars = %lu\n", BC_MAX_VARS);
4655 case BC_LEX_KEY_PRINT:
4657 s = bc_parse_print(p);
4661 case BC_LEX_KEY_QUIT:
4663 // "quit" is a compile-time command. For example,
4664 // "if (0 == 1) quit" terminates when parsing the statement,
4665 // not when it is executed
4669 case BC_LEX_KEY_RETURN:
4671 s = bc_parse_return(p);
4675 case BC_LEX_KEY_WHILE:
4677 s = bc_parse_while(p);
4683 s = bc_error_bad_token();
4691 static BcStatus bc_parse_parse(BcParse *p)
4695 if (p->l.t.t == BC_LEX_EOF)
4696 s = p->flags.len > 0 ? bc_error("block end could not be found") : bc_error("end of file");
4697 else if (p->l.t.t == BC_LEX_KEY_DEFINE) {
4698 if (!BC_PARSE_CAN_EXEC(p)) return bc_error_bad_token();
4699 s = bc_parse_func(p);
4702 s = bc_parse_stmt(p);
4704 if (s || G_interrupt) {
4706 s = BC_STATUS_FAILURE;
4712 static BcStatus bc_parse_expr(BcParse *p, uint8_t flags, BcParseNext next)
4714 BcStatus s = BC_STATUS_SUCCESS;
4715 BcInst prev = BC_INST_PRINT;
4716 BcLexType top, t = p->l.t.t;
4717 size_t nexprs = 0, ops_bgn = p->ops.len;
4718 uint32_t i, nparens, nrelops;
4719 bool paren_first, paren_expr, rprn, done, get_token, assign, bin_last;
4721 paren_first = p->l.t.t == BC_LEX_LPAREN;
4722 nparens = nrelops = 0;
4723 paren_expr = rprn = done = get_token = assign = false;
4726 for (; !G_interrupt && !s && !done && bc_parse_exprs(t); t = p->l.t.t) {
4732 s = bc_parse_incdec(p, &prev, &paren_expr, &nexprs, flags);
4733 rprn = get_token = bin_last = false;
4737 case BC_LEX_OP_MINUS:
4739 s = bc_parse_minus(p, &prev, ops_bgn, rprn, &nexprs);
4740 rprn = get_token = false;
4741 bin_last = prev == BC_INST_MINUS;
4745 case BC_LEX_OP_ASSIGN_POWER:
4746 case BC_LEX_OP_ASSIGN_MULTIPLY:
4747 case BC_LEX_OP_ASSIGN_DIVIDE:
4748 case BC_LEX_OP_ASSIGN_MODULUS:
4749 case BC_LEX_OP_ASSIGN_PLUS:
4750 case BC_LEX_OP_ASSIGN_MINUS:
4751 case BC_LEX_OP_ASSIGN:
4753 if (prev != BC_INST_VAR && prev != BC_INST_ARRAY_ELEM &&
4754 prev != BC_INST_SCALE && prev != BC_INST_IBASE &&
4755 prev != BC_INST_OBASE && prev != BC_INST_LAST)
4757 s = bc_error("bad assignment:"
4758 " left side must be scale,"
4759 " ibase, obase, last, var,"
4766 case BC_LEX_OP_POWER:
4767 case BC_LEX_OP_MULTIPLY:
4768 case BC_LEX_OP_DIVIDE:
4769 case BC_LEX_OP_MODULUS:
4770 case BC_LEX_OP_PLUS:
4771 case BC_LEX_OP_REL_EQ:
4772 case BC_LEX_OP_REL_LE:
4773 case BC_LEX_OP_REL_GE:
4774 case BC_LEX_OP_REL_NE:
4775 case BC_LEX_OP_REL_LT:
4776 case BC_LEX_OP_REL_GT:
4777 case BC_LEX_OP_BOOL_NOT:
4778 case BC_LEX_OP_BOOL_OR:
4779 case BC_LEX_OP_BOOL_AND:
4781 if (((t == BC_LEX_OP_BOOL_NOT) != bin_last)
4782 || (t != BC_LEX_OP_BOOL_NOT && prev == BC_INST_BOOL_NOT)
4784 return bc_error_bad_expression();
4787 nrelops += t >= BC_LEX_OP_REL_EQ && t <= BC_LEX_OP_REL_GT;
4788 prev = BC_PARSE_TOKEN_INST(t);
4789 s = bc_parse_operator(p, t, ops_bgn, &nexprs, true);
4790 rprn = get_token = false;
4791 bin_last = t != BC_LEX_OP_BOOL_NOT;
4798 if (BC_PARSE_LEAF(prev, rprn))
4799 return bc_error_bad_expression();
4801 paren_expr = rprn = bin_last = false;
4803 bc_vec_push(&p->ops, &t);
4810 if (bin_last || prev == BC_INST_BOOL_NOT)
4811 return bc_error_bad_expression();
4814 s = BC_STATUS_SUCCESS;
4819 else if (!paren_expr)
4820 return BC_STATUS_PARSE_EMPTY_EXP;
4823 paren_expr = rprn = true;
4824 get_token = bin_last = false;
4826 s = bc_parse_rightParen(p, ops_bgn, &nexprs);
4833 if (BC_PARSE_LEAF(prev, rprn))
4834 return bc_error_bad_expression();
4836 rprn = get_token = bin_last = false;
4837 s = bc_parse_name(p, &prev, flags & ~BC_PARSE_NOCALL);
4845 if (BC_PARSE_LEAF(prev, rprn))
4846 return bc_error_bad_expression();
4847 bc_parse_number(p, &prev, &nexprs);
4848 paren_expr = get_token = true;
4849 rprn = bin_last = false;
4854 case BC_LEX_KEY_IBASE:
4855 case BC_LEX_KEY_LAST:
4856 case BC_LEX_KEY_OBASE:
4858 if (BC_PARSE_LEAF(prev, rprn))
4859 return bc_error_bad_expression();
4860 prev = (char) (t - BC_LEX_KEY_IBASE + BC_INST_IBASE);
4861 bc_parse_push(p, (char) prev);
4863 paren_expr = get_token = true;
4864 rprn = bin_last = false;
4870 case BC_LEX_KEY_LENGTH:
4871 case BC_LEX_KEY_SQRT:
4873 if (BC_PARSE_LEAF(prev, rprn))
4874 return bc_error_bad_expression();
4875 s = bc_parse_builtin(p, t, flags, &prev);
4877 rprn = get_token = bin_last = false;
4883 case BC_LEX_KEY_READ:
4885 if (BC_PARSE_LEAF(prev, rprn))
4886 return bc_error_bad_expression();
4887 else if (flags & BC_PARSE_NOREAD)
4888 s = bc_error_nested_read_call();
4890 s = bc_parse_read(p);
4893 rprn = get_token = bin_last = false;
4895 prev = BC_INST_READ;
4900 case BC_LEX_KEY_SCALE:
4902 if (BC_PARSE_LEAF(prev, rprn))
4903 return bc_error_bad_expression();
4904 s = bc_parse_scale(p, &prev, flags);
4906 rprn = get_token = bin_last = false;
4908 prev = BC_INST_SCALE;
4915 s = bc_error_bad_token();
4920 if (!s && get_token) s = bc_lex_next(&p->l);
4924 if (G_interrupt) return BC_STATUS_FAILURE; // ^C: stop parsing
4926 while (p->ops.len > ops_bgn) {
4928 top = BC_PARSE_TOP_OP(p);
4929 assign = top >= BC_LEX_OP_ASSIGN_POWER && top <= BC_LEX_OP_ASSIGN;
4931 if (top == BC_LEX_LPAREN || top == BC_LEX_RPAREN)
4932 return bc_error_bad_expression();
4934 bc_parse_push(p, BC_PARSE_TOKEN_INST(top));
4936 nexprs -= top != BC_LEX_OP_BOOL_NOT && top != BC_LEX_NEG;
4937 bc_vec_pop(&p->ops);
4940 if (prev == BC_INST_BOOL_NOT || nexprs != 1)
4941 return bc_error_bad_expression();
4943 for (i = 0; i < next.len; ++i)
4944 if (t == next.tokens[i])
4946 return bc_error_bad_expression();
4949 if (!(flags & BC_PARSE_REL) && nrelops) {
4950 s = bc_POSIX_does_not_allow("comparison operators outside if or loops");
4953 else if ((flags & BC_PARSE_REL) && nrelops > 1) {
4954 s = bc_posix_error("POSIX requires exactly one comparison operator per condition");
4958 if (flags & BC_PARSE_PRINT) {
4959 if (paren_first || !assign) bc_parse_push(p, BC_INST_PRINT);
4960 bc_parse_push(p, BC_INST_POP);
4966 static void bc_parse_init(BcParse *p, size_t func)
4968 bc_parse_create(p, func, bc_parse_parse, bc_lex_token);
4971 static BcStatus bc_parse_expression(BcParse *p, uint8_t flags)
4973 return bc_parse_expr(p, flags, bc_parse_next_read);
4978 static BcStatus dc_parse_register(BcParse *p)
4983 s = bc_lex_next(&p->l);
4985 if (p->l.t.t != BC_LEX_NAME) return bc_error_bad_token();
4987 name = xstrdup(p->l.t.v.v);
4988 bc_parse_pushName(p, name);
4993 static BcStatus dc_parse_string(BcParse *p)
4995 char *str, *name, b[DC_PARSE_BUF_LEN + 1];
4996 size_t idx, len = G.prog.strs.len;
4998 sprintf(b, "%0*zu", DC_PARSE_BUF_LEN, len);
5001 str = xstrdup(p->l.t.v.v);
5002 bc_parse_push(p, BC_INST_STR);
5003 bc_parse_pushIndex(p, len);
5004 bc_vec_push(&G.prog.strs, &str);
5005 bc_parse_addFunc(p, name, &idx);
5007 return bc_lex_next(&p->l);
5010 static BcStatus dc_parse_mem(BcParse *p, uint8_t inst, bool name, bool store)
5014 bc_parse_push(p, inst);
5016 s = dc_parse_register(p);
5021 bc_parse_push(p, BC_INST_SWAP);
5022 bc_parse_push(p, BC_INST_ASSIGN);
5023 bc_parse_push(p, BC_INST_POP);
5026 return bc_lex_next(&p->l);
5029 static BcStatus dc_parse_cond(BcParse *p, uint8_t inst)
5033 bc_parse_push(p, inst);
5034 bc_parse_push(p, BC_INST_EXEC_COND);
5036 s = dc_parse_register(p);
5039 s = bc_lex_next(&p->l);
5042 if (p->l.t.t == BC_LEX_ELSE) {
5043 s = dc_parse_register(p);
5045 s = bc_lex_next(&p->l);
5048 bc_parse_push(p, BC_PARSE_STREND);
5053 static BcStatus dc_parse_token(BcParse *p, BcLexType t, uint8_t flags)
5055 BcStatus s = BC_STATUS_SUCCESS;
5058 bool assign, get_token = false;
5062 case BC_LEX_OP_REL_EQ:
5063 case BC_LEX_OP_REL_LE:
5064 case BC_LEX_OP_REL_GE:
5065 case BC_LEX_OP_REL_NE:
5066 case BC_LEX_OP_REL_LT:
5067 case BC_LEX_OP_REL_GT:
5069 s = dc_parse_cond(p, t - BC_LEX_OP_REL_EQ + BC_INST_REL_EQ);
5076 s = dc_parse_mem(p, BC_INST_ARRAY_ELEM, true, t == BC_LEX_COLON);
5082 s = dc_parse_string(p);
5089 if (t == BC_LEX_NEG) {
5090 s = bc_lex_next(&p->l);
5092 if (p->l.t.t != BC_LEX_NUMBER)
5093 return bc_error_bad_token();
5096 bc_parse_number(p, &prev, &p->nbraces);
5098 if (t == BC_LEX_NEG) bc_parse_push(p, BC_INST_NEG);
5104 case BC_LEX_KEY_READ:
5106 if (flags & BC_PARSE_NOREAD)
5107 s = bc_error_nested_read_call();
5109 bc_parse_push(p, BC_INST_READ);
5114 case BC_LEX_OP_ASSIGN:
5115 case BC_LEX_STORE_PUSH:
5117 assign = t == BC_LEX_OP_ASSIGN;
5118 inst = assign ? BC_INST_VAR : BC_INST_PUSH_TO_VAR;
5119 s = dc_parse_mem(p, inst, true, assign);
5124 case BC_LEX_LOAD_POP:
5126 inst = t == BC_LEX_LOAD_POP ? BC_INST_PUSH_VAR : BC_INST_LOAD;
5127 s = dc_parse_mem(p, inst, true, false);
5131 case BC_LEX_STORE_IBASE:
5132 case BC_LEX_STORE_SCALE:
5133 case BC_LEX_STORE_OBASE:
5135 inst = t - BC_LEX_STORE_IBASE + BC_INST_IBASE;
5136 s = dc_parse_mem(p, inst, false, true);
5142 s = bc_error_bad_token();
5148 if (!s && get_token) s = bc_lex_next(&p->l);
5153 static BcStatus dc_parse_expr(BcParse *p, uint8_t flags)
5155 BcStatus s = BC_STATUS_SUCCESS;
5159 if (flags & BC_PARSE_NOCALL) p->nbraces = G.prog.results.len;
5161 for (t = p->l.t.t; !s && t != BC_LEX_EOF; t = p->l.t.t) {
5163 inst = dc_parse_insts[t];
5165 if (inst != BC_INST_INVALID) {
5166 bc_parse_push(p, inst);
5167 s = bc_lex_next(&p->l);
5170 s = dc_parse_token(p, t, flags);
5173 if (!s && p->l.t.t == BC_LEX_EOF && (flags & BC_PARSE_NOCALL))
5174 bc_parse_push(p, BC_INST_POP_EXEC);
5179 static BcStatus dc_parse_parse(BcParse *p)
5183 if (p->l.t.t == BC_LEX_EOF)
5184 s = bc_error("end of file");
5186 s = dc_parse_expr(p, 0);
5188 if (s || G_interrupt) {
5190 s = BC_STATUS_FAILURE;
5196 static void dc_parse_init(BcParse *p, size_t func)
5198 bc_parse_create(p, func, dc_parse_parse, dc_lex_token);
5202 static void common_parse_init(BcParse *p, size_t func)
5205 bc_parse_init(p, func);
5207 dc_parse_init(p, func);
5211 static BcStatus common_parse_expr(BcParse *p, uint8_t flags)
5214 return bc_parse_expression(p, flags);
5216 return dc_parse_expr(p, flags);
5220 static BcVec* bc_program_search(char *id, bool var)
5228 v = var ? &G.prog.vars : &G.prog.arrs;
5229 map = var ? &G.prog.var_map : &G.prog.arr_map;
5233 new = bc_map_insert(map, &e, &i); // 1 if insertion was successful
5236 bc_array_init(&data.v, var);
5237 bc_vec_push(v, &data.v);
5240 ptr = bc_vec_item(map, i);
5241 if (new) ptr->name = xstrdup(e.name);
5242 return bc_vec_item(v, ptr->idx);
5245 static BcStatus bc_program_num(BcResult *r, BcNum **num, bool hex)
5247 BcStatus s = BC_STATUS_SUCCESS;
5252 case BC_RESULT_TEMP:
5253 case BC_RESULT_IBASE:
5254 case BC_RESULT_SCALE:
5255 case BC_RESULT_OBASE:
5261 case BC_RESULT_CONSTANT:
5263 char **str = bc_vec_item(&G.prog.consts, r->d.id.idx);
5264 size_t base_t, len = strlen(*str);
5267 bc_num_init(&r->d.n, len);
5269 hex = hex && len == 1;
5270 base = hex ? &G.prog.hexb : &G.prog.ib;
5271 base_t = hex ? BC_NUM_MAX_IBASE : G.prog.ib_t;
5272 s = bc_num_parse(&r->d.n, *str, base, base_t);
5275 bc_num_free(&r->d.n);
5280 r->t = BC_RESULT_TEMP;
5286 case BC_RESULT_ARRAY:
5287 case BC_RESULT_ARRAY_ELEM:
5291 v = bc_program_search(r->d.id.name, r->t == BC_RESULT_VAR);
5293 if (r->t == BC_RESULT_ARRAY_ELEM) {
5295 if (v->len <= r->d.id.idx) bc_array_expand(v, r->d.id.idx + 1);
5296 *num = bc_vec_item(v, r->d.id.idx);
5299 *num = bc_vec_top(v);
5304 case BC_RESULT_LAST:
5306 *num = &G.prog.last;
5320 static BcStatus bc_program_binOpPrep(BcResult **l, BcNum **ln,
5321 BcResult **r, BcNum **rn, bool assign)
5325 BcResultType lt, rt;
5327 if (!BC_PROG_STACK(&G.prog.results, 2))
5328 return bc_error_stack_has_too_few_elements();
5330 *r = bc_vec_item_rev(&G.prog.results, 0);
5331 *l = bc_vec_item_rev(&G.prog.results, 1);
5335 hex = assign && (lt == BC_RESULT_IBASE || lt == BC_RESULT_OBASE);
5337 s = bc_program_num(*l, ln, false);
5339 s = bc_program_num(*r, rn, hex);
5342 // We run this again under these conditions in case any vector has been
5343 // reallocated out from under the BcNums or arrays we had.
5344 if (lt == rt && (lt == BC_RESULT_VAR || lt == BC_RESULT_ARRAY_ELEM)) {
5345 s = bc_program_num(*l, ln, false);
5349 if (!BC_PROG_NUM((*l), (*ln)) && (!assign || (*l)->t != BC_RESULT_VAR))
5350 return bc_error_variable_is_wrong_type();
5351 if (!assign && !BC_PROG_NUM((*r), (*ln)))
5352 return bc_error_variable_is_wrong_type();
5357 static void bc_program_binOpRetire(BcResult *r)
5359 r->t = BC_RESULT_TEMP;
5360 bc_vec_pop(&G.prog.results);
5361 bc_vec_pop(&G.prog.results);
5362 bc_vec_push(&G.prog.results, r);
5365 static BcStatus bc_program_prep(BcResult **r, BcNum **n)
5369 if (!BC_PROG_STACK(&G.prog.results, 1))
5370 return bc_error_stack_has_too_few_elements();
5371 *r = bc_vec_top(&G.prog.results);
5373 s = bc_program_num(*r, n, false);
5376 if (!BC_PROG_NUM((*r), (*n)))
5377 return bc_error_variable_is_wrong_type();
5382 static void bc_program_retire(BcResult *r, BcResultType t)
5385 bc_vec_pop(&G.prog.results);
5386 bc_vec_push(&G.prog.results, r);
5389 static BcStatus bc_program_op(char inst)
5392 BcResult *opd1, *opd2, res;
5393 BcNum *n1, *n2 = NULL;
5395 s = bc_program_binOpPrep(&opd1, &n1, &opd2, &n2, false);
5397 bc_num_init(&res.d.n, BC_NUM_DEF_SIZE);
5399 s = bc_program_ops[inst - BC_INST_POWER](n1, n2, &res.d.n, G.prog.scale);
5401 bc_program_binOpRetire(&res);
5406 bc_num_free(&res.d.n);
5410 static BcStatus bc_program_read(void)
5412 const char *sv_file;
5418 BcFunc *f = bc_vec_item(&G.prog.fns, BC_PROG_READ);
5420 for (i = 0; i < G.prog.stack.len; ++i) {
5421 BcInstPtr *ip_ptr = bc_vec_item(&G.prog.stack, i);
5422 if (ip_ptr->func == BC_PROG_READ)
5423 return bc_error_nested_read_call();
5426 bc_vec_pop_all(&f->code);
5427 bc_char_vec_init(&buf);
5429 sv_file = G.prog.file;
5432 s = bc_read_line(&buf, "read> ");
5435 common_parse_init(&parse, BC_PROG_READ);
5436 bc_lex_file(&parse.l);
5438 s = bc_parse_text(&parse, buf.v);
5439 if (s) goto exec_err;
5440 s = common_parse_expr(&parse, BC_PARSE_NOREAD);
5441 if (s) goto exec_err;
5443 if (parse.l.t.t != BC_LEX_NLINE && parse.l.t.t != BC_LEX_EOF) {
5444 s = bc_error("bad read() expression");
5448 ip.func = BC_PROG_READ;
5450 ip.len = G.prog.results.len;
5452 // Update this pointer, just in case.
5453 f = bc_vec_item(&G.prog.fns, BC_PROG_READ);
5455 bc_vec_pushByte(&f->code, BC_INST_POP_EXEC);
5456 bc_vec_push(&G.prog.stack, &ip);
5459 G.prog.file = sv_file;
5460 bc_parse_free(&parse);
5466 static size_t bc_program_index(char *code, size_t *bgn)
5468 char amt = code[(*bgn)++], i = 0;
5471 for (; i < amt; ++i, ++(*bgn))
5472 res |= (((size_t)((int) code[*bgn]) & UCHAR_MAX) << (i * CHAR_BIT));
5477 static char *bc_program_name(char *code, size_t *bgn)
5480 char c, *s, *str = code + *bgn, *ptr = strchr(str, BC_PARSE_STREND);
5482 s = xmalloc(ptr - str + 1);
5485 for (i = 0; c != 0 && c != BC_PARSE_STREND; c = code[(*bgn)++], ++i)
5493 static void bc_program_printString(const char *str, size_t *nchars)
5495 size_t i, len = strlen(str);
5504 for (i = 0; i < len; ++i, ++(*nchars)) {
5508 if (c != '\\' || i == len - 1)
5568 // Just print the backslash and following character.
5579 static BcStatus bc_program_print(char inst, size_t idx)
5581 BcStatus s = BC_STATUS_SUCCESS;
5586 bool pop = inst != BC_INST_PRINT;
5588 if (!BC_PROG_STACK(&G.prog.results, idx + 1))
5589 return bc_error_stack_has_too_few_elements();
5591 r = bc_vec_item_rev(&G.prog.results, idx);
5592 s = bc_program_num(r, &num, false);
5595 if (BC_PROG_NUM(r, num)) {
5596 s = bc_num_print(num, &G.prog.ob, G.prog.ob_t, !pop, &G.prog.nchars, G.prog.len);
5597 if (!s) bc_num_copy(&G.prog.last, num);
5601 idx = (r->t == BC_RESULT_STR) ? r->d.id.idx : num->rdx;
5602 str = *((char **) bc_vec_item(&G.prog.strs, idx));
5604 if (inst == BC_INST_PRINT_STR) {
5605 for (i = 0, len = strlen(str); i < len; ++i) {
5608 if (c == '\n') G.prog.nchars = SIZE_MAX;
5613 bc_program_printString(str, &G.prog.nchars);
5614 if (inst == BC_INST_PRINT) bb_putchar('\n');
5618 if (!s && pop) bc_vec_pop(&G.prog.results);
5623 static BcStatus bc_program_negate(void)
5629 s = bc_program_prep(&ptr, &num);
5632 bc_num_init(&res.d.n, num->len);
5633 bc_num_copy(&res.d.n, num);
5634 if (res.d.n.len) res.d.n.neg = !res.d.n.neg;
5636 bc_program_retire(&res, BC_RESULT_TEMP);
5641 static BcStatus bc_program_logical(char inst)
5644 BcResult *opd1, *opd2, res;
5649 s = bc_program_binOpPrep(&opd1, &n1, &opd2, &n2, false);
5651 bc_num_init(&res.d.n, BC_NUM_DEF_SIZE);
5653 if (inst == BC_INST_BOOL_AND)
5654 cond = bc_num_cmp(n1, &G.prog.zero) && bc_num_cmp(n2, &G.prog.zero);
5655 else if (inst == BC_INST_BOOL_OR)
5656 cond = bc_num_cmp(n1, &G.prog.zero) || bc_num_cmp(n2, &G.prog.zero);
5659 cmp = bc_num_cmp(n1, n2);
5663 case BC_INST_REL_EQ:
5669 case BC_INST_REL_LE:
5675 case BC_INST_REL_GE:
5681 case BC_INST_REL_NE:
5687 case BC_INST_REL_LT:
5693 case BC_INST_REL_GT:
5701 (cond ? bc_num_one : bc_num_zero)(&res.d.n);
5703 bc_program_binOpRetire(&res);
5709 static BcStatus bc_program_assignStr(BcResult *r, BcVec *v,
5715 memset(&n2, 0, sizeof(BcNum));
5716 n2.rdx = res.d.id.idx = r->d.id.idx;
5717 res.t = BC_RESULT_STR;
5720 if (!BC_PROG_STACK(&G.prog.results, 2))
5721 return bc_error_stack_has_too_few_elements();
5723 bc_vec_pop(&G.prog.results);
5726 bc_vec_pop(&G.prog.results);
5728 bc_vec_push(&G.prog.results, &res);
5729 bc_vec_push(v, &n2);
5731 return BC_STATUS_SUCCESS;
5735 static BcStatus bc_program_copyToVar(char *name, bool var)
5742 if (!BC_PROG_STACK(&G.prog.results, 1))
5743 return bc_error_stack_has_too_few_elements();
5745 ptr = bc_vec_top(&G.prog.results);
5746 if ((ptr->t == BC_RESULT_ARRAY) != !var)
5747 return bc_error_variable_is_wrong_type();
5748 v = bc_program_search(name, var);
5751 if (ptr->t == BC_RESULT_STR && !var)
5752 return bc_error_variable_is_wrong_type();
5753 if (ptr->t == BC_RESULT_STR) return bc_program_assignStr(ptr, v, true);
5756 s = bc_program_num(ptr, &n, false);
5759 // Do this once more to make sure that pointers were not invalidated.
5760 v = bc_program_search(name, var);
5763 bc_num_init(&r.d.n, BC_NUM_DEF_SIZE);
5764 bc_num_copy(&r.d.n, n);
5767 bc_array_init(&r.d.v, true);
5768 bc_array_copy(&r.d.v, (BcVec *) n);
5771 bc_vec_push(v, &r.d);
5772 bc_vec_pop(&G.prog.results);
5777 static BcStatus bc_program_assign(char inst)
5780 BcResult *left, *right, res;
5781 BcNum *l = NULL, *r = NULL;
5782 unsigned long val, max;
5783 bool assign = inst == BC_INST_ASSIGN, ib, sc;
5785 s = bc_program_binOpPrep(&left, &l, &right, &r, assign);
5788 ib = left->t == BC_RESULT_IBASE;
5789 sc = left->t == BC_RESULT_SCALE;
5793 if (right->t == BC_RESULT_STR) {
5797 if (left->t != BC_RESULT_VAR)
5798 return bc_error_variable_is_wrong_type();
5799 v = bc_program_search(left->d.id.name, true);
5801 return bc_program_assignStr(right, v, false);
5805 if (left->t == BC_RESULT_CONSTANT || left->t == BC_RESULT_TEMP)
5806 return bc_error("bad assignment:"
5807 " left side must be scale,"
5808 " ibase, obase, last, var,"
5813 if (inst == BC_INST_ASSIGN_DIVIDE && !bc_num_cmp(r, &G.prog.zero))
5814 return bc_error("divide by zero");
5819 s = bc_program_ops[inst - BC_INST_ASSIGN_POWER](l, r, l, G.prog.scale);
5826 if (ib || sc || left->t == BC_RESULT_OBASE) {
5827 static const char *const msg[] = {
5828 "bad ibase; must be [2, 16]", //BC_RESULT_IBASE
5829 "bad scale; must be [0, BC_SCALE_MAX]", //BC_RESULT_SCALE
5830 "?1", //BC_RESULT_LAST
5831 "?2", //BC_RESULT_CONSTANT
5832 "?3", //BC_RESULT_ONE
5833 "bad obase; must be [2, BC_BASE_MAX]", //BC_RESULT_OBASE
5837 s = bc_num_ulong(l, &val);
5840 s = left->t - BC_RESULT_IBASE;
5843 ptr = &G.prog.scale;
5846 if (val < BC_NUM_MIN_BASE)
5847 return bc_error(msg[s]);
5848 max = ib ? BC_NUM_MAX_IBASE : BC_MAX_OBASE;
5849 ptr = ib ? &G.prog.ib_t : &G.prog.ob_t;
5853 return bc_error(msg[s]);
5855 bc_num_copy(ib ? &G.prog.ib : &G.prog.ob, l);
5857 *ptr = (size_t) val;
5858 s = BC_STATUS_SUCCESS;
5861 bc_num_init(&res.d.n, l->len);
5862 bc_num_copy(&res.d.n, l);
5863 bc_program_binOpRetire(&res);
5869 #define bc_program_pushVar(code, bgn, pop, copy) \
5870 bc_program_pushVar(code, bgn)
5871 // for bc, 'pop' and 'copy' are always false
5873 static BcStatus bc_program_pushVar(char *code, size_t *bgn,
5874 bool pop, bool copy)
5876 BcStatus s = BC_STATUS_SUCCESS;
5878 char *name = bc_program_name(code, bgn);
5880 r.t = BC_RESULT_VAR;
5885 BcVec *v = bc_program_search(name, true);
5886 BcNum *num = bc_vec_top(v);
5890 if (!BC_PROG_STACK(v, 2 - copy)) {
5892 return bc_error_stack_has_too_few_elements();
5898 if (!BC_PROG_STR(num)) {
5900 r.t = BC_RESULT_TEMP;
5902 bc_num_init(&r.d.n, BC_NUM_DEF_SIZE);
5903 bc_num_copy(&r.d.n, num);
5906 r.t = BC_RESULT_STR;
5907 r.d.id.idx = num->rdx;
5910 if (!copy) bc_vec_pop(v);
5915 bc_vec_push(&G.prog.results, &r);
5920 static BcStatus bc_program_pushArray(char *code, size_t *bgn,
5923 BcStatus s = BC_STATUS_SUCCESS;
5927 r.d.id.name = bc_program_name(code, bgn);
5929 if (inst == BC_INST_ARRAY) {
5930 r.t = BC_RESULT_ARRAY;
5931 bc_vec_push(&G.prog.results, &r);
5938 s = bc_program_prep(&operand, &num);
5940 s = bc_num_ulong(num, &temp);
5943 if (temp > BC_MAX_DIM) {
5944 s = bc_error("array too long; must be [1, BC_DIM_MAX]");
5948 r.d.id.idx = (size_t) temp;
5949 bc_program_retire(&r, BC_RESULT_ARRAY_ELEM);
5953 if (s) free(r.d.id.name);
5958 static BcStatus bc_program_incdec(char inst)
5961 BcResult *ptr, res, copy;
5965 s = bc_program_prep(&ptr, &num);
5968 if (inst == BC_INST_INC_POST || inst == BC_INST_DEC_POST) {
5969 copy.t = BC_RESULT_TEMP;
5970 bc_num_init(©.d.n, num->len);
5971 bc_num_copy(©.d.n, num);
5974 res.t = BC_RESULT_ONE;
5975 inst = inst == BC_INST_INC_PRE || inst == BC_INST_INC_POST ?
5976 BC_INST_ASSIGN_PLUS :
5977 BC_INST_ASSIGN_MINUS;
5979 bc_vec_push(&G.prog.results, &res);
5980 bc_program_assign(inst);
5982 if (inst2 == BC_INST_INC_POST || inst2 == BC_INST_DEC_POST) {
5983 bc_vec_pop(&G.prog.results);
5984 bc_vec_push(&G.prog.results, ©);
5990 static BcStatus bc_program_call(char *code, size_t *idx)
5992 BcStatus s = BC_STATUS_SUCCESS;
5994 size_t i, nparams = bc_program_index(code, idx);
6001 ip.func = bc_program_index(code, idx);
6002 func = bc_vec_item(&G.prog.fns, ip.func);
6004 if (func->code.len == 0) {
6005 return bc_error("undefined function");
6007 if (nparams != func->nparams) {
6008 return bc_error_fmt("function has %u parameters, but called with %u", func->nparams, nparams);
6010 ip.len = G.prog.results.len - nparams;
6012 for (i = 0; i < nparams; ++i) {
6014 a = bc_vec_item(&func->autos, nparams - 1 - i);
6015 arg = bc_vec_top(&G.prog.results);
6017 if ((!a->idx) != (arg->t == BC_RESULT_ARRAY) || arg->t == BC_RESULT_STR)
6018 return bc_error_variable_is_wrong_type();
6020 s = bc_program_copyToVar(a->name, a->idx);
6024 for (; i < func->autos.len; ++i) {
6027 a = bc_vec_item(&func->autos, i);
6028 v = bc_program_search(a->name, a->idx);
6031 bc_num_init(¶m.n, BC_NUM_DEF_SIZE);
6032 bc_vec_push(v, ¶m.n);
6035 bc_array_init(¶m.v, true);
6036 bc_vec_push(v, ¶m.v);
6040 bc_vec_push(&G.prog.stack, &ip);
6042 return BC_STATUS_SUCCESS;
6045 static BcStatus bc_program_return(char inst)
6051 BcInstPtr *ip = bc_vec_top(&G.prog.stack);
6053 if (!BC_PROG_STACK(&G.prog.results, ip->len + inst == BC_INST_RET))
6054 return bc_error_stack_has_too_few_elements();
6056 f = bc_vec_item(&G.prog.fns, ip->func);
6057 res.t = BC_RESULT_TEMP;
6059 if (inst == BC_INST_RET) {
6062 BcResult *operand = bc_vec_top(&G.prog.results);
6064 s = bc_program_num(operand, &num, false);
6066 bc_num_init(&res.d.n, num->len);
6067 bc_num_copy(&res.d.n, num);
6070 bc_num_init(&res.d.n, BC_NUM_DEF_SIZE);
6071 bc_num_zero(&res.d.n);
6074 // We need to pop arguments as well, so this takes that into account.
6075 for (i = 0; i < f->autos.len; ++i) {
6078 BcId *a = bc_vec_item(&f->autos, i);
6080 v = bc_program_search(a->name, a->idx);
6084 bc_vec_npop(&G.prog.results, G.prog.results.len - ip->len);
6085 bc_vec_push(&G.prog.results, &res);
6086 bc_vec_pop(&G.prog.stack);
6088 return BC_STATUS_SUCCESS;
6092 static unsigned long bc_program_scale(BcNum *n)
6094 return (unsigned long) n->rdx;
6097 static unsigned long bc_program_len(BcNum *n)
6099 unsigned long len = n->len;
6102 if (n->rdx != n->len) return len;
6103 for (i = n->len - 1; i < n->len && n->num[i] == 0; --len, --i);
6108 static BcStatus bc_program_builtin(char inst)
6114 bool len = inst == BC_INST_LENGTH;
6116 if (!BC_PROG_STACK(&G.prog.results, 1))
6117 return bc_error_stack_has_too_few_elements();
6118 opnd = bc_vec_top(&G.prog.results);
6120 s = bc_program_num(opnd, &num, false);
6124 if (!BC_PROG_NUM(opnd, num) && !len)
6125 return bc_error_variable_is_wrong_type();
6128 bc_num_init(&res.d.n, BC_NUM_DEF_SIZE);
6130 if (inst == BC_INST_SQRT) s = bc_num_sqrt(num, &res.d.n, G.prog.scale);
6132 else if (len != 0 && opnd->t == BC_RESULT_ARRAY) {
6133 bc_num_ulong2num(&res.d.n, (unsigned long) ((BcVec *) num)->len);
6137 else if (len != 0 && !BC_PROG_NUM(opnd, num)) {
6140 size_t idx = opnd->t == BC_RESULT_STR ? opnd->d.id.idx : num->rdx;
6142 str = bc_vec_item(&G.prog.strs, idx);
6143 bc_num_ulong2num(&res.d.n, strlen(*str));
6147 BcProgramBuiltIn f = len ? bc_program_len : bc_program_scale;
6148 bc_num_ulong2num(&res.d.n, f(num));
6151 bc_program_retire(&res, BC_RESULT_TEMP);
6157 static BcStatus bc_program_divmod(void)
6160 BcResult *opd1, *opd2, res, res2;
6161 BcNum *n1, *n2 = NULL;
6163 s = bc_program_binOpPrep(&opd1, &n1, &opd2, &n2, false);
6166 bc_num_init(&res.d.n, BC_NUM_DEF_SIZE);
6167 bc_num_init(&res2.d.n, n2->len);
6169 s = bc_num_divmod(n1, n2, &res2.d.n, &res.d.n, G.prog.scale);
6172 bc_program_binOpRetire(&res2);
6173 res.t = BC_RESULT_TEMP;
6174 bc_vec_push(&G.prog.results, &res);
6179 bc_num_free(&res2.d.n);
6180 bc_num_free(&res.d.n);
6184 static BcStatus bc_program_modexp(void)
6187 BcResult *r1, *r2, *r3, res;
6188 BcNum *n1, *n2, *n3;
6190 if (!BC_PROG_STACK(&G.prog.results, 3))
6191 return bc_error_stack_has_too_few_elements();
6192 s = bc_program_binOpPrep(&r2, &n2, &r3, &n3, false);
6195 r1 = bc_vec_item_rev(&G.prog.results, 2);
6196 s = bc_program_num(r1, &n1, false);
6198 if (!BC_PROG_NUM(r1, n1))
6199 return bc_error_variable_is_wrong_type();
6201 // Make sure that the values have their pointers updated, if necessary.
6202 if (r1->t == BC_RESULT_VAR || r1->t == BC_RESULT_ARRAY_ELEM) {
6204 if (r1->t == r2->t) {
6205 s = bc_program_num(r2, &n2, false);
6209 if (r1->t == r3->t) {
6210 s = bc_program_num(r3, &n3, false);
6215 bc_num_init(&res.d.n, n3->len);
6216 s = bc_num_modexp(n1, n2, n3, &res.d.n);
6219 bc_vec_pop(&G.prog.results);
6220 bc_program_binOpRetire(&res);
6225 bc_num_free(&res.d.n);
6229 static void bc_program_stackLen(void)
6232 size_t len = G.prog.results.len;
6234 res.t = BC_RESULT_TEMP;
6236 bc_num_init(&res.d.n, BC_NUM_DEF_SIZE);
6237 bc_num_ulong2num(&res.d.n, len);
6238 bc_vec_push(&G.prog.results, &res);
6241 static BcStatus bc_program_asciify(void)
6245 BcNum *num = NULL, n;
6246 char *str, *str2, c;
6247 size_t len = G.prog.strs.len, idx;
6250 if (!BC_PROG_STACK(&G.prog.results, 1))
6251 return bc_error_stack_has_too_few_elements();
6252 r = bc_vec_top(&G.prog.results);
6254 s = bc_program_num(r, &num, false);
6257 if (BC_PROG_NUM(r, num)) {
6259 bc_num_init(&n, BC_NUM_DEF_SIZE);
6260 bc_num_copy(&n, num);
6261 bc_num_truncate(&n, n.rdx);
6263 s = bc_num_mod(&n, &G.prog.strmb, &n, 0);
6264 if (s) goto num_err;
6265 s = bc_num_ulong(&n, &val);
6266 if (s) goto num_err;
6273 idx = (r->t == BC_RESULT_STR) ? r->d.id.idx : num->rdx;
6274 str2 = *((char **) bc_vec_item(&G.prog.strs, idx));
6282 str2 = xstrdup(str);
6283 bc_program_addFunc(str2, &idx);
6285 if (idx != len + BC_PROG_REQ_FUNCS) {
6287 for (idx = 0; idx < G.prog.strs.len; ++idx) {
6288 if (!strcmp(*((char **) bc_vec_item(&G.prog.strs, idx)), str)) {
6297 bc_vec_push(&G.prog.strs, &str);
6299 res.t = BC_RESULT_STR;
6301 bc_vec_pop(&G.prog.results);
6302 bc_vec_push(&G.prog.results, &res);
6304 return BC_STATUS_SUCCESS;
6311 static BcStatus bc_program_printStream(void)
6319 if (!BC_PROG_STACK(&G.prog.results, 1))
6320 return bc_error_stack_has_too_few_elements();
6321 r = bc_vec_top(&G.prog.results);
6323 s = bc_program_num(r, &n, false);
6326 if (BC_PROG_NUM(r, n))
6327 s = bc_num_stream(n, &G.prog.strmb, &G.prog.nchars, G.prog.len);
6329 idx = (r->t == BC_RESULT_STR) ? r->d.id.idx : n->rdx;
6330 str = *((char **) bc_vec_item(&G.prog.strs, idx));
6337 static BcStatus bc_program_nquit(void)
6344 s = bc_program_prep(&opnd, &num);
6346 s = bc_num_ulong(num, &val);
6349 bc_vec_pop(&G.prog.results);
6351 if (G.prog.stack.len < val)
6352 return bc_error_stack_has_too_few_elements();
6353 if (G.prog.stack.len == val)
6356 bc_vec_npop(&G.prog.stack, val);
6361 static BcStatus bc_program_execStr(char *code, size_t *bgn,
6364 BcStatus s = BC_STATUS_SUCCESS;
6374 if (!BC_PROG_STACK(&G.prog.results, 1))
6375 return bc_error_stack_has_too_few_elements();
6377 r = bc_vec_top(&G.prog.results);
6381 char *name, *then_name = bc_program_name(code, bgn), *else_name = NULL;
6383 if (code[*bgn] == BC_PARSE_STREND)
6386 else_name = bc_program_name(code, bgn);
6388 exec = r->d.n.len != 0;
6392 else if (else_name != NULL) {
6399 v = bc_program_search(name, true);
6406 if (!exec) goto exit;
6407 if (!BC_PROG_STR(n)) {
6408 s = bc_error_variable_is_wrong_type();
6416 if (r->t == BC_RESULT_STR)
6418 else if (r->t == BC_RESULT_VAR) {
6419 s = bc_program_num(r, &n, false);
6420 if (s || !BC_PROG_STR(n)) goto exit;
6427 fidx = sidx + BC_PROG_REQ_FUNCS;
6429 str = bc_vec_item(&G.prog.strs, sidx);
6430 f = bc_vec_item(&G.prog.fns, fidx);
6432 if (f->code.len == 0) {
6433 common_parse_init(&prs, fidx);
6434 s = bc_parse_text(&prs, *str);
6436 s = common_parse_expr(&prs, BC_PARSE_NOCALL);
6439 if (prs.l.t.t != BC_LEX_EOF) {
6440 s = bc_error_bad_expression();
6444 bc_parse_free(&prs);
6448 ip.len = G.prog.results.len;
6451 bc_vec_pop(&G.prog.results);
6452 bc_vec_push(&G.prog.stack, &ip);
6454 return BC_STATUS_SUCCESS;
6457 bc_parse_free(&prs);
6458 f = bc_vec_item(&G.prog.fns, fidx);
6459 bc_vec_pop_all(&f->code);
6461 bc_vec_pop(&G.prog.results);
6466 static void bc_program_pushGlobal(char inst)
6471 res.t = inst - BC_INST_IBASE + BC_RESULT_IBASE;
6472 if (inst == BC_INST_IBASE)
6473 val = (unsigned long) G.prog.ib_t;
6474 else if (inst == BC_INST_SCALE)
6475 val = (unsigned long) G.prog.scale;
6477 val = (unsigned long) G.prog.ob_t;
6479 bc_num_init(&res.d.n, BC_NUM_DEF_SIZE);
6480 bc_num_ulong2num(&res.d.n, val);
6481 bc_vec_push(&G.prog.results, &res);
6484 static void bc_program_addFunc(char *name, size_t *idx)
6486 BcId entry, *entry_ptr;
6491 entry.idx = G.prog.fns.len;
6493 inserted = bc_map_insert(&G.prog.fn_map, &entry, idx);
6494 if (!inserted) free(name);
6496 entry_ptr = bc_vec_item(&G.prog.fn_map, *idx);
6497 *idx = entry_ptr->idx;
6501 BcFunc *func = bc_vec_item(&G.prog.fns, entry_ptr->idx);
6503 // We need to reset these, so the function can be repopulated.
6505 bc_vec_pop_all(&func->autos);
6506 bc_vec_pop_all(&func->code);
6507 bc_vec_pop_all(&func->labels);
6511 bc_vec_push(&G.prog.fns, &f);
6515 // Called when parsing or execution detects a failure,
6516 // resets execution structures.
6517 static void bc_program_reset(void)
6522 bc_vec_npop(&G.prog.stack, G.prog.stack.len - 1);
6523 bc_vec_pop_all(&G.prog.results);
6525 f = bc_vec_item(&G.prog.fns, 0);
6526 ip = bc_vec_top(&G.prog.stack);
6527 ip->idx = f->code.len;
6529 // If !tty, no need to check for ^C: we don't have ^C handler,
6530 // we would be killed by a signal and won't reach this place
6533 static BcStatus bc_program_exec(void)
6535 BcStatus s = BC_STATUS_SUCCESS;
6539 BcInstPtr *ip = bc_vec_top(&G.prog.stack);
6540 BcFunc *func = bc_vec_item(&G.prog.fns, ip->func);
6541 char *code = func->code.v;
6544 while (!s && ip->idx < func->code.len) {
6546 char inst = code[(ip->idx)++];
6551 case BC_INST_JUMP_ZERO:
6553 s = bc_program_prep(&ptr, &num);
6555 cond = !bc_num_cmp(num, &G.prog.zero);
6556 bc_vec_pop(&G.prog.results);
6562 idx = bc_program_index(code, &ip->idx);
6563 addr = bc_vec_item(&func->labels, idx);
6564 if (inst == BC_INST_JUMP || cond) ip->idx = *addr;
6570 s = bc_program_call(code, &ip->idx);
6574 case BC_INST_INC_PRE:
6575 case BC_INST_DEC_PRE:
6576 case BC_INST_INC_POST:
6577 case BC_INST_DEC_POST:
6579 s = bc_program_incdec(inst);
6592 s = bc_program_return(inst);
6596 case BC_INST_BOOL_OR:
6597 case BC_INST_BOOL_AND:
6599 case BC_INST_REL_EQ:
6600 case BC_INST_REL_LE:
6601 case BC_INST_REL_GE:
6602 case BC_INST_REL_NE:
6603 case BC_INST_REL_LT:
6604 case BC_INST_REL_GT:
6606 s = bc_program_logical(inst);
6612 s = bc_program_read();
6618 s = bc_program_pushVar(code, &ip->idx, false, false);
6622 case BC_INST_ARRAY_ELEM:
6625 s = bc_program_pushArray(code, &ip->idx, inst);
6631 r.t = BC_RESULT_LAST;
6632 bc_vec_push(&G.prog.results, &r);
6640 bc_program_pushGlobal(inst);
6644 case BC_INST_SCALE_FUNC:
6645 case BC_INST_LENGTH:
6648 s = bc_program_builtin(inst);
6654 r.t = BC_RESULT_CONSTANT;
6655 r.d.id.idx = bc_program_index(code, &ip->idx);
6656 bc_vec_push(&G.prog.results, &r);
6662 if (!BC_PROG_STACK(&G.prog.results, 1))
6663 s = bc_error_stack_has_too_few_elements();
6665 bc_vec_pop(&G.prog.results);
6669 case BC_INST_POP_EXEC:
6671 bc_vec_pop(&G.prog.stack);
6676 case BC_INST_PRINT_POP:
6677 case BC_INST_PRINT_STR:
6679 s = bc_program_print(inst, 0);
6685 r.t = BC_RESULT_STR;
6686 r.d.id.idx = bc_program_index(code, &ip->idx);
6687 bc_vec_push(&G.prog.results, &r);
6692 case BC_INST_MULTIPLY:
6693 case BC_INST_DIVIDE:
6694 case BC_INST_MODULUS:
6698 s = bc_program_op(inst);
6702 case BC_INST_BOOL_NOT:
6704 s = bc_program_prep(&ptr, &num);
6707 bc_num_init(&r.d.n, BC_NUM_DEF_SIZE);
6708 (!bc_num_cmp(num, &G.prog.zero) ? bc_num_one : bc_num_zero)(&r.d.n);
6709 bc_program_retire(&r, BC_RESULT_TEMP);
6716 s = bc_program_negate();
6721 case BC_INST_ASSIGN_POWER:
6722 case BC_INST_ASSIGN_MULTIPLY:
6723 case BC_INST_ASSIGN_DIVIDE:
6724 case BC_INST_ASSIGN_MODULUS:
6725 case BC_INST_ASSIGN_PLUS:
6726 case BC_INST_ASSIGN_MINUS:
6728 case BC_INST_ASSIGN:
6730 s = bc_program_assign(inst);
6734 case BC_INST_MODEXP:
6736 s = bc_program_modexp();
6740 case BC_INST_DIVMOD:
6742 s = bc_program_divmod();
6746 case BC_INST_EXECUTE:
6747 case BC_INST_EXEC_COND:
6749 cond = inst == BC_INST_EXEC_COND;
6750 s = bc_program_execStr(code, &ip->idx, cond);
6754 case BC_INST_PRINT_STACK:
6756 for (idx = 0; !s && idx < G.prog.results.len; ++idx)
6757 s = bc_program_print(BC_INST_PRINT, idx);
6761 case BC_INST_CLEAR_STACK:
6763 bc_vec_pop_all(&G.prog.results);
6767 case BC_INST_STACK_LEN:
6769 bc_program_stackLen();
6773 case BC_INST_DUPLICATE:
6775 if (!BC_PROG_STACK(&G.prog.results, 1))
6776 return bc_error_stack_has_too_few_elements();
6777 ptr = bc_vec_top(&G.prog.results);
6778 bc_result_copy(&r, ptr);
6779 bc_vec_push(&G.prog.results, &r);
6787 if (!BC_PROG_STACK(&G.prog.results, 2))
6788 return bc_error_stack_has_too_few_elements();
6790 ptr = bc_vec_item_rev(&G.prog.results, 0);
6791 ptr2 = bc_vec_item_rev(&G.prog.results, 1);
6792 memcpy(&r, ptr, sizeof(BcResult));
6793 memcpy(ptr, ptr2, sizeof(BcResult));
6794 memcpy(ptr2, &r, sizeof(BcResult));
6799 case BC_INST_ASCIIFY:
6801 s = bc_program_asciify();
6805 case BC_INST_PRINT_STREAM:
6807 s = bc_program_printStream();
6812 case BC_INST_PUSH_VAR:
6814 bool copy = inst == BC_INST_LOAD;
6815 s = bc_program_pushVar(code, &ip->idx, true, copy);
6819 case BC_INST_PUSH_TO_VAR:
6821 char *name = bc_program_name(code, &ip->idx);
6822 s = bc_program_copyToVar(name, true);
6829 if (G.prog.stack.len <= 2)
6831 bc_vec_npop(&G.prog.stack, 2);
6837 s = bc_program_nquit();
6843 if (s || G_interrupt) {
6848 // If the stack has changed, pointers may be invalid.
6849 ip = bc_vec_top(&G.prog.stack);
6850 func = bc_vec_item(&G.prog.fns, ip->func);
6851 code = func->code.v;
6857 static void bc_vm_info(void)
6859 printf("%s "BB_VER"\n"
6860 "Copyright (c) 2018 Gavin D. Howard and contributors\n"
6861 "Report bugs at: https://github.com/gavinhoward/bc\n"
6862 "This is free software with ABSOLUTELY NO WARRANTY\n"
6867 static void bc_vm_envArgs(void)
6869 static const char* const bc_args_env_name = "BC_ENV_ARGS";
6872 char *env_args = getenv(bc_args_env_name), *buf;
6874 if (!env_args) return;
6876 G.env_args = xstrdup(env_args);
6879 bc_vec_init(&v, sizeof(char *), NULL);
6880 bc_vec_push(&v, &bc_args_env_name);
6883 if (!isspace(*buf)) {
6884 bc_vec_push(&v, &buf);
6885 while (*buf != 0 && !isspace(*buf)) ++buf;
6886 if (*buf != 0) (*(buf++)) = '\0';
6892 bc_args((int) v.len, (char **) v.v);
6898 static size_t bc_vm_envLen(const char *var)
6900 char *lenv = getenv(var);
6901 size_t i, len = BC_NUM_PRINT_WIDTH;
6904 if (!lenv) return len;
6908 for (num = 1, i = 0; num && i < len; ++i) num = isdigit(lenv[i]);
6910 len = (size_t) atoi(lenv) - 1;
6911 if (len < 2 || len >= INT32_MAX) len = BC_NUM_PRINT_WIDTH;
6914 len = BC_NUM_PRINT_WIDTH;
6919 static BcStatus bc_vm_process(const char *text)
6921 BcStatus s = bc_parse_text(&G.prs, text);
6925 while (G.prs.l.t.t != BC_LEX_EOF) {
6926 s = G.prs.parse(&G.prs);
6930 if (BC_PARSE_CAN_EXEC(&G.prs)) {
6931 s = bc_program_exec();
6940 static BcStatus bc_vm_file(const char *file)
6942 const char *sv_file;
6948 data = bc_read_file(file);
6949 if (!data) return bc_error_fmt("file '%s' is not text", file);
6951 sv_file = G.prog.file;
6953 bc_lex_file(&G.prs.l);
6954 s = bc_vm_process(data);
6957 main_func = bc_vec_item(&G.prog.fns, BC_PROG_MAIN);
6958 ip = bc_vec_item(&G.prog.stack, 0);
6960 if (main_func->code.len < ip->idx)
6961 s = bc_error_fmt("file '%s' is not executable", file);
6964 G.prog.file = sv_file;
6969 static BcStatus bc_vm_stdin(void)
6973 size_t len, i, str = 0;
6974 bool comment = false;
6977 bc_lex_file(&G.prs.l);
6979 bc_char_vec_init(&buffer);
6980 bc_char_vec_init(&buf);
6981 bc_vec_pushZeroByte(&buffer);
6983 // This loop is complex because the vm tries not to send any lines that end
6984 // with a backslash to the parser. The reason for that is because the parser
6985 // treats a backslash+newline combo as whitespace, per the bc spec. In that
6986 // case, and for strings and comments, the parser will expect more stuff.
6987 s = BC_STATUS_SUCCESS;
6988 while (!G.eof && (s = bc_read_line(&buf, ">>> ")) == BC_STATUS_SUCCESS) {
6990 char *string = buf.v;
6995 if (str && buf.v[0] == G.send)
6997 else if (buf.v[0] == G.sbgn)
7000 else if (len > 1 || comment) {
7002 for (i = 0; i < len; ++i) {
7004 bool notend = len > i + 1;
7007 if (i - 1 > len || string[i - 1] != '\\') {
7008 if (G.sbgn == G.send)
7010 else if (c == G.send)
7012 else if (c == G.sbgn)
7016 if (c == '/' && notend && !comment && string[i + 1] == '*') {
7020 else if (c == '*' && notend && comment && string[i + 1] == '/')
7024 if (str || comment || string[len - 2] == '\\') {
7025 bc_vec_concat(&buffer, buf.v);
7030 bc_vec_concat(&buffer, buf.v);
7031 s = bc_vm_process(buffer.v);
7034 fputs("ready for more input\n", stderr);
7037 bc_vec_pop_all(&buffer);
7041 s = bc_error("string end could not be found");
7044 s = bc_error("comment end could not be found");
7048 bc_vec_free(&buffer);
7053 static const char bc_lib[] = {
7056 "\n" "auto b,s,n,r,d,i,p,f,v"
7065 "\n" "scale=scale(x)+1"
7075 "\n" "for(i=2;v!=0;++i){"
7081 "\n" "while((d--)!=0)r*=r"
7084 "\n" "if(n!=0)return(1/r)"
7088 "\n" "auto b,s,r,p,a,q,i,v"
7092 "\n" "r=(1-10^scale)/1"
7103 "\n" "while(x<=0.5){"
7107 "\n" "r=a=(x-1)/(x+1)"
7110 "\n" "for(i=3;v!=0;i+=2){"
7121 "\n" "auto b,s,r,n,a,q,i"
7125 "\n" "scale=1.1*s+2"
7134 "\n" "if(q%2!=0)x=-x"
7138 "\n" "for(i=3;a!=0;i+=2){"
7139 "\n" "a*=q/(i*(i-1))"
7144 "\n" "if(n!=0)return(-r/1)"
7153 "\n" "x=s(2*a(1)+x)"
7159 "\n" "auto b,s,r,n,a,m,t,f,i,u"
7168 "\n" "if(scale<65){"
7169 "\n" "return(.7853981633974483096156608458198757210492923498437764552437361480/n)"
7173 "\n" "if(scale<65){"
7174 "\n" "return(.1973955598498807583700497651947902934475851037878521015176889402/n)"
7185 "\n" "x=(x-.2)/(1+.2*x)"
7190 "\n" "for(i=3;t!=0;i+=2){"
7197 "\n" "return((m*a+r)/n)"
7199 "\n" "define j(n,x){"
7200 "\n" "auto b,s,o,a,i,v,f"
7208 "\n" "if(n%2==1)o=1"
7211 "\n" "for(i=2;i<=n;++i)a*=i"
7213 "\n" "a=(x^n)/2^n/a"
7216 "\n" "scale=scale+length(a)-scale(a)"
7217 "\n" "for(i=1;v!=0;++i){"
7218 "\n" "v=v*f/i/(n+i)"
7224 "\n" "return(a*r/1)"
7229 static BcStatus bc_vm_exec(void)
7231 BcStatus s = BC_STATUS_SUCCESS;
7235 if (option_mask32 & BC_FLAG_L) {
7237 // We know that internal library is not buggy,
7238 // thus error checking is normally disabled.
7239 # define DEBUG_LIB 0
7240 bc_lex_file(&G.prs.l);
7241 s = bc_parse_text(&G.prs, bc_lib);
7242 if (DEBUG_LIB && s) return s;
7244 while (G.prs.l.t.t != BC_LEX_EOF) {
7245 s = G.prs.parse(&G.prs);
7246 if (DEBUG_LIB && s) return s;
7248 s = bc_program_exec();
7249 if (DEBUG_LIB && s) return s;
7253 for (i = 0; !s && i < G.files.len; ++i)
7254 s = bc_vm_file(*((char **) bc_vec_item(&G.files, i)));
7257 fputs("ready for more input\n", stderr);
7260 if (IS_BC || !G.files.len)
7262 if (!s && !BC_PARSE_CAN_EXEC(&G.prs))
7263 s = bc_vm_process("");
7268 #if ENABLE_FEATURE_CLEAN_UP
7269 static void bc_program_free()
7271 bc_num_free(&G.prog.ib);
7272 bc_num_free(&G.prog.ob);
7273 bc_num_free(&G.prog.hexb);
7275 bc_num_free(&G.prog.strmb);
7277 bc_vec_free(&G.prog.fns);
7278 bc_vec_free(&G.prog.fn_map);
7279 bc_vec_free(&G.prog.vars);
7280 bc_vec_free(&G.prog.var_map);
7281 bc_vec_free(&G.prog.arrs);
7282 bc_vec_free(&G.prog.arr_map);
7283 bc_vec_free(&G.prog.strs);
7284 bc_vec_free(&G.prog.consts);
7285 bc_vec_free(&G.prog.results);
7286 bc_vec_free(&G.prog.stack);
7287 bc_num_free(&G.prog.last);
7288 bc_num_free(&G.prog.zero);
7289 bc_num_free(&G.prog.one);
7292 static void bc_vm_free(void)
7294 bc_vec_free(&G.files);
7296 bc_parse_free(&G.prs);
7301 static void bc_program_init(size_t line_len)
7306 /* memset(&G.prog, 0, sizeof(G.prog)); - already is */
7307 memset(&ip, 0, sizeof(BcInstPtr));
7309 /* G.prog.nchars = G.prog.scale = 0; - already is */
7310 G.prog.len = line_len;
7312 bc_num_init(&G.prog.ib, BC_NUM_DEF_SIZE);
7313 bc_num_ten(&G.prog.ib);
7316 bc_num_init(&G.prog.ob, BC_NUM_DEF_SIZE);
7317 bc_num_ten(&G.prog.ob);
7320 bc_num_init(&G.prog.hexb, BC_NUM_DEF_SIZE);
7321 bc_num_ten(&G.prog.hexb);
7322 G.prog.hexb.num[0] = 6;
7325 bc_num_init(&G.prog.strmb, BC_NUM_DEF_SIZE);
7326 bc_num_ulong2num(&G.prog.strmb, UCHAR_MAX + 1);
7329 bc_num_init(&G.prog.last, BC_NUM_DEF_SIZE);
7330 bc_num_zero(&G.prog.last);
7332 bc_num_init(&G.prog.zero, BC_NUM_DEF_SIZE);
7333 bc_num_zero(&G.prog.zero);
7335 bc_num_init(&G.prog.one, BC_NUM_DEF_SIZE);
7336 bc_num_one(&G.prog.one);
7338 bc_vec_init(&G.prog.fns, sizeof(BcFunc), bc_func_free);
7339 bc_vec_init(&G.prog.fn_map, sizeof(BcId), bc_id_free);
7341 bc_program_addFunc(xstrdup("(main)"), &idx);
7342 bc_program_addFunc(xstrdup("(read)"), &idx);
7344 bc_vec_init(&G.prog.vars, sizeof(BcVec), bc_vec_free);
7345 bc_vec_init(&G.prog.var_map, sizeof(BcId), bc_id_free);
7347 bc_vec_init(&G.prog.arrs, sizeof(BcVec), bc_vec_free);
7348 bc_vec_init(&G.prog.arr_map, sizeof(BcId), bc_id_free);
7350 bc_vec_init(&G.prog.strs, sizeof(char *), bc_string_free);
7351 bc_vec_init(&G.prog.consts, sizeof(char *), bc_string_free);
7352 bc_vec_init(&G.prog.results, sizeof(BcResult), bc_result_free);
7353 bc_vec_init(&G.prog.stack, sizeof(BcInstPtr), NULL);
7354 bc_vec_push(&G.prog.stack, &ip);
7357 static void bc_vm_init(const char *env_len)
7359 size_t len = bc_vm_envLen(env_len);
7361 bc_vec_init(&G.files, sizeof(char *), NULL);
7367 bc_program_init(len);
7369 bc_parse_init(&G.prs, BC_PROG_MAIN);
7371 dc_parse_init(&G.prs, BC_PROG_MAIN);
7375 static BcStatus bc_vm_run(int argc, char *argv[],
7376 const char *env_len)
7380 bc_vm_init(env_len);
7381 bc_args(argc, argv);
7383 G.ttyin = isatty(0);
7386 #if ENABLE_FEATURE_BC_SIGNALS
7387 // With SA_RESTART, most system calls will restart
7388 // (IOW: they won't fail with EINTR).
7389 // In particular, this means ^C won't cause
7390 // stdout to get into "error state" if SIGINT hits
7391 // within write() syscall.
7392 // The downside is that ^C while line input is taken
7393 // will only be handled after [Enter] since read()
7394 // from stdin is not interrupted by ^C either,
7395 // it restarts, thus fgetc() does not return on ^C.
7396 signal_SA_RESTART_empty_mask(SIGINT, record_signo);
7398 // Without SA_RESTART, this exhibits a bug:
7399 // "while (1) print 1" and try ^C-ing it.
7400 // Intermittently, instead of returning to input line,
7401 // you'll get "output error: Interrupted system call"
7403 //signal_no_SA_RESTART_empty_mask(SIGINT, record_signo);
7405 if (!(option_mask32 & BC_FLAG_Q))
7410 #if ENABLE_FEATURE_CLEAN_UP
7417 int bc_main(int argc, char **argv) MAIN_EXTERNALLY_VISIBLE;
7418 int bc_main(int argc, char **argv)
7421 G.sbgn = G.send = '"';
7423 return bc_vm_run(argc, argv, "BC_LINE_LENGTH");
7428 int dc_main(int argc, char **argv) MAIN_EXTERNALLY_VISIBLE;
7429 int dc_main(int argc, char **argv)
7435 return bc_vm_run(argc, argv, "DC_LINE_LENGTH");