I tried to constify the BIGNUM arguments to a few BN functions, among
others BN_mul() (all but r).  However, in BN_mul(), there's the
BN_RECURSION case that will only occur when the lengths of a and b are
1 word from each other (if I understand correctly), and where a and b
get expanded so the get the same length.

I wonder, how much do we gain from BN_RECURSION?  Could the whole
thing be done in a way that doesn't need expanding a or b, so they can
be const?

-- 
Richard Levitte   \ Spannv�gen 38, II \ [EMAIL PROTECTED]
Chairman@Stacken   \ S-168 35  BROMMA  \ T: +46-8-26 52 47
Redakteur@Stacken   \      SWEDEN       \ or +46-709-50 36 10
Procurator Odiosus Ex Infernis                -- [EMAIL PROTECTED]
Member of the OpenSSL development team: http://www.openssl.org/
Software Engineer, Celo Communications: http://www.celocom.com/

Unsolicited commercial email is subject to an archival fee of $400.
See <http://www.stacken.kth.se/~levitte/mail/> for more info.
______________________________________________________________________
OpenSSL Project                                 http://www.openssl.org
Development Mailing List                       [EMAIL PROTECTED]
Automated List Manager                           [EMAIL PROTECTED]

Reply via email to