170 		if (!s->roots[l].ptr_inner) {  in sidtab_alloc_roots()
171 			s->roots[l].ptr_inner = kzalloc(SIDTAB_NODE_ALLOC_SIZE,  in sidtab_alloc_roots()
173 			if (!s->roots[l].ptr_inner)  in sidtab_alloc_roots()
175 			s->roots[l].ptr_inner->entries[0] = s->roots[l - 1];  in sidtab_alloc_roots()
200 		entry = &entry->ptr_inner->entries[leaf_index >> capacity_shift];  in sidtab_do_lookup()
203 		if (!entry->ptr_inner) {  in sidtab_do_lookup()
205 				entry->ptr_inner = kzalloc(SIDTAB_NODE_ALLOC_SIZE,  in sidtab_do_lookup()
207 			if (!entry->ptr_inner)  in sidtab_do_lookup()
380 		if (!edst->ptr_inner) {  in sidtab_convert_tree()
381 			edst->ptr_inner = kzalloc(SIDTAB_NODE_ALLOC_SIZE,  in sidtab_convert_tree()
383 			if (!edst->ptr_inner)  in sidtab_convert_tree()
388 			rc = sidtab_convert_tree(&edst->ptr_inner->entries[i],  in sidtab_convert_tree()
389 						 &esrc->ptr_inner->entries[i],  in sidtab_convert_tree()
511 		struct sidtab_node_inner *node = entry.ptr_inner;  in sidtab_destroy_tree()
540 	while (level && !s->roots[level].ptr_inner)  in sidtab_destroy()