Home
last modified time | relevance | path

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

/linux/lib/
H A Dmaple_tree.c106 #define mt_node_max(x) mt_max[mte_node_type(x)]
116 #define mt_slot_count(x) mt_slots[mte_node_type(x)]
125 #define mt_pivot_count(x) mt_pivots[mte_node_type(x)]
134 #define mt_min_slot_count(x) mt_min_slots[mte_node_type(x)]
196 static __always_inline enum maple_type mte_node_type( in mte_node_type() function
215 return ma_is_leaf(mte_node_type(entry)); in mte_is_leaf()
619 enum maple_type type = mte_node_type(mn); in mte_set_pivot()
788 mte_node_type(next)))) in mt_clear_meta()
855 enum maple_type p_type = mte_node_type(parent); in mas_set_parent_slots()
936 type = mte_node_type(mas->node); in mas_descend()
[all …]
/linux/scripts/gdb/linux/
H A Dmapletree.py118 def mte_node_type(entry): function
127 … .format(mte_node_type.__name__, maple_enode_type.get_type().pointer(), entry.type))
204 tp = mte_node_type(n)
/linux/tools/testing/radix-tree/
H A Dmaple.c497 type = mte_node_type(next); in mas_descend_walk()
35003 pivots = ma_pivots(mte_to_node(prev), mte_node_type(prev)); in mas_dfs_preorder()
35004 mas->max = mas_safe_pivot(mas, pivots, slot, mte_node_type(prev)); in mas_dfs_preorder()
35086 type = mte_node_type(mas->node); in get_vacant_height()
35110 type = mte_node_type(mas->node); in get_vacant_height()
35714 type = mte_node_type(enode_a); in compare_node()
35874 type = mte_node_type(mas.node); in build_full_tree()
36419 enum maple_type mt = mte_node_type(mas->node); in get_last_index()