Searched defs:cs1 (Results 1 - 10 of 10) sorted by relevance
/external/llvm/test/MC/Hexagon/instructions/ |
H A D | cr.s | 76 cs1 = r21 define 78 r17 = cs1
|
/external/eigen/test/ |
H A D | hessenberg.cpp | 34 HessenbergDecomposition<MatrixType> cs1; local 35 cs1.compute(A); 37 VERIFY_IS_EQUAL(cs1.matrixH().eval(), cs2.matrixH().eval()); 38 MatrixType cs1Q = cs1.matrixQ();
|
H A D | schur_complex.cpp | 42 ComplexSchur<MatrixType> cs1; local 43 cs1.compute(A); 45 VERIFY_IS_EQUAL(cs1.info(), Success); 47 VERIFY_IS_EQUAL(cs1.matrixT(), cs2.matrixT()); 48 VERIFY_IS_EQUAL(cs1.matrixU(), cs2.matrixU()); 54 VERIFY_IS_EQUAL(cs3.matrixT(), cs1.matrixT()); 55 VERIFY_IS_EQUAL(cs3.matrixU(), cs1.matrixU()); 70 VERIFY_IS_EQUAL(cs1.matrixT(), csOnlyT.matrixT());
|
/external/icu/icu4c/source/samples/ustring/ |
H A D | ustring.cpp | 549 static const char *cs1="such characters are safe 123 %-."; local 552 u_charsToUChars(cs1, us1, 33); /* include the terminating NUL */
|
/external/webrtc/talk/session/media/ |
H A D | srtpfilter_unittest.cc | 94 void TestProtectUnprotect(const std::string& cs1, const std::string& cs2) { argument 109 EXPECT_EQ(out_len, rtp_len + rtp_auth_tag_len(cs1)); 125 EXPECT_EQ(out_len, rtcp_len + 4 + rtcp_auth_tag_len(cs1)); // NOLINT
|
/external/icu/android_icu4j/src/main/java/android/icu/text/ |
H A D | Normalizer.java | 2170 /*package*/ static int cmpEquivFold(CharSequence cs1, CharSequence cs2, int options) { argument 2220 limit1=cs1.length(); 2243 c1=cs1.charAt(s1++); 2250 cs1=stack1[level1].cs; 2251 } while(cs1==null); 2253 limit1=cs1.length(); 2303 if(s1!=limit1 && Character.isLowSurrogate(c=cs1.charAt(s1))) { 2308 if(0<=(s1-2) && Character.isHighSurrogate(c=cs1.charAt(s1-2))) { 2360 stack1[0].cs=cs1; 2374 cs1 [all...] |
/external/icu/icu4j/main/classes/core/src/com/ibm/icu/text/ |
H A D | Normalizer.java | 2111 /*package*/ static int cmpEquivFold(CharSequence cs1, CharSequence cs2, int options) { argument 2161 limit1=cs1.length(); 2184 c1=cs1.charAt(s1++); 2191 cs1=stack1[level1].cs; 2192 } while(cs1==null); 2194 limit1=cs1.length(); 2244 if(s1!=limit1 && Character.isLowSurrogate(c=cs1.charAt(s1))) { 2249 if(0<=(s1-2) && Character.isHighSurrogate(c=cs1.charAt(s1-2))) { 2301 stack1[0].cs=cs1; 2315 cs1 [all...] |
/external/compiler-rt/lib/dfsan/ |
H A D | dfsan_custom.cc | 105 const char *cs1 = (const char *) s1, *cs2 = (const char *) s2; local 107 if (cs1[i] != cs2[i]) { 111 *ret_label = dfsan_union(dfsan_read_label(cs1, i + 1), 114 return cs1[i] - cs2[i]; 121 *ret_label = dfsan_union(dfsan_read_label(cs1, n),
|
/external/webrtc/talk/app/webrtc/ |
H A D | webrtcsdp_unittest.cc | 909 bool CompareCandidates(const Candidates& cs1, const Candidates& cs2) { argument 910 EXPECT_EQ(cs1.size(), cs2.size()); 911 if (cs1.size() != cs2.size()) 913 for (size_t i = 0; i< cs1.size(); ++i) { 914 const Candidate c1 = cs1.at(i);
|
/external/ltp/testcases/kernel/controllers/cpuset/cpuset_lib/ |
H A D | libcpuset.c | 3300 struct cpuset_fts_entry *cs1, *cs2, *cs3; local 3303 * At each step, cs1 < cs2 < cs3 and the cs2->next pointer 3304 * is redirected from cs3 to cs1. 3307 cs1 = cs2 = NULL; 3310 cs1 = cs2; 3313 cs2->next = cs1;
|
Completed in 2116 milliseconds