X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Ftv%2Fstrcalc.c;h=9d9ee6e695f0f24f1461aa59fc76ab61383d6e6b;hb=34e3b8d50bce639e760da7233524a4db85c80290;hp=d682979cd2a6e0a98bf35078da8ae1d50a4b3d03;hpb=ca0508a081617b4b04e9e9f85a6127bd01fad96c;p=libfirm diff --git a/ir/tv/strcalc.c b/ir/tv/strcalc.c index d682979cd..9d9ee6e69 100644 --- a/ir/tv/strcalc.c +++ b/ir/tv/strcalc.c @@ -1,65 +1,38 @@ /* - * Project: libFIRM - * File name: ir/tv/strcalc.c - * Purpose: - * Author: Mathias Heil - * Modified by: - * Created: - * CVS-ID: $Id$ - * Copyright: (c) 2003 Universität Karlsruhe - * Licence: This file protected by GPL - GNU GENERAL PUBLIC LICENSE. + * This file is part of libFirm. + * Copyright (C) 2012 University of Karlsruhe. */ +/** + * @file + * @brief Provides basic mathematical operations on values represented as strings. + * @date 2003 + * @author Mathias Heil + */ +#include "config.h" -#ifdef HAVE_CONFIG_H -# include "config.h" -#endif - -#ifdef HAVE_STDLIB_H -# include -#endif -#ifdef HAVE_ALLOCA_H -# include -#endif -#ifdef HAVE_MALLOC_H -# include -#endif -#ifdef HAVE_STRING_H -# include /* memset/memcmp */ -#endif -#include /* assertions */ -#include /* output for error messages */ -#include /* definition of LONG_MIN, used in sc_get_val_from_long */ +#include +#include +#include +#include +#include #include "strcalc.h" +#include "xmalloc.h" +#include "error.h" /* * local definitions and macros */ +#define SC_BITS 4 +#define SC_RESULT(x) ((x) & ((1U << SC_BITS) - 1U)) +#define SC_CARRY(x) ((unsigned)(x) >> SC_BITS) + #define CLEAR_BUFFER(b) assert(b); memset(b, SC_0, calc_buffer_size) +#define SHIFT(count) (SC_1 << (count)) #define _val(a) ((a)-SC_0) #define _digit(a) ((a)+SC_0) -#define _bitisset(digit, pos) (and_table[_val(digit)][_val(shift_table[pos])] != SC_0) - -#define fail_char(a, b, c, d) _fail_char((a), (b), (c), (d), __FILE__, __LINE__) - -/* shortcut output for debugging */ -# define sc_print_hex(a) sc_print((a), 0, SC_HEX) -# define sc_print_dec(a) sc_print((a), 0, SC_DEC) -# define sc_print_oct(a) sc_print((a), 0, SC_OCT) -# define sc_print_bin(a) sc_print((a), 0, SC_BIN) - -#ifdef STRCALC_DEBUG_PRINTCOMP -# define DEBUGPRINTF_COMPUTATION(x) printf x -#else -# define DEBUGPRINTF_COMPUTATION(x) ((void)0) -#endif -#ifdef STRCALC_DEBUG -# define DEBUGPRINTF(x) printf x -#else -# define DEBUGPRINTF(x) ((void)0) -#endif - +#define _bitisset(digit, pos) (((digit) & SHIFT(pos)) != SC_0) /* * private variables @@ -76,327 +49,11 @@ static int carry_flag; /**< some computation set the carry_flag: However, the meaning of carry is machine dependent and often defined in other ways! */ -static const char sex_digit[4] = { SC_F, SC_E, SC_C, SC_8 }; +static const char sex_digit[4] = { SC_E, SC_C, SC_8, SC_0 }; +static const char zex_digit[4] = { SC_1, SC_3, SC_7, SC_F }; static const char max_digit[4] = { SC_0, SC_1, SC_3, SC_7 }; static const char min_digit[4] = { SC_F, SC_E, SC_C, SC_8 }; -static const char not_table[16] = { SC_F, SC_E, SC_D, SC_C, SC_B, SC_A, SC_9, SC_8, - SC_7, SC_6, SC_5, SC_4, SC_3, SC_2, SC_1, SC_0 }; - -static const char shift_table[4] = { SC_1, SC_2, SC_4, SC_8 }; - -static const char and_table[16][16] = { - { SC_0, SC_0, SC_0, SC_0, SC_0, SC_0, SC_0, SC_0, - SC_0, SC_0, SC_0, SC_0, SC_0, SC_0, SC_0, SC_0 }, - - { SC_0, SC_1, SC_0, SC_1, SC_0, SC_1, SC_0, SC_1, - SC_0, SC_1, SC_0, SC_1, SC_0, SC_1, SC_0, SC_1 }, - - { SC_0, SC_0, SC_2, SC_2, SC_0, SC_0, SC_2, SC_2, - SC_0, SC_0, SC_2, SC_2, SC_0, SC_0, SC_2, SC_2 }, - - { SC_0, SC_1, SC_2, SC_3, SC_0, SC_1, SC_2, SC_3, - SC_0, SC_1, SC_2, SC_3, SC_0, SC_1, SC_2, SC_3 }, - - { SC_0, SC_0, SC_0, SC_0, SC_4, SC_4, SC_4, SC_4, - SC_0, SC_0, SC_0, SC_0, SC_4, SC_4, SC_4, SC_4 }, - - { SC_0, SC_1, SC_0, SC_1, SC_4, SC_5, SC_4, SC_5, - SC_0, SC_1, SC_0, SC_1, SC_4, SC_5, SC_4, SC_5 }, - - { SC_0, SC_0, SC_2, SC_2, SC_4, SC_4, SC_6, SC_6, - SC_0, SC_0, SC_2, SC_2, SC_4, SC_4, SC_6, SC_6 }, - - { SC_0, SC_1, SC_2, SC_3, SC_4, SC_5, SC_6, SC_7, - SC_0, SC_1, SC_2, SC_3, SC_4, SC_5, SC_6, SC_7 }, - - { SC_0, SC_0, SC_0, SC_0, SC_0, SC_0, SC_0, SC_0, - SC_8, SC_8, SC_8, SC_8, SC_8, SC_8, SC_8, SC_8 }, - - { SC_0, SC_1, SC_0, SC_1, SC_0, SC_1, SC_0, SC_1, - SC_8, SC_9, SC_8, SC_9, SC_8, SC_9, SC_8, SC_9 }, - - { SC_0, SC_0, SC_2, SC_2, SC_0, SC_0, SC_2, SC_2, - SC_8, SC_8, SC_A, SC_A, SC_8, SC_8, SC_A, SC_A }, - - { SC_0, SC_1, SC_2, SC_3, SC_0, SC_1, SC_2, SC_3, - SC_8, SC_9, SC_A, SC_B, SC_8, SC_9, SC_A, SC_B }, - - { SC_0, SC_0, SC_0, SC_0, SC_4, SC_4, SC_4, SC_4, - SC_8, SC_8, SC_8, SC_8, SC_C, SC_C, SC_C, SC_C }, - - { SC_0, SC_1, SC_0, SC_1, SC_4, SC_5, SC_4, SC_5, - SC_8, SC_9, SC_8, SC_9, SC_C, SC_D, SC_C, SC_D }, - - { SC_0, SC_0, SC_2, SC_2, SC_4, SC_4, SC_6, SC_6, - SC_8, SC_8, SC_A, SC_A, SC_C, SC_C, SC_E, SC_E }, - - { SC_0, SC_1, SC_2, SC_3, SC_4, SC_5, SC_6, SC_7, - SC_8, SC_9, SC_A, SC_B, SC_C, SC_D, SC_E, SC_F } }; - -static const char or_table[16][16] = { - { SC_0, SC_1, SC_2, SC_3, SC_4, SC_5, SC_6, SC_7, - SC_8, SC_9, SC_A, SC_B, SC_C, SC_D, SC_E, SC_F }, - - { SC_1, SC_1, SC_3, SC_3, SC_5, SC_5, SC_7, SC_7, - SC_9, SC_9, SC_B, SC_B, SC_D, SC_D, SC_F, SC_F }, - - { SC_2, SC_3, SC_2, SC_3, SC_6, SC_7, SC_6, SC_7, - SC_A, SC_B, SC_A, SC_B, SC_E, SC_F, SC_E, SC_F }, - - { SC_3, SC_3, SC_3, SC_3, SC_7, SC_7, SC_7, SC_7, - SC_B, SC_B, SC_B, SC_B, SC_F, SC_F, SC_F, SC_F }, - - { SC_4, SC_5, SC_6, SC_7, SC_4, SC_5, SC_6, SC_7, - SC_C, SC_D, SC_E, SC_F, SC_C, SC_D, SC_E, SC_F }, - - { SC_5, SC_5, SC_7, SC_7, SC_5, SC_5, SC_7, SC_7, - SC_D, SC_D, SC_F, SC_F, SC_D, SC_D, SC_F, SC_F }, - - { SC_6, SC_7, SC_6, SC_7, SC_6, SC_7, SC_6, SC_7, - SC_E, SC_F, SC_E, SC_F, SC_E, SC_F, SC_E, SC_F }, - - { SC_7, SC_7, SC_7, SC_7, SC_7, SC_7, SC_7, SC_7, - SC_F, SC_F, SC_F, SC_F, SC_F, SC_F, SC_F, SC_F }, - - { SC_8, SC_9, SC_A, SC_B, SC_C, SC_D, SC_E, SC_F, - SC_8, SC_9, SC_A, SC_B, SC_C, SC_D, SC_E, SC_F }, - - { SC_9, SC_9, SC_B, SC_B, SC_D, SC_D, SC_F, SC_F, - SC_9, SC_9, SC_B, SC_B, SC_D, SC_D, SC_F, SC_F }, - - { SC_A, SC_B, SC_A, SC_B, SC_E, SC_F, SC_E, SC_F, - SC_A, SC_B, SC_A, SC_B, SC_E, SC_F, SC_E, SC_F }, - - { SC_B, SC_B, SC_B, SC_B, SC_F, SC_F, SC_F, SC_F, - SC_B, SC_B, SC_B, SC_B, SC_F, SC_F, SC_F, SC_F }, - - { SC_C, SC_D, SC_E, SC_F, SC_C, SC_D, SC_E, SC_F, - SC_C, SC_D, SC_E, SC_F, SC_C, SC_D, SC_E, SC_F }, - - { SC_D, SC_D, SC_F, SC_F, SC_D, SC_D, SC_F, SC_F, - SC_D, SC_D, SC_F, SC_F, SC_D, SC_D, SC_F, SC_F }, - - { SC_E, SC_F, SC_E, SC_F, SC_E, SC_F, SC_E, SC_F, - SC_E, SC_F, SC_E, SC_F, SC_E, SC_F, SC_E, SC_F }, - - { SC_F, SC_F, SC_F, SC_F, SC_F, SC_F, SC_F, SC_F, - SC_F, SC_F, SC_F, SC_F, SC_F, SC_F, SC_F, SC_F } }; - -static char const xor_table[16][16] = { - { SC_0, SC_1, SC_2, SC_3, SC_4, SC_5, SC_6, SC_7, - SC_8, SC_9, SC_A, SC_B, SC_C, SC_D, SC_E, SC_F }, - - { SC_1, SC_0, SC_3, SC_2, SC_5, SC_4, SC_7, SC_6, - SC_9, SC_8, SC_B, SC_A, SC_D, SC_C, SC_F, SC_E }, - - { SC_2, SC_3, SC_0, SC_1, SC_6, SC_7, SC_4, SC_5, - SC_A, SC_B, SC_8, SC_9, SC_E, SC_F, SC_C, SC_D }, - - { SC_3, SC_2, SC_1, SC_0, SC_7, SC_6, SC_5, SC_4, - SC_B, SC_A, SC_9, SC_8, SC_F, SC_E, SC_D, SC_C }, - - { SC_4, SC_5, SC_6, SC_7, SC_0, SC_1, SC_2, SC_3, - SC_C, SC_D, SC_E, SC_F, SC_8, SC_9, SC_A, SC_B }, - - { SC_5, SC_4, SC_7, SC_6, SC_1, SC_0, SC_3, SC_2, - SC_D, SC_C, SC_F, SC_E, SC_9, SC_8, SC_B, SC_A }, - - { SC_6, SC_7, SC_4, SC_5, SC_2, SC_3, SC_0, SC_1, - SC_E, SC_F, SC_C, SC_D, SC_A, SC_B, SC_8, SC_9 }, - - { SC_7, SC_6, SC_5, SC_4, SC_3, SC_2, SC_1, SC_0, - SC_F, SC_E, SC_D, SC_C, SC_B, SC_A, SC_9, SC_8 }, - - { SC_8, SC_9, SC_A, SC_B, SC_C, SC_D, SC_E, SC_F, - SC_0, SC_1, SC_2, SC_3, SC_4, SC_5, SC_6, SC_7 }, - - { SC_9, SC_8, SC_B, SC_A, SC_D, SC_C, SC_F, SC_E, - SC_1, SC_0, SC_3, SC_2, SC_5, SC_4, SC_7, SC_6 }, - - { SC_A, SC_B, SC_8, SC_9, SC_E, SC_F, SC_C, SC_D, - SC_2, SC_3, SC_0, SC_1, SC_6, SC_7, SC_4, SC_5 }, - - { SC_B, SC_A, SC_9, SC_8, SC_F, SC_E, SC_D, SC_C, - SC_3, SC_2, SC_1, SC_0, SC_7, SC_6, SC_5, SC_4 }, - - { SC_C, SC_D, SC_E, SC_F, SC_8, SC_9, SC_A, SC_B, - SC_4, SC_5, SC_6, SC_7, SC_0, SC_1, SC_2, SC_3 }, - - { SC_D, SC_C, SC_F, SC_E, SC_9, SC_8, SC_B, SC_A, - SC_5, SC_4, SC_7, SC_6, SC_1, SC_0, SC_3, SC_2 }, - - { SC_E, SC_F, SC_C, SC_D, SC_A, SC_B, SC_8, SC_9, - SC_6, SC_7, SC_4, SC_5, SC_2, SC_3, SC_0, SC_1 }, - - { SC_F, SC_E, SC_D, SC_C, SC_B, SC_A, SC_9, SC_8, - SC_7, SC_6, SC_5, SC_4, SC_3, SC_2, SC_1, SC_0 } - }; - -static char const add_table[16][16][2] = { - { {SC_0, SC_0}, {SC_1, SC_0}, {SC_2, SC_0}, {SC_3, SC_0}, - {SC_4, SC_0}, {SC_5, SC_0}, {SC_6, SC_0}, {SC_7, SC_0}, - {SC_8, SC_0}, {SC_9, SC_0}, {SC_A, SC_0}, {SC_B, SC_0}, - {SC_C, SC_0}, {SC_D, SC_0}, {SC_E, SC_0}, {SC_F, SC_0} }, - - { {SC_1, SC_0}, {SC_2, SC_0}, {SC_3, SC_0}, {SC_4, SC_0}, - {SC_5, SC_0}, {SC_6, SC_0}, {SC_7, SC_0}, {SC_8, SC_0}, - {SC_9, SC_0}, {SC_A, SC_0}, {SC_B, SC_0}, {SC_C, SC_0}, - {SC_D, SC_0}, {SC_E, SC_0}, {SC_F, SC_0}, {SC_0, SC_1} }, - - { {SC_2, SC_0}, {SC_3, SC_0}, {SC_4, SC_0}, {SC_5, SC_0}, - {SC_6, SC_0}, {SC_7, SC_0}, {SC_8, SC_0}, {SC_9, SC_0}, - {SC_A, SC_0}, {SC_B, SC_0}, {SC_C, SC_0}, {SC_D, SC_0}, - {SC_E, SC_0}, {SC_F, SC_0}, {SC_0, SC_1}, {SC_1, SC_1} }, - - { {SC_3, SC_0}, {SC_4, SC_0}, {SC_5, SC_0}, {SC_6, SC_0}, - {SC_7, SC_0}, {SC_8, SC_0}, {SC_9, SC_0}, {SC_A, SC_0}, - {SC_B, SC_0}, {SC_C, SC_0}, {SC_D, SC_0}, {SC_E, SC_0}, - {SC_F, SC_0}, {SC_0, SC_1}, {SC_1, SC_1}, {SC_2, SC_1} }, - - { {SC_4, SC_0}, {SC_5, SC_0}, {SC_6, SC_0}, {SC_7, SC_0}, - {SC_8, SC_0}, {SC_9, SC_0}, {SC_A, SC_0}, {SC_B, SC_0}, - {SC_C, SC_0}, {SC_D, SC_0}, {SC_E, SC_0}, {SC_F, SC_0}, - {SC_0, SC_1}, {SC_1, SC_1}, {SC_2, SC_1}, {SC_3, SC_1} }, - - { {SC_5, SC_0}, {SC_6, SC_0}, {SC_7, SC_0}, {SC_8, SC_0}, - {SC_9, SC_0}, {SC_A, SC_0}, {SC_B, SC_0}, {SC_C, SC_0}, - {SC_D, SC_0}, {SC_E, SC_0}, {SC_F, SC_0}, {SC_0, SC_1}, - {SC_1, SC_1}, {SC_2, SC_1}, {SC_3, SC_1}, {SC_4, SC_1} }, - - { {SC_6, SC_0}, {SC_7, SC_0}, {SC_8, SC_0}, {SC_9, SC_0}, - {SC_A, SC_0}, {SC_B, SC_0}, {SC_C, SC_0}, {SC_D, SC_0}, - {SC_E, SC_0}, {SC_F, SC_0}, {SC_0, SC_1}, {SC_1, SC_1}, - {SC_2, SC_1}, {SC_3, SC_1}, {SC_4, SC_1}, {SC_5, SC_1} }, - - { {SC_7, SC_0}, {SC_8, SC_0}, {SC_9, SC_0}, {SC_A, SC_0}, - {SC_B, SC_0}, {SC_C, SC_0}, {SC_D, SC_0}, {SC_E, SC_0}, - {SC_F, SC_0}, {SC_0, SC_1}, {SC_1, SC_1}, {SC_2, SC_1}, - {SC_3, SC_1}, {SC_4, SC_1}, {SC_5, SC_1}, {SC_6, SC_1} }, - - { {SC_8, SC_0}, {SC_9, SC_0}, {SC_A, SC_0}, {SC_B, SC_0}, - {SC_C, SC_0}, {SC_D, SC_0}, {SC_E, SC_0}, {SC_F, SC_0}, - {SC_0, SC_1}, {SC_1, SC_1}, {SC_2, SC_1}, {SC_3, SC_1}, - {SC_4, SC_1}, {SC_5, SC_1}, {SC_6, SC_1}, {SC_7, SC_1} }, - - { {SC_9, SC_0}, {SC_A, SC_0}, {SC_B, SC_0}, {SC_C, SC_0}, - {SC_D, SC_0}, {SC_E, SC_0}, {SC_F, SC_0}, {SC_0, SC_1}, - {SC_1, SC_1}, {SC_2, SC_1}, {SC_3, SC_1}, {SC_4, SC_1}, - {SC_5, SC_1}, {SC_6, SC_1}, {SC_7, SC_1}, {SC_8, SC_1} }, - - { {SC_A, SC_0}, {SC_B, SC_0}, {SC_C, SC_0}, {SC_D, SC_0}, - {SC_E, SC_0}, {SC_F, SC_0}, {SC_0, SC_1}, {SC_1, SC_1}, - {SC_2, SC_1}, {SC_3, SC_1}, {SC_4, SC_1}, {SC_5, SC_1}, - {SC_6, SC_1}, {SC_7, SC_1}, {SC_8, SC_1}, {SC_9, SC_1} }, - - { {SC_B, SC_0}, {SC_C, SC_0}, {SC_D, SC_0}, {SC_E, SC_0}, - {SC_F, SC_0}, {SC_0, SC_1}, {SC_1, SC_1}, {SC_2, SC_1}, - {SC_3, SC_1}, {SC_4, SC_1}, {SC_5, SC_1}, {SC_6, SC_1}, - {SC_7, SC_1}, {SC_8, SC_1}, {SC_9, SC_1}, {SC_A, SC_1} }, - - { {SC_C, SC_0}, {SC_D, SC_0}, {SC_E, SC_0}, {SC_F, SC_0}, - {SC_0, SC_1}, {SC_1, SC_1}, {SC_2, SC_1}, {SC_3, SC_1}, - {SC_4, SC_1}, {SC_5, SC_1}, {SC_6, SC_1}, {SC_7, SC_1}, - {SC_8, SC_1}, {SC_9, SC_1}, {SC_A, SC_1}, {SC_B, SC_1} }, - - { {SC_D, SC_0}, {SC_E, SC_0}, {SC_F, SC_0}, {SC_0, SC_1}, - {SC_1, SC_1}, {SC_2, SC_1}, {SC_3, SC_1}, {SC_4, SC_1}, - {SC_5, SC_1}, {SC_6, SC_1}, {SC_7, SC_1}, {SC_8, SC_1}, - {SC_9, SC_1}, {SC_A, SC_1}, {SC_B, SC_1}, {SC_C, SC_1} }, - - { {SC_E, SC_0}, {SC_F, SC_0}, {SC_0, SC_1}, {SC_1, SC_1}, - {SC_2, SC_1}, {SC_3, SC_1}, {SC_4, SC_1}, {SC_5, SC_1}, - {SC_6, SC_1}, {SC_7, SC_1}, {SC_8, SC_1}, {SC_9, SC_1}, - {SC_A, SC_1}, {SC_B, SC_1}, {SC_C, SC_1}, {SC_D, SC_1} }, - - { {SC_F, SC_0}, {SC_0, SC_1}, {SC_1, SC_1}, {SC_2, SC_1}, - {SC_3, SC_1}, {SC_4, SC_1}, {SC_5, SC_1}, {SC_6, SC_1}, - {SC_7, SC_1}, {SC_8, SC_1}, {SC_9, SC_1}, {SC_A, SC_1}, - {SC_B, SC_1}, {SC_C, SC_1}, {SC_D, SC_1}, {SC_E, SC_1} } - }; - -static char const mul_table[16][16][2] = { - { {SC_0, SC_0}, {SC_0, SC_0}, {SC_0, SC_0}, {SC_0, SC_0}, - {SC_0, SC_0}, {SC_0, SC_0}, {SC_0, SC_0}, {SC_0, SC_0}, - {SC_0, SC_0}, {SC_0, SC_0}, {SC_0, SC_0}, {SC_0, SC_0}, - {SC_0, SC_0}, {SC_0, SC_0}, {SC_0, SC_0}, {SC_0, SC_0} }, - - { {SC_0, SC_0}, {SC_1, SC_0}, {SC_2, SC_0}, {SC_3, SC_0}, - {SC_4, SC_0}, {SC_5, SC_0}, {SC_6, SC_0}, {SC_7, SC_0}, - {SC_8, SC_0}, {SC_9, SC_0}, {SC_A, SC_0}, {SC_B, SC_0}, - {SC_C, SC_0}, {SC_D, SC_0}, {SC_E, SC_0}, {SC_F, SC_0} }, - - { {SC_0, SC_0}, {SC_2, SC_0}, {SC_4, SC_0}, {SC_6, SC_0}, - {SC_8, SC_0}, {SC_A, SC_0}, {SC_C, SC_0}, {SC_E, SC_0}, - {SC_0, SC_1}, {SC_2, SC_1}, {SC_4, SC_1}, {SC_6, SC_1}, - {SC_8, SC_1}, {SC_A, SC_1}, {SC_C, SC_1}, {SC_E, SC_1} }, - - { {SC_0, SC_0}, {SC_3, SC_0}, {SC_6, SC_0}, {SC_9, SC_0}, - {SC_C, SC_0}, {SC_F, SC_0}, {SC_2, SC_1}, {SC_5, SC_1}, - {SC_8, SC_1}, {SC_B, SC_1}, {SC_E, SC_1}, {SC_1, SC_2}, - {SC_4, SC_2}, {SC_7, SC_2}, {SC_A, SC_2}, {SC_D, SC_2} }, - - { {SC_0, SC_0}, {SC_4, SC_0}, {SC_8, SC_0}, {SC_C, SC_0}, - {SC_0, SC_1}, {SC_4, SC_1}, {SC_8, SC_1}, {SC_C, SC_1}, - {SC_0, SC_2}, {SC_4, SC_2}, {SC_8, SC_2}, {SC_C, SC_2}, - {SC_0, SC_3}, {SC_4, SC_3}, {SC_8, SC_3}, {SC_C, SC_3} }, - - { {SC_0, SC_0}, {SC_5, SC_0}, {SC_A, SC_0}, {SC_F, SC_0}, - {SC_4, SC_1}, {SC_9, SC_1}, {SC_E, SC_1}, {SC_3, SC_2}, - {SC_8, SC_2}, {SC_D, SC_2}, {SC_2, SC_3}, {SC_7, SC_3}, - {SC_C, SC_3}, {SC_1, SC_4}, {SC_6, SC_4}, {SC_B, SC_4} }, - - { {SC_0, SC_0}, {SC_6, SC_0}, {SC_C, SC_0}, {SC_2, SC_1}, - {SC_8, SC_1}, {SC_E, SC_1}, {SC_4, SC_2}, {SC_A, SC_2}, - {SC_0, SC_3}, {SC_6, SC_3}, {SC_C, SC_3}, {SC_2, SC_4}, - {SC_8, SC_4}, {SC_E, SC_4}, {SC_4, SC_5}, {SC_A, SC_5} }, - - { {SC_0, SC_0}, {SC_7, SC_0}, {SC_E, SC_0}, {SC_5, SC_1}, - {SC_C, SC_1}, {SC_3, SC_2}, {SC_A, SC_2}, {SC_1, SC_3}, - {SC_8, SC_3}, {SC_F, SC_3}, {SC_6, SC_4}, {SC_D, SC_4}, - {SC_4, SC_5}, {SC_B, SC_5}, {SC_2, SC_6}, {SC_9, SC_6} }, - - { {SC_0, SC_0}, {SC_8, SC_0}, {SC_0, SC_1}, {SC_8, SC_1}, - {SC_0, SC_2}, {SC_8, SC_2}, {SC_0, SC_3}, {SC_8, SC_3}, - {SC_0, SC_4}, {SC_8, SC_4}, {SC_0, SC_5}, {SC_8, SC_5}, - {SC_0, SC_6}, {SC_8, SC_6}, {SC_0, SC_7}, {SC_8, SC_7} }, - - { {SC_0, SC_0}, {SC_9, SC_0}, {SC_2, SC_1}, {SC_B, SC_1}, - {SC_4, SC_2}, {SC_D, SC_2}, {SC_6, SC_3}, {SC_F, SC_3}, - {SC_8, SC_4}, {SC_1, SC_5}, {SC_A, SC_5}, {SC_3, SC_6}, - {SC_C, SC_6}, {SC_5, SC_7}, {SC_E, SC_7}, {SC_7, SC_8} }, - - { {SC_0, SC_0}, {SC_A, SC_0}, {SC_4, SC_1}, {SC_E, SC_1}, - {SC_8, SC_2}, {SC_2, SC_3}, {SC_C, SC_3}, {SC_6, SC_4}, - {SC_0, SC_5}, {SC_A, SC_5}, {SC_4, SC_6}, {SC_E, SC_6}, - {SC_8, SC_7}, {SC_2, SC_8}, {SC_C, SC_8}, {SC_6, SC_9} }, - - { {SC_0, SC_0}, {SC_B, SC_0}, {SC_6, SC_1}, {SC_1, SC_2}, - {SC_C, SC_2}, {SC_7, SC_3}, {SC_2, SC_4}, {SC_D, SC_4}, - {SC_8, SC_5}, {SC_3, SC_6}, {SC_E, SC_6}, {SC_9, SC_7}, - {SC_4, SC_8}, {SC_F, SC_8}, {SC_A, SC_9}, {SC_5, SC_A} }, - - { {SC_0, SC_0}, {SC_C, SC_0}, {SC_8, SC_1}, {SC_4, SC_2}, - {SC_0, SC_3}, {SC_C, SC_3}, {SC_8, SC_4}, {SC_4, SC_5}, - {SC_0, SC_6}, {SC_C, SC_6}, {SC_8, SC_7}, {SC_4, SC_8}, - {SC_0, SC_9}, {SC_C, SC_9}, {SC_8, SC_A}, {SC_4, SC_B} }, - - { {SC_0, SC_0}, {SC_D, SC_0}, {SC_A, SC_1}, {SC_7, SC_2}, - {SC_4, SC_3}, {SC_1, SC_4}, {SC_E, SC_4}, {SC_B, SC_5}, - {SC_8, SC_6}, {SC_5, SC_7}, {SC_2, SC_8}, {SC_F, SC_8}, - {SC_C, SC_9}, {SC_9, SC_A}, {SC_6, SC_B}, {SC_3, SC_C} }, - - { {SC_0, SC_0}, {SC_E, SC_0}, {SC_C, SC_1}, {SC_A, SC_2}, - {SC_8, SC_3}, {SC_6, SC_4}, {SC_4, SC_5}, {SC_2, SC_6}, - {SC_0, SC_7}, {SC_E, SC_7}, {SC_C, SC_8}, {SC_A, SC_9}, - {SC_8, SC_A}, {SC_6, SC_B}, {SC_4, SC_C}, {SC_2, SC_D} }, - - { {SC_0, SC_0}, {SC_F, SC_0}, {SC_E, SC_1}, {SC_D, SC_2}, - {SC_C, SC_3}, {SC_B, SC_4}, {SC_A, SC_5}, {SC_9, SC_6}, - {SC_8, SC_7}, {SC_7, SC_8}, {SC_6, SC_9}, {SC_5, SC_A}, - {SC_4, SC_B}, {SC_3, SC_C}, {SC_2, SC_D}, {SC_1, SC_E} } - }; - static char const shrs_table[16][4][2] = { { {SC_0, SC_0}, {SC_0, SC_0}, {SC_0, SC_0}, {SC_0, SC_0} }, { {SC_1, SC_0}, {SC_0, SC_8}, {SC_0, SC_4}, {SC_0, SC_2} }, @@ -417,66 +74,68 @@ static char const shrs_table[16][4][2] = { }; /** converting a digit to a binary string */ -static const char *binary_table[16] = { - "0000", "0001", "0010", "0011", "0100", "0101", "0110", "0111", - "1000", "1001", "1010", "1011", "1100", "1101", "1110", "1111" +static char const *const binary_table[] = { + "0000", "0001", "0010", "0011", "0100", "0101", "0110", "0111", + "1000", "1001", "1010", "1011", "1100", "1101", "1110", "1111" }; /***************************************************************************** * private functions *****************************************************************************/ -static void _fail_char(const char *str, size_t len, const char fchar, int pos, - const char *file, int line) -{ - printf("ERROR:\n"); - printf("Unexpected character '%c' in %s:%d\n", fchar, file, line); - while (len-- && *str) printf("%c", *str++); printf("\n"); - while (--pos) printf(" "); printf("^\n"); - exit(-1); -} /** * implements the bitwise NOT operation */ -static void _bitnot(const char *val, char *buffer) +static void do_bitnot(const char *val, char *buffer) { - int counter; + int counter; - for (counter = 0; counter> 2; + int bit = pos & 3; + int nibble = pos >> 2; - return _bitisset(val[nibble], bit); + return _bitisset(val[nibble], bit); } /** * Implements a fast ADD + 1 */ -static void _inc(const char *val, char *buffer) +static void do_inc(const char *val, char *buffer) { - int counter = 0; - - while (counter++ < calc_buffer_size) - { - if (*val == SC_F) - { - *buffer++ = SC_0; - val++; - } - else - { - /* No carry here, *val != SC_F */ - *buffer = add_table[_val(*val)][SC_1][0]; - return; - } - } - /* here a carry could be lost, this is intended because this should - * happen only when a value changes sign. */ + int counter = 0; + + while (counter++ < calc_buffer_size) { + if (*val == SC_F) { + *buffer++ = SC_0; + val++; + } else { + /* No carry here, *val != SC_F */ + *buffer = *val + SC_1; + return; + } + } + /* here a carry could be lost, this is intended because this should + * happen only when a value changes sign. */ } /** * Implements a unary MINUS */ -static void _negate(const char *val, char *buffer) +static void do_negate(const char *val, char *buffer) { - _bitnot(val, buffer); - _inc(buffer, buffer); + do_bitnot(val, buffer); + do_inc(buffer, buffer); } /** @@ -541,126 +196,110 @@ static void _negate(const char *val, char *buffer) * @todo The implementation of carry is wrong, as it is the * calc_buffer_size carry, not the mode depending */ -static void _add(const char *val1, const char *val2, char *buffer) +static void do_add(const char *val1, const char *val2, char *buffer) { - int counter; - const char *add1, *add2; - char carry = SC_0; - - for (counter = 0; counter < calc_buffer_size; counter++) - { - add1 = add_table[_val(val1[counter])][_val(val2[counter])]; - add2 = add_table[_val(add1[0])][_val(carry)]; - /* carry might be zero */ - buffer[counter] = add2[0]; - carry = add_table[_val(add1[1])][_val(add2[1])][0]; - } - carry_flag = carry != SC_0; + unsigned carry = SC_0; + for (int counter = 0; counter < calc_buffer_size; ++counter) { + unsigned const sum = val1[counter] + val2[counter] + carry; + buffer[counter] = SC_RESULT(sum); + carry = SC_CARRY(sum); + } + carry_flag = carry != SC_0; } /** * Implements a binary SUB */ -static void _sub(const char *val1, const char *val2, char *buffer) +static void do_sub(const char *val1, const char *val2, char *buffer) { - char *temp_buffer = alloca(calc_buffer_size); /* intermediate buffer to hold -val2 */ + char *temp_buffer = (char*) alloca(calc_buffer_size); /* intermediate buffer to hold -val2 */ - _negate(val2, temp_buffer); - _add(val1, temp_buffer, buffer); + do_negate(val2, temp_buffer); + do_add(val1, temp_buffer, buffer); } /** * Implements a binary MUL */ -static void _mul(const char *val1, const char *val2, char *buffer) +static void do_mul(const char *val1, const char *val2, char *buffer) { - char *temp_buffer; /* result buffer */ - char *neg_val1; /* abs of val1 */ - char *neg_val2; /* abs of val2 */ - - const char *mul, *add1, *add2; /* intermediate result containers */ - char carry = SC_0; /* container for carries */ - char sign = 0; /* marks result sign */ - int c_inner, c_outer; /* loop counters */ - - temp_buffer = alloca(calc_buffer_size); - neg_val1 = alloca(calc_buffer_size); - neg_val2 = alloca(calc_buffer_size); - - /* init result buffer to zeroes */ - memset(temp_buffer, SC_0, calc_buffer_size); - - /* the multiplication works only for positive values, for negative values * - * it is necessary to negate them and adjust the result accordingly */ - if (_sign(val1) == -1) { - _negate(val1, neg_val1); - val1 = neg_val1; - sign ^= 1; - } - if (_sign(val2) == -1) { - _negate(val2, neg_val2); - val2 = neg_val2; - sign ^= 1; - } - - for (c_outer = 0; c_outer < max_value_size; c_outer++) - { - if (val2[c_outer] != SC_0) - { - for (c_inner = 0; c_inner < max_value_size; c_inner++) - { - /* do the following calculation: * - * Add the current carry, the value at position c_outer+c_inner * - * and the result of the multiplication of val1[c_inner] and * - * val2[c_outer]. This is the usual pen-and-paper multiplication. */ - - /* multiplicate the two digits */ - mul = mul_table[_val(val1[c_inner])][_val(val2[c_outer])]; - /* add old value to result of multiplication */ - add1 = add_table[_val(temp_buffer[c_inner + c_outer])][_val(mul[0])]; - /* add carry to the sum */ - add2 = add_table[_val(add1[0])][_val(carry)]; - - /* all carries together result in new carry. This is always smaller * - * than the base b: * - * Both multiplicands, the carry and the value already in the temp * - * buffer are single digits and their value is therefore at most * - * equal to (b-1). * - * This leads to: * - * (b-1)(b-1)+(b-1)+(b-1) = b*b-1 * - * The tables list all operations rem b, so the carry is at most * - * (b*b-1)rem b = -1rem b = b-1 */ - carry = add_table[_val(mul[1])][_val(add1[1])][0]; - carry = add_table[_val(carry)][_val(add2[1])][0]; - - temp_buffer[c_inner + c_outer] = add2[0]; - } - - /* A carry may hang over */ - /* c_outer is always smaller than max_value_size! */ - temp_buffer[max_value_size + c_outer] = carry; - carry = SC_0; - } - } - - if (sign) - _negate(temp_buffer, buffer); - else - memcpy(buffer, temp_buffer, calc_buffer_size); + char *temp_buffer; /* result buffer */ + char *neg_val1; /* abs of val1 */ + char *neg_val2; /* abs of val2 */ + + char sign = 0; /* marks result sign */ + int c_inner, c_outer; /* loop counters */ + + temp_buffer = (char*) alloca(calc_buffer_size); + neg_val1 = (char*) alloca(calc_buffer_size); + neg_val2 = (char*) alloca(calc_buffer_size); + + /* init result buffer to zeros */ + memset(temp_buffer, SC_0, calc_buffer_size); + + /* the multiplication works only for positive values, for negative values * + * it is necessary to negate them and adjust the result accordingly */ + if (do_sign(val1) == -1) { + do_negate(val1, neg_val1); + val1 = neg_val1; + sign ^= 1; + } + if (do_sign(val2) == -1) { + do_negate(val2, neg_val2); + val2 = neg_val2; + sign ^= 1; + } + + for (c_outer = 0; c_outer < max_value_size; c_outer++) { + if (val2[c_outer] != SC_0) { + unsigned carry = SC_0; /* container for carries */ + for (c_inner = 0; c_inner < max_value_size; c_inner++) { + /* do the following calculation: * + * Add the current carry, the value at position c_outer+c_inner * + * and the result of the multiplication of val1[c_inner] and * + * val2[c_outer]. This is the usual pen-and-paper multiplication. */ + + /* multiplicate the two digits */ + unsigned const mul = val1[c_inner] * val2[c_outer]; + /* add old value to result of multiplication and the carry */ + unsigned const sum = temp_buffer[c_inner + c_outer] + mul + carry; + + /* all carries together result in new carry. This is always smaller * + * than the base b: * + * Both multiplicands, the carry and the value already in the temp * + * buffer are single digits and their value is therefore at most * + * equal to (b-1). * + * This leads to: * + * (b-1)(b-1)+(b-1)+(b-1) = b*b-1 * + * The tables list all operations rem b, so the carry is at most * + * (b*b-1)rem b = -1rem b = b-1 */ + temp_buffer[c_inner + c_outer] = SC_RESULT(sum); + carry = SC_CARRY(sum); + } + + /* A carry may hang over */ + /* c_outer is always smaller than max_value_size! */ + temp_buffer[max_value_size + c_outer] = carry; + } + } + + if (sign) + do_negate(temp_buffer, buffer); + else + memcpy(buffer, temp_buffer, calc_buffer_size); } /** * Shift the buffer to left and add a 4 bit digit */ -static void _push(const char digit, char *buffer) +static void do_push(const char digit, char *buffer) { - int counter; + int counter; - for (counter = calc_buffer_size - 2; counter >= 0; counter--) - { - buffer[counter+1] = buffer[counter]; - } - buffer[0] = digit; + for (counter = calc_buffer_size - 2; counter >= 0; counter--) { + buffer[counter+1] = buffer[counter]; + } + buffer[0] = digit; } /** @@ -668,94 +307,89 @@ static void _push(const char digit, char *buffer) * * Note: This is MOST slow */ -static void _divmod(const char *rDividend, const char *divisor, char *quot, char *rem) +static void do_divmod(const char *rDividend, const char *divisor, char *quot, char *rem) { - const char *dividend = rDividend; - const char *minus_divisor; - char *neg_val1; - char *neg_val2; - - char div_sign = 0; /* remember division result sign */ - char rem_sign = 0; /* remember remainder esult sign */ - - int c_dividend; /* loop counters */ - - neg_val1 = alloca(calc_buffer_size); - neg_val2 = alloca(calc_buffer_size); - - /* clear result buffer */ - memset(quot, SC_0, calc_buffer_size); - memset(rem, SC_0, calc_buffer_size); - - /* if the divisor is zero this won't work (quot is zero) */ - if (sc_comp(divisor, quot) == 0) assert(0 && "division by zero!"); - - /* if the dividend is zero result is zero (quot is zero)*/ - if (sc_comp(dividend, quot) == 0) - return; - - if (_sign(dividend) == -1) { - _negate(dividend, neg_val1); - div_sign ^= 1; - rem_sign ^= 1; - dividend = neg_val1; - } - - _negate(divisor, neg_val2); - if (_sign(divisor) == -1) { - div_sign ^= 1; - minus_divisor = divisor; - divisor = neg_val2; - } - else - minus_divisor = neg_val2; - - /* if divisor >= dividend division is easy - * (remember these are absolute values) */ - switch (sc_comp(dividend, divisor)) - { - case 0: /* dividend == divisor */ - quot[0] = SC_1; - return; - - case -1: /* dividend < divisor */ - memcpy(rem, rDividend, calc_buffer_size); - return; - - default: /* unluckily division is necessary :( */ - break; - } - - for (c_dividend = calc_buffer_size - 1; c_dividend >= 0; c_dividend--) - { - _push(dividend[c_dividend], rem); - _push(SC_0, quot); - - if (sc_comp(rem, divisor) != -1) /* remainder >= divisor */ - { - /* subtract until the remainder becomes negative, this should - * be faster than comparing remainder with divisor */ - _add(rem, minus_divisor, rem); - - while (_sign(rem) == 1) - { - quot[0] = add_table[_val(quot[0])][SC_1][0]; - _add(rem, minus_divisor, rem); - } - - /* subtracted one too much */ - _add(rem, divisor, rem); - } - } - - /* sets carry if remainder is non-zero ??? */ - carry_flag = !sc_is_zero(rem); - - if (div_sign) - _negate(quot, quot); - - if (rem_sign) - _negate(rem, rem); + const char *dividend = rDividend; + const char *minus_divisor; + char *neg_val1; + char *neg_val2; + + char div_sign = 0; /* remember division result sign */ + char rem_sign = 0; /* remember remainder result sign */ + + int c_dividend; /* loop counters */ + + neg_val1 = (char*) alloca(calc_buffer_size); + neg_val2 = (char*) alloca(calc_buffer_size); + + /* clear result buffer */ + memset(quot, SC_0, calc_buffer_size); + memset(rem, SC_0, calc_buffer_size); + + /* if the divisor is zero this won't work (quot is zero) */ + assert(sc_comp(divisor, quot) != ir_relation_equal && "division by zero!"); + + /* if the dividend is zero result is zero (quot is zero) */ + if (sc_comp(dividend, quot) == ir_relation_equal) + return; + + if (do_sign(dividend) == -1) { + do_negate(dividend, neg_val1); + div_sign ^= 1; + rem_sign ^= 1; + dividend = neg_val1; + } + + do_negate(divisor, neg_val2); + if (do_sign(divisor) == -1) { + div_sign ^= 1; + minus_divisor = divisor; + divisor = neg_val2; + } else + minus_divisor = neg_val2; + + /* if divisor >= dividend division is easy + * (remember these are absolute values) */ + switch (sc_comp(dividend, divisor)) { + case ir_relation_equal: /* dividend == divisor */ + quot[0] = SC_1; + goto end; + + case ir_relation_less: /* dividend < divisor */ + memcpy(rem, dividend, calc_buffer_size); + goto end; + + default: /* unluckily division is necessary :( */ + break; + } + + for (c_dividend = calc_buffer_size - 1; c_dividend >= 0; c_dividend--) { + do_push(dividend[c_dividend], rem); + do_push(SC_0, quot); + + if (sc_comp(rem, divisor) != ir_relation_less) { /* remainder >= divisor */ + /* subtract until the remainder becomes negative, this should + * be faster than comparing remainder with divisor */ + do_add(rem, minus_divisor, rem); + + while (do_sign(rem) == 1) { + quot[0] = SC_RESULT(quot[0] + SC_1); /* TODO can this generate carry or is masking redundant? */ + do_add(rem, minus_divisor, rem); + } + + /* subtracted one too much */ + do_add(rem, divisor, rem); + } + } +end: + /* sets carry if remainder is non-zero ??? */ + carry_flag = !sc_is_zero(rem); + + if (div_sign) + do_negate(quot, quot); + + if (rem_sign) + do_negate(rem, rem); } /** @@ -764,185 +398,167 @@ static void _divmod(const char *rDividend, const char *divisor, char *quot, char * * @todo Assertions seems to be wrong */ -static void _shl(const char *val1, char *buffer, long offset, int radius, unsigned is_signed) +static void do_shl(const char *val1, char *buffer, long shift_cnt, int bitsize, unsigned is_signed) { - const char *shl; - char shift; - char carry = SC_0; - - int counter; - int bitoffset = 0; - - assert((offset >= 0) || (0 && "negative leftshift")); - assert(((_sign(val1) != -1) || is_signed) || (0 && "unsigned mode and negative value")); - assert(((!_bitisset(val1[(radius-1)/4], (radius-1)%4)) || !is_signed || (_sign(val1) == -1)) || (0 && "value is positive, should be negative")); - assert(((_bitisset(val1[(radius-1)/4], (radius-1)%4)) || !is_signed || (_sign(val1) == 1)) || (0 && "value is negative, should be positive")); - - /* if shifting far enough the result is zero */ - if (offset >= radius) - { - memset(buffer, SC_0, calc_buffer_size); - return; - } - - shift = shift_table[_val(offset%4)]; /* this is 2 ** (offset % 4) */ - offset = offset / 4; - - /* shift the single digits some bytes (offset) and some bits (table) - * to the left */ - for (counter = 0; counter < radius/4 - offset; counter++) - { - shl = mul_table[_val(val1[counter])][_val(shift)]; - buffer[counter + offset] = or_table[_val(shl[0])][_val(carry)]; - carry = shl[1]; - } - if (radius%4 > 0) - { - shl = mul_table[_val(val1[counter])][_val(shift)]; - buffer[counter + offset] = or_table[_val(shl[0])][_val(carry)]; - bitoffset = counter; - } else { - bitoffset = counter - 1; - } - - /* fill with zeroes */ - for (counter = 0; counter < offset; counter++) buffer[counter] = SC_0; - - /* if the mode was signed, change sign when the mode's msb is now 1 */ - offset = bitoffset + offset; - bitoffset = (radius-1) % 4; - if (is_signed && _bitisset(buffer[offset], bitoffset)) - { - /* this sets the upper bits of the leftmost digit */ - buffer[offset] = or_table[_val(buffer[offset])][_val(min_digit[bitoffset])]; - for (counter = offset+1; counter < calc_buffer_size; counter++) - { - buffer[counter] = SC_F; - } - } - else if (is_signed && !_bitisset(buffer[offset], bitoffset)) - { - /* this clears the upper bits of the leftmost digit */ - buffer[offset] = and_table[_val(buffer[offset])][_val(max_digit[bitoffset])]; - for (counter = offset+1; counter < calc_buffer_size; counter++) - { - buffer[counter] = SC_0; - } - } + int counter; + int bitoffset = 0; + + assert((shift_cnt >= 0) || (0 && "negative leftshift")); + assert(((do_sign(val1) != -1) || is_signed) || (0 && "unsigned mode and negative value")); + assert(((!_bitisset(val1[(bitsize-1)/4], (bitsize-1)%4)) || !is_signed || (do_sign(val1) == -1)) || (0 && "value is positive, should be negative")); + assert(((_bitisset(val1[(bitsize-1)/4], (bitsize-1)%4)) || !is_signed || (do_sign(val1) == 1)) || (0 && "value is negative, should be positive")); + + /* if shifting far enough the result is zero */ + if (shift_cnt >= bitsize) { + memset(buffer, SC_0, calc_buffer_size); + return; + } + + unsigned const shift = shift_cnt % SC_BITS; + shift_cnt = shift_cnt / 4; + + /* shift the single digits some bytes (offset) and some bits (table) + * to the left */ + unsigned carry = SC_0; + for (counter = 0; counter < bitsize/4 - shift_cnt; counter++) { + unsigned const shl = val1[counter] << shift | carry; + buffer[counter + shift_cnt] = SC_RESULT(shl); + carry = SC_CARRY(shl); + } + if (bitsize%4 > 0) { + unsigned const shl = val1[counter] << shift | carry; + buffer[counter + shift_cnt] = SC_RESULT(shl); + bitoffset = counter; + } else { + bitoffset = counter - 1; + } + + /* fill with zeroes */ + for (counter = 0; counter < shift_cnt; counter++) + buffer[counter] = SC_0; + + /* if the mode was signed, change sign when the mode's msb is now 1 */ + shift_cnt = bitoffset + shift_cnt; + bitoffset = (bitsize-1) % 4; + if (is_signed && _bitisset(buffer[shift_cnt], bitoffset)) { + /* this sets the upper bits of the leftmost digit */ + buffer[shift_cnt] |= min_digit[bitoffset]; + for (counter = shift_cnt+1; counter < calc_buffer_size; counter++) { + buffer[counter] = SC_F; + } + } else if (is_signed && !_bitisset(buffer[shift_cnt], bitoffset)) { + /* this clears the upper bits of the leftmost digit */ + buffer[shift_cnt] &= max_digit[bitoffset]; + for (counter = shift_cnt+1; counter < calc_buffer_size; counter++) { + buffer[counter] = SC_0; + } + } } /** * Implements a Shift Right, which can either preserve the sign bit * or not. * + * @param bitsize bitsize of the value to be shifted + * * @todo Assertions seems to be wrong */ -static void _shr(const char *val1, char *buffer, long offset, int radius, unsigned is_signed, int signed_shift) +static void do_shr(const char *val1, char *buffer, long shift_cnt, int bitsize, unsigned is_signed, int signed_shift) { - const char *shrs; - char sign; - char msd; - - int shift; - - int counter; - int bitoffset = 0; - - assert((offset >= 0) || (0 && "negative rightshift")); - assert(((_sign(val1) != -1) || is_signed) || (0 && "unsigned mode and negative value")); - assert(((!_bitisset(val1[(radius-1)/4], (radius-1)%4)) || !is_signed || (_sign(val1) == -1)) || (0 && "value is positive, should be negative")); - assert(((_bitisset(val1[(radius-1)/4], (radius-1)%4)) || !is_signed || (_sign(val1) == 1)) || (0 && "value is negative, should be positive")); - - sign = ((signed_shift) && (_sign(val1) == -1))?(SC_F):(SC_0); - - /* if shifting far enough the result is either 0 or -1 */ - if (offset >= radius) - { - if (!sc_is_zero(val1)) { - carry_flag = 1; - } - memset(buffer, sign, calc_buffer_size); - return; - } - - shift = offset % 4; - offset = offset / 4; - - /* check if any bits are lost, and set carry_flag if so */ - for (counter = 0; counter < offset; counter++) - { - if (val1[counter] != 0) - { - carry_flag = 1; - break; - } - } - if ((_val(val1[counter]) & ((1< 0) { - buffer[counter] = shrs_table[_val(val1[offset])][shift][0]; - counter = 1; - } - for (; counter < radius/4 - offset; counter++) - { - shrs = shrs_table[_val(val1[counter + offset])][shift]; - buffer[counter] = shrs[0]; - buffer[counter-1] = or_table[_val(buffer[counter-1])][_val(shrs[1])]; - } - - /* the last digit is special in regard of signed/unsigned shift */ - bitoffset = radius%4; - msd = (radius/4 0) buffer[counter - 1] = or_table[_val(buffer[counter-1])][_val(shrs[1])]; - - /* fill with SC_F or SC_0 depending on sign */ - for (counter++; counter < calc_buffer_size; counter++) - { - buffer[counter] = sign; - } + const char *shrs; + char sign; + char msd; + + int shift_mod, shift_nib; + + int counter; + int bitoffset = 0; + + assert((shift_cnt >= 0) || (0 && "negative rightshift")); + assert(((!_bitisset(val1[(bitsize-1)/4], (bitsize-1)%4)) || !is_signed || (do_sign(val1) == -1)) || (0 && "value is positive, should be negative")); + assert(((_bitisset(val1[(bitsize-1)/4], (bitsize-1)%4)) || !is_signed || (do_sign(val1) == 1)) || (0 && "value is negative, should be positive")); + + sign = signed_shift && do_bit(val1, bitsize - 1) ? SC_F : SC_0; + + /* if shifting far enough the result is either 0 or -1 */ + if (shift_cnt >= bitsize) { + if (!sc_is_zero(val1)) { + carry_flag = 1; + } + memset(buffer, sign, calc_buffer_size); + return; + } + + shift_mod = shift_cnt & 3; + shift_nib = shift_cnt >> 2; + + /* check if any bits are lost, and set carry_flag if so */ + for (counter = 0; counter < shift_nib; ++counter) { + if (val1[counter] != 0) { + carry_flag = 1; + break; + } + } + if ((_val(val1[counter]) & ((1<> 2) - shift_nib; counter++) { + shrs = shrs_table[_val(val1[counter + shift_nib])][shift_mod]; + buffer[counter] = shrs[0]; + buffer[counter - 1] |= shrs[1]; + } + + /* the last digit is special in regard of signed/unsigned shift */ + bitoffset = bitsize & 3; + msd = sign; /* most significant digit */ + + /* remove sign bits if mode was signed and this is an unsigned shift */ + if (!signed_shift && is_signed) { + msd &= max_digit[bitoffset]; + } + + shrs = shrs_table[_val(msd)][shift_mod]; + + /* signed shift and signed mode and negative value means all bits to the left are set */ + if (signed_shift && sign == SC_F) { + buffer[counter] = shrs[0] | min_digit[bitoffset]; + } else { + buffer[counter] = shrs[0]; + } + + if (counter > 0) + buffer[counter - 1] |= shrs[1]; + + /* fill with SC_F or SC_0 depending on sign */ + for (counter++; counter < calc_buffer_size; counter++) { + buffer[counter] = sign; + } } /** - * Implements a Rotate Right. + * Implements a Rotate Left. * positive: low-order -> high order, negative other direction */ -static void _rot(const char *val1, char *buffer, long offset, int radius, unsigned is_signed) +static void do_rotl(const char *val1, char *buffer, long offset, int radius, unsigned is_signed) { - char *temp1, *temp2; - temp1 = alloca(calc_buffer_size); - temp2 = alloca(calc_buffer_size); - - offset = offset % radius; - - /* rotation by multiples of the type length is identity */ - if (offset == 0) { - memmove(buffer, val1, calc_buffer_size); - return; - } - - _shl(val1, temp1, offset, radius, is_signed); - _shr(val1, temp2, radius - offset, radius, is_signed, 0); - _bitor(temp1, temp2, buffer); - carry_flag = 0; /* set by shr, but due to rot this is false */ + char *temp1, *temp2; + temp1 = (char*) alloca(calc_buffer_size); + temp2 = (char*) alloca(calc_buffer_size); + + offset = offset % radius; + + /* rotation by multiples of the type length is identity */ + if (offset == 0) { + memmove(buffer, val1, calc_buffer_size); + return; + } + + do_shl(val1, temp1, offset, radius, is_signed); + do_shr(val1, temp2, radius - offset, radius, is_signed, 0); + do_bitor(temp1, temp2, buffer); + carry_flag = 0; /* set by shr, but due to rot this is false */ } /***************************************************************************** @@ -950,675 +566,765 @@ static void _rot(const char *val1, char *buffer, long offset, int radius, unsign *****************************************************************************/ const void *sc_get_buffer(void) { - return (void*)calc_buffer; + return (void*)calc_buffer; } int sc_get_buffer_length(void) { - return calc_buffer_size; + return calc_buffer_size; } /** - * Do sign extension if the mode is signed, expects all upper bits - * cleared. + * Do sign extension if the mode is signed, otherwise to zero extension. */ -static void sign_extend(char *calc_buffer, ir_mode *mode) { - if (mode_is_signed(mode)) { - int bits = get_mode_size_bits(mode) - 1; - int ofs = bits >> 2; - int max = max_digit[bits & 3]; - int i; - - if (calc_buffer[ofs] > max) { - /* sign bit is set, we need sign expansion */ - - for (i = ofs + 1; i < calc_buffer_size; ++i) - calc_buffer[i] = SC_F; - calc_buffer[ofs] = sex_digit[bits & 3]; - } - } +void sign_extend(void *buffer, ir_mode *mode) +{ + char *calc_buffer = (char*) buffer; + int bits = get_mode_size_bits(mode) - 1; + int nibble = bits >> 2; + int max = max_digit[bits & 3]; + int i; + + if (mode_is_signed(mode)) { + if (calc_buffer[nibble] > max) { + /* sign bit is set, we need sign expansion */ + + for (i = nibble + 1; i < calc_buffer_size; ++i) + calc_buffer[i] = SC_F; + calc_buffer[nibble] |= sex_digit[bits & 3]; + } else { + /* set all bits to zero */ + for (i = nibble + 1; i < calc_buffer_size; ++i) + calc_buffer[i] = SC_0; + calc_buffer[nibble] &= zex_digit[bits & 3]; + } + } else { + /* do zero extension */ + for (i = nibble + 1; i < calc_buffer_size; ++i) + calc_buffer[i] = SC_0; + calc_buffer[nibble] &= zex_digit[bits & 3]; + } +} + +/* we assume that '0'-'9', 'a'-'z' and 'A'-'Z' are a range. + * The C-standard does theoretically allow otherwise. */ +static inline void check_ascii(void) +{ + /* C standard guarantees that '0'-'9' is a range */ + assert('b'-'a' == 1 + && 'c'-'a' == 2 + && 'd'-'a' == 3 + && 'e'-'a' == 4 + && 'f'-'a' == 5); + assert('B'-'A' == 1 + && 'C'-'A' == 2 + && 'D'-'A' == 3 + && 'E'-'A' == 4 + && 'F'-'A' == 5); } -/* FIXME doesn't check for overflows */ -void sc_val_from_str(const char *str, unsigned int len, void *buffer, ir_mode *mode) +int sc_val_from_str(char sign, unsigned base, const char *str, + size_t len, void *buffer) { - const char *orig_str = str; - unsigned int orig_len = len; - - char sign = 0; - char *base, *val; - - base = alloca(calc_buffer_size); - val = alloca(calc_buffer_size); - - /* verify valid pointers (not null) */ - assert(str); - /* a string no characters long is an error */ - assert(len); - - if (buffer == NULL) buffer = calc_buffer; - - CLEAR_BUFFER(buffer); - CLEAR_BUFFER(base); - CLEAR_BUFFER(val); - - /* strip leading spaces */ - while ((len > 0) && (*str == ' ')) { len--; str++; } - - /* if the first two characters are 0x or 0X -> hex - * if the first is a 0 -> oct - * else dec, strip leading -/+ and remember sign - * - * only a + or - sign is no number resulting in an error */ - if (len >= 2) - switch (str[0]) - { - case '0': - if (str[1] == 'x' || str[1] == 'X') /* hex */ - { - str += 2; - len -= 2; - base[1] = SC_1; base[0] = SC_0; - } - else /* oct */ - { - str += 1; - len -= 1; - base[1] = SC_0; base[0] = SC_8; - } - break; - - case '+': - { - str += 1; - len -= 1; - base[1] = SC_0; base[0] = SC_A; - } - break; - - case '-': - { - str += 1; - len -= 1; - sign = 1; - base[1] = SC_0; base[0] = SC_A; - } - break; - - default: /* dec, else would have begun with 0x or 0 */ - base[1] = SC_0; base[0] = SC_A; - } - - else /* dec, else would have begun with 0x or 0 */ - { - base[1] = SC_0; base[0] = SC_A; - } - - /* BEGIN string evaluation, from left to right */ - while (len > 0) - { - switch (*str) - { - case 'f': - case 'e': - case 'd': - case 'c': - case 'b': - case 'a': - if (base[0] > SC_9 || base[1] > SC_0) /* (base > 10) */ - { - val[0] = _digit((*str)-'a'+10); - } - else fail_char(orig_str, orig_len, *str, str-orig_str+1); - break; - - case 'F': - case 'E': - case 'D': - case 'C': - case 'B': - case 'A': - if (base[0] > SC_9 || base[1] > SC_0) /* (base > 10) */ - { - val[0] = _digit((*str)-'A'+10); - } - else fail_char(orig_str, orig_len, *str, str-orig_str+1); - break; - - case '9': - case '8': - if (base[0] > SC_7 || base[1] > SC_0) /* (base > 8) */ - { - val[0] = _digit((*str)-'0'); - } - else fail_char(orig_str, orig_len, *str, str-orig_str+1); - break; - - case '7': - case '6': - case '5': - case '4': - case '3': - case '2': - case '1': - case '0': - { - val[0] = _digit((*str)-'0'); - } - break; - - default: - fail_char(orig_str, orig_len, *str, str-orig_str+1); - } /* switch(*str) */ - - /* Radix conversion from base b to base B: - * (UnUn-1...U1U0)b == ((((Un*b + Un-1)*b + ...)*b + U1)*b + U0)B */ - _mul(base, calc_buffer, calc_buffer); /* multiply current value with base */ - _add(val, calc_buffer, calc_buffer); /* add next digit to current value */ - - /* get ready for the next letter */ - str++; - len--; - - } /* while (len > 0 ) */ - - if (sign) - _negate(calc_buffer, calc_buffer); - - /* beware: even if hex numbers have no sign, we need sign extension here */ - sign_extend(calc_buffer, mode); + char *sc_base, *val; + + assert(sign == -1 || sign == 1); + assert(str != NULL); + assert(len > 0); + check_ascii(); + + assert(base > 1 && base <= 16); + sc_base = (char*) alloca(calc_buffer_size); + sc_val_from_ulong(base, sc_base); + + val = (char*) alloca(calc_buffer_size); + if (buffer == NULL) + buffer = calc_buffer; + + CLEAR_BUFFER(buffer); + CLEAR_BUFFER(val); + + /* BEGIN string evaluation, from left to right */ + while (len > 0) { + char c = *str; + unsigned v; + if (c >= '0' && c <= '9') + v = c - '0'; + else if (c >= 'A' && c <= 'F') + v = c - 'A' + 10; + else if (c >= 'a' && c <= 'f') + v = c - 'a' + 10; + else + return 0; + + if (v >= base) + return 0; + val[0] = v; + + /* Radix conversion from base b to base B: + * (UnUn-1...U1U0)b == ((((Un*b + Un-1)*b + ...)*b + U1)*b + U0)B */ + /* multiply current value with base */ + do_mul(sc_base, (const char*) buffer, (char*) buffer); + /* add next digit to current value */ + do_add(val, (const char*) buffer, (char*) buffer); + + /* get ready for the next letter */ + str++; + len--; + } + + if (sign < 0) + do_negate((const char*) buffer, (char*) buffer); + + return 1; } void sc_val_from_long(long value, void *buffer) { - char *pos; - char sign, is_minlong; + char *pos; + char sign, is_minlong; - if (buffer == NULL) buffer = calc_buffer; - pos = buffer; + if (buffer == NULL) buffer = calc_buffer; + pos = (char*) buffer; - sign = (value < 0); - is_minlong = value == LONG_MIN; + sign = (value < 0); + is_minlong = value == LONG_MIN; - /* use absolute value, special treatment of MIN_LONG to avoid overflow */ - if (sign) { - if (is_minlong) - value = -(value+1); - else - value = -value; - } + /* use absolute value, special treatment of MIN_LONG to avoid overflow */ + if (sign) { + if (is_minlong) + value = -(value+1); + else + value = -value; + } - CLEAR_BUFFER(buffer); + CLEAR_BUFFER(buffer); - while ((value != 0) && (pos < (char*)buffer + calc_buffer_size)) - { - *pos++ = _digit(value & 0xf); - value >>= 4; - } + while ((value != 0) && (pos < (char*)buffer + calc_buffer_size)) { + *pos++ = _digit(value & 0xf); + value >>= 4; + } - if (sign) { - if (is_minlong) - _inc(buffer, buffer); + if (sign) { + if (is_minlong) + do_inc((const char*) buffer, (char*) buffer); - _negate(buffer, buffer); - } + do_negate((const char*) buffer, (char*) buffer); + } } void sc_val_from_ulong(unsigned long value, void *buffer) { - unsigned char *pos; + unsigned char *pos; - if (buffer == NULL) buffer = calc_buffer; - pos = buffer; + if (buffer == NULL) buffer = calc_buffer; + pos = (unsigned char*) buffer; - while (pos < (unsigned char *)buffer + calc_buffer_size) - { - *pos++ = (unsigned char)_digit(value & 0xf); - value >>= 4; - } + while (pos < (unsigned char *)buffer + calc_buffer_size) { + *pos++ = (unsigned char)_digit(value & 0xf); + value >>= 4; + } } long sc_val_to_long(const void *val) { - int i; - long l = 0; - - for (i = calc_buffer_size - 1; i >= 0; i--) - { - l = (l << 4) + _val(((char *)val)[i]); - } - return l; + int i; + long l = 0; + + for (i = calc_buffer_size - 1; i >= 0; i--) { + l = (l << 4) + _val(((char *)val)[i]); + } + return l; } void sc_min_from_bits(unsigned int num_bits, unsigned int sign, void *buffer) { - char* pos; - int i, bits; + char *pos; + int i, bits; - if (buffer == NULL) buffer = calc_buffer; - CLEAR_BUFFER(buffer); + if (buffer == NULL) buffer = calc_buffer; + CLEAR_BUFFER(buffer); - if (!sign) return; /* unsigned means minimum is 0(zero) */ + if (!sign) return; /* unsigned means minimum is 0(zero) */ - pos = buffer; + pos = (char*) buffer; - bits = num_bits - 1; - for (i = 0; i < bits/4; i++) - *pos++ = SC_0; + bits = num_bits - 1; + for (i = 0; i < bits/4; i++) + *pos++ = SC_0; - *pos++ = min_digit[bits%4]; + *pos++ = min_digit[bits%4]; - for (i++; i <= calc_buffer_size - 1; i++) - *pos++ = SC_F; + for (i++; i <= calc_buffer_size - 1; i++) + *pos++ = SC_F; } void sc_max_from_bits(unsigned int num_bits, unsigned int sign, void *buffer) { - char* pos; - int i, bits; + char* pos; + int i, bits; - if (buffer == NULL) buffer = calc_buffer; - CLEAR_BUFFER(buffer); - pos = buffer; + if (buffer == NULL) buffer = calc_buffer; + CLEAR_BUFFER(buffer); + pos = (char*) buffer; - bits = num_bits - sign; - for (i = 0; i < bits/4; i++) - *pos++ = SC_F; + bits = num_bits - sign; + for (i = 0; i < bits/4; i++) + *pos++ = SC_F; - *pos++ = max_digit[bits%4]; + *pos++ = max_digit[bits%4]; - for (i++; i <= calc_buffer_size - 1; i++) - *pos++ = SC_0; + for (i++; i <= calc_buffer_size - 1; i++) + *pos++ = SC_0; } -void sc_calc(const void* value1, const void* value2, unsigned op, void *buffer) +void sc_truncate(unsigned int num_bits, void *buffer) { - char *unused_res; /* temp buffer holding unused result of divmod */ - - const char *val1 = (const char *)value1; - const char *val2 = (const char *)value2; - - unused_res = alloca(calc_buffer_size); - - CLEAR_BUFFER(calc_buffer); - carry_flag = 0; - - DEBUGPRINTF_COMPUTATION(("%s ", sc_print_hex(value1))); - - switch (op) - { - case SC_NEG: - _negate(val1, calc_buffer); - DEBUGPRINTF_COMPUTATION(("negated: %s\n", sc_print_hex(calc_buffer))); - break; - case SC_OR: - DEBUGPRINTF_COMPUTATION(("| ")); - _bitor(val1, val2, calc_buffer); - break; - case SC_AND: - DEBUGPRINTF_COMPUTATION(("& ")); - _bitand(val1, val2, calc_buffer); - break; - case SC_XOR: - DEBUGPRINTF_COMPUTATION(("^ ")); - _bitxor(val1, val2, calc_buffer); - break; - case SC_NOT: - _bitnot(val1, calc_buffer); - DEBUGPRINTF_COMPUTATION(("bit-negated: %s\n", sc_print_hex(calc_buffer))); - break; - case SC_ADD: - DEBUGPRINTF_COMPUTATION(("+ ")); - _add(val1, val2, calc_buffer); - break; - case SC_SUB: - DEBUGPRINTF_COMPUTATION(("- ")); - _sub(val1, val2, calc_buffer); - break; - case SC_MUL: - DEBUGPRINTF_COMPUTATION(("* ")); - _mul(val1, val2, calc_buffer); - break; - case SC_DIV: - DEBUGPRINTF_COMPUTATION(("/ ")); - _divmod(val1, val2, calc_buffer, unused_res); - break; - case SC_MOD: - DEBUGPRINTF_COMPUTATION(("%% ")); - _divmod(val1, val2, unused_res, calc_buffer); - break; - default: - assert(0); - } - DEBUGPRINTF_COMPUTATION(("%s -> ", sc_print_hex(value2))); - DEBUGPRINTF_COMPUTATION(("%s\n", sc_print_hex(calc_buffer))); - - if ((buffer != NULL) && (buffer != calc_buffer)) - { - memcpy(buffer, calc_buffer, calc_buffer_size); - } -} + char *cbuffer = (char*) buffer; + char *pos = cbuffer + (num_bits / 4); + char *end = cbuffer + calc_buffer_size; -void sc_bitcalc(const void* value1, const void* value2, int radius, int sign, unsigned op, void* buffer) -{ - const char *val1 = (const char *)value1; - const char *val2 = (const char *)value2; - long offset; - - carry_flag = 0; - offset = sc_val_to_long(val2); - - DEBUGPRINTF_COMPUTATION(("%s ", sc_print_hex(value1))); - switch (op) - { - case SC_SHL: - DEBUGPRINTF_COMPUTATION(("<< %ld ", offset)); - _shl(val1, calc_buffer, offset, radius, sign); - break; - case SC_SHR: - DEBUGPRINTF_COMPUTATION((">> %ld ", offset)); - _shr(val1, calc_buffer, offset, radius, sign, 0); - break; - case SC_SHRS: - DEBUGPRINTF_COMPUTATION((">>> %ld ", offset)); - _shr(val1, calc_buffer, offset, radius, sign, 1); - break; - case SC_ROT: - DEBUGPRINTF_COMPUTATION(("<<>> %ld ", offset)); - _rot(val1, calc_buffer, offset, radius, sign); - break; - default: - assert(0); - } - DEBUGPRINTF_COMPUTATION(("-> %s\n", sc_print_hex(calc_buffer))); - - if ((buffer != NULL) && (buffer != calc_buffer)) - { - memmove(buffer, calc_buffer, calc_buffer_size); - } + assert(pos < end); + + switch (num_bits % 4) { + case 0: /* nothing to do */ break; + case 1: *pos++ &= SC_1; break; + case 2: *pos++ &= SC_3; break; + case 3: *pos++ &= SC_7; break; + } + + for ( ; pos < end; ++pos) + *pos = SC_0; } -int sc_comp(const void* value1, const void* value2) +ir_relation sc_comp(void const* const value1, void const* const value2) { - int counter = calc_buffer_size - 1; - const char *val1 = (const char *)value1; - const char *val2 = (const char *)value2; - - /* compare signs first: - * the loop below can only compare values of the same sign! */ - if (_sign(val1) != _sign(val2)) return (_sign(val1) == 1)?(1):(-1); - - /* loop until two digits differ, the values are equal if there - * are no such two digits */ - while (val1[counter] == val2[counter]) - { - counter--; - if (counter < 0) return 0; - } - - /* the leftmost digit is the most significant, so this returns - * the correct result. - * This implies the digit enum is ordered */ - return (val1[counter] > val2[counter]) ? (1) : (-1); + int counter = calc_buffer_size - 1; + const char *val1 = (const char *)value1; + const char *val2 = (const char *)value2; + + /* compare signs first: + * the loop below can only compare values of the same sign! */ + if (do_sign(val1) != do_sign(val2)) + return do_sign(val1) == 1 ? ir_relation_greater : ir_relation_less; + + /* loop until two digits differ, the values are equal if there + * are no such two digits */ + while (val1[counter] == val2[counter]) { + counter--; + if (counter < 0) return ir_relation_equal; + } + + /* the leftmost digit is the most significant, so this returns + * the correct result. + * This implies the digit enum is ordered */ + return val1[counter] > val2[counter] ? ir_relation_greater : ir_relation_less; } int sc_get_highest_set_bit(const void *value) { - const char *val = (const char*)value; - int high, counter; - - high = calc_buffer_size * 4 - 1; - - for (counter = calc_buffer_size-1; counter >= 0; counter--) { - if (val[counter] == SC_0) high -= 4; - else { - if (val[counter] > SC_7) return high; - else if (val[counter] > SC_3) return high - 1; - else if (val[counter] > SC_1) return high - 2; - else return high - 3; - } - } - return high; + const char *val = (const char*)value; + int high, counter; + + high = calc_buffer_size * 4 - 1; + + for (counter = calc_buffer_size-1; counter >= 0; counter--) { + if (val[counter] == SC_0) + high -= 4; + else { + if (val[counter] > SC_7) return high; + else if (val[counter] > SC_3) return high - 1; + else if (val[counter] > SC_1) return high - 2; + else return high - 3; + } + } + return high; } int sc_get_lowest_set_bit(const void *value) { - const char *val = (const char*)value; - int low, counter; - char sign; - - sign = (_sign(val)==1)?(SC_0):(SC_F); - low = 0; - - for (counter = 0; counter < calc_buffer_size; counter++) { - if (val[counter] == SC_0) low += 4; - else { - if (val[counter] < SC_2) return low; - else if (val[counter] < SC_4) return low + 1; - else if (val[counter] < SC_8) return low + 2; - else return low + 3; - } - } - return -1; + const char *val = (const char*)value; + int low, counter; + + low = 0; + for (counter = 0; counter < calc_buffer_size; counter++) { + switch (val[counter]) { + case SC_1: + case SC_3: + case SC_5: + case SC_7: + case SC_9: + case SC_B: + case SC_D: + case SC_F: + return low; + case SC_2: + case SC_6: + case SC_A: + case SC_E: + return low + 1; + case SC_4: + case SC_C: + return low + 2; + case SC_8: + return low + 3; + default: + low += 4; + } + } + return -1; } -int sc_is_zero(const void *value) +int sc_get_bit_at(const void *value, unsigned pos) +{ + const char *val = (const char*) value; + unsigned nibble = pos >> 2; + + return (val[nibble] & SHIFT(pos & 3)) != SC_0; +} + +void sc_set_bit_at(void *value, unsigned pos) { - const char* val = (const char *)value; - int counter; + char *val = (char*) value; + unsigned nibble = pos >> 2; + + val[nibble] |= SHIFT(pos & 3); +} - for (counter = 0; counter < calc_buffer_size; counter++) { - if (val[counter] != SC_0) return 0; - } - return 1; +int sc_is_zero(const void *value) +{ + const char* val = (const char *)value; + int counter; + + for (counter = 0; counter < calc_buffer_size; ++counter) { + if (val[counter] != SC_0) + return 0; + } + return 1; } int sc_is_negative(const void *value) { - return _sign(value) == -1; + return do_sign((const char*) value) == -1; } int sc_had_carry(void) { - return carry_flag; + return carry_flag; } unsigned char sc_sub_bits(const void *value, int len, unsigned byte_ofs) { - const char *val = (const char *)value; - int nibble_ofs = 2 * byte_ofs; - unsigned char res; - - /* the current scheme uses one byte to store a nibble */ - if (nibble_ofs >= len) - return 0; - - res = _val(val[nibble_ofs]); - if (len > nibble_ofs + 1) - res |= _val(val[nibble_ofs + 1]) << 4; - - return res; + const char *val = (const char *)value; + int nibble_ofs = 2 * byte_ofs; + unsigned char res; + + /* the current scheme uses one byte to store a nibble */ + if (4 * nibble_ofs >= len) + return 0; + + res = _val(val[nibble_ofs]); + if (len > 4 * (nibble_ofs + 1)) + res |= _val(val[nibble_ofs + 1]) << 4; + + /* kick bits outsize */ + if (len - 8 * byte_ofs < 8) { + res &= (1 << (len - 8 * byte_ofs)) - 1; + } + return res; } /* * convert to a string * FIXME: Doesn't check buffer bounds */ -const char *sc_print(const void *value, unsigned bits, enum base_t base) +const char *sc_print(const void *value, unsigned bits, enum base_t base, int signed_mode) { - static const char big_digits[] = "0123456789ABCDEF"; - static const char small_digits[] = "0123456789abcdef"; - - char *base_val, *div1_res, *div2_res, *rem_res; - int counter, nibbles, i, sign; - char x; - - const char *val = (const char *)value; - const char *p; - char *m, *n, *t; - char *pos; - const char *digits = small_digits; - - base_val = alloca(calc_buffer_size); - div1_res = alloca(calc_buffer_size); - div2_res = alloca(calc_buffer_size); - rem_res = alloca(calc_buffer_size); - - pos = output_buffer + bit_pattern_size; - *(--pos) = '\0'; - - /* special case */ - if (bits == 0) { - bits = bit_pattern_size; -#ifdef STRCALC_DEBUG_FULLPRINT - bits <<= 1; -#endif - } - nibbles = bits >> 2; - switch (base) { - - case SC_HEX: - digits = big_digits; - case SC_hex: - for (counter = 0; counter < nibbles; ++counter) { - *(--pos) = digits[_val(val[counter])]; -#ifdef STRCALC_DEBUG_GROUPPRINT - if ((counter+1)%8 == 0) - *(--pos) = ' '; -#endif - } - - /* last nibble must be masked */ - if (bits & 3) { - x = and_table[_val(val[++counter])][bits & 3]; - *(--pos) = digits[_val(x)]; - } - - /* now kill zeros */ - for (; counter > 1; --counter, ++pos) { -#ifdef STRCALC_DEBUG_GROUPPRINT - if (pos[0] == ' ') ++pos; -#endif - if (pos[0] != '0') - break; - } - break; - - case SC_BIN: - for (counter = 0; counter < nibbles; ++counter) { - pos -= 4; - p = binary_table[_val(val[counter])]; - pos[0] = p[0]; - pos[1] = p[1]; - pos[2] = p[2]; - pos[3] = p[3]; - } - - /* last nibble must be masked */ - if (bits & 3) { - x = and_table[_val(val[++counter])][bits & 3]; - - pos -= 4; - p = binary_table[_val(x)]; - pos[0] = p[0]; - pos[1] = p[1]; - pos[2] = p[2]; - pos[3] = p[3]; - } - - /* now kill zeros */ - for (counter <<= 2; counter > 1; --counter, ++pos) - if (pos[0] != '0') - break; - break; - - case SC_DEC: - case SC_OCT: - memset(base_val, SC_0, calc_buffer_size); - base_val[0] = base == SC_DEC ? SC_A : SC_8; - - p = val; - sign = 0; - if (base == SC_DEC) { - /* check for negative values */ - if (_bit(val, bits - 1)) { - _negate(val, div2_res); - sign = 1; - p = div2_res; - } - } - - /* transfer data into oscillating buffers */ - memset(div1_res, SC_0, calc_buffer_size); - for (counter = 0; counter < nibbles; ++counter) - div1_res[counter] = p[counter]; - - /* last nibble must be masked */ - if (bits & 3) { - ++counter; - - div1_res[counter] = and_table[_val(p[counter])][bits & 3]; - } - - m = div1_res; - n = div2_res; - for (;;) { - _divmod(m, base_val, n, rem_res); - t = m; - m = n; - n = t; - *(--pos) = digits[_val(rem_res[0])]; - - x = 0; - for (i = 0; i < sizeof(div1_res); ++i) - x |= _val(m[i]); - - if (x == 0) - break; - } - if (sign) - *(--pos) = '-'; - break; - - default: - printf("%i\n", base); - assert(0); - return NULL; -} - return pos; + static const char big_digits[] = "0123456789ABCDEF"; + static const char small_digits[] = "0123456789abcdef"; + + char *base_val, *div1_res, *div2_res, *rem_res; + int counter, nibbles, i, sign, mask; + char x; + + const char *val = (const char *)value; + const char *p; + char *m, *n, *t; + char *pos; + const char *digits = small_digits; + + base_val = (char*) alloca(calc_buffer_size); + div1_res = (char*) alloca(calc_buffer_size); + div2_res = (char*) alloca(calc_buffer_size); + rem_res = (char*) alloca(calc_buffer_size); + + pos = output_buffer + bit_pattern_size; + *(--pos) = '\0'; + + /* special case */ + if (bits == 0) { + bits = bit_pattern_size; + } + nibbles = bits >> 2; + switch (base) { + + case SC_HEX: + digits = big_digits; + case SC_hex: + for (counter = 0; counter < nibbles; ++counter) { + *(--pos) = digits[_val(val[counter])]; + } + + /* last nibble must be masked */ + if (bits & 3) { + mask = zex_digit[(bits & 3) - 1]; + x = val[counter++] & mask; + *(--pos) = digits[_val(x)]; + } + + /* now kill zeros */ + for (; counter > 1; --counter, ++pos) { + if (pos[0] != '0') + break; + } + break; + + case SC_BIN: + for (counter = 0; counter < nibbles; ++counter) { + pos -= 4; + p = binary_table[_val(val[counter])]; + pos[0] = p[0]; + pos[1] = p[1]; + pos[2] = p[2]; + pos[3] = p[3]; + } + + /* last nibble must be masked */ + if (bits & 3) { + mask = zex_digit[(bits & 3) - 1]; + x = val[counter++] & mask; + + pos -= 4; + p = binary_table[_val(x)]; + pos[0] = p[0]; + pos[1] = p[1]; + pos[2] = p[2]; + pos[3] = p[3]; + } + + /* now kill zeros */ + for (counter <<= 2; counter > 1; --counter, ++pos) + if (pos[0] != '0') + break; + break; + + case SC_DEC: + case SC_OCT: + memset(base_val, SC_0, calc_buffer_size); + base_val[0] = base == SC_DEC ? SC_A : SC_8; + + p = val; + sign = 0; + if (signed_mode && base == SC_DEC) { + /* check for negative values */ + if (do_bit(val, bits - 1)) { + do_negate(val, div2_res); + sign = 1; + p = div2_res; + } + } + + /* transfer data into oscillating buffers */ + memset(div1_res, SC_0, calc_buffer_size); + for (counter = 0; counter < nibbles; ++counter) + div1_res[counter] = p[counter]; + + /* last nibble must be masked */ + if (bits & 3) { + mask = zex_digit[(bits & 3) - 1]; + div1_res[counter] = p[counter] & mask; + ++counter; + } + + m = div1_res; + n = div2_res; + for (;;) { + do_divmod(m, base_val, n, rem_res); + t = m; + m = n; + n = t; + *(--pos) = digits[_val(rem_res[0])]; + + x = 0; + for (i = 0; i < calc_buffer_size; ++i) + x |= _val(m[i]); + + if (x == 0) + break; + } + if (sign) + *(--pos) = '-'; + break; + + default: + panic("Unsupported base %d", base); + } + return pos; } void init_strcalc(int precision) { - if (calc_buffer == NULL) { - if (precision <= 0) precision = SC_DEFAULT_PRECISION; + if (calc_buffer == NULL) { + if (precision <= 0) precision = SC_DEFAULT_PRECISION; + + /* round up to multiple of 4 */ + precision = (precision + 3) & ~3; + + bit_pattern_size = (precision); + calc_buffer_size = (precision / 2); + max_value_size = (precision / 4); + + calc_buffer = XMALLOCN(char, calc_buffer_size + 1); + output_buffer = XMALLOCN(char, bit_pattern_size + 1); + } +} + + +void finish_strcalc(void) +{ + free(calc_buffer); calc_buffer = NULL; + free(output_buffer); output_buffer = NULL; +} - /* round up to multiple of 4 */ - precision = (precision + 3) & ~3; +int sc_get_precision(void) +{ + return bit_pattern_size; +} - bit_pattern_size = (precision); - calc_buffer_size = (precision / 2); - max_value_size = (precision / 4); - calc_buffer = malloc(calc_buffer_size+1 * sizeof(char)); - output_buffer = malloc(bit_pattern_size+1 * sizeof(char)); +void sc_add(const void *value1, const void *value2, void *buffer) +{ + CLEAR_BUFFER(calc_buffer); + carry_flag = 0; - if (calc_buffer == NULL || output_buffer == NULL) { - assert(0 && "malloc failed"); - exit(-1); - } + do_add((const char*) value1, (const char*) value2, (char*) calc_buffer); - DEBUGPRINTF(("init strcalc: \n\tPRECISION: %d\n\tCALC_BUFFER_SIZE = %d\n\tMAX_VALUE_SIZE = %d\n\tbuffer pointer: %p\n", precision, calc_buffer_size, max_value_size, calc_buffer)); - } + if ((buffer != NULL) && (buffer != calc_buffer)) { + memcpy(buffer, calc_buffer, calc_buffer_size); + } } +void sc_sub(const void *value1, const void *value2, void *buffer) +{ + CLEAR_BUFFER(calc_buffer); + carry_flag = 0; + + do_sub((const char*) value1, (const char*) value2, calc_buffer); -void finish_strcalc() { - free(calc_buffer); calc_buffer = NULL; - free(output_buffer); output_buffer = NULL; + if ((buffer != NULL) && (buffer != calc_buffer)) { + memcpy(buffer, calc_buffer, calc_buffer_size); + } } -int sc_get_precision(void) +void sc_neg(const void *value1, void *buffer) +{ + carry_flag = 0; + + do_negate((const char*) value1, calc_buffer); + + if ((buffer != NULL) && (buffer != calc_buffer)) { + memcpy(buffer, calc_buffer, calc_buffer_size); + } +} + +void sc_and(const void *value1, const void *value2, void *buffer) +{ + CLEAR_BUFFER(calc_buffer); + carry_flag = 0; + + do_bitand((const char*) value1, (const char*) value2, calc_buffer); + + if ((buffer != NULL) && (buffer != calc_buffer)) { + memcpy(buffer, calc_buffer, calc_buffer_size); + } +} + +void sc_andnot(const void *value1, const void *value2, void *buffer) +{ + CLEAR_BUFFER(calc_buffer); + carry_flag = 0; + + do_bitandnot((const char*) value1, (const char*) value2, calc_buffer); + + if (buffer != NULL && buffer != calc_buffer) { + memcpy(buffer, calc_buffer, calc_buffer_size); + } +} + +void sc_or(const void *value1, const void *value2, void *buffer) +{ + CLEAR_BUFFER(calc_buffer); + carry_flag = 0; + + do_bitor((const char*) value1, (const char*) value2, calc_buffer); + + if ((buffer != NULL) && (buffer != calc_buffer)) { + memcpy(buffer, calc_buffer, calc_buffer_size); + } +} + +void sc_xor(const void *value1, const void *value2, void *buffer) +{ + CLEAR_BUFFER(calc_buffer); + carry_flag = 0; + + do_bitxor((const char*) value1, (const char*) value2, calc_buffer); + + if ((buffer != NULL) && (buffer != calc_buffer)) { + memcpy(buffer, calc_buffer, calc_buffer_size); + } +} + +void sc_not(const void *value1, void *buffer) +{ + CLEAR_BUFFER(calc_buffer); + carry_flag = 0; + + do_bitnot((const char*) value1, calc_buffer); + + if ((buffer != NULL) && (buffer != calc_buffer)) { + memcpy(buffer, calc_buffer, calc_buffer_size); + } +} + +void sc_mul(const void *value1, const void *value2, void *buffer) +{ + CLEAR_BUFFER(calc_buffer); + carry_flag = 0; + + do_mul((const char*) value1, (const char*) value2, calc_buffer); + + if ((buffer != NULL) && (buffer != calc_buffer)) { + memcpy(buffer, calc_buffer, calc_buffer_size); + } +} + +void sc_div(const void *value1, const void *value2, void *buffer) +{ + /* temp buffer holding unused result of divmod */ + char *unused_res = (char*) alloca(calc_buffer_size); + + CLEAR_BUFFER(calc_buffer); + carry_flag = 0; + + do_divmod((const char*) value1, (const char*) value2, calc_buffer, unused_res); + + if ((buffer != NULL) && (buffer != calc_buffer)) { + memcpy(buffer, calc_buffer, calc_buffer_size); + } +} + +void sc_mod(const void *value1, const void *value2, void *buffer) +{ + /* temp buffer holding unused result of divmod */ + char *unused_res = (char*) alloca(calc_buffer_size); + + CLEAR_BUFFER(calc_buffer); + carry_flag = 0; + + do_divmod((const char*) value1, (const char*) value2, unused_res, calc_buffer); + + if ((buffer != NULL) && (buffer != calc_buffer)) { + memcpy(buffer, calc_buffer, calc_buffer_size); + } +} + +void sc_divmod(const void *value1, const void *value2, void *div_buffer, void *mod_buffer) +{ + CLEAR_BUFFER(calc_buffer); + carry_flag = 0; + + do_divmod((const char*) value1, (const char*) value2, (char*) div_buffer, (char*) mod_buffer); +} + + +void sc_shlI(const void *val1, long shift_cnt, int bitsize, int sign, void *buffer) +{ + carry_flag = 0; + + do_shl((const char*) val1, calc_buffer, shift_cnt, bitsize, sign); + + if ((buffer != NULL) && (buffer != calc_buffer)) { + memmove(buffer, calc_buffer, calc_buffer_size); + } +} + +void sc_shl(const void *val1, const void *val2, int bitsize, int sign, void *buffer) +{ + long offset = sc_val_to_long(val2); + + sc_shlI(val1, offset, bitsize, sign, buffer); +} + +void sc_shrI(const void *val1, long shift_cnt, int bitsize, int sign, void *buffer) +{ + carry_flag = 0; + + do_shr((const char*) val1, calc_buffer, shift_cnt, bitsize, sign, 0); + + if ((buffer != NULL) && (buffer != calc_buffer)) { + memmove(buffer, calc_buffer, calc_buffer_size); + } +} + +void sc_shr(const void *val1, const void *val2, int bitsize, int sign, void *buffer) +{ + long shift_cnt = sc_val_to_long(val2); + + sc_shrI(val1, shift_cnt, bitsize, sign, buffer); +} + +void sc_shrsI(const void *val1, long shift_cnt, int bitsize, int sign, void *buffer) +{ + carry_flag = 0; + + do_shr((const char*) val1, calc_buffer, shift_cnt, bitsize, sign, 1); + + if ((buffer != NULL) && (buffer != calc_buffer)) { + memmove(buffer, calc_buffer, calc_buffer_size); + } +} + +void sc_shrs(const void *val1, const void *val2, int bitsize, int sign, void *buffer) +{ + long offset = sc_val_to_long(val2); + + carry_flag = 0; + + do_shr((const char*) val1, calc_buffer, offset, bitsize, sign, 1); + + if ((buffer != NULL) && (buffer != calc_buffer)) { + memmove(buffer, calc_buffer, calc_buffer_size); + } +} + +void sc_rotl(const void *val1, const void *val2, int bitsize, int sign, void *buffer) +{ + long offset = sc_val_to_long(val2); + + carry_flag = 0; + + do_rotl((const char*) val1, calc_buffer, offset, bitsize, sign); + + if ((buffer != NULL) && (buffer != calc_buffer)) { + memmove(buffer, calc_buffer, calc_buffer_size); + } +} + +void sc_zero(void *buffer) { - return bit_pattern_size; + if (buffer == NULL) + buffer = calc_buffer; + CLEAR_BUFFER(buffer); + carry_flag = 0; }