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.
16 #include <assert.h> /* assertions */
17 #include <string.h> /* memset/memcmp */
18 #include <stdio.h> /* output for error messages */
19 #include <limits.h> /* definition of LONG_MIN, used in sc_get_val_from_long */
22 * local definitions and macros
24 #define CLEAR_BUFFER(b) assert(b); memset(b, SC_0, CALC_BUFFER_SIZE)
25 #define _val(a) ((a)-SC_0)
26 #define _digit(a) ((a)+SC_0)
27 #define _bitisset(digit, pos) (and_table[_val(digit)][_val(shift_table[pos])] != SC_0)
29 #define fail_char(a, b, c, d) _fail_char((a), (b), (c), (d), __FILE__, __LINE__)
31 /* shortcut output for debugging */
32 # define sc_print_hex(a) sc_print((a), 0, SC_HEX)
33 # define sc_print_dec(a) sc_print((a), 0, SC_DEC)
34 # define sc_print_oct(a) sc_print((a), 0, SC_OCT)
35 # define sc_print_bin(a) sc_print((a), 0, SC_BIN)
37 #ifdef STRCALC_DEBUG_PRINTCOMP
38 # define DEBUGPRINTF_COMPUTATION(x) printf x
40 # define DEBUGPRINTF_COMPUTATION(x) ((void)0)
43 # define DEBUGPRINTF(x) printf x
45 # define DEBUGPRINTF(x) ((void)0)
53 static char *calc_buffer = NULL; /* buffer holding all results */
54 static char *output_buffer = NULL; /* buffer for output */
55 static int BIT_PATTERN_SIZE; /* maximum number of bits */
56 static int CALC_BUFFER_SIZE; /* size of internally stored values */
57 static int MAX_VALUE_SIZE; /* maximum size of values */
59 static int carry_flag; /* some computation set carry_flag: */
60 /* rightshift if bits were lost due to shifting */
61 /* division if there was a remainder */
63 static const char max_digit[4] = { SC_0, SC_1, SC_3, SC_7 };
64 static const char min_digit[4] = { SC_F, SC_E, SC_C, SC_8 };
66 static const char not_table[16] = { SC_F, SC_E, SC_D, SC_C, SC_B, SC_A, SC_9, SC_8,
67 SC_7, SC_6, SC_5, SC_4, SC_3, SC_2, SC_1, SC_0 };
69 static const char shift_table[4] = { SC_1, SC_2, SC_4, SC_8 };
71 static const char and_table[16][16] = {
72 { SC_0, SC_0, SC_0, SC_0, SC_0, SC_0, SC_0, SC_0,
73 SC_0, SC_0, SC_0, SC_0, SC_0, SC_0, SC_0, SC_0 },
75 { SC_0, SC_1, SC_0, SC_1, SC_0, SC_1, SC_0, SC_1,
76 SC_0, SC_1, SC_0, SC_1, SC_0, SC_1, SC_0, SC_1 },
78 { SC_0, SC_0, SC_2, SC_2, SC_0, SC_0, SC_2, SC_2,
79 SC_0, SC_0, SC_2, SC_2, SC_0, SC_0, SC_2, SC_2 },
81 { SC_0, SC_1, SC_2, SC_3, SC_0, SC_1, SC_2, SC_3,
82 SC_0, SC_1, SC_2, SC_3, SC_0, SC_1, SC_2, SC_3 },
84 { SC_0, SC_0, SC_0, SC_0, SC_4, SC_4, SC_4, SC_4,
85 SC_0, SC_0, SC_0, SC_0, SC_4, SC_4, SC_4, SC_4 },
87 { SC_0, SC_1, SC_0, SC_1, SC_4, SC_5, SC_4, SC_5,
88 SC_0, SC_1, SC_0, SC_1, SC_4, SC_5, SC_4, SC_5 },
90 { SC_0, SC_0, SC_2, SC_2, SC_4, SC_4, SC_6, SC_6,
91 SC_0, SC_0, SC_2, SC_2, SC_4, SC_4, SC_6, SC_6 },
93 { SC_0, SC_1, SC_2, SC_3, SC_4, SC_5, SC_6, SC_7,
94 SC_0, SC_1, SC_2, SC_3, SC_4, SC_5, SC_6, SC_7 },
96 { SC_0, SC_0, SC_0, SC_0, SC_0, SC_0, SC_0, SC_0,
97 SC_8, SC_8, SC_8, SC_8, SC_8, SC_8, SC_8, SC_8 },
99 { SC_0, SC_1, SC_0, SC_1, SC_0, SC_1, SC_0, SC_1,
100 SC_8, SC_9, SC_8, SC_9, SC_8, SC_9, SC_8, SC_9 },
102 { SC_0, SC_0, SC_2, SC_2, SC_0, SC_0, SC_2, SC_2,
103 SC_8, SC_8, SC_A, SC_A, SC_8, SC_8, SC_A, SC_A },
105 { SC_0, SC_1, SC_2, SC_3, SC_0, SC_1, SC_2, SC_3,
106 SC_8, SC_9, SC_A, SC_B, SC_8, SC_9, SC_A, SC_B },
108 { SC_0, SC_0, SC_0, SC_0, SC_4, SC_4, SC_4, SC_4,
109 SC_8, SC_8, SC_8, SC_8, SC_C, SC_C, SC_C, SC_C },
111 { SC_0, SC_1, SC_0, SC_1, SC_4, SC_5, SC_4, SC_5,
112 SC_8, SC_9, SC_8, SC_9, SC_C, SC_D, SC_C, SC_D },
114 { SC_0, SC_0, SC_2, SC_2, SC_4, SC_4, SC_6, SC_6,
115 SC_8, SC_8, SC_A, SC_A, SC_C, SC_C, SC_E, SC_E },
117 { SC_0, SC_1, SC_2, SC_3, SC_4, SC_5, SC_6, SC_7,
118 SC_8, SC_9, SC_A, SC_B, SC_C, SC_D, SC_E, SC_F } };
120 static const char or_table[16][16] = {
121 { SC_0, SC_1, SC_2, SC_3, SC_4, SC_5, SC_6, SC_7,
122 SC_8, SC_9, SC_A, SC_B, SC_C, SC_D, SC_E, SC_F },
124 { SC_1, SC_1, SC_3, SC_3, SC_5, SC_5, SC_7, SC_7,
125 SC_9, SC_9, SC_B, SC_B, SC_D, SC_D, SC_F, SC_F },
127 { SC_2, SC_3, SC_2, SC_3, SC_6, SC_7, SC_6, SC_7,
128 SC_A, SC_B, SC_A, SC_B, SC_E, SC_F, SC_E, SC_F },
130 { SC_3, SC_3, SC_3, SC_3, SC_7, SC_7, SC_7, SC_7,
131 SC_B, SC_B, SC_B, SC_B, SC_F, SC_F, SC_F, SC_F },
133 { SC_4, SC_5, SC_6, SC_7, SC_4, SC_5, SC_6, SC_7,
134 SC_C, SC_D, SC_E, SC_F, SC_C, SC_D, SC_E, SC_F },
136 { SC_5, SC_5, SC_7, SC_7, SC_5, SC_5, SC_7, SC_7,
137 SC_D, SC_D, SC_F, SC_F, SC_D, SC_D, SC_F, SC_F },
139 { SC_6, SC_7, SC_6, SC_7, SC_6, SC_7, SC_6, SC_7,
140 SC_E, SC_F, SC_E, SC_F, SC_E, SC_F, SC_E, SC_F },
142 { SC_7, SC_7, SC_7, SC_7, SC_7, SC_7, SC_7, SC_7,
143 SC_F, SC_F, SC_F, SC_F, SC_F, SC_F, SC_F, SC_F },
145 { SC_8, SC_9, SC_A, SC_B, SC_C, SC_D, SC_E, SC_F,
146 SC_8, SC_9, SC_A, SC_B, SC_C, SC_D, SC_E, SC_F },
148 { SC_9, SC_9, SC_B, SC_B, SC_D, SC_D, SC_F, SC_F,
149 SC_9, SC_9, SC_B, SC_B, SC_D, SC_D, SC_F, SC_F },
151 { SC_A, SC_B, SC_A, SC_B, SC_E, SC_F, SC_E, SC_F,
152 SC_A, SC_B, SC_A, SC_B, SC_E, SC_F, SC_E, SC_F },
154 { SC_B, SC_B, SC_B, SC_B, SC_F, SC_F, SC_F, SC_F,
155 SC_B, SC_B, SC_B, SC_B, SC_F, SC_F, SC_F, SC_F },
157 { SC_C, SC_D, SC_E, SC_F, SC_C, SC_D, SC_E, SC_F,
158 SC_C, SC_D, SC_E, SC_F, SC_C, SC_D, SC_E, SC_F },
160 { SC_D, SC_D, SC_F, SC_F, SC_D, SC_D, SC_F, SC_F,
161 SC_D, SC_D, SC_F, SC_F, SC_D, SC_D, SC_F, SC_F },
163 { SC_E, SC_F, SC_E, SC_F, SC_E, SC_F, SC_E, SC_F,
164 SC_E, SC_F, SC_E, SC_F, SC_E, SC_F, SC_E, SC_F },
166 { SC_F, SC_F, SC_F, SC_F, SC_F, SC_F, SC_F, SC_F,
167 SC_F, SC_F, SC_F, SC_F, SC_F, SC_F, SC_F, SC_F } };
169 static char const xor_table[16][16] = {
170 { SC_0, SC_1, SC_2, SC_3, SC_4, SC_5, SC_6, SC_7,
171 SC_8, SC_9, SC_A, SC_B, SC_C, SC_D, SC_E, SC_F },
173 { SC_1, SC_0, SC_3, SC_2, SC_5, SC_4, SC_7, SC_6,
174 SC_9, SC_8, SC_B, SC_A, SC_D, SC_C, SC_F, SC_E },
176 { SC_2, SC_3, SC_0, SC_1, SC_6, SC_7, SC_4, SC_5,
177 SC_A, SC_B, SC_8, SC_9, SC_E, SC_F, SC_C, SC_D },
179 { SC_3, SC_2, SC_1, SC_0, SC_7, SC_6, SC_5, SC_4,
180 SC_B, SC_A, SC_9, SC_8, SC_F, SC_E, SC_D, SC_C },
182 { SC_4, SC_5, SC_6, SC_7, SC_0, SC_1, SC_2, SC_3,
183 SC_C, SC_D, SC_E, SC_F, SC_8, SC_9, SC_A, SC_B },
185 { SC_5, SC_4, SC_7, SC_6, SC_1, SC_0, SC_3, SC_2,
186 SC_D, SC_C, SC_F, SC_E, SC_9, SC_8, SC_B, SC_A },
188 { SC_6, SC_7, SC_4, SC_5, SC_2, SC_3, SC_0, SC_1,
189 SC_E, SC_F, SC_C, SC_D, SC_A, SC_B, SC_8, SC_9 },
191 { SC_7, SC_6, SC_5, SC_4, SC_3, SC_2, SC_1, SC_0,
192 SC_F, SC_E, SC_D, SC_C, SC_B, SC_A, SC_9, SC_8 },
194 { SC_8, SC_9, SC_A, SC_B, SC_C, SC_D, SC_E, SC_F,
195 SC_0, SC_1, SC_2, SC_3, SC_4, SC_5, SC_6, SC_7 },
197 { SC_9, SC_8, SC_B, SC_A, SC_D, SC_C, SC_F, SC_E,
198 SC_1, SC_0, SC_3, SC_2, SC_5, SC_4, SC_7, SC_6 },
200 { SC_A, SC_B, SC_8, SC_9, SC_E, SC_F, SC_C, SC_D,
201 SC_2, SC_3, SC_0, SC_1, SC_6, SC_7, SC_4, SC_5 },
203 { SC_B, SC_A, SC_9, SC_8, SC_F, SC_E, SC_D, SC_C,
204 SC_3, SC_2, SC_1, SC_0, SC_7, SC_6, SC_5, SC_4 },
206 { SC_C, SC_D, SC_E, SC_F, SC_8, SC_9, SC_A, SC_B,
207 SC_4, SC_5, SC_6, SC_7, SC_0, SC_1, SC_2, SC_3 },
209 { SC_D, SC_C, SC_F, SC_E, SC_9, SC_8, SC_B, SC_A,
210 SC_5, SC_4, SC_7, SC_6, SC_1, SC_0, SC_3, SC_2 },
212 { SC_E, SC_F, SC_C, SC_D, SC_A, SC_B, SC_8, SC_9,
213 SC_6, SC_7, SC_4, SC_5, SC_2, SC_3, SC_0, SC_1 },
215 { SC_F, SC_E, SC_D, SC_C, SC_B, SC_A, SC_9, SC_8,
216 SC_7, SC_6, SC_5, SC_4, SC_3, SC_2, SC_1, SC_0 }
219 static char const add_table[16][16][2] = {
220 { {SC_0, SC_0}, {SC_1, SC_0}, {SC_2, SC_0}, {SC_3, SC_0},
221 {SC_4, SC_0}, {SC_5, SC_0}, {SC_6, SC_0}, {SC_7, SC_0},
222 {SC_8, SC_0}, {SC_9, SC_0}, {SC_A, SC_0}, {SC_B, SC_0},
223 {SC_C, SC_0}, {SC_D, SC_0}, {SC_E, SC_0}, {SC_F, SC_0} },
225 { {SC_1, SC_0}, {SC_2, SC_0}, {SC_3, SC_0}, {SC_4, SC_0},
226 {SC_5, SC_0}, {SC_6, SC_0}, {SC_7, SC_0}, {SC_8, SC_0},
227 {SC_9, SC_0}, {SC_A, SC_0}, {SC_B, SC_0}, {SC_C, SC_0},
228 {SC_D, SC_0}, {SC_E, SC_0}, {SC_F, SC_0}, {SC_0, SC_1} },
230 { {SC_2, SC_0}, {SC_3, SC_0}, {SC_4, SC_0}, {SC_5, SC_0},
231 {SC_6, SC_0}, {SC_7, SC_0}, {SC_8, SC_0}, {SC_9, SC_0},
232 {SC_A, SC_0}, {SC_B, SC_0}, {SC_C, SC_0}, {SC_D, SC_0},
233 {SC_E, SC_0}, {SC_F, SC_0}, {SC_0, SC_1}, {SC_1, SC_1} },
235 { {SC_3, SC_0}, {SC_4, SC_0}, {SC_5, SC_0}, {SC_6, SC_0},
236 {SC_7, SC_0}, {SC_8, SC_0}, {SC_9, SC_0}, {SC_A, SC_0},
237 {SC_B, SC_0}, {SC_C, SC_0}, {SC_D, SC_0}, {SC_E, SC_0},
238 {SC_F, SC_0}, {SC_0, SC_1}, {SC_1, SC_1}, {SC_2, SC_1} },
240 { {SC_4, SC_0}, {SC_5, SC_0}, {SC_6, SC_0}, {SC_7, SC_0},
241 {SC_8, SC_0}, {SC_9, SC_0}, {SC_A, SC_0}, {SC_B, SC_0},
242 {SC_C, SC_0}, {SC_D, SC_0}, {SC_E, SC_0}, {SC_F, SC_0},
243 {SC_0, SC_1}, {SC_1, SC_1}, {SC_2, SC_1}, {SC_3, SC_1} },
245 { {SC_5, SC_0}, {SC_6, SC_0}, {SC_7, SC_0}, {SC_8, SC_0},
246 {SC_9, SC_0}, {SC_A, SC_0}, {SC_B, SC_0}, {SC_C, SC_0},
247 {SC_D, SC_0}, {SC_E, SC_0}, {SC_F, SC_0}, {SC_0, SC_1},
248 {SC_1, SC_1}, {SC_2, SC_1}, {SC_3, SC_1}, {SC_4, SC_1} },
250 { {SC_6, SC_0}, {SC_7, SC_0}, {SC_8, SC_0}, {SC_9, SC_0},
251 {SC_A, SC_0}, {SC_B, SC_0}, {SC_C, SC_0}, {SC_D, SC_0},
252 {SC_E, SC_0}, {SC_F, SC_0}, {SC_0, SC_1}, {SC_1, SC_1},
253 {SC_2, SC_1}, {SC_3, SC_1}, {SC_4, SC_1}, {SC_5, SC_1} },
255 { {SC_7, SC_0}, {SC_8, SC_0}, {SC_9, SC_0}, {SC_A, SC_0},
256 {SC_B, SC_0}, {SC_C, SC_0}, {SC_D, SC_0}, {SC_E, SC_0},
257 {SC_F, SC_0}, {SC_0, SC_1}, {SC_1, SC_1}, {SC_2, SC_1},
258 {SC_3, SC_1}, {SC_4, SC_1}, {SC_5, SC_1}, {SC_6, SC_1} },
260 { {SC_8, SC_0}, {SC_9, SC_0}, {SC_A, SC_0}, {SC_B, SC_0},
261 {SC_C, SC_0}, {SC_D, SC_0}, {SC_E, SC_0}, {SC_F, SC_0},
262 {SC_0, SC_1}, {SC_1, SC_1}, {SC_2, SC_1}, {SC_3, SC_1},
263 {SC_4, SC_1}, {SC_5, SC_1}, {SC_6, SC_1}, {SC_7, SC_1} },
265 { {SC_9, SC_0}, {SC_A, SC_0}, {SC_B, SC_0}, {SC_C, SC_0},
266 {SC_D, SC_0}, {SC_E, SC_0}, {SC_F, SC_0}, {SC_0, SC_1},
267 {SC_1, SC_1}, {SC_2, SC_1}, {SC_3, SC_1}, {SC_4, SC_1},
268 {SC_5, SC_1}, {SC_6, SC_1}, {SC_7, SC_1}, {SC_8, SC_1} },
270 { {SC_A, SC_0}, {SC_B, SC_0}, {SC_C, SC_0}, {SC_D, SC_0},
271 {SC_E, SC_0}, {SC_F, SC_0}, {SC_0, SC_1}, {SC_1, SC_1},
272 {SC_2, SC_1}, {SC_3, SC_1}, {SC_4, SC_1}, {SC_5, SC_1},
273 {SC_6, SC_1}, {SC_7, SC_1}, {SC_8, SC_1}, {SC_9, SC_1} },
275 { {SC_B, SC_0}, {SC_C, SC_0}, {SC_D, SC_0}, {SC_E, SC_0},
276 {SC_F, SC_0}, {SC_0, SC_1}, {SC_1, SC_1}, {SC_2, SC_1},
277 {SC_3, SC_1}, {SC_4, SC_1}, {SC_5, SC_1}, {SC_6, SC_1},
278 {SC_7, SC_1}, {SC_8, SC_1}, {SC_9, SC_1}, {SC_A, SC_1} },
280 { {SC_C, SC_0}, {SC_D, SC_0}, {SC_E, SC_0}, {SC_F, SC_0},
281 {SC_0, SC_1}, {SC_1, SC_1}, {SC_2, SC_1}, {SC_3, SC_1},
282 {SC_4, SC_1}, {SC_5, SC_1}, {SC_6, SC_1}, {SC_7, SC_1},
283 {SC_8, SC_1}, {SC_9, SC_1}, {SC_A, SC_1}, {SC_B, SC_1} },
285 { {SC_D, SC_0}, {SC_E, SC_0}, {SC_F, SC_0}, {SC_0, SC_1},
286 {SC_1, SC_1}, {SC_2, SC_1}, {SC_3, SC_1}, {SC_4, SC_1},
287 {SC_5, SC_1}, {SC_6, SC_1}, {SC_7, SC_1}, {SC_8, SC_1},
288 {SC_9, SC_1}, {SC_A, SC_1}, {SC_B, SC_1}, {SC_C, SC_1} },
290 { {SC_E, SC_0}, {SC_F, SC_0}, {SC_0, SC_1}, {SC_1, SC_1},
291 {SC_2, SC_1}, {SC_3, SC_1}, {SC_4, SC_1}, {SC_5, SC_1},
292 {SC_6, SC_1}, {SC_7, SC_1}, {SC_8, SC_1}, {SC_9, SC_1},
293 {SC_A, SC_1}, {SC_B, SC_1}, {SC_C, SC_1}, {SC_D, SC_1} },
295 { {SC_F, SC_0}, {SC_0, SC_1}, {SC_1, SC_1}, {SC_2, SC_1},
296 {SC_3, SC_1}, {SC_4, SC_1}, {SC_5, SC_1}, {SC_6, SC_1},
297 {SC_7, SC_1}, {SC_8, SC_1}, {SC_9, SC_1}, {SC_A, SC_1},
298 {SC_B, SC_1}, {SC_C, SC_1}, {SC_D, SC_1}, {SC_E, SC_1} }
301 static char const mul_table[16][16][2] = {
302 { {SC_0, SC_0}, {SC_0, SC_0}, {SC_0, SC_0}, {SC_0, SC_0},
303 {SC_0, SC_0}, {SC_0, SC_0}, {SC_0, SC_0}, {SC_0, SC_0},
304 {SC_0, SC_0}, {SC_0, SC_0}, {SC_0, SC_0}, {SC_0, SC_0},
305 {SC_0, SC_0}, {SC_0, SC_0}, {SC_0, SC_0}, {SC_0, SC_0} },
307 { {SC_0, SC_0}, {SC_1, SC_0}, {SC_2, SC_0}, {SC_3, SC_0},
308 {SC_4, SC_0}, {SC_5, SC_0}, {SC_6, SC_0}, {SC_7, SC_0},
309 {SC_8, SC_0}, {SC_9, SC_0}, {SC_A, SC_0}, {SC_B, SC_0},
310 {SC_C, SC_0}, {SC_D, SC_0}, {SC_E, SC_0}, {SC_F, SC_0} },
312 { {SC_0, SC_0}, {SC_2, SC_0}, {SC_4, SC_0}, {SC_6, SC_0},
313 {SC_8, SC_0}, {SC_A, SC_0}, {SC_C, SC_0}, {SC_E, SC_0},
314 {SC_0, SC_1}, {SC_2, SC_1}, {SC_4, SC_1}, {SC_6, SC_1},
315 {SC_8, SC_1}, {SC_A, SC_1}, {SC_C, SC_1}, {SC_E, SC_1} },
317 { {SC_0, SC_0}, {SC_3, SC_0}, {SC_6, SC_0}, {SC_9, SC_0},
318 {SC_C, SC_0}, {SC_F, SC_0}, {SC_2, SC_1}, {SC_5, SC_1},
319 {SC_8, SC_1}, {SC_B, SC_1}, {SC_E, SC_1}, {SC_1, SC_2},
320 {SC_4, SC_2}, {SC_7, SC_2}, {SC_A, SC_2}, {SC_D, SC_2} },
322 { {SC_0, SC_0}, {SC_4, SC_0}, {SC_8, SC_0}, {SC_C, SC_0},
323 {SC_0, SC_1}, {SC_4, SC_1}, {SC_8, SC_1}, {SC_C, SC_1},
324 {SC_0, SC_2}, {SC_4, SC_2}, {SC_8, SC_2}, {SC_C, SC_2},
325 {SC_0, SC_3}, {SC_4, SC_3}, {SC_8, SC_3}, {SC_C, SC_3} },
327 { {SC_0, SC_0}, {SC_5, SC_0}, {SC_A, SC_0}, {SC_F, SC_0},
328 {SC_4, SC_1}, {SC_9, SC_1}, {SC_E, SC_1}, {SC_3, SC_2},
329 {SC_8, SC_2}, {SC_D, SC_2}, {SC_2, SC_3}, {SC_7, SC_3},
330 {SC_C, SC_3}, {SC_1, SC_4}, {SC_6, SC_4}, {SC_B, SC_4} },
332 { {SC_0, SC_0}, {SC_6, SC_0}, {SC_C, SC_0}, {SC_2, SC_1},
333 {SC_8, SC_1}, {SC_E, SC_1}, {SC_4, SC_2}, {SC_A, SC_2},
334 {SC_0, SC_3}, {SC_6, SC_3}, {SC_C, SC_3}, {SC_2, SC_4},
335 {SC_8, SC_4}, {SC_E, SC_4}, {SC_4, SC_5}, {SC_A, SC_5} },
337 { {SC_0, SC_0}, {SC_7, SC_0}, {SC_E, SC_0}, {SC_5, SC_1},
338 {SC_C, SC_1}, {SC_3, SC_2}, {SC_A, SC_2}, {SC_1, SC_3},
339 {SC_8, SC_3}, {SC_F, SC_3}, {SC_6, SC_4}, {SC_D, SC_4},
340 {SC_4, SC_5}, {SC_B, SC_5}, {SC_2, SC_6}, {SC_9, SC_6} },
342 { {SC_0, SC_0}, {SC_8, SC_0}, {SC_0, SC_1}, {SC_8, SC_1},
343 {SC_0, SC_2}, {SC_8, SC_2}, {SC_0, SC_3}, {SC_8, SC_3},
344 {SC_0, SC_4}, {SC_8, SC_4}, {SC_0, SC_5}, {SC_8, SC_5},
345 {SC_0, SC_6}, {SC_8, SC_6}, {SC_0, SC_7}, {SC_8, SC_7} },
347 { {SC_0, SC_0}, {SC_9, SC_0}, {SC_2, SC_1}, {SC_B, SC_1},
348 {SC_4, SC_2}, {SC_D, SC_2}, {SC_6, SC_3}, {SC_F, SC_3},
349 {SC_8, SC_4}, {SC_1, SC_5}, {SC_A, SC_5}, {SC_3, SC_6},
350 {SC_C, SC_6}, {SC_5, SC_7}, {SC_E, SC_7}, {SC_7, SC_8} },
352 { {SC_0, SC_0}, {SC_A, SC_0}, {SC_4, SC_1}, {SC_E, SC_1},
353 {SC_8, SC_2}, {SC_2, SC_3}, {SC_C, SC_3}, {SC_6, SC_4},
354 {SC_0, SC_5}, {SC_A, SC_5}, {SC_4, SC_6}, {SC_E, SC_6},
355 {SC_8, SC_7}, {SC_2, SC_8}, {SC_C, SC_8}, {SC_6, SC_9} },
357 { {SC_0, SC_0}, {SC_B, SC_0}, {SC_6, SC_1}, {SC_1, SC_2},
358 {SC_C, SC_2}, {SC_7, SC_3}, {SC_2, SC_4}, {SC_D, SC_4},
359 {SC_8, SC_5}, {SC_3, SC_6}, {SC_E, SC_6}, {SC_9, SC_7},
360 {SC_4, SC_8}, {SC_F, SC_8}, {SC_A, SC_9}, {SC_5, SC_A} },
362 { {SC_0, SC_0}, {SC_C, SC_0}, {SC_8, SC_1}, {SC_4, SC_2},
363 {SC_0, SC_3}, {SC_C, SC_3}, {SC_8, SC_4}, {SC_4, SC_5},
364 {SC_0, SC_6}, {SC_C, SC_6}, {SC_8, SC_7}, {SC_4, SC_8},
365 {SC_0, SC_9}, {SC_C, SC_9}, {SC_8, SC_A}, {SC_4, SC_B} },
367 { {SC_0, SC_0}, {SC_D, SC_0}, {SC_A, SC_1}, {SC_7, SC_2},
368 {SC_4, SC_3}, {SC_1, SC_4}, {SC_E, SC_4}, {SC_B, SC_5},
369 {SC_8, SC_6}, {SC_5, SC_7}, {SC_2, SC_8}, {SC_F, SC_8},
370 {SC_C, SC_9}, {SC_9, SC_A}, {SC_6, SC_B}, {SC_3, SC_C} },
372 { {SC_0, SC_0}, {SC_E, SC_0}, {SC_C, SC_1}, {SC_A, SC_2},
373 {SC_8, SC_3}, {SC_6, SC_4}, {SC_4, SC_5}, {SC_2, SC_6},
374 {SC_0, SC_7}, {SC_E, SC_7}, {SC_C, SC_8}, {SC_A, SC_9},
375 {SC_8, SC_A}, {SC_6, SC_B}, {SC_4, SC_C}, {SC_2, SC_D} },
377 { {SC_0, SC_0}, {SC_F, SC_0}, {SC_E, SC_1}, {SC_D, SC_2},
378 {SC_C, SC_3}, {SC_B, SC_4}, {SC_A, SC_5}, {SC_9, SC_6},
379 {SC_8, SC_7}, {SC_7, SC_8}, {SC_6, SC_9}, {SC_5, SC_A},
380 {SC_4, SC_B}, {SC_3, SC_C}, {SC_2, SC_D}, {SC_1, SC_E} }
383 static char const shrs_table[16][4][2] = {
384 { {SC_0, SC_0}, {SC_0, SC_0}, {SC_0, SC_0}, {SC_0, SC_0} },
385 { {SC_1, SC_0}, {SC_0, SC_8}, {SC_0, SC_4}, {SC_0, SC_2} },
386 { {SC_2, SC_0}, {SC_1, SC_0}, {SC_0, SC_8}, {SC_0, SC_4} },
387 { {SC_3, SC_0}, {SC_1, SC_8}, {SC_0, SC_C}, {SC_0, SC_6} },
388 { {SC_4, SC_0}, {SC_2, SC_0}, {SC_1, SC_0}, {SC_0, SC_8} },
389 { {SC_5, SC_0}, {SC_2, SC_8}, {SC_1, SC_4}, {SC_0, SC_A} },
390 { {SC_6, SC_0}, {SC_3, SC_0}, {SC_1, SC_8}, {SC_0, SC_C} },
391 { {SC_7, SC_0}, {SC_3, SC_8}, {SC_1, SC_C}, {SC_0, SC_E} },
392 { {SC_8, SC_0}, {SC_4, SC_0}, {SC_2, SC_0}, {SC_1, SC_0} },
393 { {SC_9, SC_0}, {SC_4, SC_8}, {SC_2, SC_4}, {SC_1, SC_2} },
394 { {SC_A, SC_0}, {SC_5, SC_0}, {SC_2, SC_8}, {SC_1, SC_4} },
395 { {SC_B, SC_0}, {SC_5, SC_8}, {SC_2, SC_C}, {SC_1, SC_6} },
396 { {SC_C, SC_0}, {SC_6, SC_0}, {SC_3, SC_0}, {SC_1, SC_8} },
397 { {SC_D, SC_0}, {SC_6, SC_8}, {SC_3, SC_4}, {SC_1, SC_A} },
398 { {SC_E, SC_0}, {SC_7, SC_0}, {SC_3, SC_8}, {SC_1, SC_C} },
399 { {SC_F, SC_0}, {SC_7, SC_8}, {SC_3, SC_C}, {SC_1, SC_E} }
402 /* for converting to binary string */
403 static const char *binary_table[16] = {
404 "0000", "0001", "0010", "0011", "0100", "0101", "0110", "0111",
405 "1000", "1001", "1010", "1011", "1100", "1101", "1110", "1111"
408 /*****************************************************************************
410 *****************************************************************************/
411 static void _fail_char(const char *str, size_t len, const char fchar, int pos,
412 const char *file, int line)
415 printf("Unexpected character '%c' in %s:%d\n", fchar, file, line);
416 while (len-- && *str) printf("%c", *str++); printf("\n");
417 while (--pos) printf(" "); printf("^\n");
421 static void _bitnot(const char *val, char *buffer)
425 for (counter = 0; counter<CALC_BUFFER_SIZE; counter++)
426 buffer[counter] = not_table[_val(val[counter])];
429 static void _bitor(const char *val1, const char *val2, char *buffer)
433 for (counter = 0; counter<CALC_BUFFER_SIZE; counter++)
434 buffer[counter] = or_table[_val(val1[counter])][_val(val2[counter])];
437 static void _bitxor(const char *val1, const char *val2, char *buffer)
441 for (counter = 0; counter<CALC_BUFFER_SIZE; counter++)
442 buffer[counter] = xor_table[_val(val1[counter])][_val(val2[counter])];
445 static void _bitand(const char *val1, const char *val2, char *buffer)
449 for (counter = 0; counter<CALC_BUFFER_SIZE; counter++)
450 buffer[counter] = and_table[_val(val1[counter])][_val(val2[counter])];
453 static int _sign(const char *val)
455 return (val[CALC_BUFFER_SIZE-1] <= SC_7) ? (1) : (-1);
459 * returns non-zero if bit at position pos is set
461 static int _bit(const char *val, int pos)
464 int nibble = pos >> 2;
466 return _bitisset(val[nibble], bit);
469 static void _inc(char *val, char *buffer)
473 while (counter++ < CALC_BUFFER_SIZE)
482 /* No carry here, *val != SC_F */
483 *buffer = add_table[_val(*val)][SC_1][0];
487 /* here a carry could be lost, this is intended because this should
488 * happen only when a value changes sign. */
491 static void _negate(const char *val, char *buffer)
493 _bitnot(val, buffer);
494 _inc(buffer, buffer);
497 static void _add(const char *val1, const char *val2, char *buffer)
500 const char *add1, *add2;
503 for (counter = 0; counter < CALC_BUFFER_SIZE; counter++)
505 add1 = add_table[_val(val1[counter])][_val(val2[counter])];
506 add2 = add_table[_val(add1[0])][_val(carry)];
507 /* carry might be zero */
508 buffer[counter] = add2[0];
509 carry = add_table[_val(add1[1])][_val(add2[1])][0];
513 static void _mul(const char *val1, const char *val2, char *buffer)
515 char temp_buffer[CALC_BUFFER_SIZE]; /* result buffer */
516 char neg_val1[CALC_BUFFER_SIZE]; /* abs of val1 */
517 char neg_val2[CALC_BUFFER_SIZE]; /* abs of val2 */
519 const char *mul, *add1, *add2; /* intermediate result containers */
520 char carry = SC_0; /* container for carries */
521 char sign = 0; /* marks result sign */
522 int c_inner, c_outer; /* loop counters */
524 /* init result buffer to zeroes */
525 memset(temp_buffer, SC_0, CALC_BUFFER_SIZE);
527 /* the multiplication works only for positive values, for negative values *
528 * it is necessary to negate them and adjust the result accordingly */
529 if (_sign(val1) == -1) {
530 _negate(val1, neg_val1);
534 if (_sign(val2) == -1) {
535 _negate(val2, neg_val2);
540 for (c_outer = 0; c_outer < MAX_VALUE_SIZE; c_outer++)
542 if (val2[c_outer] != SC_0)
544 for (c_inner = 0; c_inner < MAX_VALUE_SIZE; c_inner++)
546 /* do the following calculation: *
547 * Add the current carry, the value at position c_outer+c_inner *
548 * and the result of the multiplication of val1[c_inner] and *
549 * val2[c_outer]. This is the usual pen-and-paper multiplication. */
551 /* multiplicate the two digits */
552 mul = mul_table[_val(val1[c_inner])][_val(val2[c_outer])];
553 /* add old value to result of multiplication */
554 add1 = add_table[_val(temp_buffer[c_inner + c_outer])][_val(mul[0])];
555 /* add carry to the sum */
556 add2 = add_table[_val(add1[0])][_val(carry)];
558 /* all carries together result in new carry. This is always smaller *
560 * Both multiplicands, the carry and the value already in the temp *
561 * buffer are single digits and their value is therefore at most *
564 * (b-1)(b-1)+(b-1)+(b-1) = b*b-1 *
565 * The tables list all operations rem b, so the carry is at most *
566 * (b*b-1)rem b = -1rem b = b-1 */
567 carry = add_table[_val(mul[1])][_val(add1[1])][0];
568 carry = add_table[_val(carry)][_val(add2[1])][0];
570 temp_buffer[c_inner + c_outer] = add2[0];
573 /* A carry may hang over */
574 /* c_outer is always smaller than MAX_VALUE_SIZE! */
575 temp_buffer[MAX_VALUE_SIZE + c_outer] = carry;
581 _negate(temp_buffer, buffer);
583 memcpy(buffer, temp_buffer, CALC_BUFFER_SIZE);
586 static void _sub(const char *val1, const char *val2, char *buffer)
588 char temp_buffer[CALC_BUFFER_SIZE]; /* intermediate buffer to hold -val2 */
590 _negate(val2, temp_buffer);
591 _add(val1, temp_buffer, buffer);
594 static void _push(const char digit, char *buffer)
598 for (counter = CALC_BUFFER_SIZE - 2; counter >= 0; counter--)
600 buffer[counter+1] = buffer[counter];
605 /* XXX: This is MOST slow */
606 static void _divmod(const char *dividend, const char *divisor, char *quot, char *rem)
608 const char *minus_divisor;
609 char neg_val1[CALC_BUFFER_SIZE];
610 char neg_val2[CALC_BUFFER_SIZE];
612 char sign = 0; /* remember result sign */
614 int c_dividend; /* loop counters */
616 /* clear result buffer */
617 memset(quot, SC_0, CALC_BUFFER_SIZE);
618 memset(rem, SC_0, CALC_BUFFER_SIZE);
620 /* if the divisor is zero this won't work (quot is zero) */
621 if (sc_comp(divisor, quot) == 0) assert(0 && "division by zero!");
623 /* if the dividend is zero result is zero (quot is zero)*/
624 if (sc_comp(dividend, quot) == 0)
627 if (_sign(dividend) == -1)
629 _negate(dividend, neg_val1);
634 _negate(divisor, neg_val2);
635 if (_sign(divisor) == -1)
638 minus_divisor = divisor;
643 minus_divisor = neg_val2;
646 /* if divisor >= dividend division is easy
647 * (remember these are absolute values) */
648 switch (sc_comp(dividend, divisor))
650 case 0: /* dividend == divisor */
654 case -1: /* dividend < divisor */
655 memcpy(rem, dividend, CALC_BUFFER_SIZE);
658 default: /* unluckily division is necessary :( */
662 for (c_dividend = CALC_BUFFER_SIZE - 1; c_dividend >= 0; c_dividend--)
664 _push(dividend[c_dividend], rem);
667 if (sc_comp(rem, divisor) != -1) /* remainder >= divisor */
669 /* subtract until the remainder becomes negative, this should
670 * be faster than comparing remainder with divisor */
671 _add(rem, minus_divisor, rem);
673 while (_sign(rem) == 1)
675 quot[0] = add_table[_val(quot[0])][SC_1][0];
676 _add(rem, minus_divisor, rem);
679 /* subtracted one too much */
680 _add(rem, divisor, rem);
684 carry_flag = !sc_is_zero(rem);
693 static void _shl(const char *val1, char *buffer, long offset, int radius, unsigned is_signed)
702 assert((offset >= 0) || (0 && "negative leftshift"));
703 assert(((_sign(val1) != -1) || is_signed) || (0 && "unsigned mode and negative value"));
704 assert(((!_bitisset(val1[(radius-1)/4], (radius-1)%4)) || !is_signed || (_sign(val1) == -1)) || (0 && "value is positive, should be negative"));
705 assert(((_bitisset(val1[(radius-1)/4], (radius-1)%4)) || !is_signed || (_sign(val1) == 1)) || (0 && "value is negative, should be positive"));
707 /* if shifting far enough the result is zero */
708 if (offset >= radius)
710 memset(buffer, SC_0, CALC_BUFFER_SIZE);
714 shift = shift_table[_val(offset%4)]; /* this is 2 ** (offset % 4) */
717 /* shift the single digits some bytes (offset) and some bits (table)
719 for (counter = 0; counter < radius/4 - offset; counter++)
721 shl = mul_table[_val(val1[counter])][_val(shift)];
722 buffer[counter + offset] = or_table[_val(shl[0])][_val(carry)];
727 shl = mul_table[_val(val1[counter])][_val(shift)];
728 buffer[counter + offset] = or_table[_val(shl[0])][_val(carry)];
731 bitoffset = counter - 1;
734 /* fill with zeroes */
735 for (counter = 0; counter < offset; counter++) buffer[counter] = SC_0;
737 /* if the mode was signed, change sign when the mode's msb is now 1 */
738 offset = bitoffset + offset;
739 bitoffset = (radius-1) % 4;
740 if (is_signed && _bitisset(buffer[offset], bitoffset))
742 /* this sets the upper bits of the leftmost digit */
743 buffer[offset] = or_table[_val(buffer[offset])][_val(min_digit[bitoffset])];
744 for (counter = offset+1; counter < CALC_BUFFER_SIZE; counter++)
746 buffer[counter] = SC_F;
749 else if (is_signed && !_bitisset(buffer[offset], bitoffset))
751 /* this unsets the upper bits of the leftmost digit */
752 buffer[offset] = and_table[_val(buffer[offset])][_val(max_digit[bitoffset])];
753 for (counter = offset+1; counter < CALC_BUFFER_SIZE; counter++)
755 buffer[counter] = SC_0;
760 static void _shr(const char *val1, char *buffer, long offset, int radius, unsigned is_signed, int signed_shift)
771 assert((offset >= 0) || (0 && "negative rightshift"));
772 assert(((_sign(val1) != -1) || is_signed) || (0 && "unsigned mode and negative value"));
773 assert(((!_bitisset(val1[(radius-1)/4], (radius-1)%4)) || !is_signed || (_sign(val1) == -1)) || (0 && "value is positive, should be negative"));
774 assert(((_bitisset(val1[(radius-1)/4], (radius-1)%4)) || !is_signed || (_sign(val1) == 1)) || (0 && "value is negative, should be positive"));
776 sign = ((signed_shift) && (_sign(val1) == -1))?(SC_F):(SC_0);
778 /* if shifting far enough the result is either 0 or -1 */
779 if (offset >= radius)
781 if (!sc_is_zero(val1)) {
784 memset(buffer, sign, CALC_BUFFER_SIZE);
791 /* check if any bits are lost, and set carry_flag if so */
792 for (counter = 0; counter < offset; counter++)
794 if (val1[counter] != 0)
800 if ((_val(val1[counter]) & ((1<<shift)-1)) != 0)
804 /* shift digits to the right with offset, carry and all */
806 if (radius/4 - offset > 0) {
807 buffer[counter] = shrs_table[_val(val1[offset])][shift][0];
810 for (; counter < radius/4 - offset; counter++)
812 shrs = shrs_table[_val(val1[counter + offset])][shift];
813 buffer[counter] = shrs[0];
814 buffer[counter-1] = or_table[_val(buffer[counter-1])][_val(shrs[1])];
817 /* the last digit is special in regard of signed/unsigned shift */
818 bitoffset = radius%4;
819 msd = (radius/4<CALC_BUFFER_SIZE)?(val1[radius/4]):(sign); /* most significant digit */
821 /* remove sign bits if mode was signed and this is an unsigned shift */
822 if (!signed_shift && is_signed) {
823 msd = and_table[_val(msd)][_val(max_digit[bitoffset])];
826 shrs = shrs_table[_val(msd)][shift];
828 /* signed shift and signed mode and negative value means all bits to the left are set */
829 if (signed_shift && is_signed && (_sign(val1) == -1)) {
830 buffer[counter] = or_table[_val(shrs[0])][_val(min_digit[bitoffset])];
832 buffer[counter] = shrs[0];
835 if (counter > 0) buffer[counter - 1] = or_table[_val(buffer[counter-1])][_val(shrs[1])];
837 /* fill with SC_F or SC_0 depending on sign */
838 for (counter++; counter < CALC_BUFFER_SIZE; counter++)
840 buffer[counter] = sign;
844 /* positive: low-order -> high order, negative other direction */
845 static void _rot(const char *val1, char *buffer, long offset, int radius, unsigned is_signed)
847 char temp1[CALC_BUFFER_SIZE];
848 char temp2[CALC_BUFFER_SIZE];
850 offset = offset % radius;
852 /* rotation by multiples of the typelength is identity */
854 memmove(buffer, val1, CALC_BUFFER_SIZE);
858 _shl(val1, temp1, offset, radius, is_signed);
859 _shr(val1, temp2, radius - offset, radius, is_signed, 0);
860 _bitor(temp1, temp2, buffer);
861 carry_flag = 0; /* set by shr, but due to rot this is false */
864 /*****************************************************************************
865 * public functions, declared in strcalc.h
866 *****************************************************************************/
867 const void *sc_get_buffer(void)
869 return (void*)calc_buffer;
872 const int sc_get_buffer_length(void)
874 return CALC_BUFFER_SIZE;
877 /* XXX doesn't check for overflows */
878 void sc_val_from_str(const char *str, unsigned int len, void *buffer)
880 const char *orig_str = str;
881 unsigned int orig_len = len;
884 char base[CALC_BUFFER_SIZE];
885 char val[CALC_BUFFER_SIZE];
887 /* verify valid pointers (not null) */
889 /* a string no characters long is an error */
892 if (buffer == NULL) buffer = calc_buffer;
894 CLEAR_BUFFER(buffer);
895 memset(base, SC_0, CALC_BUFFER_SIZE);
896 memset(val, SC_0, CALC_BUFFER_SIZE);
898 /* strip leading spaces */
899 while ((len > 0) && (*str == ' ')) { len--; str++; }
901 /* if the first two characters are 0x or 0X -> hex
902 * if the first is a 0 -> oct
903 * else dec, strip leading -/+ and remember sign
905 * only a + or - sign is no number resulting in an error */
910 if (str[1] == 'x' || str[1] == 'X') /* hex */
914 base[1] = SC_1; base[0] = SC_0;
920 base[1] = SC_0; base[0] = SC_8;
928 base[1] = SC_0; base[0] = SC_A;
937 base[1] = SC_0; base[0] = SC_A;
941 default: /* dec, else would have begun with 0x or 0 */
942 base[1] = SC_0; base[0] = SC_A;
945 else /* dec, else would have begun with 0x or 0 */
947 base[1] = SC_0; base[0] = SC_A;
950 /* BEGIN string evaluation, from left to right */
961 if (base[0] > SC_9 || base[1] > SC_0) /* (base > 10) */
963 val[0] = _digit((*str)-'a'+10);
965 else fail_char(orig_str, orig_len, *str, str-orig_str+1);
974 if (base[0] > SC_9 || base[1] > SC_0) /* (base > 10) */
976 val[0] = _digit((*str)-'A'+10);
978 else fail_char(orig_str, orig_len, *str, str-orig_str+1);
983 if (base[0] > SC_7 || base[1] > SC_0) /* (base > 8) */
985 val[0] = _digit((*str)-'0');
987 else fail_char(orig_str, orig_len, *str, str-orig_str+1);
999 val[0] = _digit((*str)-'0');
1004 fail_char(orig_str, orig_len, *str, str-orig_str+1);
1005 } /* switch(*str) */
1007 /* Radix conversion from base b to base B:
1008 * (UnUn-1...U1U0)b == ((((Un*b + Un-1)*b + ...)*b + U1)*b + U0)B */
1009 _mul(base, calc_buffer, calc_buffer); /* multiply current value with base */
1010 _add(val, calc_buffer, calc_buffer); /* add next digit to current value */
1012 /* get ready for the next letter */
1016 } /* while (len > 0 ) */
1020 _negate(calc_buffer, calc_buffer);
1024 void sc_val_from_long(long value, void *buffer)
1027 char sign, is_minlong;
1029 if (buffer == NULL) buffer = calc_buffer;
1033 is_minlong = value == LONG_MIN;
1035 /* use absolute value, special treatment of MIN_LONG */
1043 CLEAR_BUFFER(buffer);
1045 while ((value != 0) && (pos < (char*)buffer + CALC_BUFFER_SIZE))
1047 *pos++ = _digit(value & 0xf);
1054 _inc(buffer, buffer);
1056 _negate(buffer, buffer);
1060 void sc_val_from_ulong(unsigned long value, void *buffer)
1064 if (buffer == NULL) buffer = calc_buffer;
1067 while (pos < (char*)buffer + CALC_BUFFER_SIZE)
1069 *pos++ = _digit(value & 0xf);
1074 long sc_val_to_long(const void *val)
1079 for (i = CALC_BUFFER_SIZE - 1; i >= 0; i--)
1081 l = (l << 4) + _val(((char *)val)[i]);
1086 void sc_min_from_bits(unsigned int num_bits, unsigned int sign, void *buffer)
1091 if (buffer == NULL) buffer = calc_buffer;
1092 CLEAR_BUFFER(buffer);
1094 if (!sign) return; /* unsigned means minimum is 0(zero) */
1098 bits = num_bits - 1;
1099 for (i = 0; i < bits/4; i++)
1102 *pos++ = min_digit[bits%4];
1104 for (i++; i <= CALC_BUFFER_SIZE - 1; i++)
1108 void sc_max_from_bits(unsigned int num_bits, unsigned int sign, void *buffer)
1113 if (buffer == NULL) buffer = calc_buffer;
1114 CLEAR_BUFFER(buffer);
1117 bits = num_bits - sign;
1118 for (i = 0; i < bits/4; i++)
1121 *pos++ = max_digit[bits%4];
1123 for (i++; i <= CALC_BUFFER_SIZE - 1; i++)
1127 void sc_calc(const void* value1, const void* value2, unsigned op, void *buffer)
1129 char unused_res[CALC_BUFFER_SIZE]; /* temp buffer holding unused result of divmod */
1131 const char *val1 = (const char *)value1;
1132 const char *val2 = (const char *)value2;
1134 CLEAR_BUFFER(calc_buffer);
1137 DEBUGPRINTF_COMPUTATION(("%s ", sc_print_hex(value1)));
1142 _negate(val1, calc_buffer);
1143 DEBUGPRINTF_COMPUTATION(("negated: %s\n", sc_print_hex(calc_buffer)));
1146 DEBUGPRINTF_COMPUTATION(("| "));
1147 _bitor(val1, val2, calc_buffer);
1150 DEBUGPRINTF_COMPUTATION(("& "));
1151 _bitand(val1, val2, calc_buffer);
1154 DEBUGPRINTF_COMPUTATION(("^ "));
1155 _bitxor(val1, val2, calc_buffer);
1158 _bitnot(val1, calc_buffer);
1159 DEBUGPRINTF_COMPUTATION(("bit-negated: %s\n", sc_print_hex(calc_buffer)));
1162 DEBUGPRINTF_COMPUTATION(("+ "));
1163 _add(val1, val2, calc_buffer);
1166 DEBUGPRINTF_COMPUTATION(("- "));
1167 _sub(val1, val2, calc_buffer);
1170 DEBUGPRINTF_COMPUTATION(("* "));
1171 _mul(val1, val2, calc_buffer);
1174 DEBUGPRINTF_COMPUTATION(("/ "));
1175 _divmod(val1, val2, calc_buffer, unused_res);
1178 DEBUGPRINTF_COMPUTATION(("%% "));
1179 _divmod(val1, val2, unused_res, calc_buffer);
1184 DEBUGPRINTF_COMPUTATION(("%s -> ", sc_print_hex(value2)));
1185 DEBUGPRINTF_COMPUTATION(("%s\n", sc_print_hex(calc_buffer)));
1187 if ((buffer != NULL) && (buffer != calc_buffer))
1189 memcpy(buffer, calc_buffer, CALC_BUFFER_SIZE);
1193 void sc_bitcalc(const void* value1, const void* value2, int radius, int sign, unsigned op, void* buffer)
1195 const char *val1 = (const char *)value1;
1196 const char *val2 = (const char *)value2;
1200 offset = sc_val_to_long(val2);
1202 DEBUGPRINTF_COMPUTATION(("%s ", sc_print_hex(value1)));
1206 DEBUGPRINTF_COMPUTATION(("<< %ld ", offset));
1207 _shl(val1, calc_buffer, offset, radius, sign);
1210 DEBUGPRINTF_COMPUTATION((">> %ld ", offset));
1211 _shr(val1, calc_buffer, offset, radius, sign, 0);
1214 DEBUGPRINTF_COMPUTATION((">>> %ld ", offset));
1215 _shr(val1, calc_buffer, offset, radius, sign, 1);
1218 DEBUGPRINTF_COMPUTATION(("<<>> %ld ", offset));
1219 _rot(val1, calc_buffer, offset, radius, sign);
1224 DEBUGPRINTF_COMPUTATION(("-> %s\n", sc_print_hex(calc_buffer)));
1226 if ((buffer != NULL) && (buffer != calc_buffer))
1228 memmove(buffer, calc_buffer, CALC_BUFFER_SIZE);
1232 int sc_comp(const void* value1, const void* value2)
1234 int counter = CALC_BUFFER_SIZE - 1;
1235 const char *val1 = (const char *)value1;
1236 const char *val2 = (const char *)value2;
1238 /* compare signs first:
1239 * the loop below can only compare values of the same sign! */
1240 if (_sign(val1) != _sign(val2)) return (_sign(val1) == 1)?(1):(-1);
1242 /* loop until two digits differ, the values are equal if there
1243 * are no such two digits */
1244 while (val1[counter] == val2[counter])
1247 if (counter < 0) return 0;
1250 /* the leftmost digit is the most significant, so this returns
1251 * the correct result.
1252 * This implies the digit enum is ordered */
1253 return (val1[counter] > val2[counter]) ? (1) : (-1);
1256 int sc_get_highest_set_bit(const void *value)
1258 const char *val = (const char*)value;
1261 high = CALC_BUFFER_SIZE * 4 - 1;
1263 for (counter = CALC_BUFFER_SIZE-1; counter >= 0; counter--) {
1264 if (val[counter] == SC_0) high -= 4;
1266 if (val[counter] > SC_7) return high;
1267 else if (val[counter] > SC_3) return high - 1;
1268 else if (val[counter] > SC_1) return high - 2;
1269 else return high - 3;
1275 int sc_get_lowest_set_bit(const void *value)
1277 const char *val = (const char*)value;
1281 sign = (_sign(val)==1)?(SC_0):(SC_F);
1284 for (counter = 0; counter < CALC_BUFFER_SIZE; counter++) {
1285 if (val[counter] == SC_0) low += 4;
1287 if (val[counter] < SC_2) return low;
1288 else if (val[counter] < SC_4) return low + 1;
1289 else if (val[counter] < SC_8) return low + 2;
1290 else return low + 3;
1296 int sc_is_zero(const void *value)
1298 const char* val = (const char *)value;
1301 for (counter = 0; counter < CALC_BUFFER_SIZE; counter++) {
1302 if (val[counter] != SC_0) return 0;
1307 int sc_is_negative(const void *value)
1309 return _sign(value) == -1;
1312 int sc_had_carry(void)
1317 unsigned char sc_sub_bits(const void *value, int len, unsigned byte_ofs)
1319 const char *val = (const char *)value;
1320 unsigned nibble_ofs = 2 * byte_ofs;
1323 /* the current scheme uses one byte to store a nibble */
1324 if (nibble_ofs >= len)
1327 res = _val(val[nibble_ofs]);
1328 if (len > nibble_ofs + 1)
1329 res |= _val(val[nibble_ofs + 1]) << 4;
1335 * convert to a string
1336 * XXX Doesn't check buffer bounds
1338 const char *sc_print(const void *value, unsigned bits, enum base_t base)
1340 static const char big_digits[] = "0123456789ABCDEF";
1341 static const char small_digits[] = "0123456789abcdef";
1343 char base_val[CALC_BUFFER_SIZE];
1344 char div1_res[CALC_BUFFER_SIZE];
1345 char div2_res[CALC_BUFFER_SIZE];
1346 char rem_res[CALC_BUFFER_SIZE];
1347 int counter, nibbles, i, sign;
1350 const char *val = (const char *)value;
1354 const char *digits = small_digits;
1356 pos = output_buffer + BIT_PATTERN_SIZE;
1361 bits = BIT_PATTERN_SIZE;
1362 #ifdef STRCALC_DEBUG_FULLPRINT
1366 nibbles = bits >> 2;
1370 digits = big_digits;
1372 for (counter = 0; counter < nibbles; ++counter) {
1373 *(--pos) = digits[_val(val[counter])];
1374 #ifdef STRCALC_DEBUG_GROUPPRINT
1375 if ((counter+1)%8 == 0)
1380 /* last nibble must be masked */
1382 x = and_table[_val(val[++counter])][bits & 3];
1383 *(--pos) = digits[_val(x)];
1386 /* now kill zeros */
1387 for (; counter > 1; --counter, ++pos) {
1388 #ifdef STRCALC_DEBUG_GROUPPRINT
1389 if (pos[0] == ' ') ++pos;
1397 for (counter = 0; counter < nibbles; ++counter) {
1399 p = binary_table[_val(val[counter])];
1406 /* last nibble must be masked */
1408 x = and_table[_val(val[++counter])][bits & 3];
1411 p = binary_table[_val(x)];
1418 /* now kill zeros */
1419 for (counter <<= 2; counter > 1; --counter, ++pos)
1426 memset(base_val, SC_0, CALC_BUFFER_SIZE);
1427 base_val[0] = base == SC_DEC ? SC_A : SC_8;
1431 if (base == SC_DEC) {
1432 /* check for negative values */
1433 if (_bit(val, bits - 1)) {
1434 _negate(val, div2_res);
1440 /* transfer data into oscilating buffers */
1441 memset(div1_res, SC_0, CALC_BUFFER_SIZE);
1442 for (counter = 0; counter < nibbles; ++counter)
1443 div1_res[counter] = p[counter];
1445 /* last nibble must be masked */
1449 div1_res[counter] = and_table[_val(p[counter])][bits & 3];
1455 _divmod(m, base_val, n, rem_res);
1459 *(--pos) = digits[_val(rem_res[0])];
1462 for (i = 0; i < sizeof(div1_res); ++i)
1473 printf("%i\n", base);
1480 void init_strcalc(int precision)
1482 if (calc_buffer == NULL) {
1483 if (precision <= 0) precision = SC_DEFAULT_PRECISION;
1485 /* round up to multiple of 4 */
1486 if (precision & 0x3) precision += 4 - (precision&0x3);
1488 BIT_PATTERN_SIZE = (precision);
1489 CALC_BUFFER_SIZE = (precision / 2);
1490 MAX_VALUE_SIZE = (precision / 4);
1492 calc_buffer = malloc(CALC_BUFFER_SIZE+1 * sizeof(char));
1493 output_buffer = malloc(BIT_PATTERN_SIZE+1 * sizeof(char));
1495 if (calc_buffer == NULL || output_buffer == NULL)
1497 assert(0 && "malloc failed");
1501 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));
1504 int sc_get_precision(void)
1506 return BIT_PATTERN_SIZE;