2001-12-14 07:50:11 +08:00
|
|
|
/*
|
|
|
|
* ====================================================
|
2002-12-21 05:31:20 +08:00
|
|
|
* Copyright (C) 1998, 2002 by Red Hat Inc. All rights reserved.
|
2001-12-14 07:50:11 +08:00
|
|
|
*
|
|
|
|
* Permission to use, copy, modify, and distribute this
|
|
|
|
* software is freely granted, provided that this notice
|
|
|
|
* is preserved.
|
|
|
|
* ====================================================
|
|
|
|
*/
|
|
|
|
|
2001-12-19 11:03:43 +08:00
|
|
|
#if !defined(_SOFT_FLOAT)
|
|
|
|
|
2001-12-14 07:50:11 +08:00
|
|
|
/*
|
|
|
|
Fast version of pow using Intel float instructions.
|
|
|
|
|
|
|
|
float _f_powf (float x, float y);
|
|
|
|
|
|
|
|
Function calculates x to power of y.
|
|
|
|
The function optimizes the case where x is >0.0 and y is finite.
|
|
|
|
In such a case, there is no error checking or setting of errno.
|
|
|
|
All other cases defer to normal powf() function which will
|
|
|
|
set errno as normal.
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include <math.h>
|
|
|
|
#include <ieeefp.h>
|
|
|
|
#include "f_math.h"
|
|
|
|
|
|
|
|
float _f_powf (float x, float y)
|
|
|
|
{
|
|
|
|
/* following sequence handles the majority of cases for pow() */
|
|
|
|
if (x > 0.0 && check_finitef(y))
|
|
|
|
{
|
|
|
|
float result;
|
|
|
|
/* calculate x ** y as 2 ** (y log2(x)). On Intel, can only
|
|
|
|
raise 2 to an integer or a small fraction, thus, we have
|
|
|
|
to perform two steps 2**integer portion * 2**fraction. */
|
|
|
|
asm ("flds 8(%%ebp); fyl2x; fld %%st; frndint; fsub %%st,%%st(1);" \
|
|
|
|
"fxch; fchs; f2xm1; fld1; faddp; fxch; fld1; fscale; fstp %%st(1);"\
|
|
|
|
"fmulp" : "=t" (result) : "0" (y));
|
|
|
|
return result;
|
|
|
|
}
|
|
|
|
else /* all other strange cases, defer to normal pow() */
|
|
|
|
return powf (x,y);
|
|
|
|
}
|
|
|
|
|
2001-12-19 11:03:43 +08:00
|
|
|
#endif
|