Annotation of src/lib/libc/gdtoa/gdtoaimp.h, Revision 1.1.1.2
1.1 kleink 1: /****************************************************************
2:
3: The author of this software is David M. Gay.
4:
5: Copyright (C) 1998-2000 by Lucent Technologies
6: All Rights Reserved
7:
8: Permission to use, copy, modify, and distribute this software and
9: its documentation for any purpose and without fee is hereby
10: granted, provided that the above copyright notice appear in all
11: copies and that both that the copyright notice and this
12: permission notice and warranty disclaimer appear in supporting
13: documentation, and that the name of Lucent or any of its entities
14: not be used in advertising or publicity pertaining to
15: distribution of the software without specific, written prior
16: permission.
17:
18: LUCENT DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE,
19: INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS.
20: IN NO EVENT SHALL LUCENT OR ANY OF ITS ENTITIES BE LIABLE FOR ANY
21: SPECIAL, INDIRECT OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
22: WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER
23: IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION,
24: ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF
25: THIS SOFTWARE.
26:
27: ****************************************************************/
28:
29: /* This is a variation on dtoa.c that converts arbitary binary
30: floating-point formats to and from decimal notation. It uses
31: double-precision arithmetic internally, so there are still
32: various #ifdefs that adapt the calculations to the native
33: double-precision arithmetic (any of IEEE, VAX D_floating,
34: or IBM mainframe arithmetic).
35:
36: Please send bug reports to David M. Gay (dmg at acm dot org,
37: with " at " changed at "@" and " dot " changed to ".").
38: */
39:
40: /* On a machine with IEEE extended-precision registers, it is
41: * necessary to specify double-precision (53-bit) rounding precision
42: * before invoking strtod or dtoa. If the machine uses (the equivalent
43: * of) Intel 80x87 arithmetic, the call
44: * _control87(PC_53, MCW_PC);
45: * does this with many compilers. Whether this or another call is
46: * appropriate depends on the compiler; for this to work, it may be
47: * necessary to #include "float.h" or another system-dependent header
48: * file.
49: */
50:
51: /* strtod for IEEE-, VAX-, and IBM-arithmetic machines.
52: *
53: * This strtod returns a nearest machine number to the input decimal
54: * string (or sets errno to ERANGE). With IEEE arithmetic, ties are
55: * broken by the IEEE round-even rule. Otherwise ties are broken by
56: * biased rounding (add half and chop).
57: *
58: * Inspired loosely by William D. Clinger's paper "How to Read Floating
59: * Point Numbers Accurately" [Proc. ACM SIGPLAN '90, pp. 112-126].
60: *
61: * Modifications:
62: *
63: * 1. We only require IEEE, IBM, or VAX double-precision
64: * arithmetic (not IEEE double-extended).
65: * 2. We get by with floating-point arithmetic in a case that
66: * Clinger missed -- when we're computing d * 10^n
67: * for a small integer d and the integer n is not too
68: * much larger than 22 (the maximum integer k for which
69: * we can represent 10^k exactly), we may be able to
70: * compute (d*10^k) * 10^(e-k) with just one roundoff.
71: * 3. Rather than a bit-at-a-time adjustment of the binary
72: * result in the hard case, we use floating-point
73: * arithmetic to determine the adjustment to within
74: * one bit; only in really hard cases do we need to
75: * compute a second residual.
76: * 4. Because of 3., we don't need a large table of powers of 10
77: * for ten-to-e (just some small tables, e.g. of 10^k
78: * for 0 <= k <= 22).
79: */
80:
81: /*
82: * #define IEEE_8087 for IEEE-arithmetic machines where the least
83: * significant byte has the lowest address.
84: * #define IEEE_MC68k for IEEE-arithmetic machines where the most
85: * significant byte has the lowest address.
86: * #define Long int on machines with 32-bit ints and 64-bit longs.
87: * #define Sudden_Underflow for IEEE-format machines without gradual
88: * underflow (i.e., that flush to zero on underflow).
89: * #define IBM for IBM mainframe-style floating-point arithmetic.
90: * #define VAX for VAX-style floating-point arithmetic (D_floating).
91: * #define No_leftright to omit left-right logic in fast floating-point
92: * computation of dtoa.
93: * #define Check_FLT_ROUNDS if FLT_ROUNDS can assume the values 2 or 3.
94: * #define RND_PRODQUOT to use rnd_prod and rnd_quot (assembly routines
95: * that use extended-precision instructions to compute rounded
96: * products and quotients) with IBM.
1.1.1.2 ! christos 97: * #define ROUND_BIASED for IEEE-format with biased rounding and arithmetic
! 98: * that rounds toward +Infinity.
! 99: * #define ROUND_BIASED_without_Round_Up for IEEE-format with biased
! 100: * rounding when the underlying floating-point arithmetic uses
! 101: * unbiased rounding. This prevent using ordinary floating-point
! 102: * arithmetic when the result could be computed with one rounding error.
1.1 kleink 103: * #define Inaccurate_Divide for IEEE-format with correctly rounded
104: * products but inaccurate quotients, e.g., for Intel i860.
105: * #define NO_LONG_LONG on machines that do not have a "long long"
106: * integer type (of >= 64 bits). On such machines, you can
107: * #define Just_16 to store 16 bits per 32-bit Long when doing
108: * high-precision integer arithmetic. Whether this speeds things
109: * up or slows things down depends on the machine and the number
110: * being converted. If long long is available and the name is
111: * something other than "long long", #define Llong to be the name,
112: * and if "unsigned Llong" does not work as an unsigned version of
113: * Llong, #define #ULLong to be the corresponding unsigned type.
114: * #define KR_headers for old-style C function headers.
115: * #define Bad_float_h if your system lacks a float.h or if it does not
116: * define some or all of DBL_DIG, DBL_MAX_10_EXP, DBL_MAX_EXP,
117: * FLT_RADIX, FLT_ROUNDS, and DBL_MAX.
118: * #define MALLOC your_malloc, where your_malloc(n) acts like malloc(n)
119: * if memory is available and otherwise does something you deem
120: * appropriate. If MALLOC is undefined, malloc will be invoked
1.1.1.2 ! christos 121: * directly -- and assumed always to succeed. Similarly, if you
! 122: * want something other than the system's free() to be called to
! 123: * recycle memory acquired from MALLOC, #define FREE to be the
! 124: * name of the alternate routine. (FREE or free is only called in
! 125: * pathological cases, e.g., in a gdtoa call after a gdtoa return in
! 126: * mode 3 with thousands of digits requested.)
1.1 kleink 127: * #define Omit_Private_Memory to omit logic (added Jan. 1998) for making
128: * memory allocations from a private pool of memory when possible.
129: * When used, the private pool is PRIVATE_MEM bytes long: 2304 bytes,
130: * unless #defined to be a different length. This default length
131: * suffices to get rid of MALLOC calls except for unusual cases,
132: * such as decimal-to-binary conversion of a very long string of
133: * digits. When converting IEEE double precision values, the
134: * longest string gdtoa can return is about 751 bytes long. For
135: * conversions by strtod of strings of 800 digits and all gdtoa
136: * conversions of IEEE doubles in single-threaded executions with
137: * 8-byte pointers, PRIVATE_MEM >= 7400 appears to suffice; with
138: * 4-byte pointers, PRIVATE_MEM >= 7112 appears adequate.
1.1.1.2 ! christos 139: * #define NO_INFNAN_CHECK if you do not wish to have INFNAN_CHECK
! 140: * #defined automatically on IEEE systems. On such systems,
! 141: * when INFNAN_CHECK is #defined, strtod checks
! 142: * for Infinity and NaN (case insensitively).
1.1 kleink 143: * When INFNAN_CHECK is #defined and No_Hex_NaN is not #defined,
144: * strtodg also accepts (case insensitively) strings of the form
1.1.1.2 ! christos 145: * NaN(x), where x is a string of hexadecimal digits (optionally
! 146: * preceded by 0x or 0X) and spaces; if there is only one string
! 147: * of hexadecimal digits, it is taken for the fraction bits of the
! 148: * resulting NaN; if there are two or more strings of hexadecimal
! 149: * digits, each string is assigned to the next available sequence
! 150: * of 32-bit words of fractions bits (starting with the most
! 151: * significant), right-aligned in each sequence.
! 152: * Unless GDTOA_NON_PEDANTIC_NANCHECK is #defined, input "NaN(...)"
! 153: * is consumed even when ... has the wrong form (in which case the
! 154: * "(...)" is consumed but ignored).
1.1 kleink 155: * #define MULTIPLE_THREADS if the system offers preemptively scheduled
156: * multiple threads. In this case, you must provide (or suitably
157: * #define) two locks, acquired by ACQUIRE_DTOA_LOCK(n) and freed
158: * by FREE_DTOA_LOCK(n) for n = 0 or 1. (The second lock, accessed
159: * in pow5mult, ensures lazy evaluation of only one copy of high
160: * powers of 5; omitting this lock would introduce a small
161: * probability of wasting memory, but would otherwise be harmless.)
162: * You must also invoke freedtoa(s) to free the value s returned by
163: * dtoa. You may do so whether or not MULTIPLE_THREADS is #defined.
164: * #define IMPRECISE_INEXACT if you do not care about the setting of
165: * the STRTOG_Inexact bits in the special case of doing IEEE double
1.1.1.2 ! christos 166: * precision conversions (which could also be done by the strtod in
1.1 kleink 167: * dtoa.c).
168: * #define NO_HEX_FP to disable recognition of C9x's hexadecimal
169: * floating-point constants.
170: * #define -DNO_ERRNO to suppress setting errno (in strtod.c and
171: * strtodg.c).
172: * #define NO_STRING_H to use private versions of memcpy.
173: * On some K&R systems, it may also be necessary to
174: * #define DECLARE_SIZE_T in this case.
175: * #define USE_LOCALE to use the current locale's decimal_point value.
176: */
177:
178: #ifndef GDTOAIMP_H_INCLUDED
179: #define GDTOAIMP_H_INCLUDED
180: #include "gdtoa.h"
181: #include "gd_qnan.h"
1.1.1.2 ! christos 182: #ifdef Honor_FLT_ROUNDS
! 183: #include <fenv.h>
! 184: #endif
1.1 kleink 185:
186: #ifdef DEBUG
187: #include "stdio.h"
188: #define Bug(x) {fprintf(stderr, "%s\n", x); exit(1);}
189: #endif
190:
191: #include "stdlib.h"
192: #include "string.h"
193:
194: #ifdef KR_headers
195: #define Char char
196: #else
197: #define Char void
198: #endif
199:
200: #ifdef MALLOC
201: extern Char *MALLOC ANSI((size_t));
202: #else
203: #define MALLOC malloc
204: #endif
205:
206: #undef IEEE_Arith
207: #undef Avoid_Underflow
208: #ifdef IEEE_MC68k
209: #define IEEE_Arith
210: #endif
211: #ifdef IEEE_8087
212: #define IEEE_Arith
213: #endif
214:
215: #include "errno.h"
216: #ifdef Bad_float_h
217:
218: #ifdef IEEE_Arith
219: #define DBL_DIG 15
220: #define DBL_MAX_10_EXP 308
221: #define DBL_MAX_EXP 1024
222: #define FLT_RADIX 2
223: #define DBL_MAX 1.7976931348623157e+308
224: #endif
225:
226: #ifdef IBM
227: #define DBL_DIG 16
228: #define DBL_MAX_10_EXP 75
229: #define DBL_MAX_EXP 63
230: #define FLT_RADIX 16
231: #define DBL_MAX 7.2370055773322621e+75
232: #endif
233:
234: #ifdef VAX
235: #define DBL_DIG 16
236: #define DBL_MAX_10_EXP 38
237: #define DBL_MAX_EXP 127
238: #define FLT_RADIX 2
239: #define DBL_MAX 1.7014118346046923e+38
240: #define n_bigtens 2
241: #endif
242:
243: #ifndef LONG_MAX
244: #define LONG_MAX 2147483647
245: #endif
246:
247: #else /* ifndef Bad_float_h */
248: #include "float.h"
249: #endif /* Bad_float_h */
250:
251: #ifdef IEEE_Arith
252: #define Scale_Bit 0x10
253: #define n_bigtens 5
254: #endif
255:
256: #ifdef IBM
257: #define n_bigtens 3
258: #endif
259:
260: #ifdef VAX
261: #define n_bigtens 2
262: #endif
263:
264: #ifndef __MATH_H__
265: #include "math.h"
266: #endif
267:
268: #ifdef __cplusplus
269: extern "C" {
270: #endif
271:
272: #if defined(IEEE_8087) + defined(IEEE_MC68k) + defined(VAX) + defined(IBM) != 1
273: Exactly one of IEEE_8087, IEEE_MC68k, VAX, or IBM should be defined.
274: #endif
275:
276: typedef union { double d; ULong L[2]; } U;
277:
278: #ifdef IEEE_8087
1.1.1.2 ! christos 279: #define word0(x) (x)->L[1]
! 280: #define word1(x) (x)->L[0]
1.1 kleink 281: #else
1.1.1.2 ! christos 282: #define word0(x) (x)->L[0]
! 283: #define word1(x) (x)->L[1]
1.1 kleink 284: #endif
1.1.1.2 ! christos 285: #define dval(x) (x)->d
1.1 kleink 286:
287: /* The following definition of Storeinc is appropriate for MIPS processors.
288: * An alternative that might be better on some machines is
289: * #define Storeinc(a,b,c) (*a++ = b << 16 | c & 0xffff)
290: */
291: #if defined(IEEE_8087) + defined(VAX)
292: #define Storeinc(a,b,c) (((unsigned short *)a)[1] = (unsigned short)b, \
293: ((unsigned short *)a)[0] = (unsigned short)c, a++)
294: #else
295: #define Storeinc(a,b,c) (((unsigned short *)a)[0] = (unsigned short)b, \
296: ((unsigned short *)a)[1] = (unsigned short)c, a++)
297: #endif
298:
299: /* #define P DBL_MANT_DIG */
300: /* Ten_pmax = floor(P*log(2)/log(5)) */
301: /* Bletch = (highest power of 2 < DBL_MAX_10_EXP) / 16 */
302: /* Quick_max = floor((P-1)*log(FLT_RADIX)/log(10) - 1) */
303: /* Int_max = floor(P*log(FLT_RADIX)/log(10) - 1) */
304:
305: #ifdef IEEE_Arith
306: #define Exp_shift 20
307: #define Exp_shift1 20
308: #define Exp_msk1 0x100000
309: #define Exp_msk11 0x100000
310: #define Exp_mask 0x7ff00000
311: #define P 53
312: #define Bias 1023
313: #define Emin (-1022)
314: #define Exp_1 0x3ff00000
315: #define Exp_11 0x3ff00000
316: #define Ebits 11
317: #define Frac_mask 0xfffff
318: #define Frac_mask1 0xfffff
319: #define Ten_pmax 22
320: #define Bletch 0x10
321: #define Bndry_mask 0xfffff
322: #define Bndry_mask1 0xfffff
323: #define LSB 1
324: #define Sign_bit 0x80000000
325: #define Log2P 1
326: #define Tiny0 0
327: #define Tiny1 1
328: #define Quick_max 14
329: #define Int_max 14
330:
331: #ifndef Flt_Rounds
332: #ifdef FLT_ROUNDS
333: #define Flt_Rounds FLT_ROUNDS
334: #else
335: #define Flt_Rounds 1
336: #endif
337: #endif /*Flt_Rounds*/
338:
339: #else /* ifndef IEEE_Arith */
340: #undef Sudden_Underflow
341: #define Sudden_Underflow
342: #ifdef IBM
343: #undef Flt_Rounds
344: #define Flt_Rounds 0
345: #define Exp_shift 24
346: #define Exp_shift1 24
347: #define Exp_msk1 0x1000000
348: #define Exp_msk11 0x1000000
349: #define Exp_mask 0x7f000000
350: #define P 14
351: #define Bias 65
352: #define Exp_1 0x41000000
353: #define Exp_11 0x41000000
354: #define Ebits 8 /* exponent has 7 bits, but 8 is the right value in b2d */
355: #define Frac_mask 0xffffff
356: #define Frac_mask1 0xffffff
357: #define Bletch 4
358: #define Ten_pmax 22
359: #define Bndry_mask 0xefffff
360: #define Bndry_mask1 0xffffff
361: #define LSB 1
362: #define Sign_bit 0x80000000
363: #define Log2P 4
364: #define Tiny0 0x100000
365: #define Tiny1 0
366: #define Quick_max 14
367: #define Int_max 15
368: #else /* VAX */
369: #undef Flt_Rounds
370: #define Flt_Rounds 1
371: #define Exp_shift 23
372: #define Exp_shift1 7
373: #define Exp_msk1 0x80
374: #define Exp_msk11 0x800000
375: #define Exp_mask 0x7f80
376: #define P 56
377: #define Bias 129
378: #define Exp_1 0x40800000
379: #define Exp_11 0x4080
380: #define Ebits 8
381: #define Frac_mask 0x7fffff
382: #define Frac_mask1 0xffff007f
383: #define Ten_pmax 24
384: #define Bletch 2
385: #define Bndry_mask 0xffff007f
386: #define Bndry_mask1 0xffff007f
387: #define LSB 0x10000
388: #define Sign_bit 0x8000
389: #define Log2P 1
390: #define Tiny0 0x80
391: #define Tiny1 0
392: #define Quick_max 15
393: #define Int_max 15
394: #endif /* IBM, VAX */
395: #endif /* IEEE_Arith */
396:
397: #ifndef IEEE_Arith
398: #define ROUND_BIASED
1.1.1.2 ! christos 399: #else
! 400: #ifdef ROUND_BIASED_without_Round_Up
! 401: #undef ROUND_BIASED
! 402: #define ROUND_BIASED
! 403: #endif
1.1 kleink 404: #endif
405:
406: #ifdef RND_PRODQUOT
407: #define rounded_product(a,b) a = rnd_prod(a, b)
408: #define rounded_quotient(a,b) a = rnd_quot(a, b)
409: #ifdef KR_headers
410: extern double rnd_prod(), rnd_quot();
411: #else
412: extern double rnd_prod(double, double), rnd_quot(double, double);
413: #endif
414: #else
415: #define rounded_product(a,b) a *= b
416: #define rounded_quotient(a,b) a /= b
417: #endif
418:
419: #define Big0 (Frac_mask1 | Exp_msk1*(DBL_MAX_EXP+Bias-1))
420: #define Big1 0xffffffff
421:
422: #undef Pack_16
423: #ifndef Pack_32
424: #define Pack_32
425: #endif
426:
427: #ifdef NO_LONG_LONG
428: #undef ULLong
429: #ifdef Just_16
430: #undef Pack_32
431: #define Pack_16
432: /* When Pack_32 is not defined, we store 16 bits per 32-bit Long.
433: * This makes some inner loops simpler and sometimes saves work
434: * during multiplications, but it often seems to make things slightly
435: * slower. Hence the default is now to store 32 bits per Long.
436: */
437: #endif
438: #else /* long long available */
439: #ifndef Llong
440: #define Llong long long
441: #endif
442: #ifndef ULLong
443: #define ULLong unsigned Llong
444: #endif
445: #endif /* NO_LONG_LONG */
446:
447: #ifdef Pack_32
448: #define ULbits 32
449: #define kshift 5
450: #define kmask 31
451: #define ALL_ON 0xffffffff
452: #else
453: #define ULbits 16
454: #define kshift 4
455: #define kmask 15
456: #define ALL_ON 0xffff
457: #endif
458:
459: #ifndef MULTIPLE_THREADS
460: #define ACQUIRE_DTOA_LOCK(n) /*nothing*/
461: #define FREE_DTOA_LOCK(n) /*nothing*/
462: #endif
463:
1.1.1.2 ! christos 464: #define Kmax 9
1.1 kleink 465:
466: struct
467: Bigint {
468: struct Bigint *next;
469: int k, maxwds, sign, wds;
470: ULong x[1];
471: };
472:
473: typedef struct Bigint Bigint;
474:
475: #ifdef NO_STRING_H
476: #ifdef DECLARE_SIZE_T
477: typedef unsigned int size_t;
478: #endif
479: extern void memcpy_D2A ANSI((void*, const void*, size_t));
480: #define Bcopy(x,y) memcpy_D2A(&x->sign,&y->sign,y->wds*sizeof(ULong) + 2*sizeof(int))
481: #else /* !NO_STRING_H */
482: #define Bcopy(x,y) memcpy(&x->sign,&y->sign,y->wds*sizeof(ULong) + 2*sizeof(int))
483: #endif /* NO_STRING_H */
484:
485: #define Balloc Balloc_D2A
486: #define Bfree Bfree_D2A
487: #define ULtoQ ULtoQ_D2A
488: #define ULtof ULtof_D2A
489: #define ULtod ULtod_D2A
490: #define ULtodd ULtodd_D2A
491: #define ULtox ULtox_D2A
492: #define ULtoxL ULtoxL_D2A
493: #define any_on any_on_D2A
494: #define b2d b2d_D2A
495: #define bigtens bigtens_D2A
496: #define cmp cmp_D2A
497: #define copybits copybits_D2A
498: #define d2b d2b_D2A
499: #define decrement decrement_D2A
500: #define diff diff_D2A
501: #define dtoa_result dtoa_result_D2A
502: #define g__fmt g__fmt_D2A
503: #define gethex gethex_D2A
504: #define hexdig hexdig_D2A
505: #define hexnan hexnan_D2A
506: #define hi0bits(x) hi0bits_D2A((ULong)(x))
507: #define i2b i2b_D2A
508: #define increment increment_D2A
509: #define lo0bits lo0bits_D2A
510: #define lshift lshift_D2A
511: #define match match_D2A
512: #define mult mult_D2A
513: #define multadd multadd_D2A
514: #define nrv_alloc nrv_alloc_D2A
515: #define pow5mult pow5mult_D2A
516: #define quorem quorem_D2A
517: #define ratio ratio_D2A
518: #define rshift rshift_D2A
519: #define rv_alloc rv_alloc_D2A
520: #define s2b s2b_D2A
521: #define set_ones set_ones_D2A
522: #define strcp strcp_D2A
523: #define strtoIg strtoIg_D2A
524: #define sum sum_D2A
525: #define tens tens_D2A
526: #define tinytens tinytens_D2A
527: #define tinytens tinytens_D2A
528: #define trailz trailz_D2A
529: #define ulp ulp_D2A
530:
531: extern char *dtoa_result;
532: extern CONST double bigtens[], tens[], tinytens[];
533: extern unsigned char hexdig[];
534:
535: extern Bigint *Balloc ANSI((int));
536: extern void Bfree ANSI((Bigint*));
537: extern void ULtof ANSI((ULong*, ULong*, Long, int));
538: extern void ULtod ANSI((ULong*, ULong*, Long, int));
539: extern void ULtodd ANSI((ULong*, ULong*, Long, int));
540: extern void ULtoQ ANSI((ULong*, ULong*, Long, int));
541: extern void ULtox ANSI((UShort*, ULong*, Long, int));
542: extern void ULtoxL ANSI((ULong*, ULong*, Long, int));
543: extern ULong any_on ANSI((Bigint*, int));
544: extern double b2d ANSI((Bigint*, int*));
545: extern int cmp ANSI((Bigint*, Bigint*));
546: extern void copybits ANSI((ULong*, int, Bigint*));
547: extern Bigint *d2b ANSI((double, int*, int*));
1.1.1.2 ! christos 548: extern void decrement ANSI((Bigint*));
1.1 kleink 549: extern Bigint *diff ANSI((Bigint*, Bigint*));
550: extern char *dtoa ANSI((double d, int mode, int ndigits,
551: int *decpt, int *sign, char **rve));
1.1.1.2 ! christos 552: extern char *g__fmt ANSI((char*, char*, char*, int, ULong, size_t));
1.1 kleink 553: extern int gethex ANSI((CONST char**, FPI*, Long*, Bigint**, int));
554: extern void hexdig_init_D2A(Void);
555: extern int hexnan ANSI((CONST char**, FPI*, ULong*));
556: extern int hi0bits_D2A ANSI((ULong));
557: extern Bigint *i2b ANSI((int));
558: extern Bigint *increment ANSI((Bigint*));
559: extern int lo0bits ANSI((ULong*));
560: extern Bigint *lshift ANSI((Bigint*, int));
561: extern int match ANSI((CONST char**, char*));
562: extern Bigint *mult ANSI((Bigint*, Bigint*));
563: extern Bigint *multadd ANSI((Bigint*, int, int));
564: extern char *nrv_alloc ANSI((char*, char **, int));
565: extern Bigint *pow5mult ANSI((Bigint*, int));
566: extern int quorem ANSI((Bigint*, Bigint*));
567: extern double ratio ANSI((Bigint*, Bigint*));
568: extern void rshift ANSI((Bigint*, int));
569: extern char *rv_alloc ANSI((int));
1.1.1.2 ! christos 570: extern Bigint *s2b ANSI((CONST char*, int, int, ULong, int));
1.1 kleink 571: extern Bigint *set_ones ANSI((Bigint*, int));
572: extern char *strcp ANSI((char*, const char*));
573: extern int strtoIg ANSI((CONST char*, char**, FPI*, Long*, Bigint**, int*));
574: extern double strtod ANSI((const char *s00, char **se));
575: extern Bigint *sum ANSI((Bigint*, Bigint*));
576: extern int trailz ANSI((Bigint*));
1.1.1.2 ! christos 577: extern double ulp ANSI((U*));
1.1 kleink 578:
579: #ifdef __cplusplus
580: }
581: #endif
582: /*
583: * NAN_WORD0 and NAN_WORD1 are only referenced in strtod.c. Prior to
584: * 20050115, they used to be hard-wired here (to 0x7ff80000 and 0,
585: * respectively), but now are determined by compiling and running
586: * qnan.c to generate gd_qnan.h, which specifies d_QNAN0 and d_QNAN1.
587: * Formerly gdtoaimp.h recommended supplying suitable -DNAN_WORD0=...
588: * and -DNAN_WORD1=... values if necessary. This should still work.
589: * (On HP Series 700/800 machines, -DNAN_WORD0=0x7ff40000 works.)
590: */
591: #ifdef IEEE_Arith
1.1.1.2 ! christos 592: #ifndef NO_INFNAN_CHECK
! 593: #undef INFNAN_CHECK
! 594: #define INFNAN_CHECK
! 595: #endif
1.1 kleink 596: #ifdef IEEE_MC68k
597: #define _0 0
598: #define _1 1
599: #ifndef NAN_WORD0
600: #define NAN_WORD0 d_QNAN0
601: #endif
602: #ifndef NAN_WORD1
603: #define NAN_WORD1 d_QNAN1
604: #endif
605: #else
606: #define _0 1
607: #define _1 0
608: #ifndef NAN_WORD0
609: #define NAN_WORD0 d_QNAN1
610: #endif
611: #ifndef NAN_WORD1
612: #define NAN_WORD1 d_QNAN0
613: #endif
614: #endif
615: #else
616: #undef INFNAN_CHECK
617: #endif
618:
619: #undef SI
620: #ifdef Sudden_Underflow
621: #define SI 1
622: #else
623: #define SI 0
624: #endif
625:
626: #endif /* GDTOAIMP_H_INCLUDED */
CVSweb <webmaster@jp.NetBSD.org>
![[BACK]](/icons/back.gif){kind=icon}
Return to gdtoaimp.h CVS log ![[TXT]](/icons/text.gif){kind=icon}
![[DIR]](/icons/dir.gif){kind=icon}
Up to [cvs.NetBSD.org] / src / lib / libc / gdtoa