symbol, but a macro expanded as (*(OPENSSL_ia32cap_loc())). The latter
is the only one to be exported to application.

performance improvement. Make module more gcc friendly and clarify
copyright issues for division routine.

config and run-time support is added.
PR: 788
Submitted by: <dean@arctic.org>
Reviewed by: <appro>

Obtained from: http://arctic.org/~dean/crypto/rsa.html

especially for AIX. But most important BIGNUM assembler implementation
submitted by IBM.

Submitted by: Peter Waltenberg <pwalten@au1.ibm.com>
Reviewed by: appro

PR: 821

Itanium. I mean if overall performance improvement over C version was X
for Itanium, it's X even for Itanium2.

never called anyway (it's a debugging assertion). If pa-risc2W.s is
PIC remains to be seen...

PR: 413

the divisor was a bit more complex than I first saw.  The lost bit
can't just be discarded, as there are cases where it is important.
For example, look at dividing 320000 with 80000 vs. 80001 (all
decimals), the difference is crucial.  The trick here is to check if
that lost bit was 1, and in that case, do the following:

1. subtract the quotient from the remainder
2. as long as the remainder is negative, add the divisor (the whole
   divisor, not the shofted down copy) to it, and decrease the
   quotient by one.

There's probably a nice mathematical proof for this already, but I
won't bother with that, unless someone requests it from me.

proper implementation of bn_div_words() for VAX.

If the tests go through well, the next step will be to test on Alpha.

PR: 366

PR: 366

I was wrong in conclusions about when addition starts overflowing in combaX
routines.

Submitted by:
Reviewed by:
PR:

Submitted by:
Reviewed by:
PR:

details (performance numbers and accompanying discussions:-). Note that
the code is not engaged in ./Configure yet. I'll add it later this week
along with updates for .spec file.

Submitted by:
Reviewed by:
PR:

Submitted by:
Reviewed by:
PR:

reliable timings yet, please try it out!

I'm a little bit nervous about bn_div_words, as I don't know what it's
supposed to return on overflow.  For now, I trust the rest of the
system to give it numbers that will not cause any overflow...

Submitted by Kevin Steves <ks@hp.se> 3 months ago...

choice of parameters) when they are needed.

problem was that one of the replacement routines had not been working since
SSLeay releases.  For now the offending routine has been replaced with
non-optimised assembler.  Even so, this now gives around 95% performance
improvement for 1024 bit RSA signs.

loop body and replace 'em with addition/subtraction.