Home
last modified time | relevance | path

Searched refs:slot (Results 1 – 4 of 4) sorted by relevance

/lib/
Dradix-tree.c324 struct radix_tree_node *slot; in radix_tree_extend() local
355 slot = root->rnode; in radix_tree_extend()
357 slot = indirect_to_ptr(slot); in radix_tree_extend()
358 slot->parent = node; in radix_tree_extend()
360 node->slots[0] = slot; in radix_tree_extend()
388 struct radix_tree_node *node = NULL, *slot; in __radix_tree_create() local
399 slot = indirect_to_ptr(root->rnode); in __radix_tree_create()
406 if (slot == NULL) { in __radix_tree_create()
408 if (!(slot = radix_tree_node_alloc(root))) in __radix_tree_create()
410 slot->path = height; in __radix_tree_create()
[all …]
Dassoc_array.c32 int slot, ret; in assoc_array_subtree_iterate() local
46 slot = 0; in assoc_array_subtree_iterate()
56 for (; slot < ASSOC_ARRAY_FAN_OUT; slot++) { in assoc_array_subtree_iterate()
57 ptr = ACCESS_ONCE(node->slots[slot]); in assoc_array_subtree_iterate()
84 slot = 0; in assoc_array_subtree_iterate()
90 for (; slot < ASSOC_ARRAY_FAN_OUT; slot++) { in assoc_array_subtree_iterate()
91 ptr = ACCESS_ONCE(node->slots[slot]); in assoc_array_subtree_iterate()
101 slot = node->parent_slot; in assoc_array_subtree_iterate()
110 slot = shortcut->parent_slot; in assoc_array_subtree_iterate()
117 slot++; in assoc_array_subtree_iterate()
[all …]
Dlru_cache.c103 struct hlist_head *slot = NULL; in lc_create() local
119 slot = kcalloc(e_count, sizeof(struct hlist_head), GFP_KERNEL); in lc_create()
120 if (!slot) in lc_create()
142 lc->lc_slot = slot; in lc_create()
168 kfree(slot); in lc_create()
/lib/xz/
Dxz_dec_bcj.c201 uint32_t slot; in bcj_ia64() local
224 for (slot = 0, bit_pos = 5; slot < 3; ++slot, bit_pos += 41) { in bcj_ia64()
225 if (((mask >> slot) & 1) == 0) in bcj_ia64()