Searched refs:stable_node (Results 1 – 3 of 3) sorted by relevance
853 list_del(&stable_node->list); in remove_node_from_stable_tree()1716 stable_node = NULL; in stable_node_dup()1989 if (!stable_node) in stable_tree_search()2080 if (!stable_node) { in stable_tree_insert()2233 if (stable_node) { in cmp_and_merge_page()2239 list_add(&stable_node->list, stable_node->head); in cmp_and_merge_page()2324 if (stable_node) { in cmp_and_merge_page()2338 if (!stable_node) { in cmp_and_merge_page()3018 if (!stable_node) in rmap_walk_ksm()3086 if (!stable_node) in collect_procs_ksm()[all …]
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 of54 practice the best stable_node "dup" candidate will be kept and found58 (because there will be fewer stable_node dups queued into the59 stable_node chain->hlist to check for pruning) and higher66 in the stable_node dups, which could be solved by introducing68 one stable_node dup to another stable_node dup, in order to free up69 stable_node "dups" with few rmap_items in them, but that may increase73 The whole list of stable_node "dups" linked in the stable_node81 :functions: mm_slot ksm_scan stable_node rmap_item
70 涉及的函数(mm_slot ksm_scan stable_node rmap_item)。