17 	long idx;  in __gang_check()  local
22 	for (idx = -down; idx < up; idx++)  in __gang_check()
23 		item_insert(&tree, middle + idx);  in __gang_check()
26 	for (idx = -down; idx < up; idx++)  in __gang_check()
27 		item_check_present(&tree, middle + idx);  in __gang_check()
126 …ix_tree_root *tree, unsigned long start, unsigned long end, unsigned long *idx, int count, int fro…  in check_copied_tags()  argument
133 		if (idx[i] < start || idx[i] > end) {  in check_copied_tags()
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()
159 	unsigned long idx[ITEMS];  in copy_tag_check()  local
203 			idx[i] = rand();  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()
209 			if (idx[i] >= start && idx[i] <= end)  in copy_tag_check()
221 	check_copied_tags(&tree, start, end, idx, ITEMS, 0, 1);  in copy_tag_check()
231 	check_copied_tags(&tree, start, end, idx, ITEMS, 0, 2);  in copy_tag_check()