blob: 614b2cce9ad7ceb7c1a958e46f8ec9a8bfa3e80b [file] [log] [blame]
Hugh Dickinsf8af4da2009-09-21 17:01:57 -07001/*
Izik Eidus31dbd012009-09-21 17:02:03 -07002 * Memory merging support.
3 *
4 * This code enables dynamic sharing of identical pages found in different
5 * memory areas, even if they are not shared by fork()
6 *
Izik Eidus36b25282009-09-21 17:02:06 -07007 * Copyright (C) 2008-2009 Red Hat, Inc.
Izik Eidus31dbd012009-09-21 17:02:03 -07008 * Authors:
9 * Izik Eidus
10 * Andrea Arcangeli
11 * Chris Wright
Izik Eidus36b25282009-09-21 17:02:06 -070012 * Hugh Dickins
Izik Eidus31dbd012009-09-21 17:02:03 -070013 *
14 * This work is licensed under the terms of the GNU GPL, version 2.
Hugh Dickinsf8af4da2009-09-21 17:01:57 -070015 */
16
17#include <linux/errno.h>
Izik Eidus31dbd012009-09-21 17:02:03 -070018#include <linux/mm.h>
19#include <linux/fs.h>
Hugh Dickinsf8af4da2009-09-21 17:01:57 -070020#include <linux/mman.h>
Izik Eidus31dbd012009-09-21 17:02:03 -070021#include <linux/sched.h>
22#include <linux/rwsem.h>
23#include <linux/pagemap.h>
24#include <linux/rmap.h>
25#include <linux/spinlock.h>
26#include <linux/jhash.h>
27#include <linux/delay.h>
28#include <linux/kthread.h>
29#include <linux/wait.h>
30#include <linux/slab.h>
31#include <linux/rbtree.h>
Hugh Dickins62b61f62009-12-14 17:59:33 -080032#include <linux/memory.h>
Izik Eidus31dbd012009-09-21 17:02:03 -070033#include <linux/mmu_notifier.h>
Izik Eidus2c6854f2009-09-23 15:56:04 -070034#include <linux/swap.h>
Hugh Dickinsf8af4da2009-09-21 17:01:57 -070035#include <linux/ksm.h>
Sasha Levin4ca3a692013-02-22 16:32:28 -080036#include <linux/hashtable.h>
Andrea Arcangeli878aee72011-01-13 15:47:10 -080037#include <linux/freezer.h>
David Rientjes72788c32011-05-24 17:11:40 -070038#include <linux/oom.h>
Petr Holasek90bd6fd2013-02-22 16:35:00 -080039#include <linux/numa.h>
Hugh Dickinsf8af4da2009-09-21 17:01:57 -070040
Izik Eidus31dbd012009-09-21 17:02:03 -070041#include <asm/tlbflush.h>
Hugh Dickins73848b42009-12-14 17:59:22 -080042#include "internal.h"
Izik Eidus31dbd012009-09-21 17:02:03 -070043
Hugh Dickinse850dcf2013-02-22 16:35:03 -080044#ifdef CONFIG_NUMA
45#define NUMA(x) (x)
46#define DO_NUMA(x) do { (x); } while (0)
47#else
48#define NUMA(x) (0)
49#define DO_NUMA(x) do { } while (0)
50#endif
51
Izik Eidus31dbd012009-09-21 17:02:03 -070052/*
53 * A few notes about the KSM scanning process,
54 * to make it easier to understand the data structures below:
55 *
56 * In order to reduce excessive scanning, KSM sorts the memory pages by their
57 * contents into a data structure that holds pointers to the pages' locations.
58 *
59 * Since the contents of the pages may change at any moment, KSM cannot just
60 * insert the pages into a normal sorted tree and expect it to find anything.
61 * Therefore KSM uses two data structures - the stable and the unstable tree.
62 *
63 * The stable tree holds pointers to all the merged pages (ksm pages), sorted
64 * by their contents. Because each such page is write-protected, searching on
65 * this tree is fully assured to be working (except when pages are unmapped),
66 * and therefore this tree is called the stable tree.
67 *
68 * In addition to the stable tree, KSM uses a second data structure called the
69 * unstable tree: this tree holds pointers to pages which have been found to
70 * be "unchanged for a period of time". The unstable tree sorts these pages
71 * by their contents, but since they are not write-protected, KSM cannot rely
72 * upon the unstable tree to work correctly - the unstable tree is liable to
73 * be corrupted as its contents are modified, and so it is called unstable.
74 *
75 * KSM solves this problem by several techniques:
76 *
77 * 1) The unstable tree is flushed every time KSM completes scanning all
78 * memory areas, and then the tree is rebuilt again from the beginning.
79 * 2) KSM will only insert into the unstable tree, pages whose hash value
80 * has not changed since the previous scan of all memory areas.
81 * 3) The unstable tree is a RedBlack Tree - so its balancing is based on the
82 * colors of the nodes and not on their contents, assuring that even when
83 * the tree gets "corrupted" it won't get out of balance, so scanning time
84 * remains the same (also, searching and inserting nodes in an rbtree uses
85 * the same algorithm, so we have no overhead when we flush and rebuild).
86 * 4) KSM never flushes the stable tree, which means that even if it were to
87 * take 10 attempts to find a page in the unstable tree, once it is found,
88 * it is secured in the stable tree. (When we scan a new page, we first
89 * compare it against the stable tree, and then against the unstable tree.)
Hugh Dickins8fdb3db2013-02-22 16:36:03 -080090 *
91 * If the merge_across_nodes tunable is unset, then KSM maintains multiple
92 * stable trees and multiple unstable trees: one of each for each NUMA node.
Izik Eidus31dbd012009-09-21 17:02:03 -070093 */
94
95/**
96 * struct mm_slot - ksm information per mm that is being scanned
97 * @link: link to the mm_slots hash list
98 * @mm_list: link into the mm_slots list, rooted in ksm_mm_head
Hugh Dickins6514d512009-12-14 17:59:19 -080099 * @rmap_list: head for this mm_slot's singly-linked list of rmap_items
Izik Eidus31dbd012009-09-21 17:02:03 -0700100 * @mm: the mm that this information is valid for
101 */
102struct mm_slot {
103 struct hlist_node link;
104 struct list_head mm_list;
Hugh Dickins6514d512009-12-14 17:59:19 -0800105 struct rmap_item *rmap_list;
Izik Eidus31dbd012009-09-21 17:02:03 -0700106 struct mm_struct *mm;
107};
108
109/**
110 * struct ksm_scan - cursor for scanning
111 * @mm_slot: the current mm_slot we are scanning
112 * @address: the next address inside that to be scanned
Hugh Dickins6514d512009-12-14 17:59:19 -0800113 * @rmap_list: link to the next rmap to be scanned in the rmap_list
Izik Eidus31dbd012009-09-21 17:02:03 -0700114 * @seqnr: count of completed full scans (needed when removing unstable node)
115 *
116 * There is only the one ksm_scan instance of this cursor structure.
117 */
118struct ksm_scan {
119 struct mm_slot *mm_slot;
120 unsigned long address;
Hugh Dickins6514d512009-12-14 17:59:19 -0800121 struct rmap_item **rmap_list;
Izik Eidus31dbd012009-09-21 17:02:03 -0700122 unsigned long seqnr;
123};
124
125/**
Hugh Dickins7b6ba2c2009-12-14 17:59:20 -0800126 * struct stable_node - node of the stable rbtree
127 * @node: rb node of this ksm page in the stable tree
Hugh Dickins4146d2d2013-02-22 16:35:11 -0800128 * @head: (overlaying parent) &migrate_nodes indicates temporarily on that list
129 * @list: linked into migrate_nodes, pending placement in the proper node tree
Hugh Dickins7b6ba2c2009-12-14 17:59:20 -0800130 * @hlist: hlist head of rmap_items using this ksm page
Hugh Dickins4146d2d2013-02-22 16:35:11 -0800131 * @kpfn: page frame number of this ksm page (perhaps temporarily on wrong nid)
132 * @nid: NUMA node id of stable tree in which linked (may not match kpfn)
Hugh Dickins7b6ba2c2009-12-14 17:59:20 -0800133 */
134struct stable_node {
Hugh Dickins4146d2d2013-02-22 16:35:11 -0800135 union {
136 struct rb_node node; /* when node of stable tree */
137 struct { /* when listed for migration */
138 struct list_head *head;
139 struct list_head list;
140 };
141 };
Hugh Dickins7b6ba2c2009-12-14 17:59:20 -0800142 struct hlist_head hlist;
Hugh Dickins62b61f62009-12-14 17:59:33 -0800143 unsigned long kpfn;
Hugh Dickins4146d2d2013-02-22 16:35:11 -0800144#ifdef CONFIG_NUMA
145 int nid;
146#endif
Hugh Dickins7b6ba2c2009-12-14 17:59:20 -0800147};
148
149/**
Izik Eidus31dbd012009-09-21 17:02:03 -0700150 * struct rmap_item - reverse mapping item for virtual addresses
Hugh Dickins6514d512009-12-14 17:59:19 -0800151 * @rmap_list: next rmap_item in mm_slot's singly-linked rmap_list
Hugh Dickinsdb114b82009-12-14 17:59:25 -0800152 * @anon_vma: pointer to anon_vma for this mm,address, when in stable tree
Hugh Dickinsbc566202013-02-22 16:36:06 -0800153 * @nid: NUMA node id of unstable tree in which linked (may not match page)
Izik Eidus31dbd012009-09-21 17:02:03 -0700154 * @mm: the memory structure this rmap_item is pointing into
155 * @address: the virtual address this rmap_item tracks (+ flags in low bits)
156 * @oldchecksum: previous checksum of the page at that virtual address
Hugh Dickins7b6ba2c2009-12-14 17:59:20 -0800157 * @node: rb node of this rmap_item in the unstable tree
158 * @head: pointer to stable_node heading this list in the stable tree
159 * @hlist: link into hlist of rmap_items hanging off that stable_node
Izik Eidus31dbd012009-09-21 17:02:03 -0700160 */
161struct rmap_item {
Hugh Dickins6514d512009-12-14 17:59:19 -0800162 struct rmap_item *rmap_list;
Hugh Dickinsbc566202013-02-22 16:36:06 -0800163 union {
164 struct anon_vma *anon_vma; /* when stable */
165#ifdef CONFIG_NUMA
166 int nid; /* when node of unstable tree */
167#endif
168 };
Izik Eidus31dbd012009-09-21 17:02:03 -0700169 struct mm_struct *mm;
170 unsigned long address; /* + low bits used for flags below */
Hugh Dickins7b6ba2c2009-12-14 17:59:20 -0800171 unsigned int oldchecksum; /* when unstable */
Izik Eidus31dbd012009-09-21 17:02:03 -0700172 union {
Hugh Dickins7b6ba2c2009-12-14 17:59:20 -0800173 struct rb_node node; /* when node of unstable tree */
174 struct { /* when listed from stable tree */
175 struct stable_node *head;
176 struct hlist_node hlist;
177 };
Izik Eidus31dbd012009-09-21 17:02:03 -0700178 };
179};
180
181#define SEQNR_MASK 0x0ff /* low bits of unstable tree seqnr */
Hugh Dickins7b6ba2c2009-12-14 17:59:20 -0800182#define UNSTABLE_FLAG 0x100 /* is a node of the unstable tree */
183#define STABLE_FLAG 0x200 /* is listed from the stable tree */
Izik Eidus31dbd012009-09-21 17:02:03 -0700184
185/* The stable and unstable tree heads */
Hugh Dickinsef53d16c2013-02-22 16:36:12 -0800186static struct rb_root one_stable_tree[1] = { RB_ROOT };
187static struct rb_root one_unstable_tree[1] = { RB_ROOT };
188static struct rb_root *root_stable_tree = one_stable_tree;
189static struct rb_root *root_unstable_tree = one_unstable_tree;
Izik Eidus31dbd012009-09-21 17:02:03 -0700190
Hugh Dickins4146d2d2013-02-22 16:35:11 -0800191/* Recently migrated nodes of stable tree, pending proper placement */
192static LIST_HEAD(migrate_nodes);
193
Sasha Levin4ca3a692013-02-22 16:32:28 -0800194#define MM_SLOTS_HASH_BITS 10
195static DEFINE_HASHTABLE(mm_slots_hash, MM_SLOTS_HASH_BITS);
Izik Eidus31dbd012009-09-21 17:02:03 -0700196
197static struct mm_slot ksm_mm_head = {
198 .mm_list = LIST_HEAD_INIT(ksm_mm_head.mm_list),
199};
200static struct ksm_scan ksm_scan = {
201 .mm_slot = &ksm_mm_head,
202};
203
204static struct kmem_cache *rmap_item_cache;
Hugh Dickins7b6ba2c2009-12-14 17:59:20 -0800205static struct kmem_cache *stable_node_cache;
Izik Eidus31dbd012009-09-21 17:02:03 -0700206static struct kmem_cache *mm_slot_cache;
207
208/* The number of nodes in the stable tree */
Hugh Dickinsb4028262009-09-21 17:02:09 -0700209static unsigned long ksm_pages_shared;
Izik Eidus31dbd012009-09-21 17:02:03 -0700210
Hugh Dickinse178dfd2009-09-21 17:02:10 -0700211/* The number of page slots additionally sharing those nodes */
Hugh Dickinsb4028262009-09-21 17:02:09 -0700212static unsigned long ksm_pages_sharing;
Izik Eidus31dbd012009-09-21 17:02:03 -0700213
Hugh Dickins473b0ce2009-09-21 17:02:11 -0700214/* The number of nodes in the unstable tree */
215static unsigned long ksm_pages_unshared;
216
217/* The number of rmap_items in use: to calculate pages_volatile */
218static unsigned long ksm_rmap_items;
219
Izik Eidus31dbd012009-09-21 17:02:03 -0700220/* Number of pages ksmd should scan in one batch */
Izik Eidus2c6854f2009-09-23 15:56:04 -0700221static unsigned int ksm_thread_pages_to_scan = 100;
Izik Eidus31dbd012009-09-21 17:02:03 -0700222
223/* Milliseconds ksmd should sleep between batches */
Hugh Dickins2ffd8672009-09-21 17:02:23 -0700224static unsigned int ksm_thread_sleep_millisecs = 20;
Izik Eidus31dbd012009-09-21 17:02:03 -0700225
Hugh Dickinse850dcf2013-02-22 16:35:03 -0800226#ifdef CONFIG_NUMA
Petr Holasek90bd6fd2013-02-22 16:35:00 -0800227/* Zeroed when merging across nodes is not allowed */
228static unsigned int ksm_merge_across_nodes = 1;
Hugh Dickinsef53d16c2013-02-22 16:36:12 -0800229static int ksm_nr_node_ids = 1;
Hugh Dickinse850dcf2013-02-22 16:35:03 -0800230#else
231#define ksm_merge_across_nodes 1U
Hugh Dickinsef53d16c2013-02-22 16:36:12 -0800232#define ksm_nr_node_ids 1
Hugh Dickinse850dcf2013-02-22 16:35:03 -0800233#endif
Petr Holasek90bd6fd2013-02-22 16:35:00 -0800234
Izik Eidus31dbd012009-09-21 17:02:03 -0700235#define KSM_RUN_STOP 0
236#define KSM_RUN_MERGE 1
237#define KSM_RUN_UNMERGE 2
Hugh Dickinsef4d43a2013-02-22 16:35:16 -0800238#define KSM_RUN_OFFLINE 4
239static unsigned long ksm_run = KSM_RUN_STOP;
240static void wait_while_offlining(void);
Izik Eidus31dbd012009-09-21 17:02:03 -0700241
242static DECLARE_WAIT_QUEUE_HEAD(ksm_thread_wait);
243static DEFINE_MUTEX(ksm_thread_mutex);
244static DEFINE_SPINLOCK(ksm_mmlist_lock);
245
246#define KSM_KMEM_CACHE(__struct, __flags) kmem_cache_create("ksm_"#__struct,\
247 sizeof(struct __struct), __alignof__(struct __struct),\
248 (__flags), NULL)
249
250static int __init ksm_slab_init(void)
251{
252 rmap_item_cache = KSM_KMEM_CACHE(rmap_item, 0);
253 if (!rmap_item_cache)
254 goto out;
255
Hugh Dickins7b6ba2c2009-12-14 17:59:20 -0800256 stable_node_cache = KSM_KMEM_CACHE(stable_node, 0);
257 if (!stable_node_cache)
258 goto out_free1;
259
Izik Eidus31dbd012009-09-21 17:02:03 -0700260 mm_slot_cache = KSM_KMEM_CACHE(mm_slot, 0);
261 if (!mm_slot_cache)
Hugh Dickins7b6ba2c2009-12-14 17:59:20 -0800262 goto out_free2;
Izik Eidus31dbd012009-09-21 17:02:03 -0700263
264 return 0;
265
Hugh Dickins7b6ba2c2009-12-14 17:59:20 -0800266out_free2:
267 kmem_cache_destroy(stable_node_cache);
268out_free1:
Izik Eidus31dbd012009-09-21 17:02:03 -0700269 kmem_cache_destroy(rmap_item_cache);
270out:
271 return -ENOMEM;
272}
273
274static void __init ksm_slab_free(void)
275{
276 kmem_cache_destroy(mm_slot_cache);
Hugh Dickins7b6ba2c2009-12-14 17:59:20 -0800277 kmem_cache_destroy(stable_node_cache);
Izik Eidus31dbd012009-09-21 17:02:03 -0700278 kmem_cache_destroy(rmap_item_cache);
279 mm_slot_cache = NULL;
280}
281
282static inline struct rmap_item *alloc_rmap_item(void)
283{
Hugh Dickins473b0ce2009-09-21 17:02:11 -0700284 struct rmap_item *rmap_item;
285
zhong jiang5b398e42016-09-28 15:22:30 -0700286 rmap_item = kmem_cache_zalloc(rmap_item_cache, GFP_KERNEL |
287 __GFP_NORETRY | __GFP_NOWARN);
Hugh Dickins473b0ce2009-09-21 17:02:11 -0700288 if (rmap_item)
289 ksm_rmap_items++;
290 return rmap_item;
Izik Eidus31dbd012009-09-21 17:02:03 -0700291}
292
293static inline void free_rmap_item(struct rmap_item *rmap_item)
294{
Hugh Dickins473b0ce2009-09-21 17:02:11 -0700295 ksm_rmap_items--;
Izik Eidus31dbd012009-09-21 17:02:03 -0700296 rmap_item->mm = NULL; /* debug safety */
297 kmem_cache_free(rmap_item_cache, rmap_item);
298}
299
Hugh Dickins7b6ba2c2009-12-14 17:59:20 -0800300static inline struct stable_node *alloc_stable_node(void)
301{
zhong jiang62130552016-10-07 17:01:19 -0700302 /*
303 * The allocation can take too long with GFP_KERNEL when memory is under
304 * pressure, which may lead to hung task warnings. Adding __GFP_HIGH
305 * grants access to memory reserves, helping to avoid this problem.
306 */
307 return kmem_cache_alloc(stable_node_cache, GFP_KERNEL | __GFP_HIGH);
Hugh Dickins7b6ba2c2009-12-14 17:59:20 -0800308}
309
310static inline void free_stable_node(struct stable_node *stable_node)
311{
312 kmem_cache_free(stable_node_cache, stable_node);
313}
314
Izik Eidus31dbd012009-09-21 17:02:03 -0700315static inline struct mm_slot *alloc_mm_slot(void)
316{
317 if (!mm_slot_cache) /* initialization failed */
318 return NULL;
319 return kmem_cache_zalloc(mm_slot_cache, GFP_KERNEL);
320}
321
322static inline void free_mm_slot(struct mm_slot *mm_slot)
323{
324 kmem_cache_free(mm_slot_cache, mm_slot);
325}
326
Izik Eidus31dbd012009-09-21 17:02:03 -0700327static struct mm_slot *get_mm_slot(struct mm_struct *mm)
328{
Sasha Levin4ca3a692013-02-22 16:32:28 -0800329 struct mm_slot *slot;
Izik Eidus31dbd012009-09-21 17:02:03 -0700330
Sasha Levinb67bfe02013-02-27 17:06:00 -0800331 hash_for_each_possible(mm_slots_hash, slot, link, (unsigned long)mm)
Sasha Levin4ca3a692013-02-22 16:32:28 -0800332 if (slot->mm == mm)
333 return slot;
334
Izik Eidus31dbd012009-09-21 17:02:03 -0700335 return NULL;
336}
337
338static void insert_to_mm_slots_hash(struct mm_struct *mm,
339 struct mm_slot *mm_slot)
340{
Izik Eidus31dbd012009-09-21 17:02:03 -0700341 mm_slot->mm = mm;
Sasha Levin4ca3a692013-02-22 16:32:28 -0800342 hash_add(mm_slots_hash, &mm_slot->link, (unsigned long)mm);
Izik Eidus31dbd012009-09-21 17:02:03 -0700343}
344
Izik Eidus31dbd012009-09-21 17:02:03 -0700345/*
Hugh Dickinsa913e182009-09-21 17:02:26 -0700346 * ksmd, and unmerge_and_remove_all_rmap_items(), must not touch an mm's
347 * page tables after it has passed through ksm_exit() - which, if necessary,
348 * takes mmap_sem briefly to serialize against them. ksm_exit() does not set
349 * a special flag: they can just back out as soon as mm_users goes to zero.
350 * ksm_test_exit() is used throughout to make this test for exit: in some
351 * places for correctness, in some places just to avoid unnecessary work.
352 */
353static inline bool ksm_test_exit(struct mm_struct *mm)
354{
355 return atomic_read(&mm->mm_users) == 0;
356}
357
358/*
Izik Eidus31dbd012009-09-21 17:02:03 -0700359 * We use break_ksm to break COW on a ksm page: it's a stripped down
360 *
Dave Hansend4edcf02016-02-12 13:01:56 -0800361 * if (get_user_pages(addr, 1, 1, 1, &page, NULL) == 1)
Izik Eidus31dbd012009-09-21 17:02:03 -0700362 * put_page(page);
363 *
364 * but taking great care only to touch a ksm page, in a VM_MERGEABLE vma,
365 * in case the application has unmapped and remapped mm,addr meanwhile.
366 * Could a ksm page appear anywhere else? Actually yes, in a VM_PFNMAP
367 * mmap of /dev/mem or /dev/kmem, where we would not want to touch it.
Dave Hansen1b2ee122016-02-12 13:02:21 -0800368 *
369 * FAULT_FLAG/FOLL_REMOTE are because we do this outside the context
370 * of the process that owns 'vma'. We also do not want to enforce
371 * protection keys here anyway.
Izik Eidus31dbd012009-09-21 17:02:03 -0700372 */
Hugh Dickinsd952b792009-09-21 17:02:16 -0700373static int break_ksm(struct vm_area_struct *vma, unsigned long addr)
Izik Eidus31dbd012009-09-21 17:02:03 -0700374{
375 struct page *page;
Hugh Dickinsd952b792009-09-21 17:02:16 -0700376 int ret = 0;
Izik Eidus31dbd012009-09-21 17:02:03 -0700377
378 do {
379 cond_resched();
Dave Hansen1b2ee122016-02-12 13:02:21 -0800380 page = follow_page(vma, addr,
381 FOLL_GET | FOLL_MIGRATION | FOLL_REMOTE);
Dan Carpenter22eccdd2010-04-23 13:18:10 -0400382 if (IS_ERR_OR_NULL(page))
Izik Eidus31dbd012009-09-21 17:02:03 -0700383 break;
384 if (PageKsm(page))
Kirill A. Shutemovdcddffd2016-07-26 15:25:18 -0700385 ret = handle_mm_fault(vma, addr,
386 FAULT_FLAG_WRITE | FAULT_FLAG_REMOTE);
Izik Eidus31dbd012009-09-21 17:02:03 -0700387 else
388 ret = VM_FAULT_WRITE;
389 put_page(page);
Linus Torvalds33692f22015-01-29 10:51:32 -0800390 } while (!(ret & (VM_FAULT_WRITE | VM_FAULT_SIGBUS | VM_FAULT_SIGSEGV | VM_FAULT_OOM)));
Hugh Dickinsd952b792009-09-21 17:02:16 -0700391 /*
392 * We must loop because handle_mm_fault() may back out if there's
393 * any difficulty e.g. if pte accessed bit gets updated concurrently.
394 *
395 * VM_FAULT_WRITE is what we have been hoping for: it indicates that
396 * COW has been broken, even if the vma does not permit VM_WRITE;
397 * but note that a concurrent fault might break PageKsm for us.
398 *
399 * VM_FAULT_SIGBUS could occur if we race with truncation of the
400 * backing file, which also invalidates anonymous pages: that's
401 * okay, that truncation will have unmapped the PageKsm for us.
402 *
403 * VM_FAULT_OOM: at the time of writing (late July 2009), setting
404 * aside mem_cgroup limits, VM_FAULT_OOM would only be set if the
405 * current task has TIF_MEMDIE set, and will be OOM killed on return
406 * to user; and ksmd, having no mm, would never be chosen for that.
407 *
408 * But if the mm is in a limited mem_cgroup, then the fault may fail
409 * with VM_FAULT_OOM even if the current task is not TIF_MEMDIE; and
410 * even ksmd can fail in this way - though it's usually breaking ksm
411 * just to undo a merge it made a moment before, so unlikely to oom.
412 *
413 * That's a pity: we might therefore have more kernel pages allocated
414 * than we're counting as nodes in the stable tree; but ksm_do_scan
415 * will retry to break_cow on each pass, so should recover the page
416 * in due course. The important thing is to not let VM_MERGEABLE
417 * be cleared while any such pages might remain in the area.
418 */
419 return (ret & VM_FAULT_OOM) ? -ENOMEM : 0;
Izik Eidus31dbd012009-09-21 17:02:03 -0700420}
421
Bob Liuef694222012-03-21 16:34:11 -0700422static struct vm_area_struct *find_mergeable_vma(struct mm_struct *mm,
423 unsigned long addr)
424{
425 struct vm_area_struct *vma;
426 if (ksm_test_exit(mm))
427 return NULL;
428 vma = find_vma(mm, addr);
429 if (!vma || vma->vm_start > addr)
430 return NULL;
431 if (!(vma->vm_flags & VM_MERGEABLE) || !vma->anon_vma)
432 return NULL;
433 return vma;
434}
435
Hugh Dickins8dd35572009-12-14 17:59:18 -0800436static void break_cow(struct rmap_item *rmap_item)
Izik Eidus31dbd012009-09-21 17:02:03 -0700437{
Hugh Dickins8dd35572009-12-14 17:59:18 -0800438 struct mm_struct *mm = rmap_item->mm;
439 unsigned long addr = rmap_item->address;
Izik Eidus31dbd012009-09-21 17:02:03 -0700440 struct vm_area_struct *vma;
441
Hugh Dickins4035c07a2009-12-14 17:59:27 -0800442 /*
443 * It is not an accident that whenever we want to break COW
444 * to undo, we also need to drop a reference to the anon_vma.
445 */
Peter Zijlstra9e601092011-03-22 16:32:46 -0700446 put_anon_vma(rmap_item->anon_vma);
Hugh Dickins4035c07a2009-12-14 17:59:27 -0800447
Hugh Dickins81464e302009-09-21 17:02:15 -0700448 down_read(&mm->mmap_sem);
Bob Liuef694222012-03-21 16:34:11 -0700449 vma = find_mergeable_vma(mm, addr);
450 if (vma)
451 break_ksm(vma, addr);
Izik Eidus31dbd012009-09-21 17:02:03 -0700452 up_read(&mm->mmap_sem);
453}
454
455static struct page *get_mergeable_page(struct rmap_item *rmap_item)
456{
457 struct mm_struct *mm = rmap_item->mm;
458 unsigned long addr = rmap_item->address;
459 struct vm_area_struct *vma;
460 struct page *page;
461
462 down_read(&mm->mmap_sem);
Bob Liuef694222012-03-21 16:34:11 -0700463 vma = find_mergeable_vma(mm, addr);
464 if (!vma)
Izik Eidus31dbd012009-09-21 17:02:03 -0700465 goto out;
466
467 page = follow_page(vma, addr, FOLL_GET);
Dan Carpenter22eccdd2010-04-23 13:18:10 -0400468 if (IS_ERR_OR_NULL(page))
Izik Eidus31dbd012009-09-21 17:02:03 -0700469 goto out;
Kirill A. Shutemovf765f542016-01-15 16:53:03 -0800470 if (PageAnon(page)) {
Izik Eidus31dbd012009-09-21 17:02:03 -0700471 flush_anon_page(vma, page, addr);
472 flush_dcache_page(page);
473 } else {
474 put_page(page);
Andrea Arcangelic8f95ed2015-11-05 18:49:19 -0800475out:
476 page = NULL;
Izik Eidus31dbd012009-09-21 17:02:03 -0700477 }
478 up_read(&mm->mmap_sem);
479 return page;
480}
481
Petr Holasek90bd6fd2013-02-22 16:35:00 -0800482/*
483 * This helper is used for getting right index into array of tree roots.
484 * When merge_across_nodes knob is set to 1, there are only two rb-trees for
485 * stable and unstable pages from all nodes with roots in index 0. Otherwise,
486 * every node has its own stable and unstable tree.
487 */
488static inline int get_kpfn_nid(unsigned long kpfn)
489{
Hugh Dickinsd8fc16a2013-03-08 12:43:34 -0800490 return ksm_merge_across_nodes ? 0 : NUMA(pfn_to_nid(kpfn));
Petr Holasek90bd6fd2013-02-22 16:35:00 -0800491}
492
Hugh Dickins4035c07a2009-12-14 17:59:27 -0800493static void remove_node_from_stable_tree(struct stable_node *stable_node)
494{
495 struct rmap_item *rmap_item;
Hugh Dickins4035c07a2009-12-14 17:59:27 -0800496
Sasha Levinb67bfe02013-02-27 17:06:00 -0800497 hlist_for_each_entry(rmap_item, &stable_node->hlist, hlist) {
Hugh Dickins4035c07a2009-12-14 17:59:27 -0800498 if (rmap_item->hlist.next)
499 ksm_pages_sharing--;
500 else
501 ksm_pages_shared--;
Peter Zijlstra9e601092011-03-22 16:32:46 -0700502 put_anon_vma(rmap_item->anon_vma);
Hugh Dickins4035c07a2009-12-14 17:59:27 -0800503 rmap_item->address &= PAGE_MASK;
504 cond_resched();
505 }
506
Hugh Dickins4146d2d2013-02-22 16:35:11 -0800507 if (stable_node->head == &migrate_nodes)
508 list_del(&stable_node->list);
509 else
510 rb_erase(&stable_node->node,
Hugh Dickinsef53d16c2013-02-22 16:36:12 -0800511 root_stable_tree + NUMA(stable_node->nid));
Hugh Dickins4035c07a2009-12-14 17:59:27 -0800512 free_stable_node(stable_node);
513}
514
515/*
516 * get_ksm_page: checks if the page indicated by the stable node
517 * is still its ksm page, despite having held no reference to it.
518 * In which case we can trust the content of the page, and it
519 * returns the gotten page; but if the page has now been zapped,
520 * remove the stale node from the stable tree and return NULL.
Hugh Dickinsc8d65532013-02-22 16:35:10 -0800521 * But beware, the stable node's page might be being migrated.
Hugh Dickins4035c07a2009-12-14 17:59:27 -0800522 *
523 * You would expect the stable_node to hold a reference to the ksm page.
524 * But if it increments the page's count, swapping out has to wait for
525 * ksmd to come around again before it can free the page, which may take
526 * seconds or even minutes: much too unresponsive. So instead we use a
527 * "keyhole reference": access to the ksm page from the stable node peeps
528 * out through its keyhole to see if that page still holds the right key,
529 * pointing back to this stable node. This relies on freeing a PageAnon
530 * page to reset its page->mapping to NULL, and relies on no other use of
531 * a page to put something that might look like our key in page->mapping.
Hugh Dickins4035c07a2009-12-14 17:59:27 -0800532 * is on its way to being freed; but it is an anomaly to bear in mind.
533 */
Hugh Dickins8fdb3db2013-02-22 16:36:03 -0800534static struct page *get_ksm_page(struct stable_node *stable_node, bool lock_it)
Hugh Dickins4035c07a2009-12-14 17:59:27 -0800535{
536 struct page *page;
537 void *expected_mapping;
Hugh Dickinsc8d65532013-02-22 16:35:10 -0800538 unsigned long kpfn;
Hugh Dickins4035c07a2009-12-14 17:59:27 -0800539
Minchan Kimbda807d2016-07-26 15:23:05 -0700540 expected_mapping = (void *)((unsigned long)stable_node |
541 PAGE_MAPPING_KSM);
Hugh Dickinsc8d65532013-02-22 16:35:10 -0800542again:
Jason Low4db0c3c2015-04-15 16:14:08 -0700543 kpfn = READ_ONCE(stable_node->kpfn);
Hugh Dickinsc8d65532013-02-22 16:35:10 -0800544 page = pfn_to_page(kpfn);
545
546 /*
547 * page is computed from kpfn, so on most architectures reading
548 * page->mapping is naturally ordered after reading node->kpfn,
549 * but on Alpha we need to be more careful.
550 */
551 smp_read_barrier_depends();
Jason Low4db0c3c2015-04-15 16:14:08 -0700552 if (READ_ONCE(page->mapping) != expected_mapping)
Hugh Dickins4035c07a2009-12-14 17:59:27 -0800553 goto stale;
Hugh Dickinsc8d65532013-02-22 16:35:10 -0800554
555 /*
556 * We cannot do anything with the page while its refcount is 0.
557 * Usually 0 means free, or tail of a higher-order page: in which
558 * case this node is no longer referenced, and should be freed;
559 * however, it might mean that the page is under page_freeze_refs().
560 * The __remove_mapping() case is easy, again the node is now stale;
561 * but if page is swapcache in migrate_page_move_mapping(), it might
562 * still be our page, in which case it's essential to keep the node.
563 */
564 while (!get_page_unless_zero(page)) {
565 /*
566 * Another check for page->mapping != expected_mapping would
567 * work here too. We have chosen the !PageSwapCache test to
568 * optimize the common case, when the page is or is about to
569 * be freed: PageSwapCache is cleared (under spin_lock_irq)
570 * in the freeze_refs section of __remove_mapping(); but Anon
571 * page->mapping reset to NULL later, in free_pages_prepare().
572 */
573 if (!PageSwapCache(page))
574 goto stale;
575 cpu_relax();
576 }
577
Jason Low4db0c3c2015-04-15 16:14:08 -0700578 if (READ_ONCE(page->mapping) != expected_mapping) {
Hugh Dickins4035c07a2009-12-14 17:59:27 -0800579 put_page(page);
580 goto stale;
581 }
Hugh Dickinsc8d65532013-02-22 16:35:10 -0800582
Hugh Dickins8fdb3db2013-02-22 16:36:03 -0800583 if (lock_it) {
Hugh Dickins8aafa6a2013-02-22 16:35:06 -0800584 lock_page(page);
Jason Low4db0c3c2015-04-15 16:14:08 -0700585 if (READ_ONCE(page->mapping) != expected_mapping) {
Hugh Dickins8aafa6a2013-02-22 16:35:06 -0800586 unlock_page(page);
587 put_page(page);
588 goto stale;
589 }
590 }
Hugh Dickins4035c07a2009-12-14 17:59:27 -0800591 return page;
Hugh Dickinsc8d65532013-02-22 16:35:10 -0800592
Hugh Dickins4035c07a2009-12-14 17:59:27 -0800593stale:
Hugh Dickinsc8d65532013-02-22 16:35:10 -0800594 /*
595 * We come here from above when page->mapping or !PageSwapCache
596 * suggests that the node is stale; but it might be under migration.
597 * We need smp_rmb(), matching the smp_wmb() in ksm_migrate_page(),
598 * before checking whether node->kpfn has been changed.
599 */
600 smp_rmb();
Jason Low4db0c3c2015-04-15 16:14:08 -0700601 if (READ_ONCE(stable_node->kpfn) != kpfn)
Hugh Dickinsc8d65532013-02-22 16:35:10 -0800602 goto again;
Hugh Dickins4035c07a2009-12-14 17:59:27 -0800603 remove_node_from_stable_tree(stable_node);
604 return NULL;
605}
606
Izik Eidus31dbd012009-09-21 17:02:03 -0700607/*
Izik Eidus31dbd012009-09-21 17:02:03 -0700608 * Removing rmap_item from stable or unstable tree.
609 * This function will clean the information from the stable/unstable tree.
610 */
611static void remove_rmap_item_from_tree(struct rmap_item *rmap_item)
612{
Hugh Dickins7b6ba2c2009-12-14 17:59:20 -0800613 if (rmap_item->address & STABLE_FLAG) {
614 struct stable_node *stable_node;
Hugh Dickins5ad64682009-12-14 17:59:24 -0800615 struct page *page;
Izik Eidus31dbd012009-09-21 17:02:03 -0700616
Hugh Dickins7b6ba2c2009-12-14 17:59:20 -0800617 stable_node = rmap_item->head;
Hugh Dickins8aafa6a2013-02-22 16:35:06 -0800618 page = get_ksm_page(stable_node, true);
Hugh Dickins4035c07a2009-12-14 17:59:27 -0800619 if (!page)
620 goto out;
621
Hugh Dickins7b6ba2c2009-12-14 17:59:20 -0800622 hlist_del(&rmap_item->hlist);
Hugh Dickins4035c07a2009-12-14 17:59:27 -0800623 unlock_page(page);
624 put_page(page);
Hugh Dickins08beca42009-12-14 17:59:21 -0800625
Andrea Arcangeli98666f8a2015-11-05 18:49:13 -0800626 if (!hlist_empty(&stable_node->hlist))
Hugh Dickins4035c07a2009-12-14 17:59:27 -0800627 ksm_pages_sharing--;
628 else
Hugh Dickins7b6ba2c2009-12-14 17:59:20 -0800629 ksm_pages_shared--;
Izik Eidus31dbd012009-09-21 17:02:03 -0700630
Peter Zijlstra9e601092011-03-22 16:32:46 -0700631 put_anon_vma(rmap_item->anon_vma);
Hugh Dickins93d17712009-12-14 17:59:16 -0800632 rmap_item->address &= PAGE_MASK;
Izik Eidus31dbd012009-09-21 17:02:03 -0700633
Hugh Dickins7b6ba2c2009-12-14 17:59:20 -0800634 } else if (rmap_item->address & UNSTABLE_FLAG) {
Izik Eidus31dbd012009-09-21 17:02:03 -0700635 unsigned char age;
636 /*
Hugh Dickins9ba69292009-09-21 17:02:20 -0700637 * Usually ksmd can and must skip the rb_erase, because
Izik Eidus31dbd012009-09-21 17:02:03 -0700638 * root_unstable_tree was already reset to RB_ROOT.
Hugh Dickins9ba69292009-09-21 17:02:20 -0700639 * But be careful when an mm is exiting: do the rb_erase
640 * if this rmap_item was inserted by this scan, rather
641 * than left over from before.
Izik Eidus31dbd012009-09-21 17:02:03 -0700642 */
643 age = (unsigned char)(ksm_scan.seqnr - rmap_item->address);
Hugh Dickinscd551f92009-09-21 17:02:17 -0700644 BUG_ON(age > 1);
Izik Eidus31dbd012009-09-21 17:02:03 -0700645 if (!age)
Petr Holasek90bd6fd2013-02-22 16:35:00 -0800646 rb_erase(&rmap_item->node,
Hugh Dickinsef53d16c2013-02-22 16:36:12 -0800647 root_unstable_tree + NUMA(rmap_item->nid));
Hugh Dickins93d17712009-12-14 17:59:16 -0800648 ksm_pages_unshared--;
649 rmap_item->address &= PAGE_MASK;
650 }
Hugh Dickins4035c07a2009-12-14 17:59:27 -0800651out:
Izik Eidus31dbd012009-09-21 17:02:03 -0700652 cond_resched(); /* we're called from many long loops */
653}
654
Izik Eidus31dbd012009-09-21 17:02:03 -0700655static void remove_trailing_rmap_items(struct mm_slot *mm_slot,
Hugh Dickins6514d512009-12-14 17:59:19 -0800656 struct rmap_item **rmap_list)
Izik Eidus31dbd012009-09-21 17:02:03 -0700657{
Hugh Dickins6514d512009-12-14 17:59:19 -0800658 while (*rmap_list) {
659 struct rmap_item *rmap_item = *rmap_list;
660 *rmap_list = rmap_item->rmap_list;
Izik Eidus31dbd012009-09-21 17:02:03 -0700661 remove_rmap_item_from_tree(rmap_item);
Izik Eidus31dbd012009-09-21 17:02:03 -0700662 free_rmap_item(rmap_item);
663 }
664}
665
666/*
Hugh Dickinse850dcf2013-02-22 16:35:03 -0800667 * Though it's very tempting to unmerge rmap_items from stable tree rather
Izik Eidus31dbd012009-09-21 17:02:03 -0700668 * than check every pte of a given vma, the locking doesn't quite work for
669 * that - an rmap_item is assigned to the stable tree after inserting ksm
670 * page and upping mmap_sem. Nor does it fit with the way we skip dup'ing
671 * rmap_items from parent to child at fork time (so as not to waste time
672 * if exit comes before the next scan reaches it).
Hugh Dickins81464e302009-09-21 17:02:15 -0700673 *
674 * Similarly, although we'd like to remove rmap_items (so updating counts
675 * and freeing memory) when unmerging an area, it's easier to leave that
676 * to the next pass of ksmd - consider, for example, how ksmd might be
677 * in cmp_and_merge_page on one of the rmap_items we would be removing.
Izik Eidus31dbd012009-09-21 17:02:03 -0700678 */
Hugh Dickinsd952b792009-09-21 17:02:16 -0700679static int unmerge_ksm_pages(struct vm_area_struct *vma,
680 unsigned long start, unsigned long end)
Izik Eidus31dbd012009-09-21 17:02:03 -0700681{
682 unsigned long addr;
Hugh Dickinsd952b792009-09-21 17:02:16 -0700683 int err = 0;
Izik Eidus31dbd012009-09-21 17:02:03 -0700684
Hugh Dickinsd952b792009-09-21 17:02:16 -0700685 for (addr = start; addr < end && !err; addr += PAGE_SIZE) {
Hugh Dickins9ba69292009-09-21 17:02:20 -0700686 if (ksm_test_exit(vma->vm_mm))
687 break;
Hugh Dickinsd952b792009-09-21 17:02:16 -0700688 if (signal_pending(current))
689 err = -ERESTARTSYS;
690 else
691 err = break_ksm(vma, addr);
692 }
693 return err;
Izik Eidus31dbd012009-09-21 17:02:03 -0700694}
695
Hugh Dickins2ffd8672009-09-21 17:02:23 -0700696#ifdef CONFIG_SYSFS
697/*
698 * Only called through the sysfs control interface:
699 */
Hugh Dickinscbf86cf2013-02-22 16:35:08 -0800700static int remove_stable_node(struct stable_node *stable_node)
701{
702 struct page *page;
703 int err;
704
705 page = get_ksm_page(stable_node, true);
706 if (!page) {
707 /*
708 * get_ksm_page did remove_node_from_stable_tree itself.
709 */
710 return 0;
711 }
712
Hugh Dickins8fdb3db2013-02-22 16:36:03 -0800713 if (WARN_ON_ONCE(page_mapped(page))) {
Hugh Dickinscbf86cf2013-02-22 16:35:08 -0800714 /*
Hugh Dickins8fdb3db2013-02-22 16:36:03 -0800715 * This should not happen: but if it does, just refuse to let
716 * merge_across_nodes be switched - there is no need to panic.
717 */
718 err = -EBUSY;
719 } else {
720 /*
721 * The stable node did not yet appear stale to get_ksm_page(),
722 * since that allows for an unmapped ksm page to be recognized
723 * right up until it is freed; but the node is safe to remove.
Hugh Dickinscbf86cf2013-02-22 16:35:08 -0800724 * This page might be in a pagevec waiting to be freed,
725 * or it might be PageSwapCache (perhaps under writeback),
726 * or it might have been removed from swapcache a moment ago.
727 */
728 set_page_stable_node(page, NULL);
729 remove_node_from_stable_tree(stable_node);
730 err = 0;
731 }
732
733 unlock_page(page);
734 put_page(page);
735 return err;
736}
737
738static int remove_all_stable_nodes(void)
739{
Geliang Tang03640412016-01-14 15:20:54 -0800740 struct stable_node *stable_node, *next;
Hugh Dickinscbf86cf2013-02-22 16:35:08 -0800741 int nid;
742 int err = 0;
743
Hugh Dickinsef53d16c2013-02-22 16:36:12 -0800744 for (nid = 0; nid < ksm_nr_node_ids; nid++) {
Hugh Dickinscbf86cf2013-02-22 16:35:08 -0800745 while (root_stable_tree[nid].rb_node) {
746 stable_node = rb_entry(root_stable_tree[nid].rb_node,
747 struct stable_node, node);
748 if (remove_stable_node(stable_node)) {
749 err = -EBUSY;
750 break; /* proceed to next nid */
751 }
752 cond_resched();
753 }
754 }
Geliang Tang03640412016-01-14 15:20:54 -0800755 list_for_each_entry_safe(stable_node, next, &migrate_nodes, list) {
Hugh Dickins4146d2d2013-02-22 16:35:11 -0800756 if (remove_stable_node(stable_node))
757 err = -EBUSY;
758 cond_resched();
759 }
Hugh Dickinscbf86cf2013-02-22 16:35:08 -0800760 return err;
761}
762
Hugh Dickinsd952b792009-09-21 17:02:16 -0700763static int unmerge_and_remove_all_rmap_items(void)
Izik Eidus31dbd012009-09-21 17:02:03 -0700764{
765 struct mm_slot *mm_slot;
766 struct mm_struct *mm;
767 struct vm_area_struct *vma;
Hugh Dickinsd952b792009-09-21 17:02:16 -0700768 int err = 0;
Izik Eidus31dbd012009-09-21 17:02:03 -0700769
Hugh Dickinsd952b792009-09-21 17:02:16 -0700770 spin_lock(&ksm_mmlist_lock);
Hugh Dickins9ba69292009-09-21 17:02:20 -0700771 ksm_scan.mm_slot = list_entry(ksm_mm_head.mm_list.next,
Hugh Dickinsd952b792009-09-21 17:02:16 -0700772 struct mm_slot, mm_list);
773 spin_unlock(&ksm_mmlist_lock);
774
Hugh Dickins9ba69292009-09-21 17:02:20 -0700775 for (mm_slot = ksm_scan.mm_slot;
776 mm_slot != &ksm_mm_head; mm_slot = ksm_scan.mm_slot) {
Izik Eidus31dbd012009-09-21 17:02:03 -0700777 mm = mm_slot->mm;
778 down_read(&mm->mmap_sem);
779 for (vma = mm->mmap; vma; vma = vma->vm_next) {
Hugh Dickins9ba69292009-09-21 17:02:20 -0700780 if (ksm_test_exit(mm))
781 break;
Izik Eidus31dbd012009-09-21 17:02:03 -0700782 if (!(vma->vm_flags & VM_MERGEABLE) || !vma->anon_vma)
783 continue;
Hugh Dickinsd952b792009-09-21 17:02:16 -0700784 err = unmerge_ksm_pages(vma,
785 vma->vm_start, vma->vm_end);
Hugh Dickins9ba69292009-09-21 17:02:20 -0700786 if (err)
787 goto error;
Izik Eidus31dbd012009-09-21 17:02:03 -0700788 }
Hugh Dickins9ba69292009-09-21 17:02:20 -0700789
Hugh Dickins6514d512009-12-14 17:59:19 -0800790 remove_trailing_rmap_items(mm_slot, &mm_slot->rmap_list);
Zhou Chengming7496fea2016-05-12 15:42:21 -0700791 up_read(&mm->mmap_sem);
Hugh Dickinsd952b792009-09-21 17:02:16 -0700792
793 spin_lock(&ksm_mmlist_lock);
Hugh Dickins9ba69292009-09-21 17:02:20 -0700794 ksm_scan.mm_slot = list_entry(mm_slot->mm_list.next,
Hugh Dickinsd952b792009-09-21 17:02:16 -0700795 struct mm_slot, mm_list);
Hugh Dickins9ba69292009-09-21 17:02:20 -0700796 if (ksm_test_exit(mm)) {
Sasha Levin4ca3a692013-02-22 16:32:28 -0800797 hash_del(&mm_slot->link);
Hugh Dickins9ba69292009-09-21 17:02:20 -0700798 list_del(&mm_slot->mm_list);
799 spin_unlock(&ksm_mmlist_lock);
800
801 free_mm_slot(mm_slot);
802 clear_bit(MMF_VM_MERGEABLE, &mm->flags);
Hugh Dickins9ba69292009-09-21 17:02:20 -0700803 mmdrop(mm);
Zhou Chengming7496fea2016-05-12 15:42:21 -0700804 } else
Hugh Dickins9ba69292009-09-21 17:02:20 -0700805 spin_unlock(&ksm_mmlist_lock);
Izik Eidus31dbd012009-09-21 17:02:03 -0700806 }
807
Hugh Dickinscbf86cf2013-02-22 16:35:08 -0800808 /* Clean up stable nodes, but don't worry if some are still busy */
809 remove_all_stable_nodes();
Hugh Dickinsd952b792009-09-21 17:02:16 -0700810 ksm_scan.seqnr = 0;
Hugh Dickins9ba69292009-09-21 17:02:20 -0700811 return 0;
812
813error:
814 up_read(&mm->mmap_sem);
Izik Eidus31dbd012009-09-21 17:02:03 -0700815 spin_lock(&ksm_mmlist_lock);
Hugh Dickinsd952b792009-09-21 17:02:16 -0700816 ksm_scan.mm_slot = &ksm_mm_head;
Izik Eidus31dbd012009-09-21 17:02:03 -0700817 spin_unlock(&ksm_mmlist_lock);
Hugh Dickinsd952b792009-09-21 17:02:16 -0700818 return err;
Izik Eidus31dbd012009-09-21 17:02:03 -0700819}
Hugh Dickins2ffd8672009-09-21 17:02:23 -0700820#endif /* CONFIG_SYSFS */
Izik Eidus31dbd012009-09-21 17:02:03 -0700821
Izik Eidus31dbd012009-09-21 17:02:03 -0700822static u32 calc_checksum(struct page *page)
823{
824 u32 checksum;
Cong Wang9b04c5f2011-11-25 23:14:39 +0800825 void *addr = kmap_atomic(page);
Izik Eidus31dbd012009-09-21 17:02:03 -0700826 checksum = jhash2(addr, PAGE_SIZE / 4, 17);
Cong Wang9b04c5f2011-11-25 23:14:39 +0800827 kunmap_atomic(addr);
Izik Eidus31dbd012009-09-21 17:02:03 -0700828 return checksum;
829}
830
831static int memcmp_pages(struct page *page1, struct page *page2)
832{
833 char *addr1, *addr2;
834 int ret;
835
Cong Wang9b04c5f2011-11-25 23:14:39 +0800836 addr1 = kmap_atomic(page1);
837 addr2 = kmap_atomic(page2);
Izik Eidus31dbd012009-09-21 17:02:03 -0700838 ret = memcmp(addr1, addr2, PAGE_SIZE);
Cong Wang9b04c5f2011-11-25 23:14:39 +0800839 kunmap_atomic(addr2);
840 kunmap_atomic(addr1);
Izik Eidus31dbd012009-09-21 17:02:03 -0700841 return ret;
842}
843
844static inline int pages_identical(struct page *page1, struct page *page2)
845{
846 return !memcmp_pages(page1, page2);
847}
848
849static int write_protect_page(struct vm_area_struct *vma, struct page *page,
850 pte_t *orig_pte)
851{
852 struct mm_struct *mm = vma->vm_mm;
853 unsigned long addr;
854 pte_t *ptep;
855 spinlock_t *ptl;
856 int swapped;
857 int err = -EFAULT;
Haggai Eran6bdb9132012-10-08 16:33:35 -0700858 unsigned long mmun_start; /* For mmu_notifiers */
859 unsigned long mmun_end; /* For mmu_notifiers */
Izik Eidus31dbd012009-09-21 17:02:03 -0700860
861 addr = page_address_in_vma(page, vma);
862 if (addr == -EFAULT)
863 goto out;
864
Andrea Arcangeli29ad7682011-01-13 15:47:19 -0800865 BUG_ON(PageTransCompound(page));
Haggai Eran6bdb9132012-10-08 16:33:35 -0700866
867 mmun_start = addr;
868 mmun_end = addr + PAGE_SIZE;
869 mmu_notifier_invalidate_range_start(mm, mmun_start, mmun_end);
870
Izik Eidus31dbd012009-09-21 17:02:03 -0700871 ptep = page_check_address(page, mm, addr, &ptl, 0);
872 if (!ptep)
Haggai Eran6bdb9132012-10-08 16:33:35 -0700873 goto out_mn;
Izik Eidus31dbd012009-09-21 17:02:03 -0700874
Hugh Dickins4e316352010-10-02 17:49:08 -0700875 if (pte_write(*ptep) || pte_dirty(*ptep)) {
Izik Eidus31dbd012009-09-21 17:02:03 -0700876 pte_t entry;
877
878 swapped = PageSwapCache(page);
879 flush_cache_page(vma, addr, page_to_pfn(page));
880 /*
Lucas De Marchi25985ed2011-03-30 22:57:33 -0300881 * Ok this is tricky, when get_user_pages_fast() run it doesn't
Izik Eidus31dbd012009-09-21 17:02:03 -0700882 * take any lock, therefore the check that we are going to make
883 * with the pagecount against the mapcount is racey and
884 * O_DIRECT can happen right after the check.
885 * So we clear the pte and flush the tlb before the check
886 * this assure us that no O_DIRECT can happen after the check
887 * or in the middle of the check.
888 */
Joerg Roedel34ee6452014-11-13 13:46:09 +1100889 entry = ptep_clear_flush_notify(vma, addr, ptep);
Izik Eidus31dbd012009-09-21 17:02:03 -0700890 /*
891 * Check that no O_DIRECT or similar I/O is in progress on the
892 * page
893 */
Hugh Dickins31e855e2009-12-14 17:59:17 -0800894 if (page_mapcount(page) + 1 + swapped != page_count(page)) {
Robin Holtcb532372010-03-23 13:35:26 -0700895 set_pte_at(mm, addr, ptep, entry);
Izik Eidus31dbd012009-09-21 17:02:03 -0700896 goto out_unlock;
897 }
Hugh Dickins4e316352010-10-02 17:49:08 -0700898 if (pte_dirty(entry))
899 set_page_dirty(page);
900 entry = pte_mkclean(pte_wrprotect(entry));
Izik Eidus31dbd012009-09-21 17:02:03 -0700901 set_pte_at_notify(mm, addr, ptep, entry);
902 }
903 *orig_pte = *ptep;
904 err = 0;
905
906out_unlock:
907 pte_unmap_unlock(ptep, ptl);
Haggai Eran6bdb9132012-10-08 16:33:35 -0700908out_mn:
909 mmu_notifier_invalidate_range_end(mm, mmun_start, mmun_end);
Izik Eidus31dbd012009-09-21 17:02:03 -0700910out:
911 return err;
912}
913
914/**
915 * replace_page - replace page in vma by new ksm page
Hugh Dickins8dd35572009-12-14 17:59:18 -0800916 * @vma: vma that holds the pte pointing to page
917 * @page: the page we are replacing by kpage
918 * @kpage: the ksm page we replace page by
Izik Eidus31dbd012009-09-21 17:02:03 -0700919 * @orig_pte: the original value of the pte
920 *
921 * Returns 0 on success, -EFAULT on failure.
922 */
Hugh Dickins8dd35572009-12-14 17:59:18 -0800923static int replace_page(struct vm_area_struct *vma, struct page *page,
924 struct page *kpage, pte_t orig_pte)
Izik Eidus31dbd012009-09-21 17:02:03 -0700925{
926 struct mm_struct *mm = vma->vm_mm;
Izik Eidus31dbd012009-09-21 17:02:03 -0700927 pmd_t *pmd;
928 pte_t *ptep;
929 spinlock_t *ptl;
930 unsigned long addr;
Izik Eidus31dbd012009-09-21 17:02:03 -0700931 int err = -EFAULT;
Haggai Eran6bdb9132012-10-08 16:33:35 -0700932 unsigned long mmun_start; /* For mmu_notifiers */
933 unsigned long mmun_end; /* For mmu_notifiers */
Izik Eidus31dbd012009-09-21 17:02:03 -0700934
Hugh Dickins8dd35572009-12-14 17:59:18 -0800935 addr = page_address_in_vma(page, vma);
Izik Eidus31dbd012009-09-21 17:02:03 -0700936 if (addr == -EFAULT)
937 goto out;
938
Bob Liu62190492012-12-11 16:00:37 -0800939 pmd = mm_find_pmd(mm, addr);
940 if (!pmd)
Izik Eidus31dbd012009-09-21 17:02:03 -0700941 goto out;
Izik Eidus31dbd012009-09-21 17:02:03 -0700942
Haggai Eran6bdb9132012-10-08 16:33:35 -0700943 mmun_start = addr;
944 mmun_end = addr + PAGE_SIZE;
945 mmu_notifier_invalidate_range_start(mm, mmun_start, mmun_end);
946
Izik Eidus31dbd012009-09-21 17:02:03 -0700947 ptep = pte_offset_map_lock(mm, pmd, addr, &ptl);
948 if (!pte_same(*ptep, orig_pte)) {
949 pte_unmap_unlock(ptep, ptl);
Haggai Eran6bdb9132012-10-08 16:33:35 -0700950 goto out_mn;
Izik Eidus31dbd012009-09-21 17:02:03 -0700951 }
952
Hugh Dickins8dd35572009-12-14 17:59:18 -0800953 get_page(kpage);
Kirill A. Shutemovd281ee62016-01-15 16:52:16 -0800954 page_add_anon_rmap(kpage, vma, addr, false);
Izik Eidus31dbd012009-09-21 17:02:03 -0700955
956 flush_cache_page(vma, addr, pte_pfn(*ptep));
Joerg Roedel34ee6452014-11-13 13:46:09 +1100957 ptep_clear_flush_notify(vma, addr, ptep);
Hugh Dickins8dd35572009-12-14 17:59:18 -0800958 set_pte_at_notify(mm, addr, ptep, mk_pte(kpage, vma->vm_page_prot));
Izik Eidus31dbd012009-09-21 17:02:03 -0700959
Kirill A. Shutemovd281ee62016-01-15 16:52:16 -0800960 page_remove_rmap(page, false);
Hugh Dickinsae52a2a2011-01-13 15:46:28 -0800961 if (!page_mapped(page))
962 try_to_free_swap(page);
Hugh Dickins8dd35572009-12-14 17:59:18 -0800963 put_page(page);
Izik Eidus31dbd012009-09-21 17:02:03 -0700964
965 pte_unmap_unlock(ptep, ptl);
966 err = 0;
Haggai Eran6bdb9132012-10-08 16:33:35 -0700967out_mn:
968 mmu_notifier_invalidate_range_end(mm, mmun_start, mmun_end);
Izik Eidus31dbd012009-09-21 17:02:03 -0700969out:
970 return err;
971}
972
973/*
974 * try_to_merge_one_page - take two pages and merge them into one
Hugh Dickins8dd35572009-12-14 17:59:18 -0800975 * @vma: the vma that holds the pte pointing to page
976 * @page: the PageAnon page that we want to replace with kpage
Hugh Dickins80e148222009-12-14 17:59:29 -0800977 * @kpage: the PageKsm page that we want to map instead of page,
978 * or NULL the first time when we want to use page as kpage.
Izik Eidus31dbd012009-09-21 17:02:03 -0700979 *
980 * This function returns 0 if the pages were merged, -EFAULT otherwise.
981 */
982static int try_to_merge_one_page(struct vm_area_struct *vma,
Hugh Dickins8dd35572009-12-14 17:59:18 -0800983 struct page *page, struct page *kpage)
Izik Eidus31dbd012009-09-21 17:02:03 -0700984{
985 pte_t orig_pte = __pte(0);
986 int err = -EFAULT;
987
Hugh Dickinsdb114b82009-12-14 17:59:25 -0800988 if (page == kpage) /* ksm page forked */
989 return 0;
990
Hugh Dickins8dd35572009-12-14 17:59:18 -0800991 if (!PageAnon(page))
Izik Eidus31dbd012009-09-21 17:02:03 -0700992 goto out;
993
Izik Eidus31dbd012009-09-21 17:02:03 -0700994 /*
995 * We need the page lock to read a stable PageSwapCache in
996 * write_protect_page(). We use trylock_page() instead of
997 * lock_page() because we don't want to wait here - we
998 * prefer to continue scanning and merging different pages,
999 * then come back to this page when it is unlocked.
1000 */
Hugh Dickins8dd35572009-12-14 17:59:18 -08001001 if (!trylock_page(page))
Hugh Dickins31e855e2009-12-14 17:59:17 -08001002 goto out;
Kirill A. Shutemovf765f542016-01-15 16:53:03 -08001003
1004 if (PageTransCompound(page)) {
Andrea Arcangeli873f3b02017-06-02 14:46:11 -07001005 if (split_huge_page(page))
Kirill A. Shutemovf765f542016-01-15 16:53:03 -08001006 goto out_unlock;
1007 }
1008
Izik Eidus31dbd012009-09-21 17:02:03 -07001009 /*
1010 * If this anonymous page is mapped only here, its pte may need
1011 * to be write-protected. If it's mapped elsewhere, all of its
1012 * ptes are necessarily already write-protected. But in either
1013 * case, we need to lock and check page_count is not raised.
1014 */
Hugh Dickins80e148222009-12-14 17:59:29 -08001015 if (write_protect_page(vma, page, &orig_pte) == 0) {
1016 if (!kpage) {
1017 /*
1018 * While we hold page lock, upgrade page from
1019 * PageAnon+anon_vma to PageKsm+NULL stable_node:
1020 * stable_tree_insert() will update stable_node.
1021 */
1022 set_page_stable_node(page, NULL);
1023 mark_page_accessed(page);
Minchan Kim337ed7e2016-01-15 16:55:15 -08001024 /*
1025 * Page reclaim just frees a clean page with no dirty
1026 * ptes: make sure that the ksm page would be swapped.
1027 */
1028 if (!PageDirty(page))
1029 SetPageDirty(page);
Hugh Dickins80e148222009-12-14 17:59:29 -08001030 err = 0;
1031 } else if (pages_identical(page, kpage))
1032 err = replace_page(vma, page, kpage, orig_pte);
1033 }
Izik Eidus31dbd012009-09-21 17:02:03 -07001034
Hugh Dickins80e148222009-12-14 17:59:29 -08001035 if ((vma->vm_flags & VM_LOCKED) && kpage && !err) {
Hugh Dickins73848b42009-12-14 17:59:22 -08001036 munlock_vma_page(page);
Hugh Dickins5ad64682009-12-14 17:59:24 -08001037 if (!PageMlocked(kpage)) {
1038 unlock_page(page);
Hugh Dickins5ad64682009-12-14 17:59:24 -08001039 lock_page(kpage);
1040 mlock_vma_page(kpage);
1041 page = kpage; /* for final unlock */
1042 }
1043 }
Hugh Dickins73848b42009-12-14 17:59:22 -08001044
Kirill A. Shutemovf765f542016-01-15 16:53:03 -08001045out_unlock:
Hugh Dickins8dd35572009-12-14 17:59:18 -08001046 unlock_page(page);
Izik Eidus31dbd012009-09-21 17:02:03 -07001047out:
1048 return err;
1049}
1050
1051/*
Hugh Dickins81464e302009-09-21 17:02:15 -07001052 * try_to_merge_with_ksm_page - like try_to_merge_two_pages,
1053 * but no new kernel page is allocated: kpage must already be a ksm page.
Hugh Dickins8dd35572009-12-14 17:59:18 -08001054 *
1055 * This function returns 0 if the pages were merged, -EFAULT otherwise.
Hugh Dickins81464e302009-09-21 17:02:15 -07001056 */
Hugh Dickins8dd35572009-12-14 17:59:18 -08001057static int try_to_merge_with_ksm_page(struct rmap_item *rmap_item,
1058 struct page *page, struct page *kpage)
Hugh Dickins81464e302009-09-21 17:02:15 -07001059{
Hugh Dickins8dd35572009-12-14 17:59:18 -08001060 struct mm_struct *mm = rmap_item->mm;
Hugh Dickins81464e302009-09-21 17:02:15 -07001061 struct vm_area_struct *vma;
1062 int err = -EFAULT;
1063
Hugh Dickins8dd35572009-12-14 17:59:18 -08001064 down_read(&mm->mmap_sem);
Andrea Arcangeli85c6e8d2015-11-05 18:49:16 -08001065 vma = find_mergeable_vma(mm, rmap_item->address);
1066 if (!vma)
Hugh Dickins9ba69292009-09-21 17:02:20 -07001067 goto out;
1068
Hugh Dickins8dd35572009-12-14 17:59:18 -08001069 err = try_to_merge_one_page(vma, page, kpage);
Hugh Dickinsdb114b82009-12-14 17:59:25 -08001070 if (err)
1071 goto out;
1072
Hugh Dickinsbc566202013-02-22 16:36:06 -08001073 /* Unstable nid is in union with stable anon_vma: remove first */
1074 remove_rmap_item_from_tree(rmap_item);
1075
Hugh Dickinsdb114b82009-12-14 17:59:25 -08001076 /* Must get reference to anon_vma while still holding mmap_sem */
Peter Zijlstra9e601092011-03-22 16:32:46 -07001077 rmap_item->anon_vma = vma->anon_vma;
1078 get_anon_vma(vma->anon_vma);
Hugh Dickins81464e302009-09-21 17:02:15 -07001079out:
Hugh Dickins8dd35572009-12-14 17:59:18 -08001080 up_read(&mm->mmap_sem);
Hugh Dickins81464e302009-09-21 17:02:15 -07001081 return err;
1082}
1083
1084/*
Izik Eidus31dbd012009-09-21 17:02:03 -07001085 * try_to_merge_two_pages - take two identical pages and prepare them
1086 * to be merged into one page.
1087 *
Hugh Dickins8dd35572009-12-14 17:59:18 -08001088 * This function returns the kpage if we successfully merged two identical
1089 * pages into one ksm page, NULL otherwise.
Izik Eidus31dbd012009-09-21 17:02:03 -07001090 *
Hugh Dickins80e148222009-12-14 17:59:29 -08001091 * Note that this function upgrades page to ksm page: if one of the pages
Izik Eidus31dbd012009-09-21 17:02:03 -07001092 * is already a ksm page, try_to_merge_with_ksm_page should be used.
1093 */
Hugh Dickins8dd35572009-12-14 17:59:18 -08001094static struct page *try_to_merge_two_pages(struct rmap_item *rmap_item,
1095 struct page *page,
1096 struct rmap_item *tree_rmap_item,
1097 struct page *tree_page)
Izik Eidus31dbd012009-09-21 17:02:03 -07001098{
Hugh Dickins80e148222009-12-14 17:59:29 -08001099 int err;
Izik Eidus31dbd012009-09-21 17:02:03 -07001100
Hugh Dickins80e148222009-12-14 17:59:29 -08001101 err = try_to_merge_with_ksm_page(rmap_item, page, NULL);
Izik Eidus31dbd012009-09-21 17:02:03 -07001102 if (!err) {
Hugh Dickins8dd35572009-12-14 17:59:18 -08001103 err = try_to_merge_with_ksm_page(tree_rmap_item,
Hugh Dickins80e148222009-12-14 17:59:29 -08001104 tree_page, page);
Izik Eidus31dbd012009-09-21 17:02:03 -07001105 /*
Hugh Dickins81464e302009-09-21 17:02:15 -07001106 * If that fails, we have a ksm page with only one pte
1107 * pointing to it: so break it.
Izik Eidus31dbd012009-09-21 17:02:03 -07001108 */
Hugh Dickins4035c07a2009-12-14 17:59:27 -08001109 if (err)
Hugh Dickins8dd35572009-12-14 17:59:18 -08001110 break_cow(rmap_item);
Izik Eidus31dbd012009-09-21 17:02:03 -07001111 }
Hugh Dickins80e148222009-12-14 17:59:29 -08001112 return err ? NULL : page;
Izik Eidus31dbd012009-09-21 17:02:03 -07001113}
1114
1115/*
Hugh Dickins8dd35572009-12-14 17:59:18 -08001116 * stable_tree_search - search for page inside the stable tree
Izik Eidus31dbd012009-09-21 17:02:03 -07001117 *
1118 * This function checks if there is a page inside the stable tree
1119 * with identical content to the page that we are scanning right now.
1120 *
Hugh Dickins7b6ba2c2009-12-14 17:59:20 -08001121 * This function returns the stable tree node of identical content if found,
Izik Eidus31dbd012009-09-21 17:02:03 -07001122 * NULL otherwise.
1123 */
Hugh Dickins62b61f62009-12-14 17:59:33 -08001124static struct page *stable_tree_search(struct page *page)
Izik Eidus31dbd012009-09-21 17:02:03 -07001125{
Petr Holasek90bd6fd2013-02-22 16:35:00 -08001126 int nid;
Hugh Dickinsef53d16c2013-02-22 16:36:12 -08001127 struct rb_root *root;
Hugh Dickins4146d2d2013-02-22 16:35:11 -08001128 struct rb_node **new;
1129 struct rb_node *parent;
1130 struct stable_node *stable_node;
1131 struct stable_node *page_node;
Izik Eidus31dbd012009-09-21 17:02:03 -07001132
Hugh Dickins4146d2d2013-02-22 16:35:11 -08001133 page_node = page_stable_node(page);
1134 if (page_node && page_node->head != &migrate_nodes) {
1135 /* ksm page forked */
Hugh Dickins08beca42009-12-14 17:59:21 -08001136 get_page(page);
Hugh Dickins62b61f62009-12-14 17:59:33 -08001137 return page;
Hugh Dickins08beca42009-12-14 17:59:21 -08001138 }
1139
Petr Holasek90bd6fd2013-02-22 16:35:00 -08001140 nid = get_kpfn_nid(page_to_pfn(page));
Hugh Dickinsef53d16c2013-02-22 16:36:12 -08001141 root = root_stable_tree + nid;
Hugh Dickins4146d2d2013-02-22 16:35:11 -08001142again:
Hugh Dickinsef53d16c2013-02-22 16:36:12 -08001143 new = &root->rb_node;
Hugh Dickins4146d2d2013-02-22 16:35:11 -08001144 parent = NULL;
Petr Holasek90bd6fd2013-02-22 16:35:00 -08001145
Hugh Dickins4146d2d2013-02-22 16:35:11 -08001146 while (*new) {
Hugh Dickins4035c07a2009-12-14 17:59:27 -08001147 struct page *tree_page;
Izik Eidus31dbd012009-09-21 17:02:03 -07001148 int ret;
1149
Hugh Dickins08beca42009-12-14 17:59:21 -08001150 cond_resched();
Hugh Dickins4146d2d2013-02-22 16:35:11 -08001151 stable_node = rb_entry(*new, struct stable_node, node);
Hugh Dickins8aafa6a2013-02-22 16:35:06 -08001152 tree_page = get_ksm_page(stable_node, false);
Andrea Arcangelif2e5ff82015-11-05 18:49:10 -08001153 if (!tree_page) {
1154 /*
1155 * If we walked over a stale stable_node,
1156 * get_ksm_page() will call rb_erase() and it
1157 * may rebalance the tree from under us. So
1158 * restart the search from scratch. Returning
1159 * NULL would be safe too, but we'd generate
1160 * false negative insertions just because some
1161 * stable_node was stale.
1162 */
1163 goto again;
1164 }
Izik Eidus31dbd012009-09-21 17:02:03 -07001165
Hugh Dickins4035c07a2009-12-14 17:59:27 -08001166 ret = memcmp_pages(page, tree_page);
Hugh Dickinsc8d65532013-02-22 16:35:10 -08001167 put_page(tree_page);
Izik Eidus31dbd012009-09-21 17:02:03 -07001168
Hugh Dickins4146d2d2013-02-22 16:35:11 -08001169 parent = *new;
Hugh Dickinsc8d65532013-02-22 16:35:10 -08001170 if (ret < 0)
Hugh Dickins4146d2d2013-02-22 16:35:11 -08001171 new = &parent->rb_left;
Hugh Dickinsc8d65532013-02-22 16:35:10 -08001172 else if (ret > 0)
Hugh Dickins4146d2d2013-02-22 16:35:11 -08001173 new = &parent->rb_right;
Hugh Dickinsc8d65532013-02-22 16:35:10 -08001174 else {
1175 /*
1176 * Lock and unlock the stable_node's page (which
1177 * might already have been migrated) so that page
1178 * migration is sure to notice its raised count.
1179 * It would be more elegant to return stable_node
1180 * than kpage, but that involves more changes.
1181 */
1182 tree_page = get_ksm_page(stable_node, true);
Hugh Dickins4146d2d2013-02-22 16:35:11 -08001183 if (tree_page) {
Hugh Dickinsc8d65532013-02-22 16:35:10 -08001184 unlock_page(tree_page);
Hugh Dickins4146d2d2013-02-22 16:35:11 -08001185 if (get_kpfn_nid(stable_node->kpfn) !=
1186 NUMA(stable_node->nid)) {
1187 put_page(tree_page);
1188 goto replace;
1189 }
1190 return tree_page;
1191 }
1192 /*
1193 * There is now a place for page_node, but the tree may
1194 * have been rebalanced, so re-evaluate parent and new.
1195 */
1196 if (page_node)
1197 goto again;
1198 return NULL;
Hugh Dickinsc8d65532013-02-22 16:35:10 -08001199 }
Izik Eidus31dbd012009-09-21 17:02:03 -07001200 }
1201
Hugh Dickins4146d2d2013-02-22 16:35:11 -08001202 if (!page_node)
1203 return NULL;
1204
1205 list_del(&page_node->list);
1206 DO_NUMA(page_node->nid = nid);
1207 rb_link_node(&page_node->node, parent, new);
Hugh Dickinsef53d16c2013-02-22 16:36:12 -08001208 rb_insert_color(&page_node->node, root);
Hugh Dickins4146d2d2013-02-22 16:35:11 -08001209 get_page(page);
1210 return page;
1211
1212replace:
1213 if (page_node) {
1214 list_del(&page_node->list);
1215 DO_NUMA(page_node->nid = nid);
Hugh Dickinsef53d16c2013-02-22 16:36:12 -08001216 rb_replace_node(&stable_node->node, &page_node->node, root);
Hugh Dickins4146d2d2013-02-22 16:35:11 -08001217 get_page(page);
1218 } else {
Hugh Dickinsef53d16c2013-02-22 16:36:12 -08001219 rb_erase(&stable_node->node, root);
Hugh Dickins4146d2d2013-02-22 16:35:11 -08001220 page = NULL;
1221 }
1222 stable_node->head = &migrate_nodes;
1223 list_add(&stable_node->list, stable_node->head);
1224 return page;
Izik Eidus31dbd012009-09-21 17:02:03 -07001225}
1226
1227/*
Hugh Dickinse850dcf2013-02-22 16:35:03 -08001228 * stable_tree_insert - insert stable tree node pointing to new ksm page
Izik Eidus31dbd012009-09-21 17:02:03 -07001229 * into the stable tree.
1230 *
Hugh Dickins7b6ba2c2009-12-14 17:59:20 -08001231 * This function returns the stable tree node just allocated on success,
1232 * NULL otherwise.
Izik Eidus31dbd012009-09-21 17:02:03 -07001233 */
Hugh Dickins7b6ba2c2009-12-14 17:59:20 -08001234static struct stable_node *stable_tree_insert(struct page *kpage)
Izik Eidus31dbd012009-09-21 17:02:03 -07001235{
Petr Holasek90bd6fd2013-02-22 16:35:00 -08001236 int nid;
1237 unsigned long kpfn;
Hugh Dickinsef53d16c2013-02-22 16:36:12 -08001238 struct rb_root *root;
Petr Holasek90bd6fd2013-02-22 16:35:00 -08001239 struct rb_node **new;
Andrea Arcangelif2e5ff82015-11-05 18:49:10 -08001240 struct rb_node *parent;
Hugh Dickins7b6ba2c2009-12-14 17:59:20 -08001241 struct stable_node *stable_node;
Izik Eidus31dbd012009-09-21 17:02:03 -07001242
Petr Holasek90bd6fd2013-02-22 16:35:00 -08001243 kpfn = page_to_pfn(kpage);
1244 nid = get_kpfn_nid(kpfn);
Hugh Dickinsef53d16c2013-02-22 16:36:12 -08001245 root = root_stable_tree + nid;
Andrea Arcangelif2e5ff82015-11-05 18:49:10 -08001246again:
1247 parent = NULL;
Hugh Dickinsef53d16c2013-02-22 16:36:12 -08001248 new = &root->rb_node;
Petr Holasek90bd6fd2013-02-22 16:35:00 -08001249
Izik Eidus31dbd012009-09-21 17:02:03 -07001250 while (*new) {
Hugh Dickins4035c07a2009-12-14 17:59:27 -08001251 struct page *tree_page;
Izik Eidus31dbd012009-09-21 17:02:03 -07001252 int ret;
1253
Hugh Dickins08beca42009-12-14 17:59:21 -08001254 cond_resched();
Hugh Dickins7b6ba2c2009-12-14 17:59:20 -08001255 stable_node = rb_entry(*new, struct stable_node, node);
Hugh Dickins8aafa6a2013-02-22 16:35:06 -08001256 tree_page = get_ksm_page(stable_node, false);
Andrea Arcangelif2e5ff82015-11-05 18:49:10 -08001257 if (!tree_page) {
1258 /*
1259 * If we walked over a stale stable_node,
1260 * get_ksm_page() will call rb_erase() and it
1261 * may rebalance the tree from under us. So
1262 * restart the search from scratch. Returning
1263 * NULL would be safe too, but we'd generate
1264 * false negative insertions just because some
1265 * stable_node was stale.
1266 */
1267 goto again;
1268 }
Izik Eidus31dbd012009-09-21 17:02:03 -07001269
Hugh Dickins4035c07a2009-12-14 17:59:27 -08001270 ret = memcmp_pages(kpage, tree_page);
1271 put_page(tree_page);
Izik Eidus31dbd012009-09-21 17:02:03 -07001272
1273 parent = *new;
1274 if (ret < 0)
1275 new = &parent->rb_left;
1276 else if (ret > 0)
1277 new = &parent->rb_right;
1278 else {
1279 /*
1280 * It is not a bug that stable_tree_search() didn't
1281 * find this node: because at that time our page was
1282 * not yet write-protected, so may have changed since.
1283 */
1284 return NULL;
1285 }
1286 }
1287
Hugh Dickins7b6ba2c2009-12-14 17:59:20 -08001288 stable_node = alloc_stable_node();
1289 if (!stable_node)
1290 return NULL;
Izik Eidus31dbd012009-09-21 17:02:03 -07001291
Hugh Dickins7b6ba2c2009-12-14 17:59:20 -08001292 INIT_HLIST_HEAD(&stable_node->hlist);
Petr Holasek90bd6fd2013-02-22 16:35:00 -08001293 stable_node->kpfn = kpfn;
Hugh Dickins08beca42009-12-14 17:59:21 -08001294 set_page_stable_node(kpage, stable_node);
Hugh Dickins4146d2d2013-02-22 16:35:11 -08001295 DO_NUMA(stable_node->nid = nid);
Hugh Dickinse850dcf2013-02-22 16:35:03 -08001296 rb_link_node(&stable_node->node, parent, new);
Hugh Dickinsef53d16c2013-02-22 16:36:12 -08001297 rb_insert_color(&stable_node->node, root);
Hugh Dickins08beca42009-12-14 17:59:21 -08001298
Hugh Dickins7b6ba2c2009-12-14 17:59:20 -08001299 return stable_node;
Izik Eidus31dbd012009-09-21 17:02:03 -07001300}
1301
1302/*
Hugh Dickins8dd35572009-12-14 17:59:18 -08001303 * unstable_tree_search_insert - search for identical page,
1304 * else insert rmap_item into the unstable tree.
Izik Eidus31dbd012009-09-21 17:02:03 -07001305 *
1306 * This function searches for a page in the unstable tree identical to the
1307 * page currently being scanned; and if no identical page is found in the
1308 * tree, we insert rmap_item as a new object into the unstable tree.
1309 *
1310 * This function returns pointer to rmap_item found to be identical
1311 * to the currently scanned page, NULL otherwise.
1312 *
1313 * This function does both searching and inserting, because they share
1314 * the same walking algorithm in an rbtree.
1315 */
Hugh Dickins8dd35572009-12-14 17:59:18 -08001316static
1317struct rmap_item *unstable_tree_search_insert(struct rmap_item *rmap_item,
1318 struct page *page,
1319 struct page **tree_pagep)
Izik Eidus31dbd012009-09-21 17:02:03 -07001320{
Petr Holasek90bd6fd2013-02-22 16:35:00 -08001321 struct rb_node **new;
1322 struct rb_root *root;
Izik Eidus31dbd012009-09-21 17:02:03 -07001323 struct rb_node *parent = NULL;
Petr Holasek90bd6fd2013-02-22 16:35:00 -08001324 int nid;
1325
1326 nid = get_kpfn_nid(page_to_pfn(page));
Hugh Dickinsef53d16c2013-02-22 16:36:12 -08001327 root = root_unstable_tree + nid;
Petr Holasek90bd6fd2013-02-22 16:35:00 -08001328 new = &root->rb_node;
Izik Eidus31dbd012009-09-21 17:02:03 -07001329
1330 while (*new) {
1331 struct rmap_item *tree_rmap_item;
Hugh Dickins8dd35572009-12-14 17:59:18 -08001332 struct page *tree_page;
Izik Eidus31dbd012009-09-21 17:02:03 -07001333 int ret;
1334
Hugh Dickinsd178f272009-11-09 15:58:23 +00001335 cond_resched();
Izik Eidus31dbd012009-09-21 17:02:03 -07001336 tree_rmap_item = rb_entry(*new, struct rmap_item, node);
Hugh Dickins8dd35572009-12-14 17:59:18 -08001337 tree_page = get_mergeable_page(tree_rmap_item);
Andrea Arcangelic8f95ed2015-11-05 18:49:19 -08001338 if (!tree_page)
Izik Eidus31dbd012009-09-21 17:02:03 -07001339 return NULL;
1340
1341 /*
Hugh Dickins8dd35572009-12-14 17:59:18 -08001342 * Don't substitute a ksm page for a forked page.
Izik Eidus31dbd012009-09-21 17:02:03 -07001343 */
Hugh Dickins8dd35572009-12-14 17:59:18 -08001344 if (page == tree_page) {
1345 put_page(tree_page);
Izik Eidus31dbd012009-09-21 17:02:03 -07001346 return NULL;
1347 }
1348
Hugh Dickins8dd35572009-12-14 17:59:18 -08001349 ret = memcmp_pages(page, tree_page);
Izik Eidus31dbd012009-09-21 17:02:03 -07001350
1351 parent = *new;
1352 if (ret < 0) {
Hugh Dickins8dd35572009-12-14 17:59:18 -08001353 put_page(tree_page);
Izik Eidus31dbd012009-09-21 17:02:03 -07001354 new = &parent->rb_left;
1355 } else if (ret > 0) {
Hugh Dickins8dd35572009-12-14 17:59:18 -08001356 put_page(tree_page);
Izik Eidus31dbd012009-09-21 17:02:03 -07001357 new = &parent->rb_right;
Hugh Dickinsb599cbd2013-02-22 16:36:05 -08001358 } else if (!ksm_merge_across_nodes &&
1359 page_to_nid(tree_page) != nid) {
1360 /*
1361 * If tree_page has been migrated to another NUMA node,
1362 * it will be flushed out and put in the right unstable
1363 * tree next time: only merge with it when across_nodes.
1364 */
1365 put_page(tree_page);
1366 return NULL;
Izik Eidus31dbd012009-09-21 17:02:03 -07001367 } else {
Hugh Dickins8dd35572009-12-14 17:59:18 -08001368 *tree_pagep = tree_page;
Izik Eidus31dbd012009-09-21 17:02:03 -07001369 return tree_rmap_item;
1370 }
1371 }
1372
Hugh Dickins7b6ba2c2009-12-14 17:59:20 -08001373 rmap_item->address |= UNSTABLE_FLAG;
Izik Eidus31dbd012009-09-21 17:02:03 -07001374 rmap_item->address |= (ksm_scan.seqnr & SEQNR_MASK);
Hugh Dickinse850dcf2013-02-22 16:35:03 -08001375 DO_NUMA(rmap_item->nid = nid);
Izik Eidus31dbd012009-09-21 17:02:03 -07001376 rb_link_node(&rmap_item->node, parent, new);
Petr Holasek90bd6fd2013-02-22 16:35:00 -08001377 rb_insert_color(&rmap_item->node, root);
Izik Eidus31dbd012009-09-21 17:02:03 -07001378
Hugh Dickins473b0ce2009-09-21 17:02:11 -07001379 ksm_pages_unshared++;
Izik Eidus31dbd012009-09-21 17:02:03 -07001380 return NULL;
1381}
1382
1383/*
1384 * stable_tree_append - add another rmap_item to the linked list of
1385 * rmap_items hanging off a given node of the stable tree, all sharing
1386 * the same ksm page.
1387 */
1388static void stable_tree_append(struct rmap_item *rmap_item,
Hugh Dickins7b6ba2c2009-12-14 17:59:20 -08001389 struct stable_node *stable_node)
Izik Eidus31dbd012009-09-21 17:02:03 -07001390{
Hugh Dickins7b6ba2c2009-12-14 17:59:20 -08001391 rmap_item->head = stable_node;
Izik Eidus31dbd012009-09-21 17:02:03 -07001392 rmap_item->address |= STABLE_FLAG;
Hugh Dickins7b6ba2c2009-12-14 17:59:20 -08001393 hlist_add_head(&rmap_item->hlist, &stable_node->hlist);
Hugh Dickinse178dfd2009-09-21 17:02:10 -07001394
Hugh Dickins7b6ba2c2009-12-14 17:59:20 -08001395 if (rmap_item->hlist.next)
1396 ksm_pages_sharing++;
1397 else
1398 ksm_pages_shared++;
Izik Eidus31dbd012009-09-21 17:02:03 -07001399}
1400
1401/*
Hugh Dickins81464e302009-09-21 17:02:15 -07001402 * cmp_and_merge_page - first see if page can be merged into the stable tree;
1403 * if not, compare checksum to previous and if it's the same, see if page can
1404 * be inserted into the unstable tree, or merged with a page already there and
1405 * both transferred to the stable tree.
Izik Eidus31dbd012009-09-21 17:02:03 -07001406 *
1407 * @page: the page that we are searching identical page to.
1408 * @rmap_item: the reverse mapping into the virtual address of this page
1409 */
1410static void cmp_and_merge_page(struct page *page, struct rmap_item *rmap_item)
1411{
Izik Eidus31dbd012009-09-21 17:02:03 -07001412 struct rmap_item *tree_rmap_item;
Hugh Dickins8dd35572009-12-14 17:59:18 -08001413 struct page *tree_page = NULL;
Hugh Dickins7b6ba2c2009-12-14 17:59:20 -08001414 struct stable_node *stable_node;
Hugh Dickins8dd35572009-12-14 17:59:18 -08001415 struct page *kpage;
Izik Eidus31dbd012009-09-21 17:02:03 -07001416 unsigned int checksum;
1417 int err;
1418
Hugh Dickins4146d2d2013-02-22 16:35:11 -08001419 stable_node = page_stable_node(page);
1420 if (stable_node) {
1421 if (stable_node->head != &migrate_nodes &&
1422 get_kpfn_nid(stable_node->kpfn) != NUMA(stable_node->nid)) {
1423 rb_erase(&stable_node->node,
Hugh Dickinsef53d16c2013-02-22 16:36:12 -08001424 root_stable_tree + NUMA(stable_node->nid));
Hugh Dickins4146d2d2013-02-22 16:35:11 -08001425 stable_node->head = &migrate_nodes;
1426 list_add(&stable_node->list, stable_node->head);
1427 }
1428 if (stable_node->head != &migrate_nodes &&
1429 rmap_item->head == stable_node)
1430 return;
1431 }
Izik Eidus31dbd012009-09-21 17:02:03 -07001432
1433 /* We first start with searching the page inside the stable tree */
Hugh Dickins62b61f62009-12-14 17:59:33 -08001434 kpage = stable_tree_search(page);
Hugh Dickins4146d2d2013-02-22 16:35:11 -08001435 if (kpage == page && rmap_item->head == stable_node) {
1436 put_page(kpage);
1437 return;
1438 }
1439
1440 remove_rmap_item_from_tree(rmap_item);
1441
Hugh Dickins62b61f62009-12-14 17:59:33 -08001442 if (kpage) {
Hugh Dickins08beca42009-12-14 17:59:21 -08001443 err = try_to_merge_with_ksm_page(rmap_item, page, kpage);
Izik Eidus31dbd012009-09-21 17:02:03 -07001444 if (!err) {
1445 /*
1446 * The page was successfully merged:
1447 * add its rmap_item to the stable tree.
1448 */
Hugh Dickins5ad64682009-12-14 17:59:24 -08001449 lock_page(kpage);
Hugh Dickins62b61f62009-12-14 17:59:33 -08001450 stable_tree_append(rmap_item, page_stable_node(kpage));
Hugh Dickins5ad64682009-12-14 17:59:24 -08001451 unlock_page(kpage);
Izik Eidus31dbd012009-09-21 17:02:03 -07001452 }
Hugh Dickins8dd35572009-12-14 17:59:18 -08001453 put_page(kpage);
Izik Eidus31dbd012009-09-21 17:02:03 -07001454 return;
1455 }
1456
1457 /*
Hugh Dickins4035c07a2009-12-14 17:59:27 -08001458 * If the hash value of the page has changed from the last time
1459 * we calculated it, this page is changing frequently: therefore we
1460 * don't want to insert it in the unstable tree, and we don't want
1461 * to waste our time searching for something identical to it there.
Izik Eidus31dbd012009-09-21 17:02:03 -07001462 */
1463 checksum = calc_checksum(page);
1464 if (rmap_item->oldchecksum != checksum) {
1465 rmap_item->oldchecksum = checksum;
1466 return;
1467 }
1468
Hugh Dickins8dd35572009-12-14 17:59:18 -08001469 tree_rmap_item =
1470 unstable_tree_search_insert(rmap_item, page, &tree_page);
Izik Eidus31dbd012009-09-21 17:02:03 -07001471 if (tree_rmap_item) {
Claudio Imbrenda2272b832018-04-05 16:25:41 -07001472 bool split;
1473
Hugh Dickins8dd35572009-12-14 17:59:18 -08001474 kpage = try_to_merge_two_pages(rmap_item, page,
1475 tree_rmap_item, tree_page);
Claudio Imbrenda2272b832018-04-05 16:25:41 -07001476 /*
1477 * If both pages we tried to merge belong to the same compound
1478 * page, then we actually ended up increasing the reference
1479 * count of the same compound page twice, and split_huge_page
1480 * failed.
1481 * Here we set a flag if that happened, and we use it later to
1482 * try split_huge_page again. Since we call put_page right
1483 * afterwards, the reference count will be correct and
1484 * split_huge_page should succeed.
1485 */
1486 split = PageTransCompound(page)
1487 && compound_head(page) == compound_head(tree_page);
Hugh Dickins8dd35572009-12-14 17:59:18 -08001488 put_page(tree_page);
Hugh Dickins8dd35572009-12-14 17:59:18 -08001489 if (kpage) {
Hugh Dickinsbc566202013-02-22 16:36:06 -08001490 /*
1491 * The pages were successfully merged: insert new
1492 * node in the stable tree and add both rmap_items.
1493 */
Hugh Dickins5ad64682009-12-14 17:59:24 -08001494 lock_page(kpage);
Hugh Dickins7b6ba2c2009-12-14 17:59:20 -08001495 stable_node = stable_tree_insert(kpage);
1496 if (stable_node) {
1497 stable_tree_append(tree_rmap_item, stable_node);
1498 stable_tree_append(rmap_item, stable_node);
1499 }
Hugh Dickins5ad64682009-12-14 17:59:24 -08001500 unlock_page(kpage);
Hugh Dickins7b6ba2c2009-12-14 17:59:20 -08001501
Izik Eidus31dbd012009-09-21 17:02:03 -07001502 /*
1503 * If we fail to insert the page into the stable tree,
1504 * we will have 2 virtual addresses that are pointing
1505 * to a ksm page left outside the stable tree,
1506 * in which case we need to break_cow on both.
1507 */
Hugh Dickins7b6ba2c2009-12-14 17:59:20 -08001508 if (!stable_node) {
Hugh Dickins8dd35572009-12-14 17:59:18 -08001509 break_cow(tree_rmap_item);
1510 break_cow(rmap_item);
Izik Eidus31dbd012009-09-21 17:02:03 -07001511 }
Claudio Imbrenda2272b832018-04-05 16:25:41 -07001512 } else if (split) {
1513 /*
1514 * We are here if we tried to merge two pages and
1515 * failed because they both belonged to the same
1516 * compound page. We will split the page now, but no
1517 * merging will take place.
1518 * We do not want to add the cost of a full lock; if
1519 * the page is locked, it is better to skip it and
1520 * perhaps try again later.
1521 */
1522 if (!trylock_page(page))
1523 return;
1524 split_huge_page(page);
1525 unlock_page(page);
Izik Eidus31dbd012009-09-21 17:02:03 -07001526 }
Izik Eidus31dbd012009-09-21 17:02:03 -07001527 }
1528}
1529
1530static struct rmap_item *get_next_rmap_item(struct mm_slot *mm_slot,
Hugh Dickins6514d512009-12-14 17:59:19 -08001531 struct rmap_item **rmap_list,
Izik Eidus31dbd012009-09-21 17:02:03 -07001532 unsigned long addr)
1533{
1534 struct rmap_item *rmap_item;
1535
Hugh Dickins6514d512009-12-14 17:59:19 -08001536 while (*rmap_list) {
1537 rmap_item = *rmap_list;
Hugh Dickins93d17712009-12-14 17:59:16 -08001538 if ((rmap_item->address & PAGE_MASK) == addr)
Izik Eidus31dbd012009-09-21 17:02:03 -07001539 return rmap_item;
Izik Eidus31dbd012009-09-21 17:02:03 -07001540 if (rmap_item->address > addr)
1541 break;
Hugh Dickins6514d512009-12-14 17:59:19 -08001542 *rmap_list = rmap_item->rmap_list;
Izik Eidus31dbd012009-09-21 17:02:03 -07001543 remove_rmap_item_from_tree(rmap_item);
Izik Eidus31dbd012009-09-21 17:02:03 -07001544 free_rmap_item(rmap_item);
1545 }
1546
1547 rmap_item = alloc_rmap_item();
1548 if (rmap_item) {
1549 /* It has already been zeroed */
1550 rmap_item->mm = mm_slot->mm;
1551 rmap_item->address = addr;
Hugh Dickins6514d512009-12-14 17:59:19 -08001552 rmap_item->rmap_list = *rmap_list;
1553 *rmap_list = rmap_item;
Izik Eidus31dbd012009-09-21 17:02:03 -07001554 }
1555 return rmap_item;
1556}
1557
1558static struct rmap_item *scan_get_next_rmap_item(struct page **page)
1559{
1560 struct mm_struct *mm;
1561 struct mm_slot *slot;
1562 struct vm_area_struct *vma;
1563 struct rmap_item *rmap_item;
Petr Holasek90bd6fd2013-02-22 16:35:00 -08001564 int nid;
Izik Eidus31dbd012009-09-21 17:02:03 -07001565
1566 if (list_empty(&ksm_mm_head.mm_list))
1567 return NULL;
1568
1569 slot = ksm_scan.mm_slot;
1570 if (slot == &ksm_mm_head) {
Hugh Dickins2919bfd2011-01-13 15:47:29 -08001571 /*
1572 * A number of pages can hang around indefinitely on per-cpu
1573 * pagevecs, raised page count preventing write_protect_page
1574 * from merging them. Though it doesn't really matter much,
1575 * it is puzzling to see some stuck in pages_volatile until
1576 * other activity jostles them out, and they also prevented
1577 * LTP's KSM test from succeeding deterministically; so drain
1578 * them here (here rather than on entry to ksm_do_scan(),
1579 * so we don't IPI too often when pages_to_scan is set low).
1580 */
1581 lru_add_drain_all();
1582
Hugh Dickins4146d2d2013-02-22 16:35:11 -08001583 /*
1584 * Whereas stale stable_nodes on the stable_tree itself
1585 * get pruned in the regular course of stable_tree_search(),
1586 * those moved out to the migrate_nodes list can accumulate:
1587 * so prune them once before each full scan.
1588 */
1589 if (!ksm_merge_across_nodes) {
Geliang Tang03640412016-01-14 15:20:54 -08001590 struct stable_node *stable_node, *next;
Hugh Dickins4146d2d2013-02-22 16:35:11 -08001591 struct page *page;
1592
Geliang Tang03640412016-01-14 15:20:54 -08001593 list_for_each_entry_safe(stable_node, next,
1594 &migrate_nodes, list) {
Hugh Dickins4146d2d2013-02-22 16:35:11 -08001595 page = get_ksm_page(stable_node, false);
1596 if (page)
1597 put_page(page);
1598 cond_resched();
1599 }
1600 }
1601
Hugh Dickinsef53d16c2013-02-22 16:36:12 -08001602 for (nid = 0; nid < ksm_nr_node_ids; nid++)
Petr Holasek90bd6fd2013-02-22 16:35:00 -08001603 root_unstable_tree[nid] = RB_ROOT;
Izik Eidus31dbd012009-09-21 17:02:03 -07001604
1605 spin_lock(&ksm_mmlist_lock);
1606 slot = list_entry(slot->mm_list.next, struct mm_slot, mm_list);
1607 ksm_scan.mm_slot = slot;
1608 spin_unlock(&ksm_mmlist_lock);
Hugh Dickins2b472612011-06-15 15:08:58 -07001609 /*
1610 * Although we tested list_empty() above, a racing __ksm_exit
1611 * of the last mm on the list may have removed it since then.
1612 */
1613 if (slot == &ksm_mm_head)
1614 return NULL;
Izik Eidus31dbd012009-09-21 17:02:03 -07001615next_mm:
1616 ksm_scan.address = 0;
Hugh Dickins6514d512009-12-14 17:59:19 -08001617 ksm_scan.rmap_list = &slot->rmap_list;
Izik Eidus31dbd012009-09-21 17:02:03 -07001618 }
1619
1620 mm = slot->mm;
1621 down_read(&mm->mmap_sem);
Hugh Dickins9ba69292009-09-21 17:02:20 -07001622 if (ksm_test_exit(mm))
1623 vma = NULL;
1624 else
1625 vma = find_vma(mm, ksm_scan.address);
1626
1627 for (; vma; vma = vma->vm_next) {
Izik Eidus31dbd012009-09-21 17:02:03 -07001628 if (!(vma->vm_flags & VM_MERGEABLE))
1629 continue;
1630 if (ksm_scan.address < vma->vm_start)
1631 ksm_scan.address = vma->vm_start;
1632 if (!vma->anon_vma)
1633 ksm_scan.address = vma->vm_end;
1634
1635 while (ksm_scan.address < vma->vm_end) {
Hugh Dickins9ba69292009-09-21 17:02:20 -07001636 if (ksm_test_exit(mm))
1637 break;
Izik Eidus31dbd012009-09-21 17:02:03 -07001638 *page = follow_page(vma, ksm_scan.address, FOLL_GET);
Andrea Arcangeli21ae5b02011-01-13 15:47:00 -08001639 if (IS_ERR_OR_NULL(*page)) {
1640 ksm_scan.address += PAGE_SIZE;
1641 cond_resched();
1642 continue;
1643 }
Kirill A. Shutemovf765f542016-01-15 16:53:03 -08001644 if (PageAnon(*page)) {
Izik Eidus31dbd012009-09-21 17:02:03 -07001645 flush_anon_page(vma, *page, ksm_scan.address);
1646 flush_dcache_page(*page);
1647 rmap_item = get_next_rmap_item(slot,
Hugh Dickins6514d512009-12-14 17:59:19 -08001648 ksm_scan.rmap_list, ksm_scan.address);
Izik Eidus31dbd012009-09-21 17:02:03 -07001649 if (rmap_item) {
Hugh Dickins6514d512009-12-14 17:59:19 -08001650 ksm_scan.rmap_list =
1651 &rmap_item->rmap_list;
Izik Eidus31dbd012009-09-21 17:02:03 -07001652 ksm_scan.address += PAGE_SIZE;
1653 } else
1654 put_page(*page);
1655 up_read(&mm->mmap_sem);
1656 return rmap_item;
1657 }
Andrea Arcangeli21ae5b02011-01-13 15:47:00 -08001658 put_page(*page);
Izik Eidus31dbd012009-09-21 17:02:03 -07001659 ksm_scan.address += PAGE_SIZE;
1660 cond_resched();
1661 }
1662 }
1663
Hugh Dickins9ba69292009-09-21 17:02:20 -07001664 if (ksm_test_exit(mm)) {
1665 ksm_scan.address = 0;
Hugh Dickins6514d512009-12-14 17:59:19 -08001666 ksm_scan.rmap_list = &slot->rmap_list;
Hugh Dickins9ba69292009-09-21 17:02:20 -07001667 }
Izik Eidus31dbd012009-09-21 17:02:03 -07001668 /*
1669 * Nuke all the rmap_items that are above this current rmap:
1670 * because there were no VM_MERGEABLE vmas with such addresses.
1671 */
Hugh Dickins6514d512009-12-14 17:59:19 -08001672 remove_trailing_rmap_items(slot, ksm_scan.rmap_list);
Izik Eidus31dbd012009-09-21 17:02:03 -07001673
1674 spin_lock(&ksm_mmlist_lock);
Hugh Dickinscd551f92009-09-21 17:02:17 -07001675 ksm_scan.mm_slot = list_entry(slot->mm_list.next,
1676 struct mm_slot, mm_list);
1677 if (ksm_scan.address == 0) {
1678 /*
1679 * We've completed a full scan of all vmas, holding mmap_sem
1680 * throughout, and found no VM_MERGEABLE: so do the same as
1681 * __ksm_exit does to remove this mm from all our lists now.
Hugh Dickins9ba69292009-09-21 17:02:20 -07001682 * This applies either when cleaning up after __ksm_exit
1683 * (but beware: we can reach here even before __ksm_exit),
1684 * or when all VM_MERGEABLE areas have been unmapped (and
1685 * mmap_sem then protects against race with MADV_MERGEABLE).
Hugh Dickinscd551f92009-09-21 17:02:17 -07001686 */
Sasha Levin4ca3a692013-02-22 16:32:28 -08001687 hash_del(&slot->link);
Hugh Dickinscd551f92009-09-21 17:02:17 -07001688 list_del(&slot->mm_list);
Hugh Dickins9ba69292009-09-21 17:02:20 -07001689 spin_unlock(&ksm_mmlist_lock);
1690
Hugh Dickinscd551f92009-09-21 17:02:17 -07001691 free_mm_slot(slot);
1692 clear_bit(MMF_VM_MERGEABLE, &mm->flags);
Hugh Dickins9ba69292009-09-21 17:02:20 -07001693 up_read(&mm->mmap_sem);
1694 mmdrop(mm);
1695 } else {
Hugh Dickins9ba69292009-09-21 17:02:20 -07001696 up_read(&mm->mmap_sem);
Zhou Chengming7496fea2016-05-12 15:42:21 -07001697 /*
1698 * up_read(&mm->mmap_sem) first because after
1699 * spin_unlock(&ksm_mmlist_lock) run, the "mm" may
1700 * already have been freed under us by __ksm_exit()
1701 * because the "mm_slot" is still hashed and
1702 * ksm_scan.mm_slot doesn't point to it anymore.
1703 */
1704 spin_unlock(&ksm_mmlist_lock);
Hugh Dickinscd551f92009-09-21 17:02:17 -07001705 }
Izik Eidus31dbd012009-09-21 17:02:03 -07001706
1707 /* Repeat until we've completed scanning the whole list */
Hugh Dickinscd551f92009-09-21 17:02:17 -07001708 slot = ksm_scan.mm_slot;
Izik Eidus31dbd012009-09-21 17:02:03 -07001709 if (slot != &ksm_mm_head)
1710 goto next_mm;
1711
Izik Eidus31dbd012009-09-21 17:02:03 -07001712 ksm_scan.seqnr++;
1713 return NULL;
1714}
1715
1716/**
1717 * ksm_do_scan - the ksm scanner main worker function.
1718 * @scan_npages - number of pages we want to scan before we return.
1719 */
1720static void ksm_do_scan(unsigned int scan_npages)
1721{
1722 struct rmap_item *rmap_item;
Dan Carpenter22eccdd2010-04-23 13:18:10 -04001723 struct page *uninitialized_var(page);
Izik Eidus31dbd012009-09-21 17:02:03 -07001724
Andrea Arcangeli878aee72011-01-13 15:47:10 -08001725 while (scan_npages-- && likely(!freezing(current))) {
Izik Eidus31dbd012009-09-21 17:02:03 -07001726 cond_resched();
1727 rmap_item = scan_get_next_rmap_item(&page);
1728 if (!rmap_item)
1729 return;
Hugh Dickins4146d2d2013-02-22 16:35:11 -08001730 cmp_and_merge_page(page, rmap_item);
Izik Eidus31dbd012009-09-21 17:02:03 -07001731 put_page(page);
1732 }
1733}
1734
Hugh Dickins6e1583842009-09-21 17:02:14 -07001735static int ksmd_should_run(void)
1736{
1737 return (ksm_run & KSM_RUN_MERGE) && !list_empty(&ksm_mm_head.mm_list);
1738}
1739
Izik Eidus31dbd012009-09-21 17:02:03 -07001740static int ksm_scan_thread(void *nothing)
1741{
Andrea Arcangeli878aee72011-01-13 15:47:10 -08001742 set_freezable();
Izik Eidus339aa622009-09-21 17:02:07 -07001743 set_user_nice(current, 5);
Izik Eidus31dbd012009-09-21 17:02:03 -07001744
1745 while (!kthread_should_stop()) {
Hugh Dickins6e1583842009-09-21 17:02:14 -07001746 mutex_lock(&ksm_thread_mutex);
Hugh Dickinsef4d43a2013-02-22 16:35:16 -08001747 wait_while_offlining();
Hugh Dickins6e1583842009-09-21 17:02:14 -07001748 if (ksmd_should_run())
Izik Eidus31dbd012009-09-21 17:02:03 -07001749 ksm_do_scan(ksm_thread_pages_to_scan);
Hugh Dickins6e1583842009-09-21 17:02:14 -07001750 mutex_unlock(&ksm_thread_mutex);
1751
Andrea Arcangeli878aee72011-01-13 15:47:10 -08001752 try_to_freeze();
1753
Hugh Dickins6e1583842009-09-21 17:02:14 -07001754 if (ksmd_should_run()) {
Izik Eidus31dbd012009-09-21 17:02:03 -07001755 schedule_timeout_interruptible(
1756 msecs_to_jiffies(ksm_thread_sleep_millisecs));
1757 } else {
Andrea Arcangeli878aee72011-01-13 15:47:10 -08001758 wait_event_freezable(ksm_thread_wait,
Hugh Dickins6e1583842009-09-21 17:02:14 -07001759 ksmd_should_run() || kthread_should_stop());
Izik Eidus31dbd012009-09-21 17:02:03 -07001760 }
1761 }
1762 return 0;
1763}
1764
Hugh Dickinsf8af4da2009-09-21 17:01:57 -07001765int ksm_madvise(struct vm_area_struct *vma, unsigned long start,
1766 unsigned long end, int advice, unsigned long *vm_flags)
1767{
1768 struct mm_struct *mm = vma->vm_mm;
Hugh Dickinsd952b792009-09-21 17:02:16 -07001769 int err;
Hugh Dickinsf8af4da2009-09-21 17:01:57 -07001770
1771 switch (advice) {
1772 case MADV_MERGEABLE:
1773 /*
1774 * Be somewhat over-protective for now!
1775 */
1776 if (*vm_flags & (VM_MERGEABLE | VM_SHARED | VM_MAYSHARE |
1777 VM_PFNMAP | VM_IO | VM_DONTEXPAND |
Kirill A. Shutemov0661a332015-02-10 14:10:04 -08001778 VM_HUGETLB | VM_MIXEDMAP))
Hugh Dickinsf8af4da2009-09-21 17:01:57 -07001779 return 0; /* just ignore the advice */
1780
Konstantin Khlebnikovcc2383e2012-10-08 16:28:37 -07001781#ifdef VM_SAO
1782 if (*vm_flags & VM_SAO)
1783 return 0;
1784#endif
1785
Hugh Dickinsd952b792009-09-21 17:02:16 -07001786 if (!test_bit(MMF_VM_MERGEABLE, &mm->flags)) {
1787 err = __ksm_enter(mm);
1788 if (err)
1789 return err;
1790 }
Hugh Dickinsf8af4da2009-09-21 17:01:57 -07001791
1792 *vm_flags |= VM_MERGEABLE;
1793 break;
1794
1795 case MADV_UNMERGEABLE:
1796 if (!(*vm_flags & VM_MERGEABLE))
1797 return 0; /* just ignore the advice */
1798
Hugh Dickinsd952b792009-09-21 17:02:16 -07001799 if (vma->anon_vma) {
1800 err = unmerge_ksm_pages(vma, start, end);
1801 if (err)
1802 return err;
1803 }
Hugh Dickinsf8af4da2009-09-21 17:01:57 -07001804
1805 *vm_flags &= ~VM_MERGEABLE;
1806 break;
1807 }
1808
1809 return 0;
1810}
1811
1812int __ksm_enter(struct mm_struct *mm)
1813{
Hugh Dickins6e1583842009-09-21 17:02:14 -07001814 struct mm_slot *mm_slot;
1815 int needs_wakeup;
1816
1817 mm_slot = alloc_mm_slot();
Izik Eidus31dbd012009-09-21 17:02:03 -07001818 if (!mm_slot)
1819 return -ENOMEM;
1820
Hugh Dickins6e1583842009-09-21 17:02:14 -07001821 /* Check ksm_run too? Would need tighter locking */
1822 needs_wakeup = list_empty(&ksm_mm_head.mm_list);
1823
Izik Eidus31dbd012009-09-21 17:02:03 -07001824 spin_lock(&ksm_mmlist_lock);
1825 insert_to_mm_slots_hash(mm, mm_slot);
1826 /*
Hugh Dickinscbf86cf2013-02-22 16:35:08 -08001827 * When KSM_RUN_MERGE (or KSM_RUN_STOP),
1828 * insert just behind the scanning cursor, to let the area settle
Izik Eidus31dbd012009-09-21 17:02:03 -07001829 * down a little; when fork is followed by immediate exec, we don't
1830 * want ksmd to waste time setting up and tearing down an rmap_list.
Hugh Dickinscbf86cf2013-02-22 16:35:08 -08001831 *
1832 * But when KSM_RUN_UNMERGE, it's important to insert ahead of its
1833 * scanning cursor, otherwise KSM pages in newly forked mms will be
1834 * missed: then we might as well insert at the end of the list.
Izik Eidus31dbd012009-09-21 17:02:03 -07001835 */
Hugh Dickinscbf86cf2013-02-22 16:35:08 -08001836 if (ksm_run & KSM_RUN_UNMERGE)
1837 list_add_tail(&mm_slot->mm_list, &ksm_mm_head.mm_list);
1838 else
1839 list_add_tail(&mm_slot->mm_list, &ksm_scan.mm_slot->mm_list);
Izik Eidus31dbd012009-09-21 17:02:03 -07001840 spin_unlock(&ksm_mmlist_lock);
1841
Hugh Dickinsf8af4da2009-09-21 17:01:57 -07001842 set_bit(MMF_VM_MERGEABLE, &mm->flags);
Hugh Dickins9ba69292009-09-21 17:02:20 -07001843 atomic_inc(&mm->mm_count);
Hugh Dickins6e1583842009-09-21 17:02:14 -07001844
1845 if (needs_wakeup)
1846 wake_up_interruptible(&ksm_thread_wait);
1847
Hugh Dickinsf8af4da2009-09-21 17:01:57 -07001848 return 0;
1849}
1850
Andrea Arcangeli1c2fb7a2009-09-21 17:02:22 -07001851void __ksm_exit(struct mm_struct *mm)
Hugh Dickinsf8af4da2009-09-21 17:01:57 -07001852{
Hugh Dickinscd551f92009-09-21 17:02:17 -07001853 struct mm_slot *mm_slot;
Hugh Dickins9ba69292009-09-21 17:02:20 -07001854 int easy_to_free = 0;
Hugh Dickinscd551f92009-09-21 17:02:17 -07001855
Izik Eidus31dbd012009-09-21 17:02:03 -07001856 /*
Hugh Dickins9ba69292009-09-21 17:02:20 -07001857 * This process is exiting: if it's straightforward (as is the
1858 * case when ksmd was never running), free mm_slot immediately.
1859 * But if it's at the cursor or has rmap_items linked to it, use
1860 * mmap_sem to synchronize with any break_cows before pagetables
1861 * are freed, and leave the mm_slot on the list for ksmd to free.
1862 * Beware: ksm may already have noticed it exiting and freed the slot.
Izik Eidus31dbd012009-09-21 17:02:03 -07001863 */
Hugh Dickins9ba69292009-09-21 17:02:20 -07001864
Hugh Dickinscd551f92009-09-21 17:02:17 -07001865 spin_lock(&ksm_mmlist_lock);
1866 mm_slot = get_mm_slot(mm);
Hugh Dickins9ba69292009-09-21 17:02:20 -07001867 if (mm_slot && ksm_scan.mm_slot != mm_slot) {
Hugh Dickins6514d512009-12-14 17:59:19 -08001868 if (!mm_slot->rmap_list) {
Sasha Levin4ca3a692013-02-22 16:32:28 -08001869 hash_del(&mm_slot->link);
Hugh Dickins9ba69292009-09-21 17:02:20 -07001870 list_del(&mm_slot->mm_list);
1871 easy_to_free = 1;
1872 } else {
1873 list_move(&mm_slot->mm_list,
1874 &ksm_scan.mm_slot->mm_list);
1875 }
Hugh Dickinscd551f92009-09-21 17:02:17 -07001876 }
Hugh Dickinscd551f92009-09-21 17:02:17 -07001877 spin_unlock(&ksm_mmlist_lock);
1878
Hugh Dickins9ba69292009-09-21 17:02:20 -07001879 if (easy_to_free) {
1880 free_mm_slot(mm_slot);
1881 clear_bit(MMF_VM_MERGEABLE, &mm->flags);
1882 mmdrop(mm);
1883 } else if (mm_slot) {
Hugh Dickins9ba69292009-09-21 17:02:20 -07001884 down_write(&mm->mmap_sem);
1885 up_write(&mm->mmap_sem);
Hugh Dickins9ba69292009-09-21 17:02:20 -07001886 }
Hugh Dickinsf8af4da2009-09-21 17:01:57 -07001887}
Izik Eidus31dbd012009-09-21 17:02:03 -07001888
Hugh Dickinscbf86cf2013-02-22 16:35:08 -08001889struct page *ksm_might_need_to_copy(struct page *page,
Hugh Dickins5ad64682009-12-14 17:59:24 -08001890 struct vm_area_struct *vma, unsigned long address)
1891{
Hugh Dickinscbf86cf2013-02-22 16:35:08 -08001892 struct anon_vma *anon_vma = page_anon_vma(page);
Hugh Dickins5ad64682009-12-14 17:59:24 -08001893 struct page *new_page;
1894
Hugh Dickinscbf86cf2013-02-22 16:35:08 -08001895 if (PageKsm(page)) {
1896 if (page_stable_node(page) &&
1897 !(ksm_run & KSM_RUN_UNMERGE))
1898 return page; /* no need to copy it */
1899 } else if (!anon_vma) {
1900 return page; /* no need to copy it */
1901 } else if (anon_vma->root == vma->anon_vma->root &&
1902 page->index == linear_page_index(vma, address)) {
1903 return page; /* still no need to copy it */
1904 }
1905 if (!PageUptodate(page))
1906 return page; /* let do_swap_page report the error */
1907
Hugh Dickins5ad64682009-12-14 17:59:24 -08001908 new_page = alloc_page_vma(GFP_HIGHUSER_MOVABLE, vma, address);
1909 if (new_page) {
1910 copy_user_highpage(new_page, page, address, vma);
1911
1912 SetPageDirty(new_page);
1913 __SetPageUptodate(new_page);
Kirill A. Shutemov48c935a2016-01-15 16:51:24 -08001914 __SetPageLocked(new_page);
Hugh Dickins5ad64682009-12-14 17:59:24 -08001915 }
1916
Hugh Dickins5ad64682009-12-14 17:59:24 -08001917 return new_page;
1918}
1919
Joonsoo Kim051ac832014-01-21 15:49:48 -08001920int rmap_walk_ksm(struct page *page, struct rmap_walk_control *rwc)
Hugh Dickinse9995ef2009-12-14 17:59:31 -08001921{
1922 struct stable_node *stable_node;
Hugh Dickinse9995ef2009-12-14 17:59:31 -08001923 struct rmap_item *rmap_item;
1924 int ret = SWAP_AGAIN;
1925 int search_new_forks = 0;
1926
Sasha Levin309381fea2014-01-23 15:52:54 -08001927 VM_BUG_ON_PAGE(!PageKsm(page), page);
Joonsoo Kim9f326242014-01-21 15:49:53 -08001928
1929 /*
1930 * Rely on the page lock to protect against concurrent modifications
1931 * to that page's node of the stable tree.
1932 */
Sasha Levin309381fea2014-01-23 15:52:54 -08001933 VM_BUG_ON_PAGE(!PageLocked(page), page);
Hugh Dickinse9995ef2009-12-14 17:59:31 -08001934
1935 stable_node = page_stable_node(page);
1936 if (!stable_node)
1937 return ret;
1938again:
Sasha Levinb67bfe02013-02-27 17:06:00 -08001939 hlist_for_each_entry(rmap_item, &stable_node->hlist, hlist) {
Hugh Dickinse9995ef2009-12-14 17:59:31 -08001940 struct anon_vma *anon_vma = rmap_item->anon_vma;
Rik van Riel5beb4932010-03-05 13:42:07 -08001941 struct anon_vma_chain *vmac;
Hugh Dickinse9995ef2009-12-14 17:59:31 -08001942 struct vm_area_struct *vma;
1943
Andrea Arcangeliad126952015-11-05 18:49:07 -08001944 cond_resched();
Hugh Dickinsb6b19f22012-12-19 17:44:29 -08001945 anon_vma_lock_read(anon_vma);
Michel Lespinassebf181b92012-10-08 16:31:39 -07001946 anon_vma_interval_tree_foreach(vmac, &anon_vma->rb_root,
1947 0, ULONG_MAX) {
Andrea Arcangeliad126952015-11-05 18:49:07 -08001948 cond_resched();
Rik van Riel5beb4932010-03-05 13:42:07 -08001949 vma = vmac->vma;
Hugh Dickinse9995ef2009-12-14 17:59:31 -08001950 if (rmap_item->address < vma->vm_start ||
1951 rmap_item->address >= vma->vm_end)
1952 continue;
1953 /*
1954 * Initially we examine only the vma which covers this
1955 * rmap_item; but later, if there is still work to do,
1956 * we examine covering vmas in other mms: in case they
1957 * were forked from the original since ksmd passed.
1958 */
1959 if ((rmap_item->mm == vma->vm_mm) == search_new_forks)
1960 continue;
1961
Joonsoo Kim0dd1c7b2014-01-21 15:49:49 -08001962 if (rwc->invalid_vma && rwc->invalid_vma(vma, rwc->arg))
1963 continue;
1964
Joonsoo Kim051ac832014-01-21 15:49:48 -08001965 ret = rwc->rmap_one(page, vma,
1966 rmap_item->address, rwc->arg);
Hugh Dickinse9995ef2009-12-14 17:59:31 -08001967 if (ret != SWAP_AGAIN) {
Hugh Dickinsb6b19f22012-12-19 17:44:29 -08001968 anon_vma_unlock_read(anon_vma);
Hugh Dickinse9995ef2009-12-14 17:59:31 -08001969 goto out;
1970 }
Joonsoo Kim0dd1c7b2014-01-21 15:49:49 -08001971 if (rwc->done && rwc->done(page)) {
1972 anon_vma_unlock_read(anon_vma);
1973 goto out;
1974 }
Hugh Dickinse9995ef2009-12-14 17:59:31 -08001975 }
Hugh Dickinsb6b19f22012-12-19 17:44:29 -08001976 anon_vma_unlock_read(anon_vma);
Hugh Dickinse9995ef2009-12-14 17:59:31 -08001977 }
1978 if (!search_new_forks++)
1979 goto again;
1980out:
1981 return ret;
1982}
1983
Joonsoo Kim52629502014-01-21 15:49:50 -08001984#ifdef CONFIG_MIGRATION
Hugh Dickinse9995ef2009-12-14 17:59:31 -08001985void ksm_migrate_page(struct page *newpage, struct page *oldpage)
1986{
1987 struct stable_node *stable_node;
1988
Sasha Levin309381fea2014-01-23 15:52:54 -08001989 VM_BUG_ON_PAGE(!PageLocked(oldpage), oldpage);
1990 VM_BUG_ON_PAGE(!PageLocked(newpage), newpage);
1991 VM_BUG_ON_PAGE(newpage->mapping != oldpage->mapping, newpage);
Hugh Dickinse9995ef2009-12-14 17:59:31 -08001992
1993 stable_node = page_stable_node(newpage);
1994 if (stable_node) {
Sasha Levin309381fea2014-01-23 15:52:54 -08001995 VM_BUG_ON_PAGE(stable_node->kpfn != page_to_pfn(oldpage), oldpage);
Hugh Dickins62b61f62009-12-14 17:59:33 -08001996 stable_node->kpfn = page_to_pfn(newpage);
Hugh Dickinsc8d65532013-02-22 16:35:10 -08001997 /*
1998 * newpage->mapping was set in advance; now we need smp_wmb()
1999 * to make sure that the new stable_node->kpfn is visible
2000 * to get_ksm_page() before it can see that oldpage->mapping
2001 * has gone stale (or that PageSwapCache has been cleared).
2002 */
2003 smp_wmb();
2004 set_page_stable_node(oldpage, NULL);
Hugh Dickinse9995ef2009-12-14 17:59:31 -08002005 }
2006}
2007#endif /* CONFIG_MIGRATION */
2008
Hugh Dickins62b61f62009-12-14 17:59:33 -08002009#ifdef CONFIG_MEMORY_HOTREMOVE
Hugh Dickinsef4d43a2013-02-22 16:35:16 -08002010static void wait_while_offlining(void)
2011{
2012 while (ksm_run & KSM_RUN_OFFLINE) {
2013 mutex_unlock(&ksm_thread_mutex);
2014 wait_on_bit(&ksm_run, ilog2(KSM_RUN_OFFLINE),
NeilBrown74316202014-07-07 15:16:04 +10002015 TASK_UNINTERRUPTIBLE);
Hugh Dickinsef4d43a2013-02-22 16:35:16 -08002016 mutex_lock(&ksm_thread_mutex);
2017 }
2018}
2019
Hugh Dickinsee0ea592013-02-22 16:35:05 -08002020static void ksm_check_stable_tree(unsigned long start_pfn,
2021 unsigned long end_pfn)
Hugh Dickins62b61f62009-12-14 17:59:33 -08002022{
Geliang Tang03640412016-01-14 15:20:54 -08002023 struct stable_node *stable_node, *next;
Hugh Dickins62b61f62009-12-14 17:59:33 -08002024 struct rb_node *node;
Petr Holasek90bd6fd2013-02-22 16:35:00 -08002025 int nid;
Hugh Dickins62b61f62009-12-14 17:59:33 -08002026
Hugh Dickinsef53d16c2013-02-22 16:36:12 -08002027 for (nid = 0; nid < ksm_nr_node_ids; nid++) {
2028 node = rb_first(root_stable_tree + nid);
Hugh Dickinsee0ea592013-02-22 16:35:05 -08002029 while (node) {
Petr Holasek90bd6fd2013-02-22 16:35:00 -08002030 stable_node = rb_entry(node, struct stable_node, node);
2031 if (stable_node->kpfn >= start_pfn &&
Hugh Dickinsee0ea592013-02-22 16:35:05 -08002032 stable_node->kpfn < end_pfn) {
2033 /*
2034 * Don't get_ksm_page, page has already gone:
2035 * which is why we keep kpfn instead of page*
2036 */
2037 remove_node_from_stable_tree(stable_node);
Hugh Dickinsef53d16c2013-02-22 16:36:12 -08002038 node = rb_first(root_stable_tree + nid);
Hugh Dickinsee0ea592013-02-22 16:35:05 -08002039 } else
2040 node = rb_next(node);
2041 cond_resched();
Petr Holasek90bd6fd2013-02-22 16:35:00 -08002042 }
Hugh Dickinsee0ea592013-02-22 16:35:05 -08002043 }
Geliang Tang03640412016-01-14 15:20:54 -08002044 list_for_each_entry_safe(stable_node, next, &migrate_nodes, list) {
Hugh Dickins4146d2d2013-02-22 16:35:11 -08002045 if (stable_node->kpfn >= start_pfn &&
2046 stable_node->kpfn < end_pfn)
2047 remove_node_from_stable_tree(stable_node);
2048 cond_resched();
2049 }
Hugh Dickins62b61f62009-12-14 17:59:33 -08002050}
2051
2052static int ksm_memory_callback(struct notifier_block *self,
2053 unsigned long action, void *arg)
2054{
2055 struct memory_notify *mn = arg;
Hugh Dickins62b61f62009-12-14 17:59:33 -08002056
2057 switch (action) {
2058 case MEM_GOING_OFFLINE:
2059 /*
Hugh Dickinsef4d43a2013-02-22 16:35:16 -08002060 * Prevent ksm_do_scan(), unmerge_and_remove_all_rmap_items()
2061 * and remove_all_stable_nodes() while memory is going offline:
2062 * it is unsafe for them to touch the stable tree at this time.
2063 * But unmerge_ksm_pages(), rmap lookups and other entry points
2064 * which do not need the ksm_thread_mutex are all safe.
Hugh Dickins62b61f62009-12-14 17:59:33 -08002065 */
Hugh Dickinsef4d43a2013-02-22 16:35:16 -08002066 mutex_lock(&ksm_thread_mutex);
2067 ksm_run |= KSM_RUN_OFFLINE;
2068 mutex_unlock(&ksm_thread_mutex);
Hugh Dickins62b61f62009-12-14 17:59:33 -08002069 break;
2070
2071 case MEM_OFFLINE:
2072 /*
2073 * Most of the work is done by page migration; but there might
2074 * be a few stable_nodes left over, still pointing to struct
Hugh Dickinsee0ea592013-02-22 16:35:05 -08002075 * pages which have been offlined: prune those from the tree,
2076 * otherwise get_ksm_page() might later try to access a
2077 * non-existent struct page.
Hugh Dickins62b61f62009-12-14 17:59:33 -08002078 */
Hugh Dickinsee0ea592013-02-22 16:35:05 -08002079 ksm_check_stable_tree(mn->start_pfn,
2080 mn->start_pfn + mn->nr_pages);
Hugh Dickins62b61f62009-12-14 17:59:33 -08002081 /* fallthrough */
2082
2083 case MEM_CANCEL_OFFLINE:
Hugh Dickinsef4d43a2013-02-22 16:35:16 -08002084 mutex_lock(&ksm_thread_mutex);
2085 ksm_run &= ~KSM_RUN_OFFLINE;
Hugh Dickins62b61f62009-12-14 17:59:33 -08002086 mutex_unlock(&ksm_thread_mutex);
Hugh Dickinsef4d43a2013-02-22 16:35:16 -08002087
2088 smp_mb(); /* wake_up_bit advises this */
2089 wake_up_bit(&ksm_run, ilog2(KSM_RUN_OFFLINE));
Hugh Dickins62b61f62009-12-14 17:59:33 -08002090 break;
2091 }
2092 return NOTIFY_OK;
2093}
Hugh Dickinsef4d43a2013-02-22 16:35:16 -08002094#else
2095static void wait_while_offlining(void)
2096{
2097}
Hugh Dickins62b61f62009-12-14 17:59:33 -08002098#endif /* CONFIG_MEMORY_HOTREMOVE */
2099
Hugh Dickins2ffd8672009-09-21 17:02:23 -07002100#ifdef CONFIG_SYSFS
2101/*
2102 * This all compiles without CONFIG_SYSFS, but is a waste of space.
2103 */
2104
Izik Eidus31dbd012009-09-21 17:02:03 -07002105#define KSM_ATTR_RO(_name) \
2106 static struct kobj_attribute _name##_attr = __ATTR_RO(_name)
2107#define KSM_ATTR(_name) \
2108 static struct kobj_attribute _name##_attr = \
2109 __ATTR(_name, 0644, _name##_show, _name##_store)
2110
2111static ssize_t sleep_millisecs_show(struct kobject *kobj,
2112 struct kobj_attribute *attr, char *buf)
2113{
2114 return sprintf(buf, "%u\n", ksm_thread_sleep_millisecs);
2115}
2116
2117static ssize_t sleep_millisecs_store(struct kobject *kobj,
2118 struct kobj_attribute *attr,
2119 const char *buf, size_t count)
2120{
2121 unsigned long msecs;
2122 int err;
2123
Jingoo Han3dbb95f2013-09-11 14:20:25 -07002124 err = kstrtoul(buf, 10, &msecs);
Izik Eidus31dbd012009-09-21 17:02:03 -07002125 if (err || msecs > UINT_MAX)
2126 return -EINVAL;
2127
2128 ksm_thread_sleep_millisecs = msecs;
2129
2130 return count;
2131}
2132KSM_ATTR(sleep_millisecs);
2133
2134static ssize_t pages_to_scan_show(struct kobject *kobj,
2135 struct kobj_attribute *attr, char *buf)
2136{
2137 return sprintf(buf, "%u\n", ksm_thread_pages_to_scan);
2138}
2139
2140static ssize_t pages_to_scan_store(struct kobject *kobj,
2141 struct kobj_attribute *attr,
2142 const char *buf, size_t count)
2143{
2144 int err;
2145 unsigned long nr_pages;
2146
Jingoo Han3dbb95f2013-09-11 14:20:25 -07002147 err = kstrtoul(buf, 10, &nr_pages);
Izik Eidus31dbd012009-09-21 17:02:03 -07002148 if (err || nr_pages > UINT_MAX)
2149 return -EINVAL;
2150
2151 ksm_thread_pages_to_scan = nr_pages;
2152
2153 return count;
2154}
2155KSM_ATTR(pages_to_scan);
2156
2157static ssize_t run_show(struct kobject *kobj, struct kobj_attribute *attr,
2158 char *buf)
2159{
Hugh Dickinsef4d43a2013-02-22 16:35:16 -08002160 return sprintf(buf, "%lu\n", ksm_run);
Izik Eidus31dbd012009-09-21 17:02:03 -07002161}
2162
2163static ssize_t run_store(struct kobject *kobj, struct kobj_attribute *attr,
2164 const char *buf, size_t count)
2165{
2166 int err;
2167 unsigned long flags;
2168
Jingoo Han3dbb95f2013-09-11 14:20:25 -07002169 err = kstrtoul(buf, 10, &flags);
Izik Eidus31dbd012009-09-21 17:02:03 -07002170 if (err || flags > UINT_MAX)
2171 return -EINVAL;
2172 if (flags > KSM_RUN_UNMERGE)
2173 return -EINVAL;
2174
2175 /*
2176 * KSM_RUN_MERGE sets ksmd running, and 0 stops it running.
2177 * KSM_RUN_UNMERGE stops it running and unmerges all rmap_items,
Hugh Dickinsd0f209f2009-12-14 17:59:34 -08002178 * breaking COW to free the pages_shared (but leaves mm_slots
2179 * on the list for when ksmd may be set running again).
Izik Eidus31dbd012009-09-21 17:02:03 -07002180 */
2181
2182 mutex_lock(&ksm_thread_mutex);
Hugh Dickinsef4d43a2013-02-22 16:35:16 -08002183 wait_while_offlining();
Izik Eidus31dbd012009-09-21 17:02:03 -07002184 if (ksm_run != flags) {
2185 ksm_run = flags;
Hugh Dickinsd952b792009-09-21 17:02:16 -07002186 if (flags & KSM_RUN_UNMERGE) {
David Rientjese1e12d22012-12-11 16:02:56 -08002187 set_current_oom_origin();
Hugh Dickinsd952b792009-09-21 17:02:16 -07002188 err = unmerge_and_remove_all_rmap_items();
David Rientjese1e12d22012-12-11 16:02:56 -08002189 clear_current_oom_origin();
Hugh Dickinsd952b792009-09-21 17:02:16 -07002190 if (err) {
2191 ksm_run = KSM_RUN_STOP;
2192 count = err;
2193 }
2194 }
Izik Eidus31dbd012009-09-21 17:02:03 -07002195 }
2196 mutex_unlock(&ksm_thread_mutex);
2197
2198 if (flags & KSM_RUN_MERGE)
2199 wake_up_interruptible(&ksm_thread_wait);
2200
2201 return count;
2202}
2203KSM_ATTR(run);
2204
Petr Holasek90bd6fd2013-02-22 16:35:00 -08002205#ifdef CONFIG_NUMA
2206static ssize_t merge_across_nodes_show(struct kobject *kobj,
2207 struct kobj_attribute *attr, char *buf)
2208{
2209 return sprintf(buf, "%u\n", ksm_merge_across_nodes);
2210}
2211
2212static ssize_t merge_across_nodes_store(struct kobject *kobj,
2213 struct kobj_attribute *attr,
2214 const char *buf, size_t count)
2215{
2216 int err;
2217 unsigned long knob;
2218
2219 err = kstrtoul(buf, 10, &knob);
2220 if (err)
2221 return err;
2222 if (knob > 1)
2223 return -EINVAL;
2224
2225 mutex_lock(&ksm_thread_mutex);
Hugh Dickinsef4d43a2013-02-22 16:35:16 -08002226 wait_while_offlining();
Petr Holasek90bd6fd2013-02-22 16:35:00 -08002227 if (ksm_merge_across_nodes != knob) {
Hugh Dickinscbf86cf2013-02-22 16:35:08 -08002228 if (ksm_pages_shared || remove_all_stable_nodes())
Petr Holasek90bd6fd2013-02-22 16:35:00 -08002229 err = -EBUSY;
Hugh Dickinsef53d16c2013-02-22 16:36:12 -08002230 else if (root_stable_tree == one_stable_tree) {
2231 struct rb_root *buf;
2232 /*
2233 * This is the first time that we switch away from the
2234 * default of merging across nodes: must now allocate
2235 * a buffer to hold as many roots as may be needed.
2236 * Allocate stable and unstable together:
2237 * MAXSMP NODES_SHIFT 10 will use 16kB.
2238 */
Joe Perchesbafe1e12013-11-12 15:07:10 -08002239 buf = kcalloc(nr_node_ids + nr_node_ids, sizeof(*buf),
2240 GFP_KERNEL);
Hugh Dickinsef53d16c2013-02-22 16:36:12 -08002241 /* Let us assume that RB_ROOT is NULL is zero */
2242 if (!buf)
2243 err = -ENOMEM;
2244 else {
2245 root_stable_tree = buf;
2246 root_unstable_tree = buf + nr_node_ids;
2247 /* Stable tree is empty but not the unstable */
2248 root_unstable_tree[0] = one_unstable_tree[0];
2249 }
2250 }
2251 if (!err) {
Petr Holasek90bd6fd2013-02-22 16:35:00 -08002252 ksm_merge_across_nodes = knob;
Hugh Dickinsef53d16c2013-02-22 16:36:12 -08002253 ksm_nr_node_ids = knob ? 1 : nr_node_ids;
2254 }
Petr Holasek90bd6fd2013-02-22 16:35:00 -08002255 }
2256 mutex_unlock(&ksm_thread_mutex);
2257
2258 return err ? err : count;
2259}
2260KSM_ATTR(merge_across_nodes);
2261#endif
2262
Hugh Dickinsb4028262009-09-21 17:02:09 -07002263static ssize_t pages_shared_show(struct kobject *kobj,
2264 struct kobj_attribute *attr, char *buf)
2265{
2266 return sprintf(buf, "%lu\n", ksm_pages_shared);
2267}
2268KSM_ATTR_RO(pages_shared);
2269
2270static ssize_t pages_sharing_show(struct kobject *kobj,
2271 struct kobj_attribute *attr, char *buf)
2272{
Hugh Dickinse178dfd2009-09-21 17:02:10 -07002273 return sprintf(buf, "%lu\n", ksm_pages_sharing);
Hugh Dickinsb4028262009-09-21 17:02:09 -07002274}
2275KSM_ATTR_RO(pages_sharing);
2276
Hugh Dickins473b0ce2009-09-21 17:02:11 -07002277static ssize_t pages_unshared_show(struct kobject *kobj,
2278 struct kobj_attribute *attr, char *buf)
2279{
2280 return sprintf(buf, "%lu\n", ksm_pages_unshared);
2281}
2282KSM_ATTR_RO(pages_unshared);
2283
2284static ssize_t pages_volatile_show(struct kobject *kobj,
2285 struct kobj_attribute *attr, char *buf)
2286{
2287 long ksm_pages_volatile;
2288
2289 ksm_pages_volatile = ksm_rmap_items - ksm_pages_shared
2290 - ksm_pages_sharing - ksm_pages_unshared;
2291 /*
2292 * It was not worth any locking to calculate that statistic,
2293 * but it might therefore sometimes be negative: conceal that.
2294 */
2295 if (ksm_pages_volatile < 0)
2296 ksm_pages_volatile = 0;
2297 return sprintf(buf, "%ld\n", ksm_pages_volatile);
2298}
2299KSM_ATTR_RO(pages_volatile);
2300
2301static ssize_t full_scans_show(struct kobject *kobj,
2302 struct kobj_attribute *attr, char *buf)
2303{
2304 return sprintf(buf, "%lu\n", ksm_scan.seqnr);
2305}
2306KSM_ATTR_RO(full_scans);
2307
Izik Eidus31dbd012009-09-21 17:02:03 -07002308static struct attribute *ksm_attrs[] = {
2309 &sleep_millisecs_attr.attr,
2310 &pages_to_scan_attr.attr,
2311 &run_attr.attr,
Hugh Dickinsb4028262009-09-21 17:02:09 -07002312 &pages_shared_attr.attr,
2313 &pages_sharing_attr.attr,
Hugh Dickins473b0ce2009-09-21 17:02:11 -07002314 &pages_unshared_attr.attr,
2315 &pages_volatile_attr.attr,
2316 &full_scans_attr.attr,
Petr Holasek90bd6fd2013-02-22 16:35:00 -08002317#ifdef CONFIG_NUMA
2318 &merge_across_nodes_attr.attr,
2319#endif
Izik Eidus31dbd012009-09-21 17:02:03 -07002320 NULL,
2321};
2322
2323static struct attribute_group ksm_attr_group = {
2324 .attrs = ksm_attrs,
2325 .name = "ksm",
2326};
Hugh Dickins2ffd8672009-09-21 17:02:23 -07002327#endif /* CONFIG_SYSFS */
Izik Eidus31dbd012009-09-21 17:02:03 -07002328
2329static int __init ksm_init(void)
2330{
2331 struct task_struct *ksm_thread;
2332 int err;
2333
2334 err = ksm_slab_init();
2335 if (err)
2336 goto out;
2337
Izik Eidus31dbd012009-09-21 17:02:03 -07002338 ksm_thread = kthread_run(ksm_scan_thread, NULL, "ksmd");
2339 if (IS_ERR(ksm_thread)) {
Paul McQuade25acde32014-10-09 15:29:09 -07002340 pr_err("ksm: creating kthread failed\n");
Izik Eidus31dbd012009-09-21 17:02:03 -07002341 err = PTR_ERR(ksm_thread);
Lai Jiangshand9f89842010-08-09 17:20:02 -07002342 goto out_free;
Izik Eidus31dbd012009-09-21 17:02:03 -07002343 }
2344
Hugh Dickins2ffd8672009-09-21 17:02:23 -07002345#ifdef CONFIG_SYSFS
Izik Eidus31dbd012009-09-21 17:02:03 -07002346 err = sysfs_create_group(mm_kobj, &ksm_attr_group);
2347 if (err) {
Paul McQuade25acde32014-10-09 15:29:09 -07002348 pr_err("ksm: register sysfs failed\n");
Hugh Dickins2ffd8672009-09-21 17:02:23 -07002349 kthread_stop(ksm_thread);
Lai Jiangshand9f89842010-08-09 17:20:02 -07002350 goto out_free;
Izik Eidus31dbd012009-09-21 17:02:03 -07002351 }
Hugh Dickinsc73602a2009-10-07 16:32:22 -07002352#else
2353 ksm_run = KSM_RUN_MERGE; /* no way for user to start it */
2354
Hugh Dickins2ffd8672009-09-21 17:02:23 -07002355#endif /* CONFIG_SYSFS */
Izik Eidus31dbd012009-09-21 17:02:03 -07002356
Hugh Dickins62b61f62009-12-14 17:59:33 -08002357#ifdef CONFIG_MEMORY_HOTREMOVE
Hugh Dickinsef4d43a2013-02-22 16:35:16 -08002358 /* There is no significance to this priority 100 */
Hugh Dickins62b61f62009-12-14 17:59:33 -08002359 hotplug_memory_notifier(ksm_memory_callback, 100);
2360#endif
Izik Eidus31dbd012009-09-21 17:02:03 -07002361 return 0;
2362
Lai Jiangshand9f89842010-08-09 17:20:02 -07002363out_free:
Izik Eidus31dbd012009-09-21 17:02:03 -07002364 ksm_slab_free();
2365out:
2366 return err;
2367}
Paul Gortmakera64fb3c2014-01-23 15:53:30 -08002368subsys_initcall(ksm_init);