Home
last modified time | relevance | path

Searched refs:item_insert (Results 1 – 5 of 5) sorted by relevance

/Linux-v4.19/tools/testing/radix-tree/
Dtag_check.c22 item_insert(tree, index); in __simple_checks()
33 item_insert(tree, index); in __simple_checks()
66 item_insert(&tree, 43); in extend_checks()
70 item_insert(&tree, 1000000); in extend_checks()
73 item_insert(&tree, 0); in extend_checks()
96 item_insert(&tree, tmp); in contract_checks()
97 item_insert(&tree, tmp+1); in contract_checks()
184 item_insert(tree, index); in do_thrash()
291 item_insert(&tree, 1000000); in leak_check()
301 item_insert(&tree, 1000000); in __leak_check()
[all …]
Dmain.c23 item_insert(&tree, middle + idx); in __gang_check()
83 item_insert(&tree, 44); in add_and_check()
95 item_insert(&tree, 42); in dynamic_height_check()
98 item_insert(&tree, 1000000); in dynamic_height_check()
108 item_insert(&tree, i); in dynamic_height_check()
175 item_insert(&tree, start); in copy_tag_check()
183 item_insert(&tree, start-1); in copy_tag_check()
188 item_insert(&tree, end); in copy_tag_check()
196 item_insert(&tree, end+1); in copy_tag_check()
206 item_insert(&tree, idx[i]); in copy_tag_check()
Dtest.h15 int item_insert(struct radix_tree_root *root, unsigned long index);
Dmultiorder.c86 assert(item_insert(&tree, index2) == 0); in __multiorder_tag_test2()
198 assert(item_insert(&tree, index) == 0); in multiorder_shrink()
225 item_insert(&tree, 0); in multiorder_insert_bug()
Dtest.c52 int item_insert(struct radix_tree_root *root, unsigned long index) in item_insert() function