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) \
512 { .name8 = a /*, .posix = b */ }
513 static const struct BcLexKeyword bc_lex_kws[20] = {
514 BC_LEX_KW_ENTRY("auto" , 1), // 0
515 BC_LEX_KW_ENTRY("break" , 1), // 1
516 BC_LEX_KW_ENTRY("continue", 0), // 2 note: this one has no terminating NUL
517 BC_LEX_KW_ENTRY("define" , 1), // 3
519 BC_LEX_KW_ENTRY("else" , 0), // 4
520 BC_LEX_KW_ENTRY("for" , 1), // 5
521 BC_LEX_KW_ENTRY("halt" , 0), // 6
522 BC_LEX_KW_ENTRY("ibase" , 1), // 7
524 BC_LEX_KW_ENTRY("if" , 1), // 8
525 BC_LEX_KW_ENTRY("last" , 0), // 9
526 BC_LEX_KW_ENTRY("length" , 1), // 10
527 BC_LEX_KW_ENTRY("limits" , 0), // 11
529 BC_LEX_KW_ENTRY("obase" , 1), // 12
530 BC_LEX_KW_ENTRY("print" , 0), // 13
531 BC_LEX_KW_ENTRY("quit" , 1), // 14
532 BC_LEX_KW_ENTRY("read" , 0), // 15
534 BC_LEX_KW_ENTRY("return" , 1), // 16
535 BC_LEX_KW_ENTRY("scale" , 1), // 17
536 BC_LEX_KW_ENTRY("sqrt" , 1), // 18
537 BC_LEX_KW_ENTRY("while" , 1), // 19
539 #undef BC_LEX_KW_ENTRY
567 #define bc_lex_kws_POSIX(i) ((1 << (i)) & POSIX_KWORD_MASK)
571 typedef BcStatus (*BcLexNext)(struct BcLex *);
573 typedef struct BcLex {
591 #define BC_PARSE_STREND ((char) UCHAR_MAX)
593 #define BC_PARSE_REL (1 << 0)
594 #define BC_PARSE_PRINT (1 << 1)
595 #define BC_PARSE_NOCALL (1 << 2)
596 #define BC_PARSE_NOREAD (1 << 3)
597 #define BC_PARSE_ARRAY (1 << 4)
599 #define BC_PARSE_TOP_FLAG_PTR(parse) ((uint8_t *) bc_vec_top(&(parse)->flags))
600 #define BC_PARSE_TOP_FLAG(parse) (*(BC_PARSE_TOP_FLAG_PTR(parse)))
602 #define BC_PARSE_FLAG_FUNC_INNER (1 << 0)
603 #define BC_PARSE_FUNC_INNER(parse) \
604 (BC_PARSE_TOP_FLAG(parse) & BC_PARSE_FLAG_FUNC_INNER)
606 #define BC_PARSE_FLAG_FUNC (1 << 1)
607 #define BC_PARSE_FUNC(parse) (BC_PARSE_TOP_FLAG(parse) & BC_PARSE_FLAG_FUNC)
609 #define BC_PARSE_FLAG_BODY (1 << 2)
610 #define BC_PARSE_BODY(parse) (BC_PARSE_TOP_FLAG(parse) & BC_PARSE_FLAG_BODY)
612 #define BC_PARSE_FLAG_LOOP (1 << 3)
613 #define BC_PARSE_LOOP(parse) (BC_PARSE_TOP_FLAG(parse) & BC_PARSE_FLAG_LOOP)
615 #define BC_PARSE_FLAG_LOOP_INNER (1 << 4)
616 #define BC_PARSE_LOOP_INNER(parse) \
617 (BC_PARSE_TOP_FLAG(parse) & BC_PARSE_FLAG_LOOP_INNER)
619 #define BC_PARSE_FLAG_IF (1 << 5)
620 #define BC_PARSE_IF(parse) (BC_PARSE_TOP_FLAG(parse) & BC_PARSE_FLAG_IF)
622 #define BC_PARSE_FLAG_ELSE (1 << 6)
623 #define BC_PARSE_ELSE(parse) (BC_PARSE_TOP_FLAG(parse) & BC_PARSE_FLAG_ELSE)
625 #define BC_PARSE_FLAG_IF_END (1 << 7)
626 #define BC_PARSE_IF_END(parse) (BC_PARSE_TOP_FLAG(parse) & BC_PARSE_FLAG_IF_END)
628 #define BC_PARSE_CAN_EXEC(parse) \
629 (!(BC_PARSE_TOP_FLAG(parse) & \
630 (BC_PARSE_FLAG_FUNC_INNER | BC_PARSE_FLAG_FUNC | BC_PARSE_FLAG_BODY | \
631 BC_PARSE_FLAG_LOOP | BC_PARSE_FLAG_LOOP_INNER | BC_PARSE_FLAG_IF | \
632 BC_PARSE_FLAG_ELSE | BC_PARSE_FLAG_IF_END)))
634 typedef struct BcParseNext {
643 typedef BcStatus (*BcParseParse)(struct BcParse *);
645 typedef struct BcParse {
666 typedef struct BcProgram {
707 #define BC_PROG_STACK(s, n) ((s)->len >= ((size_t) n))
709 #define BC_PROG_MAIN (0)
710 #define BC_PROG_READ (1)
712 #define BC_PROG_REQ_FUNCS (2)
715 #define BC_PROG_STR(n) (!(n)->num && !(n)->cap)
716 #define BC_PROG_NUM(r, n) \
717 ((r)->t != BC_RESULT_ARRAY && (r)->t != BC_RESULT_STR && !BC_PROG_STR(n))
719 typedef unsigned long (*BcProgramBuiltIn)(BcNum *);
721 #define BC_FLAG_X (1 << 0)
722 #define BC_FLAG_W (1 << 1)
723 #define BC_FLAG_V (1 << 2)
724 #define BC_FLAG_S (1 << 3)
725 #define BC_FLAG_Q (1 << 4)
726 #define BC_FLAG_L (1 << 5)
727 #define BC_FLAG_I (1 << 6)
729 #define BC_MAX(a, b) ((a) > (b) ? (a) : (b))
730 #define BC_MIN(a, b) ((a) < (b) ? (a) : (b))
732 #define BC_MAX_OBASE ((unsigned) 999)
733 #define BC_MAX_DIM ((unsigned) INT_MAX)
734 #define BC_MAX_SCALE ((unsigned) UINT_MAX)
735 #define BC_MAX_STRING ((unsigned) UINT_MAX - 1)
736 #define BC_MAX_NAME BC_MAX_STRING
737 #define BC_MAX_NUM BC_MAX_STRING
738 #define BC_MAX_EXP ((unsigned long) LONG_MAX)
739 #define BC_MAX_VARS ((unsigned long) SIZE_MAX - 1)
742 IF_FEATURE_BC_SIGNALS(smallint ttyin;)
750 // For error messages. Can be set to current parsed line,
751 // or [TODO] to current executing line (can be before last parsed one)
758 #if ENABLE_FEATURE_EDITING
759 line_input_t *line_input_state;
762 #define G (*ptr_to_globals)
763 #define INIT_G() do { \
764 SET_PTR_TO_GLOBALS(xzalloc(sizeof(G))); \
766 #define FREE_G() do { \
767 FREE_PTR_TO_GLOBALS(); \
769 #define G_posix (ENABLE_BC && (option_mask32 & BC_FLAG_S))
770 #define G_warn (ENABLE_BC && (option_mask32 & BC_FLAG_W))
771 #define G_exreg (ENABLE_DC && (option_mask32 & BC_FLAG_X))
772 #define G_interrupt (ENABLE_FEATURE_BC_SIGNALS ? bb_got_signal : 0)
773 #if ENABLE_FEATURE_BC_SIGNALS
774 # define G_ttyin G.ttyin
778 #define IS_BC (ENABLE_BC && (!ENABLE_DC || applet_name[0] == 'b'))
782 // This is a bit array that corresponds to token types. An entry is
783 // true if the token is valid in an expression, false otherwise.
785 BC_PARSE_EXPRS_BITS = 0
786 + ((uint64_t)((0 << 0)+(0 << 1)+(1 << 2)+(1 << 3)+(1 << 4)+(1 << 5)+(1 << 6)+(1 << 7)) << (0*8))
787 + ((uint64_t)((1 << 0)+(1 << 1)+(1 << 2)+(1 << 3)+(1 << 4)+(1 << 5)+(1 << 6)+(1 << 7)) << (1*8))
788 + ((uint64_t)((1 << 0)+(1 << 1)+(1 << 2)+(1 << 3)+(1 << 4)+(1 << 5)+(1 << 6)+(1 << 7)) << (2*8))
789 + ((uint64_t)((1 << 0)+(1 << 1)+(1 << 2)+(0 << 3)+(0 << 4)+(1 << 5)+(1 << 6)+(0 << 7)) << (3*8))
790 + ((uint64_t)((0 << 0)+(0 << 1)+(0 << 2)+(0 << 3)+(0 << 4)+(0 << 5)+(1 << 6)+(1 << 7)) << (4*8))
791 + ((uint64_t)((0 << 0)+(0 << 1)+(0 << 2)+(0 << 3)+(0 << 4)+(0 << 5)+(0 << 6)+(1 << 7)) << (5*8))
792 + ((uint64_t)((0 << 0)+(1 << 1)+(1 << 2)+(1 << 3)+(1 << 4)+(0 << 5)+(0 << 6)+(1 << 7)) << (6*8))
793 + ((uint64_t)((0 << 0)+(1 << 1)+(1 << 2)+(0 << 3) ) << (7*8))
795 static ALWAYS_INLINE long bc_parse_exprs(unsigned i)
797 #if ULONG_MAX > 0xffffffff
798 // 64-bit version (will not work correctly for 32-bit longs!)
799 return BC_PARSE_EXPRS_BITS & (1UL << i);
802 unsigned long m = (uint32_t)BC_PARSE_EXPRS_BITS;
804 m = (uint32_t)(BC_PARSE_EXPRS_BITS >> 32);
807 return m & (1UL << i);
811 // This is an array of data for operators that correspond to token types.
812 static const uint8_t bc_parse_ops[] = {
813 #define OP(p,l) ((int)(l) * 0x10 + (p))
814 OP(0, false), OP( 0, false ), // inc dec
817 OP(3, true ), OP( 3, true ), OP( 3, true ), // pow mul div
818 OP(4, true ), OP( 4, true ), // mod + -
819 OP(6, true ), OP( 6, true ), OP( 6, true ), OP( 6, true ), OP( 6, true ), OP( 6, true ), // == <= >= != < >
821 OP(7, true ), OP( 7, true ), // or and
822 OP(5, false), OP( 5, false ), OP( 5, false ), OP( 5, false ), OP( 5, false ), // ^= *= /= %= +=
823 OP(5, false), OP( 5, false ), // -= =
826 #define bc_parse_op_PREC(i) (bc_parse_ops[i] & 0x0f)
827 #define bc_parse_op_LEFT(i) (bc_parse_ops[i] & 0x10)
829 // These identify what tokens can come after expressions in certain cases.
830 #define BC_PARSE_NEXT_TOKENS(...) .tokens = { __VA_ARGS__ }
831 #define BC_PARSE_NEXT(a, ...) \
833 .len = (a), BC_PARSE_NEXT_TOKENS(__VA_ARGS__) \
835 static const BcParseNext bc_parse_next_expr =
836 BC_PARSE_NEXT(4, BC_LEX_NLINE, BC_LEX_SCOLON, BC_LEX_RBRACE, BC_LEX_EOF);
837 static const BcParseNext bc_parse_next_param =
838 BC_PARSE_NEXT(2, BC_LEX_RPAREN, BC_LEX_COMMA);
839 static const BcParseNext bc_parse_next_print =
840 BC_PARSE_NEXT(4, BC_LEX_COMMA, BC_LEX_NLINE, BC_LEX_SCOLON, BC_LEX_EOF);
841 static const BcParseNext bc_parse_next_rel = BC_PARSE_NEXT(1, BC_LEX_RPAREN);
842 static const BcParseNext bc_parse_next_elem = BC_PARSE_NEXT(1, BC_LEX_RBRACKET);
843 static const BcParseNext bc_parse_next_for = BC_PARSE_NEXT(1, BC_LEX_SCOLON);
844 static const BcParseNext bc_parse_next_read =
845 BC_PARSE_NEXT(2, BC_LEX_NLINE, BC_LEX_EOF);
849 static const BcLexType dc_lex_regs[] = {
850 BC_LEX_OP_REL_EQ, BC_LEX_OP_REL_LE, BC_LEX_OP_REL_GE, BC_LEX_OP_REL_NE,
851 BC_LEX_OP_REL_LT, BC_LEX_OP_REL_GT, BC_LEX_SCOLON, BC_LEX_COLON,
852 BC_LEX_ELSE, BC_LEX_LOAD, BC_LEX_LOAD_POP, BC_LEX_OP_ASSIGN,
856 static const BcLexType dc_lex_tokens[] = {
857 BC_LEX_OP_MODULUS, BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_LPAREN,
858 BC_LEX_INVALID, BC_LEX_OP_MULTIPLY, BC_LEX_OP_PLUS, BC_LEX_INVALID,
859 BC_LEX_OP_MINUS, BC_LEX_INVALID, BC_LEX_OP_DIVIDE,
860 BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID,
861 BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID,
862 BC_LEX_INVALID, BC_LEX_INVALID,
863 BC_LEX_COLON, BC_LEX_SCOLON, BC_LEX_OP_REL_GT, BC_LEX_OP_REL_EQ,
864 BC_LEX_OP_REL_LT, BC_LEX_KEY_READ, BC_LEX_INVALID,
865 BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID,
866 BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_EQ_NO_REG, BC_LEX_INVALID,
867 BC_LEX_KEY_IBASE, BC_LEX_INVALID, BC_LEX_KEY_SCALE, BC_LEX_LOAD_POP,
868 BC_LEX_INVALID, BC_LEX_OP_BOOL_NOT, BC_LEX_KEY_OBASE, BC_LEX_PRINT_STREAM,
869 BC_LEX_NQUIT, BC_LEX_POP, BC_LEX_STORE_PUSH, BC_LEX_INVALID, BC_LEX_INVALID,
870 BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_SCALE_FACTOR, BC_LEX_INVALID,
871 BC_LEX_KEY_LENGTH, BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID,
872 BC_LEX_OP_POWER, BC_LEX_NEG, BC_LEX_INVALID,
873 BC_LEX_ASCIIFY, BC_LEX_INVALID, BC_LEX_CLEAR_STACK, BC_LEX_DUPLICATE,
874 BC_LEX_ELSE, BC_LEX_PRINT_STACK, BC_LEX_INVALID, BC_LEX_INVALID,
875 BC_LEX_STORE_IBASE, BC_LEX_INVALID, BC_LEX_STORE_SCALE, BC_LEX_LOAD,
876 BC_LEX_INVALID, BC_LEX_PRINT_POP, BC_LEX_STORE_OBASE, BC_LEX_KEY_PRINT,
877 BC_LEX_KEY_QUIT, BC_LEX_SWAP, BC_LEX_OP_ASSIGN, BC_LEX_INVALID,
878 BC_LEX_INVALID, BC_LEX_KEY_SQRT, BC_LEX_INVALID, BC_LEX_EXECUTE,
879 BC_LEX_INVALID, BC_LEX_STACK_LEVEL,
880 BC_LEX_LBRACE, BC_LEX_OP_MODEXP, BC_LEX_INVALID, BC_LEX_OP_DIVMOD,
884 static const BcInst dc_parse_insts[] = {
885 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID, BC_INST_REL_GE,
886 BC_INST_INVALID, BC_INST_POWER, BC_INST_MULTIPLY, BC_INST_DIVIDE,
887 BC_INST_MODULUS, BC_INST_PLUS, BC_INST_MINUS,
888 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID,
889 BC_INST_INVALID, BC_INST_INVALID,
890 BC_INST_BOOL_NOT, BC_INST_INVALID, BC_INST_INVALID,
891 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID,
892 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID,
893 BC_INST_INVALID, BC_INST_INVALID, BC_INST_REL_GT, BC_INST_INVALID,
894 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID, BC_INST_REL_GE,
895 BC_INST_INVALID, BC_INST_INVALID,
896 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID,
897 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID,
898 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID, BC_INST_IBASE,
899 BC_INST_INVALID, BC_INST_INVALID, BC_INST_LENGTH, BC_INST_INVALID,
900 BC_INST_OBASE, BC_INST_PRINT, BC_INST_QUIT, BC_INST_INVALID,
901 BC_INST_INVALID, BC_INST_SCALE, BC_INST_SQRT, BC_INST_INVALID,
902 BC_INST_REL_EQ, BC_INST_MODEXP, BC_INST_DIVMOD, BC_INST_INVALID,
903 BC_INST_INVALID, BC_INST_EXECUTE, BC_INST_PRINT_STACK, BC_INST_CLEAR_STACK,
904 BC_INST_STACK_LEN, BC_INST_DUPLICATE, BC_INST_SWAP, BC_INST_POP,
905 BC_INST_ASCIIFY, BC_INST_PRINT_STREAM, BC_INST_INVALID, BC_INST_INVALID,
906 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID,
907 BC_INST_PRINT, BC_INST_NQUIT, BC_INST_SCALE_FUNC,
911 static const BcNumBinaryOp bc_program_ops[] = {
912 bc_num_pow, bc_num_mul, bc_num_div, bc_num_mod, bc_num_add, bc_num_sub,
915 static void fflush_and_check(void)
918 if (ferror(stdout) || ferror(stderr))
919 bb_perror_msg_and_die("output error");
922 #if ENABLE_FEATURE_CLEAN_UP
923 #define quit_or_return_for_exit() \
925 IF_FEATURE_BC_SIGNALS(G_ttyin = 0;) /* do not loop in main loop anymore */ \
926 return BC_STATUS_FAILURE; \
929 #define quit_or_return_for_exit() quit()
932 static void quit(void) NORETURN;
933 static void quit(void)
936 bb_perror_msg_and_die("input error");
941 static void bc_verror_msg(const char *fmt, va_list p)
943 const char *sv = sv; /* for compiler */
946 applet_name = xasprintf("%s: %s:%u", applet_name, G.prog.file, G.err_line);
948 bb_verror_msg(fmt, p, NULL);
950 free((char*)applet_name);
955 static NOINLINE int bc_error_fmt(const char *fmt, ...)
960 bc_verror_msg(fmt, p);
963 if (!ENABLE_FEATURE_CLEAN_UP && !G_ttyin)
965 return BC_STATUS_FAILURE;
969 static NOINLINE int bc_posix_error_fmt(const char *fmt, ...)
973 // Are non-POSIX constructs totally ok?
974 if (!(option_mask32 & (BC_FLAG_S|BC_FLAG_W)))
975 return BC_STATUS_SUCCESS; // yes
978 bc_verror_msg(fmt, p);
981 // Do we treat non-POSIX constructs as errors?
982 if (!(option_mask32 & BC_FLAG_S))
983 return BC_STATUS_SUCCESS; // no, it's a warning
984 if (!ENABLE_FEATURE_CLEAN_UP && !G_ttyin)
986 return BC_STATUS_FAILURE;
990 // We use error functions with "return bc_error(FMT[, PARAMS])" idiom.
991 // This idiom begs for tail-call optimization, but for it to work,
992 // function must not have caller-cleaned parameters on stack.
993 // Unfortunately, vararg function API does exactly that on most arches.
994 // Thus, use these shims for the cases when we have no vararg PARAMS:
995 static int bc_error(const char *msg)
997 return bc_error_fmt("%s", msg);
1000 static int bc_POSIX_requires(const char *msg)
1002 return bc_posix_error_fmt("POSIX requires %s", msg);
1004 static int bc_POSIX_does_not_allow(const char *msg)
1006 return bc_posix_error_fmt("%s%s", "POSIX does not allow ", msg);
1008 static int bc_POSIX_does_not_allow_bool_ops_this_is_bad(const char *msg)
1010 return bc_posix_error_fmt("%s%s %s", "POSIX does not allow ", "boolean operators; the following is bad:", msg);
1012 static int bc_POSIX_does_not_allow_empty_X_expression_in_for(const char *msg)
1014 return bc_posix_error_fmt("%san empty %s expression in a for loop", "POSIX does not allow ", msg);
1017 static int bc_error_bad_character(char c)
1019 return bc_error_fmt("bad character '%c'", c);
1021 static int bc_error_bad_expression(void)
1023 return bc_error("bad expression");
1025 static int bc_error_bad_token(void)
1027 return bc_error("bad token");
1029 static int bc_error_stack_has_too_few_elements(void)
1031 return bc_error("stack has too few elements");
1033 static int bc_error_variable_is_wrong_type(void)
1035 return bc_error("variable is wrong type");
1037 static int bc_error_nested_read_call(void)
1039 return bc_error("read() call inside of a read() call");
1042 static void bc_vec_grow(BcVec *v, size_t n)
1044 size_t cap = v->cap * 2;
1045 while (cap < v->len + n) cap *= 2;
1046 v->v = xrealloc(v->v, v->size * cap);
1050 static void bc_vec_init(BcVec *v, size_t esize, BcVecFree dtor)
1053 v->cap = BC_VEC_START_CAP;
1056 v->v = xmalloc(esize * BC_VEC_START_CAP);
1059 static void bc_char_vec_init(BcVec *v)
1061 bc_vec_init(v, sizeof(char), NULL);
1064 static void bc_vec_expand(BcVec *v, size_t req)
1067 v->v = xrealloc(v->v, v->size * req);
1072 static void bc_vec_pop(BcVec *v)
1076 v->dtor(v->v + (v->size * v->len));
1079 static void bc_vec_npop(BcVec *v, size_t n)
1084 size_t len = v->len - n;
1085 while (v->len > len) v->dtor(v->v + (v->size * --v->len));
1089 static void bc_vec_pop_all(BcVec *v)
1091 bc_vec_npop(v, v->len);
1094 static void bc_vec_push(BcVec *v, const void *data)
1096 if (v->len + 1 > v->cap) bc_vec_grow(v, 1);
1097 memmove(v->v + (v->size * v->len), data, v->size);
1101 static void bc_vec_pushByte(BcVec *v, char data)
1103 bc_vec_push(v, &data);
1106 static void bc_vec_pushZeroByte(BcVec *v)
1108 //bc_vec_pushByte(v, '\0');
1110 bc_vec_push(v, &const_int_0);
1113 static void bc_vec_pushAt(BcVec *v, const void *data, size_t idx)
1116 bc_vec_push(v, data);
1121 if (v->len == v->cap) bc_vec_grow(v, 1);
1123 ptr = v->v + v->size * idx;
1125 memmove(ptr + v->size, ptr, v->size * (v->len++ - idx));
1126 memmove(ptr, data, v->size);
1130 static void bc_vec_string(BcVec *v, size_t len, const char *str)
1133 bc_vec_expand(v, len + 1);
1134 memcpy(v->v, str, len);
1137 bc_vec_pushZeroByte(v);
1140 static void bc_vec_concat(BcVec *v, const char *str)
1144 if (v->len == 0) bc_vec_pushZeroByte(v);
1146 len = v->len + strlen(str);
1148 if (v->cap < len) bc_vec_grow(v, len - v->len);
1149 strcpy(v->v + v->len - 1, str);
1154 static void *bc_vec_item(const BcVec *v, size_t idx)
1156 return v->v + v->size * idx;
1159 static void *bc_vec_item_rev(const BcVec *v, size_t idx)
1161 return v->v + v->size * (v->len - idx - 1);
1164 static void *bc_vec_top(const BcVec *v)
1166 return v->v + v->size * (v->len - 1);
1169 static void bc_vec_free(void *vec)
1171 BcVec *v = (BcVec *) vec;
1176 static int bc_id_cmp(const void *e1, const void *e2)
1178 return strcmp(((const BcId *) e1)->name, ((const BcId *) e2)->name);
1181 static void bc_id_free(void *id)
1183 free(((BcId *) id)->name);
1186 static size_t bc_map_find(const BcVec *v, const void *ptr)
1188 size_t low = 0, high = v->len;
1190 while (low < high) {
1192 size_t mid = (low + high) / 2;
1193 BcId *id = bc_vec_item(v, mid);
1194 int result = bc_id_cmp(ptr, id);
1198 else if (result < 0)
1207 static int bc_map_insert(BcVec *v, const void *ptr, size_t *i)
1209 size_t n = *i = bc_map_find(v, ptr);
1212 bc_vec_push(v, ptr);
1213 else if (!bc_id_cmp(ptr, bc_vec_item(v, n)))
1214 return 0; // "was not inserted"
1216 bc_vec_pushAt(v, ptr, n);
1217 return 1; // "was inserted"
1221 static size_t bc_map_index(const BcVec *v, const void *ptr)
1223 size_t i = bc_map_find(v, ptr);
1224 if (i >= v->len) return BC_VEC_INVALID_IDX;
1225 return bc_id_cmp(ptr, bc_vec_item(v, i)) ? BC_VEC_INVALID_IDX : i;
1229 static int push_input_byte(BcVec *vec, char c)
1231 if ((c < ' ' && c != '\t' && c != '\r' && c != '\n') // also allow '\v' '\f'?
1234 // Bad chars on this line, ignore entire line
1235 bc_error_fmt("illegal character 0x%02x", c);
1238 bc_vec_pushByte(vec, (char)c);
1242 static BcStatus bc_read_line(BcVec *vec, const char *prompt)
1246 if (G_posix) prompt = "";
1252 bc_vec_pop_all(vec);
1256 #if ENABLE_FEATURE_BC_SIGNALS
1257 if (bb_got_signal) { // ^C was pressed
1259 bb_got_signal = 0; // resets G_interrupt to zero
1261 ? "\ninterrupt (type \"quit\" to exit)\n"
1262 : "\ninterrupt (type \"q\" to exit)\n"
1265 # if ENABLE_FEATURE_EDITING
1268 # define line_buf bb_common_bufsiz1
1269 n = read_line_input(G.line_input_state, prompt, line_buf, COMMON_BUFSIZE);
1270 if (n <= 0) { // read errors or EOF, or ^D, or ^C
1280 bad_chars |= push_input_byte(vec, c);
1288 fputs(prompt, stderr);
1289 IF_FEATURE_BC_SIGNALS(errno = 0;)
1292 #if ENABLE_FEATURE_BC_SIGNALS && !ENABLE_FEATURE_EDITING
1293 // Both conditions appear simultaneously, check both just in case
1294 if (errno == EINTR || bb_got_signal) {
1302 quit(); // this emits error message
1304 // Note: EOF does not append '\n', therefore:
1305 // printf 'print 123\n' | bc - works
1306 // printf 'print 123' | bc - fails (syntax error)
1309 bad_chars |= push_input_byte(vec, c);
1310 } while (c != '\n');
1312 } while (bad_chars);
1314 bc_vec_pushZeroByte(vec);
1316 return BC_STATUS_SUCCESS;
1319 static char* bc_read_file(const char *path)
1322 size_t size = ((size_t) -1);
1325 buf = xmalloc_open_read_close(path, &size);
1327 for (i = 0; i < size; ++i) {
1329 if ((c < ' ' && c != '\t' && c != '\r' && c != '\n') // also allow '\v' '\f'?
1341 static void bc_num_setToZero(BcNum *n, size_t scale)
1348 static void bc_num_zero(BcNum *n)
1350 bc_num_setToZero(n, 0);
1353 static void bc_num_one(BcNum *n)
1355 bc_num_setToZero(n, 0);
1360 static void bc_num_ten(BcNum *n)
1362 bc_num_setToZero(n, 0);
1368 static void bc_num_init(BcNum *n, size_t req)
1370 req = req >= BC_NUM_DEF_SIZE ? req : BC_NUM_DEF_SIZE;
1371 memset(n, 0, sizeof(BcNum));
1372 n->num = xmalloc(req);
1376 static void bc_num_expand(BcNum *n, size_t req)
1378 req = req >= BC_NUM_DEF_SIZE ? req : BC_NUM_DEF_SIZE;
1380 n->num = xrealloc(n->num, req);
1385 static void bc_num_free(void *num)
1387 free(((BcNum *) num)->num);
1390 static void bc_num_copy(BcNum *d, BcNum *s)
1393 bc_num_expand(d, s->cap);
1397 memcpy(d->num, s->num, sizeof(BcDig) * d->len);
1401 static BcStatus bc_num_ulong(BcNum *n, unsigned long *result)
1406 if (n->neg) return bc_error("negative number");
1408 for (*result = 0, pow = 1, i = n->rdx; i < n->len; ++i) {
1410 unsigned long prev = *result, powprev = pow;
1412 *result += ((unsigned long) n->num[i]) * pow;
1415 if (*result < prev || pow < powprev)
1416 return bc_error("overflow");
1419 return BC_STATUS_SUCCESS;
1422 static void bc_num_ulong2num(BcNum *n, unsigned long val)
1430 if (val == 0) return;
1432 for (len = 1, i = ULONG_MAX; i != 0; i /= 10, ++len) bc_num_expand(n, len);
1433 for (ptr = n->num, i = 0; val; ++i, ++n->len, val /= 10) ptr[i] = val % 10;
1436 static void bc_num_subArrays(BcDig *restrict a, BcDig *restrict b,
1440 for (i = 0; i < len; ++i) {
1441 for (a[i] -= b[i], j = 0; a[i + j] < 0;) {
1448 static ssize_t bc_num_compare(BcDig *restrict a, BcDig *restrict b, size_t len)
1452 for (i = len - 1; i < len && !(c = a[i] - b[i]); --i);
1453 return BC_NUM_NEG(i + 1, c < 0);
1456 static ssize_t bc_num_cmp(BcNum *a, BcNum *b)
1458 size_t i, min, a_int, b_int, diff;
1459 BcDig *max_num, *min_num;
1460 bool a_max, neg = false;
1463 if (a == b) return 0;
1464 if (a->len == 0) return BC_NUM_NEG(!!b->len, !b->neg);
1465 if (b->len == 0) return BC_NUM_NEG(1, a->neg);
1475 a_int = BC_NUM_INT(a);
1476 b_int = BC_NUM_INT(b);
1478 a_max = (a->rdx > b->rdx);
1480 if (a_int != 0) return (ssize_t) a_int;
1484 diff = a->rdx - b->rdx;
1485 max_num = a->num + diff;
1490 diff = b->rdx - a->rdx;
1491 max_num = b->num + diff;
1495 cmp = bc_num_compare(max_num, min_num, b_int + min);
1496 if (cmp != 0) return BC_NUM_NEG(cmp, (!a_max) != neg);
1498 for (max_num -= diff, i = diff - 1; i < diff; --i) {
1499 if (max_num[i]) return BC_NUM_NEG(1, (!a_max) != neg);
1505 static void bc_num_truncate(BcNum *n, size_t places)
1507 if (places == 0) return;
1513 memmove(n->num, n->num + places, n->len * sizeof(BcDig));
1517 static void bc_num_extend(BcNum *n, size_t places)
1519 size_t len = n->len + places;
1523 if (n->cap < len) bc_num_expand(n, len);
1525 memmove(n->num + places, n->num, sizeof(BcDig) * n->len);
1526 memset(n->num, 0, sizeof(BcDig) * places);
1533 static void bc_num_clean(BcNum *n)
1535 while (n->len > 0 && n->num[n->len - 1] == 0) --n->len;
1538 else if (n->len < n->rdx)
1542 static void bc_num_retireMul(BcNum *n, size_t scale, bool neg1, bool neg2)
1545 bc_num_extend(n, scale - n->rdx);
1547 bc_num_truncate(n, n->rdx - scale);
1550 if (n->len != 0) n->neg = !neg1 != !neg2;
1553 static void bc_num_split(BcNum *restrict n, size_t idx, BcNum *restrict a,
1558 b->len = n->len - idx;
1560 a->rdx = b->rdx = 0;
1562 memcpy(b->num, n->num + idx, b->len * sizeof(BcDig));
1563 memcpy(a->num, n->num, idx * sizeof(BcDig));
1574 static BcStatus bc_num_shift(BcNum *n, size_t places)
1576 if (places == 0 || n->len == 0) return BC_STATUS_SUCCESS;
1577 if (places + n->len > BC_MAX_NUM)
1578 return bc_error("number too long: must be [1, BC_NUM_MAX]");
1580 if (n->rdx >= places)
1583 bc_num_extend(n, places - n->rdx);
1589 return BC_STATUS_SUCCESS;
1592 static BcStatus bc_num_inv(BcNum *a, BcNum *b, size_t scale)
1601 return bc_num_div(&one, a, b, scale);
1604 static BcStatus bc_num_a(BcNum *a, BcNum *b, BcNum *restrict c, size_t sub)
1606 BcDig *ptr, *ptr_a, *ptr_b, *ptr_c;
1607 size_t i, max, min_rdx, min_int, diff, a_int, b_int;
1610 // Because this function doesn't need to use scale (per the bc spec),
1611 // I am hijacking it to say whether it's doing an add or a subtract.
1615 if (sub && c->len) c->neg = !c->neg;
1616 return BC_STATUS_SUCCESS;
1618 else if (b->len == 0) {
1620 return BC_STATUS_SUCCESS;
1624 c->rdx = BC_MAX(a->rdx, b->rdx);
1625 min_rdx = BC_MIN(a->rdx, b->rdx);
1628 if (a->rdx > b->rdx) {
1629 diff = a->rdx - b->rdx;
1631 ptr_a = a->num + diff;
1635 diff = b->rdx - a->rdx;
1638 ptr_b = b->num + diff;
1641 for (ptr_c = c->num, i = 0; i < diff; ++i, ++c->len) ptr_c[i] = ptr[i];
1644 a_int = BC_NUM_INT(a);
1645 b_int = BC_NUM_INT(b);
1647 if (a_int > b_int) {
1658 for (carry = 0, i = 0; i < min_rdx + min_int; ++i, ++c->len) {
1659 in = ((int) ptr_a[i]) + ((int) ptr_b[i]) + carry;
1661 ptr_c[i] = (BcDig)(in % 10);
1664 for (; i < max + min_rdx; ++i, ++c->len) {
1665 in = ((int) ptr[i]) + carry;
1667 ptr_c[i] = (BcDig)(in % 10);
1670 if (carry != 0) c->num[c->len++] = (BcDig) carry;
1672 return BC_STATUS_SUCCESS; // can't make void, see bc_num_binary()
1675 static BcStatus bc_num_s(BcNum *a, BcNum *b, BcNum *restrict c, size_t sub)
1678 BcNum *minuend, *subtrahend;
1680 bool aneg, bneg, neg;
1682 // Because this function doesn't need to use scale (per the bc spec),
1683 // I am hijacking it to say whether it's doing an add or a subtract.
1687 if (sub && c->len) c->neg = !c->neg;
1688 return BC_STATUS_SUCCESS;
1690 else if (b->len == 0) {
1692 return BC_STATUS_SUCCESS;
1697 a->neg = b->neg = false;
1699 cmp = bc_num_cmp(a, b);
1705 bc_num_setToZero(c, BC_MAX(a->rdx, b->rdx));
1706 return BC_STATUS_SUCCESS;
1715 if (sub) neg = !neg;
1720 bc_num_copy(c, minuend);
1723 if (c->rdx < subtrahend->rdx) {
1724 bc_num_extend(c, subtrahend->rdx - c->rdx);
1728 start = c->rdx - subtrahend->rdx;
1730 bc_num_subArrays(c->num + start, subtrahend->num, subtrahend->len);
1734 return BC_STATUS_SUCCESS; // can't make void, see bc_num_binary()
1737 static BcStatus bc_num_k(BcNum *restrict a, BcNum *restrict b,
1741 size_t max = BC_MAX(a->len, b->len), max2 = (max + 1) / 2;
1742 BcNum l1, h1, l2, h2, m2, m1, z0, z1, z2, temp;
1745 if (a->len == 0 || b->len == 0) {
1747 return BC_STATUS_SUCCESS;
1749 aone = BC_NUM_ONE(a);
1750 if (aone || BC_NUM_ONE(b)) {
1751 bc_num_copy(c, aone ? b : a);
1752 return BC_STATUS_SUCCESS;
1755 if (a->len + b->len < BC_NUM_KARATSUBA_LEN ||
1756 a->len < BC_NUM_KARATSUBA_LEN || b->len < BC_NUM_KARATSUBA_LEN)
1761 bc_num_expand(c, a->len + b->len + 1);
1763 memset(c->num, 0, sizeof(BcDig) * c->cap);
1766 for (i = 0; i < b->len; ++i) {
1769 for (j = 0; j < a->len; ++j) {
1770 unsigned in = c->num[i + j];
1771 in += ((unsigned) a->num[j]) * ((unsigned) b->num[i]) + carry;
1772 // note: compilers prefer _unsigned_ div/const
1774 c->num[i + j] = (BcDig)(in % 10);
1777 c->num[i + j] += (BcDig) carry;
1778 len = BC_MAX(len, i + j + !!carry);
1781 // a*a <- without check below, this will not be interruptible
1782 if (G_interrupt) return BC_STATUS_FAILURE;
1787 return BC_STATUS_SUCCESS;
1790 bc_num_init(&l1, max);
1791 bc_num_init(&h1, max);
1792 bc_num_init(&l2, max);
1793 bc_num_init(&h2, max);
1794 bc_num_init(&m1, max);
1795 bc_num_init(&m2, max);
1796 bc_num_init(&z0, max);
1797 bc_num_init(&z1, max);
1798 bc_num_init(&z2, max);
1799 bc_num_init(&temp, max + max);
1801 bc_num_split(a, max2, &l1, &h1);
1802 bc_num_split(b, max2, &l2, &h2);
1804 s = bc_num_add(&h1, &l1, &m1, 0);
1806 s = bc_num_add(&h2, &l2, &m2, 0);
1809 s = bc_num_k(&h1, &h2, &z0);
1811 s = bc_num_k(&m1, &m2, &z1);
1813 s = bc_num_k(&l1, &l2, &z2);
1816 s = bc_num_sub(&z1, &z0, &temp, 0);
1818 s = bc_num_sub(&temp, &z2, &z1, 0);
1821 s = bc_num_shift(&z0, max2 * 2);
1823 s = bc_num_shift(&z1, max2);
1825 s = bc_num_add(&z0, &z1, &temp, 0);
1827 s = bc_num_add(&temp, &z2, c, 0);
1843 static BcStatus bc_num_m(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale)
1847 size_t maxrdx = BC_MAX(a->rdx, b->rdx);
1849 scale = BC_MAX(scale, a->rdx);
1850 scale = BC_MAX(scale, b->rdx);
1851 scale = BC_MIN(a->rdx + b->rdx, scale);
1852 maxrdx = BC_MAX(maxrdx, scale);
1854 bc_num_init(&cpa, a->len);
1855 bc_num_init(&cpb, b->len);
1857 bc_num_copy(&cpa, a);
1858 bc_num_copy(&cpb, b);
1859 cpa.neg = cpb.neg = false;
1861 s = bc_num_shift(&cpa, maxrdx);
1863 s = bc_num_shift(&cpb, maxrdx);
1865 s = bc_num_k(&cpa, &cpb, c);
1869 bc_num_expand(c, c->len + maxrdx);
1871 if (c->len < maxrdx) {
1872 memset(c->num + c->len, 0, (c->cap - c->len) * sizeof(BcDig));
1877 bc_num_retireMul(c, scale, a->neg, b->neg);
1885 static BcStatus bc_num_d(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale)
1887 BcStatus s = BC_STATUS_SUCCESS;
1894 return bc_error("divide by zero");
1895 else if (a->len == 0) {
1896 bc_num_setToZero(c, scale);
1897 return BC_STATUS_SUCCESS;
1899 else if (BC_NUM_ONE(b)) {
1901 bc_num_retireMul(c, scale, a->neg, b->neg);
1902 return BC_STATUS_SUCCESS;
1905 bc_num_init(&cp, BC_NUM_MREQ(a, b, scale));
1906 bc_num_copy(&cp, a);
1910 bc_num_expand(&cp, len + 2);
1911 bc_num_extend(&cp, len - cp.len);
1914 if (b->rdx > cp.rdx) bc_num_extend(&cp, b->rdx - cp.rdx);
1916 if (scale > cp.rdx) bc_num_extend(&cp, scale - cp.rdx);
1918 if (b->rdx == b->len) {
1919 for (i = 0; zero && i < len; ++i) zero = !b->num[len - i - 1];
1923 if (cp.cap == cp.len) bc_num_expand(&cp, cp.len + 1);
1925 // We want an extra zero in front to make things simpler.
1926 cp.num[cp.len++] = 0;
1929 bc_num_expand(c, cp.len);
1932 memset(c->num + end, 0, (c->cap - end) * sizeof(BcDig));
1937 for (i = end - 1; !s && i < end; --i) {
1939 for (q = 0; (!s && n[len] != 0) || bc_num_compare(n, p, len) >= 0; ++q)
1940 bc_num_subArrays(n, p, len);
1944 // 1/a <- without check below, this will not be interruptible
1946 s = BC_STATUS_FAILURE;
1951 bc_num_retireMul(c, scale, a->neg, b->neg);
1957 static BcStatus bc_num_r(BcNum *a, BcNum *b, BcNum *restrict c,
1958 BcNum *restrict d, size_t scale, size_t ts)
1965 return bc_error("divide by zero");
1968 bc_num_setToZero(d, ts);
1969 return BC_STATUS_SUCCESS;
1972 bc_num_init(&temp, d->cap);
1973 s = bc_num_d(a, b, c, scale);
1976 if (scale != 0) scale = ts;
1978 s = bc_num_m(c, b, &temp, scale);
1980 s = bc_num_sub(a, &temp, d, scale);
1983 if (ts > d->rdx && d->len) bc_num_extend(d, ts - d->rdx);
1986 bc_num_retireMul(d, ts, a->neg, b->neg);
1994 static BcStatus bc_num_rem(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale)
1998 size_t ts = BC_MAX(scale + b->rdx, a->rdx), len = BC_NUM_MREQ(a, b, ts);
2000 bc_num_init(&c1, len);
2001 s = bc_num_r(a, b, &c1, c, scale, ts);
2007 static BcStatus bc_num_p(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale)
2009 BcStatus s = BC_STATUS_SUCCESS;
2012 size_t i, powrdx, resrdx;
2015 if (b->rdx) return bc_error("non integer number");
2019 return BC_STATUS_SUCCESS;
2021 else if (a->len == 0) {
2022 bc_num_setToZero(c, scale);
2023 return BC_STATUS_SUCCESS;
2025 else if (BC_NUM_ONE(b)) {
2029 s = bc_num_inv(a, c, scale);
2036 s = bc_num_ulong(b, &pow);
2039 bc_num_init(©, a->len);
2040 bc_num_copy(©, a);
2042 if (!neg) scale = BC_MIN(a->rdx * pow, BC_MAX(scale, a->rdx));
2046 for (powrdx = a->rdx; !(pow & 1); pow >>= 1) {
2048 s = bc_num_mul(©, ©, ©, powrdx);
2050 // Not needed: bc_num_mul() has a check for ^C:
2051 //if (G_interrupt) {
2052 // s = BC_STATUS_FAILURE;
2057 bc_num_copy(c, ©);
2059 for (resrdx = powrdx, pow >>= 1; pow != 0; pow >>= 1) {
2062 s = bc_num_mul(©, ©, ©, powrdx);
2067 s = bc_num_mul(c, ©, c, resrdx);
2070 // Not needed: bc_num_mul() has a check for ^C:
2071 //if (G_interrupt) {
2072 // s = BC_STATUS_FAILURE;
2078 s = bc_num_inv(c, c, scale);
2082 if (c->rdx > scale) bc_num_truncate(c, c->rdx - scale);
2084 // We can't use bc_num_clean() here.
2085 for (zero = true, i = 0; zero && i < c->len; ++i) zero = !c->num[i];
2086 if (zero) bc_num_setToZero(c, scale);
2093 static BcStatus bc_num_binary(BcNum *a, BcNum *b, BcNum *c, size_t scale,
2094 BcNumBinaryOp op, size_t req)
2097 BcNum num2, *ptr_a, *ptr_b;
2102 memcpy(ptr_a, c, sizeof(BcNum));
2111 memcpy(ptr_b, c, sizeof(BcNum));
2119 bc_num_init(c, req);
2121 bc_num_expand(c, req);
2123 s = op(ptr_a, ptr_b, c, scale);
2125 if (init) bc_num_free(&num2);
2130 static bool bc_num_strValid(const char *val, size_t base)
2133 bool small, radix = false;
2134 size_t i, len = strlen(val);
2136 if (!len) return true;
2139 b = (BcDig)(small ? base + '0' : base - 10 + 'A');
2141 for (i = 0; i < len; ++i) {
2147 if (radix) return false;
2153 if (c < '0' || (small && c >= b) || (c > '9' && (c < 'A' || c >= b)))
2160 static void bc_num_parseDecimal(BcNum *n, const char *val)
2166 for (i = 0; val[i] == '0'; ++i);
2173 for (i = 0; zero && i < len; ++i) zero = val[i] == '0' || val[i] == '.';
2174 bc_num_expand(n, len);
2177 ptr = strchr(val, '.');
2181 n->rdx = (size_t)((val + len) - (ptr + 1));
2184 for (i = len - 1; i < len; ++n->len, i -= 1 + (i && val[i - 1] == '.'))
2185 n->num[n->len] = val[i] - '0';
2189 static void bc_num_parseBase(BcNum *n, const char *val, BcNum *base)
2192 BcNum temp, mult, result;
2196 size_t i, digits, len = strlen(val);
2200 for (i = 0; zero && i < len; ++i) zero = (val[i] == '.' || val[i] == '0');
2203 bc_num_init(&temp, BC_NUM_DEF_SIZE);
2204 bc_num_init(&mult, BC_NUM_DEF_SIZE);
2206 for (i = 0; i < len; ++i) {
2209 if (c == '.') break;
2211 v = (unsigned long) (c <= '9' ? c - '0' : c - 'A' + 10);
2213 s = bc_num_mul(n, base, &mult, 0);
2214 if (s) goto int_err;
2215 bc_num_ulong2num(&temp, v);
2216 s = bc_num_add(&mult, &temp, n, 0);
2217 if (s) goto int_err;
2222 if (c == 0) goto int_err;
2225 bc_num_init(&result, base->len);
2226 bc_num_zero(&result);
2229 for (i += 1, digits = 0; i < len; ++i, ++digits) {
2234 v = (unsigned long) (c <= '9' ? c - '0' : c - 'A' + 10);
2236 s = bc_num_mul(&result, base, &result, 0);
2238 bc_num_ulong2num(&temp, v);
2239 s = bc_num_add(&result, &temp, &result, 0);
2241 s = bc_num_mul(&mult, base, &mult, 0);
2245 s = bc_num_div(&result, &mult, &result, digits);
2247 s = bc_num_add(n, &result, n, digits);
2251 if (n->rdx < digits) bc_num_extend(n, digits - n->rdx);
2257 bc_num_free(&result);
2263 static void bc_num_printNewline(size_t *nchars, size_t line_len)
2265 if (*nchars == line_len - 1) {
2273 static void bc_num_printChar(size_t num, size_t width, bool radix,
2274 size_t *nchars, size_t line_len)
2276 (void) radix, (void) line_len;
2277 bb_putchar((char) num);
2278 *nchars = *nchars + width;
2282 static void bc_num_printDigits(size_t num, size_t width, bool radix,
2283 size_t *nchars, size_t line_len)
2287 bc_num_printNewline(nchars, line_len);
2288 bb_putchar(radix ? '.' : ' ');
2291 bc_num_printNewline(nchars, line_len);
2292 for (exp = 0, pow = 1; exp < width - 1; ++exp, pow *= 10)
2295 for (exp = 0; exp < width; pow /= 10, ++(*nchars), ++exp) {
2297 bc_num_printNewline(nchars, line_len);
2300 bb_putchar(((char) dig) + '0');
2304 static void bc_num_printHex(size_t num, size_t width, bool radix,
2305 size_t *nchars, size_t line_len)
2308 bc_num_printNewline(nchars, line_len);
2313 bc_num_printNewline(nchars, line_len);
2314 bb_putchar(bb_hexdigits_upcase[num]);
2315 *nchars = *nchars + width;
2318 static void bc_num_printDecimal(BcNum *n, size_t *nchars, size_t len)
2320 size_t i, rdx = n->rdx - 1;
2322 if (n->neg) bb_putchar('-');
2323 (*nchars) += n->neg;
2325 for (i = n->len - 1; i < n->len; --i)
2326 bc_num_printHex((size_t) n->num[i], 1, i == rdx, nchars, len);
2329 static BcStatus bc_num_printNum(BcNum *n, BcNum *base, size_t width,
2330 size_t *nchars, size_t len, BcNumDigitOp print)
2334 BcNum intp, fracp, digit, frac_len;
2335 unsigned long dig, *ptr;
2340 print(0, width, false, nchars, len);
2341 return BC_STATUS_SUCCESS;
2344 bc_vec_init(&stack, sizeof(long), NULL);
2345 bc_num_init(&intp, n->len);
2346 bc_num_init(&fracp, n->rdx);
2347 bc_num_init(&digit, width);
2348 bc_num_init(&frac_len, BC_NUM_INT(n));
2349 bc_num_copy(&intp, n);
2350 bc_num_one(&frac_len);
2352 bc_num_truncate(&intp, intp.rdx);
2353 s = bc_num_sub(n, &intp, &fracp, 0);
2356 while (intp.len != 0) {
2357 s = bc_num_divmod(&intp, base, &intp, &digit, 0);
2359 s = bc_num_ulong(&digit, &dig);
2361 bc_vec_push(&stack, &dig);
2364 for (i = 0; i < stack.len; ++i) {
2365 ptr = bc_vec_item_rev(&stack, i);
2366 print(*ptr, width, false, nchars, len);
2369 if (!n->rdx) goto err;
2371 for (radix = true; frac_len.len <= n->rdx; radix = false) {
2372 s = bc_num_mul(&fracp, base, &fracp, n->rdx);
2374 s = bc_num_ulong(&fracp, &dig);
2376 bc_num_ulong2num(&intp, dig);
2377 s = bc_num_sub(&fracp, &intp, &fracp, 0);
2379 print(dig, width, radix, nchars, len);
2380 s = bc_num_mul(&frac_len, base, &frac_len, 0);
2385 bc_num_free(&frac_len);
2386 bc_num_free(&digit);
2387 bc_num_free(&fracp);
2389 bc_vec_free(&stack);
2393 static BcStatus bc_num_printBase(BcNum *n, BcNum *base, size_t base_t,
2394 size_t *nchars, size_t line_len)
2401 if (neg) bb_putchar('-');
2406 if (base_t <= BC_NUM_MAX_IBASE) {
2408 print = bc_num_printHex;
2411 for (i = base_t - 1, width = 0; i != 0; i /= 10, ++width);
2412 print = bc_num_printDigits;
2415 s = bc_num_printNum(n, base, width, nchars, line_len, print);
2422 static BcStatus bc_num_stream(BcNum *n, BcNum *base, size_t *nchars, size_t len)
2424 return bc_num_printNum(n, base, 1, nchars, len, bc_num_printChar);
2428 static BcStatus bc_num_parse(BcNum *n, const char *val, BcNum *base,
2431 if (!bc_num_strValid(val, base_t))
2432 return bc_error("bad number string");
2435 bc_num_parseDecimal(n, val);
2437 bc_num_parseBase(n, val, base);
2439 return BC_STATUS_SUCCESS;
2442 static BcStatus bc_num_print(BcNum *n, BcNum *base, size_t base_t, bool newline,
2443 size_t *nchars, size_t line_len)
2445 BcStatus s = BC_STATUS_SUCCESS;
2447 bc_num_printNewline(nchars, line_len);
2453 else if (base_t == 10)
2454 bc_num_printDecimal(n, nchars, line_len);
2456 s = bc_num_printBase(n, base, base_t, nchars, line_len);
2466 static BcStatus bc_num_add(BcNum *a, BcNum *b, BcNum *c, size_t scale)
2468 BcNumBinaryOp op = (!a->neg == !b->neg) ? bc_num_a : bc_num_s;
2470 return bc_num_binary(a, b, c, false, op, BC_NUM_AREQ(a, b));
2473 static BcStatus bc_num_sub(BcNum *a, BcNum *b, BcNum *c, size_t scale)
2475 BcNumBinaryOp op = (!a->neg == !b->neg) ? bc_num_s : bc_num_a;
2477 return bc_num_binary(a, b, c, true, op, BC_NUM_AREQ(a, b));
2480 static BcStatus bc_num_mul(BcNum *a, BcNum *b, BcNum *c, size_t scale)
2482 size_t req = BC_NUM_MREQ(a, b, scale);
2483 return bc_num_binary(a, b, c, scale, bc_num_m, req);
2486 static BcStatus bc_num_div(BcNum *a, BcNum *b, BcNum *c, size_t scale)
2488 size_t req = BC_NUM_MREQ(a, b, scale);
2489 return bc_num_binary(a, b, c, scale, bc_num_d, req);
2492 static BcStatus bc_num_mod(BcNum *a, BcNum *b, BcNum *c, size_t scale)
2494 size_t req = BC_NUM_MREQ(a, b, scale);
2495 return bc_num_binary(a, b, c, scale, bc_num_rem, req);
2498 static BcStatus bc_num_pow(BcNum *a, BcNum *b, BcNum *c, size_t scale)
2500 return bc_num_binary(a, b, c, scale, bc_num_p, a->len * b->len + 1);
2503 static BcStatus bc_num_sqrt(BcNum *a, BcNum *restrict b, size_t scale)
2506 BcNum num1, num2, half, f, fprime, *x0, *x1, *temp;
2507 size_t pow, len, digs, digs1, resrdx, req, times = 0;
2508 ssize_t cmp = 1, cmp1 = SSIZE_MAX, cmp2 = SSIZE_MAX;
2510 req = BC_MAX(scale, a->rdx) + ((BC_NUM_INT(a) + 1) >> 1) + 1;
2511 bc_num_expand(b, req);
2514 bc_num_setToZero(b, scale);
2515 return BC_STATUS_SUCCESS;
2518 return bc_error("negative number");
2519 else if (BC_NUM_ONE(a)) {
2521 bc_num_extend(b, scale);
2522 return BC_STATUS_SUCCESS;
2525 scale = BC_MAX(scale, a->rdx) + 1;
2526 len = a->len + scale;
2528 bc_num_init(&num1, len);
2529 bc_num_init(&num2, len);
2530 bc_num_init(&half, BC_NUM_DEF_SIZE);
2536 bc_num_init(&f, len);
2537 bc_num_init(&fprime, len);
2543 pow = BC_NUM_INT(a);
2552 pow -= 2 - (pow & 1);
2554 bc_num_extend(x0, pow);
2556 // Make sure to move the radix back.
2560 x0->rdx = digs = digs1 = 0;
2562 len = BC_NUM_INT(x0) + resrdx - 1;
2564 while (cmp != 0 || digs < len) {
2566 s = bc_num_div(a, x0, &f, resrdx);
2568 s = bc_num_add(x0, &f, &fprime, resrdx);
2570 s = bc_num_mul(&fprime, &half, x1, resrdx);
2573 cmp = bc_num_cmp(x1, x0);
2574 digs = x1->len - (unsigned long long) llabs(cmp);
2576 if (cmp == cmp2 && digs == digs1)
2581 resrdx += times > 4;
2594 if (b->rdx > scale) bc_num_truncate(b, b->rdx - scale);
2597 bc_num_free(&fprime);
2605 static BcStatus bc_num_divmod(BcNum *a, BcNum *b, BcNum *c, BcNum *d,
2611 size_t ts = BC_MAX(scale + b->rdx, a->rdx), len = BC_NUM_MREQ(a, b, ts);
2614 memcpy(&num2, c, sizeof(BcNum));
2616 bc_num_init(c, len);
2621 bc_num_expand(c, len);
2624 s = bc_num_r(ptr_a, b, c, d, scale, ts);
2626 if (init) bc_num_free(&num2);
2632 static BcStatus bc_num_modexp(BcNum *a, BcNum *b, BcNum *c, BcNum *restrict d)
2635 BcNum base, exp, two, temp;
2638 return bc_error("divide by zero");
2639 if (a->rdx || b->rdx || c->rdx)
2640 return bc_error("non integer number");
2642 return bc_error("negative number");
2644 bc_num_expand(d, c->len);
2645 bc_num_init(&base, c->len);
2646 bc_num_init(&exp, b->len);
2647 bc_num_init(&two, BC_NUM_DEF_SIZE);
2648 bc_num_init(&temp, b->len);
2654 s = bc_num_rem(a, c, &base, 0);
2656 bc_num_copy(&exp, b);
2658 while (exp.len != 0) {
2660 s = bc_num_divmod(&exp, &two, &exp, &temp, 0);
2663 if (BC_NUM_ONE(&temp)) {
2664 s = bc_num_mul(d, &base, &temp, 0);
2666 s = bc_num_rem(&temp, c, d, 0);
2670 s = bc_num_mul(&base, &base, &temp, 0);
2672 s = bc_num_rem(&temp, c, &base, 0);
2686 static BcStatus bc_func_insert(BcFunc *f, char *name, bool var)
2691 for (i = 0; i < f->autos.len; ++i) {
2692 if (strcmp(name, ((BcId *) bc_vec_item(&f->autos, i))->name) == 0)
2693 return bc_error("function parameter or auto var has the same name as another");
2699 bc_vec_push(&f->autos, &a);
2701 return BC_STATUS_SUCCESS;
2705 static void bc_func_init(BcFunc *f)
2707 bc_char_vec_init(&f->code);
2708 bc_vec_init(&f->autos, sizeof(BcId), bc_id_free);
2709 bc_vec_init(&f->labels, sizeof(size_t), NULL);
2713 static void bc_func_free(void *func)
2715 BcFunc *f = (BcFunc *) func;
2716 bc_vec_free(&f->code);
2717 bc_vec_free(&f->autos);
2718 bc_vec_free(&f->labels);
2721 static void bc_array_expand(BcVec *a, size_t len);
2723 static void bc_array_init(BcVec *a, bool nums)
2726 bc_vec_init(a, sizeof(BcNum), bc_num_free);
2728 bc_vec_init(a, sizeof(BcVec), bc_vec_free);
2729 bc_array_expand(a, 1);
2732 static void bc_array_expand(BcVec *a, size_t len)
2736 if (a->size == sizeof(BcNum) && a->dtor == bc_num_free) {
2737 while (len > a->len) {
2738 bc_num_init(&data.n, BC_NUM_DEF_SIZE);
2739 bc_vec_push(a, &data.n);
2743 while (len > a->len) {
2744 bc_array_init(&data.v, true);
2745 bc_vec_push(a, &data.v);
2750 static void bc_array_copy(BcVec *d, const BcVec *s)
2755 bc_vec_expand(d, s->cap);
2758 for (i = 0; i < s->len; ++i) {
2759 BcNum *dnum = bc_vec_item(d, i), *snum = bc_vec_item(s, i);
2760 bc_num_init(dnum, snum->len);
2761 bc_num_copy(dnum, snum);
2765 static void bc_string_free(void *string)
2767 free(*((char **) string));
2771 static void bc_result_copy(BcResult *d, BcResult *src)
2777 case BC_RESULT_TEMP:
2778 case BC_RESULT_IBASE:
2779 case BC_RESULT_SCALE:
2780 case BC_RESULT_OBASE:
2782 bc_num_init(&d->d.n, src->d.n.len);
2783 bc_num_copy(&d->d.n, &src->d.n);
2788 case BC_RESULT_ARRAY:
2789 case BC_RESULT_ARRAY_ELEM:
2791 d->d.id.name = xstrdup(src->d.id.name);
2795 case BC_RESULT_CONSTANT:
2796 case BC_RESULT_LAST:
2800 memcpy(&d->d.n, &src->d.n, sizeof(BcNum));
2807 static void bc_result_free(void *result)
2809 BcResult *r = (BcResult *) result;
2813 case BC_RESULT_TEMP:
2814 case BC_RESULT_IBASE:
2815 case BC_RESULT_SCALE:
2816 case BC_RESULT_OBASE:
2818 bc_num_free(&r->d.n);
2823 case BC_RESULT_ARRAY:
2824 case BC_RESULT_ARRAY_ELEM:
2838 static void bc_lex_lineComment(BcLex *l)
2840 l->t.t = BC_LEX_WHITESPACE;
2841 while (l->i < l->len && l->buf[l->i++] != '\n');
2845 static void bc_lex_whitespace(BcLex *l)
2848 l->t.t = BC_LEX_WHITESPACE;
2849 for (c = l->buf[l->i]; c != '\n' && isspace(c); c = l->buf[++l->i]);
2852 static BcStatus bc_lex_number(BcLex *l, char start)
2854 const char *buf = l->buf + l->i;
2855 size_t len, hits = 0, bslashes = 0, i = 0, j;
2857 bool last_pt, pt = start == '.';
2860 l->t.t = BC_LEX_NUMBER;
2862 while (c != 0 && (isdigit(c) || (c >= 'A' && c <= 'F') ||
2863 (c == '.' && !pt) || (c == '\\' && buf[i + 1] == '\n')))
2877 len = i + !last_pt - bslashes * 2;
2878 if (len > BC_MAX_NUM)
2879 return bc_error("number too long: must be [1, BC_NUM_MAX]");
2881 bc_vec_pop_all(&l->t.v);
2882 bc_vec_expand(&l->t.v, len + 1);
2883 bc_vec_push(&l->t.v, &start);
2885 for (buf -= 1, j = 1; j < len + hits * 2; ++j) {
2889 // If we have hit a backslash, skip it. We don't have
2890 // to check for a newline because it's guaranteed.
2891 if (hits < bslashes && c == '\\') {
2897 bc_vec_push(&l->t.v, &c);
2900 bc_vec_pushZeroByte(&l->t.v);
2903 return BC_STATUS_SUCCESS;
2906 static BcStatus bc_lex_name(BcLex *l)
2909 const char *buf = l->buf + l->i - 1;
2912 l->t.t = BC_LEX_NAME;
2914 while ((c >= 'a' && c <= 'z') || isdigit(c) || c == '_') c = buf[++i];
2916 if (i > BC_MAX_STRING)
2917 return bc_error("name too long: must be [1, BC_NAME_MAX]");
2918 bc_vec_string(&l->t.v, i, buf);
2920 // Increment the index. We minus 1 because it has already been incremented.
2923 return BC_STATUS_SUCCESS;
2926 static void bc_lex_init(BcLex *l, BcLexNext next)
2929 bc_char_vec_init(&l->t.v);
2932 static void bc_lex_free(BcLex *l)
2934 bc_vec_free(&l->t.v);
2937 static void bc_lex_file(BcLex *l)
2939 G.err_line = l->line = 1;
2943 static BcStatus bc_lex_next(BcLex *l)
2948 if (l->t.last == BC_LEX_EOF) return bc_error("end of file");
2950 l->line += l->newline;
2951 G.err_line = l->line;
2952 l->t.t = BC_LEX_EOF;
2954 l->newline = (l->i == l->len);
2955 if (l->newline) return BC_STATUS_SUCCESS;
2957 // Loop until failure or we don't have whitespace. This
2958 // is so the parser doesn't get inundated with whitespace.
2961 } while (!s && l->t.t == BC_LEX_WHITESPACE);
2966 static BcStatus bc_lex_text(BcLex *l, const char *text)
2970 l->len = strlen(text);
2971 l->t.t = l->t.last = BC_LEX_INVALID;
2972 return bc_lex_next(l);
2976 static BcStatus bc_lex_identifier(BcLex *l)
2980 const char *buf = l->buf + l->i - 1;
2982 for (i = 0; i < ARRAY_SIZE(bc_lex_kws); ++i) {
2983 const char *keyword8 = bc_lex_kws[i].name8;
2985 while (buf[j] != '\0' && buf[j] == keyword8[j]) {
2987 if (j == 8) goto match;
2989 if (keyword8[j] != '\0')
2992 // buf starts with keyword bc_lex_kws[i]
2993 l->t.t = BC_LEX_KEY_1st_keyword + i;
2994 if (!bc_lex_kws_POSIX(i)) {
2995 s = bc_posix_error_fmt("%sthe '%.8s' keyword", "POSIX does not allow ", bc_lex_kws[i].name8);
2999 // We minus 1 because the index has already been incremented.
3001 return BC_STATUS_SUCCESS;
3007 if (l->t.v.len > 2) {
3010 // bc: POSIX only allows one character names; the following is bad: 'qwe=1
3012 unsigned len = strchrnul(buf, '\n') - buf;
3013 s = bc_posix_error_fmt("POSIX only allows one character names; the following is bad: '%.*s'", len, buf);
3019 static BcStatus bc_lex_string(BcLex *l)
3021 size_t len, nls = 0, i = l->i;
3024 l->t.t = BC_LEX_STR;
3026 for (c = l->buf[i]; c != 0 && c != '"'; c = l->buf[++i]) nls += (c == '\n');
3030 return bc_error("string end could not be found");
3034 if (len > BC_MAX_STRING)
3035 return bc_error("string too long: must be [1, BC_STRING_MAX]");
3036 bc_vec_string(&l->t.v, len, l->buf + l->i);
3040 G.err_line = l->line;
3042 return BC_STATUS_SUCCESS;
3045 static void bc_lex_assign(BcLex *l, BcLexType with, BcLexType without)
3047 if (l->buf[l->i] == '=') {
3055 static BcStatus bc_lex_comment(BcLex *l)
3058 const char *buf = l->buf;
3060 l->t.t = BC_LEX_WHITESPACE;
3073 return bc_error("comment end could not be found");
3081 G.err_line = l->line;
3083 return BC_STATUS_SUCCESS;
3086 static BcStatus bc_lex_token(BcLex *l)
3088 BcStatus s = BC_STATUS_SUCCESS;
3089 char c = l->buf[l->i++], c2;
3091 // This is the workhorse of the lexer.
3098 l->t.t = !c ? BC_LEX_EOF : BC_LEX_NLINE;
3108 bc_lex_whitespace(l);
3114 bc_lex_assign(l, BC_LEX_OP_REL_NE, BC_LEX_OP_BOOL_NOT);
3116 if (l->t.t == BC_LEX_OP_BOOL_NOT) {
3117 s = bc_POSIX_does_not_allow_bool_ops_this_is_bad("!");
3126 s = bc_lex_string(l);
3132 s = bc_POSIX_does_not_allow("'#' script comments");
3135 bc_lex_lineComment(l);
3142 bc_lex_assign(l, BC_LEX_OP_ASSIGN_MODULUS, BC_LEX_OP_MODULUS);
3151 s = bc_POSIX_does_not_allow_bool_ops_this_is_bad("&&");
3155 l->t.t = BC_LEX_OP_BOOL_AND;
3158 l->t.t = BC_LEX_INVALID;
3159 s = bc_error_bad_character('&');
3168 l->t.t = (BcLexType)(c - '(' + BC_LEX_LPAREN);
3174 bc_lex_assign(l, BC_LEX_OP_ASSIGN_MULTIPLY, BC_LEX_OP_MULTIPLY);
3183 l->t.t = BC_LEX_OP_INC;
3186 bc_lex_assign(l, BC_LEX_OP_ASSIGN_PLUS, BC_LEX_OP_PLUS);
3192 l->t.t = BC_LEX_COMMA;
3201 l->t.t = BC_LEX_OP_DEC;
3204 bc_lex_assign(l, BC_LEX_OP_ASSIGN_MINUS, BC_LEX_OP_MINUS);
3210 if (isdigit(l->buf[l->i]))
3211 s = bc_lex_number(l, c);
3213 l->t.t = BC_LEX_KEY_LAST;
3214 s = bc_POSIX_does_not_allow("a period ('.') as a shortcut for the last result");
3223 s = bc_lex_comment(l);
3225 bc_lex_assign(l, BC_LEX_OP_ASSIGN_DIVIDE, BC_LEX_OP_DIVIDE);
3246 s = bc_lex_number(l, c);
3252 l->t.t = BC_LEX_SCOLON;
3258 bc_lex_assign(l, BC_LEX_OP_REL_LE, BC_LEX_OP_REL_LT);
3264 bc_lex_assign(l, BC_LEX_OP_REL_EQ, BC_LEX_OP_ASSIGN);
3270 bc_lex_assign(l, BC_LEX_OP_REL_GE, BC_LEX_OP_REL_GT);
3277 l->t.t = (BcLexType)(c - '[' + BC_LEX_LBRACKET);
3283 if (l->buf[l->i] == '\n') {
3284 l->t.t = BC_LEX_WHITESPACE;
3288 s = bc_error_bad_character(c);
3294 bc_lex_assign(l, BC_LEX_OP_ASSIGN_POWER, BC_LEX_OP_POWER);
3325 s = bc_lex_identifier(l);
3332 l->t.t = (BcLexType)(c - '{' + BC_LEX_LBRACE);
3341 s = bc_POSIX_does_not_allow_bool_ops_this_is_bad("||");
3345 l->t.t = BC_LEX_OP_BOOL_OR;
3348 l->t.t = BC_LEX_INVALID;
3349 s = bc_error_bad_character(c);
3357 l->t.t = BC_LEX_INVALID;
3358 s = bc_error_bad_character(c);
3368 static BcStatus dc_lex_register(BcLex *l)
3370 BcStatus s = BC_STATUS_SUCCESS;
3372 if (isspace(l->buf[l->i - 1])) {
3373 bc_lex_whitespace(l);
3376 s = bc_error("extended register");
3381 bc_vec_pop_all(&l->t.v);
3382 bc_vec_push(&l->t.v, &l->buf[l->i - 1]);
3383 bc_vec_pushZeroByte(&l->t.v);
3384 l->t.t = BC_LEX_NAME;
3390 static BcStatus dc_lex_string(BcLex *l)
3392 size_t depth = 1, nls = 0, i = l->i;
3395 l->t.t = BC_LEX_STR;
3396 bc_vec_pop_all(&l->t.v);
3398 for (c = l->buf[i]; c != 0 && depth; c = l->buf[++i]) {
3400 depth += (c == '[' && (i == l->i || l->buf[i - 1] != '\\'));
3401 depth -= (c == ']' && (i == l->i || l->buf[i - 1] != '\\'));
3404 if (depth) bc_vec_push(&l->t.v, &c);
3409 return bc_error("string end could not be found");
3412 bc_vec_pushZeroByte(&l->t.v);
3413 if (i - l->i > BC_MAX_STRING)
3414 return bc_error("string too long: must be [1, BC_STRING_MAX]");
3418 G.err_line = l->line;
3420 return BC_STATUS_SUCCESS;
3423 static BcStatus dc_lex_token(BcLex *l)
3425 BcStatus s = BC_STATUS_SUCCESS;
3426 char c = l->buf[l->i++], c2;
3429 for (i = 0; i < ARRAY_SIZE(dc_lex_regs); ++i) {
3430 if (l->t.last == dc_lex_regs[i])
3431 return dc_lex_register(l);
3434 if (c >= '%' && c <= '~' &&
3435 (l->t.t = dc_lex_tokens[(c - '%')]) != BC_LEX_INVALID)
3440 // This is the workhorse of the lexer.
3445 l->t.t = BC_LEX_EOF;
3456 l->newline = (c == '\n');
3457 bc_lex_whitespace(l);
3466 l->t.t = BC_LEX_OP_REL_NE;
3468 l->t.t = BC_LEX_OP_REL_LE;
3470 l->t.t = BC_LEX_OP_REL_GE;
3472 return bc_error_bad_character(c);
3480 bc_lex_lineComment(l);
3486 if (isdigit(l->buf[l->i]))
3487 s = bc_lex_number(l, c);
3489 s = bc_error_bad_character(c);
3510 s = bc_lex_number(l, c);
3516 s = dc_lex_string(l);
3522 l->t.t = BC_LEX_INVALID;
3523 s = bc_error_bad_character(c);
3532 static void bc_program_addFunc(char *name, size_t *idx);
3534 static void bc_parse_addFunc(BcParse *p, char *name, size_t *idx)
3536 bc_program_addFunc(name, idx);
3537 p->func = bc_vec_item(&G.prog.fns, p->fidx);
3540 #define bc_parse_push(p, i) bc_vec_pushByte(&(p)->func->code, (char) (i))
3542 static void bc_parse_pushName(BcParse *p, char *name)
3544 size_t i = 0, len = strlen(name);
3546 for (; i < len; ++i) bc_parse_push(p, name[i]);
3547 bc_parse_push(p, BC_PARSE_STREND);
3552 static void bc_parse_pushIndex(BcParse *p, size_t idx)
3554 unsigned char amt, i, nums[sizeof(size_t)];
3556 for (amt = 0; idx; ++amt) {
3557 nums[amt] = (char) idx;
3558 idx = (idx & ((unsigned long) ~(UCHAR_MAX))) >> sizeof(char) * CHAR_BIT;
3561 bc_parse_push(p, amt);
3562 for (i = 0; i < amt; ++i) bc_parse_push(p, nums[i]);
3565 static void bc_parse_number(BcParse *p, BcInst *prev, size_t *nexs)
3567 char *num = xstrdup(p->l.t.v.v);
3568 size_t idx = G.prog.consts.len;
3570 bc_vec_push(&G.prog.consts, &num);
3572 bc_parse_push(p, BC_INST_NUM);
3573 bc_parse_pushIndex(p, idx);
3576 (*prev) = BC_INST_NUM;
3579 static BcStatus bc_parse_text(BcParse *p, const char *text)
3583 p->func = bc_vec_item(&G.prog.fns, p->fidx);
3585 if (!text[0] && !BC_PARSE_CAN_EXEC(p)) {
3586 p->l.t.t = BC_LEX_INVALID;
3589 if (!BC_PARSE_CAN_EXEC(p))
3590 return bc_error("file is not executable");
3593 return bc_lex_text(&p->l, text);
3596 // Called when parsing or execution detects a failure,
3597 // resets execution structures.
3598 static void bc_program_reset(void)
3603 bc_vec_npop(&G.prog.stack, G.prog.stack.len - 1);
3604 bc_vec_pop_all(&G.prog.results);
3606 f = bc_vec_item(&G.prog.fns, 0);
3607 ip = bc_vec_top(&G.prog.stack);
3608 ip->idx = f->code.len;
3611 #define bc_parse_updateFunc(p, f) \
3612 ((p)->func = bc_vec_item(&G.prog.fns, ((p)->fidx = (f))))
3614 // Called when bc/dc_parse_parse() detects a failure,
3615 // resets parsing structures.
3616 static void bc_parse_reset(BcParse *p)
3618 if (p->fidx != BC_PROG_MAIN) {
3619 p->func->nparams = 0;
3620 bc_vec_pop_all(&p->func->code);
3621 bc_vec_pop_all(&p->func->autos);
3622 bc_vec_pop_all(&p->func->labels);
3624 bc_parse_updateFunc(p, BC_PROG_MAIN);
3628 p->l.t.t = BC_LEX_EOF;
3629 p->auto_part = (p->nbraces = 0);
3631 bc_vec_npop(&p->flags, p->flags.len - 1);
3632 bc_vec_pop_all(&p->exits);
3633 bc_vec_pop_all(&p->conds);
3634 bc_vec_pop_all(&p->ops);
3639 static void bc_parse_free(BcParse *p)
3641 bc_vec_free(&p->flags);
3642 bc_vec_free(&p->exits);
3643 bc_vec_free(&p->conds);
3644 bc_vec_free(&p->ops);
3648 static void bc_parse_create(BcParse *p, size_t func,
3649 BcParseParse parse, BcLexNext next)
3651 memset(p, 0, sizeof(BcParse));
3653 bc_lex_init(&p->l, next);
3654 bc_vec_init(&p->flags, sizeof(uint8_t), NULL);
3655 bc_vec_init(&p->exits, sizeof(BcInstPtr), NULL);
3656 bc_vec_init(&p->conds, sizeof(size_t), NULL);
3657 bc_vec_pushZeroByte(&p->flags);
3658 bc_vec_init(&p->ops, sizeof(BcLexType), NULL);
3661 // p->auto_part = p->nbraces = 0; - already is
3662 bc_parse_updateFunc(p, func);
3667 #define BC_PARSE_TOP_OP(p) (*((BcLexType *) bc_vec_top(&(p)->ops)))
3668 #define BC_PARSE_LEAF(p, rparen) \
3669 (((p) >= BC_INST_NUM && (p) <= BC_INST_SQRT) || (rparen) || \
3670 (p) == BC_INST_INC_POST || (p) == BC_INST_DEC_POST)
3672 // We can calculate the conversion between tokens and exprs by subtracting the
3673 // position of the first operator in the lex enum and adding the position of the
3674 // first in the expr enum. Note: This only works for binary operators.
3675 #define BC_PARSE_TOKEN_INST(t) ((char) ((t) -BC_LEX_NEG + BC_INST_NEG))
3677 static BcStatus bc_parse_else(BcParse *p);
3678 static BcStatus bc_parse_stmt(BcParse *p);
3679 static BcStatus bc_parse_expr(BcParse *p, uint8_t flags, BcParseNext next);
3680 static BcStatus bc_parse_expr_empty_ok(BcParse *p, uint8_t flags, BcParseNext next);
3682 static BcStatus bc_parse_operator(BcParse *p, BcLexType type, size_t start,
3683 size_t *nexprs, bool next)
3685 BcStatus s = BC_STATUS_SUCCESS;
3687 char l, r = bc_parse_op_PREC(type - BC_LEX_OP_INC);
3688 bool left = bc_parse_op_LEFT(type - BC_LEX_OP_INC);
3690 while (p->ops.len > start) {
3692 t = BC_PARSE_TOP_OP(p);
3693 if (t == BC_LEX_LPAREN) break;
3695 l = bc_parse_op_PREC(t - BC_LEX_OP_INC);
3696 if (l >= r && (l != r || !left)) break;
3698 bc_parse_push(p, BC_PARSE_TOKEN_INST(t));
3699 bc_vec_pop(&p->ops);
3700 *nexprs -= t != BC_LEX_OP_BOOL_NOT && t != BC_LEX_NEG;
3703 bc_vec_push(&p->ops, &type);
3704 if (next) s = bc_lex_next(&p->l);
3709 static BcStatus bc_parse_rightParen(BcParse *p, size_t ops_bgn, size_t *nexs)
3713 if (p->ops.len <= ops_bgn)
3714 return bc_error_bad_expression();
3715 top = BC_PARSE_TOP_OP(p);
3717 while (top != BC_LEX_LPAREN) {
3719 bc_parse_push(p, BC_PARSE_TOKEN_INST(top));
3721 bc_vec_pop(&p->ops);
3722 *nexs -= top != BC_LEX_OP_BOOL_NOT && top != BC_LEX_NEG;
3724 if (p->ops.len <= ops_bgn)
3725 return bc_error_bad_expression();
3726 top = BC_PARSE_TOP_OP(p);
3729 bc_vec_pop(&p->ops);
3731 return bc_lex_next(&p->l);
3734 static BcStatus bc_parse_params(BcParse *p, uint8_t flags)
3740 s = bc_lex_next(&p->l);
3743 for (nparams = 0; p->l.t.t != BC_LEX_RPAREN; ++nparams) {
3745 flags = (flags & ~(BC_PARSE_PRINT | BC_PARSE_REL)) | BC_PARSE_ARRAY;
3746 s = bc_parse_expr(p, flags, bc_parse_next_param);
3749 comma = p->l.t.t == BC_LEX_COMMA;
3751 s = bc_lex_next(&p->l);
3756 if (comma) return bc_error_bad_token();
3757 bc_parse_push(p, BC_INST_CALL);
3758 bc_parse_pushIndex(p, nparams);
3760 return BC_STATUS_SUCCESS;
3763 static BcStatus bc_parse_call(BcParse *p, char *name, uint8_t flags)
3766 BcId entry, *entry_ptr;
3771 s = bc_parse_params(p, flags);
3774 if (p->l.t.t != BC_LEX_RPAREN) {
3775 s = bc_error_bad_token();
3779 idx = bc_map_index(&G.prog.fn_map, &entry);
3781 if (idx == BC_VEC_INVALID_IDX) {
3782 name = xstrdup(entry.name);
3783 bc_parse_addFunc(p, name, &idx);
3784 idx = bc_map_index(&G.prog.fn_map, &entry);
3790 entry_ptr = bc_vec_item(&G.prog.fn_map, idx);
3791 bc_parse_pushIndex(p, entry_ptr->idx);
3793 return bc_lex_next(&p->l);
3800 static BcStatus bc_parse_name(BcParse *p, BcInst *type, uint8_t flags)
3805 name = xstrdup(p->l.t.v.v);
3806 s = bc_lex_next(&p->l);
3809 if (p->l.t.t == BC_LEX_LBRACKET) {
3811 s = bc_lex_next(&p->l);
3814 if (p->l.t.t == BC_LEX_RBRACKET) {
3816 if (!(flags & BC_PARSE_ARRAY)) {
3817 s = bc_error_bad_expression();
3821 *type = BC_INST_ARRAY;
3825 *type = BC_INST_ARRAY_ELEM;
3827 flags &= ~(BC_PARSE_PRINT | BC_PARSE_REL);
3828 s = bc_parse_expr(p, flags, bc_parse_next_elem);
3832 s = bc_lex_next(&p->l);
3834 bc_parse_push(p, *type);
3835 bc_parse_pushName(p, name);
3837 else if (p->l.t.t == BC_LEX_LPAREN) {
3839 if (flags & BC_PARSE_NOCALL) {
3840 s = bc_error_bad_token();
3844 *type = BC_INST_CALL;
3845 s = bc_parse_call(p, name, flags);
3848 *type = BC_INST_VAR;
3849 bc_parse_push(p, BC_INST_VAR);
3850 bc_parse_pushName(p, name);
3860 static BcStatus bc_parse_read(BcParse *p)
3864 s = bc_lex_next(&p->l);
3866 if (p->l.t.t != BC_LEX_LPAREN) return bc_error_bad_token();
3868 s = bc_lex_next(&p->l);
3870 if (p->l.t.t != BC_LEX_RPAREN) return bc_error_bad_token();
3872 bc_parse_push(p, BC_INST_READ);
3874 return bc_lex_next(&p->l);
3877 static BcStatus bc_parse_builtin(BcParse *p, BcLexType type, uint8_t flags,
3882 s = bc_lex_next(&p->l);
3884 if (p->l.t.t != BC_LEX_LPAREN) return bc_error_bad_token();
3886 flags = (flags & ~(BC_PARSE_PRINT | BC_PARSE_REL)) | BC_PARSE_ARRAY;
3888 s = bc_lex_next(&p->l);
3891 s = bc_parse_expr(p, flags, bc_parse_next_rel);
3894 if (p->l.t.t != BC_LEX_RPAREN) return bc_error_bad_token();
3896 *prev = (type == BC_LEX_KEY_LENGTH) ? BC_INST_LENGTH : BC_INST_SQRT;
3897 bc_parse_push(p, *prev);
3899 return bc_lex_next(&p->l);
3902 static BcStatus bc_parse_scale(BcParse *p, BcInst *type, uint8_t flags)
3906 s = bc_lex_next(&p->l);
3909 if (p->l.t.t != BC_LEX_LPAREN) {
3910 *type = BC_INST_SCALE;
3911 bc_parse_push(p, BC_INST_SCALE);
3912 return BC_STATUS_SUCCESS;
3915 *type = BC_INST_SCALE_FUNC;
3916 flags &= ~(BC_PARSE_PRINT | BC_PARSE_REL);
3918 s = bc_lex_next(&p->l);
3921 s = bc_parse_expr(p, flags, bc_parse_next_rel);
3923 if (p->l.t.t != BC_LEX_RPAREN) return bc_error_bad_token();
3924 bc_parse_push(p, BC_INST_SCALE_FUNC);
3926 return bc_lex_next(&p->l);
3929 static BcStatus bc_parse_incdec(BcParse *p, BcInst *prev, bool *paren_expr,
3930 size_t *nexprs, uint8_t flags)
3935 BcInst etype = *prev;
3937 if (etype == BC_INST_VAR || etype == BC_INST_ARRAY_ELEM ||
3938 etype == BC_INST_SCALE || etype == BC_INST_LAST ||
3939 etype == BC_INST_IBASE || etype == BC_INST_OBASE)
3941 *prev = inst = BC_INST_INC_POST + (p->l.t.t != BC_LEX_OP_INC);
3942 bc_parse_push(p, inst);
3943 s = bc_lex_next(&p->l);
3947 *prev = inst = BC_INST_INC_PRE + (p->l.t.t != BC_LEX_OP_INC);
3950 s = bc_lex_next(&p->l);
3954 // Because we parse the next part of the expression
3955 // right here, we need to increment this.
3956 *nexprs = *nexprs + 1;
3962 s = bc_parse_name(p, prev, flags | BC_PARSE_NOCALL);
3966 case BC_LEX_KEY_IBASE:
3967 case BC_LEX_KEY_LAST:
3968 case BC_LEX_KEY_OBASE:
3970 bc_parse_push(p, type - BC_LEX_KEY_IBASE + BC_INST_IBASE);
3971 s = bc_lex_next(&p->l);
3975 case BC_LEX_KEY_SCALE:
3977 s = bc_lex_next(&p->l);
3979 if (p->l.t.t == BC_LEX_LPAREN)
3980 s = bc_error_bad_token();
3982 bc_parse_push(p, BC_INST_SCALE);
3988 s = bc_error_bad_token();
3993 if (!s) bc_parse_push(p, inst);
3999 static BcStatus bc_parse_minus(BcParse *p, BcInst *prev, size_t ops_bgn,
4000 bool rparen, size_t *nexprs)
4004 BcInst etype = *prev;
4006 s = bc_lex_next(&p->l);
4009 type = rparen || etype == BC_INST_INC_POST || etype == BC_INST_DEC_POST ||
4010 (etype >= BC_INST_NUM && etype <= BC_INST_SQRT) ?
4013 *prev = BC_PARSE_TOKEN_INST(type);
4015 // We can just push onto the op stack because this is the largest
4016 // precedence operator that gets pushed. Inc/dec does not.
4017 if (type != BC_LEX_OP_MINUS)
4018 bc_vec_push(&p->ops, &type);
4020 s = bc_parse_operator(p, type, ops_bgn, nexprs, false);
4025 static BcStatus bc_parse_string(BcParse *p, char inst)
4027 char *str = xstrdup(p->l.t.v.v);
4029 bc_parse_push(p, BC_INST_STR);
4030 bc_parse_pushIndex(p, G.prog.strs.len);
4031 bc_vec_push(&G.prog.strs, &str);
4032 bc_parse_push(p, inst);
4034 return bc_lex_next(&p->l);
4037 static BcStatus bc_parse_print(BcParse *p)
4043 s = bc_lex_next(&p->l);
4048 if (type == BC_LEX_SCOLON || type == BC_LEX_NLINE)
4049 return bc_error("bad print statement");
4051 while (!s && type != BC_LEX_SCOLON && type != BC_LEX_NLINE) {
4053 if (type == BC_LEX_STR)
4054 s = bc_parse_string(p, BC_INST_PRINT_POP);
4056 s = bc_parse_expr(p, 0, bc_parse_next_print);
4058 bc_parse_push(p, BC_INST_PRINT_POP);
4063 comma = p->l.t.t == BC_LEX_COMMA;
4064 if (comma) s = bc_lex_next(&p->l);
4069 if (comma) return bc_error_bad_token();
4071 return bc_lex_next(&p->l);
4074 static BcStatus bc_parse_return(BcParse *p)
4080 if (!BC_PARSE_FUNC(p)) return bc_error_bad_token();
4082 s = bc_lex_next(&p->l);
4086 paren = t == BC_LEX_LPAREN;
4088 if (t == BC_LEX_NLINE || t == BC_LEX_SCOLON)
4089 bc_parse_push(p, BC_INST_RET0);
4092 s = bc_parse_expr_empty_ok(p, 0, bc_parse_next_expr);
4093 if (s == BC_STATUS_PARSE_EMPTY_EXP) {
4094 bc_parse_push(p, BC_INST_RET0);
4095 s = bc_lex_next(&p->l);
4099 if (!paren || p->l.t.last != BC_LEX_RPAREN) {
4100 s = bc_POSIX_requires("parentheses around return expressions");
4104 bc_parse_push(p, BC_INST_RET);
4110 static BcStatus bc_parse_endBody(BcParse *p, bool brace)
4112 BcStatus s = BC_STATUS_SUCCESS;
4114 if (p->flags.len <= 1 || (brace && p->nbraces == 0))
4115 return bc_error_bad_token();
4119 if (p->l.t.t == BC_LEX_RBRACE) {
4120 if (!p->nbraces) return bc_error_bad_token();
4122 s = bc_lex_next(&p->l);
4126 return bc_error_bad_token();
4129 if (BC_PARSE_IF(p)) {
4133 while (p->l.t.t == BC_LEX_NLINE) {
4134 s = bc_lex_next(&p->l);
4138 bc_vec_pop(&p->flags);
4140 flag_ptr = BC_PARSE_TOP_FLAG_PTR(p);
4141 *flag_ptr = (*flag_ptr | BC_PARSE_FLAG_IF_END);
4143 if (p->l.t.t == BC_LEX_KEY_ELSE) s = bc_parse_else(p);
4145 else if (BC_PARSE_ELSE(p)) {
4150 bc_vec_pop(&p->flags);
4152 ip = bc_vec_top(&p->exits);
4153 label = bc_vec_item(&p->func->labels, ip->idx);
4154 *label = p->func->code.len;
4156 bc_vec_pop(&p->exits);
4158 else if (BC_PARSE_FUNC_INNER(p)) {
4159 bc_parse_push(p, BC_INST_RET0);
4160 bc_parse_updateFunc(p, BC_PROG_MAIN);
4161 bc_vec_pop(&p->flags);
4165 BcInstPtr *ip = bc_vec_top(&p->exits);
4166 size_t *label = bc_vec_top(&p->conds);
4168 bc_parse_push(p, BC_INST_JUMP);
4169 bc_parse_pushIndex(p, *label);
4171 label = bc_vec_item(&p->func->labels, ip->idx);
4172 *label = p->func->code.len;
4174 bc_vec_pop(&p->flags);
4175 bc_vec_pop(&p->exits);
4176 bc_vec_pop(&p->conds);
4182 static void bc_parse_startBody(BcParse *p, uint8_t flags)
4184 uint8_t *flag_ptr = BC_PARSE_TOP_FLAG_PTR(p);
4185 flags |= (*flag_ptr & (BC_PARSE_FLAG_FUNC | BC_PARSE_FLAG_LOOP));
4186 flags |= BC_PARSE_FLAG_BODY;
4187 bc_vec_push(&p->flags, &flags);
4190 static void bc_parse_noElse(BcParse *p)
4194 uint8_t *flag_ptr = BC_PARSE_TOP_FLAG_PTR(p);
4196 *flag_ptr = (*flag_ptr & ~(BC_PARSE_FLAG_IF_END));
4198 ip = bc_vec_top(&p->exits);
4199 label = bc_vec_item(&p->func->labels, ip->idx);
4200 *label = p->func->code.len;
4202 bc_vec_pop(&p->exits);
4205 static BcStatus bc_parse_if(BcParse *p)
4210 s = bc_lex_next(&p->l);
4212 if (p->l.t.t != BC_LEX_LPAREN) return bc_error_bad_token();
4214 s = bc_lex_next(&p->l);
4216 s = bc_parse_expr(p, BC_PARSE_REL, bc_parse_next_rel);
4218 if (p->l.t.t != BC_LEX_RPAREN) return bc_error_bad_token();
4220 s = bc_lex_next(&p->l);
4222 bc_parse_push(p, BC_INST_JUMP_ZERO);
4224 ip.idx = p->func->labels.len;
4225 ip.func = ip.len = 0;
4227 bc_parse_pushIndex(p, ip.idx);
4228 bc_vec_push(&p->exits, &ip);
4229 bc_vec_push(&p->func->labels, &ip.idx);
4230 bc_parse_startBody(p, BC_PARSE_FLAG_IF);
4232 return BC_STATUS_SUCCESS;
4235 static BcStatus bc_parse_else(BcParse *p)
4239 if (!BC_PARSE_IF_END(p)) return bc_error_bad_token();
4241 ip.idx = p->func->labels.len;
4242 ip.func = ip.len = 0;
4244 bc_parse_push(p, BC_INST_JUMP);
4245 bc_parse_pushIndex(p, ip.idx);
4249 bc_vec_push(&p->exits, &ip);
4250 bc_vec_push(&p->func->labels, &ip.idx);
4251 bc_parse_startBody(p, BC_PARSE_FLAG_ELSE);
4253 return bc_lex_next(&p->l);
4256 static BcStatus bc_parse_while(BcParse *p)
4261 s = bc_lex_next(&p->l);
4263 if (p->l.t.t != BC_LEX_LPAREN) return bc_error_bad_token();
4264 s = bc_lex_next(&p->l);
4267 ip.idx = p->func->labels.len;
4269 bc_vec_push(&p->func->labels, &p->func->code.len);
4270 bc_vec_push(&p->conds, &ip.idx);
4272 ip.idx = p->func->labels.len;
4276 bc_vec_push(&p->exits, &ip);
4277 bc_vec_push(&p->func->labels, &ip.idx);
4279 s = bc_parse_expr(p, BC_PARSE_REL, bc_parse_next_rel);
4281 if (p->l.t.t != BC_LEX_RPAREN) return bc_error_bad_token();
4282 s = bc_lex_next(&p->l);
4285 bc_parse_push(p, BC_INST_JUMP_ZERO);
4286 bc_parse_pushIndex(p, ip.idx);
4287 bc_parse_startBody(p, BC_PARSE_FLAG_LOOP | BC_PARSE_FLAG_LOOP_INNER);
4289 return BC_STATUS_SUCCESS;
4292 static BcStatus bc_parse_for(BcParse *p)
4296 size_t cond_idx, exit_idx, body_idx, update_idx;
4298 s = bc_lex_next(&p->l);
4300 if (p->l.t.t != BC_LEX_LPAREN) return bc_error_bad_token();
4301 s = bc_lex_next(&p->l);
4304 if (p->l.t.t != BC_LEX_SCOLON)
4305 s = bc_parse_expr(p, 0, bc_parse_next_for);
4307 s = bc_POSIX_does_not_allow_empty_X_expression_in_for("init");
4310 if (p->l.t.t != BC_LEX_SCOLON) return bc_error_bad_token();
4311 s = bc_lex_next(&p->l);
4314 cond_idx = p->func->labels.len;
4315 update_idx = cond_idx + 1;
4316 body_idx = update_idx + 1;
4317 exit_idx = body_idx + 1;
4319 bc_vec_push(&p->func->labels, &p->func->code.len);
4321 if (p->l.t.t != BC_LEX_SCOLON)
4322 s = bc_parse_expr(p, BC_PARSE_REL, bc_parse_next_for);
4324 s = bc_POSIX_does_not_allow_empty_X_expression_in_for("condition");
4327 if (p->l.t.t != BC_LEX_SCOLON) return bc_error_bad_token();
4329 s = bc_lex_next(&p->l);
4332 bc_parse_push(p, BC_INST_JUMP_ZERO);
4333 bc_parse_pushIndex(p, exit_idx);
4334 bc_parse_push(p, BC_INST_JUMP);
4335 bc_parse_pushIndex(p, body_idx);
4337 ip.idx = p->func->labels.len;
4339 bc_vec_push(&p->conds, &update_idx);
4340 bc_vec_push(&p->func->labels, &p->func->code.len);
4342 if (p->l.t.t != BC_LEX_RPAREN)
4343 s = bc_parse_expr(p, 0, bc_parse_next_rel);
4345 s = bc_POSIX_does_not_allow_empty_X_expression_in_for("update");
4349 if (p->l.t.t != BC_LEX_RPAREN) return bc_error_bad_token();
4350 bc_parse_push(p, BC_INST_JUMP);
4351 bc_parse_pushIndex(p, cond_idx);
4352 bc_vec_push(&p->func->labels, &p->func->code.len);
4358 bc_vec_push(&p->exits, &ip);
4359 bc_vec_push(&p->func->labels, &ip.idx);
4361 bc_parse_startBody(p, BC_PARSE_FLAG_LOOP | BC_PARSE_FLAG_LOOP_INNER);
4363 return BC_STATUS_SUCCESS;
4366 static BcStatus bc_parse_loopExit(BcParse *p, BcLexType type)
4372 if (!BC_PARSE_LOOP(p)) return bc_error_bad_token();
4374 if (type == BC_LEX_KEY_BREAK) {
4376 if (p->exits.len == 0) return bc_error_bad_token();
4378 i = p->exits.len - 1;
4379 ip = bc_vec_item(&p->exits, i);
4381 while (!ip->func && i < p->exits.len) ip = bc_vec_item(&p->exits, i--);
4382 if (i >= p->exits.len && !ip->func) return bc_error_bad_token();
4387 i = *((size_t *) bc_vec_top(&p->conds));
4389 bc_parse_push(p, BC_INST_JUMP);
4390 bc_parse_pushIndex(p, i);
4392 s = bc_lex_next(&p->l);
4395 if (p->l.t.t != BC_LEX_SCOLON && p->l.t.t != BC_LEX_NLINE)
4396 return bc_error_bad_token();
4398 return bc_lex_next(&p->l);
4401 static BcStatus bc_parse_func(BcParse *p)
4404 bool var, comma = false;
4408 s = bc_lex_next(&p->l);
4410 if (p->l.t.t != BC_LEX_NAME)
4411 return bc_error("bad function definition");
4413 name = xstrdup(p->l.t.v.v);
4414 bc_parse_addFunc(p, name, &p->fidx);
4416 s = bc_lex_next(&p->l);
4418 if (p->l.t.t != BC_LEX_LPAREN)
4419 return bc_error("bad function definition");
4420 s = bc_lex_next(&p->l);
4423 while (p->l.t.t != BC_LEX_RPAREN) {
4425 if (p->l.t.t != BC_LEX_NAME)
4426 return bc_error("bad function definition");
4430 name = xstrdup(p->l.t.v.v);
4431 s = bc_lex_next(&p->l);
4434 var = p->l.t.t != BC_LEX_LBRACKET;
4438 s = bc_lex_next(&p->l);
4441 if (p->l.t.t != BC_LEX_RBRACKET) {
4442 s = bc_error("bad function definition");
4446 s = bc_lex_next(&p->l);
4450 comma = p->l.t.t == BC_LEX_COMMA;
4452 s = bc_lex_next(&p->l);
4456 s = bc_func_insert(p->func, name, var);
4460 if (comma) return bc_error("bad function definition");
4462 flags = BC_PARSE_FLAG_FUNC | BC_PARSE_FLAG_FUNC_INNER | BC_PARSE_FLAG_BODY;
4463 bc_parse_startBody(p, flags);
4465 s = bc_lex_next(&p->l);
4468 if (p->l.t.t != BC_LEX_LBRACE)
4469 s = bc_POSIX_requires("the left brace be on the same line as the function header");
4478 static BcStatus bc_parse_auto(BcParse *p)
4481 bool comma, var, one;
4484 if (!p->auto_part) return bc_error_bad_token();
4485 s = bc_lex_next(&p->l);
4488 p->auto_part = comma = false;
4489 one = p->l.t.t == BC_LEX_NAME;
4491 while (p->l.t.t == BC_LEX_NAME) {
4493 name = xstrdup(p->l.t.v.v);
4494 s = bc_lex_next(&p->l);
4497 var = p->l.t.t != BC_LEX_LBRACKET;
4500 s = bc_lex_next(&p->l);
4503 if (p->l.t.t != BC_LEX_RBRACKET) {
4504 s = bc_error("bad function definition");
4508 s = bc_lex_next(&p->l);
4512 comma = p->l.t.t == BC_LEX_COMMA;
4514 s = bc_lex_next(&p->l);
4518 s = bc_func_insert(p->func, name, var);
4522 if (comma) return bc_error("bad function definition");
4523 if (!one) return bc_error("no auto variable found");
4525 if (p->l.t.t != BC_LEX_NLINE && p->l.t.t != BC_LEX_SCOLON)
4526 return bc_error_bad_token();
4528 return bc_lex_next(&p->l);
4535 static BcStatus bc_parse_body(BcParse *p, bool brace)
4537 BcStatus s = BC_STATUS_SUCCESS;
4538 uint8_t *flag_ptr = bc_vec_top(&p->flags);
4540 *flag_ptr &= ~(BC_PARSE_FLAG_BODY);
4542 if (*flag_ptr & BC_PARSE_FLAG_FUNC_INNER) {
4544 if (!brace) return bc_error_bad_token();
4545 p->auto_part = p->l.t.t != BC_LEX_KEY_AUTO;
4547 if (!p->auto_part) {
4548 s = bc_parse_auto(p);
4552 if (p->l.t.t == BC_LEX_NLINE) s = bc_lex_next(&p->l);
4555 s = bc_parse_stmt(p);
4556 if (!s && !brace) s = bc_parse_endBody(p, false);
4562 static BcStatus bc_parse_stmt(BcParse *p)
4564 BcStatus s = BC_STATUS_SUCCESS;
4570 return bc_lex_next(&p->l);
4573 case BC_LEX_KEY_ELSE:
4575 p->auto_part = false;
4581 if (!BC_PARSE_BODY(p)) return bc_error_bad_token();
4584 s = bc_lex_next(&p->l);
4587 return bc_parse_body(p, true);
4590 case BC_LEX_KEY_AUTO:
4592 return bc_parse_auto(p);
4597 p->auto_part = false;
4599 if (BC_PARSE_IF_END(p)) {
4601 return BC_STATUS_SUCCESS;
4603 else if (BC_PARSE_BODY(p))
4604 return bc_parse_body(p, false);
4614 case BC_LEX_OP_MINUS:
4615 case BC_LEX_OP_BOOL_NOT:
4619 case BC_LEX_KEY_IBASE:
4620 case BC_LEX_KEY_LAST:
4621 case BC_LEX_KEY_LENGTH:
4622 case BC_LEX_KEY_OBASE:
4623 case BC_LEX_KEY_READ:
4624 case BC_LEX_KEY_SCALE:
4625 case BC_LEX_KEY_SQRT:
4627 s = bc_parse_expr(p, BC_PARSE_PRINT, bc_parse_next_expr);
4631 case BC_LEX_KEY_ELSE:
4633 s = bc_parse_else(p);
4639 while (!s && p->l.t.t == BC_LEX_SCOLON) s = bc_lex_next(&p->l);
4645 s = bc_parse_endBody(p, true);
4651 s = bc_parse_string(p, BC_INST_PRINT_STR);
4655 case BC_LEX_KEY_BREAK:
4656 case BC_LEX_KEY_CONTINUE:
4658 s = bc_parse_loopExit(p, p->l.t.t);
4662 case BC_LEX_KEY_FOR:
4664 s = bc_parse_for(p);
4668 case BC_LEX_KEY_HALT:
4670 bc_parse_push(p, BC_INST_HALT);
4671 s = bc_lex_next(&p->l);
4681 case BC_LEX_KEY_LIMITS:
4683 // "limits" is a compile-time command,
4684 // the output is produced at _parse time_.
4685 s = bc_lex_next(&p->l);
4687 printf("BC_BASE_MAX = %u\n", BC_MAX_OBASE);
4688 printf("BC_DIM_MAX = %u\n", BC_MAX_DIM);
4689 printf("BC_SCALE_MAX = %u\n", BC_MAX_SCALE);
4690 printf("BC_STRING_MAX = %u\n", BC_MAX_STRING);
4691 printf("BC_NAME_MAX = %u\n", BC_MAX_NAME);
4692 printf("BC_NUM_MAX = %u\n", BC_MAX_NUM);
4693 printf("MAX Exponent = %lu\n", BC_MAX_EXP);
4694 printf("Number of vars = %lu\n", BC_MAX_VARS);
4698 case BC_LEX_KEY_PRINT:
4700 s = bc_parse_print(p);
4704 case BC_LEX_KEY_QUIT:
4706 // "quit" is a compile-time command. For example,
4707 // "if (0 == 1) quit" terminates when parsing the statement,
4708 // not when it is executed
4709 quit_or_return_for_exit();
4712 case BC_LEX_KEY_RETURN:
4714 s = bc_parse_return(p);
4718 case BC_LEX_KEY_WHILE:
4720 s = bc_parse_while(p);
4726 s = bc_error_bad_token();
4734 static BcStatus bc_parse_parse(BcParse *p)
4738 if (p->l.t.t == BC_LEX_EOF)
4739 s = p->flags.len > 0 ? bc_error("block end could not be found") : bc_error("end of file");
4740 else if (p->l.t.t == BC_LEX_KEY_DEFINE) {
4741 if (!BC_PARSE_CAN_EXEC(p)) return bc_error_bad_token();
4742 s = bc_parse_func(p);
4745 s = bc_parse_stmt(p);
4747 if (s || G_interrupt) {
4749 s = BC_STATUS_FAILURE;
4755 static BcStatus bc_parse_expr_empty_ok(BcParse *p, uint8_t flags, BcParseNext next)
4757 BcStatus s = BC_STATUS_SUCCESS;
4758 BcInst prev = BC_INST_PRINT;
4759 BcLexType top, t = p->l.t.t;
4760 size_t nexprs = 0, ops_bgn = p->ops.len;
4761 uint32_t i, nparens, nrelops;
4762 bool paren_first, paren_expr, rprn, done, get_token, assign, bin_last;
4764 paren_first = p->l.t.t == BC_LEX_LPAREN;
4765 nparens = nrelops = 0;
4766 paren_expr = rprn = done = get_token = assign = false;
4769 for (; !G_interrupt && !s && !done && bc_parse_exprs(t); t = p->l.t.t) {
4775 s = bc_parse_incdec(p, &prev, &paren_expr, &nexprs, flags);
4776 rprn = get_token = bin_last = false;
4780 case BC_LEX_OP_MINUS:
4782 s = bc_parse_minus(p, &prev, ops_bgn, rprn, &nexprs);
4783 rprn = get_token = false;
4784 bin_last = prev == BC_INST_MINUS;
4788 case BC_LEX_OP_ASSIGN_POWER:
4789 case BC_LEX_OP_ASSIGN_MULTIPLY:
4790 case BC_LEX_OP_ASSIGN_DIVIDE:
4791 case BC_LEX_OP_ASSIGN_MODULUS:
4792 case BC_LEX_OP_ASSIGN_PLUS:
4793 case BC_LEX_OP_ASSIGN_MINUS:
4794 case BC_LEX_OP_ASSIGN:
4796 if (prev != BC_INST_VAR && prev != BC_INST_ARRAY_ELEM &&
4797 prev != BC_INST_SCALE && prev != BC_INST_IBASE &&
4798 prev != BC_INST_OBASE && prev != BC_INST_LAST)
4800 s = bc_error("bad assignment:"
4801 " left side must be scale,"
4802 " ibase, obase, last, var,"
4809 case BC_LEX_OP_POWER:
4810 case BC_LEX_OP_MULTIPLY:
4811 case BC_LEX_OP_DIVIDE:
4812 case BC_LEX_OP_MODULUS:
4813 case BC_LEX_OP_PLUS:
4814 case BC_LEX_OP_REL_EQ:
4815 case BC_LEX_OP_REL_LE:
4816 case BC_LEX_OP_REL_GE:
4817 case BC_LEX_OP_REL_NE:
4818 case BC_LEX_OP_REL_LT:
4819 case BC_LEX_OP_REL_GT:
4820 case BC_LEX_OP_BOOL_NOT:
4821 case BC_LEX_OP_BOOL_OR:
4822 case BC_LEX_OP_BOOL_AND:
4824 if (((t == BC_LEX_OP_BOOL_NOT) != bin_last)
4825 || (t != BC_LEX_OP_BOOL_NOT && prev == BC_INST_BOOL_NOT)
4827 return bc_error_bad_expression();
4830 nrelops += t >= BC_LEX_OP_REL_EQ && t <= BC_LEX_OP_REL_GT;
4831 prev = BC_PARSE_TOKEN_INST(t);
4832 s = bc_parse_operator(p, t, ops_bgn, &nexprs, true);
4833 rprn = get_token = false;
4834 bin_last = t != BC_LEX_OP_BOOL_NOT;
4841 if (BC_PARSE_LEAF(prev, rprn))
4842 return bc_error_bad_expression();
4844 paren_expr = rprn = bin_last = false;
4846 bc_vec_push(&p->ops, &t);
4853 if (bin_last || prev == BC_INST_BOOL_NOT)
4854 return bc_error_bad_expression();
4857 s = BC_STATUS_SUCCESS;
4862 else if (!paren_expr)
4863 return BC_STATUS_PARSE_EMPTY_EXP;
4866 paren_expr = rprn = true;
4867 get_token = bin_last = false;
4869 s = bc_parse_rightParen(p, ops_bgn, &nexprs);
4876 if (BC_PARSE_LEAF(prev, rprn))
4877 return bc_error_bad_expression();
4879 rprn = get_token = bin_last = false;
4880 s = bc_parse_name(p, &prev, flags & ~BC_PARSE_NOCALL);
4888 if (BC_PARSE_LEAF(prev, rprn))
4889 return bc_error_bad_expression();
4890 bc_parse_number(p, &prev, &nexprs);
4891 paren_expr = get_token = true;
4892 rprn = bin_last = false;
4897 case BC_LEX_KEY_IBASE:
4898 case BC_LEX_KEY_LAST:
4899 case BC_LEX_KEY_OBASE:
4901 if (BC_PARSE_LEAF(prev, rprn))
4902 return bc_error_bad_expression();
4903 prev = (char) (t - BC_LEX_KEY_IBASE + BC_INST_IBASE);
4904 bc_parse_push(p, (char) prev);
4906 paren_expr = get_token = true;
4907 rprn = bin_last = false;
4913 case BC_LEX_KEY_LENGTH:
4914 case BC_LEX_KEY_SQRT:
4916 if (BC_PARSE_LEAF(prev, rprn))
4917 return bc_error_bad_expression();
4918 s = bc_parse_builtin(p, t, flags, &prev);
4920 rprn = get_token = bin_last = false;
4926 case BC_LEX_KEY_READ:
4928 if (BC_PARSE_LEAF(prev, rprn))
4929 return bc_error_bad_expression();
4930 else if (flags & BC_PARSE_NOREAD)
4931 s = bc_error_nested_read_call();
4933 s = bc_parse_read(p);
4936 rprn = get_token = bin_last = false;
4938 prev = BC_INST_READ;
4943 case BC_LEX_KEY_SCALE:
4945 if (BC_PARSE_LEAF(prev, rprn))
4946 return bc_error_bad_expression();
4947 s = bc_parse_scale(p, &prev, flags);
4949 rprn = get_token = bin_last = false;
4951 prev = BC_INST_SCALE;
4958 s = bc_error_bad_token();
4963 if (!s && get_token) s = bc_lex_next(&p->l);
4967 if (G_interrupt) return BC_STATUS_FAILURE; // ^C: stop parsing
4969 while (p->ops.len > ops_bgn) {
4971 top = BC_PARSE_TOP_OP(p);
4972 assign = top >= BC_LEX_OP_ASSIGN_POWER && top <= BC_LEX_OP_ASSIGN;
4974 if (top == BC_LEX_LPAREN || top == BC_LEX_RPAREN)
4975 return bc_error_bad_expression();
4977 bc_parse_push(p, BC_PARSE_TOKEN_INST(top));
4979 nexprs -= top != BC_LEX_OP_BOOL_NOT && top != BC_LEX_NEG;
4980 bc_vec_pop(&p->ops);
4983 if (prev == BC_INST_BOOL_NOT || nexprs != 1)
4984 return bc_error_bad_expression();
4986 for (i = 0; i < next.len; ++i)
4987 if (t == next.tokens[i])
4989 return bc_error_bad_expression();
4992 if (!(flags & BC_PARSE_REL) && nrelops) {
4993 s = bc_POSIX_does_not_allow("comparison operators outside if or loops");
4996 else if ((flags & BC_PARSE_REL) && nrelops > 1) {
4997 s = bc_POSIX_requires("exactly one comparison operator per condition");
5001 if (flags & BC_PARSE_PRINT) {
5002 if (paren_first || !assign) bc_parse_push(p, BC_INST_PRINT);
5003 bc_parse_push(p, BC_INST_POP);
5009 static BcStatus bc_parse_expr(BcParse *p, uint8_t flags, BcParseNext next)
5013 s = bc_parse_expr_empty_ok(p, flags, next);
5014 if (s == BC_STATUS_PARSE_EMPTY_EXP)
5015 return bc_error("empty expression");
5019 static void bc_parse_init(BcParse *p, size_t func)
5021 bc_parse_create(p, func, bc_parse_parse, bc_lex_token);
5024 static BcStatus bc_parse_expression(BcParse *p, uint8_t flags)
5026 return bc_parse_expr(p, flags, bc_parse_next_read);
5033 #define DC_PARSE_BUF_LEN ((int) (sizeof(uint32_t) * CHAR_BIT))
5035 static BcStatus dc_parse_register(BcParse *p)
5040 s = bc_lex_next(&p->l);
5042 if (p->l.t.t != BC_LEX_NAME) return bc_error_bad_token();
5044 name = xstrdup(p->l.t.v.v);
5045 bc_parse_pushName(p, name);
5050 static BcStatus dc_parse_string(BcParse *p)
5052 char *str, *name, b[DC_PARSE_BUF_LEN + 1];
5053 size_t idx, len = G.prog.strs.len;
5055 sprintf(b, "%0*zu", DC_PARSE_BUF_LEN, len);
5058 str = xstrdup(p->l.t.v.v);
5059 bc_parse_push(p, BC_INST_STR);
5060 bc_parse_pushIndex(p, len);
5061 bc_vec_push(&G.prog.strs, &str);
5062 bc_parse_addFunc(p, name, &idx);
5064 return bc_lex_next(&p->l);
5067 static BcStatus dc_parse_mem(BcParse *p, uint8_t inst, bool name, bool store)
5071 bc_parse_push(p, inst);
5073 s = dc_parse_register(p);
5078 bc_parse_push(p, BC_INST_SWAP);
5079 bc_parse_push(p, BC_INST_ASSIGN);
5080 bc_parse_push(p, BC_INST_POP);
5083 return bc_lex_next(&p->l);
5086 static BcStatus dc_parse_cond(BcParse *p, uint8_t inst)
5090 bc_parse_push(p, inst);
5091 bc_parse_push(p, BC_INST_EXEC_COND);
5093 s = dc_parse_register(p);
5096 s = bc_lex_next(&p->l);
5099 if (p->l.t.t == BC_LEX_ELSE) {
5100 s = dc_parse_register(p);
5102 s = bc_lex_next(&p->l);
5105 bc_parse_push(p, BC_PARSE_STREND);
5110 static BcStatus dc_parse_token(BcParse *p, BcLexType t, uint8_t flags)
5112 BcStatus s = BC_STATUS_SUCCESS;
5115 bool assign, get_token = false;
5119 case BC_LEX_OP_REL_EQ:
5120 case BC_LEX_OP_REL_LE:
5121 case BC_LEX_OP_REL_GE:
5122 case BC_LEX_OP_REL_NE:
5123 case BC_LEX_OP_REL_LT:
5124 case BC_LEX_OP_REL_GT:
5126 s = dc_parse_cond(p, t - BC_LEX_OP_REL_EQ + BC_INST_REL_EQ);
5133 s = dc_parse_mem(p, BC_INST_ARRAY_ELEM, true, t == BC_LEX_COLON);
5139 s = dc_parse_string(p);
5146 if (t == BC_LEX_NEG) {
5147 s = bc_lex_next(&p->l);
5149 if (p->l.t.t != BC_LEX_NUMBER)
5150 return bc_error_bad_token();
5153 bc_parse_number(p, &prev, &p->nbraces);
5155 if (t == BC_LEX_NEG) bc_parse_push(p, BC_INST_NEG);
5161 case BC_LEX_KEY_READ:
5163 if (flags & BC_PARSE_NOREAD)
5164 s = bc_error_nested_read_call();
5166 bc_parse_push(p, BC_INST_READ);
5171 case BC_LEX_OP_ASSIGN:
5172 case BC_LEX_STORE_PUSH:
5174 assign = t == BC_LEX_OP_ASSIGN;
5175 inst = assign ? BC_INST_VAR : BC_INST_PUSH_TO_VAR;
5176 s = dc_parse_mem(p, inst, true, assign);
5181 case BC_LEX_LOAD_POP:
5183 inst = t == BC_LEX_LOAD_POP ? BC_INST_PUSH_VAR : BC_INST_LOAD;
5184 s = dc_parse_mem(p, inst, true, false);
5188 case BC_LEX_STORE_IBASE:
5189 case BC_LEX_STORE_SCALE:
5190 case BC_LEX_STORE_OBASE:
5192 inst = t - BC_LEX_STORE_IBASE + BC_INST_IBASE;
5193 s = dc_parse_mem(p, inst, false, true);
5199 s = bc_error_bad_token();
5205 if (!s && get_token) s = bc_lex_next(&p->l);
5210 static BcStatus dc_parse_expr(BcParse *p, uint8_t flags)
5212 BcStatus s = BC_STATUS_SUCCESS;
5216 if (flags & BC_PARSE_NOCALL) p->nbraces = G.prog.results.len;
5218 for (t = p->l.t.t; !s && t != BC_LEX_EOF; t = p->l.t.t) {
5220 inst = dc_parse_insts[t];
5222 if (inst != BC_INST_INVALID) {
5223 bc_parse_push(p, inst);
5224 s = bc_lex_next(&p->l);
5227 s = dc_parse_token(p, t, flags);
5230 if (!s && p->l.t.t == BC_LEX_EOF && (flags & BC_PARSE_NOCALL))
5231 bc_parse_push(p, BC_INST_POP_EXEC);
5236 static BcStatus dc_parse_parse(BcParse *p)
5240 if (p->l.t.t == BC_LEX_EOF)
5241 s = bc_error("end of file");
5243 s = dc_parse_expr(p, 0);
5245 if (s || G_interrupt) {
5247 s = BC_STATUS_FAILURE;
5253 static void dc_parse_init(BcParse *p, size_t func)
5255 bc_parse_create(p, func, dc_parse_parse, dc_lex_token);
5260 static void common_parse_init(BcParse *p, size_t func)
5263 IF_BC(bc_parse_init(p, func);)
5265 IF_DC(dc_parse_init(p, func);)
5269 static BcStatus common_parse_expr(BcParse *p, uint8_t flags)
5272 IF_BC(return bc_parse_expression(p, flags);)
5274 IF_DC(return dc_parse_expr(p, flags);)
5278 static BcVec* bc_program_search(char *id, bool var)
5286 v = var ? &G.prog.vars : &G.prog.arrs;
5287 map = var ? &G.prog.var_map : &G.prog.arr_map;
5291 new = bc_map_insert(map, &e, &i); // 1 if insertion was successful
5294 bc_array_init(&data.v, var);
5295 bc_vec_push(v, &data.v);
5298 ptr = bc_vec_item(map, i);
5299 if (new) ptr->name = xstrdup(e.name);
5300 return bc_vec_item(v, ptr->idx);
5303 static BcStatus bc_program_num(BcResult *r, BcNum **num, bool hex)
5305 BcStatus s = BC_STATUS_SUCCESS;
5310 case BC_RESULT_TEMP:
5311 case BC_RESULT_IBASE:
5312 case BC_RESULT_SCALE:
5313 case BC_RESULT_OBASE:
5319 case BC_RESULT_CONSTANT:
5321 char **str = bc_vec_item(&G.prog.consts, r->d.id.idx);
5322 size_t base_t, len = strlen(*str);
5325 bc_num_init(&r->d.n, len);
5327 hex = hex && len == 1;
5328 base = hex ? &G.prog.hexb : &G.prog.ib;
5329 base_t = hex ? BC_NUM_MAX_IBASE : G.prog.ib_t;
5330 s = bc_num_parse(&r->d.n, *str, base, base_t);
5333 bc_num_free(&r->d.n);
5338 r->t = BC_RESULT_TEMP;
5344 case BC_RESULT_ARRAY:
5345 case BC_RESULT_ARRAY_ELEM:
5349 v = bc_program_search(r->d.id.name, r->t == BC_RESULT_VAR);
5351 if (r->t == BC_RESULT_ARRAY_ELEM) {
5353 if (v->len <= r->d.id.idx) bc_array_expand(v, r->d.id.idx + 1);
5354 *num = bc_vec_item(v, r->d.id.idx);
5357 *num = bc_vec_top(v);
5362 case BC_RESULT_LAST:
5364 *num = &G.prog.last;
5378 static BcStatus bc_program_binOpPrep(BcResult **l, BcNum **ln,
5379 BcResult **r, BcNum **rn, bool assign)
5383 BcResultType lt, rt;
5385 if (!BC_PROG_STACK(&G.prog.results, 2))
5386 return bc_error_stack_has_too_few_elements();
5388 *r = bc_vec_item_rev(&G.prog.results, 0);
5389 *l = bc_vec_item_rev(&G.prog.results, 1);
5393 hex = assign && (lt == BC_RESULT_IBASE || lt == BC_RESULT_OBASE);
5395 s = bc_program_num(*l, ln, false);
5397 s = bc_program_num(*r, rn, hex);
5400 // We run this again under these conditions in case any vector has been
5401 // reallocated out from under the BcNums or arrays we had.
5402 if (lt == rt && (lt == BC_RESULT_VAR || lt == BC_RESULT_ARRAY_ELEM)) {
5403 s = bc_program_num(*l, ln, false);
5407 if (!BC_PROG_NUM((*l), (*ln)) && (!assign || (*l)->t != BC_RESULT_VAR))
5408 return bc_error_variable_is_wrong_type();
5409 if (!assign && !BC_PROG_NUM((*r), (*ln)))
5410 return bc_error_variable_is_wrong_type();
5415 static void bc_program_binOpRetire(BcResult *r)
5417 r->t = BC_RESULT_TEMP;
5418 bc_vec_pop(&G.prog.results);
5419 bc_vec_pop(&G.prog.results);
5420 bc_vec_push(&G.prog.results, r);
5423 static BcStatus bc_program_prep(BcResult **r, BcNum **n)
5427 if (!BC_PROG_STACK(&G.prog.results, 1))
5428 return bc_error_stack_has_too_few_elements();
5429 *r = bc_vec_top(&G.prog.results);
5431 s = bc_program_num(*r, n, false);
5434 if (!BC_PROG_NUM((*r), (*n)))
5435 return bc_error_variable_is_wrong_type();
5440 static void bc_program_retire(BcResult *r, BcResultType t)
5443 bc_vec_pop(&G.prog.results);
5444 bc_vec_push(&G.prog.results, r);
5447 static BcStatus bc_program_op(char inst)
5450 BcResult *opd1, *opd2, res;
5451 BcNum *n1, *n2 = NULL;
5453 s = bc_program_binOpPrep(&opd1, &n1, &opd2, &n2, false);
5455 bc_num_init(&res.d.n, BC_NUM_DEF_SIZE);
5457 s = bc_program_ops[inst - BC_INST_POWER](n1, n2, &res.d.n, G.prog.scale);
5459 bc_program_binOpRetire(&res);
5464 bc_num_free(&res.d.n);
5468 static BcStatus bc_program_read(void)
5470 const char *sv_file;
5476 BcFunc *f = bc_vec_item(&G.prog.fns, BC_PROG_READ);
5478 for (i = 0; i < G.prog.stack.len; ++i) {
5479 BcInstPtr *ip_ptr = bc_vec_item(&G.prog.stack, i);
5480 if (ip_ptr->func == BC_PROG_READ)
5481 return bc_error_nested_read_call();
5484 bc_vec_pop_all(&f->code);
5485 bc_char_vec_init(&buf);
5487 sv_file = G.prog.file;
5490 s = bc_read_line(&buf, "read> ");
5493 common_parse_init(&parse, BC_PROG_READ);
5494 bc_lex_file(&parse.l);
5496 s = bc_parse_text(&parse, buf.v);
5497 if (s) goto exec_err;
5498 s = common_parse_expr(&parse, BC_PARSE_NOREAD);
5499 if (s) goto exec_err;
5501 if (parse.l.t.t != BC_LEX_NLINE && parse.l.t.t != BC_LEX_EOF) {
5502 s = bc_error("bad read() expression");
5506 ip.func = BC_PROG_READ;
5508 ip.len = G.prog.results.len;
5510 // Update this pointer, just in case.
5511 f = bc_vec_item(&G.prog.fns, BC_PROG_READ);
5513 bc_vec_pushByte(&f->code, BC_INST_POP_EXEC);
5514 bc_vec_push(&G.prog.stack, &ip);
5517 G.prog.file = sv_file;
5518 bc_parse_free(&parse);
5524 static size_t bc_program_index(char *code, size_t *bgn)
5526 char amt = code[(*bgn)++], i = 0;
5529 for (; i < amt; ++i, ++(*bgn))
5530 res |= (((size_t)((int) code[*bgn]) & UCHAR_MAX) << (i * CHAR_BIT));
5535 static char *bc_program_name(char *code, size_t *bgn)
5538 char c, *s, *str = code + *bgn, *ptr = strchr(str, BC_PARSE_STREND);
5540 s = xmalloc(ptr - str + 1);
5543 for (i = 0; c != 0 && c != BC_PARSE_STREND; c = code[(*bgn)++], ++i)
5551 static void bc_program_printString(const char *str, size_t *nchars)
5553 size_t i, len = strlen(str);
5562 for (i = 0; i < len; ++i, ++(*nchars)) {
5566 if (c != '\\' || i == len - 1)
5626 // Just print the backslash and following character.
5637 static BcStatus bc_program_print(char inst, size_t idx)
5639 BcStatus s = BC_STATUS_SUCCESS;
5644 bool pop = inst != BC_INST_PRINT;
5646 if (!BC_PROG_STACK(&G.prog.results, idx + 1))
5647 return bc_error_stack_has_too_few_elements();
5649 r = bc_vec_item_rev(&G.prog.results, idx);
5650 s = bc_program_num(r, &num, false);
5653 if (BC_PROG_NUM(r, num)) {
5654 s = bc_num_print(num, &G.prog.ob, G.prog.ob_t, !pop, &G.prog.nchars, G.prog.len);
5655 if (!s) bc_num_copy(&G.prog.last, num);
5659 idx = (r->t == BC_RESULT_STR) ? r->d.id.idx : num->rdx;
5660 str = *((char **) bc_vec_item(&G.prog.strs, idx));
5662 if (inst == BC_INST_PRINT_STR) {
5663 for (i = 0, len = strlen(str); i < len; ++i) {
5666 if (c == '\n') G.prog.nchars = SIZE_MAX;
5671 bc_program_printString(str, &G.prog.nchars);
5672 if (inst == BC_INST_PRINT) bb_putchar('\n');
5676 if (!s && pop) bc_vec_pop(&G.prog.results);
5681 static BcStatus bc_program_negate(void)
5687 s = bc_program_prep(&ptr, &num);
5690 bc_num_init(&res.d.n, num->len);
5691 bc_num_copy(&res.d.n, num);
5692 if (res.d.n.len) res.d.n.neg = !res.d.n.neg;
5694 bc_program_retire(&res, BC_RESULT_TEMP);
5699 static BcStatus bc_program_logical(char inst)
5702 BcResult *opd1, *opd2, res;
5707 s = bc_program_binOpPrep(&opd1, &n1, &opd2, &n2, false);
5709 bc_num_init(&res.d.n, BC_NUM_DEF_SIZE);
5711 if (inst == BC_INST_BOOL_AND)
5712 cond = bc_num_cmp(n1, &G.prog.zero) && bc_num_cmp(n2, &G.prog.zero);
5713 else if (inst == BC_INST_BOOL_OR)
5714 cond = bc_num_cmp(n1, &G.prog.zero) || bc_num_cmp(n2, &G.prog.zero);
5717 cmp = bc_num_cmp(n1, n2);
5721 case BC_INST_REL_EQ:
5727 case BC_INST_REL_LE:
5733 case BC_INST_REL_GE:
5739 case BC_INST_REL_NE:
5745 case BC_INST_REL_LT:
5751 case BC_INST_REL_GT:
5759 (cond ? bc_num_one : bc_num_zero)(&res.d.n);
5761 bc_program_binOpRetire(&res);
5767 static BcStatus bc_program_assignStr(BcResult *r, BcVec *v,
5773 memset(&n2, 0, sizeof(BcNum));
5774 n2.rdx = res.d.id.idx = r->d.id.idx;
5775 res.t = BC_RESULT_STR;
5778 if (!BC_PROG_STACK(&G.prog.results, 2))
5779 return bc_error_stack_has_too_few_elements();
5781 bc_vec_pop(&G.prog.results);
5784 bc_vec_pop(&G.prog.results);
5786 bc_vec_push(&G.prog.results, &res);
5787 bc_vec_push(v, &n2);
5789 return BC_STATUS_SUCCESS;
5793 static BcStatus bc_program_copyToVar(char *name, bool var)
5800 if (!BC_PROG_STACK(&G.prog.results, 1))
5801 return bc_error_stack_has_too_few_elements();
5803 ptr = bc_vec_top(&G.prog.results);
5804 if ((ptr->t == BC_RESULT_ARRAY) != !var)
5805 return bc_error_variable_is_wrong_type();
5806 v = bc_program_search(name, var);
5809 if (ptr->t == BC_RESULT_STR && !var)
5810 return bc_error_variable_is_wrong_type();
5811 if (ptr->t == BC_RESULT_STR) return bc_program_assignStr(ptr, v, true);
5814 s = bc_program_num(ptr, &n, false);
5817 // Do this once more to make sure that pointers were not invalidated.
5818 v = bc_program_search(name, var);
5821 bc_num_init(&r.d.n, BC_NUM_DEF_SIZE);
5822 bc_num_copy(&r.d.n, n);
5825 bc_array_init(&r.d.v, true);
5826 bc_array_copy(&r.d.v, (BcVec *) n);
5829 bc_vec_push(v, &r.d);
5830 bc_vec_pop(&G.prog.results);
5835 static BcStatus bc_program_assign(char inst)
5838 BcResult *left, *right, res;
5839 BcNum *l = NULL, *r = NULL;
5840 unsigned long val, max;
5841 bool assign = inst == BC_INST_ASSIGN, ib, sc;
5843 s = bc_program_binOpPrep(&left, &l, &right, &r, assign);
5846 ib = left->t == BC_RESULT_IBASE;
5847 sc = left->t == BC_RESULT_SCALE;
5851 if (right->t == BC_RESULT_STR) {
5855 if (left->t != BC_RESULT_VAR)
5856 return bc_error_variable_is_wrong_type();
5857 v = bc_program_search(left->d.id.name, true);
5859 return bc_program_assignStr(right, v, false);
5863 if (left->t == BC_RESULT_CONSTANT || left->t == BC_RESULT_TEMP)
5864 return bc_error("bad assignment:"
5865 " left side must be scale,"
5866 " ibase, obase, last, var,"
5871 if (inst == BC_INST_ASSIGN_DIVIDE && !bc_num_cmp(r, &G.prog.zero))
5872 return bc_error("divide by zero");
5877 s = bc_program_ops[inst - BC_INST_ASSIGN_POWER](l, r, l, G.prog.scale);
5884 if (ib || sc || left->t == BC_RESULT_OBASE) {
5885 static const char *const msg[] = {
5886 "bad ibase; must be [2, 16]", //BC_RESULT_IBASE
5887 "bad scale; must be [0, BC_SCALE_MAX]", //BC_RESULT_SCALE
5888 NULL, //can't happen //BC_RESULT_LAST
5889 NULL, //can't happen //BC_RESULT_CONSTANT
5890 NULL, //can't happen //BC_RESULT_ONE
5891 "bad obase; must be [2, BC_BASE_MAX]", //BC_RESULT_OBASE
5895 s = bc_num_ulong(l, &val);
5898 s = left->t - BC_RESULT_IBASE;
5901 ptr = &G.prog.scale;
5904 if (val < BC_NUM_MIN_BASE)
5905 return bc_error(msg[s]);
5906 max = ib ? BC_NUM_MAX_IBASE : BC_MAX_OBASE;
5907 ptr = ib ? &G.prog.ib_t : &G.prog.ob_t;
5911 return bc_error(msg[s]);
5913 bc_num_copy(ib ? &G.prog.ib : &G.prog.ob, l);
5915 *ptr = (size_t) val;
5916 s = BC_STATUS_SUCCESS;
5919 bc_num_init(&res.d.n, l->len);
5920 bc_num_copy(&res.d.n, l);
5921 bc_program_binOpRetire(&res);
5927 #define bc_program_pushVar(code, bgn, pop, copy) \
5928 bc_program_pushVar(code, bgn)
5929 // for bc, 'pop' and 'copy' are always false
5931 static BcStatus bc_program_pushVar(char *code, size_t *bgn,
5932 bool pop, bool copy)
5934 BcStatus s = BC_STATUS_SUCCESS;
5936 char *name = bc_program_name(code, bgn);
5938 r.t = BC_RESULT_VAR;
5943 BcVec *v = bc_program_search(name, true);
5944 BcNum *num = bc_vec_top(v);
5948 if (!BC_PROG_STACK(v, 2 - copy)) {
5950 return bc_error_stack_has_too_few_elements();
5956 if (!BC_PROG_STR(num)) {
5958 r.t = BC_RESULT_TEMP;
5960 bc_num_init(&r.d.n, BC_NUM_DEF_SIZE);
5961 bc_num_copy(&r.d.n, num);
5964 r.t = BC_RESULT_STR;
5965 r.d.id.idx = num->rdx;
5968 if (!copy) bc_vec_pop(v);
5973 bc_vec_push(&G.prog.results, &r);
5978 static BcStatus bc_program_pushArray(char *code, size_t *bgn,
5981 BcStatus s = BC_STATUS_SUCCESS;
5985 r.d.id.name = bc_program_name(code, bgn);
5987 if (inst == BC_INST_ARRAY) {
5988 r.t = BC_RESULT_ARRAY;
5989 bc_vec_push(&G.prog.results, &r);
5996 s = bc_program_prep(&operand, &num);
5998 s = bc_num_ulong(num, &temp);
6001 if (temp > BC_MAX_DIM) {
6002 s = bc_error("array too long; must be [1, BC_DIM_MAX]");
6006 r.d.id.idx = (size_t) temp;
6007 bc_program_retire(&r, BC_RESULT_ARRAY_ELEM);
6011 if (s) free(r.d.id.name);
6016 static BcStatus bc_program_incdec(char inst)
6019 BcResult *ptr, res, copy;
6023 s = bc_program_prep(&ptr, &num);
6026 if (inst == BC_INST_INC_POST || inst == BC_INST_DEC_POST) {
6027 copy.t = BC_RESULT_TEMP;
6028 bc_num_init(©.d.n, num->len);
6029 bc_num_copy(©.d.n, num);
6032 res.t = BC_RESULT_ONE;
6033 inst = inst == BC_INST_INC_PRE || inst == BC_INST_INC_POST ?
6034 BC_INST_ASSIGN_PLUS :
6035 BC_INST_ASSIGN_MINUS;
6037 bc_vec_push(&G.prog.results, &res);
6038 bc_program_assign(inst);
6040 if (inst2 == BC_INST_INC_POST || inst2 == BC_INST_DEC_POST) {
6041 bc_vec_pop(&G.prog.results);
6042 bc_vec_push(&G.prog.results, ©);
6048 static BcStatus bc_program_call(char *code, size_t *idx)
6050 BcStatus s = BC_STATUS_SUCCESS;
6052 size_t i, nparams = bc_program_index(code, idx);
6059 ip.func = bc_program_index(code, idx);
6060 func = bc_vec_item(&G.prog.fns, ip.func);
6062 if (func->code.len == 0) {
6063 return bc_error("undefined function");
6065 if (nparams != func->nparams) {
6066 return bc_error_fmt("function has %u parameters, but called with %u", func->nparams, nparams);
6068 ip.len = G.prog.results.len - nparams;
6070 for (i = 0; i < nparams; ++i) {
6072 a = bc_vec_item(&func->autos, nparams - 1 - i);
6073 arg = bc_vec_top(&G.prog.results);
6075 if ((!a->idx) != (arg->t == BC_RESULT_ARRAY) || arg->t == BC_RESULT_STR)
6076 return bc_error_variable_is_wrong_type();
6078 s = bc_program_copyToVar(a->name, a->idx);
6082 for (; i < func->autos.len; ++i) {
6085 a = bc_vec_item(&func->autos, i);
6086 v = bc_program_search(a->name, a->idx);
6089 bc_num_init(¶m.n, BC_NUM_DEF_SIZE);
6090 bc_vec_push(v, ¶m.n);
6093 bc_array_init(¶m.v, true);
6094 bc_vec_push(v, ¶m.v);
6098 bc_vec_push(&G.prog.stack, &ip);
6100 return BC_STATUS_SUCCESS;
6103 static BcStatus bc_program_return(char inst)
6109 BcInstPtr *ip = bc_vec_top(&G.prog.stack);
6111 if (!BC_PROG_STACK(&G.prog.results, ip->len + inst == BC_INST_RET))
6112 return bc_error_stack_has_too_few_elements();
6114 f = bc_vec_item(&G.prog.fns, ip->func);
6115 res.t = BC_RESULT_TEMP;
6117 if (inst == BC_INST_RET) {
6120 BcResult *operand = bc_vec_top(&G.prog.results);
6122 s = bc_program_num(operand, &num, false);
6124 bc_num_init(&res.d.n, num->len);
6125 bc_num_copy(&res.d.n, num);
6128 bc_num_init(&res.d.n, BC_NUM_DEF_SIZE);
6129 bc_num_zero(&res.d.n);
6132 // We need to pop arguments as well, so this takes that into account.
6133 for (i = 0; i < f->autos.len; ++i) {
6136 BcId *a = bc_vec_item(&f->autos, i);
6138 v = bc_program_search(a->name, a->idx);
6142 bc_vec_npop(&G.prog.results, G.prog.results.len - ip->len);
6143 bc_vec_push(&G.prog.results, &res);
6144 bc_vec_pop(&G.prog.stack);
6146 return BC_STATUS_SUCCESS;
6150 static unsigned long bc_program_scale(BcNum *n)
6152 return (unsigned long) n->rdx;
6155 static unsigned long bc_program_len(BcNum *n)
6157 unsigned long len = n->len;
6160 if (n->rdx != n->len) return len;
6161 for (i = n->len - 1; i < n->len && n->num[i] == 0; --len, --i);
6166 static BcStatus bc_program_builtin(char inst)
6172 bool len = inst == BC_INST_LENGTH;
6174 if (!BC_PROG_STACK(&G.prog.results, 1))
6175 return bc_error_stack_has_too_few_elements();
6176 opnd = bc_vec_top(&G.prog.results);
6178 s = bc_program_num(opnd, &num, false);
6182 if (!BC_PROG_NUM(opnd, num) && !len)
6183 return bc_error_variable_is_wrong_type();
6186 bc_num_init(&res.d.n, BC_NUM_DEF_SIZE);
6188 if (inst == BC_INST_SQRT) s = bc_num_sqrt(num, &res.d.n, G.prog.scale);
6190 else if (len != 0 && opnd->t == BC_RESULT_ARRAY) {
6191 bc_num_ulong2num(&res.d.n, (unsigned long) ((BcVec *) num)->len);
6195 else if (len != 0 && !BC_PROG_NUM(opnd, num)) {
6198 size_t idx = opnd->t == BC_RESULT_STR ? opnd->d.id.idx : num->rdx;
6200 str = bc_vec_item(&G.prog.strs, idx);
6201 bc_num_ulong2num(&res.d.n, strlen(*str));
6205 BcProgramBuiltIn f = len ? bc_program_len : bc_program_scale;
6206 bc_num_ulong2num(&res.d.n, f(num));
6209 bc_program_retire(&res, BC_RESULT_TEMP);
6215 static BcStatus bc_program_divmod(void)
6218 BcResult *opd1, *opd2, res, res2;
6219 BcNum *n1, *n2 = NULL;
6221 s = bc_program_binOpPrep(&opd1, &n1, &opd2, &n2, false);
6224 bc_num_init(&res.d.n, BC_NUM_DEF_SIZE);
6225 bc_num_init(&res2.d.n, n2->len);
6227 s = bc_num_divmod(n1, n2, &res2.d.n, &res.d.n, G.prog.scale);
6230 bc_program_binOpRetire(&res2);
6231 res.t = BC_RESULT_TEMP;
6232 bc_vec_push(&G.prog.results, &res);
6237 bc_num_free(&res2.d.n);
6238 bc_num_free(&res.d.n);
6242 static BcStatus bc_program_modexp(void)
6245 BcResult *r1, *r2, *r3, res;
6246 BcNum *n1, *n2, *n3;
6248 if (!BC_PROG_STACK(&G.prog.results, 3))
6249 return bc_error_stack_has_too_few_elements();
6250 s = bc_program_binOpPrep(&r2, &n2, &r3, &n3, false);
6253 r1 = bc_vec_item_rev(&G.prog.results, 2);
6254 s = bc_program_num(r1, &n1, false);
6256 if (!BC_PROG_NUM(r1, n1))
6257 return bc_error_variable_is_wrong_type();
6259 // Make sure that the values have their pointers updated, if necessary.
6260 if (r1->t == BC_RESULT_VAR || r1->t == BC_RESULT_ARRAY_ELEM) {
6262 if (r1->t == r2->t) {
6263 s = bc_program_num(r2, &n2, false);
6267 if (r1->t == r3->t) {
6268 s = bc_program_num(r3, &n3, false);
6273 bc_num_init(&res.d.n, n3->len);
6274 s = bc_num_modexp(n1, n2, n3, &res.d.n);
6277 bc_vec_pop(&G.prog.results);
6278 bc_program_binOpRetire(&res);
6283 bc_num_free(&res.d.n);
6287 static void bc_program_stackLen(void)
6290 size_t len = G.prog.results.len;
6292 res.t = BC_RESULT_TEMP;
6294 bc_num_init(&res.d.n, BC_NUM_DEF_SIZE);
6295 bc_num_ulong2num(&res.d.n, len);
6296 bc_vec_push(&G.prog.results, &res);
6299 static BcStatus bc_program_asciify(void)
6303 BcNum *num = NULL, n;
6304 char *str, *str2, c;
6305 size_t len = G.prog.strs.len, idx;
6308 if (!BC_PROG_STACK(&G.prog.results, 1))
6309 return bc_error_stack_has_too_few_elements();
6310 r = bc_vec_top(&G.prog.results);
6312 s = bc_program_num(r, &num, false);
6315 if (BC_PROG_NUM(r, num)) {
6317 bc_num_init(&n, BC_NUM_DEF_SIZE);
6318 bc_num_copy(&n, num);
6319 bc_num_truncate(&n, n.rdx);
6321 s = bc_num_mod(&n, &G.prog.strmb, &n, 0);
6322 if (s) goto num_err;
6323 s = bc_num_ulong(&n, &val);
6324 if (s) goto num_err;
6331 idx = (r->t == BC_RESULT_STR) ? r->d.id.idx : num->rdx;
6332 str2 = *((char **) bc_vec_item(&G.prog.strs, idx));
6340 str2 = xstrdup(str);
6341 bc_program_addFunc(str2, &idx);
6343 if (idx != len + BC_PROG_REQ_FUNCS) {
6345 for (idx = 0; idx < G.prog.strs.len; ++idx) {
6346 if (!strcmp(*((char **) bc_vec_item(&G.prog.strs, idx)), str)) {
6355 bc_vec_push(&G.prog.strs, &str);
6357 res.t = BC_RESULT_STR;
6359 bc_vec_pop(&G.prog.results);
6360 bc_vec_push(&G.prog.results, &res);
6362 return BC_STATUS_SUCCESS;
6369 static BcStatus bc_program_printStream(void)
6377 if (!BC_PROG_STACK(&G.prog.results, 1))
6378 return bc_error_stack_has_too_few_elements();
6379 r = bc_vec_top(&G.prog.results);
6381 s = bc_program_num(r, &n, false);
6384 if (BC_PROG_NUM(r, n))
6385 s = bc_num_stream(n, &G.prog.strmb, &G.prog.nchars, G.prog.len);
6387 idx = (r->t == BC_RESULT_STR) ? r->d.id.idx : n->rdx;
6388 str = *((char **) bc_vec_item(&G.prog.strs, idx));
6395 static BcStatus bc_program_nquit(void)
6402 s = bc_program_prep(&opnd, &num);
6404 s = bc_num_ulong(num, &val);
6407 bc_vec_pop(&G.prog.results);
6409 if (G.prog.stack.len < val)
6410 return bc_error_stack_has_too_few_elements();
6411 if (G.prog.stack.len == val) {
6412 if (ENABLE_FEATURE_CLEAN_UP)
6413 return BC_STATUS_FAILURE;
6417 bc_vec_npop(&G.prog.stack, val);
6422 static BcStatus bc_program_execStr(char *code, size_t *bgn,
6425 BcStatus s = BC_STATUS_SUCCESS;
6435 if (!BC_PROG_STACK(&G.prog.results, 1))
6436 return bc_error_stack_has_too_few_elements();
6438 r = bc_vec_top(&G.prog.results);
6442 char *name, *then_name = bc_program_name(code, bgn), *else_name = NULL;
6444 if (code[*bgn] == BC_PARSE_STREND)
6447 else_name = bc_program_name(code, bgn);
6449 exec = r->d.n.len != 0;
6453 else if (else_name != NULL) {
6460 v = bc_program_search(name, true);
6467 if (!exec) goto exit;
6468 if (!BC_PROG_STR(n)) {
6469 s = bc_error_variable_is_wrong_type();
6477 if (r->t == BC_RESULT_STR)
6479 else if (r->t == BC_RESULT_VAR) {
6480 s = bc_program_num(r, &n, false);
6481 if (s || !BC_PROG_STR(n)) goto exit;
6488 fidx = sidx + BC_PROG_REQ_FUNCS;
6490 str = bc_vec_item(&G.prog.strs, sidx);
6491 f = bc_vec_item(&G.prog.fns, fidx);
6493 if (f->code.len == 0) {
6494 common_parse_init(&prs, fidx);
6495 s = bc_parse_text(&prs, *str);
6497 s = common_parse_expr(&prs, BC_PARSE_NOCALL);
6500 if (prs.l.t.t != BC_LEX_EOF) {
6501 s = bc_error_bad_expression();
6505 bc_parse_free(&prs);
6509 ip.len = G.prog.results.len;
6512 bc_vec_pop(&G.prog.results);
6513 bc_vec_push(&G.prog.stack, &ip);
6515 return BC_STATUS_SUCCESS;
6518 bc_parse_free(&prs);
6519 f = bc_vec_item(&G.prog.fns, fidx);
6520 bc_vec_pop_all(&f->code);
6522 bc_vec_pop(&G.prog.results);
6527 static void bc_program_pushGlobal(char inst)
6532 res.t = inst - BC_INST_IBASE + BC_RESULT_IBASE;
6533 if (inst == BC_INST_IBASE)
6534 val = (unsigned long) G.prog.ib_t;
6535 else if (inst == BC_INST_SCALE)
6536 val = (unsigned long) G.prog.scale;
6538 val = (unsigned long) G.prog.ob_t;
6540 bc_num_init(&res.d.n, BC_NUM_DEF_SIZE);
6541 bc_num_ulong2num(&res.d.n, val);
6542 bc_vec_push(&G.prog.results, &res);
6545 static void bc_program_addFunc(char *name, size_t *idx)
6547 BcId entry, *entry_ptr;
6552 entry.idx = G.prog.fns.len;
6554 inserted = bc_map_insert(&G.prog.fn_map, &entry, idx);
6555 if (!inserted) free(name);
6557 entry_ptr = bc_vec_item(&G.prog.fn_map, *idx);
6558 *idx = entry_ptr->idx;
6562 BcFunc *func = bc_vec_item(&G.prog.fns, entry_ptr->idx);
6564 // We need to reset these, so the function can be repopulated.
6566 bc_vec_pop_all(&func->autos);
6567 bc_vec_pop_all(&func->code);
6568 bc_vec_pop_all(&func->labels);
6572 bc_vec_push(&G.prog.fns, &f);
6576 static BcStatus bc_program_exec(void)
6578 BcStatus s = BC_STATUS_SUCCESS;
6582 BcInstPtr *ip = bc_vec_top(&G.prog.stack);
6583 BcFunc *func = bc_vec_item(&G.prog.fns, ip->func);
6584 char *code = func->code.v;
6587 while (!s && ip->idx < func->code.len) {
6589 char inst = code[(ip->idx)++];
6594 case BC_INST_JUMP_ZERO:
6596 s = bc_program_prep(&ptr, &num);
6598 cond = !bc_num_cmp(num, &G.prog.zero);
6599 bc_vec_pop(&G.prog.results);
6605 idx = bc_program_index(code, &ip->idx);
6606 addr = bc_vec_item(&func->labels, idx);
6607 if (inst == BC_INST_JUMP || cond) ip->idx = *addr;
6613 s = bc_program_call(code, &ip->idx);
6617 case BC_INST_INC_PRE:
6618 case BC_INST_DEC_PRE:
6619 case BC_INST_INC_POST:
6620 case BC_INST_DEC_POST:
6622 s = bc_program_incdec(inst);
6628 quit_or_return_for_exit();
6635 s = bc_program_return(inst);
6639 case BC_INST_BOOL_OR:
6640 case BC_INST_BOOL_AND:
6642 case BC_INST_REL_EQ:
6643 case BC_INST_REL_LE:
6644 case BC_INST_REL_GE:
6645 case BC_INST_REL_NE:
6646 case BC_INST_REL_LT:
6647 case BC_INST_REL_GT:
6649 s = bc_program_logical(inst);
6655 s = bc_program_read();
6661 s = bc_program_pushVar(code, &ip->idx, false, false);
6665 case BC_INST_ARRAY_ELEM:
6668 s = bc_program_pushArray(code, &ip->idx, inst);
6674 r.t = BC_RESULT_LAST;
6675 bc_vec_push(&G.prog.results, &r);
6683 bc_program_pushGlobal(inst);
6687 case BC_INST_SCALE_FUNC:
6688 case BC_INST_LENGTH:
6691 s = bc_program_builtin(inst);
6697 r.t = BC_RESULT_CONSTANT;
6698 r.d.id.idx = bc_program_index(code, &ip->idx);
6699 bc_vec_push(&G.prog.results, &r);
6705 if (!BC_PROG_STACK(&G.prog.results, 1))
6706 s = bc_error_stack_has_too_few_elements();
6708 bc_vec_pop(&G.prog.results);
6712 case BC_INST_POP_EXEC:
6714 bc_vec_pop(&G.prog.stack);
6719 case BC_INST_PRINT_POP:
6720 case BC_INST_PRINT_STR:
6722 s = bc_program_print(inst, 0);
6728 r.t = BC_RESULT_STR;
6729 r.d.id.idx = bc_program_index(code, &ip->idx);
6730 bc_vec_push(&G.prog.results, &r);
6735 case BC_INST_MULTIPLY:
6736 case BC_INST_DIVIDE:
6737 case BC_INST_MODULUS:
6741 s = bc_program_op(inst);
6745 case BC_INST_BOOL_NOT:
6747 s = bc_program_prep(&ptr, &num);
6750 bc_num_init(&r.d.n, BC_NUM_DEF_SIZE);
6751 (!bc_num_cmp(num, &G.prog.zero) ? bc_num_one : bc_num_zero)(&r.d.n);
6752 bc_program_retire(&r, BC_RESULT_TEMP);
6759 s = bc_program_negate();
6764 case BC_INST_ASSIGN_POWER:
6765 case BC_INST_ASSIGN_MULTIPLY:
6766 case BC_INST_ASSIGN_DIVIDE:
6767 case BC_INST_ASSIGN_MODULUS:
6768 case BC_INST_ASSIGN_PLUS:
6769 case BC_INST_ASSIGN_MINUS:
6771 case BC_INST_ASSIGN:
6773 s = bc_program_assign(inst);
6777 case BC_INST_MODEXP:
6779 s = bc_program_modexp();
6783 case BC_INST_DIVMOD:
6785 s = bc_program_divmod();
6789 case BC_INST_EXECUTE:
6790 case BC_INST_EXEC_COND:
6792 cond = inst == BC_INST_EXEC_COND;
6793 s = bc_program_execStr(code, &ip->idx, cond);
6797 case BC_INST_PRINT_STACK:
6799 for (idx = 0; !s && idx < G.prog.results.len; ++idx)
6800 s = bc_program_print(BC_INST_PRINT, idx);
6804 case BC_INST_CLEAR_STACK:
6806 bc_vec_pop_all(&G.prog.results);
6810 case BC_INST_STACK_LEN:
6812 bc_program_stackLen();
6816 case BC_INST_DUPLICATE:
6818 if (!BC_PROG_STACK(&G.prog.results, 1))
6819 return bc_error_stack_has_too_few_elements();
6820 ptr = bc_vec_top(&G.prog.results);
6821 bc_result_copy(&r, ptr);
6822 bc_vec_push(&G.prog.results, &r);
6830 if (!BC_PROG_STACK(&G.prog.results, 2))
6831 return bc_error_stack_has_too_few_elements();
6833 ptr = bc_vec_item_rev(&G.prog.results, 0);
6834 ptr2 = bc_vec_item_rev(&G.prog.results, 1);
6835 memcpy(&r, ptr, sizeof(BcResult));
6836 memcpy(ptr, ptr2, sizeof(BcResult));
6837 memcpy(ptr2, &r, sizeof(BcResult));
6842 case BC_INST_ASCIIFY:
6844 s = bc_program_asciify();
6848 case BC_INST_PRINT_STREAM:
6850 s = bc_program_printStream();
6855 case BC_INST_PUSH_VAR:
6857 bool copy = inst == BC_INST_LOAD;
6858 s = bc_program_pushVar(code, &ip->idx, true, copy);
6862 case BC_INST_PUSH_TO_VAR:
6864 char *name = bc_program_name(code, &ip->idx);
6865 s = bc_program_copyToVar(name, true);
6872 if (G.prog.stack.len <= 2)
6873 quit_or_return_for_exit();
6874 bc_vec_npop(&G.prog.stack, 2);
6880 s = bc_program_nquit();
6886 if (s || G_interrupt) {
6891 // If the stack has changed, pointers may be invalid.
6892 ip = bc_vec_top(&G.prog.stack);
6893 func = bc_vec_item(&G.prog.fns, ip->func);
6894 code = func->code.v;
6900 static void bc_vm_info(void)
6902 printf("%s "BB_VER"\n"
6903 "Copyright (c) 2018 Gavin D. Howard and contributors\n"
6904 "Report bugs at: https://github.com/gavinhoward/bc\n"
6905 "This is free software with ABSOLUTELY NO WARRANTY\n"
6909 static void bc_args(char **argv)
6915 #if ENABLE_FEATURE_BC_LONG_OPTIONS
6916 opts = option_mask32 |= getopt32long(argv, "xwvsqli",
6917 "extended-register\0" No_argument "x"
6918 "warn\0" No_argument "w"
6919 "version\0" No_argument "v"
6920 "standard\0" No_argument "s"
6921 "quiet\0" No_argument "q"
6922 "mathlib\0" No_argument "l"
6923 "interactive\0" No_argument "i"
6926 opts = option_mask32 |= getopt32(argv, "xwvsqli");
6928 if (getenv("POSIXLY_CORRECT"))
6929 option_mask32 |= BC_FLAG_S;
6931 ///should be in bc_vm_run() instead??
6932 if (opts & BC_FLAG_V) {
6937 for (i = optind; argv[i]; ++i)
6938 bc_vec_push(&G.files, argv + i);
6942 static void bc_vm_envArgs(void)
6946 char *env_args = getenv("BC_ENV_ARGS");
6948 if (!env_args) return;
6950 G.env_args = xstrdup(env_args);
6953 bc_vec_init(&v, sizeof(char *), NULL);
6955 while (*(buf = skip_whitespace(buf)) != '\0') {
6956 bc_vec_push(&v, &buf);
6957 buf = skip_non_whitespace(buf);
6963 // NULL terminate, and pass argv[] so that first arg is argv[1]
6964 if (sizeof(int) == sizeof(char*)) {
6965 bc_vec_push(&v, &const_int_0);
6967 static char *const nullptr = NULL;
6968 bc_vec_push(&v, &nullptr);
6970 bc_args(((char **)v.v) - 1);
6976 static unsigned bc_vm_envLen(const char *var)
6982 len = BC_NUM_PRINT_WIDTH;
6983 if (!lenv) return len;
6985 len = bb_strtou(lenv, NULL, 10) - 1;
6986 if (errno || len < 2 || len >= INT_MAX)
6987 len = BC_NUM_PRINT_WIDTH;
6992 static BcStatus bc_vm_process(const char *text)
6994 BcStatus s = bc_parse_text(&G.prs, text);
6998 while (G.prs.l.t.t != BC_LEX_EOF) {
6999 s = G.prs.parse(&G.prs);
7003 if (BC_PARSE_CAN_EXEC(&G.prs)) {
7004 s = bc_program_exec();
7013 static BcStatus bc_vm_file(const char *file)
7015 const char *sv_file;
7021 data = bc_read_file(file);
7022 if (!data) return bc_error_fmt("file '%s' is not text", file);
7024 sv_file = G.prog.file;
7026 bc_lex_file(&G.prs.l);
7027 s = bc_vm_process(data);
7030 main_func = bc_vec_item(&G.prog.fns, BC_PROG_MAIN);
7031 ip = bc_vec_item(&G.prog.stack, 0);
7033 if (main_func->code.len < ip->idx)
7034 s = bc_error_fmt("file '%s' is not executable", file);
7037 G.prog.file = sv_file;
7042 static BcStatus bc_vm_stdin(void)
7046 size_t len, i, str = 0;
7047 bool comment = false;
7050 bc_lex_file(&G.prs.l);
7052 bc_char_vec_init(&buffer);
7053 bc_char_vec_init(&buf);
7054 bc_vec_pushZeroByte(&buffer);
7056 // This loop is complex because the vm tries not to send any lines that end
7057 // with a backslash to the parser. The reason for that is because the parser
7058 // treats a backslash+newline combo as whitespace, per the bc spec. In that
7059 // case, and for strings and comments, the parser will expect more stuff.
7060 s = BC_STATUS_SUCCESS;
7061 while (!G.eof && (s = bc_read_line(&buf, ">>> ")) == BC_STATUS_SUCCESS) {
7063 char *string = buf.v;
7068 if (str && buf.v[0] == G.send)
7070 else if (buf.v[0] == G.sbgn)
7073 else if (len > 1 || comment) {
7075 for (i = 0; i < len; ++i) {
7077 bool notend = len > i + 1;
7080 if (i - 1 > len || string[i - 1] != '\\') {
7081 if (G.sbgn == G.send)
7083 else if (c == G.send)
7085 else if (c == G.sbgn)
7089 if (c == '/' && notend && !comment && string[i + 1] == '*') {
7093 else if (c == '*' && notend && comment && string[i + 1] == '/')
7097 if (str || comment || string[len - 2] == '\\') {
7098 bc_vec_concat(&buffer, buf.v);
7103 bc_vec_concat(&buffer, buf.v);
7104 s = bc_vm_process(buffer.v);
7106 if (ENABLE_FEATURE_CLEAN_UP && !G_ttyin) {
7107 // Debug config, non-interactive mode:
7108 // return all the way back to main.
7109 // Non-debug builds do not come here, they exit.
7113 fputs("ready for more input\n", stderr);
7116 bc_vec_pop_all(&buffer);
7120 s = bc_error("string end could not be found");
7123 s = bc_error("comment end could not be found");
7127 bc_vec_free(&buffer);
7132 static const char bc_lib[] = {
7135 "\n" "auto b,s,n,r,d,i,p,f,v"
7144 "\n" "scale=scale(x)+1"
7154 "\n" "for(i=2;v!=0;++i){"
7160 "\n" "while((d--)!=0)r*=r"
7163 "\n" "if(n!=0)return(1/r)"
7167 "\n" "auto b,s,r,p,a,q,i,v"
7171 "\n" "r=(1-10^scale)/1"
7182 "\n" "while(x<=0.5){"
7186 "\n" "r=a=(x-1)/(x+1)"
7189 "\n" "for(i=3;v!=0;i+=2){"
7200 "\n" "auto b,s,r,n,a,q,i"
7204 "\n" "scale=1.1*s+2"
7213 "\n" "if(q%2!=0)x=-x"
7217 "\n" "for(i=3;a!=0;i+=2){"
7218 "\n" "a*=q/(i*(i-1))"
7223 "\n" "if(n!=0)return(-r/1)"
7232 "\n" "x=s(2*a(1)+x)"
7238 "\n" "auto b,s,r,n,a,m,t,f,i,u"
7247 "\n" "if(scale<65){"
7248 "\n" "return(.7853981633974483096156608458198757210492923498437764552437361480/n)"
7252 "\n" "if(scale<65){"
7253 "\n" "return(.1973955598498807583700497651947902934475851037878521015176889402/n)"
7264 "\n" "x=(x-.2)/(1+.2*x)"
7269 "\n" "for(i=3;t!=0;i+=2){"
7276 "\n" "return((m*a+r)/n)"
7278 "\n" "define j(n,x){"
7279 "\n" "auto b,s,o,a,i,v,f"
7287 "\n" "if(n%2==1)o=1"
7290 "\n" "for(i=2;i<=n;++i)a*=i"
7292 "\n" "a=(x^n)/2^n/a"
7295 "\n" "scale=scale+length(a)-scale(a)"
7296 "\n" "for(i=1;v!=0;++i){"
7297 "\n" "v=v*f/i/(n+i)"
7303 "\n" "return(a*r/1)"
7308 static BcStatus bc_vm_exec(void)
7310 BcStatus s = BC_STATUS_SUCCESS;
7314 if (option_mask32 & BC_FLAG_L) {
7316 // We know that internal library is not buggy,
7317 // thus error checking is normally disabled.
7318 # define DEBUG_LIB 0
7319 bc_lex_file(&G.prs.l);
7320 s = bc_parse_text(&G.prs, bc_lib);
7321 if (DEBUG_LIB && s) return s;
7323 while (G.prs.l.t.t != BC_LEX_EOF) {
7324 s = G.prs.parse(&G.prs);
7325 if (DEBUG_LIB && s) return s;
7327 s = bc_program_exec();
7328 if (DEBUG_LIB && s) return s;
7332 for (i = 0; !s && i < G.files.len; ++i)
7333 s = bc_vm_file(*((char **) bc_vec_item(&G.files, i)));
7335 if (ENABLE_FEATURE_CLEAN_UP && !G_ttyin) {
7336 // Debug config, non-interactive mode:
7337 // return all the way back to main.
7338 // Non-debug builds do not come here, they exit.
7342 fputs("ready for more input\n", stderr);
7345 if (IS_BC || !G.files.len)
7347 if (!s && !BC_PARSE_CAN_EXEC(&G.prs))
7348 s = bc_vm_process("");
7353 #if ENABLE_FEATURE_CLEAN_UP
7354 static void bc_program_free(void)
7356 bc_num_free(&G.prog.ib);
7357 bc_num_free(&G.prog.ob);
7358 bc_num_free(&G.prog.hexb);
7360 bc_num_free(&G.prog.strmb);
7362 bc_vec_free(&G.prog.fns);
7363 bc_vec_free(&G.prog.fn_map);
7364 bc_vec_free(&G.prog.vars);
7365 bc_vec_free(&G.prog.var_map);
7366 bc_vec_free(&G.prog.arrs);
7367 bc_vec_free(&G.prog.arr_map);
7368 bc_vec_free(&G.prog.strs);
7369 bc_vec_free(&G.prog.consts);
7370 bc_vec_free(&G.prog.results);
7371 bc_vec_free(&G.prog.stack);
7372 bc_num_free(&G.prog.last);
7373 bc_num_free(&G.prog.zero);
7374 bc_num_free(&G.prog.one);
7377 static void bc_vm_free(void)
7379 bc_vec_free(&G.files);
7381 bc_parse_free(&G.prs);
7386 static void bc_program_init(void)
7391 /* memset(&G.prog, 0, sizeof(G.prog)); - already is */
7392 memset(&ip, 0, sizeof(BcInstPtr));
7394 /* G.prog.nchars = G.prog.scale = 0; - already is */
7396 bc_num_init(&G.prog.ib, BC_NUM_DEF_SIZE);
7397 bc_num_ten(&G.prog.ib);
7400 bc_num_init(&G.prog.ob, BC_NUM_DEF_SIZE);
7401 bc_num_ten(&G.prog.ob);
7404 bc_num_init(&G.prog.hexb, BC_NUM_DEF_SIZE);
7405 bc_num_ten(&G.prog.hexb);
7406 G.prog.hexb.num[0] = 6;
7409 bc_num_init(&G.prog.strmb, BC_NUM_DEF_SIZE);
7410 bc_num_ulong2num(&G.prog.strmb, UCHAR_MAX + 1);
7413 bc_num_init(&G.prog.last, BC_NUM_DEF_SIZE);
7414 bc_num_zero(&G.prog.last);
7416 bc_num_init(&G.prog.zero, BC_NUM_DEF_SIZE);
7417 bc_num_zero(&G.prog.zero);
7419 bc_num_init(&G.prog.one, BC_NUM_DEF_SIZE);
7420 bc_num_one(&G.prog.one);
7422 bc_vec_init(&G.prog.fns, sizeof(BcFunc), bc_func_free);
7423 bc_vec_init(&G.prog.fn_map, sizeof(BcId), bc_id_free);
7425 bc_program_addFunc(xstrdup("(main)"), &idx);
7426 bc_program_addFunc(xstrdup("(read)"), &idx);
7428 bc_vec_init(&G.prog.vars, sizeof(BcVec), bc_vec_free);
7429 bc_vec_init(&G.prog.var_map, sizeof(BcId), bc_id_free);
7431 bc_vec_init(&G.prog.arrs, sizeof(BcVec), bc_vec_free);
7432 bc_vec_init(&G.prog.arr_map, sizeof(BcId), bc_id_free);
7434 bc_vec_init(&G.prog.strs, sizeof(char *), bc_string_free);
7435 bc_vec_init(&G.prog.consts, sizeof(char *), bc_string_free);
7436 bc_vec_init(&G.prog.results, sizeof(BcResult), bc_result_free);
7437 bc_vec_init(&G.prog.stack, sizeof(BcInstPtr), NULL);
7438 bc_vec_push(&G.prog.stack, &ip);
7441 static void bc_vm_init(void)
7443 bc_vec_init(&G.files, sizeof(char *), NULL);
7445 IF_BC(bc_vm_envArgs();)
7448 IF_BC(bc_parse_init(&G.prs, BC_PROG_MAIN);)
7450 IF_DC(dc_parse_init(&G.prs, BC_PROG_MAIN);)
7454 static BcStatus bc_vm_run(char **argv, const char *env_len)
7458 #if ENABLE_FEATURE_EDITING
7459 G.line_input_state = new_line_input_t(DO_HISTORY);
7461 G.prog.len = bc_vm_envLen(env_len);
7467 #if ENABLE_FEATURE_BC_SIGNALS
7469 // With SA_RESTART, most system calls will restart
7470 // (IOW: they won't fail with EINTR).
7471 // In particular, this means ^C won't cause
7472 // stdout to get into "error state" if SIGINT hits
7473 // within write() syscall.
7474 // The downside is that ^C while line input is taken
7475 // will only be handled after [Enter] since read()
7476 // from stdin is not interrupted by ^C either,
7477 // it restarts, thus fgetc() does not return on ^C.
7478 signal_SA_RESTART_empty_mask(SIGINT, record_signo);
7480 // Without SA_RESTART, this exhibits a bug:
7481 // "while (1) print 1" and try ^C-ing it.
7482 // Intermittently, instead of returning to input line,
7483 // you'll get "output error: Interrupted system call"
7485 //signal_no_SA_RESTART_empty_mask(SIGINT, record_signo);
7487 if (!(option_mask32 & BC_FLAG_Q))
7493 #if ENABLE_FEATURE_CLEAN_UP
7495 # if ENABLE_FEATURE_EDITING
7496 free_line_input_t(G.line_input_state);
7504 int bc_main(int argc, char **argv) MAIN_EXTERNALLY_VISIBLE;
7505 int bc_main(int argc UNUSED_PARAM, char **argv)
7508 G.sbgn = G.send = '"';
7510 return bc_vm_run(argv, "BC_LINE_LENGTH");
7515 int dc_main(int argc, char **argv) MAIN_EXTERNALLY_VISIBLE;
7516 int dc_main(int argc UNUSED_PARAM, char **argv)
7522 return bc_vm_run(argv, "DC_LINE_LENGTH");
7526 #endif // not DC_SMALL