1f8af4da3SHugh Dickins /* 231dbd01fSIzik Eidus * Memory merging support. 331dbd01fSIzik Eidus * 431dbd01fSIzik Eidus * This code enables dynamic sharing of identical pages found in different 531dbd01fSIzik Eidus * memory areas, even if they are not shared by fork() 631dbd01fSIzik Eidus * 736b2528dSIzik Eidus * Copyright (C) 2008-2009 Red Hat, Inc. 831dbd01fSIzik Eidus * Authors: 931dbd01fSIzik Eidus * Izik Eidus 1031dbd01fSIzik Eidus * Andrea Arcangeli 1131dbd01fSIzik Eidus * Chris Wright 1236b2528dSIzik Eidus * Hugh Dickins 1331dbd01fSIzik Eidus * 1431dbd01fSIzik Eidus * This work is licensed under the terms of the GNU GPL, version 2. 15f8af4da3SHugh Dickins */ 16f8af4da3SHugh Dickins 17f8af4da3SHugh Dickins #include <linux/errno.h> 1831dbd01fSIzik Eidus #include <linux/mm.h> 1931dbd01fSIzik Eidus #include <linux/fs.h> 20f8af4da3SHugh Dickins #include <linux/mman.h> 2131dbd01fSIzik Eidus #include <linux/sched.h> 226e84f315SIngo Molnar #include <linux/sched/mm.h> 23f7ccbae4SIngo Molnar #include <linux/sched/coredump.h> 2431dbd01fSIzik Eidus #include <linux/rwsem.h> 2531dbd01fSIzik Eidus #include <linux/pagemap.h> 2631dbd01fSIzik Eidus #include <linux/rmap.h> 2731dbd01fSIzik Eidus #include <linux/spinlock.h> 2831dbd01fSIzik Eidus #include <linux/jhash.h> 2931dbd01fSIzik Eidus #include <linux/delay.h> 3031dbd01fSIzik Eidus #include <linux/kthread.h> 3131dbd01fSIzik Eidus #include <linux/wait.h> 3231dbd01fSIzik Eidus #include <linux/slab.h> 3331dbd01fSIzik Eidus #include <linux/rbtree.h> 3462b61f61SHugh Dickins #include <linux/memory.h> 3531dbd01fSIzik Eidus #include <linux/mmu_notifier.h> 362c6854fdSIzik Eidus #include <linux/swap.h> 37f8af4da3SHugh Dickins #include <linux/ksm.h> 384ca3a69bSSasha Levin #include <linux/hashtable.h> 39878aee7dSAndrea Arcangeli #include <linux/freezer.h> 4072788c38SDavid Rientjes #include <linux/oom.h> 4190bd6fd3SPetr Holasek #include <linux/numa.h> 42f8af4da3SHugh Dickins 4331dbd01fSIzik Eidus #include <asm/tlbflush.h> 4473848b46SHugh Dickins #include "internal.h" 4531dbd01fSIzik Eidus 46e850dcf5SHugh Dickins #ifdef CONFIG_NUMA 47e850dcf5SHugh Dickins #define NUMA(x) (x) 48e850dcf5SHugh Dickins #define DO_NUMA(x) do { (x); } while (0) 49e850dcf5SHugh Dickins #else 50e850dcf5SHugh Dickins #define NUMA(x) (0) 51e850dcf5SHugh Dickins #define DO_NUMA(x) do { } while (0) 52e850dcf5SHugh Dickins #endif 53e850dcf5SHugh Dickins 5431dbd01fSIzik Eidus /* 5531dbd01fSIzik Eidus * A few notes about the KSM scanning process, 5631dbd01fSIzik Eidus * to make it easier to understand the data structures below: 5731dbd01fSIzik Eidus * 5831dbd01fSIzik Eidus * In order to reduce excessive scanning, KSM sorts the memory pages by their 5931dbd01fSIzik Eidus * contents into a data structure that holds pointers to the pages' locations. 6031dbd01fSIzik Eidus * 6131dbd01fSIzik Eidus * Since the contents of the pages may change at any moment, KSM cannot just 6231dbd01fSIzik Eidus * insert the pages into a normal sorted tree and expect it to find anything. 6331dbd01fSIzik Eidus * Therefore KSM uses two data structures - the stable and the unstable tree. 6431dbd01fSIzik Eidus * 6531dbd01fSIzik Eidus * The stable tree holds pointers to all the merged pages (ksm pages), sorted 6631dbd01fSIzik Eidus * by their contents. Because each such page is write-protected, searching on 6731dbd01fSIzik Eidus * this tree is fully assured to be working (except when pages are unmapped), 6831dbd01fSIzik Eidus * and therefore this tree is called the stable tree. 6931dbd01fSIzik Eidus * 7031dbd01fSIzik Eidus * In addition to the stable tree, KSM uses a second data structure called the 7131dbd01fSIzik Eidus * unstable tree: this tree holds pointers to pages which have been found to 7231dbd01fSIzik Eidus * be "unchanged for a period of time". The unstable tree sorts these pages 7331dbd01fSIzik Eidus * by their contents, but since they are not write-protected, KSM cannot rely 7431dbd01fSIzik Eidus * upon the unstable tree to work correctly - the unstable tree is liable to 7531dbd01fSIzik Eidus * be corrupted as its contents are modified, and so it is called unstable. 7631dbd01fSIzik Eidus * 7731dbd01fSIzik Eidus * KSM solves this problem by several techniques: 7831dbd01fSIzik Eidus * 7931dbd01fSIzik Eidus * 1) The unstable tree is flushed every time KSM completes scanning all 8031dbd01fSIzik Eidus * memory areas, and then the tree is rebuilt again from the beginning. 8131dbd01fSIzik Eidus * 2) KSM will only insert into the unstable tree, pages whose hash value 8231dbd01fSIzik Eidus * has not changed since the previous scan of all memory areas. 8331dbd01fSIzik Eidus * 3) The unstable tree is a RedBlack Tree - so its balancing is based on the 8431dbd01fSIzik Eidus * colors of the nodes and not on their contents, assuring that even when 8531dbd01fSIzik Eidus * the tree gets "corrupted" it won't get out of balance, so scanning time 8631dbd01fSIzik Eidus * remains the same (also, searching and inserting nodes in an rbtree uses 8731dbd01fSIzik Eidus * the same algorithm, so we have no overhead when we flush and rebuild). 8831dbd01fSIzik Eidus * 4) KSM never flushes the stable tree, which means that even if it were to 8931dbd01fSIzik Eidus * take 10 attempts to find a page in the unstable tree, once it is found, 9031dbd01fSIzik Eidus * it is secured in the stable tree. (When we scan a new page, we first 9131dbd01fSIzik Eidus * compare it against the stable tree, and then against the unstable tree.) 928fdb3dbfSHugh Dickins * 938fdb3dbfSHugh Dickins * If the merge_across_nodes tunable is unset, then KSM maintains multiple 948fdb3dbfSHugh Dickins * stable trees and multiple unstable trees: one of each for each NUMA node. 9531dbd01fSIzik Eidus */ 9631dbd01fSIzik Eidus 9731dbd01fSIzik Eidus /** 9831dbd01fSIzik Eidus * struct mm_slot - ksm information per mm that is being scanned 9931dbd01fSIzik Eidus * @link: link to the mm_slots hash list 10031dbd01fSIzik Eidus * @mm_list: link into the mm_slots list, rooted in ksm_mm_head 1016514d511SHugh Dickins * @rmap_list: head for this mm_slot's singly-linked list of rmap_items 10231dbd01fSIzik Eidus * @mm: the mm that this information is valid for 10331dbd01fSIzik Eidus */ 10431dbd01fSIzik Eidus struct mm_slot { 10531dbd01fSIzik Eidus struct hlist_node link; 10631dbd01fSIzik Eidus struct list_head mm_list; 1076514d511SHugh Dickins struct rmap_item *rmap_list; 10831dbd01fSIzik Eidus struct mm_struct *mm; 10931dbd01fSIzik Eidus }; 11031dbd01fSIzik Eidus 11131dbd01fSIzik Eidus /** 11231dbd01fSIzik Eidus * struct ksm_scan - cursor for scanning 11331dbd01fSIzik Eidus * @mm_slot: the current mm_slot we are scanning 11431dbd01fSIzik Eidus * @address: the next address inside that to be scanned 1156514d511SHugh Dickins * @rmap_list: link to the next rmap to be scanned in the rmap_list 11631dbd01fSIzik Eidus * @seqnr: count of completed full scans (needed when removing unstable node) 11731dbd01fSIzik Eidus * 11831dbd01fSIzik Eidus * There is only the one ksm_scan instance of this cursor structure. 11931dbd01fSIzik Eidus */ 12031dbd01fSIzik Eidus struct ksm_scan { 12131dbd01fSIzik Eidus struct mm_slot *mm_slot; 12231dbd01fSIzik Eidus unsigned long address; 1236514d511SHugh Dickins struct rmap_item **rmap_list; 12431dbd01fSIzik Eidus unsigned long seqnr; 12531dbd01fSIzik Eidus }; 12631dbd01fSIzik Eidus 12731dbd01fSIzik Eidus /** 1287b6ba2c7SHugh Dickins * struct stable_node - node of the stable rbtree 1297b6ba2c7SHugh Dickins * @node: rb node of this ksm page in the stable tree 1304146d2d6SHugh Dickins * @head: (overlaying parent) &migrate_nodes indicates temporarily on that list 1312c653d0eSAndrea Arcangeli * @hlist_dup: linked into the stable_node->hlist with a stable_node chain 1324146d2d6SHugh Dickins * @list: linked into migrate_nodes, pending placement in the proper node tree 1337b6ba2c7SHugh Dickins * @hlist: hlist head of rmap_items using this ksm page 1344146d2d6SHugh Dickins * @kpfn: page frame number of this ksm page (perhaps temporarily on wrong nid) 1352c653d0eSAndrea Arcangeli * @chain_prune_time: time of the last full garbage collection 1362c653d0eSAndrea Arcangeli * @rmap_hlist_len: number of rmap_item entries in hlist or STABLE_NODE_CHAIN 1374146d2d6SHugh Dickins * @nid: NUMA node id of stable tree in which linked (may not match kpfn) 1387b6ba2c7SHugh Dickins */ 1397b6ba2c7SHugh Dickins struct stable_node { 1404146d2d6SHugh Dickins union { 1414146d2d6SHugh Dickins struct rb_node node; /* when node of stable tree */ 1424146d2d6SHugh Dickins struct { /* when listed for migration */ 1434146d2d6SHugh Dickins struct list_head *head; 1442c653d0eSAndrea Arcangeli struct { 1452c653d0eSAndrea Arcangeli struct hlist_node hlist_dup; 1464146d2d6SHugh Dickins struct list_head list; 1474146d2d6SHugh Dickins }; 1484146d2d6SHugh Dickins }; 1492c653d0eSAndrea Arcangeli }; 1507b6ba2c7SHugh Dickins struct hlist_head hlist; 1512c653d0eSAndrea Arcangeli union { 15262b61f61SHugh Dickins unsigned long kpfn; 1532c653d0eSAndrea Arcangeli unsigned long chain_prune_time; 1542c653d0eSAndrea Arcangeli }; 1552c653d0eSAndrea Arcangeli /* 1562c653d0eSAndrea Arcangeli * STABLE_NODE_CHAIN can be any negative number in 1572c653d0eSAndrea Arcangeli * rmap_hlist_len negative range, but better not -1 to be able 1582c653d0eSAndrea Arcangeli * to reliably detect underflows. 1592c653d0eSAndrea Arcangeli */ 1602c653d0eSAndrea Arcangeli #define STABLE_NODE_CHAIN -1024 1612c653d0eSAndrea Arcangeli int rmap_hlist_len; 1624146d2d6SHugh Dickins #ifdef CONFIG_NUMA 1634146d2d6SHugh Dickins int nid; 1644146d2d6SHugh Dickins #endif 1657b6ba2c7SHugh Dickins }; 1667b6ba2c7SHugh Dickins 1677b6ba2c7SHugh Dickins /** 16831dbd01fSIzik Eidus * struct rmap_item - reverse mapping item for virtual addresses 1696514d511SHugh Dickins * @rmap_list: next rmap_item in mm_slot's singly-linked rmap_list 170db114b83SHugh Dickins * @anon_vma: pointer to anon_vma for this mm,address, when in stable tree 171bc56620bSHugh Dickins * @nid: NUMA node id of unstable tree in which linked (may not match page) 17231dbd01fSIzik Eidus * @mm: the memory structure this rmap_item is pointing into 17331dbd01fSIzik Eidus * @address: the virtual address this rmap_item tracks (+ flags in low bits) 17431dbd01fSIzik Eidus * @oldchecksum: previous checksum of the page at that virtual address 1757b6ba2c7SHugh Dickins * @node: rb node of this rmap_item in the unstable tree 1767b6ba2c7SHugh Dickins * @head: pointer to stable_node heading this list in the stable tree 1777b6ba2c7SHugh Dickins * @hlist: link into hlist of rmap_items hanging off that stable_node 17831dbd01fSIzik Eidus */ 17931dbd01fSIzik Eidus struct rmap_item { 1806514d511SHugh Dickins struct rmap_item *rmap_list; 181bc56620bSHugh Dickins union { 182db114b83SHugh Dickins struct anon_vma *anon_vma; /* when stable */ 183bc56620bSHugh Dickins #ifdef CONFIG_NUMA 184bc56620bSHugh Dickins int nid; /* when node of unstable tree */ 185bc56620bSHugh Dickins #endif 186bc56620bSHugh Dickins }; 18731dbd01fSIzik Eidus struct mm_struct *mm; 18831dbd01fSIzik Eidus unsigned long address; /* + low bits used for flags below */ 18931dbd01fSIzik Eidus unsigned int oldchecksum; /* when unstable */ 19031dbd01fSIzik Eidus union { 1917b6ba2c7SHugh Dickins struct rb_node node; /* when node of unstable tree */ 1927b6ba2c7SHugh Dickins struct { /* when listed from stable tree */ 1937b6ba2c7SHugh Dickins struct stable_node *head; 1947b6ba2c7SHugh Dickins struct hlist_node hlist; 1957b6ba2c7SHugh Dickins }; 19631dbd01fSIzik Eidus }; 19731dbd01fSIzik Eidus }; 19831dbd01fSIzik Eidus 19931dbd01fSIzik Eidus #define SEQNR_MASK 0x0ff /* low bits of unstable tree seqnr */ 2007b6ba2c7SHugh Dickins #define UNSTABLE_FLAG 0x100 /* is a node of the unstable tree */ 2017b6ba2c7SHugh Dickins #define STABLE_FLAG 0x200 /* is listed from the stable tree */ 20231dbd01fSIzik Eidus 20331dbd01fSIzik Eidus /* The stable and unstable tree heads */ 204ef53d16cSHugh Dickins static struct rb_root one_stable_tree[1] = { RB_ROOT }; 205ef53d16cSHugh Dickins static struct rb_root one_unstable_tree[1] = { RB_ROOT }; 206ef53d16cSHugh Dickins static struct rb_root *root_stable_tree = one_stable_tree; 207ef53d16cSHugh Dickins static struct rb_root *root_unstable_tree = one_unstable_tree; 20831dbd01fSIzik Eidus 2094146d2d6SHugh Dickins /* Recently migrated nodes of stable tree, pending proper placement */ 2104146d2d6SHugh Dickins static LIST_HEAD(migrate_nodes); 2112c653d0eSAndrea Arcangeli #define STABLE_NODE_DUP_HEAD ((struct list_head *)&migrate_nodes.prev) 2124146d2d6SHugh Dickins 2134ca3a69bSSasha Levin #define MM_SLOTS_HASH_BITS 10 2144ca3a69bSSasha Levin static DEFINE_HASHTABLE(mm_slots_hash, MM_SLOTS_HASH_BITS); 21531dbd01fSIzik Eidus 21631dbd01fSIzik Eidus static struct mm_slot ksm_mm_head = { 21731dbd01fSIzik Eidus .mm_list = LIST_HEAD_INIT(ksm_mm_head.mm_list), 21831dbd01fSIzik Eidus }; 21931dbd01fSIzik Eidus static struct ksm_scan ksm_scan = { 22031dbd01fSIzik Eidus .mm_slot = &ksm_mm_head, 22131dbd01fSIzik Eidus }; 22231dbd01fSIzik Eidus 22331dbd01fSIzik Eidus static struct kmem_cache *rmap_item_cache; 2247b6ba2c7SHugh Dickins static struct kmem_cache *stable_node_cache; 22531dbd01fSIzik Eidus static struct kmem_cache *mm_slot_cache; 22631dbd01fSIzik Eidus 22731dbd01fSIzik Eidus /* The number of nodes in the stable tree */ 228b4028260SHugh Dickins static unsigned long ksm_pages_shared; 22931dbd01fSIzik Eidus 230e178dfdeSHugh Dickins /* The number of page slots additionally sharing those nodes */ 231b4028260SHugh Dickins static unsigned long ksm_pages_sharing; 23231dbd01fSIzik Eidus 233473b0ce4SHugh Dickins /* The number of nodes in the unstable tree */ 234473b0ce4SHugh Dickins static unsigned long ksm_pages_unshared; 235473b0ce4SHugh Dickins 236473b0ce4SHugh Dickins /* The number of rmap_items in use: to calculate pages_volatile */ 237473b0ce4SHugh Dickins static unsigned long ksm_rmap_items; 238473b0ce4SHugh Dickins 2392c653d0eSAndrea Arcangeli /* The number of stable_node chains */ 2402c653d0eSAndrea Arcangeli static unsigned long ksm_stable_node_chains; 2412c653d0eSAndrea Arcangeli 2422c653d0eSAndrea Arcangeli /* The number of stable_node dups linked to the stable_node chains */ 2432c653d0eSAndrea Arcangeli static unsigned long ksm_stable_node_dups; 2442c653d0eSAndrea Arcangeli 2452c653d0eSAndrea Arcangeli /* Delay in pruning stale stable_node_dups in the stable_node_chains */ 2462c653d0eSAndrea Arcangeli static int ksm_stable_node_chains_prune_millisecs = 2000; 2472c653d0eSAndrea Arcangeli 2482c653d0eSAndrea Arcangeli /* Maximum number of page slots sharing a stable node */ 2492c653d0eSAndrea Arcangeli static int ksm_max_page_sharing = 256; 2502c653d0eSAndrea Arcangeli 25131dbd01fSIzik Eidus /* Number of pages ksmd should scan in one batch */ 2522c6854fdSIzik Eidus static unsigned int ksm_thread_pages_to_scan = 100; 25331dbd01fSIzik Eidus 25431dbd01fSIzik Eidus /* Milliseconds ksmd should sleep between batches */ 2552ffd8679SHugh Dickins static unsigned int ksm_thread_sleep_millisecs = 20; 25631dbd01fSIzik Eidus 257e86c59b1SClaudio Imbrenda /* Checksum of an empty (zeroed) page */ 258e86c59b1SClaudio Imbrenda static unsigned int zero_checksum __read_mostly; 259e86c59b1SClaudio Imbrenda 260e86c59b1SClaudio Imbrenda /* Whether to merge empty (zeroed) pages with actual zero pages */ 261e86c59b1SClaudio Imbrenda static bool ksm_use_zero_pages __read_mostly; 262e86c59b1SClaudio Imbrenda 263e850dcf5SHugh Dickins #ifdef CONFIG_NUMA 26490bd6fd3SPetr Holasek /* Zeroed when merging across nodes is not allowed */ 26590bd6fd3SPetr Holasek static unsigned int ksm_merge_across_nodes = 1; 266ef53d16cSHugh Dickins static int ksm_nr_node_ids = 1; 267e850dcf5SHugh Dickins #else 268e850dcf5SHugh Dickins #define ksm_merge_across_nodes 1U 269ef53d16cSHugh Dickins #define ksm_nr_node_ids 1 270e850dcf5SHugh Dickins #endif 27190bd6fd3SPetr Holasek 27231dbd01fSIzik Eidus #define KSM_RUN_STOP 0 27331dbd01fSIzik Eidus #define KSM_RUN_MERGE 1 27431dbd01fSIzik Eidus #define KSM_RUN_UNMERGE 2 275ef4d43a8SHugh Dickins #define KSM_RUN_OFFLINE 4 276ef4d43a8SHugh Dickins static unsigned long ksm_run = KSM_RUN_STOP; 277ef4d43a8SHugh Dickins static void wait_while_offlining(void); 27831dbd01fSIzik Eidus 27931dbd01fSIzik Eidus static DECLARE_WAIT_QUEUE_HEAD(ksm_thread_wait); 28031dbd01fSIzik Eidus static DEFINE_MUTEX(ksm_thread_mutex); 28131dbd01fSIzik Eidus static DEFINE_SPINLOCK(ksm_mmlist_lock); 28231dbd01fSIzik Eidus 28331dbd01fSIzik Eidus #define KSM_KMEM_CACHE(__struct, __flags) kmem_cache_create("ksm_"#__struct,\ 28431dbd01fSIzik Eidus sizeof(struct __struct), __alignof__(struct __struct),\ 28531dbd01fSIzik Eidus (__flags), NULL) 28631dbd01fSIzik Eidus 28731dbd01fSIzik Eidus static int __init ksm_slab_init(void) 28831dbd01fSIzik Eidus { 28931dbd01fSIzik Eidus rmap_item_cache = KSM_KMEM_CACHE(rmap_item, 0); 29031dbd01fSIzik Eidus if (!rmap_item_cache) 29131dbd01fSIzik Eidus goto out; 29231dbd01fSIzik Eidus 2937b6ba2c7SHugh Dickins stable_node_cache = KSM_KMEM_CACHE(stable_node, 0); 2947b6ba2c7SHugh Dickins if (!stable_node_cache) 2957b6ba2c7SHugh Dickins goto out_free1; 2967b6ba2c7SHugh Dickins 29731dbd01fSIzik Eidus mm_slot_cache = KSM_KMEM_CACHE(mm_slot, 0); 29831dbd01fSIzik Eidus if (!mm_slot_cache) 2997b6ba2c7SHugh Dickins goto out_free2; 30031dbd01fSIzik Eidus 30131dbd01fSIzik Eidus return 0; 30231dbd01fSIzik Eidus 3037b6ba2c7SHugh Dickins out_free2: 3047b6ba2c7SHugh Dickins kmem_cache_destroy(stable_node_cache); 3057b6ba2c7SHugh Dickins out_free1: 30631dbd01fSIzik Eidus kmem_cache_destroy(rmap_item_cache); 30731dbd01fSIzik Eidus out: 30831dbd01fSIzik Eidus return -ENOMEM; 30931dbd01fSIzik Eidus } 31031dbd01fSIzik Eidus 31131dbd01fSIzik Eidus static void __init ksm_slab_free(void) 31231dbd01fSIzik Eidus { 31331dbd01fSIzik Eidus kmem_cache_destroy(mm_slot_cache); 3147b6ba2c7SHugh Dickins kmem_cache_destroy(stable_node_cache); 31531dbd01fSIzik Eidus kmem_cache_destroy(rmap_item_cache); 31631dbd01fSIzik Eidus mm_slot_cache = NULL; 31731dbd01fSIzik Eidus } 31831dbd01fSIzik Eidus 3192c653d0eSAndrea Arcangeli static __always_inline bool is_stable_node_chain(struct stable_node *chain) 3202c653d0eSAndrea Arcangeli { 3212c653d0eSAndrea Arcangeli return chain->rmap_hlist_len == STABLE_NODE_CHAIN; 3222c653d0eSAndrea Arcangeli } 3232c653d0eSAndrea Arcangeli 3242c653d0eSAndrea Arcangeli static __always_inline bool is_stable_node_dup(struct stable_node *dup) 3252c653d0eSAndrea Arcangeli { 3262c653d0eSAndrea Arcangeli return dup->head == STABLE_NODE_DUP_HEAD; 3272c653d0eSAndrea Arcangeli } 3282c653d0eSAndrea Arcangeli 3292c653d0eSAndrea Arcangeli static inline void stable_node_chain_add_dup(struct stable_node *dup, 3302c653d0eSAndrea Arcangeli struct stable_node *chain) 3312c653d0eSAndrea Arcangeli { 3322c653d0eSAndrea Arcangeli VM_BUG_ON(is_stable_node_dup(dup)); 3332c653d0eSAndrea Arcangeli dup->head = STABLE_NODE_DUP_HEAD; 3342c653d0eSAndrea Arcangeli VM_BUG_ON(!is_stable_node_chain(chain)); 3352c653d0eSAndrea Arcangeli hlist_add_head(&dup->hlist_dup, &chain->hlist); 3362c653d0eSAndrea Arcangeli ksm_stable_node_dups++; 3372c653d0eSAndrea Arcangeli } 3382c653d0eSAndrea Arcangeli 3392c653d0eSAndrea Arcangeli static inline void __stable_node_dup_del(struct stable_node *dup) 3402c653d0eSAndrea Arcangeli { 341b4fecc67SAndrea Arcangeli VM_BUG_ON(!is_stable_node_dup(dup)); 3422c653d0eSAndrea Arcangeli hlist_del(&dup->hlist_dup); 3432c653d0eSAndrea Arcangeli ksm_stable_node_dups--; 3442c653d0eSAndrea Arcangeli } 3452c653d0eSAndrea Arcangeli 3462c653d0eSAndrea Arcangeli static inline void stable_node_dup_del(struct stable_node *dup) 3472c653d0eSAndrea Arcangeli { 3482c653d0eSAndrea Arcangeli VM_BUG_ON(is_stable_node_chain(dup)); 3492c653d0eSAndrea Arcangeli if (is_stable_node_dup(dup)) 3502c653d0eSAndrea Arcangeli __stable_node_dup_del(dup); 3512c653d0eSAndrea Arcangeli else 3522c653d0eSAndrea Arcangeli rb_erase(&dup->node, root_stable_tree + NUMA(dup->nid)); 3532c653d0eSAndrea Arcangeli #ifdef CONFIG_DEBUG_VM 3542c653d0eSAndrea Arcangeli dup->head = NULL; 3552c653d0eSAndrea Arcangeli #endif 3562c653d0eSAndrea Arcangeli } 3572c653d0eSAndrea Arcangeli 35831dbd01fSIzik Eidus static inline struct rmap_item *alloc_rmap_item(void) 35931dbd01fSIzik Eidus { 360473b0ce4SHugh Dickins struct rmap_item *rmap_item; 361473b0ce4SHugh Dickins 3625b398e41Szhong jiang rmap_item = kmem_cache_zalloc(rmap_item_cache, GFP_KERNEL | 3635b398e41Szhong jiang __GFP_NORETRY | __GFP_NOWARN); 364473b0ce4SHugh Dickins if (rmap_item) 365473b0ce4SHugh Dickins ksm_rmap_items++; 366473b0ce4SHugh Dickins return rmap_item; 36731dbd01fSIzik Eidus } 36831dbd01fSIzik Eidus 36931dbd01fSIzik Eidus static inline void free_rmap_item(struct rmap_item *rmap_item) 37031dbd01fSIzik Eidus { 371473b0ce4SHugh Dickins ksm_rmap_items--; 37231dbd01fSIzik Eidus rmap_item->mm = NULL; /* debug safety */ 37331dbd01fSIzik Eidus kmem_cache_free(rmap_item_cache, rmap_item); 37431dbd01fSIzik Eidus } 37531dbd01fSIzik Eidus 3767b6ba2c7SHugh Dickins static inline struct stable_node *alloc_stable_node(void) 3777b6ba2c7SHugh Dickins { 3786213055fSzhong jiang /* 3796213055fSzhong jiang * The allocation can take too long with GFP_KERNEL when memory is under 3806213055fSzhong jiang * pressure, which may lead to hung task warnings. Adding __GFP_HIGH 3816213055fSzhong jiang * grants access to memory reserves, helping to avoid this problem. 3826213055fSzhong jiang */ 3836213055fSzhong jiang return kmem_cache_alloc(stable_node_cache, GFP_KERNEL | __GFP_HIGH); 3847b6ba2c7SHugh Dickins } 3857b6ba2c7SHugh Dickins 3867b6ba2c7SHugh Dickins static inline void free_stable_node(struct stable_node *stable_node) 3877b6ba2c7SHugh Dickins { 3882c653d0eSAndrea Arcangeli VM_BUG_ON(stable_node->rmap_hlist_len && 3892c653d0eSAndrea Arcangeli !is_stable_node_chain(stable_node)); 3907b6ba2c7SHugh Dickins kmem_cache_free(stable_node_cache, stable_node); 3917b6ba2c7SHugh Dickins } 3927b6ba2c7SHugh Dickins 39331dbd01fSIzik Eidus static inline struct mm_slot *alloc_mm_slot(void) 39431dbd01fSIzik Eidus { 39531dbd01fSIzik Eidus if (!mm_slot_cache) /* initialization failed */ 39631dbd01fSIzik Eidus return NULL; 39731dbd01fSIzik Eidus return kmem_cache_zalloc(mm_slot_cache, GFP_KERNEL); 39831dbd01fSIzik Eidus } 39931dbd01fSIzik Eidus 40031dbd01fSIzik Eidus static inline void free_mm_slot(struct mm_slot *mm_slot) 40131dbd01fSIzik Eidus { 40231dbd01fSIzik Eidus kmem_cache_free(mm_slot_cache, mm_slot); 40331dbd01fSIzik Eidus } 40431dbd01fSIzik Eidus 40531dbd01fSIzik Eidus static struct mm_slot *get_mm_slot(struct mm_struct *mm) 40631dbd01fSIzik Eidus { 4074ca3a69bSSasha Levin struct mm_slot *slot; 40831dbd01fSIzik Eidus 409b67bfe0dSSasha Levin hash_for_each_possible(mm_slots_hash, slot, link, (unsigned long)mm) 4104ca3a69bSSasha Levin if (slot->mm == mm) 4114ca3a69bSSasha Levin return slot; 4124ca3a69bSSasha Levin 41331dbd01fSIzik Eidus return NULL; 41431dbd01fSIzik Eidus } 41531dbd01fSIzik Eidus 41631dbd01fSIzik Eidus static void insert_to_mm_slots_hash(struct mm_struct *mm, 41731dbd01fSIzik Eidus struct mm_slot *mm_slot) 41831dbd01fSIzik Eidus { 41931dbd01fSIzik Eidus mm_slot->mm = mm; 4204ca3a69bSSasha Levin hash_add(mm_slots_hash, &mm_slot->link, (unsigned long)mm); 42131dbd01fSIzik Eidus } 42231dbd01fSIzik Eidus 42331dbd01fSIzik Eidus /* 424a913e182SHugh Dickins * ksmd, and unmerge_and_remove_all_rmap_items(), must not touch an mm's 425a913e182SHugh Dickins * page tables after it has passed through ksm_exit() - which, if necessary, 426a913e182SHugh Dickins * takes mmap_sem briefly to serialize against them. ksm_exit() does not set 427a913e182SHugh Dickins * a special flag: they can just back out as soon as mm_users goes to zero. 428a913e182SHugh Dickins * ksm_test_exit() is used throughout to make this test for exit: in some 429a913e182SHugh Dickins * places for correctness, in some places just to avoid unnecessary work. 430a913e182SHugh Dickins */ 431a913e182SHugh Dickins static inline bool ksm_test_exit(struct mm_struct *mm) 432a913e182SHugh Dickins { 433a913e182SHugh Dickins return atomic_read(&mm->mm_users) == 0; 434a913e182SHugh Dickins } 435a913e182SHugh Dickins 436a913e182SHugh Dickins /* 43731dbd01fSIzik Eidus * We use break_ksm to break COW on a ksm page: it's a stripped down 43831dbd01fSIzik Eidus * 439d4edcf0dSDave Hansen * if (get_user_pages(addr, 1, 1, 1, &page, NULL) == 1) 44031dbd01fSIzik Eidus * put_page(page); 44131dbd01fSIzik Eidus * 44231dbd01fSIzik Eidus * but taking great care only to touch a ksm page, in a VM_MERGEABLE vma, 44331dbd01fSIzik Eidus * in case the application has unmapped and remapped mm,addr meanwhile. 44431dbd01fSIzik Eidus * Could a ksm page appear anywhere else? Actually yes, in a VM_PFNMAP 44531dbd01fSIzik Eidus * mmap of /dev/mem or /dev/kmem, where we would not want to touch it. 4461b2ee126SDave Hansen * 4471b2ee126SDave Hansen * FAULT_FLAG/FOLL_REMOTE are because we do this outside the context 4481b2ee126SDave Hansen * of the process that owns 'vma'. We also do not want to enforce 4491b2ee126SDave Hansen * protection keys here anyway. 45031dbd01fSIzik Eidus */ 451d952b791SHugh Dickins static int break_ksm(struct vm_area_struct *vma, unsigned long addr) 45231dbd01fSIzik Eidus { 45331dbd01fSIzik Eidus struct page *page; 454d952b791SHugh Dickins int ret = 0; 45531dbd01fSIzik Eidus 45631dbd01fSIzik Eidus do { 45731dbd01fSIzik Eidus cond_resched(); 4581b2ee126SDave Hansen page = follow_page(vma, addr, 4591b2ee126SDave Hansen FOLL_GET | FOLL_MIGRATION | FOLL_REMOTE); 46022eccdd7SDan Carpenter if (IS_ERR_OR_NULL(page)) 46131dbd01fSIzik Eidus break; 46231dbd01fSIzik Eidus if (PageKsm(page)) 463dcddffd4SKirill A. Shutemov ret = handle_mm_fault(vma, addr, 464dcddffd4SKirill A. Shutemov FAULT_FLAG_WRITE | FAULT_FLAG_REMOTE); 46531dbd01fSIzik Eidus else 46631dbd01fSIzik Eidus ret = VM_FAULT_WRITE; 46731dbd01fSIzik Eidus put_page(page); 46833692f27SLinus Torvalds } while (!(ret & (VM_FAULT_WRITE | VM_FAULT_SIGBUS | VM_FAULT_SIGSEGV | VM_FAULT_OOM))); 469d952b791SHugh Dickins /* 470d952b791SHugh Dickins * We must loop because handle_mm_fault() may back out if there's 471d952b791SHugh Dickins * any difficulty e.g. if pte accessed bit gets updated concurrently. 472d952b791SHugh Dickins * 473d952b791SHugh Dickins * VM_FAULT_WRITE is what we have been hoping for: it indicates that 474d952b791SHugh Dickins * COW has been broken, even if the vma does not permit VM_WRITE; 475d952b791SHugh Dickins * but note that a concurrent fault might break PageKsm for us. 476d952b791SHugh Dickins * 477d952b791SHugh Dickins * VM_FAULT_SIGBUS could occur if we race with truncation of the 478d952b791SHugh Dickins * backing file, which also invalidates anonymous pages: that's 479d952b791SHugh Dickins * okay, that truncation will have unmapped the PageKsm for us. 480d952b791SHugh Dickins * 481d952b791SHugh Dickins * VM_FAULT_OOM: at the time of writing (late July 2009), setting 482d952b791SHugh Dickins * aside mem_cgroup limits, VM_FAULT_OOM would only be set if the 483d952b791SHugh Dickins * current task has TIF_MEMDIE set, and will be OOM killed on return 484d952b791SHugh Dickins * to user; and ksmd, having no mm, would never be chosen for that. 485d952b791SHugh Dickins * 486d952b791SHugh Dickins * But if the mm is in a limited mem_cgroup, then the fault may fail 487d952b791SHugh Dickins * with VM_FAULT_OOM even if the current task is not TIF_MEMDIE; and 488d952b791SHugh Dickins * even ksmd can fail in this way - though it's usually breaking ksm 489d952b791SHugh Dickins * just to undo a merge it made a moment before, so unlikely to oom. 490d952b791SHugh Dickins * 491d952b791SHugh Dickins * That's a pity: we might therefore have more kernel pages allocated 492d952b791SHugh Dickins * than we're counting as nodes in the stable tree; but ksm_do_scan 493d952b791SHugh Dickins * will retry to break_cow on each pass, so should recover the page 494d952b791SHugh Dickins * in due course. The important thing is to not let VM_MERGEABLE 495d952b791SHugh Dickins * be cleared while any such pages might remain in the area. 496d952b791SHugh Dickins */ 497d952b791SHugh Dickins return (ret & VM_FAULT_OOM) ? -ENOMEM : 0; 49831dbd01fSIzik Eidus } 49931dbd01fSIzik Eidus 500ef694222SBob Liu static struct vm_area_struct *find_mergeable_vma(struct mm_struct *mm, 501ef694222SBob Liu unsigned long addr) 502ef694222SBob Liu { 503ef694222SBob Liu struct vm_area_struct *vma; 504ef694222SBob Liu if (ksm_test_exit(mm)) 505ef694222SBob Liu return NULL; 506ef694222SBob Liu vma = find_vma(mm, addr); 507ef694222SBob Liu if (!vma || vma->vm_start > addr) 508ef694222SBob Liu return NULL; 509ef694222SBob Liu if (!(vma->vm_flags & VM_MERGEABLE) || !vma->anon_vma) 510ef694222SBob Liu return NULL; 511ef694222SBob Liu return vma; 512ef694222SBob Liu } 513ef694222SBob Liu 5148dd3557aSHugh Dickins static void break_cow(struct rmap_item *rmap_item) 51531dbd01fSIzik Eidus { 5168dd3557aSHugh Dickins struct mm_struct *mm = rmap_item->mm; 5178dd3557aSHugh Dickins unsigned long addr = rmap_item->address; 51831dbd01fSIzik Eidus struct vm_area_struct *vma; 51931dbd01fSIzik Eidus 5204035c07aSHugh Dickins /* 5214035c07aSHugh Dickins * It is not an accident that whenever we want to break COW 5224035c07aSHugh Dickins * to undo, we also need to drop a reference to the anon_vma. 5234035c07aSHugh Dickins */ 5249e60109fSPeter Zijlstra put_anon_vma(rmap_item->anon_vma); 5254035c07aSHugh Dickins 52681464e30SHugh Dickins down_read(&mm->mmap_sem); 527ef694222SBob Liu vma = find_mergeable_vma(mm, addr); 528ef694222SBob Liu if (vma) 52931dbd01fSIzik Eidus break_ksm(vma, addr); 53031dbd01fSIzik Eidus up_read(&mm->mmap_sem); 53131dbd01fSIzik Eidus } 53231dbd01fSIzik Eidus 53331dbd01fSIzik Eidus static struct page *get_mergeable_page(struct rmap_item *rmap_item) 53431dbd01fSIzik Eidus { 53531dbd01fSIzik Eidus struct mm_struct *mm = rmap_item->mm; 53631dbd01fSIzik Eidus unsigned long addr = rmap_item->address; 53731dbd01fSIzik Eidus struct vm_area_struct *vma; 53831dbd01fSIzik Eidus struct page *page; 53931dbd01fSIzik Eidus 54031dbd01fSIzik Eidus down_read(&mm->mmap_sem); 541ef694222SBob Liu vma = find_mergeable_vma(mm, addr); 542ef694222SBob Liu if (!vma) 54331dbd01fSIzik Eidus goto out; 54431dbd01fSIzik Eidus 54531dbd01fSIzik Eidus page = follow_page(vma, addr, FOLL_GET); 54622eccdd7SDan Carpenter if (IS_ERR_OR_NULL(page)) 54731dbd01fSIzik Eidus goto out; 548f765f540SKirill A. Shutemov if (PageAnon(page)) { 54931dbd01fSIzik Eidus flush_anon_page(vma, page, addr); 55031dbd01fSIzik Eidus flush_dcache_page(page); 55131dbd01fSIzik Eidus } else { 55231dbd01fSIzik Eidus put_page(page); 553c8f95ed1SAndrea Arcangeli out: 554c8f95ed1SAndrea Arcangeli page = NULL; 55531dbd01fSIzik Eidus } 55631dbd01fSIzik Eidus up_read(&mm->mmap_sem); 55731dbd01fSIzik Eidus return page; 55831dbd01fSIzik Eidus } 55931dbd01fSIzik Eidus 56090bd6fd3SPetr Holasek /* 56190bd6fd3SPetr Holasek * This helper is used for getting right index into array of tree roots. 56290bd6fd3SPetr Holasek * When merge_across_nodes knob is set to 1, there are only two rb-trees for 56390bd6fd3SPetr Holasek * stable and unstable pages from all nodes with roots in index 0. Otherwise, 56490bd6fd3SPetr Holasek * every node has its own stable and unstable tree. 56590bd6fd3SPetr Holasek */ 56690bd6fd3SPetr Holasek static inline int get_kpfn_nid(unsigned long kpfn) 56790bd6fd3SPetr Holasek { 568d8fc16a8SHugh Dickins return ksm_merge_across_nodes ? 0 : NUMA(pfn_to_nid(kpfn)); 56990bd6fd3SPetr Holasek } 57090bd6fd3SPetr Holasek 5712c653d0eSAndrea Arcangeli static struct stable_node *alloc_stable_node_chain(struct stable_node *dup, 5722c653d0eSAndrea Arcangeli struct rb_root *root) 5732c653d0eSAndrea Arcangeli { 5742c653d0eSAndrea Arcangeli struct stable_node *chain = alloc_stable_node(); 5752c653d0eSAndrea Arcangeli VM_BUG_ON(is_stable_node_chain(dup)); 5762c653d0eSAndrea Arcangeli if (likely(chain)) { 5772c653d0eSAndrea Arcangeli INIT_HLIST_HEAD(&chain->hlist); 5782c653d0eSAndrea Arcangeli chain->chain_prune_time = jiffies; 5792c653d0eSAndrea Arcangeli chain->rmap_hlist_len = STABLE_NODE_CHAIN; 5802c653d0eSAndrea Arcangeli #if defined (CONFIG_DEBUG_VM) && defined(CONFIG_NUMA) 5812c653d0eSAndrea Arcangeli chain->nid = -1; /* debug */ 5822c653d0eSAndrea Arcangeli #endif 5832c653d0eSAndrea Arcangeli ksm_stable_node_chains++; 5842c653d0eSAndrea Arcangeli 5852c653d0eSAndrea Arcangeli /* 5862c653d0eSAndrea Arcangeli * Put the stable node chain in the first dimension of 5872c653d0eSAndrea Arcangeli * the stable tree and at the same time remove the old 5882c653d0eSAndrea Arcangeli * stable node. 5892c653d0eSAndrea Arcangeli */ 5902c653d0eSAndrea Arcangeli rb_replace_node(&dup->node, &chain->node, root); 5912c653d0eSAndrea Arcangeli 5922c653d0eSAndrea Arcangeli /* 5932c653d0eSAndrea Arcangeli * Move the old stable node to the second dimension 5942c653d0eSAndrea Arcangeli * queued in the hlist_dup. The invariant is that all 5952c653d0eSAndrea Arcangeli * dup stable_nodes in the chain->hlist point to pages 5962c653d0eSAndrea Arcangeli * that are wrprotected and have the exact same 5972c653d0eSAndrea Arcangeli * content. 5982c653d0eSAndrea Arcangeli */ 5992c653d0eSAndrea Arcangeli stable_node_chain_add_dup(dup, chain); 6002c653d0eSAndrea Arcangeli } 6012c653d0eSAndrea Arcangeli return chain; 6022c653d0eSAndrea Arcangeli } 6032c653d0eSAndrea Arcangeli 6042c653d0eSAndrea Arcangeli static inline void free_stable_node_chain(struct stable_node *chain, 6052c653d0eSAndrea Arcangeli struct rb_root *root) 6062c653d0eSAndrea Arcangeli { 6072c653d0eSAndrea Arcangeli rb_erase(&chain->node, root); 6082c653d0eSAndrea Arcangeli free_stable_node(chain); 6092c653d0eSAndrea Arcangeli ksm_stable_node_chains--; 6102c653d0eSAndrea Arcangeli } 6112c653d0eSAndrea Arcangeli 6124035c07aSHugh Dickins static void remove_node_from_stable_tree(struct stable_node *stable_node) 6134035c07aSHugh Dickins { 6144035c07aSHugh Dickins struct rmap_item *rmap_item; 6154035c07aSHugh Dickins 6162c653d0eSAndrea Arcangeli /* check it's not STABLE_NODE_CHAIN or negative */ 6172c653d0eSAndrea Arcangeli BUG_ON(stable_node->rmap_hlist_len < 0); 6182c653d0eSAndrea Arcangeli 619b67bfe0dSSasha Levin hlist_for_each_entry(rmap_item, &stable_node->hlist, hlist) { 6204035c07aSHugh Dickins if (rmap_item->hlist.next) 6214035c07aSHugh Dickins ksm_pages_sharing--; 6224035c07aSHugh Dickins else 6234035c07aSHugh Dickins ksm_pages_shared--; 6242c653d0eSAndrea Arcangeli VM_BUG_ON(stable_node->rmap_hlist_len <= 0); 6252c653d0eSAndrea Arcangeli stable_node->rmap_hlist_len--; 6269e60109fSPeter Zijlstra put_anon_vma(rmap_item->anon_vma); 6274035c07aSHugh Dickins rmap_item->address &= PAGE_MASK; 6284035c07aSHugh Dickins cond_resched(); 6294035c07aSHugh Dickins } 6304035c07aSHugh Dickins 6312c653d0eSAndrea Arcangeli /* 6322c653d0eSAndrea Arcangeli * We need the second aligned pointer of the migrate_nodes 6332c653d0eSAndrea Arcangeli * list_head to stay clear from the rb_parent_color union 6342c653d0eSAndrea Arcangeli * (aligned and different than any node) and also different 6352c653d0eSAndrea Arcangeli * from &migrate_nodes. This will verify that future list.h changes 6362c653d0eSAndrea Arcangeli * don't break STABLE_NODE_DUP_HEAD. 6372c653d0eSAndrea Arcangeli */ 6382c653d0eSAndrea Arcangeli #if GCC_VERSION >= 40903 /* only recent gcc can handle it */ 6392c653d0eSAndrea Arcangeli BUILD_BUG_ON(STABLE_NODE_DUP_HEAD <= &migrate_nodes); 6402c653d0eSAndrea Arcangeli BUILD_BUG_ON(STABLE_NODE_DUP_HEAD >= &migrate_nodes + 1); 6412c653d0eSAndrea Arcangeli #endif 6422c653d0eSAndrea Arcangeli 6434146d2d6SHugh Dickins if (stable_node->head == &migrate_nodes) 6444146d2d6SHugh Dickins list_del(&stable_node->list); 6454146d2d6SHugh Dickins else 6462c653d0eSAndrea Arcangeli stable_node_dup_del(stable_node); 6474035c07aSHugh Dickins free_stable_node(stable_node); 6484035c07aSHugh Dickins } 6494035c07aSHugh Dickins 6504035c07aSHugh Dickins /* 6514035c07aSHugh Dickins * get_ksm_page: checks if the page indicated by the stable node 6524035c07aSHugh Dickins * is still its ksm page, despite having held no reference to it. 6534035c07aSHugh Dickins * In which case we can trust the content of the page, and it 6544035c07aSHugh Dickins * returns the gotten page; but if the page has now been zapped, 6554035c07aSHugh Dickins * remove the stale node from the stable tree and return NULL. 656c8d6553bSHugh Dickins * But beware, the stable node's page might be being migrated. 6574035c07aSHugh Dickins * 6584035c07aSHugh Dickins * You would expect the stable_node to hold a reference to the ksm page. 6594035c07aSHugh Dickins * But if it increments the page's count, swapping out has to wait for 6604035c07aSHugh Dickins * ksmd to come around again before it can free the page, which may take 6614035c07aSHugh Dickins * seconds or even minutes: much too unresponsive. So instead we use a 6624035c07aSHugh Dickins * "keyhole reference": access to the ksm page from the stable node peeps 6634035c07aSHugh Dickins * out through its keyhole to see if that page still holds the right key, 6644035c07aSHugh Dickins * pointing back to this stable node. This relies on freeing a PageAnon 6654035c07aSHugh Dickins * page to reset its page->mapping to NULL, and relies on no other use of 6664035c07aSHugh Dickins * a page to put something that might look like our key in page->mapping. 6674035c07aSHugh Dickins * is on its way to being freed; but it is an anomaly to bear in mind. 6684035c07aSHugh Dickins */ 6698fdb3dbfSHugh Dickins static struct page *get_ksm_page(struct stable_node *stable_node, bool lock_it) 6704035c07aSHugh Dickins { 6714035c07aSHugh Dickins struct page *page; 6724035c07aSHugh Dickins void *expected_mapping; 673c8d6553bSHugh Dickins unsigned long kpfn; 6744035c07aSHugh Dickins 675bda807d4SMinchan Kim expected_mapping = (void *)((unsigned long)stable_node | 676bda807d4SMinchan Kim PAGE_MAPPING_KSM); 677c8d6553bSHugh Dickins again: 6784db0c3c2SJason Low kpfn = READ_ONCE(stable_node->kpfn); 679c8d6553bSHugh Dickins page = pfn_to_page(kpfn); 680c8d6553bSHugh Dickins 681c8d6553bSHugh Dickins /* 682c8d6553bSHugh Dickins * page is computed from kpfn, so on most architectures reading 683c8d6553bSHugh Dickins * page->mapping is naturally ordered after reading node->kpfn, 684c8d6553bSHugh Dickins * but on Alpha we need to be more careful. 685c8d6553bSHugh Dickins */ 686c8d6553bSHugh Dickins smp_read_barrier_depends(); 6874db0c3c2SJason Low if (READ_ONCE(page->mapping) != expected_mapping) 6884035c07aSHugh Dickins goto stale; 689c8d6553bSHugh Dickins 690c8d6553bSHugh Dickins /* 691c8d6553bSHugh Dickins * We cannot do anything with the page while its refcount is 0. 692c8d6553bSHugh Dickins * Usually 0 means free, or tail of a higher-order page: in which 693c8d6553bSHugh Dickins * case this node is no longer referenced, and should be freed; 694c8d6553bSHugh Dickins * however, it might mean that the page is under page_freeze_refs(). 695c8d6553bSHugh Dickins * The __remove_mapping() case is easy, again the node is now stale; 696c8d6553bSHugh Dickins * but if page is swapcache in migrate_page_move_mapping(), it might 697c8d6553bSHugh Dickins * still be our page, in which case it's essential to keep the node. 698c8d6553bSHugh Dickins */ 699c8d6553bSHugh Dickins while (!get_page_unless_zero(page)) { 700c8d6553bSHugh Dickins /* 701c8d6553bSHugh Dickins * Another check for page->mapping != expected_mapping would 702c8d6553bSHugh Dickins * work here too. We have chosen the !PageSwapCache test to 703c8d6553bSHugh Dickins * optimize the common case, when the page is or is about to 704c8d6553bSHugh Dickins * be freed: PageSwapCache is cleared (under spin_lock_irq) 705c8d6553bSHugh Dickins * in the freeze_refs section of __remove_mapping(); but Anon 706c8d6553bSHugh Dickins * page->mapping reset to NULL later, in free_pages_prepare(). 707c8d6553bSHugh Dickins */ 708c8d6553bSHugh Dickins if (!PageSwapCache(page)) 7094035c07aSHugh Dickins goto stale; 710c8d6553bSHugh Dickins cpu_relax(); 711c8d6553bSHugh Dickins } 712c8d6553bSHugh Dickins 7134db0c3c2SJason Low if (READ_ONCE(page->mapping) != expected_mapping) { 7144035c07aSHugh Dickins put_page(page); 7154035c07aSHugh Dickins goto stale; 7164035c07aSHugh Dickins } 717c8d6553bSHugh Dickins 7188fdb3dbfSHugh Dickins if (lock_it) { 7198aafa6a4SHugh Dickins lock_page(page); 7204db0c3c2SJason Low if (READ_ONCE(page->mapping) != expected_mapping) { 7218aafa6a4SHugh Dickins unlock_page(page); 7228aafa6a4SHugh Dickins put_page(page); 7238aafa6a4SHugh Dickins goto stale; 7248aafa6a4SHugh Dickins } 7258aafa6a4SHugh Dickins } 7264035c07aSHugh Dickins return page; 727c8d6553bSHugh Dickins 7284035c07aSHugh Dickins stale: 729c8d6553bSHugh Dickins /* 730c8d6553bSHugh Dickins * We come here from above when page->mapping or !PageSwapCache 731c8d6553bSHugh Dickins * suggests that the node is stale; but it might be under migration. 732c8d6553bSHugh Dickins * We need smp_rmb(), matching the smp_wmb() in ksm_migrate_page(), 733c8d6553bSHugh Dickins * before checking whether node->kpfn has been changed. 734c8d6553bSHugh Dickins */ 735c8d6553bSHugh Dickins smp_rmb(); 7364db0c3c2SJason Low if (READ_ONCE(stable_node->kpfn) != kpfn) 737c8d6553bSHugh Dickins goto again; 7384035c07aSHugh Dickins remove_node_from_stable_tree(stable_node); 7394035c07aSHugh Dickins return NULL; 7404035c07aSHugh Dickins } 7414035c07aSHugh Dickins 74231dbd01fSIzik Eidus /* 74331dbd01fSIzik Eidus * Removing rmap_item from stable or unstable tree. 74431dbd01fSIzik Eidus * This function will clean the information from the stable/unstable tree. 74531dbd01fSIzik Eidus */ 74631dbd01fSIzik Eidus static void remove_rmap_item_from_tree(struct rmap_item *rmap_item) 74731dbd01fSIzik Eidus { 7487b6ba2c7SHugh Dickins if (rmap_item->address & STABLE_FLAG) { 7497b6ba2c7SHugh Dickins struct stable_node *stable_node; 7505ad64688SHugh Dickins struct page *page; 75131dbd01fSIzik Eidus 7527b6ba2c7SHugh Dickins stable_node = rmap_item->head; 7538aafa6a4SHugh Dickins page = get_ksm_page(stable_node, true); 7544035c07aSHugh Dickins if (!page) 7554035c07aSHugh Dickins goto out; 7565ad64688SHugh Dickins 7577b6ba2c7SHugh Dickins hlist_del(&rmap_item->hlist); 7585ad64688SHugh Dickins unlock_page(page); 7595ad64688SHugh Dickins put_page(page); 76008beca44SHugh Dickins 76198666f8aSAndrea Arcangeli if (!hlist_empty(&stable_node->hlist)) 7624035c07aSHugh Dickins ksm_pages_sharing--; 7634035c07aSHugh Dickins else 764b4028260SHugh Dickins ksm_pages_shared--; 7652c653d0eSAndrea Arcangeli VM_BUG_ON(stable_node->rmap_hlist_len <= 0); 7662c653d0eSAndrea Arcangeli stable_node->rmap_hlist_len--; 76731dbd01fSIzik Eidus 7689e60109fSPeter Zijlstra put_anon_vma(rmap_item->anon_vma); 76993d17715SHugh Dickins rmap_item->address &= PAGE_MASK; 77031dbd01fSIzik Eidus 7717b6ba2c7SHugh Dickins } else if (rmap_item->address & UNSTABLE_FLAG) { 77231dbd01fSIzik Eidus unsigned char age; 77331dbd01fSIzik Eidus /* 7749ba69294SHugh Dickins * Usually ksmd can and must skip the rb_erase, because 77531dbd01fSIzik Eidus * root_unstable_tree was already reset to RB_ROOT. 7769ba69294SHugh Dickins * But be careful when an mm is exiting: do the rb_erase 7779ba69294SHugh Dickins * if this rmap_item was inserted by this scan, rather 7789ba69294SHugh Dickins * than left over from before. 77931dbd01fSIzik Eidus */ 78031dbd01fSIzik Eidus age = (unsigned char)(ksm_scan.seqnr - rmap_item->address); 781cd551f97SHugh Dickins BUG_ON(age > 1); 78231dbd01fSIzik Eidus if (!age) 78390bd6fd3SPetr Holasek rb_erase(&rmap_item->node, 784ef53d16cSHugh Dickins root_unstable_tree + NUMA(rmap_item->nid)); 78593d17715SHugh Dickins ksm_pages_unshared--; 78631dbd01fSIzik Eidus rmap_item->address &= PAGE_MASK; 78793d17715SHugh Dickins } 7884035c07aSHugh Dickins out: 78931dbd01fSIzik Eidus cond_resched(); /* we're called from many long loops */ 79031dbd01fSIzik Eidus } 79131dbd01fSIzik Eidus 79231dbd01fSIzik Eidus static void remove_trailing_rmap_items(struct mm_slot *mm_slot, 7936514d511SHugh Dickins struct rmap_item **rmap_list) 79431dbd01fSIzik Eidus { 7956514d511SHugh Dickins while (*rmap_list) { 7966514d511SHugh Dickins struct rmap_item *rmap_item = *rmap_list; 7976514d511SHugh Dickins *rmap_list = rmap_item->rmap_list; 79831dbd01fSIzik Eidus remove_rmap_item_from_tree(rmap_item); 79931dbd01fSIzik Eidus free_rmap_item(rmap_item); 80031dbd01fSIzik Eidus } 80131dbd01fSIzik Eidus } 80231dbd01fSIzik Eidus 80331dbd01fSIzik Eidus /* 804e850dcf5SHugh Dickins * Though it's very tempting to unmerge rmap_items from stable tree rather 80531dbd01fSIzik Eidus * than check every pte of a given vma, the locking doesn't quite work for 80631dbd01fSIzik Eidus * that - an rmap_item is assigned to the stable tree after inserting ksm 80731dbd01fSIzik Eidus * page and upping mmap_sem. Nor does it fit with the way we skip dup'ing 80831dbd01fSIzik Eidus * rmap_items from parent to child at fork time (so as not to waste time 80931dbd01fSIzik Eidus * if exit comes before the next scan reaches it). 81081464e30SHugh Dickins * 81181464e30SHugh Dickins * Similarly, although we'd like to remove rmap_items (so updating counts 81281464e30SHugh Dickins * and freeing memory) when unmerging an area, it's easier to leave that 81381464e30SHugh Dickins * to the next pass of ksmd - consider, for example, how ksmd might be 81481464e30SHugh Dickins * in cmp_and_merge_page on one of the rmap_items we would be removing. 81531dbd01fSIzik Eidus */ 816d952b791SHugh Dickins static int unmerge_ksm_pages(struct vm_area_struct *vma, 81731dbd01fSIzik Eidus unsigned long start, unsigned long end) 81831dbd01fSIzik Eidus { 81931dbd01fSIzik Eidus unsigned long addr; 820d952b791SHugh Dickins int err = 0; 82131dbd01fSIzik Eidus 822d952b791SHugh Dickins for (addr = start; addr < end && !err; addr += PAGE_SIZE) { 8239ba69294SHugh Dickins if (ksm_test_exit(vma->vm_mm)) 8249ba69294SHugh Dickins break; 825d952b791SHugh Dickins if (signal_pending(current)) 826d952b791SHugh Dickins err = -ERESTARTSYS; 827d952b791SHugh Dickins else 828d952b791SHugh Dickins err = break_ksm(vma, addr); 829d952b791SHugh Dickins } 830d952b791SHugh Dickins return err; 83131dbd01fSIzik Eidus } 83231dbd01fSIzik Eidus 8332ffd8679SHugh Dickins #ifdef CONFIG_SYSFS 8342ffd8679SHugh Dickins /* 8352ffd8679SHugh Dickins * Only called through the sysfs control interface: 8362ffd8679SHugh Dickins */ 837cbf86cfeSHugh Dickins static int remove_stable_node(struct stable_node *stable_node) 838cbf86cfeSHugh Dickins { 839cbf86cfeSHugh Dickins struct page *page; 840cbf86cfeSHugh Dickins int err; 841cbf86cfeSHugh Dickins 842cbf86cfeSHugh Dickins page = get_ksm_page(stable_node, true); 843cbf86cfeSHugh Dickins if (!page) { 844cbf86cfeSHugh Dickins /* 845cbf86cfeSHugh Dickins * get_ksm_page did remove_node_from_stable_tree itself. 846cbf86cfeSHugh Dickins */ 847cbf86cfeSHugh Dickins return 0; 848cbf86cfeSHugh Dickins } 849cbf86cfeSHugh Dickins 8508fdb3dbfSHugh Dickins if (WARN_ON_ONCE(page_mapped(page))) { 851cbf86cfeSHugh Dickins /* 8528fdb3dbfSHugh Dickins * This should not happen: but if it does, just refuse to let 8538fdb3dbfSHugh Dickins * merge_across_nodes be switched - there is no need to panic. 8548fdb3dbfSHugh Dickins */ 8558fdb3dbfSHugh Dickins err = -EBUSY; 8568fdb3dbfSHugh Dickins } else { 8578fdb3dbfSHugh Dickins /* 8588fdb3dbfSHugh Dickins * The stable node did not yet appear stale to get_ksm_page(), 8598fdb3dbfSHugh Dickins * since that allows for an unmapped ksm page to be recognized 8608fdb3dbfSHugh Dickins * right up until it is freed; but the node is safe to remove. 861cbf86cfeSHugh Dickins * This page might be in a pagevec waiting to be freed, 862cbf86cfeSHugh Dickins * or it might be PageSwapCache (perhaps under writeback), 863cbf86cfeSHugh Dickins * or it might have been removed from swapcache a moment ago. 864cbf86cfeSHugh Dickins */ 865cbf86cfeSHugh Dickins set_page_stable_node(page, NULL); 866cbf86cfeSHugh Dickins remove_node_from_stable_tree(stable_node); 867cbf86cfeSHugh Dickins err = 0; 868cbf86cfeSHugh Dickins } 869cbf86cfeSHugh Dickins 870cbf86cfeSHugh Dickins unlock_page(page); 871cbf86cfeSHugh Dickins put_page(page); 872cbf86cfeSHugh Dickins return err; 873cbf86cfeSHugh Dickins } 874cbf86cfeSHugh Dickins 8752c653d0eSAndrea Arcangeli static int remove_stable_node_chain(struct stable_node *stable_node, 8762c653d0eSAndrea Arcangeli struct rb_root *root) 8772c653d0eSAndrea Arcangeli { 8782c653d0eSAndrea Arcangeli struct stable_node *dup; 8792c653d0eSAndrea Arcangeli struct hlist_node *hlist_safe; 8802c653d0eSAndrea Arcangeli 8812c653d0eSAndrea Arcangeli if (!is_stable_node_chain(stable_node)) { 8822c653d0eSAndrea Arcangeli VM_BUG_ON(is_stable_node_dup(stable_node)); 8832c653d0eSAndrea Arcangeli if (remove_stable_node(stable_node)) 8842c653d0eSAndrea Arcangeli return true; 8852c653d0eSAndrea Arcangeli else 8862c653d0eSAndrea Arcangeli return false; 8872c653d0eSAndrea Arcangeli } 8882c653d0eSAndrea Arcangeli 8892c653d0eSAndrea Arcangeli hlist_for_each_entry_safe(dup, hlist_safe, 8902c653d0eSAndrea Arcangeli &stable_node->hlist, hlist_dup) { 8912c653d0eSAndrea Arcangeli VM_BUG_ON(!is_stable_node_dup(dup)); 8922c653d0eSAndrea Arcangeli if (remove_stable_node(dup)) 8932c653d0eSAndrea Arcangeli return true; 8942c653d0eSAndrea Arcangeli } 8952c653d0eSAndrea Arcangeli BUG_ON(!hlist_empty(&stable_node->hlist)); 8962c653d0eSAndrea Arcangeli free_stable_node_chain(stable_node, root); 8972c653d0eSAndrea Arcangeli return false; 8982c653d0eSAndrea Arcangeli } 8992c653d0eSAndrea Arcangeli 900cbf86cfeSHugh Dickins static int remove_all_stable_nodes(void) 901cbf86cfeSHugh Dickins { 90203640418SGeliang Tang struct stable_node *stable_node, *next; 903cbf86cfeSHugh Dickins int nid; 904cbf86cfeSHugh Dickins int err = 0; 905cbf86cfeSHugh Dickins 906ef53d16cSHugh Dickins for (nid = 0; nid < ksm_nr_node_ids; nid++) { 907cbf86cfeSHugh Dickins while (root_stable_tree[nid].rb_node) { 908cbf86cfeSHugh Dickins stable_node = rb_entry(root_stable_tree[nid].rb_node, 909cbf86cfeSHugh Dickins struct stable_node, node); 9102c653d0eSAndrea Arcangeli if (remove_stable_node_chain(stable_node, 9112c653d0eSAndrea Arcangeli root_stable_tree + nid)) { 912cbf86cfeSHugh Dickins err = -EBUSY; 913cbf86cfeSHugh Dickins break; /* proceed to next nid */ 914cbf86cfeSHugh Dickins } 915cbf86cfeSHugh Dickins cond_resched(); 916cbf86cfeSHugh Dickins } 917cbf86cfeSHugh Dickins } 91803640418SGeliang Tang list_for_each_entry_safe(stable_node, next, &migrate_nodes, list) { 9194146d2d6SHugh Dickins if (remove_stable_node(stable_node)) 9204146d2d6SHugh Dickins err = -EBUSY; 9214146d2d6SHugh Dickins cond_resched(); 9224146d2d6SHugh Dickins } 923cbf86cfeSHugh Dickins return err; 924cbf86cfeSHugh Dickins } 925cbf86cfeSHugh Dickins 926d952b791SHugh Dickins static int unmerge_and_remove_all_rmap_items(void) 92731dbd01fSIzik Eidus { 92831dbd01fSIzik Eidus struct mm_slot *mm_slot; 92931dbd01fSIzik Eidus struct mm_struct *mm; 93031dbd01fSIzik Eidus struct vm_area_struct *vma; 931d952b791SHugh Dickins int err = 0; 93231dbd01fSIzik Eidus 933d952b791SHugh Dickins spin_lock(&ksm_mmlist_lock); 9349ba69294SHugh Dickins ksm_scan.mm_slot = list_entry(ksm_mm_head.mm_list.next, 935d952b791SHugh Dickins struct mm_slot, mm_list); 936d952b791SHugh Dickins spin_unlock(&ksm_mmlist_lock); 937d952b791SHugh Dickins 9389ba69294SHugh Dickins for (mm_slot = ksm_scan.mm_slot; 9399ba69294SHugh Dickins mm_slot != &ksm_mm_head; mm_slot = ksm_scan.mm_slot) { 94031dbd01fSIzik Eidus mm = mm_slot->mm; 94131dbd01fSIzik Eidus down_read(&mm->mmap_sem); 94231dbd01fSIzik Eidus for (vma = mm->mmap; vma; vma = vma->vm_next) { 9439ba69294SHugh Dickins if (ksm_test_exit(mm)) 9449ba69294SHugh Dickins break; 94531dbd01fSIzik Eidus if (!(vma->vm_flags & VM_MERGEABLE) || !vma->anon_vma) 94631dbd01fSIzik Eidus continue; 947d952b791SHugh Dickins err = unmerge_ksm_pages(vma, 948d952b791SHugh Dickins vma->vm_start, vma->vm_end); 9499ba69294SHugh Dickins if (err) 9509ba69294SHugh Dickins goto error; 951d952b791SHugh Dickins } 9529ba69294SHugh Dickins 9536514d511SHugh Dickins remove_trailing_rmap_items(mm_slot, &mm_slot->rmap_list); 9547496fea9SZhou Chengming up_read(&mm->mmap_sem); 95531dbd01fSIzik Eidus 95631dbd01fSIzik Eidus spin_lock(&ksm_mmlist_lock); 9579ba69294SHugh Dickins ksm_scan.mm_slot = list_entry(mm_slot->mm_list.next, 958d952b791SHugh Dickins struct mm_slot, mm_list); 9599ba69294SHugh Dickins if (ksm_test_exit(mm)) { 9604ca3a69bSSasha Levin hash_del(&mm_slot->link); 9619ba69294SHugh Dickins list_del(&mm_slot->mm_list); 96231dbd01fSIzik Eidus spin_unlock(&ksm_mmlist_lock); 9639ba69294SHugh Dickins 9649ba69294SHugh Dickins free_mm_slot(mm_slot); 9659ba69294SHugh Dickins clear_bit(MMF_VM_MERGEABLE, &mm->flags); 9669ba69294SHugh Dickins mmdrop(mm); 9677496fea9SZhou Chengming } else 9689ba69294SHugh Dickins spin_unlock(&ksm_mmlist_lock); 96931dbd01fSIzik Eidus } 97031dbd01fSIzik Eidus 971cbf86cfeSHugh Dickins /* Clean up stable nodes, but don't worry if some are still busy */ 972cbf86cfeSHugh Dickins remove_all_stable_nodes(); 973d952b791SHugh Dickins ksm_scan.seqnr = 0; 9749ba69294SHugh Dickins return 0; 9759ba69294SHugh Dickins 9769ba69294SHugh Dickins error: 9779ba69294SHugh Dickins up_read(&mm->mmap_sem); 978d952b791SHugh Dickins spin_lock(&ksm_mmlist_lock); 979d952b791SHugh Dickins ksm_scan.mm_slot = &ksm_mm_head; 980d952b791SHugh Dickins spin_unlock(&ksm_mmlist_lock); 981d952b791SHugh Dickins return err; 982d952b791SHugh Dickins } 9832ffd8679SHugh Dickins #endif /* CONFIG_SYSFS */ 984d952b791SHugh Dickins 98531dbd01fSIzik Eidus static u32 calc_checksum(struct page *page) 98631dbd01fSIzik Eidus { 98731dbd01fSIzik Eidus u32 checksum; 9889b04c5feSCong Wang void *addr = kmap_atomic(page); 98931dbd01fSIzik Eidus checksum = jhash2(addr, PAGE_SIZE / 4, 17); 9909b04c5feSCong Wang kunmap_atomic(addr); 99131dbd01fSIzik Eidus return checksum; 99231dbd01fSIzik Eidus } 99331dbd01fSIzik Eidus 99431dbd01fSIzik Eidus static int memcmp_pages(struct page *page1, struct page *page2) 99531dbd01fSIzik Eidus { 99631dbd01fSIzik Eidus char *addr1, *addr2; 99731dbd01fSIzik Eidus int ret; 99831dbd01fSIzik Eidus 9999b04c5feSCong Wang addr1 = kmap_atomic(page1); 10009b04c5feSCong Wang addr2 = kmap_atomic(page2); 100131dbd01fSIzik Eidus ret = memcmp(addr1, addr2, PAGE_SIZE); 10029b04c5feSCong Wang kunmap_atomic(addr2); 10039b04c5feSCong Wang kunmap_atomic(addr1); 100431dbd01fSIzik Eidus return ret; 100531dbd01fSIzik Eidus } 100631dbd01fSIzik Eidus 100731dbd01fSIzik Eidus static inline int pages_identical(struct page *page1, struct page *page2) 100831dbd01fSIzik Eidus { 100931dbd01fSIzik Eidus return !memcmp_pages(page1, page2); 101031dbd01fSIzik Eidus } 101131dbd01fSIzik Eidus 101231dbd01fSIzik Eidus static int write_protect_page(struct vm_area_struct *vma, struct page *page, 101331dbd01fSIzik Eidus pte_t *orig_pte) 101431dbd01fSIzik Eidus { 101531dbd01fSIzik Eidus struct mm_struct *mm = vma->vm_mm; 101636eaff33SKirill A. Shutemov struct page_vma_mapped_walk pvmw = { 101736eaff33SKirill A. Shutemov .page = page, 101836eaff33SKirill A. Shutemov .vma = vma, 101936eaff33SKirill A. Shutemov }; 102031dbd01fSIzik Eidus int swapped; 102131dbd01fSIzik Eidus int err = -EFAULT; 10226bdb913fSHaggai Eran unsigned long mmun_start; /* For mmu_notifiers */ 10236bdb913fSHaggai Eran unsigned long mmun_end; /* For mmu_notifiers */ 102431dbd01fSIzik Eidus 102536eaff33SKirill A. Shutemov pvmw.address = page_address_in_vma(page, vma); 102636eaff33SKirill A. Shutemov if (pvmw.address == -EFAULT) 102731dbd01fSIzik Eidus goto out; 102831dbd01fSIzik Eidus 102929ad768cSAndrea Arcangeli BUG_ON(PageTransCompound(page)); 10306bdb913fSHaggai Eran 103136eaff33SKirill A. Shutemov mmun_start = pvmw.address; 103236eaff33SKirill A. Shutemov mmun_end = pvmw.address + PAGE_SIZE; 10336bdb913fSHaggai Eran mmu_notifier_invalidate_range_start(mm, mmun_start, mmun_end); 10346bdb913fSHaggai Eran 103536eaff33SKirill A. Shutemov if (!page_vma_mapped_walk(&pvmw)) 10366bdb913fSHaggai Eran goto out_mn; 103736eaff33SKirill A. Shutemov if (WARN_ONCE(!pvmw.pte, "Unexpected PMD mapping?")) 103836eaff33SKirill A. Shutemov goto out_unlock; 103931dbd01fSIzik Eidus 1040595cd8f2SAneesh Kumar K.V if (pte_write(*pvmw.pte) || pte_dirty(*pvmw.pte) || 1041595cd8f2SAneesh Kumar K.V (pte_protnone(*pvmw.pte) && pte_savedwrite(*pvmw.pte))) { 104231dbd01fSIzik Eidus pte_t entry; 104331dbd01fSIzik Eidus 104431dbd01fSIzik Eidus swapped = PageSwapCache(page); 104536eaff33SKirill A. Shutemov flush_cache_page(vma, pvmw.address, page_to_pfn(page)); 104631dbd01fSIzik Eidus /* 104725985edcSLucas De Marchi * Ok this is tricky, when get_user_pages_fast() run it doesn't 104831dbd01fSIzik Eidus * take any lock, therefore the check that we are going to make 104931dbd01fSIzik Eidus * with the pagecount against the mapcount is racey and 105031dbd01fSIzik Eidus * O_DIRECT can happen right after the check. 105131dbd01fSIzik Eidus * So we clear the pte and flush the tlb before the check 105231dbd01fSIzik Eidus * this assure us that no O_DIRECT can happen after the check 105331dbd01fSIzik Eidus * or in the middle of the check. 105431dbd01fSIzik Eidus */ 105536eaff33SKirill A. Shutemov entry = ptep_clear_flush_notify(vma, pvmw.address, pvmw.pte); 105631dbd01fSIzik Eidus /* 105731dbd01fSIzik Eidus * Check that no O_DIRECT or similar I/O is in progress on the 105831dbd01fSIzik Eidus * page 105931dbd01fSIzik Eidus */ 106031e855eaSHugh Dickins if (page_mapcount(page) + 1 + swapped != page_count(page)) { 106136eaff33SKirill A. Shutemov set_pte_at(mm, pvmw.address, pvmw.pte, entry); 106231dbd01fSIzik Eidus goto out_unlock; 106331dbd01fSIzik Eidus } 10644e31635cSHugh Dickins if (pte_dirty(entry)) 10654e31635cSHugh Dickins set_page_dirty(page); 1066595cd8f2SAneesh Kumar K.V 1067595cd8f2SAneesh Kumar K.V if (pte_protnone(entry)) 1068595cd8f2SAneesh Kumar K.V entry = pte_mkclean(pte_clear_savedwrite(entry)); 1069595cd8f2SAneesh Kumar K.V else 10704e31635cSHugh Dickins entry = pte_mkclean(pte_wrprotect(entry)); 107136eaff33SKirill A. Shutemov set_pte_at_notify(mm, pvmw.address, pvmw.pte, entry); 107231dbd01fSIzik Eidus } 107336eaff33SKirill A. Shutemov *orig_pte = *pvmw.pte; 107431dbd01fSIzik Eidus err = 0; 107531dbd01fSIzik Eidus 107631dbd01fSIzik Eidus out_unlock: 107736eaff33SKirill A. Shutemov page_vma_mapped_walk_done(&pvmw); 10786bdb913fSHaggai Eran out_mn: 10796bdb913fSHaggai Eran mmu_notifier_invalidate_range_end(mm, mmun_start, mmun_end); 108031dbd01fSIzik Eidus out: 108131dbd01fSIzik Eidus return err; 108231dbd01fSIzik Eidus } 108331dbd01fSIzik Eidus 108431dbd01fSIzik Eidus /** 108531dbd01fSIzik Eidus * replace_page - replace page in vma by new ksm page 10868dd3557aSHugh Dickins * @vma: vma that holds the pte pointing to page 10878dd3557aSHugh Dickins * @page: the page we are replacing by kpage 10888dd3557aSHugh Dickins * @kpage: the ksm page we replace page by 108931dbd01fSIzik Eidus * @orig_pte: the original value of the pte 109031dbd01fSIzik Eidus * 109131dbd01fSIzik Eidus * Returns 0 on success, -EFAULT on failure. 109231dbd01fSIzik Eidus */ 10938dd3557aSHugh Dickins static int replace_page(struct vm_area_struct *vma, struct page *page, 10948dd3557aSHugh Dickins struct page *kpage, pte_t orig_pte) 109531dbd01fSIzik Eidus { 109631dbd01fSIzik Eidus struct mm_struct *mm = vma->vm_mm; 109731dbd01fSIzik Eidus pmd_t *pmd; 109831dbd01fSIzik Eidus pte_t *ptep; 1099e86c59b1SClaudio Imbrenda pte_t newpte; 110031dbd01fSIzik Eidus spinlock_t *ptl; 110131dbd01fSIzik Eidus unsigned long addr; 110231dbd01fSIzik Eidus int err = -EFAULT; 11036bdb913fSHaggai Eran unsigned long mmun_start; /* For mmu_notifiers */ 11046bdb913fSHaggai Eran unsigned long mmun_end; /* For mmu_notifiers */ 110531dbd01fSIzik Eidus 11068dd3557aSHugh Dickins addr = page_address_in_vma(page, vma); 110731dbd01fSIzik Eidus if (addr == -EFAULT) 110831dbd01fSIzik Eidus goto out; 110931dbd01fSIzik Eidus 11106219049aSBob Liu pmd = mm_find_pmd(mm, addr); 11116219049aSBob Liu if (!pmd) 111231dbd01fSIzik Eidus goto out; 111331dbd01fSIzik Eidus 11146bdb913fSHaggai Eran mmun_start = addr; 11156bdb913fSHaggai Eran mmun_end = addr + PAGE_SIZE; 11166bdb913fSHaggai Eran mmu_notifier_invalidate_range_start(mm, mmun_start, mmun_end); 11176bdb913fSHaggai Eran 111831dbd01fSIzik Eidus ptep = pte_offset_map_lock(mm, pmd, addr, &ptl); 111931dbd01fSIzik Eidus if (!pte_same(*ptep, orig_pte)) { 112031dbd01fSIzik Eidus pte_unmap_unlock(ptep, ptl); 11216bdb913fSHaggai Eran goto out_mn; 112231dbd01fSIzik Eidus } 112331dbd01fSIzik Eidus 1124e86c59b1SClaudio Imbrenda /* 1125e86c59b1SClaudio Imbrenda * No need to check ksm_use_zero_pages here: we can only have a 1126e86c59b1SClaudio Imbrenda * zero_page here if ksm_use_zero_pages was enabled alreaady. 1127e86c59b1SClaudio Imbrenda */ 1128e86c59b1SClaudio Imbrenda if (!is_zero_pfn(page_to_pfn(kpage))) { 11298dd3557aSHugh Dickins get_page(kpage); 1130d281ee61SKirill A. Shutemov page_add_anon_rmap(kpage, vma, addr, false); 1131e86c59b1SClaudio Imbrenda newpte = mk_pte(kpage, vma->vm_page_prot); 1132e86c59b1SClaudio Imbrenda } else { 1133e86c59b1SClaudio Imbrenda newpte = pte_mkspecial(pfn_pte(page_to_pfn(kpage), 1134e86c59b1SClaudio Imbrenda vma->vm_page_prot)); 1135e86c59b1SClaudio Imbrenda } 113631dbd01fSIzik Eidus 113731dbd01fSIzik Eidus flush_cache_page(vma, addr, pte_pfn(*ptep)); 113834ee645eSJoerg Roedel ptep_clear_flush_notify(vma, addr, ptep); 1139e86c59b1SClaudio Imbrenda set_pte_at_notify(mm, addr, ptep, newpte); 114031dbd01fSIzik Eidus 1141d281ee61SKirill A. Shutemov page_remove_rmap(page, false); 1142ae52a2adSHugh Dickins if (!page_mapped(page)) 1143ae52a2adSHugh Dickins try_to_free_swap(page); 11448dd3557aSHugh Dickins put_page(page); 114531dbd01fSIzik Eidus 114631dbd01fSIzik Eidus pte_unmap_unlock(ptep, ptl); 114731dbd01fSIzik Eidus err = 0; 11486bdb913fSHaggai Eran out_mn: 11496bdb913fSHaggai Eran mmu_notifier_invalidate_range_end(mm, mmun_start, mmun_end); 115031dbd01fSIzik Eidus out: 115131dbd01fSIzik Eidus return err; 115231dbd01fSIzik Eidus } 115331dbd01fSIzik Eidus 115431dbd01fSIzik Eidus /* 115531dbd01fSIzik Eidus * try_to_merge_one_page - take two pages and merge them into one 11568dd3557aSHugh Dickins * @vma: the vma that holds the pte pointing to page 11578dd3557aSHugh Dickins * @page: the PageAnon page that we want to replace with kpage 115880e14822SHugh Dickins * @kpage: the PageKsm page that we want to map instead of page, 115980e14822SHugh Dickins * or NULL the first time when we want to use page as kpage. 116031dbd01fSIzik Eidus * 116131dbd01fSIzik Eidus * This function returns 0 if the pages were merged, -EFAULT otherwise. 116231dbd01fSIzik Eidus */ 116331dbd01fSIzik Eidus static int try_to_merge_one_page(struct vm_area_struct *vma, 11648dd3557aSHugh Dickins struct page *page, struct page *kpage) 116531dbd01fSIzik Eidus { 116631dbd01fSIzik Eidus pte_t orig_pte = __pte(0); 116731dbd01fSIzik Eidus int err = -EFAULT; 116831dbd01fSIzik Eidus 1169db114b83SHugh Dickins if (page == kpage) /* ksm page forked */ 1170db114b83SHugh Dickins return 0; 1171db114b83SHugh Dickins 11728dd3557aSHugh Dickins if (!PageAnon(page)) 117331dbd01fSIzik Eidus goto out; 117431dbd01fSIzik Eidus 117531dbd01fSIzik Eidus /* 117631dbd01fSIzik Eidus * We need the page lock to read a stable PageSwapCache in 117731dbd01fSIzik Eidus * write_protect_page(). We use trylock_page() instead of 117831dbd01fSIzik Eidus * lock_page() because we don't want to wait here - we 117931dbd01fSIzik Eidus * prefer to continue scanning and merging different pages, 118031dbd01fSIzik Eidus * then come back to this page when it is unlocked. 118131dbd01fSIzik Eidus */ 11828dd3557aSHugh Dickins if (!trylock_page(page)) 118331e855eaSHugh Dickins goto out; 1184f765f540SKirill A. Shutemov 1185f765f540SKirill A. Shutemov if (PageTransCompound(page)) { 1186a7306c34SAndrea Arcangeli if (split_huge_page(page)) 1187f765f540SKirill A. Shutemov goto out_unlock; 1188f765f540SKirill A. Shutemov } 1189f765f540SKirill A. Shutemov 119031dbd01fSIzik Eidus /* 119131dbd01fSIzik Eidus * If this anonymous page is mapped only here, its pte may need 119231dbd01fSIzik Eidus * to be write-protected. If it's mapped elsewhere, all of its 119331dbd01fSIzik Eidus * ptes are necessarily already write-protected. But in either 119431dbd01fSIzik Eidus * case, we need to lock and check page_count is not raised. 119531dbd01fSIzik Eidus */ 119680e14822SHugh Dickins if (write_protect_page(vma, page, &orig_pte) == 0) { 119780e14822SHugh Dickins if (!kpage) { 119880e14822SHugh Dickins /* 119980e14822SHugh Dickins * While we hold page lock, upgrade page from 120080e14822SHugh Dickins * PageAnon+anon_vma to PageKsm+NULL stable_node: 120180e14822SHugh Dickins * stable_tree_insert() will update stable_node. 120280e14822SHugh Dickins */ 120380e14822SHugh Dickins set_page_stable_node(page, NULL); 120480e14822SHugh Dickins mark_page_accessed(page); 1205337ed7ebSMinchan Kim /* 1206337ed7ebSMinchan Kim * Page reclaim just frees a clean page with no dirty 1207337ed7ebSMinchan Kim * ptes: make sure that the ksm page would be swapped. 1208337ed7ebSMinchan Kim */ 1209337ed7ebSMinchan Kim if (!PageDirty(page)) 1210337ed7ebSMinchan Kim SetPageDirty(page); 121180e14822SHugh Dickins err = 0; 121280e14822SHugh Dickins } else if (pages_identical(page, kpage)) 12138dd3557aSHugh Dickins err = replace_page(vma, page, kpage, orig_pte); 121480e14822SHugh Dickins } 121531dbd01fSIzik Eidus 121680e14822SHugh Dickins if ((vma->vm_flags & VM_LOCKED) && kpage && !err) { 121773848b46SHugh Dickins munlock_vma_page(page); 12185ad64688SHugh Dickins if (!PageMlocked(kpage)) { 12195ad64688SHugh Dickins unlock_page(page); 12205ad64688SHugh Dickins lock_page(kpage); 12215ad64688SHugh Dickins mlock_vma_page(kpage); 12225ad64688SHugh Dickins page = kpage; /* for final unlock */ 12235ad64688SHugh Dickins } 12245ad64688SHugh Dickins } 122573848b46SHugh Dickins 1226f765f540SKirill A. Shutemov out_unlock: 12278dd3557aSHugh Dickins unlock_page(page); 122831dbd01fSIzik Eidus out: 122931dbd01fSIzik Eidus return err; 123031dbd01fSIzik Eidus } 123131dbd01fSIzik Eidus 123231dbd01fSIzik Eidus /* 123381464e30SHugh Dickins * try_to_merge_with_ksm_page - like try_to_merge_two_pages, 123481464e30SHugh Dickins * but no new kernel page is allocated: kpage must already be a ksm page. 12358dd3557aSHugh Dickins * 12368dd3557aSHugh Dickins * This function returns 0 if the pages were merged, -EFAULT otherwise. 123781464e30SHugh Dickins */ 12388dd3557aSHugh Dickins static int try_to_merge_with_ksm_page(struct rmap_item *rmap_item, 12398dd3557aSHugh Dickins struct page *page, struct page *kpage) 124081464e30SHugh Dickins { 12418dd3557aSHugh Dickins struct mm_struct *mm = rmap_item->mm; 124281464e30SHugh Dickins struct vm_area_struct *vma; 124381464e30SHugh Dickins int err = -EFAULT; 124481464e30SHugh Dickins 12458dd3557aSHugh Dickins down_read(&mm->mmap_sem); 124685c6e8ddSAndrea Arcangeli vma = find_mergeable_vma(mm, rmap_item->address); 124785c6e8ddSAndrea Arcangeli if (!vma) 12489ba69294SHugh Dickins goto out; 12499ba69294SHugh Dickins 12508dd3557aSHugh Dickins err = try_to_merge_one_page(vma, page, kpage); 1251db114b83SHugh Dickins if (err) 1252db114b83SHugh Dickins goto out; 1253db114b83SHugh Dickins 1254bc56620bSHugh Dickins /* Unstable nid is in union with stable anon_vma: remove first */ 1255bc56620bSHugh Dickins remove_rmap_item_from_tree(rmap_item); 1256bc56620bSHugh Dickins 1257db114b83SHugh Dickins /* Must get reference to anon_vma while still holding mmap_sem */ 12589e60109fSPeter Zijlstra rmap_item->anon_vma = vma->anon_vma; 12599e60109fSPeter Zijlstra get_anon_vma(vma->anon_vma); 126081464e30SHugh Dickins out: 12618dd3557aSHugh Dickins up_read(&mm->mmap_sem); 126281464e30SHugh Dickins return err; 126381464e30SHugh Dickins } 126481464e30SHugh Dickins 126581464e30SHugh Dickins /* 126631dbd01fSIzik Eidus * try_to_merge_two_pages - take two identical pages and prepare them 126731dbd01fSIzik Eidus * to be merged into one page. 126831dbd01fSIzik Eidus * 12698dd3557aSHugh Dickins * This function returns the kpage if we successfully merged two identical 12708dd3557aSHugh Dickins * pages into one ksm page, NULL otherwise. 127131dbd01fSIzik Eidus * 127280e14822SHugh Dickins * Note that this function upgrades page to ksm page: if one of the pages 127331dbd01fSIzik Eidus * is already a ksm page, try_to_merge_with_ksm_page should be used. 127431dbd01fSIzik Eidus */ 12758dd3557aSHugh Dickins static struct page *try_to_merge_two_pages(struct rmap_item *rmap_item, 12768dd3557aSHugh Dickins struct page *page, 12778dd3557aSHugh Dickins struct rmap_item *tree_rmap_item, 12788dd3557aSHugh Dickins struct page *tree_page) 127931dbd01fSIzik Eidus { 128080e14822SHugh Dickins int err; 128131dbd01fSIzik Eidus 128280e14822SHugh Dickins err = try_to_merge_with_ksm_page(rmap_item, page, NULL); 128331dbd01fSIzik Eidus if (!err) { 12848dd3557aSHugh Dickins err = try_to_merge_with_ksm_page(tree_rmap_item, 128580e14822SHugh Dickins tree_page, page); 128631dbd01fSIzik Eidus /* 128781464e30SHugh Dickins * If that fails, we have a ksm page with only one pte 128881464e30SHugh Dickins * pointing to it: so break it. 128931dbd01fSIzik Eidus */ 12904035c07aSHugh Dickins if (err) 12918dd3557aSHugh Dickins break_cow(rmap_item); 129231dbd01fSIzik Eidus } 129380e14822SHugh Dickins return err ? NULL : page; 129431dbd01fSIzik Eidus } 129531dbd01fSIzik Eidus 12962c653d0eSAndrea Arcangeli static __always_inline 12972c653d0eSAndrea Arcangeli bool __is_page_sharing_candidate(struct stable_node *stable_node, int offset) 12982c653d0eSAndrea Arcangeli { 12992c653d0eSAndrea Arcangeli VM_BUG_ON(stable_node->rmap_hlist_len < 0); 13002c653d0eSAndrea Arcangeli /* 13012c653d0eSAndrea Arcangeli * Check that at least one mapping still exists, otherwise 13022c653d0eSAndrea Arcangeli * there's no much point to merge and share with this 13032c653d0eSAndrea Arcangeli * stable_node, as the underlying tree_page of the other 13042c653d0eSAndrea Arcangeli * sharer is going to be freed soon. 13052c653d0eSAndrea Arcangeli */ 13062c653d0eSAndrea Arcangeli return stable_node->rmap_hlist_len && 13072c653d0eSAndrea Arcangeli stable_node->rmap_hlist_len + offset < ksm_max_page_sharing; 13082c653d0eSAndrea Arcangeli } 13092c653d0eSAndrea Arcangeli 13102c653d0eSAndrea Arcangeli static __always_inline 13112c653d0eSAndrea Arcangeli bool is_page_sharing_candidate(struct stable_node *stable_node) 13122c653d0eSAndrea Arcangeli { 13132c653d0eSAndrea Arcangeli return __is_page_sharing_candidate(stable_node, 0); 13142c653d0eSAndrea Arcangeli } 13152c653d0eSAndrea Arcangeli 13168dc5ffcdSAndrea Arcangeli struct page *stable_node_dup(struct stable_node **_stable_node_dup, 13178dc5ffcdSAndrea Arcangeli struct stable_node **_stable_node, 13182c653d0eSAndrea Arcangeli struct rb_root *root, 13192c653d0eSAndrea Arcangeli bool prune_stale_stable_nodes) 13202c653d0eSAndrea Arcangeli { 1321b4fecc67SAndrea Arcangeli struct stable_node *dup, *found = NULL, *stable_node = *_stable_node; 13222c653d0eSAndrea Arcangeli struct hlist_node *hlist_safe; 13238dc5ffcdSAndrea Arcangeli struct page *_tree_page, *tree_page = NULL; 13242c653d0eSAndrea Arcangeli int nr = 0; 13252c653d0eSAndrea Arcangeli int found_rmap_hlist_len; 13262c653d0eSAndrea Arcangeli 13272c653d0eSAndrea Arcangeli if (!prune_stale_stable_nodes || 13282c653d0eSAndrea Arcangeli time_before(jiffies, stable_node->chain_prune_time + 13292c653d0eSAndrea Arcangeli msecs_to_jiffies( 13302c653d0eSAndrea Arcangeli ksm_stable_node_chains_prune_millisecs))) 13312c653d0eSAndrea Arcangeli prune_stale_stable_nodes = false; 13322c653d0eSAndrea Arcangeli else 13332c653d0eSAndrea Arcangeli stable_node->chain_prune_time = jiffies; 13342c653d0eSAndrea Arcangeli 13352c653d0eSAndrea Arcangeli hlist_for_each_entry_safe(dup, hlist_safe, 13362c653d0eSAndrea Arcangeli &stable_node->hlist, hlist_dup) { 13372c653d0eSAndrea Arcangeli cond_resched(); 13382c653d0eSAndrea Arcangeli /* 13392c653d0eSAndrea Arcangeli * We must walk all stable_node_dup to prune the stale 13402c653d0eSAndrea Arcangeli * stable nodes during lookup. 13412c653d0eSAndrea Arcangeli * 13422c653d0eSAndrea Arcangeli * get_ksm_page can drop the nodes from the 13432c653d0eSAndrea Arcangeli * stable_node->hlist if they point to freed pages 13442c653d0eSAndrea Arcangeli * (that's why we do a _safe walk). The "dup" 13452c653d0eSAndrea Arcangeli * stable_node parameter itself will be freed from 13462c653d0eSAndrea Arcangeli * under us if it returns NULL. 13472c653d0eSAndrea Arcangeli */ 13482c653d0eSAndrea Arcangeli _tree_page = get_ksm_page(dup, false); 13492c653d0eSAndrea Arcangeli if (!_tree_page) 13502c653d0eSAndrea Arcangeli continue; 13512c653d0eSAndrea Arcangeli nr += 1; 13522c653d0eSAndrea Arcangeli if (is_page_sharing_candidate(dup)) { 13532c653d0eSAndrea Arcangeli if (!found || 13542c653d0eSAndrea Arcangeli dup->rmap_hlist_len > found_rmap_hlist_len) { 13552c653d0eSAndrea Arcangeli if (found) 13568dc5ffcdSAndrea Arcangeli put_page(tree_page); 13572c653d0eSAndrea Arcangeli found = dup; 13582c653d0eSAndrea Arcangeli found_rmap_hlist_len = found->rmap_hlist_len; 13598dc5ffcdSAndrea Arcangeli tree_page = _tree_page; 13602c653d0eSAndrea Arcangeli 13618dc5ffcdSAndrea Arcangeli /* skip put_page for found dup */ 13622c653d0eSAndrea Arcangeli if (!prune_stale_stable_nodes) 13632c653d0eSAndrea Arcangeli break; 13642c653d0eSAndrea Arcangeli continue; 13652c653d0eSAndrea Arcangeli } 13662c653d0eSAndrea Arcangeli } 13672c653d0eSAndrea Arcangeli put_page(_tree_page); 13682c653d0eSAndrea Arcangeli } 13692c653d0eSAndrea Arcangeli 1370*80b18dfaSAndrea Arcangeli if (found) { 13712c653d0eSAndrea Arcangeli /* 1372*80b18dfaSAndrea Arcangeli * nr is counting all dups in the chain only if 1373*80b18dfaSAndrea Arcangeli * prune_stale_stable_nodes is true, otherwise we may 1374*80b18dfaSAndrea Arcangeli * break the loop at nr == 1 even if there are 1375*80b18dfaSAndrea Arcangeli * multiple entries. 13762c653d0eSAndrea Arcangeli */ 1377*80b18dfaSAndrea Arcangeli if (prune_stale_stable_nodes && nr == 1) { 13782c653d0eSAndrea Arcangeli /* 13792c653d0eSAndrea Arcangeli * If there's not just one entry it would 13802c653d0eSAndrea Arcangeli * corrupt memory, better BUG_ON. In KSM 13812c653d0eSAndrea Arcangeli * context with no lock held it's not even 13822c653d0eSAndrea Arcangeli * fatal. 13832c653d0eSAndrea Arcangeli */ 13842c653d0eSAndrea Arcangeli BUG_ON(stable_node->hlist.first->next); 13852c653d0eSAndrea Arcangeli 13862c653d0eSAndrea Arcangeli /* 13872c653d0eSAndrea Arcangeli * There's just one entry and it is below the 13882c653d0eSAndrea Arcangeli * deduplication limit so drop the chain. 13892c653d0eSAndrea Arcangeli */ 13902c653d0eSAndrea Arcangeli rb_replace_node(&stable_node->node, &found->node, 13912c653d0eSAndrea Arcangeli root); 13922c653d0eSAndrea Arcangeli free_stable_node(stable_node); 13932c653d0eSAndrea Arcangeli ksm_stable_node_chains--; 13942c653d0eSAndrea Arcangeli ksm_stable_node_dups--; 1395b4fecc67SAndrea Arcangeli /* 13960ba1d0f7SAndrea Arcangeli * NOTE: the caller depends on the stable_node 13970ba1d0f7SAndrea Arcangeli * to be equal to stable_node_dup if the chain 13980ba1d0f7SAndrea Arcangeli * was collapsed. 1399b4fecc67SAndrea Arcangeli */ 14000ba1d0f7SAndrea Arcangeli *_stable_node = found; 14010ba1d0f7SAndrea Arcangeli /* 14020ba1d0f7SAndrea Arcangeli * Just for robustneess as stable_node is 14030ba1d0f7SAndrea Arcangeli * otherwise left as a stable pointer, the 14040ba1d0f7SAndrea Arcangeli * compiler shall optimize it away at build 14050ba1d0f7SAndrea Arcangeli * time. 14060ba1d0f7SAndrea Arcangeli */ 14070ba1d0f7SAndrea Arcangeli stable_node = NULL; 1408*80b18dfaSAndrea Arcangeli } else if (stable_node->hlist.first != &found->hlist_dup && 1409*80b18dfaSAndrea Arcangeli __is_page_sharing_candidate(found, 1)) { 14102c653d0eSAndrea Arcangeli /* 1411*80b18dfaSAndrea Arcangeli * If the found stable_node dup can accept one 1412*80b18dfaSAndrea Arcangeli * more future merge (in addition to the one 1413*80b18dfaSAndrea Arcangeli * that is underway) and is not at the head of 1414*80b18dfaSAndrea Arcangeli * the chain, put it there so next search will 1415*80b18dfaSAndrea Arcangeli * be quicker in the !prune_stale_stable_nodes 1416*80b18dfaSAndrea Arcangeli * case. 1417*80b18dfaSAndrea Arcangeli * 1418*80b18dfaSAndrea Arcangeli * NOTE: it would be inaccurate to use nr > 1 1419*80b18dfaSAndrea Arcangeli * instead of checking the hlist.first pointer 1420*80b18dfaSAndrea Arcangeli * directly, because in the 1421*80b18dfaSAndrea Arcangeli * prune_stale_stable_nodes case "nr" isn't 1422*80b18dfaSAndrea Arcangeli * the position of the found dup in the chain, 1423*80b18dfaSAndrea Arcangeli * but the total number of dups in the chain. 14242c653d0eSAndrea Arcangeli */ 14252c653d0eSAndrea Arcangeli hlist_del(&found->hlist_dup); 14262c653d0eSAndrea Arcangeli hlist_add_head(&found->hlist_dup, 14272c653d0eSAndrea Arcangeli &stable_node->hlist); 14282c653d0eSAndrea Arcangeli } 14292c653d0eSAndrea Arcangeli } 14302c653d0eSAndrea Arcangeli 14318dc5ffcdSAndrea Arcangeli *_stable_node_dup = found; 14328dc5ffcdSAndrea Arcangeli return tree_page; 14332c653d0eSAndrea Arcangeli } 14342c653d0eSAndrea Arcangeli 14352c653d0eSAndrea Arcangeli static struct stable_node *stable_node_dup_any(struct stable_node *stable_node, 14362c653d0eSAndrea Arcangeli struct rb_root *root) 14372c653d0eSAndrea Arcangeli { 14382c653d0eSAndrea Arcangeli if (!is_stable_node_chain(stable_node)) 14392c653d0eSAndrea Arcangeli return stable_node; 14402c653d0eSAndrea Arcangeli if (hlist_empty(&stable_node->hlist)) { 14412c653d0eSAndrea Arcangeli free_stable_node_chain(stable_node, root); 14422c653d0eSAndrea Arcangeli return NULL; 14432c653d0eSAndrea Arcangeli } 14442c653d0eSAndrea Arcangeli return hlist_entry(stable_node->hlist.first, 14452c653d0eSAndrea Arcangeli typeof(*stable_node), hlist_dup); 14462c653d0eSAndrea Arcangeli } 14472c653d0eSAndrea Arcangeli 14488dc5ffcdSAndrea Arcangeli /* 14498dc5ffcdSAndrea Arcangeli * Like for get_ksm_page, this function can free the *_stable_node and 14508dc5ffcdSAndrea Arcangeli * *_stable_node_dup if the returned tree_page is NULL. 14518dc5ffcdSAndrea Arcangeli * 14528dc5ffcdSAndrea Arcangeli * It can also free and overwrite *_stable_node with the found 14538dc5ffcdSAndrea Arcangeli * stable_node_dup if the chain is collapsed (in which case 14548dc5ffcdSAndrea Arcangeli * *_stable_node will be equal to *_stable_node_dup like if the chain 14558dc5ffcdSAndrea Arcangeli * never existed). It's up to the caller to verify tree_page is not 14568dc5ffcdSAndrea Arcangeli * NULL before dereferencing *_stable_node or *_stable_node_dup. 14578dc5ffcdSAndrea Arcangeli * 14588dc5ffcdSAndrea Arcangeli * *_stable_node_dup is really a second output parameter of this 14598dc5ffcdSAndrea Arcangeli * function and will be overwritten in all cases, the caller doesn't 14608dc5ffcdSAndrea Arcangeli * need to initialize it. 14618dc5ffcdSAndrea Arcangeli */ 14628dc5ffcdSAndrea Arcangeli static struct page *__stable_node_chain(struct stable_node **_stable_node_dup, 14638dc5ffcdSAndrea Arcangeli struct stable_node **_stable_node, 14642c653d0eSAndrea Arcangeli struct rb_root *root, 14652c653d0eSAndrea Arcangeli bool prune_stale_stable_nodes) 14662c653d0eSAndrea Arcangeli { 1467b4fecc67SAndrea Arcangeli struct stable_node *stable_node = *_stable_node; 14682c653d0eSAndrea Arcangeli if (!is_stable_node_chain(stable_node)) { 14692c653d0eSAndrea Arcangeli if (is_page_sharing_candidate(stable_node)) { 14708dc5ffcdSAndrea Arcangeli *_stable_node_dup = stable_node; 14718dc5ffcdSAndrea Arcangeli return get_ksm_page(stable_node, false); 14722c653d0eSAndrea Arcangeli } 14738dc5ffcdSAndrea Arcangeli /* 14748dc5ffcdSAndrea Arcangeli * _stable_node_dup set to NULL means the stable_node 14758dc5ffcdSAndrea Arcangeli * reached the ksm_max_page_sharing limit. 14768dc5ffcdSAndrea Arcangeli */ 14778dc5ffcdSAndrea Arcangeli *_stable_node_dup = NULL; 14782c653d0eSAndrea Arcangeli return NULL; 14792c653d0eSAndrea Arcangeli } 14808dc5ffcdSAndrea Arcangeli return stable_node_dup(_stable_node_dup, _stable_node, root, 14812c653d0eSAndrea Arcangeli prune_stale_stable_nodes); 14822c653d0eSAndrea Arcangeli } 14832c653d0eSAndrea Arcangeli 14848dc5ffcdSAndrea Arcangeli static __always_inline struct page *chain_prune(struct stable_node **s_n_d, 14858dc5ffcdSAndrea Arcangeli struct stable_node **s_n, 14862c653d0eSAndrea Arcangeli struct rb_root *root) 14872c653d0eSAndrea Arcangeli { 14888dc5ffcdSAndrea Arcangeli return __stable_node_chain(s_n_d, s_n, root, true); 14892c653d0eSAndrea Arcangeli } 14902c653d0eSAndrea Arcangeli 14918dc5ffcdSAndrea Arcangeli static __always_inline struct page *chain(struct stable_node **s_n_d, 14928dc5ffcdSAndrea Arcangeli struct stable_node *s_n, 14932c653d0eSAndrea Arcangeli struct rb_root *root) 14942c653d0eSAndrea Arcangeli { 14958dc5ffcdSAndrea Arcangeli struct stable_node *old_stable_node = s_n; 14968dc5ffcdSAndrea Arcangeli struct page *tree_page; 14978dc5ffcdSAndrea Arcangeli 14988dc5ffcdSAndrea Arcangeli tree_page = __stable_node_chain(s_n_d, &s_n, root, false); 14998dc5ffcdSAndrea Arcangeli /* not pruning dups so s_n cannot have changed */ 15008dc5ffcdSAndrea Arcangeli VM_BUG_ON(s_n != old_stable_node); 15018dc5ffcdSAndrea Arcangeli return tree_page; 15022c653d0eSAndrea Arcangeli } 15032c653d0eSAndrea Arcangeli 150431dbd01fSIzik Eidus /* 15058dd3557aSHugh Dickins * stable_tree_search - search for page inside the stable tree 150631dbd01fSIzik Eidus * 150731dbd01fSIzik Eidus * This function checks if there is a page inside the stable tree 150831dbd01fSIzik Eidus * with identical content to the page that we are scanning right now. 150931dbd01fSIzik Eidus * 15107b6ba2c7SHugh Dickins * This function returns the stable tree node of identical content if found, 151131dbd01fSIzik Eidus * NULL otherwise. 151231dbd01fSIzik Eidus */ 151362b61f61SHugh Dickins static struct page *stable_tree_search(struct page *page) 151431dbd01fSIzik Eidus { 151590bd6fd3SPetr Holasek int nid; 1516ef53d16cSHugh Dickins struct rb_root *root; 15174146d2d6SHugh Dickins struct rb_node **new; 15184146d2d6SHugh Dickins struct rb_node *parent; 15192c653d0eSAndrea Arcangeli struct stable_node *stable_node, *stable_node_dup, *stable_node_any; 15204146d2d6SHugh Dickins struct stable_node *page_node; 152131dbd01fSIzik Eidus 15224146d2d6SHugh Dickins page_node = page_stable_node(page); 15234146d2d6SHugh Dickins if (page_node && page_node->head != &migrate_nodes) { 15244146d2d6SHugh Dickins /* ksm page forked */ 152508beca44SHugh Dickins get_page(page); 152662b61f61SHugh Dickins return page; 152708beca44SHugh Dickins } 152808beca44SHugh Dickins 152990bd6fd3SPetr Holasek nid = get_kpfn_nid(page_to_pfn(page)); 1530ef53d16cSHugh Dickins root = root_stable_tree + nid; 15314146d2d6SHugh Dickins again: 1532ef53d16cSHugh Dickins new = &root->rb_node; 15334146d2d6SHugh Dickins parent = NULL; 153490bd6fd3SPetr Holasek 15354146d2d6SHugh Dickins while (*new) { 15364035c07aSHugh Dickins struct page *tree_page; 153731dbd01fSIzik Eidus int ret; 153831dbd01fSIzik Eidus 153931dbd01fSIzik Eidus cond_resched(); 15404146d2d6SHugh Dickins stable_node = rb_entry(*new, struct stable_node, node); 15412c653d0eSAndrea Arcangeli stable_node_any = NULL; 15428dc5ffcdSAndrea Arcangeli tree_page = chain_prune(&stable_node_dup, &stable_node, root); 1543b4fecc67SAndrea Arcangeli /* 1544b4fecc67SAndrea Arcangeli * NOTE: stable_node may have been freed by 1545b4fecc67SAndrea Arcangeli * chain_prune() if the returned stable_node_dup is 1546b4fecc67SAndrea Arcangeli * not NULL. stable_node_dup may have been inserted in 1547b4fecc67SAndrea Arcangeli * the rbtree instead as a regular stable_node (in 1548b4fecc67SAndrea Arcangeli * order to collapse the stable_node chain if a single 15490ba1d0f7SAndrea Arcangeli * stable_node dup was found in it). In such case the 15500ba1d0f7SAndrea Arcangeli * stable_node is overwritten by the calleee to point 15510ba1d0f7SAndrea Arcangeli * to the stable_node_dup that was collapsed in the 15520ba1d0f7SAndrea Arcangeli * stable rbtree and stable_node will be equal to 15530ba1d0f7SAndrea Arcangeli * stable_node_dup like if the chain never existed. 1554b4fecc67SAndrea Arcangeli */ 15552c653d0eSAndrea Arcangeli if (!stable_node_dup) { 15562c653d0eSAndrea Arcangeli /* 15572c653d0eSAndrea Arcangeli * Either all stable_node dups were full in 15582c653d0eSAndrea Arcangeli * this stable_node chain, or this chain was 15592c653d0eSAndrea Arcangeli * empty and should be rb_erased. 15602c653d0eSAndrea Arcangeli */ 15612c653d0eSAndrea Arcangeli stable_node_any = stable_node_dup_any(stable_node, 15622c653d0eSAndrea Arcangeli root); 15632c653d0eSAndrea Arcangeli if (!stable_node_any) { 15642c653d0eSAndrea Arcangeli /* rb_erase just run */ 15652c653d0eSAndrea Arcangeli goto again; 15662c653d0eSAndrea Arcangeli } 15672c653d0eSAndrea Arcangeli /* 15682c653d0eSAndrea Arcangeli * Take any of the stable_node dups page of 15692c653d0eSAndrea Arcangeli * this stable_node chain to let the tree walk 15702c653d0eSAndrea Arcangeli * continue. All KSM pages belonging to the 15712c653d0eSAndrea Arcangeli * stable_node dups in a stable_node chain 15722c653d0eSAndrea Arcangeli * have the same content and they're 15732c653d0eSAndrea Arcangeli * wrprotected at all times. Any will work 15742c653d0eSAndrea Arcangeli * fine to continue the walk. 15752c653d0eSAndrea Arcangeli */ 15762c653d0eSAndrea Arcangeli tree_page = get_ksm_page(stable_node_any, false); 15772c653d0eSAndrea Arcangeli } 15782c653d0eSAndrea Arcangeli VM_BUG_ON(!stable_node_dup ^ !!stable_node_any); 1579f2e5ff85SAndrea Arcangeli if (!tree_page) { 1580f2e5ff85SAndrea Arcangeli /* 1581f2e5ff85SAndrea Arcangeli * If we walked over a stale stable_node, 1582f2e5ff85SAndrea Arcangeli * get_ksm_page() will call rb_erase() and it 1583f2e5ff85SAndrea Arcangeli * may rebalance the tree from under us. So 1584f2e5ff85SAndrea Arcangeli * restart the search from scratch. Returning 1585f2e5ff85SAndrea Arcangeli * NULL would be safe too, but we'd generate 1586f2e5ff85SAndrea Arcangeli * false negative insertions just because some 1587f2e5ff85SAndrea Arcangeli * stable_node was stale. 1588f2e5ff85SAndrea Arcangeli */ 1589f2e5ff85SAndrea Arcangeli goto again; 1590f2e5ff85SAndrea Arcangeli } 159131dbd01fSIzik Eidus 15924035c07aSHugh Dickins ret = memcmp_pages(page, tree_page); 1593c8d6553bSHugh Dickins put_page(tree_page); 159431dbd01fSIzik Eidus 15954146d2d6SHugh Dickins parent = *new; 1596c8d6553bSHugh Dickins if (ret < 0) 15974146d2d6SHugh Dickins new = &parent->rb_left; 1598c8d6553bSHugh Dickins else if (ret > 0) 15994146d2d6SHugh Dickins new = &parent->rb_right; 1600c8d6553bSHugh Dickins else { 16012c653d0eSAndrea Arcangeli if (page_node) { 16022c653d0eSAndrea Arcangeli VM_BUG_ON(page_node->head != &migrate_nodes); 16032c653d0eSAndrea Arcangeli /* 16042c653d0eSAndrea Arcangeli * Test if the migrated page should be merged 16052c653d0eSAndrea Arcangeli * into a stable node dup. If the mapcount is 16062c653d0eSAndrea Arcangeli * 1 we can migrate it with another KSM page 16072c653d0eSAndrea Arcangeli * without adding it to the chain. 16082c653d0eSAndrea Arcangeli */ 16092c653d0eSAndrea Arcangeli if (page_mapcount(page) > 1) 16102c653d0eSAndrea Arcangeli goto chain_append; 16112c653d0eSAndrea Arcangeli } 16122c653d0eSAndrea Arcangeli 16132c653d0eSAndrea Arcangeli if (!stable_node_dup) { 16142c653d0eSAndrea Arcangeli /* 16152c653d0eSAndrea Arcangeli * If the stable_node is a chain and 16162c653d0eSAndrea Arcangeli * we got a payload match in memcmp 16172c653d0eSAndrea Arcangeli * but we cannot merge the scanned 16182c653d0eSAndrea Arcangeli * page in any of the existing 16192c653d0eSAndrea Arcangeli * stable_node dups because they're 16202c653d0eSAndrea Arcangeli * all full, we need to wait the 16212c653d0eSAndrea Arcangeli * scanned page to find itself a match 16222c653d0eSAndrea Arcangeli * in the unstable tree to create a 16232c653d0eSAndrea Arcangeli * brand new KSM page to add later to 16242c653d0eSAndrea Arcangeli * the dups of this stable_node. 16252c653d0eSAndrea Arcangeli */ 16262c653d0eSAndrea Arcangeli return NULL; 16272c653d0eSAndrea Arcangeli } 16282c653d0eSAndrea Arcangeli 1629c8d6553bSHugh Dickins /* 1630c8d6553bSHugh Dickins * Lock and unlock the stable_node's page (which 1631c8d6553bSHugh Dickins * might already have been migrated) so that page 1632c8d6553bSHugh Dickins * migration is sure to notice its raised count. 1633c8d6553bSHugh Dickins * It would be more elegant to return stable_node 1634c8d6553bSHugh Dickins * than kpage, but that involves more changes. 1635c8d6553bSHugh Dickins */ 16362c653d0eSAndrea Arcangeli tree_page = get_ksm_page(stable_node_dup, true); 16372c653d0eSAndrea Arcangeli if (unlikely(!tree_page)) 16382c653d0eSAndrea Arcangeli /* 16392c653d0eSAndrea Arcangeli * The tree may have been rebalanced, 16402c653d0eSAndrea Arcangeli * so re-evaluate parent and new. 16412c653d0eSAndrea Arcangeli */ 16422c653d0eSAndrea Arcangeli goto again; 1643c8d6553bSHugh Dickins unlock_page(tree_page); 16442c653d0eSAndrea Arcangeli 16452c653d0eSAndrea Arcangeli if (get_kpfn_nid(stable_node_dup->kpfn) != 16462c653d0eSAndrea Arcangeli NUMA(stable_node_dup->nid)) { 16474146d2d6SHugh Dickins put_page(tree_page); 16484146d2d6SHugh Dickins goto replace; 16494146d2d6SHugh Dickins } 165062b61f61SHugh Dickins return tree_page; 165131dbd01fSIzik Eidus } 1652c8d6553bSHugh Dickins } 165331dbd01fSIzik Eidus 16544146d2d6SHugh Dickins if (!page_node) 165531dbd01fSIzik Eidus return NULL; 16564146d2d6SHugh Dickins 16574146d2d6SHugh Dickins list_del(&page_node->list); 16584146d2d6SHugh Dickins DO_NUMA(page_node->nid = nid); 16594146d2d6SHugh Dickins rb_link_node(&page_node->node, parent, new); 1660ef53d16cSHugh Dickins rb_insert_color(&page_node->node, root); 16612c653d0eSAndrea Arcangeli out: 16622c653d0eSAndrea Arcangeli if (is_page_sharing_candidate(page_node)) { 16634146d2d6SHugh Dickins get_page(page); 16644146d2d6SHugh Dickins return page; 16652c653d0eSAndrea Arcangeli } else 16662c653d0eSAndrea Arcangeli return NULL; 16674146d2d6SHugh Dickins 16684146d2d6SHugh Dickins replace: 1669b4fecc67SAndrea Arcangeli /* 1670b4fecc67SAndrea Arcangeli * If stable_node was a chain and chain_prune collapsed it, 16710ba1d0f7SAndrea Arcangeli * stable_node has been updated to be the new regular 16720ba1d0f7SAndrea Arcangeli * stable_node. A collapse of the chain is indistinguishable 16730ba1d0f7SAndrea Arcangeli * from the case there was no chain in the stable 16740ba1d0f7SAndrea Arcangeli * rbtree. Otherwise stable_node is the chain and 16750ba1d0f7SAndrea Arcangeli * stable_node_dup is the dup to replace. 1676b4fecc67SAndrea Arcangeli */ 16770ba1d0f7SAndrea Arcangeli if (stable_node_dup == stable_node) { 1678b4fecc67SAndrea Arcangeli VM_BUG_ON(is_stable_node_chain(stable_node_dup)); 1679b4fecc67SAndrea Arcangeli VM_BUG_ON(is_stable_node_dup(stable_node_dup)); 16802c653d0eSAndrea Arcangeli /* there is no chain */ 16814146d2d6SHugh Dickins if (page_node) { 16822c653d0eSAndrea Arcangeli VM_BUG_ON(page_node->head != &migrate_nodes); 16834146d2d6SHugh Dickins list_del(&page_node->list); 16844146d2d6SHugh Dickins DO_NUMA(page_node->nid = nid); 1685b4fecc67SAndrea Arcangeli rb_replace_node(&stable_node_dup->node, 1686b4fecc67SAndrea Arcangeli &page_node->node, 16872c653d0eSAndrea Arcangeli root); 16882c653d0eSAndrea Arcangeli if (is_page_sharing_candidate(page_node)) 16894146d2d6SHugh Dickins get_page(page); 16902c653d0eSAndrea Arcangeli else 16912c653d0eSAndrea Arcangeli page = NULL; 16924146d2d6SHugh Dickins } else { 1693b4fecc67SAndrea Arcangeli rb_erase(&stable_node_dup->node, root); 16944146d2d6SHugh Dickins page = NULL; 16954146d2d6SHugh Dickins } 16962c653d0eSAndrea Arcangeli } else { 16972c653d0eSAndrea Arcangeli VM_BUG_ON(!is_stable_node_chain(stable_node)); 16982c653d0eSAndrea Arcangeli __stable_node_dup_del(stable_node_dup); 16992c653d0eSAndrea Arcangeli if (page_node) { 17002c653d0eSAndrea Arcangeli VM_BUG_ON(page_node->head != &migrate_nodes); 17012c653d0eSAndrea Arcangeli list_del(&page_node->list); 17022c653d0eSAndrea Arcangeli DO_NUMA(page_node->nid = nid); 17032c653d0eSAndrea Arcangeli stable_node_chain_add_dup(page_node, stable_node); 17042c653d0eSAndrea Arcangeli if (is_page_sharing_candidate(page_node)) 17052c653d0eSAndrea Arcangeli get_page(page); 17062c653d0eSAndrea Arcangeli else 17072c653d0eSAndrea Arcangeli page = NULL; 17082c653d0eSAndrea Arcangeli } else { 17092c653d0eSAndrea Arcangeli page = NULL; 17102c653d0eSAndrea Arcangeli } 17112c653d0eSAndrea Arcangeli } 17122c653d0eSAndrea Arcangeli stable_node_dup->head = &migrate_nodes; 17132c653d0eSAndrea Arcangeli list_add(&stable_node_dup->list, stable_node_dup->head); 17144146d2d6SHugh Dickins return page; 17152c653d0eSAndrea Arcangeli 17162c653d0eSAndrea Arcangeli chain_append: 17172c653d0eSAndrea Arcangeli /* stable_node_dup could be null if it reached the limit */ 17182c653d0eSAndrea Arcangeli if (!stable_node_dup) 17192c653d0eSAndrea Arcangeli stable_node_dup = stable_node_any; 1720b4fecc67SAndrea Arcangeli /* 1721b4fecc67SAndrea Arcangeli * If stable_node was a chain and chain_prune collapsed it, 17220ba1d0f7SAndrea Arcangeli * stable_node has been updated to be the new regular 17230ba1d0f7SAndrea Arcangeli * stable_node. A collapse of the chain is indistinguishable 17240ba1d0f7SAndrea Arcangeli * from the case there was no chain in the stable 17250ba1d0f7SAndrea Arcangeli * rbtree. Otherwise stable_node is the chain and 17260ba1d0f7SAndrea Arcangeli * stable_node_dup is the dup to replace. 1727b4fecc67SAndrea Arcangeli */ 17280ba1d0f7SAndrea Arcangeli if (stable_node_dup == stable_node) { 1729b4fecc67SAndrea Arcangeli VM_BUG_ON(is_stable_node_chain(stable_node_dup)); 1730b4fecc67SAndrea Arcangeli VM_BUG_ON(is_stable_node_dup(stable_node_dup)); 17312c653d0eSAndrea Arcangeli /* chain is missing so create it */ 17322c653d0eSAndrea Arcangeli stable_node = alloc_stable_node_chain(stable_node_dup, 17332c653d0eSAndrea Arcangeli root); 17342c653d0eSAndrea Arcangeli if (!stable_node) 17352c653d0eSAndrea Arcangeli return NULL; 17362c653d0eSAndrea Arcangeli } 17372c653d0eSAndrea Arcangeli /* 17382c653d0eSAndrea Arcangeli * Add this stable_node dup that was 17392c653d0eSAndrea Arcangeli * migrated to the stable_node chain 17402c653d0eSAndrea Arcangeli * of the current nid for this page 17412c653d0eSAndrea Arcangeli * content. 17422c653d0eSAndrea Arcangeli */ 1743b4fecc67SAndrea Arcangeli VM_BUG_ON(!is_stable_node_chain(stable_node)); 1744b4fecc67SAndrea Arcangeli VM_BUG_ON(!is_stable_node_dup(stable_node_dup)); 17452c653d0eSAndrea Arcangeli VM_BUG_ON(page_node->head != &migrate_nodes); 17462c653d0eSAndrea Arcangeli list_del(&page_node->list); 17472c653d0eSAndrea Arcangeli DO_NUMA(page_node->nid = nid); 17482c653d0eSAndrea Arcangeli stable_node_chain_add_dup(page_node, stable_node); 17492c653d0eSAndrea Arcangeli goto out; 175031dbd01fSIzik Eidus } 175131dbd01fSIzik Eidus 175231dbd01fSIzik Eidus /* 1753e850dcf5SHugh Dickins * stable_tree_insert - insert stable tree node pointing to new ksm page 175431dbd01fSIzik Eidus * into the stable tree. 175531dbd01fSIzik Eidus * 17567b6ba2c7SHugh Dickins * This function returns the stable tree node just allocated on success, 17577b6ba2c7SHugh Dickins * NULL otherwise. 175831dbd01fSIzik Eidus */ 17597b6ba2c7SHugh Dickins static struct stable_node *stable_tree_insert(struct page *kpage) 176031dbd01fSIzik Eidus { 176190bd6fd3SPetr Holasek int nid; 176290bd6fd3SPetr Holasek unsigned long kpfn; 1763ef53d16cSHugh Dickins struct rb_root *root; 176490bd6fd3SPetr Holasek struct rb_node **new; 1765f2e5ff85SAndrea Arcangeli struct rb_node *parent; 17662c653d0eSAndrea Arcangeli struct stable_node *stable_node, *stable_node_dup, *stable_node_any; 17672c653d0eSAndrea Arcangeli bool need_chain = false; 176831dbd01fSIzik Eidus 176990bd6fd3SPetr Holasek kpfn = page_to_pfn(kpage); 177090bd6fd3SPetr Holasek nid = get_kpfn_nid(kpfn); 1771ef53d16cSHugh Dickins root = root_stable_tree + nid; 1772f2e5ff85SAndrea Arcangeli again: 1773f2e5ff85SAndrea Arcangeli parent = NULL; 1774ef53d16cSHugh Dickins new = &root->rb_node; 177590bd6fd3SPetr Holasek 177631dbd01fSIzik Eidus while (*new) { 17774035c07aSHugh Dickins struct page *tree_page; 177831dbd01fSIzik Eidus int ret; 177931dbd01fSIzik Eidus 178031dbd01fSIzik Eidus cond_resched(); 178108beca44SHugh Dickins stable_node = rb_entry(*new, struct stable_node, node); 17822c653d0eSAndrea Arcangeli stable_node_any = NULL; 17838dc5ffcdSAndrea Arcangeli tree_page = chain(&stable_node_dup, stable_node, root); 17842c653d0eSAndrea Arcangeli if (!stable_node_dup) { 17852c653d0eSAndrea Arcangeli /* 17862c653d0eSAndrea Arcangeli * Either all stable_node dups were full in 17872c653d0eSAndrea Arcangeli * this stable_node chain, or this chain was 17882c653d0eSAndrea Arcangeli * empty and should be rb_erased. 17892c653d0eSAndrea Arcangeli */ 17902c653d0eSAndrea Arcangeli stable_node_any = stable_node_dup_any(stable_node, 17912c653d0eSAndrea Arcangeli root); 17922c653d0eSAndrea Arcangeli if (!stable_node_any) { 17932c653d0eSAndrea Arcangeli /* rb_erase just run */ 17942c653d0eSAndrea Arcangeli goto again; 17952c653d0eSAndrea Arcangeli } 17962c653d0eSAndrea Arcangeli /* 17972c653d0eSAndrea Arcangeli * Take any of the stable_node dups page of 17982c653d0eSAndrea Arcangeli * this stable_node chain to let the tree walk 17992c653d0eSAndrea Arcangeli * continue. All KSM pages belonging to the 18002c653d0eSAndrea Arcangeli * stable_node dups in a stable_node chain 18012c653d0eSAndrea Arcangeli * have the same content and they're 18022c653d0eSAndrea Arcangeli * wrprotected at all times. Any will work 18032c653d0eSAndrea Arcangeli * fine to continue the walk. 18042c653d0eSAndrea Arcangeli */ 18052c653d0eSAndrea Arcangeli tree_page = get_ksm_page(stable_node_any, false); 18062c653d0eSAndrea Arcangeli } 18072c653d0eSAndrea Arcangeli VM_BUG_ON(!stable_node_dup ^ !!stable_node_any); 1808f2e5ff85SAndrea Arcangeli if (!tree_page) { 1809f2e5ff85SAndrea Arcangeli /* 1810f2e5ff85SAndrea Arcangeli * If we walked over a stale stable_node, 1811f2e5ff85SAndrea Arcangeli * get_ksm_page() will call rb_erase() and it 1812f2e5ff85SAndrea Arcangeli * may rebalance the tree from under us. So 1813f2e5ff85SAndrea Arcangeli * restart the search from scratch. Returning 1814f2e5ff85SAndrea Arcangeli * NULL would be safe too, but we'd generate 1815f2e5ff85SAndrea Arcangeli * false negative insertions just because some 1816f2e5ff85SAndrea Arcangeli * stable_node was stale. 1817f2e5ff85SAndrea Arcangeli */ 1818f2e5ff85SAndrea Arcangeli goto again; 1819f2e5ff85SAndrea Arcangeli } 182031dbd01fSIzik Eidus 18214035c07aSHugh Dickins ret = memcmp_pages(kpage, tree_page); 18224035c07aSHugh Dickins put_page(tree_page); 182331dbd01fSIzik Eidus 182431dbd01fSIzik Eidus parent = *new; 182531dbd01fSIzik Eidus if (ret < 0) 182631dbd01fSIzik Eidus new = &parent->rb_left; 182731dbd01fSIzik Eidus else if (ret > 0) 182831dbd01fSIzik Eidus new = &parent->rb_right; 182931dbd01fSIzik Eidus else { 18302c653d0eSAndrea Arcangeli need_chain = true; 18312c653d0eSAndrea Arcangeli break; 183231dbd01fSIzik Eidus } 183331dbd01fSIzik Eidus } 183431dbd01fSIzik Eidus 18352c653d0eSAndrea Arcangeli stable_node_dup = alloc_stable_node(); 18362c653d0eSAndrea Arcangeli if (!stable_node_dup) 18377b6ba2c7SHugh Dickins return NULL; 183831dbd01fSIzik Eidus 18392c653d0eSAndrea Arcangeli INIT_HLIST_HEAD(&stable_node_dup->hlist); 18402c653d0eSAndrea Arcangeli stable_node_dup->kpfn = kpfn; 18412c653d0eSAndrea Arcangeli set_page_stable_node(kpage, stable_node_dup); 18422c653d0eSAndrea Arcangeli stable_node_dup->rmap_hlist_len = 0; 18432c653d0eSAndrea Arcangeli DO_NUMA(stable_node_dup->nid = nid); 18442c653d0eSAndrea Arcangeli if (!need_chain) { 18452c653d0eSAndrea Arcangeli rb_link_node(&stable_node_dup->node, parent, new); 18462c653d0eSAndrea Arcangeli rb_insert_color(&stable_node_dup->node, root); 18472c653d0eSAndrea Arcangeli } else { 18482c653d0eSAndrea Arcangeli if (!is_stable_node_chain(stable_node)) { 18492c653d0eSAndrea Arcangeli struct stable_node *orig = stable_node; 18502c653d0eSAndrea Arcangeli /* chain is missing so create it */ 18512c653d0eSAndrea Arcangeli stable_node = alloc_stable_node_chain(orig, root); 18522c653d0eSAndrea Arcangeli if (!stable_node) { 18532c653d0eSAndrea Arcangeli free_stable_node(stable_node_dup); 18542c653d0eSAndrea Arcangeli return NULL; 18552c653d0eSAndrea Arcangeli } 18562c653d0eSAndrea Arcangeli } 18572c653d0eSAndrea Arcangeli stable_node_chain_add_dup(stable_node_dup, stable_node); 18582c653d0eSAndrea Arcangeli } 185908beca44SHugh Dickins 18602c653d0eSAndrea Arcangeli return stable_node_dup; 186131dbd01fSIzik Eidus } 186231dbd01fSIzik Eidus 186331dbd01fSIzik Eidus /* 18648dd3557aSHugh Dickins * unstable_tree_search_insert - search for identical page, 18658dd3557aSHugh Dickins * else insert rmap_item into the unstable tree. 186631dbd01fSIzik Eidus * 186731dbd01fSIzik Eidus * This function searches for a page in the unstable tree identical to the 186831dbd01fSIzik Eidus * page currently being scanned; and if no identical page is found in the 186931dbd01fSIzik Eidus * tree, we insert rmap_item as a new object into the unstable tree. 187031dbd01fSIzik Eidus * 187131dbd01fSIzik Eidus * This function returns pointer to rmap_item found to be identical 187231dbd01fSIzik Eidus * to the currently scanned page, NULL otherwise. 187331dbd01fSIzik Eidus * 187431dbd01fSIzik Eidus * This function does both searching and inserting, because they share 187531dbd01fSIzik Eidus * the same walking algorithm in an rbtree. 187631dbd01fSIzik Eidus */ 18778dd3557aSHugh Dickins static 18788dd3557aSHugh Dickins struct rmap_item *unstable_tree_search_insert(struct rmap_item *rmap_item, 18798dd3557aSHugh Dickins struct page *page, 18808dd3557aSHugh Dickins struct page **tree_pagep) 188131dbd01fSIzik Eidus { 188290bd6fd3SPetr Holasek struct rb_node **new; 188390bd6fd3SPetr Holasek struct rb_root *root; 188431dbd01fSIzik Eidus struct rb_node *parent = NULL; 188590bd6fd3SPetr Holasek int nid; 188690bd6fd3SPetr Holasek 188790bd6fd3SPetr Holasek nid = get_kpfn_nid(page_to_pfn(page)); 1888ef53d16cSHugh Dickins root = root_unstable_tree + nid; 188990bd6fd3SPetr Holasek new = &root->rb_node; 189031dbd01fSIzik Eidus 189131dbd01fSIzik Eidus while (*new) { 189231dbd01fSIzik Eidus struct rmap_item *tree_rmap_item; 18938dd3557aSHugh Dickins struct page *tree_page; 189431dbd01fSIzik Eidus int ret; 189531dbd01fSIzik Eidus 1896d178f27fSHugh Dickins cond_resched(); 189731dbd01fSIzik Eidus tree_rmap_item = rb_entry(*new, struct rmap_item, node); 18988dd3557aSHugh Dickins tree_page = get_mergeable_page(tree_rmap_item); 1899c8f95ed1SAndrea Arcangeli if (!tree_page) 190031dbd01fSIzik Eidus return NULL; 190131dbd01fSIzik Eidus 190231dbd01fSIzik Eidus /* 19038dd3557aSHugh Dickins * Don't substitute a ksm page for a forked page. 190431dbd01fSIzik Eidus */ 19058dd3557aSHugh Dickins if (page == tree_page) { 19068dd3557aSHugh Dickins put_page(tree_page); 190731dbd01fSIzik Eidus return NULL; 190831dbd01fSIzik Eidus } 190931dbd01fSIzik Eidus 19108dd3557aSHugh Dickins ret = memcmp_pages(page, tree_page); 191131dbd01fSIzik Eidus 191231dbd01fSIzik Eidus parent = *new; 191331dbd01fSIzik Eidus if (ret < 0) { 19148dd3557aSHugh Dickins put_page(tree_page); 191531dbd01fSIzik Eidus new = &parent->rb_left; 191631dbd01fSIzik Eidus } else if (ret > 0) { 19178dd3557aSHugh Dickins put_page(tree_page); 191831dbd01fSIzik Eidus new = &parent->rb_right; 1919b599cbdfSHugh Dickins } else if (!ksm_merge_across_nodes && 1920b599cbdfSHugh Dickins page_to_nid(tree_page) != nid) { 1921b599cbdfSHugh Dickins /* 1922b599cbdfSHugh Dickins * If tree_page has been migrated to another NUMA node, 1923b599cbdfSHugh Dickins * it will be flushed out and put in the right unstable 1924b599cbdfSHugh Dickins * tree next time: only merge with it when across_nodes. 1925b599cbdfSHugh Dickins */ 1926b599cbdfSHugh Dickins put_page(tree_page); 1927b599cbdfSHugh Dickins return NULL; 192831dbd01fSIzik Eidus } else { 19298dd3557aSHugh Dickins *tree_pagep = tree_page; 193031dbd01fSIzik Eidus return tree_rmap_item; 193131dbd01fSIzik Eidus } 193231dbd01fSIzik Eidus } 193331dbd01fSIzik Eidus 19347b6ba2c7SHugh Dickins rmap_item->address |= UNSTABLE_FLAG; 193531dbd01fSIzik Eidus rmap_item->address |= (ksm_scan.seqnr & SEQNR_MASK); 1936e850dcf5SHugh Dickins DO_NUMA(rmap_item->nid = nid); 193731dbd01fSIzik Eidus rb_link_node(&rmap_item->node, parent, new); 193890bd6fd3SPetr Holasek rb_insert_color(&rmap_item->node, root); 193931dbd01fSIzik Eidus 1940473b0ce4SHugh Dickins ksm_pages_unshared++; 194131dbd01fSIzik Eidus return NULL; 194231dbd01fSIzik Eidus } 194331dbd01fSIzik Eidus 194431dbd01fSIzik Eidus /* 194531dbd01fSIzik Eidus * stable_tree_append - add another rmap_item to the linked list of 194631dbd01fSIzik Eidus * rmap_items hanging off a given node of the stable tree, all sharing 194731dbd01fSIzik Eidus * the same ksm page. 194831dbd01fSIzik Eidus */ 194931dbd01fSIzik Eidus static void stable_tree_append(struct rmap_item *rmap_item, 19502c653d0eSAndrea Arcangeli struct stable_node *stable_node, 19512c653d0eSAndrea Arcangeli bool max_page_sharing_bypass) 195231dbd01fSIzik Eidus { 19532c653d0eSAndrea Arcangeli /* 19542c653d0eSAndrea Arcangeli * rmap won't find this mapping if we don't insert the 19552c653d0eSAndrea Arcangeli * rmap_item in the right stable_node 19562c653d0eSAndrea Arcangeli * duplicate. page_migration could break later if rmap breaks, 19572c653d0eSAndrea Arcangeli * so we can as well crash here. We really need to check for 19582c653d0eSAndrea Arcangeli * rmap_hlist_len == STABLE_NODE_CHAIN, but we can as well check 19592c653d0eSAndrea Arcangeli * for other negative values as an undeflow if detected here 19602c653d0eSAndrea Arcangeli * for the first time (and not when decreasing rmap_hlist_len) 19612c653d0eSAndrea Arcangeli * would be sign of memory corruption in the stable_node. 19622c653d0eSAndrea Arcangeli */ 19632c653d0eSAndrea Arcangeli BUG_ON(stable_node->rmap_hlist_len < 0); 19642c653d0eSAndrea Arcangeli 19652c653d0eSAndrea Arcangeli stable_node->rmap_hlist_len++; 19662c653d0eSAndrea Arcangeli if (!max_page_sharing_bypass) 19672c653d0eSAndrea Arcangeli /* possibly non fatal but unexpected overflow, only warn */ 19682c653d0eSAndrea Arcangeli WARN_ON_ONCE(stable_node->rmap_hlist_len > 19692c653d0eSAndrea Arcangeli ksm_max_page_sharing); 19702c653d0eSAndrea Arcangeli 19717b6ba2c7SHugh Dickins rmap_item->head = stable_node; 197231dbd01fSIzik Eidus rmap_item->address |= STABLE_FLAG; 19737b6ba2c7SHugh Dickins hlist_add_head(&rmap_item->hlist, &stable_node->hlist); 1974e178dfdeSHugh Dickins 19757b6ba2c7SHugh Dickins if (rmap_item->hlist.next) 1976e178dfdeSHugh Dickins ksm_pages_sharing++; 19777b6ba2c7SHugh Dickins else 19787b6ba2c7SHugh Dickins ksm_pages_shared++; 197931dbd01fSIzik Eidus } 198031dbd01fSIzik Eidus 198131dbd01fSIzik Eidus /* 198281464e30SHugh Dickins * cmp_and_merge_page - first see if page can be merged into the stable tree; 198381464e30SHugh Dickins * if not, compare checksum to previous and if it's the same, see if page can 198481464e30SHugh Dickins * be inserted into the unstable tree, or merged with a page already there and 198581464e30SHugh Dickins * both transferred to the stable tree. 198631dbd01fSIzik Eidus * 198731dbd01fSIzik Eidus * @page: the page that we are searching identical page to. 198831dbd01fSIzik Eidus * @rmap_item: the reverse mapping into the virtual address of this page 198931dbd01fSIzik Eidus */ 199031dbd01fSIzik Eidus static void cmp_and_merge_page(struct page *page, struct rmap_item *rmap_item) 199131dbd01fSIzik Eidus { 199231dbd01fSIzik Eidus struct rmap_item *tree_rmap_item; 19938dd3557aSHugh Dickins struct page *tree_page = NULL; 19947b6ba2c7SHugh Dickins struct stable_node *stable_node; 19958dd3557aSHugh Dickins struct page *kpage; 199631dbd01fSIzik Eidus unsigned int checksum; 199731dbd01fSIzik Eidus int err; 19982c653d0eSAndrea Arcangeli bool max_page_sharing_bypass = false; 199931dbd01fSIzik Eidus 20004146d2d6SHugh Dickins stable_node = page_stable_node(page); 20014146d2d6SHugh Dickins if (stable_node) { 20024146d2d6SHugh Dickins if (stable_node->head != &migrate_nodes && 20032c653d0eSAndrea Arcangeli get_kpfn_nid(READ_ONCE(stable_node->kpfn)) != 20042c653d0eSAndrea Arcangeli NUMA(stable_node->nid)) { 20052c653d0eSAndrea Arcangeli stable_node_dup_del(stable_node); 20064146d2d6SHugh Dickins stable_node->head = &migrate_nodes; 20074146d2d6SHugh Dickins list_add(&stable_node->list, stable_node->head); 20084146d2d6SHugh Dickins } 20094146d2d6SHugh Dickins if (stable_node->head != &migrate_nodes && 20104146d2d6SHugh Dickins rmap_item->head == stable_node) 20114146d2d6SHugh Dickins return; 20122c653d0eSAndrea Arcangeli /* 20132c653d0eSAndrea Arcangeli * If it's a KSM fork, allow it to go over the sharing limit 20142c653d0eSAndrea Arcangeli * without warnings. 20152c653d0eSAndrea Arcangeli */ 20162c653d0eSAndrea Arcangeli if (!is_page_sharing_candidate(stable_node)) 20172c653d0eSAndrea Arcangeli max_page_sharing_bypass = true; 20184146d2d6SHugh Dickins } 201931dbd01fSIzik Eidus 202031dbd01fSIzik Eidus /* We first start with searching the page inside the stable tree */ 202162b61f61SHugh Dickins kpage = stable_tree_search(page); 20224146d2d6SHugh Dickins if (kpage == page && rmap_item->head == stable_node) { 20234146d2d6SHugh Dickins put_page(kpage); 20244146d2d6SHugh Dickins return; 20254146d2d6SHugh Dickins } 20264146d2d6SHugh Dickins 20274146d2d6SHugh Dickins remove_rmap_item_from_tree(rmap_item); 20284146d2d6SHugh Dickins 202962b61f61SHugh Dickins if (kpage) { 203008beca44SHugh Dickins err = try_to_merge_with_ksm_page(rmap_item, page, kpage); 203131dbd01fSIzik Eidus if (!err) { 203231dbd01fSIzik Eidus /* 203331dbd01fSIzik Eidus * The page was successfully merged: 203431dbd01fSIzik Eidus * add its rmap_item to the stable tree. 203531dbd01fSIzik Eidus */ 20365ad64688SHugh Dickins lock_page(kpage); 20372c653d0eSAndrea Arcangeli stable_tree_append(rmap_item, page_stable_node(kpage), 20382c653d0eSAndrea Arcangeli max_page_sharing_bypass); 20395ad64688SHugh Dickins unlock_page(kpage); 204031dbd01fSIzik Eidus } 20418dd3557aSHugh Dickins put_page(kpage); 204231dbd01fSIzik Eidus return; 204331dbd01fSIzik Eidus } 204431dbd01fSIzik Eidus 204531dbd01fSIzik Eidus /* 20464035c07aSHugh Dickins * If the hash value of the page has changed from the last time 20474035c07aSHugh Dickins * we calculated it, this page is changing frequently: therefore we 20484035c07aSHugh Dickins * don't want to insert it in the unstable tree, and we don't want 20494035c07aSHugh Dickins * to waste our time searching for something identical to it there. 205031dbd01fSIzik Eidus */ 205131dbd01fSIzik Eidus checksum = calc_checksum(page); 205231dbd01fSIzik Eidus if (rmap_item->oldchecksum != checksum) { 205331dbd01fSIzik Eidus rmap_item->oldchecksum = checksum; 205431dbd01fSIzik Eidus return; 205531dbd01fSIzik Eidus } 205631dbd01fSIzik Eidus 2057e86c59b1SClaudio Imbrenda /* 2058e86c59b1SClaudio Imbrenda * Same checksum as an empty page. We attempt to merge it with the 2059e86c59b1SClaudio Imbrenda * appropriate zero page if the user enabled this via sysfs. 2060e86c59b1SClaudio Imbrenda */ 2061e86c59b1SClaudio Imbrenda if (ksm_use_zero_pages && (checksum == zero_checksum)) { 2062e86c59b1SClaudio Imbrenda struct vm_area_struct *vma; 2063e86c59b1SClaudio Imbrenda 2064e86c59b1SClaudio Imbrenda vma = find_mergeable_vma(rmap_item->mm, rmap_item->address); 2065e86c59b1SClaudio Imbrenda err = try_to_merge_one_page(vma, page, 2066e86c59b1SClaudio Imbrenda ZERO_PAGE(rmap_item->address)); 2067e86c59b1SClaudio Imbrenda /* 2068e86c59b1SClaudio Imbrenda * In case of failure, the page was not really empty, so we 2069e86c59b1SClaudio Imbrenda * need to continue. Otherwise we're done. 2070e86c59b1SClaudio Imbrenda */ 2071e86c59b1SClaudio Imbrenda if (!err) 2072e86c59b1SClaudio Imbrenda return; 2073e86c59b1SClaudio Imbrenda } 20748dd3557aSHugh Dickins tree_rmap_item = 20758dd3557aSHugh Dickins unstable_tree_search_insert(rmap_item, page, &tree_page); 207631dbd01fSIzik Eidus if (tree_rmap_item) { 20778dd3557aSHugh Dickins kpage = try_to_merge_two_pages(rmap_item, page, 20788dd3557aSHugh Dickins tree_rmap_item, tree_page); 20798dd3557aSHugh Dickins put_page(tree_page); 20808dd3557aSHugh Dickins if (kpage) { 2081bc56620bSHugh Dickins /* 2082bc56620bSHugh Dickins * The pages were successfully merged: insert new 2083bc56620bSHugh Dickins * node in the stable tree and add both rmap_items. 2084bc56620bSHugh Dickins */ 20855ad64688SHugh Dickins lock_page(kpage); 20867b6ba2c7SHugh Dickins stable_node = stable_tree_insert(kpage); 20877b6ba2c7SHugh Dickins if (stable_node) { 20882c653d0eSAndrea Arcangeli stable_tree_append(tree_rmap_item, stable_node, 20892c653d0eSAndrea Arcangeli false); 20902c653d0eSAndrea Arcangeli stable_tree_append(rmap_item, stable_node, 20912c653d0eSAndrea Arcangeli false); 20927b6ba2c7SHugh Dickins } 20935ad64688SHugh Dickins unlock_page(kpage); 20947b6ba2c7SHugh Dickins 209531dbd01fSIzik Eidus /* 209631dbd01fSIzik Eidus * If we fail to insert the page into the stable tree, 209731dbd01fSIzik Eidus * we will have 2 virtual addresses that are pointing 209831dbd01fSIzik Eidus * to a ksm page left outside the stable tree, 209931dbd01fSIzik Eidus * in which case we need to break_cow on both. 210031dbd01fSIzik Eidus */ 21017b6ba2c7SHugh Dickins if (!stable_node) { 21028dd3557aSHugh Dickins break_cow(tree_rmap_item); 21038dd3557aSHugh Dickins break_cow(rmap_item); 210431dbd01fSIzik Eidus } 210531dbd01fSIzik Eidus } 210631dbd01fSIzik Eidus } 210731dbd01fSIzik Eidus } 210831dbd01fSIzik Eidus 210931dbd01fSIzik Eidus static struct rmap_item *get_next_rmap_item(struct mm_slot *mm_slot, 21106514d511SHugh Dickins struct rmap_item **rmap_list, 211131dbd01fSIzik Eidus unsigned long addr) 211231dbd01fSIzik Eidus { 211331dbd01fSIzik Eidus struct rmap_item *rmap_item; 211431dbd01fSIzik Eidus 21156514d511SHugh Dickins while (*rmap_list) { 21166514d511SHugh Dickins rmap_item = *rmap_list; 211793d17715SHugh Dickins if ((rmap_item->address & PAGE_MASK) == addr) 211831dbd01fSIzik Eidus return rmap_item; 211931dbd01fSIzik Eidus if (rmap_item->address > addr) 212031dbd01fSIzik Eidus break; 21216514d511SHugh Dickins *rmap_list = rmap_item->rmap_list; 212231dbd01fSIzik Eidus remove_rmap_item_from_tree(rmap_item); 212331dbd01fSIzik Eidus free_rmap_item(rmap_item); 212431dbd01fSIzik Eidus } 212531dbd01fSIzik Eidus 212631dbd01fSIzik Eidus rmap_item = alloc_rmap_item(); 212731dbd01fSIzik Eidus if (rmap_item) { 212831dbd01fSIzik Eidus /* It has already been zeroed */ 212931dbd01fSIzik Eidus rmap_item->mm = mm_slot->mm; 213031dbd01fSIzik Eidus rmap_item->address = addr; 21316514d511SHugh Dickins rmap_item->rmap_list = *rmap_list; 21326514d511SHugh Dickins *rmap_list = rmap_item; 213331dbd01fSIzik Eidus } 213431dbd01fSIzik Eidus return rmap_item; 213531dbd01fSIzik Eidus } 213631dbd01fSIzik Eidus 213731dbd01fSIzik Eidus static struct rmap_item *scan_get_next_rmap_item(struct page **page) 213831dbd01fSIzik Eidus { 213931dbd01fSIzik Eidus struct mm_struct *mm; 214031dbd01fSIzik Eidus struct mm_slot *slot; 214131dbd01fSIzik Eidus struct vm_area_struct *vma; 214231dbd01fSIzik Eidus struct rmap_item *rmap_item; 214390bd6fd3SPetr Holasek int nid; 214431dbd01fSIzik Eidus 214531dbd01fSIzik Eidus if (list_empty(&ksm_mm_head.mm_list)) 214631dbd01fSIzik Eidus return NULL; 214731dbd01fSIzik Eidus 214831dbd01fSIzik Eidus slot = ksm_scan.mm_slot; 214931dbd01fSIzik Eidus if (slot == &ksm_mm_head) { 21502919bfd0SHugh Dickins /* 21512919bfd0SHugh Dickins * A number of pages can hang around indefinitely on per-cpu 21522919bfd0SHugh Dickins * pagevecs, raised page count preventing write_protect_page 21532919bfd0SHugh Dickins * from merging them. Though it doesn't really matter much, 21542919bfd0SHugh Dickins * it is puzzling to see some stuck in pages_volatile until 21552919bfd0SHugh Dickins * other activity jostles them out, and they also prevented 21562919bfd0SHugh Dickins * LTP's KSM test from succeeding deterministically; so drain 21572919bfd0SHugh Dickins * them here (here rather than on entry to ksm_do_scan(), 21582919bfd0SHugh Dickins * so we don't IPI too often when pages_to_scan is set low). 21592919bfd0SHugh Dickins */ 21602919bfd0SHugh Dickins lru_add_drain_all(); 21612919bfd0SHugh Dickins 21624146d2d6SHugh Dickins /* 21634146d2d6SHugh Dickins * Whereas stale stable_nodes on the stable_tree itself 21644146d2d6SHugh Dickins * get pruned in the regular course of stable_tree_search(), 21654146d2d6SHugh Dickins * those moved out to the migrate_nodes list can accumulate: 21664146d2d6SHugh Dickins * so prune them once before each full scan. 21674146d2d6SHugh Dickins */ 21684146d2d6SHugh Dickins if (!ksm_merge_across_nodes) { 216903640418SGeliang Tang struct stable_node *stable_node, *next; 21704146d2d6SHugh Dickins struct page *page; 21714146d2d6SHugh Dickins 217203640418SGeliang Tang list_for_each_entry_safe(stable_node, next, 217303640418SGeliang Tang &migrate_nodes, list) { 21744146d2d6SHugh Dickins page = get_ksm_page(stable_node, false); 21754146d2d6SHugh Dickins if (page) 21764146d2d6SHugh Dickins put_page(page); 21774146d2d6SHugh Dickins cond_resched(); 21784146d2d6SHugh Dickins } 21794146d2d6SHugh Dickins } 21804146d2d6SHugh Dickins 2181ef53d16cSHugh Dickins for (nid = 0; nid < ksm_nr_node_ids; nid++) 218290bd6fd3SPetr Holasek root_unstable_tree[nid] = RB_ROOT; 218331dbd01fSIzik Eidus 218431dbd01fSIzik Eidus spin_lock(&ksm_mmlist_lock); 218531dbd01fSIzik Eidus slot = list_entry(slot->mm_list.next, struct mm_slot, mm_list); 218631dbd01fSIzik Eidus ksm_scan.mm_slot = slot; 218731dbd01fSIzik Eidus spin_unlock(&ksm_mmlist_lock); 21882b472611SHugh Dickins /* 21892b472611SHugh Dickins * Although we tested list_empty() above, a racing __ksm_exit 21902b472611SHugh Dickins * of the last mm on the list may have removed it since then. 21912b472611SHugh Dickins */ 21922b472611SHugh Dickins if (slot == &ksm_mm_head) 21932b472611SHugh Dickins return NULL; 219431dbd01fSIzik Eidus next_mm: 219531dbd01fSIzik Eidus ksm_scan.address = 0; 21966514d511SHugh Dickins ksm_scan.rmap_list = &slot->rmap_list; 219731dbd01fSIzik Eidus } 219831dbd01fSIzik Eidus 219931dbd01fSIzik Eidus mm = slot->mm; 220031dbd01fSIzik Eidus down_read(&mm->mmap_sem); 22019ba69294SHugh Dickins if (ksm_test_exit(mm)) 22029ba69294SHugh Dickins vma = NULL; 22039ba69294SHugh Dickins else 22049ba69294SHugh Dickins vma = find_vma(mm, ksm_scan.address); 22059ba69294SHugh Dickins 22069ba69294SHugh Dickins for (; vma; vma = vma->vm_next) { 220731dbd01fSIzik Eidus if (!(vma->vm_flags & VM_MERGEABLE)) 220831dbd01fSIzik Eidus continue; 220931dbd01fSIzik Eidus if (ksm_scan.address < vma->vm_start) 221031dbd01fSIzik Eidus ksm_scan.address = vma->vm_start; 221131dbd01fSIzik Eidus if (!vma->anon_vma) 221231dbd01fSIzik Eidus ksm_scan.address = vma->vm_end; 221331dbd01fSIzik Eidus 221431dbd01fSIzik Eidus while (ksm_scan.address < vma->vm_end) { 22159ba69294SHugh Dickins if (ksm_test_exit(mm)) 22169ba69294SHugh Dickins break; 221731dbd01fSIzik Eidus *page = follow_page(vma, ksm_scan.address, FOLL_GET); 221821ae5b01SAndrea Arcangeli if (IS_ERR_OR_NULL(*page)) { 221921ae5b01SAndrea Arcangeli ksm_scan.address += PAGE_SIZE; 222021ae5b01SAndrea Arcangeli cond_resched(); 222121ae5b01SAndrea Arcangeli continue; 222221ae5b01SAndrea Arcangeli } 2223f765f540SKirill A. Shutemov if (PageAnon(*page)) { 222431dbd01fSIzik Eidus flush_anon_page(vma, *page, ksm_scan.address); 222531dbd01fSIzik Eidus flush_dcache_page(*page); 222631dbd01fSIzik Eidus rmap_item = get_next_rmap_item(slot, 22276514d511SHugh Dickins ksm_scan.rmap_list, ksm_scan.address); 222831dbd01fSIzik Eidus if (rmap_item) { 22296514d511SHugh Dickins ksm_scan.rmap_list = 22306514d511SHugh Dickins &rmap_item->rmap_list; 223131dbd01fSIzik Eidus ksm_scan.address += PAGE_SIZE; 223231dbd01fSIzik Eidus } else 223331dbd01fSIzik Eidus put_page(*page); 223431dbd01fSIzik Eidus up_read(&mm->mmap_sem); 223531dbd01fSIzik Eidus return rmap_item; 223631dbd01fSIzik Eidus } 223731dbd01fSIzik Eidus put_page(*page); 223831dbd01fSIzik Eidus ksm_scan.address += PAGE_SIZE; 223931dbd01fSIzik Eidus cond_resched(); 224031dbd01fSIzik Eidus } 224131dbd01fSIzik Eidus } 224231dbd01fSIzik Eidus 22439ba69294SHugh Dickins if (ksm_test_exit(mm)) { 22449ba69294SHugh Dickins ksm_scan.address = 0; 22456514d511SHugh Dickins ksm_scan.rmap_list = &slot->rmap_list; 22469ba69294SHugh Dickins } 224731dbd01fSIzik Eidus /* 224831dbd01fSIzik Eidus * Nuke all the rmap_items that are above this current rmap: 224931dbd01fSIzik Eidus * because there were no VM_MERGEABLE vmas with such addresses. 225031dbd01fSIzik Eidus */ 22516514d511SHugh Dickins remove_trailing_rmap_items(slot, ksm_scan.rmap_list); 225231dbd01fSIzik Eidus 225331dbd01fSIzik Eidus spin_lock(&ksm_mmlist_lock); 2254cd551f97SHugh Dickins ksm_scan.mm_slot = list_entry(slot->mm_list.next, 2255cd551f97SHugh Dickins struct mm_slot, mm_list); 2256cd551f97SHugh Dickins if (ksm_scan.address == 0) { 2257cd551f97SHugh Dickins /* 2258cd551f97SHugh Dickins * We've completed a full scan of all vmas, holding mmap_sem 2259cd551f97SHugh Dickins * throughout, and found no VM_MERGEABLE: so do the same as 2260cd551f97SHugh Dickins * __ksm_exit does to remove this mm from all our lists now. 22619ba69294SHugh Dickins * This applies either when cleaning up after __ksm_exit 22629ba69294SHugh Dickins * (but beware: we can reach here even before __ksm_exit), 22639ba69294SHugh Dickins * or when all VM_MERGEABLE areas have been unmapped (and 22649ba69294SHugh Dickins * mmap_sem then protects against race with MADV_MERGEABLE). 2265cd551f97SHugh Dickins */ 22664ca3a69bSSasha Levin hash_del(&slot->link); 2267cd551f97SHugh Dickins list_del(&slot->mm_list); 22689ba69294SHugh Dickins spin_unlock(&ksm_mmlist_lock); 22699ba69294SHugh Dickins 2270cd551f97SHugh Dickins free_mm_slot(slot); 2271cd551f97SHugh Dickins clear_bit(MMF_VM_MERGEABLE, &mm->flags); 22729ba69294SHugh Dickins up_read(&mm->mmap_sem); 22739ba69294SHugh Dickins mmdrop(mm); 22749ba69294SHugh Dickins } else { 2275cd551f97SHugh Dickins up_read(&mm->mmap_sem); 22767496fea9SZhou Chengming /* 22777496fea9SZhou Chengming * up_read(&mm->mmap_sem) first because after 22787496fea9SZhou Chengming * spin_unlock(&ksm_mmlist_lock) run, the "mm" may 22797496fea9SZhou Chengming * already have been freed under us by __ksm_exit() 22807496fea9SZhou Chengming * because the "mm_slot" is still hashed and 22817496fea9SZhou Chengming * ksm_scan.mm_slot doesn't point to it anymore. 22827496fea9SZhou Chengming */ 22837496fea9SZhou Chengming spin_unlock(&ksm_mmlist_lock); 22849ba69294SHugh Dickins } 228531dbd01fSIzik Eidus 228631dbd01fSIzik Eidus /* Repeat until we've completed scanning the whole list */ 2287cd551f97SHugh Dickins slot = ksm_scan.mm_slot; 228831dbd01fSIzik Eidus if (slot != &ksm_mm_head) 228931dbd01fSIzik Eidus goto next_mm; 229031dbd01fSIzik Eidus 229131dbd01fSIzik Eidus ksm_scan.seqnr++; 229231dbd01fSIzik Eidus return NULL; 229331dbd01fSIzik Eidus } 229431dbd01fSIzik Eidus 229531dbd01fSIzik Eidus /** 229631dbd01fSIzik Eidus * ksm_do_scan - the ksm scanner main worker function. 229731dbd01fSIzik Eidus * @scan_npages - number of pages we want to scan before we return. 229831dbd01fSIzik Eidus */ 229931dbd01fSIzik Eidus static void ksm_do_scan(unsigned int scan_npages) 230031dbd01fSIzik Eidus { 230131dbd01fSIzik Eidus struct rmap_item *rmap_item; 230222eccdd7SDan Carpenter struct page *uninitialized_var(page); 230331dbd01fSIzik Eidus 2304878aee7dSAndrea Arcangeli while (scan_npages-- && likely(!freezing(current))) { 230531dbd01fSIzik Eidus cond_resched(); 230631dbd01fSIzik Eidus rmap_item = scan_get_next_rmap_item(&page); 230731dbd01fSIzik Eidus if (!rmap_item) 230831dbd01fSIzik Eidus return; 230931dbd01fSIzik Eidus cmp_and_merge_page(page, rmap_item); 231031dbd01fSIzik Eidus put_page(page); 231131dbd01fSIzik Eidus } 231231dbd01fSIzik Eidus } 231331dbd01fSIzik Eidus 23146e158384SHugh Dickins static int ksmd_should_run(void) 23156e158384SHugh Dickins { 23166e158384SHugh Dickins return (ksm_run & KSM_RUN_MERGE) && !list_empty(&ksm_mm_head.mm_list); 23176e158384SHugh Dickins } 23186e158384SHugh Dickins 231931dbd01fSIzik Eidus static int ksm_scan_thread(void *nothing) 232031dbd01fSIzik Eidus { 2321878aee7dSAndrea Arcangeli set_freezable(); 2322339aa624SIzik Eidus set_user_nice(current, 5); 232331dbd01fSIzik Eidus 232431dbd01fSIzik Eidus while (!kthread_should_stop()) { 232531dbd01fSIzik Eidus mutex_lock(&ksm_thread_mutex); 2326ef4d43a8SHugh Dickins wait_while_offlining(); 23276e158384SHugh Dickins if (ksmd_should_run()) 232831dbd01fSIzik Eidus ksm_do_scan(ksm_thread_pages_to_scan); 232931dbd01fSIzik Eidus mutex_unlock(&ksm_thread_mutex); 23306e158384SHugh Dickins 2331878aee7dSAndrea Arcangeli try_to_freeze(); 2332878aee7dSAndrea Arcangeli 23336e158384SHugh Dickins if (ksmd_should_run()) { 233431dbd01fSIzik Eidus schedule_timeout_interruptible( 233531dbd01fSIzik Eidus msecs_to_jiffies(ksm_thread_sleep_millisecs)); 233631dbd01fSIzik Eidus } else { 2337878aee7dSAndrea Arcangeli wait_event_freezable(ksm_thread_wait, 23386e158384SHugh Dickins ksmd_should_run() || kthread_should_stop()); 233931dbd01fSIzik Eidus } 234031dbd01fSIzik Eidus } 234131dbd01fSIzik Eidus return 0; 234231dbd01fSIzik Eidus } 234331dbd01fSIzik Eidus 2344f8af4da3SHugh Dickins int ksm_madvise(struct vm_area_struct *vma, unsigned long start, 2345f8af4da3SHugh Dickins unsigned long end, int advice, unsigned long *vm_flags) 2346f8af4da3SHugh Dickins { 2347f8af4da3SHugh Dickins struct mm_struct *mm = vma->vm_mm; 2348d952b791SHugh Dickins int err; 2349f8af4da3SHugh Dickins 2350f8af4da3SHugh Dickins switch (advice) { 2351f8af4da3SHugh Dickins case MADV_MERGEABLE: 2352f8af4da3SHugh Dickins /* 2353f8af4da3SHugh Dickins * Be somewhat over-protective for now! 2354f8af4da3SHugh Dickins */ 2355f8af4da3SHugh Dickins if (*vm_flags & (VM_MERGEABLE | VM_SHARED | VM_MAYSHARE | 2356f8af4da3SHugh Dickins VM_PFNMAP | VM_IO | VM_DONTEXPAND | 23570661a336SKirill A. Shutemov VM_HUGETLB | VM_MIXEDMAP)) 2358f8af4da3SHugh Dickins return 0; /* just ignore the advice */ 2359f8af4da3SHugh Dickins 2360cc2383ecSKonstantin Khlebnikov #ifdef VM_SAO 2361cc2383ecSKonstantin Khlebnikov if (*vm_flags & VM_SAO) 2362cc2383ecSKonstantin Khlebnikov return 0; 2363cc2383ecSKonstantin Khlebnikov #endif 2364cc2383ecSKonstantin Khlebnikov 2365d952b791SHugh Dickins if (!test_bit(MMF_VM_MERGEABLE, &mm->flags)) { 2366d952b791SHugh Dickins err = __ksm_enter(mm); 2367d952b791SHugh Dickins if (err) 2368d952b791SHugh Dickins return err; 2369d952b791SHugh Dickins } 2370f8af4da3SHugh Dickins 2371f8af4da3SHugh Dickins *vm_flags |= VM_MERGEABLE; 2372f8af4da3SHugh Dickins break; 2373f8af4da3SHugh Dickins 2374f8af4da3SHugh Dickins case MADV_UNMERGEABLE: 2375f8af4da3SHugh Dickins if (!(*vm_flags & VM_MERGEABLE)) 2376f8af4da3SHugh Dickins return 0; /* just ignore the advice */ 2377f8af4da3SHugh Dickins 2378d952b791SHugh Dickins if (vma->anon_vma) { 2379d952b791SHugh Dickins err = unmerge_ksm_pages(vma, start, end); 2380d952b791SHugh Dickins if (err) 2381d952b791SHugh Dickins return err; 2382d952b791SHugh Dickins } 2383f8af4da3SHugh Dickins 2384f8af4da3SHugh Dickins *vm_flags &= ~VM_MERGEABLE; 2385f8af4da3SHugh Dickins break; 2386f8af4da3SHugh Dickins } 2387f8af4da3SHugh Dickins 2388f8af4da3SHugh Dickins return 0; 2389f8af4da3SHugh Dickins } 2390f8af4da3SHugh Dickins 2391f8af4da3SHugh Dickins int __ksm_enter(struct mm_struct *mm) 2392f8af4da3SHugh Dickins { 23936e158384SHugh Dickins struct mm_slot *mm_slot; 23946e158384SHugh Dickins int needs_wakeup; 23956e158384SHugh Dickins 23966e158384SHugh Dickins mm_slot = alloc_mm_slot(); 239731dbd01fSIzik Eidus if (!mm_slot) 239831dbd01fSIzik Eidus return -ENOMEM; 239931dbd01fSIzik Eidus 24006e158384SHugh Dickins /* Check ksm_run too? Would need tighter locking */ 24016e158384SHugh Dickins needs_wakeup = list_empty(&ksm_mm_head.mm_list); 24026e158384SHugh Dickins 240331dbd01fSIzik Eidus spin_lock(&ksm_mmlist_lock); 240431dbd01fSIzik Eidus insert_to_mm_slots_hash(mm, mm_slot); 240531dbd01fSIzik Eidus /* 2406cbf86cfeSHugh Dickins * When KSM_RUN_MERGE (or KSM_RUN_STOP), 2407cbf86cfeSHugh Dickins * insert just behind the scanning cursor, to let the area settle 240831dbd01fSIzik Eidus * down a little; when fork is followed by immediate exec, we don't 240931dbd01fSIzik Eidus * want ksmd to waste time setting up and tearing down an rmap_list. 2410cbf86cfeSHugh Dickins * 2411cbf86cfeSHugh Dickins * But when KSM_RUN_UNMERGE, it's important to insert ahead of its 2412cbf86cfeSHugh Dickins * scanning cursor, otherwise KSM pages in newly forked mms will be 2413cbf86cfeSHugh Dickins * missed: then we might as well insert at the end of the list. 241431dbd01fSIzik Eidus */ 2415cbf86cfeSHugh Dickins if (ksm_run & KSM_RUN_UNMERGE) 2416cbf86cfeSHugh Dickins list_add_tail(&mm_slot->mm_list, &ksm_mm_head.mm_list); 2417cbf86cfeSHugh Dickins else 241831dbd01fSIzik Eidus list_add_tail(&mm_slot->mm_list, &ksm_scan.mm_slot->mm_list); 241931dbd01fSIzik Eidus spin_unlock(&ksm_mmlist_lock); 242031dbd01fSIzik Eidus 2421f8af4da3SHugh Dickins set_bit(MMF_VM_MERGEABLE, &mm->flags); 2422f1f10076SVegard Nossum mmgrab(mm); 24236e158384SHugh Dickins 24246e158384SHugh Dickins if (needs_wakeup) 24256e158384SHugh Dickins wake_up_interruptible(&ksm_thread_wait); 24266e158384SHugh Dickins 2427f8af4da3SHugh Dickins return 0; 2428f8af4da3SHugh Dickins } 2429f8af4da3SHugh Dickins 24301c2fb7a4SAndrea Arcangeli void __ksm_exit(struct mm_struct *mm) 2431f8af4da3SHugh Dickins { 2432cd551f97SHugh Dickins struct mm_slot *mm_slot; 24339ba69294SHugh Dickins int easy_to_free = 0; 2434cd551f97SHugh Dickins 243531dbd01fSIzik Eidus /* 24369ba69294SHugh Dickins * This process is exiting: if it's straightforward (as is the 24379ba69294SHugh Dickins * case when ksmd was never running), free mm_slot immediately. 24389ba69294SHugh Dickins * But if it's at the cursor or has rmap_items linked to it, use 24399ba69294SHugh Dickins * mmap_sem to synchronize with any break_cows before pagetables 24409ba69294SHugh Dickins * are freed, and leave the mm_slot on the list for ksmd to free. 24419ba69294SHugh Dickins * Beware: ksm may already have noticed it exiting and freed the slot. 244231dbd01fSIzik Eidus */ 24439ba69294SHugh Dickins 2444cd551f97SHugh Dickins spin_lock(&ksm_mmlist_lock); 2445cd551f97SHugh Dickins mm_slot = get_mm_slot(mm); 24469ba69294SHugh Dickins if (mm_slot && ksm_scan.mm_slot != mm_slot) { 24476514d511SHugh Dickins if (!mm_slot->rmap_list) { 24484ca3a69bSSasha Levin hash_del(&mm_slot->link); 2449cd551f97SHugh Dickins list_del(&mm_slot->mm_list); 24509ba69294SHugh Dickins easy_to_free = 1; 24519ba69294SHugh Dickins } else { 24529ba69294SHugh Dickins list_move(&mm_slot->mm_list, 24539ba69294SHugh Dickins &ksm_scan.mm_slot->mm_list); 24549ba69294SHugh Dickins } 24559ba69294SHugh Dickins } 2456cd551f97SHugh Dickins spin_unlock(&ksm_mmlist_lock); 2457cd551f97SHugh Dickins 24589ba69294SHugh Dickins if (easy_to_free) { 2459cd551f97SHugh Dickins free_mm_slot(mm_slot); 2460cd551f97SHugh Dickins clear_bit(MMF_VM_MERGEABLE, &mm->flags); 24619ba69294SHugh Dickins mmdrop(mm); 24629ba69294SHugh Dickins } else if (mm_slot) { 24639ba69294SHugh Dickins down_write(&mm->mmap_sem); 24649ba69294SHugh Dickins up_write(&mm->mmap_sem); 24659ba69294SHugh Dickins } 2466f8af4da3SHugh Dickins } 246731dbd01fSIzik Eidus 2468cbf86cfeSHugh Dickins struct page *ksm_might_need_to_copy(struct page *page, 24695ad64688SHugh Dickins struct vm_area_struct *vma, unsigned long address) 24705ad64688SHugh Dickins { 2471cbf86cfeSHugh Dickins struct anon_vma *anon_vma = page_anon_vma(page); 24725ad64688SHugh Dickins struct page *new_page; 24735ad64688SHugh Dickins 2474cbf86cfeSHugh Dickins if (PageKsm(page)) { 2475cbf86cfeSHugh Dickins if (page_stable_node(page) && 2476cbf86cfeSHugh Dickins !(ksm_run & KSM_RUN_UNMERGE)) 2477cbf86cfeSHugh Dickins return page; /* no need to copy it */ 2478cbf86cfeSHugh Dickins } else if (!anon_vma) { 2479cbf86cfeSHugh Dickins return page; /* no need to copy it */ 2480cbf86cfeSHugh Dickins } else if (anon_vma->root == vma->anon_vma->root && 2481cbf86cfeSHugh Dickins page->index == linear_page_index(vma, address)) { 2482cbf86cfeSHugh Dickins return page; /* still no need to copy it */ 2483cbf86cfeSHugh Dickins } 2484cbf86cfeSHugh Dickins if (!PageUptodate(page)) 2485cbf86cfeSHugh Dickins return page; /* let do_swap_page report the error */ 2486cbf86cfeSHugh Dickins 24875ad64688SHugh Dickins new_page = alloc_page_vma(GFP_HIGHUSER_MOVABLE, vma, address); 24885ad64688SHugh Dickins if (new_page) { 24895ad64688SHugh Dickins copy_user_highpage(new_page, page, address, vma); 24905ad64688SHugh Dickins 24915ad64688SHugh Dickins SetPageDirty(new_page); 24925ad64688SHugh Dickins __SetPageUptodate(new_page); 249348c935adSKirill A. Shutemov __SetPageLocked(new_page); 24945ad64688SHugh Dickins } 24955ad64688SHugh Dickins 24965ad64688SHugh Dickins return new_page; 24975ad64688SHugh Dickins } 24985ad64688SHugh Dickins 24991df631aeSMinchan Kim void rmap_walk_ksm(struct page *page, struct rmap_walk_control *rwc) 2500e9995ef9SHugh Dickins { 2501e9995ef9SHugh Dickins struct stable_node *stable_node; 2502e9995ef9SHugh Dickins struct rmap_item *rmap_item; 2503e9995ef9SHugh Dickins int search_new_forks = 0; 2504e9995ef9SHugh Dickins 2505309381feSSasha Levin VM_BUG_ON_PAGE(!PageKsm(page), page); 25069f32624bSJoonsoo Kim 25079f32624bSJoonsoo Kim /* 25089f32624bSJoonsoo Kim * Rely on the page lock to protect against concurrent modifications 25099f32624bSJoonsoo Kim * to that page's node of the stable tree. 25109f32624bSJoonsoo Kim */ 2511309381feSSasha Levin VM_BUG_ON_PAGE(!PageLocked(page), page); 2512e9995ef9SHugh Dickins 2513e9995ef9SHugh Dickins stable_node = page_stable_node(page); 2514e9995ef9SHugh Dickins if (!stable_node) 25151df631aeSMinchan Kim return; 2516e9995ef9SHugh Dickins again: 2517b67bfe0dSSasha Levin hlist_for_each_entry(rmap_item, &stable_node->hlist, hlist) { 2518e9995ef9SHugh Dickins struct anon_vma *anon_vma = rmap_item->anon_vma; 25195beb4930SRik van Riel struct anon_vma_chain *vmac; 2520e9995ef9SHugh Dickins struct vm_area_struct *vma; 2521e9995ef9SHugh Dickins 2522ad12695fSAndrea Arcangeli cond_resched(); 2523b6b19f25SHugh Dickins anon_vma_lock_read(anon_vma); 2524bf181b9fSMichel Lespinasse anon_vma_interval_tree_foreach(vmac, &anon_vma->rb_root, 2525bf181b9fSMichel Lespinasse 0, ULONG_MAX) { 2526ad12695fSAndrea Arcangeli cond_resched(); 25275beb4930SRik van Riel vma = vmac->vma; 2528e9995ef9SHugh Dickins if (rmap_item->address < vma->vm_start || 2529e9995ef9SHugh Dickins rmap_item->address >= vma->vm_end) 2530e9995ef9SHugh Dickins continue; 2531e9995ef9SHugh Dickins /* 2532e9995ef9SHugh Dickins * Initially we examine only the vma which covers this 2533e9995ef9SHugh Dickins * rmap_item; but later, if there is still work to do, 2534e9995ef9SHugh Dickins * we examine covering vmas in other mms: in case they 2535e9995ef9SHugh Dickins * were forked from the original since ksmd passed. 2536e9995ef9SHugh Dickins */ 2537e9995ef9SHugh Dickins if ((rmap_item->mm == vma->vm_mm) == search_new_forks) 2538e9995ef9SHugh Dickins continue; 2539e9995ef9SHugh Dickins 25400dd1c7bbSJoonsoo Kim if (rwc->invalid_vma && rwc->invalid_vma(vma, rwc->arg)) 25410dd1c7bbSJoonsoo Kim continue; 25420dd1c7bbSJoonsoo Kim 2543e4b82222SMinchan Kim if (!rwc->rmap_one(page, vma, 25441df631aeSMinchan Kim rmap_item->address, rwc->arg)) { 2545b6b19f25SHugh Dickins anon_vma_unlock_read(anon_vma); 25461df631aeSMinchan Kim return; 2547e9995ef9SHugh Dickins } 25480dd1c7bbSJoonsoo Kim if (rwc->done && rwc->done(page)) { 25490dd1c7bbSJoonsoo Kim anon_vma_unlock_read(anon_vma); 25501df631aeSMinchan Kim return; 25510dd1c7bbSJoonsoo Kim } 2552e9995ef9SHugh Dickins } 2553b6b19f25SHugh Dickins anon_vma_unlock_read(anon_vma); 2554e9995ef9SHugh Dickins } 2555e9995ef9SHugh Dickins if (!search_new_forks++) 2556e9995ef9SHugh Dickins goto again; 2557e9995ef9SHugh Dickins } 2558e9995ef9SHugh Dickins 255952629506SJoonsoo Kim #ifdef CONFIG_MIGRATION 2560e9995ef9SHugh Dickins void ksm_migrate_page(struct page *newpage, struct page *oldpage) 2561e9995ef9SHugh Dickins { 2562e9995ef9SHugh Dickins struct stable_node *stable_node; 2563e9995ef9SHugh Dickins 2564309381feSSasha Levin VM_BUG_ON_PAGE(!PageLocked(oldpage), oldpage); 2565309381feSSasha Levin VM_BUG_ON_PAGE(!PageLocked(newpage), newpage); 2566309381feSSasha Levin VM_BUG_ON_PAGE(newpage->mapping != oldpage->mapping, newpage); 2567e9995ef9SHugh Dickins 2568e9995ef9SHugh Dickins stable_node = page_stable_node(newpage); 2569e9995ef9SHugh Dickins if (stable_node) { 2570309381feSSasha Levin VM_BUG_ON_PAGE(stable_node->kpfn != page_to_pfn(oldpage), oldpage); 257162b61f61SHugh Dickins stable_node->kpfn = page_to_pfn(newpage); 2572c8d6553bSHugh Dickins /* 2573c8d6553bSHugh Dickins * newpage->mapping was set in advance; now we need smp_wmb() 2574c8d6553bSHugh Dickins * to make sure that the new stable_node->kpfn is visible 2575c8d6553bSHugh Dickins * to get_ksm_page() before it can see that oldpage->mapping 2576c8d6553bSHugh Dickins * has gone stale (or that PageSwapCache has been cleared). 2577c8d6553bSHugh Dickins */ 2578c8d6553bSHugh Dickins smp_wmb(); 2579c8d6553bSHugh Dickins set_page_stable_node(oldpage, NULL); 2580e9995ef9SHugh Dickins } 2581e9995ef9SHugh Dickins } 2582e9995ef9SHugh Dickins #endif /* CONFIG_MIGRATION */ 2583e9995ef9SHugh Dickins 258462b61f61SHugh Dickins #ifdef CONFIG_MEMORY_HOTREMOVE 2585ef4d43a8SHugh Dickins static void wait_while_offlining(void) 2586ef4d43a8SHugh Dickins { 2587ef4d43a8SHugh Dickins while (ksm_run & KSM_RUN_OFFLINE) { 2588ef4d43a8SHugh Dickins mutex_unlock(&ksm_thread_mutex); 2589ef4d43a8SHugh Dickins wait_on_bit(&ksm_run, ilog2(KSM_RUN_OFFLINE), 259074316201SNeilBrown TASK_UNINTERRUPTIBLE); 2591ef4d43a8SHugh Dickins mutex_lock(&ksm_thread_mutex); 2592ef4d43a8SHugh Dickins } 2593ef4d43a8SHugh Dickins } 2594ef4d43a8SHugh Dickins 25952c653d0eSAndrea Arcangeli static bool stable_node_dup_remove_range(struct stable_node *stable_node, 25962c653d0eSAndrea Arcangeli unsigned long start_pfn, 25972c653d0eSAndrea Arcangeli unsigned long end_pfn) 25982c653d0eSAndrea Arcangeli { 25992c653d0eSAndrea Arcangeli if (stable_node->kpfn >= start_pfn && 26002c653d0eSAndrea Arcangeli stable_node->kpfn < end_pfn) { 26012c653d0eSAndrea Arcangeli /* 26022c653d0eSAndrea Arcangeli * Don't get_ksm_page, page has already gone: 26032c653d0eSAndrea Arcangeli * which is why we keep kpfn instead of page* 26042c653d0eSAndrea Arcangeli */ 26052c653d0eSAndrea Arcangeli remove_node_from_stable_tree(stable_node); 26062c653d0eSAndrea Arcangeli return true; 26072c653d0eSAndrea Arcangeli } 26082c653d0eSAndrea Arcangeli return false; 26092c653d0eSAndrea Arcangeli } 26102c653d0eSAndrea Arcangeli 26112c653d0eSAndrea Arcangeli static bool stable_node_chain_remove_range(struct stable_node *stable_node, 26122c653d0eSAndrea Arcangeli unsigned long start_pfn, 26132c653d0eSAndrea Arcangeli unsigned long end_pfn, 26142c653d0eSAndrea Arcangeli struct rb_root *root) 26152c653d0eSAndrea Arcangeli { 26162c653d0eSAndrea Arcangeli struct stable_node *dup; 26172c653d0eSAndrea Arcangeli struct hlist_node *hlist_safe; 26182c653d0eSAndrea Arcangeli 26192c653d0eSAndrea Arcangeli if (!is_stable_node_chain(stable_node)) { 26202c653d0eSAndrea Arcangeli VM_BUG_ON(is_stable_node_dup(stable_node)); 26212c653d0eSAndrea Arcangeli return stable_node_dup_remove_range(stable_node, start_pfn, 26222c653d0eSAndrea Arcangeli end_pfn); 26232c653d0eSAndrea Arcangeli } 26242c653d0eSAndrea Arcangeli 26252c653d0eSAndrea Arcangeli hlist_for_each_entry_safe(dup, hlist_safe, 26262c653d0eSAndrea Arcangeli &stable_node->hlist, hlist_dup) { 26272c653d0eSAndrea Arcangeli VM_BUG_ON(!is_stable_node_dup(dup)); 26282c653d0eSAndrea Arcangeli stable_node_dup_remove_range(dup, start_pfn, end_pfn); 26292c653d0eSAndrea Arcangeli } 26302c653d0eSAndrea Arcangeli if (hlist_empty(&stable_node->hlist)) { 26312c653d0eSAndrea Arcangeli free_stable_node_chain(stable_node, root); 26322c653d0eSAndrea Arcangeli return true; /* notify caller that tree was rebalanced */ 26332c653d0eSAndrea Arcangeli } else 26342c653d0eSAndrea Arcangeli return false; 26352c653d0eSAndrea Arcangeli } 26362c653d0eSAndrea Arcangeli 2637ee0ea59cSHugh Dickins static void ksm_check_stable_tree(unsigned long start_pfn, 263862b61f61SHugh Dickins unsigned long end_pfn) 263962b61f61SHugh Dickins { 264003640418SGeliang Tang struct stable_node *stable_node, *next; 264162b61f61SHugh Dickins struct rb_node *node; 264290bd6fd3SPetr Holasek int nid; 264362b61f61SHugh Dickins 2644ef53d16cSHugh Dickins for (nid = 0; nid < ksm_nr_node_ids; nid++) { 2645ef53d16cSHugh Dickins node = rb_first(root_stable_tree + nid); 2646ee0ea59cSHugh Dickins while (node) { 264762b61f61SHugh Dickins stable_node = rb_entry(node, struct stable_node, node); 26482c653d0eSAndrea Arcangeli if (stable_node_chain_remove_range(stable_node, 26492c653d0eSAndrea Arcangeli start_pfn, end_pfn, 26502c653d0eSAndrea Arcangeli root_stable_tree + 26512c653d0eSAndrea Arcangeli nid)) 2652ef53d16cSHugh Dickins node = rb_first(root_stable_tree + nid); 26532c653d0eSAndrea Arcangeli else 2654ee0ea59cSHugh Dickins node = rb_next(node); 2655ee0ea59cSHugh Dickins cond_resched(); 265662b61f61SHugh Dickins } 2657ee0ea59cSHugh Dickins } 265803640418SGeliang Tang list_for_each_entry_safe(stable_node, next, &migrate_nodes, list) { 26594146d2d6SHugh Dickins if (stable_node->kpfn >= start_pfn && 26604146d2d6SHugh Dickins stable_node->kpfn < end_pfn) 26614146d2d6SHugh Dickins remove_node_from_stable_tree(stable_node); 26624146d2d6SHugh Dickins cond_resched(); 26634146d2d6SHugh Dickins } 266462b61f61SHugh Dickins } 266562b61f61SHugh Dickins 266662b61f61SHugh Dickins static int ksm_memory_callback(struct notifier_block *self, 266762b61f61SHugh Dickins unsigned long action, void *arg) 266862b61f61SHugh Dickins { 266962b61f61SHugh Dickins struct memory_notify *mn = arg; 267062b61f61SHugh Dickins 267162b61f61SHugh Dickins switch (action) { 267262b61f61SHugh Dickins case MEM_GOING_OFFLINE: 267362b61f61SHugh Dickins /* 2674ef4d43a8SHugh Dickins * Prevent ksm_do_scan(), unmerge_and_remove_all_rmap_items() 2675ef4d43a8SHugh Dickins * and remove_all_stable_nodes() while memory is going offline: 2676ef4d43a8SHugh Dickins * it is unsafe for them to touch the stable tree at this time. 2677ef4d43a8SHugh Dickins * But unmerge_ksm_pages(), rmap lookups and other entry points 2678ef4d43a8SHugh Dickins * which do not need the ksm_thread_mutex are all safe. 267962b61f61SHugh Dickins */ 2680ef4d43a8SHugh Dickins mutex_lock(&ksm_thread_mutex); 2681ef4d43a8SHugh Dickins ksm_run |= KSM_RUN_OFFLINE; 2682ef4d43a8SHugh Dickins mutex_unlock(&ksm_thread_mutex); 268362b61f61SHugh Dickins break; 268462b61f61SHugh Dickins 268562b61f61SHugh Dickins case MEM_OFFLINE: 268662b61f61SHugh Dickins /* 268762b61f61SHugh Dickins * Most of the work is done by page migration; but there might 268862b61f61SHugh Dickins * be a few stable_nodes left over, still pointing to struct 2689ee0ea59cSHugh Dickins * pages which have been offlined: prune those from the tree, 2690ee0ea59cSHugh Dickins * otherwise get_ksm_page() might later try to access a 2691ee0ea59cSHugh Dickins * non-existent struct page. 269262b61f61SHugh Dickins */ 2693ee0ea59cSHugh Dickins ksm_check_stable_tree(mn->start_pfn, 2694ee0ea59cSHugh Dickins mn->start_pfn + mn->nr_pages); 269562b61f61SHugh Dickins /* fallthrough */ 269662b61f61SHugh Dickins 269762b61f61SHugh Dickins case MEM_CANCEL_OFFLINE: 2698ef4d43a8SHugh Dickins mutex_lock(&ksm_thread_mutex); 2699ef4d43a8SHugh Dickins ksm_run &= ~KSM_RUN_OFFLINE; 270062b61f61SHugh Dickins mutex_unlock(&ksm_thread_mutex); 2701ef4d43a8SHugh Dickins 2702ef4d43a8SHugh Dickins smp_mb(); /* wake_up_bit advises this */ 2703ef4d43a8SHugh Dickins wake_up_bit(&ksm_run, ilog2(KSM_RUN_OFFLINE)); 270462b61f61SHugh Dickins break; 270562b61f61SHugh Dickins } 270662b61f61SHugh Dickins return NOTIFY_OK; 270762b61f61SHugh Dickins } 2708ef4d43a8SHugh Dickins #else 2709ef4d43a8SHugh Dickins static void wait_while_offlining(void) 2710ef4d43a8SHugh Dickins { 2711ef4d43a8SHugh Dickins } 271262b61f61SHugh Dickins #endif /* CONFIG_MEMORY_HOTREMOVE */ 271362b61f61SHugh Dickins 27142ffd8679SHugh Dickins #ifdef CONFIG_SYSFS 27152ffd8679SHugh Dickins /* 27162ffd8679SHugh Dickins * This all compiles without CONFIG_SYSFS, but is a waste of space. 27172ffd8679SHugh Dickins */ 27182ffd8679SHugh Dickins 271931dbd01fSIzik Eidus #define KSM_ATTR_RO(_name) \ 272031dbd01fSIzik Eidus static struct kobj_attribute _name##_attr = __ATTR_RO(_name) 272131dbd01fSIzik Eidus #define KSM_ATTR(_name) \ 272231dbd01fSIzik Eidus static struct kobj_attribute _name##_attr = \ 272331dbd01fSIzik Eidus __ATTR(_name, 0644, _name##_show, _name##_store) 272431dbd01fSIzik Eidus 272531dbd01fSIzik Eidus static ssize_t sleep_millisecs_show(struct kobject *kobj, 272631dbd01fSIzik Eidus struct kobj_attribute *attr, char *buf) 272731dbd01fSIzik Eidus { 272831dbd01fSIzik Eidus return sprintf(buf, "%u\n", ksm_thread_sleep_millisecs); 272931dbd01fSIzik Eidus } 273031dbd01fSIzik Eidus 273131dbd01fSIzik Eidus static ssize_t sleep_millisecs_store(struct kobject *kobj, 273231dbd01fSIzik Eidus struct kobj_attribute *attr, 273331dbd01fSIzik Eidus const char *buf, size_t count) 273431dbd01fSIzik Eidus { 273531dbd01fSIzik Eidus unsigned long msecs; 273631dbd01fSIzik Eidus int err; 273731dbd01fSIzik Eidus 27383dbb95f7SJingoo Han err = kstrtoul(buf, 10, &msecs); 273931dbd01fSIzik Eidus if (err || msecs > UINT_MAX) 274031dbd01fSIzik Eidus return -EINVAL; 274131dbd01fSIzik Eidus 274231dbd01fSIzik Eidus ksm_thread_sleep_millisecs = msecs; 274331dbd01fSIzik Eidus 274431dbd01fSIzik Eidus return count; 274531dbd01fSIzik Eidus } 274631dbd01fSIzik Eidus KSM_ATTR(sleep_millisecs); 274731dbd01fSIzik Eidus 274831dbd01fSIzik Eidus static ssize_t pages_to_scan_show(struct kobject *kobj, 274931dbd01fSIzik Eidus struct kobj_attribute *attr, char *buf) 275031dbd01fSIzik Eidus { 275131dbd01fSIzik Eidus return sprintf(buf, "%u\n", ksm_thread_pages_to_scan); 275231dbd01fSIzik Eidus } 275331dbd01fSIzik Eidus 275431dbd01fSIzik Eidus static ssize_t pages_to_scan_store(struct kobject *kobj, 275531dbd01fSIzik Eidus struct kobj_attribute *attr, 275631dbd01fSIzik Eidus const char *buf, size_t count) 275731dbd01fSIzik Eidus { 275831dbd01fSIzik Eidus int err; 275931dbd01fSIzik Eidus unsigned long nr_pages; 276031dbd01fSIzik Eidus 27613dbb95f7SJingoo Han err = kstrtoul(buf, 10, &nr_pages); 276231dbd01fSIzik Eidus if (err || nr_pages > UINT_MAX) 276331dbd01fSIzik Eidus return -EINVAL; 276431dbd01fSIzik Eidus 276531dbd01fSIzik Eidus ksm_thread_pages_to_scan = nr_pages; 276631dbd01fSIzik Eidus 276731dbd01fSIzik Eidus return count; 276831dbd01fSIzik Eidus } 276931dbd01fSIzik Eidus KSM_ATTR(pages_to_scan); 277031dbd01fSIzik Eidus 277131dbd01fSIzik Eidus static ssize_t run_show(struct kobject *kobj, struct kobj_attribute *attr, 277231dbd01fSIzik Eidus char *buf) 277331dbd01fSIzik Eidus { 2774ef4d43a8SHugh Dickins return sprintf(buf, "%lu\n", ksm_run); 277531dbd01fSIzik Eidus } 277631dbd01fSIzik Eidus 277731dbd01fSIzik Eidus static ssize_t run_store(struct kobject *kobj, struct kobj_attribute *attr, 277831dbd01fSIzik Eidus const char *buf, size_t count) 277931dbd01fSIzik Eidus { 278031dbd01fSIzik Eidus int err; 278131dbd01fSIzik Eidus unsigned long flags; 278231dbd01fSIzik Eidus 27833dbb95f7SJingoo Han err = kstrtoul(buf, 10, &flags); 278431dbd01fSIzik Eidus if (err || flags > UINT_MAX) 278531dbd01fSIzik Eidus return -EINVAL; 278631dbd01fSIzik Eidus if (flags > KSM_RUN_UNMERGE) 278731dbd01fSIzik Eidus return -EINVAL; 278831dbd01fSIzik Eidus 278931dbd01fSIzik Eidus /* 279031dbd01fSIzik Eidus * KSM_RUN_MERGE sets ksmd running, and 0 stops it running. 279131dbd01fSIzik Eidus * KSM_RUN_UNMERGE stops it running and unmerges all rmap_items, 2792d0f209f6SHugh Dickins * breaking COW to free the pages_shared (but leaves mm_slots 2793d0f209f6SHugh Dickins * on the list for when ksmd may be set running again). 279431dbd01fSIzik Eidus */ 279531dbd01fSIzik Eidus 279631dbd01fSIzik Eidus mutex_lock(&ksm_thread_mutex); 2797ef4d43a8SHugh Dickins wait_while_offlining(); 279831dbd01fSIzik Eidus if (ksm_run != flags) { 279931dbd01fSIzik Eidus ksm_run = flags; 2800d952b791SHugh Dickins if (flags & KSM_RUN_UNMERGE) { 2801e1e12d2fSDavid Rientjes set_current_oom_origin(); 2802d952b791SHugh Dickins err = unmerge_and_remove_all_rmap_items(); 2803e1e12d2fSDavid Rientjes clear_current_oom_origin(); 2804d952b791SHugh Dickins if (err) { 2805d952b791SHugh Dickins ksm_run = KSM_RUN_STOP; 2806d952b791SHugh Dickins count = err; 2807d952b791SHugh Dickins } 2808d952b791SHugh Dickins } 280931dbd01fSIzik Eidus } 281031dbd01fSIzik Eidus mutex_unlock(&ksm_thread_mutex); 281131dbd01fSIzik Eidus 281231dbd01fSIzik Eidus if (flags & KSM_RUN_MERGE) 281331dbd01fSIzik Eidus wake_up_interruptible(&ksm_thread_wait); 281431dbd01fSIzik Eidus 281531dbd01fSIzik Eidus return count; 281631dbd01fSIzik Eidus } 281731dbd01fSIzik Eidus KSM_ATTR(run); 281831dbd01fSIzik Eidus 281990bd6fd3SPetr Holasek #ifdef CONFIG_NUMA 282090bd6fd3SPetr Holasek static ssize_t merge_across_nodes_show(struct kobject *kobj, 282190bd6fd3SPetr Holasek struct kobj_attribute *attr, char *buf) 282290bd6fd3SPetr Holasek { 282390bd6fd3SPetr Holasek return sprintf(buf, "%u\n", ksm_merge_across_nodes); 282490bd6fd3SPetr Holasek } 282590bd6fd3SPetr Holasek 282690bd6fd3SPetr Holasek static ssize_t merge_across_nodes_store(struct kobject *kobj, 282790bd6fd3SPetr Holasek struct kobj_attribute *attr, 282890bd6fd3SPetr Holasek const char *buf, size_t count) 282990bd6fd3SPetr Holasek { 283090bd6fd3SPetr Holasek int err; 283190bd6fd3SPetr Holasek unsigned long knob; 283290bd6fd3SPetr Holasek 283390bd6fd3SPetr Holasek err = kstrtoul(buf, 10, &knob); 283490bd6fd3SPetr Holasek if (err) 283590bd6fd3SPetr Holasek return err; 283690bd6fd3SPetr Holasek if (knob > 1) 283790bd6fd3SPetr Holasek return -EINVAL; 283890bd6fd3SPetr Holasek 283990bd6fd3SPetr Holasek mutex_lock(&ksm_thread_mutex); 2840ef4d43a8SHugh Dickins wait_while_offlining(); 284190bd6fd3SPetr Holasek if (ksm_merge_across_nodes != knob) { 2842cbf86cfeSHugh Dickins if (ksm_pages_shared || remove_all_stable_nodes()) 284390bd6fd3SPetr Holasek err = -EBUSY; 2844ef53d16cSHugh Dickins else if (root_stable_tree == one_stable_tree) { 2845ef53d16cSHugh Dickins struct rb_root *buf; 2846ef53d16cSHugh Dickins /* 2847ef53d16cSHugh Dickins * This is the first time that we switch away from the 2848ef53d16cSHugh Dickins * default of merging across nodes: must now allocate 2849ef53d16cSHugh Dickins * a buffer to hold as many roots as may be needed. 2850ef53d16cSHugh Dickins * Allocate stable and unstable together: 2851ef53d16cSHugh Dickins * MAXSMP NODES_SHIFT 10 will use 16kB. 2852ef53d16cSHugh Dickins */ 2853bafe1e14SJoe Perches buf = kcalloc(nr_node_ids + nr_node_ids, sizeof(*buf), 2854bafe1e14SJoe Perches GFP_KERNEL); 2855ef53d16cSHugh Dickins /* Let us assume that RB_ROOT is NULL is zero */ 2856ef53d16cSHugh Dickins if (!buf) 2857ef53d16cSHugh Dickins err = -ENOMEM; 2858ef53d16cSHugh Dickins else { 2859ef53d16cSHugh Dickins root_stable_tree = buf; 2860ef53d16cSHugh Dickins root_unstable_tree = buf + nr_node_ids; 2861ef53d16cSHugh Dickins /* Stable tree is empty but not the unstable */ 2862ef53d16cSHugh Dickins root_unstable_tree[0] = one_unstable_tree[0]; 2863ef53d16cSHugh Dickins } 2864ef53d16cSHugh Dickins } 2865ef53d16cSHugh Dickins if (!err) { 286690bd6fd3SPetr Holasek ksm_merge_across_nodes = knob; 2867ef53d16cSHugh Dickins ksm_nr_node_ids = knob ? 1 : nr_node_ids; 2868ef53d16cSHugh Dickins } 286990bd6fd3SPetr Holasek } 287090bd6fd3SPetr Holasek mutex_unlock(&ksm_thread_mutex); 287190bd6fd3SPetr Holasek 287290bd6fd3SPetr Holasek return err ? err : count; 287390bd6fd3SPetr Holasek } 287490bd6fd3SPetr Holasek KSM_ATTR(merge_across_nodes); 287590bd6fd3SPetr Holasek #endif 287690bd6fd3SPetr Holasek 2877e86c59b1SClaudio Imbrenda static ssize_t use_zero_pages_show(struct kobject *kobj, 2878e86c59b1SClaudio Imbrenda struct kobj_attribute *attr, char *buf) 2879e86c59b1SClaudio Imbrenda { 2880e86c59b1SClaudio Imbrenda return sprintf(buf, "%u\n", ksm_use_zero_pages); 2881e86c59b1SClaudio Imbrenda } 2882e86c59b1SClaudio Imbrenda static ssize_t use_zero_pages_store(struct kobject *kobj, 2883e86c59b1SClaudio Imbrenda struct kobj_attribute *attr, 2884e86c59b1SClaudio Imbrenda const char *buf, size_t count) 2885e86c59b1SClaudio Imbrenda { 2886e86c59b1SClaudio Imbrenda int err; 2887e86c59b1SClaudio Imbrenda bool value; 2888e86c59b1SClaudio Imbrenda 2889e86c59b1SClaudio Imbrenda err = kstrtobool(buf, &value); 2890e86c59b1SClaudio Imbrenda if (err) 2891e86c59b1SClaudio Imbrenda return -EINVAL; 2892e86c59b1SClaudio Imbrenda 2893e86c59b1SClaudio Imbrenda ksm_use_zero_pages = value; 2894e86c59b1SClaudio Imbrenda 2895e86c59b1SClaudio Imbrenda return count; 2896e86c59b1SClaudio Imbrenda } 2897e86c59b1SClaudio Imbrenda KSM_ATTR(use_zero_pages); 2898e86c59b1SClaudio Imbrenda 28992c653d0eSAndrea Arcangeli static ssize_t max_page_sharing_show(struct kobject *kobj, 29002c653d0eSAndrea Arcangeli struct kobj_attribute *attr, char *buf) 29012c653d0eSAndrea Arcangeli { 29022c653d0eSAndrea Arcangeli return sprintf(buf, "%u\n", ksm_max_page_sharing); 29032c653d0eSAndrea Arcangeli } 29042c653d0eSAndrea Arcangeli 29052c653d0eSAndrea Arcangeli static ssize_t max_page_sharing_store(struct kobject *kobj, 29062c653d0eSAndrea Arcangeli struct kobj_attribute *attr, 29072c653d0eSAndrea Arcangeli const char *buf, size_t count) 29082c653d0eSAndrea Arcangeli { 29092c653d0eSAndrea Arcangeli int err; 29102c653d0eSAndrea Arcangeli int knob; 29112c653d0eSAndrea Arcangeli 29122c653d0eSAndrea Arcangeli err = kstrtoint(buf, 10, &knob); 29132c653d0eSAndrea Arcangeli if (err) 29142c653d0eSAndrea Arcangeli return err; 29152c653d0eSAndrea Arcangeli /* 29162c653d0eSAndrea Arcangeli * When a KSM page is created it is shared by 2 mappings. This 29172c653d0eSAndrea Arcangeli * being a signed comparison, it implicitly verifies it's not 29182c653d0eSAndrea Arcangeli * negative. 29192c653d0eSAndrea Arcangeli */ 29202c653d0eSAndrea Arcangeli if (knob < 2) 29212c653d0eSAndrea Arcangeli return -EINVAL; 29222c653d0eSAndrea Arcangeli 29232c653d0eSAndrea Arcangeli if (READ_ONCE(ksm_max_page_sharing) == knob) 29242c653d0eSAndrea Arcangeli return count; 29252c653d0eSAndrea Arcangeli 29262c653d0eSAndrea Arcangeli mutex_lock(&ksm_thread_mutex); 29272c653d0eSAndrea Arcangeli wait_while_offlining(); 29282c653d0eSAndrea Arcangeli if (ksm_max_page_sharing != knob) { 29292c653d0eSAndrea Arcangeli if (ksm_pages_shared || remove_all_stable_nodes()) 29302c653d0eSAndrea Arcangeli err = -EBUSY; 29312c653d0eSAndrea Arcangeli else 29322c653d0eSAndrea Arcangeli ksm_max_page_sharing = knob; 29332c653d0eSAndrea Arcangeli } 29342c653d0eSAndrea Arcangeli mutex_unlock(&ksm_thread_mutex); 29352c653d0eSAndrea Arcangeli 29362c653d0eSAndrea Arcangeli return err ? err : count; 29372c653d0eSAndrea Arcangeli } 29382c653d0eSAndrea Arcangeli KSM_ATTR(max_page_sharing); 29392c653d0eSAndrea Arcangeli 2940b4028260SHugh Dickins static ssize_t pages_shared_show(struct kobject *kobj, 2941b4028260SHugh Dickins struct kobj_attribute *attr, char *buf) 2942b4028260SHugh Dickins { 2943b4028260SHugh Dickins return sprintf(buf, "%lu\n", ksm_pages_shared); 2944b4028260SHugh Dickins } 2945b4028260SHugh Dickins KSM_ATTR_RO(pages_shared); 2946b4028260SHugh Dickins 2947b4028260SHugh Dickins static ssize_t pages_sharing_show(struct kobject *kobj, 2948b4028260SHugh Dickins struct kobj_attribute *attr, char *buf) 2949b4028260SHugh Dickins { 2950e178dfdeSHugh Dickins return sprintf(buf, "%lu\n", ksm_pages_sharing); 2951b4028260SHugh Dickins } 2952b4028260SHugh Dickins KSM_ATTR_RO(pages_sharing); 2953b4028260SHugh Dickins 2954473b0ce4SHugh Dickins static ssize_t pages_unshared_show(struct kobject *kobj, 2955473b0ce4SHugh Dickins struct kobj_attribute *attr, char *buf) 2956473b0ce4SHugh Dickins { 2957473b0ce4SHugh Dickins return sprintf(buf, "%lu\n", ksm_pages_unshared); 2958473b0ce4SHugh Dickins } 2959473b0ce4SHugh Dickins KSM_ATTR_RO(pages_unshared); 2960473b0ce4SHugh Dickins 2961473b0ce4SHugh Dickins static ssize_t pages_volatile_show(struct kobject *kobj, 2962473b0ce4SHugh Dickins struct kobj_attribute *attr, char *buf) 2963473b0ce4SHugh Dickins { 2964473b0ce4SHugh Dickins long ksm_pages_volatile; 2965473b0ce4SHugh Dickins 2966473b0ce4SHugh Dickins ksm_pages_volatile = ksm_rmap_items - ksm_pages_shared 2967473b0ce4SHugh Dickins - ksm_pages_sharing - ksm_pages_unshared; 2968473b0ce4SHugh Dickins /* 2969473b0ce4SHugh Dickins * It was not worth any locking to calculate that statistic, 2970473b0ce4SHugh Dickins * but it might therefore sometimes be negative: conceal that. 2971473b0ce4SHugh Dickins */ 2972473b0ce4SHugh Dickins if (ksm_pages_volatile < 0) 2973473b0ce4SHugh Dickins ksm_pages_volatile = 0; 2974473b0ce4SHugh Dickins return sprintf(buf, "%ld\n", ksm_pages_volatile); 2975473b0ce4SHugh Dickins } 2976473b0ce4SHugh Dickins KSM_ATTR_RO(pages_volatile); 2977473b0ce4SHugh Dickins 29782c653d0eSAndrea Arcangeli static ssize_t stable_node_dups_show(struct kobject *kobj, 29792c653d0eSAndrea Arcangeli struct kobj_attribute *attr, char *buf) 29802c653d0eSAndrea Arcangeli { 29812c653d0eSAndrea Arcangeli return sprintf(buf, "%lu\n", ksm_stable_node_dups); 29822c653d0eSAndrea Arcangeli } 29832c653d0eSAndrea Arcangeli KSM_ATTR_RO(stable_node_dups); 29842c653d0eSAndrea Arcangeli 29852c653d0eSAndrea Arcangeli static ssize_t stable_node_chains_show(struct kobject *kobj, 29862c653d0eSAndrea Arcangeli struct kobj_attribute *attr, char *buf) 29872c653d0eSAndrea Arcangeli { 29882c653d0eSAndrea Arcangeli return sprintf(buf, "%lu\n", ksm_stable_node_chains); 29892c653d0eSAndrea Arcangeli } 29902c653d0eSAndrea Arcangeli KSM_ATTR_RO(stable_node_chains); 29912c653d0eSAndrea Arcangeli 29922c653d0eSAndrea Arcangeli static ssize_t 29932c653d0eSAndrea Arcangeli stable_node_chains_prune_millisecs_show(struct kobject *kobj, 29942c653d0eSAndrea Arcangeli struct kobj_attribute *attr, 29952c653d0eSAndrea Arcangeli char *buf) 29962c653d0eSAndrea Arcangeli { 29972c653d0eSAndrea Arcangeli return sprintf(buf, "%u\n", ksm_stable_node_chains_prune_millisecs); 29982c653d0eSAndrea Arcangeli } 29992c653d0eSAndrea Arcangeli 30002c653d0eSAndrea Arcangeli static ssize_t 30012c653d0eSAndrea Arcangeli stable_node_chains_prune_millisecs_store(struct kobject *kobj, 30022c653d0eSAndrea Arcangeli struct kobj_attribute *attr, 30032c653d0eSAndrea Arcangeli const char *buf, size_t count) 30042c653d0eSAndrea Arcangeli { 30052c653d0eSAndrea Arcangeli unsigned long msecs; 30062c653d0eSAndrea Arcangeli int err; 30072c653d0eSAndrea Arcangeli 30082c653d0eSAndrea Arcangeli err = kstrtoul(buf, 10, &msecs); 30092c653d0eSAndrea Arcangeli if (err || msecs > UINT_MAX) 30102c653d0eSAndrea Arcangeli return -EINVAL; 30112c653d0eSAndrea Arcangeli 30122c653d0eSAndrea Arcangeli ksm_stable_node_chains_prune_millisecs = msecs; 30132c653d0eSAndrea Arcangeli 30142c653d0eSAndrea Arcangeli return count; 30152c653d0eSAndrea Arcangeli } 30162c653d0eSAndrea Arcangeli KSM_ATTR(stable_node_chains_prune_millisecs); 30172c653d0eSAndrea Arcangeli 3018473b0ce4SHugh Dickins static ssize_t full_scans_show(struct kobject *kobj, 3019473b0ce4SHugh Dickins struct kobj_attribute *attr, char *buf) 3020473b0ce4SHugh Dickins { 3021473b0ce4SHugh Dickins return sprintf(buf, "%lu\n", ksm_scan.seqnr); 3022473b0ce4SHugh Dickins } 3023473b0ce4SHugh Dickins KSM_ATTR_RO(full_scans); 3024473b0ce4SHugh Dickins 302531dbd01fSIzik Eidus static struct attribute *ksm_attrs[] = { 302631dbd01fSIzik Eidus &sleep_millisecs_attr.attr, 302731dbd01fSIzik Eidus &pages_to_scan_attr.attr, 302831dbd01fSIzik Eidus &run_attr.attr, 3029b4028260SHugh Dickins &pages_shared_attr.attr, 3030b4028260SHugh Dickins &pages_sharing_attr.attr, 3031473b0ce4SHugh Dickins &pages_unshared_attr.attr, 3032473b0ce4SHugh Dickins &pages_volatile_attr.attr, 3033473b0ce4SHugh Dickins &full_scans_attr.attr, 303490bd6fd3SPetr Holasek #ifdef CONFIG_NUMA 303590bd6fd3SPetr Holasek &merge_across_nodes_attr.attr, 303690bd6fd3SPetr Holasek #endif 30372c653d0eSAndrea Arcangeli &max_page_sharing_attr.attr, 30382c653d0eSAndrea Arcangeli &stable_node_chains_attr.attr, 30392c653d0eSAndrea Arcangeli &stable_node_dups_attr.attr, 30402c653d0eSAndrea Arcangeli &stable_node_chains_prune_millisecs_attr.attr, 3041e86c59b1SClaudio Imbrenda &use_zero_pages_attr.attr, 304231dbd01fSIzik Eidus NULL, 304331dbd01fSIzik Eidus }; 304431dbd01fSIzik Eidus 304531dbd01fSIzik Eidus static struct attribute_group ksm_attr_group = { 304631dbd01fSIzik Eidus .attrs = ksm_attrs, 304731dbd01fSIzik Eidus .name = "ksm", 304831dbd01fSIzik Eidus }; 30492ffd8679SHugh Dickins #endif /* CONFIG_SYSFS */ 305031dbd01fSIzik Eidus 305131dbd01fSIzik Eidus static int __init ksm_init(void) 305231dbd01fSIzik Eidus { 305331dbd01fSIzik Eidus struct task_struct *ksm_thread; 305431dbd01fSIzik Eidus int err; 305531dbd01fSIzik Eidus 3056e86c59b1SClaudio Imbrenda /* The correct value depends on page size and endianness */ 3057e86c59b1SClaudio Imbrenda zero_checksum = calc_checksum(ZERO_PAGE(0)); 3058e86c59b1SClaudio Imbrenda /* Default to false for backwards compatibility */ 3059e86c59b1SClaudio Imbrenda ksm_use_zero_pages = false; 3060e86c59b1SClaudio Imbrenda 306131dbd01fSIzik Eidus err = ksm_slab_init(); 306231dbd01fSIzik Eidus if (err) 306331dbd01fSIzik Eidus goto out; 306431dbd01fSIzik Eidus 306531dbd01fSIzik Eidus ksm_thread = kthread_run(ksm_scan_thread, NULL, "ksmd"); 306631dbd01fSIzik Eidus if (IS_ERR(ksm_thread)) { 306725acde31SPaul McQuade pr_err("ksm: creating kthread failed\n"); 306831dbd01fSIzik Eidus err = PTR_ERR(ksm_thread); 3069d9f8984cSLai Jiangshan goto out_free; 307031dbd01fSIzik Eidus } 307131dbd01fSIzik Eidus 30722ffd8679SHugh Dickins #ifdef CONFIG_SYSFS 307331dbd01fSIzik Eidus err = sysfs_create_group(mm_kobj, &ksm_attr_group); 307431dbd01fSIzik Eidus if (err) { 307525acde31SPaul McQuade pr_err("ksm: register sysfs failed\n"); 30762ffd8679SHugh Dickins kthread_stop(ksm_thread); 3077d9f8984cSLai Jiangshan goto out_free; 307831dbd01fSIzik Eidus } 3079c73602adSHugh Dickins #else 3080c73602adSHugh Dickins ksm_run = KSM_RUN_MERGE; /* no way for user to start it */ 3081c73602adSHugh Dickins 30822ffd8679SHugh Dickins #endif /* CONFIG_SYSFS */ 308331dbd01fSIzik Eidus 308462b61f61SHugh Dickins #ifdef CONFIG_MEMORY_HOTREMOVE 3085ef4d43a8SHugh Dickins /* There is no significance to this priority 100 */ 308662b61f61SHugh Dickins hotplug_memory_notifier(ksm_memory_callback, 100); 308762b61f61SHugh Dickins #endif 308831dbd01fSIzik Eidus return 0; 308931dbd01fSIzik Eidus 3090d9f8984cSLai Jiangshan out_free: 309131dbd01fSIzik Eidus ksm_slab_free(); 309231dbd01fSIzik Eidus out: 309331dbd01fSIzik Eidus return err; 309431dbd01fSIzik Eidus } 3095a64fb3cdSPaul Gortmaker subsys_initcall(ksm_init); 3096