1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306
|
/* vi: set sw=4 ts=4: */
/*
* Licensed under GPLv2 or later, see file LICENSE in this source tree.
*/
/* config/applet/usage bits are in bc.c */
//#include "libbb.h"
//#include "common_bufsiz.h"
#include <math.h>
#if 0
typedef unsigned data_t;
#define DATA_FMT ""
#elif 0
typedef unsigned long data_t;
#define DATA_FMT "l"
#else
typedef unsigned long long data_t;
#define DATA_FMT "ll"
#endif
struct globals {
unsigned pointer;
unsigned base;
double stack[1];
} FIX_ALIASING;
enum { STACK_SIZE = (COMMON_BUFSIZE - offsetof(struct globals, stack)) / sizeof(double) };
#define G (*(struct globals*)bb_common_bufsiz1)
#define pointer (G.pointer )
#define base (G.base )
#define stack (G.stack )
#define INIT_G() do { \
setup_common_bufsiz(); \
base = 10; \
} while (0)
static unsigned check_under(void)
{
unsigned p = pointer;
if (p == 0)
bb_simple_error_msg_and_die("stack underflow");
return p - 1;
}
static void push(double a)
{
if (pointer >= STACK_SIZE)
bb_simple_error_msg_and_die("stack overflow");
stack[pointer++] = a;
}
static double pop(void)
{
unsigned p = check_under();
pointer = p;
return stack[p];
}
static void add(void)
{
push(pop() + pop());
}
static void sub(void)
{
double subtrahend = pop();
push(pop() - subtrahend);
}
static void mul(void)
{
push(pop() * pop());
}
#if ENABLE_FEATURE_DC_LIBM
static void power(void)
{
double topower = pop();
push(pow(pop(), topower));
}
#endif
static void divide(void)
{
double divisor = pop();
push(pop() / divisor);
}
static void mod(void)
{
data_t d = pop();
/* compat with dc (GNU bc 1.07.1) 1.4.1:
* $ dc -e '4 0 % p'
* dc: remainder by zero
* 0
*/
if (d == 0) {
bb_simple_error_msg("remainder by zero");
pop();
push(0);
return;
}
/* ^^^^ without this, we simply get SIGFPE and die */
push((data_t) pop() % d);
}
static void and(void)
{
push((data_t) pop() & (data_t) pop());
}
static void or(void)
{
push((data_t) pop() | (data_t) pop());
}
static void eor(void)
{
push((data_t) pop() ^ (data_t) pop());
}
static void not(void)
{
push(~(data_t) pop());
}
static void set_output_base(void)
{
static const char bases[] ALIGN1 = { 2, 8, 10, 16, 0 };
unsigned b = (unsigned)pop();
base = *strchrnul(bases, b);
if (base == 0) {
bb_error_msg("error, base %u is not supported", b);
base = 10;
}
}
static void print_base(double print)
{
data_t x, i;
x = (data_t) print;
if (base == 10) {
if (x == print) /* exactly representable as unsigned integer */
printf("%"DATA_FMT"u\n", x);
else
printf("%g\n", print);
return;
}
switch (base) {
case 16:
printf("%"DATA_FMT"x\n", x);
break;
case 8:
printf("%"DATA_FMT"o\n", x);
break;
default: /* base 2 */
i = MAXINT(data_t) - (MAXINT(data_t) >> 1);
/* i is 100000...00000 */
do {
if (x & i)
break;
i >>= 1;
} while (i > 1);
do {
bb_putchar('1' - !(x & i));
i >>= 1;
} while (i);
bb_putchar('\n');
}
}
static void print_stack_no_pop(void)
{
unsigned i = pointer;
while (i)
print_base(stack[--i]);
}
static void print_no_pop(void)
{
print_base(stack[check_under()]);
}
struct op {
const char name[4];
void (*function) (void);
};
static const struct op operators[] ALIGN_PTR = {
#if ENABLE_FEATURE_DC_LIBM
{"^", power},
// {"exp", power},
// {"pow", power},
#endif
{"%", mod},
// {"mod", mod},
// logic ops are not standard, remove?
{"and", and},
{"or", or},
{"not", not},
{"xor", eor},
{"+", add},
// {"add", add},
{"-", sub},
// {"sub", sub},
{"*", mul},
// {"mul", mul},
{"/", divide},
// {"div", divide},
{"p", print_no_pop},
{"f", print_stack_no_pop},
{"o", set_output_base},
};
/* Feed the stack machine */
static void stack_machine(const char *argument)
{
char *end;
double number;
const struct op *o;
next:
//TODO: needs setlocale(LC_NUMERIC, "C")?
number = strtod(argument, &end);
if (end != argument) {
argument = end;
push(number);
goto next;
}
/* We might have matched a digit, eventually advance the argument */
argument = skip_whitespace(argument);
if (*argument == '\0')
return;
o = operators;
do {
char *after_name = is_prefixed_with(argument, o->name);
if (after_name) {
argument = after_name;
o->function();
goto next;
}
o++;
} while (o != operators + ARRAY_SIZE(operators));
bb_error_msg_and_die("syntax error at '%s'", argument);
}
static void process_file(FILE *fp)
{
char *line;
while ((line = xmalloc_fgetline(fp)) != NULL) {
stack_machine(line);
free(line);
}
}
int dc_main(int argc, char **argv) MAIN_EXTERNALLY_VISIBLE;
int dc_main(int argc UNUSED_PARAM, char **argv)
{
bool script = 0;
INIT_G();
/* Run -e'SCRIPT' and -fFILE in order of appearance, then handle FILEs */
for (;;) {
int n = getopt(argc, argv, "e:f:");
if (n <= 0)
break;
switch (n) {
case 'e':
script = 1;
stack_machine(optarg);
break;
case 'f':
script = 1;
process_file(xfopen_for_read(optarg));
break;
default:
bb_show_usage();
}
}
argv += optind;
if (*argv) {
do
process_file(xfopen_for_read(*argv++));
while (*argv);
} else if (!script) {
/* Take stuff from stdin if no args are given */
process_file(stdin);
}
return EXIT_SUCCESS;
}
|