#include #include #include /* * This implements the binary GCD algorithm. (Often attributed to Stein, * but as Knuth has noted, appears in a first-century Chinese math text.) * * This is faster than the division-based algorithm even on x86, which * has decent hardware division. */ #if !defined(CONFIG_CPU_NO_EFFICIENT_FFS) && !defined(CPU_NO_EFFICIENT_FFS) /* If __ffs is available, the even/odd algorithm benchmarks slower. */ unsigned long gcd(unsigned long a, unsigned long b) { unsigned long r = a | b; if (!a || !b) return r; b >>= __ffs(b); if (b == 1) return r & -r; for (;;) { a >>= __ffs(a); if (a == 1) return r & -r; if (a == b) return a << __ffs(r); if (a < b) swap(a, b); a -= b; } } #else /* If normalization is done by loops, the even/odd algorithm is a win. */ unsigned long gcd(unsigned long a, unsigned long b) { unsigned long r = a | b; if (!a || !b) return r; /* Isolate lsbit of r */ r &= -r; while (!(b & r)) b >>= 1; if (b == r) return r; for (;;) { while (!(a & r)) a >>= 1; if (a == r) return r; if (a == b) return a; if (a < b) swap(a, b); a -= b; a >>= 1; if (a & r) a += b; a >>= 1; } } #endif EXPORT_SYMBOL_GPL(gcd); e='packet-loop-back'>packet-loop-back net-next plumbingsTobias Klauser
summaryrefslogtreecommitdiff
path: root/drivers/usb/gadget/udc/fusb300_udc.h
diff options
context:
space:
mode:
authorAxel Lin <axel.lin@ingics.com>2016-10-21 16:40:05 +0800
committerMark Brown <broonie@kernel.org>2016-10-24 17:49:14 +0100
commite98d5fef8556f1da7f903fd1908feed84bb0f90d (patch)
tree95a1268df894d6150ee31f5e97cbcb0c0ab32cc4 /drivers/usb/gadget/udc/fusb300_udc.h
parent1001354ca34179f3db924eb66672442a173147dc (diff)
regulator: tps6507x: Drop pointless static qualifier for *reg_data variable
There is no need to use static for this local variable. Signed-off-by: Axel Lin <axel.lin@ingics.com> Signed-off-by: Mark Brown <broonie@kernel.org>
Diffstat (limited to 'drivers/usb/gadget/udc/fusb300_udc.h')