2000-02-09 01:28:47 +05:30
|
|
|
/* vi: set sw=4 ts=4: */
|
2006-07-12 13:26:04 +05:30
|
|
|
/*
|
2010-08-16 23:44:46 +05:30
|
|
|
* Licensed under GPLv2 or later, see file LICENSE in this source tree.
|
2006-07-12 13:26:04 +05:30
|
|
|
*/
|
|
|
|
|
2007-05-27 00:30:18 +05:30
|
|
|
#include "libbb.h"
|
1999-10-05 21:54:54 +05:30
|
|
|
#include <math.h>
|
|
|
|
|
2010-07-29 07:30:27 +05:30
|
|
|
//usage:#define dc_trivial_usage
|
2010-07-29 07:36:07 +05:30
|
|
|
//usage: "EXPRESSION..."
|
2010-07-29 07:30:27 +05:30
|
|
|
//usage:
|
|
|
|
//usage:#define dc_full_usage "\n\n"
|
|
|
|
//usage: "Tiny RPN calculator. Operations:\n"
|
2011-05-16 03:43:18 +05:30
|
|
|
//usage: "+, add, -, sub, *, mul, /, div, %, mod, "IF_FEATURE_DC_LIBM("**, exp, ")"and, or, not, eor,\n"
|
2010-07-29 07:30:27 +05:30
|
|
|
//usage: "p - print top of the stack (without popping),\n"
|
2010-07-29 07:36:07 +05:30
|
|
|
//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"
|
2010-07-29 07:30:27 +05:30
|
|
|
//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 21:54:54 +05:30
|
|
|
|
2007-03-24 19:36:51 +05:30
|
|
|
|
2008-03-17 14:59:43 +05:30
|
|
|
struct globals {
|
|
|
|
unsigned pointer;
|
|
|
|
unsigned base;
|
|
|
|
double stack[1];
|
2010-02-04 19:30:15 +05:30
|
|
|
} FIX_ALIASING;
|
2008-03-17 14:59:43 +05:30
|
|
|
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 )
|
2008-12-30 16:10:05 +05:30
|
|
|
#define INIT_G() do { \
|
|
|
|
base = 10; \
|
|
|
|
} while (0)
|
2008-03-17 14:59:43 +05:30
|
|
|
|
1999-10-05 21:54:54 +05:30
|
|
|
|
2000-02-09 01:28:47 +05:30
|
|
|
static void push(double a)
|
1999-10-05 21:54:54 +05:30
|
|
|
{
|
2007-03-24 19:36:51 +05:30
|
|
|
if (pointer >= STACK_SIZE)
|
2003-03-19 14:43:01 +05:30
|
|
|
bb_error_msg_and_die("stack overflow");
|
2000-12-01 08:25:13 +05:30
|
|
|
stack[pointer++] = a;
|
1999-10-05 21:54:54 +05:30
|
|
|
}
|
|
|
|
|
2001-12-06 08:59:37 +05:30
|
|
|
static double pop(void)
|
1999-10-05 21:54:54 +05:30
|
|
|
{
|
2000-12-01 08:25:13 +05:30
|
|
|
if (pointer == 0)
|
2003-03-19 14:43:01 +05:30
|
|
|
bb_error_msg_and_die("stack underflow");
|
1999-10-05 21:54:54 +05:30
|
|
|
return stack[--pointer];
|
|
|
|
}
|
|
|
|
|
2001-12-06 08:59:37 +05:30
|
|
|
static void add(void)
|
1999-10-05 21:54:54 +05:30
|
|
|
{
|
|
|
|
push(pop() + pop());
|
|
|
|
}
|
|
|
|
|
2001-12-06 08:59:37 +05:30
|
|
|
static void sub(void)
|
1999-10-05 21:54:54 +05:30
|
|
|
{
|
2000-02-09 01:28:47 +05:30
|
|
|
double subtrahend = pop();
|
1999-10-05 21:54:54 +05:30
|
|
|
|
|
|
|
push(pop() - subtrahend);
|
|
|
|
}
|
|
|
|
|
2001-12-06 08:59:37 +05:30
|
|
|
static void mul(void)
|
1999-10-05 21:54:54 +05:30
|
|
|
{
|
|
|
|
push(pop() * pop());
|
|
|
|
}
|
|
|
|
|
2008-10-20 14:13:10 +05:30
|
|
|
#if ENABLE_FEATURE_DC_LIBM
|
2003-10-22 16:54:39 +05:30
|
|
|
static void power(void)
|
|
|
|
{
|
|
|
|
double topower = pop();
|
|
|
|
|
|
|
|
push(pow(pop(), topower));
|
|
|
|
}
|
2008-10-20 14:13:10 +05:30
|
|
|
#endif
|
2003-10-22 16:54:39 +05:30
|
|
|
|
2001-12-06 08:59:37 +05:30
|
|
|
static void divide(void)
|
1999-10-05 21:54:54 +05:30
|
|
|
{
|
2000-02-09 01:28:47 +05:30
|
|
|
double divisor = pop();
|
|
|
|
|
1999-10-05 21:54:54 +05:30
|
|
|
push(pop() / divisor);
|
|
|
|
}
|
|
|
|
|
2003-10-22 16:54:39 +05:30
|
|
|
static void mod(void)
|
|
|
|
{
|
2010-07-29 07:30:27 +05:30
|
|
|
data_t d = pop();
|
2003-10-22 16:54:39 +05:30
|
|
|
|
2010-07-29 07:30:27 +05:30
|
|
|
push((data_t) pop() % d);
|
2003-10-22 16:54:39 +05:30
|
|
|
}
|
|
|
|
|
2001-12-06 08:59:37 +05:30
|
|
|
static void and(void)
|
1999-10-05 21:54:54 +05:30
|
|
|
{
|
2010-07-29 07:30:27 +05:30
|
|
|
push((data_t) pop() & (data_t) pop());
|
1999-10-05 21:54:54 +05:30
|
|
|
}
|
|
|
|
|
2001-12-06 08:59:37 +05:30
|
|
|
static void or(void)
|
1999-10-05 21:54:54 +05:30
|
|
|
{
|
2010-07-29 07:30:27 +05:30
|
|
|
push((data_t) pop() | (data_t) pop());
|
1999-10-05 21:54:54 +05:30
|
|
|
}
|
|
|
|
|
2001-12-06 08:59:37 +05:30
|
|
|
static void eor(void)
|
1999-10-05 21:54:54 +05:30
|
|
|
{
|
2010-07-29 07:30:27 +05:30
|
|
|
push((data_t) pop() ^ (data_t) pop());
|
1999-10-05 21:54:54 +05:30
|
|
|
}
|
|
|
|
|
2001-12-06 08:59:37 +05:30
|
|
|
static void not(void)
|
1999-10-05 21:54:54 +05:30
|
|
|
{
|
2010-07-29 07:30:27 +05:30
|
|
|
push(~(data_t) pop());
|
1999-10-05 21:54:54 +05:30
|
|
|
}
|
|
|
|
|
2002-12-12 16:01:53 +05:30
|
|
|
static void set_output_base(void)
|
|
|
|
{
|
2008-10-31 04:55:50 +05:30
|
|
|
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);
|
2007-03-24 19:36:51 +05:30
|
|
|
base = 10;
|
2002-12-12 16:01:53 +05:30
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
static void print_base(double print)
|
|
|
|
{
|
2010-07-29 07:30:27 +05:30
|
|
|
data_t x, i;
|
2008-10-31 04:55:50 +05:30
|
|
|
|
2010-07-29 07:30:27 +05:30
|
|
|
x = (data_t) print;
|
2008-10-31 04:55:50 +05:30
|
|
|
if (base == 10) {
|
2010-07-29 07:30:27 +05:30
|
|
|
if (x == print) /* exactly representable as unsigned integer */
|
|
|
|
printf("%"DATA_FMT"u\n", x);
|
|
|
|
else
|
|
|
|
printf("%g\n", print);
|
2008-10-31 04:55:50 +05:30
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
switch (base) {
|
|
|
|
case 16:
|
2010-07-29 07:30:27 +05:30
|
|
|
printf("%"DATA_FMT"x\n", x);
|
2008-10-31 04:55:50 +05:30
|
|
|
break;
|
|
|
|
case 8:
|
2010-07-29 07:30:27 +05:30
|
|
|
printf("%"DATA_FMT"o\n", x);
|
2008-10-31 04:55:50 +05:30
|
|
|
break;
|
|
|
|
default: /* base 2 */
|
2010-07-29 07:30:27 +05:30
|
|
|
i = MAXINT(data_t) - (MAXINT(data_t) >> 1);
|
|
|
|
/* i is 100000...00000 */
|
2008-10-31 04:55:50 +05:30
|
|
|
do {
|
2010-07-29 07:30:27 +05:30
|
|
|
if (x & i)
|
|
|
|
break;
|
2008-10-31 04:55:50 +05:30
|
|
|
i >>= 1;
|
|
|
|
} while (i > 1);
|
|
|
|
do {
|
|
|
|
bb_putchar('1' - !(x & i));
|
|
|
|
i >>= 1;
|
|
|
|
} while (i);
|
|
|
|
bb_putchar('\n');
|
|
|
|
}
|
2002-12-12 16:01:53 +05:30
|
|
|
}
|
|
|
|
|
|
|
|
static void print_stack_no_pop(void)
|
|
|
|
{
|
2008-03-17 14:59:43 +05:30
|
|
|
unsigned i = pointer;
|
2002-12-12 16:01:53 +05:30
|
|
|
while (i)
|
|
|
|
print_base(stack[--i]);
|
|
|
|
}
|
|
|
|
|
|
|
|
static void print_no_pop(void)
|
|
|
|
{
|
|
|
|
print_base(stack[pointer-1]);
|
|
|
|
}
|
|
|
|
|
1999-10-05 21:54:54 +05:30
|
|
|
struct op {
|
2007-03-24 19:36:51 +05:30
|
|
|
const char name[4];
|
2001-12-06 08:59:37 +05:30
|
|
|
void (*function) (void);
|
1999-10-05 21:54:54 +05:30
|
|
|
};
|
|
|
|
|
2000-02-09 01:28:47 +05:30
|
|
|
static const struct op operators[] = {
|
2000-06-21 23:30:46 +05:30
|
|
|
{"+", add},
|
|
|
|
{"add", add},
|
|
|
|
{"-", sub},
|
|
|
|
{"sub", sub},
|
|
|
|
{"*", mul},
|
|
|
|
{"mul", mul},
|
|
|
|
{"/", divide},
|
|
|
|
{"div", divide},
|
2008-10-20 14:13:10 +05:30
|
|
|
#if ENABLE_FEATURE_DC_LIBM
|
2003-10-22 16:54:39 +05:30
|
|
|
{"**", power},
|
|
|
|
{"exp", power},
|
|
|
|
{"pow", power},
|
2008-10-20 14:13:10 +05:30
|
|
|
#endif
|
2003-10-22 16:54:39 +05:30
|
|
|
{"%", mod},
|
|
|
|
{"mod", mod},
|
2000-02-09 01:28:47 +05:30
|
|
|
{"and", and},
|
2000-06-21 23:30:46 +05:30
|
|
|
{"or", or},
|
2000-04-15 22:04:54 +05:30
|
|
|
{"not", not},
|
|
|
|
{"eor", eor},
|
2003-10-22 16:54:39 +05:30
|
|
|
{"xor", eor},
|
2002-12-12 16:01:53 +05:30
|
|
|
{"p", print_no_pop},
|
|
|
|
{"f", print_stack_no_pop},
|
|
|
|
{"o", set_output_base},
|
2009-09-06 16:17:55 +05:30
|
|
|
{ "", NULL }
|
1999-10-05 21:54:54 +05:30
|
|
|
};
|
|
|
|
|
2000-02-09 01:28:47 +05:30
|
|
|
static void stack_machine(const char *argument)
|
1999-10-05 21:54:54 +05:30
|
|
|
{
|
2008-03-17 14:59:43 +05:30
|
|
|
char *endPointer;
|
2000-02-09 01:28:47 +05:30
|
|
|
double d;
|
|
|
|
const struct op *o = operators;
|
1999-10-05 21:54:54 +05:30
|
|
|
|
|
|
|
d = strtod(argument, &endPointer);
|
|
|
|
|
2009-12-30 23:07:08 +05:30
|
|
|
if (endPointer != argument && *endPointer == '\0') {
|
1999-10-05 21:54:54 +05:30
|
|
|
push(d);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
2009-12-30 23:07:08 +05:30
|
|
|
while (o->function) {
|
2000-02-09 01:28:47 +05:30
|
|
|
if (strcmp(o->name, argument) == 0) {
|
2007-03-24 19:36:51 +05:30
|
|
|
o->function();
|
1999-10-05 21:54:54 +05:30
|
|
|
return;
|
|
|
|
}
|
|
|
|
o++;
|
|
|
|
}
|
2009-12-30 23:07:08 +05:30
|
|
|
bb_error_msg_and_die("syntax error at '%s'", argument);
|
1999-10-05 21:54:54 +05:30
|
|
|
}
|
|
|
|
|
2000-06-13 04:29:12 +05:30
|
|
|
/* return pointer to next token in buffer and set *buffer to one char
|
2004-03-15 13:59:22 +05:30
|
|
|
* past the end of the above mentioned token
|
2000-06-13 04:29:12 +05:30
|
|
|
*/
|
|
|
|
static char *get_token(char **buffer)
|
|
|
|
{
|
2008-03-17 14:59:43 +05:30
|
|
|
char *current = skip_whitespace(*buffer);
|
|
|
|
if (*current != '\0') {
|
|
|
|
*buffer = skip_non_whitespace(current);
|
|
|
|
return current;
|
2000-06-13 04:29:12 +05:30
|
|
|
}
|
2008-03-17 14:59:43 +05:30
|
|
|
return NULL;
|
2000-06-13 04:29:12 +05:30
|
|
|
}
|
|
|
|
|
2007-10-11 15:35:36 +05:30
|
|
|
int dc_main(int argc, char **argv) MAIN_EXTERNALLY_VISIBLE;
|
2008-07-05 14:48:54 +05:30
|
|
|
int dc_main(int argc UNUSED_PARAM, char **argv)
|
2008-03-17 14:59:43 +05:30
|
|
|
{
|
2008-03-17 15:03:45 +05:30
|
|
|
INIT_G();
|
|
|
|
|
2008-03-17 14:59:43 +05:30
|
|
|
argv++;
|
|
|
|
if (!argv[0]) {
|
|
|
|
/* take stuff from stdin if no args are given */
|
|
|
|
char *line;
|
|
|
|
char *cursor;
|
|
|
|
char *token;
|
2008-03-27 01:34:27 +05:30
|
|
|
while ((line = xmalloc_fgetline(stdin)) != NULL) {
|
2000-06-13 04:29:12 +05:30
|
|
|
cursor = line;
|
2008-03-17 14:59:43 +05:30
|
|
|
while (1) {
|
2000-06-13 04:29:12 +05:30
|
|
|
token = get_token(&cursor);
|
2009-12-30 23:07:08 +05:30
|
|
|
if (!token)
|
|
|
|
break;
|
2008-03-17 14:59:43 +05:30
|
|
|
*cursor++ = '\0';
|
2000-06-13 04:29:12 +05:30
|
|
|
stack_machine(token);
|
|
|
|
}
|
|
|
|
free(line);
|
|
|
|
}
|
|
|
|
} else {
|
2009-12-30 23:07:08 +05:30
|
|
|
// why? it breaks "dc -2 2 * p"
|
|
|
|
//if (argv[0][0] == '-')
|
|
|
|
// bb_show_usage();
|
2008-03-17 14:59:43 +05:30
|
|
|
do {
|
|
|
|
stack_machine(*argv);
|
|
|
|
} while (*++argv);
|
1999-10-05 21:54:54 +05:30
|
|
|
}
|
2000-12-01 08:25:13 +05:30
|
|
|
return EXIT_SUCCESS;
|
1999-10-05 21:54:54 +05:30
|
|
|
}
|