/external/libutf/ |
H A D | runestrstr.c | 20 * Return pointer to first occurrence of s2 in s1, 25 runestrstr(const Rune *s1, const Rune *s2) argument 32 return s1; 34 for(p=runestrchr(s1, c0); p; p=runestrchr(p+1, c0)) {
|
H A D | utfutf.c | 21 * Return pointer to first occurrence of s2 in s1, 26 utfutf(const char *s1, const char *s2) argument 35 return strstr(s1, s2); 38 for(p=s1; (p=utfrune(p, f)) != 0; p+=n1)
|
/external/skia/experimental/Intersection/ |
H A D | Intersections.cpp | 11 void Intersections::insertCoincidentPair(double s1, double e1, double s2, double e2, argument 16 remove(s1, e1, startPt, endPt); 37 bool s1in = between(cs1, s1, ce1) || startPt.approximatelyEqual(fPt[i1]) 56 if (s1 < cs1) { 57 fT[fSwap][i1] = s1; 63 if (s1 > ce1) { 64 fT[fSwap][iEnd1] = s1; 88 insertCoincident(s1, s2, startPt);
|
/external/apache-http/src/org/apache/commons/codec/language/ |
H A D | SoundexUtils.java | 74 * @param s1 88 static int difference(StringEncoder encoder, String s1, String s2) throws EncoderException { argument 89 return differenceEncoded(encoder.encode(s1), encoder.encode(s2));
|
/external/chromium_org/third_party/tcmalloc/chromium/src/tests/ |
H A D | page_heap_test.cc | 28 // Allocate a span 's1' 29 tcmalloc::Span* s1 = ph->New(256); local 32 // Split span 's1' into 's1', 's2'. Delete 's2' 33 tcmalloc::Span* s2 = ph->Split(s1, 128); 42 // Delete span 's1' 43 ph->Delete(s1);
|
/external/chromium_org/third_party/tcmalloc/vendor/src/tests/ |
H A D | page_heap_test.cc | 28 // Allocate a span 's1' 29 tcmalloc::Span* s1 = ph->New(256); local 32 // Split span 's1' into 's1', 's2'. Delete 's2' 33 tcmalloc::Span* s2 = ph->Split(s1, 128); 42 // Delete span 's1' 43 ph->Delete(s1);
|
/external/chromium_org/third_party/yasm/source/patched-yasm/tools/re2c/ |
H A D | substr.c | 16 SubStr_eq(const SubStr *s1, const SubStr *s2) argument 18 return (s1->len == s2->len && memcmp(s1->str, s2->str, s1->len) == 0);
|
/external/chromium_org/v8/test/mjsunit/ |
H A D | object-toprimitive.js | 35 var s1 = String(o1); variable 37 assertTrue(typeof s1 == "string");
|
/external/clang/test/CXX/dcl.dcl/dcl.attr/dcl.align/ |
H A D | p5.cpp | 26 S1 s1; variable 31 alignas(2) S1 s1; // expected-error {{requested alignment is less than minimum alignment of 8 for type 'S1'}} member in struct:S5 34 S1 s1; member in struct:S6 41 S1 s1 alignas(4); // expected-error {{requested alignment is less than minimum alignment of 8 for type 'S1'}}
|
/external/clang/test/CXX/dcl.decl/dcl.init/ |
H A D | p6.cpp | 20 struct s1 { static const s0 foo; }; struct 21 const struct s0 s1::foo; // expected-error{{default initialization of an object of const type 'const struct s0' requires a user-provided default constructor}}
|
/external/clang/test/CXX/expr/expr.prim/expr.prim.lambda/ |
H A D | p7.cpp | 52 S1 &s1 = operator=(&this->x); local
|
/external/clang/test/CodeGen/ |
H A D | arm-pnaclcall.c | 11 } s1; typedef in typeref:struct:__anon18605 12 // CHECK-LABEL: define i32 @f48(%struct.s1* byval %s) 13 int __attribute__((pnaclcall)) f48(s1 s) { return s.a; } 15 // CHECK-LABEL: define void @f49(%struct.s1* noalias sret %agg.result) 16 s1 __attribute__((pnaclcall)) f49() { s1 s; s.a = s.b = 1; return s; }
|
H A D | sanitize-init-order.cpp | 13 PODStruct s1; variable
|
H A D | volatile-1.c | 298 struct { int x; } s, s1; local 300 printf("s is at %p\n", &(s = s1)); 301 printf("s.x is at %p\n", &((s = s1).x));
|
/external/clang/test/CodeGenCXX/ |
H A D | alloca-align.cpp | 22 // CHECK: alloca %struct.s1, align 2 23 struct s1 { short x; short y; }; struct 24 extern "C" struct s1 f2(int a, struct s1 *x, struct s1 *y) {
|
H A D | microsoft-new.cpp | 26 S *s1 = new(arbitrary) S; local
|
H A D | no-opt-volatile-memcpy.cpp | 27 struct s1 { struct 31 struct s1 s; 38 // CHECK: call void @llvm.memcpy.{{.*}}(i8* getelementptr inbounds (%struct.s1* @s, i32 0, i32 0, i32 0, i32 0), i8* getelementptr inbounds (%struct.s1* @s, i32 0, i32 0, i32 0, i32 0), i64 132, i32 4, i1 true) 39 // CHECK-NEXT: call void @llvm.memcpy.{{.*}}(i8* getelementptr inbounds (%struct.s1* @s, i32 0, i32 0, i32 0, i32 0), i8* getelementptr inbounds (%struct.s* @gs, i32 0, i32 0, i32 0), i64 132, i32 4, i1 true) 41 struct d : s1 {
|
/external/clang/test/Sema/ |
H A D | pragma-pack-2.c | 16 struct s1 { struct 20 extern int a1[offsetof(struct s1, f1) == 2 ? 1 : -1];
|
/external/clang/test/SemaTemplate/ |
H A D | instantiate-function-2.cpp | 10 S<int> s1; local
|
H A D | self-comparison.cpp | 43 S1<1, 1> s1; s1.foo(); local
|
/external/compiler-rt/lib/sanitizer_common/tests/ |
H A D | sanitizer_stackdepot_test.cc | 21 uptr s1[] = {1, 2, 3, 4, 5}; local 22 u32 i1 = StackDepotPut(s1, ARRAY_SIZE(s1)); 26 EXPECT_EQ(sz1, ARRAY_SIZE(s1)); 27 EXPECT_EQ(internal_memcmp(sp1, s1, sizeof(s1)), 0); 50 uptr s1[] = {1, 2, 3, 4, 6}; local 51 u32 i1 = StackDepotPut(s1, ARRAY_SIZE(s1)); 52 u32 i2 = StackDepotPut(s1, ARRAY_SIZ 62 uptr s1[] = {1, 2, 3, 4, 7}; local 70 uptr s1[] = {1, 2, 3, 4, 5}; local [all...] |
/external/compiler-rt/lib/tsan/tests/unit/ |
H A D | tsan_sync_test.cc | 56 SyncVar *s1 = m->GetIfExistsAndLock((uptr)&block[0]); local 57 EXPECT_EQ(s1, (SyncVar*)0); 58 s1 = m->GetOrCreateAndLock(thr, 0, (uptr)&block[0], true); 59 EXPECT_NE(s1, (SyncVar*)0); 60 EXPECT_EQ(s1->addr, (uptr)&block[0]); 61 s1->mtx.Unlock(); 67 s1 = m->GetIfExistsAndLock((uptr)&block[0]); 68 EXPECT_EQ(s1, (SyncVar*)0); 81 SyncVar *s1 = m->GetOrCreateAndLock(thr, 0, (uptr)&block1[0], true); local 82 s1 [all...] |
/external/eigen/Eigen/src/Geometry/ |
H A D | EulerAngles.h | 72 // c2 s1.s2 c1.s2 1 0 0 73 // 0 c1 -s1 * M = 0 c3 s3 74 // -s2 s1.c2 c1.c2 0 -s3 c3 76 // Thus: m11.c1 - m21.s1 = c3 & m12.c1 - m22.s1 = s3 78 Scalar s1 = sin(res[0]); local 80 res[2] = atan2(c1*coeff(j,k)-s1*coeff(k,k), c1*coeff(j,j) - s1 * coeff(k,j)); 92 Scalar s1 = sin(res[0]); local 94 res[2] = atan2(s1*coef [all...] |
/external/eigen/test/eigen2/ |
H A D | eigen2_alignedbox.cpp | 28 RealScalar s1 = ei_random<RealScalar>(0,1); local 36 VERIFY(b0.contains(p0*s1+(Scalar(1)-s1)*p1)); 37 VERIFY(!b0.contains(p0 + (1+s1)*(p1-p0)));
|
H A D | eigen2_linearstructure.cpp | 31 Scalar s1 = ei_random<Scalar>(); local 32 while (ei_abs(s1)<1e-3) s1 = ei_random<Scalar>(); 41 VERIFY_IS_APPROX(m1*s1, s1*m1); 42 VERIFY_IS_APPROX((m1+m2)*s1, s1*m1+s1*m2); 43 VERIFY_IS_APPROX((-m1+m2)*s1, -s1*m [all...] |