hush/miscutils/dc.c

293 lines
5.2 KiB
C
Raw Normal View History

/* vi: set sw=4 ts=4: */
/*
* Licensed under GPLv2 or later, see file LICENSE in this source tree.
*/
#include "libbb.h"
1999-10-05 16:24:54 +00:00
#include <math.h>
//usage:#define dc_trivial_usage
//usage: "EXPRESSION..."
//usage:
//usage:#define dc_full_usage "\n\n"
//usage: "Tiny RPN calculator. Operations:\n"
//usage: "+, add, -, sub, *, mul, /, div, %, mod, **, exp, and, or, not, eor,\n"
//usage: "p - print top of the stack (without popping),\n"
//usage: "f - print entire stack,\n"
//usage: "o - pop the value and set output radix (must be 10, 16, 8 or 2).\n"
//usage: "Examples: 'dc 2 2 add' -> 4, 'dc 8 8 * 2 2 + /' -> 16"
//usage:
//usage:#define dc_example_usage
//usage: "$ dc 2 2 + p\n"
//usage: "4\n"
//usage: "$ dc 8 8 \\* 2 2 + / p\n"
//usage: "16\n"
//usage: "$ dc 0 1 and p\n"
//usage: "0\n"
//usage: "$ dc 0 1 or p\n"
//usage: "1\n"
//usage: "$ echo 72 9 div 8 mul p | dc\n"
//usage: "64\n"
#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
1999-10-05 16:24:54 +00:00
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 { \
base = 10; \
} while (0)
1999-10-05 16:24:54 +00:00
static void push(double a)
1999-10-05 16:24:54 +00:00
{
if (pointer >= STACK_SIZE)
2003-03-19 09:13:01 +00:00
bb_error_msg_and_die("stack overflow");
stack[pointer++] = a;
1999-10-05 16:24:54 +00:00
}
2001-12-06 03:29:37 +00:00
static double pop(void)
1999-10-05 16:24:54 +00:00
{
if (pointer == 0)
2003-03-19 09:13:01 +00:00
bb_error_msg_and_die("stack underflow");
1999-10-05 16:24:54 +00:00
return stack[--pointer];
}
2001-12-06 03:29:37 +00:00
static void add(void)
1999-10-05 16:24:54 +00:00
{
push(pop() + pop());
}
2001-12-06 03:29:37 +00:00
static void sub(void)
1999-10-05 16:24:54 +00:00
{
double subtrahend = pop();
1999-10-05 16:24:54 +00:00
push(pop() - subtrahend);
}
2001-12-06 03:29:37 +00:00
static void mul(void)
1999-10-05 16:24:54 +00:00
{
push(pop() * pop());
}
#if ENABLE_FEATURE_DC_LIBM
static void power(void)
{
double topower = pop();
push(pow(pop(), topower));
}
#endif
2001-12-06 03:29:37 +00:00
static void divide(void)
1999-10-05 16:24:54 +00:00
{
double divisor = pop();
1999-10-05 16:24:54 +00:00
push(pop() / divisor);
}
static void mod(void)
{
data_t d = pop();
push((data_t) pop() % d);
}
2001-12-06 03:29:37 +00:00
static void and(void)
1999-10-05 16:24:54 +00:00
{
push((data_t) pop() & (data_t) pop());
1999-10-05 16:24:54 +00:00
}
2001-12-06 03:29:37 +00:00
static void or(void)
1999-10-05 16:24:54 +00:00
{
push((data_t) pop() | (data_t) pop());
1999-10-05 16:24:54 +00:00
}
2001-12-06 03:29:37 +00:00
static void eor(void)
1999-10-05 16:24:54 +00:00
{
push((data_t) pop() ^ (data_t) pop());
1999-10-05 16:24:54 +00:00
}
2001-12-06 03:29:37 +00:00
static void not(void)
1999-10-05 16:24:54 +00:00
{
push(~(data_t) pop());
1999-10-05 16:24:54 +00:00
}
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[pointer-1]);
}
1999-10-05 16:24:54 +00:00
struct op {
const char name[4];
2001-12-06 03:29:37 +00:00
void (*function) (void);
1999-10-05 16:24:54 +00:00
};
static const struct op operators[] = {
{"+", add},
{"add", add},
{"-", sub},
{"sub", sub},
{"*", mul},
{"mul", mul},
{"/", divide},
{"div", divide},
#if ENABLE_FEATURE_DC_LIBM
{"**", power},
{"exp", power},
{"pow", power},
#endif
{"%", mod},
{"mod", mod},
{"and", and},
{"or", or},
{"not", not},
{"eor", eor},
{"xor", eor},
{"p", print_no_pop},
{"f", print_stack_no_pop},
{"o", set_output_base},
{ "", NULL }
1999-10-05 16:24:54 +00:00
};
static void stack_machine(const char *argument)
1999-10-05 16:24:54 +00:00
{
char *endPointer;
double d;
const struct op *o = operators;
1999-10-05 16:24:54 +00:00
d = strtod(argument, &endPointer);
if (endPointer != argument && *endPointer == '\0') {
1999-10-05 16:24:54 +00:00
push(d);
return;
}
while (o->function) {
if (strcmp(o->name, argument) == 0) {
o->function();
1999-10-05 16:24:54 +00:00
return;
}
o++;
}
bb_error_msg_and_die("syntax error at '%s'", argument);
1999-10-05 16:24:54 +00:00
}
/* return pointer to next token in buffer and set *buffer to one char
* past the end of the above mentioned token
*/
static char *get_token(char **buffer)
{
char *current = skip_whitespace(*buffer);
if (*current != '\0') {
*buffer = skip_non_whitespace(current);
return current;
}
return NULL;
}
int dc_main(int argc, char **argv) MAIN_EXTERNALLY_VISIBLE;
2008-07-05 09:18:54 +00:00
int dc_main(int argc UNUSED_PARAM, char **argv)
{
INIT_G();
argv++;
if (!argv[0]) {
/* take stuff from stdin if no args are given */
char *line;
char *cursor;
char *token;
while ((line = xmalloc_fgetline(stdin)) != NULL) {
cursor = line;
while (1) {
token = get_token(&cursor);
if (!token)
break;
*cursor++ = '\0';
stack_machine(token);
}
free(line);
}
} else {
// why? it breaks "dc -2 2 * p"
//if (argv[0][0] == '-')
// bb_show_usage();
do {
stack_machine(*argv);
} while (*++argv);
1999-10-05 16:24:54 +00:00
}
return EXIT_SUCCESS;
1999-10-05 16:24:54 +00:00
}