HomeSort by: relevance | last modified time | path
    Searched defs:jx (Results 1 - 25 of 28) sorted by relevancy

1 2

  /src/lib/libm/src/
e_sinh.c 45 int32_t ix,jx; local
49 GET_HIGH_WORD(jx,x);
50 ix = jx&0x7fffffff;
56 if (jx<0) h = -h;
e_sinhf.c 30 int32_t ix,jx; local
32 GET_FLOAT_WORD(jx,x);
33 ix = jx&0x7fffffff;
39 if (jx<0) h = -h;
s_tanh.c 51 int32_t jx,ix; local
54 GET_HIGH_WORD(jx,x);
55 ix = jx&0x7fffffff;
59 if (jx>=0) return one/x+one; /* tanh(+-inf)=+-1 */
78 return (jx>=0)? z: -z;
s_tanhf.c 30 int32_t jx,ix; local
32 GET_FLOAT_WORD(jx,x);
33 ix = jx&0x7fffffff;
37 if (jx>=0) return one/x+one; /* tanh(+-inf)=+-1 */
56 return (jx>=0)? z: -z;
e_sinhl.c 98 int16_t ix,jx; local
100 GET_LDBL_EXPSIGN(jx,x);
101 ix = jx&0x7fff;
109 if (jx<0) s = -1;
k_rem_pio2.c 97 * jx nx - 1
302 int32_t jz,jx,jv,jp,jk,carry,n,iq[20],i,j,k,m,q0,ih; local
314 /* determine jx,jv,q0, note that 3>q0 */
315 jx = nx-1;
319 /* set up f[0] to f[jx+jk] where f[jx+jk] = ipio2[jv+jk] */
320 j = jv-jx; m = jx+jk;
325 for(j=0,fw=0.0;j<=jx;j++)
326 fw += x[j]*f[jx+i-j]
    [all...]
k_rem_pio2f.c 53 int32_t jz,jx,jv,jp,jk,carry,n,iq[20],i,j,k,m,q0,ih; local
65 /* determine jx,jv,q0, note that 3>q0 */
66 jx = nx-1;
70 /* set up f[0] to f[jx+jk] where f[jx+jk] = ipio2[jv+jk] */
71 j = jv-jx; m = jx+jk;
76 for(j=0,fw=0.0;j<=jx;j++)
77 fw += x[j]*f[jx+i-j];
136 f[jx+i] = (float) ipio2[jv+i]
    [all...]
s_tanhl.c 125 int16_t jx,ix; local
127 GET_LDBL_EXPSIGN(jx,x);
128 ix = jx&0x7fff;
132 if (jx>=0) return one/x+one; /* tanh(+-inf)=+-1 */
178 if (jx<0) s = -1;
  /src/external/gpl3/gcc/dist/libquadmath/math/
atanhq.c 45 uint32_t jx, ix; local
49 jx = u.words32.w0;
50 ix = jx & 0x7fffffff;
70 if(jx & 0x80000000) return -t; else return t;
sinhq.c 65 uint32_t jx, ix; local
70 jx = u.words32.w0;
71 ix = jx & 0x7fffffff;
78 if (jx & 0x80000000)
tanhq.c 52 uint32_t jx, ix; local
57 jx = u.words32.w0;
58 ix = jx & 0x7fffffff;
63 if (jx & 0x80000000)
96 return (jx & 0x80000000) ? -z : z;
rem_pio2q.c 93 * jx nx - 1
156 int32_t jz,jx,jv,jp,jk,carry,n,iq[20],i,j,k,m,q0,ih; local
163 /* determine jx,jv,q0, note that 3>q0 */
164 jx = nx-1;
168 /* set up f[0] to f[jx+jk] where f[jx+jk] = ipio2[jv+jk] */
169 j = jv-jx; m = jx+jk;
174 for(j=0,fw=0.0;j<=jx;j++) fw += x[j]*f[jx+i-j]
    [all...]
  /src/external/gpl3/gcc.old/dist/libquadmath/math/
