busybox/dc.c

195 lines
3.2 KiB
C
Raw Normal View History

/* vi: set sw=4 ts=4: */
1999-10-05 21:54:54 +05:30
#include "internal.h"
#include <ctype.h>
1999-10-05 21:54:54 +05:30
#include <stdio.h>
#include <stdlib.h>
#include <unistd.h>
#include <math.h>
/* Tiny RPN calculator, because "expr" didn't give me bitwise operations. */
2000-06-22 01:47:29 +05:30
static const char dc_usage[] = "dc expression ...\n"
#ifndef BB_FEATURE_TRIVIAL_HELP
"\nThis is a Tiny RPN calculator that understands the\n"
"following operations: +, -, /, *, and, or, not, eor.\n"
2000-06-22 01:47:29 +05:30
"i.e. 'dc 2 2 add' -> 4, and 'dc 8 8 \\* 2 2 + /' -> 16\n"
#endif
;
1999-10-05 21:54:54 +05:30
static double stack[100];
static unsigned int pointer;
1999-10-05 21:54:54 +05:30
static void push(double a)
1999-10-05 21:54:54 +05:30
{
if (pointer >= (sizeof(stack) / sizeof(*stack))) {
2000-07-14 07:21:25 +05:30
errorMsg("stack overflow\n");
1999-10-05 21:54:54 +05:30
exit(-1);
} else
1999-10-05 21:54:54 +05:30
stack[pointer++] = a;
}
static double pop()
1999-10-05 21:54:54 +05:30
{
if (pointer == 0) {
2000-07-14 07:21:25 +05:30
errorMsg("stack underflow\n");
1999-10-05 21:54:54 +05:30
exit(-1);
}
return stack[--pointer];
}
static void add()
1999-10-05 21:54:54 +05:30
{
push(pop() + pop());
}
static void sub()
1999-10-05 21:54:54 +05:30
{
double subtrahend = pop();
1999-10-05 21:54:54 +05:30
push(pop() - subtrahend);
}
static void mul()
1999-10-05 21:54:54 +05:30
{
push(pop() * pop());
}
static void divide()
1999-10-05 21:54:54 +05:30
{
double divisor = pop();
1999-10-05 21:54:54 +05:30
push(pop() / divisor);
}
static void and()
1999-10-05 21:54:54 +05:30
{
push((unsigned int) pop() & (unsigned int) pop());
1999-10-05 21:54:54 +05:30
}
static void or()
1999-10-05 21:54:54 +05:30
{
push((unsigned int) pop() | (unsigned int) pop());
1999-10-05 21:54:54 +05:30
}
static void eor()
1999-10-05 21:54:54 +05:30
{
push((unsigned int) pop() ^ (unsigned int) pop());
1999-10-05 21:54:54 +05:30
}
static void not()
1999-10-05 21:54:54 +05:30
{
push(~(unsigned int) pop());
1999-10-05 21:54:54 +05:30
}
static void print()
1999-10-05 21:54:54 +05:30
{
printf("%g\n", pop());
}
struct op {
const char *name;
void (*function) ();
1999-10-05 21:54:54 +05:30
};
static const struct op operators[] = {
{"+", add},
{"add", add},
{"-", sub},
{"sub", sub},
{"*", mul},
{"mul", mul},
{"/", divide},
{"div", divide},
{"and", and},
{"or", or},
{"not", not},
{"eor", eor},
{0, 0}
1999-10-05 21:54:54 +05:30
};
static void stack_machine(const char *argument)
1999-10-05 21:54:54 +05:30
{
char *endPointer = 0;
double d;
const struct op *o = operators;
1999-10-05 21:54:54 +05:30
if (argument == 0) {
1999-10-05 21:54:54 +05:30
print();
return;
}
d = strtod(argument, &endPointer);
if (endPointer != argument) {
1999-10-05 21:54:54 +05:30
push(d);
return;
}
while (o->name != 0) {
if (strcmp(o->name, argument) == 0) {
(*(o->function)) ();
1999-10-05 21:54:54 +05:30
return;
}
o++;
}
2000-07-14 07:21:25 +05:30
errorMsg("%s: syntax error.\n", argument);
1999-10-05 21:54:54 +05:30
exit(-1);
}
/* 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 *start = NULL;
char *current = *buffer;
while (isspace(*current)) { current++; }
if (*current != 0) {
start = current;
while (!isspace(*current) && current != 0) { current++; }
*buffer = current;
}
return start;
}
/* In Perl one might say, scalar m|\s*(\S+)\s*|g */
static int number_of_tokens(char *buffer)
{
int i = 0;
char *b = buffer;
while (get_token(&b)) { i++; }
return i;
}
int dc_main(int argc, char **argv)
1999-10-05 21:54:54 +05:30
{
/* take stuff from stdin if no args are given */
if (argc <= 1) {
int i, len;
char *line = NULL;
char *cursor = NULL;
char *token = NULL;
while ((line = get_line_from_file(stdin))) {
cursor = line;
len = number_of_tokens(line);
for (i = 0; i < len; i++) {
token = get_token(&cursor);
*cursor++ = 0;
stack_machine(token);
}
free(line);
}
} else {
if (*argv[1]=='-')
usage(dc_usage);
while (argc >= 2) {
stack_machine(argv[1]);
argv++;
argc--;
}
1999-10-05 21:54:54 +05:30
}
stack_machine(0);
return( TRUE);
1999-10-05 21:54:54 +05:30
}