Implement Algorithm 6.2: Selection of multiplier and shift count
Find coefficients for Algorithm 4.2: Optimized code generation of unsigned q=n/d for constant nonzero d Input: N 32 or 64 (width of divide) d divisor (not a power of 2) Output: *pshpre pre-shift *pm factor *pshpost post-shift
Algorithms from "Division by Invariant Integers using Multiplication" by Torbjoern Granlund and Peter L. Montgomery
Compiler implementation of the D programming language.