Leaked source code of windows server 2003
You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
 
 
 
 
 
 

98 lines
2.1 KiB

/*++
Copyright (c) 1999 Microsoft Corporation
Module Name:
ldexp.c
Abstract:
multiply by a power of two
Author:
Revision History:
29-sept-1999 ATM Shafiqul Khalid [askhalid] copied from rtl library.
--*/
#include <math.h>
#include <float.h>
#include <trans.h>
#include <limits.h>
/***
*double ldexp(double x, int exp)
*
*Purpose:
* Compute x * 2^exp
*
*Entry:
*
*Exit:
*
*Exceptions:
* I U O P
*
*******************************************************************************/
double ldexp(double x, int exp)
{
unsigned int savedcw;
int oldexp;
long newexp; /* for checking out of bounds exponents */
double result, mant;
/* save user fp control word */
savedcw = _maskfp();
/* check for infinity or NAN */
if (IS_D_SPECIAL(x)){
switch (_sptype(x)) {
case T_PINF:
case T_NINF:
RETURN(savedcw,x);
case T_QNAN:
return _handle_qnan2(OP_LDEXP, x, (double)exp, savedcw);
default: //T_SNAN
return _except2(FP_I,OP_LDEXP,x,(double)exp,_s2qnan(x),savedcw);
}
}
if (x == 0.0) {
RETURN(savedcw,x);
}
mant = _decomp(x, &oldexp);
if (ABS(exp) > INT_MAX)
newexp = exp; // avoid possible integer overflow
else
newexp = oldexp + exp;
/* out of bounds cases */
if (newexp > MAXEXP + IEEE_ADJUST) {
return _except2(FP_O|FP_P,OP_LDEXP,x,(double)exp,_copysign(D_INF,mant),savedcw);
}
if (newexp > MAXEXP) {
result = _set_exp(mant, newexp-IEEE_ADJUST);
return _except2(FP_O|FP_P,OP_LDEXP,x,(double)exp,result,savedcw);
}
if (newexp < MINEXP - IEEE_ADJUST) {
return _except2(FP_U|FP_P,OP_LDEXP,x,(double)exp,mant*0.0,savedcw);
}
if (newexp < MINEXP) {
result = _set_exp(mant, newexp+IEEE_ADJUST);
return _except2(FP_U|FP_P,OP_LDEXP,x,(double)exp,result,savedcw);
}
result = _set_exp(mant, (int)newexp);
RETURN(savedcw,result);
}