124 	u32 level = 0;  in sidtab_level_from_count()  local
128 		++level;  in sidtab_level_from_count()
130 	return level;  in sidtab_level_from_count()
133 static int sidtab_alloc_roots(struct sidtab *s, u32 level)  in sidtab_alloc_roots()  argument
143 	for (l = 1; l <= level; ++l)  in sidtab_alloc_roots()
158 	u32 level, capacity_shift, leaf_index = index / SIDTAB_LEAF_ENTRIES;  in sidtab_do_lookup()  local
161 	level = sidtab_level_from_count(index + 1);  in sidtab_do_lookup()
162 	capacity_shift = level * SIDTAB_INNER_SHIFT;  in sidtab_do_lookup()
165 	if (alloc && sidtab_alloc_roots(s, level) != 0)  in sidtab_do_lookup()
169 	entry = &s->roots[level];  in sidtab_do_lookup()
170 	while (level != 0) {  in sidtab_do_lookup()
172 		--level;  in sidtab_do_lookup()
337 			       u32 *pos, u32 count, u32 level,  in sidtab_convert_tree()  argument
343 	if (level != 0) {  in sidtab_convert_tree()
354 						 pos, count, level - 1,  in sidtab_convert_tree()
386 	u32 count, level, pos;  in sidtab_convert()  local
398 	level = sidtab_level_from_count(count);  in sidtab_convert()
422 	rc = sidtab_convert_tree(&params->target->roots[level],  in sidtab_convert()
423 				 &s->roots[level], &pos, count, level, params);  in sidtab_convert()
442 static void sidtab_destroy_tree(union sidtab_entry_inner entry, u32 level)  in sidtab_destroy_tree()  argument
446 	if (level != 0) {  in sidtab_destroy_tree()
453 			sidtab_destroy_tree(node->entries[i], level - 1);  in sidtab_destroy_tree()
469 	u32 i, level;  in sidtab_destroy()  local
475 	level = SIDTAB_MAX_LEVEL;  in sidtab_destroy()
476 	while (level && !s->roots[level].ptr_inner)  in sidtab_destroy()
477 		--level;  in sidtab_destroy()
479 	sidtab_destroy_tree(s->roots[level], level);  in sidtab_destroy()