1 /* vi: set sw=4 ts=4: */
3 * Licensed under GPLv2 or later, see file LICENSE in this source tree.
4 * Copyright (c) 2018 Gavin D. Howard and contributors.
6 * ** Automatically generated from https://github.com/gavinhoward/bc **
7 * ** Do not edit unless you know what you are doing. **
10 //config: bool "bc (45 kb; 49 kb when combined with dc)"
13 //config: bc is a command-line, arbitrary-precision calculator with a
14 //config: Turing-complete language. See the GNU bc manual
15 //config: (https://www.gnu.org/software/bc/manual/bc.html) and bc spec
16 //config: (http://pubs.opengroup.org/onlinepubs/9699919799/utilities/bc.html)
17 //config: for details.
19 //config: This bc has four differences to the GNU bc:
21 //config: 1) The period (.) can also be used as a shortcut for "last", as in
23 //config: 2) Arrays are copied before being passed as arguments to
24 //config: functions. This behavior is required by the bc spec.
25 //config: 3) Arrays can be passed to the builtin "length" function to get
26 //config: the number of elements currently in the array. The following
27 //config: example prints "1":
32 //config: 4) The precedence of the boolean "not" operator (!) is equal to
33 //config: that of the unary minus (-), or negation, operator. This still
34 //config: allows POSIX-compliant scripts to work while somewhat
35 //config: preserving expected behavior (versus C) and making parsing
40 //config: -i --interactive force interactive mode
41 //config: -l --mathlib use predefined math routines:
43 //config: s(expr) = sine of expr in radians
44 //config: c(expr) = cosine of expr in radians
45 //config: a(expr) = arctangent of expr, returning
47 //config: l(expr) = natural log of expr
48 //config: e(expr) = raises e to the power of expr
49 //config: j(n, x) = Bessel function of integer order
52 //config: -q --quiet don't print version and copyright.
53 //config: -s --standard error if any non-POSIX extensions are used.
54 //config: -w --warn warn if any non-POSIX extensions are used.
55 //config: -v --version print version and copyright and exit.
57 //config: Long options are only available if FEATURE_BC_LONG_OPTIONS is
61 //config: bool "dc (38 kb; 49 kb when combined with bc)"
64 //config: dc is a reverse-polish notation command-line calculator which
65 //config: supports unlimited precision arithmetic. See the FreeBSD man page
66 //config: (https://www.unix.com/man-page/FreeBSD/1/dc/) and GNU dc manual
67 //config: (https://www.gnu.org/software/bc/manual/dc-1.05/html_mono/dc.html)
68 //config: for details.
70 //config: This dc has a few differences from the two above:
72 //config: 1) When printing a byte stream (command "P"), this bc follows what
73 //config: the FreeBSD dc does.
74 //config: 2) This dc implements the GNU extensions for divmod ("~") and
75 //config: modular exponentiation ("|").
76 //config: 3) This dc implements all FreeBSD extensions, except for "J" and
78 //config: 4) Like the FreeBSD dc, this dc supports extended registers.
79 //config: However, they are implemented differently. When it encounters
80 //config: whitespace where a register should be, it skips the whitespace.
81 //config: If the character following is not a lowercase letter, an error
82 //config: is issued. Otherwise, the register name is parsed by the
83 //config: following regex:
85 //config: [a-z][a-z0-9_]*
87 //config: This generally means that register names will be surrounded by
92 //config: l idx s temp L index S temp2 < do_thing
94 //config: Also note that, like the FreeBSD dc, extended registers are not
95 //config: allowed unless the "-x" option is given.
97 //config:config FEATURE_DC_SMALL
98 //config: bool "Minimal dc implementation (4.2 kb), not using bc code base"
99 //config: depends on DC && !BC
102 //config:config FEATURE_DC_LIBM
103 //config: bool "Enable power and exp functions (requires libm)"
105 //config: depends on FEATURE_DC_SMALL
107 //config: Enable power and exp functions.
108 //config: NOTE: This will require libm to be present for linking.
110 //config:config FEATURE_BC_SIGNALS
111 //config: bool "Enable bc/dc signal handling"
113 //config: depends on (BC || DC) && !FEATURE_DC_SMALL
115 //config: Enable signal handling for bc and dc.
117 //config:config FEATURE_BC_LONG_OPTIONS
118 //config: bool "Enable bc/dc long options"
120 //config: depends on (BC || DC) && !FEATURE_DC_SMALL
122 //config: Enable long options for bc and dc.
124 //applet:IF_BC(APPLET(bc, BB_DIR_USR_BIN, BB_SUID_DROP))
125 //applet:IF_DC(APPLET(dc, BB_DIR_USR_BIN, BB_SUID_DROP))
127 //kbuild:lib-$(CONFIG_BC) += bc.o
128 //kbuild:lib-$(CONFIG_DC) += bc.o
130 //See www.gnu.org/software/bc/manual/bc.html
131 //usage:#define bc_trivial_usage
132 //usage: "[-sqliw] FILE..."
134 //usage:#define bc_full_usage "\n"
135 //usage: "\nArbitrary precision calculator"
137 ///////: "\n -i Interactive" - has no effect for now
138 //usage: "\n -q Quiet"
139 //usage: "\n -l Load standard math library"
140 //usage: "\n -s Be POSIX compatible"
141 //usage: "\n -w Warn if extensions are used"
142 ///////: "\n -v Version"
144 //usage: "\n$BC_LINE_LENGTH changes output width"
146 //usage:#define bc_example_usage
147 //usage: "3 + 4.129\n"
148 //usage: "1903 - 2893\n"
149 //usage: "-129 * 213.28935\n"
150 //usage: "12 / -1932\n"
152 //usage: "34 ^ 189\n"
153 //usage: "scale = 13\n"
154 //usage: "ibase = 2\n"
155 //usage: "obase = A\n"
157 //usage:#define dc_trivial_usage
158 //usage: "[-eSCRIPT]... [-fFILE]... [FILE]..."
160 //usage:#define dc_full_usage "\n"
161 //usage: "\nTiny RPN calculator. Operations:"
162 //usage: "\n+, -, *, /, %, ^, exp, ~, divmod, |, "
163 //usage: "modular exponentiation,"
164 //usage: "\np - print top of the stack (without popping)"
165 //usage: "\nf - print entire stack"
166 //usage: "\nk - pop the value and set the precision"
167 //usage: "\ni - pop the value and set input radix"
168 //usage: "\no - pop the value and set output radix"
169 //usage: "\nExamples: dc -e'2 2 + p' -> 4, dc -e'8 8 * 2 2 + / p' -> 16"
171 //usage:#define dc_example_usage
172 //usage: "$ dc -e'2 2 + p'\n"
174 //usage: "$ dc -e'8 8 \\* 2 2 + / p'\n"
176 //usage: "$ dc -e'0 1 & p'\n"
178 //usage: "$ dc -e'0 1 | p'\n"
180 //usage: "$ echo '72 9 / 8 * p' | dc\n"
184 #include "common_bufsiz.h"
186 #if ENABLE_FEATURE_DC_SMALL
190 typedef enum BcStatus {
191 BC_STATUS_SUCCESS = 0,
192 BC_STATUS_FAILURE = 1,
193 BC_STATUS_PARSE_EMPTY_EXP = 2, // bc_parse_expr() uses this
194 BC_STATUS_EOF = 3, // bc_vm_stdin() uses this
197 #define BC_VEC_INVALID_IDX ((size_t) -1)
198 #define BC_VEC_START_CAP (1 << 5)
200 typedef void (*BcVecFree)(void *);
202 typedef struct BcVec {
210 typedef signed char BcDig;
212 typedef struct BcNum {
220 #define BC_NUM_MIN_BASE ((unsigned long) 2)
221 #define BC_NUM_MAX_IBASE ((unsigned long) 16)
222 // larger value might speed up BIGNUM calculations a bit:
223 #define BC_NUM_DEF_SIZE (16)
224 #define BC_NUM_PRINT_WIDTH (69)
226 #define BC_NUM_KARATSUBA_LEN (32)
228 typedef BcStatus (*BcNumBinaryOp)(BcNum *, BcNum *, BcNum *, size_t);
229 typedef void (*BcNumDigitOp)(size_t, size_t, bool, size_t *, size_t);
231 static BcStatus bc_num_add(BcNum *a, BcNum *b, BcNum *c, size_t scale);
232 static BcStatus bc_num_sub(BcNum *a, BcNum *b, BcNum *c, size_t scale);
233 static BcStatus bc_num_mul(BcNum *a, BcNum *b, BcNum *c, size_t scale);
234 static BcStatus bc_num_div(BcNum *a, BcNum *b, BcNum *c, size_t scale);
235 static BcStatus bc_num_mod(BcNum *a, BcNum *b, BcNum *c, size_t scale);
236 static BcStatus bc_num_pow(BcNum *a, BcNum *b, BcNum *c, size_t scale);
237 static BcStatus bc_num_sqrt(BcNum *a, BcNum *b, size_t scale);
238 static BcStatus bc_num_divmod(BcNum *a, BcNum *b, BcNum *c, BcNum *d,
241 typedef enum BcInst {
271 BC_INST_ASSIGN_POWER,
272 BC_INST_ASSIGN_MULTIPLY,
273 BC_INST_ASSIGN_DIVIDE,
274 BC_INST_ASSIGN_MODULUS,
276 BC_INST_ASSIGN_MINUS,
322 BC_INST_PRINT_STREAM,
337 BC_INST_INVALID = -1,
342 typedef struct BcId {
347 typedef struct BcFunc {
354 typedef enum BcResultType {
359 BC_RESULT_ARRAY_ELEM,
368 // These are between to calculate ibase, obase, and last from instructions.
376 typedef union BcResultData {
382 typedef struct BcResult {
387 typedef struct BcInstPtr {
393 // BC_LEX_NEG is not used in lexing; it is only for parsing.
394 typedef enum BcLexType {
422 BC_LEX_OP_ASSIGN_POWER,
423 BC_LEX_OP_ASSIGN_MULTIPLY,
424 BC_LEX_OP_ASSIGN_DIVIDE,
425 BC_LEX_OP_ASSIGN_MODULUS,
426 BC_LEX_OP_ASSIGN_PLUS,
427 BC_LEX_OP_ASSIGN_MINUS,
448 BC_LEX_KEY_1st_keyword,
449 BC_LEX_KEY_AUTO = BC_LEX_KEY_1st_keyword,
456 // code uses "type - BC_LEX_KEY_IBASE + BC_INST_IBASE" construct,
457 BC_LEX_KEY_IBASE, // relative order should match for: BC_INST_IBASE
459 BC_LEX_KEY_LAST, // relative order should match for: BC_INST_LAST
462 BC_LEX_KEY_OBASE, // relative order should match for: BC_INST_OBASE
500 // must match order of BC_LEX_KEY_foo etc above
502 struct BcLexKeyword {
505 #define BC_LEX_KW_ENTRY(a, b) \
506 { .name8 = a /*, .posix = b */ }
507 static const struct BcLexKeyword bc_lex_kws[20] = {
508 BC_LEX_KW_ENTRY("auto" , 1), // 0
509 BC_LEX_KW_ENTRY("break" , 1), // 1
510 BC_LEX_KW_ENTRY("continue", 0), // 2 note: this one has no terminating NUL
511 BC_LEX_KW_ENTRY("define" , 1), // 3
513 BC_LEX_KW_ENTRY("else" , 0), // 4
514 BC_LEX_KW_ENTRY("for" , 1), // 5
515 BC_LEX_KW_ENTRY("halt" , 0), // 6
516 BC_LEX_KW_ENTRY("ibase" , 1), // 7
518 BC_LEX_KW_ENTRY("if" , 1), // 8
519 BC_LEX_KW_ENTRY("last" , 0), // 9
520 BC_LEX_KW_ENTRY("length" , 1), // 10
521 BC_LEX_KW_ENTRY("limits" , 0), // 11
523 BC_LEX_KW_ENTRY("obase" , 1), // 12
524 BC_LEX_KW_ENTRY("print" , 0), // 13
525 BC_LEX_KW_ENTRY("quit" , 1), // 14
526 BC_LEX_KW_ENTRY("read" , 0), // 15
528 BC_LEX_KW_ENTRY("return" , 1), // 16
529 BC_LEX_KW_ENTRY("scale" , 1), // 17
530 BC_LEX_KW_ENTRY("sqrt" , 1), // 18
531 BC_LEX_KW_ENTRY("while" , 1), // 19
533 #undef BC_LEX_KW_ENTRY
561 #define bc_lex_kws_POSIX(i) ((1 << (i)) & POSIX_KWORD_MASK)
565 typedef BcStatus (*BcLexNext)(struct BcLex *);
567 typedef struct BcLex {
585 #define BC_PARSE_STREND ((char) UCHAR_MAX)
587 #define BC_PARSE_REL (1 << 0)
588 #define BC_PARSE_PRINT (1 << 1)
589 #define BC_PARSE_NOCALL (1 << 2)
590 #define BC_PARSE_NOREAD (1 << 3)
591 #define BC_PARSE_ARRAY (1 << 4)
593 #define BC_PARSE_TOP_FLAG_PTR(parse) ((uint8_t *) bc_vec_top(&(parse)->flags))
594 #define BC_PARSE_TOP_FLAG(parse) (*(BC_PARSE_TOP_FLAG_PTR(parse)))
596 #define BC_PARSE_FLAG_FUNC_INNER (1 << 0)
597 #define BC_PARSE_FUNC_INNER(parse) \
598 (BC_PARSE_TOP_FLAG(parse) & BC_PARSE_FLAG_FUNC_INNER)
600 #define BC_PARSE_FLAG_FUNC (1 << 1)
601 #define BC_PARSE_FUNC(parse) (BC_PARSE_TOP_FLAG(parse) & BC_PARSE_FLAG_FUNC)
603 #define BC_PARSE_FLAG_BODY (1 << 2)
604 #define BC_PARSE_BODY(parse) (BC_PARSE_TOP_FLAG(parse) & BC_PARSE_FLAG_BODY)
606 #define BC_PARSE_FLAG_LOOP (1 << 3)
607 #define BC_PARSE_LOOP(parse) (BC_PARSE_TOP_FLAG(parse) & BC_PARSE_FLAG_LOOP)
609 #define BC_PARSE_FLAG_LOOP_INNER (1 << 4)
610 #define BC_PARSE_LOOP_INNER(parse) \
611 (BC_PARSE_TOP_FLAG(parse) & BC_PARSE_FLAG_LOOP_INNER)
613 #define BC_PARSE_FLAG_IF (1 << 5)
614 #define BC_PARSE_IF(parse) (BC_PARSE_TOP_FLAG(parse) & BC_PARSE_FLAG_IF)
616 #define BC_PARSE_FLAG_ELSE (1 << 6)
617 #define BC_PARSE_ELSE(parse) (BC_PARSE_TOP_FLAG(parse) & BC_PARSE_FLAG_ELSE)
619 #define BC_PARSE_FLAG_IF_END (1 << 7)
620 #define BC_PARSE_IF_END(parse) (BC_PARSE_TOP_FLAG(parse) & BC_PARSE_FLAG_IF_END)
622 #define BC_PARSE_CAN_EXEC(parse) \
623 (!(BC_PARSE_TOP_FLAG(parse) & \
624 (BC_PARSE_FLAG_FUNC_INNER | BC_PARSE_FLAG_FUNC | BC_PARSE_FLAG_BODY | \
625 BC_PARSE_FLAG_LOOP | BC_PARSE_FLAG_LOOP_INNER | BC_PARSE_FLAG_IF | \
626 BC_PARSE_FLAG_ELSE | BC_PARSE_FLAG_IF_END)))
632 typedef BcStatus (*BcParseParse)(struct BcParse *);
634 typedef struct BcParse {
655 typedef struct BcProgram {
696 #define BC_PROG_STACK(s, n) ((s)->len >= ((size_t) n))
698 #define BC_PROG_MAIN (0)
699 #define BC_PROG_READ (1)
701 #define BC_PROG_REQ_FUNCS (2)
704 #define BC_PROG_STR(n) (!(n)->num && !(n)->cap)
705 #define BC_PROG_NUM(r, n) \
706 ((r)->t != BC_RESULT_ARRAY && (r)->t != BC_RESULT_STR && !BC_PROG_STR(n))
708 typedef unsigned long (*BcProgramBuiltIn)(BcNum *);
710 #define BC_FLAG_W (1 << 0)
711 #define BC_FLAG_V (1 << 1)
712 #define BC_FLAG_S (1 << 2)
713 #define BC_FLAG_Q (1 << 3)
714 #define BC_FLAG_L (1 << 4)
715 #define BC_FLAG_I (1 << 5)
716 #define DC_FLAG_X (1 << 6)
718 #define BC_MAX(a, b) ((a) > (b) ? (a) : (b))
719 #define BC_MIN(a, b) ((a) < (b) ? (a) : (b))
721 #define BC_MAX_OBASE ((unsigned) 999)
722 #define BC_MAX_DIM ((unsigned) INT_MAX)
723 #define BC_MAX_SCALE ((unsigned) UINT_MAX)
724 #define BC_MAX_STRING ((unsigned) UINT_MAX - 1)
725 #define BC_MAX_NUM BC_MAX_STRING
726 // Unused apart from "limits" message. Just show a "biggish number" there.
727 //#define BC_MAX_NAME BC_MAX_STRING
728 //#define BC_MAX_EXP ((unsigned long) LONG_MAX)
729 //#define BC_MAX_VARS ((unsigned long) SIZE_MAX - 1)
730 #define BC_MAX_NAME_STR "999999999"
731 #define BC_MAX_EXP_STR "999999999"
732 #define BC_MAX_VARS_STR "999999999"
734 #define BC_MAX_OBASE_STR "999"
736 #if INT_MAX == 2147483647
737 # define BC_MAX_DIM_STR "2147483647"
738 #elif INT_MAX == 9223372036854775807
739 # define BC_MAX_DIM_STR "9223372036854775807"
741 # error Strange INT_MAX
744 #if UINT_MAX == 4294967295
745 # define BC_MAX_SCALE_STR "4294967295"
746 # define BC_MAX_STRING_STR "4294967294"
747 #elif UINT_MAX == 18446744073709551615
748 # define BC_MAX_SCALE_STR "18446744073709551615"
749 # define BC_MAX_STRING_STR "18446744073709551614"
751 # error Strange UINT_MAX
753 #define BC_MAX_NUM_STR BC_MAX_STRING_STR
756 IF_FEATURE_BC_SIGNALS(smallint ttyin;)
757 IF_FEATURE_CLEAN_UP(smallint exiting;)
764 // For error messages. Can be set to current parsed line,
765 // or [TODO] to current executing line (can be before last parsed one)
772 #if ENABLE_FEATURE_EDITING
773 line_input_t *line_input_state;
776 #define G (*ptr_to_globals)
777 #define INIT_G() do { \
778 SET_PTR_TO_GLOBALS(xzalloc(sizeof(G))); \
780 #define FREE_G() do { \
781 FREE_PTR_TO_GLOBALS(); \
783 #define G_posix (ENABLE_BC && (option_mask32 & BC_FLAG_S))
784 #define G_warn (ENABLE_BC && (option_mask32 & BC_FLAG_W))
785 #define G_exreg (ENABLE_DC && (option_mask32 & DC_FLAG_X))
786 #if ENABLE_FEATURE_BC_SIGNALS
787 # define G_interrupt bb_got_signal
788 # define G_ttyin G.ttyin
790 # define G_interrupt 0
793 #if ENABLE_FEATURE_CLEAN_UP
794 # define G_exiting G.exiting
798 #define IS_BC (ENABLE_BC && (!ENABLE_DC || applet_name[0] == 'b'))
802 // This is a bit array that corresponds to token types. An entry is
803 // true if the token is valid in an expression, false otherwise.
805 BC_PARSE_EXPRS_BITS = 0
806 + ((uint64_t)((0 << 0)+(0 << 1)+(1 << 2)+(1 << 3)+(1 << 4)+(1 << 5)+(1 << 6)+(1 << 7)) << (0*8))
807 + ((uint64_t)((1 << 0)+(1 << 1)+(1 << 2)+(1 << 3)+(1 << 4)+(1 << 5)+(1 << 6)+(1 << 7)) << (1*8))
808 + ((uint64_t)((1 << 0)+(1 << 1)+(1 << 2)+(1 << 3)+(1 << 4)+(1 << 5)+(1 << 6)+(1 << 7)) << (2*8))
809 + ((uint64_t)((1 << 0)+(1 << 1)+(1 << 2)+(0 << 3)+(0 << 4)+(1 << 5)+(1 << 6)+(0 << 7)) << (3*8))
810 + ((uint64_t)((0 << 0)+(0 << 1)+(0 << 2)+(0 << 3)+(0 << 4)+(0 << 5)+(1 << 6)+(1 << 7)) << (4*8))
811 + ((uint64_t)((0 << 0)+(0 << 1)+(0 << 2)+(0 << 3)+(0 << 4)+(0 << 5)+(0 << 6)+(1 << 7)) << (5*8))
812 + ((uint64_t)((0 << 0)+(1 << 1)+(1 << 2)+(1 << 3)+(1 << 4)+(0 << 5)+(0 << 6)+(1 << 7)) << (6*8))
813 + ((uint64_t)((0 << 0)+(1 << 1)+(1 << 2)+(0 << 3) ) << (7*8))
815 static ALWAYS_INLINE long bc_parse_exprs(unsigned i)
817 #if ULONG_MAX > 0xffffffff
818 // 64-bit version (will not work correctly for 32-bit longs!)
819 return BC_PARSE_EXPRS_BITS & (1UL << i);
822 unsigned long m = (uint32_t)BC_PARSE_EXPRS_BITS;
824 m = (uint32_t)(BC_PARSE_EXPRS_BITS >> 32);
827 return m & (1UL << i);
831 // This is an array of data for operators that correspond to token types.
832 static const uint8_t bc_parse_ops[] = {
833 #define OP(p,l) ((int)(l) * 0x10 + (p))
834 OP(0, false), OP( 0, false ), // inc dec
837 OP(3, true ), OP( 3, true ), OP( 3, true ), // pow mul div
838 OP(4, true ), OP( 4, true ), // mod + -
839 OP(6, true ), OP( 6, true ), OP( 6, true ), OP( 6, true ), OP( 6, true ), OP( 6, true ), // == <= >= != < >
841 OP(7, true ), OP( 7, true ), // or and
842 OP(5, false), OP( 5, false ), OP( 5, false ), OP( 5, false ), OP( 5, false ), // ^= *= /= %= +=
843 OP(5, false), OP( 5, false ), // -= =
846 #define bc_parse_op_PREC(i) (bc_parse_ops[i] & 0x0f)
847 #define bc_parse_op_LEFT(i) (bc_parse_ops[i] & 0x10)
849 // Byte array of up to 4 BC_LEX's, packed into 32-bit word
850 typedef uint32_t BcParseNext;
852 // These identify what tokens can come after expressions in certain cases.
854 #define BC_PARSE_NEXT4(a,b,c,d) ( (a) | ((b)<<8) | ((c)<<16) | ((((d)|0x80)<<24)) )
855 #define BC_PARSE_NEXT2(a,b) BC_PARSE_NEXT4(a,b,0xff,0xff)
856 #define BC_PARSE_NEXT1(a) BC_PARSE_NEXT4(a,0xff,0xff,0xff)
857 bc_parse_next_expr = BC_PARSE_NEXT4(BC_LEX_NLINE, BC_LEX_SCOLON, BC_LEX_RBRACE, BC_LEX_EOF),
858 bc_parse_next_param = BC_PARSE_NEXT2(BC_LEX_RPAREN, BC_LEX_COMMA),
859 bc_parse_next_print = BC_PARSE_NEXT4(BC_LEX_COMMA, BC_LEX_NLINE, BC_LEX_SCOLON, BC_LEX_EOF),
860 bc_parse_next_rel = BC_PARSE_NEXT1(BC_LEX_RPAREN),
861 bc_parse_next_elem = BC_PARSE_NEXT1(BC_LEX_RBRACKET),
862 bc_parse_next_for = BC_PARSE_NEXT1(BC_LEX_SCOLON),
863 bc_parse_next_read = BC_PARSE_NEXT2(BC_LEX_NLINE, BC_LEX_EOF),
864 #undef BC_PARSE_NEXT4
865 #undef BC_PARSE_NEXT2
866 #undef BC_PARSE_NEXT1
871 static const //BcLexType - should be this type, but narrower type saves size:
874 BC_LEX_OP_REL_EQ, BC_LEX_OP_REL_LE, BC_LEX_OP_REL_GE, BC_LEX_OP_REL_NE,
875 BC_LEX_OP_REL_LT, BC_LEX_OP_REL_GT, BC_LEX_SCOLON, BC_LEX_COLON,
876 BC_LEX_ELSE, BC_LEX_LOAD, BC_LEX_LOAD_POP, BC_LEX_OP_ASSIGN,
880 static const //BcLexType - should be this type
883 BC_LEX_OP_MODULUS, BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_LPAREN,
884 BC_LEX_INVALID, BC_LEX_OP_MULTIPLY, BC_LEX_OP_PLUS, BC_LEX_INVALID,
885 BC_LEX_OP_MINUS, BC_LEX_INVALID, BC_LEX_OP_DIVIDE,
886 BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID,
887 BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID,
888 BC_LEX_INVALID, BC_LEX_INVALID,
889 BC_LEX_COLON, BC_LEX_SCOLON, BC_LEX_OP_REL_GT, BC_LEX_OP_REL_EQ,
890 BC_LEX_OP_REL_LT, BC_LEX_KEY_READ, BC_LEX_INVALID,
891 BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID,
892 BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_EQ_NO_REG, BC_LEX_INVALID,
893 BC_LEX_KEY_IBASE, BC_LEX_INVALID, BC_LEX_KEY_SCALE, BC_LEX_LOAD_POP,
894 BC_LEX_INVALID, BC_LEX_OP_BOOL_NOT, BC_LEX_KEY_OBASE, BC_LEX_PRINT_STREAM,
895 BC_LEX_NQUIT, BC_LEX_POP, BC_LEX_STORE_PUSH, BC_LEX_INVALID, BC_LEX_INVALID,
896 BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_SCALE_FACTOR, BC_LEX_INVALID,
897 BC_LEX_KEY_LENGTH, BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID,
898 BC_LEX_OP_POWER, BC_LEX_NEG, BC_LEX_INVALID,
899 BC_LEX_ASCIIFY, BC_LEX_INVALID, BC_LEX_CLEAR_STACK, BC_LEX_DUPLICATE,
900 BC_LEX_ELSE, BC_LEX_PRINT_STACK, BC_LEX_INVALID, BC_LEX_INVALID,
901 BC_LEX_STORE_IBASE, BC_LEX_INVALID, BC_LEX_STORE_SCALE, BC_LEX_LOAD,
902 BC_LEX_INVALID, BC_LEX_PRINT_POP, BC_LEX_STORE_OBASE, BC_LEX_KEY_PRINT,
903 BC_LEX_KEY_QUIT, BC_LEX_SWAP, BC_LEX_OP_ASSIGN, BC_LEX_INVALID,
904 BC_LEX_INVALID, BC_LEX_KEY_SQRT, BC_LEX_INVALID, BC_LEX_EXECUTE,
905 BC_LEX_INVALID, BC_LEX_STACK_LEVEL,
906 BC_LEX_LBRACE, BC_LEX_OP_MODEXP, BC_LEX_INVALID, BC_LEX_OP_DIVMOD,
910 static const //BcInst - should be this type. Using signed narrow type since BC_INST_INVALID is -1
913 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID, BC_INST_REL_GE,
914 BC_INST_INVALID, BC_INST_POWER, BC_INST_MULTIPLY, BC_INST_DIVIDE,
915 BC_INST_MODULUS, BC_INST_PLUS, BC_INST_MINUS,
916 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID,
917 BC_INST_INVALID, BC_INST_INVALID,
918 BC_INST_BOOL_NOT, BC_INST_INVALID, BC_INST_INVALID,
919 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID,
920 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID,
921 BC_INST_INVALID, BC_INST_INVALID, BC_INST_REL_GT, BC_INST_INVALID,
922 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID, BC_INST_REL_GE,
923 BC_INST_INVALID, BC_INST_INVALID,
924 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID,
925 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID,
926 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID, BC_INST_IBASE,
927 BC_INST_INVALID, BC_INST_INVALID, BC_INST_LENGTH, BC_INST_INVALID,
928 BC_INST_OBASE, BC_INST_PRINT, BC_INST_QUIT, BC_INST_INVALID,
929 BC_INST_INVALID, BC_INST_SCALE, BC_INST_SQRT, BC_INST_INVALID,
930 BC_INST_REL_EQ, BC_INST_MODEXP, BC_INST_DIVMOD, BC_INST_INVALID,
931 BC_INST_INVALID, BC_INST_EXECUTE, BC_INST_PRINT_STACK, BC_INST_CLEAR_STACK,
932 BC_INST_STACK_LEN, BC_INST_DUPLICATE, BC_INST_SWAP, BC_INST_POP,
933 BC_INST_ASCIIFY, BC_INST_PRINT_STREAM, BC_INST_INVALID, BC_INST_INVALID,
934 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID,
935 BC_INST_PRINT, BC_INST_NQUIT, BC_INST_SCALE_FUNC,
939 static const BcNumBinaryOp bc_program_ops[] = {
940 bc_num_pow, bc_num_mul, bc_num_div, bc_num_mod, bc_num_add, bc_num_sub,
943 static void fflush_and_check(void)
946 if (ferror(stdout) || ferror(stderr))
947 bb_perror_msg_and_die("output error");
950 #if ENABLE_FEATURE_CLEAN_UP
951 #define QUIT_OR_RETURN_TO_MAIN \
953 IF_FEATURE_BC_SIGNALS(G_ttyin = 0;) /* do not loop in main loop anymore */ \
955 return BC_STATUS_FAILURE; \
958 #define QUIT_OR_RETURN_TO_MAIN quit()
961 static void quit(void) NORETURN;
962 static void quit(void)
965 bb_perror_msg_and_die("input error");
970 static void bc_verror_msg(const char *fmt, va_list p)
972 const char *sv = sv; /* for compiler */
975 applet_name = xasprintf("%s: %s:%u", applet_name, G.prog.file, G.err_line);
977 bb_verror_msg(fmt, p, NULL);
979 free((char*)applet_name);
984 static NOINLINE int bc_error_fmt(const char *fmt, ...)
989 bc_verror_msg(fmt, p);
992 if (!ENABLE_FEATURE_CLEAN_UP && !G_ttyin)
994 return BC_STATUS_FAILURE;
998 static NOINLINE int bc_posix_error_fmt(const char *fmt, ...)
1002 // Are non-POSIX constructs totally ok?
1003 if (!(option_mask32 & (BC_FLAG_S|BC_FLAG_W)))
1004 return BC_STATUS_SUCCESS; // yes
1007 bc_verror_msg(fmt, p);
1010 // Do we treat non-POSIX constructs as errors?
1011 if (!(option_mask32 & BC_FLAG_S))
1012 return BC_STATUS_SUCCESS; // no, it's a warning
1013 if (!ENABLE_FEATURE_CLEAN_UP && !G_ttyin)
1015 return BC_STATUS_FAILURE;
1019 // We use error functions with "return bc_error(FMT[, PARAMS])" idiom.
1020 // This idiom begs for tail-call optimization, but for it to work,
1021 // function must not have caller-cleaned parameters on stack.
1022 // Unfortunately, vararg function API does exactly that on most arches.
1023 // Thus, use these shims for the cases when we have no vararg PARAMS:
1024 static int bc_error(const char *msg)
1026 return bc_error_fmt("%s", msg);
1029 static int bc_POSIX_requires(const char *msg)
1031 return bc_posix_error_fmt("POSIX requires %s", msg);
1033 static int bc_POSIX_does_not_allow(const char *msg)
1035 return bc_posix_error_fmt("%s%s", "POSIX does not allow ", msg);
1037 static int bc_POSIX_does_not_allow_bool_ops_this_is_bad(const char *msg)
1039 return bc_posix_error_fmt("%s%s %s", "POSIX does not allow ", "boolean operators; the following is bad:", msg);
1041 static int bc_POSIX_does_not_allow_empty_X_expression_in_for(const char *msg)
1043 return bc_posix_error_fmt("%san empty %s expression in a for loop", "POSIX does not allow ", msg);
1046 static int bc_error_bad_character(char c)
1048 return bc_error_fmt("bad character '%c'", c);
1050 static int bc_error_bad_expression(void)
1052 return bc_error("bad expression");
1054 static int bc_error_bad_token(void)
1056 return bc_error("bad token");
1058 static int bc_error_stack_has_too_few_elements(void)
1060 return bc_error("stack has too few elements");
1062 static int bc_error_variable_is_wrong_type(void)
1064 return bc_error("variable is wrong type");
1066 static int bc_error_nested_read_call(void)
1068 return bc_error("read() call inside of a read() call");
1071 static void bc_vec_grow(BcVec *v, size_t n)
1073 size_t cap = v->cap * 2;
1074 while (cap < v->len + n) cap *= 2;
1075 v->v = xrealloc(v->v, v->size * cap);
1079 static void bc_vec_init(BcVec *v, size_t esize, BcVecFree dtor)
1082 v->cap = BC_VEC_START_CAP;
1085 v->v = xmalloc(esize * BC_VEC_START_CAP);
1088 static void bc_char_vec_init(BcVec *v)
1090 bc_vec_init(v, sizeof(char), NULL);
1093 static void bc_vec_expand(BcVec *v, size_t req)
1096 v->v = xrealloc(v->v, v->size * req);
1101 static void bc_vec_pop(BcVec *v)
1105 v->dtor(v->v + (v->size * v->len));
1108 static void bc_vec_npop(BcVec *v, size_t n)
1113 size_t len = v->len - n;
1114 while (v->len > len) v->dtor(v->v + (v->size * --v->len));
1118 static void bc_vec_pop_all(BcVec *v)
1120 bc_vec_npop(v, v->len);
1123 static void bc_vec_push(BcVec *v, const void *data)
1125 if (v->len + 1 > v->cap) bc_vec_grow(v, 1);
1126 memmove(v->v + (v->size * v->len), data, v->size);
1130 static void bc_vec_pushByte(BcVec *v, char data)
1132 bc_vec_push(v, &data);
1135 static void bc_vec_pushZeroByte(BcVec *v)
1137 //bc_vec_pushByte(v, '\0');
1139 bc_vec_push(v, &const_int_0);
1142 static void bc_vec_pushAt(BcVec *v, const void *data, size_t idx)
1145 bc_vec_push(v, data);
1150 if (v->len == v->cap) bc_vec_grow(v, 1);
1152 ptr = v->v + v->size * idx;
1154 memmove(ptr + v->size, ptr, v->size * (v->len++ - idx));
1155 memmove(ptr, data, v->size);
1159 static void bc_vec_string(BcVec *v, size_t len, const char *str)
1162 bc_vec_expand(v, len + 1);
1163 memcpy(v->v, str, len);
1166 bc_vec_pushZeroByte(v);
1169 static void bc_vec_concat(BcVec *v, const char *str)
1173 if (v->len == 0) bc_vec_pushZeroByte(v);
1175 len = v->len + strlen(str);
1177 if (v->cap < len) bc_vec_grow(v, len - v->len);
1178 strcpy(v->v + v->len - 1, str);
1183 static void *bc_vec_item(const BcVec *v, size_t idx)
1185 return v->v + v->size * idx;
1188 static void *bc_vec_item_rev(const BcVec *v, size_t idx)
1190 return v->v + v->size * (v->len - idx - 1);
1193 static void *bc_vec_top(const BcVec *v)
1195 return v->v + v->size * (v->len - 1);
1198 static void bc_vec_free(void *vec)
1200 BcVec *v = (BcVec *) vec;
1205 static int bc_id_cmp(const void *e1, const void *e2)
1207 return strcmp(((const BcId *) e1)->name, ((const BcId *) e2)->name);
1210 static void bc_id_free(void *id)
1212 free(((BcId *) id)->name);
1215 static size_t bc_map_find(const BcVec *v, const void *ptr)
1217 size_t low = 0, high = v->len;
1219 while (low < high) {
1221 size_t mid = (low + high) / 2;
1222 BcId *id = bc_vec_item(v, mid);
1223 int result = bc_id_cmp(ptr, id);
1227 else if (result < 0)
1236 static int bc_map_insert(BcVec *v, const void *ptr, size_t *i)
1238 size_t n = *i = bc_map_find(v, ptr);
1241 bc_vec_push(v, ptr);
1242 else if (!bc_id_cmp(ptr, bc_vec_item(v, n)))
1243 return 0; // "was not inserted"
1245 bc_vec_pushAt(v, ptr, n);
1246 return 1; // "was inserted"
1250 static size_t bc_map_index(const BcVec *v, const void *ptr)
1252 size_t i = bc_map_find(v, ptr);
1253 if (i >= v->len) return BC_VEC_INVALID_IDX;
1254 return bc_id_cmp(ptr, bc_vec_item(v, i)) ? BC_VEC_INVALID_IDX : i;
1258 static int push_input_byte(BcVec *vec, char c)
1260 if ((c < ' ' && c != '\t' && c != '\r' && c != '\n') // also allow '\v' '\f'?
1263 // Bad chars on this line, ignore entire line
1264 bc_error_fmt("illegal character 0x%02x", c);
1267 bc_vec_pushByte(vec, (char)c);
1271 static BcStatus bc_read_line(BcVec *vec, const char *prompt)
1276 if (G_posix) prompt = "";
1278 s = BC_STATUS_SUCCESS;
1283 bc_vec_pop_all(vec);
1287 #if ENABLE_FEATURE_BC_SIGNALS
1288 if (G_interrupt) { // ^C was pressed
1292 ? "\ninterrupt (type \"quit\" to exit)\n"
1293 : "\ninterrupt (type \"q\" to exit)\n"
1296 # if ENABLE_FEATURE_EDITING
1299 # define line_buf bb_common_bufsiz1
1300 n = read_line_input(G.line_input_state, prompt, line_buf, COMMON_BUFSIZE);
1301 if (n <= 0) { // read errors or EOF, or ^D, or ^C
1311 bad_chars |= push_input_byte(vec, c);
1319 fputs(prompt, stderr);
1320 IF_FEATURE_BC_SIGNALS(errno = 0;)
1323 #if ENABLE_FEATURE_BC_SIGNALS && !ENABLE_FEATURE_EDITING
1324 // Both conditions appear simultaneously, check both just in case
1325 if (errno == EINTR || G_interrupt) {
1333 quit(); // this emits error message
1335 // Note: EOF does not append '\n', therefore:
1336 // printf 'print 123\n' | bc - works
1337 // printf 'print 123' | bc - fails (syntax error)
1340 bad_chars |= push_input_byte(vec, c);
1341 } while (c != '\n');
1343 } while (bad_chars);
1345 bc_vec_pushZeroByte(vec);
1350 static char* bc_read_file(const char *path)
1353 size_t size = ((size_t) -1);
1356 // Never returns NULL (dies on errors)
1357 buf = xmalloc_xopen_read_close(path, &size);
1359 for (i = 0; i < size; ++i) {
1361 if ((c < ' ' && c != '\t' && c != '\r' && c != '\n') // also allow '\v' '\f'?
1373 static void bc_num_setToZero(BcNum *n, size_t scale)
1380 static void bc_num_zero(BcNum *n)
1382 bc_num_setToZero(n, 0);
1385 static void bc_num_one(BcNum *n)
1387 bc_num_setToZero(n, 0);
1392 static void bc_num_ten(BcNum *n)
1394 bc_num_setToZero(n, 0);
1400 static void bc_num_init(BcNum *n, size_t req)
1402 req = req >= BC_NUM_DEF_SIZE ? req : BC_NUM_DEF_SIZE;
1403 memset(n, 0, sizeof(BcNum));
1404 n->num = xmalloc(req);
1408 static void bc_num_expand(BcNum *n, size_t req)
1410 req = req >= BC_NUM_DEF_SIZE ? req : BC_NUM_DEF_SIZE;
1412 n->num = xrealloc(n->num, req);
1417 static void bc_num_free(void *num)
1419 free(((BcNum *) num)->num);
1422 static void bc_num_copy(BcNum *d, BcNum *s)
1425 bc_num_expand(d, s->cap);
1429 memcpy(d->num, s->num, sizeof(BcDig) * d->len);
1433 static BcStatus bc_num_ulong(BcNum *n, unsigned long *result_p)
1436 unsigned long pow, result;
1438 if (n->neg) return bc_error("negative number");
1440 for (result = 0, pow = 1, i = n->rdx; i < n->len; ++i) {
1442 unsigned long prev = result, powprev = pow;
1444 result += ((unsigned long) n->num[i]) * pow;
1447 if (result < prev || pow < powprev)
1448 return bc_error("overflow");
1454 return BC_STATUS_SUCCESS;
1457 static void bc_num_ulong2num(BcNum *n, unsigned long val)
1465 if (val == 0) return;
1467 for (len = 1, i = ULONG_MAX; i != 0; i /= 10, ++len) bc_num_expand(n, len);
1468 for (ptr = n->num, i = 0; val; ++i, ++n->len, val /= 10) ptr[i] = val % 10;
1471 static void bc_num_subArrays(BcDig *restrict a, BcDig *restrict b,
1475 for (i = 0; i < len; ++i) {
1476 for (a[i] -= b[i], j = 0; a[i + j] < 0;) {
1483 #define BC_NUM_NEG(n, neg) ((((ssize_t)(n)) ^ -((ssize_t)(neg))) + (neg))
1484 #define BC_NUM_ONE(n) ((n)->len == 1 && (n)->rdx == 0 && (n)->num[0] == 1)
1485 #define BC_NUM_INT(n) ((n)->len - (n)->rdx)
1486 //#define BC_NUM_AREQ(a, b) (BC_MAX((a)->rdx, (b)->rdx) + BC_MAX(BC_NUM_INT(a), BC_NUM_INT(b)) + 1)
1487 static /*ALWAYS_INLINE*/ size_t BC_NUM_AREQ(BcNum *a, BcNum *b)
1489 return BC_MAX(a->rdx, b->rdx) + BC_MAX(BC_NUM_INT(a), BC_NUM_INT(b)) + 1;
1491 //#define BC_NUM_MREQ(a, b, scale) (BC_NUM_INT(a) + BC_NUM_INT(b) + BC_MAX((scale), (a)->rdx + (b)->rdx) + 1)
1492 static /*ALWAYS_INLINE*/ size_t BC_NUM_MREQ(BcNum *a, BcNum *b, size_t scale)
1494 return BC_NUM_INT(a) + BC_NUM_INT(b) + BC_MAX(scale, a->rdx + b->rdx) + 1;
1497 static ssize_t bc_num_compare(BcDig *restrict a, BcDig *restrict b, size_t len)
1501 for (i = len - 1; i < len && !(c = a[i] - b[i]); --i);
1502 return BC_NUM_NEG(i + 1, c < 0);
1505 static ssize_t bc_num_cmp(BcNum *a, BcNum *b)
1507 size_t i, min, a_int, b_int, diff;
1508 BcDig *max_num, *min_num;
1509 bool a_max, neg = false;
1512 if (a == b) return 0;
1513 if (a->len == 0) return BC_NUM_NEG(!!b->len, !b->neg);
1514 if (b->len == 0) return BC_NUM_NEG(1, a->neg);
1524 a_int = BC_NUM_INT(a);
1525 b_int = BC_NUM_INT(b);
1527 a_max = (a->rdx > b->rdx);
1529 if (a_int != 0) return (ssize_t) a_int;
1533 diff = a->rdx - b->rdx;
1534 max_num = a->num + diff;
1539 diff = b->rdx - a->rdx;
1540 max_num = b->num + diff;
1544 cmp = bc_num_compare(max_num, min_num, b_int + min);
1545 if (cmp != 0) return BC_NUM_NEG(cmp, (!a_max) != neg);
1547 for (max_num -= diff, i = diff - 1; i < diff; --i) {
1548 if (max_num[i]) return BC_NUM_NEG(1, (!a_max) != neg);
1554 static void bc_num_truncate(BcNum *n, size_t places)
1556 if (places == 0) return;
1562 memmove(n->num, n->num + places, n->len * sizeof(BcDig));
1566 static void bc_num_extend(BcNum *n, size_t places)
1568 size_t len = n->len + places;
1572 if (n->cap < len) bc_num_expand(n, len);
1574 memmove(n->num + places, n->num, sizeof(BcDig) * n->len);
1575 memset(n->num, 0, sizeof(BcDig) * places);
1582 static void bc_num_clean(BcNum *n)
1584 while (n->len > 0 && n->num[n->len - 1] == 0) --n->len;
1587 else if (n->len < n->rdx)
1591 static void bc_num_retireMul(BcNum *n, size_t scale, bool neg1, bool neg2)
1594 bc_num_extend(n, scale - n->rdx);
1596 bc_num_truncate(n, n->rdx - scale);
1599 if (n->len != 0) n->neg = !neg1 != !neg2;
1602 static void bc_num_split(BcNum *restrict n, size_t idx, BcNum *restrict a,
1607 b->len = n->len - idx;
1609 a->rdx = b->rdx = 0;
1611 memcpy(b->num, n->num + idx, b->len * sizeof(BcDig));
1612 memcpy(a->num, n->num, idx * sizeof(BcDig));
1623 static BcStatus bc_num_shift(BcNum *n, size_t places)
1625 if (places == 0 || n->len == 0) return BC_STATUS_SUCCESS;
1627 // This check makes sense only if size_t is (much) larger than BC_MAX_NUM.
1628 if (SIZE_MAX > (BC_MAX_NUM | 0xff)) {
1629 if (places + n->len > BC_MAX_NUM)
1630 return bc_error("number too long: must be [1,"BC_MAX_NUM_STR"]");
1633 if (n->rdx >= places)
1636 bc_num_extend(n, places - n->rdx);
1642 return BC_STATUS_SUCCESS;
1645 static BcStatus bc_num_inv(BcNum *a, BcNum *b, size_t scale)
1654 return bc_num_div(&one, a, b, scale);
1657 static BcStatus bc_num_a(BcNum *a, BcNum *b, BcNum *restrict c, size_t sub)
1659 BcDig *ptr, *ptr_a, *ptr_b, *ptr_c;
1660 size_t i, max, min_rdx, min_int, diff, a_int, b_int;
1663 // Because this function doesn't need to use scale (per the bc spec),
1664 // I am hijacking it to say whether it's doing an add or a subtract.
1668 if (sub && c->len) c->neg = !c->neg;
1669 return BC_STATUS_SUCCESS;
1671 else if (b->len == 0) {
1673 return BC_STATUS_SUCCESS;
1677 c->rdx = BC_MAX(a->rdx, b->rdx);
1678 min_rdx = BC_MIN(a->rdx, b->rdx);
1681 if (a->rdx > b->rdx) {
1682 diff = a->rdx - b->rdx;
1684 ptr_a = a->num + diff;
1688 diff = b->rdx - a->rdx;
1691 ptr_b = b->num + diff;
1694 for (ptr_c = c->num, i = 0; i < diff; ++i, ++c->len) ptr_c[i] = ptr[i];
1697 a_int = BC_NUM_INT(a);
1698 b_int = BC_NUM_INT(b);
1700 if (a_int > b_int) {
1711 for (carry = 0, i = 0; i < min_rdx + min_int; ++i, ++c->len) {
1712 in = ((int) ptr_a[i]) + ((int) ptr_b[i]) + carry;
1714 ptr_c[i] = (BcDig)(in % 10);
1717 for (; i < max + min_rdx; ++i, ++c->len) {
1718 in = ((int) ptr[i]) + carry;
1720 ptr_c[i] = (BcDig)(in % 10);
1723 if (carry != 0) c->num[c->len++] = (BcDig) carry;
1725 return BC_STATUS_SUCCESS; // can't make void, see bc_num_binary()
1728 static BcStatus bc_num_s(BcNum *a, BcNum *b, BcNum *restrict c, size_t sub)
1731 BcNum *minuend, *subtrahend;
1733 bool aneg, bneg, neg;
1735 // Because this function doesn't need to use scale (per the bc spec),
1736 // I am hijacking it to say whether it's doing an add or a subtract.
1740 if (sub && c->len) c->neg = !c->neg;
1741 return BC_STATUS_SUCCESS;
1743 else if (b->len == 0) {
1745 return BC_STATUS_SUCCESS;
1750 a->neg = b->neg = false;
1752 cmp = bc_num_cmp(a, b);
1758 bc_num_setToZero(c, BC_MAX(a->rdx, b->rdx));
1759 return BC_STATUS_SUCCESS;
1768 if (sub) neg = !neg;
1773 bc_num_copy(c, minuend);
1776 if (c->rdx < subtrahend->rdx) {
1777 bc_num_extend(c, subtrahend->rdx - c->rdx);
1781 start = c->rdx - subtrahend->rdx;
1783 bc_num_subArrays(c->num + start, subtrahend->num, subtrahend->len);
1787 return BC_STATUS_SUCCESS; // can't make void, see bc_num_binary()
1790 static BcStatus bc_num_k(BcNum *restrict a, BcNum *restrict b,
1794 size_t max = BC_MAX(a->len, b->len), max2 = (max + 1) / 2;
1795 BcNum l1, h1, l2, h2, m2, m1, z0, z1, z2, temp;
1798 if (a->len == 0 || b->len == 0) {
1800 return BC_STATUS_SUCCESS;
1802 aone = BC_NUM_ONE(a);
1803 if (aone || BC_NUM_ONE(b)) {
1804 bc_num_copy(c, aone ? b : a);
1805 return BC_STATUS_SUCCESS;
1808 if (a->len + b->len < BC_NUM_KARATSUBA_LEN ||
1809 a->len < BC_NUM_KARATSUBA_LEN || b->len < BC_NUM_KARATSUBA_LEN)
1814 bc_num_expand(c, a->len + b->len + 1);
1816 memset(c->num, 0, sizeof(BcDig) * c->cap);
1819 for (i = 0; i < b->len; ++i) {
1822 for (j = 0; j < a->len; ++j) {
1823 unsigned in = c->num[i + j];
1824 in += ((unsigned) a->num[j]) * ((unsigned) b->num[i]) + carry;
1825 // note: compilers prefer _unsigned_ div/const
1827 c->num[i + j] = (BcDig)(in % 10);
1830 c->num[i + j] += (BcDig) carry;
1831 len = BC_MAX(len, i + j + !!carry);
1834 // a*a <- without check below, this will not be interruptible
1835 if (G_interrupt) return BC_STATUS_FAILURE;
1840 return BC_STATUS_SUCCESS;
1843 bc_num_init(&l1, max);
1844 bc_num_init(&h1, max);
1845 bc_num_init(&l2, max);
1846 bc_num_init(&h2, max);
1847 bc_num_init(&m1, max);
1848 bc_num_init(&m2, max);
1849 bc_num_init(&z0, max);
1850 bc_num_init(&z1, max);
1851 bc_num_init(&z2, max);
1852 bc_num_init(&temp, max + max);
1854 bc_num_split(a, max2, &l1, &h1);
1855 bc_num_split(b, max2, &l2, &h2);
1857 s = bc_num_add(&h1, &l1, &m1, 0);
1859 s = bc_num_add(&h2, &l2, &m2, 0);
1862 s = bc_num_k(&h1, &h2, &z0);
1864 s = bc_num_k(&m1, &m2, &z1);
1866 s = bc_num_k(&l1, &l2, &z2);
1869 s = bc_num_sub(&z1, &z0, &temp, 0);
1871 s = bc_num_sub(&temp, &z2, &z1, 0);
1874 s = bc_num_shift(&z0, max2 * 2);
1876 s = bc_num_shift(&z1, max2);
1878 s = bc_num_add(&z0, &z1, &temp, 0);
1880 s = bc_num_add(&temp, &z2, c, 0);
1896 static BcStatus bc_num_m(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale)
1900 size_t maxrdx = BC_MAX(a->rdx, b->rdx);
1902 scale = BC_MAX(scale, a->rdx);
1903 scale = BC_MAX(scale, b->rdx);
1904 scale = BC_MIN(a->rdx + b->rdx, scale);
1905 maxrdx = BC_MAX(maxrdx, scale);
1907 bc_num_init(&cpa, a->len);
1908 bc_num_init(&cpb, b->len);
1910 bc_num_copy(&cpa, a);
1911 bc_num_copy(&cpb, b);
1912 cpa.neg = cpb.neg = false;
1914 s = bc_num_shift(&cpa, maxrdx);
1916 s = bc_num_shift(&cpb, maxrdx);
1918 s = bc_num_k(&cpa, &cpb, c);
1922 bc_num_expand(c, c->len + maxrdx);
1924 if (c->len < maxrdx) {
1925 memset(c->num + c->len, 0, (c->cap - c->len) * sizeof(BcDig));
1930 bc_num_retireMul(c, scale, a->neg, b->neg);
1938 static BcStatus bc_num_d(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale)
1940 BcStatus s = BC_STATUS_SUCCESS;
1947 return bc_error("divide by zero");
1948 else if (a->len == 0) {
1949 bc_num_setToZero(c, scale);
1950 return BC_STATUS_SUCCESS;
1952 else if (BC_NUM_ONE(b)) {
1954 bc_num_retireMul(c, scale, a->neg, b->neg);
1955 return BC_STATUS_SUCCESS;
1958 bc_num_init(&cp, BC_NUM_MREQ(a, b, scale));
1959 bc_num_copy(&cp, a);
1963 bc_num_expand(&cp, len + 2);
1964 bc_num_extend(&cp, len - cp.len);
1967 if (b->rdx > cp.rdx) bc_num_extend(&cp, b->rdx - cp.rdx);
1969 if (scale > cp.rdx) bc_num_extend(&cp, scale - cp.rdx);
1971 if (b->rdx == b->len) {
1972 for (i = 0; zero && i < len; ++i) zero = !b->num[len - i - 1];
1976 if (cp.cap == cp.len) bc_num_expand(&cp, cp.len + 1);
1978 // We want an extra zero in front to make things simpler.
1979 cp.num[cp.len++] = 0;
1982 bc_num_expand(c, cp.len);
1985 memset(c->num + end, 0, (c->cap - end) * sizeof(BcDig));
1990 for (i = end - 1; !s && i < end; --i) {
1992 for (q = 0; (!s && n[len] != 0) || bc_num_compare(n, p, len) >= 0; ++q)
1993 bc_num_subArrays(n, p, len);
1997 // 1/a <- without check below, this will not be interruptible
1999 s = BC_STATUS_FAILURE;
2004 bc_num_retireMul(c, scale, a->neg, b->neg);
2010 static BcStatus bc_num_r(BcNum *a, BcNum *b, BcNum *restrict c,
2011 BcNum *restrict d, size_t scale, size_t ts)
2018 return bc_error("divide by zero");
2021 bc_num_setToZero(d, ts);
2022 return BC_STATUS_SUCCESS;
2025 bc_num_init(&temp, d->cap);
2026 s = bc_num_d(a, b, c, scale);
2029 if (scale != 0) scale = ts;
2031 s = bc_num_m(c, b, &temp, scale);
2033 s = bc_num_sub(a, &temp, d, scale);
2036 if (ts > d->rdx && d->len) bc_num_extend(d, ts - d->rdx);
2039 bc_num_retireMul(d, ts, a->neg, b->neg);
2047 static BcStatus bc_num_rem(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale)
2051 size_t ts = BC_MAX(scale + b->rdx, a->rdx), len = BC_NUM_MREQ(a, b, ts);
2053 bc_num_init(&c1, len);
2054 s = bc_num_r(a, b, &c1, c, scale, ts);
2060 static BcStatus bc_num_p(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale)
2062 BcStatus s = BC_STATUS_SUCCESS;
2065 size_t i, powrdx, resrdx;
2068 if (b->rdx) return bc_error("non integer number");
2072 return BC_STATUS_SUCCESS;
2074 else if (a->len == 0) {
2075 bc_num_setToZero(c, scale);
2076 return BC_STATUS_SUCCESS;
2078 else if (BC_NUM_ONE(b)) {
2082 s = bc_num_inv(a, c, scale);
2089 s = bc_num_ulong(b, &pow);
2092 bc_num_init(©, a->len);
2093 bc_num_copy(©, a);
2098 if (a->rdx * pow < scale)
2099 scale = a->rdx * pow;
2104 for (powrdx = a->rdx; !(pow & 1); pow >>= 1) {
2106 s = bc_num_mul(©, ©, ©, powrdx);
2108 // Not needed: bc_num_mul() has a check for ^C:
2109 //if (G_interrupt) {
2110 // s = BC_STATUS_FAILURE;
2115 bc_num_copy(c, ©);
2117 for (resrdx = powrdx, pow >>= 1; pow != 0; pow >>= 1) {
2120 s = bc_num_mul(©, ©, ©, powrdx);
2125 s = bc_num_mul(c, ©, c, resrdx);
2128 // Not needed: bc_num_mul() has a check for ^C:
2129 //if (G_interrupt) {
2130 // s = BC_STATUS_FAILURE;
2136 s = bc_num_inv(c, c, scale);
2140 if (c->rdx > scale) bc_num_truncate(c, c->rdx - scale);
2142 // We can't use bc_num_clean() here.
2143 for (zero = true, i = 0; zero && i < c->len; ++i) zero = !c->num[i];
2144 if (zero) bc_num_setToZero(c, scale);
2151 static BcStatus bc_num_binary(BcNum *a, BcNum *b, BcNum *c, size_t scale,
2152 BcNumBinaryOp op, size_t req)
2155 BcNum num2, *ptr_a, *ptr_b;
2160 memcpy(ptr_a, c, sizeof(BcNum));
2169 memcpy(ptr_b, c, sizeof(BcNum));
2177 bc_num_init(c, req);
2179 bc_num_expand(c, req);
2181 s = op(ptr_a, ptr_b, c, scale);
2183 if (init) bc_num_free(&num2);
2188 static bool bc_num_strValid(const char *val, size_t base)
2191 bool small, radix = false;
2192 size_t i, len = strlen(val);
2194 if (!len) return true;
2197 b = (BcDig)(small ? base + '0' : base - 10 + 'A');
2199 for (i = 0; i < len; ++i) {
2205 if (radix) return false;
2211 if (c < '0' || (small && c >= b) || (c > '9' && (c < 'A' || c >= b)))
2218 static void bc_num_parseDecimal(BcNum *n, const char *val)
2224 for (i = 0; val[i] == '0'; ++i);
2231 for (i = 0; zero && i < len; ++i) zero = val[i] == '0' || val[i] == '.';
2232 bc_num_expand(n, len);
2235 ptr = strchr(val, '.');
2239 n->rdx = (size_t)((val + len) - (ptr + 1));
2242 for (i = len - 1; i < len; ++n->len, i -= 1 + (i && val[i - 1] == '.'))
2243 n->num[n->len] = val[i] - '0';
2247 static void bc_num_parseBase(BcNum *n, const char *val, BcNum *base)
2250 BcNum temp, mult, result;
2254 size_t i, digits, len = strlen(val);
2258 for (i = 0; zero && i < len; ++i) zero = (val[i] == '.' || val[i] == '0');
2261 bc_num_init(&temp, BC_NUM_DEF_SIZE);
2262 bc_num_init(&mult, BC_NUM_DEF_SIZE);
2264 for (i = 0; i < len; ++i) {
2267 if (c == '.') break;
2269 v = (unsigned long) (c <= '9' ? c - '0' : c - 'A' + 10);
2271 s = bc_num_mul(n, base, &mult, 0);
2272 if (s) goto int_err;
2273 bc_num_ulong2num(&temp, v);
2274 s = bc_num_add(&mult, &temp, n, 0);
2275 if (s) goto int_err;
2280 if (c == 0) goto int_err;
2283 bc_num_init(&result, base->len);
2284 bc_num_zero(&result);
2287 for (i += 1, digits = 0; i < len; ++i, ++digits) {
2292 v = (unsigned long) (c <= '9' ? c - '0' : c - 'A' + 10);
2294 s = bc_num_mul(&result, base, &result, 0);
2296 bc_num_ulong2num(&temp, v);
2297 s = bc_num_add(&result, &temp, &result, 0);
2299 s = bc_num_mul(&mult, base, &mult, 0);
2303 s = bc_num_div(&result, &mult, &result, digits);
2305 s = bc_num_add(n, &result, n, digits);
2309 if (n->rdx < digits) bc_num_extend(n, digits - n->rdx);
2315 bc_num_free(&result);
2321 static void bc_num_printNewline(size_t *nchars, size_t line_len)
2323 if (*nchars == line_len - 1) {
2331 static void bc_num_printChar(size_t num, size_t width, bool radix,
2332 size_t *nchars, size_t line_len)
2334 (void) radix, (void) line_len;
2335 bb_putchar((char) num);
2336 *nchars = *nchars + width;
2340 static void bc_num_printDigits(size_t num, size_t width, bool radix,
2341 size_t *nchars, size_t line_len)
2345 bc_num_printNewline(nchars, line_len);
2346 bb_putchar(radix ? '.' : ' ');
2349 bc_num_printNewline(nchars, line_len);
2350 for (exp = 0, pow = 1; exp < width - 1; ++exp, pow *= 10)
2353 for (exp = 0; exp < width; pow /= 10, ++(*nchars), ++exp) {
2355 bc_num_printNewline(nchars, line_len);
2358 bb_putchar(((char) dig) + '0');
2362 static void bc_num_printHex(size_t num, size_t width, bool radix,
2363 size_t *nchars, size_t line_len)
2366 bc_num_printNewline(nchars, line_len);
2371 bc_num_printNewline(nchars, line_len);
2372 bb_putchar(bb_hexdigits_upcase[num]);
2373 *nchars = *nchars + width;
2376 static void bc_num_printDecimal(BcNum *n, size_t *nchars, size_t len)
2378 size_t i, rdx = n->rdx - 1;
2380 if (n->neg) bb_putchar('-');
2381 (*nchars) += n->neg;
2383 for (i = n->len - 1; i < n->len; --i)
2384 bc_num_printHex((size_t) n->num[i], 1, i == rdx, nchars, len);
2387 static BcStatus bc_num_printNum(BcNum *n, BcNum *base, size_t width,
2388 size_t *nchars, size_t len, BcNumDigitOp print)
2392 BcNum intp, fracp, digit, frac_len;
2393 unsigned long dig, *ptr;
2398 print(0, width, false, nchars, len);
2399 return BC_STATUS_SUCCESS;
2402 bc_vec_init(&stack, sizeof(long), NULL);
2403 bc_num_init(&intp, n->len);
2404 bc_num_init(&fracp, n->rdx);
2405 bc_num_init(&digit, width);
2406 bc_num_init(&frac_len, BC_NUM_INT(n));
2407 bc_num_copy(&intp, n);
2408 bc_num_one(&frac_len);
2410 bc_num_truncate(&intp, intp.rdx);
2411 s = bc_num_sub(n, &intp, &fracp, 0);
2414 while (intp.len != 0) {
2415 s = bc_num_divmod(&intp, base, &intp, &digit, 0);
2417 s = bc_num_ulong(&digit, &dig);
2419 bc_vec_push(&stack, &dig);
2422 for (i = 0; i < stack.len; ++i) {
2423 ptr = bc_vec_item_rev(&stack, i);
2424 print(*ptr, width, false, nchars, len);
2427 if (!n->rdx) goto err;
2429 for (radix = true; frac_len.len <= n->rdx; radix = false) {
2430 s = bc_num_mul(&fracp, base, &fracp, n->rdx);
2432 s = bc_num_ulong(&fracp, &dig);
2434 bc_num_ulong2num(&intp, dig);
2435 s = bc_num_sub(&fracp, &intp, &fracp, 0);
2437 print(dig, width, radix, nchars, len);
2438 s = bc_num_mul(&frac_len, base, &frac_len, 0);
2443 bc_num_free(&frac_len);
2444 bc_num_free(&digit);
2445 bc_num_free(&fracp);
2447 bc_vec_free(&stack);
2451 static BcStatus bc_num_printBase(BcNum *n, BcNum *base, size_t base_t,
2452 size_t *nchars, size_t line_len)
2459 if (neg) bb_putchar('-');
2464 if (base_t <= BC_NUM_MAX_IBASE) {
2466 print = bc_num_printHex;
2469 for (i = base_t - 1, width = 0; i != 0; i /= 10, ++width);
2470 print = bc_num_printDigits;
2473 s = bc_num_printNum(n, base, width, nchars, line_len, print);
2480 static BcStatus bc_num_stream(BcNum *n, BcNum *base, size_t *nchars, size_t len)
2482 return bc_num_printNum(n, base, 1, nchars, len, bc_num_printChar);
2486 static BcStatus bc_num_parse(BcNum *n, const char *val, BcNum *base,
2489 if (!bc_num_strValid(val, base_t))
2490 return bc_error("bad number string");
2493 bc_num_parseDecimal(n, val);
2495 bc_num_parseBase(n, val, base);
2497 return BC_STATUS_SUCCESS;
2500 static BcStatus bc_num_print(BcNum *n, BcNum *base, size_t base_t, bool newline,
2501 size_t *nchars, size_t line_len)
2503 BcStatus s = BC_STATUS_SUCCESS;
2505 bc_num_printNewline(nchars, line_len);
2511 else if (base_t == 10)
2512 bc_num_printDecimal(n, nchars, line_len);
2514 s = bc_num_printBase(n, base, base_t, nchars, line_len);
2524 static BcStatus bc_num_add(BcNum *a, BcNum *b, BcNum *c, size_t scale)
2526 BcNumBinaryOp op = (!a->neg == !b->neg) ? bc_num_a : bc_num_s;
2528 return bc_num_binary(a, b, c, false, op, BC_NUM_AREQ(a, b));
2531 static BcStatus bc_num_sub(BcNum *a, BcNum *b, BcNum *c, size_t scale)
2533 BcNumBinaryOp op = (!a->neg == !b->neg) ? bc_num_s : bc_num_a;
2535 return bc_num_binary(a, b, c, true, op, BC_NUM_AREQ(a, b));
2538 static BcStatus bc_num_mul(BcNum *a, BcNum *b, BcNum *c, size_t scale)
2540 size_t req = BC_NUM_MREQ(a, b, scale);
2541 return bc_num_binary(a, b, c, scale, bc_num_m, req);
2544 static BcStatus bc_num_div(BcNum *a, BcNum *b, BcNum *c, size_t scale)
2546 size_t req = BC_NUM_MREQ(a, b, scale);
2547 return bc_num_binary(a, b, c, scale, bc_num_d, req);
2550 static BcStatus bc_num_mod(BcNum *a, BcNum *b, BcNum *c, size_t scale)
2552 size_t req = BC_NUM_MREQ(a, b, scale);
2553 return bc_num_binary(a, b, c, scale, bc_num_rem, req);
2556 static BcStatus bc_num_pow(BcNum *a, BcNum *b, BcNum *c, size_t scale)
2558 return bc_num_binary(a, b, c, scale, bc_num_p, a->len * b->len + 1);
2561 static BcStatus bc_num_sqrt(BcNum *a, BcNum *restrict b, size_t scale)
2564 BcNum num1, num2, half, f, fprime, *x0, *x1, *temp;
2565 size_t pow, len, digs, digs1, resrdx, req, times = 0;
2566 ssize_t cmp = 1, cmp1 = SSIZE_MAX, cmp2 = SSIZE_MAX;
2568 req = BC_MAX(scale, a->rdx) + ((BC_NUM_INT(a) + 1) >> 1) + 1;
2569 bc_num_expand(b, req);
2572 bc_num_setToZero(b, scale);
2573 return BC_STATUS_SUCCESS;
2576 return bc_error("negative number");
2577 else if (BC_NUM_ONE(a)) {
2579 bc_num_extend(b, scale);
2580 return BC_STATUS_SUCCESS;
2583 scale = BC_MAX(scale, a->rdx) + 1;
2584 len = a->len + scale;
2586 bc_num_init(&num1, len);
2587 bc_num_init(&num2, len);
2588 bc_num_init(&half, BC_NUM_DEF_SIZE);
2594 bc_num_init(&f, len);
2595 bc_num_init(&fprime, len);
2601 pow = BC_NUM_INT(a);
2610 pow -= 2 - (pow & 1);
2612 bc_num_extend(x0, pow);
2614 // Make sure to move the radix back.
2618 x0->rdx = digs = digs1 = 0;
2620 len = BC_NUM_INT(x0) + resrdx - 1;
2622 while (cmp != 0 || digs < len) {
2624 s = bc_num_div(a, x0, &f, resrdx);
2626 s = bc_num_add(x0, &f, &fprime, resrdx);
2628 s = bc_num_mul(&fprime, &half, x1, resrdx);
2631 cmp = bc_num_cmp(x1, x0);
2632 digs = x1->len - (unsigned long long) llabs(cmp);
2634 if (cmp == cmp2 && digs == digs1)
2639 resrdx += times > 4;
2652 if (b->rdx > scale) bc_num_truncate(b, b->rdx - scale);
2655 bc_num_free(&fprime);
2663 static BcStatus bc_num_divmod(BcNum *a, BcNum *b, BcNum *c, BcNum *d,
2669 size_t ts = BC_MAX(scale + b->rdx, a->rdx), len = BC_NUM_MREQ(a, b, ts);
2672 memcpy(&num2, c, sizeof(BcNum));
2674 bc_num_init(c, len);
2679 bc_num_expand(c, len);
2682 s = bc_num_r(ptr_a, b, c, d, scale, ts);
2684 if (init) bc_num_free(&num2);
2690 static BcStatus bc_num_modexp(BcNum *a, BcNum *b, BcNum *c, BcNum *restrict d)
2693 BcNum base, exp, two, temp;
2696 return bc_error("divide by zero");
2697 if (a->rdx || b->rdx || c->rdx)
2698 return bc_error("non integer number");
2700 return bc_error("negative number");
2702 bc_num_expand(d, c->len);
2703 bc_num_init(&base, c->len);
2704 bc_num_init(&exp, b->len);
2705 bc_num_init(&two, BC_NUM_DEF_SIZE);
2706 bc_num_init(&temp, b->len);
2712 s = bc_num_rem(a, c, &base, 0);
2714 bc_num_copy(&exp, b);
2716 while (exp.len != 0) {
2718 s = bc_num_divmod(&exp, &two, &exp, &temp, 0);
2721 if (BC_NUM_ONE(&temp)) {
2722 s = bc_num_mul(d, &base, &temp, 0);
2724 s = bc_num_rem(&temp, c, d, 0);
2728 s = bc_num_mul(&base, &base, &temp, 0);
2730 s = bc_num_rem(&temp, c, &base, 0);
2744 static BcStatus bc_func_insert(BcFunc *f, char *name, bool var)
2749 for (i = 0; i < f->autos.len; ++i) {
2750 if (strcmp(name, ((BcId *) bc_vec_item(&f->autos, i))->name) == 0)
2751 return bc_error("function parameter or auto var has the same name as another");
2757 bc_vec_push(&f->autos, &a);
2759 return BC_STATUS_SUCCESS;
2763 static void bc_func_init(BcFunc *f)
2765 bc_char_vec_init(&f->code);
2766 bc_vec_init(&f->autos, sizeof(BcId), bc_id_free);
2767 bc_vec_init(&f->labels, sizeof(size_t), NULL);
2771 static void bc_func_free(void *func)
2773 BcFunc *f = (BcFunc *) func;
2774 bc_vec_free(&f->code);
2775 bc_vec_free(&f->autos);
2776 bc_vec_free(&f->labels);
2779 static void bc_array_expand(BcVec *a, size_t len);
2781 static void bc_array_init(BcVec *a, bool nums)
2784 bc_vec_init(a, sizeof(BcNum), bc_num_free);
2786 bc_vec_init(a, sizeof(BcVec), bc_vec_free);
2787 bc_array_expand(a, 1);
2790 static void bc_array_expand(BcVec *a, size_t len)
2794 if (a->size == sizeof(BcNum) && a->dtor == bc_num_free) {
2795 while (len > a->len) {
2796 bc_num_init(&data.n, BC_NUM_DEF_SIZE);
2797 bc_vec_push(a, &data.n);
2801 while (len > a->len) {
2802 bc_array_init(&data.v, true);
2803 bc_vec_push(a, &data.v);
2808 static void bc_array_copy(BcVec *d, const BcVec *s)
2813 bc_vec_expand(d, s->cap);
2816 for (i = 0; i < s->len; ++i) {
2817 BcNum *dnum = bc_vec_item(d, i), *snum = bc_vec_item(s, i);
2818 bc_num_init(dnum, snum->len);
2819 bc_num_copy(dnum, snum);
2823 static void bc_string_free(void *string)
2825 free(*((char **) string));
2829 static void bc_result_copy(BcResult *d, BcResult *src)
2835 case BC_RESULT_TEMP:
2836 case BC_RESULT_IBASE:
2837 case BC_RESULT_SCALE:
2838 case BC_RESULT_OBASE:
2840 bc_num_init(&d->d.n, src->d.n.len);
2841 bc_num_copy(&d->d.n, &src->d.n);
2846 case BC_RESULT_ARRAY:
2847 case BC_RESULT_ARRAY_ELEM:
2849 d->d.id.name = xstrdup(src->d.id.name);
2853 case BC_RESULT_CONSTANT:
2854 case BC_RESULT_LAST:
2858 memcpy(&d->d.n, &src->d.n, sizeof(BcNum));
2865 static void bc_result_free(void *result)
2867 BcResult *r = (BcResult *) result;
2871 case BC_RESULT_TEMP:
2872 case BC_RESULT_IBASE:
2873 case BC_RESULT_SCALE:
2874 case BC_RESULT_OBASE:
2876 bc_num_free(&r->d.n);
2881 case BC_RESULT_ARRAY:
2882 case BC_RESULT_ARRAY_ELEM:
2896 static void bc_lex_lineComment(BcLex *l)
2898 l->t.t = BC_LEX_WHITESPACE;
2899 while (l->i < l->len && l->buf[l->i++] != '\n');
2903 static void bc_lex_whitespace(BcLex *l)
2906 l->t.t = BC_LEX_WHITESPACE;
2907 for (c = l->buf[l->i]; c != '\n' && isspace(c); c = l->buf[++l->i]);
2910 static BcStatus bc_lex_number(BcLex *l, char start)
2912 const char *buf = l->buf + l->i;
2913 size_t len, hits = 0, bslashes = 0, i = 0, j;
2915 bool last_pt, pt = start == '.';
2918 l->t.t = BC_LEX_NUMBER;
2920 while (c != 0 && (isdigit(c) || (c >= 'A' && c <= 'F') ||
2921 (c == '.' && !pt) || (c == '\\' && buf[i + 1] == '\n')))
2935 len = i + !last_pt - bslashes * 2;
2936 // This check makes sense only if size_t is (much) larger than BC_MAX_NUM.
2937 if (SIZE_MAX > (BC_MAX_NUM | 0xff)) {
2938 if (len > BC_MAX_NUM)
2939 return bc_error("number too long: must be [1,"BC_MAX_NUM_STR"]");
2942 bc_vec_pop_all(&l->t.v);
2943 bc_vec_expand(&l->t.v, len + 1);
2944 bc_vec_push(&l->t.v, &start);
2946 for (buf -= 1, j = 1; j < len + hits * 2; ++j) {
2950 // If we have hit a backslash, skip it. We don't have
2951 // to check for a newline because it's guaranteed.
2952 if (hits < bslashes && c == '\\') {
2958 bc_vec_push(&l->t.v, &c);
2961 bc_vec_pushZeroByte(&l->t.v);
2964 return BC_STATUS_SUCCESS;
2967 static BcStatus bc_lex_name(BcLex *l)
2970 const char *buf = l->buf + l->i - 1;
2973 l->t.t = BC_LEX_NAME;
2975 while ((c >= 'a' && c <= 'z') || isdigit(c) || c == '_') c = buf[++i];
2977 // This check makes sense only if size_t is (much) larger than BC_MAX_STRING.
2978 if (SIZE_MAX > (BC_MAX_STRING | 0xff)) {
2979 if (i > BC_MAX_STRING)
2980 return bc_error("name too long: must be [1,"BC_MAX_STRING_STR"]");
2982 bc_vec_string(&l->t.v, i, buf);
2984 // Increment the index. We minus 1 because it has already been incremented.
2987 return BC_STATUS_SUCCESS;
2990 static void bc_lex_init(BcLex *l, BcLexNext next)
2993 bc_char_vec_init(&l->t.v);
2996 static void bc_lex_free(BcLex *l)
2998 bc_vec_free(&l->t.v);
3001 static void bc_lex_file(BcLex *l)
3003 G.err_line = l->line = 1;
3007 static BcStatus bc_lex_next(BcLex *l)
3012 if (l->t.last == BC_LEX_EOF) return bc_error("end of file");
3014 l->line += l->newline;
3015 G.err_line = l->line;
3016 l->t.t = BC_LEX_EOF;
3018 l->newline = (l->i == l->len);
3019 if (l->newline) return BC_STATUS_SUCCESS;
3021 // Loop until failure or we don't have whitespace. This
3022 // is so the parser doesn't get inundated with whitespace.
3025 } while (!s && l->t.t == BC_LEX_WHITESPACE);
3030 static BcStatus bc_lex_text(BcLex *l, const char *text)
3034 l->len = strlen(text);
3035 l->t.t = l->t.last = BC_LEX_INVALID;
3036 return bc_lex_next(l);
3040 static BcStatus bc_lex_identifier(BcLex *l)
3044 const char *buf = l->buf + l->i - 1;
3046 for (i = 0; i < ARRAY_SIZE(bc_lex_kws); ++i) {
3047 const char *keyword8 = bc_lex_kws[i].name8;
3049 while (buf[j] != '\0' && buf[j] == keyword8[j]) {
3051 if (j == 8) goto match;
3053 if (keyword8[j] != '\0')
3056 // buf starts with keyword bc_lex_kws[i]
3057 l->t.t = BC_LEX_KEY_1st_keyword + i;
3058 if (!bc_lex_kws_POSIX(i)) {
3059 s = bc_posix_error_fmt("%sthe '%.8s' keyword", "POSIX does not allow ", bc_lex_kws[i].name8);
3063 // We minus 1 because the index has already been incremented.
3065 return BC_STATUS_SUCCESS;
3071 if (l->t.v.len > 2) {
3074 // bc: POSIX only allows one character names; the following is bad: 'qwe=1
3076 unsigned len = strchrnul(buf, '\n') - buf;
3077 s = bc_posix_error_fmt("POSIX only allows one character names; the following is bad: '%.*s'", len, buf);
3083 static BcStatus bc_lex_string(BcLex *l)
3085 size_t len, nls = 0, i = l->i;
3088 l->t.t = BC_LEX_STR;
3090 for (c = l->buf[i]; c != 0 && c != '"'; c = l->buf[++i]) nls += (c == '\n');
3094 return bc_error("string end could not be found");
3098 // This check makes sense only if size_t is (much) larger than BC_MAX_STRING.
3099 if (SIZE_MAX > (BC_MAX_STRING | 0xff)) {
3100 if (len > BC_MAX_STRING)
3101 return bc_error("string too long: must be [1,"BC_MAX_STRING_STR"]");
3103 bc_vec_string(&l->t.v, len, l->buf + l->i);
3107 G.err_line = l->line;
3109 return BC_STATUS_SUCCESS;
3112 static void bc_lex_assign(BcLex *l, BcLexType with, BcLexType without)
3114 if (l->buf[l->i] == '=') {
3122 static BcStatus bc_lex_comment(BcLex *l)
3125 const char *buf = l->buf;
3127 l->t.t = BC_LEX_WHITESPACE;
3140 return bc_error("comment end could not be found");
3148 G.err_line = l->line;
3150 return BC_STATUS_SUCCESS;
3153 static BcStatus bc_lex_token(BcLex *l)
3155 BcStatus s = BC_STATUS_SUCCESS;
3156 char c = l->buf[l->i++], c2;
3158 // This is the workhorse of the lexer.
3165 l->t.t = !c ? BC_LEX_EOF : BC_LEX_NLINE;
3175 bc_lex_whitespace(l);
3181 bc_lex_assign(l, BC_LEX_OP_REL_NE, BC_LEX_OP_BOOL_NOT);
3183 if (l->t.t == BC_LEX_OP_BOOL_NOT) {
3184 s = bc_POSIX_does_not_allow_bool_ops_this_is_bad("!");
3193 s = bc_lex_string(l);
3199 s = bc_POSIX_does_not_allow("'#' script comments");
3202 bc_lex_lineComment(l);
3209 bc_lex_assign(l, BC_LEX_OP_ASSIGN_MODULUS, BC_LEX_OP_MODULUS);
3218 s = bc_POSIX_does_not_allow_bool_ops_this_is_bad("&&");
3222 l->t.t = BC_LEX_OP_BOOL_AND;
3225 l->t.t = BC_LEX_INVALID;
3226 s = bc_error_bad_character('&');
3235 l->t.t = (BcLexType)(c - '(' + BC_LEX_LPAREN);
3241 bc_lex_assign(l, BC_LEX_OP_ASSIGN_MULTIPLY, BC_LEX_OP_MULTIPLY);
3250 l->t.t = BC_LEX_OP_INC;
3253 bc_lex_assign(l, BC_LEX_OP_ASSIGN_PLUS, BC_LEX_OP_PLUS);
3259 l->t.t = BC_LEX_COMMA;
3268 l->t.t = BC_LEX_OP_DEC;
3271 bc_lex_assign(l, BC_LEX_OP_ASSIGN_MINUS, BC_LEX_OP_MINUS);
3277 if (isdigit(l->buf[l->i]))
3278 s = bc_lex_number(l, c);
3280 l->t.t = BC_LEX_KEY_LAST;
3281 s = bc_POSIX_does_not_allow("a period ('.') as a shortcut for the last result");
3290 s = bc_lex_comment(l);
3292 bc_lex_assign(l, BC_LEX_OP_ASSIGN_DIVIDE, BC_LEX_OP_DIVIDE);
3313 s = bc_lex_number(l, c);
3319 l->t.t = BC_LEX_SCOLON;
3325 bc_lex_assign(l, BC_LEX_OP_REL_LE, BC_LEX_OP_REL_LT);
3331 bc_lex_assign(l, BC_LEX_OP_REL_EQ, BC_LEX_OP_ASSIGN);
3337 bc_lex_assign(l, BC_LEX_OP_REL_GE, BC_LEX_OP_REL_GT);
3344 l->t.t = (BcLexType)(c - '[' + BC_LEX_LBRACKET);
3350 if (l->buf[l->i] == '\n') {
3351 l->t.t = BC_LEX_WHITESPACE;
3355 s = bc_error_bad_character(c);
3361 bc_lex_assign(l, BC_LEX_OP_ASSIGN_POWER, BC_LEX_OP_POWER);
3392 s = bc_lex_identifier(l);
3399 l->t.t = (BcLexType)(c - '{' + BC_LEX_LBRACE);
3408 s = bc_POSIX_does_not_allow_bool_ops_this_is_bad("||");
3412 l->t.t = BC_LEX_OP_BOOL_OR;
3415 l->t.t = BC_LEX_INVALID;
3416 s = bc_error_bad_character(c);
3424 l->t.t = BC_LEX_INVALID;
3425 s = bc_error_bad_character(c);
3435 static BcStatus dc_lex_register(BcLex *l)
3437 BcStatus s = BC_STATUS_SUCCESS;
3439 if (isspace(l->buf[l->i - 1])) {
3440 bc_lex_whitespace(l);
3443 s = bc_error("extended register");
3448 bc_vec_pop_all(&l->t.v);
3449 bc_vec_push(&l->t.v, &l->buf[l->i - 1]);
3450 bc_vec_pushZeroByte(&l->t.v);
3451 l->t.t = BC_LEX_NAME;
3457 static BcStatus dc_lex_string(BcLex *l)
3459 size_t depth = 1, nls = 0, i = l->i;
3462 l->t.t = BC_LEX_STR;
3463 bc_vec_pop_all(&l->t.v);
3465 for (c = l->buf[i]; c != 0 && depth; c = l->buf[++i]) {
3467 depth += (c == '[' && (i == l->i || l->buf[i - 1] != '\\'));
3468 depth -= (c == ']' && (i == l->i || l->buf[i - 1] != '\\'));
3471 if (depth) bc_vec_push(&l->t.v, &c);
3476 return bc_error("string end could not be found");
3479 bc_vec_pushZeroByte(&l->t.v);
3480 // This check makes sense only if size_t is (much) larger than BC_MAX_STRING.
3481 if (SIZE_MAX > (BC_MAX_STRING | 0xff)) {
3482 if (i - l->i > BC_MAX_STRING)
3483 return bc_error("string too long: must be [1,"BC_MAX_STRING_STR"]");
3488 G.err_line = l->line;
3490 return BC_STATUS_SUCCESS;
3493 static BcStatus dc_lex_token(BcLex *l)
3495 BcStatus s = BC_STATUS_SUCCESS;
3496 char c = l->buf[l->i++], c2;
3499 for (i = 0; i < ARRAY_SIZE(dc_lex_regs); ++i) {
3500 if (l->t.last == dc_lex_regs[i])
3501 return dc_lex_register(l);
3504 if (c >= '%' && c <= '~' &&
3505 (l->t.t = dc_lex_tokens[(c - '%')]) != BC_LEX_INVALID)
3510 // This is the workhorse of the lexer.
3515 l->t.t = BC_LEX_EOF;
3526 l->newline = (c == '\n');
3527 bc_lex_whitespace(l);
3536 l->t.t = BC_LEX_OP_REL_NE;
3538 l->t.t = BC_LEX_OP_REL_LE;
3540 l->t.t = BC_LEX_OP_REL_GE;
3542 return bc_error_bad_character(c);
3550 bc_lex_lineComment(l);
3556 if (isdigit(l->buf[l->i]))
3557 s = bc_lex_number(l, c);
3559 s = bc_error_bad_character(c);
3580 s = bc_lex_number(l, c);
3586 s = dc_lex_string(l);
3592 l->t.t = BC_LEX_INVALID;
3593 s = bc_error_bad_character(c);
3602 static void bc_program_addFunc(char *name, size_t *idx);
3604 static void bc_parse_addFunc(BcParse *p, char *name, size_t *idx)
3606 bc_program_addFunc(name, idx);
3607 p->func = bc_vec_item(&G.prog.fns, p->fidx);
3610 #define bc_parse_push(p, i) bc_vec_pushByte(&(p)->func->code, (char) (i))
3612 static void bc_parse_pushName(BcParse *p, char *name)
3614 size_t i = 0, len = strlen(name);
3616 for (; i < len; ++i) bc_parse_push(p, name[i]);
3617 bc_parse_push(p, BC_PARSE_STREND);
3622 static void bc_parse_pushIndex(BcParse *p, size_t idx)
3624 unsigned char amt, i, nums[sizeof(size_t)];
3626 for (amt = 0; idx; ++amt) {
3627 nums[amt] = (char) idx;
3628 idx = (idx & ((unsigned long) ~(UCHAR_MAX))) >> sizeof(char) * CHAR_BIT;
3631 bc_parse_push(p, amt);
3632 for (i = 0; i < amt; ++i) bc_parse_push(p, nums[i]);
3635 static void bc_parse_number(BcParse *p, BcInst *prev, size_t *nexs)
3637 char *num = xstrdup(p->l.t.v.v);
3638 size_t idx = G.prog.consts.len;
3640 bc_vec_push(&G.prog.consts, &num);
3642 bc_parse_push(p, BC_INST_NUM);
3643 bc_parse_pushIndex(p, idx);
3646 (*prev) = BC_INST_NUM;
3649 static BcStatus bc_parse_text(BcParse *p, const char *text)
3653 p->func = bc_vec_item(&G.prog.fns, p->fidx);
3655 if (!text[0] && !BC_PARSE_CAN_EXEC(p)) {
3656 p->l.t.t = BC_LEX_INVALID;
3659 if (!BC_PARSE_CAN_EXEC(p))
3660 return bc_error("file is not executable");
3663 return bc_lex_text(&p->l, text);
3666 // Called when parsing or execution detects a failure,
3667 // resets execution structures.
3668 static void bc_program_reset(void)
3673 bc_vec_npop(&G.prog.stack, G.prog.stack.len - 1);
3674 bc_vec_pop_all(&G.prog.results);
3676 f = bc_vec_item(&G.prog.fns, 0);
3677 ip = bc_vec_top(&G.prog.stack);
3678 ip->idx = f->code.len;
3681 #define bc_parse_updateFunc(p, f) \
3682 ((p)->func = bc_vec_item(&G.prog.fns, ((p)->fidx = (f))))
3684 // Called when bc/dc_parse_parse() detects a failure,
3685 // resets parsing structures.
3686 static void bc_parse_reset(BcParse *p)
3688 if (p->fidx != BC_PROG_MAIN) {
3689 p->func->nparams = 0;
3690 bc_vec_pop_all(&p->func->code);
3691 bc_vec_pop_all(&p->func->autos);
3692 bc_vec_pop_all(&p->func->labels);
3694 bc_parse_updateFunc(p, BC_PROG_MAIN);
3698 p->l.t.t = BC_LEX_EOF;
3699 p->auto_part = (p->nbraces = 0);
3701 bc_vec_npop(&p->flags, p->flags.len - 1);
3702 bc_vec_pop_all(&p->exits);
3703 bc_vec_pop_all(&p->conds);
3704 bc_vec_pop_all(&p->ops);
3709 static void bc_parse_free(BcParse *p)
3711 bc_vec_free(&p->flags);
3712 bc_vec_free(&p->exits);
3713 bc_vec_free(&p->conds);
3714 bc_vec_free(&p->ops);
3718 static void bc_parse_create(BcParse *p, size_t func,
3719 BcParseParse parse, BcLexNext next)
3721 memset(p, 0, sizeof(BcParse));
3723 bc_lex_init(&p->l, next);
3724 bc_vec_init(&p->flags, sizeof(uint8_t), NULL);
3725 bc_vec_init(&p->exits, sizeof(BcInstPtr), NULL);
3726 bc_vec_init(&p->conds, sizeof(size_t), NULL);
3727 bc_vec_pushZeroByte(&p->flags);
3728 bc_vec_init(&p->ops, sizeof(BcLexType), NULL);
3731 // p->auto_part = p->nbraces = 0; - already is
3732 bc_parse_updateFunc(p, func);
3737 #define BC_PARSE_TOP_OP(p) (*((BcLexType *) bc_vec_top(&(p)->ops)))
3738 #define BC_PARSE_LEAF(p, rparen) \
3739 (((p) >= BC_INST_NUM && (p) <= BC_INST_SQRT) || (rparen) || \
3740 (p) == BC_INST_INC_POST || (p) == BC_INST_DEC_POST)
3742 // We can calculate the conversion between tokens and exprs by subtracting the
3743 // position of the first operator in the lex enum and adding the position of the
3744 // first in the expr enum. Note: This only works for binary operators.
3745 #define BC_PARSE_TOKEN_INST(t) ((char) ((t) -BC_LEX_NEG + BC_INST_NEG))
3747 static BcStatus bc_parse_else(BcParse *p);
3748 static BcStatus bc_parse_stmt(BcParse *p);
3749 static BcStatus bc_parse_expr(BcParse *p, uint8_t flags, BcParseNext next);
3750 static BcStatus bc_parse_expr_empty_ok(BcParse *p, uint8_t flags, BcParseNext next);
3752 static BcStatus bc_parse_operator(BcParse *p, BcLexType type, size_t start,
3753 size_t *nexprs, bool next)
3755 BcStatus s = BC_STATUS_SUCCESS;
3757 char l, r = bc_parse_op_PREC(type - BC_LEX_OP_INC);
3758 bool left = bc_parse_op_LEFT(type - BC_LEX_OP_INC);
3760 while (p->ops.len > start) {
3762 t = BC_PARSE_TOP_OP(p);
3763 if (t == BC_LEX_LPAREN) break;
3765 l = bc_parse_op_PREC(t - BC_LEX_OP_INC);
3766 if (l >= r && (l != r || !left)) break;
3768 bc_parse_push(p, BC_PARSE_TOKEN_INST(t));
3769 bc_vec_pop(&p->ops);
3770 *nexprs -= t != BC_LEX_OP_BOOL_NOT && t != BC_LEX_NEG;
3773 bc_vec_push(&p->ops, &type);
3774 if (next) s = bc_lex_next(&p->l);
3779 static BcStatus bc_parse_rightParen(BcParse *p, size_t ops_bgn, size_t *nexs)
3783 if (p->ops.len <= ops_bgn)
3784 return bc_error_bad_expression();
3785 top = BC_PARSE_TOP_OP(p);
3787 while (top != BC_LEX_LPAREN) {
3789 bc_parse_push(p, BC_PARSE_TOKEN_INST(top));
3791 bc_vec_pop(&p->ops);
3792 *nexs -= top != BC_LEX_OP_BOOL_NOT && top != BC_LEX_NEG;
3794 if (p->ops.len <= ops_bgn)
3795 return bc_error_bad_expression();
3796 top = BC_PARSE_TOP_OP(p);
3799 bc_vec_pop(&p->ops);
3801 return bc_lex_next(&p->l);
3804 static BcStatus bc_parse_params(BcParse *p, uint8_t flags)
3810 s = bc_lex_next(&p->l);
3813 for (nparams = 0; p->l.t.t != BC_LEX_RPAREN; ++nparams) {
3815 flags = (flags & ~(BC_PARSE_PRINT | BC_PARSE_REL)) | BC_PARSE_ARRAY;
3816 s = bc_parse_expr(p, flags, bc_parse_next_param);
3819 comma = p->l.t.t == BC_LEX_COMMA;
3821 s = bc_lex_next(&p->l);
3826 if (comma) return bc_error_bad_token();
3827 bc_parse_push(p, BC_INST_CALL);
3828 bc_parse_pushIndex(p, nparams);
3830 return BC_STATUS_SUCCESS;
3833 static BcStatus bc_parse_call(BcParse *p, char *name, uint8_t flags)
3836 BcId entry, *entry_ptr;
3841 s = bc_parse_params(p, flags);
3844 if (p->l.t.t != BC_LEX_RPAREN) {
3845 s = bc_error_bad_token();
3849 idx = bc_map_index(&G.prog.fn_map, &entry);
3851 if (idx == BC_VEC_INVALID_IDX) {
3852 name = xstrdup(entry.name);
3853 bc_parse_addFunc(p, name, &idx);
3854 idx = bc_map_index(&G.prog.fn_map, &entry);
3860 entry_ptr = bc_vec_item(&G.prog.fn_map, idx);
3861 bc_parse_pushIndex(p, entry_ptr->idx);
3863 return bc_lex_next(&p->l);
3870 static BcStatus bc_parse_name(BcParse *p, BcInst *type, uint8_t flags)
3875 name = xstrdup(p->l.t.v.v);
3876 s = bc_lex_next(&p->l);
3879 if (p->l.t.t == BC_LEX_LBRACKET) {
3881 s = bc_lex_next(&p->l);
3884 if (p->l.t.t == BC_LEX_RBRACKET) {
3886 if (!(flags & BC_PARSE_ARRAY)) {
3887 s = bc_error_bad_expression();
3891 *type = BC_INST_ARRAY;
3895 *type = BC_INST_ARRAY_ELEM;
3897 flags &= ~(BC_PARSE_PRINT | BC_PARSE_REL);
3898 s = bc_parse_expr(p, flags, bc_parse_next_elem);
3902 s = bc_lex_next(&p->l);
3904 bc_parse_push(p, *type);
3905 bc_parse_pushName(p, name);
3907 else if (p->l.t.t == BC_LEX_LPAREN) {
3909 if (flags & BC_PARSE_NOCALL) {
3910 s = bc_error_bad_token();
3914 *type = BC_INST_CALL;
3915 s = bc_parse_call(p, name, flags);
3918 *type = BC_INST_VAR;
3919 bc_parse_push(p, BC_INST_VAR);
3920 bc_parse_pushName(p, name);
3930 static BcStatus bc_parse_read(BcParse *p)
3934 s = bc_lex_next(&p->l);
3936 if (p->l.t.t != BC_LEX_LPAREN) return bc_error_bad_token();
3938 s = bc_lex_next(&p->l);
3940 if (p->l.t.t != BC_LEX_RPAREN) return bc_error_bad_token();
3942 bc_parse_push(p, BC_INST_READ);
3944 return bc_lex_next(&p->l);
3947 static BcStatus bc_parse_builtin(BcParse *p, BcLexType type, uint8_t flags,
3952 s = bc_lex_next(&p->l);
3954 if (p->l.t.t != BC_LEX_LPAREN) return bc_error_bad_token();
3956 flags = (flags & ~(BC_PARSE_PRINT | BC_PARSE_REL)) | BC_PARSE_ARRAY;
3958 s = bc_lex_next(&p->l);
3961 s = bc_parse_expr(p, flags, bc_parse_next_rel);
3964 if (p->l.t.t != BC_LEX_RPAREN) return bc_error_bad_token();
3966 *prev = (type == BC_LEX_KEY_LENGTH) ? BC_INST_LENGTH : BC_INST_SQRT;
3967 bc_parse_push(p, *prev);
3969 return bc_lex_next(&p->l);
3972 static BcStatus bc_parse_scale(BcParse *p, BcInst *type, uint8_t flags)
3976 s = bc_lex_next(&p->l);
3979 if (p->l.t.t != BC_LEX_LPAREN) {
3980 *type = BC_INST_SCALE;
3981 bc_parse_push(p, BC_INST_SCALE);
3982 return BC_STATUS_SUCCESS;
3985 *type = BC_INST_SCALE_FUNC;
3986 flags &= ~(BC_PARSE_PRINT | BC_PARSE_REL);
3988 s = bc_lex_next(&p->l);
3991 s = bc_parse_expr(p, flags, bc_parse_next_rel);
3993 if (p->l.t.t != BC_LEX_RPAREN) return bc_error_bad_token();
3994 bc_parse_push(p, BC_INST_SCALE_FUNC);
3996 return bc_lex_next(&p->l);
3999 static BcStatus bc_parse_incdec(BcParse *p, BcInst *prev, bool *paren_expr,
4000 size_t *nexprs, uint8_t flags)
4005 BcInst etype = *prev;
4007 if (etype == BC_INST_VAR || etype == BC_INST_ARRAY_ELEM ||
4008 etype == BC_INST_SCALE || etype == BC_INST_LAST ||
4009 etype == BC_INST_IBASE || etype == BC_INST_OBASE)
4011 *prev = inst = BC_INST_INC_POST + (p->l.t.t != BC_LEX_OP_INC);
4012 bc_parse_push(p, inst);
4013 s = bc_lex_next(&p->l);
4017 *prev = inst = BC_INST_INC_PRE + (p->l.t.t != BC_LEX_OP_INC);
4020 s = bc_lex_next(&p->l);
4024 // Because we parse the next part of the expression
4025 // right here, we need to increment this.
4026 *nexprs = *nexprs + 1;
4032 s = bc_parse_name(p, prev, flags | BC_PARSE_NOCALL);
4036 case BC_LEX_KEY_IBASE:
4037 case BC_LEX_KEY_LAST:
4038 case BC_LEX_KEY_OBASE:
4040 bc_parse_push(p, type - BC_LEX_KEY_IBASE + BC_INST_IBASE);
4041 s = bc_lex_next(&p->l);
4045 case BC_LEX_KEY_SCALE:
4047 s = bc_lex_next(&p->l);
4049 if (p->l.t.t == BC_LEX_LPAREN)
4050 s = bc_error_bad_token();
4052 bc_parse_push(p, BC_INST_SCALE);
4058 s = bc_error_bad_token();
4063 if (!s) bc_parse_push(p, inst);
4069 static BcStatus bc_parse_minus(BcParse *p, BcInst *prev, size_t ops_bgn,
4070 bool rparen, size_t *nexprs)
4074 BcInst etype = *prev;
4076 s = bc_lex_next(&p->l);
4079 type = rparen || etype == BC_INST_INC_POST || etype == BC_INST_DEC_POST ||
4080 (etype >= BC_INST_NUM && etype <= BC_INST_SQRT) ?
4083 *prev = BC_PARSE_TOKEN_INST(type);
4085 // We can just push onto the op stack because this is the largest
4086 // precedence operator that gets pushed. Inc/dec does not.
4087 if (type != BC_LEX_OP_MINUS)
4088 bc_vec_push(&p->ops, &type);
4090 s = bc_parse_operator(p, type, ops_bgn, nexprs, false);
4095 static BcStatus bc_parse_string(BcParse *p, char inst)
4097 char *str = xstrdup(p->l.t.v.v);
4099 bc_parse_push(p, BC_INST_STR);
4100 bc_parse_pushIndex(p, G.prog.strs.len);
4101 bc_vec_push(&G.prog.strs, &str);
4102 bc_parse_push(p, inst);
4104 return bc_lex_next(&p->l);
4107 static BcStatus bc_parse_print(BcParse *p)
4113 s = bc_lex_next(&p->l);
4118 if (type == BC_LEX_SCOLON || type == BC_LEX_NLINE)
4119 return bc_error("bad print statement");
4121 while (!s && type != BC_LEX_SCOLON && type != BC_LEX_NLINE) {
4123 if (type == BC_LEX_STR)
4124 s = bc_parse_string(p, BC_INST_PRINT_POP);
4126 s = bc_parse_expr(p, 0, bc_parse_next_print);
4128 bc_parse_push(p, BC_INST_PRINT_POP);
4133 comma = p->l.t.t == BC_LEX_COMMA;
4134 if (comma) s = bc_lex_next(&p->l);
4139 if (comma) return bc_error_bad_token();
4141 return bc_lex_next(&p->l);
4144 static BcStatus bc_parse_return(BcParse *p)
4150 if (!BC_PARSE_FUNC(p)) return bc_error_bad_token();
4152 s = bc_lex_next(&p->l);
4156 paren = t == BC_LEX_LPAREN;
4158 if (t == BC_LEX_NLINE || t == BC_LEX_SCOLON)
4159 bc_parse_push(p, BC_INST_RET0);
4162 s = bc_parse_expr_empty_ok(p, 0, bc_parse_next_expr);
4163 if (s == BC_STATUS_PARSE_EMPTY_EXP) {
4164 bc_parse_push(p, BC_INST_RET0);
4165 s = bc_lex_next(&p->l);
4169 if (!paren || p->l.t.last != BC_LEX_RPAREN) {
4170 s = bc_POSIX_requires("parentheses around return expressions");
4174 bc_parse_push(p, BC_INST_RET);
4180 static BcStatus bc_parse_endBody(BcParse *p, bool brace)
4182 BcStatus s = BC_STATUS_SUCCESS;
4184 if (p->flags.len <= 1 || (brace && p->nbraces == 0))
4185 return bc_error_bad_token();
4189 if (p->l.t.t == BC_LEX_RBRACE) {
4190 if (!p->nbraces) return bc_error_bad_token();
4192 s = bc_lex_next(&p->l);
4196 return bc_error_bad_token();
4199 if (BC_PARSE_IF(p)) {
4203 while (p->l.t.t == BC_LEX_NLINE) {
4204 s = bc_lex_next(&p->l);
4208 bc_vec_pop(&p->flags);
4210 flag_ptr = BC_PARSE_TOP_FLAG_PTR(p);
4211 *flag_ptr = (*flag_ptr | BC_PARSE_FLAG_IF_END);
4213 if (p->l.t.t == BC_LEX_KEY_ELSE) s = bc_parse_else(p);
4215 else if (BC_PARSE_ELSE(p)) {
4220 bc_vec_pop(&p->flags);
4222 ip = bc_vec_top(&p->exits);
4223 label = bc_vec_item(&p->func->labels, ip->idx);
4224 *label = p->func->code.len;
4226 bc_vec_pop(&p->exits);
4228 else if (BC_PARSE_FUNC_INNER(p)) {
4229 bc_parse_push(p, BC_INST_RET0);
4230 bc_parse_updateFunc(p, BC_PROG_MAIN);
4231 bc_vec_pop(&p->flags);
4235 BcInstPtr *ip = bc_vec_top(&p->exits);
4236 size_t *label = bc_vec_top(&p->conds);
4238 bc_parse_push(p, BC_INST_JUMP);
4239 bc_parse_pushIndex(p, *label);
4241 label = bc_vec_item(&p->func->labels, ip->idx);
4242 *label = p->func->code.len;
4244 bc_vec_pop(&p->flags);
4245 bc_vec_pop(&p->exits);
4246 bc_vec_pop(&p->conds);
4252 static void bc_parse_startBody(BcParse *p, uint8_t flags)
4254 uint8_t *flag_ptr = BC_PARSE_TOP_FLAG_PTR(p);
4255 flags |= (*flag_ptr & (BC_PARSE_FLAG_FUNC | BC_PARSE_FLAG_LOOP));
4256 flags |= BC_PARSE_FLAG_BODY;
4257 bc_vec_push(&p->flags, &flags);
4260 static void bc_parse_noElse(BcParse *p)
4264 uint8_t *flag_ptr = BC_PARSE_TOP_FLAG_PTR(p);
4266 *flag_ptr = (*flag_ptr & ~(BC_PARSE_FLAG_IF_END));
4268 ip = bc_vec_top(&p->exits);
4269 label = bc_vec_item(&p->func->labels, ip->idx);
4270 *label = p->func->code.len;
4272 bc_vec_pop(&p->exits);
4275 static BcStatus bc_parse_if(BcParse *p)
4280 s = bc_lex_next(&p->l);
4282 if (p->l.t.t != BC_LEX_LPAREN) return bc_error_bad_token();
4284 s = bc_lex_next(&p->l);
4286 s = bc_parse_expr(p, BC_PARSE_REL, bc_parse_next_rel);
4288 if (p->l.t.t != BC_LEX_RPAREN) return bc_error_bad_token();
4290 s = bc_lex_next(&p->l);
4292 bc_parse_push(p, BC_INST_JUMP_ZERO);
4294 ip.idx = p->func->labels.len;
4295 ip.func = ip.len = 0;
4297 bc_parse_pushIndex(p, ip.idx);
4298 bc_vec_push(&p->exits, &ip);
4299 bc_vec_push(&p->func->labels, &ip.idx);
4300 bc_parse_startBody(p, BC_PARSE_FLAG_IF);
4302 return BC_STATUS_SUCCESS;
4305 static BcStatus bc_parse_else(BcParse *p)
4309 if (!BC_PARSE_IF_END(p)) return bc_error_bad_token();
4311 ip.idx = p->func->labels.len;
4312 ip.func = ip.len = 0;
4314 bc_parse_push(p, BC_INST_JUMP);
4315 bc_parse_pushIndex(p, ip.idx);
4319 bc_vec_push(&p->exits, &ip);
4320 bc_vec_push(&p->func->labels, &ip.idx);
4321 bc_parse_startBody(p, BC_PARSE_FLAG_ELSE);
4323 return bc_lex_next(&p->l);
4326 static BcStatus bc_parse_while(BcParse *p)
4331 s = bc_lex_next(&p->l);
4333 if (p->l.t.t != BC_LEX_LPAREN) return bc_error_bad_token();
4334 s = bc_lex_next(&p->l);
4337 ip.idx = p->func->labels.len;
4339 bc_vec_push(&p->func->labels, &p->func->code.len);
4340 bc_vec_push(&p->conds, &ip.idx);
4342 ip.idx = p->func->labels.len;
4346 bc_vec_push(&p->exits, &ip);
4347 bc_vec_push(&p->func->labels, &ip.idx);
4349 s = bc_parse_expr(p, BC_PARSE_REL, bc_parse_next_rel);
4351 if (p->l.t.t != BC_LEX_RPAREN) return bc_error_bad_token();
4352 s = bc_lex_next(&p->l);
4355 bc_parse_push(p, BC_INST_JUMP_ZERO);
4356 bc_parse_pushIndex(p, ip.idx);
4357 bc_parse_startBody(p, BC_PARSE_FLAG_LOOP | BC_PARSE_FLAG_LOOP_INNER);
4359 return BC_STATUS_SUCCESS;
4362 static BcStatus bc_parse_for(BcParse *p)
4366 size_t cond_idx, exit_idx, body_idx, update_idx;
4368 s = bc_lex_next(&p->l);
4370 if (p->l.t.t != BC_LEX_LPAREN) return bc_error_bad_token();
4371 s = bc_lex_next(&p->l);
4374 if (p->l.t.t != BC_LEX_SCOLON)
4375 s = bc_parse_expr(p, 0, bc_parse_next_for);
4377 s = bc_POSIX_does_not_allow_empty_X_expression_in_for("init");
4380 if (p->l.t.t != BC_LEX_SCOLON) return bc_error_bad_token();
4381 s = bc_lex_next(&p->l);
4384 cond_idx = p->func->labels.len;
4385 update_idx = cond_idx + 1;
4386 body_idx = update_idx + 1;
4387 exit_idx = body_idx + 1;
4389 bc_vec_push(&p->func->labels, &p->func->code.len);
4391 if (p->l.t.t != BC_LEX_SCOLON)
4392 s = bc_parse_expr(p, BC_PARSE_REL, bc_parse_next_for);
4394 s = bc_POSIX_does_not_allow_empty_X_expression_in_for("condition");
4397 if (p->l.t.t != BC_LEX_SCOLON) return bc_error_bad_token();
4399 s = bc_lex_next(&p->l);
4402 bc_parse_push(p, BC_INST_JUMP_ZERO);
4403 bc_parse_pushIndex(p, exit_idx);
4404 bc_parse_push(p, BC_INST_JUMP);
4405 bc_parse_pushIndex(p, body_idx);
4407 ip.idx = p->func->labels.len;
4409 bc_vec_push(&p->conds, &update_idx);
4410 bc_vec_push(&p->func->labels, &p->func->code.len);
4412 if (p->l.t.t != BC_LEX_RPAREN)
4413 s = bc_parse_expr(p, 0, bc_parse_next_rel);
4415 s = bc_POSIX_does_not_allow_empty_X_expression_in_for("update");
4419 if (p->l.t.t != BC_LEX_RPAREN) return bc_error_bad_token();
4420 bc_parse_push(p, BC_INST_JUMP);
4421 bc_parse_pushIndex(p, cond_idx);
4422 bc_vec_push(&p->func->labels, &p->func->code.len);
4428 bc_vec_push(&p->exits, &ip);
4429 bc_vec_push(&p->func->labels, &ip.idx);
4431 bc_parse_startBody(p, BC_PARSE_FLAG_LOOP | BC_PARSE_FLAG_LOOP_INNER);
4433 return BC_STATUS_SUCCESS;
4436 static BcStatus bc_parse_loopExit(BcParse *p, BcLexType type)
4442 if (!BC_PARSE_LOOP(p)) return bc_error_bad_token();
4444 if (type == BC_LEX_KEY_BREAK) {
4446 if (p->exits.len == 0) return bc_error_bad_token();
4448 i = p->exits.len - 1;
4449 ip = bc_vec_item(&p->exits, i);
4451 while (!ip->func && i < p->exits.len) ip = bc_vec_item(&p->exits, i--);
4452 if (i >= p->exits.len && !ip->func) return bc_error_bad_token();
4457 i = *((size_t *) bc_vec_top(&p->conds));
4459 bc_parse_push(p, BC_INST_JUMP);
4460 bc_parse_pushIndex(p, i);
4462 s = bc_lex_next(&p->l);
4465 if (p->l.t.t != BC_LEX_SCOLON && p->l.t.t != BC_LEX_NLINE)
4466 return bc_error_bad_token();
4468 return bc_lex_next(&p->l);
4471 static BcStatus bc_parse_func(BcParse *p)
4474 bool var, comma = false;
4478 s = bc_lex_next(&p->l);
4480 if (p->l.t.t != BC_LEX_NAME)
4481 return bc_error("bad function definition");
4483 name = xstrdup(p->l.t.v.v);
4484 bc_parse_addFunc(p, name, &p->fidx);
4486 s = bc_lex_next(&p->l);
4488 if (p->l.t.t != BC_LEX_LPAREN)
4489 return bc_error("bad function definition");
4490 s = bc_lex_next(&p->l);
4493 while (p->l.t.t != BC_LEX_RPAREN) {
4495 if (p->l.t.t != BC_LEX_NAME)
4496 return bc_error("bad function definition");
4500 name = xstrdup(p->l.t.v.v);
4501 s = bc_lex_next(&p->l);
4504 var = p->l.t.t != BC_LEX_LBRACKET;
4508 s = bc_lex_next(&p->l);
4511 if (p->l.t.t != BC_LEX_RBRACKET) {
4512 s = bc_error("bad function definition");
4516 s = bc_lex_next(&p->l);
4520 comma = p->l.t.t == BC_LEX_COMMA;
4522 s = bc_lex_next(&p->l);
4526 s = bc_func_insert(p->func, name, var);
4530 if (comma) return bc_error("bad function definition");
4532 flags = BC_PARSE_FLAG_FUNC | BC_PARSE_FLAG_FUNC_INNER | BC_PARSE_FLAG_BODY;
4533 bc_parse_startBody(p, flags);
4535 s = bc_lex_next(&p->l);
4538 if (p->l.t.t != BC_LEX_LBRACE)
4539 s = bc_POSIX_requires("the left brace be on the same line as the function header");
4548 static BcStatus bc_parse_auto(BcParse *p)
4551 bool comma, var, one;
4554 if (!p->auto_part) return bc_error_bad_token();
4555 s = bc_lex_next(&p->l);
4558 p->auto_part = comma = false;
4559 one = p->l.t.t == BC_LEX_NAME;
4561 while (p->l.t.t == BC_LEX_NAME) {
4563 name = xstrdup(p->l.t.v.v);
4564 s = bc_lex_next(&p->l);
4567 var = p->l.t.t != BC_LEX_LBRACKET;
4570 s = bc_lex_next(&p->l);
4573 if (p->l.t.t != BC_LEX_RBRACKET) {
4574 s = bc_error("bad function definition");
4578 s = bc_lex_next(&p->l);
4582 comma = p->l.t.t == BC_LEX_COMMA;
4584 s = bc_lex_next(&p->l);
4588 s = bc_func_insert(p->func, name, var);
4592 if (comma) return bc_error("bad function definition");
4593 if (!one) return bc_error("no auto variable found");
4595 if (p->l.t.t != BC_LEX_NLINE && p->l.t.t != BC_LEX_SCOLON)
4596 return bc_error_bad_token();
4598 return bc_lex_next(&p->l);
4605 static BcStatus bc_parse_body(BcParse *p, bool brace)
4607 BcStatus s = BC_STATUS_SUCCESS;
4608 uint8_t *flag_ptr = bc_vec_top(&p->flags);
4610 *flag_ptr &= ~(BC_PARSE_FLAG_BODY);
4612 if (*flag_ptr & BC_PARSE_FLAG_FUNC_INNER) {
4614 if (!brace) return bc_error_bad_token();
4615 p->auto_part = p->l.t.t != BC_LEX_KEY_AUTO;
4617 if (!p->auto_part) {
4618 s = bc_parse_auto(p);
4622 if (p->l.t.t == BC_LEX_NLINE) s = bc_lex_next(&p->l);
4625 s = bc_parse_stmt(p);
4626 if (!s && !brace) s = bc_parse_endBody(p, false);
4632 static BcStatus bc_parse_stmt(BcParse *p)
4634 BcStatus s = BC_STATUS_SUCCESS;
4640 return bc_lex_next(&p->l);
4643 case BC_LEX_KEY_ELSE:
4645 p->auto_part = false;
4651 if (!BC_PARSE_BODY(p)) return bc_error_bad_token();
4654 s = bc_lex_next(&p->l);
4657 return bc_parse_body(p, true);
4660 case BC_LEX_KEY_AUTO:
4662 return bc_parse_auto(p);
4667 p->auto_part = false;
4669 if (BC_PARSE_IF_END(p)) {
4671 return BC_STATUS_SUCCESS;
4673 else if (BC_PARSE_BODY(p))
4674 return bc_parse_body(p, false);
4684 case BC_LEX_OP_MINUS:
4685 case BC_LEX_OP_BOOL_NOT:
4689 case BC_LEX_KEY_IBASE:
4690 case BC_LEX_KEY_LAST:
4691 case BC_LEX_KEY_LENGTH:
4692 case BC_LEX_KEY_OBASE:
4693 case BC_LEX_KEY_READ:
4694 case BC_LEX_KEY_SCALE:
4695 case BC_LEX_KEY_SQRT:
4697 s = bc_parse_expr(p, BC_PARSE_PRINT, bc_parse_next_expr);
4701 case BC_LEX_KEY_ELSE:
4703 s = bc_parse_else(p);
4709 while (!s && p->l.t.t == BC_LEX_SCOLON) s = bc_lex_next(&p->l);
4715 s = bc_parse_endBody(p, true);
4721 s = bc_parse_string(p, BC_INST_PRINT_STR);
4725 case BC_LEX_KEY_BREAK:
4726 case BC_LEX_KEY_CONTINUE:
4728 s = bc_parse_loopExit(p, p->l.t.t);
4732 case BC_LEX_KEY_FOR:
4734 s = bc_parse_for(p);
4738 case BC_LEX_KEY_HALT:
4740 bc_parse_push(p, BC_INST_HALT);
4741 s = bc_lex_next(&p->l);
4751 case BC_LEX_KEY_LIMITS:
4753 // "limits" is a compile-time command,
4754 // the output is produced at _parse time_.
4755 s = bc_lex_next(&p->l);
4758 "BC_BASE_MAX = "BC_MAX_OBASE_STR "\n"
4759 "BC_DIM_MAX = "BC_MAX_DIM_STR "\n"
4760 "BC_SCALE_MAX = "BC_MAX_SCALE_STR "\n"
4761 "BC_STRING_MAX = "BC_MAX_STRING_STR"\n"
4762 "BC_NAME_MAX = "BC_MAX_NAME_STR "\n"
4763 "BC_NUM_MAX = "BC_MAX_NUM_STR "\n"
4764 "MAX Exponent = "BC_MAX_EXP_STR "\n"
4765 "Number of vars = "BC_MAX_VARS_STR "\n"
4770 case BC_LEX_KEY_PRINT:
4772 s = bc_parse_print(p);
4776 case BC_LEX_KEY_QUIT:
4778 // "quit" is a compile-time command. For example,
4779 // "if (0 == 1) quit" terminates when parsing the statement,
4780 // not when it is executed
4781 QUIT_OR_RETURN_TO_MAIN;
4784 case BC_LEX_KEY_RETURN:
4786 s = bc_parse_return(p);
4790 case BC_LEX_KEY_WHILE:
4792 s = bc_parse_while(p);
4798 s = bc_error_bad_token();
4806 static BcStatus bc_parse_parse(BcParse *p)
4810 if (p->l.t.t == BC_LEX_EOF)
4811 s = p->flags.len > 0 ? bc_error("block end could not be found") : bc_error("end of file");
4812 else if (p->l.t.t == BC_LEX_KEY_DEFINE) {
4813 if (!BC_PARSE_CAN_EXEC(p)) return bc_error_bad_token();
4814 s = bc_parse_func(p);
4817 s = bc_parse_stmt(p);
4819 if (s || G_interrupt) {
4821 s = BC_STATUS_FAILURE;
4827 static BcStatus bc_parse_expr_empty_ok(BcParse *p, uint8_t flags, BcParseNext next)
4829 BcStatus s = BC_STATUS_SUCCESS;
4830 BcInst prev = BC_INST_PRINT;
4831 BcLexType top, t = p->l.t.t;
4832 size_t nexprs = 0, ops_bgn = p->ops.len;
4833 unsigned nparens, nrelops;
4834 bool paren_first, paren_expr, rprn, done, get_token, assign, bin_last;
4836 paren_first = p->l.t.t == BC_LEX_LPAREN;
4837 nparens = nrelops = 0;
4838 paren_expr = rprn = done = get_token = assign = false;
4841 for (; !G_interrupt && !s && !done && bc_parse_exprs(t); t = p->l.t.t) {
4847 s = bc_parse_incdec(p, &prev, &paren_expr, &nexprs, flags);
4848 rprn = get_token = bin_last = false;
4852 case BC_LEX_OP_MINUS:
4854 s = bc_parse_minus(p, &prev, ops_bgn, rprn, &nexprs);
4855 rprn = get_token = false;
4856 bin_last = prev == BC_INST_MINUS;
4860 case BC_LEX_OP_ASSIGN_POWER:
4861 case BC_LEX_OP_ASSIGN_MULTIPLY:
4862 case BC_LEX_OP_ASSIGN_DIVIDE:
4863 case BC_LEX_OP_ASSIGN_MODULUS:
4864 case BC_LEX_OP_ASSIGN_PLUS:
4865 case BC_LEX_OP_ASSIGN_MINUS:
4866 case BC_LEX_OP_ASSIGN:
4868 if (prev != BC_INST_VAR && prev != BC_INST_ARRAY_ELEM &&
4869 prev != BC_INST_SCALE && prev != BC_INST_IBASE &&
4870 prev != BC_INST_OBASE && prev != BC_INST_LAST)
4872 s = bc_error("bad assignment:"
4873 " left side must be scale,"
4874 " ibase, obase, last, var,"
4881 case BC_LEX_OP_POWER:
4882 case BC_LEX_OP_MULTIPLY:
4883 case BC_LEX_OP_DIVIDE:
4884 case BC_LEX_OP_MODULUS:
4885 case BC_LEX_OP_PLUS:
4886 case BC_LEX_OP_REL_EQ:
4887 case BC_LEX_OP_REL_LE:
4888 case BC_LEX_OP_REL_GE:
4889 case BC_LEX_OP_REL_NE:
4890 case BC_LEX_OP_REL_LT:
4891 case BC_LEX_OP_REL_GT:
4892 case BC_LEX_OP_BOOL_NOT:
4893 case BC_LEX_OP_BOOL_OR:
4894 case BC_LEX_OP_BOOL_AND:
4896 if (((t == BC_LEX_OP_BOOL_NOT) != bin_last)
4897 || (t != BC_LEX_OP_BOOL_NOT && prev == BC_INST_BOOL_NOT)
4899 return bc_error_bad_expression();
4902 nrelops += t >= BC_LEX_OP_REL_EQ && t <= BC_LEX_OP_REL_GT;
4903 prev = BC_PARSE_TOKEN_INST(t);
4904 s = bc_parse_operator(p, t, ops_bgn, &nexprs, true);
4905 rprn = get_token = false;
4906 bin_last = t != BC_LEX_OP_BOOL_NOT;
4913 if (BC_PARSE_LEAF(prev, rprn))
4914 return bc_error_bad_expression();
4916 paren_expr = rprn = bin_last = false;
4918 bc_vec_push(&p->ops, &t);
4925 if (bin_last || prev == BC_INST_BOOL_NOT)
4926 return bc_error_bad_expression();
4929 s = BC_STATUS_SUCCESS;
4934 else if (!paren_expr)
4935 return BC_STATUS_PARSE_EMPTY_EXP;
4938 paren_expr = rprn = true;
4939 get_token = bin_last = false;
4941 s = bc_parse_rightParen(p, ops_bgn, &nexprs);
4948 if (BC_PARSE_LEAF(prev, rprn))
4949 return bc_error_bad_expression();
4951 rprn = get_token = bin_last = false;
4952 s = bc_parse_name(p, &prev, flags & ~BC_PARSE_NOCALL);
4960 if (BC_PARSE_LEAF(prev, rprn))
4961 return bc_error_bad_expression();
4962 bc_parse_number(p, &prev, &nexprs);
4963 paren_expr = get_token = true;
4964 rprn = bin_last = false;
4969 case BC_LEX_KEY_IBASE:
4970 case BC_LEX_KEY_LAST:
4971 case BC_LEX_KEY_OBASE:
4973 if (BC_PARSE_LEAF(prev, rprn))
4974 return bc_error_bad_expression();
4975 prev = (char) (t - BC_LEX_KEY_IBASE + BC_INST_IBASE);
4976 bc_parse_push(p, (char) prev);
4978 paren_expr = get_token = true;
4979 rprn = bin_last = false;
4985 case BC_LEX_KEY_LENGTH:
4986 case BC_LEX_KEY_SQRT:
4988 if (BC_PARSE_LEAF(prev, rprn))
4989 return bc_error_bad_expression();
4990 s = bc_parse_builtin(p, t, flags, &prev);
4992 rprn = get_token = bin_last = false;
4998 case BC_LEX_KEY_READ:
5000 if (BC_PARSE_LEAF(prev, rprn))
5001 return bc_error_bad_expression();
5002 else if (flags & BC_PARSE_NOREAD)
5003 s = bc_error_nested_read_call();
5005 s = bc_parse_read(p);
5008 rprn = get_token = bin_last = false;
5010 prev = BC_INST_READ;
5015 case BC_LEX_KEY_SCALE:
5017 if (BC_PARSE_LEAF(prev, rprn))
5018 return bc_error_bad_expression();
5019 s = bc_parse_scale(p, &prev, flags);
5021 rprn = get_token = bin_last = false;
5023 prev = BC_INST_SCALE;
5030 s = bc_error_bad_token();
5035 if (!s && get_token) s = bc_lex_next(&p->l);
5039 if (G_interrupt) return BC_STATUS_FAILURE; // ^C: stop parsing
5041 while (p->ops.len > ops_bgn) {
5043 top = BC_PARSE_TOP_OP(p);
5044 assign = top >= BC_LEX_OP_ASSIGN_POWER && top <= BC_LEX_OP_ASSIGN;
5046 if (top == BC_LEX_LPAREN || top == BC_LEX_RPAREN)
5047 return bc_error_bad_expression();
5049 bc_parse_push(p, BC_PARSE_TOKEN_INST(top));
5051 nexprs -= top != BC_LEX_OP_BOOL_NOT && top != BC_LEX_NEG;
5052 bc_vec_pop(&p->ops);
5055 if (prev == BC_INST_BOOL_NOT || nexprs != 1)
5056 return bc_error_bad_expression();
5058 // next is BcParseNext, byte array of up to 4 BC_LEX's, packed into 32-bit word
5060 if (t == (next & 0x7f))
5062 if (next & 0x80) // last element?
5066 return bc_error_bad_expression();
5069 if (!(flags & BC_PARSE_REL) && nrelops) {
5070 s = bc_POSIX_does_not_allow("comparison operators outside if or loops");
5073 else if ((flags & BC_PARSE_REL) && nrelops > 1) {
5074 s = bc_POSIX_requires("exactly one comparison operator per condition");
5078 if (flags & BC_PARSE_PRINT) {
5079 if (paren_first || !assign) bc_parse_push(p, BC_INST_PRINT);
5080 bc_parse_push(p, BC_INST_POP);
5086 static BcStatus bc_parse_expr(BcParse *p, uint8_t flags, BcParseNext next)
5090 s = bc_parse_expr_empty_ok(p, flags, next);
5091 if (s == BC_STATUS_PARSE_EMPTY_EXP)
5092 return bc_error("empty expression");
5096 static void bc_parse_init(BcParse *p, size_t func)
5098 bc_parse_create(p, func, bc_parse_parse, bc_lex_token);
5101 static BcStatus bc_parse_expression(BcParse *p, uint8_t flags)
5103 return bc_parse_expr(p, flags, bc_parse_next_read);
5110 #define DC_PARSE_BUF_LEN ((int) (sizeof(uint32_t) * CHAR_BIT))
5112 static BcStatus dc_parse_register(BcParse *p)
5117 s = bc_lex_next(&p->l);
5119 if (p->l.t.t != BC_LEX_NAME) return bc_error_bad_token();
5121 name = xstrdup(p->l.t.v.v);
5122 bc_parse_pushName(p, name);
5127 static BcStatus dc_parse_string(BcParse *p)
5129 char *str, *name, b[DC_PARSE_BUF_LEN + 1];
5130 size_t idx, len = G.prog.strs.len;
5132 sprintf(b, "%0*zu", DC_PARSE_BUF_LEN, len);
5135 str = xstrdup(p->l.t.v.v);
5136 bc_parse_push(p, BC_INST_STR);
5137 bc_parse_pushIndex(p, len);
5138 bc_vec_push(&G.prog.strs, &str);
5139 bc_parse_addFunc(p, name, &idx);
5141 return bc_lex_next(&p->l);
5144 static BcStatus dc_parse_mem(BcParse *p, uint8_t inst, bool name, bool store)
5148 bc_parse_push(p, inst);
5150 s = dc_parse_register(p);
5155 bc_parse_push(p, BC_INST_SWAP);
5156 bc_parse_push(p, BC_INST_ASSIGN);
5157 bc_parse_push(p, BC_INST_POP);
5160 return bc_lex_next(&p->l);
5163 static BcStatus dc_parse_cond(BcParse *p, uint8_t inst)
5167 bc_parse_push(p, inst);
5168 bc_parse_push(p, BC_INST_EXEC_COND);
5170 s = dc_parse_register(p);
5173 s = bc_lex_next(&p->l);
5176 if (p->l.t.t == BC_LEX_ELSE) {
5177 s = dc_parse_register(p);
5179 s = bc_lex_next(&p->l);
5182 bc_parse_push(p, BC_PARSE_STREND);
5187 static BcStatus dc_parse_token(BcParse *p, BcLexType t, uint8_t flags)
5189 BcStatus s = BC_STATUS_SUCCESS;
5192 bool assign, get_token = false;
5196 case BC_LEX_OP_REL_EQ:
5197 case BC_LEX_OP_REL_LE:
5198 case BC_LEX_OP_REL_GE:
5199 case BC_LEX_OP_REL_NE:
5200 case BC_LEX_OP_REL_LT:
5201 case BC_LEX_OP_REL_GT:
5203 s = dc_parse_cond(p, t - BC_LEX_OP_REL_EQ + BC_INST_REL_EQ);
5210 s = dc_parse_mem(p, BC_INST_ARRAY_ELEM, true, t == BC_LEX_COLON);
5216 s = dc_parse_string(p);
5223 if (t == BC_LEX_NEG) {
5224 s = bc_lex_next(&p->l);
5226 if (p->l.t.t != BC_LEX_NUMBER)
5227 return bc_error_bad_token();
5230 bc_parse_number(p, &prev, &p->nbraces);
5232 if (t == BC_LEX_NEG) bc_parse_push(p, BC_INST_NEG);
5238 case BC_LEX_KEY_READ:
5240 if (flags & BC_PARSE_NOREAD)
5241 s = bc_error_nested_read_call();
5243 bc_parse_push(p, BC_INST_READ);
5248 case BC_LEX_OP_ASSIGN:
5249 case BC_LEX_STORE_PUSH:
5251 assign = t == BC_LEX_OP_ASSIGN;
5252 inst = assign ? BC_INST_VAR : BC_INST_PUSH_TO_VAR;
5253 s = dc_parse_mem(p, inst, true, assign);
5258 case BC_LEX_LOAD_POP:
5260 inst = t == BC_LEX_LOAD_POP ? BC_INST_PUSH_VAR : BC_INST_LOAD;
5261 s = dc_parse_mem(p, inst, true, false);
5265 case BC_LEX_STORE_IBASE:
5266 case BC_LEX_STORE_SCALE:
5267 case BC_LEX_STORE_OBASE:
5269 inst = t - BC_LEX_STORE_IBASE + BC_INST_IBASE;
5270 s = dc_parse_mem(p, inst, false, true);
5276 s = bc_error_bad_token();
5282 if (!s && get_token) s = bc_lex_next(&p->l);
5287 static BcStatus dc_parse_expr(BcParse *p, uint8_t flags)
5289 BcStatus s = BC_STATUS_SUCCESS;
5293 if (flags & BC_PARSE_NOCALL) p->nbraces = G.prog.results.len;
5295 for (t = p->l.t.t; !s && t != BC_LEX_EOF; t = p->l.t.t) {
5297 inst = dc_parse_insts[t];
5299 if (inst != BC_INST_INVALID) {
5300 bc_parse_push(p, inst);
5301 s = bc_lex_next(&p->l);
5304 s = dc_parse_token(p, t, flags);
5307 if (!s && p->l.t.t == BC_LEX_EOF && (flags & BC_PARSE_NOCALL))
5308 bc_parse_push(p, BC_INST_POP_EXEC);
5313 static BcStatus dc_parse_parse(BcParse *p)
5317 if (p->l.t.t == BC_LEX_EOF)
5318 s = bc_error("end of file");
5320 s = dc_parse_expr(p, 0);
5322 if (s || G_interrupt) {
5324 s = BC_STATUS_FAILURE;
5330 static void dc_parse_init(BcParse *p, size_t func)
5332 bc_parse_create(p, func, dc_parse_parse, dc_lex_token);
5337 static void common_parse_init(BcParse *p, size_t func)
5340 IF_BC(bc_parse_init(p, func);)
5342 IF_DC(dc_parse_init(p, func);)
5346 static BcStatus common_parse_expr(BcParse *p, uint8_t flags)
5349 IF_BC(return bc_parse_expression(p, flags);)
5351 IF_DC(return dc_parse_expr(p, flags);)
5355 static BcVec* bc_program_search(char *id, bool var)
5363 v = var ? &G.prog.vars : &G.prog.arrs;
5364 map = var ? &G.prog.var_map : &G.prog.arr_map;
5368 new = bc_map_insert(map, &e, &i); // 1 if insertion was successful
5371 bc_array_init(&data.v, var);
5372 bc_vec_push(v, &data.v);
5375 ptr = bc_vec_item(map, i);
5376 if (new) ptr->name = xstrdup(e.name);
5377 return bc_vec_item(v, ptr->idx);
5380 static BcStatus bc_program_num(BcResult *r, BcNum **num, bool hex)
5382 BcStatus s = BC_STATUS_SUCCESS;
5387 case BC_RESULT_TEMP:
5388 case BC_RESULT_IBASE:
5389 case BC_RESULT_SCALE:
5390 case BC_RESULT_OBASE:
5396 case BC_RESULT_CONSTANT:
5398 char **str = bc_vec_item(&G.prog.consts, r->d.id.idx);
5399 size_t base_t, len = strlen(*str);
5402 bc_num_init(&r->d.n, len);
5404 hex = hex && len == 1;
5405 base = hex ? &G.prog.hexb : &G.prog.ib;
5406 base_t = hex ? BC_NUM_MAX_IBASE : G.prog.ib_t;
5407 s = bc_num_parse(&r->d.n, *str, base, base_t);
5410 bc_num_free(&r->d.n);
5415 r->t = BC_RESULT_TEMP;
5421 case BC_RESULT_ARRAY:
5422 case BC_RESULT_ARRAY_ELEM:
5426 v = bc_program_search(r->d.id.name, r->t == BC_RESULT_VAR);
5428 if (r->t == BC_RESULT_ARRAY_ELEM) {
5430 if (v->len <= r->d.id.idx) bc_array_expand(v, r->d.id.idx + 1);
5431 *num = bc_vec_item(v, r->d.id.idx);
5434 *num = bc_vec_top(v);
5439 case BC_RESULT_LAST:
5441 *num = &G.prog.last;
5455 static BcStatus bc_program_binOpPrep(BcResult **l, BcNum **ln,
5456 BcResult **r, BcNum **rn, bool assign)
5460 BcResultType lt, rt;
5462 if (!BC_PROG_STACK(&G.prog.results, 2))
5463 return bc_error_stack_has_too_few_elements();
5465 *r = bc_vec_item_rev(&G.prog.results, 0);
5466 *l = bc_vec_item_rev(&G.prog.results, 1);
5470 hex = assign && (lt == BC_RESULT_IBASE || lt == BC_RESULT_OBASE);
5472 s = bc_program_num(*l, ln, false);
5474 s = bc_program_num(*r, rn, hex);
5477 // We run this again under these conditions in case any vector has been
5478 // reallocated out from under the BcNums or arrays we had.
5479 if (lt == rt && (lt == BC_RESULT_VAR || lt == BC_RESULT_ARRAY_ELEM)) {
5480 s = bc_program_num(*l, ln, false);
5484 if (!BC_PROG_NUM((*l), (*ln)) && (!assign || (*l)->t != BC_RESULT_VAR))
5485 return bc_error_variable_is_wrong_type();
5486 if (!assign && !BC_PROG_NUM((*r), (*ln)))
5487 return bc_error_variable_is_wrong_type();
5492 static void bc_program_binOpRetire(BcResult *r)
5494 r->t = BC_RESULT_TEMP;
5495 bc_vec_pop(&G.prog.results);
5496 bc_vec_pop(&G.prog.results);
5497 bc_vec_push(&G.prog.results, r);
5500 static BcStatus bc_program_prep(BcResult **r, BcNum **n)
5504 if (!BC_PROG_STACK(&G.prog.results, 1))
5505 return bc_error_stack_has_too_few_elements();
5506 *r = bc_vec_top(&G.prog.results);
5508 s = bc_program_num(*r, n, false);
5511 if (!BC_PROG_NUM((*r), (*n)))
5512 return bc_error_variable_is_wrong_type();
5517 static void bc_program_retire(BcResult *r, BcResultType t)
5520 bc_vec_pop(&G.prog.results);
5521 bc_vec_push(&G.prog.results, r);
5524 static BcStatus bc_program_op(char inst)
5527 BcResult *opd1, *opd2, res;
5528 BcNum *n1, *n2 = NULL;
5530 s = bc_program_binOpPrep(&opd1, &n1, &opd2, &n2, false);
5532 bc_num_init(&res.d.n, BC_NUM_DEF_SIZE);
5534 s = bc_program_ops[inst - BC_INST_POWER](n1, n2, &res.d.n, G.prog.scale);
5536 bc_program_binOpRetire(&res);
5541 bc_num_free(&res.d.n);
5545 static BcStatus bc_program_read(void)
5547 const char *sv_file;
5553 BcFunc *f = bc_vec_item(&G.prog.fns, BC_PROG_READ);
5555 for (i = 0; i < G.prog.stack.len; ++i) {
5556 BcInstPtr *ip_ptr = bc_vec_item(&G.prog.stack, i);
5557 if (ip_ptr->func == BC_PROG_READ)
5558 return bc_error_nested_read_call();
5561 bc_vec_pop_all(&f->code);
5562 bc_char_vec_init(&buf);
5564 sv_file = G.prog.file;
5567 s = bc_read_line(&buf, "read> ");
5570 common_parse_init(&parse, BC_PROG_READ);
5571 bc_lex_file(&parse.l);
5573 s = bc_parse_text(&parse, buf.v);
5574 if (s) goto exec_err;
5575 s = common_parse_expr(&parse, BC_PARSE_NOREAD);
5576 if (s) goto exec_err;
5578 if (parse.l.t.t != BC_LEX_NLINE && parse.l.t.t != BC_LEX_EOF) {
5579 s = bc_error("bad read() expression");
5583 ip.func = BC_PROG_READ;
5585 ip.len = G.prog.results.len;
5587 // Update this pointer, just in case.
5588 f = bc_vec_item(&G.prog.fns, BC_PROG_READ);
5590 bc_vec_pushByte(&f->code, BC_INST_POP_EXEC);
5591 bc_vec_push(&G.prog.stack, &ip);
5594 G.prog.file = sv_file;
5595 bc_parse_free(&parse);
5601 static size_t bc_program_index(char *code, size_t *bgn)
5603 char amt = code[(*bgn)++], i = 0;
5606 for (; i < amt; ++i, ++(*bgn))
5607 res |= (((size_t)((int) code[*bgn]) & UCHAR_MAX) << (i * CHAR_BIT));
5612 static char *bc_program_name(char *code, size_t *bgn)
5615 char c, *s, *str = code + *bgn, *ptr = strchr(str, BC_PARSE_STREND);
5617 s = xmalloc(ptr - str + 1);
5620 for (i = 0; c != 0 && c != BC_PARSE_STREND; c = code[(*bgn)++], ++i)
5628 static void bc_program_printString(const char *str, size_t *nchars)
5630 size_t i, len = strlen(str);
5639 for (i = 0; i < len; ++i, ++(*nchars)) {
5643 if (c != '\\' || i == len - 1)
5703 // Just print the backslash and following character.
5714 static BcStatus bc_program_print(char inst, size_t idx)
5716 BcStatus s = BC_STATUS_SUCCESS;
5721 bool pop = inst != BC_INST_PRINT;
5723 if (!BC_PROG_STACK(&G.prog.results, idx + 1))
5724 return bc_error_stack_has_too_few_elements();
5726 r = bc_vec_item_rev(&G.prog.results, idx);
5727 s = bc_program_num(r, &num, false);
5730 if (BC_PROG_NUM(r, num)) {
5731 s = bc_num_print(num, &G.prog.ob, G.prog.ob_t, !pop, &G.prog.nchars, G.prog.len);
5732 if (!s) bc_num_copy(&G.prog.last, num);
5736 idx = (r->t == BC_RESULT_STR) ? r->d.id.idx : num->rdx;
5737 str = *((char **) bc_vec_item(&G.prog.strs, idx));
5739 if (inst == BC_INST_PRINT_STR) {
5740 for (i = 0, len = strlen(str); i < len; ++i) {
5743 if (c == '\n') G.prog.nchars = SIZE_MAX;
5748 bc_program_printString(str, &G.prog.nchars);
5749 if (inst == BC_INST_PRINT) bb_putchar('\n');
5753 if (!s && pop) bc_vec_pop(&G.prog.results);
5758 static BcStatus bc_program_negate(void)
5764 s = bc_program_prep(&ptr, &num);
5767 bc_num_init(&res.d.n, num->len);
5768 bc_num_copy(&res.d.n, num);
5769 if (res.d.n.len) res.d.n.neg = !res.d.n.neg;
5771 bc_program_retire(&res, BC_RESULT_TEMP);
5776 static BcStatus bc_program_logical(char inst)
5779 BcResult *opd1, *opd2, res;
5784 s = bc_program_binOpPrep(&opd1, &n1, &opd2, &n2, false);
5786 bc_num_init(&res.d.n, BC_NUM_DEF_SIZE);
5788 if (inst == BC_INST_BOOL_AND)
5789 cond = bc_num_cmp(n1, &G.prog.zero) && bc_num_cmp(n2, &G.prog.zero);
5790 else if (inst == BC_INST_BOOL_OR)
5791 cond = bc_num_cmp(n1, &G.prog.zero) || bc_num_cmp(n2, &G.prog.zero);
5794 cmp = bc_num_cmp(n1, n2);
5798 case BC_INST_REL_EQ:
5804 case BC_INST_REL_LE:
5810 case BC_INST_REL_GE:
5816 case BC_INST_REL_NE:
5822 case BC_INST_REL_LT:
5828 case BC_INST_REL_GT:
5836 (cond ? bc_num_one : bc_num_zero)(&res.d.n);
5838 bc_program_binOpRetire(&res);
5844 static BcStatus bc_program_assignStr(BcResult *r, BcVec *v,
5850 memset(&n2, 0, sizeof(BcNum));
5851 n2.rdx = res.d.id.idx = r->d.id.idx;
5852 res.t = BC_RESULT_STR;
5855 if (!BC_PROG_STACK(&G.prog.results, 2))
5856 return bc_error_stack_has_too_few_elements();
5858 bc_vec_pop(&G.prog.results);
5861 bc_vec_pop(&G.prog.results);
5863 bc_vec_push(&G.prog.results, &res);
5864 bc_vec_push(v, &n2);
5866 return BC_STATUS_SUCCESS;
5870 static BcStatus bc_program_copyToVar(char *name, bool var)
5877 if (!BC_PROG_STACK(&G.prog.results, 1))
5878 return bc_error_stack_has_too_few_elements();
5880 ptr = bc_vec_top(&G.prog.results);
5881 if ((ptr->t == BC_RESULT_ARRAY) != !var)
5882 return bc_error_variable_is_wrong_type();
5883 v = bc_program_search(name, var);
5886 if (ptr->t == BC_RESULT_STR && !var)
5887 return bc_error_variable_is_wrong_type();
5888 if (ptr->t == BC_RESULT_STR) return bc_program_assignStr(ptr, v, true);
5891 s = bc_program_num(ptr, &n, false);
5894 // Do this once more to make sure that pointers were not invalidated.
5895 v = bc_program_search(name, var);
5898 bc_num_init(&r.d.n, BC_NUM_DEF_SIZE);
5899 bc_num_copy(&r.d.n, n);
5902 bc_array_init(&r.d.v, true);
5903 bc_array_copy(&r.d.v, (BcVec *) n);
5906 bc_vec_push(v, &r.d);
5907 bc_vec_pop(&G.prog.results);
5912 static BcStatus bc_program_assign(char inst)
5915 BcResult *left, *right, res;
5916 BcNum *l = NULL, *r = NULL;
5917 bool assign = inst == BC_INST_ASSIGN, ib, sc;
5919 s = bc_program_binOpPrep(&left, &l, &right, &r, assign);
5922 ib = left->t == BC_RESULT_IBASE;
5923 sc = left->t == BC_RESULT_SCALE;
5927 if (right->t == BC_RESULT_STR) {
5931 if (left->t != BC_RESULT_VAR)
5932 return bc_error_variable_is_wrong_type();
5933 v = bc_program_search(left->d.id.name, true);
5935 return bc_program_assignStr(right, v, false);
5939 if (left->t == BC_RESULT_CONSTANT || left->t == BC_RESULT_TEMP)
5940 return bc_error("bad assignment:"
5941 " left side must be scale,"
5942 " ibase, obase, last, var,"
5947 if (inst == BC_INST_ASSIGN_DIVIDE && !bc_num_cmp(r, &G.prog.zero))
5948 return bc_error("divide by zero");
5953 s = bc_program_ops[inst - BC_INST_ASSIGN_POWER](l, r, l, G.prog.scale);
5960 if (ib || sc || left->t == BC_RESULT_OBASE) {
5961 static const char *const msg[] = {
5962 "bad ibase; must be [2,16]", //BC_RESULT_IBASE
5963 "bad scale; must be [0,"BC_MAX_SCALE_STR"]", //BC_RESULT_SCALE
5964 NULL, //can't happen //BC_RESULT_LAST
5965 NULL, //can't happen //BC_RESULT_CONSTANT
5966 NULL, //can't happen //BC_RESULT_ONE
5967 "bad obase; must be [2,"BC_MAX_OBASE_STR"]", //BC_RESULT_OBASE
5970 unsigned long val, max;
5972 s = bc_num_ulong(l, &val);
5975 s = left->t - BC_RESULT_IBASE;
5978 ptr = &G.prog.scale;
5981 if (val < BC_NUM_MIN_BASE)
5982 return bc_error(msg[s]);
5983 max = ib ? BC_NUM_MAX_IBASE : BC_MAX_OBASE;
5984 ptr = ib ? &G.prog.ib_t : &G.prog.ob_t;
5988 return bc_error(msg[s]);
5990 bc_num_copy(ib ? &G.prog.ib : &G.prog.ob, l);
5992 *ptr = (size_t) val;
5993 s = BC_STATUS_SUCCESS;
5996 bc_num_init(&res.d.n, l->len);
5997 bc_num_copy(&res.d.n, l);
5998 bc_program_binOpRetire(&res);
6004 #define bc_program_pushVar(code, bgn, pop, copy) \
6005 bc_program_pushVar(code, bgn)
6006 // for bc, 'pop' and 'copy' are always false
6008 static BcStatus bc_program_pushVar(char *code, size_t *bgn,
6009 bool pop, bool copy)
6011 BcStatus s = BC_STATUS_SUCCESS;
6013 char *name = bc_program_name(code, bgn);
6015 r.t = BC_RESULT_VAR;
6020 BcVec *v = bc_program_search(name, true);
6021 BcNum *num = bc_vec_top(v);
6025 if (!BC_PROG_STACK(v, 2 - copy)) {
6027 return bc_error_stack_has_too_few_elements();
6033 if (!BC_PROG_STR(num)) {
6035 r.t = BC_RESULT_TEMP;
6037 bc_num_init(&r.d.n, BC_NUM_DEF_SIZE);
6038 bc_num_copy(&r.d.n, num);
6041 r.t = BC_RESULT_STR;
6042 r.d.id.idx = num->rdx;
6045 if (!copy) bc_vec_pop(v);
6050 bc_vec_push(&G.prog.results, &r);
6055 static BcStatus bc_program_pushArray(char *code, size_t *bgn,
6058 BcStatus s = BC_STATUS_SUCCESS;
6062 r.d.id.name = bc_program_name(code, bgn);
6064 if (inst == BC_INST_ARRAY) {
6065 r.t = BC_RESULT_ARRAY;
6066 bc_vec_push(&G.prog.results, &r);
6073 s = bc_program_prep(&operand, &num);
6075 s = bc_num_ulong(num, &temp);
6078 if (temp > BC_MAX_DIM) {
6079 s = bc_error("array too long; must be [1,"BC_MAX_DIM_STR"]");
6083 r.d.id.idx = (size_t) temp;
6084 bc_program_retire(&r, BC_RESULT_ARRAY_ELEM);
6088 if (s) free(r.d.id.name);
6093 static BcStatus bc_program_incdec(char inst)
6096 BcResult *ptr, res, copy;
6100 s = bc_program_prep(&ptr, &num);
6103 if (inst == BC_INST_INC_POST || inst == BC_INST_DEC_POST) {
6104 copy.t = BC_RESULT_TEMP;
6105 bc_num_init(©.d.n, num->len);
6106 bc_num_copy(©.d.n, num);
6109 res.t = BC_RESULT_ONE;
6110 inst = inst == BC_INST_INC_PRE || inst == BC_INST_INC_POST ?
6111 BC_INST_ASSIGN_PLUS :
6112 BC_INST_ASSIGN_MINUS;
6114 bc_vec_push(&G.prog.results, &res);
6115 bc_program_assign(inst);
6117 if (inst2 == BC_INST_INC_POST || inst2 == BC_INST_DEC_POST) {
6118 bc_vec_pop(&G.prog.results);
6119 bc_vec_push(&G.prog.results, ©);
6125 static BcStatus bc_program_call(char *code, size_t *idx)
6127 BcStatus s = BC_STATUS_SUCCESS;
6129 size_t i, nparams = bc_program_index(code, idx);
6136 ip.func = bc_program_index(code, idx);
6137 func = bc_vec_item(&G.prog.fns, ip.func);
6139 if (func->code.len == 0) {
6140 return bc_error("undefined function");
6142 if (nparams != func->nparams) {
6143 return bc_error_fmt("function has %u parameters, but called with %u", func->nparams, nparams);
6145 ip.len = G.prog.results.len - nparams;
6147 for (i = 0; i < nparams; ++i) {
6149 a = bc_vec_item(&func->autos, nparams - 1 - i);
6150 arg = bc_vec_top(&G.prog.results);
6152 if ((!a->idx) != (arg->t == BC_RESULT_ARRAY) || arg->t == BC_RESULT_STR)
6153 return bc_error_variable_is_wrong_type();
6155 s = bc_program_copyToVar(a->name, a->idx);
6159 for (; i < func->autos.len; ++i) {
6162 a = bc_vec_item(&func->autos, i);
6163 v = bc_program_search(a->name, a->idx);
6166 bc_num_init(¶m.n, BC_NUM_DEF_SIZE);
6167 bc_vec_push(v, ¶m.n);
6170 bc_array_init(¶m.v, true);
6171 bc_vec_push(v, ¶m.v);
6175 bc_vec_push(&G.prog.stack, &ip);
6177 return BC_STATUS_SUCCESS;
6180 static BcStatus bc_program_return(char inst)
6186 BcInstPtr *ip = bc_vec_top(&G.prog.stack);
6188 if (!BC_PROG_STACK(&G.prog.results, ip->len + inst == BC_INST_RET))
6189 return bc_error_stack_has_too_few_elements();
6191 f = bc_vec_item(&G.prog.fns, ip->func);
6192 res.t = BC_RESULT_TEMP;
6194 if (inst == BC_INST_RET) {
6197 BcResult *operand = bc_vec_top(&G.prog.results);
6199 s = bc_program_num(operand, &num, false);
6201 bc_num_init(&res.d.n, num->len);
6202 bc_num_copy(&res.d.n, num);
6205 bc_num_init(&res.d.n, BC_NUM_DEF_SIZE);
6206 bc_num_zero(&res.d.n);
6209 // We need to pop arguments as well, so this takes that into account.
6210 for (i = 0; i < f->autos.len; ++i) {
6213 BcId *a = bc_vec_item(&f->autos, i);
6215 v = bc_program_search(a->name, a->idx);
6219 bc_vec_npop(&G.prog.results, G.prog.results.len - ip->len);
6220 bc_vec_push(&G.prog.results, &res);
6221 bc_vec_pop(&G.prog.stack);
6223 return BC_STATUS_SUCCESS;
6227 static unsigned long bc_program_scale(BcNum *n)
6229 return (unsigned long) n->rdx;
6232 static unsigned long bc_program_len(BcNum *n)
6234 unsigned long len = n->len;
6237 if (n->rdx != n->len) return len;
6238 for (i = n->len - 1; i < n->len && n->num[i] == 0; --len, --i);
6243 static BcStatus bc_program_builtin(char inst)
6249 bool len = inst == BC_INST_LENGTH;
6251 if (!BC_PROG_STACK(&G.prog.results, 1))
6252 return bc_error_stack_has_too_few_elements();
6253 opnd = bc_vec_top(&G.prog.results);
6255 s = bc_program_num(opnd, &num, false);
6259 if (!BC_PROG_NUM(opnd, num) && !len)
6260 return bc_error_variable_is_wrong_type();
6263 bc_num_init(&res.d.n, BC_NUM_DEF_SIZE);
6265 if (inst == BC_INST_SQRT) s = bc_num_sqrt(num, &res.d.n, G.prog.scale);
6267 else if (len != 0 && opnd->t == BC_RESULT_ARRAY) {
6268 bc_num_ulong2num(&res.d.n, (unsigned long) ((BcVec *) num)->len);
6272 else if (len != 0 && !BC_PROG_NUM(opnd, num)) {
6275 size_t idx = opnd->t == BC_RESULT_STR ? opnd->d.id.idx : num->rdx;
6277 str = bc_vec_item(&G.prog.strs, idx);
6278 bc_num_ulong2num(&res.d.n, strlen(*str));
6282 BcProgramBuiltIn f = len ? bc_program_len : bc_program_scale;
6283 bc_num_ulong2num(&res.d.n, f(num));
6286 bc_program_retire(&res, BC_RESULT_TEMP);
6292 static BcStatus bc_program_divmod(void)
6295 BcResult *opd1, *opd2, res, res2;
6296 BcNum *n1, *n2 = NULL;
6298 s = bc_program_binOpPrep(&opd1, &n1, &opd2, &n2, false);
6301 bc_num_init(&res.d.n, BC_NUM_DEF_SIZE);
6302 bc_num_init(&res2.d.n, n2->len);
6304 s = bc_num_divmod(n1, n2, &res2.d.n, &res.d.n, G.prog.scale);
6307 bc_program_binOpRetire(&res2);
6308 res.t = BC_RESULT_TEMP;
6309 bc_vec_push(&G.prog.results, &res);
6314 bc_num_free(&res2.d.n);
6315 bc_num_free(&res.d.n);
6319 static BcStatus bc_program_modexp(void)
6322 BcResult *r1, *r2, *r3, res;
6323 BcNum *n1, *n2, *n3;
6325 if (!BC_PROG_STACK(&G.prog.results, 3))
6326 return bc_error_stack_has_too_few_elements();
6327 s = bc_program_binOpPrep(&r2, &n2, &r3, &n3, false);
6330 r1 = bc_vec_item_rev(&G.prog.results, 2);
6331 s = bc_program_num(r1, &n1, false);
6333 if (!BC_PROG_NUM(r1, n1))
6334 return bc_error_variable_is_wrong_type();
6336 // Make sure that the values have their pointers updated, if necessary.
6337 if (r1->t == BC_RESULT_VAR || r1->t == BC_RESULT_ARRAY_ELEM) {
6339 if (r1->t == r2->t) {
6340 s = bc_program_num(r2, &n2, false);
6344 if (r1->t == r3->t) {
6345 s = bc_program_num(r3, &n3, false);
6350 bc_num_init(&res.d.n, n3->len);
6351 s = bc_num_modexp(n1, n2, n3, &res.d.n);
6354 bc_vec_pop(&G.prog.results);
6355 bc_program_binOpRetire(&res);
6360 bc_num_free(&res.d.n);
6364 static void bc_program_stackLen(void)
6367 size_t len = G.prog.results.len;
6369 res.t = BC_RESULT_TEMP;
6371 bc_num_init(&res.d.n, BC_NUM_DEF_SIZE);
6372 bc_num_ulong2num(&res.d.n, len);
6373 bc_vec_push(&G.prog.results, &res);
6376 static BcStatus bc_program_asciify(void)
6380 BcNum *num = NULL, n;
6381 char *str, *str2, c;
6382 size_t len = G.prog.strs.len, idx;
6385 if (!BC_PROG_STACK(&G.prog.results, 1))
6386 return bc_error_stack_has_too_few_elements();
6387 r = bc_vec_top(&G.prog.results);
6389 s = bc_program_num(r, &num, false);
6392 if (BC_PROG_NUM(r, num)) {
6394 bc_num_init(&n, BC_NUM_DEF_SIZE);
6395 bc_num_copy(&n, num);
6396 bc_num_truncate(&n, n.rdx);
6398 s = bc_num_mod(&n, &G.prog.strmb, &n, 0);
6399 if (s) goto num_err;
6400 s = bc_num_ulong(&n, &val);
6401 if (s) goto num_err;
6408 idx = (r->t == BC_RESULT_STR) ? r->d.id.idx : num->rdx;
6409 str2 = *((char **) bc_vec_item(&G.prog.strs, idx));
6417 str2 = xstrdup(str);
6418 bc_program_addFunc(str2, &idx);
6420 if (idx != len + BC_PROG_REQ_FUNCS) {
6422 for (idx = 0; idx < G.prog.strs.len; ++idx) {
6423 if (!strcmp(*((char **) bc_vec_item(&G.prog.strs, idx)), str)) {
6432 bc_vec_push(&G.prog.strs, &str);
6434 res.t = BC_RESULT_STR;
6436 bc_vec_pop(&G.prog.results);
6437 bc_vec_push(&G.prog.results, &res);
6439 return BC_STATUS_SUCCESS;
6446 static BcStatus bc_program_printStream(void)
6454 if (!BC_PROG_STACK(&G.prog.results, 1))
6455 return bc_error_stack_has_too_few_elements();
6456 r = bc_vec_top(&G.prog.results);
6458 s = bc_program_num(r, &n, false);
6461 if (BC_PROG_NUM(r, n))
6462 s = bc_num_stream(n, &G.prog.strmb, &G.prog.nchars, G.prog.len);
6464 idx = (r->t == BC_RESULT_STR) ? r->d.id.idx : n->rdx;
6465 str = *((char **) bc_vec_item(&G.prog.strs, idx));
6472 static BcStatus bc_program_nquit(void)
6479 s = bc_program_prep(&opnd, &num);
6481 s = bc_num_ulong(num, &val);
6484 bc_vec_pop(&G.prog.results);
6486 if (G.prog.stack.len < val)
6487 return bc_error_stack_has_too_few_elements();
6488 if (G.prog.stack.len == val) {
6489 QUIT_OR_RETURN_TO_MAIN;
6492 bc_vec_npop(&G.prog.stack, val);
6497 static BcStatus bc_program_execStr(char *code, size_t *bgn,
6500 BcStatus s = BC_STATUS_SUCCESS;
6510 if (!BC_PROG_STACK(&G.prog.results, 1))
6511 return bc_error_stack_has_too_few_elements();
6513 r = bc_vec_top(&G.prog.results);
6517 char *name, *then_name = bc_program_name(code, bgn), *else_name = NULL;
6519 if (code[*bgn] == BC_PARSE_STREND)
6522 else_name = bc_program_name(code, bgn);
6524 exec = r->d.n.len != 0;
6528 else if (else_name != NULL) {
6535 v = bc_program_search(name, true);
6542 if (!exec) goto exit;
6543 if (!BC_PROG_STR(n)) {
6544 s = bc_error_variable_is_wrong_type();
6552 if (r->t == BC_RESULT_STR)
6554 else if (r->t == BC_RESULT_VAR) {
6555 s = bc_program_num(r, &n, false);
6556 if (s || !BC_PROG_STR(n)) goto exit;
6563 fidx = sidx + BC_PROG_REQ_FUNCS;
6565 str = bc_vec_item(&G.prog.strs, sidx);
6566 f = bc_vec_item(&G.prog.fns, fidx);
6568 if (f->code.len == 0) {
6569 common_parse_init(&prs, fidx);
6570 s = bc_parse_text(&prs, *str);
6572 s = common_parse_expr(&prs, BC_PARSE_NOCALL);
6575 if (prs.l.t.t != BC_LEX_EOF) {
6576 s = bc_error_bad_expression();
6580 bc_parse_free(&prs);
6584 ip.len = G.prog.results.len;
6587 bc_vec_pop(&G.prog.results);
6588 bc_vec_push(&G.prog.stack, &ip);
6590 return BC_STATUS_SUCCESS;
6593 bc_parse_free(&prs);
6594 f = bc_vec_item(&G.prog.fns, fidx);
6595 bc_vec_pop_all(&f->code);
6597 bc_vec_pop(&G.prog.results);
6602 static void bc_program_pushGlobal(char inst)
6607 res.t = inst - BC_INST_IBASE + BC_RESULT_IBASE;
6608 if (inst == BC_INST_IBASE)
6609 val = (unsigned long) G.prog.ib_t;
6610 else if (inst == BC_INST_SCALE)
6611 val = (unsigned long) G.prog.scale;
6613 val = (unsigned long) G.prog.ob_t;
6615 bc_num_init(&res.d.n, BC_NUM_DEF_SIZE);
6616 bc_num_ulong2num(&res.d.n, val);
6617 bc_vec_push(&G.prog.results, &res);
6620 static void bc_program_addFunc(char *name, size_t *idx)
6622 BcId entry, *entry_ptr;
6627 entry.idx = G.prog.fns.len;
6629 inserted = bc_map_insert(&G.prog.fn_map, &entry, idx);
6630 if (!inserted) free(name);
6632 entry_ptr = bc_vec_item(&G.prog.fn_map, *idx);
6633 *idx = entry_ptr->idx;
6637 BcFunc *func = bc_vec_item(&G.prog.fns, entry_ptr->idx);
6639 // We need to reset these, so the function can be repopulated.
6641 bc_vec_pop_all(&func->autos);
6642 bc_vec_pop_all(&func->code);
6643 bc_vec_pop_all(&func->labels);
6647 bc_vec_push(&G.prog.fns, &f);
6651 static BcStatus bc_program_exec(void)
6653 BcStatus s = BC_STATUS_SUCCESS;
6657 BcInstPtr *ip = bc_vec_top(&G.prog.stack);
6658 BcFunc *func = bc_vec_item(&G.prog.fns, ip->func);
6659 char *code = func->code.v;
6662 while (!s && ip->idx < func->code.len) {
6664 char inst = code[(ip->idx)++];
6669 case BC_INST_JUMP_ZERO:
6671 s = bc_program_prep(&ptr, &num);
6673 cond = !bc_num_cmp(num, &G.prog.zero);
6674 bc_vec_pop(&G.prog.results);
6680 idx = bc_program_index(code, &ip->idx);
6681 addr = bc_vec_item(&func->labels, idx);
6682 if (inst == BC_INST_JUMP || cond) ip->idx = *addr;
6688 s = bc_program_call(code, &ip->idx);
6692 case BC_INST_INC_PRE:
6693 case BC_INST_DEC_PRE:
6694 case BC_INST_INC_POST:
6695 case BC_INST_DEC_POST:
6697 s = bc_program_incdec(inst);
6703 QUIT_OR_RETURN_TO_MAIN;
6710 s = bc_program_return(inst);
6714 case BC_INST_BOOL_OR:
6715 case BC_INST_BOOL_AND:
6717 case BC_INST_REL_EQ:
6718 case BC_INST_REL_LE:
6719 case BC_INST_REL_GE:
6720 case BC_INST_REL_NE:
6721 case BC_INST_REL_LT:
6722 case BC_INST_REL_GT:
6724 s = bc_program_logical(inst);
6730 s = bc_program_read();
6736 s = bc_program_pushVar(code, &ip->idx, false, false);
6740 case BC_INST_ARRAY_ELEM:
6743 s = bc_program_pushArray(code, &ip->idx, inst);
6749 r.t = BC_RESULT_LAST;
6750 bc_vec_push(&G.prog.results, &r);
6758 bc_program_pushGlobal(inst);
6762 case BC_INST_SCALE_FUNC:
6763 case BC_INST_LENGTH:
6766 s = bc_program_builtin(inst);
6772 r.t = BC_RESULT_CONSTANT;
6773 r.d.id.idx = bc_program_index(code, &ip->idx);
6774 bc_vec_push(&G.prog.results, &r);
6780 if (!BC_PROG_STACK(&G.prog.results, 1))
6781 s = bc_error_stack_has_too_few_elements();
6783 bc_vec_pop(&G.prog.results);
6787 case BC_INST_POP_EXEC:
6789 bc_vec_pop(&G.prog.stack);
6794 case BC_INST_PRINT_POP:
6795 case BC_INST_PRINT_STR:
6797 s = bc_program_print(inst, 0);
6803 r.t = BC_RESULT_STR;
6804 r.d.id.idx = bc_program_index(code, &ip->idx);
6805 bc_vec_push(&G.prog.results, &r);
6810 case BC_INST_MULTIPLY:
6811 case BC_INST_DIVIDE:
6812 case BC_INST_MODULUS:
6816 s = bc_program_op(inst);
6820 case BC_INST_BOOL_NOT:
6822 s = bc_program_prep(&ptr, &num);
6825 bc_num_init(&r.d.n, BC_NUM_DEF_SIZE);
6826 (!bc_num_cmp(num, &G.prog.zero) ? bc_num_one : bc_num_zero)(&r.d.n);
6827 bc_program_retire(&r, BC_RESULT_TEMP);
6834 s = bc_program_negate();
6839 case BC_INST_ASSIGN_POWER:
6840 case BC_INST_ASSIGN_MULTIPLY:
6841 case BC_INST_ASSIGN_DIVIDE:
6842 case BC_INST_ASSIGN_MODULUS:
6843 case BC_INST_ASSIGN_PLUS:
6844 case BC_INST_ASSIGN_MINUS:
6846 case BC_INST_ASSIGN:
6848 s = bc_program_assign(inst);
6852 case BC_INST_MODEXP:
6854 s = bc_program_modexp();
6858 case BC_INST_DIVMOD:
6860 s = bc_program_divmod();
6864 case BC_INST_EXECUTE:
6865 case BC_INST_EXEC_COND:
6867 cond = inst == BC_INST_EXEC_COND;
6868 s = bc_program_execStr(code, &ip->idx, cond);
6872 case BC_INST_PRINT_STACK:
6874 for (idx = 0; !s && idx < G.prog.results.len; ++idx)
6875 s = bc_program_print(BC_INST_PRINT, idx);
6879 case BC_INST_CLEAR_STACK:
6881 bc_vec_pop_all(&G.prog.results);
6885 case BC_INST_STACK_LEN:
6887 bc_program_stackLen();
6891 case BC_INST_DUPLICATE:
6893 if (!BC_PROG_STACK(&G.prog.results, 1))
6894 return bc_error_stack_has_too_few_elements();
6895 ptr = bc_vec_top(&G.prog.results);
6896 bc_result_copy(&r, ptr);
6897 bc_vec_push(&G.prog.results, &r);
6905 if (!BC_PROG_STACK(&G.prog.results, 2))
6906 return bc_error_stack_has_too_few_elements();
6908 ptr = bc_vec_item_rev(&G.prog.results, 0);
6909 ptr2 = bc_vec_item_rev(&G.prog.results, 1);
6910 memcpy(&r, ptr, sizeof(BcResult));
6911 memcpy(ptr, ptr2, sizeof(BcResult));
6912 memcpy(ptr2, &r, sizeof(BcResult));
6917 case BC_INST_ASCIIFY:
6919 s = bc_program_asciify();
6923 case BC_INST_PRINT_STREAM:
6925 s = bc_program_printStream();
6930 case BC_INST_PUSH_VAR:
6932 bool copy = inst == BC_INST_LOAD;
6933 s = bc_program_pushVar(code, &ip->idx, true, copy);
6937 case BC_INST_PUSH_TO_VAR:
6939 char *name = bc_program_name(code, &ip->idx);
6940 s = bc_program_copyToVar(name, true);
6947 if (G.prog.stack.len <= 2)
6948 QUIT_OR_RETURN_TO_MAIN;
6949 bc_vec_npop(&G.prog.stack, 2);
6955 s = bc_program_nquit();
6961 if (s || G_interrupt) {
6966 // If the stack has changed, pointers may be invalid.
6967 ip = bc_vec_top(&G.prog.stack);
6968 func = bc_vec_item(&G.prog.fns, ip->func);
6969 code = func->code.v;
6976 static void bc_vm_info(void)
6978 printf("%s "BB_VER"\n"
6979 "Copyright (c) 2018 Gavin D. Howard and contributors\n"
6980 "Report bugs at: https://github.com/gavinhoward/bc\n"
6981 "This is free software with ABSOLUTELY NO WARRANTY\n"
6985 static void bc_args(char **argv)
6991 #if ENABLE_FEATURE_BC_LONG_OPTIONS
6992 opts = option_mask32 |= getopt32long(argv, "wvsqli",
6993 "warn\0" No_argument "w"
6994 "version\0" No_argument "v"
6995 "standard\0" No_argument "s"
6996 "quiet\0" No_argument "q"
6997 "mathlib\0" No_argument "l"
6998 "interactive\0" No_argument "i"
7001 opts = option_mask32 |= getopt32(argv, "wvsqli");
7003 if (getenv("POSIXLY_CORRECT"))
7004 option_mask32 |= BC_FLAG_S;
7006 ///should be in bc_vm_run() instead??
7007 if (opts & BC_FLAG_V) {
7012 for (i = optind; argv[i]; ++i)
7013 bc_vec_push(&G.files, argv + i);
7016 static void bc_vm_envArgs(void)
7020 char *env_args = getenv("BC_ENV_ARGS");
7022 if (!env_args) return;
7024 G.env_args = xstrdup(env_args);
7027 bc_vec_init(&v, sizeof(char *), NULL);
7029 while (*(buf = skip_whitespace(buf)) != '\0') {
7030 bc_vec_push(&v, &buf);
7031 buf = skip_non_whitespace(buf);
7037 // NULL terminate, and pass argv[] so that first arg is argv[1]
7038 if (sizeof(int) == sizeof(char*)) {
7039 bc_vec_push(&v, &const_int_0);
7041 static char *const nullptr = NULL;
7042 bc_vec_push(&v, &nullptr);
7044 bc_args(((char **)v.v) - 1);
7050 static unsigned bc_vm_envLen(const char *var)
7056 len = BC_NUM_PRINT_WIDTH;
7057 if (!lenv) return len;
7059 len = bb_strtou(lenv, NULL, 10) - 1;
7060 if (errno || len < 2 || len >= INT_MAX)
7061 len = BC_NUM_PRINT_WIDTH;
7066 static BcStatus bc_vm_process(const char *text)
7068 BcStatus s = bc_parse_text(&G.prs, text);
7072 while (G.prs.l.t.t != BC_LEX_EOF) {
7073 s = G.prs.parse(&G.prs);
7077 if (BC_PARSE_CAN_EXEC(&G.prs)) {
7078 s = bc_program_exec();
7087 static BcStatus bc_vm_file(const char *file)
7089 const char *sv_file;
7095 data = bc_read_file(file);
7096 if (!data) return bc_error_fmt("file '%s' is not text", file);
7098 sv_file = G.prog.file;
7100 bc_lex_file(&G.prs.l);
7101 s = bc_vm_process(data);
7104 main_func = bc_vec_item(&G.prog.fns, BC_PROG_MAIN);
7105 ip = bc_vec_item(&G.prog.stack, 0);
7107 if (main_func->code.len < ip->idx)
7108 s = bc_error_fmt("file '%s' is not executable", file);
7111 G.prog.file = sv_file;
7116 static BcStatus bc_vm_stdin(void)
7120 size_t len, i, str = 0;
7121 bool comment = false;
7124 bc_lex_file(&G.prs.l);
7126 bc_char_vec_init(&buffer);
7127 bc_char_vec_init(&buf);
7128 bc_vec_pushZeroByte(&buffer);
7130 // This loop is complex because the vm tries not to send any lines that end
7131 // with a backslash to the parser. The reason for that is because the parser
7132 // treats a backslash+newline combo as whitespace, per the bc spec. In that
7133 // case, and for strings and comments, the parser will expect more stuff.
7134 while ((s = bc_read_line(&buf, ">>> ")) == BC_STATUS_SUCCESS) {
7136 char *string = buf.v;
7141 if (str && buf.v[0] == G.send)
7143 else if (buf.v[0] == G.sbgn)
7146 else if (len > 1 || comment) {
7148 for (i = 0; i < len; ++i) {
7150 bool notend = len > i + 1;
7153 if (i - 1 > len || string[i - 1] != '\\') {
7154 if (G.sbgn == G.send)
7156 else if (c == G.send)
7158 else if (c == G.sbgn)
7162 if (c == '/' && notend && !comment && string[i + 1] == '*') {
7166 else if (c == '*' && notend && comment && string[i + 1] == '/')
7170 if (str || comment || string[len - 2] == '\\') {
7171 bc_vec_concat(&buffer, buf.v);
7176 bc_vec_concat(&buffer, buf.v);
7177 s = bc_vm_process(buffer.v);
7179 if (ENABLE_FEATURE_CLEAN_UP && !G_ttyin) {
7180 // Debug config, non-interactive mode:
7181 // return all the way back to main.
7182 // Non-debug builds do not come here, they exit.
7186 fputs("ready for more input\n", stderr);
7189 bc_vec_pop_all(&buffer);
7191 if (s == BC_STATUS_EOF) // input EOF (^D) is not an error
7192 s = BC_STATUS_SUCCESS;
7195 s = bc_error("string end could not be found");
7198 s = bc_error("comment end could not be found");
7202 bc_vec_free(&buffer);
7207 static const char bc_lib[] = {
7210 "\n" "auto b,s,n,r,d,i,p,f,v"
7219 "\n" "scale=scale(x)+1"
7229 "\n" "for(i=2;v!=0;++i){"
7235 "\n" "while((d--)!=0)r*=r"
7238 "\n" "if(n!=0)return(1/r)"
7242 "\n" "auto b,s,r,p,a,q,i,v"
7246 "\n" "r=(1-10^scale)/1"
7257 "\n" "while(x<=0.5){"
7261 "\n" "r=a=(x-1)/(x+1)"
7264 "\n" "for(i=3;v!=0;i+=2){"
7275 "\n" "auto b,s,r,n,a,q,i"
7279 "\n" "scale=1.1*s+2"
7288 "\n" "if(q%2!=0)x=-x"
7292 "\n" "for(i=3;a!=0;i+=2){"
7293 "\n" "a*=q/(i*(i-1))"
7298 "\n" "if(n!=0)return(-r/1)"
7307 "\n" "x=s(2*a(1)+x)"
7313 "\n" "auto b,s,r,n,a,m,t,f,i,u"
7322 "\n" "if(scale<65){"
7323 "\n" "return(.7853981633974483096156608458198757210492923498437764552437361480/n)"
7327 "\n" "if(scale<65){"
7328 "\n" "return(.1973955598498807583700497651947902934475851037878521015176889402/n)"
7339 "\n" "x=(x-.2)/(1+.2*x)"
7344 "\n" "for(i=3;t!=0;i+=2){"
7351 "\n" "return((m*a+r)/n)"
7353 "\n" "define j(n,x){"
7354 "\n" "auto b,s,o,a,i,v,f"
7362 "\n" "if(n%2==1)o=1"
7365 "\n" "for(i=2;i<=n;++i)a*=i"
7367 "\n" "a=(x^n)/2^n/a"
7370 "\n" "scale=scale+length(a)-scale(a)"
7371 "\n" "for(i=1;v!=0;++i){"
7372 "\n" "v=v*f/i/(n+i)"
7378 "\n" "return(a*r/1)"
7383 static BcStatus bc_vm_exec(void)
7389 if (option_mask32 & BC_FLAG_L) {
7391 // We know that internal library is not buggy,
7392 // thus error checking is normally disabled.
7393 # define DEBUG_LIB 0
7394 bc_lex_file(&G.prs.l);
7395 s = bc_parse_text(&G.prs, bc_lib);
7396 if (DEBUG_LIB && s) return s;
7398 while (G.prs.l.t.t != BC_LEX_EOF) {
7399 s = G.prs.parse(&G.prs);
7400 if (DEBUG_LIB && s) return s;
7402 s = bc_program_exec();
7403 if (DEBUG_LIB && s) return s;
7407 s = BC_STATUS_SUCCESS;
7408 for (i = 0; !s && i < G.files.len; ++i)
7409 s = bc_vm_file(*((char **) bc_vec_item(&G.files, i)));
7410 if (ENABLE_FEATURE_CLEAN_UP && s && !G_ttyin) {
7411 // Debug config, non-interactive mode:
7412 // return all the way back to main.
7413 // Non-debug builds do not come here, they exit.
7417 if (IS_BC || (option_mask32 & BC_FLAG_I)) {
7420 fputs("ready for more input\n", stderr);
7425 if (!s && !BC_PARSE_CAN_EXEC(&G.prs))
7426 s = bc_vm_process("");
7431 #if ENABLE_FEATURE_CLEAN_UP
7432 static void bc_program_free(void)
7434 bc_num_free(&G.prog.ib);
7435 bc_num_free(&G.prog.ob);
7436 bc_num_free(&G.prog.hexb);
7438 bc_num_free(&G.prog.strmb);
7440 bc_vec_free(&G.prog.fns);
7441 bc_vec_free(&G.prog.fn_map);
7442 bc_vec_free(&G.prog.vars);
7443 bc_vec_free(&G.prog.var_map);
7444 bc_vec_free(&G.prog.arrs);
7445 bc_vec_free(&G.prog.arr_map);
7446 bc_vec_free(&G.prog.strs);
7447 bc_vec_free(&G.prog.consts);
7448 bc_vec_free(&G.prog.results);
7449 bc_vec_free(&G.prog.stack);
7450 bc_num_free(&G.prog.last);
7451 bc_num_free(&G.prog.zero);
7452 bc_num_free(&G.prog.one);
7455 static void bc_vm_free(void)
7457 bc_vec_free(&G.files);
7459 bc_parse_free(&G.prs);
7464 static void bc_program_init(void)
7469 /* memset(&G.prog, 0, sizeof(G.prog)); - already is */
7470 memset(&ip, 0, sizeof(BcInstPtr));
7472 /* G.prog.nchars = G.prog.scale = 0; - already is */
7474 bc_num_init(&G.prog.ib, BC_NUM_DEF_SIZE);
7475 bc_num_ten(&G.prog.ib);
7478 bc_num_init(&G.prog.ob, BC_NUM_DEF_SIZE);
7479 bc_num_ten(&G.prog.ob);
7482 bc_num_init(&G.prog.hexb, BC_NUM_DEF_SIZE);
7483 bc_num_ten(&G.prog.hexb);
7484 G.prog.hexb.num[0] = 6;
7487 bc_num_init(&G.prog.strmb, BC_NUM_DEF_SIZE);
7488 bc_num_ulong2num(&G.prog.strmb, UCHAR_MAX + 1);
7491 bc_num_init(&G.prog.last, BC_NUM_DEF_SIZE);
7492 bc_num_zero(&G.prog.last);
7494 bc_num_init(&G.prog.zero, BC_NUM_DEF_SIZE);
7495 bc_num_zero(&G.prog.zero);
7497 bc_num_init(&G.prog.one, BC_NUM_DEF_SIZE);
7498 bc_num_one(&G.prog.one);
7500 bc_vec_init(&G.prog.fns, sizeof(BcFunc), bc_func_free);
7501 bc_vec_init(&G.prog.fn_map, sizeof(BcId), bc_id_free);
7503 bc_program_addFunc(xstrdup("(main)"), &idx);
7504 bc_program_addFunc(xstrdup("(read)"), &idx);
7506 bc_vec_init(&G.prog.vars, sizeof(BcVec), bc_vec_free);
7507 bc_vec_init(&G.prog.var_map, sizeof(BcId), bc_id_free);
7509 bc_vec_init(&G.prog.arrs, sizeof(BcVec), bc_vec_free);
7510 bc_vec_init(&G.prog.arr_map, sizeof(BcId), bc_id_free);
7512 bc_vec_init(&G.prog.strs, sizeof(char *), bc_string_free);
7513 bc_vec_init(&G.prog.consts, sizeof(char *), bc_string_free);
7514 bc_vec_init(&G.prog.results, sizeof(BcResult), bc_result_free);
7515 bc_vec_init(&G.prog.stack, sizeof(BcInstPtr), NULL);
7516 bc_vec_push(&G.prog.stack, &ip);
7519 static int bc_vm_init(const char *env_len)
7521 #if ENABLE_FEATURE_EDITING
7522 G.line_input_state = new_line_input_t(DO_HISTORY);
7524 G.prog.len = bc_vm_envLen(env_len);
7526 bc_vec_init(&G.files, sizeof(char *), NULL);
7528 IF_BC(bc_vm_envArgs();)
7531 IF_BC(bc_parse_init(&G.prs, BC_PROG_MAIN);)
7533 IF_DC(dc_parse_init(&G.prs, BC_PROG_MAIN);)
7537 #if ENABLE_FEATURE_BC_SIGNALS
7539 // With SA_RESTART, most system calls will restart
7540 // (IOW: they won't fail with EINTR).
7541 // In particular, this means ^C won't cause
7542 // stdout to get into "error state" if SIGINT hits
7543 // within write() syscall.
7544 // The downside is that ^C while line input is taken
7545 // will only be handled after [Enter] since read()
7546 // from stdin is not interrupted by ^C either,
7547 // it restarts, thus fgetc() does not return on ^C.
7548 signal_SA_RESTART_empty_mask(SIGINT, record_signo);
7550 // Without SA_RESTART, this exhibits a bug:
7551 // "while (1) print 1" and try ^C-ing it.
7552 // Intermittently, instead of returning to input line,
7553 // you'll get "output error: Interrupted system call"
7555 //signal_no_SA_RESTART_empty_mask(SIGINT, record_signo);
7559 return 0; // "not a tty"
7562 static BcStatus bc_vm_run(void)
7564 BcStatus st = bc_vm_exec();
7565 #if ENABLE_FEATURE_CLEAN_UP
7566 if (G_exiting) // it was actually "halt" or "quit"
7569 # if ENABLE_FEATURE_EDITING
7570 free_line_input_t(G.line_input_state);
7578 int bc_main(int argc, char **argv) MAIN_EXTERNALLY_VISIBLE;
7579 int bc_main(int argc UNUSED_PARAM, char **argv)
7584 G.sbgn = G.send = '"';
7586 is_tty = bc_vm_init("BC_LINE_LENGTH");
7590 if (is_tty && !(option_mask32 & BC_FLAG_Q))
7598 int dc_main(int argc, char **argv) MAIN_EXTERNALLY_VISIBLE;
7599 int dc_main(int argc UNUSED_PARAM, char **argv)
7606 // TODO: dc (GNU bc 1.07.1) 1.4.1 seems to use default width
7607 // 1 char narrower than bc from the same package. Do the same?
7608 bc_vm_init("DC_LINE_LENGTH");
7610 // Run -e'SCRIPT' and -fFILE in order of appearance, then handle FILEs
7611 noscript = BC_FLAG_I;
7613 int n = getopt(argc, argv, "e:f:x");
7619 n = bc_vm_process(optarg);
7627 option_mask32 |= DC_FLAG_X;
7637 bc_vec_push(&G.files, argv++);
7640 option_mask32 |= noscript; // set BC_FLAG_I if we need to interpret stdin
7646 #endif // not DC_SMALL