testing/radix-tree/tag_check.c

14 __simple_checks(struct radix_tree_root *tree, unsigned long index, int tag)
19 	item_check_absent(tree, index);
20 	assert(item_tag_get(tree, index, tag) == 0);
22 	item_insert(tree, index);
23 	assert(item_tag_get(tree, index, tag) == 0);
24 	item_tag_set(tree, index, tag);
25 	ret = item_tag_get(tree, index, tag);
29 	ret = item_tag_get(tree, index, !tag);
31 	ret = item_delete(tree, index);
33 	item_insert(tree, index);
34 	ret = item_tag_get(tree, index, tag);
36 	ret = item_delete(tree, index);
38 	ret = item_delete(tree, index);
44 	unsigned long index;
47 	for (index = 0; index < 10000; index++) {
48 		__simple_checks(&tree, index, 0);
49 		__simple_checks(&tree, index, 1);
136 	unsigned long index = 0;
140 					index, BATCH, tag))) {
146 			while (last_index < item->index) {
153 		index = items[nr_found - 1]->index + 1;
171 		unsigned long index;
180 			index = rand() % THRASH_SIZE;
181 			if (thrash_state[index] != NODE_ABSENT)
183 			item_check_absent(tree, index);
184 			item_insert(tree, index);
185 			assert(thrash_state[index] != NODE_PRESENT);
186 			thrash_state[index] = NODE_PRESENT;
192 			index = rand() % THRASH_SIZE;
193 			if (thrash_state[index] == NODE_ABSENT)
195 			item_check_present(tree, index);
196 			if (item_tag_get(tree, index, tag)) {
197 				assert(thrash_state[index] == NODE_TAGGED);
200 				assert(thrash_state[index] == NODE_PRESENT);
202 			item_delete(tree, index);
203 			assert(thrash_state[index] != NODE_ABSENT);
204 			thrash_state[index] = NODE_ABSENT;
210 			index = rand() % THRASH_SIZE;
211 			if (thrash_state[index] != NODE_PRESENT) {
212 				if (item_lookup(tree, index))
213 					assert(item_tag_get(tree, index, tag));
216 			item_tag_set(tree, index, tag);
217 			item_tag_set(tree, index, tag);
218 			assert(thrash_state[index] != NODE_TAGGED);
219 			thrash_state[index] = NODE_TAGGED;
225 			index = rand() % THRASH_SIZE;
226 			if (thrash_state[index] != NODE_TAGGED)
228 			item_check_present(tree, index);
229 			assert(item_tag_get(tree, index, tag));
230 			item_tag_clear(tree, index, tag);
231 			item_tag_clear(tree, index, tag);
232 			assert(thrash_state[index] != NODE_PRESENT);
233 			thrash_state[index] = NODE_PRESENT;
240 		for (index = 0; index < THRASH_SIZE; index++) {
241 			switch (thrash_state[index]) {
243 				item_check_absent(tree, index);
246 				item_check_present(tree, index);
247 				assert(!item_tag_get(tree, index, tag));
251 				item_check_present(tree, index);
252 				assert(item_tag_get(tree, index, tag));