The important case is size n * size n to top n limbs, if I understand correctly.
But in the basecase, maybe it is just as easy to do n1 * n2 -> n1 high limbs ?
Bill.
On 7 July 2010 22:36, Jason Moxham wrote:
> On Tuesday 06 July 2010 10:49:35 Bill Hart wrote:
>> Frederick is working on mpz_mulh
On Tuesday 06 July 2010 10:49:35 Bill Hart wrote:
> Frederick is working on mpz_mulhi, however one thing we *really* need
> (since the interesting case for his applications is for a small number
> of limbs) is an x86_64 assembly version for the basecase, as at
> present I think we just use a full m
Please note that changes being made in the MPIR SVN trunk mean that
the Windows build from SVN will often fail at the moment (I have
uploaded a temporary fix for the nehalem library builld only)
Unfortunately SVN problems over the weekend have prevented Jason
making the changes involved but I will
