-/****i* strcalc/implementation
+/*
+ * Copyright (C) 1995-2008 University of Karlsruhe. All right reserved.
*
- * AUTHORS
- * Matthias Heil
+ * This file is part of libFirm.
*
- * NOTES
- ******/
-
-#include <assert.h> /* assertions */
-#include <string.h> /* memset/memcmp */
+ * This file may be distributed and/or modified under the terms of the
+ * GNU General Public License version 2 as published by the Free Software
+ * Foundation and appearing in the file LICENSE.GPL included in the
+ * packaging of this file.
+ *
+ * Licensees holding valid libFirm Professional Edition licenses may use
+ * this file in accordance with the libFirm Commercial License.
+ * Agreement provided with the Software.
+ *
+ * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
+ * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+ * PURPOSE.
+ */
-#include "strcalc.h"
+/**
+ * @file
+ * @brief Provides basic mathematical operations on values represented as strings.
+ * @date 2003
+ * @author Mathias Heil
+ * @version $Id$
+ */
+#include "config.h"
-#include <stdio.h> /* output for error messages */
#include <stdlib.h>
+#include <string.h>
+#include <assert.h>
+#include <stdio.h>
+#include <limits.h>
+
+#include "strcalc.h"
+#include "xmalloc.h"
+#include "error.h"
/*
* local definitions and macros
*/
-#define CLEAR_CALC_BUFFER() assert(calc_buffer); memset(calc_buffer, SC_0, CALC_BUFFER_SIZE)
+#define CLEAR_BUFFER(b) assert(b); memset(b, SC_0, calc_buffer_size)
#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, 0)
+# define sc_print_dec(a) sc_print((a), 0, SC_DEC, 1)
+# define sc_print_oct(a) sc_print((a), 0, SC_OCT, 0)
+# define sc_print_bin(a) sc_print((a), 0, SC_BIN, 0)
+
+#ifdef STRCALC_DEBUG_PRINTCOMP
+# define DEBUGPRINTF_COMPUTATION(x) printf x
+#else
+# define DEBUGPRINTF_COMPUTATION(x) ((void)0)
+#endif
#ifdef STRCALC_DEBUG
- /* shortcut output for debugging only, gices always full precisition */
-# 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)
# define DEBUGPRINTF(x) printf x
#else
# define DEBUGPRINTF(x) ((void)0)
#endif
+
/*
* private variables
*/
-
static char *calc_buffer = NULL; /* buffer holding all results */
static char *output_buffer = NULL; /* buffer for output */
-static int BIT_PATTERN_SIZE;
-static int CALC_BUFFER_SIZE;
-static int MAX_VALUE_SIZE;
-
+static int bit_pattern_size; /* maximum number of bits */
+static int calc_buffer_size; /* size of internally stored values */
+static int max_value_size; /* maximum size of values */
+
+static int carry_flag; /**< some computation set the carry_flag:
+ - right shift if bits were lost due to shifting
+ - division if there was a remainder
+ However, the meaning of carry is machine dependent
+ and often defined in other ways! */
+
+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 };
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_D, SC_E, SC_D, SC_E },
+ 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_F, SC_0}, {SC_7, SC_8}, {SC_3, SC_C}, {SC_1, SC_E} }
};
-/* for converting to binary string */
+/** 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"
+ "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);
+ 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);
}
-static void _bitnot(const char *val, char *buffer)
-{
- int counter;
+/**
+ * implements the bitwise NOT operation
+ */
+static void do_bitnot(const char *val, char *buffer) {
+ int counter;
- for (counter = 0; counter<CALC_BUFFER_SIZE; counter++)
- buffer[counter] = not_table[_val(val[counter])];
+ for (counter = 0; counter<calc_buffer_size; counter++)
+ buffer[counter] = not_table[_val(val[counter])];
}
-static void _bitor(const char *val1, const char *val2, char *buffer)
-{
- int counter;
+/**
+ * implements the bitwise OR operation
+ */
+static void do_bitor(const char *val1, const char *val2, char *buffer) {
+ int counter;
- for (counter = 0; counter<CALC_BUFFER_SIZE; counter++)
- buffer[counter] = or_table[_val(val1[counter])][_val(val2[counter])];
+ for (counter = 0; counter<calc_buffer_size; counter++)
+ buffer[counter] = or_table[_val(val1[counter])][_val(val2[counter])];
}
-static void _bitxor(const char *val1, const char *val2, char *buffer)
-{
- int counter;
+/**
+ * implements the bitwise eXclusive OR operation
+ */
+static void do_bitxor(const char *val1, const char *val2, char *buffer) {
+ int counter;
- for (counter = 0; counter<CALC_BUFFER_SIZE; counter++)
- buffer[counter] = xor_table[_val(val1[counter])][_val(val2[counter])];
+ for (counter = 0; counter<calc_buffer_size; counter++)
+ buffer[counter] = xor_table[_val(val1[counter])][_val(val2[counter])];
}
-static void _bitand(const char *val1, const char *val2, char *buffer)
-{
- int counter;
+/**
+ * implements the bitwise AND operation
+ */
+static void do_bitand(const char *val1, const char *val2, char *buffer) {
+ int counter;
- for (counter = 0; counter<CALC_BUFFER_SIZE; counter++)
- buffer[counter] = and_table[_val(val1[counter])][_val(val2[counter])];
+ for (counter = 0; counter<calc_buffer_size; counter++)
+ buffer[counter] = and_table[_val(val1[counter])][_val(val2[counter])];
}
-static int _sign(const char *val)
-{
- return (val[CALC_BUFFER_SIZE-1] <= SC_7) ? (1) : (-1);
+/**
+ * returns the sign bit.
+ *
+ * @todo This implementation is wrong, as it returns the highest bit of the buffer
+ * NOT the highest bit depending on the real mode
+ */
+static int do_sign(const char *val) {
+ return (val[calc_buffer_size-1] <= SC_7) ? (1) : (-1);
}
-static void _inc(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 will only
- * happen when a value changes sign. */
-}
+/**
+ * returns non-zero if bit at position pos is set
+ */
+static int do_bit(const char *val, int pos) {
+ int bit = pos & 3;
+ int nibble = pos >> 2;
-static void _negate(const char *val, char *buffer)
-{
- _bitnot(val, buffer);
- _inc(buffer, buffer);
+ return _bitisset(val[nibble], bit);
}
-static void _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];
- }
- /* loose last carry, which will occur only when changing sign */
+/**
+ * Implements a fast ADD + 1
+ */
+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. */
}
-static void _mul(const char *val1, const char *val2, char *buffer)
-{
- char temp_buffer[CALC_BUFFER_SIZE]; /* result buffer */
- char neg_val1[CALC_BUFFER_SIZE]; /* abs of val1 */
- char neg_val2[CALC_BUFFER_SIZE]; /* 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 */
-
- /* 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;
- }
- }
-
- if (sign)
- _negate(temp_buffer, buffer);
- else
- memcpy(buffer, temp_buffer, CALC_BUFFER_SIZE);
+/**
+ * Implements a unary MINUS
+ */
+static void do_negate(const char *val, char *buffer) {
+ do_bitnot(val, buffer);
+ do_inc(buffer, buffer);
}
-static void _sub(const char *val1, const char *val2, char *buffer)
-{
- char temp_buffer[CALC_BUFFER_SIZE]; /* intermediate buffer to hold -val2 */
-
- _negate(val2, temp_buffer);
- _add(val1, temp_buffer, buffer);
+/**
+ * Implements a binary ADD
+ *
+ * @todo The implementation of carry is wrong, as it is the
+ * calc_buffer_size carry, not the mode depending
+ */
+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;
}
-static void _push(const char digit, char *buffer)
-{
- int counter;
+/**
+ * Implements a binary SUB
+ */
+static void do_sub(const char *val1, const char *val2, char *buffer) {
+ char *temp_buffer = alloca(calc_buffer_size); /* intermediate buffer to hold -val2 */
- for (counter = CALC_BUFFER_SIZE - 2; counter >= 0; counter--)
- {
- buffer[counter+1] = buffer[counter];
- }
- buffer[0] = digit;
+ do_negate(val2, temp_buffer);
+ do_add(val1, temp_buffer, buffer);
}
-/* XXX: This is MOST slow */
-static void _divmod(const char *dividend, const char *divisor, char *quot, char *rem)
-{
- const char *minus_divisor;
- char neg_val1[CALC_BUFFER_SIZE];
- char neg_val2[CALC_BUFFER_SIZE];
-
- char sign = 0; /* remember result sign */
-
- int c_dividend; /* loop counters */
-
- /* clear result buffer */
- memset(quot, SC_0, CALC_BUFFER_SIZE);
- memset(rem, SC_0, CALC_BUFFER_SIZE);
-
- /* if the dividend is zero result is zero (quot is zero)*/
- if (sc_comp(dividend, quot) == 0)
- return;
- /* if the divisor is zero this won't work (quot is zero) */
- if (sc_comp(divisor, quot) == 0) assert(0 && "division by zero!");
-
- if (_sign(dividend) == -1)
- {
- _negate(dividend, neg_val1);
- sign ^= 1;
- dividend = neg_val1;
- }
-
- _negate(divisor, neg_val2);
- if (_sign(divisor) == -1)
- {
- sign ^= 1;
- minus_divisor = divisor;
- divisor = neg_val2;
- }
- else
- {
- minus_divisor = neg_val2;
- }
-
- /* if divisor >= dividend quotision 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, dividend, CALC_BUFFER_SIZE);
- return;
-
- default: /* unluckily quotision is necessary :( */
- break;
- }
-
- for (c_dividend = MAX_VALUE_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);
- }
- }
-
- if (sign)
- {
- _negate(quot, quot);
- _negate(rem, rem);
- }
+/**
+ * Implements a binary MUL
+ */
+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 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) {
+ 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)
+ do_negate(temp_buffer, buffer);
+ else
+ memcpy(buffer, temp_buffer, calc_buffer_size);
}
-static void _shl(const char *val1, char *buffer, long offset, int radius, 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 unsets 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;
- }
- }
-}
+/**
+ * Shift the buffer to left and add a 4 bit digit
+ */
+static void do_push(const char digit, char *buffer) {
+ int counter;
-static void _shr(const char *val1, char *buffer, long offset, int radius, 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)
- {
- memset(buffer, sign, CALC_BUFFER_SIZE);
- return;
- }
-
- shift = offset % 4;
- offset = offset / 4;
-
- counter = 0;
- if (radius/4 - offset > 0) {
- buffer[counter] = shrs_table[_val(val1[offset])][shift][0];
- counter = 1;
- }
-
- /* shift digits to the right with offset, carry and all */
- 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 = val1[radius/4]; /* most significant digit */
-
- /* remove sign bits if mode was signed and this is an unsigned shift */
- if (!signed_shift && is_signed) {
- msd = and_table[_val(msd)][_val(max_digit[bitoffset])];
- }
-
- shrs = shrs_table[_val(msd)][shift];
-
- /* signed shift and signed mode and negative value means all bits to the left are set */
- if (signed_shift && is_signed && (_sign(val1) == -1)) {
- buffer[counter] = or_table[_val(shrs[0])][_val(min_digit[bitoffset])];
- } else {
- buffer[counter] = shrs[0];
- }
- if (counter > 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;
- }
+ for (counter = calc_buffer_size - 2; counter >= 0; counter--) {
+ buffer[counter+1] = buffer[counter];
+ }
+ buffer[0] = digit;
}
-/* positive: low-order -> high order, negative other direction */
-static void _rot(const char *val1, char *buffer, long offset, int radius, unsigned is_signed)
-{
- char temp1[CALC_BUFFER_SIZE];
- char temp2[CALC_BUFFER_SIZE];
-
- const char *shl;
- char carry = SC_0;
-
- int counter, old_counter;
- int shift;
- int bitoffset;
+/**
+ * Implements truncating integer division and remainder.
+ *
+ * Note: This is MOST slow
+ */
+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 result 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 (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 0: /* dividend == divisor */
+ quot[0] = SC_1;
+ goto end;
+
+ case -1: /* 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) != -1) { /* 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] = add_table[_val(quot[0])][SC_1][0];
+ 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);
+}
- offset = offset % radius;
+/**
+ * Implements a Shift Left, which can either preserve the sign bit
+ * or not.
+ *
+ * @todo Assertions seems to be wrong
+ */
+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((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;
+ }
+
+ shift = shift_table[_val(shift_cnt%4)]; /* this is 2 ** (offset % 4) */
+ shift_cnt = shift_cnt / 4;
+
+ /* shift the single digits some bytes (offset) and some bits (table)
+ * to the left */
+ for (counter = 0; counter < bitsize/4 - shift_cnt; counter++) {
+ shl = mul_table[_val(val1[counter])][_val(shift)];
+ buffer[counter + shift_cnt] = or_table[_val(shl[0])][_val(carry)];
+ carry = shl[1];
+ }
+ if (bitsize%4 > 0) {
+ shl = mul_table[_val(val1[counter])][_val(shift)];
+ buffer[counter + shift_cnt] = or_table[_val(shl[0])][_val(carry)];
+ 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] = or_table[_val(buffer[shift_cnt])][_val(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] = and_table[_val(buffer[shift_cnt])][_val(max_digit[bitoffset])];
+ for (counter = shift_cnt+1; counter < calc_buffer_size; counter++) {
+ buffer[counter] = SC_0;
+ }
+ }
+}
- /* rotation by multiples of the typelength is identity */
- if (offset == 0) {
- memmove(buffer, val1, CALC_BUFFER_SIZE);
- return;
- }
+/**
+ * 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 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_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<<shift_mod)-1)) != 0)
+ carry_flag = 1;
+
+ /* shift digits to the right with offset, carry and all */
+ buffer[0] = shrs_table[_val(val1[shift_nib])][shift_mod][0];
+ for (counter = 1; counter < ((bitsize + 3) >> 2) - shift_nib; counter++) {
+ shrs = shrs_table[_val(val1[counter + shift_nib])][shift_mod];
+ 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 = 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 = and_table[_val(msd)][_val(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] = or_table[_val(shrs[0])][_val(min_digit[bitoffset])];
+ } else {
+ buffer[counter] = shrs[0];
+ }
+
+ if (counter > 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;
+ }
+}
- _shl(val1, temp1, offset, radius, is_signed);
- _shr(val1, temp2, radius - offset, radius, is_signed, 0);
- _bitor(temp1, temp2, buffer);
+/**
+ * Implements a Rotate Left.
+ * positive: low-order -> high order, negative other direction
+ */
+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;
+ }
+
+ 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 */
}
/*****************************************************************************
* public functions, declared in strcalc.h
*****************************************************************************/
-const void *sc_get_buffer(void)
-{
- return (void*)calc_buffer;
+const void *sc_get_buffer(void) {
+ return (void*)calc_buffer;
}
-const int sc_get_buffer_length(void)
-{
- return CALC_BUFFER_SIZE;
+int sc_get_buffer_length(void) {
+ return calc_buffer_size;
}
-/* XXX doesn't check for overflows */
-void sc_val_from_str(const char *str, unsigned int len)
-{
- const char *orig_str = str;
- unsigned int orig_len = len;
-
- char sign = 0;
- char base[CALC_BUFFER_SIZE];
- char val[CALC_BUFFER_SIZE];
-
- /* verify valid pointers (not null) */
- assert(str);
- /* a string no characters long is an error */
- assert(len);
-
- CLEAR_CALC_BUFFER();
- memset(base, SC_0, CALC_BUFFER_SIZE);
- memset(val, SC_0, CALC_BUFFER_SIZE);
-
- /* 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);
- }
+/**
+ * Do sign extension if the mode is signed, otherwise to zero extension.
+ */
+void sign_extend(void *buffer, ir_mode *mode) {
+ char *calc_buffer = 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] = or_table[(int)calc_buffer[nibble]][(int)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] = and_table[(int)calc_buffer[nibble]][(int)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] = and_table[(int)calc_buffer[nibble]][(int)zex_digit[bits & 3]];
+ }
}
-void sc_val_from_long(long value)
-{
- char *pos;
- int sign;
+/* FIXME doesn't check for overflows */
+void sc_val_from_str(const char *str, unsigned int len, void *buffer, ir_mode *mode) {
+ 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_A || 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_A || 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_8 || 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 */
+ do_mul(base, calc_buffer, calc_buffer); /* multiply current value with base */
+ do_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)
+ do_negate(calc_buffer, calc_buffer);
+
+ /* beware: even if hex numbers have no sign, we need sign extension here */
+ sign_extend(calc_buffer, mode);
+}
+
+void sc_val_from_long(long value, void *buffer) {
+ char *pos;
+ char sign, is_minlong;
+
+ if (buffer == NULL) buffer = calc_buffer;
+ pos = buffer;
- pos = calc_buffer;
- sign = (value < 0);
+ sign = (value < 0);
+ is_minlong = value == LONG_MIN;
- /* FIXME MININT won't work */
- if (sign) 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_CALC_BUFFER();
+ CLEAR_BUFFER(buffer);
- while ((value != 0) && (pos < calc_buffer + CALC_BUFFER_SIZE))
- {
- *pos++ = _digit(value % 16);
- value /= 16;
- }
+ while ((value != 0) && (pos < (char*)buffer + calc_buffer_size)) {
+ *pos++ = _digit(value & 0xf);
+ value >>= 4;
+ }
- if (sign) _negate(calc_buffer, calc_buffer);
+ if (sign) {
+ if (is_minlong)
+ do_inc(buffer, buffer);
+
+ do_negate(buffer, buffer);
+ }
}
-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;
+void sc_val_from_ulong(unsigned long value, void *buffer) {
+ unsigned char *pos;
+
+ if (buffer == NULL) buffer = calc_buffer;
+ pos = buffer;
+
+ while (pos < (unsigned char *)buffer + calc_buffer_size) {
+ *pos++ = (unsigned char)_digit(value & 0xf);
+ value >>= 4;
+ }
}
-void sc_min_from_bits(unsigned int num_bits, unsigned int sign)
-{
- char* pos;
- int i, bits;
+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;
+}
+
+void sc_min_from_bits(unsigned int num_bits, unsigned int sign, void *buffer) {
+ char *pos;
+ int i, bits;
+
+ if (buffer == NULL) buffer = calc_buffer;
+ CLEAR_BUFFER(buffer);
- CLEAR_CALC_BUFFER();
- if (!sign) return; /* unsigned means minimum is 0(zero) */
+ if (!sign) return; /* unsigned means minimum is 0(zero) */
- pos = calc_buffer;
+ pos = 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)
-{
- char* pos;
- int i, bits;
+void sc_max_from_bits(unsigned int num_bits, unsigned int sign, void *buffer) {
+ char* pos;
+ int i, bits;
- CLEAR_CALC_BUFFER();
- pos = calc_buffer;
+ if (buffer == NULL) buffer = calc_buffer;
+ CLEAR_BUFFER(buffer);
+ pos = 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)
-{
- char unused_res[CALC_BUFFER_SIZE]; /* temp buffer holding unused result of divmod */
-
- const char *val1 = (const char *)value1;
- const char *val2 = (const char *)value2;
- CLEAR_CALC_BUFFER();
-
- DEBUGPRINTF(("%s ", sc_print(value1, SC_HEX)));
-
- switch (op)
- {
- case SC_NEG:
- _negate(val1, calc_buffer);
- DEBUGPRINTF(("negated: %s\n", sc_print_hex(calc_buffer)));
- return;
- case SC_OR:
- DEBUGPRINTF(("| "));
- _bitor(val1, val2, calc_buffer);
- break;
- case SC_AND:
- DEBUGPRINTF(("& "));
- _bitand(val1, val2, calc_buffer);
- break;
- case SC_XOR:
- DEBUGPRINTF(("^ "));
- _bitxor(val1, val2, calc_buffer);
- break;
- case SC_NOT:
- _bitnot(val1, calc_buffer);
- DEBUGPRINTF(("bit-negated: %s\n", sc_print_hex(calc_buffer)));
- return;
- case SC_ADD:
- DEBUGPRINTF(("+ "));
- _add(val1, val2, calc_buffer);
- break;
- case SC_SUB:
- DEBUGPRINTF(("- "));
- _sub(val1, val2, calc_buffer);
- break;
- case SC_MUL:
- DEBUGPRINTF(("* "));
- _mul(val1, val2, calc_buffer);
- break;
- case SC_DIV:
- DEBUGPRINTF(("/ "));
- _divmod(val1, val2, calc_buffer, unused_res);
- break;
- case SC_MOD:
- DEBUGPRINTF(("%% "));
- _divmod(val1, val2, unused_res, calc_buffer);
- break;
- default:
- assert(0);
- }
- DEBUGPRINTF(("%s -> ", sc_print_hex(value2)));
- DEBUGPRINTF(("%s\n", sc_print_hex(calc_buffer)));
+void sc_truncate(unsigned int num_bits, void *buffer) {
+ char *cbuffer = buffer;
+ char *pos = cbuffer + (num_bits / 4);
+ char *end = cbuffer + calc_buffer_size;
+
+ assert(pos < end);
+
+ switch(num_bits % 4) {
+ case 0: /* nothing to do */ break;
+ case 1: *pos = and_table[_val(*pos)][SC_1]; pos++; break;
+ case 2: *pos = and_table[_val(*pos)][SC_3]; pos++; break;
+ case 3: *pos = and_table[_val(*pos)][SC_7]; pos++; break;
+ }
+
+ for( ; pos < end; ++pos)
+ *pos = SC_0;
}
-void sc_bitcalc(const void* value1, const void* value2, int radius, int sign, unsigned op)
-{
- const char *val1 = (const char *)value1;
- const char *val2 = (const char *)value2;
- long offset;
-
- offset = sc_val_to_long(val2);
-
- DEBUGPRINTF(("%s ", sc_print_hex(value1)));
- switch (op)
- {
- case SC_SHL:
- DEBUGPRINTF(("<< %d ", offset));
- _shl(val1, calc_buffer, offset, radius, sign);
- break;
- case SC_SHR:
- DEBUGPRINTF((">> %d ", offset));
- _shr(val1, calc_buffer, offset, radius, sign, 0);
- break;
- case SC_SHRS:
- DEBUGPRINTF((">>> %d ", offset));
- _shr(val1, calc_buffer, offset, radius, sign, 1);
- break;
- case SC_ROT:
- DEBUGPRINTF(("<<>> %d ", offset));
- _rot(val1, calc_buffer, offset, radius, sign);
- break;
- default:
- assert(0);
- }
- DEBUGPRINTF(("-> %s\n", sc_print_hex(calc_buffer)));
+int sc_comp(const void* value1, const void* 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 (do_sign(val1) != do_sign(val2))
+ return (do_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 sc_comp(const void* value1, const void* 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 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;
}
-int sc_get_highest_set_bit(const void *value)
-{
- const char *val = (const char*)value;
- int high, counter;
- char sign;
-
- high = CALC_BUFFER_SIZE * 4;
-
- 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;
+
+ 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_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 low;
+int sc_get_bit_at(const void *value, unsigned pos) {
+ const char *val = value;
+ unsigned nibble = pos >> 2;
+
+ if (and_table[(int) val[nibble]][(int) shift_table[pos & 3]] != SC_0)
+ return 1;
+ return 0;
}
-unsigned char sc_sub_bits(const void *value, int len, unsigned byte_ofs)
+void sc_set_bit_at(void *value, unsigned pos)
{
- const char *val = (const char *)value;
- unsigned nibble_ofs = 2 * byte_ofs;
- unsigned char res;
+ char *val = value;
+ unsigned nibble = pos >> 2;
- /* the current scheme uses one byte to store a nibble */
- if (nibble_ofs >= len)
- return 0;
+ val[nibble] = or_table[(int)val[nibble]][(int)shift_table[pos & 3]];
+}
+
+int sc_is_zero(const void *value) {
+ const char* val = (const char *)value;
+ int counter;
- res = _val(val[nibble_ofs]);
- if (len > nibble_ofs + 1)
- res |= _val(val[nibble_ofs + 1]) << 4;
+ for (counter = 0; counter < calc_buffer_size; ++counter) {
+ if (val[counter] != SC_0)
+ return 0;
+ }
+ return 1;
+}
- return res;
+int sc_is_negative(const void *value) {
+ return do_sign(value) == -1;
+}
+
+int sc_had_carry(void) {
+ 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 (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)
-{
- char base_val[CALC_BUFFER_SIZE];
- char div1_res[CALC_BUFFER_SIZE];
- char div2_res[CALC_BUFFER_SIZE];
- char rem_res[CALC_BUFFER_SIZE];
- int counter, nibbles, i, sign;
- char x;
-
- const char *val = (const char *)value;
- const char *p;
- char *m, *n, *t;
- char *pos;
-
- 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:
- for (counter = 0; counter < nibbles; ++counter)
- *(--pos) = "0123456789abcdef"[_val(val[counter])];
-
- /* last nibble must be masked */
- if (bits & 3) {
- x = and_table[_val(val[++counter])][bits & 3];
- *(--pos) = "0123456789abcdef"[_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) {
- 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;
-
- m = val;
- sign = 0;
- if (base == SC_DEC) {
- /* check for negative values */
- if (_sign(val) == -1) {
- _negate(val, div2_res);
- sign = 1;
- m = div2_res;
- }
- }
-
- /* transfer data into oscilating buffers */
- memset(div1_res, SC_0, CALC_BUFFER_SIZE);
- for (counter = 0; counter < nibbles; ++counter)
- div1_res[counter] = m[counter];
-
- /* last nibble must be masked */
- if (bits & 3) {
- ++counter;
-
- div1_res[counter] = and_table[_val(m[counter])][bits & 3];
- }
-
- m = div1_res;
- n = div2_res;
- for (;;) {
- _divmod(m, base_val, n, rem_res);
- t = m;
- m = n;
- n = t;
- *(--pos) = "0123456789abcdef"[_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:
- assert(0);
- return NULL;
+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, 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 = 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) {
+ mask = zex_digit[(bits & 3) - 1];
+ x = and_table[_val(val[counter++])][mask];
+ *(--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) {
+ mask = zex_digit[(bits & 3) - 1];
+ x = and_table[_val(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] = and_table[_val(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;
+
+ /* 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);
+
+ 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));
+ }
}
- return pos;
+
+
+void finish_strcalc(void) {
+ free(calc_buffer); calc_buffer = NULL;
+ free(output_buffer); output_buffer = NULL;
+}
+
+int sc_get_precision(void) {
+ return bit_pattern_size;
}
-void init_strcalc(int precision_in_bytes)
-{
- if (calc_buffer == NULL) {
- if (precision_in_bytes <= 0) precision_in_bytes = DEFAULT_PRECISION_IN_BYTES;
- BIT_PATTERN_SIZE = (8 * precision_in_bytes);
- CALC_BUFFER_SIZE = (4 * precision_in_bytes);
- MAX_VALUE_SIZE = (2 * precision_in_bytes);
+void sc_add(const void *value1, const void *value2, void *buffer) {
+ CLEAR_BUFFER(calc_buffer);
+ carry_flag = 0;
- calc_buffer = malloc(CALC_BUFFER_SIZE * sizeof(char));
- output_buffer = malloc(BIT_PATTERN_SIZE * sizeof(char));
+ DEBUGPRINTF_COMPUTATION(("%s + ", sc_print_hex(value1)));
+ DEBUGPRINTF_COMPUTATION(("%s -> ", sc_print_hex(value2)));
- if (calc_buffer == NULL || output_buffer == NULL)
- {
- assert(0 && "malloc failed");
- exit(-1);
- }
+ do_add(value1, value2, calc_buffer);
- DEBUGPRINTF(("init strcalc: \n\tPRECISION: %d\n\tCALC_BUFFER_SIZE = %d\n\tMAX_VALUE_SIZE = %d\n\tbuffer pointer: %p\n", precision_in_bytes, CALC_BUFFER_SIZE, MAX_VALUE_SIZE, calc_buffer));
- }
+ DEBUGPRINTF_COMPUTATION(("%s\n", sc_print_hex(calc_buffer)));
+
+ if ((buffer != NULL) && (buffer != calc_buffer)) {
+ memcpy(buffer, calc_buffer, calc_buffer_size);
+ }
}
-int get_precision()
-{
- return CALC_BUFFER_SIZE/4;
+
+void sc_sub(const void *value1, const void *value2, void *buffer) {
+ CLEAR_BUFFER(calc_buffer);
+ carry_flag = 0;
+
+ DEBUGPRINTF_COMPUTATION(("%s - ", sc_print_hex(value1)));
+ DEBUGPRINTF_COMPUTATION(("%s -> ", sc_print_hex(value2)));
+
+ do_sub(value1, value2, calc_buffer);
+
+ DEBUGPRINTF_COMPUTATION(("%s\n", sc_print_hex(calc_buffer)));
+
+ if ((buffer != NULL) && (buffer != calc_buffer)) {
+ memcpy(buffer, calc_buffer, calc_buffer_size);
+ }
+}
+
+void sc_neg(const void *value1, void *buffer) {
+ carry_flag = 0;
+
+ DEBUGPRINTF_COMPUTATION(("- %s ->", sc_print_hex(value1)));
+
+ do_negate(value1, calc_buffer);
+
+ DEBUGPRINTF_COMPUTATION(("%s\n", sc_print_hex(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;
+
+ DEBUGPRINTF_COMPUTATION(("%s & ", sc_print_hex(value1)));
+ DEBUGPRINTF_COMPUTATION(("%s -> ", sc_print_hex(value2)));
+
+ do_bitand(value1, value2, calc_buffer);
+
+ DEBUGPRINTF_COMPUTATION(("%s\n", sc_print_hex(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;
+
+ DEBUGPRINTF_COMPUTATION(("%s | ", sc_print_hex(value1)));
+ DEBUGPRINTF_COMPUTATION(("%s -> ", sc_print_hex(value2)));
+
+ do_bitor(value1, value2, calc_buffer);
+
+ DEBUGPRINTF_COMPUTATION(("%s\n", sc_print_hex(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;
+
+ DEBUGPRINTF_COMPUTATION(("%s ^ ", sc_print_hex(value1)));
+ DEBUGPRINTF_COMPUTATION(("%s -> ", sc_print_hex(value2)));
+
+ do_bitxor(value1, value2, calc_buffer);
+
+ DEBUGPRINTF_COMPUTATION(("%s\n", sc_print_hex(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;
+
+ DEBUGPRINTF_COMPUTATION(("~ %s ->", sc_print_hex(value1)));
+
+ do_bitnot(value1, calc_buffer);
+
+ DEBUGPRINTF_COMPUTATION(("%s\n", sc_print_hex(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;
+
+ DEBUGPRINTF_COMPUTATION(("%s * ", sc_print_hex(value1)));
+ DEBUGPRINTF_COMPUTATION(("%s -> ", sc_print_hex(value2)));
+
+ do_mul(value1, value2, calc_buffer);
+
+ DEBUGPRINTF_COMPUTATION(("%s\n", sc_print_hex(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 = alloca(calc_buffer_size);
+
+ CLEAR_BUFFER(calc_buffer);
+ carry_flag = 0;
+
+ DEBUGPRINTF_COMPUTATION(("%s / ", sc_print_hex(value1)));
+ DEBUGPRINTF_COMPUTATION(("%s -> ", sc_print_hex(value2)));
+
+ do_divmod(value1, value2, calc_buffer, unused_res);
+
+ DEBUGPRINTF_COMPUTATION(("%s\n", sc_print_hex(calc_buffer)));
+
+ 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 = alloca(calc_buffer_size);
+
+ CLEAR_BUFFER(calc_buffer);
+ carry_flag = 0;
+
+ DEBUGPRINTF_COMPUTATION(("%s %% ", sc_print_hex(value1)));
+ DEBUGPRINTF_COMPUTATION(("%s -> ", sc_print_hex(value2)));
+
+ do_divmod(value1, value2, unused_res, calc_buffer);
+
+ DEBUGPRINTF_COMPUTATION(("%s\n", sc_print_hex(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;
+
+ DEBUGPRINTF_COMPUTATION(("%s %% ", sc_print_hex(value1)));
+ DEBUGPRINTF_COMPUTATION(("%s -> ", sc_print_hex(value2)));
+
+ do_divmod(value1, value2, div_buffer, mod_buffer);
+
+ DEBUGPRINTF_COMPUTATION(("%s:%s\n", sc_print_hex(div_buffer), sc_print_hex(mod_buffer)));
+}
+
+
+void sc_shlI(const void *val1, long shift_cnt, int bitsize, int sign, void *buffer) {
+ carry_flag = 0;
+
+ DEBUGPRINTF_COMPUTATION(("%s << %ld ", sc_print_hex(value1), shift_cnt));
+ do_shl(val1, calc_buffer, shift_cnt, bitsize, sign);
+
+ DEBUGPRINTF_COMPUTATION(("-> %s\n", sc_print_hex(calc_buffer)));
+
+ 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;
+
+ DEBUGPRINTF_COMPUTATION(("%s >>u %ld ", sc_print_hex(value1), shift_cnt));
+ do_shr(val1, calc_buffer, shift_cnt, bitsize, sign, 0);
+
+ DEBUGPRINTF_COMPUTATION(("-> %s\n", sc_print_hex(calc_buffer)));
+
+ 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_shrs(const void *val1, const void *val2, int bitsize, int sign, void *buffer) {
+ long offset = sc_val_to_long(val2);
+
+ carry_flag = 0;
+
+ DEBUGPRINTF_COMPUTATION(("%s >>s %ld ", sc_print_hex(value1), offset));
+ do_shr(val1, calc_buffer, offset, bitsize, sign, 1);
+
+ DEBUGPRINTF_COMPUTATION(("-> %s\n", sc_print_hex(calc_buffer)));
+
+ 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;
+
+ DEBUGPRINTF_COMPUTATION(("%s <<>> %ld ", sc_print_hex(value1), offset));
+ do_rotl(val1, calc_buffer, offset, bitsize, sign);
+
+ DEBUGPRINTF_COMPUTATION(("-> %s\n", sc_print_hex(calc_buffer)));
+
+ if ((buffer != NULL) && (buffer != calc_buffer)) {
+ memmove(buffer, calc_buffer, calc_buffer_size);
+ }
+}
+
+void sc_zero(void *buffer) {
+ if (buffer == NULL)
+ buffer = calc_buffer;
+ CLEAR_BUFFER(buffer);
+ carry_flag = 0;
}
projects / libfirm / blobdiff