1 /* vi: set sw=4 ts=4: */
3 * Licensed under GPLv2 or later, see file LICENSE in this source tree.
4 * Copyright (c) 2018 Gavin D. Howard and contributors.
7 //config: bool "bc (45 kb; 49 kb when combined with dc)"
10 //config: bc is a command-line, arbitrary-precision calculator with a
11 //config: Turing-complete language. See the GNU bc manual
12 //config: (https://www.gnu.org/software/bc/manual/bc.html) and bc spec
13 //config: (http://pubs.opengroup.org/onlinepubs/9699919799/utilities/bc.html)
14 //config: for details.
16 //config: This bc has four differences to the GNU bc:
18 //config: 1) The period (.) can also be used as a shortcut for "last", as in
20 //config: 2) Arrays are copied before being passed as arguments to
21 //config: functions. This behavior is required by the bc spec.
22 //config: 3) Arrays can be passed to the builtin "length" function to get
23 //config: the number of elements currently in the array. The following
24 //config: example prints "1":
29 //config: 4) The precedence of the boolean "not" operator (!) is equal to
30 //config: that of the unary minus (-), or negation, operator. This still
31 //config: allows POSIX-compliant scripts to work while somewhat
32 //config: preserving expected behavior (versus C) and making parsing
37 //config: -i --interactive force interactive mode
38 //config: -l --mathlib use predefined math routines:
40 //config: s(expr) = sine of expr in radians
41 //config: c(expr) = cosine of expr in radians
42 //config: a(expr) = arctangent of expr, returning
44 //config: l(expr) = natural log of expr
45 //config: e(expr) = raises e to the power of expr
46 //config: j(n, x) = Bessel function of integer order
49 //config: -q --quiet don't print version and copyright.
50 //config: -s --standard error if any non-POSIX extensions are used.
51 //config: -w --warn warn if any non-POSIX extensions are used.
52 //config: -v --version print version and copyright and exit.
54 //config: Long options are only available if FEATURE_BC_LONG_OPTIONS is
58 //config: bool "dc (38 kb; 49 kb when combined with bc)"
61 //config: dc is a reverse-polish notation command-line calculator which
62 //config: supports unlimited precision arithmetic. See the FreeBSD man page
63 //config: (https://www.unix.com/man-page/FreeBSD/1/dc/) and GNU dc manual
64 //config: (https://www.gnu.org/software/bc/manual/dc-1.05/html_mono/dc.html)
65 //config: for details.
67 //config: This dc has a few differences from the two above:
69 //config: 1) When printing a byte stream (command "P"), this bc follows what
70 //config: the FreeBSD dc does.
71 //config: 2) This dc implements the GNU extensions for divmod ("~") and
72 //config: modular exponentiation ("|").
73 //config: 3) This dc implements all FreeBSD extensions, except for "J" and
75 //config: 4) Like the FreeBSD dc, this dc supports extended registers.
76 //config: However, they are implemented differently. When it encounters
77 //config: whitespace where a register should be, it skips the whitespace.
78 //config: If the character following is not a lowercase letter, an error
79 //config: is issued. Otherwise, the register name is parsed by the
80 //config: following regex:
82 //config: [a-z][a-z0-9_]*
84 //config: This generally means that register names will be surrounded by
89 //config: l idx s temp L index S temp2 < do_thing
91 //config: Also note that, like the FreeBSD dc, extended registers are not
92 //config: allowed unless the "-x" option is given.
94 //config:config FEATURE_DC_SMALL
95 //config: bool "Minimal dc implementation (4.2 kb), not using bc code base"
96 //config: depends on DC && !BC
99 //config:config FEATURE_DC_LIBM
100 //config: bool "Enable power and exp functions (requires libm)"
102 //config: depends on FEATURE_DC_SMALL
104 //config: Enable power and exp functions.
105 //config: NOTE: This will require libm to be present for linking.
107 //config:config FEATURE_BC_SIGNALS
108 //config: bool "Enable bc/dc signal handling"
110 //config: depends on (BC || DC) && !FEATURE_DC_SMALL
112 //config: Enable signal handling for bc and dc.
114 //config:config FEATURE_BC_LONG_OPTIONS
115 //config: bool "Enable bc/dc long options"
117 //config: depends on (BC || DC) && !FEATURE_DC_SMALL
119 //config: Enable long options for bc and dc.
121 //applet:IF_BC(APPLET(bc, BB_DIR_USR_BIN, BB_SUID_DROP))
122 //applet:IF_DC(APPLET(dc, BB_DIR_USR_BIN, BB_SUID_DROP))
124 //kbuild:lib-$(CONFIG_BC) += bc.o
125 //kbuild:lib-$(CONFIG_DC) += bc.o
127 //See www.gnu.org/software/bc/manual/bc.html
128 //usage:#define bc_trivial_usage
129 //usage: "[-sqliw] FILE..."
131 //usage:#define bc_full_usage "\n"
132 //usage: "\nArbitrary precision calculator"
134 ///////: "\n -i Interactive" - has no effect for now
135 //usage: "\n -q Quiet"
136 //usage: "\n -l Load standard math library"
137 //usage: "\n -s Be POSIX compatible"
138 //usage: "\n -w Warn if extensions are used"
139 ///////: "\n -v Version"
141 //usage: "\n$BC_LINE_LENGTH changes output width"
143 //usage:#define bc_example_usage
144 //usage: "3 + 4.129\n"
145 //usage: "1903 - 2893\n"
146 //usage: "-129 * 213.28935\n"
147 //usage: "12 / -1932\n"
149 //usage: "34 ^ 189\n"
150 //usage: "scale = 13\n"
151 //usage: "ibase = 2\n"
152 //usage: "obase = A\n"
154 //usage:#define dc_trivial_usage
155 //usage: IF_NOT_FEATURE_DC_SMALL("[-x] ")"[-eSCRIPT]... [-fFILE]... [FILE]..."
157 //usage:#define dc_full_usage "\n"
158 //usage: "\nTiny RPN calculator. Operations:"
159 //usage: "\n+, -, *, /, %, ~, ^," IF_NOT_FEATURE_DC_SMALL(" |,")
160 //usage: "\np - print top of the stack (without popping)"
161 //usage: "\nf - print entire stack"
162 //usage: "\nk - pop the value and set the precision"
163 //usage: "\ni - pop the value and set input radix"
164 //usage: "\no - pop the value and set output radix"
165 //usage: "\nExamples: dc -e'2 2 + p' -> 4, dc -e'8 8 * 2 2 + / p' -> 16"
167 //usage:#define dc_example_usage
168 //usage: "$ dc -e'2 2 + p'\n"
170 //usage: "$ dc -e'8 8 \\* 2 2 + / p'\n"
172 //usage: "$ dc -e'0 1 & p'\n"
174 //usage: "$ dc -e'0 1 | p'\n"
176 //usage: "$ echo '72 9 / 8 * p' | dc\n"
180 #include "common_bufsiz.h"
182 #if ENABLE_FEATURE_DC_SMALL
186 typedef enum BcStatus {
187 BC_STATUS_SUCCESS = 0,
188 BC_STATUS_FAILURE = 1,
189 BC_STATUS_PARSE_EMPTY_EXP = 2, // bc_parse_expr() uses this
190 BC_STATUS_EOF = 3, // bc_vm_stdin() uses this
193 #define BC_VEC_INVALID_IDX ((size_t) -1)
194 #define BC_VEC_START_CAP (1 << 5)
196 typedef void (*BcVecFree)(void *);
198 typedef struct BcVec {
206 typedef signed char BcDig;
208 typedef struct BcNum {
216 #define BC_NUM_MIN_BASE ((unsigned long) 2)
217 #define BC_NUM_MAX_IBASE ((unsigned long) 16)
218 // larger value might speed up BIGNUM calculations a bit:
219 #define BC_NUM_DEF_SIZE (16)
220 #define BC_NUM_PRINT_WIDTH (69)
222 #define BC_NUM_KARATSUBA_LEN (32)
224 typedef void (*BcNumDigitOp)(size_t, size_t, bool);
226 typedef BcStatus (*BcNumBinaryOp)(BcNum *, BcNum *, BcNum *, size_t);
228 static BcStatus bc_num_add(BcNum *a, BcNum *b, BcNum *c, size_t scale);
229 static BcStatus bc_num_sub(BcNum *a, BcNum *b, BcNum *c, size_t scale);
230 static BcStatus bc_num_mul(BcNum *a, BcNum *b, BcNum *c, size_t scale);
231 static BcStatus bc_num_div(BcNum *a, BcNum *b, BcNum *c, size_t scale);
232 static BcStatus bc_num_mod(BcNum *a, BcNum *b, BcNum *c, size_t scale);
233 static BcStatus bc_num_pow(BcNum *a, BcNum *b, BcNum *c, size_t scale);
234 static BcStatus bc_num_sqrt(BcNum *a, BcNum *b, size_t scale);
235 static BcStatus bc_num_divmod(BcNum *a, BcNum *b, BcNum *c, BcNum *d,
238 typedef enum BcInst {
268 BC_INST_ASSIGN_POWER,
269 BC_INST_ASSIGN_MULTIPLY,
270 BC_INST_ASSIGN_DIVIDE,
271 BC_INST_ASSIGN_MODULUS,
273 BC_INST_ASSIGN_MINUS,
319 BC_INST_PRINT_STREAM,
334 BC_INST_INVALID = -1,
339 typedef struct BcId {
344 typedef struct BcFunc {
351 typedef enum BcResultType {
356 BC_RESULT_ARRAY_ELEM,
365 // These are between to calculate ibase, obase, and last from instructions.
373 typedef union BcResultData {
379 typedef struct BcResult {
384 typedef struct BcInstPtr {
390 // BC_LEX_NEG is not used in lexing; it is only for parsing.
391 typedef enum BcLexType {
419 BC_LEX_OP_ASSIGN_POWER,
420 BC_LEX_OP_ASSIGN_MULTIPLY,
421 BC_LEX_OP_ASSIGN_DIVIDE,
422 BC_LEX_OP_ASSIGN_MODULUS,
423 BC_LEX_OP_ASSIGN_PLUS,
424 BC_LEX_OP_ASSIGN_MINUS,
445 BC_LEX_KEY_1st_keyword,
446 BC_LEX_KEY_AUTO = BC_LEX_KEY_1st_keyword,
453 // code uses "type - BC_LEX_KEY_IBASE + BC_INST_IBASE" construct,
454 BC_LEX_KEY_IBASE, // relative order should match for: BC_INST_IBASE
456 BC_LEX_KEY_LAST, // relative order should match for: BC_INST_LAST
459 BC_LEX_KEY_OBASE, // relative order should match for: BC_INST_OBASE
497 // must match order of BC_LEX_KEY_foo etc above
499 struct BcLexKeyword {
502 #define BC_LEX_KW_ENTRY(a, b) \
503 { .name8 = a /*, .posix = b */ }
504 static const struct BcLexKeyword bc_lex_kws[20] = {
505 BC_LEX_KW_ENTRY("auto" , 1), // 0
506 BC_LEX_KW_ENTRY("break" , 1), // 1
507 BC_LEX_KW_ENTRY("continue", 0), // 2 note: this one has no terminating NUL
508 BC_LEX_KW_ENTRY("define" , 1), // 3
510 BC_LEX_KW_ENTRY("else" , 0), // 4
511 BC_LEX_KW_ENTRY("for" , 1), // 5
512 BC_LEX_KW_ENTRY("halt" , 0), // 6
513 BC_LEX_KW_ENTRY("ibase" , 1), // 7
515 BC_LEX_KW_ENTRY("if" , 1), // 8
516 BC_LEX_KW_ENTRY("last" , 0), // 9
517 BC_LEX_KW_ENTRY("length" , 1), // 10
518 BC_LEX_KW_ENTRY("limits" , 0), // 11
520 BC_LEX_KW_ENTRY("obase" , 1), // 12
521 BC_LEX_KW_ENTRY("print" , 0), // 13
522 BC_LEX_KW_ENTRY("quit" , 1), // 14
523 BC_LEX_KW_ENTRY("read" , 0), // 15
525 BC_LEX_KW_ENTRY("return" , 1), // 16
526 BC_LEX_KW_ENTRY("scale" , 1), // 17
527 BC_LEX_KW_ENTRY("sqrt" , 1), // 18
528 BC_LEX_KW_ENTRY("while" , 1), // 19
530 #undef BC_LEX_KW_ENTRY
558 #define bc_lex_kws_POSIX(i) ((1 << (i)) & POSIX_KWORD_MASK)
562 typedef BcStatus (*BcLexNext)(struct BcLex *);
564 typedef struct BcLex {
582 #define BC_PARSE_STREND ((char) UCHAR_MAX)
584 #define BC_PARSE_REL (1 << 0)
585 #define BC_PARSE_PRINT (1 << 1)
586 #define BC_PARSE_NOCALL (1 << 2)
587 #define BC_PARSE_NOREAD (1 << 3)
588 #define BC_PARSE_ARRAY (1 << 4)
590 #define BC_PARSE_TOP_FLAG_PTR(parse) ((uint8_t *) bc_vec_top(&(parse)->flags))
591 #define BC_PARSE_TOP_FLAG(parse) (*(BC_PARSE_TOP_FLAG_PTR(parse)))
593 #define BC_PARSE_FLAG_FUNC_INNER (1 << 0)
594 #define BC_PARSE_FUNC_INNER(parse) \
595 (BC_PARSE_TOP_FLAG(parse) & BC_PARSE_FLAG_FUNC_INNER)
597 #define BC_PARSE_FLAG_FUNC (1 << 1)
598 #define BC_PARSE_FUNC(parse) (BC_PARSE_TOP_FLAG(parse) & BC_PARSE_FLAG_FUNC)
600 #define BC_PARSE_FLAG_BODY (1 << 2)
601 #define BC_PARSE_BODY(parse) (BC_PARSE_TOP_FLAG(parse) & BC_PARSE_FLAG_BODY)
603 #define BC_PARSE_FLAG_LOOP (1 << 3)
604 #define BC_PARSE_LOOP(parse) (BC_PARSE_TOP_FLAG(parse) & BC_PARSE_FLAG_LOOP)
606 #define BC_PARSE_FLAG_LOOP_INNER (1 << 4)
607 #define BC_PARSE_LOOP_INNER(parse) \
608 (BC_PARSE_TOP_FLAG(parse) & BC_PARSE_FLAG_LOOP_INNER)
610 #define BC_PARSE_FLAG_IF (1 << 5)
611 #define BC_PARSE_IF(parse) (BC_PARSE_TOP_FLAG(parse) & BC_PARSE_FLAG_IF)
613 #define BC_PARSE_FLAG_ELSE (1 << 6)
614 #define BC_PARSE_ELSE(parse) (BC_PARSE_TOP_FLAG(parse) & BC_PARSE_FLAG_ELSE)
616 #define BC_PARSE_FLAG_IF_END (1 << 7)
617 #define BC_PARSE_IF_END(parse) (BC_PARSE_TOP_FLAG(parse) & BC_PARSE_FLAG_IF_END)
619 #define BC_PARSE_CAN_EXEC(parse) \
620 (!(BC_PARSE_TOP_FLAG(parse) & \
621 (BC_PARSE_FLAG_FUNC_INNER | BC_PARSE_FLAG_FUNC | BC_PARSE_FLAG_BODY | \
622 BC_PARSE_FLAG_LOOP | BC_PARSE_FLAG_LOOP_INNER | BC_PARSE_FLAG_IF | \
623 BC_PARSE_FLAG_ELSE | BC_PARSE_FLAG_IF_END)))
629 typedef BcStatus (*BcParseParse)(struct BcParse *);
631 typedef struct BcParse {
652 typedef struct BcProgram {
693 #define BC_PROG_STACK(s, n) ((s)->len >= ((size_t) n))
695 #define BC_PROG_MAIN (0)
696 #define BC_PROG_READ (1)
698 #define BC_PROG_REQ_FUNCS (2)
701 #define BC_PROG_STR(n) (!(n)->num && !(n)->cap)
702 #define BC_PROG_NUM(r, n) \
703 ((r)->t != BC_RESULT_ARRAY && (r)->t != BC_RESULT_STR && !BC_PROG_STR(n))
705 typedef unsigned long (*BcProgramBuiltIn)(BcNum *);
707 #define BC_FLAG_W (1 << 0)
708 #define BC_FLAG_V (1 << 1)
709 #define BC_FLAG_S (1 << 2)
710 #define BC_FLAG_Q (1 << 3)
711 #define BC_FLAG_L (1 << 4)
712 #define BC_FLAG_I (1 << 5)
713 #define DC_FLAG_X (1 << 6)
715 #define BC_MAX(a, b) ((a) > (b) ? (a) : (b))
716 #define BC_MIN(a, b) ((a) < (b) ? (a) : (b))
718 #define BC_MAX_OBASE ((unsigned) 999)
719 #define BC_MAX_DIM ((unsigned) INT_MAX)
720 #define BC_MAX_SCALE ((unsigned) UINT_MAX)
721 #define BC_MAX_STRING ((unsigned) UINT_MAX - 1)
722 #define BC_MAX_NUM BC_MAX_STRING
723 // Unused apart from "limits" message. Just show a "biggish number" there.
724 //#define BC_MAX_NAME BC_MAX_STRING
725 //#define BC_MAX_EXP ((unsigned long) LONG_MAX)
726 //#define BC_MAX_VARS ((unsigned long) SIZE_MAX - 1)
727 #define BC_MAX_NAME_STR "999999999"
728 #define BC_MAX_EXP_STR "999999999"
729 #define BC_MAX_VARS_STR "999999999"
731 #define BC_MAX_OBASE_STR "999"
733 #if INT_MAX == 2147483647
734 # define BC_MAX_DIM_STR "2147483647"
735 #elif INT_MAX == 9223372036854775807
736 # define BC_MAX_DIM_STR "9223372036854775807"
738 # error Strange INT_MAX
741 #if UINT_MAX == 4294967295
742 # define BC_MAX_SCALE_STR "4294967295"
743 # define BC_MAX_STRING_STR "4294967294"
744 #elif UINT_MAX == 18446744073709551615
745 # define BC_MAX_SCALE_STR "18446744073709551615"
746 # define BC_MAX_STRING_STR "18446744073709551614"
748 # error Strange UINT_MAX
750 #define BC_MAX_NUM_STR BC_MAX_STRING_STR
753 IF_FEATURE_BC_SIGNALS(smallint ttyin;)
754 IF_FEATURE_CLEAN_UP(smallint exiting;)
761 // For error messages. Can be set to current parsed line,
762 // or [TODO] to current executing line (can be before last parsed one)
769 #if ENABLE_FEATURE_EDITING
770 line_input_t *line_input_state;
773 #define G (*ptr_to_globals)
774 #define INIT_G() do { \
775 SET_PTR_TO_GLOBALS(xzalloc(sizeof(G))); \
777 #define FREE_G() do { \
778 FREE_PTR_TO_GLOBALS(); \
780 #define G_posix (ENABLE_BC && (option_mask32 & BC_FLAG_S))
781 #define G_warn (ENABLE_BC && (option_mask32 & BC_FLAG_W))
782 #define G_exreg (ENABLE_DC && (option_mask32 & DC_FLAG_X))
783 #if ENABLE_FEATURE_BC_SIGNALS
784 # define G_interrupt bb_got_signal
785 # define G_ttyin G.ttyin
787 # define G_interrupt 0
790 #if ENABLE_FEATURE_CLEAN_UP
791 # define G_exiting G.exiting
795 #define IS_BC (ENABLE_BC && (!ENABLE_DC || applet_name[0] == 'b'))
799 // This is a bit array that corresponds to token types. An entry is
800 // true if the token is valid in an expression, false otherwise.
802 BC_PARSE_EXPRS_BITS = 0
803 + ((uint64_t)((0 << 0)+(0 << 1)+(1 << 2)+(1 << 3)+(1 << 4)+(1 << 5)+(1 << 6)+(1 << 7)) << (0*8))
804 + ((uint64_t)((1 << 0)+(1 << 1)+(1 << 2)+(1 << 3)+(1 << 4)+(1 << 5)+(1 << 6)+(1 << 7)) << (1*8))
805 + ((uint64_t)((1 << 0)+(1 << 1)+(1 << 2)+(1 << 3)+(1 << 4)+(1 << 5)+(1 << 6)+(1 << 7)) << (2*8))
806 + ((uint64_t)((1 << 0)+(1 << 1)+(1 << 2)+(0 << 3)+(0 << 4)+(1 << 5)+(1 << 6)+(0 << 7)) << (3*8))
807 + ((uint64_t)((0 << 0)+(0 << 1)+(0 << 2)+(0 << 3)+(0 << 4)+(0 << 5)+(1 << 6)+(1 << 7)) << (4*8))
808 + ((uint64_t)((0 << 0)+(0 << 1)+(0 << 2)+(0 << 3)+(0 << 4)+(0 << 5)+(0 << 6)+(1 << 7)) << (5*8))
809 + ((uint64_t)((0 << 0)+(1 << 1)+(1 << 2)+(1 << 3)+(1 << 4)+(0 << 5)+(0 << 6)+(1 << 7)) << (6*8))
810 + ((uint64_t)((0 << 0)+(1 << 1)+(1 << 2)+(0 << 3) ) << (7*8))
812 static ALWAYS_INLINE long bc_parse_exprs(unsigned i)
814 #if ULONG_MAX > 0xffffffff
815 // 64-bit version (will not work correctly for 32-bit longs!)
816 return BC_PARSE_EXPRS_BITS & (1UL << i);
819 unsigned long m = (uint32_t)BC_PARSE_EXPRS_BITS;
821 m = (uint32_t)(BC_PARSE_EXPRS_BITS >> 32);
824 return m & (1UL << i);
828 // This is an array of data for operators that correspond to token types.
829 static const uint8_t bc_parse_ops[] = {
830 #define OP(p,l) ((int)(l) * 0x10 + (p))
831 OP(0, false), OP( 0, false ), // inc dec
834 OP(3, true ), OP( 3, true ), OP( 3, true ), // pow mul div
835 OP(4, true ), OP( 4, true ), // mod + -
836 OP(6, true ), OP( 6, true ), OP( 6, true ), OP( 6, true ), OP( 6, true ), OP( 6, true ), // == <= >= != < >
838 OP(7, true ), OP( 7, true ), // or and
839 OP(5, false), OP( 5, false ), OP( 5, false ), OP( 5, false ), OP( 5, false ), // ^= *= /= %= +=
840 OP(5, false), OP( 5, false ), // -= =
843 #define bc_parse_op_PREC(i) (bc_parse_ops[i] & 0x0f)
844 #define bc_parse_op_LEFT(i) (bc_parse_ops[i] & 0x10)
846 // Byte array of up to 4 BC_LEX's, packed into 32-bit word
847 typedef uint32_t BcParseNext;
849 // These identify what tokens can come after expressions in certain cases.
851 #define BC_PARSE_NEXT4(a,b,c,d) ( (a) | ((b)<<8) | ((c)<<16) | ((((d)|0x80)<<24)) )
852 #define BC_PARSE_NEXT2(a,b) BC_PARSE_NEXT4(a,b,0xff,0xff)
853 #define BC_PARSE_NEXT1(a) BC_PARSE_NEXT4(a,0xff,0xff,0xff)
854 bc_parse_next_expr = BC_PARSE_NEXT4(BC_LEX_NLINE, BC_LEX_SCOLON, BC_LEX_RBRACE, BC_LEX_EOF),
855 bc_parse_next_param = BC_PARSE_NEXT2(BC_LEX_RPAREN, BC_LEX_COMMA),
856 bc_parse_next_print = BC_PARSE_NEXT4(BC_LEX_COMMA, BC_LEX_NLINE, BC_LEX_SCOLON, BC_LEX_EOF),
857 bc_parse_next_rel = BC_PARSE_NEXT1(BC_LEX_RPAREN),
858 bc_parse_next_elem = BC_PARSE_NEXT1(BC_LEX_RBRACKET),
859 bc_parse_next_for = BC_PARSE_NEXT1(BC_LEX_SCOLON),
860 bc_parse_next_read = BC_PARSE_NEXT2(BC_LEX_NLINE, BC_LEX_EOF),
861 #undef BC_PARSE_NEXT4
862 #undef BC_PARSE_NEXT2
863 #undef BC_PARSE_NEXT1
868 static const //BcLexType - should be this type, but narrower type saves size:
871 BC_LEX_OP_REL_EQ, BC_LEX_OP_REL_LE, BC_LEX_OP_REL_GE, BC_LEX_OP_REL_NE,
872 BC_LEX_OP_REL_LT, BC_LEX_OP_REL_GT, BC_LEX_SCOLON, BC_LEX_COLON,
873 BC_LEX_ELSE, BC_LEX_LOAD, BC_LEX_LOAD_POP, BC_LEX_OP_ASSIGN,
877 static const //BcLexType - should be this type
880 BC_LEX_OP_MODULUS, BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_LPAREN,
881 BC_LEX_INVALID, BC_LEX_OP_MULTIPLY, BC_LEX_OP_PLUS, BC_LEX_INVALID,
882 BC_LEX_OP_MINUS, BC_LEX_INVALID, BC_LEX_OP_DIVIDE,
883 BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID,
884 BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID,
885 BC_LEX_INVALID, BC_LEX_INVALID,
886 BC_LEX_COLON, BC_LEX_SCOLON, BC_LEX_OP_REL_GT, BC_LEX_OP_REL_EQ,
887 BC_LEX_OP_REL_LT, BC_LEX_KEY_READ, BC_LEX_INVALID,
888 BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID,
889 BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_EQ_NO_REG, BC_LEX_INVALID,
890 BC_LEX_KEY_IBASE, BC_LEX_INVALID, BC_LEX_KEY_SCALE, BC_LEX_LOAD_POP,
891 BC_LEX_INVALID, BC_LEX_OP_BOOL_NOT, BC_LEX_KEY_OBASE, BC_LEX_PRINT_STREAM,
892 BC_LEX_NQUIT, BC_LEX_POP, BC_LEX_STORE_PUSH, BC_LEX_INVALID, BC_LEX_INVALID,
893 BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_SCALE_FACTOR, BC_LEX_INVALID,
894 BC_LEX_KEY_LENGTH, BC_LEX_INVALID, BC_LEX_INVALID, BC_LEX_INVALID,
895 BC_LEX_OP_POWER, BC_LEX_NEG, BC_LEX_INVALID,
896 BC_LEX_ASCIIFY, BC_LEX_INVALID, BC_LEX_CLEAR_STACK, BC_LEX_DUPLICATE,
897 BC_LEX_ELSE, BC_LEX_PRINT_STACK, BC_LEX_INVALID, BC_LEX_INVALID,
898 BC_LEX_STORE_IBASE, BC_LEX_INVALID, BC_LEX_STORE_SCALE, BC_LEX_LOAD,
899 BC_LEX_INVALID, BC_LEX_PRINT_POP, BC_LEX_STORE_OBASE, BC_LEX_KEY_PRINT,
900 BC_LEX_KEY_QUIT, BC_LEX_SWAP, BC_LEX_OP_ASSIGN, BC_LEX_INVALID,
901 BC_LEX_INVALID, BC_LEX_KEY_SQRT, BC_LEX_INVALID, BC_LEX_EXECUTE,
902 BC_LEX_INVALID, BC_LEX_STACK_LEVEL,
903 BC_LEX_LBRACE, BC_LEX_OP_MODEXP, BC_LEX_INVALID, BC_LEX_OP_DIVMOD,
907 static const //BcInst - should be this type. Using signed narrow type since BC_INST_INVALID is -1
910 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID, BC_INST_REL_GE,
911 BC_INST_INVALID, BC_INST_POWER, BC_INST_MULTIPLY, BC_INST_DIVIDE,
912 BC_INST_MODULUS, BC_INST_PLUS, BC_INST_MINUS,
913 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID,
914 BC_INST_INVALID, BC_INST_INVALID,
915 BC_INST_BOOL_NOT, BC_INST_INVALID, BC_INST_INVALID,
916 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID,
917 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID,
918 BC_INST_INVALID, BC_INST_INVALID, BC_INST_REL_GT, BC_INST_INVALID,
919 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID, BC_INST_REL_GE,
920 BC_INST_INVALID, BC_INST_INVALID,
921 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID,
922 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID,
923 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID, BC_INST_IBASE,
924 BC_INST_INVALID, BC_INST_INVALID, BC_INST_LENGTH, BC_INST_INVALID,
925 BC_INST_OBASE, BC_INST_PRINT, BC_INST_QUIT, BC_INST_INVALID,
926 BC_INST_INVALID, BC_INST_SCALE, BC_INST_SQRT, BC_INST_INVALID,
927 BC_INST_REL_EQ, BC_INST_MODEXP, BC_INST_DIVMOD, BC_INST_INVALID,
928 BC_INST_INVALID, BC_INST_EXECUTE, BC_INST_PRINT_STACK, BC_INST_CLEAR_STACK,
929 BC_INST_STACK_LEN, BC_INST_DUPLICATE, BC_INST_SWAP, BC_INST_POP,
930 BC_INST_ASCIIFY, BC_INST_PRINT_STREAM, BC_INST_INVALID, BC_INST_INVALID,
931 BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID, BC_INST_INVALID,
932 BC_INST_PRINT, BC_INST_NQUIT, BC_INST_SCALE_FUNC,
936 static const BcNumBinaryOp bc_program_ops[] = {
937 bc_num_pow, bc_num_mul, bc_num_div, bc_num_mod, bc_num_add, bc_num_sub,
940 static void fflush_and_check(void)
943 if (ferror(stdout) || ferror(stderr))
944 bb_perror_msg_and_die("output error");
947 #if ENABLE_FEATURE_CLEAN_UP
948 #define QUIT_OR_RETURN_TO_MAIN \
950 IF_FEATURE_BC_SIGNALS(G_ttyin = 0;) /* do not loop in main loop anymore */ \
952 return BC_STATUS_FAILURE; \
955 #define QUIT_OR_RETURN_TO_MAIN quit()
958 static void quit(void) NORETURN;
959 static void quit(void)
962 bb_perror_msg_and_die("input error");
967 static void bc_verror_msg(const char *fmt, va_list p)
969 const char *sv = sv; /* for compiler */
972 applet_name = xasprintf("%s: %s:%u", applet_name, G.prog.file, G.err_line);
974 bb_verror_msg(fmt, p, NULL);
976 free((char*)applet_name);
981 static NOINLINE int bc_error_fmt(const char *fmt, ...)
986 bc_verror_msg(fmt, p);
989 if (!ENABLE_FEATURE_CLEAN_UP && !G_ttyin)
991 return BC_STATUS_FAILURE;
995 static NOINLINE int bc_posix_error_fmt(const char *fmt, ...)
999 // Are non-POSIX constructs totally ok?
1000 if (!(option_mask32 & (BC_FLAG_S|BC_FLAG_W)))
1001 return BC_STATUS_SUCCESS; // yes
1004 bc_verror_msg(fmt, p);
1007 // Do we treat non-POSIX constructs as errors?
1008 if (!(option_mask32 & BC_FLAG_S))
1009 return BC_STATUS_SUCCESS; // no, it's a warning
1010 if (!ENABLE_FEATURE_CLEAN_UP && !G_ttyin)
1012 return BC_STATUS_FAILURE;
1016 // We use error functions with "return bc_error(FMT[, PARAMS])" idiom.
1017 // This idiom begs for tail-call optimization, but for it to work,
1018 // function must not have caller-cleaned parameters on stack.
1019 // Unfortunately, vararg function API does exactly that on most arches.
1020 // Thus, use these shims for the cases when we have no vararg PARAMS:
1021 static int bc_error(const char *msg)
1023 return bc_error_fmt("%s", msg);
1026 static int bc_POSIX_requires(const char *msg)
1028 return bc_posix_error_fmt("POSIX requires %s", msg);
1030 static int bc_POSIX_does_not_allow(const char *msg)
1032 return bc_posix_error_fmt("%s%s", "POSIX does not allow ", msg);
1034 static int bc_POSIX_does_not_allow_bool_ops_this_is_bad(const char *msg)
1036 return bc_posix_error_fmt("%s%s %s", "POSIX does not allow ", "boolean operators; the following is bad:", msg);
1038 static int bc_POSIX_does_not_allow_empty_X_expression_in_for(const char *msg)
1040 return bc_posix_error_fmt("%san empty %s expression in a for loop", "POSIX does not allow ", msg);
1043 static int bc_error_bad_character(char c)
1045 return bc_error_fmt("bad character '%c'", c);
1047 static int bc_error_bad_expression(void)
1049 return bc_error("bad expression");
1051 static int bc_error_bad_token(void)
1053 return bc_error("bad token");
1055 static int bc_error_stack_has_too_few_elements(void)
1057 return bc_error("stack has too few elements");
1059 static int bc_error_variable_is_wrong_type(void)
1061 return bc_error("variable is wrong type");
1063 static int bc_error_nested_read_call(void)
1065 return bc_error("read() call inside of a read() call");
1068 static void bc_vec_grow(BcVec *v, size_t n)
1070 size_t cap = v->cap * 2;
1071 while (cap < v->len + n) cap *= 2;
1072 v->v = xrealloc(v->v, v->size * cap);
1076 static void bc_vec_init(BcVec *v, size_t esize, BcVecFree dtor)
1079 v->cap = BC_VEC_START_CAP;
1082 v->v = xmalloc(esize * BC_VEC_START_CAP);
1085 static void bc_char_vec_init(BcVec *v)
1087 bc_vec_init(v, sizeof(char), NULL);
1090 static void bc_vec_expand(BcVec *v, size_t req)
1093 v->v = xrealloc(v->v, v->size * req);
1098 static void bc_vec_pop(BcVec *v)
1102 v->dtor(v->v + (v->size * v->len));
1105 static void bc_vec_npop(BcVec *v, size_t n)
1110 size_t len = v->len - n;
1111 while (v->len > len) v->dtor(v->v + (v->size * --v->len));
1115 static void bc_vec_pop_all(BcVec *v)
1117 bc_vec_npop(v, v->len);
1120 static void bc_vec_push(BcVec *v, const void *data)
1122 if (v->len + 1 > v->cap) bc_vec_grow(v, 1);
1123 memmove(v->v + (v->size * v->len), data, v->size);
1127 static void bc_vec_pushByte(BcVec *v, char data)
1129 bc_vec_push(v, &data);
1132 static void bc_vec_pushZeroByte(BcVec *v)
1134 //bc_vec_pushByte(v, '\0');
1136 bc_vec_push(v, &const_int_0);
1139 static void bc_vec_pushAt(BcVec *v, const void *data, size_t idx)
1142 bc_vec_push(v, data);
1147 if (v->len == v->cap) bc_vec_grow(v, 1);
1149 ptr = v->v + v->size * idx;
1151 memmove(ptr + v->size, ptr, v->size * (v->len++ - idx));
1152 memmove(ptr, data, v->size);
1156 static void bc_vec_string(BcVec *v, size_t len, const char *str)
1159 bc_vec_expand(v, len + 1);
1160 memcpy(v->v, str, len);
1163 bc_vec_pushZeroByte(v);
1166 static void bc_vec_concat(BcVec *v, const char *str)
1170 if (v->len == 0) bc_vec_pushZeroByte(v);
1173 len = v->len + slen;
1175 if (v->cap < len) bc_vec_grow(v, slen);
1176 strcpy(v->v + v->len - 1, str);
1181 static void *bc_vec_item(const BcVec *v, size_t idx)
1183 return v->v + v->size * idx;
1186 static char** bc_program_str(size_t idx)
1188 return bc_vec_item(&G.prog.strs, idx);
1191 static BcFunc* bc_program_func(size_t idx)
1193 return bc_vec_item(&G.prog.fns, idx);
1196 static void *bc_vec_item_rev(const BcVec *v, size_t idx)
1198 return v->v + v->size * (v->len - idx - 1);
1201 static void *bc_vec_top(const BcVec *v)
1203 return v->v + v->size * (v->len - 1);
1206 static void bc_vec_free(void *vec)
1208 BcVec *v = (BcVec *) vec;
1213 static int bc_id_cmp(const void *e1, const void *e2)
1215 return strcmp(((const BcId *) e1)->name, ((const BcId *) e2)->name);
1218 static void bc_id_free(void *id)
1220 free(((BcId *) id)->name);
1223 static size_t bc_map_find(const BcVec *v, const void *ptr)
1225 size_t low = 0, high = v->len;
1227 while (low < high) {
1229 size_t mid = (low + high) / 2;
1230 BcId *id = bc_vec_item(v, mid);
1231 int result = bc_id_cmp(ptr, id);
1235 else if (result < 0)
1244 static int bc_map_insert(BcVec *v, const void *ptr, size_t *i)
1246 size_t n = *i = bc_map_find(v, ptr);
1249 bc_vec_push(v, ptr);
1250 else if (!bc_id_cmp(ptr, bc_vec_item(v, n)))
1251 return 0; // "was not inserted"
1253 bc_vec_pushAt(v, ptr, n);
1254 return 1; // "was inserted"
1258 static size_t bc_map_index(const BcVec *v, const void *ptr)
1260 size_t i = bc_map_find(v, ptr);
1261 if (i >= v->len) return BC_VEC_INVALID_IDX;
1262 return bc_id_cmp(ptr, bc_vec_item(v, i)) ? BC_VEC_INVALID_IDX : i;
1266 static int push_input_byte(BcVec *vec, char c)
1268 if ((c < ' ' && c != '\t' && c != '\r' && c != '\n') // also allow '\v' '\f'?
1271 // Bad chars on this line, ignore entire line
1272 bc_error_fmt("illegal character 0x%02x", c);
1275 bc_vec_pushByte(vec, (char)c);
1279 static BcStatus bc_read_line(BcVec *vec)
1284 s = BC_STATUS_SUCCESS;
1289 bc_vec_pop_all(vec);
1293 #if ENABLE_FEATURE_BC_SIGNALS
1294 if (G_interrupt) { // ^C was pressed
1297 // GNU bc says "interrupted execution."
1298 // GNU dc says "Interrupt!"
1299 fputs("\ninterrupted execution\n", stderr);
1301 # if ENABLE_FEATURE_EDITING
1304 # define line_buf bb_common_bufsiz1
1305 n = read_line_input(G.line_input_state, "", line_buf, COMMON_BUFSIZE);
1306 if (n <= 0) { // read errors or EOF, or ^D, or ^C
1316 bad_chars |= push_input_byte(vec, c);
1323 IF_FEATURE_BC_SIGNALS(errno = 0;)
1326 #if ENABLE_FEATURE_BC_SIGNALS && !ENABLE_FEATURE_EDITING
1327 // Both conditions appear simultaneously, check both just in case
1328 if (errno == EINTR || G_interrupt) {
1336 quit(); // this emits error message
1338 // Note: EOF does not append '\n', therefore:
1339 // printf 'print 123\n' | bc - works
1340 // printf 'print 123' | bc - fails (syntax error)
1343 bad_chars |= push_input_byte(vec, c);
1344 } while (c != '\n');
1346 } while (bad_chars);
1348 bc_vec_pushZeroByte(vec);
1353 static char* bc_read_file(const char *path)
1356 size_t size = ((size_t) -1);
1359 // Never returns NULL (dies on errors)
1360 buf = xmalloc_xopen_read_close(path, &size);
1362 for (i = 0; i < size; ++i) {
1364 if ((c < ' ' && c != '\t' && c != '\r' && c != '\n') // also allow '\v' '\f'?
1376 static void bc_num_setToZero(BcNum *n, size_t scale)
1383 static void bc_num_zero(BcNum *n)
1385 bc_num_setToZero(n, 0);
1388 static void bc_num_one(BcNum *n)
1390 bc_num_setToZero(n, 0);
1395 static void bc_num_ten(BcNum *n)
1397 bc_num_setToZero(n, 0);
1403 // Note: this also sets BcNum to zero
1404 static void bc_num_init(BcNum *n, size_t req)
1406 req = req >= BC_NUM_DEF_SIZE ? req : BC_NUM_DEF_SIZE;
1407 //memset(n, 0, sizeof(BcNum)); - cleared by assignments below
1408 n->num = xmalloc(req);
1415 static void bc_num_init_DEF_SIZE(BcNum *n)
1417 bc_num_init(n, BC_NUM_DEF_SIZE);
1420 static void bc_num_expand(BcNum *n, size_t req)
1422 req = req >= BC_NUM_DEF_SIZE ? req : BC_NUM_DEF_SIZE;
1424 n->num = xrealloc(n->num, req);
1429 static void bc_num_free(void *num)
1431 free(((BcNum *) num)->num);
1434 static void bc_num_copy(BcNum *d, BcNum *s)
1437 bc_num_expand(d, s->cap);
1441 memcpy(d->num, s->num, sizeof(BcDig) * d->len);
1445 static BcStatus bc_num_ulong(BcNum *n, unsigned long *result_p)
1448 unsigned long pow, result;
1450 if (n->neg) return bc_error("negative number");
1452 for (result = 0, pow = 1, i = n->rdx; i < n->len; ++i) {
1454 unsigned long prev = result, powprev = pow;
1456 result += ((unsigned long) n->num[i]) * pow;
1459 if (result < prev || pow < powprev)
1460 return bc_error("overflow");
1466 return BC_STATUS_SUCCESS;
1469 static void bc_num_ulong2num(BcNum *n, unsigned long val)
1475 if (val == 0) return;
1477 if (ULONG_MAX == 0xffffffffUL)
1478 bc_num_expand(n, 10); // 10 digits: 4294967295
1479 if (ULONG_MAX == 0xffffffffffffffffUL)
1480 bc_num_expand(n, 20); // 20 digits: 18446744073709551615
1481 BUILD_BUG_ON(ULONG_MAX > 0xffffffffffffffffUL);
1488 if (val == 0) break;
1492 static void bc_num_subArrays(BcDig *restrict a, BcDig *restrict b,
1496 for (i = 0; i < len; ++i) {
1497 for (a[i] -= b[i], j = 0; a[i + j] < 0;) {
1504 #define BC_NUM_NEG(n, neg) ((((ssize_t)(n)) ^ -((ssize_t)(neg))) + (neg))
1505 #define BC_NUM_ONE(n) ((n)->len == 1 && (n)->rdx == 0 && (n)->num[0] == 1)
1506 #define BC_NUM_INT(n) ((n)->len - (n)->rdx)
1507 //#define BC_NUM_AREQ(a, b) (BC_MAX((a)->rdx, (b)->rdx) + BC_MAX(BC_NUM_INT(a), BC_NUM_INT(b)) + 1)
1508 static /*ALWAYS_INLINE*/ size_t BC_NUM_AREQ(BcNum *a, BcNum *b)
1510 return BC_MAX(a->rdx, b->rdx) + BC_MAX(BC_NUM_INT(a), BC_NUM_INT(b)) + 1;
1512 //#define BC_NUM_MREQ(a, b, scale) (BC_NUM_INT(a) + BC_NUM_INT(b) + BC_MAX((scale), (a)->rdx + (b)->rdx) + 1)
1513 static /*ALWAYS_INLINE*/ size_t BC_NUM_MREQ(BcNum *a, BcNum *b, size_t scale)
1515 return BC_NUM_INT(a) + BC_NUM_INT(b) + BC_MAX(scale, a->rdx + b->rdx) + 1;
1518 static ssize_t bc_num_compare(BcDig *restrict a, BcDig *restrict b, size_t len)
1522 for (i = len - 1; i < len && !(c = a[i] - b[i]); --i);
1523 return BC_NUM_NEG(i + 1, c < 0);
1526 static ssize_t bc_num_cmp(BcNum *a, BcNum *b)
1528 size_t i, min, a_int, b_int, diff;
1529 BcDig *max_num, *min_num;
1530 bool a_max, neg = false;
1533 if (a == b) return 0;
1534 if (a->len == 0) return BC_NUM_NEG(!!b->len, !b->neg);
1535 if (b->len == 0) return BC_NUM_NEG(1, a->neg);
1545 a_int = BC_NUM_INT(a);
1546 b_int = BC_NUM_INT(b);
1548 a_max = (a->rdx > b->rdx);
1550 if (a_int != 0) return (ssize_t) a_int;
1554 diff = a->rdx - b->rdx;
1555 max_num = a->num + diff;
1560 diff = b->rdx - a->rdx;
1561 max_num = b->num + diff;
1565 cmp = bc_num_compare(max_num, min_num, b_int + min);
1566 if (cmp != 0) return BC_NUM_NEG(cmp, (!a_max) != neg);
1568 for (max_num -= diff, i = diff - 1; i < diff; --i) {
1569 if (max_num[i]) return BC_NUM_NEG(1, (!a_max) != neg);
1575 static void bc_num_truncate(BcNum *n, size_t places)
1577 if (places == 0) return;
1583 memmove(n->num, n->num + places, n->len * sizeof(BcDig));
1587 static void bc_num_extend(BcNum *n, size_t places)
1589 size_t len = n->len + places;
1593 if (n->cap < len) bc_num_expand(n, len);
1595 memmove(n->num + places, n->num, sizeof(BcDig) * n->len);
1596 memset(n->num, 0, sizeof(BcDig) * places);
1603 static void bc_num_clean(BcNum *n)
1605 while (n->len > 0 && n->num[n->len - 1] == 0) --n->len;
1608 else if (n->len < n->rdx)
1612 static void bc_num_retireMul(BcNum *n, size_t scale, bool neg1, bool neg2)
1615 bc_num_extend(n, scale - n->rdx);
1617 bc_num_truncate(n, n->rdx - scale);
1620 if (n->len != 0) n->neg = !neg1 != !neg2;
1623 static void bc_num_split(BcNum *restrict n, size_t idx, BcNum *restrict a,
1628 b->len = n->len - idx;
1630 a->rdx = b->rdx = 0;
1632 memcpy(b->num, n->num + idx, b->len * sizeof(BcDig));
1633 memcpy(a->num, n->num, idx * sizeof(BcDig));
1644 static BcStatus bc_num_shift(BcNum *n, size_t places)
1646 if (places == 0 || n->len == 0) return BC_STATUS_SUCCESS;
1648 // This check makes sense only if size_t is (much) larger than BC_MAX_NUM.
1649 if (SIZE_MAX > (BC_MAX_NUM | 0xff)) {
1650 if (places + n->len > BC_MAX_NUM)
1651 return bc_error("number too long: must be [1,"BC_MAX_NUM_STR"]");
1654 if (n->rdx >= places)
1657 bc_num_extend(n, places - n->rdx);
1663 return BC_STATUS_SUCCESS;
1666 static BcStatus bc_num_inv(BcNum *a, BcNum *b, size_t scale)
1675 return bc_num_div(&one, a, b, scale);
1678 static BcStatus bc_num_a(BcNum *a, BcNum *b, BcNum *restrict c, size_t sub)
1680 BcDig *ptr, *ptr_a, *ptr_b, *ptr_c;
1681 size_t i, max, min_rdx, min_int, diff, a_int, b_int;
1684 // Because this function doesn't need to use scale (per the bc spec),
1685 // I am hijacking it to say whether it's doing an add or a subtract.
1689 if (sub && c->len) c->neg = !c->neg;
1690 return BC_STATUS_SUCCESS;
1692 else if (b->len == 0) {
1694 return BC_STATUS_SUCCESS;
1698 c->rdx = BC_MAX(a->rdx, b->rdx);
1699 min_rdx = BC_MIN(a->rdx, b->rdx);
1702 if (a->rdx > b->rdx) {
1703 diff = a->rdx - b->rdx;
1705 ptr_a = a->num + diff;
1709 diff = b->rdx - a->rdx;
1712 ptr_b = b->num + diff;
1715 for (ptr_c = c->num, i = 0; i < diff; ++i, ++c->len) ptr_c[i] = ptr[i];
1718 a_int = BC_NUM_INT(a);
1719 b_int = BC_NUM_INT(b);
1721 if (a_int > b_int) {
1732 for (carry = 0, i = 0; i < min_rdx + min_int; ++i, ++c->len) {
1733 in = ((int) ptr_a[i]) + ((int) ptr_b[i]) + carry;
1735 ptr_c[i] = (BcDig)(in % 10);
1738 for (; i < max + min_rdx; ++i, ++c->len) {
1739 in = ((int) ptr[i]) + carry;
1741 ptr_c[i] = (BcDig)(in % 10);
1744 if (carry != 0) c->num[c->len++] = (BcDig) carry;
1746 return BC_STATUS_SUCCESS; // can't make void, see bc_num_binary()
1749 static BcStatus bc_num_s(BcNum *a, BcNum *b, BcNum *restrict c, size_t sub)
1752 BcNum *minuend, *subtrahend;
1754 bool aneg, bneg, neg;
1756 // Because this function doesn't need to use scale (per the bc spec),
1757 // I am hijacking it to say whether it's doing an add or a subtract.
1761 if (sub && c->len) c->neg = !c->neg;
1762 return BC_STATUS_SUCCESS;
1764 else if (b->len == 0) {
1766 return BC_STATUS_SUCCESS;
1771 a->neg = b->neg = false;
1773 cmp = bc_num_cmp(a, b);
1779 bc_num_setToZero(c, BC_MAX(a->rdx, b->rdx));
1780 return BC_STATUS_SUCCESS;
1789 if (sub) neg = !neg;
1794 bc_num_copy(c, minuend);
1797 if (c->rdx < subtrahend->rdx) {
1798 bc_num_extend(c, subtrahend->rdx - c->rdx);
1802 start = c->rdx - subtrahend->rdx;
1804 bc_num_subArrays(c->num + start, subtrahend->num, subtrahend->len);
1808 return BC_STATUS_SUCCESS; // can't make void, see bc_num_binary()
1811 static BcStatus bc_num_k(BcNum *restrict a, BcNum *restrict b,
1815 size_t max = BC_MAX(a->len, b->len), max2 = (max + 1) / 2;
1816 BcNum l1, h1, l2, h2, m2, m1, z0, z1, z2, temp;
1819 if (a->len == 0 || b->len == 0) {
1821 return BC_STATUS_SUCCESS;
1823 aone = BC_NUM_ONE(a);
1824 if (aone || BC_NUM_ONE(b)) {
1825 bc_num_copy(c, aone ? b : a);
1826 return BC_STATUS_SUCCESS;
1829 if (a->len + b->len < BC_NUM_KARATSUBA_LEN ||
1830 a->len < BC_NUM_KARATSUBA_LEN || b->len < BC_NUM_KARATSUBA_LEN)
1835 bc_num_expand(c, a->len + b->len + 1);
1837 memset(c->num, 0, sizeof(BcDig) * c->cap);
1840 for (i = 0; i < b->len; ++i) {
1843 for (j = 0; j < a->len; ++j) {
1844 unsigned in = c->num[i + j];
1845 in += ((unsigned) a->num[j]) * ((unsigned) b->num[i]) + carry;
1846 // note: compilers prefer _unsigned_ div/const
1848 c->num[i + j] = (BcDig)(in % 10);
1851 c->num[i + j] += (BcDig) carry;
1852 len = BC_MAX(len, i + j + !!carry);
1855 // a*a <- without check below, this will not be interruptible
1856 if (G_interrupt) return BC_STATUS_FAILURE;
1861 return BC_STATUS_SUCCESS;
1864 bc_num_init(&l1, max);
1865 bc_num_init(&h1, max);
1866 bc_num_init(&l2, max);
1867 bc_num_init(&h2, max);
1868 bc_num_init(&m1, max);
1869 bc_num_init(&m2, max);
1870 bc_num_init(&z0, max);
1871 bc_num_init(&z1, max);
1872 bc_num_init(&z2, max);
1873 bc_num_init(&temp, max + max);
1875 bc_num_split(a, max2, &l1, &h1);
1876 bc_num_split(b, max2, &l2, &h2);
1878 s = bc_num_add(&h1, &l1, &m1, 0);
1880 s = bc_num_add(&h2, &l2, &m2, 0);
1883 s = bc_num_k(&h1, &h2, &z0);
1885 s = bc_num_k(&m1, &m2, &z1);
1887 s = bc_num_k(&l1, &l2, &z2);
1890 s = bc_num_sub(&z1, &z0, &temp, 0);
1892 s = bc_num_sub(&temp, &z2, &z1, 0);
1895 s = bc_num_shift(&z0, max2 * 2);
1897 s = bc_num_shift(&z1, max2);
1899 s = bc_num_add(&z0, &z1, &temp, 0);
1901 s = bc_num_add(&temp, &z2, c, 0);
1917 static BcStatus bc_num_m(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale)
1921 size_t maxrdx = BC_MAX(a->rdx, b->rdx);
1923 scale = BC_MAX(scale, a->rdx);
1924 scale = BC_MAX(scale, b->rdx);
1925 scale = BC_MIN(a->rdx + b->rdx, scale);
1926 maxrdx = BC_MAX(maxrdx, scale);
1928 bc_num_init(&cpa, a->len);
1929 bc_num_init(&cpb, b->len);
1931 bc_num_copy(&cpa, a);
1932 bc_num_copy(&cpb, b);
1933 cpa.neg = cpb.neg = false;
1935 s = bc_num_shift(&cpa, maxrdx);
1937 s = bc_num_shift(&cpb, maxrdx);
1939 s = bc_num_k(&cpa, &cpb, c);
1943 bc_num_expand(c, c->len + maxrdx);
1945 if (c->len < maxrdx) {
1946 memset(c->num + c->len, 0, (c->cap - c->len) * sizeof(BcDig));
1951 bc_num_retireMul(c, scale, a->neg, b->neg);
1959 static BcStatus bc_num_d(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale)
1961 BcStatus s = BC_STATUS_SUCCESS;
1968 return bc_error("divide by zero");
1969 else if (a->len == 0) {
1970 bc_num_setToZero(c, scale);
1971 return BC_STATUS_SUCCESS;
1973 else if (BC_NUM_ONE(b)) {
1975 bc_num_retireMul(c, scale, a->neg, b->neg);
1976 return BC_STATUS_SUCCESS;
1979 bc_num_init(&cp, BC_NUM_MREQ(a, b, scale));
1980 bc_num_copy(&cp, a);
1984 bc_num_expand(&cp, len + 2);
1985 bc_num_extend(&cp, len - cp.len);
1988 if (b->rdx > cp.rdx) bc_num_extend(&cp, b->rdx - cp.rdx);
1990 if (scale > cp.rdx) bc_num_extend(&cp, scale - cp.rdx);
1992 if (b->rdx == b->len) {
1993 for (i = 0; zero && i < len; ++i) zero = !b->num[len - i - 1];
1997 if (cp.cap == cp.len) bc_num_expand(&cp, cp.len + 1);
1999 // We want an extra zero in front to make things simpler.
2000 cp.num[cp.len++] = 0;
2003 bc_num_expand(c, cp.len);
2006 memset(c->num + end, 0, (c->cap - end) * sizeof(BcDig));
2011 for (i = end - 1; !s && i < end; --i) {
2013 for (q = 0; (!s && n[len] != 0) || bc_num_compare(n, p, len) >= 0; ++q)
2014 bc_num_subArrays(n, p, len);
2018 // 1/a <- without check below, this will not be interruptible
2020 s = BC_STATUS_FAILURE;
2025 bc_num_retireMul(c, scale, a->neg, b->neg);
2031 static BcStatus bc_num_r(BcNum *a, BcNum *b, BcNum *restrict c,
2032 BcNum *restrict d, size_t scale, size_t ts)
2039 return bc_error("divide by zero");
2042 bc_num_setToZero(d, ts);
2043 return BC_STATUS_SUCCESS;
2046 bc_num_init(&temp, d->cap);
2047 s = bc_num_d(a, b, c, scale);
2050 if (scale != 0) scale = ts;
2052 s = bc_num_m(c, b, &temp, scale);
2054 s = bc_num_sub(a, &temp, d, scale);
2057 if (ts > d->rdx && d->len) bc_num_extend(d, ts - d->rdx);
2060 bc_num_retireMul(d, ts, a->neg, b->neg);
2068 static BcStatus bc_num_rem(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale)
2072 size_t ts = BC_MAX(scale + b->rdx, a->rdx), len = BC_NUM_MREQ(a, b, ts);
2074 bc_num_init(&c1, len);
2075 s = bc_num_r(a, b, &c1, c, scale, ts);
2081 static BcStatus bc_num_p(BcNum *a, BcNum *b, BcNum *restrict c, size_t scale)
2083 BcStatus s = BC_STATUS_SUCCESS;
2086 size_t i, powrdx, resrdx;
2089 if (b->rdx) return bc_error("non integer number");
2093 return BC_STATUS_SUCCESS;
2095 else if (a->len == 0) {
2096 bc_num_setToZero(c, scale);
2097 return BC_STATUS_SUCCESS;
2099 else if (BC_NUM_ONE(b)) {
2103 s = bc_num_inv(a, c, scale);
2110 s = bc_num_ulong(b, &pow);
2113 bc_num_init(©, a->len);
2114 bc_num_copy(©, a);
2119 if (a->rdx * pow < scale)
2120 scale = a->rdx * pow;
2125 for (powrdx = a->rdx; !(pow & 1); pow >>= 1) {
2127 s = bc_num_mul(©, ©, ©, powrdx);
2129 // Not needed: bc_num_mul() has a check for ^C:
2130 //if (G_interrupt) {
2131 // s = BC_STATUS_FAILURE;
2136 bc_num_copy(c, ©);
2138 for (resrdx = powrdx, pow >>= 1; pow != 0; pow >>= 1) {
2141 s = bc_num_mul(©, ©, ©, powrdx);
2146 s = bc_num_mul(c, ©, c, resrdx);
2149 // Not needed: bc_num_mul() has a check for ^C:
2150 //if (G_interrupt) {
2151 // s = BC_STATUS_FAILURE;
2157 s = bc_num_inv(c, c, scale);
2161 if (c->rdx > scale) bc_num_truncate(c, c->rdx - scale);
2163 // We can't use bc_num_clean() here.
2164 for (zero = true, i = 0; zero && i < c->len; ++i) zero = !c->num[i];
2165 if (zero) bc_num_setToZero(c, scale);
2172 static BcStatus bc_num_binary(BcNum *a, BcNum *b, BcNum *c, size_t scale,
2173 BcNumBinaryOp op, size_t req)
2176 BcNum num2, *ptr_a, *ptr_b;
2181 memcpy(ptr_a, c, sizeof(BcNum));
2190 memcpy(ptr_b, c, sizeof(BcNum));
2198 bc_num_init(c, req);
2200 bc_num_expand(c, req);
2202 s = op(ptr_a, ptr_b, c, scale);
2204 if (init) bc_num_free(&num2);
2209 static void bc_num_printNewline(void)
2211 if (G.prog.nchars == G.prog.len - 1) {
2219 static void bc_num_printChar(size_t num, size_t width, bool radix)
2222 bb_putchar((char) num);
2223 G.prog.nchars += width;
2227 static void bc_num_printDigits(size_t num, size_t width, bool radix)
2231 bc_num_printNewline();
2232 bb_putchar(radix ? '.' : ' ');
2235 bc_num_printNewline();
2236 for (exp = 0, pow = 1; exp < width - 1; ++exp, pow *= 10)
2239 for (exp = 0; exp < width; pow /= 10, ++G.prog.nchars, ++exp) {
2241 bc_num_printNewline();
2244 bb_putchar(((char) dig) + '0');
2248 static void bc_num_printHex(size_t num, size_t width, bool radix)
2251 bc_num_printNewline();
2256 bc_num_printNewline();
2257 bb_putchar(bb_hexdigits_upcase[num]);
2258 G.prog.nchars += width;
2261 static void bc_num_printDecimal(BcNum *n)
2263 size_t i, rdx = n->rdx - 1;
2265 if (n->neg) bb_putchar('-');
2266 G.prog.nchars += n->neg;
2268 for (i = n->len - 1; i < n->len; --i)
2269 bc_num_printHex((size_t) n->num[i], 1, i == rdx);
2272 static BcStatus bc_num_printNum(BcNum *n, BcNum *base, size_t width, BcNumDigitOp print)
2276 BcNum intp, fracp, digit, frac_len;
2277 unsigned long dig, *ptr;
2282 print(0, width, false);
2283 return BC_STATUS_SUCCESS;
2286 bc_vec_init(&stack, sizeof(long), NULL);
2287 bc_num_init(&intp, n->len);
2288 bc_num_init(&fracp, n->rdx);
2289 bc_num_init(&digit, width);
2290 bc_num_init(&frac_len, BC_NUM_INT(n));
2291 bc_num_copy(&intp, n);
2292 bc_num_one(&frac_len);
2294 bc_num_truncate(&intp, intp.rdx);
2295 s = bc_num_sub(n, &intp, &fracp, 0);
2298 while (intp.len != 0) {
2299 s = bc_num_divmod(&intp, base, &intp, &digit, 0);
2301 s = bc_num_ulong(&digit, &dig);
2303 bc_vec_push(&stack, &dig);
2306 for (i = 0; i < stack.len; ++i) {
2307 ptr = bc_vec_item_rev(&stack, i);
2308 print(*ptr, width, false);
2311 if (!n->rdx) goto err;
2313 for (radix = true; frac_len.len <= n->rdx; radix = false) {
2314 s = bc_num_mul(&fracp, base, &fracp, n->rdx);
2316 s = bc_num_ulong(&fracp, &dig);
2318 bc_num_ulong2num(&intp, dig);
2319 s = bc_num_sub(&fracp, &intp, &fracp, 0);
2321 print(dig, width, radix);
2322 s = bc_num_mul(&frac_len, base, &frac_len, 0);
2327 bc_num_free(&frac_len);
2328 bc_num_free(&digit);
2329 bc_num_free(&fracp);
2331 bc_vec_free(&stack);
2335 static BcStatus bc_num_printBase(BcNum *n)
2349 if (G.prog.ob_t <= BC_NUM_MAX_IBASE) {
2351 print = bc_num_printHex;
2354 for (i = G.prog.ob_t - 1, width = 0; i != 0; i /= 10, ++width)
2356 print = bc_num_printDigits;
2359 s = bc_num_printNum(n, &G.prog.ob, width, print);
2366 static BcStatus bc_num_stream(BcNum *n, BcNum *base)
2368 return bc_num_printNum(n, base, 1, bc_num_printChar);
2372 static bool bc_num_strValid(const char *val, size_t base)
2377 b = (BcDig)(base <= 10 ? base + '0' : base - 10 + 'A');
2384 if (radix) return false;
2388 if (c < '0' || c >= b || (c > '9' && c < 'A'))
2394 // Note: n is already "bc_num_zero()"ed,
2395 // leading zeroes in "val" are removed
2396 static void bc_num_parseDecimal(BcNum *n, const char *val)
2407 for (i = 0; val[i]; ++i) {
2408 if (val[i] != '0' && val[i] != '.') {
2413 bc_num_expand(n, len);
2415 ptr = strchr(val, '.');
2419 n->rdx = (size_t)((val + len) - (ptr + 1));
2424 n->num[n->len] = val[i] - '0';
2427 if ((ssize_t)--i == (ssize_t)-1) break;
2428 if (val[i] == '.') goto skip_dot;
2433 // Note: n is already "bc_num_zero()"ed,
2434 // leading zeroes in "val" are removed
2435 static void bc_num_parseBase(BcNum *n, const char *val, BcNum *base)
2438 BcNum temp, mult, result;
2443 for (i = 0; ; ++i) {
2446 if (val[i] != '.' && val[i] != '0')
2450 bc_num_init_DEF_SIZE(&temp);
2451 bc_num_init_DEF_SIZE(&mult);
2455 if (c == '\0') goto int_err;
2456 if (c == '.') break;
2458 v = (unsigned long) (c <= '9' ? c - '0' : c - 'A' + 10);
2460 s = bc_num_mul(n, base, &mult, 0);
2461 if (s) goto int_err;
2462 bc_num_ulong2num(&temp, v);
2463 s = bc_num_add(&mult, &temp, n, 0);
2464 if (s) goto int_err;
2467 bc_num_init(&result, base->len);
2468 //bc_num_zero(&result); - already is
2474 if (c == '\0') break;
2477 v = (unsigned long) (c <= '9' ? c - '0' : c - 'A' + 10);
2479 s = bc_num_mul(&result, base, &result, 0);
2481 bc_num_ulong2num(&temp, v);
2482 s = bc_num_add(&result, &temp, &result, 0);
2484 s = bc_num_mul(&mult, base, &mult, 0);
2488 s = bc_num_div(&result, &mult, &result, digits);
2490 s = bc_num_add(n, &result, n, digits);
2494 if (n->rdx < digits) bc_num_extend(n, digits - n->rdx);
2499 bc_num_free(&result);
2505 static BcStatus bc_num_parse(BcNum *n, const char *val, BcNum *base,
2508 if (!bc_num_strValid(val, base_t))
2509 return bc_error("bad number string");
2512 while (*val == '0') val++;
2515 bc_num_parseDecimal(n, val);
2517 bc_num_parseBase(n, val, base);
2519 return BC_STATUS_SUCCESS;
2522 static BcStatus bc_num_print(BcNum *n, bool newline)
2524 BcStatus s = BC_STATUS_SUCCESS;
2526 bc_num_printNewline();
2532 else if (G.prog.ob_t == 10)
2533 bc_num_printDecimal(n);
2535 s = bc_num_printBase(n);
2545 static BcStatus bc_num_add(BcNum *a, BcNum *b, BcNum *c, size_t scale)
2547 BcNumBinaryOp op = (!a->neg == !b->neg) ? bc_num_a : bc_num_s;
2549 return bc_num_binary(a, b, c, false, op, BC_NUM_AREQ(a, b));
2552 static BcStatus bc_num_sub(BcNum *a, BcNum *b, BcNum *c, size_t scale)
2554 BcNumBinaryOp op = (!a->neg == !b->neg) ? bc_num_s : bc_num_a;
2556 return bc_num_binary(a, b, c, true, op, BC_NUM_AREQ(a, b));
2559 static BcStatus bc_num_mul(BcNum *a, BcNum *b, BcNum *c, size_t scale)
2561 size_t req = BC_NUM_MREQ(a, b, scale);
2562 return bc_num_binary(a, b, c, scale, bc_num_m, req);
2565 static BcStatus bc_num_div(BcNum *a, BcNum *b, BcNum *c, size_t scale)
2567 size_t req = BC_NUM_MREQ(a, b, scale);
2568 return bc_num_binary(a, b, c, scale, bc_num_d, req);
2571 static BcStatus bc_num_mod(BcNum *a, BcNum *b, BcNum *c, size_t scale)
2573 size_t req = BC_NUM_MREQ(a, b, scale);
2574 return bc_num_binary(a, b, c, scale, bc_num_rem, req);
2577 static BcStatus bc_num_pow(BcNum *a, BcNum *b, BcNum *c, size_t scale)
2579 return bc_num_binary(a, b, c, scale, bc_num_p, a->len * b->len + 1);
2582 static BcStatus bc_num_sqrt(BcNum *a, BcNum *restrict b, size_t scale)
2585 BcNum num1, num2, half, f, fprime, *x0, *x1, *temp;
2586 size_t pow, len, digs, digs1, resrdx, req, times = 0;
2587 ssize_t cmp = 1, cmp1 = SSIZE_MAX, cmp2 = SSIZE_MAX;
2589 req = BC_MAX(scale, a->rdx) + ((BC_NUM_INT(a) + 1) >> 1) + 1;
2590 bc_num_expand(b, req);
2593 bc_num_setToZero(b, scale);
2594 return BC_STATUS_SUCCESS;
2597 return bc_error("negative number");
2598 else if (BC_NUM_ONE(a)) {
2600 bc_num_extend(b, scale);
2601 return BC_STATUS_SUCCESS;
2604 scale = BC_MAX(scale, a->rdx) + 1;
2605 len = a->len + scale;
2607 bc_num_init(&num1, len);
2608 bc_num_init(&num2, len);
2609 bc_num_init_DEF_SIZE(&half);
2615 bc_num_init(&f, len);
2616 bc_num_init(&fprime, len);
2622 pow = BC_NUM_INT(a);
2631 pow -= 2 - (pow & 1);
2633 bc_num_extend(x0, pow);
2635 // Make sure to move the radix back.
2639 x0->rdx = digs = digs1 = 0;
2641 len = BC_NUM_INT(x0) + resrdx - 1;
2643 while (cmp != 0 || digs < len) {
2645 s = bc_num_div(a, x0, &f, resrdx);
2647 s = bc_num_add(x0, &f, &fprime, resrdx);
2649 s = bc_num_mul(&fprime, &half, x1, resrdx);
2652 cmp = bc_num_cmp(x1, x0);
2653 digs = x1->len - (unsigned long long) llabs(cmp);
2655 if (cmp == cmp2 && digs == digs1)
2660 resrdx += times > 4;
2673 if (b->rdx > scale) bc_num_truncate(b, b->rdx - scale);
2676 bc_num_free(&fprime);
2684 static BcStatus bc_num_divmod(BcNum *a, BcNum *b, BcNum *c, BcNum *d,
2690 size_t ts = BC_MAX(scale + b->rdx, a->rdx), len = BC_NUM_MREQ(a, b, ts);
2693 memcpy(&num2, c, sizeof(BcNum));
2695 bc_num_init(c, len);
2700 bc_num_expand(c, len);
2703 s = bc_num_r(ptr_a, b, c, d, scale, ts);
2705 if (init) bc_num_free(&num2);
2711 static BcStatus bc_num_modexp(BcNum *a, BcNum *b, BcNum *c, BcNum *restrict d)
2714 BcNum base, exp, two, temp;
2717 return bc_error("divide by zero");
2718 if (a->rdx || b->rdx || c->rdx)
2719 return bc_error("non integer number");
2721 return bc_error("negative number");
2723 bc_num_expand(d, c->len);
2724 bc_num_init(&base, c->len);
2725 bc_num_init(&exp, b->len);
2726 bc_num_init_DEF_SIZE(&two);
2727 bc_num_init(&temp, b->len);
2733 s = bc_num_rem(a, c, &base, 0);
2735 bc_num_copy(&exp, b);
2737 while (exp.len != 0) {
2739 s = bc_num_divmod(&exp, &two, &exp, &temp, 0);
2742 if (BC_NUM_ONE(&temp)) {
2743 s = bc_num_mul(d, &base, &temp, 0);
2745 s = bc_num_rem(&temp, c, d, 0);
2749 s = bc_num_mul(&base, &base, &temp, 0);
2751 s = bc_num_rem(&temp, c, &base, 0);
2765 static BcStatus bc_func_insert(BcFunc *f, char *name, bool var)
2770 for (i = 0; i < f->autos.len; ++i) {
2771 if (strcmp(name, ((BcId *) bc_vec_item(&f->autos, i))->name) == 0)
2772 return bc_error("function parameter or auto var has the same name as another");
2778 bc_vec_push(&f->autos, &a);
2780 return BC_STATUS_SUCCESS;
2784 static void bc_func_init(BcFunc *f)
2786 bc_char_vec_init(&f->code);
2787 bc_vec_init(&f->autos, sizeof(BcId), bc_id_free);
2788 bc_vec_init(&f->labels, sizeof(size_t), NULL);
2792 static void bc_func_free(void *func)
2794 BcFunc *f = (BcFunc *) func;
2795 bc_vec_free(&f->code);
2796 bc_vec_free(&f->autos);
2797 bc_vec_free(&f->labels);
2800 static void bc_array_expand(BcVec *a, size_t len);
2802 static void bc_array_init(BcVec *a, bool nums)
2805 bc_vec_init(a, sizeof(BcNum), bc_num_free);
2807 bc_vec_init(a, sizeof(BcVec), bc_vec_free);
2808 bc_array_expand(a, 1);
2811 static void bc_array_expand(BcVec *a, size_t len)
2815 if (a->size == sizeof(BcNum) && a->dtor == bc_num_free) {
2816 while (len > a->len) {
2817 bc_num_init_DEF_SIZE(&data.n);
2818 bc_vec_push(a, &data.n);
2822 while (len > a->len) {
2823 bc_array_init(&data.v, true);
2824 bc_vec_push(a, &data.v);
2829 static void bc_array_copy(BcVec *d, const BcVec *s)
2834 bc_vec_expand(d, s->cap);
2837 for (i = 0; i < s->len; ++i) {
2838 BcNum *dnum = bc_vec_item(d, i), *snum = bc_vec_item(s, i);
2839 bc_num_init(dnum, snum->len);
2840 bc_num_copy(dnum, snum);
2844 static void bc_string_free(void *string)
2846 free(*((char **) string));
2850 static void bc_result_copy(BcResult *d, BcResult *src)
2856 case BC_RESULT_TEMP:
2857 case BC_RESULT_IBASE:
2858 case BC_RESULT_SCALE:
2859 case BC_RESULT_OBASE:
2861 bc_num_init(&d->d.n, src->d.n.len);
2862 bc_num_copy(&d->d.n, &src->d.n);
2867 case BC_RESULT_ARRAY:
2868 case BC_RESULT_ARRAY_ELEM:
2870 d->d.id.name = xstrdup(src->d.id.name);
2874 case BC_RESULT_CONSTANT:
2875 case BC_RESULT_LAST:
2879 memcpy(&d->d.n, &src->d.n, sizeof(BcNum));
2886 static void bc_result_free(void *result)
2888 BcResult *r = (BcResult *) result;
2892 case BC_RESULT_TEMP:
2893 case BC_RESULT_IBASE:
2894 case BC_RESULT_SCALE:
2895 case BC_RESULT_OBASE:
2897 bc_num_free(&r->d.n);
2902 case BC_RESULT_ARRAY:
2903 case BC_RESULT_ARRAY_ELEM:
2917 static void bc_lex_lineComment(BcLex *l)
2919 l->t.t = BC_LEX_WHITESPACE;
2920 while (l->i < l->len && l->buf[l->i++] != '\n');
2924 static void bc_lex_whitespace(BcLex *l)
2927 l->t.t = BC_LEX_WHITESPACE;
2928 for (c = l->buf[l->i]; c != '\n' && isspace(c); c = l->buf[++l->i]);
2931 static BcStatus bc_lex_number(BcLex *l, char start)
2933 const char *buf = l->buf + l->i;
2934 size_t len, hits = 0, bslashes = 0, i = 0, j;
2936 bool last_pt, pt = start == '.';
2939 l->t.t = BC_LEX_NUMBER;
2941 while (c != 0 && (isdigit(c) || (c >= 'A' && c <= 'F') ||
2942 (c == '.' && !pt) || (c == '\\' && buf[i + 1] == '\n')))
2956 len = i + !last_pt - bslashes * 2;
2957 // This check makes sense only if size_t is (much) larger than BC_MAX_NUM.
2958 if (SIZE_MAX > (BC_MAX_NUM | 0xff)) {
2959 if (len > BC_MAX_NUM)
2960 return bc_error("number too long: must be [1,"BC_MAX_NUM_STR"]");
2963 bc_vec_pop_all(&l->t.v);
2964 bc_vec_expand(&l->t.v, len + 1);
2965 bc_vec_push(&l->t.v, &start);
2967 for (buf -= 1, j = 1; j < len + hits * 2; ++j) {
2971 // If we have hit a backslash, skip it. We don't have
2972 // to check for a newline because it's guaranteed.
2973 if (hits < bslashes && c == '\\') {
2979 bc_vec_push(&l->t.v, &c);
2982 bc_vec_pushZeroByte(&l->t.v);
2985 return BC_STATUS_SUCCESS;
2988 static BcStatus bc_lex_name(BcLex *l)
2991 const char *buf = l->buf + l->i - 1;
2994 l->t.t = BC_LEX_NAME;
2996 while ((c >= 'a' && c <= 'z') || isdigit(c) || c == '_') c = buf[++i];
2998 // This check makes sense only if size_t is (much) larger than BC_MAX_STRING.
2999 if (SIZE_MAX > (BC_MAX_STRING | 0xff)) {
3000 if (i > BC_MAX_STRING)
3001 return bc_error("name too long: must be [1,"BC_MAX_STRING_STR"]");
3003 bc_vec_string(&l->t.v, i, buf);
3005 // Increment the index. We minus 1 because it has already been incremented.
3008 return BC_STATUS_SUCCESS;
3011 static void bc_lex_init(BcLex *l, BcLexNext next)
3014 bc_char_vec_init(&l->t.v);
3017 static void bc_lex_free(BcLex *l)
3019 bc_vec_free(&l->t.v);
3022 static void bc_lex_file(BcLex *l)
3024 G.err_line = l->line = 1;
3028 static BcStatus bc_lex_next(BcLex *l)
3033 if (l->t.last == BC_LEX_EOF) return bc_error("end of file");
3035 l->line += l->newline;
3036 G.err_line = l->line;
3037 l->t.t = BC_LEX_EOF;
3039 l->newline = (l->i == l->len);
3040 if (l->newline) return BC_STATUS_SUCCESS;
3042 // Loop until failure or we don't have whitespace. This
3043 // is so the parser doesn't get inundated with whitespace.
3046 } while (!s && l->t.t == BC_LEX_WHITESPACE);
3051 static BcStatus bc_lex_text(BcLex *l, const char *text)
3055 l->len = strlen(text);
3056 l->t.t = l->t.last = BC_LEX_INVALID;
3057 return bc_lex_next(l);
3061 static BcStatus bc_lex_identifier(BcLex *l)
3065 const char *buf = l->buf + l->i - 1;
3067 for (i = 0; i < ARRAY_SIZE(bc_lex_kws); ++i) {
3068 const char *keyword8 = bc_lex_kws[i].name8;
3070 while (buf[j] != '\0' && buf[j] == keyword8[j]) {
3072 if (j == 8) goto match;
3074 if (keyword8[j] != '\0')
3077 // buf starts with keyword bc_lex_kws[i]
3078 l->t.t = BC_LEX_KEY_1st_keyword + i;
3079 if (!bc_lex_kws_POSIX(i)) {
3080 s = bc_posix_error_fmt("%sthe '%.8s' keyword", "POSIX does not allow ", bc_lex_kws[i].name8);
3084 // We minus 1 because the index has already been incremented.
3086 return BC_STATUS_SUCCESS;
3092 if (l->t.v.len > 2) {
3095 // bc: POSIX only allows one character names; the following is bad: 'qwe=1
3097 unsigned len = strchrnul(buf, '\n') - buf;
3098 s = bc_posix_error_fmt("POSIX only allows one character names; the following is bad: '%.*s'", len, buf);
3104 static BcStatus bc_lex_string(BcLex *l)
3106 size_t len, nls = 0, i = l->i;
3109 l->t.t = BC_LEX_STR;
3111 for (c = l->buf[i]; c != 0 && c != '"'; c = l->buf[++i]) nls += (c == '\n');
3115 return bc_error("string end could not be found");
3119 // This check makes sense only if size_t is (much) larger than BC_MAX_STRING.
3120 if (SIZE_MAX > (BC_MAX_STRING | 0xff)) {
3121 if (len > BC_MAX_STRING)
3122 return bc_error("string too long: must be [1,"BC_MAX_STRING_STR"]");
3124 bc_vec_string(&l->t.v, len, l->buf + l->i);
3128 G.err_line = l->line;
3130 return BC_STATUS_SUCCESS;
3133 static void bc_lex_assign(BcLex *l, BcLexType with, BcLexType without)
3135 if (l->buf[l->i] == '=') {
3143 static BcStatus bc_lex_comment(BcLex *l)
3146 const char *buf = l->buf;
3148 l->t.t = BC_LEX_WHITESPACE;
3161 return bc_error("comment end could not be found");
3169 G.err_line = l->line;
3171 return BC_STATUS_SUCCESS;
3174 static BcStatus bc_lex_token(BcLex *l)
3176 BcStatus s = BC_STATUS_SUCCESS;
3177 char c = l->buf[l->i++], c2;
3179 // This is the workhorse of the lexer.
3186 l->t.t = !c ? BC_LEX_EOF : BC_LEX_NLINE;
3196 bc_lex_whitespace(l);
3202 bc_lex_assign(l, BC_LEX_OP_REL_NE, BC_LEX_OP_BOOL_NOT);
3204 if (l->t.t == BC_LEX_OP_BOOL_NOT) {
3205 s = bc_POSIX_does_not_allow_bool_ops_this_is_bad("!");
3214 s = bc_lex_string(l);
3220 s = bc_POSIX_does_not_allow("'#' script comments");
3223 bc_lex_lineComment(l);
3230 bc_lex_assign(l, BC_LEX_OP_ASSIGN_MODULUS, BC_LEX_OP_MODULUS);
3239 s = bc_POSIX_does_not_allow_bool_ops_this_is_bad("&&");
3243 l->t.t = BC_LEX_OP_BOOL_AND;
3246 l->t.t = BC_LEX_INVALID;
3247 s = bc_error_bad_character('&');
3256 l->t.t = (BcLexType)(c - '(' + BC_LEX_LPAREN);
3262 bc_lex_assign(l, BC_LEX_OP_ASSIGN_MULTIPLY, BC_LEX_OP_MULTIPLY);
3271 l->t.t = BC_LEX_OP_INC;
3274 bc_lex_assign(l, BC_LEX_OP_ASSIGN_PLUS, BC_LEX_OP_PLUS);
3280 l->t.t = BC_LEX_COMMA;
3289 l->t.t = BC_LEX_OP_DEC;
3292 bc_lex_assign(l, BC_LEX_OP_ASSIGN_MINUS, BC_LEX_OP_MINUS);
3298 if (isdigit(l->buf[l->i]))
3299 s = bc_lex_number(l, c);
3301 l->t.t = BC_LEX_KEY_LAST;
3302 s = bc_POSIX_does_not_allow("a period ('.') as a shortcut for the last result");
3311 s = bc_lex_comment(l);
3313 bc_lex_assign(l, BC_LEX_OP_ASSIGN_DIVIDE, BC_LEX_OP_DIVIDE);
3334 s = bc_lex_number(l, c);
3340 l->t.t = BC_LEX_SCOLON;
3346 bc_lex_assign(l, BC_LEX_OP_REL_LE, BC_LEX_OP_REL_LT);
3352 bc_lex_assign(l, BC_LEX_OP_REL_EQ, BC_LEX_OP_ASSIGN);
3358 bc_lex_assign(l, BC_LEX_OP_REL_GE, BC_LEX_OP_REL_GT);
3365 l->t.t = (BcLexType)(c - '[' + BC_LEX_LBRACKET);
3371 if (l->buf[l->i] == '\n') {
3372 l->t.t = BC_LEX_WHITESPACE;
3376 s = bc_error_bad_character(c);
3382 bc_lex_assign(l, BC_LEX_OP_ASSIGN_POWER, BC_LEX_OP_POWER);
3413 s = bc_lex_identifier(l);
3420 l->t.t = (BcLexType)(c - '{' + BC_LEX_LBRACE);
3429 s = bc_POSIX_does_not_allow_bool_ops_this_is_bad("||");
3433 l->t.t = BC_LEX_OP_BOOL_OR;
3436 l->t.t = BC_LEX_INVALID;
3437 s = bc_error_bad_character(c);
3445 l->t.t = BC_LEX_INVALID;
3446 s = bc_error_bad_character(c);
3456 static BcStatus dc_lex_register(BcLex *l)
3458 BcStatus s = BC_STATUS_SUCCESS;
3460 if (isspace(l->buf[l->i - 1])) {
3461 bc_lex_whitespace(l);
3464 s = bc_error("extended register");
3469 bc_vec_pop_all(&l->t.v);
3470 bc_vec_push(&l->t.v, &l->buf[l->i - 1]);
3471 bc_vec_pushZeroByte(&l->t.v);
3472 l->t.t = BC_LEX_NAME;
3478 static BcStatus dc_lex_string(BcLex *l)
3480 size_t depth = 1, nls = 0, i = l->i;
3483 l->t.t = BC_LEX_STR;
3484 bc_vec_pop_all(&l->t.v);
3486 for (c = l->buf[i]; c != 0 && depth; c = l->buf[++i]) {
3488 depth += (c == '[' && (i == l->i || l->buf[i - 1] != '\\'));
3489 depth -= (c == ']' && (i == l->i || l->buf[i - 1] != '\\'));
3492 if (depth) bc_vec_push(&l->t.v, &c);
3497 return bc_error("string end could not be found");
3500 bc_vec_pushZeroByte(&l->t.v);
3501 // This check makes sense only if size_t is (much) larger than BC_MAX_STRING.
3502 if (SIZE_MAX > (BC_MAX_STRING | 0xff)) {
3503 if (i - l->i > BC_MAX_STRING)
3504 return bc_error("string too long: must be [1,"BC_MAX_STRING_STR"]");
3509 G.err_line = l->line;
3511 return BC_STATUS_SUCCESS;
3514 static BcStatus dc_lex_token(BcLex *l)
3516 BcStatus s = BC_STATUS_SUCCESS;
3517 char c = l->buf[l->i++], c2;
3520 for (i = 0; i < ARRAY_SIZE(dc_lex_regs); ++i) {
3521 if (l->t.last == dc_lex_regs[i])
3522 return dc_lex_register(l);
3525 if (c >= '%' && c <= '~' &&
3526 (l->t.t = dc_lex_tokens[(c - '%')]) != BC_LEX_INVALID)
3531 // This is the workhorse of the lexer.
3536 l->t.t = BC_LEX_EOF;
3547 l->newline = (c == '\n');
3548 bc_lex_whitespace(l);
3557 l->t.t = BC_LEX_OP_REL_NE;
3559 l->t.t = BC_LEX_OP_REL_LE;
3561 l->t.t = BC_LEX_OP_REL_GE;
3563 return bc_error_bad_character(c);
3571 bc_lex_lineComment(l);
3577 if (isdigit(l->buf[l->i]))
3578 s = bc_lex_number(l, c);
3580 s = bc_error_bad_character(c);
3601 s = bc_lex_number(l, c);
3607 s = dc_lex_string(l);
3613 l->t.t = BC_LEX_INVALID;
3614 s = bc_error_bad_character(c);
3623 static void bc_program_addFunc(char *name, size_t *idx);
3625 static void bc_parse_addFunc(BcParse *p, char *name, size_t *idx)
3627 bc_program_addFunc(name, idx);
3628 p->func = bc_program_func(p->fidx);
3631 #define bc_parse_push(p, i) bc_vec_pushByte(&(p)->func->code, (char) (i))
3633 static void bc_parse_pushName(BcParse *p, char *name)
3635 size_t i = 0, len = strlen(name);
3637 for (; i < len; ++i) bc_parse_push(p, name[i]);
3638 bc_parse_push(p, BC_PARSE_STREND);
3643 static void bc_parse_pushIndex(BcParse *p, size_t idx)
3645 unsigned char amt, i, nums[sizeof(size_t)];
3647 for (amt = 0; idx; ++amt) {
3648 nums[amt] = (char) idx;
3649 idx = (idx & ((unsigned long) ~(UCHAR_MAX))) >> sizeof(char) * CHAR_BIT;
3652 bc_parse_push(p, amt);
3653 for (i = 0; i < amt; ++i) bc_parse_push(p, nums[i]);
3656 static void bc_parse_number(BcParse *p, BcInst *prev, size_t *nexs)
3658 char *num = xstrdup(p->l.t.v.v);
3659 size_t idx = G.prog.consts.len;
3661 bc_vec_push(&G.prog.consts, &num);
3663 bc_parse_push(p, BC_INST_NUM);
3664 bc_parse_pushIndex(p, idx);
3667 (*prev) = BC_INST_NUM;
3670 static BcStatus bc_parse_text(BcParse *p, const char *text)
3674 p->func = bc_program_func(p->fidx);
3676 if (!text[0] && !BC_PARSE_CAN_EXEC(p)) {
3677 p->l.t.t = BC_LEX_INVALID;
3680 if (!BC_PARSE_CAN_EXEC(p))
3681 return bc_error("file is not executable");
3684 return bc_lex_text(&p->l, text);
3687 // Called when parsing or execution detects a failure,
3688 // resets execution structures.
3689 static void bc_program_reset(void)
3694 bc_vec_npop(&G.prog.stack, G.prog.stack.len - 1);
3695 bc_vec_pop_all(&G.prog.results);
3697 f = bc_program_func(0);
3698 ip = bc_vec_top(&G.prog.stack);
3699 ip->idx = f->code.len;
3702 #define bc_parse_updateFunc(p, f) \
3703 ((p)->func = bc_program_func((p)->fidx = (f)))
3705 // Called when bc/dc_parse_parse() detects a failure,
3706 // resets parsing structures.
3707 static void bc_parse_reset(BcParse *p)
3709 if (p->fidx != BC_PROG_MAIN) {
3710 p->func->nparams = 0;
3711 bc_vec_pop_all(&p->func->code);
3712 bc_vec_pop_all(&p->func->autos);
3713 bc_vec_pop_all(&p->func->labels);
3715 bc_parse_updateFunc(p, BC_PROG_MAIN);
3719 p->l.t.t = BC_LEX_EOF;
3720 p->auto_part = (p->nbraces = 0);
3722 bc_vec_npop(&p->flags, p->flags.len - 1);
3723 bc_vec_pop_all(&p->exits);
3724 bc_vec_pop_all(&p->conds);
3725 bc_vec_pop_all(&p->ops);
3730 static void bc_parse_free(BcParse *p)
3732 bc_vec_free(&p->flags);
3733 bc_vec_free(&p->exits);
3734 bc_vec_free(&p->conds);
3735 bc_vec_free(&p->ops);
3739 static void bc_parse_create(BcParse *p, size_t func,
3740 BcParseParse parse, BcLexNext next)
3742 memset(p, 0, sizeof(BcParse));
3744 bc_lex_init(&p->l, next);
3745 bc_vec_init(&p->flags, sizeof(uint8_t), NULL);
3746 bc_vec_init(&p->exits, sizeof(BcInstPtr), NULL);
3747 bc_vec_init(&p->conds, sizeof(size_t), NULL);
3748 bc_vec_pushZeroByte(&p->flags);
3749 bc_vec_init(&p->ops, sizeof(BcLexType), NULL);
3752 // p->auto_part = p->nbraces = 0; - already is
3753 bc_parse_updateFunc(p, func);
3758 #define BC_PARSE_TOP_OP(p) (*((BcLexType *) bc_vec_top(&(p)->ops)))
3759 #define BC_PARSE_LEAF(p, rparen) \
3760 (((p) >= BC_INST_NUM && (p) <= BC_INST_SQRT) || (rparen) || \
3761 (p) == BC_INST_INC_POST || (p) == BC_INST_DEC_POST)
3763 // We can calculate the conversion between tokens and exprs by subtracting the
3764 // position of the first operator in the lex enum and adding the position of the
3765 // first in the expr enum. Note: This only works for binary operators.
3766 #define BC_PARSE_TOKEN_INST(t) ((char) ((t) -BC_LEX_NEG + BC_INST_NEG))
3768 static BcStatus bc_parse_else(BcParse *p);
3769 static BcStatus bc_parse_stmt(BcParse *p);
3770 static BcStatus bc_parse_expr(BcParse *p, uint8_t flags, BcParseNext next);
3771 static BcStatus bc_parse_expr_empty_ok(BcParse *p, uint8_t flags, BcParseNext next);
3773 static BcStatus bc_parse_operator(BcParse *p, BcLexType type, size_t start,
3774 size_t *nexprs, bool next)
3776 BcStatus s = BC_STATUS_SUCCESS;
3778 char l, r = bc_parse_op_PREC(type - BC_LEX_OP_INC);
3779 bool left = bc_parse_op_LEFT(type - BC_LEX_OP_INC);
3781 while (p->ops.len > start) {
3783 t = BC_PARSE_TOP_OP(p);
3784 if (t == BC_LEX_LPAREN) break;
3786 l = bc_parse_op_PREC(t - BC_LEX_OP_INC);
3787 if (l >= r && (l != r || !left)) break;
3789 bc_parse_push(p, BC_PARSE_TOKEN_INST(t));
3790 bc_vec_pop(&p->ops);
3791 *nexprs -= t != BC_LEX_OP_BOOL_NOT && t != BC_LEX_NEG;
3794 bc_vec_push(&p->ops, &type);
3795 if (next) s = bc_lex_next(&p->l);
3800 static BcStatus bc_parse_rightParen(BcParse *p, size_t ops_bgn, size_t *nexs)
3804 if (p->ops.len <= ops_bgn)
3805 return bc_error_bad_expression();
3806 top = BC_PARSE_TOP_OP(p);
3808 while (top != BC_LEX_LPAREN) {
3810 bc_parse_push(p, BC_PARSE_TOKEN_INST(top));
3812 bc_vec_pop(&p->ops);
3813 *nexs -= top != BC_LEX_OP_BOOL_NOT && top != BC_LEX_NEG;
3815 if (p->ops.len <= ops_bgn)
3816 return bc_error_bad_expression();
3817 top = BC_PARSE_TOP_OP(p);
3820 bc_vec_pop(&p->ops);
3822 return bc_lex_next(&p->l);
3825 static BcStatus bc_parse_params(BcParse *p, uint8_t flags)
3831 s = bc_lex_next(&p->l);
3834 for (nparams = 0; p->l.t.t != BC_LEX_RPAREN; ++nparams) {
3836 flags = (flags & ~(BC_PARSE_PRINT | BC_PARSE_REL)) | BC_PARSE_ARRAY;
3837 s = bc_parse_expr(p, flags, bc_parse_next_param);
3840 comma = p->l.t.t == BC_LEX_COMMA;
3842 s = bc_lex_next(&p->l);
3847 if (comma) return bc_error_bad_token();
3848 bc_parse_push(p, BC_INST_CALL);
3849 bc_parse_pushIndex(p, nparams);
3851 return BC_STATUS_SUCCESS;
3854 static BcStatus bc_parse_call(BcParse *p, char *name, uint8_t flags)
3857 BcId entry, *entry_ptr;
3862 s = bc_parse_params(p, flags);
3865 if (p->l.t.t != BC_LEX_RPAREN) {
3866 s = bc_error_bad_token();
3870 idx = bc_map_index(&G.prog.fn_map, &entry);
3872 if (idx == BC_VEC_INVALID_IDX) {
3873 name = xstrdup(entry.name);
3874 bc_parse_addFunc(p, name, &idx);
3875 idx = bc_map_index(&G.prog.fn_map, &entry);
3881 entry_ptr = bc_vec_item(&G.prog.fn_map, idx);
3882 bc_parse_pushIndex(p, entry_ptr->idx);
3884 return bc_lex_next(&p->l);
3891 static BcStatus bc_parse_name(BcParse *p, BcInst *type, uint8_t flags)
3896 name = xstrdup(p->l.t.v.v);
3897 s = bc_lex_next(&p->l);
3900 if (p->l.t.t == BC_LEX_LBRACKET) {
3902 s = bc_lex_next(&p->l);
3905 if (p->l.t.t == BC_LEX_RBRACKET) {
3907 if (!(flags & BC_PARSE_ARRAY)) {
3908 s = bc_error_bad_expression();
3912 *type = BC_INST_ARRAY;
3916 *type = BC_INST_ARRAY_ELEM;
3918 flags &= ~(BC_PARSE_PRINT | BC_PARSE_REL);
3919 s = bc_parse_expr(p, flags, bc_parse_next_elem);
3923 s = bc_lex_next(&p->l);
3925 bc_parse_push(p, *type);
3926 bc_parse_pushName(p, name);
3928 else if (p->l.t.t == BC_LEX_LPAREN) {
3930 if (flags & BC_PARSE_NOCALL) {
3931 s = bc_error_bad_token();
3935 *type = BC_INST_CALL;
3936 s = bc_parse_call(p, name, flags);
3939 *type = BC_INST_VAR;
3940 bc_parse_push(p, BC_INST_VAR);
3941 bc_parse_pushName(p, name);
3951 static BcStatus bc_parse_read(BcParse *p)
3955 s = bc_lex_next(&p->l);
3957 if (p->l.t.t != BC_LEX_LPAREN) return bc_error_bad_token();
3959 s = bc_lex_next(&p->l);
3961 if (p->l.t.t != BC_LEX_RPAREN) return bc_error_bad_token();
3963 bc_parse_push(p, BC_INST_READ);
3965 return bc_lex_next(&p->l);
3968 static BcStatus bc_parse_builtin(BcParse *p, BcLexType type, uint8_t flags,
3973 s = bc_lex_next(&p->l);
3975 if (p->l.t.t != BC_LEX_LPAREN) return bc_error_bad_token();
3977 flags = (flags & ~(BC_PARSE_PRINT | BC_PARSE_REL)) | BC_PARSE_ARRAY;
3979 s = bc_lex_next(&p->l);
3982 s = bc_parse_expr(p, flags, bc_parse_next_rel);
3985 if (p->l.t.t != BC_LEX_RPAREN) return bc_error_bad_token();
3987 *prev = (type == BC_LEX_KEY_LENGTH) ? BC_INST_LENGTH : BC_INST_SQRT;
3988 bc_parse_push(p, *prev);
3990 return bc_lex_next(&p->l);
3993 static BcStatus bc_parse_scale(BcParse *p, BcInst *type, uint8_t flags)
3997 s = bc_lex_next(&p->l);
4000 if (p->l.t.t != BC_LEX_LPAREN) {
4001 *type = BC_INST_SCALE;
4002 bc_parse_push(p, BC_INST_SCALE);
4003 return BC_STATUS_SUCCESS;
4006 *type = BC_INST_SCALE_FUNC;
4007 flags &= ~(BC_PARSE_PRINT | BC_PARSE_REL);
4009 s = bc_lex_next(&p->l);
4012 s = bc_parse_expr(p, flags, bc_parse_next_rel);
4014 if (p->l.t.t != BC_LEX_RPAREN) return bc_error_bad_token();
4015 bc_parse_push(p, BC_INST_SCALE_FUNC);
4017 return bc_lex_next(&p->l);
4020 static BcStatus bc_parse_incdec(BcParse *p, BcInst *prev, bool *paren_expr,
4021 size_t *nexprs, uint8_t flags)
4026 BcInst etype = *prev;
4028 if (etype == BC_INST_VAR || etype == BC_INST_ARRAY_ELEM ||
4029 etype == BC_INST_SCALE || etype == BC_INST_LAST ||
4030 etype == BC_INST_IBASE || etype == BC_INST_OBASE)
4032 *prev = inst = BC_INST_INC_POST + (p->l.t.t != BC_LEX_OP_INC);
4033 bc_parse_push(p, inst);
4034 s = bc_lex_next(&p->l);
4038 *prev = inst = BC_INST_INC_PRE + (p->l.t.t != BC_LEX_OP_INC);
4041 s = bc_lex_next(&p->l);
4045 // Because we parse the next part of the expression
4046 // right here, we need to increment this.
4047 *nexprs = *nexprs + 1;
4053 s = bc_parse_name(p, prev, flags | BC_PARSE_NOCALL);
4057 case BC_LEX_KEY_IBASE:
4058 case BC_LEX_KEY_LAST:
4059 case BC_LEX_KEY_OBASE:
4061 bc_parse_push(p, type - BC_LEX_KEY_IBASE + BC_INST_IBASE);
4062 s = bc_lex_next(&p->l);
4066 case BC_LEX_KEY_SCALE:
4068 s = bc_lex_next(&p->l);
4070 if (p->l.t.t == BC_LEX_LPAREN)
4071 s = bc_error_bad_token();
4073 bc_parse_push(p, BC_INST_SCALE);
4079 s = bc_error_bad_token();
4084 if (!s) bc_parse_push(p, inst);
4090 static BcStatus bc_parse_minus(BcParse *p, BcInst *prev, size_t ops_bgn,
4091 bool rparen, size_t *nexprs)
4095 BcInst etype = *prev;
4097 s = bc_lex_next(&p->l);
4100 type = rparen || etype == BC_INST_INC_POST || etype == BC_INST_DEC_POST ||
4101 (etype >= BC_INST_NUM && etype <= BC_INST_SQRT) ?
4104 *prev = BC_PARSE_TOKEN_INST(type);
4106 // We can just push onto the op stack because this is the largest
4107 // precedence operator that gets pushed. Inc/dec does not.
4108 if (type != BC_LEX_OP_MINUS)
4109 bc_vec_push(&p->ops, &type);
4111 s = bc_parse_operator(p, type, ops_bgn, nexprs, false);
4116 static BcStatus bc_parse_string(BcParse *p, char inst)
4118 char *str = xstrdup(p->l.t.v.v);
4120 bc_parse_push(p, BC_INST_STR);
4121 bc_parse_pushIndex(p, G.prog.strs.len);
4122 bc_vec_push(&G.prog.strs, &str);
4123 bc_parse_push(p, inst);
4125 return bc_lex_next(&p->l);
4128 static BcStatus bc_parse_print(BcParse *p)
4134 s = bc_lex_next(&p->l);
4139 if (type == BC_LEX_SCOLON || type == BC_LEX_NLINE)
4140 return bc_error("bad print statement");
4143 while (type != BC_LEX_SCOLON && type != BC_LEX_NLINE) {
4145 if (type == BC_LEX_STR) {
4146 s = bc_parse_string(p, BC_INST_PRINT_POP);
4149 s = bc_parse_expr(p, 0, bc_parse_next_print);
4151 bc_parse_push(p, BC_INST_PRINT_POP);
4154 comma = p->l.t.t == BC_LEX_COMMA;
4156 s = bc_lex_next(&p->l);
4162 if (comma) return bc_error_bad_token();
4164 return bc_lex_next(&p->l);
4167 static BcStatus bc_parse_return(BcParse *p)
4173 if (!BC_PARSE_FUNC(p)) return bc_error_bad_token();
4175 s = bc_lex_next(&p->l);
4179 paren = t == BC_LEX_LPAREN;
4181 if (t == BC_LEX_NLINE || t == BC_LEX_SCOLON)
4182 bc_parse_push(p, BC_INST_RET0);
4185 s = bc_parse_expr_empty_ok(p, 0, bc_parse_next_expr);
4186 if (s == BC_STATUS_PARSE_EMPTY_EXP) {
4187 bc_parse_push(p, BC_INST_RET0);
4188 s = bc_lex_next(&p->l);
4192 if (!paren || p->l.t.last != BC_LEX_RPAREN) {
4193 s = bc_POSIX_requires("parentheses around return expressions");
4197 bc_parse_push(p, BC_INST_RET);
4203 static BcStatus bc_parse_endBody(BcParse *p, bool brace)
4205 BcStatus s = BC_STATUS_SUCCESS;
4207 if (p->flags.len <= 1 || (brace && p->nbraces == 0))
4208 return bc_error_bad_token();
4212 if (p->l.t.t == BC_LEX_RBRACE) {
4213 if (!p->nbraces) return bc_error_bad_token();
4215 s = bc_lex_next(&p->l);
4219 return bc_error_bad_token();
4222 if (BC_PARSE_IF(p)) {
4226 while (p->l.t.t == BC_LEX_NLINE) {
4227 s = bc_lex_next(&p->l);
4231 bc_vec_pop(&p->flags);
4233 flag_ptr = BC_PARSE_TOP_FLAG_PTR(p);
4234 *flag_ptr = (*flag_ptr | BC_PARSE_FLAG_IF_END);
4236 if (p->l.t.t == BC_LEX_KEY_ELSE) s = bc_parse_else(p);
4238 else if (BC_PARSE_ELSE(p)) {
4243 bc_vec_pop(&p->flags);
4245 ip = bc_vec_top(&p->exits);
4246 label = bc_vec_item(&p->func->labels, ip->idx);
4247 *label = p->func->code.len;
4249 bc_vec_pop(&p->exits);
4251 else if (BC_PARSE_FUNC_INNER(p)) {
4252 bc_parse_push(p, BC_INST_RET0);
4253 bc_parse_updateFunc(p, BC_PROG_MAIN);
4254 bc_vec_pop(&p->flags);
4258 BcInstPtr *ip = bc_vec_top(&p->exits);
4259 size_t *label = bc_vec_top(&p->conds);
4261 bc_parse_push(p, BC_INST_JUMP);
4262 bc_parse_pushIndex(p, *label);
4264 label = bc_vec_item(&p->func->labels, ip->idx);
4265 *label = p->func->code.len;
4267 bc_vec_pop(&p->flags);
4268 bc_vec_pop(&p->exits);
4269 bc_vec_pop(&p->conds);
4275 static void bc_parse_startBody(BcParse *p, uint8_t flags)
4277 uint8_t *flag_ptr = BC_PARSE_TOP_FLAG_PTR(p);
4278 flags |= (*flag_ptr & (BC_PARSE_FLAG_FUNC | BC_PARSE_FLAG_LOOP));
4279 flags |= BC_PARSE_FLAG_BODY;
4280 bc_vec_push(&p->flags, &flags);
4283 static void bc_parse_noElse(BcParse *p)
4287 uint8_t *flag_ptr = BC_PARSE_TOP_FLAG_PTR(p);
4289 *flag_ptr = (*flag_ptr & ~(BC_PARSE_FLAG_IF_END));
4291 ip = bc_vec_top(&p->exits);
4292 label = bc_vec_item(&p->func->labels, ip->idx);
4293 *label = p->func->code.len;
4295 bc_vec_pop(&p->exits);
4298 static BcStatus bc_parse_if(BcParse *p)
4303 s = bc_lex_next(&p->l);
4305 if (p->l.t.t != BC_LEX_LPAREN) return bc_error_bad_token();
4307 s = bc_lex_next(&p->l);
4309 s = bc_parse_expr(p, BC_PARSE_REL, bc_parse_next_rel);
4311 if (p->l.t.t != BC_LEX_RPAREN) return bc_error_bad_token();
4313 s = bc_lex_next(&p->l);
4315 bc_parse_push(p, BC_INST_JUMP_ZERO);
4317 ip.idx = p->func->labels.len;
4318 ip.func = ip.len = 0;
4320 bc_parse_pushIndex(p, ip.idx);
4321 bc_vec_push(&p->exits, &ip);
4322 bc_vec_push(&p->func->labels, &ip.idx);
4323 bc_parse_startBody(p, BC_PARSE_FLAG_IF);
4325 return BC_STATUS_SUCCESS;
4328 static BcStatus bc_parse_else(BcParse *p)
4332 if (!BC_PARSE_IF_END(p)) return bc_error_bad_token();
4334 ip.idx = p->func->labels.len;
4335 ip.func = ip.len = 0;
4337 bc_parse_push(p, BC_INST_JUMP);
4338 bc_parse_pushIndex(p, ip.idx);
4342 bc_vec_push(&p->exits, &ip);
4343 bc_vec_push(&p->func->labels, &ip.idx);
4344 bc_parse_startBody(p, BC_PARSE_FLAG_ELSE);
4346 return bc_lex_next(&p->l);
4349 static BcStatus bc_parse_while(BcParse *p)
4354 s = bc_lex_next(&p->l);
4356 if (p->l.t.t != BC_LEX_LPAREN) return bc_error_bad_token();
4357 s = bc_lex_next(&p->l);
4360 ip.idx = p->func->labels.len;
4362 bc_vec_push(&p->func->labels, &p->func->code.len);
4363 bc_vec_push(&p->conds, &ip.idx);
4365 ip.idx = p->func->labels.len;
4369 bc_vec_push(&p->exits, &ip);
4370 bc_vec_push(&p->func->labels, &ip.idx);
4372 s = bc_parse_expr(p, BC_PARSE_REL, bc_parse_next_rel);
4374 if (p->l.t.t != BC_LEX_RPAREN) return bc_error_bad_token();
4375 s = bc_lex_next(&p->l);
4378 bc_parse_push(p, BC_INST_JUMP_ZERO);
4379 bc_parse_pushIndex(p, ip.idx);
4380 bc_parse_startBody(p, BC_PARSE_FLAG_LOOP | BC_PARSE_FLAG_LOOP_INNER);
4382 return BC_STATUS_SUCCESS;
4385 static BcStatus bc_parse_for(BcParse *p)
4389 size_t cond_idx, exit_idx, body_idx, update_idx;
4391 s = bc_lex_next(&p->l);
4393 if (p->l.t.t != BC_LEX_LPAREN) return bc_error_bad_token();
4394 s = bc_lex_next(&p->l);
4397 if (p->l.t.t != BC_LEX_SCOLON)
4398 s = bc_parse_expr(p, 0, bc_parse_next_for);
4400 s = bc_POSIX_does_not_allow_empty_X_expression_in_for("init");
4403 if (p->l.t.t != BC_LEX_SCOLON) return bc_error_bad_token();
4404 s = bc_lex_next(&p->l);
4407 cond_idx = p->func->labels.len;
4408 update_idx = cond_idx + 1;
4409 body_idx = update_idx + 1;
4410 exit_idx = body_idx + 1;
4412 bc_vec_push(&p->func->labels, &p->func->code.len);
4414 if (p->l.t.t != BC_LEX_SCOLON)
4415 s = bc_parse_expr(p, BC_PARSE_REL, bc_parse_next_for);
4417 s = bc_POSIX_does_not_allow_empty_X_expression_in_for("condition");
4420 if (p->l.t.t != BC_LEX_SCOLON) return bc_error_bad_token();
4422 s = bc_lex_next(&p->l);
4425 bc_parse_push(p, BC_INST_JUMP_ZERO);
4426 bc_parse_pushIndex(p, exit_idx);
4427 bc_parse_push(p, BC_INST_JUMP);
4428 bc_parse_pushIndex(p, body_idx);
4430 ip.idx = p->func->labels.len;
4432 bc_vec_push(&p->conds, &update_idx);
4433 bc_vec_push(&p->func->labels, &p->func->code.len);
4435 if (p->l.t.t != BC_LEX_RPAREN)
4436 s = bc_parse_expr(p, 0, bc_parse_next_rel);
4438 s = bc_POSIX_does_not_allow_empty_X_expression_in_for("update");
4442 if (p->l.t.t != BC_LEX_RPAREN) return bc_error_bad_token();
4443 bc_parse_push(p, BC_INST_JUMP);
4444 bc_parse_pushIndex(p, cond_idx);
4445 bc_vec_push(&p->func->labels, &p->func->code.len);
4451 bc_vec_push(&p->exits, &ip);
4452 bc_vec_push(&p->func->labels, &ip.idx);
4454 bc_parse_startBody(p, BC_PARSE_FLAG_LOOP | BC_PARSE_FLAG_LOOP_INNER);
4456 return BC_STATUS_SUCCESS;
4459 static BcStatus bc_parse_loopExit(BcParse *p, BcLexType type)
4465 if (!BC_PARSE_LOOP(p)) return bc_error_bad_token();
4467 if (type == BC_LEX_KEY_BREAK) {
4469 if (p->exits.len == 0) return bc_error_bad_token();
4471 i = p->exits.len - 1;
4472 ip = bc_vec_item(&p->exits, i);
4474 while (!ip->func && i < p->exits.len) ip = bc_vec_item(&p->exits, i--);
4475 if (i >= p->exits.len && !ip->func) return bc_error_bad_token();
4480 i = *((size_t *) bc_vec_top(&p->conds));
4482 bc_parse_push(p, BC_INST_JUMP);
4483 bc_parse_pushIndex(p, i);
4485 s = bc_lex_next(&p->l);
4488 if (p->l.t.t != BC_LEX_SCOLON && p->l.t.t != BC_LEX_NLINE)
4489 return bc_error_bad_token();
4491 return bc_lex_next(&p->l);
4494 static BcStatus bc_parse_func(BcParse *p)
4497 bool var, comma = false;
4501 s = bc_lex_next(&p->l);
4503 if (p->l.t.t != BC_LEX_NAME)
4504 return bc_error("bad function definition");
4506 name = xstrdup(p->l.t.v.v);
4507 bc_parse_addFunc(p, name, &p->fidx);
4509 s = bc_lex_next(&p->l);
4511 if (p->l.t.t != BC_LEX_LPAREN)
4512 return bc_error("bad function definition");
4513 s = bc_lex_next(&p->l);
4516 while (p->l.t.t != BC_LEX_RPAREN) {
4518 if (p->l.t.t != BC_LEX_NAME)
4519 return bc_error("bad function definition");
4523 name = xstrdup(p->l.t.v.v);
4524 s = bc_lex_next(&p->l);
4527 var = p->l.t.t != BC_LEX_LBRACKET;
4531 s = bc_lex_next(&p->l);
4534 if (p->l.t.t != BC_LEX_RBRACKET) {
4535 s = bc_error("bad function definition");
4539 s = bc_lex_next(&p->l);
4543 comma = p->l.t.t == BC_LEX_COMMA;
4545 s = bc_lex_next(&p->l);
4549 s = bc_func_insert(p->func, name, var);
4553 if (comma) return bc_error("bad function definition");
4555 flags = BC_PARSE_FLAG_FUNC | BC_PARSE_FLAG_FUNC_INNER | BC_PARSE_FLAG_BODY;
4556 bc_parse_startBody(p, flags);
4558 s = bc_lex_next(&p->l);
4561 if (p->l.t.t != BC_LEX_LBRACE)
4562 s = bc_POSIX_requires("the left brace be on the same line as the function header");
4571 static BcStatus bc_parse_auto(BcParse *p)
4574 bool comma, var, one;
4577 if (!p->auto_part) return bc_error_bad_token();
4578 s = bc_lex_next(&p->l);
4581 p->auto_part = comma = false;
4582 one = p->l.t.t == BC_LEX_NAME;
4584 while (p->l.t.t == BC_LEX_NAME) {
4586 name = xstrdup(p->l.t.v.v);
4587 s = bc_lex_next(&p->l);
4590 var = p->l.t.t != BC_LEX_LBRACKET;
4593 s = bc_lex_next(&p->l);
4596 if (p->l.t.t != BC_LEX_RBRACKET) {
4597 s = bc_error("bad function definition");
4601 s = bc_lex_next(&p->l);
4605 comma = p->l.t.t == BC_LEX_COMMA;
4607 s = bc_lex_next(&p->l);
4611 s = bc_func_insert(p->func, name, var);
4615 if (comma) return bc_error("bad function definition");
4616 if (!one) return bc_error("no auto variable found");
4618 if (p->l.t.t != BC_LEX_NLINE && p->l.t.t != BC_LEX_SCOLON)
4619 return bc_error_bad_token();
4621 return bc_lex_next(&p->l);
4628 static BcStatus bc_parse_body(BcParse *p, bool brace)
4630 BcStatus s = BC_STATUS_SUCCESS;
4631 uint8_t *flag_ptr = bc_vec_top(&p->flags);
4633 *flag_ptr &= ~(BC_PARSE_FLAG_BODY);
4635 if (*flag_ptr & BC_PARSE_FLAG_FUNC_INNER) {
4637 if (!brace) return bc_error_bad_token();
4638 p->auto_part = p->l.t.t != BC_LEX_KEY_AUTO;
4640 if (!p->auto_part) {
4641 s = bc_parse_auto(p);
4645 if (p->l.t.t == BC_LEX_NLINE) s = bc_lex_next(&p->l);
4648 s = bc_parse_stmt(p);
4649 if (!s && !brace) s = bc_parse_endBody(p, false);
4655 static BcStatus bc_parse_stmt(BcParse *p)
4657 BcStatus s = BC_STATUS_SUCCESS;
4663 return bc_lex_next(&p->l);
4666 case BC_LEX_KEY_ELSE:
4668 p->auto_part = false;
4674 if (!BC_PARSE_BODY(p)) return bc_error_bad_token();
4677 s = bc_lex_next(&p->l);
4680 return bc_parse_body(p, true);
4683 case BC_LEX_KEY_AUTO:
4685 return bc_parse_auto(p);
4690 p->auto_part = false;
4692 if (BC_PARSE_IF_END(p)) {
4694 return BC_STATUS_SUCCESS;
4696 else if (BC_PARSE_BODY(p))
4697 return bc_parse_body(p, false);
4707 case BC_LEX_OP_MINUS:
4708 case BC_LEX_OP_BOOL_NOT:
4712 case BC_LEX_KEY_IBASE:
4713 case BC_LEX_KEY_LAST:
4714 case BC_LEX_KEY_LENGTH:
4715 case BC_LEX_KEY_OBASE:
4716 case BC_LEX_KEY_READ:
4717 case BC_LEX_KEY_SCALE:
4718 case BC_LEX_KEY_SQRT:
4720 s = bc_parse_expr(p, BC_PARSE_PRINT, bc_parse_next_expr);
4724 case BC_LEX_KEY_ELSE:
4726 s = bc_parse_else(p);
4732 while (!s && p->l.t.t == BC_LEX_SCOLON) s = bc_lex_next(&p->l);
4738 s = bc_parse_endBody(p, true);
4744 s = bc_parse_string(p, BC_INST_PRINT_STR);
4748 case BC_LEX_KEY_BREAK:
4749 case BC_LEX_KEY_CONTINUE:
4751 s = bc_parse_loopExit(p, p->l.t.t);
4755 case BC_LEX_KEY_FOR:
4757 s = bc_parse_for(p);
4761 case BC_LEX_KEY_HALT:
4763 bc_parse_push(p, BC_INST_HALT);
4764 s = bc_lex_next(&p->l);
4774 case BC_LEX_KEY_LIMITS:
4776 // "limits" is a compile-time command,
4777 // the output is produced at _parse time_.
4778 s = bc_lex_next(&p->l);
4781 "BC_BASE_MAX = "BC_MAX_OBASE_STR "\n"
4782 "BC_DIM_MAX = "BC_MAX_DIM_STR "\n"
4783 "BC_SCALE_MAX = "BC_MAX_SCALE_STR "\n"
4784 "BC_STRING_MAX = "BC_MAX_STRING_STR"\n"
4785 "BC_NAME_MAX = "BC_MAX_NAME_STR "\n"
4786 "BC_NUM_MAX = "BC_MAX_NUM_STR "\n"
4787 "MAX Exponent = "BC_MAX_EXP_STR "\n"
4788 "Number of vars = "BC_MAX_VARS_STR "\n"
4793 case BC_LEX_KEY_PRINT:
4795 s = bc_parse_print(p);
4799 case BC_LEX_KEY_QUIT:
4801 // "quit" is a compile-time command. For example,
4802 // "if (0 == 1) quit" terminates when parsing the statement,
4803 // not when it is executed
4804 QUIT_OR_RETURN_TO_MAIN;
4807 case BC_LEX_KEY_RETURN:
4809 s = bc_parse_return(p);
4813 case BC_LEX_KEY_WHILE:
4815 s = bc_parse_while(p);
4821 s = bc_error_bad_token();
4829 static BcStatus bc_parse_parse(BcParse *p)
4833 if (p->l.t.t == BC_LEX_EOF)
4834 s = p->flags.len > 0 ? bc_error("block end could not be found") : bc_error("end of file");
4835 else if (p->l.t.t == BC_LEX_KEY_DEFINE) {
4836 if (!BC_PARSE_CAN_EXEC(p)) return bc_error_bad_token();
4837 s = bc_parse_func(p);
4840 s = bc_parse_stmt(p);
4842 if (s || G_interrupt) {
4844 s = BC_STATUS_FAILURE;
4850 static BcStatus bc_parse_expr_empty_ok(BcParse *p, uint8_t flags, BcParseNext next)
4852 BcStatus s = BC_STATUS_SUCCESS;
4853 BcInst prev = BC_INST_PRINT;
4854 BcLexType top, t = p->l.t.t;
4855 size_t nexprs = 0, ops_bgn = p->ops.len;
4856 unsigned nparens, nrelops;
4857 bool paren_first, paren_expr, rprn, done, get_token, assign, bin_last;
4859 paren_first = p->l.t.t == BC_LEX_LPAREN;
4860 nparens = nrelops = 0;
4861 paren_expr = rprn = done = get_token = assign = false;
4864 for (; !G_interrupt && !s && !done && bc_parse_exprs(t); t = p->l.t.t) {
4870 s = bc_parse_incdec(p, &prev, &paren_expr, &nexprs, flags);
4871 rprn = get_token = bin_last = false;
4875 case BC_LEX_OP_MINUS:
4877 s = bc_parse_minus(p, &prev, ops_bgn, rprn, &nexprs);
4878 rprn = get_token = false;
4879 bin_last = prev == BC_INST_MINUS;
4883 case BC_LEX_OP_ASSIGN_POWER:
4884 case BC_LEX_OP_ASSIGN_MULTIPLY:
4885 case BC_LEX_OP_ASSIGN_DIVIDE:
4886 case BC_LEX_OP_ASSIGN_MODULUS:
4887 case BC_LEX_OP_ASSIGN_PLUS:
4888 case BC_LEX_OP_ASSIGN_MINUS:
4889 case BC_LEX_OP_ASSIGN:
4891 if (prev != BC_INST_VAR && prev != BC_INST_ARRAY_ELEM &&
4892 prev != BC_INST_SCALE && prev != BC_INST_IBASE &&
4893 prev != BC_INST_OBASE && prev != BC_INST_LAST)
4895 s = bc_error("bad assignment:"
4896 " left side must be scale,"
4897 " ibase, obase, last, var,"
4904 case BC_LEX_OP_POWER:
4905 case BC_LEX_OP_MULTIPLY:
4906 case BC_LEX_OP_DIVIDE:
4907 case BC_LEX_OP_MODULUS:
4908 case BC_LEX_OP_PLUS:
4909 case BC_LEX_OP_REL_EQ:
4910 case BC_LEX_OP_REL_LE:
4911 case BC_LEX_OP_REL_GE:
4912 case BC_LEX_OP_REL_NE:
4913 case BC_LEX_OP_REL_LT:
4914 case BC_LEX_OP_REL_GT:
4915 case BC_LEX_OP_BOOL_NOT:
4916 case BC_LEX_OP_BOOL_OR:
4917 case BC_LEX_OP_BOOL_AND:
4919 if (((t == BC_LEX_OP_BOOL_NOT) != bin_last)
4920 || (t != BC_LEX_OP_BOOL_NOT && prev == BC_INST_BOOL_NOT)
4922 return bc_error_bad_expression();
4925 nrelops += t >= BC_LEX_OP_REL_EQ && t <= BC_LEX_OP_REL_GT;
4926 prev = BC_PARSE_TOKEN_INST(t);
4927 s = bc_parse_operator(p, t, ops_bgn, &nexprs, true);
4928 rprn = get_token = false;
4929 bin_last = t != BC_LEX_OP_BOOL_NOT;
4936 if (BC_PARSE_LEAF(prev, rprn))
4937 return bc_error_bad_expression();
4939 paren_expr = rprn = bin_last = false;
4941 bc_vec_push(&p->ops, &t);
4948 if (bin_last || prev == BC_INST_BOOL_NOT)
4949 return bc_error_bad_expression();
4952 s = BC_STATUS_SUCCESS;
4957 else if (!paren_expr)
4958 return BC_STATUS_PARSE_EMPTY_EXP;
4961 paren_expr = rprn = true;
4962 get_token = bin_last = false;
4964 s = bc_parse_rightParen(p, ops_bgn, &nexprs);
4971 if (BC_PARSE_LEAF(prev, rprn))
4972 return bc_error_bad_expression();
4974 rprn = get_token = bin_last = false;
4975 s = bc_parse_name(p, &prev, flags & ~BC_PARSE_NOCALL);
4983 if (BC_PARSE_LEAF(prev, rprn))
4984 return bc_error_bad_expression();
4985 bc_parse_number(p, &prev, &nexprs);
4986 paren_expr = get_token = true;
4987 rprn = bin_last = false;
4992 case BC_LEX_KEY_IBASE:
4993 case BC_LEX_KEY_LAST:
4994 case BC_LEX_KEY_OBASE:
4996 if (BC_PARSE_LEAF(prev, rprn))
4997 return bc_error_bad_expression();
4998 prev = (char) (t - BC_LEX_KEY_IBASE + BC_INST_IBASE);
4999 bc_parse_push(p, (char) prev);
5001 paren_expr = get_token = true;
5002 rprn = bin_last = false;
5008 case BC_LEX_KEY_LENGTH:
5009 case BC_LEX_KEY_SQRT:
5011 if (BC_PARSE_LEAF(prev, rprn))
5012 return bc_error_bad_expression();
5013 s = bc_parse_builtin(p, t, flags, &prev);
5015 rprn = get_token = bin_last = false;
5021 case BC_LEX_KEY_READ:
5023 if (BC_PARSE_LEAF(prev, rprn))
5024 return bc_error_bad_expression();
5025 else if (flags & BC_PARSE_NOREAD)
5026 s = bc_error_nested_read_call();
5028 s = bc_parse_read(p);
5031 rprn = get_token = bin_last = false;
5033 prev = BC_INST_READ;
5038 case BC_LEX_KEY_SCALE:
5040 if (BC_PARSE_LEAF(prev, rprn))
5041 return bc_error_bad_expression();
5042 s = bc_parse_scale(p, &prev, flags);
5044 rprn = get_token = bin_last = false;
5046 prev = BC_INST_SCALE;
5053 s = bc_error_bad_token();
5058 if (!s && get_token) s = bc_lex_next(&p->l);
5062 if (G_interrupt) return BC_STATUS_FAILURE; // ^C: stop parsing
5064 while (p->ops.len > ops_bgn) {
5066 top = BC_PARSE_TOP_OP(p);
5067 assign = top >= BC_LEX_OP_ASSIGN_POWER && top <= BC_LEX_OP_ASSIGN;
5069 if (top == BC_LEX_LPAREN || top == BC_LEX_RPAREN)
5070 return bc_error_bad_expression();
5072 bc_parse_push(p, BC_PARSE_TOKEN_INST(top));
5074 nexprs -= top != BC_LEX_OP_BOOL_NOT && top != BC_LEX_NEG;
5075 bc_vec_pop(&p->ops);
5078 if (prev == BC_INST_BOOL_NOT || nexprs != 1)
5079 return bc_error_bad_expression();
5081 // next is BcParseNext, byte array of up to 4 BC_LEX's, packed into 32-bit word
5083 if (t == (next & 0x7f))
5085 if (next & 0x80) // last element?
5089 return bc_error_bad_expression();
5092 if (!(flags & BC_PARSE_REL) && nrelops) {
5093 s = bc_POSIX_does_not_allow("comparison operators outside if or loops");
5096 else if ((flags & BC_PARSE_REL) && nrelops > 1) {
5097 s = bc_POSIX_requires("exactly one comparison operator per condition");
5101 if (flags & BC_PARSE_PRINT) {
5102 if (paren_first || !assign) bc_parse_push(p, BC_INST_PRINT);
5103 bc_parse_push(p, BC_INST_POP);
5109 static BcStatus bc_parse_expr(BcParse *p, uint8_t flags, BcParseNext next)
5113 s = bc_parse_expr_empty_ok(p, flags, next);
5114 if (s == BC_STATUS_PARSE_EMPTY_EXP)
5115 return bc_error("empty expression");
5119 static void bc_parse_init(BcParse *p, size_t func)
5121 bc_parse_create(p, func, bc_parse_parse, bc_lex_token);
5124 static BcStatus bc_parse_expression(BcParse *p, uint8_t flags)
5126 return bc_parse_expr(p, flags, bc_parse_next_read);
5133 #define DC_PARSE_BUF_LEN ((int) (sizeof(uint32_t) * CHAR_BIT))
5135 static BcStatus dc_parse_register(BcParse *p)
5140 s = bc_lex_next(&p->l);
5142 if (p->l.t.t != BC_LEX_NAME) return bc_error_bad_token();
5144 name = xstrdup(p->l.t.v.v);
5145 bc_parse_pushName(p, name);
5150 static BcStatus dc_parse_string(BcParse *p)
5152 char *str, *name, b[DC_PARSE_BUF_LEN + 1];
5153 size_t idx, len = G.prog.strs.len;
5155 sprintf(b, "%0*zu", DC_PARSE_BUF_LEN, len);
5158 str = xstrdup(p->l.t.v.v);
5159 bc_parse_push(p, BC_INST_STR);
5160 bc_parse_pushIndex(p, len);
5161 bc_vec_push(&G.prog.strs, &str);
5162 bc_parse_addFunc(p, name, &idx);
5164 return bc_lex_next(&p->l);
5167 static BcStatus dc_parse_mem(BcParse *p, uint8_t inst, bool name, bool store)
5171 bc_parse_push(p, inst);
5173 s = dc_parse_register(p);
5178 bc_parse_push(p, BC_INST_SWAP);
5179 bc_parse_push(p, BC_INST_ASSIGN);
5180 bc_parse_push(p, BC_INST_POP);
5183 return bc_lex_next(&p->l);
5186 static BcStatus dc_parse_cond(BcParse *p, uint8_t inst)
5190 bc_parse_push(p, inst);
5191 bc_parse_push(p, BC_INST_EXEC_COND);
5193 s = dc_parse_register(p);
5196 s = bc_lex_next(&p->l);
5199 if (p->l.t.t == BC_LEX_ELSE) {
5200 s = dc_parse_register(p);
5202 s = bc_lex_next(&p->l);
5205 bc_parse_push(p, BC_PARSE_STREND);
5210 static BcStatus dc_parse_token(BcParse *p, BcLexType t, uint8_t flags)
5212 BcStatus s = BC_STATUS_SUCCESS;
5215 bool assign, get_token = false;
5219 case BC_LEX_OP_REL_EQ:
5220 case BC_LEX_OP_REL_LE:
5221 case BC_LEX_OP_REL_GE:
5222 case BC_LEX_OP_REL_NE:
5223 case BC_LEX_OP_REL_LT:
5224 case BC_LEX_OP_REL_GT:
5226 s = dc_parse_cond(p, t - BC_LEX_OP_REL_EQ + BC_INST_REL_EQ);
5233 s = dc_parse_mem(p, BC_INST_ARRAY_ELEM, true, t == BC_LEX_COLON);
5239 s = dc_parse_string(p);
5246 if (t == BC_LEX_NEG) {
5247 s = bc_lex_next(&p->l);
5249 if (p->l.t.t != BC_LEX_NUMBER)
5250 return bc_error_bad_token();
5253 bc_parse_number(p, &prev, &p->nbraces);
5255 if (t == BC_LEX_NEG) bc_parse_push(p, BC_INST_NEG);
5261 case BC_LEX_KEY_READ:
5263 if (flags & BC_PARSE_NOREAD)
5264 s = bc_error_nested_read_call();
5266 bc_parse_push(p, BC_INST_READ);
5271 case BC_LEX_OP_ASSIGN:
5272 case BC_LEX_STORE_PUSH:
5274 assign = t == BC_LEX_OP_ASSIGN;
5275 inst = assign ? BC_INST_VAR : BC_INST_PUSH_TO_VAR;
5276 s = dc_parse_mem(p, inst, true, assign);
5281 case BC_LEX_LOAD_POP:
5283 inst = t == BC_LEX_LOAD_POP ? BC_INST_PUSH_VAR : BC_INST_LOAD;
5284 s = dc_parse_mem(p, inst, true, false);
5288 case BC_LEX_STORE_IBASE:
5289 case BC_LEX_STORE_SCALE:
5290 case BC_LEX_STORE_OBASE:
5292 inst = t - BC_LEX_STORE_IBASE + BC_INST_IBASE;
5293 s = dc_parse_mem(p, inst, false, true);
5299 s = bc_error_bad_token();
5305 if (!s && get_token) s = bc_lex_next(&p->l);
5310 static BcStatus dc_parse_expr(BcParse *p, uint8_t flags)
5312 BcStatus s = BC_STATUS_SUCCESS;
5316 if (flags & BC_PARSE_NOCALL) p->nbraces = G.prog.results.len;
5318 for (t = p->l.t.t; !s && t != BC_LEX_EOF; t = p->l.t.t) {
5320 inst = dc_parse_insts[t];
5322 if (inst != BC_INST_INVALID) {
5323 bc_parse_push(p, inst);
5324 s = bc_lex_next(&p->l);
5327 s = dc_parse_token(p, t, flags);
5330 if (!s && p->l.t.t == BC_LEX_EOF && (flags & BC_PARSE_NOCALL))
5331 bc_parse_push(p, BC_INST_POP_EXEC);
5336 static BcStatus dc_parse_parse(BcParse *p)
5340 if (p->l.t.t == BC_LEX_EOF)
5341 s = bc_error("end of file");
5343 s = dc_parse_expr(p, 0);
5345 if (s || G_interrupt) {
5347 s = BC_STATUS_FAILURE;
5353 static void dc_parse_init(BcParse *p, size_t func)
5355 bc_parse_create(p, func, dc_parse_parse, dc_lex_token);
5360 static void common_parse_init(BcParse *p, size_t func)
5363 IF_BC(bc_parse_init(p, func);)
5365 IF_DC(dc_parse_init(p, func);)
5369 static BcStatus common_parse_expr(BcParse *p, uint8_t flags)
5372 IF_BC(return bc_parse_expression(p, flags);)
5374 IF_DC(return dc_parse_expr(p, flags);)
5378 static BcVec* bc_program_search(char *id, bool var)
5386 v = var ? &G.prog.vars : &G.prog.arrs;
5387 map = var ? &G.prog.var_map : &G.prog.arr_map;
5391 new = bc_map_insert(map, &e, &i); // 1 if insertion was successful
5394 bc_array_init(&data.v, var);
5395 bc_vec_push(v, &data.v);
5398 ptr = bc_vec_item(map, i);
5399 if (new) ptr->name = xstrdup(e.name);
5400 return bc_vec_item(v, ptr->idx);
5403 static BcStatus bc_program_num(BcResult *r, BcNum **num, bool hex)
5405 BcStatus s = BC_STATUS_SUCCESS;
5410 case BC_RESULT_TEMP:
5411 case BC_RESULT_IBASE:
5412 case BC_RESULT_SCALE:
5413 case BC_RESULT_OBASE:
5419 case BC_RESULT_CONSTANT:
5421 char **str = bc_vec_item(&G.prog.consts, r->d.id.idx);
5422 size_t base_t, len = strlen(*str);
5425 bc_num_init(&r->d.n, len);
5427 hex = hex && len == 1;
5428 base = hex ? &G.prog.hexb : &G.prog.ib;
5429 base_t = hex ? BC_NUM_MAX_IBASE : G.prog.ib_t;
5430 s = bc_num_parse(&r->d.n, *str, base, base_t);
5433 bc_num_free(&r->d.n);
5438 r->t = BC_RESULT_TEMP;
5444 case BC_RESULT_ARRAY:
5445 case BC_RESULT_ARRAY_ELEM:
5449 v = bc_program_search(r->d.id.name, r->t == BC_RESULT_VAR);
5451 if (r->t == BC_RESULT_ARRAY_ELEM) {
5453 if (v->len <= r->d.id.idx) bc_array_expand(v, r->d.id.idx + 1);
5454 *num = bc_vec_item(v, r->d.id.idx);
5457 *num = bc_vec_top(v);
5462 case BC_RESULT_LAST:
5464 *num = &G.prog.last;
5478 static BcStatus bc_program_binOpPrep(BcResult **l, BcNum **ln,
5479 BcResult **r, BcNum **rn, bool assign)
5483 BcResultType lt, rt;
5485 if (!BC_PROG_STACK(&G.prog.results, 2))
5486 return bc_error_stack_has_too_few_elements();
5488 *r = bc_vec_item_rev(&G.prog.results, 0);
5489 *l = bc_vec_item_rev(&G.prog.results, 1);
5493 hex = assign && (lt == BC_RESULT_IBASE || lt == BC_RESULT_OBASE);
5495 s = bc_program_num(*l, ln, false);
5497 s = bc_program_num(*r, rn, hex);
5500 // We run this again under these conditions in case any vector has been
5501 // reallocated out from under the BcNums or arrays we had.
5502 if (lt == rt && (lt == BC_RESULT_VAR || lt == BC_RESULT_ARRAY_ELEM)) {
5503 s = bc_program_num(*l, ln, false);
5507 if (!BC_PROG_NUM((*l), (*ln)) && (!assign || (*l)->t != BC_RESULT_VAR))
5508 return bc_error_variable_is_wrong_type();
5509 if (!assign && !BC_PROG_NUM((*r), (*ln)))
5510 return bc_error_variable_is_wrong_type();
5515 static void bc_program_binOpRetire(BcResult *r)
5517 r->t = BC_RESULT_TEMP;
5518 bc_vec_pop(&G.prog.results);
5519 bc_vec_pop(&G.prog.results);
5520 bc_vec_push(&G.prog.results, r);
5523 static BcStatus bc_program_prep(BcResult **r, BcNum **n)
5527 if (!BC_PROG_STACK(&G.prog.results, 1))
5528 return bc_error_stack_has_too_few_elements();
5529 *r = bc_vec_top(&G.prog.results);
5531 s = bc_program_num(*r, n, false);
5534 if (!BC_PROG_NUM((*r), (*n)))
5535 return bc_error_variable_is_wrong_type();
5540 static void bc_program_retire(BcResult *r, BcResultType t)
5543 bc_vec_pop(&G.prog.results);
5544 bc_vec_push(&G.prog.results, r);
5547 static BcStatus bc_program_op(char inst)
5550 BcResult *opd1, *opd2, res;
5551 BcNum *n1, *n2 = NULL;
5553 s = bc_program_binOpPrep(&opd1, &n1, &opd2, &n2, false);
5555 bc_num_init_DEF_SIZE(&res.d.n);
5557 s = bc_program_ops[inst - BC_INST_POWER](n1, n2, &res.d.n, G.prog.scale);
5559 bc_program_binOpRetire(&res);
5564 bc_num_free(&res.d.n);
5568 static BcStatus bc_program_read(void)
5570 const char *sv_file;
5576 BcFunc *f = bc_program_func(BC_PROG_READ);
5578 for (i = 0; i < G.prog.stack.len; ++i) {
5579 BcInstPtr *ip_ptr = bc_vec_item(&G.prog.stack, i);
5580 if (ip_ptr->func == BC_PROG_READ)
5581 return bc_error_nested_read_call();
5584 bc_vec_pop_all(&f->code);
5585 bc_char_vec_init(&buf);
5587 sv_file = G.prog.file;
5590 s = bc_read_line(&buf);
5593 common_parse_init(&parse, BC_PROG_READ);
5594 bc_lex_file(&parse.l);
5596 s = bc_parse_text(&parse, buf.v);
5597 if (s) goto exec_err;
5598 s = common_parse_expr(&parse, BC_PARSE_NOREAD);
5599 if (s) goto exec_err;
5601 if (parse.l.t.t != BC_LEX_NLINE && parse.l.t.t != BC_LEX_EOF) {
5602 s = bc_error("bad read() expression");
5606 ip.func = BC_PROG_READ;
5608 ip.len = G.prog.results.len;
5610 // Update this pointer, just in case.
5611 f = bc_program_func(BC_PROG_READ);
5613 bc_vec_pushByte(&f->code, BC_INST_POP_EXEC);
5614 bc_vec_push(&G.prog.stack, &ip);
5617 G.prog.file = sv_file;
5618 bc_parse_free(&parse);
5624 static size_t bc_program_index(char *code, size_t *bgn)
5626 char amt = code[(*bgn)++], i = 0;
5629 for (; i < amt; ++i, ++(*bgn))
5630 res |= (((size_t)((int) code[*bgn]) & UCHAR_MAX) << (i * CHAR_BIT));
5635 static char *bc_program_name(char *code, size_t *bgn)
5638 char c, *s, *str = code + *bgn, *ptr = strchr(str, BC_PARSE_STREND);
5640 s = xmalloc(ptr - str + 1);
5643 for (i = 0; c != 0 && c != BC_PARSE_STREND; c = code[(*bgn)++], ++i)
5651 static void bc_program_printString(const char *str)
5653 size_t i, len = strlen(str);
5662 for (i = 0; i < len; ++i, ++G.prog.nchars) {
5666 if (c != '\\' || i == len - 1)
5702 G.prog.nchars = SIZE_MAX;
5726 // Just print the backslash and following character.
5737 static BcStatus bc_program_print(char inst, size_t idx)
5739 BcStatus s = BC_STATUS_SUCCESS;
5742 bool pop = inst != BC_INST_PRINT;
5744 if (!BC_PROG_STACK(&G.prog.results, idx + 1))
5745 return bc_error_stack_has_too_few_elements();
5747 r = bc_vec_item_rev(&G.prog.results, idx);
5748 num = NULL; // is this NULL necessary?
5749 s = bc_program_num(r, &num, false);
5752 if (BC_PROG_NUM(r, num)) {
5753 s = bc_num_print(num, !pop);
5754 if (!s) bc_num_copy(&G.prog.last, num);
5759 idx = (r->t == BC_RESULT_STR) ? r->d.id.idx : num->rdx;
5760 str = *bc_program_str(idx);
5762 if (inst == BC_INST_PRINT_STR) {
5765 if (c == '\0') break;
5768 if (c == '\n') G.prog.nchars = 0;
5772 bc_program_printString(str);
5773 if (inst == BC_INST_PRINT) bb_putchar('\n');
5777 if (!s && pop) bc_vec_pop(&G.prog.results);
5782 static BcStatus bc_program_negate(void)
5788 s = bc_program_prep(&ptr, &num);
5791 bc_num_init(&res.d.n, num->len);
5792 bc_num_copy(&res.d.n, num);
5793 if (res.d.n.len) res.d.n.neg = !res.d.n.neg;
5795 bc_program_retire(&res, BC_RESULT_TEMP);
5800 static BcStatus bc_program_logical(char inst)
5803 BcResult *opd1, *opd2, res;
5808 s = bc_program_binOpPrep(&opd1, &n1, &opd2, &n2, false);
5810 bc_num_init_DEF_SIZE(&res.d.n);
5812 if (inst == BC_INST_BOOL_AND)
5813 cond = bc_num_cmp(n1, &G.prog.zero) && bc_num_cmp(n2, &G.prog.zero);
5814 else if (inst == BC_INST_BOOL_OR)
5815 cond = bc_num_cmp(n1, &G.prog.zero) || bc_num_cmp(n2, &G.prog.zero);
5818 cmp = bc_num_cmp(n1, n2);
5822 case BC_INST_REL_EQ:
5828 case BC_INST_REL_LE:
5834 case BC_INST_REL_GE:
5840 case BC_INST_REL_NE:
5846 case BC_INST_REL_LT:
5852 case BC_INST_REL_GT:
5860 (cond ? bc_num_one : bc_num_zero)(&res.d.n);
5862 bc_program_binOpRetire(&res);
5868 static BcStatus bc_program_assignStr(BcResult *r, BcVec *v,
5874 memset(&n2, 0, sizeof(BcNum));
5875 n2.rdx = res.d.id.idx = r->d.id.idx;
5876 res.t = BC_RESULT_STR;
5879 if (!BC_PROG_STACK(&G.prog.results, 2))
5880 return bc_error_stack_has_too_few_elements();
5882 bc_vec_pop(&G.prog.results);
5885 bc_vec_pop(&G.prog.results);
5887 bc_vec_push(&G.prog.results, &res);
5888 bc_vec_push(v, &n2);
5890 return BC_STATUS_SUCCESS;
5894 static BcStatus bc_program_copyToVar(char *name, bool var)
5901 if (!BC_PROG_STACK(&G.prog.results, 1))
5902 return bc_error_stack_has_too_few_elements();
5904 ptr = bc_vec_top(&G.prog.results);
5905 if ((ptr->t == BC_RESULT_ARRAY) != !var)
5906 return bc_error_variable_is_wrong_type();
5907 v = bc_program_search(name, var);
5910 if (ptr->t == BC_RESULT_STR && !var)
5911 return bc_error_variable_is_wrong_type();
5912 if (ptr->t == BC_RESULT_STR) return bc_program_assignStr(ptr, v, true);
5915 s = bc_program_num(ptr, &n, false);
5918 // Do this once more to make sure that pointers were not invalidated.
5919 v = bc_program_search(name, var);
5922 bc_num_init_DEF_SIZE(&r.d.n);
5923 bc_num_copy(&r.d.n, n);
5926 bc_array_init(&r.d.v, true);
5927 bc_array_copy(&r.d.v, (BcVec *) n);
5930 bc_vec_push(v, &r.d);
5931 bc_vec_pop(&G.prog.results);
5936 static BcStatus bc_program_assign(char inst)
5939 BcResult *left, *right, res;
5940 BcNum *l = NULL, *r = NULL;
5941 bool assign = inst == BC_INST_ASSIGN, ib, sc;
5943 s = bc_program_binOpPrep(&left, &l, &right, &r, assign);
5946 ib = left->t == BC_RESULT_IBASE;
5947 sc = left->t == BC_RESULT_SCALE;
5951 if (right->t == BC_RESULT_STR) {
5955 if (left->t != BC_RESULT_VAR)
5956 return bc_error_variable_is_wrong_type();
5957 v = bc_program_search(left->d.id.name, true);
5959 return bc_program_assignStr(right, v, false);
5963 if (left->t == BC_RESULT_CONSTANT || left->t == BC_RESULT_TEMP)
5964 return bc_error("bad assignment:"
5965 " left side must be scale,"
5966 " ibase, obase, last, var,"
5971 if (inst == BC_INST_ASSIGN_DIVIDE && !bc_num_cmp(r, &G.prog.zero))
5972 return bc_error("divide by zero");
5977 s = bc_program_ops[inst - BC_INST_ASSIGN_POWER](l, r, l, G.prog.scale);
5984 if (ib || sc || left->t == BC_RESULT_OBASE) {
5985 static const char *const msg[] = {
5986 "bad ibase; must be [2,16]", //BC_RESULT_IBASE
5987 "bad scale; must be [0,"BC_MAX_SCALE_STR"]", //BC_RESULT_SCALE
5988 NULL, //can't happen //BC_RESULT_LAST
5989 NULL, //can't happen //BC_RESULT_CONSTANT
5990 NULL, //can't happen //BC_RESULT_ONE
5991 "bad obase; must be [2,"BC_MAX_OBASE_STR"]", //BC_RESULT_OBASE
5994 unsigned long val, max;
5996 s = bc_num_ulong(l, &val);
5999 s = left->t - BC_RESULT_IBASE;
6002 ptr = &G.prog.scale;
6005 if (val < BC_NUM_MIN_BASE)
6006 return bc_error(msg[s]);
6007 max = ib ? BC_NUM_MAX_IBASE : BC_MAX_OBASE;
6008 ptr = ib ? &G.prog.ib_t : &G.prog.ob_t;
6012 return bc_error(msg[s]);
6014 bc_num_copy(ib ? &G.prog.ib : &G.prog.ob, l);
6016 *ptr = (size_t) val;
6017 s = BC_STATUS_SUCCESS;
6020 bc_num_init(&res.d.n, l->len);
6021 bc_num_copy(&res.d.n, l);
6022 bc_program_binOpRetire(&res);
6028 #define bc_program_pushVar(code, bgn, pop, copy) \
6029 bc_program_pushVar(code, bgn)
6030 // for bc, 'pop' and 'copy' are always false
6032 static BcStatus bc_program_pushVar(char *code, size_t *bgn,
6033 bool pop, bool copy)
6035 BcStatus s = BC_STATUS_SUCCESS;
6037 char *name = bc_program_name(code, bgn);
6039 r.t = BC_RESULT_VAR;
6044 BcVec *v = bc_program_search(name, true);
6045 BcNum *num = bc_vec_top(v);
6049 if (!BC_PROG_STACK(v, 2 - copy)) {
6051 return bc_error_stack_has_too_few_elements();
6057 if (!BC_PROG_STR(num)) {
6059 r.t = BC_RESULT_TEMP;
6061 bc_num_init_DEF_SIZE(&r.d.n);
6062 bc_num_copy(&r.d.n, num);
6065 r.t = BC_RESULT_STR;
6066 r.d.id.idx = num->rdx;
6069 if (!copy) bc_vec_pop(v);
6074 bc_vec_push(&G.prog.results, &r);
6079 static BcStatus bc_program_pushArray(char *code, size_t *bgn,
6082 BcStatus s = BC_STATUS_SUCCESS;
6086 r.d.id.name = bc_program_name(code, bgn);
6088 if (inst == BC_INST_ARRAY) {
6089 r.t = BC_RESULT_ARRAY;
6090 bc_vec_push(&G.prog.results, &r);
6097 s = bc_program_prep(&operand, &num);
6099 s = bc_num_ulong(num, &temp);
6102 if (temp > BC_MAX_DIM) {
6103 s = bc_error("array too long; must be [1,"BC_MAX_DIM_STR"]");
6107 r.d.id.idx = (size_t) temp;
6108 bc_program_retire(&r, BC_RESULT_ARRAY_ELEM);
6112 if (s) free(r.d.id.name);
6117 static BcStatus bc_program_incdec(char inst)
6120 BcResult *ptr, res, copy;
6124 s = bc_program_prep(&ptr, &num);
6127 if (inst == BC_INST_INC_POST || inst == BC_INST_DEC_POST) {
6128 copy.t = BC_RESULT_TEMP;
6129 bc_num_init(©.d.n, num->len);
6130 bc_num_copy(©.d.n, num);
6133 res.t = BC_RESULT_ONE;
6134 inst = inst == BC_INST_INC_PRE || inst == BC_INST_INC_POST ?
6135 BC_INST_ASSIGN_PLUS :
6136 BC_INST_ASSIGN_MINUS;
6138 bc_vec_push(&G.prog.results, &res);
6139 bc_program_assign(inst);
6141 if (inst2 == BC_INST_INC_POST || inst2 == BC_INST_DEC_POST) {
6142 bc_vec_pop(&G.prog.results);
6143 bc_vec_push(&G.prog.results, ©);
6149 static BcStatus bc_program_call(char *code, size_t *idx)
6151 BcStatus s = BC_STATUS_SUCCESS;
6153 size_t i, nparams = bc_program_index(code, idx);
6160 ip.func = bc_program_index(code, idx);
6161 func = bc_program_func(ip.func);
6163 if (func->code.len == 0) {
6164 return bc_error("undefined function");
6166 if (nparams != func->nparams) {
6167 return bc_error_fmt("function has %u parameters, but called with %u", func->nparams, nparams);
6169 ip.len = G.prog.results.len - nparams;
6171 for (i = 0; i < nparams; ++i) {
6173 a = bc_vec_item(&func->autos, nparams - 1 - i);
6174 arg = bc_vec_top(&G.prog.results);
6176 if ((!a->idx) != (arg->t == BC_RESULT_ARRAY) || arg->t == BC_RESULT_STR)
6177 return bc_error_variable_is_wrong_type();
6179 s = bc_program_copyToVar(a->name, a->idx);
6183 for (; i < func->autos.len; ++i) {
6186 a = bc_vec_item(&func->autos, i);
6187 v = bc_program_search(a->name, a->idx);
6190 bc_num_init_DEF_SIZE(¶m.n);
6191 bc_vec_push(v, ¶m.n);
6194 bc_array_init(¶m.v, true);
6195 bc_vec_push(v, ¶m.v);
6199 bc_vec_push(&G.prog.stack, &ip);
6201 return BC_STATUS_SUCCESS;
6204 static BcStatus bc_program_return(char inst)
6210 BcInstPtr *ip = bc_vec_top(&G.prog.stack);
6212 if (!BC_PROG_STACK(&G.prog.results, ip->len + inst == BC_INST_RET))
6213 return bc_error_stack_has_too_few_elements();
6215 f = bc_program_func(ip->func);
6216 res.t = BC_RESULT_TEMP;
6218 if (inst == BC_INST_RET) {
6221 BcResult *operand = bc_vec_top(&G.prog.results);
6223 s = bc_program_num(operand, &num, false);
6225 bc_num_init(&res.d.n, num->len);
6226 bc_num_copy(&res.d.n, num);
6229 bc_num_init_DEF_SIZE(&res.d.n);
6230 //bc_num_zero(&res.d.n); - already is
6233 // We need to pop arguments as well, so this takes that into account.
6234 for (i = 0; i < f->autos.len; ++i) {
6237 BcId *a = bc_vec_item(&f->autos, i);
6239 v = bc_program_search(a->name, a->idx);
6243 bc_vec_npop(&G.prog.results, G.prog.results.len - ip->len);
6244 bc_vec_push(&G.prog.results, &res);
6245 bc_vec_pop(&G.prog.stack);
6247 return BC_STATUS_SUCCESS;
6251 static unsigned long bc_program_scale(BcNum *n)
6253 return (unsigned long) n->rdx;
6256 static unsigned long bc_program_len(BcNum *n)
6258 size_t len = n->len;
6260 if (n->rdx != len) return len;
6262 if (len == 0) break;
6264 if (n->num[len] != 0) break;
6269 static BcStatus bc_program_builtin(char inst)
6275 bool len = inst == BC_INST_LENGTH;
6277 if (!BC_PROG_STACK(&G.prog.results, 1))
6278 return bc_error_stack_has_too_few_elements();
6279 opnd = bc_vec_top(&G.prog.results);
6281 s = bc_program_num(opnd, &num, false);
6285 if (!BC_PROG_NUM(opnd, num) && !len)
6286 return bc_error_variable_is_wrong_type();
6289 bc_num_init_DEF_SIZE(&res.d.n);
6291 if (inst == BC_INST_SQRT) s = bc_num_sqrt(num, &res.d.n, G.prog.scale);
6293 else if (len != 0 && opnd->t == BC_RESULT_ARRAY) {
6294 bc_num_ulong2num(&res.d.n, (unsigned long) ((BcVec *) num)->len);
6298 else if (len != 0 && !BC_PROG_NUM(opnd, num)) {
6301 size_t idx = opnd->t == BC_RESULT_STR ? opnd->d.id.idx : num->rdx;
6303 str = bc_program_str(idx);
6304 bc_num_ulong2num(&res.d.n, strlen(*str));
6308 BcProgramBuiltIn f = len ? bc_program_len : bc_program_scale;
6309 bc_num_ulong2num(&res.d.n, f(num));
6312 bc_program_retire(&res, BC_RESULT_TEMP);
6318 static BcStatus bc_program_divmod(void)
6321 BcResult *opd1, *opd2, res, res2;
6322 BcNum *n1, *n2 = NULL;
6324 s = bc_program_binOpPrep(&opd1, &n1, &opd2, &n2, false);
6327 bc_num_init_DEF_SIZE(&res.d.n);
6328 bc_num_init(&res2.d.n, n2->len);
6330 s = bc_num_divmod(n1, n2, &res2.d.n, &res.d.n, G.prog.scale);
6333 bc_program_binOpRetire(&res2);
6334 res.t = BC_RESULT_TEMP;
6335 bc_vec_push(&G.prog.results, &res);
6340 bc_num_free(&res2.d.n);
6341 bc_num_free(&res.d.n);
6345 static BcStatus bc_program_modexp(void)
6348 BcResult *r1, *r2, *r3, res;
6349 BcNum *n1, *n2, *n3;
6351 if (!BC_PROG_STACK(&G.prog.results, 3))
6352 return bc_error_stack_has_too_few_elements();
6353 s = bc_program_binOpPrep(&r2, &n2, &r3, &n3, false);
6356 r1 = bc_vec_item_rev(&G.prog.results, 2);
6357 s = bc_program_num(r1, &n1, false);
6359 if (!BC_PROG_NUM(r1, n1))
6360 return bc_error_variable_is_wrong_type();
6362 // Make sure that the values have their pointers updated, if necessary.
6363 if (r1->t == BC_RESULT_VAR || r1->t == BC_RESULT_ARRAY_ELEM) {
6365 if (r1->t == r2->t) {
6366 s = bc_program_num(r2, &n2, false);
6370 if (r1->t == r3->t) {
6371 s = bc_program_num(r3, &n3, false);
6376 bc_num_init(&res.d.n, n3->len);
6377 s = bc_num_modexp(n1, n2, n3, &res.d.n);
6380 bc_vec_pop(&G.prog.results);
6381 bc_program_binOpRetire(&res);
6386 bc_num_free(&res.d.n);
6390 static void bc_program_stackLen(void)
6393 size_t len = G.prog.results.len;
6395 res.t = BC_RESULT_TEMP;
6397 bc_num_init_DEF_SIZE(&res.d.n);
6398 bc_num_ulong2num(&res.d.n, len);
6399 bc_vec_push(&G.prog.results, &res);
6402 static BcStatus bc_program_asciify(void)
6407 char *str, *str2, c;
6408 size_t len = G.prog.strs.len, idx;
6411 if (!BC_PROG_STACK(&G.prog.results, 1))
6412 return bc_error_stack_has_too_few_elements();
6413 r = bc_vec_top(&G.prog.results);
6415 num = NULL; // TODO: is this NULL needed?
6416 s = bc_program_num(r, &num, false);
6419 if (BC_PROG_NUM(r, num)) {
6421 bc_num_init_DEF_SIZE(&n);
6422 bc_num_copy(&n, num);
6423 bc_num_truncate(&n, n.rdx);
6425 s = bc_num_mod(&n, &G.prog.strmb, &n, 0);
6426 if (s) goto num_err;
6427 s = bc_num_ulong(&n, &val);
6428 if (s) goto num_err;
6435 idx = (r->t == BC_RESULT_STR) ? r->d.id.idx : num->rdx;
6436 str2 = *bc_program_str(idx);
6444 str2 = xstrdup(str);
6445 bc_program_addFunc(str2, &idx);
6447 if (idx != len + BC_PROG_REQ_FUNCS) {
6449 for (idx = 0; idx < G.prog.strs.len; ++idx) {
6450 if (strcmp(*bc_program_str(idx), str) == 0) {
6459 bc_vec_push(&G.prog.strs, &str);
6461 res.t = BC_RESULT_STR;
6463 bc_vec_pop(&G.prog.results);
6464 bc_vec_push(&G.prog.results, &res);
6466 return BC_STATUS_SUCCESS;
6473 static BcStatus bc_program_printStream(void)
6481 if (!BC_PROG_STACK(&G.prog.results, 1))
6482 return bc_error_stack_has_too_few_elements();
6483 r = bc_vec_top(&G.prog.results);
6485 s = bc_program_num(r, &n, false);
6488 if (BC_PROG_NUM(r, n))
6489 s = bc_num_stream(n, &G.prog.strmb);
6491 idx = (r->t == BC_RESULT_STR) ? r->d.id.idx : n->rdx;
6492 str = *bc_program_str(idx);
6499 static BcStatus bc_program_nquit(void)
6506 s = bc_program_prep(&opnd, &num);
6508 s = bc_num_ulong(num, &val);
6511 bc_vec_pop(&G.prog.results);
6513 if (G.prog.stack.len < val)
6514 return bc_error_stack_has_too_few_elements();
6515 if (G.prog.stack.len == val) {
6516 QUIT_OR_RETURN_TO_MAIN;
6519 bc_vec_npop(&G.prog.stack, val);
6524 static BcStatus bc_program_execStr(char *code, size_t *bgn,
6527 BcStatus s = BC_STATUS_SUCCESS;
6535 if (!BC_PROG_STACK(&G.prog.results, 1))
6536 return bc_error_stack_has_too_few_elements();
6538 r = bc_vec_top(&G.prog.results);
6541 BcNum *n = n; // for compiler
6544 char *then_name = bc_program_name(code, bgn);
6545 char *else_name = NULL;
6547 if (code[*bgn] == BC_PARSE_STREND)
6550 else_name = bc_program_name(code, bgn);
6552 exec = r->d.n.len != 0;
6554 if (!exec && else_name != NULL) {
6561 v = bc_program_search(name, true);
6568 if (!exec) goto exit;
6569 if (!BC_PROG_STR(n)) {
6570 s = bc_error_variable_is_wrong_type();
6576 if (r->t == BC_RESULT_STR) {
6578 } else if (r->t == BC_RESULT_VAR) {
6580 s = bc_program_num(r, &n, false);
6581 if (s || !BC_PROG_STR(n)) goto exit;
6587 fidx = sidx + BC_PROG_REQ_FUNCS;
6589 str = bc_program_str(sidx);
6590 f = bc_program_func(fidx);
6592 if (f->code.len == 0) {
6593 common_parse_init(&prs, fidx);
6594 s = bc_parse_text(&prs, *str);
6596 s = common_parse_expr(&prs, BC_PARSE_NOCALL);
6599 if (prs.l.t.t != BC_LEX_EOF) {
6600 s = bc_error_bad_expression();
6604 bc_parse_free(&prs);
6608 ip.len = G.prog.results.len;
6611 bc_vec_pop(&G.prog.results);
6612 bc_vec_push(&G.prog.stack, &ip);
6614 return BC_STATUS_SUCCESS;
6617 bc_parse_free(&prs);
6618 f = bc_program_func(fidx);
6619 bc_vec_pop_all(&f->code);
6621 bc_vec_pop(&G.prog.results);
6626 static void bc_program_pushGlobal(char inst)
6631 res.t = inst - BC_INST_IBASE + BC_RESULT_IBASE;
6632 if (inst == BC_INST_IBASE)
6633 val = (unsigned long) G.prog.ib_t;
6634 else if (inst == BC_INST_SCALE)
6635 val = (unsigned long) G.prog.scale;
6637 val = (unsigned long) G.prog.ob_t;
6639 bc_num_init_DEF_SIZE(&res.d.n);
6640 bc_num_ulong2num(&res.d.n, val);
6641 bc_vec_push(&G.prog.results, &res);
6644 static void bc_program_addFunc(char *name, size_t *idx)
6646 BcId entry, *entry_ptr;
6651 entry.idx = G.prog.fns.len;
6653 inserted = bc_map_insert(&G.prog.fn_map, &entry, idx);
6654 if (!inserted) free(name);
6656 entry_ptr = bc_vec_item(&G.prog.fn_map, *idx);
6657 *idx = entry_ptr->idx;
6661 BcFunc *func = bc_program_func(entry_ptr->idx);
6663 // We need to reset these, so the function can be repopulated.
6665 bc_vec_pop_all(&func->autos);
6666 bc_vec_pop_all(&func->code);
6667 bc_vec_pop_all(&func->labels);
6671 bc_vec_push(&G.prog.fns, &f);
6675 static BcStatus bc_program_exec(void)
6679 BcInstPtr *ip = bc_vec_top(&G.prog.stack);
6680 BcFunc *func = bc_program_func(ip->func);
6681 char *code = func->code.v;
6684 while (ip->idx < func->code.len) {
6686 char inst = code[(ip->idx)++];
6690 case BC_INST_JUMP_ZERO:
6691 s = bc_program_prep(&ptr, &num);
6693 cond = !bc_num_cmp(num, &G.prog.zero);
6694 bc_vec_pop(&G.prog.results);
6696 case BC_INST_JUMP: {
6698 size_t idx = bc_program_index(code, &ip->idx);
6699 addr = bc_vec_item(&func->labels, idx);
6700 if (inst == BC_INST_JUMP || cond) ip->idx = *addr;
6704 s = bc_program_call(code, &ip->idx);
6706 case BC_INST_INC_PRE:
6707 case BC_INST_DEC_PRE:
6708 case BC_INST_INC_POST:
6709 case BC_INST_DEC_POST:
6710 s = bc_program_incdec(inst);
6713 QUIT_OR_RETURN_TO_MAIN;
6717 s = bc_program_return(inst);
6719 case BC_INST_BOOL_OR:
6720 case BC_INST_BOOL_AND:
6722 case BC_INST_REL_EQ:
6723 case BC_INST_REL_LE:
6724 case BC_INST_REL_GE:
6725 case BC_INST_REL_NE:
6726 case BC_INST_REL_LT:
6727 case BC_INST_REL_GT:
6728 s = bc_program_logical(inst);
6731 s = bc_program_read();
6734 s = bc_program_pushVar(code, &ip->idx, false, false);
6736 case BC_INST_ARRAY_ELEM:
6738 s = bc_program_pushArray(code, &ip->idx, inst);
6741 r.t = BC_RESULT_LAST;
6742 bc_vec_push(&G.prog.results, &r);
6747 bc_program_pushGlobal(inst);
6749 case BC_INST_SCALE_FUNC:
6750 case BC_INST_LENGTH:
6752 s = bc_program_builtin(inst);
6755 r.t = BC_RESULT_CONSTANT;
6756 r.d.id.idx = bc_program_index(code, &ip->idx);
6757 bc_vec_push(&G.prog.results, &r);
6760 if (!BC_PROG_STACK(&G.prog.results, 1))
6761 s = bc_error_stack_has_too_few_elements();
6763 bc_vec_pop(&G.prog.results);
6765 case BC_INST_POP_EXEC:
6766 bc_vec_pop(&G.prog.stack);
6769 case BC_INST_PRINT_POP:
6770 case BC_INST_PRINT_STR:
6771 s = bc_program_print(inst, 0);
6774 r.t = BC_RESULT_STR;
6775 r.d.id.idx = bc_program_index(code, &ip->idx);
6776 bc_vec_push(&G.prog.results, &r);
6779 case BC_INST_MULTIPLY:
6780 case BC_INST_DIVIDE:
6781 case BC_INST_MODULUS:
6784 s = bc_program_op(inst);
6786 case BC_INST_BOOL_NOT:
6787 s = bc_program_prep(&ptr, &num);
6789 bc_num_init_DEF_SIZE(&r.d.n);
6790 if (!bc_num_cmp(num, &G.prog.zero))
6792 //else bc_num_zero(&r.d.n); - already is
6793 bc_program_retire(&r, BC_RESULT_TEMP);
6796 s = bc_program_negate();
6799 case BC_INST_ASSIGN_POWER:
6800 case BC_INST_ASSIGN_MULTIPLY:
6801 case BC_INST_ASSIGN_DIVIDE:
6802 case BC_INST_ASSIGN_MODULUS:
6803 case BC_INST_ASSIGN_PLUS:
6804 case BC_INST_ASSIGN_MINUS:
6806 case BC_INST_ASSIGN:
6807 s = bc_program_assign(inst);
6810 case BC_INST_MODEXP:
6811 s = bc_program_modexp();
6813 case BC_INST_DIVMOD:
6814 s = bc_program_divmod();
6816 case BC_INST_EXECUTE:
6817 case BC_INST_EXEC_COND:
6818 cond = inst == BC_INST_EXEC_COND;
6819 s = bc_program_execStr(code, &ip->idx, cond);
6821 case BC_INST_PRINT_STACK: {
6823 for (idx = 0; idx < G.prog.results.len; ++idx) {
6824 s = bc_program_print(BC_INST_PRINT, idx);
6829 case BC_INST_CLEAR_STACK:
6830 bc_vec_pop_all(&G.prog.results);
6832 case BC_INST_STACK_LEN:
6833 bc_program_stackLen();
6835 case BC_INST_DUPLICATE:
6836 if (!BC_PROG_STACK(&G.prog.results, 1))
6837 return bc_error_stack_has_too_few_elements();
6838 ptr = bc_vec_top(&G.prog.results);
6839 bc_result_copy(&r, ptr);
6840 bc_vec_push(&G.prog.results, &r);
6842 case BC_INST_SWAP: {
6844 if (!BC_PROG_STACK(&G.prog.results, 2))
6845 return bc_error_stack_has_too_few_elements();
6846 ptr = bc_vec_item_rev(&G.prog.results, 0);
6847 ptr2 = bc_vec_item_rev(&G.prog.results, 1);
6848 memcpy(&r, ptr, sizeof(BcResult));
6849 memcpy(ptr, ptr2, sizeof(BcResult));
6850 memcpy(ptr2, &r, sizeof(BcResult));
6853 case BC_INST_ASCIIFY:
6854 s = bc_program_asciify();
6856 case BC_INST_PRINT_STREAM:
6857 s = bc_program_printStream();
6860 case BC_INST_PUSH_VAR: {
6861 bool copy = inst == BC_INST_LOAD;
6862 s = bc_program_pushVar(code, &ip->idx, true, copy);
6865 case BC_INST_PUSH_TO_VAR: {
6866 char *name = bc_program_name(code, &ip->idx);
6867 s = bc_program_copyToVar(name, true);
6872 if (G.prog.stack.len <= 2)
6873 QUIT_OR_RETURN_TO_MAIN;
6874 bc_vec_npop(&G.prog.stack, 2);
6877 s = bc_program_nquit();
6882 if (s || G_interrupt) {
6887 // If the stack has changed, pointers may be invalid.
6888 ip = bc_vec_top(&G.prog.stack);
6889 func = bc_program_func(ip->func);
6890 code = func->code.v;
6893 return BC_STATUS_SUCCESS;
6897 static void bc_vm_info(void)
6899 printf("%s "BB_VER"\n"
6900 "Copyright (c) 2018 Gavin D. Howard and contributors\n"
6904 static void bc_args(char **argv)
6910 #if ENABLE_FEATURE_BC_LONG_OPTIONS
6911 opts = option_mask32 |= getopt32long(argv, "wvsqli",
6912 "warn\0" No_argument "w"
6913 "version\0" No_argument "v"
6914 "standard\0" No_argument "s"
6915 "quiet\0" No_argument "q"
6916 "mathlib\0" No_argument "l"
6917 "interactive\0" No_argument "i"
6920 opts = option_mask32 |= getopt32(argv, "wvsqli");
6922 if (getenv("POSIXLY_CORRECT"))
6923 option_mask32 |= BC_FLAG_S;
6925 if (opts & BC_FLAG_V) {
6930 for (i = optind; argv[i]; ++i)
6931 bc_vec_push(&G.files, argv + i);
6934 static void bc_vm_envArgs(void)
6938 char *env_args = getenv("BC_ENV_ARGS");
6940 if (!env_args) return;
6942 G.env_args = xstrdup(env_args);
6945 bc_vec_init(&v, sizeof(char *), NULL);
6947 while (*(buf = skip_whitespace(buf)) != '\0') {
6948 bc_vec_push(&v, &buf);
6949 buf = skip_non_whitespace(buf);
6955 // NULL terminate, and pass argv[] so that first arg is argv[1]
6956 if (sizeof(int) == sizeof(char*)) {
6957 bc_vec_push(&v, &const_int_0);
6959 static char *const nullptr = NULL;
6960 bc_vec_push(&v, &nullptr);
6962 bc_args(((char **)v.v) - 1);
6968 static unsigned bc_vm_envLen(const char *var)
6974 len = BC_NUM_PRINT_WIDTH;
6975 if (!lenv) return len;
6977 len = bb_strtou(lenv, NULL, 10) - 1;
6978 if (errno || len < 2 || len >= INT_MAX)
6979 len = BC_NUM_PRINT_WIDTH;
6984 static BcStatus bc_vm_process(const char *text)
6986 BcStatus s = bc_parse_text(&G.prs, text);
6990 while (G.prs.l.t.t != BC_LEX_EOF) {
6991 s = G.prs.parse(&G.prs);
6995 if (BC_PARSE_CAN_EXEC(&G.prs)) {
6996 s = bc_program_exec();
7005 static BcStatus bc_vm_file(const char *file)
7007 const char *sv_file;
7013 data = bc_read_file(file);
7014 if (!data) return bc_error_fmt("file '%s' is not text", file);
7016 sv_file = G.prog.file;
7018 bc_lex_file(&G.prs.l);
7019 s = bc_vm_process(data);
7022 main_func = bc_program_func(BC_PROG_MAIN);
7023 ip = bc_vec_item(&G.prog.stack, 0);
7025 if (main_func->code.len < ip->idx)
7026 s = bc_error_fmt("file '%s' is not executable", file);
7029 G.prog.file = sv_file;
7034 static BcStatus bc_vm_stdin(void)
7038 size_t len, i, str = 0;
7039 bool comment = false;
7042 bc_lex_file(&G.prs.l);
7044 bc_char_vec_init(&buffer);
7045 bc_char_vec_init(&buf);
7046 bc_vec_pushZeroByte(&buffer);
7048 // This loop is complex because the vm tries not to send any lines that end
7049 // with a backslash to the parser. The reason for that is because the parser
7050 // treats a backslash+newline combo as whitespace, per the bc spec. In that
7051 // case, and for strings and comments, the parser will expect more stuff.
7052 while ((s = bc_read_line(&buf)) == BC_STATUS_SUCCESS) {
7054 char *string = buf.v;
7059 if (str && buf.v[0] == G.send)
7061 else if (buf.v[0] == G.sbgn)
7064 else if (len > 1 || comment) {
7066 for (i = 0; i < len; ++i) {
7068 bool notend = len > i + 1;
7071 if (i - 1 > len || string[i - 1] != '\\') {
7072 if (G.sbgn == G.send)
7074 else if (c == G.send)
7076 else if (c == G.sbgn)
7080 if (c == '/' && notend && !comment && string[i + 1] == '*') {
7084 else if (c == '*' && notend && comment && string[i + 1] == '/')
7088 if (str || comment || string[len - 2] == '\\') {
7089 bc_vec_concat(&buffer, buf.v);
7094 bc_vec_concat(&buffer, buf.v);
7095 s = bc_vm_process(buffer.v);
7097 if (ENABLE_FEATURE_CLEAN_UP && !G_ttyin) {
7098 // Debug config, non-interactive mode:
7099 // return all the way back to main.
7100 // Non-debug builds do not come here, they exit.
7105 bc_vec_pop_all(&buffer);
7107 if (s == BC_STATUS_EOF) // input EOF (^D) is not an error
7108 s = BC_STATUS_SUCCESS;
7111 s = bc_error("string end could not be found");
7114 s = bc_error("comment end could not be found");
7118 bc_vec_free(&buffer);
7123 static const char bc_lib[] = {
7126 "\n" "auto b,s,n,r,d,i,p,f,v"
7135 "\n" "scale=scale(x)+1"
7145 "\n" "for(i=2;v!=0;++i){"
7151 "\n" "while((d--)!=0)r*=r"
7154 "\n" "if(n!=0)return(1/r)"
7158 "\n" "auto b,s,r,p,a,q,i,v"
7162 "\n" "r=(1-10^scale)/1"
7173 "\n" "while(x<=0.5){"
7177 "\n" "r=a=(x-1)/(x+1)"
7180 "\n" "for(i=3;v!=0;i+=2){"
7191 "\n" "auto b,s,r,n,a,q,i"
7195 "\n" "scale=1.1*s+2"
7204 "\n" "if(q%2!=0)x=-x"
7208 "\n" "for(i=3;a!=0;i+=2){"
7209 "\n" "a*=q/(i*(i-1))"
7214 "\n" "if(n!=0)return(-r/1)"
7223 "\n" "x=s(2*a(1)+x)"
7229 "\n" "auto b,s,r,n,a,m,t,f,i,u"
7238 "\n" "if(scale<65){"
7239 "\n" "return(.7853981633974483096156608458198757210492923498437764552437361480/n)"
7243 "\n" "if(scale<65){"
7244 "\n" "return(.1973955598498807583700497651947902934475851037878521015176889402/n)"
7255 "\n" "x=(x-.2)/(1+.2*x)"
7260 "\n" "for(i=3;t!=0;i+=2){"
7267 "\n" "return((m*a+r)/n)"
7269 "\n" "define j(n,x){"
7270 "\n" "auto b,s,o,a,i,v,f"
7278 "\n" "if(n%2==1)o=1"
7281 "\n" "for(i=2;i<=n;++i)a*=i"
7283 "\n" "a=(x^n)/2^n/a"
7286 "\n" "scale=scale+length(a)-scale(a)"
7287 "\n" "for(i=1;v!=0;++i){"
7288 "\n" "v=v*f/i/(n+i)"
7294 "\n" "return(a*r/1)"
7299 static BcStatus bc_vm_exec(void)
7305 if (option_mask32 & BC_FLAG_L) {
7307 // We know that internal library is not buggy,
7308 // thus error checking is normally disabled.
7309 # define DEBUG_LIB 0
7310 bc_lex_file(&G.prs.l);
7311 s = bc_parse_text(&G.prs, bc_lib);
7312 if (DEBUG_LIB && s) return s;
7314 while (G.prs.l.t.t != BC_LEX_EOF) {
7315 s = G.prs.parse(&G.prs);
7316 if (DEBUG_LIB && s) return s;
7318 s = bc_program_exec();
7319 if (DEBUG_LIB && s) return s;
7323 s = BC_STATUS_SUCCESS;
7324 for (i = 0; !s && i < G.files.len; ++i)
7325 s = bc_vm_file(*((char **) bc_vec_item(&G.files, i)));
7326 if (ENABLE_FEATURE_CLEAN_UP && s && !G_ttyin) {
7327 // Debug config, non-interactive mode:
7328 // return all the way back to main.
7329 // Non-debug builds do not come here, they exit.
7333 if (IS_BC || (option_mask32 & BC_FLAG_I))
7336 if (!s && !BC_PARSE_CAN_EXEC(&G.prs))
7337 s = bc_vm_process("");
7342 #if ENABLE_FEATURE_CLEAN_UP
7343 static void bc_program_free(void)
7345 bc_num_free(&G.prog.ib);
7346 bc_num_free(&G.prog.ob);
7347 bc_num_free(&G.prog.hexb);
7349 bc_num_free(&G.prog.strmb);
7351 bc_vec_free(&G.prog.fns);
7352 bc_vec_free(&G.prog.fn_map);
7353 bc_vec_free(&G.prog.vars);
7354 bc_vec_free(&G.prog.var_map);
7355 bc_vec_free(&G.prog.arrs);
7356 bc_vec_free(&G.prog.arr_map);
7357 bc_vec_free(&G.prog.strs);
7358 bc_vec_free(&G.prog.consts);
7359 bc_vec_free(&G.prog.results);
7360 bc_vec_free(&G.prog.stack);
7361 bc_num_free(&G.prog.last);
7362 bc_num_free(&G.prog.zero);
7363 bc_num_free(&G.prog.one);
7366 static void bc_vm_free(void)
7368 bc_vec_free(&G.files);
7370 bc_parse_free(&G.prs);
7375 static void bc_program_init(void)
7380 /* memset(&G.prog, 0, sizeof(G.prog)); - already is */
7381 memset(&ip, 0, sizeof(BcInstPtr));
7383 /* G.prog.nchars = G.prog.scale = 0; - already is */
7384 bc_num_init_DEF_SIZE(&G.prog.ib);
7385 bc_num_ten(&G.prog.ib);
7388 bc_num_init_DEF_SIZE(&G.prog.ob);
7389 bc_num_ten(&G.prog.ob);
7392 bc_num_init_DEF_SIZE(&G.prog.hexb);
7393 bc_num_ten(&G.prog.hexb);
7394 G.prog.hexb.num[0] = 6;
7397 bc_num_init_DEF_SIZE(&G.prog.strmb);
7398 bc_num_ulong2num(&G.prog.strmb, UCHAR_MAX + 1);
7401 bc_num_init_DEF_SIZE(&G.prog.last);
7402 //bc_num_zero(&G.prog.last); - already is
7404 bc_num_init_DEF_SIZE(&G.prog.zero);
7405 //bc_num_zero(&G.prog.zero); - already is
7407 bc_num_init_DEF_SIZE(&G.prog.one);
7408 bc_num_one(&G.prog.one);
7410 bc_vec_init(&G.prog.fns, sizeof(BcFunc), bc_func_free);
7411 bc_vec_init(&G.prog.fn_map, sizeof(BcId), bc_id_free);
7413 bc_program_addFunc(xstrdup("(main)"), &idx);
7414 bc_program_addFunc(xstrdup("(read)"), &idx);
7416 bc_vec_init(&G.prog.vars, sizeof(BcVec), bc_vec_free);
7417 bc_vec_init(&G.prog.var_map, sizeof(BcId), bc_id_free);
7419 bc_vec_init(&G.prog.arrs, sizeof(BcVec), bc_vec_free);
7420 bc_vec_init(&G.prog.arr_map, sizeof(BcId), bc_id_free);
7422 bc_vec_init(&G.prog.strs, sizeof(char *), bc_string_free);
7423 bc_vec_init(&G.prog.consts, sizeof(char *), bc_string_free);
7424 bc_vec_init(&G.prog.results, sizeof(BcResult), bc_result_free);
7425 bc_vec_init(&G.prog.stack, sizeof(BcInstPtr), NULL);
7426 bc_vec_push(&G.prog.stack, &ip);
7429 static int bc_vm_init(const char *env_len)
7431 #if ENABLE_FEATURE_EDITING
7432 G.line_input_state = new_line_input_t(DO_HISTORY);
7434 G.prog.len = bc_vm_envLen(env_len);
7436 bc_vec_init(&G.files, sizeof(char *), NULL);
7438 IF_BC(bc_vm_envArgs();)
7441 IF_BC(bc_parse_init(&G.prs, BC_PROG_MAIN);)
7443 IF_DC(dc_parse_init(&G.prs, BC_PROG_MAIN);)
7447 #if ENABLE_FEATURE_BC_SIGNALS
7449 // With SA_RESTART, most system calls will restart
7450 // (IOW: they won't fail with EINTR).
7451 // In particular, this means ^C won't cause
7452 // stdout to get into "error state" if SIGINT hits
7453 // within write() syscall.
7454 // The downside is that ^C while line input is taken
7455 // will only be handled after [Enter] since read()
7456 // from stdin is not interrupted by ^C either,
7457 // it restarts, thus fgetc() does not return on ^C.
7458 signal_SA_RESTART_empty_mask(SIGINT, record_signo);
7460 // Without SA_RESTART, this exhibits a bug:
7461 // "while (1) print 1" and try ^C-ing it.
7462 // Intermittently, instead of returning to input line,
7463 // you'll get "output error: Interrupted system call"
7465 //signal_no_SA_RESTART_empty_mask(SIGINT, record_signo);
7469 return 0; // "not a tty"
7472 static BcStatus bc_vm_run(void)
7474 BcStatus st = bc_vm_exec();
7475 #if ENABLE_FEATURE_CLEAN_UP
7476 if (G_exiting) // it was actually "halt" or "quit"
7479 # if ENABLE_FEATURE_EDITING
7480 free_line_input_t(G.line_input_state);
7488 int bc_main(int argc, char **argv) MAIN_EXTERNALLY_VISIBLE;
7489 int bc_main(int argc UNUSED_PARAM, char **argv)
7494 G.sbgn = G.send = '"';
7496 is_tty = bc_vm_init("BC_LINE_LENGTH");
7500 if (is_tty && !(option_mask32 & BC_FLAG_Q))
7508 int dc_main(int argc, char **argv) MAIN_EXTERNALLY_VISIBLE;
7509 int dc_main(int argc UNUSED_PARAM, char **argv)
7517 * TODO: dc (GNU bc 1.07.1) 1.4.1 seems to use width
7518 * 1 char wider than bc from the same package.
7519 * Both default width, and xC_LINE_LENGTH=N are wider:
7520 * "DC_LINE_LENGTH=5 dc -e'123456 p'" prints:
7523 * "echo '123456' | BC_LINE_LENGTH=5 bc" prints:
7526 * Do the same, or it's a bug?
7528 bc_vm_init("DC_LINE_LENGTH");
7530 // Run -e'SCRIPT' and -fFILE in order of appearance, then handle FILEs
7531 noscript = BC_FLAG_I;
7533 int n = getopt(argc, argv, "e:f:x");
7539 n = bc_vm_process(optarg);
7547 option_mask32 |= DC_FLAG_X;
7557 bc_vec_push(&G.files, argv++);
7560 option_mask32 |= noscript; // set BC_FLAG_I if we need to interpret stdin
7566 #endif // not DC_SMALL