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.c105 #define mt_node_max(x) mt_max[mte_node_type(x)]
114 #define mt_slot_count(x) mt_slots[mte_node_type(x)]
122 #define mt_pivot_count(x) mt_pivots[mte_node_type(x)]
130 #define mt_min_slot_count(x) mt_min_slots[mte_node_type(x)]
231 static __always_inline enum maple_type mte_node_type( in mte_node_type() function
250 return ma_is_leaf(mte_node_type(entry)); in mte_is_leaf()
503 enum maple_type p_type = mte_node_type(parent); in mas_set_parent()
682 enum maple_type type = mte_node_type(mn); in mte_set_pivot()
848 mte_node_type(next)))) in mt_clear_meta()
960 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.c496 type = mte_node_type(next); in mas_descend_walk()
34972 pivots = ma_pivots(mte_to_node(prev), mte_node_type(prev)); in mas_dfs_preorder()
34973 mas->max = mas_safe_pivot(mas, pivots, slot, mte_node_type(prev)); in mas_dfs_preorder()
35055 type = mte_node_type(mas->node); in get_vacant_height()
35079 type = mte_node_type(mas->node); in get_vacant_height()
35548 type = mte_node_type(enode_a); in compare_node()
35708 type = mte_node_type(mas.node); in build_full_tree()
36129 enum maple_type mt = mte_node_type(mas->node); in get_last_index()