| /external/eigen/blas/ |
| GeneralRank1Update.h | 26 conj_if<ConjRhs> cj; local
29 Map<Matrix<Scalar,Dynamic,1> >(mat+stride*i,rows) += alpha * cj(v[i]) * ConjRhsType(OtherMap(u,rows));
|
| PackedSelfadjointProduct.h | 29 conj_if<ConjRhs> cj; local
33 Map<Matrix<Scalar,Dynamic,1> >(mat, UpLo==Lower ? size-i : (i+1)) += alpha * cj(vec[i]) * ConjRhsType(OtherMap(vec+(UpLo==Lower ? i : 0), UpLo==Lower ? size-i : (i+1)));
|
| PackedTriangularMatrixVector.h | 29 internal::conj_if<ConjRhs> cj; local
39 ResMap(res+(IsLower ? s+i : 0),r) += alpha * cj(rhs[i]) * ConjLhsType(LhsMap(lhs+s,r));
41 res[i] += alpha * cj(rhs[i]);
58 internal::conj_if<ConjRhs> cj; local
71 res[i] += alpha * cj(rhs[i]);
|
| PackedTriangularSolverVector.h | 27 internal::conj_if<Conjugate> cj; local
40 rhs[i] /= cj(lhs[IsLower ? i : 0]);
55 internal::conj_if<Conjugate> cj; local
65 rhs[i] /= cj(lhs[IsLower ? 0 : i]);
|
| /external/clang/test/CodeGen/ |
| unsigned-promotion.c | 10 unsigned char ci, cj, ck; variable
83 // CHECKS: load i8* @cj
90 // CHECKU: [[T1:%.*]] = load i8* @cj
98 ci = cj + ck;
105 // CHECKS: load i8* @cj
112 // CHECKU: [[T1:%.*]] = load i8* @cj
120 ci = cj - ck;
127 // CHECKS: load i8* @cj
134 // CHECKU: [[T1:%.*]] = load i8* @cj
142 ci = cj * ck
[all...] |
| /external/eigen/Eigen/src/Core/products/ |
| SelfadjointProduct.h | 27 internal::conj_if<ConjRhs> cj; local
33 += (alpha * cj(vecY[i])) * ConjLhsType(OtherMap(vecX+(UpLo==Lower ? i : 0),UpLo==Lower ? size-i : (i+1)));
|
| GeneralMatrixVector.h | 79 conj_helper<LhsScalar,RhsScalar,ConjugateLhs,ConjugateRhs> cj; local
166 res[j] = cj.pmadd(lhs0[j], pfirst(ptmp0), res[j]);
167 res[j] = cj.pmadd(lhs1[j], pfirst(ptmp1), res[j]);
168 res[j] = cj.pmadd(lhs2[j], pfirst(ptmp2), res[j]);
169 res[j] = cj.pmadd(lhs3[j], pfirst(ptmp3), res[j]);
235 res[j] = cj.pmadd(lhs0[j], pfirst(ptmp0), res[j]);
236 res[j] = cj.pmadd(lhs1[j], pfirst(ptmp1), res[j]);
237 res[j] = cj.pmadd(lhs2[j], pfirst(ptmp2), res[j]);
238 res[j] = cj.pmadd(lhs3[j], pfirst(ptmp3), res[j]);
257 res[j] += cj.pmul(lhs0[j], pfirst(ptmp0))
343 conj_helper<LhsScalar,RhsScalar,ConjugateLhs,ConjugateRhs> cj; local
[all...] |
| GeneralBlockPanelKernel.h | 106 #define MADD(CJ,A,B,C,T) C = CJ.pmadd(A,B,C);
111 template<typename CJ, typename A, typename B, typename C, typename T> struct gebp_madd_selector {
112 EIGEN_ALWAYS_INLINE static void run(const CJ& cj, A& a, B& b, C& c, T& /*t*/)
114 c = cj.pmadd(a,b,c);
118 template<typename CJ, typename T> struct gebp_madd_selector<CJ,T,T,T,T> {
119 EIGEN_ALWAYS_INLINE static void run(const CJ& cj, T& a, T& b, T& c, T& t
298 conj_helper<ResPacket,ResPacket,ConjLhs,false> cj; member in class:Eigen::internal::gebp_traits
421 conj_helper<LhsScalar,RhsScalar,ConjLhs,ConjRhs> cj; member in class:Eigen::internal::gebp_traits
503 conj_helper<ResPacket,ResPacket,false,ConjRhs> cj; member in class:Eigen::internal::gebp_traits
545 conj_helper<LhsScalar,RhsScalar,ConjugateLhs,ConjugateRhs> cj; local
1135 conj_if<NumTraits<Scalar>::IsComplex && Conjugate> cj; local
1223 conj_if<NumTraits<Scalar>::IsComplex && Conjugate> cj; local
1276 conj_if<NumTraits<Scalar>::IsComplex && Conjugate> cj; local
[all...] |
| /external/eigen/test/ |
| packetmath.cpp | 293 internal::conj_helper<Scalar,Scalar,ConjLhs,ConjRhs> cj; local
299 VERIFY(internal::isApprox(ref[i], cj.pmul(data1[i],data2[i])) && "conj_helper pmul");
308 VERIFY(internal::isApprox(ref[i], cj.pmadd(data1[i],data2[i],tmp)) && "conj_helper pmadd");
|
| /external/libcxx/src/ |
| debug.cpp | 387 __c_node* cj = j != nullptr ? j->__c_ : nullptr; local
388 return ci != nullptr && ci == cj;
|
| /external/linux-tools-perf/perf-3.12.0/tools/perf/util/ |
| help.c | 54 size_t ci, cj, ei; local
57 ci = cj = ei = 0;
61 cmds->names[cj++] = cmds->names[ci++];
69 cmds->names[cj++] = cmds->names[ci++];
71 cmds->cnt = cj;
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/src/ |
| debug.cpp | 423 __c_node* cj = j != nullptr ? j->__c_ : nullptr; local
424 return ci != nullptr && ci == cj;
|
| /external/opencv/cv/src/ |
| cvemd.cpp | 309 int cj = state.idx2[j]; local
311 if( xp != state.enter_x && ci >= 0 && cj >= 0 )
315 ((float*)(flow->data.ptr + flow->step*ci))[cj] = val;
517 int cj = state->idx2[j]; local
518 if( cj < 0 )
526 signature2 + cj * (dims + 1) + 1,
532 val = cost[cost_step*ci + cj];
[all...] |
| /external/opencv/ml/src/ |
| mlsvm.cpp | 1408 int cj = class_ranges[j+1] - class_ranges[j]; local
1424 int sj = class_ranges[j], cj = class_ranges[j+1] - sj; local
[all...] |
| /external/clang/lib/Analysis/ |
| ThreadSafety.cpp | 597 unsigned cj = j+1; // first child of j local
599 ++k, ci=getNextSibling(ci), cj = Other.getNextSibling(cj)) {
600 Result = Result && matches(Other, ci, cj);
[all...] |
| /external/chromium_org/third_party/sqlite/amalgamation/ |
| sqlite3.c | 62858 } cj; member in union:vdbeExecUnion
[all...] |
