diff --git a/testcode/lock_verify.c b/testcode/lock_verify.c
index 0d13209b9..c9d176e49 100644
--- a/testcode/lock_verify.c
+++ b/testcode/lock_verify.c
@@ -337,6 +337,9 @@ static void search_cycle(struct lock_ref* visit, int level,
 	/* recurse */
 	if(!visit->lock->visited)
 		from = visit;
+	if(verb > 1) fprintf(stderr, "[%d] visit lock %u %u %s %d\n", level,
+			visit->lock->id.thr, visit->lock->id.instance,
+			visit->lock->create_file, visit->lock->create_line);
 	RBTREE_FOR(ref, struct lock_ref*, visit->lock->smaller) {
 		ref->lock->dfs_next = visit;
 		search_cycle(ref, level+1, from);
diff --git a/testcode/unitlruhash.c b/testcode/unitlruhash.c
index 8f83206c8..532e912e8 100644
--- a/testcode/unitlruhash.c
+++ b/testcode/unitlruhash.c
@@ -495,14 +495,14 @@ void lruhash_test()
 	/* also small in size so that reclaim has to be done quickly. */
 	struct lruhash* table ;
 	printf("lruhash test\n");
-	table = lruhash_create(2, 16384, 
+	table = lruhash_create(1024, 16384, 
 		test_sizefunc, test_compfunc, test_delkey, test_deldata, NULL);
 	test_bin_find_entry(table);
 	test_lru(table);
 	test_short_table(table);
 	test_long_table(table);
 	lruhash_delete(table);
-	table = lruhash_create(2, 16384, 
+	table = lruhash_create(1024, 16384, 
 		test_sizefunc, test_compfunc, test_delkey, test_deldata, NULL);
 	test_threaded_table(table);
 	lruhash_delete(table);