Lines Matching defs:entries
102 * to avoid duplicate entries and long linked lists upon hash
119 int entries = 0;
126 entries++;
143 return scnprintf(page, PAGE_SIZE, "entries: %d\nbuckets used: %d/%d\n"
144 "longest chain: %d\n", entries,
176 s->roots[l].ptr_inner->entries[0] = s->roots[l - 1];
201 entry = &entry->ptr_inner->entries[leaf_index >> capacity_shift];
219 return &entry->ptr_leaf->entries[index % SIDTAB_LEAF_ENTRIES];
224 /* read entries only after reading count */
297 /* bail out if we already reached max entries */
351 /* write entries before updating count */
392 rc = sidtab_convert_tree(&edst->ptr_inner->entries[i],
393 &esrc->ptr_inner->entries[i],
410 &esrc->ptr_leaf->entries[i].context,
411 &edst->ptr_leaf->entries[i].context,
449 /* set count in case no new entries are added during conversion */
452 /* enable live convert of new entries */
458 pr_info("SELinux: Converting %u SID table entries...\n", count);
460 /* convert all entries not covered by live convert */
522 sidtab_destroy_tree(node->entries[i], level - 1);
531 sidtab_destroy_entry(&node->entries[i]);