1112158Sdas/**************************************************************** 2112158Sdas 3112158SdasThe author of this software is David M. Gay. 4112158Sdas 5112158SdasCopyright (C) 1998, 2000 by Lucent Technologies 6112158SdasAll Rights Reserved 7112158Sdas 8112158SdasPermission to use, copy, modify, and distribute this software and 9112158Sdasits documentation for any purpose and without fee is hereby 10112158Sdasgranted, provided that the above copyright notice appear in all 11112158Sdascopies and that both that the copyright notice and this 12112158Sdaspermission notice and warranty disclaimer appear in supporting 13112158Sdasdocumentation, and that the name of Lucent or any of its entities 14112158Sdasnot be used in advertising or publicity pertaining to 15112158Sdasdistribution of the software without specific, written prior 16112158Sdaspermission. 17112158Sdas 18112158SdasLUCENT DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE, 19112158SdasINCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS. 20112158SdasIN NO EVENT SHALL LUCENT OR ANY OF ITS ENTITIES BE LIABLE FOR ANY 21112158SdasSPECIAL, INDIRECT OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES 22112158SdasWHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER 23112158SdasIN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, 24112158SdasARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF 25112158SdasTHIS SOFTWARE. 26112158Sdas 27112158Sdas****************************************************************/ 28112158Sdas 29165743Sdas/* Please send bug reports to David M. Gay (dmg at acm dot org, 30165743Sdas * with " at " changed at "@" and " dot " changed to "."). */ 31112158Sdas 32112158Sdas#include "gdtoaimp.h" 33112158Sdas 34112158Sdas int 35112158Sdas#ifdef KR_headers 36112158Sdasstrtopdd(s, sp, dd) CONST char *s; char **sp; double *dd; 37112158Sdas#else 38112158Sdasstrtopdd(CONST char *s, char **sp, double *dd) 39112158Sdas#endif 40112158Sdas{ 41112158Sdas#ifdef Sudden_Underflow 42187808Sdas static FPI fpi0 = { 106, 1-1023, 2046-1023-106+1, 1, 1 }; 43112158Sdas#else 44187808Sdas static FPI fpi0 = { 106, 1-1023-53+1, 2046-1023-106+1, 1, 0 }; 45112158Sdas#endif 46112158Sdas ULong bits[4]; 47112158Sdas Long exp; 48112158Sdas int i, j, rv; 49112158Sdas typedef union { 50112158Sdas double d[2]; 51112158Sdas ULong L[4]; 52112158Sdas } U; 53112158Sdas U *u; 54187808Sdas#ifdef Honor_FLT_ROUNDS 55187808Sdas#include "gdtoa_fltrnds.h" 56187808Sdas#else 57187808Sdas#define fpi &fpi0 58187808Sdas#endif 59112158Sdas 60187808Sdas rv = strtodg(s, sp, fpi, &exp, bits); 61112158Sdas u = (U*)dd; 62112158Sdas switch(rv & STRTOG_Retmask) { 63112158Sdas case STRTOG_NoNumber: 64112158Sdas case STRTOG_Zero: 65112158Sdas u->d[0] = u->d[1] = 0.; 66112158Sdas break; 67112158Sdas 68112158Sdas case STRTOG_Normal: 69112158Sdas u->L[_1] = (bits[1] >> 21 | bits[2] << 11) & 0xffffffffL; 70219557Sdas u->L[_0] = (bits[2] >> 21) | ((bits[3] << 11) & 0xfffff) 71219557Sdas | ((exp + 0x3ff + 105) << 20); 72112158Sdas exp += 0x3ff + 52; 73112158Sdas if (bits[1] &= 0x1fffff) { 74112158Sdas i = hi0bits(bits[1]) - 11; 75112158Sdas if (i >= exp) { 76112158Sdas i = exp - 1; 77112158Sdas exp = 0; 78112158Sdas } 79112158Sdas else 80112158Sdas exp -= i; 81112158Sdas if (i > 0) { 82219557Sdas bits[1] = bits[1] << i | bits[0] >> (32-i); 83112158Sdas bits[0] = bits[0] << i & 0xffffffffL; 84112158Sdas } 85112158Sdas } 86112158Sdas else if (bits[0]) { 87112158Sdas i = hi0bits(bits[0]) + 21; 88112158Sdas if (i >= exp) { 89112158Sdas i = exp - 1; 90112158Sdas exp = 0; 91112158Sdas } 92112158Sdas else 93112158Sdas exp -= i; 94112158Sdas if (i < 32) { 95219557Sdas bits[1] = bits[0] >> (32 - i); 96112158Sdas bits[0] = bits[0] << i & 0xffffffffL; 97112158Sdas } 98112158Sdas else { 99219557Sdas bits[1] = bits[0] << (i - 32); 100112158Sdas bits[0] = 0; 101112158Sdas } 102112158Sdas } 103112158Sdas else { 104112158Sdas u->L[2] = u->L[3] = 0; 105112158Sdas break; 106112158Sdas } 107112158Sdas u->L[2+_1] = bits[0]; 108219557Sdas u->L[2+_0] = (bits[1] & 0xfffff) | (exp << 20); 109112158Sdas break; 110112158Sdas 111112158Sdas case STRTOG_Denormal: 112112158Sdas if (bits[3]) 113112158Sdas goto nearly_normal; 114112158Sdas if (bits[2]) 115112158Sdas goto partly_normal; 116112158Sdas if (bits[1] & 0xffe00000) 117112158Sdas goto hardly_normal; 118112158Sdas /* completely denormal */ 119112158Sdas u->L[2] = u->L[3] = 0; 120112158Sdas u->L[_1] = bits[0]; 121112158Sdas u->L[_0] = bits[1]; 122112158Sdas break; 123112158Sdas 124112158Sdas nearly_normal: 125112158Sdas i = hi0bits(bits[3]) - 11; /* i >= 12 */ 126112158Sdas j = 32 - i; 127219557Sdas u->L[_0] = ((bits[3] << i | bits[2] >> j) & 0xfffff) 128219557Sdas | ((65 - i) << 20); 129112158Sdas u->L[_1] = (bits[2] << i | bits[1] >> j) & 0xffffffffL; 130219557Sdas u->L[2+_0] = bits[1] & ((1L << j) - 1); 131112158Sdas u->L[2+_1] = bits[0]; 132112158Sdas break; 133112158Sdas 134112158Sdas partly_normal: 135112158Sdas i = hi0bits(bits[2]) - 11; 136112158Sdas if (i < 0) { 137112158Sdas j = -i; 138112158Sdas i += 32; 139219557Sdas u->L[_0] = (bits[2] >> j & 0xfffff) | (33 + j) << 20; 140219557Sdas u->L[_1] = ((bits[2] << i) | (bits[1] >> j)) & 0xffffffffL; 141219557Sdas u->L[2+_0] = bits[1] & ((1L << j) - 1); 142112158Sdas u->L[2+_1] = bits[0]; 143112158Sdas break; 144112158Sdas } 145112158Sdas if (i == 0) { 146219557Sdas u->L[_0] = (bits[2] & 0xfffff) | (33 << 20); 147112158Sdas u->L[_1] = bits[1]; 148112158Sdas u->L[2+_0] = 0; 149112158Sdas u->L[2+_1] = bits[0]; 150112158Sdas break; 151112158Sdas } 152112158Sdas j = 32 - i; 153219557Sdas u->L[_0] = (((bits[2] << i) | (bits[1] >> j)) & 0xfffff) 154219557Sdas | ((j + 1) << 20); 155112158Sdas u->L[_1] = (bits[1] << i | bits[0] >> j) & 0xffffffffL; 156112158Sdas u->L[2+_0] = 0; 157219557Sdas u->L[2+_1] = bits[0] & ((1L << j) - 1); 158112158Sdas break; 159112158Sdas 160112158Sdas hardly_normal: 161112158Sdas j = 11 - hi0bits(bits[1]); 162112158Sdas i = 32 - j; 163219557Sdas u->L[_0] = (bits[1] >> j & 0xfffff) | ((j + 1) << 20); 164112158Sdas u->L[_1] = (bits[1] << i | bits[0] >> j) & 0xffffffffL; 165112158Sdas u->L[2+_0] = 0; 166219557Sdas u->L[2+_1] = bits[0] & ((1L << j) - 1); 167112158Sdas break; 168112158Sdas 169112158Sdas case STRTOG_Infinite: 170112158Sdas u->L[_0] = u->L[2+_0] = 0x7ff00000; 171112158Sdas u->L[_1] = u->L[2+_1] = 0; 172112158Sdas break; 173112158Sdas 174112158Sdas case STRTOG_NaN: 175165743Sdas u->L[0] = u->L[2] = d_QNAN0; 176165743Sdas u->L[1] = u->L[3] = d_QNAN1; 177112158Sdas } 178112158Sdas if (rv & STRTOG_Neg) { 179112158Sdas u->L[ _0] |= 0x80000000L; 180112158Sdas u->L[2+_0] |= 0x80000000L; 181112158Sdas } 182112158Sdas return rv; 183112158Sdas } 184