Home
last modified time | relevance | path

Searched refs:cj (Results 1 – 25 of 51) sorted by relevance

123

/external/clang/test/CodeGen/
Dunsigned-promotion.c10 unsigned char ci, cj, ck; variable
98 ci = cj + ck; in testcharadd()
120 ci = cj - ck; in testcharsub()
142 ci = cj * ck; in testcharmul()
/external/opencv3/3rdparty/openexr/Imath/
DImathEuler.h641 T cj = Math<T>::cos(angles.y); in toMatrix33() local
656 M[i][i] = cj; M[j][i] = sj*si; M[k][i] = sj*ci; in toMatrix33()
657 M[i][j] = sj*sh; M[j][j] = -cj*ss+cc; M[k][j] = -cj*cs-sc; in toMatrix33()
658 M[i][k] = -sj*ch; M[j][k] = cj*sc+cs; M[k][k] = cj*cc-ss; in toMatrix33()
662 M[i][i] = cj*ch; M[j][i] = sj*sc-cs; M[k][i] = sj*cc+ss; in toMatrix33()
663 M[i][j] = cj*sh; M[j][j] = sj*ss+cc; M[k][j] = sj*cs-sc; in toMatrix33()
664 M[i][k] = -sj; M[j][k] = cj*si; M[k][k] = cj*ci; in toMatrix33()
684 T cj = Math<T>::cos(angles.y); in toMatrix44() local
699 M[i][i] = cj; M[j][i] = sj*si; M[k][i] = sj*ci; in toMatrix44()
700 M[i][j] = sj*sh; M[j][j] = -cj*ss+cc; M[k][j] = -cj*cs-sc; in toMatrix44()
[all …]
/external/eigen/Eigen/src/Core/products/
DGeneralMatrixVector.h79 conj_helper<LhsScalar,RhsScalar,ConjugateLhs,ConjugateRhs> cj;
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));
[all …]
DGeneralBlockPanelKernel.h112 EIGEN_ALWAYS_INLINE static void run(const CJ& cj, A& a, B& b, C& c, T& /*t*/) in run()
114 c = cj.pmadd(a,b,c); in run()
119 EIGEN_ALWAYS_INLINE static void run(const CJ& cj, T& a, T& b, T& c, T& t)
121 t = b; t = cj.pmul(a,t); c = padd(c,t);
126 EIGEN_STRONG_INLINE void gebp_madd(const CJ& cj, A& a, B& b, C& c, T& t)
128 gebp_madd_selector<CJ,A,B,C,T>::run(cj,a,b,c,t);
294 r = cj.pmadd(c,alpha,r);
298 conj_helper<ResPacket,ResPacket,ConjLhs,false> cj;
387 c = cj.pmadd(a,b,c);
421 conj_helper<LhsScalar,RhsScalar,ConjLhs,ConjRhs> cj;
[all …]
DSelfadjointProduct.h27 internal::conj_if<ConjRhs> cj;
33 …+= (alpha * cj(vecY[i])) * ConjLhsType(OtherMap(vecX+(UpLo==Lower ? i : 0),UpLo==Lower ? size-i : …
/external/eigen/blas/
DPackedTriangularMatrixVector.h29 internal::conj_if<ConjRhs> cj;
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;
71 res[i] += alpha * cj(rhs[i]);
DPackedTriangularSolverVector.h27 internal::conj_if<Conjugate> cj;
40 rhs[i] /= cj(lhs[IsLower ? i : 0]);
55 internal::conj_if<Conjugate> cj;
65 rhs[i] /= cj(lhs[IsLower ? 0 : i]);
DGeneralRank1Update.h26 conj_if<ConjRhs> cj;
29 …Map<Matrix<Scalar,Dynamic,1> >(mat+stride*i,rows) += alpha * cj(v[i]) * ConjRhsType(OtherMap(u,row…
DPackedSelfadjointProduct.h29 conj_if<ConjRhs> cj;
33 …Map<Matrix<Scalar,Dynamic,1> >(mat, UpLo==Lower ? size-i : (i+1)) += alpha * cj(vec[i]) * ConjRhsT…
/external/llvm/test/CodeGen/ARM/
D2009-07-01-CommuteBug.ll70 %cj.811.i = phi i32 [ undef, %bb.nph.i98 ], [ %cj.11.i100, %bb218.i ] ; <i32> [#uses=3]
91 …%fj.4.i = phi i32 [ %cj.811.i, %bb167.i ], [ %cj.811.i, %bb158.i ], [ %fj.515.i, %bb160.i ], [ %cj…
96 %cj.9.i = select i1 undef, i32 %pj.317.i, i32 undef ; <i32> [#uses=0]
98 %cj.11.i100 = select i1 undef, i32 %fj.4.i, i32 undef ; <i32> [#uses=2]
103 store i32 %cj.11.i100, i32* %scevgep89.i, align 4
D2009-06-30-RegScavengerAssert4.ll75 %cj.811.i = phi i32 [ %6, %bb.nph.i98 ], [ %cj.11.i100, %bb218.i ] ; <i32> [#uses=3]
96 …%fj.4.i = phi i32 [ %cj.811.i, %bb167.i ], [ %cj.811.i, %bb158.i ], [ %fj.515.i, %bb160.i ], [ %cj…
101 %cj.11.i100 = select i1 undef, i32 %fj.4.i, i32 undef ; <i32> [#uses=1]
D2009-06-30-RegScavengerAssert3.ll92 %cj.9.i = select i1 undef, i32 %pj.317.i, i32 undef ; <i32> [#uses=0]
95 %cj.11.i100 = select i1 %6, i32 %fj.4.i, i32 %5 ; <i32> [#uses=1]
101 store i32 %cj.11.i100, i32* %scevgep89.i, align 4
/external/opencv3/modules/python/test/
Dtransformations.py1005 ci, cj, ck = math.cos(ai), math.cos(aj), math.cos(ak)
1011 M[i, i] = cj
1015 M[j, j] = -cj*ss+cc
1016 M[j, k] = -cj*cs-sc
1018 M[k, j] = cj*sc+cs
1019 M[k, k] = cj*cc-ss
1021 M[i, i] = cj*ck
1024 M[j, i] = cj*sk
1028 M[k, j] = cj*si
1029 M[k, k] = cj*ci
[all …]
/external/svox/pico_resources/tools/LingwareBuilding/PicoLingware_source_files/pkb/en-GB/
Den-GB_kh0_kdt_mgc2.pkb42 �yU`��[��MH���6�ld��Y�L�I�)81L %3�^cj�+�aXX�Ȓ�hIC%�
55 mU����9L�l3����������i�6����k�.��'��d<����,9�^cj���?���溅S���H9#FEH�9��C�a�6pv�N�;�
78 &5��PEj�x0�&E����BM����xJ'���h���k�m_����"��J0a|N�f 5�O���")�6Xcj�%D�9OH�%��xE�…
Den-GB_kh0_kdt_mgc1.pkb26 …�����/�^�j�aFl&c6��E�{���P2�^���b&Rr�ͳ�ጰg�&-��Rg3͡�Q+FZ��ifE�Y��6Xcj�RZɃ5Ŵ6�t�=�m�ׂ8��…
/external/llvm/test/Transforms/LoopRotate/
Ddbgvalue.ll88 …e: "/Volumes/Lalgate/cj/llvm/projects/llvm-test/SingleSource/Benchmarks/BenchmarkGame/recursive.c"…
105 …e: "/Volumes/Lalgate/cj/llvm/projects/llvm-test/SingleSource/Benchmarks/BenchmarkGame/recursive.c"…
/external/opencv3/modules/imgproc/src/
Demd.cpp305 int cj = state.idx2[j]; in cvCalcEMD2() local
307 if( ci >= 0 && cj >= 0 ) in cvCalcEMD2()
311 ((float*)(flow->data.ptr + flow->step*ci))[cj] = val; in cvCalcEMD2()
497 int cj = state->idx2[j]; in icvInitEMD() local
498 if( cj < 0 ) in icvInitEMD()
506 signature2 + cj * (dims + 1) + 1, in icvInitEMD()
512 val = cost[cost_step*ci + cj]; in icvInitEMD()
/external/opencv/cv/src/
Dcvemd.cpp309 int cj = state.idx2[j]; in cvCalcEMD2() local
311 if( xp != state.enter_x && ci >= 0 && cj >= 0 ) in cvCalcEMD2()
315 ((float*)(flow->data.ptr + flow->step*ci))[cj] = val; in cvCalcEMD2()
517 int cj = state->idx2[j]; in icvInitEMD() local
518 if( cj < 0 ) in icvInitEMD()
526 signature2 + cj * (dims + 1) + 1, in icvInitEMD()
532 val = cost[cost_step*ci + cj]; in icvInitEMD()
/external/v8/test/cctest/compiler/
Dcodegen-tester.h344 void Run(const Ci& ci, const Cj& cj, const Fn& fn) { in Run() argument
348 for (j = cj.begin(); j != cj.end(); ++j) { in Run()
/external/eigen/test/
Dpacketmath.cpp313 internal::conj_helper<Scalar,Scalar,ConjLhs,ConjRhs> cj; in test_conj_helper() local
319 VERIFY(internal::isApprox(ref[i], cj.pmul(data1[i],data2[i])) && "conj_helper pmul"); in test_conj_helper()
328 VERIFY(internal::isApprox(ref[i], cj.pmadd(data1[i],data2[i],tmp)) && "conj_helper pmadd"); in test_conj_helper()
/external/svox/pico_resources/tools/LingwareBuilding/PicoLingware_source_files/pkb/it-IT/
Dit-IT_cm0_kdt_mgc1.pkb21 �'i��M�HtC�`����u�����~<��`�+<9�0m�������OͅhI��̿��?����&�>��cj'�´f�S�������~4i�B�>�D��a…
/external/opencv3/modules/ml/src/
Dsvm.cpp1449 int cj = class_ranges[j+1] - class_ranges[j]; in do_train() local
1450 if( nu*(ci + cj)*0.5 > std::min( ci, cj ) ) in do_train()
1465 int sj = class_ranges[j], cj = class_ranges[j+1] - sj; in do_train() local
1468 temp_samples.create(ci + cj, _samples.cols, _samples.type()); in do_train()
1469 sidx.resize(ci + cj); in do_train()
1470 temp_y.resize(ci + cj); in do_train()
1473 for( k = 0; k < ci+cj; k++ ) in do_train()
1501 for( k = 0; k < ci + cj; k++ ) in do_train()
/external/opencv3/modules/stitching/src/
Dseam_finders.cpp340 for (int cj = ci+1; cj < ncomps_; ++cj) in findEdges() local
342 wedges[std::make_pair(ci, cj)] = 0; in findEdges()
343 wedges[std::make_pair(cj, ci)] = 0; in findEdges()
385 for (int cj = ci+1; cj < ncomps_; ++cj) in findEdges() local
387 std::map<std::pair<int, int>, int>::iterator itr = wedges.find(std::make_pair(ci, cj)); in findEdges()
391 itr = wedges.find(std::make_pair(cj, ci)); in findEdges()
/external/libcxx/src/
Ddebug.cpp423 __c_node* cj = j != nullptr ? j->__c_ : nullptr; in __less_than_comparable() local
424 return ci != nullptr && ci == cj; in __less_than_comparable()
/external/opencv/ml/src/
Dmlsvm.cpp1408 int cj = class_ranges[j+1] - class_ranges[j]; in do_train() local
1409 if( params.nu*(ci + cj)*0.5 > MIN( ci, cj ) ) in do_train()
1424 int sj = class_ranges[j], cj = class_ranges[j+1] - sj; in do_train() local
1434 for( k = 0; k < cj; k++ ) in do_train()
1446 if( !train1( ci + cj, var_count, temp_samples, temp_y, in do_train()
1450 for( k = 0; k < ci + cj; k++ ) in do_train()
1470 for( k = 0; k < cj; k++ ) in do_train()

123