Home
last modified time | relevance | path

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

/openssl/crypto/bn/
H A Dbn_mul.c175 void bn_mul_recursive(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n2, in bn_mul_recursive() function
268 bn_mul_recursive(&(t[n2]), t, &(t[n]), n, 0, 0, p); in bn_mul_recursive()
271 bn_mul_recursive(r, a, b, n, 0, 0, p); in bn_mul_recursive()
272 bn_mul_recursive(&(r[n2]), &(a[n]), &(b[n]), n, dna, dnb, p); in bn_mul_recursive()
382 bn_mul_recursive(&(t[n2]), t, &(t[n]), n, 0, 0, p); in bn_mul_part_recursive()
383 bn_mul_recursive(r, a, b, n, 0, 0, p); in bn_mul_part_recursive()
393 bn_mul_recursive(&(r[n2]), &(a[n]), &(b[n]), in bn_mul_part_recursive()
420 bn_mul_recursive(&(r[n2]), in bn_mul_part_recursive()
482 bn_mul_recursive(r, a, b, n, 0, 0, &(t[0])); in bn_mul_low_recursive()
595 bn_mul_recursive(rr->d, a->d, b->d, j, al - j, bl - j, t->d); in bn_mul_fixed_top()
H A DREADME.pod8 bn_mul_low_normal, bn_mul_recursive, bn_mul_part_recursive,
38 void bn_mul_recursive(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n2,
165 bn_mul_recursive(B<r>, B<a>, B<b>, B<n2>, B<dna>, B<dnb>, B<t>) operates
181 words long, bn_mul_recursive() if they are larger than
H A Dbn_local.h652 void bn_mul_recursive(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n2,
/openssl/
H A DCHANGES.md13847 * Check the values of dna and dnb in bn_mul_recursive before calling

Completed in 77 milliseconds