28 	unsigned level;  in __genradix_ptr_alloc()  local
38 		level	= genradix_root_to_depth(r);  in __genradix_ptr_alloc()
40 		if (n && ilog2(offset) < genradix_depth_shift(level))  in __genradix_ptr_alloc()
51 			    ((unsigned long) new_node | (n ? level + 1 : 0)));  in __genradix_ptr_alloc()
61 	while (level--) {  in __genradix_ptr_alloc()
63 			&n->children[offset >> genradix_depth_shift(level)];  in __genradix_ptr_alloc()
64 		offset &= genradix_depth_size(level) - 1;  in __genradix_ptr_alloc()
92 	unsigned level, i;  in __genradix_iter_peek()  local
103 	level	= genradix_root_to_depth(r);  in __genradix_iter_peek()
105 	if (ilog2(iter->offset) >= genradix_depth_shift(level))  in __genradix_iter_peek()
108 	while (level) {  in __genradix_iter_peek()
109 		level--;  in __genradix_iter_peek()
111 		i = (iter->offset >> genradix_depth_shift(level)) &  in __genradix_iter_peek()
115 			size_t objs_per_ptr = genradix_depth_size(level);  in __genradix_iter_peek()
146 	unsigned level, i;  in __genradix_iter_peek_prev()  local
157 	level	= genradix_root_to_depth(r);  in __genradix_iter_peek_prev()
159 	if (ilog2(iter->offset) >= genradix_depth_shift(level)) {  in __genradix_iter_peek_prev()
160 		iter->offset = genradix_depth_size(level);  in __genradix_iter_peek_prev()
167 	while (level) {  in __genradix_iter_peek_prev()
168 		level--;  in __genradix_iter_peek_prev()
170 		i = (iter->offset >> genradix_depth_shift(level)) &  in __genradix_iter_peek_prev()
174 			size_t objs_per_ptr = genradix_depth_size(level);  in __genradix_iter_peek_prev()
197 static void genradix_free_recurse(struct genradix_node *n, unsigned level)  in genradix_free_recurse()  argument
199 	if (level) {  in genradix_free_recurse()
204 				genradix_free_recurse(n->children[i], level - 1);  in genradix_free_recurse()