/external/libcxx/test/containers/associative/multimap/multimap.cons/ |
H A D | move_assign.pass.cpp | 59 M m2(I(a2), I(a2+sizeof(a2)/sizeof(a2[0])), C(5), A(7)); 62 assert(m3 == m2); 99 M m2(I(a2), I(a2+sizeof(a2)/sizeof(a2[0])), C(5), A(7)); 102 assert(m3 == m2); 139 M m2(I(a2), I(a2+sizeof(a2)/sizeof(a2[0])), C(5), A(7)); 142 assert(m3 == m2); 180 M m2(I(a2), I(a2+sizeof(a2)/sizeof(a2[0])), C(5), A()); 183 assert(m3 == m2);
|
/external/libcxx/test/containers/associative/multiset/multiset.cons/ |
H A D | move_assign.pass.cpp | 58 M m2(I(a2), I(a2+sizeof(a2)/sizeof(a2[0])), C(5), A(7)); 61 assert(m3 == m2); 97 M m2(I(a2), I(a2+sizeof(a2)/sizeof(a2[0])), C(5), A(7)); 100 assert(m3 == m2); 136 M m2(I(a2), I(a2+sizeof(a2)/sizeof(a2[0])), C(5), A(7)); 139 assert(m3 == m2); 177 M m2(I(a2), I(a2+sizeof(a2)/sizeof(a2[0])), C(5), A()); 180 assert(m3 == m2);
|
/external/libcxx/test/containers/associative/set/set.cons/ |
H A D | move_assign.pass.cpp | 58 M m2(I(a2), I(a2+sizeof(a2)/sizeof(a2[0])), C(5), A(7)); 61 assert(m3 == m2); 97 M m2(I(a2), I(a2+sizeof(a2)/sizeof(a2[0])), C(5), A(7)); 100 assert(m3 == m2); 136 M m2(I(a2), I(a2+sizeof(a2)/sizeof(a2[0])), C(5), A(7)); 139 assert(m3 == m2); 176 M m2(I(a2), I(a2+sizeof(a2)/sizeof(a2[0])), C(5), A()); 179 assert(m3 == m2);
|
/external/skia/tests/ |
H A D | MessageBusTest.cpp | 23 const TestMessage m2 = { 6, 4.3f }; local 25 SkMessageBus<TestMessage>::Post(m2);
|
/external/chromium_org/third_party/libvpx/source/libvpx/vp9/encoder/x86/ |
H A D | vp9_subtract_sse2.asm | 40 punpckhbw m2, m0, m7 44 psubw m2, m3 53 mova [diffq+mmsize*1+%5], m2 93 movh m2, [srcq+src_strideq] 98 punpcklbw m2, m7 101 psubw m2, m3 103 mova [diffq+diff_strideq*2], m2
|
/external/libvpx/libvpx/vp9/encoder/x86/ |
H A D | vp9_subtract_sse2.asm | 40 punpckhbw m2, m0, m7 44 psubw m2, m3 53 mova [diffq+mmsize*1+%5], m2 93 movh m2, [srcq+src_strideq] 98 punpcklbw m2, m7 101 psubw m2, m3 103 mova [diffq+diff_strideq*2], m2
|
/external/speex/libspeex/ |
H A D | kiss_fft.c | 97 const size_t m2=2*m; local 111 C_MUL(scratch[1],Fout[m2] , *tw2 ); 118 C_SUB( Fout[m2], *Fout, scratch[3] ); 141 C_MUL4(scratch[1],Fout[m2] , *tw2 ); 150 Fout[m2].r = PSHR16(Fout[m2].r, 2); 151 Fout[m2].i = PSHR16(Fout[m2].i, 2); 152 C_SUB( Fout[m2], *Fout, scratch[3] ); 176 const size_t m2 local [all...] |
/external/chromium_org/third_party/opus/src/celt/ |
H A D | kiss_fft.c | 123 const size_t m2=2*m; local 135 C_MUL4(scratch[1],Fout[m2] , *tw2 ); 144 C_SUB( Fout[m2], *Fout, scratch[3] ); 170 const size_t m2=2*m; local 182 C_MULC(scratch[1],Fout[m2] , *tw2 ); 189 C_SUB( Fout[m2], *Fout, scratch[3] ); 217 const size_t m2 = 2*m; local 230 C_FIXDIV(*Fout,3); C_FIXDIV(Fout[m],3); C_FIXDIV(Fout[m2],3); 233 C_MUL(scratch[2],Fout[m2] , *tw2); 247 Fout[m2] 268 const size_t m2 = 2*m; local 611 int m2, m; local 670 int m2, m; local [all...] |
/external/libopus/celt/ |
H A D | kiss_fft.c | 123 const size_t m2=2*m; local 135 C_MUL4(scratch[1],Fout[m2] , *tw2 ); 144 C_SUB( Fout[m2], *Fout, scratch[3] ); 170 const size_t m2=2*m; local 182 C_MULC(scratch[1],Fout[m2] , *tw2 ); 189 C_SUB( Fout[m2], *Fout, scratch[3] ); 217 const size_t m2 = 2*m; local 230 C_FIXDIV(*Fout,3); C_FIXDIV(Fout[m],3); C_FIXDIV(Fout[m2],3); 233 C_MUL(scratch[2],Fout[m2] , *tw2); 247 Fout[m2] 268 const size_t m2 = 2*m; local 611 int m2, m; local 670 int m2, m; local [all...] |
/external/eigen/test/ |
H A D | basicstuff.cpp | 27 m2 = MatrixType::Random(rows, cols), local 83 VERIFY_RAISES_ASSERT(m1 = (m2.block(0,0, rows-1, cols-1))); 102 VERIFY(m1!=m2); 103 VERIFY(!(m1==m2)); 105 m1 = m2; 106 VERIFY(m1==m2); 107 VERIFY(!(m1!=m2)); 172 Matrix4f m = Matrix4f::Random(), m2; local 175 m2 = m.cast<float>(); // check the specialization when NewType == Type 176 VERIFY(m.isApprox(m2)); [all...] |
H A D | diagonalmatrices.cpp | 27 m2 = MatrixType::Random(rows, cols); local 59 VERIFY_IS_APPROX( ((ldm1 * (m1+m2))(i,j)) , ldm1.diagonal()(i) * (m1+m2)(i,j) ); 64 VERIFY_IS_APPROX( (((v1+v2).asDiagonal() * (m1+m2))(i,j)) , (v1+v2)(i) * (m1+m2)(i,j) ); 66 VERIFY_IS_APPROX( (((m1+m2) * (rv1+rv2).asDiagonal())(i,j)) , (rv1+rv2)(j) * (m1+m2)(i,j) );
|
H A D | ref.cpp | 53 m2 = m1; local 67 m2.block(i,j,brows,bcols).setOnes(); 68 VERIFY_IS_EQUAL(m1, m2); 70 m2.block(i,j,brows,bcols).setRandom(); 71 rm2 = m2.block(i,j,brows,bcols); 72 VERIFY_IS_EQUAL(m1, m2); 77 m2.block(i,j,brows,bcols) *= 2; 78 VERIFY_IS_EQUAL(rm3, m2.block(i,j,brows,bcols)); 80 VERIFY_IS_EQUAL(rm4, m2.real()); 82 m2 [all...] |
/external/nanopb-c/ |
H A D | pb.h | 367 #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, m2) \ [all...] |
/external/eigen/unsupported/test/ |
H A D | matrix_exponential.cpp | 105 MatrixType m1(rows, cols), m2(rows, cols), identity = MatrixType::Identity(rows, cols); 112 m2 = m1.matrixFunction(expfn) * (-m1).matrixFunction(expfn); 113 std::cout << "randomTest: error funm = " << relerr(identity, m2); 114 VERIFY(identity.isApprox(m2, static_cast<RealScalar>(tol))); 116 m2 = m1.exp() * (-m1).exp(); 117 std::cout << " error expm = " << relerr(identity, m2) << "\n"; 118 VERIFY(identity.isApprox(m2, static_cast<RealScalar>(tol)));
|
/external/chromium_org/chrome/browser/history/ |
H A D | scored_history_match.cc | 225 const ScoredHistoryMatch& m2) { 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) 243 if (m1.url_info.typed_count() != m2.url_info.typed_count()) 244 return m1.url_info.typed_count() > m2.url_info.typed_count(); 249 if (m1.IsHostOnly() != m2.IsHostOnly()) 254 if (m1.url_info.visit_count() != m2 224 MatchScoreGreater(const ScoredHistoryMatch& m1, const ScoredHistoryMatch& m2) argument [all...] |
/external/chromium_org/components/omnibox/ |
H A D | autocomplete_match_unittest.cc | 26 AutocompleteMatch m2(NULL, 0, false, 31 m2.relevance = cases[i].r2; 33 AutocompleteMatch::MoreRelevant(m1, m2));
|
/external/bison/lib/ |
H A D | isnan.c | 163 memory_double m2; 166 memset (&m2.value, 0, SIZE); 168 m2.value = x + (x ? 0.0L : -0.0L); 169 if (memcmp (&m1.value, &m2.value, SIZE) != 0)
|
/external/chromium_org/v8/test/mjsunit/es6/ |
H A D | math-fround.js | 108 for (var m2 = 0; m2 < (1 << 29); m2 += m2inc) { 109 var float = new ieee754float(sign, exp, m1, m2);
|
/external/clang/test/CXX/dcl.dcl/dcl.attr/dcl.attr.depend/ |
H A D | p1.cpp | 4 [[carries_dependency]] [[carries_dependency]] int m2(); // ok
|
/external/clang/test/SemaCXX/ |
H A D | borland-extensions.cpp | 26 void m2() { function
|
H A D | cxx0x-initializer-aggregates.cpp | 49 int m2; member in struct:aggregate::A 59 String m2; member in struct:aggregate::B
|
/external/eigen/test/eigen2/ |
H A D | eigen2_basicstuff.cpp | 23 m2 = MatrixType::Random(rows, cols), local 80 VERIFY_RAISES_ASSERT(m1 = (m2.block(0,0, rows-1, cols-1))); 89 m1.swap(m2); 90 VERIFY_IS_APPROX(m3, m2);
|
/external/clang/test/CXX/class/class.union/ |
H A D | p1.cpp | 56 } m2; // expected-error {{union member 'm2' has a non-trivial copy constructor}} member in union:U2 81 } m2; // expected-error {{union member 'm2' has a non-trivial copy constructor}} member in union:U3
|
/external/iproute2/tc/ |
H A D | q_hfsc.c | 46 "SC := [ [ m1 BPS ] d SEC ] m2 BPS\n" 50 " m2 : slope of second segment\n" 234 fprintf(f, "m2 %s ", sprint_rate(sc->m2, b1)); 297 unsigned int m1 = 0, d = 0, m2 = 0; local 317 if (matches(*argv, "m2") == 0) { 319 if (get_rate(&m2, *argv) < 0) { 320 explain1("m2"); 328 sc->m2 = m2; [all...] |
/external/kernel-headers/original/uapi/linux/ |
H A D | mroute.h | 51 #define VIFM_SAME(m1,m2) ((m1)==(m2))
|