Lines Matching refs:entry
87 void __rcu **entry = rcu_dereference_raw(parent->slots[offset]);
89 *nodep = (void *)entry;
409 void *entry;
418 entry = rcu_dereference_raw(root->xa_head);
419 if (!entry && (!is_idr(root) || root_tag_get(root, IDR_FREE)))
443 if (radix_tree_is_internal_node(entry)) {
444 entry_to_node(entry)->parent = node;
445 } else if (xa_is_value(entry)) {
446 /* Moving a value entry root->xa_head to a node */
450 * entry was already in the radix tree, so we do not need
453 node->slots[0] = (void __rcu *)entry;
454 entry = node_to_entry(node);
455 rcu_assign_pointer(root->xa_head, entry);
489 * For an IDR, we must not shrink entry 0 into the root in
491 * appears to be an internal entry
660 void *entry = rcu_dereference_raw(child->slots[offset]);
661 if (xa_is_node(entry) && child->shift) {
662 child = entry_to_node(entry);
908 * inside the radix tree node. When switching from one type of entry or
1052 * radix_tree_iter_tag_clear - clear a tag on the current iterator entry
1380 * radix_tree_iter_delete - delete the entry at this iterator position
1385 * Delete the entry at the position currently pointed to by the iterator.
1407 * Return: the deleted entry, or %NULL if it was not present
1408 * or the entry at the given @index was not @item.
1415 void *entry;
1417 entry = __radix_tree_lookup(root, index, &node, &slot);
1420 if (!entry && (!is_idr(root) || node_tag_get(root, node, IDR_FREE,
1424 if (item && entry != item)
1429 return entry;
1434 * radix_tree_delete - delete an entry from a radix tree
1438 * Remove the entry at @index from the radix tree rooted at @root.
1440 * Return: The deleted entry, or %NULL if it was not present.