| /external/openssl/crypto/bn/ |
| D | bn_mul.c | 393 void bn_mul_recursive(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n2, in bn_mul_recursive() argument
396 int n=n2/2,c1,c2; in bn_mul_recursive()
402 fprintf(stderr," bn_mul_recursive %d%+d * %d%+d\n",n2,dna,n2,dnb); in bn_mul_recursive()
406 if (n2 == 4) in bn_mul_recursive()
415 if (n2 == 8 && dna == 0 && dnb == 0) in bn_mul_recursive()
422 if (n2 < BN_MUL_RECURSIVE_SIZE_NORMAL) in bn_mul_recursive()
424 bn_mul_normal(r,a,n2+dna,b,n2+dnb); in bn_mul_recursive()
426 memset(&r[2*n2 + dna + dnb], 0, in bn_mul_recursive()
472 bn_mul_comba4(&(t[n2]),t,&(t[n])); in bn_mul_recursive()
474 memset(&(t[n2]),0,8*sizeof(BN_ULONG)); in bn_mul_recursive()
[all …]
|
| D | bn_sqr.c | 206 void bn_sqr_recursive(BN_ULONG *r, const BN_ULONG *a, int n2, BN_ULONG *t) in bn_sqr_recursive() argument
208 int n=n2/2; in bn_sqr_recursive()
213 fprintf(stderr," bn_sqr_recursive %d * %d\n",n2,n2); in bn_sqr_recursive()
215 if (n2 == 4) in bn_sqr_recursive()
224 else if (n2 == 8) in bn_sqr_recursive()
233 if (n2 < BN_SQR_RECURSIVE_SIZE_NORMAL) in bn_sqr_recursive()
235 bn_sqr_normal(r,a,n2,t); in bn_sqr_recursive()
249 p= &(t[n2*2]); in bn_sqr_recursive()
252 bn_sqr_recursive(&(t[n2]),t,n,p); in bn_sqr_recursive()
254 memset(&(t[n2]),0,n2*sizeof(BN_ULONG)); in bn_sqr_recursive()
[all …]
|
| /external/icu4c/common/ |
| D | unorm.cpp | 51 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, *pErrorCode); in unorm_quickCheck() local
52 return unorm2_quickCheck((const UNormalizer2 *)n2, src, srcLength, pErrorCode); in unorm_quickCheck()
59 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, *pErrorCode); in unorm_quickCheckWithOptions() local
61 FilteredNormalizer2 fn2(*n2, *uniset_getUnicode32Instance(*pErrorCode)); in unorm_quickCheckWithOptions()
66 return unorm2_quickCheck((const UNormalizer2 *)n2, src, srcLength, pErrorCode); in unorm_quickCheckWithOptions()
74 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, *pErrorCode); in unorm_isNormalized() local
75 return unorm2_isNormalized((const UNormalizer2 *)n2, src, srcLength, pErrorCode); in unorm_isNormalized()
82 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, *pErrorCode); in unorm_isNormalizedWithOptions() local
84 FilteredNormalizer2 fn2(*n2, *uniset_getUnicode32Instance(*pErrorCode)); in unorm_isNormalizedWithOptions()
89 return unorm2_isNormalized((const UNormalizer2 *)n2, src, srcLength, pErrorCode); in unorm_isNormalizedWithOptions()
[all …]
|
| D | normlzr.cpp | 140 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, status); in normalize() local
143 FilteredNormalizer2(*n2, *uniset_getUnicode32Instance(status)). in normalize()
146 n2->normalize(source, *dest, status); in normalize()
175 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, status); in quickCheck() local
178 return FilteredNormalizer2(*n2, *uniset_getUnicode32Instance(status)). in quickCheck()
181 return n2->quickCheck(source, status); in quickCheck()
192 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, status); in isNormalized() local
195 return FilteredNormalizer2(*n2, *uniset_getUnicode32Instance(status)). in isNormalized()
198 return n2->isNormalized(source, status); in isNormalized()
226 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, errorCode); in concatenate() local
[all …]
|
| D | unormcmp.cpp | 577 const Normalizer2 *n2; in unorm_compare() local
579 n2=Normalizer2Factory::getNFDInstance(*pErrorCode); in unorm_compare()
581 n2=Normalizer2Factory::getFCDInstance(*pErrorCode); in unorm_compare()
594 FilteredNormalizer2 fn2(*n2, *uni32); in unorm_compare()
596 n2=&fn2; in unorm_compare()
601 int32_t spanQCYes1=n2->spanQuickCheckYes(str1, *pErrorCode); in unorm_compare()
602 int32_t spanQCYes2=n2->spanQuickCheckYes(str2, *pErrorCode); in unorm_compare()
619 n2->normalizeSecondAndAppend(fcd1, unnormalized, *pErrorCode); in unorm_compare()
626 n2->normalizeSecondAndAppend(fcd2, unnormalized, *pErrorCode); in unorm_compare()
|
| /external/flac/include/share/ |
| D | alloc.h | 30 static inline void *safe_calloc_(size_t n1, size_t n2) in safe_calloc_() argument
33 return calloc(n1, n2); in safe_calloc_()
37 static inline void *safe_malloc_add_2op_(size_t n1, size_t n2) in safe_malloc_add_2op_() argument
39 unsigned long long n = n1 + n2; in safe_malloc_add_2op_()
46 static inline void *safe_malloc_mul_2op_(size_t n1, size_t n2) in safe_malloc_mul_2op_() argument
48 unsigned long long n = n1 * n2; in safe_malloc_mul_2op_()
55 static inline void *safe_malloc_muladd2_(size_t n1, size_t n2, size_t n3) in safe_malloc_muladd2_() argument
57 unsigned long long n = n1 * (n2 + n3); in safe_malloc_muladd2_()
64 static inline void *safe_realloc_mul_2op_(void *ptr, size_t n1, size_t n2) in safe_realloc_mul_2op_() argument
66 unsigned long long n = n1 * n2; in safe_realloc_mul_2op_()
|
| /external/stlport/test/unit/ |
| D | mismatch_test.cpp | 41 int n2[5] = { 1, 2, 3, 4, 5 }; in mismatch0() local
44 pair <int*, int*> result = mismatch((int*)n1, (int*)n1 + 5, (int*)n2); in mismatch0()
45 CPPUNIT_ASSERT(result.first ==(n1 + 5) && result.second ==(n2 + 5)); in mismatch0()
72 char const* n2[size]; in mismatch2() local
73 copy(n1, n1 + 5, (char const**)n2); in mismatch2()
74 …const**> result = mismatch((char const**)n1, (char const**)n1 + size, (char const**)n2, str_equal); in mismatch2()
76 CPPUNIT_ASSERT(result.first == n1 + size && result.second == n2 + size); in mismatch2()
78 n2[2] = "QED"; in mismatch2()
79 result = mismatch((char const**)n1, (char const**)n1 + size, (char const**)n2, str_equal); in mismatch2()
80 CPPUNIT_ASSERT(!(result.first == n2 + size && result.second == n2 + size)); in mismatch2()
|
| D | lexcmp_test.cpp | 35 char n2[size] = "shine"; in lexcmp1() local
37 bool before = lexicographical_compare(n1, n1 + size, n2, n2 + size); in lexcmp1()
44 char n2[size] = "shine"; in lexcmp2() local
46 bool before = lexicographical_compare(n1, n1 + size, n2, n2 + size, greater<char>()); in lexcmp2()
|
| /external/chromium/base/ |
| D | linked_list_unittest.cc | 85 Node n2(2); in TEST() local
86 list.Append(&n2); in TEST()
89 EXPECT_EQ(&n2, list.tail()); in TEST()
110 Node n2(2); in TEST() local
116 list.Append(&n2); in TEST()
151 EXPECT_EQ(&n2, list.head()); in TEST()
159 n2.RemoveFromList(); in TEST()
168 list.Append(&n2); in TEST()
185 Node n2(2); in TEST() local
190 list.Append(&n2); in TEST()
[all …]
|
| /external/icu4c/samples/uciter8/ |
| D | uciter8.c | 46 UCharIterator *iter2, const char *n2) { in compareIterators() argument
54 log_err("%s->getIndex(length)=%d != %d=%s->getIndex(length)\n", n1, length, pos2, n2); in compareIterators()
69 log_err("%s->move(from 0 to middle %d)=%d does not move to the middle\n", n2, middle, pos2); in compareIterators()
77 … log_err("%s->current()=U+%04x != U+%04x=%s->current() at middle=%d\n", n1, c1, c2, n2, middle); in compareIterators()
86 …xt()=U+%04x != U+%04x=%s->next() at %d (started in middle)\n", n1, c1, c2, n2, iter1->getIndex(ite… in compareIterators()
96 …=U+%04x != U+%04x=%s->previous() at %d (started in middle)\n", n1, c1, c2, n2, iter1->getIndex(ite… in compareIterators()
114 log_err("%s->move(start) failed\n", n2); in compareIterators()
118 log_err("%s->hasNext() at the start returns FALSE\n", n2); in compareIterators()
126 …log_err("%s->next()=U+%04x != U+%04x=%s->next() at %d\n", n1, c1, c2, n2, iter1->getIndex(iter1, U… in compareIterators()
136 log_err("%s->hasNext() at the end returns TRUE\n", n2); in compareIterators()
[all …]
|
| /external/openssl/crypto/rand/ |
| D | randtest.c | 73 unsigned long n2[16]; in main() local
87 for (i=0; i<16; i++) n2[i]=0; in main()
97 n2[j&0x0f]++; in main()
98 n2[(j>>4)&0x0f]++; in main()
137 d+=n2[i]*n2[i]; in main()
147 d+=n2[i]*n2[i]; in main()
|
| /external/bluetooth/glib/glib/ |
| D | gtestutils.h | 40 #define g_assert_cmpint(n1, cmp, n2) do { gint64 __n1 = (n1), __n2 = (n2); \ argument
43 … #n1 " " #cmp " " #n2, __n1, #cmp, __n2, 'i'); } while (0)
44 #define g_assert_cmpuint(n1, cmp, n2) do { guint64 __n1 = (n1), __n2 = (n2); \ argument
47 … #n1 " " #cmp " " #n2, __n1, #cmp, __n2, 'i'); } while (0)
48 #define g_assert_cmphex(n1, cmp, n2) do { guint64 __n1 = (n1), __n2 = (n2); \ argument
51 … #n1 " " #cmp " " #n2, __n1, #cmp, __n2, 'x'); } while (0)
52 #define g_assert_cmpfloat(n1,cmp,n2) do { long double __n1 = (n1), __n2 = (n2); \ argument
55 … #n1 " " #cmp " " #n2, __n1, #cmp, __n2, 'f'); } while (0)
|
| /external/apache-xml/src/main/java/org/apache/xpath/objects/ |
| D | XNodeSet.java | 754 abstract boolean compareNumbers(double n1, double n2); in compareNumbers() argument
787 boolean compareNumbers(double n1, double n2) in compareNumbers() argument
789 return n1 < n2; in compareNumbers()
823 boolean compareNumbers(double n1, double n2) in compareNumbers() argument
825 return n1 <= n2; in compareNumbers()
859 boolean compareNumbers(double n1, double n2) in compareNumbers() argument
861 return n1 > n2; in compareNumbers()
895 boolean compareNumbers(double n1, double n2) in compareNumbers() argument
897 return n1 >= n2; in compareNumbers()
930 boolean compareNumbers(double n1, double n2) in compareNumbers() argument
[all …]
|
| /external/valgrind/main/exp-ptrcheck/tests/ |
| D | idiv.c | 14 g(/, n, n2, n); // det, det in main()
18 g(/, p, n2, n); // ok, det in main()
25 g(/, un, n2, n); // undet, undet in main()
26 g(/, up, n2, n); // ok, undet in main()
|
| /external/apache-xml/src/main/java/org/apache/xalan/transformer/ |
| D | NodeSorter.java | 127 NodeCompareElem n1, NodeCompareElem n2, int kIndex, XPathContext support) in compare() argument
141 n2Num = ((Double) n2.m_key1Value).doubleValue(); in compare()
146 n2Num = ((Double) n2.m_key2Value).doubleValue(); in compare()
161 XObject r2 = k.m_selectPat.execute(m_execContext, n2.m_node, in compare()
174 result = compare(n1, n2, kIndex + 1, support); in compare()
204 n2String = (CollationKey) n2.m_key1Value; in compare()
209 n2String = (CollationKey) n2.m_key2Value; in compare()
224 XObject r2 = k.m_selectPat.execute(m_execContext, n2.m_node, in compare()
260 result = compare(n1, n2, kIndex + 1, support); in compare()
272 result = dtm.isNodeAfter(n1.m_node, n2.m_node) ? -1 : 1; in compare()
|
| /external/protobuf/gtest/samples/ |
| D | sample3_unittest.cc | 105 for ( const QueueNode<int> * n1 = q->Head(), * n2 = new_q->Head(); in MapTester() local
106 n1 != NULL; n1 = n1->next(), n2 = n2->next() ) { in MapTester()
107 EXPECT_EQ(2 * n1->element(), n2->element()); in MapTester()
|
| /external/gtest/samples/ |
| D | sample3_unittest.cc | 105 for ( const QueueNode<int> * n1 = q->Head(), * n2 = new_q->Head(); in MapTester() local
106 n1 != NULL; n1 = n1->next(), n2 = n2->next() ) { in MapTester()
107 EXPECT_EQ(2 * n1->element(), n2->element()); in MapTester()
|
| /external/chromium/testing/gtest/samples/ |
| D | sample3_unittest.cc | 105 for ( const QueueNode<int> * n1 = q->Head(), * n2 = new_q->Head(); in MapTester() local
106 n1 != NULL; n1 = n1->next(), n2 = n2->next() ) { in MapTester()
107 EXPECT_EQ(2 * n1->element(), n2->element()); in MapTester()
|
| /external/llvm/unittests/VMCore/ |
| D | MetadataTest.cpp | 92 MDNode *n2 = MDNode::get(Context, c1); in TEST_F() local
94 EXPECT_NE(n1, n2); in TEST_F()
106 EXPECT_EQ(1u, n2->getNumOperands()); in TEST_F()
107 EXPECT_EQ(n1, n2->getOperand(0)); in TEST_F()
131 MDNode *n2 = MDNode::get(Context, V2); in TEST() local
137 NMD->addOperand(n2); in TEST()
|
| /external/llvm/include/llvm/CodeGen/PBQP/ |
| D | Graph.h | 129 NodeEntry &n2 = getNode(ne.getNode2()); in addConstructedEdge() local
132 (n2.getCosts().getLength() == ne.getCosts().getCols()) && in addConstructedEdge()
135 ne.setNode2AEItr(n2.addEdge(edgeItr)); in addConstructedEdge()
339 NodeEntry &n2 = getNode(e.getNode2()); in removeEdge() local
341 n2.removeEdge(e.getNode2AEItr()); in removeEdge()
390 bool operator()(Graph::NodeItr n1, Graph::NodeItr n2) const { in operator()
391 return &*n1 < &*n2; in operator()
394 bool operator()(Graph::ConstNodeItr n1, Graph::ConstNodeItr n2) const { in operator()
395 return &*n1 < &*n2; in operator()
|
| /external/srec/srec/cfront/ |
| D | sp_fft.c | 174 unsigned m, n, n2, i, j, i0, is, id, ii, ib; in allocate_butterfly_tbl() local
193 n2 = n << 1; in allocate_butterfly_tbl()
205 id = n2; in allocate_butterfly_tbl()
207 n2 = n2 >> 1; in allocate_butterfly_tbl()
226 is = 2 * id - n2; in allocate_butterfly_tbl()
272 unsigned m, n, n2, n4, i, j, ii, nt; in allocate_trigonomy_tbl() local
286 n2 = n << 1; in allocate_trigonomy_tbl()
289 n2 = n2 >> 1; in allocate_trigonomy_tbl()
290 n4 = n2 >> 2; in allocate_trigonomy_tbl()
291 e = 6.283185307179586 / n2; in allocate_trigonomy_tbl()
[all …]
|
| /external/openssl/crypto/objects/ |
| D | obj_xref.c | 207 int n1, n2, n3; in main() local
221 rv = OBJ_find_sigid_algs(n1, &n2, &n3); in main()
223 OBJ_nid2ln(n1), OBJ_nid2ln(n2), OBJ_nid2ln(n3)); in main()
225 rv = OBJ_find_sigid_by_algs(&n1, n2, n3); in main()
227 OBJ_nid2ln(n1), OBJ_nid2ln(n2), OBJ_nid2ln(n3)); in main()
|
| /external/bzip2/ |
| D | bzmore | 16 n1=''; n2='\c'
18 n1='-n'; n2=''
44 echo $n1 "--More--(Next file: $FILE)$n2"
|
| /external/v8/test/mjsunit/tools/ |
| D | profile_view.js | 83 view.sort(function(n1, n2) { argument
84 return cmpStrs(n1.internalFuncName, n2.internalFuncName) ||
85 (n1.selfTime - n2.selfTime);
|
| /external/icu4c/test/cintltst/ |
| D | custrtst.c | 1193 UCharIterator *iter2, const char *n2) { in compareIterators() argument
1201 log_err("%s->getIndex(length)=%d != %d=%s->getIndex(length)\n", n1, length, pos2, n2); in compareIterators()
1216 log_err("%s->move(from 0 to middle %d)=%d does not move to the middle\n", n2, middle, pos2); in compareIterators()
1224 … log_err("%s->current()=U+%04x != U+%04x=%s->current() at middle=%d\n", n1, c1, c2, n2, middle); in compareIterators()
1233 …xt()=U+%04x != U+%04x=%s->next() at %d (started in middle)\n", n1, c1, c2, n2, iter1->getIndex(ite… in compareIterators()
1243 …=U+%04x != U+%04x=%s->previous() at %d (started in middle)\n", n1, c1, c2, n2, iter1->getIndex(ite… in compareIterators()
1261 log_err("%s->move(start) failed\n", n2); in compareIterators()
1265 log_err("%s->hasNext() at the start returns FALSE\n", n2); in compareIterators()
1273 …log_err("%s->next()=U+%04x != U+%04x=%s->next() at %d\n", n1, c1, c2, n2, iter1->getIndex(iter1, U… in compareIterators()
1283 log_err("%s->hasNext() at the end returns TRUE\n", n2); in compareIterators()
[all …]
|