Searched refs:stable_node (Results 1 – 3 of 3) sorted by relevance
771 struct stable_node *stable_node; in remove_rmap_item_from_tree() local866 struct stable_node *stable_node) in set_page_stable_node() argument940 struct stable_node *stable_node, *next; in remove_all_stable_nodes() local1473 static struct stable_node *stable_node_dup_any(struct stable_node *stable_node, in stable_node_dup_any() argument1892 struct stable_node *orig = stable_node; in stable_tree_insert()1993 struct stable_node *stable_node, in stable_tree_append() argument2038 struct stable_node *stable_node; in cmp_and_merge_page() local2254 struct stable_node *stable_node, *next; in scan_get_next_rmap_item() local2604 struct stable_node *stable_node; in rmap_walk_ksm() local2669 struct stable_node *stable_node; in folio_migrate_ksm() local[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
18 struct stable_node;
Completed in 12 milliseconds