| /mm/ |
| D | rmap.c | 87 anon_vma->root = anon_vma; in anon_vma_alloc()
115 if (rwsem_is_locked(&anon_vma->root->rwsem)) { in anon_vma_free()
228 static inline struct anon_vma *lock_anon_vma_root(struct anon_vma *root, struct anon_vma *anon_vma) in lock_anon_vma_root() argument
230 struct anon_vma *new_root = anon_vma->root; in lock_anon_vma_root()
231 if (new_root != root) { in lock_anon_vma_root()
232 if (WARN_ON_ONCE(root)) in lock_anon_vma_root()
233 up_write(&root->rwsem); in lock_anon_vma_root()
234 root = new_root; in lock_anon_vma_root()
235 down_write(&root->rwsem); in lock_anon_vma_root()
237 return root; in lock_anon_vma_root()
[all …]
|
| D | interval_tree.c | 31 struct rb_root *root) in vma_interval_tree_insert_after() argument
58 rb_insert_augmented(&node->shared.rb, root, in vma_interval_tree_insert_after()
77 struct rb_root *root) in INTERVAL_TREE_DEFINE()
83 __anon_vma_interval_tree_insert(node, root); in INTERVAL_TREE_DEFINE()
87 struct rb_root *root) in anon_vma_interval_tree_remove() argument
89 __anon_vma_interval_tree_remove(node, root); in anon_vma_interval_tree_remove()
93 anon_vma_interval_tree_iter_first(struct rb_root *root, in anon_vma_interval_tree_iter_first() argument
96 return __anon_vma_interval_tree_iter_first(root, first, last); in anon_vma_interval_tree_iter_first()
|
| D | cleancache.c | 307 struct dentry *root = debugfs_create_dir("cleancache", NULL); in init_cleancache() local
308 if (root == NULL) in init_cleancache()
310 debugfs_create_u64("succ_gets", S_IRUGO, root, &cleancache_succ_gets); in init_cleancache()
312 root, &cleancache_failed_gets); in init_cleancache()
313 debugfs_create_u64("puts", S_IRUGO, root, &cleancache_puts); in init_cleancache()
315 root, &cleancache_invalidates); in init_cleancache()
|
| D | sparse.c | 82 unsigned long root = SECTION_NR_TO_ROOT(section_nr); in sparse_index_init() local
85 if (mem_section[root]) in sparse_index_init()
92 mem_section[root] = section; in sparse_index_init()
107 struct mem_section* root; in __section_nr() local
110 root = __nr_to_section(root_nr * SECTIONS_PER_ROOT); in __section_nr()
111 if (!root) in __section_nr()
114 if ((ms >= root) && (ms < (root + SECTIONS_PER_ROOT))) in __section_nr()
120 return (root_nr * SECTIONS_PER_ROOT) + (ms - root); in __section_nr()
|
| D | frontswap.c | 486 struct dentry *root = debugfs_create_dir("frontswap", NULL); in init_frontswap() local
487 if (root == NULL) in init_frontswap()
489 debugfs_create_u64("loads", S_IRUGO, root, &frontswap_loads); in init_frontswap()
490 debugfs_create_u64("succ_stores", S_IRUGO, root, &frontswap_succ_stores); in init_frontswap()
491 debugfs_create_u64("failed_stores", S_IRUGO, root, in init_frontswap()
494 root, &frontswap_invalidates); in init_frontswap()
|
| D | mmap.c | 290 struct rb_root *root = &mm->mm_rb; in browse_rb() local
295 for (nd = rb_first(root); nd; nd = rb_next(nd)) { in browse_rb()
336 static void validate_mm_rb(struct rb_root *root, struct vm_area_struct *ignore) in validate_mm_rb() argument
340 for (nd = rb_first(root); nd; nd = rb_next(nd)) { in validate_mm_rb()
389 #define validate_mm_rb(root, ignore) do { } while (0) argument
411 struct rb_root *root) in vma_rb_insert() argument
414 validate_mm_rb(root, NULL); in vma_rb_insert()
416 rb_insert_augmented(&vma->vm_rb, root, &vma_gap_callbacks); in vma_rb_insert()
419 static void __vma_rb_erase(struct vm_area_struct *vma, struct rb_root *root) in __vma_rb_erase() argument
426 rb_erase_augmented(&vma->vm_rb, root, &vma_gap_callbacks); in __vma_rb_erase()
[all …]
|
| D | ksm.c | 1127 struct rb_root *root; in stable_tree_search() local
1141 root = root_stable_tree + nid; in stable_tree_search()
1143 new = &root->rb_node; in stable_tree_search()
1208 rb_insert_color(&page_node->node, root); in stable_tree_search()
1216 rb_replace_node(&stable_node->node, &page_node->node, root); in stable_tree_search()
1219 rb_erase(&stable_node->node, root); in stable_tree_search()
1238 struct rb_root *root; in stable_tree_insert() local
1245 root = root_stable_tree + nid; in stable_tree_insert()
1248 new = &root->rb_node; in stable_tree_insert()
1297 rb_insert_color(&stable_node->node, root); in stable_tree_insert()
[all …]
|
| D | zswap.c | 260 static struct zswap_entry *zswap_rb_search(struct rb_root *root, pgoff_t offset) in zswap_rb_search() argument
262 struct rb_node *node = root->rb_node; in zswap_rb_search()
281 static int zswap_rb_insert(struct rb_root *root, struct zswap_entry *entry, in zswap_rb_insert() argument
284 struct rb_node **link = &root->rb_node, *parent = NULL; in zswap_rb_insert()
300 rb_insert_color(&entry->rbnode, root); in zswap_rb_insert()
304 static void zswap_rb_erase(struct rb_root *root, struct zswap_entry *entry) in zswap_rb_erase() argument
307 rb_erase(&entry->rbnode, root); in zswap_rb_erase()
347 static struct zswap_entry *zswap_entry_find_get(struct rb_root *root, in zswap_entry_find_get() argument
352 entry = zswap_rb_search(root, offset); in zswap_entry_find_get()
|
| D | slab.h | 187 #define for_each_memcg_cache(iter, root) \ argument
188 list_for_each_entry(iter, &(root)->memcg_params.list, \
285 #define for_each_memcg_cache(iter, root) \ argument
286 for ((void)(iter), (void)(root); 0; )
|
| D | memcontrol.c | 766 struct mem_cgroup *mem_cgroup_iter(struct mem_cgroup *root, in mem_cgroup_iter() argument
778 if (!root) in mem_cgroup_iter()
779 root = root_mem_cgroup; in mem_cgroup_iter()
784 if (!root->use_hierarchy && root != root_mem_cgroup) { in mem_cgroup_iter()
787 return root; in mem_cgroup_iter()
795 mz = mem_cgroup_nodeinfo(root, reclaim->pgdat->node_id); in mem_cgroup_iter()
821 css = css_next_descendant_pre(css, &root->css); in mem_cgroup_iter()
841 if (css == &root->css) in mem_cgroup_iter()
870 if (prev && prev != root) in mem_cgroup_iter()
881 void mem_cgroup_iter_break(struct mem_cgroup *root, in mem_cgroup_iter_break() argument
[all …]
|
| D | mempolicy.c | 2165 struct rb_node *n = sp->root.rb_node; in sp_lookup()
2198 struct rb_node **p = &sp->root.rb_node; in sp_insert()
2213 rb_insert_color(&new->nd, &sp->root); in sp_insert()
2225 if (!sp->root.rb_node) in mpol_shared_policy_lookup()
2351 rb_erase(&n->nd, &sp->root); in sp_delete()
2464 sp->root = RB_ROOT; /* empty tree == default mempolicy */ in mpol_shared_policy_init()
2529 if (!p->root.rb_node) in mpol_free_shared_policy()
2532 next = rb_first(&p->root); in mpol_free_shared_policy()
|
| D | memblock.c | 1780 struct dentry *root = debugfs_create_dir("memblock", NULL); in memblock_init_debugfs() local
1781 if (!root) in memblock_init_debugfs()
1783 debugfs_create_file("memory", S_IRUGO, root, &memblock.memory, &memblock_debug_fops); in memblock_init_debugfs()
1784 debugfs_create_file("reserved", S_IRUGO, root, &memblock.reserved, &memblock_debug_fops); in memblock_init_debugfs()
1786 debugfs_create_file("physmem", S_IRUGO, root, &memblock.physmem, &memblock_debug_fops); in memblock_init_debugfs()
|
| D | vmscan.c | 2531 struct mem_cgroup *root = sc->target_mem_cgroup; in shrink_node() local
2542 memcg = mem_cgroup_iter(root, NULL, &reclaim); in shrink_node()
2548 if (mem_cgroup_low(root, memcg)) { in shrink_node()
2582 mem_cgroup_iter_break(root, memcg); in shrink_node()
2585 } while ((memcg = mem_cgroup_iter(root, memcg, &reclaim))); in shrink_node()
|
| D | slab.c | 3947 struct kmem_cache *root = memcg_root_cache(cachep); in enable_cpucache() local
3948 limit = root->limit; in enable_cpucache()
3949 shared = root->shared; in enable_cpucache()
3950 batchcount = root->batchcount; in enable_cpucache()
|
| D | memory.c | 2443 static inline void unmap_mapping_range_tree(struct rb_root *root, in unmap_mapping_range_tree() argument
2449 vma_interval_tree_foreach(vma, root, in unmap_mapping_range_tree()
|
| D | shmem.c | 3461 static int shmem_show_options(struct seq_file *seq, struct dentry *root) in shmem_show_options() argument
3463 struct shmem_sb_info *sbinfo = SHMEM_SB(root->d_sb); in shmem_show_options()
|
| D | Kconfig | 342 root has set /sys/kernel/mm/ksm/run to 1 (if CONFIG_SYSFS is set).
|