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

  /src/lib/libm/src/
k_rem_pio2.c 85 * jk jk+1 is the initial number of terms of ipio2[] needed
87 * for jk is 3,4,4,6 for single, double, extended, and quad.
88 * jk+1 must be 2 larger than you might expect so that our
106 * jp jp+1 is the number of terms in PIo2[] needed, jp = jk.
121 * fq[] final product of x*(2/pi) in fq[0],..,fq[jk]
143 static const int init_jk[] = {3,4,4,6}; /* initial value for jk */
154 * NB: This table must have at least (e0-3)/24 + jk terms.
155 * For quad precision (e0 <= 16360, jk = 6), this is 686.
302 int32_t jz,jx,jv,jp,jk,carry,n,iq[20],i,j,k,m,q0,ih local
    [all...]
k_rem_pio2f.c 28 static const int init_jk[] = {4,7,9}; /* initial value for jk */
53 int32_t jz,jx,jv,jp,jk,carry,n,iq[20],i,j,k,m,q0,ih; local
61 /* initialize jk*/
62 jk = init_jk[prec];
63 jp = jk;
70 /* set up f[0] to f[jx+jk] where f[jx+jk] = ipio2[jv+jk] */
71 j = jv-jx; m = jx+jk;
74 /* compute q[0],q[1],...q[jk] */
    [all...]
  /src/external/gpl3/gcc/dist/libquadmath/math/
rem_pio2q.c 86 * jk jk+1 is the initial number of terms of ipio2[] needed
102 * jp jp+1 is the number of terms in PIo2[] needed, jp = jk.
117 * fq[] final product of x*(2/pi) in fq[0],..,fq[jk]
133 static const int init_jk[] = {2,3,4,6}; /* initial value for jk */
156 int32_t jz,jx,jv,jp,jk,carry,n,iq[20],i,j,k,m,q0,ih; local
159 /* initialize jk*/
160 jk = init_jk[prec];
161 jp = jk;
168 /* set up f[0] to f[jx+jk] where f[jx+jk] = ipio2[jv+jk] *
    [all...]
  /src/external/gpl3/gcc.old/dist/libquadmath/math/
rem_pio2q.c 86 * jk jk+1 is the initial number of terms of ipio2[] needed
102 * jp jp+1 is the number of terms in PIo2[] needed, jp = jk.
117 * fq[] final product of x*(2/pi) in fq[0],..,fq[jk]
133 static const int init_jk[] = {2,3,4,6}; /* initial value for jk */
156 int32_t jz,jx,jv,jp,jk,carry,n,iq[20],i,j,k,m,q0,ih; local
159 /* initialize jk*/
160 jk = init_jk[prec];
161 jp = jk;
168 /* set up f[0] to f[jx+jk] where f[jx+jk] = ipio2[jv+jk] *
    [all...]

Completed in 16 milliseconds