mte_to_node
ma_free_rcu(mte_to_node(used));
struct maple_node *node = mte_to_node(parent);
struct maple_node *node = mte_to_node(mas->node);
tmp = mte_to_node(enode);
node = mte_to_node(next);
mte_to_node(ancestor)->parent = mas_mn(mas)->parent;
return mte_to_node(mas->node);
node = mte_to_node(next);
mte_to_node(mn)->parent = ma_parent_ptr(mte_to_node(mn));
return ma_is_root(mte_to_node(node));
tmp = mte_to_node(enode);
p_type = (unsigned long)mte_to_node(enode)->parent;
node = mte_to_node(entry);
next = mte_to_node(*enode);
node = mte_to_node(*enode);
node = mte_to_node(enode);
if (mte_to_node(enode) == node)
slots = ma_slots(mte_to_node(enode), type);
node = mte_to_node(enode);
node = mte_to_node(*enode);
struct maple_node *node = mte_to_node(enode);
node = mte_to_node(enode); // Updated in the above call.
if (mte_to_node(enode) == node)
slots = ma_slots(mte_to_node(enode), type);
if (mte_node_type(tmp) && mte_to_node(tmp)) {
node = mte_to_node(enode);
node = mte_to_node(enode);
struct maple_node *node = mte_to_node(enode);
mte_to_node(enode)->parent = ma_parent_ptr(val);
unsigned long val = (unsigned long)mte_to_node(enode)->parent;
(mte_to_node(enode)->parent) & ~MAPLE_NODE_MASK);
node = mte_to_node(enode);
node = mte_to_node(mas->node);
node = mte_to_node(mas->node);
struct maple_node *node = mte_to_node(mas->node);
struct maple_node *new_node = mte_to_node(new_mas->node);
struct maple_node *node = mte_to_node(mas->node);
struct maple_node *new_node = mte_to_node(new_mas->node);
parent = ma_parent_ptr(mte_to_node(new_mas->node));
mte_to_node(root)->parent = ma_parent_ptr(mas_tree_parent(new_mas));
struct maple_range_64 *node = &mte_to_node(entry)->mr64;
struct maple_arange_64 *node = &mte_to_node(entry)->ma64;
struct maple_node *node = mte_to_node(mn);
struct maple_node *node = mte_to_node(entry);
struct maple_node *p_mn, *node = mte_to_node(mte);
void __rcu **slots = ma_slots(mte_to_node(mas->node), type);
unsigned long *pivots = ma_pivots(mte_to_node(mas->node), type);
mas_mn(mas), i, mte_to_node(child),
if (mte_parent(child) != mte_to_node(mas->node)) {
mte_to_node(child), mte_parent(child),
mte_to_node(mas->node));
void __rcu **slots = ma_slots(mte_to_node(mas->node), type);
slots = ma_slots(mte_to_node(mas.node), mte_node_type(mas.node));
slots = ma_slots(mte_to_node(mas.node),
if (unlikely((mte_to_node(next) &&
node = mte_to_node(mat->head);
pivots = ma_pivots(mte_to_node(prev), mte_node_type(prev));
mas_node_walk(mas, mte_to_node(mas->node), type, &min, &max);
pivots = ma_pivots(mte_to_node(mas->node), type);
node_a = mte_to_node(enode_a);
node_b = mte_to_node(enode_b);
node = mte_to_node(next);