HomeSort by: relevance | last modified time | path
    Searched defs:PIo2 (Results 1 - 4 of 4) sorted by relevancy

  /src/lib/libm/noieee_src/
trig.h 35 vc(PIo2, 1.5707963267948966135E0 ,0fda,40c9,68c2,a221, 1, .C90FDAA22168C2)
42 ic(PIo2, 1.5707963267948965580E0 , 0, 1.921FB54442D18)
50 #define PIo2 vccast(PIo2)
n_atan2.c 117 vc(PIo2, 1.5707963267948966135E0 ,0fda,40c9,68c2,a221, 1, .C90FDAA22168C2)
137 ic(PIo2, 1.5707963267948965580E0 , 0, 1.921FB54442D18)
157 #define PIo2 vccast(PIo2)
200 if(x==zero) return(copysign(PIo2,signy));
210 if(!finite(y)) return(copysign(PIo2,signy));
259 hi = PIo2; lo = zero;
  /src/lib/libm/src/
k_rem_pio2.c 106 * jp jp+1 is the number of terms in PIo2[] needed, jp = jk.
114 * PIo2[] double precision array, obtained by cutting pi/2
282 static const double PIo2[] = {
414 /* compute PIo2[0,...,jp]*q[jz,...,0] */
416 for(fw=0.0,k=0;k<=jp&&k<=jz-i;k++) fw += PIo2[k]*q[i+k];
k_rem_pio2f.c 30 static const float PIo2[] = {
165 /* compute PIo2[0,...,jp]*q[jz,...,0] */
167 for(fw=0.0,k=0;k<=jp&&k<=jz-i;k++) fw += PIo2[k]*q[i+k];

Completed in 67 milliseconds