Lines Matching refs:node
106 bool is_sibling_entry(const struct radix_tree_node *parent, void *node) in is_sibling_entry() argument
108 void __rcu **ptr = node; in is_sibling_entry()
114 bool is_sibling_entry(const struct radix_tree_node *parent, void *node) in is_sibling_entry() argument
152 static inline void tag_set(struct radix_tree_node *node, unsigned int tag, in tag_set() argument
155 __set_bit(offset, node->tags[tag]); in tag_set()
158 static inline void tag_clear(struct radix_tree_node *node, unsigned int tag, in tag_clear() argument
161 __clear_bit(offset, node->tags[tag]); in tag_clear()
164 static inline int tag_get(const struct radix_tree_node *node, unsigned int tag, in tag_get() argument
167 return test_bit(offset, node->tags[tag]); in tag_get()
204 static inline int any_tag_set(const struct radix_tree_node *node, in any_tag_set() argument
209 if (node->tags[tag][idx]) in any_tag_set()
215 static inline void all_tag_set(struct radix_tree_node *node, unsigned int tag) in all_tag_set() argument
217 bitmap_fill(node->tags[tag], RADIX_TREE_MAP_SIZE); in all_tag_set()
232 radix_tree_find_next_bit(struct radix_tree_node *node, unsigned int tag, in radix_tree_find_next_bit() argument
235 const unsigned long *addr = node->tags[tag]; in radix_tree_find_next_bit()
268 static inline unsigned long node_maxindex(const struct radix_tree_node *node) in node_maxindex() argument
270 return shift_maxindex(node->shift); in node_maxindex()
274 const struct radix_tree_node *node, in next_index() argument
277 return (index & ~node_maxindex(node)) + (offset << node->shift); in next_index()
281 static void dump_node(struct radix_tree_node *node, unsigned long index) in dump_node() argument
286 node, node->offset, index, index | node_maxindex(node), in dump_node()
287 node->parent, in dump_node()
288 node->tags[0][0], node->tags[1][0], node->tags[2][0], in dump_node()
289 node->shift, node->count, node->exceptional); in dump_node()
292 unsigned long first = index | (i << node->shift); in dump_node()
293 unsigned long last = first | ((1UL << node->shift) - 1); in dump_node()
294 void *entry = node->slots[i]; in dump_node()
299 i, first, last, node); in dump_node()
302 entry, i, first, last, node); in dump_node()
303 } else if (is_sibling_entry(node, entry)) { in dump_node()
305 entry, i, first, last, node, in dump_node()
332 struct radix_tree_node *node = entry_to_node(entry); in dump_ida_node() local
335 node, node->offset, index * IDA_BITMAP_BITS, in dump_ida_node()
336 ((index | node_maxindex(node)) + 1) * in dump_ida_node()
338 node->parent, node->tags[0][0], node->shift, in dump_ida_node()
339 node->count); in dump_ida_node()
341 dump_ida_node(node->slots[i], in dump_ida_node()
342 index | (i << node->shift)); in dump_ida_node()
437 struct radix_tree_node *node = in radix_tree_node_rcu_free() local
445 memset(node->slots, 0, sizeof(node->slots)); in radix_tree_node_rcu_free()
446 memset(node->tags, 0, sizeof(node->tags)); in radix_tree_node_rcu_free()
447 INIT_LIST_HEAD(&node->private_list); in radix_tree_node_rcu_free()
449 kmem_cache_free(radix_tree_node_cachep, node); in radix_tree_node_rcu_free()
453 radix_tree_node_free(struct radix_tree_node *node) in radix_tree_node_free() argument
455 call_rcu(&node->rcu_head, radix_tree_node_rcu_free); in radix_tree_node_free()
470 struct radix_tree_node *node; in __radix_tree_preload() local
483 node = kmem_cache_alloc(radix_tree_node_cachep, gfp_mask); in __radix_tree_preload()
484 if (node == NULL) in __radix_tree_preload()
489 node->parent = rtp->nodes; in __radix_tree_preload()
490 rtp->nodes = node; in __radix_tree_preload()
493 kmem_cache_free(radix_tree_node_cachep, node); in __radix_tree_preload()
603 struct radix_tree_node *node = rcu_dereference_raw(root->rnode); in radix_tree_load_root() local
605 *nodep = node; in radix_tree_load_root()
607 if (likely(radix_tree_is_internal_node(node))) { in radix_tree_load_root()
608 node = entry_to_node(node); in radix_tree_load_root()
609 *maxindex = node_maxindex(node); in radix_tree_load_root()
610 return node->shift + RADIX_TREE_MAP_SHIFT; in radix_tree_load_root()
637 struct radix_tree_node *node = radix_tree_node_alloc(gfp, NULL, in radix_tree_extend() local
639 if (!node) in radix_tree_extend()
643 all_tag_set(node, IDR_FREE); in radix_tree_extend()
645 tag_clear(node, IDR_FREE, 0); in radix_tree_extend()
652 tag_set(node, tag, 0); in radix_tree_extend()
658 entry_to_node(entry)->parent = node; in radix_tree_extend()
661 node->exceptional = 1; in radix_tree_extend()
667 node->slots[0] = (void __rcu *)entry; in radix_tree_extend()
668 entry = node_to_entry(node); in radix_tree_extend()
686 struct radix_tree_node *node = rcu_dereference_raw(root->rnode); in radix_tree_shrink() local
689 if (!radix_tree_is_internal_node(node)) in radix_tree_shrink()
691 node = entry_to_node(node); in radix_tree_shrink()
698 if (node->count != 1) in radix_tree_shrink()
700 child = rcu_dereference_raw(node->slots[0]); in radix_tree_shrink()
703 if (!radix_tree_is_internal_node(child) && node->shift) in radix_tree_shrink()
717 if (is_idr(root) && !tag_get(node, IDR_FREE, 0)) in radix_tree_shrink()
738 node->count = 0; in radix_tree_shrink()
740 node->slots[0] = (void __rcu *)RADIX_TREE_RETRY; in radix_tree_shrink()
742 update_node(node); in radix_tree_shrink()
745 WARN_ON_ONCE(!list_empty(&node->private_list)); in radix_tree_shrink()
746 radix_tree_node_free(node); in radix_tree_shrink()
754 struct radix_tree_node *node, in delete_node() argument
762 if (node->count) { in delete_node()
763 if (node_to_entry(node) == in delete_node()
770 parent = node->parent; in delete_node()
772 parent->slots[node->offset] = NULL; in delete_node()
784 WARN_ON_ONCE(!list_empty(&node->private_list)); in delete_node()
785 radix_tree_node_free(node); in delete_node()
788 node = parent; in delete_node()
789 } while (node); in delete_node()
815 struct radix_tree_node *node = NULL, *child; in __radix_tree_create() local
839 child = radix_tree_node_alloc(gfp, node, root, shift, in __radix_tree_create()
844 if (node) in __radix_tree_create()
845 node->count++; in __radix_tree_create()
850 node = entry_to_node(child); in __radix_tree_create()
851 offset = radix_tree_descend(node, &child, index); in __radix_tree_create()
852 slot = &node->slots[offset]; in __radix_tree_create()
856 *nodep = node; in __radix_tree_create()
871 static void radix_tree_free_nodes(struct radix_tree_node *node) in radix_tree_free_nodes() argument
874 struct radix_tree_node *child = entry_to_node(node); in radix_tree_free_nodes()
891 if (old == entry_to_node(node)) in radix_tree_free_nodes()
898 static inline int insert_entries(struct radix_tree_node *node, in insert_entries() argument
904 if (node) { in insert_entries()
905 if (order > node->shift) in insert_entries()
906 n = 1 << (order - node->shift); in insert_entries()
909 offset = get_slot_offset(node, slot); in insert_entries()
917 slot = &node->slots[offset]; in insert_entries()
924 node->count--; in insert_entries()
926 if (tag_get(node, tag, offset + i)) in insert_entries()
939 tag_clear(node, tag, offset + i); in insert_entries()
944 tag_set(node, tag, offset); in insert_entries()
947 !is_sibling_entry(node, old) && in insert_entries()
951 node->exceptional--; in insert_entries()
953 if (node) { in insert_entries()
954 node->count += n; in insert_entries()
956 node->exceptional += n; in insert_entries()
961 static inline int insert_entries(struct radix_tree_node *node, in insert_entries() argument
967 if (node) { in insert_entries()
968 node->count++; in insert_entries()
970 node->exceptional++; in insert_entries()
988 struct radix_tree_node *node; in __radix_tree_insert() local
994 error = __radix_tree_create(root, index, order, &node, &slot); in __radix_tree_insert()
998 error = insert_entries(node, slot, item, order, false); in __radix_tree_insert()
1002 if (node) { in __radix_tree_insert()
1003 unsigned offset = get_slot_offset(node, slot); in __radix_tree_insert()
1004 BUG_ON(tag_get(node, 0, offset)); in __radix_tree_insert()
1005 BUG_ON(tag_get(node, 1, offset)); in __radix_tree_insert()
1006 BUG_ON(tag_get(node, 2, offset)); in __radix_tree_insert()
1033 struct radix_tree_node *node, *parent; in __radix_tree_lookup() local
1040 radix_tree_load_root(root, &node, &maxindex); in __radix_tree_lookup()
1044 while (radix_tree_is_internal_node(node)) { in __radix_tree_lookup()
1047 if (node == RADIX_TREE_RETRY) in __radix_tree_lookup()
1049 parent = entry_to_node(node); in __radix_tree_lookup()
1050 offset = radix_tree_descend(parent, &node, index); in __radix_tree_lookup()
1058 return node; in __radix_tree_lookup()
1103 static inline void replace_sibling_entries(struct radix_tree_node *node, in replace_sibling_entries() argument
1108 unsigned offset = get_slot_offset(node, slot) + 1; in replace_sibling_entries()
1111 if (rcu_dereference_raw(node->slots[offset]) != ptr) in replace_sibling_entries()
1114 node->slots[offset] = NULL; in replace_sibling_entries()
1115 node->count--; in replace_sibling_entries()
1117 node->exceptional += exceptional; in replace_sibling_entries()
1124 struct radix_tree_node *node, int count, int exceptional) in replace_slot() argument
1129 if (node && (count || exceptional)) { in replace_slot()
1130 node->count += count; in replace_slot()
1131 node->exceptional += exceptional; in replace_slot()
1132 replace_sibling_entries(node, slot, count, exceptional); in replace_slot()
1139 const struct radix_tree_node *node, in node_tag_get() argument
1142 if (node) in node_tag_get()
1143 return tag_get(node, tag, offset); in node_tag_get()
1155 struct radix_tree_node *node, void __rcu **slot, in calculate_count() argument
1159 unsigned offset = get_slot_offset(node, slot); in calculate_count()
1160 bool free = node_tag_get(root, node, IDR_FREE, offset); in calculate_count()
1181 struct radix_tree_node *node, in __radix_tree_replace() argument
1188 int count = calculate_count(root, node, slot, item, old); in __radix_tree_replace()
1195 WARN_ON_ONCE(!node && (slot != (void __rcu **)&root->rnode) && in __radix_tree_replace()
1197 replace_slot(slot, item, node, count, exceptional); in __radix_tree_replace()
1199 if (!node) in __radix_tree_replace()
1203 update_node(node); in __radix_tree_replace()
1205 delete_node(root, node, update_node); in __radix_tree_replace()
1244 __radix_tree_replace(root, iter->node, slot, item, NULL); in radix_tree_iter_replace()
1265 struct radix_tree_node *node; in radix_tree_join() local
1271 error = __radix_tree_create(root, index, order, &node, &slot); in radix_tree_join()
1273 error = insert_entries(node, slot, item, order, true); in radix_tree_join()
1300 struct radix_tree_node *parent, *node, *child; in radix_tree_split() local
1339 node = parent; in radix_tree_split()
1342 if (node->shift > order) { in radix_tree_split()
1343 child = radix_tree_node_alloc(gfp, node, root, in radix_tree_split()
1344 node->shift - RADIX_TREE_MAP_SHIFT, in radix_tree_split()
1348 if (node != parent) { in radix_tree_split()
1349 node->count++; in radix_tree_split()
1350 rcu_assign_pointer(node->slots[offset], in radix_tree_split()
1354 tag_set(node, tag, offset); in radix_tree_split()
1357 node = child; in radix_tree_split()
1362 n = insert_entries(node, &node->slots[offset], in radix_tree_split()
1368 tag_set(node, tag, offset); in radix_tree_split()
1372 if (node == parent) in radix_tree_split()
1374 offset = node->offset; in radix_tree_split()
1375 child = node; in radix_tree_split()
1376 node = node->parent; in radix_tree_split()
1377 rcu_assign_pointer(node->slots[offset], in radix_tree_split()
1381 if ((node == parent) && (offset == end)) in radix_tree_split()
1394 struct radix_tree_node *node, in node_tag_set() argument
1397 while (node) { in node_tag_set()
1398 if (tag_get(node, tag, offset)) in node_tag_set()
1400 tag_set(node, tag, offset); in node_tag_set()
1401 offset = node->offset; in node_tag_set()
1402 node = node->parent; in node_tag_set()
1425 struct radix_tree_node *node, *parent; in radix_tree_tag_set() local
1428 radix_tree_load_root(root, &node, &maxindex); in radix_tree_tag_set()
1431 while (radix_tree_is_internal_node(node)) { in radix_tree_tag_set()
1434 parent = entry_to_node(node); in radix_tree_tag_set()
1435 offset = radix_tree_descend(parent, &node, index); in radix_tree_tag_set()
1436 BUG_ON(!node); in radix_tree_tag_set()
1446 return node; in radix_tree_tag_set()
1459 node_tag_set(root, iter->node, tag, iter_offset(iter)); in radix_tree_iter_tag_set()
1463 struct radix_tree_node *node, in node_tag_clear() argument
1466 while (node) { in node_tag_clear()
1467 if (!tag_get(node, tag, offset)) in node_tag_clear()
1469 tag_clear(node, tag, offset); in node_tag_clear()
1470 if (any_tag_set(node, tag)) in node_tag_clear()
1473 offset = node->offset; in node_tag_clear()
1474 node = node->parent; in node_tag_clear()
1499 struct radix_tree_node *node, *parent; in radix_tree_tag_clear() local
1503 radix_tree_load_root(root, &node, &maxindex); in radix_tree_tag_clear()
1509 while (radix_tree_is_internal_node(node)) { in radix_tree_tag_clear()
1510 parent = entry_to_node(node); in radix_tree_tag_clear()
1511 offset = radix_tree_descend(parent, &node, index); in radix_tree_tag_clear()
1514 if (node) in radix_tree_tag_clear()
1517 return node; in radix_tree_tag_clear()
1530 node_tag_clear(root, iter->node, tag, iter_offset(iter)); in radix_tree_iter_tag_clear()
1551 struct radix_tree_node *node, *parent; in radix_tree_tag_get() local
1557 radix_tree_load_root(root, &node, &maxindex); in radix_tree_tag_get()
1561 while (radix_tree_is_internal_node(node)) { in radix_tree_tag_get()
1564 parent = entry_to_node(node); in radix_tree_tag_get()
1565 offset = radix_tree_descend(parent, &node, index); in radix_tree_tag_get()
1569 if (node == RADIX_TREE_RETRY) in radix_tree_tag_get()
1587 struct radix_tree_node *node, unsigned offset, in set_iter_tags() argument
1593 if (!node) { in set_iter_tags()
1598 iter->tags = node->tags[tag][tag_long] >> tag_bit; in set_iter_tags()
1604 iter->tags |= node->tags[tag][tag_long + 1] << in set_iter_tags()
1617 if (*nodep && !is_sibling_entry(iter->node, *nodep)) in skip_siblings()
1632 struct radix_tree_node *node; in __radix_tree_next_slot() local
1634 slot = skip_siblings(&node, slot, iter); in __radix_tree_next_slot()
1636 while (radix_tree_is_internal_node(node)) { in __radix_tree_next_slot()
1640 if (node == RADIX_TREE_RETRY) in __radix_tree_next_slot()
1642 node = entry_to_node(node); in __radix_tree_next_slot()
1643 iter->node = node; in __radix_tree_next_slot()
1644 iter->shift = node->shift; in __radix_tree_next_slot()
1647 offset = radix_tree_find_next_bit(node, tag, 0); in __radix_tree_next_slot()
1650 slot = &node->slots[offset]; in __radix_tree_next_slot()
1652 set_iter_tags(iter, node, offset, tag); in __radix_tree_next_slot()
1653 node = rcu_dereference_raw(*slot); in __radix_tree_next_slot()
1656 slot = &node->slots[0]; in __radix_tree_next_slot()
1658 node = rcu_dereference_raw(*slot); in __radix_tree_next_slot()
1659 if (node) in __radix_tree_next_slot()
1692 struct radix_tree_node *node; in radix_tree_iter_resume() local
1696 skip_siblings(&node, slot, iter); in radix_tree_iter_resume()
1715 struct radix_tree_node *node, *child; in radix_tree_next_chunk() local
1746 iter->node = NULL; in radix_tree_next_chunk()
1752 node = entry_to_node(child); in radix_tree_next_chunk()
1753 offset = radix_tree_descend(node, &child, index); in radix_tree_next_chunk()
1756 !tag_get(node, tag, offset) : !child) { in radix_tree_next_chunk()
1762 offset = radix_tree_find_next_bit(node, tag, in radix_tree_next_chunk()
1767 node->slots[offset]); in radix_tree_next_chunk()
1768 if (is_sibling_entry(node, slot)) in radix_tree_next_chunk()
1773 index &= ~node_maxindex(node); in radix_tree_next_chunk()
1774 index += offset << node->shift; in radix_tree_next_chunk()
1780 child = rcu_dereference_raw(node->slots[offset]); in radix_tree_next_chunk()
1790 iter->index = (index &~ node_maxindex(node)) | (offset << node->shift); in radix_tree_next_chunk()
1791 iter->next_index = (index | node_maxindex(node)) + 1; in radix_tree_next_chunk()
1792 iter->node = node; in radix_tree_next_chunk()
1793 __set_iter_shift(iter, node->shift); in radix_tree_next_chunk()
1796 set_iter_tags(iter, node, offset, tag); in radix_tree_next_chunk()
1798 return node->slots + offset; in radix_tree_next_chunk()
1978 struct radix_tree_node *node, in __radix_tree_delete_node() argument
1981 delete_node(root, node, update_node); in __radix_tree_delete_node()
1985 struct radix_tree_node *node, void __rcu **slot) in __radix_tree_delete() argument
1989 unsigned offset = get_slot_offset(node, slot); in __radix_tree_delete()
1993 node_tag_set(root, node, IDR_FREE, offset); in __radix_tree_delete()
1996 node_tag_clear(root, node, tag, offset); in __radix_tree_delete()
1998 replace_slot(slot, NULL, node, -1, exceptional); in __radix_tree_delete()
1999 return node && delete_node(root, node, NULL); in __radix_tree_delete()
2017 if (__radix_tree_delete(root, iter->node, slot)) in radix_tree_iter_delete()
2036 struct radix_tree_node *node = NULL; in radix_tree_delete_item() local
2040 entry = __radix_tree_lookup(root, index, &node, &slot); in radix_tree_delete_item()
2043 if (!entry && (!is_idr(root) || node_tag_get(root, node, IDR_FREE, in radix_tree_delete_item()
2044 get_slot_offset(node, slot)))) in radix_tree_delete_item()
2050 __radix_tree_delete(root, node, slot); in radix_tree_delete_item()
2072 struct radix_tree_node *node, in radix_tree_clear_tags() argument
2075 if (node) { in radix_tree_clear_tags()
2076 unsigned int tag, offset = get_slot_offset(node, slot); in radix_tree_clear_tags()
2078 node_tag_clear(root, node, tag, offset); in radix_tree_clear_tags()
2134 struct radix_tree_node *node = NULL, *child; in idr_get_free() local
2158 child = radix_tree_node_alloc(gfp, node, root, shift, in idr_get_free()
2164 if (node) in idr_get_free()
2165 node->count++; in idr_get_free()
2169 node = entry_to_node(child); in idr_get_free()
2170 offset = radix_tree_descend(node, &child, start); in idr_get_free()
2171 if (!tag_get(node, IDR_FREE, offset)) { in idr_get_free()
2172 offset = radix_tree_find_next_bit(node, IDR_FREE, in idr_get_free()
2174 start = next_index(start, node, offset); in idr_get_free()
2178 offset = node->offset + 1; in idr_get_free()
2179 node = node->parent; in idr_get_free()
2180 if (!node) in idr_get_free()
2182 shift = node->shift; in idr_get_free()
2184 child = rcu_dereference_raw(node->slots[offset]); in idr_get_free()
2186 slot = &node->slots[offset]; in idr_get_free()
2190 if (node) in idr_get_free()
2191 iter->next_index = 1 + min(max, (start | node_maxindex(node))); in idr_get_free()
2194 iter->node = node; in idr_get_free()
2196 set_iter_tags(iter, node, offset, IDR_FREE); in idr_get_free()
2214 struct radix_tree_node *node = rcu_dereference_raw(idr->idr_rt.rnode); in idr_destroy() local
2215 if (radix_tree_is_internal_node(node)) in idr_destroy()
2216 radix_tree_free_nodes(node); in idr_destroy()
2225 struct radix_tree_node *node = arg; in radix_tree_node_ctor() local
2227 memset(node, 0, sizeof(*node)); in radix_tree_node_ctor()
2228 INIT_LIST_HEAD(&node->private_list); in radix_tree_node_ctor()
2259 struct radix_tree_node *node; in radix_tree_cpu_dead() local
2264 node = rtp->nodes; in radix_tree_cpu_dead()
2265 rtp->nodes = node->parent; in radix_tree_cpu_dead()
2266 kmem_cache_free(radix_tree_node_cachep, node); in radix_tree_cpu_dead()