]>
git.proxmox.com Git - mirror_edk2.git/blob - StdLib/LibC/gdtoa/gethex.c
1 /* $NetBSD: gethex.c,v 1.3.14.1 2008/04/08 21:10:55 jdc Exp $ */
3 /****************************************************************
5 The author of this software is David M. Gay.
7 Copyright (C) 1998 by Lucent Technologies
10 Permission to use, copy, modify, and distribute this software and
11 its documentation for any purpose and without fee is hereby
12 granted, provided that the above copyright notice appear in all
13 copies and that both that the copyright notice and this
14 permission notice and warranty disclaimer appear in supporting
15 documentation, and that the name of Lucent or any of its entities
16 not be used in advertising or publicity pertaining to
17 distribution of the software without specific, written prior
20 LUCENT DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE,
21 INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS.
22 IN NO EVENT SHALL LUCENT OR ANY OF ITS ENTITIES BE LIABLE FOR ANY
23 SPECIAL, INDIRECT OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
24 WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER
25 IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION,
26 ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF
29 ****************************************************************/
31 /* Please send bug reports to David M. Gay (dmg at acm dot org,
32 * with " at " changed at "@" and " dot " changed to "."). */
33 #include <LibConfig.h>
42 gethex( CONST
char **sp
, CONST FPI
*fpi
, Long
*expt
, Bigint
**bp
, int sign
)
45 CONST
unsigned char *decpt
, *s0
, *s
, *s1
;
46 int esign
, havedig
, irv
, k
, n
, nbits
, up
, zret
;
47 ULong L
, lostbits
, *x
;
50 unsigned char decimalpoint
= *localeconv()->decimal_point
;
52 #define decimalpoint '.'
58 s0
= *(CONST
unsigned char **)sp
+ 2;
59 while(s0
[havedig
] == '0')
68 if (*s
!= decimalpoint
)
82 if (*s
== decimalpoint
&& !decpt
) {
88 e
= -(((Long
)(s
-decpt
)) << 2);
102 if ((n
= hexdig
[*s
]) == 0 || n
> 0x19) {
107 while((n
= hexdig
[*++s
]) !=0 && n
<= 0x19)
108 e1
= 10*e1
+ n
- 0x10;
115 return havedig
? STRTOG_Zero
: STRTOG_NoNumber
;
116 n
= (int)(s1
- s0
- 1);
117 for(k
= 0; n
> 7; n
= (unsigned int)n
>> 1)
121 return STRTOG_NoMemory
;
126 if (*--s1
== decimalpoint
)
133 L
|= (hexdig
[*s1
] & 0x0f) << n
;
137 b
->wds
= n
= (int)(x
- b
->x
);
138 n
= 32*n
- hi0bits(L
);
147 if (x
[(unsigned int)k
>>kshift
] & 1 << (k
& kmask
)) {
149 if (k
> 1 && any_on(b
,k
-1))
156 else if (n
< nbits
) {
160 return STRTOG_NoMemory
;
168 return STRTOG_Infinite
| STRTOG_Overflow
| STRTOG_Inexhi
;
172 irv
= STRTOG_Denormal
;
175 switch (fpi
->rounding
) {
177 if (n
== nbits
&& (n
< 2 || any_on(b
,n
-1)))
190 return STRTOG_Denormal
| STRTOG_Inexhi
196 return STRTOG_Zero
| STRTOG_Inexlo
| STRTOG_Underflow
;
202 lostbits
= any_on(b
,k
);
203 if (x
[(unsigned int)k
>>kshift
] & 1 << (k
& kmask
))
211 switch(fpi
->rounding
) {
216 && (lostbits
& 1) | (x
[0] & 1))
229 if (irv
== STRTOG_Denormal
) {
230 if (nbits
== fpi
->nbits
- 1
231 && x
[(unsigned int)nbits
>> kshift
] & 1 << (nbits
& kmask
))
235 || ((n
= nbits
& kmask
) !=0
236 && hi0bits(x
[k
-1]) < 32-n
)) {
241 irv
|= STRTOG_Inexhi
;
244 irv
|= STRTOG_Inexlo
;