Searched refs:stable_node (Results 1 – 3 of 3) sorted by relevance
/linux/mm/ |
H A D | ksm.c | 591 static inline void free_stable_node(struct ksm_stable_node *stable_node) in free_stable_node() argument 593 VM_BUG_ON(stable_node->rmap_hlist_len && in free_stable_node() 594 !is_stable_node_chain(stable_node)); in free_stable_node() 595 kmem_cache_free(stable_node_cache, stable_node); in free_stable_node() 818 static void remove_node_from_stable_tree(struct ksm_stable_node *stable_node) in remove_node_from_stable_tree() argument 823 BUG_ON(stable_node->rmap_hlist_len < 0); in remove_node_from_stable_tree() 825 hlist_for_each_entry(rmap_item, &stable_node->hlist, hlist) { in remove_node_from_stable_tree() 828 trace_ksm_remove_rmap_item(stable_node->kpfn, rmap_item, rmap_item->mm); in remove_node_from_stable_tree() 835 VM_BUG_ON(stable_node->rmap_hlist_len <= 0); in remove_node_from_stable_tree() 836 stable_node->rmap_hlist_len--; in remove_node_from_stable_tree() [all …]
|
/linux/Documentation/mm/ |
H A D | ksm.rst | 51 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 D | ksm.rst | 70 涉及的函数(mm_slot ksm_scan stable_node rmap_item)。
|