Searched refs:rb (Results 1 – 4 of 4) sorted by relevance
/mm/ |
D | interval_tree.c | 23 INTERVAL_TREE_DEFINE(struct vm_area_struct, shared.rb, 38 if (!prev->shared.rb.rb_right) { in vma_interval_tree_insert_after() 40 link = &prev->shared.rb.rb_right; in vma_interval_tree_insert_after() 42 parent = rb_entry(prev->shared.rb.rb_right, in vma_interval_tree_insert_after() 43 struct vm_area_struct, shared.rb); in vma_interval_tree_insert_after() 46 while (parent->shared.rb.rb_left) { in vma_interval_tree_insert_after() 47 parent = rb_entry(parent->shared.rb.rb_left, in vma_interval_tree_insert_after() 48 struct vm_area_struct, shared.rb); in vma_interval_tree_insert_after() 52 link = &parent->shared.rb.rb_left; in vma_interval_tree_insert_after() 56 rb_link_node(&node->shared.rb, &parent->shared.rb, link); in vma_interval_tree_insert_after() [all …]
|
D | swapfile.c | 157 struct rb_node *rb = rb_first(&sis->swap_extent_root); in first_se() local 158 return rb_entry(rb, struct swap_extent, rb_node); in first_se() 163 struct rb_node *rb = rb_next(&se->rb_node); in next_se() local 164 return rb ? rb_entry(rb, struct swap_extent, rb_node) : NULL; in next_se() 208 struct rb_node *rb; in offset_to_swap_extent() local 210 rb = sis->swap_extent_root.rb_node; in offset_to_swap_extent() 211 while (rb) { in offset_to_swap_extent() 212 se = rb_entry(rb, struct swap_extent, rb_node); in offset_to_swap_extent() 214 rb = rb->rb_left; in offset_to_swap_extent() 216 rb = rb->rb_right; in offset_to_swap_extent() [all …]
|
D | nommu.c | 1106 struct rb_node *rb; in do_mmap() local 1165 for (rb = rb_first(&nommu_region_tree); rb; rb = rb_next(rb)) { in do_mmap() 1166 pregion = rb_entry(rb, struct vm_region, vm_rb); in do_mmap()
|
D | kmemleak.c | 381 struct rb_node *rb = object_tree_root.rb_node; in lookup_object() local 383 while (rb) { in lookup_object() 385 rb_entry(rb, struct kmemleak_object, rb_node); in lookup_object() 387 rb = object->rb_node.rb_left; in lookup_object() 389 rb = object->rb_node.rb_right; in lookup_object()
|