Home
last modified time | relevance | path

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

/linux/net/tipc/
A Dgroup.c64 struct rb_node tree_node; member
204 rbtree_postorder_for_each_entry_safe(m, tmp, tree, tree_node) { in tipc_group_join()
220 rbtree_postorder_for_each_entry_safe(m, tmp, tree, tree_node) { in tipc_group_delete()
240 m = container_of(n, struct tipc_member, tree_node); in tipc_group_find_member()
270 m = container_of(n, struct tipc_member, tree_node); in tipc_group_find_node()
286 tmp = container_of(*n, struct tipc_member, tree_node); in tipc_group_add_to_tree()
288 tmp = container_of(parent, struct tipc_member, tree_node); in tipc_group_add_to_tree()
297 rb_link_node(&m->tree_node, parent, n); in tipc_group_add_to_tree()
298 rb_insert_color(&m->tree_node, &grp->members); in tipc_group_add_to_tree()
340 rb_erase(&m->tree_node, &grp->members); in tipc_group_delete_member()
[all …]
A Dname_table.c65 struct rb_node tree_node; member
93 struct service_range, tree_node, u32, max, in RB_DECLARE_CALLBACKS_MAX() argument
97 (container_of(rbtree_node, struct service_range, tree_node)) in RB_DECLARE_CALLBACKS_MAX()
115 sr = service_range_match_next(&(sr)->tree_node, \
325 rb_link_node(&sr->tree_node, parent, n); in tipc_service_create_range()
326 rb_insert_augmented(&sr->tree_node, &sc->ranges, &sr_callbacks); in tipc_service_create_range()
528 rb_erase_augmented(&sr->tree_node, &sc->ranges, &sr_callbacks); in tipc_nametbl_remove_publ()
745 sr = container_of(n, struct service_range, tree_node); in tipc_nametbl_build_group()
917 rbtree_postorder_for_each_entry_safe(sr, tmpr, &sc->ranges, tree_node) { in tipc_service_delete()
922 rb_erase_augmented(&sr->tree_node, &sc->ranges, &sr_callbacks); in tipc_service_delete()
[all …]
/linux/scripts/dtc/libfdt/
A Dfdt_overlay.c221 int tree_node, in overlay_update_local_node_references() argument
246 tree_val = fdt_getprop(fdto, tree_node, name, &tree_len); in overlay_update_local_node_references()
271 tree_node, in overlay_update_local_node_references()
290 tree_child = fdt_subnode_offset(fdto, tree_node, in overlay_update_local_node_references()
/linux/mm/
A Dmemcontrol.c472 tree_node); in __mem_cgroup_insert_exceeded()
482 mctz->rb_rightmost = &mz->tree_node; in __mem_cgroup_insert_exceeded()
484 rb_link_node(&mz->tree_node, parent, p); in __mem_cgroup_insert_exceeded()
485 rb_insert_color(&mz->tree_node, &mctz->rb_root); in __mem_cgroup_insert_exceeded()
495 if (&mz->tree_node == mctz->rb_rightmost) in __mem_cgroup_remove_exceeded()
496 mctz->rb_rightmost = rb_prev(&mz->tree_node); in __mem_cgroup_remove_exceeded()
498 rb_erase(&mz->tree_node, &mctz->rb_root); in __mem_cgroup_remove_exceeded()
586 struct mem_cgroup_per_node, tree_node); in __mem_cgroup_largest_soft_limit_node()
/linux/include/linux/
A Dmemcontrol.h149 struct rb_node tree_node; /* RB tree node */ member

Completed in 29 milliseconds