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.
7 //config: bool "bc (45 kb; 49 kb when combined with dc)"
10 //config: bc is a command-line, arbitrary-precision calculator with a
11 //config: Turing-complete language. See the GNU bc manual
12 //config: (https://www.gnu.org/software/bc/manual/bc.html) and bc spec
13 //config: (http://pubs.opengroup.org/onlinepubs/9699919799/utilities/bc.html)
14 //config: for details.
16 //config: This bc has four differences to the GNU bc:
18 //config: 1) The period (.) can also be used as a shortcut for "last", as in
20 //config: 2) Arrays are copied before being passed as arguments to
21 //config: functions. This behavior is required by the bc spec.
22 //config: 3) Arrays can be passed to the builtin "length" function to get
23 //config: the number of elements currently in the array. The following
24 //config: example prints "1":
29 //config: 4) The precedence of the boolean "not" operator (!) is equal to
30 //config: that of the unary minus (-), or negation, operator. This still
31 //config: allows POSIX-compliant scripts to work while somewhat
32 //config: preserving expected behavior (versus C) and making parsing
37 //config: -i --interactive force interactive mode
38 //config: -l --mathlib use predefined math routines:
40 //config: s(expr) = sine of expr in radians
41 //config: c(expr) = cosine of expr in radians
42 //config: a(expr) = arctangent of expr, returning
44 //config: l(expr) = natural log of expr
45 //config: e(expr) = raises e to the power of expr
46 //config: j(n, x) = Bessel function of integer order
49 //config: -q --quiet don't print version and copyright.
50 //config: -s --standard error if any non-POSIX extensions are used.
51 //config: -w --warn warn if any non-POSIX extensions are used.
52 //config: -v --version print version and copyright and exit.
54 //config: Long options are only available if FEATURE_BC_LONG_OPTIONS is
58 //config: bool "dc (38 kb; 49 kb when combined with bc)"
61 //config: dc is a reverse-polish notation command-line calculator which
62 //config: supports unlimited precision arithmetic. See the FreeBSD man page
63 //config: (https://www.unix.com/man-page/FreeBSD/1/dc/) and GNU dc manual
64 //config: (https://www.gnu.org/software/bc/manual/dc-1.05/html_mono/dc.html)
65 //config: for details.
67 //config: This dc has a few differences from the two above:
69 //config: 1) When printing a byte stream (command "P"), this bc follows what
70 //config: the FreeBSD dc does.
71 //config: 2) This dc implements the GNU extensions for divmod ("~") and
72 //config: modular exponentiation ("|").
73 //config: 3) This dc implements all FreeBSD extensions, except for "J" and
75 //config: 4) Like the FreeBSD dc, this dc supports extended registers.
76 //config: However, they are implemented differently. When it encounters
77 //config: whitespace where a register should be, it skips the whitespace.
78 //config: If the character following is not a lowercase letter, an error
79 //config: is issued. Otherwise, the register name is parsed by the
80 //config: following regex:
82 //config: [a-z][a-z0-9_]*
84 //config: This generally means that register names will be surrounded by
89 //config: l idx s temp L index S temp2 < do_thing
91 //config: Also note that, like the FreeBSD dc, extended registers are not
92 //config: allowed unless the "-x" option is given.
94 //config:config FEATURE_DC_SMALL
95 //config: bool "Minimal dc implementation (4.2 kb), not using bc code base"
96 //config: depends on DC && !BC
99 //config:config FEATURE_DC_LIBM
100 //config: bool "Enable power and exp functions (requires libm)"
102 //config: depends on FEATURE_DC_SMALL
104 //config: Enable power and exp functions.
105 //config: NOTE: This will require libm to be present for linking.
107 //config:config FEATURE_BC_SIGNALS
108 //config: bool "Enable bc/dc signal handling"
110 //config: depends on (BC || DC) && !FEATURE_DC_SMALL
112 //config: Enable signal handling for bc and dc.
114 //config:config FEATURE_BC_LONG_OPTIONS
115 //config: bool "Enable bc/dc long options"
117 //config: depends on (BC || DC) && !FEATURE_DC_SMALL
119 //config: Enable long options for bc and dc.
121 //applet:IF_BC(APPLET(bc, BB_DIR_USR_BIN, BB_SUID_DROP))
122 //applet:IF_DC(APPLET(dc, BB_DIR_USR_BIN, BB_SUID_DROP))
124 //kbuild:lib-$(CONFIG_BC) += bc.o
125 //kbuild:lib-$(CONFIG_DC) += bc.o
127 //See www.gnu.org/software/bc/manual/bc.html
128 //usage:#define bc_trivial_usage
129 //usage: "[-sqliw] FILE..."
131 //usage:#define bc_full_usage "\n"
132 //usage: "\nArbitrary precision calculator"
134 ///////: "\n -i Interactive" - has no effect for now
135 //usage: "\n -q Quiet"
136 //usage: "\n -l Load standard math library"
137 //usage: "\n -s Be POSIX compatible"
138 //usage: "\n -w Warn if extensions are used"
139 ///////: "\n -v Version"
141 //usage: "\n$BC_LINE_LENGTH changes output width"
143 //usage:#define bc_example_usage
144 //usage: "3 + 4.129\n"
145 //usage: "1903 - 2893\n"
146 //usage: "-129 * 213.28935\n"
147 //usage: "12 / -1932\n"
149 //usage: "34 ^ 189\n"
150 //usage: "scale = 13\n"
151 //usage: "ibase = 2\n"
152 //usage: "obase = A\n"
154 //usage:#define dc_trivial_usage
155 //usage: IF_NOT_FEATURE_DC_SMALL("[-x] ")"[-eSCRIPT]... [-fFILE]... [FILE]..."
157 //usage:#define dc_full_usage "\n"
158 //usage: "\nTiny RPN calculator. Operations:"
159 //usage: "\n+, -, *, /, %, ~, ^," IF_NOT_FEATURE_DC_SMALL(" |,")
160 //usage: "\np - print top of the stack (without popping)"
161 //usage: "\nf - print entire stack"
162 //usage: "\nk - pop the value and set the precision"
163 //usage: "\ni - pop the value and set input radix"
164 //usage: "\no - pop the value and set output radix"
165 //usage: "\nExamples: dc -e'2 2 + p' -> 4, dc -e'8 8 * 2 2 + / p' -> 16"
167 //usage:#define dc_example_usage
168 //usage: "$ dc -e'2 2 + p'\n"
170 //usage: "$ dc -e'8 8 \\* 2 2 + / p'\n"
172 //usage: "$ dc -e'0 1 & p'\n"
174 //usage: "$ dc -e'0 1 | p'\n"
176 //usage: "$ echo '72 9 / 8 * p' | dc\n"
180 #include "common_bufsiz.h"
182 #if ENABLE_FEATURE_DC_SMALL
186 typedef enum BcStatus {
187 BC_STATUS_SUCCESS = 0,
188 BC_STATUS_FAILURE = 1,
189 BC_STATUS_PARSE_EMPTY_EXP = 2, // bc_parse_expr() uses this
190 BC_STATUS_EOF = 3, // bc_vm_stdin() uses this
193 #define BC_VEC_INVALID_IDX ((size_t) -1)
194 #define BC_VEC_START_CAP (1 << 5)
196 typedef void (*BcVecFree)(void *);
198 typedef struct BcVec {
206 typedef signed char BcDig;
208 typedef struct BcNum {
216 #define BC_NUM_MIN_BASE ((unsigned long) 2)
217 #define BC_NUM_MAX_IBASE ((unsigned long) 16)
218 // larger value might speed up BIGNUM calculations a bit:
219 #define BC_NUM_DEF_SIZE (16)
220 #define BC_NUM_PRINT_WIDTH (69)
222 #define BC_NUM_KARATSUBA_LEN (32)
224 typedef void (*BcNumDigitOp)(size_t, size_t, bool, size_t *);
226 typedef BcStatus (*BcNumBinaryOp)(BcNum *, BcNum *, BcNum *, size_t);
228 static BcStatus bc_num_add(BcNum *a, BcNum *b, BcNum *c, size_t scale);
229 static BcStatus bc_num_sub(BcNum *a, BcNum *b, BcNum *c, size_t scale);
230 static BcStatus bc_num_mul(BcNum *a, BcNum *b, BcNum *c, size_t scale);
231 static BcStatus bc_num_div(BcNum *a, BcNum *b, BcNum *c, size_t scale);
232 static BcStatus bc_num_mod(BcNum *a, BcNum *b, BcNum *c, size_t scale);
233 static BcStatus bc_num_pow(BcNum *a, BcNum *b, BcNum *c, size_t scale);
234 static BcStatus bc_num_sqrt(BcNum *a, BcNum *b, size_t scale);
235 static BcStatus bc_num_divmod(BcNum *a, BcNum *b, BcNum *c, BcNum *d,
238 typedef enum BcInst {
268 BC_INST_ASSIGN_POWER,
269 BC_INST_ASSIGN_MULTIPLY,
270 BC_INST_ASSIGN_DIVIDE,
271 BC_INST_ASSIGN_MODULUS,
273 BC_INST_ASSIGN_MINUS,
319 BC_INST_PRINT_STREAM,
334 BC_INST_INVALID = -1,
339 typedef struct BcId {
344 typedef struct BcFunc {
351 typedef enum BcResultType {
356 BC_RESULT_ARRAY_ELEM,
365 // These are between to calculate ibase, obase, and last from instructions.
373 typedef union BcResultData {
379 typedef struct BcResult {
384 typedef struct BcInstPtr {
390 // BC_LEX_NEG is not used in lexing; it is only for parsing.
391 typedef enum BcLexType {
419 BC_LEX_OP_ASSIGN_POWER,
420 BC_LEX_OP_ASSIGN_MULTIPLY,
421 BC_LEX_OP_ASSIGN_DIVIDE,
422 BC_LEX_OP_ASSIGN_MODULUS,
423 BC_LEX_OP_ASSIGN_PLUS,
424 BC_LEX_OP_ASSIGN_MINUS,
445 BC_LEX_KEY_1st_keyword,
446 BC_LEX_KEY_AUTO = BC_LEX_KEY_1st_keyword,
453 // code uses "type - BC_LEX_KEY_IBASE + BC_INST_IBASE" construct,
454 BC_LEX_KEY_IBASE, // relative order should match for: BC_INST_IBASE
456 BC_LEX_KEY_LAST, // relative order should match for: BC_INST_LAST
459 BC_LEX_KEY_OBASE, // relative order should match for: BC_INST_OBASE
497 // must match order of BC_LEX_KEY_foo etc above
499 struct BcLexKeyword {
502 #define BC_LEX_KW_ENTRY(a, b) \
503 { .name8 = a /*, .posix = b */ }
504 static const struct BcLexKeyword bc_lex_kws[20] = {
505 BC_LEX_KW_ENTRY("auto" , 1), // 0
506 BC_LEX_KW_ENTRY("break" , 1), // 1
507 BC_LEX_KW_ENTRY("continue", 0), // 2 note: this one has no terminating NUL
508 BC_LEX_KW_ENTRY("define" , 1), // 3
510 BC_LEX_KW_ENTRY("else" , 0), // 4
511 BC_LEX_KW_ENTRY("for" , 1), // 5
512 BC_LEX_KW_ENTRY("halt" , 0), // 6
513 BC_LEX_KW_ENTRY("ibase" , 1), // 7
515 BC_LEX_KW_ENTRY("if" , 1), // 8
516 BC_LEX_KW_ENTRY("last" , 0), // 9
517 BC_LEX_KW_ENTRY("length" , 1), // 10
518 BC_LEX_KW_ENTRY("limits" , 0), // 11
520 BC_LEX_KW_ENTRY("obase" , 1), // 12
521 BC_LEX_KW_ENTRY("print" , 0), // 13
522 BC_LEX_KW_ENTRY("quit" , 1), // 14
523 BC_LEX_KW_ENTRY("read" , 0), // 15
525 BC_LEX_KW_ENTRY("return" , 1), // 16
526 BC_LEX_KW_ENTRY("scale" , 1), // 17
527 BC_LEX_KW_ENTRY("sqrt" , 1), // 18
528 BC_LEX_KW_ENTRY("while" , 1), // 19
530 #undef BC_LEX_KW_ENTRY
558 #define bc_lex_kws_POSIX(i) ((1 << (i)) & POSIX_KWORD_MASK)
562 typedef BcStatus (*BcLexNext)(struct BcLex *);
564 typedef struct BcLex {
582 #define BC_PARSE_STREND ((char) UCHAR_MAX)
584 #define BC_PARSE_REL (1 << 0)
585 #define BC_PARSE_PRINT (1 << 1)
586 #define BC_PARSE_NOCALL (1 << 2)
587 #define BC_PARSE_NOREAD (1 << 3)
588 #define BC_PARSE_ARRAY (1 << 4)
590 #define BC_PARSE_TOP_FLAG_PTR(parse) ((uint8_t *) bc_vec_top(&(parse)->flags))
591 #define BC_PARSE_TOP_FLAG(parse) (*(BC_PARSE_TOP_FLAG_PTR(parse)))
593 #define BC_PARSE_FLAG_FUNC_INNER (1 << 0)
594 #define BC_PARSE_FUNC_INNER(parse) \
595 (BC_PARSE_TOP_FLAG(parse) & BC_PARSE_FLAG_FUNC_INNER)
597 #define BC_PARSE_FLAG_FUNC (1 << 1)
598 #define BC_PARSE_FUNC(parse) (BC_PARSE_TOP_FLAG(parse) & BC_PARSE_FLAG_FUNC)
600 #define BC_PARSE_FLAG_BODY (1 << 2)
601 #define BC_PARSE_BODY(parse) (BC_PARSE_TOP_FLAG(parse) & BC_PARSE_FLAG_BODY)
603 #define BC_PARSE_FLAG_LOOP (1 << 3)
604 #define BC_PARSE_LOOP(parse) (BC_PARSE_TOP_FLAG(parse) & BC_PARSE_FLAG_LOOP)
606 #define BC_PARSE_FLAG_LOOP_INNER (1 << 4)
607 #define BC_PARSE_LOOP_INNER(parse) \
608 (BC_PARSE_TOP_FLAG(parse) & BC_PARSE_FLAG_LOOP_INNER)
610 #define BC_PARSE_FLAG_IF (1 << 5)
611 #define BC_PARSE_IF(parse) (BC_PARSE_TOP_FLAG(parse) & BC_PARSE_FLAG_IF)
613 #define BC_PARSE_FLAG_ELSE (1 << 6)
614 #define BC_PARSE_ELSE(parse) (BC_PARSE_TOP_FLAG(parse) & BC_PARSE_FLAG_ELSE)
616 #define BC_PARSE_FLAG_IF_END (1 << 7)
617 #define BC_PARSE_IF_END(parse) (BC_PARSE_TOP_FLAG(parse) & BC_PARSE_FLAG_IF_END)
619 #define BC_PARSE_CAN_EXEC(parse) \
620 (!(BC_PARSE_TOP_FLAG(parse) & \
621 (BC_PARSE_FLAG_FUNC_INNER | BC_PARSE_FLAG_FUNC | BC_PARSE_FLAG_BODY | \
622 BC_PARSE_FLAG_LOOP | BC_PARSE_FLAG_LOOP_INNER | BC_PARSE_FLAG_IF | \
623 BC_PARSE_FLAG_ELSE | BC_PARSE_FLAG_IF_END)))
629 typedef BcStatus (*BcParseParse)(struct BcParse *);
631 typedef struct BcParse {
652 typedef struct BcProgram {
693 #define BC_PROG_STACK(s, n) ((s)->len >= ((size_t) n))
695 #define BC_PROG_MAIN (0)
696 #define BC_PROG_READ (1)
698 #define BC_PROG_REQ_FUNCS (2)
701 #define BC_PROG_STR(n) (!(n)->num && !(n)->cap)
702 #define BC_PROG_NUM(r, n) \
703 ((r)->t != BC_RESULT_ARRAY && (r)->t != BC_RESULT_STR && !BC_PROG_STR(n))
705 typedef unsigned long (*BcProgramBuiltIn)(BcNum *);
707 #define BC_FLAG_W (1 << 0)
708 #define BC_FLAG_V (1 << 1)
709 #define BC_FLAG_S (1 << 2)
710 #define BC_FLAG_Q (1 << 3)
711 #define BC_FLAG_L (1 << 4)
712 #define BC_FLAG_I (1 << 5)
713 #define DC_FLAG_X (1 << 6)
715 #define BC_MAX(a, b) ((a) > (b) ? (a) : (b))
716 #define BC_MIN(a, b) ((a) < (b) ? (a) : (b))
718 #define BC_MAX_OBASE ((unsigned) 999)
719 #define BC_MAX_DIM ((unsigned) INT_MAX)
720 #define BC_MAX_SCALE ((unsigned) UINT_MAX)
721 #define BC_MAX_STRING ((unsigned) UINT_MAX - 1)
722 #define BC_MAX_NUM BC_MAX_STRING
723 // Unused apart from "limits" message. Just show a "biggish number" there.
724 //#define BC_MAX_NAME BC_MAX_STRING
725 //#define BC_MAX_EXP ((unsigned long) LONG_MAX)
726 //#define BC_MAX_VARS ((unsigned long) SIZE_MAX - 1)
727 #define BC_MAX_NAME_STR "999999999"
728 #define BC_MAX_EXP_STR "999999999"
729 #define BC_MAX_VARS_STR "999999999"
731 #define BC_MAX_OBASE_STR "999"
733 #if INT_MAX == 2147483647
734 # define BC_MAX_DIM_STR "2147483647"
735 #elif INT_MAX == 9223372036854775807
736 # define BC_MAX_DIM_STR "9223372036854775807"
738 # error Strange INT_MAX
741 #if UINT_MAX == 4294967295
742 # define BC_MAX_SCALE_STR "4294967295"
743 # define BC_MAX_STRING_STR "4294967294"
744 #elif UINT_MAX == 18446744073709551615
745 # define BC_MAX_SCALE_STR "18446744073709551615"
746 # define BC_MAX_STRING_STR "18446744073709551614"
748 # error Strange UINT_MAX
750 #define BC_MAX_NUM_STR BC_MAX_STRING_STR
753 IF_FEATURE_BC_SIGNALS(smallint ttyin;)
754 IF_FEATURE_CLEAN_UP(smallint exiting;)
761 // For error messages. Can be set to current parsed line,
762 // or [TODO] to current executing line (can be before last parsed one)
769 #if ENABLE_FEATURE_EDITING
770 line_input_t *line_input_state;
773 #define G (*ptr_to_globals)
774 #define INIT_G() do { \
775 SET_PTR_TO_GLOBALS(xzalloc(sizeof(G))); \
777 #define FREE_G() do { \
778 FREE_PTR_TO_GLOBALS(); \
780 #define G_posix (ENABLE_BC && (option_mask32 & BC_FLAG_S))
781 #define G_warn (ENABLE_BC && (option_mask32 & BC_FLAG_W))
782 #define G_exreg (ENABLE_DC && (option_mask32 & DC_FLAG_X))
783 #if ENABLE_FEATURE_BC_SIGNALS
784 # define G_interrupt bb_got_signal
785 # define G_ttyin G.ttyin
787 # define G_interrupt 0
790 #if ENABLE_FEATURE_CLEAN_UP
791 # define G_exiting G.exiting
795 #define IS_BC (ENABLE_BC && (!ENABLE_DC || applet_name[0] == 'b'))
799 // This is a bit array that corresponds to token types. An entry is
800 // true if the token is valid in an expression, false otherwise.
802 BC_PARSE_EXPRS_BITS = 0
803 + ((uint64_t)((0 << 0)+(0 << 1)+(1 << 2)+(1 << 3)+(1 << 4)+(1 << 5)+(1 << 6)+(1 << 7)) << (0*8))
804 + ((uint64_t)((1 << 0)+(1 << 1)+(1 << 2)+(1 << 3)+(1 << 4)+(1 << 5)+(1 << 6)+(1 << 7)) << (1*8))
805 + ((uint64_t)((1 << 0)+(1 << 1)+(1 << 2)+(1 << 3)+(1 << 4)+(1 << 5)+(1 << 6)+(1 << 7)) << (2*8))
806 + ((uint64_t)((1 << 0)+(1 << 1)+(1 << 2)+(0 << 3)+(0 << 4)+(1 << 5)+(1 << 6)+(0 << 7)) << (3*8))
807 + ((uint64_t)((0 << 0)+(0 << 1)+(0 << 2)+(0 << 3)+(0 << 4)+(0 << 5)+(1 << 6)+(1 << 7)) << (4*8))
808 + ((uint64_t)((0 << 0)+(0 << 1)+(0 << 2)+(0 << 3)+(0 << 4)+(0 << 5)+(0 << 6)+(1 << 7)) << (5*8))
809 + ((uint64_t)((0 << 0)+(1 << 1)+(1 << 2)+(1 << 3)+(1 << 4)+(0 << 5)+(0 << 6)+(1 << 7)) << (6*8))
810 + ((uint64_t)((0 << 0)+(1 << 1)+(1 << 2)+(0 << 3) ) << (7*8))
812 static ALWAYS_INLINE long bc_parse_exprs(unsigned i)
814 #if ULONG_MAX > 0xffffffff
815 // 64-bit version (will not work correctly for 32-bit longs!)
816 return BC_PARSE_EXPRS_BITS & (1UL << i);
819 unsigned long m = (uint32_t)BC_PARSE_EXPRS_BITS;
821 m = (uint32_t)(BC_PARSE_EXPRS_BITS >> 32);
824 return m & (1UL << i);
828 // This is an array of data for operators that correspond to token types.
829 static const uint8_t bc_parse_ops[] = {
830 #define OP(p,l) ((int)(l) * 0x10 + (p))
831 OP(0, false), OP( 0, false ), // inc dec
834 OP(3, true ), OP( 3, true ), OP( 3, true ), // pow mul div
835 OP(4, true ), OP( 4, true ), // mod + -
836 OP(6, true ), OP( 6, true ), OP( 6, true ), OP( 6, true ), OP( 6, true ), OP( 6, true ), // == <= >= != < >
838 OP(7, true ), OP( 7, true ), // or and
839 OP(5, false), OP( 5, false ), OP( 5, false ), OP( 5, false ), OP( 5, false ), // ^= *= /= %= +=
840 OP(5, false), OP( 5, false ), // -= =
843 #define bc_parse_op_PREC(i) (bc_parse_ops[i] & 0x0f)
844 #define bc_parse_op_LEFT(i) (bc_parse_ops[i] & 0x10)
846 // Byte array of up to 4 BC_LEX's, packed into 32-bit word
847 typedef uint32_t BcParseNext;
849 // These identify what tokens can come after expressions in certain cases.
851 #define BC_PARSE_NEXT4(a,b,c,d) ( (a) | ((b)<<8) | ((c)<<16) | ((((d)|0x80)<<24)) )
852 #define BC_PARSE_NEXT2(a,b) BC_PARSE_NEXT4(a,b,0xff,0xff)
853 #define BC_PARSE_NEXT1(a) BC_PARSE_NEXT4(a,0xff,0xff,0xff)
854 bc_parse_next_expr = BC_PARSE_NEXT4(BC_LEX_NLINE, BC_LEX_SCOLON, BC_LEX_RBRACE, BC_LEX_EOF),
855 bc_parse_next_param = BC_PARSE_NEXT2(BC_LEX_RPAREN, BC_LEX_COMMA),
856 bc_parse_next_print = BC_PARSE_NEXT4(BC_LEX_COMMA, BC_LEX_NLINE, BC_LEX_SCOLON, BC_LEX_EOF),
857 bc_parse_next_rel = BC_PARSE_NEXT1(BC_LEX_RPAREN),
858 bc_parse_next_elem = BC_PARSE_NEXT1(BC_LEX_RBRACKET),
859 bc_parse_next_for = BC_PARSE_NEXT1(BC_LEX_SCOLON),
860 bc_parse_next_read = BC_PARSE_NEXT2(BC_LEX_NLINE, BC_LEX_EOF),
861 #undef BC_PARSE_NEXT4
862 #undef BC_PARSE_NEXT2
863 #undef BC_PARSE_NEXT1
868 static const //BcLexType - should be this type, but narrower type saves size:
871 BC_LEX_OP_REL_EQ, BC_LEX_OP_REL_LE, BC_LEX_OP_REL_GE, BC_LEX_OP_REL_NE,
872 BC_LEX_OP_REL_LT, BC_LEX_OP_REL_GT, BC_LEX_SCOLON, BC_LEX_COLON,
873 BC_LEX_ELSE, BC_LEX_LOAD, BC_LEX_LOAD_POP, BC_LEX_OP_ASSIGN,
877 static const //BcLexType - should be this type
880 BC_LEX_OP_MODULUS, BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_LPAREN,
881 BC_LEX_INVALID, BC_LEX_OP_MULTIPLY, BC_LEX_OP_PLUS, BC_LEX_INVALID,
882 BC_LEX_OP_MINUS, BC_LEX_INVALID, BC_LEX_OP_DIVIDE,
883 BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID,
884 BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID,
885 BC_LEX_INVALID, BC_LEX_INVALID,
886 BC_LEX_COLON, BC_LEX_SCOLON, BC_LEX_OP_REL_GT, BC_LEX_OP_REL_EQ,
887 BC_LEX_OP_REL_LT, BC_LEX_KEY_READ, BC_LEX_INVALID,
888 BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID,
889 BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_EQ_NO_REG, BC_LEX_INVALID,
890 BC_LEX_KEY_IBASE, BC_LEX_INVALID, BC_LEX_KEY_SCALE, BC_LEX_LOAD_POP,
891 BC_LEX_INVALID, BC_LEX_OP_BOOL_NOT, BC_LEX_KEY_OBASE, BC_LEX_PRINT_STREAM,
892 BC_LEX_NQUIT, BC_LEX_POP, BC_LEX_STORE_PUSH, BC_LEX_INVALID, BC_LEX_INVALID,
893 BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_SCALE_FACTOR, BC_LEX_INVALID,
894 BC_LEX_KEY_LENGTH, BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID,
895 BC_LEX_OP_POWER, BC_LEX_NEG, BC_LEX_INVALID,
896 BC_LEX_ASCIIFY, BC_LEX_INVALID, BC_LEX_CLEAR_STACK, BC_LEX_DUPLICATE,
897 BC_LEX_ELSE, BC_LEX_PRINT_STACK, BC_LEX_INVALID, BC_LEX_INVALID,
898 BC_LEX_STORE_IBASE, BC_LEX_INVALID, BC_LEX_STORE_SCALE, BC_LEX_LOAD,
899 BC_LEX_INVALID, BC_LEX_PRINT_POP, BC_LEX_STORE_OBASE, BC_LEX_KEY_PRINT,
900 BC_LEX_KEY_QUIT, BC_LEX_SWAP, BC_LEX_OP_ASSIGN, BC_LEX_INVALID,
901 BC_LEX_INVALID, BC_LEX_KEY_SQRT, BC_LEX_INVALID, BC_LEX_EXECUTE,
902 BC_LEX_INVALID, BC_LEX_STACK_LEVEL,
903 BC_LEX_LBRACE, BC_LEX_OP_MODEXP, BC_LEX_INVALID, BC_LEX_OP_DIVMOD,
907 static const //BcInst - should be this type. Using signed narrow type since BC_INST_INVALID is -1
910 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID, BC_INST_REL_GE,
911 BC_INST_INVALID, BC_INST_POWER, BC_INST_MULTIPLY, BC_INST_DIVIDE,
912 BC_INST_MODULUS, BC_INST_PLUS, BC_INST_MINUS,
913 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID,
914 BC_INST_INVALID, BC_INST_INVALID,
915 BC_INST_BOOL_NOT, BC_INST_INVALID, BC_INST_INVALID,
916 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID,
917 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID,
918 BC_INST_INVALID, BC_INST_INVALID, BC_INST_REL_GT, BC_INST_INVALID,
919 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID, BC_INST_REL_GE,
920 BC_INST_INVALID, BC_INST_INVALID,
921 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID,
922 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID,
923 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID, BC_INST_IBASE,
924 BC_INST_INVALID, BC_INST_INVALID, BC_INST_LENGTH, BC_INST_INVALID,
925 BC_INST_OBASE, BC_INST_PRINT, BC_INST_QUIT, BC_INST_INVALID,
926 BC_INST_INVALID, BC_INST_SCALE, BC_INST_SQRT, BC_INST_INVALID,
927 BC_INST_REL_EQ, BC_INST_MODEXP, BC_INST_DIVMOD, BC_INST_INVALID,
928 BC_INST_INVALID, BC_INST_EXECUTE, BC_INST_PRINT_STACK, BC_INST_CLEAR_STACK,
929 BC_INST_STACK_LEN, BC_INST_DUPLICATE, BC_INST_SWAP, BC_INST_POP,
930 BC_INST_ASCIIFY, BC_INST_PRINT_STREAM, BC_INST_INVALID, BC_INST_INVALID,
931 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID,
932 BC_INST_PRINT, BC_INST_NQUIT, BC_INST_SCALE_FUNC,
936 static const BcNumBinaryOp bc_program_ops[] = {
937 bc_num_pow, bc_num_mul, bc_num_div, bc_num_mod, bc_num_add, bc_num_sub,
940 static void fflush_and_check(void)
943 if (ferror(stdout) || ferror(stderr))
944 bb_perror_msg_and_die("output error");
947 #if ENABLE_FEATURE_CLEAN_UP
948 #define QUIT_OR_RETURN_TO_MAIN \
950 IF_FEATURE_BC_SIGNALS(G_ttyin = 0;) /* do not loop in main loop anymore */ \
952 return BC_STATUS_FAILURE; \
955 #define QUIT_OR_RETURN_TO_MAIN quit()
958 static void quit(void) NORETURN;
959 static void quit(void)
962 bb_perror_msg_and_die("input error");
967 static void bc_verror_msg(const char *fmt, va_list p)
969 const char *sv = sv; /* for compiler */
972 applet_name = xasprintf("%s: %s:%u", applet_name, G.prog.file, G.err_line);
974 bb_verror_msg(fmt, p, NULL);
976 free((char*)applet_name);
981 static NOINLINE int bc_error_fmt(const char *fmt, ...)
986 bc_verror_msg(fmt, p);
989 if (!ENABLE_FEATURE_CLEAN_UP && !G_ttyin)
991 return BC_STATUS_FAILURE;
995 static NOINLINE int bc_posix_error_fmt(const char *fmt, ...)
999 // Are non-POSIX constructs totally ok?
1000 if (!(option_mask32 & (BC_FLAG_S|BC_FLAG_W)))
1001 return BC_STATUS_SUCCESS; // yes
1004 bc_verror_msg(fmt, p);
1007 // Do we treat non-POSIX constructs as errors?
1008 if (!(option_mask32 & BC_FLAG_S))
1009 return BC_STATUS_SUCCESS; // no, it's a warning
1010 if (!ENABLE_FEATURE_CLEAN_UP && !G_ttyin)
1012 return BC_STATUS_FAILURE;
1016 // We use error functions with "return bc_error(FMT[, PARAMS])" idiom.
1017 // This idiom begs for tail-call optimization, but for it to work,
1018 // function must not have caller-cleaned parameters on stack.
1019 // Unfortunately, vararg function API does exactly that on most arches.
1020 // Thus, use these shims for the cases when we have no vararg PARAMS:
1021 static int bc_error(const char *msg)
1023 return bc_error_fmt("%s", msg);
1026 static int bc_POSIX_requires(const char *msg)
1028 return bc_posix_error_fmt("POSIX requires %s", msg);
1030 static int bc_POSIX_does_not_allow(const char *msg)
1032 return bc_posix_error_fmt("%s%s", "POSIX does not allow ", msg);
1034 static int bc_POSIX_does_not_allow_bool_ops_this_is_bad(const char *msg)
1036 return bc_posix_error_fmt("%s%s %s", "POSIX does not allow ", "boolean operators; the following is bad:", msg);
1038 static int bc_POSIX_does_not_allow_empty_X_expression_in_for(const char *msg)
1040 return bc_posix_error_fmt("%san empty %s expression in a for loop", "POSIX does not allow ", msg);
1043 static int bc_error_bad_character(char c)
1045 return bc_error_fmt("bad character '%c'", c);
1047 static int bc_error_bad_expression(void)
1049 return bc_error("bad expression");
1051 static int bc_error_bad_token(void)
1053 return bc_error("bad token");
1055 static int bc_error_stack_has_too_few_elements(void)
1057 return bc_error("stack has too few elements");
1059 static int bc_error_variable_is_wrong_type(void)
1061 return bc_error("variable is wrong type");
1063 static int bc_error_nested_read_call(void)
1065 return bc_error("read() call inside of a read() call");
1068 static void bc_vec_grow(BcVec *v, size_t n)
1070 size_t cap = v->cap * 2;
1071 while (cap < v->len + n) cap *= 2;
1072 v->v = xrealloc(v->v, v->size * cap);
1076 static void bc_vec_init(BcVec *v, size_t esize, BcVecFree dtor)
1079 v->cap = BC_VEC_START_CAP;
1082 v->v = xmalloc(esize * BC_VEC_START_CAP);
1085 static void bc_char_vec_init(BcVec *v)
1087 bc_vec_init(v, sizeof(char), NULL);
1090 static void bc_vec_expand(BcVec *v, size_t req)
1093 v->v = xrealloc(v->v, v->size * req);
1098 static void bc_vec_pop(BcVec *v)
1102 v->dtor(v->v + (v->size * v->len));
1105 static void bc_vec_npop(BcVec *v, size_t n)
1110 size_t len = v->len - n;
1111 while (v->len > len) v->dtor(v->v + (v->size * --v->len));
1115 static void bc_vec_pop_all(BcVec *v)
1117 bc_vec_npop(v, v->len);
1120 static void bc_vec_push(BcVec *v, const void *data)
1122 if (v->len + 1 > v->cap) bc_vec_grow(v, 1);
1123 memmove(v->v + (v->size * v->len), data, v->size);
1127 static void bc_vec_pushByte(BcVec *v, char data)
1129 bc_vec_push(v, &data);
1132 static void bc_vec_pushZeroByte(BcVec *v)
1134 //bc_vec_pushByte(v, '\0');
1136 bc_vec_push(v, &const_int_0);
1139 static void bc_vec_pushAt(BcVec *v, const void *data, size_t idx)
1142 bc_vec_push(v, data);
1147 if (v->len == v->cap) bc_vec_grow(v, 1);
1149 ptr = v->v + v->size * idx;
1151 memmove(ptr + v->size, ptr, v->size * (v->len++ - idx));
1152 memmove(ptr, data, v->size);
1156 static void bc_vec_string(BcVec *v, size_t len, const char *str)
1159 bc_vec_expand(v, len + 1);
1160 memcpy(v->v, str, len);
1163 bc_vec_pushZeroByte(v);
1166 static void bc_vec_concat(BcVec *v, const char *str)
1170 if (v->len == 0) bc_vec_pushZeroByte(v);
1172 len = v->len + strlen(str);
1174 if (v->cap < len) bc_vec_grow(v, len - v->len);
1175 strcpy(v->v + v->len - 1, str);
1180 static void *bc_vec_item(const BcVec *v, size_t idx)
1182 return v->v + v->size * idx;
1185 static void *bc_vec_item_rev(const BcVec *v, size_t idx)
1187 return v->v + v->size * (v->len - idx - 1);
1190 static void *bc_vec_top(const BcVec *v)
1192 return v->v + v->size * (v->len - 1);
1195 static void bc_vec_free(void *vec)
1197 BcVec *v = (BcVec *) vec;
1202 static int bc_id_cmp(const void *e1, const void *e2)
1204 return strcmp(((const BcId *) e1)->name, ((const BcId *) e2)->name);
1207 static void bc_id_free(void *id)
1209 free(((BcId *) id)->name);
1212 static size_t bc_map_find(const BcVec *v, const void *ptr)
1214 size_t low = 0, high = v->len;
1216 while (low < high) {
1218 size_t mid = (low + high) / 2;
1219 BcId *id = bc_vec_item(v, mid);
1220 int result = bc_id_cmp(ptr, id);
1224 else if (result < 0)
1233 static int bc_map_insert(BcVec *v, const void *ptr, size_t *i)
1235 size_t n = *i = bc_map_find(v, ptr);
1238 bc_vec_push(v, ptr);
1239 else if (!bc_id_cmp(ptr, bc_vec_item(v, n)))
1240 return 0; // "was not inserted"
1242 bc_vec_pushAt(v, ptr, n);
1243 return 1; // "was inserted"
1247 static size_t bc_map_index(const BcVec *v, const void *ptr)
1249 size_t i = bc_map_find(v, ptr);
1250 if (i >= v->len) return BC_VEC_INVALID_IDX;
1251 return bc_id_cmp(ptr, bc_vec_item(v, i)) ? BC_VEC_INVALID_IDX : i;
1255 static int push_input_byte(BcVec *vec, char c)
1257 if ((c < ' ' && c != '\t' && c != '\r' && c != '\n') // also allow '\v' '\f'?
1260 // Bad chars on this line, ignore entire line
1261 bc_error_fmt("illegal character 0x%02x", c);
1264 bc_vec_pushByte(vec, (char)c);
1268 static BcStatus bc_read_line(BcVec *vec)
1273 s = BC_STATUS_SUCCESS;
1278 bc_vec_pop_all(vec);
1282 #if ENABLE_FEATURE_BC_SIGNALS
1283 if (G_interrupt) { // ^C was pressed
1286 // GNU bc says "interrupted execution."
1287 // GNU dc says "Interrupt!"
1288 fputs("\ninterrupted execution\n", stderr);
1290 # if ENABLE_FEATURE_EDITING
1293 # define line_buf bb_common_bufsiz1
1294 n = read_line_input(G.line_input_state, "", line_buf, COMMON_BUFSIZE);
1295 if (n <= 0) { // read errors or EOF, or ^D, or ^C
1305 bad_chars |= push_input_byte(vec, c);
1312 IF_FEATURE_BC_SIGNALS(errno = 0;)
1315 #if ENABLE_FEATURE_BC_SIGNALS && !ENABLE_FEATURE_EDITING
1316 // Both conditions appear simultaneously, check both just in case
1317 if (errno == EINTR || G_interrupt) {
1325 quit(); // this emits error message
1327 // Note: EOF does not append '\n', therefore:
1328 // printf 'print 123\n' | bc - works
1329 // printf 'print 123' | bc - fails (syntax error)
1332 bad_chars |= push_input_byte(vec, c);
1333 } while (c != '\n');
1335 } while (bad_chars);
1337 bc_vec_pushZeroByte(vec);
1342 static char* bc_read_file(const char *path)
1345 size_t size = ((size_t) -1);
1348 // Never returns NULL (dies on errors)
1349 buf = xmalloc_xopen_read_close(path, &size);
1351 for (i = 0; i < size; ++i) {
1353 if ((c < ' ' && c != '\t' && c != '\r' && c != '\n') // also allow '\v' '\f'?
1365 static void bc_num_setToZero(BcNum *n, size_t scale)
1372 static void bc_num_zero(BcNum *n)
1374 bc_num_setToZero(n, 0);
1377 static void bc_num_one(BcNum *n)
1379 bc_num_setToZero(n, 0);
1384 static void bc_num_ten(BcNum *n)
1386 bc_num_setToZero(n, 0);
1392 static void bc_num_init(BcNum *n, size_t req)
1394 req = req >= BC_NUM_DEF_SIZE ? req : BC_NUM_DEF_SIZE;
1395 memset(n, 0, sizeof(BcNum));
1396 n->num = xmalloc(req);
1400 static void bc_num_expand(BcNum *n, size_t req)
1402 req = req >= BC_NUM_DEF_SIZE ? req : BC_NUM_DEF_SIZE;
1404 n->num = xrealloc(n->num, req);
1409 static void bc_num_free(void *num)
1411 free(((BcNum *) num)->num);
1414 static void bc_num_copy(BcNum *d, BcNum *s)
1417 bc_num_expand(d, s->cap);
1421 memcpy(d->num, s->num, sizeof(BcDig) * d->len);
1425 static BcStatus bc_num_ulong(BcNum *n, unsigned long *result_p)
1428 unsigned long pow, result;
1430 if (n->neg) return bc_error("negative number");
1432 for (result = 0, pow = 1, i = n->rdx; i < n->len; ++i) {
1434 unsigned long prev = result, powprev = pow;
1436 result += ((unsigned long) n->num[i]) * pow;
1439 if (result < prev || pow < powprev)
1440 return bc_error("overflow");
1446 return BC_STATUS_SUCCESS;
1449 static void bc_num_ulong2num(BcNum *n, unsigned long val)
1457 if (val == 0) return;
1459 for (len = 1, i = ULONG_MAX; i != 0; i /= 10, ++len) bc_num_expand(n, len);
1460 for (ptr = n->num, i = 0; val; ++i, ++n->len, val /= 10) ptr[i] = val % 10;
1463 static void bc_num_subArrays(BcDig *restrict a, BcDig *restrict b,
1467 for (i = 0; i < len; ++i) {
1468 for (a[i] -= b[i], j = 0; a[i + j] < 0;) {
1475 #define BC_NUM_NEG(n, neg) ((((ssize_t)(n)) ^ -((ssize_t)(neg))) + (neg))
1476 #define BC_NUM_ONE(n) ((n)->len == 1 && (n)->rdx == 0 && (n)->num[0] == 1)
1477 #define BC_NUM_INT(n) ((n)->len - (n)->rdx)
1478 //#define BC_NUM_AREQ(a, b) (BC_MAX((a)->rdx, (b)->rdx) + BC_MAX(BC_NUM_INT(a), BC_NUM_INT(b)) + 1)
1479 static /*ALWAYS_INLINE*/ size_t BC_NUM_AREQ(BcNum *a, BcNum *b)
1481 return BC_MAX(a->rdx, b->rdx) + BC_MAX(BC_NUM_INT(a), BC_NUM_INT(b)) + 1;
1483 //#define BC_NUM_MREQ(a, b, scale) (BC_NUM_INT(a) + BC_NUM_INT(b) + BC_MAX((scale), (a)->rdx + (b)->rdx) + 1)
1484 static /*ALWAYS_INLINE*/ size_t BC_NUM_MREQ(BcNum *a, BcNum *b, size_t scale)
1486 return BC_NUM_INT(a) + BC_NUM_INT(b) + BC_MAX(scale, a->rdx + b->rdx) + 1;
1489 static ssize_t bc_num_compare(BcDig *restrict a, BcDig *restrict b, size_t len)
1493 for (i = len - 1; i < len && !(c = a[i] - b[i]); --i);
1494 return BC_NUM_NEG(i + 1, c < 0);
1497 static ssize_t bc_num_cmp(BcNum *a, BcNum *b)
1499 size_t i, min, a_int, b_int, diff;
1500 BcDig *max_num, *min_num;
1501 bool a_max, neg = false;
1504 if (a == b) return 0;
1505 if (a->len == 0) return BC_NUM_NEG(!!b->len, !b->neg);
1506 if (b->len == 0) return BC_NUM_NEG(1, a->neg);
1516 a_int = BC_NUM_INT(a);
1517 b_int = BC_NUM_INT(b);
1519 a_max = (a->rdx > b->rdx);
1521 if (a_int != 0) return (ssize_t) a_int;
1525 diff = a->rdx - b->rdx;
1526 max_num = a->num + diff;
1531 diff = b->rdx - a->rdx;
1532 max_num = b->num + diff;
1536 cmp = bc_num_compare(max_num, min_num, b_int + min);
1537 if (cmp != 0) return BC_NUM_NEG(cmp, (!a_max) != neg);
1539 for (max_num -= diff, i = diff - 1; i < diff; --i) {
1540 if (max_num[i]) return BC_NUM_NEG(1, (!a_max) != neg);
1546 static void bc_num_truncate(BcNum *n, size_t places)
1548 if (places == 0) return;
1554 memmove(n->num, n->num + places, n->len * sizeof(BcDig));
1558 static void bc_num_extend(BcNum *n, size_t places)
1560 size_t len = n->len + places;
1564 if (n->cap < len) bc_num_expand(n, len);
1566 memmove(n->num + places, n->num, sizeof(BcDig) * n->len);
1567 memset(n->num, 0, sizeof(BcDig) * places);
1574 static void bc_num_clean(BcNum *n)
1576 while (n->len > 0 && n->num[n->len - 1] == 0) --n->len;
1579 else if (n->len < n->rdx)
1583 static void bc_num_retireMul(BcNum *n, size_t scale, bool neg1, bool neg2)
1586 bc_num_extend(n, scale - n->rdx);
1588 bc_num_truncate(n, n->rdx - scale);
1591 if (n->len != 0) n->neg = !neg1 != !neg2;
1594 static void bc_num_split(BcNum *restrict n, size_t idx, BcNum *restrict a,
1599 b->len = n->len - idx;
1601 a->rdx = b->rdx = 0;
1603 memcpy(b->num, n->num + idx, b->len * sizeof(BcDig));
1604 memcpy(a->num, n->num, idx * sizeof(BcDig));
1615 static BcStatus bc_num_shift(BcNum *n, size_t places)
1617 if (places == 0 || n->len == 0) return BC_STATUS_SUCCESS;
1619 // This check makes sense only if size_t is (much) larger than BC_MAX_NUM.
1620 if (SIZE_MAX > (BC_MAX_NUM | 0xff)) {
1621 if (places + n->len > BC_MAX_NUM)
1622 return bc_error("number too long: must be [1,"BC_MAX_NUM_STR"]");
1625 if (n->rdx >= places)
1628 bc_num_extend(n, places - n->rdx);
1634 return BC_STATUS_SUCCESS;
1637 static BcStatus bc_num_inv(BcNum *a, BcNum *b, size_t scale)
1646 return bc_num_div(&one, a, b, scale);
1649 static BcStatus bc_num_a(BcNum *a, BcNum *b, BcNum *restrict c, size_t sub)
1651 BcDig *ptr, *ptr_a, *ptr_b, *ptr_c;
1652 size_t i, max, min_rdx, min_int, diff, a_int, b_int;
1655 // Because this function doesn't need to use scale (per the bc spec),
1656 // I am hijacking it to say whether it's doing an add or a subtract.
1660 if (sub && c->len) c->neg = !c->neg;
1661 return BC_STATUS_SUCCESS;
1663 else if (b->len == 0) {
1665 return BC_STATUS_SUCCESS;
1669 c->rdx = BC_MAX(a->rdx, b->rdx);
1670 min_rdx = BC_MIN(a->rdx, b->rdx);
1673 if (a->rdx > b->rdx) {
1674 diff = a->rdx - b->rdx;
1676 ptr_a = a->num + diff;
1680 diff = b->rdx - a->rdx;
1683 ptr_b = b->num + diff;
1686 for (ptr_c = c->num, i = 0; i < diff; ++i, ++c->len) ptr_c[i] = ptr[i];
1689 a_int = BC_NUM_INT(a);
1690 b_int = BC_NUM_INT(b);
1692 if (a_int > b_int) {
1703 for (carry = 0, i = 0; i < min_rdx + min_int; ++i, ++c->len) {
1704 in = ((int) ptr_a[i]) + ((int) ptr_b[i]) + carry;
1706 ptr_c[i] = (BcDig)(in % 10);
1709 for (; i < max + min_rdx; ++i, ++c->len) {
1710 in = ((int) ptr[i]) + carry;
1712 ptr_c[i] = (BcDig)(in % 10);
1715 if (carry != 0) c->num[c->len++] = (BcDig) carry;
1717 return BC_STATUS_SUCCESS; // can't make void, see bc_num_binary()
1720 static BcStatus bc_num_s(BcNum *a, BcNum *b, BcNum *restrict c, size_t sub)
1723 BcNum *minuend, *subtrahend;
1725 bool aneg, bneg, neg;
1727 // Because this function doesn't need to use scale (per the bc spec),
1728 // I am hijacking it to say whether it's doing an add or a subtract.
1732 if (sub && c->len) c->neg = !c->neg;
1733 return BC_STATUS_SUCCESS;
1735 else if (b->len == 0) {
1737 return BC_STATUS_SUCCESS;
1742 a->neg = b->neg = false;
1744 cmp = bc_num_cmp(a, b);
1750 bc_num_setToZero(c, BC_MAX(a->rdx, b->rdx));
1751 return BC_STATUS_SUCCESS;
1760 if (sub) neg = !neg;
1765 bc_num_copy(c, minuend);
1768 if (c->rdx < subtrahend->rdx) {
1769 bc_num_extend(c, subtrahend->rdx - c->rdx);
1773 start = c->rdx - subtrahend->rdx;
1775 bc_num_subArrays(c->num + start, subtrahend->num, subtrahend->len);
1779 return BC_STATUS_SUCCESS; // can't make void, see bc_num_binary()
1782 static BcStatus bc_num_k(BcNum *restrict a, BcNum *restrict b,
1786 size_t max = BC_MAX(a->len, b->len), max2 = (max + 1) / 2;
1787 BcNum l1, h1, l2, h2, m2, m1, z0, z1, z2, temp;
1790 if (a->len == 0 || b->len == 0) {
1792 return BC_STATUS_SUCCESS;
1794 aone = BC_NUM_ONE(a);
1795 if (aone || BC_NUM_ONE(b)) {
1796 bc_num_copy(c, aone ? b : a);
1797 return BC_STATUS_SUCCESS;
1800 if (a->len + b->len < BC_NUM_KARATSUBA_LEN ||
1801 a->len < BC_NUM_KARATSUBA_LEN || b->len < BC_NUM_KARATSUBA_LEN)
1806 bc_num_expand(c, a->len + b->len + 1);
1808 memset(c->num, 0, sizeof(BcDig) * c->cap);
1811 for (i = 0; i < b->len; ++i) {
1814 for (j = 0; j < a->len; ++j) {
1815 unsigned in = c->num[i + j];
1816 in += ((unsigned) a->num[j]) * ((unsigned) b->num[i]) + carry;
1817 // note: compilers prefer _unsigned_ div/const
1819 c->num[i + j] = (BcDig)(in % 10);
1822 c->num[i + j] += (BcDig) carry;
1823 len = BC_MAX(len, i + j + !!carry);
1826 // a*a <- without check below, this will not be interruptible
1827 if (G_interrupt) return BC_STATUS_FAILURE;
1832 return BC_STATUS_SUCCESS;
1835 bc_num_init(&l1, max);
1836 bc_num_init(&h1, max);
1837 bc_num_init(&l2, max);
1838 bc_num_init(&h2, max);
1839 bc_num_init(&m1, max);
1840 bc_num_init(&m2, max);
1841 bc_num_init(&z0, max);
1842 bc_num_init(&z1, max);
1843 bc_num_init(&z2, max);
1844 bc_num_init(&temp, max + max);
1846 bc_num_split(a, max2, &l1, &h1);
1847 bc_num_split(b, max2, &l2, &h2);
1849 s = bc_num_add(&h1, &l1, &m1, 0);
1851 s = bc_num_add(&h2, &l2, &m2, 0);
1854 s = bc_num_k(&h1, &h2, &z0);
1856 s = bc_num_k(&m1, &m2, &z1);
1858 s = bc_num_k(&l1, &l2, &z2);
1861 s = bc_num_sub(&z1, &z0, &temp, 0);
1863 s = bc_num_sub(&temp, &z2, &z1, 0);
1866 s = bc_num_shift(&z0, max2 * 2);
1868 s = bc_num_shift(&z1, max2);
1870 s = bc_num_add(&z0, &z1, &temp, 0);
1872 s = bc_num_add(&temp, &z2, c, 0);
1888 static BcStatus bc_num_m(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale)
1892 size_t maxrdx = BC_MAX(a->rdx, b->rdx);
1894 scale = BC_MAX(scale, a->rdx);
1895 scale = BC_MAX(scale, b->rdx);
1896 scale = BC_MIN(a->rdx + b->rdx, scale);
1897 maxrdx = BC_MAX(maxrdx, scale);
1899 bc_num_init(&cpa, a->len);
1900 bc_num_init(&cpb, b->len);
1902 bc_num_copy(&cpa, a);
1903 bc_num_copy(&cpb, b);
1904 cpa.neg = cpb.neg = false;
1906 s = bc_num_shift(&cpa, maxrdx);
1908 s = bc_num_shift(&cpb, maxrdx);
1910 s = bc_num_k(&cpa, &cpb, c);
1914 bc_num_expand(c, c->len + maxrdx);
1916 if (c->len < maxrdx) {
1917 memset(c->num + c->len, 0, (c->cap - c->len) * sizeof(BcDig));
1922 bc_num_retireMul(c, scale, a->neg, b->neg);
1930 static BcStatus bc_num_d(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale)
1932 BcStatus s = BC_STATUS_SUCCESS;
1939 return bc_error("divide by zero");
1940 else if (a->len == 0) {
1941 bc_num_setToZero(c, scale);
1942 return BC_STATUS_SUCCESS;
1944 else if (BC_NUM_ONE(b)) {
1946 bc_num_retireMul(c, scale, a->neg, b->neg);
1947 return BC_STATUS_SUCCESS;
1950 bc_num_init(&cp, BC_NUM_MREQ(a, b, scale));
1951 bc_num_copy(&cp, a);
1955 bc_num_expand(&cp, len + 2);
1956 bc_num_extend(&cp, len - cp.len);
1959 if (b->rdx > cp.rdx) bc_num_extend(&cp, b->rdx - cp.rdx);
1961 if (scale > cp.rdx) bc_num_extend(&cp, scale - cp.rdx);
1963 if (b->rdx == b->len) {
1964 for (i = 0; zero && i < len; ++i) zero = !b->num[len - i - 1];
1968 if (cp.cap == cp.len) bc_num_expand(&cp, cp.len + 1);
1970 // We want an extra zero in front to make things simpler.
1971 cp.num[cp.len++] = 0;
1974 bc_num_expand(c, cp.len);
1977 memset(c->num + end, 0, (c->cap - end) * sizeof(BcDig));
1982 for (i = end - 1; !s && i < end; --i) {
1984 for (q = 0; (!s && n[len] != 0) || bc_num_compare(n, p, len) >= 0; ++q)
1985 bc_num_subArrays(n, p, len);
1989 // 1/a <- without check below, this will not be interruptible
1991 s = BC_STATUS_FAILURE;
1996 bc_num_retireMul(c, scale, a->neg, b->neg);
2002 static BcStatus bc_num_r(BcNum *a, BcNum *b, BcNum *restrict c,
2003 BcNum *restrict d, size_t scale, size_t ts)
2010 return bc_error("divide by zero");
2013 bc_num_setToZero(d, ts);
2014 return BC_STATUS_SUCCESS;
2017 bc_num_init(&temp, d->cap);
2018 s = bc_num_d(a, b, c, scale);
2021 if (scale != 0) scale = ts;
2023 s = bc_num_m(c, b, &temp, scale);
2025 s = bc_num_sub(a, &temp, d, scale);
2028 if (ts > d->rdx && d->len) bc_num_extend(d, ts - d->rdx);
2031 bc_num_retireMul(d, ts, a->neg, b->neg);
2039 static BcStatus bc_num_rem(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale)
2043 size_t ts = BC_MAX(scale + b->rdx, a->rdx), len = BC_NUM_MREQ(a, b, ts);
2045 bc_num_init(&c1, len);
2046 s = bc_num_r(a, b, &c1, c, scale, ts);
2052 static BcStatus bc_num_p(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale)
2054 BcStatus s = BC_STATUS_SUCCESS;
2057 size_t i, powrdx, resrdx;
2060 if (b->rdx) return bc_error("non integer number");
2064 return BC_STATUS_SUCCESS;
2066 else if (a->len == 0) {
2067 bc_num_setToZero(c, scale);
2068 return BC_STATUS_SUCCESS;
2070 else if (BC_NUM_ONE(b)) {
2074 s = bc_num_inv(a, c, scale);
2081 s = bc_num_ulong(b, &pow);
2084 bc_num_init(©, a->len);
2085 bc_num_copy(©, a);
2090 if (a->rdx * pow < scale)
2091 scale = a->rdx * pow;
2096 for (powrdx = a->rdx; !(pow & 1); pow >>= 1) {
2098 s = bc_num_mul(©, ©, ©, powrdx);
2100 // Not needed: bc_num_mul() has a check for ^C:
2101 //if (G_interrupt) {
2102 // s = BC_STATUS_FAILURE;
2107 bc_num_copy(c, ©);
2109 for (resrdx = powrdx, pow >>= 1; pow != 0; pow >>= 1) {
2112 s = bc_num_mul(©, ©, ©, powrdx);
2117 s = bc_num_mul(c, ©, c, resrdx);
2120 // Not needed: bc_num_mul() has a check for ^C:
2121 //if (G_interrupt) {
2122 // s = BC_STATUS_FAILURE;
2128 s = bc_num_inv(c, c, scale);
2132 if (c->rdx > scale) bc_num_truncate(c, c->rdx - scale);
2134 // We can't use bc_num_clean() here.
2135 for (zero = true, i = 0; zero && i < c->len; ++i) zero = !c->num[i];
2136 if (zero) bc_num_setToZero(c, scale);
2143 static BcStatus bc_num_binary(BcNum *a, BcNum *b, BcNum *c, size_t scale,
2144 BcNumBinaryOp op, size_t req)
2147 BcNum num2, *ptr_a, *ptr_b;
2152 memcpy(ptr_a, c, sizeof(BcNum));
2161 memcpy(ptr_b, c, sizeof(BcNum));
2169 bc_num_init(c, req);
2171 bc_num_expand(c, req);
2173 s = op(ptr_a, ptr_b, c, scale);
2175 if (init) bc_num_free(&num2);
2180 static bool bc_num_strValid(const char *val, size_t base)
2183 bool small, radix = false;
2184 size_t i, len = strlen(val);
2186 if (!len) return true;
2189 b = (BcDig)(small ? base + '0' : base - 10 + 'A');
2191 for (i = 0; i < len; ++i) {
2197 if (radix) return false;
2203 if (c < '0' || (small && c >= b) || (c > '9' && (c < 'A' || c >= b)))
2210 static void bc_num_parseDecimal(BcNum *n, const char *val)
2216 for (i = 0; val[i] == '0'; ++i);
2223 for (i = 0; zero && i < len; ++i) zero = val[i] == '0' || val[i] == '.';
2224 bc_num_expand(n, len);
2227 ptr = strchr(val, '.');
2231 n->rdx = (size_t)((val + len) - (ptr + 1));
2234 for (i = len - 1; i < len; ++n->len, i -= 1 + (i && val[i - 1] == '.'))
2235 n->num[n->len] = val[i] - '0';
2239 static void bc_num_parseBase(BcNum *n, const char *val, BcNum *base)
2242 BcNum temp, mult, result;
2246 size_t i, digits, len = strlen(val);
2250 for (i = 0; zero && i < len; ++i) zero = (val[i] == '.' || val[i] == '0');
2253 bc_num_init(&temp, BC_NUM_DEF_SIZE);
2254 bc_num_init(&mult, BC_NUM_DEF_SIZE);
2256 for (i = 0; i < len; ++i) {
2259 if (c == '.') break;
2261 v = (unsigned long) (c <= '9' ? c - '0' : c - 'A' + 10);
2263 s = bc_num_mul(n, base, &mult, 0);
2264 if (s) goto int_err;
2265 bc_num_ulong2num(&temp, v);
2266 s = bc_num_add(&mult, &temp, n, 0);
2267 if (s) goto int_err;
2272 if (c == 0) goto int_err;
2275 bc_num_init(&result, base->len);
2276 bc_num_zero(&result);
2279 for (i += 1, digits = 0; i < len; ++i, ++digits) {
2284 v = (unsigned long) (c <= '9' ? c - '0' : c - 'A' + 10);
2286 s = bc_num_mul(&result, base, &result, 0);
2288 bc_num_ulong2num(&temp, v);
2289 s = bc_num_add(&result, &temp, &result, 0);
2291 s = bc_num_mul(&mult, base, &mult, 0);
2295 s = bc_num_div(&result, &mult, &result, digits);
2297 s = bc_num_add(n, &result, n, digits);
2301 if (n->rdx < digits) bc_num_extend(n, digits - n->rdx);
2307 bc_num_free(&result);
2313 static void bc_num_printNewline(size_t *nchars)
2315 if (*nchars == G.prog.len - 1) {
2323 static void bc_num_printChar(size_t num, size_t width, bool radix,
2327 bb_putchar((char) num);
2328 *nchars = *nchars + width;
2332 static void bc_num_printDigits(size_t num, size_t width, bool radix,
2337 bc_num_printNewline(nchars);
2338 bb_putchar(radix ? '.' : ' ');
2341 bc_num_printNewline(nchars);
2342 for (exp = 0, pow = 1; exp < width - 1; ++exp, pow *= 10)
2345 for (exp = 0; exp < width; pow /= 10, ++(*nchars), ++exp) {
2347 bc_num_printNewline(nchars);
2350 bb_putchar(((char) dig) + '0');
2354 static void bc_num_printHex(size_t num, size_t width, bool radix,
2358 bc_num_printNewline(nchars);
2363 bc_num_printNewline(nchars);
2364 bb_putchar(bb_hexdigits_upcase[num]);
2365 *nchars = *nchars + width;
2368 static void bc_num_printDecimal(BcNum *n, size_t *nchars)
2370 size_t i, rdx = n->rdx - 1;
2372 if (n->neg) bb_putchar('-');
2373 (*nchars) += n->neg;
2375 for (i = n->len - 1; i < n->len; --i)
2376 bc_num_printHex((size_t) n->num[i], 1, i == rdx, nchars);
2379 static BcStatus bc_num_printNum(BcNum *n, BcNum *base, size_t width,
2380 size_t *nchars, BcNumDigitOp print)
2384 BcNum intp, fracp, digit, frac_len;
2385 unsigned long dig, *ptr;
2390 print(0, width, false, nchars);
2391 return BC_STATUS_SUCCESS;
2394 bc_vec_init(&stack, sizeof(long), NULL);
2395 bc_num_init(&intp, n->len);
2396 bc_num_init(&fracp, n->rdx);
2397 bc_num_init(&digit, width);
2398 bc_num_init(&frac_len, BC_NUM_INT(n));
2399 bc_num_copy(&intp, n);
2400 bc_num_one(&frac_len);
2402 bc_num_truncate(&intp, intp.rdx);
2403 s = bc_num_sub(n, &intp, &fracp, 0);
2406 while (intp.len != 0) {
2407 s = bc_num_divmod(&intp, base, &intp, &digit, 0);
2409 s = bc_num_ulong(&digit, &dig);
2411 bc_vec_push(&stack, &dig);
2414 for (i = 0; i < stack.len; ++i) {
2415 ptr = bc_vec_item_rev(&stack, i);
2416 print(*ptr, width, false, nchars);
2419 if (!n->rdx) goto err;
2421 for (radix = true; frac_len.len <= n->rdx; radix = false) {
2422 s = bc_num_mul(&fracp, base, &fracp, n->rdx);
2424 s = bc_num_ulong(&fracp, &dig);
2426 bc_num_ulong2num(&intp, dig);
2427 s = bc_num_sub(&fracp, &intp, &fracp, 0);
2429 print(dig, width, radix, nchars);
2430 s = bc_num_mul(&frac_len, base, &frac_len, 0);
2435 bc_num_free(&frac_len);
2436 bc_num_free(&digit);
2437 bc_num_free(&fracp);
2439 bc_vec_free(&stack);
2443 static BcStatus bc_num_printBase(BcNum *n, BcNum *base, size_t base_t,
2451 if (neg) bb_putchar('-');
2456 if (base_t <= BC_NUM_MAX_IBASE) {
2458 print = bc_num_printHex;
2461 for (i = base_t - 1, width = 0; i != 0; i /= 10, ++width);
2462 print = bc_num_printDigits;
2465 s = bc_num_printNum(n, base, width, nchars, print);
2472 static BcStatus bc_num_stream(BcNum *n, BcNum *base, size_t *nchars)
2474 return bc_num_printNum(n, base, 1, nchars, bc_num_printChar);
2478 static BcStatus bc_num_parse(BcNum *n, const char *val, BcNum *base,
2481 if (!bc_num_strValid(val, base_t))
2482 return bc_error("bad number string");
2485 bc_num_parseDecimal(n, val);
2487 bc_num_parseBase(n, val, base);
2489 return BC_STATUS_SUCCESS;
2492 static BcStatus bc_num_print(BcNum *n, BcNum *base, size_t base_t, bool newline,
2495 BcStatus s = BC_STATUS_SUCCESS;
2497 bc_num_printNewline(nchars);
2503 else if (base_t == 10)
2504 bc_num_printDecimal(n, nchars);
2506 s = bc_num_printBase(n, base, base_t, nchars);
2516 static BcStatus bc_num_add(BcNum *a, BcNum *b, BcNum *c, size_t scale)
2518 BcNumBinaryOp op = (!a->neg == !b->neg) ? bc_num_a : bc_num_s;
2520 return bc_num_binary(a, b, c, false, op, BC_NUM_AREQ(a, b));
2523 static BcStatus bc_num_sub(BcNum *a, BcNum *b, BcNum *c, size_t scale)
2525 BcNumBinaryOp op = (!a->neg == !b->neg) ? bc_num_s : bc_num_a;
2527 return bc_num_binary(a, b, c, true, op, BC_NUM_AREQ(a, b));
2530 static BcStatus bc_num_mul(BcNum *a, BcNum *b, BcNum *c, size_t scale)
2532 size_t req = BC_NUM_MREQ(a, b, scale);
2533 return bc_num_binary(a, b, c, scale, bc_num_m, req);
2536 static BcStatus bc_num_div(BcNum *a, BcNum *b, BcNum *c, size_t scale)
2538 size_t req = BC_NUM_MREQ(a, b, scale);
2539 return bc_num_binary(a, b, c, scale, bc_num_d, req);
2542 static BcStatus bc_num_mod(BcNum *a, BcNum *b, BcNum *c, size_t scale)
2544 size_t req = BC_NUM_MREQ(a, b, scale);
2545 return bc_num_binary(a, b, c, scale, bc_num_rem, req);
2548 static BcStatus bc_num_pow(BcNum *a, BcNum *b, BcNum *c, size_t scale)
2550 return bc_num_binary(a, b, c, scale, bc_num_p, a->len * b->len + 1);
2553 static BcStatus bc_num_sqrt(BcNum *a, BcNum *restrict b, size_t scale)
2556 BcNum num1, num2, half, f, fprime, *x0, *x1, *temp;
2557 size_t pow, len, digs, digs1, resrdx, req, times = 0;
2558 ssize_t cmp = 1, cmp1 = SSIZE_MAX, cmp2 = SSIZE_MAX;
2560 req = BC_MAX(scale, a->rdx) + ((BC_NUM_INT(a) + 1) >> 1) + 1;
2561 bc_num_expand(b, req);
2564 bc_num_setToZero(b, scale);
2565 return BC_STATUS_SUCCESS;
2568 return bc_error("negative number");
2569 else if (BC_NUM_ONE(a)) {
2571 bc_num_extend(b, scale);
2572 return BC_STATUS_SUCCESS;
2575 scale = BC_MAX(scale, a->rdx) + 1;
2576 len = a->len + scale;
2578 bc_num_init(&num1, len);
2579 bc_num_init(&num2, len);
2580 bc_num_init(&half, BC_NUM_DEF_SIZE);
2586 bc_num_init(&f, len);
2587 bc_num_init(&fprime, len);
2593 pow = BC_NUM_INT(a);
2602 pow -= 2 - (pow & 1);
2604 bc_num_extend(x0, pow);
2606 // Make sure to move the radix back.
2610 x0->rdx = digs = digs1 = 0;
2612 len = BC_NUM_INT(x0) + resrdx - 1;
2614 while (cmp != 0 || digs < len) {
2616 s = bc_num_div(a, x0, &f, resrdx);
2618 s = bc_num_add(x0, &f, &fprime, resrdx);
2620 s = bc_num_mul(&fprime, &half, x1, resrdx);
2623 cmp = bc_num_cmp(x1, x0);
2624 digs = x1->len - (unsigned long long) llabs(cmp);
2626 if (cmp == cmp2 && digs == digs1)
2631 resrdx += times > 4;
2644 if (b->rdx > scale) bc_num_truncate(b, b->rdx - scale);
2647 bc_num_free(&fprime);
2655 static BcStatus bc_num_divmod(BcNum *a, BcNum *b, BcNum *c, BcNum *d,
2661 size_t ts = BC_MAX(scale + b->rdx, a->rdx), len = BC_NUM_MREQ(a, b, ts);
2664 memcpy(&num2, c, sizeof(BcNum));
2666 bc_num_init(c, len);
2671 bc_num_expand(c, len);
2674 s = bc_num_r(ptr_a, b, c, d, scale, ts);
2676 if (init) bc_num_free(&num2);
2682 static BcStatus bc_num_modexp(BcNum *a, BcNum *b, BcNum *c, BcNum *restrict d)
2685 BcNum base, exp, two, temp;
2688 return bc_error("divide by zero");
2689 if (a->rdx || b->rdx || c->rdx)
2690 return bc_error("non integer number");
2692 return bc_error("negative number");
2694 bc_num_expand(d, c->len);
2695 bc_num_init(&base, c->len);
2696 bc_num_init(&exp, b->len);
2697 bc_num_init(&two, BC_NUM_DEF_SIZE);
2698 bc_num_init(&temp, b->len);
2704 s = bc_num_rem(a, c, &base, 0);
2706 bc_num_copy(&exp, b);
2708 while (exp.len != 0) {
2710 s = bc_num_divmod(&exp, &two, &exp, &temp, 0);
2713 if (BC_NUM_ONE(&temp)) {
2714 s = bc_num_mul(d, &base, &temp, 0);
2716 s = bc_num_rem(&temp, c, d, 0);
2720 s = bc_num_mul(&base, &base, &temp, 0);
2722 s = bc_num_rem(&temp, c, &base, 0);
2736 static BcStatus bc_func_insert(BcFunc *f, char *name, bool var)
2741 for (i = 0; i < f->autos.len; ++i) {
2742 if (strcmp(name, ((BcId *) bc_vec_item(&f->autos, i))->name) == 0)
2743 return bc_error("function parameter or auto var has the same name as another");
2749 bc_vec_push(&f->autos, &a);
2751 return BC_STATUS_SUCCESS;
2755 static void bc_func_init(BcFunc *f)
2757 bc_char_vec_init(&f->code);
2758 bc_vec_init(&f->autos, sizeof(BcId), bc_id_free);
2759 bc_vec_init(&f->labels, sizeof(size_t), NULL);
2763 static void bc_func_free(void *func)
2765 BcFunc *f = (BcFunc *) func;
2766 bc_vec_free(&f->code);
2767 bc_vec_free(&f->autos);
2768 bc_vec_free(&f->labels);
2771 static void bc_array_expand(BcVec *a, size_t len);
2773 static void bc_array_init(BcVec *a, bool nums)
2776 bc_vec_init(a, sizeof(BcNum), bc_num_free);
2778 bc_vec_init(a, sizeof(BcVec), bc_vec_free);
2779 bc_array_expand(a, 1);
2782 static void bc_array_expand(BcVec *a, size_t len)
2786 if (a->size == sizeof(BcNum) && a->dtor == bc_num_free) {
2787 while (len > a->len) {
2788 bc_num_init(&data.n, BC_NUM_DEF_SIZE);
2789 bc_vec_push(a, &data.n);
2793 while (len > a->len) {
2794 bc_array_init(&data.v, true);
2795 bc_vec_push(a, &data.v);
2800 static void bc_array_copy(BcVec *d, const BcVec *s)
2805 bc_vec_expand(d, s->cap);
2808 for (i = 0; i < s->len; ++i) {
2809 BcNum *dnum = bc_vec_item(d, i), *snum = bc_vec_item(s, i);
2810 bc_num_init(dnum, snum->len);
2811 bc_num_copy(dnum, snum);
2815 static void bc_string_free(void *string)
2817 free(*((char **) string));
2821 static void bc_result_copy(BcResult *d, BcResult *src)
2827 case BC_RESULT_TEMP:
2828 case BC_RESULT_IBASE:
2829 case BC_RESULT_SCALE:
2830 case BC_RESULT_OBASE:
2832 bc_num_init(&d->d.n, src->d.n.len);
2833 bc_num_copy(&d->d.n, &src->d.n);
2838 case BC_RESULT_ARRAY:
2839 case BC_RESULT_ARRAY_ELEM:
2841 d->d.id.name = xstrdup(src->d.id.name);
2845 case BC_RESULT_CONSTANT:
2846 case BC_RESULT_LAST:
2850 memcpy(&d->d.n, &src->d.n, sizeof(BcNum));
2857 static void bc_result_free(void *result)
2859 BcResult *r = (BcResult *) result;
2863 case BC_RESULT_TEMP:
2864 case BC_RESULT_IBASE:
2865 case BC_RESULT_SCALE:
2866 case BC_RESULT_OBASE:
2868 bc_num_free(&r->d.n);
2873 case BC_RESULT_ARRAY:
2874 case BC_RESULT_ARRAY_ELEM:
2888 static void bc_lex_lineComment(BcLex *l)
2890 l->t.t = BC_LEX_WHITESPACE;
2891 while (l->i < l->len && l->buf[l->i++] != '\n');
2895 static void bc_lex_whitespace(BcLex *l)
2898 l->t.t = BC_LEX_WHITESPACE;
2899 for (c = l->buf[l->i]; c != '\n' && isspace(c); c = l->buf[++l->i]);
2902 static BcStatus bc_lex_number(BcLex *l, char start)
2904 const char *buf = l->buf + l->i;
2905 size_t len, hits = 0, bslashes = 0, i = 0, j;
2907 bool last_pt, pt = start == '.';
2910 l->t.t = BC_LEX_NUMBER;
2912 while (c != 0 && (isdigit(c) || (c >= 'A' && c <= 'F') ||
2913 (c == '.' && !pt) || (c == '\\' && buf[i + 1] == '\n')))
2927 len = i + !last_pt - bslashes * 2;
2928 // This check makes sense only if size_t is (much) larger than BC_MAX_NUM.
2929 if (SIZE_MAX > (BC_MAX_NUM | 0xff)) {
2930 if (len > BC_MAX_NUM)
2931 return bc_error("number too long: must be [1,"BC_MAX_NUM_STR"]");
2934 bc_vec_pop_all(&l->t.v);
2935 bc_vec_expand(&l->t.v, len + 1);
2936 bc_vec_push(&l->t.v, &start);
2938 for (buf -= 1, j = 1; j < len + hits * 2; ++j) {
2942 // If we have hit a backslash, skip it. We don't have
2943 // to check for a newline because it's guaranteed.
2944 if (hits < bslashes && c == '\\') {
2950 bc_vec_push(&l->t.v, &c);
2953 bc_vec_pushZeroByte(&l->t.v);
2956 return BC_STATUS_SUCCESS;
2959 static BcStatus bc_lex_name(BcLex *l)
2962 const char *buf = l->buf + l->i - 1;
2965 l->t.t = BC_LEX_NAME;
2967 while ((c >= 'a' && c <= 'z') || isdigit(c) || c == '_') c = buf[++i];
2969 // This check makes sense only if size_t is (much) larger than BC_MAX_STRING.
2970 if (SIZE_MAX > (BC_MAX_STRING | 0xff)) {
2971 if (i > BC_MAX_STRING)
2972 return bc_error("name too long: must be [1,"BC_MAX_STRING_STR"]");
2974 bc_vec_string(&l->t.v, i, buf);
2976 // Increment the index. We minus 1 because it has already been incremented.
2979 return BC_STATUS_SUCCESS;
2982 static void bc_lex_init(BcLex *l, BcLexNext next)
2985 bc_char_vec_init(&l->t.v);
2988 static void bc_lex_free(BcLex *l)
2990 bc_vec_free(&l->t.v);
2993 static void bc_lex_file(BcLex *l)
2995 G.err_line = l->line = 1;
2999 static BcStatus bc_lex_next(BcLex *l)
3004 if (l->t.last == BC_LEX_EOF) return bc_error("end of file");
3006 l->line += l->newline;
3007 G.err_line = l->line;
3008 l->t.t = BC_LEX_EOF;
3010 l->newline = (l->i == l->len);
3011 if (l->newline) return BC_STATUS_SUCCESS;
3013 // Loop until failure or we don't have whitespace. This
3014 // is so the parser doesn't get inundated with whitespace.
3017 } while (!s && l->t.t == BC_LEX_WHITESPACE);
3022 static BcStatus bc_lex_text(BcLex *l, const char *text)
3026 l->len = strlen(text);
3027 l->t.t = l->t.last = BC_LEX_INVALID;
3028 return bc_lex_next(l);
3032 static BcStatus bc_lex_identifier(BcLex *l)
3036 const char *buf = l->buf + l->i - 1;
3038 for (i = 0; i < ARRAY_SIZE(bc_lex_kws); ++i) {
3039 const char *keyword8 = bc_lex_kws[i].name8;
3041 while (buf[j] != '\0' && buf[j] == keyword8[j]) {
3043 if (j == 8) goto match;
3045 if (keyword8[j] != '\0')
3048 // buf starts with keyword bc_lex_kws[i]
3049 l->t.t = BC_LEX_KEY_1st_keyword + i;
3050 if (!bc_lex_kws_POSIX(i)) {
3051 s = bc_posix_error_fmt("%sthe '%.8s' keyword", "POSIX does not allow ", bc_lex_kws[i].name8);
3055 // We minus 1 because the index has already been incremented.
3057 return BC_STATUS_SUCCESS;
3063 if (l->t.v.len > 2) {
3066 // bc: POSIX only allows one character names; the following is bad: 'qwe=1
3068 unsigned len = strchrnul(buf, '\n') - buf;
3069 s = bc_posix_error_fmt("POSIX only allows one character names; the following is bad: '%.*s'", len, buf);
3075 static BcStatus bc_lex_string(BcLex *l)
3077 size_t len, nls = 0, i = l->i;
3080 l->t.t = BC_LEX_STR;
3082 for (c = l->buf[i]; c != 0 && c != '"'; c = l->buf[++i]) nls += (c == '\n');
3086 return bc_error("string end could not be found");
3090 // This check makes sense only if size_t is (much) larger than BC_MAX_STRING.
3091 if (SIZE_MAX > (BC_MAX_STRING | 0xff)) {
3092 if (len > BC_MAX_STRING)
3093 return bc_error("string too long: must be [1,"BC_MAX_STRING_STR"]");
3095 bc_vec_string(&l->t.v, len, l->buf + l->i);
3099 G.err_line = l->line;
3101 return BC_STATUS_SUCCESS;
3104 static void bc_lex_assign(BcLex *l, BcLexType with, BcLexType without)
3106 if (l->buf[l->i] == '=') {
3114 static BcStatus bc_lex_comment(BcLex *l)
3117 const char *buf = l->buf;
3119 l->t.t = BC_LEX_WHITESPACE;
3132 return bc_error("comment end could not be found");
3140 G.err_line = l->line;
3142 return BC_STATUS_SUCCESS;
3145 static BcStatus bc_lex_token(BcLex *l)
3147 BcStatus s = BC_STATUS_SUCCESS;
3148 char c = l->buf[l->i++], c2;
3150 // This is the workhorse of the lexer.
3157 l->t.t = !c ? BC_LEX_EOF : BC_LEX_NLINE;
3167 bc_lex_whitespace(l);
3173 bc_lex_assign(l, BC_LEX_OP_REL_NE, BC_LEX_OP_BOOL_NOT);
3175 if (l->t.t == BC_LEX_OP_BOOL_NOT) {
3176 s = bc_POSIX_does_not_allow_bool_ops_this_is_bad("!");
3185 s = bc_lex_string(l);
3191 s = bc_POSIX_does_not_allow("'#' script comments");
3194 bc_lex_lineComment(l);
3201 bc_lex_assign(l, BC_LEX_OP_ASSIGN_MODULUS, BC_LEX_OP_MODULUS);
3210 s = bc_POSIX_does_not_allow_bool_ops_this_is_bad("&&");
3214 l->t.t = BC_LEX_OP_BOOL_AND;
3217 l->t.t = BC_LEX_INVALID;
3218 s = bc_error_bad_character('&');
3227 l->t.t = (BcLexType)(c - '(' + BC_LEX_LPAREN);
3233 bc_lex_assign(l, BC_LEX_OP_ASSIGN_MULTIPLY, BC_LEX_OP_MULTIPLY);
3242 l->t.t = BC_LEX_OP_INC;
3245 bc_lex_assign(l, BC_LEX_OP_ASSIGN_PLUS, BC_LEX_OP_PLUS);
3251 l->t.t = BC_LEX_COMMA;
3260 l->t.t = BC_LEX_OP_DEC;
3263 bc_lex_assign(l, BC_LEX_OP_ASSIGN_MINUS, BC_LEX_OP_MINUS);
3269 if (isdigit(l->buf[l->i]))
3270 s = bc_lex_number(l, c);
3272 l->t.t = BC_LEX_KEY_LAST;
3273 s = bc_POSIX_does_not_allow("a period ('.') as a shortcut for the last result");
3282 s = bc_lex_comment(l);
3284 bc_lex_assign(l, BC_LEX_OP_ASSIGN_DIVIDE, BC_LEX_OP_DIVIDE);
3305 s = bc_lex_number(l, c);
3311 l->t.t = BC_LEX_SCOLON;
3317 bc_lex_assign(l, BC_LEX_OP_REL_LE, BC_LEX_OP_REL_LT);
3323 bc_lex_assign(l, BC_LEX_OP_REL_EQ, BC_LEX_OP_ASSIGN);
3329 bc_lex_assign(l, BC_LEX_OP_REL_GE, BC_LEX_OP_REL_GT);
3336 l->t.t = (BcLexType)(c - '[' + BC_LEX_LBRACKET);
3342 if (l->buf[l->i] == '\n') {
3343 l->t.t = BC_LEX_WHITESPACE;
3347 s = bc_error_bad_character(c);
3353 bc_lex_assign(l, BC_LEX_OP_ASSIGN_POWER, BC_LEX_OP_POWER);
3384 s = bc_lex_identifier(l);
3391 l->t.t = (BcLexType)(c - '{' + BC_LEX_LBRACE);
3400 s = bc_POSIX_does_not_allow_bool_ops_this_is_bad("||");
3404 l->t.t = BC_LEX_OP_BOOL_OR;
3407 l->t.t = BC_LEX_INVALID;
3408 s = bc_error_bad_character(c);
3416 l->t.t = BC_LEX_INVALID;
3417 s = bc_error_bad_character(c);
3427 static BcStatus dc_lex_register(BcLex *l)
3429 BcStatus s = BC_STATUS_SUCCESS;
3431 if (isspace(l->buf[l->i - 1])) {
3432 bc_lex_whitespace(l);
3435 s = bc_error("extended register");
3440 bc_vec_pop_all(&l->t.v);
3441 bc_vec_push(&l->t.v, &l->buf[l->i - 1]);
3442 bc_vec_pushZeroByte(&l->t.v);
3443 l->t.t = BC_LEX_NAME;
3449 static BcStatus dc_lex_string(BcLex *l)
3451 size_t depth = 1, nls = 0, i = l->i;
3454 l->t.t = BC_LEX_STR;
3455 bc_vec_pop_all(&l->t.v);
3457 for (c = l->buf[i]; c != 0 && depth; c = l->buf[++i]) {
3459 depth += (c == '[' && (i == l->i || l->buf[i - 1] != '\\'));
3460 depth -= (c == ']' && (i == l->i || l->buf[i - 1] != '\\'));
3463 if (depth) bc_vec_push(&l->t.v, &c);
3468 return bc_error("string end could not be found");
3471 bc_vec_pushZeroByte(&l->t.v);
3472 // This check makes sense only if size_t is (much) larger than BC_MAX_STRING.
3473 if (SIZE_MAX > (BC_MAX_STRING | 0xff)) {
3474 if (i - l->i > BC_MAX_STRING)
3475 return bc_error("string too long: must be [1,"BC_MAX_STRING_STR"]");
3480 G.err_line = l->line;
3482 return BC_STATUS_SUCCESS;
3485 static BcStatus dc_lex_token(BcLex *l)
3487 BcStatus s = BC_STATUS_SUCCESS;
3488 char c = l->buf[l->i++], c2;
3491 for (i = 0; i < ARRAY_SIZE(dc_lex_regs); ++i) {
3492 if (l->t.last == dc_lex_regs[i])
3493 return dc_lex_register(l);
3496 if (c >= '%' && c <= '~' &&
3497 (l->t.t = dc_lex_tokens[(c - '%')]) != BC_LEX_INVALID)
3502 // This is the workhorse of the lexer.
3507 l->t.t = BC_LEX_EOF;
3518 l->newline = (c == '\n');
3519 bc_lex_whitespace(l);
3528 l->t.t = BC_LEX_OP_REL_NE;
3530 l->t.t = BC_LEX_OP_REL_LE;
3532 l->t.t = BC_LEX_OP_REL_GE;
3534 return bc_error_bad_character(c);
3542 bc_lex_lineComment(l);
3548 if (isdigit(l->buf[l->i]))
3549 s = bc_lex_number(l, c);
3551 s = bc_error_bad_character(c);
3572 s = bc_lex_number(l, c);
3578 s = dc_lex_string(l);
3584 l->t.t = BC_LEX_INVALID;
3585 s = bc_error_bad_character(c);
3594 static void bc_program_addFunc(char *name, size_t *idx);
3596 static void bc_parse_addFunc(BcParse *p, char *name, size_t *idx)
3598 bc_program_addFunc(name, idx);
3599 p->func = bc_vec_item(&G.prog.fns, p->fidx);
3602 #define bc_parse_push(p, i) bc_vec_pushByte(&(p)->func->code, (char) (i))
3604 static void bc_parse_pushName(BcParse *p, char *name)
3606 size_t i = 0, len = strlen(name);
3608 for (; i < len; ++i) bc_parse_push(p, name[i]);
3609 bc_parse_push(p, BC_PARSE_STREND);
3614 static void bc_parse_pushIndex(BcParse *p, size_t idx)
3616 unsigned char amt, i, nums[sizeof(size_t)];
3618 for (amt = 0; idx; ++amt) {
3619 nums[amt] = (char) idx;
3620 idx = (idx & ((unsigned long) ~(UCHAR_MAX))) >> sizeof(char) * CHAR_BIT;
3623 bc_parse_push(p, amt);
3624 for (i = 0; i < amt; ++i) bc_parse_push(p, nums[i]);
3627 static void bc_parse_number(BcParse *p, BcInst *prev, size_t *nexs)
3629 char *num = xstrdup(p->l.t.v.v);
3630 size_t idx = G.prog.consts.len;
3632 bc_vec_push(&G.prog.consts, &num);
3634 bc_parse_push(p, BC_INST_NUM);
3635 bc_parse_pushIndex(p, idx);
3638 (*prev) = BC_INST_NUM;
3641 static BcStatus bc_parse_text(BcParse *p, const char *text)
3645 p->func = bc_vec_item(&G.prog.fns, p->fidx);
3647 if (!text[0] && !BC_PARSE_CAN_EXEC(p)) {
3648 p->l.t.t = BC_LEX_INVALID;
3651 if (!BC_PARSE_CAN_EXEC(p))
3652 return bc_error("file is not executable");
3655 return bc_lex_text(&p->l, text);
3658 // Called when parsing or execution detects a failure,
3659 // resets execution structures.
3660 static void bc_program_reset(void)
3665 bc_vec_npop(&G.prog.stack, G.prog.stack.len - 1);
3666 bc_vec_pop_all(&G.prog.results);
3668 f = bc_vec_item(&G.prog.fns, 0);
3669 ip = bc_vec_top(&G.prog.stack);
3670 ip->idx = f->code.len;
3673 #define bc_parse_updateFunc(p, f) \
3674 ((p)->func = bc_vec_item(&G.prog.fns, ((p)->fidx = (f))))
3676 // Called when bc/dc_parse_parse() detects a failure,
3677 // resets parsing structures.
3678 static void bc_parse_reset(BcParse *p)
3680 if (p->fidx != BC_PROG_MAIN) {
3681 p->func->nparams = 0;
3682 bc_vec_pop_all(&p->func->code);
3683 bc_vec_pop_all(&p->func->autos);
3684 bc_vec_pop_all(&p->func->labels);
3686 bc_parse_updateFunc(p, BC_PROG_MAIN);
3690 p->l.t.t = BC_LEX_EOF;
3691 p->auto_part = (p->nbraces = 0);
3693 bc_vec_npop(&p->flags, p->flags.len - 1);
3694 bc_vec_pop_all(&p->exits);
3695 bc_vec_pop_all(&p->conds);
3696 bc_vec_pop_all(&p->ops);
3701 static void bc_parse_free(BcParse *p)
3703 bc_vec_free(&p->flags);
3704 bc_vec_free(&p->exits);
3705 bc_vec_free(&p->conds);
3706 bc_vec_free(&p->ops);
3710 static void bc_parse_create(BcParse *p, size_t func,
3711 BcParseParse parse, BcLexNext next)
3713 memset(p, 0, sizeof(BcParse));
3715 bc_lex_init(&p->l, next);
3716 bc_vec_init(&p->flags, sizeof(uint8_t), NULL);
3717 bc_vec_init(&p->exits, sizeof(BcInstPtr), NULL);
3718 bc_vec_init(&p->conds, sizeof(size_t), NULL);
3719 bc_vec_pushZeroByte(&p->flags);
3720 bc_vec_init(&p->ops, sizeof(BcLexType), NULL);
3723 // p->auto_part = p->nbraces = 0; - already is
3724 bc_parse_updateFunc(p, func);
3729 #define BC_PARSE_TOP_OP(p) (*((BcLexType *) bc_vec_top(&(p)->ops)))
3730 #define BC_PARSE_LEAF(p, rparen) \
3731 (((p) >= BC_INST_NUM && (p) <= BC_INST_SQRT) || (rparen) || \
3732 (p) == BC_INST_INC_POST || (p) == BC_INST_DEC_POST)
3734 // We can calculate the conversion between tokens and exprs by subtracting the
3735 // position of the first operator in the lex enum and adding the position of the
3736 // first in the expr enum. Note: This only works for binary operators.
3737 #define BC_PARSE_TOKEN_INST(t) ((char) ((t) -BC_LEX_NEG + BC_INST_NEG))
3739 static BcStatus bc_parse_else(BcParse *p);
3740 static BcStatus bc_parse_stmt(BcParse *p);
3741 static BcStatus bc_parse_expr(BcParse *p, uint8_t flags, BcParseNext next);
3742 static BcStatus bc_parse_expr_empty_ok(BcParse *p, uint8_t flags, BcParseNext next);
3744 static BcStatus bc_parse_operator(BcParse *p, BcLexType type, size_t start,
3745 size_t *nexprs, bool next)
3747 BcStatus s = BC_STATUS_SUCCESS;
3749 char l, r = bc_parse_op_PREC(type - BC_LEX_OP_INC);
3750 bool left = bc_parse_op_LEFT(type - BC_LEX_OP_INC);
3752 while (p->ops.len > start) {
3754 t = BC_PARSE_TOP_OP(p);
3755 if (t == BC_LEX_LPAREN) break;
3757 l = bc_parse_op_PREC(t - BC_LEX_OP_INC);
3758 if (l >= r && (l != r || !left)) break;
3760 bc_parse_push(p, BC_PARSE_TOKEN_INST(t));
3761 bc_vec_pop(&p->ops);
3762 *nexprs -= t != BC_LEX_OP_BOOL_NOT && t != BC_LEX_NEG;
3765 bc_vec_push(&p->ops, &type);
3766 if (next) s = bc_lex_next(&p->l);
3771 static BcStatus bc_parse_rightParen(BcParse *p, size_t ops_bgn, size_t *nexs)
3775 if (p->ops.len <= ops_bgn)
3776 return bc_error_bad_expression();
3777 top = BC_PARSE_TOP_OP(p);
3779 while (top != BC_LEX_LPAREN) {
3781 bc_parse_push(p, BC_PARSE_TOKEN_INST(top));
3783 bc_vec_pop(&p->ops);
3784 *nexs -= top != BC_LEX_OP_BOOL_NOT && top != BC_LEX_NEG;
3786 if (p->ops.len <= ops_bgn)
3787 return bc_error_bad_expression();
3788 top = BC_PARSE_TOP_OP(p);
3791 bc_vec_pop(&p->ops);
3793 return bc_lex_next(&p->l);
3796 static BcStatus bc_parse_params(BcParse *p, uint8_t flags)
3802 s = bc_lex_next(&p->l);
3805 for (nparams = 0; p->l.t.t != BC_LEX_RPAREN; ++nparams) {
3807 flags = (flags & ~(BC_PARSE_PRINT | BC_PARSE_REL)) | BC_PARSE_ARRAY;
3808 s = bc_parse_expr(p, flags, bc_parse_next_param);
3811 comma = p->l.t.t == BC_LEX_COMMA;
3813 s = bc_lex_next(&p->l);
3818 if (comma) return bc_error_bad_token();
3819 bc_parse_push(p, BC_INST_CALL);
3820 bc_parse_pushIndex(p, nparams);
3822 return BC_STATUS_SUCCESS;
3825 static BcStatus bc_parse_call(BcParse *p, char *name, uint8_t flags)
3828 BcId entry, *entry_ptr;
3833 s = bc_parse_params(p, flags);
3836 if (p->l.t.t != BC_LEX_RPAREN) {
3837 s = bc_error_bad_token();
3841 idx = bc_map_index(&G.prog.fn_map, &entry);
3843 if (idx == BC_VEC_INVALID_IDX) {
3844 name = xstrdup(entry.name);
3845 bc_parse_addFunc(p, name, &idx);
3846 idx = bc_map_index(&G.prog.fn_map, &entry);
3852 entry_ptr = bc_vec_item(&G.prog.fn_map, idx);
3853 bc_parse_pushIndex(p, entry_ptr->idx);
3855 return bc_lex_next(&p->l);
3862 static BcStatus bc_parse_name(BcParse *p, BcInst *type, uint8_t flags)
3867 name = xstrdup(p->l.t.v.v);
3868 s = bc_lex_next(&p->l);
3871 if (p->l.t.t == BC_LEX_LBRACKET) {
3873 s = bc_lex_next(&p->l);
3876 if (p->l.t.t == BC_LEX_RBRACKET) {
3878 if (!(flags & BC_PARSE_ARRAY)) {
3879 s = bc_error_bad_expression();
3883 *type = BC_INST_ARRAY;
3887 *type = BC_INST_ARRAY_ELEM;
3889 flags &= ~(BC_PARSE_PRINT | BC_PARSE_REL);
3890 s = bc_parse_expr(p, flags, bc_parse_next_elem);
3894 s = bc_lex_next(&p->l);
3896 bc_parse_push(p, *type);
3897 bc_parse_pushName(p, name);
3899 else if (p->l.t.t == BC_LEX_LPAREN) {
3901 if (flags & BC_PARSE_NOCALL) {
3902 s = bc_error_bad_token();
3906 *type = BC_INST_CALL;
3907 s = bc_parse_call(p, name, flags);
3910 *type = BC_INST_VAR;
3911 bc_parse_push(p, BC_INST_VAR);
3912 bc_parse_pushName(p, name);
3922 static BcStatus bc_parse_read(BcParse *p)
3926 s = bc_lex_next(&p->l);
3928 if (p->l.t.t != BC_LEX_LPAREN) return bc_error_bad_token();
3930 s = bc_lex_next(&p->l);
3932 if (p->l.t.t != BC_LEX_RPAREN) return bc_error_bad_token();
3934 bc_parse_push(p, BC_INST_READ);
3936 return bc_lex_next(&p->l);
3939 static BcStatus bc_parse_builtin(BcParse *p, BcLexType type, uint8_t flags,
3944 s = bc_lex_next(&p->l);
3946 if (p->l.t.t != BC_LEX_LPAREN) return bc_error_bad_token();
3948 flags = (flags & ~(BC_PARSE_PRINT | BC_PARSE_REL)) | BC_PARSE_ARRAY;
3950 s = bc_lex_next(&p->l);
3953 s = bc_parse_expr(p, flags, bc_parse_next_rel);
3956 if (p->l.t.t != BC_LEX_RPAREN) return bc_error_bad_token();
3958 *prev = (type == BC_LEX_KEY_LENGTH) ? BC_INST_LENGTH : BC_INST_SQRT;
3959 bc_parse_push(p, *prev);
3961 return bc_lex_next(&p->l);
3964 static BcStatus bc_parse_scale(BcParse *p, BcInst *type, uint8_t flags)
3968 s = bc_lex_next(&p->l);
3971 if (p->l.t.t != BC_LEX_LPAREN) {
3972 *type = BC_INST_SCALE;
3973 bc_parse_push(p, BC_INST_SCALE);
3974 return BC_STATUS_SUCCESS;
3977 *type = BC_INST_SCALE_FUNC;
3978 flags &= ~(BC_PARSE_PRINT | BC_PARSE_REL);
3980 s = bc_lex_next(&p->l);
3983 s = bc_parse_expr(p, flags, bc_parse_next_rel);
3985 if (p->l.t.t != BC_LEX_RPAREN) return bc_error_bad_token();
3986 bc_parse_push(p, BC_INST_SCALE_FUNC);
3988 return bc_lex_next(&p->l);
3991 static BcStatus bc_parse_incdec(BcParse *p, BcInst *prev, bool *paren_expr,
3992 size_t *nexprs, uint8_t flags)
3997 BcInst etype = *prev;
3999 if (etype == BC_INST_VAR || etype == BC_INST_ARRAY_ELEM ||
4000 etype == BC_INST_SCALE || etype == BC_INST_LAST ||
4001 etype == BC_INST_IBASE || etype == BC_INST_OBASE)
4003 *prev = inst = BC_INST_INC_POST + (p->l.t.t != BC_LEX_OP_INC);
4004 bc_parse_push(p, inst);
4005 s = bc_lex_next(&p->l);
4009 *prev = inst = BC_INST_INC_PRE + (p->l.t.t != BC_LEX_OP_INC);
4012 s = bc_lex_next(&p->l);
4016 // Because we parse the next part of the expression
4017 // right here, we need to increment this.
4018 *nexprs = *nexprs + 1;
4024 s = bc_parse_name(p, prev, flags | BC_PARSE_NOCALL);
4028 case BC_LEX_KEY_IBASE:
4029 case BC_LEX_KEY_LAST:
4030 case BC_LEX_KEY_OBASE:
4032 bc_parse_push(p, type - BC_LEX_KEY_IBASE + BC_INST_IBASE);
4033 s = bc_lex_next(&p->l);
4037 case BC_LEX_KEY_SCALE:
4039 s = bc_lex_next(&p->l);
4041 if (p->l.t.t == BC_LEX_LPAREN)
4042 s = bc_error_bad_token();
4044 bc_parse_push(p, BC_INST_SCALE);
4050 s = bc_error_bad_token();
4055 if (!s) bc_parse_push(p, inst);
4061 static BcStatus bc_parse_minus(BcParse *p, BcInst *prev, size_t ops_bgn,
4062 bool rparen, size_t *nexprs)
4066 BcInst etype = *prev;
4068 s = bc_lex_next(&p->l);
4071 type = rparen || etype == BC_INST_INC_POST || etype == BC_INST_DEC_POST ||
4072 (etype >= BC_INST_NUM && etype <= BC_INST_SQRT) ?
4075 *prev = BC_PARSE_TOKEN_INST(type);
4077 // We can just push onto the op stack because this is the largest
4078 // precedence operator that gets pushed. Inc/dec does not.
4079 if (type != BC_LEX_OP_MINUS)
4080 bc_vec_push(&p->ops, &type);
4082 s = bc_parse_operator(p, type, ops_bgn, nexprs, false);
4087 static BcStatus bc_parse_string(BcParse *p, char inst)
4089 char *str = xstrdup(p->l.t.v.v);
4091 bc_parse_push(p, BC_INST_STR);
4092 bc_parse_pushIndex(p, G.prog.strs.len);
4093 bc_vec_push(&G.prog.strs, &str);
4094 bc_parse_push(p, inst);
4096 return bc_lex_next(&p->l);
4099 static BcStatus bc_parse_print(BcParse *p)
4105 s = bc_lex_next(&p->l);
4110 if (type == BC_LEX_SCOLON || type == BC_LEX_NLINE)
4111 return bc_error("bad print statement");
4113 while (!s && type != BC_LEX_SCOLON && type != BC_LEX_NLINE) {
4115 if (type == BC_LEX_STR)
4116 s = bc_parse_string(p, BC_INST_PRINT_POP);
4118 s = bc_parse_expr(p, 0, bc_parse_next_print);
4120 bc_parse_push(p, BC_INST_PRINT_POP);
4125 comma = p->l.t.t == BC_LEX_COMMA;
4126 if (comma) s = bc_lex_next(&p->l);
4131 if (comma) return bc_error_bad_token();
4133 return bc_lex_next(&p->l);
4136 static BcStatus bc_parse_return(BcParse *p)
4142 if (!BC_PARSE_FUNC(p)) return bc_error_bad_token();
4144 s = bc_lex_next(&p->l);
4148 paren = t == BC_LEX_LPAREN;
4150 if (t == BC_LEX_NLINE || t == BC_LEX_SCOLON)
4151 bc_parse_push(p, BC_INST_RET0);
4154 s = bc_parse_expr_empty_ok(p, 0, bc_parse_next_expr);
4155 if (s == BC_STATUS_PARSE_EMPTY_EXP) {
4156 bc_parse_push(p, BC_INST_RET0);
4157 s = bc_lex_next(&p->l);
4161 if (!paren || p->l.t.last != BC_LEX_RPAREN) {
4162 s = bc_POSIX_requires("parentheses around return expressions");
4166 bc_parse_push(p, BC_INST_RET);
4172 static BcStatus bc_parse_endBody(BcParse *p, bool brace)
4174 BcStatus s = BC_STATUS_SUCCESS;
4176 if (p->flags.len <= 1 || (brace && p->nbraces == 0))
4177 return bc_error_bad_token();
4181 if (p->l.t.t == BC_LEX_RBRACE) {
4182 if (!p->nbraces) return bc_error_bad_token();
4184 s = bc_lex_next(&p->l);
4188 return bc_error_bad_token();
4191 if (BC_PARSE_IF(p)) {
4195 while (p->l.t.t == BC_LEX_NLINE) {
4196 s = bc_lex_next(&p->l);
4200 bc_vec_pop(&p->flags);
4202 flag_ptr = BC_PARSE_TOP_FLAG_PTR(p);
4203 *flag_ptr = (*flag_ptr | BC_PARSE_FLAG_IF_END);
4205 if (p->l.t.t == BC_LEX_KEY_ELSE) s = bc_parse_else(p);
4207 else if (BC_PARSE_ELSE(p)) {
4212 bc_vec_pop(&p->flags);
4214 ip = bc_vec_top(&p->exits);
4215 label = bc_vec_item(&p->func->labels, ip->idx);
4216 *label = p->func->code.len;
4218 bc_vec_pop(&p->exits);
4220 else if (BC_PARSE_FUNC_INNER(p)) {
4221 bc_parse_push(p, BC_INST_RET0);
4222 bc_parse_updateFunc(p, BC_PROG_MAIN);
4223 bc_vec_pop(&p->flags);
4227 BcInstPtr *ip = bc_vec_top(&p->exits);
4228 size_t *label = bc_vec_top(&p->conds);
4230 bc_parse_push(p, BC_INST_JUMP);
4231 bc_parse_pushIndex(p, *label);
4233 label = bc_vec_item(&p->func->labels, ip->idx);
4234 *label = p->func->code.len;
4236 bc_vec_pop(&p->flags);
4237 bc_vec_pop(&p->exits);
4238 bc_vec_pop(&p->conds);
4244 static void bc_parse_startBody(BcParse *p, uint8_t flags)
4246 uint8_t *flag_ptr = BC_PARSE_TOP_FLAG_PTR(p);
4247 flags |= (*flag_ptr & (BC_PARSE_FLAG_FUNC | BC_PARSE_FLAG_LOOP));
4248 flags |= BC_PARSE_FLAG_BODY;
4249 bc_vec_push(&p->flags, &flags);
4252 static void bc_parse_noElse(BcParse *p)
4256 uint8_t *flag_ptr = BC_PARSE_TOP_FLAG_PTR(p);
4258 *flag_ptr = (*flag_ptr & ~(BC_PARSE_FLAG_IF_END));
4260 ip = bc_vec_top(&p->exits);
4261 label = bc_vec_item(&p->func->labels, ip->idx);
4262 *label = p->func->code.len;
4264 bc_vec_pop(&p->exits);
4267 static BcStatus bc_parse_if(BcParse *p)
4272 s = bc_lex_next(&p->l);
4274 if (p->l.t.t != BC_LEX_LPAREN) return bc_error_bad_token();
4276 s = bc_lex_next(&p->l);
4278 s = bc_parse_expr(p, BC_PARSE_REL, bc_parse_next_rel);
4280 if (p->l.t.t != BC_LEX_RPAREN) return bc_error_bad_token();
4282 s = bc_lex_next(&p->l);
4284 bc_parse_push(p, BC_INST_JUMP_ZERO);
4286 ip.idx = p->func->labels.len;
4287 ip.func = ip.len = 0;
4289 bc_parse_pushIndex(p, ip.idx);
4290 bc_vec_push(&p->exits, &ip);
4291 bc_vec_push(&p->func->labels, &ip.idx);
4292 bc_parse_startBody(p, BC_PARSE_FLAG_IF);
4294 return BC_STATUS_SUCCESS;
4297 static BcStatus bc_parse_else(BcParse *p)
4301 if (!BC_PARSE_IF_END(p)) return bc_error_bad_token();
4303 ip.idx = p->func->labels.len;
4304 ip.func = ip.len = 0;
4306 bc_parse_push(p, BC_INST_JUMP);
4307 bc_parse_pushIndex(p, ip.idx);
4311 bc_vec_push(&p->exits, &ip);
4312 bc_vec_push(&p->func->labels, &ip.idx);
4313 bc_parse_startBody(p, BC_PARSE_FLAG_ELSE);
4315 return bc_lex_next(&p->l);
4318 static BcStatus bc_parse_while(BcParse *p)
4323 s = bc_lex_next(&p->l);
4325 if (p->l.t.t != BC_LEX_LPAREN) return bc_error_bad_token();
4326 s = bc_lex_next(&p->l);
4329 ip.idx = p->func->labels.len;
4331 bc_vec_push(&p->func->labels, &p->func->code.len);
4332 bc_vec_push(&p->conds, &ip.idx);
4334 ip.idx = p->func->labels.len;
4338 bc_vec_push(&p->exits, &ip);
4339 bc_vec_push(&p->func->labels, &ip.idx);
4341 s = bc_parse_expr(p, BC_PARSE_REL, bc_parse_next_rel);
4343 if (p->l.t.t != BC_LEX_RPAREN) return bc_error_bad_token();
4344 s = bc_lex_next(&p->l);
4347 bc_parse_push(p, BC_INST_JUMP_ZERO);
4348 bc_parse_pushIndex(p, ip.idx);
4349 bc_parse_startBody(p, BC_PARSE_FLAG_LOOP | BC_PARSE_FLAG_LOOP_INNER);
4351 return BC_STATUS_SUCCESS;
4354 static BcStatus bc_parse_for(BcParse *p)
4358 size_t cond_idx, exit_idx, body_idx, update_idx;
4360 s = bc_lex_next(&p->l);
4362 if (p->l.t.t != BC_LEX_LPAREN) return bc_error_bad_token();
4363 s = bc_lex_next(&p->l);
4366 if (p->l.t.t != BC_LEX_SCOLON)
4367 s = bc_parse_expr(p, 0, bc_parse_next_for);
4369 s = bc_POSIX_does_not_allow_empty_X_expression_in_for("init");
4372 if (p->l.t.t != BC_LEX_SCOLON) return bc_error_bad_token();
4373 s = bc_lex_next(&p->l);
4376 cond_idx = p->func->labels.len;
4377 update_idx = cond_idx + 1;
4378 body_idx = update_idx + 1;
4379 exit_idx = body_idx + 1;
4381 bc_vec_push(&p->func->labels, &p->func->code.len);
4383 if (p->l.t.t != BC_LEX_SCOLON)
4384 s = bc_parse_expr(p, BC_PARSE_REL, bc_parse_next_for);
4386 s = bc_POSIX_does_not_allow_empty_X_expression_in_for("condition");
4389 if (p->l.t.t != BC_LEX_SCOLON) return bc_error_bad_token();
4391 s = bc_lex_next(&p->l);
4394 bc_parse_push(p, BC_INST_JUMP_ZERO);
4395 bc_parse_pushIndex(p, exit_idx);
4396 bc_parse_push(p, BC_INST_JUMP);
4397 bc_parse_pushIndex(p, body_idx);
4399 ip.idx = p->func->labels.len;
4401 bc_vec_push(&p->conds, &update_idx);
4402 bc_vec_push(&p->func->labels, &p->func->code.len);
4404 if (p->l.t.t != BC_LEX_RPAREN)
4405 s = bc_parse_expr(p, 0, bc_parse_next_rel);
4407 s = bc_POSIX_does_not_allow_empty_X_expression_in_for("update");
4411 if (p->l.t.t != BC_LEX_RPAREN) return bc_error_bad_token();
4412 bc_parse_push(p, BC_INST_JUMP);
4413 bc_parse_pushIndex(p, cond_idx);
4414 bc_vec_push(&p->func->labels, &p->func->code.len);
4420 bc_vec_push(&p->exits, &ip);
4421 bc_vec_push(&p->func->labels, &ip.idx);
4423 bc_parse_startBody(p, BC_PARSE_FLAG_LOOP | BC_PARSE_FLAG_LOOP_INNER);
4425 return BC_STATUS_SUCCESS;
4428 static BcStatus bc_parse_loopExit(BcParse *p, BcLexType type)
4434 if (!BC_PARSE_LOOP(p)) return bc_error_bad_token();
4436 if (type == BC_LEX_KEY_BREAK) {
4438 if (p->exits.len == 0) return bc_error_bad_token();
4440 i = p->exits.len - 1;
4441 ip = bc_vec_item(&p->exits, i);
4443 while (!ip->func && i < p->exits.len) ip = bc_vec_item(&p->exits, i--);
4444 if (i >= p->exits.len && !ip->func) return bc_error_bad_token();
4449 i = *((size_t *) bc_vec_top(&p->conds));
4451 bc_parse_push(p, BC_INST_JUMP);
4452 bc_parse_pushIndex(p, i);
4454 s = bc_lex_next(&p->l);
4457 if (p->l.t.t != BC_LEX_SCOLON && p->l.t.t != BC_LEX_NLINE)
4458 return bc_error_bad_token();
4460 return bc_lex_next(&p->l);
4463 static BcStatus bc_parse_func(BcParse *p)
4466 bool var, comma = false;
4470 s = bc_lex_next(&p->l);
4472 if (p->l.t.t != BC_LEX_NAME)
4473 return bc_error("bad function definition");
4475 name = xstrdup(p->l.t.v.v);
4476 bc_parse_addFunc(p, name, &p->fidx);
4478 s = bc_lex_next(&p->l);
4480 if (p->l.t.t != BC_LEX_LPAREN)
4481 return bc_error("bad function definition");
4482 s = bc_lex_next(&p->l);
4485 while (p->l.t.t != BC_LEX_RPAREN) {
4487 if (p->l.t.t != BC_LEX_NAME)
4488 return bc_error("bad function definition");
4492 name = xstrdup(p->l.t.v.v);
4493 s = bc_lex_next(&p->l);
4496 var = p->l.t.t != BC_LEX_LBRACKET;
4500 s = bc_lex_next(&p->l);
4503 if (p->l.t.t != BC_LEX_RBRACKET) {
4504 s = bc_error("bad function definition");
4508 s = bc_lex_next(&p->l);
4512 comma = p->l.t.t == BC_LEX_COMMA;
4514 s = bc_lex_next(&p->l);
4518 s = bc_func_insert(p->func, name, var);
4522 if (comma) return bc_error("bad function definition");
4524 flags = BC_PARSE_FLAG_FUNC | BC_PARSE_FLAG_FUNC_INNER | BC_PARSE_FLAG_BODY;
4525 bc_parse_startBody(p, flags);
4527 s = bc_lex_next(&p->l);
4530 if (p->l.t.t != BC_LEX_LBRACE)
4531 s = bc_POSIX_requires("the left brace be on the same line as the function header");
4540 static BcStatus bc_parse_auto(BcParse *p)
4543 bool comma, var, one;
4546 if (!p->auto_part) return bc_error_bad_token();
4547 s = bc_lex_next(&p->l);
4550 p->auto_part = comma = false;
4551 one = p->l.t.t == BC_LEX_NAME;
4553 while (p->l.t.t == BC_LEX_NAME) {
4555 name = xstrdup(p->l.t.v.v);
4556 s = bc_lex_next(&p->l);
4559 var = p->l.t.t != BC_LEX_LBRACKET;
4562 s = bc_lex_next(&p->l);
4565 if (p->l.t.t != BC_LEX_RBRACKET) {
4566 s = bc_error("bad function definition");
4570 s = bc_lex_next(&p->l);
4574 comma = p->l.t.t == BC_LEX_COMMA;
4576 s = bc_lex_next(&p->l);
4580 s = bc_func_insert(p->func, name, var);
4584 if (comma) return bc_error("bad function definition");
4585 if (!one) return bc_error("no auto variable found");
4587 if (p->l.t.t != BC_LEX_NLINE && p->l.t.t != BC_LEX_SCOLON)
4588 return bc_error_bad_token();
4590 return bc_lex_next(&p->l);
4597 static BcStatus bc_parse_body(BcParse *p, bool brace)
4599 BcStatus s = BC_STATUS_SUCCESS;
4600 uint8_t *flag_ptr = bc_vec_top(&p->flags);
4602 *flag_ptr &= ~(BC_PARSE_FLAG_BODY);
4604 if (*flag_ptr & BC_PARSE_FLAG_FUNC_INNER) {
4606 if (!brace) return bc_error_bad_token();
4607 p->auto_part = p->l.t.t != BC_LEX_KEY_AUTO;
4609 if (!p->auto_part) {
4610 s = bc_parse_auto(p);
4614 if (p->l.t.t == BC_LEX_NLINE) s = bc_lex_next(&p->l);
4617 s = bc_parse_stmt(p);
4618 if (!s && !brace) s = bc_parse_endBody(p, false);
4624 static BcStatus bc_parse_stmt(BcParse *p)
4626 BcStatus s = BC_STATUS_SUCCESS;
4632 return bc_lex_next(&p->l);
4635 case BC_LEX_KEY_ELSE:
4637 p->auto_part = false;
4643 if (!BC_PARSE_BODY(p)) return bc_error_bad_token();
4646 s = bc_lex_next(&p->l);
4649 return bc_parse_body(p, true);
4652 case BC_LEX_KEY_AUTO:
4654 return bc_parse_auto(p);
4659 p->auto_part = false;
4661 if (BC_PARSE_IF_END(p)) {
4663 return BC_STATUS_SUCCESS;
4665 else if (BC_PARSE_BODY(p))
4666 return bc_parse_body(p, false);
4676 case BC_LEX_OP_MINUS:
4677 case BC_LEX_OP_BOOL_NOT:
4681 case BC_LEX_KEY_IBASE:
4682 case BC_LEX_KEY_LAST:
4683 case BC_LEX_KEY_LENGTH:
4684 case BC_LEX_KEY_OBASE:
4685 case BC_LEX_KEY_READ:
4686 case BC_LEX_KEY_SCALE:
4687 case BC_LEX_KEY_SQRT:
4689 s = bc_parse_expr(p, BC_PARSE_PRINT, bc_parse_next_expr);
4693 case BC_LEX_KEY_ELSE:
4695 s = bc_parse_else(p);
4701 while (!s && p->l.t.t == BC_LEX_SCOLON) s = bc_lex_next(&p->l);
4707 s = bc_parse_endBody(p, true);
4713 s = bc_parse_string(p, BC_INST_PRINT_STR);
4717 case BC_LEX_KEY_BREAK:
4718 case BC_LEX_KEY_CONTINUE:
4720 s = bc_parse_loopExit(p, p->l.t.t);
4724 case BC_LEX_KEY_FOR:
4726 s = bc_parse_for(p);
4730 case BC_LEX_KEY_HALT:
4732 bc_parse_push(p, BC_INST_HALT);
4733 s = bc_lex_next(&p->l);
4743 case BC_LEX_KEY_LIMITS:
4745 // "limits" is a compile-time command,
4746 // the output is produced at _parse time_.
4747 s = bc_lex_next(&p->l);
4750 "BC_BASE_MAX = "BC_MAX_OBASE_STR "\n"
4751 "BC_DIM_MAX = "BC_MAX_DIM_STR "\n"
4752 "BC_SCALE_MAX = "BC_MAX_SCALE_STR "\n"
4753 "BC_STRING_MAX = "BC_MAX_STRING_STR"\n"
4754 "BC_NAME_MAX = "BC_MAX_NAME_STR "\n"
4755 "BC_NUM_MAX = "BC_MAX_NUM_STR "\n"
4756 "MAX Exponent = "BC_MAX_EXP_STR "\n"
4757 "Number of vars = "BC_MAX_VARS_STR "\n"
4762 case BC_LEX_KEY_PRINT:
4764 s = bc_parse_print(p);
4768 case BC_LEX_KEY_QUIT:
4770 // "quit" is a compile-time command. For example,
4771 // "if (0 == 1) quit" terminates when parsing the statement,
4772 // not when it is executed
4773 QUIT_OR_RETURN_TO_MAIN;
4776 case BC_LEX_KEY_RETURN:
4778 s = bc_parse_return(p);
4782 case BC_LEX_KEY_WHILE:
4784 s = bc_parse_while(p);
4790 s = bc_error_bad_token();
4798 static BcStatus bc_parse_parse(BcParse *p)
4802 if (p->l.t.t == BC_LEX_EOF)
4803 s = p->flags.len > 0 ? bc_error("block end could not be found") : bc_error("end of file");
4804 else if (p->l.t.t == BC_LEX_KEY_DEFINE) {
4805 if (!BC_PARSE_CAN_EXEC(p)) return bc_error_bad_token();
4806 s = bc_parse_func(p);
4809 s = bc_parse_stmt(p);
4811 if (s || G_interrupt) {
4813 s = BC_STATUS_FAILURE;
4819 static BcStatus bc_parse_expr_empty_ok(BcParse *p, uint8_t flags, BcParseNext next)
4821 BcStatus s = BC_STATUS_SUCCESS;
4822 BcInst prev = BC_INST_PRINT;
4823 BcLexType top, t = p->l.t.t;
4824 size_t nexprs = 0, ops_bgn = p->ops.len;
4825 unsigned nparens, nrelops;
4826 bool paren_first, paren_expr, rprn, done, get_token, assign, bin_last;
4828 paren_first = p->l.t.t == BC_LEX_LPAREN;
4829 nparens = nrelops = 0;
4830 paren_expr = rprn = done = get_token = assign = false;
4833 for (; !G_interrupt && !s && !done && bc_parse_exprs(t); t = p->l.t.t) {
4839 s = bc_parse_incdec(p, &prev, &paren_expr, &nexprs, flags);
4840 rprn = get_token = bin_last = false;
4844 case BC_LEX_OP_MINUS:
4846 s = bc_parse_minus(p, &prev, ops_bgn, rprn, &nexprs);
4847 rprn = get_token = false;
4848 bin_last = prev == BC_INST_MINUS;
4852 case BC_LEX_OP_ASSIGN_POWER:
4853 case BC_LEX_OP_ASSIGN_MULTIPLY:
4854 case BC_LEX_OP_ASSIGN_DIVIDE:
4855 case BC_LEX_OP_ASSIGN_MODULUS:
4856 case BC_LEX_OP_ASSIGN_PLUS:
4857 case BC_LEX_OP_ASSIGN_MINUS:
4858 case BC_LEX_OP_ASSIGN:
4860 if (prev != BC_INST_VAR && prev != BC_INST_ARRAY_ELEM &&
4861 prev != BC_INST_SCALE && prev != BC_INST_IBASE &&
4862 prev != BC_INST_OBASE && prev != BC_INST_LAST)
4864 s = bc_error("bad assignment:"
4865 " left side must be scale,"
4866 " ibase, obase, last, var,"
4873 case BC_LEX_OP_POWER:
4874 case BC_LEX_OP_MULTIPLY:
4875 case BC_LEX_OP_DIVIDE:
4876 case BC_LEX_OP_MODULUS:
4877 case BC_LEX_OP_PLUS:
4878 case BC_LEX_OP_REL_EQ:
4879 case BC_LEX_OP_REL_LE:
4880 case BC_LEX_OP_REL_GE:
4881 case BC_LEX_OP_REL_NE:
4882 case BC_LEX_OP_REL_LT:
4883 case BC_LEX_OP_REL_GT:
4884 case BC_LEX_OP_BOOL_NOT:
4885 case BC_LEX_OP_BOOL_OR:
4886 case BC_LEX_OP_BOOL_AND:
4888 if (((t == BC_LEX_OP_BOOL_NOT) != bin_last)
4889 || (t != BC_LEX_OP_BOOL_NOT && prev == BC_INST_BOOL_NOT)
4891 return bc_error_bad_expression();
4894 nrelops += t >= BC_LEX_OP_REL_EQ && t <= BC_LEX_OP_REL_GT;
4895 prev = BC_PARSE_TOKEN_INST(t);
4896 s = bc_parse_operator(p, t, ops_bgn, &nexprs, true);
4897 rprn = get_token = false;
4898 bin_last = t != BC_LEX_OP_BOOL_NOT;
4905 if (BC_PARSE_LEAF(prev, rprn))
4906 return bc_error_bad_expression();
4908 paren_expr = rprn = bin_last = false;
4910 bc_vec_push(&p->ops, &t);
4917 if (bin_last || prev == BC_INST_BOOL_NOT)
4918 return bc_error_bad_expression();
4921 s = BC_STATUS_SUCCESS;
4926 else if (!paren_expr)
4927 return BC_STATUS_PARSE_EMPTY_EXP;
4930 paren_expr = rprn = true;
4931 get_token = bin_last = false;
4933 s = bc_parse_rightParen(p, ops_bgn, &nexprs);
4940 if (BC_PARSE_LEAF(prev, rprn))
4941 return bc_error_bad_expression();
4943 rprn = get_token = bin_last = false;
4944 s = bc_parse_name(p, &prev, flags & ~BC_PARSE_NOCALL);
4952 if (BC_PARSE_LEAF(prev, rprn))
4953 return bc_error_bad_expression();
4954 bc_parse_number(p, &prev, &nexprs);
4955 paren_expr = get_token = true;
4956 rprn = bin_last = false;
4961 case BC_LEX_KEY_IBASE:
4962 case BC_LEX_KEY_LAST:
4963 case BC_LEX_KEY_OBASE:
4965 if (BC_PARSE_LEAF(prev, rprn))
4966 return bc_error_bad_expression();
4967 prev = (char) (t - BC_LEX_KEY_IBASE + BC_INST_IBASE);
4968 bc_parse_push(p, (char) prev);
4970 paren_expr = get_token = true;
4971 rprn = bin_last = false;
4977 case BC_LEX_KEY_LENGTH:
4978 case BC_LEX_KEY_SQRT:
4980 if (BC_PARSE_LEAF(prev, rprn))
4981 return bc_error_bad_expression();
4982 s = bc_parse_builtin(p, t, flags, &prev);
4984 rprn = get_token = bin_last = false;
4990 case BC_LEX_KEY_READ:
4992 if (BC_PARSE_LEAF(prev, rprn))
4993 return bc_error_bad_expression();
4994 else if (flags & BC_PARSE_NOREAD)
4995 s = bc_error_nested_read_call();
4997 s = bc_parse_read(p);
5000 rprn = get_token = bin_last = false;
5002 prev = BC_INST_READ;
5007 case BC_LEX_KEY_SCALE:
5009 if (BC_PARSE_LEAF(prev, rprn))
5010 return bc_error_bad_expression();
5011 s = bc_parse_scale(p, &prev, flags);
5013 rprn = get_token = bin_last = false;
5015 prev = BC_INST_SCALE;
5022 s = bc_error_bad_token();
5027 if (!s && get_token) s = bc_lex_next(&p->l);
5031 if (G_interrupt) return BC_STATUS_FAILURE; // ^C: stop parsing
5033 while (p->ops.len > ops_bgn) {
5035 top = BC_PARSE_TOP_OP(p);
5036 assign = top >= BC_LEX_OP_ASSIGN_POWER && top <= BC_LEX_OP_ASSIGN;
5038 if (top == BC_LEX_LPAREN || top == BC_LEX_RPAREN)
5039 return bc_error_bad_expression();
5041 bc_parse_push(p, BC_PARSE_TOKEN_INST(top));
5043 nexprs -= top != BC_LEX_OP_BOOL_NOT && top != BC_LEX_NEG;
5044 bc_vec_pop(&p->ops);
5047 if (prev == BC_INST_BOOL_NOT || nexprs != 1)
5048 return bc_error_bad_expression();
5050 // next is BcParseNext, byte array of up to 4 BC_LEX's, packed into 32-bit word
5052 if (t == (next & 0x7f))
5054 if (next & 0x80) // last element?
5058 return bc_error_bad_expression();
5061 if (!(flags & BC_PARSE_REL) && nrelops) {
5062 s = bc_POSIX_does_not_allow("comparison operators outside if or loops");
5065 else if ((flags & BC_PARSE_REL) && nrelops > 1) {
5066 s = bc_POSIX_requires("exactly one comparison operator per condition");
5070 if (flags & BC_PARSE_PRINT) {
5071 if (paren_first || !assign) bc_parse_push(p, BC_INST_PRINT);
5072 bc_parse_push(p, BC_INST_POP);
5078 static BcStatus bc_parse_expr(BcParse *p, uint8_t flags, BcParseNext next)
5082 s = bc_parse_expr_empty_ok(p, flags, next);
5083 if (s == BC_STATUS_PARSE_EMPTY_EXP)
5084 return bc_error("empty expression");
5088 static void bc_parse_init(BcParse *p, size_t func)
5090 bc_parse_create(p, func, bc_parse_parse, bc_lex_token);
5093 static BcStatus bc_parse_expression(BcParse *p, uint8_t flags)
5095 return bc_parse_expr(p, flags, bc_parse_next_read);
5102 #define DC_PARSE_BUF_LEN ((int) (sizeof(uint32_t) * CHAR_BIT))
5104 static BcStatus dc_parse_register(BcParse *p)
5109 s = bc_lex_next(&p->l);
5111 if (p->l.t.t != BC_LEX_NAME) return bc_error_bad_token();
5113 name = xstrdup(p->l.t.v.v);
5114 bc_parse_pushName(p, name);
5119 static BcStatus dc_parse_string(BcParse *p)
5121 char *str, *name, b[DC_PARSE_BUF_LEN + 1];
5122 size_t idx, len = G.prog.strs.len;
5124 sprintf(b, "%0*zu", DC_PARSE_BUF_LEN, len);
5127 str = xstrdup(p->l.t.v.v);
5128 bc_parse_push(p, BC_INST_STR);
5129 bc_parse_pushIndex(p, len);
5130 bc_vec_push(&G.prog.strs, &str);
5131 bc_parse_addFunc(p, name, &idx);
5133 return bc_lex_next(&p->l);
5136 static BcStatus dc_parse_mem(BcParse *p, uint8_t inst, bool name, bool store)
5140 bc_parse_push(p, inst);
5142 s = dc_parse_register(p);
5147 bc_parse_push(p, BC_INST_SWAP);
5148 bc_parse_push(p, BC_INST_ASSIGN);
5149 bc_parse_push(p, BC_INST_POP);
5152 return bc_lex_next(&p->l);
5155 static BcStatus dc_parse_cond(BcParse *p, uint8_t inst)
5159 bc_parse_push(p, inst);
5160 bc_parse_push(p, BC_INST_EXEC_COND);
5162 s = dc_parse_register(p);
5165 s = bc_lex_next(&p->l);
5168 if (p->l.t.t == BC_LEX_ELSE) {
5169 s = dc_parse_register(p);
5171 s = bc_lex_next(&p->l);
5174 bc_parse_push(p, BC_PARSE_STREND);
5179 static BcStatus dc_parse_token(BcParse *p, BcLexType t, uint8_t flags)
5181 BcStatus s = BC_STATUS_SUCCESS;
5184 bool assign, get_token = false;
5188 case BC_LEX_OP_REL_EQ:
5189 case BC_LEX_OP_REL_LE:
5190 case BC_LEX_OP_REL_GE:
5191 case BC_LEX_OP_REL_NE:
5192 case BC_LEX_OP_REL_LT:
5193 case BC_LEX_OP_REL_GT:
5195 s = dc_parse_cond(p, t - BC_LEX_OP_REL_EQ + BC_INST_REL_EQ);
5202 s = dc_parse_mem(p, BC_INST_ARRAY_ELEM, true, t == BC_LEX_COLON);
5208 s = dc_parse_string(p);
5215 if (t == BC_LEX_NEG) {
5216 s = bc_lex_next(&p->l);
5218 if (p->l.t.t != BC_LEX_NUMBER)
5219 return bc_error_bad_token();
5222 bc_parse_number(p, &prev, &p->nbraces);
5224 if (t == BC_LEX_NEG) bc_parse_push(p, BC_INST_NEG);
5230 case BC_LEX_KEY_READ:
5232 if (flags & BC_PARSE_NOREAD)
5233 s = bc_error_nested_read_call();
5235 bc_parse_push(p, BC_INST_READ);
5240 case BC_LEX_OP_ASSIGN:
5241 case BC_LEX_STORE_PUSH:
5243 assign = t == BC_LEX_OP_ASSIGN;
5244 inst = assign ? BC_INST_VAR : BC_INST_PUSH_TO_VAR;
5245 s = dc_parse_mem(p, inst, true, assign);
5250 case BC_LEX_LOAD_POP:
5252 inst = t == BC_LEX_LOAD_POP ? BC_INST_PUSH_VAR : BC_INST_LOAD;
5253 s = dc_parse_mem(p, inst, true, false);
5257 case BC_LEX_STORE_IBASE:
5258 case BC_LEX_STORE_SCALE:
5259 case BC_LEX_STORE_OBASE:
5261 inst = t - BC_LEX_STORE_IBASE + BC_INST_IBASE;
5262 s = dc_parse_mem(p, inst, false, true);
5268 s = bc_error_bad_token();
5274 if (!s && get_token) s = bc_lex_next(&p->l);
5279 static BcStatus dc_parse_expr(BcParse *p, uint8_t flags)
5281 BcStatus s = BC_STATUS_SUCCESS;
5285 if (flags & BC_PARSE_NOCALL) p->nbraces = G.prog.results.len;
5287 for (t = p->l.t.t; !s && t != BC_LEX_EOF; t = p->l.t.t) {
5289 inst = dc_parse_insts[t];
5291 if (inst != BC_INST_INVALID) {
5292 bc_parse_push(p, inst);
5293 s = bc_lex_next(&p->l);
5296 s = dc_parse_token(p, t, flags);
5299 if (!s && p->l.t.t == BC_LEX_EOF && (flags & BC_PARSE_NOCALL))
5300 bc_parse_push(p, BC_INST_POP_EXEC);
5305 static BcStatus dc_parse_parse(BcParse *p)
5309 if (p->l.t.t == BC_LEX_EOF)
5310 s = bc_error("end of file");
5312 s = dc_parse_expr(p, 0);
5314 if (s || G_interrupt) {
5316 s = BC_STATUS_FAILURE;
5322 static void dc_parse_init(BcParse *p, size_t func)
5324 bc_parse_create(p, func, dc_parse_parse, dc_lex_token);
5329 static void common_parse_init(BcParse *p, size_t func)
5332 IF_BC(bc_parse_init(p, func);)
5334 IF_DC(dc_parse_init(p, func);)
5338 static BcStatus common_parse_expr(BcParse *p, uint8_t flags)
5341 IF_BC(return bc_parse_expression(p, flags);)
5343 IF_DC(return dc_parse_expr(p, flags);)
5347 static BcVec* bc_program_search(char *id, bool var)
5355 v = var ? &G.prog.vars : &G.prog.arrs;
5356 map = var ? &G.prog.var_map : &G.prog.arr_map;
5360 new = bc_map_insert(map, &e, &i); // 1 if insertion was successful
5363 bc_array_init(&data.v, var);
5364 bc_vec_push(v, &data.v);
5367 ptr = bc_vec_item(map, i);
5368 if (new) ptr->name = xstrdup(e.name);
5369 return bc_vec_item(v, ptr->idx);
5372 static BcStatus bc_program_num(BcResult *r, BcNum **num, bool hex)
5374 BcStatus s = BC_STATUS_SUCCESS;
5379 case BC_RESULT_TEMP:
5380 case BC_RESULT_IBASE:
5381 case BC_RESULT_SCALE:
5382 case BC_RESULT_OBASE:
5388 case BC_RESULT_CONSTANT:
5390 char **str = bc_vec_item(&G.prog.consts, r->d.id.idx);
5391 size_t base_t, len = strlen(*str);
5394 bc_num_init(&r->d.n, len);
5396 hex = hex && len == 1;
5397 base = hex ? &G.prog.hexb : &G.prog.ib;
5398 base_t = hex ? BC_NUM_MAX_IBASE : G.prog.ib_t;
5399 s = bc_num_parse(&r->d.n, *str, base, base_t);
5402 bc_num_free(&r->d.n);
5407 r->t = BC_RESULT_TEMP;
5413 case BC_RESULT_ARRAY:
5414 case BC_RESULT_ARRAY_ELEM:
5418 v = bc_program_search(r->d.id.name, r->t == BC_RESULT_VAR);
5420 if (r->t == BC_RESULT_ARRAY_ELEM) {
5422 if (v->len <= r->d.id.idx) bc_array_expand(v, r->d.id.idx + 1);
5423 *num = bc_vec_item(v, r->d.id.idx);
5426 *num = bc_vec_top(v);
5431 case BC_RESULT_LAST:
5433 *num = &G.prog.last;
5447 static BcStatus bc_program_binOpPrep(BcResult **l, BcNum **ln,
5448 BcResult **r, BcNum **rn, bool assign)
5452 BcResultType lt, rt;
5454 if (!BC_PROG_STACK(&G.prog.results, 2))
5455 return bc_error_stack_has_too_few_elements();
5457 *r = bc_vec_item_rev(&G.prog.results, 0);
5458 *l = bc_vec_item_rev(&G.prog.results, 1);
5462 hex = assign && (lt == BC_RESULT_IBASE || lt == BC_RESULT_OBASE);
5464 s = bc_program_num(*l, ln, false);
5466 s = bc_program_num(*r, rn, hex);
5469 // We run this again under these conditions in case any vector has been
5470 // reallocated out from under the BcNums or arrays we had.
5471 if (lt == rt && (lt == BC_RESULT_VAR || lt == BC_RESULT_ARRAY_ELEM)) {
5472 s = bc_program_num(*l, ln, false);
5476 if (!BC_PROG_NUM((*l), (*ln)) && (!assign || (*l)->t != BC_RESULT_VAR))
5477 return bc_error_variable_is_wrong_type();
5478 if (!assign && !BC_PROG_NUM((*r), (*ln)))
5479 return bc_error_variable_is_wrong_type();
5484 static void bc_program_binOpRetire(BcResult *r)
5486 r->t = BC_RESULT_TEMP;
5487 bc_vec_pop(&G.prog.results);
5488 bc_vec_pop(&G.prog.results);
5489 bc_vec_push(&G.prog.results, r);
5492 static BcStatus bc_program_prep(BcResult **r, BcNum **n)
5496 if (!BC_PROG_STACK(&G.prog.results, 1))
5497 return bc_error_stack_has_too_few_elements();
5498 *r = bc_vec_top(&G.prog.results);
5500 s = bc_program_num(*r, n, false);
5503 if (!BC_PROG_NUM((*r), (*n)))
5504 return bc_error_variable_is_wrong_type();
5509 static void bc_program_retire(BcResult *r, BcResultType t)
5512 bc_vec_pop(&G.prog.results);
5513 bc_vec_push(&G.prog.results, r);
5516 static BcStatus bc_program_op(char inst)
5519 BcResult *opd1, *opd2, res;
5520 BcNum *n1, *n2 = NULL;
5522 s = bc_program_binOpPrep(&opd1, &n1, &opd2, &n2, false);
5524 bc_num_init(&res.d.n, BC_NUM_DEF_SIZE);
5526 s = bc_program_ops[inst - BC_INST_POWER](n1, n2, &res.d.n, G.prog.scale);
5528 bc_program_binOpRetire(&res);
5533 bc_num_free(&res.d.n);
5537 static BcStatus bc_program_read(void)
5539 const char *sv_file;
5545 BcFunc *f = bc_vec_item(&G.prog.fns, BC_PROG_READ);
5547 for (i = 0; i < G.prog.stack.len; ++i) {
5548 BcInstPtr *ip_ptr = bc_vec_item(&G.prog.stack, i);
5549 if (ip_ptr->func == BC_PROG_READ)
5550 return bc_error_nested_read_call();
5553 bc_vec_pop_all(&f->code);
5554 bc_char_vec_init(&buf);
5556 sv_file = G.prog.file;
5559 s = bc_read_line(&buf);
5562 common_parse_init(&parse, BC_PROG_READ);
5563 bc_lex_file(&parse.l);
5565 s = bc_parse_text(&parse, buf.v);
5566 if (s) goto exec_err;
5567 s = common_parse_expr(&parse, BC_PARSE_NOREAD);
5568 if (s) goto exec_err;
5570 if (parse.l.t.t != BC_LEX_NLINE && parse.l.t.t != BC_LEX_EOF) {
5571 s = bc_error("bad read() expression");
5575 ip.func = BC_PROG_READ;
5577 ip.len = G.prog.results.len;
5579 // Update this pointer, just in case.
5580 f = bc_vec_item(&G.prog.fns, BC_PROG_READ);
5582 bc_vec_pushByte(&f->code, BC_INST_POP_EXEC);
5583 bc_vec_push(&G.prog.stack, &ip);
5586 G.prog.file = sv_file;
5587 bc_parse_free(&parse);
5593 static size_t bc_program_index(char *code, size_t *bgn)
5595 char amt = code[(*bgn)++], i = 0;
5598 for (; i < amt; ++i, ++(*bgn))
5599 res |= (((size_t)((int) code[*bgn]) & UCHAR_MAX) << (i * CHAR_BIT));
5604 static char *bc_program_name(char *code, size_t *bgn)
5607 char c, *s, *str = code + *bgn, *ptr = strchr(str, BC_PARSE_STREND);
5609 s = xmalloc(ptr - str + 1);
5612 for (i = 0; c != 0 && c != BC_PARSE_STREND; c = code[(*bgn)++], ++i)
5620 static void bc_program_printString(const char *str, size_t *nchars)
5622 size_t i, len = strlen(str);
5631 for (i = 0; i < len; ++i, ++(*nchars)) {
5635 if (c != '\\' || i == len - 1)
5695 // Just print the backslash and following character.
5706 static BcStatus bc_program_print(char inst, size_t idx)
5708 BcStatus s = BC_STATUS_SUCCESS;
5713 bool pop = inst != BC_INST_PRINT;
5715 if (!BC_PROG_STACK(&G.prog.results, idx + 1))
5716 return bc_error_stack_has_too_few_elements();
5718 r = bc_vec_item_rev(&G.prog.results, idx);
5719 s = bc_program_num(r, &num, false);
5722 if (BC_PROG_NUM(r, num)) {
5723 s = bc_num_print(num, &G.prog.ob, G.prog.ob_t, !pop, &G.prog.nchars);
5724 if (!s) bc_num_copy(&G.prog.last, num);
5728 idx = (r->t == BC_RESULT_STR) ? r->d.id.idx : num->rdx;
5729 str = *((char **) bc_vec_item(&G.prog.strs, idx));
5731 if (inst == BC_INST_PRINT_STR) {
5732 for (i = 0, len = strlen(str); i < len; ++i) {
5735 if (c == '\n') G.prog.nchars = SIZE_MAX;
5740 bc_program_printString(str, &G.prog.nchars);
5741 if (inst == BC_INST_PRINT) bb_putchar('\n');
5745 if (!s && pop) bc_vec_pop(&G.prog.results);
5750 static BcStatus bc_program_negate(void)
5756 s = bc_program_prep(&ptr, &num);
5759 bc_num_init(&res.d.n, num->len);
5760 bc_num_copy(&res.d.n, num);
5761 if (res.d.n.len) res.d.n.neg = !res.d.n.neg;
5763 bc_program_retire(&res, BC_RESULT_TEMP);
5768 static BcStatus bc_program_logical(char inst)
5771 BcResult *opd1, *opd2, res;
5776 s = bc_program_binOpPrep(&opd1, &n1, &opd2, &n2, false);
5778 bc_num_init(&res.d.n, BC_NUM_DEF_SIZE);
5780 if (inst == BC_INST_BOOL_AND)
5781 cond = bc_num_cmp(n1, &G.prog.zero) && bc_num_cmp(n2, &G.prog.zero);
5782 else if (inst == BC_INST_BOOL_OR)
5783 cond = bc_num_cmp(n1, &G.prog.zero) || bc_num_cmp(n2, &G.prog.zero);
5786 cmp = bc_num_cmp(n1, n2);
5790 case BC_INST_REL_EQ:
5796 case BC_INST_REL_LE:
5802 case BC_INST_REL_GE:
5808 case BC_INST_REL_NE:
5814 case BC_INST_REL_LT:
5820 case BC_INST_REL_GT:
5828 (cond ? bc_num_one : bc_num_zero)(&res.d.n);
5830 bc_program_binOpRetire(&res);
5836 static BcStatus bc_program_assignStr(BcResult *r, BcVec *v,
5842 memset(&n2, 0, sizeof(BcNum));
5843 n2.rdx = res.d.id.idx = r->d.id.idx;
5844 res.t = BC_RESULT_STR;
5847 if (!BC_PROG_STACK(&G.prog.results, 2))
5848 return bc_error_stack_has_too_few_elements();
5850 bc_vec_pop(&G.prog.results);
5853 bc_vec_pop(&G.prog.results);
5855 bc_vec_push(&G.prog.results, &res);
5856 bc_vec_push(v, &n2);
5858 return BC_STATUS_SUCCESS;
5862 static BcStatus bc_program_copyToVar(char *name, bool var)
5869 if (!BC_PROG_STACK(&G.prog.results, 1))
5870 return bc_error_stack_has_too_few_elements();
5872 ptr = bc_vec_top(&G.prog.results);
5873 if ((ptr->t == BC_RESULT_ARRAY) != !var)
5874 return bc_error_variable_is_wrong_type();
5875 v = bc_program_search(name, var);
5878 if (ptr->t == BC_RESULT_STR && !var)
5879 return bc_error_variable_is_wrong_type();
5880 if (ptr->t == BC_RESULT_STR) return bc_program_assignStr(ptr, v, true);
5883 s = bc_program_num(ptr, &n, false);
5886 // Do this once more to make sure that pointers were not invalidated.
5887 v = bc_program_search(name, var);
5890 bc_num_init(&r.d.n, BC_NUM_DEF_SIZE);
5891 bc_num_copy(&r.d.n, n);
5894 bc_array_init(&r.d.v, true);
5895 bc_array_copy(&r.d.v, (BcVec *) n);
5898 bc_vec_push(v, &r.d);
5899 bc_vec_pop(&G.prog.results);
5904 static BcStatus bc_program_assign(char inst)
5907 BcResult *left, *right, res;
5908 BcNum *l = NULL, *r = NULL;
5909 bool assign = inst == BC_INST_ASSIGN, ib, sc;
5911 s = bc_program_binOpPrep(&left, &l, &right, &r, assign);
5914 ib = left->t == BC_RESULT_IBASE;
5915 sc = left->t == BC_RESULT_SCALE;
5919 if (right->t == BC_RESULT_STR) {
5923 if (left->t != BC_RESULT_VAR)
5924 return bc_error_variable_is_wrong_type();
5925 v = bc_program_search(left->d.id.name, true);
5927 return bc_program_assignStr(right, v, false);
5931 if (left->t == BC_RESULT_CONSTANT || left->t == BC_RESULT_TEMP)
5932 return bc_error("bad assignment:"
5933 " left side must be scale,"
5934 " ibase, obase, last, var,"
5939 if (inst == BC_INST_ASSIGN_DIVIDE && !bc_num_cmp(r, &G.prog.zero))
5940 return bc_error("divide by zero");
5945 s = bc_program_ops[inst - BC_INST_ASSIGN_POWER](l, r, l, G.prog.scale);
5952 if (ib || sc || left->t == BC_RESULT_OBASE) {
5953 static const char *const msg[] = {
5954 "bad ibase; must be [2,16]", //BC_RESULT_IBASE
5955 "bad scale; must be [0,"BC_MAX_SCALE_STR"]", //BC_RESULT_SCALE
5956 NULL, //can't happen //BC_RESULT_LAST
5957 NULL, //can't happen //BC_RESULT_CONSTANT
5958 NULL, //can't happen //BC_RESULT_ONE
5959 "bad obase; must be [2,"BC_MAX_OBASE_STR"]", //BC_RESULT_OBASE
5962 unsigned long val, max;
5964 s = bc_num_ulong(l, &val);
5967 s = left->t - BC_RESULT_IBASE;
5970 ptr = &G.prog.scale;
5973 if (val < BC_NUM_MIN_BASE)
5974 return bc_error(msg[s]);
5975 max = ib ? BC_NUM_MAX_IBASE : BC_MAX_OBASE;
5976 ptr = ib ? &G.prog.ib_t : &G.prog.ob_t;
5980 return bc_error(msg[s]);
5982 bc_num_copy(ib ? &G.prog.ib : &G.prog.ob, l);
5984 *ptr = (size_t) val;
5985 s = BC_STATUS_SUCCESS;
5988 bc_num_init(&res.d.n, l->len);
5989 bc_num_copy(&res.d.n, l);
5990 bc_program_binOpRetire(&res);
5996 #define bc_program_pushVar(code, bgn, pop, copy) \
5997 bc_program_pushVar(code, bgn)
5998 // for bc, 'pop' and 'copy' are always false
6000 static BcStatus bc_program_pushVar(char *code, size_t *bgn,
6001 bool pop, bool copy)
6003 BcStatus s = BC_STATUS_SUCCESS;
6005 char *name = bc_program_name(code, bgn);
6007 r.t = BC_RESULT_VAR;
6012 BcVec *v = bc_program_search(name, true);
6013 BcNum *num = bc_vec_top(v);
6017 if (!BC_PROG_STACK(v, 2 - copy)) {
6019 return bc_error_stack_has_too_few_elements();
6025 if (!BC_PROG_STR(num)) {
6027 r.t = BC_RESULT_TEMP;
6029 bc_num_init(&r.d.n, BC_NUM_DEF_SIZE);
6030 bc_num_copy(&r.d.n, num);
6033 r.t = BC_RESULT_STR;
6034 r.d.id.idx = num->rdx;
6037 if (!copy) bc_vec_pop(v);
6042 bc_vec_push(&G.prog.results, &r);
6047 static BcStatus bc_program_pushArray(char *code, size_t *bgn,
6050 BcStatus s = BC_STATUS_SUCCESS;
6054 r.d.id.name = bc_program_name(code, bgn);
6056 if (inst == BC_INST_ARRAY) {
6057 r.t = BC_RESULT_ARRAY;
6058 bc_vec_push(&G.prog.results, &r);
6065 s = bc_program_prep(&operand, &num);
6067 s = bc_num_ulong(num, &temp);
6070 if (temp > BC_MAX_DIM) {
6071 s = bc_error("array too long; must be [1,"BC_MAX_DIM_STR"]");
6075 r.d.id.idx = (size_t) temp;
6076 bc_program_retire(&r, BC_RESULT_ARRAY_ELEM);
6080 if (s) free(r.d.id.name);
6085 static BcStatus bc_program_incdec(char inst)
6088 BcResult *ptr, res, copy;
6092 s = bc_program_prep(&ptr, &num);
6095 if (inst == BC_INST_INC_POST || inst == BC_INST_DEC_POST) {
6096 copy.t = BC_RESULT_TEMP;
6097 bc_num_init(©.d.n, num->len);
6098 bc_num_copy(©.d.n, num);
6101 res.t = BC_RESULT_ONE;
6102 inst = inst == BC_INST_INC_PRE || inst == BC_INST_INC_POST ?
6103 BC_INST_ASSIGN_PLUS :
6104 BC_INST_ASSIGN_MINUS;
6106 bc_vec_push(&G.prog.results, &res);
6107 bc_program_assign(inst);
6109 if (inst2 == BC_INST_INC_POST || inst2 == BC_INST_DEC_POST) {
6110 bc_vec_pop(&G.prog.results);
6111 bc_vec_push(&G.prog.results, ©);
6117 static BcStatus bc_program_call(char *code, size_t *idx)
6119 BcStatus s = BC_STATUS_SUCCESS;
6121 size_t i, nparams = bc_program_index(code, idx);
6128 ip.func = bc_program_index(code, idx);
6129 func = bc_vec_item(&G.prog.fns, ip.func);
6131 if (func->code.len == 0) {
6132 return bc_error("undefined function");
6134 if (nparams != func->nparams) {
6135 return bc_error_fmt("function has %u parameters, but called with %u", func->nparams, nparams);
6137 ip.len = G.prog.results.len - nparams;
6139 for (i = 0; i < nparams; ++i) {
6141 a = bc_vec_item(&func->autos, nparams - 1 - i);
6142 arg = bc_vec_top(&G.prog.results);
6144 if ((!a->idx) != (arg->t == BC_RESULT_ARRAY) || arg->t == BC_RESULT_STR)
6145 return bc_error_variable_is_wrong_type();
6147 s = bc_program_copyToVar(a->name, a->idx);
6151 for (; i < func->autos.len; ++i) {
6154 a = bc_vec_item(&func->autos, i);
6155 v = bc_program_search(a->name, a->idx);
6158 bc_num_init(¶m.n, BC_NUM_DEF_SIZE);
6159 bc_vec_push(v, ¶m.n);
6162 bc_array_init(¶m.v, true);
6163 bc_vec_push(v, ¶m.v);
6167 bc_vec_push(&G.prog.stack, &ip);
6169 return BC_STATUS_SUCCESS;
6172 static BcStatus bc_program_return(char inst)
6178 BcInstPtr *ip = bc_vec_top(&G.prog.stack);
6180 if (!BC_PROG_STACK(&G.prog.results, ip->len + inst == BC_INST_RET))
6181 return bc_error_stack_has_too_few_elements();
6183 f = bc_vec_item(&G.prog.fns, ip->func);
6184 res.t = BC_RESULT_TEMP;
6186 if (inst == BC_INST_RET) {
6189 BcResult *operand = bc_vec_top(&G.prog.results);
6191 s = bc_program_num(operand, &num, false);
6193 bc_num_init(&res.d.n, num->len);
6194 bc_num_copy(&res.d.n, num);
6197 bc_num_init(&res.d.n, BC_NUM_DEF_SIZE);
6198 bc_num_zero(&res.d.n);
6201 // We need to pop arguments as well, so this takes that into account.
6202 for (i = 0; i < f->autos.len; ++i) {
6205 BcId *a = bc_vec_item(&f->autos, i);
6207 v = bc_program_search(a->name, a->idx);
6211 bc_vec_npop(&G.prog.results, G.prog.results.len - ip->len);
6212 bc_vec_push(&G.prog.results, &res);
6213 bc_vec_pop(&G.prog.stack);
6215 return BC_STATUS_SUCCESS;
6219 static unsigned long bc_program_scale(BcNum *n)
6221 return (unsigned long) n->rdx;
6224 static unsigned long bc_program_len(BcNum *n)
6226 unsigned long len = n->len;
6229 if (n->rdx != n->len) return len;
6230 for (i = n->len - 1; i < n->len && n->num[i] == 0; --len, --i);
6235 static BcStatus bc_program_builtin(char inst)
6241 bool len = inst == BC_INST_LENGTH;
6243 if (!BC_PROG_STACK(&G.prog.results, 1))
6244 return bc_error_stack_has_too_few_elements();
6245 opnd = bc_vec_top(&G.prog.results);
6247 s = bc_program_num(opnd, &num, false);
6251 if (!BC_PROG_NUM(opnd, num) && !len)
6252 return bc_error_variable_is_wrong_type();
6255 bc_num_init(&res.d.n, BC_NUM_DEF_SIZE);
6257 if (inst == BC_INST_SQRT) s = bc_num_sqrt(num, &res.d.n, G.prog.scale);
6259 else if (len != 0 && opnd->t == BC_RESULT_ARRAY) {
6260 bc_num_ulong2num(&res.d.n, (unsigned long) ((BcVec *) num)->len);
6264 else if (len != 0 && !BC_PROG_NUM(opnd, num)) {
6267 size_t idx = opnd->t == BC_RESULT_STR ? opnd->d.id.idx : num->rdx;
6269 str = bc_vec_item(&G.prog.strs, idx);
6270 bc_num_ulong2num(&res.d.n, strlen(*str));
6274 BcProgramBuiltIn f = len ? bc_program_len : bc_program_scale;
6275 bc_num_ulong2num(&res.d.n, f(num));
6278 bc_program_retire(&res, BC_RESULT_TEMP);
6284 static BcStatus bc_program_divmod(void)
6287 BcResult *opd1, *opd2, res, res2;
6288 BcNum *n1, *n2 = NULL;
6290 s = bc_program_binOpPrep(&opd1, &n1, &opd2, &n2, false);
6293 bc_num_init(&res.d.n, BC_NUM_DEF_SIZE);
6294 bc_num_init(&res2.d.n, n2->len);
6296 s = bc_num_divmod(n1, n2, &res2.d.n, &res.d.n, G.prog.scale);
6299 bc_program_binOpRetire(&res2);
6300 res.t = BC_RESULT_TEMP;
6301 bc_vec_push(&G.prog.results, &res);
6306 bc_num_free(&res2.d.n);
6307 bc_num_free(&res.d.n);
6311 static BcStatus bc_program_modexp(void)
6314 BcResult *r1, *r2, *r3, res;
6315 BcNum *n1, *n2, *n3;
6317 if (!BC_PROG_STACK(&G.prog.results, 3))
6318 return bc_error_stack_has_too_few_elements();
6319 s = bc_program_binOpPrep(&r2, &n2, &r3, &n3, false);
6322 r1 = bc_vec_item_rev(&G.prog.results, 2);
6323 s = bc_program_num(r1, &n1, false);
6325 if (!BC_PROG_NUM(r1, n1))
6326 return bc_error_variable_is_wrong_type();
6328 // Make sure that the values have their pointers updated, if necessary.
6329 if (r1->t == BC_RESULT_VAR || r1->t == BC_RESULT_ARRAY_ELEM) {
6331 if (r1->t == r2->t) {
6332 s = bc_program_num(r2, &n2, false);
6336 if (r1->t == r3->t) {
6337 s = bc_program_num(r3, &n3, false);
6342 bc_num_init(&res.d.n, n3->len);
6343 s = bc_num_modexp(n1, n2, n3, &res.d.n);
6346 bc_vec_pop(&G.prog.results);
6347 bc_program_binOpRetire(&res);
6352 bc_num_free(&res.d.n);
6356 static void bc_program_stackLen(void)
6359 size_t len = G.prog.results.len;
6361 res.t = BC_RESULT_TEMP;
6363 bc_num_init(&res.d.n, BC_NUM_DEF_SIZE);
6364 bc_num_ulong2num(&res.d.n, len);
6365 bc_vec_push(&G.prog.results, &res);
6368 static BcStatus bc_program_asciify(void)
6372 BcNum *num = NULL, n;
6373 char *str, *str2, c;
6374 size_t len = G.prog.strs.len, idx;
6377 if (!BC_PROG_STACK(&G.prog.results, 1))
6378 return bc_error_stack_has_too_few_elements();
6379 r = bc_vec_top(&G.prog.results);
6381 s = bc_program_num(r, &num, false);
6384 if (BC_PROG_NUM(r, num)) {
6386 bc_num_init(&n, BC_NUM_DEF_SIZE);
6387 bc_num_copy(&n, num);
6388 bc_num_truncate(&n, n.rdx);
6390 s = bc_num_mod(&n, &G.prog.strmb, &n, 0);
6391 if (s) goto num_err;
6392 s = bc_num_ulong(&n, &val);
6393 if (s) goto num_err;
6400 idx = (r->t == BC_RESULT_STR) ? r->d.id.idx : num->rdx;
6401 str2 = *((char **) bc_vec_item(&G.prog.strs, idx));
6409 str2 = xstrdup(str);
6410 bc_program_addFunc(str2, &idx);
6412 if (idx != len + BC_PROG_REQ_FUNCS) {
6414 for (idx = 0; idx < G.prog.strs.len; ++idx) {
6415 if (!strcmp(*((char **) bc_vec_item(&G.prog.strs, idx)), str)) {
6424 bc_vec_push(&G.prog.strs, &str);
6426 res.t = BC_RESULT_STR;
6428 bc_vec_pop(&G.prog.results);
6429 bc_vec_push(&G.prog.results, &res);
6431 return BC_STATUS_SUCCESS;
6438 static BcStatus bc_program_printStream(void)
6446 if (!BC_PROG_STACK(&G.prog.results, 1))
6447 return bc_error_stack_has_too_few_elements();
6448 r = bc_vec_top(&G.prog.results);
6450 s = bc_program_num(r, &n, false);
6453 if (BC_PROG_NUM(r, n))
6454 s = bc_num_stream(n, &G.prog.strmb, &G.prog.nchars);
6456 idx = (r->t == BC_RESULT_STR) ? r->d.id.idx : n->rdx;
6457 str = *((char **) bc_vec_item(&G.prog.strs, idx));
6464 static BcStatus bc_program_nquit(void)
6471 s = bc_program_prep(&opnd, &num);
6473 s = bc_num_ulong(num, &val);
6476 bc_vec_pop(&G.prog.results);
6478 if (G.prog.stack.len < val)
6479 return bc_error_stack_has_too_few_elements();
6480 if (G.prog.stack.len == val) {
6481 QUIT_OR_RETURN_TO_MAIN;
6484 bc_vec_npop(&G.prog.stack, val);
6489 static BcStatus bc_program_execStr(char *code, size_t *bgn,
6492 BcStatus s = BC_STATUS_SUCCESS;
6502 if (!BC_PROG_STACK(&G.prog.results, 1))
6503 return bc_error_stack_has_too_few_elements();
6505 r = bc_vec_top(&G.prog.results);
6509 char *name, *then_name = bc_program_name(code, bgn), *else_name = NULL;
6511 if (code[*bgn] == BC_PARSE_STREND)
6514 else_name = bc_program_name(code, bgn);
6516 exec = r->d.n.len != 0;
6520 else if (else_name != NULL) {
6527 v = bc_program_search(name, true);
6534 if (!exec) goto exit;
6535 if (!BC_PROG_STR(n)) {
6536 s = bc_error_variable_is_wrong_type();
6544 if (r->t == BC_RESULT_STR)
6546 else if (r->t == BC_RESULT_VAR) {
6547 s = bc_program_num(r, &n, false);
6548 if (s || !BC_PROG_STR(n)) goto exit;
6555 fidx = sidx + BC_PROG_REQ_FUNCS;
6557 str = bc_vec_item(&G.prog.strs, sidx);
6558 f = bc_vec_item(&G.prog.fns, fidx);
6560 if (f->code.len == 0) {
6561 common_parse_init(&prs, fidx);
6562 s = bc_parse_text(&prs, *str);
6564 s = common_parse_expr(&prs, BC_PARSE_NOCALL);
6567 if (prs.l.t.t != BC_LEX_EOF) {
6568 s = bc_error_bad_expression();
6572 bc_parse_free(&prs);
6576 ip.len = G.prog.results.len;
6579 bc_vec_pop(&G.prog.results);
6580 bc_vec_push(&G.prog.stack, &ip);
6582 return BC_STATUS_SUCCESS;
6585 bc_parse_free(&prs);
6586 f = bc_vec_item(&G.prog.fns, fidx);
6587 bc_vec_pop_all(&f->code);
6589 bc_vec_pop(&G.prog.results);
6594 static void bc_program_pushGlobal(char inst)
6599 res.t = inst - BC_INST_IBASE + BC_RESULT_IBASE;
6600 if (inst == BC_INST_IBASE)
6601 val = (unsigned long) G.prog.ib_t;
6602 else if (inst == BC_INST_SCALE)
6603 val = (unsigned long) G.prog.scale;
6605 val = (unsigned long) G.prog.ob_t;
6607 bc_num_init(&res.d.n, BC_NUM_DEF_SIZE);
6608 bc_num_ulong2num(&res.d.n, val);
6609 bc_vec_push(&G.prog.results, &res);
6612 static void bc_program_addFunc(char *name, size_t *idx)
6614 BcId entry, *entry_ptr;
6619 entry.idx = G.prog.fns.len;
6621 inserted = bc_map_insert(&G.prog.fn_map, &entry, idx);
6622 if (!inserted) free(name);
6624 entry_ptr = bc_vec_item(&G.prog.fn_map, *idx);
6625 *idx = entry_ptr->idx;
6629 BcFunc *func = bc_vec_item(&G.prog.fns, entry_ptr->idx);
6631 // We need to reset these, so the function can be repopulated.
6633 bc_vec_pop_all(&func->autos);
6634 bc_vec_pop_all(&func->code);
6635 bc_vec_pop_all(&func->labels);
6639 bc_vec_push(&G.prog.fns, &f);
6643 static BcStatus bc_program_exec(void)
6645 BcStatus s = BC_STATUS_SUCCESS;
6649 BcInstPtr *ip = bc_vec_top(&G.prog.stack);
6650 BcFunc *func = bc_vec_item(&G.prog.fns, ip->func);
6651 char *code = func->code.v;
6654 while (!s && ip->idx < func->code.len) {
6656 char inst = code[(ip->idx)++];
6661 case BC_INST_JUMP_ZERO:
6663 s = bc_program_prep(&ptr, &num);
6665 cond = !bc_num_cmp(num, &G.prog.zero);
6666 bc_vec_pop(&G.prog.results);
6672 idx = bc_program_index(code, &ip->idx);
6673 addr = bc_vec_item(&func->labels, idx);
6674 if (inst == BC_INST_JUMP || cond) ip->idx = *addr;
6680 s = bc_program_call(code, &ip->idx);
6684 case BC_INST_INC_PRE:
6685 case BC_INST_DEC_PRE:
6686 case BC_INST_INC_POST:
6687 case BC_INST_DEC_POST:
6689 s = bc_program_incdec(inst);
6695 QUIT_OR_RETURN_TO_MAIN;
6702 s = bc_program_return(inst);
6706 case BC_INST_BOOL_OR:
6707 case BC_INST_BOOL_AND:
6709 case BC_INST_REL_EQ:
6710 case BC_INST_REL_LE:
6711 case BC_INST_REL_GE:
6712 case BC_INST_REL_NE:
6713 case BC_INST_REL_LT:
6714 case BC_INST_REL_GT:
6716 s = bc_program_logical(inst);
6722 s = bc_program_read();
6728 s = bc_program_pushVar(code, &ip->idx, false, false);
6732 case BC_INST_ARRAY_ELEM:
6735 s = bc_program_pushArray(code, &ip->idx, inst);
6741 r.t = BC_RESULT_LAST;
6742 bc_vec_push(&G.prog.results, &r);
6750 bc_program_pushGlobal(inst);
6754 case BC_INST_SCALE_FUNC:
6755 case BC_INST_LENGTH:
6758 s = bc_program_builtin(inst);
6764 r.t = BC_RESULT_CONSTANT;
6765 r.d.id.idx = bc_program_index(code, &ip->idx);
6766 bc_vec_push(&G.prog.results, &r);
6772 if (!BC_PROG_STACK(&G.prog.results, 1))
6773 s = bc_error_stack_has_too_few_elements();
6775 bc_vec_pop(&G.prog.results);
6779 case BC_INST_POP_EXEC:
6781 bc_vec_pop(&G.prog.stack);
6786 case BC_INST_PRINT_POP:
6787 case BC_INST_PRINT_STR:
6789 s = bc_program_print(inst, 0);
6795 r.t = BC_RESULT_STR;
6796 r.d.id.idx = bc_program_index(code, &ip->idx);
6797 bc_vec_push(&G.prog.results, &r);
6802 case BC_INST_MULTIPLY:
6803 case BC_INST_DIVIDE:
6804 case BC_INST_MODULUS:
6808 s = bc_program_op(inst);
6812 case BC_INST_BOOL_NOT:
6814 s = bc_program_prep(&ptr, &num);
6817 bc_num_init(&r.d.n, BC_NUM_DEF_SIZE);
6818 (!bc_num_cmp(num, &G.prog.zero) ? bc_num_one : bc_num_zero)(&r.d.n);
6819 bc_program_retire(&r, BC_RESULT_TEMP);
6826 s = bc_program_negate();
6831 case BC_INST_ASSIGN_POWER:
6832 case BC_INST_ASSIGN_MULTIPLY:
6833 case BC_INST_ASSIGN_DIVIDE:
6834 case BC_INST_ASSIGN_MODULUS:
6835 case BC_INST_ASSIGN_PLUS:
6836 case BC_INST_ASSIGN_MINUS:
6838 case BC_INST_ASSIGN:
6840 s = bc_program_assign(inst);
6844 case BC_INST_MODEXP:
6846 s = bc_program_modexp();
6850 case BC_INST_DIVMOD:
6852 s = bc_program_divmod();
6856 case BC_INST_EXECUTE:
6857 case BC_INST_EXEC_COND:
6859 cond = inst == BC_INST_EXEC_COND;
6860 s = bc_program_execStr(code, &ip->idx, cond);
6864 case BC_INST_PRINT_STACK:
6866 for (idx = 0; !s && idx < G.prog.results.len; ++idx)
6867 s = bc_program_print(BC_INST_PRINT, idx);
6871 case BC_INST_CLEAR_STACK:
6873 bc_vec_pop_all(&G.prog.results);
6877 case BC_INST_STACK_LEN:
6879 bc_program_stackLen();
6883 case BC_INST_DUPLICATE:
6885 if (!BC_PROG_STACK(&G.prog.results, 1))
6886 return bc_error_stack_has_too_few_elements();
6887 ptr = bc_vec_top(&G.prog.results);
6888 bc_result_copy(&r, ptr);
6889 bc_vec_push(&G.prog.results, &r);
6897 if (!BC_PROG_STACK(&G.prog.results, 2))
6898 return bc_error_stack_has_too_few_elements();
6900 ptr = bc_vec_item_rev(&G.prog.results, 0);
6901 ptr2 = bc_vec_item_rev(&G.prog.results, 1);
6902 memcpy(&r, ptr, sizeof(BcResult));
6903 memcpy(ptr, ptr2, sizeof(BcResult));
6904 memcpy(ptr2, &r, sizeof(BcResult));
6909 case BC_INST_ASCIIFY:
6911 s = bc_program_asciify();
6915 case BC_INST_PRINT_STREAM:
6917 s = bc_program_printStream();
6922 case BC_INST_PUSH_VAR:
6924 bool copy = inst == BC_INST_LOAD;
6925 s = bc_program_pushVar(code, &ip->idx, true, copy);
6929 case BC_INST_PUSH_TO_VAR:
6931 char *name = bc_program_name(code, &ip->idx);
6932 s = bc_program_copyToVar(name, true);
6939 if (G.prog.stack.len <= 2)
6940 QUIT_OR_RETURN_TO_MAIN;
6941 bc_vec_npop(&G.prog.stack, 2);
6947 s = bc_program_nquit();
6953 if (s || G_interrupt) {
6958 // If the stack has changed, pointers may be invalid.
6959 ip = bc_vec_top(&G.prog.stack);
6960 func = bc_vec_item(&G.prog.fns, ip->func);
6961 code = func->code.v;
6968 static void bc_vm_info(void)
6970 printf("%s "BB_VER"\n"
6971 "Copyright (c) 2018 Gavin D. Howard and contributors\n"
6975 static void bc_args(char **argv)
6981 #if ENABLE_FEATURE_BC_LONG_OPTIONS
6982 opts = option_mask32 |= getopt32long(argv, "wvsqli",
6983 "warn\0" No_argument "w"
6984 "version\0" No_argument "v"
6985 "standard\0" No_argument "s"
6986 "quiet\0" No_argument "q"
6987 "mathlib\0" No_argument "l"
6988 "interactive\0" No_argument "i"
6991 opts = option_mask32 |= getopt32(argv, "wvsqli");
6993 if (getenv("POSIXLY_CORRECT"))
6994 option_mask32 |= BC_FLAG_S;
6996 if (opts & BC_FLAG_V) {
7001 for (i = optind; argv[i]; ++i)
7002 bc_vec_push(&G.files, argv + i);
7005 static void bc_vm_envArgs(void)
7009 char *env_args = getenv("BC_ENV_ARGS");
7011 if (!env_args) return;
7013 G.env_args = xstrdup(env_args);
7016 bc_vec_init(&v, sizeof(char *), NULL);
7018 while (*(buf = skip_whitespace(buf)) != '\0') {
7019 bc_vec_push(&v, &buf);
7020 buf = skip_non_whitespace(buf);
7026 // NULL terminate, and pass argv[] so that first arg is argv[1]
7027 if (sizeof(int) == sizeof(char*)) {
7028 bc_vec_push(&v, &const_int_0);
7030 static char *const nullptr = NULL;
7031 bc_vec_push(&v, &nullptr);
7033 bc_args(((char **)v.v) - 1);
7039 static unsigned bc_vm_envLen(const char *var)
7045 len = BC_NUM_PRINT_WIDTH;
7046 if (!lenv) return len;
7048 len = bb_strtou(lenv, NULL, 10) - 1;
7049 if (errno || len < 2 || len >= INT_MAX)
7050 len = BC_NUM_PRINT_WIDTH;
7055 static BcStatus bc_vm_process(const char *text)
7057 BcStatus s = bc_parse_text(&G.prs, text);
7061 while (G.prs.l.t.t != BC_LEX_EOF) {
7062 s = G.prs.parse(&G.prs);
7066 if (BC_PARSE_CAN_EXEC(&G.prs)) {
7067 s = bc_program_exec();
7076 static BcStatus bc_vm_file(const char *file)
7078 const char *sv_file;
7084 data = bc_read_file(file);
7085 if (!data) return bc_error_fmt("file '%s' is not text", file);
7087 sv_file = G.prog.file;
7089 bc_lex_file(&G.prs.l);
7090 s = bc_vm_process(data);
7093 main_func = bc_vec_item(&G.prog.fns, BC_PROG_MAIN);
7094 ip = bc_vec_item(&G.prog.stack, 0);
7096 if (main_func->code.len < ip->idx)
7097 s = bc_error_fmt("file '%s' is not executable", file);
7100 G.prog.file = sv_file;
7105 static BcStatus bc_vm_stdin(void)
7109 size_t len, i, str = 0;
7110 bool comment = false;
7113 bc_lex_file(&G.prs.l);
7115 bc_char_vec_init(&buffer);
7116 bc_char_vec_init(&buf);
7117 bc_vec_pushZeroByte(&buffer);
7119 // This loop is complex because the vm tries not to send any lines that end
7120 // with a backslash to the parser. The reason for that is because the parser
7121 // treats a backslash+newline combo as whitespace, per the bc spec. In that
7122 // case, and for strings and comments, the parser will expect more stuff.
7123 while ((s = bc_read_line(&buf)) == BC_STATUS_SUCCESS) {
7125 char *string = buf.v;
7130 if (str && buf.v[0] == G.send)
7132 else if (buf.v[0] == G.sbgn)
7135 else if (len > 1 || comment) {
7137 for (i = 0; i < len; ++i) {
7139 bool notend = len > i + 1;
7142 if (i - 1 > len || string[i - 1] != '\\') {
7143 if (G.sbgn == G.send)
7145 else if (c == G.send)
7147 else if (c == G.sbgn)
7151 if (c == '/' && notend && !comment && string[i + 1] == '*') {
7155 else if (c == '*' && notend && comment && string[i + 1] == '/')
7159 if (str || comment || string[len - 2] == '\\') {
7160 bc_vec_concat(&buffer, buf.v);
7165 bc_vec_concat(&buffer, buf.v);
7166 s = bc_vm_process(buffer.v);
7168 if (ENABLE_FEATURE_CLEAN_UP && !G_ttyin) {
7169 // Debug config, non-interactive mode:
7170 // return all the way back to main.
7171 // Non-debug builds do not come here, they exit.
7176 bc_vec_pop_all(&buffer);
7178 if (s == BC_STATUS_EOF) // input EOF (^D) is not an error
7179 s = BC_STATUS_SUCCESS;
7182 s = bc_error("string end could not be found");
7185 s = bc_error("comment end could not be found");
7189 bc_vec_free(&buffer);
7194 static const char bc_lib[] = {
7197 "\n" "auto b,s,n,r,d,i,p,f,v"
7206 "\n" "scale=scale(x)+1"
7216 "\n" "for(i=2;v!=0;++i){"
7222 "\n" "while((d--)!=0)r*=r"
7225 "\n" "if(n!=0)return(1/r)"
7229 "\n" "auto b,s,r,p,a,q,i,v"
7233 "\n" "r=(1-10^scale)/1"
7244 "\n" "while(x<=0.5){"
7248 "\n" "r=a=(x-1)/(x+1)"
7251 "\n" "for(i=3;v!=0;i+=2){"
7262 "\n" "auto b,s,r,n,a,q,i"
7266 "\n" "scale=1.1*s+2"
7275 "\n" "if(q%2!=0)x=-x"
7279 "\n" "for(i=3;a!=0;i+=2){"
7280 "\n" "a*=q/(i*(i-1))"
7285 "\n" "if(n!=0)return(-r/1)"
7294 "\n" "x=s(2*a(1)+x)"
7300 "\n" "auto b,s,r,n,a,m,t,f,i,u"
7309 "\n" "if(scale<65){"
7310 "\n" "return(.7853981633974483096156608458198757210492923498437764552437361480/n)"
7314 "\n" "if(scale<65){"
7315 "\n" "return(.1973955598498807583700497651947902934475851037878521015176889402/n)"
7326 "\n" "x=(x-.2)/(1+.2*x)"
7331 "\n" "for(i=3;t!=0;i+=2){"
7338 "\n" "return((m*a+r)/n)"
7340 "\n" "define j(n,x){"
7341 "\n" "auto b,s,o,a,i,v,f"
7349 "\n" "if(n%2==1)o=1"
7352 "\n" "for(i=2;i<=n;++i)a*=i"
7354 "\n" "a=(x^n)/2^n/a"
7357 "\n" "scale=scale+length(a)-scale(a)"
7358 "\n" "for(i=1;v!=0;++i){"
7359 "\n" "v=v*f/i/(n+i)"
7365 "\n" "return(a*r/1)"
7370 static BcStatus bc_vm_exec(void)
7376 if (option_mask32 & BC_FLAG_L) {
7378 // We know that internal library is not buggy,
7379 // thus error checking is normally disabled.
7380 # define DEBUG_LIB 0
7381 bc_lex_file(&G.prs.l);
7382 s = bc_parse_text(&G.prs, bc_lib);
7383 if (DEBUG_LIB && s) return s;
7385 while (G.prs.l.t.t != BC_LEX_EOF) {
7386 s = G.prs.parse(&G.prs);
7387 if (DEBUG_LIB && s) return s;
7389 s = bc_program_exec();
7390 if (DEBUG_LIB && s) return s;
7394 s = BC_STATUS_SUCCESS;
7395 for (i = 0; !s && i < G.files.len; ++i)
7396 s = bc_vm_file(*((char **) bc_vec_item(&G.files, i)));
7397 if (ENABLE_FEATURE_CLEAN_UP && s && !G_ttyin) {
7398 // Debug config, non-interactive mode:
7399 // return all the way back to main.
7400 // Non-debug builds do not come here, they exit.
7404 if (IS_BC || (option_mask32 & BC_FLAG_I))
7407 if (!s && !BC_PARSE_CAN_EXEC(&G.prs))
7408 s = bc_vm_process("");
7413 #if ENABLE_FEATURE_CLEAN_UP
7414 static void bc_program_free(void)
7416 bc_num_free(&G.prog.ib);
7417 bc_num_free(&G.prog.ob);
7418 bc_num_free(&G.prog.hexb);
7420 bc_num_free(&G.prog.strmb);
7422 bc_vec_free(&G.prog.fns);
7423 bc_vec_free(&G.prog.fn_map);
7424 bc_vec_free(&G.prog.vars);
7425 bc_vec_free(&G.prog.var_map);
7426 bc_vec_free(&G.prog.arrs);
7427 bc_vec_free(&G.prog.arr_map);
7428 bc_vec_free(&G.prog.strs);
7429 bc_vec_free(&G.prog.consts);
7430 bc_vec_free(&G.prog.results);
7431 bc_vec_free(&G.prog.stack);
7432 bc_num_free(&G.prog.last);
7433 bc_num_free(&G.prog.zero);
7434 bc_num_free(&G.prog.one);
7437 static void bc_vm_free(void)
7439 bc_vec_free(&G.files);
7441 bc_parse_free(&G.prs);
7446 static void bc_program_init(void)
7451 /* memset(&G.prog, 0, sizeof(G.prog)); - already is */
7452 memset(&ip, 0, sizeof(BcInstPtr));
7454 /* G.prog.nchars = G.prog.scale = 0; - already is */
7456 bc_num_init(&G.prog.ib, BC_NUM_DEF_SIZE);
7457 bc_num_ten(&G.prog.ib);
7460 bc_num_init(&G.prog.ob, BC_NUM_DEF_SIZE);
7461 bc_num_ten(&G.prog.ob);
7464 bc_num_init(&G.prog.hexb, BC_NUM_DEF_SIZE);
7465 bc_num_ten(&G.prog.hexb);
7466 G.prog.hexb.num[0] = 6;
7469 bc_num_init(&G.prog.strmb, BC_NUM_DEF_SIZE);
7470 bc_num_ulong2num(&G.prog.strmb, UCHAR_MAX + 1);
7473 bc_num_init(&G.prog.last, BC_NUM_DEF_SIZE);
7474 bc_num_zero(&G.prog.last);
7476 bc_num_init(&G.prog.zero, BC_NUM_DEF_SIZE);
7477 bc_num_zero(&G.prog.zero);
7479 bc_num_init(&G.prog.one, BC_NUM_DEF_SIZE);
7480 bc_num_one(&G.prog.one);
7482 bc_vec_init(&G.prog.fns, sizeof(BcFunc), bc_func_free);
7483 bc_vec_init(&G.prog.fn_map, sizeof(BcId), bc_id_free);
7485 bc_program_addFunc(xstrdup("(main)"), &idx);
7486 bc_program_addFunc(xstrdup("(read)"), &idx);
7488 bc_vec_init(&G.prog.vars, sizeof(BcVec), bc_vec_free);
7489 bc_vec_init(&G.prog.var_map, sizeof(BcId), bc_id_free);
7491 bc_vec_init(&G.prog.arrs, sizeof(BcVec), bc_vec_free);
7492 bc_vec_init(&G.prog.arr_map, sizeof(BcId), bc_id_free);
7494 bc_vec_init(&G.prog.strs, sizeof(char *), bc_string_free);
7495 bc_vec_init(&G.prog.consts, sizeof(char *), bc_string_free);
7496 bc_vec_init(&G.prog.results, sizeof(BcResult), bc_result_free);
7497 bc_vec_init(&G.prog.stack, sizeof(BcInstPtr), NULL);
7498 bc_vec_push(&G.prog.stack, &ip);
7501 static int bc_vm_init(const char *env_len)
7503 #if ENABLE_FEATURE_EDITING
7504 G.line_input_state = new_line_input_t(DO_HISTORY);
7506 G.prog.len = bc_vm_envLen(env_len);
7508 bc_vec_init(&G.files, sizeof(char *), NULL);
7510 IF_BC(bc_vm_envArgs();)
7513 IF_BC(bc_parse_init(&G.prs, BC_PROG_MAIN);)
7515 IF_DC(dc_parse_init(&G.prs, BC_PROG_MAIN);)
7519 #if ENABLE_FEATURE_BC_SIGNALS
7521 // With SA_RESTART, most system calls will restart
7522 // (IOW: they won't fail with EINTR).
7523 // In particular, this means ^C won't cause
7524 // stdout to get into "error state" if SIGINT hits
7525 // within write() syscall.
7526 // The downside is that ^C while line input is taken
7527 // will only be handled after [Enter] since read()
7528 // from stdin is not interrupted by ^C either,
7529 // it restarts, thus fgetc() does not return on ^C.
7530 signal_SA_RESTART_empty_mask(SIGINT, record_signo);
7532 // Without SA_RESTART, this exhibits a bug:
7533 // "while (1) print 1" and try ^C-ing it.
7534 // Intermittently, instead of returning to input line,
7535 // you'll get "output error: Interrupted system call"
7537 //signal_no_SA_RESTART_empty_mask(SIGINT, record_signo);
7541 return 0; // "not a tty"
7544 static BcStatus bc_vm_run(void)
7546 BcStatus st = bc_vm_exec();
7547 #if ENABLE_FEATURE_CLEAN_UP
7548 if (G_exiting) // it was actually "halt" or "quit"
7551 # if ENABLE_FEATURE_EDITING
7552 free_line_input_t(G.line_input_state);
7560 int bc_main(int argc, char **argv) MAIN_EXTERNALLY_VISIBLE;
7561 int bc_main(int argc UNUSED_PARAM, char **argv)
7566 G.sbgn = G.send = '"';
7568 is_tty = bc_vm_init("BC_LINE_LENGTH");
7572 if (is_tty && !(option_mask32 & BC_FLAG_Q))
7580 int dc_main(int argc, char **argv) MAIN_EXTERNALLY_VISIBLE;
7581 int dc_main(int argc UNUSED_PARAM, char **argv)
7589 * TODO: dc (GNU bc 1.07.1) 1.4.1 seems to use width
7590 * 1 char wider than bc from the same package.
7591 * Both default width, and xC_LINE_LENGTH=N are wider:
7592 * "DC_LINE_LENGTH=5 dc -e'123456 p'" prints:
7595 * "echo '123456' | BC_LINE_LENGTH=5 bc" prints:
7598 * Do the same, or it's a bug?
7600 bc_vm_init("DC_LINE_LENGTH");
7602 // Run -e'SCRIPT' and -fFILE in order of appearance, then handle FILEs
7603 noscript = BC_FLAG_I;
7605 int n = getopt(argc, argv, "e:f:x");
7611 n = bc_vm_process(optarg);
7619 option_mask32 |= DC_FLAG_X;
7629 bc_vec_push(&G.files, argv++);
7632 option_mask32 |= noscript; // set BC_FLAG_I if we need to interpret stdin
7638 #endif // not DC_SMALL