| /toolchain/binutils/binutils-2.25/gas/testsuite/gas/ppc/ |
| test1elf32.s | 54 datpt: .long jk-.+10000000
55 dat0: .long jk-dat1
56 dat1: .long jk-dat1
57 dat2: .long jk-dat1
|
| test1elf64.s | 88 datpt: .long jk-.+10000000
89 dat0: .long jk-dat1
90 dat1: .long jk-dat1
91 dat2: .long jk-dat1
93 dat3: .llong jk-dat1
94 dat4: .llong jk-dat1
|
| test1elf.asm | 88 datpt: .long jk-.+10000000
89 dat0: .long jk-dat1
90 dat1: .long jk-dat1
91 dat2: .long jk-dat1
93 dat3: .llong jk-dat1
94 dat4: .llong jk-dat1
|
| test1elf32.d | 32 0+0000 \*UND\* 0+0000 jk
78 8: R_PPC_REL32 jk\+0x989680
82 c: R_PPC_REL32 jk-0x4
86 10: R_PPC_REL32 jk
90 14: R_PPC_REL32 jk\+0x4
|
| test1elf64.d | 37 0000000000000000 \*UND\* 0000000000000000 jk
113 10: R_PPC64_REL32 jk\+0x989680
117 14: R_PPC64_REL32 jk-0x4
121 18: R_PPC64_REL32 jk
125 1c: R_PPC64_REL32 jk\+0x4
129 20: R_PPC64_REL64 jk\+0x8
133 28: R_PPC64_REL64 jk\+0x10
|
| /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...] |
| /device/google/contexthub/lib/libm/ |
| kf_rem_pio2.c | 22 static const int init_jk[] = {4,7,9}; /* initial value for jk */
62 __int32_t jz,jx,jv,jp,jk,carry,n,iq[20],i,j,k,m,q0,ih; local
65 /* initialize jk*/
66 jk = init_jk[prec];
67 jp = jk;
74 /* set up f[0] to f[jx+jk] where f[jx+jk] = ipio2[jv+jk] */
75 j = jv-jx; m = jx+jk;
78 /* compute q[0],q[1],...q[jk] */
[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/v8/src/third_party/fdlibm/ |
| fdlibm.cc | 64 static const int32_t jk = 3; local
70 int32_t m = jx + jk;
78 for (int i = 0; i <= jk; i++) {
84 int32_t jz = jk;
139 for (int i = jz - 1; i >= jk; i--) j |= iq[i];
142 while (iq[jk - k] == 0) k++;
182 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/callgrind/ |
| main.c | 1228 ClgJumpKind jk; local
1311 ClgJumpKind jk; local
1330 ClgJumpKind jk; local
[all...] |
| /external/valgrind/VEX/priv/ |
| host_tilegx_isel.c | [all...] |
| host_amd64_defs.h | 501 IRJumpKind jk; member in struct:__anon24633::__anon24634::__anon24649
739 AMD64CondCode cond, IRJumpKind jk );
|
| host_tilegx_defs.h | 435 IRJumpKind jk; member in struct:__anon25131::__anon25132::__anon25145
508 TILEGXCondCode cond, IRJumpKind jk );
|
| host_x86_defs.h | 480 IRJumpKind jk; member in struct:__anon25181::__anon25182::__anon25196
677 X86CondCode cond, IRJumpKind jk );
|
| host_s390_isel.c | [all...] |
| host_tilegx_defs.c | 319 (Int)instr->GXin.XAssisted.jk);
856 TILEGXCondCode cond, IRJumpKind jk )
863 i->GXin.XAssisted.jk = jk;
[all...] |
| host_mips_isel.c | [all...] |
| host_arm64_isel.c | [all...] |
| host_x86_isel.c | [all...] |
| host_arm64_defs.h | 625 IRJumpKind jk; member in struct:__anon24721::__anon24722::__anon24737
900 ARM64CondCode cond, IRJumpKind jk );
[all...] |
| host_arm_defs.h | 717 IRJumpKind jk; member in struct:__anon24824::__anon24825::__anon24838
980 ARMCondCode cond, IRJumpKind jk );
[all...] |
| host_mips_defs.h | 476 IRJumpKind jk; member in struct:__anon24909::__anon24910::__anon24921
643 MIPSCondCode cond, IRJumpKind jk);
|
| host_ppc_isel.c | [all...] |
| /external/valgrind/VEX/pub/ |
| libvex_ir.h | 2902 IRJumpKind jk; \/* Jump kind *\/ member in struct:_IRStmt::__anon25340::__anon25354
[all...] |
