]>
Commit | Line | Data |
---|---|---|
46aeb7e6 | 1 | // SPDX-License-Identifier: GPL-2.0-only |
1da177e4 LT |
2 | /* |
3 | * Simple NUMA memory policy for the Linux kernel. | |
4 | * | |
5 | * Copyright 2003,2004 Andi Kleen, SuSE Labs. | |
8bccd85f | 6 | * (C) Copyright 2005 Christoph Lameter, Silicon Graphics, Inc. |
1da177e4 LT |
7 | * |
8 | * NUMA policy allows the user to give hints in which node(s) memory should | |
9 | * be allocated. | |
10 | * | |
11 | * Support four policies per VMA and per process: | |
12 | * | |
13 | * The VMA policy has priority over the process policy for a page fault. | |
14 | * | |
15 | * interleave Allocate memory interleaved over a set of nodes, | |
16 | * with normal fallback if it fails. | |
17 | * For VMA based allocations this interleaves based on the | |
18 | * offset into the backing object or offset into the mapping | |
19 | * for anonymous memory. For process policy an process counter | |
20 | * is used. | |
8bccd85f | 21 | * |
1da177e4 LT |
22 | * bind Only allocate memory on a specific set of nodes, |
23 | * no fallback. | |
8bccd85f CL |
24 | * FIXME: memory is allocated starting with the first node |
25 | * to the last. It would be better if bind would truly restrict | |
26 | * the allocation to memory nodes instead | |
27 | * | |
1da177e4 | 28 | * preferred Try a specific node first before normal fallback. |
00ef2d2f | 29 | * As a special case NUMA_NO_NODE here means do the allocation |
1da177e4 LT |
30 | * on the local CPU. This is normally identical to default, |
31 | * but useful to set in a VMA when you have a non default | |
32 | * process policy. | |
8bccd85f | 33 | * |
1da177e4 LT |
34 | * default Allocate on the local node first, or when on a VMA |
35 | * use the process policy. This is what Linux always did | |
36 | * in a NUMA aware kernel and still does by, ahem, default. | |
37 | * | |
38 | * The process policy is applied for most non interrupt memory allocations | |
39 | * in that process' context. Interrupts ignore the policies and always | |
40 | * try to allocate on the local CPU. The VMA policy is only applied for memory | |
41 | * allocations for a VMA in the VM. | |
42 | * | |
43 | * Currently there are a few corner cases in swapping where the policy | |
44 | * is not applied, but the majority should be handled. When process policy | |
45 | * is used it is not remembered over swap outs/swap ins. | |
46 | * | |
47 | * Only the highest zone in the zone hierarchy gets policied. Allocations | |
48 | * requesting a lower zone just use default policy. This implies that | |
49 | * on systems with highmem kernel lowmem allocation don't get policied. | |
50 | * Same with GFP_DMA allocations. | |
51 | * | |
52 | * For shmfs/tmpfs/hugetlbfs shared memory the policy is shared between | |
53 | * all users and remembered even when nobody has memory mapped. | |
54 | */ | |
55 | ||
56 | /* Notebook: | |
57 | fix mmap readahead to honour policy and enable policy for any page cache | |
58 | object | |
59 | statistics for bigpages | |
60 | global policy for page cache? currently it uses process policy. Requires | |
61 | first item above. | |
62 | handle mremap for shared memory (currently ignored for the policy) | |
63 | grows down? | |
64 | make bind policy root only? It can trigger oom much faster and the | |
65 | kernel is not always grateful with that. | |
1da177e4 LT |
66 | */ |
67 | ||
b1de0d13 MH |
68 | #define pr_fmt(fmt) KBUILD_MODNAME ": " fmt |
69 | ||
1da177e4 | 70 | #include <linux/mempolicy.h> |
a520110e | 71 | #include <linux/pagewalk.h> |
1da177e4 LT |
72 | #include <linux/highmem.h> |
73 | #include <linux/hugetlb.h> | |
74 | #include <linux/kernel.h> | |
75 | #include <linux/sched.h> | |
6e84f315 | 76 | #include <linux/sched/mm.h> |
6a3827d7 | 77 | #include <linux/sched/numa_balancing.h> |
f719ff9b | 78 | #include <linux/sched/task.h> |
1da177e4 LT |
79 | #include <linux/nodemask.h> |
80 | #include <linux/cpuset.h> | |
1da177e4 LT |
81 | #include <linux/slab.h> |
82 | #include <linux/string.h> | |
b95f1b31 | 83 | #include <linux/export.h> |
b488893a | 84 | #include <linux/nsproxy.h> |
1da177e4 LT |
85 | #include <linux/interrupt.h> |
86 | #include <linux/init.h> | |
87 | #include <linux/compat.h> | |
31367466 | 88 | #include <linux/ptrace.h> |
dc9aa5b9 | 89 | #include <linux/swap.h> |
1a75a6c8 CL |
90 | #include <linux/seq_file.h> |
91 | #include <linux/proc_fs.h> | |
b20a3503 | 92 | #include <linux/migrate.h> |
62b61f61 | 93 | #include <linux/ksm.h> |
95a402c3 | 94 | #include <linux/rmap.h> |
86c3a764 | 95 | #include <linux/security.h> |
dbcb0f19 | 96 | #include <linux/syscalls.h> |
095f1fc4 | 97 | #include <linux/ctype.h> |
6d9c285a | 98 | #include <linux/mm_inline.h> |
b24f53a0 | 99 | #include <linux/mmu_notifier.h> |
b1de0d13 | 100 | #include <linux/printk.h> |
c8633798 | 101 | #include <linux/swapops.h> |
dc9aa5b9 | 102 | |
1da177e4 | 103 | #include <asm/tlbflush.h> |
7c0f6ba6 | 104 | #include <linux/uaccess.h> |
1da177e4 | 105 | |
62695a84 NP |
106 | #include "internal.h" |
107 | ||
38e35860 | 108 | /* Internal flags */ |
dc9aa5b9 | 109 | #define MPOL_MF_DISCONTIG_OK (MPOL_MF_INTERNAL << 0) /* Skip checks for continuous vmas */ |
38e35860 | 110 | #define MPOL_MF_INVERT (MPOL_MF_INTERNAL << 1) /* Invert check for nodemask */ |
dc9aa5b9 | 111 | |
fcc234f8 PE |
112 | static struct kmem_cache *policy_cache; |
113 | static struct kmem_cache *sn_cache; | |
1da177e4 | 114 | |
1da177e4 LT |
115 | /* Highest zone. An specific allocation for a zone below that is not |
116 | policied. */ | |
6267276f | 117 | enum zone_type policy_zone = 0; |
1da177e4 | 118 | |
bea904d5 LS |
119 | /* |
120 | * run-time system-wide default policy => local allocation | |
121 | */ | |
e754d79d | 122 | static struct mempolicy default_policy = { |
1da177e4 | 123 | .refcnt = ATOMIC_INIT(1), /* never free it */ |
bea904d5 | 124 | .mode = MPOL_PREFERRED, |
fc36b8d3 | 125 | .flags = MPOL_F_LOCAL, |
1da177e4 LT |
126 | }; |
127 | ||
5606e387 MG |
128 | static struct mempolicy preferred_node_policy[MAX_NUMNODES]; |
129 | ||
b2ca916c DW |
130 | /** |
131 | * numa_map_to_online_node - Find closest online node | |
132 | * @nid: Node id to start the search | |
133 | * | |
134 | * Lookup the next closest node by distance if @nid is not online. | |
135 | */ | |
136 | int numa_map_to_online_node(int node) | |
137 | { | |
4fcbe96e | 138 | int min_dist = INT_MAX, dist, n, min_node; |
b2ca916c | 139 | |
4fcbe96e DW |
140 | if (node == NUMA_NO_NODE || node_online(node)) |
141 | return node; | |
b2ca916c DW |
142 | |
143 | min_node = node; | |
4fcbe96e DW |
144 | for_each_online_node(n) { |
145 | dist = node_distance(node, n); | |
146 | if (dist < min_dist) { | |
147 | min_dist = dist; | |
148 | min_node = n; | |
b2ca916c DW |
149 | } |
150 | } | |
151 | ||
152 | return min_node; | |
153 | } | |
154 | EXPORT_SYMBOL_GPL(numa_map_to_online_node); | |
155 | ||
74d2c3a0 | 156 | struct mempolicy *get_task_policy(struct task_struct *p) |
5606e387 MG |
157 | { |
158 | struct mempolicy *pol = p->mempolicy; | |
f15ca78e | 159 | int node; |
5606e387 | 160 | |
f15ca78e ON |
161 | if (pol) |
162 | return pol; | |
5606e387 | 163 | |
f15ca78e ON |
164 | node = numa_node_id(); |
165 | if (node != NUMA_NO_NODE) { | |
166 | pol = &preferred_node_policy[node]; | |
167 | /* preferred_node_policy is not initialised early in boot */ | |
168 | if (pol->mode) | |
169 | return pol; | |
5606e387 MG |
170 | } |
171 | ||
f15ca78e | 172 | return &default_policy; |
5606e387 MG |
173 | } |
174 | ||
37012946 DR |
175 | static const struct mempolicy_operations { |
176 | int (*create)(struct mempolicy *pol, const nodemask_t *nodes); | |
213980c0 | 177 | void (*rebind)(struct mempolicy *pol, const nodemask_t *nodes); |
37012946 DR |
178 | } mpol_ops[MPOL_MAX]; |
179 | ||
f5b087b5 DR |
180 | static inline int mpol_store_user_nodemask(const struct mempolicy *pol) |
181 | { | |
6d556294 | 182 | return pol->flags & MPOL_MODE_FLAGS; |
4c50bc01 DR |
183 | } |
184 | ||
185 | static void mpol_relative_nodemask(nodemask_t *ret, const nodemask_t *orig, | |
186 | const nodemask_t *rel) | |
187 | { | |
188 | nodemask_t tmp; | |
189 | nodes_fold(tmp, *orig, nodes_weight(*rel)); | |
190 | nodes_onto(*ret, tmp, *rel); | |
f5b087b5 DR |
191 | } |
192 | ||
37012946 DR |
193 | static int mpol_new_interleave(struct mempolicy *pol, const nodemask_t *nodes) |
194 | { | |
195 | if (nodes_empty(*nodes)) | |
196 | return -EINVAL; | |
197 | pol->v.nodes = *nodes; | |
198 | return 0; | |
199 | } | |
200 | ||
201 | static int mpol_new_preferred(struct mempolicy *pol, const nodemask_t *nodes) | |
202 | { | |
203 | if (!nodes) | |
fc36b8d3 | 204 | pol->flags |= MPOL_F_LOCAL; /* local allocation */ |
37012946 DR |
205 | else if (nodes_empty(*nodes)) |
206 | return -EINVAL; /* no allowed nodes */ | |
207 | else | |
208 | pol->v.preferred_node = first_node(*nodes); | |
209 | return 0; | |
210 | } | |
211 | ||
212 | static int mpol_new_bind(struct mempolicy *pol, const nodemask_t *nodes) | |
213 | { | |
859f7ef1 | 214 | if (nodes_empty(*nodes)) |
37012946 DR |
215 | return -EINVAL; |
216 | pol->v.nodes = *nodes; | |
217 | return 0; | |
218 | } | |
219 | ||
58568d2a MX |
220 | /* |
221 | * mpol_set_nodemask is called after mpol_new() to set up the nodemask, if | |
222 | * any, for the new policy. mpol_new() has already validated the nodes | |
223 | * parameter with respect to the policy mode and flags. But, we need to | |
224 | * handle an empty nodemask with MPOL_PREFERRED here. | |
225 | * | |
226 | * Must be called holding task's alloc_lock to protect task's mems_allowed | |
c1e8d7c6 | 227 | * and mempolicy. May also be called holding the mmap_lock for write. |
58568d2a | 228 | */ |
4bfc4495 KH |
229 | static int mpol_set_nodemask(struct mempolicy *pol, |
230 | const nodemask_t *nodes, struct nodemask_scratch *nsc) | |
58568d2a | 231 | { |
58568d2a MX |
232 | int ret; |
233 | ||
234 | /* if mode is MPOL_DEFAULT, pol is NULL. This is right. */ | |
235 | if (pol == NULL) | |
236 | return 0; | |
01f13bd6 | 237 | /* Check N_MEMORY */ |
4bfc4495 | 238 | nodes_and(nsc->mask1, |
01f13bd6 | 239 | cpuset_current_mems_allowed, node_states[N_MEMORY]); |
58568d2a MX |
240 | |
241 | VM_BUG_ON(!nodes); | |
242 | if (pol->mode == MPOL_PREFERRED && nodes_empty(*nodes)) | |
243 | nodes = NULL; /* explicit local allocation */ | |
244 | else { | |
245 | if (pol->flags & MPOL_F_RELATIVE_NODES) | |
859f7ef1 | 246 | mpol_relative_nodemask(&nsc->mask2, nodes, &nsc->mask1); |
58568d2a | 247 | else |
4bfc4495 KH |
248 | nodes_and(nsc->mask2, *nodes, nsc->mask1); |
249 | ||
58568d2a MX |
250 | if (mpol_store_user_nodemask(pol)) |
251 | pol->w.user_nodemask = *nodes; | |
252 | else | |
253 | pol->w.cpuset_mems_allowed = | |
254 | cpuset_current_mems_allowed; | |
255 | } | |
256 | ||
4bfc4495 KH |
257 | if (nodes) |
258 | ret = mpol_ops[pol->mode].create(pol, &nsc->mask2); | |
259 | else | |
260 | ret = mpol_ops[pol->mode].create(pol, NULL); | |
58568d2a MX |
261 | return ret; |
262 | } | |
263 | ||
264 | /* | |
265 | * This function just creates a new policy, does some check and simple | |
266 | * initialization. You must invoke mpol_set_nodemask() to set nodes. | |
267 | */ | |
028fec41 DR |
268 | static struct mempolicy *mpol_new(unsigned short mode, unsigned short flags, |
269 | nodemask_t *nodes) | |
1da177e4 LT |
270 | { |
271 | struct mempolicy *policy; | |
272 | ||
028fec41 | 273 | pr_debug("setting mode %d flags %d nodes[0] %lx\n", |
00ef2d2f | 274 | mode, flags, nodes ? nodes_addr(*nodes)[0] : NUMA_NO_NODE); |
140d5a49 | 275 | |
3e1f0645 DR |
276 | if (mode == MPOL_DEFAULT) { |
277 | if (nodes && !nodes_empty(*nodes)) | |
37012946 | 278 | return ERR_PTR(-EINVAL); |
d3a71033 | 279 | return NULL; |
37012946 | 280 | } |
3e1f0645 DR |
281 | VM_BUG_ON(!nodes); |
282 | ||
283 | /* | |
284 | * MPOL_PREFERRED cannot be used with MPOL_F_STATIC_NODES or | |
285 | * MPOL_F_RELATIVE_NODES if the nodemask is empty (local allocation). | |
286 | * All other modes require a valid pointer to a non-empty nodemask. | |
287 | */ | |
288 | if (mode == MPOL_PREFERRED) { | |
289 | if (nodes_empty(*nodes)) { | |
290 | if (((flags & MPOL_F_STATIC_NODES) || | |
291 | (flags & MPOL_F_RELATIVE_NODES))) | |
292 | return ERR_PTR(-EINVAL); | |
3e1f0645 | 293 | } |
479e2802 | 294 | } else if (mode == MPOL_LOCAL) { |
8d303e44 PK |
295 | if (!nodes_empty(*nodes) || |
296 | (flags & MPOL_F_STATIC_NODES) || | |
297 | (flags & MPOL_F_RELATIVE_NODES)) | |
479e2802 PZ |
298 | return ERR_PTR(-EINVAL); |
299 | mode = MPOL_PREFERRED; | |
3e1f0645 DR |
300 | } else if (nodes_empty(*nodes)) |
301 | return ERR_PTR(-EINVAL); | |
1da177e4 LT |
302 | policy = kmem_cache_alloc(policy_cache, GFP_KERNEL); |
303 | if (!policy) | |
304 | return ERR_PTR(-ENOMEM); | |
305 | atomic_set(&policy->refcnt, 1); | |
45c4745a | 306 | policy->mode = mode; |
3e1f0645 | 307 | policy->flags = flags; |
37012946 | 308 | |
1da177e4 | 309 | return policy; |
37012946 DR |
310 | } |
311 | ||
52cd3b07 LS |
312 | /* Slow path of a mpol destructor. */ |
313 | void __mpol_put(struct mempolicy *p) | |
314 | { | |
315 | if (!atomic_dec_and_test(&p->refcnt)) | |
316 | return; | |
52cd3b07 LS |
317 | kmem_cache_free(policy_cache, p); |
318 | } | |
319 | ||
213980c0 | 320 | static void mpol_rebind_default(struct mempolicy *pol, const nodemask_t *nodes) |
37012946 DR |
321 | { |
322 | } | |
323 | ||
213980c0 | 324 | static void mpol_rebind_nodemask(struct mempolicy *pol, const nodemask_t *nodes) |
37012946 DR |
325 | { |
326 | nodemask_t tmp; | |
327 | ||
328 | if (pol->flags & MPOL_F_STATIC_NODES) | |
329 | nodes_and(tmp, pol->w.user_nodemask, *nodes); | |
330 | else if (pol->flags & MPOL_F_RELATIVE_NODES) | |
331 | mpol_relative_nodemask(&tmp, &pol->w.user_nodemask, nodes); | |
332 | else { | |
213980c0 VB |
333 | nodes_remap(tmp, pol->v.nodes,pol->w.cpuset_mems_allowed, |
334 | *nodes); | |
29b190fa | 335 | pol->w.cpuset_mems_allowed = *nodes; |
37012946 | 336 | } |
f5b087b5 | 337 | |
708c1bbc MX |
338 | if (nodes_empty(tmp)) |
339 | tmp = *nodes; | |
340 | ||
213980c0 | 341 | pol->v.nodes = tmp; |
37012946 DR |
342 | } |
343 | ||
344 | static void mpol_rebind_preferred(struct mempolicy *pol, | |
213980c0 | 345 | const nodemask_t *nodes) |
37012946 DR |
346 | { |
347 | nodemask_t tmp; | |
348 | ||
37012946 DR |
349 | if (pol->flags & MPOL_F_STATIC_NODES) { |
350 | int node = first_node(pol->w.user_nodemask); | |
351 | ||
fc36b8d3 | 352 | if (node_isset(node, *nodes)) { |
37012946 | 353 | pol->v.preferred_node = node; |
fc36b8d3 LS |
354 | pol->flags &= ~MPOL_F_LOCAL; |
355 | } else | |
356 | pol->flags |= MPOL_F_LOCAL; | |
37012946 DR |
357 | } else if (pol->flags & MPOL_F_RELATIVE_NODES) { |
358 | mpol_relative_nodemask(&tmp, &pol->w.user_nodemask, nodes); | |
359 | pol->v.preferred_node = first_node(tmp); | |
fc36b8d3 | 360 | } else if (!(pol->flags & MPOL_F_LOCAL)) { |
37012946 DR |
361 | pol->v.preferred_node = node_remap(pol->v.preferred_node, |
362 | pol->w.cpuset_mems_allowed, | |
363 | *nodes); | |
364 | pol->w.cpuset_mems_allowed = *nodes; | |
365 | } | |
1da177e4 LT |
366 | } |
367 | ||
708c1bbc MX |
368 | /* |
369 | * mpol_rebind_policy - Migrate a policy to a different set of nodes | |
370 | * | |
c1e8d7c6 | 371 | * Per-vma policies are protected by mmap_lock. Allocations using per-task |
213980c0 VB |
372 | * policies are protected by task->mems_allowed_seq to prevent a premature |
373 | * OOM/allocation failure due to parallel nodemask modification. | |
708c1bbc | 374 | */ |
213980c0 | 375 | static void mpol_rebind_policy(struct mempolicy *pol, const nodemask_t *newmask) |
1d0d2680 | 376 | { |
1d0d2680 DR |
377 | if (!pol) |
378 | return; | |
2e25644e | 379 | if (!mpol_store_user_nodemask(pol) && !(pol->flags & MPOL_F_LOCAL) && |
1d0d2680 DR |
380 | nodes_equal(pol->w.cpuset_mems_allowed, *newmask)) |
381 | return; | |
708c1bbc | 382 | |
213980c0 | 383 | mpol_ops[pol->mode].rebind(pol, newmask); |
1d0d2680 DR |
384 | } |
385 | ||
386 | /* | |
387 | * Wrapper for mpol_rebind_policy() that just requires task | |
388 | * pointer, and updates task mempolicy. | |
58568d2a MX |
389 | * |
390 | * Called with task's alloc_lock held. | |
1d0d2680 DR |
391 | */ |
392 | ||
213980c0 | 393 | void mpol_rebind_task(struct task_struct *tsk, const nodemask_t *new) |
1d0d2680 | 394 | { |
213980c0 | 395 | mpol_rebind_policy(tsk->mempolicy, new); |
1d0d2680 DR |
396 | } |
397 | ||
398 | /* | |
399 | * Rebind each vma in mm to new nodemask. | |
400 | * | |
c1e8d7c6 | 401 | * Call holding a reference to mm. Takes mm->mmap_lock during call. |
1d0d2680 DR |
402 | */ |
403 | ||
404 | void mpol_rebind_mm(struct mm_struct *mm, nodemask_t *new) | |
405 | { | |
406 | struct vm_area_struct *vma; | |
407 | ||
d8ed45c5 | 408 | mmap_write_lock(mm); |
1d0d2680 | 409 | for (vma = mm->mmap; vma; vma = vma->vm_next) |
213980c0 | 410 | mpol_rebind_policy(vma->vm_policy, new); |
d8ed45c5 | 411 | mmap_write_unlock(mm); |
1d0d2680 DR |
412 | } |
413 | ||
37012946 DR |
414 | static const struct mempolicy_operations mpol_ops[MPOL_MAX] = { |
415 | [MPOL_DEFAULT] = { | |
416 | .rebind = mpol_rebind_default, | |
417 | }, | |
418 | [MPOL_INTERLEAVE] = { | |
419 | .create = mpol_new_interleave, | |
420 | .rebind = mpol_rebind_nodemask, | |
421 | }, | |
422 | [MPOL_PREFERRED] = { | |
423 | .create = mpol_new_preferred, | |
424 | .rebind = mpol_rebind_preferred, | |
425 | }, | |
426 | [MPOL_BIND] = { | |
427 | .create = mpol_new_bind, | |
428 | .rebind = mpol_rebind_nodemask, | |
429 | }, | |
430 | }; | |
431 | ||
a53190a4 | 432 | static int migrate_page_add(struct page *page, struct list_head *pagelist, |
fc301289 | 433 | unsigned long flags); |
1a75a6c8 | 434 | |
6f4576e3 NH |
435 | struct queue_pages { |
436 | struct list_head *pagelist; | |
437 | unsigned long flags; | |
438 | nodemask_t *nmask; | |
f18da660 LX |
439 | unsigned long start; |
440 | unsigned long end; | |
441 | struct vm_area_struct *first; | |
6f4576e3 NH |
442 | }; |
443 | ||
88aaa2a1 NH |
444 | /* |
445 | * Check if the page's nid is in qp->nmask. | |
446 | * | |
447 | * If MPOL_MF_INVERT is set in qp->flags, check if the nid is | |
448 | * in the invert of qp->nmask. | |
449 | */ | |
450 | static inline bool queue_pages_required(struct page *page, | |
451 | struct queue_pages *qp) | |
452 | { | |
453 | int nid = page_to_nid(page); | |
454 | unsigned long flags = qp->flags; | |
455 | ||
456 | return node_isset(nid, *qp->nmask) == !(flags & MPOL_MF_INVERT); | |
457 | } | |
458 | ||
a7f40cfe | 459 | /* |
d8835445 YS |
460 | * queue_pages_pmd() has four possible return values: |
461 | * 0 - pages are placed on the right node or queued successfully. | |
462 | * 1 - there is unmovable page, and MPOL_MF_MOVE* & MPOL_MF_STRICT were | |
463 | * specified. | |
464 | * 2 - THP was split. | |
465 | * -EIO - is migration entry or only MPOL_MF_STRICT was specified and an | |
466 | * existing page was already on a node that does not follow the | |
467 | * policy. | |
a7f40cfe | 468 | */ |
c8633798 NH |
469 | static int queue_pages_pmd(pmd_t *pmd, spinlock_t *ptl, unsigned long addr, |
470 | unsigned long end, struct mm_walk *walk) | |
959a7e13 | 471 | __releases(ptl) |
c8633798 NH |
472 | { |
473 | int ret = 0; | |
474 | struct page *page; | |
475 | struct queue_pages *qp = walk->private; | |
476 | unsigned long flags; | |
477 | ||
478 | if (unlikely(is_pmd_migration_entry(*pmd))) { | |
a7f40cfe | 479 | ret = -EIO; |
c8633798 NH |
480 | goto unlock; |
481 | } | |
482 | page = pmd_page(*pmd); | |
483 | if (is_huge_zero_page(page)) { | |
484 | spin_unlock(ptl); | |
485 | __split_huge_pmd(walk->vma, pmd, addr, false, NULL); | |
d8835445 | 486 | ret = 2; |
c8633798 NH |
487 | goto out; |
488 | } | |
d8835445 | 489 | if (!queue_pages_required(page, qp)) |
c8633798 | 490 | goto unlock; |
c8633798 | 491 | |
c8633798 NH |
492 | flags = qp->flags; |
493 | /* go to thp migration */ | |
a7f40cfe | 494 | if (flags & (MPOL_MF_MOVE | MPOL_MF_MOVE_ALL)) { |
a53190a4 YS |
495 | if (!vma_migratable(walk->vma) || |
496 | migrate_page_add(page, qp->pagelist, flags)) { | |
d8835445 | 497 | ret = 1; |
a7f40cfe YS |
498 | goto unlock; |
499 | } | |
a7f40cfe YS |
500 | } else |
501 | ret = -EIO; | |
c8633798 NH |
502 | unlock: |
503 | spin_unlock(ptl); | |
504 | out: | |
505 | return ret; | |
506 | } | |
507 | ||
98094945 NH |
508 | /* |
509 | * Scan through pages checking if pages follow certain conditions, | |
510 | * and move them to the pagelist if they do. | |
d8835445 YS |
511 | * |
512 | * queue_pages_pte_range() has three possible return values: | |
513 | * 0 - pages are placed on the right node or queued successfully. | |
514 | * 1 - there is unmovable page, and MPOL_MF_MOVE* & MPOL_MF_STRICT were | |
515 | * specified. | |
516 | * -EIO - only MPOL_MF_STRICT was specified and an existing page was already | |
517 | * on a node that does not follow the policy. | |
98094945 | 518 | */ |
6f4576e3 NH |
519 | static int queue_pages_pte_range(pmd_t *pmd, unsigned long addr, |
520 | unsigned long end, struct mm_walk *walk) | |
1da177e4 | 521 | { |
6f4576e3 NH |
522 | struct vm_area_struct *vma = walk->vma; |
523 | struct page *page; | |
524 | struct queue_pages *qp = walk->private; | |
525 | unsigned long flags = qp->flags; | |
c8633798 | 526 | int ret; |
d8835445 | 527 | bool has_unmovable = false; |
91612e0d | 528 | pte_t *pte; |
705e87c0 | 529 | spinlock_t *ptl; |
941150a3 | 530 | |
c8633798 NH |
531 | ptl = pmd_trans_huge_lock(pmd, vma); |
532 | if (ptl) { | |
533 | ret = queue_pages_pmd(pmd, ptl, addr, end, walk); | |
d8835445 | 534 | if (ret != 2) |
a7f40cfe | 535 | return ret; |
248db92d | 536 | } |
d8835445 | 537 | /* THP was split, fall through to pte walk */ |
91612e0d | 538 | |
337d9abf NH |
539 | if (pmd_trans_unstable(pmd)) |
540 | return 0; | |
94723aaf | 541 | |
6f4576e3 NH |
542 | pte = pte_offset_map_lock(walk->mm, pmd, addr, &ptl); |
543 | for (; addr != end; pte++, addr += PAGE_SIZE) { | |
91612e0d | 544 | if (!pte_present(*pte)) |
1da177e4 | 545 | continue; |
6aab341e LT |
546 | page = vm_normal_page(vma, addr, *pte); |
547 | if (!page) | |
1da177e4 | 548 | continue; |
053837fc | 549 | /* |
62b61f61 HD |
550 | * vm_normal_page() filters out zero pages, but there might |
551 | * still be PageReserved pages to skip, perhaps in a VDSO. | |
053837fc | 552 | */ |
b79bc0a0 | 553 | if (PageReserved(page)) |
f4598c8b | 554 | continue; |
88aaa2a1 | 555 | if (!queue_pages_required(page, qp)) |
38e35860 | 556 | continue; |
a7f40cfe | 557 | if (flags & (MPOL_MF_MOVE | MPOL_MF_MOVE_ALL)) { |
d8835445 YS |
558 | /* MPOL_MF_STRICT must be specified if we get here */ |
559 | if (!vma_migratable(vma)) { | |
560 | has_unmovable = true; | |
a7f40cfe | 561 | break; |
d8835445 | 562 | } |
a53190a4 YS |
563 | |
564 | /* | |
565 | * Do not abort immediately since there may be | |
566 | * temporary off LRU pages in the range. Still | |
567 | * need migrate other LRU pages. | |
568 | */ | |
569 | if (migrate_page_add(page, qp->pagelist, flags)) | |
570 | has_unmovable = true; | |
a7f40cfe YS |
571 | } else |
572 | break; | |
6f4576e3 NH |
573 | } |
574 | pte_unmap_unlock(pte - 1, ptl); | |
575 | cond_resched(); | |
d8835445 YS |
576 | |
577 | if (has_unmovable) | |
578 | return 1; | |
579 | ||
a7f40cfe | 580 | return addr != end ? -EIO : 0; |
91612e0d HD |
581 | } |
582 | ||
6f4576e3 NH |
583 | static int queue_pages_hugetlb(pte_t *pte, unsigned long hmask, |
584 | unsigned long addr, unsigned long end, | |
585 | struct mm_walk *walk) | |
e2d8cf40 | 586 | { |
dcf17635 | 587 | int ret = 0; |
e2d8cf40 | 588 | #ifdef CONFIG_HUGETLB_PAGE |
6f4576e3 | 589 | struct queue_pages *qp = walk->private; |
dcf17635 | 590 | unsigned long flags = (qp->flags & MPOL_MF_VALID); |
e2d8cf40 | 591 | struct page *page; |
cb900f41 | 592 | spinlock_t *ptl; |
d4c54919 | 593 | pte_t entry; |
e2d8cf40 | 594 | |
6f4576e3 NH |
595 | ptl = huge_pte_lock(hstate_vma(walk->vma), walk->mm, pte); |
596 | entry = huge_ptep_get(pte); | |
d4c54919 NH |
597 | if (!pte_present(entry)) |
598 | goto unlock; | |
599 | page = pte_page(entry); | |
88aaa2a1 | 600 | if (!queue_pages_required(page, qp)) |
e2d8cf40 | 601 | goto unlock; |
dcf17635 LX |
602 | |
603 | if (flags == MPOL_MF_STRICT) { | |
604 | /* | |
605 | * STRICT alone means only detecting misplaced page and no | |
606 | * need to further check other vma. | |
607 | */ | |
608 | ret = -EIO; | |
609 | goto unlock; | |
610 | } | |
611 | ||
612 | if (!vma_migratable(walk->vma)) { | |
613 | /* | |
614 | * Must be STRICT with MOVE*, otherwise .test_walk() have | |
615 | * stopped walking current vma. | |
616 | * Detecting misplaced page but allow migrating pages which | |
617 | * have been queued. | |
618 | */ | |
619 | ret = 1; | |
620 | goto unlock; | |
621 | } | |
622 | ||
e2d8cf40 NH |
623 | /* With MPOL_MF_MOVE, we migrate only unshared hugepage. */ |
624 | if (flags & (MPOL_MF_MOVE_ALL) || | |
dcf17635 LX |
625 | (flags & MPOL_MF_MOVE && page_mapcount(page) == 1)) { |
626 | if (!isolate_huge_page(page, qp->pagelist) && | |
627 | (flags & MPOL_MF_STRICT)) | |
628 | /* | |
629 | * Failed to isolate page but allow migrating pages | |
630 | * which have been queued. | |
631 | */ | |
632 | ret = 1; | |
633 | } | |
e2d8cf40 | 634 | unlock: |
cb900f41 | 635 | spin_unlock(ptl); |
e2d8cf40 NH |
636 | #else |
637 | BUG(); | |
638 | #endif | |
dcf17635 | 639 | return ret; |
1da177e4 LT |
640 | } |
641 | ||
5877231f | 642 | #ifdef CONFIG_NUMA_BALANCING |
b24f53a0 | 643 | /* |
4b10e7d5 MG |
644 | * This is used to mark a range of virtual addresses to be inaccessible. |
645 | * These are later cleared by a NUMA hinting fault. Depending on these | |
646 | * faults, pages may be migrated for better NUMA placement. | |
647 | * | |
648 | * This is assuming that NUMA faults are handled using PROT_NONE. If | |
649 | * an architecture makes a different choice, it will need further | |
650 | * changes to the core. | |
b24f53a0 | 651 | */ |
4b10e7d5 MG |
652 | unsigned long change_prot_numa(struct vm_area_struct *vma, |
653 | unsigned long addr, unsigned long end) | |
b24f53a0 | 654 | { |
4b10e7d5 | 655 | int nr_updated; |
b24f53a0 | 656 | |
58705444 | 657 | nr_updated = change_protection(vma, addr, end, PAGE_NONE, MM_CP_PROT_NUMA); |
03c5a6e1 MG |
658 | if (nr_updated) |
659 | count_vm_numa_events(NUMA_PTE_UPDATES, nr_updated); | |
b24f53a0 | 660 | |
4b10e7d5 | 661 | return nr_updated; |
b24f53a0 LS |
662 | } |
663 | #else | |
664 | static unsigned long change_prot_numa(struct vm_area_struct *vma, | |
665 | unsigned long addr, unsigned long end) | |
666 | { | |
667 | return 0; | |
668 | } | |
5877231f | 669 | #endif /* CONFIG_NUMA_BALANCING */ |
b24f53a0 | 670 | |
6f4576e3 NH |
671 | static int queue_pages_test_walk(unsigned long start, unsigned long end, |
672 | struct mm_walk *walk) | |
673 | { | |
674 | struct vm_area_struct *vma = walk->vma; | |
675 | struct queue_pages *qp = walk->private; | |
676 | unsigned long endvma = vma->vm_end; | |
677 | unsigned long flags = qp->flags; | |
678 | ||
a18b3ac2 | 679 | /* range check first */ |
d888fb2b | 680 | VM_BUG_ON_VMA((vma->vm_start > start) || (vma->vm_end < end), vma); |
f18da660 LX |
681 | |
682 | if (!qp->first) { | |
683 | qp->first = vma; | |
684 | if (!(flags & MPOL_MF_DISCONTIG_OK) && | |
685 | (qp->start < vma->vm_start)) | |
686 | /* hole at head side of range */ | |
a18b3ac2 LX |
687 | return -EFAULT; |
688 | } | |
f18da660 LX |
689 | if (!(flags & MPOL_MF_DISCONTIG_OK) && |
690 | ((vma->vm_end < qp->end) && | |
691 | (!vma->vm_next || vma->vm_end < vma->vm_next->vm_start))) | |
692 | /* hole at middle or tail of range */ | |
693 | return -EFAULT; | |
a18b3ac2 | 694 | |
a7f40cfe YS |
695 | /* |
696 | * Need check MPOL_MF_STRICT to return -EIO if possible | |
697 | * regardless of vma_migratable | |
698 | */ | |
699 | if (!vma_migratable(vma) && | |
700 | !(flags & MPOL_MF_STRICT)) | |
48684a65 NH |
701 | return 1; |
702 | ||
6f4576e3 NH |
703 | if (endvma > end) |
704 | endvma = end; | |
6f4576e3 | 705 | |
6f4576e3 NH |
706 | if (flags & MPOL_MF_LAZY) { |
707 | /* Similar to task_numa_work, skip inaccessible VMAs */ | |
3122e80e | 708 | if (!is_vm_hugetlb_page(vma) && vma_is_accessible(vma) && |
4355c018 | 709 | !(vma->vm_flags & VM_MIXEDMAP)) |
6f4576e3 NH |
710 | change_prot_numa(vma, start, endvma); |
711 | return 1; | |
712 | } | |
713 | ||
77bf45e7 | 714 | /* queue pages from current vma */ |
a7f40cfe | 715 | if (flags & MPOL_MF_VALID) |
6f4576e3 NH |
716 | return 0; |
717 | return 1; | |
718 | } | |
719 | ||
7b86ac33 CH |
720 | static const struct mm_walk_ops queue_pages_walk_ops = { |
721 | .hugetlb_entry = queue_pages_hugetlb, | |
722 | .pmd_entry = queue_pages_pte_range, | |
723 | .test_walk = queue_pages_test_walk, | |
724 | }; | |
725 | ||
dc9aa5b9 | 726 | /* |
98094945 NH |
727 | * Walk through page tables and collect pages to be migrated. |
728 | * | |
729 | * If pages found in a given range are on a set of nodes (determined by | |
730 | * @nodes and @flags,) it's isolated and queued to the pagelist which is | |
d8835445 YS |
731 | * passed via @private. |
732 | * | |
733 | * queue_pages_range() has three possible return values: | |
734 | * 1 - there is unmovable page, but MPOL_MF_MOVE* & MPOL_MF_STRICT were | |
735 | * specified. | |
736 | * 0 - queue pages successfully or no misplaced page. | |
a85dfc30 YS |
737 | * errno - i.e. misplaced pages with MPOL_MF_STRICT specified (-EIO) or |
738 | * memory range specified by nodemask and maxnode points outside | |
739 | * your accessible address space (-EFAULT) | |
dc9aa5b9 | 740 | */ |
d05f0cdc | 741 | static int |
98094945 | 742 | queue_pages_range(struct mm_struct *mm, unsigned long start, unsigned long end, |
6f4576e3 NH |
743 | nodemask_t *nodes, unsigned long flags, |
744 | struct list_head *pagelist) | |
1da177e4 | 745 | { |
f18da660 | 746 | int err; |
6f4576e3 NH |
747 | struct queue_pages qp = { |
748 | .pagelist = pagelist, | |
749 | .flags = flags, | |
750 | .nmask = nodes, | |
f18da660 LX |
751 | .start = start, |
752 | .end = end, | |
753 | .first = NULL, | |
6f4576e3 | 754 | }; |
6f4576e3 | 755 | |
f18da660 LX |
756 | err = walk_page_range(mm, start, end, &queue_pages_walk_ops, &qp); |
757 | ||
758 | if (!qp.first) | |
759 | /* whole range in hole */ | |
760 | err = -EFAULT; | |
761 | ||
762 | return err; | |
1da177e4 LT |
763 | } |
764 | ||
869833f2 KM |
765 | /* |
766 | * Apply policy to a single VMA | |
c1e8d7c6 | 767 | * This must be called with the mmap_lock held for writing. |
869833f2 KM |
768 | */ |
769 | static int vma_replace_policy(struct vm_area_struct *vma, | |
770 | struct mempolicy *pol) | |
8d34694c | 771 | { |
869833f2 KM |
772 | int err; |
773 | struct mempolicy *old; | |
774 | struct mempolicy *new; | |
8d34694c KM |
775 | |
776 | pr_debug("vma %lx-%lx/%lx vm_ops %p vm_file %p set_policy %p\n", | |
777 | vma->vm_start, vma->vm_end, vma->vm_pgoff, | |
778 | vma->vm_ops, vma->vm_file, | |
779 | vma->vm_ops ? vma->vm_ops->set_policy : NULL); | |
780 | ||
869833f2 KM |
781 | new = mpol_dup(pol); |
782 | if (IS_ERR(new)) | |
783 | return PTR_ERR(new); | |
784 | ||
785 | if (vma->vm_ops && vma->vm_ops->set_policy) { | |
8d34694c | 786 | err = vma->vm_ops->set_policy(vma, new); |
869833f2 KM |
787 | if (err) |
788 | goto err_out; | |
8d34694c | 789 | } |
869833f2 KM |
790 | |
791 | old = vma->vm_policy; | |
c1e8d7c6 | 792 | vma->vm_policy = new; /* protected by mmap_lock */ |
869833f2 KM |
793 | mpol_put(old); |
794 | ||
795 | return 0; | |
796 | err_out: | |
797 | mpol_put(new); | |
8d34694c KM |
798 | return err; |
799 | } | |
800 | ||
1da177e4 | 801 | /* Step 2: apply policy to a range and do splits. */ |
9d8cebd4 KM |
802 | static int mbind_range(struct mm_struct *mm, unsigned long start, |
803 | unsigned long end, struct mempolicy *new_pol) | |
1da177e4 LT |
804 | { |
805 | struct vm_area_struct *next; | |
9d8cebd4 KM |
806 | struct vm_area_struct *prev; |
807 | struct vm_area_struct *vma; | |
808 | int err = 0; | |
e26a5114 | 809 | pgoff_t pgoff; |
9d8cebd4 KM |
810 | unsigned long vmstart; |
811 | unsigned long vmend; | |
1da177e4 | 812 | |
097d5910 | 813 | vma = find_vma(mm, start); |
f18da660 | 814 | VM_BUG_ON(!vma); |
9d8cebd4 | 815 | |
097d5910 | 816 | prev = vma->vm_prev; |
e26a5114 KM |
817 | if (start > vma->vm_start) |
818 | prev = vma; | |
819 | ||
9d8cebd4 | 820 | for (; vma && vma->vm_start < end; prev = vma, vma = next) { |
1da177e4 | 821 | next = vma->vm_next; |
9d8cebd4 KM |
822 | vmstart = max(start, vma->vm_start); |
823 | vmend = min(end, vma->vm_end); | |
824 | ||
e26a5114 KM |
825 | if (mpol_equal(vma_policy(vma), new_pol)) |
826 | continue; | |
827 | ||
828 | pgoff = vma->vm_pgoff + | |
829 | ((vmstart - vma->vm_start) >> PAGE_SHIFT); | |
9d8cebd4 | 830 | prev = vma_merge(mm, prev, vmstart, vmend, vma->vm_flags, |
19a809af AA |
831 | vma->anon_vma, vma->vm_file, pgoff, |
832 | new_pol, vma->vm_userfaultfd_ctx); | |
9d8cebd4 KM |
833 | if (prev) { |
834 | vma = prev; | |
835 | next = vma->vm_next; | |
3964acd0 ON |
836 | if (mpol_equal(vma_policy(vma), new_pol)) |
837 | continue; | |
838 | /* vma_merge() joined vma && vma->next, case 8 */ | |
839 | goto replace; | |
9d8cebd4 KM |
840 | } |
841 | if (vma->vm_start != vmstart) { | |
842 | err = split_vma(vma->vm_mm, vma, vmstart, 1); | |
843 | if (err) | |
844 | goto out; | |
845 | } | |
846 | if (vma->vm_end != vmend) { | |
847 | err = split_vma(vma->vm_mm, vma, vmend, 0); | |
848 | if (err) | |
849 | goto out; | |
850 | } | |
3964acd0 | 851 | replace: |
869833f2 | 852 | err = vma_replace_policy(vma, new_pol); |
8d34694c KM |
853 | if (err) |
854 | goto out; | |
1da177e4 | 855 | } |
9d8cebd4 KM |
856 | |
857 | out: | |
1da177e4 LT |
858 | return err; |
859 | } | |
860 | ||
1da177e4 | 861 | /* Set the process memory policy */ |
028fec41 DR |
862 | static long do_set_mempolicy(unsigned short mode, unsigned short flags, |
863 | nodemask_t *nodes) | |
1da177e4 | 864 | { |
58568d2a | 865 | struct mempolicy *new, *old; |
4bfc4495 | 866 | NODEMASK_SCRATCH(scratch); |
58568d2a | 867 | int ret; |
1da177e4 | 868 | |
4bfc4495 KH |
869 | if (!scratch) |
870 | return -ENOMEM; | |
f4e53d91 | 871 | |
4bfc4495 KH |
872 | new = mpol_new(mode, flags, nodes); |
873 | if (IS_ERR(new)) { | |
874 | ret = PTR_ERR(new); | |
875 | goto out; | |
876 | } | |
2c7c3a7d | 877 | |
58568d2a | 878 | task_lock(current); |
4bfc4495 | 879 | ret = mpol_set_nodemask(new, nodes, scratch); |
58568d2a MX |
880 | if (ret) { |
881 | task_unlock(current); | |
58568d2a | 882 | mpol_put(new); |
4bfc4495 | 883 | goto out; |
58568d2a MX |
884 | } |
885 | old = current->mempolicy; | |
1da177e4 | 886 | current->mempolicy = new; |
45816682 VB |
887 | if (new && new->mode == MPOL_INTERLEAVE) |
888 | current->il_prev = MAX_NUMNODES-1; | |
58568d2a | 889 | task_unlock(current); |
58568d2a | 890 | mpol_put(old); |
4bfc4495 KH |
891 | ret = 0; |
892 | out: | |
893 | NODEMASK_SCRATCH_FREE(scratch); | |
894 | return ret; | |
1da177e4 LT |
895 | } |
896 | ||
bea904d5 LS |
897 | /* |
898 | * Return nodemask for policy for get_mempolicy() query | |
58568d2a MX |
899 | * |
900 | * Called with task's alloc_lock held | |
bea904d5 LS |
901 | */ |
902 | static void get_policy_nodemask(struct mempolicy *p, nodemask_t *nodes) | |
1da177e4 | 903 | { |
dfcd3c0d | 904 | nodes_clear(*nodes); |
bea904d5 LS |
905 | if (p == &default_policy) |
906 | return; | |
907 | ||
45c4745a | 908 | switch (p->mode) { |
19770b32 | 909 | case MPOL_BIND: |
1da177e4 | 910 | case MPOL_INTERLEAVE: |
dfcd3c0d | 911 | *nodes = p->v.nodes; |
1da177e4 LT |
912 | break; |
913 | case MPOL_PREFERRED: | |
fc36b8d3 | 914 | if (!(p->flags & MPOL_F_LOCAL)) |
dfcd3c0d | 915 | node_set(p->v.preferred_node, *nodes); |
53f2556b | 916 | /* else return empty node mask for local allocation */ |
1da177e4 LT |
917 | break; |
918 | default: | |
919 | BUG(); | |
920 | } | |
921 | } | |
922 | ||
3b9aadf7 | 923 | static int lookup_node(struct mm_struct *mm, unsigned long addr) |
1da177e4 | 924 | { |
ba841078 | 925 | struct page *p = NULL; |
1da177e4 LT |
926 | int err; |
927 | ||
3b9aadf7 AA |
928 | int locked = 1; |
929 | err = get_user_pages_locked(addr & PAGE_MASK, 1, 0, &p, &locked); | |
2d3a36a4 | 930 | if (err > 0) { |
1da177e4 LT |
931 | err = page_to_nid(p); |
932 | put_page(p); | |
933 | } | |
3b9aadf7 | 934 | if (locked) |
d8ed45c5 | 935 | mmap_read_unlock(mm); |
1da177e4 LT |
936 | return err; |
937 | } | |
938 | ||
1da177e4 | 939 | /* Retrieve NUMA policy */ |
dbcb0f19 AB |
940 | static long do_get_mempolicy(int *policy, nodemask_t *nmask, |
941 | unsigned long addr, unsigned long flags) | |
1da177e4 | 942 | { |
8bccd85f | 943 | int err; |
1da177e4 LT |
944 | struct mm_struct *mm = current->mm; |
945 | struct vm_area_struct *vma = NULL; | |
3b9aadf7 | 946 | struct mempolicy *pol = current->mempolicy, *pol_refcount = NULL; |
1da177e4 | 947 | |
754af6f5 LS |
948 | if (flags & |
949 | ~(unsigned long)(MPOL_F_NODE|MPOL_F_ADDR|MPOL_F_MEMS_ALLOWED)) | |
1da177e4 | 950 | return -EINVAL; |
754af6f5 LS |
951 | |
952 | if (flags & MPOL_F_MEMS_ALLOWED) { | |
953 | if (flags & (MPOL_F_NODE|MPOL_F_ADDR)) | |
954 | return -EINVAL; | |
955 | *policy = 0; /* just so it's initialized */ | |
58568d2a | 956 | task_lock(current); |
754af6f5 | 957 | *nmask = cpuset_current_mems_allowed; |
58568d2a | 958 | task_unlock(current); |
754af6f5 LS |
959 | return 0; |
960 | } | |
961 | ||
1da177e4 | 962 | if (flags & MPOL_F_ADDR) { |
bea904d5 LS |
963 | /* |
964 | * Do NOT fall back to task policy if the | |
965 | * vma/shared policy at addr is NULL. We | |
966 | * want to return MPOL_DEFAULT in this case. | |
967 | */ | |
d8ed45c5 | 968 | mmap_read_lock(mm); |
1da177e4 LT |
969 | vma = find_vma_intersection(mm, addr, addr+1); |
970 | if (!vma) { | |
d8ed45c5 | 971 | mmap_read_unlock(mm); |
1da177e4 LT |
972 | return -EFAULT; |
973 | } | |
974 | if (vma->vm_ops && vma->vm_ops->get_policy) | |
975 | pol = vma->vm_ops->get_policy(vma, addr); | |
976 | else | |
977 | pol = vma->vm_policy; | |
978 | } else if (addr) | |
979 | return -EINVAL; | |
980 | ||
981 | if (!pol) | |
bea904d5 | 982 | pol = &default_policy; /* indicates default behavior */ |
1da177e4 LT |
983 | |
984 | if (flags & MPOL_F_NODE) { | |
985 | if (flags & MPOL_F_ADDR) { | |
3b9aadf7 AA |
986 | /* |
987 | * Take a refcount on the mpol, lookup_node() | |
c1e8d7c6 | 988 | * wil drop the mmap_lock, so after calling |
3b9aadf7 AA |
989 | * lookup_node() only "pol" remains valid, "vma" |
990 | * is stale. | |
991 | */ | |
992 | pol_refcount = pol; | |
993 | vma = NULL; | |
994 | mpol_get(pol); | |
995 | err = lookup_node(mm, addr); | |
1da177e4 LT |
996 | if (err < 0) |
997 | goto out; | |
8bccd85f | 998 | *policy = err; |
1da177e4 | 999 | } else if (pol == current->mempolicy && |
45c4745a | 1000 | pol->mode == MPOL_INTERLEAVE) { |
45816682 | 1001 | *policy = next_node_in(current->il_prev, pol->v.nodes); |
1da177e4 LT |
1002 | } else { |
1003 | err = -EINVAL; | |
1004 | goto out; | |
1005 | } | |
bea904d5 LS |
1006 | } else { |
1007 | *policy = pol == &default_policy ? MPOL_DEFAULT : | |
1008 | pol->mode; | |
d79df630 DR |
1009 | /* |
1010 | * Internal mempolicy flags must be masked off before exposing | |
1011 | * the policy to userspace. | |
1012 | */ | |
1013 | *policy |= (pol->flags & MPOL_MODE_FLAGS); | |
bea904d5 | 1014 | } |
1da177e4 | 1015 | |
1da177e4 | 1016 | err = 0; |
58568d2a | 1017 | if (nmask) { |
c6b6ef8b LS |
1018 | if (mpol_store_user_nodemask(pol)) { |
1019 | *nmask = pol->w.user_nodemask; | |
1020 | } else { | |
1021 | task_lock(current); | |
1022 | get_policy_nodemask(pol, nmask); | |
1023 | task_unlock(current); | |
1024 | } | |
58568d2a | 1025 | } |
1da177e4 LT |
1026 | |
1027 | out: | |
52cd3b07 | 1028 | mpol_cond_put(pol); |
1da177e4 | 1029 | if (vma) |
d8ed45c5 | 1030 | mmap_read_unlock(mm); |
3b9aadf7 AA |
1031 | if (pol_refcount) |
1032 | mpol_put(pol_refcount); | |
1da177e4 LT |
1033 | return err; |
1034 | } | |
1035 | ||
b20a3503 | 1036 | #ifdef CONFIG_MIGRATION |
6ce3c4c0 | 1037 | /* |
c8633798 | 1038 | * page migration, thp tail pages can be passed. |
6ce3c4c0 | 1039 | */ |
a53190a4 | 1040 | static int migrate_page_add(struct page *page, struct list_head *pagelist, |
fc301289 | 1041 | unsigned long flags) |
6ce3c4c0 | 1042 | { |
c8633798 | 1043 | struct page *head = compound_head(page); |
6ce3c4c0 | 1044 | /* |
fc301289 | 1045 | * Avoid migrating a page that is shared with others. |
6ce3c4c0 | 1046 | */ |
c8633798 NH |
1047 | if ((flags & MPOL_MF_MOVE_ALL) || page_mapcount(head) == 1) { |
1048 | if (!isolate_lru_page(head)) { | |
1049 | list_add_tail(&head->lru, pagelist); | |
1050 | mod_node_page_state(page_pgdat(head), | |
9de4f22a | 1051 | NR_ISOLATED_ANON + page_is_file_lru(head), |
c8633798 | 1052 | hpage_nr_pages(head)); |
a53190a4 YS |
1053 | } else if (flags & MPOL_MF_STRICT) { |
1054 | /* | |
1055 | * Non-movable page may reach here. And, there may be | |
1056 | * temporary off LRU pages or non-LRU movable pages. | |
1057 | * Treat them as unmovable pages since they can't be | |
1058 | * isolated, so they can't be moved at the moment. It | |
1059 | * should return -EIO for this case too. | |
1060 | */ | |
1061 | return -EIO; | |
62695a84 NP |
1062 | } |
1063 | } | |
a53190a4 YS |
1064 | |
1065 | return 0; | |
7e2ab150 | 1066 | } |
6ce3c4c0 | 1067 | |
a49bd4d7 | 1068 | /* page allocation callback for NUMA node migration */ |
666feb21 | 1069 | struct page *alloc_new_node_page(struct page *page, unsigned long node) |
95a402c3 | 1070 | { |
e2d8cf40 NH |
1071 | if (PageHuge(page)) |
1072 | return alloc_huge_page_node(page_hstate(compound_head(page)), | |
1073 | node); | |
94723aaf | 1074 | else if (PageTransHuge(page)) { |
c8633798 NH |
1075 | struct page *thp; |
1076 | ||
1077 | thp = alloc_pages_node(node, | |
1078 | (GFP_TRANSHUGE | __GFP_THISNODE), | |
1079 | HPAGE_PMD_ORDER); | |
1080 | if (!thp) | |
1081 | return NULL; | |
1082 | prep_transhuge_page(thp); | |
1083 | return thp; | |
1084 | } else | |
96db800f | 1085 | return __alloc_pages_node(node, GFP_HIGHUSER_MOVABLE | |
b360edb4 | 1086 | __GFP_THISNODE, 0); |
95a402c3 CL |
1087 | } |
1088 | ||
7e2ab150 CL |
1089 | /* |
1090 | * Migrate pages from one node to a target node. | |
1091 | * Returns error or the number of pages not migrated. | |
1092 | */ | |
dbcb0f19 AB |
1093 | static int migrate_to_node(struct mm_struct *mm, int source, int dest, |
1094 | int flags) | |
7e2ab150 CL |
1095 | { |
1096 | nodemask_t nmask; | |
1097 | LIST_HEAD(pagelist); | |
1098 | int err = 0; | |
1099 | ||
1100 | nodes_clear(nmask); | |
1101 | node_set(source, nmask); | |
6ce3c4c0 | 1102 | |
08270807 MK |
1103 | /* |
1104 | * This does not "check" the range but isolates all pages that | |
1105 | * need migration. Between passing in the full user address | |
1106 | * space range and MPOL_MF_DISCONTIG_OK, this call can not fail. | |
1107 | */ | |
1108 | VM_BUG_ON(!(flags & (MPOL_MF_MOVE | MPOL_MF_MOVE_ALL))); | |
98094945 | 1109 | queue_pages_range(mm, mm->mmap->vm_start, mm->task_size, &nmask, |
7e2ab150 CL |
1110 | flags | MPOL_MF_DISCONTIG_OK, &pagelist); |
1111 | ||
cf608ac1 | 1112 | if (!list_empty(&pagelist)) { |
a49bd4d7 | 1113 | err = migrate_pages(&pagelist, alloc_new_node_page, NULL, dest, |
9c620e2b | 1114 | MIGRATE_SYNC, MR_SYSCALL); |
cf608ac1 | 1115 | if (err) |
e2d8cf40 | 1116 | putback_movable_pages(&pagelist); |
cf608ac1 | 1117 | } |
95a402c3 | 1118 | |
7e2ab150 | 1119 | return err; |
6ce3c4c0 CL |
1120 | } |
1121 | ||
39743889 | 1122 | /* |
7e2ab150 CL |
1123 | * Move pages between the two nodesets so as to preserve the physical |
1124 | * layout as much as possible. | |
39743889 CL |
1125 | * |
1126 | * Returns the number of page that could not be moved. | |
1127 | */ | |
0ce72d4f AM |
1128 | int do_migrate_pages(struct mm_struct *mm, const nodemask_t *from, |
1129 | const nodemask_t *to, int flags) | |
39743889 | 1130 | { |
7e2ab150 | 1131 | int busy = 0; |
0aedadf9 | 1132 | int err; |
7e2ab150 | 1133 | nodemask_t tmp; |
39743889 | 1134 | |
0aedadf9 CL |
1135 | err = migrate_prep(); |
1136 | if (err) | |
1137 | return err; | |
1138 | ||
d8ed45c5 | 1139 | mmap_read_lock(mm); |
39743889 | 1140 | |
da0aa138 KM |
1141 | /* |
1142 | * Find a 'source' bit set in 'tmp' whose corresponding 'dest' | |
1143 | * bit in 'to' is not also set in 'tmp'. Clear the found 'source' | |
1144 | * bit in 'tmp', and return that <source, dest> pair for migration. | |
1145 | * The pair of nodemasks 'to' and 'from' define the map. | |
1146 | * | |
1147 | * If no pair of bits is found that way, fallback to picking some | |
1148 | * pair of 'source' and 'dest' bits that are not the same. If the | |
1149 | * 'source' and 'dest' bits are the same, this represents a node | |
1150 | * that will be migrating to itself, so no pages need move. | |
1151 | * | |
1152 | * If no bits are left in 'tmp', or if all remaining bits left | |
1153 | * in 'tmp' correspond to the same bit in 'to', return false | |
1154 | * (nothing left to migrate). | |
1155 | * | |
1156 | * This lets us pick a pair of nodes to migrate between, such that | |
1157 | * if possible the dest node is not already occupied by some other | |
1158 | * source node, minimizing the risk of overloading the memory on a | |
1159 | * node that would happen if we migrated incoming memory to a node | |
1160 | * before migrating outgoing memory source that same node. | |
1161 | * | |
1162 | * A single scan of tmp is sufficient. As we go, we remember the | |
1163 | * most recent <s, d> pair that moved (s != d). If we find a pair | |
1164 | * that not only moved, but what's better, moved to an empty slot | |
1165 | * (d is not set in tmp), then we break out then, with that pair. | |
ae0e47f0 | 1166 | * Otherwise when we finish scanning from_tmp, we at least have the |
da0aa138 KM |
1167 | * most recent <s, d> pair that moved. If we get all the way through |
1168 | * the scan of tmp without finding any node that moved, much less | |
1169 | * moved to an empty node, then there is nothing left worth migrating. | |
1170 | */ | |
d4984711 | 1171 | |
0ce72d4f | 1172 | tmp = *from; |
7e2ab150 CL |
1173 | while (!nodes_empty(tmp)) { |
1174 | int s,d; | |
b76ac7e7 | 1175 | int source = NUMA_NO_NODE; |
7e2ab150 CL |
1176 | int dest = 0; |
1177 | ||
1178 | for_each_node_mask(s, tmp) { | |
4a5b18cc LW |
1179 | |
1180 | /* | |
1181 | * do_migrate_pages() tries to maintain the relative | |
1182 | * node relationship of the pages established between | |
1183 | * threads and memory areas. | |
1184 | * | |
1185 | * However if the number of source nodes is not equal to | |
1186 | * the number of destination nodes we can not preserve | |
1187 | * this node relative relationship. In that case, skip | |
1188 | * copying memory from a node that is in the destination | |
1189 | * mask. | |
1190 | * | |
1191 | * Example: [2,3,4] -> [3,4,5] moves everything. | |
1192 | * [0-7] - > [3,4,5] moves only 0,1,2,6,7. | |
1193 | */ | |
1194 | ||
0ce72d4f AM |
1195 | if ((nodes_weight(*from) != nodes_weight(*to)) && |
1196 | (node_isset(s, *to))) | |
4a5b18cc LW |
1197 | continue; |
1198 | ||
0ce72d4f | 1199 | d = node_remap(s, *from, *to); |
7e2ab150 CL |
1200 | if (s == d) |
1201 | continue; | |
1202 | ||
1203 | source = s; /* Node moved. Memorize */ | |
1204 | dest = d; | |
1205 | ||
1206 | /* dest not in remaining from nodes? */ | |
1207 | if (!node_isset(dest, tmp)) | |
1208 | break; | |
1209 | } | |
b76ac7e7 | 1210 | if (source == NUMA_NO_NODE) |
7e2ab150 CL |
1211 | break; |
1212 | ||
1213 | node_clear(source, tmp); | |
1214 | err = migrate_to_node(mm, source, dest, flags); | |
1215 | if (err > 0) | |
1216 | busy += err; | |
1217 | if (err < 0) | |
1218 | break; | |
39743889 | 1219 | } |
d8ed45c5 | 1220 | mmap_read_unlock(mm); |
7e2ab150 CL |
1221 | if (err < 0) |
1222 | return err; | |
1223 | return busy; | |
b20a3503 CL |
1224 | |
1225 | } | |
1226 | ||
3ad33b24 LS |
1227 | /* |
1228 | * Allocate a new page for page migration based on vma policy. | |
d05f0cdc | 1229 | * Start by assuming the page is mapped by the same vma as contains @start. |
3ad33b24 LS |
1230 | * Search forward from there, if not. N.B., this assumes that the |
1231 | * list of pages handed to migrate_pages()--which is how we get here-- | |
1232 | * is in virtual address order. | |
1233 | */ | |
666feb21 | 1234 | static struct page *new_page(struct page *page, unsigned long start) |
95a402c3 | 1235 | { |
d05f0cdc | 1236 | struct vm_area_struct *vma; |
3ad33b24 | 1237 | unsigned long uninitialized_var(address); |
95a402c3 | 1238 | |
d05f0cdc | 1239 | vma = find_vma(current->mm, start); |
3ad33b24 LS |
1240 | while (vma) { |
1241 | address = page_address_in_vma(page, vma); | |
1242 | if (address != -EFAULT) | |
1243 | break; | |
1244 | vma = vma->vm_next; | |
1245 | } | |
11c731e8 WL |
1246 | |
1247 | if (PageHuge(page)) { | |
389c8178 MH |
1248 | return alloc_huge_page_vma(page_hstate(compound_head(page)), |
1249 | vma, address); | |
94723aaf | 1250 | } else if (PageTransHuge(page)) { |
c8633798 NH |
1251 | struct page *thp; |
1252 | ||
19deb769 DR |
1253 | thp = alloc_hugepage_vma(GFP_TRANSHUGE, vma, address, |
1254 | HPAGE_PMD_ORDER); | |
c8633798 NH |
1255 | if (!thp) |
1256 | return NULL; | |
1257 | prep_transhuge_page(thp); | |
1258 | return thp; | |
11c731e8 | 1259 | } |
0bf598d8 | 1260 | /* |
11c731e8 | 1261 | * if !vma, alloc_page_vma() will use task or system default policy |
0bf598d8 | 1262 | */ |
0f556856 MH |
1263 | return alloc_page_vma(GFP_HIGHUSER_MOVABLE | __GFP_RETRY_MAYFAIL, |
1264 | vma, address); | |
95a402c3 | 1265 | } |
b20a3503 CL |
1266 | #else |
1267 | ||
a53190a4 | 1268 | static int migrate_page_add(struct page *page, struct list_head *pagelist, |
b20a3503 CL |
1269 | unsigned long flags) |
1270 | { | |
a53190a4 | 1271 | return -EIO; |
39743889 CL |
1272 | } |
1273 | ||
0ce72d4f AM |
1274 | int do_migrate_pages(struct mm_struct *mm, const nodemask_t *from, |
1275 | const nodemask_t *to, int flags) | |
b20a3503 CL |
1276 | { |
1277 | return -ENOSYS; | |
1278 | } | |
95a402c3 | 1279 | |
666feb21 | 1280 | static struct page *new_page(struct page *page, unsigned long start) |
95a402c3 CL |
1281 | { |
1282 | return NULL; | |
1283 | } | |
b20a3503 CL |
1284 | #endif |
1285 | ||
dbcb0f19 | 1286 | static long do_mbind(unsigned long start, unsigned long len, |
028fec41 DR |
1287 | unsigned short mode, unsigned short mode_flags, |
1288 | nodemask_t *nmask, unsigned long flags) | |
6ce3c4c0 | 1289 | { |
6ce3c4c0 CL |
1290 | struct mm_struct *mm = current->mm; |
1291 | struct mempolicy *new; | |
1292 | unsigned long end; | |
1293 | int err; | |
d8835445 | 1294 | int ret; |
6ce3c4c0 CL |
1295 | LIST_HEAD(pagelist); |
1296 | ||
b24f53a0 | 1297 | if (flags & ~(unsigned long)MPOL_MF_VALID) |
6ce3c4c0 | 1298 | return -EINVAL; |
74c00241 | 1299 | if ((flags & MPOL_MF_MOVE_ALL) && !capable(CAP_SYS_NICE)) |
6ce3c4c0 CL |
1300 | return -EPERM; |
1301 | ||
1302 | if (start & ~PAGE_MASK) | |
1303 | return -EINVAL; | |
1304 | ||
1305 | if (mode == MPOL_DEFAULT) | |
1306 | flags &= ~MPOL_MF_STRICT; | |
1307 | ||
1308 | len = (len + PAGE_SIZE - 1) & PAGE_MASK; | |
1309 | end = start + len; | |
1310 | ||
1311 | if (end < start) | |
1312 | return -EINVAL; | |
1313 | if (end == start) | |
1314 | return 0; | |
1315 | ||
028fec41 | 1316 | new = mpol_new(mode, mode_flags, nmask); |
6ce3c4c0 CL |
1317 | if (IS_ERR(new)) |
1318 | return PTR_ERR(new); | |
1319 | ||
b24f53a0 LS |
1320 | if (flags & MPOL_MF_LAZY) |
1321 | new->flags |= MPOL_F_MOF; | |
1322 | ||
6ce3c4c0 CL |
1323 | /* |
1324 | * If we are using the default policy then operation | |
1325 | * on discontinuous address spaces is okay after all | |
1326 | */ | |
1327 | if (!new) | |
1328 | flags |= MPOL_MF_DISCONTIG_OK; | |
1329 | ||
028fec41 DR |
1330 | pr_debug("mbind %lx-%lx mode:%d flags:%d nodes:%lx\n", |
1331 | start, start + len, mode, mode_flags, | |
00ef2d2f | 1332 | nmask ? nodes_addr(*nmask)[0] : NUMA_NO_NODE); |
6ce3c4c0 | 1333 | |
0aedadf9 CL |
1334 | if (flags & (MPOL_MF_MOVE | MPOL_MF_MOVE_ALL)) { |
1335 | ||
1336 | err = migrate_prep(); | |
1337 | if (err) | |
b05ca738 | 1338 | goto mpol_out; |
0aedadf9 | 1339 | } |
4bfc4495 KH |
1340 | { |
1341 | NODEMASK_SCRATCH(scratch); | |
1342 | if (scratch) { | |
d8ed45c5 | 1343 | mmap_write_lock(mm); |
4bfc4495 KH |
1344 | task_lock(current); |
1345 | err = mpol_set_nodemask(new, nmask, scratch); | |
1346 | task_unlock(current); | |
1347 | if (err) | |
d8ed45c5 | 1348 | mmap_write_unlock(mm); |
4bfc4495 KH |
1349 | } else |
1350 | err = -ENOMEM; | |
1351 | NODEMASK_SCRATCH_FREE(scratch); | |
1352 | } | |
b05ca738 KM |
1353 | if (err) |
1354 | goto mpol_out; | |
1355 | ||
d8835445 | 1356 | ret = queue_pages_range(mm, start, end, nmask, |
6ce3c4c0 | 1357 | flags | MPOL_MF_INVERT, &pagelist); |
d8835445 YS |
1358 | |
1359 | if (ret < 0) { | |
a85dfc30 | 1360 | err = ret; |
d8835445 YS |
1361 | goto up_out; |
1362 | } | |
1363 | ||
1364 | err = mbind_range(mm, start, end, new); | |
7e2ab150 | 1365 | |
b24f53a0 LS |
1366 | if (!err) { |
1367 | int nr_failed = 0; | |
1368 | ||
cf608ac1 | 1369 | if (!list_empty(&pagelist)) { |
b24f53a0 | 1370 | WARN_ON_ONCE(flags & MPOL_MF_LAZY); |
d05f0cdc HD |
1371 | nr_failed = migrate_pages(&pagelist, new_page, NULL, |
1372 | start, MIGRATE_SYNC, MR_MEMPOLICY_MBIND); | |
cf608ac1 | 1373 | if (nr_failed) |
74060e4d | 1374 | putback_movable_pages(&pagelist); |
cf608ac1 | 1375 | } |
6ce3c4c0 | 1376 | |
d8835445 | 1377 | if ((ret > 0) || (nr_failed && (flags & MPOL_MF_STRICT))) |
6ce3c4c0 | 1378 | err = -EIO; |
a85dfc30 | 1379 | } else { |
d8835445 | 1380 | up_out: |
a85dfc30 YS |
1381 | if (!list_empty(&pagelist)) |
1382 | putback_movable_pages(&pagelist); | |
1383 | } | |
1384 | ||
d8ed45c5 | 1385 | mmap_write_unlock(mm); |
d8835445 | 1386 | mpol_out: |
f0be3d32 | 1387 | mpol_put(new); |
6ce3c4c0 CL |
1388 | return err; |
1389 | } | |
1390 | ||
8bccd85f CL |
1391 | /* |
1392 | * User space interface with variable sized bitmaps for nodelists. | |
1393 | */ | |
1394 | ||
1395 | /* Copy a node mask from user space. */ | |
39743889 | 1396 | static int get_nodes(nodemask_t *nodes, const unsigned long __user *nmask, |
8bccd85f CL |
1397 | unsigned long maxnode) |
1398 | { | |
1399 | unsigned long k; | |
56521e7a | 1400 | unsigned long t; |
8bccd85f CL |
1401 | unsigned long nlongs; |
1402 | unsigned long endmask; | |
1403 | ||
1404 | --maxnode; | |
1405 | nodes_clear(*nodes); | |
1406 | if (maxnode == 0 || !nmask) | |
1407 | return 0; | |
a9c930ba | 1408 | if (maxnode > PAGE_SIZE*BITS_PER_BYTE) |
636f13c1 | 1409 | return -EINVAL; |
8bccd85f CL |
1410 | |
1411 | nlongs = BITS_TO_LONGS(maxnode); | |
1412 | if ((maxnode % BITS_PER_LONG) == 0) | |
1413 | endmask = ~0UL; | |
1414 | else | |
1415 | endmask = (1UL << (maxnode % BITS_PER_LONG)) - 1; | |
1416 | ||
56521e7a YX |
1417 | /* |
1418 | * When the user specified more nodes than supported just check | |
1419 | * if the non supported part is all zero. | |
1420 | * | |
1421 | * If maxnode have more longs than MAX_NUMNODES, check | |
1422 | * the bits in that area first. And then go through to | |
1423 | * check the rest bits which equal or bigger than MAX_NUMNODES. | |
1424 | * Otherwise, just check bits [MAX_NUMNODES, maxnode). | |
1425 | */ | |
8bccd85f | 1426 | if (nlongs > BITS_TO_LONGS(MAX_NUMNODES)) { |
8bccd85f | 1427 | for (k = BITS_TO_LONGS(MAX_NUMNODES); k < nlongs; k++) { |
8bccd85f CL |
1428 | if (get_user(t, nmask + k)) |
1429 | return -EFAULT; | |
1430 | if (k == nlongs - 1) { | |
1431 | if (t & endmask) | |
1432 | return -EINVAL; | |
1433 | } else if (t) | |
1434 | return -EINVAL; | |
1435 | } | |
1436 | nlongs = BITS_TO_LONGS(MAX_NUMNODES); | |
1437 | endmask = ~0UL; | |
1438 | } | |
1439 | ||
56521e7a YX |
1440 | if (maxnode > MAX_NUMNODES && MAX_NUMNODES % BITS_PER_LONG != 0) { |
1441 | unsigned long valid_mask = endmask; | |
1442 | ||
1443 | valid_mask &= ~((1UL << (MAX_NUMNODES % BITS_PER_LONG)) - 1); | |
1444 | if (get_user(t, nmask + nlongs - 1)) | |
1445 | return -EFAULT; | |
1446 | if (t & valid_mask) | |
1447 | return -EINVAL; | |
1448 | } | |
1449 | ||
8bccd85f CL |
1450 | if (copy_from_user(nodes_addr(*nodes), nmask, nlongs*sizeof(unsigned long))) |
1451 | return -EFAULT; | |
1452 | nodes_addr(*nodes)[nlongs-1] &= endmask; | |
1453 | return 0; | |
1454 | } | |
1455 | ||
1456 | /* Copy a kernel node mask to user space */ | |
1457 | static int copy_nodes_to_user(unsigned long __user *mask, unsigned long maxnode, | |
1458 | nodemask_t *nodes) | |
1459 | { | |
1460 | unsigned long copy = ALIGN(maxnode-1, 64) / 8; | |
050c17f2 | 1461 | unsigned int nbytes = BITS_TO_LONGS(nr_node_ids) * sizeof(long); |
8bccd85f CL |
1462 | |
1463 | if (copy > nbytes) { | |
1464 | if (copy > PAGE_SIZE) | |
1465 | return -EINVAL; | |
1466 | if (clear_user((char __user *)mask + nbytes, copy - nbytes)) | |
1467 | return -EFAULT; | |
1468 | copy = nbytes; | |
1469 | } | |
1470 | return copy_to_user(mask, nodes_addr(*nodes), copy) ? -EFAULT : 0; | |
1471 | } | |
1472 | ||
e7dc9ad6 DB |
1473 | static long kernel_mbind(unsigned long start, unsigned long len, |
1474 | unsigned long mode, const unsigned long __user *nmask, | |
1475 | unsigned long maxnode, unsigned int flags) | |
8bccd85f CL |
1476 | { |
1477 | nodemask_t nodes; | |
1478 | int err; | |
028fec41 | 1479 | unsigned short mode_flags; |
8bccd85f | 1480 | |
057d3389 | 1481 | start = untagged_addr(start); |
028fec41 DR |
1482 | mode_flags = mode & MPOL_MODE_FLAGS; |
1483 | mode &= ~MPOL_MODE_FLAGS; | |
a3b51e01 DR |
1484 | if (mode >= MPOL_MAX) |
1485 | return -EINVAL; | |
4c50bc01 DR |
1486 | if ((mode_flags & MPOL_F_STATIC_NODES) && |
1487 | (mode_flags & MPOL_F_RELATIVE_NODES)) | |
1488 | return -EINVAL; | |
8bccd85f CL |
1489 | err = get_nodes(&nodes, nmask, maxnode); |
1490 | if (err) | |
1491 | return err; | |
028fec41 | 1492 | return do_mbind(start, len, mode, mode_flags, &nodes, flags); |
8bccd85f CL |
1493 | } |
1494 | ||
e7dc9ad6 DB |
1495 | SYSCALL_DEFINE6(mbind, unsigned long, start, unsigned long, len, |
1496 | unsigned long, mode, const unsigned long __user *, nmask, | |
1497 | unsigned long, maxnode, unsigned int, flags) | |
1498 | { | |
1499 | return kernel_mbind(start, len, mode, nmask, maxnode, flags); | |
1500 | } | |
1501 | ||
8bccd85f | 1502 | /* Set the process memory policy */ |
af03c4ac DB |
1503 | static long kernel_set_mempolicy(int mode, const unsigned long __user *nmask, |
1504 | unsigned long maxnode) | |
8bccd85f CL |
1505 | { |
1506 | int err; | |
1507 | nodemask_t nodes; | |
028fec41 | 1508 | unsigned short flags; |
8bccd85f | 1509 | |
028fec41 DR |
1510 | flags = mode & MPOL_MODE_FLAGS; |
1511 | mode &= ~MPOL_MODE_FLAGS; | |
1512 | if ((unsigned int)mode >= MPOL_MAX) | |
8bccd85f | 1513 | return -EINVAL; |
4c50bc01 DR |
1514 | if ((flags & MPOL_F_STATIC_NODES) && (flags & MPOL_F_RELATIVE_NODES)) |
1515 | return -EINVAL; | |
8bccd85f CL |
1516 | err = get_nodes(&nodes, nmask, maxnode); |
1517 | if (err) | |
1518 | return err; | |
028fec41 | 1519 | return do_set_mempolicy(mode, flags, &nodes); |
8bccd85f CL |
1520 | } |
1521 | ||
af03c4ac DB |
1522 | SYSCALL_DEFINE3(set_mempolicy, int, mode, const unsigned long __user *, nmask, |
1523 | unsigned long, maxnode) | |
1524 | { | |
1525 | return kernel_set_mempolicy(mode, nmask, maxnode); | |
1526 | } | |
1527 | ||
b6e9b0ba DB |
1528 | static int kernel_migrate_pages(pid_t pid, unsigned long maxnode, |
1529 | const unsigned long __user *old_nodes, | |
1530 | const unsigned long __user *new_nodes) | |
39743889 | 1531 | { |
596d7cfa | 1532 | struct mm_struct *mm = NULL; |
39743889 | 1533 | struct task_struct *task; |
39743889 CL |
1534 | nodemask_t task_nodes; |
1535 | int err; | |
596d7cfa KM |
1536 | nodemask_t *old; |
1537 | nodemask_t *new; | |
1538 | NODEMASK_SCRATCH(scratch); | |
1539 | ||
1540 | if (!scratch) | |
1541 | return -ENOMEM; | |
39743889 | 1542 | |
596d7cfa KM |
1543 | old = &scratch->mask1; |
1544 | new = &scratch->mask2; | |
1545 | ||
1546 | err = get_nodes(old, old_nodes, maxnode); | |
39743889 | 1547 | if (err) |
596d7cfa | 1548 | goto out; |
39743889 | 1549 | |
596d7cfa | 1550 | err = get_nodes(new, new_nodes, maxnode); |
39743889 | 1551 | if (err) |
596d7cfa | 1552 | goto out; |
39743889 CL |
1553 | |
1554 | /* Find the mm_struct */ | |
55cfaa3c | 1555 | rcu_read_lock(); |
228ebcbe | 1556 | task = pid ? find_task_by_vpid(pid) : current; |
39743889 | 1557 | if (!task) { |
55cfaa3c | 1558 | rcu_read_unlock(); |
596d7cfa KM |
1559 | err = -ESRCH; |
1560 | goto out; | |
39743889 | 1561 | } |
3268c63e | 1562 | get_task_struct(task); |
39743889 | 1563 | |
596d7cfa | 1564 | err = -EINVAL; |
39743889 CL |
1565 | |
1566 | /* | |
31367466 OE |
1567 | * Check if this process has the right to modify the specified process. |
1568 | * Use the regular "ptrace_may_access()" checks. | |
39743889 | 1569 | */ |
31367466 | 1570 | if (!ptrace_may_access(task, PTRACE_MODE_READ_REALCREDS)) { |
c69e8d9c | 1571 | rcu_read_unlock(); |
39743889 | 1572 | err = -EPERM; |
3268c63e | 1573 | goto out_put; |
39743889 | 1574 | } |
c69e8d9c | 1575 | rcu_read_unlock(); |
39743889 CL |
1576 | |
1577 | task_nodes = cpuset_mems_allowed(task); | |
1578 | /* Is the user allowed to access the target nodes? */ | |
596d7cfa | 1579 | if (!nodes_subset(*new, task_nodes) && !capable(CAP_SYS_NICE)) { |
39743889 | 1580 | err = -EPERM; |
3268c63e | 1581 | goto out_put; |
39743889 CL |
1582 | } |
1583 | ||
0486a38b YX |
1584 | task_nodes = cpuset_mems_allowed(current); |
1585 | nodes_and(*new, *new, task_nodes); | |
1586 | if (nodes_empty(*new)) | |
1587 | goto out_put; | |
1588 | ||
86c3a764 DQ |
1589 | err = security_task_movememory(task); |
1590 | if (err) | |
3268c63e | 1591 | goto out_put; |
86c3a764 | 1592 | |
3268c63e CL |
1593 | mm = get_task_mm(task); |
1594 | put_task_struct(task); | |
f2a9ef88 SL |
1595 | |
1596 | if (!mm) { | |
3268c63e | 1597 | err = -EINVAL; |
f2a9ef88 SL |
1598 | goto out; |
1599 | } | |
1600 | ||
1601 | err = do_migrate_pages(mm, old, new, | |
1602 | capable(CAP_SYS_NICE) ? MPOL_MF_MOVE_ALL : MPOL_MF_MOVE); | |
3268c63e CL |
1603 | |
1604 | mmput(mm); | |
1605 | out: | |
596d7cfa KM |
1606 | NODEMASK_SCRATCH_FREE(scratch); |
1607 | ||
39743889 | 1608 | return err; |
3268c63e CL |
1609 | |
1610 | out_put: | |
1611 | put_task_struct(task); | |
1612 | goto out; | |
1613 | ||
39743889 CL |
1614 | } |
1615 | ||
b6e9b0ba DB |
1616 | SYSCALL_DEFINE4(migrate_pages, pid_t, pid, unsigned long, maxnode, |
1617 | const unsigned long __user *, old_nodes, | |
1618 | const unsigned long __user *, new_nodes) | |
1619 | { | |
1620 | return kernel_migrate_pages(pid, maxnode, old_nodes, new_nodes); | |
1621 | } | |
1622 | ||
39743889 | 1623 | |
8bccd85f | 1624 | /* Retrieve NUMA policy */ |
af03c4ac DB |
1625 | static int kernel_get_mempolicy(int __user *policy, |
1626 | unsigned long __user *nmask, | |
1627 | unsigned long maxnode, | |
1628 | unsigned long addr, | |
1629 | unsigned long flags) | |
8bccd85f | 1630 | { |
dbcb0f19 AB |
1631 | int err; |
1632 | int uninitialized_var(pval); | |
8bccd85f CL |
1633 | nodemask_t nodes; |
1634 | ||
057d3389 AK |
1635 | addr = untagged_addr(addr); |
1636 | ||
050c17f2 | 1637 | if (nmask != NULL && maxnode < nr_node_ids) |
8bccd85f CL |
1638 | return -EINVAL; |
1639 | ||
1640 | err = do_get_mempolicy(&pval, &nodes, addr, flags); | |
1641 | ||
1642 | if (err) | |
1643 | return err; | |
1644 | ||
1645 | if (policy && put_user(pval, policy)) | |
1646 | return -EFAULT; | |
1647 | ||
1648 | if (nmask) | |
1649 | err = copy_nodes_to_user(nmask, maxnode, &nodes); | |
1650 | ||
1651 | return err; | |
1652 | } | |
1653 | ||
af03c4ac DB |
1654 | SYSCALL_DEFINE5(get_mempolicy, int __user *, policy, |
1655 | unsigned long __user *, nmask, unsigned long, maxnode, | |
1656 | unsigned long, addr, unsigned long, flags) | |
1657 | { | |
1658 | return kernel_get_mempolicy(policy, nmask, maxnode, addr, flags); | |
1659 | } | |
1660 | ||
1da177e4 LT |
1661 | #ifdef CONFIG_COMPAT |
1662 | ||
c93e0f6c HC |
1663 | COMPAT_SYSCALL_DEFINE5(get_mempolicy, int __user *, policy, |
1664 | compat_ulong_t __user *, nmask, | |
1665 | compat_ulong_t, maxnode, | |
1666 | compat_ulong_t, addr, compat_ulong_t, flags) | |
1da177e4 LT |
1667 | { |
1668 | long err; | |
1669 | unsigned long __user *nm = NULL; | |
1670 | unsigned long nr_bits, alloc_size; | |
1671 | DECLARE_BITMAP(bm, MAX_NUMNODES); | |
1672 | ||
050c17f2 | 1673 | nr_bits = min_t(unsigned long, maxnode-1, nr_node_ids); |
1da177e4 LT |
1674 | alloc_size = ALIGN(nr_bits, BITS_PER_LONG) / 8; |
1675 | ||
1676 | if (nmask) | |
1677 | nm = compat_alloc_user_space(alloc_size); | |
1678 | ||
af03c4ac | 1679 | err = kernel_get_mempolicy(policy, nm, nr_bits+1, addr, flags); |
1da177e4 LT |
1680 | |
1681 | if (!err && nmask) { | |
2bbff6c7 KH |
1682 | unsigned long copy_size; |
1683 | copy_size = min_t(unsigned long, sizeof(bm), alloc_size); | |
1684 | err = copy_from_user(bm, nm, copy_size); | |
1da177e4 LT |
1685 | /* ensure entire bitmap is zeroed */ |
1686 | err |= clear_user(nmask, ALIGN(maxnode-1, 8) / 8); | |
1687 | err |= compat_put_bitmap(nmask, bm, nr_bits); | |
1688 | } | |
1689 | ||
1690 | return err; | |
1691 | } | |
1692 | ||
c93e0f6c HC |
1693 | COMPAT_SYSCALL_DEFINE3(set_mempolicy, int, mode, compat_ulong_t __user *, nmask, |
1694 | compat_ulong_t, maxnode) | |
1da177e4 | 1695 | { |
1da177e4 LT |
1696 | unsigned long __user *nm = NULL; |
1697 | unsigned long nr_bits, alloc_size; | |
1698 | DECLARE_BITMAP(bm, MAX_NUMNODES); | |
1699 | ||
1700 | nr_bits = min_t(unsigned long, maxnode-1, MAX_NUMNODES); | |
1701 | alloc_size = ALIGN(nr_bits, BITS_PER_LONG) / 8; | |
1702 | ||
1703 | if (nmask) { | |
cf01fb99 CS |
1704 | if (compat_get_bitmap(bm, nmask, nr_bits)) |
1705 | return -EFAULT; | |
1da177e4 | 1706 | nm = compat_alloc_user_space(alloc_size); |
cf01fb99 CS |
1707 | if (copy_to_user(nm, bm, alloc_size)) |
1708 | return -EFAULT; | |
1da177e4 LT |
1709 | } |
1710 | ||
af03c4ac | 1711 | return kernel_set_mempolicy(mode, nm, nr_bits+1); |
1da177e4 LT |
1712 | } |
1713 | ||
c93e0f6c HC |
1714 | COMPAT_SYSCALL_DEFINE6(mbind, compat_ulong_t, start, compat_ulong_t, len, |
1715 | compat_ulong_t, mode, compat_ulong_t __user *, nmask, | |
1716 | compat_ulong_t, maxnode, compat_ulong_t, flags) | |
1da177e4 | 1717 | { |
1da177e4 LT |
1718 | unsigned long __user *nm = NULL; |
1719 | unsigned long nr_bits, alloc_size; | |
dfcd3c0d | 1720 | nodemask_t bm; |
1da177e4 LT |
1721 | |
1722 | nr_bits = min_t(unsigned long, maxnode-1, MAX_NUMNODES); | |
1723 | alloc_size = ALIGN(nr_bits, BITS_PER_LONG) / 8; | |
1724 | ||
1725 | if (nmask) { | |
cf01fb99 CS |
1726 | if (compat_get_bitmap(nodes_addr(bm), nmask, nr_bits)) |
1727 | return -EFAULT; | |
1da177e4 | 1728 | nm = compat_alloc_user_space(alloc_size); |
cf01fb99 CS |
1729 | if (copy_to_user(nm, nodes_addr(bm), alloc_size)) |
1730 | return -EFAULT; | |
1da177e4 LT |
1731 | } |
1732 | ||
e7dc9ad6 | 1733 | return kernel_mbind(start, len, mode, nm, nr_bits+1, flags); |
1da177e4 LT |
1734 | } |
1735 | ||
b6e9b0ba DB |
1736 | COMPAT_SYSCALL_DEFINE4(migrate_pages, compat_pid_t, pid, |
1737 | compat_ulong_t, maxnode, | |
1738 | const compat_ulong_t __user *, old_nodes, | |
1739 | const compat_ulong_t __user *, new_nodes) | |
1740 | { | |
1741 | unsigned long __user *old = NULL; | |
1742 | unsigned long __user *new = NULL; | |
1743 | nodemask_t tmp_mask; | |
1744 | unsigned long nr_bits; | |
1745 | unsigned long size; | |
1746 | ||
1747 | nr_bits = min_t(unsigned long, maxnode - 1, MAX_NUMNODES); | |
1748 | size = ALIGN(nr_bits, BITS_PER_LONG) / 8; | |
1749 | if (old_nodes) { | |
1750 | if (compat_get_bitmap(nodes_addr(tmp_mask), old_nodes, nr_bits)) | |
1751 | return -EFAULT; | |
1752 | old = compat_alloc_user_space(new_nodes ? size * 2 : size); | |
1753 | if (new_nodes) | |
1754 | new = old + size / sizeof(unsigned long); | |
1755 | if (copy_to_user(old, nodes_addr(tmp_mask), size)) | |
1756 | return -EFAULT; | |
1757 | } | |
1758 | if (new_nodes) { | |
1759 | if (compat_get_bitmap(nodes_addr(tmp_mask), new_nodes, nr_bits)) | |
1760 | return -EFAULT; | |
1761 | if (new == NULL) | |
1762 | new = compat_alloc_user_space(size); | |
1763 | if (copy_to_user(new, nodes_addr(tmp_mask), size)) | |
1764 | return -EFAULT; | |
1765 | } | |
1766 | return kernel_migrate_pages(pid, nr_bits + 1, old, new); | |
1767 | } | |
1768 | ||
1769 | #endif /* CONFIG_COMPAT */ | |
1da177e4 | 1770 | |
20ca87f2 LX |
1771 | bool vma_migratable(struct vm_area_struct *vma) |
1772 | { | |
1773 | if (vma->vm_flags & (VM_IO | VM_PFNMAP)) | |
1774 | return false; | |
1775 | ||
1776 | /* | |
1777 | * DAX device mappings require predictable access latency, so avoid | |
1778 | * incurring periodic faults. | |
1779 | */ | |
1780 | if (vma_is_dax(vma)) | |
1781 | return false; | |
1782 | ||
1783 | if (is_vm_hugetlb_page(vma) && | |
1784 | !hugepage_migration_supported(hstate_vma(vma))) | |
1785 | return false; | |
1786 | ||
1787 | /* | |
1788 | * Migration allocates pages in the highest zone. If we cannot | |
1789 | * do so then migration (at least from node to node) is not | |
1790 | * possible. | |
1791 | */ | |
1792 | if (vma->vm_file && | |
1793 | gfp_zone(mapping_gfp_mask(vma->vm_file->f_mapping)) | |
1794 | < policy_zone) | |
1795 | return false; | |
1796 | return true; | |
1797 | } | |
1798 | ||
74d2c3a0 ON |
1799 | struct mempolicy *__get_vma_policy(struct vm_area_struct *vma, |
1800 | unsigned long addr) | |
1da177e4 | 1801 | { |
8d90274b | 1802 | struct mempolicy *pol = NULL; |
1da177e4 LT |
1803 | |
1804 | if (vma) { | |
480eccf9 | 1805 | if (vma->vm_ops && vma->vm_ops->get_policy) { |
8d90274b | 1806 | pol = vma->vm_ops->get_policy(vma, addr); |
00442ad0 | 1807 | } else if (vma->vm_policy) { |
1da177e4 | 1808 | pol = vma->vm_policy; |
00442ad0 MG |
1809 | |
1810 | /* | |
1811 | * shmem_alloc_page() passes MPOL_F_SHARED policy with | |
1812 | * a pseudo vma whose vma->vm_ops=NULL. Take a reference | |
1813 | * count on these policies which will be dropped by | |
1814 | * mpol_cond_put() later | |
1815 | */ | |
1816 | if (mpol_needs_cond_ref(pol)) | |
1817 | mpol_get(pol); | |
1818 | } | |
1da177e4 | 1819 | } |
f15ca78e | 1820 | |
74d2c3a0 ON |
1821 | return pol; |
1822 | } | |
1823 | ||
1824 | /* | |
dd6eecb9 | 1825 | * get_vma_policy(@vma, @addr) |
74d2c3a0 ON |
1826 | * @vma: virtual memory area whose policy is sought |
1827 | * @addr: address in @vma for shared policy lookup | |
1828 | * | |
1829 | * Returns effective policy for a VMA at specified address. | |
dd6eecb9 | 1830 | * Falls back to current->mempolicy or system default policy, as necessary. |
74d2c3a0 ON |
1831 | * Shared policies [those marked as MPOL_F_SHARED] require an extra reference |
1832 | * count--added by the get_policy() vm_op, as appropriate--to protect against | |
1833 | * freeing by another task. It is the caller's responsibility to free the | |
1834 | * extra reference for shared policies. | |
1835 | */ | |
ac79f78d | 1836 | static struct mempolicy *get_vma_policy(struct vm_area_struct *vma, |
dd6eecb9 | 1837 | unsigned long addr) |
74d2c3a0 ON |
1838 | { |
1839 | struct mempolicy *pol = __get_vma_policy(vma, addr); | |
1840 | ||
8d90274b | 1841 | if (!pol) |
dd6eecb9 | 1842 | pol = get_task_policy(current); |
8d90274b | 1843 | |
1da177e4 LT |
1844 | return pol; |
1845 | } | |
1846 | ||
6b6482bb | 1847 | bool vma_policy_mof(struct vm_area_struct *vma) |
fc314724 | 1848 | { |
6b6482bb | 1849 | struct mempolicy *pol; |
fc314724 | 1850 | |
6b6482bb ON |
1851 | if (vma->vm_ops && vma->vm_ops->get_policy) { |
1852 | bool ret = false; | |
fc314724 | 1853 | |
6b6482bb ON |
1854 | pol = vma->vm_ops->get_policy(vma, vma->vm_start); |
1855 | if (pol && (pol->flags & MPOL_F_MOF)) | |
1856 | ret = true; | |
1857 | mpol_cond_put(pol); | |
8d90274b | 1858 | |
6b6482bb | 1859 | return ret; |
fc314724 MG |
1860 | } |
1861 | ||
6b6482bb | 1862 | pol = vma->vm_policy; |
8d90274b | 1863 | if (!pol) |
6b6482bb | 1864 | pol = get_task_policy(current); |
8d90274b | 1865 | |
fc314724 MG |
1866 | return pol->flags & MPOL_F_MOF; |
1867 | } | |
1868 | ||
d3eb1570 LJ |
1869 | static int apply_policy_zone(struct mempolicy *policy, enum zone_type zone) |
1870 | { | |
1871 | enum zone_type dynamic_policy_zone = policy_zone; | |
1872 | ||
1873 | BUG_ON(dynamic_policy_zone == ZONE_MOVABLE); | |
1874 | ||
1875 | /* | |
1876 | * if policy->v.nodes has movable memory only, | |
1877 | * we apply policy when gfp_zone(gfp) = ZONE_MOVABLE only. | |
1878 | * | |
1879 | * policy->v.nodes is intersect with node_states[N_MEMORY]. | |
1880 | * so if the following test faile, it implies | |
1881 | * policy->v.nodes has movable memory only. | |
1882 | */ | |
1883 | if (!nodes_intersects(policy->v.nodes, node_states[N_HIGH_MEMORY])) | |
1884 | dynamic_policy_zone = ZONE_MOVABLE; | |
1885 | ||
1886 | return zone >= dynamic_policy_zone; | |
1887 | } | |
1888 | ||
52cd3b07 LS |
1889 | /* |
1890 | * Return a nodemask representing a mempolicy for filtering nodes for | |
1891 | * page allocation | |
1892 | */ | |
1893 | static nodemask_t *policy_nodemask(gfp_t gfp, struct mempolicy *policy) | |
19770b32 MG |
1894 | { |
1895 | /* Lower zones don't get a nodemask applied for MPOL_BIND */ | |
45c4745a | 1896 | if (unlikely(policy->mode == MPOL_BIND) && |
d3eb1570 | 1897 | apply_policy_zone(policy, gfp_zone(gfp)) && |
19770b32 MG |
1898 | cpuset_nodemask_valid_mems_allowed(&policy->v.nodes)) |
1899 | return &policy->v.nodes; | |
1900 | ||
1901 | return NULL; | |
1902 | } | |
1903 | ||
04ec6264 VB |
1904 | /* Return the node id preferred by the given mempolicy, or the given id */ |
1905 | static int policy_node(gfp_t gfp, struct mempolicy *policy, | |
1906 | int nd) | |
1da177e4 | 1907 | { |
6d840958 MH |
1908 | if (policy->mode == MPOL_PREFERRED && !(policy->flags & MPOL_F_LOCAL)) |
1909 | nd = policy->v.preferred_node; | |
1910 | else { | |
19770b32 | 1911 | /* |
6d840958 MH |
1912 | * __GFP_THISNODE shouldn't even be used with the bind policy |
1913 | * because we might easily break the expectation to stay on the | |
1914 | * requested node and not break the policy. | |
19770b32 | 1915 | */ |
6d840958 | 1916 | WARN_ON_ONCE(policy->mode == MPOL_BIND && (gfp & __GFP_THISNODE)); |
1da177e4 | 1917 | } |
6d840958 | 1918 | |
04ec6264 | 1919 | return nd; |
1da177e4 LT |
1920 | } |
1921 | ||
1922 | /* Do dynamic interleaving for a process */ | |
1923 | static unsigned interleave_nodes(struct mempolicy *policy) | |
1924 | { | |
45816682 | 1925 | unsigned next; |
1da177e4 LT |
1926 | struct task_struct *me = current; |
1927 | ||
45816682 | 1928 | next = next_node_in(me->il_prev, policy->v.nodes); |
f5b087b5 | 1929 | if (next < MAX_NUMNODES) |
45816682 VB |
1930 | me->il_prev = next; |
1931 | return next; | |
1da177e4 LT |
1932 | } |
1933 | ||
dc85da15 CL |
1934 | /* |
1935 | * Depending on the memory policy provide a node from which to allocate the | |
1936 | * next slab entry. | |
1937 | */ | |
2a389610 | 1938 | unsigned int mempolicy_slab_node(void) |
dc85da15 | 1939 | { |
e7b691b0 | 1940 | struct mempolicy *policy; |
2a389610 | 1941 | int node = numa_mem_id(); |
e7b691b0 AK |
1942 | |
1943 | if (in_interrupt()) | |
2a389610 | 1944 | return node; |
e7b691b0 AK |
1945 | |
1946 | policy = current->mempolicy; | |
fc36b8d3 | 1947 | if (!policy || policy->flags & MPOL_F_LOCAL) |
2a389610 | 1948 | return node; |
bea904d5 LS |
1949 | |
1950 | switch (policy->mode) { | |
1951 | case MPOL_PREFERRED: | |
fc36b8d3 LS |
1952 | /* |
1953 | * handled MPOL_F_LOCAL above | |
1954 | */ | |
1955 | return policy->v.preferred_node; | |
765c4507 | 1956 | |
dc85da15 CL |
1957 | case MPOL_INTERLEAVE: |
1958 | return interleave_nodes(policy); | |
1959 | ||
dd1a239f | 1960 | case MPOL_BIND: { |
c33d6c06 MG |
1961 | struct zoneref *z; |
1962 | ||
dc85da15 CL |
1963 | /* |
1964 | * Follow bind policy behavior and start allocation at the | |
1965 | * first node. | |
1966 | */ | |
19770b32 | 1967 | struct zonelist *zonelist; |
19770b32 | 1968 | enum zone_type highest_zoneidx = gfp_zone(GFP_KERNEL); |
c9634cf0 | 1969 | zonelist = &NODE_DATA(node)->node_zonelists[ZONELIST_FALLBACK]; |
c33d6c06 MG |
1970 | z = first_zones_zonelist(zonelist, highest_zoneidx, |
1971 | &policy->v.nodes); | |
c1093b74 | 1972 | return z->zone ? zone_to_nid(z->zone) : node; |
dd1a239f | 1973 | } |
dc85da15 | 1974 | |
dc85da15 | 1975 | default: |
bea904d5 | 1976 | BUG(); |
dc85da15 CL |
1977 | } |
1978 | } | |
1979 | ||
fee83b3a AM |
1980 | /* |
1981 | * Do static interleaving for a VMA with known offset @n. Returns the n'th | |
1982 | * node in pol->v.nodes (starting from n=0), wrapping around if n exceeds the | |
1983 | * number of present nodes. | |
1984 | */ | |
98c70baa | 1985 | static unsigned offset_il_node(struct mempolicy *pol, unsigned long n) |
1da177e4 | 1986 | { |
dfcd3c0d | 1987 | unsigned nnodes = nodes_weight(pol->v.nodes); |
f5b087b5 | 1988 | unsigned target; |
fee83b3a AM |
1989 | int i; |
1990 | int nid; | |
1da177e4 | 1991 | |
f5b087b5 DR |
1992 | if (!nnodes) |
1993 | return numa_node_id(); | |
fee83b3a AM |
1994 | target = (unsigned int)n % nnodes; |
1995 | nid = first_node(pol->v.nodes); | |
1996 | for (i = 0; i < target; i++) | |
dfcd3c0d | 1997 | nid = next_node(nid, pol->v.nodes); |
1da177e4 LT |
1998 | return nid; |
1999 | } | |
2000 | ||
5da7ca86 CL |
2001 | /* Determine a node number for interleave */ |
2002 | static inline unsigned interleave_nid(struct mempolicy *pol, | |
2003 | struct vm_area_struct *vma, unsigned long addr, int shift) | |
2004 | { | |
2005 | if (vma) { | |
2006 | unsigned long off; | |
2007 | ||
3b98b087 NA |
2008 | /* |
2009 | * for small pages, there is no difference between | |
2010 | * shift and PAGE_SHIFT, so the bit-shift is safe. | |
2011 | * for huge pages, since vm_pgoff is in units of small | |
2012 | * pages, we need to shift off the always 0 bits to get | |
2013 | * a useful offset. | |
2014 | */ | |
2015 | BUG_ON(shift < PAGE_SHIFT); | |
2016 | off = vma->vm_pgoff >> (shift - PAGE_SHIFT); | |
5da7ca86 | 2017 | off += (addr - vma->vm_start) >> shift; |
98c70baa | 2018 | return offset_il_node(pol, off); |
5da7ca86 CL |
2019 | } else |
2020 | return interleave_nodes(pol); | |
2021 | } | |
2022 | ||
00ac59ad | 2023 | #ifdef CONFIG_HUGETLBFS |
480eccf9 | 2024 | /* |
04ec6264 | 2025 | * huge_node(@vma, @addr, @gfp_flags, @mpol) |
b46e14ac FF |
2026 | * @vma: virtual memory area whose policy is sought |
2027 | * @addr: address in @vma for shared policy lookup and interleave policy | |
2028 | * @gfp_flags: for requested zone | |
2029 | * @mpol: pointer to mempolicy pointer for reference counted mempolicy | |
2030 | * @nodemask: pointer to nodemask pointer for MPOL_BIND nodemask | |
480eccf9 | 2031 | * |
04ec6264 | 2032 | * Returns a nid suitable for a huge page allocation and a pointer |
52cd3b07 LS |
2033 | * to the struct mempolicy for conditional unref after allocation. |
2034 | * If the effective policy is 'BIND, returns a pointer to the mempolicy's | |
2035 | * @nodemask for filtering the zonelist. | |
c0ff7453 | 2036 | * |
d26914d1 | 2037 | * Must be protected by read_mems_allowed_begin() |
480eccf9 | 2038 | */ |
04ec6264 VB |
2039 | int huge_node(struct vm_area_struct *vma, unsigned long addr, gfp_t gfp_flags, |
2040 | struct mempolicy **mpol, nodemask_t **nodemask) | |
5da7ca86 | 2041 | { |
04ec6264 | 2042 | int nid; |
5da7ca86 | 2043 | |
dd6eecb9 | 2044 | *mpol = get_vma_policy(vma, addr); |
19770b32 | 2045 | *nodemask = NULL; /* assume !MPOL_BIND */ |
5da7ca86 | 2046 | |
52cd3b07 | 2047 | if (unlikely((*mpol)->mode == MPOL_INTERLEAVE)) { |
04ec6264 VB |
2048 | nid = interleave_nid(*mpol, vma, addr, |
2049 | huge_page_shift(hstate_vma(vma))); | |
52cd3b07 | 2050 | } else { |
04ec6264 | 2051 | nid = policy_node(gfp_flags, *mpol, numa_node_id()); |
52cd3b07 LS |
2052 | if ((*mpol)->mode == MPOL_BIND) |
2053 | *nodemask = &(*mpol)->v.nodes; | |
480eccf9 | 2054 | } |
04ec6264 | 2055 | return nid; |
5da7ca86 | 2056 | } |
06808b08 LS |
2057 | |
2058 | /* | |
2059 | * init_nodemask_of_mempolicy | |
2060 | * | |
2061 | * If the current task's mempolicy is "default" [NULL], return 'false' | |
2062 | * to indicate default policy. Otherwise, extract the policy nodemask | |
2063 | * for 'bind' or 'interleave' policy into the argument nodemask, or | |
2064 | * initialize the argument nodemask to contain the single node for | |
2065 | * 'preferred' or 'local' policy and return 'true' to indicate presence | |
2066 | * of non-default mempolicy. | |
2067 | * | |
2068 | * We don't bother with reference counting the mempolicy [mpol_get/put] | |
2069 | * because the current task is examining it's own mempolicy and a task's | |
2070 | * mempolicy is only ever changed by the task itself. | |
2071 | * | |
2072 | * N.B., it is the caller's responsibility to free a returned nodemask. | |
2073 | */ | |
2074 | bool init_nodemask_of_mempolicy(nodemask_t *mask) | |
2075 | { | |
2076 | struct mempolicy *mempolicy; | |
2077 | int nid; | |
2078 | ||
2079 | if (!(mask && current->mempolicy)) | |
2080 | return false; | |
2081 | ||
c0ff7453 | 2082 | task_lock(current); |
06808b08 LS |
2083 | mempolicy = current->mempolicy; |
2084 | switch (mempolicy->mode) { | |
2085 | case MPOL_PREFERRED: | |
2086 | if (mempolicy->flags & MPOL_F_LOCAL) | |
2087 | nid = numa_node_id(); | |
2088 | else | |
2089 | nid = mempolicy->v.preferred_node; | |
2090 | init_nodemask_of_node(mask, nid); | |
2091 | break; | |
2092 | ||
2093 | case MPOL_BIND: | |
06808b08 LS |
2094 | case MPOL_INTERLEAVE: |
2095 | *mask = mempolicy->v.nodes; | |
2096 | break; | |
2097 | ||
2098 | default: | |
2099 | BUG(); | |
2100 | } | |
c0ff7453 | 2101 | task_unlock(current); |
06808b08 LS |
2102 | |
2103 | return true; | |
2104 | } | |
00ac59ad | 2105 | #endif |
5da7ca86 | 2106 | |
6f48d0eb DR |
2107 | /* |
2108 | * mempolicy_nodemask_intersects | |
2109 | * | |
2110 | * If tsk's mempolicy is "default" [NULL], return 'true' to indicate default | |
2111 | * policy. Otherwise, check for intersection between mask and the policy | |
2112 | * nodemask for 'bind' or 'interleave' policy. For 'perferred' or 'local' | |
2113 | * policy, always return true since it may allocate elsewhere on fallback. | |
2114 | * | |
2115 | * Takes task_lock(tsk) to prevent freeing of its mempolicy. | |
2116 | */ | |
2117 | bool mempolicy_nodemask_intersects(struct task_struct *tsk, | |
2118 | const nodemask_t *mask) | |
2119 | { | |
2120 | struct mempolicy *mempolicy; | |
2121 | bool ret = true; | |
2122 | ||
2123 | if (!mask) | |
2124 | return ret; | |
2125 | task_lock(tsk); | |
2126 | mempolicy = tsk->mempolicy; | |
2127 | if (!mempolicy) | |
2128 | goto out; | |
2129 | ||
2130 | switch (mempolicy->mode) { | |
2131 | case MPOL_PREFERRED: | |
2132 | /* | |
2133 | * MPOL_PREFERRED and MPOL_F_LOCAL are only preferred nodes to | |
2134 | * allocate from, they may fallback to other nodes when oom. | |
2135 | * Thus, it's possible for tsk to have allocated memory from | |
2136 | * nodes in mask. | |
2137 | */ | |
2138 | break; | |
2139 | case MPOL_BIND: | |
2140 | case MPOL_INTERLEAVE: | |
2141 | ret = nodes_intersects(mempolicy->v.nodes, *mask); | |
2142 | break; | |
2143 | default: | |
2144 | BUG(); | |
2145 | } | |
2146 | out: | |
2147 | task_unlock(tsk); | |
2148 | return ret; | |
2149 | } | |
2150 | ||
1da177e4 LT |
2151 | /* Allocate a page in interleaved policy. |
2152 | Own path because it needs to do special accounting. */ | |
662f3a0b AK |
2153 | static struct page *alloc_page_interleave(gfp_t gfp, unsigned order, |
2154 | unsigned nid) | |
1da177e4 | 2155 | { |
1da177e4 LT |
2156 | struct page *page; |
2157 | ||
04ec6264 | 2158 | page = __alloc_pages(gfp, order, nid); |
4518085e KW |
2159 | /* skip NUMA_INTERLEAVE_HIT counter update if numa stats is disabled */ |
2160 | if (!static_branch_likely(&vm_numa_stat_key)) | |
2161 | return page; | |
de55c8b2 AR |
2162 | if (page && page_to_nid(page) == nid) { |
2163 | preempt_disable(); | |
2164 | __inc_numa_state(page_zone(page), NUMA_INTERLEAVE_HIT); | |
2165 | preempt_enable(); | |
2166 | } | |
1da177e4 LT |
2167 | return page; |
2168 | } | |
2169 | ||
2170 | /** | |
0bbbc0b3 | 2171 | * alloc_pages_vma - Allocate a page for a VMA. |
1da177e4 LT |
2172 | * |
2173 | * @gfp: | |
2174 | * %GFP_USER user allocation. | |
2175 | * %GFP_KERNEL kernel allocations, | |
2176 | * %GFP_HIGHMEM highmem/user allocations, | |
2177 | * %GFP_FS allocation should not call back into a file system. | |
2178 | * %GFP_ATOMIC don't sleep. | |
2179 | * | |
0bbbc0b3 | 2180 | * @order:Order of the GFP allocation. |
1da177e4 LT |
2181 | * @vma: Pointer to VMA or NULL if not available. |
2182 | * @addr: Virtual Address of the allocation. Must be inside the VMA. | |
be97a41b | 2183 | * @node: Which node to prefer for allocation (modulo policy). |
19deb769 | 2184 | * @hugepage: for hugepages try only the preferred node if possible |
1da177e4 LT |
2185 | * |
2186 | * This function allocates a page from the kernel page pool and applies | |
2187 | * a NUMA policy associated with the VMA or the current process. | |
3e4e28c5 | 2188 | * When VMA is not NULL caller must read-lock the mmap_lock of the |
1da177e4 | 2189 | * mm_struct of the VMA to prevent it from going away. Should be used for |
be97a41b VB |
2190 | * all allocations for pages that will be mapped into user space. Returns |
2191 | * NULL when no page can be allocated. | |
1da177e4 LT |
2192 | */ |
2193 | struct page * | |
0bbbc0b3 | 2194 | alloc_pages_vma(gfp_t gfp, int order, struct vm_area_struct *vma, |
19deb769 | 2195 | unsigned long addr, int node, bool hugepage) |
1da177e4 | 2196 | { |
cc9a6c87 | 2197 | struct mempolicy *pol; |
c0ff7453 | 2198 | struct page *page; |
04ec6264 | 2199 | int preferred_nid; |
be97a41b | 2200 | nodemask_t *nmask; |
cc9a6c87 | 2201 | |
dd6eecb9 | 2202 | pol = get_vma_policy(vma, addr); |
1da177e4 | 2203 | |
0867a57c VB |
2204 | if (pol->mode == MPOL_INTERLEAVE) { |
2205 | unsigned nid; | |
2206 | ||
2207 | nid = interleave_nid(pol, vma, addr, PAGE_SHIFT + order); | |
2208 | mpol_cond_put(pol); | |
2209 | page = alloc_page_interleave(gfp, order, nid); | |
2210 | goto out; | |
19deb769 DR |
2211 | } |
2212 | ||
2213 | if (unlikely(IS_ENABLED(CONFIG_TRANSPARENT_HUGEPAGE) && hugepage)) { | |
2214 | int hpage_node = node; | |
2215 | ||
2216 | /* | |
2217 | * For hugepage allocation and non-interleave policy which | |
2218 | * allows the current node (or other explicitly preferred | |
2219 | * node) we only try to allocate from the current/preferred | |
2220 | * node and don't fall back to other nodes, as the cost of | |
2221 | * remote accesses would likely offset THP benefits. | |
2222 | * | |
2223 | * If the policy is interleave, or does not allow the current | |
2224 | * node in its nodemask, we allocate the standard way. | |
2225 | */ | |
2226 | if (pol->mode == MPOL_PREFERRED && !(pol->flags & MPOL_F_LOCAL)) | |
2227 | hpage_node = pol->v.preferred_node; | |
2228 | ||
2229 | nmask = policy_nodemask(gfp, pol); | |
2230 | if (!nmask || node_isset(hpage_node, *nmask)) { | |
2231 | mpol_cond_put(pol); | |
cc638f32 VB |
2232 | /* |
2233 | * First, try to allocate THP only on local node, but | |
2234 | * don't reclaim unnecessarily, just compact. | |
2235 | */ | |
19deb769 | 2236 | page = __alloc_pages_node(hpage_node, |
cc638f32 | 2237 | gfp | __GFP_THISNODE | __GFP_NORETRY, order); |
76e654cc DR |
2238 | |
2239 | /* | |
2240 | * If hugepage allocations are configured to always | |
2241 | * synchronous compact or the vma has been madvised | |
2242 | * to prefer hugepage backing, retry allowing remote | |
cc638f32 | 2243 | * memory with both reclaim and compact as well. |
76e654cc DR |
2244 | */ |
2245 | if (!page && (gfp & __GFP_DIRECT_RECLAIM)) | |
2246 | page = __alloc_pages_node(hpage_node, | |
cc638f32 | 2247 | gfp, order); |
76e654cc | 2248 | |
19deb769 DR |
2249 | goto out; |
2250 | } | |
356ff8a9 DR |
2251 | } |
2252 | ||
be97a41b | 2253 | nmask = policy_nodemask(gfp, pol); |
04ec6264 VB |
2254 | preferred_nid = policy_node(gfp, pol, node); |
2255 | page = __alloc_pages_nodemask(gfp, order, preferred_nid, nmask); | |
d51e9894 | 2256 | mpol_cond_put(pol); |
be97a41b | 2257 | out: |
c0ff7453 | 2258 | return page; |
1da177e4 | 2259 | } |
69262215 | 2260 | EXPORT_SYMBOL(alloc_pages_vma); |
1da177e4 LT |
2261 | |
2262 | /** | |
2263 | * alloc_pages_current - Allocate pages. | |
2264 | * | |
2265 | * @gfp: | |
2266 | * %GFP_USER user allocation, | |
2267 | * %GFP_KERNEL kernel allocation, | |
2268 | * %GFP_HIGHMEM highmem allocation, | |
2269 | * %GFP_FS don't call back into a file system. | |
2270 | * %GFP_ATOMIC don't sleep. | |
2271 | * @order: Power of two of allocation size in pages. 0 is a single page. | |
2272 | * | |
2273 | * Allocate a page from the kernel page pool. When not in | |
2274 | * interrupt context and apply the current process NUMA policy. | |
2275 | * Returns NULL when no page can be allocated. | |
1da177e4 | 2276 | */ |
dd0fc66f | 2277 | struct page *alloc_pages_current(gfp_t gfp, unsigned order) |
1da177e4 | 2278 | { |
8d90274b | 2279 | struct mempolicy *pol = &default_policy; |
c0ff7453 | 2280 | struct page *page; |
1da177e4 | 2281 | |
8d90274b ON |
2282 | if (!in_interrupt() && !(gfp & __GFP_THISNODE)) |
2283 | pol = get_task_policy(current); | |
52cd3b07 LS |
2284 | |
2285 | /* | |
2286 | * No reference counting needed for current->mempolicy | |
2287 | * nor system default_policy | |
2288 | */ | |
45c4745a | 2289 | if (pol->mode == MPOL_INTERLEAVE) |
c0ff7453 MX |
2290 | page = alloc_page_interleave(gfp, order, interleave_nodes(pol)); |
2291 | else | |
2292 | page = __alloc_pages_nodemask(gfp, order, | |
04ec6264 | 2293 | policy_node(gfp, pol, numa_node_id()), |
5c4b4be3 | 2294 | policy_nodemask(gfp, pol)); |
cc9a6c87 | 2295 | |
c0ff7453 | 2296 | return page; |
1da177e4 LT |
2297 | } |
2298 | EXPORT_SYMBOL(alloc_pages_current); | |
2299 | ||
ef0855d3 ON |
2300 | int vma_dup_policy(struct vm_area_struct *src, struct vm_area_struct *dst) |
2301 | { | |
2302 | struct mempolicy *pol = mpol_dup(vma_policy(src)); | |
2303 | ||
2304 | if (IS_ERR(pol)) | |
2305 | return PTR_ERR(pol); | |
2306 | dst->vm_policy = pol; | |
2307 | return 0; | |
2308 | } | |
2309 | ||
4225399a | 2310 | /* |
846a16bf | 2311 | * If mpol_dup() sees current->cpuset == cpuset_being_rebound, then it |
4225399a PJ |
2312 | * rebinds the mempolicy its copying by calling mpol_rebind_policy() |
2313 | * with the mems_allowed returned by cpuset_mems_allowed(). This | |
2314 | * keeps mempolicies cpuset relative after its cpuset moves. See | |
2315 | * further kernel/cpuset.c update_nodemask(). | |
708c1bbc MX |
2316 | * |
2317 | * current's mempolicy may be rebinded by the other task(the task that changes | |
2318 | * cpuset's mems), so we needn't do rebind work for current task. | |
4225399a | 2319 | */ |
4225399a | 2320 | |
846a16bf LS |
2321 | /* Slow path of a mempolicy duplicate */ |
2322 | struct mempolicy *__mpol_dup(struct mempolicy *old) | |
1da177e4 LT |
2323 | { |
2324 | struct mempolicy *new = kmem_cache_alloc(policy_cache, GFP_KERNEL); | |
2325 | ||
2326 | if (!new) | |
2327 | return ERR_PTR(-ENOMEM); | |
708c1bbc MX |
2328 | |
2329 | /* task's mempolicy is protected by alloc_lock */ | |
2330 | if (old == current->mempolicy) { | |
2331 | task_lock(current); | |
2332 | *new = *old; | |
2333 | task_unlock(current); | |
2334 | } else | |
2335 | *new = *old; | |
2336 | ||
4225399a PJ |
2337 | if (current_cpuset_is_being_rebound()) { |
2338 | nodemask_t mems = cpuset_mems_allowed(current); | |
213980c0 | 2339 | mpol_rebind_policy(new, &mems); |
4225399a | 2340 | } |
1da177e4 | 2341 | atomic_set(&new->refcnt, 1); |
1da177e4 LT |
2342 | return new; |
2343 | } | |
2344 | ||
2345 | /* Slow path of a mempolicy comparison */ | |
fcfb4dcc | 2346 | bool __mpol_equal(struct mempolicy *a, struct mempolicy *b) |
1da177e4 LT |
2347 | { |
2348 | if (!a || !b) | |
fcfb4dcc | 2349 | return false; |
45c4745a | 2350 | if (a->mode != b->mode) |
fcfb4dcc | 2351 | return false; |
19800502 | 2352 | if (a->flags != b->flags) |
fcfb4dcc | 2353 | return false; |
19800502 BL |
2354 | if (mpol_store_user_nodemask(a)) |
2355 | if (!nodes_equal(a->w.user_nodemask, b->w.user_nodemask)) | |
fcfb4dcc | 2356 | return false; |
19800502 | 2357 | |
45c4745a | 2358 | switch (a->mode) { |
19770b32 | 2359 | case MPOL_BIND: |
1da177e4 | 2360 | case MPOL_INTERLEAVE: |
fcfb4dcc | 2361 | return !!nodes_equal(a->v.nodes, b->v.nodes); |
1da177e4 | 2362 | case MPOL_PREFERRED: |
8970a63e YX |
2363 | /* a's ->flags is the same as b's */ |
2364 | if (a->flags & MPOL_F_LOCAL) | |
2365 | return true; | |
75719661 | 2366 | return a->v.preferred_node == b->v.preferred_node; |
1da177e4 LT |
2367 | default: |
2368 | BUG(); | |
fcfb4dcc | 2369 | return false; |
1da177e4 LT |
2370 | } |
2371 | } | |
2372 | ||
1da177e4 LT |
2373 | /* |
2374 | * Shared memory backing store policy support. | |
2375 | * | |
2376 | * Remember policies even when nobody has shared memory mapped. | |
2377 | * The policies are kept in Red-Black tree linked from the inode. | |
4a8c7bb5 | 2378 | * They are protected by the sp->lock rwlock, which should be held |
1da177e4 LT |
2379 | * for any accesses to the tree. |
2380 | */ | |
2381 | ||
4a8c7bb5 NZ |
2382 | /* |
2383 | * lookup first element intersecting start-end. Caller holds sp->lock for | |
2384 | * reading or for writing | |
2385 | */ | |
1da177e4 LT |
2386 | static struct sp_node * |
2387 | sp_lookup(struct shared_policy *sp, unsigned long start, unsigned long end) | |
2388 | { | |
2389 | struct rb_node *n = sp->root.rb_node; | |
2390 | ||
2391 | while (n) { | |
2392 | struct sp_node *p = rb_entry(n, struct sp_node, nd); | |
2393 | ||
2394 | if (start >= p->end) | |
2395 | n = n->rb_right; | |
2396 | else if (end <= p->start) | |
2397 | n = n->rb_left; | |
2398 | else | |
2399 | break; | |
2400 | } | |
2401 | if (!n) | |
2402 | return NULL; | |
2403 | for (;;) { | |
2404 | struct sp_node *w = NULL; | |
2405 | struct rb_node *prev = rb_prev(n); | |
2406 | if (!prev) | |
2407 | break; | |
2408 | w = rb_entry(prev, struct sp_node, nd); | |
2409 | if (w->end <= start) | |
2410 | break; | |
2411 | n = prev; | |
2412 | } | |
2413 | return rb_entry(n, struct sp_node, nd); | |
2414 | } | |
2415 | ||
4a8c7bb5 NZ |
2416 | /* |
2417 | * Insert a new shared policy into the list. Caller holds sp->lock for | |
2418 | * writing. | |
2419 | */ | |
1da177e4 LT |
2420 | static void sp_insert(struct shared_policy *sp, struct sp_node *new) |
2421 | { | |
2422 | struct rb_node **p = &sp->root.rb_node; | |
2423 | struct rb_node *parent = NULL; | |
2424 | struct sp_node *nd; | |
2425 | ||
2426 | while (*p) { | |
2427 | parent = *p; | |
2428 | nd = rb_entry(parent, struct sp_node, nd); | |
2429 | if (new->start < nd->start) | |
2430 | p = &(*p)->rb_left; | |
2431 | else if (new->end > nd->end) | |
2432 | p = &(*p)->rb_right; | |
2433 | else | |
2434 | BUG(); | |
2435 | } | |
2436 | rb_link_node(&new->nd, parent, p); | |
2437 | rb_insert_color(&new->nd, &sp->root); | |
140d5a49 | 2438 | pr_debug("inserting %lx-%lx: %d\n", new->start, new->end, |
45c4745a | 2439 | new->policy ? new->policy->mode : 0); |
1da177e4 LT |
2440 | } |
2441 | ||
2442 | /* Find shared policy intersecting idx */ | |
2443 | struct mempolicy * | |
2444 | mpol_shared_policy_lookup(struct shared_policy *sp, unsigned long idx) | |
2445 | { | |
2446 | struct mempolicy *pol = NULL; | |
2447 | struct sp_node *sn; | |
2448 | ||
2449 | if (!sp->root.rb_node) | |
2450 | return NULL; | |
4a8c7bb5 | 2451 | read_lock(&sp->lock); |
1da177e4 LT |
2452 | sn = sp_lookup(sp, idx, idx+1); |
2453 | if (sn) { | |
2454 | mpol_get(sn->policy); | |
2455 | pol = sn->policy; | |
2456 | } | |
4a8c7bb5 | 2457 | read_unlock(&sp->lock); |
1da177e4 LT |
2458 | return pol; |
2459 | } | |
2460 | ||
63f74ca2 KM |
2461 | static void sp_free(struct sp_node *n) |
2462 | { | |
2463 | mpol_put(n->policy); | |
2464 | kmem_cache_free(sn_cache, n); | |
2465 | } | |
2466 | ||
771fb4d8 LS |
2467 | /** |
2468 | * mpol_misplaced - check whether current page node is valid in policy | |
2469 | * | |
b46e14ac FF |
2470 | * @page: page to be checked |
2471 | * @vma: vm area where page mapped | |
2472 | * @addr: virtual address where page mapped | |
771fb4d8 LS |
2473 | * |
2474 | * Lookup current policy node id for vma,addr and "compare to" page's | |
2475 | * node id. | |
2476 | * | |
2477 | * Returns: | |
2478 | * -1 - not misplaced, page is in the right node | |
2479 | * node - node id where the page should be | |
2480 | * | |
2481 | * Policy determination "mimics" alloc_page_vma(). | |
2482 | * Called from fault path where we know the vma and faulting address. | |
2483 | */ | |
2484 | int mpol_misplaced(struct page *page, struct vm_area_struct *vma, unsigned long addr) | |
2485 | { | |
2486 | struct mempolicy *pol; | |
c33d6c06 | 2487 | struct zoneref *z; |
771fb4d8 LS |
2488 | int curnid = page_to_nid(page); |
2489 | unsigned long pgoff; | |
90572890 PZ |
2490 | int thiscpu = raw_smp_processor_id(); |
2491 | int thisnid = cpu_to_node(thiscpu); | |
98fa15f3 | 2492 | int polnid = NUMA_NO_NODE; |
771fb4d8 LS |
2493 | int ret = -1; |
2494 | ||
dd6eecb9 | 2495 | pol = get_vma_policy(vma, addr); |
771fb4d8 LS |
2496 | if (!(pol->flags & MPOL_F_MOF)) |
2497 | goto out; | |
2498 | ||
2499 | switch (pol->mode) { | |
2500 | case MPOL_INTERLEAVE: | |
771fb4d8 LS |
2501 | pgoff = vma->vm_pgoff; |
2502 | pgoff += (addr - vma->vm_start) >> PAGE_SHIFT; | |
98c70baa | 2503 | polnid = offset_il_node(pol, pgoff); |
771fb4d8 LS |
2504 | break; |
2505 | ||
2506 | case MPOL_PREFERRED: | |
2507 | if (pol->flags & MPOL_F_LOCAL) | |
2508 | polnid = numa_node_id(); | |
2509 | else | |
2510 | polnid = pol->v.preferred_node; | |
2511 | break; | |
2512 | ||
2513 | case MPOL_BIND: | |
c33d6c06 | 2514 | |
771fb4d8 LS |
2515 | /* |
2516 | * allows binding to multiple nodes. | |
2517 | * use current page if in policy nodemask, | |
2518 | * else select nearest allowed node, if any. | |
2519 | * If no allowed nodes, use current [!misplaced]. | |
2520 | */ | |
2521 | if (node_isset(curnid, pol->v.nodes)) | |
2522 | goto out; | |
c33d6c06 | 2523 | z = first_zones_zonelist( |
771fb4d8 LS |
2524 | node_zonelist(numa_node_id(), GFP_HIGHUSER), |
2525 | gfp_zone(GFP_HIGHUSER), | |
c33d6c06 | 2526 | &pol->v.nodes); |
c1093b74 | 2527 | polnid = zone_to_nid(z->zone); |
771fb4d8 LS |
2528 | break; |
2529 | ||
2530 | default: | |
2531 | BUG(); | |
2532 | } | |
5606e387 MG |
2533 | |
2534 | /* Migrate the page towards the node whose CPU is referencing it */ | |
e42c8ff2 | 2535 | if (pol->flags & MPOL_F_MORON) { |
90572890 | 2536 | polnid = thisnid; |
5606e387 | 2537 | |
10f39042 | 2538 | if (!should_numa_migrate_memory(current, page, curnid, thiscpu)) |
de1c9ce6 | 2539 | goto out; |
e42c8ff2 MG |
2540 | } |
2541 | ||
771fb4d8 LS |
2542 | if (curnid != polnid) |
2543 | ret = polnid; | |
2544 | out: | |
2545 | mpol_cond_put(pol); | |
2546 | ||
2547 | return ret; | |
2548 | } | |
2549 | ||
c11600e4 DR |
2550 | /* |
2551 | * Drop the (possibly final) reference to task->mempolicy. It needs to be | |
2552 | * dropped after task->mempolicy is set to NULL so that any allocation done as | |
2553 | * part of its kmem_cache_free(), such as by KASAN, doesn't reference a freed | |
2554 | * policy. | |
2555 | */ | |
2556 | void mpol_put_task_policy(struct task_struct *task) | |
2557 | { | |
2558 | struct mempolicy *pol; | |
2559 | ||
2560 | task_lock(task); | |
2561 | pol = task->mempolicy; | |
2562 | task->mempolicy = NULL; | |
2563 | task_unlock(task); | |
2564 | mpol_put(pol); | |
2565 | } | |
2566 | ||
1da177e4 LT |
2567 | static void sp_delete(struct shared_policy *sp, struct sp_node *n) |
2568 | { | |
140d5a49 | 2569 | pr_debug("deleting %lx-l%lx\n", n->start, n->end); |
1da177e4 | 2570 | rb_erase(&n->nd, &sp->root); |
63f74ca2 | 2571 | sp_free(n); |
1da177e4 LT |
2572 | } |
2573 | ||
42288fe3 MG |
2574 | static void sp_node_init(struct sp_node *node, unsigned long start, |
2575 | unsigned long end, struct mempolicy *pol) | |
2576 | { | |
2577 | node->start = start; | |
2578 | node->end = end; | |
2579 | node->policy = pol; | |
2580 | } | |
2581 | ||
dbcb0f19 AB |
2582 | static struct sp_node *sp_alloc(unsigned long start, unsigned long end, |
2583 | struct mempolicy *pol) | |
1da177e4 | 2584 | { |
869833f2 KM |
2585 | struct sp_node *n; |
2586 | struct mempolicy *newpol; | |
1da177e4 | 2587 | |
869833f2 | 2588 | n = kmem_cache_alloc(sn_cache, GFP_KERNEL); |
1da177e4 LT |
2589 | if (!n) |
2590 | return NULL; | |
869833f2 KM |
2591 | |
2592 | newpol = mpol_dup(pol); | |
2593 | if (IS_ERR(newpol)) { | |
2594 | kmem_cache_free(sn_cache, n); | |
2595 | return NULL; | |
2596 | } | |
2597 | newpol->flags |= MPOL_F_SHARED; | |
42288fe3 | 2598 | sp_node_init(n, start, end, newpol); |
869833f2 | 2599 | |
1da177e4 LT |
2600 | return n; |
2601 | } | |
2602 | ||
2603 | /* Replace a policy range. */ | |
2604 | static int shared_policy_replace(struct shared_policy *sp, unsigned long start, | |
2605 | unsigned long end, struct sp_node *new) | |
2606 | { | |
b22d127a | 2607 | struct sp_node *n; |
42288fe3 MG |
2608 | struct sp_node *n_new = NULL; |
2609 | struct mempolicy *mpol_new = NULL; | |
b22d127a | 2610 | int ret = 0; |
1da177e4 | 2611 | |
42288fe3 | 2612 | restart: |
4a8c7bb5 | 2613 | write_lock(&sp->lock); |
1da177e4 LT |
2614 | n = sp_lookup(sp, start, end); |
2615 | /* Take care of old policies in the same range. */ | |
2616 | while (n && n->start < end) { | |
2617 | struct rb_node *next = rb_next(&n->nd); | |
2618 | if (n->start >= start) { | |
2619 | if (n->end <= end) | |
2620 | sp_delete(sp, n); | |
2621 | else | |
2622 | n->start = end; | |
2623 | } else { | |
2624 | /* Old policy spanning whole new range. */ | |
2625 | if (n->end > end) { | |
42288fe3 MG |
2626 | if (!n_new) |
2627 | goto alloc_new; | |
2628 | ||
2629 | *mpol_new = *n->policy; | |
2630 | atomic_set(&mpol_new->refcnt, 1); | |
7880639c | 2631 | sp_node_init(n_new, end, n->end, mpol_new); |
1da177e4 | 2632 | n->end = start; |
5ca39575 | 2633 | sp_insert(sp, n_new); |
42288fe3 MG |
2634 | n_new = NULL; |
2635 | mpol_new = NULL; | |
1da177e4 LT |
2636 | break; |
2637 | } else | |
2638 | n->end = start; | |
2639 | } | |
2640 | if (!next) | |
2641 | break; | |
2642 | n = rb_entry(next, struct sp_node, nd); | |
2643 | } | |
2644 | if (new) | |
2645 | sp_insert(sp, new); | |
4a8c7bb5 | 2646 | write_unlock(&sp->lock); |
42288fe3 MG |
2647 | ret = 0; |
2648 | ||
2649 | err_out: | |
2650 | if (mpol_new) | |
2651 | mpol_put(mpol_new); | |
2652 | if (n_new) | |
2653 | kmem_cache_free(sn_cache, n_new); | |
2654 | ||
b22d127a | 2655 | return ret; |
42288fe3 MG |
2656 | |
2657 | alloc_new: | |
4a8c7bb5 | 2658 | write_unlock(&sp->lock); |
42288fe3 MG |
2659 | ret = -ENOMEM; |
2660 | n_new = kmem_cache_alloc(sn_cache, GFP_KERNEL); | |
2661 | if (!n_new) | |
2662 | goto err_out; | |
2663 | mpol_new = kmem_cache_alloc(policy_cache, GFP_KERNEL); | |
2664 | if (!mpol_new) | |
2665 | goto err_out; | |
2666 | goto restart; | |
1da177e4 LT |
2667 | } |
2668 | ||
71fe804b LS |
2669 | /** |
2670 | * mpol_shared_policy_init - initialize shared policy for inode | |
2671 | * @sp: pointer to inode shared policy | |
2672 | * @mpol: struct mempolicy to install | |
2673 | * | |
2674 | * Install non-NULL @mpol in inode's shared policy rb-tree. | |
2675 | * On entry, the current task has a reference on a non-NULL @mpol. | |
2676 | * This must be released on exit. | |
4bfc4495 | 2677 | * This is called at get_inode() calls and we can use GFP_KERNEL. |
71fe804b LS |
2678 | */ |
2679 | void mpol_shared_policy_init(struct shared_policy *sp, struct mempolicy *mpol) | |
2680 | { | |
58568d2a MX |
2681 | int ret; |
2682 | ||
71fe804b | 2683 | sp->root = RB_ROOT; /* empty tree == default mempolicy */ |
4a8c7bb5 | 2684 | rwlock_init(&sp->lock); |
71fe804b LS |
2685 | |
2686 | if (mpol) { | |
2687 | struct vm_area_struct pvma; | |
2688 | struct mempolicy *new; | |
4bfc4495 | 2689 | NODEMASK_SCRATCH(scratch); |
71fe804b | 2690 | |
4bfc4495 | 2691 | if (!scratch) |
5c0c1654 | 2692 | goto put_mpol; |
71fe804b LS |
2693 | /* contextualize the tmpfs mount point mempolicy */ |
2694 | new = mpol_new(mpol->mode, mpol->flags, &mpol->w.user_nodemask); | |
15d77835 | 2695 | if (IS_ERR(new)) |
0cae3457 | 2696 | goto free_scratch; /* no valid nodemask intersection */ |
58568d2a MX |
2697 | |
2698 | task_lock(current); | |
4bfc4495 | 2699 | ret = mpol_set_nodemask(new, &mpol->w.user_nodemask, scratch); |
58568d2a | 2700 | task_unlock(current); |
15d77835 | 2701 | if (ret) |
5c0c1654 | 2702 | goto put_new; |
71fe804b LS |
2703 | |
2704 | /* Create pseudo-vma that contains just the policy */ | |
2c4541e2 | 2705 | vma_init(&pvma, NULL); |
71fe804b LS |
2706 | pvma.vm_end = TASK_SIZE; /* policy covers entire file */ |
2707 | mpol_set_shared_policy(sp, &pvma, new); /* adds ref */ | |
15d77835 | 2708 | |
5c0c1654 | 2709 | put_new: |
71fe804b | 2710 | mpol_put(new); /* drop initial ref */ |
0cae3457 | 2711 | free_scratch: |
4bfc4495 | 2712 | NODEMASK_SCRATCH_FREE(scratch); |
5c0c1654 LS |
2713 | put_mpol: |
2714 | mpol_put(mpol); /* drop our incoming ref on sb mpol */ | |
7339ff83 RH |
2715 | } |
2716 | } | |
2717 | ||
1da177e4 LT |
2718 | int mpol_set_shared_policy(struct shared_policy *info, |
2719 | struct vm_area_struct *vma, struct mempolicy *npol) | |
2720 | { | |
2721 | int err; | |
2722 | struct sp_node *new = NULL; | |
2723 | unsigned long sz = vma_pages(vma); | |
2724 | ||
028fec41 | 2725 | pr_debug("set_shared_policy %lx sz %lu %d %d %lx\n", |
1da177e4 | 2726 | vma->vm_pgoff, |
45c4745a | 2727 | sz, npol ? npol->mode : -1, |
028fec41 | 2728 | npol ? npol->flags : -1, |
00ef2d2f | 2729 | npol ? nodes_addr(npol->v.nodes)[0] : NUMA_NO_NODE); |
1da177e4 LT |
2730 | |
2731 | if (npol) { | |
2732 | new = sp_alloc(vma->vm_pgoff, vma->vm_pgoff + sz, npol); | |
2733 | if (!new) | |
2734 | return -ENOMEM; | |
2735 | } | |
2736 | err = shared_policy_replace(info, vma->vm_pgoff, vma->vm_pgoff+sz, new); | |
2737 | if (err && new) | |
63f74ca2 | 2738 | sp_free(new); |
1da177e4 LT |
2739 | return err; |
2740 | } | |
2741 | ||
2742 | /* Free a backing policy store on inode delete. */ | |
2743 | void mpol_free_shared_policy(struct shared_policy *p) | |
2744 | { | |
2745 | struct sp_node *n; | |
2746 | struct rb_node *next; | |
2747 | ||
2748 | if (!p->root.rb_node) | |
2749 | return; | |
4a8c7bb5 | 2750 | write_lock(&p->lock); |
1da177e4 LT |
2751 | next = rb_first(&p->root); |
2752 | while (next) { | |
2753 | n = rb_entry(next, struct sp_node, nd); | |
2754 | next = rb_next(&n->nd); | |
63f74ca2 | 2755 | sp_delete(p, n); |
1da177e4 | 2756 | } |
4a8c7bb5 | 2757 | write_unlock(&p->lock); |
1da177e4 LT |
2758 | } |
2759 | ||
1a687c2e | 2760 | #ifdef CONFIG_NUMA_BALANCING |
c297663c | 2761 | static int __initdata numabalancing_override; |
1a687c2e MG |
2762 | |
2763 | static void __init check_numabalancing_enable(void) | |
2764 | { | |
2765 | bool numabalancing_default = false; | |
2766 | ||
2767 | if (IS_ENABLED(CONFIG_NUMA_BALANCING_DEFAULT_ENABLED)) | |
2768 | numabalancing_default = true; | |
2769 | ||
c297663c MG |
2770 | /* Parsed by setup_numabalancing. override == 1 enables, -1 disables */ |
2771 | if (numabalancing_override) | |
2772 | set_numabalancing_state(numabalancing_override == 1); | |
2773 | ||
b0dc2b9b | 2774 | if (num_online_nodes() > 1 && !numabalancing_override) { |
756a025f | 2775 | pr_info("%s automatic NUMA balancing. Configure with numa_balancing= or the kernel.numa_balancing sysctl\n", |
c297663c | 2776 | numabalancing_default ? "Enabling" : "Disabling"); |
1a687c2e MG |
2777 | set_numabalancing_state(numabalancing_default); |
2778 | } | |
2779 | } | |
2780 | ||
2781 | static int __init setup_numabalancing(char *str) | |
2782 | { | |
2783 | int ret = 0; | |
2784 | if (!str) | |
2785 | goto out; | |
1a687c2e MG |
2786 | |
2787 | if (!strcmp(str, "enable")) { | |
c297663c | 2788 | numabalancing_override = 1; |
1a687c2e MG |
2789 | ret = 1; |
2790 | } else if (!strcmp(str, "disable")) { | |
c297663c | 2791 | numabalancing_override = -1; |
1a687c2e MG |
2792 | ret = 1; |
2793 | } | |
2794 | out: | |
2795 | if (!ret) | |
4a404bea | 2796 | pr_warn("Unable to parse numa_balancing=\n"); |
1a687c2e MG |
2797 | |
2798 | return ret; | |
2799 | } | |
2800 | __setup("numa_balancing=", setup_numabalancing); | |
2801 | #else | |
2802 | static inline void __init check_numabalancing_enable(void) | |
2803 | { | |
2804 | } | |
2805 | #endif /* CONFIG_NUMA_BALANCING */ | |
2806 | ||
1da177e4 LT |
2807 | /* assumes fs == KERNEL_DS */ |
2808 | void __init numa_policy_init(void) | |
2809 | { | |
b71636e2 PM |
2810 | nodemask_t interleave_nodes; |
2811 | unsigned long largest = 0; | |
2812 | int nid, prefer = 0; | |
2813 | ||
1da177e4 LT |
2814 | policy_cache = kmem_cache_create("numa_policy", |
2815 | sizeof(struct mempolicy), | |
20c2df83 | 2816 | 0, SLAB_PANIC, NULL); |
1da177e4 LT |
2817 | |
2818 | sn_cache = kmem_cache_create("shared_policy_node", | |
2819 | sizeof(struct sp_node), | |
20c2df83 | 2820 | 0, SLAB_PANIC, NULL); |
1da177e4 | 2821 | |
5606e387 MG |
2822 | for_each_node(nid) { |
2823 | preferred_node_policy[nid] = (struct mempolicy) { | |
2824 | .refcnt = ATOMIC_INIT(1), | |
2825 | .mode = MPOL_PREFERRED, | |
2826 | .flags = MPOL_F_MOF | MPOL_F_MORON, | |
2827 | .v = { .preferred_node = nid, }, | |
2828 | }; | |
2829 | } | |
2830 | ||
b71636e2 PM |
2831 | /* |
2832 | * Set interleaving policy for system init. Interleaving is only | |
2833 | * enabled across suitably sized nodes (default is >= 16MB), or | |
2834 | * fall back to the largest node if they're all smaller. | |
2835 | */ | |
2836 | nodes_clear(interleave_nodes); | |
01f13bd6 | 2837 | for_each_node_state(nid, N_MEMORY) { |
b71636e2 PM |
2838 | unsigned long total_pages = node_present_pages(nid); |
2839 | ||
2840 | /* Preserve the largest node */ | |
2841 | if (largest < total_pages) { | |
2842 | largest = total_pages; | |
2843 | prefer = nid; | |
2844 | } | |
2845 | ||
2846 | /* Interleave this node? */ | |
2847 | if ((total_pages << PAGE_SHIFT) >= (16 << 20)) | |
2848 | node_set(nid, interleave_nodes); | |
2849 | } | |
2850 | ||
2851 | /* All too small, use the largest */ | |
2852 | if (unlikely(nodes_empty(interleave_nodes))) | |
2853 | node_set(prefer, interleave_nodes); | |
1da177e4 | 2854 | |
028fec41 | 2855 | if (do_set_mempolicy(MPOL_INTERLEAVE, 0, &interleave_nodes)) |
b1de0d13 | 2856 | pr_err("%s: interleaving failed\n", __func__); |
1a687c2e MG |
2857 | |
2858 | check_numabalancing_enable(); | |
1da177e4 LT |
2859 | } |
2860 | ||
8bccd85f | 2861 | /* Reset policy of current process to default */ |
1da177e4 LT |
2862 | void numa_default_policy(void) |
2863 | { | |
028fec41 | 2864 | do_set_mempolicy(MPOL_DEFAULT, 0, NULL); |
1da177e4 | 2865 | } |
68860ec1 | 2866 | |
095f1fc4 LS |
2867 | /* |
2868 | * Parse and format mempolicy from/to strings | |
2869 | */ | |
2870 | ||
1a75a6c8 | 2871 | /* |
f2a07f40 | 2872 | * "local" is implemented internally by MPOL_PREFERRED with MPOL_F_LOCAL flag. |
1a75a6c8 | 2873 | */ |
345ace9c LS |
2874 | static const char * const policy_modes[] = |
2875 | { | |
2876 | [MPOL_DEFAULT] = "default", | |
2877 | [MPOL_PREFERRED] = "prefer", | |
2878 | [MPOL_BIND] = "bind", | |
2879 | [MPOL_INTERLEAVE] = "interleave", | |
d3a71033 | 2880 | [MPOL_LOCAL] = "local", |
345ace9c | 2881 | }; |
1a75a6c8 | 2882 | |
095f1fc4 LS |
2883 | |
2884 | #ifdef CONFIG_TMPFS | |
2885 | /** | |
f2a07f40 | 2886 | * mpol_parse_str - parse string to mempolicy, for tmpfs mpol mount option. |
095f1fc4 | 2887 | * @str: string containing mempolicy to parse |
71fe804b | 2888 | * @mpol: pointer to struct mempolicy pointer, returned on success. |
095f1fc4 LS |
2889 | * |
2890 | * Format of input: | |
2891 | * <mode>[=<flags>][:<nodelist>] | |
2892 | * | |
71fe804b | 2893 | * On success, returns 0, else 1 |
095f1fc4 | 2894 | */ |
a7a88b23 | 2895 | int mpol_parse_str(char *str, struct mempolicy **mpol) |
095f1fc4 | 2896 | { |
71fe804b | 2897 | struct mempolicy *new = NULL; |
f2a07f40 | 2898 | unsigned short mode_flags; |
71fe804b | 2899 | nodemask_t nodes; |
095f1fc4 LS |
2900 | char *nodelist = strchr(str, ':'); |
2901 | char *flags = strchr(str, '='); | |
dedf2c73 | 2902 | int err = 1, mode; |
095f1fc4 | 2903 | |
c7a91bc7 DC |
2904 | if (flags) |
2905 | *flags++ = '\0'; /* terminate mode string */ | |
2906 | ||
095f1fc4 LS |
2907 | if (nodelist) { |
2908 | /* NUL-terminate mode or flags string */ | |
2909 | *nodelist++ = '\0'; | |
71fe804b | 2910 | if (nodelist_parse(nodelist, nodes)) |
095f1fc4 | 2911 | goto out; |
01f13bd6 | 2912 | if (!nodes_subset(nodes, node_states[N_MEMORY])) |
095f1fc4 | 2913 | goto out; |
71fe804b LS |
2914 | } else |
2915 | nodes_clear(nodes); | |
2916 | ||
dedf2c73 | 2917 | mode = match_string(policy_modes, MPOL_MAX, str); |
2918 | if (mode < 0) | |
095f1fc4 LS |
2919 | goto out; |
2920 | ||
71fe804b | 2921 | switch (mode) { |
095f1fc4 | 2922 | case MPOL_PREFERRED: |
71fe804b | 2923 | /* |
aa9f7d51 RD |
2924 | * Insist on a nodelist of one node only, although later |
2925 | * we use first_node(nodes) to grab a single node, so here | |
2926 | * nodelist (or nodes) cannot be empty. | |
71fe804b | 2927 | */ |
095f1fc4 LS |
2928 | if (nodelist) { |
2929 | char *rest = nodelist; | |
2930 | while (isdigit(*rest)) | |
2931 | rest++; | |
926f2ae0 KM |
2932 | if (*rest) |
2933 | goto out; | |
aa9f7d51 RD |
2934 | if (nodes_empty(nodes)) |
2935 | goto out; | |
095f1fc4 LS |
2936 | } |
2937 | break; | |
095f1fc4 LS |
2938 | case MPOL_INTERLEAVE: |
2939 | /* | |
2940 | * Default to online nodes with memory if no nodelist | |
2941 | */ | |
2942 | if (!nodelist) | |
01f13bd6 | 2943 | nodes = node_states[N_MEMORY]; |
3f226aa1 | 2944 | break; |
71fe804b | 2945 | case MPOL_LOCAL: |
3f226aa1 | 2946 | /* |
71fe804b | 2947 | * Don't allow a nodelist; mpol_new() checks flags |
3f226aa1 | 2948 | */ |
71fe804b | 2949 | if (nodelist) |
3f226aa1 | 2950 | goto out; |
71fe804b | 2951 | mode = MPOL_PREFERRED; |
3f226aa1 | 2952 | break; |
413b43de RT |
2953 | case MPOL_DEFAULT: |
2954 | /* | |
2955 | * Insist on a empty nodelist | |
2956 | */ | |
2957 | if (!nodelist) | |
2958 | err = 0; | |
2959 | goto out; | |
d69b2e63 KM |
2960 | case MPOL_BIND: |
2961 | /* | |
2962 | * Insist on a nodelist | |
2963 | */ | |
2964 | if (!nodelist) | |
2965 | goto out; | |
095f1fc4 LS |
2966 | } |
2967 | ||
71fe804b | 2968 | mode_flags = 0; |
095f1fc4 LS |
2969 | if (flags) { |
2970 | /* | |
2971 | * Currently, we only support two mutually exclusive | |
2972 | * mode flags. | |
2973 | */ | |
2974 | if (!strcmp(flags, "static")) | |
71fe804b | 2975 | mode_flags |= MPOL_F_STATIC_NODES; |
095f1fc4 | 2976 | else if (!strcmp(flags, "relative")) |
71fe804b | 2977 | mode_flags |= MPOL_F_RELATIVE_NODES; |
095f1fc4 | 2978 | else |
926f2ae0 | 2979 | goto out; |
095f1fc4 | 2980 | } |
71fe804b LS |
2981 | |
2982 | new = mpol_new(mode, mode_flags, &nodes); | |
2983 | if (IS_ERR(new)) | |
926f2ae0 KM |
2984 | goto out; |
2985 | ||
f2a07f40 HD |
2986 | /* |
2987 | * Save nodes for mpol_to_str() to show the tmpfs mount options | |
2988 | * for /proc/mounts, /proc/pid/mounts and /proc/pid/mountinfo. | |
2989 | */ | |
2990 | if (mode != MPOL_PREFERRED) | |
2991 | new->v.nodes = nodes; | |
2992 | else if (nodelist) | |
2993 | new->v.preferred_node = first_node(nodes); | |
2994 | else | |
2995 | new->flags |= MPOL_F_LOCAL; | |
2996 | ||
2997 | /* | |
2998 | * Save nodes for contextualization: this will be used to "clone" | |
2999 | * the mempolicy in a specific context [cpuset] at a later time. | |
3000 | */ | |
3001 | new->w.user_nodemask = nodes; | |
3002 | ||
926f2ae0 | 3003 | err = 0; |
71fe804b | 3004 | |
095f1fc4 LS |
3005 | out: |
3006 | /* Restore string for error message */ | |
3007 | if (nodelist) | |
3008 | *--nodelist = ':'; | |
3009 | if (flags) | |
3010 | *--flags = '='; | |
71fe804b LS |
3011 | if (!err) |
3012 | *mpol = new; | |
095f1fc4 LS |
3013 | return err; |
3014 | } | |
3015 | #endif /* CONFIG_TMPFS */ | |
3016 | ||
71fe804b LS |
3017 | /** |
3018 | * mpol_to_str - format a mempolicy structure for printing | |
3019 | * @buffer: to contain formatted mempolicy string | |
3020 | * @maxlen: length of @buffer | |
3021 | * @pol: pointer to mempolicy to be formatted | |
71fe804b | 3022 | * |
948927ee DR |
3023 | * Convert @pol into a string. If @buffer is too short, truncate the string. |
3024 | * Recommend a @maxlen of at least 32 for the longest mode, "interleave", the | |
3025 | * longest flag, "relative", and to display at least a few node ids. | |
1a75a6c8 | 3026 | */ |
948927ee | 3027 | void mpol_to_str(char *buffer, int maxlen, struct mempolicy *pol) |
1a75a6c8 CL |
3028 | { |
3029 | char *p = buffer; | |
948927ee DR |
3030 | nodemask_t nodes = NODE_MASK_NONE; |
3031 | unsigned short mode = MPOL_DEFAULT; | |
3032 | unsigned short flags = 0; | |
2291990a | 3033 | |
8790c71a | 3034 | if (pol && pol != &default_policy && !(pol->flags & MPOL_F_MORON)) { |
bea904d5 | 3035 | mode = pol->mode; |
948927ee DR |
3036 | flags = pol->flags; |
3037 | } | |
bea904d5 | 3038 | |
1a75a6c8 CL |
3039 | switch (mode) { |
3040 | case MPOL_DEFAULT: | |
1a75a6c8 | 3041 | break; |
1a75a6c8 | 3042 | case MPOL_PREFERRED: |
fc36b8d3 | 3043 | if (flags & MPOL_F_LOCAL) |
f2a07f40 | 3044 | mode = MPOL_LOCAL; |
53f2556b | 3045 | else |
fc36b8d3 | 3046 | node_set(pol->v.preferred_node, nodes); |
1a75a6c8 | 3047 | break; |
1a75a6c8 | 3048 | case MPOL_BIND: |
1a75a6c8 | 3049 | case MPOL_INTERLEAVE: |
f2a07f40 | 3050 | nodes = pol->v.nodes; |
1a75a6c8 | 3051 | break; |
1a75a6c8 | 3052 | default: |
948927ee DR |
3053 | WARN_ON_ONCE(1); |
3054 | snprintf(p, maxlen, "unknown"); | |
3055 | return; | |
1a75a6c8 CL |
3056 | } |
3057 | ||
b7a9f420 | 3058 | p += snprintf(p, maxlen, "%s", policy_modes[mode]); |
1a75a6c8 | 3059 | |
fc36b8d3 | 3060 | if (flags & MPOL_MODE_FLAGS) { |
948927ee | 3061 | p += snprintf(p, buffer + maxlen - p, "="); |
f5b087b5 | 3062 | |
2291990a LS |
3063 | /* |
3064 | * Currently, the only defined flags are mutually exclusive | |
3065 | */ | |
f5b087b5 | 3066 | if (flags & MPOL_F_STATIC_NODES) |
2291990a LS |
3067 | p += snprintf(p, buffer + maxlen - p, "static"); |
3068 | else if (flags & MPOL_F_RELATIVE_NODES) | |
3069 | p += snprintf(p, buffer + maxlen - p, "relative"); | |
f5b087b5 DR |
3070 | } |
3071 | ||
9e763e0f TH |
3072 | if (!nodes_empty(nodes)) |
3073 | p += scnprintf(p, buffer + maxlen - p, ":%*pbl", | |
3074 | nodemask_pr_args(&nodes)); | |
1a75a6c8 | 3075 | } |