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
34 # include <string.h> /* memset/memcmp */
36 #include <assert.h> /* assertions */
37 #include <stdio.h> /* output for error messages */
38 #include <limits.h> /* definition of LONG_MIN, used in sc_get_val_from_long */
45 * local definitions and macros
47 #define CLEAR_BUFFER(b) assert(b); memset(b, SC_0, calc_buffer_size)
48 #define _val(a) ((a)-SC_0)
49 #define _digit(a) ((a)+SC_0)
50 #define _bitisset(digit, pos) (and_table[_val(digit)][_val(shift_table[pos])] != SC_0)
52 #define fail_char(a, b, c, d) _fail_char((a), (b), (c), (d), __FILE__, __LINE__)
54 /* shortcut output for debugging */
55 # define sc_print_hex(a) sc_print((a), 0, SC_HEX, 0)
56 # define sc_print_dec(a) sc_print((a), 0, SC_DEC, 1)
57 # define sc_print_oct(a) sc_print((a), 0, SC_OCT, 0)
58 # define sc_print_bin(a) sc_print((a), 0, SC_BIN, 0)
60 #ifdef STRCALC_DEBUG_PRINTCOMP
61 # define DEBUGPRINTF_COMPUTATION(x) printf x
63 # define DEBUGPRINTF_COMPUTATION(x) ((void)0)
66 # define DEBUGPRINTF(x) printf x
68 # define DEBUGPRINTF(x) ((void)0)
75 static char *calc_buffer = NULL; /* buffer holding all results */
76 static char *output_buffer = NULL; /* buffer for output */
77 static int bit_pattern_size; /* maximum number of bits */
78 static int calc_buffer_size; /* size of internally stored values */
79 static int max_value_size; /* maximum size of values */
81 static int carry_flag; /**< some computation set the carry_flag:
82 - right shift if bits were lost due to shifting
83 - division if there was a remainder
84 However, the meaning of carry is machine dependent
85 and often defined in other ways! */
87 static const char sex_digit[4] = { SC_E, SC_C, SC_8, SC_0 };
88 static const char zex_digit[4] = { SC_1, SC_3, SC_7, SC_F };
89 static const char max_digit[4] = { SC_0, SC_1, SC_3, SC_7 };
90 static const char min_digit[4] = { SC_F, SC_E, SC_C, SC_8 };
92 static const char not_table[16] = { SC_F, SC_E, SC_D, SC_C, SC_B, SC_A, SC_9, SC_8,
93 SC_7, SC_6, SC_5, SC_4, SC_3, SC_2, SC_1, SC_0 };
95 static const char shift_table[4] = { SC_1, SC_2, SC_4, SC_8 };
97 static const char and_table[16][16] = {
98 { SC_0, SC_0, SC_0, SC_0, SC_0, SC_0, SC_0, SC_0,
99 SC_0, SC_0, SC_0, SC_0, SC_0, SC_0, SC_0, SC_0 },
101 { SC_0, SC_1, SC_0, SC_1, SC_0, SC_1, SC_0, SC_1,
102 SC_0, SC_1, SC_0, SC_1, SC_0, SC_1, SC_0, SC_1 },
104 { SC_0, SC_0, SC_2, SC_2, SC_0, SC_0, SC_2, SC_2,
105 SC_0, SC_0, SC_2, SC_2, SC_0, SC_0, SC_2, SC_2 },
107 { SC_0, SC_1, SC_2, SC_3, SC_0, SC_1, SC_2, SC_3,
108 SC_0, SC_1, SC_2, SC_3, SC_0, SC_1, SC_2, SC_3 },
110 { SC_0, SC_0, SC_0, SC_0, SC_4, SC_4, SC_4, SC_4,
111 SC_0, SC_0, SC_0, SC_0, SC_4, SC_4, SC_4, SC_4 },
113 { SC_0, SC_1, SC_0, SC_1, SC_4, SC_5, SC_4, SC_5,
114 SC_0, SC_1, SC_0, SC_1, SC_4, SC_5, SC_4, SC_5 },
116 { SC_0, SC_0, SC_2, SC_2, SC_4, SC_4, SC_6, SC_6,
117 SC_0, SC_0, SC_2, SC_2, SC_4, SC_4, SC_6, SC_6 },
119 { SC_0, SC_1, SC_2, SC_3, SC_4, SC_5, SC_6, SC_7,
120 SC_0, SC_1, SC_2, SC_3, SC_4, SC_5, SC_6, SC_7 },
122 { SC_0, SC_0, SC_0, SC_0, SC_0, SC_0, SC_0, SC_0,
123 SC_8, SC_8, SC_8, SC_8, SC_8, SC_8, SC_8, SC_8 },
125 { SC_0, SC_1, SC_0, SC_1, SC_0, SC_1, SC_0, SC_1,
126 SC_8, SC_9, SC_8, SC_9, SC_8, SC_9, SC_8, SC_9 },
128 { SC_0, SC_0, SC_2, SC_2, SC_0, SC_0, SC_2, SC_2,
129 SC_8, SC_8, SC_A, SC_A, SC_8, SC_8, SC_A, SC_A },
131 { SC_0, SC_1, SC_2, SC_3, SC_0, SC_1, SC_2, SC_3,
132 SC_8, SC_9, SC_A, SC_B, SC_8, SC_9, SC_A, SC_B },
134 { SC_0, SC_0, SC_0, SC_0, SC_4, SC_4, SC_4, SC_4,
135 SC_8, SC_8, SC_8, SC_8, SC_C, SC_C, SC_C, SC_C },
137 { SC_0, SC_1, SC_0, SC_1, SC_4, SC_5, SC_4, SC_5,
138 SC_8, SC_9, SC_8, SC_9, SC_C, SC_D, SC_C, SC_D },
140 { SC_0, SC_0, SC_2, SC_2, SC_4, SC_4, SC_6, SC_6,
141 SC_8, SC_8, SC_A, SC_A, SC_C, SC_C, SC_E, SC_E },
143 { SC_0, SC_1, SC_2, SC_3, SC_4, SC_5, SC_6, SC_7,
144 SC_8, SC_9, SC_A, SC_B, SC_C, SC_D, SC_E, SC_F } };
146 static const char or_table[16][16] = {
147 { SC_0, SC_1, SC_2, SC_3, SC_4, SC_5, SC_6, SC_7,
148 SC_8, SC_9, SC_A, SC_B, SC_C, SC_D, SC_E, SC_F },
150 { SC_1, SC_1, SC_3, SC_3, SC_5, SC_5, SC_7, SC_7,
151 SC_9, SC_9, SC_B, SC_B, SC_D, SC_D, SC_F, SC_F },
153 { SC_2, SC_3, SC_2, SC_3, SC_6, SC_7, SC_6, SC_7,
154 SC_A, SC_B, SC_A, SC_B, SC_E, SC_F, SC_E, SC_F },
156 { SC_3, SC_3, SC_3, SC_3, SC_7, SC_7, SC_7, SC_7,
157 SC_B, SC_B, SC_B, SC_B, SC_F, SC_F, SC_F, SC_F },
159 { SC_4, SC_5, SC_6, SC_7, SC_4, SC_5, SC_6, SC_7,
160 SC_C, SC_D, SC_E, SC_F, SC_C, SC_D, SC_E, SC_F },
162 { SC_5, SC_5, SC_7, SC_7, SC_5, SC_5, SC_7, SC_7,
163 SC_D, SC_D, SC_F, SC_F, SC_D, SC_D, SC_F, SC_F },
165 { SC_6, SC_7, SC_6, SC_7, SC_6, SC_7, SC_6, SC_7,
166 SC_E, SC_F, SC_E, SC_F, SC_E, SC_F, SC_E, SC_F },
168 { SC_7, SC_7, SC_7, SC_7, SC_7, SC_7, SC_7, SC_7,
169 SC_F, SC_F, SC_F, SC_F, SC_F, SC_F, SC_F, SC_F },
171 { SC_8, SC_9, SC_A, SC_B, SC_C, SC_D, SC_E, SC_F,
172 SC_8, SC_9, SC_A, SC_B, SC_C, SC_D, SC_E, SC_F },
174 { SC_9, SC_9, SC_B, SC_B, SC_D, SC_D, SC_F, SC_F,
175 SC_9, SC_9, SC_B, SC_B, SC_D, SC_D, SC_F, SC_F },
177 { SC_A, SC_B, SC_A, SC_B, SC_E, SC_F, SC_E, SC_F,
178 SC_A, SC_B, SC_A, SC_B, SC_E, SC_F, SC_E, SC_F },
180 { SC_B, SC_B, SC_B, SC_B, SC_F, SC_F, SC_F, SC_F,
181 SC_B, SC_B, SC_B, SC_B, SC_F, SC_F, SC_F, SC_F },
183 { SC_C, SC_D, SC_E, SC_F, SC_C, SC_D, SC_E, SC_F,
184 SC_C, SC_D, SC_E, SC_F, SC_C, SC_D, SC_E, SC_F },
186 { SC_D, SC_D, SC_F, SC_F, SC_D, SC_D, SC_F, SC_F,
187 SC_D, SC_D, SC_F, SC_F, SC_D, SC_D, SC_F, SC_F },
189 { SC_E, SC_F, SC_E, SC_F, SC_E, SC_F, SC_E, SC_F,
190 SC_E, SC_F, SC_E, SC_F, SC_E, SC_F, SC_E, SC_F },
192 { SC_F, SC_F, SC_F, SC_F, SC_F, SC_F, SC_F, SC_F,
193 SC_F, SC_F, SC_F, SC_F, SC_F, SC_F, SC_F, SC_F } };
195 static char const xor_table[16][16] = {
196 { SC_0, SC_1, SC_2, SC_3, SC_4, SC_5, SC_6, SC_7,
197 SC_8, SC_9, SC_A, SC_B, SC_C, SC_D, SC_E, SC_F },
199 { SC_1, SC_0, SC_3, SC_2, SC_5, SC_4, SC_7, SC_6,
200 SC_9, SC_8, SC_B, SC_A, SC_D, SC_C, SC_F, SC_E },
202 { SC_2, SC_3, SC_0, SC_1, SC_6, SC_7, SC_4, SC_5,
203 SC_A, SC_B, SC_8, SC_9, SC_E, SC_F, SC_C, SC_D },
205 { SC_3, SC_2, SC_1, SC_0, SC_7, SC_6, SC_5, SC_4,
206 SC_B, SC_A, SC_9, SC_8, SC_F, SC_E, SC_D, SC_C },
208 { SC_4, SC_5, SC_6, SC_7, SC_0, SC_1, SC_2, SC_3,
209 SC_C, SC_D, SC_E, SC_F, SC_8, SC_9, SC_A, SC_B },
211 { SC_5, SC_4, SC_7, SC_6, SC_1, SC_0, SC_3, SC_2,
212 SC_D, SC_C, SC_F, SC_E, SC_9, SC_8, SC_B, SC_A },
214 { SC_6, SC_7, SC_4, SC_5, SC_2, SC_3, SC_0, SC_1,
215 SC_E, SC_F, SC_C, SC_D, SC_A, SC_B, SC_8, SC_9 },
217 { SC_7, SC_6, SC_5, SC_4, SC_3, SC_2, SC_1, SC_0,
218 SC_F, SC_E, SC_D, SC_C, SC_B, SC_A, SC_9, SC_8 },
220 { SC_8, SC_9, SC_A, SC_B, SC_C, SC_D, SC_E, SC_F,
221 SC_0, SC_1, SC_2, SC_3, SC_4, SC_5, SC_6, SC_7 },
223 { SC_9, SC_8, SC_B, SC_A, SC_D, SC_C, SC_F, SC_E,
224 SC_1, SC_0, SC_3, SC_2, SC_5, SC_4, SC_7, SC_6 },
226 { SC_A, SC_B, SC_8, SC_9, SC_E, SC_F, SC_C, SC_D,
227 SC_2, SC_3, SC_0, SC_1, SC_6, SC_7, SC_4, SC_5 },
229 { SC_B, SC_A, SC_9, SC_8, SC_F, SC_E, SC_D, SC_C,
230 SC_3, SC_2, SC_1, SC_0, SC_7, SC_6, SC_5, SC_4 },
232 { SC_C, SC_D, SC_E, SC_F, SC_8, SC_9, SC_A, SC_B,
233 SC_4, SC_5, SC_6, SC_7, SC_0, SC_1, SC_2, SC_3 },
235 { SC_D, SC_C, SC_F, SC_E, SC_9, SC_8, SC_B, SC_A,
236 SC_5, SC_4, SC_7, SC_6, SC_1, SC_0, SC_3, SC_2 },
238 { SC_E, SC_F, SC_C, SC_D, SC_A, SC_B, SC_8, SC_9,
239 SC_6, SC_7, SC_4, SC_5, SC_2, SC_3, SC_0, SC_1 },
241 { SC_F, SC_E, SC_D, SC_C, SC_B, SC_A, SC_9, SC_8,
242 SC_7, SC_6, SC_5, SC_4, SC_3, SC_2, SC_1, SC_0 }
245 static char const add_table[16][16][2] = {
246 { {SC_0, SC_0}, {SC_1, SC_0}, {SC_2, SC_0}, {SC_3, SC_0},
247 {SC_4, SC_0}, {SC_5, SC_0}, {SC_6, SC_0}, {SC_7, SC_0},
248 {SC_8, SC_0}, {SC_9, SC_0}, {SC_A, SC_0}, {SC_B, SC_0},
249 {SC_C, SC_0}, {SC_D, SC_0}, {SC_E, SC_0}, {SC_F, SC_0} },
251 { {SC_1, SC_0}, {SC_2, SC_0}, {SC_3, SC_0}, {SC_4, SC_0},
252 {SC_5, SC_0}, {SC_6, SC_0}, {SC_7, SC_0}, {SC_8, SC_0},
253 {SC_9, SC_0}, {SC_A, SC_0}, {SC_B, SC_0}, {SC_C, SC_0},
254 {SC_D, SC_0}, {SC_E, SC_0}, {SC_F, SC_0}, {SC_0, SC_1} },
256 { {SC_2, SC_0}, {SC_3, SC_0}, {SC_4, SC_0}, {SC_5, SC_0},
257 {SC_6, SC_0}, {SC_7, SC_0}, {SC_8, SC_0}, {SC_9, SC_0},
258 {SC_A, SC_0}, {SC_B, SC_0}, {SC_C, SC_0}, {SC_D, SC_0},
259 {SC_E, SC_0}, {SC_F, SC_0}, {SC_0, SC_1}, {SC_1, SC_1} },
261 { {SC_3, SC_0}, {SC_4, SC_0}, {SC_5, SC_0}, {SC_6, SC_0},
262 {SC_7, SC_0}, {SC_8, SC_0}, {SC_9, SC_0}, {SC_A, SC_0},
263 {SC_B, SC_0}, {SC_C, SC_0}, {SC_D, SC_0}, {SC_E, SC_0},
264 {SC_F, SC_0}, {SC_0, SC_1}, {SC_1, SC_1}, {SC_2, SC_1} },
266 { {SC_4, SC_0}, {SC_5, SC_0}, {SC_6, SC_0}, {SC_7, SC_0},
267 {SC_8, SC_0}, {SC_9, SC_0}, {SC_A, SC_0}, {SC_B, SC_0},
268 {SC_C, SC_0}, {SC_D, SC_0}, {SC_E, SC_0}, {SC_F, SC_0},
269 {SC_0, SC_1}, {SC_1, SC_1}, {SC_2, SC_1}, {SC_3, SC_1} },
271 { {SC_5, SC_0}, {SC_6, SC_0}, {SC_7, SC_0}, {SC_8, SC_0},
272 {SC_9, SC_0}, {SC_A, SC_0}, {SC_B, SC_0}, {SC_C, SC_0},
273 {SC_D, SC_0}, {SC_E, SC_0}, {SC_F, SC_0}, {SC_0, SC_1},
274 {SC_1, SC_1}, {SC_2, SC_1}, {SC_3, SC_1}, {SC_4, SC_1} },
276 { {SC_6, SC_0}, {SC_7, SC_0}, {SC_8, SC_0}, {SC_9, SC_0},
277 {SC_A, SC_0}, {SC_B, SC_0}, {SC_C, SC_0}, {SC_D, SC_0},
278 {SC_E, SC_0}, {SC_F, SC_0}, {SC_0, SC_1}, {SC_1, SC_1},
279 {SC_2, SC_1}, {SC_3, SC_1}, {SC_4, SC_1}, {SC_5, SC_1} },
281 { {SC_7, SC_0}, {SC_8, SC_0}, {SC_9, SC_0}, {SC_A, SC_0},
282 {SC_B, SC_0}, {SC_C, SC_0}, {SC_D, SC_0}, {SC_E, SC_0},
283 {SC_F, SC_0}, {SC_0, SC_1}, {SC_1, SC_1}, {SC_2, SC_1},
284 {SC_3, SC_1}, {SC_4, SC_1}, {SC_5, SC_1}, {SC_6, SC_1} },
286 { {SC_8, SC_0}, {SC_9, SC_0}, {SC_A, SC_0}, {SC_B, SC_0},
287 {SC_C, SC_0}, {SC_D, SC_0}, {SC_E, SC_0}, {SC_F, SC_0},
288 {SC_0, SC_1}, {SC_1, SC_1}, {SC_2, SC_1}, {SC_3, SC_1},
289 {SC_4, SC_1}, {SC_5, SC_1}, {SC_6, SC_1}, {SC_7, SC_1} },
291 { {SC_9, SC_0}, {SC_A, SC_0}, {SC_B, SC_0}, {SC_C, SC_0},
292 {SC_D, SC_0}, {SC_E, SC_0}, {SC_F, SC_0}, {SC_0, SC_1},
293 {SC_1, SC_1}, {SC_2, SC_1}, {SC_3, SC_1}, {SC_4, SC_1},
294 {SC_5, SC_1}, {SC_6, SC_1}, {SC_7, SC_1}, {SC_8, SC_1} },
296 { {SC_A, SC_0}, {SC_B, SC_0}, {SC_C, SC_0}, {SC_D, SC_0},
297 {SC_E, SC_0}, {SC_F, SC_0}, {SC_0, SC_1}, {SC_1, SC_1},
298 {SC_2, SC_1}, {SC_3, SC_1}, {SC_4, SC_1}, {SC_5, SC_1},
299 {SC_6, SC_1}, {SC_7, SC_1}, {SC_8, SC_1}, {SC_9, SC_1} },
301 { {SC_B, SC_0}, {SC_C, SC_0}, {SC_D, SC_0}, {SC_E, SC_0},
302 {SC_F, SC_0}, {SC_0, SC_1}, {SC_1, SC_1}, {SC_2, SC_1},
303 {SC_3, SC_1}, {SC_4, SC_1}, {SC_5, SC_1}, {SC_6, SC_1},
304 {SC_7, SC_1}, {SC_8, SC_1}, {SC_9, SC_1}, {SC_A, SC_1} },
306 { {SC_C, SC_0}, {SC_D, SC_0}, {SC_E, SC_0}, {SC_F, SC_0},
307 {SC_0, SC_1}, {SC_1, SC_1}, {SC_2, SC_1}, {SC_3, SC_1},
308 {SC_4, SC_1}, {SC_5, SC_1}, {SC_6, SC_1}, {SC_7, SC_1},
309 {SC_8, SC_1}, {SC_9, SC_1}, {SC_A, SC_1}, {SC_B, SC_1} },
311 { {SC_D, SC_0}, {SC_E, SC_0}, {SC_F, SC_0}, {SC_0, SC_1},
312 {SC_1, SC_1}, {SC_2, SC_1}, {SC_3, SC_1}, {SC_4, SC_1},
313 {SC_5, SC_1}, {SC_6, SC_1}, {SC_7, SC_1}, {SC_8, SC_1},
314 {SC_9, SC_1}, {SC_A, SC_1}, {SC_B, SC_1}, {SC_C, SC_1} },
316 { {SC_E, SC_0}, {SC_F, SC_0}, {SC_0, SC_1}, {SC_1, SC_1},
317 {SC_2, SC_1}, {SC_3, SC_1}, {SC_4, SC_1}, {SC_5, SC_1},
318 {SC_6, SC_1}, {SC_7, SC_1}, {SC_8, SC_1}, {SC_9, SC_1},
319 {SC_A, SC_1}, {SC_B, SC_1}, {SC_C, SC_1}, {SC_D, SC_1} },
321 { {SC_F, SC_0}, {SC_0, SC_1}, {SC_1, SC_1}, {SC_2, SC_1},
322 {SC_3, SC_1}, {SC_4, SC_1}, {SC_5, SC_1}, {SC_6, SC_1},
323 {SC_7, SC_1}, {SC_8, SC_1}, {SC_9, SC_1}, {SC_A, SC_1},
324 {SC_B, SC_1}, {SC_C, SC_1}, {SC_D, SC_1}, {SC_E, SC_1} }
327 static char const mul_table[16][16][2] = {
328 { {SC_0, SC_0}, {SC_0, SC_0}, {SC_0, SC_0}, {SC_0, SC_0},
329 {SC_0, SC_0}, {SC_0, SC_0}, {SC_0, SC_0}, {SC_0, SC_0},
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} },
333 { {SC_0, SC_0}, {SC_1, SC_0}, {SC_2, SC_0}, {SC_3, SC_0},
334 {SC_4, SC_0}, {SC_5, SC_0}, {SC_6, SC_0}, {SC_7, SC_0},
335 {SC_8, SC_0}, {SC_9, SC_0}, {SC_A, SC_0}, {SC_B, SC_0},
336 {SC_C, SC_0}, {SC_D, SC_0}, {SC_E, SC_0}, {SC_F, SC_0} },
338 { {SC_0, SC_0}, {SC_2, SC_0}, {SC_4, SC_0}, {SC_6, SC_0},
339 {SC_8, SC_0}, {SC_A, SC_0}, {SC_C, SC_0}, {SC_E, SC_0},
340 {SC_0, SC_1}, {SC_2, SC_1}, {SC_4, SC_1}, {SC_6, SC_1},
341 {SC_8, SC_1}, {SC_A, SC_1}, {SC_C, SC_1}, {SC_E, SC_1} },
343 { {SC_0, SC_0}, {SC_3, SC_0}, {SC_6, SC_0}, {SC_9, SC_0},
344 {SC_C, SC_0}, {SC_F, SC_0}, {SC_2, SC_1}, {SC_5, SC_1},
345 {SC_8, SC_1}, {SC_B, SC_1}, {SC_E, SC_1}, {SC_1, SC_2},
346 {SC_4, SC_2}, {SC_7, SC_2}, {SC_A, SC_2}, {SC_D, SC_2} },
348 { {SC_0, SC_0}, {SC_4, SC_0}, {SC_8, SC_0}, {SC_C, SC_0},
349 {SC_0, SC_1}, {SC_4, SC_1}, {SC_8, SC_1}, {SC_C, SC_1},
350 {SC_0, SC_2}, {SC_4, SC_2}, {SC_8, SC_2}, {SC_C, SC_2},
351 {SC_0, SC_3}, {SC_4, SC_3}, {SC_8, SC_3}, {SC_C, SC_3} },
353 { {SC_0, SC_0}, {SC_5, SC_0}, {SC_A, SC_0}, {SC_F, SC_0},
354 {SC_4, SC_1}, {SC_9, SC_1}, {SC_E, SC_1}, {SC_3, SC_2},
355 {SC_8, SC_2}, {SC_D, SC_2}, {SC_2, SC_3}, {SC_7, SC_3},
356 {SC_C, SC_3}, {SC_1, SC_4}, {SC_6, SC_4}, {SC_B, SC_4} },
358 { {SC_0, SC_0}, {SC_6, SC_0}, {SC_C, SC_0}, {SC_2, SC_1},
359 {SC_8, SC_1}, {SC_E, SC_1}, {SC_4, SC_2}, {SC_A, SC_2},
360 {SC_0, SC_3}, {SC_6, SC_3}, {SC_C, SC_3}, {SC_2, SC_4},
361 {SC_8, SC_4}, {SC_E, SC_4}, {SC_4, SC_5}, {SC_A, SC_5} },
363 { {SC_0, SC_0}, {SC_7, SC_0}, {SC_E, SC_0}, {SC_5, SC_1},
364 {SC_C, SC_1}, {SC_3, SC_2}, {SC_A, SC_2}, {SC_1, SC_3},
365 {SC_8, SC_3}, {SC_F, SC_3}, {SC_6, SC_4}, {SC_D, SC_4},
366 {SC_4, SC_5}, {SC_B, SC_5}, {SC_2, SC_6}, {SC_9, SC_6} },
368 { {SC_0, SC_0}, {SC_8, SC_0}, {SC_0, SC_1}, {SC_8, SC_1},
369 {SC_0, SC_2}, {SC_8, SC_2}, {SC_0, SC_3}, {SC_8, SC_3},
370 {SC_0, SC_4}, {SC_8, SC_4}, {SC_0, SC_5}, {SC_8, SC_5},
371 {SC_0, SC_6}, {SC_8, SC_6}, {SC_0, SC_7}, {SC_8, SC_7} },
373 { {SC_0, SC_0}, {SC_9, SC_0}, {SC_2, SC_1}, {SC_B, SC_1},
374 {SC_4, SC_2}, {SC_D, SC_2}, {SC_6, SC_3}, {SC_F, SC_3},
375 {SC_8, SC_4}, {SC_1, SC_5}, {SC_A, SC_5}, {SC_3, SC_6},
376 {SC_C, SC_6}, {SC_5, SC_7}, {SC_E, SC_7}, {SC_7, SC_8} },
378 { {SC_0, SC_0}, {SC_A, SC_0}, {SC_4, SC_1}, {SC_E, SC_1},
379 {SC_8, SC_2}, {SC_2, SC_3}, {SC_C, SC_3}, {SC_6, SC_4},
380 {SC_0, SC_5}, {SC_A, SC_5}, {SC_4, SC_6}, {SC_E, SC_6},
381 {SC_8, SC_7}, {SC_2, SC_8}, {SC_C, SC_8}, {SC_6, SC_9} },
383 { {SC_0, SC_0}, {SC_B, SC_0}, {SC_6, SC_1}, {SC_1, SC_2},
384 {SC_C, SC_2}, {SC_7, SC_3}, {SC_2, SC_4}, {SC_D, SC_4},
385 {SC_8, SC_5}, {SC_3, SC_6}, {SC_E, SC_6}, {SC_9, SC_7},
386 {SC_4, SC_8}, {SC_F, SC_8}, {SC_A, SC_9}, {SC_5, SC_A} },
388 { {SC_0, SC_0}, {SC_C, SC_0}, {SC_8, SC_1}, {SC_4, SC_2},
389 {SC_0, SC_3}, {SC_C, SC_3}, {SC_8, SC_4}, {SC_4, SC_5},
390 {SC_0, SC_6}, {SC_C, SC_6}, {SC_8, SC_7}, {SC_4, SC_8},
391 {SC_0, SC_9}, {SC_C, SC_9}, {SC_8, SC_A}, {SC_4, SC_B} },
393 { {SC_0, SC_0}, {SC_D, SC_0}, {SC_A, SC_1}, {SC_7, SC_2},
394 {SC_4, SC_3}, {SC_1, SC_4}, {SC_E, SC_4}, {SC_B, SC_5},
395 {SC_8, SC_6}, {SC_5, SC_7}, {SC_2, SC_8}, {SC_F, SC_8},
396 {SC_C, SC_9}, {SC_9, SC_A}, {SC_6, SC_B}, {SC_3, SC_C} },
398 { {SC_0, SC_0}, {SC_E, SC_0}, {SC_C, SC_1}, {SC_A, SC_2},
399 {SC_8, SC_3}, {SC_6, SC_4}, {SC_4, SC_5}, {SC_2, SC_6},
400 {SC_0, SC_7}, {SC_E, SC_7}, {SC_C, SC_8}, {SC_A, SC_9},
401 {SC_8, SC_A}, {SC_6, SC_B}, {SC_4, SC_C}, {SC_2, SC_D} },
403 { {SC_0, SC_0}, {SC_F, SC_0}, {SC_E, SC_1}, {SC_D, SC_2},
404 {SC_C, SC_3}, {SC_B, SC_4}, {SC_A, SC_5}, {SC_9, SC_6},
405 {SC_8, SC_7}, {SC_7, SC_8}, {SC_6, SC_9}, {SC_5, SC_A},
406 {SC_4, SC_B}, {SC_3, SC_C}, {SC_2, SC_D}, {SC_1, SC_E} }
409 static char const shrs_table[16][4][2] = {
410 { {SC_0, SC_0}, {SC_0, SC_0}, {SC_0, SC_0}, {SC_0, SC_0} },
411 { {SC_1, SC_0}, {SC_0, SC_8}, {SC_0, SC_4}, {SC_0, SC_2} },
412 { {SC_2, SC_0}, {SC_1, SC_0}, {SC_0, SC_8}, {SC_0, SC_4} },
413 { {SC_3, SC_0}, {SC_1, SC_8}, {SC_0, SC_C}, {SC_0, SC_6} },
414 { {SC_4, SC_0}, {SC_2, SC_0}, {SC_1, SC_0}, {SC_0, SC_8} },
415 { {SC_5, SC_0}, {SC_2, SC_8}, {SC_1, SC_4}, {SC_0, SC_A} },
416 { {SC_6, SC_0}, {SC_3, SC_0}, {SC_1, SC_8}, {SC_0, SC_C} },
417 { {SC_7, SC_0}, {SC_3, SC_8}, {SC_1, SC_C}, {SC_0, SC_E} },
418 { {SC_8, SC_0}, {SC_4, SC_0}, {SC_2, SC_0}, {SC_1, SC_0} },
419 { {SC_9, SC_0}, {SC_4, SC_8}, {SC_2, SC_4}, {SC_1, SC_2} },
420 { {SC_A, SC_0}, {SC_5, SC_0}, {SC_2, SC_8}, {SC_1, SC_4} },
421 { {SC_B, SC_0}, {SC_5, SC_8}, {SC_2, SC_C}, {SC_1, SC_6} },
422 { {SC_C, SC_0}, {SC_6, SC_0}, {SC_3, SC_0}, {SC_1, SC_8} },
423 { {SC_D, SC_0}, {SC_6, SC_8}, {SC_3, SC_4}, {SC_1, SC_A} },
424 { {SC_E, SC_0}, {SC_7, SC_0}, {SC_3, SC_8}, {SC_1, SC_C} },
425 { {SC_F, SC_0}, {SC_7, SC_8}, {SC_3, SC_C}, {SC_1, SC_E} }
428 /** converting a digit to a binary string */
429 static const char *binary_table[16] = {
430 "0000", "0001", "0010", "0011", "0100", "0101", "0110", "0111",
431 "1000", "1001", "1010", "1011", "1100", "1101", "1110", "1111"
434 /*****************************************************************************
436 *****************************************************************************/
437 static void _fail_char(const char *str, size_t len, const char fchar, int pos,
438 const char *file, int line) {
440 printf("Unexpected character '%c' in %s:%d\n", fchar, file, line);
441 while (len-- && *str) printf("%c", *str++); printf("\n");
442 while (--pos) printf(" "); printf("^\n");
447 * implements the bitwise NOT operation
449 static void do_bitnot(const char *val, char *buffer) {
452 for (counter = 0; counter<calc_buffer_size; counter++)
453 buffer[counter] = not_table[_val(val[counter])];
457 * implements the bitwise OR operation
459 static void do_bitor(const char *val1, const char *val2, char *buffer) {
462 for (counter = 0; counter<calc_buffer_size; counter++)
463 buffer[counter] = or_table[_val(val1[counter])][_val(val2[counter])];
467 * implements the bitwise eXclusive OR operation
469 static void do_bitxor(const char *val1, const char *val2, char *buffer) {
472 for (counter = 0; counter<calc_buffer_size; counter++)
473 buffer[counter] = xor_table[_val(val1[counter])][_val(val2[counter])];
477 * implements the bitwise AND operation
479 static void do_bitand(const char *val1, const char *val2, char *buffer) {
482 for (counter = 0; counter<calc_buffer_size; counter++)
483 buffer[counter] = and_table[_val(val1[counter])][_val(val2[counter])];
487 * returns the sign bit.
489 * @todo This implementation is wrong, as it returns the highest bit of the buffer
490 * NOT the highest bit depending on the real mode
492 static int do_sign(const char *val) {
493 return (val[calc_buffer_size-1] <= SC_7) ? (1) : (-1);
497 * returns non-zero if bit at position pos is set
499 static int do_bit(const char *val, int pos) {
501 int nibble = pos >> 2;
503 return _bitisset(val[nibble], bit);
507 * Implements a fast ADD + 1
509 static void do_inc(const char *val, char *buffer) {
512 while (counter++ < calc_buffer_size) {
517 /* No carry here, *val != SC_F */
518 *buffer = add_table[_val(*val)][SC_1][0];
522 /* here a carry could be lost, this is intended because this should
523 * happen only when a value changes sign. */
527 * Implements a unary MINUS
529 static void do_negate(const char *val, char *buffer) {
530 do_bitnot(val, buffer);
531 do_inc(buffer, buffer);
535 * Implements a binary ADD
537 * @todo The implementation of carry is wrong, as it is the
538 * calc_buffer_size carry, not the mode depending
540 static void do_add(const char *val1, const char *val2, char *buffer) {
542 const char *add1, *add2;
545 for (counter = 0; counter < calc_buffer_size; counter++) {
546 add1 = add_table[_val(val1[counter])][_val(val2[counter])];
547 add2 = add_table[_val(add1[0])][_val(carry)];
548 /* carry might be zero */
549 buffer[counter] = add2[0];
550 carry = add_table[_val(add1[1])][_val(add2[1])][0];
552 carry_flag = carry != SC_0;
556 * Implements a binary SUB
558 static void do_sub(const char *val1, const char *val2, char *buffer) {
559 char *temp_buffer = alloca(calc_buffer_size); /* intermediate buffer to hold -val2 */
561 do_negate(val2, temp_buffer);
562 do_add(val1, temp_buffer, buffer);
566 * Implements a binary MUL
568 static void do_mul(const char *val1, const char *val2, char *buffer) {
569 char *temp_buffer; /* result buffer */
570 char *neg_val1; /* abs of val1 */
571 char *neg_val2; /* abs of val2 */
573 const char *mul, *add1, *add2; /* intermediate result containers */
574 char carry = SC_0; /* container for carries */
575 char sign = 0; /* marks result sign */
576 int c_inner, c_outer; /* loop counters */
578 temp_buffer = alloca(calc_buffer_size);
579 neg_val1 = alloca(calc_buffer_size);
580 neg_val2 = alloca(calc_buffer_size);
582 /* init result buffer to zeros */
583 memset(temp_buffer, SC_0, calc_buffer_size);
585 /* the multiplication works only for positive values, for negative values *
586 * it is necessary to negate them and adjust the result accordingly */
587 if (do_sign(val1) == -1) {
588 do_negate(val1, neg_val1);
592 if (do_sign(val2) == -1) {
593 do_negate(val2, neg_val2);
598 for (c_outer = 0; c_outer < max_value_size; c_outer++) {
599 if (val2[c_outer] != SC_0) {
600 for (c_inner = 0; c_inner < max_value_size; c_inner++) {
601 /* do the following calculation: *
602 * Add the current carry, the value at position c_outer+c_inner *
603 * and the result of the multiplication of val1[c_inner] and *
604 * val2[c_outer]. This is the usual pen-and-paper multiplication. */
606 /* multiplicate the two digits */
607 mul = mul_table[_val(val1[c_inner])][_val(val2[c_outer])];
608 /* add old value to result of multiplication */
609 add1 = add_table[_val(temp_buffer[c_inner + c_outer])][_val(mul[0])];
610 /* add carry to the sum */
611 add2 = add_table[_val(add1[0])][_val(carry)];
613 /* all carries together result in new carry. This is always smaller *
615 * Both multiplicands, the carry and the value already in the temp *
616 * buffer are single digits and their value is therefore at most *
619 * (b-1)(b-1)+(b-1)+(b-1) = b*b-1 *
620 * The tables list all operations rem b, so the carry is at most *
621 * (b*b-1)rem b = -1rem b = b-1 */
622 carry = add_table[_val(mul[1])][_val(add1[1])][0];
623 carry = add_table[_val(carry)][_val(add2[1])][0];
625 temp_buffer[c_inner + c_outer] = add2[0];
628 /* A carry may hang over */
629 /* c_outer is always smaller than max_value_size! */
630 temp_buffer[max_value_size + c_outer] = carry;
636 do_negate(temp_buffer, buffer);
638 memcpy(buffer, temp_buffer, calc_buffer_size);
642 * Shift the buffer to left and add a 4 bit digit
644 static void do_push(const char digit, char *buffer) {
647 for (counter = calc_buffer_size - 2; counter >= 0; counter--) {
648 buffer[counter+1] = buffer[counter];
654 * Implements truncating integer division and remainder.
656 * Note: This is MOST slow
658 static void do_divmod(const char *rDividend, const char *divisor, char *quot, char *rem) {
659 const char *dividend = rDividend;
660 const char *minus_divisor;
664 char div_sign = 0; /* remember division result sign */
665 char rem_sign = 0; /* remember remainder result sign */
667 int c_dividend; /* loop counters */
669 neg_val1 = alloca(calc_buffer_size);
670 neg_val2 = alloca(calc_buffer_size);
672 /* clear result buffer */
673 memset(quot, SC_0, calc_buffer_size);
674 memset(rem, SC_0, calc_buffer_size);
676 /* if the divisor is zero this won't work (quot is zero) */
677 if (sc_comp(divisor, quot) == 0) assert(0 && "division by zero!");
679 /* if the dividend is zero result is zero (quot is zero) */
680 if (sc_comp(dividend, quot) == 0)
683 if (do_sign(dividend) == -1) {
684 do_negate(dividend, neg_val1);
690 do_negate(divisor, neg_val2);
691 if (do_sign(divisor) == -1) {
693 minus_divisor = divisor;
696 minus_divisor = neg_val2;
698 /* if divisor >= dividend division is easy
699 * (remember these are absolute values) */
700 switch (sc_comp(dividend, divisor)) {
701 case 0: /* dividend == divisor */
705 case -1: /* dividend < divisor */
706 memcpy(rem, rDividend, calc_buffer_size);
709 default: /* unluckily division is necessary :( */
713 for (c_dividend = calc_buffer_size - 1; c_dividend >= 0; c_dividend--) {
714 do_push(dividend[c_dividend], rem);
717 if (sc_comp(rem, divisor) != -1) { /* remainder >= divisor */
718 /* subtract until the remainder becomes negative, this should
719 * be faster than comparing remainder with divisor */
720 do_add(rem, minus_divisor, rem);
722 while (do_sign(rem) == 1) {
723 quot[0] = add_table[_val(quot[0])][SC_1][0];
724 do_add(rem, minus_divisor, rem);
727 /* subtracted one too much */
728 do_add(rem, divisor, rem);
732 /* sets carry if remainder is non-zero ??? */
733 carry_flag = !sc_is_zero(rem);
736 do_negate(quot, quot);
743 * Implements a Shift Left, which can either preserve the sign bit
746 * @todo Assertions seems to be wrong
748 static void do_shl(const char *val1, char *buffer, long shift_cnt, int bitsize, unsigned is_signed) {
756 assert((shift_cnt >= 0) || (0 && "negative leftshift"));
757 assert(((do_sign(val1) != -1) || is_signed) || (0 && "unsigned mode and negative value"));
758 assert(((!_bitisset(val1[(bitsize-1)/4], (bitsize-1)%4)) || !is_signed || (do_sign(val1) == -1)) || (0 && "value is positive, should be negative"));
759 assert(((_bitisset(val1[(bitsize-1)/4], (bitsize-1)%4)) || !is_signed || (do_sign(val1) == 1)) || (0 && "value is negative, should be positive"));
761 /* if shifting far enough the result is zero */
762 if (shift_cnt >= bitsize) {
763 memset(buffer, SC_0, calc_buffer_size);
767 shift = shift_table[_val(shift_cnt%4)]; /* this is 2 ** (offset % 4) */
768 shift_cnt = shift_cnt / 4;
770 /* shift the single digits some bytes (offset) and some bits (table)
772 for (counter = 0; counter < bitsize/4 - shift_cnt; counter++) {
773 shl = mul_table[_val(val1[counter])][_val(shift)];
774 buffer[counter + shift_cnt] = or_table[_val(shl[0])][_val(carry)];
778 shl = mul_table[_val(val1[counter])][_val(shift)];
779 buffer[counter + shift_cnt] = or_table[_val(shl[0])][_val(carry)];
782 bitoffset = counter - 1;
785 /* fill with zeroes */
786 for (counter = 0; counter < shift_cnt; counter++)
787 buffer[counter] = SC_0;
789 /* if the mode was signed, change sign when the mode's msb is now 1 */
790 shift_cnt = bitoffset + shift_cnt;
791 bitoffset = (bitsize-1) % 4;
792 if (is_signed && _bitisset(buffer[shift_cnt], bitoffset)) {
793 /* this sets the upper bits of the leftmost digit */
794 buffer[shift_cnt] = or_table[_val(buffer[shift_cnt])][_val(min_digit[bitoffset])];
795 for (counter = shift_cnt+1; counter < calc_buffer_size; counter++) {
796 buffer[counter] = SC_F;
798 } else if (is_signed && !_bitisset(buffer[shift_cnt], bitoffset)) {
799 /* this clears the upper bits of the leftmost digit */
800 buffer[shift_cnt] = and_table[_val(buffer[shift_cnt])][_val(max_digit[bitoffset])];
801 for (counter = shift_cnt+1; counter < calc_buffer_size; counter++) {
802 buffer[counter] = SC_0;
808 * Implements a Shift Right, which can either preserve the sign bit
811 * @param bitsize bitsize of the value to be shifted
813 * @todo Assertions seems to be wrong
815 static void do_shr(const char *val1, char *buffer, long shift_cnt, int bitsize, unsigned is_signed, int signed_shift) {
820 int shift_mod, shift_nib;
825 assert((shift_cnt >= 0) || (0 && "negative rightshift"));
826 assert(((!_bitisset(val1[(bitsize-1)/4], (bitsize-1)%4)) || !is_signed || (do_sign(val1) == -1)) || (0 && "value is positive, should be negative"));
827 assert(((_bitisset(val1[(bitsize-1)/4], (bitsize-1)%4)) || !is_signed || (do_sign(val1) == 1)) || (0 && "value is negative, should be positive"));
829 sign = signed_shift && do_bit(val1, bitsize - 1) ? SC_F : SC_0;
831 /* if shifting far enough the result is either 0 or -1 */
832 if (shift_cnt >= bitsize) {
833 if (!sc_is_zero(val1)) {
836 memset(buffer, sign, calc_buffer_size);
840 shift_mod = shift_cnt & 3;
841 shift_nib = shift_cnt >> 2;
843 /* check if any bits are lost, and set carry_flag if so */
844 for (counter = 0; counter < shift_nib; ++counter) {
845 if (val1[counter] != 0) {
850 if ((_val(val1[counter]) & ((1<<shift_mod)-1)) != 0)
853 /* shift digits to the right with offset, carry and all */
855 if ((bitsize >> 2) > shift_nib) {
856 buffer[counter] = shrs_table[_val(val1[shift_nib])][shift_mod][0];
859 for (; counter < bitsize/4 - shift_nib; counter++) {
860 shrs = shrs_table[_val(val1[counter + shift_nib])][shift_mod];
861 buffer[counter] = shrs[0];
862 buffer[counter-1] = or_table[_val(buffer[counter-1])][_val(shrs[1])];
865 /* the last digit is special in regard of signed/unsigned shift */
866 bitoffset = bitsize & 3;
867 msd = sign; /* most significant digit */
869 /* remove sign bits if mode was signed and this is an unsigned shift */
870 if (!signed_shift && is_signed) {
871 msd = and_table[_val(msd)][_val(max_digit[bitoffset])];
874 shrs = shrs_table[_val(msd)][shift_mod];
876 /* signed shift and signed mode and negative value means all bits to the left are set */
877 if (signed_shift && sign == SC_F) {
878 buffer[counter] = or_table[_val(shrs[0])][_val(min_digit[bitoffset])];
880 buffer[counter] = shrs[0];
884 buffer[counter - 1] = or_table[_val(buffer[counter-1])][_val(shrs[1])];
886 /* fill with SC_F or SC_0 depending on sign */
887 for (counter++; counter < calc_buffer_size; counter++) {
888 buffer[counter] = sign;
893 * Implements a Rotate Left.
894 * positive: low-order -> high order, negative other direction
896 static void do_rotl(const char *val1, char *buffer, long offset, int radius, unsigned is_signed) {
898 temp1 = alloca(calc_buffer_size);
899 temp2 = alloca(calc_buffer_size);
901 offset = offset % radius;
903 /* rotation by multiples of the type length is identity */
905 memmove(buffer, val1, calc_buffer_size);
909 do_shl(val1, temp1, offset, radius, is_signed);
910 do_shr(val1, temp2, radius - offset, radius, is_signed, 0);
911 do_bitor(temp1, temp2, buffer);
912 carry_flag = 0; /* set by shr, but due to rot this is false */
915 /*****************************************************************************
916 * public functions, declared in strcalc.h
917 *****************************************************************************/
918 const void *sc_get_buffer(void) {
919 return (void*)calc_buffer;
922 int sc_get_buffer_length(void) {
923 return calc_buffer_size;
927 * Do sign extension if the mode is signed, otherwise to zero extension.
929 void sign_extend(void *buffer, ir_mode *mode) {
930 char *calc_buffer = buffer;
931 int bits = get_mode_size_bits(mode) - 1;
932 int nibble = bits >> 2;
933 int max = max_digit[bits & 3];
936 if (mode_is_signed(mode)) {
937 if (calc_buffer[nibble] > max) {
938 /* sign bit is set, we need sign expansion */
940 for (i = nibble + 1; i < calc_buffer_size; ++i)
941 calc_buffer[i] = SC_F;
942 calc_buffer[nibble] = or_table[(int)calc_buffer[nibble]][(int)sex_digit[bits & 3]];
944 /* set all bits to zero */
945 for (i = nibble + 1; i < calc_buffer_size; ++i)
946 calc_buffer[i] = SC_0;
947 calc_buffer[nibble] = and_table[(int)calc_buffer[nibble]][(int)zex_digit[bits & 3]];
950 /* do zero extension */
951 for (i = nibble + 1; i < calc_buffer_size; ++i)
952 calc_buffer[i] = SC_0;
953 calc_buffer[nibble] = and_table[(int)calc_buffer[nibble]][(int)zex_digit[bits & 3]];
957 /* FIXME doesn't check for overflows */
958 void sc_val_from_str(const char *str, unsigned int len, void *buffer, ir_mode *mode) {
959 const char *orig_str = str;
960 unsigned int orig_len = len;
965 base = alloca(calc_buffer_size);
966 val = alloca(calc_buffer_size);
968 /* verify valid pointers (not null) */
970 /* a string no characters long is an error */
973 if (buffer == NULL) buffer = calc_buffer;
975 CLEAR_BUFFER(buffer);
979 /* strip leading spaces */
980 while ((len > 0) && (*str == ' ')) { len--; str++; }
982 /* if the first two characters are 0x or 0X -> hex
983 * if the first is a 0 -> oct
984 * else dec, strip leading -/+ and remember sign
986 * only a + or - sign is no number resulting in an error */
990 if (str[1] == 'x' || str[1] == 'X') { /* hex */
993 base[1] = SC_1; base[0] = SC_0;
997 base[1] = SC_0; base[0] = SC_8;
1004 base[1] = SC_0; base[0] = SC_A;
1011 base[1] = SC_0; base[0] = SC_A;
1014 default: /* dec, else would have begun with 0x or 0 */
1015 base[1] = SC_0; base[0] = SC_A;
1017 } else { /* dec, else would have begun with 0x or 0 */
1018 base[1] = SC_0; base[0] = SC_A;
1021 /* BEGIN string evaluation, from left to right */
1030 if (base[0] > SC_9 || base[1] > SC_0) { /* (base > 10) */
1031 val[0] = _digit((*str)-'a'+10);
1034 fail_char(orig_str, orig_len, *str, str-orig_str+1);
1043 if (base[0] > SC_9 || base[1] > SC_0) { /* (base > 10) */
1044 val[0] = _digit((*str)-'A'+10);
1047 fail_char(orig_str, orig_len, *str, str-orig_str+1);
1052 if (base[0] > SC_7 || base[1] > SC_0) { /* (base > 8) */
1053 val[0] = _digit((*str)-'0');
1056 fail_char(orig_str, orig_len, *str, str-orig_str+1);
1067 val[0] = _digit((*str)-'0');
1071 fail_char(orig_str, orig_len, *str, str-orig_str+1);
1072 } /* switch(*str) */
1074 /* Radix conversion from base b to base B:
1075 * (UnUn-1...U1U0)b == ((((Un*b + Un-1)*b + ...)*b + U1)*b + U0)B */
1076 do_mul(base, calc_buffer, calc_buffer); /* multiply current value with base */
1077 do_add(val, calc_buffer, calc_buffer); /* add next digit to current value */
1079 /* get ready for the next letter */
1082 } /* while (len > 0 ) */
1085 do_negate(calc_buffer, calc_buffer);
1087 /* beware: even if hex numbers have no sign, we need sign extension here */
1088 sign_extend(calc_buffer, mode);
1091 void sc_val_from_long(long value, void *buffer) {
1093 char sign, is_minlong;
1095 if (buffer == NULL) buffer = calc_buffer;
1099 is_minlong = value == LONG_MIN;
1101 /* use absolute value, special treatment of MIN_LONG to avoid overflow */
1109 CLEAR_BUFFER(buffer);
1111 while ((value != 0) && (pos < (char*)buffer + calc_buffer_size)) {
1112 *pos++ = _digit(value & 0xf);
1118 do_inc(buffer, buffer);
1120 do_negate(buffer, buffer);
1124 void sc_val_from_ulong(unsigned long value, void *buffer) {
1127 if (buffer == NULL) buffer = calc_buffer;
1130 while (pos < (unsigned char *)buffer + calc_buffer_size) {
1131 *pos++ = (unsigned char)_digit(value & 0xf);
1136 long sc_val_to_long(const void *val) {
1140 for (i = calc_buffer_size - 1; i >= 0; i--) {
1141 l = (l << 4) + _val(((char *)val)[i]);
1146 void sc_min_from_bits(unsigned int num_bits, unsigned int sign, void *buffer) {
1150 if (buffer == NULL) buffer = calc_buffer;
1151 CLEAR_BUFFER(buffer);
1153 if (!sign) return; /* unsigned means minimum is 0(zero) */
1157 bits = num_bits - 1;
1158 for (i = 0; i < bits/4; i++)
1161 *pos++ = min_digit[bits%4];
1163 for (i++; i <= calc_buffer_size - 1; i++)
1167 void sc_max_from_bits(unsigned int num_bits, unsigned int sign, void *buffer) {
1171 if (buffer == NULL) buffer = calc_buffer;
1172 CLEAR_BUFFER(buffer);
1175 bits = num_bits - sign;
1176 for (i = 0; i < bits/4; i++)
1179 *pos++ = max_digit[bits%4];
1181 for (i++; i <= calc_buffer_size - 1; i++)
1185 void sc_truncate(unsigned int num_bits, void *buffer) {
1186 char *cbuffer = buffer;
1187 char *pos = cbuffer + (num_bits / 4);
1188 char *end = cbuffer + calc_buffer_size;
1192 switch(num_bits % 4) {
1193 case 0: /* nothing to do */ break;
1194 case 1: *pos = and_table[_val(*pos)][SC_1]; pos++; break;
1195 case 2: *pos = and_table[_val(*pos)][SC_3]; pos++; break;
1196 case 3: *pos = and_table[_val(*pos)][SC_7]; pos++; break;
1199 for( ; pos < end; ++pos)
1203 int sc_comp(const void* value1, const void* value2) {
1204 int counter = calc_buffer_size - 1;
1205 const char *val1 = (const char *)value1;
1206 const char *val2 = (const char *)value2;
1208 /* compare signs first:
1209 * the loop below can only compare values of the same sign! */
1210 if (do_sign(val1) != do_sign(val2))
1211 return (do_sign(val1) == 1)?(1):(-1);
1213 /* loop until two digits differ, the values are equal if there
1214 * are no such two digits */
1215 while (val1[counter] == val2[counter]) {
1217 if (counter < 0) return 0;
1220 /* the leftmost digit is the most significant, so this returns
1221 * the correct result.
1222 * This implies the digit enum is ordered */
1223 return (val1[counter] > val2[counter]) ? (1) : (-1);
1226 int sc_get_highest_set_bit(const void *value) {
1227 const char *val = (const char*)value;
1230 high = calc_buffer_size * 4 - 1;
1232 for (counter = calc_buffer_size-1; counter >= 0; counter--) {
1233 if (val[counter] == SC_0)
1236 if (val[counter] > SC_7) return high;
1237 else if (val[counter] > SC_3) return high - 1;
1238 else if (val[counter] > SC_1) return high - 2;
1239 else return high - 3;
1245 int sc_get_lowest_set_bit(const void *value) {
1246 const char *val = (const char*)value;
1250 for (counter = 0; counter < calc_buffer_size; counter++) {
1251 switch (val[counter]) {
1278 int sc_get_bit_at(const void *value, unsigned pos) {
1279 const char *val = value;
1280 unsigned nibble = pos >> 2;
1282 if (and_table[val[nibble]][shift_table[pos & 3]] != SC_0)
1287 int sc_is_zero(const void *value) {
1288 const char* val = (const char *)value;
1291 for (counter = 0; counter < calc_buffer_size; ++counter) {
1292 if (val[counter] != SC_0)
1298 int sc_is_negative(const void *value) {
1299 return do_sign(value) == -1;
1302 int sc_had_carry(void) {
1306 unsigned char sc_sub_bits(const void *value, int len, unsigned byte_ofs) {
1307 const char *val = (const char *)value;
1308 int nibble_ofs = 2 * byte_ofs;
1311 /* the current scheme uses one byte to store a nibble */
1312 if (4 * nibble_ofs >= len)
1315 res = _val(val[nibble_ofs]);
1316 if (len > 4 * (nibble_ofs + 1))
1317 res |= _val(val[nibble_ofs + 1]) << 4;
1319 /* kick bits outsize */
1320 if (len - 8 * byte_ofs < 8) {
1321 res &= (1 << (len - 8 * byte_ofs)) - 1;
1327 * convert to a string
1328 * FIXME: Doesn't check buffer bounds
1330 const char *sc_print(const void *value, unsigned bits, enum base_t base, int signed_mode) {
1331 static const char big_digits[] = "0123456789ABCDEF";
1332 static const char small_digits[] = "0123456789abcdef";
1334 char *base_val, *div1_res, *div2_res, *rem_res;
1335 int counter, nibbles, i, sign, mask;
1338 const char *val = (const char *)value;
1342 const char *digits = small_digits;
1344 base_val = alloca(calc_buffer_size);
1345 div1_res = alloca(calc_buffer_size);
1346 div2_res = alloca(calc_buffer_size);
1347 rem_res = alloca(calc_buffer_size);
1349 pos = output_buffer + bit_pattern_size;
1354 bits = bit_pattern_size;
1355 #ifdef STRCALC_DEBUG_FULLPRINT
1359 nibbles = bits >> 2;
1363 digits = big_digits;
1365 for (counter = 0; counter < nibbles; ++counter) {
1366 *(--pos) = digits[_val(val[counter])];
1367 #ifdef STRCALC_DEBUG_GROUPPRINT
1368 if ((counter+1)%8 == 0)
1373 /* last nibble must be masked */
1375 mask = zex_digit[bits & 3];
1376 x = and_table[_val(val[counter++])][mask];
1377 *(--pos) = digits[_val(x)];
1380 /* now kill zeros */
1381 for (; counter > 1; --counter, ++pos) {
1382 #ifdef STRCALC_DEBUG_GROUPPRINT
1383 if (pos[0] == ' ') ++pos;
1391 for (counter = 0; counter < nibbles; ++counter) {
1393 p = binary_table[_val(val[counter])];
1400 /* last nibble must be masked */
1402 mask = zex_digit[bits & 3];
1403 x = and_table[_val(val[counter++])][mask];
1406 p = binary_table[_val(x)];
1413 /* now kill zeros */
1414 for (counter <<= 2; counter > 1; --counter, ++pos)
1421 memset(base_val, SC_0, calc_buffer_size);
1422 base_val[0] = base == SC_DEC ? SC_A : SC_8;
1426 if (signed_mode && base == SC_DEC) {
1427 /* check for negative values */
1428 if (do_bit(val, bits - 1)) {
1429 do_negate(val, div2_res);
1435 /* transfer data into oscillating buffers */
1436 memset(div1_res, SC_0, calc_buffer_size);
1437 for (counter = 0; counter < nibbles; ++counter)
1438 div1_res[counter] = p[counter];
1440 /* last nibble must be masked */
1442 mask = zex_digit[bits & 3];
1443 div1_res[counter] = and_table[_val(p[counter])][mask];
1450 do_divmod(m, base_val, n, rem_res);
1454 *(--pos) = digits[_val(rem_res[0])];
1457 for (i = 0; i < calc_buffer_size; ++i)
1468 panic("Unsupported base %d", base);
1473 void init_strcalc(int precision) {
1474 if (calc_buffer == NULL) {
1475 if (precision <= 0) precision = SC_DEFAULT_PRECISION;
1477 /* round up to multiple of 4 */
1478 precision = (precision + 3) & ~3;
1480 bit_pattern_size = (precision);
1481 calc_buffer_size = (precision / 2);
1482 max_value_size = (precision / 4);
1484 calc_buffer = XMALLOCN(char, calc_buffer_size + 1);
1485 output_buffer = XMALLOCN(char, bit_pattern_size + 1);
1487 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));
1492 void finish_strcalc(void) {
1493 free(calc_buffer); calc_buffer = NULL;
1494 free(output_buffer); output_buffer = NULL;
1497 int sc_get_precision(void) {
1498 return bit_pattern_size;
1502 void sc_add(const void *value1, const void *value2, void *buffer) {
1503 CLEAR_BUFFER(calc_buffer);
1506 DEBUGPRINTF_COMPUTATION(("%s + ", sc_print_hex(value1)));
1507 DEBUGPRINTF_COMPUTATION(("%s -> ", sc_print_hex(value2)));
1509 do_add(value1, value2, calc_buffer);
1511 DEBUGPRINTF_COMPUTATION(("%s\n", sc_print_hex(calc_buffer)));
1513 if ((buffer != NULL) && (buffer != calc_buffer)) {
1514 memcpy(buffer, calc_buffer, calc_buffer_size);
1518 void sc_sub(const void *value1, const void *value2, void *buffer) {
1519 CLEAR_BUFFER(calc_buffer);
1522 DEBUGPRINTF_COMPUTATION(("%s - ", sc_print_hex(value1)));
1523 DEBUGPRINTF_COMPUTATION(("%s -> ", sc_print_hex(value2)));
1525 do_sub(value1, value2, calc_buffer);
1527 DEBUGPRINTF_COMPUTATION(("%s\n", sc_print_hex(calc_buffer)));
1529 if ((buffer != NULL) && (buffer != calc_buffer)) {
1530 memcpy(buffer, calc_buffer, calc_buffer_size);
1534 void sc_neg(const void *value1, void *buffer) {
1537 DEBUGPRINTF_COMPUTATION(("- %s ->", sc_print_hex(value1)));
1539 do_negate(value1, calc_buffer);
1541 DEBUGPRINTF_COMPUTATION(("%s\n", sc_print_hex(calc_buffer)));
1543 if ((buffer != NULL) && (buffer != calc_buffer)) {
1544 memcpy(buffer, calc_buffer, calc_buffer_size);
1548 void sc_and(const void *value1, const void *value2, void *buffer) {
1549 CLEAR_BUFFER(calc_buffer);
1552 DEBUGPRINTF_COMPUTATION(("%s & ", sc_print_hex(value1)));
1553 DEBUGPRINTF_COMPUTATION(("%s -> ", sc_print_hex(value2)));
1555 do_bitand(value1, value2, calc_buffer);
1557 DEBUGPRINTF_COMPUTATION(("%s\n", sc_print_hex(calc_buffer)));
1559 if ((buffer != NULL) && (buffer != calc_buffer)) {
1560 memcpy(buffer, calc_buffer, calc_buffer_size);
1564 void sc_or(const void *value1, const void *value2, void *buffer) {
1565 CLEAR_BUFFER(calc_buffer);
1568 DEBUGPRINTF_COMPUTATION(("%s | ", sc_print_hex(value1)));
1569 DEBUGPRINTF_COMPUTATION(("%s -> ", sc_print_hex(value2)));
1571 do_bitor(value1, value2, calc_buffer);
1573 DEBUGPRINTF_COMPUTATION(("%s\n", sc_print_hex(calc_buffer)));
1575 if ((buffer != NULL) && (buffer != calc_buffer)) {
1576 memcpy(buffer, calc_buffer, calc_buffer_size);
1580 void sc_xor(const void *value1, const void *value2, void *buffer) {
1581 CLEAR_BUFFER(calc_buffer);
1584 DEBUGPRINTF_COMPUTATION(("%s ^ ", sc_print_hex(value1)));
1585 DEBUGPRINTF_COMPUTATION(("%s -> ", sc_print_hex(value2)));
1587 do_bitxor(value1, value2, calc_buffer);
1589 DEBUGPRINTF_COMPUTATION(("%s\n", sc_print_hex(calc_buffer)));
1591 if ((buffer != NULL) && (buffer != calc_buffer)) {
1592 memcpy(buffer, calc_buffer, calc_buffer_size);
1596 void sc_not(const void *value1, void *buffer) {
1597 CLEAR_BUFFER(calc_buffer);
1600 DEBUGPRINTF_COMPUTATION(("~ %s ->", sc_print_hex(value1)));
1602 do_bitnot(value1, calc_buffer);
1604 DEBUGPRINTF_COMPUTATION(("%s\n", sc_print_hex(calc_buffer)));
1606 if ((buffer != NULL) && (buffer != calc_buffer)) {
1607 memcpy(buffer, calc_buffer, calc_buffer_size);
1611 void sc_mul(const void *value1, const void *value2, void *buffer) {
1612 CLEAR_BUFFER(calc_buffer);
1615 DEBUGPRINTF_COMPUTATION(("%s * ", sc_print_hex(value1)));
1616 DEBUGPRINTF_COMPUTATION(("%s -> ", sc_print_hex(value2)));
1618 do_mul(value1, value2, calc_buffer);
1620 DEBUGPRINTF_COMPUTATION(("%s\n", sc_print_hex(calc_buffer)));
1622 if ((buffer != NULL) && (buffer != calc_buffer)) {
1623 memcpy(buffer, calc_buffer, calc_buffer_size);
1627 void sc_div(const void *value1, const void *value2, void *buffer) {
1628 /* temp buffer holding unused result of divmod */
1629 char *unused_res = alloca(calc_buffer_size);
1631 CLEAR_BUFFER(calc_buffer);
1634 DEBUGPRINTF_COMPUTATION(("%s / ", sc_print_hex(value1)));
1635 DEBUGPRINTF_COMPUTATION(("%s -> ", sc_print_hex(value2)));
1637 do_divmod(value1, value2, calc_buffer, unused_res);
1639 DEBUGPRINTF_COMPUTATION(("%s\n", sc_print_hex(calc_buffer)));
1641 if ((buffer != NULL) && (buffer != calc_buffer)) {
1642 memcpy(buffer, calc_buffer, calc_buffer_size);
1646 void sc_mod(const void *value1, const void *value2, void *buffer) {
1647 /* temp buffer holding unused result of divmod */
1648 char *unused_res = alloca(calc_buffer_size);
1650 CLEAR_BUFFER(calc_buffer);
1653 DEBUGPRINTF_COMPUTATION(("%s %% ", sc_print_hex(value1)));
1654 DEBUGPRINTF_COMPUTATION(("%s -> ", sc_print_hex(value2)));
1656 do_divmod(value1, value2, unused_res, calc_buffer);
1658 DEBUGPRINTF_COMPUTATION(("%s\n", sc_print_hex(calc_buffer)));
1660 if ((buffer != NULL) && (buffer != calc_buffer)) {
1661 memcpy(buffer, calc_buffer, calc_buffer_size);
1665 void sc_divmod(const void *value1, const void *value2, void *div_buffer, void *mod_buffer) {
1666 CLEAR_BUFFER(calc_buffer);
1669 DEBUGPRINTF_COMPUTATION(("%s %% ", sc_print_hex(value1)));
1670 DEBUGPRINTF_COMPUTATION(("%s -> ", sc_print_hex(value2)));
1672 do_divmod(value1, value2, div_buffer, mod_buffer);
1674 DEBUGPRINTF_COMPUTATION(("%s:%s\n", sc_print_hex(div_buffer), sc_print_hex(mod_buffer)));
1678 void sc_shlI(const void *val1, long shift_cnt, int bitsize, int sign, void *buffer) {
1681 DEBUGPRINTF_COMPUTATION(("%s << %ld ", sc_print_hex(value1), shift_cnt));
1682 do_shl(val1, calc_buffer, shift_cnt, bitsize, sign);
1684 DEBUGPRINTF_COMPUTATION(("-> %s\n", sc_print_hex(calc_buffer)));
1686 if ((buffer != NULL) && (buffer != calc_buffer)) {
1687 memmove(buffer, calc_buffer, calc_buffer_size);
1691 void sc_shl(const void *val1, const void *val2, int bitsize, int sign, void *buffer) {
1692 long offset = sc_val_to_long(val2);
1694 sc_shlI(val1, offset, bitsize, sign, buffer);
1697 void sc_shrI(const void *val1, long shift_cnt, int bitsize, int sign, void *buffer) {
1700 DEBUGPRINTF_COMPUTATION(("%s >>u %ld ", sc_print_hex(value1), shift_cnt));
1701 do_shr(val1, calc_buffer, shift_cnt, bitsize, sign, 0);
1703 DEBUGPRINTF_COMPUTATION(("-> %s\n", sc_print_hex(calc_buffer)));
1705 if ((buffer != NULL) && (buffer != calc_buffer)) {
1706 memmove(buffer, calc_buffer, calc_buffer_size);
1710 void sc_shr(const void *val1, const void *val2, int bitsize, int sign, void *buffer) {
1711 long shift_cnt = sc_val_to_long(val2);
1713 sc_shrI(val1, shift_cnt, bitsize, sign, buffer);
1716 void sc_shrs(const void *val1, const void *val2, int bitsize, int sign, void *buffer) {
1717 long offset = sc_val_to_long(val2);
1721 DEBUGPRINTF_COMPUTATION(("%s >>s %ld ", sc_print_hex(value1), offset));
1722 do_shr(val1, calc_buffer, offset, bitsize, sign, 1);
1724 DEBUGPRINTF_COMPUTATION(("-> %s\n", sc_print_hex(calc_buffer)));
1726 if ((buffer != NULL) && (buffer != calc_buffer)) {
1727 memmove(buffer, calc_buffer, calc_buffer_size);
1731 void sc_rotl(const void *val1, const void *val2, int bitsize, int sign, void *buffer) {
1732 long offset = sc_val_to_long(val2);
1736 DEBUGPRINTF_COMPUTATION(("%s <<>> %ld ", sc_print_hex(value1), offset));
1737 do_rotl(val1, calc_buffer, offset, bitsize, sign);
1739 DEBUGPRINTF_COMPUTATION(("-> %s\n", sc_print_hex(calc_buffer)));
1741 if ((buffer != NULL) && (buffer != calc_buffer)) {
1742 memmove(buffer, calc_buffer, calc_buffer_size);
1746 void sc_zero(void *buffer) {
1748 buffer = calc_buffer;
1749 CLEAR_BUFFER(buffer);