1. 13 12月, 2000 1 次提交
    • D
      · 2aff7727
      Dr. Stephen Henson 提交于
      Rewrite the extension code to use an ASN1_ITEM structure
      for its ASN1 operations as well as the old style function
      pointers (i2d, d2i, new, free). Change standard extensions
      to support this.
      
      Fix a warning in BN_mul(), bn_mul.c about uninitialised 'j'.
      2aff7727
  2. 06 12月, 2000 1 次提交
  3. 05 12月, 2000 2 次提交
  4. 02 12月, 2000 1 次提交
  5. 01 12月, 2000 1 次提交
  6. 29 11月, 2000 1 次提交
  7. 22 11月, 2000 1 次提交
  8. 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
  9. 17 11月, 2000 1 次提交
  10. 07 11月, 2000 1 次提交
  11. 26 7月, 2000 1 次提交
  12. 02 3月, 2000 2 次提交
  13. 27 2月, 2000 2 次提交
  14. 05 2月, 2000 1 次提交
  15. 04 2月, 2000 1 次提交
  16. 27 7月, 1999 1 次提交
  17. 20 4月, 1999 1 次提交
  18. 28 1月, 1999 1 次提交
  19. 22 12月, 1998 1 次提交
  20. 21 12月, 1998 3 次提交