X-Git-Url: https://git.librecmc.org/?a=blobdiff_plain;f=miscutils%2Fdc.c;h=6903761e4f4b9983a7c31c5331fd5ce73aafae88;hb=604499e5a93d8055a761e968b12d6a0907bc3d0a;hp=31a5471c30e1752721a99e87c60c6fd39ad2ebf0;hpb=7ac06a3ff12b800af7b5e5e97377695a628a8856;p=oweals%2Fbusybox.git diff --git a/miscutils/dc.c b/miscutils/dc.c index 31a5471c3..6903761e4 100644 --- a/miscutils/dc.c +++ b/miscutils/dc.c @@ -1,94 +1,198 @@ /* vi: set sw=4 ts=4: */ -#include "internal.h" -#include -#include -#include -#include +/* + * Licensed under GPLv2 or later, see file LICENSE in this source tree. + */ + +#include "libbb.h" #include -/* Tiny RPN calculator, because "expr" didn't give me bitwise operations. */ +//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, "IF_FEATURE_DC_LIBM("**, 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 p' -> 4, 'dc 8 8 * 2 2 + / p' -> 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" -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" - "i.e. 'dc 2 2 add' -> 4, and 'dc 8 8 \\* 2 2 + /' -> 16\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 - ; -static double stack[100]; -static unsigned int pointer; + +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) + static void push(double a) { - if (pointer >= (sizeof(stack) / sizeof(*stack))) { - fprintf(stderr, "dc: stack overflow\n"); - exit(-1); - } else - stack[pointer++] = a; + if (pointer >= STACK_SIZE) + bb_error_msg_and_die("stack overflow"); + stack[pointer++] = a; } -static double pop() +static double pop(void) { - if (pointer == 0) { - fprintf(stderr, "dc: stack underflow\n"); - exit(-1); - } + if (pointer == 0) + bb_error_msg_and_die("stack underflow"); return stack[--pointer]; } -static void add() +static void add(void) { push(pop() + pop()); } -static void sub() +static void sub(void) { double subtrahend = pop(); push(pop() - subtrahend); } -static void mul() +static void mul(void) { push(pop() * pop()); } -static void divide() +#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 and() +static void mod(void) +{ + data_t d = pop(); + + push((data_t) pop() % d); +} + +static void and(void) { - push((unsigned int) pop() & (unsigned int) pop()); + push((data_t) pop() & (data_t) pop()); } -static void or() +static void or(void) { - push((unsigned int) pop() | (unsigned int) pop()); + push((data_t) pop() | (data_t) pop()); } -static void eor() +static void eor(void) { - push((unsigned int) pop() ^ (unsigned int) pop()); + push((data_t) pop() ^ (data_t) pop()); } -static void not() +static void not(void) { - push(~(unsigned int) pop()); + push(~(data_t) pop()); } -static void print() +static void set_output_base(void) { - printf("%g\n", pop()); + 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]); } struct op { - const char *name; - void (*function) (); + const char name[4]; + void (*function) (void); }; static const struct op operators[] = { @@ -100,95 +204,78 @@ static const struct op operators[] = { {"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}, - {0, 0} + {"xor", eor}, + {"p", print_no_pop}, + {"f", print_stack_no_pop}, + {"o", set_output_base}, + { "", NULL } }; static void stack_machine(const char *argument) { - char *endPointer = 0; + char *endPointer; double d; const struct op *o = operators; - if (argument == 0) { - print(); - return; - } - d = strtod(argument, &endPointer); - if (endPointer != argument) { + if (endPointer != argument && *endPointer == '\0') { push(d); return; } - while (o->name != 0) { + while (o->function) { if (strcmp(o->name, argument) == 0) { - (*(o->function)) (); + o->function(); return; } o++; } - fprintf(stderr, "dc: %s: syntax error.\n", argument); - 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; + bb_error_msg_and_die("syntax error at '%s'", argument); } -/* In Perl one might say, scalar m|\s*(\S+)\s*|g */ -static int number_of_tokens(char *buffer) +int dc_main(int argc, char **argv) MAIN_EXTERNALLY_VISIBLE; +int dc_main(int argc UNUSED_PARAM, char **argv) { - int i = 0; - char *b = buffer; - while (get_token(&b)) { i++; } - return i; -} + INIT_G(); -int dc_main(int argc, char **argv) -{ - /* 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 = cstring_lineFromFile(stdin))) { + 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; - len = number_of_tokens(line); - for (i = 0; i < len; i++) { - token = get_token(&cursor); - *cursor++ = 0; + while (1) { + token = skip_whitespace(cursor); + if (*token == '\0') + break; + cursor = skip_non_whitespace(token); + if (*cursor != '\0') + *cursor++ = '\0'; stack_machine(token); } free(line); } } else { - if (*argv[1]=='-') - usage(dc_usage); - while (argc >= 2) { - stack_machine(argv[1]); - argv++; - argc--; - } + // why? it breaks "dc -2 2 + p" + //if (argv[0][0] == '-') + // bb_show_usage(); + do { + stack_machine(*argv); + } while (*++argv); } - stack_machine(0); - return( TRUE); + return EXIT_SUCCESS; }