include/linux/memcontrol.h

105

struct rb_node tree_node; /* RB tree node */

mm/memcontrol-v1.c

127

tree_node);

mm/memcontrol-v1.c

137

mctz->rb_rightmost = &mz->tree_node;

mm/memcontrol-v1.c

139

rb_link_node(&mz->tree_node, parent, p);

mm/memcontrol-v1.c

140

rb_insert_color(&mz->tree_node, &mctz->rb_root);

mm/memcontrol-v1.c

150

if (&mz->tree_node == mctz->rb_rightmost)

mm/memcontrol-v1.c

151

mctz->rb_rightmost = rb_prev(&mz->tree_node);

mm/memcontrol-v1.c

153

rb_erase(&mz->tree_node, &mctz->rb_root);

mm/memcontrol-v1.c

247

struct mem_cgroup_per_node, tree_node);

net/tipc/group.c

204

rbtree_postorder_for_each_entry_safe(m, tmp, tree, tree_node) {

net/tipc/group.c

220

rbtree_postorder_for_each_entry_safe(m, tmp, tree, tree_node) {

net/tipc/group.c

240

m = container_of(n, struct tipc_member, tree_node);

net/tipc/group.c

270

m = container_of(n, struct tipc_member, tree_node);

net/tipc/group.c

286

tmp = container_of(*n, struct tipc_member, tree_node);

net/tipc/group.c

288

tmp = container_of(parent, struct tipc_member, tree_node);

net/tipc/group.c

297

rb_link_node(&m->tree_node, parent, n);

net/tipc/group.c

298

rb_insert_color(&m->tree_node, &grp->members);

net/tipc/group.c

340

rb_erase(&m->tree_node, &grp->members);

net/tipc/group.c

403

m = container_of(n, struct tipc_member, tree_node);

net/tipc/group.c

64

struct rb_node tree_node;

net/tipc/name_table.c

1039

sr = container_of(n, struct service_range, tree_node);

net/tipc/name_table.c

115

sr = service_range_match_next(&(sr)->tree_node, \

net/tipc/name_table.c

325

rb_link_node(&sr->tree_node, parent, n);

net/tipc/name_table.c

326

rb_insert_augmented(&sr->tree_node, &sc->ranges, &sr_callbacks);

net/tipc/name_table.c

530

rb_erase_augmented(&sr->tree_node, &sc->ranges, &sr_callbacks);

net/tipc/name_table.c

65

struct rb_node tree_node;

net/tipc/name_table.c

747

sr = container_of(n, struct service_range, tree_node);

net/tipc/name_table.c

919

rbtree_postorder_for_each_entry_safe(sr, tmpr, &sc->ranges, tree_node) {

net/tipc/name_table.c

924

rb_erase_augmented(&sr->tree_node, &sc->ranges, &sr_callbacks);

net/tipc/name_table.c

93

struct service_range, tree_node, u32, max,

net/tipc/name_table.c

97

(container_of(rbtree_node, struct service_range, tree_node))

scripts/dtc/libfdt/fdt_overlay.c

202

int tree_node,

scripts/dtc/libfdt/fdt_overlay.c

227

tree_val = fdt_getprop_w(fdto, tree_node, name, &tree_len);

scripts/dtc/libfdt/fdt_overlay.c

253

tree_child = fdt_subnode_offset(fdto, tree_node,

scripts/dtc/libfdt/fdt_overlay.c

547

static int overlay_update_node_conflicting_references(void *fdto, int tree_node,

scripts/dtc/libfdt/fdt_overlay.c

573

tree_val = fdt_getprop_w(fdto, tree_node, name, &tree_len);

scripts/dtc/libfdt/fdt_overlay.c

597

tree_child = fdt_subnode_offset(fdto, tree_node, fixup_child_name);

tools/testing/selftests/bpf/progs/rbtree_search_kptr.c

128

tnode = container_of(rb_n, struct tree_node, node);

tools/testing/selftests/bpf/progs/rbtree_search_kptr.c

261

struct tree_node *tnode;

tools/testing/selftests/bpf/progs/rbtree_search_kptr.c

274

tnode = container_of(rb_n, struct tree_node, node);

tools/testing/selftests/bpf/progs/rbtree_search_kptr.c

30

private(A) struct bpf_rb_root root __contains(tree_node, node);

tools/testing/selftests/bpf/progs/rbtree_search_kptr.c

38

struct tree_node *node_a, *node_b;

tools/testing/selftests/bpf/progs/rbtree_search_kptr.c

40

node_a = container_of(a, struct tree_node, node);

tools/testing/selftests/bpf/progs/rbtree_search_kptr.c

41

node_b = container_of(b, struct tree_node, node);

tools/testing/selftests/bpf/progs/rbtree_search_kptr.c

50

struct tree_node *tnode;

tools/testing/selftests/bpf/progs/rbtree_search_kptr.c

83

tnode = container_of(rb_n, struct tree_node, node);