stdlib/strtod.c

   1 /*
   2  * Copyright (c) 1999 Apple Computer, Inc. All rights reserved.
   3  *
   4  * @APPLE_LICENSE_HEADER_START@
   5  *
   6  * Copyright (c) 1999-2003 Apple Computer, Inc.  All Rights Reserved.
   7  *
   8  * This file contains Original Code and/or Modifications of Original Code
   9  * as defined in and that are subject to the Apple Public Source License
  10  * Version 2.0 (the 'License'). You may not use this file except in
  11  * compliance with the License. Please obtain a copy of the License at
  12  * http://www.opensource.apple.com/apsl/ and read it before using this
  13  * file.
  14  *
  15  * The Original Code and all software distributed under the License are
  16  * distributed on an 'AS IS' basis, WITHOUT WARRANTY OF ANY KIND, EITHER
  17  * EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES,
  18  * INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY,
  19  * FITNESS FOR A PARTICULAR PURPOSE, QUIET ENJOYMENT OR NON-INFRINGEMENT.
  20  * Please see the License for the specific language governing rights and
  21  * limitations under the License.
  22  *
  23  * @APPLE_LICENSE_HEADER_END@
  24  */
  25 /****************************************************************
  26  *
  27  * The author of this software is David M. Gay.
  28  *
  29  * Copyright (c) 1991 by AT&T.
  30  *
  31  * Permission to use, copy, modify, and distribute this software for any
  32  * purpose without fee is hereby granted, provided that this entire notice
  33  * is included in all copies of any software which is or includes a copy
  34  * or modification of this software and in all copies of the supporting
  35  * documentation for such software.
  36  *
  37  * THIS SOFTWARE IS BEING PROVIDED "AS IS", WITHOUT ANY EXPRESS OR IMPLIED
  38  * WARRANTY.  IN PARTICULAR, NEITHER THE AUTHOR NOR AT&T MAKES ANY
  39  * REPRESENTATION OR WARRANTY OF ANY KIND CONCERNING THE MERCHANTABILITY
  40  * OF THIS SOFTWARE OR ITS FITNESS FOR ANY PARTICULAR PURPOSE.
  41  *
  42  ***************************************************************/
  43
  44 /* Please send bug reports to
  45         David M. Gay
  46         AT&T Bell Laboratories, Room 2C-463
  47         600 Mountain Avenue
  48         Murray Hill, NJ 07974-2070
  49         U.S.A.
  50         dmg@research.att.com or research!dmg
  51  */
  52
  53 /* strtod for IEEE-, VAX-, and IBM-arithmetic machines.
  54  *
  55  * This strtod returns a nearest machine number to the input decimal
  56  * string (or sets errno to ERANGE).  With IEEE arithmetic, ties are
  57  * broken by the IEEE round-even rule.  Otherwise ties are broken by
  58  * biased rounding (add half and chop).
  59  *
  60  * Inspired loosely by William D. Clinger's paper "How to Read Floating
  61  * Point Numbers Accurately" [Proc. ACM SIGPLAN '90, pp. 92-101].
  62  *
  63  * Modifications:
  64  *
  65  *      1. We only require IEEE, IBM, or VAX double-precision
  66  *              arithmetic (not IEEE double-extended).
  67  *      2. We get by with floating-point arithmetic in a case that
  68  *              Clinger missed -- when we're computing d * 10^n
  69  *              for a small integer d and the integer n is not too
  70  *              much larger than 22 (the maximum integer k for which
  71  *              we can represent 10^k exactly), we may be able to
  72  *              compute (d*10^k) * 10^(e-k) with just one roundoff.
  73  *      3. Rather than a bit-at-a-time adjustment of the binary
  74  *              result in the hard case, we use floating-point
  75  *              arithmetic to determine the adjustment to within
  76  *              one bit; only in really hard cases do we need to
  77  *              compute a second residual.
  78  *      4. Because of 3., we don't need a large table of powers of 10
  79  *              for ten-to-e (just some small tables, e.g. of 10^k
  80  *              for 0 <= k <= 22).
  81  */
  82
  83 /*
  84  * #define IEEE_LITTLE_ENDIAN for IEEE-arithmetic machines where the least
  85  *      significant byte has the lowest address.
  86  * #define IEEE_BIG_ENDIAN for IEEE-arithmetic machines where the most
  87  *      significant byte has the lowest address.
  88  * #define Long int on machines with 32-bit ints and 64-bit longs.
  89  * #define Sudden_Underflow for IEEE-format machines without gradual
  90  *      underflow (i.e., that flush to zero on underflow).
  91  * #define IBM for IBM mainframe-style floating-point arithmetic.
  92  * #define VAX for VAX-style floating-point arithmetic.
  93  * #define Unsigned_Shifts if >> does treats its left operand as unsigned.
  94  * #define No_leftright to omit left-right logic in fast floating-point
  95  *      computation of dtoa.
  96  * #define Check_FLT_ROUNDS if FLT_ROUNDS can assume the values 2 or 3.
  97  * #define RND_PRODQUOT to use rnd_prod and rnd_quot (assembly routines
  98  *      that use extended-precision instructions to compute rounded
  99  *      products and quotients) with IBM.
 100  * #define ROUND_BIASED for IEEE-format with biased rounding.
 101  * #define Inaccurate_Divide for IEEE-format with correctly rounded
 102  *      products but inaccurate quotients, e.g., for Intel i860.
 103  * #define Just_16 to store 16 bits per 32-bit Long when doing high-precision
 104  *      integer arithmetic.  Whether this speeds things up or slows things
 105  *      down depends on the machine and the number being converted.
 106  * #define KR_headers for old-style C function headers.
 107  * #define Bad_float_h if your system lacks a float.h or if it does not
 108  *      define some or all of DBL_DIG, DBL_MAX_10_EXP, DBL_MAX_EXP,
 109  *      FLT_RADIX, FLT_ROUNDS, and DBL_MAX.
 110  * #define MALLOC your_malloc, where your_malloc(n) acts like malloc(n)
 111  *      if memory is available and otherwise does something you deem
 112  *      appropriate.  If MALLOC is undefined, malloc will be invoked
 113  *      directly -- and assumed always to succeed.
 114  */
 115
 116 #if defined(LIBC_SCCS) && !defined(lint)
 117 static char *rcsid = "$OpenBSD: strtod.c,v 1.9 1997/03/25 17:07:30 rahnds Exp $";
 118 #endif /* LIBC_SCCS and not lint */
 119
 120 #if defined(__m68k__) || defined(__sparc__) || defined(__i386__) || \
 121     defined(__mips__) || defined(__ns32k__) || defined(__alpha__) || \
 122     defined(__powerpc__) || defined(__m88k__) || defined(__ppc__)
 123 #include <sys/types.h>
 124 #if BYTE_ORDER == BIG_ENDIAN
 125 #define IEEE_BIG_ENDIAN
 126 #else
 127 #define IEEE_LITTLE_ENDIAN
 128 #endif
 129 #endif
 130
 131 #ifdef __arm32__
 132 /*
 133  * Although the CPU is little endian the FP has different
 134  * byte and word endianness. The byte order is still little endian
 135  * but the word order is big endian.
 136  */
 137 #define IEEE_BIG_ENDIAN
 138 #endif
 139
 140 #ifdef vax
 141 #define VAX
 142 #endif
 143
 144 #define Long    int32_t
 145 #define ULong   u_int32_t
 146
 147 #ifdef DEBUG
 148 #include "stdio.h"
 149 #define Bug(x) {fprintf(stderr, "%s\n", x); exit(1);}
 150 #endif
 151
 152 #ifdef __cplusplus
 153 #include "malloc.h"
 154 #include "memory.h"
 155 #else
 156 #ifndef KR_headers
 157 #include "stdlib.h"
 158 #include "string.h"
 159 #include "locale.h"
 160 #else
 161 #include "malloc.h"
 162 #include "memory.h"
 163 #endif
 164 #endif
 165
 166 #ifdef MALLOC
 167 #ifdef KR_headers
 168 extern char *MALLOC();
 169 #else
 170 extern void *MALLOC(size_t);
 171 #endif
 172 #else
 173 #define MALLOC malloc
 174 #endif
 175
 176 #include "ctype.h"
 177 #include "errno.h"
 178
 179 #if defined(__APPLE__)
 180 /*
 181  * Temporarily define this, so we avoid pulling in symbols from libm
 182  */
 183 #define Bad_float_h
 184 #endif
 185
 186 #ifdef Bad_float_h
 187 #undef __STDC__
 188 #ifdef IEEE_BIG_ENDIAN
 189 #define IEEE_ARITHMETIC
 190 #endif
 191 #ifdef IEEE_LITTLE_ENDIAN
 192 #define IEEE_ARITHMETIC
 193 #endif
 194
 195 #ifdef IEEE_ARITHMETIC
 196 #define DBL_DIG 15
 197 #define DBL_MAX_10_EXP 308
 198 #define DBL_MAX_EXP 1024
 199 #define FLT_RADIX 2
 200 #define FLT_ROUNDS 1
 201 #define DBL_MAX 1.7976931348623157e+308
 202 #endif
 203
 204 #ifdef IBM
 205 #define DBL_DIG 16
 206 #define DBL_MAX_10_EXP 75
 207 #define DBL_MAX_EXP 63
 208 #define FLT_RADIX 16
 209 #define FLT_ROUNDS 0
 210 #define DBL_MAX 7.2370055773322621e+75
 211 #endif
 212
 213 #ifdef VAX
 214 #define DBL_DIG 16
 215 #define DBL_MAX_10_EXP 38
 216 #define DBL_MAX_EXP 127
 217 #define FLT_RADIX 2
 218 #define FLT_ROUNDS 1
 219 #define DBL_MAX 1.7014118346046923e+38
 220 #endif
 221
 222 #ifndef LONG_MAX
 223 #define LONG_MAX 2147483647
 224 #endif
 225 #else
 226 #include "float.h"
 227 #endif
 228 #ifndef __MATH_H__
 229 #include "math.h"
 230 #endif
 231
 232 #ifdef __cplusplus
 233 extern "C" {
 234 #endif
 235
 236 #ifndef CONST
 237 #ifdef KR_headers
 238 #define CONST /* blank */
 239 #else
 240 #define CONST const
 241 #endif
 242 #endif
 243
 244 #ifdef Unsigned_Shifts
 245 #define Sign_Extend(a,b) if (b < 0) a |= 0xffff0000;
 246 #else
 247 #define Sign_Extend(a,b) /*no-op*/
 248 #endif
 249
 250 #if defined(IEEE_LITTLE_ENDIAN) + defined(IEEE_BIG_ENDIAN) + defined(VAX) + \
 251     defined(IBM) != 1
 252 Exactly one of IEEE_LITTLE_ENDIAN IEEE_BIG_ENDIAN, VAX, or
 253 IBM should be defined.
 254 #endif
 255
 256 #ifdef IEEE_LITTLE_ENDIAN
 257 #define word0(x) ((ULong *)&x)[1]
 258 #define word1(x) ((ULong *)&x)[0]
 259 #else
 260 #define word0(x) ((ULong *)&x)[0]
 261 #define word1(x) ((ULong *)&x)[1]
 262 #endif
 263
 264 /* The following definition of Storeinc is appropriate for MIPS processors.
 265  * An alternative that might be better on some machines is
 266  * #define Storeinc(a,b,c) (*a++ = b << 16 | c & 0xffff)
 267  */
 268 #if defined(IEEE_LITTLE_ENDIAN) + defined(VAX) + defined(__arm32__)
 269 #define Storeinc(a,b,c) (((unsigned short *)a)[1] = (unsigned short)b, \
 270 ((unsigned short *)a)[0] = (unsigned short)c, a++)
 271 #else
 272 #define Storeinc(a,b,c) (((unsigned short *)a)[0] = (unsigned short)b, \
 273 ((unsigned short *)a)[1] = (unsigned short)c, a++)
 274 #endif
 275
 276 /* #define P DBL_MANT_DIG */
 277 /* Ten_pmax = floor(P*log(2)/log(5)) */
 278 /* Bletch = (highest power of 2 < DBL_MAX_10_EXP) / 16 */
 279 /* Quick_max = floor((P-1)*log(FLT_RADIX)/log(10) - 1) */
 280 /* Int_max = floor(P*log(FLT_RADIX)/log(10) - 1) */
 281
 282 #if defined(IEEE_LITTLE_ENDIAN) + defined(IEEE_BIG_ENDIAN)
 283 #define Exp_shift  20
 284 #define Exp_shift1 20
 285 #define Exp_msk1    0x100000
 286 #define Exp_msk11   0x100000
 287 #define Exp_mask  0x7ff00000
 288 #define P 53
 289 #define Bias 1023
 290 #define IEEE_Arith
 291 #define Emin (-1022)
 292 #define Exp_1  0x3ff00000
 293 #define Exp_11 0x3ff00000
 294 #define Ebits 11
 295 #define Frac_mask  0xfffff
 296 #define Frac_mask1 0xfffff
 297 #define Ten_pmax 22
 298 #define Bletch 0x10
 299 #define Bndry_mask  0xfffff
 300 #define Bndry_mask1 0xfffff
 301 #define LSB 1
 302 #define Sign_bit 0x80000000
 303 #define Log2P 1
 304 #define Tiny0 0
 305 #define Tiny1 1
 306 #define Quick_max 14
 307 #define Int_max 14
 308 #define Infinite(x) (word0(x) == 0x7ff00000) /* sufficient test for here */
 309 #else
 310 #undef  Sudden_Underflow
 311 #define Sudden_Underflow
 312 #ifdef IBM
 313 #define Exp_shift  24
 314 #define Exp_shift1 24
 315 #define Exp_msk1   0x1000000
 316 #define Exp_msk11  0x1000000
 317 #define Exp_mask  0x7f000000
 318 #define P 14
 319 #define Bias 65
 320 #define Exp_1  0x41000000
 321 #define Exp_11 0x41000000
 322 #define Ebits 8 /* exponent has 7 bits, but 8 is the right value in b2d */
 323 #define Frac_mask  0xffffff
 324 #define Frac_mask1 0xffffff
 325 #define Bletch 4
 326 #define Ten_pmax 22
 327 #define Bndry_mask  0xefffff
 328 #define Bndry_mask1 0xffffff
 329 #define LSB 1
 330 #define Sign_bit 0x80000000
 331 #define Log2P 4
 332 #define Tiny0 0x100000
 333 #define Tiny1 0
 334 #define Quick_max 14
 335 #define Int_max 15
 336 #else /* VAX */
 337 #define Exp_shift  23
 338 #define Exp_shift1 7
 339 #define Exp_msk1    0x80
 340 #define Exp_msk11   0x800000
 341 #define Exp_mask  0x7f80
 342 #define P 56
 343 #define Bias 129
 344 #define Exp_1  0x40800000
 345 #define Exp_11 0x4080
 346 #define Ebits 8
 347 #define Frac_mask  0x7fffff
 348 #define Frac_mask1 0xffff007f
 349 #define Ten_pmax 24
 350 #define Bletch 2
 351 #define Bndry_mask  0xffff007f
 352 #define Bndry_mask1 0xffff007f
 353 #define LSB 0x10000
 354 #define Sign_bit 0x8000
 355 #define Log2P 1
 356 #define Tiny0 0x80
 357 #define Tiny1 0
 358 #define Quick_max 15
 359 #define Int_max 15
 360 #endif
 361 #endif
 362
 363 #ifndef IEEE_Arith
 364 #define ROUND_BIASED
 365 #endif
 366
 367 #ifdef RND_PRODQUOT
 368 #define rounded_product(a,b) a = rnd_prod(a, b)
 369 #define rounded_quotient(a,b) a = rnd_quot(a, b)
 370 #ifdef KR_headers
 371 extern double rnd_prod(), rnd_quot();
 372 #else
 373 extern double rnd_prod(double, double), rnd_quot(double, double);
 374 #endif
 375 #else
 376 #define rounded_product(a,b) a *= b
 377 #define rounded_quotient(a,b) a /= b
 378 #endif
 379
 380 #define Big0 (Frac_mask1 | Exp_msk1*(DBL_MAX_EXP+Bias-1))
 381 #define Big1 0xffffffff
 382
 383 #ifndef Just_16
 384 /* When Pack_32 is not defined, we store 16 bits per 32-bit Long.
 385  * This makes some inner loops simpler and sometimes saves work
 386  * during multiplications, but it often seems to make things slightly
 387  * slower.  Hence the default is now to store 32 bits per Long.
 388  */
 389 #ifndef Pack_32
 390 #define Pack_32
 391 #endif
 392 #endif
 393
 394 #define Kmax 15
 395
 396 #ifdef __cplusplus
 397 extern "C" double strtod(const char *s00, char **se);
 398 extern "C" char *__dtoa(double d, int mode, int ndigits,
 399                         int *decpt, int *sign, char **rve, char **resultp);
 400 #endif
 401
 402  struct
 403 Bigint {
 404         struct Bigint *next;
 405         int k, maxwds, sign, wds;
 406         ULong x[1];
 407         };
 408
 409  typedef struct Bigint Bigint;
 410
 411  static Bigint *
 412 Balloc
 413 #ifdef KR_headers
 414         (k) int k;
 415 #else
 416         (int k)
 417 #endif
 418 {
 419         int x;
 420         Bigint *rv;
 421
 422         x = 1 << k;
 423         rv = (Bigint *)malloc(sizeof(Bigint) + (x-1)*sizeof(Long));
 424         rv->k = k;
 425         rv->maxwds = x;
 426         rv->sign = rv->wds = 0;
 427         return rv;
 428 }
 429
 430  static void
 431 Bfree
 432 #ifdef KR_headers
 433         (v) Bigint *v;
 434 #else
 435         (Bigint *v)
 436 #endif
 437 {
 438         free(v);
 439 }
 440
 441 #define Bcopy(x,y) memcpy((char *)&x->sign, (char *)&y->sign, \
 442 y->wds*sizeof(Long) + 2*sizeof(int))
 443
 444  static Bigint *
 445 multadd
 446 #ifdef KR_headers
 447         (b, m, a) Bigint *b; int m, a;
 448 #else
 449         (Bigint *b, int m, int a)       /* multiply by m and add a */
 450 #endif
 451 {
 452         int i, wds;
 453         ULong *x, y;
 454 #ifdef Pack_32
 455         ULong xi, z;
 456 #endif
 457         Bigint *b1;
 458
 459         wds = b->wds;
 460         x = b->x;
 461         i = 0;
 462         do {
 463 #ifdef Pack_32
 464                 xi = *x;
 465                 y = (xi & 0xffff) * m + a;
 466                 z = (xi >> 16) * m + (y >> 16);
 467                 a = (int)(z >> 16);
 468                 *x++ = (z << 16) + (y & 0xffff);
 469 #else
 470                 y = *x * m + a;
 471                 a = (int)(y >> 16);
 472                 *x++ = y & 0xffff;
 473 #endif
 474                 }
 475                 while(++i < wds);
 476         if (a) {
 477                 if (wds >= b->maxwds) {
 478                         b1 = Balloc(b->k+1);
 479                         Bcopy(b1, b);
 480                         Bfree(b);
 481                         b = b1;
 482                         }
 483                 b->x[wds++] = a;
 484                 b->wds = wds;
 485                 }
 486         return b;
 487         }
 488
 489  static Bigint *
 490 s2b
 491 #ifdef KR_headers
 492         (s, nd0, nd, y9) CONST char *s; int nd0, nd; ULong y9;
 493 #else
 494         (CONST char *s, int nd0, int nd, ULong y9)
 495 #endif
 496 {
 497         Bigint *b;
 498         int i, k;
 499         Long x, y;
 500
 501         x = (nd + 8) / 9;
 502         for(k = 0, y = 1; x > y; y <<= 1, k++) ;
 503 #ifdef Pack_32
 504         b = Balloc(k);
 505         b->x[0] = y9;
 506         b->wds = 1;
 507 #else
 508         b = Balloc(k+1);
 509         b->x[0] = y9 & 0xffff;
 510         b->wds = (b->x[1] = y9 >> 16) ? 2 : 1;
 511 #endif
 512
 513         i = 9;
 514         if (9 < nd0) {
 515                 s += 9;
 516                 do b = multadd(b, 10, *s++ - '0');
 517                         while(++i < nd0);
 518                 s++;
 519                 }
 520         else
 521                 s += 10;
 522         for(; i < nd; i++)
 523                 b = multadd(b, 10, *s++ - '0');
 524         return b;
 525         }
 526
 527  static int
 528 hi0bits
 529 #ifdef KR_headers
 530         (x) register ULong x;
 531 #else
 532         (register ULong x)
 533 #endif
 534 {
 535         register int k = 0;
 536
 537         if (!(x & 0xffff0000)) {
 538                 k = 16;
 539                 x <<= 16;
 540                 }
 541         if (!(x & 0xff000000)) {
 542                 k += 8;
 543                 x <<= 8;
 544                 }
 545         if (!(x & 0xf0000000)) {
 546                 k += 4;
 547                 x <<= 4;
 548                 }
 549         if (!(x & 0xc0000000)) {
 550                 k += 2;
 551                 x <<= 2;
 552                 }
 553         if (!(x & 0x80000000)) {
 554                 k++;
 555                 if (!(x & 0x40000000))
 556                         return 32;
 557                 }
 558         return k;
 559         }
 560
 561  static int
 562 lo0bits
 563 #ifdef KR_headers
 564         (y) ULong *y;
 565 #else
 566         (ULong *y)
 567 #endif
 568 {
 569         register int k;
 570         register ULong x = *y;
 571
 572         if (x & 7) {
 573                 if (x & 1)
 574                         return 0;
 575                 if (x & 2) {
 576                         *y = x >> 1;
 577                         return 1;
 578                         }
 579                 *y = x >> 2;
 580                 return 2;
 581                 }
 582         k = 0;
 583         if (!(x & 0xffff)) {
 584                 k = 16;
 585                 x >>= 16;
 586                 }
 587         if (!(x & 0xff)) {
 588                 k += 8;
 589                 x >>= 8;
 590                 }
 591         if (!(x & 0xf)) {
 592                 k += 4;
 593                 x >>= 4;
 594                 }
 595         if (!(x & 0x3)) {
 596                 k += 2;
 597                 x >>= 2;
 598                 }
 599         if (!(x & 1)) {
 600                 k++;
 601                 x >>= 1;
 602                 if (!x & 1)
 603                         return 32;
 604                 }
 605         *y = x;
 606         return k;
 607         }
 608
 609  static Bigint *
 610 i2b
 611 #ifdef KR_headers
 612         (i) int i;
 613 #else
 614         (int i)
 615 #endif
 616 {
 617         Bigint *b;
 618
 619         b = Balloc(1);
 620         b->x[0] = i;
 621         b->wds = 1;
 622         return b;
 623         }
 624
 625  static Bigint *
 626 mult
 627 #ifdef KR_headers
 628         (a, b) Bigint *a, *b;
 629 #else
 630         (Bigint *a, Bigint *b)
 631 #endif
 632 {
 633         Bigint *c;
 634         int k, wa, wb, wc;
 635         ULong carry, y, z;
 636         ULong *x, *xa, *xae, *xb, *xbe, *xc, *xc0;
 637 #ifdef Pack_32
 638         ULong z2;
 639 #endif
 640
 641         if (a->wds < b->wds) {
 642                 c = a;
 643                 a = b;
 644                 b = c;
 645                 }
 646         k = a->k;
 647         wa = a->wds;
 648         wb = b->wds;
 649         wc = wa + wb;
 650         if (wc > a->maxwds)
 651                 k++;
 652         c = Balloc(k);
 653         for(x = c->x, xa = x + wc; x < xa; x++)
 654                 *x = 0;
 655         xa = a->x;
 656         xae = xa + wa;
 657         xb = b->x;
 658         xbe = xb + wb;
 659         xc0 = c->x;
 660 #ifdef Pack_32
 661         for(; xb < xbe; xb++, xc0++) {
 662                 if (y = *xb & 0xffff) {
 663                         x = xa;
 664                         xc = xc0;
 665                         carry = 0;
 666                         do {
 667                                 z = (*x & 0xffff) * y + (*xc & 0xffff) + carry;
 668                                 carry = z >> 16;
 669                                 z2 = (*x++ >> 16) * y + (*xc >> 16) + carry;
 670                                 carry = z2 >> 16;
 671                                 Storeinc(xc, z2, z);
 672                                 }
 673                                 while(x < xae);
 674                         *xc = carry;
 675                         }
 676                 if (y = *xb >> 16) {
 677                         x = xa;
 678                         xc = xc0;
 679                         carry = 0;
 680                         z2 = *xc;
 681                         do {
 682                                 z = (*x & 0xffff) * y + (*xc >> 16) + carry;
 683                                 carry = z >> 16;
 684                                 Storeinc(xc, z, z2);
 685                                 z2 = (*x++ >> 16) * y + (*xc & 0xffff) + carry;
 686                                 carry = z2 >> 16;
 687                                 }
 688                                 while(x < xae);
 689                         *xc = z2;
 690                         }
 691                 }
 692 #else
 693         for(; xb < xbe; xc0++) {
 694                 if (y = *xb++) {
 695                         x = xa;
 696                         xc = xc0;
 697                         carry = 0;
 698                         do {
 699                                 z = *x++ * y + *xc + carry;
 700                                 carry = z >> 16;
 701                                 *xc++ = z & 0xffff;
 702                                 }
 703                                 while(x < xae);
 704                         *xc = carry;
 705                         }
 706                 }
 707 #endif
 708         for(xc0 = c->x, xc = xc0 + wc; wc > 0 && !*--xc; --wc) ;
 709         c->wds = wc;
 710         return c;
 711         }
 712
 713  static Bigint *p5s;
 714
 715  static Bigint *
 716 pow5mult
 717 #ifdef KR_headers
 718         (b, k) Bigint *b; int k;
 719 #else
 720         (Bigint *b, int k)
 721 #endif
 722 {
 723         Bigint *b1, *p5, *p51;
 724         int i;
 725         static int p05[3] = { 5, 25, 125 };
 726
 727         if (i = k & 3)
 728                 b = multadd(b, p05[i-1], 0);
 729
 730         if (!(k >>= 2))
 731                 return b;
 732         if (!(p5 = p5s)) {
 733                 /* first time */
 734                 p5 = p5s = i2b(625);
 735                 p5->next = 0;
 736                 }
 737         for(;;) {
 738                 if (k & 1) {
 739                         b1 = mult(b, p5);
 740                         Bfree(b);
 741                         b = b1;
 742                         }
 743                 if (!(k >>= 1))
 744                         break;
 745                 if (!(p51 = p5->next)) {
 746                         p51 = p5->next = mult(p5,p5);
 747                         p51->next = 0;
 748                         }
 749                 p5 = p51;
 750                 }
 751         return b;
 752         }
 753
 754  static Bigint *
 755 lshift
 756 #ifdef KR_headers
 757         (b, k) Bigint *b; int k;
 758 #else
 759         (Bigint *b, int k)
 760 #endif
 761 {
 762         int i, k1, n, n1;
 763         Bigint *b1;
 764         ULong *x, *x1, *xe, z;
 765
 766 #ifdef Pack_32
 767         n = k >> 5;
 768 #else
 769         n = k >> 4;
 770 #endif
 771         k1 = b->k;
 772         n1 = n + b->wds + 1;
 773         for(i = b->maxwds; n1 > i; i <<= 1)
 774                 k1++;
 775         b1 = Balloc(k1);
 776         x1 = b1->x;
 777         for(i = 0; i < n; i++)
 778                 *x1++ = 0;
 779         x = b->x;
 780         xe = x + b->wds;
 781 #ifdef Pack_32
 782         if (k &= 0x1f) {
 783                 k1 = 32 - k;
 784                 z = 0;
 785                 do {
 786                         *x1++ = *x << k | z;
 787                         z = *x++ >> k1;
 788                         }
 789                         while(x < xe);
 790                 if (*x1 = z)
 791                         ++n1;
 792                 }
 793 #else
 794         if (k &= 0xf) {
 795                 k1 = 16 - k;
 796                 z = 0;
 797                 do {
 798                         *x1++ = *x << k  & 0xffff | z;
 799                         z = *x++ >> k1;
 800                         }
 801                         while(x < xe);
 802                 if (*x1 = z)
 803                         ++n1;
 804                 }
 805 #endif
 806         else do
 807                 *x1++ = *x++;
 808                 while(x < xe);
 809         b1->wds = n1 - 1;
 810         Bfree(b);
 811         return b1;
 812         }
 813
 814  static int
 815 cmp
 816 #ifdef KR_headers
 817         (a, b) Bigint *a, *b;
 818 #else
 819         (Bigint *a, Bigint *b)
 820 #endif
 821 {
 822         ULong *xa, *xa0, *xb, *xb0;
 823         int i, j;
 824
 825         i = a->wds;
 826         j = b->wds;
 827 #ifdef DEBUG
 828         if (i > 1 && !a->x[i-1])
 829                 Bug("cmp called with a->x[a->wds-1] == 0");
 830         if (j > 1 && !b->x[j-1])
 831                 Bug("cmp called with b->x[b->wds-1] == 0");
 832 #endif
 833         if (i -= j)
 834                 return i;
 835         xa0 = a->x;
 836         xa = xa0 + j;
 837         xb0 = b->x;
 838         xb = xb0 + j;
 839         for(;;) {
 840                 if (*--xa != *--xb)
 841                         return *xa < *xb ? -1 : 1;
 842                 if (xa <= xa0)
 843                         break;
 844                 }
 845         return 0;
 846         }
 847
 848  static Bigint *
 849 diff
 850 #ifdef KR_headers
 851         (a, b) Bigint *a, *b;
 852 #else
 853         (Bigint *a, Bigint *b)
 854 #endif
 855 {
 856         Bigint *c;
 857         int i, wa, wb;
 858         Long borrow, y; /* We need signed shifts here. */
 859         ULong *xa, *xae, *xb, *xbe, *xc;
 860 #ifdef Pack_32
 861         Long z;
 862 #endif
 863
 864         i = cmp(a,b);
 865         if (!i) {
 866                 c = Balloc(0);
 867                 c->wds = 1;
 868                 c->x[0] = 0;
 869                 return c;
 870                 }
 871         if (i < 0) {
 872                 c = a;
 873                 a = b;
 874                 b = c;
 875                 i = 1;
 876                 }
 877         else
 878                 i = 0;
 879         c = Balloc(a->k);
 880         c->sign = i;
 881         wa = a->wds;
 882         xa = a->x;
 883         xae = xa + wa;
 884         wb = b->wds;
 885         xb = b->x;
 886         xbe = xb + wb;
 887         xc = c->x;
 888         borrow = 0;
 889 #ifdef Pack_32
 890         do {
 891                 y = (*xa & 0xffff) - (*xb & 0xffff) + borrow;
 892                 borrow = y >> 16;
 893                 Sign_Extend(borrow, y);
 894                 z = (*xa++ >> 16) - (*xb++ >> 16) + borrow;
 895                 borrow = z >> 16;
 896                 Sign_Extend(borrow, z);
 897                 Storeinc(xc, z, y);
 898                 }
 899                 while(xb < xbe);
 900         while(xa < xae) {
 901                 y = (*xa & 0xffff) + borrow;
 902                 borrow = y >> 16;
 903                 Sign_Extend(borrow, y);
 904                 z = (*xa++ >> 16) + borrow;
 905                 borrow = z >> 16;
 906                 Sign_Extend(borrow, z);
 907                 Storeinc(xc, z, y);
 908                 }
 909 #else
 910         do {
 911                 y = *xa++ - *xb++ + borrow;
 912                 borrow = y >> 16;
 913                 Sign_Extend(borrow, y);
 914                 *xc++ = y & 0xffff;
 915                 }
 916                 while(xb < xbe);
 917         while(xa < xae) {
 918                 y = *xa++ + borrow;
 919                 borrow = y >> 16;
 920                 Sign_Extend(borrow, y);
 921                 *xc++ = y & 0xffff;
 922                 }
 923 #endif
 924         while(!*--xc)
 925                 wa--;
 926         c->wds = wa;
 927         return c;
 928         }
 929
 930  static double
 931 ulp
 932 #ifdef KR_headers
 933         (x) double x;
 934 #else
 935         (double x)
 936 #endif
 937 {
 938         register Long L;
 939         double a;
 940
 941         L = (word0(x) & Exp_mask) - (P-1)*Exp_msk1;
 942 #ifndef Sudden_Underflow
 943         if (L > 0) {
 944 #endif
 945 #ifdef IBM
 946                 L |= Exp_msk1 >> 4;
 947 #endif
 948                 word0(a) = L;
 949                 word1(a) = 0;
 950 #ifndef Sudden_Underflow
 951                 }
 952         else {
 953                 L = -L >> Exp_shift;
 954                 if (L < Exp_shift) {
 955                         word0(a) = 0x80000 >> L;
 956                         word1(a) = 0;
 957                         }
 958                 else {
 959                         word0(a) = 0;
 960                         L -= Exp_shift;
 961                         word1(a) = L >= 31 ? 1 : 1 << 31 - L;
 962                         }
 963                 }
 964 #endif
 965         return a;
 966         }
 967
 968  static double
 969 b2d
 970 #ifdef KR_headers
 971         (a, e) Bigint *a; int *e;
 972 #else
 973         (Bigint *a, int *e)
 974 #endif
 975 {
 976         ULong *xa, *xa0, w, y, z;
 977         int k;
 978         double d;
 979 #ifdef VAX
 980         ULong d0, d1;
 981 #else
 982 #define d0 word0(d)
 983 #define d1 word1(d)
 984 #endif
 985
 986         xa0 = a->x;
 987         xa = xa0 + a->wds;
 988         y = *--xa;
 989 #ifdef DEBUG
 990         if (!y) Bug("zero y in b2d");
 991 #endif
 992         k = hi0bits(y);
 993         *e = 32 - k;
 994 #ifdef Pack_32
 995         if (k < Ebits) {
 996                 d0 = Exp_1 | y >> Ebits - k;
 997                 w = xa > xa0 ? *--xa : 0;
 998                 d1 = y << (32-Ebits) + k | w >> Ebits - k;
 999                 goto ret_d;
1000                 }
1001         z = xa > xa0 ? *--xa : 0;
1002         if (k -= Ebits) {
1003                 d0 = Exp_1 | y << k | z >> 32 - k;
1004                 y = xa > xa0 ? *--xa : 0;
1005                 d1 = z << k | y >> 32 - k;
1006                 }
1007         else {
1008                 d0 = Exp_1 | y;
1009                 d1 = z;
1010                 }
1011 #else
1012         if (k < Ebits + 16) {
1013                 z = xa > xa0 ? *--xa : 0;
1014                 d0 = Exp_1 | y << k - Ebits | z >> Ebits + 16 - k;
1015                 w = xa > xa0 ? *--xa : 0;
1016                 y = xa > xa0 ? *--xa : 0;
1017                 d1 = z << k + 16 - Ebits | w << k - Ebits | y >> 16 + Ebits - k;
1018                 goto ret_d;
1019                 }
1020         z = xa > xa0 ? *--xa : 0;
1021         w = xa > xa0 ? *--xa : 0;
1022         k -= Ebits + 16;
1023         d0 = Exp_1 | y << k + 16 | z << k | w >> 16 - k;
1024         y = xa > xa0 ? *--xa : 0;
1025         d1 = w << k + 16 | y << k;
1026 #endif
1027  ret_d:
1028 #ifdef VAX
1029         word0(d) = d0 >> 16 | d0 << 16;
1030         word1(d) = d1 >> 16 | d1 << 16;
1031 #else
1032 #undef d0
1033 #undef d1
1034 #endif
1035         return d;
1036         }
1037
1038  static Bigint *
1039 d2b
1040 #ifdef KR_headers
1041         (d, e, bits) double d; int *e, *bits;
1042 #else
1043         (double d, int *e, int *bits)
1044 #endif
1045 {
1046         Bigint *b;
1047         int de, i, k;
1048         ULong *x, y, z;
1049 #ifdef VAX
1050         ULong d0, d1;
1051         d0 = word0(d) >> 16 | word0(d) << 16;
1052         d1 = word1(d) >> 16 | word1(d) << 16;
1053 #else
1054 #define d0 word0(d)
1055 #define d1 word1(d)
1056 #endif
1057
1058 #ifdef Pack_32
1059         b = Balloc(1);
1060 #else
1061         b = Balloc(2);
1062 #endif
1063         x = b->x;
1064
1065         z = d0 & Frac_mask;
1066         d0 &= 0x7fffffff;       /* clear sign bit, which we ignore */
1067 #ifdef Sudden_Underflow
1068         de = (int)(d0 >> Exp_shift);
1069 #ifndef IBM
1070         z |= Exp_msk11;
1071 #endif
1072 #else
1073         if (de = (int)(d0 >> Exp_shift))
1074                 z |= Exp_msk1;
1075 #endif
1076 #ifdef Pack_32
1077         if (y = d1) {
1078                 if (k = lo0bits(&y)) {
1079                         x[0] = y | z << 32 - k;
1080                         z >>= k;
1081                         }
1082                 else
1083                         x[0] = y;
1084                 i = b->wds = (x[1] = z) ? 2 : 1;
1085                 }
1086         else {
1087 #ifdef DEBUG
1088                 if (!z)
1089                         Bug("Zero passed to d2b");
1090 #endif
1091                 k = lo0bits(&z);
1092                 x[0] = z;
1093                 i = b->wds = 1;
1094                 k += 32;
1095                 }
1096 #else
1097         if (y = d1) {
1098                 if (k = lo0bits(&y))
1099                         if (k >= 16) {
1100                                 x[0] = y | z << 32 - k & 0xffff;
1101                                 x[1] = z >> k - 16 & 0xffff;
1102                                 x[2] = z >> k;
1103                                 i = 2;
1104                                 }
1105                         else {
1106                                 x[0] = y & 0xffff;
1107                                 x[1] = y >> 16 | z << 16 - k & 0xffff;
1108                                 x[2] = z >> k & 0xffff;
1109                                 x[3] = z >> k+16;
1110                                 i = 3;
1111                                 }
1112                 else {
1113                         x[0] = y & 0xffff;
1114                         x[1] = y >> 16;
1115                         x[2] = z & 0xffff;
1116                         x[3] = z >> 16;
1117                         i = 3;
1118                         }
1119                 }
1120         else {
1121 #ifdef DEBUG
1122                 if (!z)
1123                         Bug("Zero passed to d2b");
1124 #endif
1125                 k = lo0bits(&z);
1126                 if (k >= 16) {
1127                         x[0] = z;
1128                         i = 0;
1129                         }
1130                 else {
1131                         x[0] = z & 0xffff;
1132                         x[1] = z >> 16;
1133                         i = 1;
1134                         }
1135                 k += 32;
1136                 }
1137         while(!x[i])
1138                 --i;
1139         b->wds = i + 1;
1140 #endif
1141 #ifndef Sudden_Underflow
1142         if (de) {
1143 #endif
1144 #ifdef IBM
1145                 *e = (de - Bias - (P-1) << 2) + k;
1146                 *bits = 4*P + 8 - k - hi0bits(word0(d) & Frac_mask);
1147 #else
1148                 *e = de - Bias - (P-1) + k;
1149                 *bits = P - k;
1150 #endif
1151 #ifndef Sudden_Underflow
1152                 }
1153         else {
1154                 *e = de - Bias - (P-1) + 1 + k;
1155 #ifdef Pack_32
1156                 *bits = 32*i - hi0bits(x[i-1]);
1157 #else
1158                 *bits = (i+2)*16 - hi0bits(x[i]);
1159 #endif
1160                 }
1161 #endif
1162         return b;
1163         }
1164 #undef d0
1165 #undef d1
1166
1167  static double
1168 ratio
1169 #ifdef KR_headers
1170         (a, b) Bigint *a, *b;
1171 #else
1172         (Bigint *a, Bigint *b)
1173 #endif
1174 {
1175         double da, db;
1176         int k, ka, kb;
1177
1178         da = b2d(a, &ka);
1179         db = b2d(b, &kb);
1180 #ifdef Pack_32
1181         k = ka - kb + 32*(a->wds - b->wds);
1182 #else
1183         k = ka - kb + 16*(a->wds - b->wds);
1184 #endif
1185 #ifdef IBM
1186         if (k > 0) {
1187                 word0(da) += (k >> 2)*Exp_msk1;
1188                 if (k &= 3)
1189                         da *= 1 << k;
1190                 }
1191         else {
1192                 k = -k;
1193                 word0(db) += (k >> 2)*Exp_msk1;
1194                 if (k &= 3)
1195                         db *= 1 << k;
1196                 }
1197 #else
1198         if (k > 0)
1199                 word0(da) += k*Exp_msk1;
1200         else {
1201                 k = -k;
1202                 word0(db) += k*Exp_msk1;
1203                 }
1204 #endif
1205         return da / db;
1206         }
1207
1208 static CONST double
1209 tens[] = {
1210                 1e0, 1e1, 1e2, 1e3, 1e4, 1e5, 1e6, 1e7, 1e8, 1e9,
1211                 1e10, 1e11, 1e12, 1e13, 1e14, 1e15, 1e16, 1e17, 1e18, 1e19,
1212                 1e20, 1e21, 1e22
1213 #ifdef VAX
1214                 , 1e23, 1e24
1215 #endif
1216                 };
1217
1218 #ifdef IEEE_Arith
1219 static CONST double bigtens[] = { 1e16, 1e32, 1e64, 1e128, 1e256 };
1220 static CONST double tinytens[] = { 1e-16, 1e-32, 1e-64, 1e-128, 1e-256 };
1221 #define n_bigtens 5
1222 #else
1223 #ifdef IBM
1224 static CONST double bigtens[] = { 1e16, 1e32, 1e64 };
1225 static CONST double tinytens[] = { 1e-16, 1e-32, 1e-64 };
1226 #define n_bigtens 3
1227 #else
1228 static CONST double bigtens[] = { 1e16, 1e32 };
1229 static CONST double tinytens[] = { 1e-16, 1e-32 };
1230 #define n_bigtens 2
1231 #endif
1232 #endif
1233
1234  double
1235 strtod
1236 #ifdef KR_headers
1237         (s00, se) CONST char *s00; char **se;
1238 #else
1239         (CONST char *s00, char **se)
1240 #endif
1241 {
1242         int bb2, bb5, bbe, bd2, bd5, bbbits, bs2, c, dsign,
1243                  e, e1, esign, i, j, k, nd, nd0, nf, nz, nz0, sign;
1244         CONST char *s, *s0, *s1;
1245         double aadj, aadj1, adj, rv, rv0;
1246         Long L;
1247         ULong y, z;
1248         Bigint *bb, *bb1, *bd, *bd0, *bs, *delta;
1249
1250 #ifndef KR_headers
1251         CONST char decimal_point = localeconv()->decimal_point[0];
1252 #else
1253         CONST char decimal_point = '.';
1254 #endif
1255
1256         sign = nz0 = nz = 0;
1257         rv = 0.;
1258
1259
1260         for(s = s00; isspace((unsigned char) *s); s++)
1261                 ;
1262
1263         if (*s == '-') {
1264                 sign = 1;
1265                 s++;
1266         } else if (*s == '+') {
1267                 s++;
1268         }
1269
1270         if (*s == '\0') {
1271                 s = s00;
1272                 goto ret;
1273         }
1274
1275         if (*s == '0') {
1276                 nz0 = 1;
1277                 while(*++s == '0') ;
1278                 if (!*s)
1279                         goto ret;
1280                 }
1281         s0 = s;
1282         y = z = 0;
1283         for(nd = nf = 0; (c = *s) >= '0' && c <= '9'; nd++, s++)
1284                 if (nd < 9)
1285                         y = 10*y + c - '0';
1286                 else if (nd < 16)
1287                         z = 10*z + c - '0';
1288         nd0 = nd;
1289         if (c == decimal_point) {
1290                 c = *++s;
1291                 if (!nd) {
1292                         for(; c == '0'; c = *++s)
1293                                 nz++;
1294                         if (c > '0' && c <= '9') {
1295                                 s0 = s;
1296                                 nf += nz;
1297                                 nz = 0;
1298                                 goto have_dig;
1299                                 }
1300                         goto dig_done;
1301                         }
1302                 for(; c >= '0' && c <= '9'; c = *++s) {
1303  have_dig:
1304                         nz++;
1305                         if (c -= '0') {
1306                                 nf += nz;
1307                                 for(i = 1; i < nz; i++)
1308                                         if (nd++ < 9)
1309                                                 y *= 10;
1310                                         else if (nd <= DBL_DIG + 1)
1311                                                 z *= 10;
1312                                 if (nd++ < 9)
1313                                         y = 10*y + c;
1314                                 else if (nd <= DBL_DIG + 1)
1315                                         z = 10*z + c;
1316                                 nz = 0;
1317                                 }
1318                         }
1319                 }
1320  dig_done:
1321         e = 0;
1322         if (c == 'e' || c == 'E') {
1323                 if (!nd && !nz && !nz0) {
1324                         s = s00;
1325                         goto ret;
1326                         }
1327                 s00 = s;
1328                 esign = 0;
1329                 switch(c = *++s) {
1330                         case '-':
1331                                 esign = 1;
1332                         case '+':
1333                                 c = *++s;
1334                         }
1335                 if (c >= '0' && c <= '9') {
1336                         while(c == '0')
1337                                 c = *++s;
1338                         if (c > '0' && c <= '9') {
1339                                 L = c - '0';
1340                                 s1 = s;
1341                                 while((c = *++s) >= '0' && c <= '9')
1342                                         L = 10*L + c - '0';
1343                                 if (s - s1 > 8 || L > 19999)
1344                                         /* Avoid confusion from exponents
1345                                          * so large that e might overflow.
1346                                          */
1347                                         e = 19999; /* safe for 16 bit ints */
1348                                 else
1349                                         e = (int)L;
1350                                 if (esign)
1351                                         e = -e;
1352                                 }
1353                         else
1354                                 e = 0;
1355                         }
1356                 else
1357                         s = s00;
1358                 }
1359         if (!nd) {
1360                 if (!nz && !nz0)
1361                         s = s00;
1362                 goto ret;
1363                 }
1364         e1 = e -= nf;
1365
1366         /* Now we have nd0 digits, starting at s0, followed by a
1367          * decimal point, followed by nd-nd0 digits.  The number we're
1368          * after is the integer represented by those digits times
1369          * 10**e */
1370
1371         if (!nd0)
1372                 nd0 = nd;
1373         k = nd < DBL_DIG + 1 ? nd : DBL_DIG + 1;
1374         rv = y;
1375         if (k > 9)
1376                 rv = tens[k - 9] * rv + z;
1377         bd0 = 0;
1378         if (nd <= DBL_DIG
1379 #ifndef RND_PRODQUOT
1380                 && FLT_ROUNDS == 1
1381 #endif
1382                         ) {
1383                 if (!e)
1384                         goto ret;
1385                 if (e > 0) {
1386                         if (e <= Ten_pmax) {
1387 #ifdef VAX
1388                                 goto vax_ovfl_check;
1389 #else
1390                                 /* rv = */ rounded_product(rv, tens[e]);
1391                                 goto ret;
1392 #endif
1393                                 }
1394                         i = DBL_DIG - nd;
1395                         if (e <= Ten_pmax + i) {
1396                                 /* A fancier test would sometimes let us do
1397                                  * this for larger i values.
1398                                  */
1399                                 e -= i;
1400                                 rv *= tens[i];
1401 #ifdef VAX
1402                                 /* VAX exponent range is so narrow we must
1403                                  * worry about overflow here...
1404                                  */
1405  vax_ovfl_check:
1406                                 word0(rv) -= P*Exp_msk1;
1407                                 /* rv = */ rounded_product(rv, tens[e]);
1408                                 if ((word0(rv) & Exp_mask)
1409                                  > Exp_msk1*(DBL_MAX_EXP+Bias-1-P))
1410                                         goto ovfl;
1411                                 word0(rv) += P*Exp_msk1;
1412 #else
1413                                 /* rv = */ rounded_product(rv, tens[e]);
1414 #endif
1415                                 goto ret;
1416                                 }
1417                         }
1418 #ifndef Inaccurate_Divide
1419                 else if (e >= -Ten_pmax) {
1420                         /* rv = */ rounded_quotient(rv, tens[-e]);
1421                         goto ret;
1422                         }
1423 #endif
1424                 }
1425         e1 += nd - k;
1426
1427         /* Get starting approximation = rv * 10**e1 */
1428
1429         if (e1 > 0) {
1430                 if (i = e1 & 15)
1431                         rv *= tens[i];
1432                 if (e1 &= ~15) {
1433                         if (e1 > DBL_MAX_10_EXP) {
1434  ovfl:
1435                                 errno = ERANGE;
1436 #ifdef __STDC__
1437                                 rv = HUGE_VAL;
1438 #else
1439                                 /* Can't trust HUGE_VAL */
1440 #ifdef IEEE_Arith
1441                                 word0(rv) = Exp_mask;
1442                                 word1(rv) = 0;
1443 #else
1444                                 word0(rv) = Big0;
1445                                 word1(rv) = Big1;
1446 #endif
1447 #endif
1448                                 if (bd0)
1449                                         goto retfree;
1450                                 goto ret;
1451                                 }
1452                         if (e1 >>= 4) {
1453                                 for(j = 0; e1 > 1; j++, e1 >>= 1)
1454                                         if (e1 & 1)
1455                                                 rv *= bigtens[j];
1456                         /* The last multiplication could overflow. */
1457                                 word0(rv) -= P*Exp_msk1;
1458                                 rv *= bigtens[j];
1459                                 if ((z = word0(rv) & Exp_mask)
1460                                  > Exp_msk1*(DBL_MAX_EXP+Bias-P))
1461                                         goto ovfl;
1462                                 if (z > Exp_msk1*(DBL_MAX_EXP+Bias-1-P)) {
1463                                         /* set to largest number */
1464                                         /* (Can't trust DBL_MAX) */
1465                                         word0(rv) = Big0;
1466                                         word1(rv) = Big1;
1467                                         }
1468                                 else
1469                                         word0(rv) += P*Exp_msk1;
1470                                 }
1471
1472                         }
1473                 }
1474         else if (e1 < 0) {
1475                 e1 = -e1;
1476                 if (i = e1 & 15)
1477                         rv /= tens[i];
1478                 if (e1 &= ~15) {
1479                         e1 >>= 4;
1480                         if (e1 >= 1 << n_bigtens)
1481                                 goto undfl;
1482                         for(j = 0; e1 > 1; j++, e1 >>= 1)
1483                                 if (e1 & 1)
1484                                         rv *= tinytens[j];
1485                         /* The last multiplication could underflow. */
1486                         rv0 = rv;
1487                         rv *= tinytens[j];
1488                         if (!rv) {
1489                                 rv = 2.*rv0;
1490                                 rv *= tinytens[j];
1491                                 if (!rv) {
1492  undfl:
1493                                         rv = 0.;
1494                                         errno = ERANGE;
1495                                         if (bd0)
1496                                                 goto retfree;
1497                                         goto ret;
1498                                         }
1499                                 word0(rv) = Tiny0;
1500                                 word1(rv) = Tiny1;
1501                                 /* The refinement below will clean
1502                                  * this approximation up.
1503                                  */
1504                                 }
1505                         }
1506                 }
1507
1508         /* Now the hard part -- adjusting rv to the correct value.*/
1509
1510         /* Put digits into bd: true value = bd * 10^e */
1511
1512         bd0 = s2b(s0, nd0, nd, y);
1513
1514         for(;;) {
1515                 bd = Balloc(bd0->k);
1516                 Bcopy(bd, bd0);
1517                 bb = d2b(rv, &bbe, &bbbits);    /* rv = bb * 2^bbe */
1518                 bs = i2b(1);
1519
1520                 if (e >= 0) {
1521                         bb2 = bb5 = 0;
1522                         bd2 = bd5 = e;
1523                         }
1524                 else {
1525                         bb2 = bb5 = -e;
1526                         bd2 = bd5 = 0;
1527                         }
1528                 if (bbe >= 0)
1529                         bb2 += bbe;
1530                 else
1531                         bd2 -= bbe;
1532                 bs2 = bb2;
1533 #ifdef Sudden_Underflow
1534 #ifdef IBM
1535                 j = 1 + 4*P - 3 - bbbits + ((bbe + bbbits - 1) & 3);
1536 #else
1537                 j = P + 1 - bbbits;
1538 #endif
1539 #else
1540                 i = bbe + bbbits - 1;   /* logb(rv) */
1541                 if (i < Emin)   /* denormal */
1542                         j = bbe + (P-Emin);
1543                 else
1544                         j = P + 1 - bbbits;
1545 #endif
1546                 bb2 += j;
1547                 bd2 += j;
1548                 i = bb2 < bd2 ? bb2 : bd2;
1549                 if (i > bs2)
1550                         i = bs2;
1551                 if (i > 0) {
1552                         bb2 -= i;
1553                         bd2 -= i;
1554                         bs2 -= i;
1555                         }
1556                 if (bb5 > 0) {
1557                         bs = pow5mult(bs, bb5);
1558                         bb1 = mult(bs, bb);
1559                         Bfree(bb);
1560                         bb = bb1;
1561                         }
1562                 if (bb2 > 0)
1563                         bb = lshift(bb, bb2);
1564                 if (bd5 > 0)
1565                         bd = pow5mult(bd, bd5);
1566                 if (bd2 > 0)
1567                         bd = lshift(bd, bd2);
1568                 if (bs2 > 0)
1569                         bs = lshift(bs, bs2);
1570                 delta = diff(bb, bd);
1571                 dsign = delta->sign;
1572                 delta->sign = 0;
1573                 i = cmp(delta, bs);
1574                 if (i < 0) {
1575                         /* Error is less than half an ulp -- check for
1576                          * special case of mantissa a power of two.
1577                          */
1578                         if (dsign || word1(rv) || word0(rv) & Bndry_mask)
1579                                 break;
1580                         delta = lshift(delta,Log2P);
1581                         if (cmp(delta, bs) > 0)
1582                                 goto drop_down;
1583                         break;
1584                         }
1585                 if (i == 0) {
1586                         /* exactly half-way between */
1587                         if (dsign) {
1588                                 if ((word0(rv) & Bndry_mask1) == Bndry_mask1
1589                                  &&  word1(rv) == 0xffffffff) {
1590                                         /*boundary case -- increment exponent*/
1591                                         word0(rv) = (word0(rv) & Exp_mask)
1592                                                 + Exp_msk1
1593 #ifdef IBM
1594                                                 | Exp_msk1 >> 4
1595 #endif
1596                                                 ;
1597                                         word1(rv) = 0;
1598                                         break;
1599                                         }
1600                                 }
1601                         else if (!(word0(rv) & Bndry_mask) && !word1(rv)) {
1602  drop_down:
1603                                 /* boundary case -- decrement exponent */
1604 #ifdef Sudden_Underflow
1605                                 L = word0(rv) & Exp_mask;
1606 #ifdef IBM
1607                                 if (L <  Exp_msk1)
1608 #else
1609                                 if (L <= Exp_msk1)
1610 #endif
1611                                         goto undfl;
1612                                 L -= Exp_msk1;
1613 #else
1614                                 L = (word0(rv) & Exp_mask) - Exp_msk1;
1615 #endif
1616                                 word0(rv) = L | Bndry_mask1;
1617                                 word1(rv) = 0xffffffff;
1618 #ifdef IBM
1619                                 goto cont;
1620 #else
1621                                 break;
1622 #endif
1623                                 }
1624 #ifndef ROUND_BIASED
1625                         if (!(word1(rv) & LSB))
1626                                 break;
1627 #endif
1628                         if (dsign)
1629                                 rv += ulp(rv);
1630 #ifndef ROUND_BIASED
1631                         else {
1632                                 rv -= ulp(rv);
1633 #ifndef Sudden_Underflow
1634                                 if (!rv)
1635                                         goto undfl;
1636 #endif
1637                                 }
1638 #endif
1639                         break;
1640                         }
1641                 if ((aadj = ratio(delta, bs)) <= 2.) {
1642                         if (dsign)
1643                                 aadj = aadj1 = 1.;
1644                         else if (word1(rv) || word0(rv) & Bndry_mask) {
1645 #ifndef Sudden_Underflow
1646                                 if (word1(rv) == Tiny1 && !word0(rv))
1647                                         goto undfl;
1648 #endif
1649                                 aadj = 1.;
1650                                 aadj1 = -1.;
1651                                 }
1652                         else {
1653                                 /* special case -- power of FLT_RADIX to be */
1654                                 /* rounded down... */
1655
1656                                 if (aadj < 2./FLT_RADIX)
1657                                         aadj = 1./FLT_RADIX;
1658                                 else
1659                                         aadj *= 0.5;
1660                                 aadj1 = -aadj;
1661                                 }
1662                         }
1663                 else {
1664                         aadj *= 0.5;
1665                         aadj1 = dsign ? aadj : -aadj;
1666 #ifdef Check_FLT_ROUNDS
1667                         switch(FLT_ROUNDS) {
1668                                 case 2: /* towards +infinity */
1669                                         aadj1 -= 0.5;
1670                                         break;
1671                                 case 0: /* towards 0 */
1672                                 case 3: /* towards -infinity */
1673                                         aadj1 += 0.5;
1674                                 }
1675 #else
1676                         if (FLT_ROUNDS == 0)
1677                                 aadj1 += 0.5;
1678 #endif
1679                         }
1680                 y = word0(rv) & Exp_mask;
1681
1682                 /* Check for overflow */
1683
1684                 if (y == Exp_msk1*(DBL_MAX_EXP+Bias-1)) {
1685                         rv0 = rv;
1686                         word0(rv) -= P*Exp_msk1;
1687                         adj = aadj1 * ulp(rv);
1688                         rv += adj;
1689                         if ((word0(rv) & Exp_mask) >=
1690                                         Exp_msk1*(DBL_MAX_EXP+Bias-P)) {
1691                                 if (word0(rv0) == Big0 && word1(rv0) == Big1)
1692                                         goto ovfl;
1693                                 word0(rv) = Big0;
1694                                 word1(rv) = Big1;
1695                                 goto cont;
1696                                 }
1697                         else
1698                                 word0(rv) += P*Exp_msk1;
1699                         }
1700                 else {
1701 #ifdef Sudden_Underflow
1702                         if ((word0(rv) & Exp_mask) <= P*Exp_msk1) {
1703                                 rv0 = rv;
1704                                 word0(rv) += P*Exp_msk1;
1705                                 adj = aadj1 * ulp(rv);
1706                                 rv += adj;
1707 #ifdef IBM
1708                                 if ((word0(rv) & Exp_mask) <  P*Exp_msk1)
1709 #else
1710                                 if ((word0(rv) & Exp_mask) <= P*Exp_msk1)
1711 #endif
1712                                         {
1713                                         if (word0(rv0) == Tiny0
1714                                          && word1(rv0) == Tiny1)
1715                                                 goto undfl;
1716                                         word0(rv) = Tiny0;
1717                                         word1(rv) = Tiny1;
1718                                         goto cont;
1719                                         }
1720                                 else
1721                                         word0(rv) -= P*Exp_msk1;
1722                                 }
1723                         else {
1724                                 adj = aadj1 * ulp(rv);
1725                                 rv += adj;
1726                                 }
1727 #else
1728                         /* Compute adj so that the IEEE rounding rules will
1729                          * correctly round rv + adj in some half-way cases.
1730                          * If rv * ulp(rv) is denormalized (i.e.,
1731                          * y <= (P-1)*Exp_msk1), we must adjust aadj to avoid
1732                          * trouble from bits lost to denormalization;
1733                          * example: 1.2e-307 .
1734                          */
1735                         if (y <= (P-1)*Exp_msk1 && aadj >= 1.) {
1736                                 aadj1 = (double)(int)(aadj + 0.5);
1737                                 if (!dsign)
1738                                         aadj1 = -aadj1;
1739                                 }
1740                         adj = aadj1 * ulp(rv);
1741                         rv += adj;
1742 #endif
1743                         }
1744                 z = word0(rv) & Exp_mask;
1745                 if (y == z) {
1746                         /* Can we stop now? */
1747                         L = aadj;
1748                         aadj -= L;
1749                         /* The tolerances below are conservative. */
1750                         if (dsign || word1(rv) || word0(rv) & Bndry_mask) {
1751                                 if (aadj < .4999999 || aadj > .5000001)
1752                                         break;
1753                                 }
1754                         else if (aadj < .4999999/FLT_RADIX)
1755                                 break;
1756                         }
1757  cont:
1758                 Bfree(bb);
1759                 Bfree(bd);
1760                 Bfree(bs);
1761                 Bfree(delta);
1762                 }
1763  retfree:
1764         Bfree(bb);
1765         Bfree(bd);
1766         Bfree(bs);
1767         Bfree(bd0);
1768         Bfree(delta);
1769  ret:
1770         if (se)
1771                 *se = (char *)s;
1772         return sign ? -rv : rv;
1773         }
1774
1775  static int
1776 quorem
1777 #ifdef KR_headers
1778         (b, S) Bigint *b, *S;
1779 #else
1780         (Bigint *b, Bigint *S)
1781 #endif
1782 {
1783         int n;
1784         Long borrow, y;
1785         ULong carry, q, ys;
1786         ULong *bx, *bxe, *sx, *sxe;
1787 #ifdef Pack_32
1788         Long z;
1789         ULong si, zs;
1790 #endif
1791
1792         n = S->wds;
1793 #ifdef DEBUG
1794         /*debug*/ if (b->wds > n)
1795         /*debug*/       Bug("oversize b in quorem");
1796 #endif
1797         if (b->wds < n)
1798                 return 0;
1799         sx = S->x;
1800         sxe = sx + --n;
1801         bx = b->x;
1802         bxe = bx + n;
1803         q = *bxe / (*sxe + 1);  /* ensure q <= true quotient */
1804 #ifdef DEBUG
1805         /*debug*/ if (q > 9)
1806         /*debug*/       Bug("oversized quotient in quorem");
1807 #endif
1808         if (q) {
1809                 borrow = 0;
1810                 carry = 0;
1811                 do {
1812 #ifdef Pack_32
1813                         si = *sx++;
1814                         ys = (si & 0xffff) * q + carry;
1815                         zs = (si >> 16) * q + (ys >> 16);
1816                         carry = zs >> 16;
1817                         y = (*bx & 0xffff) - (ys & 0xffff) + borrow;
1818                         borrow = y >> 16;
1819                         Sign_Extend(borrow, y);
1820                         z = (*bx >> 16) - (zs & 0xffff) + borrow;
1821                         borrow = z >> 16;
1822                         Sign_Extend(borrow, z);
1823                         Storeinc(bx, z, y);
1824 #else
1825                         ys = *sx++ * q + carry;
1826                         carry = ys >> 16;
1827                         y = *bx - (ys & 0xffff) + borrow;
1828                         borrow = y >> 16;
1829                         Sign_Extend(borrow, y);
1830                         *bx++ = y & 0xffff;
1831 #endif
1832                         }
1833                         while(sx <= sxe);
1834                 if (!*bxe) {
1835                         bx = b->x;
1836                         while(--bxe > bx && !*bxe)
1837                                 --n;
1838                         b->wds = n;
1839                         }
1840                 }
1841         if (cmp(b, S) >= 0) {
1842                 q++;
1843                 borrow = 0;
1844                 carry = 0;
1845                 bx = b->x;
1846                 sx = S->x;
1847                 do {
1848 #ifdef Pack_32
1849                         si = *sx++;
1850                         ys = (si & 0xffff) + carry;
1851                         zs = (si >> 16) + (ys >> 16);
1852                         carry = zs >> 16;
1853                         y = (*bx & 0xffff) - (ys & 0xffff) + borrow;
1854                         borrow = y >> 16;
1855                         Sign_Extend(borrow, y);
1856                         z = (*bx >> 16) - (zs & 0xffff) + borrow;
1857                         borrow = z >> 16;
1858                         Sign_Extend(borrow, z);
1859                         Storeinc(bx, z, y);
1860 #else
1861                         ys = *sx++ + carry;
1862                         carry = ys >> 16;
1863                         y = *bx - (ys & 0xffff) + borrow;
1864                         borrow = y >> 16;
1865                         Sign_Extend(borrow, y);
1866                         *bx++ = y & 0xffff;
1867 #endif
1868                         }
1869                         while(sx <= sxe);
1870                 bx = b->x;
1871                 bxe = bx + n;
1872                 if (!*bxe) {
1873                         while(--bxe > bx && !*bxe)
1874                                 --n;
1875                         b->wds = n;
1876                         }
1877                 }
1878         return q;
1879         }
1880
1881 /* dtoa for IEEE arithmetic (dmg): convert double to ASCII string.
1882  *
1883  * Inspired by "How to Print Floating-Point Numbers Accurately" by
1884  * Guy L. Steele, Jr. and Jon L. White [Proc. ACM SIGPLAN '90, pp. 92-101].
1885  *
1886  * Modifications:
1887  *      1. Rather than iterating, we use a simple numeric overestimate
1888  *         to determine k = floor(log10(d)).  We scale relevant
1889  *         quantities using O(log2(k)) rather than O(k) multiplications.
1890  *      2. For some modes > 2 (corresponding to ecvt and fcvt), we don't
1891  *         try to generate digits strictly left to right.  Instead, we
1892  *         compute with fewer bits and propagate the carry if necessary
1893  *         when rounding the final digit up.  This is often faster.
1894  *      3. Under the assumption that input will be rounded nearest,
1895  *         mode 0 renders 1e23 as 1e23 rather than 9.999999999999999e22.
1896  *         That is, we allow equality in stopping tests when the
1897  *         round-nearest rule will give the same floating-point value
1898  *         as would satisfaction of the stopping test with strict
1899  *         inequality.
1900  *      4. We remove common factors of powers of 2 from relevant
1901  *         quantities.
1902  *      5. When converting floating-point integers less than 1e16,
1903  *         we use floating-point arithmetic rather than resorting
1904  *         to multiple-precision integers.
1905  *      6. When asked to produce fewer than 15 digits, we first try
1906  *         to get by with floating-point arithmetic; we resort to
1907  *         multiple-precision integer arithmetic only if we cannot
1908  *         guarantee that the floating-point calculation has given
1909  *         the correctly rounded result.  For k requested digits and
1910  *         "uniformly" distributed input, the probability is
1911  *         something like 10^(k-15) that we must resort to the Long
1912  *         calculation.
1913  */
1914
1915  char *
1916 __dtoa
1917 #ifdef KR_headers
1918         (d, mode, ndigits, decpt, sign, rve)
1919         double d; int mode, ndigits, *decpt, *sign; char **rve, char **resultp;
1920 #else
1921         (double d, int mode, int ndigits, int *decpt, int *sign, char **rve, char **resultp)
1922 #endif
1923 {
1924  /*     Arguments ndigits, decpt, sign are similar to those
1925         of ecvt and fcvt; trailing zeros are suppressed from
1926         the returned string.  If not null, *rve is set to point
1927         to the end of the return value.  If d is +-Infinity or NaN,
1928         then *decpt is set to 9999.
1929
1930         mode:
1931                 0 ==> shortest string that yields d when read in
1932                         and rounded to nearest.
1933                 1 ==> like 0, but with Steele & White stopping rule;
1934                         e.g. with IEEE P754 arithmetic , mode 0 gives
1935                         1e23 whereas mode 1 gives 9.999999999999999e22.
1936                 2 ==> max(1,ndigits) significant digits.  This gives a
1937                         return value similar to that of ecvt, except
1938                         that trailing zeros are suppressed.
1939                 3 ==> through ndigits past the decimal point.  This
1940                         gives a return value similar to that from fcvt,
1941                         except that trailing zeros are suppressed, and
1942                         ndigits can be negative.
1943                 4-9 should give the same return values as 2-3, i.e.,
1944                         4 <= mode <= 9 ==> same return as mode
1945                         2 + (mode & 1).  These modes are mainly for
1946                         debugging; often they run slower but sometimes
1947                         faster than modes 2-3.
1948                 4,5,8,9 ==> left-to-right digit generation.
1949                 6-9 ==> don't try fast floating-point estimate
1950                         (if applicable).
1951
1952                 Values of mode other than 0-9 are treated as mode 0.
1953
1954                 Sufficient space is allocated to the return value
1955                 to hold the suppressed trailing zeros.
1956         */
1957
1958         int bbits, b2, b5, be, dig, i, ieps, ilim, ilim0, ilim1,
1959                 j, j1, k, k0, k_check, leftright, m2, m5, s2, s5,
1960                 spec_case, try_quick;
1961         Long L;
1962 #ifndef Sudden_Underflow
1963         int denorm;
1964         ULong x;
1965 #endif
1966         Bigint *b, *b1, *delta, *mlo, *mhi, *S;
1967         double d2, ds, eps;
1968         char *s, *s0;
1969
1970         if (word0(d) & Sign_bit) {
1971                 /* set sign for everything, including 0's and NaNs */
1972                 *sign = 1;
1973                 word0(d) &= ~Sign_bit;  /* clear sign bit */
1974                 }
1975         else
1976                 *sign = 0;
1977
1978 #if defined(IEEE_Arith) + defined(VAX)
1979 #ifdef IEEE_Arith
1980         if ((word0(d) & Exp_mask) == Exp_mask)
1981 #else
1982         if (word0(d)  == 0x8000)
1983 #endif
1984                 {
1985                 /* Infinity or NaN */
1986                 *decpt = 9999;
1987                 s =
1988 #ifdef IEEE_Arith
1989                         !word1(d) && !(word0(d) & 0xfffff) ? "Infinity" :
1990 #endif
1991                                 "NaN";
1992                 if (rve)
1993                         *rve =
1994 #ifdef IEEE_Arith
1995                                 s[3] ? s + 8 :
1996 #endif
1997                                                 s + 3;
1998                 return s;
1999                 }
2000 #endif
2001 #ifdef IBM
2002         d += 0; /* normalize */
2003 #endif
2004         if (!d) {
2005                 *decpt = 1;
2006                 s = "0";
2007                 if (rve)
2008                         *rve = s + 1;
2009                 return s;
2010                 }
2011
2012         b = d2b(d, &be, &bbits);
2013 #ifdef Sudden_Underflow
2014         i = (int)(word0(d) >> Exp_shift1 & (Exp_mask>>Exp_shift1));
2015 #else
2016         if (i = (int)(word0(d) >> Exp_shift1 & (Exp_mask>>Exp_shift1))) {
2017 #endif
2018                 d2 = d;
2019                 word0(d2) &= Frac_mask1;
2020                 word0(d2) |= Exp_11;
2021 #ifdef IBM
2022                 if (j = 11 - hi0bits(word0(d2) & Frac_mask))
2023                         d2 /= 1 << j;
2024 #endif
2025
2026                 /* log(x)       ~=~ log(1.5) + (x-1.5)/1.5
2027                  * log10(x)      =  log(x) / log(10)
2028                  *              ~=~ log(1.5)/log(10) + (x-1.5)/(1.5*log(10))
2029                  * log10(d) = (i-Bias)*log(2)/log(10) + log10(d2)
2030                  *
2031                  * This suggests computing an approximation k to log10(d) by
2032                  *
2033                  * k = (i - Bias)*0.301029995663981
2034                  *      + ( (d2-1.5)*0.289529654602168 + 0.176091259055681 );
2035                  *
2036                  * We want k to be too large rather than too small.
2037                  * The error in the first-order Taylor series approximation
2038                  * is in our favor, so we just round up the constant enough
2039                  * to compensate for any error in the multiplication of
2040                  * (i - Bias) by 0.301029995663981; since |i - Bias| <= 1077,
2041                  * and 1077 * 0.30103 * 2^-52 ~=~ 7.2e-14,
2042                  * adding 1e-13 to the constant term more than suffices.
2043                  * Hence we adjust the constant term to 0.1760912590558.
2044                  * (We could get a more accurate k by invoking log10,
2045                  *  but this is probably not worthwhile.)
2046                  */
2047
2048                 i -= Bias;
2049 #ifdef IBM
2050                 i <<= 2;
2051                 i += j;
2052 #endif
2053 #ifndef Sudden_Underflow
2054                 denorm = 0;
2055                 }
2056         else {
2057                 /* d is denormalized */
2058
2059                 i = bbits + be + (Bias + (P-1) - 1);
2060                 x = i > 32  ? word0(d) << 64 - i | word1(d) >> i - 32
2061                             : word1(d) << 32 - i;
2062                 d2 = x;
2063                 word0(d2) -= 31*Exp_msk1; /* adjust exponent */
2064                 i -= (Bias + (P-1) - 1) + 1;
2065                 denorm = 1;
2066                 }
2067 #endif
2068         ds = (d2-1.5)*0.289529654602168 + 0.1760912590558 + i*0.301029995663981;
2069         k = (int)ds;
2070         if (ds < 0. && ds != k)
2071                 k--;    /* want k = floor(ds) */
2072         k_check = 1;
2073         if (k >= 0 && k <= Ten_pmax) {
2074                 if (d < tens[k])
2075                         k--;
2076                 k_check = 0;
2077                 }
2078         j = bbits - i - 1;
2079         if (j >= 0) {
2080                 b2 = 0;
2081                 s2 = j;
2082                 }
2083         else {
2084                 b2 = -j;
2085                 s2 = 0;
2086                 }
2087         if (k >= 0) {
2088                 b5 = 0;
2089                 s5 = k;
2090                 s2 += k;
2091                 }
2092         else {
2093                 b2 -= k;
2094                 b5 = -k;
2095                 s5 = 0;
2096                 }
2097         if (mode < 0 || mode > 9)
2098                 mode = 0;
2099         try_quick = 1;
2100         if (mode > 5) {
2101                 mode -= 4;
2102                 try_quick = 0;
2103                 }
2104         leftright = 1;
2105         switch(mode) {
2106                 case 0:
2107                 case 1:
2108                         ilim = ilim1 = -1;
2109                         i = 18;
2110                         ndigits = 0;
2111                         break;
2112                 case 2:
2113                         leftright = 0;
2114                         /* no break */
2115                 case 4:
2116                         if (ndigits <= 0)
2117                                 ndigits = 1;
2118                         ilim = ilim1 = i = ndigits;
2119                         break;
2120                 case 3:
2121                         leftright = 0;
2122                         /* no break */
2123                 case 5:
2124                         i = ndigits + k + 1;
2125                         ilim = i;
2126                         ilim1 = i - 1;
2127                         if (i <= 0)
2128                                 i = 1;
2129                 }
2130         *resultp = (char *) malloc(i + 1);
2131         s = s0 = *resultp;
2132
2133         if (ilim >= 0 && ilim <= Quick_max && try_quick) {
2134
2135                 /* Try to get by with floating-point arithmetic. */
2136
2137                 i = 0;
2138                 d2 = d;
2139                 k0 = k;
2140                 ilim0 = ilim;
2141                 ieps = 2; /* conservative */
2142                 if (k > 0) {
2143                         ds = tens[k&0xf];
2144                         j = k >> 4;
2145                         if (j & Bletch) {
2146                                 /* prevent overflows */
2147                                 j &= Bletch - 1;
2148                                 d /= bigtens[n_bigtens-1];
2149                                 ieps++;
2150                                 }
2151                         for(; j; j >>= 1, i++)
2152                                 if (j & 1) {
2153                                         ieps++;
2154                                         ds *= bigtens[i];
2155                                         }
2156                         d /= ds;
2157                         }
2158                 else if (j1 = -k) {
2159                         d *= tens[j1 & 0xf];
2160                         for(j = j1 >> 4; j; j >>= 1, i++)
2161                                 if (j & 1) {
2162                                         ieps++;
2163                                         d *= bigtens[i];
2164                                         }
2165                         }
2166                 if (k_check && d < 1. && ilim > 0) {
2167                         if (ilim1 <= 0)
2168                                 goto fast_failed;
2169                         ilim = ilim1;
2170                         k--;
2171                         d *= 10.;
2172                         ieps++;
2173                         }
2174                 eps = ieps*d + 7.;
2175                 word0(eps) -= (P-1)*Exp_msk1;
2176                 if (ilim == 0) {
2177                         S = mhi = 0;
2178                         d -= 5.;
2179                         if (d > eps)
2180                                 goto one_digit;
2181                         if (d < -eps)
2182                                 goto no_digits;
2183                         goto fast_failed;
2184                         }
2185 #ifndef No_leftright
2186                 if (leftright) {
2187                         /* Use Steele & White method of only
2188                          * generating digits needed.
2189                          */
2190                         eps = 0.5/tens[ilim-1] - eps;
2191                         for(i = 0;;) {
2192                                 L = d;
2193                                 d -= L;
2194                                 *s++ = '0' + (int)L;
2195                                 if (d < eps)
2196                                         goto ret1;
2197                                 if (1. - d < eps)
2198                                         goto bump_up;
2199                                 if (++i >= ilim)
2200                                         break;
2201                                 eps *= 10.;
2202                                 d *= 10.;
2203                                 }
2204                         }
2205                 else {
2206 #endif
2207                         /* Generate ilim digits, then fix them up. */
2208                         eps *= tens[ilim-1];
2209                         for(i = 1;; i++, d *= 10.) {
2210                                 L = d;
2211                                 d -= L;
2212                                 *s++ = '0' + (int)L;
2213                                 if (i == ilim) {
2214                                         if (d > 0.5 + eps)
2215                                                 goto bump_up;
2216                                         else if (d < 0.5 - eps) {
2217                                                 while(*--s == '0');
2218                                                 s++;
2219                                                 goto ret1;
2220                                                 }
2221                                         break;
2222                                         }
2223                                 }
2224 #ifndef No_leftright
2225                         }
2226 #endif
2227  fast_failed:
2228                 s = s0;
2229                 d = d2;
2230                 k = k0;
2231                 ilim = ilim0;
2232                 }
2233
2234         /* Do we have a "small" integer? */
2235
2236         if (be >= 0 && k <= Int_max) {
2237                 /* Yes. */
2238                 ds = tens[k];
2239                 if (ndigits < 0 && ilim <= 0) {
2240                         S = mhi = 0;
2241                         if (ilim < 0 || d <= 5*ds)
2242                                 goto no_digits;
2243                         goto one_digit;
2244                         }
2245                 for(i = 1;; i++) {
2246                         L = d / ds;
2247                         d -= L*ds;
2248 #ifdef Check_FLT_ROUNDS
2249                         /* If FLT_ROUNDS == 2, L will usually be high by 1 */
2250                         if (d < 0) {
2251                                 L--;
2252                                 d += ds;
2253                                 }
2254 #endif
2255                         *s++ = '0' + (int)L;
2256                         if (i == ilim) {
2257                                 d += d;
2258                                 if (d > ds || d == ds && L & 1) {
2259  bump_up:
2260                                         while(*--s == '9')
2261                                                 if (s == s0) {
2262                                                         k++;
2263                                                         *s = '0';
2264                                                         break;
2265                                                         }
2266                                         ++*s++;
2267                                         }
2268                                 break;
2269                                 }
2270                         if (!(d *= 10.))
2271                                 break;
2272                         }
2273                 goto ret1;
2274                 }
2275
2276         m2 = b2;
2277         m5 = b5;
2278         mhi = mlo = 0;
2279         if (leftright) {
2280                 if (mode < 2) {
2281                         i =
2282 #ifndef Sudden_Underflow
2283                                 denorm ? be + (Bias + (P-1) - 1 + 1) :
2284 #endif
2285 #ifdef IBM
2286                                 1 + 4*P - 3 - bbits + ((bbits + be - 1) & 3);
2287 #else
2288                                 1 + P - bbits;
2289 #endif
2290                         }
2291                 else {
2292                         j = ilim - 1;
2293                         if (m5 >= j)
2294                                 m5 -= j;
2295                         else {
2296                                 s5 += j -= m5;
2297                                 b5 += j;
2298                                 m5 = 0;
2299                                 }
2300                         if ((i = ilim) < 0) {
2301                                 m2 -= i;
2302                                 i = 0;
2303                                 }
2304                         }
2305                 b2 += i;
2306                 s2 += i;
2307                 mhi = i2b(1);
2308                 }
2309         if (m2 > 0 && s2 > 0) {
2310                 i = m2 < s2 ? m2 : s2;
2311                 b2 -= i;
2312                 m2 -= i;
2313                 s2 -= i;
2314                 }
2315         if (b5 > 0) {
2316                 if (leftright) {
2317                         if (m5 > 0) {
2318                                 mhi = pow5mult(mhi, m5);
2319                                 b1 = mult(mhi, b);
2320                                 Bfree(b);
2321                                 b = b1;
2322                                 }
2323                         if (j = b5 - m5)
2324                                 b = pow5mult(b, j);
2325                         }
2326                 else
2327                         b = pow5mult(b, b5);
2328                 }
2329         S = i2b(1);
2330         if (s5 > 0)
2331                 S = pow5mult(S, s5);
2332
2333         /* Check for special case that d is a normalized power of 2. */
2334
2335         if (mode < 2) {
2336                 if (!word1(d) && !(word0(d) & Bndry_mask)
2337 #ifndef Sudden_Underflow
2338                  && word0(d) & Exp_mask
2339 #endif
2340                                 ) {
2341                         /* The special case */
2342                         b2 += Log2P;
2343                         s2 += Log2P;
2344                         spec_case = 1;
2345                         }
2346                 else
2347                         spec_case = 0;
2348                 }
2349
2350         /* Arrange for convenient computation of quotients:
2351          * shift left if necessary so divisor has 4 leading 0 bits.
2352          *
2353          * Perhaps we should just compute leading 28 bits of S once
2354          * and for all and pass them and a shift to quorem, so it
2355          * can do shifts and ors to compute the numerator for q.
2356          */
2357 #ifdef Pack_32
2358         if (i = ((s5 ? 32 - hi0bits(S->x[S->wds-1]) : 1) + s2) & 0x1f)
2359                 i = 32 - i;
2360 #else
2361         if (i = ((s5 ? 32 - hi0bits(S->x[S->wds-1]) : 1) + s2) & 0xf)
2362                 i = 16 - i;
2363 #endif
2364         if (i > 4) {
2365                 i -= 4;
2366                 b2 += i;
2367                 m2 += i;
2368                 s2 += i;
2369                 }
2370         else if (i < 4) {
2371                 i += 28;
2372                 b2 += i;
2373                 m2 += i;
2374                 s2 += i;
2375                 }
2376         if (b2 > 0)
2377                 b = lshift(b, b2);
2378         if (s2 > 0)
2379                 S = lshift(S, s2);
2380         if (k_check) {
2381                 if (cmp(b,S) < 0) {
2382                         k--;
2383                         b = multadd(b, 10, 0);  /* we botched the k estimate */
2384                         if (leftright)
2385                                 mhi = multadd(mhi, 10, 0);
2386                         ilim = ilim1;
2387                         }
2388                 }
2389         if (ilim <= 0 && mode > 2) {
2390                 if (ilim < 0 || cmp(b,S = multadd(S,5,0)) <= 0) {
2391                         /* no digits, fcvt style */
2392  no_digits:
2393                         k = -1 - ndigits;
2394                         goto ret;
2395                         }
2396  one_digit:
2397                 *s++ = '1';
2398                 k++;
2399                 goto ret;
2400                 }
2401         if (leftright) {
2402                 if (m2 > 0)
2403                         mhi = lshift(mhi, m2);
2404
2405                 /* Compute mlo -- check for special case
2406                  * that d is a normalized power of 2.
2407                  */
2408
2409                 mlo = mhi;
2410                 if (spec_case) {
2411                         mhi = Balloc(mhi->k);
2412                         Bcopy(mhi, mlo);
2413                         mhi = lshift(mhi, Log2P);
2414                         }
2415
2416                 for(i = 1;;i++) {
2417                         dig = quorem(b,S) + '0';
2418                         /* Do we yet have the shortest decimal string
2419                          * that will round to d?
2420                          */
2421                         j = cmp(b, mlo);
2422                         delta = diff(S, mhi);
2423                         j1 = delta->sign ? 1 : cmp(b, delta);
2424                         Bfree(delta);
2425 #ifndef ROUND_BIASED
2426                         if (j1 == 0 && !mode && !(word1(d) & 1)) {
2427                                 if (dig == '9')
2428                                         goto round_9_up;
2429                                 if (j > 0)
2430                                         dig++;
2431                                 *s++ = dig;
2432                                 goto ret;
2433                                 }
2434 #endif
2435                         if (j < 0 || j == 0 && !mode
2436 #ifndef ROUND_BIASED
2437                                                         && !(word1(d) & 1)
2438 #endif
2439                                         ) {
2440                                 if (j1 > 0) {
2441                                         b = lshift(b, 1);
2442                                         j1 = cmp(b, S);
2443                                         if ((j1 > 0 || j1 == 0 && dig & 1)
2444                                         && dig++ == '9')
2445                                                 goto round_9_up;
2446                                         }
2447                                 *s++ = dig;
2448                                 goto ret;
2449                                 }
2450                         if (j1 > 0) {
2451                                 if (dig == '9') { /* possible if i == 1 */
2452  round_9_up:
2453                                         *s++ = '9';
2454                                         goto roundoff;
2455                                         }
2456                                 *s++ = dig + 1;
2457                                 goto ret;
2458                                 }
2459                         *s++ = dig;
2460                         if (i == ilim)
2461                                 break;
2462                         b = multadd(b, 10, 0);
2463                         if (mlo == mhi)
2464                                 mlo = mhi = multadd(mhi, 10, 0);
2465                         else {
2466                                 mlo = multadd(mlo, 10, 0);
2467                                 mhi = multadd(mhi, 10, 0);
2468                                 }
2469                         }
2470                 }
2471         else
2472                 for(i = 1;; i++) {
2473                         *s++ = dig = quorem(b,S) + '0';
2474                         if (i >= ilim)
2475                                 break;
2476                         b = multadd(b, 10, 0);
2477                         }
2478
2479         /* Round off last digit */
2480
2481         b = lshift(b, 1);
2482         j = cmp(b, S);
2483         if (j > 0 || j == 0 && dig & 1) {
2484  roundoff:
2485                 while(*--s == '9')
2486                         if (s == s0) {
2487                                 k++;
2488                                 *s++ = '1';
2489                                 goto ret;
2490                                 }
2491                 ++*s++;
2492                 }
2493         else {
2494                 while(*--s == '0');
2495                 s++;
2496                 }
2497  ret:
2498         Bfree(S);
2499         if (mhi) {
2500                 if (mlo && mlo != mhi)
2501                         Bfree(mlo);
2502                 Bfree(mhi);
2503                 }
2504  ret1:
2505         Bfree(b);
2506         if (s == s0) {                          /* don't return empty string */
2507                 *s++ = '0';
2508                 k = 0;
2509         }
2510         *s = 0;
2511         *decpt = k + 1;
2512         if (rve)
2513                 *rve = s;
2514         return s0;
2515         }
2516 #ifdef __cplusplus
2517 }
2518 #endif