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))
172 static inline struct maple_node *mt_alloc_one(gfp_t gfp) in mt_alloc_one()
205 static void ma_free_rcu(struct maple_node *node) in ma_free_rcu()
299 static __always_inline struct maple_node *mte_to_node( in mte_to_node()
302 return (struct maple_node *)((unsigned long)entry & ~MAPLE_NODE_MASK); in mte_to_node()
323 static inline struct maple_node *mas_mn(const struct ma_state *mas) in mas_mn()
345 static inline struct maple_enode *mt_mk_node(const struct maple_node *node, in mt_mk_node()
377 static __always_inline bool ma_is_root(struct maple_node *node) in ma_is_root()
554 struct maple_node *mte_parent(const struct maple_enode *enode) in mte_parent()
566 static __always_inline bool ma_dead_node(const struct maple_node *node) in ma_dead_node()
[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.h292 struct maple_node { struct
446 struct maple_node *alloc; /* A single allocated node for fast path writes */
458 struct maple_node *node; /* Decoded mas->node */
/linux/tools/testing/radix-tree/
H A Dmaple.c414 static inline void mas_node_walk(struct ma_state *mas, struct maple_node *node, in mas_node_walk()
490 struct maple_node *node; in mas_descend_walk()
35105 struct maple_node *mn; in check_prealloc()
35536 struct maple_node *node_a, *node_b; in compare_node()
35537 struct maple_node a, b; in compare_node()
35602 return memcmp(&a, &b, sizeof(struct maple_node)); in compare_node()
36035 struct maple_node *node; in farmer_tests()
36128 struct maple_node *node = mas_mn(mas); in get_last_index()