> Division can be approximated with multiprecision multiplication, e.g.,> 32-bit division can be done by producing the appropriate 64-bit> product and using the high order 32 bits.>> My problem is I am trying to find the algorithm by which I can> generate the 32-bit multiplier and the shift amount, given a specific> constant divisor. B I am unable to find any references via google. B Any> recommendations? B No, I really don't want to read the gcc source (even> if it does this) unless someone knows the specific subroutine name I> should be looking at.