/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/strace/tests/ |
sigaction.awk | 3 n2[1] = "SIG_IGN, \\[HUP INT\\], SA_RESTART" 6 n2[2] = "0x[0-9a-f]+, \\[QUIT TERM\\], SA_SIGINFO" 9 n2[3] = "SIG_DFL, \\[\\], 0" 12 n2[4] = "SIG_DFL, ~\\[HUP( ((RT|SIGRT)[^] ]+|[3-9][0-9]|1[0-9][0-9]))*\\], 0" 18 o2[i] = n2[i - 1] 28 "\\{" n2[i] "\\}, \\{" o2[i] "\\}, " a2 "|" \ 29 "\\{" n2[i] "\\}, \\{" o2[i] "\\}, " a3 ")\\) = 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...] |
/prebuilts/python/linux-x86/2.7.5/lib/python2.7/site-packages/setoolsgui/networkx/algorithms/ |
boundary.py | 55 return [(n1,n2) for n1 in nset1 for n2 in G[n1] \ 56 if n2 not in nset1] 59 return [(n1,n2) for n1 in nbunch1 if n1 in G for n2 in G[n1] \ 60 if n2 in nset2]
|
/external/libutf/ |
utfutf.c | 29 long f, n1, n2; local 37 n2 = strlen(s2); 39 if(strncmp(p, s2, n2) == 0)
|
/external/v8/test/cctest/compiler/ |
test-node.cc | 23 Node* n2 = graph.NewNode(&dummy_operator); local 24 CHECK(n2->id() != n1->id()); 31 Node* n2 = graph.NewNode(&dummy_operator); local 33 CHECK(n2->op() == &dummy_operator); 40 Node* n2 = graph.NewNode(&dummy_operator, n0); local 41 CHECK_EQ(1, n2->InputCount()); 42 CHECK(n0 == n2->InputAt(0)); 50 Node* n2 = graph.NewNode(&dummy_operator, n0, n1); local 51 CHECK_EQ(2, n2->InputCount()); 52 CHECK(n0 == n2->InputAt(0)) 61 Node* n2 = graph.NewNode(&dummy_operator, n0, n1, n1); local 122 Node* n2 = graph.NewNode(&dummy_operator); local 136 Node* n2 = graph.NewNode(&dummy_operator, n0); local 184 Node* n2 = graph.NewNode(&dummy_operator); local 241 Node* n2 = graph.NewNode(&dummy_operator, n0); local 257 Node* n2 = graph.NewNode(&dummy_operator, n0); local 288 Node* n2 = graph.NewNode(&dummy_operator, n0); local 303 Node* n2 = graph.NewNode(&dummy_operator, n0); local 346 Node* n2 = graph.NewNode(&dummy_operator, n0, n1); local 367 Node* n2 = graph.NewNode(&dummy_operator, n0, n1); local 404 Node* n2 = graph.NewNode(&dummy_operator, n0, n1); local 422 Node* n2 = graph.NewNode(&dummy_operator, n0); local 445 Node* n2 = graph.NewNode(&dummy_operator, n0); local 481 Node* n2 = graph.NewNode(&dummy_operator, n0); local 523 Node* n2 = graph.NewNode(&dummy_operator, n0, n1); local 545 Node* n2 = graph.NewNode(&dummy_operator, n0); local 580 Node* n2 = graph.NewNode(&dummy_operator, n0, n1); local 591 Node* n2 = graph.NewNode(&dummy_operator, n0, n1); local 602 Node* n2 = graph.NewNode(&dummy_operator, n0, n1); local 612 Node* n2 = graph.NewNode(&dummy_operator, n0, n0); local 621 Node* n2 = graph.NewNode(&dummy_operator, n0, n0); local 656 Node* n2 = graph.NewNode(&dummy_operator); local 672 Node* n2 = graph.NewNode(&dummy_operator); local 687 Node* n2 = graph.NewNode(&dummy_operator); local 700 Node* n2 = graph.NewNode(&dummy_operator); local 713 Node* n2 = graph.NewNode(&dummy_operator); local 732 Node* n2 = graph.NewNode(&dummy_operator, n0); local 747 Node* n2 = graph.NewNode(&dummy_operator, n0); local 761 Node* n2 = graph.NewNode(&dummy_operator, n0); local 773 Node* n2 = graph.NewNode(&dummy_operator, n0); local 785 Node* n2 = graph.NewNode(&dummy_operator, n0); local 803 Node* n2; local [all...] |
/external/libcxx/test/std/localization/locales/locale/locale.operators/ |
eq.pass.cpp | 24 std::locale n2(LOCALE_en_US_UTF_8); 32 assert(cloc != n2); 40 assert(copy != n2); 48 assert(n1 == n2); 53 assert(n2 != cloc); 54 assert(n2 != copy); 55 assert(n2 == n1); 56 assert(n2 == n2); 57 assert(n2 != noname1) [all...] |
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/localization/locales/locale/locale.operators/ |
eq.pass.cpp | 24 std::locale n2(LOCALE_en_US_UTF_8); 32 assert(cloc != n2); 40 assert(copy != n2); 48 assert(n1 == n2); 53 assert(n2 != cloc); 54 assert(n2 != copy); 55 assert(n2 == n1); 56 assert(n2 == n2); 57 assert(n2 != noname1) [all...] |
/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);
|
/external/clang/test/SemaCXX/ |
pr18284-crash-on-invalid.cpp | 15 namespace n2 { namespace 24 } // namespace n2
|
/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;
|
/prebuilts/python/linux-x86/2.7.5/lib/python2.7/site-packages/setoolsgui/networkx/algorithms/operators/ |
unary.py | 42 R.add_edges_from( ((n,n2) 44 for n2 in G if n2 not in nbrs 45 if n != n2) )
|
/external/v8/src/compiler/ |
graph.h | 35 Node* NewNode(const Operator* op, Node* n1, Node* n2) { 36 Node* nodes[] = {n1, n2}; 39 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3) { 40 Node* nodes[] = {n1, n2, n3}; 43 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4) { 44 Node* nodes[] = {n1, n2, n3, n4}; 47 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4, 49 Node* nodes[] = {n1, n2, n3, n4, n5}; 52 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4, 54 Node* nodes[] = {n1, n2, n3, n4, n5, n6} [all...] |
/cts/apps/CtsVerifier/src/com/android/cts/verifier/audio/wavelib/ |
DspFftServer.java | 53 int ii, jj, kk, n1, n2, aa; local 58 n2 = mN / 2; 60 n1 = n2; 79 n2 = 1; 81 n1 = n2; 82 n2 = n2 + n2; 89 for (kk = jj; kk < mN; kk = kk + n2) {
|
/external/boringssl/src/crypto/bn/ |
mul.c | 305 /* r is 2*n2 words in size, 306 * a and b are both n2 words in size. 307 * n2 must be a power of 2. 309 * t must be 2*n2 words in size 315 /* dnX may not be positive, but n2/2+dnX has to be */ 316 static void bn_mul_recursive(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n2, 318 int n = n2 / 2, c1, c2; 323 /* Only call bn_mul_comba 8 if n2 == 8 and the 326 if (n2 == 8 && dna == 0 && dnb == 0) { 332 if (n2 < BN_MUL_RECURSIVE_SIZE_NORMAL) 450 int i, j, n2 = n * 2; local [all...] |
/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/bzip2/ |
bzmore | 16 n1=''; n2='\c' 18 n1='-n'; n2='' 44 echo $n1 "--More--(Next file: $FILE)$n2"
|
/external/selinux/libsepol/src/ |
ebitmap.c | 20 ebitmap_node_t *n1, *n2, *new, *prev; local 25 n2 = e2->node; 27 while (n1 || n2) { 34 if (n1 && n2 && n1->startbit == n2->startbit) { 36 new->map = n1->map | n2->map; 38 n2 = n2->next; 39 } else if (!n2 || (n1 && n1->startbit < n2->startbit)) 152 ebitmap_node_t *n1, *n2; local 202 ebitmap_node_t *n1, *n2; local [all...] |
/external/clang/test/Sema/ |
attr-section.c | 14 __attribute__((section("NEAR,x"))) static int n2; // ok. local
|
/external/google-breakpad/src/testing/gtest/samples/ |
sample3_unittest.cc | 105 for ( const QueueNode<int> * n1 = q->Head(), * n2 = new_q->Head(); 106 n1 != NULL; n1 = n1->next(), n2 = n2->next() ) { 107 EXPECT_EQ(2 * n1->element(), n2->element());
|
/external/protobuf/gtest/samples/ |
sample3_unittest.cc | 105 for ( const QueueNode<int> * n1 = q->Head(), * n2 = new_q->Head(); 106 n1 != NULL; n1 = n1->next(), n2 = n2->next() ) { 107 EXPECT_EQ(2 * n1->element(), n2->element());
|