3 * File name: ir/tv/strcalc.c
9 * Copyright: (c) 2003 Universität Karlsruhe
10 * Licence: This file protected by GPL - GNU GENERAL PUBLIC LICENSE.
25 #include <assert.h> /* assertions */
26 #include <string.h> /* memset/memcmp */
27 #include <stdio.h> /* output for error messages */
28 #include <limits.h> /* definition of LONG_MIN, used in sc_get_val_from_long */
31 * local definitions and macros
33 #define CLEAR_BUFFER(b) assert(b); memset(b, SC_0, CALC_BUFFER_SIZE)
34 #define _val(a) ((a)-SC_0)
35 #define _digit(a) ((a)+SC_0)
36 #define _bitisset(digit, pos) (and_table[_val(digit)][_val(shift_table[pos])] != SC_0)
38 #define fail_char(a, b, c, d) _fail_char((a), (b), (c), (d), __FILE__, __LINE__)
40 /* shortcut output for debugging */
41 # define sc_print_hex(a) sc_print((a), 0, SC_HEX)
42 # define sc_print_dec(a) sc_print((a), 0, SC_DEC)
43 # define sc_print_oct(a) sc_print((a), 0, SC_OCT)
44 # define sc_print_bin(a) sc_print((a), 0, SC_BIN)
46 #ifdef STRCALC_DEBUG_PRINTCOMP
47 # define DEBUGPRINTF_COMPUTATION(x) printf x
49 # define DEBUGPRINTF_COMPUTATION(x) ((void)0)
52 # define DEBUGPRINTF(x) printf x
54 # define DEBUGPRINTF(x) ((void)0)
62 static char *calc_buffer = NULL; /* buffer holding all results */
63 static char *output_buffer = NULL; /* buffer for output */
64 static int BIT_PATTERN_SIZE; /* maximum number of bits */
65 static int CALC_BUFFER_SIZE; /* size of internally stored values */
66 static int MAX_VALUE_SIZE; /* maximum size of values */
68 static int carry_flag; /* some computation set carry_flag: */
69 /* rightshift if bits were lost due to shifting */
70 /* division if there was a remainder */
72 static const char max_digit[4] = { SC_0, SC_1, SC_3, SC_7 };
73 static const char min_digit[4] = { SC_F, SC_E, SC_C, SC_8 };
75 static const char not_table[16] = { SC_F, SC_E, SC_D, SC_C, SC_B, SC_A, SC_9, SC_8,
76 SC_7, SC_6, SC_5, SC_4, SC_3, SC_2, SC_1, SC_0 };
78 static const char shift_table[4] = { SC_1, SC_2, SC_4, SC_8 };
80 static const char and_table[16][16] = {
81 { SC_0, SC_0, SC_0, SC_0, SC_0, SC_0, SC_0, SC_0,
82 SC_0, SC_0, SC_0, SC_0, SC_0, SC_0, SC_0, SC_0 },
84 { SC_0, SC_1, SC_0, SC_1, SC_0, SC_1, SC_0, SC_1,
85 SC_0, SC_1, SC_0, SC_1, SC_0, SC_1, SC_0, SC_1 },
87 { SC_0, SC_0, SC_2, SC_2, SC_0, SC_0, SC_2, SC_2,
88 SC_0, SC_0, SC_2, SC_2, SC_0, SC_0, SC_2, SC_2 },
90 { SC_0, SC_1, SC_2, SC_3, SC_0, SC_1, SC_2, SC_3,
91 SC_0, SC_1, SC_2, SC_3, SC_0, SC_1, SC_2, SC_3 },
93 { SC_0, SC_0, SC_0, SC_0, SC_4, SC_4, SC_4, SC_4,
94 SC_0, SC_0, SC_0, SC_0, SC_4, SC_4, SC_4, SC_4 },
96 { SC_0, SC_1, SC_0, SC_1, SC_4, SC_5, SC_4, SC_5,
97 SC_0, SC_1, SC_0, SC_1, SC_4, SC_5, SC_4, SC_5 },
99 { SC_0, SC_0, SC_2, SC_2, SC_4, SC_4, SC_6, SC_6,
100 SC_0, SC_0, SC_2, SC_2, SC_4, SC_4, SC_6, SC_6 },
102 { SC_0, SC_1, SC_2, SC_3, SC_4, SC_5, SC_6, SC_7,
103 SC_0, SC_1, SC_2, SC_3, SC_4, SC_5, SC_6, SC_7 },
105 { SC_0, SC_0, SC_0, SC_0, SC_0, SC_0, SC_0, SC_0,
106 SC_8, SC_8, SC_8, SC_8, SC_8, SC_8, SC_8, SC_8 },
108 { SC_0, SC_1, SC_0, SC_1, SC_0, SC_1, SC_0, SC_1,
109 SC_8, SC_9, SC_8, SC_9, SC_8, SC_9, SC_8, SC_9 },
111 { SC_0, SC_0, SC_2, SC_2, SC_0, SC_0, SC_2, SC_2,
112 SC_8, SC_8, SC_A, SC_A, SC_8, SC_8, SC_A, SC_A },
114 { SC_0, SC_1, SC_2, SC_3, SC_0, SC_1, SC_2, SC_3,
115 SC_8, SC_9, SC_A, SC_B, SC_8, SC_9, SC_A, SC_B },
117 { SC_0, SC_0, SC_0, SC_0, SC_4, SC_4, SC_4, SC_4,
118 SC_8, SC_8, SC_8, SC_8, SC_C, SC_C, SC_C, SC_C },
120 { SC_0, SC_1, SC_0, SC_1, SC_4, SC_5, SC_4, SC_5,
121 SC_8, SC_9, SC_8, SC_9, SC_C, SC_D, SC_C, SC_D },
123 { SC_0, SC_0, SC_2, SC_2, SC_4, SC_4, SC_6, SC_6,
124 SC_8, SC_8, SC_A, SC_A, SC_C, SC_C, SC_E, SC_E },
126 { SC_0, SC_1, SC_2, SC_3, SC_4, SC_5, SC_6, SC_7,
127 SC_8, SC_9, SC_A, SC_B, SC_C, SC_D, SC_E, SC_F } };
129 static const char or_table[16][16] = {
130 { SC_0, SC_1, SC_2, SC_3, SC_4, SC_5, SC_6, SC_7,
131 SC_8, SC_9, SC_A, SC_B, SC_C, SC_D, SC_E, SC_F },
133 { SC_1, SC_1, SC_3, SC_3, SC_5, SC_5, SC_7, SC_7,
134 SC_9, SC_9, SC_B, SC_B, SC_D, SC_D, SC_F, SC_F },
136 { SC_2, SC_3, SC_2, SC_3, SC_6, SC_7, SC_6, SC_7,
137 SC_A, SC_B, SC_A, SC_B, SC_E, SC_F, SC_E, SC_F },
139 { SC_3, SC_3, SC_3, SC_3, SC_7, SC_7, SC_7, SC_7,
140 SC_B, SC_B, SC_B, SC_B, SC_F, SC_F, SC_F, SC_F },
142 { SC_4, SC_5, SC_6, SC_7, SC_4, SC_5, SC_6, SC_7,
143 SC_C, SC_D, SC_E, SC_F, SC_C, SC_D, SC_E, SC_F },
145 { SC_5, SC_5, SC_7, SC_7, SC_5, SC_5, SC_7, SC_7,
146 SC_D, SC_D, SC_F, SC_F, SC_D, SC_D, SC_F, SC_F },
148 { SC_6, SC_7, SC_6, SC_7, SC_6, SC_7, SC_6, SC_7,
149 SC_E, SC_F, SC_E, SC_F, SC_E, SC_F, SC_E, SC_F },
151 { SC_7, SC_7, SC_7, SC_7, SC_7, SC_7, SC_7, SC_7,
152 SC_F, SC_F, SC_F, SC_F, SC_F, SC_F, SC_F, SC_F },
154 { SC_8, SC_9, SC_A, SC_B, SC_C, SC_D, SC_E, SC_F,
155 SC_8, SC_9, SC_A, SC_B, SC_C, SC_D, SC_E, SC_F },
157 { SC_9, SC_9, SC_B, SC_B, SC_D, SC_D, SC_F, SC_F,
158 SC_9, SC_9, SC_B, SC_B, SC_D, SC_D, SC_F, SC_F },
160 { SC_A, SC_B, SC_A, SC_B, SC_E, SC_F, SC_E, SC_F,
161 SC_A, SC_B, SC_A, SC_B, SC_E, SC_F, SC_E, SC_F },
163 { SC_B, SC_B, SC_B, SC_B, SC_F, SC_F, SC_F, SC_F,
164 SC_B, SC_B, SC_B, SC_B, SC_F, SC_F, SC_F, SC_F },
166 { SC_C, SC_D, SC_E, SC_F, SC_C, SC_D, SC_E, SC_F,
167 SC_C, SC_D, SC_E, SC_F, SC_C, SC_D, SC_E, SC_F },
169 { SC_D, SC_D, SC_F, SC_F, SC_D, SC_D, SC_F, SC_F,
170 SC_D, SC_D, SC_F, SC_F, SC_D, SC_D, SC_F, SC_F },
172 { SC_E, SC_F, SC_E, SC_F, SC_E, SC_F, SC_E, SC_F,
173 SC_E, SC_F, SC_E, SC_F, SC_E, SC_F, SC_E, SC_F },
175 { SC_F, SC_F, SC_F, SC_F, SC_F, SC_F, SC_F, SC_F,
176 SC_F, SC_F, SC_F, SC_F, SC_F, SC_F, SC_F, SC_F } };
178 static char const xor_table[16][16] = {
179 { SC_0, SC_1, SC_2, SC_3, SC_4, SC_5, SC_6, SC_7,
180 SC_8, SC_9, SC_A, SC_B, SC_C, SC_D, SC_E, SC_F },
182 { SC_1, SC_0, SC_3, SC_2, SC_5, SC_4, SC_7, SC_6,
183 SC_9, SC_8, SC_B, SC_A, SC_D, SC_C, SC_F, SC_E },
185 { SC_2, SC_3, SC_0, SC_1, SC_6, SC_7, SC_4, SC_5,
186 SC_A, SC_B, SC_8, SC_9, SC_E, SC_F, SC_C, SC_D },
188 { SC_3, SC_2, SC_1, SC_0, SC_7, SC_6, SC_5, SC_4,
189 SC_B, SC_A, SC_9, SC_8, SC_F, SC_E, SC_D, SC_C },
191 { SC_4, SC_5, SC_6, SC_7, SC_0, SC_1, SC_2, SC_3,
192 SC_C, SC_D, SC_E, SC_F, SC_8, SC_9, SC_A, SC_B },
194 { SC_5, SC_4, SC_7, SC_6, SC_1, SC_0, SC_3, SC_2,
195 SC_D, SC_C, SC_F, SC_E, SC_9, SC_8, SC_B, SC_A },
197 { SC_6, SC_7, SC_4, SC_5, SC_2, SC_3, SC_0, SC_1,
198 SC_E, SC_F, SC_C, SC_D, SC_A, SC_B, SC_8, SC_9 },
200 { SC_7, SC_6, SC_5, SC_4, SC_3, SC_2, SC_1, SC_0,
201 SC_F, SC_E, SC_D, SC_C, SC_B, SC_A, SC_9, SC_8 },
203 { SC_8, SC_9, SC_A, SC_B, SC_C, SC_D, SC_E, SC_F,
204 SC_0, SC_1, SC_2, SC_3, SC_4, SC_5, SC_6, SC_7 },
206 { SC_9, SC_8, SC_B, SC_A, SC_D, SC_C, SC_F, SC_E,
207 SC_1, SC_0, SC_3, SC_2, SC_5, SC_4, SC_7, SC_6 },
209 { SC_A, SC_B, SC_8, SC_9, SC_E, SC_F, SC_C, SC_D,
210 SC_2, SC_3, SC_0, SC_1, SC_6, SC_7, SC_4, SC_5 },
212 { SC_B, SC_A, SC_9, SC_8, SC_F, SC_E, SC_D, SC_C,
213 SC_3, SC_2, SC_1, SC_0, SC_7, SC_6, SC_5, SC_4 },
215 { SC_C, SC_D, SC_E, SC_F, SC_8, SC_9, SC_A, SC_B,
216 SC_4, SC_5, SC_6, SC_7, SC_0, SC_1, SC_2, SC_3 },
218 { SC_D, SC_C, SC_F, SC_E, SC_9, SC_8, SC_B, SC_A,
219 SC_5, SC_4, SC_7, SC_6, SC_1, SC_0, SC_3, SC_2 },
221 { SC_E, SC_F, SC_C, SC_D, SC_A, SC_B, SC_8, SC_9,
222 SC_6, SC_7, SC_4, SC_5, SC_2, SC_3, SC_0, SC_1 },
224 { SC_F, SC_E, SC_D, SC_C, SC_B, SC_A, SC_9, SC_8,
225 SC_7, SC_6, SC_5, SC_4, SC_3, SC_2, SC_1, SC_0 }
228 static char const add_table[16][16][2] = {
229 { {SC_0, SC_0}, {SC_1, SC_0}, {SC_2, SC_0}, {SC_3, SC_0},
230 {SC_4, SC_0}, {SC_5, SC_0}, {SC_6, SC_0}, {SC_7, SC_0},
231 {SC_8, SC_0}, {SC_9, SC_0}, {SC_A, SC_0}, {SC_B, SC_0},
232 {SC_C, SC_0}, {SC_D, SC_0}, {SC_E, SC_0}, {SC_F, SC_0} },
234 { {SC_1, SC_0}, {SC_2, SC_0}, {SC_3, SC_0}, {SC_4, SC_0},
235 {SC_5, SC_0}, {SC_6, SC_0}, {SC_7, SC_0}, {SC_8, SC_0},
236 {SC_9, SC_0}, {SC_A, SC_0}, {SC_B, SC_0}, {SC_C, SC_0},
237 {SC_D, SC_0}, {SC_E, SC_0}, {SC_F, SC_0}, {SC_0, SC_1} },
239 { {SC_2, SC_0}, {SC_3, SC_0}, {SC_4, SC_0}, {SC_5, SC_0},
240 {SC_6, SC_0}, {SC_7, SC_0}, {SC_8, SC_0}, {SC_9, SC_0},
241 {SC_A, SC_0}, {SC_B, SC_0}, {SC_C, SC_0}, {SC_D, SC_0},
242 {SC_E, SC_0}, {SC_F, SC_0}, {SC_0, SC_1}, {SC_1, SC_1} },
244 { {SC_3, SC_0}, {SC_4, SC_0}, {SC_5, SC_0}, {SC_6, SC_0},
245 {SC_7, SC_0}, {SC_8, SC_0}, {SC_9, SC_0}, {SC_A, SC_0},
246 {SC_B, SC_0}, {SC_C, SC_0}, {SC_D, SC_0}, {SC_E, SC_0},
247 {SC_F, SC_0}, {SC_0, SC_1}, {SC_1, SC_1}, {SC_2, SC_1} },
249 { {SC_4, SC_0}, {SC_5, SC_0}, {SC_6, SC_0}, {SC_7, SC_0},
250 {SC_8, SC_0}, {SC_9, SC_0}, {SC_A, SC_0}, {SC_B, SC_0},
251 {SC_C, SC_0}, {SC_D, SC_0}, {SC_E, SC_0}, {SC_F, SC_0},
252 {SC_0, SC_1}, {SC_1, SC_1}, {SC_2, SC_1}, {SC_3, SC_1} },
254 { {SC_5, SC_0}, {SC_6, SC_0}, {SC_7, SC_0}, {SC_8, SC_0},
255 {SC_9, SC_0}, {SC_A, SC_0}, {SC_B, SC_0}, {SC_C, SC_0},
256 {SC_D, SC_0}, {SC_E, SC_0}, {SC_F, SC_0}, {SC_0, SC_1},
257 {SC_1, SC_1}, {SC_2, SC_1}, {SC_3, SC_1}, {SC_4, SC_1} },
259 { {SC_6, SC_0}, {SC_7, SC_0}, {SC_8, SC_0}, {SC_9, SC_0},
260 {SC_A, SC_0}, {SC_B, SC_0}, {SC_C, SC_0}, {SC_D, SC_0},
261 {SC_E, SC_0}, {SC_F, SC_0}, {SC_0, SC_1}, {SC_1, SC_1},
262 {SC_2, SC_1}, {SC_3, SC_1}, {SC_4, SC_1}, {SC_5, SC_1} },
264 { {SC_7, SC_0}, {SC_8, SC_0}, {SC_9, SC_0}, {SC_A, SC_0},
265 {SC_B, SC_0}, {SC_C, SC_0}, {SC_D, SC_0}, {SC_E, SC_0},
266 {SC_F, SC_0}, {SC_0, SC_1}, {SC_1, SC_1}, {SC_2, SC_1},
267 {SC_3, SC_1}, {SC_4, SC_1}, {SC_5, SC_1}, {SC_6, SC_1} },
269 { {SC_8, SC_0}, {SC_9, SC_0}, {SC_A, SC_0}, {SC_B, SC_0},
270 {SC_C, SC_0}, {SC_D, SC_0}, {SC_E, SC_0}, {SC_F, SC_0},
271 {SC_0, SC_1}, {SC_1, SC_1}, {SC_2, SC_1}, {SC_3, SC_1},
272 {SC_4, SC_1}, {SC_5, SC_1}, {SC_6, SC_1}, {SC_7, SC_1} },
274 { {SC_9, SC_0}, {SC_A, SC_0}, {SC_B, SC_0}, {SC_C, SC_0},
275 {SC_D, SC_0}, {SC_E, SC_0}, {SC_F, SC_0}, {SC_0, SC_1},
276 {SC_1, SC_1}, {SC_2, SC_1}, {SC_3, SC_1}, {SC_4, SC_1},
277 {SC_5, SC_1}, {SC_6, SC_1}, {SC_7, SC_1}, {SC_8, SC_1} },
279 { {SC_A, SC_0}, {SC_B, SC_0}, {SC_C, SC_0}, {SC_D, SC_0},
280 {SC_E, SC_0}, {SC_F, SC_0}, {SC_0, SC_1}, {SC_1, SC_1},
281 {SC_2, SC_1}, {SC_3, SC_1}, {SC_4, SC_1}, {SC_5, SC_1},
282 {SC_6, SC_1}, {SC_7, SC_1}, {SC_8, SC_1}, {SC_9, SC_1} },
284 { {SC_B, SC_0}, {SC_C, SC_0}, {SC_D, SC_0}, {SC_E, SC_0},
285 {SC_F, SC_0}, {SC_0, SC_1}, {SC_1, SC_1}, {SC_2, SC_1},
286 {SC_3, SC_1}, {SC_4, SC_1}, {SC_5, SC_1}, {SC_6, SC_1},
287 {SC_7, SC_1}, {SC_8, SC_1}, {SC_9, SC_1}, {SC_A, SC_1} },
289 { {SC_C, SC_0}, {SC_D, SC_0}, {SC_E, SC_0}, {SC_F, SC_0},
290 {SC_0, SC_1}, {SC_1, SC_1}, {SC_2, SC_1}, {SC_3, SC_1},
291 {SC_4, SC_1}, {SC_5, SC_1}, {SC_6, SC_1}, {SC_7, SC_1},
292 {SC_8, SC_1}, {SC_9, SC_1}, {SC_A, SC_1}, {SC_B, SC_1} },
294 { {SC_D, SC_0}, {SC_E, SC_0}, {SC_F, SC_0}, {SC_0, SC_1},
295 {SC_1, SC_1}, {SC_2, SC_1}, {SC_3, SC_1}, {SC_4, SC_1},
296 {SC_5, SC_1}, {SC_6, SC_1}, {SC_7, SC_1}, {SC_8, SC_1},
297 {SC_9, SC_1}, {SC_A, SC_1}, {SC_B, SC_1}, {SC_C, SC_1} },
299 { {SC_E, SC_0}, {SC_F, SC_0}, {SC_0, SC_1}, {SC_1, SC_1},
300 {SC_2, SC_1}, {SC_3, SC_1}, {SC_4, SC_1}, {SC_5, SC_1},
301 {SC_6, SC_1}, {SC_7, SC_1}, {SC_8, SC_1}, {SC_9, SC_1},
302 {SC_A, SC_1}, {SC_B, SC_1}, {SC_C, SC_1}, {SC_D, SC_1} },
304 { {SC_F, SC_0}, {SC_0, SC_1}, {SC_1, SC_1}, {SC_2, SC_1},
305 {SC_3, SC_1}, {SC_4, SC_1}, {SC_5, SC_1}, {SC_6, SC_1},
306 {SC_7, SC_1}, {SC_8, SC_1}, {SC_9, SC_1}, {SC_A, SC_1},
307 {SC_B, SC_1}, {SC_C, SC_1}, {SC_D, SC_1}, {SC_E, SC_1} }
310 static char const mul_table[16][16][2] = {
311 { {SC_0, SC_0}, {SC_0, SC_0}, {SC_0, SC_0}, {SC_0, SC_0},
312 {SC_0, SC_0}, {SC_0, SC_0}, {SC_0, SC_0}, {SC_0, SC_0},
313 {SC_0, SC_0}, {SC_0, SC_0}, {SC_0, SC_0}, {SC_0, SC_0},
314 {SC_0, SC_0}, {SC_0, SC_0}, {SC_0, SC_0}, {SC_0, SC_0} },
316 { {SC_0, SC_0}, {SC_1, SC_0}, {SC_2, SC_0}, {SC_3, SC_0},
317 {SC_4, SC_0}, {SC_5, SC_0}, {SC_6, SC_0}, {SC_7, SC_0},
318 {SC_8, SC_0}, {SC_9, SC_0}, {SC_A, SC_0}, {SC_B, SC_0},
319 {SC_C, SC_0}, {SC_D, SC_0}, {SC_E, SC_0}, {SC_F, SC_0} },
321 { {SC_0, SC_0}, {SC_2, SC_0}, {SC_4, SC_0}, {SC_6, SC_0},
322 {SC_8, SC_0}, {SC_A, SC_0}, {SC_C, SC_0}, {SC_E, SC_0},
323 {SC_0, SC_1}, {SC_2, SC_1}, {SC_4, SC_1}, {SC_6, SC_1},
324 {SC_8, SC_1}, {SC_A, SC_1}, {SC_C, SC_1}, {SC_E, SC_1} },
326 { {SC_0, SC_0}, {SC_3, SC_0}, {SC_6, SC_0}, {SC_9, SC_0},
327 {SC_C, SC_0}, {SC_F, SC_0}, {SC_2, SC_1}, {SC_5, SC_1},
328 {SC_8, SC_1}, {SC_B, SC_1}, {SC_E, SC_1}, {SC_1, SC_2},
329 {SC_4, SC_2}, {SC_7, SC_2}, {SC_A, SC_2}, {SC_D, SC_2} },
331 { {SC_0, SC_0}, {SC_4, SC_0}, {SC_8, SC_0}, {SC_C, SC_0},
332 {SC_0, SC_1}, {SC_4, SC_1}, {SC_8, SC_1}, {SC_C, SC_1},
333 {SC_0, SC_2}, {SC_4, SC_2}, {SC_8, SC_2}, {SC_C, SC_2},
334 {SC_0, SC_3}, {SC_4, SC_3}, {SC_8, SC_3}, {SC_C, SC_3} },
336 { {SC_0, SC_0}, {SC_5, SC_0}, {SC_A, SC_0}, {SC_F, SC_0},
337 {SC_4, SC_1}, {SC_9, SC_1}, {SC_E, SC_1}, {SC_3, SC_2},
338 {SC_8, SC_2}, {SC_D, SC_2}, {SC_2, SC_3}, {SC_7, SC_3},
339 {SC_C, SC_3}, {SC_1, SC_4}, {SC_6, SC_4}, {SC_B, SC_4} },
341 { {SC_0, SC_0}, {SC_6, SC_0}, {SC_C, SC_0}, {SC_2, SC_1},
342 {SC_8, SC_1}, {SC_E, SC_1}, {SC_4, SC_2}, {SC_A, SC_2},
343 {SC_0, SC_3}, {SC_6, SC_3}, {SC_C, SC_3}, {SC_2, SC_4},
344 {SC_8, SC_4}, {SC_E, SC_4}, {SC_4, SC_5}, {SC_A, SC_5} },
346 { {SC_0, SC_0}, {SC_7, SC_0}, {SC_E, SC_0}, {SC_5, SC_1},
347 {SC_C, SC_1}, {SC_3, SC_2}, {SC_A, SC_2}, {SC_1, SC_3},
348 {SC_8, SC_3}, {SC_F, SC_3}, {SC_6, SC_4}, {SC_D, SC_4},
349 {SC_4, SC_5}, {SC_B, SC_5}, {SC_2, SC_6}, {SC_9, SC_6} },
351 { {SC_0, SC_0}, {SC_8, SC_0}, {SC_0, SC_1}, {SC_8, SC_1},
352 {SC_0, SC_2}, {SC_8, SC_2}, {SC_0, SC_3}, {SC_8, SC_3},
353 {SC_0, SC_4}, {SC_8, SC_4}, {SC_0, SC_5}, {SC_8, SC_5},
354 {SC_0, SC_6}, {SC_8, SC_6}, {SC_0, SC_7}, {SC_8, SC_7} },
356 { {SC_0, SC_0}, {SC_9, SC_0}, {SC_2, SC_1}, {SC_B, SC_1},
357 {SC_4, SC_2}, {SC_D, SC_2}, {SC_6, SC_3}, {SC_F, SC_3},
358 {SC_8, SC_4}, {SC_1, SC_5}, {SC_A, SC_5}, {SC_3, SC_6},
359 {SC_C, SC_6}, {SC_5, SC_7}, {SC_E, SC_7}, {SC_7, SC_8} },
361 { {SC_0, SC_0}, {SC_A, SC_0}, {SC_4, SC_1}, {SC_E, SC_1},
362 {SC_8, SC_2}, {SC_2, SC_3}, {SC_C, SC_3}, {SC_6, SC_4},
363 {SC_0, SC_5}, {SC_A, SC_5}, {SC_4, SC_6}, {SC_E, SC_6},
364 {SC_8, SC_7}, {SC_2, SC_8}, {SC_C, SC_8}, {SC_6, SC_9} },
366 { {SC_0, SC_0}, {SC_B, SC_0}, {SC_6, SC_1}, {SC_1, SC_2},
367 {SC_C, SC_2}, {SC_7, SC_3}, {SC_2, SC_4}, {SC_D, SC_4},
368 {SC_8, SC_5}, {SC_3, SC_6}, {SC_E, SC_6}, {SC_9, SC_7},
369 {SC_4, SC_8}, {SC_F, SC_8}, {SC_A, SC_9}, {SC_5, SC_A} },
371 { {SC_0, SC_0}, {SC_C, SC_0}, {SC_8, SC_1}, {SC_4, SC_2},
372 {SC_0, SC_3}, {SC_C, SC_3}, {SC_8, SC_4}, {SC_4, SC_5},
373 {SC_0, SC_6}, {SC_C, SC_6}, {SC_8, SC_7}, {SC_4, SC_8},
374 {SC_0, SC_9}, {SC_C, SC_9}, {SC_8, SC_A}, {SC_4, SC_B} },
376 { {SC_0, SC_0}, {SC_D, SC_0}, {SC_A, SC_1}, {SC_7, SC_2},
377 {SC_4, SC_3}, {SC_1, SC_4}, {SC_E, SC_4}, {SC_B, SC_5},
378 {SC_8, SC_6}, {SC_5, SC_7}, {SC_2, SC_8}, {SC_F, SC_8},
379 {SC_C, SC_9}, {SC_9, SC_A}, {SC_6, SC_B}, {SC_3, SC_C} },
381 { {SC_0, SC_0}, {SC_E, SC_0}, {SC_C, SC_1}, {SC_A, SC_2},
382 {SC_8, SC_3}, {SC_6, SC_4}, {SC_4, SC_5}, {SC_2, SC_6},
383 {SC_0, SC_7}, {SC_E, SC_7}, {SC_C, SC_8}, {SC_A, SC_9},
384 {SC_8, SC_A}, {SC_6, SC_B}, {SC_4, SC_C}, {SC_2, SC_D} },
386 { {SC_0, SC_0}, {SC_F, SC_0}, {SC_E, SC_1}, {SC_D, SC_2},
387 {SC_C, SC_3}, {SC_B, SC_4}, {SC_A, SC_5}, {SC_9, SC_6},
388 {SC_8, SC_7}, {SC_7, SC_8}, {SC_6, SC_9}, {SC_5, SC_A},
389 {SC_4, SC_B}, {SC_3, SC_C}, {SC_2, SC_D}, {SC_1, SC_E} }
392 static char const shrs_table[16][4][2] = {
393 { {SC_0, SC_0}, {SC_0, SC_0}, {SC_0, SC_0}, {SC_0, SC_0} },
394 { {SC_1, SC_0}, {SC_0, SC_8}, {SC_0, SC_4}, {SC_0, SC_2} },
395 { {SC_2, SC_0}, {SC_1, SC_0}, {SC_0, SC_8}, {SC_0, SC_4} },
396 { {SC_3, SC_0}, {SC_1, SC_8}, {SC_0, SC_C}, {SC_0, SC_6} },
397 { {SC_4, SC_0}, {SC_2, SC_0}, {SC_1, SC_0}, {SC_0, SC_8} },
398 { {SC_5, SC_0}, {SC_2, SC_8}, {SC_1, SC_4}, {SC_0, SC_A} },
399 { {SC_6, SC_0}, {SC_3, SC_0}, {SC_1, SC_8}, {SC_0, SC_C} },
400 { {SC_7, SC_0}, {SC_3, SC_8}, {SC_1, SC_C}, {SC_0, SC_E} },
401 { {SC_8, SC_0}, {SC_4, SC_0}, {SC_2, SC_0}, {SC_1, SC_0} },
402 { {SC_9, SC_0}, {SC_4, SC_8}, {SC_2, SC_4}, {SC_1, SC_2} },
403 { {SC_A, SC_0}, {SC_5, SC_0}, {SC_2, SC_8}, {SC_1, SC_4} },
404 { {SC_B, SC_0}, {SC_5, SC_8}, {SC_2, SC_C}, {SC_1, SC_6} },
405 { {SC_C, SC_0}, {SC_6, SC_0}, {SC_3, SC_0}, {SC_1, SC_8} },
406 { {SC_D, SC_0}, {SC_6, SC_8}, {SC_3, SC_4}, {SC_1, SC_A} },
407 { {SC_E, SC_0}, {SC_7, SC_0}, {SC_3, SC_8}, {SC_1, SC_C} },
408 { {SC_F, SC_0}, {SC_7, SC_8}, {SC_3, SC_C}, {SC_1, SC_E} }
411 /* for converting to binary string */
412 static const char *binary_table[16] = {
413 "0000", "0001", "0010", "0011", "0100", "0101", "0110", "0111",
414 "1000", "1001", "1010", "1011", "1100", "1101", "1110", "1111"
417 /*****************************************************************************
419 *****************************************************************************/
420 static void _fail_char(const char *str, size_t len, const char fchar, int pos,
421 const char *file, int line)
424 printf("Unexpected character '%c' in %s:%d\n", fchar, file, line);
425 while (len-- && *str) printf("%c", *str++); printf("\n");
426 while (--pos) printf(" "); printf("^\n");
430 static void _bitnot(const char *val, char *buffer)
434 for (counter = 0; counter<CALC_BUFFER_SIZE; counter++)
435 buffer[counter] = not_table[_val(val[counter])];
438 static void _bitor(const char *val1, const char *val2, char *buffer)
442 for (counter = 0; counter<CALC_BUFFER_SIZE; counter++)
443 buffer[counter] = or_table[_val(val1[counter])][_val(val2[counter])];
446 static void _bitxor(const char *val1, const char *val2, char *buffer)
450 for (counter = 0; counter<CALC_BUFFER_SIZE; counter++)
451 buffer[counter] = xor_table[_val(val1[counter])][_val(val2[counter])];
454 static void _bitand(const char *val1, const char *val2, char *buffer)
458 for (counter = 0; counter<CALC_BUFFER_SIZE; counter++)
459 buffer[counter] = and_table[_val(val1[counter])][_val(val2[counter])];
462 static int _sign(const char *val)
464 return (val[CALC_BUFFER_SIZE-1] <= SC_7) ? (1) : (-1);
468 * returns non-zero if bit at position pos is set
470 static int _bit(const char *val, int pos)
473 int nibble = pos >> 2;
475 return _bitisset(val[nibble], bit);
478 static void _inc(char *val, char *buffer)
482 while (counter++ < CALC_BUFFER_SIZE)
491 /* No carry here, *val != SC_F */
492 *buffer = add_table[_val(*val)][SC_1][0];
496 /* here a carry could be lost, this is intended because this should
497 * happen only when a value changes sign. */
500 static void _negate(const char *val, char *buffer)
502 _bitnot(val, buffer);
503 _inc(buffer, buffer);
506 static void _add(const char *val1, const char *val2, char *buffer)
509 const char *add1, *add2;
512 for (counter = 0; counter < CALC_BUFFER_SIZE; counter++)
514 add1 = add_table[_val(val1[counter])][_val(val2[counter])];
515 add2 = add_table[_val(add1[0])][_val(carry)];
516 /* carry might be zero */
517 buffer[counter] = add2[0];
518 carry = add_table[_val(add1[1])][_val(add2[1])][0];
522 static void _mul(const char *val1, const char *val2, char *buffer)
524 char* temp_buffer; /* result buffer */
525 char* neg_val1; /* abs of val1 */
526 char* neg_val2; /* abs of val2 */
528 const char *mul, *add1, *add2; /* intermediate result containers */
529 char carry = SC_0; /* container for carries */
530 char sign = 0; /* marks result sign */
531 int c_inner, c_outer; /* loop counters */
533 temp_buffer = alloca(CALC_BUFFER_SIZE);
534 neg_val1 = alloca(CALC_BUFFER_SIZE);
535 neg_val2 = alloca(CALC_BUFFER_SIZE);
537 /* init result buffer to zeroes */
538 memset(temp_buffer, SC_0, CALC_BUFFER_SIZE);
540 /* the multiplication works only for positive values, for negative values *
541 * it is necessary to negate them and adjust the result accordingly */
542 if (_sign(val1) == -1) {
543 _negate(val1, neg_val1);
547 if (_sign(val2) == -1) {
548 _negate(val2, neg_val2);
553 for (c_outer = 0; c_outer < MAX_VALUE_SIZE; c_outer++)
555 if (val2[c_outer] != SC_0)
557 for (c_inner = 0; c_inner < MAX_VALUE_SIZE; c_inner++)
559 /* do the following calculation: *
560 * Add the current carry, the value at position c_outer+c_inner *
561 * and the result of the multiplication of val1[c_inner] and *
562 * val2[c_outer]. This is the usual pen-and-paper multiplication. */
564 /* multiplicate the two digits */
565 mul = mul_table[_val(val1[c_inner])][_val(val2[c_outer])];
566 /* add old value to result of multiplication */
567 add1 = add_table[_val(temp_buffer[c_inner + c_outer])][_val(mul[0])];
568 /* add carry to the sum */
569 add2 = add_table[_val(add1[0])][_val(carry)];
571 /* all carries together result in new carry. This is always smaller *
573 * Both multiplicands, the carry and the value already in the temp *
574 * buffer are single digits and their value is therefore at most *
577 * (b-1)(b-1)+(b-1)+(b-1) = b*b-1 *
578 * The tables list all operations rem b, so the carry is at most *
579 * (b*b-1)rem b = -1rem b = b-1 */
580 carry = add_table[_val(mul[1])][_val(add1[1])][0];
581 carry = add_table[_val(carry)][_val(add2[1])][0];
583 temp_buffer[c_inner + c_outer] = add2[0];
586 /* A carry may hang over */
587 /* c_outer is always smaller than MAX_VALUE_SIZE! */
588 temp_buffer[MAX_VALUE_SIZE + c_outer] = carry;
594 _negate(temp_buffer, buffer);
596 memcpy(buffer, temp_buffer, CALC_BUFFER_SIZE);
599 static void _sub(const char *val1, const char *val2, char *buffer)
601 char *temp_buffer; /* intermediate buffer to hold -val2 */
602 temp_buffer = alloca(CALC_BUFFER_SIZE);
604 _negate(val2, temp_buffer);
605 _add(val1, temp_buffer, buffer);
608 static void _push(const char digit, char *buffer)
612 for (counter = CALC_BUFFER_SIZE - 2; counter >= 0; counter--)
614 buffer[counter+1] = buffer[counter];
619 /* XXX: This is MOST slow */
620 static void _divmod(const char *dividend, const char *divisor, char *quot, char *rem)
622 const char *minus_divisor;
626 char sign = 0; /* remember result sign */
628 int c_dividend; /* loop counters */
630 neg_val1 = alloca(CALC_BUFFER_SIZE);
631 neg_val2 = alloca(CALC_BUFFER_SIZE);
633 /* clear result buffer */
634 memset(quot, SC_0, CALC_BUFFER_SIZE);
635 memset(rem, SC_0, CALC_BUFFER_SIZE);
637 /* if the divisor is zero this won't work (quot is zero) */
638 if (sc_comp(divisor, quot) == 0) assert(0 && "division by zero!");
640 /* if the dividend is zero result is zero (quot is zero)*/
641 if (sc_comp(dividend, quot) == 0)
644 if (_sign(dividend) == -1)
646 _negate(dividend, neg_val1);
651 _negate(divisor, neg_val2);
652 if (_sign(divisor) == -1)
655 minus_divisor = divisor;
660 minus_divisor = neg_val2;
663 /* if divisor >= dividend division is easy
664 * (remember these are absolute values) */
665 switch (sc_comp(dividend, divisor))
667 case 0: /* dividend == divisor */
671 case -1: /* dividend < divisor */
672 memcpy(rem, dividend, CALC_BUFFER_SIZE);
675 default: /* unluckily division is necessary :( */
679 for (c_dividend = CALC_BUFFER_SIZE - 1; c_dividend >= 0; c_dividend--)
681 _push(dividend[c_dividend], rem);
684 if (sc_comp(rem, divisor) != -1) /* remainder >= divisor */
686 /* subtract until the remainder becomes negative, this should
687 * be faster than comparing remainder with divisor */
688 _add(rem, minus_divisor, rem);
690 while (_sign(rem) == 1)
692 quot[0] = add_table[_val(quot[0])][SC_1][0];
693 _add(rem, minus_divisor, rem);
696 /* subtracted one too much */
697 _add(rem, divisor, rem);
701 carry_flag = !sc_is_zero(rem);
710 static void _shl(const char *val1, char *buffer, long offset, int radius, unsigned is_signed)
719 assert((offset >= 0) || (0 && "negative leftshift"));
720 assert(((_sign(val1) != -1) || is_signed) || (0 && "unsigned mode and negative value"));
721 assert(((!_bitisset(val1[(radius-1)/4], (radius-1)%4)) || !is_signed || (_sign(val1) == -1)) || (0 && "value is positive, should be negative"));
722 assert(((_bitisset(val1[(radius-1)/4], (radius-1)%4)) || !is_signed || (_sign(val1) == 1)) || (0 && "value is negative, should be positive"));
724 /* if shifting far enough the result is zero */
725 if (offset >= radius)
727 memset(buffer, SC_0, CALC_BUFFER_SIZE);
731 shift = shift_table[_val(offset%4)]; /* this is 2 ** (offset % 4) */
734 /* shift the single digits some bytes (offset) and some bits (table)
736 for (counter = 0; counter < radius/4 - offset; counter++)
738 shl = mul_table[_val(val1[counter])][_val(shift)];
739 buffer[counter + offset] = or_table[_val(shl[0])][_val(carry)];
744 shl = mul_table[_val(val1[counter])][_val(shift)];
745 buffer[counter + offset] = or_table[_val(shl[0])][_val(carry)];
748 bitoffset = counter - 1;
751 /* fill with zeroes */
752 for (counter = 0; counter < offset; counter++) buffer[counter] = SC_0;
754 /* if the mode was signed, change sign when the mode's msb is now 1 */
755 offset = bitoffset + offset;
756 bitoffset = (radius-1) % 4;
757 if (is_signed && _bitisset(buffer[offset], bitoffset))
759 /* this sets the upper bits of the leftmost digit */
760 buffer[offset] = or_table[_val(buffer[offset])][_val(min_digit[bitoffset])];
761 for (counter = offset+1; counter < CALC_BUFFER_SIZE; counter++)
763 buffer[counter] = SC_F;
766 else if (is_signed && !_bitisset(buffer[offset], bitoffset))
768 /* this unsets the upper bits of the leftmost digit */
769 buffer[offset] = and_table[_val(buffer[offset])][_val(max_digit[bitoffset])];
770 for (counter = offset+1; counter < CALC_BUFFER_SIZE; counter++)
772 buffer[counter] = SC_0;
777 static void _shr(const char *val1, char *buffer, long offset, int radius, unsigned is_signed, int signed_shift)
788 assert((offset >= 0) || (0 && "negative rightshift"));
789 assert(((_sign(val1) != -1) || is_signed) || (0 && "unsigned mode and negative value"));
790 assert(((!_bitisset(val1[(radius-1)/4], (radius-1)%4)) || !is_signed || (_sign(val1) == -1)) || (0 && "value is positive, should be negative"));
791 assert(((_bitisset(val1[(radius-1)/4], (radius-1)%4)) || !is_signed || (_sign(val1) == 1)) || (0 && "value is negative, should be positive"));
793 sign = ((signed_shift) && (_sign(val1) == -1))?(SC_F):(SC_0);
795 /* if shifting far enough the result is either 0 or -1 */
796 if (offset >= radius)
798 if (!sc_is_zero(val1)) {
801 memset(buffer, sign, CALC_BUFFER_SIZE);
808 /* check if any bits are lost, and set carry_flag if so */
809 for (counter = 0; counter < offset; counter++)
811 if (val1[counter] != 0)
817 if ((_val(val1[counter]) & ((1<<shift)-1)) != 0)
821 /* shift digits to the right with offset, carry and all */
823 if (radius/4 - offset > 0) {
824 buffer[counter] = shrs_table[_val(val1[offset])][shift][0];
827 for (; counter < radius/4 - offset; counter++)
829 shrs = shrs_table[_val(val1[counter + offset])][shift];
830 buffer[counter] = shrs[0];
831 buffer[counter-1] = or_table[_val(buffer[counter-1])][_val(shrs[1])];
834 /* the last digit is special in regard of signed/unsigned shift */
835 bitoffset = radius%4;
836 msd = (radius/4<CALC_BUFFER_SIZE)?(val1[radius/4]):(sign); /* most significant digit */
838 /* remove sign bits if mode was signed and this is an unsigned shift */
839 if (!signed_shift && is_signed) {
840 msd = and_table[_val(msd)][_val(max_digit[bitoffset])];
843 shrs = shrs_table[_val(msd)][shift];
845 /* signed shift and signed mode and negative value means all bits to the left are set */
846 if (signed_shift && is_signed && (_sign(val1) == -1)) {
847 buffer[counter] = or_table[_val(shrs[0])][_val(min_digit[bitoffset])];
849 buffer[counter] = shrs[0];
852 if (counter > 0) buffer[counter - 1] = or_table[_val(buffer[counter-1])][_val(shrs[1])];
854 /* fill with SC_F or SC_0 depending on sign */
855 for (counter++; counter < CALC_BUFFER_SIZE; counter++)
857 buffer[counter] = sign;
861 /* positive: low-order -> high order, negative other direction */
862 static void _rot(const char *val1, char *buffer, long offset, int radius, unsigned is_signed)
865 temp1 = alloca(CALC_BUFFER_SIZE);
866 temp2 = alloca(CALC_BUFFER_SIZE);
868 offset = offset % radius;
870 /* rotation by multiples of the typelength is identity */
872 memmove(buffer, val1, CALC_BUFFER_SIZE);
876 _shl(val1, temp1, offset, radius, is_signed);
877 _shr(val1, temp2, radius - offset, radius, is_signed, 0);
878 _bitor(temp1, temp2, buffer);
879 carry_flag = 0; /* set by shr, but due to rot this is false */
882 /*****************************************************************************
883 * public functions, declared in strcalc.h
884 *****************************************************************************/
885 const void *sc_get_buffer(void)
887 return (void*)calc_buffer;
890 const int sc_get_buffer_length(void)
892 return CALC_BUFFER_SIZE;
895 /* XXX doesn't check for overflows */
896 void sc_val_from_str(const char *str, unsigned int len, void *buffer)
898 const char *orig_str = str;
899 unsigned int orig_len = len;
904 base = alloca(CALC_BUFFER_SIZE);
905 val = alloca(CALC_BUFFER_SIZE);
907 /* verify valid pointers (not null) */
909 /* a string no characters long is an error */
912 if (buffer == NULL) buffer = calc_buffer;
914 CLEAR_BUFFER(buffer);
915 memset(base, SC_0, CALC_BUFFER_SIZE);
916 memset(val, SC_0, CALC_BUFFER_SIZE);
918 /* strip leading spaces */
919 while ((len > 0) && (*str == ' ')) { len--; str++; }
921 /* if the first two characters are 0x or 0X -> hex
922 * if the first is a 0 -> oct
923 * else dec, strip leading -/+ and remember sign
925 * only a + or - sign is no number resulting in an error */
930 if (str[1] == 'x' || str[1] == 'X') /* hex */
934 base[1] = SC_1; base[0] = SC_0;
940 base[1] = SC_0; base[0] = SC_8;
948 base[1] = SC_0; base[0] = SC_A;
957 base[1] = SC_0; base[0] = SC_A;
961 default: /* dec, else would have begun with 0x or 0 */
962 base[1] = SC_0; base[0] = SC_A;
965 else /* dec, else would have begun with 0x or 0 */
967 base[1] = SC_0; base[0] = SC_A;
970 /* BEGIN string evaluation, from left to right */
981 if (base[0] > SC_9 || base[1] > SC_0) /* (base > 10) */
983 val[0] = _digit((*str)-'a'+10);
985 else fail_char(orig_str, orig_len, *str, str-orig_str+1);
994 if (base[0] > SC_9 || base[1] > SC_0) /* (base > 10) */
996 val[0] = _digit((*str)-'A'+10);
998 else fail_char(orig_str, orig_len, *str, str-orig_str+1);
1003 if (base[0] > SC_7 || base[1] > SC_0) /* (base > 8) */
1005 val[0] = _digit((*str)-'0');
1007 else fail_char(orig_str, orig_len, *str, str-orig_str+1);
1019 val[0] = _digit((*str)-'0');
1024 fail_char(orig_str, orig_len, *str, str-orig_str+1);
1025 } /* switch(*str) */
1027 /* Radix conversion from base b to base B:
1028 * (UnUn-1...U1U0)b == ((((Un*b + Un-1)*b + ...)*b + U1)*b + U0)B */
1029 _mul(base, calc_buffer, calc_buffer); /* multiply current value with base */
1030 _add(val, calc_buffer, calc_buffer); /* add next digit to current value */
1032 /* get ready for the next letter */
1036 } /* while (len > 0 ) */
1040 _negate(calc_buffer, calc_buffer);
1044 void sc_val_from_long(long value, void *buffer)
1047 char sign, is_minlong;
1049 if (buffer == NULL) buffer = calc_buffer;
1053 is_minlong = value == LONG_MIN;
1055 /* use absolute value, special treatment of MIN_LONG */
1063 CLEAR_BUFFER(buffer);
1065 while ((value != 0) && (pos < (char*)buffer + CALC_BUFFER_SIZE))
1067 *pos++ = _digit(value & 0xf);
1074 _inc(buffer, buffer);
1076 _negate(buffer, buffer);
1080 void sc_val_from_ulong(unsigned long value, void *buffer)
1084 if (buffer == NULL) buffer = calc_buffer;
1087 while (pos < (char*)buffer + CALC_BUFFER_SIZE)
1089 *pos++ = _digit(value & 0xf);
1094 long sc_val_to_long(const void *val)
1099 for (i = CALC_BUFFER_SIZE - 1; i >= 0; i--)
1101 l = (l << 4) + _val(((char *)val)[i]);
1106 void sc_min_from_bits(unsigned int num_bits, unsigned int sign, void *buffer)
1111 if (buffer == NULL) buffer = calc_buffer;
1112 CLEAR_BUFFER(buffer);
1114 if (!sign) return; /* unsigned means minimum is 0(zero) */
1118 bits = num_bits - 1;
1119 for (i = 0; i < bits/4; i++)
1122 *pos++ = min_digit[bits%4];
1124 for (i++; i <= CALC_BUFFER_SIZE - 1; i++)
1128 void sc_max_from_bits(unsigned int num_bits, unsigned int sign, void *buffer)
1133 if (buffer == NULL) buffer = calc_buffer;
1134 CLEAR_BUFFER(buffer);
1137 bits = num_bits - sign;
1138 for (i = 0; i < bits/4; i++)
1141 *pos++ = max_digit[bits%4];
1143 for (i++; i <= CALC_BUFFER_SIZE - 1; i++)
1147 void sc_calc(const void* value1, const void* value2, unsigned op, void *buffer)
1149 char *unused_res; /* temp buffer holding unused result of divmod */
1151 const char *val1 = (const char *)value1;
1152 const char *val2 = (const char *)value2;
1154 unused_res = alloca(CALC_BUFFER_SIZE);
1155 CLEAR_BUFFER(calc_buffer);
1158 DEBUGPRINTF_COMPUTATION(("%s ", sc_print_hex(value1)));
1163 _negate(val1, calc_buffer);
1164 DEBUGPRINTF_COMPUTATION(("negated: %s\n", sc_print_hex(calc_buffer)));
1167 DEBUGPRINTF_COMPUTATION(("| "));
1168 _bitor(val1, val2, calc_buffer);
1171 DEBUGPRINTF_COMPUTATION(("& "));
1172 _bitand(val1, val2, calc_buffer);
1175 DEBUGPRINTF_COMPUTATION(("^ "));
1176 _bitxor(val1, val2, calc_buffer);
1179 _bitnot(val1, calc_buffer);
1180 DEBUGPRINTF_COMPUTATION(("bit-negated: %s\n", sc_print_hex(calc_buffer)));
1183 DEBUGPRINTF_COMPUTATION(("+ "));
1184 _add(val1, val2, calc_buffer);
1187 DEBUGPRINTF_COMPUTATION(("- "));
1188 _sub(val1, val2, calc_buffer);
1191 DEBUGPRINTF_COMPUTATION(("* "));
1192 _mul(val1, val2, calc_buffer);
1195 DEBUGPRINTF_COMPUTATION(("/ "));
1196 _divmod(val1, val2, calc_buffer, unused_res);
1199 DEBUGPRINTF_COMPUTATION(("%% "));
1200 _divmod(val1, val2, unused_res, calc_buffer);
1205 DEBUGPRINTF_COMPUTATION(("%s -> ", sc_print_hex(value2)));
1206 DEBUGPRINTF_COMPUTATION(("%s\n", sc_print_hex(calc_buffer)));
1208 if ((buffer != NULL) && (buffer != calc_buffer))
1210 memcpy(buffer, calc_buffer, CALC_BUFFER_SIZE);
1214 void sc_bitcalc(const void* value1, const void* value2, int radius, int sign, unsigned op, void* buffer)
1216 const char *val1 = (const char *)value1;
1217 const char *val2 = (const char *)value2;
1221 offset = sc_val_to_long(val2);
1223 DEBUGPRINTF_COMPUTATION(("%s ", sc_print_hex(value1)));
1227 DEBUGPRINTF_COMPUTATION(("<< %ld ", offset));
1228 _shl(val1, calc_buffer, offset, radius, sign);
1231 DEBUGPRINTF_COMPUTATION((">> %ld ", offset));
1232 _shr(val1, calc_buffer, offset, radius, sign, 0);
1235 DEBUGPRINTF_COMPUTATION((">>> %ld ", offset));
1236 _shr(val1, calc_buffer, offset, radius, sign, 1);
1239 DEBUGPRINTF_COMPUTATION(("<<>> %ld ", offset));
1240 _rot(val1, calc_buffer, offset, radius, sign);
1245 DEBUGPRINTF_COMPUTATION(("-> %s\n", sc_print_hex(calc_buffer)));
1247 if ((buffer != NULL) && (buffer != calc_buffer))
1249 memmove(buffer, calc_buffer, CALC_BUFFER_SIZE);
1253 int sc_comp(const void* value1, const void* value2)
1255 int counter = CALC_BUFFER_SIZE - 1;
1256 const char *val1 = (const char *)value1;
1257 const char *val2 = (const char *)value2;
1259 /* compare signs first:
1260 * the loop below can only compare values of the same sign! */
1261 if (_sign(val1) != _sign(val2)) return (_sign(val1) == 1)?(1):(-1);
1263 /* loop until two digits differ, the values are equal if there
1264 * are no such two digits */
1265 while (val1[counter] == val2[counter])
1268 if (counter < 0) return 0;
1271 /* the leftmost digit is the most significant, so this returns
1272 * the correct result.
1273 * This implies the digit enum is ordered */
1274 return (val1[counter] > val2[counter]) ? (1) : (-1);
1277 int sc_get_highest_set_bit(const void *value)
1279 const char *val = (const char*)value;
1282 high = CALC_BUFFER_SIZE * 4 - 1;
1284 for (counter = CALC_BUFFER_SIZE-1; counter >= 0; counter--) {
1285 if (val[counter] == SC_0) high -= 4;
1287 if (val[counter] > SC_7) return high;
1288 else if (val[counter] > SC_3) return high - 1;
1289 else if (val[counter] > SC_1) return high - 2;
1290 else return high - 3;
1296 int sc_get_lowest_set_bit(const void *value)
1298 const char *val = (const char*)value;
1302 sign = (_sign(val)==1)?(SC_0):(SC_F);
1305 for (counter = 0; counter < CALC_BUFFER_SIZE; counter++) {
1306 if (val[counter] == SC_0) low += 4;
1308 if (val[counter] < SC_2) return low;
1309 else if (val[counter] < SC_4) return low + 1;
1310 else if (val[counter] < SC_8) return low + 2;
1311 else return low + 3;
1317 int sc_is_zero(const void *value)
1319 const char* val = (const char *)value;
1322 for (counter = 0; counter < CALC_BUFFER_SIZE; counter++) {
1323 if (val[counter] != SC_0) return 0;
1328 int sc_is_negative(const void *value)
1330 return _sign(value) == -1;
1333 int sc_had_carry(void)
1338 unsigned char sc_sub_bits(const void *value, int len, unsigned byte_ofs)
1340 const char *val = (const char *)value;
1341 unsigned nibble_ofs = 2 * byte_ofs;
1344 /* the current scheme uses one byte to store a nibble */
1345 if (nibble_ofs >= len)
1348 res = _val(val[nibble_ofs]);
1349 if (len > nibble_ofs + 1)
1350 res |= _val(val[nibble_ofs + 1]) << 4;
1356 * convert to a string
1357 * XXX Doesn't check buffer bounds
1359 const char *sc_print(const void *value, unsigned bits, enum base_t base)
1361 static const char big_digits[] = "0123456789ABCDEF";
1362 static const char small_digits[] = "0123456789abcdef";
1364 char *base_val, *div1_res, *div2_res, *rem_res;
1365 int counter, nibbles, i, sign;
1368 const char *val = (const char *)value;
1372 const char *digits = small_digits;
1374 base_val = alloca(CALC_BUFFER_SIZE);
1375 div1_res = alloca(CALC_BUFFER_SIZE);
1376 div2_res = alloca(CALC_BUFFER_SIZE);
1377 rem_res = alloca(CALC_BUFFER_SIZE);
1379 pos = output_buffer + BIT_PATTERN_SIZE;
1384 bits = BIT_PATTERN_SIZE;
1385 #ifdef STRCALC_DEBUG_FULLPRINT
1389 nibbles = bits >> 2;
1393 digits = big_digits;
1395 for (counter = 0; counter < nibbles; ++counter) {
1396 *(--pos) = digits[_val(val[counter])];
1397 #ifdef STRCALC_DEBUG_GROUPPRINT
1398 if ((counter+1)%8 == 0)
1403 /* last nibble must be masked */
1405 x = and_table[_val(val[++counter])][bits & 3];
1406 *(--pos) = digits[_val(x)];
1409 /* now kill zeros */
1410 for (; counter > 1; --counter, ++pos) {
1411 #ifdef STRCALC_DEBUG_GROUPPRINT
1412 if (pos[0] == ' ') ++pos;
1420 for (counter = 0; counter < nibbles; ++counter) {
1422 p = binary_table[_val(val[counter])];
1429 /* last nibble must be masked */
1431 x = and_table[_val(val[++counter])][bits & 3];
1434 p = binary_table[_val(x)];
1441 /* now kill zeros */
1442 for (counter <<= 2; counter > 1; --counter, ++pos)
1449 memset(base_val, SC_0, CALC_BUFFER_SIZE);
1450 base_val[0] = base == SC_DEC ? SC_A : SC_8;
1454 if (base == SC_DEC) {
1455 /* check for negative values */
1456 if (_bit(val, bits - 1)) {
1457 _negate(val, div2_res);
1463 /* transfer data into oscilating buffers */
1464 memset(div1_res, SC_0, CALC_BUFFER_SIZE);
1465 for (counter = 0; counter < nibbles; ++counter)
1466 div1_res[counter] = p[counter];
1468 /* last nibble must be masked */
1472 div1_res[counter] = and_table[_val(p[counter])][bits & 3];
1478 _divmod(m, base_val, n, rem_res);
1482 *(--pos) = digits[_val(rem_res[0])];
1485 for (i = 0; i < sizeof(div1_res); ++i)
1496 printf("%i\n", base);
1503 void init_strcalc(int precision)
1505 if (calc_buffer == NULL) {
1506 if (precision <= 0) precision = SC_DEFAULT_PRECISION;
1508 /* round up to multiple of 4 */
1509 if (precision & 0x3) precision += 4 - (precision&0x3);
1511 BIT_PATTERN_SIZE = (precision);
1512 CALC_BUFFER_SIZE = (precision / 2);
1513 MAX_VALUE_SIZE = (precision / 4);
1515 calc_buffer = malloc(CALC_BUFFER_SIZE+1 * sizeof(char));
1516 output_buffer = malloc(BIT_PATTERN_SIZE+1 * sizeof(char));
1518 if (calc_buffer == NULL || output_buffer == NULL)
1520 assert(0 && "malloc failed");
1524 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));
1527 int sc_get_precision(void)
1529 return BIT_PATTERN_SIZE;