/external/eigen/unsupported/Eigen/src/IterativeSolvers/ |
IncompleteCholesky.h | 127 inline void updateList(const IdxType& colPtr, IdxType& rowIdx, SclType& vals, const Index& col, const Index& jk, IndexType& firstElt, VectorList& listCol); 193 int jk = firstElt(*k); // First element to use in the column local 194 jk += 1; 195 for (int i = jk; i < colPtr[*k+1]; i++) 197 curCol(rowIdx[i]) -= vals[i] * vals[jk] ; 199 updateList(colPtr,rowIdx,vals, *k, jk, firstElt, listCol); 231 Index jk = colPtr(j)+1; local 232 updateList(colPtr,rowIdx,vals,j,jk,firstElt,listCol); 241 inline void IncompleteCholesky<Scalar,_UpLo, OrderingType>::updateList(const IdxType& colPtr, IdxType& rowIdx, SclType& vals, const Index& col, const Index& jk, IndexType& firstElt, VectorList& listCol) 243 if (jk < colPtr(col+1) [all...] |
/external/fdlibm/ |
k_rem_pio2.c | 83 * jk jk+1 is the initial number of terms of ipio2[] needed 99 * jp jp+1 is the number of terms in PIo2[] needed, jp = jk. 114 * 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 */ 170 int jz,jx,jv,jp,jk,carry,n,iq[20],i,j,k,m,q0,ih; local 173 /* initialize jk*/ 174 jk = init_jk[prec]; 175 jp = jk; 182 /* set up f[0] to f[jx+jk] where f[jx+jk] = ipio2[jv+jk] * [all...] |
/external/chromium_org/v8/third_party/fdlibm/ |
fdlibm.cc | 117 static const int32_t jk = 3; local 123 int32_t m = jx + jk; 131 for (int i = 0; i <= jk; i++) { 137 int32_t jz = jk; 192 for (int i = jz - 1; i >= jk; i--) j |= iq[i]; 195 while (iq[jk - k] == 0) k++; 235 for (int k = 0; k <= jk && k <= jz - i; k++) fw += PIo2[k] * q[i + k];
|
/bionic/libm/upstream-freebsd/lib/msun/src/ |
k_rem_pio2.c | 80 * jk jk+1 is the initial number of terms of ipio2[] needed 82 * for jk is 3,4,4,6 for single, double, extended, and quad. 83 * jk+1 must be 2 larger than you might expect so that our 101 * jp jp+1 is the number of terms in PIo2[] needed, jp = jk. 116 * fq[] final product of x*(2/pi) in fq[0],..,fq[jk] 137 static const int init_jk[] = {3,4,4,6}; /* initial value for jk */ 148 * NB: This table must have at least (e0-3)/24 + jk terms. 149 * For quad precision (e0 <= 16360, jk = 6), this is 686. 296 int32_t jz,jx,jv,jp,jk,carry,n,iq[20],i,j,k,m,q0,ih local [all...] |
/external/valgrind/main/callgrind/ |
main.c | 1227 ClgJumpKind jk; local 1310 ClgJumpKind jk; local 1329 ClgJumpKind jk; local [all...] |
/external/valgrind/main/VEX/priv/ |
host_amd64_defs.h | 499 IRJumpKind jk; member in struct:__anon36285::__anon36286::__anon36301 711 AMD64CondCode cond, IRJumpKind jk );
|
host_arm64_defs.h | 725 IRJumpKind jk; member in struct:__anon36367::__anon36368::__anon36383 1048 ARM64CondCode cond, IRJumpKind jk ); [all...] |
host_arm_defs.h | 714 IRJumpKind jk; member in struct:__anon36458::__anon36459::__anon36472 977 ARMCondCode cond, IRJumpKind jk );
|
host_mips_defs.h | 503 IRJumpKind jk; member in struct:__anon36541::__anon36542::__anon36553 661 MIPSCondCode cond, IRJumpKind jk);
|
host_x86_defs.h | 477 IRJumpKind jk; member in struct:__anon36767::__anon36768::__anon36782 674 X86CondCode cond, IRJumpKind jk );
|
host_s390_isel.c | [all...] |
host_mips_isel.c | [all...] |
host_arm64_isel.c | [all...] |
host_x86_isel.c | [all...] |
host_ppc_defs.h | 671 IRJumpKind jk; member in struct:__anon36602::__anon36603::__anon36615 1040 PPCCondCode cond, IRJumpKind jk ); [all...] |
host_ppc_isel.c | [all...] |
host_amd64_isel.c | [all...] |
host_arm_isel.c | [all...] |
host_amd64_defs.c | 729 AMD64CondCode cond, IRJumpKind jk ) { 735 i->Ain.XAssisted.jk = jk; [all...] |
host_arm64_defs.c | [all...] |
host_mips_defs.c | 1350 MIPSCondCode cond, IRJumpKind jk ) { 1356 i->Min.XAssisted.jk = jk; [all...] |
host_x86_defs.c | 673 X86CondCode cond, IRJumpKind jk ) { 679 i->Xin.XAssisted.jk = jk; [all...] |
ir_defs.c | [all...] |
/external/valgrind/main/VEX/pub/ |
libvex_ir.h | 2744 IRJumpKind jk; \/* Jump kind *\/ member in struct:_IRStmt::__anon36913::__anon36927 [all...] |
/external/valgrind/main/cachegrind/ |
cg_main.c | [all...] |