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 typedef signed char BcDig;
210 typedef struct BcNum {
218 #define BC_NUM_MIN_BASE ((unsigned long) 2)
219 #define BC_NUM_MAX_IBASE ((unsigned long) 16)
220 // larger value might speed up BIGNUM calculations a bit:
221 #define BC_NUM_DEF_SIZE (16)
222 #define BC_NUM_PRINT_WIDTH (69)
224 #define BC_NUM_KARATSUBA_LEN (32)
226 #define BC_NUM_NEG(n, neg) ((((ssize_t)(n)) ^ -((ssize_t)(neg))) + (neg))
227 #define BC_NUM_ONE(n) ((n)->len == 1 && (n)->rdx == 0 && (n)->num[0] == 1)
228 #define BC_NUM_INT(n) ((n)->len - (n)->rdx)
229 #define BC_NUM_AREQ(a, b) \
230 (BC_MAX((a)->rdx, (b)->rdx) + BC_MAX(BC_NUM_INT(a), BC_NUM_INT(b)) + 1)
231 #define BC_NUM_MREQ(a, b, scale) \
232 (BC_NUM_INT(a) + BC_NUM_INT(b) + BC_MAX((scale), (a)->rdx + (b)->rdx) + 1)
234 typedef BcStatus (*BcNumBinaryOp)(BcNum *, BcNum *, BcNum *, size_t);
235 typedef void (*BcNumDigitOp)(size_t, size_t, bool, size_t *, size_t);
237 static BcStatus bc_num_add(BcNum *a, BcNum *b, BcNum *c, size_t scale);
238 static BcStatus bc_num_sub(BcNum *a, BcNum *b, BcNum *c, size_t scale);
239 static BcStatus bc_num_mul(BcNum *a, BcNum *b, BcNum *c, size_t scale);
240 static BcStatus bc_num_div(BcNum *a, BcNum *b, BcNum *c, size_t scale);
241 static BcStatus bc_num_mod(BcNum *a, BcNum *b, BcNum *c, size_t scale);
242 static BcStatus bc_num_pow(BcNum *a, BcNum *b, BcNum *c, size_t scale);
243 static BcStatus bc_num_sqrt(BcNum *a, BcNum *b, size_t scale);
244 static BcStatus bc_num_divmod(BcNum *a, BcNum *b, BcNum *c, BcNum *d,
247 typedef enum BcInst {
277 BC_INST_ASSIGN_POWER,
278 BC_INST_ASSIGN_MULTIPLY,
279 BC_INST_ASSIGN_DIVIDE,
280 BC_INST_ASSIGN_MODULUS,
282 BC_INST_ASSIGN_MINUS,
328 BC_INST_PRINT_STREAM,
343 BC_INST_INVALID = -1,
348 typedef struct BcId {
353 typedef struct BcFunc {
360 typedef enum BcResultType {
365 BC_RESULT_ARRAY_ELEM,
374 // These are between to calculate ibase, obase, and last from instructions.
382 typedef union BcResultData {
388 typedef struct BcResult {
393 typedef struct BcInstPtr {
399 // BC_LEX_NEG is not used in lexing; it is only for parsing.
400 typedef enum BcLexType {
428 BC_LEX_OP_ASSIGN_POWER,
429 BC_LEX_OP_ASSIGN_MULTIPLY,
430 BC_LEX_OP_ASSIGN_DIVIDE,
431 BC_LEX_OP_ASSIGN_MODULUS,
432 BC_LEX_OP_ASSIGN_PLUS,
433 BC_LEX_OP_ASSIGN_MINUS,
454 BC_LEX_KEY_1st_keyword,
455 BC_LEX_KEY_AUTO = BC_LEX_KEY_1st_keyword,
462 // code uses "type - BC_LEX_KEY_IBASE + BC_INST_IBASE" construct,
463 BC_LEX_KEY_IBASE, // relative order should match for: BC_INST_IBASE
465 BC_LEX_KEY_LAST, // relative order should match for: BC_INST_LAST
468 BC_LEX_KEY_OBASE, // relative order should match for: BC_INST_OBASE
506 // must match order of BC_LEX_KEY_foo etc above
508 struct BcLexKeyword {
511 #define BC_LEX_KW_ENTRY(a, b, c) \
512 { .name8 = a /*, .len = b, .posix = c*/ }
513 static const struct BcLexKeyword bc_lex_kws[20] = {
514 BC_LEX_KW_ENTRY("auto" , 4, 1), // 0
515 BC_LEX_KW_ENTRY("break" , 5, 1), // 1
516 BC_LEX_KW_ENTRY("continue", 8, 0), // 2 note: this one has no terminating NUL
517 BC_LEX_KW_ENTRY("define" , 6, 1), // 3
519 BC_LEX_KW_ENTRY("else" , 4, 0), // 4
520 BC_LEX_KW_ENTRY("for" , 3, 1), // 5
521 BC_LEX_KW_ENTRY("halt" , 4, 0), // 6
522 BC_LEX_KW_ENTRY("ibase" , 5, 1), // 7
524 BC_LEX_KW_ENTRY("if" , 2, 1), // 8
525 BC_LEX_KW_ENTRY("last" , 4, 0), // 9
526 BC_LEX_KW_ENTRY("length" , 6, 1), // 10
527 BC_LEX_KW_ENTRY("limits" , 6, 0), // 11
529 BC_LEX_KW_ENTRY("obase" , 5, 1), // 12
530 BC_LEX_KW_ENTRY("print" , 5, 0), // 13
531 BC_LEX_KW_ENTRY("quit" , 4, 1), // 14
532 BC_LEX_KW_ENTRY("read" , 4, 0), // 15
534 BC_LEX_KW_ENTRY("return" , 6, 1), // 16
535 BC_LEX_KW_ENTRY("scale" , 5, 1), // 17
536 BC_LEX_KW_ENTRY("sqrt" , 4, 1), // 18
537 BC_LEX_KW_ENTRY("while" , 5, 1), // 19
569 typedef BcStatus (*BcLexNext)(struct BcLex *);
571 typedef struct BcLex {
589 #define BC_PARSE_STREND ((char) UCHAR_MAX)
591 #define BC_PARSE_REL (1 << 0)
592 #define BC_PARSE_PRINT (1 << 1)
593 #define BC_PARSE_NOCALL (1 << 2)
594 #define BC_PARSE_NOREAD (1 << 3)
595 #define BC_PARSE_ARRAY (1 << 4)
597 #define BC_PARSE_TOP_FLAG_PTR(parse) ((uint8_t *) bc_vec_top(&(parse)->flags))
598 #define BC_PARSE_TOP_FLAG(parse) (*(BC_PARSE_TOP_FLAG_PTR(parse)))
600 #define BC_PARSE_FLAG_FUNC_INNER (1 << 0)
601 #define BC_PARSE_FUNC_INNER(parse) \
602 (BC_PARSE_TOP_FLAG(parse) & BC_PARSE_FLAG_FUNC_INNER)
604 #define BC_PARSE_FLAG_FUNC (1 << 1)
605 #define BC_PARSE_FUNC(parse) (BC_PARSE_TOP_FLAG(parse) & BC_PARSE_FLAG_FUNC)
607 #define BC_PARSE_FLAG_BODY (1 << 2)
608 #define BC_PARSE_BODY(parse) (BC_PARSE_TOP_FLAG(parse) & BC_PARSE_FLAG_BODY)
610 #define BC_PARSE_FLAG_LOOP (1 << 3)
611 #define BC_PARSE_LOOP(parse) (BC_PARSE_TOP_FLAG(parse) & BC_PARSE_FLAG_LOOP)
613 #define BC_PARSE_FLAG_LOOP_INNER (1 << 4)
614 #define BC_PARSE_LOOP_INNER(parse) \
615 (BC_PARSE_TOP_FLAG(parse) & BC_PARSE_FLAG_LOOP_INNER)
617 #define BC_PARSE_FLAG_IF (1 << 5)
618 #define BC_PARSE_IF(parse) (BC_PARSE_TOP_FLAG(parse) & BC_PARSE_FLAG_IF)
620 #define BC_PARSE_FLAG_ELSE (1 << 6)
621 #define BC_PARSE_ELSE(parse) (BC_PARSE_TOP_FLAG(parse) & BC_PARSE_FLAG_ELSE)
623 #define BC_PARSE_FLAG_IF_END (1 << 7)
624 #define BC_PARSE_IF_END(parse) (BC_PARSE_TOP_FLAG(parse) & BC_PARSE_FLAG_IF_END)
626 #define BC_PARSE_CAN_EXEC(parse) \
627 (!(BC_PARSE_TOP_FLAG(parse) & \
628 (BC_PARSE_FLAG_FUNC_INNER | BC_PARSE_FLAG_FUNC | BC_PARSE_FLAG_BODY | \
629 BC_PARSE_FLAG_LOOP | BC_PARSE_FLAG_LOOP_INNER | BC_PARSE_FLAG_IF | \
630 BC_PARSE_FLAG_ELSE | BC_PARSE_FLAG_IF_END)))
632 typedef struct BcParseNext {
641 typedef BcStatus (*BcParseParse)(struct BcParse *);
643 typedef struct BcParse {
664 typedef struct BcProgram {
705 #define BC_PROG_STACK(s, n) ((s)->len >= ((size_t) n))
707 #define BC_PROG_MAIN (0)
708 #define BC_PROG_READ (1)
710 #define BC_PROG_REQ_FUNCS (2)
713 #define BC_PROG_STR(n) (!(n)->num && !(n)->cap)
714 #define BC_PROG_NUM(r, n) \
715 ((r)->t != BC_RESULT_ARRAY && (r)->t != BC_RESULT_STR && !BC_PROG_STR(n))
717 typedef unsigned long (*BcProgramBuiltIn)(BcNum *);
719 #define BC_FLAG_X (1 << 0)
720 #define BC_FLAG_W (1 << 1)
721 #define BC_FLAG_V (1 << 2)
722 #define BC_FLAG_S (1 << 3)
723 #define BC_FLAG_Q (1 << 4)
724 #define BC_FLAG_L (1 << 5)
725 #define BC_FLAG_I (1 << 6)
727 #define BC_MAX(a, b) ((a) > (b) ? (a) : (b))
728 #define BC_MIN(a, b) ((a) < (b) ? (a) : (b))
730 #define BC_MAX_OBASE ((unsigned) 999)
731 #define BC_MAX_DIM ((unsigned) INT_MAX)
732 #define BC_MAX_SCALE ((unsigned) UINT_MAX)
733 #define BC_MAX_STRING ((unsigned) UINT_MAX - 1)
734 #define BC_MAX_NAME BC_MAX_STRING
735 #define BC_MAX_NUM BC_MAX_STRING
736 #define BC_MAX_EXP ((unsigned long) LONG_MAX)
737 #define BC_MAX_VARS ((unsigned long) SIZE_MAX - 1)
740 IF_FEATURE_BC_SIGNALS(smallint ttyin;)
748 // For error messages. Can be set to current parsed line,
749 // or [TODO] to current executing line (can be before last parsed one)
756 #if ENABLE_FEATURE_EDITING
757 line_input_t *line_input_state;
760 #define G (*ptr_to_globals)
761 #define INIT_G() do { \
762 SET_PTR_TO_GLOBALS(xzalloc(sizeof(G))); \
764 #define FREE_G() do { \
765 FREE_PTR_TO_GLOBALS(); \
767 #define G_posix (ENABLE_BC && (option_mask32 & BC_FLAG_S))
768 #define G_warn (ENABLE_BC && (option_mask32 & BC_FLAG_W))
769 #define G_exreg (ENABLE_DC && (option_mask32 & BC_FLAG_X))
770 #define G_interrupt (ENABLE_FEATURE_BC_SIGNALS ? bb_got_signal : 0)
771 #if ENABLE_FEATURE_BC_SIGNALS
772 # define G_ttyin G.ttyin
776 #define IS_BC (ENABLE_BC && (!ENABLE_DC || applet_name[0] == 'b'))
780 // This is a bit array that corresponds to token types. An entry is
781 // true if the token is valid in an expression, false otherwise.
783 BC_PARSE_EXPRS_BITS = 0
784 + ((uint64_t)((0 << 0)+(0 << 1)+(1 << 2)+(1 << 3)+(1 << 4)+(1 << 5)+(1 << 6)+(1 << 7)) << (0*8))
785 + ((uint64_t)((1 << 0)+(1 << 1)+(1 << 2)+(1 << 3)+(1 << 4)+(1 << 5)+(1 << 6)+(1 << 7)) << (1*8))
786 + ((uint64_t)((1 << 0)+(1 << 1)+(1 << 2)+(1 << 3)+(1 << 4)+(1 << 5)+(1 << 6)+(1 << 7)) << (2*8))
787 + ((uint64_t)((1 << 0)+(1 << 1)+(1 << 2)+(0 << 3)+(0 << 4)+(1 << 5)+(1 << 6)+(0 << 7)) << (3*8))
788 + ((uint64_t)((0 << 0)+(0 << 1)+(0 << 2)+(0 << 3)+(0 << 4)+(0 << 5)+(1 << 6)+(1 << 7)) << (4*8))
789 + ((uint64_t)((0 << 0)+(0 << 1)+(0 << 2)+(0 << 3)+(0 << 4)+(0 << 5)+(0 << 6)+(1 << 7)) << (5*8))
790 + ((uint64_t)((0 << 0)+(1 << 1)+(1 << 2)+(1 << 3)+(1 << 4)+(0 << 5)+(0 << 6)+(1 << 7)) << (6*8))
791 + ((uint64_t)((0 << 0)+(1 << 1)+(1 << 2)+(0 << 3) ) << (7*8))
793 static ALWAYS_INLINE long bc_parse_exprs(unsigned i)
795 #if ULONG_MAX > 0xffffffff
796 // 64-bit version (will not work correctly for 32-bit longs!)
797 return BC_PARSE_EXPRS_BITS & (1UL << i);
800 unsigned long m = (uint32_t)BC_PARSE_EXPRS_BITS;
802 m = (uint32_t)(BC_PARSE_EXPRS_BITS >> 32);
805 return m & (1UL << i);
809 // This is an array of data for operators that correspond to token types.
810 static const uint8_t bc_parse_ops[] = {
811 #define OP(p,l) ((int)(l) * 0x10 + (p))
812 OP(0, false), OP( 0, false ), // inc dec
815 OP(3, true ), OP( 3, true ), OP( 3, true ), // pow mul div
816 OP(4, true ), OP( 4, true ), // mod + -
817 OP(6, true ), OP( 6, true ), OP( 6, true ), OP( 6, true ), OP( 6, true ), OP( 6, true ), // == <= >= != < >
819 OP(7, true ), OP( 7, true ), // or and
820 OP(5, false), OP( 5, false ), OP( 5, false ), OP( 5, false ), OP( 5, false ), // ^= *= /= %= +=
821 OP(5, false), OP( 5, false ), // -= =
824 #define bc_parse_op_PREC(i) (bc_parse_ops[i] & 0x0f)
825 #define bc_parse_op_LEFT(i) (bc_parse_ops[i] & 0x10)
827 // These identify what tokens can come after expressions in certain cases.
828 #define BC_PARSE_NEXT_TOKENS(...) .tokens = { __VA_ARGS__ }
829 #define BC_PARSE_NEXT(a, ...) \
831 .len = (a), BC_PARSE_NEXT_TOKENS(__VA_ARGS__) \
833 static const BcParseNext bc_parse_next_expr =
834 BC_PARSE_NEXT(4, BC_LEX_NLINE, BC_LEX_SCOLON, BC_LEX_RBRACE, BC_LEX_EOF);
835 static const BcParseNext bc_parse_next_param =
836 BC_PARSE_NEXT(2, BC_LEX_RPAREN, BC_LEX_COMMA);
837 static const BcParseNext bc_parse_next_print =
838 BC_PARSE_NEXT(4, BC_LEX_COMMA, BC_LEX_NLINE, BC_LEX_SCOLON, BC_LEX_EOF);
839 static const BcParseNext bc_parse_next_rel = BC_PARSE_NEXT(1, BC_LEX_RPAREN);
840 static const BcParseNext bc_parse_next_elem = BC_PARSE_NEXT(1, BC_LEX_RBRACKET);
841 static const BcParseNext bc_parse_next_for = BC_PARSE_NEXT(1, BC_LEX_SCOLON);
842 static const BcParseNext bc_parse_next_read =
843 BC_PARSE_NEXT(2, BC_LEX_NLINE, BC_LEX_EOF);
847 static const BcLexType dc_lex_regs[] = {
848 BC_LEX_OP_REL_EQ, BC_LEX_OP_REL_LE, BC_LEX_OP_REL_GE, BC_LEX_OP_REL_NE,
849 BC_LEX_OP_REL_LT, BC_LEX_OP_REL_GT, BC_LEX_SCOLON, BC_LEX_COLON,
850 BC_LEX_ELSE, BC_LEX_LOAD, BC_LEX_LOAD_POP, BC_LEX_OP_ASSIGN,
854 static const BcLexType dc_lex_tokens[] = {
855 BC_LEX_OP_MODULUS, BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_LPAREN,
856 BC_LEX_INVALID, BC_LEX_OP_MULTIPLY, BC_LEX_OP_PLUS, BC_LEX_INVALID,
857 BC_LEX_OP_MINUS, BC_LEX_INVALID, BC_LEX_OP_DIVIDE,
858 BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID,
859 BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID,
860 BC_LEX_INVALID, BC_LEX_INVALID,
861 BC_LEX_COLON, BC_LEX_SCOLON, BC_LEX_OP_REL_GT, BC_LEX_OP_REL_EQ,
862 BC_LEX_OP_REL_LT, BC_LEX_KEY_READ, BC_LEX_INVALID,
863 BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID,
864 BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_EQ_NO_REG, BC_LEX_INVALID,
865 BC_LEX_KEY_IBASE, BC_LEX_INVALID, BC_LEX_KEY_SCALE, BC_LEX_LOAD_POP,
866 BC_LEX_INVALID, BC_LEX_OP_BOOL_NOT, BC_LEX_KEY_OBASE, BC_LEX_PRINT_STREAM,
867 BC_LEX_NQUIT, BC_LEX_POP, BC_LEX_STORE_PUSH, BC_LEX_INVALID, BC_LEX_INVALID,
868 BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_SCALE_FACTOR, BC_LEX_INVALID,
869 BC_LEX_KEY_LENGTH, BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID,
870 BC_LEX_OP_POWER, BC_LEX_NEG, BC_LEX_INVALID,
871 BC_LEX_ASCIIFY, BC_LEX_INVALID, BC_LEX_CLEAR_STACK, BC_LEX_DUPLICATE,
872 BC_LEX_ELSE, BC_LEX_PRINT_STACK, BC_LEX_INVALID, BC_LEX_INVALID,
873 BC_LEX_STORE_IBASE, BC_LEX_INVALID, BC_LEX_STORE_SCALE, BC_LEX_LOAD,
874 BC_LEX_INVALID, BC_LEX_PRINT_POP, BC_LEX_STORE_OBASE, BC_LEX_KEY_PRINT,
875 BC_LEX_KEY_QUIT, BC_LEX_SWAP, BC_LEX_OP_ASSIGN, BC_LEX_INVALID,
876 BC_LEX_INVALID, BC_LEX_KEY_SQRT, BC_LEX_INVALID, BC_LEX_EXECUTE,
877 BC_LEX_INVALID, BC_LEX_STACK_LEVEL,
878 BC_LEX_LBRACE, BC_LEX_OP_MODEXP, BC_LEX_INVALID, BC_LEX_OP_DIVMOD,
882 static const BcInst dc_parse_insts[] = {
883 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID, BC_INST_REL_GE,
884 BC_INST_INVALID, BC_INST_POWER, BC_INST_MULTIPLY, BC_INST_DIVIDE,
885 BC_INST_MODULUS, BC_INST_PLUS, BC_INST_MINUS,
886 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID,
887 BC_INST_INVALID, BC_INST_INVALID,
888 BC_INST_BOOL_NOT, BC_INST_INVALID, BC_INST_INVALID,
889 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID,
890 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID,
891 BC_INST_INVALID, BC_INST_INVALID, BC_INST_REL_GT, BC_INST_INVALID,
892 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID, BC_INST_REL_GE,
893 BC_INST_INVALID, BC_INST_INVALID,
894 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID,
895 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID,
896 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID, BC_INST_IBASE,
897 BC_INST_INVALID, BC_INST_INVALID, BC_INST_LENGTH, BC_INST_INVALID,
898 BC_INST_OBASE, BC_INST_PRINT, BC_INST_QUIT, BC_INST_INVALID,
899 BC_INST_INVALID, BC_INST_SCALE, BC_INST_SQRT, BC_INST_INVALID,
900 BC_INST_REL_EQ, BC_INST_MODEXP, BC_INST_DIVMOD, BC_INST_INVALID,
901 BC_INST_INVALID, BC_INST_EXECUTE, BC_INST_PRINT_STACK, BC_INST_CLEAR_STACK,
902 BC_INST_STACK_LEN, BC_INST_DUPLICATE, BC_INST_SWAP, BC_INST_POP,
903 BC_INST_ASCIIFY, BC_INST_PRINT_STREAM, BC_INST_INVALID, BC_INST_INVALID,
904 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID,
905 BC_INST_PRINT, BC_INST_NQUIT, BC_INST_SCALE_FUNC,
909 static const BcNumBinaryOp bc_program_ops[] = {
910 bc_num_pow, bc_num_mul, bc_num_div, bc_num_mod, bc_num_add, bc_num_sub,
913 static void fflush_and_check(void)
916 if (ferror(stdout) || ferror(stderr))
917 bb_perror_msg_and_die("output error");
920 #if ENABLE_FEATURE_CLEAN_UP
921 #define quit_or_return_for_exit() \
923 IF_FEATURE_BC_SIGNALS(G_ttyin = 0;) /* do not loop in main loop anymore */ \
924 return BC_STATUS_FAILURE; \
927 #define quit_or_return_for_exit() quit()
930 static void quit(void) NORETURN;
931 static void quit(void)
934 bb_perror_msg_and_die("input error");
939 static void bc_verror_msg(const char *fmt, va_list p)
941 const char *sv = sv; /* for compiler */
944 applet_name = xasprintf("%s: %s:%u", applet_name, G.prog.file, G.err_line);
946 bb_verror_msg(fmt, p, NULL);
948 free((char*)applet_name);
953 static NOINLINE int bc_error_fmt(const char *fmt, ...)
958 bc_verror_msg(fmt, p);
961 if (!ENABLE_FEATURE_CLEAN_UP && !G_ttyin)
963 return BC_STATUS_FAILURE;
967 static NOINLINE int bc_posix_error_fmt(const char *fmt, ...)
971 // Are non-POSIX constructs totally ok?
972 if (!(option_mask32 & (BC_FLAG_S|BC_FLAG_W)))
973 return BC_STATUS_SUCCESS; // yes
976 bc_verror_msg(fmt, p);
979 // Do we treat non-POSIX constructs as errors?
980 if (!(option_mask32 & BC_FLAG_S))
981 return BC_STATUS_SUCCESS; // no, it's a warning
982 if (!ENABLE_FEATURE_CLEAN_UP && !G_ttyin)
984 return BC_STATUS_FAILURE;
988 // We use error functions with "return bc_error(FMT[, PARAMS])" idiom.
989 // This idiom begs for tail-call optimization, but for it to work,
990 // function must not have caller-cleaned parameters on stack.
991 // Unfortunately, vararg function API does exactly that on most arches.
992 // Thus, use these shims for the cases when we have no vararg PARAMS:
993 static int bc_error(const char *msg)
995 return bc_error_fmt("%s", msg);
998 static int bc_POSIX_requires(const char *msg)
1000 return bc_posix_error_fmt("POSIX requires %s", msg);
1002 static int bc_POSIX_does_not_allow(const char *msg)
1004 return bc_posix_error_fmt("%s%s", "POSIX does not allow ", msg);
1006 static int bc_POSIX_does_not_allow_bool_ops_this_is_bad(const char *msg)
1008 return bc_posix_error_fmt("%s%s %s", "POSIX does not allow ", "boolean operators; the following is bad:", msg);
1010 static int bc_POSIX_does_not_allow_empty_X_expression_in_for(const char *msg)
1012 return bc_posix_error_fmt("%san empty %s expression in a for loop", "POSIX does not allow ", msg);
1015 static int bc_error_bad_character(char c)
1017 return bc_error_fmt("bad character '%c'", c);
1019 static int bc_error_bad_expression(void)
1021 return bc_error("bad expression");
1023 static int bc_error_bad_token(void)
1025 return bc_error("bad token");
1027 static int bc_error_stack_has_too_few_elements(void)
1029 return bc_error("stack has too few elements");
1031 static int bc_error_variable_is_wrong_type(void)
1033 return bc_error("variable is wrong type");
1035 static int bc_error_nested_read_call(void)
1037 return bc_error("read() call inside of a read() call");
1040 static void bc_vec_grow(BcVec *v, size_t n)
1042 size_t cap = v->cap * 2;
1043 while (cap < v->len + n) cap *= 2;
1044 v->v = xrealloc(v->v, v->size * cap);
1048 static void bc_vec_init(BcVec *v, size_t esize, BcVecFree dtor)
1051 v->cap = BC_VEC_START_CAP;
1054 v->v = xmalloc(esize * BC_VEC_START_CAP);
1057 static void bc_char_vec_init(BcVec *v)
1059 bc_vec_init(v, sizeof(char), NULL);
1062 static void bc_vec_expand(BcVec *v, size_t req)
1065 v->v = xrealloc(v->v, v->size * req);
1070 #define bc_vec_pop(v) (bc_vec_npop((v), 1))
1071 #define bc_vec_top(v) (bc_vec_item_rev((v), 0))
1073 static void bc_vec_npop(BcVec *v, size_t n)
1078 size_t len = v->len - n;
1079 while (v->len > len) v->dtor(v->v + (v->size * --v->len));
1083 static void bc_vec_pop_all(BcVec *v)
1085 bc_vec_npop(v, v->len);
1088 static void bc_vec_push(BcVec *v, const void *data)
1090 if (v->len + 1 > v->cap) bc_vec_grow(v, 1);
1091 memmove(v->v + (v->size * v->len), data, v->size);
1095 #define bc_parse_push(p, i) bc_vec_pushByte(&(p)->func->code, (char) (i))
1097 static void bc_vec_pushByte(BcVec *v, char data)
1099 bc_vec_push(v, &data);
1102 static void bc_vec_pushZeroByte(BcVec *v)
1104 //bc_vec_pushByte(v, '\0');
1106 bc_vec_push(v, &const_int_0);
1109 static void bc_vec_pushAt(BcVec *v, const void *data, size_t idx)
1112 bc_vec_push(v, data);
1117 if (v->len == v->cap) bc_vec_grow(v, 1);
1119 ptr = v->v + v->size * idx;
1121 memmove(ptr + v->size, ptr, v->size * (v->len++ - idx));
1122 memmove(ptr, data, v->size);
1126 static void bc_vec_string(BcVec *v, size_t len, const char *str)
1129 bc_vec_expand(v, len + 1);
1130 memcpy(v->v, str, len);
1133 bc_vec_pushZeroByte(v);
1136 static void bc_vec_concat(BcVec *v, const char *str)
1140 if (v->len == 0) bc_vec_pushZeroByte(v);
1142 len = v->len + strlen(str);
1144 if (v->cap < len) bc_vec_grow(v, len - v->len);
1145 strcpy(v->v + v->len - 1, str);
1150 static void *bc_vec_item(const BcVec *v, size_t idx)
1152 return v->v + v->size * idx;
1155 static void *bc_vec_item_rev(const BcVec *v, size_t idx)
1157 return v->v + v->size * (v->len - idx - 1);
1160 static void bc_vec_free(void *vec)
1162 BcVec *v = (BcVec *) vec;
1167 static int bc_id_cmp(const void *e1, const void *e2)
1169 return strcmp(((const BcId *) e1)->name, ((const BcId *) e2)->name);
1172 static void bc_id_free(void *id)
1174 free(((BcId *) id)->name);
1177 static size_t bc_map_find(const BcVec *v, const void *ptr)
1179 size_t low = 0, high = v->len;
1181 while (low < high) {
1183 size_t mid = (low + high) / 2;
1184 BcId *id = bc_vec_item(v, mid);
1185 int result = bc_id_cmp(ptr, id);
1189 else if (result < 0)
1198 static int bc_map_insert(BcVec *v, const void *ptr, size_t *i)
1200 size_t n = *i = bc_map_find(v, ptr);
1203 bc_vec_push(v, ptr);
1204 else if (!bc_id_cmp(ptr, bc_vec_item(v, n)))
1205 return 0; // "was not inserted"
1207 bc_vec_pushAt(v, ptr, n);
1208 return 1; // "was inserted"
1212 static size_t bc_map_index(const BcVec *v, const void *ptr)
1214 size_t i = bc_map_find(v, ptr);
1215 if (i >= v->len) return BC_VEC_INVALID_IDX;
1216 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);
2677 static BcStatus bc_func_insert(BcFunc *f, char *name, bool var)
2682 for (i = 0; i < f->autos.len; ++i) {
2683 if (strcmp(name, ((BcId *) bc_vec_item(&f->autos, i))->name) == 0)
2684 return bc_error("function parameter or auto var has the same name as another");
2690 bc_vec_push(&f->autos, &a);
2692 return BC_STATUS_SUCCESS;
2696 static void bc_func_init(BcFunc *f)
2698 bc_char_vec_init(&f->code);
2699 bc_vec_init(&f->autos, sizeof(BcId), bc_id_free);
2700 bc_vec_init(&f->labels, sizeof(size_t), NULL);
2704 static void bc_func_free(void *func)
2706 BcFunc *f = (BcFunc *) func;
2707 bc_vec_free(&f->code);
2708 bc_vec_free(&f->autos);
2709 bc_vec_free(&f->labels);
2712 static void bc_array_expand(BcVec *a, size_t len);
2714 static void bc_array_init(BcVec *a, bool nums)
2717 bc_vec_init(a, sizeof(BcNum), bc_num_free);
2719 bc_vec_init(a, sizeof(BcVec), bc_vec_free);
2720 bc_array_expand(a, 1);
2723 static void bc_array_expand(BcVec *a, size_t len)
2727 if (a->size == sizeof(BcNum) && a->dtor == bc_num_free) {
2728 while (len > a->len) {
2729 bc_num_init(&data.n, BC_NUM_DEF_SIZE);
2730 bc_vec_push(a, &data.n);
2734 while (len > a->len) {
2735 bc_array_init(&data.v, true);
2736 bc_vec_push(a, &data.v);
2741 static void bc_array_copy(BcVec *d, const BcVec *s)
2746 bc_vec_expand(d, s->cap);
2749 for (i = 0; i < s->len; ++i) {
2750 BcNum *dnum = bc_vec_item(d, i), *snum = bc_vec_item(s, i);
2751 bc_num_init(dnum, snum->len);
2752 bc_num_copy(dnum, snum);
2756 static void bc_string_free(void *string)
2758 free(*((char **) string));
2762 static void bc_result_copy(BcResult *d, BcResult *src)
2768 case BC_RESULT_TEMP:
2769 case BC_RESULT_IBASE:
2770 case BC_RESULT_SCALE:
2771 case BC_RESULT_OBASE:
2773 bc_num_init(&d->d.n, src->d.n.len);
2774 bc_num_copy(&d->d.n, &src->d.n);
2779 case BC_RESULT_ARRAY:
2780 case BC_RESULT_ARRAY_ELEM:
2782 d->d.id.name = xstrdup(src->d.id.name);
2786 case BC_RESULT_CONSTANT:
2787 case BC_RESULT_LAST:
2791 memcpy(&d->d.n, &src->d.n, sizeof(BcNum));
2798 static void bc_result_free(void *result)
2800 BcResult *r = (BcResult *) result;
2804 case BC_RESULT_TEMP:
2805 case BC_RESULT_IBASE:
2806 case BC_RESULT_SCALE:
2807 case BC_RESULT_OBASE:
2809 bc_num_free(&r->d.n);
2814 case BC_RESULT_ARRAY:
2815 case BC_RESULT_ARRAY_ELEM:
2829 static void bc_lex_lineComment(BcLex *l)
2831 l->t.t = BC_LEX_WHITESPACE;
2832 while (l->i < l->len && l->buf[l->i++] != '\n');
2836 static void bc_lex_whitespace(BcLex *l)
2839 l->t.t = BC_LEX_WHITESPACE;
2840 for (c = l->buf[l->i]; c != '\n' && isspace(c); c = l->buf[++l->i]);
2843 static BcStatus bc_lex_number(BcLex *l, char start)
2845 const char *buf = l->buf + l->i;
2846 size_t len, hits = 0, bslashes = 0, i = 0, j;
2848 bool last_pt, pt = start == '.';
2851 l->t.t = BC_LEX_NUMBER;
2853 while (c != 0 && (isdigit(c) || (c >= 'A' && c <= 'F') ||
2854 (c == '.' && !pt) || (c == '\\' && buf[i + 1] == '\n')))
2868 len = i + !last_pt - bslashes * 2;
2869 if (len > BC_MAX_NUM)
2870 return bc_error("number too long: must be [1, BC_NUM_MAX]");
2872 bc_vec_pop_all(&l->t.v);
2873 bc_vec_expand(&l->t.v, len + 1);
2874 bc_vec_push(&l->t.v, &start);
2876 for (buf -= 1, j = 1; j < len + hits * 2; ++j) {
2880 // If we have hit a backslash, skip it. We don't have
2881 // to check for a newline because it's guaranteed.
2882 if (hits < bslashes && c == '\\') {
2888 bc_vec_push(&l->t.v, &c);
2891 bc_vec_pushZeroByte(&l->t.v);
2894 return BC_STATUS_SUCCESS;
2897 static BcStatus bc_lex_name(BcLex *l)
2900 const char *buf = l->buf + l->i - 1;
2903 l->t.t = BC_LEX_NAME;
2905 while ((c >= 'a' && c <= 'z') || isdigit(c) || c == '_') c = buf[++i];
2907 if (i > BC_MAX_STRING)
2908 return bc_error("name too long: must be [1, BC_NAME_MAX]");
2909 bc_vec_string(&l->t.v, i, buf);
2911 // Increment the index. We minus 1 because it has already been incremented.
2914 return BC_STATUS_SUCCESS;
2917 static void bc_lex_init(BcLex *l, BcLexNext next)
2920 bc_char_vec_init(&l->t.v);
2923 static void bc_lex_free(BcLex *l)
2925 bc_vec_free(&l->t.v);
2928 static void bc_lex_file(BcLex *l)
2930 G.err_line = l->line = 1;
2934 static BcStatus bc_lex_next(BcLex *l)
2939 if (l->t.last == BC_LEX_EOF) return bc_error("end of file");
2941 l->line += l->newline;
2942 G.err_line = l->line;
2943 l->t.t = BC_LEX_EOF;
2945 l->newline = (l->i == l->len);
2946 if (l->newline) return BC_STATUS_SUCCESS;
2948 // Loop until failure or we don't have whitespace. This
2949 // is so the parser doesn't get inundated with whitespace.
2952 } while (!s && l->t.t == BC_LEX_WHITESPACE);
2957 static BcStatus bc_lex_text(BcLex *l, const char *text)
2961 l->len = strlen(text);
2962 l->t.t = l->t.last = BC_LEX_INVALID;
2963 return bc_lex_next(l);
2967 static BcStatus bc_lex_identifier(BcLex *l)
2971 const char *buf = l->buf + l->i - 1;
2973 for (i = 0; i < ARRAY_SIZE(bc_lex_kws); ++i) {
2974 const char *keyword8 = bc_lex_kws[i].name8;
2976 while (buf[j] != '\0' && buf[j] == keyword8[j]) {
2978 if (j == 8) goto match;
2980 if (keyword8[j] != '\0')
2983 // buf starts with keyword bc_lex_kws[i]
2984 l->t.t = BC_LEX_KEY_1st_keyword + i;
2985 if (!((1 << i) & POSIX_KWORD_MASK)) {
2986 s = bc_posix_error_fmt("%sthe '%.8s' keyword", "POSIX does not allow ", bc_lex_kws[i].name8);
2990 // We minus 1 because the index has already been incremented.
2992 return BC_STATUS_SUCCESS;
2998 if (l->t.v.len > 2) {
3001 // bc: POSIX only allows one character names; the following is bad: 'qwe=1
3003 unsigned len = strchrnul(buf, '\n') - buf;
3004 s = bc_posix_error_fmt("POSIX only allows one character names; the following is bad: '%.*s'", len, buf);
3010 static BcStatus bc_lex_string(BcLex *l)
3012 size_t len, nls = 0, i = l->i;
3015 l->t.t = BC_LEX_STR;
3017 for (c = l->buf[i]; c != 0 && c != '"'; c = l->buf[++i]) nls += (c == '\n');
3021 return bc_error("string end could not be found");
3025 if (len > BC_MAX_STRING)
3026 return bc_error("string too long: must be [1, BC_STRING_MAX]");
3027 bc_vec_string(&l->t.v, len, l->buf + l->i);
3031 G.err_line = l->line;
3033 return BC_STATUS_SUCCESS;
3036 static void bc_lex_assign(BcLex *l, BcLexType with, BcLexType without)
3038 if (l->buf[l->i] == '=') {
3046 static BcStatus bc_lex_comment(BcLex *l)
3049 const char *buf = l->buf;
3051 l->t.t = BC_LEX_WHITESPACE;
3064 return bc_error("comment end could not be found");
3072 G.err_line = l->line;
3074 return BC_STATUS_SUCCESS;
3077 static BcStatus bc_lex_token(BcLex *l)
3079 BcStatus s = BC_STATUS_SUCCESS;
3080 char c = l->buf[l->i++], c2;
3082 // This is the workhorse of the lexer.
3089 l->t.t = !c ? BC_LEX_EOF : BC_LEX_NLINE;
3099 bc_lex_whitespace(l);
3105 bc_lex_assign(l, BC_LEX_OP_REL_NE, BC_LEX_OP_BOOL_NOT);
3107 if (l->t.t == BC_LEX_OP_BOOL_NOT) {
3108 s = bc_POSIX_does_not_allow_bool_ops_this_is_bad("!");
3117 s = bc_lex_string(l);
3123 s = bc_POSIX_does_not_allow("'#' script comments");
3126 bc_lex_lineComment(l);
3133 bc_lex_assign(l, BC_LEX_OP_ASSIGN_MODULUS, BC_LEX_OP_MODULUS);
3142 s = bc_POSIX_does_not_allow_bool_ops_this_is_bad("&&");
3146 l->t.t = BC_LEX_OP_BOOL_AND;
3149 l->t.t = BC_LEX_INVALID;
3150 s = bc_error_bad_character('&');
3159 l->t.t = (BcLexType)(c - '(' + BC_LEX_LPAREN);
3165 bc_lex_assign(l, BC_LEX_OP_ASSIGN_MULTIPLY, BC_LEX_OP_MULTIPLY);
3174 l->t.t = BC_LEX_OP_INC;
3177 bc_lex_assign(l, BC_LEX_OP_ASSIGN_PLUS, BC_LEX_OP_PLUS);
3183 l->t.t = BC_LEX_COMMA;
3192 l->t.t = BC_LEX_OP_DEC;
3195 bc_lex_assign(l, BC_LEX_OP_ASSIGN_MINUS, BC_LEX_OP_MINUS);
3201 if (isdigit(l->buf[l->i]))
3202 s = bc_lex_number(l, c);
3204 l->t.t = BC_LEX_KEY_LAST;
3205 s = bc_POSIX_does_not_allow("a period ('.') as a shortcut for the last result");
3214 s = bc_lex_comment(l);
3216 bc_lex_assign(l, BC_LEX_OP_ASSIGN_DIVIDE, BC_LEX_OP_DIVIDE);
3237 s = bc_lex_number(l, c);
3243 l->t.t = BC_LEX_SCOLON;
3249 bc_lex_assign(l, BC_LEX_OP_REL_LE, BC_LEX_OP_REL_LT);
3255 bc_lex_assign(l, BC_LEX_OP_REL_EQ, BC_LEX_OP_ASSIGN);
3261 bc_lex_assign(l, BC_LEX_OP_REL_GE, BC_LEX_OP_REL_GT);
3268 l->t.t = (BcLexType)(c - '[' + BC_LEX_LBRACKET);
3274 if (l->buf[l->i] == '\n') {
3275 l->t.t = BC_LEX_WHITESPACE;
3279 s = bc_error_bad_character(c);
3285 bc_lex_assign(l, BC_LEX_OP_ASSIGN_POWER, BC_LEX_OP_POWER);
3316 s = bc_lex_identifier(l);
3323 l->t.t = (BcLexType)(c - '{' + BC_LEX_LBRACE);
3332 s = bc_POSIX_does_not_allow_bool_ops_this_is_bad("||");
3336 l->t.t = BC_LEX_OP_BOOL_OR;
3339 l->t.t = BC_LEX_INVALID;
3340 s = bc_error_bad_character(c);
3348 l->t.t = BC_LEX_INVALID;
3349 s = bc_error_bad_character(c);
3359 static BcStatus dc_lex_register(BcLex *l)
3361 BcStatus s = BC_STATUS_SUCCESS;
3363 if (isspace(l->buf[l->i - 1])) {
3364 bc_lex_whitespace(l);
3367 s = bc_error("extended register");
3372 bc_vec_pop_all(&l->t.v);
3373 bc_vec_push(&l->t.v, &l->buf[l->i - 1]);
3374 bc_vec_pushZeroByte(&l->t.v);
3375 l->t.t = BC_LEX_NAME;
3381 static BcStatus dc_lex_string(BcLex *l)
3383 size_t depth = 1, nls = 0, i = l->i;
3386 l->t.t = BC_LEX_STR;
3387 bc_vec_pop_all(&l->t.v);
3389 for (c = l->buf[i]; c != 0 && depth; c = l->buf[++i]) {
3391 depth += (c == '[' && (i == l->i || l->buf[i - 1] != '\\'));
3392 depth -= (c == ']' && (i == l->i || l->buf[i - 1] != '\\'));
3395 if (depth) bc_vec_push(&l->t.v, &c);
3400 return bc_error("string end could not be found");
3403 bc_vec_pushZeroByte(&l->t.v);
3404 if (i - l->i > BC_MAX_STRING)
3405 return bc_error("string too long: must be [1, BC_STRING_MAX]");
3409 G.err_line = l->line;
3411 return BC_STATUS_SUCCESS;
3414 static BcStatus dc_lex_token(BcLex *l)
3416 BcStatus s = BC_STATUS_SUCCESS;
3417 char c = l->buf[l->i++], c2;
3420 for (i = 0; i < ARRAY_SIZE(dc_lex_regs); ++i) {
3421 if (l->t.last == dc_lex_regs[i])
3422 return dc_lex_register(l);
3425 if (c >= '%' && c <= '~' &&
3426 (l->t.t = dc_lex_tokens[(c - '%')]) != BC_LEX_INVALID)
3431 // This is the workhorse of the lexer.
3436 l->t.t = BC_LEX_EOF;
3447 l->newline = (c == '\n');
3448 bc_lex_whitespace(l);
3457 l->t.t = BC_LEX_OP_REL_NE;
3459 l->t.t = BC_LEX_OP_REL_LE;
3461 l->t.t = BC_LEX_OP_REL_GE;
3463 return bc_error_bad_character(c);
3471 bc_lex_lineComment(l);
3477 if (isdigit(l->buf[l->i]))
3478 s = bc_lex_number(l, c);
3480 s = bc_error_bad_character(c);
3501 s = bc_lex_number(l, c);
3507 s = dc_lex_string(l);
3513 l->t.t = BC_LEX_INVALID;
3514 s = bc_error_bad_character(c);
3523 static void bc_program_addFunc(char *name, size_t *idx);
3525 static void bc_parse_addFunc(BcParse *p, char *name, size_t *idx)
3527 bc_program_addFunc(name, idx);
3528 p->func = bc_vec_item(&G.prog.fns, p->fidx);
3531 static void bc_parse_pushName(BcParse *p, char *name)
3533 size_t i = 0, len = strlen(name);
3535 for (; i < len; ++i) bc_parse_push(p, name[i]);
3536 bc_parse_push(p, BC_PARSE_STREND);
3541 static void bc_parse_pushIndex(BcParse *p, size_t idx)
3543 unsigned char amt, i, nums[sizeof(size_t)];
3545 for (amt = 0; idx; ++amt) {
3546 nums[amt] = (char) idx;
3547 idx = (idx & ((unsigned long) ~(UCHAR_MAX))) >> sizeof(char) * CHAR_BIT;
3550 bc_parse_push(p, amt);
3551 for (i = 0; i < amt; ++i) bc_parse_push(p, nums[i]);
3554 static void bc_parse_number(BcParse *p, BcInst *prev, size_t *nexs)
3556 char *num = xstrdup(p->l.t.v.v);
3557 size_t idx = G.prog.consts.len;
3559 bc_vec_push(&G.prog.consts, &num);
3561 bc_parse_push(p, BC_INST_NUM);
3562 bc_parse_pushIndex(p, idx);
3565 (*prev) = BC_INST_NUM;
3568 static BcStatus bc_parse_text(BcParse *p, const char *text)
3572 p->func = bc_vec_item(&G.prog.fns, p->fidx);
3574 if (!text[0] && !BC_PARSE_CAN_EXEC(p)) {
3575 p->l.t.t = BC_LEX_INVALID;
3578 if (!BC_PARSE_CAN_EXEC(p))
3579 return bc_error("file is not executable");
3582 return bc_lex_text(&p->l, text);
3585 // Called when parsing or execution detects a failure,
3586 // resets execution structures.
3587 static void bc_program_reset(void)
3592 bc_vec_npop(&G.prog.stack, G.prog.stack.len - 1);
3593 bc_vec_pop_all(&G.prog.results);
3595 f = bc_vec_item(&G.prog.fns, 0);
3596 ip = bc_vec_top(&G.prog.stack);
3597 ip->idx = f->code.len;
3600 #define bc_parse_updateFunc(p, f) \
3601 ((p)->func = bc_vec_item(&G.prog.fns, ((p)->fidx = (f))))
3603 // Called when bc/dc_parse_parse() detects a failure,
3604 // resets parsing structures.
3605 static void bc_parse_reset(BcParse *p)
3607 if (p->fidx != BC_PROG_MAIN) {
3608 p->func->nparams = 0;
3609 bc_vec_pop_all(&p->func->code);
3610 bc_vec_pop_all(&p->func->autos);
3611 bc_vec_pop_all(&p->func->labels);
3613 bc_parse_updateFunc(p, BC_PROG_MAIN);
3617 p->l.t.t = BC_LEX_EOF;
3618 p->auto_part = (p->nbraces = 0);
3620 bc_vec_npop(&p->flags, p->flags.len - 1);
3621 bc_vec_pop_all(&p->exits);
3622 bc_vec_pop_all(&p->conds);
3623 bc_vec_pop_all(&p->ops);
3628 static void bc_parse_free(BcParse *p)
3630 bc_vec_free(&p->flags);
3631 bc_vec_free(&p->exits);
3632 bc_vec_free(&p->conds);
3633 bc_vec_free(&p->ops);
3637 static void bc_parse_create(BcParse *p, size_t func,
3638 BcParseParse parse, BcLexNext next)
3640 memset(p, 0, sizeof(BcParse));
3642 bc_lex_init(&p->l, next);
3643 bc_vec_init(&p->flags, sizeof(uint8_t), NULL);
3644 bc_vec_init(&p->exits, sizeof(BcInstPtr), NULL);
3645 bc_vec_init(&p->conds, sizeof(size_t), NULL);
3646 bc_vec_pushZeroByte(&p->flags);
3647 bc_vec_init(&p->ops, sizeof(BcLexType), NULL);
3650 // p->auto_part = p->nbraces = 0; - already is
3651 bc_parse_updateFunc(p, func);
3656 #define BC_PARSE_TOP_OP(p) (*((BcLexType *) bc_vec_top(&(p)->ops)))
3657 #define BC_PARSE_LEAF(p, rparen) \
3658 (((p) >= BC_INST_NUM && (p) <= BC_INST_SQRT) || (rparen) || \
3659 (p) == BC_INST_INC_POST || (p) == BC_INST_DEC_POST)
3661 // We can calculate the conversion between tokens and exprs by subtracting the
3662 // position of the first operator in the lex enum and adding the position of the
3663 // first in the expr enum. Note: This only works for binary operators.
3664 #define BC_PARSE_TOKEN_INST(t) ((char) ((t) -BC_LEX_NEG + BC_INST_NEG))
3666 static BcStatus bc_parse_else(BcParse *p);
3667 static BcStatus bc_parse_stmt(BcParse *p);
3668 static BcStatus bc_parse_expr(BcParse *p, uint8_t flags, BcParseNext next);
3669 static BcStatus bc_parse_expr_empty_ok(BcParse *p, uint8_t flags, BcParseNext next);
3671 static BcStatus bc_parse_operator(BcParse *p, BcLexType type, size_t start,
3672 size_t *nexprs, bool next)
3674 BcStatus s = BC_STATUS_SUCCESS;
3676 char l, r = bc_parse_op_PREC(type - BC_LEX_OP_INC);
3677 bool left = bc_parse_op_LEFT(type - BC_LEX_OP_INC);
3679 while (p->ops.len > start) {
3681 t = BC_PARSE_TOP_OP(p);
3682 if (t == BC_LEX_LPAREN) break;
3684 l = bc_parse_op_PREC(t - BC_LEX_OP_INC);
3685 if (l >= r && (l != r || !left)) break;
3687 bc_parse_push(p, BC_PARSE_TOKEN_INST(t));
3688 bc_vec_pop(&p->ops);
3689 *nexprs -= t != BC_LEX_OP_BOOL_NOT && t != BC_LEX_NEG;
3692 bc_vec_push(&p->ops, &type);
3693 if (next) s = bc_lex_next(&p->l);
3698 static BcStatus bc_parse_rightParen(BcParse *p, size_t ops_bgn, size_t *nexs)
3702 if (p->ops.len <= ops_bgn)
3703 return bc_error_bad_expression();
3704 top = BC_PARSE_TOP_OP(p);
3706 while (top != BC_LEX_LPAREN) {
3708 bc_parse_push(p, BC_PARSE_TOKEN_INST(top));
3710 bc_vec_pop(&p->ops);
3711 *nexs -= top != BC_LEX_OP_BOOL_NOT && top != BC_LEX_NEG;
3713 if (p->ops.len <= ops_bgn)
3714 return bc_error_bad_expression();
3715 top = BC_PARSE_TOP_OP(p);
3718 bc_vec_pop(&p->ops);
3720 return bc_lex_next(&p->l);
3723 static BcStatus bc_parse_params(BcParse *p, uint8_t flags)
3729 s = bc_lex_next(&p->l);
3732 for (nparams = 0; p->l.t.t != BC_LEX_RPAREN; ++nparams) {
3734 flags = (flags & ~(BC_PARSE_PRINT | BC_PARSE_REL)) | BC_PARSE_ARRAY;
3735 s = bc_parse_expr(p, flags, bc_parse_next_param);
3738 comma = p->l.t.t == BC_LEX_COMMA;
3740 s = bc_lex_next(&p->l);
3745 if (comma) return bc_error_bad_token();
3746 bc_parse_push(p, BC_INST_CALL);
3747 bc_parse_pushIndex(p, nparams);
3749 return BC_STATUS_SUCCESS;
3752 static BcStatus bc_parse_call(BcParse *p, char *name, uint8_t flags)
3755 BcId entry, *entry_ptr;
3760 s = bc_parse_params(p, flags);
3763 if (p->l.t.t != BC_LEX_RPAREN) {
3764 s = bc_error_bad_token();
3768 idx = bc_map_index(&G.prog.fn_map, &entry);
3770 if (idx == BC_VEC_INVALID_IDX) {
3771 name = xstrdup(entry.name);
3772 bc_parse_addFunc(p, name, &idx);
3773 idx = bc_map_index(&G.prog.fn_map, &entry);
3779 entry_ptr = bc_vec_item(&G.prog.fn_map, idx);
3780 bc_parse_pushIndex(p, entry_ptr->idx);
3782 return bc_lex_next(&p->l);
3789 static BcStatus bc_parse_name(BcParse *p, BcInst *type, uint8_t flags)
3794 name = xstrdup(p->l.t.v.v);
3795 s = bc_lex_next(&p->l);
3798 if (p->l.t.t == BC_LEX_LBRACKET) {
3800 s = bc_lex_next(&p->l);
3803 if (p->l.t.t == BC_LEX_RBRACKET) {
3805 if (!(flags & BC_PARSE_ARRAY)) {
3806 s = bc_error_bad_expression();
3810 *type = BC_INST_ARRAY;
3814 *type = BC_INST_ARRAY_ELEM;
3816 flags &= ~(BC_PARSE_PRINT | BC_PARSE_REL);
3817 s = bc_parse_expr(p, flags, bc_parse_next_elem);
3821 s = bc_lex_next(&p->l);
3823 bc_parse_push(p, *type);
3824 bc_parse_pushName(p, name);
3826 else if (p->l.t.t == BC_LEX_LPAREN) {
3828 if (flags & BC_PARSE_NOCALL) {
3829 s = bc_error_bad_token();
3833 *type = BC_INST_CALL;
3834 s = bc_parse_call(p, name, flags);
3837 *type = BC_INST_VAR;
3838 bc_parse_push(p, BC_INST_VAR);
3839 bc_parse_pushName(p, name);
3849 static BcStatus bc_parse_read(BcParse *p)
3853 s = bc_lex_next(&p->l);
3855 if (p->l.t.t != BC_LEX_LPAREN) return bc_error_bad_token();
3857 s = bc_lex_next(&p->l);
3859 if (p->l.t.t != BC_LEX_RPAREN) return bc_error_bad_token();
3861 bc_parse_push(p, BC_INST_READ);
3863 return bc_lex_next(&p->l);
3866 static BcStatus bc_parse_builtin(BcParse *p, BcLexType type, uint8_t flags,
3871 s = bc_lex_next(&p->l);
3873 if (p->l.t.t != BC_LEX_LPAREN) return bc_error_bad_token();
3875 flags = (flags & ~(BC_PARSE_PRINT | BC_PARSE_REL)) | BC_PARSE_ARRAY;
3877 s = bc_lex_next(&p->l);
3880 s = bc_parse_expr(p, flags, bc_parse_next_rel);
3883 if (p->l.t.t != BC_LEX_RPAREN) return bc_error_bad_token();
3885 *prev = (type == BC_LEX_KEY_LENGTH) ? BC_INST_LENGTH : BC_INST_SQRT;
3886 bc_parse_push(p, *prev);
3888 return bc_lex_next(&p->l);
3891 static BcStatus bc_parse_scale(BcParse *p, BcInst *type, uint8_t flags)
3895 s = bc_lex_next(&p->l);
3898 if (p->l.t.t != BC_LEX_LPAREN) {
3899 *type = BC_INST_SCALE;
3900 bc_parse_push(p, BC_INST_SCALE);
3901 return BC_STATUS_SUCCESS;
3904 *type = BC_INST_SCALE_FUNC;
3905 flags &= ~(BC_PARSE_PRINT | BC_PARSE_REL);
3907 s = bc_lex_next(&p->l);
3910 s = bc_parse_expr(p, flags, bc_parse_next_rel);
3912 if (p->l.t.t != BC_LEX_RPAREN) return bc_error_bad_token();
3913 bc_parse_push(p, BC_INST_SCALE_FUNC);
3915 return bc_lex_next(&p->l);
3918 static BcStatus bc_parse_incdec(BcParse *p, BcInst *prev, bool *paren_expr,
3919 size_t *nexprs, uint8_t flags)
3924 BcInst etype = *prev;
3926 if (etype == BC_INST_VAR || etype == BC_INST_ARRAY_ELEM ||
3927 etype == BC_INST_SCALE || etype == BC_INST_LAST ||
3928 etype == BC_INST_IBASE || etype == BC_INST_OBASE)
3930 *prev = inst = BC_INST_INC_POST + (p->l.t.t != BC_LEX_OP_INC);
3931 bc_parse_push(p, inst);
3932 s = bc_lex_next(&p->l);
3936 *prev = inst = BC_INST_INC_PRE + (p->l.t.t != BC_LEX_OP_INC);
3939 s = bc_lex_next(&p->l);
3943 // Because we parse the next part of the expression
3944 // right here, we need to increment this.
3945 *nexprs = *nexprs + 1;
3951 s = bc_parse_name(p, prev, flags | BC_PARSE_NOCALL);
3955 case BC_LEX_KEY_IBASE:
3956 case BC_LEX_KEY_LAST:
3957 case BC_LEX_KEY_OBASE:
3959 bc_parse_push(p, type - BC_LEX_KEY_IBASE + BC_INST_IBASE);
3960 s = bc_lex_next(&p->l);
3964 case BC_LEX_KEY_SCALE:
3966 s = bc_lex_next(&p->l);
3968 if (p->l.t.t == BC_LEX_LPAREN)
3969 s = bc_error_bad_token();
3971 bc_parse_push(p, BC_INST_SCALE);
3977 s = bc_error_bad_token();
3982 if (!s) bc_parse_push(p, inst);
3988 static BcStatus bc_parse_minus(BcParse *p, BcInst *prev, size_t ops_bgn,
3989 bool rparen, size_t *nexprs)
3993 BcInst etype = *prev;
3995 s = bc_lex_next(&p->l);
3998 type = rparen || etype == BC_INST_INC_POST || etype == BC_INST_DEC_POST ||
3999 (etype >= BC_INST_NUM && etype <= BC_INST_SQRT) ?
4002 *prev = BC_PARSE_TOKEN_INST(type);
4004 // We can just push onto the op stack because this is the largest
4005 // precedence operator that gets pushed. Inc/dec does not.
4006 if (type != BC_LEX_OP_MINUS)
4007 bc_vec_push(&p->ops, &type);
4009 s = bc_parse_operator(p, type, ops_bgn, nexprs, false);
4014 static BcStatus bc_parse_string(BcParse *p, char inst)
4016 char *str = xstrdup(p->l.t.v.v);
4018 bc_parse_push(p, BC_INST_STR);
4019 bc_parse_pushIndex(p, G.prog.strs.len);
4020 bc_vec_push(&G.prog.strs, &str);
4021 bc_parse_push(p, inst);
4023 return bc_lex_next(&p->l);
4026 static BcStatus bc_parse_print(BcParse *p)
4032 s = bc_lex_next(&p->l);
4037 if (type == BC_LEX_SCOLON || type == BC_LEX_NLINE)
4038 return bc_error("bad print statement");
4040 while (!s && type != BC_LEX_SCOLON && type != BC_LEX_NLINE) {
4042 if (type == BC_LEX_STR)
4043 s = bc_parse_string(p, BC_INST_PRINT_POP);
4045 s = bc_parse_expr(p, 0, bc_parse_next_print);
4047 bc_parse_push(p, BC_INST_PRINT_POP);
4052 comma = p->l.t.t == BC_LEX_COMMA;
4053 if (comma) s = bc_lex_next(&p->l);
4058 if (comma) return bc_error_bad_token();
4060 return bc_lex_next(&p->l);
4063 static BcStatus bc_parse_return(BcParse *p)
4069 if (!BC_PARSE_FUNC(p)) return bc_error_bad_token();
4071 s = bc_lex_next(&p->l);
4075 paren = t == BC_LEX_LPAREN;
4077 if (t == BC_LEX_NLINE || t == BC_LEX_SCOLON)
4078 bc_parse_push(p, BC_INST_RET0);
4081 s = bc_parse_expr_empty_ok(p, 0, bc_parse_next_expr);
4082 if (s == BC_STATUS_PARSE_EMPTY_EXP) {
4083 bc_parse_push(p, BC_INST_RET0);
4084 s = bc_lex_next(&p->l);
4088 if (!paren || p->l.t.last != BC_LEX_RPAREN) {
4089 s = bc_POSIX_requires("parentheses around return expressions");
4093 bc_parse_push(p, BC_INST_RET);
4099 static BcStatus bc_parse_endBody(BcParse *p, bool brace)
4101 BcStatus s = BC_STATUS_SUCCESS;
4103 if (p->flags.len <= 1 || (brace && p->nbraces == 0))
4104 return bc_error_bad_token();
4108 if (p->l.t.t == BC_LEX_RBRACE) {
4109 if (!p->nbraces) return bc_error_bad_token();
4111 s = bc_lex_next(&p->l);
4115 return bc_error_bad_token();
4118 if (BC_PARSE_IF(p)) {
4122 while (p->l.t.t == BC_LEX_NLINE) {
4123 s = bc_lex_next(&p->l);
4127 bc_vec_pop(&p->flags);
4129 flag_ptr = BC_PARSE_TOP_FLAG_PTR(p);
4130 *flag_ptr = (*flag_ptr | BC_PARSE_FLAG_IF_END);
4132 if (p->l.t.t == BC_LEX_KEY_ELSE) s = bc_parse_else(p);
4134 else if (BC_PARSE_ELSE(p)) {
4139 bc_vec_pop(&p->flags);
4141 ip = bc_vec_top(&p->exits);
4142 label = bc_vec_item(&p->func->labels, ip->idx);
4143 *label = p->func->code.len;
4145 bc_vec_pop(&p->exits);
4147 else if (BC_PARSE_FUNC_INNER(p)) {
4148 bc_parse_push(p, BC_INST_RET0);
4149 bc_parse_updateFunc(p, BC_PROG_MAIN);
4150 bc_vec_pop(&p->flags);
4154 BcInstPtr *ip = bc_vec_top(&p->exits);
4155 size_t *label = bc_vec_top(&p->conds);
4157 bc_parse_push(p, BC_INST_JUMP);
4158 bc_parse_pushIndex(p, *label);
4160 label = bc_vec_item(&p->func->labels, ip->idx);
4161 *label = p->func->code.len;
4163 bc_vec_pop(&p->flags);
4164 bc_vec_pop(&p->exits);
4165 bc_vec_pop(&p->conds);
4171 static void bc_parse_startBody(BcParse *p, uint8_t flags)
4173 uint8_t *flag_ptr = BC_PARSE_TOP_FLAG_PTR(p);
4174 flags |= (*flag_ptr & (BC_PARSE_FLAG_FUNC | BC_PARSE_FLAG_LOOP));
4175 flags |= BC_PARSE_FLAG_BODY;
4176 bc_vec_push(&p->flags, &flags);
4179 static void bc_parse_noElse(BcParse *p)
4183 uint8_t *flag_ptr = BC_PARSE_TOP_FLAG_PTR(p);
4185 *flag_ptr = (*flag_ptr & ~(BC_PARSE_FLAG_IF_END));
4187 ip = bc_vec_top(&p->exits);
4188 label = bc_vec_item(&p->func->labels, ip->idx);
4189 *label = p->func->code.len;
4191 bc_vec_pop(&p->exits);
4194 static BcStatus bc_parse_if(BcParse *p)
4199 s = bc_lex_next(&p->l);
4201 if (p->l.t.t != BC_LEX_LPAREN) return bc_error_bad_token();
4203 s = bc_lex_next(&p->l);
4205 s = bc_parse_expr(p, BC_PARSE_REL, bc_parse_next_rel);
4207 if (p->l.t.t != BC_LEX_RPAREN) return bc_error_bad_token();
4209 s = bc_lex_next(&p->l);
4211 bc_parse_push(p, BC_INST_JUMP_ZERO);
4213 ip.idx = p->func->labels.len;
4214 ip.func = ip.len = 0;
4216 bc_parse_pushIndex(p, ip.idx);
4217 bc_vec_push(&p->exits, &ip);
4218 bc_vec_push(&p->func->labels, &ip.idx);
4219 bc_parse_startBody(p, BC_PARSE_FLAG_IF);
4221 return BC_STATUS_SUCCESS;
4224 static BcStatus bc_parse_else(BcParse *p)
4228 if (!BC_PARSE_IF_END(p)) return bc_error_bad_token();
4230 ip.idx = p->func->labels.len;
4231 ip.func = ip.len = 0;
4233 bc_parse_push(p, BC_INST_JUMP);
4234 bc_parse_pushIndex(p, ip.idx);
4238 bc_vec_push(&p->exits, &ip);
4239 bc_vec_push(&p->func->labels, &ip.idx);
4240 bc_parse_startBody(p, BC_PARSE_FLAG_ELSE);
4242 return bc_lex_next(&p->l);
4245 static BcStatus bc_parse_while(BcParse *p)
4250 s = bc_lex_next(&p->l);
4252 if (p->l.t.t != BC_LEX_LPAREN) return bc_error_bad_token();
4253 s = bc_lex_next(&p->l);
4256 ip.idx = p->func->labels.len;
4258 bc_vec_push(&p->func->labels, &p->func->code.len);
4259 bc_vec_push(&p->conds, &ip.idx);
4261 ip.idx = p->func->labels.len;
4265 bc_vec_push(&p->exits, &ip);
4266 bc_vec_push(&p->func->labels, &ip.idx);
4268 s = bc_parse_expr(p, BC_PARSE_REL, bc_parse_next_rel);
4270 if (p->l.t.t != BC_LEX_RPAREN) return bc_error_bad_token();
4271 s = bc_lex_next(&p->l);
4274 bc_parse_push(p, BC_INST_JUMP_ZERO);
4275 bc_parse_pushIndex(p, ip.idx);
4276 bc_parse_startBody(p, BC_PARSE_FLAG_LOOP | BC_PARSE_FLAG_LOOP_INNER);
4278 return BC_STATUS_SUCCESS;
4281 static BcStatus bc_parse_for(BcParse *p)
4285 size_t cond_idx, exit_idx, body_idx, update_idx;
4287 s = bc_lex_next(&p->l);
4289 if (p->l.t.t != BC_LEX_LPAREN) return bc_error_bad_token();
4290 s = bc_lex_next(&p->l);
4293 if (p->l.t.t != BC_LEX_SCOLON)
4294 s = bc_parse_expr(p, 0, bc_parse_next_for);
4296 s = bc_POSIX_does_not_allow_empty_X_expression_in_for("init");
4299 if (p->l.t.t != BC_LEX_SCOLON) return bc_error_bad_token();
4300 s = bc_lex_next(&p->l);
4303 cond_idx = p->func->labels.len;
4304 update_idx = cond_idx + 1;
4305 body_idx = update_idx + 1;
4306 exit_idx = body_idx + 1;
4308 bc_vec_push(&p->func->labels, &p->func->code.len);
4310 if (p->l.t.t != BC_LEX_SCOLON)
4311 s = bc_parse_expr(p, BC_PARSE_REL, bc_parse_next_for);
4313 s = bc_POSIX_does_not_allow_empty_X_expression_in_for("condition");
4316 if (p->l.t.t != BC_LEX_SCOLON) return bc_error_bad_token();
4318 s = bc_lex_next(&p->l);
4321 bc_parse_push(p, BC_INST_JUMP_ZERO);
4322 bc_parse_pushIndex(p, exit_idx);
4323 bc_parse_push(p, BC_INST_JUMP);
4324 bc_parse_pushIndex(p, body_idx);
4326 ip.idx = p->func->labels.len;
4328 bc_vec_push(&p->conds, &update_idx);
4329 bc_vec_push(&p->func->labels, &p->func->code.len);
4331 if (p->l.t.t != BC_LEX_RPAREN)
4332 s = bc_parse_expr(p, 0, bc_parse_next_rel);
4334 s = bc_POSIX_does_not_allow_empty_X_expression_in_for("update");
4338 if (p->l.t.t != BC_LEX_RPAREN) return bc_error_bad_token();
4339 bc_parse_push(p, BC_INST_JUMP);
4340 bc_parse_pushIndex(p, cond_idx);
4341 bc_vec_push(&p->func->labels, &p->func->code.len);
4347 bc_vec_push(&p->exits, &ip);
4348 bc_vec_push(&p->func->labels, &ip.idx);
4350 bc_parse_startBody(p, BC_PARSE_FLAG_LOOP | BC_PARSE_FLAG_LOOP_INNER);
4352 return BC_STATUS_SUCCESS;
4355 static BcStatus bc_parse_loopExit(BcParse *p, BcLexType type)
4361 if (!BC_PARSE_LOOP(p)) return bc_error_bad_token();
4363 if (type == BC_LEX_KEY_BREAK) {
4365 if (p->exits.len == 0) return bc_error_bad_token();
4367 i = p->exits.len - 1;
4368 ip = bc_vec_item(&p->exits, i);
4370 while (!ip->func && i < p->exits.len) ip = bc_vec_item(&p->exits, i--);
4371 if (i >= p->exits.len && !ip->func) return bc_error_bad_token();
4376 i = *((size_t *) bc_vec_top(&p->conds));
4378 bc_parse_push(p, BC_INST_JUMP);
4379 bc_parse_pushIndex(p, i);
4381 s = bc_lex_next(&p->l);
4384 if (p->l.t.t != BC_LEX_SCOLON && p->l.t.t != BC_LEX_NLINE)
4385 return bc_error_bad_token();
4387 return bc_lex_next(&p->l);
4390 static BcStatus bc_parse_func(BcParse *p)
4393 bool var, comma = false;
4397 s = bc_lex_next(&p->l);
4399 if (p->l.t.t != BC_LEX_NAME)
4400 return bc_error("bad function definition");
4402 name = xstrdup(p->l.t.v.v);
4403 bc_parse_addFunc(p, name, &p->fidx);
4405 s = bc_lex_next(&p->l);
4407 if (p->l.t.t != BC_LEX_LPAREN)
4408 return bc_error("bad function definition");
4409 s = bc_lex_next(&p->l);
4412 while (p->l.t.t != BC_LEX_RPAREN) {
4414 if (p->l.t.t != BC_LEX_NAME)
4415 return bc_error("bad function definition");
4419 name = xstrdup(p->l.t.v.v);
4420 s = bc_lex_next(&p->l);
4423 var = p->l.t.t != BC_LEX_LBRACKET;
4427 s = bc_lex_next(&p->l);
4430 if (p->l.t.t != BC_LEX_RBRACKET) {
4431 s = bc_error("bad function definition");
4435 s = bc_lex_next(&p->l);
4439 comma = p->l.t.t == BC_LEX_COMMA;
4441 s = bc_lex_next(&p->l);
4445 s = bc_func_insert(p->func, name, var);
4449 if (comma) return bc_error("bad function definition");
4451 flags = BC_PARSE_FLAG_FUNC | BC_PARSE_FLAG_FUNC_INNER | BC_PARSE_FLAG_BODY;
4452 bc_parse_startBody(p, flags);
4454 s = bc_lex_next(&p->l);
4457 if (p->l.t.t != BC_LEX_LBRACE)
4458 s = bc_POSIX_requires("the left brace be on the same line as the function header");
4467 static BcStatus bc_parse_auto(BcParse *p)
4470 bool comma, var, one;
4473 if (!p->auto_part) return bc_error_bad_token();
4474 s = bc_lex_next(&p->l);
4477 p->auto_part = comma = false;
4478 one = p->l.t.t == BC_LEX_NAME;
4480 while (p->l.t.t == BC_LEX_NAME) {
4482 name = xstrdup(p->l.t.v.v);
4483 s = bc_lex_next(&p->l);
4486 var = p->l.t.t != BC_LEX_LBRACKET;
4489 s = bc_lex_next(&p->l);
4492 if (p->l.t.t != BC_LEX_RBRACKET) {
4493 s = bc_error("bad function definition");
4497 s = bc_lex_next(&p->l);
4501 comma = p->l.t.t == BC_LEX_COMMA;
4503 s = bc_lex_next(&p->l);
4507 s = bc_func_insert(p->func, name, var);
4511 if (comma) return bc_error("bad function definition");
4512 if (!one) return bc_error("no auto variable found");
4514 if (p->l.t.t != BC_LEX_NLINE && p->l.t.t != BC_LEX_SCOLON)
4515 return bc_error_bad_token();
4517 return bc_lex_next(&p->l);
4524 static BcStatus bc_parse_body(BcParse *p, bool brace)
4526 BcStatus s = BC_STATUS_SUCCESS;
4527 uint8_t *flag_ptr = bc_vec_top(&p->flags);
4529 *flag_ptr &= ~(BC_PARSE_FLAG_BODY);
4531 if (*flag_ptr & BC_PARSE_FLAG_FUNC_INNER) {
4533 if (!brace) return bc_error_bad_token();
4534 p->auto_part = p->l.t.t != BC_LEX_KEY_AUTO;
4536 if (!p->auto_part) {
4537 s = bc_parse_auto(p);
4541 if (p->l.t.t == BC_LEX_NLINE) s = bc_lex_next(&p->l);
4544 s = bc_parse_stmt(p);
4545 if (!s && !brace) s = bc_parse_endBody(p, false);
4551 static BcStatus bc_parse_stmt(BcParse *p)
4553 BcStatus s = BC_STATUS_SUCCESS;
4559 return bc_lex_next(&p->l);
4562 case BC_LEX_KEY_ELSE:
4564 p->auto_part = false;
4570 if (!BC_PARSE_BODY(p)) return bc_error_bad_token();
4573 s = bc_lex_next(&p->l);
4576 return bc_parse_body(p, true);
4579 case BC_LEX_KEY_AUTO:
4581 return bc_parse_auto(p);
4586 p->auto_part = false;
4588 if (BC_PARSE_IF_END(p)) {
4590 return BC_STATUS_SUCCESS;
4592 else if (BC_PARSE_BODY(p))
4593 return bc_parse_body(p, false);
4603 case BC_LEX_OP_MINUS:
4604 case BC_LEX_OP_BOOL_NOT:
4608 case BC_LEX_KEY_IBASE:
4609 case BC_LEX_KEY_LAST:
4610 case BC_LEX_KEY_LENGTH:
4611 case BC_LEX_KEY_OBASE:
4612 case BC_LEX_KEY_READ:
4613 case BC_LEX_KEY_SCALE:
4614 case BC_LEX_KEY_SQRT:
4616 s = bc_parse_expr(p, BC_PARSE_PRINT, bc_parse_next_expr);
4620 case BC_LEX_KEY_ELSE:
4622 s = bc_parse_else(p);
4628 while (!s && p->l.t.t == BC_LEX_SCOLON) s = bc_lex_next(&p->l);
4634 s = bc_parse_endBody(p, true);
4640 s = bc_parse_string(p, BC_INST_PRINT_STR);
4644 case BC_LEX_KEY_BREAK:
4645 case BC_LEX_KEY_CONTINUE:
4647 s = bc_parse_loopExit(p, p->l.t.t);
4651 case BC_LEX_KEY_FOR:
4653 s = bc_parse_for(p);
4657 case BC_LEX_KEY_HALT:
4659 bc_parse_push(p, BC_INST_HALT);
4660 s = bc_lex_next(&p->l);
4670 case BC_LEX_KEY_LIMITS:
4672 // "limits" is a compile-time command,
4673 // the output is produced at _parse time_.
4674 s = bc_lex_next(&p->l);
4676 printf("BC_BASE_MAX = %u\n", BC_MAX_OBASE);
4677 printf("BC_DIM_MAX = %u\n", BC_MAX_DIM);
4678 printf("BC_SCALE_MAX = %u\n", BC_MAX_SCALE);
4679 printf("BC_STRING_MAX = %u\n", BC_MAX_STRING);
4680 printf("BC_NAME_MAX = %u\n", BC_MAX_NAME);
4681 printf("BC_NUM_MAX = %u\n", BC_MAX_NUM);
4682 printf("MAX Exponent = %lu\n", BC_MAX_EXP);
4683 printf("Number of vars = %lu\n", BC_MAX_VARS);
4687 case BC_LEX_KEY_PRINT:
4689 s = bc_parse_print(p);
4693 case BC_LEX_KEY_QUIT:
4695 // "quit" is a compile-time command. For example,
4696 // "if (0 == 1) quit" terminates when parsing the statement,
4697 // not when it is executed
4698 quit_or_return_for_exit();
4701 case BC_LEX_KEY_RETURN:
4703 s = bc_parse_return(p);
4707 case BC_LEX_KEY_WHILE:
4709 s = bc_parse_while(p);
4715 s = bc_error_bad_token();
4723 static BcStatus bc_parse_parse(BcParse *p)
4727 if (p->l.t.t == BC_LEX_EOF)
4728 s = p->flags.len > 0 ? bc_error("block end could not be found") : bc_error("end of file");
4729 else if (p->l.t.t == BC_LEX_KEY_DEFINE) {
4730 if (!BC_PARSE_CAN_EXEC(p)) return bc_error_bad_token();
4731 s = bc_parse_func(p);
4734 s = bc_parse_stmt(p);
4736 if (s || G_interrupt) {
4738 s = BC_STATUS_FAILURE;
4744 static BcStatus bc_parse_expr_empty_ok(BcParse *p, uint8_t flags, BcParseNext next)
4746 BcStatus s = BC_STATUS_SUCCESS;
4747 BcInst prev = BC_INST_PRINT;
4748 BcLexType top, t = p->l.t.t;
4749 size_t nexprs = 0, ops_bgn = p->ops.len;
4750 uint32_t i, nparens, nrelops;
4751 bool paren_first, paren_expr, rprn, done, get_token, assign, bin_last;
4753 paren_first = p->l.t.t == BC_LEX_LPAREN;
4754 nparens = nrelops = 0;
4755 paren_expr = rprn = done = get_token = assign = false;
4758 for (; !G_interrupt && !s && !done && bc_parse_exprs(t); t = p->l.t.t) {
4764 s = bc_parse_incdec(p, &prev, &paren_expr, &nexprs, flags);
4765 rprn = get_token = bin_last = false;
4769 case BC_LEX_OP_MINUS:
4771 s = bc_parse_minus(p, &prev, ops_bgn, rprn, &nexprs);
4772 rprn = get_token = false;
4773 bin_last = prev == BC_INST_MINUS;
4777 case BC_LEX_OP_ASSIGN_POWER:
4778 case BC_LEX_OP_ASSIGN_MULTIPLY:
4779 case BC_LEX_OP_ASSIGN_DIVIDE:
4780 case BC_LEX_OP_ASSIGN_MODULUS:
4781 case BC_LEX_OP_ASSIGN_PLUS:
4782 case BC_LEX_OP_ASSIGN_MINUS:
4783 case BC_LEX_OP_ASSIGN:
4785 if (prev != BC_INST_VAR && prev != BC_INST_ARRAY_ELEM &&
4786 prev != BC_INST_SCALE && prev != BC_INST_IBASE &&
4787 prev != BC_INST_OBASE && prev != BC_INST_LAST)
4789 s = bc_error("bad assignment:"
4790 " left side must be scale,"
4791 " ibase, obase, last, var,"
4798 case BC_LEX_OP_POWER:
4799 case BC_LEX_OP_MULTIPLY:
4800 case BC_LEX_OP_DIVIDE:
4801 case BC_LEX_OP_MODULUS:
4802 case BC_LEX_OP_PLUS:
4803 case BC_LEX_OP_REL_EQ:
4804 case BC_LEX_OP_REL_LE:
4805 case BC_LEX_OP_REL_GE:
4806 case BC_LEX_OP_REL_NE:
4807 case BC_LEX_OP_REL_LT:
4808 case BC_LEX_OP_REL_GT:
4809 case BC_LEX_OP_BOOL_NOT:
4810 case BC_LEX_OP_BOOL_OR:
4811 case BC_LEX_OP_BOOL_AND:
4813 if (((t == BC_LEX_OP_BOOL_NOT) != bin_last)
4814 || (t != BC_LEX_OP_BOOL_NOT && prev == BC_INST_BOOL_NOT)
4816 return bc_error_bad_expression();
4819 nrelops += t >= BC_LEX_OP_REL_EQ && t <= BC_LEX_OP_REL_GT;
4820 prev = BC_PARSE_TOKEN_INST(t);
4821 s = bc_parse_operator(p, t, ops_bgn, &nexprs, true);
4822 rprn = get_token = false;
4823 bin_last = t != BC_LEX_OP_BOOL_NOT;
4830 if (BC_PARSE_LEAF(prev, rprn))
4831 return bc_error_bad_expression();
4833 paren_expr = rprn = bin_last = false;
4835 bc_vec_push(&p->ops, &t);
4842 if (bin_last || prev == BC_INST_BOOL_NOT)
4843 return bc_error_bad_expression();
4846 s = BC_STATUS_SUCCESS;
4851 else if (!paren_expr)
4852 return BC_STATUS_PARSE_EMPTY_EXP;
4855 paren_expr = rprn = true;
4856 get_token = bin_last = false;
4858 s = bc_parse_rightParen(p, ops_bgn, &nexprs);
4865 if (BC_PARSE_LEAF(prev, rprn))
4866 return bc_error_bad_expression();
4868 rprn = get_token = bin_last = false;
4869 s = bc_parse_name(p, &prev, flags & ~BC_PARSE_NOCALL);
4877 if (BC_PARSE_LEAF(prev, rprn))
4878 return bc_error_bad_expression();
4879 bc_parse_number(p, &prev, &nexprs);
4880 paren_expr = get_token = true;
4881 rprn = bin_last = false;
4886 case BC_LEX_KEY_IBASE:
4887 case BC_LEX_KEY_LAST:
4888 case BC_LEX_KEY_OBASE:
4890 if (BC_PARSE_LEAF(prev, rprn))
4891 return bc_error_bad_expression();
4892 prev = (char) (t - BC_LEX_KEY_IBASE + BC_INST_IBASE);
4893 bc_parse_push(p, (char) prev);
4895 paren_expr = get_token = true;
4896 rprn = bin_last = false;
4902 case BC_LEX_KEY_LENGTH:
4903 case BC_LEX_KEY_SQRT:
4905 if (BC_PARSE_LEAF(prev, rprn))
4906 return bc_error_bad_expression();
4907 s = bc_parse_builtin(p, t, flags, &prev);
4909 rprn = get_token = bin_last = false;
4915 case BC_LEX_KEY_READ:
4917 if (BC_PARSE_LEAF(prev, rprn))
4918 return bc_error_bad_expression();
4919 else if (flags & BC_PARSE_NOREAD)
4920 s = bc_error_nested_read_call();
4922 s = bc_parse_read(p);
4925 rprn = get_token = bin_last = false;
4927 prev = BC_INST_READ;
4932 case BC_LEX_KEY_SCALE:
4934 if (BC_PARSE_LEAF(prev, rprn))
4935 return bc_error_bad_expression();
4936 s = bc_parse_scale(p, &prev, flags);
4938 rprn = get_token = bin_last = false;
4940 prev = BC_INST_SCALE;
4947 s = bc_error_bad_token();
4952 if (!s && get_token) s = bc_lex_next(&p->l);
4956 if (G_interrupt) return BC_STATUS_FAILURE; // ^C: stop parsing
4958 while (p->ops.len > ops_bgn) {
4960 top = BC_PARSE_TOP_OP(p);
4961 assign = top >= BC_LEX_OP_ASSIGN_POWER && top <= BC_LEX_OP_ASSIGN;
4963 if (top == BC_LEX_LPAREN || top == BC_LEX_RPAREN)
4964 return bc_error_bad_expression();
4966 bc_parse_push(p, BC_PARSE_TOKEN_INST(top));
4968 nexprs -= top != BC_LEX_OP_BOOL_NOT && top != BC_LEX_NEG;
4969 bc_vec_pop(&p->ops);
4972 if (prev == BC_INST_BOOL_NOT || nexprs != 1)
4973 return bc_error_bad_expression();
4975 for (i = 0; i < next.len; ++i)
4976 if (t == next.tokens[i])
4978 return bc_error_bad_expression();
4981 if (!(flags & BC_PARSE_REL) && nrelops) {
4982 s = bc_POSIX_does_not_allow("comparison operators outside if or loops");
4985 else if ((flags & BC_PARSE_REL) && nrelops > 1) {
4986 s = bc_POSIX_requires("exactly one comparison operator per condition");
4990 if (flags & BC_PARSE_PRINT) {
4991 if (paren_first || !assign) bc_parse_push(p, BC_INST_PRINT);
4992 bc_parse_push(p, BC_INST_POP);
4998 static BcStatus bc_parse_expr(BcParse *p, uint8_t flags, BcParseNext next)
5002 s = bc_parse_expr_empty_ok(p, flags, next);
5003 if (s == BC_STATUS_PARSE_EMPTY_EXP)
5004 return bc_error("empty expression");
5008 static void bc_parse_init(BcParse *p, size_t func)
5010 bc_parse_create(p, func, bc_parse_parse, bc_lex_token);
5013 static BcStatus bc_parse_expression(BcParse *p, uint8_t flags)
5015 return bc_parse_expr(p, flags, bc_parse_next_read);
5022 #define DC_PARSE_BUF_LEN ((int) (sizeof(uint32_t) * CHAR_BIT))
5024 static BcStatus dc_parse_register(BcParse *p)
5029 s = bc_lex_next(&p->l);
5031 if (p->l.t.t != BC_LEX_NAME) return bc_error_bad_token();
5033 name = xstrdup(p->l.t.v.v);
5034 bc_parse_pushName(p, name);
5039 static BcStatus dc_parse_string(BcParse *p)
5041 char *str, *name, b[DC_PARSE_BUF_LEN + 1];
5042 size_t idx, len = G.prog.strs.len;
5044 sprintf(b, "%0*zu", DC_PARSE_BUF_LEN, len);
5047 str = xstrdup(p->l.t.v.v);
5048 bc_parse_push(p, BC_INST_STR);
5049 bc_parse_pushIndex(p, len);
5050 bc_vec_push(&G.prog.strs, &str);
5051 bc_parse_addFunc(p, name, &idx);
5053 return bc_lex_next(&p->l);
5056 static BcStatus dc_parse_mem(BcParse *p, uint8_t inst, bool name, bool store)
5060 bc_parse_push(p, inst);
5062 s = dc_parse_register(p);
5067 bc_parse_push(p, BC_INST_SWAP);
5068 bc_parse_push(p, BC_INST_ASSIGN);
5069 bc_parse_push(p, BC_INST_POP);
5072 return bc_lex_next(&p->l);
5075 static BcStatus dc_parse_cond(BcParse *p, uint8_t inst)
5079 bc_parse_push(p, inst);
5080 bc_parse_push(p, BC_INST_EXEC_COND);
5082 s = dc_parse_register(p);
5085 s = bc_lex_next(&p->l);
5088 if (p->l.t.t == BC_LEX_ELSE) {
5089 s = dc_parse_register(p);
5091 s = bc_lex_next(&p->l);
5094 bc_parse_push(p, BC_PARSE_STREND);
5099 static BcStatus dc_parse_token(BcParse *p, BcLexType t, uint8_t flags)
5101 BcStatus s = BC_STATUS_SUCCESS;
5104 bool assign, get_token = false;
5108 case BC_LEX_OP_REL_EQ:
5109 case BC_LEX_OP_REL_LE:
5110 case BC_LEX_OP_REL_GE:
5111 case BC_LEX_OP_REL_NE:
5112 case BC_LEX_OP_REL_LT:
5113 case BC_LEX_OP_REL_GT:
5115 s = dc_parse_cond(p, t - BC_LEX_OP_REL_EQ + BC_INST_REL_EQ);
5122 s = dc_parse_mem(p, BC_INST_ARRAY_ELEM, true, t == BC_LEX_COLON);
5128 s = dc_parse_string(p);
5135 if (t == BC_LEX_NEG) {
5136 s = bc_lex_next(&p->l);
5138 if (p->l.t.t != BC_LEX_NUMBER)
5139 return bc_error_bad_token();
5142 bc_parse_number(p, &prev, &p->nbraces);
5144 if (t == BC_LEX_NEG) bc_parse_push(p, BC_INST_NEG);
5150 case BC_LEX_KEY_READ:
5152 if (flags & BC_PARSE_NOREAD)
5153 s = bc_error_nested_read_call();
5155 bc_parse_push(p, BC_INST_READ);
5160 case BC_LEX_OP_ASSIGN:
5161 case BC_LEX_STORE_PUSH:
5163 assign = t == BC_LEX_OP_ASSIGN;
5164 inst = assign ? BC_INST_VAR : BC_INST_PUSH_TO_VAR;
5165 s = dc_parse_mem(p, inst, true, assign);
5170 case BC_LEX_LOAD_POP:
5172 inst = t == BC_LEX_LOAD_POP ? BC_INST_PUSH_VAR : BC_INST_LOAD;
5173 s = dc_parse_mem(p, inst, true, false);
5177 case BC_LEX_STORE_IBASE:
5178 case BC_LEX_STORE_SCALE:
5179 case BC_LEX_STORE_OBASE:
5181 inst = t - BC_LEX_STORE_IBASE + BC_INST_IBASE;
5182 s = dc_parse_mem(p, inst, false, true);
5188 s = bc_error_bad_token();
5194 if (!s && get_token) s = bc_lex_next(&p->l);
5199 static BcStatus dc_parse_expr(BcParse *p, uint8_t flags)
5201 BcStatus s = BC_STATUS_SUCCESS;
5205 if (flags & BC_PARSE_NOCALL) p->nbraces = G.prog.results.len;
5207 for (t = p->l.t.t; !s && t != BC_LEX_EOF; t = p->l.t.t) {
5209 inst = dc_parse_insts[t];
5211 if (inst != BC_INST_INVALID) {
5212 bc_parse_push(p, inst);
5213 s = bc_lex_next(&p->l);
5216 s = dc_parse_token(p, t, flags);
5219 if (!s && p->l.t.t == BC_LEX_EOF && (flags & BC_PARSE_NOCALL))
5220 bc_parse_push(p, BC_INST_POP_EXEC);
5225 static BcStatus dc_parse_parse(BcParse *p)
5229 if (p->l.t.t == BC_LEX_EOF)
5230 s = bc_error("end of file");
5232 s = dc_parse_expr(p, 0);
5234 if (s || G_interrupt) {
5236 s = BC_STATUS_FAILURE;
5242 static void dc_parse_init(BcParse *p, size_t func)
5244 bc_parse_create(p, func, dc_parse_parse, dc_lex_token);
5249 static void common_parse_init(BcParse *p, size_t func)
5252 IF_BC(bc_parse_init(p, func);)
5254 IF_DC(dc_parse_init(p, func);)
5258 static BcStatus common_parse_expr(BcParse *p, uint8_t flags)
5261 IF_BC(return bc_parse_expression(p, flags);)
5263 IF_DC(return dc_parse_expr(p, flags);)
5267 static BcVec* bc_program_search(char *id, bool var)
5275 v = var ? &G.prog.vars : &G.prog.arrs;
5276 map = var ? &G.prog.var_map : &G.prog.arr_map;
5280 new = bc_map_insert(map, &e, &i); // 1 if insertion was successful
5283 bc_array_init(&data.v, var);
5284 bc_vec_push(v, &data.v);
5287 ptr = bc_vec_item(map, i);
5288 if (new) ptr->name = xstrdup(e.name);
5289 return bc_vec_item(v, ptr->idx);
5292 static BcStatus bc_program_num(BcResult *r, BcNum **num, bool hex)
5294 BcStatus s = BC_STATUS_SUCCESS;
5299 case BC_RESULT_TEMP:
5300 case BC_RESULT_IBASE:
5301 case BC_RESULT_SCALE:
5302 case BC_RESULT_OBASE:
5308 case BC_RESULT_CONSTANT:
5310 char **str = bc_vec_item(&G.prog.consts, r->d.id.idx);
5311 size_t base_t, len = strlen(*str);
5314 bc_num_init(&r->d.n, len);
5316 hex = hex && len == 1;
5317 base = hex ? &G.prog.hexb : &G.prog.ib;
5318 base_t = hex ? BC_NUM_MAX_IBASE : G.prog.ib_t;
5319 s = bc_num_parse(&r->d.n, *str, base, base_t);
5322 bc_num_free(&r->d.n);
5327 r->t = BC_RESULT_TEMP;
5333 case BC_RESULT_ARRAY:
5334 case BC_RESULT_ARRAY_ELEM:
5338 v = bc_program_search(r->d.id.name, r->t == BC_RESULT_VAR);
5340 if (r->t == BC_RESULT_ARRAY_ELEM) {
5342 if (v->len <= r->d.id.idx) bc_array_expand(v, r->d.id.idx + 1);
5343 *num = bc_vec_item(v, r->d.id.idx);
5346 *num = bc_vec_top(v);
5351 case BC_RESULT_LAST:
5353 *num = &G.prog.last;
5367 static BcStatus bc_program_binOpPrep(BcResult **l, BcNum **ln,
5368 BcResult **r, BcNum **rn, bool assign)
5372 BcResultType lt, rt;
5374 if (!BC_PROG_STACK(&G.prog.results, 2))
5375 return bc_error_stack_has_too_few_elements();
5377 *r = bc_vec_item_rev(&G.prog.results, 0);
5378 *l = bc_vec_item_rev(&G.prog.results, 1);
5382 hex = assign && (lt == BC_RESULT_IBASE || lt == BC_RESULT_OBASE);
5384 s = bc_program_num(*l, ln, false);
5386 s = bc_program_num(*r, rn, hex);
5389 // We run this again under these conditions in case any vector has been
5390 // reallocated out from under the BcNums or arrays we had.
5391 if (lt == rt && (lt == BC_RESULT_VAR || lt == BC_RESULT_ARRAY_ELEM)) {
5392 s = bc_program_num(*l, ln, false);
5396 if (!BC_PROG_NUM((*l), (*ln)) && (!assign || (*l)->t != BC_RESULT_VAR))
5397 return bc_error_variable_is_wrong_type();
5398 if (!assign && !BC_PROG_NUM((*r), (*ln)))
5399 return bc_error_variable_is_wrong_type();
5404 static void bc_program_binOpRetire(BcResult *r)
5406 r->t = BC_RESULT_TEMP;
5407 bc_vec_pop(&G.prog.results);
5408 bc_vec_pop(&G.prog.results);
5409 bc_vec_push(&G.prog.results, r);
5412 static BcStatus bc_program_prep(BcResult **r, BcNum **n)
5416 if (!BC_PROG_STACK(&G.prog.results, 1))
5417 return bc_error_stack_has_too_few_elements();
5418 *r = bc_vec_top(&G.prog.results);
5420 s = bc_program_num(*r, n, false);
5423 if (!BC_PROG_NUM((*r), (*n)))
5424 return bc_error_variable_is_wrong_type();
5429 static void bc_program_retire(BcResult *r, BcResultType t)
5432 bc_vec_pop(&G.prog.results);
5433 bc_vec_push(&G.prog.results, r);
5436 static BcStatus bc_program_op(char inst)
5439 BcResult *opd1, *opd2, res;
5440 BcNum *n1, *n2 = NULL;
5442 s = bc_program_binOpPrep(&opd1, &n1, &opd2, &n2, false);
5444 bc_num_init(&res.d.n, BC_NUM_DEF_SIZE);
5446 s = bc_program_ops[inst - BC_INST_POWER](n1, n2, &res.d.n, G.prog.scale);
5448 bc_program_binOpRetire(&res);
5453 bc_num_free(&res.d.n);
5457 static BcStatus bc_program_read(void)
5459 const char *sv_file;
5465 BcFunc *f = bc_vec_item(&G.prog.fns, BC_PROG_READ);
5467 for (i = 0; i < G.prog.stack.len; ++i) {
5468 BcInstPtr *ip_ptr = bc_vec_item(&G.prog.stack, i);
5469 if (ip_ptr->func == BC_PROG_READ)
5470 return bc_error_nested_read_call();
5473 bc_vec_pop_all(&f->code);
5474 bc_char_vec_init(&buf);
5476 sv_file = G.prog.file;
5479 s = bc_read_line(&buf, "read> ");
5482 common_parse_init(&parse, BC_PROG_READ);
5483 bc_lex_file(&parse.l);
5485 s = bc_parse_text(&parse, buf.v);
5486 if (s) goto exec_err;
5487 s = common_parse_expr(&parse, BC_PARSE_NOREAD);
5488 if (s) goto exec_err;
5490 if (parse.l.t.t != BC_LEX_NLINE && parse.l.t.t != BC_LEX_EOF) {
5491 s = bc_error("bad read() expression");
5495 ip.func = BC_PROG_READ;
5497 ip.len = G.prog.results.len;
5499 // Update this pointer, just in case.
5500 f = bc_vec_item(&G.prog.fns, BC_PROG_READ);
5502 bc_vec_pushByte(&f->code, BC_INST_POP_EXEC);
5503 bc_vec_push(&G.prog.stack, &ip);
5506 G.prog.file = sv_file;
5507 bc_parse_free(&parse);
5513 static size_t bc_program_index(char *code, size_t *bgn)
5515 char amt = code[(*bgn)++], i = 0;
5518 for (; i < amt; ++i, ++(*bgn))
5519 res |= (((size_t)((int) code[*bgn]) & UCHAR_MAX) << (i * CHAR_BIT));
5524 static char *bc_program_name(char *code, size_t *bgn)
5527 char c, *s, *str = code + *bgn, *ptr = strchr(str, BC_PARSE_STREND);
5529 s = xmalloc(ptr - str + 1);
5532 for (i = 0; c != 0 && c != BC_PARSE_STREND; c = code[(*bgn)++], ++i)
5540 static void bc_program_printString(const char *str, size_t *nchars)
5542 size_t i, len = strlen(str);
5551 for (i = 0; i < len; ++i, ++(*nchars)) {
5555 if (c != '\\' || i == len - 1)
5615 // Just print the backslash and following character.
5626 static BcStatus bc_program_print(char inst, size_t idx)
5628 BcStatus s = BC_STATUS_SUCCESS;
5633 bool pop = inst != BC_INST_PRINT;
5635 if (!BC_PROG_STACK(&G.prog.results, idx + 1))
5636 return bc_error_stack_has_too_few_elements();
5638 r = bc_vec_item_rev(&G.prog.results, idx);
5639 s = bc_program_num(r, &num, false);
5642 if (BC_PROG_NUM(r, num)) {
5643 s = bc_num_print(num, &G.prog.ob, G.prog.ob_t, !pop, &G.prog.nchars, G.prog.len);
5644 if (!s) bc_num_copy(&G.prog.last, num);
5648 idx = (r->t == BC_RESULT_STR) ? r->d.id.idx : num->rdx;
5649 str = *((char **) bc_vec_item(&G.prog.strs, idx));
5651 if (inst == BC_INST_PRINT_STR) {
5652 for (i = 0, len = strlen(str); i < len; ++i) {
5655 if (c == '\n') G.prog.nchars = SIZE_MAX;
5660 bc_program_printString(str, &G.prog.nchars);
5661 if (inst == BC_INST_PRINT) bb_putchar('\n');
5665 if (!s && pop) bc_vec_pop(&G.prog.results);
5670 static BcStatus bc_program_negate(void)
5676 s = bc_program_prep(&ptr, &num);
5679 bc_num_init(&res.d.n, num->len);
5680 bc_num_copy(&res.d.n, num);
5681 if (res.d.n.len) res.d.n.neg = !res.d.n.neg;
5683 bc_program_retire(&res, BC_RESULT_TEMP);
5688 static BcStatus bc_program_logical(char inst)
5691 BcResult *opd1, *opd2, res;
5696 s = bc_program_binOpPrep(&opd1, &n1, &opd2, &n2, false);
5698 bc_num_init(&res.d.n, BC_NUM_DEF_SIZE);
5700 if (inst == BC_INST_BOOL_AND)
5701 cond = bc_num_cmp(n1, &G.prog.zero) && bc_num_cmp(n2, &G.prog.zero);
5702 else if (inst == BC_INST_BOOL_OR)
5703 cond = bc_num_cmp(n1, &G.prog.zero) || bc_num_cmp(n2, &G.prog.zero);
5706 cmp = bc_num_cmp(n1, n2);
5710 case BC_INST_REL_EQ:
5716 case BC_INST_REL_LE:
5722 case BC_INST_REL_GE:
5728 case BC_INST_REL_NE:
5734 case BC_INST_REL_LT:
5740 case BC_INST_REL_GT:
5748 (cond ? bc_num_one : bc_num_zero)(&res.d.n);
5750 bc_program_binOpRetire(&res);
5756 static BcStatus bc_program_assignStr(BcResult *r, BcVec *v,
5762 memset(&n2, 0, sizeof(BcNum));
5763 n2.rdx = res.d.id.idx = r->d.id.idx;
5764 res.t = BC_RESULT_STR;
5767 if (!BC_PROG_STACK(&G.prog.results, 2))
5768 return bc_error_stack_has_too_few_elements();
5770 bc_vec_pop(&G.prog.results);
5773 bc_vec_pop(&G.prog.results);
5775 bc_vec_push(&G.prog.results, &res);
5776 bc_vec_push(v, &n2);
5778 return BC_STATUS_SUCCESS;
5782 static BcStatus bc_program_copyToVar(char *name, bool var)
5789 if (!BC_PROG_STACK(&G.prog.results, 1))
5790 return bc_error_stack_has_too_few_elements();
5792 ptr = bc_vec_top(&G.prog.results);
5793 if ((ptr->t == BC_RESULT_ARRAY) != !var)
5794 return bc_error_variable_is_wrong_type();
5795 v = bc_program_search(name, var);
5798 if (ptr->t == BC_RESULT_STR && !var)
5799 return bc_error_variable_is_wrong_type();
5800 if (ptr->t == BC_RESULT_STR) return bc_program_assignStr(ptr, v, true);
5803 s = bc_program_num(ptr, &n, false);
5806 // Do this once more to make sure that pointers were not invalidated.
5807 v = bc_program_search(name, var);
5810 bc_num_init(&r.d.n, BC_NUM_DEF_SIZE);
5811 bc_num_copy(&r.d.n, n);
5814 bc_array_init(&r.d.v, true);
5815 bc_array_copy(&r.d.v, (BcVec *) n);
5818 bc_vec_push(v, &r.d);
5819 bc_vec_pop(&G.prog.results);
5824 static BcStatus bc_program_assign(char inst)
5827 BcResult *left, *right, res;
5828 BcNum *l = NULL, *r = NULL;
5829 unsigned long val, max;
5830 bool assign = inst == BC_INST_ASSIGN, ib, sc;
5832 s = bc_program_binOpPrep(&left, &l, &right, &r, assign);
5835 ib = left->t == BC_RESULT_IBASE;
5836 sc = left->t == BC_RESULT_SCALE;
5840 if (right->t == BC_RESULT_STR) {
5844 if (left->t != BC_RESULT_VAR)
5845 return bc_error_variable_is_wrong_type();
5846 v = bc_program_search(left->d.id.name, true);
5848 return bc_program_assignStr(right, v, false);
5852 if (left->t == BC_RESULT_CONSTANT || left->t == BC_RESULT_TEMP)
5853 return bc_error("bad assignment:"
5854 " left side must be scale,"
5855 " ibase, obase, last, var,"
5860 if (inst == BC_INST_ASSIGN_DIVIDE && !bc_num_cmp(r, &G.prog.zero))
5861 return bc_error("divide by zero");
5866 s = bc_program_ops[inst - BC_INST_ASSIGN_POWER](l, r, l, G.prog.scale);
5873 if (ib || sc || left->t == BC_RESULT_OBASE) {
5874 static const char *const msg[] = {
5875 "bad ibase; must be [2, 16]", //BC_RESULT_IBASE
5876 "bad scale; must be [0, BC_SCALE_MAX]", //BC_RESULT_SCALE
5877 NULL, //can't happen //BC_RESULT_LAST
5878 NULL, //can't happen //BC_RESULT_CONSTANT
5879 NULL, //can't happen //BC_RESULT_ONE
5880 "bad obase; must be [2, BC_BASE_MAX]", //BC_RESULT_OBASE
5884 s = bc_num_ulong(l, &val);
5887 s = left->t - BC_RESULT_IBASE;
5890 ptr = &G.prog.scale;
5893 if (val < BC_NUM_MIN_BASE)
5894 return bc_error(msg[s]);
5895 max = ib ? BC_NUM_MAX_IBASE : BC_MAX_OBASE;
5896 ptr = ib ? &G.prog.ib_t : &G.prog.ob_t;
5900 return bc_error(msg[s]);
5902 bc_num_copy(ib ? &G.prog.ib : &G.prog.ob, l);
5904 *ptr = (size_t) val;
5905 s = BC_STATUS_SUCCESS;
5908 bc_num_init(&res.d.n, l->len);
5909 bc_num_copy(&res.d.n, l);
5910 bc_program_binOpRetire(&res);
5916 #define bc_program_pushVar(code, bgn, pop, copy) \
5917 bc_program_pushVar(code, bgn)
5918 // for bc, 'pop' and 'copy' are always false
5920 static BcStatus bc_program_pushVar(char *code, size_t *bgn,
5921 bool pop, bool copy)
5923 BcStatus s = BC_STATUS_SUCCESS;
5925 char *name = bc_program_name(code, bgn);
5927 r.t = BC_RESULT_VAR;
5932 BcVec *v = bc_program_search(name, true);
5933 BcNum *num = bc_vec_top(v);
5937 if (!BC_PROG_STACK(v, 2 - copy)) {
5939 return bc_error_stack_has_too_few_elements();
5945 if (!BC_PROG_STR(num)) {
5947 r.t = BC_RESULT_TEMP;
5949 bc_num_init(&r.d.n, BC_NUM_DEF_SIZE);
5950 bc_num_copy(&r.d.n, num);
5953 r.t = BC_RESULT_STR;
5954 r.d.id.idx = num->rdx;
5957 if (!copy) bc_vec_pop(v);
5962 bc_vec_push(&G.prog.results, &r);
5967 static BcStatus bc_program_pushArray(char *code, size_t *bgn,
5970 BcStatus s = BC_STATUS_SUCCESS;
5974 r.d.id.name = bc_program_name(code, bgn);
5976 if (inst == BC_INST_ARRAY) {
5977 r.t = BC_RESULT_ARRAY;
5978 bc_vec_push(&G.prog.results, &r);
5985 s = bc_program_prep(&operand, &num);
5987 s = bc_num_ulong(num, &temp);
5990 if (temp > BC_MAX_DIM) {
5991 s = bc_error("array too long; must be [1, BC_DIM_MAX]");
5995 r.d.id.idx = (size_t) temp;
5996 bc_program_retire(&r, BC_RESULT_ARRAY_ELEM);
6000 if (s) free(r.d.id.name);
6005 static BcStatus bc_program_incdec(char inst)
6008 BcResult *ptr, res, copy;
6012 s = bc_program_prep(&ptr, &num);
6015 if (inst == BC_INST_INC_POST || inst == BC_INST_DEC_POST) {
6016 copy.t = BC_RESULT_TEMP;
6017 bc_num_init(©.d.n, num->len);
6018 bc_num_copy(©.d.n, num);
6021 res.t = BC_RESULT_ONE;
6022 inst = inst == BC_INST_INC_PRE || inst == BC_INST_INC_POST ?
6023 BC_INST_ASSIGN_PLUS :
6024 BC_INST_ASSIGN_MINUS;
6026 bc_vec_push(&G.prog.results, &res);
6027 bc_program_assign(inst);
6029 if (inst2 == BC_INST_INC_POST || inst2 == BC_INST_DEC_POST) {
6030 bc_vec_pop(&G.prog.results);
6031 bc_vec_push(&G.prog.results, ©);
6037 static BcStatus bc_program_call(char *code, size_t *idx)
6039 BcStatus s = BC_STATUS_SUCCESS;
6041 size_t i, nparams = bc_program_index(code, idx);
6048 ip.func = bc_program_index(code, idx);
6049 func = bc_vec_item(&G.prog.fns, ip.func);
6051 if (func->code.len == 0) {
6052 return bc_error("undefined function");
6054 if (nparams != func->nparams) {
6055 return bc_error_fmt("function has %u parameters, but called with %u", func->nparams, nparams);
6057 ip.len = G.prog.results.len - nparams;
6059 for (i = 0; i < nparams; ++i) {
6061 a = bc_vec_item(&func->autos, nparams - 1 - i);
6062 arg = bc_vec_top(&G.prog.results);
6064 if ((!a->idx) != (arg->t == BC_RESULT_ARRAY) || arg->t == BC_RESULT_STR)
6065 return bc_error_variable_is_wrong_type();
6067 s = bc_program_copyToVar(a->name, a->idx);
6071 for (; i < func->autos.len; ++i) {
6074 a = bc_vec_item(&func->autos, i);
6075 v = bc_program_search(a->name, a->idx);
6078 bc_num_init(¶m.n, BC_NUM_DEF_SIZE);
6079 bc_vec_push(v, ¶m.n);
6082 bc_array_init(¶m.v, true);
6083 bc_vec_push(v, ¶m.v);
6087 bc_vec_push(&G.prog.stack, &ip);
6089 return BC_STATUS_SUCCESS;
6092 static BcStatus bc_program_return(char inst)
6098 BcInstPtr *ip = bc_vec_top(&G.prog.stack);
6100 if (!BC_PROG_STACK(&G.prog.results, ip->len + inst == BC_INST_RET))
6101 return bc_error_stack_has_too_few_elements();
6103 f = bc_vec_item(&G.prog.fns, ip->func);
6104 res.t = BC_RESULT_TEMP;
6106 if (inst == BC_INST_RET) {
6109 BcResult *operand = bc_vec_top(&G.prog.results);
6111 s = bc_program_num(operand, &num, false);
6113 bc_num_init(&res.d.n, num->len);
6114 bc_num_copy(&res.d.n, num);
6117 bc_num_init(&res.d.n, BC_NUM_DEF_SIZE);
6118 bc_num_zero(&res.d.n);
6121 // We need to pop arguments as well, so this takes that into account.
6122 for (i = 0; i < f->autos.len; ++i) {
6125 BcId *a = bc_vec_item(&f->autos, i);
6127 v = bc_program_search(a->name, a->idx);
6131 bc_vec_npop(&G.prog.results, G.prog.results.len - ip->len);
6132 bc_vec_push(&G.prog.results, &res);
6133 bc_vec_pop(&G.prog.stack);
6135 return BC_STATUS_SUCCESS;
6139 static unsigned long bc_program_scale(BcNum *n)
6141 return (unsigned long) n->rdx;
6144 static unsigned long bc_program_len(BcNum *n)
6146 unsigned long len = n->len;
6149 if (n->rdx != n->len) return len;
6150 for (i = n->len - 1; i < n->len && n->num[i] == 0; --len, --i);
6155 static BcStatus bc_program_builtin(char inst)
6161 bool len = inst == BC_INST_LENGTH;
6163 if (!BC_PROG_STACK(&G.prog.results, 1))
6164 return bc_error_stack_has_too_few_elements();
6165 opnd = bc_vec_top(&G.prog.results);
6167 s = bc_program_num(opnd, &num, false);
6171 if (!BC_PROG_NUM(opnd, num) && !len)
6172 return bc_error_variable_is_wrong_type();
6175 bc_num_init(&res.d.n, BC_NUM_DEF_SIZE);
6177 if (inst == BC_INST_SQRT) s = bc_num_sqrt(num, &res.d.n, G.prog.scale);
6179 else if (len != 0 && opnd->t == BC_RESULT_ARRAY) {
6180 bc_num_ulong2num(&res.d.n, (unsigned long) ((BcVec *) num)->len);
6184 else if (len != 0 && !BC_PROG_NUM(opnd, num)) {
6187 size_t idx = opnd->t == BC_RESULT_STR ? opnd->d.id.idx : num->rdx;
6189 str = bc_vec_item(&G.prog.strs, idx);
6190 bc_num_ulong2num(&res.d.n, strlen(*str));
6194 BcProgramBuiltIn f = len ? bc_program_len : bc_program_scale;
6195 bc_num_ulong2num(&res.d.n, f(num));
6198 bc_program_retire(&res, BC_RESULT_TEMP);
6204 static BcStatus bc_program_divmod(void)
6207 BcResult *opd1, *opd2, res, res2;
6208 BcNum *n1, *n2 = NULL;
6210 s = bc_program_binOpPrep(&opd1, &n1, &opd2, &n2, false);
6213 bc_num_init(&res.d.n, BC_NUM_DEF_SIZE);
6214 bc_num_init(&res2.d.n, n2->len);
6216 s = bc_num_divmod(n1, n2, &res2.d.n, &res.d.n, G.prog.scale);
6219 bc_program_binOpRetire(&res2);
6220 res.t = BC_RESULT_TEMP;
6221 bc_vec_push(&G.prog.results, &res);
6226 bc_num_free(&res2.d.n);
6227 bc_num_free(&res.d.n);
6231 static BcStatus bc_program_modexp(void)
6234 BcResult *r1, *r2, *r3, res;
6235 BcNum *n1, *n2, *n3;
6237 if (!BC_PROG_STACK(&G.prog.results, 3))
6238 return bc_error_stack_has_too_few_elements();
6239 s = bc_program_binOpPrep(&r2, &n2, &r3, &n3, false);
6242 r1 = bc_vec_item_rev(&G.prog.results, 2);
6243 s = bc_program_num(r1, &n1, false);
6245 if (!BC_PROG_NUM(r1, n1))
6246 return bc_error_variable_is_wrong_type();
6248 // Make sure that the values have their pointers updated, if necessary.
6249 if (r1->t == BC_RESULT_VAR || r1->t == BC_RESULT_ARRAY_ELEM) {
6251 if (r1->t == r2->t) {
6252 s = bc_program_num(r2, &n2, false);
6256 if (r1->t == r3->t) {
6257 s = bc_program_num(r3, &n3, false);
6262 bc_num_init(&res.d.n, n3->len);
6263 s = bc_num_modexp(n1, n2, n3, &res.d.n);
6266 bc_vec_pop(&G.prog.results);
6267 bc_program_binOpRetire(&res);
6272 bc_num_free(&res.d.n);
6276 static void bc_program_stackLen(void)
6279 size_t len = G.prog.results.len;
6281 res.t = BC_RESULT_TEMP;
6283 bc_num_init(&res.d.n, BC_NUM_DEF_SIZE);
6284 bc_num_ulong2num(&res.d.n, len);
6285 bc_vec_push(&G.prog.results, &res);
6288 static BcStatus bc_program_asciify(void)
6292 BcNum *num = NULL, n;
6293 char *str, *str2, c;
6294 size_t len = G.prog.strs.len, idx;
6297 if (!BC_PROG_STACK(&G.prog.results, 1))
6298 return bc_error_stack_has_too_few_elements();
6299 r = bc_vec_top(&G.prog.results);
6301 s = bc_program_num(r, &num, false);
6304 if (BC_PROG_NUM(r, num)) {
6306 bc_num_init(&n, BC_NUM_DEF_SIZE);
6307 bc_num_copy(&n, num);
6308 bc_num_truncate(&n, n.rdx);
6310 s = bc_num_mod(&n, &G.prog.strmb, &n, 0);
6311 if (s) goto num_err;
6312 s = bc_num_ulong(&n, &val);
6313 if (s) goto num_err;
6320 idx = (r->t == BC_RESULT_STR) ? r->d.id.idx : num->rdx;
6321 str2 = *((char **) bc_vec_item(&G.prog.strs, idx));
6329 str2 = xstrdup(str);
6330 bc_program_addFunc(str2, &idx);
6332 if (idx != len + BC_PROG_REQ_FUNCS) {
6334 for (idx = 0; idx < G.prog.strs.len; ++idx) {
6335 if (!strcmp(*((char **) bc_vec_item(&G.prog.strs, idx)), str)) {
6344 bc_vec_push(&G.prog.strs, &str);
6346 res.t = BC_RESULT_STR;
6348 bc_vec_pop(&G.prog.results);
6349 bc_vec_push(&G.prog.results, &res);
6351 return BC_STATUS_SUCCESS;
6358 static BcStatus bc_program_printStream(void)
6366 if (!BC_PROG_STACK(&G.prog.results, 1))
6367 return bc_error_stack_has_too_few_elements();
6368 r = bc_vec_top(&G.prog.results);
6370 s = bc_program_num(r, &n, false);
6373 if (BC_PROG_NUM(r, n))
6374 s = bc_num_stream(n, &G.prog.strmb, &G.prog.nchars, G.prog.len);
6376 idx = (r->t == BC_RESULT_STR) ? r->d.id.idx : n->rdx;
6377 str = *((char **) bc_vec_item(&G.prog.strs, idx));
6384 static BcStatus bc_program_nquit(void)
6391 s = bc_program_prep(&opnd, &num);
6393 s = bc_num_ulong(num, &val);
6396 bc_vec_pop(&G.prog.results);
6398 if (G.prog.stack.len < val)
6399 return bc_error_stack_has_too_few_elements();
6400 if (G.prog.stack.len == val) {
6401 if (ENABLE_FEATURE_CLEAN_UP)
6402 return BC_STATUS_FAILURE;
6406 bc_vec_npop(&G.prog.stack, val);
6411 static BcStatus bc_program_execStr(char *code, size_t *bgn,
6414 BcStatus s = BC_STATUS_SUCCESS;
6424 if (!BC_PROG_STACK(&G.prog.results, 1))
6425 return bc_error_stack_has_too_few_elements();
6427 r = bc_vec_top(&G.prog.results);
6431 char *name, *then_name = bc_program_name(code, bgn), *else_name = NULL;
6433 if (code[*bgn] == BC_PARSE_STREND)
6436 else_name = bc_program_name(code, bgn);
6438 exec = r->d.n.len != 0;
6442 else if (else_name != NULL) {
6449 v = bc_program_search(name, true);
6456 if (!exec) goto exit;
6457 if (!BC_PROG_STR(n)) {
6458 s = bc_error_variable_is_wrong_type();
6466 if (r->t == BC_RESULT_STR)
6468 else if (r->t == BC_RESULT_VAR) {
6469 s = bc_program_num(r, &n, false);
6470 if (s || !BC_PROG_STR(n)) goto exit;
6477 fidx = sidx + BC_PROG_REQ_FUNCS;
6479 str = bc_vec_item(&G.prog.strs, sidx);
6480 f = bc_vec_item(&G.prog.fns, fidx);
6482 if (f->code.len == 0) {
6483 common_parse_init(&prs, fidx);
6484 s = bc_parse_text(&prs, *str);
6486 s = common_parse_expr(&prs, BC_PARSE_NOCALL);
6489 if (prs.l.t.t != BC_LEX_EOF) {
6490 s = bc_error_bad_expression();
6494 bc_parse_free(&prs);
6498 ip.len = G.prog.results.len;
6501 bc_vec_pop(&G.prog.results);
6502 bc_vec_push(&G.prog.stack, &ip);
6504 return BC_STATUS_SUCCESS;
6507 bc_parse_free(&prs);
6508 f = bc_vec_item(&G.prog.fns, fidx);
6509 bc_vec_pop_all(&f->code);
6511 bc_vec_pop(&G.prog.results);
6516 static void bc_program_pushGlobal(char inst)
6521 res.t = inst - BC_INST_IBASE + BC_RESULT_IBASE;
6522 if (inst == BC_INST_IBASE)
6523 val = (unsigned long) G.prog.ib_t;
6524 else if (inst == BC_INST_SCALE)
6525 val = (unsigned long) G.prog.scale;
6527 val = (unsigned long) G.prog.ob_t;
6529 bc_num_init(&res.d.n, BC_NUM_DEF_SIZE);
6530 bc_num_ulong2num(&res.d.n, val);
6531 bc_vec_push(&G.prog.results, &res);
6534 static void bc_program_addFunc(char *name, size_t *idx)
6536 BcId entry, *entry_ptr;
6541 entry.idx = G.prog.fns.len;
6543 inserted = bc_map_insert(&G.prog.fn_map, &entry, idx);
6544 if (!inserted) free(name);
6546 entry_ptr = bc_vec_item(&G.prog.fn_map, *idx);
6547 *idx = entry_ptr->idx;
6551 BcFunc *func = bc_vec_item(&G.prog.fns, entry_ptr->idx);
6553 // We need to reset these, so the function can be repopulated.
6555 bc_vec_pop_all(&func->autos);
6556 bc_vec_pop_all(&func->code);
6557 bc_vec_pop_all(&func->labels);
6561 bc_vec_push(&G.prog.fns, &f);
6565 static BcStatus bc_program_exec(void)
6567 BcStatus s = BC_STATUS_SUCCESS;
6571 BcInstPtr *ip = bc_vec_top(&G.prog.stack);
6572 BcFunc *func = bc_vec_item(&G.prog.fns, ip->func);
6573 char *code = func->code.v;
6576 while (!s && ip->idx < func->code.len) {
6578 char inst = code[(ip->idx)++];
6583 case BC_INST_JUMP_ZERO:
6585 s = bc_program_prep(&ptr, &num);
6587 cond = !bc_num_cmp(num, &G.prog.zero);
6588 bc_vec_pop(&G.prog.results);
6594 idx = bc_program_index(code, &ip->idx);
6595 addr = bc_vec_item(&func->labels, idx);
6596 if (inst == BC_INST_JUMP || cond) ip->idx = *addr;
6602 s = bc_program_call(code, &ip->idx);
6606 case BC_INST_INC_PRE:
6607 case BC_INST_DEC_PRE:
6608 case BC_INST_INC_POST:
6609 case BC_INST_DEC_POST:
6611 s = bc_program_incdec(inst);
6617 quit_or_return_for_exit();
6624 s = bc_program_return(inst);
6628 case BC_INST_BOOL_OR:
6629 case BC_INST_BOOL_AND:
6631 case BC_INST_REL_EQ:
6632 case BC_INST_REL_LE:
6633 case BC_INST_REL_GE:
6634 case BC_INST_REL_NE:
6635 case BC_INST_REL_LT:
6636 case BC_INST_REL_GT:
6638 s = bc_program_logical(inst);
6644 s = bc_program_read();
6650 s = bc_program_pushVar(code, &ip->idx, false, false);
6654 case BC_INST_ARRAY_ELEM:
6657 s = bc_program_pushArray(code, &ip->idx, inst);
6663 r.t = BC_RESULT_LAST;
6664 bc_vec_push(&G.prog.results, &r);
6672 bc_program_pushGlobal(inst);
6676 case BC_INST_SCALE_FUNC:
6677 case BC_INST_LENGTH:
6680 s = bc_program_builtin(inst);
6686 r.t = BC_RESULT_CONSTANT;
6687 r.d.id.idx = bc_program_index(code, &ip->idx);
6688 bc_vec_push(&G.prog.results, &r);
6694 if (!BC_PROG_STACK(&G.prog.results, 1))
6695 s = bc_error_stack_has_too_few_elements();
6697 bc_vec_pop(&G.prog.results);
6701 case BC_INST_POP_EXEC:
6703 bc_vec_pop(&G.prog.stack);
6708 case BC_INST_PRINT_POP:
6709 case BC_INST_PRINT_STR:
6711 s = bc_program_print(inst, 0);
6717 r.t = BC_RESULT_STR;
6718 r.d.id.idx = bc_program_index(code, &ip->idx);
6719 bc_vec_push(&G.prog.results, &r);
6724 case BC_INST_MULTIPLY:
6725 case BC_INST_DIVIDE:
6726 case BC_INST_MODULUS:
6730 s = bc_program_op(inst);
6734 case BC_INST_BOOL_NOT:
6736 s = bc_program_prep(&ptr, &num);
6739 bc_num_init(&r.d.n, BC_NUM_DEF_SIZE);
6740 (!bc_num_cmp(num, &G.prog.zero) ? bc_num_one : bc_num_zero)(&r.d.n);
6741 bc_program_retire(&r, BC_RESULT_TEMP);
6748 s = bc_program_negate();
6753 case BC_INST_ASSIGN_POWER:
6754 case BC_INST_ASSIGN_MULTIPLY:
6755 case BC_INST_ASSIGN_DIVIDE:
6756 case BC_INST_ASSIGN_MODULUS:
6757 case BC_INST_ASSIGN_PLUS:
6758 case BC_INST_ASSIGN_MINUS:
6760 case BC_INST_ASSIGN:
6762 s = bc_program_assign(inst);
6766 case BC_INST_MODEXP:
6768 s = bc_program_modexp();
6772 case BC_INST_DIVMOD:
6774 s = bc_program_divmod();
6778 case BC_INST_EXECUTE:
6779 case BC_INST_EXEC_COND:
6781 cond = inst == BC_INST_EXEC_COND;
6782 s = bc_program_execStr(code, &ip->idx, cond);
6786 case BC_INST_PRINT_STACK:
6788 for (idx = 0; !s && idx < G.prog.results.len; ++idx)
6789 s = bc_program_print(BC_INST_PRINT, idx);
6793 case BC_INST_CLEAR_STACK:
6795 bc_vec_pop_all(&G.prog.results);
6799 case BC_INST_STACK_LEN:
6801 bc_program_stackLen();
6805 case BC_INST_DUPLICATE:
6807 if (!BC_PROG_STACK(&G.prog.results, 1))
6808 return bc_error_stack_has_too_few_elements();
6809 ptr = bc_vec_top(&G.prog.results);
6810 bc_result_copy(&r, ptr);
6811 bc_vec_push(&G.prog.results, &r);
6819 if (!BC_PROG_STACK(&G.prog.results, 2))
6820 return bc_error_stack_has_too_few_elements();
6822 ptr = bc_vec_item_rev(&G.prog.results, 0);
6823 ptr2 = bc_vec_item_rev(&G.prog.results, 1);
6824 memcpy(&r, ptr, sizeof(BcResult));
6825 memcpy(ptr, ptr2, sizeof(BcResult));
6826 memcpy(ptr2, &r, sizeof(BcResult));
6831 case BC_INST_ASCIIFY:
6833 s = bc_program_asciify();
6837 case BC_INST_PRINT_STREAM:
6839 s = bc_program_printStream();
6844 case BC_INST_PUSH_VAR:
6846 bool copy = inst == BC_INST_LOAD;
6847 s = bc_program_pushVar(code, &ip->idx, true, copy);
6851 case BC_INST_PUSH_TO_VAR:
6853 char *name = bc_program_name(code, &ip->idx);
6854 s = bc_program_copyToVar(name, true);
6861 if (G.prog.stack.len <= 2)
6862 quit_or_return_for_exit();
6863 bc_vec_npop(&G.prog.stack, 2);
6869 s = bc_program_nquit();
6875 if (s || G_interrupt) {
6880 // If the stack has changed, pointers may be invalid.
6881 ip = bc_vec_top(&G.prog.stack);
6882 func = bc_vec_item(&G.prog.fns, ip->func);
6883 code = func->code.v;
6889 static void bc_vm_info(void)
6891 printf("%s "BB_VER"\n"
6892 "Copyright (c) 2018 Gavin D. Howard and contributors\n"
6893 "Report bugs at: https://github.com/gavinhoward/bc\n"
6894 "This is free software with ABSOLUTELY NO WARRANTY\n"
6898 static void bc_args(char **argv)
6904 #if ENABLE_FEATURE_BC_LONG_OPTIONS
6905 opts = option_mask32 |= getopt32long(argv, "xwvsqli",
6906 "extended-register\0" No_argument "x"
6907 "warn\0" No_argument "w"
6908 "version\0" No_argument "v"
6909 "standard\0" No_argument "s"
6910 "quiet\0" No_argument "q"
6911 "mathlib\0" No_argument "l"
6912 "interactive\0" No_argument "i"
6915 opts = option_mask32 |= getopt32(argv, "xwvsqli");
6917 if (getenv("POSIXLY_CORRECT"))
6918 option_mask32 |= BC_FLAG_S;
6920 ///should be in bc_vm_run() instead??
6921 if (opts & BC_FLAG_V) {
6926 for (i = optind; argv[i]; ++i)
6927 bc_vec_push(&G.files, argv + i);
6931 static void bc_vm_envArgs(void)
6935 char *env_args = getenv("BC_ENV_ARGS");
6937 if (!env_args) return;
6939 G.env_args = xstrdup(env_args);
6942 bc_vec_init(&v, sizeof(char *), NULL);
6944 while (*(buf = skip_whitespace(buf)) != '\0') {
6945 bc_vec_push(&v, &buf);
6946 buf = skip_non_whitespace(buf);
6952 // NULL terminate, and pass argv[] so that first arg is argv[1]
6953 if (sizeof(int) == sizeof(char*)) {
6954 bc_vec_push(&v, &const_int_0);
6956 static char *const nullptr = NULL;
6957 bc_vec_push(&v, &nullptr);
6959 bc_args(((char **)v.v) - 1);
6965 static unsigned bc_vm_envLen(const char *var)
6971 len = BC_NUM_PRINT_WIDTH;
6972 if (!lenv) return len;
6974 len = bb_strtou(lenv, NULL, 10) - 1;
6975 if (errno || len < 2 || len >= INT_MAX)
6976 len = BC_NUM_PRINT_WIDTH;
6981 static BcStatus bc_vm_process(const char *text)
6983 BcStatus s = bc_parse_text(&G.prs, text);
6987 while (G.prs.l.t.t != BC_LEX_EOF) {
6988 s = G.prs.parse(&G.prs);
6992 if (BC_PARSE_CAN_EXEC(&G.prs)) {
6993 s = bc_program_exec();
7002 static BcStatus bc_vm_file(const char *file)
7004 const char *sv_file;
7010 data = bc_read_file(file);
7011 if (!data) return bc_error_fmt("file '%s' is not text", file);
7013 sv_file = G.prog.file;
7015 bc_lex_file(&G.prs.l);
7016 s = bc_vm_process(data);
7019 main_func = bc_vec_item(&G.prog.fns, BC_PROG_MAIN);
7020 ip = bc_vec_item(&G.prog.stack, 0);
7022 if (main_func->code.len < ip->idx)
7023 s = bc_error_fmt("file '%s' is not executable", file);
7026 G.prog.file = sv_file;
7031 static BcStatus bc_vm_stdin(void)
7035 size_t len, i, str = 0;
7036 bool comment = false;
7039 bc_lex_file(&G.prs.l);
7041 bc_char_vec_init(&buffer);
7042 bc_char_vec_init(&buf);
7043 bc_vec_pushZeroByte(&buffer);
7045 // This loop is complex because the vm tries not to send any lines that end
7046 // with a backslash to the parser. The reason for that is because the parser
7047 // treats a backslash+newline combo as whitespace, per the bc spec. In that
7048 // case, and for strings and comments, the parser will expect more stuff.
7049 s = BC_STATUS_SUCCESS;
7050 while (!G.eof && (s = bc_read_line(&buf, ">>> ")) == BC_STATUS_SUCCESS) {
7052 char *string = buf.v;
7057 if (str && buf.v[0] == G.send)
7059 else if (buf.v[0] == G.sbgn)
7062 else if (len > 1 || comment) {
7064 for (i = 0; i < len; ++i) {
7066 bool notend = len > i + 1;
7069 if (i - 1 > len || string[i - 1] != '\\') {
7070 if (G.sbgn == G.send)
7072 else if (c == G.send)
7074 else if (c == G.sbgn)
7078 if (c == '/' && notend && !comment && string[i + 1] == '*') {
7082 else if (c == '*' && notend && comment && string[i + 1] == '/')
7086 if (str || comment || string[len - 2] == '\\') {
7087 bc_vec_concat(&buffer, buf.v);
7092 bc_vec_concat(&buffer, buf.v);
7093 s = bc_vm_process(buffer.v);
7095 if (ENABLE_FEATURE_CLEAN_UP && !G_ttyin) {
7096 // Debug config, non-interactive mode:
7097 // return all the way back to main.
7098 // Non-debug builds do not come here, they exit.
7102 fputs("ready for more input\n", stderr);
7105 bc_vec_pop_all(&buffer);
7109 s = bc_error("string end could not be found");
7112 s = bc_error("comment end could not be found");
7116 bc_vec_free(&buffer);
7121 static const char bc_lib[] = {
7124 "\n" "auto b,s,n,r,d,i,p,f,v"
7133 "\n" "scale=scale(x)+1"
7143 "\n" "for(i=2;v!=0;++i){"
7149 "\n" "while((d--)!=0)r*=r"
7152 "\n" "if(n!=0)return(1/r)"
7156 "\n" "auto b,s,r,p,a,q,i,v"
7160 "\n" "r=(1-10^scale)/1"
7171 "\n" "while(x<=0.5){"
7175 "\n" "r=a=(x-1)/(x+1)"
7178 "\n" "for(i=3;v!=0;i+=2){"
7189 "\n" "auto b,s,r,n,a,q,i"
7193 "\n" "scale=1.1*s+2"
7202 "\n" "if(q%2!=0)x=-x"
7206 "\n" "for(i=3;a!=0;i+=2){"
7207 "\n" "a*=q/(i*(i-1))"
7212 "\n" "if(n!=0)return(-r/1)"
7221 "\n" "x=s(2*a(1)+x)"
7227 "\n" "auto b,s,r,n,a,m,t,f,i,u"
7236 "\n" "if(scale<65){"
7237 "\n" "return(.7853981633974483096156608458198757210492923498437764552437361480/n)"
7241 "\n" "if(scale<65){"
7242 "\n" "return(.1973955598498807583700497651947902934475851037878521015176889402/n)"
7253 "\n" "x=(x-.2)/(1+.2*x)"
7258 "\n" "for(i=3;t!=0;i+=2){"
7265 "\n" "return((m*a+r)/n)"
7267 "\n" "define j(n,x){"
7268 "\n" "auto b,s,o,a,i,v,f"
7276 "\n" "if(n%2==1)o=1"
7279 "\n" "for(i=2;i<=n;++i)a*=i"
7281 "\n" "a=(x^n)/2^n/a"
7284 "\n" "scale=scale+length(a)-scale(a)"
7285 "\n" "for(i=1;v!=0;++i){"
7286 "\n" "v=v*f/i/(n+i)"
7292 "\n" "return(a*r/1)"
7297 static BcStatus bc_vm_exec(void)
7299 BcStatus s = BC_STATUS_SUCCESS;
7303 if (option_mask32 & BC_FLAG_L) {
7305 // We know that internal library is not buggy,
7306 // thus error checking is normally disabled.
7307 # define DEBUG_LIB 0
7308 bc_lex_file(&G.prs.l);
7309 s = bc_parse_text(&G.prs, bc_lib);
7310 if (DEBUG_LIB && s) return s;
7312 while (G.prs.l.t.t != BC_LEX_EOF) {
7313 s = G.prs.parse(&G.prs);
7314 if (DEBUG_LIB && s) return s;
7316 s = bc_program_exec();
7317 if (DEBUG_LIB && s) return s;
7321 for (i = 0; !s && i < G.files.len; ++i)
7322 s = bc_vm_file(*((char **) bc_vec_item(&G.files, i)));
7324 if (ENABLE_FEATURE_CLEAN_UP && !G_ttyin) {
7325 // Debug config, non-interactive mode:
7326 // return all the way back to main.
7327 // Non-debug builds do not come here, they exit.
7331 fputs("ready for more input\n", stderr);
7334 if (IS_BC || !G.files.len)
7336 if (!s && !BC_PARSE_CAN_EXEC(&G.prs))
7337 s = bc_vm_process("");
7342 #if ENABLE_FEATURE_CLEAN_UP
7343 static void bc_program_free(void)
7345 bc_num_free(&G.prog.ib);
7346 bc_num_free(&G.prog.ob);
7347 bc_num_free(&G.prog.hexb);
7349 bc_num_free(&G.prog.strmb);
7351 bc_vec_free(&G.prog.fns);
7352 bc_vec_free(&G.prog.fn_map);
7353 bc_vec_free(&G.prog.vars);
7354 bc_vec_free(&G.prog.var_map);
7355 bc_vec_free(&G.prog.arrs);
7356 bc_vec_free(&G.prog.arr_map);
7357 bc_vec_free(&G.prog.strs);
7358 bc_vec_free(&G.prog.consts);
7359 bc_vec_free(&G.prog.results);
7360 bc_vec_free(&G.prog.stack);
7361 bc_num_free(&G.prog.last);
7362 bc_num_free(&G.prog.zero);
7363 bc_num_free(&G.prog.one);
7366 static void bc_vm_free(void)
7368 bc_vec_free(&G.files);
7370 bc_parse_free(&G.prs);
7375 static void bc_program_init(void)
7380 /* memset(&G.prog, 0, sizeof(G.prog)); - already is */
7381 memset(&ip, 0, sizeof(BcInstPtr));
7383 /* G.prog.nchars = G.prog.scale = 0; - already is */
7385 bc_num_init(&G.prog.ib, BC_NUM_DEF_SIZE);
7386 bc_num_ten(&G.prog.ib);
7389 bc_num_init(&G.prog.ob, BC_NUM_DEF_SIZE);
7390 bc_num_ten(&G.prog.ob);
7393 bc_num_init(&G.prog.hexb, BC_NUM_DEF_SIZE);
7394 bc_num_ten(&G.prog.hexb);
7395 G.prog.hexb.num[0] = 6;
7398 bc_num_init(&G.prog.strmb, BC_NUM_DEF_SIZE);
7399 bc_num_ulong2num(&G.prog.strmb, UCHAR_MAX + 1);
7402 bc_num_init(&G.prog.last, BC_NUM_DEF_SIZE);
7403 bc_num_zero(&G.prog.last);
7405 bc_num_init(&G.prog.zero, BC_NUM_DEF_SIZE);
7406 bc_num_zero(&G.prog.zero);
7408 bc_num_init(&G.prog.one, BC_NUM_DEF_SIZE);
7409 bc_num_one(&G.prog.one);
7411 bc_vec_init(&G.prog.fns, sizeof(BcFunc), bc_func_free);
7412 bc_vec_init(&G.prog.fn_map, sizeof(BcId), bc_id_free);
7414 bc_program_addFunc(xstrdup("(main)"), &idx);
7415 bc_program_addFunc(xstrdup("(read)"), &idx);
7417 bc_vec_init(&G.prog.vars, sizeof(BcVec), bc_vec_free);
7418 bc_vec_init(&G.prog.var_map, sizeof(BcId), bc_id_free);
7420 bc_vec_init(&G.prog.arrs, sizeof(BcVec), bc_vec_free);
7421 bc_vec_init(&G.prog.arr_map, sizeof(BcId), bc_id_free);
7423 bc_vec_init(&G.prog.strs, sizeof(char *), bc_string_free);
7424 bc_vec_init(&G.prog.consts, sizeof(char *), bc_string_free);
7425 bc_vec_init(&G.prog.results, sizeof(BcResult), bc_result_free);
7426 bc_vec_init(&G.prog.stack, sizeof(BcInstPtr), NULL);
7427 bc_vec_push(&G.prog.stack, &ip);
7430 static void bc_vm_init(void)
7432 bc_vec_init(&G.files, sizeof(char *), NULL);
7434 IF_BC(bc_vm_envArgs();)
7437 IF_BC(bc_parse_init(&G.prs, BC_PROG_MAIN);)
7439 IF_DC(dc_parse_init(&G.prs, BC_PROG_MAIN);)
7443 static BcStatus bc_vm_run(char **argv, const char *env_len)
7447 #if ENABLE_FEATURE_EDITING
7448 G.line_input_state = new_line_input_t(DO_HISTORY);
7450 G.prog.len = bc_vm_envLen(env_len);
7456 #if ENABLE_FEATURE_BC_SIGNALS
7458 // With SA_RESTART, most system calls will restart
7459 // (IOW: they won't fail with EINTR).
7460 // In particular, this means ^C won't cause
7461 // stdout to get into "error state" if SIGINT hits
7462 // within write() syscall.
7463 // The downside is that ^C while line input is taken
7464 // will only be handled after [Enter] since read()
7465 // from stdin is not interrupted by ^C either,
7466 // it restarts, thus fgetc() does not return on ^C.
7467 signal_SA_RESTART_empty_mask(SIGINT, record_signo);
7469 // Without SA_RESTART, this exhibits a bug:
7470 // "while (1) print 1" and try ^C-ing it.
7471 // Intermittently, instead of returning to input line,
7472 // you'll get "output error: Interrupted system call"
7474 //signal_no_SA_RESTART_empty_mask(SIGINT, record_signo);
7476 if (!(option_mask32 & BC_FLAG_Q))
7482 #if ENABLE_FEATURE_CLEAN_UP
7484 # if ENABLE_FEATURE_EDITING
7485 free_line_input_t(G.line_input_state);
7493 int bc_main(int argc, char **argv) MAIN_EXTERNALLY_VISIBLE;
7494 int bc_main(int argc UNUSED_PARAM, char **argv)
7497 G.sbgn = G.send = '"';
7499 return bc_vm_run(argv, "BC_LINE_LENGTH");
7504 int dc_main(int argc, char **argv) MAIN_EXTERNALLY_VISIBLE;
7505 int dc_main(int argc UNUSED_PARAM, char **argv)
7511 return bc_vm_run(argv, "DC_LINE_LENGTH");
7515 #endif // not DC_SMALL