| commit | 2fd502f6a183fde7d8b4847d27e09884bf8006c7 | [log] [tgz] |
|---|---|---|
| author | Stefan Krah <skrah@bytereef.org> | Wed Aug 22 18:54:37 2012 +0200 |
| committer | Stefan Krah <skrah@bytereef.org> | Wed Aug 22 18:54:37 2012 +0200 |
| tree | f3b62140e4e4c7fab79474673610247642ae9da5 | |
| parent | ad54c6d82e9a4e3feb2a4a48a291dda99cf55507 [diff] |
1) Use _mpd_basedivmod() regardless of the length of the dividend. This is required for a corner case in dec_hash() in the following commit and also usually faster. dec_hash() needs some extra precision above MPD_MAX_PREC, and _mpd_base_ndivmod() is not audited for that. 2) Use _mpd_basemul() if the length of the smaller operand is less than or equal to 256. While this is technically an optimization, it is required for *testing* corner cases in dec_hash() in reasonable time.