/external/clang/test/SemaCXX/ |
pr18284-crash-on-invalid.cpp | 15 namespace n2 { namespace 24 } // namespace n2
|
/external/libutf/ |
utfutf.c | 29 long f, n1, n2; local 37 n2 = strlen(s2); 39 if(strncmp(p, s2, n2) == 0)
|
/libcore/ojluni/src/main/java/sun/misc/ |
ASCIICaseInsensitiveComparator.java | 41 int n1=s1.length(), n2=s2.length(); local 42 int minLen = n1 < n2 ? n1 : n2; 55 return n1 - n2;
|
/ndk/sources/android/support/src/musl-multibyte/ |
mbsnrtowcs.c | 11 size_t l, cnt=0, n2; local 22 while ( s && wn && ( (n2=n/4)>=wn || n2>32 ) ) { 23 if (n2>=wn) n2=wn; 24 n -= n2; 25 l = mbsrtowcs(ws, &s, n2, st);
|
wcsnrtombs.c | 11 size_t l, cnt=0, n2; local 18 while ( ws && n && ( (n2=wn)>=n || n2>32 ) ) { 19 if (n2>=n) n2=n; 20 wn -= n2; 21 l = wcsrtombs(s, &ws, n2, 0);
|
/ndk/tests/device/test-gnustl-full/unit/ |
lexcmp_test.cpp | 35 char n2[size] = "shine"; local 37 bool before = lexicographical_compare(n1, n1 + size, n2, n2 + size); 44 char n2[size] = "shine"; local 46 bool before = lexicographical_compare(n1, n1 + size, n2, n2 + size, greater<char>());
|
mismatch_test.cpp | 41 int n2[5] = { 1, 2, 3, 4, 5 }; local 44 pair <int*, int*> result = mismatch((int*)n1, (int*)n1 + 5, (int*)n2); 45 CPPUNIT_ASSERT(result.first ==(n1 + 5) && result.second ==(n2 + 5)); 72 char const* n2[size]; local 73 copy(n1, n1 + 5, (char const**)n2); 74 pair <char const**, char const**> result = mismatch((char const**)n1, (char const**)n1 + size, (char const**)n2, str_equal); 76 CPPUNIT_ASSERT(result.first == n1 + size && result.second == n2 + size); 78 n2[2] = "QED"; 79 result = mismatch((char const**)n1, (char const**)n1 + size, (char const**)n2, str_equal); 80 CPPUNIT_ASSERT(!(result.first == n2 + size && result.second == n2 + size)) [all...] |
/ndk/tests/device/test-stlport/unit/ |
lexcmp_test.cpp | 35 char n2[size] = "shine"; local 37 bool before = lexicographical_compare(n1, n1 + size, n2, n2 + size); 44 char n2[size] = "shine"; local 46 bool before = lexicographical_compare(n1, n1 + size, n2, n2 + size, greater<char>());
|
mismatch_test.cpp | 41 int n2[5] = { 1, 2, 3, 4, 5 }; local 44 pair <int*, int*> result = mismatch((int*)n1, (int*)n1 + 5, (int*)n2); 45 CPPUNIT_ASSERT(result.first ==(n1 + 5) && result.second ==(n2 + 5)); 72 char const* n2[size]; local 73 copy(n1, n1 + 5, (char const**)n2); 74 pair <char const**, char const**> result = mismatch((char const**)n1, (char const**)n1 + size, (char const**)n2, str_equal); 76 CPPUNIT_ASSERT(result.first == n1 + size && result.second == n2 + size); 78 n2[2] = "QED"; 79 result = mismatch((char const**)n1, (char const**)n1 + size, (char const**)n2, str_equal); 80 CPPUNIT_ASSERT(!(result.first == n2 + size && result.second == n2 + size)) [all...] |
/external/clang/test/Sema/ |
attr-section.c | 14 __attribute__((section("NEAR,x"))) static int n2; // ok. local
|
/external/v8/test/mjsunit/compiler/ |
osr-infinite.js | 29 function n2() { function 73 test(n2);
|
/frameworks/compile/libbcc/tests/debuginfo/host-tests/ |
pass-struct.c | 12 // CHECK: $1 = {n = 10, n2 = {20, 21}} 17 int n2[2]; member in struct:int_struct 23 s.n2[1]++; 24 return s.n > s.n2[0] ? s.n : s.n2[0]; 32 s.n2[0] = 20; 33 s.n2[1] = 21;
|
/external/clang/test/CXX/dcl.dcl/dcl.attr/dcl.align/ |
p5.cpp | 4 alignas(1) alignas(2) int n2; // expected-error {{less than minimum alignment}} variable
|
/external/clang/test/CXX/temp/temp.fct.spec/temp.deduct/temp.deduct.call/ |
p3-0x.cpp | 44 int n2 = f(0); member in namespace:std_example
|
/external/clang/test/FixIt/ |
fixit-vexing-parse.cpp | 84 int n2, // expected-note {{change this ',' to a ';' to call 'F1'}} local
|
/external/icu/icu4c/source/common/ |
unorm.cpp | 49 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, *pErrorCode); local 50 return unorm2_quickCheck((const UNormalizer2 *)n2, src, srcLength, pErrorCode); 57 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, *pErrorCode); local 59 FilteredNormalizer2 fn2(*n2, *uniset_getUnicode32Instance(*pErrorCode)); 64 return unorm2_quickCheck((const UNormalizer2 *)n2, src, srcLength, pErrorCode); 72 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, *pErrorCode); local 73 return unorm2_isNormalized((const UNormalizer2 *)n2, src, srcLength, pErrorCode); 80 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, *pErrorCode); local 82 FilteredNormalizer2 fn2(*n2, *uniset_getUnicode32Instance(*pErrorCode)); 87 return unorm2_isNormalized((const UNormalizer2 *)n2, src, srcLength, pErrorCode) 99 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, *pErrorCode); local 180 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, *pErrorCode); local 264 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, *pErrorCode); local [all...] |
/external/libcxx/test/std/input.output/iostream.format/output.streams/ostream.formatted/ostream.inserters.arithmetic/ |
pointer.pass.cpp | 71 int n2; local 72 os2 << &n2; local
|
/external/toybox/toys/other/ |
xxd.c | 98 int n1, n2; local 101 if ((n1 = n2 = dehex(fgetc(fp))) < 0 || (n2 = dehex(fgetc(fp))) < 0) { 103 if (n1 == -2 || n2 == -2) continue; 108 fputc((n1 << 4) | (n2 & 0xf), stdout);
|
/libcore/jsr166-tests/src/test/java/jsr166/ |
SystemTest.java | 42 long n2 = System.nanoTime(); local 46 long nanos = n2 - n1; 64 long n2 = System.nanoTime(); local 66 long nanos = n2 - n1;
|
/ndk/sources/host-tools/toolbox/ |
cmp_win.c | 70 int n1, n2, ret = 0; local 73 n2 = fread(buf2, 1, BUFSIZE, f2); 74 ret = (n1 != n2) || memcmp(buf1, buf2, n1) != 0;
|
/external/clang/test/CodeGenCXX/ |
mangle-ms-templates-memptrs-2.cpp | 20 K<N> n2; variable 21 // CHECK-DAG: @"\01?n2@@3U?$K@UN@@$0?0@@A"
|
/external/clang/test/Modules/ |
macros2.c | 78 int n2 = TOP_OTHER_REDEF2; // ok variable
|
/external/opencv3/modules/photo/test/ |
test_inpaint.cpp | 95 double n2 = cvtest::norm(diff2.reshape(1), NORM_INF, inv_mask.reshape(1)); local 97 if (n1 != 0 || n2 != 0) 107 n2 = cvtest::norm(diff2.reshape(1), NORM_INF, mask.reshape(1)); 110 if (n1 > jpeg_thres || n2 > jpeg_thres)
|
/external/testng/src/main/java/org/testng/ |
SuiteResult.java | 54 String n2 = other.getTestContext().getName(); local 55 result = n1.compareTo(n2);
|
/frameworks/base/libs/common_time/ |
common_clock.cpp | 133 uint32_t n2 = 1000000 + cur_slew_; local 140 LinearTransform::reduce(&n2, &d1); 141 LinearTransform::reduce(&n2, &d2); 145 cur_trans_.a_to_b_numer = n1 * n2;
|