blob: 6db5fba6c2ba0c44658e8120c73fe84b80b54a53 [file] [log] [blame]
H. Peter Anvinea6e34d2002-04-30 20:51:32 +00001/* float.c floating-point constant support for the Netwide Assembler
2 *
3 * The Netwide Assembler is copyright (C) 1996 Simon Tatham and
4 * Julian Hall. All rights reserved. The software is
5 * redistributable under the licence given in the file "Licence"
6 * distributed in the NASM archive.
7 *
8 * initial version 13/ix/96 by Simon Tatham
9 */
10
H. Peter Anvinfe501952007-10-02 21:53:51 -070011#include "compiler.h"
12
H. Peter Anvinfe2177f2007-09-18 18:31:26 -070013#include <ctype.h>
H. Peter Anvinea6e34d2002-04-30 20:51:32 +000014#include <stdio.h>
15#include <stdlib.h>
16#include <string.h>
Keith Kaniosb7a89542007-04-12 02:40:54 +000017#include <inttypes.h>
H. Peter Anvinea6e34d2002-04-30 20:51:32 +000018
19#include "nasm.h"
H. Peter Anvin214f5492007-10-15 19:46:32 -070020#include "float.h"
H. Peter Anvinea6e34d2002-04-30 20:51:32 +000021
22/*
H. Peter Anvin214f5492007-10-15 19:46:32 -070023 * -----------------
24 * local variables
25 * -----------------
26 */
27static efunc error;
28static bool daz = false; /* denormals as zero */
29static enum float_round rc = FLOAT_RC_NEAR; /* rounding control */
30
31/*
32 * -----------
33 * constants
34 * -----------
H. Peter Anvinea6e34d2002-04-30 20:51:32 +000035 */
36
H. Peter Anvin214f5492007-10-15 19:46:32 -070037/* 112 bits + 64 bits for accuracy + 16 bits for rounding */
38#define MANT_WORDS 12
39
40/* 52 digits fit in 176 bits because 10^53 > 2^176 > 10^52 */
41#define MANT_DIGITS 52
42
43/* the format and the argument list depend on MANT_WORDS */
44#define MANT_FMT "%04x%04x_%04x%04x_%04x%04x_%04x%04x_%04x%04x_%04x%04x"
45#define MANT_ARG SOME_ARG(mant, 0)
46
47#define SOME_ARG(a,i) (a)[(i)+0], (a)[(i)+1], (a)[(i)+2], (a)[(i)+3], \
48 (a)[(i)+4], (a)[(i)+5], (a)[(i)+6], (a)[(i)+7], (a)[(i)+8], \
49 (a)[(i)+9], (a)[(i)+10], (a)[(i)+11]
50
51/*
52 * ---------------------------------------------------------------------------
53 * emit a printf()-like debug message... but only if DEBUG_FLOAT was defined
54 * ---------------------------------------------------------------------------
55 */
56
57#ifdef DEBUG_FLOAT
58#define dprintf(x) printf x
59#else /* */
60#define dprintf(x) do { } while (0)
61#endif /* */
62
63/*
64 * ---------------------------------------------------------------------------
65 * multiply
66 * ---------------------------------------------------------------------------
67 */
68static int float_multiply(uint16_t * to, uint16_t * from)
H. Peter Anvineba20a72002-04-30 20:53:55 +000069{
Keith Kaniosb7a89542007-04-12 02:40:54 +000070 uint32_t temp[MANT_WORDS * 2];
H. Peter Anvin214f5492007-10-15 19:46:32 -070071 int32_t i, j;
H. Peter Anvinea6e34d2002-04-30 20:51:32 +000072
H. Peter Anvin214f5492007-10-15 19:46:32 -070073 /*
74 * guaranteed that top bit of 'from' is set -- so we only have
75 * to worry about _one_ bit shift to the left
76 */
77 dprintf(("%s=" MANT_FMT "\n", "mul1", SOME_ARG(to, 0)));
78 dprintf(("%s=" MANT_FMT "\n", "mul2", SOME_ARG(from, 0)));
H. Peter Anvinea6e34d2002-04-30 20:51:32 +000079
H. Peter Anvin214f5492007-10-15 19:46:32 -070080 memset(temp, 0, sizeof temp);
81
82 for (i = 0; i < MANT_WORDS; i++) {
H. Peter Anvine2c80182005-01-15 22:15:51 +000083 for (j = 0; j < MANT_WORDS; j++) {
Keith Kaniosb7a89542007-04-12 02:40:54 +000084 uint32_t n;
H. Peter Anvin214f5492007-10-15 19:46:32 -070085 n = (uint32_t) to[i] * (uint32_t) from[j];
H. Peter Anvine2c80182005-01-15 22:15:51 +000086 temp[i + j] += n >> 16;
87 temp[i + j + 1] += n & 0xFFFF;
88 }
H. Peter Anvin214f5492007-10-15 19:46:32 -070089 }
H. Peter Anvinea6e34d2002-04-30 20:51:32 +000090
H. Peter Anvine2c80182005-01-15 22:15:51 +000091 for (i = MANT_WORDS * 2; --i;) {
92 temp[i - 1] += temp[i] >> 16;
93 temp[i] &= 0xFFFF;
H. Peter Anvinea6e34d2002-04-30 20:51:32 +000094 }
H. Peter Anvin214f5492007-10-15 19:46:32 -070095
96 dprintf(("%s=" MANT_FMT "_" MANT_FMT "\n", "temp", SOME_ARG(temp, 0),
97 SOME_ARG(temp, MANT_WORDS)));
98
H. Peter Anvinea6e34d2002-04-30 20:51:32 +000099 if (temp[0] & 0x8000) {
H. Peter Anvin214f5492007-10-15 19:46:32 -0700100 for (i = 0; i < MANT_WORDS; i++) {
101 to[i] = temp[i] & 0xFFFF;
102 }
103 dprintf(("%s=" MANT_FMT " (%i)\n", "prod", SOME_ARG(to, 0), 0));
104 return 0;
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000105 } else {
H. Peter Anvin214f5492007-10-15 19:46:32 -0700106 for (i = 0; i < MANT_WORDS; i++) {
H. Peter Anvine2c80182005-01-15 22:15:51 +0000107 to[i] = (temp[i] << 1) + !!(temp[i + 1] & 0x8000);
H. Peter Anvin214f5492007-10-15 19:46:32 -0700108 }
109 dprintf(("%s=" MANT_FMT " (%i)\n", "prod", SOME_ARG(to, 0), -1));
H. Peter Anvine2c80182005-01-15 22:15:51 +0000110 return -1;
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000111 }
112}
113
H. Peter Anvin214f5492007-10-15 19:46:32 -0700114/*
115 * ---------------------------------------------------------------------------
116 * convert
117 * ---------------------------------------------------------------------------
118 */
119static bool ieee_flconvert(const char *string, uint16_t * mant,
120 int32_t * exponent)
121{
122 char digits[MANT_DIGITS];
123 char *p, *q, *r;
124 uint16_t mult[MANT_WORDS], bit;
125 uint16_t *m;
126 int32_t tenpwr, twopwr;
127 int32_t extratwos;
128 bool started, seendot, warned;
129 p = digits;
130 tenpwr = 0;
131 started = seendot = warned = false;
132 while (*string && *string != 'E' && *string != 'e') {
133 if (*string == '.') {
134 if (!seendot) {
135 seendot = true;
136 } else {
137 error(ERR_NONFATAL,
138 "too many periods in floating-point constant");
139 return false;
140 }
141 } else if (*string >= '0' && *string <= '9') {
142 if (*string == '0' && !started) {
143 if (seendot) {
144 tenpwr--;
145 }
146 } else {
147 started = true;
148 if (p < digits + sizeof(digits)) {
149 *p++ = *string - '0';
150 } else {
151 if (!warned) {
152 error(ERR_WARNING,
153 "floating-point constant significand contains "
154 "more than %i digits", MANT_DIGITS);
155 warned = true;
156 }
157 }
158 if (!seendot) {
159 tenpwr++;
160 }
161 }
162 } else if (*string == '_') {
163
164 /* do nothing */
165 } else {
166 error(ERR_NONFATAL,
167 "invalid character in floating-point constant %s: '%c'",
168 "significand", *string);
169 return false;
170 }
171 string++;
172 }
173 if (*string) {
174 int32_t i = 0;
175 bool neg = false;
176 string++; /* eat the E */
177 if (*string == '+') {
178 string++;
179 } else if (*string == '-') {
180 neg = true;
181 string++;
182 }
183 while (*string) {
184 if (*string >= '0' && *string <= '9') {
185 i = (i * 10) + (*string - '0');
186
187 /*
188 * To ensure that underflows and overflows are
189 * handled properly we must avoid wraparounds of
190 * the signed integer value that is used to hold
191 * the exponent. Therefore we cap the exponent at
192 * +/-5000, which is slightly more/less than
193 * what's required for normal and denormal numbers
194 * in single, double, and extended precision, but
195 * sufficient to avoid signed integer wraparound.
196 */
197 if (i > 5000) {
198 break;
199 }
200 } else if (*string == '_') {
201
202 /* do nothing */
203 } else {
204 error(ERR_NONFATAL,
205 "invalid character in floating-point constant %s: '%c'",
206 "exponent", *string);
207 return false;
208 }
209 string++;
210 }
211 if (neg) {
212 i = 0 - i;
213 }
214 tenpwr += i;
215 }
216
217 /*
218 * At this point, the memory interval [digits,p) contains a
219 * series of decimal digits zzzzzzz, such that our number X
220 * satisfies X = 0.zzzzzzz * 10^tenpwr.
221 */
222 q = digits;
223 dprintf(("X = 0."));
224 while (q < p) {
225 dprintf(("%c", *q + '0'));
226 q++;
227 }
228 dprintf((" * 10^%i\n", tenpwr));
229
230 /*
231 * Now convert [digits,p) to our internal representation.
232 */
233 bit = 0x8000;
234 for (m = mant; m < mant + MANT_WORDS; m++) {
235 *m = 0;
236 }
237 m = mant;
238 q = digits;
239 started = false;
240 twopwr = 0;
241 while (m < mant + MANT_WORDS) {
242 uint16_t carry = 0;
243 while (p > q && !p[-1]) {
244 p--;
245 }
246 if (p <= q) {
247 break;
248 }
249 for (r = p; r-- > q;) {
250 int32_t i;
251 i = 2 * *r + carry;
252 if (i >= 10) {
253 carry = 1;
254 i -= 10;
255 } else {
256 carry = 0;
257 }
258 *r = i;
259 }
260 if (carry) {
261 *m |= bit;
262 started = true;
263 }
264 if (started) {
265 if (bit == 1) {
266 bit = 0x8000;
267 m++;
268 } else {
269 bit >>= 1;
270 }
271 } else {
272 twopwr--;
273 }
274 }
275 twopwr += tenpwr;
276
277 /*
278 * At this point, the 'mant' array contains the first frac-
279 * tional places of a base-2^16 real number which when mul-
280 * tiplied by 2^twopwr and 5^tenpwr gives X.
281 */
282 dprintf(("X = " MANT_FMT " * 2^%i * 5^%i\n", MANT_ARG, twopwr,
283 tenpwr));
284
285 /*
286 * Now multiply 'mant' by 5^tenpwr.
287 */
288 if (tenpwr < 0) { /* mult = 5^-1 = 0.2 */
289 for (m = mult; m < mult + MANT_WORDS - 1; m++) {
290 *m = 0xCCCC;
291 }
292 mult[MANT_WORDS - 1] = 0xCCCD;
293 extratwos = -2;
294 tenpwr = -tenpwr;
295
296 /*
297 * If tenpwr was 1000...000b, then it becomes 1000...000b. See
298 * the "ANSI C" comment below for more details on that case.
299 *
300 * Because we already truncated tenpwr to +5000...-5000 inside
301 * the exponent parsing code, this shouldn't happen though.
302 */
303 } else if (tenpwr > 0) { /* mult = 5^+1 = 5.0 */
304 mult[0] = 0xA000;
305 for (m = mult + 1; m < mult + MANT_WORDS; m++) {
306 *m = 0;
307 }
308 extratwos = 3;
309 } else {
310 extratwos = 0;
311 }
312 while (tenpwr) {
313 dprintf(("loop=" MANT_FMT " * 2^%i * 5^%i (%i)\n", MANT_ARG,
314 twopwr, tenpwr, extratwos));
315 if (tenpwr & 1) {
316 dprintf(("mant*mult\n"));
317 twopwr += extratwos + float_multiply(mant, mult);
318 }
319 dprintf(("mult*mult\n"));
320 extratwos = extratwos * 2 + float_multiply(mult, mult);
321 tenpwr >>= 1;
322
323 /*
324 * In ANSI C, the result of right-shifting a signed integer is
325 * considered implementation-specific. To ensure that the loop
326 * terminates even if tenpwr was 1000...000b to begin with, we
327 * manually clear the MSB, in case a 1 was shifted in.
328 *
329 * Because we already truncated tenpwr to +5000...-5000 inside
330 * the exponent parsing code, this shouldn't matter; neverthe-
331 * less it is the right thing to do here.
332 */
333 tenpwr &= (uint32_t) - 1 >> 1;
334 }
335
336 /*
337 * At this point, the 'mant' array contains the first frac-
338 * tional places of a base-2^16 real number in [0.5,1) that
339 * when multiplied by 2^twopwr gives X. Or it contains zero
340 * of course. We are done.
341 */
342 *exponent = twopwr;
343 return true;
344}
345
346/*
347 * ---------------------------------------------------------------------------
348 * round a mantissa off after i words
349 * ---------------------------------------------------------------------------
350 */
351
352#define ROUND_COLLECT_BITS \
353 for (j = i; j < MANT_WORDS; j++) { \
354 m = m | mant[j]; \
355 }
356
357#define ROUND_ABS_DOWN \
358 for (j = i; j < MANT_WORDS; j++) { \
359 mant[j] = 0x0000; \
360 }
361
362#define ROUND_ABS_UP \
363 do { \
364 ++mant[--i]; \
365 mant[i] &= 0xFFFF; \
366 } while (i > 0 && !mant[i]); \
367 return (!i && !mant[i]);
368
H. Peter Anvin4da5b8c2007-10-16 10:32:57 -0700369static bool ieee_round(int sign, uint16_t * mant, int32_t i)
H. Peter Anvin214f5492007-10-15 19:46:32 -0700370{
371 uint16_t m = 0;
372 int32_t j;
373 if ((sign == 0x0000) || (sign == 0x8000)) {
374 if (rc == FLOAT_RC_NEAR) {
375 if (mant[i] & 0x8000) {
376 mant[i] &= 0x7FFF;
377 ROUND_COLLECT_BITS;
378 mant[i] |= 0x8000;
379 if (m) {
380 ROUND_ABS_UP;
381 } else {
382 if (mant[i - 1] & 1) {
383 ROUND_ABS_UP;
384 } else {
385 ROUND_ABS_DOWN;
386 }
387 }
388 } else {
389 ROUND_ABS_DOWN;
390 }
391 } else if (((sign == 0x0000) && (rc == FLOAT_RC_DOWN))
392 || ((sign == 0x8000) && (rc == FLOAT_RC_UP))) {
393 ROUND_COLLECT_BITS;
394 if (m) {
395 ROUND_ABS_DOWN;
396 }
397 } else if (((sign == 0x0000) && (rc == FLOAT_RC_UP))
398 || ((sign == 0x8000) && (rc == FLOAT_RC_DOWN))) {
399 ROUND_COLLECT_BITS;
400 if (m) {
401 ROUND_ABS_UP;
402 }
403 } else if (rc == FLOAT_RC_ZERO) {
404 ROUND_ABS_DOWN;
405 } else {
406 error(ERR_PANIC, "float_round() can't handle rc=%i", rc);
407 }
408 } else {
409 error(ERR_PANIC, "float_round() can't handle sign=%i", sign);
410 }
H. Peter Anvin4da5b8c2007-10-16 10:32:57 -0700411 return false;
H. Peter Anvin214f5492007-10-15 19:46:32 -0700412}
413
H. Peter Anvinfe2177f2007-09-18 18:31:26 -0700414static int hexval(char c)
415{
416 if (c >= '0' && c <= '9')
H. Peter Anvin214f5492007-10-15 19:46:32 -0700417 return c - '0';
H. Peter Anvinfe2177f2007-09-18 18:31:26 -0700418 else if (c >= 'a' && c <= 'f')
H. Peter Anvin214f5492007-10-15 19:46:32 -0700419 return c - 'a' + 10;
H. Peter Anvinfe2177f2007-09-18 18:31:26 -0700420 else
H. Peter Anvin214f5492007-10-15 19:46:32 -0700421 return c - 'A' + 10;
H. Peter Anvinfe2177f2007-09-18 18:31:26 -0700422}
423
H. Peter Anvin4da5b8c2007-10-16 10:32:57 -0700424static bool ieee_flconvert_hex(const char *string, uint16_t * mant,
H. Peter Anvin214f5492007-10-15 19:46:32 -0700425 int32_t * exponent)
H. Peter Anvinfe2177f2007-09-18 18:31:26 -0700426{
427 static const int log2tbl[16] =
H. Peter Anvin214f5492007-10-15 19:46:32 -0700428 { -1, 0, 1, 1, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 3 };
429 uint16_t mult[MANT_WORDS + 1], *mp;
H. Peter Anvinfe2177f2007-09-18 18:31:26 -0700430 int ms;
431 int32_t twopwr;
432 int seendot, seendigit;
433 unsigned char c;
434
435 twopwr = 0;
436 seendot = seendigit = 0;
H. Peter Anvin82f9f632007-09-24 20:53:48 -0700437 ms = 0;
438 mp = NULL;
H. Peter Anvinfe2177f2007-09-18 18:31:26 -0700439
440 memset(mult, 0, sizeof mult);
441
442 while ((c = *string++) != '\0') {
H. Peter Anvin214f5492007-10-15 19:46:32 -0700443 if (c == '.') {
H. Peter Anvinfe2177f2007-09-18 18:31:26 -0700444 if (!seendot)
H. Peter Anvin6867acc2007-10-10 14:58:45 -0700445 seendot = true;
H. Peter Anvinfe2177f2007-09-18 18:31:26 -0700446 else {
447 error(ERR_NONFATAL,
448 "too many periods in floating-point constant");
H. Peter Anvin4da5b8c2007-10-16 10:32:57 -0700449 return false;
H. Peter Anvinfe2177f2007-09-18 18:31:26 -0700450 }
H. Peter Anvin214f5492007-10-15 19:46:32 -0700451 } else if (isxdigit(c)) {
452 int v = hexval(c);
H. Peter Anvinfe2177f2007-09-18 18:31:26 -0700453
H. Peter Anvin214f5492007-10-15 19:46:32 -0700454 if (!seendigit && v) {
455 int l = log2tbl[v];
H. Peter Anvinfe2177f2007-09-18 18:31:26 -0700456
H. Peter Anvin214f5492007-10-15 19:46:32 -0700457 seendigit = 1;
458 mp = mult;
459 ms = 15 - l;
H. Peter Anvinfe2177f2007-09-18 18:31:26 -0700460
H. Peter Anvin214f5492007-10-15 19:46:32 -0700461 twopwr = seendot ? twopwr - 4 + l : l - 3;
462 }
H. Peter Anvinfe2177f2007-09-18 18:31:26 -0700463
H. Peter Anvin214f5492007-10-15 19:46:32 -0700464 if (seendigit) {
465 if (ms <= 0) {
466 *mp |= v >> -ms;
467 mp++;
468 if (mp > &mult[MANT_WORDS])
469 mp = &mult[MANT_WORDS]; /* Guard slot */
470 ms += 16;
471 }
472 *mp |= v << ms;
473 ms -= 4;
H. Peter Anvinfe2177f2007-09-18 18:31:26 -0700474
H. Peter Anvin214f5492007-10-15 19:46:32 -0700475 if (!seendot)
476 twopwr += 4;
477 } else {
478 if (seendot)
479 twopwr -= 4;
480 }
481 } else if (c == 'p' || c == 'P') {
482 twopwr += atoi(string);
483 break;
484 } else {
H. Peter Anvinfe2177f2007-09-18 18:31:26 -0700485 error(ERR_NONFATAL,
H. Peter Anvin214f5492007-10-15 19:46:32 -0700486 "floating-point constant: `%c' is invalid character", c);
H. Peter Anvin4da5b8c2007-10-16 10:32:57 -0700487 return false;
H. Peter Anvinfe2177f2007-09-18 18:31:26 -0700488 }
489 }
490
491 if (!seendigit) {
H. Peter Anvin214f5492007-10-15 19:46:32 -0700492 memset(mant, 0, 2 * MANT_WORDS); /* Zero */
493 *exponent = 0;
H. Peter Anvinfe2177f2007-09-18 18:31:26 -0700494 } else {
H. Peter Anvin214f5492007-10-15 19:46:32 -0700495 memcpy(mant, mult, 2 * MANT_WORDS);
496 *exponent = twopwr;
H. Peter Anvinfe2177f2007-09-18 18:31:26 -0700497 }
H. Peter Anvin4da5b8c2007-10-16 10:32:57 -0700498
499 return true;
H. Peter Anvinfe2177f2007-09-18 18:31:26 -0700500}
501
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000502/*
H. Peter Anvin4da5b8c2007-10-16 10:32:57 -0700503 * Shift a mantissa to the right by i bits.
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000504 */
H. Peter Anvin214f5492007-10-15 19:46:32 -0700505static void ieee_shr(uint16_t * mant, int i)
H. Peter Anvineba20a72002-04-30 20:53:55 +0000506{
H. Peter Anvin4da5b8c2007-10-16 10:32:57 -0700507 uint16_t n, m;
508 int j = 0;
509 int sr, sl, offs;
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000510
H. Peter Anvin4da5b8c2007-10-16 10:32:57 -0700511 sr = i%16; sl = 16-sr;
512 offs = i/16;
513
514 if (sr == 0) {
515 if (offs)
516 for (j = MANT_WORDS-1; j >= offs; j--)
517 mant[j] = mant[j-offs];
518 } else {
519 n = mant[MANT_WORDS-1-offs] >> sr;
520 for (j = MANT_WORDS-1; j > offs; j--) {
521 m = mant[j-offs-1];
522 mant[j] = (m << sl) | n;
523 n = m >> sr;
524 }
525 mant[j--] = n;
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000526 }
H. Peter Anvin4da5b8c2007-10-16 10:32:57 -0700527 while (j >= 0)
528 mant[j--] = 0;
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000529}
530
H. Peter Anvin214f5492007-10-15 19:46:32 -0700531#if defined(__i386__) || defined(__x86_64__)
532#define put(a,b) (*(uint16_t *)(a) = (b))
533#else
534#define put(a,b) (((a)[0] = (b)), ((a)[1] = (b) >> 8))
535#endif
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000536
H. Peter Anvinf48bc6f2007-09-18 21:55:56 -0700537/* Set a bit, using *bigendian* bit numbering (0 = MSB) */
H. Peter Anvin4da5b8c2007-10-16 10:32:57 -0700538static void set_bit(uint16_t *mant, int bit)
H. Peter Anvinf48bc6f2007-09-18 21:55:56 -0700539{
540 mant[bit >> 4] |= 1 << (~bit & 15);
541}
542
H. Peter Anvin4da5b8c2007-10-16 10:32:57 -0700543/* Test a single bit */
544static int test_bit(uint16_t *mant, int bit)
545{
546 return (mant[bit >> 4] >> (~bit & 15)) & 1;
547}
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000548
H. Peter Anvin4da5b8c2007-10-16 10:32:57 -0700549/* Produce standard IEEE formats, with implicit or explicit integer
550 bit; this makes the following assumptions:
551
552 - the sign bit is the MSB, followed by the exponent,
553 followed by the integer bit if present.
H. Peter Anvine31747e2007-09-18 17:50:34 -0700554 - the sign bit plus exponent fit in 16 bits.
555 - the exponent bias is 2^(n-1)-1 for an n-bit exponent */
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000556
H. Peter Anvine31747e2007-09-18 17:50:34 -0700557struct ieee_format {
558 int words;
H. Peter Anvin4da5b8c2007-10-16 10:32:57 -0700559 int mantissa; /* Fractional bits in the mantissa */
560 int explicit; /* Explicit integer */
H. Peter Anvin214f5492007-10-15 19:46:32 -0700561 int exponent; /* Bits in the exponent */
H. Peter Anvine31747e2007-09-18 17:50:34 -0700562};
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000563
H. Peter Anvin4da5b8c2007-10-16 10:32:57 -0700564/*
565 * The 16- and 128-bit formats are expected to be in IEEE 754r.
566 * AMD SSE5 uses the 16-bit format.
567 *
568 * The 32- and 64-bit formats are the original IEEE 754 formats.
569 *
570 * The 80-bit format is x87-specific, but widely used.
571 */
572static const struct ieee_format ieee_16 = { 1, 10, 0, 5 };
573static const struct ieee_format ieee_32 = { 2, 23, 0, 8 };
574static const struct ieee_format ieee_64 = { 4, 52, 0, 11 };
575static const struct ieee_format ieee_80 = { 5, 63, 1, 15 };
576static const struct ieee_format ieee_128 = { 8, 112, 0, 15 };
H. Peter Anvine31747e2007-09-18 17:50:34 -0700577
H. Peter Anvin4da5b8c2007-10-16 10:32:57 -0700578/* Types of values we can generate */
579enum floats {
580 FL_ZERO,
581 FL_DENORMAL,
582 FL_NORMAL,
583 FL_INFINITY,
584 FL_QNAN,
585 FL_SNAN
586};
587
H. Peter Anvin214f5492007-10-15 19:46:32 -0700588static int to_float(const char *str, int sign, uint8_t * result,
589 const struct ieee_format *fmt)
H. Peter Anvineba20a72002-04-30 20:53:55 +0000590{
H. Peter Anvine31747e2007-09-18 17:50:34 -0700591 uint16_t mant[MANT_WORDS], *mp;
H. Peter Anvin4da5b8c2007-10-16 10:32:57 -0700592 int32_t exponent = 0;
H. Peter Anvin214f5492007-10-15 19:46:32 -0700593 int32_t expmax = 1 << (fmt->exponent - 1);
H. Peter Anvin4da5b8c2007-10-16 10:32:57 -0700594 uint16_t one_mask = 0x8000 >> ((fmt->exponent+fmt->explicit) % 16);
595 int one_pos = (fmt->exponent+fmt->explicit)/16;
H. Peter Anvine31747e2007-09-18 17:50:34 -0700596 int i;
H. Peter Anvin4da5b8c2007-10-16 10:32:57 -0700597 int shift;
598 enum floats type;
599 bool ok;
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000600
H. Peter Anvin4da5b8c2007-10-16 10:32:57 -0700601 sign = (sign < 0 ? 0x8000 : 0);
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000602
H. Peter Anvinf48bc6f2007-09-18 21:55:56 -0700603 if (str[0] == '_') {
H. Peter Anvin4da5b8c2007-10-16 10:32:57 -0700604 /* Special tokens */
H. Peter Anvine31747e2007-09-18 17:50:34 -0700605
H. Peter Anvin214f5492007-10-15 19:46:32 -0700606 switch (str[2]) {
607 case 'n': /* __nan__ */
608 case 'N':
609 case 'q': /* __qnan__ */
610 case 'Q':
H. Peter Anvin4da5b8c2007-10-16 10:32:57 -0700611 type = FL_QNAN;
H. Peter Anvin214f5492007-10-15 19:46:32 -0700612 break;
613 case 's': /* __snan__ */
614 case 'S':
H. Peter Anvin4da5b8c2007-10-16 10:32:57 -0700615 type = FL_SNAN;
H. Peter Anvin214f5492007-10-15 19:46:32 -0700616 break;
617 case 'i': /* __infinity__ */
618 case 'I':
H. Peter Anvin4da5b8c2007-10-16 10:32:57 -0700619 type = FL_INFINITY;
H. Peter Anvin214f5492007-10-15 19:46:32 -0700620 break;
H. Peter Anvin4da5b8c2007-10-16 10:32:57 -0700621 default:
622 error(ERR_NONFATAL,
623 "internal error: unknown FP constant token `%s'\n", str);
624 type = FL_QNAN;
625 break;
H. Peter Anvin214f5492007-10-15 19:46:32 -0700626 }
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000627 } else {
H. Peter Anvin214f5492007-10-15 19:46:32 -0700628 if (str[0] == '0' && (str[1] == 'x' || str[1] == 'X'))
H. Peter Anvin4da5b8c2007-10-16 10:32:57 -0700629 ok = ieee_flconvert_hex(str + 2, mant, &exponent);
H. Peter Anvin214f5492007-10-15 19:46:32 -0700630 else
H. Peter Anvin4da5b8c2007-10-16 10:32:57 -0700631 ok = ieee_flconvert(str, mant, &exponent);
H. Peter Anvin214f5492007-10-15 19:46:32 -0700632
H. Peter Anvin4da5b8c2007-10-16 10:32:57 -0700633 if (!ok) {
634 type = FL_QNAN;
635 } else if (mant[0] & 0x8000) {
H. Peter Anvin214f5492007-10-15 19:46:32 -0700636 /*
637 * Non-zero.
638 */
639 exponent--;
640 if (exponent >= 2 - expmax && exponent <= expmax) {
H. Peter Anvin4da5b8c2007-10-16 10:32:57 -0700641 type = FL_NORMAL;
H. Peter Anvin214f5492007-10-15 19:46:32 -0700642 } else if (!daz && exponent < 2 - expmax &&
643 exponent >= 2 - expmax - fmt->mantissa) {
H. Peter Anvin4da5b8c2007-10-16 10:32:57 -0700644 type = FL_DENORMAL;
645 } else if (exponent > 0) {
646 error(ERR_NONFATAL,
647 "overflow in floating-point constant");
648 type = FL_INFINITY;
649 } else {
650 /* underflow */
651 type = FL_ZERO;
652 }
653 } else {
654 /* Zero */
655 type = FL_ZERO;
656 }
657 }
H. Peter Anvin214f5492007-10-15 19:46:32 -0700658
H. Peter Anvin4da5b8c2007-10-16 10:32:57 -0700659 switch (type) {
660 case FL_ZERO:
661 memset(mant, 0, sizeof mant);
662 break;
663
664 case FL_DENORMAL:
665 {
666 shift = -(exponent + expmax - 2 - fmt->exponent)
667 + fmt->explicit;
668 ieee_shr(mant, shift);
669 if (ieee_round(sign, mant, fmt->words)
670 || (shift > 0 && test_bit(mant, shift-1))) {
671 ieee_shr(mant, 1);
672 if (!shift) {
673 /* XXX: We shifted into the normal range? */
674 /* XXX: This is definitely not right... */
675 mant[0] |= 0x8000;
676 }
677 exponent++; /* UNUSED, WTF? */
678 }
679 break;
680 }
681
682 case FL_NORMAL:
683 exponent += expmax - 1;
684 ieee_shr(mant, fmt->exponent+fmt->explicit);
685 ieee_round(sign, mant, fmt->words);
686 /* did we scale up by one? */
687 if (test_bit(mant, fmt->exponent+fmt->explicit-1)) {
688 ieee_shr(mant, 1);
689 exponent++;
690 /* XXX: Handle overflow here */
691 }
692
693 if (!fmt->explicit)
694 mant[one_pos] &= ~one_mask; /* remove explicit one */
695 mant[0] |= exponent << (15 - fmt->exponent);
696 break;
697
698 case FL_INFINITY:
699 case FL_QNAN:
700 case FL_SNAN:
701 memset(mant, 0, sizeof mant);
702 mant[0] = ((1 << fmt->exponent)-1) << (15 - fmt->exponent);
703 if (fmt->explicit)
704 mant[one_pos] |= one_mask;
705 if (type == FL_QNAN)
706 set_bit(mant, fmt->exponent+fmt->explicit+1);
707 else if (type == FL_SNAN)
708 set_bit(mant, fmt->exponent+fmt->explicit+fmt->mantissa);
709 break;
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000710 }
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000711
H. Peter Anvine31747e2007-09-18 17:50:34 -0700712 mant[0] |= sign;
H. Peter Anvin141d7cf2007-09-18 16:39:03 -0700713
H. Peter Anvine31747e2007-09-18 17:50:34 -0700714 for (mp = &mant[fmt->words], i = 0; i < fmt->words; i++) {
H. Peter Anvin214f5492007-10-15 19:46:32 -0700715 uint16_t m = *--mp;
716 put(result, m);
717 result += 2;
H. Peter Anvin141d7cf2007-09-18 16:39:03 -0700718 }
H. Peter Anvine31747e2007-09-18 17:50:34 -0700719
720 return 1; /* success */
H. Peter Anvin141d7cf2007-09-18 16:39:03 -0700721}
722
H. Peter Anvin214f5492007-10-15 19:46:32 -0700723int float_const(const char *number, int32_t sign, uint8_t * result,
724 int bytes, efunc err)
H. Peter Anvineba20a72002-04-30 20:53:55 +0000725{
H. Peter Anvin214f5492007-10-15 19:46:32 -0700726 error = err;
727
H. Peter Anvin141d7cf2007-09-18 16:39:03 -0700728 switch (bytes) {
729 case 2:
H. Peter Anvin214f5492007-10-15 19:46:32 -0700730 return to_float(number, sign, result, &ieee_16);
H. Peter Anvin141d7cf2007-09-18 16:39:03 -0700731 case 4:
H. Peter Anvin214f5492007-10-15 19:46:32 -0700732 return to_float(number, sign, result, &ieee_32);
H. Peter Anvin141d7cf2007-09-18 16:39:03 -0700733 case 8:
H. Peter Anvin214f5492007-10-15 19:46:32 -0700734 return to_float(number, sign, result, &ieee_64);
H. Peter Anvin141d7cf2007-09-18 16:39:03 -0700735 case 10:
H. Peter Anvin4da5b8c2007-10-16 10:32:57 -0700736 return to_float(number, sign, result, &ieee_80);
H. Peter Anvine31747e2007-09-18 17:50:34 -0700737 case 16:
H. Peter Anvin214f5492007-10-15 19:46:32 -0700738 return to_float(number, sign, result, &ieee_128);
H. Peter Anvin141d7cf2007-09-18 16:39:03 -0700739 default:
H. Peter Anvine2c80182005-01-15 22:15:51 +0000740 error(ERR_PANIC, "strange value %d passed to float_const", bytes);
741 return 0;
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000742 }
743}