Searched defs:s2 (Results 76 - 100 of 846) sorted by relevance

1234567891011>>

/external/chromium_org/extensions/common/
H A Derror_utils.cc21 const std::string& s2) {
24 ReplaceFirstSubstringAfterOffset(&ret_val, 0, "*", s2);
30 const std::string& s2,
34 ReplaceFirstSubstringAfterOffset(&ret_val, 0, "*", s2);
46 const std::string& s2) {
47 return base::UTF8ToUTF16(FormatErrorMessage(format, s1, s2));
52 const std::string& s2,
54 return base::UTF8ToUTF16(FormatErrorMessage(format, s1, s2, s3));
19 FormatErrorMessage(const std::string& format, const std::string& s1, const std::string& s2) argument
28 FormatErrorMessage(const std::string& format, const std::string& s1, const std::string& s2, const std::string& s3) argument
44 FormatErrorMessageUTF16(const std::string& format, const std::string& s1, const std::string& s2) argument
50 FormatErrorMessageUTF16(const std::string& format, const std::string& s1, const std::string& s2, const std::string& s3) argument
/external/chromium_org/ppapi/native_client/src/untrusted/pnacl_irt_shim/
H A Dshim_ppapi.c17 static int mystrcmp(const char* s1, const char *s2) { argument
18 while((*s1 && *s2) && (*s1++ == *s2++));
19 return *(--s1) - *(--s2);
/external/chromium_org/third_party/brotli/src/brotli/enc/
H A Dfind_match_length.h30 const uint8_t* s2,
35 if (PREDICT_FALSE(BROTLI_UNALIGNED_LOAD64(s2) ==
37 s2 += 8;
41 BROTLI_UNALIGNED_LOAD64(s2) ^ BROTLI_UNALIGNED_LOAD64(s1 + matched);
49 if (PREDICT_TRUE(s1[matched] == *s2)) {
50 ++s2;
60 const uint8_t* s2,
63 const uint8_t* s2_limit = s2 + limit;
64 const uint8_t* s2_ptr = s2;
29 FindMatchLengthWithLimit(const uint8_t* s1, const uint8_t* s2, size_t limit) argument
/external/chromium_org/third_party/skia/experimental/Intersection/
H A DIntersections.cpp11 void Intersections::insertCoincidentPair(double s1, double e1, double s2, double e2, argument
14 remove(s2, e2, startPt, endPt);
51 bool s2in = between(cs2, s2, ce2) || startPt.approximatelyEqual(fPt[i2])
70 if (s2 > e2) {
74 if (s2 < cs2) {
75 fT[fSwap ^ 1][i2] = s2;
79 if (s2 > ce2) {
80 fT[fSwap ^ 1][iEnd2] = s2;
88 insertCoincident(s1, s2, startPt);
/external/chromium_org/v8/test/webkit/
H A Dclosure-inside-extra-arg-call.js70 function s2() { function
76 s2();
H A Dregexp-zero-length-alternatives.js30 var s2 = "aaaa"; variable
41 shouldBe('s2.match(re1)', '["aaaa"]');
48 shouldBe('s2.match(re2)', '["aaaa"]');
55 shouldBe('s2.match(re3)', '["aaaa"]');
62 shouldBe('s2.match(re4)', '["aaaa", "a"]');
69 shouldBe('s2.match(re5)', '["aaaa", "a"]');
76 shouldBe('s2.match(re6)', '["aaaa", "a"]');
83 shouldBe('s2.match(re7)', '["aaa"]');
90 shouldBe('s2.match(re8)', '["aaaa"]');
97 shouldBe('s2
[all...]
/external/clang/test/PCH/
H A Dcheck-deserializations.cpp25 S2 *s2; variable
/external/clang/test/Sema/
H A Darm-layout.c21 struct s2 { struct
27 check(s2_size, sizeof(struct s2) == 8);
28 check(s2_offset_0, __builtin_offsetof(struct s2, field0) == 0);
29 check(s2_offset_1, __builtin_offsetof(struct s2, field2) == 7);
31 check(s2_size, sizeof(struct s2) == 6);
32 check(s2_offset_0, __builtin_offsetof(struct s2, field0) == 0);
33 check(s2_offset_1, __builtin_offsetof(struct s2, field2) == 5);
H A Dpragma-align-packed.c19 struct s2 { struct
23 extern int a[sizeof(struct s2) == 5 ? 1 : -1];
H A Dpragma-pack-5.c23 struct s2 { struct
29 extern int check[sizeof(struct s2) == 6 ? 1 : -1];
H A Dpragma-pack-and-options-align.c28 struct s2 { struct
32 extern int a[sizeof(struct s2) == 5 ? 1 : -1];
/external/compiler-rt/test/msan/Linux/
H A Dsunrpc_string.cc28 char s2[20]; local
29 char *sp2 = s2;
30 res = xdr_string(&xdrs, &sp2, sizeof(s2));
32 assert(strcmp(s, s2) == 0);
/external/fio/lib/
H A Drand.h7 unsigned int s1, s2, s3; member in struct:frand_state
15 state->s2 = TAUSWORTHE(state->s2, 2, 25, 4294967288UL, 4);
18 return (state->s1 ^ state->s2 ^ state->s3);
/external/libcxx/test/containers/unord/unord.map/unord.map.cnstr/
H A Dassign_move.pass.cpp221 std::unordered_map<int, int> s2; local
222 s2 = std::move(s1);
224 s2.erase(i);
225 assert(s2.size() == 2);
H A Dmove.pass.cpp192 std::unordered_map<int, int> s2 = std::move(s1); local
194 s2.erase(i);
195 assert(s2.size() == 2);
/external/libcxx/test/containers/unord/unord.multiset/unord.multiset.cnstr/
H A Dassign_move.pass.cpp278 std::unordered_multiset<int> s2; local
279 s2 = std::move(s1);
281 s2.erase(i);
282 assert(s2.size() == 2);
H A Dmove.pass.cpp187 std::unordered_multiset<int> s2 = std::move(s1); local
189 s2.erase(i);
190 assert(s2.size() == 2);
/external/libcxx/test/containers/unord/unord.set/unord.set.cnstr/
H A Dassign_move.pass.cpp217 std::unordered_set<int> s2; local
218 s2 = std::move(s1);
220 s2.erase(i);
221 assert(s2.size() == 2);
H A Dmove.pass.cpp187 std::unordered_set<int> s2 = std::move(s1); local
189 s2.erase(i);
190 assert(s2.size() == 2);
/external/libcxx/test/utilities/memory/unique.ptr/unique.ptr.runtime/
H A Dmove_convert01.fail.cpp47 std::unique_ptr<A[]> s2; local
48 s2 = s;
49 assert(s2.get() == p);
H A Dmove_convert02.fail.cpp49 boost::unique_ptr<A[], Deleter<A> > s2; local
50 s2 = s;
51 assert(s2.get() == p);
55 assert(s2.get_deleter().state() == 5);
H A Dmove_convert04.fail.cpp47 boost::unique_ptr<A[]> s2; local
48 s2 = s;
49 assert(s2.get() == p);
H A Dmove_convert05.fail.cpp49 boost::unique_ptr<A[], Deleter<A> > s2; local
50 s2 = s;
51 assert(s2.get() == p);
55 assert(s2.get_deleter().state() == 5);
/external/libcxx/test/utilities/memory/unique.ptr/unique.ptr.runtime/unique.ptr.runtime.ctor/
H A Dmove_convert04.fail.cpp49 std::unique_ptr<A[]> s2 = s; local
50 assert(s2.get() == p);
H A Dmove_convert05.fail.cpp51 std::unique_ptr<A[], Deleter<A[]> > s2 = s; local
52 assert(s2.get() == p);
56 assert(s2.get_deleter().state() == 5);

Completed in 302 milliseconds

1234567891011>>