Searched refs:rb_root (Results 1 – 12 of 12) sorted by relevance
| /mm/ |
| D | ksm.c | 222 static struct rb_root one_stable_tree[1] = { RB_ROOT };
223 static struct rb_root one_unstable_tree[1] = { RB_ROOT };
224 static struct rb_root *root_stable_tree = one_stable_tree;
225 static struct rb_root *root_unstable_tree = one_unstable_tree;
591 struct rb_root *root) in alloc_stable_node_chain()
624 struct rb_root *root) in free_stable_node_chain()
914 struct rb_root *root) in remove_stable_node_chain()
1356 struct rb_root *root, in stable_node_dup()
1474 struct rb_root *root) in stable_node_dup_any()
1502 struct rb_root *root, in __stable_node_chain()
[all …]
|
| D | mmap.c | 330 struct rb_root *root = &mm->mm_rb; in browse_rb()
376 static void validate_mm_rb(struct rb_root *root, struct vm_area_struct *ignore) in validate_mm_rb()
452 struct rb_root *root) in vma_rb_insert()
460 static void __vma_rb_erase(struct vm_area_struct *vma, struct rb_root *root) in __vma_rb_erase()
471 struct rb_root *root, in vma_rb_erase_ignore()
485 struct rb_root *root) in vma_rb_erase()
516 anon_vma_interval_tree_remove(avc, &avc->anon_vma->rb_root); in anon_vma_interval_tree_pre_update_vma()
525 anon_vma_interval_tree_insert(avc, &avc->anon_vma->rb_root); in anon_vma_interval_tree_post_update_vma()
3484 if (!test_bit(0, (unsigned long *) &anon_vma->root->rb_root.rb_root.rb_node)) { in vm_lock_anon_vma()
3500 &anon_vma->root->rb_root.rb_root.rb_node)) in vm_lock_anon_vma()
[all …]
|
| D | zswap.c | 173 struct rb_root rbroot;
267 static struct zswap_entry *zswap_rb_search(struct rb_root *root, pgoff_t offset) in zswap_rb_search()
288 static int zswap_rb_insert(struct rb_root *root, struct zswap_entry *entry, in zswap_rb_insert()
311 static void zswap_rb_erase(struct rb_root *root, struct zswap_entry *entry) in zswap_rb_erase()
358 static struct zswap_entry *zswap_entry_find_get(struct rb_root *root, in zswap_entry_find_get()
|
| D | rmap.c | 145 anon_vma_interval_tree_insert(avc, &anon_vma->rb_root); in anon_vma_chain_link()
390 anon_vma_interval_tree_remove(avc, &anon_vma->rb_root); in unlink_anon_vmas()
396 if (RB_EMPTY_ROOT(&anon_vma->rb_root.rb_root)) { in unlink_anon_vmas()
430 anon_vma->rb_root = RB_ROOT_CACHED; in anon_vma_ctor()
1831 anon_vma_interval_tree_foreach(avc, &anon_vma->rb_root, in rmap_walk_anon()
|
| D | vmalloc.c | 337 static struct rb_root vmap_area_root = RB_ROOT;
364 static struct rb_root free_vmap_area_root = RB_ROOT;
438 struct rb_root *root, struct rb_node *from, in find_va_links()
500 link_va(struct vmap_area *va, struct rb_root *root, in link_va()
539 unlink_va(struct vmap_area *va, struct rb_root *root) in unlink_va()
653 struct rb_root *root, struct list_head *head) in insert_vmap_area()
664 struct rb_node *from, struct rb_root *root, in insert_vmap_area_augment()
687 struct rb_root *root, struct list_head *head) in merge_or_add_vmap_area()
|
| D | interval_tree.c | 57 rb_insert_augmented(&node->shared.rb, &root->rb_root, in vma_interval_tree_insert_after()
|
| D | memcontrol.c | 119 struct rb_root rb_root; member
525 struct rb_node **p = &mctz->rb_root.rb_node; in __mem_cgroup_insert_exceeded()
557 rb_insert_color(&mz->tree_node, &mctz->rb_root); in __mem_cgroup_insert_exceeded()
570 rb_erase(&mz->tree_node, &mctz->rb_root); in __mem_cgroup_remove_exceeded()
3180 if (!mctz || RB_EMPTY_ROOT(&mctz->rb_root)) in mem_cgroup_soft_limit_reclaim()
6949 rtpn->rb_root = RB_ROOT; in mem_cgroup_init()
|
| D | backing-dev.c | 31 static struct rb_root bdi_tree = RB_ROOT;
|
| D | memory-failure.c | 458 anon_vma_interval_tree_foreach(vmac, &av->rb_root, in collect_procs_anon()
|
| D | kmemleak.c | 193 static struct rb_root object_tree_root = RB_ROOT;
|
| D | nommu.c | 61 struct rb_root nommu_region_tree = RB_ROOT;
|
| D | memory.c | 2722 if (unlikely(!RB_EMPTY_ROOT(&mapping->i_mmap.rb_root))) in unmap_mapping_pages()
|