| /openbmc/linux/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, &grp->members); in tipc_group_delete_member()
[all …]
|
| H A D | name_table.c | 65 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 …]
|
| /openbmc/u-boot/scripts/dtc/libfdt/ |
| H A D | fdt_overlay.c | 266 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()
|
| /openbmc/linux/scripts/dtc/libfdt/ |
| H A D | fdt_overlay.c | 206 int tree_node, in overlay_update_local_node_references() argument
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()
|
| /openbmc/libpldm/src/dsp/ |
| H A D | pdr.c | 1065 static void find_entity_ref_in_tree(pldm_entity_node *tree_node, in find_entity_ref_in_tree() argument
1072 if (tree_node == NULL) { in find_entity_ref_in_tree()
1076 is_type = tree_node->entity.entity_type == entity.entity_type; in find_entity_ref_in_tree()
1077 is_entity_instance_num = tree_node->entity.entity_instance_num == in find_entity_ref_in_tree()
1079 is_entity_container_id = tree_node->entity.entity_container_id == in find_entity_ref_in_tree()
1083 *node = tree_node; in find_entity_ref_in_tree()
1087 find_entity_ref_in_tree(tree_node->first_child, entity, node); in find_entity_ref_in_tree()
1088 find_entity_ref_in_tree(tree_node->next_sibling, entity, node); in find_entity_ref_in_tree()
|
| /openbmc/linux/mm/ |
| H A D | memcontrol.c | 428 tree_node); in __mem_cgroup_insert_exceeded()
438 mctz->rb_rightmost = &mz->tree_node; in __mem_cgroup_insert_exceeded()
440 rb_link_node(&mz->tree_node, parent, p); in __mem_cgroup_insert_exceeded()
441 rb_insert_color(&mz->tree_node, &mctz->rb_root); in __mem_cgroup_insert_exceeded()
451 if (&mz->tree_node == mctz->rb_rightmost) in __mem_cgroup_remove_exceeded()
452 mctz->rb_rightmost = rb_prev(&mz->tree_node); in __mem_cgroup_remove_exceeded()
454 rb_erase(&mz->tree_node, &mctz->rb_root); in __mem_cgroup_remove_exceeded()
548 struct mem_cgroup_per_node, tree_node); in __mem_cgroup_largest_soft_limit_node()
|
| /openbmc/linux/include/linux/ |
| H A D | memcontrol.h | 136 struct rb_node tree_node; /* RB tree node */ member
|