HomeSort by relevance Sort by last modified time
    Searched refs:PIo2 (Results 1 - 5 of 5) sorted by null

  /device/google/contexthub/firmware/lib/libm/
kf_rem_pio2.c 28 static const float PIo2[] = {
30 static float PIo2[] = {
168 /* compute PIo2[0,...,jp]*q[jz,...,0] */
170 for(fw=0.0,k=0;k<=jp&&k<=jz-i;k++) fw += PIo2[k]*q[i+k];
  /external/fdlibm/
k_rem_pio2.c 99 * jp jp+1 is the number of terms in PIo2[] needed, jp = jk.
107 * PIo2[] double precision array, obtained by cutting pi/2
139 static const double PIo2[] = {
141 static double PIo2[] = {
275 /* compute PIo2[0,...,jp]*q[jz,...,0] */
277 for(fw=0.0,k=0;k<=jp&&k<=jz-i;k++) fw += PIo2[k]*q[i+k];
  /device/linaro/bootloader/edk2/StdLib/LibC/Math/
k_rem_pio2.c 103 * jp jp+1 is the number of terms in PIo2[] needed, jp = jk.
111 * PIo2[] double precision array, obtained by cutting pi/2
139 static const double PIo2[] = {
264 /* compute PIo2[0,...,jp]*q[jz,...,0] */
266 for(fw=0.0,k=0;k<=jp&&k<=jz-i;k++) fw += PIo2[k]*q[i+k];
  /bionic/libm/upstream-freebsd/lib/msun/src/
k_rem_pio2.c 101 * jp jp+1 is the number of terms in PIo2[] needed, jp = jk.
109 * PIo2[] double precision array, obtained by cutting pi/2
276 static const double PIo2[] = {
401 /* compute PIo2[0,...,jp]*q[jz,...,0] */
403 for(fw=0.0,k=0;k<=jp&&k<=jz-i;k++) fw += PIo2[k]*q[i+k];
  /external/v8/src/base/
ieee754.cc 477 * jp jp+1 is the number of terms in PIo2[] needed, jp = jk.
485 * PIo2[] double precision array, obtained by cutting pi/2
508 static const double PIo2[] = {
654 /* compute PIo2[0,...,jp]*q[jz,...,0] */
656 for (fw = 0.0, k = 0; k <= jp && k <= jz - i; k++) fw += PIo2[k] * q[i + k];
    [all...]

Completed in 135 milliseconds