#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); on> net-next plumbingsTobias Klauser

summary refs log tree commit diff

path: root/net/ipv6/mcast.c

t'>Name

Age	Commit message (Collapse)	Author	Files	Lines
Size
-rw-r--r--	Kbuild	468	log plain
-rw-r--r--	cxgb3-abi.h	2291	log plain
-rw-r--r--	cxgb4-abi.h	2488	log plain
d---------	hfi	73	log plain
-rw-r--r--	hns-abi.h	1795	log plain
-rw-r--r--	ib_user_cm.h	6526	log plain
-rw-r--r--	ib_user_mad.h	8791	log plain
-rw-r--r--	ib_user_sa.h	2222	log plain
-rw-r--r--	ib_user_verbs.h	21586	log plain
-rw-r--r--	mlx4-abi.h	2864	log plain
-rw-r--r--	mlx5-abi.h	7480	log plain
-rw-r--r--	mthca-abi.h	2932	log plain
-rw-r--r--	nes-abi.h	3380	log plain
-rw-r--r--	ocrdma-abi.h	3918	log plain
-rw-r--r--	qedr-abi.h	2559	log plain
-rw-r--r--	rdma_netlink.h	4980	log plain