81 		if (!s->roots[l].ptr_inner) {  in sidtab_alloc_roots()
82 			s->roots[l].ptr_inner = kzalloc(SIDTAB_NODE_ALLOC_SIZE,  in sidtab_alloc_roots()
84 			if (!s->roots[l].ptr_inner)  in sidtab_alloc_roots()
86 			s->roots[l].ptr_inner->entries[0] = s->roots[l - 1];  in sidtab_alloc_roots()
110 		entry = &entry->ptr_inner->entries[leaf_index >> capacity_shift];  in sidtab_do_lookup()
113 		if (!entry->ptr_inner) {  in sidtab_do_lookup()
115 				entry->ptr_inner = kzalloc(SIDTAB_NODE_ALLOC_SIZE,  in sidtab_do_lookup()
117 			if (!entry->ptr_inner)  in sidtab_do_lookup()
181 		struct sidtab_node_inner *node = entry.ptr_inner;  in sidtab_find_context()
368 		if (!edst->ptr_inner) {  in sidtab_convert_tree()
369 			edst->ptr_inner = kzalloc(SIDTAB_NODE_ALLOC_SIZE,  in sidtab_convert_tree()
371 			if (!edst->ptr_inner)  in sidtab_convert_tree()
376 			rc = sidtab_convert_tree(&edst->ptr_inner->entries[i],  in sidtab_convert_tree()
377 						 &esrc->ptr_inner->entries[i],  in sidtab_convert_tree()
461 		struct sidtab_node_inner *node = entry.ptr_inner;  in sidtab_destroy_tree()
490 	while (level && !s->roots[level].ptr_inner)  in sidtab_destroy()