Home
last modified time | relevance | path

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

/linux/lib/
H A Dmaple_tree.c94 #define ma_mnode_ptr(x) ((struct maple_node *)(x))
137 static inline struct maple_node *mt_alloc_one(gfp_t gfp) in mt_alloc_one()
170 static void ma_free_rcu(struct maple_node *node) in ma_free_rcu()
264 static __always_inline struct maple_node *mte_to_node( in mte_to_node()
267 return (struct maple_node *)((unsigned long)entry & ~MAPLE_NODE_MASK); in mte_to_node()
288 static inline struct maple_node *mas_mn(const struct ma_state *mas) in mas_mn()
310 static inline struct maple_enode *mt_mk_node(const struct maple_node *node, in mt_mk_node()
317 static inline void ma_init_slot(void __rcu **slot, const struct maple_node *mn, in ma_init_slot()
349 static __always_inline bool ma_is_root(struct maple_node *node) in ma_is_root()
526 struct maple_node *mte_parent(const struct maple_enode *enode) in mte_parent()
[all …]
H A Dtest_maple_tree.c212 static inline __init int not_empty(struct maple_node *node) in not_empty()
/linux/include/linux/
H A Dmaple_tree.h166 struct maple_node *node;
171 struct maple_node *node;
326 struct maple_node { struct
480 struct maple_node *alloc; /* A single allocated node for fast path writes */
492 struct maple_node *node; /* Decoded mas->node */
/linux/tools/testing/radix-tree/
H A Dmaple.c415 static inline void mas_node_walk(struct ma_state *mas, struct maple_node *node, in mas_node_walk()
491 struct maple_node *node; in mas_descend_walk()
35136 struct maple_node *mn; in check_prealloc()
35285 struct maple_node *pnode; in check_spanning_write()
35702 struct maple_node *node_a, *node_b; in compare_node()
35703 struct maple_node a, b; in compare_node()
35768 return memcmp(&a, &b, sizeof(struct maple_node)); in compare_node()
36321 struct maple_node *node; in farmer_tests()
36418 struct maple_node *node = mas_mn(mas); in get_last_index()