10 #include <linux/radix-tree.h>
18 	RADIX_TREE(tree, GFP_KERNEL);  in __gang_check()
23 		item_insert(&tree, middle + idx);  in __gang_check()
25 	item_check_absent(&tree, middle - down - 1);  in __gang_check()
27 		item_check_present(&tree, middle + idx);  in __gang_check()
28 	item_check_absent(&tree, middle + up);  in __gang_check()
31 		item_gang_check_present(&tree, middle - down, up + down,  in __gang_check()
33 		item_full_scan(&tree, middle - down, down + up, chunk);  in __gang_check()
35 	item_kill_tree(&tree);  in __gang_check()
81 	RADIX_TREE(tree, GFP_KERNEL);  in add_and_check()
83 	item_insert(&tree, 44);  in add_and_check()
84 	item_check_present(&tree, 44);  in add_and_check()
85 	item_check_absent(&tree, 43);  in add_and_check()
86 	item_kill_tree(&tree);  in add_and_check()
92 	RADIX_TREE(tree, GFP_KERNEL);  in dynamic_height_check()
93 	tree_verify_min_height(&tree, 0);  in dynamic_height_check()
95 	item_insert(&tree, 42);  in dynamic_height_check()
96 	tree_verify_min_height(&tree, 42);  in dynamic_height_check()
98 	item_insert(&tree, 1000000);  in dynamic_height_check()
99 	tree_verify_min_height(&tree, 1000000);  in dynamic_height_check()
101 	assert(item_delete(&tree, 1000000));  in dynamic_height_check()
102 	tree_verify_min_height(&tree, 42);  in dynamic_height_check()
104 	assert(item_delete(&tree, 42));  in dynamic_height_check()
105 	tree_verify_min_height(&tree, 0);  in dynamic_height_check()
108 		item_insert(&tree, i);  in dynamic_height_check()
109 		tree_verify_min_height(&tree, i);  in dynamic_height_check()
114 		assert(item_delete(&tree, i));  in dynamic_height_check()
116 			tree_verify_min_height(&tree, 0);  in dynamic_height_check()
120 		tree_verify_min_height(&tree, i);  in dynamic_height_check()
123 	item_kill_tree(&tree);  in dynamic_height_check()
126 void check_copied_tags(struct radix_tree_root *tree, unsigned long start, unsigned long end, unsign…  in check_copied_tags()  argument
134 			if (item_tag_get(tree, idx[i], totag)) {  in check_copied_tags()
136 				       end, idx[i], item_tag_get(tree, idx[i],  in check_copied_tags()
138 				       item_tag_get(tree, idx[i], totag));  in check_copied_tags()
140 			assert(!item_tag_get(tree, idx[i], totag));  in check_copied_tags()
143 		if (item_tag_get(tree, idx[i], fromtag) ^  in check_copied_tags()
144 			item_tag_get(tree, idx[i], totag)) {  in check_copied_tags()
146 			       idx[i], item_tag_get(tree, idx[i], fromtag),  in check_copied_tags()
147 			       item_tag_get(tree, idx[i], totag));  in check_copied_tags()
149 		assert(!(item_tag_get(tree, idx[i], fromtag) ^  in check_copied_tags()
150 			 item_tag_get(tree, idx[i], totag)));  in check_copied_tags()
158 	RADIX_TREE(tree, GFP_KERNEL);  in copy_tag_check()
163 //	printf("generating radix tree indices...\n");  in copy_tag_check()
175 		item_insert(&tree, start);  in copy_tag_check()
179 			item_tag_set(&tree, start, 0);  in copy_tag_check()
183 		item_insert(&tree, start-1);  in copy_tag_check()
185 			item_tag_set(&tree, start-1, 0);  in copy_tag_check()
188 		item_insert(&tree, end);  in copy_tag_check()
192 			item_tag_set(&tree, end, 0);  in copy_tag_check()
196 		item_insert(&tree, end+1);  in copy_tag_check()
198 			item_tag_set(&tree, end+1, 0);  in copy_tag_check()
204 		} while (item_lookup(&tree, idx[i]));  in copy_tag_check()
206 		item_insert(&tree, idx[i]);  in copy_tag_check()
208 			item_tag_set(&tree, idx[i], 0);  in copy_tag_check()
217 	tagged = tag_tagged_items(&tree, start, end, ITEMS, XA_MARK_0, XA_MARK_1);  in copy_tag_check()
221 	check_copied_tags(&tree, start, end, idx, ITEMS, 0, 1);  in copy_tag_check()
226 	tagged = tag_tagged_items(&tree, start, end, tmp, XA_MARK_0, XA_MARK_2);  in copy_tag_check()
231 	check_copied_tags(&tree, start, end, idx, ITEMS, 0, 2);  in copy_tag_check()
232 	verify_tag_consistency(&tree, 0);  in copy_tag_check()
233 	verify_tag_consistency(&tree, 1);  in copy_tag_check()
234 	verify_tag_consistency(&tree, 2);  in copy_tag_check()
236 	item_kill_tree(&tree);  in copy_tag_check()