Chris Wilson cf4a7207b1 lib: Add a simple prime number generator ... Prime numbers are interesting for testing components that use multiplies and divides, such as testing DRM's struct drm_mm alignment computations. v2: Move to lib/, add selftest v3: Fix initial constants (exclude 0/1 from being primes) v4: More RCU markup to keep 0day/sparse happy v5: Fix RCU unwind on module exit, add to kselftests v6: Tidy computation of bitmap size v7: for_each_prime_number_from() v8: Compose small-primes using BIT() for easier verification v9: Move rcu dance entirely into callers. v10: Improve quote for Betrand's Postulate (aka Chebyshev's theorem) Signed-off-by: Chris Wilson <chris@chris-wilson.co.uk> Cc: Lukas Wunner <lukas@wunner.de> Reviewed-by: Joonas Lahtinen <joonas.lahtinen@linux.intel.com> Signed-off-by: Daniel Vetter <daniel.vetter@ffwll.ch> Link: http://patchwork.freedesktop.org/patch/msgid/20161222144514.3911-1-chris@chris-wilson.co.uk		2016-12-27 12:30:56 +01:00
..
fault-injection
ktest	ktest: Place quotes around item variable	2015-02-03 15:45:13 -05:00
nvdimm	Merge branch 'akpm' (patches from Andrew)	2016-10-11 17:34:10 -07:00
radix-tree	radix-tree tests: properly initialize mutex	2016-10-11 15:06:30 -07:00
selftests	lib: Add a simple prime number generator	2016-12-27 12:30:56 +01:00