Lines Matching refs:nnodes
13 __param(int, nnodes, 100, "Number of nodes in the rb-tree");
167 for (i = 0; i < nnodes; i++) { in init()
250 nodes = kmalloc_array(nnodes, sizeof(*nodes), GFP_KERNEL); in rbtree_test_init()
262 for (j = 0; j < nnodes; j++) in rbtree_test_init()
264 for (j = 0; j < nnodes; j++) in rbtree_test_init()
278 for (j = 0; j < nnodes; j++) in rbtree_test_init()
280 for (j = 0; j < nnodes; j++) in rbtree_test_init()
291 for (i = 0; i < nnodes; i++) in rbtree_test_init()
331 for (i = 0; i < nnodes; i++) in rbtree_test_init()
337 for (j = 0; j < nnodes; j++) { in rbtree_test_init()
341 for (j = 0; j < nnodes; j++) { in rbtree_test_init()
342 check(nnodes - j); in rbtree_test_init()
355 for (j = 0; j < nnodes; j++) in rbtree_test_init()
357 for (j = 0; j < nnodes; j++) in rbtree_test_init()
370 for (j = 0; j < nnodes; j++) in rbtree_test_init()
372 for (j = 0; j < nnodes; j++) in rbtree_test_init()
384 for (j = 0; j < nnodes; j++) { in rbtree_test_init()
388 for (j = 0; j < nnodes; j++) { in rbtree_test_init()
389 check_augmented(nnodes - j); in rbtree_test_init()