/external/clang/test/Sema/ |
H A D | attr-section.c | 14 __attribute__((section("NEAR,x"))) static int n2; // ok. local
|
/external/stlport/test/unit/ |
H A D | 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>());
|
H A D | 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 [all...] |
/external/chromium/chrome/browser/bookmarks/ |
H A D | bookmark_utils_unittest.cc | 26 const BookmarkNode* n2 = local 44 EXPECT_TRUE(nodes[0] == n2); 46 n2, ASCIIToUTF16("cnn"), std::string()));
|
/external/clang/test/CXX/temp/temp.fct.spec/temp.deduct/temp.deduct.call/ |
H A D | p3-0x.cpp | 44 int n2 = f(0); member in namespace:std_example
|
/external/clang/test/FixIt/ |
H A D | fixit-vexing-parse.cpp | 84 int n2, // expected-note {{change this ',' to a ';' to call 'F1'}} local
|
/external/flac/include/share/ |
H A D | alloc.h | 29 // malloc(n1 * n2) then memset to zero 30 static inline void *safe_calloc_(size_t n1, size_t n2) argument 33 return calloc(n1, n2); 36 // malloc(n1 + n2) 37 static inline void *safe_malloc_add_2op_(size_t n1, size_t n2) argument 39 unsigned long long n = n1 + n2; 45 // malloc(n1 * n2) 46 static inline void *safe_malloc_mul_2op_(size_t n1, size_t n2) argument 48 unsigned long long n = n1 * n2; 54 // malloc(n1 * (n2 55 safe_malloc_muladd2_(size_t n1, size_t n2, size_t n3) argument 64 safe_realloc_mul_2op_(void *ptr, size_t n1, size_t n2) argument [all...] |
/external/icu4c/common/unicode/ |
H A D | normalizer2.h | 323 * @param n2 wrapped Normalizer2 instance 327 FilteredNormalizer2(const Normalizer2 &n2, const UnicodeSet &filterSet) : argument 328 norm2(n2), set(filterSet) {}
|
/external/jmonkeyengine/engine/src/test/jme3test/model/shape/ |
H A D | 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);
|
/external/openssl/crypto/rand/ |
H A D | 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];
|
/external/apache-xml/src/main/java/org/apache/xalan/transformer/ |
H A D | NodeSorter.java | 118 * @param n2 Second node to use in compare 127 NodeCompareElem n1, NodeCompareElem n2, int kIndex, XPathContext support) 141 n2Num = ((Double) n2.m_key1Value).doubleValue(); 146 n2Num = ((Double) n2.m_key2Value).doubleValue(); 153 double n2Num = (double)n2.m_keyValue[kIndex]; 161 XObject r2 = k.m_selectPat.execute(m_execContext, n2.m_node, 174 result = compare(n1, n2, kIndex + 1, support); 204 n2String = (CollationKey) n2.m_key1Value; 209 n2String = (CollationKey) n2.m_key2Value; 216 String n2String = (String)n2 126 compare( NodeCompareElem n1, NodeCompareElem n2, int kIndex, XPathContext support) argument [all...] |
/external/clang/test/CodeGenCXX/ |
H A D | destructor-calls.cpp | 39 N n2; local
|
/external/dropbear/libtommath/ |
H A D | 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/samples/uciter8/ |
H A D | uciter8.c | 46 UCharIterator *iter2, const char *n2) { 54 log_err("%s->getIndex(length)=%d != %d=%s->getIndex(length)\n", n1, length, pos2, n2); 69 log_err("%s->move(from 0 to middle %d)=%d does not move to the middle\n", n2, middle, pos2); 77 log_err("%s->current()=U+%04x != U+%04x=%s->current() at middle=%d\n", n1, c1, c2, n2, middle); 86 log_err("%s->next()=U+%04x != U+%04x=%s->next() at %d (started in middle)\n", n1, c1, c2, n2, iter1->getIndex(iter1, UITER_CURRENT)); 96 log_err("%s->previous()=U+%04x != U+%04x=%s->previous() at %d (started in middle)\n", n1, c1, c2, n2, iter1->getIndex(iter1, UITER_CURRENT)); 114 log_err("%s->move(start) failed\n", n2); 118 log_err("%s->hasNext() at the start returns FALSE\n", n2); 126 log_err("%s->next()=U+%04x != U+%04x=%s->next() at %d\n", n1, c1, c2, n2, iter1->getIndex(iter1, UITER_CURRENT)); 136 log_err("%s->hasNext() at the end returns TRUE\n", n2); 45 compareIterators(UCharIterator *iter1, const char *n1, UCharIterator *iter2, const char *n2) argument [all...] |
/external/openssl/crypto/bn/ |
H A D | bn_sqr.c | 206 void bn_sqr_recursive(BN_ULONG *r, const BN_ULONG *a, int n2, BN_ULONG *t) argument 208 int n=n2/2; 213 fprintf(stderr," bn_sqr_recursive %d * %d\n",n2,n2); 215 if (n2 == 4) 224 else if (n2 == 8) 233 if (n2 < BN_SQR_RECURSIVE_SIZE_NORMAL) 235 bn_sqr_normal(r,a,n2,t); 249 p= &(t[n2*2]); 252 bn_sqr_recursive(&(t[n2]), [all...] |
/external/bzip2/ |
H A D | 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/icu4c/common/ |
H A D | 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, sr 101 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, *pErrorCode); local 122 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, *pErrorCode); local 226 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, *pErrorCode); local [all...] |
H A D | normlzr.cpp | 140 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, status); local 143 FilteredNormalizer2(*n2, *uniset_getUnicode32Instance(status)). 146 n2->normalize(source, *dest, status); 175 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, status); local 178 return FilteredNormalizer2(*n2, *uniset_getUnicode32Instance(status)). 181 return n2->quickCheck(source, status); 192 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, status); local 195 return FilteredNormalizer2(*n2, *uniset_getUnicode32Instance(status)). 198 return n2->isNormalized(source, status); 226 const Normalizer2 *n2 local [all...] |
H A D | unormcmp.cpp | 577 const Normalizer2 *n2; local 579 n2=Normalizer2Factory::getNFDInstance(*pErrorCode); 581 n2=Normalizer2Factory::getFCDInstance(*pErrorCode); 597 FilteredNormalizer2 fn2(*n2, *uni32); 599 n2=&fn2; 604 int32_t spanQCYes1=n2->spanQuickCheckYes(str1, *pErrorCode); 605 int32_t spanQCYes2=n2->spanQuickCheckYes(str2, *pErrorCode); 622 n2->normalizeSecondAndAppend(fcd1, unnormalized, *pErrorCode); 629 n2->normalizeSecondAndAppend(fcd2, unnormalized, *pErrorCode);
|
/external/llvm/unittests/VMCore/ |
H A D | MetadataTest.cpp | 92 MDNode *n2 = MDNode::get(Context, c1); local 93 Value *const c2 = n2; 98 EXPECT_NE(n1, n2); 105 EXPECT_EQ(n5, n2); 113 EXPECT_EQ(1u, n2->getNumOperands()); 114 EXPECT_EQ(n1, n2->getOperand(0)); 138 MDNode *n2 = MDNode::get(Context, V2); local 144 NMD->addOperand(n2);
|
/external/openssl/crypto/objects/ |
H A D | 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));
|
/external/apache-xml/src/main/java/org/apache/xpath/objects/ |
H A D | XNodeSet.java | 750 * @param n2 Second number to compare 754 abstract boolean compareNumbers(double n1, double n2); argument 783 * @param n2 Second number to compare 785 * @return true if n1 is less than n2 787 boolean compareNumbers(double n1, double n2) argument 789 return n1 < n2; 819 * @param n2 Second number to compare 821 * @return true if n1 is less than or equal to n2 823 boolean compareNumbers(double n1, double n2) argument 825 return n1 <= n2; 859 compareNumbers(double n1, double n2) argument 895 compareNumbers(double n1, double n2) argument 930 compareNumbers(double n1, double n2) argument 965 compareNumbers(double n1, double n2) argument [all...] |
/external/dexmaker/src/dx/java/com/android/dx/dex/code/ |
H A D | InsnFormat.java | 542 * @param n2 {@code 0..15;} medium-high nibble 546 protected static short codeUnit(int n0, int n1, int n2, int n3) { argument 555 if ((n2 & 0xf) != n2) { 556 throw new IllegalArgumentException("n2 out of range 0..15"); 563 return (short) (n0 | (n1 << 4) | (n2 << 8) | (n3 << 12));
|
/external/libsepol/src/ |
H A D | 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 152 ebitmap_node_t *n1, *n2; local 202 ebitmap_node_t *n1, *n2; local [all...] |
/external/libvorbis/lib/ |
H A D | mdct.c | 57 int n2=n>>1; local 68 T[n2+i*2]=FLOAT_CONV(cos((M_PI/(2*n))*(2*i+1))); 69 T[n2+i*2+1]=FLOAT_CONV(sin((M_PI/(2*n))*(2*i+1))); 399 int n2=n>>1; local 404 DATA_TYPE *iX = in+n2-7; 405 DATA_TYPE *oX = out+n2+n4; 418 iX = in+n2-8; 419 oX = out+n2+n4; 432 mdct_butterflies(init,out+n2,n2); 495 int n2=n>>1; local [all...] |