Home
last modified time | relevance | path

Searched refs:dnb (Results 1 – 4 of 4) sorted by relevance

/openssl/crypto/bn/
H A Dbn_mul.c176 int dna, int dnb, BN_ULONG *t) in bn_mul_recursive() argument
179 int tna = n + dna, tnb = n + dnb; in bn_mul_recursive()
194 if (n2 == 8 && dna == 0 && dnb == 0) { in bn_mul_recursive()
201 bn_mul_normal(r, a, n2 + dna, b, n2 + dnb); in bn_mul_recursive()
202 if ((dna + dnb) < 0) in bn_mul_recursive()
203 memset(&r[2 * n2 + dna + dnb], 0, in bn_mul_recursive()
204 sizeof(BN_ULONG) * -(dna + dnb)); in bn_mul_recursive()
244 if (n == 4 && dna == 0 && dnb == 0) { /* XXX: bn_mul_comba4 could take in bn_mul_recursive()
253 } else if (n == 8 && dna == 0 && dnb == 0) { /* XXX: bn_mul_comba8 could in bn_mul_recursive()
272 bn_mul_recursive(&(r[n2]), &(a[n]), &(b[n]), n, dna, dnb, p); in bn_mul_recursive()
H A DREADME.pod39 int dna, int dnb, BN_ULONG *tmp);
165 bn_mul_recursive(B<r>, B<a>, B<b>, B<n2>, B<dna>, B<dnb>, B<t>) operates
166 on the word arrays B<a> and B<b> of length B<n2>+B<dna> and B<n2>+B<dnb>
167 (B<dna> and B<dnb> are currently allowed to be 0 or negative) and the 2*B<n2>
H A Dbn_local.h653 int dna, int dnb, BN_ULONG *t);
/openssl/
H A DCHANGES.md13783 * Check the values of dna and dnb in bn_mul_recursive before calling

Completed in 63 milliseconds