Home
last modified time | relevance | path

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

/linux/lib/
H A Dmaple_tree.c264 static __always_inline struct maple_node *mte_to_node( in mte_to_node() function
290 return mte_to_node(mas->node); in mas_mn()
299 mte_to_node(mn)->parent = ma_parent_ptr(mte_to_node(mn)); in mte_set_node_dead()
356 return ma_is_root(mte_to_node(node)); in mte_is_root()
442 p_type = (unsigned long)mte_to_node(enode)->parent; in mas_parent_type()
495 mte_to_node(enode)->parent = ma_parent_ptr(val); in mas_set_parent()
507 unsigned long val = (unsigned long)mte_to_node(enode)->parent; in mte_parent_slot()
529 (mte_to_node(enode)->parent) & ~MAPLE_NODE_MASK); in mte_parent()
558 node = mte_to_node(enode); in mte_dead_node()
657 struct maple_node *node = mte_to_node(mn); in mte_set_pivot()
[all …]
/linux/scripts/gdb/linux/
H A Dmapletree.py139 def mte_to_node(enode): function
147 … .format(mte_to_node.__name__, maple_enode_type.get_type().pointer(), enode.type))
155 node = mte_to_node(enode)
203 node = mte_to_node(n)
/linux/tools/testing/radix-tree/
H A Dmaple.c496 node = mte_to_node(next); in mas_descend_walk()
35003 pivots = ma_pivots(mte_to_node(prev), mte_node_type(prev)); in mas_dfs_preorder()
35089 mas_node_walk(mas, mte_to_node(mas->node), type, &min, &max); in get_vacant_height()
35092 pivots = ma_pivots(mte_to_node(mas->node), type); in get_vacant_height()
35715 node_a = mte_to_node(enode_a); in compare_node()
35716 node_b = mte_to_node(enode_b); in compare_node()