/external/clang/test/Sema/ |
attr-section.c | 14 __attribute__((section("NEAR,x"))) static int n2; // ok. local
|
/external/stlport/test/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-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/chromium/chrome/browser/bookmarks/ |
bookmark_utils_unittest.cc | 26 const BookmarkNode* n2 = local 44 EXPECT_TRUE(nodes[0] == n2); 46 n2, ASCIIToUTF16("cnn"), std::string()));
|
/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
|
p6.cpp | 6 alignas(8) int n2; // expected-note {{previous declaration}} variable 7 alignas(4) extern int n2; // expected-error {{different alignment requirement (4 vs 8)}}
|
/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/openssl/crypto/rand/ |
randtest.c | 73 unsigned long n2[16]; local 87 for (i=0; i<16; i++) n2[i]=0; 97 n2[j&0x0f]++; 98 n2[(j>>4)&0x0f]++; 137 d+=n2[i]*n2[i]; 147 d+=n2[i]*n2[i];
|
/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/dropbear/libtommath/ |
bn_mp_div.c | 24 int res, n, n2; local 74 n2 = (a->sign == b->sign ? MP_ZPOS : MP_NEG); 77 c->sign = (mp_iszero(c) == MP_YES) ? MP_ZPOS : n2;
|
/external/icu4c/common/ |
unorm.cpp | 51 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, *pErrorCode); local 52 return unorm2_quickCheck((const UNormalizer2 *)n2, src, srcLength, pErrorCode); 59 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, *pErrorCode); local 61 FilteredNormalizer2 fn2(*n2, *uniset_getUnicode32Instance(*pErrorCode)); 66 return unorm2_quickCheck((const UNormalizer2 *)n2, src, srcLength, pErrorCode); 74 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, *pErrorCode); local 75 return unorm2_isNormalized((const UNormalizer2 *)n2, src, srcLength, pErrorCode); 82 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, *pErrorCode); local 84 FilteredNormalizer2 fn2(*n2, *uniset_getUnicode32Instance(*pErrorCode)); 89 return unorm2_isNormalized((const UNormalizer2 *)n2, src, srcLength, pErrorCode) 101 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, *pErrorCode); local 182 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, *pErrorCode); local 266 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, *pErrorCode); local [all...] |
/external/openssl/crypto/objects/ |
obj_xref.c | 210 int n1, n2, n3; local 224 rv = OBJ_find_sigid_algs(n1, &n2, &n3); 226 OBJ_nid2ln(n1), OBJ_nid2ln(n2), OBJ_nid2ln(n3)); 228 rv = OBJ_find_sigid_by_algs(&n1, n2, n3); 230 OBJ_nid2ln(n1), OBJ_nid2ln(n2), OBJ_nid2ln(n3));
|
/frameworks/base/services/common_time/ |
common_clock.cpp | 132 uint32_t n2 = 1000000 + cur_slew_; local 139 LinearTransform::reduce(&n2, &d1); 140 LinearTransform::reduce(&n2, &d2); 144 cur_trans_.a_to_b_numer = n1 * n2;
|
/ndk/sources/cxx-stl/llvm-libc++/src/ |
string.cpp | 375 size_t n2 = static_cast<size_t>(snprintf(&s[0], s.size()+1, "%d", val)); local 376 if (n2 <= s.size()) 378 s.resize(n2); 381 s.resize(n2); 392 size_t n2 = static_cast<size_t>(snprintf(&s[0], s.size()+1, "%u", val)); local 393 if (n2 <= s.size()) 395 s.resize(n2); 398 s.resize(n2); 409 size_t n2 = static_cast<size_t>(snprintf(&s[0], s.size()+1, "%ld", val)); local 410 if (n2 <= s.size() 426 size_t n2 = static_cast<size_t>(snprintf(&s[0], s.size()+1, "%lu", val)); local 443 size_t n2 = static_cast<size_t>(snprintf(&s[0], s.size()+1, "%lld", val)); local 460 size_t n2 = static_cast<size_t>(snprintf(&s[0], s.size()+1, "%llu", val)); local 477 size_t n2 = static_cast<size_t>(snprintf(&s[0], s.size()+1, "%f", val)); local 494 size_t n2 = static_cast<size_t>(snprintf(&s[0], s.size()+1, "%f", val)); local 511 size_t n2 = static_cast<size_t>(snprintf(&s[0], s.size()+1, "%Lf", val)); local 531 int n2 = swprintf(&s[0], s.size()+1, L"%d", val); local 552 int n2 = swprintf(&s[0], s.size()+1, L"%u", val); local 573 int n2 = swprintf(&s[0], s.size()+1, L"%ld", val); local 594 int n2 = swprintf(&s[0], s.size()+1, L"%lu", val); local 615 int n2 = swprintf(&s[0], s.size()+1, L"%lld", val); local 636 int n2 = swprintf(&s[0], s.size()+1, L"%llu", val); local 655 int n2 = swprintf(&s[0], s.size()+1, L"%f", val); local 674 int n2 = swprintf(&s[0], s.size()+1, L"%f", val); local 693 int n2 = swprintf(&s[0], s.size()+1, L"%Lf", val); local [all...] |
/external/bzip2/ |
huffman.c | 72 Int32 nNodes, nHeap, n1, n2, i, j, k; local 102 n2 = heap[1]; heap[1] = heap[nHeap]; nHeap--; DOWNHEAP(1); 104 parent[n1] = parent[n2] = nNodes; 105 weight[nNodes] = ADDWEIGHTS(weight[n1], weight[n2]);
|
/external/clang/test/CodeGenCXX/ |
destructor-calls.cpp | 39 N n2; local
|
/external/eigen/Eigen/src/Eigen2Support/Geometry/ |
AngleAxis.h | 160 Scalar n2 = q.vec().squaredNorm(); local 161 if (n2 < precision<Scalar>()*precision<Scalar>()) 169 m_axis = q.vec() / ei_sqrt(n2);
|
/external/guava/guava-tests/test/com/google/common/base/ |
ObjectsTest.java | 68 Long n2 = Objects.firstNonNull(null, n1); local 69 assertSame(n1, n2);
|
/external/jmonkeyengine/engine/src/test/jme3test/model/shape/ |
TestBillboard.java | 85 n2=new Node("parentParent"); 86 n2.setLocalTranslation(Vector3f.UNIT_X.mult(5)); 87 n2.attachChild(n); 89 rootNode.attachChild(n2); 96 Node n2; field in class:TestBillboard 102 n2.rotate(0, 0, -tpf);
|