busybox/math.c

143 lines
2.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 <stdio.h>
#include <stdlib.h>
#include <unistd.h>
#include <math.h>
/* Tiny RPN calculator, because "expr" didn't give me bitwise operations. */
static const char math_usage[] = "math expression ...\n\n"
"This is a Tiny RPN calculator that understands the\n"
"following operations: +, -, /, *, and, or, not, eor.\n"
"i.e. 'math 2 2 add' -> 4, and 'math 8 8 \\* 2 2 + /' -> 16\n";
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))) {
1999-10-05 21:54:54 +05:30
fprintf(stderr, "math: stack overflow\n");
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) {
1999-10-05 21:54:54 +05:30
fprintf(stderr, "math: stack underflow\n");
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},
{"-", sub},
{"*", mul},
{"/", 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++;
}
fprintf(stderr, "math: %s: syntax error.\n", argument);
exit(-1);
}
int math_main(int argc, char **argv)
1999-10-05 21:54:54 +05:30
{
if (argc < 1 || *argv[1]=='-')
usage(math_usage);
while (argc >= 2) {
1999-10-05 21:54:54 +05:30
stack_machine(argv[1]);
argv++;
argc--;
}
stack_machine(0);
exit( TRUE);
1999-10-05 21:54:54 +05:30
}