25 	u32 i;  in sidtab_init()  local
29 	for (i = 0; i < SECINITSID_NUM; i++)  in sidtab_init()
30 		s->isids[i].set = 0;  in sidtab_init()
89 	int i;  in sidtab_hash_stats()  local
98 	hash_for_each_rcu(sidtab->context_to_sid, i, entry, list) {  in sidtab_hash_stats()
100 		if (i == cur_bucket) {  in sidtab_hash_stats()
105 			cur_bucket = i;  in sidtab_hash_stats()
323 	u32 i;  in sidtab_convert_hashtable()  local
325 	for (i = 0; i < count; i++) {  in sidtab_convert_hashtable()
326 		entry = sidtab_do_lookup(s, i, 0);  in sidtab_convert_hashtable()
327 		entry->sid = index_to_sid(i);  in sidtab_convert_hashtable()
341 	u32 i;  in sidtab_convert_tree()  local
350 		i = 0;  in sidtab_convert_tree()
351 		while (i < SIDTAB_INNER_ENTRIES && *pos < count) {  in sidtab_convert_tree()
352 			rc = sidtab_convert_tree(&edst->ptr_inner->entries[i],  in sidtab_convert_tree()
353 						 &esrc->ptr_inner->entries[i],  in sidtab_convert_tree()
358 			i++;  in sidtab_convert_tree()
367 		i = 0;  in sidtab_convert_tree()
368 		while (i < SIDTAB_LEAF_ENTRIES && *pos < count) {  in sidtab_convert_tree()
369 			rc = convert->func(&esrc->ptr_leaf->entries[i].context,  in sidtab_convert_tree()
370 					   &edst->ptr_leaf->entries[i].context,  in sidtab_convert_tree()
375 			i++;  in sidtab_convert_tree()
444 	u32 i;  in sidtab_destroy_tree()  local
452 		for (i = 0; i < SIDTAB_INNER_ENTRIES; i++)  in sidtab_destroy_tree()
453 			sidtab_destroy_tree(node->entries[i], level - 1);  in sidtab_destroy_tree()
461 		for (i = 0; i < SIDTAB_LEAF_ENTRIES; i++)  in sidtab_destroy_tree()
462 			context_destroy(&node->entries[i].context);  in sidtab_destroy_tree()
469 	u32 i, level;  in sidtab_destroy()  local
471 	for (i = 0; i < SECINITSID_NUM; i++)  in sidtab_destroy()
472 		if (s->isids[i].set)  in sidtab_destroy()
473 			context_destroy(&s->isids[i].leaf.context);  in sidtab_destroy()