1 /****i* strcalc/implementation
12 #include <assert.h> /* assertions */
13 #include <string.h> /* memset/memcmp */
14 #include <stdio.h> /* output for error messages */
15 #include <limits.h> /* definition of LONG_MIN, used in sc_get_val_from_long */
18 * local definitions and macros
20 #define CLEAR_CALC_BUFFER() assert(calc_buffer); memset(calc_buffer, SC_0, CALC_BUFFER_SIZE)
21 #define _val(a) ((a)-SC_0)
22 #define _digit(a) ((a)+SC_0)
23 #define _bitisset(digit, pos) (and_table[_val(digit)][_val(shift_table[pos])] != SC_0)
25 #define fail_char(a, b, c, d) _fail_char((a), (b), (c), (d), __FILE__, __LINE__)
27 #ifdef STRCALC_DEBUG_COMPUTATION
28 # define DEBUGPRINTF_COMPUTATION(x) printf x
30 # define DEBUGPRINTF_COMPUTATION(x) ((void)0)
33 # define DEBUGPRINTF(x) printf x
35 # define DEBUGPRINTF(x) ((void)0)
43 static char *calc_buffer = NULL; /* buffer holding all results */
44 static char *output_buffer = NULL; /* buffer for output */
45 static int BIT_PATTERN_SIZE; /* maximum number of bits */
46 static int CALC_BUFFER_SIZE; /* size of internally stored values */
47 static int MAX_VALUE_SIZE; /* maximum size of values */
49 static int carry_flag; /* some computation set carry_flag: */
50 /* rightshift if bits were lost due to shifting */
51 /* division if there was a remainder */
53 static const char max_digit[4] = { SC_0, SC_1, SC_3, SC_7 };
54 static const char min_digit[4] = { SC_F, SC_E, SC_C, SC_8 };
56 static const char not_table[16] = { SC_F, SC_E, SC_D, SC_C, SC_B, SC_A, SC_9, SC_8,
57 SC_7, SC_6, SC_5, SC_4, SC_3, SC_2, SC_1, SC_0 };
59 static const char shift_table[4] = { SC_1, SC_2, SC_4, SC_8 };
61 static const char and_table[16][16] = {
62 { SC_0, SC_0, SC_0, SC_0, SC_0, SC_0, SC_0, SC_0,
63 SC_0, SC_0, SC_0, SC_0, SC_0, SC_0, SC_0, SC_0 },
65 { SC_0, SC_1, SC_0, SC_1, SC_0, SC_1, SC_0, SC_1,
66 SC_0, SC_1, SC_0, SC_1, SC_0, SC_1, SC_0, SC_1 },
68 { SC_0, SC_0, SC_2, SC_2, SC_0, SC_0, SC_2, SC_2,
69 SC_0, SC_0, SC_2, SC_2, SC_0, SC_0, SC_2, SC_2 },
71 { SC_0, SC_1, SC_2, SC_3, SC_0, SC_1, SC_2, SC_3,
72 SC_0, SC_1, SC_2, SC_3, SC_0, SC_1, SC_2, SC_3 },
74 { SC_0, SC_0, SC_0, SC_0, SC_4, SC_4, SC_4, SC_4,
75 SC_0, SC_0, SC_0, SC_0, SC_4, SC_4, SC_4, SC_4 },
77 { SC_0, SC_1, SC_0, SC_1, SC_4, SC_5, SC_4, SC_5,
78 SC_0, SC_1, SC_0, SC_1, SC_4, SC_5, SC_4, SC_5 },
80 { SC_0, SC_0, SC_2, SC_2, SC_4, SC_4, SC_6, SC_6,
81 SC_0, SC_0, SC_2, SC_2, SC_4, SC_4, SC_6, SC_6 },
83 { SC_0, SC_1, SC_2, SC_3, SC_4, SC_5, SC_6, SC_7,
84 SC_0, SC_1, SC_2, SC_3, SC_4, SC_5, SC_6, SC_7 },
86 { SC_0, SC_0, SC_0, SC_0, SC_0, SC_0, SC_0, SC_0,
87 SC_8, SC_8, SC_8, SC_8, SC_8, SC_8, SC_8, SC_8 },
89 { SC_0, SC_1, SC_0, SC_1, SC_0, SC_1, SC_0, SC_1,
90 SC_8, SC_9, SC_8, SC_9, SC_8, SC_9, SC_8, SC_9 },
92 { SC_0, SC_0, SC_2, SC_2, SC_0, SC_0, SC_2, SC_2,
93 SC_8, SC_8, SC_A, SC_A, SC_8, SC_8, SC_A, SC_A },
95 { SC_0, SC_1, SC_2, SC_3, SC_0, SC_1, SC_2, SC_3,
96 SC_8, SC_9, SC_A, SC_B, SC_8, SC_9, SC_A, SC_B },
98 { SC_0, SC_0, SC_0, SC_0, SC_4, SC_4, SC_4, SC_4,
99 SC_8, SC_8, SC_8, SC_8, SC_C, SC_C, SC_C, SC_C },
101 { SC_0, SC_1, SC_0, SC_1, SC_4, SC_5, SC_4, SC_5,
102 SC_8, SC_9, SC_8, SC_9, SC_C, SC_D, SC_C, SC_D },
104 { SC_0, SC_0, SC_2, SC_2, SC_4, SC_4, SC_6, SC_6,
105 SC_8, SC_8, SC_A, SC_A, SC_C, SC_C, SC_E, SC_E },
107 { SC_0, SC_1, SC_2, SC_3, SC_4, SC_5, SC_6, SC_7,
108 SC_8, SC_9, SC_A, SC_B, SC_C, SC_D, SC_E, SC_F } };
110 static const char or_table[16][16] = {
111 { SC_0, SC_1, SC_2, SC_3, SC_4, SC_5, SC_6, SC_7,
112 SC_8, SC_9, SC_A, SC_B, SC_C, SC_D, SC_E, SC_F },
114 { SC_1, SC_1, SC_3, SC_3, SC_5, SC_5, SC_7, SC_7,
115 SC_9, SC_9, SC_B, SC_B, SC_D, SC_D, SC_F, SC_F },
117 { SC_2, SC_3, SC_2, SC_3, SC_6, SC_7, SC_6, SC_7,
118 SC_A, SC_B, SC_A, SC_B, SC_E, SC_F, SC_E, SC_F },
120 { SC_3, SC_3, SC_3, SC_3, SC_7, SC_7, SC_7, SC_7,
121 SC_B, SC_B, SC_B, SC_B, SC_F, SC_F, SC_F, SC_F },
123 { SC_4, SC_5, SC_6, SC_7, SC_4, SC_5, SC_6, SC_7,
124 SC_C, SC_D, SC_E, SC_F, SC_C, SC_D, SC_E, SC_F },
126 { SC_5, SC_5, SC_7, SC_7, SC_5, SC_5, SC_7, SC_7,
127 SC_D, SC_D, SC_F, SC_F, SC_D, SC_D, SC_F, SC_F },
129 { SC_6, SC_7, SC_6, SC_7, SC_6, SC_7, SC_6, SC_7,
130 SC_E, SC_F, SC_E, SC_F, SC_E, SC_F, SC_E, SC_F },
132 { SC_7, SC_7, SC_7, SC_7, SC_7, SC_7, SC_7, SC_7,
133 SC_F, SC_F, SC_F, SC_F, SC_F, SC_F, SC_F, SC_F },
135 { SC_8, SC_9, SC_A, SC_B, SC_C, SC_D, SC_E, SC_F,
136 SC_8, SC_9, SC_A, SC_B, SC_C, SC_D, SC_E, SC_F },
138 { SC_9, SC_9, SC_B, SC_B, SC_D, SC_D, SC_F, SC_F,
139 SC_9, SC_9, SC_B, SC_B, SC_D, SC_D, SC_F, SC_F },
141 { SC_A, SC_B, SC_A, SC_B, SC_E, SC_F, SC_E, SC_F,
142 SC_A, SC_B, SC_A, SC_B, SC_E, SC_F, SC_E, SC_F },
144 { SC_B, SC_B, SC_B, SC_B, SC_F, SC_F, SC_F, SC_F,
145 SC_B, SC_B, SC_B, SC_B, SC_F, SC_F, SC_F, SC_F },
147 { SC_C, SC_D, SC_E, SC_F, SC_C, SC_D, SC_E, SC_F,
148 SC_C, SC_D, SC_E, SC_F, SC_C, SC_D, SC_E, SC_F },
150 { SC_D, SC_D, SC_F, SC_F, SC_D, SC_D, SC_F, SC_F,
151 SC_D, SC_D, SC_F, SC_F, SC_D, SC_D, SC_F, SC_F },
153 { SC_E, SC_F, SC_E, SC_F, SC_E, SC_F, SC_E, SC_F,
154 SC_E, SC_F, SC_E, SC_F, SC_E, SC_F, SC_E, SC_F },
156 { SC_F, SC_F, SC_F, SC_F, SC_F, SC_F, SC_F, SC_F,
157 SC_F, SC_F, SC_F, SC_F, SC_F, SC_F, SC_F, SC_F } };
159 static char const xor_table[16][16] = {
160 { SC_0, SC_1, SC_2, SC_3, SC_4, SC_5, SC_6, SC_7,
161 SC_8, SC_9, SC_A, SC_B, SC_C, SC_D, SC_E, SC_F },
163 { SC_1, SC_0, SC_3, SC_2, SC_5, SC_4, SC_7, SC_6,
164 SC_9, SC_8, SC_B, SC_A, SC_D, SC_C, SC_F, SC_E },
166 { SC_2, SC_3, SC_0, SC_1, SC_6, SC_7, SC_4, SC_5,
167 SC_A, SC_B, SC_8, SC_9, SC_E, SC_F, SC_C, SC_D },
169 { SC_3, SC_2, SC_1, SC_0, SC_7, SC_6, SC_5, SC_4,
170 SC_B, SC_A, SC_9, SC_8, SC_F, SC_E, SC_D, SC_C },
172 { SC_4, SC_5, SC_6, SC_7, SC_0, SC_1, SC_2, SC_3,
173 SC_C, SC_D, SC_E, SC_F, SC_8, SC_9, SC_A, SC_B },
175 { SC_5, SC_4, SC_7, SC_6, SC_1, SC_0, SC_3, SC_2,
176 SC_D, SC_C, SC_F, SC_E, SC_9, SC_8, SC_B, SC_A },
178 { SC_6, SC_7, SC_4, SC_5, SC_2, SC_3, SC_0, SC_1,
179 SC_E, SC_F, SC_C, SC_D, SC_A, SC_B, SC_8, SC_9 },
181 { SC_7, SC_6, SC_5, SC_4, SC_3, SC_2, SC_1, SC_0,
182 SC_F, SC_E, SC_D, SC_C, SC_B, SC_A, SC_9, SC_8 },
184 { SC_8, SC_9, SC_A, SC_B, SC_C, SC_D, SC_E, SC_F,
185 SC_0, SC_1, SC_2, SC_3, SC_4, SC_5, SC_6, SC_7 },
187 { SC_9, SC_8, SC_B, SC_A, SC_D, SC_C, SC_F, SC_E,
188 SC_1, SC_0, SC_3, SC_2, SC_5, SC_4, SC_7, SC_6 },
190 { SC_A, SC_B, SC_8, SC_9, SC_E, SC_F, SC_C, SC_D,
191 SC_2, SC_3, SC_0, SC_1, SC_6, SC_7, SC_4, SC_5 },
193 { SC_B, SC_A, SC_9, SC_8, SC_F, SC_E, SC_D, SC_C,
194 SC_3, SC_2, SC_1, SC_0, SC_7, SC_6, SC_5, SC_4 },
196 { SC_C, SC_D, SC_E, SC_F, SC_8, SC_9, SC_A, SC_B,
197 SC_4, SC_5, SC_6, SC_7, SC_0, SC_1, SC_2, SC_3 },
199 { SC_D, SC_C, SC_F, SC_E, SC_9, SC_8, SC_B, SC_A,
200 SC_5, SC_4, SC_7, SC_6, SC_1, SC_0, SC_3, SC_2 },
202 { SC_E, SC_F, SC_C, SC_D, SC_A, SC_B, SC_8, SC_9,
203 SC_6, SC_7, SC_4, SC_5, SC_2, SC_3, SC_0, SC_1 },
205 { SC_F, SC_E, SC_D, SC_C, SC_B, SC_A, SC_9, SC_8,
206 SC_7, SC_6, SC_5, SC_4, SC_3, SC_2, SC_1, SC_0 }
209 static char const add_table[16][16][2] = {
210 { {SC_0, SC_0}, {SC_1, SC_0}, {SC_2, SC_0}, {SC_3, SC_0},
211 {SC_4, SC_0}, {SC_5, SC_0}, {SC_6, SC_0}, {SC_7, SC_0},
212 {SC_8, SC_0}, {SC_9, SC_0}, {SC_A, SC_0}, {SC_B, SC_0},
213 {SC_C, SC_0}, {SC_D, SC_0}, {SC_E, SC_0}, {SC_F, SC_0} },
215 { {SC_1, SC_0}, {SC_2, SC_0}, {SC_3, SC_0}, {SC_4, SC_0},
216 {SC_5, SC_0}, {SC_6, SC_0}, {SC_7, SC_0}, {SC_8, SC_0},
217 {SC_9, SC_0}, {SC_A, SC_0}, {SC_B, SC_0}, {SC_C, SC_0},
218 {SC_D, SC_0}, {SC_E, SC_0}, {SC_F, SC_0}, {SC_0, SC_1} },
220 { {SC_2, SC_0}, {SC_3, SC_0}, {SC_4, SC_0}, {SC_5, SC_0},
221 {SC_6, SC_0}, {SC_7, SC_0}, {SC_8, SC_0}, {SC_9, SC_0},
222 {SC_A, SC_0}, {SC_B, SC_0}, {SC_C, SC_0}, {SC_D, SC_0},
223 {SC_E, SC_0}, {SC_F, SC_0}, {SC_0, SC_1}, {SC_1, SC_1} },
225 { {SC_3, SC_0}, {SC_4, SC_0}, {SC_5, SC_0}, {SC_6, SC_0},
226 {SC_7, SC_0}, {SC_8, SC_0}, {SC_9, SC_0}, {SC_A, SC_0},
227 {SC_B, SC_0}, {SC_C, SC_0}, {SC_D, SC_0}, {SC_E, SC_0},
228 {SC_F, SC_0}, {SC_0, SC_1}, {SC_1, SC_1}, {SC_2, SC_1} },
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},
233 {SC_0, SC_1}, {SC_1, SC_1}, {SC_2, SC_1}, {SC_3, SC_1} },
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},
238 {SC_1, SC_1}, {SC_2, SC_1}, {SC_3, SC_1}, {SC_4, SC_1} },
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},
243 {SC_2, SC_1}, {SC_3, SC_1}, {SC_4, SC_1}, {SC_5, SC_1} },
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},
248 {SC_3, SC_1}, {SC_4, SC_1}, {SC_5, SC_1}, {SC_6, SC_1} },
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},
253 {SC_4, SC_1}, {SC_5, SC_1}, {SC_6, SC_1}, {SC_7, SC_1} },
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},
258 {SC_5, SC_1}, {SC_6, SC_1}, {SC_7, SC_1}, {SC_8, SC_1} },
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},
263 {SC_6, SC_1}, {SC_7, SC_1}, {SC_8, SC_1}, {SC_9, SC_1} },
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},
268 {SC_7, SC_1}, {SC_8, SC_1}, {SC_9, SC_1}, {SC_A, SC_1} },
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},
273 {SC_8, SC_1}, {SC_9, SC_1}, {SC_A, SC_1}, {SC_B, SC_1} },
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},
278 {SC_9, SC_1}, {SC_A, SC_1}, {SC_B, SC_1}, {SC_C, SC_1} },
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},
283 {SC_A, SC_1}, {SC_B, SC_1}, {SC_C, SC_1}, {SC_D, SC_1} },
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},
288 {SC_B, SC_1}, {SC_C, SC_1}, {SC_D, SC_1}, {SC_E, SC_1} }
291 static char const mul_table[16][16][2] = {
292 { {SC_0, SC_0}, {SC_0, SC_0}, {SC_0, SC_0}, {SC_0, SC_0},
293 {SC_0, SC_0}, {SC_0, SC_0}, {SC_0, SC_0}, {SC_0, SC_0},
294 {SC_0, SC_0}, {SC_0, SC_0}, {SC_0, SC_0}, {SC_0, SC_0},
295 {SC_0, SC_0}, {SC_0, SC_0}, {SC_0, SC_0}, {SC_0, SC_0} },
297 { {SC_0, SC_0}, {SC_1, SC_0}, {SC_2, SC_0}, {SC_3, SC_0},
298 {SC_4, SC_0}, {SC_5, SC_0}, {SC_6, SC_0}, {SC_7, SC_0},
299 {SC_8, SC_0}, {SC_9, SC_0}, {SC_A, SC_0}, {SC_B, SC_0},
300 {SC_C, SC_0}, {SC_D, SC_0}, {SC_E, SC_0}, {SC_F, SC_0} },
302 { {SC_0, SC_0}, {SC_2, SC_0}, {SC_4, SC_0}, {SC_6, SC_0},
303 {SC_8, SC_0}, {SC_A, SC_0}, {SC_C, SC_0}, {SC_E, SC_0},
304 {SC_0, SC_1}, {SC_2, SC_1}, {SC_4, SC_1}, {SC_6, SC_1},
305 {SC_8, SC_1}, {SC_A, SC_1}, {SC_C, SC_1}, {SC_E, SC_1} },
307 { {SC_0, SC_0}, {SC_3, SC_0}, {SC_6, SC_0}, {SC_9, SC_0},
308 {SC_C, SC_0}, {SC_F, SC_0}, {SC_2, SC_1}, {SC_5, SC_1},
309 {SC_8, SC_1}, {SC_B, SC_1}, {SC_E, SC_1}, {SC_1, SC_2},
310 {SC_4, SC_2}, {SC_7, SC_2}, {SC_A, SC_2}, {SC_D, SC_2} },
312 { {SC_0, SC_0}, {SC_4, SC_0}, {SC_8, SC_0}, {SC_C, SC_0},
313 {SC_0, SC_1}, {SC_4, SC_1}, {SC_8, SC_1}, {SC_C, SC_1},
314 {SC_0, SC_2}, {SC_4, SC_2}, {SC_8, SC_2}, {SC_C, SC_2},
315 {SC_0, SC_3}, {SC_4, SC_3}, {SC_8, SC_3}, {SC_C, SC_3} },
317 { {SC_0, SC_0}, {SC_5, SC_0}, {SC_A, SC_0}, {SC_F, SC_0},
318 {SC_4, SC_1}, {SC_9, SC_1}, {SC_E, SC_1}, {SC_3, SC_2},
319 {SC_8, SC_2}, {SC_D, SC_2}, {SC_2, SC_3}, {SC_7, SC_3},
320 {SC_C, SC_3}, {SC_1, SC_4}, {SC_6, SC_4}, {SC_B, SC_4} },
322 { {SC_0, SC_0}, {SC_6, SC_0}, {SC_C, SC_0}, {SC_2, SC_1},
323 {SC_8, SC_1}, {SC_E, SC_1}, {SC_4, SC_2}, {SC_A, SC_2},
324 {SC_0, SC_3}, {SC_6, SC_3}, {SC_C, SC_3}, {SC_2, SC_4},
325 {SC_8, SC_4}, {SC_E, SC_4}, {SC_4, SC_5}, {SC_A, SC_5} },
327 { {SC_0, SC_0}, {SC_7, SC_0}, {SC_E, SC_0}, {SC_5, SC_1},
328 {SC_C, SC_1}, {SC_3, SC_2}, {SC_A, SC_2}, {SC_1, SC_3},
329 {SC_8, SC_3}, {SC_F, SC_3}, {SC_6, SC_4}, {SC_D, SC_4},
330 {SC_4, SC_5}, {SC_B, SC_5}, {SC_2, SC_6}, {SC_9, SC_6} },
332 { {SC_0, SC_0}, {SC_8, SC_0}, {SC_0, SC_1}, {SC_8, SC_1},
333 {SC_0, SC_2}, {SC_8, SC_2}, {SC_0, SC_3}, {SC_8, SC_3},
334 {SC_0, SC_4}, {SC_8, SC_4}, {SC_0, SC_5}, {SC_8, SC_5},
335 {SC_0, SC_6}, {SC_8, SC_6}, {SC_0, SC_7}, {SC_8, SC_7} },
337 { {SC_0, SC_0}, {SC_9, SC_0}, {SC_2, SC_1}, {SC_B, SC_1},
338 {SC_4, SC_2}, {SC_D, SC_2}, {SC_6, SC_3}, {SC_F, SC_3},
339 {SC_8, SC_4}, {SC_1, SC_5}, {SC_A, SC_5}, {SC_3, SC_6},
340 {SC_C, SC_6}, {SC_5, SC_7}, {SC_E, SC_7}, {SC_7, SC_8} },
342 { {SC_0, SC_0}, {SC_A, SC_0}, {SC_4, SC_1}, {SC_E, SC_1},
343 {SC_8, SC_2}, {SC_2, SC_3}, {SC_C, SC_3}, {SC_6, SC_4},
344 {SC_0, SC_5}, {SC_A, SC_5}, {SC_4, SC_6}, {SC_E, SC_6},
345 {SC_8, SC_7}, {SC_2, SC_8}, {SC_C, SC_8}, {SC_6, SC_9} },
347 { {SC_0, SC_0}, {SC_B, SC_0}, {SC_6, SC_1}, {SC_1, SC_2},
348 {SC_C, SC_2}, {SC_7, SC_3}, {SC_2, SC_4}, {SC_D, SC_4},
349 {SC_8, SC_5}, {SC_3, SC_6}, {SC_E, SC_6}, {SC_9, SC_7},
350 {SC_4, SC_8}, {SC_F, SC_8}, {SC_A, SC_9}, {SC_5, SC_A} },
352 { {SC_0, SC_0}, {SC_C, SC_0}, {SC_8, SC_1}, {SC_4, SC_2},
353 {SC_0, SC_3}, {SC_C, SC_3}, {SC_8, SC_4}, {SC_4, SC_5},
354 {SC_0, SC_6}, {SC_C, SC_6}, {SC_8, SC_7}, {SC_4, SC_8},
355 {SC_0, SC_9}, {SC_C, SC_9}, {SC_8, SC_A}, {SC_4, SC_B} },
357 { {SC_0, SC_0}, {SC_D, SC_0}, {SC_A, SC_1}, {SC_7, SC_2},
358 {SC_4, SC_3}, {SC_1, SC_4}, {SC_E, SC_4}, {SC_B, SC_5},
359 {SC_8, SC_6}, {SC_5, SC_7}, {SC_2, SC_8}, {SC_F, SC_8},
360 {SC_C, SC_9}, {SC_9, SC_A}, {SC_6, SC_B}, {SC_3, SC_C} },
362 { {SC_0, SC_0}, {SC_E, SC_0}, {SC_C, SC_1}, {SC_A, SC_2},
363 {SC_8, SC_3}, {SC_6, SC_4}, {SC_4, SC_5}, {SC_2, SC_6},
364 {SC_0, SC_7}, {SC_E, SC_7}, {SC_C, SC_8}, {SC_A, SC_9},
365 {SC_8, SC_A}, {SC_6, SC_B}, {SC_4, SC_C}, {SC_2, SC_D} },
367 { {SC_0, SC_0}, {SC_F, SC_0}, {SC_E, SC_1}, {SC_D, SC_2},
368 {SC_C, SC_3}, {SC_B, SC_4}, {SC_A, SC_5}, {SC_9, SC_6},
369 {SC_8, SC_7}, {SC_7, SC_8}, {SC_6, SC_9}, {SC_5, SC_A},
370 {SC_4, SC_B}, {SC_3, SC_C}, {SC_2, SC_D}, {SC_1, SC_E} }
373 static char const shrs_table[16][4][2] = {
374 { {SC_0, SC_0}, {SC_0, SC_0}, {SC_0, SC_0}, {SC_0, SC_0} },
375 { {SC_1, SC_0}, {SC_0, SC_8}, {SC_0, SC_4}, {SC_0, SC_2} },
376 { {SC_2, SC_0}, {SC_1, SC_0}, {SC_0, SC_8}, {SC_0, SC_4} },
377 { {SC_3, SC_0}, {SC_1, SC_8}, {SC_0, SC_C}, {SC_0, SC_6} },
378 { {SC_4, SC_0}, {SC_2, SC_0}, {SC_1, SC_0}, {SC_0, SC_8} },
379 { {SC_5, SC_0}, {SC_2, SC_8}, {SC_1, SC_4}, {SC_0, SC_A} },
380 { {SC_6, SC_0}, {SC_3, SC_0}, {SC_1, SC_8}, {SC_0, SC_C} },
381 { {SC_7, SC_0}, {SC_3, SC_8}, {SC_1, SC_C}, {SC_0, SC_E} },
382 { {SC_8, SC_0}, {SC_4, SC_0}, {SC_2, SC_0}, {SC_1, SC_0} },
383 { {SC_9, SC_0}, {SC_4, SC_8}, {SC_2, SC_4}, {SC_1, SC_2} },
384 { {SC_A, SC_0}, {SC_5, SC_0}, {SC_2, SC_8}, {SC_1, SC_4} },
385 { {SC_B, SC_0}, {SC_5, SC_8}, {SC_2, SC_C}, {SC_1, SC_6} },
386 { {SC_C, SC_0}, {SC_6, SC_0}, {SC_3, SC_0}, {SC_1, SC_8} },
387 { {SC_D, SC_0}, {SC_6, SC_8}, {SC_3, SC_4}, {SC_1, SC_A} },
388 { {SC_E, SC_0}, {SC_7, SC_0}, {SC_3, SC_8}, {SC_1, SC_C} },
389 { {SC_F, SC_0}, {SC_7, SC_8}, {SC_3, SC_C}, {SC_1, SC_E} }
392 /* for converting to binary string */
393 static const char *binary_table[16] = {
394 "0000", "0001", "0010", "0011", "0100", "0101", "0110", "0111",
395 "1000", "1001", "1010", "1011", "1100", "1101", "1110", "1111"
398 /*****************************************************************************
400 *****************************************************************************/
401 static void _fail_char(const char *str, size_t len, const char fchar, int pos,
402 const char *file, int line)
405 printf("Unexpected character '%c' in %s:%d\n", fchar, file, line);
406 while (len-- && *str) printf("%c", *str++); printf("\n");
407 while (--pos) printf(" "); printf("^\n");
411 static void _bitnot(const char *val, char *buffer)
415 for (counter = 0; counter<CALC_BUFFER_SIZE; counter++)
416 buffer[counter] = not_table[_val(val[counter])];
419 static void _bitor(const char *val1, const char *val2, char *buffer)
423 for (counter = 0; counter<CALC_BUFFER_SIZE; counter++)
424 buffer[counter] = or_table[_val(val1[counter])][_val(val2[counter])];
427 static void _bitxor(const char *val1, const char *val2, char *buffer)
431 for (counter = 0; counter<CALC_BUFFER_SIZE; counter++)
432 buffer[counter] = xor_table[_val(val1[counter])][_val(val2[counter])];
435 static void _bitand(const char *val1, const char *val2, char *buffer)
439 for (counter = 0; counter<CALC_BUFFER_SIZE; counter++)
440 buffer[counter] = and_table[_val(val1[counter])][_val(val2[counter])];
443 static int _sign(const char *val)
445 return (val[CALC_BUFFER_SIZE-1] <= SC_7) ? (1) : (-1);
449 * returns non-zero if bit at position pos is set
451 static int _bit(const char *val, int pos)
454 int nibble = pos >> 2;
456 return _bitisset(val[nibble], bit);
459 static void _inc(char *val, char *buffer)
463 while (counter++ < CALC_BUFFER_SIZE)
472 /* No carry here, *val != SC_F */
473 *buffer = add_table[_val(*val)][SC_1][0];
477 /* here a carry could be lost, this is intended because this should
478 * happen only when a value changes sign. */
481 static void _negate(const char *val, char *buffer)
483 _bitnot(val, buffer);
484 _inc(buffer, buffer);
487 static void _add(const char *val1, const char *val2, char *buffer)
490 const char *add1, *add2;
493 for (counter = 0; counter < CALC_BUFFER_SIZE; counter++)
495 add1 = add_table[_val(val1[counter])][_val(val2[counter])];
496 add2 = add_table[_val(add1[0])][_val(carry)];
497 /* carry might be zero */
498 buffer[counter] = add2[0];
499 carry = add_table[_val(add1[1])][_val(add2[1])][0];
503 static void _mul(const char *val1, const char *val2, char *buffer)
505 char temp_buffer[CALC_BUFFER_SIZE]; /* result buffer */
506 char neg_val1[CALC_BUFFER_SIZE]; /* abs of val1 */
507 char neg_val2[CALC_BUFFER_SIZE]; /* abs of val2 */
509 const char *mul, *add1, *add2; /* intermediate result containers */
510 char carry = SC_0; /* container for carries */
511 char sign = 0; /* marks result sign */
512 int c_inner, c_outer; /* loop counters */
514 /* init result buffer to zeroes */
515 memset(temp_buffer, SC_0, CALC_BUFFER_SIZE);
517 /* the multiplication works only for positive values, for negative values *
518 * it is necessary to negate them and adjust the result accordingly */
519 if (_sign(val1) == -1) {
520 _negate(val1, neg_val1);
524 if (_sign(val2) == -1) {
525 _negate(val2, neg_val2);
530 for (c_outer = 0; c_outer < MAX_VALUE_SIZE; c_outer++)
532 if (val2[c_outer] != SC_0)
534 for (c_inner = 0; c_inner < MAX_VALUE_SIZE; c_inner++)
536 /* do the following calculation: *
537 * Add the current carry, the value at position c_outer+c_inner *
538 * and the result of the multiplication of val1[c_inner] and *
539 * val2[c_outer]. This is the usual pen-and-paper multiplication. */
541 /* multiplicate the two digits */
542 mul = mul_table[_val(val1[c_inner])][_val(val2[c_outer])];
543 /* add old value to result of multiplication */
544 add1 = add_table[_val(temp_buffer[c_inner + c_outer])][_val(mul[0])];
545 /* add carry to the sum */
546 add2 = add_table[_val(add1[0])][_val(carry)];
548 /* all carries together result in new carry. This is always smaller *
550 * Both multiplicands, the carry and the value already in the temp *
551 * buffer are single digits and their value is therefore at most *
554 * (b-1)(b-1)+(b-1)+(b-1) = b*b-1 *
555 * The tables list all operations rem b, so the carry is at most *
556 * (b*b-1)rem b = -1rem b = b-1 */
557 carry = add_table[_val(mul[1])][_val(add1[1])][0];
558 carry = add_table[_val(carry)][_val(add2[1])][0];
560 temp_buffer[c_inner + c_outer] = add2[0];
563 /* A carry may hang over */
564 /* c_outer is always smaller than MAX_VALUE_SIZE! */
565 temp_buffer[MAX_VALUE_SIZE + c_outer] = carry;
571 _negate(temp_buffer, buffer);
573 memcpy(buffer, temp_buffer, CALC_BUFFER_SIZE);
576 static void _sub(const char *val1, const char *val2, char *buffer)
578 char temp_buffer[CALC_BUFFER_SIZE]; /* intermediate buffer to hold -val2 */
580 _negate(val2, temp_buffer);
581 _add(val1, temp_buffer, buffer);
584 static void _push(const char digit, char *buffer)
588 for (counter = CALC_BUFFER_SIZE - 2; counter >= 0; counter--)
590 buffer[counter+1] = buffer[counter];
595 /* XXX: This is MOST slow */
596 static void _divmod(const char *dividend, const char *divisor, char *quot, char *rem)
598 const char *minus_divisor;
599 char neg_val1[CALC_BUFFER_SIZE];
600 char neg_val2[CALC_BUFFER_SIZE];
602 char sign = 0; /* remember result sign */
604 int c_dividend; /* loop counters */
606 /* clear result buffer */
607 memset(quot, SC_0, CALC_BUFFER_SIZE);
608 memset(rem, SC_0, CALC_BUFFER_SIZE);
610 /* if the divisor is zero this won't work (quot is zero) */
611 if (sc_comp(divisor, quot) == 0) assert(0 && "division by zero!");
613 /* if the dividend is zero result is zero (quot is zero)*/
614 if (sc_comp(dividend, quot) == 0)
617 if (_sign(dividend) == -1)
619 _negate(dividend, neg_val1);
624 _negate(divisor, neg_val2);
625 if (_sign(divisor) == -1)
628 minus_divisor = divisor;
633 minus_divisor = neg_val2;
636 /* if divisor >= dividend division is easy
637 * (remember these are absolute values) */
638 switch (sc_comp(dividend, divisor))
640 case 0: /* dividend == divisor */
644 case -1: /* dividend < divisor */
645 memcpy(rem, dividend, CALC_BUFFER_SIZE);
648 default: /* unluckily division is necessary :( */
652 for (c_dividend = CALC_BUFFER_SIZE - 1; c_dividend >= 0; c_dividend--)
654 _push(dividend[c_dividend], rem);
657 if (sc_comp(rem, divisor) != -1) /* remainder >= divisor */
659 /* subtract until the remainder becomes negative, this should
660 * be faster than comparing remainder with divisor */
661 _add(rem, minus_divisor, rem);
663 while (_sign(rem) == 1)
665 quot[0] = add_table[_val(quot[0])][SC_1][0];
666 _add(rem, minus_divisor, rem);
669 /* subtracted one too much */
670 _add(rem, divisor, rem);
674 carry_flag = !sc_is_zero(rem);
683 static void _shl(const char *val1, char *buffer, long offset, int radius, unsigned is_signed)
692 assert((offset >= 0) || (0 && "negative leftshift"));
693 assert(((_sign(val1) != -1) || is_signed) || (0 && "unsigned mode and negative value"));
694 assert(((!_bitisset(val1[(radius-1)/4], (radius-1)%4)) || !is_signed || (_sign(val1) == -1)) || (0 && "value is positive, should be negative"));
695 assert(((_bitisset(val1[(radius-1)/4], (radius-1)%4)) || !is_signed || (_sign(val1) == 1)) || (0 && "value is negative, should be positive"));
697 /* if shifting far enough the result is zero */
698 if (offset >= radius)
700 memset(buffer, SC_0, CALC_BUFFER_SIZE);
704 shift = shift_table[_val(offset%4)]; /* this is 2 ** (offset % 4) */
707 /* shift the single digits some bytes (offset) and some bits (table)
709 for (counter = 0; counter < radius/4 - offset; counter++)
711 shl = mul_table[_val(val1[counter])][_val(shift)];
712 buffer[counter + offset] = or_table[_val(shl[0])][_val(carry)];
717 shl = mul_table[_val(val1[counter])][_val(shift)];
718 buffer[counter + offset] = or_table[_val(shl[0])][_val(carry)];
721 bitoffset = counter - 1;
724 /* fill with zeroes */
725 for (counter = 0; counter < offset; counter++) buffer[counter] = SC_0;
727 /* if the mode was signed, change sign when the mode's msb is now 1 */
728 offset = bitoffset + offset;
729 bitoffset = (radius-1) % 4;
730 if (is_signed && _bitisset(buffer[offset], bitoffset))
732 /* this sets the upper bits of the leftmost digit */
733 buffer[offset] = or_table[_val(buffer[offset])][_val(min_digit[bitoffset])];
734 for (counter = offset+1; counter < CALC_BUFFER_SIZE; counter++)
736 buffer[counter] = SC_F;
739 else if (is_signed && !_bitisset(buffer[offset], bitoffset))
741 /* this unsets the upper bits of the leftmost digit */
742 buffer[offset] = and_table[_val(buffer[offset])][_val(max_digit[bitoffset])];
743 for (counter = offset+1; counter < CALC_BUFFER_SIZE; counter++)
745 buffer[counter] = SC_0;
750 static void _shr(const char *val1, char *buffer, long offset, int radius, unsigned is_signed, int signed_shift)
761 assert((offset >= 0) || (0 && "negative rightshift"));
762 assert(((_sign(val1) != -1) || is_signed) || (0 && "unsigned mode and negative value"));
763 assert(((!_bitisset(val1[(radius-1)/4], (radius-1)%4)) || !is_signed || (_sign(val1) == -1)) || (0 && "value is positive, should be negative"));
764 assert(((_bitisset(val1[(radius-1)/4], (radius-1)%4)) || !is_signed || (_sign(val1) == 1)) || (0 && "value is negative, should be positive"));
766 sign = ((signed_shift) && (_sign(val1) == -1))?(SC_F):(SC_0);
768 /* if shifting far enough the result is either 0 or -1 */
769 if (offset >= radius)
771 memset(buffer, sign, CALC_BUFFER_SIZE);
778 /* check if any bits are lost, and set carry_flag is so */
779 for (counter = 0; counter < offset; counter++)
781 if (val1[counter] != carry_flag)
787 if ((carry_flag == 0) && (_val(val1[counter]) & shift) != 0)
790 /* shift digits to the right with offset, carry and all */
792 if (radius/4 - offset > 0) {
793 buffer[counter] = shrs_table[_val(val1[offset])][shift][0];
796 for (; counter < radius/4 - offset; counter++)
798 shrs = shrs_table[_val(val1[counter + offset])][shift];
799 buffer[counter] = shrs[0];
800 buffer[counter-1] = or_table[_val(buffer[counter-1])][_val(shrs[1])];
803 /* the last digit is special in regard of signed/unsigned shift */
804 bitoffset = radius%4;
805 msd = (radius/4<CALC_BUFFER_SIZE)?(val1[radius/4]):(sign); /* most significant digit */
807 /* remove sign bits if mode was signed and this is an unsigned shift */
808 if (!signed_shift && is_signed) {
809 msd = and_table[_val(msd)][_val(max_digit[bitoffset])];
812 shrs = shrs_table[_val(msd)][shift];
814 /* signed shift and signed mode and negative value means all bits to the left are set */
815 if (signed_shift && is_signed && (_sign(val1) == -1)) {
816 buffer[counter] = or_table[_val(shrs[0])][_val(min_digit[bitoffset])];
818 buffer[counter] = shrs[0];
821 if (counter > 0) buffer[counter - 1] = or_table[_val(buffer[counter-1])][_val(shrs[1])];
823 /* fill with SC_F or SC_0 depending on sign */
824 for (counter++; counter < CALC_BUFFER_SIZE; counter++)
826 buffer[counter] = sign;
830 /* positive: low-order -> high order, negative other direction */
831 static void _rot(const char *val1, char *buffer, long offset, int radius, unsigned is_signed)
833 char temp1[CALC_BUFFER_SIZE];
834 char temp2[CALC_BUFFER_SIZE];
836 offset = offset % radius;
838 /* rotation by multiples of the typelength is identity */
840 memmove(buffer, val1, CALC_BUFFER_SIZE);
844 _shl(val1, temp1, offset, radius, is_signed);
845 _shr(val1, temp2, radius - offset, radius, is_signed, 0);
846 _bitor(temp1, temp2, buffer);
847 carry_flag = 0; /* set by shr, but due to rot this is false */
850 /*****************************************************************************
851 * public functions, declared in strcalc.h
852 *****************************************************************************/
853 const void *sc_get_buffer(void)
855 return (void*)calc_buffer;
858 const int sc_get_buffer_length(void)
860 return CALC_BUFFER_SIZE;
863 /* XXX doesn't check for overflows */
864 void sc_val_from_str(const char *str, unsigned int len)
866 const char *orig_str = str;
867 unsigned int orig_len = len;
870 char base[CALC_BUFFER_SIZE];
871 char val[CALC_BUFFER_SIZE];
873 /* verify valid pointers (not null) */
875 /* a string no characters long is an error */
879 memset(base, SC_0, CALC_BUFFER_SIZE);
880 memset(val, SC_0, CALC_BUFFER_SIZE);
882 /* strip leading spaces */
883 while ((len > 0) && (*str == ' ')) { len--; str++; }
885 /* if the first two characters are 0x or 0X -> hex
886 * if the first is a 0 -> oct
887 * else dec, strip leading -/+ and remember sign
889 * only a + or - sign is no number resulting in an error */
894 if (str[1] == 'x' || str[1] == 'X') /* hex */
898 base[1] = SC_1; base[0] = SC_0;
904 base[1] = SC_0; base[0] = SC_8;
912 base[1] = SC_0; base[0] = SC_A;
921 base[1] = SC_0; base[0] = SC_A;
925 default: /* dec, else would have begun with 0x or 0 */
926 base[1] = SC_0; base[0] = SC_A;
929 else /* dec, else would have begun with 0x or 0 */
931 base[1] = SC_0; base[0] = SC_A;
934 /* BEGIN string evaluation, from left to right */
945 if (base[0] > SC_9 || base[1] > SC_0) /* (base > 10) */
947 val[0] = _digit((*str)-'a'+10);
949 else fail_char(orig_str, orig_len, *str, str-orig_str+1);
958 if (base[0] > SC_9 || base[1] > SC_0) /* (base > 10) */
960 val[0] = _digit((*str)-'A'+10);
962 else fail_char(orig_str, orig_len, *str, str-orig_str+1);
967 if (base[0] > SC_7 || base[1] > SC_0) /* (base > 8) */
969 val[0] = _digit((*str)-'0');
971 else fail_char(orig_str, orig_len, *str, str-orig_str+1);
983 val[0] = _digit((*str)-'0');
988 fail_char(orig_str, orig_len, *str, str-orig_str+1);
991 /* Radix conversion from base b to base B:
992 * (UnUn-1...U1U0)b == ((((Un*b + Un-1)*b + ...)*b + U1)*b + U0)B */
993 _mul(base, calc_buffer, calc_buffer); /* multiply current value with base */
994 _add(val, calc_buffer, calc_buffer); /* add next digit to current value */
996 /* get ready for the next letter */
1000 } /* while (len > 0 ) */
1004 _negate(calc_buffer, calc_buffer);
1008 void sc_val_from_long(long value)
1011 char sign, is_minlong;
1015 is_minlong = value == LONG_MIN;
1017 /* use absolute value, special treatment of MIN_LONG */
1025 CLEAR_CALC_BUFFER();
1027 while ((value != 0) && (pos < calc_buffer + CALC_BUFFER_SIZE))
1029 *pos++ = _digit(value % 16);
1035 if (is_minlong) _inc(calc_buffer, calc_buffer);
1036 _negate(calc_buffer, calc_buffer);
1040 long sc_val_to_long(const void *val)
1045 for (i = CALC_BUFFER_SIZE - 1; i >= 0; i--)
1047 l = (l << 4) + _val(((char *)val)[i]);
1052 void sc_min_from_bits(unsigned int num_bits, unsigned int sign)
1057 CLEAR_CALC_BUFFER();
1058 if (!sign) return; /* unsigned means minimum is 0(zero) */
1062 bits = num_bits - 1;
1063 for (i = 0; i < bits/4; i++)
1066 *pos++ = min_digit[bits%4];
1068 for (i++; i <= CALC_BUFFER_SIZE - 1; i++)
1072 void sc_max_from_bits(unsigned int num_bits, unsigned int sign)
1077 CLEAR_CALC_BUFFER();
1080 bits = num_bits - sign;
1081 for (i = 0; i < bits/4; i++)
1084 *pos++ = max_digit[bits%4];
1086 for (i++; i <= CALC_BUFFER_SIZE - 1; i++)
1090 void sc_calc(const void* value1, const void* value2, unsigned op)
1092 char unused_res[CALC_BUFFER_SIZE]; /* temp buffer holding unused result of divmod */
1094 const char *val1 = (const char *)value1;
1095 const char *val2 = (const char *)value2;
1096 CLEAR_CALC_BUFFER();
1099 DEBUGPRINTF_COMPUTATION(("%s ", sc_print_hex(value1)));
1104 _negate(val1, calc_buffer);
1105 DEBUGPRINTF_COMPUTATION(("negated: %s\n", sc_print_hex(calc_buffer)));
1108 DEBUGPRINTF_COMPUTATION(("| "));
1109 _bitor(val1, val2, calc_buffer);
1112 DEBUGPRINTF_COMPUTATION(("& "));
1113 _bitand(val1, val2, calc_buffer);
1116 DEBUGPRINTF_COMPUTATION(("^ "));
1117 _bitxor(val1, val2, calc_buffer);
1120 _bitnot(val1, calc_buffer);
1121 DEBUGPRINTF_COMPUTATION(("bit-negated: %s\n", sc_print_hex(calc_buffer)));
1124 DEBUGPRINTF_COMPUTATION(("+ "));
1125 _add(val1, val2, calc_buffer);
1128 DEBUGPRINTF_COMPUTATION(("- "));
1129 _sub(val1, val2, calc_buffer);
1132 DEBUGPRINTF_COMPUTATION(("* "));
1133 _mul(val1, val2, calc_buffer);
1136 DEBUGPRINTF_COMPUTATION(("/ "));
1137 _divmod(val1, val2, calc_buffer, unused_res);
1140 DEBUGPRINTF_COMPUTATION(("%% "));
1141 _divmod(val1, val2, unused_res, calc_buffer);
1146 DEBUGPRINTF_COMPUTATION(("%s -> ", sc_print_hex(value2)));
1147 DEBUGPRINTF_COMPUTATION(("%s\n", sc_print_hex(calc_buffer)));
1150 void sc_bitcalc(const void* value1, const void* value2, int radius, int sign, unsigned op)
1152 const char *val1 = (const char *)value1;
1153 const char *val2 = (const char *)value2;
1157 offset = sc_val_to_long(val2);
1159 DEBUGPRINTF_COMPUTATION(("%s ", sc_print_hex(value1)));
1163 DEBUGPRINTF_COMPUTATION(("<< %d ", offset));
1164 _shl(val1, calc_buffer, offset, radius, sign);
1167 DEBUGPRINTF_COMPUTATION((">> %d ", offset));
1168 _shr(val1, calc_buffer, offset, radius, sign, 0);
1171 DEBUGPRINTF_COMPUTATION((">>> %d ", offset));
1172 _shr(val1, calc_buffer, offset, radius, sign, 1);
1175 DEBUGPRINTF_COMPUTATION(("<<>> %d ", offset));
1176 _rot(val1, calc_buffer, offset, radius, sign);
1181 DEBUGPRINTF_COMPUTATION(("-> %s\n", sc_print_hex(calc_buffer)));
1184 int sc_comp(const void* value1, const void* value2)
1186 int counter = CALC_BUFFER_SIZE - 1;
1187 const char *val1 = (const char *)value1;
1188 const char *val2 = (const char *)value2;
1190 /* compare signs first:
1191 * the loop below can only compare values of the same sign! */
1192 if (_sign(val1) != _sign(val2)) return (_sign(val1) == 1)?(1):(-1);
1194 /* loop until two digits differ, the values are equal if there
1195 * are no such two digits */
1196 while (val1[counter] == val2[counter])
1199 if (counter < 0) return 0;
1202 /* the leftmost digit is the most significant, so this returns
1203 * the correct result.
1204 * This implies the digit enum is ordered */
1205 return (val1[counter] > val2[counter]) ? (1) : (-1);
1208 int sc_get_highest_set_bit(const void *value)
1210 const char *val = (const char*)value;
1213 high = CALC_BUFFER_SIZE * 4;
1215 for (counter = CALC_BUFFER_SIZE-1; counter >= 0; counter--) {
1216 if (val[counter] == SC_0) high -= 4;
1218 if (val[counter] > SC_7) return high;
1219 else if (val[counter] > SC_3) return high - 1;
1220 else if (val[counter] > SC_1) return high - 2;
1221 else return high - 3;
1227 int sc_get_lowest_set_bit(const void *value)
1229 const char *val = (const char*)value;
1233 sign = (_sign(val)==1)?(SC_0):(SC_F);
1236 for (counter = 0; counter < CALC_BUFFER_SIZE; counter++) {
1237 if (val[counter] == SC_0) low += 4;
1239 if (val[counter] < SC_2) return low;
1240 else if (val[counter] < SC_4) return low + 1;
1241 else if (val[counter] < SC_8) return low + 2;
1242 else return low + 3;
1248 int sc_is_zero(const void *value)
1250 const char* val = (const char *)value;
1253 for (counter = 0; counter < CALC_BUFFER_SIZE; counter++) {
1254 if (val[counter] != SC_0) return 0;
1259 int sc_is_negative(const void *value)
1261 return _sign(value) == -1;
1264 int sc_had_carry(void)
1269 unsigned char sc_sub_bits(const void *value, int len, unsigned byte_ofs)
1271 const char *val = (const char *)value;
1272 unsigned nibble_ofs = 2 * byte_ofs;
1275 /* the current scheme uses one byte to store a nibble */
1276 if (nibble_ofs >= len)
1279 res = _val(val[nibble_ofs]);
1280 if (len > nibble_ofs + 1)
1281 res |= _val(val[nibble_ofs + 1]) << 4;
1287 * convert to a string
1288 * XXX Doesn't check buffer bounds
1290 const char *sc_print(const void *value, unsigned bits, enum base_t base)
1292 static const char big_digits[] = "0123456789ABCDEF";
1293 static const char small_digits[] = "0123456789abcdef";
1295 char base_val[CALC_BUFFER_SIZE];
1296 char div1_res[CALC_BUFFER_SIZE];
1297 char div2_res[CALC_BUFFER_SIZE];
1298 char rem_res[CALC_BUFFER_SIZE];
1299 int counter, nibbles, i, sign;
1302 const char *val = (const char *)value;
1306 const char *digits = small_digits;
1308 pos = output_buffer + BIT_PATTERN_SIZE ;
1313 bits = BIT_PATTERN_SIZE;
1314 #ifdef STRCALC_DEBUG_FULLPRINT
1318 nibbles = bits >> 2;
1322 digits = big_digits;
1324 for (counter = 0; counter < nibbles; ++counter) {
1325 *(--pos) = digits[_val(val[counter])];
1326 #ifdef STRCALC_DEBUG_GROUPPRINT
1327 if ((counter+1)%8 == 0)
1332 /* last nibble must be masked */
1334 x = and_table[_val(val[++counter])][bits & 3];
1335 *(--pos) = digits[_val(x)];
1338 /* now kill zeros */
1339 for (; counter > 1; --counter, ++pos) {
1340 #ifdef STRCALC_DEBUG_GROUPPRINT
1341 if (pos[0] == ' ') ++pos;
1349 for (counter = 0; counter < nibbles; ++counter) {
1351 p = binary_table[_val(val[counter])];
1358 /* last nibble must be masked */
1360 x = and_table[_val(val[++counter])][bits & 3];
1363 p = binary_table[_val(x)];
1370 /* now kill zeros */
1371 for (counter <<= 2; counter > 1; --counter, ++pos)
1378 memset(base_val, SC_0, CALC_BUFFER_SIZE);
1379 base_val[0] = base == SC_DEC ? SC_A : SC_8;
1383 if (base == SC_DEC) {
1384 /* check for negative values */
1385 if (_bit(val, bits - 1)) {
1386 _negate(val, div2_res);
1392 /* transfer data into oscilating buffers */
1393 memset(div1_res, SC_0, CALC_BUFFER_SIZE);
1394 for (counter = 0; counter < nibbles; ++counter)
1395 div1_res[counter] = p[counter];
1397 /* last nibble must be masked */
1401 div1_res[counter] = and_table[_val(p[counter])][bits & 3];
1407 _divmod(m, base_val, n, rem_res);
1411 *(--pos) = digits[_val(rem_res[0])];
1414 for (i = 0; i < sizeof(div1_res); ++i)
1431 void init_strcalc(int precision_in_bytes)
1433 if (calc_buffer == NULL) {
1434 if (precision_in_bytes <= 0) precision_in_bytes = DEFAULT_PRECISION_IN_BYTES;
1436 BIT_PATTERN_SIZE = (8 * precision_in_bytes);
1437 CALC_BUFFER_SIZE = (4 * precision_in_bytes);
1438 MAX_VALUE_SIZE = (2 * precision_in_bytes);
1440 calc_buffer = malloc(CALC_BUFFER_SIZE+1 * sizeof(char));
1441 output_buffer = malloc(BIT_PATTERN_SIZE+1 * sizeof(char));
1443 if (calc_buffer == NULL || output_buffer == NULL)
1445 assert(0 && "malloc failed");
1449 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));
1454 return CALC_BUFFER_SIZE/4;