Searched refs:m1 (Results 151 - 175 of 378) sorted by relevance

1234567891011>>

/external/eigen/test/
H A Dspecial_numbers.cpp22 MatType m1 = MatType::Random(rows,cols), local
35 VERIFY(!m1.hasNaN());
36 VERIFY(m1.allFinite());
H A Dexceptions.cpp100 MatrixType m0(n,n), m1(n,n), m2(n,n);
102 m0.setOnes(); m1.setOnes(); m2.setOnes();
103 CHECK_MEMLEAK(v0 = m0 * m1 * v1);
104 CHECK_MEMLEAK(m2 = m0 * m1 * m2);
H A Dmiscmatrices.cpp25 MatrixType m1 = MatrixType::Ones(rows,cols); local
26 VERIFY_IS_APPROX(m1(r,c), static_cast<Scalar>(1));
H A Dref.cpp52 MatrixType m1 = MatrixType::Random(rows, cols), local
53 m2 = m1;
60 RefMat rm0 = m1;
61 VERIFY_IS_EQUAL(rm0, m1);
62 RefDynMat rm1 = m1;
63 VERIFY_IS_EQUAL(rm1, m1);
64 RefDynMat rm2 = m1.block(i,j,brows,bcols);
65 VERIFY_IS_EQUAL(rm2, m1.block(i,j,brows,bcols));
68 VERIFY_IS_EQUAL(m1, m2);
72 VERIFY_IS_EQUAL(m1, m
[all...]
H A Dsparse_vector.cpp22 SparseMatrixType m1(rows,rows);
31 initSparse<Scalar>(densityMat, refM1, m1);
74 VERIFY_IS_APPROX(v1.dot(m1*v2), refV1.dot(refM1*refV2));
76 VERIFY_IS_APPROX(v1.dot(m1.col(i)), refV1.dot(refM1.col(i)));
/external/clang/test/CXX/expr/expr.prim/expr.prim.lambda/
H A Dp12.cpp52 auto m1 = [=]{ local
/external/clang/test/CodeGenCXX/
H A Dcopy-constructor-synthesis.cpp30 printf("iM = %d iN = %d, m1.iM = %d\n", iM, iN, m1.iM);
37 M m1; member in struct:X
99 XM m1 = m0; local
100 m1.pr();
H A Dconstructor-init.cpp30 d1(3.4567), i1(1234), m1(100) { printf("N()\n"); }
31 M m1; member in struct:N
58 M m1; local
/external/chromium_org/chrome/browser/history/
H A Dscored_history_match.cc224 bool ScoredHistoryMatch::MatchScoreGreater(const ScoredHistoryMatch& m1, argument
226 if (m1.raw_score_ != m2.raw_score_)
227 return m1.raw_score_ > m2.raw_score_;
234 if (!m1.url_info.typed_count() != !m2.url_info.typed_count())
235 return m1.url_info.typed_count() > m2.url_info.typed_count();
239 if (m1.innermost_match != m2.innermost_match)
240 return m1.innermost_match;
243 if (m1.url_info.typed_count() != m2.url_info.typed_count())
244 return m1.url_info.typed_count() > m2.url_info.typed_count();
248 if (m1
[all...]
/external/openssl/crypto/bn/asm/
H A Dalpha-mont.pl41 $m1="s5";
92 mulq $lo0,$n0,$m1
94 mulq $hi1,$m1,$lo1
95 umulh $hi1,$m1,$hi1
106 mulq $nj,$m1,$nlo
108 umulh $nj,$m1,$nhi
123 mulq $nj,$m1,$nlo
133 umulh $nj,$m1,$nhi
180 mulq $lo0,$n0,$m1
182 mulq $hi1,$m1,
[all...]
/external/bison/src/
H A Duniqstr.c113 hash_compare_uniqstr (void const *m1, void const *m2)
115 return strcmp (m1, m2) == 0;
112 hash_compare_uniqstr(void const *m1, void const *m2) argument
/external/chromium_org/third_party/skia/tests/
H A DMessageBusTest.cpp22 const TestMessage m1 = { 5, 4.2f }; local
24 SkMessageBus<TestMessage>::Post(m1);
/external/eigen/test/eigen2/
H A Deigen2_miscmatrices.cpp26 MatrixType m1 = MatrixType::Ones(rows,cols); local
27 VERIFY_IS_APPROX(m1(r,c), static_cast<Scalar>(1));
H A Deigen2_sum.cpp19 MatrixType m1 = MatrixType::Random(rows, cols); local
24 for(int i = 0; i < rows; i++) for(int j = 0; j < cols; j++) x += m1(i,j);
25 VERIFY_IS_APPROX(m1.sum(), x);
/external/skia/tests/
H A DMessageBusTest.cpp22 const TestMessage m1 = { 5, 4.2f }; local
24 SkMessageBus<TestMessage>::Post(m1);
/external/eigen/unsupported/test/
H A DBVH.cpp131 double m1 = (std::numeric_limits<double>::max)(), m2 = m1; local
134 m1 = (std::min)(m1, i1.minimumOnObject(b[i]));
138 VERIFY_IS_APPROX(m1, m2);
182 double m1 = (std::numeric_limits<double>::max)(), m2 = m1; local
186 m1 = (std::min)(m1, i1.minimumOnObjectObject(b[i], v[j]));
190 VERIFY_IS_APPROX(m1, m
[all...]
/external/nanopb-c/
H A Dpb.h367 #define pb_delta(st, m1, m2) ((int)offsetof(st, m1) - (int)offsetof(st, m2))
373 #define PB_DATAOFFSET_FIRST(st, m1, m2) (offsetof(st, m1))
375 #define PB_DATAOFFSET_OTHER(st, m1, m2) (offsetof(st, m1) - offsetof(st, m2) - pb_membersize(st, m2))
376 /* Choose first/other based on m1 == m2 (deprecated, remains for backwards compatibility) */
377 #define PB_DATAOFFSET_CHOOSE(st, m1, m2) (int)(offsetof(st, m1) == offsetof(st, m2) \
378 ? PB_DATAOFFSET_FIRST(st, m1, m
[all...]
/external/valgrind/main/cachegrind/
H A Dcg_main.c85 ULong m1; /* misses in the first level cache */ member in struct:__anon32351
277 lineCC->Ir.m1 = 0;
280 lineCC->Dr.m1 = 0;
283 lineCC->Dw.m1 = 0;
343 &n->parent->Ir.m1, &n->parent->Ir.mL);
353 &n->parent->Ir.m1, &n->parent->Ir.mL);
365 &n->parent->Ir.m1, &n->parent->Ir.mL);
368 &n2->parent->Ir.m1, &n2->parent->Ir.mL);
382 &n->parent->Ir.m1, &n->parent->Ir.mL);
385 &n2->parent->Ir.m1,
[all...]
/external/chromium_org/third_party/boringssl/src/crypto/bn/
H A Dinternal.h223 BN_ULONG m, m1, lt, ht; \
229 m1 = (bl) * (ht); \
231 m = (m + m1) & BN_MASK2; \
232 if (m < m1) \
235 m1 = L2HBITS(m); \
236 lt = (lt + m1) & BN_MASK2; \
237 if (lt < m1) \
/external/eigen/bench/
H A Dsparse_cholesky.cpp103 DenseMatrix m1(rows,cols);
104 eiToDense(sm1, m1);
105 m1 = (m1 + m1.transpose()).eval();
106 m1.diagonal() *= 0.5;
108 // BENCH(LLT<DenseMatrix> chol(m1);)
113 LLT<DenseMatrix> chol(m1);
122 // std::cout << "dense:\n" << m1 << "\n\n" << chol.matrixL() << endl;
H A Dsparse_lu.cpp96 DenseMatrix m1(rows,cols);
97 eiToDense(sm1, m1);
101 FullPivLU<DenseMatrix> lu(m1);
/external/chromium_org/third_party/libvpx/source/libvpx/vp9/encoder/x86/
H A Dvp9_quantize_ssse3_x86_64.asm35 mova m1, [roundq] ; m1 = round
43 paddw m1, m5
45 psrlw m1, 1 ; m1 = (m1 + 1) / 2
73 paddsw m6, m1 ; m6 += round
74 punpckhqdq m1, m1
75 paddsw m11, m1 ; m1
[all...]
/external/bison/lib/
H A Disnan.c162 memory_double m1;
165 memset (&m1.value, 0, SIZE);
167 m1.value = x;
169 if (memcmp (&m1.value, &m2.value, SIZE) != 0)
/external/chromium_org/v8/test/mjsunit/es6/
H A Dmath-fround.js107 for (var m1 = 0; m1 < (1 << 23); m1 += m1inc) {
109 var float = new ieee754float(sign, exp, m1, m2);
/external/clang/test/CXX/dcl.dcl/dcl.attr/dcl.attr.depend/
H A Dp1.cpp3 [[carries_dependency, carries_dependency]] int m1(); // expected-error {{attribute 'carries_dependency' cannot appear multiple times in an attribute specifier}}

Completed in 7078 milliseconds

1234567891011>>