Searched refs:n2 (Results 1 - 25 of 159) sorted by relevance

1234567

/external/v8/test/mjsunit/
H A Dthis-property-assignment.js40 var n2 = new Node();
41 assertEquals(3, n2.a);
/external/stlport/test/unit/
H A Dlexcmp_test.cpp35 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 Dmismatch_test.cpp41 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/webkit/Source/JavaScriptCore/tests/mozilla/ecma_3/NumberFormatting/
H A Dtostring-001.js31 var n2 = 1.6e24;
38 reportCompare ("1.6e+24", n2.toString(), "1.6e24 toString()");
/external/flac/include/share/
H A Dalloc.h29 // 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/clang/test/Sema/
H A Dattr-section.c14 __attribute__((section("NEAR,x"))) static int n2; // ok. local
/external/openssl/crypto/bn/
H A Dbn_mul.c382 /* r is 2*n2 words in size,
383 * a and b are both n2 words in size.
384 * n2 must be a power of 2.
386 * t must be 2*n2 words in size
392 /* dnX may not be positive, but n2/2+dnX has to be */
393 void bn_mul_recursive(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n2, argument
396 int n=n2/2,c1,c2;
402 fprintf(stderr," bn_mul_recursive %d%+d * %d%+d\n",n2,dna,n2,dnb);
406 if (n2
553 int i,j,n2=n*2; local
726 bn_mul_low_recursive(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n2, BN_ULONG *t) argument
757 bn_mul_high(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, BN_ULONG *l, int n2, BN_ULONG *t) argument
[all...]
H A Dbn_sqr.c206 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/icu4c/common/
H A Dunorm.cpp51 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...]
/external/bzip2/
H A Dbzmore16 n1=''; n2='\c'
18 n1='-n'; n2=''
44 echo $n1 "--More--(Next file: $FILE)$n2"
/external/chromium/base/
H A Dlinked_list_unittest.cc85 Node n2(2);
86 list.Append(&n2);
89 EXPECT_EQ(&n2, list.tail());
110 Node n2(2);
116 list.Append(&n2);
151 EXPECT_EQ(&n2, list.head());
159 n2.RemoveFromList();
168 list.Append(&n2);
185 Node n2(2);
190 list.Append(&n2);
[all...]
/external/libsepol/src/
H A Debitmap.c20 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/openssl/crypto/rand/
H A Drandtest.c73 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/chromium/testing/gtest/samples/
H A Dsample3_unittest.cc105 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/gtest/samples/
H A Dsample3_unittest.cc105 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/
H A Dsample3_unittest.cc105 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/jmonkeyengine/engine/src/test/jme3test/model/shape/
H A DTestBillboard.java85 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/elfutils/libelf/
H A Delf32_fsize.c93 #define local_strong_alias(n1, n2) strong_alias (n1, n2)
/external/llvm/unittests/VMCore/
H A DMetadataTest.cpp92 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/icu4c/samples/uciter8/
H A Duciter8.c46 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/v8/test/mjsunit/tools/
H A Dprofile_view.js84 view.sort(function(n1, n2) {
85 return cmpStrs(n1.internalFuncName, n2.internalFuncName) ||
86 (n1.selfTime - n2.selfTime);
/external/libvorbis/lib/
H A Dmdct.c57 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...]
/external/aac/libSYS/include/
H A DgenericStds.h175 #define C_ALLOC_MEM2(name,type,n1,n2) \
176 type * Get ## name (int n) { FDK_ASSERT((n) < (n2)); return ((type*)FDKcalloc(n1, sizeof(type))); } \
178 UINT GetRequiredMem ## name(void) { return ALGN_SIZE_EXTRES((n1) * sizeof(type)) * (n2); }
187 #define C_AALLOC_MEM2(name,type,n1,n2) \
188 type * Get ## name (int n) { FDK_ASSERT((n) < (n2)); return ((type*)FDKaalloc((n1)*sizeof(type), ALIGNMENT_DEFAULT)); } \
190 UINT GetRequiredMem ## name(void) { return ALGN_SIZE_EXTRES((n1) * sizeof(type) + ALIGNMENT_DEFAULT + sizeof(void *)) * (n2); }
199 #define C_ALLOC_MEM2_L(name,type,n1,n2,s) \
200 type * Get ## name (int n) { FDK_ASSERT((n) < (n2)); return (type*)FDKcalloc_L(n1, sizeof(type), s); } \
202 UINT GetRequiredMem ## name(void) { return ALGN_SIZE_EXTRES((n1) * sizeof(type)) * (n2); }
211 #define C_AALLOC_MEM2_L(name,type,n1,n2,
[all...]
/external/openssl/crypto/objects/
H A Dobj_xref.c210 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/xalan/transformer/
H A DNodeSorter.java118 * @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...]

Completed in 458 milliseconds

1234567