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
40 * local definitions and macros
42 #define CLEAR_BUFFER(b) assert(b); memset(b, SC_0, calc_buffer_size)
43 #define _val(a) ((a)-SC_0)
44 #define _digit(a) ((a)+SC_0)
45 #define _bitisset(digit, pos) (and_table[_val(digit)][_val(shift_table[pos])] != SC_0)
47 #define fail_char(a, b, c, d) _fail_char((a), (b), (c), (d), __FILE__, __LINE__)
49 /* shortcut output for debugging */
50 # define sc_print_hex(a) sc_print((a), 0, SC_HEX, 0)
51 # define sc_print_dec(a) sc_print((a), 0, SC_DEC, 1)
52 # define sc_print_oct(a) sc_print((a), 0, SC_OCT, 0)
53 # define sc_print_bin(a) sc_print((a), 0, SC_BIN, 0)
55 #ifdef STRCALC_DEBUG_PRINTCOMP
56 # define DEBUGPRINTF_COMPUTATION(x) printf x
58 # define DEBUGPRINTF_COMPUTATION(x) ((void)0)
61 # define DEBUGPRINTF(x) printf x
63 # define DEBUGPRINTF(x) ((void)0)
70 static char *calc_buffer = NULL; /* buffer holding all results */
71 static char *output_buffer = NULL; /* buffer for output */
72 static int bit_pattern_size; /* maximum number of bits */
73 static int calc_buffer_size; /* size of internally stored values */
74 static int max_value_size; /* maximum size of values */
76 static int carry_flag; /**< some computation set the carry_flag:
77 - right shift if bits were lost due to shifting
78 - division if there was a remainder
79 However, the meaning of carry is machine dependent
80 and often defined in other ways! */
82 static const char sex_digit[4] = { SC_E, SC_C, SC_8, SC_0 };
83 static const char zex_digit[4] = { SC_1, SC_3, SC_7, SC_F };
84 static const char max_digit[4] = { SC_0, SC_1, SC_3, SC_7 };
85 static const char min_digit[4] = { SC_F, SC_E, SC_C, SC_8 };
87 static const char not_table[16] = { SC_F, SC_E, SC_D, SC_C, SC_B, SC_A, SC_9, SC_8,
88 SC_7, SC_6, SC_5, SC_4, SC_3, SC_2, SC_1, SC_0 };
90 static const char shift_table[4] = { SC_1, SC_2, SC_4, SC_8 };
92 static const char and_table[16][16] = {
93 { SC_0, SC_0, SC_0, SC_0, SC_0, SC_0, SC_0, SC_0,
94 SC_0, SC_0, SC_0, SC_0, SC_0, SC_0, SC_0, SC_0 },
96 { SC_0, SC_1, SC_0, SC_1, SC_0, SC_1, SC_0, SC_1,
97 SC_0, SC_1, SC_0, SC_1, SC_0, SC_1, SC_0, SC_1 },
99 { SC_0, SC_0, SC_2, SC_2, SC_0, SC_0, SC_2, SC_2,
100 SC_0, SC_0, SC_2, SC_2, SC_0, SC_0, SC_2, SC_2 },
102 { SC_0, SC_1, SC_2, SC_3, SC_0, SC_1, SC_2, SC_3,
103 SC_0, SC_1, SC_2, SC_3, SC_0, SC_1, SC_2, SC_3 },
105 { SC_0, SC_0, SC_0, SC_0, SC_4, SC_4, SC_4, SC_4,
106 SC_0, SC_0, SC_0, SC_0, SC_4, SC_4, SC_4, SC_4 },
108 { SC_0, SC_1, SC_0, SC_1, SC_4, SC_5, SC_4, SC_5,
109 SC_0, SC_1, SC_0, SC_1, SC_4, SC_5, SC_4, SC_5 },
111 { SC_0, SC_0, SC_2, SC_2, SC_4, SC_4, SC_6, SC_6,
112 SC_0, SC_0, SC_2, SC_2, SC_4, SC_4, SC_6, SC_6 },
114 { SC_0, SC_1, SC_2, SC_3, SC_4, SC_5, SC_6, SC_7,
115 SC_0, SC_1, SC_2, SC_3, SC_4, SC_5, SC_6, SC_7 },
117 { SC_0, SC_0, SC_0, SC_0, SC_0, SC_0, SC_0, SC_0,
118 SC_8, SC_8, SC_8, SC_8, SC_8, SC_8, SC_8, SC_8 },
120 { SC_0, SC_1, SC_0, SC_1, SC_0, SC_1, SC_0, SC_1,
121 SC_8, SC_9, SC_8, SC_9, SC_8, SC_9, SC_8, SC_9 },
123 { SC_0, SC_0, SC_2, SC_2, SC_0, SC_0, SC_2, SC_2,
124 SC_8, SC_8, SC_A, SC_A, SC_8, SC_8, SC_A, SC_A },
126 { SC_0, SC_1, SC_2, SC_3, SC_0, SC_1, SC_2, SC_3,
127 SC_8, SC_9, SC_A, SC_B, SC_8, SC_9, SC_A, SC_B },
129 { SC_0, SC_0, SC_0, SC_0, SC_4, SC_4, SC_4, SC_4,
130 SC_8, SC_8, SC_8, SC_8, SC_C, SC_C, SC_C, SC_C },
132 { SC_0, SC_1, SC_0, SC_1, SC_4, SC_5, SC_4, SC_5,
133 SC_8, SC_9, SC_8, SC_9, SC_C, SC_D, SC_C, SC_D },
135 { SC_0, SC_0, SC_2, SC_2, SC_4, SC_4, SC_6, SC_6,
136 SC_8, SC_8, SC_A, SC_A, SC_C, SC_C, SC_E, SC_E },
138 { SC_0, SC_1, SC_2, SC_3, SC_4, SC_5, SC_6, SC_7,
139 SC_8, SC_9, SC_A, SC_B, SC_C, SC_D, SC_E, SC_F } };
141 static const char or_table[16][16] = {
142 { SC_0, SC_1, SC_2, SC_3, SC_4, SC_5, SC_6, SC_7,
143 SC_8, SC_9, SC_A, SC_B, SC_C, SC_D, SC_E, SC_F },
145 { SC_1, SC_1, SC_3, SC_3, SC_5, SC_5, SC_7, SC_7,
146 SC_9, SC_9, SC_B, SC_B, SC_D, SC_D, SC_F, SC_F },
148 { SC_2, SC_3, SC_2, SC_3, SC_6, SC_7, SC_6, SC_7,
149 SC_A, SC_B, SC_A, SC_B, SC_E, SC_F, SC_E, SC_F },
151 { SC_3, SC_3, SC_3, SC_3, SC_7, SC_7, SC_7, SC_7,
152 SC_B, SC_B, SC_B, SC_B, SC_F, SC_F, SC_F, SC_F },
154 { SC_4, SC_5, SC_6, SC_7, SC_4, SC_5, SC_6, SC_7,
155 SC_C, SC_D, SC_E, SC_F, SC_C, SC_D, SC_E, SC_F },
157 { SC_5, SC_5, SC_7, SC_7, SC_5, SC_5, SC_7, SC_7,
158 SC_D, SC_D, SC_F, SC_F, SC_D, SC_D, SC_F, SC_F },
160 { SC_6, SC_7, SC_6, SC_7, SC_6, SC_7, SC_6, SC_7,
161 SC_E, SC_F, SC_E, SC_F, SC_E, SC_F, SC_E, SC_F },
163 { SC_7, SC_7, SC_7, SC_7, SC_7, SC_7, SC_7, SC_7,
164 SC_F, SC_F, SC_F, SC_F, SC_F, SC_F, SC_F, SC_F },
166 { SC_8, SC_9, SC_A, SC_B, SC_C, SC_D, SC_E, SC_F,
167 SC_8, SC_9, SC_A, SC_B, SC_C, SC_D, SC_E, SC_F },
169 { SC_9, SC_9, SC_B, SC_B, SC_D, SC_D, SC_F, SC_F,
170 SC_9, SC_9, SC_B, SC_B, SC_D, SC_D, SC_F, SC_F },
172 { SC_A, SC_B, SC_A, SC_B, SC_E, SC_F, SC_E, SC_F,
173 SC_A, SC_B, SC_A, SC_B, SC_E, SC_F, SC_E, SC_F },
175 { SC_B, SC_B, SC_B, SC_B, SC_F, SC_F, SC_F, SC_F,
176 SC_B, SC_B, SC_B, SC_B, SC_F, SC_F, SC_F, SC_F },
178 { SC_C, SC_D, SC_E, SC_F, SC_C, SC_D, SC_E, SC_F,
179 SC_C, SC_D, SC_E, SC_F, SC_C, SC_D, SC_E, SC_F },
181 { SC_D, SC_D, SC_F, SC_F, SC_D, SC_D, SC_F, SC_F,
182 SC_D, SC_D, SC_F, SC_F, SC_D, SC_D, SC_F, SC_F },
184 { SC_E, SC_F, SC_E, SC_F, SC_E, SC_F, SC_E, SC_F,
185 SC_E, SC_F, SC_E, SC_F, SC_E, SC_F, SC_E, SC_F },
187 { SC_F, SC_F, SC_F, SC_F, SC_F, SC_F, SC_F, SC_F,
188 SC_F, SC_F, SC_F, SC_F, SC_F, SC_F, SC_F, SC_F } };
190 static char const xor_table[16][16] = {
191 { SC_0, SC_1, SC_2, SC_3, SC_4, SC_5, SC_6, SC_7,
192 SC_8, SC_9, SC_A, SC_B, SC_C, SC_D, SC_E, SC_F },
194 { SC_1, SC_0, SC_3, SC_2, SC_5, SC_4, SC_7, SC_6,
195 SC_9, SC_8, SC_B, SC_A, SC_D, SC_C, SC_F, SC_E },
197 { SC_2, SC_3, SC_0, SC_1, SC_6, SC_7, SC_4, SC_5,
198 SC_A, SC_B, SC_8, SC_9, SC_E, SC_F, SC_C, SC_D },
200 { SC_3, SC_2, SC_1, SC_0, SC_7, SC_6, SC_5, SC_4,
201 SC_B, SC_A, SC_9, SC_8, SC_F, SC_E, SC_D, SC_C },
203 { SC_4, SC_5, SC_6, SC_7, SC_0, SC_1, SC_2, SC_3,
204 SC_C, SC_D, SC_E, SC_F, SC_8, SC_9, SC_A, SC_B },
206 { SC_5, SC_4, SC_7, SC_6, SC_1, SC_0, SC_3, SC_2,
207 SC_D, SC_C, SC_F, SC_E, SC_9, SC_8, SC_B, SC_A },
209 { SC_6, SC_7, SC_4, SC_5, SC_2, SC_3, SC_0, SC_1,
210 SC_E, SC_F, SC_C, SC_D, SC_A, SC_B, SC_8, SC_9 },
212 { SC_7, SC_6, SC_5, SC_4, SC_3, SC_2, SC_1, SC_0,
213 SC_F, SC_E, SC_D, SC_C, SC_B, SC_A, SC_9, SC_8 },
215 { SC_8, SC_9, SC_A, SC_B, SC_C, SC_D, SC_E, SC_F,
216 SC_0, SC_1, SC_2, SC_3, SC_4, SC_5, SC_6, SC_7 },
218 { SC_9, SC_8, SC_B, SC_A, SC_D, SC_C, SC_F, SC_E,
219 SC_1, SC_0, SC_3, SC_2, SC_5, SC_4, SC_7, SC_6 },
221 { SC_A, SC_B, SC_8, SC_9, SC_E, SC_F, SC_C, SC_D,
222 SC_2, SC_3, SC_0, SC_1, SC_6, SC_7, SC_4, SC_5 },
224 { SC_B, SC_A, SC_9, SC_8, SC_F, SC_E, SC_D, SC_C,
225 SC_3, SC_2, SC_1, SC_0, SC_7, SC_6, SC_5, SC_4 },
227 { SC_C, SC_D, SC_E, SC_F, SC_8, SC_9, SC_A, SC_B,
228 SC_4, SC_5, SC_6, SC_7, SC_0, SC_1, SC_2, SC_3 },
230 { SC_D, SC_C, SC_F, SC_E, SC_9, SC_8, SC_B, SC_A,
231 SC_5, SC_4, SC_7, SC_6, SC_1, SC_0, SC_3, SC_2 },
233 { SC_E, SC_F, SC_C, SC_D, SC_A, SC_B, SC_8, SC_9,
234 SC_6, SC_7, SC_4, SC_5, SC_2, SC_3, SC_0, SC_1 },
236 { SC_F, SC_E, SC_D, SC_C, SC_B, SC_A, SC_9, SC_8,
237 SC_7, SC_6, SC_5, SC_4, SC_3, SC_2, SC_1, SC_0 }
240 static char const add_table[16][16][2] = {
241 { {SC_0, SC_0}, {SC_1, SC_0}, {SC_2, SC_0}, {SC_3, SC_0},
242 {SC_4, SC_0}, {SC_5, SC_0}, {SC_6, SC_0}, {SC_7, SC_0},
243 {SC_8, SC_0}, {SC_9, SC_0}, {SC_A, SC_0}, {SC_B, SC_0},
244 {SC_C, SC_0}, {SC_D, SC_0}, {SC_E, SC_0}, {SC_F, SC_0} },
246 { {SC_1, SC_0}, {SC_2, SC_0}, {SC_3, SC_0}, {SC_4, SC_0},
247 {SC_5, SC_0}, {SC_6, SC_0}, {SC_7, SC_0}, {SC_8, SC_0},
248 {SC_9, SC_0}, {SC_A, SC_0}, {SC_B, SC_0}, {SC_C, SC_0},
249 {SC_D, SC_0}, {SC_E, SC_0}, {SC_F, SC_0}, {SC_0, SC_1} },
251 { {SC_2, SC_0}, {SC_3, SC_0}, {SC_4, SC_0}, {SC_5, SC_0},
252 {SC_6, SC_0}, {SC_7, SC_0}, {SC_8, SC_0}, {SC_9, SC_0},
253 {SC_A, SC_0}, {SC_B, SC_0}, {SC_C, SC_0}, {SC_D, SC_0},
254 {SC_E, SC_0}, {SC_F, SC_0}, {SC_0, SC_1}, {SC_1, SC_1} },
256 { {SC_3, SC_0}, {SC_4, SC_0}, {SC_5, SC_0}, {SC_6, SC_0},
257 {SC_7, SC_0}, {SC_8, SC_0}, {SC_9, SC_0}, {SC_A, SC_0},
258 {SC_B, SC_0}, {SC_C, SC_0}, {SC_D, SC_0}, {SC_E, SC_0},
259 {SC_F, SC_0}, {SC_0, SC_1}, {SC_1, SC_1}, {SC_2, SC_1} },
261 { {SC_4, SC_0}, {SC_5, SC_0}, {SC_6, SC_0}, {SC_7, SC_0},
262 {SC_8, SC_0}, {SC_9, SC_0}, {SC_A, SC_0}, {SC_B, SC_0},
263 {SC_C, SC_0}, {SC_D, SC_0}, {SC_E, SC_0}, {SC_F, SC_0},
264 {SC_0, SC_1}, {SC_1, SC_1}, {SC_2, SC_1}, {SC_3, SC_1} },
266 { {SC_5, SC_0}, {SC_6, SC_0}, {SC_7, SC_0}, {SC_8, SC_0},
267 {SC_9, SC_0}, {SC_A, SC_0}, {SC_B, SC_0}, {SC_C, SC_0},
268 {SC_D, SC_0}, {SC_E, SC_0}, {SC_F, SC_0}, {SC_0, SC_1},
269 {SC_1, SC_1}, {SC_2, SC_1}, {SC_3, SC_1}, {SC_4, SC_1} },
271 { {SC_6, SC_0}, {SC_7, SC_0}, {SC_8, SC_0}, {SC_9, SC_0},
272 {SC_A, SC_0}, {SC_B, SC_0}, {SC_C, SC_0}, {SC_D, SC_0},
273 {SC_E, SC_0}, {SC_F, SC_0}, {SC_0, SC_1}, {SC_1, SC_1},
274 {SC_2, SC_1}, {SC_3, SC_1}, {SC_4, SC_1}, {SC_5, SC_1} },
276 { {SC_7, SC_0}, {SC_8, SC_0}, {SC_9, SC_0}, {SC_A, SC_0},
277 {SC_B, SC_0}, {SC_C, SC_0}, {SC_D, SC_0}, {SC_E, SC_0},
278 {SC_F, SC_0}, {SC_0, SC_1}, {SC_1, SC_1}, {SC_2, SC_1},
279 {SC_3, SC_1}, {SC_4, SC_1}, {SC_5, SC_1}, {SC_6, SC_1} },
281 { {SC_8, SC_0}, {SC_9, SC_0}, {SC_A, SC_0}, {SC_B, SC_0},
282 {SC_C, SC_0}, {SC_D, SC_0}, {SC_E, SC_0}, {SC_F, SC_0},
283 {SC_0, SC_1}, {SC_1, SC_1}, {SC_2, SC_1}, {SC_3, SC_1},
284 {SC_4, SC_1}, {SC_5, SC_1}, {SC_6, SC_1}, {SC_7, SC_1} },
286 { {SC_9, SC_0}, {SC_A, SC_0}, {SC_B, SC_0}, {SC_C, SC_0},
287 {SC_D, SC_0}, {SC_E, SC_0}, {SC_F, SC_0}, {SC_0, SC_1},
288 {SC_1, SC_1}, {SC_2, SC_1}, {SC_3, SC_1}, {SC_4, SC_1},
289 {SC_5, SC_1}, {SC_6, SC_1}, {SC_7, SC_1}, {SC_8, SC_1} },
291 { {SC_A, SC_0}, {SC_B, SC_0}, {SC_C, SC_0}, {SC_D, SC_0},
292 {SC_E, SC_0}, {SC_F, SC_0}, {SC_0, SC_1}, {SC_1, SC_1},
293 {SC_2, SC_1}, {SC_3, SC_1}, {SC_4, SC_1}, {SC_5, SC_1},
294 {SC_6, SC_1}, {SC_7, SC_1}, {SC_8, SC_1}, {SC_9, SC_1} },
296 { {SC_B, SC_0}, {SC_C, SC_0}, {SC_D, SC_0}, {SC_E, SC_0},
297 {SC_F, SC_0}, {SC_0, SC_1}, {SC_1, SC_1}, {SC_2, SC_1},
298 {SC_3, SC_1}, {SC_4, SC_1}, {SC_5, SC_1}, {SC_6, SC_1},
299 {SC_7, SC_1}, {SC_8, SC_1}, {SC_9, SC_1}, {SC_A, SC_1} },
301 { {SC_C, SC_0}, {SC_D, SC_0}, {SC_E, SC_0}, {SC_F, SC_0},
302 {SC_0, SC_1}, {SC_1, SC_1}, {SC_2, SC_1}, {SC_3, SC_1},
303 {SC_4, SC_1}, {SC_5, SC_1}, {SC_6, SC_1}, {SC_7, SC_1},
304 {SC_8, SC_1}, {SC_9, SC_1}, {SC_A, SC_1}, {SC_B, SC_1} },
306 { {SC_D, SC_0}, {SC_E, SC_0}, {SC_F, SC_0}, {SC_0, SC_1},
307 {SC_1, SC_1}, {SC_2, SC_1}, {SC_3, SC_1}, {SC_4, SC_1},
308 {SC_5, SC_1}, {SC_6, SC_1}, {SC_7, SC_1}, {SC_8, SC_1},
309 {SC_9, SC_1}, {SC_A, SC_1}, {SC_B, SC_1}, {SC_C, SC_1} },
311 { {SC_E, SC_0}, {SC_F, SC_0}, {SC_0, SC_1}, {SC_1, SC_1},
312 {SC_2, SC_1}, {SC_3, SC_1}, {SC_4, SC_1}, {SC_5, SC_1},
313 {SC_6, SC_1}, {SC_7, SC_1}, {SC_8, SC_1}, {SC_9, SC_1},
314 {SC_A, SC_1}, {SC_B, SC_1}, {SC_C, SC_1}, {SC_D, SC_1} },
316 { {SC_F, SC_0}, {SC_0, SC_1}, {SC_1, SC_1}, {SC_2, SC_1},
317 {SC_3, SC_1}, {SC_4, SC_1}, {SC_5, SC_1}, {SC_6, SC_1},
318 {SC_7, SC_1}, {SC_8, SC_1}, {SC_9, SC_1}, {SC_A, SC_1},
319 {SC_B, SC_1}, {SC_C, SC_1}, {SC_D, SC_1}, {SC_E, SC_1} }
322 static char const mul_table[16][16][2] = {
323 { {SC_0, SC_0}, {SC_0, SC_0}, {SC_0, SC_0}, {SC_0, SC_0},
324 {SC_0, SC_0}, {SC_0, SC_0}, {SC_0, SC_0}, {SC_0, SC_0},
325 {SC_0, SC_0}, {SC_0, SC_0}, {SC_0, SC_0}, {SC_0, SC_0},
326 {SC_0, SC_0}, {SC_0, SC_0}, {SC_0, SC_0}, {SC_0, SC_0} },
328 { {SC_0, SC_0}, {SC_1, SC_0}, {SC_2, SC_0}, {SC_3, SC_0},
329 {SC_4, SC_0}, {SC_5, SC_0}, {SC_6, SC_0}, {SC_7, SC_0},
330 {SC_8, SC_0}, {SC_9, SC_0}, {SC_A, SC_0}, {SC_B, SC_0},
331 {SC_C, SC_0}, {SC_D, SC_0}, {SC_E, SC_0}, {SC_F, SC_0} },
333 { {SC_0, SC_0}, {SC_2, SC_0}, {SC_4, SC_0}, {SC_6, SC_0},
334 {SC_8, SC_0}, {SC_A, SC_0}, {SC_C, SC_0}, {SC_E, SC_0},
335 {SC_0, SC_1}, {SC_2, SC_1}, {SC_4, SC_1}, {SC_6, SC_1},
336 {SC_8, SC_1}, {SC_A, SC_1}, {SC_C, SC_1}, {SC_E, SC_1} },
338 { {SC_0, SC_0}, {SC_3, SC_0}, {SC_6, SC_0}, {SC_9, SC_0},
339 {SC_C, SC_0}, {SC_F, SC_0}, {SC_2, SC_1}, {SC_5, SC_1},
340 {SC_8, SC_1}, {SC_B, SC_1}, {SC_E, SC_1}, {SC_1, SC_2},
341 {SC_4, SC_2}, {SC_7, SC_2}, {SC_A, SC_2}, {SC_D, SC_2} },
343 { {SC_0, SC_0}, {SC_4, SC_0}, {SC_8, SC_0}, {SC_C, SC_0},
344 {SC_0, SC_1}, {SC_4, SC_1}, {SC_8, SC_1}, {SC_C, SC_1},
345 {SC_0, SC_2}, {SC_4, SC_2}, {SC_8, SC_2}, {SC_C, SC_2},
346 {SC_0, SC_3}, {SC_4, SC_3}, {SC_8, SC_3}, {SC_C, SC_3} },
348 { {SC_0, SC_0}, {SC_5, SC_0}, {SC_A, SC_0}, {SC_F, SC_0},
349 {SC_4, SC_1}, {SC_9, SC_1}, {SC_E, SC_1}, {SC_3, SC_2},
350 {SC_8, SC_2}, {SC_D, SC_2}, {SC_2, SC_3}, {SC_7, SC_3},
351 {SC_C, SC_3}, {SC_1, SC_4}, {SC_6, SC_4}, {SC_B, SC_4} },
353 { {SC_0, SC_0}, {SC_6, SC_0}, {SC_C, SC_0}, {SC_2, SC_1},
354 {SC_8, SC_1}, {SC_E, SC_1}, {SC_4, SC_2}, {SC_A, SC_2},
355 {SC_0, SC_3}, {SC_6, SC_3}, {SC_C, SC_3}, {SC_2, SC_4},
356 {SC_8, SC_4}, {SC_E, SC_4}, {SC_4, SC_5}, {SC_A, SC_5} },
358 { {SC_0, SC_0}, {SC_7, SC_0}, {SC_E, SC_0}, {SC_5, SC_1},
359 {SC_C, SC_1}, {SC_3, SC_2}, {SC_A, SC_2}, {SC_1, SC_3},
360 {SC_8, SC_3}, {SC_F, SC_3}, {SC_6, SC_4}, {SC_D, SC_4},
361 {SC_4, SC_5}, {SC_B, SC_5}, {SC_2, SC_6}, {SC_9, SC_6} },
363 { {SC_0, SC_0}, {SC_8, SC_0}, {SC_0, SC_1}, {SC_8, SC_1},
364 {SC_0, SC_2}, {SC_8, SC_2}, {SC_0, SC_3}, {SC_8, SC_3},
365 {SC_0, SC_4}, {SC_8, SC_4}, {SC_0, SC_5}, {SC_8, SC_5},
366 {SC_0, SC_6}, {SC_8, SC_6}, {SC_0, SC_7}, {SC_8, SC_7} },
368 { {SC_0, SC_0}, {SC_9, SC_0}, {SC_2, SC_1}, {SC_B, SC_1},
369 {SC_4, SC_2}, {SC_D, SC_2}, {SC_6, SC_3}, {SC_F, SC_3},
370 {SC_8, SC_4}, {SC_1, SC_5}, {SC_A, SC_5}, {SC_3, SC_6},
371 {SC_C, SC_6}, {SC_5, SC_7}, {SC_E, SC_7}, {SC_7, SC_8} },
373 { {SC_0, SC_0}, {SC_A, SC_0}, {SC_4, SC_1}, {SC_E, SC_1},
374 {SC_8, SC_2}, {SC_2, SC_3}, {SC_C, SC_3}, {SC_6, SC_4},
375 {SC_0, SC_5}, {SC_A, SC_5}, {SC_4, SC_6}, {SC_E, SC_6},
376 {SC_8, SC_7}, {SC_2, SC_8}, {SC_C, SC_8}, {SC_6, SC_9} },
378 { {SC_0, SC_0}, {SC_B, SC_0}, {SC_6, SC_1}, {SC_1, SC_2},
379 {SC_C, SC_2}, {SC_7, SC_3}, {SC_2, SC_4}, {SC_D, SC_4},
380 {SC_8, SC_5}, {SC_3, SC_6}, {SC_E, SC_6}, {SC_9, SC_7},
381 {SC_4, SC_8}, {SC_F, SC_8}, {SC_A, SC_9}, {SC_5, SC_A} },
383 { {SC_0, SC_0}, {SC_C, SC_0}, {SC_8, SC_1}, {SC_4, SC_2},
384 {SC_0, SC_3}, {SC_C, SC_3}, {SC_8, SC_4}, {SC_4, SC_5},
385 {SC_0, SC_6}, {SC_C, SC_6}, {SC_8, SC_7}, {SC_4, SC_8},
386 {SC_0, SC_9}, {SC_C, SC_9}, {SC_8, SC_A}, {SC_4, SC_B} },
388 { {SC_0, SC_0}, {SC_D, SC_0}, {SC_A, SC_1}, {SC_7, SC_2},
389 {SC_4, SC_3}, {SC_1, SC_4}, {SC_E, SC_4}, {SC_B, SC_5},
390 {SC_8, SC_6}, {SC_5, SC_7}, {SC_2, SC_8}, {SC_F, SC_8},
391 {SC_C, SC_9}, {SC_9, SC_A}, {SC_6, SC_B}, {SC_3, SC_C} },
393 { {SC_0, SC_0}, {SC_E, SC_0}, {SC_C, SC_1}, {SC_A, SC_2},
394 {SC_8, SC_3}, {SC_6, SC_4}, {SC_4, SC_5}, {SC_2, SC_6},
395 {SC_0, SC_7}, {SC_E, SC_7}, {SC_C, SC_8}, {SC_A, SC_9},
396 {SC_8, SC_A}, {SC_6, SC_B}, {SC_4, SC_C}, {SC_2, SC_D} },
398 { {SC_0, SC_0}, {SC_F, SC_0}, {SC_E, SC_1}, {SC_D, SC_2},
399 {SC_C, SC_3}, {SC_B, SC_4}, {SC_A, SC_5}, {SC_9, SC_6},
400 {SC_8, SC_7}, {SC_7, SC_8}, {SC_6, SC_9}, {SC_5, SC_A},
401 {SC_4, SC_B}, {SC_3, SC_C}, {SC_2, SC_D}, {SC_1, SC_E} }
404 static char const shrs_table[16][4][2] = {
405 { {SC_0, SC_0}, {SC_0, SC_0}, {SC_0, SC_0}, {SC_0, SC_0} },
406 { {SC_1, SC_0}, {SC_0, SC_8}, {SC_0, SC_4}, {SC_0, SC_2} },
407 { {SC_2, SC_0}, {SC_1, SC_0}, {SC_0, SC_8}, {SC_0, SC_4} },
408 { {SC_3, SC_0}, {SC_1, SC_8}, {SC_0, SC_C}, {SC_0, SC_6} },
409 { {SC_4, SC_0}, {SC_2, SC_0}, {SC_1, SC_0}, {SC_0, SC_8} },
410 { {SC_5, SC_0}, {SC_2, SC_8}, {SC_1, SC_4}, {SC_0, SC_A} },
411 { {SC_6, SC_0}, {SC_3, SC_0}, {SC_1, SC_8}, {SC_0, SC_C} },
412 { {SC_7, SC_0}, {SC_3, SC_8}, {SC_1, SC_C}, {SC_0, SC_E} },
413 { {SC_8, SC_0}, {SC_4, SC_0}, {SC_2, SC_0}, {SC_1, SC_0} },
414 { {SC_9, SC_0}, {SC_4, SC_8}, {SC_2, SC_4}, {SC_1, SC_2} },
415 { {SC_A, SC_0}, {SC_5, SC_0}, {SC_2, SC_8}, {SC_1, SC_4} },
416 { {SC_B, SC_0}, {SC_5, SC_8}, {SC_2, SC_C}, {SC_1, SC_6} },
417 { {SC_C, SC_0}, {SC_6, SC_0}, {SC_3, SC_0}, {SC_1, SC_8} },
418 { {SC_D, SC_0}, {SC_6, SC_8}, {SC_3, SC_4}, {SC_1, SC_A} },
419 { {SC_E, SC_0}, {SC_7, SC_0}, {SC_3, SC_8}, {SC_1, SC_C} },
420 { {SC_F, SC_0}, {SC_7, SC_8}, {SC_3, SC_C}, {SC_1, SC_E} }
423 /** converting a digit to a binary string */
424 static const char *binary_table[16] = {
425 "0000", "0001", "0010", "0011", "0100", "0101", "0110", "0111",
426 "1000", "1001", "1010", "1011", "1100", "1101", "1110", "1111"
429 /*****************************************************************************
431 *****************************************************************************/
432 static void _fail_char(const char *str, size_t len, const char fchar, int pos,
433 const char *file, int line) {
435 printf("Unexpected character '%c' in %s:%d\n", fchar, file, line);
436 while (len-- && *str) printf("%c", *str++); printf("\n");
437 while (--pos) printf(" "); printf("^\n");
442 * implements the bitwise NOT operation
444 static void do_bitnot(const char *val, char *buffer) {
447 for (counter = 0; counter<calc_buffer_size; counter++)
448 buffer[counter] = not_table[_val(val[counter])];
452 * implements the bitwise OR operation
454 static void do_bitor(const char *val1, const char *val2, char *buffer) {
457 for (counter = 0; counter<calc_buffer_size; counter++)
458 buffer[counter] = or_table[_val(val1[counter])][_val(val2[counter])];
462 * implements the bitwise eXclusive OR operation
464 static void do_bitxor(const char *val1, const char *val2, char *buffer) {
467 for (counter = 0; counter<calc_buffer_size; counter++)
468 buffer[counter] = xor_table[_val(val1[counter])][_val(val2[counter])];
472 * implements the bitwise AND operation
474 static void do_bitand(const char *val1, const char *val2, char *buffer) {
477 for (counter = 0; counter<calc_buffer_size; counter++)
478 buffer[counter] = and_table[_val(val1[counter])][_val(val2[counter])];
482 * returns the sign bit.
484 * @todo This implementation is wrong, as it returns the highest bit of the buffer
485 * NOT the highest bit depending on the real mode
487 static int do_sign(const char *val) {
488 return (val[calc_buffer_size-1] <= SC_7) ? (1) : (-1);
492 * returns non-zero if bit at position pos is set
494 static int do_bit(const char *val, int pos) {
496 int nibble = pos >> 2;
498 return _bitisset(val[nibble], bit);
502 * Implements a fast ADD + 1
504 static void do_inc(const char *val, char *buffer) {
507 while (counter++ < calc_buffer_size) {
512 /* No carry here, *val != SC_F */
513 *buffer = add_table[_val(*val)][SC_1][0];
517 /* here a carry could be lost, this is intended because this should
518 * happen only when a value changes sign. */
522 * Implements a unary MINUS
524 static void do_negate(const char *val, char *buffer) {
525 do_bitnot(val, buffer);
526 do_inc(buffer, buffer);
530 * Implements a binary ADD
532 * @todo The implementation of carry is wrong, as it is the
533 * calc_buffer_size carry, not the mode depending
535 static void do_add(const char *val1, const char *val2, char *buffer) {
537 const char *add1, *add2;
540 for (counter = 0; counter < calc_buffer_size; counter++) {
541 add1 = add_table[_val(val1[counter])][_val(val2[counter])];
542 add2 = add_table[_val(add1[0])][_val(carry)];
543 /* carry might be zero */
544 buffer[counter] = add2[0];
545 carry = add_table[_val(add1[1])][_val(add2[1])][0];
547 carry_flag = carry != SC_0;
551 * Implements a binary SUB
553 static void do_sub(const char *val1, const char *val2, char *buffer) {
554 char *temp_buffer = alloca(calc_buffer_size); /* intermediate buffer to hold -val2 */
556 do_negate(val2, temp_buffer);
557 do_add(val1, temp_buffer, buffer);
561 * Implements a binary MUL
563 static void do_mul(const char *val1, const char *val2, char *buffer) {
564 char *temp_buffer; /* result buffer */
565 char *neg_val1; /* abs of val1 */
566 char *neg_val2; /* abs of val2 */
568 const char *mul, *add1, *add2; /* intermediate result containers */
569 char carry = SC_0; /* container for carries */
570 char sign = 0; /* marks result sign */
571 int c_inner, c_outer; /* loop counters */
573 temp_buffer = alloca(calc_buffer_size);
574 neg_val1 = alloca(calc_buffer_size);
575 neg_val2 = alloca(calc_buffer_size);
577 /* init result buffer to zeros */
578 memset(temp_buffer, SC_0, calc_buffer_size);
580 /* the multiplication works only for positive values, for negative values *
581 * it is necessary to negate them and adjust the result accordingly */
582 if (do_sign(val1) == -1) {
583 do_negate(val1, neg_val1);
587 if (do_sign(val2) == -1) {
588 do_negate(val2, neg_val2);
593 for (c_outer = 0; c_outer < max_value_size; c_outer++) {
594 if (val2[c_outer] != SC_0) {
595 for (c_inner = 0; c_inner < max_value_size; c_inner++) {
596 /* do the following calculation: *
597 * Add the current carry, the value at position c_outer+c_inner *
598 * and the result of the multiplication of val1[c_inner] and *
599 * val2[c_outer]. This is the usual pen-and-paper multiplication. */
601 /* multiplicate the two digits */
602 mul = mul_table[_val(val1[c_inner])][_val(val2[c_outer])];
603 /* add old value to result of multiplication */
604 add1 = add_table[_val(temp_buffer[c_inner + c_outer])][_val(mul[0])];
605 /* add carry to the sum */
606 add2 = add_table[_val(add1[0])][_val(carry)];
608 /* all carries together result in new carry. This is always smaller *
610 * Both multiplicands, the carry and the value already in the temp *
611 * buffer are single digits and their value is therefore at most *
614 * (b-1)(b-1)+(b-1)+(b-1) = b*b-1 *
615 * The tables list all operations rem b, so the carry is at most *
616 * (b*b-1)rem b = -1rem b = b-1 */
617 carry = add_table[_val(mul[1])][_val(add1[1])][0];
618 carry = add_table[_val(carry)][_val(add2[1])][0];
620 temp_buffer[c_inner + c_outer] = add2[0];
623 /* A carry may hang over */
624 /* c_outer is always smaller than max_value_size! */
625 temp_buffer[max_value_size + c_outer] = carry;
631 do_negate(temp_buffer, buffer);
633 memcpy(buffer, temp_buffer, calc_buffer_size);
637 * Shift the buffer to left and add a 4 bit digit
639 static void do_push(const char digit, char *buffer) {
642 for (counter = calc_buffer_size - 2; counter >= 0; counter--) {
643 buffer[counter+1] = buffer[counter];
649 * Implements truncating integer division and remainder.
651 * Note: This is MOST slow
653 static void do_divmod(const char *rDividend, const char *divisor, char *quot, char *rem) {
654 const char *dividend = rDividend;
655 const char *minus_divisor;
659 char div_sign = 0; /* remember division result sign */
660 char rem_sign = 0; /* remember remainder result sign */
662 int c_dividend; /* loop counters */
664 neg_val1 = alloca(calc_buffer_size);
665 neg_val2 = alloca(calc_buffer_size);
667 /* clear result buffer */
668 memset(quot, SC_0, calc_buffer_size);
669 memset(rem, SC_0, calc_buffer_size);
671 /* if the divisor is zero this won't work (quot is zero) */
672 if (sc_comp(divisor, quot) == 0) assert(0 && "division by zero!");
674 /* if the dividend is zero result is zero (quot is zero) */
675 if (sc_comp(dividend, quot) == 0)
678 if (do_sign(dividend) == -1) {
679 do_negate(dividend, neg_val1);
685 do_negate(divisor, neg_val2);
686 if (do_sign(divisor) == -1) {
688 minus_divisor = divisor;
691 minus_divisor = neg_val2;
693 /* if divisor >= dividend division is easy
694 * (remember these are absolute values) */
695 switch (sc_comp(dividend, divisor)) {
696 case 0: /* dividend == divisor */
700 case -1: /* dividend < divisor */
701 memcpy(rem, dividend, calc_buffer_size);
704 default: /* unluckily division is necessary :( */
708 for (c_dividend = calc_buffer_size - 1; c_dividend >= 0; c_dividend--) {
709 do_push(dividend[c_dividend], rem);
712 if (sc_comp(rem, divisor) != -1) { /* remainder >= divisor */
713 /* subtract until the remainder becomes negative, this should
714 * be faster than comparing remainder with divisor */
715 do_add(rem, minus_divisor, rem);
717 while (do_sign(rem) == 1) {
718 quot[0] = add_table[_val(quot[0])][SC_1][0];
719 do_add(rem, minus_divisor, rem);
722 /* subtracted one too much */
723 do_add(rem, divisor, rem);
727 /* sets carry if remainder is non-zero ??? */
728 carry_flag = !sc_is_zero(rem);
731 do_negate(quot, quot);
738 * Implements a Shift Left, which can either preserve the sign bit
741 * @todo Assertions seems to be wrong
743 static void do_shl(const char *val1, char *buffer, long shift_cnt, int bitsize, unsigned is_signed) {
751 assert((shift_cnt >= 0) || (0 && "negative leftshift"));
752 assert(((do_sign(val1) != -1) || is_signed) || (0 && "unsigned mode and negative value"));
753 assert(((!_bitisset(val1[(bitsize-1)/4], (bitsize-1)%4)) || !is_signed || (do_sign(val1) == -1)) || (0 && "value is positive, should be negative"));
754 assert(((_bitisset(val1[(bitsize-1)/4], (bitsize-1)%4)) || !is_signed || (do_sign(val1) == 1)) || (0 && "value is negative, should be positive"));
756 /* if shifting far enough the result is zero */
757 if (shift_cnt >= bitsize) {
758 memset(buffer, SC_0, calc_buffer_size);
762 shift = shift_table[_val(shift_cnt%4)]; /* this is 2 ** (offset % 4) */
763 shift_cnt = shift_cnt / 4;
765 /* shift the single digits some bytes (offset) and some bits (table)
767 for (counter = 0; counter < bitsize/4 - shift_cnt; counter++) {
768 shl = mul_table[_val(val1[counter])][_val(shift)];
769 buffer[counter + shift_cnt] = or_table[_val(shl[0])][_val(carry)];
773 shl = mul_table[_val(val1[counter])][_val(shift)];
774 buffer[counter + shift_cnt] = or_table[_val(shl[0])][_val(carry)];
777 bitoffset = counter - 1;
780 /* fill with zeroes */
781 for (counter = 0; counter < shift_cnt; counter++)
782 buffer[counter] = SC_0;
784 /* if the mode was signed, change sign when the mode's msb is now 1 */
785 shift_cnt = bitoffset + shift_cnt;
786 bitoffset = (bitsize-1) % 4;
787 if (is_signed && _bitisset(buffer[shift_cnt], bitoffset)) {
788 /* this sets the upper bits of the leftmost digit */
789 buffer[shift_cnt] = or_table[_val(buffer[shift_cnt])][_val(min_digit[bitoffset])];
790 for (counter = shift_cnt+1; counter < calc_buffer_size; counter++) {
791 buffer[counter] = SC_F;
793 } else if (is_signed && !_bitisset(buffer[shift_cnt], bitoffset)) {
794 /* this clears the upper bits of the leftmost digit */
795 buffer[shift_cnt] = and_table[_val(buffer[shift_cnt])][_val(max_digit[bitoffset])];
796 for (counter = shift_cnt+1; counter < calc_buffer_size; counter++) {
797 buffer[counter] = SC_0;
803 * Implements a Shift Right, which can either preserve the sign bit
806 * @param bitsize bitsize of the value to be shifted
808 * @todo Assertions seems to be wrong
810 static void do_shr(const char *val1, char *buffer, long shift_cnt, int bitsize, unsigned is_signed, int signed_shift) {
815 int shift_mod, shift_nib;
820 assert((shift_cnt >= 0) || (0 && "negative rightshift"));
821 assert(((!_bitisset(val1[(bitsize-1)/4], (bitsize-1)%4)) || !is_signed || (do_sign(val1) == -1)) || (0 && "value is positive, should be negative"));
822 assert(((_bitisset(val1[(bitsize-1)/4], (bitsize-1)%4)) || !is_signed || (do_sign(val1) == 1)) || (0 && "value is negative, should be positive"));
824 sign = signed_shift && do_bit(val1, bitsize - 1) ? SC_F : SC_0;
826 /* if shifting far enough the result is either 0 or -1 */
827 if (shift_cnt >= bitsize) {
828 if (!sc_is_zero(val1)) {
831 memset(buffer, sign, calc_buffer_size);
835 shift_mod = shift_cnt & 3;
836 shift_nib = shift_cnt >> 2;
838 /* check if any bits are lost, and set carry_flag if so */
839 for (counter = 0; counter < shift_nib; ++counter) {
840 if (val1[counter] != 0) {
845 if ((_val(val1[counter]) & ((1<<shift_mod)-1)) != 0)
848 /* shift digits to the right with offset, carry and all */
849 buffer[0] = shrs_table[_val(val1[shift_nib])][shift_mod][0];
850 for (counter = 1; counter < ((bitsize + 3) >> 2) - shift_nib; counter++) {
851 shrs = shrs_table[_val(val1[counter + shift_nib])][shift_mod];
852 buffer[counter] = shrs[0];
853 buffer[counter - 1] = or_table[_val(buffer[counter-1])][_val(shrs[1])];
856 /* the last digit is special in regard of signed/unsigned shift */
857 bitoffset = bitsize & 3;
858 msd = sign; /* most significant digit */
860 /* remove sign bits if mode was signed and this is an unsigned shift */
861 if (!signed_shift && is_signed) {
862 msd = and_table[_val(msd)][_val(max_digit[bitoffset])];
865 shrs = shrs_table[_val(msd)][shift_mod];
867 /* signed shift and signed mode and negative value means all bits to the left are set */
868 if (signed_shift && sign == SC_F) {
869 buffer[counter] = or_table[_val(shrs[0])][_val(min_digit[bitoffset])];
871 buffer[counter] = shrs[0];
875 buffer[counter - 1] = or_table[_val(buffer[counter-1])][_val(shrs[1])];
877 /* fill with SC_F or SC_0 depending on sign */
878 for (counter++; counter < calc_buffer_size; counter++) {
879 buffer[counter] = sign;
884 * Implements a Rotate Left.
885 * positive: low-order -> high order, negative other direction
887 static void do_rotl(const char *val1, char *buffer, long offset, int radius, unsigned is_signed) {
889 temp1 = alloca(calc_buffer_size);
890 temp2 = alloca(calc_buffer_size);
892 offset = offset % radius;
894 /* rotation by multiples of the type length is identity */
896 memmove(buffer, val1, calc_buffer_size);
900 do_shl(val1, temp1, offset, radius, is_signed);
901 do_shr(val1, temp2, radius - offset, radius, is_signed, 0);
902 do_bitor(temp1, temp2, buffer);
903 carry_flag = 0; /* set by shr, but due to rot this is false */
906 /*****************************************************************************
907 * public functions, declared in strcalc.h
908 *****************************************************************************/
909 const void *sc_get_buffer(void) {
910 return (void*)calc_buffer;
913 int sc_get_buffer_length(void) {
914 return calc_buffer_size;
918 * Do sign extension if the mode is signed, otherwise to zero extension.
920 void sign_extend(void *buffer, ir_mode *mode) {
921 char *calc_buffer = buffer;
922 int bits = get_mode_size_bits(mode) - 1;
923 int nibble = bits >> 2;
924 int max = max_digit[bits & 3];
927 if (mode_is_signed(mode)) {
928 if (calc_buffer[nibble] > max) {
929 /* sign bit is set, we need sign expansion */
931 for (i = nibble + 1; i < calc_buffer_size; ++i)
932 calc_buffer[i] = SC_F;
933 calc_buffer[nibble] = or_table[(int)calc_buffer[nibble]][(int)sex_digit[bits & 3]];
935 /* set all bits to zero */
936 for (i = nibble + 1; i < calc_buffer_size; ++i)
937 calc_buffer[i] = SC_0;
938 calc_buffer[nibble] = and_table[(int)calc_buffer[nibble]][(int)zex_digit[bits & 3]];
941 /* do zero extension */
942 for (i = nibble + 1; i < calc_buffer_size; ++i)
943 calc_buffer[i] = SC_0;
944 calc_buffer[nibble] = and_table[(int)calc_buffer[nibble]][(int)zex_digit[bits & 3]];
948 /* FIXME doesn't check for overflows */
949 void sc_val_from_str(const char *str, unsigned int len, void *buffer, ir_mode *mode) {
950 const char *orig_str = str;
951 unsigned int orig_len = len;
956 base = alloca(calc_buffer_size);
957 val = alloca(calc_buffer_size);
959 /* verify valid pointers (not null) */
961 /* a string no characters long is an error */
964 if (buffer == NULL) buffer = calc_buffer;
966 CLEAR_BUFFER(buffer);
970 /* strip leading spaces */
971 while ((len > 0) && (*str == ' ')) { len--; str++; }
973 /* if the first two characters are 0x or 0X -> hex
974 * if the first is a 0 -> oct
975 * else dec, strip leading -/+ and remember sign
977 * only a + or - sign is no number resulting in an error */
981 if (str[1] == 'x' || str[1] == 'X') { /* hex */
984 base[1] = SC_1; base[0] = SC_0;
988 base[1] = SC_0; base[0] = SC_8;
995 base[1] = SC_0; base[0] = SC_A;
1002 base[1] = SC_0; base[0] = SC_A;
1005 default: /* dec, else would have begun with 0x or 0 */
1006 base[1] = SC_0; base[0] = SC_A;
1008 } else { /* dec, else would have begun with 0x or 0 */
1009 base[1] = SC_0; base[0] = SC_A;
1012 /* BEGIN string evaluation, from left to right */
1021 if (base[0] > SC_A || base[1] > SC_0) { /* (base > 10) */
1022 val[0] = _digit((*str)-'a'+10);
1025 fail_char(orig_str, orig_len, *str, str-orig_str+1);
1034 if (base[0] > SC_A || base[1] > SC_0) { /* (base > 10) */
1035 val[0] = _digit((*str)-'A'+10);
1038 fail_char(orig_str, orig_len, *str, str-orig_str+1);
1043 if (base[0] > SC_8 || base[1] > SC_0) { /* (base > 8) */
1044 val[0] = _digit((*str)-'0');
1047 fail_char(orig_str, orig_len, *str, str-orig_str+1);
1058 val[0] = _digit((*str)-'0');
1062 fail_char(orig_str, orig_len, *str, str-orig_str+1);
1063 } /* switch(*str) */
1065 /* Radix conversion from base b to base B:
1066 * (UnUn-1...U1U0)b == ((((Un*b + Un-1)*b + ...)*b + U1)*b + U0)B */
1067 do_mul(base, calc_buffer, calc_buffer); /* multiply current value with base */
1068 do_add(val, calc_buffer, calc_buffer); /* add next digit to current value */
1070 /* get ready for the next letter */
1073 } /* while (len > 0 ) */
1076 do_negate(calc_buffer, calc_buffer);
1078 /* beware: even if hex numbers have no sign, we need sign extension here */
1079 sign_extend(calc_buffer, mode);
1082 void sc_val_from_long(long value, void *buffer) {
1084 char sign, is_minlong;
1086 if (buffer == NULL) buffer = calc_buffer;
1090 is_minlong = value == LONG_MIN;
1092 /* use absolute value, special treatment of MIN_LONG to avoid overflow */
1100 CLEAR_BUFFER(buffer);
1102 while ((value != 0) && (pos < (char*)buffer + calc_buffer_size)) {
1103 *pos++ = _digit(value & 0xf);
1109 do_inc(buffer, buffer);
1111 do_negate(buffer, buffer);
1115 void sc_val_from_ulong(unsigned long value, void *buffer) {
1118 if (buffer == NULL) buffer = calc_buffer;
1121 while (pos < (unsigned char *)buffer + calc_buffer_size) {
1122 *pos++ = (unsigned char)_digit(value & 0xf);
1127 long sc_val_to_long(const void *val) {
1131 for (i = calc_buffer_size - 1; i >= 0; i--) {
1132 l = (l << 4) + _val(((char *)val)[i]);
1137 void sc_min_from_bits(unsigned int num_bits, unsigned int sign, void *buffer) {
1141 if (buffer == NULL) buffer = calc_buffer;
1142 CLEAR_BUFFER(buffer);
1144 if (!sign) return; /* unsigned means minimum is 0(zero) */
1148 bits = num_bits - 1;
1149 for (i = 0; i < bits/4; i++)
1152 *pos++ = min_digit[bits%4];
1154 for (i++; i <= calc_buffer_size - 1; i++)
1158 void sc_max_from_bits(unsigned int num_bits, unsigned int sign, void *buffer) {
1162 if (buffer == NULL) buffer = calc_buffer;
1163 CLEAR_BUFFER(buffer);
1166 bits = num_bits - sign;
1167 for (i = 0; i < bits/4; i++)
1170 *pos++ = max_digit[bits%4];
1172 for (i++; i <= calc_buffer_size - 1; i++)
1176 void sc_truncate(unsigned int num_bits, void *buffer) {
1177 char *cbuffer = buffer;
1178 char *pos = cbuffer + (num_bits / 4);
1179 char *end = cbuffer + calc_buffer_size;
1183 switch(num_bits % 4) {
1184 case 0: /* nothing to do */ break;
1185 case 1: *pos = and_table[_val(*pos)][SC_1]; pos++; break;
1186 case 2: *pos = and_table[_val(*pos)][SC_3]; pos++; break;
1187 case 3: *pos = and_table[_val(*pos)][SC_7]; pos++; break;
1190 for( ; pos < end; ++pos)
1194 int sc_comp(const void* value1, const void* value2) {
1195 int counter = calc_buffer_size - 1;
1196 const char *val1 = (const char *)value1;
1197 const char *val2 = (const char *)value2;
1199 /* compare signs first:
1200 * the loop below can only compare values of the same sign! */
1201 if (do_sign(val1) != do_sign(val2))
1202 return (do_sign(val1) == 1)?(1):(-1);
1204 /* loop until two digits differ, the values are equal if there
1205 * are no such two digits */
1206 while (val1[counter] == val2[counter]) {
1208 if (counter < 0) return 0;
1211 /* the leftmost digit is the most significant, so this returns
1212 * the correct result.
1213 * This implies the digit enum is ordered */
1214 return (val1[counter] > val2[counter]) ? (1) : (-1);
1217 int sc_get_highest_set_bit(const void *value) {
1218 const char *val = (const char*)value;
1221 high = calc_buffer_size * 4 - 1;
1223 for (counter = calc_buffer_size-1; counter >= 0; counter--) {
1224 if (val[counter] == SC_0)
1227 if (val[counter] > SC_7) return high;
1228 else if (val[counter] > SC_3) return high - 1;
1229 else if (val[counter] > SC_1) return high - 2;
1230 else return high - 3;
1236 int sc_get_lowest_set_bit(const void *value) {
1237 const char *val = (const char*)value;
1241 for (counter = 0; counter < calc_buffer_size; counter++) {
1242 switch (val[counter]) {
1269 int sc_get_bit_at(const void *value, unsigned pos) {
1270 const char *val = value;
1271 unsigned nibble = pos >> 2;
1273 if (and_table[(int) val[nibble]][(int) shift_table[pos & 3]] != SC_0)
1278 void sc_set_bit_at(void *value, unsigned pos)
1281 unsigned nibble = pos >> 2;
1283 val[nibble] = or_table[(int)val[nibble]][(int)shift_table[pos & 3]];
1286 int sc_is_zero(const void *value) {
1287 const char* val = (const char *)value;
1290 for (counter = 0; counter < calc_buffer_size; ++counter) {
1291 if (val[counter] != SC_0)
1297 int sc_is_negative(const void *value) {
1298 return do_sign(value) == -1;
1301 int sc_had_carry(void) {
1305 unsigned char sc_sub_bits(const void *value, int len, unsigned byte_ofs) {
1306 const char *val = (const char *)value;
1307 int nibble_ofs = 2 * byte_ofs;
1310 /* the current scheme uses one byte to store a nibble */
1311 if (4 * nibble_ofs >= len)
1314 res = _val(val[nibble_ofs]);
1315 if (len > 4 * (nibble_ofs + 1))
1316 res |= _val(val[nibble_ofs + 1]) << 4;
1318 /* kick bits outsize */
1319 if (len - 8 * byte_ofs < 8) {
1320 res &= (1 << (len - 8 * byte_ofs)) - 1;
1326 * convert to a string
1327 * FIXME: Doesn't check buffer bounds
1329 const char *sc_print(const void *value, unsigned bits, enum base_t base, int signed_mode) {
1330 static const char big_digits[] = "0123456789ABCDEF";
1331 static const char small_digits[] = "0123456789abcdef";
1333 char *base_val, *div1_res, *div2_res, *rem_res;
1334 int counter, nibbles, i, sign, mask;
1337 const char *val = (const char *)value;
1341 const char *digits = small_digits;
1343 base_val = alloca(calc_buffer_size);
1344 div1_res = alloca(calc_buffer_size);
1345 div2_res = alloca(calc_buffer_size);
1346 rem_res = alloca(calc_buffer_size);
1348 pos = output_buffer + bit_pattern_size;
1353 bits = bit_pattern_size;
1354 #ifdef STRCALC_DEBUG_FULLPRINT
1358 nibbles = bits >> 2;
1362 digits = big_digits;
1364 for (counter = 0; counter < nibbles; ++counter) {
1365 *(--pos) = digits[_val(val[counter])];
1366 #ifdef STRCALC_DEBUG_GROUPPRINT
1367 if ((counter+1)%8 == 0)
1372 /* last nibble must be masked */
1374 mask = zex_digit[(bits & 3) - 1];
1375 x = and_table[_val(val[counter++])][mask];
1376 *(--pos) = digits[_val(x)];
1379 /* now kill zeros */
1380 for (; counter > 1; --counter, ++pos) {
1381 #ifdef STRCALC_DEBUG_GROUPPRINT
1382 if (pos[0] == ' ') ++pos;
1390 for (counter = 0; counter < nibbles; ++counter) {
1392 p = binary_table[_val(val[counter])];
1399 /* last nibble must be masked */
1401 mask = zex_digit[(bits & 3) - 1];
1402 x = and_table[_val(val[counter++])][mask];
1405 p = binary_table[_val(x)];
1412 /* now kill zeros */
1413 for (counter <<= 2; counter > 1; --counter, ++pos)
1420 memset(base_val, SC_0, calc_buffer_size);
1421 base_val[0] = base == SC_DEC ? SC_A : SC_8;
1425 if (signed_mode && base == SC_DEC) {
1426 /* check for negative values */
1427 if (do_bit(val, bits - 1)) {
1428 do_negate(val, div2_res);
1434 /* transfer data into oscillating buffers */
1435 memset(div1_res, SC_0, calc_buffer_size);
1436 for (counter = 0; counter < nibbles; ++counter)
1437 div1_res[counter] = p[counter];
1439 /* last nibble must be masked */
1441 mask = zex_digit[(bits & 3) - 1];
1442 div1_res[counter] = and_table[_val(p[counter])][mask];
1449 do_divmod(m, base_val, n, rem_res);
1453 *(--pos) = digits[_val(rem_res[0])];
1456 for (i = 0; i < calc_buffer_size; ++i)
1467 panic("Unsupported base %d", base);
1472 void init_strcalc(int precision) {
1473 if (calc_buffer == NULL) {
1474 if (precision <= 0) precision = SC_DEFAULT_PRECISION;
1476 /* round up to multiple of 4 */
1477 precision = (precision + 3) & ~3;
1479 bit_pattern_size = (precision);
1480 calc_buffer_size = (precision / 2);
1481 max_value_size = (precision / 4);
1483 calc_buffer = XMALLOCN(char, calc_buffer_size + 1);
1484 output_buffer = XMALLOCN(char, bit_pattern_size + 1);
1486 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));
1491 void finish_strcalc(void) {
1492 free(calc_buffer); calc_buffer = NULL;
1493 free(output_buffer); output_buffer = NULL;
1496 int sc_get_precision(void) {
1497 return bit_pattern_size;
1501 void sc_add(const void *value1, const void *value2, void *buffer) {
1502 CLEAR_BUFFER(calc_buffer);
1505 DEBUGPRINTF_COMPUTATION(("%s + ", sc_print_hex(value1)));
1506 DEBUGPRINTF_COMPUTATION(("%s -> ", sc_print_hex(value2)));
1508 do_add(value1, value2, calc_buffer);
1510 DEBUGPRINTF_COMPUTATION(("%s\n", sc_print_hex(calc_buffer)));
1512 if ((buffer != NULL) && (buffer != calc_buffer)) {
1513 memcpy(buffer, calc_buffer, calc_buffer_size);
1517 void sc_sub(const void *value1, const void *value2, void *buffer) {
1518 CLEAR_BUFFER(calc_buffer);
1521 DEBUGPRINTF_COMPUTATION(("%s - ", sc_print_hex(value1)));
1522 DEBUGPRINTF_COMPUTATION(("%s -> ", sc_print_hex(value2)));
1524 do_sub(value1, value2, calc_buffer);
1526 DEBUGPRINTF_COMPUTATION(("%s\n", sc_print_hex(calc_buffer)));
1528 if ((buffer != NULL) && (buffer != calc_buffer)) {
1529 memcpy(buffer, calc_buffer, calc_buffer_size);
1533 void sc_neg(const void *value1, void *buffer) {
1536 DEBUGPRINTF_COMPUTATION(("- %s ->", sc_print_hex(value1)));
1538 do_negate(value1, calc_buffer);
1540 DEBUGPRINTF_COMPUTATION(("%s\n", sc_print_hex(calc_buffer)));
1542 if ((buffer != NULL) && (buffer != calc_buffer)) {
1543 memcpy(buffer, calc_buffer, calc_buffer_size);
1547 void sc_and(const void *value1, const void *value2, void *buffer) {
1548 CLEAR_BUFFER(calc_buffer);
1551 DEBUGPRINTF_COMPUTATION(("%s & ", sc_print_hex(value1)));
1552 DEBUGPRINTF_COMPUTATION(("%s -> ", sc_print_hex(value2)));
1554 do_bitand(value1, value2, calc_buffer);
1556 DEBUGPRINTF_COMPUTATION(("%s\n", sc_print_hex(calc_buffer)));
1558 if ((buffer != NULL) && (buffer != calc_buffer)) {
1559 memcpy(buffer, calc_buffer, calc_buffer_size);
1563 void sc_or(const void *value1, const void *value2, void *buffer) {
1564 CLEAR_BUFFER(calc_buffer);
1567 DEBUGPRINTF_COMPUTATION(("%s | ", sc_print_hex(value1)));
1568 DEBUGPRINTF_COMPUTATION(("%s -> ", sc_print_hex(value2)));
1570 do_bitor(value1, value2, calc_buffer);
1572 DEBUGPRINTF_COMPUTATION(("%s\n", sc_print_hex(calc_buffer)));
1574 if ((buffer != NULL) && (buffer != calc_buffer)) {
1575 memcpy(buffer, calc_buffer, calc_buffer_size);
1579 void sc_xor(const void *value1, const void *value2, void *buffer) {
1580 CLEAR_BUFFER(calc_buffer);
1583 DEBUGPRINTF_COMPUTATION(("%s ^ ", sc_print_hex(value1)));
1584 DEBUGPRINTF_COMPUTATION(("%s -> ", sc_print_hex(value2)));
1586 do_bitxor(value1, value2, calc_buffer);
1588 DEBUGPRINTF_COMPUTATION(("%s\n", sc_print_hex(calc_buffer)));
1590 if ((buffer != NULL) && (buffer != calc_buffer)) {
1591 memcpy(buffer, calc_buffer, calc_buffer_size);
1595 void sc_not(const void *value1, void *buffer) {
1596 CLEAR_BUFFER(calc_buffer);
1599 DEBUGPRINTF_COMPUTATION(("~ %s ->", sc_print_hex(value1)));
1601 do_bitnot(value1, calc_buffer);
1603 DEBUGPRINTF_COMPUTATION(("%s\n", sc_print_hex(calc_buffer)));
1605 if ((buffer != NULL) && (buffer != calc_buffer)) {
1606 memcpy(buffer, calc_buffer, calc_buffer_size);
1610 void sc_mul(const void *value1, const void *value2, void *buffer) {
1611 CLEAR_BUFFER(calc_buffer);
1614 DEBUGPRINTF_COMPUTATION(("%s * ", sc_print_hex(value1)));
1615 DEBUGPRINTF_COMPUTATION(("%s -> ", sc_print_hex(value2)));
1617 do_mul(value1, value2, calc_buffer);
1619 DEBUGPRINTF_COMPUTATION(("%s\n", sc_print_hex(calc_buffer)));
1621 if ((buffer != NULL) && (buffer != calc_buffer)) {
1622 memcpy(buffer, calc_buffer, calc_buffer_size);
1626 void sc_div(const void *value1, const void *value2, void *buffer) {
1627 /* temp buffer holding unused result of divmod */
1628 char *unused_res = alloca(calc_buffer_size);
1630 CLEAR_BUFFER(calc_buffer);
1633 DEBUGPRINTF_COMPUTATION(("%s / ", sc_print_hex(value1)));
1634 DEBUGPRINTF_COMPUTATION(("%s -> ", sc_print_hex(value2)));
1636 do_divmod(value1, value2, calc_buffer, unused_res);
1638 DEBUGPRINTF_COMPUTATION(("%s\n", sc_print_hex(calc_buffer)));
1640 if ((buffer != NULL) && (buffer != calc_buffer)) {
1641 memcpy(buffer, calc_buffer, calc_buffer_size);
1645 void sc_mod(const void *value1, const void *value2, void *buffer) {
1646 /* temp buffer holding unused result of divmod */
1647 char *unused_res = alloca(calc_buffer_size);
1649 CLEAR_BUFFER(calc_buffer);
1652 DEBUGPRINTF_COMPUTATION(("%s %% ", sc_print_hex(value1)));
1653 DEBUGPRINTF_COMPUTATION(("%s -> ", sc_print_hex(value2)));
1655 do_divmod(value1, value2, unused_res, calc_buffer);
1657 DEBUGPRINTF_COMPUTATION(("%s\n", sc_print_hex(calc_buffer)));
1659 if ((buffer != NULL) && (buffer != calc_buffer)) {
1660 memcpy(buffer, calc_buffer, calc_buffer_size);
1664 void sc_divmod(const void *value1, const void *value2, void *div_buffer, void *mod_buffer) {
1665 CLEAR_BUFFER(calc_buffer);
1668 DEBUGPRINTF_COMPUTATION(("%s %% ", sc_print_hex(value1)));
1669 DEBUGPRINTF_COMPUTATION(("%s -> ", sc_print_hex(value2)));
1671 do_divmod(value1, value2, div_buffer, mod_buffer);
1673 DEBUGPRINTF_COMPUTATION(("%s:%s\n", sc_print_hex(div_buffer), sc_print_hex(mod_buffer)));
1677 void sc_shlI(const void *val1, long shift_cnt, int bitsize, int sign, void *buffer) {
1680 DEBUGPRINTF_COMPUTATION(("%s << %ld ", sc_print_hex(value1), shift_cnt));
1681 do_shl(val1, calc_buffer, shift_cnt, bitsize, sign);
1683 DEBUGPRINTF_COMPUTATION(("-> %s\n", sc_print_hex(calc_buffer)));
1685 if ((buffer != NULL) && (buffer != calc_buffer)) {
1686 memmove(buffer, calc_buffer, calc_buffer_size);
1690 void sc_shl(const void *val1, const void *val2, int bitsize, int sign, void *buffer) {
1691 long offset = sc_val_to_long(val2);
1693 sc_shlI(val1, offset, bitsize, sign, buffer);
1696 void sc_shrI(const void *val1, long shift_cnt, int bitsize, int sign, void *buffer) {
1699 DEBUGPRINTF_COMPUTATION(("%s >>u %ld ", sc_print_hex(value1), shift_cnt));
1700 do_shr(val1, calc_buffer, shift_cnt, bitsize, sign, 0);
1702 DEBUGPRINTF_COMPUTATION(("-> %s\n", sc_print_hex(calc_buffer)));
1704 if ((buffer != NULL) && (buffer != calc_buffer)) {
1705 memmove(buffer, calc_buffer, calc_buffer_size);
1709 void sc_shr(const void *val1, const void *val2, int bitsize, int sign, void *buffer) {
1710 long shift_cnt = sc_val_to_long(val2);
1712 sc_shrI(val1, shift_cnt, bitsize, sign, buffer);
1715 void sc_shrs(const void *val1, const void *val2, int bitsize, int sign, void *buffer) {
1716 long offset = sc_val_to_long(val2);
1720 DEBUGPRINTF_COMPUTATION(("%s >>s %ld ", sc_print_hex(value1), offset));
1721 do_shr(val1, calc_buffer, offset, bitsize, sign, 1);
1723 DEBUGPRINTF_COMPUTATION(("-> %s\n", sc_print_hex(calc_buffer)));
1725 if ((buffer != NULL) && (buffer != calc_buffer)) {
1726 memmove(buffer, calc_buffer, calc_buffer_size);
1730 void sc_rotl(const void *val1, const void *val2, int bitsize, int sign, void *buffer) {
1731 long offset = sc_val_to_long(val2);
1735 DEBUGPRINTF_COMPUTATION(("%s <<>> %ld ", sc_print_hex(value1), offset));
1736 do_rotl(val1, calc_buffer, offset, bitsize, sign);
1738 DEBUGPRINTF_COMPUTATION(("-> %s\n", sc_print_hex(calc_buffer)));
1740 if ((buffer != NULL) && (buffer != calc_buffer)) {
1741 memmove(buffer, calc_buffer, calc_buffer_size);
1745 void sc_zero(void *buffer) {
1747 buffer = calc_buffer;
1748 CLEAR_BUFFER(buffer);