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 ///////: "\n -i Interactive" - has no effect for now
138 //usage: "\n -q Quiet"
139 //usage: "\n -l Load standard math library"
140 //usage: "\n -s Be POSIX compatible"
141 //usage: "\n -w Warn if extensions are used"
142 ///////: "\n -v Version"
144 //usage: "\n$BC_LINE_LENGTH changes output width"
146 //usage:#define bc_example_usage
147 //usage: "3 + 4.129\n"
148 //usage: "1903 - 2893\n"
149 //usage: "-129 * 213.28935\n"
150 //usage: "12 / -1932\n"
152 //usage: "34 ^ 189\n"
153 //usage: "scale = 13\n"
154 //usage: "ibase = 2\n"
155 //usage: "obase = A\n"
157 //usage:#define dc_trivial_usage
158 //usage: "[-eSCRIPT]... [-fFILE]... [FILE]..."
160 //usage:#define dc_full_usage "\n"
161 //usage: "\nTiny RPN calculator. Operations:"
162 //usage: "\n+, -, *, /, %, ^, exp, ~, divmod, |, "
163 //usage: "modular exponentiation,"
164 //usage: "\np - print top of the stack (without popping)"
165 //usage: "\nf - print entire stack"
166 //usage: "\nk - pop the value and set the precision"
167 //usage: "\ni - pop the value and set input radix"
168 //usage: "\no - pop the value and set output radix"
169 //usage: "\nExamples: dc -e'2 2 + p' -> 4, dc -e'8 8 * 2 2 + / p' -> 16"
171 //usage:#define dc_example_usage
172 //usage: "$ dc -e'2 2 + p'\n"
174 //usage: "$ dc -e'8 8 \\* 2 2 + / p'\n"
176 //usage: "$ dc -e'0 1 & p'\n"
178 //usage: "$ dc -e'0 1 | p'\n"
180 //usage: "$ echo '72 9 / 8 * p' | dc\n"
184 #include "common_bufsiz.h"
186 #if ENABLE_FEATURE_DC_SMALL
190 typedef enum BcStatus {
191 BC_STATUS_SUCCESS = 0,
192 BC_STATUS_FAILURE = 1,
193 BC_STATUS_PARSE_EMPTY_EXP = 2, // bc_parse_expr() uses this
196 #define BC_VEC_INVALID_IDX ((size_t) -1)
197 #define BC_VEC_START_CAP (1 << 5)
199 typedef void (*BcVecFree)(void *);
201 typedef struct BcVec {
209 typedef signed char BcDig;
211 typedef struct BcNum {
219 #define BC_NUM_MIN_BASE ((unsigned long) 2)
220 #define BC_NUM_MAX_IBASE ((unsigned long) 16)
221 // larger value might speed up BIGNUM calculations a bit:
222 #define BC_NUM_DEF_SIZE (16)
223 #define BC_NUM_PRINT_WIDTH (69)
225 #define BC_NUM_KARATSUBA_LEN (32)
227 #define BC_NUM_NEG(n, neg) ((((ssize_t)(n)) ^ -((ssize_t)(neg))) + (neg))
228 #define BC_NUM_ONE(n) ((n)->len == 1 && (n)->rdx == 0 && (n)->num[0] == 1)
229 #define BC_NUM_INT(n) ((n)->len - (n)->rdx)
230 #define BC_NUM_AREQ(a, b) \
231 (BC_MAX((a)->rdx, (b)->rdx) + BC_MAX(BC_NUM_INT(a), BC_NUM_INT(b)) + 1)
232 #define BC_NUM_MREQ(a, b, scale) \
233 (BC_NUM_INT(a) + BC_NUM_INT(b) + BC_MAX((scale), (a)->rdx + (b)->rdx) + 1)
235 typedef BcStatus (*BcNumBinaryOp)(BcNum *, BcNum *, BcNum *, size_t);
236 typedef void (*BcNumDigitOp)(size_t, size_t, bool, size_t *, size_t);
238 static BcStatus bc_num_add(BcNum *a, BcNum *b, BcNum *c, size_t scale);
239 static BcStatus bc_num_sub(BcNum *a, BcNum *b, BcNum *c, size_t scale);
240 static BcStatus bc_num_mul(BcNum *a, BcNum *b, BcNum *c, size_t scale);
241 static BcStatus bc_num_div(BcNum *a, BcNum *b, BcNum *c, size_t scale);
242 static BcStatus bc_num_mod(BcNum *a, BcNum *b, BcNum *c, size_t scale);
243 static BcStatus bc_num_pow(BcNum *a, BcNum *b, BcNum *c, size_t scale);
244 static BcStatus bc_num_sqrt(BcNum *a, BcNum *b, size_t scale);
245 static BcStatus bc_num_divmod(BcNum *a, BcNum *b, BcNum *c, BcNum *d,
248 typedef enum BcInst {
278 BC_INST_ASSIGN_POWER,
279 BC_INST_ASSIGN_MULTIPLY,
280 BC_INST_ASSIGN_DIVIDE,
281 BC_INST_ASSIGN_MODULUS,
283 BC_INST_ASSIGN_MINUS,
329 BC_INST_PRINT_STREAM,
344 BC_INST_INVALID = -1,
349 typedef struct BcId {
354 typedef struct BcFunc {
361 typedef enum BcResultType {
366 BC_RESULT_ARRAY_ELEM,
375 // These are between to calculate ibase, obase, and last from instructions.
383 typedef union BcResultData {
389 typedef struct BcResult {
394 typedef struct BcInstPtr {
400 // BC_LEX_NEG is not used in lexing; it is only for parsing.
401 typedef enum BcLexType {
429 BC_LEX_OP_ASSIGN_POWER,
430 BC_LEX_OP_ASSIGN_MULTIPLY,
431 BC_LEX_OP_ASSIGN_DIVIDE,
432 BC_LEX_OP_ASSIGN_MODULUS,
433 BC_LEX_OP_ASSIGN_PLUS,
434 BC_LEX_OP_ASSIGN_MINUS,
455 BC_LEX_KEY_1st_keyword,
456 BC_LEX_KEY_AUTO = BC_LEX_KEY_1st_keyword,
463 // code uses "type - BC_LEX_KEY_IBASE + BC_INST_IBASE" construct,
464 BC_LEX_KEY_IBASE, // relative order should match for: BC_INST_IBASE
466 BC_LEX_KEY_LAST, // relative order should match for: BC_INST_LAST
469 BC_LEX_KEY_OBASE, // relative order should match for: BC_INST_OBASE
507 // must match order of BC_LEX_KEY_foo etc above
509 struct BcLexKeyword {
512 #define BC_LEX_KW_ENTRY(a, b) \
513 { .name8 = a /*, .posix = b */ }
514 static const struct BcLexKeyword bc_lex_kws[20] = {
515 BC_LEX_KW_ENTRY("auto" , 1), // 0
516 BC_LEX_KW_ENTRY("break" , 1), // 1
517 BC_LEX_KW_ENTRY("continue", 0), // 2 note: this one has no terminating NUL
518 BC_LEX_KW_ENTRY("define" , 1), // 3
520 BC_LEX_KW_ENTRY("else" , 0), // 4
521 BC_LEX_KW_ENTRY("for" , 1), // 5
522 BC_LEX_KW_ENTRY("halt" , 0), // 6
523 BC_LEX_KW_ENTRY("ibase" , 1), // 7
525 BC_LEX_KW_ENTRY("if" , 1), // 8
526 BC_LEX_KW_ENTRY("last" , 0), // 9
527 BC_LEX_KW_ENTRY("length" , 1), // 10
528 BC_LEX_KW_ENTRY("limits" , 0), // 11
530 BC_LEX_KW_ENTRY("obase" , 1), // 12
531 BC_LEX_KW_ENTRY("print" , 0), // 13
532 BC_LEX_KW_ENTRY("quit" , 1), // 14
533 BC_LEX_KW_ENTRY("read" , 0), // 15
535 BC_LEX_KW_ENTRY("return" , 1), // 16
536 BC_LEX_KW_ENTRY("scale" , 1), // 17
537 BC_LEX_KW_ENTRY("sqrt" , 1), // 18
538 BC_LEX_KW_ENTRY("while" , 1), // 19
540 #undef BC_LEX_KW_ENTRY
568 #define bc_lex_kws_POSIX(i) ((1 << (i)) & POSIX_KWORD_MASK)
572 typedef BcStatus (*BcLexNext)(struct BcLex *);
574 typedef struct BcLex {
592 #define BC_PARSE_STREND ((char) UCHAR_MAX)
594 #define BC_PARSE_REL (1 << 0)
595 #define BC_PARSE_PRINT (1 << 1)
596 #define BC_PARSE_NOCALL (1 << 2)
597 #define BC_PARSE_NOREAD (1 << 3)
598 #define BC_PARSE_ARRAY (1 << 4)
600 #define BC_PARSE_TOP_FLAG_PTR(parse) ((uint8_t *) bc_vec_top(&(parse)->flags))
601 #define BC_PARSE_TOP_FLAG(parse) (*(BC_PARSE_TOP_FLAG_PTR(parse)))
603 #define BC_PARSE_FLAG_FUNC_INNER (1 << 0)
604 #define BC_PARSE_FUNC_INNER(parse) \
605 (BC_PARSE_TOP_FLAG(parse) & BC_PARSE_FLAG_FUNC_INNER)
607 #define BC_PARSE_FLAG_FUNC (1 << 1)
608 #define BC_PARSE_FUNC(parse) (BC_PARSE_TOP_FLAG(parse) & BC_PARSE_FLAG_FUNC)
610 #define BC_PARSE_FLAG_BODY (1 << 2)
611 #define BC_PARSE_BODY(parse) (BC_PARSE_TOP_FLAG(parse) & BC_PARSE_FLAG_BODY)
613 #define BC_PARSE_FLAG_LOOP (1 << 3)
614 #define BC_PARSE_LOOP(parse) (BC_PARSE_TOP_FLAG(parse) & BC_PARSE_FLAG_LOOP)
616 #define BC_PARSE_FLAG_LOOP_INNER (1 << 4)
617 #define BC_PARSE_LOOP_INNER(parse) \
618 (BC_PARSE_TOP_FLAG(parse) & BC_PARSE_FLAG_LOOP_INNER)
620 #define BC_PARSE_FLAG_IF (1 << 5)
621 #define BC_PARSE_IF(parse) (BC_PARSE_TOP_FLAG(parse) & BC_PARSE_FLAG_IF)
623 #define BC_PARSE_FLAG_ELSE (1 << 6)
624 #define BC_PARSE_ELSE(parse) (BC_PARSE_TOP_FLAG(parse) & BC_PARSE_FLAG_ELSE)
626 #define BC_PARSE_FLAG_IF_END (1 << 7)
627 #define BC_PARSE_IF_END(parse) (BC_PARSE_TOP_FLAG(parse) & BC_PARSE_FLAG_IF_END)
629 #define BC_PARSE_CAN_EXEC(parse) \
630 (!(BC_PARSE_TOP_FLAG(parse) & \
631 (BC_PARSE_FLAG_FUNC_INNER | BC_PARSE_FLAG_FUNC | BC_PARSE_FLAG_BODY | \
632 BC_PARSE_FLAG_LOOP | BC_PARSE_FLAG_LOOP_INNER | BC_PARSE_FLAG_IF | \
633 BC_PARSE_FLAG_ELSE | BC_PARSE_FLAG_IF_END)))
635 typedef struct BcParseNext {
644 typedef BcStatus (*BcParseParse)(struct BcParse *);
646 typedef struct BcParse {
667 typedef struct BcProgram {
708 #define BC_PROG_STACK(s, n) ((s)->len >= ((size_t) n))
710 #define BC_PROG_MAIN (0)
711 #define BC_PROG_READ (1)
713 #define BC_PROG_REQ_FUNCS (2)
716 #define BC_PROG_STR(n) (!(n)->num && !(n)->cap)
717 #define BC_PROG_NUM(r, n) \
718 ((r)->t != BC_RESULT_ARRAY && (r)->t != BC_RESULT_STR && !BC_PROG_STR(n))
720 typedef unsigned long (*BcProgramBuiltIn)(BcNum *);
722 #define BC_FLAG_W (1 << 0)
723 #define BC_FLAG_V (1 << 1)
724 #define BC_FLAG_S (1 << 2)
725 #define BC_FLAG_Q (1 << 3)
726 #define BC_FLAG_L (1 << 4)
727 #define BC_FLAG_I (1 << 5)
728 #define DC_FLAG_X (1 << 6)
730 #define BC_MAX(a, b) ((a) > (b) ? (a) : (b))
731 #define BC_MIN(a, b) ((a) < (b) ? (a) : (b))
733 #define BC_MAX_OBASE ((unsigned) 999)
734 #define BC_MAX_DIM ((unsigned) INT_MAX)
735 #define BC_MAX_SCALE ((unsigned) UINT_MAX)
736 #define BC_MAX_STRING ((unsigned) UINT_MAX - 1)
737 #define BC_MAX_NAME BC_MAX_STRING
738 #define BC_MAX_NUM BC_MAX_STRING
739 #define BC_MAX_EXP ((unsigned long) LONG_MAX)
740 #define BC_MAX_VARS ((unsigned long) SIZE_MAX - 1)
743 IF_FEATURE_BC_SIGNALS(smallint ttyin;)
744 IF_FEATURE_CLEAN_UP(smallint exiting;)
752 // For error messages. Can be set to current parsed line,
753 // or [TODO] to current executing line (can be before last parsed one)
760 #if ENABLE_FEATURE_EDITING
761 line_input_t *line_input_state;
764 #define G (*ptr_to_globals)
765 #define INIT_G() do { \
766 SET_PTR_TO_GLOBALS(xzalloc(sizeof(G))); \
768 #define FREE_G() do { \
769 FREE_PTR_TO_GLOBALS(); \
771 #define G_posix (ENABLE_BC && (option_mask32 & BC_FLAG_S))
772 #define G_warn (ENABLE_BC && (option_mask32 & BC_FLAG_W))
773 #define G_exreg (ENABLE_DC && (option_mask32 & DC_FLAG_X))
774 #define G_interrupt (ENABLE_FEATURE_BC_SIGNALS ? bb_got_signal : 0)
775 #if ENABLE_FEATURE_BC_SIGNALS
776 # define G_ttyin G.ttyin
780 #if ENABLE_FEATURE_CLEAN_UP
781 # define G_exiting G.exiting
785 #define IS_BC (ENABLE_BC && (!ENABLE_DC || applet_name[0] == 'b'))
789 // This is a bit array that corresponds to token types. An entry is
790 // true if the token is valid in an expression, false otherwise.
792 BC_PARSE_EXPRS_BITS = 0
793 + ((uint64_t)((0 << 0)+(0 << 1)+(1 << 2)+(1 << 3)+(1 << 4)+(1 << 5)+(1 << 6)+(1 << 7)) << (0*8))
794 + ((uint64_t)((1 << 0)+(1 << 1)+(1 << 2)+(1 << 3)+(1 << 4)+(1 << 5)+(1 << 6)+(1 << 7)) << (1*8))
795 + ((uint64_t)((1 << 0)+(1 << 1)+(1 << 2)+(1 << 3)+(1 << 4)+(1 << 5)+(1 << 6)+(1 << 7)) << (2*8))
796 + ((uint64_t)((1 << 0)+(1 << 1)+(1 << 2)+(0 << 3)+(0 << 4)+(1 << 5)+(1 << 6)+(0 << 7)) << (3*8))
797 + ((uint64_t)((0 << 0)+(0 << 1)+(0 << 2)+(0 << 3)+(0 << 4)+(0 << 5)+(1 << 6)+(1 << 7)) << (4*8))
798 + ((uint64_t)((0 << 0)+(0 << 1)+(0 << 2)+(0 << 3)+(0 << 4)+(0 << 5)+(0 << 6)+(1 << 7)) << (5*8))
799 + ((uint64_t)((0 << 0)+(1 << 1)+(1 << 2)+(1 << 3)+(1 << 4)+(0 << 5)+(0 << 6)+(1 << 7)) << (6*8))
800 + ((uint64_t)((0 << 0)+(1 << 1)+(1 << 2)+(0 << 3) ) << (7*8))
802 static ALWAYS_INLINE long bc_parse_exprs(unsigned i)
804 #if ULONG_MAX > 0xffffffff
805 // 64-bit version (will not work correctly for 32-bit longs!)
806 return BC_PARSE_EXPRS_BITS & (1UL << i);
809 unsigned long m = (uint32_t)BC_PARSE_EXPRS_BITS;
811 m = (uint32_t)(BC_PARSE_EXPRS_BITS >> 32);
814 return m & (1UL << i);
818 // This is an array of data for operators that correspond to token types.
819 static const uint8_t bc_parse_ops[] = {
820 #define OP(p,l) ((int)(l) * 0x10 + (p))
821 OP(0, false), OP( 0, false ), // inc dec
824 OP(3, true ), OP( 3, true ), OP( 3, true ), // pow mul div
825 OP(4, true ), OP( 4, true ), // mod + -
826 OP(6, true ), OP( 6, true ), OP( 6, true ), OP( 6, true ), OP( 6, true ), OP( 6, true ), // == <= >= != < >
828 OP(7, true ), OP( 7, true ), // or and
829 OP(5, false), OP( 5, false ), OP( 5, false ), OP( 5, false ), OP( 5, false ), // ^= *= /= %= +=
830 OP(5, false), OP( 5, false ), // -= =
833 #define bc_parse_op_PREC(i) (bc_parse_ops[i] & 0x0f)
834 #define bc_parse_op_LEFT(i) (bc_parse_ops[i] & 0x10)
836 // These identify what tokens can come after expressions in certain cases.
837 #define BC_PARSE_NEXT_TOKENS(...) .tokens = { __VA_ARGS__ }
838 #define BC_PARSE_NEXT(a, ...) \
840 .len = (a), BC_PARSE_NEXT_TOKENS(__VA_ARGS__) \
842 static const BcParseNext bc_parse_next_expr =
843 BC_PARSE_NEXT(4, BC_LEX_NLINE, BC_LEX_SCOLON, BC_LEX_RBRACE, BC_LEX_EOF);
844 static const BcParseNext bc_parse_next_param =
845 BC_PARSE_NEXT(2, BC_LEX_RPAREN, BC_LEX_COMMA);
846 static const BcParseNext bc_parse_next_print =
847 BC_PARSE_NEXT(4, BC_LEX_COMMA, BC_LEX_NLINE, BC_LEX_SCOLON, BC_LEX_EOF);
848 static const BcParseNext bc_parse_next_rel = BC_PARSE_NEXT(1, BC_LEX_RPAREN);
849 static const BcParseNext bc_parse_next_elem = BC_PARSE_NEXT(1, BC_LEX_RBRACKET);
850 static const BcParseNext bc_parse_next_for = BC_PARSE_NEXT(1, BC_LEX_SCOLON);
851 static const BcParseNext bc_parse_next_read =
852 BC_PARSE_NEXT(2, BC_LEX_NLINE, BC_LEX_EOF);
856 static const BcLexType dc_lex_regs[] = {
857 BC_LEX_OP_REL_EQ, BC_LEX_OP_REL_LE, BC_LEX_OP_REL_GE, BC_LEX_OP_REL_NE,
858 BC_LEX_OP_REL_LT, BC_LEX_OP_REL_GT, BC_LEX_SCOLON, BC_LEX_COLON,
859 BC_LEX_ELSE, BC_LEX_LOAD, BC_LEX_LOAD_POP, BC_LEX_OP_ASSIGN,
863 static const BcLexType dc_lex_tokens[] = {
864 BC_LEX_OP_MODULUS, BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_LPAREN,
865 BC_LEX_INVALID, BC_LEX_OP_MULTIPLY, BC_LEX_OP_PLUS, BC_LEX_INVALID,
866 BC_LEX_OP_MINUS, BC_LEX_INVALID, BC_LEX_OP_DIVIDE,
867 BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID,
868 BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID,
869 BC_LEX_INVALID, BC_LEX_INVALID,
870 BC_LEX_COLON, BC_LEX_SCOLON, BC_LEX_OP_REL_GT, BC_LEX_OP_REL_EQ,
871 BC_LEX_OP_REL_LT, BC_LEX_KEY_READ, BC_LEX_INVALID,
872 BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID,
873 BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_EQ_NO_REG, BC_LEX_INVALID,
874 BC_LEX_KEY_IBASE, BC_LEX_INVALID, BC_LEX_KEY_SCALE, BC_LEX_LOAD_POP,
875 BC_LEX_INVALID, BC_LEX_OP_BOOL_NOT, BC_LEX_KEY_OBASE, BC_LEX_PRINT_STREAM,
876 BC_LEX_NQUIT, BC_LEX_POP, BC_LEX_STORE_PUSH, BC_LEX_INVALID, BC_LEX_INVALID,
877 BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_SCALE_FACTOR, BC_LEX_INVALID,
878 BC_LEX_KEY_LENGTH, BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID,
879 BC_LEX_OP_POWER, BC_LEX_NEG, BC_LEX_INVALID,
880 BC_LEX_ASCIIFY, BC_LEX_INVALID, BC_LEX_CLEAR_STACK, BC_LEX_DUPLICATE,
881 BC_LEX_ELSE, BC_LEX_PRINT_STACK, BC_LEX_INVALID, BC_LEX_INVALID,
882 BC_LEX_STORE_IBASE, BC_LEX_INVALID, BC_LEX_STORE_SCALE, BC_LEX_LOAD,
883 BC_LEX_INVALID, BC_LEX_PRINT_POP, BC_LEX_STORE_OBASE, BC_LEX_KEY_PRINT,
884 BC_LEX_KEY_QUIT, BC_LEX_SWAP, BC_LEX_OP_ASSIGN, BC_LEX_INVALID,
885 BC_LEX_INVALID, BC_LEX_KEY_SQRT, BC_LEX_INVALID, BC_LEX_EXECUTE,
886 BC_LEX_INVALID, BC_LEX_STACK_LEVEL,
887 BC_LEX_LBRACE, BC_LEX_OP_MODEXP, BC_LEX_INVALID, BC_LEX_OP_DIVMOD,
891 static const BcInst dc_parse_insts[] = {
892 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID, BC_INST_REL_GE,
893 BC_INST_INVALID, BC_INST_POWER, BC_INST_MULTIPLY, BC_INST_DIVIDE,
894 BC_INST_MODULUS, BC_INST_PLUS, BC_INST_MINUS,
895 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID,
896 BC_INST_INVALID, BC_INST_INVALID,
897 BC_INST_BOOL_NOT, BC_INST_INVALID, BC_INST_INVALID,
898 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID,
899 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID,
900 BC_INST_INVALID, BC_INST_INVALID, BC_INST_REL_GT, BC_INST_INVALID,
901 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID, BC_INST_REL_GE,
902 BC_INST_INVALID, BC_INST_INVALID,
903 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID,
904 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID,
905 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID, BC_INST_IBASE,
906 BC_INST_INVALID, BC_INST_INVALID, BC_INST_LENGTH, BC_INST_INVALID,
907 BC_INST_OBASE, BC_INST_PRINT, BC_INST_QUIT, BC_INST_INVALID,
908 BC_INST_INVALID, BC_INST_SCALE, BC_INST_SQRT, BC_INST_INVALID,
909 BC_INST_REL_EQ, BC_INST_MODEXP, BC_INST_DIVMOD, BC_INST_INVALID,
910 BC_INST_INVALID, BC_INST_EXECUTE, BC_INST_PRINT_STACK, BC_INST_CLEAR_STACK,
911 BC_INST_STACK_LEN, BC_INST_DUPLICATE, BC_INST_SWAP, BC_INST_POP,
912 BC_INST_ASCIIFY, BC_INST_PRINT_STREAM, BC_INST_INVALID, BC_INST_INVALID,
913 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID,
914 BC_INST_PRINT, BC_INST_NQUIT, BC_INST_SCALE_FUNC,
918 static const BcNumBinaryOp bc_program_ops[] = {
919 bc_num_pow, bc_num_mul, bc_num_div, bc_num_mod, bc_num_add, bc_num_sub,
922 static void fflush_and_check(void)
925 if (ferror(stdout) || ferror(stderr))
926 bb_perror_msg_and_die("output error");
929 #if ENABLE_FEATURE_CLEAN_UP
930 #define QUIT_OR_RETURN_TO_MAIN \
932 IF_FEATURE_BC_SIGNALS(G_ttyin = 0;) /* do not loop in main loop anymore */ \
934 return BC_STATUS_FAILURE; \
937 #define QUIT_OR_RETURN_TO_MAIN quit()
940 static void quit(void) NORETURN;
941 static void quit(void)
944 bb_perror_msg_and_die("input error");
949 static void bc_verror_msg(const char *fmt, va_list p)
951 const char *sv = sv; /* for compiler */
954 applet_name = xasprintf("%s: %s:%u", applet_name, G.prog.file, G.err_line);
956 bb_verror_msg(fmt, p, NULL);
958 free((char*)applet_name);
963 static NOINLINE int bc_error_fmt(const char *fmt, ...)
968 bc_verror_msg(fmt, p);
971 if (!ENABLE_FEATURE_CLEAN_UP && !G_ttyin)
973 return BC_STATUS_FAILURE;
977 static NOINLINE int bc_posix_error_fmt(const char *fmt, ...)
981 // Are non-POSIX constructs totally ok?
982 if (!(option_mask32 & (BC_FLAG_S|BC_FLAG_W)))
983 return BC_STATUS_SUCCESS; // yes
986 bc_verror_msg(fmt, p);
989 // Do we treat non-POSIX constructs as errors?
990 if (!(option_mask32 & BC_FLAG_S))
991 return BC_STATUS_SUCCESS; // no, it's a warning
992 if (!ENABLE_FEATURE_CLEAN_UP && !G_ttyin)
994 return BC_STATUS_FAILURE;
998 // We use error functions with "return bc_error(FMT[, PARAMS])" idiom.
999 // This idiom begs for tail-call optimization, but for it to work,
1000 // function must not have caller-cleaned parameters on stack.
1001 // Unfortunately, vararg function API does exactly that on most arches.
1002 // Thus, use these shims for the cases when we have no vararg PARAMS:
1003 static int bc_error(const char *msg)
1005 return bc_error_fmt("%s", msg);
1008 static int bc_POSIX_requires(const char *msg)
1010 return bc_posix_error_fmt("POSIX requires %s", msg);
1012 static int bc_POSIX_does_not_allow(const char *msg)
1014 return bc_posix_error_fmt("%s%s", "POSIX does not allow ", msg);
1016 static int bc_POSIX_does_not_allow_bool_ops_this_is_bad(const char *msg)
1018 return bc_posix_error_fmt("%s%s %s", "POSIX does not allow ", "boolean operators; the following is bad:", msg);
1020 static int bc_POSIX_does_not_allow_empty_X_expression_in_for(const char *msg)
1022 return bc_posix_error_fmt("%san empty %s expression in a for loop", "POSIX does not allow ", msg);
1025 static int bc_error_bad_character(char c)
1027 return bc_error_fmt("bad character '%c'", c);
1029 static int bc_error_bad_expression(void)
1031 return bc_error("bad expression");
1033 static int bc_error_bad_token(void)
1035 return bc_error("bad token");
1037 static int bc_error_stack_has_too_few_elements(void)
1039 return bc_error("stack has too few elements");
1041 static int bc_error_variable_is_wrong_type(void)
1043 return bc_error("variable is wrong type");
1045 static int bc_error_nested_read_call(void)
1047 return bc_error("read() call inside of a read() call");
1050 static void bc_vec_grow(BcVec *v, size_t n)
1052 size_t cap = v->cap * 2;
1053 while (cap < v->len + n) cap *= 2;
1054 v->v = xrealloc(v->v, v->size * cap);
1058 static void bc_vec_init(BcVec *v, size_t esize, BcVecFree dtor)
1061 v->cap = BC_VEC_START_CAP;
1064 v->v = xmalloc(esize * BC_VEC_START_CAP);
1067 static void bc_char_vec_init(BcVec *v)
1069 bc_vec_init(v, sizeof(char), NULL);
1072 static void bc_vec_expand(BcVec *v, size_t req)
1075 v->v = xrealloc(v->v, v->size * req);
1080 static void bc_vec_pop(BcVec *v)
1084 v->dtor(v->v + (v->size * v->len));
1087 static void bc_vec_npop(BcVec *v, size_t n)
1092 size_t len = v->len - n;
1093 while (v->len > len) v->dtor(v->v + (v->size * --v->len));
1097 static void bc_vec_pop_all(BcVec *v)
1099 bc_vec_npop(v, v->len);
1102 static void bc_vec_push(BcVec *v, const void *data)
1104 if (v->len + 1 > v->cap) bc_vec_grow(v, 1);
1105 memmove(v->v + (v->size * v->len), data, v->size);
1109 static void bc_vec_pushByte(BcVec *v, char data)
1111 bc_vec_push(v, &data);
1114 static void bc_vec_pushZeroByte(BcVec *v)
1116 //bc_vec_pushByte(v, '\0');
1118 bc_vec_push(v, &const_int_0);
1121 static void bc_vec_pushAt(BcVec *v, const void *data, size_t idx)
1124 bc_vec_push(v, data);
1129 if (v->len == v->cap) bc_vec_grow(v, 1);
1131 ptr = v->v + v->size * idx;
1133 memmove(ptr + v->size, ptr, v->size * (v->len++ - idx));
1134 memmove(ptr, data, v->size);
1138 static void bc_vec_string(BcVec *v, size_t len, const char *str)
1141 bc_vec_expand(v, len + 1);
1142 memcpy(v->v, str, len);
1145 bc_vec_pushZeroByte(v);
1148 static void bc_vec_concat(BcVec *v, const char *str)
1152 if (v->len == 0) bc_vec_pushZeroByte(v);
1154 len = v->len + strlen(str);
1156 if (v->cap < len) bc_vec_grow(v, len - v->len);
1157 strcpy(v->v + v->len - 1, str);
1162 static void *bc_vec_item(const BcVec *v, size_t idx)
1164 return v->v + v->size * idx;
1167 static void *bc_vec_item_rev(const BcVec *v, size_t idx)
1169 return v->v + v->size * (v->len - idx - 1);
1172 static void *bc_vec_top(const BcVec *v)
1174 return v->v + v->size * (v->len - 1);
1177 static void bc_vec_free(void *vec)
1179 BcVec *v = (BcVec *) vec;
1184 static int bc_id_cmp(const void *e1, const void *e2)
1186 return strcmp(((const BcId *) e1)->name, ((const BcId *) e2)->name);
1189 static void bc_id_free(void *id)
1191 free(((BcId *) id)->name);
1194 static size_t bc_map_find(const BcVec *v, const void *ptr)
1196 size_t low = 0, high = v->len;
1198 while (low < high) {
1200 size_t mid = (low + high) / 2;
1201 BcId *id = bc_vec_item(v, mid);
1202 int result = bc_id_cmp(ptr, id);
1206 else if (result < 0)
1215 static int bc_map_insert(BcVec *v, const void *ptr, size_t *i)
1217 size_t n = *i = bc_map_find(v, ptr);
1220 bc_vec_push(v, ptr);
1221 else if (!bc_id_cmp(ptr, bc_vec_item(v, n)))
1222 return 0; // "was not inserted"
1224 bc_vec_pushAt(v, ptr, n);
1225 return 1; // "was inserted"
1229 static size_t bc_map_index(const BcVec *v, const void *ptr)
1231 size_t i = bc_map_find(v, ptr);
1232 if (i >= v->len) return BC_VEC_INVALID_IDX;
1233 return bc_id_cmp(ptr, bc_vec_item(v, i)) ? BC_VEC_INVALID_IDX : i;
1237 static int push_input_byte(BcVec *vec, char c)
1239 if ((c < ' ' && c != '\t' && c != '\r' && c != '\n') // also allow '\v' '\f'?
1242 // Bad chars on this line, ignore entire line
1243 bc_error_fmt("illegal character 0x%02x", c);
1246 bc_vec_pushByte(vec, (char)c);
1250 static BcStatus bc_read_line(BcVec *vec, const char *prompt)
1254 if (G_posix) prompt = "";
1260 bc_vec_pop_all(vec);
1264 #if ENABLE_FEATURE_BC_SIGNALS
1265 if (bb_got_signal) { // ^C was pressed
1267 bb_got_signal = 0; // resets G_interrupt to zero
1269 ? "\ninterrupt (type \"quit\" to exit)\n"
1270 : "\ninterrupt (type \"q\" to exit)\n"
1273 # if ENABLE_FEATURE_EDITING
1276 # define line_buf bb_common_bufsiz1
1277 n = read_line_input(G.line_input_state, prompt, line_buf, COMMON_BUFSIZE);
1278 if (n <= 0) { // read errors or EOF, or ^D, or ^C
1288 bad_chars |= push_input_byte(vec, c);
1296 fputs(prompt, stderr);
1297 IF_FEATURE_BC_SIGNALS(errno = 0;)
1300 #if ENABLE_FEATURE_BC_SIGNALS && !ENABLE_FEATURE_EDITING
1301 // Both conditions appear simultaneously, check both just in case
1302 if (errno == EINTR || bb_got_signal) {
1310 quit(); // this emits error message
1312 // Note: EOF does not append '\n', therefore:
1313 // printf 'print 123\n' | bc - works
1314 // printf 'print 123' | bc - fails (syntax error)
1317 bad_chars |= push_input_byte(vec, c);
1318 } while (c != '\n');
1320 } while (bad_chars);
1322 bc_vec_pushZeroByte(vec);
1324 return BC_STATUS_SUCCESS;
1327 static char* bc_read_file(const char *path)
1330 size_t size = ((size_t) -1);
1333 // Never returns NULL (dies on errors)
1334 buf = xmalloc_xopen_read_close(path, &size);
1336 for (i = 0; i < size; ++i) {
1338 if ((c < ' ' && c != '\t' && c != '\r' && c != '\n') // also allow '\v' '\f'?
1350 static void bc_num_setToZero(BcNum *n, size_t scale)
1357 static void bc_num_zero(BcNum *n)
1359 bc_num_setToZero(n, 0);
1362 static void bc_num_one(BcNum *n)
1364 bc_num_setToZero(n, 0);
1369 static void bc_num_ten(BcNum *n)
1371 bc_num_setToZero(n, 0);
1377 static void bc_num_init(BcNum *n, size_t req)
1379 req = req >= BC_NUM_DEF_SIZE ? req : BC_NUM_DEF_SIZE;
1380 memset(n, 0, sizeof(BcNum));
1381 n->num = xmalloc(req);
1385 static void bc_num_expand(BcNum *n, size_t req)
1387 req = req >= BC_NUM_DEF_SIZE ? req : BC_NUM_DEF_SIZE;
1389 n->num = xrealloc(n->num, req);
1394 static void bc_num_free(void *num)
1396 free(((BcNum *) num)->num);
1399 static void bc_num_copy(BcNum *d, BcNum *s)
1402 bc_num_expand(d, s->cap);
1406 memcpy(d->num, s->num, sizeof(BcDig) * d->len);
1410 static BcStatus bc_num_ulong(BcNum *n, unsigned long *result)
1415 if (n->neg) return bc_error("negative number");
1417 for (*result = 0, pow = 1, i = n->rdx; i < n->len; ++i) {
1419 unsigned long prev = *result, powprev = pow;
1421 *result += ((unsigned long) n->num[i]) * pow;
1424 if (*result < prev || pow < powprev)
1425 return bc_error("overflow");
1428 return BC_STATUS_SUCCESS;
1431 static void bc_num_ulong2num(BcNum *n, unsigned long val)
1439 if (val == 0) return;
1441 for (len = 1, i = ULONG_MAX; i != 0; i /= 10, ++len) bc_num_expand(n, len);
1442 for (ptr = n->num, i = 0; val; ++i, ++n->len, val /= 10) ptr[i] = val % 10;
1445 static void bc_num_subArrays(BcDig *restrict a, BcDig *restrict b,
1449 for (i = 0; i < len; ++i) {
1450 for (a[i] -= b[i], j = 0; a[i + j] < 0;) {
1457 static ssize_t bc_num_compare(BcDig *restrict a, BcDig *restrict b, size_t len)
1461 for (i = len - 1; i < len && !(c = a[i] - b[i]); --i);
1462 return BC_NUM_NEG(i + 1, c < 0);
1465 static ssize_t bc_num_cmp(BcNum *a, BcNum *b)
1467 size_t i, min, a_int, b_int, diff;
1468 BcDig *max_num, *min_num;
1469 bool a_max, neg = false;
1472 if (a == b) return 0;
1473 if (a->len == 0) return BC_NUM_NEG(!!b->len, !b->neg);
1474 if (b->len == 0) return BC_NUM_NEG(1, a->neg);
1484 a_int = BC_NUM_INT(a);
1485 b_int = BC_NUM_INT(b);
1487 a_max = (a->rdx > b->rdx);
1489 if (a_int != 0) return (ssize_t) a_int;
1493 diff = a->rdx - b->rdx;
1494 max_num = a->num + diff;
1499 diff = b->rdx - a->rdx;
1500 max_num = b->num + diff;
1504 cmp = bc_num_compare(max_num, min_num, b_int + min);
1505 if (cmp != 0) return BC_NUM_NEG(cmp, (!a_max) != neg);
1507 for (max_num -= diff, i = diff - 1; i < diff; --i) {
1508 if (max_num[i]) return BC_NUM_NEG(1, (!a_max) != neg);
1514 static void bc_num_truncate(BcNum *n, size_t places)
1516 if (places == 0) return;
1522 memmove(n->num, n->num + places, n->len * sizeof(BcDig));
1526 static void bc_num_extend(BcNum *n, size_t places)
1528 size_t len = n->len + places;
1532 if (n->cap < len) bc_num_expand(n, len);
1534 memmove(n->num + places, n->num, sizeof(BcDig) * n->len);
1535 memset(n->num, 0, sizeof(BcDig) * places);
1542 static void bc_num_clean(BcNum *n)
1544 while (n->len > 0 && n->num[n->len - 1] == 0) --n->len;
1547 else if (n->len < n->rdx)
1551 static void bc_num_retireMul(BcNum *n, size_t scale, bool neg1, bool neg2)
1554 bc_num_extend(n, scale - n->rdx);
1556 bc_num_truncate(n, n->rdx - scale);
1559 if (n->len != 0) n->neg = !neg1 != !neg2;
1562 static void bc_num_split(BcNum *restrict n, size_t idx, BcNum *restrict a,
1567 b->len = n->len - idx;
1569 a->rdx = b->rdx = 0;
1571 memcpy(b->num, n->num + idx, b->len * sizeof(BcDig));
1572 memcpy(a->num, n->num, idx * sizeof(BcDig));
1583 static BcStatus bc_num_shift(BcNum *n, size_t places)
1585 if (places == 0 || n->len == 0) return BC_STATUS_SUCCESS;
1586 if (places + n->len > BC_MAX_NUM)
1587 return bc_error("number too long: must be [1, BC_NUM_MAX]");
1589 if (n->rdx >= places)
1592 bc_num_extend(n, places - n->rdx);
1598 return BC_STATUS_SUCCESS;
1601 static BcStatus bc_num_inv(BcNum *a, BcNum *b, size_t scale)
1610 return bc_num_div(&one, a, b, scale);
1613 static BcStatus bc_num_a(BcNum *a, BcNum *b, BcNum *restrict c, size_t sub)
1615 BcDig *ptr, *ptr_a, *ptr_b, *ptr_c;
1616 size_t i, max, min_rdx, min_int, diff, a_int, b_int;
1619 // Because this function doesn't need to use scale (per the bc spec),
1620 // I am hijacking it to say whether it's doing an add or a subtract.
1624 if (sub && c->len) c->neg = !c->neg;
1625 return BC_STATUS_SUCCESS;
1627 else if (b->len == 0) {
1629 return BC_STATUS_SUCCESS;
1633 c->rdx = BC_MAX(a->rdx, b->rdx);
1634 min_rdx = BC_MIN(a->rdx, b->rdx);
1637 if (a->rdx > b->rdx) {
1638 diff = a->rdx - b->rdx;
1640 ptr_a = a->num + diff;
1644 diff = b->rdx - a->rdx;
1647 ptr_b = b->num + diff;
1650 for (ptr_c = c->num, i = 0; i < diff; ++i, ++c->len) ptr_c[i] = ptr[i];
1653 a_int = BC_NUM_INT(a);
1654 b_int = BC_NUM_INT(b);
1656 if (a_int > b_int) {
1667 for (carry = 0, i = 0; i < min_rdx + min_int; ++i, ++c->len) {
1668 in = ((int) ptr_a[i]) + ((int) ptr_b[i]) + carry;
1670 ptr_c[i] = (BcDig)(in % 10);
1673 for (; i < max + min_rdx; ++i, ++c->len) {
1674 in = ((int) ptr[i]) + carry;
1676 ptr_c[i] = (BcDig)(in % 10);
1679 if (carry != 0) c->num[c->len++] = (BcDig) carry;
1681 return BC_STATUS_SUCCESS; // can't make void, see bc_num_binary()
1684 static BcStatus bc_num_s(BcNum *a, BcNum *b, BcNum *restrict c, size_t sub)
1687 BcNum *minuend, *subtrahend;
1689 bool aneg, bneg, neg;
1691 // Because this function doesn't need to use scale (per the bc spec),
1692 // I am hijacking it to say whether it's doing an add or a subtract.
1696 if (sub && c->len) c->neg = !c->neg;
1697 return BC_STATUS_SUCCESS;
1699 else if (b->len == 0) {
1701 return BC_STATUS_SUCCESS;
1706 a->neg = b->neg = false;
1708 cmp = bc_num_cmp(a, b);
1714 bc_num_setToZero(c, BC_MAX(a->rdx, b->rdx));
1715 return BC_STATUS_SUCCESS;
1724 if (sub) neg = !neg;
1729 bc_num_copy(c, minuend);
1732 if (c->rdx < subtrahend->rdx) {
1733 bc_num_extend(c, subtrahend->rdx - c->rdx);
1737 start = c->rdx - subtrahend->rdx;
1739 bc_num_subArrays(c->num + start, subtrahend->num, subtrahend->len);
1743 return BC_STATUS_SUCCESS; // can't make void, see bc_num_binary()
1746 static BcStatus bc_num_k(BcNum *restrict a, BcNum *restrict b,
1750 size_t max = BC_MAX(a->len, b->len), max2 = (max + 1) / 2;
1751 BcNum l1, h1, l2, h2, m2, m1, z0, z1, z2, temp;
1754 if (a->len == 0 || b->len == 0) {
1756 return BC_STATUS_SUCCESS;
1758 aone = BC_NUM_ONE(a);
1759 if (aone || BC_NUM_ONE(b)) {
1760 bc_num_copy(c, aone ? b : a);
1761 return BC_STATUS_SUCCESS;
1764 if (a->len + b->len < BC_NUM_KARATSUBA_LEN ||
1765 a->len < BC_NUM_KARATSUBA_LEN || b->len < BC_NUM_KARATSUBA_LEN)
1770 bc_num_expand(c, a->len + b->len + 1);
1772 memset(c->num, 0, sizeof(BcDig) * c->cap);
1775 for (i = 0; i < b->len; ++i) {
1778 for (j = 0; j < a->len; ++j) {
1779 unsigned in = c->num[i + j];
1780 in += ((unsigned) a->num[j]) * ((unsigned) b->num[i]) + carry;
1781 // note: compilers prefer _unsigned_ div/const
1783 c->num[i + j] = (BcDig)(in % 10);
1786 c->num[i + j] += (BcDig) carry;
1787 len = BC_MAX(len, i + j + !!carry);
1790 // a*a <- without check below, this will not be interruptible
1791 if (G_interrupt) return BC_STATUS_FAILURE;
1796 return BC_STATUS_SUCCESS;
1799 bc_num_init(&l1, max);
1800 bc_num_init(&h1, max);
1801 bc_num_init(&l2, max);
1802 bc_num_init(&h2, max);
1803 bc_num_init(&m1, max);
1804 bc_num_init(&m2, max);
1805 bc_num_init(&z0, max);
1806 bc_num_init(&z1, max);
1807 bc_num_init(&z2, max);
1808 bc_num_init(&temp, max + max);
1810 bc_num_split(a, max2, &l1, &h1);
1811 bc_num_split(b, max2, &l2, &h2);
1813 s = bc_num_add(&h1, &l1, &m1, 0);
1815 s = bc_num_add(&h2, &l2, &m2, 0);
1818 s = bc_num_k(&h1, &h2, &z0);
1820 s = bc_num_k(&m1, &m2, &z1);
1822 s = bc_num_k(&l1, &l2, &z2);
1825 s = bc_num_sub(&z1, &z0, &temp, 0);
1827 s = bc_num_sub(&temp, &z2, &z1, 0);
1830 s = bc_num_shift(&z0, max2 * 2);
1832 s = bc_num_shift(&z1, max2);
1834 s = bc_num_add(&z0, &z1, &temp, 0);
1836 s = bc_num_add(&temp, &z2, c, 0);
1852 static BcStatus bc_num_m(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale)
1856 size_t maxrdx = BC_MAX(a->rdx, b->rdx);
1858 scale = BC_MAX(scale, a->rdx);
1859 scale = BC_MAX(scale, b->rdx);
1860 scale = BC_MIN(a->rdx + b->rdx, scale);
1861 maxrdx = BC_MAX(maxrdx, scale);
1863 bc_num_init(&cpa, a->len);
1864 bc_num_init(&cpb, b->len);
1866 bc_num_copy(&cpa, a);
1867 bc_num_copy(&cpb, b);
1868 cpa.neg = cpb.neg = false;
1870 s = bc_num_shift(&cpa, maxrdx);
1872 s = bc_num_shift(&cpb, maxrdx);
1874 s = bc_num_k(&cpa, &cpb, c);
1878 bc_num_expand(c, c->len + maxrdx);
1880 if (c->len < maxrdx) {
1881 memset(c->num + c->len, 0, (c->cap - c->len) * sizeof(BcDig));
1886 bc_num_retireMul(c, scale, a->neg, b->neg);
1894 static BcStatus bc_num_d(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale)
1896 BcStatus s = BC_STATUS_SUCCESS;
1903 return bc_error("divide by zero");
1904 else if (a->len == 0) {
1905 bc_num_setToZero(c, scale);
1906 return BC_STATUS_SUCCESS;
1908 else if (BC_NUM_ONE(b)) {
1910 bc_num_retireMul(c, scale, a->neg, b->neg);
1911 return BC_STATUS_SUCCESS;
1914 bc_num_init(&cp, BC_NUM_MREQ(a, b, scale));
1915 bc_num_copy(&cp, a);
1919 bc_num_expand(&cp, len + 2);
1920 bc_num_extend(&cp, len - cp.len);
1923 if (b->rdx > cp.rdx) bc_num_extend(&cp, b->rdx - cp.rdx);
1925 if (scale > cp.rdx) bc_num_extend(&cp, scale - cp.rdx);
1927 if (b->rdx == b->len) {
1928 for (i = 0; zero && i < len; ++i) zero = !b->num[len - i - 1];
1932 if (cp.cap == cp.len) bc_num_expand(&cp, cp.len + 1);
1934 // We want an extra zero in front to make things simpler.
1935 cp.num[cp.len++] = 0;
1938 bc_num_expand(c, cp.len);
1941 memset(c->num + end, 0, (c->cap - end) * sizeof(BcDig));
1946 for (i = end - 1; !s && i < end; --i) {
1948 for (q = 0; (!s && n[len] != 0) || bc_num_compare(n, p, len) >= 0; ++q)
1949 bc_num_subArrays(n, p, len);
1953 // 1/a <- without check below, this will not be interruptible
1955 s = BC_STATUS_FAILURE;
1960 bc_num_retireMul(c, scale, a->neg, b->neg);
1966 static BcStatus bc_num_r(BcNum *a, BcNum *b, BcNum *restrict c,
1967 BcNum *restrict d, size_t scale, size_t ts)
1974 return bc_error("divide by zero");
1977 bc_num_setToZero(d, ts);
1978 return BC_STATUS_SUCCESS;
1981 bc_num_init(&temp, d->cap);
1982 s = bc_num_d(a, b, c, scale);
1985 if (scale != 0) scale = ts;
1987 s = bc_num_m(c, b, &temp, scale);
1989 s = bc_num_sub(a, &temp, d, scale);
1992 if (ts > d->rdx && d->len) bc_num_extend(d, ts - d->rdx);
1995 bc_num_retireMul(d, ts, a->neg, b->neg);
2003 static BcStatus bc_num_rem(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale)
2007 size_t ts = BC_MAX(scale + b->rdx, a->rdx), len = BC_NUM_MREQ(a, b, ts);
2009 bc_num_init(&c1, len);
2010 s = bc_num_r(a, b, &c1, c, scale, ts);
2016 static BcStatus bc_num_p(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale)
2018 BcStatus s = BC_STATUS_SUCCESS;
2021 size_t i, powrdx, resrdx;
2024 if (b->rdx) return bc_error("non integer number");
2028 return BC_STATUS_SUCCESS;
2030 else if (a->len == 0) {
2031 bc_num_setToZero(c, scale);
2032 return BC_STATUS_SUCCESS;
2034 else if (BC_NUM_ONE(b)) {
2038 s = bc_num_inv(a, c, scale);
2045 s = bc_num_ulong(b, &pow);
2048 bc_num_init(©, a->len);
2049 bc_num_copy(©, a);
2051 if (!neg) scale = BC_MIN(a->rdx * pow, BC_MAX(scale, a->rdx));
2055 for (powrdx = a->rdx; !(pow & 1); pow >>= 1) {
2057 s = bc_num_mul(©, ©, ©, powrdx);
2059 // Not needed: bc_num_mul() has a check for ^C:
2060 //if (G_interrupt) {
2061 // s = BC_STATUS_FAILURE;
2066 bc_num_copy(c, ©);
2068 for (resrdx = powrdx, pow >>= 1; pow != 0; pow >>= 1) {
2071 s = bc_num_mul(©, ©, ©, powrdx);
2076 s = bc_num_mul(c, ©, c, resrdx);
2079 // Not needed: bc_num_mul() has a check for ^C:
2080 //if (G_interrupt) {
2081 // s = BC_STATUS_FAILURE;
2087 s = bc_num_inv(c, c, scale);
2091 if (c->rdx > scale) bc_num_truncate(c, c->rdx - scale);
2093 // We can't use bc_num_clean() here.
2094 for (zero = true, i = 0; zero && i < c->len; ++i) zero = !c->num[i];
2095 if (zero) bc_num_setToZero(c, scale);
2102 static BcStatus bc_num_binary(BcNum *a, BcNum *b, BcNum *c, size_t scale,
2103 BcNumBinaryOp op, size_t req)
2106 BcNum num2, *ptr_a, *ptr_b;
2111 memcpy(ptr_a, c, sizeof(BcNum));
2120 memcpy(ptr_b, c, sizeof(BcNum));
2128 bc_num_init(c, req);
2130 bc_num_expand(c, req);
2132 s = op(ptr_a, ptr_b, c, scale);
2134 if (init) bc_num_free(&num2);
2139 static bool bc_num_strValid(const char *val, size_t base)
2142 bool small, radix = false;
2143 size_t i, len = strlen(val);
2145 if (!len) return true;
2148 b = (BcDig)(small ? base + '0' : base - 10 + 'A');
2150 for (i = 0; i < len; ++i) {
2156 if (radix) return false;
2162 if (c < '0' || (small && c >= b) || (c > '9' && (c < 'A' || c >= b)))
2169 static void bc_num_parseDecimal(BcNum *n, const char *val)
2175 for (i = 0; val[i] == '0'; ++i);
2182 for (i = 0; zero && i < len; ++i) zero = val[i] == '0' || val[i] == '.';
2183 bc_num_expand(n, len);
2186 ptr = strchr(val, '.');
2190 n->rdx = (size_t)((val + len) - (ptr + 1));
2193 for (i = len - 1; i < len; ++n->len, i -= 1 + (i && val[i - 1] == '.'))
2194 n->num[n->len] = val[i] - '0';
2198 static void bc_num_parseBase(BcNum *n, const char *val, BcNum *base)
2201 BcNum temp, mult, result;
2205 size_t i, digits, len = strlen(val);
2209 for (i = 0; zero && i < len; ++i) zero = (val[i] == '.' || val[i] == '0');
2212 bc_num_init(&temp, BC_NUM_DEF_SIZE);
2213 bc_num_init(&mult, BC_NUM_DEF_SIZE);
2215 for (i = 0; i < len; ++i) {
2218 if (c == '.') break;
2220 v = (unsigned long) (c <= '9' ? c - '0' : c - 'A' + 10);
2222 s = bc_num_mul(n, base, &mult, 0);
2223 if (s) goto int_err;
2224 bc_num_ulong2num(&temp, v);
2225 s = bc_num_add(&mult, &temp, n, 0);
2226 if (s) goto int_err;
2231 if (c == 0) goto int_err;
2234 bc_num_init(&result, base->len);
2235 bc_num_zero(&result);
2238 for (i += 1, digits = 0; i < len; ++i, ++digits) {
2243 v = (unsigned long) (c <= '9' ? c - '0' : c - 'A' + 10);
2245 s = bc_num_mul(&result, base, &result, 0);
2247 bc_num_ulong2num(&temp, v);
2248 s = bc_num_add(&result, &temp, &result, 0);
2250 s = bc_num_mul(&mult, base, &mult, 0);
2254 s = bc_num_div(&result, &mult, &result, digits);
2256 s = bc_num_add(n, &result, n, digits);
2260 if (n->rdx < digits) bc_num_extend(n, digits - n->rdx);
2266 bc_num_free(&result);
2272 static void bc_num_printNewline(size_t *nchars, size_t line_len)
2274 if (*nchars == line_len - 1) {
2282 static void bc_num_printChar(size_t num, size_t width, bool radix,
2283 size_t *nchars, size_t line_len)
2285 (void) radix, (void) line_len;
2286 bb_putchar((char) num);
2287 *nchars = *nchars + width;
2291 static void bc_num_printDigits(size_t num, size_t width, bool radix,
2292 size_t *nchars, size_t line_len)
2296 bc_num_printNewline(nchars, line_len);
2297 bb_putchar(radix ? '.' : ' ');
2300 bc_num_printNewline(nchars, line_len);
2301 for (exp = 0, pow = 1; exp < width - 1; ++exp, pow *= 10)
2304 for (exp = 0; exp < width; pow /= 10, ++(*nchars), ++exp) {
2306 bc_num_printNewline(nchars, line_len);
2309 bb_putchar(((char) dig) + '0');
2313 static void bc_num_printHex(size_t num, size_t width, bool radix,
2314 size_t *nchars, size_t line_len)
2317 bc_num_printNewline(nchars, line_len);
2322 bc_num_printNewline(nchars, line_len);
2323 bb_putchar(bb_hexdigits_upcase[num]);
2324 *nchars = *nchars + width;
2327 static void bc_num_printDecimal(BcNum *n, size_t *nchars, size_t len)
2329 size_t i, rdx = n->rdx - 1;
2331 if (n->neg) bb_putchar('-');
2332 (*nchars) += n->neg;
2334 for (i = n->len - 1; i < n->len; --i)
2335 bc_num_printHex((size_t) n->num[i], 1, i == rdx, nchars, len);
2338 static BcStatus bc_num_printNum(BcNum *n, BcNum *base, size_t width,
2339 size_t *nchars, size_t len, BcNumDigitOp print)
2343 BcNum intp, fracp, digit, frac_len;
2344 unsigned long dig, *ptr;
2349 print(0, width, false, nchars, len);
2350 return BC_STATUS_SUCCESS;
2353 bc_vec_init(&stack, sizeof(long), NULL);
2354 bc_num_init(&intp, n->len);
2355 bc_num_init(&fracp, n->rdx);
2356 bc_num_init(&digit, width);
2357 bc_num_init(&frac_len, BC_NUM_INT(n));
2358 bc_num_copy(&intp, n);
2359 bc_num_one(&frac_len);
2361 bc_num_truncate(&intp, intp.rdx);
2362 s = bc_num_sub(n, &intp, &fracp, 0);
2365 while (intp.len != 0) {
2366 s = bc_num_divmod(&intp, base, &intp, &digit, 0);
2368 s = bc_num_ulong(&digit, &dig);
2370 bc_vec_push(&stack, &dig);
2373 for (i = 0; i < stack.len; ++i) {
2374 ptr = bc_vec_item_rev(&stack, i);
2375 print(*ptr, width, false, nchars, len);
2378 if (!n->rdx) goto err;
2380 for (radix = true; frac_len.len <= n->rdx; radix = false) {
2381 s = bc_num_mul(&fracp, base, &fracp, n->rdx);
2383 s = bc_num_ulong(&fracp, &dig);
2385 bc_num_ulong2num(&intp, dig);
2386 s = bc_num_sub(&fracp, &intp, &fracp, 0);
2388 print(dig, width, radix, nchars, len);
2389 s = bc_num_mul(&frac_len, base, &frac_len, 0);
2394 bc_num_free(&frac_len);
2395 bc_num_free(&digit);
2396 bc_num_free(&fracp);
2398 bc_vec_free(&stack);
2402 static BcStatus bc_num_printBase(BcNum *n, BcNum *base, size_t base_t,
2403 size_t *nchars, size_t line_len)
2410 if (neg) bb_putchar('-');
2415 if (base_t <= BC_NUM_MAX_IBASE) {
2417 print = bc_num_printHex;
2420 for (i = base_t - 1, width = 0; i != 0; i /= 10, ++width);
2421 print = bc_num_printDigits;
2424 s = bc_num_printNum(n, base, width, nchars, line_len, print);
2431 static BcStatus bc_num_stream(BcNum *n, BcNum *base, size_t *nchars, size_t len)
2433 return bc_num_printNum(n, base, 1, nchars, len, bc_num_printChar);
2437 static BcStatus bc_num_parse(BcNum *n, const char *val, BcNum *base,
2440 if (!bc_num_strValid(val, base_t))
2441 return bc_error("bad number string");
2444 bc_num_parseDecimal(n, val);
2446 bc_num_parseBase(n, val, base);
2448 return BC_STATUS_SUCCESS;
2451 static BcStatus bc_num_print(BcNum *n, BcNum *base, size_t base_t, bool newline,
2452 size_t *nchars, size_t line_len)
2454 BcStatus s = BC_STATUS_SUCCESS;
2456 bc_num_printNewline(nchars, line_len);
2462 else if (base_t == 10)
2463 bc_num_printDecimal(n, nchars, line_len);
2465 s = bc_num_printBase(n, base, base_t, nchars, line_len);
2475 static BcStatus bc_num_add(BcNum *a, BcNum *b, BcNum *c, size_t scale)
2477 BcNumBinaryOp op = (!a->neg == !b->neg) ? bc_num_a : bc_num_s;
2479 return bc_num_binary(a, b, c, false, op, BC_NUM_AREQ(a, b));
2482 static BcStatus bc_num_sub(BcNum *a, BcNum *b, BcNum *c, size_t scale)
2484 BcNumBinaryOp op = (!a->neg == !b->neg) ? bc_num_s : bc_num_a;
2486 return bc_num_binary(a, b, c, true, op, BC_NUM_AREQ(a, b));
2489 static BcStatus bc_num_mul(BcNum *a, BcNum *b, BcNum *c, size_t scale)
2491 size_t req = BC_NUM_MREQ(a, b, scale);
2492 return bc_num_binary(a, b, c, scale, bc_num_m, req);
2495 static BcStatus bc_num_div(BcNum *a, BcNum *b, BcNum *c, size_t scale)
2497 size_t req = BC_NUM_MREQ(a, b, scale);
2498 return bc_num_binary(a, b, c, scale, bc_num_d, req);
2501 static BcStatus bc_num_mod(BcNum *a, BcNum *b, BcNum *c, size_t scale)
2503 size_t req = BC_NUM_MREQ(a, b, scale);
2504 return bc_num_binary(a, b, c, scale, bc_num_rem, req);
2507 static BcStatus bc_num_pow(BcNum *a, BcNum *b, BcNum *c, size_t scale)
2509 return bc_num_binary(a, b, c, scale, bc_num_p, a->len * b->len + 1);
2512 static BcStatus bc_num_sqrt(BcNum *a, BcNum *restrict b, size_t scale)
2515 BcNum num1, num2, half, f, fprime, *x0, *x1, *temp;
2516 size_t pow, len, digs, digs1, resrdx, req, times = 0;
2517 ssize_t cmp = 1, cmp1 = SSIZE_MAX, cmp2 = SSIZE_MAX;
2519 req = BC_MAX(scale, a->rdx) + ((BC_NUM_INT(a) + 1) >> 1) + 1;
2520 bc_num_expand(b, req);
2523 bc_num_setToZero(b, scale);
2524 return BC_STATUS_SUCCESS;
2527 return bc_error("negative number");
2528 else if (BC_NUM_ONE(a)) {
2530 bc_num_extend(b, scale);
2531 return BC_STATUS_SUCCESS;
2534 scale = BC_MAX(scale, a->rdx) + 1;
2535 len = a->len + scale;
2537 bc_num_init(&num1, len);
2538 bc_num_init(&num2, len);
2539 bc_num_init(&half, BC_NUM_DEF_SIZE);
2545 bc_num_init(&f, len);
2546 bc_num_init(&fprime, len);
2552 pow = BC_NUM_INT(a);
2561 pow -= 2 - (pow & 1);
2563 bc_num_extend(x0, pow);
2565 // Make sure to move the radix back.
2569 x0->rdx = digs = digs1 = 0;
2571 len = BC_NUM_INT(x0) + resrdx - 1;
2573 while (cmp != 0 || digs < len) {
2575 s = bc_num_div(a, x0, &f, resrdx);
2577 s = bc_num_add(x0, &f, &fprime, resrdx);
2579 s = bc_num_mul(&fprime, &half, x1, resrdx);
2582 cmp = bc_num_cmp(x1, x0);
2583 digs = x1->len - (unsigned long long) llabs(cmp);
2585 if (cmp == cmp2 && digs == digs1)
2590 resrdx += times > 4;
2603 if (b->rdx > scale) bc_num_truncate(b, b->rdx - scale);
2606 bc_num_free(&fprime);
2614 static BcStatus bc_num_divmod(BcNum *a, BcNum *b, BcNum *c, BcNum *d,
2620 size_t ts = BC_MAX(scale + b->rdx, a->rdx), len = BC_NUM_MREQ(a, b, ts);
2623 memcpy(&num2, c, sizeof(BcNum));
2625 bc_num_init(c, len);
2630 bc_num_expand(c, len);
2633 s = bc_num_r(ptr_a, b, c, d, scale, ts);
2635 if (init) bc_num_free(&num2);
2641 static BcStatus bc_num_modexp(BcNum *a, BcNum *b, BcNum *c, BcNum *restrict d)
2644 BcNum base, exp, two, temp;
2647 return bc_error("divide by zero");
2648 if (a->rdx || b->rdx || c->rdx)
2649 return bc_error("non integer number");
2651 return bc_error("negative number");
2653 bc_num_expand(d, c->len);
2654 bc_num_init(&base, c->len);
2655 bc_num_init(&exp, b->len);
2656 bc_num_init(&two, BC_NUM_DEF_SIZE);
2657 bc_num_init(&temp, b->len);
2663 s = bc_num_rem(a, c, &base, 0);
2665 bc_num_copy(&exp, b);
2667 while (exp.len != 0) {
2669 s = bc_num_divmod(&exp, &two, &exp, &temp, 0);
2672 if (BC_NUM_ONE(&temp)) {
2673 s = bc_num_mul(d, &base, &temp, 0);
2675 s = bc_num_rem(&temp, c, d, 0);
2679 s = bc_num_mul(&base, &base, &temp, 0);
2681 s = bc_num_rem(&temp, c, &base, 0);
2695 static BcStatus bc_func_insert(BcFunc *f, char *name, bool var)
2700 for (i = 0; i < f->autos.len; ++i) {
2701 if (strcmp(name, ((BcId *) bc_vec_item(&f->autos, i))->name) == 0)
2702 return bc_error("function parameter or auto var has the same name as another");
2708 bc_vec_push(&f->autos, &a);
2710 return BC_STATUS_SUCCESS;
2714 static void bc_func_init(BcFunc *f)
2716 bc_char_vec_init(&f->code);
2717 bc_vec_init(&f->autos, sizeof(BcId), bc_id_free);
2718 bc_vec_init(&f->labels, sizeof(size_t), NULL);
2722 static void bc_func_free(void *func)
2724 BcFunc *f = (BcFunc *) func;
2725 bc_vec_free(&f->code);
2726 bc_vec_free(&f->autos);
2727 bc_vec_free(&f->labels);
2730 static void bc_array_expand(BcVec *a, size_t len);
2732 static void bc_array_init(BcVec *a, bool nums)
2735 bc_vec_init(a, sizeof(BcNum), bc_num_free);
2737 bc_vec_init(a, sizeof(BcVec), bc_vec_free);
2738 bc_array_expand(a, 1);
2741 static void bc_array_expand(BcVec *a, size_t len)
2745 if (a->size == sizeof(BcNum) && a->dtor == bc_num_free) {
2746 while (len > a->len) {
2747 bc_num_init(&data.n, BC_NUM_DEF_SIZE);
2748 bc_vec_push(a, &data.n);
2752 while (len > a->len) {
2753 bc_array_init(&data.v, true);
2754 bc_vec_push(a, &data.v);
2759 static void bc_array_copy(BcVec *d, const BcVec *s)
2764 bc_vec_expand(d, s->cap);
2767 for (i = 0; i < s->len; ++i) {
2768 BcNum *dnum = bc_vec_item(d, i), *snum = bc_vec_item(s, i);
2769 bc_num_init(dnum, snum->len);
2770 bc_num_copy(dnum, snum);
2774 static void bc_string_free(void *string)
2776 free(*((char **) string));
2780 static void bc_result_copy(BcResult *d, BcResult *src)
2786 case BC_RESULT_TEMP:
2787 case BC_RESULT_IBASE:
2788 case BC_RESULT_SCALE:
2789 case BC_RESULT_OBASE:
2791 bc_num_init(&d->d.n, src->d.n.len);
2792 bc_num_copy(&d->d.n, &src->d.n);
2797 case BC_RESULT_ARRAY:
2798 case BC_RESULT_ARRAY_ELEM:
2800 d->d.id.name = xstrdup(src->d.id.name);
2804 case BC_RESULT_CONSTANT:
2805 case BC_RESULT_LAST:
2809 memcpy(&d->d.n, &src->d.n, sizeof(BcNum));
2816 static void bc_result_free(void *result)
2818 BcResult *r = (BcResult *) result;
2822 case BC_RESULT_TEMP:
2823 case BC_RESULT_IBASE:
2824 case BC_RESULT_SCALE:
2825 case BC_RESULT_OBASE:
2827 bc_num_free(&r->d.n);
2832 case BC_RESULT_ARRAY:
2833 case BC_RESULT_ARRAY_ELEM:
2847 static void bc_lex_lineComment(BcLex *l)
2849 l->t.t = BC_LEX_WHITESPACE;
2850 while (l->i < l->len && l->buf[l->i++] != '\n');
2854 static void bc_lex_whitespace(BcLex *l)
2857 l->t.t = BC_LEX_WHITESPACE;
2858 for (c = l->buf[l->i]; c != '\n' && isspace(c); c = l->buf[++l->i]);
2861 static BcStatus bc_lex_number(BcLex *l, char start)
2863 const char *buf = l->buf + l->i;
2864 size_t len, hits = 0, bslashes = 0, i = 0, j;
2866 bool last_pt, pt = start == '.';
2869 l->t.t = BC_LEX_NUMBER;
2871 while (c != 0 && (isdigit(c) || (c >= 'A' && c <= 'F') ||
2872 (c == '.' && !pt) || (c == '\\' && buf[i + 1] == '\n')))
2886 len = i + !last_pt - bslashes * 2;
2887 if (len > BC_MAX_NUM)
2888 return bc_error("number too long: must be [1, BC_NUM_MAX]");
2890 bc_vec_pop_all(&l->t.v);
2891 bc_vec_expand(&l->t.v, len + 1);
2892 bc_vec_push(&l->t.v, &start);
2894 for (buf -= 1, j = 1; j < len + hits * 2; ++j) {
2898 // If we have hit a backslash, skip it. We don't have
2899 // to check for a newline because it's guaranteed.
2900 if (hits < bslashes && c == '\\') {
2906 bc_vec_push(&l->t.v, &c);
2909 bc_vec_pushZeroByte(&l->t.v);
2912 return BC_STATUS_SUCCESS;
2915 static BcStatus bc_lex_name(BcLex *l)
2918 const char *buf = l->buf + l->i - 1;
2921 l->t.t = BC_LEX_NAME;
2923 while ((c >= 'a' && c <= 'z') || isdigit(c) || c == '_') c = buf[++i];
2925 if (i > BC_MAX_STRING)
2926 return bc_error("name too long: must be [1, BC_NAME_MAX]");
2927 bc_vec_string(&l->t.v, i, buf);
2929 // Increment the index. We minus 1 because it has already been incremented.
2932 return BC_STATUS_SUCCESS;
2935 static void bc_lex_init(BcLex *l, BcLexNext next)
2938 bc_char_vec_init(&l->t.v);
2941 static void bc_lex_free(BcLex *l)
2943 bc_vec_free(&l->t.v);
2946 static void bc_lex_file(BcLex *l)
2948 G.err_line = l->line = 1;
2952 static BcStatus bc_lex_next(BcLex *l)
2957 if (l->t.last == BC_LEX_EOF) return bc_error("end of file");
2959 l->line += l->newline;
2960 G.err_line = l->line;
2961 l->t.t = BC_LEX_EOF;
2963 l->newline = (l->i == l->len);
2964 if (l->newline) return BC_STATUS_SUCCESS;
2966 // Loop until failure or we don't have whitespace. This
2967 // is so the parser doesn't get inundated with whitespace.
2970 } while (!s && l->t.t == BC_LEX_WHITESPACE);
2975 static BcStatus bc_lex_text(BcLex *l, const char *text)
2979 l->len = strlen(text);
2980 l->t.t = l->t.last = BC_LEX_INVALID;
2981 return bc_lex_next(l);
2985 static BcStatus bc_lex_identifier(BcLex *l)
2989 const char *buf = l->buf + l->i - 1;
2991 for (i = 0; i < ARRAY_SIZE(bc_lex_kws); ++i) {
2992 const char *keyword8 = bc_lex_kws[i].name8;
2994 while (buf[j] != '\0' && buf[j] == keyword8[j]) {
2996 if (j == 8) goto match;
2998 if (keyword8[j] != '\0')
3001 // buf starts with keyword bc_lex_kws[i]
3002 l->t.t = BC_LEX_KEY_1st_keyword + i;
3003 if (!bc_lex_kws_POSIX(i)) {
3004 s = bc_posix_error_fmt("%sthe '%.8s' keyword", "POSIX does not allow ", bc_lex_kws[i].name8);
3008 // We minus 1 because the index has already been incremented.
3010 return BC_STATUS_SUCCESS;
3016 if (l->t.v.len > 2) {
3019 // bc: POSIX only allows one character names; the following is bad: 'qwe=1
3021 unsigned len = strchrnul(buf, '\n') - buf;
3022 s = bc_posix_error_fmt("POSIX only allows one character names; the following is bad: '%.*s'", len, buf);
3028 static BcStatus bc_lex_string(BcLex *l)
3030 size_t len, nls = 0, i = l->i;
3033 l->t.t = BC_LEX_STR;
3035 for (c = l->buf[i]; c != 0 && c != '"'; c = l->buf[++i]) nls += (c == '\n');
3039 return bc_error("string end could not be found");
3043 if (len > BC_MAX_STRING)
3044 return bc_error("string too long: must be [1, BC_STRING_MAX]");
3045 bc_vec_string(&l->t.v, len, l->buf + l->i);
3049 G.err_line = l->line;
3051 return BC_STATUS_SUCCESS;
3054 static void bc_lex_assign(BcLex *l, BcLexType with, BcLexType without)
3056 if (l->buf[l->i] == '=') {
3064 static BcStatus bc_lex_comment(BcLex *l)
3067 const char *buf = l->buf;
3069 l->t.t = BC_LEX_WHITESPACE;
3082 return bc_error("comment end could not be found");
3090 G.err_line = l->line;
3092 return BC_STATUS_SUCCESS;
3095 static BcStatus bc_lex_token(BcLex *l)
3097 BcStatus s = BC_STATUS_SUCCESS;
3098 char c = l->buf[l->i++], c2;
3100 // This is the workhorse of the lexer.
3107 l->t.t = !c ? BC_LEX_EOF : BC_LEX_NLINE;
3117 bc_lex_whitespace(l);
3123 bc_lex_assign(l, BC_LEX_OP_REL_NE, BC_LEX_OP_BOOL_NOT);
3125 if (l->t.t == BC_LEX_OP_BOOL_NOT) {
3126 s = bc_POSIX_does_not_allow_bool_ops_this_is_bad("!");
3135 s = bc_lex_string(l);
3141 s = bc_POSIX_does_not_allow("'#' script comments");
3144 bc_lex_lineComment(l);
3151 bc_lex_assign(l, BC_LEX_OP_ASSIGN_MODULUS, BC_LEX_OP_MODULUS);
3160 s = bc_POSIX_does_not_allow_bool_ops_this_is_bad("&&");
3164 l->t.t = BC_LEX_OP_BOOL_AND;
3167 l->t.t = BC_LEX_INVALID;
3168 s = bc_error_bad_character('&');
3177 l->t.t = (BcLexType)(c - '(' + BC_LEX_LPAREN);
3183 bc_lex_assign(l, BC_LEX_OP_ASSIGN_MULTIPLY, BC_LEX_OP_MULTIPLY);
3192 l->t.t = BC_LEX_OP_INC;
3195 bc_lex_assign(l, BC_LEX_OP_ASSIGN_PLUS, BC_LEX_OP_PLUS);
3201 l->t.t = BC_LEX_COMMA;
3210 l->t.t = BC_LEX_OP_DEC;
3213 bc_lex_assign(l, BC_LEX_OP_ASSIGN_MINUS, BC_LEX_OP_MINUS);
3219 if (isdigit(l->buf[l->i]))
3220 s = bc_lex_number(l, c);
3222 l->t.t = BC_LEX_KEY_LAST;
3223 s = bc_POSIX_does_not_allow("a period ('.') as a shortcut for the last result");
3232 s = bc_lex_comment(l);
3234 bc_lex_assign(l, BC_LEX_OP_ASSIGN_DIVIDE, BC_LEX_OP_DIVIDE);
3255 s = bc_lex_number(l, c);
3261 l->t.t = BC_LEX_SCOLON;
3267 bc_lex_assign(l, BC_LEX_OP_REL_LE, BC_LEX_OP_REL_LT);
3273 bc_lex_assign(l, BC_LEX_OP_REL_EQ, BC_LEX_OP_ASSIGN);
3279 bc_lex_assign(l, BC_LEX_OP_REL_GE, BC_LEX_OP_REL_GT);
3286 l->t.t = (BcLexType)(c - '[' + BC_LEX_LBRACKET);
3292 if (l->buf[l->i] == '\n') {
3293 l->t.t = BC_LEX_WHITESPACE;
3297 s = bc_error_bad_character(c);
3303 bc_lex_assign(l, BC_LEX_OP_ASSIGN_POWER, BC_LEX_OP_POWER);
3334 s = bc_lex_identifier(l);
3341 l->t.t = (BcLexType)(c - '{' + BC_LEX_LBRACE);
3350 s = bc_POSIX_does_not_allow_bool_ops_this_is_bad("||");
3354 l->t.t = BC_LEX_OP_BOOL_OR;
3357 l->t.t = BC_LEX_INVALID;
3358 s = bc_error_bad_character(c);
3366 l->t.t = BC_LEX_INVALID;
3367 s = bc_error_bad_character(c);
3377 static BcStatus dc_lex_register(BcLex *l)
3379 BcStatus s = BC_STATUS_SUCCESS;
3381 if (isspace(l->buf[l->i - 1])) {
3382 bc_lex_whitespace(l);
3385 s = bc_error("extended register");
3390 bc_vec_pop_all(&l->t.v);
3391 bc_vec_push(&l->t.v, &l->buf[l->i - 1]);
3392 bc_vec_pushZeroByte(&l->t.v);
3393 l->t.t = BC_LEX_NAME;
3399 static BcStatus dc_lex_string(BcLex *l)
3401 size_t depth = 1, nls = 0, i = l->i;
3404 l->t.t = BC_LEX_STR;
3405 bc_vec_pop_all(&l->t.v);
3407 for (c = l->buf[i]; c != 0 && depth; c = l->buf[++i]) {
3409 depth += (c == '[' && (i == l->i || l->buf[i - 1] != '\\'));
3410 depth -= (c == ']' && (i == l->i || l->buf[i - 1] != '\\'));
3413 if (depth) bc_vec_push(&l->t.v, &c);
3418 return bc_error("string end could not be found");
3421 bc_vec_pushZeroByte(&l->t.v);
3422 if (i - l->i > BC_MAX_STRING)
3423 return bc_error("string too long: must be [1, BC_STRING_MAX]");
3427 G.err_line = l->line;
3429 return BC_STATUS_SUCCESS;
3432 static BcStatus dc_lex_token(BcLex *l)
3434 BcStatus s = BC_STATUS_SUCCESS;
3435 char c = l->buf[l->i++], c2;
3438 for (i = 0; i < ARRAY_SIZE(dc_lex_regs); ++i) {
3439 if (l->t.last == dc_lex_regs[i])
3440 return dc_lex_register(l);
3443 if (c >= '%' && c <= '~' &&
3444 (l->t.t = dc_lex_tokens[(c - '%')]) != BC_LEX_INVALID)
3449 // This is the workhorse of the lexer.
3454 l->t.t = BC_LEX_EOF;
3465 l->newline = (c == '\n');
3466 bc_lex_whitespace(l);
3475 l->t.t = BC_LEX_OP_REL_NE;
3477 l->t.t = BC_LEX_OP_REL_LE;
3479 l->t.t = BC_LEX_OP_REL_GE;
3481 return bc_error_bad_character(c);
3489 bc_lex_lineComment(l);
3495 if (isdigit(l->buf[l->i]))
3496 s = bc_lex_number(l, c);
3498 s = bc_error_bad_character(c);
3519 s = bc_lex_number(l, c);
3525 s = dc_lex_string(l);
3531 l->t.t = BC_LEX_INVALID;
3532 s = bc_error_bad_character(c);
3541 static void bc_program_addFunc(char *name, size_t *idx);
3543 static void bc_parse_addFunc(BcParse *p, char *name, size_t *idx)
3545 bc_program_addFunc(name, idx);
3546 p->func = bc_vec_item(&G.prog.fns, p->fidx);
3549 #define bc_parse_push(p, i) bc_vec_pushByte(&(p)->func->code, (char) (i))
3551 static void bc_parse_pushName(BcParse *p, char *name)
3553 size_t i = 0, len = strlen(name);
3555 for (; i < len; ++i) bc_parse_push(p, name[i]);
3556 bc_parse_push(p, BC_PARSE_STREND);
3561 static void bc_parse_pushIndex(BcParse *p, size_t idx)
3563 unsigned char amt, i, nums[sizeof(size_t)];
3565 for (amt = 0; idx; ++amt) {
3566 nums[amt] = (char) idx;
3567 idx = (idx & ((unsigned long) ~(UCHAR_MAX))) >> sizeof(char) * CHAR_BIT;
3570 bc_parse_push(p, amt);
3571 for (i = 0; i < amt; ++i) bc_parse_push(p, nums[i]);
3574 static void bc_parse_number(BcParse *p, BcInst *prev, size_t *nexs)
3576 char *num = xstrdup(p->l.t.v.v);
3577 size_t idx = G.prog.consts.len;
3579 bc_vec_push(&G.prog.consts, &num);
3581 bc_parse_push(p, BC_INST_NUM);
3582 bc_parse_pushIndex(p, idx);
3585 (*prev) = BC_INST_NUM;
3588 static BcStatus bc_parse_text(BcParse *p, const char *text)
3592 p->func = bc_vec_item(&G.prog.fns, p->fidx);
3594 if (!text[0] && !BC_PARSE_CAN_EXEC(p)) {
3595 p->l.t.t = BC_LEX_INVALID;
3598 if (!BC_PARSE_CAN_EXEC(p))
3599 return bc_error("file is not executable");
3602 return bc_lex_text(&p->l, text);
3605 // Called when parsing or execution detects a failure,
3606 // resets execution structures.
3607 static void bc_program_reset(void)
3612 bc_vec_npop(&G.prog.stack, G.prog.stack.len - 1);
3613 bc_vec_pop_all(&G.prog.results);
3615 f = bc_vec_item(&G.prog.fns, 0);
3616 ip = bc_vec_top(&G.prog.stack);
3617 ip->idx = f->code.len;
3620 #define bc_parse_updateFunc(p, f) \
3621 ((p)->func = bc_vec_item(&G.prog.fns, ((p)->fidx = (f))))
3623 // Called when bc/dc_parse_parse() detects a failure,
3624 // resets parsing structures.
3625 static void bc_parse_reset(BcParse *p)
3627 if (p->fidx != BC_PROG_MAIN) {
3628 p->func->nparams = 0;
3629 bc_vec_pop_all(&p->func->code);
3630 bc_vec_pop_all(&p->func->autos);
3631 bc_vec_pop_all(&p->func->labels);
3633 bc_parse_updateFunc(p, BC_PROG_MAIN);
3637 p->l.t.t = BC_LEX_EOF;
3638 p->auto_part = (p->nbraces = 0);
3640 bc_vec_npop(&p->flags, p->flags.len - 1);
3641 bc_vec_pop_all(&p->exits);
3642 bc_vec_pop_all(&p->conds);
3643 bc_vec_pop_all(&p->ops);
3648 static void bc_parse_free(BcParse *p)
3650 bc_vec_free(&p->flags);
3651 bc_vec_free(&p->exits);
3652 bc_vec_free(&p->conds);
3653 bc_vec_free(&p->ops);
3657 static void bc_parse_create(BcParse *p, size_t func,
3658 BcParseParse parse, BcLexNext next)
3660 memset(p, 0, sizeof(BcParse));
3662 bc_lex_init(&p->l, next);
3663 bc_vec_init(&p->flags, sizeof(uint8_t), NULL);
3664 bc_vec_init(&p->exits, sizeof(BcInstPtr), NULL);
3665 bc_vec_init(&p->conds, sizeof(size_t), NULL);
3666 bc_vec_pushZeroByte(&p->flags);
3667 bc_vec_init(&p->ops, sizeof(BcLexType), NULL);
3670 // p->auto_part = p->nbraces = 0; - already is
3671 bc_parse_updateFunc(p, func);
3676 #define BC_PARSE_TOP_OP(p) (*((BcLexType *) bc_vec_top(&(p)->ops)))
3677 #define BC_PARSE_LEAF(p, rparen) \
3678 (((p) >= BC_INST_NUM && (p) <= BC_INST_SQRT) || (rparen) || \
3679 (p) == BC_INST_INC_POST || (p) == BC_INST_DEC_POST)
3681 // We can calculate the conversion between tokens and exprs by subtracting the
3682 // position of the first operator in the lex enum and adding the position of the
3683 // first in the expr enum. Note: This only works for binary operators.
3684 #define BC_PARSE_TOKEN_INST(t) ((char) ((t) -BC_LEX_NEG + BC_INST_NEG))
3686 static BcStatus bc_parse_else(BcParse *p);
3687 static BcStatus bc_parse_stmt(BcParse *p);
3688 static BcStatus bc_parse_expr(BcParse *p, uint8_t flags, BcParseNext next);
3689 static BcStatus bc_parse_expr_empty_ok(BcParse *p, uint8_t flags, BcParseNext next);
3691 static BcStatus bc_parse_operator(BcParse *p, BcLexType type, size_t start,
3692 size_t *nexprs, bool next)
3694 BcStatus s = BC_STATUS_SUCCESS;
3696 char l, r = bc_parse_op_PREC(type - BC_LEX_OP_INC);
3697 bool left = bc_parse_op_LEFT(type - BC_LEX_OP_INC);
3699 while (p->ops.len > start) {
3701 t = BC_PARSE_TOP_OP(p);
3702 if (t == BC_LEX_LPAREN) break;
3704 l = bc_parse_op_PREC(t - BC_LEX_OP_INC);
3705 if (l >= r && (l != r || !left)) break;
3707 bc_parse_push(p, BC_PARSE_TOKEN_INST(t));
3708 bc_vec_pop(&p->ops);
3709 *nexprs -= t != BC_LEX_OP_BOOL_NOT && t != BC_LEX_NEG;
3712 bc_vec_push(&p->ops, &type);
3713 if (next) s = bc_lex_next(&p->l);
3718 static BcStatus bc_parse_rightParen(BcParse *p, size_t ops_bgn, size_t *nexs)
3722 if (p->ops.len <= ops_bgn)
3723 return bc_error_bad_expression();
3724 top = BC_PARSE_TOP_OP(p);
3726 while (top != BC_LEX_LPAREN) {
3728 bc_parse_push(p, BC_PARSE_TOKEN_INST(top));
3730 bc_vec_pop(&p->ops);
3731 *nexs -= top != BC_LEX_OP_BOOL_NOT && top != BC_LEX_NEG;
3733 if (p->ops.len <= ops_bgn)
3734 return bc_error_bad_expression();
3735 top = BC_PARSE_TOP_OP(p);
3738 bc_vec_pop(&p->ops);
3740 return bc_lex_next(&p->l);
3743 static BcStatus bc_parse_params(BcParse *p, uint8_t flags)
3749 s = bc_lex_next(&p->l);
3752 for (nparams = 0; p->l.t.t != BC_LEX_RPAREN; ++nparams) {
3754 flags = (flags & ~(BC_PARSE_PRINT | BC_PARSE_REL)) | BC_PARSE_ARRAY;
3755 s = bc_parse_expr(p, flags, bc_parse_next_param);
3758 comma = p->l.t.t == BC_LEX_COMMA;
3760 s = bc_lex_next(&p->l);
3765 if (comma) return bc_error_bad_token();
3766 bc_parse_push(p, BC_INST_CALL);
3767 bc_parse_pushIndex(p, nparams);
3769 return BC_STATUS_SUCCESS;
3772 static BcStatus bc_parse_call(BcParse *p, char *name, uint8_t flags)
3775 BcId entry, *entry_ptr;
3780 s = bc_parse_params(p, flags);
3783 if (p->l.t.t != BC_LEX_RPAREN) {
3784 s = bc_error_bad_token();
3788 idx = bc_map_index(&G.prog.fn_map, &entry);
3790 if (idx == BC_VEC_INVALID_IDX) {
3791 name = xstrdup(entry.name);
3792 bc_parse_addFunc(p, name, &idx);
3793 idx = bc_map_index(&G.prog.fn_map, &entry);
3799 entry_ptr = bc_vec_item(&G.prog.fn_map, idx);
3800 bc_parse_pushIndex(p, entry_ptr->idx);
3802 return bc_lex_next(&p->l);
3809 static BcStatus bc_parse_name(BcParse *p, BcInst *type, uint8_t flags)
3814 name = xstrdup(p->l.t.v.v);
3815 s = bc_lex_next(&p->l);
3818 if (p->l.t.t == BC_LEX_LBRACKET) {
3820 s = bc_lex_next(&p->l);
3823 if (p->l.t.t == BC_LEX_RBRACKET) {
3825 if (!(flags & BC_PARSE_ARRAY)) {
3826 s = bc_error_bad_expression();
3830 *type = BC_INST_ARRAY;
3834 *type = BC_INST_ARRAY_ELEM;
3836 flags &= ~(BC_PARSE_PRINT | BC_PARSE_REL);
3837 s = bc_parse_expr(p, flags, bc_parse_next_elem);
3841 s = bc_lex_next(&p->l);
3843 bc_parse_push(p, *type);
3844 bc_parse_pushName(p, name);
3846 else if (p->l.t.t == BC_LEX_LPAREN) {
3848 if (flags & BC_PARSE_NOCALL) {
3849 s = bc_error_bad_token();
3853 *type = BC_INST_CALL;
3854 s = bc_parse_call(p, name, flags);
3857 *type = BC_INST_VAR;
3858 bc_parse_push(p, BC_INST_VAR);
3859 bc_parse_pushName(p, name);
3869 static BcStatus bc_parse_read(BcParse *p)
3873 s = bc_lex_next(&p->l);
3875 if (p->l.t.t != BC_LEX_LPAREN) return bc_error_bad_token();
3877 s = bc_lex_next(&p->l);
3879 if (p->l.t.t != BC_LEX_RPAREN) return bc_error_bad_token();
3881 bc_parse_push(p, BC_INST_READ);
3883 return bc_lex_next(&p->l);
3886 static BcStatus bc_parse_builtin(BcParse *p, BcLexType type, uint8_t flags,
3891 s = bc_lex_next(&p->l);
3893 if (p->l.t.t != BC_LEX_LPAREN) return bc_error_bad_token();
3895 flags = (flags & ~(BC_PARSE_PRINT | BC_PARSE_REL)) | BC_PARSE_ARRAY;
3897 s = bc_lex_next(&p->l);
3900 s = bc_parse_expr(p, flags, bc_parse_next_rel);
3903 if (p->l.t.t != BC_LEX_RPAREN) return bc_error_bad_token();
3905 *prev = (type == BC_LEX_KEY_LENGTH) ? BC_INST_LENGTH : BC_INST_SQRT;
3906 bc_parse_push(p, *prev);
3908 return bc_lex_next(&p->l);
3911 static BcStatus bc_parse_scale(BcParse *p, BcInst *type, uint8_t flags)
3915 s = bc_lex_next(&p->l);
3918 if (p->l.t.t != BC_LEX_LPAREN) {
3919 *type = BC_INST_SCALE;
3920 bc_parse_push(p, BC_INST_SCALE);
3921 return BC_STATUS_SUCCESS;
3924 *type = BC_INST_SCALE_FUNC;
3925 flags &= ~(BC_PARSE_PRINT | BC_PARSE_REL);
3927 s = bc_lex_next(&p->l);
3930 s = bc_parse_expr(p, flags, bc_parse_next_rel);
3932 if (p->l.t.t != BC_LEX_RPAREN) return bc_error_bad_token();
3933 bc_parse_push(p, BC_INST_SCALE_FUNC);
3935 return bc_lex_next(&p->l);
3938 static BcStatus bc_parse_incdec(BcParse *p, BcInst *prev, bool *paren_expr,
3939 size_t *nexprs, uint8_t flags)
3944 BcInst etype = *prev;
3946 if (etype == BC_INST_VAR || etype == BC_INST_ARRAY_ELEM ||
3947 etype == BC_INST_SCALE || etype == BC_INST_LAST ||
3948 etype == BC_INST_IBASE || etype == BC_INST_OBASE)
3950 *prev = inst = BC_INST_INC_POST + (p->l.t.t != BC_LEX_OP_INC);
3951 bc_parse_push(p, inst);
3952 s = bc_lex_next(&p->l);
3956 *prev = inst = BC_INST_INC_PRE + (p->l.t.t != BC_LEX_OP_INC);
3959 s = bc_lex_next(&p->l);
3963 // Because we parse the next part of the expression
3964 // right here, we need to increment this.
3965 *nexprs = *nexprs + 1;
3971 s = bc_parse_name(p, prev, flags | BC_PARSE_NOCALL);
3975 case BC_LEX_KEY_IBASE:
3976 case BC_LEX_KEY_LAST:
3977 case BC_LEX_KEY_OBASE:
3979 bc_parse_push(p, type - BC_LEX_KEY_IBASE + BC_INST_IBASE);
3980 s = bc_lex_next(&p->l);
3984 case BC_LEX_KEY_SCALE:
3986 s = bc_lex_next(&p->l);
3988 if (p->l.t.t == BC_LEX_LPAREN)
3989 s = bc_error_bad_token();
3991 bc_parse_push(p, BC_INST_SCALE);
3997 s = bc_error_bad_token();
4002 if (!s) bc_parse_push(p, inst);
4008 static BcStatus bc_parse_minus(BcParse *p, BcInst *prev, size_t ops_bgn,
4009 bool rparen, size_t *nexprs)
4013 BcInst etype = *prev;
4015 s = bc_lex_next(&p->l);
4018 type = rparen || etype == BC_INST_INC_POST || etype == BC_INST_DEC_POST ||
4019 (etype >= BC_INST_NUM && etype <= BC_INST_SQRT) ?
4022 *prev = BC_PARSE_TOKEN_INST(type);
4024 // We can just push onto the op stack because this is the largest
4025 // precedence operator that gets pushed. Inc/dec does not.
4026 if (type != BC_LEX_OP_MINUS)
4027 bc_vec_push(&p->ops, &type);
4029 s = bc_parse_operator(p, type, ops_bgn, nexprs, false);
4034 static BcStatus bc_parse_string(BcParse *p, char inst)
4036 char *str = xstrdup(p->l.t.v.v);
4038 bc_parse_push(p, BC_INST_STR);
4039 bc_parse_pushIndex(p, G.prog.strs.len);
4040 bc_vec_push(&G.prog.strs, &str);
4041 bc_parse_push(p, inst);
4043 return bc_lex_next(&p->l);
4046 static BcStatus bc_parse_print(BcParse *p)
4052 s = bc_lex_next(&p->l);
4057 if (type == BC_LEX_SCOLON || type == BC_LEX_NLINE)
4058 return bc_error("bad print statement");
4060 while (!s && type != BC_LEX_SCOLON && type != BC_LEX_NLINE) {
4062 if (type == BC_LEX_STR)
4063 s = bc_parse_string(p, BC_INST_PRINT_POP);
4065 s = bc_parse_expr(p, 0, bc_parse_next_print);
4067 bc_parse_push(p, BC_INST_PRINT_POP);
4072 comma = p->l.t.t == BC_LEX_COMMA;
4073 if (comma) s = bc_lex_next(&p->l);
4078 if (comma) return bc_error_bad_token();
4080 return bc_lex_next(&p->l);
4083 static BcStatus bc_parse_return(BcParse *p)
4089 if (!BC_PARSE_FUNC(p)) return bc_error_bad_token();
4091 s = bc_lex_next(&p->l);
4095 paren = t == BC_LEX_LPAREN;
4097 if (t == BC_LEX_NLINE || t == BC_LEX_SCOLON)
4098 bc_parse_push(p, BC_INST_RET0);
4101 s = bc_parse_expr_empty_ok(p, 0, bc_parse_next_expr);
4102 if (s == BC_STATUS_PARSE_EMPTY_EXP) {
4103 bc_parse_push(p, BC_INST_RET0);
4104 s = bc_lex_next(&p->l);
4108 if (!paren || p->l.t.last != BC_LEX_RPAREN) {
4109 s = bc_POSIX_requires("parentheses around return expressions");
4113 bc_parse_push(p, BC_INST_RET);
4119 static BcStatus bc_parse_endBody(BcParse *p, bool brace)
4121 BcStatus s = BC_STATUS_SUCCESS;
4123 if (p->flags.len <= 1 || (brace && p->nbraces == 0))
4124 return bc_error_bad_token();
4128 if (p->l.t.t == BC_LEX_RBRACE) {
4129 if (!p->nbraces) return bc_error_bad_token();
4131 s = bc_lex_next(&p->l);
4135 return bc_error_bad_token();
4138 if (BC_PARSE_IF(p)) {
4142 while (p->l.t.t == BC_LEX_NLINE) {
4143 s = bc_lex_next(&p->l);
4147 bc_vec_pop(&p->flags);
4149 flag_ptr = BC_PARSE_TOP_FLAG_PTR(p);
4150 *flag_ptr = (*flag_ptr | BC_PARSE_FLAG_IF_END);
4152 if (p->l.t.t == BC_LEX_KEY_ELSE) s = bc_parse_else(p);
4154 else if (BC_PARSE_ELSE(p)) {
4159 bc_vec_pop(&p->flags);
4161 ip = bc_vec_top(&p->exits);
4162 label = bc_vec_item(&p->func->labels, ip->idx);
4163 *label = p->func->code.len;
4165 bc_vec_pop(&p->exits);
4167 else if (BC_PARSE_FUNC_INNER(p)) {
4168 bc_parse_push(p, BC_INST_RET0);
4169 bc_parse_updateFunc(p, BC_PROG_MAIN);
4170 bc_vec_pop(&p->flags);
4174 BcInstPtr *ip = bc_vec_top(&p->exits);
4175 size_t *label = bc_vec_top(&p->conds);
4177 bc_parse_push(p, BC_INST_JUMP);
4178 bc_parse_pushIndex(p, *label);
4180 label = bc_vec_item(&p->func->labels, ip->idx);
4181 *label = p->func->code.len;
4183 bc_vec_pop(&p->flags);
4184 bc_vec_pop(&p->exits);
4185 bc_vec_pop(&p->conds);
4191 static void bc_parse_startBody(BcParse *p, uint8_t flags)
4193 uint8_t *flag_ptr = BC_PARSE_TOP_FLAG_PTR(p);
4194 flags |= (*flag_ptr & (BC_PARSE_FLAG_FUNC | BC_PARSE_FLAG_LOOP));
4195 flags |= BC_PARSE_FLAG_BODY;
4196 bc_vec_push(&p->flags, &flags);
4199 static void bc_parse_noElse(BcParse *p)
4203 uint8_t *flag_ptr = BC_PARSE_TOP_FLAG_PTR(p);
4205 *flag_ptr = (*flag_ptr & ~(BC_PARSE_FLAG_IF_END));
4207 ip = bc_vec_top(&p->exits);
4208 label = bc_vec_item(&p->func->labels, ip->idx);
4209 *label = p->func->code.len;
4211 bc_vec_pop(&p->exits);
4214 static BcStatus bc_parse_if(BcParse *p)
4219 s = bc_lex_next(&p->l);
4221 if (p->l.t.t != BC_LEX_LPAREN) return bc_error_bad_token();
4223 s = bc_lex_next(&p->l);
4225 s = bc_parse_expr(p, BC_PARSE_REL, bc_parse_next_rel);
4227 if (p->l.t.t != BC_LEX_RPAREN) return bc_error_bad_token();
4229 s = bc_lex_next(&p->l);
4231 bc_parse_push(p, BC_INST_JUMP_ZERO);
4233 ip.idx = p->func->labels.len;
4234 ip.func = ip.len = 0;
4236 bc_parse_pushIndex(p, ip.idx);
4237 bc_vec_push(&p->exits, &ip);
4238 bc_vec_push(&p->func->labels, &ip.idx);
4239 bc_parse_startBody(p, BC_PARSE_FLAG_IF);
4241 return BC_STATUS_SUCCESS;
4244 static BcStatus bc_parse_else(BcParse *p)
4248 if (!BC_PARSE_IF_END(p)) return bc_error_bad_token();
4250 ip.idx = p->func->labels.len;
4251 ip.func = ip.len = 0;
4253 bc_parse_push(p, BC_INST_JUMP);
4254 bc_parse_pushIndex(p, ip.idx);
4258 bc_vec_push(&p->exits, &ip);
4259 bc_vec_push(&p->func->labels, &ip.idx);
4260 bc_parse_startBody(p, BC_PARSE_FLAG_ELSE);
4262 return bc_lex_next(&p->l);
4265 static BcStatus bc_parse_while(BcParse *p)
4270 s = bc_lex_next(&p->l);
4272 if (p->l.t.t != BC_LEX_LPAREN) return bc_error_bad_token();
4273 s = bc_lex_next(&p->l);
4276 ip.idx = p->func->labels.len;
4278 bc_vec_push(&p->func->labels, &p->func->code.len);
4279 bc_vec_push(&p->conds, &ip.idx);
4281 ip.idx = p->func->labels.len;
4285 bc_vec_push(&p->exits, &ip);
4286 bc_vec_push(&p->func->labels, &ip.idx);
4288 s = bc_parse_expr(p, BC_PARSE_REL, bc_parse_next_rel);
4290 if (p->l.t.t != BC_LEX_RPAREN) return bc_error_bad_token();
4291 s = bc_lex_next(&p->l);
4294 bc_parse_push(p, BC_INST_JUMP_ZERO);
4295 bc_parse_pushIndex(p, ip.idx);
4296 bc_parse_startBody(p, BC_PARSE_FLAG_LOOP | BC_PARSE_FLAG_LOOP_INNER);
4298 return BC_STATUS_SUCCESS;
4301 static BcStatus bc_parse_for(BcParse *p)
4305 size_t cond_idx, exit_idx, body_idx, update_idx;
4307 s = bc_lex_next(&p->l);
4309 if (p->l.t.t != BC_LEX_LPAREN) return bc_error_bad_token();
4310 s = bc_lex_next(&p->l);
4313 if (p->l.t.t != BC_LEX_SCOLON)
4314 s = bc_parse_expr(p, 0, bc_parse_next_for);
4316 s = bc_POSIX_does_not_allow_empty_X_expression_in_for("init");
4319 if (p->l.t.t != BC_LEX_SCOLON) return bc_error_bad_token();
4320 s = bc_lex_next(&p->l);
4323 cond_idx = p->func->labels.len;
4324 update_idx = cond_idx + 1;
4325 body_idx = update_idx + 1;
4326 exit_idx = body_idx + 1;
4328 bc_vec_push(&p->func->labels, &p->func->code.len);
4330 if (p->l.t.t != BC_LEX_SCOLON)
4331 s = bc_parse_expr(p, BC_PARSE_REL, bc_parse_next_for);
4333 s = bc_POSIX_does_not_allow_empty_X_expression_in_for("condition");
4336 if (p->l.t.t != BC_LEX_SCOLON) return bc_error_bad_token();
4338 s = bc_lex_next(&p->l);
4341 bc_parse_push(p, BC_INST_JUMP_ZERO);
4342 bc_parse_pushIndex(p, exit_idx);
4343 bc_parse_push(p, BC_INST_JUMP);
4344 bc_parse_pushIndex(p, body_idx);
4346 ip.idx = p->func->labels.len;
4348 bc_vec_push(&p->conds, &update_idx);
4349 bc_vec_push(&p->func->labels, &p->func->code.len);
4351 if (p->l.t.t != BC_LEX_RPAREN)
4352 s = bc_parse_expr(p, 0, bc_parse_next_rel);
4354 s = bc_POSIX_does_not_allow_empty_X_expression_in_for("update");
4358 if (p->l.t.t != BC_LEX_RPAREN) return bc_error_bad_token();
4359 bc_parse_push(p, BC_INST_JUMP);
4360 bc_parse_pushIndex(p, cond_idx);
4361 bc_vec_push(&p->func->labels, &p->func->code.len);
4367 bc_vec_push(&p->exits, &ip);
4368 bc_vec_push(&p->func->labels, &ip.idx);
4370 bc_parse_startBody(p, BC_PARSE_FLAG_LOOP | BC_PARSE_FLAG_LOOP_INNER);
4372 return BC_STATUS_SUCCESS;
4375 static BcStatus bc_parse_loopExit(BcParse *p, BcLexType type)
4381 if (!BC_PARSE_LOOP(p)) return bc_error_bad_token();
4383 if (type == BC_LEX_KEY_BREAK) {
4385 if (p->exits.len == 0) return bc_error_bad_token();
4387 i = p->exits.len - 1;
4388 ip = bc_vec_item(&p->exits, i);
4390 while (!ip->func && i < p->exits.len) ip = bc_vec_item(&p->exits, i--);
4391 if (i >= p->exits.len && !ip->func) return bc_error_bad_token();
4396 i = *((size_t *) bc_vec_top(&p->conds));
4398 bc_parse_push(p, BC_INST_JUMP);
4399 bc_parse_pushIndex(p, i);
4401 s = bc_lex_next(&p->l);
4404 if (p->l.t.t != BC_LEX_SCOLON && p->l.t.t != BC_LEX_NLINE)
4405 return bc_error_bad_token();
4407 return bc_lex_next(&p->l);
4410 static BcStatus bc_parse_func(BcParse *p)
4413 bool var, comma = false;
4417 s = bc_lex_next(&p->l);
4419 if (p->l.t.t != BC_LEX_NAME)
4420 return bc_error("bad function definition");
4422 name = xstrdup(p->l.t.v.v);
4423 bc_parse_addFunc(p, name, &p->fidx);
4425 s = bc_lex_next(&p->l);
4427 if (p->l.t.t != BC_LEX_LPAREN)
4428 return bc_error("bad function definition");
4429 s = bc_lex_next(&p->l);
4432 while (p->l.t.t != BC_LEX_RPAREN) {
4434 if (p->l.t.t != BC_LEX_NAME)
4435 return bc_error("bad function definition");
4439 name = xstrdup(p->l.t.v.v);
4440 s = bc_lex_next(&p->l);
4443 var = p->l.t.t != BC_LEX_LBRACKET;
4447 s = bc_lex_next(&p->l);
4450 if (p->l.t.t != BC_LEX_RBRACKET) {
4451 s = bc_error("bad function definition");
4455 s = bc_lex_next(&p->l);
4459 comma = p->l.t.t == BC_LEX_COMMA;
4461 s = bc_lex_next(&p->l);
4465 s = bc_func_insert(p->func, name, var);
4469 if (comma) return bc_error("bad function definition");
4471 flags = BC_PARSE_FLAG_FUNC | BC_PARSE_FLAG_FUNC_INNER | BC_PARSE_FLAG_BODY;
4472 bc_parse_startBody(p, flags);
4474 s = bc_lex_next(&p->l);
4477 if (p->l.t.t != BC_LEX_LBRACE)
4478 s = bc_POSIX_requires("the left brace be on the same line as the function header");
4487 static BcStatus bc_parse_auto(BcParse *p)
4490 bool comma, var, one;
4493 if (!p->auto_part) return bc_error_bad_token();
4494 s = bc_lex_next(&p->l);
4497 p->auto_part = comma = false;
4498 one = p->l.t.t == BC_LEX_NAME;
4500 while (p->l.t.t == BC_LEX_NAME) {
4502 name = xstrdup(p->l.t.v.v);
4503 s = bc_lex_next(&p->l);
4506 var = p->l.t.t != BC_LEX_LBRACKET;
4509 s = bc_lex_next(&p->l);
4512 if (p->l.t.t != BC_LEX_RBRACKET) {
4513 s = bc_error("bad function definition");
4517 s = bc_lex_next(&p->l);
4521 comma = p->l.t.t == BC_LEX_COMMA;
4523 s = bc_lex_next(&p->l);
4527 s = bc_func_insert(p->func, name, var);
4531 if (comma) return bc_error("bad function definition");
4532 if (!one) return bc_error("no auto variable found");
4534 if (p->l.t.t != BC_LEX_NLINE && p->l.t.t != BC_LEX_SCOLON)
4535 return bc_error_bad_token();
4537 return bc_lex_next(&p->l);
4544 static BcStatus bc_parse_body(BcParse *p, bool brace)
4546 BcStatus s = BC_STATUS_SUCCESS;
4547 uint8_t *flag_ptr = bc_vec_top(&p->flags);
4549 *flag_ptr &= ~(BC_PARSE_FLAG_BODY);
4551 if (*flag_ptr & BC_PARSE_FLAG_FUNC_INNER) {
4553 if (!brace) return bc_error_bad_token();
4554 p->auto_part = p->l.t.t != BC_LEX_KEY_AUTO;
4556 if (!p->auto_part) {
4557 s = bc_parse_auto(p);
4561 if (p->l.t.t == BC_LEX_NLINE) s = bc_lex_next(&p->l);
4564 s = bc_parse_stmt(p);
4565 if (!s && !brace) s = bc_parse_endBody(p, false);
4571 static BcStatus bc_parse_stmt(BcParse *p)
4573 BcStatus s = BC_STATUS_SUCCESS;
4579 return bc_lex_next(&p->l);
4582 case BC_LEX_KEY_ELSE:
4584 p->auto_part = false;
4590 if (!BC_PARSE_BODY(p)) return bc_error_bad_token();
4593 s = bc_lex_next(&p->l);
4596 return bc_parse_body(p, true);
4599 case BC_LEX_KEY_AUTO:
4601 return bc_parse_auto(p);
4606 p->auto_part = false;
4608 if (BC_PARSE_IF_END(p)) {
4610 return BC_STATUS_SUCCESS;
4612 else if (BC_PARSE_BODY(p))
4613 return bc_parse_body(p, false);
4623 case BC_LEX_OP_MINUS:
4624 case BC_LEX_OP_BOOL_NOT:
4628 case BC_LEX_KEY_IBASE:
4629 case BC_LEX_KEY_LAST:
4630 case BC_LEX_KEY_LENGTH:
4631 case BC_LEX_KEY_OBASE:
4632 case BC_LEX_KEY_READ:
4633 case BC_LEX_KEY_SCALE:
4634 case BC_LEX_KEY_SQRT:
4636 s = bc_parse_expr(p, BC_PARSE_PRINT, bc_parse_next_expr);
4640 case BC_LEX_KEY_ELSE:
4642 s = bc_parse_else(p);
4648 while (!s && p->l.t.t == BC_LEX_SCOLON) s = bc_lex_next(&p->l);
4654 s = bc_parse_endBody(p, true);
4660 s = bc_parse_string(p, BC_INST_PRINT_STR);
4664 case BC_LEX_KEY_BREAK:
4665 case BC_LEX_KEY_CONTINUE:
4667 s = bc_parse_loopExit(p, p->l.t.t);
4671 case BC_LEX_KEY_FOR:
4673 s = bc_parse_for(p);
4677 case BC_LEX_KEY_HALT:
4679 bc_parse_push(p, BC_INST_HALT);
4680 s = bc_lex_next(&p->l);
4690 case BC_LEX_KEY_LIMITS:
4692 // "limits" is a compile-time command,
4693 // the output is produced at _parse time_.
4694 s = bc_lex_next(&p->l);
4696 printf("BC_BASE_MAX = %u\n", BC_MAX_OBASE);
4697 printf("BC_DIM_MAX = %u\n", BC_MAX_DIM);
4698 printf("BC_SCALE_MAX = %u\n", BC_MAX_SCALE);
4699 printf("BC_STRING_MAX = %u\n", BC_MAX_STRING);
4700 printf("BC_NAME_MAX = %u\n", BC_MAX_NAME);
4701 printf("BC_NUM_MAX = %u\n", BC_MAX_NUM);
4702 printf("MAX Exponent = %lu\n", BC_MAX_EXP);
4703 printf("Number of vars = %lu\n", BC_MAX_VARS);
4707 case BC_LEX_KEY_PRINT:
4709 s = bc_parse_print(p);
4713 case BC_LEX_KEY_QUIT:
4715 // "quit" is a compile-time command. For example,
4716 // "if (0 == 1) quit" terminates when parsing the statement,
4717 // not when it is executed
4718 QUIT_OR_RETURN_TO_MAIN;
4721 case BC_LEX_KEY_RETURN:
4723 s = bc_parse_return(p);
4727 case BC_LEX_KEY_WHILE:
4729 s = bc_parse_while(p);
4735 s = bc_error_bad_token();
4743 static BcStatus bc_parse_parse(BcParse *p)
4747 if (p->l.t.t == BC_LEX_EOF)
4748 s = p->flags.len > 0 ? bc_error("block end could not be found") : bc_error("end of file");
4749 else if (p->l.t.t == BC_LEX_KEY_DEFINE) {
4750 if (!BC_PARSE_CAN_EXEC(p)) return bc_error_bad_token();
4751 s = bc_parse_func(p);
4754 s = bc_parse_stmt(p);
4756 if (s || G_interrupt) {
4758 s = BC_STATUS_FAILURE;
4764 static BcStatus bc_parse_expr_empty_ok(BcParse *p, uint8_t flags, BcParseNext next)
4766 BcStatus s = BC_STATUS_SUCCESS;
4767 BcInst prev = BC_INST_PRINT;
4768 BcLexType top, t = p->l.t.t;
4769 size_t nexprs = 0, ops_bgn = p->ops.len;
4770 uint32_t i, nparens, nrelops;
4771 bool paren_first, paren_expr, rprn, done, get_token, assign, bin_last;
4773 paren_first = p->l.t.t == BC_LEX_LPAREN;
4774 nparens = nrelops = 0;
4775 paren_expr = rprn = done = get_token = assign = false;
4778 for (; !G_interrupt && !s && !done && bc_parse_exprs(t); t = p->l.t.t) {
4784 s = bc_parse_incdec(p, &prev, &paren_expr, &nexprs, flags);
4785 rprn = get_token = bin_last = false;
4789 case BC_LEX_OP_MINUS:
4791 s = bc_parse_minus(p, &prev, ops_bgn, rprn, &nexprs);
4792 rprn = get_token = false;
4793 bin_last = prev == BC_INST_MINUS;
4797 case BC_LEX_OP_ASSIGN_POWER:
4798 case BC_LEX_OP_ASSIGN_MULTIPLY:
4799 case BC_LEX_OP_ASSIGN_DIVIDE:
4800 case BC_LEX_OP_ASSIGN_MODULUS:
4801 case BC_LEX_OP_ASSIGN_PLUS:
4802 case BC_LEX_OP_ASSIGN_MINUS:
4803 case BC_LEX_OP_ASSIGN:
4805 if (prev != BC_INST_VAR && prev != BC_INST_ARRAY_ELEM &&
4806 prev != BC_INST_SCALE && prev != BC_INST_IBASE &&
4807 prev != BC_INST_OBASE && prev != BC_INST_LAST)
4809 s = bc_error("bad assignment:"
4810 " left side must be scale,"
4811 " ibase, obase, last, var,"
4818 case BC_LEX_OP_POWER:
4819 case BC_LEX_OP_MULTIPLY:
4820 case BC_LEX_OP_DIVIDE:
4821 case BC_LEX_OP_MODULUS:
4822 case BC_LEX_OP_PLUS:
4823 case BC_LEX_OP_REL_EQ:
4824 case BC_LEX_OP_REL_LE:
4825 case BC_LEX_OP_REL_GE:
4826 case BC_LEX_OP_REL_NE:
4827 case BC_LEX_OP_REL_LT:
4828 case BC_LEX_OP_REL_GT:
4829 case BC_LEX_OP_BOOL_NOT:
4830 case BC_LEX_OP_BOOL_OR:
4831 case BC_LEX_OP_BOOL_AND:
4833 if (((t == BC_LEX_OP_BOOL_NOT) != bin_last)
4834 || (t != BC_LEX_OP_BOOL_NOT && prev == BC_INST_BOOL_NOT)
4836 return bc_error_bad_expression();
4839 nrelops += t >= BC_LEX_OP_REL_EQ && t <= BC_LEX_OP_REL_GT;
4840 prev = BC_PARSE_TOKEN_INST(t);
4841 s = bc_parse_operator(p, t, ops_bgn, &nexprs, true);
4842 rprn = get_token = false;
4843 bin_last = t != BC_LEX_OP_BOOL_NOT;
4850 if (BC_PARSE_LEAF(prev, rprn))
4851 return bc_error_bad_expression();
4853 paren_expr = rprn = bin_last = false;
4855 bc_vec_push(&p->ops, &t);
4862 if (bin_last || prev == BC_INST_BOOL_NOT)
4863 return bc_error_bad_expression();
4866 s = BC_STATUS_SUCCESS;
4871 else if (!paren_expr)
4872 return BC_STATUS_PARSE_EMPTY_EXP;
4875 paren_expr = rprn = true;
4876 get_token = bin_last = false;
4878 s = bc_parse_rightParen(p, ops_bgn, &nexprs);
4885 if (BC_PARSE_LEAF(prev, rprn))
4886 return bc_error_bad_expression();
4888 rprn = get_token = bin_last = false;
4889 s = bc_parse_name(p, &prev, flags & ~BC_PARSE_NOCALL);
4897 if (BC_PARSE_LEAF(prev, rprn))
4898 return bc_error_bad_expression();
4899 bc_parse_number(p, &prev, &nexprs);
4900 paren_expr = get_token = true;
4901 rprn = bin_last = false;
4906 case BC_LEX_KEY_IBASE:
4907 case BC_LEX_KEY_LAST:
4908 case BC_LEX_KEY_OBASE:
4910 if (BC_PARSE_LEAF(prev, rprn))
4911 return bc_error_bad_expression();
4912 prev = (char) (t - BC_LEX_KEY_IBASE + BC_INST_IBASE);
4913 bc_parse_push(p, (char) prev);
4915 paren_expr = get_token = true;
4916 rprn = bin_last = false;
4922 case BC_LEX_KEY_LENGTH:
4923 case BC_LEX_KEY_SQRT:
4925 if (BC_PARSE_LEAF(prev, rprn))
4926 return bc_error_bad_expression();
4927 s = bc_parse_builtin(p, t, flags, &prev);
4929 rprn = get_token = bin_last = false;
4935 case BC_LEX_KEY_READ:
4937 if (BC_PARSE_LEAF(prev, rprn))
4938 return bc_error_bad_expression();
4939 else if (flags & BC_PARSE_NOREAD)
4940 s = bc_error_nested_read_call();
4942 s = bc_parse_read(p);
4945 rprn = get_token = bin_last = false;
4947 prev = BC_INST_READ;
4952 case BC_LEX_KEY_SCALE:
4954 if (BC_PARSE_LEAF(prev, rprn))
4955 return bc_error_bad_expression();
4956 s = bc_parse_scale(p, &prev, flags);
4958 rprn = get_token = bin_last = false;
4960 prev = BC_INST_SCALE;
4967 s = bc_error_bad_token();
4972 if (!s && get_token) s = bc_lex_next(&p->l);
4976 if (G_interrupt) return BC_STATUS_FAILURE; // ^C: stop parsing
4978 while (p->ops.len > ops_bgn) {
4980 top = BC_PARSE_TOP_OP(p);
4981 assign = top >= BC_LEX_OP_ASSIGN_POWER && top <= BC_LEX_OP_ASSIGN;
4983 if (top == BC_LEX_LPAREN || top == BC_LEX_RPAREN)
4984 return bc_error_bad_expression();
4986 bc_parse_push(p, BC_PARSE_TOKEN_INST(top));
4988 nexprs -= top != BC_LEX_OP_BOOL_NOT && top != BC_LEX_NEG;
4989 bc_vec_pop(&p->ops);
4992 if (prev == BC_INST_BOOL_NOT || nexprs != 1)
4993 return bc_error_bad_expression();
4995 for (i = 0; i < next.len; ++i)
4996 if (t == next.tokens[i])
4998 return bc_error_bad_expression();
5001 if (!(flags & BC_PARSE_REL) && nrelops) {
5002 s = bc_POSIX_does_not_allow("comparison operators outside if or loops");
5005 else if ((flags & BC_PARSE_REL) && nrelops > 1) {
5006 s = bc_POSIX_requires("exactly one comparison operator per condition");
5010 if (flags & BC_PARSE_PRINT) {
5011 if (paren_first || !assign) bc_parse_push(p, BC_INST_PRINT);
5012 bc_parse_push(p, BC_INST_POP);
5018 static BcStatus bc_parse_expr(BcParse *p, uint8_t flags, BcParseNext next)
5022 s = bc_parse_expr_empty_ok(p, flags, next);
5023 if (s == BC_STATUS_PARSE_EMPTY_EXP)
5024 return bc_error("empty expression");
5028 static void bc_parse_init(BcParse *p, size_t func)
5030 bc_parse_create(p, func, bc_parse_parse, bc_lex_token);
5033 static BcStatus bc_parse_expression(BcParse *p, uint8_t flags)
5035 return bc_parse_expr(p, flags, bc_parse_next_read);
5042 #define DC_PARSE_BUF_LEN ((int) (sizeof(uint32_t) * CHAR_BIT))
5044 static BcStatus dc_parse_register(BcParse *p)
5049 s = bc_lex_next(&p->l);
5051 if (p->l.t.t != BC_LEX_NAME) return bc_error_bad_token();
5053 name = xstrdup(p->l.t.v.v);
5054 bc_parse_pushName(p, name);
5059 static BcStatus dc_parse_string(BcParse *p)
5061 char *str, *name, b[DC_PARSE_BUF_LEN + 1];
5062 size_t idx, len = G.prog.strs.len;
5064 sprintf(b, "%0*zu", DC_PARSE_BUF_LEN, len);
5067 str = xstrdup(p->l.t.v.v);
5068 bc_parse_push(p, BC_INST_STR);
5069 bc_parse_pushIndex(p, len);
5070 bc_vec_push(&G.prog.strs, &str);
5071 bc_parse_addFunc(p, name, &idx);
5073 return bc_lex_next(&p->l);
5076 static BcStatus dc_parse_mem(BcParse *p, uint8_t inst, bool name, bool store)
5080 bc_parse_push(p, inst);
5082 s = dc_parse_register(p);
5087 bc_parse_push(p, BC_INST_SWAP);
5088 bc_parse_push(p, BC_INST_ASSIGN);
5089 bc_parse_push(p, BC_INST_POP);
5092 return bc_lex_next(&p->l);
5095 static BcStatus dc_parse_cond(BcParse *p, uint8_t inst)
5099 bc_parse_push(p, inst);
5100 bc_parse_push(p, BC_INST_EXEC_COND);
5102 s = dc_parse_register(p);
5105 s = bc_lex_next(&p->l);
5108 if (p->l.t.t == BC_LEX_ELSE) {
5109 s = dc_parse_register(p);
5111 s = bc_lex_next(&p->l);
5114 bc_parse_push(p, BC_PARSE_STREND);
5119 static BcStatus dc_parse_token(BcParse *p, BcLexType t, uint8_t flags)
5121 BcStatus s = BC_STATUS_SUCCESS;
5124 bool assign, get_token = false;
5128 case BC_LEX_OP_REL_EQ:
5129 case BC_LEX_OP_REL_LE:
5130 case BC_LEX_OP_REL_GE:
5131 case BC_LEX_OP_REL_NE:
5132 case BC_LEX_OP_REL_LT:
5133 case BC_LEX_OP_REL_GT:
5135 s = dc_parse_cond(p, t - BC_LEX_OP_REL_EQ + BC_INST_REL_EQ);
5142 s = dc_parse_mem(p, BC_INST_ARRAY_ELEM, true, t == BC_LEX_COLON);
5148 s = dc_parse_string(p);
5155 if (t == BC_LEX_NEG) {
5156 s = bc_lex_next(&p->l);
5158 if (p->l.t.t != BC_LEX_NUMBER)
5159 return bc_error_bad_token();
5162 bc_parse_number(p, &prev, &p->nbraces);
5164 if (t == BC_LEX_NEG) bc_parse_push(p, BC_INST_NEG);
5170 case BC_LEX_KEY_READ:
5172 if (flags & BC_PARSE_NOREAD)
5173 s = bc_error_nested_read_call();
5175 bc_parse_push(p, BC_INST_READ);
5180 case BC_LEX_OP_ASSIGN:
5181 case BC_LEX_STORE_PUSH:
5183 assign = t == BC_LEX_OP_ASSIGN;
5184 inst = assign ? BC_INST_VAR : BC_INST_PUSH_TO_VAR;
5185 s = dc_parse_mem(p, inst, true, assign);
5190 case BC_LEX_LOAD_POP:
5192 inst = t == BC_LEX_LOAD_POP ? BC_INST_PUSH_VAR : BC_INST_LOAD;
5193 s = dc_parse_mem(p, inst, true, false);
5197 case BC_LEX_STORE_IBASE:
5198 case BC_LEX_STORE_SCALE:
5199 case BC_LEX_STORE_OBASE:
5201 inst = t - BC_LEX_STORE_IBASE + BC_INST_IBASE;
5202 s = dc_parse_mem(p, inst, false, true);
5208 s = bc_error_bad_token();
5214 if (!s && get_token) s = bc_lex_next(&p->l);
5219 static BcStatus dc_parse_expr(BcParse *p, uint8_t flags)
5221 BcStatus s = BC_STATUS_SUCCESS;
5225 if (flags & BC_PARSE_NOCALL) p->nbraces = G.prog.results.len;
5227 for (t = p->l.t.t; !s && t != BC_LEX_EOF; t = p->l.t.t) {
5229 inst = dc_parse_insts[t];
5231 if (inst != BC_INST_INVALID) {
5232 bc_parse_push(p, inst);
5233 s = bc_lex_next(&p->l);
5236 s = dc_parse_token(p, t, flags);
5239 if (!s && p->l.t.t == BC_LEX_EOF && (flags & BC_PARSE_NOCALL))
5240 bc_parse_push(p, BC_INST_POP_EXEC);
5245 static BcStatus dc_parse_parse(BcParse *p)
5249 if (p->l.t.t == BC_LEX_EOF)
5250 s = bc_error("end of file");
5252 s = dc_parse_expr(p, 0);
5254 if (s || G_interrupt) {
5256 s = BC_STATUS_FAILURE;
5262 static void dc_parse_init(BcParse *p, size_t func)
5264 bc_parse_create(p, func, dc_parse_parse, dc_lex_token);
5269 static void common_parse_init(BcParse *p, size_t func)
5272 IF_BC(bc_parse_init(p, func);)
5274 IF_DC(dc_parse_init(p, func);)
5278 static BcStatus common_parse_expr(BcParse *p, uint8_t flags)
5281 IF_BC(return bc_parse_expression(p, flags);)
5283 IF_DC(return dc_parse_expr(p, flags);)
5287 static BcVec* bc_program_search(char *id, bool var)
5295 v = var ? &G.prog.vars : &G.prog.arrs;
5296 map = var ? &G.prog.var_map : &G.prog.arr_map;
5300 new = bc_map_insert(map, &e, &i); // 1 if insertion was successful
5303 bc_array_init(&data.v, var);
5304 bc_vec_push(v, &data.v);
5307 ptr = bc_vec_item(map, i);
5308 if (new) ptr->name = xstrdup(e.name);
5309 return bc_vec_item(v, ptr->idx);
5312 static BcStatus bc_program_num(BcResult *r, BcNum **num, bool hex)
5314 BcStatus s = BC_STATUS_SUCCESS;
5319 case BC_RESULT_TEMP:
5320 case BC_RESULT_IBASE:
5321 case BC_RESULT_SCALE:
5322 case BC_RESULT_OBASE:
5328 case BC_RESULT_CONSTANT:
5330 char **str = bc_vec_item(&G.prog.consts, r->d.id.idx);
5331 size_t base_t, len = strlen(*str);
5334 bc_num_init(&r->d.n, len);
5336 hex = hex && len == 1;
5337 base = hex ? &G.prog.hexb : &G.prog.ib;
5338 base_t = hex ? BC_NUM_MAX_IBASE : G.prog.ib_t;
5339 s = bc_num_parse(&r->d.n, *str, base, base_t);
5342 bc_num_free(&r->d.n);
5347 r->t = BC_RESULT_TEMP;
5353 case BC_RESULT_ARRAY:
5354 case BC_RESULT_ARRAY_ELEM:
5358 v = bc_program_search(r->d.id.name, r->t == BC_RESULT_VAR);
5360 if (r->t == BC_RESULT_ARRAY_ELEM) {
5362 if (v->len <= r->d.id.idx) bc_array_expand(v, r->d.id.idx + 1);
5363 *num = bc_vec_item(v, r->d.id.idx);
5366 *num = bc_vec_top(v);
5371 case BC_RESULT_LAST:
5373 *num = &G.prog.last;
5387 static BcStatus bc_program_binOpPrep(BcResult **l, BcNum **ln,
5388 BcResult **r, BcNum **rn, bool assign)
5392 BcResultType lt, rt;
5394 if (!BC_PROG_STACK(&G.prog.results, 2))
5395 return bc_error_stack_has_too_few_elements();
5397 *r = bc_vec_item_rev(&G.prog.results, 0);
5398 *l = bc_vec_item_rev(&G.prog.results, 1);
5402 hex = assign && (lt == BC_RESULT_IBASE || lt == BC_RESULT_OBASE);
5404 s = bc_program_num(*l, ln, false);
5406 s = bc_program_num(*r, rn, hex);
5409 // We run this again under these conditions in case any vector has been
5410 // reallocated out from under the BcNums or arrays we had.
5411 if (lt == rt && (lt == BC_RESULT_VAR || lt == BC_RESULT_ARRAY_ELEM)) {
5412 s = bc_program_num(*l, ln, false);
5416 if (!BC_PROG_NUM((*l), (*ln)) && (!assign || (*l)->t != BC_RESULT_VAR))
5417 return bc_error_variable_is_wrong_type();
5418 if (!assign && !BC_PROG_NUM((*r), (*ln)))
5419 return bc_error_variable_is_wrong_type();
5424 static void bc_program_binOpRetire(BcResult *r)
5426 r->t = BC_RESULT_TEMP;
5427 bc_vec_pop(&G.prog.results);
5428 bc_vec_pop(&G.prog.results);
5429 bc_vec_push(&G.prog.results, r);
5432 static BcStatus bc_program_prep(BcResult **r, BcNum **n)
5436 if (!BC_PROG_STACK(&G.prog.results, 1))
5437 return bc_error_stack_has_too_few_elements();
5438 *r = bc_vec_top(&G.prog.results);
5440 s = bc_program_num(*r, n, false);
5443 if (!BC_PROG_NUM((*r), (*n)))
5444 return bc_error_variable_is_wrong_type();
5449 static void bc_program_retire(BcResult *r, BcResultType t)
5452 bc_vec_pop(&G.prog.results);
5453 bc_vec_push(&G.prog.results, r);
5456 static BcStatus bc_program_op(char inst)
5459 BcResult *opd1, *opd2, res;
5460 BcNum *n1, *n2 = NULL;
5462 s = bc_program_binOpPrep(&opd1, &n1, &opd2, &n2, false);
5464 bc_num_init(&res.d.n, BC_NUM_DEF_SIZE);
5466 s = bc_program_ops[inst - BC_INST_POWER](n1, n2, &res.d.n, G.prog.scale);
5468 bc_program_binOpRetire(&res);
5473 bc_num_free(&res.d.n);
5477 static BcStatus bc_program_read(void)
5479 const char *sv_file;
5485 BcFunc *f = bc_vec_item(&G.prog.fns, BC_PROG_READ);
5487 for (i = 0; i < G.prog.stack.len; ++i) {
5488 BcInstPtr *ip_ptr = bc_vec_item(&G.prog.stack, i);
5489 if (ip_ptr->func == BC_PROG_READ)
5490 return bc_error_nested_read_call();
5493 bc_vec_pop_all(&f->code);
5494 bc_char_vec_init(&buf);
5496 sv_file = G.prog.file;
5499 s = bc_read_line(&buf, "read> ");
5502 common_parse_init(&parse, BC_PROG_READ);
5503 bc_lex_file(&parse.l);
5505 s = bc_parse_text(&parse, buf.v);
5506 if (s) goto exec_err;
5507 s = common_parse_expr(&parse, BC_PARSE_NOREAD);
5508 if (s) goto exec_err;
5510 if (parse.l.t.t != BC_LEX_NLINE && parse.l.t.t != BC_LEX_EOF) {
5511 s = bc_error("bad read() expression");
5515 ip.func = BC_PROG_READ;
5517 ip.len = G.prog.results.len;
5519 // Update this pointer, just in case.
5520 f = bc_vec_item(&G.prog.fns, BC_PROG_READ);
5522 bc_vec_pushByte(&f->code, BC_INST_POP_EXEC);
5523 bc_vec_push(&G.prog.stack, &ip);
5526 G.prog.file = sv_file;
5527 bc_parse_free(&parse);
5533 static size_t bc_program_index(char *code, size_t *bgn)
5535 char amt = code[(*bgn)++], i = 0;
5538 for (; i < amt; ++i, ++(*bgn))
5539 res |= (((size_t)((int) code[*bgn]) & UCHAR_MAX) << (i * CHAR_BIT));
5544 static char *bc_program_name(char *code, size_t *bgn)
5547 char c, *s, *str = code + *bgn, *ptr = strchr(str, BC_PARSE_STREND);
5549 s = xmalloc(ptr - str + 1);
5552 for (i = 0; c != 0 && c != BC_PARSE_STREND; c = code[(*bgn)++], ++i)
5560 static void bc_program_printString(const char *str, size_t *nchars)
5562 size_t i, len = strlen(str);
5571 for (i = 0; i < len; ++i, ++(*nchars)) {
5575 if (c != '\\' || i == len - 1)
5635 // Just print the backslash and following character.
5646 static BcStatus bc_program_print(char inst, size_t idx)
5648 BcStatus s = BC_STATUS_SUCCESS;
5653 bool pop = inst != BC_INST_PRINT;
5655 if (!BC_PROG_STACK(&G.prog.results, idx + 1))
5656 return bc_error_stack_has_too_few_elements();
5658 r = bc_vec_item_rev(&G.prog.results, idx);
5659 s = bc_program_num(r, &num, false);
5662 if (BC_PROG_NUM(r, num)) {
5663 s = bc_num_print(num, &G.prog.ob, G.prog.ob_t, !pop, &G.prog.nchars, G.prog.len);
5664 if (!s) bc_num_copy(&G.prog.last, num);
5668 idx = (r->t == BC_RESULT_STR) ? r->d.id.idx : num->rdx;
5669 str = *((char **) bc_vec_item(&G.prog.strs, idx));
5671 if (inst == BC_INST_PRINT_STR) {
5672 for (i = 0, len = strlen(str); i < len; ++i) {
5675 if (c == '\n') G.prog.nchars = SIZE_MAX;
5680 bc_program_printString(str, &G.prog.nchars);
5681 if (inst == BC_INST_PRINT) bb_putchar('\n');
5685 if (!s && pop) bc_vec_pop(&G.prog.results);
5690 static BcStatus bc_program_negate(void)
5696 s = bc_program_prep(&ptr, &num);
5699 bc_num_init(&res.d.n, num->len);
5700 bc_num_copy(&res.d.n, num);
5701 if (res.d.n.len) res.d.n.neg = !res.d.n.neg;
5703 bc_program_retire(&res, BC_RESULT_TEMP);
5708 static BcStatus bc_program_logical(char inst)
5711 BcResult *opd1, *opd2, res;
5716 s = bc_program_binOpPrep(&opd1, &n1, &opd2, &n2, false);
5718 bc_num_init(&res.d.n, BC_NUM_DEF_SIZE);
5720 if (inst == BC_INST_BOOL_AND)
5721 cond = bc_num_cmp(n1, &G.prog.zero) && bc_num_cmp(n2, &G.prog.zero);
5722 else if (inst == BC_INST_BOOL_OR)
5723 cond = bc_num_cmp(n1, &G.prog.zero) || bc_num_cmp(n2, &G.prog.zero);
5726 cmp = bc_num_cmp(n1, n2);
5730 case BC_INST_REL_EQ:
5736 case BC_INST_REL_LE:
5742 case BC_INST_REL_GE:
5748 case BC_INST_REL_NE:
5754 case BC_INST_REL_LT:
5760 case BC_INST_REL_GT:
5768 (cond ? bc_num_one : bc_num_zero)(&res.d.n);
5770 bc_program_binOpRetire(&res);
5776 static BcStatus bc_program_assignStr(BcResult *r, BcVec *v,
5782 memset(&n2, 0, sizeof(BcNum));
5783 n2.rdx = res.d.id.idx = r->d.id.idx;
5784 res.t = BC_RESULT_STR;
5787 if (!BC_PROG_STACK(&G.prog.results, 2))
5788 return bc_error_stack_has_too_few_elements();
5790 bc_vec_pop(&G.prog.results);
5793 bc_vec_pop(&G.prog.results);
5795 bc_vec_push(&G.prog.results, &res);
5796 bc_vec_push(v, &n2);
5798 return BC_STATUS_SUCCESS;
5802 static BcStatus bc_program_copyToVar(char *name, bool var)
5809 if (!BC_PROG_STACK(&G.prog.results, 1))
5810 return bc_error_stack_has_too_few_elements();
5812 ptr = bc_vec_top(&G.prog.results);
5813 if ((ptr->t == BC_RESULT_ARRAY) != !var)
5814 return bc_error_variable_is_wrong_type();
5815 v = bc_program_search(name, var);
5818 if (ptr->t == BC_RESULT_STR && !var)
5819 return bc_error_variable_is_wrong_type();
5820 if (ptr->t == BC_RESULT_STR) return bc_program_assignStr(ptr, v, true);
5823 s = bc_program_num(ptr, &n, false);
5826 // Do this once more to make sure that pointers were not invalidated.
5827 v = bc_program_search(name, var);
5830 bc_num_init(&r.d.n, BC_NUM_DEF_SIZE);
5831 bc_num_copy(&r.d.n, n);
5834 bc_array_init(&r.d.v, true);
5835 bc_array_copy(&r.d.v, (BcVec *) n);
5838 bc_vec_push(v, &r.d);
5839 bc_vec_pop(&G.prog.results);
5844 static BcStatus bc_program_assign(char inst)
5847 BcResult *left, *right, res;
5848 BcNum *l = NULL, *r = NULL;
5849 unsigned long val, max;
5850 bool assign = inst == BC_INST_ASSIGN, ib, sc;
5852 s = bc_program_binOpPrep(&left, &l, &right, &r, assign);
5855 ib = left->t == BC_RESULT_IBASE;
5856 sc = left->t == BC_RESULT_SCALE;
5860 if (right->t == BC_RESULT_STR) {
5864 if (left->t != BC_RESULT_VAR)
5865 return bc_error_variable_is_wrong_type();
5866 v = bc_program_search(left->d.id.name, true);
5868 return bc_program_assignStr(right, v, false);
5872 if (left->t == BC_RESULT_CONSTANT || left->t == BC_RESULT_TEMP)
5873 return bc_error("bad assignment:"
5874 " left side must be scale,"
5875 " ibase, obase, last, var,"
5880 if (inst == BC_INST_ASSIGN_DIVIDE && !bc_num_cmp(r, &G.prog.zero))
5881 return bc_error("divide by zero");
5886 s = bc_program_ops[inst - BC_INST_ASSIGN_POWER](l, r, l, G.prog.scale);
5893 if (ib || sc || left->t == BC_RESULT_OBASE) {
5894 static const char *const msg[] = {
5895 "bad ibase; must be [2, 16]", //BC_RESULT_IBASE
5896 "bad scale; must be [0, BC_SCALE_MAX]", //BC_RESULT_SCALE
5897 NULL, //can't happen //BC_RESULT_LAST
5898 NULL, //can't happen //BC_RESULT_CONSTANT
5899 NULL, //can't happen //BC_RESULT_ONE
5900 "bad obase; must be [2, BC_BASE_MAX]", //BC_RESULT_OBASE
5904 s = bc_num_ulong(l, &val);
5907 s = left->t - BC_RESULT_IBASE;
5910 ptr = &G.prog.scale;
5913 if (val < BC_NUM_MIN_BASE)
5914 return bc_error(msg[s]);
5915 max = ib ? BC_NUM_MAX_IBASE : BC_MAX_OBASE;
5916 ptr = ib ? &G.prog.ib_t : &G.prog.ob_t;
5920 return bc_error(msg[s]);
5922 bc_num_copy(ib ? &G.prog.ib : &G.prog.ob, l);
5924 *ptr = (size_t) val;
5925 s = BC_STATUS_SUCCESS;
5928 bc_num_init(&res.d.n, l->len);
5929 bc_num_copy(&res.d.n, l);
5930 bc_program_binOpRetire(&res);
5936 #define bc_program_pushVar(code, bgn, pop, copy) \
5937 bc_program_pushVar(code, bgn)
5938 // for bc, 'pop' and 'copy' are always false
5940 static BcStatus bc_program_pushVar(char *code, size_t *bgn,
5941 bool pop, bool copy)
5943 BcStatus s = BC_STATUS_SUCCESS;
5945 char *name = bc_program_name(code, bgn);
5947 r.t = BC_RESULT_VAR;
5952 BcVec *v = bc_program_search(name, true);
5953 BcNum *num = bc_vec_top(v);
5957 if (!BC_PROG_STACK(v, 2 - copy)) {
5959 return bc_error_stack_has_too_few_elements();
5965 if (!BC_PROG_STR(num)) {
5967 r.t = BC_RESULT_TEMP;
5969 bc_num_init(&r.d.n, BC_NUM_DEF_SIZE);
5970 bc_num_copy(&r.d.n, num);
5973 r.t = BC_RESULT_STR;
5974 r.d.id.idx = num->rdx;
5977 if (!copy) bc_vec_pop(v);
5982 bc_vec_push(&G.prog.results, &r);
5987 static BcStatus bc_program_pushArray(char *code, size_t *bgn,
5990 BcStatus s = BC_STATUS_SUCCESS;
5994 r.d.id.name = bc_program_name(code, bgn);
5996 if (inst == BC_INST_ARRAY) {
5997 r.t = BC_RESULT_ARRAY;
5998 bc_vec_push(&G.prog.results, &r);
6005 s = bc_program_prep(&operand, &num);
6007 s = bc_num_ulong(num, &temp);
6010 if (temp > BC_MAX_DIM) {
6011 s = bc_error("array too long; must be [1, BC_DIM_MAX]");
6015 r.d.id.idx = (size_t) temp;
6016 bc_program_retire(&r, BC_RESULT_ARRAY_ELEM);
6020 if (s) free(r.d.id.name);
6025 static BcStatus bc_program_incdec(char inst)
6028 BcResult *ptr, res, copy;
6032 s = bc_program_prep(&ptr, &num);
6035 if (inst == BC_INST_INC_POST || inst == BC_INST_DEC_POST) {
6036 copy.t = BC_RESULT_TEMP;
6037 bc_num_init(©.d.n, num->len);
6038 bc_num_copy(©.d.n, num);
6041 res.t = BC_RESULT_ONE;
6042 inst = inst == BC_INST_INC_PRE || inst == BC_INST_INC_POST ?
6043 BC_INST_ASSIGN_PLUS :
6044 BC_INST_ASSIGN_MINUS;
6046 bc_vec_push(&G.prog.results, &res);
6047 bc_program_assign(inst);
6049 if (inst2 == BC_INST_INC_POST || inst2 == BC_INST_DEC_POST) {
6050 bc_vec_pop(&G.prog.results);
6051 bc_vec_push(&G.prog.results, ©);
6057 static BcStatus bc_program_call(char *code, size_t *idx)
6059 BcStatus s = BC_STATUS_SUCCESS;
6061 size_t i, nparams = bc_program_index(code, idx);
6068 ip.func = bc_program_index(code, idx);
6069 func = bc_vec_item(&G.prog.fns, ip.func);
6071 if (func->code.len == 0) {
6072 return bc_error("undefined function");
6074 if (nparams != func->nparams) {
6075 return bc_error_fmt("function has %u parameters, but called with %u", func->nparams, nparams);
6077 ip.len = G.prog.results.len - nparams;
6079 for (i = 0; i < nparams; ++i) {
6081 a = bc_vec_item(&func->autos, nparams - 1 - i);
6082 arg = bc_vec_top(&G.prog.results);
6084 if ((!a->idx) != (arg->t == BC_RESULT_ARRAY) || arg->t == BC_RESULT_STR)
6085 return bc_error_variable_is_wrong_type();
6087 s = bc_program_copyToVar(a->name, a->idx);
6091 for (; i < func->autos.len; ++i) {
6094 a = bc_vec_item(&func->autos, i);
6095 v = bc_program_search(a->name, a->idx);
6098 bc_num_init(¶m.n, BC_NUM_DEF_SIZE);
6099 bc_vec_push(v, ¶m.n);
6102 bc_array_init(¶m.v, true);
6103 bc_vec_push(v, ¶m.v);
6107 bc_vec_push(&G.prog.stack, &ip);
6109 return BC_STATUS_SUCCESS;
6112 static BcStatus bc_program_return(char inst)
6118 BcInstPtr *ip = bc_vec_top(&G.prog.stack);
6120 if (!BC_PROG_STACK(&G.prog.results, ip->len + inst == BC_INST_RET))
6121 return bc_error_stack_has_too_few_elements();
6123 f = bc_vec_item(&G.prog.fns, ip->func);
6124 res.t = BC_RESULT_TEMP;
6126 if (inst == BC_INST_RET) {
6129 BcResult *operand = bc_vec_top(&G.prog.results);
6131 s = bc_program_num(operand, &num, false);
6133 bc_num_init(&res.d.n, num->len);
6134 bc_num_copy(&res.d.n, num);
6137 bc_num_init(&res.d.n, BC_NUM_DEF_SIZE);
6138 bc_num_zero(&res.d.n);
6141 // We need to pop arguments as well, so this takes that into account.
6142 for (i = 0; i < f->autos.len; ++i) {
6145 BcId *a = bc_vec_item(&f->autos, i);
6147 v = bc_program_search(a->name, a->idx);
6151 bc_vec_npop(&G.prog.results, G.prog.results.len - ip->len);
6152 bc_vec_push(&G.prog.results, &res);
6153 bc_vec_pop(&G.prog.stack);
6155 return BC_STATUS_SUCCESS;
6159 static unsigned long bc_program_scale(BcNum *n)
6161 return (unsigned long) n->rdx;
6164 static unsigned long bc_program_len(BcNum *n)
6166 unsigned long len = n->len;
6169 if (n->rdx != n->len) return len;
6170 for (i = n->len - 1; i < n->len && n->num[i] == 0; --len, --i);
6175 static BcStatus bc_program_builtin(char inst)
6181 bool len = inst == BC_INST_LENGTH;
6183 if (!BC_PROG_STACK(&G.prog.results, 1))
6184 return bc_error_stack_has_too_few_elements();
6185 opnd = bc_vec_top(&G.prog.results);
6187 s = bc_program_num(opnd, &num, false);
6191 if (!BC_PROG_NUM(opnd, num) && !len)
6192 return bc_error_variable_is_wrong_type();
6195 bc_num_init(&res.d.n, BC_NUM_DEF_SIZE);
6197 if (inst == BC_INST_SQRT) s = bc_num_sqrt(num, &res.d.n, G.prog.scale);
6199 else if (len != 0 && opnd->t == BC_RESULT_ARRAY) {
6200 bc_num_ulong2num(&res.d.n, (unsigned long) ((BcVec *) num)->len);
6204 else if (len != 0 && !BC_PROG_NUM(opnd, num)) {
6207 size_t idx = opnd->t == BC_RESULT_STR ? opnd->d.id.idx : num->rdx;
6209 str = bc_vec_item(&G.prog.strs, idx);
6210 bc_num_ulong2num(&res.d.n, strlen(*str));
6214 BcProgramBuiltIn f = len ? bc_program_len : bc_program_scale;
6215 bc_num_ulong2num(&res.d.n, f(num));
6218 bc_program_retire(&res, BC_RESULT_TEMP);
6224 static BcStatus bc_program_divmod(void)
6227 BcResult *opd1, *opd2, res, res2;
6228 BcNum *n1, *n2 = NULL;
6230 s = bc_program_binOpPrep(&opd1, &n1, &opd2, &n2, false);
6233 bc_num_init(&res.d.n, BC_NUM_DEF_SIZE);
6234 bc_num_init(&res2.d.n, n2->len);
6236 s = bc_num_divmod(n1, n2, &res2.d.n, &res.d.n, G.prog.scale);
6239 bc_program_binOpRetire(&res2);
6240 res.t = BC_RESULT_TEMP;
6241 bc_vec_push(&G.prog.results, &res);
6246 bc_num_free(&res2.d.n);
6247 bc_num_free(&res.d.n);
6251 static BcStatus bc_program_modexp(void)
6254 BcResult *r1, *r2, *r3, res;
6255 BcNum *n1, *n2, *n3;
6257 if (!BC_PROG_STACK(&G.prog.results, 3))
6258 return bc_error_stack_has_too_few_elements();
6259 s = bc_program_binOpPrep(&r2, &n2, &r3, &n3, false);
6262 r1 = bc_vec_item_rev(&G.prog.results, 2);
6263 s = bc_program_num(r1, &n1, false);
6265 if (!BC_PROG_NUM(r1, n1))
6266 return bc_error_variable_is_wrong_type();
6268 // Make sure that the values have their pointers updated, if necessary.
6269 if (r1->t == BC_RESULT_VAR || r1->t == BC_RESULT_ARRAY_ELEM) {
6271 if (r1->t == r2->t) {
6272 s = bc_program_num(r2, &n2, false);
6276 if (r1->t == r3->t) {
6277 s = bc_program_num(r3, &n3, false);
6282 bc_num_init(&res.d.n, n3->len);
6283 s = bc_num_modexp(n1, n2, n3, &res.d.n);
6286 bc_vec_pop(&G.prog.results);
6287 bc_program_binOpRetire(&res);
6292 bc_num_free(&res.d.n);
6296 static void bc_program_stackLen(void)
6299 size_t len = G.prog.results.len;
6301 res.t = BC_RESULT_TEMP;
6303 bc_num_init(&res.d.n, BC_NUM_DEF_SIZE);
6304 bc_num_ulong2num(&res.d.n, len);
6305 bc_vec_push(&G.prog.results, &res);
6308 static BcStatus bc_program_asciify(void)
6312 BcNum *num = NULL, n;
6313 char *str, *str2, c;
6314 size_t len = G.prog.strs.len, idx;
6317 if (!BC_PROG_STACK(&G.prog.results, 1))
6318 return bc_error_stack_has_too_few_elements();
6319 r = bc_vec_top(&G.prog.results);
6321 s = bc_program_num(r, &num, false);
6324 if (BC_PROG_NUM(r, num)) {
6326 bc_num_init(&n, BC_NUM_DEF_SIZE);
6327 bc_num_copy(&n, num);
6328 bc_num_truncate(&n, n.rdx);
6330 s = bc_num_mod(&n, &G.prog.strmb, &n, 0);
6331 if (s) goto num_err;
6332 s = bc_num_ulong(&n, &val);
6333 if (s) goto num_err;
6340 idx = (r->t == BC_RESULT_STR) ? r->d.id.idx : num->rdx;
6341 str2 = *((char **) bc_vec_item(&G.prog.strs, idx));
6349 str2 = xstrdup(str);
6350 bc_program_addFunc(str2, &idx);
6352 if (idx != len + BC_PROG_REQ_FUNCS) {
6354 for (idx = 0; idx < G.prog.strs.len; ++idx) {
6355 if (!strcmp(*((char **) bc_vec_item(&G.prog.strs, idx)), str)) {
6364 bc_vec_push(&G.prog.strs, &str);
6366 res.t = BC_RESULT_STR;
6368 bc_vec_pop(&G.prog.results);
6369 bc_vec_push(&G.prog.results, &res);
6371 return BC_STATUS_SUCCESS;
6378 static BcStatus bc_program_printStream(void)
6386 if (!BC_PROG_STACK(&G.prog.results, 1))
6387 return bc_error_stack_has_too_few_elements();
6388 r = bc_vec_top(&G.prog.results);
6390 s = bc_program_num(r, &n, false);
6393 if (BC_PROG_NUM(r, n))
6394 s = bc_num_stream(n, &G.prog.strmb, &G.prog.nchars, G.prog.len);
6396 idx = (r->t == BC_RESULT_STR) ? r->d.id.idx : n->rdx;
6397 str = *((char **) bc_vec_item(&G.prog.strs, idx));
6404 static BcStatus bc_program_nquit(void)
6411 s = bc_program_prep(&opnd, &num);
6413 s = bc_num_ulong(num, &val);
6416 bc_vec_pop(&G.prog.results);
6418 if (G.prog.stack.len < val)
6419 return bc_error_stack_has_too_few_elements();
6420 if (G.prog.stack.len == val) {
6421 QUIT_OR_RETURN_TO_MAIN;
6424 bc_vec_npop(&G.prog.stack, val);
6429 static BcStatus bc_program_execStr(char *code, size_t *bgn,
6432 BcStatus s = BC_STATUS_SUCCESS;
6442 if (!BC_PROG_STACK(&G.prog.results, 1))
6443 return bc_error_stack_has_too_few_elements();
6445 r = bc_vec_top(&G.prog.results);
6449 char *name, *then_name = bc_program_name(code, bgn), *else_name = NULL;
6451 if (code[*bgn] == BC_PARSE_STREND)
6454 else_name = bc_program_name(code, bgn);
6456 exec = r->d.n.len != 0;
6460 else if (else_name != NULL) {
6467 v = bc_program_search(name, true);
6474 if (!exec) goto exit;
6475 if (!BC_PROG_STR(n)) {
6476 s = bc_error_variable_is_wrong_type();
6484 if (r->t == BC_RESULT_STR)
6486 else if (r->t == BC_RESULT_VAR) {
6487 s = bc_program_num(r, &n, false);
6488 if (s || !BC_PROG_STR(n)) goto exit;
6495 fidx = sidx + BC_PROG_REQ_FUNCS;
6497 str = bc_vec_item(&G.prog.strs, sidx);
6498 f = bc_vec_item(&G.prog.fns, fidx);
6500 if (f->code.len == 0) {
6501 common_parse_init(&prs, fidx);
6502 s = bc_parse_text(&prs, *str);
6504 s = common_parse_expr(&prs, BC_PARSE_NOCALL);
6507 if (prs.l.t.t != BC_LEX_EOF) {
6508 s = bc_error_bad_expression();
6512 bc_parse_free(&prs);
6516 ip.len = G.prog.results.len;
6519 bc_vec_pop(&G.prog.results);
6520 bc_vec_push(&G.prog.stack, &ip);
6522 return BC_STATUS_SUCCESS;
6525 bc_parse_free(&prs);
6526 f = bc_vec_item(&G.prog.fns, fidx);
6527 bc_vec_pop_all(&f->code);
6529 bc_vec_pop(&G.prog.results);
6534 static void bc_program_pushGlobal(char inst)
6539 res.t = inst - BC_INST_IBASE + BC_RESULT_IBASE;
6540 if (inst == BC_INST_IBASE)
6541 val = (unsigned long) G.prog.ib_t;
6542 else if (inst == BC_INST_SCALE)
6543 val = (unsigned long) G.prog.scale;
6545 val = (unsigned long) G.prog.ob_t;
6547 bc_num_init(&res.d.n, BC_NUM_DEF_SIZE);
6548 bc_num_ulong2num(&res.d.n, val);
6549 bc_vec_push(&G.prog.results, &res);
6552 static void bc_program_addFunc(char *name, size_t *idx)
6554 BcId entry, *entry_ptr;
6559 entry.idx = G.prog.fns.len;
6561 inserted = bc_map_insert(&G.prog.fn_map, &entry, idx);
6562 if (!inserted) free(name);
6564 entry_ptr = bc_vec_item(&G.prog.fn_map, *idx);
6565 *idx = entry_ptr->idx;
6569 BcFunc *func = bc_vec_item(&G.prog.fns, entry_ptr->idx);
6571 // We need to reset these, so the function can be repopulated.
6573 bc_vec_pop_all(&func->autos);
6574 bc_vec_pop_all(&func->code);
6575 bc_vec_pop_all(&func->labels);
6579 bc_vec_push(&G.prog.fns, &f);
6583 static BcStatus bc_program_exec(void)
6585 BcStatus s = BC_STATUS_SUCCESS;
6589 BcInstPtr *ip = bc_vec_top(&G.prog.stack);
6590 BcFunc *func = bc_vec_item(&G.prog.fns, ip->func);
6591 char *code = func->code.v;
6594 while (!s && ip->idx < func->code.len) {
6596 char inst = code[(ip->idx)++];
6601 case BC_INST_JUMP_ZERO:
6603 s = bc_program_prep(&ptr, &num);
6605 cond = !bc_num_cmp(num, &G.prog.zero);
6606 bc_vec_pop(&G.prog.results);
6612 idx = bc_program_index(code, &ip->idx);
6613 addr = bc_vec_item(&func->labels, idx);
6614 if (inst == BC_INST_JUMP || cond) ip->idx = *addr;
6620 s = bc_program_call(code, &ip->idx);
6624 case BC_INST_INC_PRE:
6625 case BC_INST_DEC_PRE:
6626 case BC_INST_INC_POST:
6627 case BC_INST_DEC_POST:
6629 s = bc_program_incdec(inst);
6635 QUIT_OR_RETURN_TO_MAIN;
6642 s = bc_program_return(inst);
6646 case BC_INST_BOOL_OR:
6647 case BC_INST_BOOL_AND:
6649 case BC_INST_REL_EQ:
6650 case BC_INST_REL_LE:
6651 case BC_INST_REL_GE:
6652 case BC_INST_REL_NE:
6653 case BC_INST_REL_LT:
6654 case BC_INST_REL_GT:
6656 s = bc_program_logical(inst);
6662 s = bc_program_read();
6668 s = bc_program_pushVar(code, &ip->idx, false, false);
6672 case BC_INST_ARRAY_ELEM:
6675 s = bc_program_pushArray(code, &ip->idx, inst);
6681 r.t = BC_RESULT_LAST;
6682 bc_vec_push(&G.prog.results, &r);
6690 bc_program_pushGlobal(inst);
6694 case BC_INST_SCALE_FUNC:
6695 case BC_INST_LENGTH:
6698 s = bc_program_builtin(inst);
6704 r.t = BC_RESULT_CONSTANT;
6705 r.d.id.idx = bc_program_index(code, &ip->idx);
6706 bc_vec_push(&G.prog.results, &r);
6712 if (!BC_PROG_STACK(&G.prog.results, 1))
6713 s = bc_error_stack_has_too_few_elements();
6715 bc_vec_pop(&G.prog.results);
6719 case BC_INST_POP_EXEC:
6721 bc_vec_pop(&G.prog.stack);
6726 case BC_INST_PRINT_POP:
6727 case BC_INST_PRINT_STR:
6729 s = bc_program_print(inst, 0);
6735 r.t = BC_RESULT_STR;
6736 r.d.id.idx = bc_program_index(code, &ip->idx);
6737 bc_vec_push(&G.prog.results, &r);
6742 case BC_INST_MULTIPLY:
6743 case BC_INST_DIVIDE:
6744 case BC_INST_MODULUS:
6748 s = bc_program_op(inst);
6752 case BC_INST_BOOL_NOT:
6754 s = bc_program_prep(&ptr, &num);
6757 bc_num_init(&r.d.n, BC_NUM_DEF_SIZE);
6758 (!bc_num_cmp(num, &G.prog.zero) ? bc_num_one : bc_num_zero)(&r.d.n);
6759 bc_program_retire(&r, BC_RESULT_TEMP);
6766 s = bc_program_negate();
6771 case BC_INST_ASSIGN_POWER:
6772 case BC_INST_ASSIGN_MULTIPLY:
6773 case BC_INST_ASSIGN_DIVIDE:
6774 case BC_INST_ASSIGN_MODULUS:
6775 case BC_INST_ASSIGN_PLUS:
6776 case BC_INST_ASSIGN_MINUS:
6778 case BC_INST_ASSIGN:
6780 s = bc_program_assign(inst);
6784 case BC_INST_MODEXP:
6786 s = bc_program_modexp();
6790 case BC_INST_DIVMOD:
6792 s = bc_program_divmod();
6796 case BC_INST_EXECUTE:
6797 case BC_INST_EXEC_COND:
6799 cond = inst == BC_INST_EXEC_COND;
6800 s = bc_program_execStr(code, &ip->idx, cond);
6804 case BC_INST_PRINT_STACK:
6806 for (idx = 0; !s && idx < G.prog.results.len; ++idx)
6807 s = bc_program_print(BC_INST_PRINT, idx);
6811 case BC_INST_CLEAR_STACK:
6813 bc_vec_pop_all(&G.prog.results);
6817 case BC_INST_STACK_LEN:
6819 bc_program_stackLen();
6823 case BC_INST_DUPLICATE:
6825 if (!BC_PROG_STACK(&G.prog.results, 1))
6826 return bc_error_stack_has_too_few_elements();
6827 ptr = bc_vec_top(&G.prog.results);
6828 bc_result_copy(&r, ptr);
6829 bc_vec_push(&G.prog.results, &r);
6837 if (!BC_PROG_STACK(&G.prog.results, 2))
6838 return bc_error_stack_has_too_few_elements();
6840 ptr = bc_vec_item_rev(&G.prog.results, 0);
6841 ptr2 = bc_vec_item_rev(&G.prog.results, 1);
6842 memcpy(&r, ptr, sizeof(BcResult));
6843 memcpy(ptr, ptr2, sizeof(BcResult));
6844 memcpy(ptr2, &r, sizeof(BcResult));
6849 case BC_INST_ASCIIFY:
6851 s = bc_program_asciify();
6855 case BC_INST_PRINT_STREAM:
6857 s = bc_program_printStream();
6862 case BC_INST_PUSH_VAR:
6864 bool copy = inst == BC_INST_LOAD;
6865 s = bc_program_pushVar(code, &ip->idx, true, copy);
6869 case BC_INST_PUSH_TO_VAR:
6871 char *name = bc_program_name(code, &ip->idx);
6872 s = bc_program_copyToVar(name, true);
6879 if (G.prog.stack.len <= 2)
6880 QUIT_OR_RETURN_TO_MAIN;
6881 bc_vec_npop(&G.prog.stack, 2);
6887 s = bc_program_nquit();
6893 if (s || G_interrupt) {
6898 // If the stack has changed, pointers may be invalid.
6899 ip = bc_vec_top(&G.prog.stack);
6900 func = bc_vec_item(&G.prog.fns, ip->func);
6901 code = func->code.v;
6908 static void bc_vm_info(void)
6910 printf("%s "BB_VER"\n"
6911 "Copyright (c) 2018 Gavin D. Howard and contributors\n"
6912 "Report bugs at: https://github.com/gavinhoward/bc\n"
6913 "This is free software with ABSOLUTELY NO WARRANTY\n"
6917 static void bc_args(char **argv)
6923 #if ENABLE_FEATURE_BC_LONG_OPTIONS
6924 opts = option_mask32 |= getopt32long(argv, "wvsqli",
6925 "warn\0" No_argument "w"
6926 "version\0" No_argument "v"
6927 "standard\0" No_argument "s"
6928 "quiet\0" No_argument "q"
6929 "mathlib\0" No_argument "l"
6930 "interactive\0" No_argument "i"
6933 opts = option_mask32 |= getopt32(argv, "wvsqli");
6935 if (getenv("POSIXLY_CORRECT"))
6936 option_mask32 |= BC_FLAG_S;
6938 ///should be in bc_vm_run() instead??
6939 if (opts & BC_FLAG_V) {
6944 for (i = optind; argv[i]; ++i)
6945 bc_vec_push(&G.files, argv + i);
6948 static void bc_vm_envArgs(void)
6952 char *env_args = getenv("BC_ENV_ARGS");
6954 if (!env_args) return;
6956 G.env_args = xstrdup(env_args);
6959 bc_vec_init(&v, sizeof(char *), NULL);
6961 while (*(buf = skip_whitespace(buf)) != '\0') {
6962 bc_vec_push(&v, &buf);
6963 buf = skip_non_whitespace(buf);
6969 // NULL terminate, and pass argv[] so that first arg is argv[1]
6970 if (sizeof(int) == sizeof(char*)) {
6971 bc_vec_push(&v, &const_int_0);
6973 static char *const nullptr = NULL;
6974 bc_vec_push(&v, &nullptr);
6976 bc_args(((char **)v.v) - 1);
6982 static unsigned bc_vm_envLen(const char *var)
6988 len = BC_NUM_PRINT_WIDTH;
6989 if (!lenv) return len;
6991 len = bb_strtou(lenv, NULL, 10) - 1;
6992 if (errno || len < 2 || len >= INT_MAX)
6993 len = BC_NUM_PRINT_WIDTH;
6998 static BcStatus bc_vm_process(const char *text)
7000 BcStatus s = bc_parse_text(&G.prs, text);
7004 while (G.prs.l.t.t != BC_LEX_EOF) {
7005 s = G.prs.parse(&G.prs);
7009 if (BC_PARSE_CAN_EXEC(&G.prs)) {
7010 s = bc_program_exec();
7019 static BcStatus bc_vm_file(const char *file)
7021 const char *sv_file;
7027 data = bc_read_file(file);
7028 if (!data) return bc_error_fmt("file '%s' is not text", file);
7030 sv_file = G.prog.file;
7032 bc_lex_file(&G.prs.l);
7033 s = bc_vm_process(data);
7036 main_func = bc_vec_item(&G.prog.fns, BC_PROG_MAIN);
7037 ip = bc_vec_item(&G.prog.stack, 0);
7039 if (main_func->code.len < ip->idx)
7040 s = bc_error_fmt("file '%s' is not executable", file);
7043 G.prog.file = sv_file;
7048 static BcStatus bc_vm_stdin(void)
7052 size_t len, i, str = 0;
7053 bool comment = false;
7056 bc_lex_file(&G.prs.l);
7058 bc_char_vec_init(&buffer);
7059 bc_char_vec_init(&buf);
7060 bc_vec_pushZeroByte(&buffer);
7062 // This loop is complex because the vm tries not to send any lines that end
7063 // with a backslash to the parser. The reason for that is because the parser
7064 // treats a backslash+newline combo as whitespace, per the bc spec. In that
7065 // case, and for strings and comments, the parser will expect more stuff.
7066 s = BC_STATUS_SUCCESS;
7067 while (!G.eof && (s = bc_read_line(&buf, ">>> ")) == BC_STATUS_SUCCESS) {
7069 char *string = buf.v;
7074 if (str && buf.v[0] == G.send)
7076 else if (buf.v[0] == G.sbgn)
7079 else if (len > 1 || comment) {
7081 for (i = 0; i < len; ++i) {
7083 bool notend = len > i + 1;
7086 if (i - 1 > len || string[i - 1] != '\\') {
7087 if (G.sbgn == G.send)
7089 else if (c == G.send)
7091 else if (c == G.sbgn)
7095 if (c == '/' && notend && !comment && string[i + 1] == '*') {
7099 else if (c == '*' && notend && comment && string[i + 1] == '/')
7103 if (str || comment || string[len - 2] == '\\') {
7104 bc_vec_concat(&buffer, buf.v);
7109 bc_vec_concat(&buffer, buf.v);
7110 s = bc_vm_process(buffer.v);
7112 if (ENABLE_FEATURE_CLEAN_UP && !G_ttyin) {
7113 // Debug config, non-interactive mode:
7114 // return all the way back to main.
7115 // Non-debug builds do not come here, they exit.
7119 fputs("ready for more input\n", stderr);
7122 bc_vec_pop_all(&buffer);
7126 s = bc_error("string end could not be found");
7129 s = bc_error("comment end could not be found");
7133 bc_vec_free(&buffer);
7138 static const char bc_lib[] = {
7141 "\n" "auto b,s,n,r,d,i,p,f,v"
7150 "\n" "scale=scale(x)+1"
7160 "\n" "for(i=2;v!=0;++i){"
7166 "\n" "while((d--)!=0)r*=r"
7169 "\n" "if(n!=0)return(1/r)"
7173 "\n" "auto b,s,r,p,a,q,i,v"
7177 "\n" "r=(1-10^scale)/1"
7188 "\n" "while(x<=0.5){"
7192 "\n" "r=a=(x-1)/(x+1)"
7195 "\n" "for(i=3;v!=0;i+=2){"
7206 "\n" "auto b,s,r,n,a,q,i"
7210 "\n" "scale=1.1*s+2"
7219 "\n" "if(q%2!=0)x=-x"
7223 "\n" "for(i=3;a!=0;i+=2){"
7224 "\n" "a*=q/(i*(i-1))"
7229 "\n" "if(n!=0)return(-r/1)"
7238 "\n" "x=s(2*a(1)+x)"
7244 "\n" "auto b,s,r,n,a,m,t,f,i,u"
7253 "\n" "if(scale<65){"
7254 "\n" "return(.7853981633974483096156608458198757210492923498437764552437361480/n)"
7258 "\n" "if(scale<65){"
7259 "\n" "return(.1973955598498807583700497651947902934475851037878521015176889402/n)"
7270 "\n" "x=(x-.2)/(1+.2*x)"
7275 "\n" "for(i=3;t!=0;i+=2){"
7282 "\n" "return((m*a+r)/n)"
7284 "\n" "define j(n,x){"
7285 "\n" "auto b,s,o,a,i,v,f"
7293 "\n" "if(n%2==1)o=1"
7296 "\n" "for(i=2;i<=n;++i)a*=i"
7298 "\n" "a=(x^n)/2^n/a"
7301 "\n" "scale=scale+length(a)-scale(a)"
7302 "\n" "for(i=1;v!=0;++i){"
7303 "\n" "v=v*f/i/(n+i)"
7309 "\n" "return(a*r/1)"
7314 static BcStatus bc_vm_exec(void)
7320 if (option_mask32 & BC_FLAG_L) {
7322 // We know that internal library is not buggy,
7323 // thus error checking is normally disabled.
7324 # define DEBUG_LIB 0
7325 bc_lex_file(&G.prs.l);
7326 s = bc_parse_text(&G.prs, bc_lib);
7327 if (DEBUG_LIB && s) return s;
7329 while (G.prs.l.t.t != BC_LEX_EOF) {
7330 s = G.prs.parse(&G.prs);
7331 if (DEBUG_LIB && s) return s;
7333 s = bc_program_exec();
7334 if (DEBUG_LIB && s) return s;
7338 s = BC_STATUS_SUCCESS;
7339 for (i = 0; !s && i < G.files.len; ++i)
7340 s = bc_vm_file(*((char **) bc_vec_item(&G.files, i)));
7341 if (ENABLE_FEATURE_CLEAN_UP && s && !G_ttyin) {
7342 // Debug config, non-interactive mode:
7343 // return all the way back to main.
7344 // Non-debug builds do not come here, they exit.
7348 if (IS_BC || (option_mask32 & BC_FLAG_I)) {
7351 fputs("ready for more input\n", stderr);
7356 if (!s && !BC_PARSE_CAN_EXEC(&G.prs))
7357 s = bc_vm_process("");
7362 #if ENABLE_FEATURE_CLEAN_UP
7363 static void bc_program_free(void)
7365 bc_num_free(&G.prog.ib);
7366 bc_num_free(&G.prog.ob);
7367 bc_num_free(&G.prog.hexb);
7369 bc_num_free(&G.prog.strmb);
7371 bc_vec_free(&G.prog.fns);
7372 bc_vec_free(&G.prog.fn_map);
7373 bc_vec_free(&G.prog.vars);
7374 bc_vec_free(&G.prog.var_map);
7375 bc_vec_free(&G.prog.arrs);
7376 bc_vec_free(&G.prog.arr_map);
7377 bc_vec_free(&G.prog.strs);
7378 bc_vec_free(&G.prog.consts);
7379 bc_vec_free(&G.prog.results);
7380 bc_vec_free(&G.prog.stack);
7381 bc_num_free(&G.prog.last);
7382 bc_num_free(&G.prog.zero);
7383 bc_num_free(&G.prog.one);
7386 static void bc_vm_free(void)
7388 bc_vec_free(&G.files);
7390 bc_parse_free(&G.prs);
7395 static void bc_program_init(void)
7400 /* memset(&G.prog, 0, sizeof(G.prog)); - already is */
7401 memset(&ip, 0, sizeof(BcInstPtr));
7403 /* G.prog.nchars = G.prog.scale = 0; - already is */
7405 bc_num_init(&G.prog.ib, BC_NUM_DEF_SIZE);
7406 bc_num_ten(&G.prog.ib);
7409 bc_num_init(&G.prog.ob, BC_NUM_DEF_SIZE);
7410 bc_num_ten(&G.prog.ob);
7413 bc_num_init(&G.prog.hexb, BC_NUM_DEF_SIZE);
7414 bc_num_ten(&G.prog.hexb);
7415 G.prog.hexb.num[0] = 6;
7418 bc_num_init(&G.prog.strmb, BC_NUM_DEF_SIZE);
7419 bc_num_ulong2num(&G.prog.strmb, UCHAR_MAX + 1);
7422 bc_num_init(&G.prog.last, BC_NUM_DEF_SIZE);
7423 bc_num_zero(&G.prog.last);
7425 bc_num_init(&G.prog.zero, BC_NUM_DEF_SIZE);
7426 bc_num_zero(&G.prog.zero);
7428 bc_num_init(&G.prog.one, BC_NUM_DEF_SIZE);
7429 bc_num_one(&G.prog.one);
7431 bc_vec_init(&G.prog.fns, sizeof(BcFunc), bc_func_free);
7432 bc_vec_init(&G.prog.fn_map, sizeof(BcId), bc_id_free);
7434 bc_program_addFunc(xstrdup("(main)"), &idx);
7435 bc_program_addFunc(xstrdup("(read)"), &idx);
7437 bc_vec_init(&G.prog.vars, sizeof(BcVec), bc_vec_free);
7438 bc_vec_init(&G.prog.var_map, sizeof(BcId), bc_id_free);
7440 bc_vec_init(&G.prog.arrs, sizeof(BcVec), bc_vec_free);
7441 bc_vec_init(&G.prog.arr_map, sizeof(BcId), bc_id_free);
7443 bc_vec_init(&G.prog.strs, sizeof(char *), bc_string_free);
7444 bc_vec_init(&G.prog.consts, sizeof(char *), bc_string_free);
7445 bc_vec_init(&G.prog.results, sizeof(BcResult), bc_result_free);
7446 bc_vec_init(&G.prog.stack, sizeof(BcInstPtr), NULL);
7447 bc_vec_push(&G.prog.stack, &ip);
7450 static int bc_vm_init(const char *env_len)
7452 #if ENABLE_FEATURE_EDITING
7453 G.line_input_state = new_line_input_t(DO_HISTORY);
7455 G.prog.len = bc_vm_envLen(env_len);
7457 bc_vec_init(&G.files, sizeof(char *), NULL);
7459 IF_BC(bc_vm_envArgs();)
7462 IF_BC(bc_parse_init(&G.prs, BC_PROG_MAIN);)
7464 IF_DC(dc_parse_init(&G.prs, BC_PROG_MAIN);)
7468 #if ENABLE_FEATURE_BC_SIGNALS
7470 // With SA_RESTART, most system calls will restart
7471 // (IOW: they won't fail with EINTR).
7472 // In particular, this means ^C won't cause
7473 // stdout to get into "error state" if SIGINT hits
7474 // within write() syscall.
7475 // The downside is that ^C while line input is taken
7476 // will only be handled after [Enter] since read()
7477 // from stdin is not interrupted by ^C either,
7478 // it restarts, thus fgetc() does not return on ^C.
7479 signal_SA_RESTART_empty_mask(SIGINT, record_signo);
7481 // Without SA_RESTART, this exhibits a bug:
7482 // "while (1) print 1" and try ^C-ing it.
7483 // Intermittently, instead of returning to input line,
7484 // you'll get "output error: Interrupted system call"
7486 //signal_no_SA_RESTART_empty_mask(SIGINT, record_signo);
7490 return 0; // "not a tty"
7493 static BcStatus bc_vm_run(void)
7495 BcStatus st = bc_vm_exec();
7496 #if ENABLE_FEATURE_CLEAN_UP
7497 if (G_exiting) // it was actually "halt" or "quit"
7500 # if ENABLE_FEATURE_EDITING
7501 free_line_input_t(G.line_input_state);
7509 int bc_main(int argc, char **argv) MAIN_EXTERNALLY_VISIBLE;
7510 int bc_main(int argc UNUSED_PARAM, char **argv)
7515 G.sbgn = G.send = '"';
7517 is_tty = bc_vm_init("BC_LINE_LENGTH");
7521 if (is_tty && !(option_mask32 & BC_FLAG_Q))
7529 int dc_main(int argc, char **argv) MAIN_EXTERNALLY_VISIBLE;
7530 int dc_main(int argc UNUSED_PARAM, char **argv)
7537 // TODO: dc (GNU bc 1.07.1) 1.4.1 seems to use default width
7538 // 1 char narrower than bc from the same package. Do the same?
7539 bc_vm_init("DC_LINE_LENGTH");
7541 // Run -e'SCRIPT' and -fFILE in order of appearance, then handle FILEs
7542 noscript = BC_FLAG_I;
7544 int n = getopt(argc, argv, "e:f:x");
7550 n = bc_vm_process(optarg);
7558 option_mask32 |= DC_FLAG_X;
7568 bc_vec_push(&G.files, argv++);
7571 option_mask32 |= noscript; // set BC_FLAG_I if we need to interpret stdin
7577 #endif // not DC_SMALL