ptr_inner 81 security/selinux/ss/sidtab.c if (!s->roots[l].ptr_inner) { ptr_inner 82 security/selinux/ss/sidtab.c s->roots[l].ptr_inner = kzalloc(SIDTAB_NODE_ALLOC_SIZE, ptr_inner 84 security/selinux/ss/sidtab.c if (!s->roots[l].ptr_inner) ptr_inner 86 security/selinux/ss/sidtab.c s->roots[l].ptr_inner->entries[0] = s->roots[l - 1]; ptr_inner 110 security/selinux/ss/sidtab.c entry = &entry->ptr_inner->entries[leaf_index >> capacity_shift]; ptr_inner 113 security/selinux/ss/sidtab.c if (!entry->ptr_inner) { ptr_inner 115 security/selinux/ss/sidtab.c entry->ptr_inner = kzalloc(SIDTAB_NODE_ALLOC_SIZE, ptr_inner 117 security/selinux/ss/sidtab.c if (!entry->ptr_inner) ptr_inner 181 security/selinux/ss/sidtab.c struct sidtab_node_inner *node = entry.ptr_inner; ptr_inner 368 security/selinux/ss/sidtab.c if (!edst->ptr_inner) { ptr_inner 369 security/selinux/ss/sidtab.c edst->ptr_inner = kzalloc(SIDTAB_NODE_ALLOC_SIZE, ptr_inner 371 security/selinux/ss/sidtab.c if (!edst->ptr_inner) ptr_inner 376 security/selinux/ss/sidtab.c rc = sidtab_convert_tree(&edst->ptr_inner->entries[i], ptr_inner 377 security/selinux/ss/sidtab.c &esrc->ptr_inner->entries[i], ptr_inner 461 security/selinux/ss/sidtab.c struct sidtab_node_inner *node = entry.ptr_inner; ptr_inner 490 security/selinux/ss/sidtab.c while (level && !s->roots[level].ptr_inner) ptr_inner 27 security/selinux/ss/sidtab.h struct sidtab_node_inner *ptr_inner;