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 BcStatus bc_num_add(BcNum *a, BcNum *b, BcNum *c, size_t scale);
221 static BcStatus bc_num_sub(BcNum *a, BcNum *b, BcNum *c, size_t scale);
222 static BcStatus bc_num_mul(BcNum *a, BcNum *b, BcNum *c, size_t scale);
223 static BcStatus bc_num_div(BcNum *a, BcNum *b, BcNum *c, size_t scale);
224 static BcStatus bc_num_mod(BcNum *a, BcNum *b, BcNum *c, size_t scale);
225 static BcStatus bc_num_pow(BcNum *a, BcNum *b, BcNum *c, size_t scale);
226 static BcStatus bc_num_sqrt(BcNum *a, BcNum *b, size_t scale);
227 static BcStatus bc_num_divmod(BcNum *a, BcNum *b, BcNum *c, BcNum *d,
230 typedef enum BcInst {
260 BC_INST_ASSIGN_POWER,
261 BC_INST_ASSIGN_MULTIPLY,
262 BC_INST_ASSIGN_DIVIDE,
263 BC_INST_ASSIGN_MODULUS,
265 BC_INST_ASSIGN_MINUS,
311 BC_INST_PRINT_STREAM,
326 BC_INST_INVALID = -1,
331 typedef struct BcId {
336 typedef struct BcFunc {
343 typedef enum BcResultType {
348 BC_RESULT_ARRAY_ELEM,
357 // These are between to calculate ibase, obase, and last from instructions.
365 typedef union BcResultData {
371 typedef struct BcResult {
376 typedef struct BcInstPtr {
382 // BC_LEX_NEG is not used in lexing; it is only for parsing.
383 typedef enum BcLexType {
411 BC_LEX_OP_ASSIGN_POWER,
412 BC_LEX_OP_ASSIGN_MULTIPLY,
413 BC_LEX_OP_ASSIGN_DIVIDE,
414 BC_LEX_OP_ASSIGN_MODULUS,
415 BC_LEX_OP_ASSIGN_PLUS,
416 BC_LEX_OP_ASSIGN_MINUS,
437 BC_LEX_KEY_1st_keyword,
438 BC_LEX_KEY_AUTO = BC_LEX_KEY_1st_keyword,
445 // code uses "type - BC_LEX_KEY_IBASE + BC_INST_IBASE" construct,
446 BC_LEX_KEY_IBASE, // relative order should match for: BC_INST_IBASE
448 BC_LEX_KEY_LAST, // relative order should match for: BC_INST_LAST
451 BC_LEX_KEY_OBASE, // relative order should match for: BC_INST_OBASE
489 // must match order of BC_LEX_KEY_foo etc above
491 struct BcLexKeyword {
494 #define BC_LEX_KW_ENTRY(a, b, c) \
495 { .name8 = a /*, .len = b, .posix = c*/ }
496 static const struct BcLexKeyword bc_lex_kws[20] = {
497 BC_LEX_KW_ENTRY("auto" , 4, 1), // 0
498 BC_LEX_KW_ENTRY("break" , 5, 1), // 1
499 BC_LEX_KW_ENTRY("continue", 8, 0), // 2 note: this one has no terminating NUL
500 BC_LEX_KW_ENTRY("define" , 6, 1), // 3
502 BC_LEX_KW_ENTRY("else" , 4, 0), // 4
503 BC_LEX_KW_ENTRY("for" , 3, 1), // 5
504 BC_LEX_KW_ENTRY("halt" , 4, 0), // 6
505 BC_LEX_KW_ENTRY("ibase" , 5, 1), // 7
507 BC_LEX_KW_ENTRY("if" , 2, 1), // 8
508 BC_LEX_KW_ENTRY("last" , 4, 0), // 9
509 BC_LEX_KW_ENTRY("length" , 6, 1), // 10
510 BC_LEX_KW_ENTRY("limits" , 6, 0), // 11
512 BC_LEX_KW_ENTRY("obase" , 5, 1), // 12
513 BC_LEX_KW_ENTRY("print" , 5, 0), // 13
514 BC_LEX_KW_ENTRY("quit" , 4, 1), // 14
515 BC_LEX_KW_ENTRY("read" , 4, 0), // 15
517 BC_LEX_KW_ENTRY("return" , 6, 1), // 16
518 BC_LEX_KW_ENTRY("scale" , 5, 1), // 17
519 BC_LEX_KW_ENTRY("sqrt" , 4, 1), // 18
520 BC_LEX_KW_ENTRY("while" , 5, 1), // 19
552 typedef BcStatus (*BcLexNext)(struct BcLex *);
554 typedef struct BcLex {
572 #define BC_PARSE_STREND ((char) UCHAR_MAX)
574 #define bc_parse_push(p, i) (bc_vec_pushByte(&(p)->func->code, (char) (i)))
575 #define bc_parse_updateFunc(p, f) \
576 ((p)->func = bc_vec_item(&G.prog.fns, ((p)->fidx = (f))))
578 #define BC_PARSE_REL (1 << 0)
579 #define BC_PARSE_PRINT (1 << 1)
580 #define BC_PARSE_NOCALL (1 << 2)
581 #define BC_PARSE_NOREAD (1 << 3)
582 #define BC_PARSE_ARRAY (1 << 4)
584 #define BC_PARSE_TOP_FLAG_PTR(parse) ((uint8_t *) bc_vec_top(&(parse)->flags))
585 #define BC_PARSE_TOP_FLAG(parse) (*(BC_PARSE_TOP_FLAG_PTR(parse)))
587 #define BC_PARSE_FLAG_FUNC_INNER (1 << 0)
588 #define BC_PARSE_FUNC_INNER(parse) \
589 (BC_PARSE_TOP_FLAG(parse) & BC_PARSE_FLAG_FUNC_INNER)
591 #define BC_PARSE_FLAG_FUNC (1 << 1)
592 #define BC_PARSE_FUNC(parse) (BC_PARSE_TOP_FLAG(parse) & BC_PARSE_FLAG_FUNC)
594 #define BC_PARSE_FLAG_BODY (1 << 2)
595 #define BC_PARSE_BODY(parse) (BC_PARSE_TOP_FLAG(parse) & BC_PARSE_FLAG_BODY)
597 #define BC_PARSE_FLAG_LOOP (1 << 3)
598 #define BC_PARSE_LOOP(parse) (BC_PARSE_TOP_FLAG(parse) & BC_PARSE_FLAG_LOOP)
600 #define BC_PARSE_FLAG_LOOP_INNER (1 << 4)
601 #define BC_PARSE_LOOP_INNER(parse) \
602 (BC_PARSE_TOP_FLAG(parse) & BC_PARSE_FLAG_LOOP_INNER)
604 #define BC_PARSE_FLAG_IF (1 << 5)
605 #define BC_PARSE_IF(parse) (BC_PARSE_TOP_FLAG(parse) & BC_PARSE_FLAG_IF)
607 #define BC_PARSE_FLAG_ELSE (1 << 6)
608 #define BC_PARSE_ELSE(parse) (BC_PARSE_TOP_FLAG(parse) & BC_PARSE_FLAG_ELSE)
610 #define BC_PARSE_FLAG_IF_END (1 << 7)
611 #define BC_PARSE_IF_END(parse) (BC_PARSE_TOP_FLAG(parse) & BC_PARSE_FLAG_IF_END)
613 #define BC_PARSE_CAN_EXEC(parse) \
614 (!(BC_PARSE_TOP_FLAG(parse) & \
615 (BC_PARSE_FLAG_FUNC_INNER | BC_PARSE_FLAG_FUNC | BC_PARSE_FLAG_BODY | \
616 BC_PARSE_FLAG_LOOP | BC_PARSE_FLAG_LOOP_INNER | BC_PARSE_FLAG_IF | \
617 BC_PARSE_FLAG_ELSE | BC_PARSE_FLAG_IF_END)))
619 typedef struct BcParseNext {
624 #define BC_PARSE_NEXT_TOKENS(...) .tokens = { __VA_ARGS__ }
625 #define BC_PARSE_NEXT(a, ...) \
627 .len = (a), BC_PARSE_NEXT_TOKENS(__VA_ARGS__) \
634 typedef BcStatus (*BcParseParse)(struct BcParse *);
636 typedef struct BcParse {
657 typedef struct BcProgram {
698 #define BC_PROG_STACK(s, n) ((s)->len >= ((size_t) n))
700 #define BC_PROG_MAIN (0)
701 #define BC_PROG_READ (1)
704 #define BC_PROG_REQ_FUNCS (2)
707 #define BC_PROG_STR(n) (!(n)->num && !(n)->cap)
708 #define BC_PROG_NUM(r, n) \
709 ((r)->t != BC_RESULT_ARRAY && (r)->t != BC_RESULT_STR && !BC_PROG_STR(n))
711 typedef unsigned long (*BcProgramBuiltIn)(BcNum *);
713 static void bc_program_addFunc(char *name, size_t *idx);
714 static void bc_program_reset(void);
716 #define BC_FLAG_X (1 << 0)
717 #define BC_FLAG_W (1 << 1)
718 #define BC_FLAG_V (1 << 2)
719 #define BC_FLAG_S (1 << 3)
720 #define BC_FLAG_Q (1 << 4)
721 #define BC_FLAG_L (1 << 5)
722 #define BC_FLAG_I (1 << 6)
724 #define BC_MAX(a, b) ((a) > (b) ? (a) : (b))
725 #define BC_MIN(a, b) ((a) < (b) ? (a) : (b))
727 #define BC_MAX_OBASE ((unsigned) 999)
728 #define BC_MAX_DIM ((unsigned) INT_MAX)
729 #define BC_MAX_SCALE ((unsigned) UINT_MAX)
730 #define BC_MAX_STRING ((unsigned) UINT_MAX - 1)
731 #define BC_MAX_NAME BC_MAX_STRING
732 #define BC_MAX_NUM BC_MAX_STRING
733 #define BC_MAX_EXP ((unsigned long) LONG_MAX)
734 #define BC_MAX_VARS ((unsigned long) SIZE_MAX - 1)
745 // For error messages. Can be set to current parsed line,
746 // or [TODO] to current executing line (can be before last parsed one)
753 #define G (*ptr_to_globals)
754 #define INIT_G() do { \
755 SET_PTR_TO_GLOBALS(xzalloc(sizeof(G))); \
757 #define G_posix (ENABLE_BC && (option_mask32 & BC_FLAG_S))
758 #define G_warn (ENABLE_BC && (option_mask32 & BC_FLAG_W))
759 #define G_exreg (ENABLE_DC && (option_mask32 & BC_FLAG_X))
760 #define G_interrupt (ENABLE_FEATURE_BC_SIGNALS ? bb_got_signal : 0)
762 #define IS_BC (ENABLE_BC && (!ENABLE_DC || applet_name[0] == 'b'))
766 // This is a bit array that corresponds to token types. An entry is
767 // true if the token is valid in an expression, false otherwise.
769 BC_PARSE_EXPRS_BITS = 0
770 + ((uint64_t)((0 << 0)+(0 << 1)+(1 << 2)+(1 << 3)+(1 << 4)+(1 << 5)+(1 << 6)+(1 << 7)) << (0*8))
771 + ((uint64_t)((1 << 0)+(1 << 1)+(1 << 2)+(1 << 3)+(1 << 4)+(1 << 5)+(1 << 6)+(1 << 7)) << (1*8))
772 + ((uint64_t)((1 << 0)+(1 << 1)+(1 << 2)+(1 << 3)+(1 << 4)+(1 << 5)+(1 << 6)+(1 << 7)) << (2*8))
773 + ((uint64_t)((1 << 0)+(1 << 1)+(1 << 2)+(0 << 3)+(0 << 4)+(1 << 5)+(1 << 6)+(0 << 7)) << (3*8))
774 + ((uint64_t)((0 << 0)+(0 << 1)+(0 << 2)+(0 << 3)+(0 << 4)+(0 << 5)+(1 << 6)+(1 << 7)) << (4*8))
775 + ((uint64_t)((0 << 0)+(0 << 1)+(0 << 2)+(0 << 3)+(0 << 4)+(0 << 5)+(0 << 6)+(1 << 7)) << (5*8))
776 + ((uint64_t)((0 << 0)+(1 << 1)+(1 << 2)+(1 << 3)+(1 << 4)+(0 << 5)+(0 << 6)+(1 << 7)) << (6*8))
777 + ((uint64_t)((0 << 0)+(1 << 1)+(1 << 2)+(0 << 3) ) << (7*8))
779 static ALWAYS_INLINE long bc_parse_exprs(unsigned i)
781 #if ULONG_MAX > 0xffffffff
782 // 64-bit version (will not work correctly for 32-bit longs!)
783 return BC_PARSE_EXPRS_BITS & (1UL << i);
786 unsigned long m = (uint32_t)BC_PARSE_EXPRS_BITS;
788 m = (uint32_t)(BC_PARSE_EXPRS_BITS >> 32);
791 return m & (1UL << i);
795 // This is an array of data for operators that correspond to token types.
796 static const uint8_t bc_parse_ops[] = {
797 #define OP(p,l) ((int)(l) * 0x10 + (p))
798 OP(0, false), OP( 0, false ), // inc dec
801 OP(3, true ), OP( 3, true ), OP( 3, true ), // pow mul div
802 OP(4, true ), OP( 4, true ), // mod + -
803 OP(6, true ), OP( 6, true ), OP( 6, true ), OP( 6, true ), OP( 6, true ), OP( 6, true ), // == <= >= != < >
805 OP(7, true ), OP( 7, true ), // or and
806 OP(5, false), OP( 5, false ), OP( 5, false ), OP( 5, false ), OP( 5, false ), // ^= *= /= %= +=
807 OP(5, false), OP( 5, false ), // -= =
810 #define bc_parse_op_PREC(i) (bc_parse_ops[i] & 0x0f)
811 #define bc_parse_op_LEFT(i) (bc_parse_ops[i] & 0x10)
813 // These identify what tokens can come after expressions in certain cases.
814 static const BcParseNext bc_parse_next_expr =
815 BC_PARSE_NEXT(4, BC_LEX_NLINE, BC_LEX_SCOLON, BC_LEX_RBRACE, BC_LEX_EOF);
816 static const BcParseNext bc_parse_next_param =
817 BC_PARSE_NEXT(2, BC_LEX_RPAREN, BC_LEX_COMMA);
818 static const BcParseNext bc_parse_next_print =
819 BC_PARSE_NEXT(4, BC_LEX_COMMA, BC_LEX_NLINE, BC_LEX_SCOLON, BC_LEX_EOF);
820 static const BcParseNext bc_parse_next_rel = BC_PARSE_NEXT(1, BC_LEX_RPAREN);
821 static const BcParseNext bc_parse_next_elem = BC_PARSE_NEXT(1, BC_LEX_RBRACKET);
822 static const BcParseNext bc_parse_next_for = BC_PARSE_NEXT(1, BC_LEX_SCOLON);
823 static const BcParseNext bc_parse_next_read =
824 BC_PARSE_NEXT(2, BC_LEX_NLINE, BC_LEX_EOF);
828 static const BcLexType dc_lex_regs[] = {
829 BC_LEX_OP_REL_EQ, BC_LEX_OP_REL_LE, BC_LEX_OP_REL_GE, BC_LEX_OP_REL_NE,
830 BC_LEX_OP_REL_LT, BC_LEX_OP_REL_GT, BC_LEX_SCOLON, BC_LEX_COLON,
831 BC_LEX_ELSE, BC_LEX_LOAD, BC_LEX_LOAD_POP, BC_LEX_OP_ASSIGN,
835 static const BcLexType dc_lex_tokens[] = {
836 BC_LEX_OP_MODULUS, BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_LPAREN,
837 BC_LEX_INVALID, BC_LEX_OP_MULTIPLY, BC_LEX_OP_PLUS, BC_LEX_INVALID,
838 BC_LEX_OP_MINUS, BC_LEX_INVALID, BC_LEX_OP_DIVIDE,
839 BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID,
840 BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID,
841 BC_LEX_INVALID, BC_LEX_INVALID,
842 BC_LEX_COLON, BC_LEX_SCOLON, BC_LEX_OP_REL_GT, BC_LEX_OP_REL_EQ,
843 BC_LEX_OP_REL_LT, BC_LEX_KEY_READ, BC_LEX_INVALID,
844 BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID,
845 BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_EQ_NO_REG, BC_LEX_INVALID,
846 BC_LEX_KEY_IBASE, BC_LEX_INVALID, BC_LEX_KEY_SCALE, BC_LEX_LOAD_POP,
847 BC_LEX_INVALID, BC_LEX_OP_BOOL_NOT, BC_LEX_KEY_OBASE, BC_LEX_PRINT_STREAM,
848 BC_LEX_NQUIT, BC_LEX_POP, BC_LEX_STORE_PUSH, BC_LEX_INVALID, BC_LEX_INVALID,
849 BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_SCALE_FACTOR, BC_LEX_INVALID,
850 BC_LEX_KEY_LENGTH, BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID,
851 BC_LEX_OP_POWER, BC_LEX_NEG, BC_LEX_INVALID,
852 BC_LEX_ASCIIFY, BC_LEX_INVALID, BC_LEX_CLEAR_STACK, BC_LEX_DUPLICATE,
853 BC_LEX_ELSE, BC_LEX_PRINT_STACK, BC_LEX_INVALID, BC_LEX_INVALID,
854 BC_LEX_STORE_IBASE, BC_LEX_INVALID, BC_LEX_STORE_SCALE, BC_LEX_LOAD,
855 BC_LEX_INVALID, BC_LEX_PRINT_POP, BC_LEX_STORE_OBASE, BC_LEX_KEY_PRINT,
856 BC_LEX_KEY_QUIT, BC_LEX_SWAP, BC_LEX_OP_ASSIGN, BC_LEX_INVALID,
857 BC_LEX_INVALID, BC_LEX_KEY_SQRT, BC_LEX_INVALID, BC_LEX_EXECUTE,
858 BC_LEX_INVALID, BC_LEX_STACK_LEVEL,
859 BC_LEX_LBRACE, BC_LEX_OP_MODEXP, BC_LEX_INVALID, BC_LEX_OP_DIVMOD,
863 static const BcInst dc_parse_insts[] = {
864 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID, BC_INST_REL_GE,
865 BC_INST_INVALID, BC_INST_POWER, BC_INST_MULTIPLY, BC_INST_DIVIDE,
866 BC_INST_MODULUS, BC_INST_PLUS, BC_INST_MINUS,
867 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID,
868 BC_INST_INVALID, BC_INST_INVALID,
869 BC_INST_BOOL_NOT, BC_INST_INVALID, BC_INST_INVALID,
870 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID,
871 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID,
872 BC_INST_INVALID, BC_INST_INVALID, BC_INST_REL_GT, BC_INST_INVALID,
873 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID, BC_INST_REL_GE,
874 BC_INST_INVALID, BC_INST_INVALID,
875 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID,
876 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID,
877 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID, BC_INST_IBASE,
878 BC_INST_INVALID, BC_INST_INVALID, BC_INST_LENGTH, BC_INST_INVALID,
879 BC_INST_OBASE, BC_INST_PRINT, BC_INST_QUIT, BC_INST_INVALID,
880 BC_INST_INVALID, BC_INST_SCALE, BC_INST_SQRT, BC_INST_INVALID,
881 BC_INST_REL_EQ, BC_INST_MODEXP, BC_INST_DIVMOD, BC_INST_INVALID,
882 BC_INST_INVALID, BC_INST_EXECUTE, BC_INST_PRINT_STACK, BC_INST_CLEAR_STACK,
883 BC_INST_STACK_LEN, BC_INST_DUPLICATE, BC_INST_SWAP, BC_INST_POP,
884 BC_INST_ASCIIFY, BC_INST_PRINT_STREAM, BC_INST_INVALID, BC_INST_INVALID,
885 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID,
886 BC_INST_PRINT, BC_INST_NQUIT, BC_INST_SCALE_FUNC,
890 static const BcNumBinaryOp bc_program_ops[] = {
891 bc_num_pow, bc_num_mul, bc_num_div, bc_num_mod, bc_num_add, bc_num_sub,
894 static void fflush_and_check(void)
897 if (ferror(stdout) || ferror(stderr))
898 bb_perror_msg_and_die("output error");
901 static void quit(void) NORETURN;
902 static void quit(void)
905 bb_perror_msg_and_die("input error");
910 static void bc_verror_msg(const char *fmt, va_list p)
912 const char *sv = sv; /* for compiler */
915 applet_name = xasprintf("%s: %s:%u", applet_name, G.prog.file, G.err_line);
917 bb_verror_msg(fmt, p, NULL);
919 free((char*)applet_name);
924 static NOINLINE int bc_error_fmt(const char *fmt, ...)
929 bc_verror_msg(fmt, p);
934 return BC_STATUS_FAILURE;
937 static NOINLINE int bc_posix_error_fmt(const char *fmt, ...)
941 // Are non-POSIX constructs totally ok?
942 if (!(option_mask32 & (BC_FLAG_S|BC_FLAG_W)))
943 return BC_STATUS_SUCCESS; // yes
946 bc_verror_msg(fmt, p);
949 // Do we treat non-POSIX constructs as errors?
950 if (!(option_mask32 & BC_FLAG_S))
951 return BC_STATUS_SUCCESS; // no, it's a warning
954 return BC_STATUS_FAILURE;
957 // We use error functions with "return bc_error(FMT[, PARAMS])" idiom.
958 // This idiom begs for tail-call optimization, but for it to work,
959 // function must not have calller-cleaned parameters on stack.
960 // Unfortunately, vararg functions do exactly that on most arches.
961 // Thus, these shims for the cases when we have no PARAMS:
962 static int bc_error(const char *msg)
964 return bc_error_fmt("%s", msg);
966 static int bc_posix_error(const char *msg)
968 return bc_posix_error_fmt("%s", msg);
970 static int bc_POSIX_does_not_allow(const char *msg)
972 return bc_posix_error_fmt("%s%s", "POSIX does not allow ", msg);
974 static int bc_POSIX_does_not_allow_bool_ops_this_is_bad(const char *msg)
976 return bc_posix_error_fmt("%s%s %s", "POSIX does not allow ", "boolean operators; the following is bad:", msg);
978 static int bc_POSIX_does_not_allow_empty_X_expression_in_for(const char *msg)
980 return bc_posix_error_fmt("%san empty %s expression in a for loop", "POSIX does not allow ", msg);
982 static int bc_error_bad_character(char c)
984 return bc_error_fmt("bad character '%c'", c);
986 static int bc_error_bad_expression(void)
988 return bc_error("bad expression");
990 static int bc_error_bad_token(void)
992 return bc_error("bad token");
994 static int bc_error_stack_has_too_few_elements(void)
996 return bc_error("stack has too few elements");
998 static int bc_error_variable_is_wrong_type(void)
1000 return bc_error("variable is wrong type");
1002 static int bc_error_nested_read_call(void)
1004 return bc_error("read() call inside of a read() call");
1007 static void bc_vm_info(void)
1009 printf("%s "BB_VER"\n"
1010 "Copyright (c) 2018 Gavin D. Howard and contributors\n"
1011 "Report bugs at: https://github.com/gavinhoward/bc\n"
1012 "This is free software with ABSOLUTELY NO WARRANTY\n"
1016 static void bc_vec_grow(BcVec *v, size_t n)
1018 size_t cap = v->cap * 2;
1019 while (cap < v->len + n) cap *= 2;
1020 v->v = xrealloc(v->v, v->size * cap);
1024 static void bc_vec_init(BcVec *v, size_t esize, BcVecFree dtor)
1027 v->cap = BC_VEC_START_CAP;
1030 v->v = xmalloc(esize * BC_VEC_START_CAP);
1033 static void bc_char_vec_init(BcVec *v)
1035 bc_vec_init(v, sizeof(char), NULL);
1038 static void bc_vec_expand(BcVec *v, size_t req)
1041 v->v = xrealloc(v->v, v->size * req);
1046 static void bc_vec_npop(BcVec *v, size_t n)
1051 size_t len = v->len - n;
1052 while (v->len > len) v->dtor(v->v + (v->size * --v->len));
1056 static void bc_vec_pop_all(BcVec *v)
1058 bc_vec_npop(v, v->len);
1061 static void bc_vec_push(BcVec *v, const void *data)
1063 if (v->len + 1 > v->cap) bc_vec_grow(v, 1);
1064 memmove(v->v + (v->size * v->len), data, v->size);
1068 static void bc_vec_pushByte(BcVec *v, char data)
1070 bc_vec_push(v, &data);
1073 static void bc_vec_pushZeroByte(BcVec *v)
1075 //bc_vec_pushByte(v, '\0');
1077 bc_vec_push(v, &const_int_0);
1080 static void bc_vec_pushAt(BcVec *v, const void *data, size_t idx)
1083 bc_vec_push(v, data);
1088 if (v->len == v->cap) bc_vec_grow(v, 1);
1090 ptr = v->v + v->size * idx;
1092 memmove(ptr + v->size, ptr, v->size * (v->len++ - idx));
1093 memmove(ptr, data, v->size);
1097 static void bc_vec_string(BcVec *v, size_t len, const char *str)
1100 bc_vec_expand(v, len + 1);
1101 memcpy(v->v, str, len);
1104 bc_vec_pushZeroByte(v);
1107 static void bc_vec_concat(BcVec *v, const char *str)
1111 if (v->len == 0) bc_vec_pushZeroByte(v);
1113 len = v->len + strlen(str);
1115 if (v->cap < len) bc_vec_grow(v, len - v->len);
1121 static void *bc_vec_item(const BcVec *v, size_t idx)
1123 return v->v + v->size * idx;
1126 static void *bc_vec_item_rev(const BcVec *v, size_t idx)
1128 return v->v + v->size * (v->len - idx - 1);
1131 static void bc_vec_free(void *vec)
1133 BcVec *v = (BcVec *) vec;
1138 static int bc_id_cmp(const void *e1, const void *e2)
1140 return strcmp(((const BcId *) e1)->name, ((const BcId *) e2)->name);
1143 static void bc_id_free(void *id)
1145 free(((BcId *) id)->name);
1148 static size_t bc_map_find(const BcVec *v, const void *ptr)
1150 size_t low = 0, high = v->len;
1152 while (low < high) {
1154 size_t mid = (low + high) / 2;
1155 BcId *id = bc_vec_item(v, mid);
1156 int result = bc_id_cmp(ptr, id);
1160 else if (result < 0)
1169 static int bc_map_insert(BcVec *v, const void *ptr, size_t *i)
1171 size_t n = *i = bc_map_find(v, ptr);
1174 bc_vec_push(v, ptr);
1175 else if (!bc_id_cmp(ptr, bc_vec_item(v, n)))
1176 return 0; // "was not inserted"
1178 bc_vec_pushAt(v, ptr, n);
1179 return 1; // "was inserted"
1182 static size_t bc_map_index(const BcVec *v, const void *ptr)
1184 size_t i = bc_map_find(v, ptr);
1185 if (i >= v->len) return BC_VEC_INVALID_IDX;
1186 return bc_id_cmp(ptr, bc_vec_item(v, i)) ? BC_VEC_INVALID_IDX : i;
1189 static BcStatus bc_read_line(BcVec *vec, const char *prompt)
1197 bc_vec_pop_all(vec);
1200 #if ENABLE_FEATURE_BC_SIGNALS
1201 if (bb_got_signal) { // ^C was pressed
1203 bb_got_signal = 0; // resets G_interrupt to zero
1205 ? "\ninterrupt (type \"quit\" to exit)\n"
1206 : "\ninterrupt (type \"q\" to exit)\n"
1210 if (G.ttyin && !G_posix)
1211 fputs(prompt, stderr);
1213 #if ENABLE_FEATURE_BC_SIGNALS
1219 #if ENABLE_FEATURE_BC_SIGNALS
1220 // Both conditions appear simultaneously, check both just in case
1221 if (errno == EINTR || bb_got_signal) {
1228 quit(); // this emits error message
1230 // Note: EOF does not append '\n', therefore:
1231 // printf 'print 123\n' | bc - works
1232 // printf 'print 123' | bc - fails (syntax error)
1236 if ((i < ' ' && i != '\t' && i != '\r' && i != '\n') // also allow '\v' '\f'?
1239 // Bad chars on this line, ignore entire line
1240 bc_error_fmt("illegal character 0x%02x", i);
1243 bc_vec_pushByte(vec, (char)i);
1244 } while (i != '\n');
1245 } while (bad_chars);
1247 bc_vec_pushZeroByte(vec);
1249 return BC_STATUS_SUCCESS;
1252 static char* bc_read_file(const char *path)
1255 size_t size = ((size_t) -1);
1258 buf = xmalloc_open_read_close(path, &size);
1260 for (i = 0; i < size; ++i) {
1262 if ((c < ' ' && c != '\t' && c != '\r' && c != '\n') // also allow '\v' '\f'?
1274 static void bc_args(int argc, char **argv)
1280 #if ENABLE_FEATURE_BC_LONG_OPTIONS
1281 opts = getopt32long(argv, "xwvsqli",
1282 "extended-register\0" No_argument "x"
1283 "warn\0" No_argument "w"
1284 "version\0" No_argument "v"
1285 "standard\0" No_argument "s"
1286 "quiet\0" No_argument "q"
1287 "mathlib\0" No_argument "l"
1288 "interactive\0" No_argument "i"
1291 opts = getopt32(argv, "xwvsqli");
1293 if (getenv("POSIXLY_CORRECT"))
1294 option_mask32 |= BC_FLAG_S;
1296 if (opts & BC_FLAG_V) bc_vm_info();
1297 // should not be necessary, getopt32() handles this??
1298 //if (argv[optind] && !strcmp(argv[optind], "--")) ++optind;
1300 for (i = optind; i < argc; ++i)
1301 bc_vec_push(&G.files, argv + i);
1304 static void bc_num_setToZero(BcNum *n, size_t scale)
1311 static void bc_num_zero(BcNum *n)
1313 bc_num_setToZero(n, 0);
1316 static void bc_num_one(BcNum *n)
1318 bc_num_setToZero(n, 0);
1323 static void bc_num_ten(BcNum *n)
1325 bc_num_setToZero(n, 0);
1331 static void bc_num_init(BcNum *n, size_t req)
1333 req = req >= BC_NUM_DEF_SIZE ? req : BC_NUM_DEF_SIZE;
1334 memset(n, 0, sizeof(BcNum));
1335 n->num = xmalloc(req);
1339 static void bc_num_expand(BcNum *n, size_t req)
1341 req = req >= BC_NUM_DEF_SIZE ? req : BC_NUM_DEF_SIZE;
1343 n->num = xrealloc(n->num, req);
1348 static void bc_num_free(void *num)
1350 free(((BcNum *) num)->num);
1353 static void bc_num_copy(BcNum *d, BcNum *s)
1356 bc_num_expand(d, s->cap);
1360 memcpy(d->num, s->num, sizeof(BcDig) * d->len);
1364 static BcStatus bc_num_ulong(BcNum *n, unsigned long *result)
1369 if (n->neg) return bc_error("negative number");
1371 for (*result = 0, pow = 1, i = n->rdx; i < n->len; ++i) {
1373 unsigned long prev = *result, powprev = pow;
1375 *result += ((unsigned long) n->num[i]) * pow;
1378 if (*result < prev || pow < powprev)
1379 return bc_error("overflow");
1382 return BC_STATUS_SUCCESS;
1385 static void bc_num_ulong2num(BcNum *n, unsigned long val)
1393 if (val == 0) return;
1395 for (len = 1, i = ULONG_MAX; i != 0; i /= 10, ++len) bc_num_expand(n, len);
1396 for (ptr = n->num, i = 0; val; ++i, ++n->len, val /= 10) ptr[i] = val % 10;
1399 static void bc_num_subArrays(BcDig *restrict a, BcDig *restrict b,
1403 for (i = 0; i < len; ++i) {
1404 for (a[i] -= b[i], j = 0; a[i + j] < 0;) {
1411 static ssize_t bc_num_compare(BcDig *restrict a, BcDig *restrict b, size_t len)
1415 for (i = len - 1; i < len && !(c = a[i] - b[i]); --i);
1416 return BC_NUM_NEG(i + 1, c < 0);
1419 static ssize_t bc_num_cmp(BcNum *a, BcNum *b)
1421 size_t i, min, a_int, b_int, diff;
1422 BcDig *max_num, *min_num;
1423 bool a_max, neg = false;
1426 if (a == b) return 0;
1427 if (a->len == 0) return BC_NUM_NEG(!!b->len, !b->neg);
1428 if (b->len == 0) return BC_NUM_NEG(1, a->neg);
1438 a_int = BC_NUM_INT(a);
1439 b_int = BC_NUM_INT(b);
1441 a_max = (a->rdx > b->rdx);
1443 if (a_int != 0) return (ssize_t) a_int;
1447 diff = a->rdx - b->rdx;
1448 max_num = a->num + diff;
1453 diff = b->rdx - a->rdx;
1454 max_num = b->num + diff;
1458 cmp = bc_num_compare(max_num, min_num, b_int + min);
1459 if (cmp != 0) return BC_NUM_NEG(cmp, (!a_max) != neg);
1461 for (max_num -= diff, i = diff - 1; i < diff; --i) {
1462 if (max_num[i]) return BC_NUM_NEG(1, (!a_max) != neg);
1468 static void bc_num_truncate(BcNum *n, size_t places)
1470 if (places == 0) return;
1476 memmove(n->num, n->num + places, n->len * sizeof(BcDig));
1480 static void bc_num_extend(BcNum *n, size_t places)
1482 size_t len = n->len + places;
1486 if (n->cap < len) bc_num_expand(n, len);
1488 memmove(n->num + places, n->num, sizeof(BcDig) * n->len);
1489 memset(n->num, 0, sizeof(BcDig) * places);
1496 static void bc_num_clean(BcNum *n)
1498 while (n->len > 0 && n->num[n->len - 1] == 0) --n->len;
1501 else if (n->len < n->rdx)
1505 static void bc_num_retireMul(BcNum *n, size_t scale, bool neg1, bool neg2)
1508 bc_num_extend(n, scale - n->rdx);
1510 bc_num_truncate(n, n->rdx - scale);
1513 if (n->len != 0) n->neg = !neg1 != !neg2;
1516 static void bc_num_split(BcNum *restrict n, size_t idx, BcNum *restrict a,
1521 b->len = n->len - idx;
1523 a->rdx = b->rdx = 0;
1525 memcpy(b->num, n->num + idx, b->len * sizeof(BcDig));
1526 memcpy(a->num, n->num, idx * sizeof(BcDig));
1537 static BcStatus bc_num_shift(BcNum *n, size_t places)
1539 if (places == 0 || n->len == 0) return BC_STATUS_SUCCESS;
1540 if (places + n->len > BC_MAX_NUM)
1541 return bc_error("number too long: must be [1, BC_NUM_MAX]");
1543 if (n->rdx >= places)
1546 bc_num_extend(n, places - n->rdx);
1552 return BC_STATUS_SUCCESS;
1555 static BcStatus bc_num_inv(BcNum *a, BcNum *b, size_t scale)
1564 return bc_num_div(&one, a, b, scale);
1567 static BcStatus bc_num_a(BcNum *a, BcNum *b, BcNum *restrict c, size_t sub)
1569 BcDig *ptr, *ptr_a, *ptr_b, *ptr_c;
1570 size_t i, max, min_rdx, min_int, diff, a_int, b_int;
1573 // Because this function doesn't need to use scale (per the bc spec),
1574 // I am hijacking it to say whether it's doing an add or a subtract.
1578 if (sub && c->len) c->neg = !c->neg;
1579 return BC_STATUS_SUCCESS;
1581 else if (b->len == 0) {
1583 return BC_STATUS_SUCCESS;
1587 c->rdx = BC_MAX(a->rdx, b->rdx);
1588 min_rdx = BC_MIN(a->rdx, b->rdx);
1591 if (a->rdx > b->rdx) {
1592 diff = a->rdx - b->rdx;
1594 ptr_a = a->num + diff;
1598 diff = b->rdx - a->rdx;
1601 ptr_b = b->num + diff;
1604 for (ptr_c = c->num, i = 0; i < diff; ++i, ++c->len) ptr_c[i] = ptr[i];
1607 a_int = BC_NUM_INT(a);
1608 b_int = BC_NUM_INT(b);
1610 if (a_int > b_int) {
1621 for (carry = 0, i = 0; i < min_rdx + min_int; ++i, ++c->len) {
1622 in = ((int) ptr_a[i]) + ((int) ptr_b[i]) + carry;
1624 ptr_c[i] = (BcDig)(in % 10);
1627 for (; i < max + min_rdx; ++i, ++c->len) {
1628 in = ((int) ptr[i]) + carry;
1630 ptr_c[i] = (BcDig)(in % 10);
1633 if (carry != 0) c->num[c->len++] = (BcDig) carry;
1635 return BC_STATUS_SUCCESS; // can't make void, see bc_num_binary()
1638 static BcStatus bc_num_s(BcNum *a, BcNum *b, BcNum *restrict c, size_t sub)
1641 BcNum *minuend, *subtrahend;
1643 bool aneg, bneg, neg;
1645 // Because this function doesn't need to use scale (per the bc spec),
1646 // I am hijacking it to say whether it's doing an add or a subtract.
1650 if (sub && c->len) c->neg = !c->neg;
1651 return BC_STATUS_SUCCESS;
1653 else if (b->len == 0) {
1655 return BC_STATUS_SUCCESS;
1660 a->neg = b->neg = false;
1662 cmp = bc_num_cmp(a, b);
1668 bc_num_setToZero(c, BC_MAX(a->rdx, b->rdx));
1669 return BC_STATUS_SUCCESS;
1678 if (sub) neg = !neg;
1683 bc_num_copy(c, minuend);
1686 if (c->rdx < subtrahend->rdx) {
1687 bc_num_extend(c, subtrahend->rdx - c->rdx);
1691 start = c->rdx - subtrahend->rdx;
1693 bc_num_subArrays(c->num + start, subtrahend->num, subtrahend->len);
1697 return BC_STATUS_SUCCESS; // can't make void, see bc_num_binary()
1700 static BcStatus bc_num_k(BcNum *restrict a, BcNum *restrict b,
1704 size_t max = BC_MAX(a->len, b->len), max2 = (max + 1) / 2;
1705 BcNum l1, h1, l2, h2, m2, m1, z0, z1, z2, temp;
1708 if (a->len == 0 || b->len == 0) {
1710 return BC_STATUS_SUCCESS;
1712 aone = BC_NUM_ONE(a);
1713 if (aone || BC_NUM_ONE(b)) {
1714 bc_num_copy(c, aone ? b : a);
1715 return BC_STATUS_SUCCESS;
1718 if (a->len + b->len < BC_NUM_KARATSUBA_LEN ||
1719 a->len < BC_NUM_KARATSUBA_LEN || b->len < BC_NUM_KARATSUBA_LEN)
1724 bc_num_expand(c, a->len + b->len + 1);
1726 memset(c->num, 0, sizeof(BcDig) * c->cap);
1729 for (i = 0; i < b->len; ++i) {
1732 for (j = 0; j < a->len; ++j) {
1733 unsigned in = c->num[i + j];
1734 in += ((unsigned) a->num[j]) * ((unsigned) b->num[i]) + carry;
1735 // note: compilers prefer _unsigned_ div/const
1737 c->num[i + j] = (BcDig)(in % 10);
1740 c->num[i + j] += (BcDig) carry;
1741 len = BC_MAX(len, i + j + !!carry);
1744 // a*a <- without check below, this will not be interruptible
1745 if (G_interrupt) return BC_STATUS_FAILURE;
1750 return BC_STATUS_SUCCESS;
1753 bc_num_init(&l1, max);
1754 bc_num_init(&h1, max);
1755 bc_num_init(&l2, max);
1756 bc_num_init(&h2, max);
1757 bc_num_init(&m1, max);
1758 bc_num_init(&m2, max);
1759 bc_num_init(&z0, max);
1760 bc_num_init(&z1, max);
1761 bc_num_init(&z2, max);
1762 bc_num_init(&temp, max + max);
1764 bc_num_split(a, max2, &l1, &h1);
1765 bc_num_split(b, max2, &l2, &h2);
1767 s = bc_num_add(&h1, &l1, &m1, 0);
1769 s = bc_num_add(&h2, &l2, &m2, 0);
1772 s = bc_num_k(&h1, &h2, &z0);
1774 s = bc_num_k(&m1, &m2, &z1);
1776 s = bc_num_k(&l1, &l2, &z2);
1779 s = bc_num_sub(&z1, &z0, &temp, 0);
1781 s = bc_num_sub(&temp, &z2, &z1, 0);
1784 s = bc_num_shift(&z0, max2 * 2);
1786 s = bc_num_shift(&z1, max2);
1788 s = bc_num_add(&z0, &z1, &temp, 0);
1790 s = bc_num_add(&temp, &z2, c, 0);
1806 static BcStatus bc_num_m(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale)
1810 size_t maxrdx = BC_MAX(a->rdx, b->rdx);
1812 scale = BC_MAX(scale, a->rdx);
1813 scale = BC_MAX(scale, b->rdx);
1814 scale = BC_MIN(a->rdx + b->rdx, scale);
1815 maxrdx = BC_MAX(maxrdx, scale);
1817 bc_num_init(&cpa, a->len);
1818 bc_num_init(&cpb, b->len);
1820 bc_num_copy(&cpa, a);
1821 bc_num_copy(&cpb, b);
1822 cpa.neg = cpb.neg = false;
1824 s = bc_num_shift(&cpa, maxrdx);
1826 s = bc_num_shift(&cpb, maxrdx);
1828 s = bc_num_k(&cpa, &cpb, c);
1832 bc_num_expand(c, c->len + maxrdx);
1834 if (c->len < maxrdx) {
1835 memset(c->num + c->len, 0, (c->cap - c->len) * sizeof(BcDig));
1840 bc_num_retireMul(c, scale, a->neg, b->neg);
1848 static BcStatus bc_num_d(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale)
1850 BcStatus s = BC_STATUS_SUCCESS;
1857 return bc_error("divide by zero");
1858 else if (a->len == 0) {
1859 bc_num_setToZero(c, scale);
1860 return BC_STATUS_SUCCESS;
1862 else if (BC_NUM_ONE(b)) {
1864 bc_num_retireMul(c, scale, a->neg, b->neg);
1865 return BC_STATUS_SUCCESS;
1868 bc_num_init(&cp, BC_NUM_MREQ(a, b, scale));
1869 bc_num_copy(&cp, a);
1873 bc_num_expand(&cp, len + 2);
1874 bc_num_extend(&cp, len - cp.len);
1877 if (b->rdx > cp.rdx) bc_num_extend(&cp, b->rdx - cp.rdx);
1879 if (scale > cp.rdx) bc_num_extend(&cp, scale - cp.rdx);
1881 if (b->rdx == b->len) {
1882 for (i = 0; zero && i < len; ++i) zero = !b->num[len - i - 1];
1886 if (cp.cap == cp.len) bc_num_expand(&cp, cp.len + 1);
1888 // We want an extra zero in front to make things simpler.
1889 cp.num[cp.len++] = 0;
1892 bc_num_expand(c, cp.len);
1895 memset(c->num + end, 0, (c->cap - end) * sizeof(BcDig));
1900 for (i = end - 1; !s && i < end; --i) {
1902 for (q = 0; (!s && n[len] != 0) || bc_num_compare(n, p, len) >= 0; ++q)
1903 bc_num_subArrays(n, p, len);
1907 // 1/a <- without check below, this will not be interruptible
1909 s = BC_STATUS_FAILURE;
1914 bc_num_retireMul(c, scale, a->neg, b->neg);
1920 static BcStatus bc_num_r(BcNum *a, BcNum *b, BcNum *restrict c,
1921 BcNum *restrict d, size_t scale, size_t ts)
1928 return bc_error("divide by zero");
1931 bc_num_setToZero(d, ts);
1932 return BC_STATUS_SUCCESS;
1935 bc_num_init(&temp, d->cap);
1936 s = bc_num_d(a, b, c, scale);
1939 if (scale != 0) scale = ts;
1941 s = bc_num_m(c, b, &temp, scale);
1943 s = bc_num_sub(a, &temp, d, scale);
1946 if (ts > d->rdx && d->len) bc_num_extend(d, ts - d->rdx);
1949 bc_num_retireMul(d, ts, a->neg, b->neg);
1957 static BcStatus bc_num_rem(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale)
1961 size_t ts = BC_MAX(scale + b->rdx, a->rdx), len = BC_NUM_MREQ(a, b, ts);
1963 bc_num_init(&c1, len);
1964 s = bc_num_r(a, b, &c1, c, scale, ts);
1970 static BcStatus bc_num_p(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale)
1972 BcStatus s = BC_STATUS_SUCCESS;
1975 size_t i, powrdx, resrdx;
1978 if (b->rdx) return bc_error("non integer number");
1982 return BC_STATUS_SUCCESS;
1984 else if (a->len == 0) {
1985 bc_num_setToZero(c, scale);
1986 return BC_STATUS_SUCCESS;
1988 else if (BC_NUM_ONE(b)) {
1992 s = bc_num_inv(a, c, scale);
1999 s = bc_num_ulong(b, &pow);
2002 bc_num_init(©, a->len);
2003 bc_num_copy(©, a);
2005 if (!neg) scale = BC_MIN(a->rdx * pow, BC_MAX(scale, a->rdx));
2009 for (powrdx = a->rdx; !(pow & 1); pow >>= 1) {
2011 s = bc_num_mul(©, ©, ©, powrdx);
2013 // Not needed: bc_num_mul() has a check for ^C:
2014 //if (G_interrupt) {
2015 // s = BC_STATUS_FAILURE;
2020 bc_num_copy(c, ©);
2022 for (resrdx = powrdx, pow >>= 1; pow != 0; pow >>= 1) {
2025 s = bc_num_mul(©, ©, ©, powrdx);
2030 s = bc_num_mul(c, ©, c, resrdx);
2033 // Not needed: bc_num_mul() has a check for ^C:
2034 //if (G_interrupt) {
2035 // s = BC_STATUS_FAILURE;
2041 s = bc_num_inv(c, c, scale);
2045 if (c->rdx > scale) bc_num_truncate(c, c->rdx - scale);
2047 // We can't use bc_num_clean() here.
2048 for (zero = true, i = 0; zero && i < c->len; ++i) zero = !c->num[i];
2049 if (zero) bc_num_setToZero(c, scale);
2056 static BcStatus bc_num_binary(BcNum *a, BcNum *b, BcNum *c, size_t scale,
2057 BcNumBinaryOp op, size_t req)
2060 BcNum num2, *ptr_a, *ptr_b;
2065 memcpy(ptr_a, c, sizeof(BcNum));
2074 memcpy(ptr_b, c, sizeof(BcNum));
2082 bc_num_init(c, req);
2084 bc_num_expand(c, req);
2086 s = op(ptr_a, ptr_b, c, scale);
2088 if (init) bc_num_free(&num2);
2093 static bool bc_num_strValid(const char *val, size_t base)
2096 bool small, radix = false;
2097 size_t i, len = strlen(val);
2099 if (!len) return true;
2102 b = (BcDig)(small ? base + '0' : base - 10 + 'A');
2104 for (i = 0; i < len; ++i) {
2110 if (radix) return false;
2116 if (c < '0' || (small && c >= b) || (c > '9' && (c < 'A' || c >= b)))
2123 static void bc_num_parseDecimal(BcNum *n, const char *val)
2129 for (i = 0; val[i] == '0'; ++i);
2136 for (i = 0; zero && i < len; ++i) zero = val[i] == '0' || val[i] == '.';
2137 bc_num_expand(n, len);
2140 ptr = strchr(val, '.');
2144 n->rdx = (size_t)((val + len) - (ptr + 1));
2147 for (i = len - 1; i < len; ++n->len, i -= 1 + (i && val[i - 1] == '.'))
2148 n->num[n->len] = val[i] - '0';
2152 static void bc_num_parseBase(BcNum *n, const char *val, BcNum *base)
2155 BcNum temp, mult, result;
2159 size_t i, digits, len = strlen(val);
2163 for (i = 0; zero && i < len; ++i) zero = (val[i] == '.' || val[i] == '0');
2166 bc_num_init(&temp, BC_NUM_DEF_SIZE);
2167 bc_num_init(&mult, BC_NUM_DEF_SIZE);
2169 for (i = 0; i < len; ++i) {
2172 if (c == '.') break;
2174 v = (unsigned long) (c <= '9' ? c - '0' : c - 'A' + 10);
2176 s = bc_num_mul(n, base, &mult, 0);
2177 if (s) goto int_err;
2178 bc_num_ulong2num(&temp, v);
2179 s = bc_num_add(&mult, &temp, n, 0);
2180 if (s) goto int_err;
2185 if (c == 0) goto int_err;
2188 bc_num_init(&result, base->len);
2189 bc_num_zero(&result);
2192 for (i += 1, digits = 0; i < len; ++i, ++digits) {
2197 v = (unsigned long) (c <= '9' ? c - '0' : c - 'A' + 10);
2199 s = bc_num_mul(&result, base, &result, 0);
2201 bc_num_ulong2num(&temp, v);
2202 s = bc_num_add(&result, &temp, &result, 0);
2204 s = bc_num_mul(&mult, base, &mult, 0);
2208 s = bc_num_div(&result, &mult, &result, digits);
2210 s = bc_num_add(n, &result, n, digits);
2214 if (n->rdx < digits) bc_num_extend(n, digits - n->rdx);
2220 bc_num_free(&result);
2226 static void bc_num_printNewline(size_t *nchars, size_t line_len)
2228 if (*nchars == line_len - 1) {
2236 static void bc_num_printChar(size_t num, size_t width, bool radix,
2237 size_t *nchars, size_t line_len)
2239 (void) radix, (void) line_len;
2240 bb_putchar((char) num);
2241 *nchars = *nchars + width;
2245 static void bc_num_printDigits(size_t num, size_t width, bool radix,
2246 size_t *nchars, size_t line_len)
2250 bc_num_printNewline(nchars, line_len);
2251 bb_putchar(radix ? '.' : ' ');
2254 bc_num_printNewline(nchars, line_len);
2255 for (exp = 0, pow = 1; exp < width - 1; ++exp, pow *= 10)
2258 for (exp = 0; exp < width; pow /= 10, ++(*nchars), ++exp) {
2260 bc_num_printNewline(nchars, line_len);
2263 bb_putchar(((char) dig) + '0');
2267 static void bc_num_printHex(size_t num, size_t width, bool radix,
2268 size_t *nchars, size_t line_len)
2271 bc_num_printNewline(nchars, line_len);
2276 bc_num_printNewline(nchars, line_len);
2277 bb_putchar(bb_hexdigits_upcase[num]);
2278 *nchars = *nchars + width;
2281 static void bc_num_printDecimal(BcNum *n, size_t *nchars, size_t len)
2283 size_t i, rdx = n->rdx - 1;
2285 if (n->neg) bb_putchar('-');
2286 (*nchars) += n->neg;
2288 for (i = n->len - 1; i < n->len; --i)
2289 bc_num_printHex((size_t) n->num[i], 1, i == rdx, nchars, len);
2292 static BcStatus bc_num_printNum(BcNum *n, BcNum *base, size_t width,
2293 size_t *nchars, size_t len, BcNumDigitOp print)
2297 BcNum intp, fracp, digit, frac_len;
2298 unsigned long dig, *ptr;
2303 print(0, width, false, nchars, len);
2304 return BC_STATUS_SUCCESS;
2307 bc_vec_init(&stack, sizeof(long), NULL);
2308 bc_num_init(&intp, n->len);
2309 bc_num_init(&fracp, n->rdx);
2310 bc_num_init(&digit, width);
2311 bc_num_init(&frac_len, BC_NUM_INT(n));
2312 bc_num_copy(&intp, n);
2313 bc_num_one(&frac_len);
2315 bc_num_truncate(&intp, intp.rdx);
2316 s = bc_num_sub(n, &intp, &fracp, 0);
2319 while (intp.len != 0) {
2320 s = bc_num_divmod(&intp, base, &intp, &digit, 0);
2322 s = bc_num_ulong(&digit, &dig);
2324 bc_vec_push(&stack, &dig);
2327 for (i = 0; i < stack.len; ++i) {
2328 ptr = bc_vec_item_rev(&stack, i);
2329 print(*ptr, width, false, nchars, len);
2332 if (!n->rdx) goto err;
2334 for (radix = true; frac_len.len <= n->rdx; radix = false) {
2335 s = bc_num_mul(&fracp, base, &fracp, n->rdx);
2337 s = bc_num_ulong(&fracp, &dig);
2339 bc_num_ulong2num(&intp, dig);
2340 s = bc_num_sub(&fracp, &intp, &fracp, 0);
2342 print(dig, width, radix, nchars, len);
2343 s = bc_num_mul(&frac_len, base, &frac_len, 0);
2348 bc_num_free(&frac_len);
2349 bc_num_free(&digit);
2350 bc_num_free(&fracp);
2352 bc_vec_free(&stack);
2356 static BcStatus bc_num_printBase(BcNum *n, BcNum *base, size_t base_t,
2357 size_t *nchars, size_t line_len)
2364 if (neg) bb_putchar('-');
2369 if (base_t <= BC_NUM_MAX_IBASE) {
2371 print = bc_num_printHex;
2374 for (i = base_t - 1, width = 0; i != 0; i /= 10, ++width);
2375 print = bc_num_printDigits;
2378 s = bc_num_printNum(n, base, width, nchars, line_len, print);
2385 static BcStatus bc_num_stream(BcNum *n, BcNum *base, size_t *nchars, size_t len)
2387 return bc_num_printNum(n, base, 1, nchars, len, bc_num_printChar);
2391 static BcStatus bc_num_parse(BcNum *n, const char *val, BcNum *base,
2394 if (!bc_num_strValid(val, base_t))
2395 return bc_error("bad number string");
2398 bc_num_parseDecimal(n, val);
2400 bc_num_parseBase(n, val, base);
2402 return BC_STATUS_SUCCESS;
2405 static BcStatus bc_num_print(BcNum *n, BcNum *base, size_t base_t, bool newline,
2406 size_t *nchars, size_t line_len)
2408 BcStatus s = BC_STATUS_SUCCESS;
2410 bc_num_printNewline(nchars, line_len);
2416 else if (base_t == 10)
2417 bc_num_printDecimal(n, nchars, line_len);
2419 s = bc_num_printBase(n, base, base_t, nchars, line_len);
2429 static BcStatus bc_num_add(BcNum *a, BcNum *b, BcNum *c, size_t scale)
2431 BcNumBinaryOp op = (!a->neg == !b->neg) ? bc_num_a : bc_num_s;
2433 return bc_num_binary(a, b, c, false, op, BC_NUM_AREQ(a, b));
2436 static BcStatus bc_num_sub(BcNum *a, BcNum *b, BcNum *c, size_t scale)
2438 BcNumBinaryOp op = (!a->neg == !b->neg) ? bc_num_s : bc_num_a;
2440 return bc_num_binary(a, b, c, true, op, BC_NUM_AREQ(a, b));
2443 static BcStatus bc_num_mul(BcNum *a, BcNum *b, BcNum *c, size_t scale)
2445 size_t req = BC_NUM_MREQ(a, b, scale);
2446 return bc_num_binary(a, b, c, scale, bc_num_m, req);
2449 static BcStatus bc_num_div(BcNum *a, BcNum *b, BcNum *c, size_t scale)
2451 size_t req = BC_NUM_MREQ(a, b, scale);
2452 return bc_num_binary(a, b, c, scale, bc_num_d, req);
2455 static BcStatus bc_num_mod(BcNum *a, BcNum *b, BcNum *c, size_t scale)
2457 size_t req = BC_NUM_MREQ(a, b, scale);
2458 return bc_num_binary(a, b, c, scale, bc_num_rem, req);
2461 static BcStatus bc_num_pow(BcNum *a, BcNum *b, BcNum *c, size_t scale)
2463 return bc_num_binary(a, b, c, scale, bc_num_p, a->len * b->len + 1);
2466 static BcStatus bc_num_sqrt(BcNum *a, BcNum *restrict b, size_t scale)
2469 BcNum num1, num2, half, f, fprime, *x0, *x1, *temp;
2470 size_t pow, len, digs, digs1, resrdx, req, times = 0;
2471 ssize_t cmp = 1, cmp1 = SSIZE_MAX, cmp2 = SSIZE_MAX;
2473 req = BC_MAX(scale, a->rdx) + ((BC_NUM_INT(a) + 1) >> 1) + 1;
2474 bc_num_expand(b, req);
2477 bc_num_setToZero(b, scale);
2478 return BC_STATUS_SUCCESS;
2481 return bc_error("negative number");
2482 else if (BC_NUM_ONE(a)) {
2484 bc_num_extend(b, scale);
2485 return BC_STATUS_SUCCESS;
2488 scale = BC_MAX(scale, a->rdx) + 1;
2489 len = a->len + scale;
2491 bc_num_init(&num1, len);
2492 bc_num_init(&num2, len);
2493 bc_num_init(&half, BC_NUM_DEF_SIZE);
2499 bc_num_init(&f, len);
2500 bc_num_init(&fprime, len);
2506 pow = BC_NUM_INT(a);
2515 pow -= 2 - (pow & 1);
2517 bc_num_extend(x0, pow);
2519 // Make sure to move the radix back.
2523 x0->rdx = digs = digs1 = 0;
2525 len = BC_NUM_INT(x0) + resrdx - 1;
2527 while (cmp != 0 || digs < len) {
2529 s = bc_num_div(a, x0, &f, resrdx);
2531 s = bc_num_add(x0, &f, &fprime, resrdx);
2533 s = bc_num_mul(&fprime, &half, x1, resrdx);
2536 cmp = bc_num_cmp(x1, x0);
2537 digs = x1->len - (unsigned long long) llabs(cmp);
2539 if (cmp == cmp2 && digs == digs1)
2544 resrdx += times > 4;
2557 if (b->rdx > scale) bc_num_truncate(b, b->rdx - scale);
2560 bc_num_free(&fprime);
2568 static BcStatus bc_num_divmod(BcNum *a, BcNum *b, BcNum *c, BcNum *d,
2574 size_t ts = BC_MAX(scale + b->rdx, a->rdx), len = BC_NUM_MREQ(a, b, ts);
2577 memcpy(&num2, c, sizeof(BcNum));
2579 bc_num_init(c, len);
2584 bc_num_expand(c, len);
2587 s = bc_num_r(ptr_a, b, c, d, scale, ts);
2589 if (init) bc_num_free(&num2);
2595 static BcStatus bc_num_modexp(BcNum *a, BcNum *b, BcNum *c, BcNum *restrict d)
2598 BcNum base, exp, two, temp;
2601 return bc_error("divide by zero");
2602 if (a->rdx || b->rdx || c->rdx)
2603 return bc_error("non integer number");
2605 return bc_error("negative number");
2607 bc_num_expand(d, c->len);
2608 bc_num_init(&base, c->len);
2609 bc_num_init(&exp, b->len);
2610 bc_num_init(&two, BC_NUM_DEF_SIZE);
2611 bc_num_init(&temp, b->len);
2617 s = bc_num_rem(a, c, &base, 0);
2619 bc_num_copy(&exp, b);
2621 while (exp.len != 0) {
2623 s = bc_num_divmod(&exp, &two, &exp, &temp, 0);
2626 if (BC_NUM_ONE(&temp)) {
2627 s = bc_num_mul(d, &base, &temp, 0);
2629 s = bc_num_rem(&temp, c, d, 0);
2633 s = bc_num_mul(&base, &base, &temp, 0);
2635 s = bc_num_rem(&temp, c, &base, 0);
2648 static BcStatus bc_func_insert(BcFunc *f, char *name, bool var)
2653 for (i = 0; i < f->autos.len; ++i) {
2654 if (strcmp(name, ((BcId *) bc_vec_item(&f->autos, i))->name) == 0)
2655 return bc_error("function parameter or auto var has the same name as another");
2661 bc_vec_push(&f->autos, &a);
2663 return BC_STATUS_SUCCESS;
2666 static void bc_func_init(BcFunc *f)
2668 bc_char_vec_init(&f->code);
2669 bc_vec_init(&f->autos, sizeof(BcId), bc_id_free);
2670 bc_vec_init(&f->labels, sizeof(size_t), NULL);
2674 static void bc_func_free(void *func)
2676 BcFunc *f = (BcFunc *) func;
2677 bc_vec_free(&f->code);
2678 bc_vec_free(&f->autos);
2679 bc_vec_free(&f->labels);
2682 static void bc_array_expand(BcVec *a, size_t len);
2684 static void bc_array_init(BcVec *a, bool nums)
2687 bc_vec_init(a, sizeof(BcNum), bc_num_free);
2689 bc_vec_init(a, sizeof(BcVec), bc_vec_free);
2690 bc_array_expand(a, 1);
2693 static void bc_array_expand(BcVec *a, size_t len)
2697 if (a->size == sizeof(BcNum) && a->dtor == bc_num_free) {
2698 while (len > a->len) {
2699 bc_num_init(&data.n, BC_NUM_DEF_SIZE);
2700 bc_vec_push(a, &data.n);
2704 while (len > a->len) {
2705 bc_array_init(&data.v, true);
2706 bc_vec_push(a, &data.v);
2711 static void bc_array_copy(BcVec *d, const BcVec *s)
2716 bc_vec_expand(d, s->cap);
2719 for (i = 0; i < s->len; ++i) {
2720 BcNum *dnum = bc_vec_item(d, i), *snum = bc_vec_item(s, i);
2721 bc_num_init(dnum, snum->len);
2722 bc_num_copy(dnum, snum);
2726 static void bc_string_free(void *string)
2728 free(*((char **) string));
2732 static void bc_result_copy(BcResult *d, BcResult *src)
2738 case BC_RESULT_TEMP:
2739 case BC_RESULT_IBASE:
2740 case BC_RESULT_SCALE:
2741 case BC_RESULT_OBASE:
2743 bc_num_init(&d->d.n, src->d.n.len);
2744 bc_num_copy(&d->d.n, &src->d.n);
2749 case BC_RESULT_ARRAY:
2750 case BC_RESULT_ARRAY_ELEM:
2752 d->d.id.name = xstrdup(src->d.id.name);
2756 case BC_RESULT_CONSTANT:
2757 case BC_RESULT_LAST:
2761 memcpy(&d->d.n, &src->d.n, sizeof(BcNum));
2768 static void bc_result_free(void *result)
2770 BcResult *r = (BcResult *) result;
2774 case BC_RESULT_TEMP:
2775 case BC_RESULT_IBASE:
2776 case BC_RESULT_SCALE:
2777 case BC_RESULT_OBASE:
2779 bc_num_free(&r->d.n);
2784 case BC_RESULT_ARRAY:
2785 case BC_RESULT_ARRAY_ELEM:
2799 static void bc_lex_lineComment(BcLex *l)
2801 l->t.t = BC_LEX_WHITESPACE;
2802 while (l->i < l->len && l->buf[l->i++] != '\n');
2806 static void bc_lex_whitespace(BcLex *l)
2809 l->t.t = BC_LEX_WHITESPACE;
2810 for (c = l->buf[l->i]; c != '\n' && isspace(c); c = l->buf[++l->i]);
2813 static BcStatus bc_lex_number(BcLex *l, char start)
2815 const char *buf = l->buf + l->i;
2816 size_t len, hits = 0, bslashes = 0, i = 0, j;
2818 bool last_pt, pt = start == '.';
2821 l->t.t = BC_LEX_NUMBER;
2823 while (c != 0 && (isdigit(c) || (c >= 'A' && c <= 'F') ||
2824 (c == '.' && !pt) || (c == '\\' && buf[i + 1] == '\n')))
2838 len = i + !last_pt - bslashes * 2;
2839 if (len > BC_MAX_NUM)
2840 return bc_error("number too long: must be [1, BC_NUM_MAX]");
2842 bc_vec_pop_all(&l->t.v);
2843 bc_vec_expand(&l->t.v, len + 1);
2844 bc_vec_push(&l->t.v, &start);
2846 for (buf -= 1, j = 1; j < len + hits * 2; ++j) {
2850 // If we have hit a backslash, skip it. We don't have
2851 // to check for a newline because it's guaranteed.
2852 if (hits < bslashes && c == '\\') {
2858 bc_vec_push(&l->t.v, &c);
2861 bc_vec_pushZeroByte(&l->t.v);
2864 return BC_STATUS_SUCCESS;
2867 static BcStatus bc_lex_name(BcLex *l)
2870 const char *buf = l->buf + l->i - 1;
2873 l->t.t = BC_LEX_NAME;
2875 while ((c >= 'a' && c <= 'z') || isdigit(c) || c == '_') c = buf[++i];
2877 if (i > BC_MAX_STRING)
2878 return bc_error("name too long: must be [1, BC_NAME_MAX]");
2879 bc_vec_string(&l->t.v, i, buf);
2881 // Increment the index. We minus 1 because it has already been incremented.
2884 return BC_STATUS_SUCCESS;
2887 static void bc_lex_init(BcLex *l, BcLexNext next)
2890 bc_char_vec_init(&l->t.v);
2893 static void bc_lex_free(BcLex *l)
2895 bc_vec_free(&l->t.v);
2898 static void bc_lex_file(BcLex *l)
2900 G.err_line = l->line = 1;
2904 static BcStatus bc_lex_next(BcLex *l)
2909 if (l->t.last == BC_LEX_EOF) return bc_error("end of file");
2911 l->line += l->newline;
2912 G.err_line = l->line;
2913 l->t.t = BC_LEX_EOF;
2915 l->newline = (l->i == l->len);
2916 if (l->newline) return BC_STATUS_SUCCESS;
2918 // Loop until failure or we don't have whitespace. This
2919 // is so the parser doesn't get inundated with whitespace.
2922 } while (!s && l->t.t == BC_LEX_WHITESPACE);
2927 static BcStatus bc_lex_text(BcLex *l, const char *text)
2931 l->len = strlen(text);
2932 l->t.t = l->t.last = BC_LEX_INVALID;
2933 return bc_lex_next(l);
2937 static BcStatus bc_lex_identifier(BcLex *l)
2941 const char *buf = l->buf + l->i - 1;
2943 for (i = 0; i < ARRAY_SIZE(bc_lex_kws); ++i) {
2944 const char *keyword8 = bc_lex_kws[i].name8;
2946 while (buf[j] != '\0' && buf[j] == keyword8[j]) {
2948 if (j == 8) goto match;
2950 if (keyword8[j] != '\0')
2953 // buf starts with keyword bc_lex_kws[i]
2954 l->t.t = BC_LEX_KEY_1st_keyword + i;
2955 if (!((1 << i) & POSIX_KWORD_MASK)) {
2956 s = bc_posix_error_fmt("%sthe '%.8s' keyword", "POSIX does not allow ", bc_lex_kws[i].name8);
2960 // We minus 1 because the index has already been incremented.
2962 return BC_STATUS_SUCCESS;
2968 if (l->t.v.len > 2) {
2971 // bc: POSIX only allows one character names; the following is bad: 'qwe=1
2973 unsigned len = strchrnul(buf, '\n') - buf;
2974 s = bc_posix_error_fmt("POSIX only allows one character names; the following is bad: '%.*s'", len, buf);
2980 static BcStatus bc_lex_string(BcLex *l)
2982 size_t len, nls = 0, i = l->i;
2985 l->t.t = BC_LEX_STR;
2987 for (c = l->buf[i]; c != 0 && c != '"'; c = l->buf[++i]) nls += (c == '\n');
2991 return bc_error("string end could not be found");
2995 if (len > BC_MAX_STRING)
2996 return bc_error("string too long: must be [1, BC_STRING_MAX]");
2997 bc_vec_string(&l->t.v, len, l->buf + l->i);
3001 G.err_line = l->line;
3003 return BC_STATUS_SUCCESS;
3006 static void bc_lex_assign(BcLex *l, BcLexType with, BcLexType without)
3008 if (l->buf[l->i] == '=') {
3016 static BcStatus bc_lex_comment(BcLex *l)
3019 const char *buf = l->buf;
3021 l->t.t = BC_LEX_WHITESPACE;
3034 return bc_error("comment end could not be found");
3042 G.err_line = l->line;
3044 return BC_STATUS_SUCCESS;
3047 static BcStatus bc_lex_token(BcLex *l)
3049 BcStatus s = BC_STATUS_SUCCESS;
3050 char c = l->buf[l->i++], c2;
3052 // This is the workhorse of the lexer.
3059 l->t.t = !c ? BC_LEX_EOF : BC_LEX_NLINE;
3069 bc_lex_whitespace(l);
3075 bc_lex_assign(l, BC_LEX_OP_REL_NE, BC_LEX_OP_BOOL_NOT);
3077 if (l->t.t == BC_LEX_OP_BOOL_NOT) {
3078 s = bc_POSIX_does_not_allow_bool_ops_this_is_bad("!");
3087 s = bc_lex_string(l);
3093 s = bc_POSIX_does_not_allow("'#' script comments");
3096 bc_lex_lineComment(l);
3103 bc_lex_assign(l, BC_LEX_OP_ASSIGN_MODULUS, BC_LEX_OP_MODULUS);
3112 s = bc_POSIX_does_not_allow_bool_ops_this_is_bad("&&");
3116 l->t.t = BC_LEX_OP_BOOL_AND;
3119 l->t.t = BC_LEX_INVALID;
3120 s = bc_error_bad_character('&');
3129 l->t.t = (BcLexType)(c - '(' + BC_LEX_LPAREN);
3135 bc_lex_assign(l, BC_LEX_OP_ASSIGN_MULTIPLY, BC_LEX_OP_MULTIPLY);
3144 l->t.t = BC_LEX_OP_INC;
3147 bc_lex_assign(l, BC_LEX_OP_ASSIGN_PLUS, BC_LEX_OP_PLUS);
3153 l->t.t = BC_LEX_COMMA;
3162 l->t.t = BC_LEX_OP_DEC;
3165 bc_lex_assign(l, BC_LEX_OP_ASSIGN_MINUS, BC_LEX_OP_MINUS);
3171 if (isdigit(l->buf[l->i]))
3172 s = bc_lex_number(l, c);
3174 l->t.t = BC_LEX_KEY_LAST;
3175 s = bc_POSIX_does_not_allow("a period ('.') as a shortcut for the last result");
3184 s = bc_lex_comment(l);
3186 bc_lex_assign(l, BC_LEX_OP_ASSIGN_DIVIDE, BC_LEX_OP_DIVIDE);
3207 s = bc_lex_number(l, c);
3213 l->t.t = BC_LEX_SCOLON;
3219 bc_lex_assign(l, BC_LEX_OP_REL_LE, BC_LEX_OP_REL_LT);
3225 bc_lex_assign(l, BC_LEX_OP_REL_EQ, BC_LEX_OP_ASSIGN);
3231 bc_lex_assign(l, BC_LEX_OP_REL_GE, BC_LEX_OP_REL_GT);
3238 l->t.t = (BcLexType)(c - '[' + BC_LEX_LBRACKET);
3244 if (l->buf[l->i] == '\n') {
3245 l->t.t = BC_LEX_WHITESPACE;
3249 s = bc_error_bad_character(c);
3255 bc_lex_assign(l, BC_LEX_OP_ASSIGN_POWER, BC_LEX_OP_POWER);
3286 s = bc_lex_identifier(l);
3293 l->t.t = (BcLexType)(c - '{' + BC_LEX_LBRACE);
3302 s = bc_POSIX_does_not_allow_bool_ops_this_is_bad("||");
3306 l->t.t = BC_LEX_OP_BOOL_OR;
3309 l->t.t = BC_LEX_INVALID;
3310 s = bc_error_bad_character(c);
3318 l->t.t = BC_LEX_INVALID;
3319 s = bc_error_bad_character(c);
3329 static BcStatus dc_lex_register(BcLex *l)
3331 BcStatus s = BC_STATUS_SUCCESS;
3333 if (isspace(l->buf[l->i - 1])) {
3334 bc_lex_whitespace(l);
3337 s = bc_error("extended register");
3342 bc_vec_pop_all(&l->t.v);
3343 bc_vec_pushByte(&l->t.v, l->buf[l->i - 1]);
3344 bc_vec_pushZeroByte(&l->t.v);
3345 l->t.t = BC_LEX_NAME;
3351 static BcStatus dc_lex_string(BcLex *l)
3353 size_t depth = 1, nls = 0, i = l->i;
3356 l->t.t = BC_LEX_STR;
3357 bc_vec_pop_all(&l->t.v);
3359 for (c = l->buf[i]; c != 0 && depth; c = l->buf[++i]) {
3361 depth += (c == '[' && (i == l->i || l->buf[i - 1] != '\\'));
3362 depth -= (c == ']' && (i == l->i || l->buf[i - 1] != '\\'));
3365 if (depth) bc_vec_push(&l->t.v, &c);
3370 return bc_error("string end could not be found");
3373 bc_vec_pushZeroByte(&l->t.v);
3374 if (i - l->i > BC_MAX_STRING)
3375 return bc_error("string too long: must be [1, BC_STRING_MAX]");
3379 G.err_line = l->line;
3381 return BC_STATUS_SUCCESS;
3384 static BcStatus dc_lex_token(BcLex *l)
3386 BcStatus s = BC_STATUS_SUCCESS;
3387 char c = l->buf[l->i++], c2;
3390 for (i = 0; i < ARRAY_SIZE(dc_lex_regs); ++i) {
3391 if (l->t.last == dc_lex_regs[i])
3392 return dc_lex_register(l);
3395 if (c >= '%' && c <= '~' &&
3396 (l->t.t = dc_lex_tokens[(c - '%')]) != BC_LEX_INVALID)
3401 // This is the workhorse of the lexer.
3406 l->t.t = BC_LEX_EOF;
3417 l->newline = (c == '\n');
3418 bc_lex_whitespace(l);
3427 l->t.t = BC_LEX_OP_REL_NE;
3429 l->t.t = BC_LEX_OP_REL_LE;
3431 l->t.t = BC_LEX_OP_REL_GE;
3433 return bc_error_bad_character(c);
3441 bc_lex_lineComment(l);
3447 if (isdigit(l->buf[l->i]))
3448 s = bc_lex_number(l, c);
3450 s = bc_error_bad_character(c);
3471 s = bc_lex_number(l, c);
3477 s = dc_lex_string(l);
3483 l->t.t = BC_LEX_INVALID;
3484 s = bc_error_bad_character(c);
3493 static void bc_parse_addFunc(BcParse *p, char *name, size_t *idx)
3495 bc_program_addFunc(name, idx);
3496 p->func = bc_vec_item(&G.prog.fns, p->fidx);
3499 static void bc_parse_pushName(BcParse *p, char *name)
3501 size_t i = 0, len = strlen(name);
3503 for (; i < len; ++i) bc_parse_push(p, name[i]);
3504 bc_parse_push(p, BC_PARSE_STREND);
3509 static void bc_parse_pushIndex(BcParse *p, size_t idx)
3511 unsigned char amt, i, nums[sizeof(size_t)];
3513 for (amt = 0; idx; ++amt) {
3514 nums[amt] = (char) idx;
3515 idx = (idx & ((unsigned long) ~(UCHAR_MAX))) >> sizeof(char) * CHAR_BIT;
3518 bc_parse_push(p, amt);
3519 for (i = 0; i < amt; ++i) bc_parse_push(p, nums[i]);
3522 static void bc_parse_number(BcParse *p, BcInst *prev, size_t *nexs)
3524 char *num = xstrdup(p->l.t.v.v);
3525 size_t idx = G.prog.consts.len;
3527 bc_vec_push(&G.prog.consts, &num);
3529 bc_parse_push(p, BC_INST_NUM);
3530 bc_parse_pushIndex(p, idx);
3533 (*prev) = BC_INST_NUM;
3536 static BcStatus bc_parse_text(BcParse *p, const char *text)
3540 p->func = bc_vec_item(&G.prog.fns, p->fidx);
3542 if (!text[0] && !BC_PARSE_CAN_EXEC(p)) {
3543 p->l.t.t = BC_LEX_INVALID;
3546 if (!BC_PARSE_CAN_EXEC(p))
3547 return bc_error("file is not executable");
3550 return bc_lex_text(&p->l, text);
3553 // Called when bc/dc_parse_parse() detects a failure,
3554 // resets parsing structures.
3555 static void bc_parse_reset(BcParse *p)
3557 if (p->fidx != BC_PROG_MAIN) {
3558 p->func->nparams = 0;
3559 bc_vec_pop_all(&p->func->code);
3560 bc_vec_pop_all(&p->func->autos);
3561 bc_vec_pop_all(&p->func->labels);
3563 bc_parse_updateFunc(p, BC_PROG_MAIN);
3567 p->l.t.t = BC_LEX_EOF;
3568 p->auto_part = (p->nbraces = 0);
3570 bc_vec_npop(&p->flags, p->flags.len - 1);
3571 bc_vec_pop_all(&p->exits);
3572 bc_vec_pop_all(&p->conds);
3573 bc_vec_pop_all(&p->ops);
3578 static void bc_parse_free(BcParse *p)
3580 bc_vec_free(&p->flags);
3581 bc_vec_free(&p->exits);
3582 bc_vec_free(&p->conds);
3583 bc_vec_free(&p->ops);
3587 static void bc_parse_create(BcParse *p, size_t func,
3588 BcParseParse parse, BcLexNext next)
3590 memset(p, 0, sizeof(BcParse));
3592 bc_lex_init(&p->l, next);
3593 bc_vec_init(&p->flags, sizeof(uint8_t), NULL);
3594 bc_vec_init(&p->exits, sizeof(BcInstPtr), NULL);
3595 bc_vec_init(&p->conds, sizeof(size_t), NULL);
3596 bc_vec_pushZeroByte(&p->flags);
3597 bc_vec_init(&p->ops, sizeof(BcLexType), NULL);
3600 // p->auto_part = p->nbraces = 0; - already is
3601 bc_parse_updateFunc(p, func);
3606 #define BC_PARSE_TOP_OP(p) (*((BcLexType *) bc_vec_top(&(p)->ops)))
3607 #define BC_PARSE_LEAF(p, rparen) \
3608 (((p) >= BC_INST_NUM && (p) <= BC_INST_SQRT) || (rparen) || \
3609 (p) == BC_INST_INC_POST || (p) == BC_INST_DEC_POST)
3611 // We can calculate the conversion between tokens and exprs by subtracting the
3612 // position of the first operator in the lex enum and adding the position of the
3613 // first in the expr enum. Note: This only works for binary operators.
3614 #define BC_PARSE_TOKEN_INST(t) ((char) ((t) -BC_LEX_NEG + BC_INST_NEG))
3616 static BcStatus bc_parse_else(BcParse *p);
3617 static BcStatus bc_parse_stmt(BcParse *p);
3618 static BcStatus bc_parse_expr(BcParse *p, uint8_t flags, BcParseNext next);
3620 static BcStatus bc_parse_operator(BcParse *p, BcLexType type, size_t start,
3621 size_t *nexprs, bool next)
3623 BcStatus s = BC_STATUS_SUCCESS;
3625 char l, r = bc_parse_op_PREC(type - BC_LEX_OP_INC);
3626 bool left = bc_parse_op_LEFT(type - BC_LEX_OP_INC);
3628 while (p->ops.len > start) {
3630 t = BC_PARSE_TOP_OP(p);
3631 if (t == BC_LEX_LPAREN) break;
3633 l = bc_parse_op_PREC(t - BC_LEX_OP_INC);
3634 if (l >= r && (l != r || !left)) break;
3636 bc_parse_push(p, BC_PARSE_TOKEN_INST(t));
3637 bc_vec_pop(&p->ops);
3638 *nexprs -= t != BC_LEX_OP_BOOL_NOT && t != BC_LEX_NEG;
3641 bc_vec_push(&p->ops, &type);
3642 if (next) s = bc_lex_next(&p->l);
3647 static BcStatus bc_parse_rightParen(BcParse *p, size_t ops_bgn, size_t *nexs)
3651 if (p->ops.len <= ops_bgn)
3652 return bc_error_bad_expression();
3653 top = BC_PARSE_TOP_OP(p);
3655 while (top != BC_LEX_LPAREN) {
3657 bc_parse_push(p, BC_PARSE_TOKEN_INST(top));
3659 bc_vec_pop(&p->ops);
3660 *nexs -= top != BC_LEX_OP_BOOL_NOT && top != BC_LEX_NEG;
3662 if (p->ops.len <= ops_bgn)
3663 return bc_error_bad_expression();
3664 top = BC_PARSE_TOP_OP(p);
3667 bc_vec_pop(&p->ops);
3669 return bc_lex_next(&p->l);
3672 static BcStatus bc_parse_params(BcParse *p, uint8_t flags)
3678 s = bc_lex_next(&p->l);
3681 for (nparams = 0; p->l.t.t != BC_LEX_RPAREN; ++nparams) {
3683 flags = (flags & ~(BC_PARSE_PRINT | BC_PARSE_REL)) | BC_PARSE_ARRAY;
3684 s = bc_parse_expr(p, flags, bc_parse_next_param);
3687 comma = p->l.t.t == BC_LEX_COMMA;
3689 s = bc_lex_next(&p->l);
3694 if (comma) return bc_error_bad_token();
3695 bc_parse_push(p, BC_INST_CALL);
3696 bc_parse_pushIndex(p, nparams);
3698 return BC_STATUS_SUCCESS;
3701 static BcStatus bc_parse_call(BcParse *p, char *name, uint8_t flags)
3704 BcId entry, *entry_ptr;
3709 s = bc_parse_params(p, flags);
3712 if (p->l.t.t != BC_LEX_RPAREN) {
3713 s = bc_error_bad_token();
3717 idx = bc_map_index(&G.prog.fn_map, &entry);
3719 if (idx == BC_VEC_INVALID_IDX) {
3720 name = xstrdup(entry.name);
3721 bc_parse_addFunc(p, name, &idx);
3722 idx = bc_map_index(&G.prog.fn_map, &entry);
3728 entry_ptr = bc_vec_item(&G.prog.fn_map, idx);
3729 bc_parse_pushIndex(p, entry_ptr->idx);
3731 return bc_lex_next(&p->l);
3738 static BcStatus bc_parse_name(BcParse *p, BcInst *type, uint8_t flags)
3743 name = xstrdup(p->l.t.v.v);
3744 s = bc_lex_next(&p->l);
3747 if (p->l.t.t == BC_LEX_LBRACKET) {
3749 s = bc_lex_next(&p->l);
3752 if (p->l.t.t == BC_LEX_RBRACKET) {
3754 if (!(flags & BC_PARSE_ARRAY)) {
3755 s = bc_error_bad_expression();
3759 *type = BC_INST_ARRAY;
3763 *type = BC_INST_ARRAY_ELEM;
3765 flags &= ~(BC_PARSE_PRINT | BC_PARSE_REL);
3766 s = bc_parse_expr(p, flags, bc_parse_next_elem);
3770 s = bc_lex_next(&p->l);
3772 bc_parse_push(p, *type);
3773 bc_parse_pushName(p, name);
3775 else if (p->l.t.t == BC_LEX_LPAREN) {
3777 if (flags & BC_PARSE_NOCALL) {
3778 s = bc_error_bad_token();
3782 *type = BC_INST_CALL;
3783 s = bc_parse_call(p, name, flags);
3786 *type = BC_INST_VAR;
3787 bc_parse_push(p, BC_INST_VAR);
3788 bc_parse_pushName(p, name);
3798 static BcStatus bc_parse_read(BcParse *p)
3802 s = bc_lex_next(&p->l);
3804 if (p->l.t.t != BC_LEX_LPAREN) return bc_error_bad_token();
3806 s = bc_lex_next(&p->l);
3808 if (p->l.t.t != BC_LEX_RPAREN) return bc_error_bad_token();
3810 bc_parse_push(p, BC_INST_READ);
3812 return bc_lex_next(&p->l);
3815 static BcStatus bc_parse_builtin(BcParse *p, BcLexType type, uint8_t flags,
3820 s = bc_lex_next(&p->l);
3822 if (p->l.t.t != BC_LEX_LPAREN) return bc_error_bad_token();
3824 flags = (flags & ~(BC_PARSE_PRINT | BC_PARSE_REL)) | BC_PARSE_ARRAY;
3826 s = bc_lex_next(&p->l);
3829 s = bc_parse_expr(p, flags, bc_parse_next_rel);
3832 if (p->l.t.t != BC_LEX_RPAREN) return bc_error_bad_token();
3834 *prev = (type == BC_LEX_KEY_LENGTH) ? BC_INST_LENGTH : BC_INST_SQRT;
3835 bc_parse_push(p, *prev);
3837 return bc_lex_next(&p->l);
3840 static BcStatus bc_parse_scale(BcParse *p, BcInst *type, uint8_t flags)
3844 s = bc_lex_next(&p->l);
3847 if (p->l.t.t != BC_LEX_LPAREN) {
3848 *type = BC_INST_SCALE;
3849 bc_parse_push(p, BC_INST_SCALE);
3850 return BC_STATUS_SUCCESS;
3853 *type = BC_INST_SCALE_FUNC;
3854 flags &= ~(BC_PARSE_PRINT | BC_PARSE_REL);
3856 s = bc_lex_next(&p->l);
3859 s = bc_parse_expr(p, flags, bc_parse_next_rel);
3861 if (p->l.t.t != BC_LEX_RPAREN) return bc_error_bad_token();
3862 bc_parse_push(p, BC_INST_SCALE_FUNC);
3864 return bc_lex_next(&p->l);
3867 static BcStatus bc_parse_incdec(BcParse *p, BcInst *prev, bool *paren_expr,
3868 size_t *nexprs, uint8_t flags)
3873 BcInst etype = *prev;
3875 if (etype == BC_INST_VAR || etype == BC_INST_ARRAY_ELEM ||
3876 etype == BC_INST_SCALE || etype == BC_INST_LAST ||
3877 etype == BC_INST_IBASE || etype == BC_INST_OBASE)
3879 *prev = inst = BC_INST_INC_POST + (p->l.t.t != BC_LEX_OP_INC);
3880 bc_parse_push(p, inst);
3881 s = bc_lex_next(&p->l);
3885 *prev = inst = BC_INST_INC_PRE + (p->l.t.t != BC_LEX_OP_INC);
3888 s = bc_lex_next(&p->l);
3892 // Because we parse the next part of the expression
3893 // right here, we need to increment this.
3894 *nexprs = *nexprs + 1;
3900 s = bc_parse_name(p, prev, flags | BC_PARSE_NOCALL);
3904 case BC_LEX_KEY_IBASE:
3905 case BC_LEX_KEY_LAST:
3906 case BC_LEX_KEY_OBASE:
3908 bc_parse_push(p, type - BC_LEX_KEY_IBASE + BC_INST_IBASE);
3909 s = bc_lex_next(&p->l);
3913 case BC_LEX_KEY_SCALE:
3915 s = bc_lex_next(&p->l);
3917 if (p->l.t.t == BC_LEX_LPAREN)
3918 s = bc_error_bad_token();
3920 bc_parse_push(p, BC_INST_SCALE);
3926 s = bc_error_bad_token();
3931 if (!s) bc_parse_push(p, inst);
3937 static BcStatus bc_parse_minus(BcParse *p, BcInst *prev, size_t ops_bgn,
3938 bool rparen, size_t *nexprs)
3942 BcInst etype = *prev;
3944 s = bc_lex_next(&p->l);
3947 type = rparen || etype == BC_INST_INC_POST || etype == BC_INST_DEC_POST ||
3948 (etype >= BC_INST_NUM && etype <= BC_INST_SQRT) ?
3951 *prev = BC_PARSE_TOKEN_INST(type);
3953 // We can just push onto the op stack because this is the largest
3954 // precedence operator that gets pushed. Inc/dec does not.
3955 if (type != BC_LEX_OP_MINUS)
3956 bc_vec_push(&p->ops, &type);
3958 s = bc_parse_operator(p, type, ops_bgn, nexprs, false);
3963 static BcStatus bc_parse_string(BcParse *p, char inst)
3965 char *str = xstrdup(p->l.t.v.v);
3967 bc_parse_push(p, BC_INST_STR);
3968 bc_parse_pushIndex(p, G.prog.strs.len);
3969 bc_vec_push(&G.prog.strs, &str);
3970 bc_parse_push(p, inst);
3972 return bc_lex_next(&p->l);
3975 static BcStatus bc_parse_print(BcParse *p)
3981 s = bc_lex_next(&p->l);
3986 if (type == BC_LEX_SCOLON || type == BC_LEX_NLINE)
3987 return bc_error("bad print statement");
3989 while (!s && type != BC_LEX_SCOLON && type != BC_LEX_NLINE) {
3991 if (type == BC_LEX_STR)
3992 s = bc_parse_string(p, BC_INST_PRINT_POP);
3994 s = bc_parse_expr(p, 0, bc_parse_next_print);
3996 bc_parse_push(p, BC_INST_PRINT_POP);
4001 comma = p->l.t.t == BC_LEX_COMMA;
4002 if (comma) s = bc_lex_next(&p->l);
4007 if (comma) return bc_error_bad_token();
4009 return bc_lex_next(&p->l);
4012 static BcStatus bc_parse_return(BcParse *p)
4018 if (!BC_PARSE_FUNC(p)) return bc_error_bad_token();
4020 s = bc_lex_next(&p->l);
4024 paren = t == BC_LEX_LPAREN;
4026 if (t == BC_LEX_NLINE || t == BC_LEX_SCOLON)
4027 bc_parse_push(p, BC_INST_RET0);
4030 s = bc_parse_expr(p, 0, bc_parse_next_expr);
4031 if (s == BC_STATUS_PARSE_EMPTY_EXP) {
4032 bc_parse_push(p, BC_INST_RET0);
4033 s = bc_lex_next(&p->l);
4037 if (!paren || p->l.t.last != BC_LEX_RPAREN) {
4038 s = bc_posix_error("POSIX requires parentheses around return expressions");
4042 bc_parse_push(p, BC_INST_RET);
4048 static BcStatus bc_parse_endBody(BcParse *p, bool brace)
4050 BcStatus s = BC_STATUS_SUCCESS;
4052 if (p->flags.len <= 1 || (brace && p->nbraces == 0))
4053 return bc_error_bad_token();
4057 if (p->l.t.t == BC_LEX_RBRACE) {
4058 if (!p->nbraces) return bc_error_bad_token();
4060 s = bc_lex_next(&p->l);
4064 return bc_error_bad_token();
4067 if (BC_PARSE_IF(p)) {
4071 while (p->l.t.t == BC_LEX_NLINE) {
4072 s = bc_lex_next(&p->l);
4076 bc_vec_pop(&p->flags);
4078 flag_ptr = BC_PARSE_TOP_FLAG_PTR(p);
4079 *flag_ptr = (*flag_ptr | BC_PARSE_FLAG_IF_END);
4081 if (p->l.t.t == BC_LEX_KEY_ELSE) s = bc_parse_else(p);
4083 else if (BC_PARSE_ELSE(p)) {
4088 bc_vec_pop(&p->flags);
4090 ip = bc_vec_top(&p->exits);
4091 label = bc_vec_item(&p->func->labels, ip->idx);
4092 *label = p->func->code.len;
4094 bc_vec_pop(&p->exits);
4096 else if (BC_PARSE_FUNC_INNER(p)) {
4097 bc_parse_push(p, BC_INST_RET0);
4098 bc_parse_updateFunc(p, BC_PROG_MAIN);
4099 bc_vec_pop(&p->flags);
4103 BcInstPtr *ip = bc_vec_top(&p->exits);
4104 size_t *label = bc_vec_top(&p->conds);
4106 bc_parse_push(p, BC_INST_JUMP);
4107 bc_parse_pushIndex(p, *label);
4109 label = bc_vec_item(&p->func->labels, ip->idx);
4110 *label = p->func->code.len;
4112 bc_vec_pop(&p->flags);
4113 bc_vec_pop(&p->exits);
4114 bc_vec_pop(&p->conds);
4120 static void bc_parse_startBody(BcParse *p, uint8_t flags)
4122 uint8_t *flag_ptr = BC_PARSE_TOP_FLAG_PTR(p);
4123 flags |= (*flag_ptr & (BC_PARSE_FLAG_FUNC | BC_PARSE_FLAG_LOOP));
4124 flags |= BC_PARSE_FLAG_BODY;
4125 bc_vec_push(&p->flags, &flags);
4128 static void bc_parse_noElse(BcParse *p)
4132 uint8_t *flag_ptr = BC_PARSE_TOP_FLAG_PTR(p);
4134 *flag_ptr = (*flag_ptr & ~(BC_PARSE_FLAG_IF_END));
4136 ip = bc_vec_top(&p->exits);
4137 label = bc_vec_item(&p->func->labels, ip->idx);
4138 *label = p->func->code.len;
4140 bc_vec_pop(&p->exits);
4143 static BcStatus bc_parse_if(BcParse *p)
4148 s = bc_lex_next(&p->l);
4150 if (p->l.t.t != BC_LEX_LPAREN) return bc_error_bad_token();
4152 s = bc_lex_next(&p->l);
4154 s = bc_parse_expr(p, BC_PARSE_REL, bc_parse_next_rel);
4156 if (p->l.t.t != BC_LEX_RPAREN) return bc_error_bad_token();
4158 s = bc_lex_next(&p->l);
4160 bc_parse_push(p, BC_INST_JUMP_ZERO);
4162 ip.idx = p->func->labels.len;
4163 ip.func = ip.len = 0;
4165 bc_parse_pushIndex(p, ip.idx);
4166 bc_vec_push(&p->exits, &ip);
4167 bc_vec_push(&p->func->labels, &ip.idx);
4168 bc_parse_startBody(p, BC_PARSE_FLAG_IF);
4170 return BC_STATUS_SUCCESS;
4173 static BcStatus bc_parse_else(BcParse *p)
4177 if (!BC_PARSE_IF_END(p)) return bc_error_bad_token();
4179 ip.idx = p->func->labels.len;
4180 ip.func = ip.len = 0;
4182 bc_parse_push(p, BC_INST_JUMP);
4183 bc_parse_pushIndex(p, ip.idx);
4187 bc_vec_push(&p->exits, &ip);
4188 bc_vec_push(&p->func->labels, &ip.idx);
4189 bc_parse_startBody(p, BC_PARSE_FLAG_ELSE);
4191 return bc_lex_next(&p->l);
4194 static BcStatus bc_parse_while(BcParse *p)
4199 s = bc_lex_next(&p->l);
4201 if (p->l.t.t != BC_LEX_LPAREN) return bc_error_bad_token();
4202 s = bc_lex_next(&p->l);
4205 ip.idx = p->func->labels.len;
4207 bc_vec_push(&p->func->labels, &p->func->code.len);
4208 bc_vec_push(&p->conds, &ip.idx);
4210 ip.idx = p->func->labels.len;
4214 bc_vec_push(&p->exits, &ip);
4215 bc_vec_push(&p->func->labels, &ip.idx);
4217 s = bc_parse_expr(p, BC_PARSE_REL, bc_parse_next_rel);
4219 if (p->l.t.t != BC_LEX_RPAREN) return bc_error_bad_token();
4220 s = bc_lex_next(&p->l);
4223 bc_parse_push(p, BC_INST_JUMP_ZERO);
4224 bc_parse_pushIndex(p, ip.idx);
4225 bc_parse_startBody(p, BC_PARSE_FLAG_LOOP | BC_PARSE_FLAG_LOOP_INNER);
4227 return BC_STATUS_SUCCESS;
4230 static BcStatus bc_parse_for(BcParse *p)
4234 size_t cond_idx, exit_idx, body_idx, update_idx;
4236 s = bc_lex_next(&p->l);
4238 if (p->l.t.t != BC_LEX_LPAREN) return bc_error_bad_token();
4239 s = bc_lex_next(&p->l);
4242 if (p->l.t.t != BC_LEX_SCOLON)
4243 s = bc_parse_expr(p, 0, bc_parse_next_for);
4245 s = bc_POSIX_does_not_allow_empty_X_expression_in_for("init");
4248 if (p->l.t.t != BC_LEX_SCOLON) return bc_error_bad_token();
4249 s = bc_lex_next(&p->l);
4252 cond_idx = p->func->labels.len;
4253 update_idx = cond_idx + 1;
4254 body_idx = update_idx + 1;
4255 exit_idx = body_idx + 1;
4257 bc_vec_push(&p->func->labels, &p->func->code.len);
4259 if (p->l.t.t != BC_LEX_SCOLON)
4260 s = bc_parse_expr(p, BC_PARSE_REL, bc_parse_next_for);
4262 s = bc_POSIX_does_not_allow_empty_X_expression_in_for("condition");
4265 if (p->l.t.t != BC_LEX_SCOLON) return bc_error_bad_token();
4267 s = bc_lex_next(&p->l);
4270 bc_parse_push(p, BC_INST_JUMP_ZERO);
4271 bc_parse_pushIndex(p, exit_idx);
4272 bc_parse_push(p, BC_INST_JUMP);
4273 bc_parse_pushIndex(p, body_idx);
4275 ip.idx = p->func->labels.len;
4277 bc_vec_push(&p->conds, &update_idx);
4278 bc_vec_push(&p->func->labels, &p->func->code.len);
4280 if (p->l.t.t != BC_LEX_RPAREN)
4281 s = bc_parse_expr(p, 0, bc_parse_next_rel);
4283 s = bc_POSIX_does_not_allow_empty_X_expression_in_for("update");
4287 if (p->l.t.t != BC_LEX_RPAREN) return bc_error_bad_token();
4288 bc_parse_push(p, BC_INST_JUMP);
4289 bc_parse_pushIndex(p, cond_idx);
4290 bc_vec_push(&p->func->labels, &p->func->code.len);
4296 bc_vec_push(&p->exits, &ip);
4297 bc_vec_push(&p->func->labels, &ip.idx);
4299 bc_parse_startBody(p, BC_PARSE_FLAG_LOOP | BC_PARSE_FLAG_LOOP_INNER);
4301 return BC_STATUS_SUCCESS;
4304 static BcStatus bc_parse_loopExit(BcParse *p, BcLexType type)
4310 if (!BC_PARSE_LOOP(p)) return bc_error_bad_token();
4312 if (type == BC_LEX_KEY_BREAK) {
4314 if (p->exits.len == 0) return bc_error_bad_token();
4316 i = p->exits.len - 1;
4317 ip = bc_vec_item(&p->exits, i);
4319 while (!ip->func && i < p->exits.len) ip = bc_vec_item(&p->exits, i--);
4320 if (i >= p->exits.len && !ip->func) return bc_error_bad_token();
4325 i = *((size_t *) bc_vec_top(&p->conds));
4327 bc_parse_push(p, BC_INST_JUMP);
4328 bc_parse_pushIndex(p, i);
4330 s = bc_lex_next(&p->l);
4333 if (p->l.t.t != BC_LEX_SCOLON && p->l.t.t != BC_LEX_NLINE)
4334 return bc_error_bad_token();
4336 return bc_lex_next(&p->l);
4339 static BcStatus bc_parse_func(BcParse *p)
4342 bool var, comma = false;
4346 s = bc_lex_next(&p->l);
4348 if (p->l.t.t != BC_LEX_NAME)
4349 return bc_error("bad function definition");
4351 name = xstrdup(p->l.t.v.v);
4352 bc_parse_addFunc(p, name, &p->fidx);
4354 s = bc_lex_next(&p->l);
4356 if (p->l.t.t != BC_LEX_LPAREN)
4357 return bc_error("bad function definition");
4358 s = bc_lex_next(&p->l);
4361 while (p->l.t.t != BC_LEX_RPAREN) {
4363 if (p->l.t.t != BC_LEX_NAME)
4364 return bc_error("bad function definition");
4368 name = xstrdup(p->l.t.v.v);
4369 s = bc_lex_next(&p->l);
4372 var = p->l.t.t != BC_LEX_LBRACKET;
4376 s = bc_lex_next(&p->l);
4379 if (p->l.t.t != BC_LEX_RBRACKET) {
4380 s = bc_error("bad function definition");
4384 s = bc_lex_next(&p->l);
4388 comma = p->l.t.t == BC_LEX_COMMA;
4390 s = bc_lex_next(&p->l);
4394 s = bc_func_insert(p->func, name, var);
4398 if (comma) return bc_error("bad function definition");
4400 flags = BC_PARSE_FLAG_FUNC | BC_PARSE_FLAG_FUNC_INNER | BC_PARSE_FLAG_BODY;
4401 bc_parse_startBody(p, flags);
4403 s = bc_lex_next(&p->l);
4406 if (p->l.t.t != BC_LEX_LBRACE)
4407 s = bc_posix_error("POSIX requires the left brace be on the same line as the function header");
4416 static BcStatus bc_parse_auto(BcParse *p)
4419 bool comma, var, one;
4422 if (!p->auto_part) return bc_error_bad_token();
4423 s = bc_lex_next(&p->l);
4426 p->auto_part = comma = false;
4427 one = p->l.t.t == BC_LEX_NAME;
4429 while (p->l.t.t == BC_LEX_NAME) {
4431 name = xstrdup(p->l.t.v.v);
4432 s = bc_lex_next(&p->l);
4435 var = p->l.t.t != BC_LEX_LBRACKET;
4438 s = bc_lex_next(&p->l);
4441 if (p->l.t.t != BC_LEX_RBRACKET) {
4442 s = bc_error("bad function definition");
4446 s = bc_lex_next(&p->l);
4450 comma = p->l.t.t == BC_LEX_COMMA;
4452 s = bc_lex_next(&p->l);
4456 s = bc_func_insert(p->func, name, var);
4460 if (comma) return bc_error("bad function definition");
4461 if (!one) return bc_error("no auto variable found");
4463 if (p->l.t.t != BC_LEX_NLINE && p->l.t.t != BC_LEX_SCOLON)
4464 return bc_error_bad_token();
4466 return bc_lex_next(&p->l);
4473 static BcStatus bc_parse_body(BcParse *p, bool brace)
4475 BcStatus s = BC_STATUS_SUCCESS;
4476 uint8_t *flag_ptr = bc_vec_top(&p->flags);
4478 *flag_ptr &= ~(BC_PARSE_FLAG_BODY);
4480 if (*flag_ptr & BC_PARSE_FLAG_FUNC_INNER) {
4482 if (!brace) return bc_error_bad_token();
4483 p->auto_part = p->l.t.t != BC_LEX_KEY_AUTO;
4485 if (!p->auto_part) {
4486 s = bc_parse_auto(p);
4490 if (p->l.t.t == BC_LEX_NLINE) s = bc_lex_next(&p->l);
4493 s = bc_parse_stmt(p);
4494 if (!s && !brace) s = bc_parse_endBody(p, false);
4500 static BcStatus bc_parse_stmt(BcParse *p)
4502 BcStatus s = BC_STATUS_SUCCESS;
4508 return bc_lex_next(&p->l);
4511 case BC_LEX_KEY_ELSE:
4513 p->auto_part = false;
4519 if (!BC_PARSE_BODY(p)) return bc_error_bad_token();
4522 s = bc_lex_next(&p->l);
4525 return bc_parse_body(p, true);
4528 case BC_LEX_KEY_AUTO:
4530 return bc_parse_auto(p);
4535 p->auto_part = false;
4537 if (BC_PARSE_IF_END(p)) {
4539 return BC_STATUS_SUCCESS;
4541 else if (BC_PARSE_BODY(p))
4542 return bc_parse_body(p, false);
4552 case BC_LEX_OP_MINUS:
4553 case BC_LEX_OP_BOOL_NOT:
4557 case BC_LEX_KEY_IBASE:
4558 case BC_LEX_KEY_LAST:
4559 case BC_LEX_KEY_LENGTH:
4560 case BC_LEX_KEY_OBASE:
4561 case BC_LEX_KEY_READ:
4562 case BC_LEX_KEY_SCALE:
4563 case BC_LEX_KEY_SQRT:
4565 s = bc_parse_expr(p, BC_PARSE_PRINT, bc_parse_next_expr);
4569 case BC_LEX_KEY_ELSE:
4571 s = bc_parse_else(p);
4577 while (!s && p->l.t.t == BC_LEX_SCOLON) s = bc_lex_next(&p->l);
4583 s = bc_parse_endBody(p, true);
4589 s = bc_parse_string(p, BC_INST_PRINT_STR);
4593 case BC_LEX_KEY_BREAK:
4594 case BC_LEX_KEY_CONTINUE:
4596 s = bc_parse_loopExit(p, p->l.t.t);
4600 case BC_LEX_KEY_FOR:
4602 s = bc_parse_for(p);
4606 case BC_LEX_KEY_HALT:
4608 bc_parse_push(p, BC_INST_HALT);
4609 s = bc_lex_next(&p->l);
4619 case BC_LEX_KEY_LIMITS:
4621 // "limits" is a compile-time command,
4622 // the output is produced at _parse time_.
4623 s = bc_lex_next(&p->l);
4625 printf("BC_BASE_MAX = %u\n", BC_MAX_OBASE);
4626 printf("BC_DIM_MAX = %u\n", BC_MAX_DIM);
4627 printf("BC_SCALE_MAX = %u\n", BC_MAX_SCALE);
4628 printf("BC_STRING_MAX = %u\n", BC_MAX_STRING);
4629 printf("BC_NAME_MAX = %u\n", BC_MAX_NAME);
4630 printf("BC_NUM_MAX = %u\n", BC_MAX_NUM);
4631 printf("MAX Exponent = %lu\n", BC_MAX_EXP);
4632 printf("Number of vars = %lu\n", BC_MAX_VARS);
4636 case BC_LEX_KEY_PRINT:
4638 s = bc_parse_print(p);
4642 case BC_LEX_KEY_QUIT:
4644 // "quit" is a compile-time command. For example,
4645 // "if (0 == 1) quit" terminates when parsing the statement,
4646 // not when it is executed
4650 case BC_LEX_KEY_RETURN:
4652 s = bc_parse_return(p);
4656 case BC_LEX_KEY_WHILE:
4658 s = bc_parse_while(p);
4664 s = bc_error_bad_token();
4672 static BcStatus bc_parse_parse(BcParse *p)
4676 if (p->l.t.t == BC_LEX_EOF)
4677 s = p->flags.len > 0 ? bc_error("block end could not be found") : bc_error("end of file");
4678 else if (p->l.t.t == BC_LEX_KEY_DEFINE) {
4679 if (!BC_PARSE_CAN_EXEC(p)) return bc_error_bad_token();
4680 s = bc_parse_func(p);
4683 s = bc_parse_stmt(p);
4685 if (s || G_interrupt) {
4687 s = BC_STATUS_FAILURE;
4693 static BcStatus bc_parse_expr(BcParse *p, uint8_t flags, BcParseNext next)
4695 BcStatus s = BC_STATUS_SUCCESS;
4696 BcInst prev = BC_INST_PRINT;
4697 BcLexType top, t = p->l.t.t;
4698 size_t nexprs = 0, ops_bgn = p->ops.len;
4699 uint32_t i, nparens, nrelops;
4700 bool paren_first, paren_expr, rprn, done, get_token, assign, bin_last;
4702 paren_first = p->l.t.t == BC_LEX_LPAREN;
4703 nparens = nrelops = 0;
4704 paren_expr = rprn = done = get_token = assign = false;
4707 for (; !G_interrupt && !s && !done && bc_parse_exprs(t); t = p->l.t.t) {
4713 s = bc_parse_incdec(p, &prev, &paren_expr, &nexprs, flags);
4714 rprn = get_token = bin_last = false;
4718 case BC_LEX_OP_MINUS:
4720 s = bc_parse_minus(p, &prev, ops_bgn, rprn, &nexprs);
4721 rprn = get_token = false;
4722 bin_last = prev == BC_INST_MINUS;
4726 case BC_LEX_OP_ASSIGN_POWER:
4727 case BC_LEX_OP_ASSIGN_MULTIPLY:
4728 case BC_LEX_OP_ASSIGN_DIVIDE:
4729 case BC_LEX_OP_ASSIGN_MODULUS:
4730 case BC_LEX_OP_ASSIGN_PLUS:
4731 case BC_LEX_OP_ASSIGN_MINUS:
4732 case BC_LEX_OP_ASSIGN:
4734 if (prev != BC_INST_VAR && prev != BC_INST_ARRAY_ELEM &&
4735 prev != BC_INST_SCALE && prev != BC_INST_IBASE &&
4736 prev != BC_INST_OBASE && prev != BC_INST_LAST)
4738 s = bc_error("bad assignment:"
4739 " left side must be scale,"
4740 " ibase, obase, last, var,"
4747 case BC_LEX_OP_POWER:
4748 case BC_LEX_OP_MULTIPLY:
4749 case BC_LEX_OP_DIVIDE:
4750 case BC_LEX_OP_MODULUS:
4751 case BC_LEX_OP_PLUS:
4752 case BC_LEX_OP_REL_EQ:
4753 case BC_LEX_OP_REL_LE:
4754 case BC_LEX_OP_REL_GE:
4755 case BC_LEX_OP_REL_NE:
4756 case BC_LEX_OP_REL_LT:
4757 case BC_LEX_OP_REL_GT:
4758 case BC_LEX_OP_BOOL_NOT:
4759 case BC_LEX_OP_BOOL_OR:
4760 case BC_LEX_OP_BOOL_AND:
4762 if (((t == BC_LEX_OP_BOOL_NOT) != bin_last)
4763 || (t != BC_LEX_OP_BOOL_NOT && prev == BC_INST_BOOL_NOT)
4765 return bc_error_bad_expression();
4768 nrelops += t >= BC_LEX_OP_REL_EQ && t <= BC_LEX_OP_REL_GT;
4769 prev = BC_PARSE_TOKEN_INST(t);
4770 s = bc_parse_operator(p, t, ops_bgn, &nexprs, true);
4771 rprn = get_token = false;
4772 bin_last = t != BC_LEX_OP_BOOL_NOT;
4779 if (BC_PARSE_LEAF(prev, rprn))
4780 return bc_error_bad_expression();
4782 paren_expr = rprn = bin_last = false;
4784 bc_vec_push(&p->ops, &t);
4791 if (bin_last || prev == BC_INST_BOOL_NOT)
4792 return bc_error_bad_expression();
4795 s = BC_STATUS_SUCCESS;
4800 else if (!paren_expr)
4801 return BC_STATUS_PARSE_EMPTY_EXP;
4804 paren_expr = rprn = true;
4805 get_token = bin_last = false;
4807 s = bc_parse_rightParen(p, ops_bgn, &nexprs);
4814 if (BC_PARSE_LEAF(prev, rprn))
4815 return bc_error_bad_expression();
4817 rprn = get_token = bin_last = false;
4818 s = bc_parse_name(p, &prev, flags & ~BC_PARSE_NOCALL);
4826 if (BC_PARSE_LEAF(prev, rprn))
4827 return bc_error_bad_expression();
4828 bc_parse_number(p, &prev, &nexprs);
4829 paren_expr = get_token = true;
4830 rprn = bin_last = false;
4835 case BC_LEX_KEY_IBASE:
4836 case BC_LEX_KEY_LAST:
4837 case BC_LEX_KEY_OBASE:
4839 if (BC_PARSE_LEAF(prev, rprn))
4840 return bc_error_bad_expression();
4841 prev = (char) (t - BC_LEX_KEY_IBASE + BC_INST_IBASE);
4842 bc_parse_push(p, (char) prev);
4844 paren_expr = get_token = true;
4845 rprn = bin_last = false;
4851 case BC_LEX_KEY_LENGTH:
4852 case BC_LEX_KEY_SQRT:
4854 if (BC_PARSE_LEAF(prev, rprn))
4855 return bc_error_bad_expression();
4856 s = bc_parse_builtin(p, t, flags, &prev);
4858 rprn = get_token = bin_last = false;
4864 case BC_LEX_KEY_READ:
4866 if (BC_PARSE_LEAF(prev, rprn))
4867 return bc_error_bad_expression();
4868 else if (flags & BC_PARSE_NOREAD)
4869 s = bc_error_nested_read_call();
4871 s = bc_parse_read(p);
4874 rprn = get_token = bin_last = false;
4876 prev = BC_INST_READ;
4881 case BC_LEX_KEY_SCALE:
4883 if (BC_PARSE_LEAF(prev, rprn))
4884 return bc_error_bad_expression();
4885 s = bc_parse_scale(p, &prev, flags);
4887 rprn = get_token = bin_last = false;
4889 prev = BC_INST_SCALE;
4896 s = bc_error_bad_token();
4901 if (!s && get_token) s = bc_lex_next(&p->l);
4905 if (G_interrupt) return BC_STATUS_FAILURE; // ^C: stop parsing
4907 while (p->ops.len > ops_bgn) {
4909 top = BC_PARSE_TOP_OP(p);
4910 assign = top >= BC_LEX_OP_ASSIGN_POWER && top <= BC_LEX_OP_ASSIGN;
4912 if (top == BC_LEX_LPAREN || top == BC_LEX_RPAREN)
4913 return bc_error_bad_expression();
4915 bc_parse_push(p, BC_PARSE_TOKEN_INST(top));
4917 nexprs -= top != BC_LEX_OP_BOOL_NOT && top != BC_LEX_NEG;
4918 bc_vec_pop(&p->ops);
4921 if (prev == BC_INST_BOOL_NOT || nexprs != 1)
4922 return bc_error_bad_expression();
4924 for (i = 0; i < next.len; ++i)
4925 if (t == next.tokens[i])
4927 return bc_error_bad_expression();
4930 if (!(flags & BC_PARSE_REL) && nrelops) {
4931 s = bc_POSIX_does_not_allow("comparison operators outside if or loops");
4934 else if ((flags & BC_PARSE_REL) && nrelops > 1) {
4935 s = bc_posix_error("POSIX requires exactly one comparison operator per condition");
4939 if (flags & BC_PARSE_PRINT) {
4940 if (paren_first || !assign) bc_parse_push(p, BC_INST_PRINT);
4941 bc_parse_push(p, BC_INST_POP);
4947 static void bc_parse_init(BcParse *p, size_t func)
4949 bc_parse_create(p, func, bc_parse_parse, bc_lex_token);
4952 static BcStatus bc_parse_expression(BcParse *p, uint8_t flags)
4954 return bc_parse_expr(p, flags, bc_parse_next_read);
4961 #define DC_PARSE_BUF_LEN ((int) (sizeof(uint32_t) * CHAR_BIT))
4963 static BcStatus dc_parse_register(BcParse *p)
4968 s = bc_lex_next(&p->l);
4970 if (p->l.t.t != BC_LEX_NAME) return bc_error_bad_token();
4972 name = xstrdup(p->l.t.v.v);
4973 bc_parse_pushName(p, name);
4978 static BcStatus dc_parse_string(BcParse *p)
4980 char *str, *name, b[DC_PARSE_BUF_LEN + 1];
4981 size_t idx, len = G.prog.strs.len;
4983 sprintf(b, "%0*zu", DC_PARSE_BUF_LEN, len);
4986 str = xstrdup(p->l.t.v.v);
4987 bc_parse_push(p, BC_INST_STR);
4988 bc_parse_pushIndex(p, len);
4989 bc_vec_push(&G.prog.strs, &str);
4990 bc_parse_addFunc(p, name, &idx);
4992 return bc_lex_next(&p->l);
4995 static BcStatus dc_parse_mem(BcParse *p, uint8_t inst, bool name, bool store)
4999 bc_parse_push(p, inst);
5001 s = dc_parse_register(p);
5006 bc_parse_push(p, BC_INST_SWAP);
5007 bc_parse_push(p, BC_INST_ASSIGN);
5008 bc_parse_push(p, BC_INST_POP);
5011 return bc_lex_next(&p->l);
5014 static BcStatus dc_parse_cond(BcParse *p, uint8_t inst)
5018 bc_parse_push(p, inst);
5019 bc_parse_push(p, BC_INST_EXEC_COND);
5021 s = dc_parse_register(p);
5024 s = bc_lex_next(&p->l);
5027 if (p->l.t.t == BC_LEX_ELSE) {
5028 s = dc_parse_register(p);
5030 s = bc_lex_next(&p->l);
5033 bc_parse_push(p, BC_PARSE_STREND);
5038 static BcStatus dc_parse_token(BcParse *p, BcLexType t, uint8_t flags)
5040 BcStatus s = BC_STATUS_SUCCESS;
5043 bool assign, get_token = false;
5047 case BC_LEX_OP_REL_EQ:
5048 case BC_LEX_OP_REL_LE:
5049 case BC_LEX_OP_REL_GE:
5050 case BC_LEX_OP_REL_NE:
5051 case BC_LEX_OP_REL_LT:
5052 case BC_LEX_OP_REL_GT:
5054 s = dc_parse_cond(p, t - BC_LEX_OP_REL_EQ + BC_INST_REL_EQ);
5061 s = dc_parse_mem(p, BC_INST_ARRAY_ELEM, true, t == BC_LEX_COLON);
5067 s = dc_parse_string(p);
5074 if (t == BC_LEX_NEG) {
5075 s = bc_lex_next(&p->l);
5077 if (p->l.t.t != BC_LEX_NUMBER)
5078 return bc_error_bad_token();
5081 bc_parse_number(p, &prev, &p->nbraces);
5083 if (t == BC_LEX_NEG) bc_parse_push(p, BC_INST_NEG);
5089 case BC_LEX_KEY_READ:
5091 if (flags & BC_PARSE_NOREAD)
5092 s = bc_error_nested_read_call();
5094 bc_parse_push(p, BC_INST_READ);
5099 case BC_LEX_OP_ASSIGN:
5100 case BC_LEX_STORE_PUSH:
5102 assign = t == BC_LEX_OP_ASSIGN;
5103 inst = assign ? BC_INST_VAR : BC_INST_PUSH_TO_VAR;
5104 s = dc_parse_mem(p, inst, true, assign);
5109 case BC_LEX_LOAD_POP:
5111 inst = t == BC_LEX_LOAD_POP ? BC_INST_PUSH_VAR : BC_INST_LOAD;
5112 s = dc_parse_mem(p, inst, true, false);
5116 case BC_LEX_STORE_IBASE:
5117 case BC_LEX_STORE_SCALE:
5118 case BC_LEX_STORE_OBASE:
5120 inst = t - BC_LEX_STORE_IBASE + BC_INST_IBASE;
5121 s = dc_parse_mem(p, inst, false, true);
5127 s = bc_error_bad_token();
5133 if (!s && get_token) s = bc_lex_next(&p->l);
5138 static BcStatus dc_parse_expr(BcParse *p, uint8_t flags)
5140 BcStatus s = BC_STATUS_SUCCESS;
5144 if (flags & BC_PARSE_NOCALL) p->nbraces = G.prog.results.len;
5146 for (t = p->l.t.t; !s && t != BC_LEX_EOF; t = p->l.t.t) {
5148 inst = dc_parse_insts[t];
5150 if (inst != BC_INST_INVALID) {
5151 bc_parse_push(p, inst);
5152 s = bc_lex_next(&p->l);
5155 s = dc_parse_token(p, t, flags);
5158 if (!s && p->l.t.t == BC_LEX_EOF && (flags & BC_PARSE_NOCALL))
5159 bc_parse_push(p, BC_INST_POP_EXEC);
5164 static BcStatus dc_parse_parse(BcParse *p)
5168 if (p->l.t.t == BC_LEX_EOF)
5169 s = bc_error("end of file");
5171 s = dc_parse_expr(p, 0);
5173 if (s || G_interrupt) {
5175 s = BC_STATUS_FAILURE;
5181 static void dc_parse_init(BcParse *p, size_t func)
5183 bc_parse_create(p, func, dc_parse_parse, dc_lex_token);
5188 static void common_parse_init(BcParse *p, size_t func)
5191 bc_parse_init(p, func);
5193 dc_parse_init(p, func);
5197 static BcStatus common_parse_expr(BcParse *p, uint8_t flags)
5200 return bc_parse_expression(p, flags);
5202 return dc_parse_expr(p, flags);
5206 static BcVec* bc_program_search(char *id, bool var)
5214 v = var ? &G.prog.vars : &G.prog.arrs;
5215 map = var ? &G.prog.var_map : &G.prog.arr_map;
5219 new = bc_map_insert(map, &e, &i); // 1 if insertion was successful
5222 bc_array_init(&data.v, var);
5223 bc_vec_push(v, &data.v);
5226 ptr = bc_vec_item(map, i);
5227 if (new) ptr->name = xstrdup(e.name);
5228 return bc_vec_item(v, ptr->idx);
5231 static BcStatus bc_program_num(BcResult *r, BcNum **num, bool hex)
5233 BcStatus s = BC_STATUS_SUCCESS;
5238 case BC_RESULT_TEMP:
5239 case BC_RESULT_IBASE:
5240 case BC_RESULT_SCALE:
5241 case BC_RESULT_OBASE:
5247 case BC_RESULT_CONSTANT:
5249 char **str = bc_vec_item(&G.prog.consts, r->d.id.idx);
5250 size_t base_t, len = strlen(*str);
5253 bc_num_init(&r->d.n, len);
5255 hex = hex && len == 1;
5256 base = hex ? &G.prog.hexb : &G.prog.ib;
5257 base_t = hex ? BC_NUM_MAX_IBASE : G.prog.ib_t;
5258 s = bc_num_parse(&r->d.n, *str, base, base_t);
5261 bc_num_free(&r->d.n);
5266 r->t = BC_RESULT_TEMP;
5272 case BC_RESULT_ARRAY:
5273 case BC_RESULT_ARRAY_ELEM:
5277 v = bc_program_search(r->d.id.name, r->t == BC_RESULT_VAR);
5279 if (r->t == BC_RESULT_ARRAY_ELEM) {
5281 if (v->len <= r->d.id.idx) bc_array_expand(v, r->d.id.idx + 1);
5282 *num = bc_vec_item(v, r->d.id.idx);
5285 *num = bc_vec_top(v);
5290 case BC_RESULT_LAST:
5292 *num = &G.prog.last;
5306 static BcStatus bc_program_binOpPrep(BcResult **l, BcNum **ln,
5307 BcResult **r, BcNum **rn, bool assign)
5311 BcResultType lt, rt;
5313 if (!BC_PROG_STACK(&G.prog.results, 2))
5314 return bc_error_stack_has_too_few_elements();
5316 *r = bc_vec_item_rev(&G.prog.results, 0);
5317 *l = bc_vec_item_rev(&G.prog.results, 1);
5321 hex = assign && (lt == BC_RESULT_IBASE || lt == BC_RESULT_OBASE);
5323 s = bc_program_num(*l, ln, false);
5325 s = bc_program_num(*r, rn, hex);
5328 // We run this again under these conditions in case any vector has been
5329 // reallocated out from under the BcNums or arrays we had.
5330 if (lt == rt && (lt == BC_RESULT_VAR || lt == BC_RESULT_ARRAY_ELEM)) {
5331 s = bc_program_num(*l, ln, false);
5335 if (!BC_PROG_NUM((*l), (*ln)) && (!assign || (*l)->t != BC_RESULT_VAR))
5336 return bc_error_variable_is_wrong_type();
5337 if (!assign && !BC_PROG_NUM((*r), (*ln)))
5338 return bc_error_variable_is_wrong_type();
5343 static void bc_program_binOpRetire(BcResult *r)
5345 r->t = BC_RESULT_TEMP;
5346 bc_vec_pop(&G.prog.results);
5347 bc_vec_pop(&G.prog.results);
5348 bc_vec_push(&G.prog.results, r);
5351 static BcStatus bc_program_prep(BcResult **r, BcNum **n)
5355 if (!BC_PROG_STACK(&G.prog.results, 1))
5356 return bc_error_stack_has_too_few_elements();
5357 *r = bc_vec_top(&G.prog.results);
5359 s = bc_program_num(*r, n, false);
5362 if (!BC_PROG_NUM((*r), (*n)))
5363 return bc_error_variable_is_wrong_type();
5368 static void bc_program_retire(BcResult *r, BcResultType t)
5371 bc_vec_pop(&G.prog.results);
5372 bc_vec_push(&G.prog.results, r);
5375 static BcStatus bc_program_op(char inst)
5378 BcResult *opd1, *opd2, res;
5379 BcNum *n1, *n2 = NULL;
5381 s = bc_program_binOpPrep(&opd1, &n1, &opd2, &n2, false);
5383 bc_num_init(&res.d.n, BC_NUM_DEF_SIZE);
5385 s = bc_program_ops[inst - BC_INST_POWER](n1, n2, &res.d.n, G.prog.scale);
5387 bc_program_binOpRetire(&res);
5392 bc_num_free(&res.d.n);
5396 static BcStatus bc_program_read(void)
5398 const char *sv_file;
5404 BcFunc *f = bc_vec_item(&G.prog.fns, BC_PROG_READ);
5406 for (i = 0; i < G.prog.stack.len; ++i) {
5407 BcInstPtr *ip_ptr = bc_vec_item(&G.prog.stack, i);
5408 if (ip_ptr->func == BC_PROG_READ)
5409 return bc_error_nested_read_call();
5412 bc_vec_pop_all(&f->code);
5413 bc_char_vec_init(&buf);
5415 sv_file = G.prog.file;
5418 s = bc_read_line(&buf, "read> ");
5421 common_parse_init(&parse, BC_PROG_READ);
5422 bc_lex_file(&parse.l);
5424 s = bc_parse_text(&parse, buf.v);
5425 if (s) goto exec_err;
5426 s = common_parse_expr(&parse, BC_PARSE_NOREAD);
5427 if (s) goto exec_err;
5429 if (parse.l.t.t != BC_LEX_NLINE && parse.l.t.t != BC_LEX_EOF) {
5430 s = bc_error("bad read() expression");
5434 ip.func = BC_PROG_READ;
5436 ip.len = G.prog.results.len;
5438 // Update this pointer, just in case.
5439 f = bc_vec_item(&G.prog.fns, BC_PROG_READ);
5441 bc_vec_pushByte(&f->code, BC_INST_POP_EXEC);
5442 bc_vec_push(&G.prog.stack, &ip);
5445 G.prog.file = sv_file;
5446 bc_parse_free(&parse);
5452 static size_t bc_program_index(char *code, size_t *bgn)
5454 char amt = code[(*bgn)++], i = 0;
5457 for (; i < amt; ++i, ++(*bgn))
5458 res |= (((size_t)((int) code[*bgn]) & UCHAR_MAX) << (i * CHAR_BIT));
5463 static char *bc_program_name(char *code, size_t *bgn)
5466 char c, *s, *str = code + *bgn, *ptr = strchr(str, BC_PARSE_STREND);
5468 s = xmalloc(ptr - str + 1);
5471 for (i = 0; c != 0 && c != BC_PARSE_STREND; c = code[(*bgn)++], ++i)
5479 static void bc_program_printString(const char *str, size_t *nchars)
5481 size_t i, len = strlen(str);
5490 for (i = 0; i < len; ++i, ++(*nchars)) {
5494 if (c != '\\' || i == len - 1)
5554 // Just print the backslash and following character.
5565 static BcStatus bc_program_print(char inst, size_t idx)
5567 BcStatus s = BC_STATUS_SUCCESS;
5572 bool pop = inst != BC_INST_PRINT;
5574 if (!BC_PROG_STACK(&G.prog.results, idx + 1))
5575 return bc_error_stack_has_too_few_elements();
5577 r = bc_vec_item_rev(&G.prog.results, idx);
5578 s = bc_program_num(r, &num, false);
5581 if (BC_PROG_NUM(r, num)) {
5582 s = bc_num_print(num, &G.prog.ob, G.prog.ob_t, !pop, &G.prog.nchars, G.prog.len);
5583 if (!s) bc_num_copy(&G.prog.last, num);
5587 idx = (r->t == BC_RESULT_STR) ? r->d.id.idx : num->rdx;
5588 str = *((char **) bc_vec_item(&G.prog.strs, idx));
5590 if (inst == BC_INST_PRINT_STR) {
5591 for (i = 0, len = strlen(str); i < len; ++i) {
5594 if (c == '\n') G.prog.nchars = SIZE_MAX;
5599 bc_program_printString(str, &G.prog.nchars);
5600 if (inst == BC_INST_PRINT) bb_putchar('\n');
5604 if (!s && pop) bc_vec_pop(&G.prog.results);
5609 static BcStatus bc_program_negate(void)
5615 s = bc_program_prep(&ptr, &num);
5618 bc_num_init(&res.d.n, num->len);
5619 bc_num_copy(&res.d.n, num);
5620 if (res.d.n.len) res.d.n.neg = !res.d.n.neg;
5622 bc_program_retire(&res, BC_RESULT_TEMP);
5627 static BcStatus bc_program_logical(char inst)
5630 BcResult *opd1, *opd2, res;
5635 s = bc_program_binOpPrep(&opd1, &n1, &opd2, &n2, false);
5637 bc_num_init(&res.d.n, BC_NUM_DEF_SIZE);
5639 if (inst == BC_INST_BOOL_AND)
5640 cond = bc_num_cmp(n1, &G.prog.zero) && bc_num_cmp(n2, &G.prog.zero);
5641 else if (inst == BC_INST_BOOL_OR)
5642 cond = bc_num_cmp(n1, &G.prog.zero) || bc_num_cmp(n2, &G.prog.zero);
5645 cmp = bc_num_cmp(n1, n2);
5649 case BC_INST_REL_EQ:
5655 case BC_INST_REL_LE:
5661 case BC_INST_REL_GE:
5667 case BC_INST_REL_NE:
5673 case BC_INST_REL_LT:
5679 case BC_INST_REL_GT:
5687 (cond ? bc_num_one : bc_num_zero)(&res.d.n);
5689 bc_program_binOpRetire(&res);
5695 static BcStatus bc_program_assignStr(BcResult *r, BcVec *v,
5701 memset(&n2, 0, sizeof(BcNum));
5702 n2.rdx = res.d.id.idx = r->d.id.idx;
5703 res.t = BC_RESULT_STR;
5706 if (!BC_PROG_STACK(&G.prog.results, 2))
5707 return bc_error_stack_has_too_few_elements();
5709 bc_vec_pop(&G.prog.results);
5712 bc_vec_pop(&G.prog.results);
5714 bc_vec_push(&G.prog.results, &res);
5715 bc_vec_push(v, &n2);
5717 return BC_STATUS_SUCCESS;
5721 static BcStatus bc_program_copyToVar(char *name, bool var)
5728 if (!BC_PROG_STACK(&G.prog.results, 1))
5729 return bc_error_stack_has_too_few_elements();
5731 ptr = bc_vec_top(&G.prog.results);
5732 if ((ptr->t == BC_RESULT_ARRAY) != !var)
5733 return bc_error_variable_is_wrong_type();
5734 v = bc_program_search(name, var);
5737 if (ptr->t == BC_RESULT_STR && !var)
5738 return bc_error_variable_is_wrong_type();
5739 if (ptr->t == BC_RESULT_STR) return bc_program_assignStr(ptr, v, true);
5742 s = bc_program_num(ptr, &n, false);
5745 // Do this once more to make sure that pointers were not invalidated.
5746 v = bc_program_search(name, var);
5749 bc_num_init(&r.d.n, BC_NUM_DEF_SIZE);
5750 bc_num_copy(&r.d.n, n);
5753 bc_array_init(&r.d.v, true);
5754 bc_array_copy(&r.d.v, (BcVec *) n);
5757 bc_vec_push(v, &r.d);
5758 bc_vec_pop(&G.prog.results);
5763 static BcStatus bc_program_assign(char inst)
5766 BcResult *left, *right, res;
5767 BcNum *l = NULL, *r = NULL;
5768 unsigned long val, max;
5769 bool assign = inst == BC_INST_ASSIGN, ib, sc;
5771 s = bc_program_binOpPrep(&left, &l, &right, &r, assign);
5774 ib = left->t == BC_RESULT_IBASE;
5775 sc = left->t == BC_RESULT_SCALE;
5779 if (right->t == BC_RESULT_STR) {
5783 if (left->t != BC_RESULT_VAR)
5784 return bc_error_variable_is_wrong_type();
5785 v = bc_program_search(left->d.id.name, true);
5787 return bc_program_assignStr(right, v, false);
5791 if (left->t == BC_RESULT_CONSTANT || left->t == BC_RESULT_TEMP)
5792 return bc_error("bad assignment:"
5793 " left side must be scale,"
5794 " ibase, obase, last, var,"
5799 if (inst == BC_INST_ASSIGN_DIVIDE && !bc_num_cmp(r, &G.prog.zero))
5800 return bc_error("divide by zero");
5805 s = bc_program_ops[inst - BC_INST_ASSIGN_POWER](l, r, l, G.prog.scale);
5812 if (ib || sc || left->t == BC_RESULT_OBASE) {
5813 static const char *const msg[] = {
5814 "bad ibase; must be [2, 16]", //BC_RESULT_IBASE
5815 "bad scale; must be [0, BC_SCALE_MAX]", //BC_RESULT_SCALE
5816 NULL, //can't happen //BC_RESULT_LAST
5817 NULL, //can't happen //BC_RESULT_CONSTANT
5818 NULL, //can't happen //BC_RESULT_ONE
5819 "bad obase; must be [2, BC_BASE_MAX]", //BC_RESULT_OBASE
5823 s = bc_num_ulong(l, &val);
5826 s = left->t - BC_RESULT_IBASE;
5829 ptr = &G.prog.scale;
5832 if (val < BC_NUM_MIN_BASE)
5833 return bc_error(msg[s]);
5834 max = ib ? BC_NUM_MAX_IBASE : BC_MAX_OBASE;
5835 ptr = ib ? &G.prog.ib_t : &G.prog.ob_t;
5839 return bc_error(msg[s]);
5841 bc_num_copy(ib ? &G.prog.ib : &G.prog.ob, l);
5843 *ptr = (size_t) val;
5844 s = BC_STATUS_SUCCESS;
5847 bc_num_init(&res.d.n, l->len);
5848 bc_num_copy(&res.d.n, l);
5849 bc_program_binOpRetire(&res);
5855 #define bc_program_pushVar(code, bgn, pop, copy) \
5856 bc_program_pushVar(code, bgn)
5857 // for bc, 'pop' and 'copy' are always false
5859 static BcStatus bc_program_pushVar(char *code, size_t *bgn,
5860 bool pop, bool copy)
5862 BcStatus s = BC_STATUS_SUCCESS;
5864 char *name = bc_program_name(code, bgn);
5866 r.t = BC_RESULT_VAR;
5871 BcVec *v = bc_program_search(name, true);
5872 BcNum *num = bc_vec_top(v);
5876 if (!BC_PROG_STACK(v, 2 - copy)) {
5878 return bc_error_stack_has_too_few_elements();
5884 if (!BC_PROG_STR(num)) {
5886 r.t = BC_RESULT_TEMP;
5888 bc_num_init(&r.d.n, BC_NUM_DEF_SIZE);
5889 bc_num_copy(&r.d.n, num);
5892 r.t = BC_RESULT_STR;
5893 r.d.id.idx = num->rdx;
5896 if (!copy) bc_vec_pop(v);
5901 bc_vec_push(&G.prog.results, &r);
5906 static BcStatus bc_program_pushArray(char *code, size_t *bgn,
5909 BcStatus s = BC_STATUS_SUCCESS;
5913 r.d.id.name = bc_program_name(code, bgn);
5915 if (inst == BC_INST_ARRAY) {
5916 r.t = BC_RESULT_ARRAY;
5917 bc_vec_push(&G.prog.results, &r);
5924 s = bc_program_prep(&operand, &num);
5926 s = bc_num_ulong(num, &temp);
5929 if (temp > BC_MAX_DIM) {
5930 s = bc_error("array too long; must be [1, BC_DIM_MAX]");
5934 r.d.id.idx = (size_t) temp;
5935 bc_program_retire(&r, BC_RESULT_ARRAY_ELEM);
5939 if (s) free(r.d.id.name);
5944 static BcStatus bc_program_incdec(char inst)
5947 BcResult *ptr, res, copy;
5951 s = bc_program_prep(&ptr, &num);
5954 if (inst == BC_INST_INC_POST || inst == BC_INST_DEC_POST) {
5955 copy.t = BC_RESULT_TEMP;
5956 bc_num_init(©.d.n, num->len);
5957 bc_num_copy(©.d.n, num);
5960 res.t = BC_RESULT_ONE;
5961 inst = inst == BC_INST_INC_PRE || inst == BC_INST_INC_POST ?
5962 BC_INST_ASSIGN_PLUS :
5963 BC_INST_ASSIGN_MINUS;
5965 bc_vec_push(&G.prog.results, &res);
5966 bc_program_assign(inst);
5968 if (inst2 == BC_INST_INC_POST || inst2 == BC_INST_DEC_POST) {
5969 bc_vec_pop(&G.prog.results);
5970 bc_vec_push(&G.prog.results, ©);
5976 static BcStatus bc_program_call(char *code, size_t *idx)
5978 BcStatus s = BC_STATUS_SUCCESS;
5980 size_t i, nparams = bc_program_index(code, idx);
5987 ip.func = bc_program_index(code, idx);
5988 func = bc_vec_item(&G.prog.fns, ip.func);
5990 if (func->code.len == 0) {
5991 return bc_error("undefined function");
5993 if (nparams != func->nparams) {
5994 return bc_error_fmt("function has %u parameters, but called with %u", func->nparams, nparams);
5996 ip.len = G.prog.results.len - nparams;
5998 for (i = 0; i < nparams; ++i) {
6000 a = bc_vec_item(&func->autos, nparams - 1 - i);
6001 arg = bc_vec_top(&G.prog.results);
6003 if ((!a->idx) != (arg->t == BC_RESULT_ARRAY) || arg->t == BC_RESULT_STR)
6004 return bc_error_variable_is_wrong_type();
6006 s = bc_program_copyToVar(a->name, a->idx);
6010 for (; i < func->autos.len; ++i) {
6013 a = bc_vec_item(&func->autos, i);
6014 v = bc_program_search(a->name, a->idx);
6017 bc_num_init(¶m.n, BC_NUM_DEF_SIZE);
6018 bc_vec_push(v, ¶m.n);
6021 bc_array_init(¶m.v, true);
6022 bc_vec_push(v, ¶m.v);
6026 bc_vec_push(&G.prog.stack, &ip);
6028 return BC_STATUS_SUCCESS;
6031 static BcStatus bc_program_return(char inst)
6037 BcInstPtr *ip = bc_vec_top(&G.prog.stack);
6039 if (!BC_PROG_STACK(&G.prog.results, ip->len + inst == BC_INST_RET))
6040 return bc_error_stack_has_too_few_elements();
6042 f = bc_vec_item(&G.prog.fns, ip->func);
6043 res.t = BC_RESULT_TEMP;
6045 if (inst == BC_INST_RET) {
6048 BcResult *operand = bc_vec_top(&G.prog.results);
6050 s = bc_program_num(operand, &num, false);
6052 bc_num_init(&res.d.n, num->len);
6053 bc_num_copy(&res.d.n, num);
6056 bc_num_init(&res.d.n, BC_NUM_DEF_SIZE);
6057 bc_num_zero(&res.d.n);
6060 // We need to pop arguments as well, so this takes that into account.
6061 for (i = 0; i < f->autos.len; ++i) {
6064 BcId *a = bc_vec_item(&f->autos, i);
6066 v = bc_program_search(a->name, a->idx);
6070 bc_vec_npop(&G.prog.results, G.prog.results.len - ip->len);
6071 bc_vec_push(&G.prog.results, &res);
6072 bc_vec_pop(&G.prog.stack);
6074 return BC_STATUS_SUCCESS;
6078 static unsigned long bc_program_scale(BcNum *n)
6080 return (unsigned long) n->rdx;
6083 static unsigned long bc_program_len(BcNum *n)
6085 unsigned long len = n->len;
6088 if (n->rdx != n->len) return len;
6089 for (i = n->len - 1; i < n->len && n->num[i] == 0; --len, --i);
6094 static BcStatus bc_program_builtin(char inst)
6100 bool len = inst == BC_INST_LENGTH;
6102 if (!BC_PROG_STACK(&G.prog.results, 1))
6103 return bc_error_stack_has_too_few_elements();
6104 opnd = bc_vec_top(&G.prog.results);
6106 s = bc_program_num(opnd, &num, false);
6110 if (!BC_PROG_NUM(opnd, num) && !len)
6111 return bc_error_variable_is_wrong_type();
6114 bc_num_init(&res.d.n, BC_NUM_DEF_SIZE);
6116 if (inst == BC_INST_SQRT) s = bc_num_sqrt(num, &res.d.n, G.prog.scale);
6118 else if (len != 0 && opnd->t == BC_RESULT_ARRAY) {
6119 bc_num_ulong2num(&res.d.n, (unsigned long) ((BcVec *) num)->len);
6123 else if (len != 0 && !BC_PROG_NUM(opnd, num)) {
6126 size_t idx = opnd->t == BC_RESULT_STR ? opnd->d.id.idx : num->rdx;
6128 str = bc_vec_item(&G.prog.strs, idx);
6129 bc_num_ulong2num(&res.d.n, strlen(*str));
6133 BcProgramBuiltIn f = len ? bc_program_len : bc_program_scale;
6134 bc_num_ulong2num(&res.d.n, f(num));
6137 bc_program_retire(&res, BC_RESULT_TEMP);
6143 static BcStatus bc_program_divmod(void)
6146 BcResult *opd1, *opd2, res, res2;
6147 BcNum *n1, *n2 = NULL;
6149 s = bc_program_binOpPrep(&opd1, &n1, &opd2, &n2, false);
6152 bc_num_init(&res.d.n, BC_NUM_DEF_SIZE);
6153 bc_num_init(&res2.d.n, n2->len);
6155 s = bc_num_divmod(n1, n2, &res2.d.n, &res.d.n, G.prog.scale);
6158 bc_program_binOpRetire(&res2);
6159 res.t = BC_RESULT_TEMP;
6160 bc_vec_push(&G.prog.results, &res);
6165 bc_num_free(&res2.d.n);
6166 bc_num_free(&res.d.n);
6170 static BcStatus bc_program_modexp(void)
6173 BcResult *r1, *r2, *r3, res;
6174 BcNum *n1, *n2, *n3;
6176 if (!BC_PROG_STACK(&G.prog.results, 3))
6177 return bc_error_stack_has_too_few_elements();
6178 s = bc_program_binOpPrep(&r2, &n2, &r3, &n3, false);
6181 r1 = bc_vec_item_rev(&G.prog.results, 2);
6182 s = bc_program_num(r1, &n1, false);
6184 if (!BC_PROG_NUM(r1, n1))
6185 return bc_error_variable_is_wrong_type();
6187 // Make sure that the values have their pointers updated, if necessary.
6188 if (r1->t == BC_RESULT_VAR || r1->t == BC_RESULT_ARRAY_ELEM) {
6190 if (r1->t == r2->t) {
6191 s = bc_program_num(r2, &n2, false);
6195 if (r1->t == r3->t) {
6196 s = bc_program_num(r3, &n3, false);
6201 bc_num_init(&res.d.n, n3->len);
6202 s = bc_num_modexp(n1, n2, n3, &res.d.n);
6205 bc_vec_pop(&G.prog.results);
6206 bc_program_binOpRetire(&res);
6211 bc_num_free(&res.d.n);
6215 static void bc_program_stackLen(void)
6218 size_t len = G.prog.results.len;
6220 res.t = BC_RESULT_TEMP;
6222 bc_num_init(&res.d.n, BC_NUM_DEF_SIZE);
6223 bc_num_ulong2num(&res.d.n, len);
6224 bc_vec_push(&G.prog.results, &res);
6227 static BcStatus bc_program_asciify(void)
6231 BcNum *num = NULL, n;
6232 char *str, *str2, c;
6233 size_t len = G.prog.strs.len, idx;
6236 if (!BC_PROG_STACK(&G.prog.results, 1))
6237 return bc_error_stack_has_too_few_elements();
6238 r = bc_vec_top(&G.prog.results);
6240 s = bc_program_num(r, &num, false);
6243 if (BC_PROG_NUM(r, num)) {
6245 bc_num_init(&n, BC_NUM_DEF_SIZE);
6246 bc_num_copy(&n, num);
6247 bc_num_truncate(&n, n.rdx);
6249 s = bc_num_mod(&n, &G.prog.strmb, &n, 0);
6250 if (s) goto num_err;
6251 s = bc_num_ulong(&n, &val);
6252 if (s) goto num_err;
6259 idx = (r->t == BC_RESULT_STR) ? r->d.id.idx : num->rdx;
6260 str2 = *((char **) bc_vec_item(&G.prog.strs, idx));
6268 str2 = xstrdup(str);
6269 bc_program_addFunc(str2, &idx);
6271 if (idx != len + BC_PROG_REQ_FUNCS) {
6273 for (idx = 0; idx < G.prog.strs.len; ++idx) {
6274 if (!strcmp(*((char **) bc_vec_item(&G.prog.strs, idx)), str)) {
6283 bc_vec_push(&G.prog.strs, &str);
6285 res.t = BC_RESULT_STR;
6287 bc_vec_pop(&G.prog.results);
6288 bc_vec_push(&G.prog.results, &res);
6290 return BC_STATUS_SUCCESS;
6297 static BcStatus bc_program_printStream(void)
6305 if (!BC_PROG_STACK(&G.prog.results, 1))
6306 return bc_error_stack_has_too_few_elements();
6307 r = bc_vec_top(&G.prog.results);
6309 s = bc_program_num(r, &n, false);
6312 if (BC_PROG_NUM(r, n))
6313 s = bc_num_stream(n, &G.prog.strmb, &G.prog.nchars, G.prog.len);
6315 idx = (r->t == BC_RESULT_STR) ? r->d.id.idx : n->rdx;
6316 str = *((char **) bc_vec_item(&G.prog.strs, idx));
6323 static BcStatus bc_program_nquit(void)
6330 s = bc_program_prep(&opnd, &num);
6332 s = bc_num_ulong(num, &val);
6335 bc_vec_pop(&G.prog.results);
6337 if (G.prog.stack.len < val)
6338 return bc_error_stack_has_too_few_elements();
6339 if (G.prog.stack.len == val)
6342 bc_vec_npop(&G.prog.stack, val);
6347 static BcStatus bc_program_execStr(char *code, size_t *bgn,
6350 BcStatus s = BC_STATUS_SUCCESS;
6360 if (!BC_PROG_STACK(&G.prog.results, 1))
6361 return bc_error_stack_has_too_few_elements();
6363 r = bc_vec_top(&G.prog.results);
6367 char *name, *then_name = bc_program_name(code, bgn), *else_name = NULL;
6369 if (code[*bgn] == BC_PARSE_STREND)
6372 else_name = bc_program_name(code, bgn);
6374 exec = r->d.n.len != 0;
6378 else if (else_name != NULL) {
6385 v = bc_program_search(name, true);
6392 if (!exec) goto exit;
6393 if (!BC_PROG_STR(n)) {
6394 s = bc_error_variable_is_wrong_type();
6402 if (r->t == BC_RESULT_STR)
6404 else if (r->t == BC_RESULT_VAR) {
6405 s = bc_program_num(r, &n, false);
6406 if (s || !BC_PROG_STR(n)) goto exit;
6413 fidx = sidx + BC_PROG_REQ_FUNCS;
6415 str = bc_vec_item(&G.prog.strs, sidx);
6416 f = bc_vec_item(&G.prog.fns, fidx);
6418 if (f->code.len == 0) {
6419 common_parse_init(&prs, fidx);
6420 s = bc_parse_text(&prs, *str);
6422 s = common_parse_expr(&prs, BC_PARSE_NOCALL);
6425 if (prs.l.t.t != BC_LEX_EOF) {
6426 s = bc_error_bad_expression();
6430 bc_parse_free(&prs);
6434 ip.len = G.prog.results.len;
6437 bc_vec_pop(&G.prog.results);
6438 bc_vec_push(&G.prog.stack, &ip);
6440 return BC_STATUS_SUCCESS;
6443 bc_parse_free(&prs);
6444 f = bc_vec_item(&G.prog.fns, fidx);
6445 bc_vec_pop_all(&f->code);
6447 bc_vec_pop(&G.prog.results);
6452 static void bc_program_pushGlobal(char inst)
6457 res.t = inst - BC_INST_IBASE + BC_RESULT_IBASE;
6458 if (inst == BC_INST_IBASE)
6459 val = (unsigned long) G.prog.ib_t;
6460 else if (inst == BC_INST_SCALE)
6461 val = (unsigned long) G.prog.scale;
6463 val = (unsigned long) G.prog.ob_t;
6465 bc_num_init(&res.d.n, BC_NUM_DEF_SIZE);
6466 bc_num_ulong2num(&res.d.n, val);
6467 bc_vec_push(&G.prog.results, &res);
6470 static void bc_program_addFunc(char *name, size_t *idx)
6472 BcId entry, *entry_ptr;
6477 entry.idx = G.prog.fns.len;
6479 inserted = bc_map_insert(&G.prog.fn_map, &entry, idx);
6480 if (!inserted) free(name);
6482 entry_ptr = bc_vec_item(&G.prog.fn_map, *idx);
6483 *idx = entry_ptr->idx;
6487 BcFunc *func = bc_vec_item(&G.prog.fns, entry_ptr->idx);
6489 // We need to reset these, so the function can be repopulated.
6491 bc_vec_pop_all(&func->autos);
6492 bc_vec_pop_all(&func->code);
6493 bc_vec_pop_all(&func->labels);
6497 bc_vec_push(&G.prog.fns, &f);
6501 // Called when parsing or execution detects a failure,
6502 // resets execution structures.
6503 static void bc_program_reset(void)
6508 bc_vec_npop(&G.prog.stack, G.prog.stack.len - 1);
6509 bc_vec_pop_all(&G.prog.results);
6511 f = bc_vec_item(&G.prog.fns, 0);
6512 ip = bc_vec_top(&G.prog.stack);
6513 ip->idx = f->code.len;
6515 // If !tty, no need to check for ^C: we don't have ^C handler,
6516 // we would be killed by a signal and won't reach this place
6519 static BcStatus bc_program_exec(void)
6521 BcStatus s = BC_STATUS_SUCCESS;
6525 BcInstPtr *ip = bc_vec_top(&G.prog.stack);
6526 BcFunc *func = bc_vec_item(&G.prog.fns, ip->func);
6527 char *code = func->code.v;
6530 while (!s && ip->idx < func->code.len) {
6532 char inst = code[(ip->idx)++];
6537 case BC_INST_JUMP_ZERO:
6539 s = bc_program_prep(&ptr, &num);
6541 cond = !bc_num_cmp(num, &G.prog.zero);
6542 bc_vec_pop(&G.prog.results);
6548 idx = bc_program_index(code, &ip->idx);
6549 addr = bc_vec_item(&func->labels, idx);
6550 if (inst == BC_INST_JUMP || cond) ip->idx = *addr;
6556 s = bc_program_call(code, &ip->idx);
6560 case BC_INST_INC_PRE:
6561 case BC_INST_DEC_PRE:
6562 case BC_INST_INC_POST:
6563 case BC_INST_DEC_POST:
6565 s = bc_program_incdec(inst);
6578 s = bc_program_return(inst);
6582 case BC_INST_BOOL_OR:
6583 case BC_INST_BOOL_AND:
6585 case BC_INST_REL_EQ:
6586 case BC_INST_REL_LE:
6587 case BC_INST_REL_GE:
6588 case BC_INST_REL_NE:
6589 case BC_INST_REL_LT:
6590 case BC_INST_REL_GT:
6592 s = bc_program_logical(inst);
6598 s = bc_program_read();
6604 s = bc_program_pushVar(code, &ip->idx, false, false);
6608 case BC_INST_ARRAY_ELEM:
6611 s = bc_program_pushArray(code, &ip->idx, inst);
6617 r.t = BC_RESULT_LAST;
6618 bc_vec_push(&G.prog.results, &r);
6626 bc_program_pushGlobal(inst);
6630 case BC_INST_SCALE_FUNC:
6631 case BC_INST_LENGTH:
6634 s = bc_program_builtin(inst);
6640 r.t = BC_RESULT_CONSTANT;
6641 r.d.id.idx = bc_program_index(code, &ip->idx);
6642 bc_vec_push(&G.prog.results, &r);
6648 if (!BC_PROG_STACK(&G.prog.results, 1))
6649 s = bc_error_stack_has_too_few_elements();
6651 bc_vec_pop(&G.prog.results);
6655 case BC_INST_POP_EXEC:
6657 bc_vec_pop(&G.prog.stack);
6662 case BC_INST_PRINT_POP:
6663 case BC_INST_PRINT_STR:
6665 s = bc_program_print(inst, 0);
6671 r.t = BC_RESULT_STR;
6672 r.d.id.idx = bc_program_index(code, &ip->idx);
6673 bc_vec_push(&G.prog.results, &r);
6678 case BC_INST_MULTIPLY:
6679 case BC_INST_DIVIDE:
6680 case BC_INST_MODULUS:
6684 s = bc_program_op(inst);
6688 case BC_INST_BOOL_NOT:
6690 s = bc_program_prep(&ptr, &num);
6693 bc_num_init(&r.d.n, BC_NUM_DEF_SIZE);
6694 (!bc_num_cmp(num, &G.prog.zero) ? bc_num_one : bc_num_zero)(&r.d.n);
6695 bc_program_retire(&r, BC_RESULT_TEMP);
6702 s = bc_program_negate();
6707 case BC_INST_ASSIGN_POWER:
6708 case BC_INST_ASSIGN_MULTIPLY:
6709 case BC_INST_ASSIGN_DIVIDE:
6710 case BC_INST_ASSIGN_MODULUS:
6711 case BC_INST_ASSIGN_PLUS:
6712 case BC_INST_ASSIGN_MINUS:
6714 case BC_INST_ASSIGN:
6716 s = bc_program_assign(inst);
6720 case BC_INST_MODEXP:
6722 s = bc_program_modexp();
6726 case BC_INST_DIVMOD:
6728 s = bc_program_divmod();
6732 case BC_INST_EXECUTE:
6733 case BC_INST_EXEC_COND:
6735 cond = inst == BC_INST_EXEC_COND;
6736 s = bc_program_execStr(code, &ip->idx, cond);
6740 case BC_INST_PRINT_STACK:
6742 for (idx = 0; !s && idx < G.prog.results.len; ++idx)
6743 s = bc_program_print(BC_INST_PRINT, idx);
6747 case BC_INST_CLEAR_STACK:
6749 bc_vec_pop_all(&G.prog.results);
6753 case BC_INST_STACK_LEN:
6755 bc_program_stackLen();
6759 case BC_INST_DUPLICATE:
6761 if (!BC_PROG_STACK(&G.prog.results, 1))
6762 return bc_error_stack_has_too_few_elements();
6763 ptr = bc_vec_top(&G.prog.results);
6764 bc_result_copy(&r, ptr);
6765 bc_vec_push(&G.prog.results, &r);
6773 if (!BC_PROG_STACK(&G.prog.results, 2))
6774 return bc_error_stack_has_too_few_elements();
6776 ptr = bc_vec_item_rev(&G.prog.results, 0);
6777 ptr2 = bc_vec_item_rev(&G.prog.results, 1);
6778 memcpy(&r, ptr, sizeof(BcResult));
6779 memcpy(ptr, ptr2, sizeof(BcResult));
6780 memcpy(ptr2, &r, sizeof(BcResult));
6785 case BC_INST_ASCIIFY:
6787 s = bc_program_asciify();
6791 case BC_INST_PRINT_STREAM:
6793 s = bc_program_printStream();
6798 case BC_INST_PUSH_VAR:
6800 bool copy = inst == BC_INST_LOAD;
6801 s = bc_program_pushVar(code, &ip->idx, true, copy);
6805 case BC_INST_PUSH_TO_VAR:
6807 char *name = bc_program_name(code, &ip->idx);
6808 s = bc_program_copyToVar(name, true);
6815 if (G.prog.stack.len <= 2)
6817 bc_vec_npop(&G.prog.stack, 2);
6823 s = bc_program_nquit();
6829 if (s || G_interrupt) {
6834 // If the stack has changed, pointers may be invalid.
6835 ip = bc_vec_top(&G.prog.stack);
6836 func = bc_vec_item(&G.prog.fns, ip->func);
6837 code = func->code.v;
6844 static void bc_vm_envArgs(void)
6846 static const char* const bc_args_env_name = "BC_ENV_ARGS";
6849 char *env_args = getenv(bc_args_env_name), *buf;
6851 if (!env_args) return;
6853 G.env_args = xstrdup(env_args);
6856 bc_vec_init(&v, sizeof(char *), NULL);
6857 bc_vec_push(&v, &bc_args_env_name);
6860 if (!isspace(*buf)) {
6861 bc_vec_push(&v, &buf);
6862 while (*buf != 0 && !isspace(*buf)) ++buf;
6863 if (*buf != 0) (*(buf++)) = '\0';
6869 bc_args((int) v.len, (char **) v.v);
6875 static size_t bc_vm_envLen(const char *var)
6877 char *lenv = getenv(var);
6878 size_t i, len = BC_NUM_PRINT_WIDTH;
6881 if (!lenv) return len;
6885 for (num = 1, i = 0; num && i < len; ++i) num = isdigit(lenv[i]);
6887 len = (size_t) atoi(lenv) - 1;
6888 if (len < 2 || len >= INT32_MAX) len = BC_NUM_PRINT_WIDTH;
6891 len = BC_NUM_PRINT_WIDTH;
6896 static BcStatus bc_vm_process(const char *text)
6898 BcStatus s = bc_parse_text(&G.prs, text);
6902 while (G.prs.l.t.t != BC_LEX_EOF) {
6903 s = G.prs.parse(&G.prs);
6907 if (BC_PARSE_CAN_EXEC(&G.prs)) {
6908 s = bc_program_exec();
6917 static BcStatus bc_vm_file(const char *file)
6919 const char *sv_file;
6925 data = bc_read_file(file);
6926 if (!data) return bc_error_fmt("file '%s' is not text", file);
6928 sv_file = G.prog.file;
6930 bc_lex_file(&G.prs.l);
6931 s = bc_vm_process(data);
6934 main_func = bc_vec_item(&G.prog.fns, BC_PROG_MAIN);
6935 ip = bc_vec_item(&G.prog.stack, 0);
6937 if (main_func->code.len < ip->idx)
6938 s = bc_error_fmt("file '%s' is not executable", file);
6941 G.prog.file = sv_file;
6946 static BcStatus bc_vm_stdin(void)
6950 size_t len, i, str = 0;
6951 bool comment = false;
6954 bc_lex_file(&G.prs.l);
6956 bc_char_vec_init(&buffer);
6957 bc_char_vec_init(&buf);
6958 bc_vec_pushZeroByte(&buffer);
6960 // This loop is complex because the vm tries not to send any lines that end
6961 // with a backslash to the parser. The reason for that is because the parser
6962 // treats a backslash+newline combo as whitespace, per the bc spec. In that
6963 // case, and for strings and comments, the parser will expect more stuff.
6964 s = BC_STATUS_SUCCESS;
6965 while (!G.eof && (s = bc_read_line(&buf, ">>> ")) == BC_STATUS_SUCCESS) {
6967 char *string = buf.v;
6972 if (str && buf.v[0] == G.send)
6974 else if (buf.v[0] == G.sbgn)
6977 else if (len > 1 || comment) {
6979 for (i = 0; i < len; ++i) {
6981 bool notend = len > i + 1;
6984 if (i - 1 > len || string[i - 1] != '\\') {
6985 if (G.sbgn == G.send)
6987 else if (c == G.send)
6989 else if (c == G.sbgn)
6993 if (c == '/' && notend && !comment && string[i + 1] == '*') {
6997 else if (c == '*' && notend && comment && string[i + 1] == '/')
7001 if (str || comment || string[len - 2] == '\\') {
7002 bc_vec_concat(&buffer, buf.v);
7007 bc_vec_concat(&buffer, buf.v);
7008 s = bc_vm_process(buffer.v);
7011 fputs("ready for more input\n", stderr);
7014 bc_vec_pop_all(&buffer);
7018 s = bc_error("string end could not be found");
7021 s = bc_error("comment end could not be found");
7025 bc_vec_free(&buffer);
7030 static const char bc_lib[] = {
7033 "\n" "auto b,s,n,r,d,i,p,f,v"
7042 "\n" "scale=scale(x)+1"
7052 "\n" "for(i=2;v!=0;++i){"
7058 "\n" "while((d--)!=0)r*=r"
7061 "\n" "if(n!=0)return(1/r)"
7065 "\n" "auto b,s,r,p,a,q,i,v"
7069 "\n" "r=(1-10^scale)/1"
7080 "\n" "while(x<=0.5){"
7084 "\n" "r=a=(x-1)/(x+1)"
7087 "\n" "for(i=3;v!=0;i+=2){"
7098 "\n" "auto b,s,r,n,a,q,i"
7102 "\n" "scale=1.1*s+2"
7111 "\n" "if(q%2!=0)x=-x"
7115 "\n" "for(i=3;a!=0;i+=2){"
7116 "\n" "a*=q/(i*(i-1))"
7121 "\n" "if(n!=0)return(-r/1)"
7130 "\n" "x=s(2*a(1)+x)"
7136 "\n" "auto b,s,r,n,a,m,t,f,i,u"
7145 "\n" "if(scale<65){"
7146 "\n" "return(.7853981633974483096156608458198757210492923498437764552437361480/n)"
7150 "\n" "if(scale<65){"
7151 "\n" "return(.1973955598498807583700497651947902934475851037878521015176889402/n)"
7162 "\n" "x=(x-.2)/(1+.2*x)"
7167 "\n" "for(i=3;t!=0;i+=2){"
7174 "\n" "return((m*a+r)/n)"
7176 "\n" "define j(n,x){"
7177 "\n" "auto b,s,o,a,i,v,f"
7185 "\n" "if(n%2==1)o=1"
7188 "\n" "for(i=2;i<=n;++i)a*=i"
7190 "\n" "a=(x^n)/2^n/a"
7193 "\n" "scale=scale+length(a)-scale(a)"
7194 "\n" "for(i=1;v!=0;++i){"
7195 "\n" "v=v*f/i/(n+i)"
7201 "\n" "return(a*r/1)"
7206 static BcStatus bc_vm_exec(void)
7208 BcStatus s = BC_STATUS_SUCCESS;
7212 if (option_mask32 & BC_FLAG_L) {
7214 // We know that internal library is not buggy,
7215 // thus error checking is normally disabled.
7216 # define DEBUG_LIB 0
7217 bc_lex_file(&G.prs.l);
7218 s = bc_parse_text(&G.prs, bc_lib);
7219 if (DEBUG_LIB && s) return s;
7221 while (G.prs.l.t.t != BC_LEX_EOF) {
7222 s = G.prs.parse(&G.prs);
7223 if (DEBUG_LIB && s) return s;
7225 s = bc_program_exec();
7226 if (DEBUG_LIB && s) return s;
7230 for (i = 0; !s && i < G.files.len; ++i)
7231 s = bc_vm_file(*((char **) bc_vec_item(&G.files, i)));
7234 fputs("ready for more input\n", stderr);
7237 if (IS_BC || !G.files.len)
7239 if (!s && !BC_PARSE_CAN_EXEC(&G.prs))
7240 s = bc_vm_process("");
7245 #if ENABLE_FEATURE_CLEAN_UP
7246 static void bc_program_free()
7248 bc_num_free(&G.prog.ib);
7249 bc_num_free(&G.prog.ob);
7250 bc_num_free(&G.prog.hexb);
7252 bc_num_free(&G.prog.strmb);
7254 bc_vec_free(&G.prog.fns);
7255 bc_vec_free(&G.prog.fn_map);
7256 bc_vec_free(&G.prog.vars);
7257 bc_vec_free(&G.prog.var_map);
7258 bc_vec_free(&G.prog.arrs);
7259 bc_vec_free(&G.prog.arr_map);
7260 bc_vec_free(&G.prog.strs);
7261 bc_vec_free(&G.prog.consts);
7262 bc_vec_free(&G.prog.results);
7263 bc_vec_free(&G.prog.stack);
7264 bc_num_free(&G.prog.last);
7265 bc_num_free(&G.prog.zero);
7266 bc_num_free(&G.prog.one);
7269 static void bc_vm_free(void)
7271 bc_vec_free(&G.files);
7273 bc_parse_free(&G.prs);
7278 static void bc_program_init(size_t line_len)
7283 /* memset(&G.prog, 0, sizeof(G.prog)); - already is */
7284 memset(&ip, 0, sizeof(BcInstPtr));
7286 /* G.prog.nchars = G.prog.scale = 0; - already is */
7287 G.prog.len = line_len;
7289 bc_num_init(&G.prog.ib, BC_NUM_DEF_SIZE);
7290 bc_num_ten(&G.prog.ib);
7293 bc_num_init(&G.prog.ob, BC_NUM_DEF_SIZE);
7294 bc_num_ten(&G.prog.ob);
7297 bc_num_init(&G.prog.hexb, BC_NUM_DEF_SIZE);
7298 bc_num_ten(&G.prog.hexb);
7299 G.prog.hexb.num[0] = 6;
7302 bc_num_init(&G.prog.strmb, BC_NUM_DEF_SIZE);
7303 bc_num_ulong2num(&G.prog.strmb, UCHAR_MAX + 1);
7306 bc_num_init(&G.prog.last, BC_NUM_DEF_SIZE);
7307 bc_num_zero(&G.prog.last);
7309 bc_num_init(&G.prog.zero, BC_NUM_DEF_SIZE);
7310 bc_num_zero(&G.prog.zero);
7312 bc_num_init(&G.prog.one, BC_NUM_DEF_SIZE);
7313 bc_num_one(&G.prog.one);
7315 bc_vec_init(&G.prog.fns, sizeof(BcFunc), bc_func_free);
7316 bc_vec_init(&G.prog.fn_map, sizeof(BcId), bc_id_free);
7318 bc_program_addFunc(xstrdup("(main)"), &idx);
7319 bc_program_addFunc(xstrdup("(read)"), &idx);
7321 bc_vec_init(&G.prog.vars, sizeof(BcVec), bc_vec_free);
7322 bc_vec_init(&G.prog.var_map, sizeof(BcId), bc_id_free);
7324 bc_vec_init(&G.prog.arrs, sizeof(BcVec), bc_vec_free);
7325 bc_vec_init(&G.prog.arr_map, sizeof(BcId), bc_id_free);
7327 bc_vec_init(&G.prog.strs, sizeof(char *), bc_string_free);
7328 bc_vec_init(&G.prog.consts, sizeof(char *), bc_string_free);
7329 bc_vec_init(&G.prog.results, sizeof(BcResult), bc_result_free);
7330 bc_vec_init(&G.prog.stack, sizeof(BcInstPtr), NULL);
7331 bc_vec_push(&G.prog.stack, &ip);
7334 static void bc_vm_init(const char *env_len)
7336 size_t len = bc_vm_envLen(env_len);
7338 bc_vec_init(&G.files, sizeof(char *), NULL);
7344 bc_program_init(len);
7346 bc_parse_init(&G.prs, BC_PROG_MAIN);
7348 dc_parse_init(&G.prs, BC_PROG_MAIN);
7352 static BcStatus bc_vm_run(int argc, char *argv[],
7353 const char *env_len)
7357 bc_vm_init(env_len);
7358 bc_args(argc, argv);
7360 G.ttyin = isatty(0);
7363 #if ENABLE_FEATURE_BC_SIGNALS
7364 // With SA_RESTART, most system calls will restart
7365 // (IOW: they won't fail with EINTR).
7366 // In particular, this means ^C won't cause
7367 // stdout to get into "error state" if SIGINT hits
7368 // within write() syscall.
7369 // The downside is that ^C while line input is taken
7370 // will only be handled after [Enter] since read()
7371 // from stdin is not interrupted by ^C either,
7372 // it restarts, thus fgetc() does not return on ^C.
7373 signal_SA_RESTART_empty_mask(SIGINT, record_signo);
7375 // Without SA_RESTART, this exhibits a bug:
7376 // "while (1) print 1" and try ^C-ing it.
7377 // Intermittently, instead of returning to input line,
7378 // you'll get "output error: Interrupted system call"
7380 //signal_no_SA_RESTART_empty_mask(SIGINT, record_signo);
7382 if (!(option_mask32 & BC_FLAG_Q))
7387 #if ENABLE_FEATURE_CLEAN_UP
7394 int bc_main(int argc, char **argv) MAIN_EXTERNALLY_VISIBLE;
7395 int bc_main(int argc, char **argv)
7398 G.sbgn = G.send = '"';
7400 return bc_vm_run(argc, argv, "BC_LINE_LENGTH");
7405 int dc_main(int argc, char **argv) MAIN_EXTERNALLY_VISIBLE;
7406 int dc_main(int argc, char **argv)
7412 return bc_vm_run(argc, argv, "DC_LINE_LENGTH");