1*86d7f5d3SJohn Marino /****************************************************************
2*86d7f5d3SJohn Marino
3*86d7f5d3SJohn Marino The author of this software is David M. Gay.
4*86d7f5d3SJohn Marino
5*86d7f5d3SJohn Marino Copyright (C) 1998 by Lucent Technologies
6*86d7f5d3SJohn Marino All Rights Reserved
7*86d7f5d3SJohn Marino
8*86d7f5d3SJohn Marino Permission to use, copy, modify, and distribute this software and
9*86d7f5d3SJohn Marino its documentation for any purpose and without fee is hereby
10*86d7f5d3SJohn Marino granted, provided that the above copyright notice appear in all
11*86d7f5d3SJohn Marino copies and that both that the copyright notice and this
12*86d7f5d3SJohn Marino permission notice and warranty disclaimer appear in supporting
13*86d7f5d3SJohn Marino documentation, and that the name of Lucent or any of its entities
14*86d7f5d3SJohn Marino not be used in advertising or publicity pertaining to
15*86d7f5d3SJohn Marino distribution of the software without specific, written prior
16*86d7f5d3SJohn Marino permission.
17*86d7f5d3SJohn Marino
18*86d7f5d3SJohn Marino LUCENT DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE,
19*86d7f5d3SJohn Marino INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS.
20*86d7f5d3SJohn Marino IN NO EVENT SHALL LUCENT OR ANY OF ITS ENTITIES BE LIABLE FOR ANY
21*86d7f5d3SJohn Marino SPECIAL, INDIRECT OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
22*86d7f5d3SJohn Marino WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER
23*86d7f5d3SJohn Marino IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION,
24*86d7f5d3SJohn Marino ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF
25*86d7f5d3SJohn Marino THIS SOFTWARE.
26*86d7f5d3SJohn Marino
27*86d7f5d3SJohn Marino ****************************************************************/
28*86d7f5d3SJohn Marino
29*86d7f5d3SJohn Marino /* Please send bug reports to David M. Gay (dmg at acm dot org,
30*86d7f5d3SJohn Marino * with " at " changed at "@" and " dot " changed to "."). */
31*86d7f5d3SJohn Marino
32*86d7f5d3SJohn Marino #include "gdtoaimp.h"
33*86d7f5d3SJohn Marino
34*86d7f5d3SJohn Marino #ifndef MULTIPLE_THREADS
35*86d7f5d3SJohn Marino char *dtoa_result;
36*86d7f5d3SJohn Marino #endif
37*86d7f5d3SJohn Marino
38*86d7f5d3SJohn Marino char *
39*86d7f5d3SJohn Marino #ifdef KR_headers
rv_alloc(i)40*86d7f5d3SJohn Marino rv_alloc(i) int i;
41*86d7f5d3SJohn Marino #else
42*86d7f5d3SJohn Marino rv_alloc(int i)
43*86d7f5d3SJohn Marino #endif
44*86d7f5d3SJohn Marino {
45*86d7f5d3SJohn Marino int j, k, *r;
46*86d7f5d3SJohn Marino
47*86d7f5d3SJohn Marino j = sizeof(ULong);
48*86d7f5d3SJohn Marino for(k = 0;
49*86d7f5d3SJohn Marino sizeof(Bigint) - sizeof(ULong) - sizeof(int) + j <= i;
50*86d7f5d3SJohn Marino j <<= 1)
51*86d7f5d3SJohn Marino k++;
52*86d7f5d3SJohn Marino r = (int*)Balloc(k);
53*86d7f5d3SJohn Marino *r = k;
54*86d7f5d3SJohn Marino return
55*86d7f5d3SJohn Marino #ifndef MULTIPLE_THREADS
56*86d7f5d3SJohn Marino dtoa_result =
57*86d7f5d3SJohn Marino #endif
58*86d7f5d3SJohn Marino (char *)(r+1);
59*86d7f5d3SJohn Marino }
60*86d7f5d3SJohn Marino
61*86d7f5d3SJohn Marino char *
62*86d7f5d3SJohn Marino #ifdef KR_headers
nrv_alloc(s,rve,n)63*86d7f5d3SJohn Marino nrv_alloc(s, rve, n) char *s, **rve; int n;
64*86d7f5d3SJohn Marino #else
65*86d7f5d3SJohn Marino nrv_alloc(char *s, char **rve, int n)
66*86d7f5d3SJohn Marino #endif
67*86d7f5d3SJohn Marino {
68*86d7f5d3SJohn Marino char *rv, *t;
69*86d7f5d3SJohn Marino
70*86d7f5d3SJohn Marino t = rv = rv_alloc(n);
71*86d7f5d3SJohn Marino while((*t = *s++) !=0)
72*86d7f5d3SJohn Marino t++;
73*86d7f5d3SJohn Marino if (rve)
74*86d7f5d3SJohn Marino *rve = t;
75*86d7f5d3SJohn Marino return rv;
76*86d7f5d3SJohn Marino }
77*86d7f5d3SJohn Marino
78*86d7f5d3SJohn Marino /* freedtoa(s) must be used to free values s returned by dtoa
79*86d7f5d3SJohn Marino * when MULTIPLE_THREADS is #defined. It should be used in all cases,
80*86d7f5d3SJohn Marino * but for consistency with earlier versions of dtoa, it is optional
81*86d7f5d3SJohn Marino * when MULTIPLE_THREADS is not defined.
82*86d7f5d3SJohn Marino */
83*86d7f5d3SJohn Marino
84*86d7f5d3SJohn Marino void
85*86d7f5d3SJohn Marino #ifdef KR_headers
freedtoa(s)86*86d7f5d3SJohn Marino freedtoa(s) char *s;
87*86d7f5d3SJohn Marino #else
88*86d7f5d3SJohn Marino freedtoa(char *s)
89*86d7f5d3SJohn Marino #endif
90*86d7f5d3SJohn Marino {
91*86d7f5d3SJohn Marino Bigint *b = (Bigint *)((int *)s - 1);
92*86d7f5d3SJohn Marino b->maxwds = 1 << (b->k = *(int*)b);
93*86d7f5d3SJohn Marino Bfree(b);
94*86d7f5d3SJohn Marino #ifndef MULTIPLE_THREADS
95*86d7f5d3SJohn Marino if (s == dtoa_result)
96*86d7f5d3SJohn Marino dtoa_result = 0;
97*86d7f5d3SJohn Marino #endif
98*86d7f5d3SJohn Marino }
99*86d7f5d3SJohn Marino
100*86d7f5d3SJohn Marino int
quorem(b,S)101*86d7f5d3SJohn Marino quorem
102*86d7f5d3SJohn Marino #ifdef KR_headers
103*86d7f5d3SJohn Marino (b, S) Bigint *b, *S;
104*86d7f5d3SJohn Marino #else
105*86d7f5d3SJohn Marino (Bigint *b, Bigint *S)
106*86d7f5d3SJohn Marino #endif
107*86d7f5d3SJohn Marino {
108*86d7f5d3SJohn Marino int n;
109*86d7f5d3SJohn Marino ULong *bx, *bxe, q, *sx, *sxe;
110*86d7f5d3SJohn Marino #ifdef ULLong
111*86d7f5d3SJohn Marino ULLong borrow, carry, y, ys;
112*86d7f5d3SJohn Marino #else
113*86d7f5d3SJohn Marino ULong borrow, carry, y, ys;
114*86d7f5d3SJohn Marino #ifdef Pack_32
115*86d7f5d3SJohn Marino ULong si, z, zs;
116*86d7f5d3SJohn Marino #endif
117*86d7f5d3SJohn Marino #endif
118*86d7f5d3SJohn Marino
119*86d7f5d3SJohn Marino n = S->wds;
120*86d7f5d3SJohn Marino #ifdef DEBUG
121*86d7f5d3SJohn Marino /*debug*/ if (b->wds > n)
122*86d7f5d3SJohn Marino /*debug*/ Bug("oversize b in quorem");
123*86d7f5d3SJohn Marino #endif
124*86d7f5d3SJohn Marino if (b->wds < n)
125*86d7f5d3SJohn Marino return 0;
126*86d7f5d3SJohn Marino sx = S->x;
127*86d7f5d3SJohn Marino sxe = sx + --n;
128*86d7f5d3SJohn Marino bx = b->x;
129*86d7f5d3SJohn Marino bxe = bx + n;
130*86d7f5d3SJohn Marino q = *bxe / (*sxe + 1); /* ensure q <= true quotient */
131*86d7f5d3SJohn Marino #ifdef DEBUG
132*86d7f5d3SJohn Marino /*debug*/ if (q > 9)
133*86d7f5d3SJohn Marino /*debug*/ Bug("oversized quotient in quorem");
134*86d7f5d3SJohn Marino #endif
135*86d7f5d3SJohn Marino if (q) {
136*86d7f5d3SJohn Marino borrow = 0;
137*86d7f5d3SJohn Marino carry = 0;
138*86d7f5d3SJohn Marino do {
139*86d7f5d3SJohn Marino #ifdef ULLong
140*86d7f5d3SJohn Marino ys = *sx++ * (ULLong)q + carry;
141*86d7f5d3SJohn Marino carry = ys >> 32;
142*86d7f5d3SJohn Marino y = *bx - (ys & 0xffffffffUL) - borrow;
143*86d7f5d3SJohn Marino borrow = y >> 32 & 1UL;
144*86d7f5d3SJohn Marino *bx++ = y & 0xffffffffUL;
145*86d7f5d3SJohn Marino #else
146*86d7f5d3SJohn Marino #ifdef Pack_32
147*86d7f5d3SJohn Marino si = *sx++;
148*86d7f5d3SJohn Marino ys = (si & 0xffff) * q + carry;
149*86d7f5d3SJohn Marino zs = (si >> 16) * q + (ys >> 16);
150*86d7f5d3SJohn Marino carry = zs >> 16;
151*86d7f5d3SJohn Marino y = (*bx & 0xffff) - (ys & 0xffff) - borrow;
152*86d7f5d3SJohn Marino borrow = (y & 0x10000) >> 16;
153*86d7f5d3SJohn Marino z = (*bx >> 16) - (zs & 0xffff) - borrow;
154*86d7f5d3SJohn Marino borrow = (z & 0x10000) >> 16;
155*86d7f5d3SJohn Marino Storeinc(bx, z, y);
156*86d7f5d3SJohn Marino #else
157*86d7f5d3SJohn Marino ys = *sx++ * q + carry;
158*86d7f5d3SJohn Marino carry = ys >> 16;
159*86d7f5d3SJohn Marino y = *bx - (ys & 0xffff) - borrow;
160*86d7f5d3SJohn Marino borrow = (y & 0x10000) >> 16;
161*86d7f5d3SJohn Marino *bx++ = y & 0xffff;
162*86d7f5d3SJohn Marino #endif
163*86d7f5d3SJohn Marino #endif
164*86d7f5d3SJohn Marino }
165*86d7f5d3SJohn Marino while(sx <= sxe);
166*86d7f5d3SJohn Marino if (!*bxe) {
167*86d7f5d3SJohn Marino bx = b->x;
168*86d7f5d3SJohn Marino while(--bxe > bx && !*bxe)
169*86d7f5d3SJohn Marino --n;
170*86d7f5d3SJohn Marino b->wds = n;
171*86d7f5d3SJohn Marino }
172*86d7f5d3SJohn Marino }
173*86d7f5d3SJohn Marino if (cmp(b, S) >= 0) {
174*86d7f5d3SJohn Marino q++;
175*86d7f5d3SJohn Marino borrow = 0;
176*86d7f5d3SJohn Marino carry = 0;
177*86d7f5d3SJohn Marino bx = b->x;
178*86d7f5d3SJohn Marino sx = S->x;
179*86d7f5d3SJohn Marino do {
180*86d7f5d3SJohn Marino #ifdef ULLong
181*86d7f5d3SJohn Marino ys = *sx++ + carry;
182*86d7f5d3SJohn Marino carry = ys >> 32;
183*86d7f5d3SJohn Marino y = *bx - (ys & 0xffffffffUL) - borrow;
184*86d7f5d3SJohn Marino borrow = y >> 32 & 1UL;
185*86d7f5d3SJohn Marino *bx++ = y & 0xffffffffUL;
186*86d7f5d3SJohn Marino #else
187*86d7f5d3SJohn Marino #ifdef Pack_32
188*86d7f5d3SJohn Marino si = *sx++;
189*86d7f5d3SJohn Marino ys = (si & 0xffff) + carry;
190*86d7f5d3SJohn Marino zs = (si >> 16) + (ys >> 16);
191*86d7f5d3SJohn Marino carry = zs >> 16;
192*86d7f5d3SJohn Marino y = (*bx & 0xffff) - (ys & 0xffff) - borrow;
193*86d7f5d3SJohn Marino borrow = (y & 0x10000) >> 16;
194*86d7f5d3SJohn Marino z = (*bx >> 16) - (zs & 0xffff) - borrow;
195*86d7f5d3SJohn Marino borrow = (z & 0x10000) >> 16;
196*86d7f5d3SJohn Marino Storeinc(bx, z, y);
197*86d7f5d3SJohn Marino #else
198*86d7f5d3SJohn Marino ys = *sx++ + carry;
199*86d7f5d3SJohn Marino carry = ys >> 16;
200*86d7f5d3SJohn Marino y = *bx - (ys & 0xffff) - borrow;
201*86d7f5d3SJohn Marino borrow = (y & 0x10000) >> 16;
202*86d7f5d3SJohn Marino *bx++ = y & 0xffff;
203*86d7f5d3SJohn Marino #endif
204*86d7f5d3SJohn Marino #endif
205*86d7f5d3SJohn Marino }
206*86d7f5d3SJohn Marino while(sx <= sxe);
207*86d7f5d3SJohn Marino bx = b->x;
208*86d7f5d3SJohn Marino bxe = bx + n;
209*86d7f5d3SJohn Marino if (!*bxe) {
210*86d7f5d3SJohn Marino while(--bxe > bx && !*bxe)
211*86d7f5d3SJohn Marino --n;
212*86d7f5d3SJohn Marino b->wds = n;
213*86d7f5d3SJohn Marino }
214*86d7f5d3SJohn Marino }
215*86d7f5d3SJohn Marino return q;
216*86d7f5d3SJohn Marino }
217