/external/clang/test/Sema/ |
H A D | warn-strncat-size.c | 16 char *strncat(char *restrict s1, const char *restrict s2, size_t n); 23 char s1[100]; variable 42 strncat(s1+3, s2, sizeof(s2)); // expected-warning {{size argument in 'strncat' call appears to be size of the source}}
|
/external/clang/test/SemaCXX/ |
H A D | builtins.cpp | 12 template<int (*Compare)(const char *s1, const char *s2)> 13 int equal(const char *s1, const char *s2) { argument 14 return Compare(s1, s2) == 0;
|
H A D | elaborated-type-specifier.cpp | 13 bool test_elab(S1 *s1, struct S2 *s2, struct S3 *s3) { argument 14 if (s1->x == s2) return true; 15 if (s1->y == s3) return true;
|
H A D | expressions.cpp | 116 S<5, 8> s1; local 118 (void)s1.foo();
|
H A D | overload-call-copycon.cpp | 32 short& s1 = copycon2(a); local
|
H A D | warn-unused-result.cpp | 30 S s1 = g1(); local
|
/external/clang/test/SemaTemplate/ |
H A D | dependent-base-member-init.cpp | 34 template<typename T> struct s1 : s0<typename s0_traits<T>::t0> { struct in inherits:s0 35 s1() {} function in struct:s1
|
H A D | instantiate-using-decl.cpp | 67 struct s1 { struct in struct:test3::t 70 struct s2 : s1 { 71 using s1::f1;
|
/external/compiler-rt/lib/asan/tests/ |
H A D | asan_mem_test.cc | 211 char *s1 = 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 [all...] |
/external/deqp/framework/delibs/decpp/ |
H A D | deSTLUtil.hpp | 56 C intersection (const C& s1, const C& s2) argument 59 std::set_intersection(s1.begin(), s1.end(), s2.begin(), s2.end(), 65 C set_union (const C& s1, const C& s2) argument 68 std::set_union(s1.begin(), s1.end(), s2.begin(), s2.end(),
|
/external/dexmaker/src/dx/java/com/android/dx/util/ |
H A D | Hex.java | 217 public static String s1(int v) { method in class:Hex
|
H A D | TwoColumnOutput.java | 53 * @param s1 {@code non-null;} first string 60 public static String toString(String s1, int width1, String spacer, argument 62 int len1 = s1.length(); 70 twoOut.getLeft().write(s1);
|
/external/eigen/test/ |
H A D | adjoint.cpp | 18 static void run(const Vec& v1, const Vec& v2, Vec& v3, const Mat& square, Scalar s1, Scalar s2) { argument 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) { argument 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 * v 80 Scalar s1 = internal::random<Scalar>(), local [all...] |
H A D | diagonalmatrices.cpp | 35 Scalar s1 = internal::random<Scalar>(); local 82 VERIFY_IS_APPROX(LeftDiagonalMatrix(ldm1*s1).diagonal(), ldm1.diagonal() * s1); 83 VERIFY_IS_APPROX(LeftDiagonalMatrix(s1*ldm1).diagonal(), s1 * ldm1.diagonal()); 85 VERIFY_IS_APPROX(m1 * (rdm1 * s1), (m1 * rdm1) * s1); 86 VERIFY_IS_APPROX(m1 * (s1 * rdm1), (m1 * rdm1) * s1);
|
H A D | integer_types.cpp | 40 Scalar s1; local 42 s1 = internal::random<Scalar>(); 43 } while(s1 == 0); 47 VERIFY_IS_EQUAL((-m1+m2)*s1, -s1*m1+s1*m2); 112 Scalar s1; local 114 s1 = internal::random<Scalar>(); 115 } while(s1 == 0); 119 VERIFY_IS_EQUAL(m1*s1, s [all...] |
H A D | product.h | 53 Scalar s1 = internal::random<Scalar>(); local 72 VERIFY_IS_APPROX(s1*(square*m1), (s1*square)*m1); 73 VERIFY_IS_APPROX(s1*(square*m1), square*(m1*s1));
|
H A D | product_selfadjoint.cpp | 34 Scalar s1 = internal::random<Scalar>(), local 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());
|
H A D | product_syrk.cpp | 33 Scalar s1 = internal::random<Scalar>(); local 38 VERIFY_IS_APPROX((m2.template selfadjointView<Lower>().rankUpdate(rhs2,s1)._expression()), 39 ((s1 * rhs2 * rhs2.adjoint()).eval().template triangularView<Lower>().toDenseMatrix())); 41 VERIFY_IS_APPROX(((m2.template triangularView<Lower>() += s1 * rhs2 * rhs22.adjoint()).nestedExpression()), 42 ((s1 * rhs2 * rhs22.adjoint()).eval().template triangularView<Lower>().toDenseMatrix())); 46 VERIFY_IS_APPROX(m2.template selfadjointView<Upper>().rankUpdate(rhs2,s1)._expression(), 47 (s1 * rhs2 * rhs2.adjoint()).eval().template triangularView<Upper>().toDenseMatrix()); 49 VERIFY_IS_APPROX((m2.template triangularView<Upper>() += s1 * rhs22 * rhs2.adjoint()).nestedExpression(), 50 (s1 * rhs22 * rhs2.adjoint()).eval().template triangularView<Upper>().toDenseMatrix()); 54 VERIFY_IS_APPROX(m2.template selfadjointView<Lower>().rankUpdate(rhs1.adjoint(),s1) [all...] |
H A D | sparse_vector.cpp | 36 Scalar s1 = internal::random<Scalar>(); local 63 VERIFY_IS_APPROX(v1*s1-v2, refV1*s1-refV2); 65 VERIFY_IS_APPROX(v1*=s1, refV1*=s1); 66 VERIFY_IS_APPROX(v1/=s1, refV1/=s1);
|
/external/eigen/test/eigen2/ |
H A D | eigen2_adjoint.cpp | 40 Scalar s1 = ei_random<Scalar>(), local 49 VERIFY_IS_APPROX((s1 * m1).adjoint(), ei_conj(s1) * m1.adjoint()); 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));
|
H A D | eigen2_cwiseop.cpp | 49 Scalar s1 = ei_random<Scalar>(); local 52 m3 = MatrixType::Constant(rows, cols, s1); 58 VERIFY_IS_APPROX(m3(i,j), s1); local 62 VERIFY(m3.isConstant(s1)); 64 VERIFY_IS_APPROX(m4.setConstant(s1), m3); 65 VERIFY_IS_APPROX(m4.setConstant(rows,cols,s1), m3); 70 m4.fill(s1); 73 VERIFY_IS_APPROX(v3.setConstant(rows, s1), VectorType::Constant(rows,s1));
|
H A D | eigen2_nomalloc.cpp | 45 Scalar s1 = ei_random<Scalar>(); local 50 VERIFY_IS_APPROX((m1+m2)*s1, s1*m1+s1*m2);
|
/external/harfbuzz_ng/test/api/ |
H A D | test-ot-tag.c | 54 test_indic_tags (const char *s1, const char *s2, hb_script_t script) argument 59 g_test_message ("Testing script %c%c%c%c: new tag %s, old tag %s", HB_UNTAG (hb_script_to_iso15924_tag (script)), s1, s2); 60 tag1 = hb_tag_from_string (s1, -1);
|
/external/icu/icu4c/source/common/unicode/ |
H A D | normlzr.h | 393 * strcmp[CodePointOrder](NFD(foldCase(s1)), NFD(foldCase(s2))) 399 * @param s1 First source string. 408 * Set if the caller knows that both s1 and s2 fulfill the FCD conditions. 441 compare(const UnicodeString &s1, const UnicodeString &s2, 783 Normalizer::compare(const UnicodeString &s1, const UnicodeString &s2, argument 787 return unorm_compare(s1.getBuffer(), s1.length(),
|
/external/icu/icu4c/source/common/ |
H A D | ustr_cnv.c | 114 static int32_t u_astrnlen(const char *s1, int32_t n) argument 118 if (s1) 120 while (n-- && *(s1++)) 201 u_austrncpy(char *s1, argument 205 char *target = s1; 212 s1+n, 221 *s1 = 0; /* failure */ 223 if(target < (s1+n)) { /* U_BUFFER_OVERFLOW_ERROR isn't an err, just means no termination will happen. */ 227 *s1 = 0; 229 return s1; 233 u_austrcpy(char *s1, const UChar *ucs2 ) argument [all...] |