Home
last modified time | relevance | path

Searched refs:tree_node (Results 1 – 5 of 5) sorted by relevance

/Linux-v4.19/net/tipc/
Dname_table.c61 struct rb_node tree_node; member
150 sr = container_of(n, struct service_range, tree_node); in tipc_service_first_range()
174 for (n = &sr->tree_node; n; n = rb_next(n)) { in tipc_service_find_range()
175 sr = container_of(n, struct service_range, tree_node); in tipc_service_find_range()
193 tmp = container_of(*n, struct service_range, tree_node); in tipc_service_create_range()
195 tmp = container_of(parent, struct service_range, tree_node); in tipc_service_create_range()
214 rb_link_node(&sr->tree_node, parent, n); in tipc_service_create_range()
215 rb_insert_color(&sr->tree_node, &sc->ranges); in tipc_service_create_range()
306 sr = container_of(n, struct service_range, tree_node); in tipc_service_subscribe()
393 rb_erase(&sr->tree_node, &sc->ranges); in tipc_nametbl_remove_publ()
[all …]
Dgroup.c63 struct rb_node tree_node; member
203 rbtree_postorder_for_each_entry_safe(m, tmp, tree, tree_node) { in tipc_group_join()
219 rbtree_postorder_for_each_entry_safe(m, tmp, tree, tree_node) { in tipc_group_delete()
238 m = container_of(n, struct tipc_member, tree_node); in tipc_group_find_member()
268 m = container_of(n, struct tipc_member, tree_node); in tipc_group_find_node()
284 tmp = container_of(*n, struct tipc_member, tree_node); in tipc_group_add_to_tree()
286 tmp = container_of(parent, struct tipc_member, tree_node); in tipc_group_add_to_tree()
295 rb_link_node(&m->tree_node, parent, n); in tipc_group_add_to_tree()
296 rb_insert_color(&m->tree_node, &grp->members); in tipc_group_add_to_tree()
332 rb_erase(&m->tree_node, &grp->members); in tipc_group_delete_member()
[all …]
/Linux-v4.19/scripts/dtc/libfdt/
Dfdt_overlay.c266 int tree_node, in overlay_update_local_node_references() argument
290 tree_val = fdt_getprop(fdto, tree_node, name, &tree_len); in overlay_update_local_node_references()
315 tree_node, in overlay_update_local_node_references()
334 tree_child = fdt_subnode_offset(fdto, tree_node, in overlay_update_local_node_references()
/Linux-v4.19/mm/
Dmemcontrol.c539 tree_node); in __mem_cgroup_insert_exceeded()
554 mctz->rb_rightmost = &mz->tree_node; in __mem_cgroup_insert_exceeded()
556 rb_link_node(&mz->tree_node, parent, p); in __mem_cgroup_insert_exceeded()
557 rb_insert_color(&mz->tree_node, &mctz->rb_root); in __mem_cgroup_insert_exceeded()
567 if (&mz->tree_node == mctz->rb_rightmost) in __mem_cgroup_remove_exceeded()
568 mctz->rb_rightmost = rb_prev(&mz->tree_node); in __mem_cgroup_remove_exceeded()
570 rb_erase(&mz->tree_node, &mctz->rb_root); in __mem_cgroup_remove_exceeded()
658 struct mem_cgroup_per_node, tree_node); in __mem_cgroup_largest_soft_limit_node()
/Linux-v4.19/include/linux/
Dmemcontrol.h139 struct rb_node tree_node; /* RB tree node */ member