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)))
639 typedef BcStatus (*BcParseParse)(struct BcParse *);
641 typedef struct BcParse {
662 typedef struct BcProgram {
703 #define BC_PROG_STACK(s, n) ((s)->len >= ((size_t) n))
705 #define BC_PROG_MAIN (0)
706 #define BC_PROG_READ (1)
708 #define BC_PROG_REQ_FUNCS (2)
711 #define BC_PROG_STR(n) (!(n)->num && !(n)->cap)
712 #define BC_PROG_NUM(r, n) \
713 ((r)->t != BC_RESULT_ARRAY && (r)->t != BC_RESULT_STR && !BC_PROG_STR(n))
715 typedef unsigned long (*BcProgramBuiltIn)(BcNum *);
717 #define BC_FLAG_W (1 << 0)
718 #define BC_FLAG_V (1 << 1)
719 #define BC_FLAG_S (1 << 2)
720 #define BC_FLAG_Q (1 << 3)
721 #define BC_FLAG_L (1 << 4)
722 #define BC_FLAG_I (1 << 5)
723 #define DC_FLAG_X (1 << 6)
725 #define BC_MAX(a, b) ((a) > (b) ? (a) : (b))
726 #define BC_MIN(a, b) ((a) < (b) ? (a) : (b))
728 #define BC_MAX_OBASE ((unsigned) 999)
729 #define BC_MAX_DIM ((unsigned) INT_MAX)
730 #define BC_MAX_SCALE ((unsigned) UINT_MAX)
731 #define BC_MAX_STRING ((unsigned) UINT_MAX - 1)
732 #define BC_MAX_NAME BC_MAX_STRING
733 #define BC_MAX_NUM BC_MAX_STRING
734 #define BC_MAX_EXP ((unsigned long) LONG_MAX)
735 #define BC_MAX_VARS ((unsigned long) SIZE_MAX - 1)
738 IF_FEATURE_BC_SIGNALS(smallint ttyin;)
739 IF_FEATURE_CLEAN_UP(smallint exiting;)
747 // For error messages. Can be set to current parsed line,
748 // or [TODO] to current executing line (can be before last parsed one)
755 #if ENABLE_FEATURE_EDITING
756 line_input_t *line_input_state;
759 #define G (*ptr_to_globals)
760 #define INIT_G() do { \
761 SET_PTR_TO_GLOBALS(xzalloc(sizeof(G))); \
763 #define FREE_G() do { \
764 FREE_PTR_TO_GLOBALS(); \
766 #define G_posix (ENABLE_BC && (option_mask32 & BC_FLAG_S))
767 #define G_warn (ENABLE_BC && (option_mask32 & BC_FLAG_W))
768 #define G_exreg (ENABLE_DC && (option_mask32 & DC_FLAG_X))
769 #if ENABLE_FEATURE_BC_SIGNALS
770 # define G_interrupt bb_got_signal
771 # define G_ttyin G.ttyin
773 # define G_interrupt 0
776 #if ENABLE_FEATURE_CLEAN_UP
777 # define G_exiting G.exiting
781 #define IS_BC (ENABLE_BC && (!ENABLE_DC || applet_name[0] == 'b'))
785 // This is a bit array that corresponds to token types. An entry is
786 // true if the token is valid in an expression, false otherwise.
788 BC_PARSE_EXPRS_BITS = 0
789 + ((uint64_t)((0 << 0)+(0 << 1)+(1 << 2)+(1 << 3)+(1 << 4)+(1 << 5)+(1 << 6)+(1 << 7)) << (0*8))
790 + ((uint64_t)((1 << 0)+(1 << 1)+(1 << 2)+(1 << 3)+(1 << 4)+(1 << 5)+(1 << 6)+(1 << 7)) << (1*8))
791 + ((uint64_t)((1 << 0)+(1 << 1)+(1 << 2)+(1 << 3)+(1 << 4)+(1 << 5)+(1 << 6)+(1 << 7)) << (2*8))
792 + ((uint64_t)((1 << 0)+(1 << 1)+(1 << 2)+(0 << 3)+(0 << 4)+(1 << 5)+(1 << 6)+(0 << 7)) << (3*8))
793 + ((uint64_t)((0 << 0)+(0 << 1)+(0 << 2)+(0 << 3)+(0 << 4)+(0 << 5)+(1 << 6)+(1 << 7)) << (4*8))
794 + ((uint64_t)((0 << 0)+(0 << 1)+(0 << 2)+(0 << 3)+(0 << 4)+(0 << 5)+(0 << 6)+(1 << 7)) << (5*8))
795 + ((uint64_t)((0 << 0)+(1 << 1)+(1 << 2)+(1 << 3)+(1 << 4)+(0 << 5)+(0 << 6)+(1 << 7)) << (6*8))
796 + ((uint64_t)((0 << 0)+(1 << 1)+(1 << 2)+(0 << 3) ) << (7*8))
798 static ALWAYS_INLINE long bc_parse_exprs(unsigned i)
800 #if ULONG_MAX > 0xffffffff
801 // 64-bit version (will not work correctly for 32-bit longs!)
802 return BC_PARSE_EXPRS_BITS & (1UL << i);
805 unsigned long m = (uint32_t)BC_PARSE_EXPRS_BITS;
807 m = (uint32_t)(BC_PARSE_EXPRS_BITS >> 32);
810 return m & (1UL << i);
814 // This is an array of data for operators that correspond to token types.
815 static const uint8_t bc_parse_ops[] = {
816 #define OP(p,l) ((int)(l) * 0x10 + (p))
817 OP(0, false), OP( 0, false ), // inc dec
820 OP(3, true ), OP( 3, true ), OP( 3, true ), // pow mul div
821 OP(4, true ), OP( 4, true ), // mod + -
822 OP(6, true ), OP( 6, true ), OP( 6, true ), OP( 6, true ), OP( 6, true ), OP( 6, true ), // == <= >= != < >
824 OP(7, true ), OP( 7, true ), // or and
825 OP(5, false), OP( 5, false ), OP( 5, false ), OP( 5, false ), OP( 5, false ), // ^= *= /= %= +=
826 OP(5, false), OP( 5, false ), // -= =
829 #define bc_parse_op_PREC(i) (bc_parse_ops[i] & 0x0f)
830 #define bc_parse_op_LEFT(i) (bc_parse_ops[i] & 0x10)
832 // Byte array of up to 4 BC_LEX's, packed into 32-bit word
833 typedef uint32_t BcParseNext;
835 // These identify what tokens can come after expressions in certain cases.
837 #define BC_PARSE_NEXT4(a,b,c,d) ( (a) | ((b)<<8) | ((c)<<16) | ((((d)|0x80)<<24)) )
838 #define BC_PARSE_NEXT2(a,b) BC_PARSE_NEXT4(a,b,0xff,0xff)
839 #define BC_PARSE_NEXT1(a) BC_PARSE_NEXT4(a,0xff,0xff,0xff)
840 bc_parse_next_expr = BC_PARSE_NEXT4(BC_LEX_NLINE, BC_LEX_SCOLON, BC_LEX_RBRACE, BC_LEX_EOF),
841 bc_parse_next_param = BC_PARSE_NEXT2(BC_LEX_RPAREN, BC_LEX_COMMA),
842 bc_parse_next_print = BC_PARSE_NEXT4(BC_LEX_COMMA, BC_LEX_NLINE, BC_LEX_SCOLON, BC_LEX_EOF),
843 bc_parse_next_rel = BC_PARSE_NEXT1(BC_LEX_RPAREN),
844 bc_parse_next_elem = BC_PARSE_NEXT1(BC_LEX_RBRACKET),
845 bc_parse_next_for = BC_PARSE_NEXT1(BC_LEX_SCOLON),
846 bc_parse_next_read = BC_PARSE_NEXT2(BC_LEX_NLINE, BC_LEX_EOF),
847 #undef BC_PARSE_NEXT4
848 #undef BC_PARSE_NEXT2
849 #undef BC_PARSE_NEXT1
854 static const //BcLexType - should be this type, but narrower type saves size:
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 - should be this type
866 BC_LEX_OP_MODULUS, BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_LPAREN,
867 BC_LEX_INVALID, BC_LEX_OP_MULTIPLY, BC_LEX_OP_PLUS, BC_LEX_INVALID,
868 BC_LEX_OP_MINUS, BC_LEX_INVALID, BC_LEX_OP_DIVIDE,
869 BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID,
870 BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID,
871 BC_LEX_INVALID, BC_LEX_INVALID,
872 BC_LEX_COLON, BC_LEX_SCOLON, BC_LEX_OP_REL_GT, BC_LEX_OP_REL_EQ,
873 BC_LEX_OP_REL_LT, BC_LEX_KEY_READ, BC_LEX_INVALID,
874 BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID,
875 BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_EQ_NO_REG, BC_LEX_INVALID,
876 BC_LEX_KEY_IBASE, BC_LEX_INVALID, BC_LEX_KEY_SCALE, BC_LEX_LOAD_POP,
877 BC_LEX_INVALID, BC_LEX_OP_BOOL_NOT, BC_LEX_KEY_OBASE, BC_LEX_PRINT_STREAM,
878 BC_LEX_NQUIT, BC_LEX_POP, BC_LEX_STORE_PUSH, BC_LEX_INVALID, BC_LEX_INVALID,
879 BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_SCALE_FACTOR, BC_LEX_INVALID,
880 BC_LEX_KEY_LENGTH, BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID,
881 BC_LEX_OP_POWER, BC_LEX_NEG, BC_LEX_INVALID,
882 BC_LEX_ASCIIFY, BC_LEX_INVALID, BC_LEX_CLEAR_STACK, BC_LEX_DUPLICATE,
883 BC_LEX_ELSE, BC_LEX_PRINT_STACK, BC_LEX_INVALID, BC_LEX_INVALID,
884 BC_LEX_STORE_IBASE, BC_LEX_INVALID, BC_LEX_STORE_SCALE, BC_LEX_LOAD,
885 BC_LEX_INVALID, BC_LEX_PRINT_POP, BC_LEX_STORE_OBASE, BC_LEX_KEY_PRINT,
886 BC_LEX_KEY_QUIT, BC_LEX_SWAP, BC_LEX_OP_ASSIGN, BC_LEX_INVALID,
887 BC_LEX_INVALID, BC_LEX_KEY_SQRT, BC_LEX_INVALID, BC_LEX_EXECUTE,
888 BC_LEX_INVALID, BC_LEX_STACK_LEVEL,
889 BC_LEX_LBRACE, BC_LEX_OP_MODEXP, BC_LEX_INVALID, BC_LEX_OP_DIVMOD,
893 static const //BcInst - should be this type. Using signed narrow type since BC_INST_INVALID is -1
896 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID, BC_INST_REL_GE,
897 BC_INST_INVALID, BC_INST_POWER, BC_INST_MULTIPLY, BC_INST_DIVIDE,
898 BC_INST_MODULUS, BC_INST_PLUS, BC_INST_MINUS,
899 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID,
900 BC_INST_INVALID, BC_INST_INVALID,
901 BC_INST_BOOL_NOT, BC_INST_INVALID, BC_INST_INVALID,
902 BC_INST_INVALID, BC_INST_INVALID, 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_REL_GT, BC_INST_INVALID,
905 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID, BC_INST_REL_GE,
906 BC_INST_INVALID, BC_INST_INVALID,
907 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID,
908 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID,
909 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID, BC_INST_IBASE,
910 BC_INST_INVALID, BC_INST_INVALID, BC_INST_LENGTH, BC_INST_INVALID,
911 BC_INST_OBASE, BC_INST_PRINT, BC_INST_QUIT, BC_INST_INVALID,
912 BC_INST_INVALID, BC_INST_SCALE, BC_INST_SQRT, BC_INST_INVALID,
913 BC_INST_REL_EQ, BC_INST_MODEXP, BC_INST_DIVMOD, BC_INST_INVALID,
914 BC_INST_INVALID, BC_INST_EXECUTE, BC_INST_PRINT_STACK, BC_INST_CLEAR_STACK,
915 BC_INST_STACK_LEN, BC_INST_DUPLICATE, BC_INST_SWAP, BC_INST_POP,
916 BC_INST_ASCIIFY, BC_INST_PRINT_STREAM, BC_INST_INVALID, BC_INST_INVALID,
917 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID,
918 BC_INST_PRINT, BC_INST_NQUIT, BC_INST_SCALE_FUNC,
922 static const BcNumBinaryOp bc_program_ops[] = {
923 bc_num_pow, bc_num_mul, bc_num_div, bc_num_mod, bc_num_add, bc_num_sub,
926 static void fflush_and_check(void)
929 if (ferror(stdout) || ferror(stderr))
930 bb_perror_msg_and_die("output error");
933 #if ENABLE_FEATURE_CLEAN_UP
934 #define QUIT_OR_RETURN_TO_MAIN \
936 IF_FEATURE_BC_SIGNALS(G_ttyin = 0;) /* do not loop in main loop anymore */ \
938 return BC_STATUS_FAILURE; \
941 #define QUIT_OR_RETURN_TO_MAIN quit()
944 static void quit(void) NORETURN;
945 static void quit(void)
948 bb_perror_msg_and_die("input error");
953 static void bc_verror_msg(const char *fmt, va_list p)
955 const char *sv = sv; /* for compiler */
958 applet_name = xasprintf("%s: %s:%u", applet_name, G.prog.file, G.err_line);
960 bb_verror_msg(fmt, p, NULL);
962 free((char*)applet_name);
967 static NOINLINE int bc_error_fmt(const char *fmt, ...)
972 bc_verror_msg(fmt, p);
975 if (!ENABLE_FEATURE_CLEAN_UP && !G_ttyin)
977 return BC_STATUS_FAILURE;
981 static NOINLINE int bc_posix_error_fmt(const char *fmt, ...)
985 // Are non-POSIX constructs totally ok?
986 if (!(option_mask32 & (BC_FLAG_S|BC_FLAG_W)))
987 return BC_STATUS_SUCCESS; // yes
990 bc_verror_msg(fmt, p);
993 // Do we treat non-POSIX constructs as errors?
994 if (!(option_mask32 & BC_FLAG_S))
995 return BC_STATUS_SUCCESS; // no, it's a warning
996 if (!ENABLE_FEATURE_CLEAN_UP && !G_ttyin)
998 return BC_STATUS_FAILURE;
1002 // We use error functions with "return bc_error(FMT[, PARAMS])" idiom.
1003 // This idiom begs for tail-call optimization, but for it to work,
1004 // function must not have caller-cleaned parameters on stack.
1005 // Unfortunately, vararg function API does exactly that on most arches.
1006 // Thus, use these shims for the cases when we have no vararg PARAMS:
1007 static int bc_error(const char *msg)
1009 return bc_error_fmt("%s", msg);
1012 static int bc_POSIX_requires(const char *msg)
1014 return bc_posix_error_fmt("POSIX requires %s", msg);
1016 static int bc_POSIX_does_not_allow(const char *msg)
1018 return bc_posix_error_fmt("%s%s", "POSIX does not allow ", msg);
1020 static int bc_POSIX_does_not_allow_bool_ops_this_is_bad(const char *msg)
1022 return bc_posix_error_fmt("%s%s %s", "POSIX does not allow ", "boolean operators; the following is bad:", msg);
1024 static int bc_POSIX_does_not_allow_empty_X_expression_in_for(const char *msg)
1026 return bc_posix_error_fmt("%san empty %s expression in a for loop", "POSIX does not allow ", msg);
1029 static int bc_error_bad_character(char c)
1031 return bc_error_fmt("bad character '%c'", c);
1033 static int bc_error_bad_expression(void)
1035 return bc_error("bad expression");
1037 static int bc_error_bad_token(void)
1039 return bc_error("bad token");
1041 static int bc_error_stack_has_too_few_elements(void)
1043 return bc_error("stack has too few elements");
1045 static int bc_error_variable_is_wrong_type(void)
1047 return bc_error("variable is wrong type");
1049 static int bc_error_nested_read_call(void)
1051 return bc_error("read() call inside of a read() call");
1054 static void bc_vec_grow(BcVec *v, size_t n)
1056 size_t cap = v->cap * 2;
1057 while (cap < v->len + n) cap *= 2;
1058 v->v = xrealloc(v->v, v->size * cap);
1062 static void bc_vec_init(BcVec *v, size_t esize, BcVecFree dtor)
1065 v->cap = BC_VEC_START_CAP;
1068 v->v = xmalloc(esize * BC_VEC_START_CAP);
1071 static void bc_char_vec_init(BcVec *v)
1073 bc_vec_init(v, sizeof(char), NULL);
1076 static void bc_vec_expand(BcVec *v, size_t req)
1079 v->v = xrealloc(v->v, v->size * req);
1084 static void bc_vec_pop(BcVec *v)
1088 v->dtor(v->v + (v->size * v->len));
1091 static void bc_vec_npop(BcVec *v, size_t n)
1096 size_t len = v->len - n;
1097 while (v->len > len) v->dtor(v->v + (v->size * --v->len));
1101 static void bc_vec_pop_all(BcVec *v)
1103 bc_vec_npop(v, v->len);
1106 static void bc_vec_push(BcVec *v, const void *data)
1108 if (v->len + 1 > v->cap) bc_vec_grow(v, 1);
1109 memmove(v->v + (v->size * v->len), data, v->size);
1113 static void bc_vec_pushByte(BcVec *v, char data)
1115 bc_vec_push(v, &data);
1118 static void bc_vec_pushZeroByte(BcVec *v)
1120 //bc_vec_pushByte(v, '\0');
1122 bc_vec_push(v, &const_int_0);
1125 static void bc_vec_pushAt(BcVec *v, const void *data, size_t idx)
1128 bc_vec_push(v, data);
1133 if (v->len == v->cap) bc_vec_grow(v, 1);
1135 ptr = v->v + v->size * idx;
1137 memmove(ptr + v->size, ptr, v->size * (v->len++ - idx));
1138 memmove(ptr, data, v->size);
1142 static void bc_vec_string(BcVec *v, size_t len, const char *str)
1145 bc_vec_expand(v, len + 1);
1146 memcpy(v->v, str, len);
1149 bc_vec_pushZeroByte(v);
1152 static void bc_vec_concat(BcVec *v, const char *str)
1156 if (v->len == 0) bc_vec_pushZeroByte(v);
1158 len = v->len + strlen(str);
1160 if (v->cap < len) bc_vec_grow(v, len - v->len);
1161 strcpy(v->v + v->len - 1, str);
1166 static void *bc_vec_item(const BcVec *v, size_t idx)
1168 return v->v + v->size * idx;
1171 static void *bc_vec_item_rev(const BcVec *v, size_t idx)
1173 return v->v + v->size * (v->len - idx - 1);
1176 static void *bc_vec_top(const BcVec *v)
1178 return v->v + v->size * (v->len - 1);
1181 static void bc_vec_free(void *vec)
1183 BcVec *v = (BcVec *) vec;
1188 static int bc_id_cmp(const void *e1, const void *e2)
1190 return strcmp(((const BcId *) e1)->name, ((const BcId *) e2)->name);
1193 static void bc_id_free(void *id)
1195 free(((BcId *) id)->name);
1198 static size_t bc_map_find(const BcVec *v, const void *ptr)
1200 size_t low = 0, high = v->len;
1202 while (low < high) {
1204 size_t mid = (low + high) / 2;
1205 BcId *id = bc_vec_item(v, mid);
1206 int result = bc_id_cmp(ptr, id);
1210 else if (result < 0)
1219 static int bc_map_insert(BcVec *v, const void *ptr, size_t *i)
1221 size_t n = *i = bc_map_find(v, ptr);
1224 bc_vec_push(v, ptr);
1225 else if (!bc_id_cmp(ptr, bc_vec_item(v, n)))
1226 return 0; // "was not inserted"
1228 bc_vec_pushAt(v, ptr, n);
1229 return 1; // "was inserted"
1233 static size_t bc_map_index(const BcVec *v, const void *ptr)
1235 size_t i = bc_map_find(v, ptr);
1236 if (i >= v->len) return BC_VEC_INVALID_IDX;
1237 return bc_id_cmp(ptr, bc_vec_item(v, i)) ? BC_VEC_INVALID_IDX : i;
1241 static int push_input_byte(BcVec *vec, char c)
1243 if ((c < ' ' && c != '\t' && c != '\r' && c != '\n') // also allow '\v' '\f'?
1246 // Bad chars on this line, ignore entire line
1247 bc_error_fmt("illegal character 0x%02x", c);
1250 bc_vec_pushByte(vec, (char)c);
1254 static BcStatus bc_read_line(BcVec *vec, const char *prompt)
1258 if (G_posix) prompt = "";
1264 bc_vec_pop_all(vec);
1268 #if ENABLE_FEATURE_BC_SIGNALS
1269 if (G_interrupt) { // ^C was pressed
1273 ? "\ninterrupt (type \"quit\" to exit)\n"
1274 : "\ninterrupt (type \"q\" to exit)\n"
1277 # if ENABLE_FEATURE_EDITING
1280 # define line_buf bb_common_bufsiz1
1281 n = read_line_input(G.line_input_state, prompt, line_buf, COMMON_BUFSIZE);
1282 if (n <= 0) { // read errors or EOF, or ^D, or ^C
1292 bad_chars |= push_input_byte(vec, c);
1300 fputs(prompt, stderr);
1301 IF_FEATURE_BC_SIGNALS(errno = 0;)
1304 #if ENABLE_FEATURE_BC_SIGNALS && !ENABLE_FEATURE_EDITING
1305 // Both conditions appear simultaneously, check both just in case
1306 if (errno == EINTR || G_interrupt) {
1314 quit(); // this emits error message
1316 // Note: EOF does not append '\n', therefore:
1317 // printf 'print 123\n' | bc - works
1318 // printf 'print 123' | bc - fails (syntax error)
1321 bad_chars |= push_input_byte(vec, c);
1322 } while (c != '\n');
1324 } while (bad_chars);
1326 bc_vec_pushZeroByte(vec);
1328 return BC_STATUS_SUCCESS;
1331 static char* bc_read_file(const char *path)
1334 size_t size = ((size_t) -1);
1337 // Never returns NULL (dies on errors)
1338 buf = xmalloc_xopen_read_close(path, &size);
1340 for (i = 0; i < size; ++i) {
1342 if ((c < ' ' && c != '\t' && c != '\r' && c != '\n') // also allow '\v' '\f'?
1354 static void bc_num_setToZero(BcNum *n, size_t scale)
1361 static void bc_num_zero(BcNum *n)
1363 bc_num_setToZero(n, 0);
1366 static void bc_num_one(BcNum *n)
1368 bc_num_setToZero(n, 0);
1373 static void bc_num_ten(BcNum *n)
1375 bc_num_setToZero(n, 0);
1381 static void bc_num_init(BcNum *n, size_t req)
1383 req = req >= BC_NUM_DEF_SIZE ? req : BC_NUM_DEF_SIZE;
1384 memset(n, 0, sizeof(BcNum));
1385 n->num = xmalloc(req);
1389 static void bc_num_expand(BcNum *n, size_t req)
1391 req = req >= BC_NUM_DEF_SIZE ? req : BC_NUM_DEF_SIZE;
1393 n->num = xrealloc(n->num, req);
1398 static void bc_num_free(void *num)
1400 free(((BcNum *) num)->num);
1403 static void bc_num_copy(BcNum *d, BcNum *s)
1406 bc_num_expand(d, s->cap);
1410 memcpy(d->num, s->num, sizeof(BcDig) * d->len);
1414 static BcStatus bc_num_ulong(BcNum *n, unsigned long *result)
1419 if (n->neg) return bc_error("negative number");
1421 for (*result = 0, pow = 1, i = n->rdx; i < n->len; ++i) {
1423 unsigned long prev = *result, powprev = pow;
1425 *result += ((unsigned long) n->num[i]) * pow;
1428 if (*result < prev || pow < powprev)
1429 return bc_error("overflow");
1432 return BC_STATUS_SUCCESS;
1435 static void bc_num_ulong2num(BcNum *n, unsigned long val)
1443 if (val == 0) return;
1445 for (len = 1, i = ULONG_MAX; i != 0; i /= 10, ++len) bc_num_expand(n, len);
1446 for (ptr = n->num, i = 0; val; ++i, ++n->len, val /= 10) ptr[i] = val % 10;
1449 static void bc_num_subArrays(BcDig *restrict a, BcDig *restrict b,
1453 for (i = 0; i < len; ++i) {
1454 for (a[i] -= b[i], j = 0; a[i + j] < 0;) {
1461 static ssize_t bc_num_compare(BcDig *restrict a, BcDig *restrict b, size_t len)
1465 for (i = len - 1; i < len && !(c = a[i] - b[i]); --i);
1466 return BC_NUM_NEG(i + 1, c < 0);
1469 static ssize_t bc_num_cmp(BcNum *a, BcNum *b)
1471 size_t i, min, a_int, b_int, diff;
1472 BcDig *max_num, *min_num;
1473 bool a_max, neg = false;
1476 if (a == b) return 0;
1477 if (a->len == 0) return BC_NUM_NEG(!!b->len, !b->neg);
1478 if (b->len == 0) return BC_NUM_NEG(1, a->neg);
1488 a_int = BC_NUM_INT(a);
1489 b_int = BC_NUM_INT(b);
1491 a_max = (a->rdx > b->rdx);
1493 if (a_int != 0) return (ssize_t) a_int;
1497 diff = a->rdx - b->rdx;
1498 max_num = a->num + diff;
1503 diff = b->rdx - a->rdx;
1504 max_num = b->num + diff;
1508 cmp = bc_num_compare(max_num, min_num, b_int + min);
1509 if (cmp != 0) return BC_NUM_NEG(cmp, (!a_max) != neg);
1511 for (max_num -= diff, i = diff - 1; i < diff; --i) {
1512 if (max_num[i]) return BC_NUM_NEG(1, (!a_max) != neg);
1518 static void bc_num_truncate(BcNum *n, size_t places)
1520 if (places == 0) return;
1526 memmove(n->num, n->num + places, n->len * sizeof(BcDig));
1530 static void bc_num_extend(BcNum *n, size_t places)
1532 size_t len = n->len + places;
1536 if (n->cap < len) bc_num_expand(n, len);
1538 memmove(n->num + places, n->num, sizeof(BcDig) * n->len);
1539 memset(n->num, 0, sizeof(BcDig) * places);
1546 static void bc_num_clean(BcNum *n)
1548 while (n->len > 0 && n->num[n->len - 1] == 0) --n->len;
1551 else if (n->len < n->rdx)
1555 static void bc_num_retireMul(BcNum *n, size_t scale, bool neg1, bool neg2)
1558 bc_num_extend(n, scale - n->rdx);
1560 bc_num_truncate(n, n->rdx - scale);
1563 if (n->len != 0) n->neg = !neg1 != !neg2;
1566 static void bc_num_split(BcNum *restrict n, size_t idx, BcNum *restrict a,
1571 b->len = n->len - idx;
1573 a->rdx = b->rdx = 0;
1575 memcpy(b->num, n->num + idx, b->len * sizeof(BcDig));
1576 memcpy(a->num, n->num, idx * sizeof(BcDig));
1587 static BcStatus bc_num_shift(BcNum *n, size_t places)
1589 if (places == 0 || n->len == 0) return BC_STATUS_SUCCESS;
1590 if (places + n->len > BC_MAX_NUM)
1591 return bc_error("number too long: must be [1, BC_NUM_MAX]");
1593 if (n->rdx >= places)
1596 bc_num_extend(n, places - n->rdx);
1602 return BC_STATUS_SUCCESS;
1605 static BcStatus bc_num_inv(BcNum *a, BcNum *b, size_t scale)
1614 return bc_num_div(&one, a, b, scale);
1617 static BcStatus bc_num_a(BcNum *a, BcNum *b, BcNum *restrict c, size_t sub)
1619 BcDig *ptr, *ptr_a, *ptr_b, *ptr_c;
1620 size_t i, max, min_rdx, min_int, diff, a_int, b_int;
1623 // Because this function doesn't need to use scale (per the bc spec),
1624 // I am hijacking it to say whether it's doing an add or a subtract.
1628 if (sub && c->len) c->neg = !c->neg;
1629 return BC_STATUS_SUCCESS;
1631 else if (b->len == 0) {
1633 return BC_STATUS_SUCCESS;
1637 c->rdx = BC_MAX(a->rdx, b->rdx);
1638 min_rdx = BC_MIN(a->rdx, b->rdx);
1641 if (a->rdx > b->rdx) {
1642 diff = a->rdx - b->rdx;
1644 ptr_a = a->num + diff;
1648 diff = b->rdx - a->rdx;
1651 ptr_b = b->num + diff;
1654 for (ptr_c = c->num, i = 0; i < diff; ++i, ++c->len) ptr_c[i] = ptr[i];
1657 a_int = BC_NUM_INT(a);
1658 b_int = BC_NUM_INT(b);
1660 if (a_int > b_int) {
1671 for (carry = 0, i = 0; i < min_rdx + min_int; ++i, ++c->len) {
1672 in = ((int) ptr_a[i]) + ((int) ptr_b[i]) + carry;
1674 ptr_c[i] = (BcDig)(in % 10);
1677 for (; i < max + min_rdx; ++i, ++c->len) {
1678 in = ((int) ptr[i]) + carry;
1680 ptr_c[i] = (BcDig)(in % 10);
1683 if (carry != 0) c->num[c->len++] = (BcDig) carry;
1685 return BC_STATUS_SUCCESS; // can't make void, see bc_num_binary()
1688 static BcStatus bc_num_s(BcNum *a, BcNum *b, BcNum *restrict c, size_t sub)
1691 BcNum *minuend, *subtrahend;
1693 bool aneg, bneg, neg;
1695 // Because this function doesn't need to use scale (per the bc spec),
1696 // I am hijacking it to say whether it's doing an add or a subtract.
1700 if (sub && c->len) c->neg = !c->neg;
1701 return BC_STATUS_SUCCESS;
1703 else if (b->len == 0) {
1705 return BC_STATUS_SUCCESS;
1710 a->neg = b->neg = false;
1712 cmp = bc_num_cmp(a, b);
1718 bc_num_setToZero(c, BC_MAX(a->rdx, b->rdx));
1719 return BC_STATUS_SUCCESS;
1728 if (sub) neg = !neg;
1733 bc_num_copy(c, minuend);
1736 if (c->rdx < subtrahend->rdx) {
1737 bc_num_extend(c, subtrahend->rdx - c->rdx);
1741 start = c->rdx - subtrahend->rdx;
1743 bc_num_subArrays(c->num + start, subtrahend->num, subtrahend->len);
1747 return BC_STATUS_SUCCESS; // can't make void, see bc_num_binary()
1750 static BcStatus bc_num_k(BcNum *restrict a, BcNum *restrict b,
1754 size_t max = BC_MAX(a->len, b->len), max2 = (max + 1) / 2;
1755 BcNum l1, h1, l2, h2, m2, m1, z0, z1, z2, temp;
1758 if (a->len == 0 || b->len == 0) {
1760 return BC_STATUS_SUCCESS;
1762 aone = BC_NUM_ONE(a);
1763 if (aone || BC_NUM_ONE(b)) {
1764 bc_num_copy(c, aone ? b : a);
1765 return BC_STATUS_SUCCESS;
1768 if (a->len + b->len < BC_NUM_KARATSUBA_LEN ||
1769 a->len < BC_NUM_KARATSUBA_LEN || b->len < BC_NUM_KARATSUBA_LEN)
1774 bc_num_expand(c, a->len + b->len + 1);
1776 memset(c->num, 0, sizeof(BcDig) * c->cap);
1779 for (i = 0; i < b->len; ++i) {
1782 for (j = 0; j < a->len; ++j) {
1783 unsigned in = c->num[i + j];
1784 in += ((unsigned) a->num[j]) * ((unsigned) b->num[i]) + carry;
1785 // note: compilers prefer _unsigned_ div/const
1787 c->num[i + j] = (BcDig)(in % 10);
1790 c->num[i + j] += (BcDig) carry;
1791 len = BC_MAX(len, i + j + !!carry);
1794 // a*a <- without check below, this will not be interruptible
1795 if (G_interrupt) return BC_STATUS_FAILURE;
1800 return BC_STATUS_SUCCESS;
1803 bc_num_init(&l1, max);
1804 bc_num_init(&h1, max);
1805 bc_num_init(&l2, max);
1806 bc_num_init(&h2, max);
1807 bc_num_init(&m1, max);
1808 bc_num_init(&m2, max);
1809 bc_num_init(&z0, max);
1810 bc_num_init(&z1, max);
1811 bc_num_init(&z2, max);
1812 bc_num_init(&temp, max + max);
1814 bc_num_split(a, max2, &l1, &h1);
1815 bc_num_split(b, max2, &l2, &h2);
1817 s = bc_num_add(&h1, &l1, &m1, 0);
1819 s = bc_num_add(&h2, &l2, &m2, 0);
1822 s = bc_num_k(&h1, &h2, &z0);
1824 s = bc_num_k(&m1, &m2, &z1);
1826 s = bc_num_k(&l1, &l2, &z2);
1829 s = bc_num_sub(&z1, &z0, &temp, 0);
1831 s = bc_num_sub(&temp, &z2, &z1, 0);
1834 s = bc_num_shift(&z0, max2 * 2);
1836 s = bc_num_shift(&z1, max2);
1838 s = bc_num_add(&z0, &z1, &temp, 0);
1840 s = bc_num_add(&temp, &z2, c, 0);
1856 static BcStatus bc_num_m(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale)
1860 size_t maxrdx = BC_MAX(a->rdx, b->rdx);
1862 scale = BC_MAX(scale, a->rdx);
1863 scale = BC_MAX(scale, b->rdx);
1864 scale = BC_MIN(a->rdx + b->rdx, scale);
1865 maxrdx = BC_MAX(maxrdx, scale);
1867 bc_num_init(&cpa, a->len);
1868 bc_num_init(&cpb, b->len);
1870 bc_num_copy(&cpa, a);
1871 bc_num_copy(&cpb, b);
1872 cpa.neg = cpb.neg = false;
1874 s = bc_num_shift(&cpa, maxrdx);
1876 s = bc_num_shift(&cpb, maxrdx);
1878 s = bc_num_k(&cpa, &cpb, c);
1882 bc_num_expand(c, c->len + maxrdx);
1884 if (c->len < maxrdx) {
1885 memset(c->num + c->len, 0, (c->cap - c->len) * sizeof(BcDig));
1890 bc_num_retireMul(c, scale, a->neg, b->neg);
1898 static BcStatus bc_num_d(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale)
1900 BcStatus s = BC_STATUS_SUCCESS;
1907 return bc_error("divide by zero");
1908 else if (a->len == 0) {
1909 bc_num_setToZero(c, scale);
1910 return BC_STATUS_SUCCESS;
1912 else if (BC_NUM_ONE(b)) {
1914 bc_num_retireMul(c, scale, a->neg, b->neg);
1915 return BC_STATUS_SUCCESS;
1918 bc_num_init(&cp, BC_NUM_MREQ(a, b, scale));
1919 bc_num_copy(&cp, a);
1923 bc_num_expand(&cp, len + 2);
1924 bc_num_extend(&cp, len - cp.len);
1927 if (b->rdx > cp.rdx) bc_num_extend(&cp, b->rdx - cp.rdx);
1929 if (scale > cp.rdx) bc_num_extend(&cp, scale - cp.rdx);
1931 if (b->rdx == b->len) {
1932 for (i = 0; zero && i < len; ++i) zero = !b->num[len - i - 1];
1936 if (cp.cap == cp.len) bc_num_expand(&cp, cp.len + 1);
1938 // We want an extra zero in front to make things simpler.
1939 cp.num[cp.len++] = 0;
1942 bc_num_expand(c, cp.len);
1945 memset(c->num + end, 0, (c->cap - end) * sizeof(BcDig));
1950 for (i = end - 1; !s && i < end; --i) {
1952 for (q = 0; (!s && n[len] != 0) || bc_num_compare(n, p, len) >= 0; ++q)
1953 bc_num_subArrays(n, p, len);
1957 // 1/a <- without check below, this will not be interruptible
1959 s = BC_STATUS_FAILURE;
1964 bc_num_retireMul(c, scale, a->neg, b->neg);
1970 static BcStatus bc_num_r(BcNum *a, BcNum *b, BcNum *restrict c,
1971 BcNum *restrict d, size_t scale, size_t ts)
1978 return bc_error("divide by zero");
1981 bc_num_setToZero(d, ts);
1982 return BC_STATUS_SUCCESS;
1985 bc_num_init(&temp, d->cap);
1986 s = bc_num_d(a, b, c, scale);
1989 if (scale != 0) scale = ts;
1991 s = bc_num_m(c, b, &temp, scale);
1993 s = bc_num_sub(a, &temp, d, scale);
1996 if (ts > d->rdx && d->len) bc_num_extend(d, ts - d->rdx);
1999 bc_num_retireMul(d, ts, a->neg, b->neg);
2007 static BcStatus bc_num_rem(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale)
2011 size_t ts = BC_MAX(scale + b->rdx, a->rdx), len = BC_NUM_MREQ(a, b, ts);
2013 bc_num_init(&c1, len);
2014 s = bc_num_r(a, b, &c1, c, scale, ts);
2020 static BcStatus bc_num_p(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale)
2022 BcStatus s = BC_STATUS_SUCCESS;
2025 size_t i, powrdx, resrdx;
2028 if (b->rdx) return bc_error("non integer number");
2032 return BC_STATUS_SUCCESS;
2034 else if (a->len == 0) {
2035 bc_num_setToZero(c, scale);
2036 return BC_STATUS_SUCCESS;
2038 else if (BC_NUM_ONE(b)) {
2042 s = bc_num_inv(a, c, scale);
2049 s = bc_num_ulong(b, &pow);
2052 bc_num_init(©, a->len);
2053 bc_num_copy(©, a);
2055 if (!neg) scale = BC_MIN(a->rdx * pow, BC_MAX(scale, a->rdx));
2059 for (powrdx = a->rdx; !(pow & 1); pow >>= 1) {
2061 s = bc_num_mul(©, ©, ©, powrdx);
2063 // Not needed: bc_num_mul() has a check for ^C:
2064 //if (G_interrupt) {
2065 // s = BC_STATUS_FAILURE;
2070 bc_num_copy(c, ©);
2072 for (resrdx = powrdx, pow >>= 1; pow != 0; pow >>= 1) {
2075 s = bc_num_mul(©, ©, ©, powrdx);
2080 s = bc_num_mul(c, ©, c, resrdx);
2083 // Not needed: bc_num_mul() has a check for ^C:
2084 //if (G_interrupt) {
2085 // s = BC_STATUS_FAILURE;
2091 s = bc_num_inv(c, c, scale);
2095 if (c->rdx > scale) bc_num_truncate(c, c->rdx - scale);
2097 // We can't use bc_num_clean() here.
2098 for (zero = true, i = 0; zero && i < c->len; ++i) zero = !c->num[i];
2099 if (zero) bc_num_setToZero(c, scale);
2106 static BcStatus bc_num_binary(BcNum *a, BcNum *b, BcNum *c, size_t scale,
2107 BcNumBinaryOp op, size_t req)
2110 BcNum num2, *ptr_a, *ptr_b;
2115 memcpy(ptr_a, c, sizeof(BcNum));
2124 memcpy(ptr_b, c, sizeof(BcNum));
2132 bc_num_init(c, req);
2134 bc_num_expand(c, req);
2136 s = op(ptr_a, ptr_b, c, scale);
2138 if (init) bc_num_free(&num2);
2143 static bool bc_num_strValid(const char *val, size_t base)
2146 bool small, radix = false;
2147 size_t i, len = strlen(val);
2149 if (!len) return true;
2152 b = (BcDig)(small ? base + '0' : base - 10 + 'A');
2154 for (i = 0; i < len; ++i) {
2160 if (radix) return false;
2166 if (c < '0' || (small && c >= b) || (c > '9' && (c < 'A' || c >= b)))
2173 static void bc_num_parseDecimal(BcNum *n, const char *val)
2179 for (i = 0; val[i] == '0'; ++i);
2186 for (i = 0; zero && i < len; ++i) zero = val[i] == '0' || val[i] == '.';
2187 bc_num_expand(n, len);
2190 ptr = strchr(val, '.');
2194 n->rdx = (size_t)((val + len) - (ptr + 1));
2197 for (i = len - 1; i < len; ++n->len, i -= 1 + (i && val[i - 1] == '.'))
2198 n->num[n->len] = val[i] - '0';
2202 static void bc_num_parseBase(BcNum *n, const char *val, BcNum *base)
2205 BcNum temp, mult, result;
2209 size_t i, digits, len = strlen(val);
2213 for (i = 0; zero && i < len; ++i) zero = (val[i] == '.' || val[i] == '0');
2216 bc_num_init(&temp, BC_NUM_DEF_SIZE);
2217 bc_num_init(&mult, BC_NUM_DEF_SIZE);
2219 for (i = 0; i < len; ++i) {
2222 if (c == '.') break;
2224 v = (unsigned long) (c <= '9' ? c - '0' : c - 'A' + 10);
2226 s = bc_num_mul(n, base, &mult, 0);
2227 if (s) goto int_err;
2228 bc_num_ulong2num(&temp, v);
2229 s = bc_num_add(&mult, &temp, n, 0);
2230 if (s) goto int_err;
2235 if (c == 0) goto int_err;
2238 bc_num_init(&result, base->len);
2239 bc_num_zero(&result);
2242 for (i += 1, digits = 0; i < len; ++i, ++digits) {
2247 v = (unsigned long) (c <= '9' ? c - '0' : c - 'A' + 10);
2249 s = bc_num_mul(&result, base, &result, 0);
2251 bc_num_ulong2num(&temp, v);
2252 s = bc_num_add(&result, &temp, &result, 0);
2254 s = bc_num_mul(&mult, base, &mult, 0);
2258 s = bc_num_div(&result, &mult, &result, digits);
2260 s = bc_num_add(n, &result, n, digits);
2264 if (n->rdx < digits) bc_num_extend(n, digits - n->rdx);
2270 bc_num_free(&result);
2276 static void bc_num_printNewline(size_t *nchars, size_t line_len)
2278 if (*nchars == line_len - 1) {
2286 static void bc_num_printChar(size_t num, size_t width, bool radix,
2287 size_t *nchars, size_t line_len)
2289 (void) radix, (void) line_len;
2290 bb_putchar((char) num);
2291 *nchars = *nchars + width;
2295 static void bc_num_printDigits(size_t num, size_t width, bool radix,
2296 size_t *nchars, size_t line_len)
2300 bc_num_printNewline(nchars, line_len);
2301 bb_putchar(radix ? '.' : ' ');
2304 bc_num_printNewline(nchars, line_len);
2305 for (exp = 0, pow = 1; exp < width - 1; ++exp, pow *= 10)
2308 for (exp = 0; exp < width; pow /= 10, ++(*nchars), ++exp) {
2310 bc_num_printNewline(nchars, line_len);
2313 bb_putchar(((char) dig) + '0');
2317 static void bc_num_printHex(size_t num, size_t width, bool radix,
2318 size_t *nchars, size_t line_len)
2321 bc_num_printNewline(nchars, line_len);
2326 bc_num_printNewline(nchars, line_len);
2327 bb_putchar(bb_hexdigits_upcase[num]);
2328 *nchars = *nchars + width;
2331 static void bc_num_printDecimal(BcNum *n, size_t *nchars, size_t len)
2333 size_t i, rdx = n->rdx - 1;
2335 if (n->neg) bb_putchar('-');
2336 (*nchars) += n->neg;
2338 for (i = n->len - 1; i < n->len; --i)
2339 bc_num_printHex((size_t) n->num[i], 1, i == rdx, nchars, len);
2342 static BcStatus bc_num_printNum(BcNum *n, BcNum *base, size_t width,
2343 size_t *nchars, size_t len, BcNumDigitOp print)
2347 BcNum intp, fracp, digit, frac_len;
2348 unsigned long dig, *ptr;
2353 print(0, width, false, nchars, len);
2354 return BC_STATUS_SUCCESS;
2357 bc_vec_init(&stack, sizeof(long), NULL);
2358 bc_num_init(&intp, n->len);
2359 bc_num_init(&fracp, n->rdx);
2360 bc_num_init(&digit, width);
2361 bc_num_init(&frac_len, BC_NUM_INT(n));
2362 bc_num_copy(&intp, n);
2363 bc_num_one(&frac_len);
2365 bc_num_truncate(&intp, intp.rdx);
2366 s = bc_num_sub(n, &intp, &fracp, 0);
2369 while (intp.len != 0) {
2370 s = bc_num_divmod(&intp, base, &intp, &digit, 0);
2372 s = bc_num_ulong(&digit, &dig);
2374 bc_vec_push(&stack, &dig);
2377 for (i = 0; i < stack.len; ++i) {
2378 ptr = bc_vec_item_rev(&stack, i);
2379 print(*ptr, width, false, nchars, len);
2382 if (!n->rdx) goto err;
2384 for (radix = true; frac_len.len <= n->rdx; radix = false) {
2385 s = bc_num_mul(&fracp, base, &fracp, n->rdx);
2387 s = bc_num_ulong(&fracp, &dig);
2389 bc_num_ulong2num(&intp, dig);
2390 s = bc_num_sub(&fracp, &intp, &fracp, 0);
2392 print(dig, width, radix, nchars, len);
2393 s = bc_num_mul(&frac_len, base, &frac_len, 0);
2398 bc_num_free(&frac_len);
2399 bc_num_free(&digit);
2400 bc_num_free(&fracp);
2402 bc_vec_free(&stack);
2406 static BcStatus bc_num_printBase(BcNum *n, BcNum *base, size_t base_t,
2407 size_t *nchars, size_t line_len)
2414 if (neg) bb_putchar('-');
2419 if (base_t <= BC_NUM_MAX_IBASE) {
2421 print = bc_num_printHex;
2424 for (i = base_t - 1, width = 0; i != 0; i /= 10, ++width);
2425 print = bc_num_printDigits;
2428 s = bc_num_printNum(n, base, width, nchars, line_len, print);
2435 static BcStatus bc_num_stream(BcNum *n, BcNum *base, size_t *nchars, size_t len)
2437 return bc_num_printNum(n, base, 1, nchars, len, bc_num_printChar);
2441 static BcStatus bc_num_parse(BcNum *n, const char *val, BcNum *base,
2444 if (!bc_num_strValid(val, base_t))
2445 return bc_error("bad number string");
2448 bc_num_parseDecimal(n, val);
2450 bc_num_parseBase(n, val, base);
2452 return BC_STATUS_SUCCESS;
2455 static BcStatus bc_num_print(BcNum *n, BcNum *base, size_t base_t, bool newline,
2456 size_t *nchars, size_t line_len)
2458 BcStatus s = BC_STATUS_SUCCESS;
2460 bc_num_printNewline(nchars, line_len);
2466 else if (base_t == 10)
2467 bc_num_printDecimal(n, nchars, line_len);
2469 s = bc_num_printBase(n, base, base_t, nchars, line_len);
2479 static BcStatus bc_num_add(BcNum *a, BcNum *b, BcNum *c, size_t scale)
2481 BcNumBinaryOp op = (!a->neg == !b->neg) ? bc_num_a : bc_num_s;
2483 return bc_num_binary(a, b, c, false, op, BC_NUM_AREQ(a, b));
2486 static BcStatus bc_num_sub(BcNum *a, BcNum *b, BcNum *c, size_t scale)
2488 BcNumBinaryOp op = (!a->neg == !b->neg) ? bc_num_s : bc_num_a;
2490 return bc_num_binary(a, b, c, true, op, BC_NUM_AREQ(a, b));
2493 static BcStatus bc_num_mul(BcNum *a, BcNum *b, BcNum *c, size_t scale)
2495 size_t req = BC_NUM_MREQ(a, b, scale);
2496 return bc_num_binary(a, b, c, scale, bc_num_m, req);
2499 static BcStatus bc_num_div(BcNum *a, BcNum *b, BcNum *c, size_t scale)
2501 size_t req = BC_NUM_MREQ(a, b, scale);
2502 return bc_num_binary(a, b, c, scale, bc_num_d, req);
2505 static BcStatus bc_num_mod(BcNum *a, BcNum *b, BcNum *c, size_t scale)
2507 size_t req = BC_NUM_MREQ(a, b, scale);
2508 return bc_num_binary(a, b, c, scale, bc_num_rem, req);
2511 static BcStatus bc_num_pow(BcNum *a, BcNum *b, BcNum *c, size_t scale)
2513 return bc_num_binary(a, b, c, scale, bc_num_p, a->len * b->len + 1);
2516 static BcStatus bc_num_sqrt(BcNum *a, BcNum *restrict b, size_t scale)
2519 BcNum num1, num2, half, f, fprime, *x0, *x1, *temp;
2520 size_t pow, len, digs, digs1, resrdx, req, times = 0;
2521 ssize_t cmp = 1, cmp1 = SSIZE_MAX, cmp2 = SSIZE_MAX;
2523 req = BC_MAX(scale, a->rdx) + ((BC_NUM_INT(a) + 1) >> 1) + 1;
2524 bc_num_expand(b, req);
2527 bc_num_setToZero(b, scale);
2528 return BC_STATUS_SUCCESS;
2531 return bc_error("negative number");
2532 else if (BC_NUM_ONE(a)) {
2534 bc_num_extend(b, scale);
2535 return BC_STATUS_SUCCESS;
2538 scale = BC_MAX(scale, a->rdx) + 1;
2539 len = a->len + scale;
2541 bc_num_init(&num1, len);
2542 bc_num_init(&num2, len);
2543 bc_num_init(&half, BC_NUM_DEF_SIZE);
2549 bc_num_init(&f, len);
2550 bc_num_init(&fprime, len);
2556 pow = BC_NUM_INT(a);
2565 pow -= 2 - (pow & 1);
2567 bc_num_extend(x0, pow);
2569 // Make sure to move the radix back.
2573 x0->rdx = digs = digs1 = 0;
2575 len = BC_NUM_INT(x0) + resrdx - 1;
2577 while (cmp != 0 || digs < len) {
2579 s = bc_num_div(a, x0, &f, resrdx);
2581 s = bc_num_add(x0, &f, &fprime, resrdx);
2583 s = bc_num_mul(&fprime, &half, x1, resrdx);
2586 cmp = bc_num_cmp(x1, x0);
2587 digs = x1->len - (unsigned long long) llabs(cmp);
2589 if (cmp == cmp2 && digs == digs1)
2594 resrdx += times > 4;
2607 if (b->rdx > scale) bc_num_truncate(b, b->rdx - scale);
2610 bc_num_free(&fprime);
2618 static BcStatus bc_num_divmod(BcNum *a, BcNum *b, BcNum *c, BcNum *d,
2624 size_t ts = BC_MAX(scale + b->rdx, a->rdx), len = BC_NUM_MREQ(a, b, ts);
2627 memcpy(&num2, c, sizeof(BcNum));
2629 bc_num_init(c, len);
2634 bc_num_expand(c, len);
2637 s = bc_num_r(ptr_a, b, c, d, scale, ts);
2639 if (init) bc_num_free(&num2);
2645 static BcStatus bc_num_modexp(BcNum *a, BcNum *b, BcNum *c, BcNum *restrict d)
2648 BcNum base, exp, two, temp;
2651 return bc_error("divide by zero");
2652 if (a->rdx || b->rdx || c->rdx)
2653 return bc_error("non integer number");
2655 return bc_error("negative number");
2657 bc_num_expand(d, c->len);
2658 bc_num_init(&base, c->len);
2659 bc_num_init(&exp, b->len);
2660 bc_num_init(&two, BC_NUM_DEF_SIZE);
2661 bc_num_init(&temp, b->len);
2667 s = bc_num_rem(a, c, &base, 0);
2669 bc_num_copy(&exp, b);
2671 while (exp.len != 0) {
2673 s = bc_num_divmod(&exp, &two, &exp, &temp, 0);
2676 if (BC_NUM_ONE(&temp)) {
2677 s = bc_num_mul(d, &base, &temp, 0);
2679 s = bc_num_rem(&temp, c, d, 0);
2683 s = bc_num_mul(&base, &base, &temp, 0);
2685 s = bc_num_rem(&temp, c, &base, 0);
2699 static BcStatus bc_func_insert(BcFunc *f, char *name, bool var)
2704 for (i = 0; i < f->autos.len; ++i) {
2705 if (strcmp(name, ((BcId *) bc_vec_item(&f->autos, i))->name) == 0)
2706 return bc_error("function parameter or auto var has the same name as another");
2712 bc_vec_push(&f->autos, &a);
2714 return BC_STATUS_SUCCESS;
2718 static void bc_func_init(BcFunc *f)
2720 bc_char_vec_init(&f->code);
2721 bc_vec_init(&f->autos, sizeof(BcId), bc_id_free);
2722 bc_vec_init(&f->labels, sizeof(size_t), NULL);
2726 static void bc_func_free(void *func)
2728 BcFunc *f = (BcFunc *) func;
2729 bc_vec_free(&f->code);
2730 bc_vec_free(&f->autos);
2731 bc_vec_free(&f->labels);
2734 static void bc_array_expand(BcVec *a, size_t len);
2736 static void bc_array_init(BcVec *a, bool nums)
2739 bc_vec_init(a, sizeof(BcNum), bc_num_free);
2741 bc_vec_init(a, sizeof(BcVec), bc_vec_free);
2742 bc_array_expand(a, 1);
2745 static void bc_array_expand(BcVec *a, size_t len)
2749 if (a->size == sizeof(BcNum) && a->dtor == bc_num_free) {
2750 while (len > a->len) {
2751 bc_num_init(&data.n, BC_NUM_DEF_SIZE);
2752 bc_vec_push(a, &data.n);
2756 while (len > a->len) {
2757 bc_array_init(&data.v, true);
2758 bc_vec_push(a, &data.v);
2763 static void bc_array_copy(BcVec *d, const BcVec *s)
2768 bc_vec_expand(d, s->cap);
2771 for (i = 0; i < s->len; ++i) {
2772 BcNum *dnum = bc_vec_item(d, i), *snum = bc_vec_item(s, i);
2773 bc_num_init(dnum, snum->len);
2774 bc_num_copy(dnum, snum);
2778 static void bc_string_free(void *string)
2780 free(*((char **) string));
2784 static void bc_result_copy(BcResult *d, BcResult *src)
2790 case BC_RESULT_TEMP:
2791 case BC_RESULT_IBASE:
2792 case BC_RESULT_SCALE:
2793 case BC_RESULT_OBASE:
2795 bc_num_init(&d->d.n, src->d.n.len);
2796 bc_num_copy(&d->d.n, &src->d.n);
2801 case BC_RESULT_ARRAY:
2802 case BC_RESULT_ARRAY_ELEM:
2804 d->d.id.name = xstrdup(src->d.id.name);
2808 case BC_RESULT_CONSTANT:
2809 case BC_RESULT_LAST:
2813 memcpy(&d->d.n, &src->d.n, sizeof(BcNum));
2820 static void bc_result_free(void *result)
2822 BcResult *r = (BcResult *) result;
2826 case BC_RESULT_TEMP:
2827 case BC_RESULT_IBASE:
2828 case BC_RESULT_SCALE:
2829 case BC_RESULT_OBASE:
2831 bc_num_free(&r->d.n);
2836 case BC_RESULT_ARRAY:
2837 case BC_RESULT_ARRAY_ELEM:
2851 static void bc_lex_lineComment(BcLex *l)
2853 l->t.t = BC_LEX_WHITESPACE;
2854 while (l->i < l->len && l->buf[l->i++] != '\n');
2858 static void bc_lex_whitespace(BcLex *l)
2861 l->t.t = BC_LEX_WHITESPACE;
2862 for (c = l->buf[l->i]; c != '\n' && isspace(c); c = l->buf[++l->i]);
2865 static BcStatus bc_lex_number(BcLex *l, char start)
2867 const char *buf = l->buf + l->i;
2868 size_t len, hits = 0, bslashes = 0, i = 0, j;
2870 bool last_pt, pt = start == '.';
2873 l->t.t = BC_LEX_NUMBER;
2875 while (c != 0 && (isdigit(c) || (c >= 'A' && c <= 'F') ||
2876 (c == '.' && !pt) || (c == '\\' && buf[i + 1] == '\n')))
2890 len = i + !last_pt - bslashes * 2;
2891 if (len > BC_MAX_NUM)
2892 return bc_error("number too long: must be [1, BC_NUM_MAX]");
2894 bc_vec_pop_all(&l->t.v);
2895 bc_vec_expand(&l->t.v, len + 1);
2896 bc_vec_push(&l->t.v, &start);
2898 for (buf -= 1, j = 1; j < len + hits * 2; ++j) {
2902 // If we have hit a backslash, skip it. We don't have
2903 // to check for a newline because it's guaranteed.
2904 if (hits < bslashes && c == '\\') {
2910 bc_vec_push(&l->t.v, &c);
2913 bc_vec_pushZeroByte(&l->t.v);
2916 return BC_STATUS_SUCCESS;
2919 static BcStatus bc_lex_name(BcLex *l)
2922 const char *buf = l->buf + l->i - 1;
2925 l->t.t = BC_LEX_NAME;
2927 while ((c >= 'a' && c <= 'z') || isdigit(c) || c == '_') c = buf[++i];
2929 if (i > BC_MAX_STRING)
2930 return bc_error("name too long: must be [1, BC_NAME_MAX]");
2931 bc_vec_string(&l->t.v, i, buf);
2933 // Increment the index. We minus 1 because it has already been incremented.
2936 return BC_STATUS_SUCCESS;
2939 static void bc_lex_init(BcLex *l, BcLexNext next)
2942 bc_char_vec_init(&l->t.v);
2945 static void bc_lex_free(BcLex *l)
2947 bc_vec_free(&l->t.v);
2950 static void bc_lex_file(BcLex *l)
2952 G.err_line = l->line = 1;
2956 static BcStatus bc_lex_next(BcLex *l)
2961 if (l->t.last == BC_LEX_EOF) return bc_error("end of file");
2963 l->line += l->newline;
2964 G.err_line = l->line;
2965 l->t.t = BC_LEX_EOF;
2967 l->newline = (l->i == l->len);
2968 if (l->newline) return BC_STATUS_SUCCESS;
2970 // Loop until failure or we don't have whitespace. This
2971 // is so the parser doesn't get inundated with whitespace.
2974 } while (!s && l->t.t == BC_LEX_WHITESPACE);
2979 static BcStatus bc_lex_text(BcLex *l, const char *text)
2983 l->len = strlen(text);
2984 l->t.t = l->t.last = BC_LEX_INVALID;
2985 return bc_lex_next(l);
2989 static BcStatus bc_lex_identifier(BcLex *l)
2993 const char *buf = l->buf + l->i - 1;
2995 for (i = 0; i < ARRAY_SIZE(bc_lex_kws); ++i) {
2996 const char *keyword8 = bc_lex_kws[i].name8;
2998 while (buf[j] != '\0' && buf[j] == keyword8[j]) {
3000 if (j == 8) goto match;
3002 if (keyword8[j] != '\0')
3005 // buf starts with keyword bc_lex_kws[i]
3006 l->t.t = BC_LEX_KEY_1st_keyword + i;
3007 if (!bc_lex_kws_POSIX(i)) {
3008 s = bc_posix_error_fmt("%sthe '%.8s' keyword", "POSIX does not allow ", bc_lex_kws[i].name8);
3012 // We minus 1 because the index has already been incremented.
3014 return BC_STATUS_SUCCESS;
3020 if (l->t.v.len > 2) {
3023 // bc: POSIX only allows one character names; the following is bad: 'qwe=1
3025 unsigned len = strchrnul(buf, '\n') - buf;
3026 s = bc_posix_error_fmt("POSIX only allows one character names; the following is bad: '%.*s'", len, buf);
3032 static BcStatus bc_lex_string(BcLex *l)
3034 size_t len, nls = 0, i = l->i;
3037 l->t.t = BC_LEX_STR;
3039 for (c = l->buf[i]; c != 0 && c != '"'; c = l->buf[++i]) nls += (c == '\n');
3043 return bc_error("string end could not be found");
3047 if (len > BC_MAX_STRING)
3048 return bc_error("string too long: must be [1, BC_STRING_MAX]");
3049 bc_vec_string(&l->t.v, len, l->buf + l->i);
3053 G.err_line = l->line;
3055 return BC_STATUS_SUCCESS;
3058 static void bc_lex_assign(BcLex *l, BcLexType with, BcLexType without)
3060 if (l->buf[l->i] == '=') {
3068 static BcStatus bc_lex_comment(BcLex *l)
3071 const char *buf = l->buf;
3073 l->t.t = BC_LEX_WHITESPACE;
3086 return bc_error("comment end could not be found");
3094 G.err_line = l->line;
3096 return BC_STATUS_SUCCESS;
3099 static BcStatus bc_lex_token(BcLex *l)
3101 BcStatus s = BC_STATUS_SUCCESS;
3102 char c = l->buf[l->i++], c2;
3104 // This is the workhorse of the lexer.
3111 l->t.t = !c ? BC_LEX_EOF : BC_LEX_NLINE;
3121 bc_lex_whitespace(l);
3127 bc_lex_assign(l, BC_LEX_OP_REL_NE, BC_LEX_OP_BOOL_NOT);
3129 if (l->t.t == BC_LEX_OP_BOOL_NOT) {
3130 s = bc_POSIX_does_not_allow_bool_ops_this_is_bad("!");
3139 s = bc_lex_string(l);
3145 s = bc_POSIX_does_not_allow("'#' script comments");
3148 bc_lex_lineComment(l);
3155 bc_lex_assign(l, BC_LEX_OP_ASSIGN_MODULUS, BC_LEX_OP_MODULUS);
3164 s = bc_POSIX_does_not_allow_bool_ops_this_is_bad("&&");
3168 l->t.t = BC_LEX_OP_BOOL_AND;
3171 l->t.t = BC_LEX_INVALID;
3172 s = bc_error_bad_character('&');
3181 l->t.t = (BcLexType)(c - '(' + BC_LEX_LPAREN);
3187 bc_lex_assign(l, BC_LEX_OP_ASSIGN_MULTIPLY, BC_LEX_OP_MULTIPLY);
3196 l->t.t = BC_LEX_OP_INC;
3199 bc_lex_assign(l, BC_LEX_OP_ASSIGN_PLUS, BC_LEX_OP_PLUS);
3205 l->t.t = BC_LEX_COMMA;
3214 l->t.t = BC_LEX_OP_DEC;
3217 bc_lex_assign(l, BC_LEX_OP_ASSIGN_MINUS, BC_LEX_OP_MINUS);
3223 if (isdigit(l->buf[l->i]))
3224 s = bc_lex_number(l, c);
3226 l->t.t = BC_LEX_KEY_LAST;
3227 s = bc_POSIX_does_not_allow("a period ('.') as a shortcut for the last result");
3236 s = bc_lex_comment(l);
3238 bc_lex_assign(l, BC_LEX_OP_ASSIGN_DIVIDE, BC_LEX_OP_DIVIDE);
3259 s = bc_lex_number(l, c);
3265 l->t.t = BC_LEX_SCOLON;
3271 bc_lex_assign(l, BC_LEX_OP_REL_LE, BC_LEX_OP_REL_LT);
3277 bc_lex_assign(l, BC_LEX_OP_REL_EQ, BC_LEX_OP_ASSIGN);
3283 bc_lex_assign(l, BC_LEX_OP_REL_GE, BC_LEX_OP_REL_GT);
3290 l->t.t = (BcLexType)(c - '[' + BC_LEX_LBRACKET);
3296 if (l->buf[l->i] == '\n') {
3297 l->t.t = BC_LEX_WHITESPACE;
3301 s = bc_error_bad_character(c);
3307 bc_lex_assign(l, BC_LEX_OP_ASSIGN_POWER, BC_LEX_OP_POWER);
3338 s = bc_lex_identifier(l);
3345 l->t.t = (BcLexType)(c - '{' + BC_LEX_LBRACE);
3354 s = bc_POSIX_does_not_allow_bool_ops_this_is_bad("||");
3358 l->t.t = BC_LEX_OP_BOOL_OR;
3361 l->t.t = BC_LEX_INVALID;
3362 s = bc_error_bad_character(c);
3370 l->t.t = BC_LEX_INVALID;
3371 s = bc_error_bad_character(c);
3381 static BcStatus dc_lex_register(BcLex *l)
3383 BcStatus s = BC_STATUS_SUCCESS;
3385 if (isspace(l->buf[l->i - 1])) {
3386 bc_lex_whitespace(l);
3389 s = bc_error("extended register");
3394 bc_vec_pop_all(&l->t.v);
3395 bc_vec_push(&l->t.v, &l->buf[l->i - 1]);
3396 bc_vec_pushZeroByte(&l->t.v);
3397 l->t.t = BC_LEX_NAME;
3403 static BcStatus dc_lex_string(BcLex *l)
3405 size_t depth = 1, nls = 0, i = l->i;
3408 l->t.t = BC_LEX_STR;
3409 bc_vec_pop_all(&l->t.v);
3411 for (c = l->buf[i]; c != 0 && depth; c = l->buf[++i]) {
3413 depth += (c == '[' && (i == l->i || l->buf[i - 1] != '\\'));
3414 depth -= (c == ']' && (i == l->i || l->buf[i - 1] != '\\'));
3417 if (depth) bc_vec_push(&l->t.v, &c);
3422 return bc_error("string end could not be found");
3425 bc_vec_pushZeroByte(&l->t.v);
3426 if (i - l->i > BC_MAX_STRING)
3427 return bc_error("string too long: must be [1, BC_STRING_MAX]");
3431 G.err_line = l->line;
3433 return BC_STATUS_SUCCESS;
3436 static BcStatus dc_lex_token(BcLex *l)
3438 BcStatus s = BC_STATUS_SUCCESS;
3439 char c = l->buf[l->i++], c2;
3442 for (i = 0; i < ARRAY_SIZE(dc_lex_regs); ++i) {
3443 if (l->t.last == dc_lex_regs[i])
3444 return dc_lex_register(l);
3447 if (c >= '%' && c <= '~' &&
3448 (l->t.t = dc_lex_tokens[(c - '%')]) != BC_LEX_INVALID)
3453 // This is the workhorse of the lexer.
3458 l->t.t = BC_LEX_EOF;
3469 l->newline = (c == '\n');
3470 bc_lex_whitespace(l);
3479 l->t.t = BC_LEX_OP_REL_NE;
3481 l->t.t = BC_LEX_OP_REL_LE;
3483 l->t.t = BC_LEX_OP_REL_GE;
3485 return bc_error_bad_character(c);
3493 bc_lex_lineComment(l);
3499 if (isdigit(l->buf[l->i]))
3500 s = bc_lex_number(l, c);
3502 s = bc_error_bad_character(c);
3523 s = bc_lex_number(l, c);
3529 s = dc_lex_string(l);
3535 l->t.t = BC_LEX_INVALID;
3536 s = bc_error_bad_character(c);
3545 static void bc_program_addFunc(char *name, size_t *idx);
3547 static void bc_parse_addFunc(BcParse *p, char *name, size_t *idx)
3549 bc_program_addFunc(name, idx);
3550 p->func = bc_vec_item(&G.prog.fns, p->fidx);
3553 #define bc_parse_push(p, i) bc_vec_pushByte(&(p)->func->code, (char) (i))
3555 static void bc_parse_pushName(BcParse *p, char *name)
3557 size_t i = 0, len = strlen(name);
3559 for (; i < len; ++i) bc_parse_push(p, name[i]);
3560 bc_parse_push(p, BC_PARSE_STREND);
3565 static void bc_parse_pushIndex(BcParse *p, size_t idx)
3567 unsigned char amt, i, nums[sizeof(size_t)];
3569 for (amt = 0; idx; ++amt) {
3570 nums[amt] = (char) idx;
3571 idx = (idx & ((unsigned long) ~(UCHAR_MAX))) >> sizeof(char) * CHAR_BIT;
3574 bc_parse_push(p, amt);
3575 for (i = 0; i < amt; ++i) bc_parse_push(p, nums[i]);
3578 static void bc_parse_number(BcParse *p, BcInst *prev, size_t *nexs)
3580 char *num = xstrdup(p->l.t.v.v);
3581 size_t idx = G.prog.consts.len;
3583 bc_vec_push(&G.prog.consts, &num);
3585 bc_parse_push(p, BC_INST_NUM);
3586 bc_parse_pushIndex(p, idx);
3589 (*prev) = BC_INST_NUM;
3592 static BcStatus bc_parse_text(BcParse *p, const char *text)
3596 p->func = bc_vec_item(&G.prog.fns, p->fidx);
3598 if (!text[0] && !BC_PARSE_CAN_EXEC(p)) {
3599 p->l.t.t = BC_LEX_INVALID;
3602 if (!BC_PARSE_CAN_EXEC(p))
3603 return bc_error("file is not executable");
3606 return bc_lex_text(&p->l, text);
3609 // Called when parsing or execution detects a failure,
3610 // resets execution structures.
3611 static void bc_program_reset(void)
3616 bc_vec_npop(&G.prog.stack, G.prog.stack.len - 1);
3617 bc_vec_pop_all(&G.prog.results);
3619 f = bc_vec_item(&G.prog.fns, 0);
3620 ip = bc_vec_top(&G.prog.stack);
3621 ip->idx = f->code.len;
3624 #define bc_parse_updateFunc(p, f) \
3625 ((p)->func = bc_vec_item(&G.prog.fns, ((p)->fidx = (f))))
3627 // Called when bc/dc_parse_parse() detects a failure,
3628 // resets parsing structures.
3629 static void bc_parse_reset(BcParse *p)
3631 if (p->fidx != BC_PROG_MAIN) {
3632 p->func->nparams = 0;
3633 bc_vec_pop_all(&p->func->code);
3634 bc_vec_pop_all(&p->func->autos);
3635 bc_vec_pop_all(&p->func->labels);
3637 bc_parse_updateFunc(p, BC_PROG_MAIN);
3641 p->l.t.t = BC_LEX_EOF;
3642 p->auto_part = (p->nbraces = 0);
3644 bc_vec_npop(&p->flags, p->flags.len - 1);
3645 bc_vec_pop_all(&p->exits);
3646 bc_vec_pop_all(&p->conds);
3647 bc_vec_pop_all(&p->ops);
3652 static void bc_parse_free(BcParse *p)
3654 bc_vec_free(&p->flags);
3655 bc_vec_free(&p->exits);
3656 bc_vec_free(&p->conds);
3657 bc_vec_free(&p->ops);
3661 static void bc_parse_create(BcParse *p, size_t func,
3662 BcParseParse parse, BcLexNext next)
3664 memset(p, 0, sizeof(BcParse));
3666 bc_lex_init(&p->l, next);
3667 bc_vec_init(&p->flags, sizeof(uint8_t), NULL);
3668 bc_vec_init(&p->exits, sizeof(BcInstPtr), NULL);
3669 bc_vec_init(&p->conds, sizeof(size_t), NULL);
3670 bc_vec_pushZeroByte(&p->flags);
3671 bc_vec_init(&p->ops, sizeof(BcLexType), NULL);
3674 // p->auto_part = p->nbraces = 0; - already is
3675 bc_parse_updateFunc(p, func);
3680 #define BC_PARSE_TOP_OP(p) (*((BcLexType *) bc_vec_top(&(p)->ops)))
3681 #define BC_PARSE_LEAF(p, rparen) \
3682 (((p) >= BC_INST_NUM && (p) <= BC_INST_SQRT) || (rparen) || \
3683 (p) == BC_INST_INC_POST || (p) == BC_INST_DEC_POST)
3685 // We can calculate the conversion between tokens and exprs by subtracting the
3686 // position of the first operator in the lex enum and adding the position of the
3687 // first in the expr enum. Note: This only works for binary operators.
3688 #define BC_PARSE_TOKEN_INST(t) ((char) ((t) -BC_LEX_NEG + BC_INST_NEG))
3690 static BcStatus bc_parse_else(BcParse *p);
3691 static BcStatus bc_parse_stmt(BcParse *p);
3692 static BcStatus bc_parse_expr(BcParse *p, uint8_t flags, BcParseNext next);
3693 static BcStatus bc_parse_expr_empty_ok(BcParse *p, uint8_t flags, BcParseNext next);
3695 static BcStatus bc_parse_operator(BcParse *p, BcLexType type, size_t start,
3696 size_t *nexprs, bool next)
3698 BcStatus s = BC_STATUS_SUCCESS;
3700 char l, r = bc_parse_op_PREC(type - BC_LEX_OP_INC);
3701 bool left = bc_parse_op_LEFT(type - BC_LEX_OP_INC);
3703 while (p->ops.len > start) {
3705 t = BC_PARSE_TOP_OP(p);
3706 if (t == BC_LEX_LPAREN) break;
3708 l = bc_parse_op_PREC(t - BC_LEX_OP_INC);
3709 if (l >= r && (l != r || !left)) break;
3711 bc_parse_push(p, BC_PARSE_TOKEN_INST(t));
3712 bc_vec_pop(&p->ops);
3713 *nexprs -= t != BC_LEX_OP_BOOL_NOT && t != BC_LEX_NEG;
3716 bc_vec_push(&p->ops, &type);
3717 if (next) s = bc_lex_next(&p->l);
3722 static BcStatus bc_parse_rightParen(BcParse *p, size_t ops_bgn, size_t *nexs)
3726 if (p->ops.len <= ops_bgn)
3727 return bc_error_bad_expression();
3728 top = BC_PARSE_TOP_OP(p);
3730 while (top != BC_LEX_LPAREN) {
3732 bc_parse_push(p, BC_PARSE_TOKEN_INST(top));
3734 bc_vec_pop(&p->ops);
3735 *nexs -= top != BC_LEX_OP_BOOL_NOT && top != BC_LEX_NEG;
3737 if (p->ops.len <= ops_bgn)
3738 return bc_error_bad_expression();
3739 top = BC_PARSE_TOP_OP(p);
3742 bc_vec_pop(&p->ops);
3744 return bc_lex_next(&p->l);
3747 static BcStatus bc_parse_params(BcParse *p, uint8_t flags)
3753 s = bc_lex_next(&p->l);
3756 for (nparams = 0; p->l.t.t != BC_LEX_RPAREN; ++nparams) {
3758 flags = (flags & ~(BC_PARSE_PRINT | BC_PARSE_REL)) | BC_PARSE_ARRAY;
3759 s = bc_parse_expr(p, flags, bc_parse_next_param);
3762 comma = p->l.t.t == BC_LEX_COMMA;
3764 s = bc_lex_next(&p->l);
3769 if (comma) return bc_error_bad_token();
3770 bc_parse_push(p, BC_INST_CALL);
3771 bc_parse_pushIndex(p, nparams);
3773 return BC_STATUS_SUCCESS;
3776 static BcStatus bc_parse_call(BcParse *p, char *name, uint8_t flags)
3779 BcId entry, *entry_ptr;
3784 s = bc_parse_params(p, flags);
3787 if (p->l.t.t != BC_LEX_RPAREN) {
3788 s = bc_error_bad_token();
3792 idx = bc_map_index(&G.prog.fn_map, &entry);
3794 if (idx == BC_VEC_INVALID_IDX) {
3795 name = xstrdup(entry.name);
3796 bc_parse_addFunc(p, name, &idx);
3797 idx = bc_map_index(&G.prog.fn_map, &entry);
3803 entry_ptr = bc_vec_item(&G.prog.fn_map, idx);
3804 bc_parse_pushIndex(p, entry_ptr->idx);
3806 return bc_lex_next(&p->l);
3813 static BcStatus bc_parse_name(BcParse *p, BcInst *type, uint8_t flags)
3818 name = xstrdup(p->l.t.v.v);
3819 s = bc_lex_next(&p->l);
3822 if (p->l.t.t == BC_LEX_LBRACKET) {
3824 s = bc_lex_next(&p->l);
3827 if (p->l.t.t == BC_LEX_RBRACKET) {
3829 if (!(flags & BC_PARSE_ARRAY)) {
3830 s = bc_error_bad_expression();
3834 *type = BC_INST_ARRAY;
3838 *type = BC_INST_ARRAY_ELEM;
3840 flags &= ~(BC_PARSE_PRINT | BC_PARSE_REL);
3841 s = bc_parse_expr(p, flags, bc_parse_next_elem);
3845 s = bc_lex_next(&p->l);
3847 bc_parse_push(p, *type);
3848 bc_parse_pushName(p, name);
3850 else if (p->l.t.t == BC_LEX_LPAREN) {
3852 if (flags & BC_PARSE_NOCALL) {
3853 s = bc_error_bad_token();
3857 *type = BC_INST_CALL;
3858 s = bc_parse_call(p, name, flags);
3861 *type = BC_INST_VAR;
3862 bc_parse_push(p, BC_INST_VAR);
3863 bc_parse_pushName(p, name);
3873 static BcStatus bc_parse_read(BcParse *p)
3877 s = bc_lex_next(&p->l);
3879 if (p->l.t.t != BC_LEX_LPAREN) return bc_error_bad_token();
3881 s = bc_lex_next(&p->l);
3883 if (p->l.t.t != BC_LEX_RPAREN) return bc_error_bad_token();
3885 bc_parse_push(p, BC_INST_READ);
3887 return bc_lex_next(&p->l);
3890 static BcStatus bc_parse_builtin(BcParse *p, BcLexType type, uint8_t flags,
3895 s = bc_lex_next(&p->l);
3897 if (p->l.t.t != BC_LEX_LPAREN) return bc_error_bad_token();
3899 flags = (flags & ~(BC_PARSE_PRINT | BC_PARSE_REL)) | BC_PARSE_ARRAY;
3901 s = bc_lex_next(&p->l);
3904 s = bc_parse_expr(p, flags, bc_parse_next_rel);
3907 if (p->l.t.t != BC_LEX_RPAREN) return bc_error_bad_token();
3909 *prev = (type == BC_LEX_KEY_LENGTH) ? BC_INST_LENGTH : BC_INST_SQRT;
3910 bc_parse_push(p, *prev);
3912 return bc_lex_next(&p->l);
3915 static BcStatus bc_parse_scale(BcParse *p, BcInst *type, uint8_t flags)
3919 s = bc_lex_next(&p->l);
3922 if (p->l.t.t != BC_LEX_LPAREN) {
3923 *type = BC_INST_SCALE;
3924 bc_parse_push(p, BC_INST_SCALE);
3925 return BC_STATUS_SUCCESS;
3928 *type = BC_INST_SCALE_FUNC;
3929 flags &= ~(BC_PARSE_PRINT | BC_PARSE_REL);
3931 s = bc_lex_next(&p->l);
3934 s = bc_parse_expr(p, flags, bc_parse_next_rel);
3936 if (p->l.t.t != BC_LEX_RPAREN) return bc_error_bad_token();
3937 bc_parse_push(p, BC_INST_SCALE_FUNC);
3939 return bc_lex_next(&p->l);
3942 static BcStatus bc_parse_incdec(BcParse *p, BcInst *prev, bool *paren_expr,
3943 size_t *nexprs, uint8_t flags)
3948 BcInst etype = *prev;
3950 if (etype == BC_INST_VAR || etype == BC_INST_ARRAY_ELEM ||
3951 etype == BC_INST_SCALE || etype == BC_INST_LAST ||
3952 etype == BC_INST_IBASE || etype == BC_INST_OBASE)
3954 *prev = inst = BC_INST_INC_POST + (p->l.t.t != BC_LEX_OP_INC);
3955 bc_parse_push(p, inst);
3956 s = bc_lex_next(&p->l);
3960 *prev = inst = BC_INST_INC_PRE + (p->l.t.t != BC_LEX_OP_INC);
3963 s = bc_lex_next(&p->l);
3967 // Because we parse the next part of the expression
3968 // right here, we need to increment this.
3969 *nexprs = *nexprs + 1;
3975 s = bc_parse_name(p, prev, flags | BC_PARSE_NOCALL);
3979 case BC_LEX_KEY_IBASE:
3980 case BC_LEX_KEY_LAST:
3981 case BC_LEX_KEY_OBASE:
3983 bc_parse_push(p, type - BC_LEX_KEY_IBASE + BC_INST_IBASE);
3984 s = bc_lex_next(&p->l);
3988 case BC_LEX_KEY_SCALE:
3990 s = bc_lex_next(&p->l);
3992 if (p->l.t.t == BC_LEX_LPAREN)
3993 s = bc_error_bad_token();
3995 bc_parse_push(p, BC_INST_SCALE);
4001 s = bc_error_bad_token();
4006 if (!s) bc_parse_push(p, inst);
4012 static BcStatus bc_parse_minus(BcParse *p, BcInst *prev, size_t ops_bgn,
4013 bool rparen, size_t *nexprs)
4017 BcInst etype = *prev;
4019 s = bc_lex_next(&p->l);
4022 type = rparen || etype == BC_INST_INC_POST || etype == BC_INST_DEC_POST ||
4023 (etype >= BC_INST_NUM && etype <= BC_INST_SQRT) ?
4026 *prev = BC_PARSE_TOKEN_INST(type);
4028 // We can just push onto the op stack because this is the largest
4029 // precedence operator that gets pushed. Inc/dec does not.
4030 if (type != BC_LEX_OP_MINUS)
4031 bc_vec_push(&p->ops, &type);
4033 s = bc_parse_operator(p, type, ops_bgn, nexprs, false);
4038 static BcStatus bc_parse_string(BcParse *p, char inst)
4040 char *str = xstrdup(p->l.t.v.v);
4042 bc_parse_push(p, BC_INST_STR);
4043 bc_parse_pushIndex(p, G.prog.strs.len);
4044 bc_vec_push(&G.prog.strs, &str);
4045 bc_parse_push(p, inst);
4047 return bc_lex_next(&p->l);
4050 static BcStatus bc_parse_print(BcParse *p)
4056 s = bc_lex_next(&p->l);
4061 if (type == BC_LEX_SCOLON || type == BC_LEX_NLINE)
4062 return bc_error("bad print statement");
4064 while (!s && type != BC_LEX_SCOLON && type != BC_LEX_NLINE) {
4066 if (type == BC_LEX_STR)
4067 s = bc_parse_string(p, BC_INST_PRINT_POP);
4069 s = bc_parse_expr(p, 0, bc_parse_next_print);
4071 bc_parse_push(p, BC_INST_PRINT_POP);
4076 comma = p->l.t.t == BC_LEX_COMMA;
4077 if (comma) s = bc_lex_next(&p->l);
4082 if (comma) return bc_error_bad_token();
4084 return bc_lex_next(&p->l);
4087 static BcStatus bc_parse_return(BcParse *p)
4093 if (!BC_PARSE_FUNC(p)) return bc_error_bad_token();
4095 s = bc_lex_next(&p->l);
4099 paren = t == BC_LEX_LPAREN;
4101 if (t == BC_LEX_NLINE || t == BC_LEX_SCOLON)
4102 bc_parse_push(p, BC_INST_RET0);
4105 s = bc_parse_expr_empty_ok(p, 0, bc_parse_next_expr);
4106 if (s == BC_STATUS_PARSE_EMPTY_EXP) {
4107 bc_parse_push(p, BC_INST_RET0);
4108 s = bc_lex_next(&p->l);
4112 if (!paren || p->l.t.last != BC_LEX_RPAREN) {
4113 s = bc_POSIX_requires("parentheses around return expressions");
4117 bc_parse_push(p, BC_INST_RET);
4123 static BcStatus bc_parse_endBody(BcParse *p, bool brace)
4125 BcStatus s = BC_STATUS_SUCCESS;
4127 if (p->flags.len <= 1 || (brace && p->nbraces == 0))
4128 return bc_error_bad_token();
4132 if (p->l.t.t == BC_LEX_RBRACE) {
4133 if (!p->nbraces) return bc_error_bad_token();
4135 s = bc_lex_next(&p->l);
4139 return bc_error_bad_token();
4142 if (BC_PARSE_IF(p)) {
4146 while (p->l.t.t == BC_LEX_NLINE) {
4147 s = bc_lex_next(&p->l);
4151 bc_vec_pop(&p->flags);
4153 flag_ptr = BC_PARSE_TOP_FLAG_PTR(p);
4154 *flag_ptr = (*flag_ptr | BC_PARSE_FLAG_IF_END);
4156 if (p->l.t.t == BC_LEX_KEY_ELSE) s = bc_parse_else(p);
4158 else if (BC_PARSE_ELSE(p)) {
4163 bc_vec_pop(&p->flags);
4165 ip = bc_vec_top(&p->exits);
4166 label = bc_vec_item(&p->func->labels, ip->idx);
4167 *label = p->func->code.len;
4169 bc_vec_pop(&p->exits);
4171 else if (BC_PARSE_FUNC_INNER(p)) {
4172 bc_parse_push(p, BC_INST_RET0);
4173 bc_parse_updateFunc(p, BC_PROG_MAIN);
4174 bc_vec_pop(&p->flags);
4178 BcInstPtr *ip = bc_vec_top(&p->exits);
4179 size_t *label = bc_vec_top(&p->conds);
4181 bc_parse_push(p, BC_INST_JUMP);
4182 bc_parse_pushIndex(p, *label);
4184 label = bc_vec_item(&p->func->labels, ip->idx);
4185 *label = p->func->code.len;
4187 bc_vec_pop(&p->flags);
4188 bc_vec_pop(&p->exits);
4189 bc_vec_pop(&p->conds);
4195 static void bc_parse_startBody(BcParse *p, uint8_t flags)
4197 uint8_t *flag_ptr = BC_PARSE_TOP_FLAG_PTR(p);
4198 flags |= (*flag_ptr & (BC_PARSE_FLAG_FUNC | BC_PARSE_FLAG_LOOP));
4199 flags |= BC_PARSE_FLAG_BODY;
4200 bc_vec_push(&p->flags, &flags);
4203 static void bc_parse_noElse(BcParse *p)
4207 uint8_t *flag_ptr = BC_PARSE_TOP_FLAG_PTR(p);
4209 *flag_ptr = (*flag_ptr & ~(BC_PARSE_FLAG_IF_END));
4211 ip = bc_vec_top(&p->exits);
4212 label = bc_vec_item(&p->func->labels, ip->idx);
4213 *label = p->func->code.len;
4215 bc_vec_pop(&p->exits);
4218 static BcStatus bc_parse_if(BcParse *p)
4223 s = bc_lex_next(&p->l);
4225 if (p->l.t.t != BC_LEX_LPAREN) return bc_error_bad_token();
4227 s = bc_lex_next(&p->l);
4229 s = bc_parse_expr(p, BC_PARSE_REL, bc_parse_next_rel);
4231 if (p->l.t.t != BC_LEX_RPAREN) return bc_error_bad_token();
4233 s = bc_lex_next(&p->l);
4235 bc_parse_push(p, BC_INST_JUMP_ZERO);
4237 ip.idx = p->func->labels.len;
4238 ip.func = ip.len = 0;
4240 bc_parse_pushIndex(p, ip.idx);
4241 bc_vec_push(&p->exits, &ip);
4242 bc_vec_push(&p->func->labels, &ip.idx);
4243 bc_parse_startBody(p, BC_PARSE_FLAG_IF);
4245 return BC_STATUS_SUCCESS;
4248 static BcStatus bc_parse_else(BcParse *p)
4252 if (!BC_PARSE_IF_END(p)) return bc_error_bad_token();
4254 ip.idx = p->func->labels.len;
4255 ip.func = ip.len = 0;
4257 bc_parse_push(p, BC_INST_JUMP);
4258 bc_parse_pushIndex(p, ip.idx);
4262 bc_vec_push(&p->exits, &ip);
4263 bc_vec_push(&p->func->labels, &ip.idx);
4264 bc_parse_startBody(p, BC_PARSE_FLAG_ELSE);
4266 return bc_lex_next(&p->l);
4269 static BcStatus bc_parse_while(BcParse *p)
4274 s = bc_lex_next(&p->l);
4276 if (p->l.t.t != BC_LEX_LPAREN) return bc_error_bad_token();
4277 s = bc_lex_next(&p->l);
4280 ip.idx = p->func->labels.len;
4282 bc_vec_push(&p->func->labels, &p->func->code.len);
4283 bc_vec_push(&p->conds, &ip.idx);
4285 ip.idx = p->func->labels.len;
4289 bc_vec_push(&p->exits, &ip);
4290 bc_vec_push(&p->func->labels, &ip.idx);
4292 s = bc_parse_expr(p, BC_PARSE_REL, bc_parse_next_rel);
4294 if (p->l.t.t != BC_LEX_RPAREN) return bc_error_bad_token();
4295 s = bc_lex_next(&p->l);
4298 bc_parse_push(p, BC_INST_JUMP_ZERO);
4299 bc_parse_pushIndex(p, ip.idx);
4300 bc_parse_startBody(p, BC_PARSE_FLAG_LOOP | BC_PARSE_FLAG_LOOP_INNER);
4302 return BC_STATUS_SUCCESS;
4305 static BcStatus bc_parse_for(BcParse *p)
4309 size_t cond_idx, exit_idx, body_idx, update_idx;
4311 s = bc_lex_next(&p->l);
4313 if (p->l.t.t != BC_LEX_LPAREN) return bc_error_bad_token();
4314 s = bc_lex_next(&p->l);
4317 if (p->l.t.t != BC_LEX_SCOLON)
4318 s = bc_parse_expr(p, 0, bc_parse_next_for);
4320 s = bc_POSIX_does_not_allow_empty_X_expression_in_for("init");
4323 if (p->l.t.t != BC_LEX_SCOLON) return bc_error_bad_token();
4324 s = bc_lex_next(&p->l);
4327 cond_idx = p->func->labels.len;
4328 update_idx = cond_idx + 1;
4329 body_idx = update_idx + 1;
4330 exit_idx = body_idx + 1;
4332 bc_vec_push(&p->func->labels, &p->func->code.len);
4334 if (p->l.t.t != BC_LEX_SCOLON)
4335 s = bc_parse_expr(p, BC_PARSE_REL, bc_parse_next_for);
4337 s = bc_POSIX_does_not_allow_empty_X_expression_in_for("condition");
4340 if (p->l.t.t != BC_LEX_SCOLON) return bc_error_bad_token();
4342 s = bc_lex_next(&p->l);
4345 bc_parse_push(p, BC_INST_JUMP_ZERO);
4346 bc_parse_pushIndex(p, exit_idx);
4347 bc_parse_push(p, BC_INST_JUMP);
4348 bc_parse_pushIndex(p, body_idx);
4350 ip.idx = p->func->labels.len;
4352 bc_vec_push(&p->conds, &update_idx);
4353 bc_vec_push(&p->func->labels, &p->func->code.len);
4355 if (p->l.t.t != BC_LEX_RPAREN)
4356 s = bc_parse_expr(p, 0, bc_parse_next_rel);
4358 s = bc_POSIX_does_not_allow_empty_X_expression_in_for("update");
4362 if (p->l.t.t != BC_LEX_RPAREN) return bc_error_bad_token();
4363 bc_parse_push(p, BC_INST_JUMP);
4364 bc_parse_pushIndex(p, cond_idx);
4365 bc_vec_push(&p->func->labels, &p->func->code.len);
4371 bc_vec_push(&p->exits, &ip);
4372 bc_vec_push(&p->func->labels, &ip.idx);
4374 bc_parse_startBody(p, BC_PARSE_FLAG_LOOP | BC_PARSE_FLAG_LOOP_INNER);
4376 return BC_STATUS_SUCCESS;
4379 static BcStatus bc_parse_loopExit(BcParse *p, BcLexType type)
4385 if (!BC_PARSE_LOOP(p)) return bc_error_bad_token();
4387 if (type == BC_LEX_KEY_BREAK) {
4389 if (p->exits.len == 0) return bc_error_bad_token();
4391 i = p->exits.len - 1;
4392 ip = bc_vec_item(&p->exits, i);
4394 while (!ip->func && i < p->exits.len) ip = bc_vec_item(&p->exits, i--);
4395 if (i >= p->exits.len && !ip->func) return bc_error_bad_token();
4400 i = *((size_t *) bc_vec_top(&p->conds));
4402 bc_parse_push(p, BC_INST_JUMP);
4403 bc_parse_pushIndex(p, i);
4405 s = bc_lex_next(&p->l);
4408 if (p->l.t.t != BC_LEX_SCOLON && p->l.t.t != BC_LEX_NLINE)
4409 return bc_error_bad_token();
4411 return bc_lex_next(&p->l);
4414 static BcStatus bc_parse_func(BcParse *p)
4417 bool var, comma = false;
4421 s = bc_lex_next(&p->l);
4423 if (p->l.t.t != BC_LEX_NAME)
4424 return bc_error("bad function definition");
4426 name = xstrdup(p->l.t.v.v);
4427 bc_parse_addFunc(p, name, &p->fidx);
4429 s = bc_lex_next(&p->l);
4431 if (p->l.t.t != BC_LEX_LPAREN)
4432 return bc_error("bad function definition");
4433 s = bc_lex_next(&p->l);
4436 while (p->l.t.t != BC_LEX_RPAREN) {
4438 if (p->l.t.t != BC_LEX_NAME)
4439 return bc_error("bad function definition");
4443 name = xstrdup(p->l.t.v.v);
4444 s = bc_lex_next(&p->l);
4447 var = p->l.t.t != BC_LEX_LBRACKET;
4451 s = bc_lex_next(&p->l);
4454 if (p->l.t.t != BC_LEX_RBRACKET) {
4455 s = bc_error("bad function definition");
4459 s = bc_lex_next(&p->l);
4463 comma = p->l.t.t == BC_LEX_COMMA;
4465 s = bc_lex_next(&p->l);
4469 s = bc_func_insert(p->func, name, var);
4473 if (comma) return bc_error("bad function definition");
4475 flags = BC_PARSE_FLAG_FUNC | BC_PARSE_FLAG_FUNC_INNER | BC_PARSE_FLAG_BODY;
4476 bc_parse_startBody(p, flags);
4478 s = bc_lex_next(&p->l);
4481 if (p->l.t.t != BC_LEX_LBRACE)
4482 s = bc_POSIX_requires("the left brace be on the same line as the function header");
4491 static BcStatus bc_parse_auto(BcParse *p)
4494 bool comma, var, one;
4497 if (!p->auto_part) return bc_error_bad_token();
4498 s = bc_lex_next(&p->l);
4501 p->auto_part = comma = false;
4502 one = p->l.t.t == BC_LEX_NAME;
4504 while (p->l.t.t == BC_LEX_NAME) {
4506 name = xstrdup(p->l.t.v.v);
4507 s = bc_lex_next(&p->l);
4510 var = p->l.t.t != BC_LEX_LBRACKET;
4513 s = bc_lex_next(&p->l);
4516 if (p->l.t.t != BC_LEX_RBRACKET) {
4517 s = bc_error("bad function definition");
4521 s = bc_lex_next(&p->l);
4525 comma = p->l.t.t == BC_LEX_COMMA;
4527 s = bc_lex_next(&p->l);
4531 s = bc_func_insert(p->func, name, var);
4535 if (comma) return bc_error("bad function definition");
4536 if (!one) return bc_error("no auto variable found");
4538 if (p->l.t.t != BC_LEX_NLINE && p->l.t.t != BC_LEX_SCOLON)
4539 return bc_error_bad_token();
4541 return bc_lex_next(&p->l);
4548 static BcStatus bc_parse_body(BcParse *p, bool brace)
4550 BcStatus s = BC_STATUS_SUCCESS;
4551 uint8_t *flag_ptr = bc_vec_top(&p->flags);
4553 *flag_ptr &= ~(BC_PARSE_FLAG_BODY);
4555 if (*flag_ptr & BC_PARSE_FLAG_FUNC_INNER) {
4557 if (!brace) return bc_error_bad_token();
4558 p->auto_part = p->l.t.t != BC_LEX_KEY_AUTO;
4560 if (!p->auto_part) {
4561 s = bc_parse_auto(p);
4565 if (p->l.t.t == BC_LEX_NLINE) s = bc_lex_next(&p->l);
4568 s = bc_parse_stmt(p);
4569 if (!s && !brace) s = bc_parse_endBody(p, false);
4575 static BcStatus bc_parse_stmt(BcParse *p)
4577 BcStatus s = BC_STATUS_SUCCESS;
4583 return bc_lex_next(&p->l);
4586 case BC_LEX_KEY_ELSE:
4588 p->auto_part = false;
4594 if (!BC_PARSE_BODY(p)) return bc_error_bad_token();
4597 s = bc_lex_next(&p->l);
4600 return bc_parse_body(p, true);
4603 case BC_LEX_KEY_AUTO:
4605 return bc_parse_auto(p);
4610 p->auto_part = false;
4612 if (BC_PARSE_IF_END(p)) {
4614 return BC_STATUS_SUCCESS;
4616 else if (BC_PARSE_BODY(p))
4617 return bc_parse_body(p, false);
4627 case BC_LEX_OP_MINUS:
4628 case BC_LEX_OP_BOOL_NOT:
4632 case BC_LEX_KEY_IBASE:
4633 case BC_LEX_KEY_LAST:
4634 case BC_LEX_KEY_LENGTH:
4635 case BC_LEX_KEY_OBASE:
4636 case BC_LEX_KEY_READ:
4637 case BC_LEX_KEY_SCALE:
4638 case BC_LEX_KEY_SQRT:
4640 s = bc_parse_expr(p, BC_PARSE_PRINT, bc_parse_next_expr);
4644 case BC_LEX_KEY_ELSE:
4646 s = bc_parse_else(p);
4652 while (!s && p->l.t.t == BC_LEX_SCOLON) s = bc_lex_next(&p->l);
4658 s = bc_parse_endBody(p, true);
4664 s = bc_parse_string(p, BC_INST_PRINT_STR);
4668 case BC_LEX_KEY_BREAK:
4669 case BC_LEX_KEY_CONTINUE:
4671 s = bc_parse_loopExit(p, p->l.t.t);
4675 case BC_LEX_KEY_FOR:
4677 s = bc_parse_for(p);
4681 case BC_LEX_KEY_HALT:
4683 bc_parse_push(p, BC_INST_HALT);
4684 s = bc_lex_next(&p->l);
4694 case BC_LEX_KEY_LIMITS:
4696 // "limits" is a compile-time command,
4697 // the output is produced at _parse time_.
4698 s = bc_lex_next(&p->l);
4700 printf("BC_BASE_MAX = %u\n", BC_MAX_OBASE);
4701 printf("BC_DIM_MAX = %u\n", BC_MAX_DIM);
4702 printf("BC_SCALE_MAX = %u\n", BC_MAX_SCALE);
4703 printf("BC_STRING_MAX = %u\n", BC_MAX_STRING);
4704 printf("BC_NAME_MAX = %u\n", BC_MAX_NAME);
4705 printf("BC_NUM_MAX = %u\n", BC_MAX_NUM);
4706 printf("MAX Exponent = %lu\n", BC_MAX_EXP);
4707 printf("Number of vars = %lu\n", BC_MAX_VARS);
4711 case BC_LEX_KEY_PRINT:
4713 s = bc_parse_print(p);
4717 case BC_LEX_KEY_QUIT:
4719 // "quit" is a compile-time command. For example,
4720 // "if (0 == 1) quit" terminates when parsing the statement,
4721 // not when it is executed
4722 QUIT_OR_RETURN_TO_MAIN;
4725 case BC_LEX_KEY_RETURN:
4727 s = bc_parse_return(p);
4731 case BC_LEX_KEY_WHILE:
4733 s = bc_parse_while(p);
4739 s = bc_error_bad_token();
4747 static BcStatus bc_parse_parse(BcParse *p)
4751 if (p->l.t.t == BC_LEX_EOF)
4752 s = p->flags.len > 0 ? bc_error("block end could not be found") : bc_error("end of file");
4753 else if (p->l.t.t == BC_LEX_KEY_DEFINE) {
4754 if (!BC_PARSE_CAN_EXEC(p)) return bc_error_bad_token();
4755 s = bc_parse_func(p);
4758 s = bc_parse_stmt(p);
4760 if (s || G_interrupt) {
4762 s = BC_STATUS_FAILURE;
4768 static BcStatus bc_parse_expr_empty_ok(BcParse *p, uint8_t flags, BcParseNext next)
4770 BcStatus s = BC_STATUS_SUCCESS;
4771 BcInst prev = BC_INST_PRINT;
4772 BcLexType top, t = p->l.t.t;
4773 size_t nexprs = 0, ops_bgn = p->ops.len;
4774 unsigned nparens, nrelops;
4775 bool paren_first, paren_expr, rprn, done, get_token, assign, bin_last;
4777 paren_first = p->l.t.t == BC_LEX_LPAREN;
4778 nparens = nrelops = 0;
4779 paren_expr = rprn = done = get_token = assign = false;
4782 for (; !G_interrupt && !s && !done && bc_parse_exprs(t); t = p->l.t.t) {
4788 s = bc_parse_incdec(p, &prev, &paren_expr, &nexprs, flags);
4789 rprn = get_token = bin_last = false;
4793 case BC_LEX_OP_MINUS:
4795 s = bc_parse_minus(p, &prev, ops_bgn, rprn, &nexprs);
4796 rprn = get_token = false;
4797 bin_last = prev == BC_INST_MINUS;
4801 case BC_LEX_OP_ASSIGN_POWER:
4802 case BC_LEX_OP_ASSIGN_MULTIPLY:
4803 case BC_LEX_OP_ASSIGN_DIVIDE:
4804 case BC_LEX_OP_ASSIGN_MODULUS:
4805 case BC_LEX_OP_ASSIGN_PLUS:
4806 case BC_LEX_OP_ASSIGN_MINUS:
4807 case BC_LEX_OP_ASSIGN:
4809 if (prev != BC_INST_VAR && prev != BC_INST_ARRAY_ELEM &&
4810 prev != BC_INST_SCALE && prev != BC_INST_IBASE &&
4811 prev != BC_INST_OBASE && prev != BC_INST_LAST)
4813 s = bc_error("bad assignment:"
4814 " left side must be scale,"
4815 " ibase, obase, last, var,"
4822 case BC_LEX_OP_POWER:
4823 case BC_LEX_OP_MULTIPLY:
4824 case BC_LEX_OP_DIVIDE:
4825 case BC_LEX_OP_MODULUS:
4826 case BC_LEX_OP_PLUS:
4827 case BC_LEX_OP_REL_EQ:
4828 case BC_LEX_OP_REL_LE:
4829 case BC_LEX_OP_REL_GE:
4830 case BC_LEX_OP_REL_NE:
4831 case BC_LEX_OP_REL_LT:
4832 case BC_LEX_OP_REL_GT:
4833 case BC_LEX_OP_BOOL_NOT:
4834 case BC_LEX_OP_BOOL_OR:
4835 case BC_LEX_OP_BOOL_AND:
4837 if (((t == BC_LEX_OP_BOOL_NOT) != bin_last)
4838 || (t != BC_LEX_OP_BOOL_NOT && prev == BC_INST_BOOL_NOT)
4840 return bc_error_bad_expression();
4843 nrelops += t >= BC_LEX_OP_REL_EQ && t <= BC_LEX_OP_REL_GT;
4844 prev = BC_PARSE_TOKEN_INST(t);
4845 s = bc_parse_operator(p, t, ops_bgn, &nexprs, true);
4846 rprn = get_token = false;
4847 bin_last = t != BC_LEX_OP_BOOL_NOT;
4854 if (BC_PARSE_LEAF(prev, rprn))
4855 return bc_error_bad_expression();
4857 paren_expr = rprn = bin_last = false;
4859 bc_vec_push(&p->ops, &t);
4866 if (bin_last || prev == BC_INST_BOOL_NOT)
4867 return bc_error_bad_expression();
4870 s = BC_STATUS_SUCCESS;
4875 else if (!paren_expr)
4876 return BC_STATUS_PARSE_EMPTY_EXP;
4879 paren_expr = rprn = true;
4880 get_token = bin_last = false;
4882 s = bc_parse_rightParen(p, ops_bgn, &nexprs);
4889 if (BC_PARSE_LEAF(prev, rprn))
4890 return bc_error_bad_expression();
4892 rprn = get_token = bin_last = false;
4893 s = bc_parse_name(p, &prev, flags & ~BC_PARSE_NOCALL);
4901 if (BC_PARSE_LEAF(prev, rprn))
4902 return bc_error_bad_expression();
4903 bc_parse_number(p, &prev, &nexprs);
4904 paren_expr = get_token = true;
4905 rprn = bin_last = false;
4910 case BC_LEX_KEY_IBASE:
4911 case BC_LEX_KEY_LAST:
4912 case BC_LEX_KEY_OBASE:
4914 if (BC_PARSE_LEAF(prev, rprn))
4915 return bc_error_bad_expression();
4916 prev = (char) (t - BC_LEX_KEY_IBASE + BC_INST_IBASE);
4917 bc_parse_push(p, (char) prev);
4919 paren_expr = get_token = true;
4920 rprn = bin_last = false;
4926 case BC_LEX_KEY_LENGTH:
4927 case BC_LEX_KEY_SQRT:
4929 if (BC_PARSE_LEAF(prev, rprn))
4930 return bc_error_bad_expression();
4931 s = bc_parse_builtin(p, t, flags, &prev);
4933 rprn = get_token = bin_last = false;
4939 case BC_LEX_KEY_READ:
4941 if (BC_PARSE_LEAF(prev, rprn))
4942 return bc_error_bad_expression();
4943 else if (flags & BC_PARSE_NOREAD)
4944 s = bc_error_nested_read_call();
4946 s = bc_parse_read(p);
4949 rprn = get_token = bin_last = false;
4951 prev = BC_INST_READ;
4956 case BC_LEX_KEY_SCALE:
4958 if (BC_PARSE_LEAF(prev, rprn))
4959 return bc_error_bad_expression();
4960 s = bc_parse_scale(p, &prev, flags);
4962 rprn = get_token = bin_last = false;
4964 prev = BC_INST_SCALE;
4971 s = bc_error_bad_token();
4976 if (!s && get_token) s = bc_lex_next(&p->l);
4980 if (G_interrupt) return BC_STATUS_FAILURE; // ^C: stop parsing
4982 while (p->ops.len > ops_bgn) {
4984 top = BC_PARSE_TOP_OP(p);
4985 assign = top >= BC_LEX_OP_ASSIGN_POWER && top <= BC_LEX_OP_ASSIGN;
4987 if (top == BC_LEX_LPAREN || top == BC_LEX_RPAREN)
4988 return bc_error_bad_expression();
4990 bc_parse_push(p, BC_PARSE_TOKEN_INST(top));
4992 nexprs -= top != BC_LEX_OP_BOOL_NOT && top != BC_LEX_NEG;
4993 bc_vec_pop(&p->ops);
4996 if (prev == BC_INST_BOOL_NOT || nexprs != 1)
4997 return bc_error_bad_expression();
4999 // next is BcParseNext, byte array of up to 4 BC_LEX's, packed into 32-bit word
5001 if (t == (next & 0x7f))
5003 if (next & 0x80) // last element?
5007 return bc_error_bad_expression();
5010 if (!(flags & BC_PARSE_REL) && nrelops) {
5011 s = bc_POSIX_does_not_allow("comparison operators outside if or loops");
5014 else if ((flags & BC_PARSE_REL) && nrelops > 1) {
5015 s = bc_POSIX_requires("exactly one comparison operator per condition");
5019 if (flags & BC_PARSE_PRINT) {
5020 if (paren_first || !assign) bc_parse_push(p, BC_INST_PRINT);
5021 bc_parse_push(p, BC_INST_POP);
5027 static BcStatus bc_parse_expr(BcParse *p, uint8_t flags, BcParseNext next)
5031 s = bc_parse_expr_empty_ok(p, flags, next);
5032 if (s == BC_STATUS_PARSE_EMPTY_EXP)
5033 return bc_error("empty expression");
5037 static void bc_parse_init(BcParse *p, size_t func)
5039 bc_parse_create(p, func, bc_parse_parse, bc_lex_token);
5042 static BcStatus bc_parse_expression(BcParse *p, uint8_t flags)
5044 return bc_parse_expr(p, flags, bc_parse_next_read);
5051 #define DC_PARSE_BUF_LEN ((int) (sizeof(uint32_t) * CHAR_BIT))
5053 static BcStatus dc_parse_register(BcParse *p)
5058 s = bc_lex_next(&p->l);
5060 if (p->l.t.t != BC_LEX_NAME) return bc_error_bad_token();
5062 name = xstrdup(p->l.t.v.v);
5063 bc_parse_pushName(p, name);
5068 static BcStatus dc_parse_string(BcParse *p)
5070 char *str, *name, b[DC_PARSE_BUF_LEN + 1];
5071 size_t idx, len = G.prog.strs.len;
5073 sprintf(b, "%0*zu", DC_PARSE_BUF_LEN, len);
5076 str = xstrdup(p->l.t.v.v);
5077 bc_parse_push(p, BC_INST_STR);
5078 bc_parse_pushIndex(p, len);
5079 bc_vec_push(&G.prog.strs, &str);
5080 bc_parse_addFunc(p, name, &idx);
5082 return bc_lex_next(&p->l);
5085 static BcStatus dc_parse_mem(BcParse *p, uint8_t inst, bool name, bool store)
5089 bc_parse_push(p, inst);
5091 s = dc_parse_register(p);
5096 bc_parse_push(p, BC_INST_SWAP);
5097 bc_parse_push(p, BC_INST_ASSIGN);
5098 bc_parse_push(p, BC_INST_POP);
5101 return bc_lex_next(&p->l);
5104 static BcStatus dc_parse_cond(BcParse *p, uint8_t inst)
5108 bc_parse_push(p, inst);
5109 bc_parse_push(p, BC_INST_EXEC_COND);
5111 s = dc_parse_register(p);
5114 s = bc_lex_next(&p->l);
5117 if (p->l.t.t == BC_LEX_ELSE) {
5118 s = dc_parse_register(p);
5120 s = bc_lex_next(&p->l);
5123 bc_parse_push(p, BC_PARSE_STREND);
5128 static BcStatus dc_parse_token(BcParse *p, BcLexType t, uint8_t flags)
5130 BcStatus s = BC_STATUS_SUCCESS;
5133 bool assign, get_token = false;
5137 case BC_LEX_OP_REL_EQ:
5138 case BC_LEX_OP_REL_LE:
5139 case BC_LEX_OP_REL_GE:
5140 case BC_LEX_OP_REL_NE:
5141 case BC_LEX_OP_REL_LT:
5142 case BC_LEX_OP_REL_GT:
5144 s = dc_parse_cond(p, t - BC_LEX_OP_REL_EQ + BC_INST_REL_EQ);
5151 s = dc_parse_mem(p, BC_INST_ARRAY_ELEM, true, t == BC_LEX_COLON);
5157 s = dc_parse_string(p);
5164 if (t == BC_LEX_NEG) {
5165 s = bc_lex_next(&p->l);
5167 if (p->l.t.t != BC_LEX_NUMBER)
5168 return bc_error_bad_token();
5171 bc_parse_number(p, &prev, &p->nbraces);
5173 if (t == BC_LEX_NEG) bc_parse_push(p, BC_INST_NEG);
5179 case BC_LEX_KEY_READ:
5181 if (flags & BC_PARSE_NOREAD)
5182 s = bc_error_nested_read_call();
5184 bc_parse_push(p, BC_INST_READ);
5189 case BC_LEX_OP_ASSIGN:
5190 case BC_LEX_STORE_PUSH:
5192 assign = t == BC_LEX_OP_ASSIGN;
5193 inst = assign ? BC_INST_VAR : BC_INST_PUSH_TO_VAR;
5194 s = dc_parse_mem(p, inst, true, assign);
5199 case BC_LEX_LOAD_POP:
5201 inst = t == BC_LEX_LOAD_POP ? BC_INST_PUSH_VAR : BC_INST_LOAD;
5202 s = dc_parse_mem(p, inst, true, false);
5206 case BC_LEX_STORE_IBASE:
5207 case BC_LEX_STORE_SCALE:
5208 case BC_LEX_STORE_OBASE:
5210 inst = t - BC_LEX_STORE_IBASE + BC_INST_IBASE;
5211 s = dc_parse_mem(p, inst, false, true);
5217 s = bc_error_bad_token();
5223 if (!s && get_token) s = bc_lex_next(&p->l);
5228 static BcStatus dc_parse_expr(BcParse *p, uint8_t flags)
5230 BcStatus s = BC_STATUS_SUCCESS;
5234 if (flags & BC_PARSE_NOCALL) p->nbraces = G.prog.results.len;
5236 for (t = p->l.t.t; !s && t != BC_LEX_EOF; t = p->l.t.t) {
5238 inst = dc_parse_insts[t];
5240 if (inst != BC_INST_INVALID) {
5241 bc_parse_push(p, inst);
5242 s = bc_lex_next(&p->l);
5245 s = dc_parse_token(p, t, flags);
5248 if (!s && p->l.t.t == BC_LEX_EOF && (flags & BC_PARSE_NOCALL))
5249 bc_parse_push(p, BC_INST_POP_EXEC);
5254 static BcStatus dc_parse_parse(BcParse *p)
5258 if (p->l.t.t == BC_LEX_EOF)
5259 s = bc_error("end of file");
5261 s = dc_parse_expr(p, 0);
5263 if (s || G_interrupt) {
5265 s = BC_STATUS_FAILURE;
5271 static void dc_parse_init(BcParse *p, size_t func)
5273 bc_parse_create(p, func, dc_parse_parse, dc_lex_token);
5278 static void common_parse_init(BcParse *p, size_t func)
5281 IF_BC(bc_parse_init(p, func);)
5283 IF_DC(dc_parse_init(p, func);)
5287 static BcStatus common_parse_expr(BcParse *p, uint8_t flags)
5290 IF_BC(return bc_parse_expression(p, flags);)
5292 IF_DC(return dc_parse_expr(p, flags);)
5296 static BcVec* bc_program_search(char *id, bool var)
5304 v = var ? &G.prog.vars : &G.prog.arrs;
5305 map = var ? &G.prog.var_map : &G.prog.arr_map;
5309 new = bc_map_insert(map, &e, &i); // 1 if insertion was successful
5312 bc_array_init(&data.v, var);
5313 bc_vec_push(v, &data.v);
5316 ptr = bc_vec_item(map, i);
5317 if (new) ptr->name = xstrdup(e.name);
5318 return bc_vec_item(v, ptr->idx);
5321 static BcStatus bc_program_num(BcResult *r, BcNum **num, bool hex)
5323 BcStatus s = BC_STATUS_SUCCESS;
5328 case BC_RESULT_TEMP:
5329 case BC_RESULT_IBASE:
5330 case BC_RESULT_SCALE:
5331 case BC_RESULT_OBASE:
5337 case BC_RESULT_CONSTANT:
5339 char **str = bc_vec_item(&G.prog.consts, r->d.id.idx);
5340 size_t base_t, len = strlen(*str);
5343 bc_num_init(&r->d.n, len);
5345 hex = hex && len == 1;
5346 base = hex ? &G.prog.hexb : &G.prog.ib;
5347 base_t = hex ? BC_NUM_MAX_IBASE : G.prog.ib_t;
5348 s = bc_num_parse(&r->d.n, *str, base, base_t);
5351 bc_num_free(&r->d.n);
5356 r->t = BC_RESULT_TEMP;
5362 case BC_RESULT_ARRAY:
5363 case BC_RESULT_ARRAY_ELEM:
5367 v = bc_program_search(r->d.id.name, r->t == BC_RESULT_VAR);
5369 if (r->t == BC_RESULT_ARRAY_ELEM) {
5371 if (v->len <= r->d.id.idx) bc_array_expand(v, r->d.id.idx + 1);
5372 *num = bc_vec_item(v, r->d.id.idx);
5375 *num = bc_vec_top(v);
5380 case BC_RESULT_LAST:
5382 *num = &G.prog.last;
5396 static BcStatus bc_program_binOpPrep(BcResult **l, BcNum **ln,
5397 BcResult **r, BcNum **rn, bool assign)
5401 BcResultType lt, rt;
5403 if (!BC_PROG_STACK(&G.prog.results, 2))
5404 return bc_error_stack_has_too_few_elements();
5406 *r = bc_vec_item_rev(&G.prog.results, 0);
5407 *l = bc_vec_item_rev(&G.prog.results, 1);
5411 hex = assign && (lt == BC_RESULT_IBASE || lt == BC_RESULT_OBASE);
5413 s = bc_program_num(*l, ln, false);
5415 s = bc_program_num(*r, rn, hex);
5418 // We run this again under these conditions in case any vector has been
5419 // reallocated out from under the BcNums or arrays we had.
5420 if (lt == rt && (lt == BC_RESULT_VAR || lt == BC_RESULT_ARRAY_ELEM)) {
5421 s = bc_program_num(*l, ln, false);
5425 if (!BC_PROG_NUM((*l), (*ln)) && (!assign || (*l)->t != BC_RESULT_VAR))
5426 return bc_error_variable_is_wrong_type();
5427 if (!assign && !BC_PROG_NUM((*r), (*ln)))
5428 return bc_error_variable_is_wrong_type();
5433 static void bc_program_binOpRetire(BcResult *r)
5435 r->t = BC_RESULT_TEMP;
5436 bc_vec_pop(&G.prog.results);
5437 bc_vec_pop(&G.prog.results);
5438 bc_vec_push(&G.prog.results, r);
5441 static BcStatus bc_program_prep(BcResult **r, BcNum **n)
5445 if (!BC_PROG_STACK(&G.prog.results, 1))
5446 return bc_error_stack_has_too_few_elements();
5447 *r = bc_vec_top(&G.prog.results);
5449 s = bc_program_num(*r, n, false);
5452 if (!BC_PROG_NUM((*r), (*n)))
5453 return bc_error_variable_is_wrong_type();
5458 static void bc_program_retire(BcResult *r, BcResultType t)
5461 bc_vec_pop(&G.prog.results);
5462 bc_vec_push(&G.prog.results, r);
5465 static BcStatus bc_program_op(char inst)
5468 BcResult *opd1, *opd2, res;
5469 BcNum *n1, *n2 = NULL;
5471 s = bc_program_binOpPrep(&opd1, &n1, &opd2, &n2, false);
5473 bc_num_init(&res.d.n, BC_NUM_DEF_SIZE);
5475 s = bc_program_ops[inst - BC_INST_POWER](n1, n2, &res.d.n, G.prog.scale);
5477 bc_program_binOpRetire(&res);
5482 bc_num_free(&res.d.n);
5486 static BcStatus bc_program_read(void)
5488 const char *sv_file;
5494 BcFunc *f = bc_vec_item(&G.prog.fns, BC_PROG_READ);
5496 for (i = 0; i < G.prog.stack.len; ++i) {
5497 BcInstPtr *ip_ptr = bc_vec_item(&G.prog.stack, i);
5498 if (ip_ptr->func == BC_PROG_READ)
5499 return bc_error_nested_read_call();
5502 bc_vec_pop_all(&f->code);
5503 bc_char_vec_init(&buf);
5505 sv_file = G.prog.file;
5508 s = bc_read_line(&buf, "read> ");
5511 common_parse_init(&parse, BC_PROG_READ);
5512 bc_lex_file(&parse.l);
5514 s = bc_parse_text(&parse, buf.v);
5515 if (s) goto exec_err;
5516 s = common_parse_expr(&parse, BC_PARSE_NOREAD);
5517 if (s) goto exec_err;
5519 if (parse.l.t.t != BC_LEX_NLINE && parse.l.t.t != BC_LEX_EOF) {
5520 s = bc_error("bad read() expression");
5524 ip.func = BC_PROG_READ;
5526 ip.len = G.prog.results.len;
5528 // Update this pointer, just in case.
5529 f = bc_vec_item(&G.prog.fns, BC_PROG_READ);
5531 bc_vec_pushByte(&f->code, BC_INST_POP_EXEC);
5532 bc_vec_push(&G.prog.stack, &ip);
5535 G.prog.file = sv_file;
5536 bc_parse_free(&parse);
5542 static size_t bc_program_index(char *code, size_t *bgn)
5544 char amt = code[(*bgn)++], i = 0;
5547 for (; i < amt; ++i, ++(*bgn))
5548 res |= (((size_t)((int) code[*bgn]) & UCHAR_MAX) << (i * CHAR_BIT));
5553 static char *bc_program_name(char *code, size_t *bgn)
5556 char c, *s, *str = code + *bgn, *ptr = strchr(str, BC_PARSE_STREND);
5558 s = xmalloc(ptr - str + 1);
5561 for (i = 0; c != 0 && c != BC_PARSE_STREND; c = code[(*bgn)++], ++i)
5569 static void bc_program_printString(const char *str, size_t *nchars)
5571 size_t i, len = strlen(str);
5580 for (i = 0; i < len; ++i, ++(*nchars)) {
5584 if (c != '\\' || i == len - 1)
5644 // Just print the backslash and following character.
5655 static BcStatus bc_program_print(char inst, size_t idx)
5657 BcStatus s = BC_STATUS_SUCCESS;
5662 bool pop = inst != BC_INST_PRINT;
5664 if (!BC_PROG_STACK(&G.prog.results, idx + 1))
5665 return bc_error_stack_has_too_few_elements();
5667 r = bc_vec_item_rev(&G.prog.results, idx);
5668 s = bc_program_num(r, &num, false);
5671 if (BC_PROG_NUM(r, num)) {
5672 s = bc_num_print(num, &G.prog.ob, G.prog.ob_t, !pop, &G.prog.nchars, G.prog.len);
5673 if (!s) bc_num_copy(&G.prog.last, num);
5677 idx = (r->t == BC_RESULT_STR) ? r->d.id.idx : num->rdx;
5678 str = *((char **) bc_vec_item(&G.prog.strs, idx));
5680 if (inst == BC_INST_PRINT_STR) {
5681 for (i = 0, len = strlen(str); i < len; ++i) {
5684 if (c == '\n') G.prog.nchars = SIZE_MAX;
5689 bc_program_printString(str, &G.prog.nchars);
5690 if (inst == BC_INST_PRINT) bb_putchar('\n');
5694 if (!s && pop) bc_vec_pop(&G.prog.results);
5699 static BcStatus bc_program_negate(void)
5705 s = bc_program_prep(&ptr, &num);
5708 bc_num_init(&res.d.n, num->len);
5709 bc_num_copy(&res.d.n, num);
5710 if (res.d.n.len) res.d.n.neg = !res.d.n.neg;
5712 bc_program_retire(&res, BC_RESULT_TEMP);
5717 static BcStatus bc_program_logical(char inst)
5720 BcResult *opd1, *opd2, res;
5725 s = bc_program_binOpPrep(&opd1, &n1, &opd2, &n2, false);
5727 bc_num_init(&res.d.n, BC_NUM_DEF_SIZE);
5729 if (inst == BC_INST_BOOL_AND)
5730 cond = bc_num_cmp(n1, &G.prog.zero) && bc_num_cmp(n2, &G.prog.zero);
5731 else if (inst == BC_INST_BOOL_OR)
5732 cond = bc_num_cmp(n1, &G.prog.zero) || bc_num_cmp(n2, &G.prog.zero);
5735 cmp = bc_num_cmp(n1, n2);
5739 case BC_INST_REL_EQ:
5745 case BC_INST_REL_LE:
5751 case BC_INST_REL_GE:
5757 case BC_INST_REL_NE:
5763 case BC_INST_REL_LT:
5769 case BC_INST_REL_GT:
5777 (cond ? bc_num_one : bc_num_zero)(&res.d.n);
5779 bc_program_binOpRetire(&res);
5785 static BcStatus bc_program_assignStr(BcResult *r, BcVec *v,
5791 memset(&n2, 0, sizeof(BcNum));
5792 n2.rdx = res.d.id.idx = r->d.id.idx;
5793 res.t = BC_RESULT_STR;
5796 if (!BC_PROG_STACK(&G.prog.results, 2))
5797 return bc_error_stack_has_too_few_elements();
5799 bc_vec_pop(&G.prog.results);
5802 bc_vec_pop(&G.prog.results);
5804 bc_vec_push(&G.prog.results, &res);
5805 bc_vec_push(v, &n2);
5807 return BC_STATUS_SUCCESS;
5811 static BcStatus bc_program_copyToVar(char *name, bool var)
5818 if (!BC_PROG_STACK(&G.prog.results, 1))
5819 return bc_error_stack_has_too_few_elements();
5821 ptr = bc_vec_top(&G.prog.results);
5822 if ((ptr->t == BC_RESULT_ARRAY) != !var)
5823 return bc_error_variable_is_wrong_type();
5824 v = bc_program_search(name, var);
5827 if (ptr->t == BC_RESULT_STR && !var)
5828 return bc_error_variable_is_wrong_type();
5829 if (ptr->t == BC_RESULT_STR) return bc_program_assignStr(ptr, v, true);
5832 s = bc_program_num(ptr, &n, false);
5835 // Do this once more to make sure that pointers were not invalidated.
5836 v = bc_program_search(name, var);
5839 bc_num_init(&r.d.n, BC_NUM_DEF_SIZE);
5840 bc_num_copy(&r.d.n, n);
5843 bc_array_init(&r.d.v, true);
5844 bc_array_copy(&r.d.v, (BcVec *) n);
5847 bc_vec_push(v, &r.d);
5848 bc_vec_pop(&G.prog.results);
5853 static BcStatus bc_program_assign(char inst)
5856 BcResult *left, *right, res;
5857 BcNum *l = NULL, *r = NULL;
5858 unsigned long val, max;
5859 bool assign = inst == BC_INST_ASSIGN, ib, sc;
5861 s = bc_program_binOpPrep(&left, &l, &right, &r, assign);
5864 ib = left->t == BC_RESULT_IBASE;
5865 sc = left->t == BC_RESULT_SCALE;
5869 if (right->t == BC_RESULT_STR) {
5873 if (left->t != BC_RESULT_VAR)
5874 return bc_error_variable_is_wrong_type();
5875 v = bc_program_search(left->d.id.name, true);
5877 return bc_program_assignStr(right, v, false);
5881 if (left->t == BC_RESULT_CONSTANT || left->t == BC_RESULT_TEMP)
5882 return bc_error("bad assignment:"
5883 " left side must be scale,"
5884 " ibase, obase, last, var,"
5889 if (inst == BC_INST_ASSIGN_DIVIDE && !bc_num_cmp(r, &G.prog.zero))
5890 return bc_error("divide by zero");
5895 s = bc_program_ops[inst - BC_INST_ASSIGN_POWER](l, r, l, G.prog.scale);
5902 if (ib || sc || left->t == BC_RESULT_OBASE) {
5903 static const char *const msg[] = {
5904 "bad ibase; must be [2, 16]", //BC_RESULT_IBASE
5905 "bad scale; must be [0, BC_SCALE_MAX]", //BC_RESULT_SCALE
5906 NULL, //can't happen //BC_RESULT_LAST
5907 NULL, //can't happen //BC_RESULT_CONSTANT
5908 NULL, //can't happen //BC_RESULT_ONE
5909 "bad obase; must be [2, BC_BASE_MAX]", //BC_RESULT_OBASE
5913 s = bc_num_ulong(l, &val);
5916 s = left->t - BC_RESULT_IBASE;
5919 ptr = &G.prog.scale;
5922 if (val < BC_NUM_MIN_BASE)
5923 return bc_error(msg[s]);
5924 max = ib ? BC_NUM_MAX_IBASE : BC_MAX_OBASE;
5925 ptr = ib ? &G.prog.ib_t : &G.prog.ob_t;
5929 return bc_error(msg[s]);
5931 bc_num_copy(ib ? &G.prog.ib : &G.prog.ob, l);
5933 *ptr = (size_t) val;
5934 s = BC_STATUS_SUCCESS;
5937 bc_num_init(&res.d.n, l->len);
5938 bc_num_copy(&res.d.n, l);
5939 bc_program_binOpRetire(&res);
5945 #define bc_program_pushVar(code, bgn, pop, copy) \
5946 bc_program_pushVar(code, bgn)
5947 // for bc, 'pop' and 'copy' are always false
5949 static BcStatus bc_program_pushVar(char *code, size_t *bgn,
5950 bool pop, bool copy)
5952 BcStatus s = BC_STATUS_SUCCESS;
5954 char *name = bc_program_name(code, bgn);
5956 r.t = BC_RESULT_VAR;
5961 BcVec *v = bc_program_search(name, true);
5962 BcNum *num = bc_vec_top(v);
5966 if (!BC_PROG_STACK(v, 2 - copy)) {
5968 return bc_error_stack_has_too_few_elements();
5974 if (!BC_PROG_STR(num)) {
5976 r.t = BC_RESULT_TEMP;
5978 bc_num_init(&r.d.n, BC_NUM_DEF_SIZE);
5979 bc_num_copy(&r.d.n, num);
5982 r.t = BC_RESULT_STR;
5983 r.d.id.idx = num->rdx;
5986 if (!copy) bc_vec_pop(v);
5991 bc_vec_push(&G.prog.results, &r);
5996 static BcStatus bc_program_pushArray(char *code, size_t *bgn,
5999 BcStatus s = BC_STATUS_SUCCESS;
6003 r.d.id.name = bc_program_name(code, bgn);
6005 if (inst == BC_INST_ARRAY) {
6006 r.t = BC_RESULT_ARRAY;
6007 bc_vec_push(&G.prog.results, &r);
6014 s = bc_program_prep(&operand, &num);
6016 s = bc_num_ulong(num, &temp);
6019 if (temp > BC_MAX_DIM) {
6020 s = bc_error("array too long; must be [1, BC_DIM_MAX]");
6024 r.d.id.idx = (size_t) temp;
6025 bc_program_retire(&r, BC_RESULT_ARRAY_ELEM);
6029 if (s) free(r.d.id.name);
6034 static BcStatus bc_program_incdec(char inst)
6037 BcResult *ptr, res, copy;
6041 s = bc_program_prep(&ptr, &num);
6044 if (inst == BC_INST_INC_POST || inst == BC_INST_DEC_POST) {
6045 copy.t = BC_RESULT_TEMP;
6046 bc_num_init(©.d.n, num->len);
6047 bc_num_copy(©.d.n, num);
6050 res.t = BC_RESULT_ONE;
6051 inst = inst == BC_INST_INC_PRE || inst == BC_INST_INC_POST ?
6052 BC_INST_ASSIGN_PLUS :
6053 BC_INST_ASSIGN_MINUS;
6055 bc_vec_push(&G.prog.results, &res);
6056 bc_program_assign(inst);
6058 if (inst2 == BC_INST_INC_POST || inst2 == BC_INST_DEC_POST) {
6059 bc_vec_pop(&G.prog.results);
6060 bc_vec_push(&G.prog.results, ©);
6066 static BcStatus bc_program_call(char *code, size_t *idx)
6068 BcStatus s = BC_STATUS_SUCCESS;
6070 size_t i, nparams = bc_program_index(code, idx);
6077 ip.func = bc_program_index(code, idx);
6078 func = bc_vec_item(&G.prog.fns, ip.func);
6080 if (func->code.len == 0) {
6081 return bc_error("undefined function");
6083 if (nparams != func->nparams) {
6084 return bc_error_fmt("function has %u parameters, but called with %u", func->nparams, nparams);
6086 ip.len = G.prog.results.len - nparams;
6088 for (i = 0; i < nparams; ++i) {
6090 a = bc_vec_item(&func->autos, nparams - 1 - i);
6091 arg = bc_vec_top(&G.prog.results);
6093 if ((!a->idx) != (arg->t == BC_RESULT_ARRAY) || arg->t == BC_RESULT_STR)
6094 return bc_error_variable_is_wrong_type();
6096 s = bc_program_copyToVar(a->name, a->idx);
6100 for (; i < func->autos.len; ++i) {
6103 a = bc_vec_item(&func->autos, i);
6104 v = bc_program_search(a->name, a->idx);
6107 bc_num_init(¶m.n, BC_NUM_DEF_SIZE);
6108 bc_vec_push(v, ¶m.n);
6111 bc_array_init(¶m.v, true);
6112 bc_vec_push(v, ¶m.v);
6116 bc_vec_push(&G.prog.stack, &ip);
6118 return BC_STATUS_SUCCESS;
6121 static BcStatus bc_program_return(char inst)
6127 BcInstPtr *ip = bc_vec_top(&G.prog.stack);
6129 if (!BC_PROG_STACK(&G.prog.results, ip->len + inst == BC_INST_RET))
6130 return bc_error_stack_has_too_few_elements();
6132 f = bc_vec_item(&G.prog.fns, ip->func);
6133 res.t = BC_RESULT_TEMP;
6135 if (inst == BC_INST_RET) {
6138 BcResult *operand = bc_vec_top(&G.prog.results);
6140 s = bc_program_num(operand, &num, false);
6142 bc_num_init(&res.d.n, num->len);
6143 bc_num_copy(&res.d.n, num);
6146 bc_num_init(&res.d.n, BC_NUM_DEF_SIZE);
6147 bc_num_zero(&res.d.n);
6150 // We need to pop arguments as well, so this takes that into account.
6151 for (i = 0; i < f->autos.len; ++i) {
6154 BcId *a = bc_vec_item(&f->autos, i);
6156 v = bc_program_search(a->name, a->idx);
6160 bc_vec_npop(&G.prog.results, G.prog.results.len - ip->len);
6161 bc_vec_push(&G.prog.results, &res);
6162 bc_vec_pop(&G.prog.stack);
6164 return BC_STATUS_SUCCESS;
6168 static unsigned long bc_program_scale(BcNum *n)
6170 return (unsigned long) n->rdx;
6173 static unsigned long bc_program_len(BcNum *n)
6175 unsigned long len = n->len;
6178 if (n->rdx != n->len) return len;
6179 for (i = n->len - 1; i < n->len && n->num[i] == 0; --len, --i);
6184 static BcStatus bc_program_builtin(char inst)
6190 bool len = inst == BC_INST_LENGTH;
6192 if (!BC_PROG_STACK(&G.prog.results, 1))
6193 return bc_error_stack_has_too_few_elements();
6194 opnd = bc_vec_top(&G.prog.results);
6196 s = bc_program_num(opnd, &num, false);
6200 if (!BC_PROG_NUM(opnd, num) && !len)
6201 return bc_error_variable_is_wrong_type();
6204 bc_num_init(&res.d.n, BC_NUM_DEF_SIZE);
6206 if (inst == BC_INST_SQRT) s = bc_num_sqrt(num, &res.d.n, G.prog.scale);
6208 else if (len != 0 && opnd->t == BC_RESULT_ARRAY) {
6209 bc_num_ulong2num(&res.d.n, (unsigned long) ((BcVec *) num)->len);
6213 else if (len != 0 && !BC_PROG_NUM(opnd, num)) {
6216 size_t idx = opnd->t == BC_RESULT_STR ? opnd->d.id.idx : num->rdx;
6218 str = bc_vec_item(&G.prog.strs, idx);
6219 bc_num_ulong2num(&res.d.n, strlen(*str));
6223 BcProgramBuiltIn f = len ? bc_program_len : bc_program_scale;
6224 bc_num_ulong2num(&res.d.n, f(num));
6227 bc_program_retire(&res, BC_RESULT_TEMP);
6233 static BcStatus bc_program_divmod(void)
6236 BcResult *opd1, *opd2, res, res2;
6237 BcNum *n1, *n2 = NULL;
6239 s = bc_program_binOpPrep(&opd1, &n1, &opd2, &n2, false);
6242 bc_num_init(&res.d.n, BC_NUM_DEF_SIZE);
6243 bc_num_init(&res2.d.n, n2->len);
6245 s = bc_num_divmod(n1, n2, &res2.d.n, &res.d.n, G.prog.scale);
6248 bc_program_binOpRetire(&res2);
6249 res.t = BC_RESULT_TEMP;
6250 bc_vec_push(&G.prog.results, &res);
6255 bc_num_free(&res2.d.n);
6256 bc_num_free(&res.d.n);
6260 static BcStatus bc_program_modexp(void)
6263 BcResult *r1, *r2, *r3, res;
6264 BcNum *n1, *n2, *n3;
6266 if (!BC_PROG_STACK(&G.prog.results, 3))
6267 return bc_error_stack_has_too_few_elements();
6268 s = bc_program_binOpPrep(&r2, &n2, &r3, &n3, false);
6271 r1 = bc_vec_item_rev(&G.prog.results, 2);
6272 s = bc_program_num(r1, &n1, false);
6274 if (!BC_PROG_NUM(r1, n1))
6275 return bc_error_variable_is_wrong_type();
6277 // Make sure that the values have their pointers updated, if necessary.
6278 if (r1->t == BC_RESULT_VAR || r1->t == BC_RESULT_ARRAY_ELEM) {
6280 if (r1->t == r2->t) {
6281 s = bc_program_num(r2, &n2, false);
6285 if (r1->t == r3->t) {
6286 s = bc_program_num(r3, &n3, false);
6291 bc_num_init(&res.d.n, n3->len);
6292 s = bc_num_modexp(n1, n2, n3, &res.d.n);
6295 bc_vec_pop(&G.prog.results);
6296 bc_program_binOpRetire(&res);
6301 bc_num_free(&res.d.n);
6305 static void bc_program_stackLen(void)
6308 size_t len = G.prog.results.len;
6310 res.t = BC_RESULT_TEMP;
6312 bc_num_init(&res.d.n, BC_NUM_DEF_SIZE);
6313 bc_num_ulong2num(&res.d.n, len);
6314 bc_vec_push(&G.prog.results, &res);
6317 static BcStatus bc_program_asciify(void)
6321 BcNum *num = NULL, n;
6322 char *str, *str2, c;
6323 size_t len = G.prog.strs.len, idx;
6326 if (!BC_PROG_STACK(&G.prog.results, 1))
6327 return bc_error_stack_has_too_few_elements();
6328 r = bc_vec_top(&G.prog.results);
6330 s = bc_program_num(r, &num, false);
6333 if (BC_PROG_NUM(r, num)) {
6335 bc_num_init(&n, BC_NUM_DEF_SIZE);
6336 bc_num_copy(&n, num);
6337 bc_num_truncate(&n, n.rdx);
6339 s = bc_num_mod(&n, &G.prog.strmb, &n, 0);
6340 if (s) goto num_err;
6341 s = bc_num_ulong(&n, &val);
6342 if (s) goto num_err;
6349 idx = (r->t == BC_RESULT_STR) ? r->d.id.idx : num->rdx;
6350 str2 = *((char **) bc_vec_item(&G.prog.strs, idx));
6358 str2 = xstrdup(str);
6359 bc_program_addFunc(str2, &idx);
6361 if (idx != len + BC_PROG_REQ_FUNCS) {
6363 for (idx = 0; idx < G.prog.strs.len; ++idx) {
6364 if (!strcmp(*((char **) bc_vec_item(&G.prog.strs, idx)), str)) {
6373 bc_vec_push(&G.prog.strs, &str);
6375 res.t = BC_RESULT_STR;
6377 bc_vec_pop(&G.prog.results);
6378 bc_vec_push(&G.prog.results, &res);
6380 return BC_STATUS_SUCCESS;
6387 static BcStatus bc_program_printStream(void)
6395 if (!BC_PROG_STACK(&G.prog.results, 1))
6396 return bc_error_stack_has_too_few_elements();
6397 r = bc_vec_top(&G.prog.results);
6399 s = bc_program_num(r, &n, false);
6402 if (BC_PROG_NUM(r, n))
6403 s = bc_num_stream(n, &G.prog.strmb, &G.prog.nchars, G.prog.len);
6405 idx = (r->t == BC_RESULT_STR) ? r->d.id.idx : n->rdx;
6406 str = *((char **) bc_vec_item(&G.prog.strs, idx));
6413 static BcStatus bc_program_nquit(void)
6420 s = bc_program_prep(&opnd, &num);
6422 s = bc_num_ulong(num, &val);
6425 bc_vec_pop(&G.prog.results);
6427 if (G.prog.stack.len < val)
6428 return bc_error_stack_has_too_few_elements();
6429 if (G.prog.stack.len == val) {
6430 QUIT_OR_RETURN_TO_MAIN;
6433 bc_vec_npop(&G.prog.stack, val);
6438 static BcStatus bc_program_execStr(char *code, size_t *bgn,
6441 BcStatus s = BC_STATUS_SUCCESS;
6451 if (!BC_PROG_STACK(&G.prog.results, 1))
6452 return bc_error_stack_has_too_few_elements();
6454 r = bc_vec_top(&G.prog.results);
6458 char *name, *then_name = bc_program_name(code, bgn), *else_name = NULL;
6460 if (code[*bgn] == BC_PARSE_STREND)
6463 else_name = bc_program_name(code, bgn);
6465 exec = r->d.n.len != 0;
6469 else if (else_name != NULL) {
6476 v = bc_program_search(name, true);
6483 if (!exec) goto exit;
6484 if (!BC_PROG_STR(n)) {
6485 s = bc_error_variable_is_wrong_type();
6493 if (r->t == BC_RESULT_STR)
6495 else if (r->t == BC_RESULT_VAR) {
6496 s = bc_program_num(r, &n, false);
6497 if (s || !BC_PROG_STR(n)) goto exit;
6504 fidx = sidx + BC_PROG_REQ_FUNCS;
6506 str = bc_vec_item(&G.prog.strs, sidx);
6507 f = bc_vec_item(&G.prog.fns, fidx);
6509 if (f->code.len == 0) {
6510 common_parse_init(&prs, fidx);
6511 s = bc_parse_text(&prs, *str);
6513 s = common_parse_expr(&prs, BC_PARSE_NOCALL);
6516 if (prs.l.t.t != BC_LEX_EOF) {
6517 s = bc_error_bad_expression();
6521 bc_parse_free(&prs);
6525 ip.len = G.prog.results.len;
6528 bc_vec_pop(&G.prog.results);
6529 bc_vec_push(&G.prog.stack, &ip);
6531 return BC_STATUS_SUCCESS;
6534 bc_parse_free(&prs);
6535 f = bc_vec_item(&G.prog.fns, fidx);
6536 bc_vec_pop_all(&f->code);
6538 bc_vec_pop(&G.prog.results);
6543 static void bc_program_pushGlobal(char inst)
6548 res.t = inst - BC_INST_IBASE + BC_RESULT_IBASE;
6549 if (inst == BC_INST_IBASE)
6550 val = (unsigned long) G.prog.ib_t;
6551 else if (inst == BC_INST_SCALE)
6552 val = (unsigned long) G.prog.scale;
6554 val = (unsigned long) G.prog.ob_t;
6556 bc_num_init(&res.d.n, BC_NUM_DEF_SIZE);
6557 bc_num_ulong2num(&res.d.n, val);
6558 bc_vec_push(&G.prog.results, &res);
6561 static void bc_program_addFunc(char *name, size_t *idx)
6563 BcId entry, *entry_ptr;
6568 entry.idx = G.prog.fns.len;
6570 inserted = bc_map_insert(&G.prog.fn_map, &entry, idx);
6571 if (!inserted) free(name);
6573 entry_ptr = bc_vec_item(&G.prog.fn_map, *idx);
6574 *idx = entry_ptr->idx;
6578 BcFunc *func = bc_vec_item(&G.prog.fns, entry_ptr->idx);
6580 // We need to reset these, so the function can be repopulated.
6582 bc_vec_pop_all(&func->autos);
6583 bc_vec_pop_all(&func->code);
6584 bc_vec_pop_all(&func->labels);
6588 bc_vec_push(&G.prog.fns, &f);
6592 static BcStatus bc_program_exec(void)
6594 BcStatus s = BC_STATUS_SUCCESS;
6598 BcInstPtr *ip = bc_vec_top(&G.prog.stack);
6599 BcFunc *func = bc_vec_item(&G.prog.fns, ip->func);
6600 char *code = func->code.v;
6603 while (!s && ip->idx < func->code.len) {
6605 char inst = code[(ip->idx)++];
6610 case BC_INST_JUMP_ZERO:
6612 s = bc_program_prep(&ptr, &num);
6614 cond = !bc_num_cmp(num, &G.prog.zero);
6615 bc_vec_pop(&G.prog.results);
6621 idx = bc_program_index(code, &ip->idx);
6622 addr = bc_vec_item(&func->labels, idx);
6623 if (inst == BC_INST_JUMP || cond) ip->idx = *addr;
6629 s = bc_program_call(code, &ip->idx);
6633 case BC_INST_INC_PRE:
6634 case BC_INST_DEC_PRE:
6635 case BC_INST_INC_POST:
6636 case BC_INST_DEC_POST:
6638 s = bc_program_incdec(inst);
6644 QUIT_OR_RETURN_TO_MAIN;
6651 s = bc_program_return(inst);
6655 case BC_INST_BOOL_OR:
6656 case BC_INST_BOOL_AND:
6658 case BC_INST_REL_EQ:
6659 case BC_INST_REL_LE:
6660 case BC_INST_REL_GE:
6661 case BC_INST_REL_NE:
6662 case BC_INST_REL_LT:
6663 case BC_INST_REL_GT:
6665 s = bc_program_logical(inst);
6671 s = bc_program_read();
6677 s = bc_program_pushVar(code, &ip->idx, false, false);
6681 case BC_INST_ARRAY_ELEM:
6684 s = bc_program_pushArray(code, &ip->idx, inst);
6690 r.t = BC_RESULT_LAST;
6691 bc_vec_push(&G.prog.results, &r);
6699 bc_program_pushGlobal(inst);
6703 case BC_INST_SCALE_FUNC:
6704 case BC_INST_LENGTH:
6707 s = bc_program_builtin(inst);
6713 r.t = BC_RESULT_CONSTANT;
6714 r.d.id.idx = bc_program_index(code, &ip->idx);
6715 bc_vec_push(&G.prog.results, &r);
6721 if (!BC_PROG_STACK(&G.prog.results, 1))
6722 s = bc_error_stack_has_too_few_elements();
6724 bc_vec_pop(&G.prog.results);
6728 case BC_INST_POP_EXEC:
6730 bc_vec_pop(&G.prog.stack);
6735 case BC_INST_PRINT_POP:
6736 case BC_INST_PRINT_STR:
6738 s = bc_program_print(inst, 0);
6744 r.t = BC_RESULT_STR;
6745 r.d.id.idx = bc_program_index(code, &ip->idx);
6746 bc_vec_push(&G.prog.results, &r);
6751 case BC_INST_MULTIPLY:
6752 case BC_INST_DIVIDE:
6753 case BC_INST_MODULUS:
6757 s = bc_program_op(inst);
6761 case BC_INST_BOOL_NOT:
6763 s = bc_program_prep(&ptr, &num);
6766 bc_num_init(&r.d.n, BC_NUM_DEF_SIZE);
6767 (!bc_num_cmp(num, &G.prog.zero) ? bc_num_one : bc_num_zero)(&r.d.n);
6768 bc_program_retire(&r, BC_RESULT_TEMP);
6775 s = bc_program_negate();
6780 case BC_INST_ASSIGN_POWER:
6781 case BC_INST_ASSIGN_MULTIPLY:
6782 case BC_INST_ASSIGN_DIVIDE:
6783 case BC_INST_ASSIGN_MODULUS:
6784 case BC_INST_ASSIGN_PLUS:
6785 case BC_INST_ASSIGN_MINUS:
6787 case BC_INST_ASSIGN:
6789 s = bc_program_assign(inst);
6793 case BC_INST_MODEXP:
6795 s = bc_program_modexp();
6799 case BC_INST_DIVMOD:
6801 s = bc_program_divmod();
6805 case BC_INST_EXECUTE:
6806 case BC_INST_EXEC_COND:
6808 cond = inst == BC_INST_EXEC_COND;
6809 s = bc_program_execStr(code, &ip->idx, cond);
6813 case BC_INST_PRINT_STACK:
6815 for (idx = 0; !s && idx < G.prog.results.len; ++idx)
6816 s = bc_program_print(BC_INST_PRINT, idx);
6820 case BC_INST_CLEAR_STACK:
6822 bc_vec_pop_all(&G.prog.results);
6826 case BC_INST_STACK_LEN:
6828 bc_program_stackLen();
6832 case BC_INST_DUPLICATE:
6834 if (!BC_PROG_STACK(&G.prog.results, 1))
6835 return bc_error_stack_has_too_few_elements();
6836 ptr = bc_vec_top(&G.prog.results);
6837 bc_result_copy(&r, ptr);
6838 bc_vec_push(&G.prog.results, &r);
6846 if (!BC_PROG_STACK(&G.prog.results, 2))
6847 return bc_error_stack_has_too_few_elements();
6849 ptr = bc_vec_item_rev(&G.prog.results, 0);
6850 ptr2 = bc_vec_item_rev(&G.prog.results, 1);
6851 memcpy(&r, ptr, sizeof(BcResult));
6852 memcpy(ptr, ptr2, sizeof(BcResult));
6853 memcpy(ptr2, &r, sizeof(BcResult));
6858 case BC_INST_ASCIIFY:
6860 s = bc_program_asciify();
6864 case BC_INST_PRINT_STREAM:
6866 s = bc_program_printStream();
6871 case BC_INST_PUSH_VAR:
6873 bool copy = inst == BC_INST_LOAD;
6874 s = bc_program_pushVar(code, &ip->idx, true, copy);
6878 case BC_INST_PUSH_TO_VAR:
6880 char *name = bc_program_name(code, &ip->idx);
6881 s = bc_program_copyToVar(name, true);
6888 if (G.prog.stack.len <= 2)
6889 QUIT_OR_RETURN_TO_MAIN;
6890 bc_vec_npop(&G.prog.stack, 2);
6896 s = bc_program_nquit();
6902 if (s || G_interrupt) {
6907 // If the stack has changed, pointers may be invalid.
6908 ip = bc_vec_top(&G.prog.stack);
6909 func = bc_vec_item(&G.prog.fns, ip->func);
6910 code = func->code.v;
6917 static void bc_vm_info(void)
6919 printf("%s "BB_VER"\n"
6920 "Copyright (c) 2018 Gavin D. Howard and contributors\n"
6921 "Report bugs at: https://github.com/gavinhoward/bc\n"
6922 "This is free software with ABSOLUTELY NO WARRANTY\n"
6926 static void bc_args(char **argv)
6932 #if ENABLE_FEATURE_BC_LONG_OPTIONS
6933 opts = option_mask32 |= getopt32long(argv, "wvsqli",
6934 "warn\0" No_argument "w"
6935 "version\0" No_argument "v"
6936 "standard\0" No_argument "s"
6937 "quiet\0" No_argument "q"
6938 "mathlib\0" No_argument "l"
6939 "interactive\0" No_argument "i"
6942 opts = option_mask32 |= getopt32(argv, "wvsqli");
6944 if (getenv("POSIXLY_CORRECT"))
6945 option_mask32 |= BC_FLAG_S;
6947 ///should be in bc_vm_run() instead??
6948 if (opts & BC_FLAG_V) {
6953 for (i = optind; argv[i]; ++i)
6954 bc_vec_push(&G.files, argv + i);
6957 static void bc_vm_envArgs(void)
6961 char *env_args = getenv("BC_ENV_ARGS");
6963 if (!env_args) return;
6965 G.env_args = xstrdup(env_args);
6968 bc_vec_init(&v, sizeof(char *), NULL);
6970 while (*(buf = skip_whitespace(buf)) != '\0') {
6971 bc_vec_push(&v, &buf);
6972 buf = skip_non_whitespace(buf);
6978 // NULL terminate, and pass argv[] so that first arg is argv[1]
6979 if (sizeof(int) == sizeof(char*)) {
6980 bc_vec_push(&v, &const_int_0);
6982 static char *const nullptr = NULL;
6983 bc_vec_push(&v, &nullptr);
6985 bc_args(((char **)v.v) - 1);
6991 static unsigned bc_vm_envLen(const char *var)
6997 len = BC_NUM_PRINT_WIDTH;
6998 if (!lenv) return len;
7000 len = bb_strtou(lenv, NULL, 10) - 1;
7001 if (errno || len < 2 || len >= INT_MAX)
7002 len = BC_NUM_PRINT_WIDTH;
7007 static BcStatus bc_vm_process(const char *text)
7009 BcStatus s = bc_parse_text(&G.prs, text);
7013 while (G.prs.l.t.t != BC_LEX_EOF) {
7014 s = G.prs.parse(&G.prs);
7018 if (BC_PARSE_CAN_EXEC(&G.prs)) {
7019 s = bc_program_exec();
7028 static BcStatus bc_vm_file(const char *file)
7030 const char *sv_file;
7036 data = bc_read_file(file);
7037 if (!data) return bc_error_fmt("file '%s' is not text", file);
7039 sv_file = G.prog.file;
7041 bc_lex_file(&G.prs.l);
7042 s = bc_vm_process(data);
7045 main_func = bc_vec_item(&G.prog.fns, BC_PROG_MAIN);
7046 ip = bc_vec_item(&G.prog.stack, 0);
7048 if (main_func->code.len < ip->idx)
7049 s = bc_error_fmt("file '%s' is not executable", file);
7052 G.prog.file = sv_file;
7057 static BcStatus bc_vm_stdin(void)
7061 size_t len, i, str = 0;
7062 bool comment = false;
7065 bc_lex_file(&G.prs.l);
7067 bc_char_vec_init(&buffer);
7068 bc_char_vec_init(&buf);
7069 bc_vec_pushZeroByte(&buffer);
7071 // This loop is complex because the vm tries not to send any lines that end
7072 // with a backslash to the parser. The reason for that is because the parser
7073 // treats a backslash+newline combo as whitespace, per the bc spec. In that
7074 // case, and for strings and comments, the parser will expect more stuff.
7075 s = BC_STATUS_SUCCESS;
7076 while (!G.eof && (s = bc_read_line(&buf, ">>> ")) == BC_STATUS_SUCCESS) {
7078 char *string = buf.v;
7083 if (str && buf.v[0] == G.send)
7085 else if (buf.v[0] == G.sbgn)
7088 else if (len > 1 || comment) {
7090 for (i = 0; i < len; ++i) {
7092 bool notend = len > i + 1;
7095 if (i - 1 > len || string[i - 1] != '\\') {
7096 if (G.sbgn == G.send)
7098 else if (c == G.send)
7100 else if (c == G.sbgn)
7104 if (c == '/' && notend && !comment && string[i + 1] == '*') {
7108 else if (c == '*' && notend && comment && string[i + 1] == '/')
7112 if (str || comment || string[len - 2] == '\\') {
7113 bc_vec_concat(&buffer, buf.v);
7118 bc_vec_concat(&buffer, buf.v);
7119 s = bc_vm_process(buffer.v);
7121 if (ENABLE_FEATURE_CLEAN_UP && !G_ttyin) {
7122 // Debug config, non-interactive mode:
7123 // return all the way back to main.
7124 // Non-debug builds do not come here, they exit.
7128 fputs("ready for more input\n", stderr);
7131 bc_vec_pop_all(&buffer);
7135 s = bc_error("string end could not be found");
7138 s = bc_error("comment end could not be found");
7142 bc_vec_free(&buffer);
7147 static const char bc_lib[] = {
7150 "\n" "auto b,s,n,r,d,i,p,f,v"
7159 "\n" "scale=scale(x)+1"
7169 "\n" "for(i=2;v!=0;++i){"
7175 "\n" "while((d--)!=0)r*=r"
7178 "\n" "if(n!=0)return(1/r)"
7182 "\n" "auto b,s,r,p,a,q,i,v"
7186 "\n" "r=(1-10^scale)/1"
7197 "\n" "while(x<=0.5){"
7201 "\n" "r=a=(x-1)/(x+1)"
7204 "\n" "for(i=3;v!=0;i+=2){"
7215 "\n" "auto b,s,r,n,a,q,i"
7219 "\n" "scale=1.1*s+2"
7228 "\n" "if(q%2!=0)x=-x"
7232 "\n" "for(i=3;a!=0;i+=2){"
7233 "\n" "a*=q/(i*(i-1))"
7238 "\n" "if(n!=0)return(-r/1)"
7247 "\n" "x=s(2*a(1)+x)"
7253 "\n" "auto b,s,r,n,a,m,t,f,i,u"
7262 "\n" "if(scale<65){"
7263 "\n" "return(.7853981633974483096156608458198757210492923498437764552437361480/n)"
7267 "\n" "if(scale<65){"
7268 "\n" "return(.1973955598498807583700497651947902934475851037878521015176889402/n)"
7279 "\n" "x=(x-.2)/(1+.2*x)"
7284 "\n" "for(i=3;t!=0;i+=2){"
7291 "\n" "return((m*a+r)/n)"
7293 "\n" "define j(n,x){"
7294 "\n" "auto b,s,o,a,i,v,f"
7302 "\n" "if(n%2==1)o=1"
7305 "\n" "for(i=2;i<=n;++i)a*=i"
7307 "\n" "a=(x^n)/2^n/a"
7310 "\n" "scale=scale+length(a)-scale(a)"
7311 "\n" "for(i=1;v!=0;++i){"
7312 "\n" "v=v*f/i/(n+i)"
7318 "\n" "return(a*r/1)"
7323 static BcStatus bc_vm_exec(void)
7329 if (option_mask32 & BC_FLAG_L) {
7331 // We know that internal library is not buggy,
7332 // thus error checking is normally disabled.
7333 # define DEBUG_LIB 0
7334 bc_lex_file(&G.prs.l);
7335 s = bc_parse_text(&G.prs, bc_lib);
7336 if (DEBUG_LIB && s) return s;
7338 while (G.prs.l.t.t != BC_LEX_EOF) {
7339 s = G.prs.parse(&G.prs);
7340 if (DEBUG_LIB && s) return s;
7342 s = bc_program_exec();
7343 if (DEBUG_LIB && s) return s;
7347 s = BC_STATUS_SUCCESS;
7348 for (i = 0; !s && i < G.files.len; ++i)
7349 s = bc_vm_file(*((char **) bc_vec_item(&G.files, i)));
7350 if (ENABLE_FEATURE_CLEAN_UP && s && !G_ttyin) {
7351 // Debug config, non-interactive mode:
7352 // return all the way back to main.
7353 // Non-debug builds do not come here, they exit.
7357 if (IS_BC || (option_mask32 & BC_FLAG_I)) {
7360 fputs("ready for more input\n", stderr);
7365 if (!s && !BC_PARSE_CAN_EXEC(&G.prs))
7366 s = bc_vm_process("");
7371 #if ENABLE_FEATURE_CLEAN_UP
7372 static void bc_program_free(void)
7374 bc_num_free(&G.prog.ib);
7375 bc_num_free(&G.prog.ob);
7376 bc_num_free(&G.prog.hexb);
7378 bc_num_free(&G.prog.strmb);
7380 bc_vec_free(&G.prog.fns);
7381 bc_vec_free(&G.prog.fn_map);
7382 bc_vec_free(&G.prog.vars);
7383 bc_vec_free(&G.prog.var_map);
7384 bc_vec_free(&G.prog.arrs);
7385 bc_vec_free(&G.prog.arr_map);
7386 bc_vec_free(&G.prog.strs);
7387 bc_vec_free(&G.prog.consts);
7388 bc_vec_free(&G.prog.results);
7389 bc_vec_free(&G.prog.stack);
7390 bc_num_free(&G.prog.last);
7391 bc_num_free(&G.prog.zero);
7392 bc_num_free(&G.prog.one);
7395 static void bc_vm_free(void)
7397 bc_vec_free(&G.files);
7399 bc_parse_free(&G.prs);
7404 static void bc_program_init(void)
7409 /* memset(&G.prog, 0, sizeof(G.prog)); - already is */
7410 memset(&ip, 0, sizeof(BcInstPtr));
7412 /* G.prog.nchars = G.prog.scale = 0; - already is */
7414 bc_num_init(&G.prog.ib, BC_NUM_DEF_SIZE);
7415 bc_num_ten(&G.prog.ib);
7418 bc_num_init(&G.prog.ob, BC_NUM_DEF_SIZE);
7419 bc_num_ten(&G.prog.ob);
7422 bc_num_init(&G.prog.hexb, BC_NUM_DEF_SIZE);
7423 bc_num_ten(&G.prog.hexb);
7424 G.prog.hexb.num[0] = 6;
7427 bc_num_init(&G.prog.strmb, BC_NUM_DEF_SIZE);
7428 bc_num_ulong2num(&G.prog.strmb, UCHAR_MAX + 1);
7431 bc_num_init(&G.prog.last, BC_NUM_DEF_SIZE);
7432 bc_num_zero(&G.prog.last);
7434 bc_num_init(&G.prog.zero, BC_NUM_DEF_SIZE);
7435 bc_num_zero(&G.prog.zero);
7437 bc_num_init(&G.prog.one, BC_NUM_DEF_SIZE);
7438 bc_num_one(&G.prog.one);
7440 bc_vec_init(&G.prog.fns, sizeof(BcFunc), bc_func_free);
7441 bc_vec_init(&G.prog.fn_map, sizeof(BcId), bc_id_free);
7443 bc_program_addFunc(xstrdup("(main)"), &idx);
7444 bc_program_addFunc(xstrdup("(read)"), &idx);
7446 bc_vec_init(&G.prog.vars, sizeof(BcVec), bc_vec_free);
7447 bc_vec_init(&G.prog.var_map, sizeof(BcId), bc_id_free);
7449 bc_vec_init(&G.prog.arrs, sizeof(BcVec), bc_vec_free);
7450 bc_vec_init(&G.prog.arr_map, sizeof(BcId), bc_id_free);
7452 bc_vec_init(&G.prog.strs, sizeof(char *), bc_string_free);
7453 bc_vec_init(&G.prog.consts, sizeof(char *), bc_string_free);
7454 bc_vec_init(&G.prog.results, sizeof(BcResult), bc_result_free);
7455 bc_vec_init(&G.prog.stack, sizeof(BcInstPtr), NULL);
7456 bc_vec_push(&G.prog.stack, &ip);
7459 static int bc_vm_init(const char *env_len)
7461 #if ENABLE_FEATURE_EDITING
7462 G.line_input_state = new_line_input_t(DO_HISTORY);
7464 G.prog.len = bc_vm_envLen(env_len);
7466 bc_vec_init(&G.files, sizeof(char *), NULL);
7468 IF_BC(bc_vm_envArgs();)
7471 IF_BC(bc_parse_init(&G.prs, BC_PROG_MAIN);)
7473 IF_DC(dc_parse_init(&G.prs, BC_PROG_MAIN);)
7477 #if ENABLE_FEATURE_BC_SIGNALS
7479 // With SA_RESTART, most system calls will restart
7480 // (IOW: they won't fail with EINTR).
7481 // In particular, this means ^C won't cause
7482 // stdout to get into "error state" if SIGINT hits
7483 // within write() syscall.
7484 // The downside is that ^C while line input is taken
7485 // will only be handled after [Enter] since read()
7486 // from stdin is not interrupted by ^C either,
7487 // it restarts, thus fgetc() does not return on ^C.
7488 signal_SA_RESTART_empty_mask(SIGINT, record_signo);
7490 // Without SA_RESTART, this exhibits a bug:
7491 // "while (1) print 1" and try ^C-ing it.
7492 // Intermittently, instead of returning to input line,
7493 // you'll get "output error: Interrupted system call"
7495 //signal_no_SA_RESTART_empty_mask(SIGINT, record_signo);
7499 return 0; // "not a tty"
7502 static BcStatus bc_vm_run(void)
7504 BcStatus st = bc_vm_exec();
7505 #if ENABLE_FEATURE_CLEAN_UP
7506 if (G_exiting) // it was actually "halt" or "quit"
7509 # if ENABLE_FEATURE_EDITING
7510 free_line_input_t(G.line_input_state);
7518 int bc_main(int argc, char **argv) MAIN_EXTERNALLY_VISIBLE;
7519 int bc_main(int argc UNUSED_PARAM, char **argv)
7524 G.sbgn = G.send = '"';
7526 is_tty = bc_vm_init("BC_LINE_LENGTH");
7530 if (is_tty && !(option_mask32 & BC_FLAG_Q))
7538 int dc_main(int argc, char **argv) MAIN_EXTERNALLY_VISIBLE;
7539 int dc_main(int argc UNUSED_PARAM, char **argv)
7546 // TODO: dc (GNU bc 1.07.1) 1.4.1 seems to use default width
7547 // 1 char narrower than bc from the same package. Do the same?
7548 bc_vm_init("DC_LINE_LENGTH");
7550 // Run -e'SCRIPT' and -fFILE in order of appearance, then handle FILEs
7551 noscript = BC_FLAG_I;
7553 int n = getopt(argc, argv, "e:f:x");
7559 n = bc_vm_process(optarg);
7567 option_mask32 |= DC_FLAG_X;
7577 bc_vec_push(&G.files, argv++);
7580 option_mask32 |= noscript; // set BC_FLAG_I if we need to interpret stdin
7586 #endif // not DC_SMALL