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_DC_SMALL
98 //config: bool "Minimal dc implementation (4.2 kb), not using bc code base"
99 //config: depends on DC && !BC
102 //config:config FEATURE_DC_LIBM
103 //config: bool "Enable power and exp functions (requires libm)"
105 //config: depends on FEATURE_DC_SMALL
107 //config: Enable power and exp functions.
108 //config: NOTE: This will require libm to be present for linking.
110 //config:config FEATURE_BC_SIGNALS
111 //config: bool "Enable bc/dc signal handling"
113 //config: depends on (BC || DC) && !FEATURE_DC_SMALL
115 //config: Enable signal handling for bc and dc.
117 //config:config FEATURE_BC_LONG_OPTIONS
118 //config: bool "Enable bc/dc long options"
120 //config: depends on (BC || DC) && !FEATURE_DC_SMALL
122 //config: Enable long options for bc and dc.
124 //applet:IF_BC(APPLET(bc, BB_DIR_USR_BIN, BB_SUID_DROP))
125 //applet:IF_DC(APPLET(dc, BB_DIR_USR_BIN, BB_SUID_DROP))
127 //kbuild:lib-$(CONFIG_BC) += bc.o
128 //kbuild:lib-$(CONFIG_DC) += bc.o
130 //See www.gnu.org/software/bc/manual/bc.html
131 //usage:#define bc_trivial_usage
132 //usage: "[-sqliw] FILE..."
134 //usage:#define bc_full_usage "\n"
135 //usage: "\nArbitrary precision calculator"
137 //usage: "\n -i Interactive"
138 //usage: "\n -l Load standard math library"
139 //usage: "\n -s Be POSIX compatible"
140 //usage: "\n -q Quiet"
141 //usage: "\n -w Warn if extensions are used"
142 ///////: "\n -v Version"
143 //usage: "\n$BC_LINE_LENGTH changes output width"
145 //usage:#define bc_example_usage
146 //usage: "3 + 4.129\n"
147 //usage: "1903 - 2893\n"
148 //usage: "-129 * 213.28935\n"
149 //usage: "12 / -1932\n"
151 //usage: "34 ^ 189\n"
152 //usage: "scale = 13\n"
153 //usage: "ibase = 2\n"
154 //usage: "obase = A\n"
156 //usage:#define dc_trivial_usage
157 //usage: "EXPRESSION..."
159 //usage:#define dc_full_usage "\n"
160 //usage: "\nTiny RPN calculator. Operations:"
161 //usage: "\n+, add, -, sub, *, mul, /, div, %, mod, ^, exp, ~, divmod, |, "
162 //usage: "modular exponentiation,"
163 //usage: "\np - print top of the stack (without popping),"
164 //usage: "\nf - print entire stack,"
165 //usage: "\nk - pop the value and set the precision."
166 //usage: "\ni - pop the value and set input radix."
167 //usage: "\no - pop the value and set output radix."
168 //usage: "\nExamples: 'dc 2 2 add p' -> 4, 'dc 8 8 mul 2 2 + / p' -> 16"
170 //usage:#define dc_example_usage
171 //usage: "$ dc 2 2 + p\n"
173 //usage: "$ dc 8 8 \\* 2 2 + / p\n"
175 //usage: "$ dc 0 1 and p\n"
177 //usage: "$ dc 0 1 or p\n"
179 //usage: "$ echo 72 9 div 8 mul p | dc\n"
183 #include "common_bufsiz.h"
185 #if ENABLE_FEATURE_DC_SMALL
189 typedef enum BcStatus {
190 BC_STATUS_SUCCESS = 0,
191 BC_STATUS_FAILURE = 1,
192 BC_STATUS_PARSE_EMPTY_EXP = 2, // bc_parse_expr() uses this
195 #define BC_VEC_INVALID_IDX ((size_t) -1)
196 #define BC_VEC_START_CAP (1 << 5)
198 typedef void (*BcVecFree)(void *);
200 typedef struct BcVec {
208 #define bc_vec_pop(v) (bc_vec_npop((v), 1))
209 #define bc_vec_top(v) (bc_vec_item_rev((v), 0))
211 typedef signed char BcDig;
213 typedef struct BcNum {
221 #define BC_NUM_MIN_BASE ((unsigned long) 2)
222 #define BC_NUM_MAX_IBASE ((unsigned long) 16)
223 #define BC_NUM_DEF_SIZE (16)
224 #define BC_NUM_PRINT_WIDTH (69)
226 #define BC_NUM_KARATSUBA_LEN (32)
228 #define BC_NUM_NEG(n, neg) ((((ssize_t)(n)) ^ -((ssize_t)(neg))) + (neg))
229 #define BC_NUM_ONE(n) ((n)->len == 1 && (n)->rdx == 0 && (n)->num[0] == 1)
230 #define BC_NUM_INT(n) ((n)->len - (n)->rdx)
231 #define BC_NUM_AREQ(a, b) \
232 (BC_MAX((a)->rdx, (b)->rdx) + BC_MAX(BC_NUM_INT(a), BC_NUM_INT(b)) + 1)
233 #define BC_NUM_MREQ(a, b, scale) \
234 (BC_NUM_INT(a) + BC_NUM_INT(b) + BC_MAX((scale), (a)->rdx + (b)->rdx) + 1)
236 typedef BcStatus (*BcNumBinaryOp)(BcNum *, BcNum *, BcNum *, size_t);
237 typedef void (*BcNumDigitOp)(size_t, size_t, bool, size_t *, size_t);
239 static BcStatus bc_num_add(BcNum *a, BcNum *b, BcNum *c, size_t scale);
240 static BcStatus bc_num_sub(BcNum *a, BcNum *b, BcNum *c, size_t scale);
241 static BcStatus bc_num_mul(BcNum *a, BcNum *b, BcNum *c, size_t scale);
242 static BcStatus bc_num_div(BcNum *a, BcNum *b, BcNum *c, size_t scale);
243 static BcStatus bc_num_mod(BcNum *a, BcNum *b, BcNum *c, size_t scale);
244 static BcStatus bc_num_pow(BcNum *a, BcNum *b, BcNum *c, size_t scale);
245 static BcStatus bc_num_sqrt(BcNum *a, BcNum *b, size_t scale);
246 static BcStatus bc_num_divmod(BcNum *a, BcNum *b, BcNum *c, BcNum *d,
249 typedef enum BcInst {
279 BC_INST_ASSIGN_POWER,
280 BC_INST_ASSIGN_MULTIPLY,
281 BC_INST_ASSIGN_DIVIDE,
282 BC_INST_ASSIGN_MODULUS,
284 BC_INST_ASSIGN_MINUS,
330 BC_INST_PRINT_STREAM,
345 BC_INST_INVALID = -1,
350 typedef struct BcId {
355 typedef struct BcFunc {
362 typedef enum BcResultType {
367 BC_RESULT_ARRAY_ELEM,
376 // These are between to calculate ibase, obase, and last from instructions.
384 typedef union BcResultData {
390 typedef struct BcResult {
395 typedef struct BcInstPtr {
401 // BC_LEX_NEG is not used in lexing; it is only for parsing.
402 typedef enum BcLexType {
430 BC_LEX_OP_ASSIGN_POWER,
431 BC_LEX_OP_ASSIGN_MULTIPLY,
432 BC_LEX_OP_ASSIGN_DIVIDE,
433 BC_LEX_OP_ASSIGN_MODULUS,
434 BC_LEX_OP_ASSIGN_PLUS,
435 BC_LEX_OP_ASSIGN_MINUS,
456 BC_LEX_KEY_1st_keyword,
457 BC_LEX_KEY_AUTO = BC_LEX_KEY_1st_keyword,
464 // code uses "type - BC_LEX_KEY_IBASE + BC_INST_IBASE" construct,
465 BC_LEX_KEY_IBASE, // relative order should match for: BC_INST_IBASE
467 BC_LEX_KEY_LAST, // relative order should match for: BC_INST_LAST
470 BC_LEX_KEY_OBASE, // relative order should match for: BC_INST_OBASE
508 // must match order of BC_LEX_KEY_foo etc above
510 struct BcLexKeyword {
513 #define BC_LEX_KW_ENTRY(a, b, c) \
514 { .name8 = a /*, .len = b, .posix = c*/ }
515 static const struct BcLexKeyword bc_lex_kws[20] = {
516 BC_LEX_KW_ENTRY("auto" , 4, 1), // 0
517 BC_LEX_KW_ENTRY("break" , 5, 1), // 1
518 BC_LEX_KW_ENTRY("continue", 8, 0), // 2 note: this one has no terminating NUL
519 BC_LEX_KW_ENTRY("define" , 6, 1), // 3
521 BC_LEX_KW_ENTRY("else" , 4, 0), // 4
522 BC_LEX_KW_ENTRY("for" , 3, 1), // 5
523 BC_LEX_KW_ENTRY("halt" , 4, 0), // 6
524 BC_LEX_KW_ENTRY("ibase" , 5, 1), // 7
526 BC_LEX_KW_ENTRY("if" , 2, 1), // 8
527 BC_LEX_KW_ENTRY("last" , 4, 0), // 9
528 BC_LEX_KW_ENTRY("length" , 6, 1), // 10
529 BC_LEX_KW_ENTRY("limits" , 6, 0), // 11
531 BC_LEX_KW_ENTRY("obase" , 5, 1), // 12
532 BC_LEX_KW_ENTRY("print" , 5, 0), // 13
533 BC_LEX_KW_ENTRY("quit" , 4, 1), // 14
534 BC_LEX_KW_ENTRY("read" , 4, 0), // 15
536 BC_LEX_KW_ENTRY("return" , 6, 1), // 16
537 BC_LEX_KW_ENTRY("scale" , 5, 1), // 17
538 BC_LEX_KW_ENTRY("sqrt" , 4, 1), // 18
539 BC_LEX_KW_ENTRY("while" , 5, 1), // 19
571 typedef BcStatus (*BcLexNext)(struct BcLex *);
573 typedef struct BcLex {
591 #define BC_PARSE_STREND ((char) UCHAR_MAX)
593 #define bc_parse_push(p, i) (bc_vec_pushByte(&(p)->func->code, (char) (i)))
594 #define bc_parse_updateFunc(p, f) \
595 ((p)->func = bc_vec_item(&G.prog.fns, ((p)->fidx = (f))))
597 #define BC_PARSE_REL (1 << 0)
598 #define BC_PARSE_PRINT (1 << 1)
599 #define BC_PARSE_NOCALL (1 << 2)
600 #define BC_PARSE_NOREAD (1 << 3)
601 #define BC_PARSE_ARRAY (1 << 4)
603 #define BC_PARSE_TOP_FLAG_PTR(parse) ((uint8_t *) bc_vec_top(&(parse)->flags))
604 #define BC_PARSE_TOP_FLAG(parse) (*(BC_PARSE_TOP_FLAG_PTR(parse)))
606 #define BC_PARSE_FLAG_FUNC_INNER (1 << 0)
607 #define BC_PARSE_FUNC_INNER(parse) \
608 (BC_PARSE_TOP_FLAG(parse) & BC_PARSE_FLAG_FUNC_INNER)
610 #define BC_PARSE_FLAG_FUNC (1 << 1)
611 #define BC_PARSE_FUNC(parse) (BC_PARSE_TOP_FLAG(parse) & BC_PARSE_FLAG_FUNC)
613 #define BC_PARSE_FLAG_BODY (1 << 2)
614 #define BC_PARSE_BODY(parse) (BC_PARSE_TOP_FLAG(parse) & BC_PARSE_FLAG_BODY)
616 #define BC_PARSE_FLAG_LOOP (1 << 3)
617 #define BC_PARSE_LOOP(parse) (BC_PARSE_TOP_FLAG(parse) & BC_PARSE_FLAG_LOOP)
619 #define BC_PARSE_FLAG_LOOP_INNER (1 << 4)
620 #define BC_PARSE_LOOP_INNER(parse) \
621 (BC_PARSE_TOP_FLAG(parse) & BC_PARSE_FLAG_LOOP_INNER)
623 #define BC_PARSE_FLAG_IF (1 << 5)
624 #define BC_PARSE_IF(parse) (BC_PARSE_TOP_FLAG(parse) & BC_PARSE_FLAG_IF)
626 #define BC_PARSE_FLAG_ELSE (1 << 6)
627 #define BC_PARSE_ELSE(parse) (BC_PARSE_TOP_FLAG(parse) & BC_PARSE_FLAG_ELSE)
629 #define BC_PARSE_FLAG_IF_END (1 << 7)
630 #define BC_PARSE_IF_END(parse) (BC_PARSE_TOP_FLAG(parse) & BC_PARSE_FLAG_IF_END)
632 #define BC_PARSE_CAN_EXEC(parse) \
633 (!(BC_PARSE_TOP_FLAG(parse) & \
634 (BC_PARSE_FLAG_FUNC_INNER | BC_PARSE_FLAG_FUNC | BC_PARSE_FLAG_BODY | \
635 BC_PARSE_FLAG_LOOP | BC_PARSE_FLAG_LOOP_INNER | BC_PARSE_FLAG_IF | \
636 BC_PARSE_FLAG_ELSE | BC_PARSE_FLAG_IF_END)))
638 typedef struct BcParseNext {
643 #define BC_PARSE_NEXT_TOKENS(...) .tokens = { __VA_ARGS__ }
644 #define BC_PARSE_NEXT(a, ...) \
646 .len = (a), BC_PARSE_NEXT_TOKENS(__VA_ARGS__) \
653 typedef BcStatus (*BcParseParse)(struct BcParse *);
655 typedef struct BcParse {
676 typedef struct BcProgram {
717 #define BC_PROG_STACK(s, n) ((s)->len >= ((size_t) n))
719 #define BC_PROG_MAIN (0)
720 #define BC_PROG_READ (1)
723 #define BC_PROG_REQ_FUNCS (2)
726 #define BC_PROG_STR(n) (!(n)->num && !(n)->cap)
727 #define BC_PROG_NUM(r, n) \
728 ((r)->t != BC_RESULT_ARRAY && (r)->t != BC_RESULT_STR && !BC_PROG_STR(n))
730 typedef unsigned long (*BcProgramBuiltIn)(BcNum *);
732 static void bc_program_addFunc(char *name, size_t *idx);
733 static void bc_program_reset(void);
735 #define BC_FLAG_X (1 << 0)
736 #define BC_FLAG_W (1 << 1)
737 #define BC_FLAG_V (1 << 2)
738 #define BC_FLAG_S (1 << 3)
739 #define BC_FLAG_Q (1 << 4)
740 #define BC_FLAG_L (1 << 5)
741 #define BC_FLAG_I (1 << 6)
743 #define BC_MAX(a, b) ((a) > (b) ? (a) : (b))
744 #define BC_MIN(a, b) ((a) < (b) ? (a) : (b))
746 #define BC_MAX_OBASE ((unsigned) 999)
747 #define BC_MAX_DIM ((unsigned) INT_MAX)
748 #define BC_MAX_SCALE ((unsigned) UINT_MAX)
749 #define BC_MAX_STRING ((unsigned) UINT_MAX - 1)
750 #define BC_MAX_NAME BC_MAX_STRING
751 #define BC_MAX_NUM BC_MAX_STRING
752 #define BC_MAX_EXP ((unsigned long) LONG_MAX)
753 #define BC_MAX_VARS ((unsigned long) SIZE_MAX - 1)
756 IF_FEATURE_BC_SIGNALS(smallint ttyin;)
764 // For error messages. Can be set to current parsed line,
765 // or [TODO] to current executing line (can be before last parsed one)
772 #if ENABLE_FEATURE_EDITING
773 line_input_t *line_input_state;
776 #define G (*ptr_to_globals)
777 #define INIT_G() do { \
778 SET_PTR_TO_GLOBALS(xzalloc(sizeof(G))); \
780 #define FREE_G() do { \
781 FREE_PTR_TO_GLOBALS(); \
783 #define G_posix (ENABLE_BC && (option_mask32 & BC_FLAG_S))
784 #define G_warn (ENABLE_BC && (option_mask32 & BC_FLAG_W))
785 #define G_exreg (ENABLE_DC && (option_mask32 & BC_FLAG_X))
786 #define G_interrupt (ENABLE_FEATURE_BC_SIGNALS ? bb_got_signal : 0)
787 #if ENABLE_FEATURE_BC_SIGNALS
788 # define G_ttyin G.ttyin
792 #define IS_BC (ENABLE_BC && (!ENABLE_DC || applet_name[0] == 'b'))
796 // This is a bit array that corresponds to token types. An entry is
797 // true if the token is valid in an expression, false otherwise.
799 BC_PARSE_EXPRS_BITS = 0
800 + ((uint64_t)((0 << 0)+(0 << 1)+(1 << 2)+(1 << 3)+(1 << 4)+(1 << 5)+(1 << 6)+(1 << 7)) << (0*8))
801 + ((uint64_t)((1 << 0)+(1 << 1)+(1 << 2)+(1 << 3)+(1 << 4)+(1 << 5)+(1 << 6)+(1 << 7)) << (1*8))
802 + ((uint64_t)((1 << 0)+(1 << 1)+(1 << 2)+(1 << 3)+(1 << 4)+(1 << 5)+(1 << 6)+(1 << 7)) << (2*8))
803 + ((uint64_t)((1 << 0)+(1 << 1)+(1 << 2)+(0 << 3)+(0 << 4)+(1 << 5)+(1 << 6)+(0 << 7)) << (3*8))
804 + ((uint64_t)((0 << 0)+(0 << 1)+(0 << 2)+(0 << 3)+(0 << 4)+(0 << 5)+(1 << 6)+(1 << 7)) << (4*8))
805 + ((uint64_t)((0 << 0)+(0 << 1)+(0 << 2)+(0 << 3)+(0 << 4)+(0 << 5)+(0 << 6)+(1 << 7)) << (5*8))
806 + ((uint64_t)((0 << 0)+(1 << 1)+(1 << 2)+(1 << 3)+(1 << 4)+(0 << 5)+(0 << 6)+(1 << 7)) << (6*8))
807 + ((uint64_t)((0 << 0)+(1 << 1)+(1 << 2)+(0 << 3) ) << (7*8))
809 static ALWAYS_INLINE long bc_parse_exprs(unsigned i)
811 #if ULONG_MAX > 0xffffffff
812 // 64-bit version (will not work correctly for 32-bit longs!)
813 return BC_PARSE_EXPRS_BITS & (1UL << i);
816 unsigned long m = (uint32_t)BC_PARSE_EXPRS_BITS;
818 m = (uint32_t)(BC_PARSE_EXPRS_BITS >> 32);
821 return m & (1UL << i);
825 // This is an array of data for operators that correspond to token types.
826 static const uint8_t bc_parse_ops[] = {
827 #define OP(p,l) ((int)(l) * 0x10 + (p))
828 OP(0, false), OP( 0, false ), // inc dec
831 OP(3, true ), OP( 3, true ), OP( 3, true ), // pow mul div
832 OP(4, true ), OP( 4, true ), // mod + -
833 OP(6, true ), OP( 6, true ), OP( 6, true ), OP( 6, true ), OP( 6, true ), OP( 6, true ), // == <= >= != < >
835 OP(7, true ), OP( 7, true ), // or and
836 OP(5, false), OP( 5, false ), OP( 5, false ), OP( 5, false ), OP( 5, false ), // ^= *= /= %= +=
837 OP(5, false), OP( 5, false ), // -= =
840 #define bc_parse_op_PREC(i) (bc_parse_ops[i] & 0x0f)
841 #define bc_parse_op_LEFT(i) (bc_parse_ops[i] & 0x10)
843 // These identify what tokens can come after expressions in certain cases.
844 static const BcParseNext bc_parse_next_expr =
845 BC_PARSE_NEXT(4, BC_LEX_NLINE, BC_LEX_SCOLON, BC_LEX_RBRACE, BC_LEX_EOF);
846 static const BcParseNext bc_parse_next_param =
847 BC_PARSE_NEXT(2, BC_LEX_RPAREN, BC_LEX_COMMA);
848 static const BcParseNext bc_parse_next_print =
849 BC_PARSE_NEXT(4, BC_LEX_COMMA, BC_LEX_NLINE, BC_LEX_SCOLON, BC_LEX_EOF);
850 static const BcParseNext bc_parse_next_rel = BC_PARSE_NEXT(1, BC_LEX_RPAREN);
851 static const BcParseNext bc_parse_next_elem = BC_PARSE_NEXT(1, BC_LEX_RBRACKET);
852 static const BcParseNext bc_parse_next_for = BC_PARSE_NEXT(1, BC_LEX_SCOLON);
853 static const BcParseNext bc_parse_next_read =
854 BC_PARSE_NEXT(2, BC_LEX_NLINE, BC_LEX_EOF);
858 static const BcLexType dc_lex_regs[] = {
859 BC_LEX_OP_REL_EQ, BC_LEX_OP_REL_LE, BC_LEX_OP_REL_GE, BC_LEX_OP_REL_NE,
860 BC_LEX_OP_REL_LT, BC_LEX_OP_REL_GT, BC_LEX_SCOLON, BC_LEX_COLON,
861 BC_LEX_ELSE, BC_LEX_LOAD, BC_LEX_LOAD_POP, BC_LEX_OP_ASSIGN,
865 static const BcLexType dc_lex_tokens[] = {
866 BC_LEX_OP_MODULUS, BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_LPAREN,
867 BC_LEX_INVALID, BC_LEX_OP_MULTIPLY, BC_LEX_OP_PLUS, BC_LEX_INVALID,
868 BC_LEX_OP_MINUS, BC_LEX_INVALID, BC_LEX_OP_DIVIDE,
869 BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID,
870 BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID,
871 BC_LEX_INVALID, BC_LEX_INVALID,
872 BC_LEX_COLON, BC_LEX_SCOLON, BC_LEX_OP_REL_GT, BC_LEX_OP_REL_EQ,
873 BC_LEX_OP_REL_LT, BC_LEX_KEY_READ, BC_LEX_INVALID,
874 BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID,
875 BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_EQ_NO_REG, BC_LEX_INVALID,
876 BC_LEX_KEY_IBASE, BC_LEX_INVALID, BC_LEX_KEY_SCALE, BC_LEX_LOAD_POP,
877 BC_LEX_INVALID, BC_LEX_OP_BOOL_NOT, BC_LEX_KEY_OBASE, BC_LEX_PRINT_STREAM,
878 BC_LEX_NQUIT, BC_LEX_POP, BC_LEX_STORE_PUSH, BC_LEX_INVALID, BC_LEX_INVALID,
879 BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_SCALE_FACTOR, BC_LEX_INVALID,
880 BC_LEX_KEY_LENGTH, BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID,
881 BC_LEX_OP_POWER, BC_LEX_NEG, BC_LEX_INVALID,
882 BC_LEX_ASCIIFY, BC_LEX_INVALID, BC_LEX_CLEAR_STACK, BC_LEX_DUPLICATE,
883 BC_LEX_ELSE, BC_LEX_PRINT_STACK, BC_LEX_INVALID, BC_LEX_INVALID,
884 BC_LEX_STORE_IBASE, BC_LEX_INVALID, BC_LEX_STORE_SCALE, BC_LEX_LOAD,
885 BC_LEX_INVALID, BC_LEX_PRINT_POP, BC_LEX_STORE_OBASE, BC_LEX_KEY_PRINT,
886 BC_LEX_KEY_QUIT, BC_LEX_SWAP, BC_LEX_OP_ASSIGN, BC_LEX_INVALID,
887 BC_LEX_INVALID, BC_LEX_KEY_SQRT, BC_LEX_INVALID, BC_LEX_EXECUTE,
888 BC_LEX_INVALID, BC_LEX_STACK_LEVEL,
889 BC_LEX_LBRACE, BC_LEX_OP_MODEXP, BC_LEX_INVALID, BC_LEX_OP_DIVMOD,
893 static const BcInst dc_parse_insts[] = {
894 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID, BC_INST_REL_GE,
895 BC_INST_INVALID, BC_INST_POWER, BC_INST_MULTIPLY, BC_INST_DIVIDE,
896 BC_INST_MODULUS, BC_INST_PLUS, BC_INST_MINUS,
897 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID,
898 BC_INST_INVALID, BC_INST_INVALID,
899 BC_INST_BOOL_NOT, BC_INST_INVALID, BC_INST_INVALID,
900 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID,
901 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID,
902 BC_INST_INVALID, BC_INST_INVALID, BC_INST_REL_GT, BC_INST_INVALID,
903 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID, BC_INST_REL_GE,
904 BC_INST_INVALID, BC_INST_INVALID,
905 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID,
906 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID,
907 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID, BC_INST_IBASE,
908 BC_INST_INVALID, BC_INST_INVALID, BC_INST_LENGTH, BC_INST_INVALID,
909 BC_INST_OBASE, BC_INST_PRINT, BC_INST_QUIT, BC_INST_INVALID,
910 BC_INST_INVALID, BC_INST_SCALE, BC_INST_SQRT, BC_INST_INVALID,
911 BC_INST_REL_EQ, BC_INST_MODEXP, BC_INST_DIVMOD, BC_INST_INVALID,
912 BC_INST_INVALID, BC_INST_EXECUTE, BC_INST_PRINT_STACK, BC_INST_CLEAR_STACK,
913 BC_INST_STACK_LEN, BC_INST_DUPLICATE, BC_INST_SWAP, BC_INST_POP,
914 BC_INST_ASCIIFY, BC_INST_PRINT_STREAM, BC_INST_INVALID, BC_INST_INVALID,
915 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID,
916 BC_INST_PRINT, BC_INST_NQUIT, BC_INST_SCALE_FUNC,
920 static const BcNumBinaryOp bc_program_ops[] = {
921 bc_num_pow, bc_num_mul, bc_num_div, bc_num_mod, bc_num_add, bc_num_sub,
924 static void fflush_and_check(void)
927 if (ferror(stdout) || ferror(stderr))
928 bb_perror_msg_and_die("output error");
931 #if ENABLE_FEATURE_CLEAN_UP
932 #define quit_or_return_for_exit() \
934 IF_FEATURE_BC_SIGNALS(G_ttyin = 0;) /* do not loop in main loop anymore */ \
935 return BC_STATUS_FAILURE; \
938 #define quit_or_return_for_exit() quit()
941 static void quit(void) NORETURN;
942 static void quit(void)
945 bb_perror_msg_and_die("input error");
950 static void bc_verror_msg(const char *fmt, va_list p)
952 const char *sv = sv; /* for compiler */
955 applet_name = xasprintf("%s: %s:%u", applet_name, G.prog.file, G.err_line);
957 bb_verror_msg(fmt, p, NULL);
959 free((char*)applet_name);
964 static NOINLINE int bc_error_fmt(const char *fmt, ...)
969 bc_verror_msg(fmt, p);
972 if (!ENABLE_FEATURE_CLEAN_UP && !G_ttyin)
974 return BC_STATUS_FAILURE;
977 static NOINLINE int bc_posix_error_fmt(const char *fmt, ...)
981 // Are non-POSIX constructs totally ok?
982 if (!(option_mask32 & (BC_FLAG_S|BC_FLAG_W)))
983 return BC_STATUS_SUCCESS; // yes
986 bc_verror_msg(fmt, p);
989 // Do we treat non-POSIX constructs as errors?
990 if (!(option_mask32 & BC_FLAG_S))
991 return BC_STATUS_SUCCESS; // no, it's a warning
992 if (!ENABLE_FEATURE_CLEAN_UP && !G_ttyin)
994 return BC_STATUS_FAILURE;
997 // We use error functions with "return bc_error(FMT[, PARAMS])" idiom.
998 // This idiom begs for tail-call optimization, but for it to work,
999 // function must not have caller-cleaned parameters on stack.
1000 // Unfortunately, vararg function API does exactly that on most arches.
1001 // Thus, use these shims for the cases when we have no vararg PARAMS:
1002 static int bc_error(const char *msg)
1004 return bc_error_fmt("%s", msg);
1006 static int bc_POSIX_requires(const char *msg)
1008 return bc_posix_error_fmt("POSIX requires %s", msg);
1010 static int bc_POSIX_does_not_allow(const char *msg)
1012 return bc_posix_error_fmt("%s%s", "POSIX does not allow ", msg);
1014 static int bc_POSIX_does_not_allow_bool_ops_this_is_bad(const char *msg)
1016 return bc_posix_error_fmt("%s%s %s", "POSIX does not allow ", "boolean operators; the following is bad:", msg);
1018 static int bc_POSIX_does_not_allow_empty_X_expression_in_for(const char *msg)
1020 return bc_posix_error_fmt("%san empty %s expression in a for loop", "POSIX does not allow ", msg);
1022 static int bc_error_bad_character(char c)
1024 return bc_error_fmt("bad character '%c'", c);
1026 static int bc_error_bad_expression(void)
1028 return bc_error("bad expression");
1030 static int bc_error_bad_token(void)
1032 return bc_error("bad token");
1034 static int bc_error_stack_has_too_few_elements(void)
1036 return bc_error("stack has too few elements");
1038 static int bc_error_variable_is_wrong_type(void)
1040 return bc_error("variable is wrong type");
1042 static int bc_error_nested_read_call(void)
1044 return bc_error("read() call inside of a read() call");
1047 static void bc_vec_grow(BcVec *v, size_t n)
1049 size_t cap = v->cap * 2;
1050 while (cap < v->len + n) cap *= 2;
1051 v->v = xrealloc(v->v, v->size * cap);
1055 static void bc_vec_init(BcVec *v, size_t esize, BcVecFree dtor)
1058 v->cap = BC_VEC_START_CAP;
1061 v->v = xmalloc(esize * BC_VEC_START_CAP);
1064 static void bc_char_vec_init(BcVec *v)
1066 bc_vec_init(v, sizeof(char), NULL);
1069 static void bc_vec_expand(BcVec *v, size_t req)
1072 v->v = xrealloc(v->v, v->size * req);
1077 static void bc_vec_npop(BcVec *v, size_t n)
1082 size_t len = v->len - n;
1083 while (v->len > len) v->dtor(v->v + (v->size * --v->len));
1087 static void bc_vec_pop_all(BcVec *v)
1089 bc_vec_npop(v, v->len);
1092 static void bc_vec_push(BcVec *v, const void *data)
1094 if (v->len + 1 > v->cap) bc_vec_grow(v, 1);
1095 memmove(v->v + (v->size * v->len), data, v->size);
1099 static void bc_vec_pushByte(BcVec *v, char data)
1101 bc_vec_push(v, &data);
1104 static void bc_vec_pushZeroByte(BcVec *v)
1106 //bc_vec_pushByte(v, '\0');
1108 bc_vec_push(v, &const_int_0);
1111 static void bc_vec_pushAt(BcVec *v, const void *data, size_t idx)
1114 bc_vec_push(v, data);
1119 if (v->len == v->cap) bc_vec_grow(v, 1);
1121 ptr = v->v + v->size * idx;
1123 memmove(ptr + v->size, ptr, v->size * (v->len++ - idx));
1124 memmove(ptr, data, v->size);
1128 static void bc_vec_string(BcVec *v, size_t len, const char *str)
1131 bc_vec_expand(v, len + 1);
1132 memcpy(v->v, str, len);
1135 bc_vec_pushZeroByte(v);
1138 static void bc_vec_concat(BcVec *v, const char *str)
1142 if (v->len == 0) bc_vec_pushZeroByte(v);
1144 len = v->len + strlen(str);
1146 if (v->cap < len) bc_vec_grow(v, len - v->len);
1152 static void *bc_vec_item(const BcVec *v, size_t idx)
1154 return v->v + v->size * idx;
1157 static void *bc_vec_item_rev(const BcVec *v, size_t idx)
1159 return v->v + v->size * (v->len - idx - 1);
1162 static void bc_vec_free(void *vec)
1164 BcVec *v = (BcVec *) vec;
1169 static int bc_id_cmp(const void *e1, const void *e2)
1171 return strcmp(((const BcId *) e1)->name, ((const BcId *) e2)->name);
1174 static void bc_id_free(void *id)
1176 free(((BcId *) id)->name);
1179 static size_t bc_map_find(const BcVec *v, const void *ptr)
1181 size_t low = 0, high = v->len;
1183 while (low < high) {
1185 size_t mid = (low + high) / 2;
1186 BcId *id = bc_vec_item(v, mid);
1187 int result = bc_id_cmp(ptr, id);
1191 else if (result < 0)
1200 static int bc_map_insert(BcVec *v, const void *ptr, size_t *i)
1202 size_t n = *i = bc_map_find(v, ptr);
1205 bc_vec_push(v, ptr);
1206 else if (!bc_id_cmp(ptr, bc_vec_item(v, n)))
1207 return 0; // "was not inserted"
1209 bc_vec_pushAt(v, ptr, n);
1210 return 1; // "was inserted"
1213 static size_t bc_map_index(const BcVec *v, const void *ptr)
1215 size_t i = bc_map_find(v, ptr);
1216 if (i >= v->len) return BC_VEC_INVALID_IDX;
1217 return bc_id_cmp(ptr, bc_vec_item(v, i)) ? BC_VEC_INVALID_IDX : i;
1220 static int push_input_byte(BcVec *vec, char c)
1222 if ((c < ' ' && c != '\t' && c != '\r' && c != '\n') // also allow '\v' '\f'?
1225 // Bad chars on this line, ignore entire line
1226 bc_error_fmt("illegal character 0x%02x", c);
1229 bc_vec_pushByte(vec, (char)c);
1233 static BcStatus bc_read_line(BcVec *vec, const char *prompt)
1237 if (G_posix) prompt = "";
1243 bc_vec_pop_all(vec);
1247 #if ENABLE_FEATURE_BC_SIGNALS
1248 if (bb_got_signal) { // ^C was pressed
1250 bb_got_signal = 0; // resets G_interrupt to zero
1252 ? "\ninterrupt (type \"quit\" to exit)\n"
1253 : "\ninterrupt (type \"q\" to exit)\n"
1256 # if ENABLE_FEATURE_EDITING
1259 # define line_buf bb_common_bufsiz1
1260 n = read_line_input(G.line_input_state, prompt, line_buf, COMMON_BUFSIZE);
1261 if (n <= 0) { // read errors or EOF, or ^D, or ^C
1271 bad_chars |= push_input_byte(vec, c);
1279 fputs(prompt, stderr);
1280 IF_FEATURE_BC_SIGNALS(errno = 0;)
1283 #if ENABLE_FEATURE_BC_SIGNALS && !ENABLE_FEATURE_EDITING
1284 // Both conditions appear simultaneously, check both just in case
1285 if (errno == EINTR || bb_got_signal) {
1293 quit(); // this emits error message
1295 // Note: EOF does not append '\n', therefore:
1296 // printf 'print 123\n' | bc - works
1297 // printf 'print 123' | bc - fails (syntax error)
1300 bad_chars |= push_input_byte(vec, c);
1301 } while (c != '\n');
1303 } while (bad_chars);
1305 bc_vec_pushZeroByte(vec);
1307 return BC_STATUS_SUCCESS;
1310 static char* bc_read_file(const char *path)
1313 size_t size = ((size_t) -1);
1316 buf = xmalloc_open_read_close(path, &size);
1318 for (i = 0; i < size; ++i) {
1320 if ((c < ' ' && c != '\t' && c != '\r' && c != '\n') // also allow '\v' '\f'?
1332 static void bc_num_setToZero(BcNum *n, size_t scale)
1339 static void bc_num_zero(BcNum *n)
1341 bc_num_setToZero(n, 0);
1344 static void bc_num_one(BcNum *n)
1346 bc_num_setToZero(n, 0);
1351 static void bc_num_ten(BcNum *n)
1353 bc_num_setToZero(n, 0);
1359 static void bc_num_init(BcNum *n, size_t req)
1361 req = req >= BC_NUM_DEF_SIZE ? req : BC_NUM_DEF_SIZE;
1362 memset(n, 0, sizeof(BcNum));
1363 n->num = xmalloc(req);
1367 static void bc_num_expand(BcNum *n, size_t req)
1369 req = req >= BC_NUM_DEF_SIZE ? req : BC_NUM_DEF_SIZE;
1371 n->num = xrealloc(n->num, req);
1376 static void bc_num_free(void *num)
1378 free(((BcNum *) num)->num);
1381 static void bc_num_copy(BcNum *d, BcNum *s)
1384 bc_num_expand(d, s->cap);
1388 memcpy(d->num, s->num, sizeof(BcDig) * d->len);
1392 static BcStatus bc_num_ulong(BcNum *n, unsigned long *result)
1397 if (n->neg) return bc_error("negative number");
1399 for (*result = 0, pow = 1, i = n->rdx; i < n->len; ++i) {
1401 unsigned long prev = *result, powprev = pow;
1403 *result += ((unsigned long) n->num[i]) * pow;
1406 if (*result < prev || pow < powprev)
1407 return bc_error("overflow");
1410 return BC_STATUS_SUCCESS;
1413 static void bc_num_ulong2num(BcNum *n, unsigned long val)
1421 if (val == 0) return;
1423 for (len = 1, i = ULONG_MAX; i != 0; i /= 10, ++len) bc_num_expand(n, len);
1424 for (ptr = n->num, i = 0; val; ++i, ++n->len, val /= 10) ptr[i] = val % 10;
1427 static void bc_num_subArrays(BcDig *restrict a, BcDig *restrict b,
1431 for (i = 0; i < len; ++i) {
1432 for (a[i] -= b[i], j = 0; a[i + j] < 0;) {
1439 static ssize_t bc_num_compare(BcDig *restrict a, BcDig *restrict b, size_t len)
1443 for (i = len - 1; i < len && !(c = a[i] - b[i]); --i);
1444 return BC_NUM_NEG(i + 1, c < 0);
1447 static ssize_t bc_num_cmp(BcNum *a, BcNum *b)
1449 size_t i, min, a_int, b_int, diff;
1450 BcDig *max_num, *min_num;
1451 bool a_max, neg = false;
1454 if (a == b) return 0;
1455 if (a->len == 0) return BC_NUM_NEG(!!b->len, !b->neg);
1456 if (b->len == 0) return BC_NUM_NEG(1, a->neg);
1466 a_int = BC_NUM_INT(a);
1467 b_int = BC_NUM_INT(b);
1469 a_max = (a->rdx > b->rdx);
1471 if (a_int != 0) return (ssize_t) a_int;
1475 diff = a->rdx - b->rdx;
1476 max_num = a->num + diff;
1481 diff = b->rdx - a->rdx;
1482 max_num = b->num + diff;
1486 cmp = bc_num_compare(max_num, min_num, b_int + min);
1487 if (cmp != 0) return BC_NUM_NEG(cmp, (!a_max) != neg);
1489 for (max_num -= diff, i = diff - 1; i < diff; --i) {
1490 if (max_num[i]) return BC_NUM_NEG(1, (!a_max) != neg);
1496 static void bc_num_truncate(BcNum *n, size_t places)
1498 if (places == 0) return;
1504 memmove(n->num, n->num + places, n->len * sizeof(BcDig));
1508 static void bc_num_extend(BcNum *n, size_t places)
1510 size_t len = n->len + places;
1514 if (n->cap < len) bc_num_expand(n, len);
1516 memmove(n->num + places, n->num, sizeof(BcDig) * n->len);
1517 memset(n->num, 0, sizeof(BcDig) * places);
1524 static void bc_num_clean(BcNum *n)
1526 while (n->len > 0 && n->num[n->len - 1] == 0) --n->len;
1529 else if (n->len < n->rdx)
1533 static void bc_num_retireMul(BcNum *n, size_t scale, bool neg1, bool neg2)
1536 bc_num_extend(n, scale - n->rdx);
1538 bc_num_truncate(n, n->rdx - scale);
1541 if (n->len != 0) n->neg = !neg1 != !neg2;
1544 static void bc_num_split(BcNum *restrict n, size_t idx, BcNum *restrict a,
1549 b->len = n->len - idx;
1551 a->rdx = b->rdx = 0;
1553 memcpy(b->num, n->num + idx, b->len * sizeof(BcDig));
1554 memcpy(a->num, n->num, idx * sizeof(BcDig));
1565 static BcStatus bc_num_shift(BcNum *n, size_t places)
1567 if (places == 0 || n->len == 0) return BC_STATUS_SUCCESS;
1568 if (places + n->len > BC_MAX_NUM)
1569 return bc_error("number too long: must be [1, BC_NUM_MAX]");
1571 if (n->rdx >= places)
1574 bc_num_extend(n, places - n->rdx);
1580 return BC_STATUS_SUCCESS;
1583 static BcStatus bc_num_inv(BcNum *a, BcNum *b, size_t scale)
1592 return bc_num_div(&one, a, b, scale);
1595 static BcStatus bc_num_a(BcNum *a, BcNum *b, BcNum *restrict c, size_t sub)
1597 BcDig *ptr, *ptr_a, *ptr_b, *ptr_c;
1598 size_t i, max, min_rdx, min_int, diff, a_int, b_int;
1601 // Because this function doesn't need to use scale (per the bc spec),
1602 // I am hijacking it to say whether it's doing an add or a subtract.
1606 if (sub && c->len) c->neg = !c->neg;
1607 return BC_STATUS_SUCCESS;
1609 else if (b->len == 0) {
1611 return BC_STATUS_SUCCESS;
1615 c->rdx = BC_MAX(a->rdx, b->rdx);
1616 min_rdx = BC_MIN(a->rdx, b->rdx);
1619 if (a->rdx > b->rdx) {
1620 diff = a->rdx - b->rdx;
1622 ptr_a = a->num + diff;
1626 diff = b->rdx - a->rdx;
1629 ptr_b = b->num + diff;
1632 for (ptr_c = c->num, i = 0; i < diff; ++i, ++c->len) ptr_c[i] = ptr[i];
1635 a_int = BC_NUM_INT(a);
1636 b_int = BC_NUM_INT(b);
1638 if (a_int > b_int) {
1649 for (carry = 0, i = 0; i < min_rdx + min_int; ++i, ++c->len) {
1650 in = ((int) ptr_a[i]) + ((int) ptr_b[i]) + carry;
1652 ptr_c[i] = (BcDig)(in % 10);
1655 for (; i < max + min_rdx; ++i, ++c->len) {
1656 in = ((int) ptr[i]) + carry;
1658 ptr_c[i] = (BcDig)(in % 10);
1661 if (carry != 0) c->num[c->len++] = (BcDig) carry;
1663 return BC_STATUS_SUCCESS; // can't make void, see bc_num_binary()
1666 static BcStatus bc_num_s(BcNum *a, BcNum *b, BcNum *restrict c, size_t sub)
1669 BcNum *minuend, *subtrahend;
1671 bool aneg, bneg, neg;
1673 // Because this function doesn't need to use scale (per the bc spec),
1674 // I am hijacking it to say whether it's doing an add or a subtract.
1678 if (sub && c->len) c->neg = !c->neg;
1679 return BC_STATUS_SUCCESS;
1681 else if (b->len == 0) {
1683 return BC_STATUS_SUCCESS;
1688 a->neg = b->neg = false;
1690 cmp = bc_num_cmp(a, b);
1696 bc_num_setToZero(c, BC_MAX(a->rdx, b->rdx));
1697 return BC_STATUS_SUCCESS;
1706 if (sub) neg = !neg;
1711 bc_num_copy(c, minuend);
1714 if (c->rdx < subtrahend->rdx) {
1715 bc_num_extend(c, subtrahend->rdx - c->rdx);
1719 start = c->rdx - subtrahend->rdx;
1721 bc_num_subArrays(c->num + start, subtrahend->num, subtrahend->len);
1725 return BC_STATUS_SUCCESS; // can't make void, see bc_num_binary()
1728 static BcStatus bc_num_k(BcNum *restrict a, BcNum *restrict b,
1732 size_t max = BC_MAX(a->len, b->len), max2 = (max + 1) / 2;
1733 BcNum l1, h1, l2, h2, m2, m1, z0, z1, z2, temp;
1736 if (a->len == 0 || b->len == 0) {
1738 return BC_STATUS_SUCCESS;
1740 aone = BC_NUM_ONE(a);
1741 if (aone || BC_NUM_ONE(b)) {
1742 bc_num_copy(c, aone ? b : a);
1743 return BC_STATUS_SUCCESS;
1746 if (a->len + b->len < BC_NUM_KARATSUBA_LEN ||
1747 a->len < BC_NUM_KARATSUBA_LEN || b->len < BC_NUM_KARATSUBA_LEN)
1752 bc_num_expand(c, a->len + b->len + 1);
1754 memset(c->num, 0, sizeof(BcDig) * c->cap);
1757 for (i = 0; i < b->len; ++i) {
1760 for (j = 0; j < a->len; ++j) {
1761 unsigned in = c->num[i + j];
1762 in += ((unsigned) a->num[j]) * ((unsigned) b->num[i]) + carry;
1763 // note: compilers prefer _unsigned_ div/const
1765 c->num[i + j] = (BcDig)(in % 10);
1768 c->num[i + j] += (BcDig) carry;
1769 len = BC_MAX(len, i + j + !!carry);
1772 // a*a <- without check below, this will not be interruptible
1773 if (G_interrupt) return BC_STATUS_FAILURE;
1778 return BC_STATUS_SUCCESS;
1781 bc_num_init(&l1, max);
1782 bc_num_init(&h1, max);
1783 bc_num_init(&l2, max);
1784 bc_num_init(&h2, max);
1785 bc_num_init(&m1, max);
1786 bc_num_init(&m2, max);
1787 bc_num_init(&z0, max);
1788 bc_num_init(&z1, max);
1789 bc_num_init(&z2, max);
1790 bc_num_init(&temp, max + max);
1792 bc_num_split(a, max2, &l1, &h1);
1793 bc_num_split(b, max2, &l2, &h2);
1795 s = bc_num_add(&h1, &l1, &m1, 0);
1797 s = bc_num_add(&h2, &l2, &m2, 0);
1800 s = bc_num_k(&h1, &h2, &z0);
1802 s = bc_num_k(&m1, &m2, &z1);
1804 s = bc_num_k(&l1, &l2, &z2);
1807 s = bc_num_sub(&z1, &z0, &temp, 0);
1809 s = bc_num_sub(&temp, &z2, &z1, 0);
1812 s = bc_num_shift(&z0, max2 * 2);
1814 s = bc_num_shift(&z1, max2);
1816 s = bc_num_add(&z0, &z1, &temp, 0);
1818 s = bc_num_add(&temp, &z2, c, 0);
1834 static BcStatus bc_num_m(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale)
1838 size_t maxrdx = BC_MAX(a->rdx, b->rdx);
1840 scale = BC_MAX(scale, a->rdx);
1841 scale = BC_MAX(scale, b->rdx);
1842 scale = BC_MIN(a->rdx + b->rdx, scale);
1843 maxrdx = BC_MAX(maxrdx, scale);
1845 bc_num_init(&cpa, a->len);
1846 bc_num_init(&cpb, b->len);
1848 bc_num_copy(&cpa, a);
1849 bc_num_copy(&cpb, b);
1850 cpa.neg = cpb.neg = false;
1852 s = bc_num_shift(&cpa, maxrdx);
1854 s = bc_num_shift(&cpb, maxrdx);
1856 s = bc_num_k(&cpa, &cpb, c);
1860 bc_num_expand(c, c->len + maxrdx);
1862 if (c->len < maxrdx) {
1863 memset(c->num + c->len, 0, (c->cap - c->len) * sizeof(BcDig));
1868 bc_num_retireMul(c, scale, a->neg, b->neg);
1876 static BcStatus bc_num_d(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale)
1878 BcStatus s = BC_STATUS_SUCCESS;
1885 return bc_error("divide by zero");
1886 else if (a->len == 0) {
1887 bc_num_setToZero(c, scale);
1888 return BC_STATUS_SUCCESS;
1890 else if (BC_NUM_ONE(b)) {
1892 bc_num_retireMul(c, scale, a->neg, b->neg);
1893 return BC_STATUS_SUCCESS;
1896 bc_num_init(&cp, BC_NUM_MREQ(a, b, scale));
1897 bc_num_copy(&cp, a);
1901 bc_num_expand(&cp, len + 2);
1902 bc_num_extend(&cp, len - cp.len);
1905 if (b->rdx > cp.rdx) bc_num_extend(&cp, b->rdx - cp.rdx);
1907 if (scale > cp.rdx) bc_num_extend(&cp, scale - cp.rdx);
1909 if (b->rdx == b->len) {
1910 for (i = 0; zero && i < len; ++i) zero = !b->num[len - i - 1];
1914 if (cp.cap == cp.len) bc_num_expand(&cp, cp.len + 1);
1916 // We want an extra zero in front to make things simpler.
1917 cp.num[cp.len++] = 0;
1920 bc_num_expand(c, cp.len);
1923 memset(c->num + end, 0, (c->cap - end) * sizeof(BcDig));
1928 for (i = end - 1; !s && i < end; --i) {
1930 for (q = 0; (!s && n[len] != 0) || bc_num_compare(n, p, len) >= 0; ++q)
1931 bc_num_subArrays(n, p, len);
1935 // 1/a <- without check below, this will not be interruptible
1937 s = BC_STATUS_FAILURE;
1942 bc_num_retireMul(c, scale, a->neg, b->neg);
1948 static BcStatus bc_num_r(BcNum *a, BcNum *b, BcNum *restrict c,
1949 BcNum *restrict d, size_t scale, size_t ts)
1956 return bc_error("divide by zero");
1959 bc_num_setToZero(d, ts);
1960 return BC_STATUS_SUCCESS;
1963 bc_num_init(&temp, d->cap);
1964 s = bc_num_d(a, b, c, scale);
1967 if (scale != 0) scale = ts;
1969 s = bc_num_m(c, b, &temp, scale);
1971 s = bc_num_sub(a, &temp, d, scale);
1974 if (ts > d->rdx && d->len) bc_num_extend(d, ts - d->rdx);
1977 bc_num_retireMul(d, ts, a->neg, b->neg);
1985 static BcStatus bc_num_rem(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale)
1989 size_t ts = BC_MAX(scale + b->rdx, a->rdx), len = BC_NUM_MREQ(a, b, ts);
1991 bc_num_init(&c1, len);
1992 s = bc_num_r(a, b, &c1, c, scale, ts);
1998 static BcStatus bc_num_p(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale)
2000 BcStatus s = BC_STATUS_SUCCESS;
2003 size_t i, powrdx, resrdx;
2006 if (b->rdx) return bc_error("non integer number");
2010 return BC_STATUS_SUCCESS;
2012 else if (a->len == 0) {
2013 bc_num_setToZero(c, scale);
2014 return BC_STATUS_SUCCESS;
2016 else if (BC_NUM_ONE(b)) {
2020 s = bc_num_inv(a, c, scale);
2027 s = bc_num_ulong(b, &pow);
2030 bc_num_init(©, a->len);
2031 bc_num_copy(©, a);
2033 if (!neg) scale = BC_MIN(a->rdx * pow, BC_MAX(scale, a->rdx));
2037 for (powrdx = a->rdx; !(pow & 1); pow >>= 1) {
2039 s = bc_num_mul(©, ©, ©, powrdx);
2041 // Not needed: bc_num_mul() has a check for ^C:
2042 //if (G_interrupt) {
2043 // s = BC_STATUS_FAILURE;
2048 bc_num_copy(c, ©);
2050 for (resrdx = powrdx, pow >>= 1; pow != 0; pow >>= 1) {
2053 s = bc_num_mul(©, ©, ©, powrdx);
2058 s = bc_num_mul(c, ©, c, resrdx);
2061 // Not needed: bc_num_mul() has a check for ^C:
2062 //if (G_interrupt) {
2063 // s = BC_STATUS_FAILURE;
2069 s = bc_num_inv(c, c, scale);
2073 if (c->rdx > scale) bc_num_truncate(c, c->rdx - scale);
2075 // We can't use bc_num_clean() here.
2076 for (zero = true, i = 0; zero && i < c->len; ++i) zero = !c->num[i];
2077 if (zero) bc_num_setToZero(c, scale);
2084 static BcStatus bc_num_binary(BcNum *a, BcNum *b, BcNum *c, size_t scale,
2085 BcNumBinaryOp op, size_t req)
2088 BcNum num2, *ptr_a, *ptr_b;
2093 memcpy(ptr_a, c, sizeof(BcNum));
2102 memcpy(ptr_b, c, sizeof(BcNum));
2110 bc_num_init(c, req);
2112 bc_num_expand(c, req);
2114 s = op(ptr_a, ptr_b, c, scale);
2116 if (init) bc_num_free(&num2);
2121 static bool bc_num_strValid(const char *val, size_t base)
2124 bool small, radix = false;
2125 size_t i, len = strlen(val);
2127 if (!len) return true;
2130 b = (BcDig)(small ? base + '0' : base - 10 + 'A');
2132 for (i = 0; i < len; ++i) {
2138 if (radix) return false;
2144 if (c < '0' || (small && c >= b) || (c > '9' && (c < 'A' || c >= b)))
2151 static void bc_num_parseDecimal(BcNum *n, const char *val)
2157 for (i = 0; val[i] == '0'; ++i);
2164 for (i = 0; zero && i < len; ++i) zero = val[i] == '0' || val[i] == '.';
2165 bc_num_expand(n, len);
2168 ptr = strchr(val, '.');
2172 n->rdx = (size_t)((val + len) - (ptr + 1));
2175 for (i = len - 1; i < len; ++n->len, i -= 1 + (i && val[i - 1] == '.'))
2176 n->num[n->len] = val[i] - '0';
2180 static void bc_num_parseBase(BcNum *n, const char *val, BcNum *base)
2183 BcNum temp, mult, result;
2187 size_t i, digits, len = strlen(val);
2191 for (i = 0; zero && i < len; ++i) zero = (val[i] == '.' || val[i] == '0');
2194 bc_num_init(&temp, BC_NUM_DEF_SIZE);
2195 bc_num_init(&mult, BC_NUM_DEF_SIZE);
2197 for (i = 0; i < len; ++i) {
2200 if (c == '.') break;
2202 v = (unsigned long) (c <= '9' ? c - '0' : c - 'A' + 10);
2204 s = bc_num_mul(n, base, &mult, 0);
2205 if (s) goto int_err;
2206 bc_num_ulong2num(&temp, v);
2207 s = bc_num_add(&mult, &temp, n, 0);
2208 if (s) goto int_err;
2213 if (c == 0) goto int_err;
2216 bc_num_init(&result, base->len);
2217 bc_num_zero(&result);
2220 for (i += 1, digits = 0; i < len; ++i, ++digits) {
2225 v = (unsigned long) (c <= '9' ? c - '0' : c - 'A' + 10);
2227 s = bc_num_mul(&result, base, &result, 0);
2229 bc_num_ulong2num(&temp, v);
2230 s = bc_num_add(&result, &temp, &result, 0);
2232 s = bc_num_mul(&mult, base, &mult, 0);
2236 s = bc_num_div(&result, &mult, &result, digits);
2238 s = bc_num_add(n, &result, n, digits);
2242 if (n->rdx < digits) bc_num_extend(n, digits - n->rdx);
2248 bc_num_free(&result);
2254 static void bc_num_printNewline(size_t *nchars, size_t line_len)
2256 if (*nchars == line_len - 1) {
2264 static void bc_num_printChar(size_t num, size_t width, bool radix,
2265 size_t *nchars, size_t line_len)
2267 (void) radix, (void) line_len;
2268 bb_putchar((char) num);
2269 *nchars = *nchars + width;
2273 static void bc_num_printDigits(size_t num, size_t width, bool radix,
2274 size_t *nchars, size_t line_len)
2278 bc_num_printNewline(nchars, line_len);
2279 bb_putchar(radix ? '.' : ' ');
2282 bc_num_printNewline(nchars, line_len);
2283 for (exp = 0, pow = 1; exp < width - 1; ++exp, pow *= 10)
2286 for (exp = 0; exp < width; pow /= 10, ++(*nchars), ++exp) {
2288 bc_num_printNewline(nchars, line_len);
2291 bb_putchar(((char) dig) + '0');
2295 static void bc_num_printHex(size_t num, size_t width, bool radix,
2296 size_t *nchars, size_t line_len)
2299 bc_num_printNewline(nchars, line_len);
2304 bc_num_printNewline(nchars, line_len);
2305 bb_putchar(bb_hexdigits_upcase[num]);
2306 *nchars = *nchars + width;
2309 static void bc_num_printDecimal(BcNum *n, size_t *nchars, size_t len)
2311 size_t i, rdx = n->rdx - 1;
2313 if (n->neg) bb_putchar('-');
2314 (*nchars) += n->neg;
2316 for (i = n->len - 1; i < n->len; --i)
2317 bc_num_printHex((size_t) n->num[i], 1, i == rdx, nchars, len);
2320 static BcStatus bc_num_printNum(BcNum *n, BcNum *base, size_t width,
2321 size_t *nchars, size_t len, BcNumDigitOp print)
2325 BcNum intp, fracp, digit, frac_len;
2326 unsigned long dig, *ptr;
2331 print(0, width, false, nchars, len);
2332 return BC_STATUS_SUCCESS;
2335 bc_vec_init(&stack, sizeof(long), NULL);
2336 bc_num_init(&intp, n->len);
2337 bc_num_init(&fracp, n->rdx);
2338 bc_num_init(&digit, width);
2339 bc_num_init(&frac_len, BC_NUM_INT(n));
2340 bc_num_copy(&intp, n);
2341 bc_num_one(&frac_len);
2343 bc_num_truncate(&intp, intp.rdx);
2344 s = bc_num_sub(n, &intp, &fracp, 0);
2347 while (intp.len != 0) {
2348 s = bc_num_divmod(&intp, base, &intp, &digit, 0);
2350 s = bc_num_ulong(&digit, &dig);
2352 bc_vec_push(&stack, &dig);
2355 for (i = 0; i < stack.len; ++i) {
2356 ptr = bc_vec_item_rev(&stack, i);
2357 print(*ptr, width, false, nchars, len);
2360 if (!n->rdx) goto err;
2362 for (radix = true; frac_len.len <= n->rdx; radix = false) {
2363 s = bc_num_mul(&fracp, base, &fracp, n->rdx);
2365 s = bc_num_ulong(&fracp, &dig);
2367 bc_num_ulong2num(&intp, dig);
2368 s = bc_num_sub(&fracp, &intp, &fracp, 0);
2370 print(dig, width, radix, nchars, len);
2371 s = bc_num_mul(&frac_len, base, &frac_len, 0);
2376 bc_num_free(&frac_len);
2377 bc_num_free(&digit);
2378 bc_num_free(&fracp);
2380 bc_vec_free(&stack);
2384 static BcStatus bc_num_printBase(BcNum *n, BcNum *base, size_t base_t,
2385 size_t *nchars, size_t line_len)
2392 if (neg) bb_putchar('-');
2397 if (base_t <= BC_NUM_MAX_IBASE) {
2399 print = bc_num_printHex;
2402 for (i = base_t - 1, width = 0; i != 0; i /= 10, ++width);
2403 print = bc_num_printDigits;
2406 s = bc_num_printNum(n, base, width, nchars, line_len, print);
2413 static BcStatus bc_num_stream(BcNum *n, BcNum *base, size_t *nchars, size_t len)
2415 return bc_num_printNum(n, base, 1, nchars, len, bc_num_printChar);
2419 static BcStatus bc_num_parse(BcNum *n, const char *val, BcNum *base,
2422 if (!bc_num_strValid(val, base_t))
2423 return bc_error("bad number string");
2426 bc_num_parseDecimal(n, val);
2428 bc_num_parseBase(n, val, base);
2430 return BC_STATUS_SUCCESS;
2433 static BcStatus bc_num_print(BcNum *n, BcNum *base, size_t base_t, bool newline,
2434 size_t *nchars, size_t line_len)
2436 BcStatus s = BC_STATUS_SUCCESS;
2438 bc_num_printNewline(nchars, line_len);
2444 else if (base_t == 10)
2445 bc_num_printDecimal(n, nchars, line_len);
2447 s = bc_num_printBase(n, base, base_t, nchars, line_len);
2457 static BcStatus bc_num_add(BcNum *a, BcNum *b, BcNum *c, size_t scale)
2459 BcNumBinaryOp op = (!a->neg == !b->neg) ? bc_num_a : bc_num_s;
2461 return bc_num_binary(a, b, c, false, op, BC_NUM_AREQ(a, b));
2464 static BcStatus bc_num_sub(BcNum *a, BcNum *b, BcNum *c, size_t scale)
2466 BcNumBinaryOp op = (!a->neg == !b->neg) ? bc_num_s : bc_num_a;
2468 return bc_num_binary(a, b, c, true, op, BC_NUM_AREQ(a, b));
2471 static BcStatus bc_num_mul(BcNum *a, BcNum *b, BcNum *c, size_t scale)
2473 size_t req = BC_NUM_MREQ(a, b, scale);
2474 return bc_num_binary(a, b, c, scale, bc_num_m, req);
2477 static BcStatus bc_num_div(BcNum *a, BcNum *b, BcNum *c, size_t scale)
2479 size_t req = BC_NUM_MREQ(a, b, scale);
2480 return bc_num_binary(a, b, c, scale, bc_num_d, req);
2483 static BcStatus bc_num_mod(BcNum *a, BcNum *b, BcNum *c, size_t scale)
2485 size_t req = BC_NUM_MREQ(a, b, scale);
2486 return bc_num_binary(a, b, c, scale, bc_num_rem, req);
2489 static BcStatus bc_num_pow(BcNum *a, BcNum *b, BcNum *c, size_t scale)
2491 return bc_num_binary(a, b, c, scale, bc_num_p, a->len * b->len + 1);
2494 static BcStatus bc_num_sqrt(BcNum *a, BcNum *restrict b, size_t scale)
2497 BcNum num1, num2, half, f, fprime, *x0, *x1, *temp;
2498 size_t pow, len, digs, digs1, resrdx, req, times = 0;
2499 ssize_t cmp = 1, cmp1 = SSIZE_MAX, cmp2 = SSIZE_MAX;
2501 req = BC_MAX(scale, a->rdx) + ((BC_NUM_INT(a) + 1) >> 1) + 1;
2502 bc_num_expand(b, req);
2505 bc_num_setToZero(b, scale);
2506 return BC_STATUS_SUCCESS;
2509 return bc_error("negative number");
2510 else if (BC_NUM_ONE(a)) {
2512 bc_num_extend(b, scale);
2513 return BC_STATUS_SUCCESS;
2516 scale = BC_MAX(scale, a->rdx) + 1;
2517 len = a->len + scale;
2519 bc_num_init(&num1, len);
2520 bc_num_init(&num2, len);
2521 bc_num_init(&half, BC_NUM_DEF_SIZE);
2527 bc_num_init(&f, len);
2528 bc_num_init(&fprime, len);
2534 pow = BC_NUM_INT(a);
2543 pow -= 2 - (pow & 1);
2545 bc_num_extend(x0, pow);
2547 // Make sure to move the radix back.
2551 x0->rdx = digs = digs1 = 0;
2553 len = BC_NUM_INT(x0) + resrdx - 1;
2555 while (cmp != 0 || digs < len) {
2557 s = bc_num_div(a, x0, &f, resrdx);
2559 s = bc_num_add(x0, &f, &fprime, resrdx);
2561 s = bc_num_mul(&fprime, &half, x1, resrdx);
2564 cmp = bc_num_cmp(x1, x0);
2565 digs = x1->len - (unsigned long long) llabs(cmp);
2567 if (cmp == cmp2 && digs == digs1)
2572 resrdx += times > 4;
2585 if (b->rdx > scale) bc_num_truncate(b, b->rdx - scale);
2588 bc_num_free(&fprime);
2596 static BcStatus bc_num_divmod(BcNum *a, BcNum *b, BcNum *c, BcNum *d,
2602 size_t ts = BC_MAX(scale + b->rdx, a->rdx), len = BC_NUM_MREQ(a, b, ts);
2605 memcpy(&num2, c, sizeof(BcNum));
2607 bc_num_init(c, len);
2612 bc_num_expand(c, len);
2615 s = bc_num_r(ptr_a, b, c, d, scale, ts);
2617 if (init) bc_num_free(&num2);
2623 static BcStatus bc_num_modexp(BcNum *a, BcNum *b, BcNum *c, BcNum *restrict d)
2626 BcNum base, exp, two, temp;
2629 return bc_error("divide by zero");
2630 if (a->rdx || b->rdx || c->rdx)
2631 return bc_error("non integer number");
2633 return bc_error("negative number");
2635 bc_num_expand(d, c->len);
2636 bc_num_init(&base, c->len);
2637 bc_num_init(&exp, b->len);
2638 bc_num_init(&two, BC_NUM_DEF_SIZE);
2639 bc_num_init(&temp, b->len);
2645 s = bc_num_rem(a, c, &base, 0);
2647 bc_num_copy(&exp, b);
2649 while (exp.len != 0) {
2651 s = bc_num_divmod(&exp, &two, &exp, &temp, 0);
2654 if (BC_NUM_ONE(&temp)) {
2655 s = bc_num_mul(d, &base, &temp, 0);
2657 s = bc_num_rem(&temp, c, d, 0);
2661 s = bc_num_mul(&base, &base, &temp, 0);
2663 s = bc_num_rem(&temp, c, &base, 0);
2676 static BcStatus bc_func_insert(BcFunc *f, char *name, bool var)
2681 for (i = 0; i < f->autos.len; ++i) {
2682 if (strcmp(name, ((BcId *) bc_vec_item(&f->autos, i))->name) == 0)
2683 return bc_error("function parameter or auto var has the same name as another");
2689 bc_vec_push(&f->autos, &a);
2691 return BC_STATUS_SUCCESS;
2694 static void bc_func_init(BcFunc *f)
2696 bc_char_vec_init(&f->code);
2697 bc_vec_init(&f->autos, sizeof(BcId), bc_id_free);
2698 bc_vec_init(&f->labels, sizeof(size_t), NULL);
2702 static void bc_func_free(void *func)
2704 BcFunc *f = (BcFunc *) func;
2705 bc_vec_free(&f->code);
2706 bc_vec_free(&f->autos);
2707 bc_vec_free(&f->labels);
2710 static void bc_array_expand(BcVec *a, size_t len);
2712 static void bc_array_init(BcVec *a, bool nums)
2715 bc_vec_init(a, sizeof(BcNum), bc_num_free);
2717 bc_vec_init(a, sizeof(BcVec), bc_vec_free);
2718 bc_array_expand(a, 1);
2721 static void bc_array_expand(BcVec *a, size_t len)
2725 if (a->size == sizeof(BcNum) && a->dtor == bc_num_free) {
2726 while (len > a->len) {
2727 bc_num_init(&data.n, BC_NUM_DEF_SIZE);
2728 bc_vec_push(a, &data.n);
2732 while (len > a->len) {
2733 bc_array_init(&data.v, true);
2734 bc_vec_push(a, &data.v);
2739 static void bc_array_copy(BcVec *d, const BcVec *s)
2744 bc_vec_expand(d, s->cap);
2747 for (i = 0; i < s->len; ++i) {
2748 BcNum *dnum = bc_vec_item(d, i), *snum = bc_vec_item(s, i);
2749 bc_num_init(dnum, snum->len);
2750 bc_num_copy(dnum, snum);
2754 static void bc_string_free(void *string)
2756 free(*((char **) string));
2760 static void bc_result_copy(BcResult *d, BcResult *src)
2766 case BC_RESULT_TEMP:
2767 case BC_RESULT_IBASE:
2768 case BC_RESULT_SCALE:
2769 case BC_RESULT_OBASE:
2771 bc_num_init(&d->d.n, src->d.n.len);
2772 bc_num_copy(&d->d.n, &src->d.n);
2777 case BC_RESULT_ARRAY:
2778 case BC_RESULT_ARRAY_ELEM:
2780 d->d.id.name = xstrdup(src->d.id.name);
2784 case BC_RESULT_CONSTANT:
2785 case BC_RESULT_LAST:
2789 memcpy(&d->d.n, &src->d.n, sizeof(BcNum));
2796 static void bc_result_free(void *result)
2798 BcResult *r = (BcResult *) result;
2802 case BC_RESULT_TEMP:
2803 case BC_RESULT_IBASE:
2804 case BC_RESULT_SCALE:
2805 case BC_RESULT_OBASE:
2807 bc_num_free(&r->d.n);
2812 case BC_RESULT_ARRAY:
2813 case BC_RESULT_ARRAY_ELEM:
2827 static void bc_lex_lineComment(BcLex *l)
2829 l->t.t = BC_LEX_WHITESPACE;
2830 while (l->i < l->len && l->buf[l->i++] != '\n');
2834 static void bc_lex_whitespace(BcLex *l)
2837 l->t.t = BC_LEX_WHITESPACE;
2838 for (c = l->buf[l->i]; c != '\n' && isspace(c); c = l->buf[++l->i]);
2841 static BcStatus bc_lex_number(BcLex *l, char start)
2843 const char *buf = l->buf + l->i;
2844 size_t len, hits = 0, bslashes = 0, i = 0, j;
2846 bool last_pt, pt = start == '.';
2849 l->t.t = BC_LEX_NUMBER;
2851 while (c != 0 && (isdigit(c) || (c >= 'A' && c <= 'F') ||
2852 (c == '.' && !pt) || (c == '\\' && buf[i + 1] == '\n')))
2866 len = i + !last_pt - bslashes * 2;
2867 if (len > BC_MAX_NUM)
2868 return bc_error("number too long: must be [1, BC_NUM_MAX]");
2870 bc_vec_pop_all(&l->t.v);
2871 bc_vec_expand(&l->t.v, len + 1);
2872 bc_vec_push(&l->t.v, &start);
2874 for (buf -= 1, j = 1; j < len + hits * 2; ++j) {
2878 // If we have hit a backslash, skip it. We don't have
2879 // to check for a newline because it's guaranteed.
2880 if (hits < bslashes && c == '\\') {
2886 bc_vec_push(&l->t.v, &c);
2889 bc_vec_pushZeroByte(&l->t.v);
2892 return BC_STATUS_SUCCESS;
2895 static BcStatus bc_lex_name(BcLex *l)
2898 const char *buf = l->buf + l->i - 1;
2901 l->t.t = BC_LEX_NAME;
2903 while ((c >= 'a' && c <= 'z') || isdigit(c) || c == '_') c = buf[++i];
2905 if (i > BC_MAX_STRING)
2906 return bc_error("name too long: must be [1, BC_NAME_MAX]");
2907 bc_vec_string(&l->t.v, i, buf);
2909 // Increment the index. We minus 1 because it has already been incremented.
2912 return BC_STATUS_SUCCESS;
2915 static void bc_lex_init(BcLex *l, BcLexNext next)
2918 bc_char_vec_init(&l->t.v);
2921 static void bc_lex_free(BcLex *l)
2923 bc_vec_free(&l->t.v);
2926 static void bc_lex_file(BcLex *l)
2928 G.err_line = l->line = 1;
2932 static BcStatus bc_lex_next(BcLex *l)
2937 if (l->t.last == BC_LEX_EOF) return bc_error("end of file");
2939 l->line += l->newline;
2940 G.err_line = l->line;
2941 l->t.t = BC_LEX_EOF;
2943 l->newline = (l->i == l->len);
2944 if (l->newline) return BC_STATUS_SUCCESS;
2946 // Loop until failure or we don't have whitespace. This
2947 // is so the parser doesn't get inundated with whitespace.
2950 } while (!s && l->t.t == BC_LEX_WHITESPACE);
2955 static BcStatus bc_lex_text(BcLex *l, const char *text)
2959 l->len = strlen(text);
2960 l->t.t = l->t.last = BC_LEX_INVALID;
2961 return bc_lex_next(l);
2965 static BcStatus bc_lex_identifier(BcLex *l)
2969 const char *buf = l->buf + l->i - 1;
2971 for (i = 0; i < ARRAY_SIZE(bc_lex_kws); ++i) {
2972 const char *keyword8 = bc_lex_kws[i].name8;
2974 while (buf[j] != '\0' && buf[j] == keyword8[j]) {
2976 if (j == 8) goto match;
2978 if (keyword8[j] != '\0')
2981 // buf starts with keyword bc_lex_kws[i]
2982 l->t.t = BC_LEX_KEY_1st_keyword + i;
2983 if (!((1 << i) & POSIX_KWORD_MASK)) {
2984 s = bc_posix_error_fmt("%sthe '%.8s' keyword", "POSIX does not allow ", bc_lex_kws[i].name8);
2988 // We minus 1 because the index has already been incremented.
2990 return BC_STATUS_SUCCESS;
2996 if (l->t.v.len > 2) {
2999 // bc: POSIX only allows one character names; the following is bad: 'qwe=1
3001 unsigned len = strchrnul(buf, '\n') - buf;
3002 s = bc_posix_error_fmt("POSIX only allows one character names; the following is bad: '%.*s'", len, buf);
3008 static BcStatus bc_lex_string(BcLex *l)
3010 size_t len, nls = 0, i = l->i;
3013 l->t.t = BC_LEX_STR;
3015 for (c = l->buf[i]; c != 0 && c != '"'; c = l->buf[++i]) nls += (c == '\n');
3019 return bc_error("string end could not be found");
3023 if (len > BC_MAX_STRING)
3024 return bc_error("string too long: must be [1, BC_STRING_MAX]");
3025 bc_vec_string(&l->t.v, len, l->buf + l->i);
3029 G.err_line = l->line;
3031 return BC_STATUS_SUCCESS;
3034 static void bc_lex_assign(BcLex *l, BcLexType with, BcLexType without)
3036 if (l->buf[l->i] == '=') {
3044 static BcStatus bc_lex_comment(BcLex *l)
3047 const char *buf = l->buf;
3049 l->t.t = BC_LEX_WHITESPACE;
3062 return bc_error("comment end could not be found");
3070 G.err_line = l->line;
3072 return BC_STATUS_SUCCESS;
3075 static BcStatus bc_lex_token(BcLex *l)
3077 BcStatus s = BC_STATUS_SUCCESS;
3078 char c = l->buf[l->i++], c2;
3080 // This is the workhorse of the lexer.
3087 l->t.t = !c ? BC_LEX_EOF : BC_LEX_NLINE;
3097 bc_lex_whitespace(l);
3103 bc_lex_assign(l, BC_LEX_OP_REL_NE, BC_LEX_OP_BOOL_NOT);
3105 if (l->t.t == BC_LEX_OP_BOOL_NOT) {
3106 s = bc_POSIX_does_not_allow_bool_ops_this_is_bad("!");
3115 s = bc_lex_string(l);
3121 s = bc_POSIX_does_not_allow("'#' script comments");
3124 bc_lex_lineComment(l);
3131 bc_lex_assign(l, BC_LEX_OP_ASSIGN_MODULUS, BC_LEX_OP_MODULUS);
3140 s = bc_POSIX_does_not_allow_bool_ops_this_is_bad("&&");
3144 l->t.t = BC_LEX_OP_BOOL_AND;
3147 l->t.t = BC_LEX_INVALID;
3148 s = bc_error_bad_character('&');
3157 l->t.t = (BcLexType)(c - '(' + BC_LEX_LPAREN);
3163 bc_lex_assign(l, BC_LEX_OP_ASSIGN_MULTIPLY, BC_LEX_OP_MULTIPLY);
3172 l->t.t = BC_LEX_OP_INC;
3175 bc_lex_assign(l, BC_LEX_OP_ASSIGN_PLUS, BC_LEX_OP_PLUS);
3181 l->t.t = BC_LEX_COMMA;
3190 l->t.t = BC_LEX_OP_DEC;
3193 bc_lex_assign(l, BC_LEX_OP_ASSIGN_MINUS, BC_LEX_OP_MINUS);
3199 if (isdigit(l->buf[l->i]))
3200 s = bc_lex_number(l, c);
3202 l->t.t = BC_LEX_KEY_LAST;
3203 s = bc_POSIX_does_not_allow("a period ('.') as a shortcut for the last result");
3212 s = bc_lex_comment(l);
3214 bc_lex_assign(l, BC_LEX_OP_ASSIGN_DIVIDE, BC_LEX_OP_DIVIDE);
3235 s = bc_lex_number(l, c);
3241 l->t.t = BC_LEX_SCOLON;
3247 bc_lex_assign(l, BC_LEX_OP_REL_LE, BC_LEX_OP_REL_LT);
3253 bc_lex_assign(l, BC_LEX_OP_REL_EQ, BC_LEX_OP_ASSIGN);
3259 bc_lex_assign(l, BC_LEX_OP_REL_GE, BC_LEX_OP_REL_GT);
3266 l->t.t = (BcLexType)(c - '[' + BC_LEX_LBRACKET);
3272 if (l->buf[l->i] == '\n') {
3273 l->t.t = BC_LEX_WHITESPACE;
3277 s = bc_error_bad_character(c);
3283 bc_lex_assign(l, BC_LEX_OP_ASSIGN_POWER, BC_LEX_OP_POWER);
3314 s = bc_lex_identifier(l);
3321 l->t.t = (BcLexType)(c - '{' + BC_LEX_LBRACE);
3330 s = bc_POSIX_does_not_allow_bool_ops_this_is_bad("||");
3334 l->t.t = BC_LEX_OP_BOOL_OR;
3337 l->t.t = BC_LEX_INVALID;
3338 s = bc_error_bad_character(c);
3346 l->t.t = BC_LEX_INVALID;
3347 s = bc_error_bad_character(c);
3357 static BcStatus dc_lex_register(BcLex *l)
3359 BcStatus s = BC_STATUS_SUCCESS;
3361 if (isspace(l->buf[l->i - 1])) {
3362 bc_lex_whitespace(l);
3365 s = bc_error("extended register");
3370 bc_vec_pop_all(&l->t.v);
3371 bc_vec_pushByte(&l->t.v, l->buf[l->i - 1]);
3372 bc_vec_pushZeroByte(&l->t.v);
3373 l->t.t = BC_LEX_NAME;
3379 static BcStatus dc_lex_string(BcLex *l)
3381 size_t depth = 1, nls = 0, i = l->i;
3384 l->t.t = BC_LEX_STR;
3385 bc_vec_pop_all(&l->t.v);
3387 for (c = l->buf[i]; c != 0 && depth; c = l->buf[++i]) {
3389 depth += (c == '[' && (i == l->i || l->buf[i - 1] != '\\'));
3390 depth -= (c == ']' && (i == l->i || l->buf[i - 1] != '\\'));
3393 if (depth) bc_vec_push(&l->t.v, &c);
3398 return bc_error("string end could not be found");
3401 bc_vec_pushZeroByte(&l->t.v);
3402 if (i - l->i > BC_MAX_STRING)
3403 return bc_error("string too long: must be [1, BC_STRING_MAX]");
3407 G.err_line = l->line;
3409 return BC_STATUS_SUCCESS;
3412 static BcStatus dc_lex_token(BcLex *l)
3414 BcStatus s = BC_STATUS_SUCCESS;
3415 char c = l->buf[l->i++], c2;
3418 for (i = 0; i < ARRAY_SIZE(dc_lex_regs); ++i) {
3419 if (l->t.last == dc_lex_regs[i])
3420 return dc_lex_register(l);
3423 if (c >= '%' && c <= '~' &&
3424 (l->t.t = dc_lex_tokens[(c - '%')]) != BC_LEX_INVALID)
3429 // This is the workhorse of the lexer.
3434 l->t.t = BC_LEX_EOF;
3445 l->newline = (c == '\n');
3446 bc_lex_whitespace(l);
3455 l->t.t = BC_LEX_OP_REL_NE;
3457 l->t.t = BC_LEX_OP_REL_LE;
3459 l->t.t = BC_LEX_OP_REL_GE;
3461 return bc_error_bad_character(c);
3469 bc_lex_lineComment(l);
3475 if (isdigit(l->buf[l->i]))
3476 s = bc_lex_number(l, c);
3478 s = bc_error_bad_character(c);
3499 s = bc_lex_number(l, c);
3505 s = dc_lex_string(l);
3511 l->t.t = BC_LEX_INVALID;
3512 s = bc_error_bad_character(c);
3521 static void bc_parse_addFunc(BcParse *p, char *name, size_t *idx)
3523 bc_program_addFunc(name, idx);
3524 p->func = bc_vec_item(&G.prog.fns, p->fidx);
3527 static void bc_parse_pushName(BcParse *p, char *name)
3529 size_t i = 0, len = strlen(name);
3531 for (; i < len; ++i) bc_parse_push(p, name[i]);
3532 bc_parse_push(p, BC_PARSE_STREND);
3537 static void bc_parse_pushIndex(BcParse *p, size_t idx)
3539 unsigned char amt, i, nums[sizeof(size_t)];
3541 for (amt = 0; idx; ++amt) {
3542 nums[amt] = (char) idx;
3543 idx = (idx & ((unsigned long) ~(UCHAR_MAX))) >> sizeof(char) * CHAR_BIT;
3546 bc_parse_push(p, amt);
3547 for (i = 0; i < amt; ++i) bc_parse_push(p, nums[i]);
3550 static void bc_parse_number(BcParse *p, BcInst *prev, size_t *nexs)
3552 char *num = xstrdup(p->l.t.v.v);
3553 size_t idx = G.prog.consts.len;
3555 bc_vec_push(&G.prog.consts, &num);
3557 bc_parse_push(p, BC_INST_NUM);
3558 bc_parse_pushIndex(p, idx);
3561 (*prev) = BC_INST_NUM;
3564 static BcStatus bc_parse_text(BcParse *p, const char *text)
3568 p->func = bc_vec_item(&G.prog.fns, p->fidx);
3570 if (!text[0] && !BC_PARSE_CAN_EXEC(p)) {
3571 p->l.t.t = BC_LEX_INVALID;
3574 if (!BC_PARSE_CAN_EXEC(p))
3575 return bc_error("file is not executable");
3578 return bc_lex_text(&p->l, text);
3581 // Called when bc/dc_parse_parse() detects a failure,
3582 // resets parsing structures.
3583 static void bc_parse_reset(BcParse *p)
3585 if (p->fidx != BC_PROG_MAIN) {
3586 p->func->nparams = 0;
3587 bc_vec_pop_all(&p->func->code);
3588 bc_vec_pop_all(&p->func->autos);
3589 bc_vec_pop_all(&p->func->labels);
3591 bc_parse_updateFunc(p, BC_PROG_MAIN);
3595 p->l.t.t = BC_LEX_EOF;
3596 p->auto_part = (p->nbraces = 0);
3598 bc_vec_npop(&p->flags, p->flags.len - 1);
3599 bc_vec_pop_all(&p->exits);
3600 bc_vec_pop_all(&p->conds);
3601 bc_vec_pop_all(&p->ops);
3606 static void bc_parse_free(BcParse *p)
3608 bc_vec_free(&p->flags);
3609 bc_vec_free(&p->exits);
3610 bc_vec_free(&p->conds);
3611 bc_vec_free(&p->ops);
3615 static void bc_parse_create(BcParse *p, size_t func,
3616 BcParseParse parse, BcLexNext next)
3618 memset(p, 0, sizeof(BcParse));
3620 bc_lex_init(&p->l, next);
3621 bc_vec_init(&p->flags, sizeof(uint8_t), NULL);
3622 bc_vec_init(&p->exits, sizeof(BcInstPtr), NULL);
3623 bc_vec_init(&p->conds, sizeof(size_t), NULL);
3624 bc_vec_pushZeroByte(&p->flags);
3625 bc_vec_init(&p->ops, sizeof(BcLexType), NULL);
3628 // p->auto_part = p->nbraces = 0; - already is
3629 bc_parse_updateFunc(p, func);
3634 #define BC_PARSE_TOP_OP(p) (*((BcLexType *) bc_vec_top(&(p)->ops)))
3635 #define BC_PARSE_LEAF(p, rparen) \
3636 (((p) >= BC_INST_NUM && (p) <= BC_INST_SQRT) || (rparen) || \
3637 (p) == BC_INST_INC_POST || (p) == BC_INST_DEC_POST)
3639 // We can calculate the conversion between tokens and exprs by subtracting the
3640 // position of the first operator in the lex enum and adding the position of the
3641 // first in the expr enum. Note: This only works for binary operators.
3642 #define BC_PARSE_TOKEN_INST(t) ((char) ((t) -BC_LEX_NEG + BC_INST_NEG))
3644 static BcStatus bc_parse_else(BcParse *p);
3645 static BcStatus bc_parse_stmt(BcParse *p);
3646 static BcStatus bc_parse_expr(BcParse *p, uint8_t flags, BcParseNext next);
3647 static BcStatus bc_parse_expr_empty_ok(BcParse *p, uint8_t flags, BcParseNext next);
3649 static BcStatus bc_parse_operator(BcParse *p, BcLexType type, size_t start,
3650 size_t *nexprs, bool next)
3652 BcStatus s = BC_STATUS_SUCCESS;
3654 char l, r = bc_parse_op_PREC(type - BC_LEX_OP_INC);
3655 bool left = bc_parse_op_LEFT(type - BC_LEX_OP_INC);
3657 while (p->ops.len > start) {
3659 t = BC_PARSE_TOP_OP(p);
3660 if (t == BC_LEX_LPAREN) break;
3662 l = bc_parse_op_PREC(t - BC_LEX_OP_INC);
3663 if (l >= r && (l != r || !left)) break;
3665 bc_parse_push(p, BC_PARSE_TOKEN_INST(t));
3666 bc_vec_pop(&p->ops);
3667 *nexprs -= t != BC_LEX_OP_BOOL_NOT && t != BC_LEX_NEG;
3670 bc_vec_push(&p->ops, &type);
3671 if (next) s = bc_lex_next(&p->l);
3676 static BcStatus bc_parse_rightParen(BcParse *p, size_t ops_bgn, size_t *nexs)
3680 if (p->ops.len <= ops_bgn)
3681 return bc_error_bad_expression();
3682 top = BC_PARSE_TOP_OP(p);
3684 while (top != BC_LEX_LPAREN) {
3686 bc_parse_push(p, BC_PARSE_TOKEN_INST(top));
3688 bc_vec_pop(&p->ops);
3689 *nexs -= top != BC_LEX_OP_BOOL_NOT && top != BC_LEX_NEG;
3691 if (p->ops.len <= ops_bgn)
3692 return bc_error_bad_expression();
3693 top = BC_PARSE_TOP_OP(p);
3696 bc_vec_pop(&p->ops);
3698 return bc_lex_next(&p->l);
3701 static BcStatus bc_parse_params(BcParse *p, uint8_t flags)
3707 s = bc_lex_next(&p->l);
3710 for (nparams = 0; p->l.t.t != BC_LEX_RPAREN; ++nparams) {
3712 flags = (flags & ~(BC_PARSE_PRINT | BC_PARSE_REL)) | BC_PARSE_ARRAY;
3713 s = bc_parse_expr(p, flags, bc_parse_next_param);
3716 comma = p->l.t.t == BC_LEX_COMMA;
3718 s = bc_lex_next(&p->l);
3723 if (comma) return bc_error_bad_token();
3724 bc_parse_push(p, BC_INST_CALL);
3725 bc_parse_pushIndex(p, nparams);
3727 return BC_STATUS_SUCCESS;
3730 static BcStatus bc_parse_call(BcParse *p, char *name, uint8_t flags)
3733 BcId entry, *entry_ptr;
3738 s = bc_parse_params(p, flags);
3741 if (p->l.t.t != BC_LEX_RPAREN) {
3742 s = bc_error_bad_token();
3746 idx = bc_map_index(&G.prog.fn_map, &entry);
3748 if (idx == BC_VEC_INVALID_IDX) {
3749 name = xstrdup(entry.name);
3750 bc_parse_addFunc(p, name, &idx);
3751 idx = bc_map_index(&G.prog.fn_map, &entry);
3757 entry_ptr = bc_vec_item(&G.prog.fn_map, idx);
3758 bc_parse_pushIndex(p, entry_ptr->idx);
3760 return bc_lex_next(&p->l);
3767 static BcStatus bc_parse_name(BcParse *p, BcInst *type, uint8_t flags)
3772 name = xstrdup(p->l.t.v.v);
3773 s = bc_lex_next(&p->l);
3776 if (p->l.t.t == BC_LEX_LBRACKET) {
3778 s = bc_lex_next(&p->l);
3781 if (p->l.t.t == BC_LEX_RBRACKET) {
3783 if (!(flags & BC_PARSE_ARRAY)) {
3784 s = bc_error_bad_expression();
3788 *type = BC_INST_ARRAY;
3792 *type = BC_INST_ARRAY_ELEM;
3794 flags &= ~(BC_PARSE_PRINT | BC_PARSE_REL);
3795 s = bc_parse_expr(p, flags, bc_parse_next_elem);
3799 s = bc_lex_next(&p->l);
3801 bc_parse_push(p, *type);
3802 bc_parse_pushName(p, name);
3804 else if (p->l.t.t == BC_LEX_LPAREN) {
3806 if (flags & BC_PARSE_NOCALL) {
3807 s = bc_error_bad_token();
3811 *type = BC_INST_CALL;
3812 s = bc_parse_call(p, name, flags);
3815 *type = BC_INST_VAR;
3816 bc_parse_push(p, BC_INST_VAR);
3817 bc_parse_pushName(p, name);
3827 static BcStatus bc_parse_read(BcParse *p)
3831 s = bc_lex_next(&p->l);
3833 if (p->l.t.t != BC_LEX_LPAREN) return bc_error_bad_token();
3835 s = bc_lex_next(&p->l);
3837 if (p->l.t.t != BC_LEX_RPAREN) return bc_error_bad_token();
3839 bc_parse_push(p, BC_INST_READ);
3841 return bc_lex_next(&p->l);
3844 static BcStatus bc_parse_builtin(BcParse *p, BcLexType type, uint8_t flags,
3849 s = bc_lex_next(&p->l);
3851 if (p->l.t.t != BC_LEX_LPAREN) return bc_error_bad_token();
3853 flags = (flags & ~(BC_PARSE_PRINT | BC_PARSE_REL)) | BC_PARSE_ARRAY;
3855 s = bc_lex_next(&p->l);
3858 s = bc_parse_expr(p, flags, bc_parse_next_rel);
3861 if (p->l.t.t != BC_LEX_RPAREN) return bc_error_bad_token();
3863 *prev = (type == BC_LEX_KEY_LENGTH) ? BC_INST_LENGTH : BC_INST_SQRT;
3864 bc_parse_push(p, *prev);
3866 return bc_lex_next(&p->l);
3869 static BcStatus bc_parse_scale(BcParse *p, BcInst *type, uint8_t flags)
3873 s = bc_lex_next(&p->l);
3876 if (p->l.t.t != BC_LEX_LPAREN) {
3877 *type = BC_INST_SCALE;
3878 bc_parse_push(p, BC_INST_SCALE);
3879 return BC_STATUS_SUCCESS;
3882 *type = BC_INST_SCALE_FUNC;
3883 flags &= ~(BC_PARSE_PRINT | BC_PARSE_REL);
3885 s = bc_lex_next(&p->l);
3888 s = bc_parse_expr(p, flags, bc_parse_next_rel);
3890 if (p->l.t.t != BC_LEX_RPAREN) return bc_error_bad_token();
3891 bc_parse_push(p, BC_INST_SCALE_FUNC);
3893 return bc_lex_next(&p->l);
3896 static BcStatus bc_parse_incdec(BcParse *p, BcInst *prev, bool *paren_expr,
3897 size_t *nexprs, uint8_t flags)
3902 BcInst etype = *prev;
3904 if (etype == BC_INST_VAR || etype == BC_INST_ARRAY_ELEM ||
3905 etype == BC_INST_SCALE || etype == BC_INST_LAST ||
3906 etype == BC_INST_IBASE || etype == BC_INST_OBASE)
3908 *prev = inst = BC_INST_INC_POST + (p->l.t.t != BC_LEX_OP_INC);
3909 bc_parse_push(p, inst);
3910 s = bc_lex_next(&p->l);
3914 *prev = inst = BC_INST_INC_PRE + (p->l.t.t != BC_LEX_OP_INC);
3917 s = bc_lex_next(&p->l);
3921 // Because we parse the next part of the expression
3922 // right here, we need to increment this.
3923 *nexprs = *nexprs + 1;
3929 s = bc_parse_name(p, prev, flags | BC_PARSE_NOCALL);
3933 case BC_LEX_KEY_IBASE:
3934 case BC_LEX_KEY_LAST:
3935 case BC_LEX_KEY_OBASE:
3937 bc_parse_push(p, type - BC_LEX_KEY_IBASE + BC_INST_IBASE);
3938 s = bc_lex_next(&p->l);
3942 case BC_LEX_KEY_SCALE:
3944 s = bc_lex_next(&p->l);
3946 if (p->l.t.t == BC_LEX_LPAREN)
3947 s = bc_error_bad_token();
3949 bc_parse_push(p, BC_INST_SCALE);
3955 s = bc_error_bad_token();
3960 if (!s) bc_parse_push(p, inst);
3966 static BcStatus bc_parse_minus(BcParse *p, BcInst *prev, size_t ops_bgn,
3967 bool rparen, size_t *nexprs)
3971 BcInst etype = *prev;
3973 s = bc_lex_next(&p->l);
3976 type = rparen || etype == BC_INST_INC_POST || etype == BC_INST_DEC_POST ||
3977 (etype >= BC_INST_NUM && etype <= BC_INST_SQRT) ?
3980 *prev = BC_PARSE_TOKEN_INST(type);
3982 // We can just push onto the op stack because this is the largest
3983 // precedence operator that gets pushed. Inc/dec does not.
3984 if (type != BC_LEX_OP_MINUS)
3985 bc_vec_push(&p->ops, &type);
3987 s = bc_parse_operator(p, type, ops_bgn, nexprs, false);
3992 static BcStatus bc_parse_string(BcParse *p, char inst)
3994 char *str = xstrdup(p->l.t.v.v);
3996 bc_parse_push(p, BC_INST_STR);
3997 bc_parse_pushIndex(p, G.prog.strs.len);
3998 bc_vec_push(&G.prog.strs, &str);
3999 bc_parse_push(p, inst);
4001 return bc_lex_next(&p->l);
4004 static BcStatus bc_parse_print(BcParse *p)
4010 s = bc_lex_next(&p->l);
4015 if (type == BC_LEX_SCOLON || type == BC_LEX_NLINE)
4016 return bc_error("bad print statement");
4018 while (!s && type != BC_LEX_SCOLON && type != BC_LEX_NLINE) {
4020 if (type == BC_LEX_STR)
4021 s = bc_parse_string(p, BC_INST_PRINT_POP);
4023 s = bc_parse_expr(p, 0, bc_parse_next_print);
4025 bc_parse_push(p, BC_INST_PRINT_POP);
4030 comma = p->l.t.t == BC_LEX_COMMA;
4031 if (comma) s = bc_lex_next(&p->l);
4036 if (comma) return bc_error_bad_token();
4038 return bc_lex_next(&p->l);
4041 static BcStatus bc_parse_return(BcParse *p)
4047 if (!BC_PARSE_FUNC(p)) return bc_error_bad_token();
4049 s = bc_lex_next(&p->l);
4053 paren = t == BC_LEX_LPAREN;
4055 if (t == BC_LEX_NLINE || t == BC_LEX_SCOLON)
4056 bc_parse_push(p, BC_INST_RET0);
4059 s = bc_parse_expr_empty_ok(p, 0, bc_parse_next_expr);
4060 if (s == BC_STATUS_PARSE_EMPTY_EXP) {
4061 bc_parse_push(p, BC_INST_RET0);
4062 s = bc_lex_next(&p->l);
4066 if (!paren || p->l.t.last != BC_LEX_RPAREN) {
4067 s = bc_POSIX_requires("parentheses around return expressions");
4071 bc_parse_push(p, BC_INST_RET);
4077 static BcStatus bc_parse_endBody(BcParse *p, bool brace)
4079 BcStatus s = BC_STATUS_SUCCESS;
4081 if (p->flags.len <= 1 || (brace && p->nbraces == 0))
4082 return bc_error_bad_token();
4086 if (p->l.t.t == BC_LEX_RBRACE) {
4087 if (!p->nbraces) return bc_error_bad_token();
4089 s = bc_lex_next(&p->l);
4093 return bc_error_bad_token();
4096 if (BC_PARSE_IF(p)) {
4100 while (p->l.t.t == BC_LEX_NLINE) {
4101 s = bc_lex_next(&p->l);
4105 bc_vec_pop(&p->flags);
4107 flag_ptr = BC_PARSE_TOP_FLAG_PTR(p);
4108 *flag_ptr = (*flag_ptr | BC_PARSE_FLAG_IF_END);
4110 if (p->l.t.t == BC_LEX_KEY_ELSE) s = bc_parse_else(p);
4112 else if (BC_PARSE_ELSE(p)) {
4117 bc_vec_pop(&p->flags);
4119 ip = bc_vec_top(&p->exits);
4120 label = bc_vec_item(&p->func->labels, ip->idx);
4121 *label = p->func->code.len;
4123 bc_vec_pop(&p->exits);
4125 else if (BC_PARSE_FUNC_INNER(p)) {
4126 bc_parse_push(p, BC_INST_RET0);
4127 bc_parse_updateFunc(p, BC_PROG_MAIN);
4128 bc_vec_pop(&p->flags);
4132 BcInstPtr *ip = bc_vec_top(&p->exits);
4133 size_t *label = bc_vec_top(&p->conds);
4135 bc_parse_push(p, BC_INST_JUMP);
4136 bc_parse_pushIndex(p, *label);
4138 label = bc_vec_item(&p->func->labels, ip->idx);
4139 *label = p->func->code.len;
4141 bc_vec_pop(&p->flags);
4142 bc_vec_pop(&p->exits);
4143 bc_vec_pop(&p->conds);
4149 static void bc_parse_startBody(BcParse *p, uint8_t flags)
4151 uint8_t *flag_ptr = BC_PARSE_TOP_FLAG_PTR(p);
4152 flags |= (*flag_ptr & (BC_PARSE_FLAG_FUNC | BC_PARSE_FLAG_LOOP));
4153 flags |= BC_PARSE_FLAG_BODY;
4154 bc_vec_push(&p->flags, &flags);
4157 static void bc_parse_noElse(BcParse *p)
4161 uint8_t *flag_ptr = BC_PARSE_TOP_FLAG_PTR(p);
4163 *flag_ptr = (*flag_ptr & ~(BC_PARSE_FLAG_IF_END));
4165 ip = bc_vec_top(&p->exits);
4166 label = bc_vec_item(&p->func->labels, ip->idx);
4167 *label = p->func->code.len;
4169 bc_vec_pop(&p->exits);
4172 static BcStatus bc_parse_if(BcParse *p)
4177 s = bc_lex_next(&p->l);
4179 if (p->l.t.t != BC_LEX_LPAREN) return bc_error_bad_token();
4181 s = bc_lex_next(&p->l);
4183 s = bc_parse_expr(p, BC_PARSE_REL, bc_parse_next_rel);
4185 if (p->l.t.t != BC_LEX_RPAREN) return bc_error_bad_token();
4187 s = bc_lex_next(&p->l);
4189 bc_parse_push(p, BC_INST_JUMP_ZERO);
4191 ip.idx = p->func->labels.len;
4192 ip.func = ip.len = 0;
4194 bc_parse_pushIndex(p, ip.idx);
4195 bc_vec_push(&p->exits, &ip);
4196 bc_vec_push(&p->func->labels, &ip.idx);
4197 bc_parse_startBody(p, BC_PARSE_FLAG_IF);
4199 return BC_STATUS_SUCCESS;
4202 static BcStatus bc_parse_else(BcParse *p)
4206 if (!BC_PARSE_IF_END(p)) return bc_error_bad_token();
4208 ip.idx = p->func->labels.len;
4209 ip.func = ip.len = 0;
4211 bc_parse_push(p, BC_INST_JUMP);
4212 bc_parse_pushIndex(p, ip.idx);
4216 bc_vec_push(&p->exits, &ip);
4217 bc_vec_push(&p->func->labels, &ip.idx);
4218 bc_parse_startBody(p, BC_PARSE_FLAG_ELSE);
4220 return bc_lex_next(&p->l);
4223 static BcStatus bc_parse_while(BcParse *p)
4228 s = bc_lex_next(&p->l);
4230 if (p->l.t.t != BC_LEX_LPAREN) return bc_error_bad_token();
4231 s = bc_lex_next(&p->l);
4234 ip.idx = p->func->labels.len;
4236 bc_vec_push(&p->func->labels, &p->func->code.len);
4237 bc_vec_push(&p->conds, &ip.idx);
4239 ip.idx = p->func->labels.len;
4243 bc_vec_push(&p->exits, &ip);
4244 bc_vec_push(&p->func->labels, &ip.idx);
4246 s = bc_parse_expr(p, BC_PARSE_REL, bc_parse_next_rel);
4248 if (p->l.t.t != BC_LEX_RPAREN) return bc_error_bad_token();
4249 s = bc_lex_next(&p->l);
4252 bc_parse_push(p, BC_INST_JUMP_ZERO);
4253 bc_parse_pushIndex(p, ip.idx);
4254 bc_parse_startBody(p, BC_PARSE_FLAG_LOOP | BC_PARSE_FLAG_LOOP_INNER);
4256 return BC_STATUS_SUCCESS;
4259 static BcStatus bc_parse_for(BcParse *p)
4263 size_t cond_idx, exit_idx, body_idx, update_idx;
4265 s = bc_lex_next(&p->l);
4267 if (p->l.t.t != BC_LEX_LPAREN) return bc_error_bad_token();
4268 s = bc_lex_next(&p->l);
4271 if (p->l.t.t != BC_LEX_SCOLON)
4272 s = bc_parse_expr(p, 0, bc_parse_next_for);
4274 s = bc_POSIX_does_not_allow_empty_X_expression_in_for("init");
4277 if (p->l.t.t != BC_LEX_SCOLON) return bc_error_bad_token();
4278 s = bc_lex_next(&p->l);
4281 cond_idx = p->func->labels.len;
4282 update_idx = cond_idx + 1;
4283 body_idx = update_idx + 1;
4284 exit_idx = body_idx + 1;
4286 bc_vec_push(&p->func->labels, &p->func->code.len);
4288 if (p->l.t.t != BC_LEX_SCOLON)
4289 s = bc_parse_expr(p, BC_PARSE_REL, bc_parse_next_for);
4291 s = bc_POSIX_does_not_allow_empty_X_expression_in_for("condition");
4294 if (p->l.t.t != BC_LEX_SCOLON) return bc_error_bad_token();
4296 s = bc_lex_next(&p->l);
4299 bc_parse_push(p, BC_INST_JUMP_ZERO);
4300 bc_parse_pushIndex(p, exit_idx);
4301 bc_parse_push(p, BC_INST_JUMP);
4302 bc_parse_pushIndex(p, body_idx);
4304 ip.idx = p->func->labels.len;
4306 bc_vec_push(&p->conds, &update_idx);
4307 bc_vec_push(&p->func->labels, &p->func->code.len);
4309 if (p->l.t.t != BC_LEX_RPAREN)
4310 s = bc_parse_expr(p, 0, bc_parse_next_rel);
4312 s = bc_POSIX_does_not_allow_empty_X_expression_in_for("update");
4316 if (p->l.t.t != BC_LEX_RPAREN) return bc_error_bad_token();
4317 bc_parse_push(p, BC_INST_JUMP);
4318 bc_parse_pushIndex(p, cond_idx);
4319 bc_vec_push(&p->func->labels, &p->func->code.len);
4325 bc_vec_push(&p->exits, &ip);
4326 bc_vec_push(&p->func->labels, &ip.idx);
4328 bc_parse_startBody(p, BC_PARSE_FLAG_LOOP | BC_PARSE_FLAG_LOOP_INNER);
4330 return BC_STATUS_SUCCESS;
4333 static BcStatus bc_parse_loopExit(BcParse *p, BcLexType type)
4339 if (!BC_PARSE_LOOP(p)) return bc_error_bad_token();
4341 if (type == BC_LEX_KEY_BREAK) {
4343 if (p->exits.len == 0) return bc_error_bad_token();
4345 i = p->exits.len - 1;
4346 ip = bc_vec_item(&p->exits, i);
4348 while (!ip->func && i < p->exits.len) ip = bc_vec_item(&p->exits, i--);
4349 if (i >= p->exits.len && !ip->func) return bc_error_bad_token();
4354 i = *((size_t *) bc_vec_top(&p->conds));
4356 bc_parse_push(p, BC_INST_JUMP);
4357 bc_parse_pushIndex(p, i);
4359 s = bc_lex_next(&p->l);
4362 if (p->l.t.t != BC_LEX_SCOLON && p->l.t.t != BC_LEX_NLINE)
4363 return bc_error_bad_token();
4365 return bc_lex_next(&p->l);
4368 static BcStatus bc_parse_func(BcParse *p)
4371 bool var, comma = false;
4375 s = bc_lex_next(&p->l);
4377 if (p->l.t.t != BC_LEX_NAME)
4378 return bc_error("bad function definition");
4380 name = xstrdup(p->l.t.v.v);
4381 bc_parse_addFunc(p, name, &p->fidx);
4383 s = bc_lex_next(&p->l);
4385 if (p->l.t.t != BC_LEX_LPAREN)
4386 return bc_error("bad function definition");
4387 s = bc_lex_next(&p->l);
4390 while (p->l.t.t != BC_LEX_RPAREN) {
4392 if (p->l.t.t != BC_LEX_NAME)
4393 return bc_error("bad function definition");
4397 name = xstrdup(p->l.t.v.v);
4398 s = bc_lex_next(&p->l);
4401 var = p->l.t.t != BC_LEX_LBRACKET;
4405 s = bc_lex_next(&p->l);
4408 if (p->l.t.t != BC_LEX_RBRACKET) {
4409 s = bc_error("bad function definition");
4413 s = bc_lex_next(&p->l);
4417 comma = p->l.t.t == BC_LEX_COMMA;
4419 s = bc_lex_next(&p->l);
4423 s = bc_func_insert(p->func, name, var);
4427 if (comma) return bc_error("bad function definition");
4429 flags = BC_PARSE_FLAG_FUNC | BC_PARSE_FLAG_FUNC_INNER | BC_PARSE_FLAG_BODY;
4430 bc_parse_startBody(p, flags);
4432 s = bc_lex_next(&p->l);
4435 if (p->l.t.t != BC_LEX_LBRACE)
4436 s = bc_POSIX_requires("the left brace be on the same line as the function header");
4445 static BcStatus bc_parse_auto(BcParse *p)
4448 bool comma, var, one;
4451 if (!p->auto_part) return bc_error_bad_token();
4452 s = bc_lex_next(&p->l);
4455 p->auto_part = comma = false;
4456 one = p->l.t.t == BC_LEX_NAME;
4458 while (p->l.t.t == BC_LEX_NAME) {
4460 name = xstrdup(p->l.t.v.v);
4461 s = bc_lex_next(&p->l);
4464 var = p->l.t.t != BC_LEX_LBRACKET;
4467 s = bc_lex_next(&p->l);
4470 if (p->l.t.t != BC_LEX_RBRACKET) {
4471 s = bc_error("bad function definition");
4475 s = bc_lex_next(&p->l);
4479 comma = p->l.t.t == BC_LEX_COMMA;
4481 s = bc_lex_next(&p->l);
4485 s = bc_func_insert(p->func, name, var);
4489 if (comma) return bc_error("bad function definition");
4490 if (!one) return bc_error("no auto variable found");
4492 if (p->l.t.t != BC_LEX_NLINE && p->l.t.t != BC_LEX_SCOLON)
4493 return bc_error_bad_token();
4495 return bc_lex_next(&p->l);
4502 static BcStatus bc_parse_body(BcParse *p, bool brace)
4504 BcStatus s = BC_STATUS_SUCCESS;
4505 uint8_t *flag_ptr = bc_vec_top(&p->flags);
4507 *flag_ptr &= ~(BC_PARSE_FLAG_BODY);
4509 if (*flag_ptr & BC_PARSE_FLAG_FUNC_INNER) {
4511 if (!brace) return bc_error_bad_token();
4512 p->auto_part = p->l.t.t != BC_LEX_KEY_AUTO;
4514 if (!p->auto_part) {
4515 s = bc_parse_auto(p);
4519 if (p->l.t.t == BC_LEX_NLINE) s = bc_lex_next(&p->l);
4522 s = bc_parse_stmt(p);
4523 if (!s && !brace) s = bc_parse_endBody(p, false);
4529 static BcStatus bc_parse_stmt(BcParse *p)
4531 BcStatus s = BC_STATUS_SUCCESS;
4537 return bc_lex_next(&p->l);
4540 case BC_LEX_KEY_ELSE:
4542 p->auto_part = false;
4548 if (!BC_PARSE_BODY(p)) return bc_error_bad_token();
4551 s = bc_lex_next(&p->l);
4554 return bc_parse_body(p, true);
4557 case BC_LEX_KEY_AUTO:
4559 return bc_parse_auto(p);
4564 p->auto_part = false;
4566 if (BC_PARSE_IF_END(p)) {
4568 return BC_STATUS_SUCCESS;
4570 else if (BC_PARSE_BODY(p))
4571 return bc_parse_body(p, false);
4581 case BC_LEX_OP_MINUS:
4582 case BC_LEX_OP_BOOL_NOT:
4586 case BC_LEX_KEY_IBASE:
4587 case BC_LEX_KEY_LAST:
4588 case BC_LEX_KEY_LENGTH:
4589 case BC_LEX_KEY_OBASE:
4590 case BC_LEX_KEY_READ:
4591 case BC_LEX_KEY_SCALE:
4592 case BC_LEX_KEY_SQRT:
4594 s = bc_parse_expr(p, BC_PARSE_PRINT, bc_parse_next_expr);
4598 case BC_LEX_KEY_ELSE:
4600 s = bc_parse_else(p);
4606 while (!s && p->l.t.t == BC_LEX_SCOLON) s = bc_lex_next(&p->l);
4612 s = bc_parse_endBody(p, true);
4618 s = bc_parse_string(p, BC_INST_PRINT_STR);
4622 case BC_LEX_KEY_BREAK:
4623 case BC_LEX_KEY_CONTINUE:
4625 s = bc_parse_loopExit(p, p->l.t.t);
4629 case BC_LEX_KEY_FOR:
4631 s = bc_parse_for(p);
4635 case BC_LEX_KEY_HALT:
4637 bc_parse_push(p, BC_INST_HALT);
4638 s = bc_lex_next(&p->l);
4648 case BC_LEX_KEY_LIMITS:
4650 // "limits" is a compile-time command,
4651 // the output is produced at _parse time_.
4652 s = bc_lex_next(&p->l);
4654 printf("BC_BASE_MAX = %u\n", BC_MAX_OBASE);
4655 printf("BC_DIM_MAX = %u\n", BC_MAX_DIM);
4656 printf("BC_SCALE_MAX = %u\n", BC_MAX_SCALE);
4657 printf("BC_STRING_MAX = %u\n", BC_MAX_STRING);
4658 printf("BC_NAME_MAX = %u\n", BC_MAX_NAME);
4659 printf("BC_NUM_MAX = %u\n", BC_MAX_NUM);
4660 printf("MAX Exponent = %lu\n", BC_MAX_EXP);
4661 printf("Number of vars = %lu\n", BC_MAX_VARS);
4665 case BC_LEX_KEY_PRINT:
4667 s = bc_parse_print(p);
4671 case BC_LEX_KEY_QUIT:
4673 // "quit" is a compile-time command. For example,
4674 // "if (0 == 1) quit" terminates when parsing the statement,
4675 // not when it is executed
4676 quit_or_return_for_exit();
4679 case BC_LEX_KEY_RETURN:
4681 s = bc_parse_return(p);
4685 case BC_LEX_KEY_WHILE:
4687 s = bc_parse_while(p);
4693 s = bc_error_bad_token();
4701 static BcStatus bc_parse_parse(BcParse *p)
4705 if (p->l.t.t == BC_LEX_EOF)
4706 s = p->flags.len > 0 ? bc_error("block end could not be found") : bc_error("end of file");
4707 else if (p->l.t.t == BC_LEX_KEY_DEFINE) {
4708 if (!BC_PARSE_CAN_EXEC(p)) return bc_error_bad_token();
4709 s = bc_parse_func(p);
4712 s = bc_parse_stmt(p);
4714 if (s || G_interrupt) {
4716 s = BC_STATUS_FAILURE;
4722 static BcStatus bc_parse_expr_empty_ok(BcParse *p, uint8_t flags, BcParseNext next)
4724 BcStatus s = BC_STATUS_SUCCESS;
4725 BcInst prev = BC_INST_PRINT;
4726 BcLexType top, t = p->l.t.t;
4727 size_t nexprs = 0, ops_bgn = p->ops.len;
4728 uint32_t i, nparens, nrelops;
4729 bool paren_first, paren_expr, rprn, done, get_token, assign, bin_last;
4731 paren_first = p->l.t.t == BC_LEX_LPAREN;
4732 nparens = nrelops = 0;
4733 paren_expr = rprn = done = get_token = assign = false;
4736 for (; !G_interrupt && !s && !done && bc_parse_exprs(t); t = p->l.t.t) {
4742 s = bc_parse_incdec(p, &prev, &paren_expr, &nexprs, flags);
4743 rprn = get_token = bin_last = false;
4747 case BC_LEX_OP_MINUS:
4749 s = bc_parse_minus(p, &prev, ops_bgn, rprn, &nexprs);
4750 rprn = get_token = false;
4751 bin_last = prev == BC_INST_MINUS;
4755 case BC_LEX_OP_ASSIGN_POWER:
4756 case BC_LEX_OP_ASSIGN_MULTIPLY:
4757 case BC_LEX_OP_ASSIGN_DIVIDE:
4758 case BC_LEX_OP_ASSIGN_MODULUS:
4759 case BC_LEX_OP_ASSIGN_PLUS:
4760 case BC_LEX_OP_ASSIGN_MINUS:
4761 case BC_LEX_OP_ASSIGN:
4763 if (prev != BC_INST_VAR && prev != BC_INST_ARRAY_ELEM &&
4764 prev != BC_INST_SCALE && prev != BC_INST_IBASE &&
4765 prev != BC_INST_OBASE && prev != BC_INST_LAST)
4767 s = bc_error("bad assignment:"
4768 " left side must be scale,"
4769 " ibase, obase, last, var,"
4776 case BC_LEX_OP_POWER:
4777 case BC_LEX_OP_MULTIPLY:
4778 case BC_LEX_OP_DIVIDE:
4779 case BC_LEX_OP_MODULUS:
4780 case BC_LEX_OP_PLUS:
4781 case BC_LEX_OP_REL_EQ:
4782 case BC_LEX_OP_REL_LE:
4783 case BC_LEX_OP_REL_GE:
4784 case BC_LEX_OP_REL_NE:
4785 case BC_LEX_OP_REL_LT:
4786 case BC_LEX_OP_REL_GT:
4787 case BC_LEX_OP_BOOL_NOT:
4788 case BC_LEX_OP_BOOL_OR:
4789 case BC_LEX_OP_BOOL_AND:
4791 if (((t == BC_LEX_OP_BOOL_NOT) != bin_last)
4792 || (t != BC_LEX_OP_BOOL_NOT && prev == BC_INST_BOOL_NOT)
4794 return bc_error_bad_expression();
4797 nrelops += t >= BC_LEX_OP_REL_EQ && t <= BC_LEX_OP_REL_GT;
4798 prev = BC_PARSE_TOKEN_INST(t);
4799 s = bc_parse_operator(p, t, ops_bgn, &nexprs, true);
4800 rprn = get_token = false;
4801 bin_last = t != BC_LEX_OP_BOOL_NOT;
4808 if (BC_PARSE_LEAF(prev, rprn))
4809 return bc_error_bad_expression();
4811 paren_expr = rprn = bin_last = false;
4813 bc_vec_push(&p->ops, &t);
4820 if (bin_last || prev == BC_INST_BOOL_NOT)
4821 return bc_error_bad_expression();
4824 s = BC_STATUS_SUCCESS;
4829 else if (!paren_expr)
4830 return BC_STATUS_PARSE_EMPTY_EXP;
4833 paren_expr = rprn = true;
4834 get_token = bin_last = false;
4836 s = bc_parse_rightParen(p, ops_bgn, &nexprs);
4843 if (BC_PARSE_LEAF(prev, rprn))
4844 return bc_error_bad_expression();
4846 rprn = get_token = bin_last = false;
4847 s = bc_parse_name(p, &prev, flags & ~BC_PARSE_NOCALL);
4855 if (BC_PARSE_LEAF(prev, rprn))
4856 return bc_error_bad_expression();
4857 bc_parse_number(p, &prev, &nexprs);
4858 paren_expr = get_token = true;
4859 rprn = bin_last = false;
4864 case BC_LEX_KEY_IBASE:
4865 case BC_LEX_KEY_LAST:
4866 case BC_LEX_KEY_OBASE:
4868 if (BC_PARSE_LEAF(prev, rprn))
4869 return bc_error_bad_expression();
4870 prev = (char) (t - BC_LEX_KEY_IBASE + BC_INST_IBASE);
4871 bc_parse_push(p, (char) prev);
4873 paren_expr = get_token = true;
4874 rprn = bin_last = false;
4880 case BC_LEX_KEY_LENGTH:
4881 case BC_LEX_KEY_SQRT:
4883 if (BC_PARSE_LEAF(prev, rprn))
4884 return bc_error_bad_expression();
4885 s = bc_parse_builtin(p, t, flags, &prev);
4887 rprn = get_token = bin_last = false;
4893 case BC_LEX_KEY_READ:
4895 if (BC_PARSE_LEAF(prev, rprn))
4896 return bc_error_bad_expression();
4897 else if (flags & BC_PARSE_NOREAD)
4898 s = bc_error_nested_read_call();
4900 s = bc_parse_read(p);
4903 rprn = get_token = bin_last = false;
4905 prev = BC_INST_READ;
4910 case BC_LEX_KEY_SCALE:
4912 if (BC_PARSE_LEAF(prev, rprn))
4913 return bc_error_bad_expression();
4914 s = bc_parse_scale(p, &prev, flags);
4916 rprn = get_token = bin_last = false;
4918 prev = BC_INST_SCALE;
4925 s = bc_error_bad_token();
4930 if (!s && get_token) s = bc_lex_next(&p->l);
4934 if (G_interrupt) return BC_STATUS_FAILURE; // ^C: stop parsing
4936 while (p->ops.len > ops_bgn) {
4938 top = BC_PARSE_TOP_OP(p);
4939 assign = top >= BC_LEX_OP_ASSIGN_POWER && top <= BC_LEX_OP_ASSIGN;
4941 if (top == BC_LEX_LPAREN || top == BC_LEX_RPAREN)
4942 return bc_error_bad_expression();
4944 bc_parse_push(p, BC_PARSE_TOKEN_INST(top));
4946 nexprs -= top != BC_LEX_OP_BOOL_NOT && top != BC_LEX_NEG;
4947 bc_vec_pop(&p->ops);
4950 if (prev == BC_INST_BOOL_NOT || nexprs != 1)
4951 return bc_error_bad_expression();
4953 for (i = 0; i < next.len; ++i)
4954 if (t == next.tokens[i])
4956 return bc_error_bad_expression();
4959 if (!(flags & BC_PARSE_REL) && nrelops) {
4960 s = bc_POSIX_does_not_allow("comparison operators outside if or loops");
4963 else if ((flags & BC_PARSE_REL) && nrelops > 1) {
4964 s = bc_POSIX_requires("exactly one comparison operator per condition");
4968 if (flags & BC_PARSE_PRINT) {
4969 if (paren_first || !assign) bc_parse_push(p, BC_INST_PRINT);
4970 bc_parse_push(p, BC_INST_POP);
4976 static BcStatus bc_parse_expr(BcParse *p, uint8_t flags, BcParseNext next)
4980 s = bc_parse_expr_empty_ok(p, flags, next);
4981 if (s == BC_STATUS_PARSE_EMPTY_EXP)
4982 return bc_error("empty expression");
4986 static void bc_parse_init(BcParse *p, size_t func)
4988 bc_parse_create(p, func, bc_parse_parse, bc_lex_token);
4991 static BcStatus bc_parse_expression(BcParse *p, uint8_t flags)
4993 return bc_parse_expr(p, flags, bc_parse_next_read);
5000 #define DC_PARSE_BUF_LEN ((int) (sizeof(uint32_t) * CHAR_BIT))
5002 static BcStatus dc_parse_register(BcParse *p)
5007 s = bc_lex_next(&p->l);
5009 if (p->l.t.t != BC_LEX_NAME) return bc_error_bad_token();
5011 name = xstrdup(p->l.t.v.v);
5012 bc_parse_pushName(p, name);
5017 static BcStatus dc_parse_string(BcParse *p)
5019 char *str, *name, b[DC_PARSE_BUF_LEN + 1];
5020 size_t idx, len = G.prog.strs.len;
5022 sprintf(b, "%0*zu", DC_PARSE_BUF_LEN, len);
5025 str = xstrdup(p->l.t.v.v);
5026 bc_parse_push(p, BC_INST_STR);
5027 bc_parse_pushIndex(p, len);
5028 bc_vec_push(&G.prog.strs, &str);
5029 bc_parse_addFunc(p, name, &idx);
5031 return bc_lex_next(&p->l);
5034 static BcStatus dc_parse_mem(BcParse *p, uint8_t inst, bool name, bool store)
5038 bc_parse_push(p, inst);
5040 s = dc_parse_register(p);
5045 bc_parse_push(p, BC_INST_SWAP);
5046 bc_parse_push(p, BC_INST_ASSIGN);
5047 bc_parse_push(p, BC_INST_POP);
5050 return bc_lex_next(&p->l);
5053 static BcStatus dc_parse_cond(BcParse *p, uint8_t inst)
5057 bc_parse_push(p, inst);
5058 bc_parse_push(p, BC_INST_EXEC_COND);
5060 s = dc_parse_register(p);
5063 s = bc_lex_next(&p->l);
5066 if (p->l.t.t == BC_LEX_ELSE) {
5067 s = dc_parse_register(p);
5069 s = bc_lex_next(&p->l);
5072 bc_parse_push(p, BC_PARSE_STREND);
5077 static BcStatus dc_parse_token(BcParse *p, BcLexType t, uint8_t flags)
5079 BcStatus s = BC_STATUS_SUCCESS;
5082 bool assign, get_token = false;
5086 case BC_LEX_OP_REL_EQ:
5087 case BC_LEX_OP_REL_LE:
5088 case BC_LEX_OP_REL_GE:
5089 case BC_LEX_OP_REL_NE:
5090 case BC_LEX_OP_REL_LT:
5091 case BC_LEX_OP_REL_GT:
5093 s = dc_parse_cond(p, t - BC_LEX_OP_REL_EQ + BC_INST_REL_EQ);
5100 s = dc_parse_mem(p, BC_INST_ARRAY_ELEM, true, t == BC_LEX_COLON);
5106 s = dc_parse_string(p);
5113 if (t == BC_LEX_NEG) {
5114 s = bc_lex_next(&p->l);
5116 if (p->l.t.t != BC_LEX_NUMBER)
5117 return bc_error_bad_token();
5120 bc_parse_number(p, &prev, &p->nbraces);
5122 if (t == BC_LEX_NEG) bc_parse_push(p, BC_INST_NEG);
5128 case BC_LEX_KEY_READ:
5130 if (flags & BC_PARSE_NOREAD)
5131 s = bc_error_nested_read_call();
5133 bc_parse_push(p, BC_INST_READ);
5138 case BC_LEX_OP_ASSIGN:
5139 case BC_LEX_STORE_PUSH:
5141 assign = t == BC_LEX_OP_ASSIGN;
5142 inst = assign ? BC_INST_VAR : BC_INST_PUSH_TO_VAR;
5143 s = dc_parse_mem(p, inst, true, assign);
5148 case BC_LEX_LOAD_POP:
5150 inst = t == BC_LEX_LOAD_POP ? BC_INST_PUSH_VAR : BC_INST_LOAD;
5151 s = dc_parse_mem(p, inst, true, false);
5155 case BC_LEX_STORE_IBASE:
5156 case BC_LEX_STORE_SCALE:
5157 case BC_LEX_STORE_OBASE:
5159 inst = t - BC_LEX_STORE_IBASE + BC_INST_IBASE;
5160 s = dc_parse_mem(p, inst, false, true);
5166 s = bc_error_bad_token();
5172 if (!s && get_token) s = bc_lex_next(&p->l);
5177 static BcStatus dc_parse_expr(BcParse *p, uint8_t flags)
5179 BcStatus s = BC_STATUS_SUCCESS;
5183 if (flags & BC_PARSE_NOCALL) p->nbraces = G.prog.results.len;
5185 for (t = p->l.t.t; !s && t != BC_LEX_EOF; t = p->l.t.t) {
5187 inst = dc_parse_insts[t];
5189 if (inst != BC_INST_INVALID) {
5190 bc_parse_push(p, inst);
5191 s = bc_lex_next(&p->l);
5194 s = dc_parse_token(p, t, flags);
5197 if (!s && p->l.t.t == BC_LEX_EOF && (flags & BC_PARSE_NOCALL))
5198 bc_parse_push(p, BC_INST_POP_EXEC);
5203 static BcStatus dc_parse_parse(BcParse *p)
5207 if (p->l.t.t == BC_LEX_EOF)
5208 s = bc_error("end of file");
5210 s = dc_parse_expr(p, 0);
5212 if (s || G_interrupt) {
5214 s = BC_STATUS_FAILURE;
5220 static void dc_parse_init(BcParse *p, size_t func)
5222 bc_parse_create(p, func, dc_parse_parse, dc_lex_token);
5227 static void common_parse_init(BcParse *p, size_t func)
5230 bc_parse_init(p, func);
5232 dc_parse_init(p, func);
5236 static BcStatus common_parse_expr(BcParse *p, uint8_t flags)
5239 return bc_parse_expression(p, flags);
5241 return dc_parse_expr(p, flags);
5245 static BcVec* bc_program_search(char *id, bool var)
5253 v = var ? &G.prog.vars : &G.prog.arrs;
5254 map = var ? &G.prog.var_map : &G.prog.arr_map;
5258 new = bc_map_insert(map, &e, &i); // 1 if insertion was successful
5261 bc_array_init(&data.v, var);
5262 bc_vec_push(v, &data.v);
5265 ptr = bc_vec_item(map, i);
5266 if (new) ptr->name = xstrdup(e.name);
5267 return bc_vec_item(v, ptr->idx);
5270 static BcStatus bc_program_num(BcResult *r, BcNum **num, bool hex)
5272 BcStatus s = BC_STATUS_SUCCESS;
5277 case BC_RESULT_TEMP:
5278 case BC_RESULT_IBASE:
5279 case BC_RESULT_SCALE:
5280 case BC_RESULT_OBASE:
5286 case BC_RESULT_CONSTANT:
5288 char **str = bc_vec_item(&G.prog.consts, r->d.id.idx);
5289 size_t base_t, len = strlen(*str);
5292 bc_num_init(&r->d.n, len);
5294 hex = hex && len == 1;
5295 base = hex ? &G.prog.hexb : &G.prog.ib;
5296 base_t = hex ? BC_NUM_MAX_IBASE : G.prog.ib_t;
5297 s = bc_num_parse(&r->d.n, *str, base, base_t);
5300 bc_num_free(&r->d.n);
5305 r->t = BC_RESULT_TEMP;
5311 case BC_RESULT_ARRAY:
5312 case BC_RESULT_ARRAY_ELEM:
5316 v = bc_program_search(r->d.id.name, r->t == BC_RESULT_VAR);
5318 if (r->t == BC_RESULT_ARRAY_ELEM) {
5320 if (v->len <= r->d.id.idx) bc_array_expand(v, r->d.id.idx + 1);
5321 *num = bc_vec_item(v, r->d.id.idx);
5324 *num = bc_vec_top(v);
5329 case BC_RESULT_LAST:
5331 *num = &G.prog.last;
5345 static BcStatus bc_program_binOpPrep(BcResult **l, BcNum **ln,
5346 BcResult **r, BcNum **rn, bool assign)
5350 BcResultType lt, rt;
5352 if (!BC_PROG_STACK(&G.prog.results, 2))
5353 return bc_error_stack_has_too_few_elements();
5355 *r = bc_vec_item_rev(&G.prog.results, 0);
5356 *l = bc_vec_item_rev(&G.prog.results, 1);
5360 hex = assign && (lt == BC_RESULT_IBASE || lt == BC_RESULT_OBASE);
5362 s = bc_program_num(*l, ln, false);
5364 s = bc_program_num(*r, rn, hex);
5367 // We run this again under these conditions in case any vector has been
5368 // reallocated out from under the BcNums or arrays we had.
5369 if (lt == rt && (lt == BC_RESULT_VAR || lt == BC_RESULT_ARRAY_ELEM)) {
5370 s = bc_program_num(*l, ln, false);
5374 if (!BC_PROG_NUM((*l), (*ln)) && (!assign || (*l)->t != BC_RESULT_VAR))
5375 return bc_error_variable_is_wrong_type();
5376 if (!assign && !BC_PROG_NUM((*r), (*ln)))
5377 return bc_error_variable_is_wrong_type();
5382 static void bc_program_binOpRetire(BcResult *r)
5384 r->t = BC_RESULT_TEMP;
5385 bc_vec_pop(&G.prog.results);
5386 bc_vec_pop(&G.prog.results);
5387 bc_vec_push(&G.prog.results, r);
5390 static BcStatus bc_program_prep(BcResult **r, BcNum **n)
5394 if (!BC_PROG_STACK(&G.prog.results, 1))
5395 return bc_error_stack_has_too_few_elements();
5396 *r = bc_vec_top(&G.prog.results);
5398 s = bc_program_num(*r, n, false);
5401 if (!BC_PROG_NUM((*r), (*n)))
5402 return bc_error_variable_is_wrong_type();
5407 static void bc_program_retire(BcResult *r, BcResultType t)
5410 bc_vec_pop(&G.prog.results);
5411 bc_vec_push(&G.prog.results, r);
5414 static BcStatus bc_program_op(char inst)
5417 BcResult *opd1, *opd2, res;
5418 BcNum *n1, *n2 = NULL;
5420 s = bc_program_binOpPrep(&opd1, &n1, &opd2, &n2, false);
5422 bc_num_init(&res.d.n, BC_NUM_DEF_SIZE);
5424 s = bc_program_ops[inst - BC_INST_POWER](n1, n2, &res.d.n, G.prog.scale);
5426 bc_program_binOpRetire(&res);
5431 bc_num_free(&res.d.n);
5435 static BcStatus bc_program_read(void)
5437 const char *sv_file;
5443 BcFunc *f = bc_vec_item(&G.prog.fns, BC_PROG_READ);
5445 for (i = 0; i < G.prog.stack.len; ++i) {
5446 BcInstPtr *ip_ptr = bc_vec_item(&G.prog.stack, i);
5447 if (ip_ptr->func == BC_PROG_READ)
5448 return bc_error_nested_read_call();
5451 bc_vec_pop_all(&f->code);
5452 bc_char_vec_init(&buf);
5454 sv_file = G.prog.file;
5457 s = bc_read_line(&buf, "read> ");
5460 common_parse_init(&parse, BC_PROG_READ);
5461 bc_lex_file(&parse.l);
5463 s = bc_parse_text(&parse, buf.v);
5464 if (s) goto exec_err;
5465 s = common_parse_expr(&parse, BC_PARSE_NOREAD);
5466 if (s) goto exec_err;
5468 if (parse.l.t.t != BC_LEX_NLINE && parse.l.t.t != BC_LEX_EOF) {
5469 s = bc_error("bad read() expression");
5473 ip.func = BC_PROG_READ;
5475 ip.len = G.prog.results.len;
5477 // Update this pointer, just in case.
5478 f = bc_vec_item(&G.prog.fns, BC_PROG_READ);
5480 bc_vec_pushByte(&f->code, BC_INST_POP_EXEC);
5481 bc_vec_push(&G.prog.stack, &ip);
5484 G.prog.file = sv_file;
5485 bc_parse_free(&parse);
5491 static size_t bc_program_index(char *code, size_t *bgn)
5493 char amt = code[(*bgn)++], i = 0;
5496 for (; i < amt; ++i, ++(*bgn))
5497 res |= (((size_t)((int) code[*bgn]) & UCHAR_MAX) << (i * CHAR_BIT));
5502 static char *bc_program_name(char *code, size_t *bgn)
5505 char c, *s, *str = code + *bgn, *ptr = strchr(str, BC_PARSE_STREND);
5507 s = xmalloc(ptr - str + 1);
5510 for (i = 0; c != 0 && c != BC_PARSE_STREND; c = code[(*bgn)++], ++i)
5518 static void bc_program_printString(const char *str, size_t *nchars)
5520 size_t i, len = strlen(str);
5529 for (i = 0; i < len; ++i, ++(*nchars)) {
5533 if (c != '\\' || i == len - 1)
5593 // Just print the backslash and following character.
5604 static BcStatus bc_program_print(char inst, size_t idx)
5606 BcStatus s = BC_STATUS_SUCCESS;
5611 bool pop = inst != BC_INST_PRINT;
5613 if (!BC_PROG_STACK(&G.prog.results, idx + 1))
5614 return bc_error_stack_has_too_few_elements();
5616 r = bc_vec_item_rev(&G.prog.results, idx);
5617 s = bc_program_num(r, &num, false);
5620 if (BC_PROG_NUM(r, num)) {
5621 s = bc_num_print(num, &G.prog.ob, G.prog.ob_t, !pop, &G.prog.nchars, G.prog.len);
5622 if (!s) bc_num_copy(&G.prog.last, num);
5626 idx = (r->t == BC_RESULT_STR) ? r->d.id.idx : num->rdx;
5627 str = *((char **) bc_vec_item(&G.prog.strs, idx));
5629 if (inst == BC_INST_PRINT_STR) {
5630 for (i = 0, len = strlen(str); i < len; ++i) {
5633 if (c == '\n') G.prog.nchars = SIZE_MAX;
5638 bc_program_printString(str, &G.prog.nchars);
5639 if (inst == BC_INST_PRINT) bb_putchar('\n');
5643 if (!s && pop) bc_vec_pop(&G.prog.results);
5648 static BcStatus bc_program_negate(void)
5654 s = bc_program_prep(&ptr, &num);
5657 bc_num_init(&res.d.n, num->len);
5658 bc_num_copy(&res.d.n, num);
5659 if (res.d.n.len) res.d.n.neg = !res.d.n.neg;
5661 bc_program_retire(&res, BC_RESULT_TEMP);
5666 static BcStatus bc_program_logical(char inst)
5669 BcResult *opd1, *opd2, res;
5674 s = bc_program_binOpPrep(&opd1, &n1, &opd2, &n2, false);
5676 bc_num_init(&res.d.n, BC_NUM_DEF_SIZE);
5678 if (inst == BC_INST_BOOL_AND)
5679 cond = bc_num_cmp(n1, &G.prog.zero) && bc_num_cmp(n2, &G.prog.zero);
5680 else if (inst == BC_INST_BOOL_OR)
5681 cond = bc_num_cmp(n1, &G.prog.zero) || bc_num_cmp(n2, &G.prog.zero);
5684 cmp = bc_num_cmp(n1, n2);
5688 case BC_INST_REL_EQ:
5694 case BC_INST_REL_LE:
5700 case BC_INST_REL_GE:
5706 case BC_INST_REL_NE:
5712 case BC_INST_REL_LT:
5718 case BC_INST_REL_GT:
5726 (cond ? bc_num_one : bc_num_zero)(&res.d.n);
5728 bc_program_binOpRetire(&res);
5734 static BcStatus bc_program_assignStr(BcResult *r, BcVec *v,
5740 memset(&n2, 0, sizeof(BcNum));
5741 n2.rdx = res.d.id.idx = r->d.id.idx;
5742 res.t = BC_RESULT_STR;
5745 if (!BC_PROG_STACK(&G.prog.results, 2))
5746 return bc_error_stack_has_too_few_elements();
5748 bc_vec_pop(&G.prog.results);
5751 bc_vec_pop(&G.prog.results);
5753 bc_vec_push(&G.prog.results, &res);
5754 bc_vec_push(v, &n2);
5756 return BC_STATUS_SUCCESS;
5760 static BcStatus bc_program_copyToVar(char *name, bool var)
5767 if (!BC_PROG_STACK(&G.prog.results, 1))
5768 return bc_error_stack_has_too_few_elements();
5770 ptr = bc_vec_top(&G.prog.results);
5771 if ((ptr->t == BC_RESULT_ARRAY) != !var)
5772 return bc_error_variable_is_wrong_type();
5773 v = bc_program_search(name, var);
5776 if (ptr->t == BC_RESULT_STR && !var)
5777 return bc_error_variable_is_wrong_type();
5778 if (ptr->t == BC_RESULT_STR) return bc_program_assignStr(ptr, v, true);
5781 s = bc_program_num(ptr, &n, false);
5784 // Do this once more to make sure that pointers were not invalidated.
5785 v = bc_program_search(name, var);
5788 bc_num_init(&r.d.n, BC_NUM_DEF_SIZE);
5789 bc_num_copy(&r.d.n, n);
5792 bc_array_init(&r.d.v, true);
5793 bc_array_copy(&r.d.v, (BcVec *) n);
5796 bc_vec_push(v, &r.d);
5797 bc_vec_pop(&G.prog.results);
5802 static BcStatus bc_program_assign(char inst)
5805 BcResult *left, *right, res;
5806 BcNum *l = NULL, *r = NULL;
5807 unsigned long val, max;
5808 bool assign = inst == BC_INST_ASSIGN, ib, sc;
5810 s = bc_program_binOpPrep(&left, &l, &right, &r, assign);
5813 ib = left->t == BC_RESULT_IBASE;
5814 sc = left->t == BC_RESULT_SCALE;
5818 if (right->t == BC_RESULT_STR) {
5822 if (left->t != BC_RESULT_VAR)
5823 return bc_error_variable_is_wrong_type();
5824 v = bc_program_search(left->d.id.name, true);
5826 return bc_program_assignStr(right, v, false);
5830 if (left->t == BC_RESULT_CONSTANT || left->t == BC_RESULT_TEMP)
5831 return bc_error("bad assignment:"
5832 " left side must be scale,"
5833 " ibase, obase, last, var,"
5838 if (inst == BC_INST_ASSIGN_DIVIDE && !bc_num_cmp(r, &G.prog.zero))
5839 return bc_error("divide by zero");
5844 s = bc_program_ops[inst - BC_INST_ASSIGN_POWER](l, r, l, G.prog.scale);
5851 if (ib || sc || left->t == BC_RESULT_OBASE) {
5852 static const char *const msg[] = {
5853 "bad ibase; must be [2, 16]", //BC_RESULT_IBASE
5854 "bad scale; must be [0, BC_SCALE_MAX]", //BC_RESULT_SCALE
5855 NULL, //can't happen //BC_RESULT_LAST
5856 NULL, //can't happen //BC_RESULT_CONSTANT
5857 NULL, //can't happen //BC_RESULT_ONE
5858 "bad obase; must be [2, BC_BASE_MAX]", //BC_RESULT_OBASE
5862 s = bc_num_ulong(l, &val);
5865 s = left->t - BC_RESULT_IBASE;
5868 ptr = &G.prog.scale;
5871 if (val < BC_NUM_MIN_BASE)
5872 return bc_error(msg[s]);
5873 max = ib ? BC_NUM_MAX_IBASE : BC_MAX_OBASE;
5874 ptr = ib ? &G.prog.ib_t : &G.prog.ob_t;
5878 return bc_error(msg[s]);
5880 bc_num_copy(ib ? &G.prog.ib : &G.prog.ob, l);
5882 *ptr = (size_t) val;
5883 s = BC_STATUS_SUCCESS;
5886 bc_num_init(&res.d.n, l->len);
5887 bc_num_copy(&res.d.n, l);
5888 bc_program_binOpRetire(&res);
5894 #define bc_program_pushVar(code, bgn, pop, copy) \
5895 bc_program_pushVar(code, bgn)
5896 // for bc, 'pop' and 'copy' are always false
5898 static BcStatus bc_program_pushVar(char *code, size_t *bgn,
5899 bool pop, bool copy)
5901 BcStatus s = BC_STATUS_SUCCESS;
5903 char *name = bc_program_name(code, bgn);
5905 r.t = BC_RESULT_VAR;
5910 BcVec *v = bc_program_search(name, true);
5911 BcNum *num = bc_vec_top(v);
5915 if (!BC_PROG_STACK(v, 2 - copy)) {
5917 return bc_error_stack_has_too_few_elements();
5923 if (!BC_PROG_STR(num)) {
5925 r.t = BC_RESULT_TEMP;
5927 bc_num_init(&r.d.n, BC_NUM_DEF_SIZE);
5928 bc_num_copy(&r.d.n, num);
5931 r.t = BC_RESULT_STR;
5932 r.d.id.idx = num->rdx;
5935 if (!copy) bc_vec_pop(v);
5940 bc_vec_push(&G.prog.results, &r);
5945 static BcStatus bc_program_pushArray(char *code, size_t *bgn,
5948 BcStatus s = BC_STATUS_SUCCESS;
5952 r.d.id.name = bc_program_name(code, bgn);
5954 if (inst == BC_INST_ARRAY) {
5955 r.t = BC_RESULT_ARRAY;
5956 bc_vec_push(&G.prog.results, &r);
5963 s = bc_program_prep(&operand, &num);
5965 s = bc_num_ulong(num, &temp);
5968 if (temp > BC_MAX_DIM) {
5969 s = bc_error("array too long; must be [1, BC_DIM_MAX]");
5973 r.d.id.idx = (size_t) temp;
5974 bc_program_retire(&r, BC_RESULT_ARRAY_ELEM);
5978 if (s) free(r.d.id.name);
5983 static BcStatus bc_program_incdec(char inst)
5986 BcResult *ptr, res, copy;
5990 s = bc_program_prep(&ptr, &num);
5993 if (inst == BC_INST_INC_POST || inst == BC_INST_DEC_POST) {
5994 copy.t = BC_RESULT_TEMP;
5995 bc_num_init(©.d.n, num->len);
5996 bc_num_copy(©.d.n, num);
5999 res.t = BC_RESULT_ONE;
6000 inst = inst == BC_INST_INC_PRE || inst == BC_INST_INC_POST ?
6001 BC_INST_ASSIGN_PLUS :
6002 BC_INST_ASSIGN_MINUS;
6004 bc_vec_push(&G.prog.results, &res);
6005 bc_program_assign(inst);
6007 if (inst2 == BC_INST_INC_POST || inst2 == BC_INST_DEC_POST) {
6008 bc_vec_pop(&G.prog.results);
6009 bc_vec_push(&G.prog.results, ©);
6015 static BcStatus bc_program_call(char *code, size_t *idx)
6017 BcStatus s = BC_STATUS_SUCCESS;
6019 size_t i, nparams = bc_program_index(code, idx);
6026 ip.func = bc_program_index(code, idx);
6027 func = bc_vec_item(&G.prog.fns, ip.func);
6029 if (func->code.len == 0) {
6030 return bc_error("undefined function");
6032 if (nparams != func->nparams) {
6033 return bc_error_fmt("function has %u parameters, but called with %u", func->nparams, nparams);
6035 ip.len = G.prog.results.len - nparams;
6037 for (i = 0; i < nparams; ++i) {
6039 a = bc_vec_item(&func->autos, nparams - 1 - i);
6040 arg = bc_vec_top(&G.prog.results);
6042 if ((!a->idx) != (arg->t == BC_RESULT_ARRAY) || arg->t == BC_RESULT_STR)
6043 return bc_error_variable_is_wrong_type();
6045 s = bc_program_copyToVar(a->name, a->idx);
6049 for (; i < func->autos.len; ++i) {
6052 a = bc_vec_item(&func->autos, i);
6053 v = bc_program_search(a->name, a->idx);
6056 bc_num_init(¶m.n, BC_NUM_DEF_SIZE);
6057 bc_vec_push(v, ¶m.n);
6060 bc_array_init(¶m.v, true);
6061 bc_vec_push(v, ¶m.v);
6065 bc_vec_push(&G.prog.stack, &ip);
6067 return BC_STATUS_SUCCESS;
6070 static BcStatus bc_program_return(char inst)
6076 BcInstPtr *ip = bc_vec_top(&G.prog.stack);
6078 if (!BC_PROG_STACK(&G.prog.results, ip->len + inst == BC_INST_RET))
6079 return bc_error_stack_has_too_few_elements();
6081 f = bc_vec_item(&G.prog.fns, ip->func);
6082 res.t = BC_RESULT_TEMP;
6084 if (inst == BC_INST_RET) {
6087 BcResult *operand = bc_vec_top(&G.prog.results);
6089 s = bc_program_num(operand, &num, false);
6091 bc_num_init(&res.d.n, num->len);
6092 bc_num_copy(&res.d.n, num);
6095 bc_num_init(&res.d.n, BC_NUM_DEF_SIZE);
6096 bc_num_zero(&res.d.n);
6099 // We need to pop arguments as well, so this takes that into account.
6100 for (i = 0; i < f->autos.len; ++i) {
6103 BcId *a = bc_vec_item(&f->autos, i);
6105 v = bc_program_search(a->name, a->idx);
6109 bc_vec_npop(&G.prog.results, G.prog.results.len - ip->len);
6110 bc_vec_push(&G.prog.results, &res);
6111 bc_vec_pop(&G.prog.stack);
6113 return BC_STATUS_SUCCESS;
6117 static unsigned long bc_program_scale(BcNum *n)
6119 return (unsigned long) n->rdx;
6122 static unsigned long bc_program_len(BcNum *n)
6124 unsigned long len = n->len;
6127 if (n->rdx != n->len) return len;
6128 for (i = n->len - 1; i < n->len && n->num[i] == 0; --len, --i);
6133 static BcStatus bc_program_builtin(char inst)
6139 bool len = inst == BC_INST_LENGTH;
6141 if (!BC_PROG_STACK(&G.prog.results, 1))
6142 return bc_error_stack_has_too_few_elements();
6143 opnd = bc_vec_top(&G.prog.results);
6145 s = bc_program_num(opnd, &num, false);
6149 if (!BC_PROG_NUM(opnd, num) && !len)
6150 return bc_error_variable_is_wrong_type();
6153 bc_num_init(&res.d.n, BC_NUM_DEF_SIZE);
6155 if (inst == BC_INST_SQRT) s = bc_num_sqrt(num, &res.d.n, G.prog.scale);
6157 else if (len != 0 && opnd->t == BC_RESULT_ARRAY) {
6158 bc_num_ulong2num(&res.d.n, (unsigned long) ((BcVec *) num)->len);
6162 else if (len != 0 && !BC_PROG_NUM(opnd, num)) {
6165 size_t idx = opnd->t == BC_RESULT_STR ? opnd->d.id.idx : num->rdx;
6167 str = bc_vec_item(&G.prog.strs, idx);
6168 bc_num_ulong2num(&res.d.n, strlen(*str));
6172 BcProgramBuiltIn f = len ? bc_program_len : bc_program_scale;
6173 bc_num_ulong2num(&res.d.n, f(num));
6176 bc_program_retire(&res, BC_RESULT_TEMP);
6182 static BcStatus bc_program_divmod(void)
6185 BcResult *opd1, *opd2, res, res2;
6186 BcNum *n1, *n2 = NULL;
6188 s = bc_program_binOpPrep(&opd1, &n1, &opd2, &n2, false);
6191 bc_num_init(&res.d.n, BC_NUM_DEF_SIZE);
6192 bc_num_init(&res2.d.n, n2->len);
6194 s = bc_num_divmod(n1, n2, &res2.d.n, &res.d.n, G.prog.scale);
6197 bc_program_binOpRetire(&res2);
6198 res.t = BC_RESULT_TEMP;
6199 bc_vec_push(&G.prog.results, &res);
6204 bc_num_free(&res2.d.n);
6205 bc_num_free(&res.d.n);
6209 static BcStatus bc_program_modexp(void)
6212 BcResult *r1, *r2, *r3, res;
6213 BcNum *n1, *n2, *n3;
6215 if (!BC_PROG_STACK(&G.prog.results, 3))
6216 return bc_error_stack_has_too_few_elements();
6217 s = bc_program_binOpPrep(&r2, &n2, &r3, &n3, false);
6220 r1 = bc_vec_item_rev(&G.prog.results, 2);
6221 s = bc_program_num(r1, &n1, false);
6223 if (!BC_PROG_NUM(r1, n1))
6224 return bc_error_variable_is_wrong_type();
6226 // Make sure that the values have their pointers updated, if necessary.
6227 if (r1->t == BC_RESULT_VAR || r1->t == BC_RESULT_ARRAY_ELEM) {
6229 if (r1->t == r2->t) {
6230 s = bc_program_num(r2, &n2, false);
6234 if (r1->t == r3->t) {
6235 s = bc_program_num(r3, &n3, false);
6240 bc_num_init(&res.d.n, n3->len);
6241 s = bc_num_modexp(n1, n2, n3, &res.d.n);
6244 bc_vec_pop(&G.prog.results);
6245 bc_program_binOpRetire(&res);
6250 bc_num_free(&res.d.n);
6254 static void bc_program_stackLen(void)
6257 size_t len = G.prog.results.len;
6259 res.t = BC_RESULT_TEMP;
6261 bc_num_init(&res.d.n, BC_NUM_DEF_SIZE);
6262 bc_num_ulong2num(&res.d.n, len);
6263 bc_vec_push(&G.prog.results, &res);
6266 static BcStatus bc_program_asciify(void)
6270 BcNum *num = NULL, n;
6271 char *str, *str2, c;
6272 size_t len = G.prog.strs.len, idx;
6275 if (!BC_PROG_STACK(&G.prog.results, 1))
6276 return bc_error_stack_has_too_few_elements();
6277 r = bc_vec_top(&G.prog.results);
6279 s = bc_program_num(r, &num, false);
6282 if (BC_PROG_NUM(r, num)) {
6284 bc_num_init(&n, BC_NUM_DEF_SIZE);
6285 bc_num_copy(&n, num);
6286 bc_num_truncate(&n, n.rdx);
6288 s = bc_num_mod(&n, &G.prog.strmb, &n, 0);
6289 if (s) goto num_err;
6290 s = bc_num_ulong(&n, &val);
6291 if (s) goto num_err;
6298 idx = (r->t == BC_RESULT_STR) ? r->d.id.idx : num->rdx;
6299 str2 = *((char **) bc_vec_item(&G.prog.strs, idx));
6307 str2 = xstrdup(str);
6308 bc_program_addFunc(str2, &idx);
6310 if (idx != len + BC_PROG_REQ_FUNCS) {
6312 for (idx = 0; idx < G.prog.strs.len; ++idx) {
6313 if (!strcmp(*((char **) bc_vec_item(&G.prog.strs, idx)), str)) {
6322 bc_vec_push(&G.prog.strs, &str);
6324 res.t = BC_RESULT_STR;
6326 bc_vec_pop(&G.prog.results);
6327 bc_vec_push(&G.prog.results, &res);
6329 return BC_STATUS_SUCCESS;
6336 static BcStatus bc_program_printStream(void)
6344 if (!BC_PROG_STACK(&G.prog.results, 1))
6345 return bc_error_stack_has_too_few_elements();
6346 r = bc_vec_top(&G.prog.results);
6348 s = bc_program_num(r, &n, false);
6351 if (BC_PROG_NUM(r, n))
6352 s = bc_num_stream(n, &G.prog.strmb, &G.prog.nchars, G.prog.len);
6354 idx = (r->t == BC_RESULT_STR) ? r->d.id.idx : n->rdx;
6355 str = *((char **) bc_vec_item(&G.prog.strs, idx));
6362 static BcStatus bc_program_nquit(void)
6369 s = bc_program_prep(&opnd, &num);
6371 s = bc_num_ulong(num, &val);
6374 bc_vec_pop(&G.prog.results);
6376 if (G.prog.stack.len < val)
6377 return bc_error_stack_has_too_few_elements();
6378 if (G.prog.stack.len == val) {
6379 if (ENABLE_FEATURE_CLEAN_UP)
6380 return BC_STATUS_FAILURE;
6384 bc_vec_npop(&G.prog.stack, val);
6389 static BcStatus bc_program_execStr(char *code, size_t *bgn,
6392 BcStatus s = BC_STATUS_SUCCESS;
6402 if (!BC_PROG_STACK(&G.prog.results, 1))
6403 return bc_error_stack_has_too_few_elements();
6405 r = bc_vec_top(&G.prog.results);
6409 char *name, *then_name = bc_program_name(code, bgn), *else_name = NULL;
6411 if (code[*bgn] == BC_PARSE_STREND)
6414 else_name = bc_program_name(code, bgn);
6416 exec = r->d.n.len != 0;
6420 else if (else_name != NULL) {
6427 v = bc_program_search(name, true);
6434 if (!exec) goto exit;
6435 if (!BC_PROG_STR(n)) {
6436 s = bc_error_variable_is_wrong_type();
6444 if (r->t == BC_RESULT_STR)
6446 else if (r->t == BC_RESULT_VAR) {
6447 s = bc_program_num(r, &n, false);
6448 if (s || !BC_PROG_STR(n)) goto exit;
6455 fidx = sidx + BC_PROG_REQ_FUNCS;
6457 str = bc_vec_item(&G.prog.strs, sidx);
6458 f = bc_vec_item(&G.prog.fns, fidx);
6460 if (f->code.len == 0) {
6461 common_parse_init(&prs, fidx);
6462 s = bc_parse_text(&prs, *str);
6464 s = common_parse_expr(&prs, BC_PARSE_NOCALL);
6467 if (prs.l.t.t != BC_LEX_EOF) {
6468 s = bc_error_bad_expression();
6472 bc_parse_free(&prs);
6476 ip.len = G.prog.results.len;
6479 bc_vec_pop(&G.prog.results);
6480 bc_vec_push(&G.prog.stack, &ip);
6482 return BC_STATUS_SUCCESS;
6485 bc_parse_free(&prs);
6486 f = bc_vec_item(&G.prog.fns, fidx);
6487 bc_vec_pop_all(&f->code);
6489 bc_vec_pop(&G.prog.results);
6494 static void bc_program_pushGlobal(char inst)
6499 res.t = inst - BC_INST_IBASE + BC_RESULT_IBASE;
6500 if (inst == BC_INST_IBASE)
6501 val = (unsigned long) G.prog.ib_t;
6502 else if (inst == BC_INST_SCALE)
6503 val = (unsigned long) G.prog.scale;
6505 val = (unsigned long) G.prog.ob_t;
6507 bc_num_init(&res.d.n, BC_NUM_DEF_SIZE);
6508 bc_num_ulong2num(&res.d.n, val);
6509 bc_vec_push(&G.prog.results, &res);
6512 static void bc_program_addFunc(char *name, size_t *idx)
6514 BcId entry, *entry_ptr;
6519 entry.idx = G.prog.fns.len;
6521 inserted = bc_map_insert(&G.prog.fn_map, &entry, idx);
6522 if (!inserted) free(name);
6524 entry_ptr = bc_vec_item(&G.prog.fn_map, *idx);
6525 *idx = entry_ptr->idx;
6529 BcFunc *func = bc_vec_item(&G.prog.fns, entry_ptr->idx);
6531 // We need to reset these, so the function can be repopulated.
6533 bc_vec_pop_all(&func->autos);
6534 bc_vec_pop_all(&func->code);
6535 bc_vec_pop_all(&func->labels);
6539 bc_vec_push(&G.prog.fns, &f);
6543 // Called when parsing or execution detects a failure,
6544 // resets execution structures.
6545 static void bc_program_reset(void)
6550 bc_vec_npop(&G.prog.stack, G.prog.stack.len - 1);
6551 bc_vec_pop_all(&G.prog.results);
6553 f = bc_vec_item(&G.prog.fns, 0);
6554 ip = bc_vec_top(&G.prog.stack);
6555 ip->idx = f->code.len;
6557 // If !tty, no need to check for ^C: we don't have ^C handler,
6558 // we would be killed by a signal and won't reach this place
6561 static BcStatus bc_program_exec(void)
6563 BcStatus s = BC_STATUS_SUCCESS;
6567 BcInstPtr *ip = bc_vec_top(&G.prog.stack);
6568 BcFunc *func = bc_vec_item(&G.prog.fns, ip->func);
6569 char *code = func->code.v;
6572 while (!s && ip->idx < func->code.len) {
6574 char inst = code[(ip->idx)++];
6579 case BC_INST_JUMP_ZERO:
6581 s = bc_program_prep(&ptr, &num);
6583 cond = !bc_num_cmp(num, &G.prog.zero);
6584 bc_vec_pop(&G.prog.results);
6590 idx = bc_program_index(code, &ip->idx);
6591 addr = bc_vec_item(&func->labels, idx);
6592 if (inst == BC_INST_JUMP || cond) ip->idx = *addr;
6598 s = bc_program_call(code, &ip->idx);
6602 case BC_INST_INC_PRE:
6603 case BC_INST_DEC_PRE:
6604 case BC_INST_INC_POST:
6605 case BC_INST_DEC_POST:
6607 s = bc_program_incdec(inst);
6613 quit_or_return_for_exit();
6620 s = bc_program_return(inst);
6624 case BC_INST_BOOL_OR:
6625 case BC_INST_BOOL_AND:
6627 case BC_INST_REL_EQ:
6628 case BC_INST_REL_LE:
6629 case BC_INST_REL_GE:
6630 case BC_INST_REL_NE:
6631 case BC_INST_REL_LT:
6632 case BC_INST_REL_GT:
6634 s = bc_program_logical(inst);
6640 s = bc_program_read();
6646 s = bc_program_pushVar(code, &ip->idx, false, false);
6650 case BC_INST_ARRAY_ELEM:
6653 s = bc_program_pushArray(code, &ip->idx, inst);
6659 r.t = BC_RESULT_LAST;
6660 bc_vec_push(&G.prog.results, &r);
6668 bc_program_pushGlobal(inst);
6672 case BC_INST_SCALE_FUNC:
6673 case BC_INST_LENGTH:
6676 s = bc_program_builtin(inst);
6682 r.t = BC_RESULT_CONSTANT;
6683 r.d.id.idx = bc_program_index(code, &ip->idx);
6684 bc_vec_push(&G.prog.results, &r);
6690 if (!BC_PROG_STACK(&G.prog.results, 1))
6691 s = bc_error_stack_has_too_few_elements();
6693 bc_vec_pop(&G.prog.results);
6697 case BC_INST_POP_EXEC:
6699 bc_vec_pop(&G.prog.stack);
6704 case BC_INST_PRINT_POP:
6705 case BC_INST_PRINT_STR:
6707 s = bc_program_print(inst, 0);
6713 r.t = BC_RESULT_STR;
6714 r.d.id.idx = bc_program_index(code, &ip->idx);
6715 bc_vec_push(&G.prog.results, &r);
6720 case BC_INST_MULTIPLY:
6721 case BC_INST_DIVIDE:
6722 case BC_INST_MODULUS:
6726 s = bc_program_op(inst);
6730 case BC_INST_BOOL_NOT:
6732 s = bc_program_prep(&ptr, &num);
6735 bc_num_init(&r.d.n, BC_NUM_DEF_SIZE);
6736 (!bc_num_cmp(num, &G.prog.zero) ? bc_num_one : bc_num_zero)(&r.d.n);
6737 bc_program_retire(&r, BC_RESULT_TEMP);
6744 s = bc_program_negate();
6749 case BC_INST_ASSIGN_POWER:
6750 case BC_INST_ASSIGN_MULTIPLY:
6751 case BC_INST_ASSIGN_DIVIDE:
6752 case BC_INST_ASSIGN_MODULUS:
6753 case BC_INST_ASSIGN_PLUS:
6754 case BC_INST_ASSIGN_MINUS:
6756 case BC_INST_ASSIGN:
6758 s = bc_program_assign(inst);
6762 case BC_INST_MODEXP:
6764 s = bc_program_modexp();
6768 case BC_INST_DIVMOD:
6770 s = bc_program_divmod();
6774 case BC_INST_EXECUTE:
6775 case BC_INST_EXEC_COND:
6777 cond = inst == BC_INST_EXEC_COND;
6778 s = bc_program_execStr(code, &ip->idx, cond);
6782 case BC_INST_PRINT_STACK:
6784 for (idx = 0; !s && idx < G.prog.results.len; ++idx)
6785 s = bc_program_print(BC_INST_PRINT, idx);
6789 case BC_INST_CLEAR_STACK:
6791 bc_vec_pop_all(&G.prog.results);
6795 case BC_INST_STACK_LEN:
6797 bc_program_stackLen();
6801 case BC_INST_DUPLICATE:
6803 if (!BC_PROG_STACK(&G.prog.results, 1))
6804 return bc_error_stack_has_too_few_elements();
6805 ptr = bc_vec_top(&G.prog.results);
6806 bc_result_copy(&r, ptr);
6807 bc_vec_push(&G.prog.results, &r);
6815 if (!BC_PROG_STACK(&G.prog.results, 2))
6816 return bc_error_stack_has_too_few_elements();
6818 ptr = bc_vec_item_rev(&G.prog.results, 0);
6819 ptr2 = bc_vec_item_rev(&G.prog.results, 1);
6820 memcpy(&r, ptr, sizeof(BcResult));
6821 memcpy(ptr, ptr2, sizeof(BcResult));
6822 memcpy(ptr2, &r, sizeof(BcResult));
6827 case BC_INST_ASCIIFY:
6829 s = bc_program_asciify();
6833 case BC_INST_PRINT_STREAM:
6835 s = bc_program_printStream();
6840 case BC_INST_PUSH_VAR:
6842 bool copy = inst == BC_INST_LOAD;
6843 s = bc_program_pushVar(code, &ip->idx, true, copy);
6847 case BC_INST_PUSH_TO_VAR:
6849 char *name = bc_program_name(code, &ip->idx);
6850 s = bc_program_copyToVar(name, true);
6857 if (G.prog.stack.len <= 2)
6858 quit_or_return_for_exit();
6859 bc_vec_npop(&G.prog.stack, 2);
6865 s = bc_program_nquit();
6871 if (s || G_interrupt) {
6876 // If the stack has changed, pointers may be invalid.
6877 ip = bc_vec_top(&G.prog.stack);
6878 func = bc_vec_item(&G.prog.fns, ip->func);
6879 code = func->code.v;
6885 static void bc_vm_info(void)
6887 printf("%s "BB_VER"\n"
6888 "Copyright (c) 2018 Gavin D. Howard and contributors\n"
6889 "Report bugs at: https://github.com/gavinhoward/bc\n"
6890 "This is free software with ABSOLUTELY NO WARRANTY\n"
6894 static void bc_args(char **argv)
6900 #if ENABLE_FEATURE_BC_LONG_OPTIONS
6901 opts = option_mask32 |= getopt32long(argv, "xwvsqli",
6902 "extended-register\0" No_argument "x"
6903 "warn\0" No_argument "w"
6904 "version\0" No_argument "v"
6905 "standard\0" No_argument "s"
6906 "quiet\0" No_argument "q"
6907 "mathlib\0" No_argument "l"
6908 "interactive\0" No_argument "i"
6911 opts = option_mask32 |= getopt32(argv, "xwvsqli");
6913 if (getenv("POSIXLY_CORRECT"))
6914 option_mask32 |= BC_FLAG_S;
6916 ///should be in bc_vm_run() instead??
6917 if (opts & BC_FLAG_V) {
6922 for (i = optind; argv[i]; ++i)
6923 bc_vec_push(&G.files, argv + i);
6927 static void bc_vm_envArgs(void)
6931 char *env_args = getenv("BC_ENV_ARGS");
6933 if (!env_args) return;
6935 G.env_args = xstrdup(env_args);
6938 bc_vec_init(&v, sizeof(char *), NULL);
6940 while (*(buf = skip_whitespace(buf)) != '\0') {
6941 bc_vec_push(&v, &buf);
6942 buf = skip_non_whitespace(buf);
6948 // NULL terminate, and pass argv[] so that first arg is argv[1]
6949 if (sizeof(int) == sizeof(char*)) {
6950 bc_vec_push(&v, &const_int_0);
6952 static char *const nullptr = NULL;
6953 bc_vec_push(&v, &nullptr);
6955 bc_args(((char **)v.v) - 1);
6961 static unsigned bc_vm_envLen(const char *var)
6967 len = BC_NUM_PRINT_WIDTH;
6968 if (!lenv) return len;
6970 len = bb_strtou(lenv, NULL, 10) - 1;
6971 if (errno || len < 2 || len >= INT_MAX)
6972 len = BC_NUM_PRINT_WIDTH;
6977 static BcStatus bc_vm_process(const char *text)
6979 BcStatus s = bc_parse_text(&G.prs, text);
6983 while (G.prs.l.t.t != BC_LEX_EOF) {
6984 s = G.prs.parse(&G.prs);
6988 if (BC_PARSE_CAN_EXEC(&G.prs)) {
6989 s = bc_program_exec();
6998 static BcStatus bc_vm_file(const char *file)
7000 const char *sv_file;
7006 data = bc_read_file(file);
7007 if (!data) return bc_error_fmt("file '%s' is not text", file);
7009 sv_file = G.prog.file;
7011 bc_lex_file(&G.prs.l);
7012 s = bc_vm_process(data);
7015 main_func = bc_vec_item(&G.prog.fns, BC_PROG_MAIN);
7016 ip = bc_vec_item(&G.prog.stack, 0);
7018 if (main_func->code.len < ip->idx)
7019 s = bc_error_fmt("file '%s' is not executable", file);
7022 G.prog.file = sv_file;
7027 static BcStatus bc_vm_stdin(void)
7031 size_t len, i, str = 0;
7032 bool comment = false;
7035 bc_lex_file(&G.prs.l);
7037 bc_char_vec_init(&buffer);
7038 bc_char_vec_init(&buf);
7039 bc_vec_pushZeroByte(&buffer);
7041 // This loop is complex because the vm tries not to send any lines that end
7042 // with a backslash to the parser. The reason for that is because the parser
7043 // treats a backslash+newline combo as whitespace, per the bc spec. In that
7044 // case, and for strings and comments, the parser will expect more stuff.
7045 s = BC_STATUS_SUCCESS;
7046 while (!G.eof && (s = bc_read_line(&buf, ">>> ")) == BC_STATUS_SUCCESS) {
7048 char *string = buf.v;
7053 if (str && buf.v[0] == G.send)
7055 else if (buf.v[0] == G.sbgn)
7058 else if (len > 1 || comment) {
7060 for (i = 0; i < len; ++i) {
7062 bool notend = len > i + 1;
7065 if (i - 1 > len || string[i - 1] != '\\') {
7066 if (G.sbgn == G.send)
7068 else if (c == G.send)
7070 else if (c == G.sbgn)
7074 if (c == '/' && notend && !comment && string[i + 1] == '*') {
7078 else if (c == '*' && notend && comment && string[i + 1] == '/')
7082 if (str || comment || string[len - 2] == '\\') {
7083 bc_vec_concat(&buffer, buf.v);
7088 bc_vec_concat(&buffer, buf.v);
7089 s = bc_vm_process(buffer.v);
7091 if (ENABLE_FEATURE_CLEAN_UP && !G_ttyin) {
7092 // Debug config, non-interactive mode:
7093 // return all the way back to main.
7094 // Non-debug builds do not come here, they exit.
7098 fputs("ready for more input\n", stderr);
7101 bc_vec_pop_all(&buffer);
7105 s = bc_error("string end could not be found");
7108 s = bc_error("comment end could not be found");
7112 bc_vec_free(&buffer);
7117 static const char bc_lib[] = {
7120 "\n" "auto b,s,n,r,d,i,p,f,v"
7129 "\n" "scale=scale(x)+1"
7139 "\n" "for(i=2;v!=0;++i){"
7145 "\n" "while((d--)!=0)r*=r"
7148 "\n" "if(n!=0)return(1/r)"
7152 "\n" "auto b,s,r,p,a,q,i,v"
7156 "\n" "r=(1-10^scale)/1"
7167 "\n" "while(x<=0.5){"
7171 "\n" "r=a=(x-1)/(x+1)"
7174 "\n" "for(i=3;v!=0;i+=2){"
7185 "\n" "auto b,s,r,n,a,q,i"
7189 "\n" "scale=1.1*s+2"
7198 "\n" "if(q%2!=0)x=-x"
7202 "\n" "for(i=3;a!=0;i+=2){"
7203 "\n" "a*=q/(i*(i-1))"
7208 "\n" "if(n!=0)return(-r/1)"
7217 "\n" "x=s(2*a(1)+x)"
7223 "\n" "auto b,s,r,n,a,m,t,f,i,u"
7232 "\n" "if(scale<65){"
7233 "\n" "return(.7853981633974483096156608458198757210492923498437764552437361480/n)"
7237 "\n" "if(scale<65){"
7238 "\n" "return(.1973955598498807583700497651947902934475851037878521015176889402/n)"
7249 "\n" "x=(x-.2)/(1+.2*x)"
7254 "\n" "for(i=3;t!=0;i+=2){"
7261 "\n" "return((m*a+r)/n)"
7263 "\n" "define j(n,x){"
7264 "\n" "auto b,s,o,a,i,v,f"
7272 "\n" "if(n%2==1)o=1"
7275 "\n" "for(i=2;i<=n;++i)a*=i"
7277 "\n" "a=(x^n)/2^n/a"
7280 "\n" "scale=scale+length(a)-scale(a)"
7281 "\n" "for(i=1;v!=0;++i){"
7282 "\n" "v=v*f/i/(n+i)"
7288 "\n" "return(a*r/1)"
7293 static BcStatus bc_vm_exec(void)
7295 BcStatus s = BC_STATUS_SUCCESS;
7299 if (option_mask32 & BC_FLAG_L) {
7301 // We know that internal library is not buggy,
7302 // thus error checking is normally disabled.
7303 # define DEBUG_LIB 0
7304 bc_lex_file(&G.prs.l);
7305 s = bc_parse_text(&G.prs, bc_lib);
7306 if (DEBUG_LIB && s) return s;
7308 while (G.prs.l.t.t != BC_LEX_EOF) {
7309 s = G.prs.parse(&G.prs);
7310 if (DEBUG_LIB && s) return s;
7312 s = bc_program_exec();
7313 if (DEBUG_LIB && s) return s;
7317 for (i = 0; !s && i < G.files.len; ++i)
7318 s = bc_vm_file(*((char **) bc_vec_item(&G.files, i)));
7320 if (ENABLE_FEATURE_CLEAN_UP && !G_ttyin) {
7321 // Debug config, non-interactive mode:
7322 // return all the way back to main.
7323 // Non-debug builds do not come here, they exit.
7327 fputs("ready for more input\n", stderr);
7330 if (IS_BC || !G.files.len)
7332 if (!s && !BC_PARSE_CAN_EXEC(&G.prs))
7333 s = bc_vm_process("");
7338 #if ENABLE_FEATURE_CLEAN_UP
7339 static void bc_program_free(void)
7341 bc_num_free(&G.prog.ib);
7342 bc_num_free(&G.prog.ob);
7343 bc_num_free(&G.prog.hexb);
7345 bc_num_free(&G.prog.strmb);
7347 bc_vec_free(&G.prog.fns);
7348 bc_vec_free(&G.prog.fn_map);
7349 bc_vec_free(&G.prog.vars);
7350 bc_vec_free(&G.prog.var_map);
7351 bc_vec_free(&G.prog.arrs);
7352 bc_vec_free(&G.prog.arr_map);
7353 bc_vec_free(&G.prog.strs);
7354 bc_vec_free(&G.prog.consts);
7355 bc_vec_free(&G.prog.results);
7356 bc_vec_free(&G.prog.stack);
7357 bc_num_free(&G.prog.last);
7358 bc_num_free(&G.prog.zero);
7359 bc_num_free(&G.prog.one);
7362 static void bc_vm_free(void)
7364 bc_vec_free(&G.files);
7366 bc_parse_free(&G.prs);
7371 static void bc_program_init(void)
7376 /* memset(&G.prog, 0, sizeof(G.prog)); - already is */
7377 memset(&ip, 0, sizeof(BcInstPtr));
7379 /* G.prog.nchars = G.prog.scale = 0; - already is */
7381 bc_num_init(&G.prog.ib, BC_NUM_DEF_SIZE);
7382 bc_num_ten(&G.prog.ib);
7385 bc_num_init(&G.prog.ob, BC_NUM_DEF_SIZE);
7386 bc_num_ten(&G.prog.ob);
7389 bc_num_init(&G.prog.hexb, BC_NUM_DEF_SIZE);
7390 bc_num_ten(&G.prog.hexb);
7391 G.prog.hexb.num[0] = 6;
7394 bc_num_init(&G.prog.strmb, BC_NUM_DEF_SIZE);
7395 bc_num_ulong2num(&G.prog.strmb, UCHAR_MAX + 1);
7398 bc_num_init(&G.prog.last, BC_NUM_DEF_SIZE);
7399 bc_num_zero(&G.prog.last);
7401 bc_num_init(&G.prog.zero, BC_NUM_DEF_SIZE);
7402 bc_num_zero(&G.prog.zero);
7404 bc_num_init(&G.prog.one, BC_NUM_DEF_SIZE);
7405 bc_num_one(&G.prog.one);
7407 bc_vec_init(&G.prog.fns, sizeof(BcFunc), bc_func_free);
7408 bc_vec_init(&G.prog.fn_map, sizeof(BcId), bc_id_free);
7410 bc_program_addFunc(xstrdup("(main)"), &idx);
7411 bc_program_addFunc(xstrdup("(read)"), &idx);
7413 bc_vec_init(&G.prog.vars, sizeof(BcVec), bc_vec_free);
7414 bc_vec_init(&G.prog.var_map, sizeof(BcId), bc_id_free);
7416 bc_vec_init(&G.prog.arrs, sizeof(BcVec), bc_vec_free);
7417 bc_vec_init(&G.prog.arr_map, sizeof(BcId), bc_id_free);
7419 bc_vec_init(&G.prog.strs, sizeof(char *), bc_string_free);
7420 bc_vec_init(&G.prog.consts, sizeof(char *), bc_string_free);
7421 bc_vec_init(&G.prog.results, sizeof(BcResult), bc_result_free);
7422 bc_vec_init(&G.prog.stack, sizeof(BcInstPtr), NULL);
7423 bc_vec_push(&G.prog.stack, &ip);
7426 static void bc_vm_init(void)
7428 bc_vec_init(&G.files, sizeof(char *), NULL);
7433 bc_parse_init(&G.prs, BC_PROG_MAIN);
7435 dc_parse_init(&G.prs, BC_PROG_MAIN);
7439 static BcStatus bc_vm_run(char **argv, const char *env_len)
7443 #if ENABLE_FEATURE_EDITING
7444 G.line_input_state = new_line_input_t(DO_HISTORY);
7446 G.prog.len = bc_vm_envLen(env_len);
7452 #if ENABLE_FEATURE_BC_SIGNALS
7454 // With SA_RESTART, most system calls will restart
7455 // (IOW: they won't fail with EINTR).
7456 // In particular, this means ^C won't cause
7457 // stdout to get into "error state" if SIGINT hits
7458 // within write() syscall.
7459 // The downside is that ^C while line input is taken
7460 // will only be handled after [Enter] since read()
7461 // from stdin is not interrupted by ^C either,
7462 // it restarts, thus fgetc() does not return on ^C.
7463 signal_SA_RESTART_empty_mask(SIGINT, record_signo);
7465 // Without SA_RESTART, this exhibits a bug:
7466 // "while (1) print 1" and try ^C-ing it.
7467 // Intermittently, instead of returning to input line,
7468 // you'll get "output error: Interrupted system call"
7470 //signal_no_SA_RESTART_empty_mask(SIGINT, record_signo);
7472 if (!(option_mask32 & BC_FLAG_Q))
7478 #if ENABLE_FEATURE_CLEAN_UP
7480 # if ENABLE_FEATURE_EDITING
7481 free_line_input_t(G.line_input_state);
7489 int bc_main(int argc, char **argv) MAIN_EXTERNALLY_VISIBLE;
7490 int bc_main(int argc UNUSED_PARAM, char **argv)
7493 G.sbgn = G.send = '"';
7495 return bc_vm_run(argv, "BC_LINE_LENGTH");
7500 int dc_main(int argc, char **argv) MAIN_EXTERNALLY_VISIBLE;
7501 int dc_main(int argc UNUSED_PARAM, char **argv)
7507 return bc_vm_run(argv, "DC_LINE_LENGTH");
7511 #endif // not DC_SMALL