Home
last modified time | relevance | path

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

/linux-6.12.1/lib/
Dmaple_tree.c81 #define ma_mnode_ptr(x) ((struct maple_node *)(x))
160 static inline struct maple_node *mt_alloc_one(gfp_t gfp) in mt_alloc_one()
170 static inline void mt_free_one(struct maple_node *node) in mt_free_one()
182 struct maple_node *node = container_of(head, struct maple_node, rcu); in mt_free_rcu()
194 static void ma_free_rcu(struct maple_node *node) in ma_free_rcu()
288 static __always_inline struct maple_node *mte_to_node( in mte_to_node()
291 return (struct maple_node *)((unsigned long)entry & ~MAPLE_NODE_MASK); in mte_to_node()
312 static inline struct maple_node *mas_mn(const struct ma_state *mas) in mas_mn()
334 static inline struct maple_enode *mt_mk_node(const struct maple_node *node, in mt_mk_node()
366 static __always_inline bool ma_is_root(struct maple_node *node) in ma_is_root()
[all …]
Dtest_maple_tree.c212 static inline __init int not_empty(struct maple_node *node) in not_empty()
/linux-6.12.1/include/linux/
Dmaple_tree.h292 struct maple_node { struct
456 struct maple_node *node; /* Decoded mas->node */
/linux-6.12.1/tools/testing/radix-tree/
Dmaple.c95 struct maple_node *mn, *mn2, *mn3; in check_new_node()
97 struct maple_node *nodes[100]; in check_new_node()
822 static inline void mas_node_walk(struct ma_state *mas, struct maple_node *node, in mas_node_walk()
898 struct maple_node *node; in mas_descend_walk()
35462 struct maple_node *mn; in check_prealloc()
35877 struct maple_node *node_a, *node_b; in compare_node()
35878 struct maple_node a, b; in compare_node()
35943 return memcmp(&a, &b, sizeof(struct maple_node)); in compare_node()
36344 struct maple_node *node; in farmer_tests()
36437 struct maple_node *node = mas_mn(mas); in get_last_index()