32 			const unsigned long *bitmap,  in check_rbtree()  argument
45 	n = find_first_bit(bitmap, count);  in check_rbtree()
50 		if (!test_bit(idx, bitmap)) {  in check_rbtree()
62 		n = find_next_bit(bitmap, count, n + 1);  in check_rbtree()
69 			    const unsigned long *bitmap,  in check_completion()  argument
76 		if (intel_wait_complete(&waiters[n]) != !!test_bit(n, bitmap))  in check_completion()
82 		       test_bit(n, bitmap) ? "active" : "complete");  in check_completion()
114 	unsigned long *bitmap;  in igt_random_insert_remove()  local
124 	bitmap = kcalloc(DIV_ROUND_UP(count, BITS_PER_LONG), sizeof(*bitmap),  in igt_random_insert_remove()
126 	if (!bitmap)  in igt_random_insert_remove()
136 	err = check_rbtree(engine, bitmap, waiters, count);  in igt_random_insert_remove()
147 		__set_bit(i, bitmap);  in igt_random_insert_remove()
149 		err = check_rbtree(engine, bitmap, waiters, count);  in igt_random_insert_remove()
159 		__clear_bit(i, bitmap);  in igt_random_insert_remove()
161 		err = check_rbtree(engine, bitmap, waiters, count);  in igt_random_insert_remove()
170 	kfree(bitmap);  in igt_random_insert_remove()
184 	unsigned long *bitmap;  in igt_insert_complete()  local
194 	bitmap = kcalloc(DIV_ROUND_UP(count, BITS_PER_LONG), sizeof(*bitmap),  in igt_insert_complete()
196 	if (!bitmap)  in igt_insert_complete()
202 		__set_bit(n, bitmap);  in igt_insert_complete()
204 	err = check_rbtree(engine, bitmap, waiters, count);  in igt_insert_complete()
216 		GEM_BUG_ON(find_first_bit(bitmap, count) != n);  in igt_insert_complete()
231 			GEM_BUG_ON(!test_bit(m, bitmap));  in igt_insert_complete()
232 			__clear_bit(m, bitmap);  in igt_insert_complete()
238 		err = check_rbtree(engine, bitmap, waiters, count);  in igt_insert_complete()
245 		err = check_completion(engine, bitmap, waiters, count);  in igt_insert_complete()
255 	kfree(bitmap);  in igt_insert_complete()