Home
last modified time | relevance | path

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

123

/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/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/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/webkit/JavaScriptCore/runtime/
DOperations.h143 double n2; in jsLess() local
144 if (v1.getNumber(n1) && v2.getNumber(n2)) in jsLess()
145 return n1 < n2; in jsLess()
154 bool wasNotString2 = v2.getPrimitiveNumber(callFrame, n2, p2); in jsLess()
157 return n1 < n2; in jsLess()
168 double n2; in jsLessEq() local
169 if (v1.getNumber(n1) && v2.getNumber(n2)) in jsLessEq()
170 return n1 <= n2; in jsLessEq()
179 bool wasNotString2 = v2.getPrimitiveNumber(callFrame, n2, p2); in jsLessEq()
182 return n1 <= n2; in jsLessEq()
/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/tesseract/liblept/
Dclassapp.c55 NUMA *nasy, l_int32 n1, l_int32 n2,
60 l_int32 *index2, l_int32 n2);
648 l_int32 n1, n2, i, j, nbox, y1, y2, xl1, xl2; in numaaCompareImagesByBoxes() local
670 n2 = numaaGetCount(naa2); in numaaCompareImagesByBoxes()
671 if (n1 < nreq || n2 < nreq) in numaaCompareImagesByBoxes()
678 line2 = (l_int32 *)CALLOC(n2, sizeof(l_int32)); in numaaCompareImagesByBoxes()
680 yloc2 = (l_int32 *)CALLOC(n2, sizeof(l_int32)); in numaaCompareImagesByBoxes()
682 xleft2 = (l_int32 *)CALLOC(n2, sizeof(l_int32)); in numaaCompareImagesByBoxes()
692 for (i = 0; i < n2; i++) { in numaaCompareImagesByBoxes()
718 for (j = 0; j < n2; j++) { in numaaCompareImagesByBoxes()
[all …]
/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/webkit/V8Binding/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/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/bzip2/
Dbzmore16 n1=''; n2='\c'
18 n1='-n'; n2=''
44 echo $n1 "--More--(Next file: $FILE)$n2"
Dhuffman.c72 Int32 nNodes, nHeap, n1, n2, i, j, k; in BZ2_hbMakeCodeLengths() local
102 n2 = heap[1]; heap[1] = heap[nHeap]; nHeap--; DOWNHEAP(1); in BZ2_hbMakeCodeLengths()
104 parent[n1] = parent[n2] = nNodes; in BZ2_hbMakeCodeLengths()
105 weight[nNodes] = ADDWEIGHTS(weight[n1], weight[n2]); in BZ2_hbMakeCodeLengths()
/external/webkit/V8Binding/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/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/opencore/codecs_v2/audio/aac/dec/src/
Dfft_rx4_long.cpp199 Int n2; in fft_rx4_long() local
231 n2 = FFT_RX4_LONG; in fft_rx4_long()
236 n1 = n2; in fft_rx4_long()
237 n2 >>= 2; in fft_rx4_long()
285 for (j = 1; j < n2; j++) in fft_rx4_long()
Dfft_rx4_short.cpp197 Int n2; in fft_rx4_short() local
242 n2 = FFT_RX4_SHORT; in fft_rx4_short()
253 n1 = n2; in fft_rx4_short()
254 n2 >>= 2; in fft_rx4_short()
313 for (j = 1; j < n2; j++) in fft_rx4_short()
/external/webkit/JavaScriptCore/tests/mozilla/ecma_3/NumberFormatting/
Dtostring-001.js31 var n2 = 1.6e24;
38 reportCompare ("1.6e+24", n2.toString(), "1.6e24 toString()");
/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/bluetooth/hcidump/parser/
Dsdp.c451 int len, n1 = 0, n2 = 0; in print_srv_srch_pat() local
459 if (parse_de_hdr(frm, &n2) == SDP_DE_UUID) { in print_srv_srch_pat()
460 print_uuid(n2, frm, NULL, NULL); in print_srv_srch_pat()
477 int len, n1 = 0, n2 = 0; in print_attr_id_list() local
486 if (parse_de_hdr(frm, &n2) == SDP_DE_UINT) { in print_attr_id_list()
488 switch(n2) { in print_attr_id_list()
519 int len, split, n1 = 0, n2 = 0; in print_attr_list() local
525 if (parse_de_hdr(frm, &n2) == SDP_DE_UINT && n2 == sizeof(attr_id)) { in print_attr_list()
/external/elfutils/libelf/
Delf32_fsize.c58 #define local_strong_alias(n1, n2) strong_alias (n1, n2) argument
/external/openssl/crypto/lhash/
Dlhash.c307 LHASH_NODE **n,**n1,**n2,*np; in expand() local
315 n2= &(lh->b[p+(int)lh->pmax]); in expand()
316 *n2=NULL; /* 27/07/92 - eay - undefined pointer bug */ in expand()
330 np->next= *n2; in expand()
331 *n2=np; in expand()
/external/aes/
Daestab.c232 { aes_08t p1 = x, p2 = BPOLY, n1 = hibit(x), n2 = 0x80, v1 = 1, v2 = 0;
240 while(n2 >= n1)
242 n2 /= n1; p2 ^= p1 * n2; v2 ^= v1 * n2; n2 = hibit(p2);
245 if(!n2) return v2;
247 while(n1 >= n2)
249 n1 /= n2; p1 ^= p2 * n1; v1 ^= v2 * n1; n1 = hibit(p1);
/external/webkit/WebCore/xml/
DXPathParser.cpp265 String n2; in lexQName() local
266 if (!lexNCName(n2)) in lexQName()
269 name = n1 + ":" + n2; in lexQName()
375 String n2; in nextTokenInternal() local
376 if (!lexNCName(n2)) in nextTokenInternal()
379 name = name + ":" + n2; in nextTokenInternal()
/external/openssl/crypto/ec/
Decp_smpl.c1008 BIGNUM *n0, *n1, *n2, *n3, *n4, *n5, *n6; in ec_GFp_simple_add() local
1032 n2 = BN_CTX_get(ctx); in ec_GFp_simple_add()
1048 if (!BN_copy(n2, &a->Y)) goto end; in ec_GFp_simple_add()
1059 if (!field_mul(group, n2, &a->Y, n0, ctx)) goto end; in ec_GFp_simple_add()
1084 if (!BN_mod_sub_quick(n6, n2, n4, p)) goto end; in ec_GFp_simple_add()
1110 if (!BN_mod_add_quick(n2, n2, n4, p)) goto end; in ec_GFp_simple_add()
1147 if (!field_mul(group, n1, n2, n5, ctx)) goto end; in ec_GFp_simple_add()
1172 BIGNUM *n0, *n1, *n2, *n3; in ec_GFp_simple_dbl() local
1196 n2 = BN_CTX_get(ctx); in ec_GFp_simple_dbl()
1218 if (!BN_mod_sub_quick(n2, &a->X, n1, p)) goto err; in ec_GFp_simple_dbl()
[all …]

123