summaryrefslogtreecommitdiff
path: root/lib/interval_tree_test.c
diff options
context:
space:
mode:
authorDavidlohr Bueso <dave@stgolabs.net>2017-11-18 02:28:27 +0300
committerLinus Torvalds <torvalds@linux-foundation.org>2017-11-18 03:10:02 +0300
commit0b548e33e6cb2bff240fdaf1783783be15c29080 (patch)
tree1a47af5c7d4e44cf0dadb5247493160c397a06b0 /lib/interval_tree_test.c
parente4795e3bb7d7b3b3d066cea57fb459f869500284 (diff)
downloadlinux-0b548e33e6cb2bff240fdaf1783783be15c29080.tar.xz
lib/rbtree-test: lower default params
Fengguang reported soft lockups while running the rbtree and interval tree test modules. The logic for these tests all occur in init phase, and we currently are pounding with the default values for number of nodes and number of iterations of each test. Reduce the latter by two orders of magnitude. This does not influence the value of the tests in that one thousand times by default is enough to get the picture. Link: http://lkml.kernel.org/r/20171109161715.xai2dtwqw2frhkcm@linux-n805 Signed-off-by: Davidlohr Bueso <dbueso@suse.de> Reported-by: Fengguang Wu <fengguang.wu@intel.com> Signed-off-by: Andrew Morton <akpm@linux-foundation.org> Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
Diffstat (limited to 'lib/interval_tree_test.c')
-rw-r--r--lib/interval_tree_test.c4
1 files changed, 2 insertions, 2 deletions
diff --git a/lib/interval_tree_test.c b/lib/interval_tree_test.c
index 0e343fd29570..835242e74aaa 100644
--- a/lib/interval_tree_test.c
+++ b/lib/interval_tree_test.c
@@ -11,10 +11,10 @@
MODULE_PARM_DESC(name, msg);
__param(int, nnodes, 100, "Number of nodes in the interval tree");
-__param(int, perf_loops, 100000, "Number of iterations modifying the tree");
+__param(int, perf_loops, 1000, "Number of iterations modifying the tree");
__param(int, nsearches, 100, "Number of searches to the interval tree");
-__param(int, search_loops, 10000, "Number of iterations searching the tree");
+__param(int, search_loops, 1000, "Number of iterations searching the tree");
__param(bool, search_all, false, "Searches will iterate all nodes in the tree");
__param(uint, max_endpoint, ~0, "Largest value for the interval's endpoint");