Searched refs:item_insert_order (Results 1 – 6 of 6) sorted by relevance
/Linux-v4.19/tools/testing/radix-tree/ |
D | multiorder.c | 37 err = item_insert_order(&tree, index, order); in __multiorder_tag_test() 85 assert(item_insert_order(&tree, 0, order) == 0); in __multiorder_tag_test2() 156 assert(item_insert_order(&tree, index, order) == 0); in multiorder_check() 194 assert(item_insert_order(&tree, 0, order) == 0); in multiorder_shrink() 227 item_insert_order(&tree, 3 << 6, 6); in multiorder_insert_bug() 246 err = item_insert_order(&tree, index[i], order[i]); in multiorder_iteration() 290 assert(!item_insert_order(&tree, index[i], order[i])); in multiorder_tagged_iteration() 371 item_insert_order(&tree, index, order2); in multiorder_join1() 393 item_insert_order(&tree, 0, order2); in multiorder_join2() 490 assert(item_insert_order(&tree, 0, old_order) == 0); in __multiorder_split() [all …]
|
D | benchmark.c | 73 item_insert_order(root, index, order); in benchmark_insert() 156 item_insert_order(&tree, index, old_order); in __benchmark_split() 198 item_insert_order(&tree, index, order2); in __benchmark_join()
|
D | test.h | 17 int item_insert_order(struct radix_tree_root *root, unsigned long index,
|
D | test.c | 42 int item_insert_order(struct radix_tree_root *root, unsigned long index, in item_insert_order() function 54 return item_insert_order(root, index, 0); in item_insert()
|
D | iteration_check.c | 43 if (item_insert_order(&tree, pgoff, order) in add_entries_fn()
|
D | main.c | 245 item_insert_order(tree, index, order); in __locate_check()
|