1 // SPDX-License-Identifier: GPL-2.0-only
3  * multiorder.c: Multi-order radix tree entry testing
8 #include <linux/radix-tree.h>
38 	int i, j, err;  in multiorder_iteration()  local
51 	for (j = 0; j < 256; j++) {  in multiorder_iteration()
53 			if (j <= (index[i] | ((1 << order[i]) - 1)))  in multiorder_iteration()
56 		xas_set(&xas, j);  in multiorder_iteration()
60 			unsigned long mask = (1UL << order[i]) - 1;  in multiorder_iteration()
63 			assert(xas.xa_node->shift == shift);  in multiorder_iteration()
65 			assert((item->index | mask) == (index[i] | mask));  in multiorder_iteration()
66 			assert(item->order == order[i]);  in multiorder_iteration()
78 	int i, j;  in multiorder_tagged_iteration()  local
97 	for (j = 0; j < 256; j++) {  in multiorder_tagged_iteration()
98 		int k;  in multiorder_tagged_iteration()  local
101 			for (k = i; index[k] < tag_index[i]; k++)  in multiorder_tagged_iteration()
103 			if (j <= (index[k] | ((1 << order[k]) - 1)))  in multiorder_tagged_iteration()
107 		xas_set(&xas, j);  in multiorder_tagged_iteration()
110 			for (k = i; index[k] < tag_index[i]; k++)  in multiorder_tagged_iteration()
112 			mask = (1UL << order[k]) - 1;  in multiorder_tagged_iteration()
116 			assert((item->index | mask) == (tag_index[i] | mask));  in multiorder_tagged_iteration()
117 			assert(item->order == order[k]);  in multiorder_tagged_iteration()
125 	for (j = 0; j < 256; j++) {  in multiorder_tagged_iteration()
126 		int mask, k;  in multiorder_tagged_iteration()  local
129 			for (k = i; index[k] < tag_index[i]; k++)  in multiorder_tagged_iteration()
131 			if (j <= (index[k] | ((1 << order[k]) - 1)))  in multiorder_tagged_iteration()
135 		xas_set(&xas, j);  in multiorder_tagged_iteration()
137 			for (k = i; index[k] < tag_index[i]; k++)  in multiorder_tagged_iteration()
139 			mask = (1 << order[k]) - 1;  in multiorder_tagged_iteration()
143 			assert((item->index | mask) == (tag_index[i] | mask));  in multiorder_tagged_iteration()
144 			assert(item->order == order[k]);  in multiorder_tagged_iteration()
166 	/* 'order' is set up to ensure we have sibling entries */  in creator_func()
167 	unsigned int order = RADIX_TREE_MAP_SHIFT - 1;  in creator_func()
217 	/* 'order' is set up to ensure we have sibling entries */  in load_creator()
227 			unsigned long index = (3 << RADIX_TREE_MAP_SHIFT) -  in load_creator()
241 	unsigned long index = (3 << RADIX_TREE_MAP_SHIFT) - 1;  in load_worker()
286 	while ((opt = getopt(argc, argv, "ls:v")) != -1) {  in main()