Home
last modified time | relevance | path

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

/linux/mm/
H A Dksm.c151 * @hlist_dup: linked into the stable_node->hlist with a stable_node chain
196 * @head: pointer to stable_node heading this list in the stable tree
197 * @hlist: link into hlist of rmap_items hanging off that stable_node
269 /* The number of stable_node chains */
272 /* The number of stable_node dups linked to the stable_node chains */
590 static inline void free_stable_node(struct ksm_stable_node *stable_node) in free_stable_node() argument
592 VM_BUG_ON(stable_node->rmap_hlist_len && in free_stable_node()
593 !is_stable_node_chain(stable_node)); in free_stable_node()
879 remove_node_from_stable_tree(struct ksm_stable_node * stable_node) remove_node_from_stable_tree() argument
946 ksm_get_folio(struct ksm_stable_node * stable_node,enum ksm_get_folio_flags flags) ksm_get_folio() argument
1029 struct ksm_stable_node *stable_node; remove_rmap_item_from_tree() local
1093 folio_set_stable_node(struct folio * folio,struct ksm_stable_node * stable_node) folio_set_stable_node() argument
1103 remove_stable_node(struct ksm_stable_node * stable_node) remove_stable_node() argument
1141 remove_stable_node_chain(struct ksm_stable_node * stable_node,struct rb_root * root) remove_stable_node_chain() argument
1168 struct ksm_stable_node *stable_node, *next; remove_all_stable_nodes() local
1640 __is_page_sharing_candidate(struct ksm_stable_node * stable_node,int offset) __is_page_sharing_candidate() argument
1654 is_page_sharing_candidate(struct ksm_stable_node * stable_node) is_page_sharing_candidate() argument
1664 struct ksm_stable_node *dup, *found = NULL, *stable_node = *_stable_node; stable_node_dup() local
1792 struct ksm_stable_node *stable_node = *_stable_node; __stable_node_chain() local
1831 struct ksm_stable_node *stable_node, *stable_node_dup; stable_tree_search() local
2046 struct ksm_stable_node *stable_node, *stable_node_dup; stable_tree_insert() local
2206 stable_tree_append(struct ksm_rmap_item * rmap_item,struct ksm_stable_node * stable_node,bool max_page_sharing_bypass) stable_tree_append() argument
2253 struct ksm_stable_node *stable_node; cmp_and_merge_page() local
2611 struct ksm_stable_node *stable_node, *next; scan_get_next_rmap_item() local
3154 struct ksm_stable_node *stable_node; rmap_walk_ksm() local
3229 struct ksm_stable_node *stable_node; collect_procs_ksm() local
3269 struct ksm_stable_node *stable_node; folio_migrate_ksm() local
3302 stable_node_dup_remove_range(struct ksm_stable_node * stable_node,unsigned long start_pfn,unsigned long end_pfn) stable_node_dup_remove_range() argument
3318 stable_node_chain_remove_range(struct ksm_stable_node * stable_node,unsigned long start_pfn,unsigned long end_pfn,struct rb_root * root) stable_node_chain_remove_range() argument
3347 struct ksm_stable_node *stable_node, *next; ksm_check_stable_tree() local
[all...]
/linux/Documentation/mm/
H A Dksm.rst51 KSM pages. The ksmd walk over the stable_node "chains" is also O(N),
52 but N is the number of stable_node "dups", not the number of
54 practice the best stable_node "dup" candidate will be kept and found
58 (because there will be fewer stable_node dups queued into the
59 stable_node chain->hlist to check for pruning) and higher
66 in the stable_node dups, which could be solved by introducing
68 one stable_node dup to another stable_node dup, in order to free up
69 stable_node "dups" with few rmap_items in them, but that may increase
73 The whole list of stable_node "dups" linked in the stable_node
81 :functions: mm_slot ksm_scan stable_node rmap_item
/linux/Documentation/translations/zh_CN/mm/
H A Dksm.rst70 涉及的函数(mm_slot ksm_scan stable_node rmap_item)。