Lines Matching refs:nnodes
16 __param(int, nnodes, 100, "Number of nodes in the interval tree");
48 for (i = 0; i < nnodes; i++) { in init()
77 for (j = 0; j < nnodes; j++) in basic_check()
79 for (j = 0; j < nnodes; j++) in basic_check()
102 for (j = 0; j < nnodes; j++) in search_check()
124 for (j = 0; j < nnodes; j++) in search_check()
140 intxn1 = bitmap_alloc(nnodes, GFP_KERNEL); in intersection_range_check()
146 intxn2 = bitmap_alloc(nnodes, GFP_KERNEL); in intersection_range_check()
156 for (j = 0; j < nnodes; j++) in intersection_range_check()
171 bitmap_zero(intxn1, nnodes); in intersection_range_check()
172 for (j = 0; j < nnodes; j++) { in intersection_range_check()
180 bitmap_zero(intxn2, nnodes); in intersection_range_check()
185 WARN_ON_ONCE(!bitmap_equal(intxn1, intxn2, nnodes)); in intersection_range_check()
188 for (j = 0; j < nnodes; j++) in intersection_range_check()
255 for (j = 0; j < nnodes; j++) in span_iteration_check()
262 for (j = 0; j < nnodes; j++) in span_iteration_check()
303 for (j = 0; j < nnodes; j++) in span_iteration_check()
314 nodes = kmalloc_array(nnodes, sizeof(struct interval_tree_node), in interval_tree_test_init()