Home
last modified time | relevance | path

Searched refs:jk (Results 1 - 4 of 4) sorted by relevance

/third_party/jerryscript/jerry-libm/
H A Dtrig.c108 * jk jk+1 is the initial number of terms of ipio2[] needed
124 * jp jp+1 is the number of terms in PIo2[] needed, jp = jk.
139 * fq[] final product of x*(2/pi) in fq[0],..,fq[jk]
153 /* initial value for jk */
192 int jz, jx, jv, jp, jk, carry, n, iq[20], i, j, k, m, q0, ih; in __kernel_rem_pio2() local
195 /* initialize jk */ in __kernel_rem_pio2()
196 jk = init_jk[prec]; in __kernel_rem_pio2()
197 jp = jk; in __kernel_rem_pio2()
208 /* set up f[0] to f[jx + jk] wher in __kernel_rem_pio2()
[all...]
/third_party/musl/porting/liteos_a/kernel/src/math/
H A D__rem_pio2_large.c75 * jk jk+1 is the initial number of terms of ipio2[] needed
77 * for jk is 3,4,4,6 for single, double, extended, and quad.
78 * jk+1 must be 2 larger than you might expect so that our
96 * jp jp+1 is the number of terms in PIo2[] needed, jp = jk.
111 * fq[] final product of x*(2/pi) in fq[0],..,fq[jk]
127 static const int init_jk[] = {3,4,4,6}; /* initial value for jk */
138 * NB: This table must have at least (e0-3)/24 + jk terms.
139 * For quad precision (e0 <= 16360, jk = 6), this is 686.
275 int32_t jz,jx,jv,jp,jk,carr in __rem_pio2_large() local
[all...]
/third_party/musl/src/math/
H A D__rem_pio2_large.c75 * jk jk+1 is the initial number of terms of ipio2[] needed
77 * for jk is 3,4,4,6 for single, double, extended, and quad.
78 * jk+1 must be 2 larger than you might expect so that our
96 * jp jp+1 is the number of terms in PIo2[] needed, jp = jk.
111 * fq[] final product of x*(2/pi) in fq[0],..,fq[jk]
127 static const int init_jk[] = {3,4,4,6}; /* initial value for jk */
138 * NB: This table must have at least (e0-3)/24 + jk terms.
139 * For quad precision (e0 <= 16360, jk = 6), this is 686.
275 int32_t jz,jx,jv,jp,jk,carr in __rem_pio2_large() local
[all...]
/third_party/node/deps/v8/src/base/
H A Dieee754.cc406 * jk jk+1 is the initial number of terms of ipio2[] needed
422 * jp jp+1 is the number of terms in PIo2[] needed, jp = jk.
437 * fq[] final product of x*(2/pi) in fq[0],..,fq[jk]
451 static const int init_jk[] = {2, 3, 4, 6}; /* initial value for jk */ in __kernel_rem_pio2()
470 int32_t jz, jx, jv, jp, jk, carry, n, iq[20], i, j, k, m, q0, ih; in __kernel_rem_pio2() local
473 /* initialize jk*/ in __kernel_rem_pio2()
474 jk = init_jk[prec]; in __kernel_rem_pio2()
475 jp = jk; in __kernel_rem_pio2()
483 /* set up f[0] to f[jx+jk] wher in __kernel_rem_pio2()
[all...]

Completed in 5 milliseconds