openssl - Mirror of https://github.com/openssl/openssl

Age	Commit message (Collapse)	Author
2016-05-23	VMS: remove last VAX vestiges	Richard Levitte
	Reviewed-by: Rich Salz <rsalz@openssl.org>
2002-12-23	Finally, a bn_div_words() in VAX assembler that goes through all tests.	Richard Levitte
	PR: 413
2002-12-20	More accurate comments.	Richard Levitte

2002-12-02	I think I got it now. Apparently, the case of having to shift down	Richard Levitte
	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.
2002-12-02	Make some names consistent.	Richard Levitte

2002-12-02	Through some experimentation and thinking, I think I finally got the	Richard Levitte
	proper implementation of bn_div_words() for VAX. If the tests go through well, the next step will be to test on Alpha.
2002-12-01	Small bugfix: even when r == d, we need to adjust r and q.	Richard Levitte
	PR: 366
2002-12-01	Redo the VAX assembler version of bn_div_words().	Richard Levitte
	PR: 366
2001-05-14	branch on equal is beql, not beq...	Richard Levitte

2001-03-09	Bug fixes.	Richard Levitte

2000-11-22	Correct a number of syntax errors.	Richard Levitte

2000-11-21	Reimplement bn_div_words, bn_add_words and bn_sub_words for VAX.	Richard Levitte
	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...
1999-05-13	VMS support.	Ulf Möller
	Submitted by: Richard Levitte <richard@levitte.org>