Home
last modified time | relevance | path

Searched refs:ma_slots (Results 1 – 3 of 3) sorted by relevance

/linux/lib/
H A Dmaple_tree.c683 static inline void __rcu **ma_slots(struct maple_node *mn, enum maple_type mt) in ma_slots() function
941 slots = ma_slots(node, type); in mas_descend()
1286 wr_mas->slots = ma_slots(wr_mas->node, wr_mas->type); in wr_mas_setup()
1388 slots = ma_slots(mn, mt); in mas_leaf_max_gap()
1541 void __rcu **slots = ma_slots(node, type); in mas_adopt_children()
1574 slots = ma_slots(mte_parent(mas->node), in mas_put_in_tree()
1616 slots = ma_slots(node, mt); in mas_find_child()
1927 d_slots = ma_slots(dst, d_mt) + d_start; in node_copy()
1929 s_slots = ma_slots(src, s_mt) + start; in node_copy()
1982 memset(ma_slots(node, mt) + end, 0, size * sizeof(void *)); in node_finalise()
[all …]
/linux/scripts/gdb/linux/
H A Dmapletree.py181 def ma_slots(node, tp): function
184 … .format(ma_slots.__name__, maple_node_type.get_type().pointer(), node.type))
215 slots = ma_slots(node, tp)
/linux/tools/testing/radix-tree/
H A Dmaple.c499 next = mas_slot(mas, ma_slots(node, type), mas->offset); in mas_descend_walk()
35746 slots_a = ma_slots(&a, type); in compare_node()
35747 slots_b = ma_slots(&b, type); in compare_node()