38 	ida_free(ida, 20);  in ida_check_alloc()
56 /* Destroy an IDA with a single entry at @base */
81  * Check what happens when we fill a leaf and then delete it.  This may
166 	/* IDA contains a single value entry */  in ida_check_bad_free()
172 	/* IDA contains a single bitmap */  in ida_check_bad_free()
178 	/* IDA contains a tree */  in ida_check_bad_free()
179 	IDA_BUG_ON(ida, ida_alloc_min(ida, (1 << 20) - 1, GFP_KERNEL) != (1 << 20) - 1);  in ida_check_bad_free()
187 	ida_free(ida, (1 << 20) - 1);  in ida_check_bad_free()
202 	IDA_BUG_ON(ida, ida_exists(ida, (1 << 20) - 1));  in ida_check_find_first()
204 	/* IDA contains a single value entry */  in ida_check_find_first()
210 	IDA_BUG_ON(ida, ida_exists(ida, (1 << 20) - 1));  in ida_check_find_first()
217 	IDA_BUG_ON(ida, ida_exists(ida, (1 << 20) - 1));  in ida_check_find_first()
219 	/* IDA contains a single bitmap */  in ida_check_find_first()
225 	IDA_BUG_ON(ida, ida_exists(ida, (1 << 20) - 1));  in ida_check_find_first()
227 	/* IDA contains a tree */  in ida_check_find_first()
228 	IDA_BUG_ON(ida, ida_alloc_min(ida, (1 << 20) - 1, GFP_KERNEL) != (1 << 20) - 1);  in ida_check_find_first()
233 	IDA_BUG_ON(ida, !ida_exists(ida, (1 << 20) - 1));  in ida_check_find_first()
249 	IDA_BUG_ON(ida, ida_find_first_range(ida, 1023, (1 << 20) - 1) != 1023);  in ida_check_find_first()
250 	IDA_BUG_ON(ida, ida_find_first_range(ida, 1024, (1 << 20) - 1) != (1 << 20) - 1);  in ida_check_find_first()
251 	IDA_BUG_ON(ida, ida_find_first_range(ida, (1 << 20), INT_MAX) != -ENOENT);  in ida_check_find_first()
256 	ida_free(ida, (1 << 20) - 1);  in ida_check_find_first()