| /toolchain/binutils/binutils-2.27/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/Eigen/src/IterativeLinearSolvers/ |
| IncompleteCholesky.h | 187 inline void updateList(Ref<const VectorIx> colPtr, Ref<VectorIx> rowIdx, Ref<VectorSx> vals, const Index& col, const Index& jk, VectorIx& firstElt, VectorList& listCol);
298 Index jk = firstElt(*k); // First element to use in the column local
299 eigen_internal_assert(rowIdx[jk]==j);
300 Scalar v_j_jk = numext::conj(vals[jk]);
302 jk += 1;
303 for (Index i = jk; i < colPtr[*k+1]; i++)
316 updateList(colPtr,rowIdx,vals, *k, jk, firstElt, listCol);
366 Index jk = colPtr(j)+1; local
367 updateList(colPtr,rowIdx,vals,j,jk,firstElt,listCol);
379 inline void IncompleteCholesky<Scalar,_UpLo, OrderingType>::updateList(Ref<const VectorIx> colPtr, Ref<VectorIx> rowIdx, Ref<VectorSx> vals, const Index& col, const Index& jk, VectorIx& firstElt, VectorList& listCol
[all...] |
| /device/google/contexthub/firmware/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...] |
| /device/linaro/bootloader/edk2/StdLib/LibC/Math/ |
| k_rem_pio2.c | 87 * jk jk+1 is the initial number of terms of ipio2[] needed
103 * jp jp+1 is the number of terms in PIo2[] needed, jp = jk.
118 * fq[] final product of x*(2/pi) in fq[0],..,fq[jk]
137 static const int init_jk[] = {2,3,4,6}; /* initial value for jk */
159 int32_t jz,jx,jv,jp,jk,carry,n,iq[20],i,j,k,m,q0,ih;
local
162 /* initialize jk*/
163 jk = init_jk[prec];
164 jp = jk;
171 /* set up f[0] to f[jx+jk] where f[jx+jk] = ipio2[jv+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...] |
| /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...] |
| /device/linaro/bootloader/edk2/DuetPkg/BootSector/bin/ |
| efi64.com | [all...] |
| /external/valgrind/callgrind/ |
| main.c | 1228 ClgJumpKind jk; local
1311 ClgJumpKind jk; local
1330 ClgJumpKind jk; local
[all...] |
| /external/v8/src/base/ |
| ieee754.cc | 461 * jk jk+1 is the initial number of terms of ipio2[] needed
477 * jp jp+1 is the number of terms in PIo2[] needed, jp = jk.
492 * fq[] final product of x*(2/pi) in fq[0],..,fq[jk]
506 static const int init_jk[] = {2, 3, 4, 6}; /* initial value for jk */
525 int32_t jz, jx, jv, jp, jk, carry, n, iq[20], i, j, k, m, q0, ih; local
528 /* initialize jk*/
529 jk = init_jk[prec];
530 jp = jk;
538 /* set up f[0] to f[jx+jk] where f[jx+jk] = ipio2[jv+jk] *
[all...] |
| /build/soong/ui/build/ |
| config_test.go | 73 // -jk is not valid in Make
|
| /system/bt/stack/avrc/ |
| avrc_pars_ct.cc | 283 for (int jk = 0; jk < media->attr_count; jk++) {
284 tAVRC_ATTR_ENTRY* attr_entry = &(media->p_attr_list[jk]);
|
| /external/valgrind/VEX/priv/ |
| host_amd64_defs.h | 501 IRJumpKind jk; member in struct:__anon41438::__anon41439::__anon41454
739 AMD64CondCode cond, IRJumpKind jk );
|
| host_x86_defs.h | 480 IRJumpKind jk; member in struct:__anon41951::__anon41952::__anon41966
677 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_arm64_defs.h | 627 IRJumpKind jk; member in struct:__anon41526::__anon41527::__anon41542
931 ARM64CondCode cond, IRJumpKind jk );
[all...] |
| host_arm_defs.h | 720 IRJumpKind jk; member in struct:__anon41631::__anon41632::__anon41645
1006 ARMCondCode cond, IRJumpKind jk );
[all...] |
| host_mips_defs.h | 479 IRJumpKind jk; member in struct:__anon41719::__anon41720::__anon41731
646 MIPSCondCode cond, IRJumpKind jk);
|
| /external/valgrind/cachegrind/ |
| cg_main.c | [all...] |
