| /cts/hostsidetests/monkey/src/com/android/cts/monkey/ |
| SeedTest.java | 37 Scanner s2 = new Scanner(out2); local
41 String line2 = getNextLine(s2);
|
| /dalvik/dexgen/src/com/android/dexgen/util/ |
| Hex.java | 193 public static String s2(int v) { method in class:Hex
|
| /dalvik/dx/src/com/android/dx/util/ |
| Hex.java | 193 public static String s2(int v) { method in class:Hex
|
| /external/chromium_org/courgette/ |
| adjustment_method_unittest.cc | 88 std::string s2 = Serialize(prog2); local
91 EXPECT_FALSE(s1 == s2); // Unadjusted A and B differ.
|
| /external/chromium_org/net/tools/balsa/ |
| balsa_headers_test.cc | 175 std::string s1, s2, s3; local
180 headers_->GetAllOfHeaderAsString("key2", &s2);
192 ASSERT_EQ("value2", s2);
|
| /external/chromium_org/third_party/mesa/src/src/gallium/auxiliary/gallivm/ |
| lp_bld_quad.c | 139 unsigned s2 = 4 * i + length; local
142 shuffles1[4*i + 2] = lp_build_const_int32(gallivm, LP_BLD_QUAD_TOP_LEFT + s2);
143 shuffles1[4*i + 3] = lp_build_const_int32(gallivm, LP_BLD_QUAD_TOP_LEFT + s2);
146 shuffles2[4*i + 2] = lp_build_const_int32(gallivm, LP_BLD_QUAD_TOP_RIGHT + s2);
147 shuffles2[4*i + 3] = lp_build_const_int32(gallivm, LP_BLD_QUAD_BOTTOM_LEFT + s2);
|
| /external/chromium_org/third_party/webrtc/modules/audio_coding/codecs/isac/fix/source/ |
| lattice_mips.c | 141 int s0, s1, s2, s3; local
158 "extr_rs.w %[s2], $ac2, 15 \n\t"
165 "addu %[t2], %[t2], %[s2] \n\t"
184 "extr_rs.w %[s2], $ac2, 15 \n\t"
200 "addu %[t2], %[t2], %[s2] \n\t"
235 [s1] "=&r" (s1), [s2] "=&r" (s2), [s3] "=&r" (s3),
|
| /external/chromium_org/third_party/webrtc/modules/video_coding/main/source/ |
| video_coding_robustness_unittest.cc | 165 Sequence s1, s2; local
208 .InSequence(s2);
214 .InSequence(s2);
|
| /external/chromium_org/v8/test/mjsunit/ |
| uri.js | 36 var s2 = String.fromCharCode(cc2); variable
57 assertEquals('%00', encodeURI(s2));
68 assertEquals(cc2, decodeURI(encodeURI(s2)).charCodeAt(0));
|
| /external/clang/test/Analysis/ |
| malloc-overflow.c | 34 struct s4 s2 = *s; local
35 return malloc(s2.n * sizeof(int)); // expected-warning {{the computation of the size of the memory allocation may overflow}}
|
| /external/clang/test/CodeGen/ |
| le32-arguments.c | 18 } s2; typedef in typeref:struct:__anon22470
20 // CHECK-LABEL: define void @f2(%struct.s2* noalias sret %agg.result)
21 s2 f2() {
22 s2 foo;
|
| malign-double-x86-nacl.c | 21 // CHECK-LABEL: define void @s2(double %a)
22 void s2(double a) {} function
|
| packed-structure.c | 64 struct s2 { struct
73 int s2_align_x = __alignof(((struct s2*)0)->x);
74 int s2_align_y = __alignof(((struct s2*)0)->y);
75 int s2_align = __alignof(struct s2);
80 int s2_load_x(struct s2 *a) { return a->x; }
84 int s2_load_y(struct s2 *a) { return a->y; }
87 void s2_copy(struct s2 *a, struct s2 *b) { *b = *a; }
|
| vla.c | 46 char s2[x]; local
|
| /external/clang/test/Sema/ |
| anonymous-struct-union.c | 94 struct s2 { struct
|
| /external/clang/test/SemaCXX/ |
| alignof.cpp | 16 struct S2 {
17 S2();
25 const int test6 = __alignof__(S2::x);
26 const int test7 = __alignof__(S2::s); // expected-error {{invalid application of 'alignof' to an incomplete type 'S1'}}
29 // 's2.x' should depend on the alignment of both x-within-S2 and
30 // s2-within-S3 and thus require 'S3' to be complete. If we start
34 S2 s2; member in struct:S3
36 static const int test8 = __alignof__(s2.x)
[all...] |
| expressions.cpp | 117 S<2, 7> s2; local
119 (void)s2.foo();
|
| /external/clang/test/SemaTemplate/ |
| instantiate-using-decl.cpp | 70 struct s2 : s1 { struct in struct:test3::t
78 t<int>::s2 a;
79 t<int>::s2 const & b = a;
|
| /external/compiler-rt/lib/asan/tests/ |
| asan_mem_test.cc | 212 char *s2 = MallocAndMemsetString(size); local
214 Ident(memcmp(s1, s2, size));
215 Ident(memcmp(s1 + size - 1, s2 + size - 1, 1));
216 Ident(memcmp(s1 - 1, s2 - 1, 0));
218 EXPECT_DEATH(Ident(memcmp)(s1 - 1, s2, 1), LeftOOBReadMessage(1));
219 EXPECT_DEATH(Ident(memcmp)(s1, s2 - 1, 1), LeftOOBReadMessage(1));
220 EXPECT_DEATH(Ident(memcmp)(s1 + size, s2, 1), RightOOBReadMessage(0));
221 EXPECT_DEATH(Ident(memcmp)(s1, s2 + size, 1), RightOOBReadMessage(0));
223 EXPECT_DEATH(Ident(memcmp)(s1 + 1, s2 + 1, size), RightOOBReadMessage(0));
224 EXPECT_DEATH(Ident(memcmp)(s1 + size - 1, s2, 2), RightOOBReadMessage(0))
[all...] |
| /external/dexmaker/src/dx/java/com/android/dx/util/ |
| Hex.java | 193 public static String s2(int v) { method in class:Hex
|
| /external/eigen/test/ |
| adjoint.cpp | 18 static void run(const Vec& v1, const Vec& v2, Vec& v3, const Mat& square, Scalar s1, Scalar s2) {
19 VERIFY(test_isApproxWithRef((s1 * v1 + s2 * v2).dot(v3), numext::conj(s1) * v1.dot(v3) + numext::conj(s2) * v2.dot(v3), 0));
20 VERIFY(test_isApproxWithRef(v3.dot(s1 * v1 + s2 * v2), s1*v3.dot(v1)+s2*v3.dot(v2), 0));
29 static void run(const Vec& v1, const Vec& v2, Vec& v3, const Mat& square, Scalar s1, Scalar s2) {
33 RealScalar ref = NumTraits<Scalar>::IsInteger ? RealScalar(0) : (std::max)((s1 * v1 + s2 * v2).norm(),v3.norm());
34 VERIFY(test_isApproxWithRef((s1 * v1 + s2 * v2).dot(v3), numext::conj(s1) * v1.dot(v3) + numext::conj(s2) * v2.dot(v3), ref));
35 VERIFY(test_isApproxWithRef(v3.dot(s1 * v1 + s2 * v2), s1*v3.dot(v1)+s2*v3.dot(v2), ref))
81 s2 = internal::random<Scalar>(); local
[all...] |
| array.cpp | 30 s2 = internal::random<Scalar>(); local
38 VERIFY_IS_APPROX((m1*Scalar(2)) - s2, (m1+m1) - ArrayType::Constant(rows,cols,s2) );
40 m3 += s2;
41 VERIFY_IS_APPROX(m3, m1 + s2);
|
| product_notemporary.cpp | 52 s2 = internal::random<Scalar>(), local
65 VERIFY_EVALUATION_COUNT( m3.noalias() = s1 * m1 * s2 * m2.adjoint(), 0);
66 VERIFY_EVALUATION_COUNT( m3.noalias() = s1 * m1 * s2 * (m1*s3+m2*s2).adjoint(), 1);
67 VERIFY_EVALUATION_COUNT( m3.noalias() = (s1 * m1).adjoint() * s2 * m2, 0);
68 VERIFY_EVALUATION_COUNT( m3.noalias() += s1 * (-m1*s3).adjoint() * (s2 * m2 * s3), 0);
71 VERIFY_EVALUATION_COUNT(( m3.block(r0,r0,r1,r1).noalias() += -m1.block(r0,c0,r1,c1) * (s2*m2.block(r0,c0,r1,c1)).adjoint() ), 0);
85 VERIFY_EVALUATION_COUNT( rm3.col(c0).noalias() = (s1 * m1.adjoint()).template triangularView<UnitUpper>() * (s2*m2.row(c0)).adjoint(), 1);
91 VERIFY_EVALUATION_COUNT( m3.noalias() = s2 * m2.adjoint() * (s1 * m1.adjoint()).template selfadjointView<Upper>(), 0);
|
| product_selfadjoint.cpp | 35 s2 = internal::random<Scalar>(), local
46 m2.template selfadjointView<Upper>().rankUpdate(-v1,s2*v2,s3);
47 VERIFY_IS_APPROX(m2, (m1 + (s3*(-v1)*(s2*v2).adjoint()+numext::conj(s3)*(s2*v2)*(-v1).adjoint())).template triangularView<Upper>().toDenseMatrix());
50 m2.template selfadjointView<Upper>().rankUpdate(-s2*r1.adjoint(),r2.adjoint()*s3,s1);
51 VERIFY_IS_APPROX(m2, (m1 + s1*(-s2*r1.adjoint())*(r2.adjoint()*s3).adjoint() + numext::conj(s1)*(r2.adjoint()*s3) * (-s2*r1.adjoint()).adjoint()).template triangularView<Upper>().toDenseMatrix());
|
| /external/eigen/test/eigen2/ |
| eigen2_adjoint.cpp | 41 s2 = ei_random<Scalar>(); local
53 VERIFY(ei_isApprox((s1 * v1 + s2 * v2).eigen2_dot(v3), s1 * v1.eigen2_dot(v3) + s2 * v2.eigen2_dot(v3), largerEps));
54 VERIFY(ei_isApprox(v3.eigen2_dot(s1 * v1 + s2 * v2), ei_conj(s1)*v3.eigen2_dot(v1)+ei_conj(s2)*v3.eigen2_dot(v2), largerEps));
|