atanhq.c 45 uint32_t jx, ix; local
49 jx = u.words32.w0;
50 ix = jx & 0x7fffffff;
70 if(jx & 0x80000000) return -t; else return t;
sinhq.c 65 uint32_t jx, ix; local
70 jx = u.words32.w0;
71 ix = jx & 0x7fffffff;
78 if (jx & 0x80000000)
tanhq.c 52 uint32_t jx, ix; local
57 jx = u.words32.w0;
58 ix = jx & 0x7fffffff;
63 if (jx & 0x80000000)
96 return (jx & 0x80000000) ? -z : z;
rem_pio2q.c 93 * jx nx - 1
156 int32_t jz,jx,jv,jp,jk,carry,n,iq[20],i,j,k,m,q0,ih; local
163 /* determine jx,jv,q0, note that 3>q0 */
164 jx = nx-1;
168 /* set up f[0] to f[jx+jk] where f[jx+jk] = ipio2[jv+jk] */
169 j = jv-jx; m = jx+jk;
174 for(j=0,fw=0.0;j<=jx;j++) fw += x[j]*f[jx+i-j]; q[i] = fw
    [all...]
  /src/external/gpl3/gdb/dist/gdb/testsuite/gdb.cp/
nsusing.cc 22 int jx = 44; member in namespace:J
39 (void) jx;
  /src/external/gpl3/gdb.old/dist/gdb/testsuite/gdb.cp/
nsusing.cc 22 int jx = 44; member in namespace:J
39 (void) jx;
  /src/external/bsd/tmux/dist/
popup.c 700 u_int jx, jy; local
714 jx = sx;
719 jx = sx - 2;
750 screen_init(&pd->s, jx, jy, 0);
778 JOB_NOWAIT|JOB_PTY|JOB_KEEPWRITE|JOB_DEFAULTSHELL, jx, jy);
  /src/external/gpl3/gcc/dist/gcc/
gcov.cc 3260 int jx = 0;
3277 jx += output_branch_count (f, jx, arc);
3258 int jx = 0; local
  /src/external/gpl3/gcc.old/dist/gcc/
gcov.cc 3056 int ix, jx;
3058 ix = jx = 0;
3075 jx += output_branch_count (f, jx, arc);
3054 int ix, jx; local
  /src/external/gpl3/gcc/dist/gcc/cp/
class.cc 10285 unsigned ix, jx;
10354 jx = vec_safe_length (*inits);
10355 vec_safe_grow (*inits, jx + vid.inits->length (), true);
10359 ix--, jx++)
10360 (**inits)[jx] = *e;
10473 CONSTRUCTOR_APPEND_ELT (*inits, size_int (jx++), init);
10481 CONSTRUCTOR_APPEND_ELT (*inits, size_int (jx++), fdesc);
10485 CONSTRUCTOR_APPEND_ELT (*inits, size_int (jx++), init);
10277 unsigned ix, jx; local
name-lookup.cc 262 for (unsigned jx = BINDING_SLOTS_FIXED; jx--;)
264 cluster[0].indices[jx].base = 0;
265 cluster[0].indices[jx].span = 1;
266 cluster[0].slots[jx] = NULL_TREE;
908 for (unsigned jx = 0; jx != BINDING_VECTOR_SLOTS_PER_CLUSTER; jx++)
911 if (unsigned base = cluster->indices[jx].base)
912 if (unsigned span = cluster->indices[jx].span
9222 unsigned jx = BINDING_VECTOR_SLOTS_PER_CLUSTER; local
    [all...]
  /src/external/gpl3/gcc.old/dist/gcc/cp/
class.cc 9894 unsigned ix, jx;
9963 jx = vec_safe_length (*inits);
9964 vec_safe_grow (*inits, jx + vid.inits->length (), true);
9968 ix--, jx++)
9969 (**inits)[jx] = *e;
10082 CONSTRUCTOR_APPEND_ELT (*inits, size_int (jx++), init);
10090 CONSTRUCTOR_APPEND_ELT (*inits, size_int (jx++), fdesc);
10094 CONSTRUCTOR_APPEND_ELT (*inits, size_int (jx++), init);
9886 unsigned ix, jx; local
name-lookup.cc 262 for (unsigned jx = BINDING_SLOTS_FIXED; jx--;)
264 cluster[0].indices[jx].base = 0;
265 cluster[0].indices[jx].span = 1;
266 cluster[0].slots[jx] = NULL_TREE;
903 for (unsigned jx = 0; jx != BINDING_VECTOR_SLOTS_PER_CLUSTER; jx++)
906 if (unsigned base = cluster->indices[jx].base)
907 if (unsigned span = cluster->indices[jx].span
8936 unsigned jx = BINDING_VECTOR_SLOTS_PER_CLUSTER; local
    [all...]

Completed in 92 milliseconds

1 2