goto end;
case -1: /* dividend < divisor */
- memcpy(rem, rDividend, calc_buffer_size);
+ memcpy(rem, dividend, calc_buffer_size);
goto end;
default: /* unluckily division is necessary :( */
case 'c':
case 'b':
case 'a':
- if (base[0] > SC_9 || base[1] > SC_0) { /* (base > 10) */
+ if (base[0] > SC_A || base[1] > SC_0) { /* (base > 10) */
val[0] = _digit((*str)-'a'+10);
}
else
case 'C':
case 'B':
case 'A':
- if (base[0] > SC_9 || base[1] > SC_0) { /* (base > 10) */
+ if (base[0] > SC_A || base[1] > SC_0) { /* (base > 10) */
val[0] = _digit((*str)-'A'+10);
}
else
case '9':
case '8':
- if (base[0] > SC_7 || base[1] > SC_0) { /* (base > 8) */
+ if (base[0] > SC_8 || base[1] > SC_0) { /* (base > 8) */
val[0] = _digit((*str)-'0');
}
else
return 0;
}
+void sc_set_bit_at(void *value, unsigned pos)
+{
+ char *val = value;
+ unsigned nibble = pos >> 2;
+
+ 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;
/* last nibble must be masked */
if (bits & 3) {
- mask = zex_digit[bits & 3];
+ mask = zex_digit[(bits & 3) - 1];
x = and_table[_val(val[counter++])][mask];
*(--pos) = digits[_val(x)];
}
/* last nibble must be masked */
if (bits & 3) {
- mask = zex_digit[bits & 3];
+ mask = zex_digit[(bits & 3) - 1];
x = and_table[_val(val[counter++])][mask];
pos -= 4;
/* last nibble must be masked */
if (bits & 3) {
- mask = zex_digit[bits & 3];
+ mask = zex_digit[(bits & 3) - 1];
div1_res[counter] = and_table[_val(p[counter])][mask];
++counter;
}