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

1234567891011>>

/external/chromium_org/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/chromium_org/tools/auto_bisect/
H A Dttest.py50 n2 = len(sample2)
51 t = _TValue(mean1, mean2, v1, v2, n1, n2)
52 df = _DegreesOfFreedom(v1, v2, n1, n2)
57 def _TValue(mean1, mean2, v1, v2, n1, n2):
69 n2: Sample size of sample 2.
77 return (mean1 - mean2) / (math.sqrt(v1 / n1 + v2 / n2))
80 def _DegreesOfFreedom(v1, v2, n1, n2):
90 n2: Size of sample 2.
99 if n1 <= 1 or n2 <= 2:
101 df = (((v1 / n1 + v2 / n2) **
[all...]
/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/chromium_org/v8/test/cctest/compiler/
H A Dtest-node.cc23 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
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...]
H A Dtest-node-algorithm.cc58 Node* n2 = graph.NewNode(&dummy_operator, graph.start()); local
59 Node* n3 = graph.NewNode(&dummy_operator, n2);
60 Node* n4 = graph.NewNode(&dummy_operator, n2, n3);
61 Node* n5 = graph.NewNode(&dummy_operator, n4, n2);
69 CHECK(n2->id() == node_visitor.nodes_[1]->id());
78 Node* n2 = graph.NewNode(&dummy_operator, graph.start()); local
79 Node* n3 = graph.NewNode(&dummy_operator, n2);
80 Node* n4 = graph.NewNode(&dummy_operator, n2, n3);
81 Node* n5 = graph.NewNode(&dummy_operator, n4, n2);
89 CHECK(n2
97 Node* n2 = graph.NewNode(&dummy_operator, graph.start()); local
124 Node* n2 = graph.NewNode(&dummy_operator, graph.start()); local
161 Node* n2 = graph.NewNode(&dummy_operator, n1); local
220 Node* n2 = graph.NewNode(&dummy_operator, n0); local
314 Node* n2 = graph.NewNode(&dummy_operator, graph.start()); local
[all...]
/external/libutf/
H A Dutfutf.c29 long f, n1, n2; local
37 n2 = strlen(s2);
39 if(strncmp(p, s2, n2) == 0)
/external/libcxx/test/localization/locales/locale/locale.operators/
H A Deq.pass.cpp24 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 !
[all...]
/external/chromium_org/third_party/smhasher/src/
H A DStats.cpp77 double n2 = n * 1; local
79 if(n2 < 0) n2 = 0;
81 n2 *= 100;
83 if(n2 > 64) n2 = 64;
85 int n3 = (int)n2;
/external/clang/test/SemaCXX/
H A Dpr18284-crash-on-invalid.cpp15 namespace n2 { namespace
24 } // namespace n2
/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.c207 void bn_sqr_recursive(BN_ULONG *r, const BN_ULONG *a, int n2, BN_ULONG *t) argument
209 int n=n2/2;
214 fprintf(stderr," bn_sqr_recursive %d * %d\n",n2,n2);
216 if (n2 == 4)
225 else if (n2 == 8)
234 if (n2 < BN_SQR_RECURSIVE_SIZE_NORMAL)
236 bn_sqr_normal(r,a,n2,t);
250 p= &(t[n2*2]);
253 bn_sqr_recursive(&(t[n2]),
[all...]
/external/chromium_org/v8/src/compiler/
H A Dgraph.h35 Node* NewNode(const Operator* op, Node* n1, Node* n2) { argument
36 Node* nodes[] = {n1, n2};
39 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3) { argument
40 Node* nodes[] = {n1, n2, n3};
43 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4) { argument
44 Node* nodes[] = {n1, n2, n3, n4};
47 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4, argument
49 Node* nodes[] = {n1, n2, n3, n4, n5};
52 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4, argument
54 Node* nodes[] = {n1, n2, n
[all...]
/external/chromium_org/third_party/boringssl/src/crypto/bn/
H A Dmul.c303 /* r is 2*n2 words in size,
304 * a and b are both n2 words in size.
305 * n2 must be a power of 2.
307 * t must be 2*n2 words in size
313 /* dnX may not be positive, but n2/2+dnX has to be */
314 static void bn_mul_recursive(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n2, argument
316 int n = n2 / 2, c1, c2;
321 /* Only call bn_mul_comba 8 if n2 == 8 and the
324 if (n2 == 8 && dna == 0 && dnb == 0) {
330 if (n2 < BN_MUL_RECURSIVE_SIZE_NORMA
447 int i, j, n2 = n * 2; local
721 bn_sqr_recursive(BN_ULONG *r, const BN_ULONG *a, int n2, BN_ULONG *t) argument
[all...]
/external/chromium_org/third_party/icu/source/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
117 _iterate(UCharIterator *src, UBool forward, UChar *dest, int32_t destCapacity, const Normalizer2 *n2, UBool doNormalize, UBool *pNeededToNormalize, UErrorCode *pErrorCode) argument
182 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, *pErrorCode); local
225 _concatenate(const UChar *left, int32_t leftLength, const UChar *right, int32_t rightLength, UChar *dest, int32_t destCapacity, const Normalizer2 *n2, UErrorCode *pErrorCode) argument
266 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, *pErrorCode); local
[all...]
/external/icu/icu4c/source/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
117 _iterate(UCharIterator *src, UBool forward, UChar *dest, int32_t destCapacity, const Normalizer2 *n2, UBool doNormalize, UBool *pNeededToNormalize, UErrorCode *pErrorCode) argument
182 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, *pErrorCode); local
225 _concatenate(const UChar *left, int32_t leftLength, const UChar *right, int32_t rightLength, UChar *dest, int32_t destCapacity, const Normalizer2 *n2, UErrorCode *pErrorCode) argument
266 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/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_org/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/clang/test/Sema/
H A Dattr-section.c14 __attribute__((section("NEAR,x"))) static int n2; // ok. local
/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/chromium_org/base/containers/
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/elfutils/0.153/libelf/
H A Delf32_fsize.c92 #define local_strong_alias(n1, n2) strong_alias (n1, n2)

Completed in 7865 milliseconds

1234567891011>>