Searched refs:tree_node (Results 1 – 4 of 4) sorted by relevance
| /linux/drivers/android/binder/range_alloc/ |
| H A D | tree.rs | 53 let tree_node = alloc.tree.pop().unwrap(); in from_array() localVariable
55 tree_node.into_node(free_offset, Descriptor::new(free_offset, free_size)), in from_array()
65 let tree_node = alloc.tree.pop().unwrap(); in from_array() localVariable
68 tree.tree.insert(tree_node.into_node(range.offset, desc)); in from_array()
77 let tree_node = alloc.tree.pop().unwrap(); in from_array() localVariable
79 .insert(tree_node.into_node(free_offset, Descriptor::new(free_offset, free_size))); in from_array()
176 let (found_size, found_off, tree_node, free_tree_node) = match self.find_best_match(size) { in reserve_new()
187 let (tree_node, free_tree_node, desc_node_res) = alloc.initialize(new_desc); in reserve_new()
195 (found_size, found_offset, tree_node, free_tree_node) in reserve_new()
202 self.tree.insert(tree_node); in reserve_new()
|
| /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 …]
|
| /linux/mm/ |
| H A D | memcontrol-v1.c | 127 tree_node); in __mem_cgroup_insert_exceeded()
137 mctz->rb_rightmost = &mz->tree_node; in __mem_cgroup_insert_exceeded()
139 rb_link_node(&mz->tree_node, parent, p); in __mem_cgroup_insert_exceeded()
140 rb_insert_color(&mz->tree_node, &mctz->rb_root); in __mem_cgroup_insert_exceeded()
150 if (&mz->tree_node == mctz->rb_rightmost) in __mem_cgroup_remove_exceeded()
151 mctz->rb_rightmost = rb_prev(&mz->tree_node); in __mem_cgroup_remove_exceeded()
153 rb_erase(&mz->tree_node, &mctz->rb_root); in __mem_cgroup_remove_exceeded()
247 struct mem_cgroup_per_node, tree_node); in __mem_cgroup_largest_soft_limit_node()
|
| /linux/include/linux/ |
| H A D | memcontrol.h | 104 struct rb_node tree_node; /* RB tree node */ member
|