Skip to content
  1. Dec 02, 2002
    • Richard Levitte's avatar
      I think I got it now. Apparently, the case of having to shift down · 6ab285bf
      Richard Levitte authored
      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.
      6ab285bf
    • Richard Levitte's avatar
      Make some names consistent. · 1d3159bc
      Richard Levitte authored
      1d3159bc
    • Richard Levitte's avatar
      Through some experimentation and thinking, I think I finally got the · f60ceb54
      Richard Levitte authored
      proper implementation of bn_div_words() for VAX.
      
      If the tests go through well, the next step will be to test on Alpha.
      f60ceb54
  2. Dec 01, 2002
  3. Nov 29, 2002
  4. Nov 28, 2002
  5. Nov 27, 2002
  6. Nov 26, 2002
  7. Nov 23, 2002
  8. Nov 22, 2002
  9. Nov 21, 2002
  10. Nov 20, 2002
  11. Nov 19, 2002
  12. Nov 18, 2002