mirror of
https://github.com/torvalds/linux.git
synced 2024-12-27 05:11:48 +00:00
8c86fb68ff
As indicated in the added comment, the algorithm works better if b is big. As multiplication is commutative, a and b can be swapped. Do this if a is bigger than b. Link: https://lkml.kernel.org/r/20240303092408.662449-2-u.kleine-koenig@pengutronix.de Signed-off-by: Uwe Kleine-König <u.kleine-koenig@pengutronix.de> Tested-by: Biju Das <biju.das.jz@bp.renesas.com> Signed-off-by: Andrew Morton <akpm@linux-foundation.org> |
||
|---|---|---|
| .. | ||
| cordic.c | ||
| div64.c | ||
| gcd.c | ||
| int_log.c | ||
| int_pow.c | ||
| int_sqrt.c | ||
| Kconfig | ||
| lcm.c | ||
| Makefile | ||
| prime_numbers.c | ||
| rational-test.c | ||
| rational.c | ||
| reciprocal_div.c | ||
| test_div64.c | ||