| /external/freetype/src/gzip/ |
| adler32.c | 14 #define DO1(buf,i) {s1 += buf[i]; s2 += s1;}
27 unsigned long s2 = (adler >> 16) & 0xffff; local
42 s2 += s1;
45 s2 %= BASE;
47 return (s2 << 16) | s1;
|
| /external/libcxx/test/containers/unord/unord.multimap/unord.multimap.cnstr/ |
| assign_move.pass.cpp | 298 std::unordered_multimap<int, int> s2; local
299 s2 = std::move(s1);
301 s2.erase(i);
302 assert(s2.size() == 2);
|
| move.pass.cpp | 236 std::unordered_multimap<int, int> s2 = std::move(s1); local
238 s2.erase(i);
239 assert(s2.size() == 2);
|
| /external/libcxx/test/utilities/memory/unique.ptr/unique.ptr.runtime/ |
| move03.fail.cpp | 49 std::unique_ptr<A, Deleter> s2; local
50 s2 = s;
51 assert(s2.get() == p);
|
| move04.fail.cpp | 49 std::unique_ptr<A, Deleter> s2; local
50 s2 = s;
51 assert(s2.get() == p);
|
| /external/libcxx/test/utilities/memory/unique.ptr/unique.ptr.runtime/unique.ptr.runtime.ctor/ |
| move01.pass.cpp | 55 std::unique_ptr<A[]> s2 = std::move(s); local
56 assert(s2.get() == p);
64 std::unique_ptr<A[], Deleter<A[]> > s2 = std::move(s); local
65 assert(s2.get() == p);
68 assert(s2.get_deleter().state() == 5);
76 std::unique_ptr<A[], NCDeleter&> s2 = std::move(s); local
77 assert(s2.get() == p);
81 assert(s2.get_deleter().state() == d.state());
|
| move03.fail.cpp | 49 std::unique_ptr<A[], Deleter> s2 = s; local
50 assert(s2.get() == p);
|
| move04.fail.cpp | 49 std::unique_ptr<A[], Deleter> s2 = s; local
50 assert(s2.get() == p);
|
| move_convert06.fail.cpp | 67 std::unique_ptr<A[], CDeleter<A>&> s2 = s; local
68 assert(s2.get() == p);
73 assert(s2.get_deleter().state() == d.state());
|
| move_convert12.fail.cpp | 67 std::unique_ptr<A[], CDeleter<A>&> s2 = s; local
68 assert(s2.get() == p);
73 assert(s2.get_deleter().state() == d.state());
|
| move_convert18.fail.cpp | 67 std::unique_ptr<A[], CDeleter<A>&> s2 = std::move(s); local
68 assert(s2.get() == p);
73 assert(s2.get_deleter().state() == d.state());
|
| /external/libcxx/test/utilities/memory/unique.ptr/unique.ptr.single/unique.ptr.single.asgn/ |
| move03.fail.cpp | 49 std::unique_ptr<A, Deleter> s2; local
50 s2 = s;
51 assert(s2.get() == p);
|
| move04.fail.cpp | 49 std::unique_ptr<A, Deleter> s2; local
50 s2 = s;
51 assert(s2.get() == p);
|
| /external/libcxx/test/utilities/memory/unique.ptr/unique.ptr.single/unique.ptr.single.ctor/ |
| move03.fail.cpp | 49 std::unique_ptr<A, Deleter> s2 = s; local
50 assert(s2.get() == p);
|
| move04.fail.cpp | 49 std::unique_ptr<A, Deleter> s2 = s; local
50 assert(s2.get() == p);
|
| move_convert06.fail.cpp | 67 std::unique_ptr<A, CDeleter<A>&> s2 = s; local
68 assert(s2.get() == p);
73 assert(s2.get_deleter().state() == d.state());
|
| move_convert06.pass.cpp | 67 std::unique_ptr<A, CDeleter<A>&> s2 = std::move(s); local
68 assert(s2.get() == p);
73 assert(s2.get_deleter().state() == d.state());
|
| move_convert12.fail.cpp | 67 std::unique_ptr<A, CDeleter<A>&> s2 = s; local
68 assert(s2.get() == p);
73 assert(s2.get_deleter().state() == d.state());
|
| /external/libcxx/test/utilities/time/time.duration/time.duration.literals/ |
| literals.pass.cpp | 41 auto s2 = 24.0s; local
42 assert ( s == s2 );
|
| literals1.pass.cpp | 30 auto s2 = 24.0s; local
31 assert ( s == s2 );
|
| literals2.pass.cpp | 33 auto s2 = 24.0s; local
34 assert ( s == s2 );
|
| /external/openssl/crypto/des/ |
| des3s.cpp | 40 unsigned long s1,s2,e1,e2; local
54 GetTSC(s2);
64 e1-s1,e2-s2,((e2-s2)-(e1-s1)));
|
| dess.cpp | 40 unsigned long s1,s2,e1,e2; local
54 GetTSC(s2);
64 e1-s1,e2-s2,((e2-s2)-(e1-s1)));
|
| /external/srec/tools/thirdparty/OpenFst/fst/lib/ |
| equal.h | 46 StateId s2 = siter2.Value(); local
47 if (s1 != s2) {
50 << ", state2 = " << s2; local
54 Weight final2 = fst2.Final(s2);
63 ArcIterator< Fst<Arc> > aiter2(fst2, s2);
106 CHECK_EQ(fst1.NumArcs(s1), fst2.NumArcs(s2));
107 CHECK_EQ(fst1.NumInputEpsilons(s1), fst2.NumInputEpsilons(s2));
108 CHECK_EQ(fst1.NumOutputEpsilons(s1), fst2.NumOutputEpsilons(s2));
|
| statesort.h | 54 StateId s1 = siter.Value(), s2; local
63 for (; !done[s1]; s1 = s2, final1 = final2, swap(arcs1, arcs2)) {
64 s2 = order[s1];
65 if (!done[s2]) {
66 final2 = fst->Final(s2);
68 for (ArcIterator< MutableFst<Arc> > aiter(*fst, s2);
73 fst->SetFinal(s2, final1);
74 fst->DeleteArcs(s2);
78 fst->AddArc(s2, arc);
|
