Mail Archives: djgpp/1997/01/19/19:41:45
> while using the profiler on some code i had written i noticed that changing a
> floating point multiply to an unsigned multiply of 2 longs turned out to be
> slower. in fact floating point multiply appears to be faster than ordinary
> integer multiply for any case. is this actually true? and if so is there any
> reason i shouldn't just change every multiply in my code to make sure it's
> floating point?
Yes, floating point is faster because imul and idiv use the floating
point unit to do the operations - thus an integer mul/divide has the
overhead of converting the int -> float, div/mul, then float -> int.
Whereas the floating point calculations just do the div/mul...
Leathal.
- Raw text -