| commit | 911918aa7ef6f868c135505b0015e42072c54682 | [log] [tgz] |
|---|---|---|
| author | Nicolas Pitre <nicolas.pitre@linaro.org> | Mon Nov 02 14:55:05 2015 -0500 |
| committer | Nicolas Pitre <nicolas.pitre@linaro.org> | Mon Nov 16 14:14:03 2015 -0500 |
| tree | b12a768b34d0461978276533b73436c4494fe71f | |
| parent | 1c07db46511f0d2335d3b32008f644164071d13e [diff] |
div64.h: optimize do_div() for power-of-two constant divisors Let's perform the obvious mask and shift operation in this case. On 32-bit targets, gcc is able to do the same thing with a constant divisor that happens to be a power of two i.e. it turns the division into an inline shift, but it doesn't hurt to be explicit. Signed-off-by: Nicolas Pitre <nico@linaro.org>