Searched refs:radix_tree_node (Results 1 – 15 of 15) sorted by relevance
/Linux-v4.19/lib/ |
D | radix-tree.c | 87 struct radix_tree_node *nodes; 91 static inline struct radix_tree_node *entry_to_node(void *ptr) in entry_to_node() 106 bool is_sibling_entry(const struct radix_tree_node *parent, void *node) in is_sibling_entry() 114 bool is_sibling_entry(const struct radix_tree_node *parent, void *node) in is_sibling_entry() 121 get_slot_offset(const struct radix_tree_node *parent, void __rcu **slot) in get_slot_offset() 126 static unsigned int radix_tree_descend(const struct radix_tree_node *parent, in radix_tree_descend() 127 struct radix_tree_node **nodep, unsigned long index) in radix_tree_descend() 152 static inline void tag_set(struct radix_tree_node *node, unsigned int tag, in tag_set() 158 static inline void tag_clear(struct radix_tree_node *node, unsigned int tag, in tag_clear() 164 static inline int tag_get(const struct radix_tree_node *node, unsigned int tag, in tag_get() [all …]
|
D | idr.c | 294 struct radix_tree_node *node; in idr_replace()
|
/Linux-v4.19/include/linux/ |
D | radix-tree.h | 92 struct radix_tree_node { struct 97 struct radix_tree_node *parent; /* Used when ascending tree */ argument 115 struct radix_tree_node __rcu *rnode; argument 159 struct radix_tree_node *node; 293 unsigned order, struct radix_tree_node **nodep, 303 struct radix_tree_node **nodep, void __rcu ***slotp); 307 typedef void (*radix_tree_update_node_t)(struct radix_tree_node *); 308 void __radix_tree_replace(struct radix_tree_root *, struct radix_tree_node *, 316 struct radix_tree_node *, 322 void radix_tree_clear_tags(struct radix_tree_root *, struct radix_tree_node *,
|
D | swap.h | 303 void workingset_update_node(struct radix_tree_node *node);
|
/Linux-v4.19/tools/testing/radix-tree/ |
D | test.h | 55 struct radix_tree_node *entry_to_node(void *ptr); 58 unsigned long node_maxindex(struct radix_tree_node *); 63 struct radix_tree_node *nodes;
|
D | linux.c | 30 struct radix_tree_node *node; in kmem_cache_alloc() 66 struct radix_tree_node *node = objp; in kmem_cache_free()
|
D | multiorder.c | 190 struct radix_tree_node *node; in multiorder_shrink() 389 struct radix_tree_node *node; in multiorder_join2() 418 struct radix_tree_node *node; in multiorder_join3() 517 struct radix_tree_node *node; in __multiorder_split2() 544 struct radix_tree_node *node; in __multiorder_split3() 608 struct radix_tree_node *node; in multiorder_account()
|
D | test.c | 234 static int verify_node(struct radix_tree_node *slot, unsigned int tag, in verify_node() 284 struct radix_tree_node *node = root->rnode; in verify_tag_consistency() 320 struct radix_tree_node *node = root->rnode; in tree_verify_min_height()
|
D | tag_check.c | 337 struct radix_tree_node *node; in radix_tree_clear_tags_test()
|
/Linux-v4.19/mm/ |
D | workingset.c | 343 void workingset_update_node(struct radix_tree_node *node) in workingset_update_node() 416 struct radix_tree_node *node; in shadow_lru_isolate() 432 node = container_of(item, struct radix_tree_node, private_list); in shadow_lru_isolate()
|
D | truncate.c | 36 struct radix_tree_node *node; in __clear_shadow_entry()
|
D | filemap.c | 117 struct radix_tree_node *node; in page_cache_tree_insert() 156 struct radix_tree_node *node; in page_cache_tree_delete()
|
D | shmem.c | 330 struct radix_tree_node *node; in shmem_radix_tree_replace()
|
/Linux-v4.19/tools/testing/radix-tree/linux/ |
D | radix-tree.h | 16 offsetof(struct radix_tree_node, rcu_head)); in trace_call_rcu()
|
/Linux-v4.19/fs/ |
D | dax.c | 840 struct radix_tree_node *node; in dax_insert_mapping_entry()
|