| /kernel/linux/linux-5.10/net/tipc/ |
| H A D | group.c | 63 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()
239 m = container_of(n, struct tipc_member, tree_node); in tipc_group_find_member()
269 m = container_of(n, struct tipc_member, tree_node); in tipc_group_find_node()
285 tmp = container_of(*n, struct tipc_member, tree_node); in tipc_group_add_to_tree()
287 tmp = container_of(parent, struct tipc_member, tree_node); in tipc_group_add_to_tree()
296 rb_link_node(&m->tree_node, parent, n); in tipc_group_add_to_tree()
297 rb_insert_color(&m->tree_node, &grp->members); in tipc_group_add_to_tree()
339 rb_erase(&m->tree_node, in tipc_group_delete_member()
[all...] |
| H A D | name_table.c | 54 * @tree_node: member of service range RB tree
64 struct rb_node tree_node; member
92 struct service_range, tree_node, u32, max,
96 (container_of(rbtree_node, struct service_range, tree_node))
113 sr = service_range_match_next(&(sr)->tree_node, \
312 rb_link_node(&sr->tree_node, parent, n); in tipc_service_create_range()
313 rb_insert_augmented(&sr->tree_node, &sc->ranges, &sr_callbacks); in tipc_service_create_range()
515 rb_erase_augmented(&sr->tree_node, &sc->ranges, &sr_callbacks); in tipc_nametbl_remove_publ()
710 sr = container_of(n, struct service_range, tree_node); in tipc_nametbl_build_group()
881 rbtree_postorder_for_each_entry_safe(sr, tmpr, &sc->ranges, tree_node) { in tipc_service_delete()
[all...] |
| /kernel/linux/linux-6.6/net/tipc/ |
| H A D | group.c | 64 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, in tipc_group_delete_member()
[all...] |
| H A D | name_table.c | 55 * @tree_node: member of service range RB tree
65 struct rb_node tree_node; member
93 struct service_range, tree_node, u32, max,
97 (container_of(rbtree_node, struct service_range, tree_node))
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()
[all...] |
| /kernel/linux/linux-5.10/scripts/dtc/libfdt/ |
| H A D | fdt_overlay.c | 204 * @tree_node: Node offset of the node to operate on
221 int tree_node, in overlay_update_local_node_references()
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()
220 overlay_update_local_node_references(void *fdto, int tree_node, int fixup_node, uint32_t delta) overlay_update_local_node_references() argument
|
| /kernel/linux/linux-6.6/scripts/dtc/libfdt/ |
| H A D | fdt_overlay.c | 189 * @tree_node: Node offset of the node to operate on
206 int tree_node, in overlay_update_local_node_references()
231 tree_val = fdt_getprop(fdto, tree_node, name, &tree_len); in overlay_update_local_node_references()
256 tree_node, in overlay_update_local_node_references()
275 tree_child = fdt_subnode_offset(fdto, tree_node, in overlay_update_local_node_references()
205 overlay_update_local_node_references(void *fdto, int tree_node, int fixup_node, uint32_t delta) overlay_update_local_node_references() argument
|
| /kernel/linux/linux-5.10/mm/ |
| H A D | memcontrol.c | 623 tree_node); in __mem_cgroup_insert_exceeded()
638 mctz->rb_rightmost = &mz->tree_node; in __mem_cgroup_insert_exceeded()
640 rb_link_node(&mz->tree_node, parent, p); in __mem_cgroup_insert_exceeded()
641 rb_insert_color(&mz->tree_node, &mctz->rb_root); in __mem_cgroup_insert_exceeded()
651 if (&mz->tree_node == mctz->rb_rightmost) in __mem_cgroup_remove_exceeded()
652 mctz->rb_rightmost = rb_prev(&mz->tree_node); in __mem_cgroup_remove_exceeded()
654 rb_erase(&mz->tree_node, &mctz->rb_root); in __mem_cgroup_remove_exceeded()
750 struct mem_cgroup_per_node, tree_node); in __mem_cgroup_largest_soft_limit_node()
|
| /kernel/linux/linux-6.6/mm/ |
| H A D | memcontrol.c | 429 tree_node); in __mem_cgroup_insert_exceeded()
439 mctz->rb_rightmost = &mz->tree_node; in __mem_cgroup_insert_exceeded()
441 rb_link_node(&mz->tree_node, parent, p); in __mem_cgroup_insert_exceeded()
442 rb_insert_color(&mz->tree_node, &mctz->rb_root); in __mem_cgroup_insert_exceeded()
452 if (&mz->tree_node == mctz->rb_rightmost) in __mem_cgroup_remove_exceeded()
453 mctz->rb_rightmost = rb_prev(&mz->tree_node); in __mem_cgroup_remove_exceeded()
455 rb_erase(&mz->tree_node, &mctz->rb_root); in __mem_cgroup_remove_exceeded()
557 struct mem_cgroup_per_node, tree_node); in __mem_cgroup_largest_soft_limit_node()
|
| /kernel/linux/linux-5.10/include/linux/ |
| H A D | memcontrol.h | 129 struct rb_node tree_node; /* RB tree node */ member
|
| /kernel/linux/linux-6.6/include/linux/ |
| H A D | memcontrol.h | 143 struct rb_node tree_node; /* RB tree node */ member
|