Can div2 be done sloppily, e.g., by extracting the top 64 bits of the dividend and the corresponding (up to) 64 bits of the divisor, and invoke DIV1 on these bits?
OK, one needs to return a non-negative remainder, so a little bit of adjustment might be needed. But does the remainder need to be principal? Related to that: In hgcd2 you seem to handle a >= b just after a is set to a residue mod b. If that residue is principal, then clearly a >= b cannot happen. Perhaps I am reading the code wrong. But the handling of a >= b opens for a sloppy div1 and div2, which might result in greater speed. -- Torbjörn Please encrypt, key id 0xC8601622 _______________________________________________ gmp-devel mailing list gmp-devel@gmplib.org https://gmplib.org/mailman/listinfo/gmp-devel
