blob: c94e58b192c3c9913f4f4ab57860b6ac9469f839 [file] [log] [blame]
Linus Torvalds1da177e2005-04-16 15:20:36 -07001/*
2 * Simple NUMA memory policy for the Linux kernel.
3 *
4 * Copyright 2003,2004 Andi Kleen, SuSE Labs.
Christoph Lameter8bccd852005-10-29 18:16:59 -07005 * (C) Copyright 2005 Christoph Lameter, Silicon Graphics, Inc.
Linus Torvalds1da177e2005-04-16 15:20:36 -07006 * Subject to the GNU Public License, version 2.
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.
Christoph Lameter8bccd852005-10-29 18:16:59 -070021 *
Linus Torvalds1da177e2005-04-16 15:20:36 -070022 * bind Only allocate memory on a specific set of nodes,
23 * no fallback.
Christoph Lameter8bccd852005-10-29 18:16:59 -070024 * 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 *
Linus Torvalds1da177e2005-04-16 15:20:36 -070028 * preferred Try a specific node first before normal fallback.
29 * As a special case node -1 here means do the allocation
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.
Christoph Lameter8bccd852005-10-29 18:16:59 -070033 *
Linus Torvalds1da177e2005-04-16 15:20:36 -070034 * 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.
Linus Torvalds1da177e2005-04-16 15:20:36 -070066*/
67
68#include <linux/mempolicy.h>
69#include <linux/mm.h>
70#include <linux/highmem.h>
71#include <linux/hugetlb.h>
72#include <linux/kernel.h>
73#include <linux/sched.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070074#include <linux/nodemask.h>
75#include <linux/cpuset.h>
76#include <linux/gfp.h>
77#include <linux/slab.h>
78#include <linux/string.h>
79#include <linux/module.h>
Pavel Emelyanovb4888932007-10-18 23:40:14 -070080#include <linux/nsproxy.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070081#include <linux/interrupt.h>
82#include <linux/init.h>
83#include <linux/compat.h>
Christoph Lameterdc9aa5b2006-01-08 01:00:50 -080084#include <linux/swap.h>
Christoph Lameter1a75a6c2006-01-08 01:01:02 -080085#include <linux/seq_file.h>
86#include <linux/proc_fs.h>
Christoph Lameterb20a3502006-03-22 00:09:12 -080087#include <linux/migrate.h>
Christoph Lameter95a402c2006-06-23 02:03:53 -070088#include <linux/rmap.h>
David Quigley86c3a762006-06-23 02:04:02 -070089#include <linux/security.h>
Adrian Bunkdbcb0f12007-10-16 01:26:26 -070090#include <linux/syscalls.h>
Lee Schermerhorn095f1fc2008-04-28 02:13:23 -070091#include <linux/ctype.h>
Christoph Lameterdc9aa5b2006-01-08 01:00:50 -080092
Linus Torvalds1da177e2005-04-16 15:20:36 -070093#include <asm/tlbflush.h>
94#include <asm/uaccess.h>
95
Christoph Lameter38e35862006-01-08 01:01:01 -080096/* Internal flags */
Christoph Lameterdc9aa5b2006-01-08 01:00:50 -080097#define MPOL_MF_DISCONTIG_OK (MPOL_MF_INTERNAL << 0) /* Skip checks for continuous vmas */
Christoph Lameter38e35862006-01-08 01:01:01 -080098#define MPOL_MF_INVERT (MPOL_MF_INTERNAL << 1) /* Invert check for nodemask */
Christoph Lameter1a75a6c2006-01-08 01:01:02 -080099#define MPOL_MF_STATS (MPOL_MF_INTERNAL << 2) /* Gather statistics */
Christoph Lameterdc9aa5b2006-01-08 01:00:50 -0800100
Pekka Enbergfcc234f2006-03-22 00:08:13 -0800101static struct kmem_cache *policy_cache;
102static struct kmem_cache *sn_cache;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700103
Linus Torvalds1da177e2005-04-16 15:20:36 -0700104/* Highest zone. An specific allocation for a zone below that is not
105 policied. */
Christoph Lameter62672762007-02-10 01:43:07 -0800106enum zone_type policy_zone = 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700107
Lee Schermerhornbea904d2008-04-28 02:13:18 -0700108/*
109 * run-time system-wide default policy => local allocation
110 */
Andi Kleend42c6992005-07-06 19:56:03 +0200111struct mempolicy default_policy = {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700112 .refcnt = ATOMIC_INIT(1), /* never free it */
Lee Schermerhornbea904d2008-04-28 02:13:18 -0700113 .mode = MPOL_PREFERRED,
Lee Schermerhornfc36b8d2008-04-28 02:13:21 -0700114 .flags = MPOL_F_LOCAL,
Linus Torvalds1da177e2005-04-16 15:20:36 -0700115};
116
David Rientjes37012942008-04-28 02:12:33 -0700117static const struct mempolicy_operations {
118 int (*create)(struct mempolicy *pol, const nodemask_t *nodes);
119 void (*rebind)(struct mempolicy *pol, const nodemask_t *nodes);
120} mpol_ops[MPOL_MAX];
121
Mel Gorman19770b32008-04-28 02:12:18 -0700122/* Check that the nodemask contains at least one populated zone */
David Rientjes37012942008-04-28 02:12:33 -0700123static int is_valid_nodemask(const nodemask_t *nodemask)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700124{
Mel Gorman19770b32008-04-28 02:12:18 -0700125 int nd, k;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700126
Mel Gorman19770b32008-04-28 02:12:18 -0700127 /* Check that there is something useful in this mask */
128 k = policy_zone;
129
130 for_each_node_mask(nd, *nodemask) {
131 struct zone *z;
132
133 for (k = 0; k <= policy_zone; k++) {
134 z = &NODE_DATA(nd)->node_zones[k];
135 if (z->present_pages > 0)
136 return 1;
Andi Kleendd942ae2006-02-17 01:39:16 +0100137 }
138 }
Mel Gorman19770b32008-04-28 02:12:18 -0700139
140 return 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700141}
142
David Rientjesf5b087b2008-04-28 02:12:27 -0700143static inline int mpol_store_user_nodemask(const struct mempolicy *pol)
144{
David Rientjes4c50bc02008-04-28 02:12:30 -0700145 return pol->flags & (MPOL_F_STATIC_NODES | MPOL_F_RELATIVE_NODES);
146}
147
148static void mpol_relative_nodemask(nodemask_t *ret, const nodemask_t *orig,
149 const nodemask_t *rel)
150{
151 nodemask_t tmp;
152 nodes_fold(tmp, *orig, nodes_weight(*rel));
153 nodes_onto(*ret, tmp, *rel);
David Rientjesf5b087b2008-04-28 02:12:27 -0700154}
155
David Rientjes37012942008-04-28 02:12:33 -0700156static int mpol_new_interleave(struct mempolicy *pol, const nodemask_t *nodes)
157{
158 if (nodes_empty(*nodes))
159 return -EINVAL;
160 pol->v.nodes = *nodes;
161 return 0;
162}
163
164static int mpol_new_preferred(struct mempolicy *pol, const nodemask_t *nodes)
165{
166 if (!nodes)
Lee Schermerhornfc36b8d2008-04-28 02:13:21 -0700167 pol->flags |= MPOL_F_LOCAL; /* local allocation */
David Rientjes37012942008-04-28 02:12:33 -0700168 else if (nodes_empty(*nodes))
169 return -EINVAL; /* no allowed nodes */
170 else
171 pol->v.preferred_node = first_node(*nodes);
172 return 0;
173}
174
175static int mpol_new_bind(struct mempolicy *pol, const nodemask_t *nodes)
176{
177 if (!is_valid_nodemask(nodes))
178 return -EINVAL;
179 pol->v.nodes = *nodes;
180 return 0;
181}
182
Linus Torvalds1da177e2005-04-16 15:20:36 -0700183/* Create a new policy */
David Rientjes028fec42008-04-28 02:12:25 -0700184static struct mempolicy *mpol_new(unsigned short mode, unsigned short flags,
185 nodemask_t *nodes)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700186{
187 struct mempolicy *policy;
David Rientjesf5b087b2008-04-28 02:12:27 -0700188 nodemask_t cpuset_context_nmask;
David Rientjes37012942008-04-28 02:12:33 -0700189 int ret;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700190
David Rientjes028fec42008-04-28 02:12:25 -0700191 pr_debug("setting mode %d flags %d nodes[0] %lx\n",
192 mode, flags, nodes ? nodes_addr(*nodes)[0] : -1);
Paul Mundt140d5a42007-07-15 23:38:16 -0700193
David Rientjes3e1f0642008-04-28 02:12:34 -0700194 if (mode == MPOL_DEFAULT) {
195 if (nodes && !nodes_empty(*nodes))
David Rientjes37012942008-04-28 02:12:33 -0700196 return ERR_PTR(-EINVAL);
Lee Schermerhornbea904d2008-04-28 02:13:18 -0700197 return NULL; /* simply delete any existing policy */
David Rientjes37012942008-04-28 02:12:33 -0700198 }
David Rientjes3e1f0642008-04-28 02:12:34 -0700199 VM_BUG_ON(!nodes);
200
201 /*
202 * MPOL_PREFERRED cannot be used with MPOL_F_STATIC_NODES or
203 * MPOL_F_RELATIVE_NODES if the nodemask is empty (local allocation).
204 * All other modes require a valid pointer to a non-empty nodemask.
205 */
206 if (mode == MPOL_PREFERRED) {
207 if (nodes_empty(*nodes)) {
208 if (((flags & MPOL_F_STATIC_NODES) ||
209 (flags & MPOL_F_RELATIVE_NODES)))
210 return ERR_PTR(-EINVAL);
211 nodes = NULL; /* flag local alloc */
212 }
213 } else if (nodes_empty(*nodes))
214 return ERR_PTR(-EINVAL);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700215 policy = kmem_cache_alloc(policy_cache, GFP_KERNEL);
216 if (!policy)
217 return ERR_PTR(-ENOMEM);
218 atomic_set(&policy->refcnt, 1);
Lee Schermerhorn45c47452008-04-28 02:13:12 -0700219 policy->mode = mode;
David Rientjes3e1f0642008-04-28 02:12:34 -0700220 policy->flags = flags;
David Rientjesf5b087b2008-04-28 02:12:27 -0700221
David Rientjes3e1f0642008-04-28 02:12:34 -0700222 if (nodes) {
223 /*
224 * cpuset related setup doesn't apply to local allocation
225 */
David Rientjes37012942008-04-28 02:12:33 -0700226 cpuset_update_task_memory_state();
227 if (flags & MPOL_F_RELATIVE_NODES)
228 mpol_relative_nodemask(&cpuset_context_nmask, nodes,
229 &cpuset_current_mems_allowed);
230 else
231 nodes_and(cpuset_context_nmask, *nodes,
232 cpuset_current_mems_allowed);
233 if (mpol_store_user_nodemask(policy))
234 policy->w.user_nodemask = *nodes;
235 else
236 policy->w.cpuset_mems_allowed =
237 cpuset_mems_allowed(current);
238 }
239
240 ret = mpol_ops[mode].create(policy,
David Rientjes3e1f0642008-04-28 02:12:34 -0700241 nodes ? &cpuset_context_nmask : NULL);
David Rientjes37012942008-04-28 02:12:33 -0700242 if (ret < 0) {
243 kmem_cache_free(policy_cache, policy);
244 return ERR_PTR(ret);
245 }
246 return policy;
247}
248
Lee Schermerhorn52cd3b02008-04-28 02:13:16 -0700249/* Slow path of a mpol destructor. */
250void __mpol_put(struct mempolicy *p)
251{
252 if (!atomic_dec_and_test(&p->refcnt))
253 return;
Lee Schermerhorn52cd3b02008-04-28 02:13:16 -0700254 kmem_cache_free(policy_cache, p);
255}
256
David Rientjes37012942008-04-28 02:12:33 -0700257static void mpol_rebind_default(struct mempolicy *pol, const nodemask_t *nodes)
258{
259}
260
261static void mpol_rebind_nodemask(struct mempolicy *pol,
262 const nodemask_t *nodes)
263{
264 nodemask_t tmp;
265
266 if (pol->flags & MPOL_F_STATIC_NODES)
267 nodes_and(tmp, pol->w.user_nodemask, *nodes);
268 else if (pol->flags & MPOL_F_RELATIVE_NODES)
269 mpol_relative_nodemask(&tmp, &pol->w.user_nodemask, nodes);
270 else {
271 nodes_remap(tmp, pol->v.nodes, pol->w.cpuset_mems_allowed,
272 *nodes);
273 pol->w.cpuset_mems_allowed = *nodes;
274 }
275
276 pol->v.nodes = tmp;
277 if (!node_isset(current->il_next, tmp)) {
278 current->il_next = next_node(current->il_next, tmp);
279 if (current->il_next >= MAX_NUMNODES)
280 current->il_next = first_node(tmp);
281 if (current->il_next >= MAX_NUMNODES)
282 current->il_next = numa_node_id();
283 }
284}
285
286static void mpol_rebind_preferred(struct mempolicy *pol,
287 const nodemask_t *nodes)
288{
289 nodemask_t tmp;
290
David Rientjes37012942008-04-28 02:12:33 -0700291 if (pol->flags & MPOL_F_STATIC_NODES) {
292 int node = first_node(pol->w.user_nodemask);
293
Lee Schermerhornfc36b8d2008-04-28 02:13:21 -0700294 if (node_isset(node, *nodes)) {
David Rientjes37012942008-04-28 02:12:33 -0700295 pol->v.preferred_node = node;
Lee Schermerhornfc36b8d2008-04-28 02:13:21 -0700296 pol->flags &= ~MPOL_F_LOCAL;
297 } else
298 pol->flags |= MPOL_F_LOCAL;
David Rientjes37012942008-04-28 02:12:33 -0700299 } else if (pol->flags & MPOL_F_RELATIVE_NODES) {
300 mpol_relative_nodemask(&tmp, &pol->w.user_nodemask, nodes);
301 pol->v.preferred_node = first_node(tmp);
Lee Schermerhornfc36b8d2008-04-28 02:13:21 -0700302 } else if (!(pol->flags & MPOL_F_LOCAL)) {
David Rientjes37012942008-04-28 02:12:33 -0700303 pol->v.preferred_node = node_remap(pol->v.preferred_node,
304 pol->w.cpuset_mems_allowed,
305 *nodes);
306 pol->w.cpuset_mems_allowed = *nodes;
307 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700308}
309
David Rientjes1d0d2682008-04-28 02:12:32 -0700310/* Migrate a policy to a different set of nodes */
311static void mpol_rebind_policy(struct mempolicy *pol,
312 const nodemask_t *newmask)
313{
David Rientjes1d0d2682008-04-28 02:12:32 -0700314 if (!pol)
315 return;
David Rientjes1d0d2682008-04-28 02:12:32 -0700316 if (!mpol_store_user_nodemask(pol) &&
317 nodes_equal(pol->w.cpuset_mems_allowed, *newmask))
318 return;
Lee Schermerhorn45c47452008-04-28 02:13:12 -0700319 mpol_ops[pol->mode].rebind(pol, newmask);
David Rientjes1d0d2682008-04-28 02:12:32 -0700320}
321
322/*
323 * Wrapper for mpol_rebind_policy() that just requires task
324 * pointer, and updates task mempolicy.
325 */
326
327void mpol_rebind_task(struct task_struct *tsk, const nodemask_t *new)
328{
329 mpol_rebind_policy(tsk->mempolicy, new);
330}
331
332/*
333 * Rebind each vma in mm to new nodemask.
334 *
335 * Call holding a reference to mm. Takes mm->mmap_sem during call.
336 */
337
338void mpol_rebind_mm(struct mm_struct *mm, nodemask_t *new)
339{
340 struct vm_area_struct *vma;
341
342 down_write(&mm->mmap_sem);
343 for (vma = mm->mmap; vma; vma = vma->vm_next)
344 mpol_rebind_policy(vma->vm_policy, new);
345 up_write(&mm->mmap_sem);
346}
347
David Rientjes37012942008-04-28 02:12:33 -0700348static const struct mempolicy_operations mpol_ops[MPOL_MAX] = {
349 [MPOL_DEFAULT] = {
350 .rebind = mpol_rebind_default,
351 },
352 [MPOL_INTERLEAVE] = {
353 .create = mpol_new_interleave,
354 .rebind = mpol_rebind_nodemask,
355 },
356 [MPOL_PREFERRED] = {
357 .create = mpol_new_preferred,
358 .rebind = mpol_rebind_preferred,
359 },
360 [MPOL_BIND] = {
361 .create = mpol_new_bind,
362 .rebind = mpol_rebind_nodemask,
363 },
364};
365
Christoph Lameter397874d2006-03-06 15:42:53 -0800366static void gather_stats(struct page *, void *, int pte_dirty);
Christoph Lameterfc301282006-01-18 17:42:29 -0800367static void migrate_page_add(struct page *page, struct list_head *pagelist,
368 unsigned long flags);
Christoph Lameter1a75a6c2006-01-08 01:01:02 -0800369
Christoph Lameter38e35862006-01-08 01:01:01 -0800370/* Scan through pages checking if pages follow certain conditions. */
Nick Pigginb5810032005-10-29 18:16:12 -0700371static int check_pte_range(struct vm_area_struct *vma, pmd_t *pmd,
Christoph Lameterdc9aa5b2006-01-08 01:00:50 -0800372 unsigned long addr, unsigned long end,
373 const nodemask_t *nodes, unsigned long flags,
Christoph Lameter38e35862006-01-08 01:01:01 -0800374 void *private)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700375{
Hugh Dickins91612e02005-06-21 17:15:07 -0700376 pte_t *orig_pte;
377 pte_t *pte;
Hugh Dickins705e87c2005-10-29 18:16:27 -0700378 spinlock_t *ptl;
Hugh Dickins941150a2005-06-21 17:15:06 -0700379
Hugh Dickins705e87c2005-10-29 18:16:27 -0700380 orig_pte = pte = pte_offset_map_lock(vma->vm_mm, pmd, addr, &ptl);
Hugh Dickins91612e02005-06-21 17:15:07 -0700381 do {
Linus Torvalds6aab3412005-11-28 14:34:23 -0800382 struct page *page;
Andy Whitcroft25ba77c2006-12-06 20:33:03 -0800383 int nid;
Hugh Dickins91612e02005-06-21 17:15:07 -0700384
385 if (!pte_present(*pte))
Linus Torvalds1da177e2005-04-16 15:20:36 -0700386 continue;
Linus Torvalds6aab3412005-11-28 14:34:23 -0800387 page = vm_normal_page(vma, addr, *pte);
388 if (!page)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700389 continue;
Nick Piggin053837f2006-01-18 17:42:27 -0800390 /*
391 * The check for PageReserved here is important to avoid
392 * handling zero pages and other pages that may have been
393 * marked special by the system.
394 *
395 * If the PageReserved would not be checked here then f.e.
396 * the location of the zero page could have an influence
397 * on MPOL_MF_STRICT, zero pages would be counted for
398 * the per node stats, and there would be useless attempts
399 * to put zero pages on the migration list.
400 */
Christoph Lameterf4598c82006-01-12 01:05:20 -0800401 if (PageReserved(page))
402 continue;
Linus Torvalds6aab3412005-11-28 14:34:23 -0800403 nid = page_to_nid(page);
Christoph Lameter38e35862006-01-08 01:01:01 -0800404 if (node_isset(nid, *nodes) == !!(flags & MPOL_MF_INVERT))
405 continue;
406
Christoph Lameter1a75a6c2006-01-08 01:01:02 -0800407 if (flags & MPOL_MF_STATS)
Christoph Lameter397874d2006-03-06 15:42:53 -0800408 gather_stats(page, private, pte_dirty(*pte));
Nick Piggin053837f2006-01-18 17:42:27 -0800409 else if (flags & (MPOL_MF_MOVE | MPOL_MF_MOVE_ALL))
Christoph Lameterfc301282006-01-18 17:42:29 -0800410 migrate_page_add(page, private, flags);
Christoph Lameter38e35862006-01-08 01:01:01 -0800411 else
412 break;
Hugh Dickins91612e02005-06-21 17:15:07 -0700413 } while (pte++, addr += PAGE_SIZE, addr != end);
Hugh Dickins705e87c2005-10-29 18:16:27 -0700414 pte_unmap_unlock(orig_pte, ptl);
Hugh Dickins91612e02005-06-21 17:15:07 -0700415 return addr != end;
416}
417
Nick Pigginb5810032005-10-29 18:16:12 -0700418static inline int check_pmd_range(struct vm_area_struct *vma, pud_t *pud,
Christoph Lameterdc9aa5b2006-01-08 01:00:50 -0800419 unsigned long addr, unsigned long end,
420 const nodemask_t *nodes, unsigned long flags,
Christoph Lameter38e35862006-01-08 01:01:01 -0800421 void *private)
Hugh Dickins91612e02005-06-21 17:15:07 -0700422{
423 pmd_t *pmd;
424 unsigned long next;
425
426 pmd = pmd_offset(pud, addr);
427 do {
428 next = pmd_addr_end(addr, end);
429 if (pmd_none_or_clear_bad(pmd))
430 continue;
Christoph Lameterdc9aa5b2006-01-08 01:00:50 -0800431 if (check_pte_range(vma, pmd, addr, next, nodes,
Christoph Lameter38e35862006-01-08 01:01:01 -0800432 flags, private))
Hugh Dickins91612e02005-06-21 17:15:07 -0700433 return -EIO;
434 } while (pmd++, addr = next, addr != end);
435 return 0;
436}
437
Nick Pigginb5810032005-10-29 18:16:12 -0700438static inline int check_pud_range(struct vm_area_struct *vma, pgd_t *pgd,
Christoph Lameterdc9aa5b2006-01-08 01:00:50 -0800439 unsigned long addr, unsigned long end,
440 const nodemask_t *nodes, unsigned long flags,
Christoph Lameter38e35862006-01-08 01:01:01 -0800441 void *private)
Hugh Dickins91612e02005-06-21 17:15:07 -0700442{
443 pud_t *pud;
444 unsigned long next;
445
446 pud = pud_offset(pgd, addr);
447 do {
448 next = pud_addr_end(addr, end);
449 if (pud_none_or_clear_bad(pud))
450 continue;
Christoph Lameterdc9aa5b2006-01-08 01:00:50 -0800451 if (check_pmd_range(vma, pud, addr, next, nodes,
Christoph Lameter38e35862006-01-08 01:01:01 -0800452 flags, private))
Hugh Dickins91612e02005-06-21 17:15:07 -0700453 return -EIO;
454 } while (pud++, addr = next, addr != end);
455 return 0;
456}
457
Nick Pigginb5810032005-10-29 18:16:12 -0700458static inline int check_pgd_range(struct vm_area_struct *vma,
Christoph Lameterdc9aa5b2006-01-08 01:00:50 -0800459 unsigned long addr, unsigned long end,
460 const nodemask_t *nodes, unsigned long flags,
Christoph Lameter38e35862006-01-08 01:01:01 -0800461 void *private)
Hugh Dickins91612e02005-06-21 17:15:07 -0700462{
463 pgd_t *pgd;
464 unsigned long next;
465
Nick Pigginb5810032005-10-29 18:16:12 -0700466 pgd = pgd_offset(vma->vm_mm, addr);
Hugh Dickins91612e02005-06-21 17:15:07 -0700467 do {
468 next = pgd_addr_end(addr, end);
469 if (pgd_none_or_clear_bad(pgd))
470 continue;
Christoph Lameterdc9aa5b2006-01-08 01:00:50 -0800471 if (check_pud_range(vma, pgd, addr, next, nodes,
Christoph Lameter38e35862006-01-08 01:01:01 -0800472 flags, private))
Hugh Dickins91612e02005-06-21 17:15:07 -0700473 return -EIO;
474 } while (pgd++, addr = next, addr != end);
475 return 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700476}
477
Christoph Lameterdc9aa5b2006-01-08 01:00:50 -0800478/*
479 * Check if all pages in a range are on a set of nodes.
480 * If pagelist != NULL then isolate pages from the LRU and
481 * put them on the pagelist.
482 */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700483static struct vm_area_struct *
484check_range(struct mm_struct *mm, unsigned long start, unsigned long end,
Christoph Lameter38e35862006-01-08 01:01:01 -0800485 const nodemask_t *nodes, unsigned long flags, void *private)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700486{
487 int err;
488 struct vm_area_struct *first, *vma, *prev;
489
Christoph Lameter90036ee2006-03-16 23:03:59 -0800490 if (flags & (MPOL_MF_MOVE | MPOL_MF_MOVE_ALL)) {
Christoph Lameter90036ee2006-03-16 23:03:59 -0800491
Christoph Lameterb20a3502006-03-22 00:09:12 -0800492 err = migrate_prep();
493 if (err)
494 return ERR_PTR(err);
Christoph Lameter90036ee2006-03-16 23:03:59 -0800495 }
Nick Piggin053837f2006-01-18 17:42:27 -0800496
Linus Torvalds1da177e2005-04-16 15:20:36 -0700497 first = find_vma(mm, start);
498 if (!first)
499 return ERR_PTR(-EFAULT);
500 prev = NULL;
501 for (vma = first; vma && vma->vm_start < end; vma = vma->vm_next) {
Christoph Lameterdc9aa5b2006-01-08 01:00:50 -0800502 if (!(flags & MPOL_MF_DISCONTIG_OK)) {
503 if (!vma->vm_next && vma->vm_end < end)
504 return ERR_PTR(-EFAULT);
505 if (prev && prev->vm_end < vma->vm_start)
506 return ERR_PTR(-EFAULT);
507 }
508 if (!is_vm_hugetlb_page(vma) &&
509 ((flags & MPOL_MF_STRICT) ||
510 ((flags & (MPOL_MF_MOVE | MPOL_MF_MOVE_ALL)) &&
511 vma_migratable(vma)))) {
Andi Kleen5b952b32005-09-13 01:25:08 -0700512 unsigned long endvma = vma->vm_end;
Christoph Lameterdc9aa5b2006-01-08 01:00:50 -0800513
Andi Kleen5b952b32005-09-13 01:25:08 -0700514 if (endvma > end)
515 endvma = end;
516 if (vma->vm_start > start)
517 start = vma->vm_start;
Christoph Lameterdc9aa5b2006-01-08 01:00:50 -0800518 err = check_pgd_range(vma, start, endvma, nodes,
Christoph Lameter38e35862006-01-08 01:01:01 -0800519 flags, private);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700520 if (err) {
521 first = ERR_PTR(err);
522 break;
523 }
524 }
525 prev = vma;
526 }
527 return first;
528}
529
530/* Apply policy to a single VMA */
531static int policy_vma(struct vm_area_struct *vma, struct mempolicy *new)
532{
533 int err = 0;
534 struct mempolicy *old = vma->vm_policy;
535
Paul Mundt140d5a42007-07-15 23:38:16 -0700536 pr_debug("vma %lx-%lx/%lx vm_ops %p vm_file %p set_policy %p\n",
Linus Torvalds1da177e2005-04-16 15:20:36 -0700537 vma->vm_start, vma->vm_end, vma->vm_pgoff,
538 vma->vm_ops, vma->vm_file,
539 vma->vm_ops ? vma->vm_ops->set_policy : NULL);
540
541 if (vma->vm_ops && vma->vm_ops->set_policy)
542 err = vma->vm_ops->set_policy(vma, new);
543 if (!err) {
544 mpol_get(new);
545 vma->vm_policy = new;
Lee Schermerhornf0be3d32008-04-28 02:13:08 -0700546 mpol_put(old);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700547 }
548 return err;
549}
550
551/* Step 2: apply policy to a range and do splits. */
552static int mbind_range(struct vm_area_struct *vma, unsigned long start,
553 unsigned long end, struct mempolicy *new)
554{
555 struct vm_area_struct *next;
556 int err;
557
558 err = 0;
559 for (; vma && vma->vm_start < end; vma = next) {
560 next = vma->vm_next;
561 if (vma->vm_start < start)
562 err = split_vma(vma->vm_mm, vma, start, 1);
563 if (!err && vma->vm_end > end)
564 err = split_vma(vma->vm_mm, vma, end, 0);
565 if (!err)
566 err = policy_vma(vma, new);
567 if (err)
568 break;
569 }
570 return err;
571}
572
Paul Jacksonc61afb12006-03-24 03:16:08 -0800573/*
574 * Update task->flags PF_MEMPOLICY bit: set iff non-default
575 * mempolicy. Allows more rapid checking of this (combined perhaps
576 * with other PF_* flag bits) on memory allocation hot code paths.
577 *
578 * If called from outside this file, the task 'p' should -only- be
579 * a newly forked child not yet visible on the task list, because
580 * manipulating the task flags of a visible task is not safe.
581 *
582 * The above limitation is why this routine has the funny name
583 * mpol_fix_fork_child_flag().
584 *
585 * It is also safe to call this with a task pointer of current,
586 * which the static wrapper mpol_set_task_struct_flag() does,
587 * for use within this file.
588 */
589
590void mpol_fix_fork_child_flag(struct task_struct *p)
591{
592 if (p->mempolicy)
593 p->flags |= PF_MEMPOLICY;
594 else
595 p->flags &= ~PF_MEMPOLICY;
596}
597
598static void mpol_set_task_struct_flag(void)
599{
600 mpol_fix_fork_child_flag(current);
601}
602
Linus Torvalds1da177e2005-04-16 15:20:36 -0700603/* Set the process memory policy */
David Rientjes028fec42008-04-28 02:12:25 -0700604static long do_set_mempolicy(unsigned short mode, unsigned short flags,
605 nodemask_t *nodes)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700606{
Linus Torvalds1da177e2005-04-16 15:20:36 -0700607 struct mempolicy *new;
Lee Schermerhornf4e53d92008-04-28 02:13:10 -0700608 struct mm_struct *mm = current->mm;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700609
David Rientjes028fec42008-04-28 02:12:25 -0700610 new = mpol_new(mode, flags, nodes);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700611 if (IS_ERR(new))
612 return PTR_ERR(new);
Lee Schermerhornf4e53d92008-04-28 02:13:10 -0700613
614 /*
615 * prevent changing our mempolicy while show_numa_maps()
616 * is using it.
617 * Note: do_set_mempolicy() can be called at init time
618 * with no 'mm'.
619 */
620 if (mm)
621 down_write(&mm->mmap_sem);
Lee Schermerhornf0be3d32008-04-28 02:13:08 -0700622 mpol_put(current->mempolicy);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700623 current->mempolicy = new;
Paul Jacksonc61afb12006-03-24 03:16:08 -0800624 mpol_set_task_struct_flag();
Lee Schermerhorn45c47452008-04-28 02:13:12 -0700625 if (new && new->mode == MPOL_INTERLEAVE &&
David Rientjesf5b087b2008-04-28 02:12:27 -0700626 nodes_weight(new->v.nodes))
Andi Kleendfcd3c02005-10-29 18:15:48 -0700627 current->il_next = first_node(new->v.nodes);
Lee Schermerhornf4e53d92008-04-28 02:13:10 -0700628 if (mm)
629 up_write(&mm->mmap_sem);
630
Linus Torvalds1da177e2005-04-16 15:20:36 -0700631 return 0;
632}
633
Lee Schermerhornbea904d2008-04-28 02:13:18 -0700634/*
635 * Return nodemask for policy for get_mempolicy() query
636 */
637static void get_policy_nodemask(struct mempolicy *p, nodemask_t *nodes)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700638{
Andi Kleendfcd3c02005-10-29 18:15:48 -0700639 nodes_clear(*nodes);
Lee Schermerhornbea904d2008-04-28 02:13:18 -0700640 if (p == &default_policy)
641 return;
642
Lee Schermerhorn45c47452008-04-28 02:13:12 -0700643 switch (p->mode) {
Mel Gorman19770b32008-04-28 02:12:18 -0700644 case MPOL_BIND:
645 /* Fall through */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700646 case MPOL_INTERLEAVE:
Andi Kleendfcd3c02005-10-29 18:15:48 -0700647 *nodes = p->v.nodes;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700648 break;
649 case MPOL_PREFERRED:
Lee Schermerhornfc36b8d2008-04-28 02:13:21 -0700650 if (!(p->flags & MPOL_F_LOCAL))
Andi Kleendfcd3c02005-10-29 18:15:48 -0700651 node_set(p->v.preferred_node, *nodes);
Lee Schermerhorn53f25562008-04-28 02:13:20 -0700652 /* else return empty node mask for local allocation */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700653 break;
654 default:
655 BUG();
656 }
657}
658
659static int lookup_node(struct mm_struct *mm, unsigned long addr)
660{
661 struct page *p;
662 int err;
663
664 err = get_user_pages(current, mm, addr & PAGE_MASK, 1, 0, 0, &p, NULL);
665 if (err >= 0) {
666 err = page_to_nid(p);
667 put_page(p);
668 }
669 return err;
670}
671
Linus Torvalds1da177e2005-04-16 15:20:36 -0700672/* Retrieve NUMA policy */
Adrian Bunkdbcb0f12007-10-16 01:26:26 -0700673static long do_get_mempolicy(int *policy, nodemask_t *nmask,
674 unsigned long addr, unsigned long flags)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700675{
Christoph Lameter8bccd852005-10-29 18:16:59 -0700676 int err;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700677 struct mm_struct *mm = current->mm;
678 struct vm_area_struct *vma = NULL;
679 struct mempolicy *pol = current->mempolicy;
680
Paul Jacksoncf2a473c2006-01-08 01:01:54 -0800681 cpuset_update_task_memory_state();
Lee Schermerhorn754af6f2007-10-16 01:24:51 -0700682 if (flags &
683 ~(unsigned long)(MPOL_F_NODE|MPOL_F_ADDR|MPOL_F_MEMS_ALLOWED))
Linus Torvalds1da177e2005-04-16 15:20:36 -0700684 return -EINVAL;
Lee Schermerhorn754af6f2007-10-16 01:24:51 -0700685
686 if (flags & MPOL_F_MEMS_ALLOWED) {
687 if (flags & (MPOL_F_NODE|MPOL_F_ADDR))
688 return -EINVAL;
689 *policy = 0; /* just so it's initialized */
690 *nmask = cpuset_current_mems_allowed;
691 return 0;
692 }
693
Linus Torvalds1da177e2005-04-16 15:20:36 -0700694 if (flags & MPOL_F_ADDR) {
Lee Schermerhornbea904d2008-04-28 02:13:18 -0700695 /*
696 * Do NOT fall back to task policy if the
697 * vma/shared policy at addr is NULL. We
698 * want to return MPOL_DEFAULT in this case.
699 */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700700 down_read(&mm->mmap_sem);
701 vma = find_vma_intersection(mm, addr, addr+1);
702 if (!vma) {
703 up_read(&mm->mmap_sem);
704 return -EFAULT;
705 }
706 if (vma->vm_ops && vma->vm_ops->get_policy)
707 pol = vma->vm_ops->get_policy(vma, addr);
708 else
709 pol = vma->vm_policy;
710 } else if (addr)
711 return -EINVAL;
712
713 if (!pol)
Lee Schermerhornbea904d2008-04-28 02:13:18 -0700714 pol = &default_policy; /* indicates default behavior */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700715
716 if (flags & MPOL_F_NODE) {
717 if (flags & MPOL_F_ADDR) {
718 err = lookup_node(mm, addr);
719 if (err < 0)
720 goto out;
Christoph Lameter8bccd852005-10-29 18:16:59 -0700721 *policy = err;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700722 } else if (pol == current->mempolicy &&
Lee Schermerhorn45c47452008-04-28 02:13:12 -0700723 pol->mode == MPOL_INTERLEAVE) {
Christoph Lameter8bccd852005-10-29 18:16:59 -0700724 *policy = current->il_next;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700725 } else {
726 err = -EINVAL;
727 goto out;
728 }
Lee Schermerhornbea904d2008-04-28 02:13:18 -0700729 } else {
730 *policy = pol == &default_policy ? MPOL_DEFAULT :
731 pol->mode;
David Rientjesd79df632008-07-04 12:24:13 -0700732 /*
733 * Internal mempolicy flags must be masked off before exposing
734 * the policy to userspace.
735 */
736 *policy |= (pol->flags & MPOL_MODE_FLAGS);
Lee Schermerhornbea904d2008-04-28 02:13:18 -0700737 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700738
739 if (vma) {
740 up_read(&current->mm->mmap_sem);
741 vma = NULL;
742 }
743
Linus Torvalds1da177e2005-04-16 15:20:36 -0700744 err = 0;
Christoph Lameter8bccd852005-10-29 18:16:59 -0700745 if (nmask)
Lee Schermerhornbea904d2008-04-28 02:13:18 -0700746 get_policy_nodemask(pol, nmask);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700747
748 out:
Lee Schermerhorn52cd3b02008-04-28 02:13:16 -0700749 mpol_cond_put(pol);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700750 if (vma)
751 up_read(&current->mm->mmap_sem);
752 return err;
753}
754
Christoph Lameterb20a3502006-03-22 00:09:12 -0800755#ifdef CONFIG_MIGRATION
Christoph Lameter8bccd852005-10-29 18:16:59 -0700756/*
Christoph Lameter6ce3c4c2006-01-08 01:01:04 -0800757 * page migration
758 */
Christoph Lameterfc301282006-01-18 17:42:29 -0800759static void migrate_page_add(struct page *page, struct list_head *pagelist,
760 unsigned long flags)
Christoph Lameter6ce3c4c2006-01-08 01:01:04 -0800761{
762 /*
Christoph Lameterfc301282006-01-18 17:42:29 -0800763 * Avoid migrating a page that is shared with others.
Christoph Lameter6ce3c4c2006-01-08 01:01:04 -0800764 */
Christoph Lameterb20a3502006-03-22 00:09:12 -0800765 if ((flags & MPOL_MF_MOVE_ALL) || page_mapcount(page) == 1)
766 isolate_lru_page(page, pagelist);
Christoph Lameter6ce3c4c2006-01-08 01:01:04 -0800767}
768
Christoph Lameter742755a2006-06-23 02:03:55 -0700769static struct page *new_node_page(struct page *page, unsigned long node, int **x)
Christoph Lameter95a402c2006-06-23 02:03:53 -0700770{
Mel Gorman769848c2007-07-17 04:03:05 -0700771 return alloc_pages_node(node, GFP_HIGHUSER_MOVABLE, 0);
Christoph Lameter95a402c2006-06-23 02:03:53 -0700772}
773
Christoph Lameter6ce3c4c2006-01-08 01:01:04 -0800774/*
Christoph Lameter7e2ab152006-02-01 03:05:40 -0800775 * Migrate pages from one node to a target node.
776 * Returns error or the number of pages not migrated.
777 */
Adrian Bunkdbcb0f12007-10-16 01:26:26 -0700778static int migrate_to_node(struct mm_struct *mm, int source, int dest,
779 int flags)
Christoph Lameter7e2ab152006-02-01 03:05:40 -0800780{
781 nodemask_t nmask;
782 LIST_HEAD(pagelist);
783 int err = 0;
784
785 nodes_clear(nmask);
786 node_set(source, nmask);
787
788 check_range(mm, mm->mmap->vm_start, TASK_SIZE, &nmask,
789 flags | MPOL_MF_DISCONTIG_OK, &pagelist);
790
Christoph Lameteraaa994b2006-06-23 02:03:52 -0700791 if (!list_empty(&pagelist))
Christoph Lameter95a402c2006-06-23 02:03:53 -0700792 err = migrate_pages(&pagelist, new_node_page, dest);
793
Christoph Lameter7e2ab152006-02-01 03:05:40 -0800794 return err;
795}
796
797/*
798 * Move pages between the two nodesets so as to preserve the physical
799 * layout as much as possible.
Christoph Lameter39743882006-01-08 01:00:51 -0800800 *
801 * Returns the number of page that could not be moved.
802 */
803int do_migrate_pages(struct mm_struct *mm,
804 const nodemask_t *from_nodes, const nodemask_t *to_nodes, int flags)
805{
806 LIST_HEAD(pagelist);
Christoph Lameter7e2ab152006-02-01 03:05:40 -0800807 int busy = 0;
808 int err = 0;
809 nodemask_t tmp;
Christoph Lameter39743882006-01-08 01:00:51 -0800810
Lee Schermerhorn53f25562008-04-28 02:13:20 -0700811 down_read(&mm->mmap_sem);
Christoph Lameter39743882006-01-08 01:00:51 -0800812
Christoph Lameter7b2259b2006-06-25 05:46:48 -0700813 err = migrate_vmas(mm, from_nodes, to_nodes, flags);
814 if (err)
815 goto out;
816
Christoph Lameter7e2ab152006-02-01 03:05:40 -0800817/*
818 * Find a 'source' bit set in 'tmp' whose corresponding 'dest'
819 * bit in 'to' is not also set in 'tmp'. Clear the found 'source'
820 * bit in 'tmp', and return that <source, dest> pair for migration.
821 * The pair of nodemasks 'to' and 'from' define the map.
822 *
823 * If no pair of bits is found that way, fallback to picking some
824 * pair of 'source' and 'dest' bits that are not the same. If the
825 * 'source' and 'dest' bits are the same, this represents a node
826 * that will be migrating to itself, so no pages need move.
827 *
828 * If no bits are left in 'tmp', or if all remaining bits left
829 * in 'tmp' correspond to the same bit in 'to', return false
830 * (nothing left to migrate).
831 *
832 * This lets us pick a pair of nodes to migrate between, such that
833 * if possible the dest node is not already occupied by some other
834 * source node, minimizing the risk of overloading the memory on a
835 * node that would happen if we migrated incoming memory to a node
836 * before migrating outgoing memory source that same node.
837 *
838 * A single scan of tmp is sufficient. As we go, we remember the
839 * most recent <s, d> pair that moved (s != d). If we find a pair
840 * that not only moved, but what's better, moved to an empty slot
841 * (d is not set in tmp), then we break out then, with that pair.
842 * Otherwise when we finish scannng from_tmp, we at least have the
843 * most recent <s, d> pair that moved. If we get all the way through
844 * the scan of tmp without finding any node that moved, much less
845 * moved to an empty node, then there is nothing left worth migrating.
846 */
Christoph Lameterd4984712006-01-08 01:00:55 -0800847
Christoph Lameter7e2ab152006-02-01 03:05:40 -0800848 tmp = *from_nodes;
849 while (!nodes_empty(tmp)) {
850 int s,d;
851 int source = -1;
852 int dest = 0;
853
854 for_each_node_mask(s, tmp) {
855 d = node_remap(s, *from_nodes, *to_nodes);
856 if (s == d)
857 continue;
858
859 source = s; /* Node moved. Memorize */
860 dest = d;
861
862 /* dest not in remaining from nodes? */
863 if (!node_isset(dest, tmp))
864 break;
865 }
866 if (source == -1)
867 break;
868
869 node_clear(source, tmp);
870 err = migrate_to_node(mm, source, dest, flags);
871 if (err > 0)
872 busy += err;
873 if (err < 0)
874 break;
Christoph Lameter39743882006-01-08 01:00:51 -0800875 }
Christoph Lameter7b2259b2006-06-25 05:46:48 -0700876out:
Christoph Lameter39743882006-01-08 01:00:51 -0800877 up_read(&mm->mmap_sem);
Christoph Lameter7e2ab152006-02-01 03:05:40 -0800878 if (err < 0)
879 return err;
880 return busy;
Christoph Lameterb20a3502006-03-22 00:09:12 -0800881
Christoph Lameter39743882006-01-08 01:00:51 -0800882}
883
Lee Schermerhorn3ad33b22007-11-14 16:59:10 -0800884/*
885 * Allocate a new page for page migration based on vma policy.
886 * Start assuming that page is mapped by vma pointed to by @private.
887 * Search forward from there, if not. N.B., this assumes that the
888 * list of pages handed to migrate_pages()--which is how we get here--
889 * is in virtual address order.
890 */
Christoph Lameter742755a2006-06-23 02:03:55 -0700891static struct page *new_vma_page(struct page *page, unsigned long private, int **x)
Christoph Lameter95a402c2006-06-23 02:03:53 -0700892{
893 struct vm_area_struct *vma = (struct vm_area_struct *)private;
Lee Schermerhorn3ad33b22007-11-14 16:59:10 -0800894 unsigned long uninitialized_var(address);
Christoph Lameter95a402c2006-06-23 02:03:53 -0700895
Lee Schermerhorn3ad33b22007-11-14 16:59:10 -0800896 while (vma) {
897 address = page_address_in_vma(page, vma);
898 if (address != -EFAULT)
899 break;
900 vma = vma->vm_next;
901 }
902
903 /*
904 * if !vma, alloc_page_vma() will use task or system default policy
905 */
906 return alloc_page_vma(GFP_HIGHUSER_MOVABLE, vma, address);
Christoph Lameter95a402c2006-06-23 02:03:53 -0700907}
Christoph Lameterb20a3502006-03-22 00:09:12 -0800908#else
909
910static void migrate_page_add(struct page *page, struct list_head *pagelist,
911 unsigned long flags)
912{
913}
914
915int do_migrate_pages(struct mm_struct *mm,
916 const nodemask_t *from_nodes, const nodemask_t *to_nodes, int flags)
917{
918 return -ENOSYS;
919}
Christoph Lameter95a402c2006-06-23 02:03:53 -0700920
Keith Owens69939742006-10-11 01:21:28 -0700921static struct page *new_vma_page(struct page *page, unsigned long private, int **x)
Christoph Lameter95a402c2006-06-23 02:03:53 -0700922{
923 return NULL;
924}
Christoph Lameterb20a3502006-03-22 00:09:12 -0800925#endif
926
Adrian Bunkdbcb0f12007-10-16 01:26:26 -0700927static long do_mbind(unsigned long start, unsigned long len,
David Rientjes028fec42008-04-28 02:12:25 -0700928 unsigned short mode, unsigned short mode_flags,
929 nodemask_t *nmask, unsigned long flags)
Christoph Lameter6ce3c4c2006-01-08 01:01:04 -0800930{
931 struct vm_area_struct *vma;
932 struct mm_struct *mm = current->mm;
933 struct mempolicy *new;
934 unsigned long end;
935 int err;
936 LIST_HEAD(pagelist);
937
David Rientjesa3b51e02008-04-28 02:12:23 -0700938 if (flags & ~(unsigned long)(MPOL_MF_STRICT |
939 MPOL_MF_MOVE | MPOL_MF_MOVE_ALL))
Christoph Lameter6ce3c4c2006-01-08 01:01:04 -0800940 return -EINVAL;
Christoph Lameter74c00242006-03-14 19:50:21 -0800941 if ((flags & MPOL_MF_MOVE_ALL) && !capable(CAP_SYS_NICE))
Christoph Lameter6ce3c4c2006-01-08 01:01:04 -0800942 return -EPERM;
943
944 if (start & ~PAGE_MASK)
945 return -EINVAL;
946
947 if (mode == MPOL_DEFAULT)
948 flags &= ~MPOL_MF_STRICT;
949
950 len = (len + PAGE_SIZE - 1) & PAGE_MASK;
951 end = start + len;
952
953 if (end < start)
954 return -EINVAL;
955 if (end == start)
956 return 0;
957
David Rientjes028fec42008-04-28 02:12:25 -0700958 new = mpol_new(mode, mode_flags, nmask);
Christoph Lameter6ce3c4c2006-01-08 01:01:04 -0800959 if (IS_ERR(new))
960 return PTR_ERR(new);
961
962 /*
963 * If we are using the default policy then operation
964 * on discontinuous address spaces is okay after all
965 */
966 if (!new)
967 flags |= MPOL_MF_DISCONTIG_OK;
968
David Rientjes028fec42008-04-28 02:12:25 -0700969 pr_debug("mbind %lx-%lx mode:%d flags:%d nodes:%lx\n",
970 start, start + len, mode, mode_flags,
971 nmask ? nodes_addr(*nmask)[0] : -1);
Christoph Lameter6ce3c4c2006-01-08 01:01:04 -0800972
973 down_write(&mm->mmap_sem);
974 vma = check_range(mm, start, end, nmask,
975 flags | MPOL_MF_INVERT, &pagelist);
976
977 err = PTR_ERR(vma);
978 if (!IS_ERR(vma)) {
979 int nr_failed = 0;
980
981 err = mbind_range(vma, start, end, new);
Christoph Lameter7e2ab152006-02-01 03:05:40 -0800982
Christoph Lameter6ce3c4c2006-01-08 01:01:04 -0800983 if (!list_empty(&pagelist))
Christoph Lameter95a402c2006-06-23 02:03:53 -0700984 nr_failed = migrate_pages(&pagelist, new_vma_page,
985 (unsigned long)vma);
Christoph Lameter6ce3c4c2006-01-08 01:01:04 -0800986
987 if (!err && nr_failed && (flags & MPOL_MF_STRICT))
988 err = -EIO;
989 }
Christoph Lameterb20a3502006-03-22 00:09:12 -0800990
Christoph Lameter6ce3c4c2006-01-08 01:01:04 -0800991 up_write(&mm->mmap_sem);
Lee Schermerhornf0be3d32008-04-28 02:13:08 -0700992 mpol_put(new);
Christoph Lameter6ce3c4c2006-01-08 01:01:04 -0800993 return err;
994}
995
Christoph Lameter39743882006-01-08 01:00:51 -0800996/*
Christoph Lameter8bccd852005-10-29 18:16:59 -0700997 * User space interface with variable sized bitmaps for nodelists.
998 */
999
1000/* Copy a node mask from user space. */
Christoph Lameter39743882006-01-08 01:00:51 -08001001static int get_nodes(nodemask_t *nodes, const unsigned long __user *nmask,
Christoph Lameter8bccd852005-10-29 18:16:59 -07001002 unsigned long maxnode)
1003{
1004 unsigned long k;
1005 unsigned long nlongs;
1006 unsigned long endmask;
1007
1008 --maxnode;
1009 nodes_clear(*nodes);
1010 if (maxnode == 0 || !nmask)
1011 return 0;
Andi Kleena9c930b2006-02-20 18:27:59 -08001012 if (maxnode > PAGE_SIZE*BITS_PER_BYTE)
Chris Wright636f13c2006-02-17 13:59:36 -08001013 return -EINVAL;
Christoph Lameter8bccd852005-10-29 18:16:59 -07001014
1015 nlongs = BITS_TO_LONGS(maxnode);
1016 if ((maxnode % BITS_PER_LONG) == 0)
1017 endmask = ~0UL;
1018 else
1019 endmask = (1UL << (maxnode % BITS_PER_LONG)) - 1;
1020
1021 /* When the user specified more nodes than supported just check
1022 if the non supported part is all zero. */
1023 if (nlongs > BITS_TO_LONGS(MAX_NUMNODES)) {
1024 if (nlongs > PAGE_SIZE/sizeof(long))
1025 return -EINVAL;
1026 for (k = BITS_TO_LONGS(MAX_NUMNODES); k < nlongs; k++) {
1027 unsigned long t;
1028 if (get_user(t, nmask + k))
1029 return -EFAULT;
1030 if (k == nlongs - 1) {
1031 if (t & endmask)
1032 return -EINVAL;
1033 } else if (t)
1034 return -EINVAL;
1035 }
1036 nlongs = BITS_TO_LONGS(MAX_NUMNODES);
1037 endmask = ~0UL;
1038 }
1039
1040 if (copy_from_user(nodes_addr(*nodes), nmask, nlongs*sizeof(unsigned long)))
1041 return -EFAULT;
1042 nodes_addr(*nodes)[nlongs-1] &= endmask;
1043 return 0;
1044}
1045
1046/* Copy a kernel node mask to user space */
1047static int copy_nodes_to_user(unsigned long __user *mask, unsigned long maxnode,
1048 nodemask_t *nodes)
1049{
1050 unsigned long copy = ALIGN(maxnode-1, 64) / 8;
1051 const int nbytes = BITS_TO_LONGS(MAX_NUMNODES) * sizeof(long);
1052
1053 if (copy > nbytes) {
1054 if (copy > PAGE_SIZE)
1055 return -EINVAL;
1056 if (clear_user((char __user *)mask + nbytes, copy - nbytes))
1057 return -EFAULT;
1058 copy = nbytes;
1059 }
1060 return copy_to_user(mask, nodes_addr(*nodes), copy) ? -EFAULT : 0;
1061}
1062
1063asmlinkage long sys_mbind(unsigned long start, unsigned long len,
1064 unsigned long mode,
1065 unsigned long __user *nmask, unsigned long maxnode,
1066 unsigned flags)
1067{
1068 nodemask_t nodes;
1069 int err;
David Rientjes028fec42008-04-28 02:12:25 -07001070 unsigned short mode_flags;
Christoph Lameter8bccd852005-10-29 18:16:59 -07001071
David Rientjes028fec42008-04-28 02:12:25 -07001072 mode_flags = mode & MPOL_MODE_FLAGS;
1073 mode &= ~MPOL_MODE_FLAGS;
David Rientjesa3b51e02008-04-28 02:12:23 -07001074 if (mode >= MPOL_MAX)
1075 return -EINVAL;
David Rientjes4c50bc02008-04-28 02:12:30 -07001076 if ((mode_flags & MPOL_F_STATIC_NODES) &&
1077 (mode_flags & MPOL_F_RELATIVE_NODES))
1078 return -EINVAL;
Christoph Lameter8bccd852005-10-29 18:16:59 -07001079 err = get_nodes(&nodes, nmask, maxnode);
1080 if (err)
1081 return err;
David Rientjes028fec42008-04-28 02:12:25 -07001082 return do_mbind(start, len, mode, mode_flags, &nodes, flags);
Christoph Lameter8bccd852005-10-29 18:16:59 -07001083}
1084
1085/* Set the process memory policy */
1086asmlinkage long sys_set_mempolicy(int mode, unsigned long __user *nmask,
1087 unsigned long maxnode)
1088{
1089 int err;
1090 nodemask_t nodes;
David Rientjes028fec42008-04-28 02:12:25 -07001091 unsigned short flags;
Christoph Lameter8bccd852005-10-29 18:16:59 -07001092
David Rientjes028fec42008-04-28 02:12:25 -07001093 flags = mode & MPOL_MODE_FLAGS;
1094 mode &= ~MPOL_MODE_FLAGS;
1095 if ((unsigned int)mode >= MPOL_MAX)
Christoph Lameter8bccd852005-10-29 18:16:59 -07001096 return -EINVAL;
David Rientjes4c50bc02008-04-28 02:12:30 -07001097 if ((flags & MPOL_F_STATIC_NODES) && (flags & MPOL_F_RELATIVE_NODES))
1098 return -EINVAL;
Christoph Lameter8bccd852005-10-29 18:16:59 -07001099 err = get_nodes(&nodes, nmask, maxnode);
1100 if (err)
1101 return err;
David Rientjes028fec42008-04-28 02:12:25 -07001102 return do_set_mempolicy(mode, flags, &nodes);
Christoph Lameter8bccd852005-10-29 18:16:59 -07001103}
1104
Christoph Lameter39743882006-01-08 01:00:51 -08001105asmlinkage long sys_migrate_pages(pid_t pid, unsigned long maxnode,
1106 const unsigned long __user *old_nodes,
1107 const unsigned long __user *new_nodes)
1108{
1109 struct mm_struct *mm;
1110 struct task_struct *task;
1111 nodemask_t old;
1112 nodemask_t new;
1113 nodemask_t task_nodes;
1114 int err;
1115
1116 err = get_nodes(&old, old_nodes, maxnode);
1117 if (err)
1118 return err;
1119
1120 err = get_nodes(&new, new_nodes, maxnode);
1121 if (err)
1122 return err;
1123
1124 /* Find the mm_struct */
1125 read_lock(&tasklist_lock);
Pavel Emelyanov228ebcb2007-10-18 23:40:16 -07001126 task = pid ? find_task_by_vpid(pid) : current;
Christoph Lameter39743882006-01-08 01:00:51 -08001127 if (!task) {
1128 read_unlock(&tasklist_lock);
1129 return -ESRCH;
1130 }
1131 mm = get_task_mm(task);
1132 read_unlock(&tasklist_lock);
1133
1134 if (!mm)
1135 return -EINVAL;
1136
1137 /*
1138 * Check if this process has the right to modify the specified
1139 * process. The right exists if the process has administrative
Alexey Dobriyan7f927fc2006-03-28 01:56:53 -08001140 * capabilities, superuser privileges or the same
Christoph Lameter39743882006-01-08 01:00:51 -08001141 * userid as the target process.
1142 */
1143 if ((current->euid != task->suid) && (current->euid != task->uid) &&
1144 (current->uid != task->suid) && (current->uid != task->uid) &&
Christoph Lameter74c00242006-03-14 19:50:21 -08001145 !capable(CAP_SYS_NICE)) {
Christoph Lameter39743882006-01-08 01:00:51 -08001146 err = -EPERM;
1147 goto out;
1148 }
1149
1150 task_nodes = cpuset_mems_allowed(task);
1151 /* Is the user allowed to access the target nodes? */
Christoph Lameter74c00242006-03-14 19:50:21 -08001152 if (!nodes_subset(new, task_nodes) && !capable(CAP_SYS_NICE)) {
Christoph Lameter39743882006-01-08 01:00:51 -08001153 err = -EPERM;
1154 goto out;
1155 }
1156
Lee Schermerhorn37b07e42007-10-16 01:25:39 -07001157 if (!nodes_subset(new, node_states[N_HIGH_MEMORY])) {
Christoph Lameter3b42d282007-08-31 00:12:08 -07001158 err = -EINVAL;
1159 goto out;
1160 }
1161
David Quigley86c3a762006-06-23 02:04:02 -07001162 err = security_task_movememory(task);
1163 if (err)
1164 goto out;
1165
Christoph Lameter511030b2006-02-28 16:58:57 -08001166 err = do_migrate_pages(mm, &old, &new,
Christoph Lameter74c00242006-03-14 19:50:21 -08001167 capable(CAP_SYS_NICE) ? MPOL_MF_MOVE_ALL : MPOL_MF_MOVE);
Christoph Lameter39743882006-01-08 01:00:51 -08001168out:
1169 mmput(mm);
1170 return err;
1171}
1172
1173
Christoph Lameter8bccd852005-10-29 18:16:59 -07001174/* Retrieve NUMA policy */
1175asmlinkage long sys_get_mempolicy(int __user *policy,
1176 unsigned long __user *nmask,
1177 unsigned long maxnode,
1178 unsigned long addr, unsigned long flags)
1179{
Adrian Bunkdbcb0f12007-10-16 01:26:26 -07001180 int err;
1181 int uninitialized_var(pval);
Christoph Lameter8bccd852005-10-29 18:16:59 -07001182 nodemask_t nodes;
1183
1184 if (nmask != NULL && maxnode < MAX_NUMNODES)
1185 return -EINVAL;
1186
1187 err = do_get_mempolicy(&pval, &nodes, addr, flags);
1188
1189 if (err)
1190 return err;
1191
1192 if (policy && put_user(pval, policy))
1193 return -EFAULT;
1194
1195 if (nmask)
1196 err = copy_nodes_to_user(nmask, maxnode, &nodes);
1197
1198 return err;
1199}
1200
Linus Torvalds1da177e2005-04-16 15:20:36 -07001201#ifdef CONFIG_COMPAT
1202
1203asmlinkage long compat_sys_get_mempolicy(int __user *policy,
1204 compat_ulong_t __user *nmask,
1205 compat_ulong_t maxnode,
1206 compat_ulong_t addr, compat_ulong_t flags)
1207{
1208 long err;
1209 unsigned long __user *nm = NULL;
1210 unsigned long nr_bits, alloc_size;
1211 DECLARE_BITMAP(bm, MAX_NUMNODES);
1212
1213 nr_bits = min_t(unsigned long, maxnode-1, MAX_NUMNODES);
1214 alloc_size = ALIGN(nr_bits, BITS_PER_LONG) / 8;
1215
1216 if (nmask)
1217 nm = compat_alloc_user_space(alloc_size);
1218
1219 err = sys_get_mempolicy(policy, nm, nr_bits+1, addr, flags);
1220
1221 if (!err && nmask) {
1222 err = copy_from_user(bm, nm, alloc_size);
1223 /* ensure entire bitmap is zeroed */
1224 err |= clear_user(nmask, ALIGN(maxnode-1, 8) / 8);
1225 err |= compat_put_bitmap(nmask, bm, nr_bits);
1226 }
1227
1228 return err;
1229}
1230
1231asmlinkage long compat_sys_set_mempolicy(int mode, compat_ulong_t __user *nmask,
1232 compat_ulong_t maxnode)
1233{
1234 long err = 0;
1235 unsigned long __user *nm = NULL;
1236 unsigned long nr_bits, alloc_size;
1237 DECLARE_BITMAP(bm, MAX_NUMNODES);
1238
1239 nr_bits = min_t(unsigned long, maxnode-1, MAX_NUMNODES);
1240 alloc_size = ALIGN(nr_bits, BITS_PER_LONG) / 8;
1241
1242 if (nmask) {
1243 err = compat_get_bitmap(bm, nmask, nr_bits);
1244 nm = compat_alloc_user_space(alloc_size);
1245 err |= copy_to_user(nm, bm, alloc_size);
1246 }
1247
1248 if (err)
1249 return -EFAULT;
1250
1251 return sys_set_mempolicy(mode, nm, nr_bits+1);
1252}
1253
1254asmlinkage long compat_sys_mbind(compat_ulong_t start, compat_ulong_t len,
1255 compat_ulong_t mode, compat_ulong_t __user *nmask,
1256 compat_ulong_t maxnode, compat_ulong_t flags)
1257{
1258 long err = 0;
1259 unsigned long __user *nm = NULL;
1260 unsigned long nr_bits, alloc_size;
Andi Kleendfcd3c02005-10-29 18:15:48 -07001261 nodemask_t bm;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001262
1263 nr_bits = min_t(unsigned long, maxnode-1, MAX_NUMNODES);
1264 alloc_size = ALIGN(nr_bits, BITS_PER_LONG) / 8;
1265
1266 if (nmask) {
Andi Kleendfcd3c02005-10-29 18:15:48 -07001267 err = compat_get_bitmap(nodes_addr(bm), nmask, nr_bits);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001268 nm = compat_alloc_user_space(alloc_size);
Andi Kleendfcd3c02005-10-29 18:15:48 -07001269 err |= copy_to_user(nm, nodes_addr(bm), alloc_size);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001270 }
1271
1272 if (err)
1273 return -EFAULT;
1274
1275 return sys_mbind(start, len, mode, nm, nr_bits+1, flags);
1276}
1277
1278#endif
1279
Lee Schermerhorn480eccf2007-09-18 22:46:47 -07001280/*
1281 * get_vma_policy(@task, @vma, @addr)
1282 * @task - task for fallback if vma policy == default
1283 * @vma - virtual memory area whose policy is sought
1284 * @addr - address in @vma for shared policy lookup
1285 *
1286 * Returns effective policy for a VMA at specified address.
1287 * Falls back to @task or system default policy, as necessary.
Lee Schermerhorn52cd3b02008-04-28 02:13:16 -07001288 * Current or other task's task mempolicy and non-shared vma policies
1289 * are protected by the task's mmap_sem, which must be held for read by
1290 * the caller.
1291 * Shared policies [those marked as MPOL_F_SHARED] require an extra reference
1292 * count--added by the get_policy() vm_op, as appropriate--to protect against
1293 * freeing by another task. It is the caller's responsibility to free the
1294 * extra reference for shared policies.
Lee Schermerhorn480eccf2007-09-18 22:46:47 -07001295 */
Lee Schermerhornae4d8c12008-04-28 02:13:11 -07001296static struct mempolicy *get_vma_policy(struct task_struct *task,
Christoph Lameter48fce342006-01-08 01:01:03 -08001297 struct vm_area_struct *vma, unsigned long addr)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001298{
Christoph Lameter6e21c8f2005-09-03 15:54:45 -07001299 struct mempolicy *pol = task->mempolicy;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001300
1301 if (vma) {
Lee Schermerhorn480eccf2007-09-18 22:46:47 -07001302 if (vma->vm_ops && vma->vm_ops->get_policy) {
Lee Schermerhornae4d8c12008-04-28 02:13:11 -07001303 struct mempolicy *vpol = vma->vm_ops->get_policy(vma,
1304 addr);
1305 if (vpol)
1306 pol = vpol;
Lee Schermerhornbea904d2008-04-28 02:13:18 -07001307 } else if (vma->vm_policy)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001308 pol = vma->vm_policy;
1309 }
1310 if (!pol)
1311 pol = &default_policy;
1312 return pol;
1313}
1314
Lee Schermerhorn52cd3b02008-04-28 02:13:16 -07001315/*
1316 * Return a nodemask representing a mempolicy for filtering nodes for
1317 * page allocation
1318 */
1319static nodemask_t *policy_nodemask(gfp_t gfp, struct mempolicy *policy)
Mel Gorman19770b32008-04-28 02:12:18 -07001320{
1321 /* Lower zones don't get a nodemask applied for MPOL_BIND */
Lee Schermerhorn45c47452008-04-28 02:13:12 -07001322 if (unlikely(policy->mode == MPOL_BIND) &&
Mel Gorman19770b32008-04-28 02:12:18 -07001323 gfp_zone(gfp) >= policy_zone &&
1324 cpuset_nodemask_valid_mems_allowed(&policy->v.nodes))
1325 return &policy->v.nodes;
1326
1327 return NULL;
1328}
1329
Lee Schermerhorn52cd3b02008-04-28 02:13:16 -07001330/* Return a zonelist indicated by gfp for node representing a mempolicy */
1331static struct zonelist *policy_zonelist(gfp_t gfp, struct mempolicy *policy)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001332{
Lee Schermerhornfc36b8d2008-04-28 02:13:21 -07001333 int nd = numa_node_id();
Linus Torvalds1da177e2005-04-16 15:20:36 -07001334
Lee Schermerhorn45c47452008-04-28 02:13:12 -07001335 switch (policy->mode) {
Linus Torvalds1da177e2005-04-16 15:20:36 -07001336 case MPOL_PREFERRED:
Lee Schermerhornfc36b8d2008-04-28 02:13:21 -07001337 if (!(policy->flags & MPOL_F_LOCAL))
1338 nd = policy->v.preferred_node;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001339 break;
1340 case MPOL_BIND:
Mel Gorman19770b32008-04-28 02:12:18 -07001341 /*
Lee Schermerhorn52cd3b02008-04-28 02:13:16 -07001342 * Normally, MPOL_BIND allocations are node-local within the
1343 * allowed nodemask. However, if __GFP_THISNODE is set and the
1344 * current node is part of the mask, we use the zonelist for
1345 * the first node in the mask instead.
Mel Gorman19770b32008-04-28 02:12:18 -07001346 */
Mel Gorman19770b32008-04-28 02:12:18 -07001347 if (unlikely(gfp & __GFP_THISNODE) &&
1348 unlikely(!node_isset(nd, policy->v.nodes)))
1349 nd = first_node(policy->v.nodes);
1350 break;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001351 case MPOL_INTERLEAVE: /* should not happen */
Linus Torvalds1da177e2005-04-16 15:20:36 -07001352 break;
1353 default:
Linus Torvalds1da177e2005-04-16 15:20:36 -07001354 BUG();
1355 }
Mel Gorman0e884602008-04-28 02:12:14 -07001356 return node_zonelist(nd, gfp);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001357}
1358
1359/* Do dynamic interleaving for a process */
1360static unsigned interleave_nodes(struct mempolicy *policy)
1361{
1362 unsigned nid, next;
1363 struct task_struct *me = current;
1364
1365 nid = me->il_next;
Andi Kleendfcd3c02005-10-29 18:15:48 -07001366 next = next_node(nid, policy->v.nodes);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001367 if (next >= MAX_NUMNODES)
Andi Kleendfcd3c02005-10-29 18:15:48 -07001368 next = first_node(policy->v.nodes);
David Rientjesf5b087b2008-04-28 02:12:27 -07001369 if (next < MAX_NUMNODES)
1370 me->il_next = next;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001371 return nid;
1372}
1373
Christoph Lameterdc85da12006-01-18 17:42:36 -08001374/*
1375 * Depending on the memory policy provide a node from which to allocate the
1376 * next slab entry.
Lee Schermerhorn52cd3b02008-04-28 02:13:16 -07001377 * @policy must be protected by freeing by the caller. If @policy is
1378 * the current task's mempolicy, this protection is implicit, as only the
1379 * task can change it's policy. The system default policy requires no
1380 * such protection.
Christoph Lameterdc85da12006-01-18 17:42:36 -08001381 */
1382unsigned slab_node(struct mempolicy *policy)
1383{
Lee Schermerhornfc36b8d2008-04-28 02:13:21 -07001384 if (!policy || policy->flags & MPOL_F_LOCAL)
Lee Schermerhornbea904d2008-04-28 02:13:18 -07001385 return numa_node_id();
Christoph Lameter765c4502006-09-27 01:50:08 -07001386
Lee Schermerhornbea904d2008-04-28 02:13:18 -07001387 switch (policy->mode) {
1388 case MPOL_PREFERRED:
Lee Schermerhornfc36b8d2008-04-28 02:13:21 -07001389 /*
1390 * handled MPOL_F_LOCAL above
1391 */
1392 return policy->v.preferred_node;
Lee Schermerhornbea904d2008-04-28 02:13:18 -07001393
Christoph Lameterdc85da12006-01-18 17:42:36 -08001394 case MPOL_INTERLEAVE:
1395 return interleave_nodes(policy);
1396
Mel Gormandd1a2392008-04-28 02:12:17 -07001397 case MPOL_BIND: {
Christoph Lameterdc85da12006-01-18 17:42:36 -08001398 /*
1399 * Follow bind policy behavior and start allocation at the
1400 * first node.
1401 */
Mel Gorman19770b32008-04-28 02:12:18 -07001402 struct zonelist *zonelist;
1403 struct zone *zone;
1404 enum zone_type highest_zoneidx = gfp_zone(GFP_KERNEL);
1405 zonelist = &NODE_DATA(numa_node_id())->node_zonelists[0];
1406 (void)first_zones_zonelist(zonelist, highest_zoneidx,
1407 &policy->v.nodes,
1408 &zone);
1409 return zone->node;
Mel Gormandd1a2392008-04-28 02:12:17 -07001410 }
Christoph Lameterdc85da12006-01-18 17:42:36 -08001411
Christoph Lameterdc85da12006-01-18 17:42:36 -08001412 default:
Lee Schermerhornbea904d2008-04-28 02:13:18 -07001413 BUG();
Christoph Lameterdc85da12006-01-18 17:42:36 -08001414 }
1415}
1416
Linus Torvalds1da177e2005-04-16 15:20:36 -07001417/* Do static interleaving for a VMA with known offset. */
1418static unsigned offset_il_node(struct mempolicy *pol,
1419 struct vm_area_struct *vma, unsigned long off)
1420{
Andi Kleendfcd3c02005-10-29 18:15:48 -07001421 unsigned nnodes = nodes_weight(pol->v.nodes);
David Rientjesf5b087b2008-04-28 02:12:27 -07001422 unsigned target;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001423 int c;
1424 int nid = -1;
1425
David Rientjesf5b087b2008-04-28 02:12:27 -07001426 if (!nnodes)
1427 return numa_node_id();
1428 target = (unsigned int)off % nnodes;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001429 c = 0;
1430 do {
Andi Kleendfcd3c02005-10-29 18:15:48 -07001431 nid = next_node(nid, pol->v.nodes);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001432 c++;
1433 } while (c <= target);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001434 return nid;
1435}
1436
Christoph Lameter5da7ca82006-01-06 00:10:46 -08001437/* Determine a node number for interleave */
1438static inline unsigned interleave_nid(struct mempolicy *pol,
1439 struct vm_area_struct *vma, unsigned long addr, int shift)
1440{
1441 if (vma) {
1442 unsigned long off;
1443
Nishanth Aravamudan3b98b082006-08-31 21:27:53 -07001444 /*
1445 * for small pages, there is no difference between
1446 * shift and PAGE_SHIFT, so the bit-shift is safe.
1447 * for huge pages, since vm_pgoff is in units of small
1448 * pages, we need to shift off the always 0 bits to get
1449 * a useful offset.
1450 */
1451 BUG_ON(shift < PAGE_SHIFT);
1452 off = vma->vm_pgoff >> (shift - PAGE_SHIFT);
Christoph Lameter5da7ca82006-01-06 00:10:46 -08001453 off += (addr - vma->vm_start) >> shift;
1454 return offset_il_node(pol, vma, off);
1455 } else
1456 return interleave_nodes(pol);
1457}
1458
Chen, Kenneth W00ac59a2006-02-03 21:51:14 +01001459#ifdef CONFIG_HUGETLBFS
Lee Schermerhorn480eccf2007-09-18 22:46:47 -07001460/*
1461 * huge_zonelist(@vma, @addr, @gfp_flags, @mpol)
1462 * @vma = virtual memory area whose policy is sought
1463 * @addr = address in @vma for shared policy lookup and interleave policy
1464 * @gfp_flags = for requested zone
Mel Gorman19770b32008-04-28 02:12:18 -07001465 * @mpol = pointer to mempolicy pointer for reference counted mempolicy
1466 * @nodemask = pointer to nodemask pointer for MPOL_BIND nodemask
Lee Schermerhorn480eccf2007-09-18 22:46:47 -07001467 *
Lee Schermerhorn52cd3b02008-04-28 02:13:16 -07001468 * Returns a zonelist suitable for a huge page allocation and a pointer
1469 * to the struct mempolicy for conditional unref after allocation.
1470 * If the effective policy is 'BIND, returns a pointer to the mempolicy's
1471 * @nodemask for filtering the zonelist.
Lee Schermerhorn480eccf2007-09-18 22:46:47 -07001472 */
Mel Gorman396faf02007-07-17 04:03:13 -07001473struct zonelist *huge_zonelist(struct vm_area_struct *vma, unsigned long addr,
Mel Gorman19770b32008-04-28 02:12:18 -07001474 gfp_t gfp_flags, struct mempolicy **mpol,
1475 nodemask_t **nodemask)
Christoph Lameter5da7ca82006-01-06 00:10:46 -08001476{
Lee Schermerhorn480eccf2007-09-18 22:46:47 -07001477 struct zonelist *zl;
Christoph Lameter5da7ca82006-01-06 00:10:46 -08001478
Lee Schermerhorn52cd3b02008-04-28 02:13:16 -07001479 *mpol = get_vma_policy(current, vma, addr);
Mel Gorman19770b32008-04-28 02:12:18 -07001480 *nodemask = NULL; /* assume !MPOL_BIND */
Christoph Lameter5da7ca82006-01-06 00:10:46 -08001481
Lee Schermerhorn52cd3b02008-04-28 02:13:16 -07001482 if (unlikely((*mpol)->mode == MPOL_INTERLEAVE)) {
1483 zl = node_zonelist(interleave_nid(*mpol, vma, addr,
1484 HPAGE_SHIFT), gfp_flags);
1485 } else {
1486 zl = policy_zonelist(gfp_flags, *mpol);
1487 if ((*mpol)->mode == MPOL_BIND)
1488 *nodemask = &(*mpol)->v.nodes;
Lee Schermerhorn480eccf2007-09-18 22:46:47 -07001489 }
1490 return zl;
Christoph Lameter5da7ca82006-01-06 00:10:46 -08001491}
Chen, Kenneth W00ac59a2006-02-03 21:51:14 +01001492#endif
Christoph Lameter5da7ca82006-01-06 00:10:46 -08001493
Linus Torvalds1da177e2005-04-16 15:20:36 -07001494/* Allocate a page in interleaved policy.
1495 Own path because it needs to do special accounting. */
Andi Kleen662f3a02005-10-29 18:15:49 -07001496static struct page *alloc_page_interleave(gfp_t gfp, unsigned order,
1497 unsigned nid)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001498{
1499 struct zonelist *zl;
1500 struct page *page;
1501
Mel Gorman0e884602008-04-28 02:12:14 -07001502 zl = node_zonelist(nid, gfp);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001503 page = __alloc_pages(gfp, order, zl);
Mel Gormandd1a2392008-04-28 02:12:17 -07001504 if (page && page_zone(page) == zonelist_zone(&zl->_zonerefs[0]))
Christoph Lameterca889e62006-06-30 01:55:44 -07001505 inc_zone_page_state(page, NUMA_INTERLEAVE_HIT);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001506 return page;
1507}
1508
1509/**
1510 * alloc_page_vma - Allocate a page for a VMA.
1511 *
1512 * @gfp:
1513 * %GFP_USER user allocation.
1514 * %GFP_KERNEL kernel allocations,
1515 * %GFP_HIGHMEM highmem/user allocations,
1516 * %GFP_FS allocation should not call back into a file system.
1517 * %GFP_ATOMIC don't sleep.
1518 *
1519 * @vma: Pointer to VMA or NULL if not available.
1520 * @addr: Virtual Address of the allocation. Must be inside the VMA.
1521 *
1522 * This function allocates a page from the kernel page pool and applies
1523 * a NUMA policy associated with the VMA or the current process.
1524 * When VMA is not NULL caller must hold down_read on the mmap_sem of the
1525 * mm_struct of the VMA to prevent it from going away. Should be used for
1526 * all allocations for pages that will be mapped into
1527 * user space. Returns NULL when no page can be allocated.
1528 *
1529 * Should be called with the mm_sem of the vma hold.
1530 */
1531struct page *
Al Virodd0fc662005-10-07 07:46:04 +01001532alloc_page_vma(gfp_t gfp, struct vm_area_struct *vma, unsigned long addr)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001533{
Christoph Lameter6e21c8f2005-09-03 15:54:45 -07001534 struct mempolicy *pol = get_vma_policy(current, vma, addr);
Lee Schermerhorn480eccf2007-09-18 22:46:47 -07001535 struct zonelist *zl;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001536
Paul Jacksoncf2a473c2006-01-08 01:01:54 -08001537 cpuset_update_task_memory_state();
Linus Torvalds1da177e2005-04-16 15:20:36 -07001538
Lee Schermerhorn45c47452008-04-28 02:13:12 -07001539 if (unlikely(pol->mode == MPOL_INTERLEAVE)) {
Linus Torvalds1da177e2005-04-16 15:20:36 -07001540 unsigned nid;
Christoph Lameter5da7ca82006-01-06 00:10:46 -08001541
1542 nid = interleave_nid(pol, vma, addr, PAGE_SHIFT);
Lee Schermerhorn52cd3b02008-04-28 02:13:16 -07001543 mpol_cond_put(pol);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001544 return alloc_page_interleave(gfp, 0, nid);
1545 }
Lee Schermerhorn52cd3b02008-04-28 02:13:16 -07001546 zl = policy_zonelist(gfp, pol);
1547 if (unlikely(mpol_needs_cond_ref(pol))) {
Lee Schermerhorn480eccf2007-09-18 22:46:47 -07001548 /*
Lee Schermerhorn52cd3b02008-04-28 02:13:16 -07001549 * slow path: ref counted shared policy
Lee Schermerhorn480eccf2007-09-18 22:46:47 -07001550 */
Mel Gorman19770b32008-04-28 02:12:18 -07001551 struct page *page = __alloc_pages_nodemask(gfp, 0,
Lee Schermerhorn52cd3b02008-04-28 02:13:16 -07001552 zl, policy_nodemask(gfp, pol));
Lee Schermerhornf0be3d32008-04-28 02:13:08 -07001553 __mpol_put(pol);
Lee Schermerhorn480eccf2007-09-18 22:46:47 -07001554 return page;
1555 }
1556 /*
1557 * fast path: default or task policy
1558 */
Lee Schermerhorn52cd3b02008-04-28 02:13:16 -07001559 return __alloc_pages_nodemask(gfp, 0, zl, policy_nodemask(gfp, pol));
Linus Torvalds1da177e2005-04-16 15:20:36 -07001560}
1561
1562/**
1563 * alloc_pages_current - Allocate pages.
1564 *
1565 * @gfp:
1566 * %GFP_USER user allocation,
1567 * %GFP_KERNEL kernel allocation,
1568 * %GFP_HIGHMEM highmem allocation,
1569 * %GFP_FS don't call back into a file system.
1570 * %GFP_ATOMIC don't sleep.
1571 * @order: Power of two of allocation size in pages. 0 is a single page.
1572 *
1573 * Allocate a page from the kernel page pool. When not in
1574 * interrupt context and apply the current process NUMA policy.
1575 * Returns NULL when no page can be allocated.
1576 *
Paul Jacksoncf2a473c2006-01-08 01:01:54 -08001577 * Don't call cpuset_update_task_memory_state() unless
Linus Torvalds1da177e2005-04-16 15:20:36 -07001578 * 1) it's ok to take cpuset_sem (can WAIT), and
1579 * 2) allocating for current task (not interrupt).
1580 */
Al Virodd0fc662005-10-07 07:46:04 +01001581struct page *alloc_pages_current(gfp_t gfp, unsigned order)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001582{
1583 struct mempolicy *pol = current->mempolicy;
1584
1585 if ((gfp & __GFP_WAIT) && !in_interrupt())
Paul Jacksoncf2a473c2006-01-08 01:01:54 -08001586 cpuset_update_task_memory_state();
Christoph Lameter9b819d22006-09-25 23:31:40 -07001587 if (!pol || in_interrupt() || (gfp & __GFP_THISNODE))
Linus Torvalds1da177e2005-04-16 15:20:36 -07001588 pol = &default_policy;
Lee Schermerhorn52cd3b02008-04-28 02:13:16 -07001589
1590 /*
1591 * No reference counting needed for current->mempolicy
1592 * nor system default_policy
1593 */
Lee Schermerhorn45c47452008-04-28 02:13:12 -07001594 if (pol->mode == MPOL_INTERLEAVE)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001595 return alloc_page_interleave(gfp, order, interleave_nodes(pol));
Mel Gorman19770b32008-04-28 02:12:18 -07001596 return __alloc_pages_nodemask(gfp, order,
Lee Schermerhorn52cd3b02008-04-28 02:13:16 -07001597 policy_zonelist(gfp, pol), policy_nodemask(gfp, pol));
Linus Torvalds1da177e2005-04-16 15:20:36 -07001598}
1599EXPORT_SYMBOL(alloc_pages_current);
1600
Paul Jackson42253992006-01-08 01:01:59 -08001601/*
Lee Schermerhorn846a16b2008-04-28 02:13:09 -07001602 * If mpol_dup() sees current->cpuset == cpuset_being_rebound, then it
Paul Jackson42253992006-01-08 01:01:59 -08001603 * rebinds the mempolicy its copying by calling mpol_rebind_policy()
1604 * with the mems_allowed returned by cpuset_mems_allowed(). This
1605 * keeps mempolicies cpuset relative after its cpuset moves. See
1606 * further kernel/cpuset.c update_nodemask().
1607 */
Paul Jackson42253992006-01-08 01:01:59 -08001608
Lee Schermerhorn846a16b2008-04-28 02:13:09 -07001609/* Slow path of a mempolicy duplicate */
1610struct mempolicy *__mpol_dup(struct mempolicy *old)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001611{
1612 struct mempolicy *new = kmem_cache_alloc(policy_cache, GFP_KERNEL);
1613
1614 if (!new)
1615 return ERR_PTR(-ENOMEM);
Paul Jackson42253992006-01-08 01:01:59 -08001616 if (current_cpuset_is_being_rebound()) {
1617 nodemask_t mems = cpuset_mems_allowed(current);
1618 mpol_rebind_policy(old, &mems);
1619 }
Linus Torvalds1da177e2005-04-16 15:20:36 -07001620 *new = *old;
1621 atomic_set(&new->refcnt, 1);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001622 return new;
1623}
1624
Lee Schermerhorn52cd3b02008-04-28 02:13:16 -07001625/*
1626 * If *frompol needs [has] an extra ref, copy *frompol to *tompol ,
1627 * eliminate the * MPOL_F_* flags that require conditional ref and
1628 * [NOTE!!!] drop the extra ref. Not safe to reference *frompol directly
1629 * after return. Use the returned value.
1630 *
1631 * Allows use of a mempolicy for, e.g., multiple allocations with a single
1632 * policy lookup, even if the policy needs/has extra ref on lookup.
1633 * shmem_readahead needs this.
1634 */
1635struct mempolicy *__mpol_cond_copy(struct mempolicy *tompol,
1636 struct mempolicy *frompol)
1637{
1638 if (!mpol_needs_cond_ref(frompol))
1639 return frompol;
1640
1641 *tompol = *frompol;
1642 tompol->flags &= ~MPOL_F_SHARED; /* copy doesn't need unref */
1643 __mpol_put(frompol);
1644 return tompol;
1645}
1646
David Rientjesf5b087b2008-04-28 02:12:27 -07001647static int mpol_match_intent(const struct mempolicy *a,
1648 const struct mempolicy *b)
1649{
1650 if (a->flags != b->flags)
1651 return 0;
1652 if (!mpol_store_user_nodemask(a))
1653 return 1;
1654 return nodes_equal(a->w.user_nodemask, b->w.user_nodemask);
1655}
1656
Linus Torvalds1da177e2005-04-16 15:20:36 -07001657/* Slow path of a mempolicy comparison */
1658int __mpol_equal(struct mempolicy *a, struct mempolicy *b)
1659{
1660 if (!a || !b)
1661 return 0;
Lee Schermerhorn45c47452008-04-28 02:13:12 -07001662 if (a->mode != b->mode)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001663 return 0;
Lee Schermerhorn45c47452008-04-28 02:13:12 -07001664 if (a->mode != MPOL_DEFAULT && !mpol_match_intent(a, b))
David Rientjesf5b087b2008-04-28 02:12:27 -07001665 return 0;
Lee Schermerhorn45c47452008-04-28 02:13:12 -07001666 switch (a->mode) {
Mel Gorman19770b32008-04-28 02:12:18 -07001667 case MPOL_BIND:
1668 /* Fall through */
Linus Torvalds1da177e2005-04-16 15:20:36 -07001669 case MPOL_INTERLEAVE:
Andi Kleendfcd3c02005-10-29 18:15:48 -07001670 return nodes_equal(a->v.nodes, b->v.nodes);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001671 case MPOL_PREFERRED:
Lee Schermerhornfc36b8d2008-04-28 02:13:21 -07001672 return a->v.preferred_node == b->v.preferred_node &&
1673 a->flags == b->flags;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001674 default:
1675 BUG();
1676 return 0;
1677 }
1678}
1679
Linus Torvalds1da177e2005-04-16 15:20:36 -07001680/*
Linus Torvalds1da177e2005-04-16 15:20:36 -07001681 * Shared memory backing store policy support.
1682 *
1683 * Remember policies even when nobody has shared memory mapped.
1684 * The policies are kept in Red-Black tree linked from the inode.
1685 * They are protected by the sp->lock spinlock, which should be held
1686 * for any accesses to the tree.
1687 */
1688
1689/* lookup first element intersecting start-end */
1690/* Caller holds sp->lock */
1691static struct sp_node *
1692sp_lookup(struct shared_policy *sp, unsigned long start, unsigned long end)
1693{
1694 struct rb_node *n = sp->root.rb_node;
1695
1696 while (n) {
1697 struct sp_node *p = rb_entry(n, struct sp_node, nd);
1698
1699 if (start >= p->end)
1700 n = n->rb_right;
1701 else if (end <= p->start)
1702 n = n->rb_left;
1703 else
1704 break;
1705 }
1706 if (!n)
1707 return NULL;
1708 for (;;) {
1709 struct sp_node *w = NULL;
1710 struct rb_node *prev = rb_prev(n);
1711 if (!prev)
1712 break;
1713 w = rb_entry(prev, struct sp_node, nd);
1714 if (w->end <= start)
1715 break;
1716 n = prev;
1717 }
1718 return rb_entry(n, struct sp_node, nd);
1719}
1720
1721/* Insert a new shared policy into the list. */
1722/* Caller holds sp->lock */
1723static void sp_insert(struct shared_policy *sp, struct sp_node *new)
1724{
1725 struct rb_node **p = &sp->root.rb_node;
1726 struct rb_node *parent = NULL;
1727 struct sp_node *nd;
1728
1729 while (*p) {
1730 parent = *p;
1731 nd = rb_entry(parent, struct sp_node, nd);
1732 if (new->start < nd->start)
1733 p = &(*p)->rb_left;
1734 else if (new->end > nd->end)
1735 p = &(*p)->rb_right;
1736 else
1737 BUG();
1738 }
1739 rb_link_node(&new->nd, parent, p);
1740 rb_insert_color(&new->nd, &sp->root);
Paul Mundt140d5a42007-07-15 23:38:16 -07001741 pr_debug("inserting %lx-%lx: %d\n", new->start, new->end,
Lee Schermerhorn45c47452008-04-28 02:13:12 -07001742 new->policy ? new->policy->mode : 0);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001743}
1744
1745/* Find shared policy intersecting idx */
1746struct mempolicy *
1747mpol_shared_policy_lookup(struct shared_policy *sp, unsigned long idx)
1748{
1749 struct mempolicy *pol = NULL;
1750 struct sp_node *sn;
1751
1752 if (!sp->root.rb_node)
1753 return NULL;
1754 spin_lock(&sp->lock);
1755 sn = sp_lookup(sp, idx, idx+1);
1756 if (sn) {
1757 mpol_get(sn->policy);
1758 pol = sn->policy;
1759 }
1760 spin_unlock(&sp->lock);
1761 return pol;
1762}
1763
1764static void sp_delete(struct shared_policy *sp, struct sp_node *n)
1765{
Paul Mundt140d5a42007-07-15 23:38:16 -07001766 pr_debug("deleting %lx-l%lx\n", n->start, n->end);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001767 rb_erase(&n->nd, &sp->root);
Lee Schermerhornf0be3d32008-04-28 02:13:08 -07001768 mpol_put(n->policy);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001769 kmem_cache_free(sn_cache, n);
1770}
1771
Adrian Bunkdbcb0f12007-10-16 01:26:26 -07001772static struct sp_node *sp_alloc(unsigned long start, unsigned long end,
1773 struct mempolicy *pol)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001774{
1775 struct sp_node *n = kmem_cache_alloc(sn_cache, GFP_KERNEL);
1776
1777 if (!n)
1778 return NULL;
1779 n->start = start;
1780 n->end = end;
1781 mpol_get(pol);
Lee Schermerhornaab0b102008-04-28 02:13:13 -07001782 pol->flags |= MPOL_F_SHARED; /* for unref */
Linus Torvalds1da177e2005-04-16 15:20:36 -07001783 n->policy = pol;
1784 return n;
1785}
1786
1787/* Replace a policy range. */
1788static int shared_policy_replace(struct shared_policy *sp, unsigned long start,
1789 unsigned long end, struct sp_node *new)
1790{
1791 struct sp_node *n, *new2 = NULL;
1792
1793restart:
1794 spin_lock(&sp->lock);
1795 n = sp_lookup(sp, start, end);
1796 /* Take care of old policies in the same range. */
1797 while (n && n->start < end) {
1798 struct rb_node *next = rb_next(&n->nd);
1799 if (n->start >= start) {
1800 if (n->end <= end)
1801 sp_delete(sp, n);
1802 else
1803 n->start = end;
1804 } else {
1805 /* Old policy spanning whole new range. */
1806 if (n->end > end) {
1807 if (!new2) {
1808 spin_unlock(&sp->lock);
1809 new2 = sp_alloc(end, n->end, n->policy);
1810 if (!new2)
1811 return -ENOMEM;
1812 goto restart;
1813 }
1814 n->end = start;
1815 sp_insert(sp, new2);
1816 new2 = NULL;
1817 break;
1818 } else
1819 n->end = start;
1820 }
1821 if (!next)
1822 break;
1823 n = rb_entry(next, struct sp_node, nd);
1824 }
1825 if (new)
1826 sp_insert(sp, new);
1827 spin_unlock(&sp->lock);
1828 if (new2) {
Lee Schermerhornf0be3d32008-04-28 02:13:08 -07001829 mpol_put(new2->policy);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001830 kmem_cache_free(sn_cache, new2);
1831 }
1832 return 0;
1833}
1834
Lee Schermerhorn71fe8042008-04-28 02:13:26 -07001835/**
1836 * mpol_shared_policy_init - initialize shared policy for inode
1837 * @sp: pointer to inode shared policy
1838 * @mpol: struct mempolicy to install
1839 *
1840 * Install non-NULL @mpol in inode's shared policy rb-tree.
1841 * On entry, the current task has a reference on a non-NULL @mpol.
1842 * This must be released on exit.
1843 */
1844void mpol_shared_policy_init(struct shared_policy *sp, struct mempolicy *mpol)
Robin Holt7339ff82006-01-14 13:20:48 -08001845{
Lee Schermerhorn71fe8042008-04-28 02:13:26 -07001846 sp->root = RB_ROOT; /* empty tree == default mempolicy */
1847 spin_lock_init(&sp->lock);
Robin Holt7339ff82006-01-14 13:20:48 -08001848
Lee Schermerhorn71fe8042008-04-28 02:13:26 -07001849 if (mpol) {
1850 struct vm_area_struct pvma;
1851 struct mempolicy *new;
Robin Holt7339ff82006-01-14 13:20:48 -08001852
Lee Schermerhorn71fe8042008-04-28 02:13:26 -07001853 /* contextualize the tmpfs mount point mempolicy */
1854 new = mpol_new(mpol->mode, mpol->flags, &mpol->w.user_nodemask);
1855 mpol_put(mpol); /* drop our ref on sb mpol */
1856 if (IS_ERR(new))
1857 return; /* no valid nodemask intersection */
Robin Holt7339ff82006-01-14 13:20:48 -08001858
Lee Schermerhorn71fe8042008-04-28 02:13:26 -07001859 /* Create pseudo-vma that contains just the policy */
1860 memset(&pvma, 0, sizeof(struct vm_area_struct));
1861 pvma.vm_end = TASK_SIZE; /* policy covers entire file */
1862 mpol_set_shared_policy(sp, &pvma, new); /* adds ref */
1863 mpol_put(new); /* drop initial ref */
Robin Holt7339ff82006-01-14 13:20:48 -08001864 }
1865}
1866
Linus Torvalds1da177e2005-04-16 15:20:36 -07001867int mpol_set_shared_policy(struct shared_policy *info,
1868 struct vm_area_struct *vma, struct mempolicy *npol)
1869{
1870 int err;
1871 struct sp_node *new = NULL;
1872 unsigned long sz = vma_pages(vma);
1873
David Rientjes028fec42008-04-28 02:12:25 -07001874 pr_debug("set_shared_policy %lx sz %lu %d %d %lx\n",
Linus Torvalds1da177e2005-04-16 15:20:36 -07001875 vma->vm_pgoff,
Lee Schermerhorn45c47452008-04-28 02:13:12 -07001876 sz, npol ? npol->mode : -1,
David Rientjes028fec42008-04-28 02:12:25 -07001877 npol ? npol->flags : -1,
Paul Mundt140d5a42007-07-15 23:38:16 -07001878 npol ? nodes_addr(npol->v.nodes)[0] : -1);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001879
1880 if (npol) {
1881 new = sp_alloc(vma->vm_pgoff, vma->vm_pgoff + sz, npol);
1882 if (!new)
1883 return -ENOMEM;
1884 }
1885 err = shared_policy_replace(info, vma->vm_pgoff, vma->vm_pgoff+sz, new);
1886 if (err && new)
1887 kmem_cache_free(sn_cache, new);
1888 return err;
1889}
1890
1891/* Free a backing policy store on inode delete. */
1892void mpol_free_shared_policy(struct shared_policy *p)
1893{
1894 struct sp_node *n;
1895 struct rb_node *next;
1896
1897 if (!p->root.rb_node)
1898 return;
1899 spin_lock(&p->lock);
1900 next = rb_first(&p->root);
1901 while (next) {
1902 n = rb_entry(next, struct sp_node, nd);
1903 next = rb_next(&n->nd);
Andi Kleen90c50292005-07-27 11:43:50 -07001904 rb_erase(&n->nd, &p->root);
Lee Schermerhornf0be3d32008-04-28 02:13:08 -07001905 mpol_put(n->policy);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001906 kmem_cache_free(sn_cache, n);
1907 }
1908 spin_unlock(&p->lock);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001909}
1910
1911/* assumes fs == KERNEL_DS */
1912void __init numa_policy_init(void)
1913{
Paul Mundtb71636e2007-07-15 23:38:15 -07001914 nodemask_t interleave_nodes;
1915 unsigned long largest = 0;
1916 int nid, prefer = 0;
1917
Linus Torvalds1da177e2005-04-16 15:20:36 -07001918 policy_cache = kmem_cache_create("numa_policy",
1919 sizeof(struct mempolicy),
Paul Mundt20c2df82007-07-20 10:11:58 +09001920 0, SLAB_PANIC, NULL);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001921
1922 sn_cache = kmem_cache_create("shared_policy_node",
1923 sizeof(struct sp_node),
Paul Mundt20c2df82007-07-20 10:11:58 +09001924 0, SLAB_PANIC, NULL);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001925
Paul Mundtb71636e2007-07-15 23:38:15 -07001926 /*
1927 * Set interleaving policy for system init. Interleaving is only
1928 * enabled across suitably sized nodes (default is >= 16MB), or
1929 * fall back to the largest node if they're all smaller.
1930 */
1931 nodes_clear(interleave_nodes);
Christoph Lameter56bbd652007-10-16 01:25:35 -07001932 for_each_node_state(nid, N_HIGH_MEMORY) {
Paul Mundtb71636e2007-07-15 23:38:15 -07001933 unsigned long total_pages = node_present_pages(nid);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001934
Paul Mundtb71636e2007-07-15 23:38:15 -07001935 /* Preserve the largest node */
1936 if (largest < total_pages) {
1937 largest = total_pages;
1938 prefer = nid;
1939 }
1940
1941 /* Interleave this node? */
1942 if ((total_pages << PAGE_SHIFT) >= (16 << 20))
1943 node_set(nid, interleave_nodes);
1944 }
1945
1946 /* All too small, use the largest */
1947 if (unlikely(nodes_empty(interleave_nodes)))
1948 node_set(prefer, interleave_nodes);
1949
David Rientjes028fec42008-04-28 02:12:25 -07001950 if (do_set_mempolicy(MPOL_INTERLEAVE, 0, &interleave_nodes))
Linus Torvalds1da177e2005-04-16 15:20:36 -07001951 printk("numa_policy_init: interleaving failed\n");
1952}
1953
Christoph Lameter8bccd852005-10-29 18:16:59 -07001954/* Reset policy of current process to default */
Linus Torvalds1da177e2005-04-16 15:20:36 -07001955void numa_default_policy(void)
1956{
David Rientjes028fec42008-04-28 02:12:25 -07001957 do_set_mempolicy(MPOL_DEFAULT, 0, NULL);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001958}
Paul Jackson68860ec2005-10-30 15:02:36 -08001959
Paul Jackson42253992006-01-08 01:01:59 -08001960/*
Lee Schermerhorn095f1fc2008-04-28 02:13:23 -07001961 * Parse and format mempolicy from/to strings
1962 */
1963
1964/*
Lee Schermerhornfc36b8d2008-04-28 02:13:21 -07001965 * "local" is pseudo-policy: MPOL_PREFERRED with MPOL_F_LOCAL flag
Lee Schermerhorn3f226aa2008-04-28 02:13:24 -07001966 * Used only for mpol_parse_str() and mpol_to_str()
Christoph Lameter1a75a6c2006-01-08 01:01:02 -08001967 */
Lee Schermerhorn53f25562008-04-28 02:13:20 -07001968#define MPOL_LOCAL (MPOL_INTERLEAVE + 1)
Helge Deller15ad7cd2006-12-06 20:40:36 -08001969static const char * const policy_types[] =
Lee Schermerhorn53f25562008-04-28 02:13:20 -07001970 { "default", "prefer", "bind", "interleave", "local" };
Christoph Lameter1a75a6c2006-01-08 01:01:02 -08001971
Lee Schermerhorn095f1fc2008-04-28 02:13:23 -07001972
1973#ifdef CONFIG_TMPFS
1974/**
1975 * mpol_parse_str - parse string to mempolicy
1976 * @str: string containing mempolicy to parse
Lee Schermerhorn71fe8042008-04-28 02:13:26 -07001977 * @mpol: pointer to struct mempolicy pointer, returned on success.
1978 * @no_context: flag whether to "contextualize" the mempolicy
Lee Schermerhorn095f1fc2008-04-28 02:13:23 -07001979 *
1980 * Format of input:
1981 * <mode>[=<flags>][:<nodelist>]
1982 *
Lee Schermerhorn71fe8042008-04-28 02:13:26 -07001983 * if @no_context is true, save the input nodemask in w.user_nodemask in
1984 * the returned mempolicy. This will be used to "clone" the mempolicy in
1985 * a specific context [cpuset] at a later time. Used to parse tmpfs mpol
1986 * mount option. Note that if 'static' or 'relative' mode flags were
1987 * specified, the input nodemask will already have been saved. Saving
1988 * it again is redundant, but safe.
1989 *
1990 * On success, returns 0, else 1
Lee Schermerhorn095f1fc2008-04-28 02:13:23 -07001991 */
Lee Schermerhorn71fe8042008-04-28 02:13:26 -07001992int mpol_parse_str(char *str, struct mempolicy **mpol, int no_context)
Lee Schermerhorn095f1fc2008-04-28 02:13:23 -07001993{
Lee Schermerhorn71fe8042008-04-28 02:13:26 -07001994 struct mempolicy *new = NULL;
1995 unsigned short uninitialized_var(mode);
1996 unsigned short uninitialized_var(mode_flags);
1997 nodemask_t nodes;
Lee Schermerhorn095f1fc2008-04-28 02:13:23 -07001998 char *nodelist = strchr(str, ':');
1999 char *flags = strchr(str, '=');
2000 int i;
2001 int err = 1;
2002
2003 if (nodelist) {
2004 /* NUL-terminate mode or flags string */
2005 *nodelist++ = '\0';
Lee Schermerhorn71fe8042008-04-28 02:13:26 -07002006 if (nodelist_parse(nodelist, nodes))
Lee Schermerhorn095f1fc2008-04-28 02:13:23 -07002007 goto out;
Lee Schermerhorn71fe8042008-04-28 02:13:26 -07002008 if (!nodes_subset(nodes, node_states[N_HIGH_MEMORY]))
Lee Schermerhorn095f1fc2008-04-28 02:13:23 -07002009 goto out;
Lee Schermerhorn71fe8042008-04-28 02:13:26 -07002010 } else
2011 nodes_clear(nodes);
2012
Lee Schermerhorn095f1fc2008-04-28 02:13:23 -07002013 if (flags)
2014 *flags++ = '\0'; /* terminate mode string */
2015
Lee Schermerhorn3f226aa2008-04-28 02:13:24 -07002016 for (i = 0; i <= MPOL_LOCAL; i++) {
Lee Schermerhorn095f1fc2008-04-28 02:13:23 -07002017 if (!strcmp(str, policy_types[i])) {
Lee Schermerhorn71fe8042008-04-28 02:13:26 -07002018 mode = i;
Lee Schermerhorn095f1fc2008-04-28 02:13:23 -07002019 break;
2020 }
2021 }
Lee Schermerhorn3f226aa2008-04-28 02:13:24 -07002022 if (i > MPOL_LOCAL)
Lee Schermerhorn095f1fc2008-04-28 02:13:23 -07002023 goto out;
2024
Lee Schermerhorn71fe8042008-04-28 02:13:26 -07002025 switch (mode) {
Lee Schermerhorn095f1fc2008-04-28 02:13:23 -07002026 case MPOL_PREFERRED:
Lee Schermerhorn71fe8042008-04-28 02:13:26 -07002027 /*
2028 * Insist on a nodelist of one node only
2029 */
Lee Schermerhorn095f1fc2008-04-28 02:13:23 -07002030 if (nodelist) {
2031 char *rest = nodelist;
2032 while (isdigit(*rest))
2033 rest++;
2034 if (!*rest)
2035 err = 0;
2036 }
2037 break;
Lee Schermerhorn095f1fc2008-04-28 02:13:23 -07002038 case MPOL_INTERLEAVE:
2039 /*
2040 * Default to online nodes with memory if no nodelist
2041 */
2042 if (!nodelist)
Lee Schermerhorn71fe8042008-04-28 02:13:26 -07002043 nodes = node_states[N_HIGH_MEMORY];
Lee Schermerhorn095f1fc2008-04-28 02:13:23 -07002044 err = 0;
Lee Schermerhorn3f226aa2008-04-28 02:13:24 -07002045 break;
Lee Schermerhorn71fe8042008-04-28 02:13:26 -07002046 case MPOL_LOCAL:
Lee Schermerhorn3f226aa2008-04-28 02:13:24 -07002047 /*
Lee Schermerhorn71fe8042008-04-28 02:13:26 -07002048 * Don't allow a nodelist; mpol_new() checks flags
Lee Schermerhorn3f226aa2008-04-28 02:13:24 -07002049 */
Lee Schermerhorn71fe8042008-04-28 02:13:26 -07002050 if (nodelist)
Lee Schermerhorn3f226aa2008-04-28 02:13:24 -07002051 goto out;
Lee Schermerhorn71fe8042008-04-28 02:13:26 -07002052 mode = MPOL_PREFERRED;
Lee Schermerhorn3f226aa2008-04-28 02:13:24 -07002053 break;
Lee Schermerhorn71fe8042008-04-28 02:13:26 -07002054
2055 /*
2056 * case MPOL_BIND: mpol_new() enforces non-empty nodemask.
2057 * case MPOL_DEFAULT: mpol_new() enforces empty nodemask, ignores flags.
2058 */
Lee Schermerhorn095f1fc2008-04-28 02:13:23 -07002059 }
2060
Lee Schermerhorn71fe8042008-04-28 02:13:26 -07002061 mode_flags = 0;
Lee Schermerhorn095f1fc2008-04-28 02:13:23 -07002062 if (flags) {
2063 /*
2064 * Currently, we only support two mutually exclusive
2065 * mode flags.
2066 */
2067 if (!strcmp(flags, "static"))
Lee Schermerhorn71fe8042008-04-28 02:13:26 -07002068 mode_flags |= MPOL_F_STATIC_NODES;
Lee Schermerhorn095f1fc2008-04-28 02:13:23 -07002069 else if (!strcmp(flags, "relative"))
Lee Schermerhorn71fe8042008-04-28 02:13:26 -07002070 mode_flags |= MPOL_F_RELATIVE_NODES;
Lee Schermerhorn095f1fc2008-04-28 02:13:23 -07002071 else
2072 err = 1;
2073 }
Lee Schermerhorn71fe8042008-04-28 02:13:26 -07002074
2075 new = mpol_new(mode, mode_flags, &nodes);
2076 if (IS_ERR(new))
2077 err = 1;
2078 else if (no_context)
2079 new->w.user_nodemask = nodes; /* save for contextualization */
2080
Lee Schermerhorn095f1fc2008-04-28 02:13:23 -07002081out:
2082 /* Restore string for error message */
2083 if (nodelist)
2084 *--nodelist = ':';
2085 if (flags)
2086 *--flags = '=';
Lee Schermerhorn71fe8042008-04-28 02:13:26 -07002087 if (!err)
2088 *mpol = new;
Lee Schermerhorn095f1fc2008-04-28 02:13:23 -07002089 return err;
2090}
2091#endif /* CONFIG_TMPFS */
2092
Lee Schermerhorn71fe8042008-04-28 02:13:26 -07002093/**
2094 * mpol_to_str - format a mempolicy structure for printing
2095 * @buffer: to contain formatted mempolicy string
2096 * @maxlen: length of @buffer
2097 * @pol: pointer to mempolicy to be formatted
2098 * @no_context: "context free" mempolicy - use nodemask in w.user_nodemask
2099 *
Christoph Lameter1a75a6c2006-01-08 01:01:02 -08002100 * Convert a mempolicy into a string.
2101 * Returns the number of characters in buffer (if positive)
2102 * or an error (negative)
2103 */
Lee Schermerhorn71fe8042008-04-28 02:13:26 -07002104int mpol_to_str(char *buffer, int maxlen, struct mempolicy *pol, int no_context)
Christoph Lameter1a75a6c2006-01-08 01:01:02 -08002105{
2106 char *p = buffer;
2107 int l;
2108 nodemask_t nodes;
Lee Schermerhornbea904d2008-04-28 02:13:18 -07002109 unsigned short mode;
David Rientjesf5b087b2008-04-28 02:12:27 -07002110 unsigned short flags = pol ? pol->flags : 0;
Christoph Lameter1a75a6c2006-01-08 01:01:02 -08002111
Lee Schermerhorn22919902008-04-28 02:13:22 -07002112 /*
2113 * Sanity check: room for longest mode, flag and some nodes
2114 */
2115 VM_BUG_ON(maxlen < strlen("interleave") + strlen("relative") + 16);
2116
Lee Schermerhornbea904d2008-04-28 02:13:18 -07002117 if (!pol || pol == &default_policy)
2118 mode = MPOL_DEFAULT;
2119 else
2120 mode = pol->mode;
2121
Christoph Lameter1a75a6c2006-01-08 01:01:02 -08002122 switch (mode) {
2123 case MPOL_DEFAULT:
2124 nodes_clear(nodes);
2125 break;
2126
2127 case MPOL_PREFERRED:
2128 nodes_clear(nodes);
Lee Schermerhornfc36b8d2008-04-28 02:13:21 -07002129 if (flags & MPOL_F_LOCAL)
Lee Schermerhorn53f25562008-04-28 02:13:20 -07002130 mode = MPOL_LOCAL; /* pseudo-policy */
2131 else
Lee Schermerhornfc36b8d2008-04-28 02:13:21 -07002132 node_set(pol->v.preferred_node, nodes);
Christoph Lameter1a75a6c2006-01-08 01:01:02 -08002133 break;
2134
2135 case MPOL_BIND:
Mel Gorman19770b32008-04-28 02:12:18 -07002136 /* Fall through */
Christoph Lameter1a75a6c2006-01-08 01:01:02 -08002137 case MPOL_INTERLEAVE:
Lee Schermerhorn71fe8042008-04-28 02:13:26 -07002138 if (no_context)
2139 nodes = pol->w.user_nodemask;
2140 else
2141 nodes = pol->v.nodes;
Christoph Lameter1a75a6c2006-01-08 01:01:02 -08002142 break;
2143
2144 default:
2145 BUG();
Christoph Lameter1a75a6c2006-01-08 01:01:02 -08002146 }
2147
2148 l = strlen(policy_types[mode]);
Lee Schermerhorn53f25562008-04-28 02:13:20 -07002149 if (buffer + maxlen < p + l + 1)
2150 return -ENOSPC;
Christoph Lameter1a75a6c2006-01-08 01:01:02 -08002151
2152 strcpy(p, policy_types[mode]);
2153 p += l;
2154
Lee Schermerhornfc36b8d2008-04-28 02:13:21 -07002155 if (flags & MPOL_MODE_FLAGS) {
David Rientjesf5b087b2008-04-28 02:12:27 -07002156 if (buffer + maxlen < p + 2)
2157 return -ENOSPC;
2158 *p++ = '=';
2159
Lee Schermerhorn22919902008-04-28 02:13:22 -07002160 /*
2161 * Currently, the only defined flags are mutually exclusive
2162 */
David Rientjesf5b087b2008-04-28 02:12:27 -07002163 if (flags & MPOL_F_STATIC_NODES)
Lee Schermerhorn22919902008-04-28 02:13:22 -07002164 p += snprintf(p, buffer + maxlen - p, "static");
2165 else if (flags & MPOL_F_RELATIVE_NODES)
2166 p += snprintf(p, buffer + maxlen - p, "relative");
David Rientjesf5b087b2008-04-28 02:12:27 -07002167 }
2168
Christoph Lameter1a75a6c2006-01-08 01:01:02 -08002169 if (!nodes_empty(nodes)) {
2170 if (buffer + maxlen < p + 2)
2171 return -ENOSPC;
Lee Schermerhorn095f1fc2008-04-28 02:13:23 -07002172 *p++ = ':';
Christoph Lameter1a75a6c2006-01-08 01:01:02 -08002173 p += nodelist_scnprintf(p, buffer + maxlen - p, nodes);
2174 }
2175 return p - buffer;
2176}
2177
2178struct numa_maps {
2179 unsigned long pages;
2180 unsigned long anon;
Christoph Lameter397874d2006-03-06 15:42:53 -08002181 unsigned long active;
2182 unsigned long writeback;
Christoph Lameter1a75a6c2006-01-08 01:01:02 -08002183 unsigned long mapcount_max;
Christoph Lameter397874d2006-03-06 15:42:53 -08002184 unsigned long dirty;
2185 unsigned long swapcache;
Christoph Lameter1a75a6c2006-01-08 01:01:02 -08002186 unsigned long node[MAX_NUMNODES];
2187};
2188
Christoph Lameter397874d2006-03-06 15:42:53 -08002189static void gather_stats(struct page *page, void *private, int pte_dirty)
Christoph Lameter1a75a6c2006-01-08 01:01:02 -08002190{
2191 struct numa_maps *md = private;
2192 int count = page_mapcount(page);
2193
Christoph Lameter1a75a6c2006-01-08 01:01:02 -08002194 md->pages++;
Christoph Lameter397874d2006-03-06 15:42:53 -08002195 if (pte_dirty || PageDirty(page))
2196 md->dirty++;
2197
2198 if (PageSwapCache(page))
2199 md->swapcache++;
2200
2201 if (PageActive(page))
2202 md->active++;
2203
2204 if (PageWriteback(page))
2205 md->writeback++;
Christoph Lameter1a75a6c2006-01-08 01:01:02 -08002206
2207 if (PageAnon(page))
2208 md->anon++;
2209
Christoph Lameter397874d2006-03-06 15:42:53 -08002210 if (count > md->mapcount_max)
2211 md->mapcount_max = count;
2212
Christoph Lameter1a75a6c2006-01-08 01:01:02 -08002213 md->node[page_to_nid(page)]++;
Christoph Lameter1a75a6c2006-01-08 01:01:02 -08002214}
2215
Andrew Morton7f709ed2006-03-07 21:55:22 -08002216#ifdef CONFIG_HUGETLB_PAGE
Christoph Lameter397874d2006-03-06 15:42:53 -08002217static void check_huge_range(struct vm_area_struct *vma,
2218 unsigned long start, unsigned long end,
2219 struct numa_maps *md)
2220{
2221 unsigned long addr;
2222 struct page *page;
2223
2224 for (addr = start; addr < end; addr += HPAGE_SIZE) {
2225 pte_t *ptep = huge_pte_offset(vma->vm_mm, addr & HPAGE_MASK);
2226 pte_t pte;
2227
2228 if (!ptep)
2229 continue;
2230
2231 pte = *ptep;
2232 if (pte_none(pte))
2233 continue;
2234
2235 page = pte_page(pte);
2236 if (!page)
2237 continue;
2238
2239 gather_stats(page, md, pte_dirty(*ptep));
2240 }
2241}
Andrew Morton7f709ed2006-03-07 21:55:22 -08002242#else
2243static inline void check_huge_range(struct vm_area_struct *vma,
2244 unsigned long start, unsigned long end,
2245 struct numa_maps *md)
2246{
2247}
2248#endif
Christoph Lameter397874d2006-03-06 15:42:53 -08002249
Lee Schermerhorn53f25562008-04-28 02:13:20 -07002250/*
2251 * Display pages allocated per node and memory policy via /proc.
2252 */
Christoph Lameter1a75a6c2006-01-08 01:01:02 -08002253int show_numa_map(struct seq_file *m, void *v)
2254{
Eric W. Biederman99f89552006-06-26 00:25:55 -07002255 struct proc_maps_private *priv = m->private;
Christoph Lameter1a75a6c2006-01-08 01:01:02 -08002256 struct vm_area_struct *vma = v;
2257 struct numa_maps *md;
Christoph Lameter397874d2006-03-06 15:42:53 -08002258 struct file *file = vma->vm_file;
2259 struct mm_struct *mm = vma->vm_mm;
Lee Schermerhorn480eccf2007-09-18 22:46:47 -07002260 struct mempolicy *pol;
Christoph Lameter1a75a6c2006-01-08 01:01:02 -08002261 int n;
2262 char buffer[50];
2263
Christoph Lameter397874d2006-03-06 15:42:53 -08002264 if (!mm)
Christoph Lameter1a75a6c2006-01-08 01:01:02 -08002265 return 0;
2266
2267 md = kzalloc(sizeof(struct numa_maps), GFP_KERNEL);
2268 if (!md)
2269 return 0;
2270
Lee Schermerhorn480eccf2007-09-18 22:46:47 -07002271 pol = get_vma_policy(priv->task, vma, vma->vm_start);
Lee Schermerhorn71fe8042008-04-28 02:13:26 -07002272 mpol_to_str(buffer, sizeof(buffer), pol, 0);
Lee Schermerhorn52cd3b02008-04-28 02:13:16 -07002273 mpol_cond_put(pol);
Christoph Lameter1a75a6c2006-01-08 01:01:02 -08002274
Christoph Lameter397874d2006-03-06 15:42:53 -08002275 seq_printf(m, "%08lx %s", vma->vm_start, buffer);
Christoph Lameter1a75a6c2006-01-08 01:01:02 -08002276
Christoph Lameter397874d2006-03-06 15:42:53 -08002277 if (file) {
2278 seq_printf(m, " file=");
Jan Blunckc32c2f62008-02-14 19:38:43 -08002279 seq_path(m, &file->f_path, "\n\t= ");
Christoph Lameter397874d2006-03-06 15:42:53 -08002280 } else if (vma->vm_start <= mm->brk && vma->vm_end >= mm->start_brk) {
2281 seq_printf(m, " heap");
2282 } else if (vma->vm_start <= mm->start_stack &&
2283 vma->vm_end >= mm->start_stack) {
2284 seq_printf(m, " stack");
Christoph Lameter1a75a6c2006-01-08 01:01:02 -08002285 }
Christoph Lameter397874d2006-03-06 15:42:53 -08002286
2287 if (is_vm_hugetlb_page(vma)) {
2288 check_huge_range(vma, vma->vm_start, vma->vm_end, md);
2289 seq_printf(m, " huge");
2290 } else {
2291 check_pgd_range(vma, vma->vm_start, vma->vm_end,
Christoph Lameter56bbd652007-10-16 01:25:35 -07002292 &node_states[N_HIGH_MEMORY], MPOL_MF_STATS, md);
Christoph Lameter397874d2006-03-06 15:42:53 -08002293 }
2294
2295 if (!md->pages)
2296 goto out;
2297
2298 if (md->anon)
2299 seq_printf(m," anon=%lu",md->anon);
2300
2301 if (md->dirty)
2302 seq_printf(m," dirty=%lu",md->dirty);
2303
2304 if (md->pages != md->anon && md->pages != md->dirty)
2305 seq_printf(m, " mapped=%lu", md->pages);
2306
2307 if (md->mapcount_max > 1)
2308 seq_printf(m, " mapmax=%lu", md->mapcount_max);
2309
2310 if (md->swapcache)
2311 seq_printf(m," swapcache=%lu", md->swapcache);
2312
2313 if (md->active < md->pages && !is_vm_hugetlb_page(vma))
2314 seq_printf(m," active=%lu", md->active);
2315
2316 if (md->writeback)
2317 seq_printf(m," writeback=%lu", md->writeback);
2318
Christoph Lameter56bbd652007-10-16 01:25:35 -07002319 for_each_node_state(n, N_HIGH_MEMORY)
Christoph Lameter397874d2006-03-06 15:42:53 -08002320 if (md->node[n])
2321 seq_printf(m, " N%d=%lu", n, md->node[n]);
2322out:
2323 seq_putc(m, '\n');
Christoph Lameter1a75a6c2006-01-08 01:01:02 -08002324 kfree(md);
2325
2326 if (m->count < m->size)
Eric W. Biederman99f89552006-06-26 00:25:55 -07002327 m->version = (vma != priv->tail_vma) ? vma->vm_start : 0;
Christoph Lameter1a75a6c2006-01-08 01:01:02 -08002328 return 0;
2329}