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 shift_table[4] = { SC_1, SC_2, SC_4, SC_8 };
89 static const char and_table[16][16] = {
90 { SC_0, SC_0, SC_0, SC_0, SC_0, SC_0, SC_0, SC_0,
91 SC_0, SC_0, SC_0, SC_0, SC_0, SC_0, SC_0, SC_0 },
93 { SC_0, SC_1, SC_0, SC_1, SC_0, SC_1, SC_0, SC_1,
94 SC_0, SC_1, SC_0, SC_1, SC_0, SC_1, SC_0, SC_1 },
96 { SC_0, SC_0, SC_2, SC_2, SC_0, SC_0, SC_2, SC_2,
97 SC_0, SC_0, SC_2, SC_2, SC_0, SC_0, SC_2, SC_2 },
99 { SC_0, SC_1, SC_2, SC_3, SC_0, SC_1, SC_2, SC_3,
100 SC_0, SC_1, SC_2, SC_3, SC_0, SC_1, SC_2, SC_3 },
102 { SC_0, SC_0, SC_0, SC_0, SC_4, SC_4, SC_4, SC_4,
103 SC_0, SC_0, SC_0, SC_0, SC_4, SC_4, SC_4, SC_4 },
105 { SC_0, SC_1, SC_0, SC_1, SC_4, SC_5, SC_4, SC_5,
106 SC_0, SC_1, SC_0, SC_1, SC_4, SC_5, SC_4, SC_5 },
108 { SC_0, SC_0, SC_2, SC_2, SC_4, SC_4, SC_6, SC_6,
109 SC_0, SC_0, SC_2, SC_2, SC_4, SC_4, SC_6, SC_6 },
111 { SC_0, SC_1, SC_2, SC_3, SC_4, SC_5, SC_6, SC_7,
112 SC_0, SC_1, SC_2, SC_3, SC_4, SC_5, SC_6, SC_7 },
114 { SC_0, SC_0, SC_0, SC_0, SC_0, SC_0, SC_0, SC_0,
115 SC_8, SC_8, SC_8, SC_8, SC_8, SC_8, SC_8, SC_8 },
117 { SC_0, SC_1, SC_0, SC_1, SC_0, SC_1, SC_0, SC_1,
118 SC_8, SC_9, SC_8, SC_9, SC_8, SC_9, SC_8, SC_9 },
120 { SC_0, SC_0, SC_2, SC_2, SC_0, SC_0, SC_2, SC_2,
121 SC_8, SC_8, SC_A, SC_A, SC_8, SC_8, SC_A, SC_A },
123 { SC_0, SC_1, SC_2, SC_3, SC_0, SC_1, SC_2, SC_3,
124 SC_8, SC_9, SC_A, SC_B, SC_8, SC_9, SC_A, SC_B },
126 { SC_0, SC_0, SC_0, SC_0, SC_4, SC_4, SC_4, SC_4,
127 SC_8, SC_8, SC_8, SC_8, SC_C, SC_C, SC_C, SC_C },
129 { SC_0, SC_1, SC_0, SC_1, SC_4, SC_5, SC_4, SC_5,
130 SC_8, SC_9, SC_8, SC_9, SC_C, SC_D, SC_C, SC_D },
132 { SC_0, SC_0, SC_2, SC_2, SC_4, SC_4, SC_6, SC_6,
133 SC_8, SC_8, SC_A, SC_A, SC_C, SC_C, SC_E, SC_E },
135 { SC_0, SC_1, SC_2, SC_3, SC_4, SC_5, SC_6, SC_7,
136 SC_8, SC_9, SC_A, SC_B, SC_C, SC_D, SC_E, SC_F } };
138 static const char or_table[16][16] = {
139 { SC_0, SC_1, SC_2, SC_3, SC_4, SC_5, SC_6, SC_7,
140 SC_8, SC_9, SC_A, SC_B, SC_C, SC_D, SC_E, SC_F },
142 { SC_1, SC_1, SC_3, SC_3, SC_5, SC_5, SC_7, SC_7,
143 SC_9, SC_9, SC_B, SC_B, SC_D, SC_D, SC_F, SC_F },
145 { SC_2, SC_3, SC_2, SC_3, SC_6, SC_7, SC_6, SC_7,
146 SC_A, SC_B, SC_A, SC_B, SC_E, SC_F, SC_E, SC_F },
148 { SC_3, SC_3, SC_3, SC_3, SC_7, SC_7, SC_7, SC_7,
149 SC_B, SC_B, SC_B, SC_B, SC_F, SC_F, SC_F, SC_F },
151 { SC_4, SC_5, SC_6, SC_7, SC_4, SC_5, SC_6, SC_7,
152 SC_C, SC_D, SC_E, SC_F, SC_C, SC_D, SC_E, SC_F },
154 { SC_5, SC_5, SC_7, SC_7, SC_5, SC_5, SC_7, SC_7,
155 SC_D, SC_D, SC_F, SC_F, SC_D, SC_D, SC_F, SC_F },
157 { SC_6, SC_7, SC_6, SC_7, SC_6, SC_7, SC_6, SC_7,
158 SC_E, SC_F, SC_E, SC_F, SC_E, SC_F, SC_E, SC_F },
160 { SC_7, SC_7, SC_7, SC_7, SC_7, SC_7, SC_7, SC_7,
161 SC_F, SC_F, SC_F, SC_F, SC_F, SC_F, SC_F, SC_F },
163 { SC_8, SC_9, SC_A, SC_B, SC_C, SC_D, SC_E, SC_F,
164 SC_8, SC_9, SC_A, SC_B, SC_C, SC_D, SC_E, SC_F },
166 { SC_9, SC_9, SC_B, SC_B, SC_D, SC_D, SC_F, SC_F,
167 SC_9, SC_9, SC_B, SC_B, SC_D, SC_D, SC_F, SC_F },
169 { SC_A, SC_B, SC_A, SC_B, SC_E, SC_F, SC_E, SC_F,
170 SC_A, SC_B, SC_A, SC_B, SC_E, SC_F, SC_E, SC_F },
172 { SC_B, SC_B, SC_B, SC_B, SC_F, SC_F, SC_F, SC_F,
173 SC_B, SC_B, SC_B, SC_B, SC_F, SC_F, SC_F, SC_F },
175 { SC_C, SC_D, SC_E, SC_F, SC_C, SC_D, SC_E, SC_F,
176 SC_C, SC_D, SC_E, SC_F, SC_C, SC_D, SC_E, SC_F },
178 { SC_D, SC_D, SC_F, SC_F, SC_D, SC_D, SC_F, SC_F,
179 SC_D, SC_D, SC_F, SC_F, SC_D, SC_D, SC_F, SC_F },
181 { SC_E, SC_F, SC_E, SC_F, SC_E, SC_F, SC_E, SC_F,
182 SC_E, SC_F, SC_E, SC_F, SC_E, SC_F, SC_E, SC_F },
184 { SC_F, SC_F, SC_F, SC_F, SC_F, SC_F, SC_F, SC_F,
185 SC_F, SC_F, SC_F, SC_F, SC_F, SC_F, SC_F, SC_F } };
187 static char const add_table[16][16][2] = {
188 { {SC_0, SC_0}, {SC_1, SC_0}, {SC_2, SC_0}, {SC_3, SC_0},
189 {SC_4, SC_0}, {SC_5, SC_0}, {SC_6, SC_0}, {SC_7, SC_0},
190 {SC_8, SC_0}, {SC_9, SC_0}, {SC_A, SC_0}, {SC_B, SC_0},
191 {SC_C, SC_0}, {SC_D, SC_0}, {SC_E, SC_0}, {SC_F, SC_0} },
193 { {SC_1, SC_0}, {SC_2, SC_0}, {SC_3, SC_0}, {SC_4, SC_0},
194 {SC_5, SC_0}, {SC_6, SC_0}, {SC_7, SC_0}, {SC_8, SC_0},
195 {SC_9, SC_0}, {SC_A, SC_0}, {SC_B, SC_0}, {SC_C, SC_0},
196 {SC_D, SC_0}, {SC_E, SC_0}, {SC_F, SC_0}, {SC_0, SC_1} },
198 { {SC_2, SC_0}, {SC_3, SC_0}, {SC_4, SC_0}, {SC_5, SC_0},
199 {SC_6, SC_0}, {SC_7, SC_0}, {SC_8, SC_0}, {SC_9, SC_0},
200 {SC_A, SC_0}, {SC_B, SC_0}, {SC_C, SC_0}, {SC_D, SC_0},
201 {SC_E, SC_0}, {SC_F, SC_0}, {SC_0, SC_1}, {SC_1, SC_1} },
203 { {SC_3, SC_0}, {SC_4, SC_0}, {SC_5, SC_0}, {SC_6, SC_0},
204 {SC_7, SC_0}, {SC_8, SC_0}, {SC_9, SC_0}, {SC_A, SC_0},
205 {SC_B, SC_0}, {SC_C, SC_0}, {SC_D, SC_0}, {SC_E, SC_0},
206 {SC_F, SC_0}, {SC_0, SC_1}, {SC_1, SC_1}, {SC_2, SC_1} },
208 { {SC_4, SC_0}, {SC_5, SC_0}, {SC_6, SC_0}, {SC_7, SC_0},
209 {SC_8, SC_0}, {SC_9, SC_0}, {SC_A, SC_0}, {SC_B, SC_0},
210 {SC_C, SC_0}, {SC_D, SC_0}, {SC_E, SC_0}, {SC_F, SC_0},
211 {SC_0, SC_1}, {SC_1, SC_1}, {SC_2, SC_1}, {SC_3, SC_1} },
213 { {SC_5, SC_0}, {SC_6, SC_0}, {SC_7, SC_0}, {SC_8, SC_0},
214 {SC_9, SC_0}, {SC_A, SC_0}, {SC_B, SC_0}, {SC_C, SC_0},
215 {SC_D, SC_0}, {SC_E, SC_0}, {SC_F, SC_0}, {SC_0, SC_1},
216 {SC_1, SC_1}, {SC_2, SC_1}, {SC_3, SC_1}, {SC_4, SC_1} },
218 { {SC_6, SC_0}, {SC_7, SC_0}, {SC_8, SC_0}, {SC_9, SC_0},
219 {SC_A, SC_0}, {SC_B, SC_0}, {SC_C, SC_0}, {SC_D, SC_0},
220 {SC_E, SC_0}, {SC_F, SC_0}, {SC_0, SC_1}, {SC_1, SC_1},
221 {SC_2, SC_1}, {SC_3, SC_1}, {SC_4, SC_1}, {SC_5, SC_1} },
223 { {SC_7, SC_0}, {SC_8, SC_0}, {SC_9, SC_0}, {SC_A, SC_0},
224 {SC_B, SC_0}, {SC_C, SC_0}, {SC_D, SC_0}, {SC_E, SC_0},
225 {SC_F, SC_0}, {SC_0, SC_1}, {SC_1, SC_1}, {SC_2, SC_1},
226 {SC_3, SC_1}, {SC_4, SC_1}, {SC_5, SC_1}, {SC_6, SC_1} },
228 { {SC_8, SC_0}, {SC_9, SC_0}, {SC_A, SC_0}, {SC_B, SC_0},
229 {SC_C, SC_0}, {SC_D, SC_0}, {SC_E, SC_0}, {SC_F, SC_0},
230 {SC_0, SC_1}, {SC_1, SC_1}, {SC_2, SC_1}, {SC_3, SC_1},
231 {SC_4, SC_1}, {SC_5, SC_1}, {SC_6, SC_1}, {SC_7, SC_1} },
233 { {SC_9, SC_0}, {SC_A, SC_0}, {SC_B, SC_0}, {SC_C, SC_0},
234 {SC_D, SC_0}, {SC_E, SC_0}, {SC_F, SC_0}, {SC_0, SC_1},
235 {SC_1, SC_1}, {SC_2, SC_1}, {SC_3, SC_1}, {SC_4, SC_1},
236 {SC_5, SC_1}, {SC_6, SC_1}, {SC_7, SC_1}, {SC_8, SC_1} },
238 { {SC_A, SC_0}, {SC_B, SC_0}, {SC_C, SC_0}, {SC_D, SC_0},
239 {SC_E, SC_0}, {SC_F, SC_0}, {SC_0, SC_1}, {SC_1, SC_1},
240 {SC_2, SC_1}, {SC_3, SC_1}, {SC_4, SC_1}, {SC_5, SC_1},
241 {SC_6, SC_1}, {SC_7, SC_1}, {SC_8, SC_1}, {SC_9, SC_1} },
243 { {SC_B, SC_0}, {SC_C, SC_0}, {SC_D, SC_0}, {SC_E, SC_0},
244 {SC_F, SC_0}, {SC_0, SC_1}, {SC_1, SC_1}, {SC_2, SC_1},
245 {SC_3, SC_1}, {SC_4, SC_1}, {SC_5, SC_1}, {SC_6, SC_1},
246 {SC_7, SC_1}, {SC_8, SC_1}, {SC_9, SC_1}, {SC_A, SC_1} },
248 { {SC_C, SC_0}, {SC_D, SC_0}, {SC_E, SC_0}, {SC_F, SC_0},
249 {SC_0, SC_1}, {SC_1, SC_1}, {SC_2, SC_1}, {SC_3, SC_1},
250 {SC_4, SC_1}, {SC_5, SC_1}, {SC_6, SC_1}, {SC_7, SC_1},
251 {SC_8, SC_1}, {SC_9, SC_1}, {SC_A, SC_1}, {SC_B, SC_1} },
253 { {SC_D, SC_0}, {SC_E, SC_0}, {SC_F, SC_0}, {SC_0, SC_1},
254 {SC_1, SC_1}, {SC_2, SC_1}, {SC_3, SC_1}, {SC_4, SC_1},
255 {SC_5, SC_1}, {SC_6, SC_1}, {SC_7, SC_1}, {SC_8, SC_1},
256 {SC_9, SC_1}, {SC_A, SC_1}, {SC_B, SC_1}, {SC_C, SC_1} },
258 { {SC_E, SC_0}, {SC_F, SC_0}, {SC_0, SC_1}, {SC_1, SC_1},
259 {SC_2, SC_1}, {SC_3, SC_1}, {SC_4, SC_1}, {SC_5, SC_1},
260 {SC_6, SC_1}, {SC_7, SC_1}, {SC_8, SC_1}, {SC_9, SC_1},
261 {SC_A, SC_1}, {SC_B, SC_1}, {SC_C, SC_1}, {SC_D, SC_1} },
263 { {SC_F, SC_0}, {SC_0, SC_1}, {SC_1, SC_1}, {SC_2, SC_1},
264 {SC_3, SC_1}, {SC_4, SC_1}, {SC_5, SC_1}, {SC_6, SC_1},
265 {SC_7, SC_1}, {SC_8, SC_1}, {SC_9, SC_1}, {SC_A, SC_1},
266 {SC_B, SC_1}, {SC_C, SC_1}, {SC_D, SC_1}, {SC_E, SC_1} }
269 static char const mul_table[16][16][2] = {
270 { {SC_0, SC_0}, {SC_0, SC_0}, {SC_0, SC_0}, {SC_0, SC_0},
271 {SC_0, SC_0}, {SC_0, SC_0}, {SC_0, SC_0}, {SC_0, SC_0},
272 {SC_0, SC_0}, {SC_0, SC_0}, {SC_0, SC_0}, {SC_0, SC_0},
273 {SC_0, SC_0}, {SC_0, SC_0}, {SC_0, SC_0}, {SC_0, SC_0} },
275 { {SC_0, SC_0}, {SC_1, SC_0}, {SC_2, SC_0}, {SC_3, SC_0},
276 {SC_4, SC_0}, {SC_5, SC_0}, {SC_6, SC_0}, {SC_7, SC_0},
277 {SC_8, SC_0}, {SC_9, SC_0}, {SC_A, SC_0}, {SC_B, SC_0},
278 {SC_C, SC_0}, {SC_D, SC_0}, {SC_E, SC_0}, {SC_F, SC_0} },
280 { {SC_0, SC_0}, {SC_2, SC_0}, {SC_4, SC_0}, {SC_6, SC_0},
281 {SC_8, SC_0}, {SC_A, SC_0}, {SC_C, SC_0}, {SC_E, SC_0},
282 {SC_0, SC_1}, {SC_2, SC_1}, {SC_4, SC_1}, {SC_6, SC_1},
283 {SC_8, SC_1}, {SC_A, SC_1}, {SC_C, SC_1}, {SC_E, SC_1} },
285 { {SC_0, SC_0}, {SC_3, SC_0}, {SC_6, SC_0}, {SC_9, SC_0},
286 {SC_C, SC_0}, {SC_F, SC_0}, {SC_2, SC_1}, {SC_5, SC_1},
287 {SC_8, SC_1}, {SC_B, SC_1}, {SC_E, SC_1}, {SC_1, SC_2},
288 {SC_4, SC_2}, {SC_7, SC_2}, {SC_A, SC_2}, {SC_D, SC_2} },
290 { {SC_0, SC_0}, {SC_4, SC_0}, {SC_8, SC_0}, {SC_C, SC_0},
291 {SC_0, SC_1}, {SC_4, SC_1}, {SC_8, SC_1}, {SC_C, SC_1},
292 {SC_0, SC_2}, {SC_4, SC_2}, {SC_8, SC_2}, {SC_C, SC_2},
293 {SC_0, SC_3}, {SC_4, SC_3}, {SC_8, SC_3}, {SC_C, SC_3} },
295 { {SC_0, SC_0}, {SC_5, SC_0}, {SC_A, SC_0}, {SC_F, SC_0},
296 {SC_4, SC_1}, {SC_9, SC_1}, {SC_E, SC_1}, {SC_3, SC_2},
297 {SC_8, SC_2}, {SC_D, SC_2}, {SC_2, SC_3}, {SC_7, SC_3},
298 {SC_C, SC_3}, {SC_1, SC_4}, {SC_6, SC_4}, {SC_B, SC_4} },
300 { {SC_0, SC_0}, {SC_6, SC_0}, {SC_C, SC_0}, {SC_2, SC_1},
301 {SC_8, SC_1}, {SC_E, SC_1}, {SC_4, SC_2}, {SC_A, SC_2},
302 {SC_0, SC_3}, {SC_6, SC_3}, {SC_C, SC_3}, {SC_2, SC_4},
303 {SC_8, SC_4}, {SC_E, SC_4}, {SC_4, SC_5}, {SC_A, SC_5} },
305 { {SC_0, SC_0}, {SC_7, SC_0}, {SC_E, SC_0}, {SC_5, SC_1},
306 {SC_C, SC_1}, {SC_3, SC_2}, {SC_A, SC_2}, {SC_1, SC_3},
307 {SC_8, SC_3}, {SC_F, SC_3}, {SC_6, SC_4}, {SC_D, SC_4},
308 {SC_4, SC_5}, {SC_B, SC_5}, {SC_2, SC_6}, {SC_9, SC_6} },
310 { {SC_0, SC_0}, {SC_8, SC_0}, {SC_0, SC_1}, {SC_8, SC_1},
311 {SC_0, SC_2}, {SC_8, SC_2}, {SC_0, SC_3}, {SC_8, SC_3},
312 {SC_0, SC_4}, {SC_8, SC_4}, {SC_0, SC_5}, {SC_8, SC_5},
313 {SC_0, SC_6}, {SC_8, SC_6}, {SC_0, SC_7}, {SC_8, SC_7} },
315 { {SC_0, SC_0}, {SC_9, SC_0}, {SC_2, SC_1}, {SC_B, SC_1},
316 {SC_4, SC_2}, {SC_D, SC_2}, {SC_6, SC_3}, {SC_F, SC_3},
317 {SC_8, SC_4}, {SC_1, SC_5}, {SC_A, SC_5}, {SC_3, SC_6},
318 {SC_C, SC_6}, {SC_5, SC_7}, {SC_E, SC_7}, {SC_7, SC_8} },
320 { {SC_0, SC_0}, {SC_A, SC_0}, {SC_4, SC_1}, {SC_E, SC_1},
321 {SC_8, SC_2}, {SC_2, SC_3}, {SC_C, SC_3}, {SC_6, SC_4},
322 {SC_0, SC_5}, {SC_A, SC_5}, {SC_4, SC_6}, {SC_E, SC_6},
323 {SC_8, SC_7}, {SC_2, SC_8}, {SC_C, SC_8}, {SC_6, SC_9} },
325 { {SC_0, SC_0}, {SC_B, SC_0}, {SC_6, SC_1}, {SC_1, SC_2},
326 {SC_C, SC_2}, {SC_7, SC_3}, {SC_2, SC_4}, {SC_D, SC_4},
327 {SC_8, SC_5}, {SC_3, SC_6}, {SC_E, SC_6}, {SC_9, SC_7},
328 {SC_4, SC_8}, {SC_F, SC_8}, {SC_A, SC_9}, {SC_5, SC_A} },
330 { {SC_0, SC_0}, {SC_C, SC_0}, {SC_8, SC_1}, {SC_4, SC_2},
331 {SC_0, SC_3}, {SC_C, SC_3}, {SC_8, SC_4}, {SC_4, SC_5},
332 {SC_0, SC_6}, {SC_C, SC_6}, {SC_8, SC_7}, {SC_4, SC_8},
333 {SC_0, SC_9}, {SC_C, SC_9}, {SC_8, SC_A}, {SC_4, SC_B} },
335 { {SC_0, SC_0}, {SC_D, SC_0}, {SC_A, SC_1}, {SC_7, SC_2},
336 {SC_4, SC_3}, {SC_1, SC_4}, {SC_E, SC_4}, {SC_B, SC_5},
337 {SC_8, SC_6}, {SC_5, SC_7}, {SC_2, SC_8}, {SC_F, SC_8},
338 {SC_C, SC_9}, {SC_9, SC_A}, {SC_6, SC_B}, {SC_3, SC_C} },
340 { {SC_0, SC_0}, {SC_E, SC_0}, {SC_C, SC_1}, {SC_A, SC_2},
341 {SC_8, SC_3}, {SC_6, SC_4}, {SC_4, SC_5}, {SC_2, SC_6},
342 {SC_0, SC_7}, {SC_E, SC_7}, {SC_C, SC_8}, {SC_A, SC_9},
343 {SC_8, SC_A}, {SC_6, SC_B}, {SC_4, SC_C}, {SC_2, SC_D} },
345 { {SC_0, SC_0}, {SC_F, SC_0}, {SC_E, SC_1}, {SC_D, SC_2},
346 {SC_C, SC_3}, {SC_B, SC_4}, {SC_A, SC_5}, {SC_9, SC_6},
347 {SC_8, SC_7}, {SC_7, SC_8}, {SC_6, SC_9}, {SC_5, SC_A},
348 {SC_4, SC_B}, {SC_3, SC_C}, {SC_2, SC_D}, {SC_1, SC_E} }
351 static char const shrs_table[16][4][2] = {
352 { {SC_0, SC_0}, {SC_0, SC_0}, {SC_0, SC_0}, {SC_0, SC_0} },
353 { {SC_1, SC_0}, {SC_0, SC_8}, {SC_0, SC_4}, {SC_0, SC_2} },
354 { {SC_2, SC_0}, {SC_1, SC_0}, {SC_0, SC_8}, {SC_0, SC_4} },
355 { {SC_3, SC_0}, {SC_1, SC_8}, {SC_0, SC_C}, {SC_0, SC_6} },
356 { {SC_4, SC_0}, {SC_2, SC_0}, {SC_1, SC_0}, {SC_0, SC_8} },
357 { {SC_5, SC_0}, {SC_2, SC_8}, {SC_1, SC_4}, {SC_0, SC_A} },
358 { {SC_6, SC_0}, {SC_3, SC_0}, {SC_1, SC_8}, {SC_0, SC_C} },
359 { {SC_7, SC_0}, {SC_3, SC_8}, {SC_1, SC_C}, {SC_0, SC_E} },
360 { {SC_8, SC_0}, {SC_4, SC_0}, {SC_2, SC_0}, {SC_1, SC_0} },
361 { {SC_9, SC_0}, {SC_4, SC_8}, {SC_2, SC_4}, {SC_1, SC_2} },
362 { {SC_A, SC_0}, {SC_5, SC_0}, {SC_2, SC_8}, {SC_1, SC_4} },
363 { {SC_B, SC_0}, {SC_5, SC_8}, {SC_2, SC_C}, {SC_1, SC_6} },
364 { {SC_C, SC_0}, {SC_6, SC_0}, {SC_3, SC_0}, {SC_1, SC_8} },
365 { {SC_D, SC_0}, {SC_6, SC_8}, {SC_3, SC_4}, {SC_1, SC_A} },
366 { {SC_E, SC_0}, {SC_7, SC_0}, {SC_3, SC_8}, {SC_1, SC_C} },
367 { {SC_F, SC_0}, {SC_7, SC_8}, {SC_3, SC_C}, {SC_1, SC_E} }
370 /** converting a digit to a binary string */
371 static const char *binary_table[16] = {
372 "0000", "0001", "0010", "0011", "0100", "0101", "0110", "0111",
373 "1000", "1001", "1010", "1011", "1100", "1101", "1110", "1111"
376 /*****************************************************************************
378 *****************************************************************************/
379 static void _fail_char(const char *str, size_t len, const char fchar, int pos,
380 const char *file, int line) {
382 printf("Unexpected character '%c' in %s:%d\n", fchar, file, line);
383 while (len-- && *str) printf("%c", *str++); printf("\n");
384 while (--pos) printf(" "); printf("^\n");
389 * implements the bitwise NOT operation
391 static void do_bitnot(const char *val, char *buffer) {
394 for (counter = 0; counter<calc_buffer_size; counter++)
395 buffer[counter] = val[counter] ^ SC_F;
399 * implements the bitwise OR operation
401 static void do_bitor(const char *val1, const char *val2, char *buffer) {
404 for (counter = 0; counter<calc_buffer_size; counter++)
405 buffer[counter] = or_table[_val(val1[counter])][_val(val2[counter])];
409 * implements the bitwise eXclusive OR operation
411 static void do_bitxor(const char *val1, const char *val2, char *buffer) {
414 for (counter = 0; counter<calc_buffer_size; counter++)
415 buffer[counter] = val1[counter] ^ val2[counter];
419 * implements the bitwise AND operation
421 static void do_bitand(const char *val1, const char *val2, char *buffer) {
424 for (counter = 0; counter<calc_buffer_size; counter++)
425 buffer[counter] = and_table[_val(val1[counter])][_val(val2[counter])];
429 * returns the sign bit.
431 * @todo This implementation is wrong, as it returns the highest bit of the buffer
432 * NOT the highest bit depending on the real mode
434 static int do_sign(const char *val) {
435 return (val[calc_buffer_size-1] <= SC_7) ? (1) : (-1);
439 * returns non-zero if bit at position pos is set
441 static int do_bit(const char *val, int pos) {
443 int nibble = pos >> 2;
445 return _bitisset(val[nibble], bit);
449 * Implements a fast ADD + 1
451 static void do_inc(const char *val, char *buffer) {
454 while (counter++ < calc_buffer_size) {
459 /* No carry here, *val != SC_F */
460 *buffer = add_table[_val(*val)][SC_1][0];
464 /* here a carry could be lost, this is intended because this should
465 * happen only when a value changes sign. */
469 * Implements a unary MINUS
471 static void do_negate(const char *val, char *buffer) {
472 do_bitnot(val, buffer);
473 do_inc(buffer, buffer);
477 * Implements a binary ADD
479 * @todo The implementation of carry is wrong, as it is the
480 * calc_buffer_size carry, not the mode depending
482 static void do_add(const char *val1, const char *val2, char *buffer) {
484 const char *add1, *add2;
487 for (counter = 0; counter < calc_buffer_size; counter++) {
488 add1 = add_table[_val(val1[counter])][_val(val2[counter])];
489 add2 = add_table[_val(add1[0])][_val(carry)];
490 /* carry might be zero */
491 buffer[counter] = add2[0];
492 carry = add_table[_val(add1[1])][_val(add2[1])][0];
494 carry_flag = carry != SC_0;
498 * Implements a binary SUB
500 static void do_sub(const char *val1, const char *val2, char *buffer) {
501 char *temp_buffer = alloca(calc_buffer_size); /* intermediate buffer to hold -val2 */
503 do_negate(val2, temp_buffer);
504 do_add(val1, temp_buffer, buffer);
508 * Implements a binary MUL
510 static void do_mul(const char *val1, const char *val2, char *buffer) {
511 char *temp_buffer; /* result buffer */
512 char *neg_val1; /* abs of val1 */
513 char *neg_val2; /* abs of val2 */
515 const char *mul, *add1, *add2; /* intermediate result containers */
516 char carry = SC_0; /* container for carries */
517 char sign = 0; /* marks result sign */
518 int c_inner, c_outer; /* loop counters */
520 temp_buffer = alloca(calc_buffer_size);
521 neg_val1 = alloca(calc_buffer_size);
522 neg_val2 = alloca(calc_buffer_size);
524 /* init result buffer to zeros */
525 memset(temp_buffer, SC_0, calc_buffer_size);
527 /* the multiplication works only for positive values, for negative values *
528 * it is necessary to negate them and adjust the result accordingly */
529 if (do_sign(val1) == -1) {
530 do_negate(val1, neg_val1);
534 if (do_sign(val2) == -1) {
535 do_negate(val2, neg_val2);
540 for (c_outer = 0; c_outer < max_value_size; c_outer++) {
541 if (val2[c_outer] != SC_0) {
542 for (c_inner = 0; c_inner < max_value_size; c_inner++) {
543 /* do the following calculation: *
544 * Add the current carry, the value at position c_outer+c_inner *
545 * and the result of the multiplication of val1[c_inner] and *
546 * val2[c_outer]. This is the usual pen-and-paper multiplication. */
548 /* multiplicate the two digits */
549 mul = mul_table[_val(val1[c_inner])][_val(val2[c_outer])];
550 /* add old value to result of multiplication */
551 add1 = add_table[_val(temp_buffer[c_inner + c_outer])][_val(mul[0])];
552 /* add carry to the sum */
553 add2 = add_table[_val(add1[0])][_val(carry)];
555 /* all carries together result in new carry. This is always smaller *
557 * Both multiplicands, the carry and the value already in the temp *
558 * buffer are single digits and their value is therefore at most *
561 * (b-1)(b-1)+(b-1)+(b-1) = b*b-1 *
562 * The tables list all operations rem b, so the carry is at most *
563 * (b*b-1)rem b = -1rem b = b-1 */
564 carry = add_table[_val(mul[1])][_val(add1[1])][0];
565 carry = add_table[_val(carry)][_val(add2[1])][0];
567 temp_buffer[c_inner + c_outer] = add2[0];
570 /* A carry may hang over */
571 /* c_outer is always smaller than max_value_size! */
572 temp_buffer[max_value_size + c_outer] = carry;
578 do_negate(temp_buffer, buffer);
580 memcpy(buffer, temp_buffer, calc_buffer_size);
584 * Shift the buffer to left and add a 4 bit digit
586 static void do_push(const char digit, char *buffer) {
589 for (counter = calc_buffer_size - 2; counter >= 0; counter--) {
590 buffer[counter+1] = buffer[counter];
596 * Implements truncating integer division and remainder.
598 * Note: This is MOST slow
600 static void do_divmod(const char *rDividend, const char *divisor, char *quot, char *rem) {
601 const char *dividend = rDividend;
602 const char *minus_divisor;
606 char div_sign = 0; /* remember division result sign */
607 char rem_sign = 0; /* remember remainder result sign */
609 int c_dividend; /* loop counters */
611 neg_val1 = alloca(calc_buffer_size);
612 neg_val2 = alloca(calc_buffer_size);
614 /* clear result buffer */
615 memset(quot, SC_0, calc_buffer_size);
616 memset(rem, SC_0, calc_buffer_size);
618 /* if the divisor is zero this won't work (quot is zero) */
619 if (sc_comp(divisor, quot) == 0) assert(0 && "division by zero!");
621 /* if the dividend is zero result is zero (quot is zero) */
622 if (sc_comp(dividend, quot) == 0)
625 if (do_sign(dividend) == -1) {
626 do_negate(dividend, neg_val1);
632 do_negate(divisor, neg_val2);
633 if (do_sign(divisor) == -1) {
635 minus_divisor = divisor;
638 minus_divisor = neg_val2;
640 /* if divisor >= dividend division is easy
641 * (remember these are absolute values) */
642 switch (sc_comp(dividend, divisor)) {
643 case 0: /* dividend == divisor */
647 case -1: /* dividend < divisor */
648 memcpy(rem, dividend, calc_buffer_size);
651 default: /* unluckily division is necessary :( */
655 for (c_dividend = calc_buffer_size - 1; c_dividend >= 0; c_dividend--) {
656 do_push(dividend[c_dividend], rem);
659 if (sc_comp(rem, divisor) != -1) { /* remainder >= divisor */
660 /* subtract until the remainder becomes negative, this should
661 * be faster than comparing remainder with divisor */
662 do_add(rem, minus_divisor, rem);
664 while (do_sign(rem) == 1) {
665 quot[0] = add_table[_val(quot[0])][SC_1][0];
666 do_add(rem, minus_divisor, rem);
669 /* subtracted one too much */
670 do_add(rem, divisor, rem);
674 /* sets carry if remainder is non-zero ??? */
675 carry_flag = !sc_is_zero(rem);
678 do_negate(quot, quot);
685 * Implements a Shift Left, which can either preserve the sign bit
688 * @todo Assertions seems to be wrong
690 static void do_shl(const char *val1, char *buffer, long shift_cnt, int bitsize, unsigned is_signed) {
698 assert((shift_cnt >= 0) || (0 && "negative leftshift"));
699 assert(((do_sign(val1) != -1) || is_signed) || (0 && "unsigned mode and negative value"));
700 assert(((!_bitisset(val1[(bitsize-1)/4], (bitsize-1)%4)) || !is_signed || (do_sign(val1) == -1)) || (0 && "value is positive, should be negative"));
701 assert(((_bitisset(val1[(bitsize-1)/4], (bitsize-1)%4)) || !is_signed || (do_sign(val1) == 1)) || (0 && "value is negative, should be positive"));
703 /* if shifting far enough the result is zero */
704 if (shift_cnt >= bitsize) {
705 memset(buffer, SC_0, calc_buffer_size);
709 shift = shift_table[_val(shift_cnt%4)]; /* this is 2 ** (offset % 4) */
710 shift_cnt = shift_cnt / 4;
712 /* shift the single digits some bytes (offset) and some bits (table)
714 for (counter = 0; counter < bitsize/4 - shift_cnt; counter++) {
715 shl = mul_table[_val(val1[counter])][_val(shift)];
716 buffer[counter + shift_cnt] = or_table[_val(shl[0])][_val(carry)];
720 shl = mul_table[_val(val1[counter])][_val(shift)];
721 buffer[counter + shift_cnt] = or_table[_val(shl[0])][_val(carry)];
724 bitoffset = counter - 1;
727 /* fill with zeroes */
728 for (counter = 0; counter < shift_cnt; counter++)
729 buffer[counter] = SC_0;
731 /* if the mode was signed, change sign when the mode's msb is now 1 */
732 shift_cnt = bitoffset + shift_cnt;
733 bitoffset = (bitsize-1) % 4;
734 if (is_signed && _bitisset(buffer[shift_cnt], bitoffset)) {
735 /* this sets the upper bits of the leftmost digit */
736 buffer[shift_cnt] = or_table[_val(buffer[shift_cnt])][_val(min_digit[bitoffset])];
737 for (counter = shift_cnt+1; counter < calc_buffer_size; counter++) {
738 buffer[counter] = SC_F;
740 } else if (is_signed && !_bitisset(buffer[shift_cnt], bitoffset)) {
741 /* this clears the upper bits of the leftmost digit */
742 buffer[shift_cnt] = and_table[_val(buffer[shift_cnt])][_val(max_digit[bitoffset])];
743 for (counter = shift_cnt+1; counter < calc_buffer_size; counter++) {
744 buffer[counter] = SC_0;
750 * Implements a Shift Right, which can either preserve the sign bit
753 * @param bitsize bitsize of the value to be shifted
755 * @todo Assertions seems to be wrong
757 static void do_shr(const char *val1, char *buffer, long shift_cnt, int bitsize, unsigned is_signed, int signed_shift) {
762 int shift_mod, shift_nib;
767 assert((shift_cnt >= 0) || (0 && "negative rightshift"));
768 assert(((!_bitisset(val1[(bitsize-1)/4], (bitsize-1)%4)) || !is_signed || (do_sign(val1) == -1)) || (0 && "value is positive, should be negative"));
769 assert(((_bitisset(val1[(bitsize-1)/4], (bitsize-1)%4)) || !is_signed || (do_sign(val1) == 1)) || (0 && "value is negative, should be positive"));
771 sign = signed_shift && do_bit(val1, bitsize - 1) ? SC_F : SC_0;
773 /* if shifting far enough the result is either 0 or -1 */
774 if (shift_cnt >= bitsize) {
775 if (!sc_is_zero(val1)) {
778 memset(buffer, sign, calc_buffer_size);
782 shift_mod = shift_cnt & 3;
783 shift_nib = shift_cnt >> 2;
785 /* check if any bits are lost, and set carry_flag if so */
786 for (counter = 0; counter < shift_nib; ++counter) {
787 if (val1[counter] != 0) {
792 if ((_val(val1[counter]) & ((1<<shift_mod)-1)) != 0)
795 /* shift digits to the right with offset, carry and all */
796 buffer[0] = shrs_table[_val(val1[shift_nib])][shift_mod][0];
797 for (counter = 1; counter < ((bitsize + 3) >> 2) - shift_nib; counter++) {
798 shrs = shrs_table[_val(val1[counter + shift_nib])][shift_mod];
799 buffer[counter] = shrs[0];
800 buffer[counter - 1] = or_table[_val(buffer[counter-1])][_val(shrs[1])];
803 /* the last digit is special in regard of signed/unsigned shift */
804 bitoffset = bitsize & 3;
805 msd = sign; /* most significant digit */
807 /* remove sign bits if mode was signed and this is an unsigned shift */
808 if (!signed_shift && is_signed) {
809 msd = and_table[_val(msd)][_val(max_digit[bitoffset])];
812 shrs = shrs_table[_val(msd)][shift_mod];
814 /* signed shift and signed mode and negative value means all bits to the left are set */
815 if (signed_shift && sign == SC_F) {
816 buffer[counter] = or_table[_val(shrs[0])][_val(min_digit[bitoffset])];
818 buffer[counter] = shrs[0];
822 buffer[counter - 1] = or_table[_val(buffer[counter-1])][_val(shrs[1])];
824 /* fill with SC_F or SC_0 depending on sign */
825 for (counter++; counter < calc_buffer_size; counter++) {
826 buffer[counter] = sign;
831 * Implements a Rotate Left.
832 * positive: low-order -> high order, negative other direction
834 static void do_rotl(const char *val1, char *buffer, long offset, int radius, unsigned is_signed) {
836 temp1 = alloca(calc_buffer_size);
837 temp2 = alloca(calc_buffer_size);
839 offset = offset % radius;
841 /* rotation by multiples of the type length is identity */
843 memmove(buffer, val1, calc_buffer_size);
847 do_shl(val1, temp1, offset, radius, is_signed);
848 do_shr(val1, temp2, radius - offset, radius, is_signed, 0);
849 do_bitor(temp1, temp2, buffer);
850 carry_flag = 0; /* set by shr, but due to rot this is false */
853 /*****************************************************************************
854 * public functions, declared in strcalc.h
855 *****************************************************************************/
856 const void *sc_get_buffer(void) {
857 return (void*)calc_buffer;
860 int sc_get_buffer_length(void) {
861 return calc_buffer_size;
865 * Do sign extension if the mode is signed, otherwise to zero extension.
867 void sign_extend(void *buffer, ir_mode *mode) {
868 char *calc_buffer = buffer;
869 int bits = get_mode_size_bits(mode) - 1;
870 int nibble = bits >> 2;
871 int max = max_digit[bits & 3];
874 if (mode_is_signed(mode)) {
875 if (calc_buffer[nibble] > max) {
876 /* sign bit is set, we need sign expansion */
878 for (i = nibble + 1; i < calc_buffer_size; ++i)
879 calc_buffer[i] = SC_F;
880 calc_buffer[nibble] = or_table[(int)calc_buffer[nibble]][(int)sex_digit[bits & 3]];
882 /* set all bits to zero */
883 for (i = nibble + 1; i < calc_buffer_size; ++i)
884 calc_buffer[i] = SC_0;
885 calc_buffer[nibble] = and_table[(int)calc_buffer[nibble]][(int)zex_digit[bits & 3]];
888 /* do zero extension */
889 for (i = nibble + 1; i < calc_buffer_size; ++i)
890 calc_buffer[i] = SC_0;
891 calc_buffer[nibble] = and_table[(int)calc_buffer[nibble]][(int)zex_digit[bits & 3]];
895 /* FIXME doesn't check for overflows */
896 void sc_val_from_str(const char *str, unsigned int len, void *buffer, ir_mode *mode) {
897 const char *orig_str = str;
898 unsigned int orig_len = len;
903 base = alloca(calc_buffer_size);
904 val = alloca(calc_buffer_size);
906 /* verify valid pointers (not null) */
908 /* a string no characters long is an error */
911 if (buffer == NULL) buffer = calc_buffer;
913 CLEAR_BUFFER(buffer);
917 /* strip leading spaces */
918 while ((len > 0) && (*str == ' ')) { len--; str++; }
920 /* if the first two characters are 0x or 0X -> hex
921 * if the first is a 0 -> oct
922 * else dec, strip leading -/+ and remember sign
924 * only a + or - sign is no number resulting in an error */
928 if (str[1] == 'x' || str[1] == 'X') { /* hex */
931 base[1] = SC_1; base[0] = SC_0;
935 base[1] = SC_0; base[0] = SC_8;
942 base[1] = SC_0; base[0] = SC_A;
949 base[1] = SC_0; base[0] = SC_A;
952 default: /* dec, else would have begun with 0x or 0 */
953 base[1] = SC_0; base[0] = SC_A;
955 } else { /* dec, else would have begun with 0x or 0 */
956 base[1] = SC_0; base[0] = SC_A;
959 /* BEGIN string evaluation, from left to right */
968 if (base[0] > SC_A || base[1] > SC_0) { /* (base > 10) */
969 val[0] = _digit((*str)-'a'+10);
972 fail_char(orig_str, orig_len, *str, str-orig_str+1);
981 if (base[0] > SC_A || base[1] > SC_0) { /* (base > 10) */
982 val[0] = _digit((*str)-'A'+10);
985 fail_char(orig_str, orig_len, *str, str-orig_str+1);
990 if (base[0] > SC_8 || base[1] > SC_0) { /* (base > 8) */
991 val[0] = _digit((*str)-'0');
994 fail_char(orig_str, orig_len, *str, str-orig_str+1);
1005 val[0] = _digit((*str)-'0');
1009 fail_char(orig_str, orig_len, *str, str-orig_str+1);
1010 } /* switch(*str) */
1012 /* Radix conversion from base b to base B:
1013 * (UnUn-1...U1U0)b == ((((Un*b + Un-1)*b + ...)*b + U1)*b + U0)B */
1014 do_mul(base, calc_buffer, calc_buffer); /* multiply current value with base */
1015 do_add(val, calc_buffer, calc_buffer); /* add next digit to current value */
1017 /* get ready for the next letter */
1020 } /* while (len > 0 ) */
1023 do_negate(calc_buffer, calc_buffer);
1025 /* beware: even if hex numbers have no sign, we need sign extension here */
1026 sign_extend(calc_buffer, mode);
1029 void sc_val_from_long(long value, void *buffer) {
1031 char sign, is_minlong;
1033 if (buffer == NULL) buffer = calc_buffer;
1037 is_minlong = value == LONG_MIN;
1039 /* use absolute value, special treatment of MIN_LONG to avoid overflow */
1047 CLEAR_BUFFER(buffer);
1049 while ((value != 0) && (pos < (char*)buffer + calc_buffer_size)) {
1050 *pos++ = _digit(value & 0xf);
1056 do_inc(buffer, buffer);
1058 do_negate(buffer, buffer);
1062 void sc_val_from_ulong(unsigned long value, void *buffer) {
1065 if (buffer == NULL) buffer = calc_buffer;
1068 while (pos < (unsigned char *)buffer + calc_buffer_size) {
1069 *pos++ = (unsigned char)_digit(value & 0xf);
1074 long sc_val_to_long(const void *val) {
1078 for (i = calc_buffer_size - 1; i >= 0; i--) {
1079 l = (l << 4) + _val(((char *)val)[i]);
1084 void sc_min_from_bits(unsigned int num_bits, unsigned int sign, void *buffer) {
1088 if (buffer == NULL) buffer = calc_buffer;
1089 CLEAR_BUFFER(buffer);
1091 if (!sign) return; /* unsigned means minimum is 0(zero) */
1095 bits = num_bits - 1;
1096 for (i = 0; i < bits/4; i++)
1099 *pos++ = min_digit[bits%4];
1101 for (i++; i <= calc_buffer_size - 1; i++)
1105 void sc_max_from_bits(unsigned int num_bits, unsigned int sign, void *buffer) {
1109 if (buffer == NULL) buffer = calc_buffer;
1110 CLEAR_BUFFER(buffer);
1113 bits = num_bits - sign;
1114 for (i = 0; i < bits/4; i++)
1117 *pos++ = max_digit[bits%4];
1119 for (i++; i <= calc_buffer_size - 1; i++)
1123 void sc_truncate(unsigned int num_bits, void *buffer) {
1124 char *cbuffer = buffer;
1125 char *pos = cbuffer + (num_bits / 4);
1126 char *end = cbuffer + calc_buffer_size;
1130 switch(num_bits % 4) {
1131 case 0: /* nothing to do */ break;
1132 case 1: *pos = and_table[_val(*pos)][SC_1]; pos++; break;
1133 case 2: *pos = and_table[_val(*pos)][SC_3]; pos++; break;
1134 case 3: *pos = and_table[_val(*pos)][SC_7]; pos++; break;
1137 for( ; pos < end; ++pos)
1141 int sc_comp(const void* value1, const void* value2) {
1142 int counter = calc_buffer_size - 1;
1143 const char *val1 = (const char *)value1;
1144 const char *val2 = (const char *)value2;
1146 /* compare signs first:
1147 * the loop below can only compare values of the same sign! */
1148 if (do_sign(val1) != do_sign(val2))
1149 return (do_sign(val1) == 1)?(1):(-1);
1151 /* loop until two digits differ, the values are equal if there
1152 * are no such two digits */
1153 while (val1[counter] == val2[counter]) {
1155 if (counter < 0) return 0;
1158 /* the leftmost digit is the most significant, so this returns
1159 * the correct result.
1160 * This implies the digit enum is ordered */
1161 return (val1[counter] > val2[counter]) ? (1) : (-1);
1164 int sc_get_highest_set_bit(const void *value) {
1165 const char *val = (const char*)value;
1168 high = calc_buffer_size * 4 - 1;
1170 for (counter = calc_buffer_size-1; counter >= 0; counter--) {
1171 if (val[counter] == SC_0)
1174 if (val[counter] > SC_7) return high;
1175 else if (val[counter] > SC_3) return high - 1;
1176 else if (val[counter] > SC_1) return high - 2;
1177 else return high - 3;
1183 int sc_get_lowest_set_bit(const void *value) {
1184 const char *val = (const char*)value;
1188 for (counter = 0; counter < calc_buffer_size; counter++) {
1189 switch (val[counter]) {
1216 int sc_get_bit_at(const void *value, unsigned pos) {
1217 const char *val = value;
1218 unsigned nibble = pos >> 2;
1220 if (and_table[(int) val[nibble]][(int) shift_table[pos & 3]] != SC_0)
1225 void sc_set_bit_at(void *value, unsigned pos)
1228 unsigned nibble = pos >> 2;
1230 val[nibble] = or_table[(int)val[nibble]][(int)shift_table[pos & 3]];
1233 int sc_is_zero(const void *value) {
1234 const char* val = (const char *)value;
1237 for (counter = 0; counter < calc_buffer_size; ++counter) {
1238 if (val[counter] != SC_0)
1244 int sc_is_negative(const void *value) {
1245 return do_sign(value) == -1;
1248 int sc_had_carry(void) {
1252 unsigned char sc_sub_bits(const void *value, int len, unsigned byte_ofs) {
1253 const char *val = (const char *)value;
1254 int nibble_ofs = 2 * byte_ofs;
1257 /* the current scheme uses one byte to store a nibble */
1258 if (4 * nibble_ofs >= len)
1261 res = _val(val[nibble_ofs]);
1262 if (len > 4 * (nibble_ofs + 1))
1263 res |= _val(val[nibble_ofs + 1]) << 4;
1265 /* kick bits outsize */
1266 if (len - 8 * byte_ofs < 8) {
1267 res &= (1 << (len - 8 * byte_ofs)) - 1;
1273 * convert to a string
1274 * FIXME: Doesn't check buffer bounds
1276 const char *sc_print(const void *value, unsigned bits, enum base_t base, int signed_mode) {
1277 static const char big_digits[] = "0123456789ABCDEF";
1278 static const char small_digits[] = "0123456789abcdef";
1280 char *base_val, *div1_res, *div2_res, *rem_res;
1281 int counter, nibbles, i, sign, mask;
1284 const char *val = (const char *)value;
1288 const char *digits = small_digits;
1290 base_val = alloca(calc_buffer_size);
1291 div1_res = alloca(calc_buffer_size);
1292 div2_res = alloca(calc_buffer_size);
1293 rem_res = alloca(calc_buffer_size);
1295 pos = output_buffer + bit_pattern_size;
1300 bits = bit_pattern_size;
1301 #ifdef STRCALC_DEBUG_FULLPRINT
1305 nibbles = bits >> 2;
1309 digits = big_digits;
1311 for (counter = 0; counter < nibbles; ++counter) {
1312 *(--pos) = digits[_val(val[counter])];
1313 #ifdef STRCALC_DEBUG_GROUPPRINT
1314 if ((counter+1)%8 == 0)
1319 /* last nibble must be masked */
1321 mask = zex_digit[(bits & 3) - 1];
1322 x = and_table[_val(val[counter++])][mask];
1323 *(--pos) = digits[_val(x)];
1326 /* now kill zeros */
1327 for (; counter > 1; --counter, ++pos) {
1328 #ifdef STRCALC_DEBUG_GROUPPRINT
1329 if (pos[0] == ' ') ++pos;
1337 for (counter = 0; counter < nibbles; ++counter) {
1339 p = binary_table[_val(val[counter])];
1346 /* last nibble must be masked */
1348 mask = zex_digit[(bits & 3) - 1];
1349 x = and_table[_val(val[counter++])][mask];
1352 p = binary_table[_val(x)];
1359 /* now kill zeros */
1360 for (counter <<= 2; counter > 1; --counter, ++pos)
1367 memset(base_val, SC_0, calc_buffer_size);
1368 base_val[0] = base == SC_DEC ? SC_A : SC_8;
1372 if (signed_mode && base == SC_DEC) {
1373 /* check for negative values */
1374 if (do_bit(val, bits - 1)) {
1375 do_negate(val, div2_res);
1381 /* transfer data into oscillating buffers */
1382 memset(div1_res, SC_0, calc_buffer_size);
1383 for (counter = 0; counter < nibbles; ++counter)
1384 div1_res[counter] = p[counter];
1386 /* last nibble must be masked */
1388 mask = zex_digit[(bits & 3) - 1];
1389 div1_res[counter] = and_table[_val(p[counter])][mask];
1396 do_divmod(m, base_val, n, rem_res);
1400 *(--pos) = digits[_val(rem_res[0])];
1403 for (i = 0; i < calc_buffer_size; ++i)
1414 panic("Unsupported base %d", base);
1419 void init_strcalc(int precision) {
1420 if (calc_buffer == NULL) {
1421 if (precision <= 0) precision = SC_DEFAULT_PRECISION;
1423 /* round up to multiple of 4 */
1424 precision = (precision + 3) & ~3;
1426 bit_pattern_size = (precision);
1427 calc_buffer_size = (precision / 2);
1428 max_value_size = (precision / 4);
1430 calc_buffer = XMALLOCN(char, calc_buffer_size + 1);
1431 output_buffer = XMALLOCN(char, bit_pattern_size + 1);
1433 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));
1438 void finish_strcalc(void) {
1439 free(calc_buffer); calc_buffer = NULL;
1440 free(output_buffer); output_buffer = NULL;
1443 int sc_get_precision(void) {
1444 return bit_pattern_size;
1448 void sc_add(const void *value1, const void *value2, void *buffer) {
1449 CLEAR_BUFFER(calc_buffer);
1452 DEBUGPRINTF_COMPUTATION(("%s + ", sc_print_hex(value1)));
1453 DEBUGPRINTF_COMPUTATION(("%s -> ", sc_print_hex(value2)));
1455 do_add(value1, value2, calc_buffer);
1457 DEBUGPRINTF_COMPUTATION(("%s\n", sc_print_hex(calc_buffer)));
1459 if ((buffer != NULL) && (buffer != calc_buffer)) {
1460 memcpy(buffer, calc_buffer, calc_buffer_size);
1464 void sc_sub(const void *value1, const void *value2, void *buffer) {
1465 CLEAR_BUFFER(calc_buffer);
1468 DEBUGPRINTF_COMPUTATION(("%s - ", sc_print_hex(value1)));
1469 DEBUGPRINTF_COMPUTATION(("%s -> ", sc_print_hex(value2)));
1471 do_sub(value1, value2, calc_buffer);
1473 DEBUGPRINTF_COMPUTATION(("%s\n", sc_print_hex(calc_buffer)));
1475 if ((buffer != NULL) && (buffer != calc_buffer)) {
1476 memcpy(buffer, calc_buffer, calc_buffer_size);
1480 void sc_neg(const void *value1, void *buffer) {
1483 DEBUGPRINTF_COMPUTATION(("- %s ->", sc_print_hex(value1)));
1485 do_negate(value1, calc_buffer);
1487 DEBUGPRINTF_COMPUTATION(("%s\n", sc_print_hex(calc_buffer)));
1489 if ((buffer != NULL) && (buffer != calc_buffer)) {
1490 memcpy(buffer, calc_buffer, calc_buffer_size);
1494 void sc_and(const void *value1, const void *value2, void *buffer) {
1495 CLEAR_BUFFER(calc_buffer);
1498 DEBUGPRINTF_COMPUTATION(("%s & ", sc_print_hex(value1)));
1499 DEBUGPRINTF_COMPUTATION(("%s -> ", sc_print_hex(value2)));
1501 do_bitand(value1, value2, calc_buffer);
1503 DEBUGPRINTF_COMPUTATION(("%s\n", sc_print_hex(calc_buffer)));
1505 if ((buffer != NULL) && (buffer != calc_buffer)) {
1506 memcpy(buffer, calc_buffer, calc_buffer_size);
1510 void sc_or(const void *value1, const void *value2, void *buffer) {
1511 CLEAR_BUFFER(calc_buffer);
1514 DEBUGPRINTF_COMPUTATION(("%s | ", sc_print_hex(value1)));
1515 DEBUGPRINTF_COMPUTATION(("%s -> ", sc_print_hex(value2)));
1517 do_bitor(value1, value2, calc_buffer);
1519 DEBUGPRINTF_COMPUTATION(("%s\n", sc_print_hex(calc_buffer)));
1521 if ((buffer != NULL) && (buffer != calc_buffer)) {
1522 memcpy(buffer, calc_buffer, calc_buffer_size);
1526 void sc_xor(const void *value1, const void *value2, void *buffer) {
1527 CLEAR_BUFFER(calc_buffer);
1530 DEBUGPRINTF_COMPUTATION(("%s ^ ", sc_print_hex(value1)));
1531 DEBUGPRINTF_COMPUTATION(("%s -> ", sc_print_hex(value2)));
1533 do_bitxor(value1, value2, calc_buffer);
1535 DEBUGPRINTF_COMPUTATION(("%s\n", sc_print_hex(calc_buffer)));
1537 if ((buffer != NULL) && (buffer != calc_buffer)) {
1538 memcpy(buffer, calc_buffer, calc_buffer_size);
1542 void sc_not(const void *value1, void *buffer) {
1543 CLEAR_BUFFER(calc_buffer);
1546 DEBUGPRINTF_COMPUTATION(("~ %s ->", sc_print_hex(value1)));
1548 do_bitnot(value1, calc_buffer);
1550 DEBUGPRINTF_COMPUTATION(("%s\n", sc_print_hex(calc_buffer)));
1552 if ((buffer != NULL) && (buffer != calc_buffer)) {
1553 memcpy(buffer, calc_buffer, calc_buffer_size);
1557 void sc_mul(const void *value1, const void *value2, void *buffer) {
1558 CLEAR_BUFFER(calc_buffer);
1561 DEBUGPRINTF_COMPUTATION(("%s * ", sc_print_hex(value1)));
1562 DEBUGPRINTF_COMPUTATION(("%s -> ", sc_print_hex(value2)));
1564 do_mul(value1, value2, calc_buffer);
1566 DEBUGPRINTF_COMPUTATION(("%s\n", sc_print_hex(calc_buffer)));
1568 if ((buffer != NULL) && (buffer != calc_buffer)) {
1569 memcpy(buffer, calc_buffer, calc_buffer_size);
1573 void sc_div(const void *value1, const void *value2, void *buffer) {
1574 /* temp buffer holding unused result of divmod */
1575 char *unused_res = alloca(calc_buffer_size);
1577 CLEAR_BUFFER(calc_buffer);
1580 DEBUGPRINTF_COMPUTATION(("%s / ", sc_print_hex(value1)));
1581 DEBUGPRINTF_COMPUTATION(("%s -> ", sc_print_hex(value2)));
1583 do_divmod(value1, value2, calc_buffer, unused_res);
1585 DEBUGPRINTF_COMPUTATION(("%s\n", sc_print_hex(calc_buffer)));
1587 if ((buffer != NULL) && (buffer != calc_buffer)) {
1588 memcpy(buffer, calc_buffer, calc_buffer_size);
1592 void sc_mod(const void *value1, const void *value2, void *buffer) {
1593 /* temp buffer holding unused result of divmod */
1594 char *unused_res = alloca(calc_buffer_size);
1596 CLEAR_BUFFER(calc_buffer);
1599 DEBUGPRINTF_COMPUTATION(("%s %% ", sc_print_hex(value1)));
1600 DEBUGPRINTF_COMPUTATION(("%s -> ", sc_print_hex(value2)));
1602 do_divmod(value1, value2, unused_res, 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_divmod(const void *value1, const void *value2, void *div_buffer, void *mod_buffer) {
1612 CLEAR_BUFFER(calc_buffer);
1615 DEBUGPRINTF_COMPUTATION(("%s %% ", sc_print_hex(value1)));
1616 DEBUGPRINTF_COMPUTATION(("%s -> ", sc_print_hex(value2)));
1618 do_divmod(value1, value2, div_buffer, mod_buffer);
1620 DEBUGPRINTF_COMPUTATION(("%s:%s\n", sc_print_hex(div_buffer), sc_print_hex(mod_buffer)));
1624 void sc_shlI(const void *val1, long shift_cnt, int bitsize, int sign, void *buffer) {
1627 DEBUGPRINTF_COMPUTATION(("%s << %ld ", sc_print_hex(value1), shift_cnt));
1628 do_shl(val1, calc_buffer, shift_cnt, bitsize, sign);
1630 DEBUGPRINTF_COMPUTATION(("-> %s\n", sc_print_hex(calc_buffer)));
1632 if ((buffer != NULL) && (buffer != calc_buffer)) {
1633 memmove(buffer, calc_buffer, calc_buffer_size);
1637 void sc_shl(const void *val1, const void *val2, int bitsize, int sign, void *buffer) {
1638 long offset = sc_val_to_long(val2);
1640 sc_shlI(val1, offset, bitsize, sign, buffer);
1643 void sc_shrI(const void *val1, long shift_cnt, int bitsize, int sign, void *buffer) {
1646 DEBUGPRINTF_COMPUTATION(("%s >>u %ld ", sc_print_hex(value1), shift_cnt));
1647 do_shr(val1, calc_buffer, shift_cnt, bitsize, sign, 0);
1649 DEBUGPRINTF_COMPUTATION(("-> %s\n", sc_print_hex(calc_buffer)));
1651 if ((buffer != NULL) && (buffer != calc_buffer)) {
1652 memmove(buffer, calc_buffer, calc_buffer_size);
1656 void sc_shr(const void *val1, const void *val2, int bitsize, int sign, void *buffer) {
1657 long shift_cnt = sc_val_to_long(val2);
1659 sc_shrI(val1, shift_cnt, bitsize, sign, buffer);
1662 void sc_shrs(const void *val1, const void *val2, int bitsize, int sign, void *buffer) {
1663 long offset = sc_val_to_long(val2);
1667 DEBUGPRINTF_COMPUTATION(("%s >>s %ld ", sc_print_hex(value1), offset));
1668 do_shr(val1, calc_buffer, offset, bitsize, sign, 1);
1670 DEBUGPRINTF_COMPUTATION(("-> %s\n", sc_print_hex(calc_buffer)));
1672 if ((buffer != NULL) && (buffer != calc_buffer)) {
1673 memmove(buffer, calc_buffer, calc_buffer_size);
1677 void sc_rotl(const void *val1, const void *val2, int bitsize, int sign, void *buffer) {
1678 long offset = sc_val_to_long(val2);
1682 DEBUGPRINTF_COMPUTATION(("%s <<>> %ld ", sc_print_hex(value1), offset));
1683 do_rotl(val1, calc_buffer, offset, bitsize, sign);
1685 DEBUGPRINTF_COMPUTATION(("-> %s\n", sc_print_hex(calc_buffer)));
1687 if ((buffer != NULL) && (buffer != calc_buffer)) {
1688 memmove(buffer, calc_buffer, calc_buffer_size);
1692 void sc_zero(void *buffer) {
1694 buffer = calc_buffer;
1695 CLEAR_BUFFER(buffer);