Searched refs:stable_node (Results 1 – 3 of 3) sorted by relevance
402 static inline void free_stable_node(struct ksm_stable_node *stable_node) in free_stable_node() argument404 VM_BUG_ON(stable_node->rmap_hlist_len && in free_stable_node()405 !is_stable_node_chain(stable_node)); in free_stable_node()406 kmem_cache_free(stable_node_cache, stable_node); in free_stable_node()600 static void remove_node_from_stable_tree(struct ksm_stable_node *stable_node) in remove_node_from_stable_tree() argument605 BUG_ON(stable_node->rmap_hlist_len < 0); in remove_node_from_stable_tree()607 hlist_for_each_entry(rmap_item, &stable_node->hlist, hlist) { in remove_node_from_stable_tree()615 VM_BUG_ON(stable_node->rmap_hlist_len <= 0); in remove_node_from_stable_tree()616 stable_node->rmap_hlist_len--; in remove_node_from_stable_tree()632 if (stable_node->head == &migrate_nodes) in remove_node_from_stable_tree()[all …]
53 KSM pages. The ksmd walk over the stable_node "chains" is also O(N),54 but N is the number of stable_node "dups", not the number of56 practice the best stable_node "dup" candidate will be kept and found60 (because there will be fewer stable_node dups queued into the61 stable_node chain->hlist to check for pruning) and higher68 in the stable_node dups, which could be solved by introducing70 one stable_node dup to another stable_node dup, in order to free up71 stable_node "dups" with few rmap_items in them, but that may increase75 The whole list of stable_node "dups" linked in the stable_node83 :functions: mm_slot ksm_scan stable_node rmap_item
70 涉及的函数(mm_slot ksm_scan stable_node rmap_item)。
