558 int radix_tree_maybe_preload_order(gfp_t gfp_mask, int order)  in radix_tree_maybe_preload_order()  argument
573 	nr_subtrees = 1 << order;  in radix_tree_maybe_preload_order()
812 			unsigned order, struct radix_tree_node **nodep,  in __radix_tree_create()  argument
819 	unsigned long max = index | ((1UL << order) - 1);  in __radix_tree_create()
825 	if (order > 0 && max == ((1UL << order) - 1))  in __radix_tree_create()
835 	while (shift > order) {  in __radix_tree_create()
899 		void __rcu **slot, void *item, unsigned order, bool replace)  in insert_entries()  argument
905 		if (order > node->shift)  in insert_entries()
906 			n = 1 << (order - node->shift);  in insert_entries()
962 		void __rcu **slot, void *item, unsigned order, bool replace)  in insert_entries()  argument
986 			unsigned order, void *item)  in __radix_tree_insert()  argument
994 	error = __radix_tree_create(root, index, order, &node, &slot);  in __radix_tree_insert()
998 	error = insert_entries(node, slot, item, order, false);  in __radix_tree_insert()
1264 			unsigned order, void *item)  in radix_tree_join()  argument
1272 	error = __radix_tree_create(root, index, order, &node, &slot);  in radix_tree_join()
1274 		error = insert_entries(node, slot, item, order, true);  in radix_tree_join()
1299 				unsigned order)  in radix_tree_split()  argument
1331 	if (order == parent->shift)  in radix_tree_split()
1333 	if (order > parent->shift) {  in radix_tree_split()
1336 					RADIX_TREE_RETRY, order, true);  in radix_tree_split()
1343 		if (node->shift > order) {  in radix_tree_split()
1364 					RADIX_TREE_RETRY, order, false);  in radix_tree_split()