Home
last modified time | relevance | path

Searched refs:n2 (Results 1 – 25 of 76) sorted by relevance

1234

/external/openssl/crypto/bn/
Dbn_mul.c393 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 …]
Dbn_sqr.c206 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/chromium/base/
Dlinked_list_unittest.cc85 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/stlport/test/unit/
Dmismatch_test.cpp41 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()
Dlexcmp_test.cpp35 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/icu4c/samples/uciter8/
Duciter8.c46 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/icu4c/common/
Dunorm.cpp416 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, *pErrorCode); local
417 return unorm2_quickCheck((const UNormalizer2 *)n2, src, srcLength, pErrorCode);
424 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, *pErrorCode); local
426 FilteredNormalizer2 fn2(*n2, *uniset_getUnicode32Instance(*pErrorCode));
429 return unorm2_quickCheck((const UNormalizer2 *)n2, src, srcLength, pErrorCode);
437 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, *pErrorCode); local
438 return unorm2_isNormalized((const UNormalizer2 *)n2, src, srcLength, pErrorCode);
445 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, *pErrorCode); local
447 FilteredNormalizer2 fn2(*n2, *uniset_getUnicode32Instance(*pErrorCode));
450 return unorm2_isNormalized((const UNormalizer2 *)n2, src, srcLength, pErrorCode);
[all …]
Dnormlzr.cpp140 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 …]
Dunormcmp.cpp577 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/openssl/crypto/rand/
Drandtest.c73 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/
Dgtestutils.h40 #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/srec/srec/cfront/
Dsp_fft.c174 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/gtest/samples/
Dsample3_unittest.cc105 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/protobuf/gtest/samples/
Dsample3_unittest.cc105 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/third_party/icu/source/test/cintltst/
Dcustrtst.c1193 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 …]
/external/icu4c/test/cintltst/
Dcustrtst.c1193 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 …]
/external/openssl/crypto/objects/
Dobj_xref.c207 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/webkit/JavaScriptCore/runtime/
DOperations.h273 double n2; in jsLess() local
274 if (v1.getNumber(n1) && v2.getNumber(n2)) in jsLess()
275 return n1 < n2; in jsLess()
284 bool wasNotString2 = v2.getPrimitiveNumber(callFrame, n2, p2); in jsLess()
287 return n1 < n2; in jsLess()
298 double n2; in jsLessEq() local
299 if (v1.getNumber(n1) && v2.getNumber(n2)) in jsLessEq()
300 return n1 <= n2; in jsLessEq()
309 bool wasNotString2 = v2.getPrimitiveNumber(callFrame, n2, p2); in jsLessEq()
312 return n1 <= n2; in jsLessEq()
/external/stlport/src/c_locale_dummy/
Dc_locale_dummy.c268 const char* s1, size_t n1, const char* s2, size_t n2) { in _Locale_strcmp() argument
271 while (n1 > 0 || n2 > 0) { in _Locale_strcmp()
273 size_t bufsize2 = n2 < 63 ? n2 : 63; in _Locale_strcmp()
280 s2 += bufsize2; n2 -= bufsize2; in _Locale_strcmp()
288 const wchar_t* s1, size_t n1, const wchar_t* s2, size_t n2) { in _WLocale_strcmp() argument
291 while (n1 > 0 || n2 > 0) { in _WLocale_strcmp()
293 size_t bufsize2 = n2 < 63 ? n2 : 63; in _WLocale_strcmp()
300 s2 += bufsize2; n2 -= bufsize2; in _WLocale_strcmp()
/external/bzip2/
Dbzmore16 n1=''; n2='\c'
18 n1='-n'; n2=''
44 echo $n1 "--More--(Next file: $FILE)$n2"
/external/qemu/slirp-android/
Dtcp_subr.c643 u_int n1, n2, n3, n4, n5, n6; in tcp_emu() local
671 if (sscanf(so_rcv->sb_data, "%u%*[ ,]%u", &n1, &n2) == 2) { in tcp_emu()
675 tmpso->so_laddr_port == n2 && in tcp_emu()
679 n2 = sock_address_get_port(&addr); in tcp_emu()
686 "%d,%d\r\n", n1, n2); in tcp_emu()
701 &n1, &n2, &n3, &n4, &n5, &n6, buff); in tcp_emu()
705 laddr = (n1 << 24) | (n2 << 16) | (n3 << 8) | (n4); in tcp_emu()
719 n2 = ((laddr >> 16) & 0xff); in tcp_emu()
726 n1, n2, n3, n4, n5, n6, x==7?buff:""); in tcp_emu()
733 &n1, &n2, &n3, &n4, &n5, &n6, buff); in tcp_emu()
[all …]
/external/v8/test/mjsunit/tools/
Dprofile_view.js83 view.sort(function(n1, n2) { argument
84 return cmpStrs(n1.internalFuncName, n2.internalFuncName) ||
85 (n1.selfTime - n2.selfTime);
/external/v8/test/mjsunit/
Djson.js32 var n2 = new Constructor(value);
33 n2.valueOf = null;
34 assertThrows(function () { n2.toJSON(); }, TypeError);
74 var n2 = new Date(10001); variable
75 n2.toISOString = null;
76 assertThrows(function () { n2.toJSON(); }, TypeError);
/external/qemu/slirp/
Dtcp_subr.c612 u_int n1, n2, n3, n4, n5, n6; in tcp_emu() local
641 if (sscanf(so_rcv->sb_data, "%u%*[ ,]%u", &n1, &n2) == 2) { in tcp_emu()
643 HTONS(n2); in tcp_emu()
647 tmpso->so_lport == n2 && in tcp_emu()
652 n2 = ntohs(addr.sin_port); in tcp_emu()
659 "%d,%d\r\n", n1, n2); in tcp_emu()
970 &n1, &n2, &n3, &n4, &n5, &n6, buff); in tcp_emu()
974 laddr = htonl((n1 << 24) | (n2 << 16) | (n3 << 8) | (n4)); in tcp_emu()
988 n2 = ((laddr >> 16) & 0xff); in tcp_emu()
995 n1, n2, n3, n4, n5, n6, x==7?buff:""); in tcp_emu()
[all …]
/external/stlport/src/c_locale_glibc/
Dc_locale_glibc2.c364 const char *s2, size_t n2) { in _Locale_strcmp() argument
367 while (n1 > 0 || n2 > 0) { in _Locale_strcmp()
369 size_t bufsize2 = n2 < 63 ? n2 : 63; in _Locale_strcmp()
376 s2 += bufsize2; n2 -= bufsize2; in _Locale_strcmp()
384 const wchar_t *s2, size_t n2) { in _WLocale_strcmp() argument
387 while (n1 > 0 || n2 > 0) { in _WLocale_strcmp()
389 size_t bufsize2 = n2 < 63 ? n2 : 63; in _WLocale_strcmp()
396 s2 += bufsize2; n2 -= bufsize2; in _WLocale_strcmp()

1234