Home
last modified time | relevance | path

Searched refs:rb (Results 1 – 3 of 3) sorted by relevance

/mm/
Dinterval_tree.c24 INTERVAL_TREE_DEFINE(struct vm_area_struct, shared.rb,
39 if (!prev->shared.rb.rb_right) { in vma_interval_tree_insert_after()
41 link = &prev->shared.rb.rb_right; in vma_interval_tree_insert_after()
43 parent = rb_entry(prev->shared.rb.rb_right, in vma_interval_tree_insert_after()
44 struct vm_area_struct, shared.rb); in vma_interval_tree_insert_after()
47 while (parent->shared.rb.rb_left) { in vma_interval_tree_insert_after()
48 parent = rb_entry(parent->shared.rb.rb_left, in vma_interval_tree_insert_after()
49 struct vm_area_struct, shared.rb); in vma_interval_tree_insert_after()
53 link = &parent->shared.rb.rb_left; in vma_interval_tree_insert_after()
57 rb_link_node(&node->shared.rb, &parent->shared.rb, link); in vma_interval_tree_insert_after()
[all …]
Dnommu.c1212 struct rb_node *rb; in do_mmap() local
1272 for (rb = rb_first(&nommu_region_tree); rb; rb = rb_next(rb)) { in do_mmap()
1273 pregion = rb_entry(rb, struct vm_region, vm_rb); in do_mmap()
Dkmemleak.c408 struct rb_node *rb = object_tree_root.rb_node; in lookup_object() local
410 while (rb) { in lookup_object()
412 rb_entry(rb, struct kmemleak_object, rb_node); in lookup_object()
414 rb = object->rb_node.rb_left; in lookup_object()
416 rb = object->rb_node.rb_right; in lookup_object()