2 * Copyright (C) 1995-2008 University of Karlsruhe. All right reserved.
4 * This file is part of libFirm.
6 * This file may be distributed and/or modified under the terms of the
7 * GNU General Public License version 2 as published by the Free Software
8 * Foundation and appearing in the file LICENSE.GPL included in the
9 * packaging of this file.
11 * Licensees holding valid libFirm Professional Edition licenses may use
12 * this file in accordance with the libFirm Commercial License.
13 * Agreement provided with the Software.
15 * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
16 * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR
22 * @brief Provides basic mathematical operations on values represented as strings.
24 * @author Mathias Heil
36 # include <string.h> /* memset/memcmp */
38 #include <assert.h> /* assertions */
39 #include <stdio.h> /* output for error messages */
40 #include <limits.h> /* definition of LONG_MIN, used in sc_get_val_from_long */
47 * local definitions and macros
49 #define CLEAR_BUFFER(b) assert(b); memset(b, SC_0, calc_buffer_size)
50 #define _val(a) ((a)-SC_0)
51 #define _digit(a) ((a)+SC_0)
52 #define _bitisset(digit, pos) (and_table[_val(digit)][_val(shift_table[pos])] != SC_0)
54 #define fail_char(a, b, c, d) _fail_char((a), (b), (c), (d), __FILE__, __LINE__)
56 /* shortcut output for debugging */
57 # define sc_print_hex(a) sc_print((a), 0, SC_HEX, 0)
58 # define sc_print_dec(a) sc_print((a), 0, SC_DEC, 1)
59 # define sc_print_oct(a) sc_print((a), 0, SC_OCT, 0)
60 # define sc_print_bin(a) sc_print((a), 0, SC_BIN, 0)
62 #ifdef STRCALC_DEBUG_PRINTCOMP
63 # define DEBUGPRINTF_COMPUTATION(x) printf x
65 # define DEBUGPRINTF_COMPUTATION(x) ((void)0)
68 # define DEBUGPRINTF(x) printf x
70 # define DEBUGPRINTF(x) ((void)0)
77 static char *calc_buffer = NULL; /* buffer holding all results */
78 static char *output_buffer = NULL; /* buffer for output */
79 static int bit_pattern_size; /* maximum number of bits */
80 static int calc_buffer_size; /* size of internally stored values */
81 static int max_value_size; /* maximum size of values */
83 static int carry_flag; /**< some computation set the carry_flag:
84 - right shift if bits were lost due to shifting
85 - division if there was a remainder
86 However, the meaning of carry is machine dependent
87 and often defined in other ways! */
89 static const char sex_digit[4] = { SC_E, SC_C, SC_8, SC_0 };
90 static const char zex_digit[4] = { SC_1, SC_3, SC_7, SC_F };
91 static const char max_digit[4] = { SC_0, SC_1, SC_3, SC_7 };
92 static const char min_digit[4] = { SC_F, SC_E, SC_C, SC_8 };
94 static const char not_table[16] = { SC_F, SC_E, SC_D, SC_C, SC_B, SC_A, SC_9, SC_8,
95 SC_7, SC_6, SC_5, SC_4, SC_3, SC_2, SC_1, SC_0 };
97 static const char shift_table[4] = { SC_1, SC_2, SC_4, SC_8 };
99 static const char and_table[16][16] = {
100 { SC_0, SC_0, SC_0, SC_0, SC_0, SC_0, SC_0, SC_0,
101 SC_0, SC_0, SC_0, SC_0, SC_0, SC_0, SC_0, SC_0 },
103 { SC_0, SC_1, SC_0, SC_1, SC_0, SC_1, SC_0, SC_1,
104 SC_0, SC_1, SC_0, SC_1, SC_0, SC_1, SC_0, SC_1 },
106 { SC_0, SC_0, SC_2, SC_2, SC_0, SC_0, SC_2, SC_2,
107 SC_0, SC_0, SC_2, SC_2, SC_0, SC_0, SC_2, SC_2 },
109 { SC_0, SC_1, SC_2, SC_3, SC_0, SC_1, SC_2, SC_3,
110 SC_0, SC_1, SC_2, SC_3, SC_0, SC_1, SC_2, SC_3 },
112 { SC_0, SC_0, SC_0, SC_0, SC_4, SC_4, SC_4, SC_4,
113 SC_0, SC_0, SC_0, SC_0, SC_4, SC_4, SC_4, SC_4 },
115 { SC_0, SC_1, SC_0, SC_1, SC_4, SC_5, SC_4, SC_5,
116 SC_0, SC_1, SC_0, SC_1, SC_4, SC_5, SC_4, SC_5 },
118 { SC_0, SC_0, SC_2, SC_2, SC_4, SC_4, SC_6, SC_6,
119 SC_0, SC_0, SC_2, SC_2, SC_4, SC_4, SC_6, SC_6 },
121 { SC_0, SC_1, SC_2, SC_3, SC_4, SC_5, SC_6, SC_7,
122 SC_0, SC_1, SC_2, SC_3, SC_4, SC_5, SC_6, SC_7 },
124 { SC_0, SC_0, SC_0, SC_0, SC_0, SC_0, SC_0, SC_0,
125 SC_8, SC_8, SC_8, SC_8, SC_8, SC_8, SC_8, SC_8 },
127 { SC_0, SC_1, SC_0, SC_1, SC_0, SC_1, SC_0, SC_1,
128 SC_8, SC_9, SC_8, SC_9, SC_8, SC_9, SC_8, SC_9 },
130 { SC_0, SC_0, SC_2, SC_2, SC_0, SC_0, SC_2, SC_2,
131 SC_8, SC_8, SC_A, SC_A, SC_8, SC_8, SC_A, SC_A },
133 { SC_0, SC_1, SC_2, SC_3, SC_0, SC_1, SC_2, SC_3,
134 SC_8, SC_9, SC_A, SC_B, SC_8, SC_9, SC_A, SC_B },
136 { SC_0, SC_0, SC_0, SC_0, SC_4, SC_4, SC_4, SC_4,
137 SC_8, SC_8, SC_8, SC_8, SC_C, SC_C, SC_C, SC_C },
139 { SC_0, SC_1, SC_0, SC_1, SC_4, SC_5, SC_4, SC_5,
140 SC_8, SC_9, SC_8, SC_9, SC_C, SC_D, SC_C, SC_D },
142 { SC_0, SC_0, SC_2, SC_2, SC_4, SC_4, SC_6, SC_6,
143 SC_8, SC_8, SC_A, SC_A, SC_C, SC_C, SC_E, SC_E },
145 { SC_0, SC_1, SC_2, SC_3, SC_4, SC_5, SC_6, SC_7,
146 SC_8, SC_9, SC_A, SC_B, SC_C, SC_D, SC_E, SC_F } };
148 static const char or_table[16][16] = {
149 { SC_0, SC_1, SC_2, SC_3, SC_4, SC_5, SC_6, SC_7,
150 SC_8, SC_9, SC_A, SC_B, SC_C, SC_D, SC_E, SC_F },
152 { SC_1, SC_1, SC_3, SC_3, SC_5, SC_5, SC_7, SC_7,
153 SC_9, SC_9, SC_B, SC_B, SC_D, SC_D, SC_F, SC_F },
155 { SC_2, SC_3, SC_2, SC_3, SC_6, SC_7, SC_6, SC_7,
156 SC_A, SC_B, SC_A, SC_B, SC_E, SC_F, SC_E, SC_F },
158 { SC_3, SC_3, SC_3, SC_3, SC_7, SC_7, SC_7, SC_7,
159 SC_B, SC_B, SC_B, SC_B, SC_F, SC_F, SC_F, SC_F },
161 { SC_4, SC_5, SC_6, SC_7, SC_4, SC_5, SC_6, SC_7,
162 SC_C, SC_D, SC_E, SC_F, SC_C, SC_D, SC_E, SC_F },
164 { SC_5, SC_5, SC_7, SC_7, SC_5, SC_5, SC_7, SC_7,
165 SC_D, SC_D, SC_F, SC_F, SC_D, SC_D, SC_F, SC_F },
167 { SC_6, SC_7, SC_6, SC_7, SC_6, SC_7, SC_6, SC_7,
168 SC_E, SC_F, SC_E, SC_F, SC_E, SC_F, SC_E, SC_F },
170 { SC_7, SC_7, SC_7, SC_7, SC_7, SC_7, SC_7, SC_7,
171 SC_F, SC_F, SC_F, SC_F, SC_F, SC_F, SC_F, SC_F },
173 { SC_8, SC_9, SC_A, SC_B, SC_C, SC_D, SC_E, SC_F,
174 SC_8, SC_9, SC_A, SC_B, SC_C, SC_D, SC_E, SC_F },
176 { SC_9, SC_9, SC_B, SC_B, SC_D, SC_D, SC_F, SC_F,
177 SC_9, SC_9, SC_B, SC_B, SC_D, SC_D, SC_F, SC_F },
179 { SC_A, SC_B, SC_A, SC_B, SC_E, SC_F, SC_E, SC_F,
180 SC_A, SC_B, SC_A, SC_B, SC_E, SC_F, SC_E, SC_F },
182 { SC_B, SC_B, SC_B, SC_B, SC_F, SC_F, SC_F, SC_F,
183 SC_B, SC_B, SC_B, SC_B, SC_F, SC_F, SC_F, SC_F },
185 { SC_C, SC_D, SC_E, SC_F, SC_C, SC_D, SC_E, SC_F,
186 SC_C, SC_D, SC_E, SC_F, SC_C, SC_D, SC_E, SC_F },
188 { SC_D, SC_D, SC_F, SC_F, SC_D, SC_D, SC_F, SC_F,
189 SC_D, SC_D, SC_F, SC_F, SC_D, SC_D, SC_F, SC_F },
191 { SC_E, SC_F, SC_E, SC_F, SC_E, SC_F, SC_E, SC_F,
192 SC_E, SC_F, SC_E, SC_F, SC_E, SC_F, SC_E, SC_F },
194 { SC_F, SC_F, SC_F, SC_F, SC_F, SC_F, SC_F, SC_F,
195 SC_F, SC_F, SC_F, SC_F, SC_F, SC_F, SC_F, SC_F } };
197 static char const xor_table[16][16] = {
198 { SC_0, SC_1, SC_2, SC_3, SC_4, SC_5, SC_6, SC_7,
199 SC_8, SC_9, SC_A, SC_B, SC_C, SC_D, SC_E, SC_F },
201 { SC_1, SC_0, SC_3, SC_2, SC_5, SC_4, SC_7, SC_6,
202 SC_9, SC_8, SC_B, SC_A, SC_D, SC_C, SC_F, SC_E },
204 { SC_2, SC_3, SC_0, SC_1, SC_6, SC_7, SC_4, SC_5,
205 SC_A, SC_B, SC_8, SC_9, SC_E, SC_F, SC_C, SC_D },
207 { SC_3, SC_2, SC_1, SC_0, SC_7, SC_6, SC_5, SC_4,
208 SC_B, SC_A, SC_9, SC_8, SC_F, SC_E, SC_D, SC_C },
210 { SC_4, SC_5, SC_6, SC_7, SC_0, SC_1, SC_2, SC_3,
211 SC_C, SC_D, SC_E, SC_F, SC_8, SC_9, SC_A, SC_B },
213 { SC_5, SC_4, SC_7, SC_6, SC_1, SC_0, SC_3, SC_2,
214 SC_D, SC_C, SC_F, SC_E, SC_9, SC_8, SC_B, SC_A },
216 { SC_6, SC_7, SC_4, SC_5, SC_2, SC_3, SC_0, SC_1,
217 SC_E, SC_F, SC_C, SC_D, SC_A, SC_B, SC_8, SC_9 },
219 { SC_7, SC_6, SC_5, SC_4, SC_3, SC_2, SC_1, SC_0,
220 SC_F, SC_E, SC_D, SC_C, SC_B, SC_A, SC_9, SC_8 },
222 { SC_8, SC_9, SC_A, SC_B, SC_C, SC_D, SC_E, SC_F,
223 SC_0, SC_1, SC_2, SC_3, SC_4, SC_5, SC_6, SC_7 },
225 { SC_9, SC_8, SC_B, SC_A, SC_D, SC_C, SC_F, SC_E,
226 SC_1, SC_0, SC_3, SC_2, SC_5, SC_4, SC_7, SC_6 },
228 { SC_A, SC_B, SC_8, SC_9, SC_E, SC_F, SC_C, SC_D,
229 SC_2, SC_3, SC_0, SC_1, SC_6, SC_7, SC_4, SC_5 },
231 { SC_B, SC_A, SC_9, SC_8, SC_F, SC_E, SC_D, SC_C,
232 SC_3, SC_2, SC_1, SC_0, SC_7, SC_6, SC_5, SC_4 },
234 { SC_C, SC_D, SC_E, SC_F, SC_8, SC_9, SC_A, SC_B,
235 SC_4, SC_5, SC_6, SC_7, SC_0, SC_1, SC_2, SC_3 },
237 { SC_D, SC_C, SC_F, SC_E, SC_9, SC_8, SC_B, SC_A,
238 SC_5, SC_4, SC_7, SC_6, SC_1, SC_0, SC_3, SC_2 },
240 { SC_E, SC_F, SC_C, SC_D, SC_A, SC_B, SC_8, SC_9,
241 SC_6, SC_7, SC_4, SC_5, SC_2, SC_3, SC_0, SC_1 },
243 { SC_F, SC_E, SC_D, SC_C, SC_B, SC_A, SC_9, SC_8,
244 SC_7, SC_6, SC_5, SC_4, SC_3, SC_2, SC_1, SC_0 }
247 static char const add_table[16][16][2] = {
248 { {SC_0, SC_0}, {SC_1, SC_0}, {SC_2, SC_0}, {SC_3, SC_0},
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} },
253 { {SC_1, SC_0}, {SC_2, SC_0}, {SC_3, SC_0}, {SC_4, SC_0},
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} },
258 { {SC_2, SC_0}, {SC_3, SC_0}, {SC_4, SC_0}, {SC_5, SC_0},
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} },
263 { {SC_3, SC_0}, {SC_4, SC_0}, {SC_5, SC_0}, {SC_6, SC_0},
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} },
268 { {SC_4, SC_0}, {SC_5, SC_0}, {SC_6, SC_0}, {SC_7, SC_0},
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} },
273 { {SC_5, SC_0}, {SC_6, SC_0}, {SC_7, SC_0}, {SC_8, SC_0},
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} },
278 { {SC_6, SC_0}, {SC_7, SC_0}, {SC_8, SC_0}, {SC_9, SC_0},
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} },
283 { {SC_7, SC_0}, {SC_8, SC_0}, {SC_9, SC_0}, {SC_A, SC_0},
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} },
288 { {SC_8, SC_0}, {SC_9, SC_0}, {SC_A, SC_0}, {SC_B, SC_0},
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} },
293 { {SC_9, SC_0}, {SC_A, SC_0}, {SC_B, SC_0}, {SC_C, SC_0},
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} },
298 { {SC_A, SC_0}, {SC_B, SC_0}, {SC_C, SC_0}, {SC_D, SC_0},
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} },
303 { {SC_B, SC_0}, {SC_C, SC_0}, {SC_D, SC_0}, {SC_E, SC_0},
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} },
308 { {SC_C, SC_0}, {SC_D, SC_0}, {SC_E, SC_0}, {SC_F, SC_0},
309 {SC_0, SC_1}, {SC_1, SC_1}, {SC_2, SC_1}, {SC_3, SC_1},
310 {SC_4, SC_1}, {SC_5, SC_1}, {SC_6, SC_1}, {SC_7, SC_1},
311 {SC_8, SC_1}, {SC_9, SC_1}, {SC_A, SC_1}, {SC_B, SC_1} },
313 { {SC_D, SC_0}, {SC_E, SC_0}, {SC_F, SC_0}, {SC_0, SC_1},
314 {SC_1, SC_1}, {SC_2, SC_1}, {SC_3, SC_1}, {SC_4, SC_1},
315 {SC_5, SC_1}, {SC_6, SC_1}, {SC_7, SC_1}, {SC_8, SC_1},
316 {SC_9, SC_1}, {SC_A, SC_1}, {SC_B, SC_1}, {SC_C, SC_1} },
318 { {SC_E, SC_0}, {SC_F, SC_0}, {SC_0, SC_1}, {SC_1, SC_1},
319 {SC_2, SC_1}, {SC_3, SC_1}, {SC_4, SC_1}, {SC_5, SC_1},
320 {SC_6, SC_1}, {SC_7, SC_1}, {SC_8, SC_1}, {SC_9, SC_1},
321 {SC_A, SC_1}, {SC_B, SC_1}, {SC_C, SC_1}, {SC_D, SC_1} },
323 { {SC_F, SC_0}, {SC_0, SC_1}, {SC_1, SC_1}, {SC_2, SC_1},
324 {SC_3, SC_1}, {SC_4, SC_1}, {SC_5, SC_1}, {SC_6, SC_1},
325 {SC_7, SC_1}, {SC_8, SC_1}, {SC_9, SC_1}, {SC_A, SC_1},
326 {SC_B, SC_1}, {SC_C, SC_1}, {SC_D, SC_1}, {SC_E, SC_1} }
329 static char const mul_table[16][16][2] = {
330 { {SC_0, SC_0}, {SC_0, SC_0}, {SC_0, SC_0}, {SC_0, SC_0},
331 {SC_0, SC_0}, {SC_0, SC_0}, {SC_0, SC_0}, {SC_0, SC_0},
332 {SC_0, SC_0}, {SC_0, SC_0}, {SC_0, SC_0}, {SC_0, SC_0},
333 {SC_0, SC_0}, {SC_0, SC_0}, {SC_0, SC_0}, {SC_0, SC_0} },
335 { {SC_0, SC_0}, {SC_1, SC_0}, {SC_2, SC_0}, {SC_3, SC_0},
336 {SC_4, SC_0}, {SC_5, SC_0}, {SC_6, SC_0}, {SC_7, SC_0},
337 {SC_8, SC_0}, {SC_9, SC_0}, {SC_A, SC_0}, {SC_B, SC_0},
338 {SC_C, SC_0}, {SC_D, SC_0}, {SC_E, SC_0}, {SC_F, SC_0} },
340 { {SC_0, SC_0}, {SC_2, SC_0}, {SC_4, SC_0}, {SC_6, SC_0},
341 {SC_8, SC_0}, {SC_A, SC_0}, {SC_C, SC_0}, {SC_E, SC_0},
342 {SC_0, SC_1}, {SC_2, SC_1}, {SC_4, SC_1}, {SC_6, SC_1},
343 {SC_8, SC_1}, {SC_A, SC_1}, {SC_C, SC_1}, {SC_E, SC_1} },
345 { {SC_0, SC_0}, {SC_3, SC_0}, {SC_6, SC_0}, {SC_9, SC_0},
346 {SC_C, SC_0}, {SC_F, SC_0}, {SC_2, SC_1}, {SC_5, SC_1},
347 {SC_8, SC_1}, {SC_B, SC_1}, {SC_E, SC_1}, {SC_1, SC_2},
348 {SC_4, SC_2}, {SC_7, SC_2}, {SC_A, SC_2}, {SC_D, SC_2} },
350 { {SC_0, SC_0}, {SC_4, SC_0}, {SC_8, SC_0}, {SC_C, SC_0},
351 {SC_0, SC_1}, {SC_4, SC_1}, {SC_8, SC_1}, {SC_C, SC_1},
352 {SC_0, SC_2}, {SC_4, SC_2}, {SC_8, SC_2}, {SC_C, SC_2},
353 {SC_0, SC_3}, {SC_4, SC_3}, {SC_8, SC_3}, {SC_C, SC_3} },
355 { {SC_0, SC_0}, {SC_5, SC_0}, {SC_A, SC_0}, {SC_F, SC_0},
356 {SC_4, SC_1}, {SC_9, SC_1}, {SC_E, SC_1}, {SC_3, SC_2},
357 {SC_8, SC_2}, {SC_D, SC_2}, {SC_2, SC_3}, {SC_7, SC_3},
358 {SC_C, SC_3}, {SC_1, SC_4}, {SC_6, SC_4}, {SC_B, SC_4} },
360 { {SC_0, SC_0}, {SC_6, SC_0}, {SC_C, SC_0}, {SC_2, SC_1},
361 {SC_8, SC_1}, {SC_E, SC_1}, {SC_4, SC_2}, {SC_A, SC_2},
362 {SC_0, SC_3}, {SC_6, SC_3}, {SC_C, SC_3}, {SC_2, SC_4},
363 {SC_8, SC_4}, {SC_E, SC_4}, {SC_4, SC_5}, {SC_A, SC_5} },
365 { {SC_0, SC_0}, {SC_7, SC_0}, {SC_E, SC_0}, {SC_5, SC_1},
366 {SC_C, SC_1}, {SC_3, SC_2}, {SC_A, SC_2}, {SC_1, SC_3},
367 {SC_8, SC_3}, {SC_F, SC_3}, {SC_6, SC_4}, {SC_D, SC_4},
368 {SC_4, SC_5}, {SC_B, SC_5}, {SC_2, SC_6}, {SC_9, SC_6} },
370 { {SC_0, SC_0}, {SC_8, SC_0}, {SC_0, SC_1}, {SC_8, SC_1},
371 {SC_0, SC_2}, {SC_8, SC_2}, {SC_0, SC_3}, {SC_8, SC_3},
372 {SC_0, SC_4}, {SC_8, SC_4}, {SC_0, SC_5}, {SC_8, SC_5},
373 {SC_0, SC_6}, {SC_8, SC_6}, {SC_0, SC_7}, {SC_8, SC_7} },
375 { {SC_0, SC_0}, {SC_9, SC_0}, {SC_2, SC_1}, {SC_B, SC_1},
376 {SC_4, SC_2}, {SC_D, SC_2}, {SC_6, SC_3}, {SC_F, SC_3},
377 {SC_8, SC_4}, {SC_1, SC_5}, {SC_A, SC_5}, {SC_3, SC_6},
378 {SC_C, SC_6}, {SC_5, SC_7}, {SC_E, SC_7}, {SC_7, SC_8} },
380 { {SC_0, SC_0}, {SC_A, SC_0}, {SC_4, SC_1}, {SC_E, SC_1},
381 {SC_8, SC_2}, {SC_2, SC_3}, {SC_C, SC_3}, {SC_6, SC_4},
382 {SC_0, SC_5}, {SC_A, SC_5}, {SC_4, SC_6}, {SC_E, SC_6},
383 {SC_8, SC_7}, {SC_2, SC_8}, {SC_C, SC_8}, {SC_6, SC_9} },
385 { {SC_0, SC_0}, {SC_B, SC_0}, {SC_6, SC_1}, {SC_1, SC_2},
386 {SC_C, SC_2}, {SC_7, SC_3}, {SC_2, SC_4}, {SC_D, SC_4},
387 {SC_8, SC_5}, {SC_3, SC_6}, {SC_E, SC_6}, {SC_9, SC_7},
388 {SC_4, SC_8}, {SC_F, SC_8}, {SC_A, SC_9}, {SC_5, SC_A} },
390 { {SC_0, SC_0}, {SC_C, SC_0}, {SC_8, SC_1}, {SC_4, SC_2},
391 {SC_0, SC_3}, {SC_C, SC_3}, {SC_8, SC_4}, {SC_4, SC_5},
392 {SC_0, SC_6}, {SC_C, SC_6}, {SC_8, SC_7}, {SC_4, SC_8},
393 {SC_0, SC_9}, {SC_C, SC_9}, {SC_8, SC_A}, {SC_4, SC_B} },
395 { {SC_0, SC_0}, {SC_D, SC_0}, {SC_A, SC_1}, {SC_7, SC_2},
396 {SC_4, SC_3}, {SC_1, SC_4}, {SC_E, SC_4}, {SC_B, SC_5},
397 {SC_8, SC_6}, {SC_5, SC_7}, {SC_2, SC_8}, {SC_F, SC_8},
398 {SC_C, SC_9}, {SC_9, SC_A}, {SC_6, SC_B}, {SC_3, SC_C} },
400 { {SC_0, SC_0}, {SC_E, SC_0}, {SC_C, SC_1}, {SC_A, SC_2},
401 {SC_8, SC_3}, {SC_6, SC_4}, {SC_4, SC_5}, {SC_2, SC_6},
402 {SC_0, SC_7}, {SC_E, SC_7}, {SC_C, SC_8}, {SC_A, SC_9},
403 {SC_8, SC_A}, {SC_6, SC_B}, {SC_4, SC_C}, {SC_2, SC_D} },
405 { {SC_0, SC_0}, {SC_F, SC_0}, {SC_E, SC_1}, {SC_D, SC_2},
406 {SC_C, SC_3}, {SC_B, SC_4}, {SC_A, SC_5}, {SC_9, SC_6},
407 {SC_8, SC_7}, {SC_7, SC_8}, {SC_6, SC_9}, {SC_5, SC_A},
408 {SC_4, SC_B}, {SC_3, SC_C}, {SC_2, SC_D}, {SC_1, SC_E} }
411 static char const shrs_table[16][4][2] = {
412 { {SC_0, SC_0}, {SC_0, SC_0}, {SC_0, SC_0}, {SC_0, SC_0} },
413 { {SC_1, SC_0}, {SC_0, SC_8}, {SC_0, SC_4}, {SC_0, SC_2} },
414 { {SC_2, SC_0}, {SC_1, SC_0}, {SC_0, SC_8}, {SC_0, SC_4} },
415 { {SC_3, SC_0}, {SC_1, SC_8}, {SC_0, SC_C}, {SC_0, SC_6} },
416 { {SC_4, SC_0}, {SC_2, SC_0}, {SC_1, SC_0}, {SC_0, SC_8} },
417 { {SC_5, SC_0}, {SC_2, SC_8}, {SC_1, SC_4}, {SC_0, SC_A} },
418 { {SC_6, SC_0}, {SC_3, SC_0}, {SC_1, SC_8}, {SC_0, SC_C} },
419 { {SC_7, SC_0}, {SC_3, SC_8}, {SC_1, SC_C}, {SC_0, SC_E} },
420 { {SC_8, SC_0}, {SC_4, SC_0}, {SC_2, SC_0}, {SC_1, SC_0} },
421 { {SC_9, SC_0}, {SC_4, SC_8}, {SC_2, SC_4}, {SC_1, SC_2} },
422 { {SC_A, SC_0}, {SC_5, SC_0}, {SC_2, SC_8}, {SC_1, SC_4} },
423 { {SC_B, SC_0}, {SC_5, SC_8}, {SC_2, SC_C}, {SC_1, SC_6} },
424 { {SC_C, SC_0}, {SC_6, SC_0}, {SC_3, SC_0}, {SC_1, SC_8} },
425 { {SC_D, SC_0}, {SC_6, SC_8}, {SC_3, SC_4}, {SC_1, SC_A} },
426 { {SC_E, SC_0}, {SC_7, SC_0}, {SC_3, SC_8}, {SC_1, SC_C} },
427 { {SC_F, SC_0}, {SC_7, SC_8}, {SC_3, SC_C}, {SC_1, SC_E} }
430 /** converting a digit to a binary string */
431 static const char *binary_table[16] = {
432 "0000", "0001", "0010", "0011", "0100", "0101", "0110", "0111",
433 "1000", "1001", "1010", "1011", "1100", "1101", "1110", "1111"
436 /*****************************************************************************
438 *****************************************************************************/
439 static void _fail_char(const char *str, size_t len, const char fchar, int pos,
440 const char *file, int line) {
442 printf("Unexpected character '%c' in %s:%d\n", fchar, file, line);
443 while (len-- && *str) printf("%c", *str++); printf("\n");
444 while (--pos) printf(" "); printf("^\n");
449 * implements the bitwise NOT operation
451 static void do_bitnot(const char *val, char *buffer) {
454 for (counter = 0; counter<calc_buffer_size; counter++)
455 buffer[counter] = not_table[_val(val[counter])];
459 * implements the bitwise OR operation
461 static void do_bitor(const char *val1, const char *val2, char *buffer) {
464 for (counter = 0; counter<calc_buffer_size; counter++)
465 buffer[counter] = or_table[_val(val1[counter])][_val(val2[counter])];
469 * implements the bitwise eXclusive OR operation
471 static void do_bitxor(const char *val1, const char *val2, char *buffer) {
474 for (counter = 0; counter<calc_buffer_size; counter++)
475 buffer[counter] = xor_table[_val(val1[counter])][_val(val2[counter])];
479 * implements the bitwise AND operation
481 static void do_bitand(const char *val1, const char *val2, char *buffer) {
484 for (counter = 0; counter<calc_buffer_size; counter++)
485 buffer[counter] = and_table[_val(val1[counter])][_val(val2[counter])];
489 * returns the sign bit.
491 * @todo This implementation is wrong, as it returns the highest bit of the buffer
492 * NOT the highest bit depending on the real mode
494 static int do_sign(const char *val) {
495 return (val[calc_buffer_size-1] <= SC_7) ? (1) : (-1);
499 * returns non-zero if bit at position pos is set
501 static int do_bit(const char *val, int pos) {
503 int nibble = pos >> 2;
505 return _bitisset(val[nibble], bit);
509 * Implements a fast ADD + 1
511 static void do_inc(const char *val, char *buffer) {
514 while (counter++ < calc_buffer_size) {
519 /* No carry here, *val != SC_F */
520 *buffer = add_table[_val(*val)][SC_1][0];
524 /* here a carry could be lost, this is intended because this should
525 * happen only when a value changes sign. */
529 * Implements a unary MINUS
531 static void do_negate(const char *val, char *buffer) {
532 do_bitnot(val, buffer);
533 do_inc(buffer, buffer);
537 * Implements a binary ADD
539 * @todo The implementation of carry is wrong, as it is the
540 * calc_buffer_size carry, not the mode depending
542 static void do_add(const char *val1, const char *val2, char *buffer) {
544 const char *add1, *add2;
547 for (counter = 0; counter < calc_buffer_size; counter++) {
548 add1 = add_table[_val(val1[counter])][_val(val2[counter])];
549 add2 = add_table[_val(add1[0])][_val(carry)];
550 /* carry might be zero */
551 buffer[counter] = add2[0];
552 carry = add_table[_val(add1[1])][_val(add2[1])][0];
554 carry_flag = carry != SC_0;
558 * Implements a binary SUB
560 static void do_sub(const char *val1, const char *val2, char *buffer) {
561 char *temp_buffer = alloca(calc_buffer_size); /* intermediate buffer to hold -val2 */
563 do_negate(val2, temp_buffer);
564 do_add(val1, temp_buffer, buffer);
568 * Implements a binary MUL
570 static void do_mul(const char *val1, const char *val2, char *buffer) {
571 char *temp_buffer; /* result buffer */
572 char *neg_val1; /* abs of val1 */
573 char *neg_val2; /* abs of val2 */
575 const char *mul, *add1, *add2; /* intermediate result containers */
576 char carry = SC_0; /* container for carries */
577 char sign = 0; /* marks result sign */
578 int c_inner, c_outer; /* loop counters */
580 temp_buffer = alloca(calc_buffer_size);
581 neg_val1 = alloca(calc_buffer_size);
582 neg_val2 = alloca(calc_buffer_size);
584 /* init result buffer to zeros */
585 memset(temp_buffer, SC_0, calc_buffer_size);
587 /* the multiplication works only for positive values, for negative values *
588 * it is necessary to negate them and adjust the result accordingly */
589 if (do_sign(val1) == -1) {
590 do_negate(val1, neg_val1);
594 if (do_sign(val2) == -1) {
595 do_negate(val2, neg_val2);
600 for (c_outer = 0; c_outer < max_value_size; c_outer++) {
601 if (val2[c_outer] != SC_0) {
602 for (c_inner = 0; c_inner < max_value_size; c_inner++) {
603 /* do the following calculation: *
604 * Add the current carry, the value at position c_outer+c_inner *
605 * and the result of the multiplication of val1[c_inner] and *
606 * val2[c_outer]. This is the usual pen-and-paper multiplication. */
608 /* multiplicate the two digits */
609 mul = mul_table[_val(val1[c_inner])][_val(val2[c_outer])];
610 /* add old value to result of multiplication */
611 add1 = add_table[_val(temp_buffer[c_inner + c_outer])][_val(mul[0])];
612 /* add carry to the sum */
613 add2 = add_table[_val(add1[0])][_val(carry)];
615 /* all carries together result in new carry. This is always smaller *
617 * Both multiplicands, the carry and the value already in the temp *
618 * buffer are single digits and their value is therefore at most *
621 * (b-1)(b-1)+(b-1)+(b-1) = b*b-1 *
622 * The tables list all operations rem b, so the carry is at most *
623 * (b*b-1)rem b = -1rem b = b-1 */
624 carry = add_table[_val(mul[1])][_val(add1[1])][0];
625 carry = add_table[_val(carry)][_val(add2[1])][0];
627 temp_buffer[c_inner + c_outer] = add2[0];
630 /* A carry may hang over */
631 /* c_outer is always smaller than max_value_size! */
632 temp_buffer[max_value_size + c_outer] = carry;
638 do_negate(temp_buffer, buffer);
640 memcpy(buffer, temp_buffer, calc_buffer_size);
644 * Shift the buffer to left and add a 4 bit digit
646 static void do_push(const char digit, char *buffer) {
649 for (counter = calc_buffer_size - 2; counter >= 0; counter--) {
650 buffer[counter+1] = buffer[counter];
656 * Implements truncating integer division and remainder.
658 * Note: This is MOST slow
660 static void do_divmod(const char *rDividend, const char *divisor, char *quot, char *rem) {
661 const char *dividend = rDividend;
662 const char *minus_divisor;
666 char div_sign = 0; /* remember division result sign */
667 char rem_sign = 0; /* remember remainder result sign */
669 int c_dividend; /* loop counters */
671 neg_val1 = alloca(calc_buffer_size);
672 neg_val2 = alloca(calc_buffer_size);
674 /* clear result buffer */
675 memset(quot, SC_0, calc_buffer_size);
676 memset(rem, SC_0, calc_buffer_size);
678 /* if the divisor is zero this won't work (quot is zero) */
679 if (sc_comp(divisor, quot) == 0) assert(0 && "division by zero!");
681 /* if the dividend is zero result is zero (quot is zero) */
682 if (sc_comp(dividend, quot) == 0)
685 if (do_sign(dividend) == -1) {
686 do_negate(dividend, neg_val1);
692 do_negate(divisor, neg_val2);
693 if (do_sign(divisor) == -1) {
695 minus_divisor = divisor;
698 minus_divisor = neg_val2;
700 /* if divisor >= dividend division is easy
701 * (remember these are absolute values) */
702 switch (sc_comp(dividend, divisor)) {
703 case 0: /* dividend == divisor */
707 case -1: /* dividend < divisor */
708 memcpy(rem, rDividend, calc_buffer_size);
711 default: /* unluckily division is necessary :( */
715 for (c_dividend = calc_buffer_size - 1; c_dividend >= 0; c_dividend--) {
716 do_push(dividend[c_dividend], rem);
719 if (sc_comp(rem, divisor) != -1) { /* remainder >= divisor */
720 /* subtract until the remainder becomes negative, this should
721 * be faster than comparing remainder with divisor */
722 do_add(rem, minus_divisor, rem);
724 while (do_sign(rem) == 1) {
725 quot[0] = add_table[_val(quot[0])][SC_1][0];
726 do_add(rem, minus_divisor, rem);
729 /* subtracted one too much */
730 do_add(rem, divisor, rem);
734 /* sets carry if remainder is non-zero ??? */
735 carry_flag = !sc_is_zero(rem);
738 do_negate(quot, quot);
745 * Implements a Shift Left, which can either preserve the sign bit
748 * @todo Assertions seems to be wrong
750 static void do_shl(const char *val1, char *buffer, long shift_cnt, int bitsize, unsigned is_signed) {
758 assert((shift_cnt >= 0) || (0 && "negative leftshift"));
759 assert(((do_sign(val1) != -1) || is_signed) || (0 && "unsigned mode and negative value"));
760 assert(((!_bitisset(val1[(bitsize-1)/4], (bitsize-1)%4)) || !is_signed || (do_sign(val1) == -1)) || (0 && "value is positive, should be negative"));
761 assert(((_bitisset(val1[(bitsize-1)/4], (bitsize-1)%4)) || !is_signed || (do_sign(val1) == 1)) || (0 && "value is negative, should be positive"));
763 /* if shifting far enough the result is zero */
764 if (shift_cnt >= bitsize) {
765 memset(buffer, SC_0, calc_buffer_size);
769 shift = shift_table[_val(shift_cnt%4)]; /* this is 2 ** (offset % 4) */
770 shift_cnt = shift_cnt / 4;
772 /* shift the single digits some bytes (offset) and some bits (table)
774 for (counter = 0; counter < bitsize/4 - shift_cnt; counter++) {
775 shl = mul_table[_val(val1[counter])][_val(shift)];
776 buffer[counter + shift_cnt] = or_table[_val(shl[0])][_val(carry)];
780 shl = mul_table[_val(val1[counter])][_val(shift)];
781 buffer[counter + shift_cnt] = or_table[_val(shl[0])][_val(carry)];
784 bitoffset = counter - 1;
787 /* fill with zeroes */
788 for (counter = 0; counter < shift_cnt; counter++)
789 buffer[counter] = SC_0;
791 /* if the mode was signed, change sign when the mode's msb is now 1 */
792 shift_cnt = bitoffset + shift_cnt;
793 bitoffset = (bitsize-1) % 4;
794 if (is_signed && _bitisset(buffer[shift_cnt], bitoffset)) {
795 /* this sets the upper bits of the leftmost digit */
796 buffer[shift_cnt] = or_table[_val(buffer[shift_cnt])][_val(min_digit[bitoffset])];
797 for (counter = shift_cnt+1; counter < calc_buffer_size; counter++) {
798 buffer[counter] = SC_F;
800 } else if (is_signed && !_bitisset(buffer[shift_cnt], bitoffset)) {
801 /* this clears the upper bits of the leftmost digit */
802 buffer[shift_cnt] = and_table[_val(buffer[shift_cnt])][_val(max_digit[bitoffset])];
803 for (counter = shift_cnt+1; counter < calc_buffer_size; counter++) {
804 buffer[counter] = SC_0;
810 * Implements a Shift Right, which can either preserve the sign bit
813 * @param bitsize bitsize of the value to be shifted
815 * @todo Assertions seems to be wrong
817 static void do_shr(const char *val1, char *buffer, long shift_cnt, int bitsize, unsigned is_signed, int signed_shift) {
822 int shift_mod, shift_nib;
827 assert((shift_cnt >= 0) || (0 && "negative rightshift"));
828 assert(((!_bitisset(val1[(bitsize-1)/4], (bitsize-1)%4)) || !is_signed || (do_sign(val1) == -1)) || (0 && "value is positive, should be negative"));
829 assert(((_bitisset(val1[(bitsize-1)/4], (bitsize-1)%4)) || !is_signed || (do_sign(val1) == 1)) || (0 && "value is negative, should be positive"));
831 sign = signed_shift && do_bit(val1, bitsize - 1) ? SC_F : SC_0;
833 /* if shifting far enough the result is either 0 or -1 */
834 if (shift_cnt >= bitsize) {
835 if (!sc_is_zero(val1)) {
838 memset(buffer, sign, calc_buffer_size);
842 shift_mod = shift_cnt & 3;
843 shift_nib = shift_cnt >> 2;
845 /* check if any bits are lost, and set carry_flag if so */
846 for (counter = 0; counter < shift_nib; ++counter) {
847 if (val1[counter] != 0) {
852 if ((_val(val1[counter]) & ((1<<shift_mod)-1)) != 0)
855 /* shift digits to the right with offset, carry and all */
857 if ((bitsize >> 2) > shift_nib) {
858 buffer[counter] = shrs_table[_val(val1[shift_nib])][shift_mod][0];
861 for (; counter < bitsize/4 - shift_nib; counter++) {
862 shrs = shrs_table[_val(val1[counter + shift_nib])][shift_mod];
863 buffer[counter] = shrs[0];
864 buffer[counter-1] = or_table[_val(buffer[counter-1])][_val(shrs[1])];
867 /* the last digit is special in regard of signed/unsigned shift */
868 bitoffset = bitsize & 3;
869 msd = sign; /* most significant digit */
871 /* remove sign bits if mode was signed and this is an unsigned shift */
872 if (!signed_shift && is_signed) {
873 msd = and_table[_val(msd)][_val(max_digit[bitoffset])];
876 shrs = shrs_table[_val(msd)][shift_mod];
878 /* signed shift and signed mode and negative value means all bits to the left are set */
879 if (signed_shift && sign == SC_F) {
880 buffer[counter] = or_table[_val(shrs[0])][_val(min_digit[bitoffset])];
882 buffer[counter] = shrs[0];
886 buffer[counter - 1] = or_table[_val(buffer[counter-1])][_val(shrs[1])];
888 /* fill with SC_F or SC_0 depending on sign */
889 for (counter++; counter < calc_buffer_size; counter++) {
890 buffer[counter] = sign;
895 * Implements a Rotate Left.
896 * positive: low-order -> high order, negative other direction
898 static void do_rotl(const char *val1, char *buffer, long offset, int radius, unsigned is_signed) {
900 temp1 = alloca(calc_buffer_size);
901 temp2 = alloca(calc_buffer_size);
903 offset = offset % radius;
905 /* rotation by multiples of the type length is identity */
907 memmove(buffer, val1, calc_buffer_size);
911 do_shl(val1, temp1, offset, radius, is_signed);
912 do_shr(val1, temp2, radius - offset, radius, is_signed, 0);
913 do_bitor(temp1, temp2, buffer);
914 carry_flag = 0; /* set by shr, but due to rot this is false */
917 /*****************************************************************************
918 * public functions, declared in strcalc.h
919 *****************************************************************************/
920 const void *sc_get_buffer(void) {
921 return (void*)calc_buffer;
924 int sc_get_buffer_length(void) {
925 return calc_buffer_size;
929 * Do sign extension if the mode is signed, otherwise to zero extension.
931 void sign_extend(void *buffer, ir_mode *mode) {
932 char *calc_buffer = buffer;
933 int bits = get_mode_size_bits(mode) - 1;
934 int nibble = bits >> 2;
935 int max = max_digit[bits & 3];
938 if (mode_is_signed(mode)) {
939 if (calc_buffer[nibble] > max) {
940 /* sign bit is set, we need sign expansion */
942 for (i = nibble + 1; i < calc_buffer_size; ++i)
943 calc_buffer[i] = SC_F;
944 calc_buffer[nibble] = or_table[(int)calc_buffer[nibble]][(int)sex_digit[bits & 3]];
946 /* set all bits to zero */
947 for (i = nibble + 1; i < calc_buffer_size; ++i)
948 calc_buffer[i] = SC_0;
949 calc_buffer[nibble] = and_table[(int)calc_buffer[nibble]][(int)zex_digit[bits & 3]];
952 /* do zero extension */
953 for (i = nibble + 1; i < calc_buffer_size; ++i)
954 calc_buffer[i] = SC_0;
955 calc_buffer[nibble] = and_table[(int)calc_buffer[nibble]][(int)zex_digit[bits & 3]];
959 /* FIXME doesn't check for overflows */
960 void sc_val_from_str(const char *str, unsigned int len, void *buffer, ir_mode *mode) {
961 const char *orig_str = str;
962 unsigned int orig_len = len;
967 base = alloca(calc_buffer_size);
968 val = alloca(calc_buffer_size);
970 /* verify valid pointers (not null) */
972 /* a string no characters long is an error */
975 if (buffer == NULL) buffer = calc_buffer;
977 CLEAR_BUFFER(buffer);
981 /* strip leading spaces */
982 while ((len > 0) && (*str == ' ')) { len--; str++; }
984 /* if the first two characters are 0x or 0X -> hex
985 * if the first is a 0 -> oct
986 * else dec, strip leading -/+ and remember sign
988 * only a + or - sign is no number resulting in an error */
992 if (str[1] == 'x' || str[1] == 'X') { /* hex */
995 base[1] = SC_1; base[0] = SC_0;
999 base[1] = SC_0; base[0] = SC_8;
1006 base[1] = SC_0; base[0] = SC_A;
1013 base[1] = SC_0; base[0] = SC_A;
1016 default: /* dec, else would have begun with 0x or 0 */
1017 base[1] = SC_0; base[0] = SC_A;
1019 } else { /* dec, else would have begun with 0x or 0 */
1020 base[1] = SC_0; base[0] = SC_A;
1023 /* BEGIN string evaluation, from left to right */
1032 if (base[0] > SC_9 || base[1] > SC_0) { /* (base > 10) */
1033 val[0] = _digit((*str)-'a'+10);
1036 fail_char(orig_str, orig_len, *str, str-orig_str+1);
1045 if (base[0] > SC_9 || base[1] > SC_0) { /* (base > 10) */
1046 val[0] = _digit((*str)-'A'+10);
1049 fail_char(orig_str, orig_len, *str, str-orig_str+1);
1054 if (base[0] > SC_7 || base[1] > SC_0) { /* (base > 8) */
1055 val[0] = _digit((*str)-'0');
1058 fail_char(orig_str, orig_len, *str, str-orig_str+1);
1069 val[0] = _digit((*str)-'0');
1073 fail_char(orig_str, orig_len, *str, str-orig_str+1);
1074 } /* switch(*str) */
1076 /* Radix conversion from base b to base B:
1077 * (UnUn-1...U1U0)b == ((((Un*b + Un-1)*b + ...)*b + U1)*b + U0)B */
1078 do_mul(base, calc_buffer, calc_buffer); /* multiply current value with base */
1079 do_add(val, calc_buffer, calc_buffer); /* add next digit to current value */
1081 /* get ready for the next letter */
1084 } /* while (len > 0 ) */
1087 do_negate(calc_buffer, calc_buffer);
1089 /* beware: even if hex numbers have no sign, we need sign extension here */
1090 sign_extend(calc_buffer, mode);
1093 void sc_val_from_long(long value, void *buffer) {
1095 char sign, is_minlong;
1097 if (buffer == NULL) buffer = calc_buffer;
1101 is_minlong = value == LONG_MIN;
1103 /* use absolute value, special treatment of MIN_LONG to avoid overflow */
1111 CLEAR_BUFFER(buffer);
1113 while ((value != 0) && (pos < (char*)buffer + calc_buffer_size)) {
1114 *pos++ = _digit(value & 0xf);
1120 do_inc(buffer, buffer);
1122 do_negate(buffer, buffer);
1126 void sc_val_from_ulong(unsigned long value, void *buffer) {
1129 if (buffer == NULL) buffer = calc_buffer;
1132 while (pos < (unsigned char *)buffer + calc_buffer_size) {
1133 *pos++ = (unsigned char)_digit(value & 0xf);
1138 long sc_val_to_long(const void *val) {
1142 for (i = calc_buffer_size - 1; i >= 0; i--) {
1143 l = (l << 4) + _val(((char *)val)[i]);
1148 void sc_min_from_bits(unsigned int num_bits, unsigned int sign, void *buffer) {
1152 if (buffer == NULL) buffer = calc_buffer;
1153 CLEAR_BUFFER(buffer);
1155 if (!sign) return; /* unsigned means minimum is 0(zero) */
1159 bits = num_bits - 1;
1160 for (i = 0; i < bits/4; i++)
1163 *pos++ = min_digit[bits%4];
1165 for (i++; i <= calc_buffer_size - 1; i++)
1169 void sc_max_from_bits(unsigned int num_bits, unsigned int sign, void *buffer) {
1173 if (buffer == NULL) buffer = calc_buffer;
1174 CLEAR_BUFFER(buffer);
1177 bits = num_bits - sign;
1178 for (i = 0; i < bits/4; i++)
1181 *pos++ = max_digit[bits%4];
1183 for (i++; i <= calc_buffer_size - 1; i++)
1187 void sc_truncate(unsigned int num_bits, void *buffer) {
1188 char *cbuffer = buffer;
1189 char *pos = cbuffer + (num_bits / 4);
1190 char *end = cbuffer + calc_buffer_size;
1194 switch(num_bits % 4) {
1195 case 0: /* nothing to do */ break;
1196 case 1: *pos = and_table[_val(*pos)][SC_1]; pos++; break;
1197 case 2: *pos = and_table[_val(*pos)][SC_3]; pos++; break;
1198 case 3: *pos = and_table[_val(*pos)][SC_7]; pos++; break;
1201 for( ; pos < end; ++pos)
1205 int sc_comp(const void* value1, const void* value2) {
1206 int counter = calc_buffer_size - 1;
1207 const char *val1 = (const char *)value1;
1208 const char *val2 = (const char *)value2;
1210 /* compare signs first:
1211 * the loop below can only compare values of the same sign! */
1212 if (do_sign(val1) != do_sign(val2))
1213 return (do_sign(val1) == 1)?(1):(-1);
1215 /* loop until two digits differ, the values are equal if there
1216 * are no such two digits */
1217 while (val1[counter] == val2[counter]) {
1219 if (counter < 0) return 0;
1222 /* the leftmost digit is the most significant, so this returns
1223 * the correct result.
1224 * This implies the digit enum is ordered */
1225 return (val1[counter] > val2[counter]) ? (1) : (-1);
1228 int sc_get_highest_set_bit(const void *value) {
1229 const char *val = (const char*)value;
1232 high = calc_buffer_size * 4 - 1;
1234 for (counter = calc_buffer_size-1; counter >= 0; counter--) {
1235 if (val[counter] == SC_0)
1238 if (val[counter] > SC_7) return high;
1239 else if (val[counter] > SC_3) return high - 1;
1240 else if (val[counter] > SC_1) return high - 2;
1241 else return high - 3;
1247 int sc_get_lowest_set_bit(const void *value) {
1248 const char *val = (const char*)value;
1252 for (counter = 0; counter < calc_buffer_size; counter++) {
1253 switch (val[counter]) {
1280 int sc_is_zero(const void *value) {
1281 const char* val = (const char *)value;
1284 for (counter = 0; counter < calc_buffer_size; ++counter) {
1285 if (val[counter] != SC_0)
1291 int sc_is_negative(const void *value) {
1292 return do_sign(value) == -1;
1295 int sc_had_carry(void) {
1299 unsigned char sc_sub_bits(const void *value, int len, unsigned byte_ofs) {
1300 const char *val = (const char *)value;
1301 int nibble_ofs = 2 * byte_ofs;
1304 /* the current scheme uses one byte to store a nibble */
1305 if (4 * nibble_ofs >= len)
1308 res = _val(val[nibble_ofs]);
1309 if (len > 4 * (nibble_ofs + 1))
1310 res |= _val(val[nibble_ofs + 1]) << 4;
1312 /* kick bits outsize */
1313 if (len - 8 * byte_ofs < 8) {
1314 res &= (1 << (len - 8 * byte_ofs)) - 1;
1320 * convert to a string
1321 * FIXME: Doesn't check buffer bounds
1323 const char *sc_print(const void *value, unsigned bits, enum base_t base, int signed_mode) {
1324 static const char big_digits[] = "0123456789ABCDEF";
1325 static const char small_digits[] = "0123456789abcdef";
1327 char *base_val, *div1_res, *div2_res, *rem_res;
1328 int counter, nibbles, i, sign, mask;
1331 const char *val = (const char *)value;
1335 const char *digits = small_digits;
1337 base_val = alloca(calc_buffer_size);
1338 div1_res = alloca(calc_buffer_size);
1339 div2_res = alloca(calc_buffer_size);
1340 rem_res = alloca(calc_buffer_size);
1342 pos = output_buffer + bit_pattern_size;
1347 bits = bit_pattern_size;
1348 #ifdef STRCALC_DEBUG_FULLPRINT
1352 nibbles = bits >> 2;
1356 digits = big_digits;
1358 for (counter = 0; counter < nibbles; ++counter) {
1359 *(--pos) = digits[_val(val[counter])];
1360 #ifdef STRCALC_DEBUG_GROUPPRINT
1361 if ((counter+1)%8 == 0)
1366 /* last nibble must be masked */
1368 mask = zex_digit[bits & 3];
1369 x = and_table[_val(val[counter++])][mask];
1370 *(--pos) = digits[_val(x)];
1373 /* now kill zeros */
1374 for (; counter > 1; --counter, ++pos) {
1375 #ifdef STRCALC_DEBUG_GROUPPRINT
1376 if (pos[0] == ' ') ++pos;
1384 for (counter = 0; counter < nibbles; ++counter) {
1386 p = binary_table[_val(val[counter])];
1393 /* last nibble must be masked */
1395 mask = zex_digit[bits & 3];
1396 x = and_table[_val(val[counter++])][mask];
1399 p = binary_table[_val(x)];
1406 /* now kill zeros */
1407 for (counter <<= 2; counter > 1; --counter, ++pos)
1414 memset(base_val, SC_0, calc_buffer_size);
1415 base_val[0] = base == SC_DEC ? SC_A : SC_8;
1419 if (signed_mode && base == SC_DEC) {
1420 /* check for negative values */
1421 if (do_bit(val, bits - 1)) {
1422 do_negate(val, div2_res);
1428 /* transfer data into oscillating buffers */
1429 memset(div1_res, SC_0, calc_buffer_size);
1430 for (counter = 0; counter < nibbles; ++counter)
1431 div1_res[counter] = p[counter];
1433 /* last nibble must be masked */
1435 mask = zex_digit[bits & 3];
1436 div1_res[counter] = and_table[_val(p[counter])][mask];
1443 do_divmod(m, base_val, n, rem_res);
1447 *(--pos) = digits[_val(rem_res[0])];
1450 for (i = 0; i < calc_buffer_size; ++i)
1461 panic("Unsupported base %d", base);
1466 void init_strcalc(int precision) {
1467 if (calc_buffer == NULL) {
1468 if (precision <= 0) precision = SC_DEFAULT_PRECISION;
1470 /* round up to multiple of 4 */
1471 precision = (precision + 3) & ~3;
1473 bit_pattern_size = (precision);
1474 calc_buffer_size = (precision / 2);
1475 max_value_size = (precision / 4);
1477 calc_buffer = XMALLOCN(char, calc_buffer_size + 1);
1478 output_buffer = XMALLOCN(char, bit_pattern_size + 1);
1480 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));
1485 void finish_strcalc(void) {
1486 free(calc_buffer); calc_buffer = NULL;
1487 free(output_buffer); output_buffer = NULL;
1490 int sc_get_precision(void) {
1491 return bit_pattern_size;
1495 void sc_add(const void *value1, const void *value2, void *buffer) {
1496 CLEAR_BUFFER(calc_buffer);
1499 DEBUGPRINTF_COMPUTATION(("%s + ", sc_print_hex(value1)));
1500 DEBUGPRINTF_COMPUTATION(("%s -> ", sc_print_hex(value2)));
1502 do_add(value1, value2, calc_buffer);
1504 DEBUGPRINTF_COMPUTATION(("%s\n", sc_print_hex(calc_buffer)));
1506 if ((buffer != NULL) && (buffer != calc_buffer)) {
1507 memcpy(buffer, calc_buffer, calc_buffer_size);
1511 void sc_sub(const void *value1, const void *value2, void *buffer) {
1512 CLEAR_BUFFER(calc_buffer);
1515 DEBUGPRINTF_COMPUTATION(("%s - ", sc_print_hex(value1)));
1516 DEBUGPRINTF_COMPUTATION(("%s -> ", sc_print_hex(value2)));
1518 do_sub(value1, value2, calc_buffer);
1520 DEBUGPRINTF_COMPUTATION(("%s\n", sc_print_hex(calc_buffer)));
1522 if ((buffer != NULL) && (buffer != calc_buffer)) {
1523 memcpy(buffer, calc_buffer, calc_buffer_size);
1527 void sc_neg(const void *value1, void *buffer) {
1530 DEBUGPRINTF_COMPUTATION(("- %s ->", sc_print_hex(value1)));
1532 do_negate(value1, calc_buffer);
1534 DEBUGPRINTF_COMPUTATION(("%s\n", sc_print_hex(calc_buffer)));
1536 if ((buffer != NULL) && (buffer != calc_buffer)) {
1537 memcpy(buffer, calc_buffer, calc_buffer_size);
1541 void sc_and(const void *value1, const void *value2, void *buffer) {
1542 CLEAR_BUFFER(calc_buffer);
1545 DEBUGPRINTF_COMPUTATION(("%s & ", sc_print_hex(value1)));
1546 DEBUGPRINTF_COMPUTATION(("%s -> ", sc_print_hex(value2)));
1548 do_bitand(value1, value2, calc_buffer);
1550 DEBUGPRINTF_COMPUTATION(("%s\n", sc_print_hex(calc_buffer)));
1552 if ((buffer != NULL) && (buffer != calc_buffer)) {
1553 memcpy(buffer, calc_buffer, calc_buffer_size);
1557 void sc_or(const void *value1, const void *value2, void *buffer) {
1558 CLEAR_BUFFER(calc_buffer);
1561 DEBUGPRINTF_COMPUTATION(("%s | ", sc_print_hex(value1)));
1562 DEBUGPRINTF_COMPUTATION(("%s -> ", sc_print_hex(value2)));
1564 do_bitor(value1, value2, calc_buffer);
1566 DEBUGPRINTF_COMPUTATION(("%s\n", sc_print_hex(calc_buffer)));
1568 if ((buffer != NULL) && (buffer != calc_buffer)) {
1569 memcpy(buffer, calc_buffer, calc_buffer_size);
1573 void sc_xor(const void *value1, const void *value2, void *buffer) {
1574 CLEAR_BUFFER(calc_buffer);
1577 DEBUGPRINTF_COMPUTATION(("%s ^ ", sc_print_hex(value1)));
1578 DEBUGPRINTF_COMPUTATION(("%s -> ", sc_print_hex(value2)));
1580 do_bitxor(value1, value2, calc_buffer);
1582 DEBUGPRINTF_COMPUTATION(("%s\n", sc_print_hex(calc_buffer)));
1584 if ((buffer != NULL) && (buffer != calc_buffer)) {
1585 memcpy(buffer, calc_buffer, calc_buffer_size);
1589 void sc_not(const void *value1, void *buffer) {
1590 CLEAR_BUFFER(calc_buffer);
1593 DEBUGPRINTF_COMPUTATION(("~ %s ->", sc_print_hex(value1)));
1595 do_bitnot(value1, calc_buffer);
1597 DEBUGPRINTF_COMPUTATION(("%s\n", sc_print_hex(calc_buffer)));
1599 if ((buffer != NULL) && (buffer != calc_buffer)) {
1600 memcpy(buffer, calc_buffer, calc_buffer_size);
1604 void sc_mul(const void *value1, const void *value2, void *buffer) {
1605 CLEAR_BUFFER(calc_buffer);
1608 DEBUGPRINTF_COMPUTATION(("%s * ", sc_print_hex(value1)));
1609 DEBUGPRINTF_COMPUTATION(("%s -> ", sc_print_hex(value2)));
1611 do_mul(value1, value2, calc_buffer);
1613 DEBUGPRINTF_COMPUTATION(("%s\n", sc_print_hex(calc_buffer)));
1615 if ((buffer != NULL) && (buffer != calc_buffer)) {
1616 memcpy(buffer, calc_buffer, calc_buffer_size);
1620 void sc_div(const void *value1, const void *value2, void *buffer) {
1621 /* temp buffer holding unused result of divmod */
1622 char *unused_res = alloca(calc_buffer_size);
1624 CLEAR_BUFFER(calc_buffer);
1627 DEBUGPRINTF_COMPUTATION(("%s / ", sc_print_hex(value1)));
1628 DEBUGPRINTF_COMPUTATION(("%s -> ", sc_print_hex(value2)));
1630 do_divmod(value1, value2, calc_buffer, unused_res);
1632 DEBUGPRINTF_COMPUTATION(("%s\n", sc_print_hex(calc_buffer)));
1634 if ((buffer != NULL) && (buffer != calc_buffer)) {
1635 memcpy(buffer, calc_buffer, calc_buffer_size);
1639 void sc_mod(const void *value1, const void *value2, void *buffer) {
1640 /* temp buffer holding unused result of divmod */
1641 char *unused_res = alloca(calc_buffer_size);
1643 CLEAR_BUFFER(calc_buffer);
1646 DEBUGPRINTF_COMPUTATION(("%s %% ", sc_print_hex(value1)));
1647 DEBUGPRINTF_COMPUTATION(("%s -> ", sc_print_hex(value2)));
1649 do_divmod(value1, value2, unused_res, calc_buffer);
1651 DEBUGPRINTF_COMPUTATION(("%s\n", sc_print_hex(calc_buffer)));
1653 if ((buffer != NULL) && (buffer != calc_buffer)) {
1654 memcpy(buffer, calc_buffer, calc_buffer_size);
1658 void sc_divmod(const void *value1, const void *value2, void *div_buffer, void *mod_buffer) {
1659 CLEAR_BUFFER(calc_buffer);
1662 DEBUGPRINTF_COMPUTATION(("%s %% ", sc_print_hex(value1)));
1663 DEBUGPRINTF_COMPUTATION(("%s -> ", sc_print_hex(value2)));
1665 do_divmod(value1, value2, div_buffer, mod_buffer);
1667 DEBUGPRINTF_COMPUTATION(("%s:%s\n", sc_print_hex(div_buffer), sc_print_hex(mod_buffer)));
1671 void sc_shlI(const void *val1, long shift_cnt, int bitsize, int sign, void *buffer) {
1674 DEBUGPRINTF_COMPUTATION(("%s << %ld ", sc_print_hex(value1), shift_cnt));
1675 do_shl(val1, calc_buffer, shift_cnt, bitsize, sign);
1677 DEBUGPRINTF_COMPUTATION(("-> %s\n", sc_print_hex(calc_buffer)));
1679 if ((buffer != NULL) && (buffer != calc_buffer)) {
1680 memmove(buffer, calc_buffer, calc_buffer_size);
1684 void sc_shl(const void *val1, const void *val2, int bitsize, int sign, void *buffer) {
1685 long offset = sc_val_to_long(val2);
1687 sc_shlI(val1, offset, bitsize, sign, buffer);
1690 void sc_shrI(const void *val1, long shift_cnt, int bitsize, int sign, void *buffer) {
1693 DEBUGPRINTF_COMPUTATION(("%s >>u %ld ", sc_print_hex(value1), shift_cnt));
1694 do_shr(val1, calc_buffer, shift_cnt, bitsize, sign, 0);
1696 DEBUGPRINTF_COMPUTATION(("-> %s\n", sc_print_hex(calc_buffer)));
1698 if ((buffer != NULL) && (buffer != calc_buffer)) {
1699 memmove(buffer, calc_buffer, calc_buffer_size);
1703 void sc_shr(const void *val1, const void *val2, int bitsize, int sign, void *buffer) {
1704 long shift_cnt = sc_val_to_long(val2);
1706 sc_shrI(val1, shift_cnt, bitsize, sign, buffer);
1709 void sc_shrs(const void *val1, const void *val2, int bitsize, int sign, void *buffer) {
1710 long offset = sc_val_to_long(val2);
1714 DEBUGPRINTF_COMPUTATION(("%s >>s %ld ", sc_print_hex(value1), offset));
1715 do_shr(val1, calc_buffer, offset, bitsize, sign, 1);
1717 DEBUGPRINTF_COMPUTATION(("-> %s\n", sc_print_hex(calc_buffer)));
1719 if ((buffer != NULL) && (buffer != calc_buffer)) {
1720 memmove(buffer, calc_buffer, calc_buffer_size);
1724 void sc_rotl(const void *val1, const void *val2, int bitsize, int sign, void *buffer) {
1725 long offset = sc_val_to_long(val2);
1729 DEBUGPRINTF_COMPUTATION(("%s <<>> %ld ", sc_print_hex(value1), offset));
1730 do_rotl(val1, calc_buffer, offset, bitsize, sign);
1732 DEBUGPRINTF_COMPUTATION(("-> %s\n", sc_print_hex(calc_buffer)));
1734 if ((buffer != NULL) && (buffer != calc_buffer)) {
1735 memmove(buffer, calc_buffer, calc_buffer_size);
1739 void sc_zero(void *buffer) {
1741 buffer = calc_buffer;
1742 CLEAR_BUFFER(buffer);