1. 30 11月, 2000 2 次提交
  2. 29 11月, 2000 4 次提交
  3. 28 11月, 2000 2 次提交
  4. 27 11月, 2000 3 次提交
  5. 19 11月, 2000 1 次提交
    • R
      Remove two bn_wexpand() from BN_mul(), which is a step toward getting · baa257f1
      Richard Levitte 提交于
      BN_mul() correctly constified, avoids two realloc()'s that aren't
      really necessary and saves memory to boot.  This required a small
      change in bn_mul_part_recursive() and the addition of variants of
      bn_cmp_words(), bn_add_words() and bn_sub_words() that can take arrays
      with differing sizes.
      
      The test results show a performance that very closely matches the
      original code from before my constification.  This may seem like a
      very small win from a performance point of view, but if one remembers
      that the variants of bn_cmp_words(), bn_add_words() and bn_sub_words()
      are not at all optimized for the moment (and there's no corresponding
      assembler code), and that their use may be just as non-optimal, I'm
      pretty confident there are possibilities...
      
      This code needs reviewing!
      baa257f1
  6. 17 11月, 2000 1 次提交
  7. 09 11月, 2000 1 次提交
  8. 08 11月, 2000 1 次提交
  9. 07 11月, 2000 5 次提交
  10. 06 11月, 2000 1 次提交
  11. 03 11月, 2000 3 次提交
  12. 02 11月, 2000 1 次提交
  13. 01 11月, 2000 4 次提交
  14. 29 10月, 2000 1 次提交
  15. 27 10月, 2000 4 次提交
  16. 22 10月, 2000 3 次提交
  17. 20 10月, 2000 1 次提交
  18. 15 10月, 2000 2 次提交