Jeremy Fitzhardinge f595ec964d common implementation of iterative div/mod
We have a few instances of the open-coded iterative div/mod loop, used
when we don't expcet the dividend to be much bigger than the divisor.
Unfortunately modern gcc's have the tendency to strength "reduce" this
into a full mod operation, which isn't necessarily any faster, and
even if it were, doesn't exist if gcc implements it in libgcc.

The workaround is to put a dummy asm statement in the loop to prevent
gcc from performing the transformation.

This patch creates a single implementation of this loop, and uses it
to replace the open-coded versions I know about.

Signed-off-by: Jeremy Fitzhardinge <jeremy.fitzhardinge@citrix.com>
Cc: Andrew Morton <akpm@linux-foundation.org>
Cc: john stultz <johnstul@us.ibm.com>
Cc: Segher Boessenkool <segher@kernel.crashing.org>
Cc: Christian Kujau <lists@nerdbynature.de>
Cc: Robert Hancock <hancockr@shaw.ca>
Signed-off-by: Ingo Molnar <mingo@elte.hu>
2008-06-12 10:47:56 +02:00
..
2008-04-23 23:00:13 -04:00
2008-05-24 09:56:13 -07:00
2008-06-06 11:29:12 -07:00
2008-05-27 13:24:39 -07:00
2008-06-05 18:13:16 +01:00
2008-05-12 22:57:51 +10:00
2008-05-20 00:33:44 -07:00
2008-05-30 02:01:28 -07:00
2008-06-06 11:29:12 -07:00
2008-04-17 11:31:58 +03:00
2008-06-04 12:40:15 -07:00
2008-04-24 23:57:33 +02:00