lib/maple_tree.c

1153

ma_free_rcu(mte_to_node(used));

lib/maple_tree.c

1540

struct maple_node *node = mte_to_node(parent);

lib/maple_tree.c

1791

tmp = mte_to_node(enode);

lib/maple_tree.c

2026

node = mte_to_node(next);

lib/maple_tree.c

2617

WARN_ON_ONCE(cp->dst[0].node != mte_to_node(

lib/maple_tree.c

290

return mte_to_node(mas->node);

lib/maple_tree.c

2976

node = mte_to_node(next);

lib/maple_tree.c

299

mte_to_node(mn)->parent = ma_parent_ptr(mte_to_node(mn));

lib/maple_tree.c

356

return ma_is_root(mte_to_node(node));

lib/maple_tree.c

4082

tmp = mte_to_node(enode);

lib/maple_tree.c

442

p_type = (unsigned long)mte_to_node(enode)->parent;

lib/maple_tree.c

4630

node = mte_to_node(entry);

lib/maple_tree.c

4655

next = mte_to_node(*enode);

lib/maple_tree.c

4658

node = mte_to_node(*enode);

lib/maple_tree.c

4690

node = mte_to_node(enode);

lib/maple_tree.c

4695

if (mte_to_node(enode) == node)

lib/maple_tree.c

4699

slots = ma_slots(mte_to_node(enode), type);

lib/maple_tree.c

4704

node = mte_to_node(enode);

lib/maple_tree.c

4725

node = mte_to_node(*enode);

lib/maple_tree.c

4748

struct maple_node *node = mte_to_node(enode);

lib/maple_tree.c

4759

node = mte_to_node(enode); // Updated in the above call.

lib/maple_tree.c

4770

if (mte_to_node(enode) == node)

lib/maple_tree.c

4774

slots = ma_slots(mte_to_node(enode), type);

lib/maple_tree.c

4779

if (mte_node_type(tmp) && mte_to_node(tmp)) {

lib/maple_tree.c

4785

node = mte_to_node(enode);

lib/maple_tree.c

4788

node = mte_to_node(enode);

lib/maple_tree.c

4810

struct maple_node *node = mte_to_node(enode);

lib/maple_tree.c

495

mte_to_node(enode)->parent = ma_parent_ptr(val);

lib/maple_tree.c

507

unsigned long val = (unsigned long)mte_to_node(enode)->parent;

lib/maple_tree.c

529

(mte_to_node(enode)->parent) & ~MAPLE_NODE_MASK);

lib/maple_tree.c

558

node = mte_to_node(enode);

lib/maple_tree.c

5965

node = mte_to_node(mas->node);

lib/maple_tree.c

5974

node = mte_to_node(mas->node);

lib/maple_tree.c

5990

struct maple_node *node = mte_to_node(mas->node);

lib/maple_tree.c

5991

struct maple_node *new_node = mte_to_node(new_mas->node);

lib/maple_tree.c

6013

struct maple_node *node = mte_to_node(mas->node);

lib/maple_tree.c

6014

struct maple_node *new_node = mte_to_node(new_mas->node);

lib/maple_tree.c

6116

parent = ma_parent_ptr(mte_to_node(new_mas->node));

lib/maple_tree.c

6123

mte_to_node(root)->parent = ma_parent_ptr(mas_tree_parent(new_mas));

lib/maple_tree.c

6485

struct maple_range_64 *node = &mte_to_node(entry)->mr64;

lib/maple_tree.c

6538

struct maple_arange_64 *node = &mte_to_node(entry)->ma64;

lib/maple_tree.c

657

struct maple_node *node = mte_to_node(mn);

lib/maple_tree.c

6597

struct maple_node *node = mte_to_node(entry);

lib/maple_tree.c

6650

struct maple_node *p_mn, *node = mte_to_node(mte);

lib/maple_tree.c

6776

void __rcu **slots = ma_slots(mte_to_node(mas->node), type);

lib/maple_tree.c

6777

unsigned long *pivots = ma_pivots(mte_to_node(mas->node), type);

lib/maple_tree.c

6795

mas_mn(mas), i, mte_to_node(child),

lib/maple_tree.c

6800

if (mte_parent(child) != mte_to_node(mas->node)) {

lib/maple_tree.c

6802

mte_to_node(child), mte_parent(child),

lib/maple_tree.c

6803

mte_to_node(mas->node));

lib/maple_tree.c

6822

void __rcu **slots = ma_slots(mte_to_node(mas->node), type);

lib/maple_tree.c

6899

slots = ma_slots(mte_to_node(mas.node), mte_node_type(mas.node));

lib/maple_tree.c

6913

slots = ma_slots(mte_to_node(mas.node),

lib/maple_tree.c

826

if (unlikely((mte_to_node(next) &&

lib/maple_tree.c

918

node = mte_to_node(mat->head);

tools/testing/radix-tree/maple.c

35003

pivots = ma_pivots(mte_to_node(prev), mte_node_type(prev));

tools/testing/radix-tree/maple.c

35089

mas_node_walk(mas, mte_to_node(mas->node), type, &min, &max);

tools/testing/radix-tree/maple.c

35092

pivots = ma_pivots(mte_to_node(mas->node), type);

tools/testing/radix-tree/maple.c

35715

node_a = mte_to_node(enode_a);

tools/testing/radix-tree/maple.c

35716

node_b = mte_to_node(enode_b);

tools/testing/radix-tree/maple.c

496

node = mte_to_node(next);