On 23 October 2013 16:27, Fredrik Johansson wrote:
> On Wed, Oct 23, 2013 at 4:17 PM, Bill Hart
> wrote:
> > I have made a number of speedups to the precomputed inverse code I
> announced
> > earlier, and removed two unneeeded functions. It is now up to 20% faster
> > than ordinary 2n x n divisio
On Wed, Oct 23, 2013 at 4:17 PM, Bill Hart wrote:
> I have made a number of speedups to the precomputed inverse code I announced
> earlier, and removed two unneeeded functions. It is now up to 20% faster
> than ordinary 2n x n division for n = 1 limb and from n = 3-15 limbs and up
> to 2.2 times a
I have made a number of speedups to the precomputed inverse code I
announced earlier, and removed two unneeeded functions. It is now up to 20%
faster than ordinary 2n x n division for n = 1 limb and from n = 3-15 limbs
and up to 2.2 times as fast above n = 120 limbs.
There's nothing more I can do
