Lines Matching full:stable
64 * Therefore KSM uses two data structures - the stable and the unstable tree.
66 * The stable tree holds pointers to all the merged pages (ksm pages), sorted
69 * and therefore this tree is called the stable tree.
71 * The stable tree node includes information required for reverse
75 * KSM maintains two types of nodes in the stable tree:
86 * In addition to the stable tree, KSM uses a second data structure called the
104 * 4) KSM never flushes the stable tree, which means that even if it were to
106 * it is secured in the stable tree. (When we scan a new page, we first
107 * compare it against the stable tree, and then against the unstable tree.)
110 * stable trees and multiple unstable trees: one of each for each NUMA node.
144 * struct stable_node - node of the stable rbtree
145 * @node: rb node of this ksm page in the stable tree
153 * @nid: NUMA node id of stable tree in which linked (may not match kpfn)
157 struct rb_node node; /* when node of stable tree */
186 * @anon_vma: pointer to anon_vma for this mm,address, when in stable tree
192 * @head: pointer to stable_node heading this list in the stable tree
198 struct anon_vma *anon_vma; /* when stable */
208 struct { /* when listed from stable tree */
217 #define STABLE_FLAG 0x200 /* is listed from the stable tree */
219 /* The stable and unstable tree heads */
225 /* Recently migrated nodes of stable tree, pending proper placement */
243 /* The number of nodes in the stable tree */
264 /* Maximum number of page slots sharing a stable node */
510 * than we're counting as nodes in the stable tree; but ksm_do_scan in break_ksm()
579 * stable and unstable pages from all nodes with roots in index 0. Otherwise,
580 * every node has its own stable and unstable tree.
602 * Put the stable node chain in the first dimension of in alloc_stable_node_chain()
603 * the stable tree and at the same time remove the old in alloc_stable_node_chain()
604 * stable node. in alloc_stable_node_chain()
609 * Move the old stable node to the second dimension in alloc_stable_node_chain()
671 * get_ksm_page: checks if the page indicated by the stable node
675 * remove the stale node from the stable tree and return NULL.
676 * But beware, the stable node's page might be being migrated.
682 * "keyhole reference": access to the ksm page from the stable node peeps
684 * pointing back to this stable node. This relies on freeing a PageAnon
765 * Removing rmap_item from stable or unstable tree.
766 * This function will clean the information from the stable/unstable tree.
826 * Though it's very tempting to unmerge rmap_items from stable tree rather
828 * that - an rmap_item is assigned to the stable tree after inserting ksm
891 * The stable node did not yet appear stale to get_ksm_page(), in remove_stable_node()
1004 /* Clean up stable nodes, but don't worry if some are still busy */ in unmerge_and_remove_all_rmap_items()
1209 * We need the page lock to read a stable PageSwapCache in in try_to_merge_one_page()
1287 /* Unstable nid is in union with stable anon_vma: remove first */ in try_to_merge_with_ksm_page()
1373 * stable nodes during lookup. in stable_node_dup()
1436 * otherwise left as a stable pointer, the in stable_node_dup()
1538 * stable_tree_search - search for page inside the stable tree
1540 * This function checks if there is a page inside the stable tree
1543 * This function returns the stable tree node of identical content if found,
1585 * stable rbtree and stable_node will be equal to in stable_tree_search()
1639 * into a stable node dup. If the mapcount is in stable_tree_search()
1712 * from the case there was no chain in the stable in stable_tree_search()
1763 * from the case there was no chain in the stable in stable_tree_search()
1790 * stable_tree_insert - insert stable tree node pointing to new ksm page
1791 * into the stable tree.
1793 * This function returns the stable tree node just allocated on success,
1984 * rmap_items hanging off a given node of the stable tree, all sharing
2020 * cmp_and_merge_page - first see if page can be merged into the stable tree;
2023 * both transferred to the stable tree.
2059 /* We first start with searching the page inside the stable tree */ in cmp_and_merge_page()
2076 * add its rmap_item to the stable tree. in cmp_and_merge_page()
2149 * node in the stable tree and add both rmap_items. in cmp_and_merge_page()
2162 * If we fail to insert the page into the stable tree, in cmp_and_merge_page()
2164 * to a ksm page left outside the stable tree, in cmp_and_merge_page()
2606 * to that page's node of the stable tree. in rmap_walk_ksm()
2628 /* Ignore the stable/unstable/sqnr flags */ in rmap_walk_ksm()
2777 * it is unsafe for them to touch the stable tree at this time. in ksm_memory_callback()
2951 * Allocate stable and unstable together: in merge_across_nodes_store()
2962 /* Stable tree is empty but not the unstable */ in merge_across_nodes_store()