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.linear.rb,
39 if (!prev->shared.linear.rb.rb_right) { in vma_interval_tree_insert_after()
41 link = &prev->shared.linear.rb.rb_right; in vma_interval_tree_insert_after()
43 parent = rb_entry(prev->shared.linear.rb.rb_right, in vma_interval_tree_insert_after()
44 struct vm_area_struct, shared.linear.rb); in vma_interval_tree_insert_after()
47 while (parent->shared.linear.rb.rb_left) { in vma_interval_tree_insert_after()
48 parent = rb_entry(parent->shared.linear.rb.rb_left, in vma_interval_tree_insert_after()
49 struct vm_area_struct, shared.linear.rb); in vma_interval_tree_insert_after()
53 link = &parent->shared.linear.rb.rb_left; in vma_interval_tree_insert_after()
57 rb_link_node(&node->shared.linear.rb, &parent->shared.linear.rb, link); in vma_interval_tree_insert_after()
[all …]
Dkmemleak.c405 struct rb_node *rb = object_tree_root.rb_node; in lookup_object() local
407 while (rb) { in lookup_object()
409 rb_entry(rb, struct kmemleak_object, rb_node); in lookup_object()
411 rb = object->rb_node.rb_left; in lookup_object()
413 rb = object->rb_node.rb_right; in lookup_object()
Dnommu.c1271 struct rb_node *rb; in do_mmap_pgoff() local
1335 for (rb = rb_first(&nommu_region_tree); rb; rb = rb_next(rb)) { in do_mmap_pgoff()
1336 pregion = rb_entry(rb, struct vm_region, vm_rb); in do_mmap_pgoff()