mempolicy.c 46.6 KB
Newer Older
L
Linus Torvalds 已提交
1 2 3 4
/*
 * Simple NUMA memory policy for the Linux kernel.
 *
 * Copyright 2003,2004 Andi Kleen, SuSE Labs.
5
 * (C) Copyright 2005 Christoph Lameter, Silicon Graphics, Inc.
L
Linus Torvalds 已提交
6 7 8 9 10 11 12 13 14 15 16 17 18 19 20
 * Subject to the GNU Public License, version 2.
 *
 * NUMA policy allows the user to give hints in which node(s) memory should
 * be allocated.
 *
 * Support four policies per VMA and per process:
 *
 * The VMA policy has priority over the process policy for a page fault.
 *
 * interleave     Allocate memory interleaved over a set of nodes,
 *                with normal fallback if it fails.
 *                For VMA based allocations this interleaves based on the
 *                offset into the backing object or offset into the mapping
 *                for anonymous memory. For process policy an process counter
 *                is used.
21
 *
L
Linus Torvalds 已提交
22 23
 * bind           Only allocate memory on a specific set of nodes,
 *                no fallback.
24 25 26 27
 *                FIXME: memory is allocated starting with the first node
 *                to the last. It would be better if bind would truly restrict
 *                the allocation to memory nodes instead
 *
L
Linus Torvalds 已提交
28 29 30 31 32
 * preferred       Try a specific node first before normal fallback.
 *                As a special case node -1 here means do the allocation
 *                on the local CPU. This is normally identical to default,
 *                but useful to set in a VMA when you have a non default
 *                process policy.
33
 *
L
Linus Torvalds 已提交
34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85
 * default        Allocate on the local node first, or when on a VMA
 *                use the process policy. This is what Linux always did
 *		  in a NUMA aware kernel and still does by, ahem, default.
 *
 * The process policy is applied for most non interrupt memory allocations
 * in that process' context. Interrupts ignore the policies and always
 * try to allocate on the local CPU. The VMA policy is only applied for memory
 * allocations for a VMA in the VM.
 *
 * Currently there are a few corner cases in swapping where the policy
 * is not applied, but the majority should be handled. When process policy
 * is used it is not remembered over swap outs/swap ins.
 *
 * Only the highest zone in the zone hierarchy gets policied. Allocations
 * requesting a lower zone just use default policy. This implies that
 * on systems with highmem kernel lowmem allocation don't get policied.
 * Same with GFP_DMA allocations.
 *
 * For shmfs/tmpfs/hugetlbfs shared memory the policy is shared between
 * all users and remembered even when nobody has memory mapped.
 */

/* Notebook:
   fix mmap readahead to honour policy and enable policy for any page cache
   object
   statistics for bigpages
   global policy for page cache? currently it uses process policy. Requires
   first item above.
   handle mremap for shared memory (currently ignored for the policy)
   grows down?
   make bind policy root only? It can trigger oom much faster and the
   kernel is not always grateful with that.
   could replace all the switch()es with a mempolicy_ops structure.
*/

#include <linux/mempolicy.h>
#include <linux/mm.h>
#include <linux/highmem.h>
#include <linux/hugetlb.h>
#include <linux/kernel.h>
#include <linux/sched.h>
#include <linux/mm.h>
#include <linux/nodemask.h>
#include <linux/cpuset.h>
#include <linux/gfp.h>
#include <linux/slab.h>
#include <linux/string.h>
#include <linux/module.h>
#include <linux/interrupt.h>
#include <linux/init.h>
#include <linux/compat.h>
#include <linux/mempolicy.h>
86
#include <linux/swap.h>
87 88
#include <linux/seq_file.h>
#include <linux/proc_fs.h>
C
Christoph Lameter 已提交
89
#include <linux/migrate.h>
90
#include <linux/rmap.h>
91
#include <linux/security.h>
92

L
Linus Torvalds 已提交
93 94 95
#include <asm/tlbflush.h>
#include <asm/uaccess.h>

96
/* Internal flags */
97
#define MPOL_MF_DISCONTIG_OK (MPOL_MF_INTERNAL << 0)	/* Skip checks for continuous vmas */
98
#define MPOL_MF_INVERT (MPOL_MF_INTERNAL << 1)		/* Invert check for nodemask */
99
#define MPOL_MF_STATS (MPOL_MF_INTERNAL << 2)		/* Gather statistics */
100

101 102
static struct kmem_cache *policy_cache;
static struct kmem_cache *sn_cache;
L
Linus Torvalds 已提交
103 104 105 106 107

#define PDprintk(fmt...)

/* Highest zone. An specific allocation for a zone below that is not
   policied. */
108
int policy_zone = ZONE_DMA;
L
Linus Torvalds 已提交
109

110
struct mempolicy default_policy = {
L
Linus Torvalds 已提交
111 112 113 114 115
	.refcnt = ATOMIC_INIT(1), /* never free it */
	.policy = MPOL_DEFAULT,
};

/* Do sanity checking on a policy */
116
static int mpol_check_policy(int mode, nodemask_t *nodes)
L
Linus Torvalds 已提交
117
{
118
	int empty = nodes_empty(*nodes);
L
Linus Torvalds 已提交
119 120 121 122 123 124 125 126 127 128 129 130 131 132

	switch (mode) {
	case MPOL_DEFAULT:
		if (!empty)
			return -EINVAL;
		break;
	case MPOL_BIND:
	case MPOL_INTERLEAVE:
		/* Preferred will only use the first bit, but allow
		   more for now. */
		if (empty)
			return -EINVAL;
		break;
	}
133
	return nodes_subset(*nodes, node_online_map) ? 0 : -EINVAL;
L
Linus Torvalds 已提交
134
}
135

L
Linus Torvalds 已提交
136
/* Generate a custom zonelist for the BIND policy. */
137
static struct zonelist *bind_zonelist(nodemask_t *nodes)
L
Linus Torvalds 已提交
138 139
{
	struct zonelist *zl;
140
	int num, max, nd, k;
L
Linus Torvalds 已提交
141

142
	max = 1 + MAX_NR_ZONES * nodes_weight(*nodes);
143
	zl = kmalloc(sizeof(struct zone *) * max, GFP_KERNEL);
L
Linus Torvalds 已提交
144 145 146
	if (!zl)
		return NULL;
	num = 0;
147 148 149 150 151 152 153 154 155 156 157
	/* First put in the highest zones from all nodes, then all the next 
	   lower zones etc. Avoid empty zones because the memory allocator
	   doesn't like them. If you implement node hot removal you
	   have to fix that. */
	for (k = policy_zone; k >= 0; k--) { 
		for_each_node_mask(nd, *nodes) { 
			struct zone *z = &NODE_DATA(nd)->node_zones[k];
			if (z->present_pages > 0) 
				zl->zones[num++] = z;
		}
	}
L
Linus Torvalds 已提交
158 159 160 161 162
	zl->zones[num] = NULL;
	return zl;
}

/* Create a new policy */
163
static struct mempolicy *mpol_new(int mode, nodemask_t *nodes)
L
Linus Torvalds 已提交
164 165 166
{
	struct mempolicy *policy;

167
	PDprintk("setting mode %d nodes[0] %lx\n", mode, nodes_addr(*nodes)[0]);
L
Linus Torvalds 已提交
168 169 170 171 172 173 174 175
	if (mode == MPOL_DEFAULT)
		return NULL;
	policy = kmem_cache_alloc(policy_cache, GFP_KERNEL);
	if (!policy)
		return ERR_PTR(-ENOMEM);
	atomic_set(&policy->refcnt, 1);
	switch (mode) {
	case MPOL_INTERLEAVE:
176
		policy->v.nodes = *nodes;
177 178 179 180
		if (nodes_weight(*nodes) == 0) {
			kmem_cache_free(policy_cache, policy);
			return ERR_PTR(-EINVAL);
		}
L
Linus Torvalds 已提交
181 182
		break;
	case MPOL_PREFERRED:
183
		policy->v.preferred_node = first_node(*nodes);
L
Linus Torvalds 已提交
184 185 186 187 188 189 190 191 192 193 194 195
		if (policy->v.preferred_node >= MAX_NUMNODES)
			policy->v.preferred_node = -1;
		break;
	case MPOL_BIND:
		policy->v.zonelist = bind_zonelist(nodes);
		if (policy->v.zonelist == NULL) {
			kmem_cache_free(policy_cache, policy);
			return ERR_PTR(-ENOMEM);
		}
		break;
	}
	policy->policy = mode;
196
	policy->cpuset_mems_allowed = cpuset_mems_allowed(current);
L
Linus Torvalds 已提交
197 198 199
	return policy;
}

C
Christoph Lameter 已提交
200
static void gather_stats(struct page *, void *, int pte_dirty);
201 202
static void migrate_page_add(struct page *page, struct list_head *pagelist,
				unsigned long flags);
203

204
/* Scan through pages checking if pages follow certain conditions. */
N
Nick Piggin 已提交
205
static int check_pte_range(struct vm_area_struct *vma, pmd_t *pmd,
206 207
		unsigned long addr, unsigned long end,
		const nodemask_t *nodes, unsigned long flags,
208
		void *private)
L
Linus Torvalds 已提交
209
{
210 211
	pte_t *orig_pte;
	pte_t *pte;
212
	spinlock_t *ptl;
213

214
	orig_pte = pte = pte_offset_map_lock(vma->vm_mm, pmd, addr, &ptl);
215
	do {
216
		struct page *page;
217 218 219
		unsigned int nid;

		if (!pte_present(*pte))
L
Linus Torvalds 已提交
220
			continue;
221 222
		page = vm_normal_page(vma, addr, *pte);
		if (!page)
L
Linus Torvalds 已提交
223
			continue;
224 225 226 227 228 229 230 231 232 233 234
		/*
		 * The check for PageReserved here is important to avoid
		 * handling zero pages and other pages that may have been
		 * marked special by the system.
		 *
		 * If the PageReserved would not be checked here then f.e.
		 * the location of the zero page could have an influence
		 * on MPOL_MF_STRICT, zero pages would be counted for
		 * the per node stats, and there would be useless attempts
		 * to put zero pages on the migration list.
		 */
235 236
		if (PageReserved(page))
			continue;
237
		nid = page_to_nid(page);
238 239 240
		if (node_isset(nid, *nodes) == !!(flags & MPOL_MF_INVERT))
			continue;

241
		if (flags & MPOL_MF_STATS)
C
Christoph Lameter 已提交
242
			gather_stats(page, private, pte_dirty(*pte));
243
		else if (flags & (MPOL_MF_MOVE | MPOL_MF_MOVE_ALL))
244
			migrate_page_add(page, private, flags);
245 246
		else
			break;
247
	} while (pte++, addr += PAGE_SIZE, addr != end);
248
	pte_unmap_unlock(orig_pte, ptl);
249 250 251
	return addr != end;
}

N
Nick Piggin 已提交
252
static inline int check_pmd_range(struct vm_area_struct *vma, pud_t *pud,
253 254
		unsigned long addr, unsigned long end,
		const nodemask_t *nodes, unsigned long flags,
255
		void *private)
256 257 258 259 260 261 262 263 264
{
	pmd_t *pmd;
	unsigned long next;

	pmd = pmd_offset(pud, addr);
	do {
		next = pmd_addr_end(addr, end);
		if (pmd_none_or_clear_bad(pmd))
			continue;
265
		if (check_pte_range(vma, pmd, addr, next, nodes,
266
				    flags, private))
267 268 269 270 271
			return -EIO;
	} while (pmd++, addr = next, addr != end);
	return 0;
}

N
Nick Piggin 已提交
272
static inline int check_pud_range(struct vm_area_struct *vma, pgd_t *pgd,
273 274
		unsigned long addr, unsigned long end,
		const nodemask_t *nodes, unsigned long flags,
275
		void *private)
276 277 278 279 280 281 282 283 284
{
	pud_t *pud;
	unsigned long next;

	pud = pud_offset(pgd, addr);
	do {
		next = pud_addr_end(addr, end);
		if (pud_none_or_clear_bad(pud))
			continue;
285
		if (check_pmd_range(vma, pud, addr, next, nodes,
286
				    flags, private))
287 288 289 290 291
			return -EIO;
	} while (pud++, addr = next, addr != end);
	return 0;
}

N
Nick Piggin 已提交
292
static inline int check_pgd_range(struct vm_area_struct *vma,
293 294
		unsigned long addr, unsigned long end,
		const nodemask_t *nodes, unsigned long flags,
295
		void *private)
296 297 298 299
{
	pgd_t *pgd;
	unsigned long next;

N
Nick Piggin 已提交
300
	pgd = pgd_offset(vma->vm_mm, addr);
301 302 303 304
	do {
		next = pgd_addr_end(addr, end);
		if (pgd_none_or_clear_bad(pgd))
			continue;
305
		if (check_pud_range(vma, pgd, addr, next, nodes,
306
				    flags, private))
307 308 309
			return -EIO;
	} while (pgd++, addr = next, addr != end);
	return 0;
L
Linus Torvalds 已提交
310 311
}

312 313 314 315
/* Check if a vma is migratable */
static inline int vma_migratable(struct vm_area_struct *vma)
{
	if (vma->vm_flags & (
316
		VM_LOCKED|VM_IO|VM_HUGETLB|VM_PFNMAP|VM_RESERVED))
317 318 319 320 321 322 323 324 325
		return 0;
	return 1;
}

/*
 * Check if all pages in a range are on a set of nodes.
 * If pagelist != NULL then isolate pages from the LRU and
 * put them on the pagelist.
 */
L
Linus Torvalds 已提交
326 327
static struct vm_area_struct *
check_range(struct mm_struct *mm, unsigned long start, unsigned long end,
328
		const nodemask_t *nodes, unsigned long flags, void *private)
L
Linus Torvalds 已提交
329 330 331 332
{
	int err;
	struct vm_area_struct *first, *vma, *prev;

333 334
	if (flags & (MPOL_MF_MOVE | MPOL_MF_MOVE_ALL)) {

C
Christoph Lameter 已提交
335 336 337
		err = migrate_prep();
		if (err)
			return ERR_PTR(err);
338
	}
339

L
Linus Torvalds 已提交
340 341 342 343 344
	first = find_vma(mm, start);
	if (!first)
		return ERR_PTR(-EFAULT);
	prev = NULL;
	for (vma = first; vma && vma->vm_start < end; vma = vma->vm_next) {
345 346 347 348 349 350 351 352 353 354
		if (!(flags & MPOL_MF_DISCONTIG_OK)) {
			if (!vma->vm_next && vma->vm_end < end)
				return ERR_PTR(-EFAULT);
			if (prev && prev->vm_end < vma->vm_start)
				return ERR_PTR(-EFAULT);
		}
		if (!is_vm_hugetlb_page(vma) &&
		    ((flags & MPOL_MF_STRICT) ||
		     ((flags & (MPOL_MF_MOVE | MPOL_MF_MOVE_ALL)) &&
				vma_migratable(vma)))) {
A
Andi Kleen 已提交
355
			unsigned long endvma = vma->vm_end;
356

A
Andi Kleen 已提交
357 358 359 360
			if (endvma > end)
				endvma = end;
			if (vma->vm_start > start)
				start = vma->vm_start;
361
			err = check_pgd_range(vma, start, endvma, nodes,
362
						flags, private);
L
Linus Torvalds 已提交
363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415
			if (err) {
				first = ERR_PTR(err);
				break;
			}
		}
		prev = vma;
	}
	return first;
}

/* Apply policy to a single VMA */
static int policy_vma(struct vm_area_struct *vma, struct mempolicy *new)
{
	int err = 0;
	struct mempolicy *old = vma->vm_policy;

	PDprintk("vma %lx-%lx/%lx vm_ops %p vm_file %p set_policy %p\n",
		 vma->vm_start, vma->vm_end, vma->vm_pgoff,
		 vma->vm_ops, vma->vm_file,
		 vma->vm_ops ? vma->vm_ops->set_policy : NULL);

	if (vma->vm_ops && vma->vm_ops->set_policy)
		err = vma->vm_ops->set_policy(vma, new);
	if (!err) {
		mpol_get(new);
		vma->vm_policy = new;
		mpol_free(old);
	}
	return err;
}

/* Step 2: apply policy to a range and do splits. */
static int mbind_range(struct vm_area_struct *vma, unsigned long start,
		       unsigned long end, struct mempolicy *new)
{
	struct vm_area_struct *next;
	int err;

	err = 0;
	for (; vma && vma->vm_start < end; vma = next) {
		next = vma->vm_next;
		if (vma->vm_start < start)
			err = split_vma(vma->vm_mm, vma, start, 1);
		if (!err && vma->vm_end > end)
			err = split_vma(vma->vm_mm, vma, end, 0);
		if (!err)
			err = policy_vma(vma, new);
		if (err)
			break;
	}
	return err;
}

416 417 418 419 420
static int contextualize_policy(int mode, nodemask_t *nodes)
{
	if (!nodes)
		return 0;

421
	cpuset_update_task_memory_state();
422 423
	if (!cpuset_nodes_subset_current_mems_allowed(*nodes))
		return -EINVAL;
424 425 426
	return mpol_check_policy(mode, nodes);
}

427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457

/*
 * Update task->flags PF_MEMPOLICY bit: set iff non-default
 * mempolicy.  Allows more rapid checking of this (combined perhaps
 * with other PF_* flag bits) on memory allocation hot code paths.
 *
 * If called from outside this file, the task 'p' should -only- be
 * a newly forked child not yet visible on the task list, because
 * manipulating the task flags of a visible task is not safe.
 *
 * The above limitation is why this routine has the funny name
 * mpol_fix_fork_child_flag().
 *
 * It is also safe to call this with a task pointer of current,
 * which the static wrapper mpol_set_task_struct_flag() does,
 * for use within this file.
 */

void mpol_fix_fork_child_flag(struct task_struct *p)
{
	if (p->mempolicy)
		p->flags |= PF_MEMPOLICY;
	else
		p->flags &= ~PF_MEMPOLICY;
}

static void mpol_set_task_struct_flag(void)
{
	mpol_fix_fork_child_flag(current);
}

L
Linus Torvalds 已提交
458
/* Set the process memory policy */
459
long do_set_mempolicy(int mode, nodemask_t *nodes)
L
Linus Torvalds 已提交
460 461 462
{
	struct mempolicy *new;

463
	if (contextualize_policy(mode, nodes))
L
Linus Torvalds 已提交
464
		return -EINVAL;
465
	new = mpol_new(mode, nodes);
L
Linus Torvalds 已提交
466 467 468 469
	if (IS_ERR(new))
		return PTR_ERR(new);
	mpol_free(current->mempolicy);
	current->mempolicy = new;
470
	mpol_set_task_struct_flag();
L
Linus Torvalds 已提交
471
	if (new && new->policy == MPOL_INTERLEAVE)
472
		current->il_next = first_node(new->v.nodes);
L
Linus Torvalds 已提交
473 474 475 476
	return 0;
}

/* Fill a zone bitmap for a policy */
477
static void get_zonemask(struct mempolicy *p, nodemask_t *nodes)
L
Linus Torvalds 已提交
478 479 480
{
	int i;

481
	nodes_clear(*nodes);
L
Linus Torvalds 已提交
482 483 484
	switch (p->policy) {
	case MPOL_BIND:
		for (i = 0; p->v.zonelist->zones[i]; i++)
485 486
			node_set(p->v.zonelist->zones[i]->zone_pgdat->node_id,
				*nodes);
L
Linus Torvalds 已提交
487 488 489 490
		break;
	case MPOL_DEFAULT:
		break;
	case MPOL_INTERLEAVE:
491
		*nodes = p->v.nodes;
L
Linus Torvalds 已提交
492 493 494 495
		break;
	case MPOL_PREFERRED:
		/* or use current node instead of online map? */
		if (p->v.preferred_node < 0)
496
			*nodes = node_online_map;
L
Linus Torvalds 已提交
497
		else
498
			node_set(p->v.preferred_node, *nodes);
L
Linus Torvalds 已提交
499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518
		break;
	default:
		BUG();
	}
}

static int lookup_node(struct mm_struct *mm, unsigned long addr)
{
	struct page *p;
	int err;

	err = get_user_pages(current, mm, addr & PAGE_MASK, 1, 0, 0, &p, NULL);
	if (err >= 0) {
		err = page_to_nid(p);
		put_page(p);
	}
	return err;
}

/* Retrieve NUMA policy */
519 520
long do_get_mempolicy(int *policy, nodemask_t *nmask,
			unsigned long addr, unsigned long flags)
L
Linus Torvalds 已提交
521
{
522
	int err;
L
Linus Torvalds 已提交
523 524 525 526
	struct mm_struct *mm = current->mm;
	struct vm_area_struct *vma = NULL;
	struct mempolicy *pol = current->mempolicy;

527
	cpuset_update_task_memory_state();
L
Linus Torvalds 已提交
528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551
	if (flags & ~(unsigned long)(MPOL_F_NODE|MPOL_F_ADDR))
		return -EINVAL;
	if (flags & MPOL_F_ADDR) {
		down_read(&mm->mmap_sem);
		vma = find_vma_intersection(mm, addr, addr+1);
		if (!vma) {
			up_read(&mm->mmap_sem);
			return -EFAULT;
		}
		if (vma->vm_ops && vma->vm_ops->get_policy)
			pol = vma->vm_ops->get_policy(vma, addr);
		else
			pol = vma->vm_policy;
	} else if (addr)
		return -EINVAL;

	if (!pol)
		pol = &default_policy;

	if (flags & MPOL_F_NODE) {
		if (flags & MPOL_F_ADDR) {
			err = lookup_node(mm, addr);
			if (err < 0)
				goto out;
552
			*policy = err;
L
Linus Torvalds 已提交
553 554
		} else if (pol == current->mempolicy &&
				pol->policy == MPOL_INTERLEAVE) {
555
			*policy = current->il_next;
L
Linus Torvalds 已提交
556 557 558 559 560
		} else {
			err = -EINVAL;
			goto out;
		}
	} else
561
		*policy = pol->policy;
L
Linus Torvalds 已提交
562 563 564 565 566 567 568

	if (vma) {
		up_read(&current->mm->mmap_sem);
		vma = NULL;
	}

	err = 0;
569 570
	if (nmask)
		get_zonemask(pol, nmask);
L
Linus Torvalds 已提交
571 572 573 574 575 576 577

 out:
	if (vma)
		up_read(&current->mm->mmap_sem);
	return err;
}

C
Christoph Lameter 已提交
578
#ifdef CONFIG_MIGRATION
579 580 581
/*
 * page migration
 */
582 583
static void migrate_page_add(struct page *page, struct list_head *pagelist,
				unsigned long flags)
584 585
{
	/*
586
	 * Avoid migrating a page that is shared with others.
587
	 */
C
Christoph Lameter 已提交
588 589
	if ((flags & MPOL_MF_MOVE_ALL) || page_mapcount(page) == 1)
		isolate_lru_page(page, pagelist);
590
}
591

592
static struct page *new_node_page(struct page *page, unsigned long node, int **x)
593 594 595 596
{
	return alloc_pages_node(node, GFP_HIGHUSER, 0);
}

597 598 599 600 601 602 603 604 605 606 607 608
/*
 * Migrate pages from one node to a target node.
 * Returns error or the number of pages not migrated.
 */
int migrate_to_node(struct mm_struct *mm, int source, int dest, int flags)
{
	nodemask_t nmask;
	LIST_HEAD(pagelist);
	int err = 0;

	nodes_clear(nmask);
	node_set(source, nmask);
609

610 611 612
	check_range(mm, mm->mmap->vm_start, TASK_SIZE, &nmask,
			flags | MPOL_MF_DISCONTIG_OK, &pagelist);

613
	if (!list_empty(&pagelist))
614 615
		err = migrate_pages(&pagelist, new_node_page, dest);

616
	return err;
617 618
}

619
/*
620 621
 * Move pages between the two nodesets so as to preserve the physical
 * layout as much as possible.
622 623 624 625 626 627 628
 *
 * Returns the number of page that could not be moved.
 */
int do_migrate_pages(struct mm_struct *mm,
	const nodemask_t *from_nodes, const nodemask_t *to_nodes, int flags)
{
	LIST_HEAD(pagelist);
629 630 631
	int busy = 0;
	int err = 0;
	nodemask_t tmp;
632

633
  	down_read(&mm->mmap_sem);
634

635 636 637 638
	err = migrate_vmas(mm, from_nodes, to_nodes, flags);
	if (err)
		goto out;

639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668
/*
 * Find a 'source' bit set in 'tmp' whose corresponding 'dest'
 * bit in 'to' is not also set in 'tmp'.  Clear the found 'source'
 * bit in 'tmp', and return that <source, dest> pair for migration.
 * The pair of nodemasks 'to' and 'from' define the map.
 *
 * If no pair of bits is found that way, fallback to picking some
 * pair of 'source' and 'dest' bits that are not the same.  If the
 * 'source' and 'dest' bits are the same, this represents a node
 * that will be migrating to itself, so no pages need move.
 *
 * If no bits are left in 'tmp', or if all remaining bits left
 * in 'tmp' correspond to the same bit in 'to', return false
 * (nothing left to migrate).
 *
 * This lets us pick a pair of nodes to migrate between, such that
 * if possible the dest node is not already occupied by some other
 * source node, minimizing the risk of overloading the memory on a
 * node that would happen if we migrated incoming memory to a node
 * before migrating outgoing memory source that same node.
 *
 * A single scan of tmp is sufficient.  As we go, we remember the
 * most recent <s, d> pair that moved (s != d).  If we find a pair
 * that not only moved, but what's better, moved to an empty slot
 * (d is not set in tmp), then we break out then, with that pair.
 * Otherwise when we finish scannng from_tmp, we at least have the
 * most recent <s, d> pair that moved.  If we get all the way through
 * the scan of tmp without finding any node that moved, much less
 * moved to an empty node, then there is nothing left worth migrating.
 */
669

670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696
	tmp = *from_nodes;
	while (!nodes_empty(tmp)) {
		int s,d;
		int source = -1;
		int dest = 0;

		for_each_node_mask(s, tmp) {
			d = node_remap(s, *from_nodes, *to_nodes);
			if (s == d)
				continue;

			source = s;	/* Node moved. Memorize */
			dest = d;

			/* dest not in remaining from nodes? */
			if (!node_isset(dest, tmp))
				break;
		}
		if (source == -1)
			break;

		node_clear(source, tmp);
		err = migrate_to_node(mm, source, dest, flags);
		if (err > 0)
			busy += err;
		if (err < 0)
			break;
697
	}
698
out:
699
	up_read(&mm->mmap_sem);
700 701 702
	if (err < 0)
		return err;
	return busy;
C
Christoph Lameter 已提交
703 704 705

}

706
static struct page *new_vma_page(struct page *page, unsigned long private, int **x)
707 708 709 710 711
{
	struct vm_area_struct *vma = (struct vm_area_struct *)private;

	return alloc_page_vma(GFP_HIGHUSER, vma, page_address_in_vma(page, vma));
}
C
Christoph Lameter 已提交
712 713 714 715 716
#else

static void migrate_page_add(struct page *page, struct list_head *pagelist,
				unsigned long flags)
{
717 718
}

C
Christoph Lameter 已提交
719 720 721 722 723
int do_migrate_pages(struct mm_struct *mm,
	const nodemask_t *from_nodes, const nodemask_t *to_nodes, int flags)
{
	return -ENOSYS;
}
724 725 726 727 728

static struct page *new_vma_page(struct page *page, unsigned long private)
{
	return NULL;
}
C
Christoph Lameter 已提交
729 730
#endif

731 732 733 734 735 736 737 738 739 740 741 742 743 744
long do_mbind(unsigned long start, unsigned long len,
		unsigned long mode, nodemask_t *nmask, unsigned long flags)
{
	struct vm_area_struct *vma;
	struct mm_struct *mm = current->mm;
	struct mempolicy *new;
	unsigned long end;
	int err;
	LIST_HEAD(pagelist);

	if ((flags & ~(unsigned long)(MPOL_MF_STRICT |
				      MPOL_MF_MOVE | MPOL_MF_MOVE_ALL))
	    || mode > MPOL_MAX)
		return -EINVAL;
745
	if ((flags & MPOL_MF_MOVE_ALL) && !capable(CAP_SYS_NICE))
746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787
		return -EPERM;

	if (start & ~PAGE_MASK)
		return -EINVAL;

	if (mode == MPOL_DEFAULT)
		flags &= ~MPOL_MF_STRICT;

	len = (len + PAGE_SIZE - 1) & PAGE_MASK;
	end = start + len;

	if (end < start)
		return -EINVAL;
	if (end == start)
		return 0;

	if (mpol_check_policy(mode, nmask))
		return -EINVAL;

	new = mpol_new(mode, nmask);
	if (IS_ERR(new))
		return PTR_ERR(new);

	/*
	 * If we are using the default policy then operation
	 * on discontinuous address spaces is okay after all
	 */
	if (!new)
		flags |= MPOL_MF_DISCONTIG_OK;

	PDprintk("mbind %lx-%lx mode:%ld nodes:%lx\n",start,start+len,
			mode,nodes_addr(nodes)[0]);

	down_write(&mm->mmap_sem);
	vma = check_range(mm, start, end, nmask,
			  flags | MPOL_MF_INVERT, &pagelist);

	err = PTR_ERR(vma);
	if (!IS_ERR(vma)) {
		int nr_failed = 0;

		err = mbind_range(vma, start, end, new);
788

789
		if (!list_empty(&pagelist))
790 791
			nr_failed = migrate_pages(&pagelist, new_vma_page,
						(unsigned long)vma);
792 793 794 795

		if (!err && nr_failed && (flags & MPOL_MF_STRICT))
			err = -EIO;
	}
C
Christoph Lameter 已提交
796

797 798 799 800 801
	up_write(&mm->mmap_sem);
	mpol_free(new);
	return err;
}

802 803 804 805 806
/*
 * User space interface with variable sized bitmaps for nodelists.
 */

/* Copy a node mask from user space. */
807
static int get_nodes(nodemask_t *nodes, const unsigned long __user *nmask,
808 809 810 811 812 813 814 815 816 817
		     unsigned long maxnode)
{
	unsigned long k;
	unsigned long nlongs;
	unsigned long endmask;

	--maxnode;
	nodes_clear(*nodes);
	if (maxnode == 0 || !nmask)
		return 0;
A
Andi Kleen 已提交
818
	if (maxnode > PAGE_SIZE*BITS_PER_BYTE)
C
Chris Wright 已提交
819
		return -EINVAL;
820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897

	nlongs = BITS_TO_LONGS(maxnode);
	if ((maxnode % BITS_PER_LONG) == 0)
		endmask = ~0UL;
	else
		endmask = (1UL << (maxnode % BITS_PER_LONG)) - 1;

	/* When the user specified more nodes than supported just check
	   if the non supported part is all zero. */
	if (nlongs > BITS_TO_LONGS(MAX_NUMNODES)) {
		if (nlongs > PAGE_SIZE/sizeof(long))
			return -EINVAL;
		for (k = BITS_TO_LONGS(MAX_NUMNODES); k < nlongs; k++) {
			unsigned long t;
			if (get_user(t, nmask + k))
				return -EFAULT;
			if (k == nlongs - 1) {
				if (t & endmask)
					return -EINVAL;
			} else if (t)
				return -EINVAL;
		}
		nlongs = BITS_TO_LONGS(MAX_NUMNODES);
		endmask = ~0UL;
	}

	if (copy_from_user(nodes_addr(*nodes), nmask, nlongs*sizeof(unsigned long)))
		return -EFAULT;
	nodes_addr(*nodes)[nlongs-1] &= endmask;
	return 0;
}

/* Copy a kernel node mask to user space */
static int copy_nodes_to_user(unsigned long __user *mask, unsigned long maxnode,
			      nodemask_t *nodes)
{
	unsigned long copy = ALIGN(maxnode-1, 64) / 8;
	const int nbytes = BITS_TO_LONGS(MAX_NUMNODES) * sizeof(long);

	if (copy > nbytes) {
		if (copy > PAGE_SIZE)
			return -EINVAL;
		if (clear_user((char __user *)mask + nbytes, copy - nbytes))
			return -EFAULT;
		copy = nbytes;
	}
	return copy_to_user(mask, nodes_addr(*nodes), copy) ? -EFAULT : 0;
}

asmlinkage long sys_mbind(unsigned long start, unsigned long len,
			unsigned long mode,
			unsigned long __user *nmask, unsigned long maxnode,
			unsigned flags)
{
	nodemask_t nodes;
	int err;

	err = get_nodes(&nodes, nmask, maxnode);
	if (err)
		return err;
	return do_mbind(start, len, mode, &nodes, flags);
}

/* Set the process memory policy */
asmlinkage long sys_set_mempolicy(int mode, unsigned long __user *nmask,
		unsigned long maxnode)
{
	int err;
	nodemask_t nodes;

	if (mode < 0 || mode > MPOL_MAX)
		return -EINVAL;
	err = get_nodes(&nodes, nmask, maxnode);
	if (err)
		return err;
	return do_set_mempolicy(mode, &nodes);
}

898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926 927 928 929 930 931 932
asmlinkage long sys_migrate_pages(pid_t pid, unsigned long maxnode,
		const unsigned long __user *old_nodes,
		const unsigned long __user *new_nodes)
{
	struct mm_struct *mm;
	struct task_struct *task;
	nodemask_t old;
	nodemask_t new;
	nodemask_t task_nodes;
	int err;

	err = get_nodes(&old, old_nodes, maxnode);
	if (err)
		return err;

	err = get_nodes(&new, new_nodes, maxnode);
	if (err)
		return err;

	/* Find the mm_struct */
	read_lock(&tasklist_lock);
	task = pid ? find_task_by_pid(pid) : current;
	if (!task) {
		read_unlock(&tasklist_lock);
		return -ESRCH;
	}
	mm = get_task_mm(task);
	read_unlock(&tasklist_lock);

	if (!mm)
		return -EINVAL;

	/*
	 * Check if this process has the right to modify the specified
	 * process. The right exists if the process has administrative
A
Alexey Dobriyan 已提交
933
	 * capabilities, superuser privileges or the same
934 935 936 937
	 * userid as the target process.
	 */
	if ((current->euid != task->suid) && (current->euid != task->uid) &&
	    (current->uid != task->suid) && (current->uid != task->uid) &&
938
	    !capable(CAP_SYS_NICE)) {
939 940 941 942 943 944
		err = -EPERM;
		goto out;
	}

	task_nodes = cpuset_mems_allowed(task);
	/* Is the user allowed to access the target nodes? */
945
	if (!nodes_subset(new, task_nodes) && !capable(CAP_SYS_NICE)) {
946 947 948 949
		err = -EPERM;
		goto out;
	}

950 951 952 953
	err = security_task_movememory(task);
	if (err)
		goto out;

954
	err = do_migrate_pages(mm, &old, &new,
955
		capable(CAP_SYS_NICE) ? MPOL_MF_MOVE_ALL : MPOL_MF_MOVE);
956 957 958 959 960 961
out:
	mmput(mm);
	return err;
}


962 963 964 965 966 967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985 986 987
/* Retrieve NUMA policy */
asmlinkage long sys_get_mempolicy(int __user *policy,
				unsigned long __user *nmask,
				unsigned long maxnode,
				unsigned long addr, unsigned long flags)
{
	int err, pval;
	nodemask_t nodes;

	if (nmask != NULL && maxnode < MAX_NUMNODES)
		return -EINVAL;

	err = do_get_mempolicy(&pval, &nodes, addr, flags);

	if (err)
		return err;

	if (policy && put_user(pval, policy))
		return -EFAULT;

	if (nmask)
		err = copy_nodes_to_user(nmask, maxnode, &nodes);

	return err;
}

L
Linus Torvalds 已提交
988 989 990 991 992 993 994 995 996 997 998 999 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047
#ifdef CONFIG_COMPAT

asmlinkage long compat_sys_get_mempolicy(int __user *policy,
				     compat_ulong_t __user *nmask,
				     compat_ulong_t maxnode,
				     compat_ulong_t addr, compat_ulong_t flags)
{
	long err;
	unsigned long __user *nm = NULL;
	unsigned long nr_bits, alloc_size;
	DECLARE_BITMAP(bm, MAX_NUMNODES);

	nr_bits = min_t(unsigned long, maxnode-1, MAX_NUMNODES);
	alloc_size = ALIGN(nr_bits, BITS_PER_LONG) / 8;

	if (nmask)
		nm = compat_alloc_user_space(alloc_size);

	err = sys_get_mempolicy(policy, nm, nr_bits+1, addr, flags);

	if (!err && nmask) {
		err = copy_from_user(bm, nm, alloc_size);
		/* ensure entire bitmap is zeroed */
		err |= clear_user(nmask, ALIGN(maxnode-1, 8) / 8);
		err |= compat_put_bitmap(nmask, bm, nr_bits);
	}

	return err;
}

asmlinkage long compat_sys_set_mempolicy(int mode, compat_ulong_t __user *nmask,
				     compat_ulong_t maxnode)
{
	long err = 0;
	unsigned long __user *nm = NULL;
	unsigned long nr_bits, alloc_size;
	DECLARE_BITMAP(bm, MAX_NUMNODES);

	nr_bits = min_t(unsigned long, maxnode-1, MAX_NUMNODES);
	alloc_size = ALIGN(nr_bits, BITS_PER_LONG) / 8;

	if (nmask) {
		err = compat_get_bitmap(bm, nmask, nr_bits);
		nm = compat_alloc_user_space(alloc_size);
		err |= copy_to_user(nm, bm, alloc_size);
	}

	if (err)
		return -EFAULT;

	return sys_set_mempolicy(mode, nm, nr_bits+1);
}

asmlinkage long compat_sys_mbind(compat_ulong_t start, compat_ulong_t len,
			     compat_ulong_t mode, compat_ulong_t __user *nmask,
			     compat_ulong_t maxnode, compat_ulong_t flags)
{
	long err = 0;
	unsigned long __user *nm = NULL;
	unsigned long nr_bits, alloc_size;
1048
	nodemask_t bm;
L
Linus Torvalds 已提交
1049 1050 1051 1052 1053

	nr_bits = min_t(unsigned long, maxnode-1, MAX_NUMNODES);
	alloc_size = ALIGN(nr_bits, BITS_PER_LONG) / 8;

	if (nmask) {
1054
		err = compat_get_bitmap(nodes_addr(bm), nmask, nr_bits);
L
Linus Torvalds 已提交
1055
		nm = compat_alloc_user_space(alloc_size);
1056
		err |= copy_to_user(nm, nodes_addr(bm), alloc_size);
L
Linus Torvalds 已提交
1057 1058 1059 1060 1061 1062 1063 1064 1065 1066 1067
	}

	if (err)
		return -EFAULT;

	return sys_mbind(start, len, mode, nm, nr_bits+1, flags);
}

#endif

/* Return effective policy for a VMA */
1068 1069
static struct mempolicy * get_vma_policy(struct task_struct *task,
		struct vm_area_struct *vma, unsigned long addr)
L
Linus Torvalds 已提交
1070
{
1071
	struct mempolicy *pol = task->mempolicy;
L
Linus Torvalds 已提交
1072 1073 1074

	if (vma) {
		if (vma->vm_ops && vma->vm_ops->get_policy)
1075
			pol = vma->vm_ops->get_policy(vma, addr);
L
Linus Torvalds 已提交
1076 1077 1078 1079 1080 1081 1082 1083 1084 1085
		else if (vma->vm_policy &&
				vma->vm_policy->policy != MPOL_DEFAULT)
			pol = vma->vm_policy;
	}
	if (!pol)
		pol = &default_policy;
	return pol;
}

/* Return a zonelist representing a mempolicy */
A
Al Viro 已提交
1086
static struct zonelist *zonelist_policy(gfp_t gfp, struct mempolicy *policy)
L
Linus Torvalds 已提交
1087 1088 1089 1090 1091 1092 1093 1094 1095 1096 1097 1098
{
	int nd;

	switch (policy->policy) {
	case MPOL_PREFERRED:
		nd = policy->v.preferred_node;
		if (nd < 0)
			nd = numa_node_id();
		break;
	case MPOL_BIND:
		/* Lower zones don't get a policy applied */
		/* Careful: current->mems_allowed might have moved */
A
Al Viro 已提交
1099
		if (gfp_zone(gfp) >= policy_zone)
L
Linus Torvalds 已提交
1100 1101 1102 1103 1104 1105 1106 1107 1108 1109 1110
			if (cpuset_zonelist_valid_mems_allowed(policy->v.zonelist))
				return policy->v.zonelist;
		/*FALL THROUGH*/
	case MPOL_INTERLEAVE: /* should not happen */
	case MPOL_DEFAULT:
		nd = numa_node_id();
		break;
	default:
		nd = 0;
		BUG();
	}
A
Al Viro 已提交
1111
	return NODE_DATA(nd)->node_zonelists + gfp_zone(gfp);
L
Linus Torvalds 已提交
1112 1113 1114 1115 1116 1117 1118 1119 1120
}

/* Do dynamic interleaving for a process */
static unsigned interleave_nodes(struct mempolicy *policy)
{
	unsigned nid, next;
	struct task_struct *me = current;

	nid = me->il_next;
1121
	next = next_node(nid, policy->v.nodes);
L
Linus Torvalds 已提交
1122
	if (next >= MAX_NUMNODES)
1123
		next = first_node(policy->v.nodes);
L
Linus Torvalds 已提交
1124 1125 1126 1127
	me->il_next = next;
	return nid;
}

1128 1129 1130 1131 1132 1133 1134 1135 1136 1137 1138 1139 1140 1141 1142 1143 1144 1145 1146 1147 1148 1149 1150 1151 1152 1153 1154
/*
 * Depending on the memory policy provide a node from which to allocate the
 * next slab entry.
 */
unsigned slab_node(struct mempolicy *policy)
{
	switch (policy->policy) {
	case MPOL_INTERLEAVE:
		return interleave_nodes(policy);

	case MPOL_BIND:
		/*
		 * Follow bind policy behavior and start allocation at the
		 * first node.
		 */
		return policy->v.zonelist->zones[0]->zone_pgdat->node_id;

	case MPOL_PREFERRED:
		if (policy->v.preferred_node >= 0)
			return policy->v.preferred_node;
		/* Fall through */

	default:
		return numa_node_id();
	}
}

L
Linus Torvalds 已提交
1155 1156 1157 1158
/* Do static interleaving for a VMA with known offset. */
static unsigned offset_il_node(struct mempolicy *pol,
		struct vm_area_struct *vma, unsigned long off)
{
1159
	unsigned nnodes = nodes_weight(pol->v.nodes);
L
Linus Torvalds 已提交
1160 1161 1162 1163 1164 1165
	unsigned target = (unsigned)off % nnodes;
	int c;
	int nid = -1;

	c = 0;
	do {
1166
		nid = next_node(nid, pol->v.nodes);
L
Linus Torvalds 已提交
1167 1168 1169 1170 1171
		c++;
	} while (c <= target);
	return nid;
}

1172 1173 1174 1175 1176 1177 1178 1179 1180 1181 1182 1183 1184 1185
/* Determine a node number for interleave */
static inline unsigned interleave_nid(struct mempolicy *pol,
		 struct vm_area_struct *vma, unsigned long addr, int shift)
{
	if (vma) {
		unsigned long off;

		off = vma->vm_pgoff;
		off += (addr - vma->vm_start) >> shift;
		return offset_il_node(pol, vma, off);
	} else
		return interleave_nodes(pol);
}

1186
#ifdef CONFIG_HUGETLBFS
1187 1188 1189 1190 1191 1192 1193 1194 1195 1196 1197 1198 1199
/* Return a zonelist suitable for a huge page allocation. */
struct zonelist *huge_zonelist(struct vm_area_struct *vma, unsigned long addr)
{
	struct mempolicy *pol = get_vma_policy(current, vma, addr);

	if (pol->policy == MPOL_INTERLEAVE) {
		unsigned nid;

		nid = interleave_nid(pol, vma, addr, HPAGE_SHIFT);
		return NODE_DATA(nid)->node_zonelists + gfp_zone(GFP_HIGHUSER);
	}
	return zonelist_policy(GFP_HIGHUSER, pol);
}
1200
#endif
1201

L
Linus Torvalds 已提交
1202 1203
/* Allocate a page in interleaved policy.
   Own path because it needs to do special accounting. */
1204 1205
static struct page *alloc_page_interleave(gfp_t gfp, unsigned order,
					unsigned nid)
L
Linus Torvalds 已提交
1206 1207 1208 1209
{
	struct zonelist *zl;
	struct page *page;

A
Al Viro 已提交
1210
	zl = NODE_DATA(nid)->node_zonelists + gfp_zone(gfp);
L
Linus Torvalds 已提交
1211
	page = __alloc_pages(gfp, order, zl);
1212 1213
	if (page && page_zone(page) == zl->zones[0])
		inc_zone_page_state(page, NUMA_INTERLEAVE_HIT);
L
Linus Torvalds 已提交
1214 1215 1216 1217 1218 1219 1220 1221 1222 1223 1224 1225 1226 1227 1228 1229 1230 1231 1232 1233 1234 1235 1236 1237 1238 1239
	return page;
}

/**
 * 	alloc_page_vma	- Allocate a page for a VMA.
 *
 * 	@gfp:
 *      %GFP_USER    user allocation.
 *      %GFP_KERNEL  kernel allocations,
 *      %GFP_HIGHMEM highmem/user allocations,
 *      %GFP_FS      allocation should not call back into a file system.
 *      %GFP_ATOMIC  don't sleep.
 *
 * 	@vma:  Pointer to VMA or NULL if not available.
 *	@addr: Virtual Address of the allocation. Must be inside the VMA.
 *
 * 	This function allocates a page from the kernel page pool and applies
 *	a NUMA policy associated with the VMA or the current process.
 *	When VMA is not NULL caller must hold down_read on the mmap_sem of the
 *	mm_struct of the VMA to prevent it from going away. Should be used for
 *	all allocations for pages that will be mapped into
 * 	user space. Returns NULL when no page can be allocated.
 *
 *	Should be called with the mm_sem of the vma hold.
 */
struct page *
A
Al Viro 已提交
1240
alloc_page_vma(gfp_t gfp, struct vm_area_struct *vma, unsigned long addr)
L
Linus Torvalds 已提交
1241
{
1242
	struct mempolicy *pol = get_vma_policy(current, vma, addr);
L
Linus Torvalds 已提交
1243

1244
	cpuset_update_task_memory_state();
L
Linus Torvalds 已提交
1245 1246 1247

	if (unlikely(pol->policy == MPOL_INTERLEAVE)) {
		unsigned nid;
1248 1249

		nid = interleave_nid(pol, vma, addr, PAGE_SHIFT);
L
Linus Torvalds 已提交
1250 1251 1252 1253 1254 1255 1256 1257 1258 1259 1260 1261 1262 1263 1264 1265 1266 1267 1268 1269
		return alloc_page_interleave(gfp, 0, nid);
	}
	return __alloc_pages(gfp, 0, zonelist_policy(gfp, pol));
}

/**
 * 	alloc_pages_current - Allocate pages.
 *
 *	@gfp:
 *		%GFP_USER   user allocation,
 *      	%GFP_KERNEL kernel allocation,
 *      	%GFP_HIGHMEM highmem allocation,
 *      	%GFP_FS     don't call back into a file system.
 *      	%GFP_ATOMIC don't sleep.
 *	@order: Power of two of allocation size in pages. 0 is a single page.
 *
 *	Allocate a page from the kernel page pool.  When not in
 *	interrupt context and apply the current process NUMA policy.
 *	Returns NULL when no page can be allocated.
 *
1270
 *	Don't call cpuset_update_task_memory_state() unless
L
Linus Torvalds 已提交
1271 1272 1273
 *	1) it's ok to take cpuset_sem (can WAIT), and
 *	2) allocating for current task (not interrupt).
 */
A
Al Viro 已提交
1274
struct page *alloc_pages_current(gfp_t gfp, unsigned order)
L
Linus Torvalds 已提交
1275 1276 1277 1278
{
	struct mempolicy *pol = current->mempolicy;

	if ((gfp & __GFP_WAIT) && !in_interrupt())
1279
		cpuset_update_task_memory_state();
L
Linus Torvalds 已提交
1280 1281 1282 1283 1284 1285 1286 1287
	if (!pol || in_interrupt())
		pol = &default_policy;
	if (pol->policy == MPOL_INTERLEAVE)
		return alloc_page_interleave(gfp, order, interleave_nodes(pol));
	return __alloc_pages(gfp, order, zonelist_policy(gfp, pol));
}
EXPORT_SYMBOL(alloc_pages_current);

1288 1289 1290 1291 1292 1293 1294 1295 1296
/*
 * If mpol_copy() sees current->cpuset == cpuset_being_rebound, then it
 * rebinds the mempolicy its copying by calling mpol_rebind_policy()
 * with the mems_allowed returned by cpuset_mems_allowed().  This
 * keeps mempolicies cpuset relative after its cpuset moves.  See
 * further kernel/cpuset.c update_nodemask().
 */
void *cpuset_being_rebound;

L
Linus Torvalds 已提交
1297 1298 1299 1300 1301 1302 1303
/* Slow path of a mempolicy copy */
struct mempolicy *__mpol_copy(struct mempolicy *old)
{
	struct mempolicy *new = kmem_cache_alloc(policy_cache, GFP_KERNEL);

	if (!new)
		return ERR_PTR(-ENOMEM);
1304 1305 1306 1307
	if (current_cpuset_is_being_rebound()) {
		nodemask_t mems = cpuset_mems_allowed(current);
		mpol_rebind_policy(old, &mems);
	}
L
Linus Torvalds 已提交
1308 1309 1310 1311 1312 1313 1314 1315 1316 1317 1318 1319 1320 1321 1322 1323 1324 1325 1326 1327 1328 1329 1330 1331 1332
	*new = *old;
	atomic_set(&new->refcnt, 1);
	if (new->policy == MPOL_BIND) {
		int sz = ksize(old->v.zonelist);
		new->v.zonelist = kmalloc(sz, SLAB_KERNEL);
		if (!new->v.zonelist) {
			kmem_cache_free(policy_cache, new);
			return ERR_PTR(-ENOMEM);
		}
		memcpy(new->v.zonelist, old->v.zonelist, sz);
	}
	return new;
}

/* Slow path of a mempolicy comparison */
int __mpol_equal(struct mempolicy *a, struct mempolicy *b)
{
	if (!a || !b)
		return 0;
	if (a->policy != b->policy)
		return 0;
	switch (a->policy) {
	case MPOL_DEFAULT:
		return 1;
	case MPOL_INTERLEAVE:
1333
		return nodes_equal(a->v.nodes, b->v.nodes);
L
Linus Torvalds 已提交
1334 1335 1336 1337 1338 1339 1340 1341 1342 1343 1344 1345 1346 1347 1348 1349 1350 1351 1352 1353 1354 1355 1356 1357 1358 1359 1360 1361 1362 1363 1364 1365 1366 1367 1368 1369 1370 1371 1372 1373 1374 1375 1376 1377 1378 1379 1380 1381 1382 1383 1384 1385 1386 1387 1388 1389 1390 1391 1392 1393 1394 1395 1396 1397 1398 1399 1400 1401 1402 1403 1404 1405 1406 1407 1408 1409 1410 1411 1412 1413 1414 1415 1416 1417 1418 1419 1420 1421 1422 1423 1424 1425 1426 1427 1428 1429 1430 1431 1432 1433 1434 1435 1436 1437 1438 1439 1440 1441 1442 1443 1444 1445 1446 1447 1448 1449 1450 1451 1452 1453 1454 1455 1456 1457 1458 1459 1460 1461 1462 1463 1464 1465 1466 1467 1468 1469 1470 1471 1472 1473 1474 1475 1476 1477 1478 1479 1480 1481 1482 1483 1484 1485 1486 1487 1488 1489 1490 1491 1492 1493 1494 1495 1496 1497 1498 1499 1500 1501 1502 1503 1504 1505 1506 1507 1508 1509 1510 1511 1512 1513
	case MPOL_PREFERRED:
		return a->v.preferred_node == b->v.preferred_node;
	case MPOL_BIND: {
		int i;
		for (i = 0; a->v.zonelist->zones[i]; i++)
			if (a->v.zonelist->zones[i] != b->v.zonelist->zones[i])
				return 0;
		return b->v.zonelist->zones[i] == NULL;
	}
	default:
		BUG();
		return 0;
	}
}

/* Slow path of a mpol destructor. */
void __mpol_free(struct mempolicy *p)
{
	if (!atomic_dec_and_test(&p->refcnt))
		return;
	if (p->policy == MPOL_BIND)
		kfree(p->v.zonelist);
	p->policy = MPOL_DEFAULT;
	kmem_cache_free(policy_cache, p);
}

/*
 * Shared memory backing store policy support.
 *
 * Remember policies even when nobody has shared memory mapped.
 * The policies are kept in Red-Black tree linked from the inode.
 * They are protected by the sp->lock spinlock, which should be held
 * for any accesses to the tree.
 */

/* lookup first element intersecting start-end */
/* Caller holds sp->lock */
static struct sp_node *
sp_lookup(struct shared_policy *sp, unsigned long start, unsigned long end)
{
	struct rb_node *n = sp->root.rb_node;

	while (n) {
		struct sp_node *p = rb_entry(n, struct sp_node, nd);

		if (start >= p->end)
			n = n->rb_right;
		else if (end <= p->start)
			n = n->rb_left;
		else
			break;
	}
	if (!n)
		return NULL;
	for (;;) {
		struct sp_node *w = NULL;
		struct rb_node *prev = rb_prev(n);
		if (!prev)
			break;
		w = rb_entry(prev, struct sp_node, nd);
		if (w->end <= start)
			break;
		n = prev;
	}
	return rb_entry(n, struct sp_node, nd);
}

/* Insert a new shared policy into the list. */
/* Caller holds sp->lock */
static void sp_insert(struct shared_policy *sp, struct sp_node *new)
{
	struct rb_node **p = &sp->root.rb_node;
	struct rb_node *parent = NULL;
	struct sp_node *nd;

	while (*p) {
		parent = *p;
		nd = rb_entry(parent, struct sp_node, nd);
		if (new->start < nd->start)
			p = &(*p)->rb_left;
		else if (new->end > nd->end)
			p = &(*p)->rb_right;
		else
			BUG();
	}
	rb_link_node(&new->nd, parent, p);
	rb_insert_color(&new->nd, &sp->root);
	PDprintk("inserting %lx-%lx: %d\n", new->start, new->end,
		 new->policy ? new->policy->policy : 0);
}

/* Find shared policy intersecting idx */
struct mempolicy *
mpol_shared_policy_lookup(struct shared_policy *sp, unsigned long idx)
{
	struct mempolicy *pol = NULL;
	struct sp_node *sn;

	if (!sp->root.rb_node)
		return NULL;
	spin_lock(&sp->lock);
	sn = sp_lookup(sp, idx, idx+1);
	if (sn) {
		mpol_get(sn->policy);
		pol = sn->policy;
	}
	spin_unlock(&sp->lock);
	return pol;
}

static void sp_delete(struct shared_policy *sp, struct sp_node *n)
{
	PDprintk("deleting %lx-l%x\n", n->start, n->end);
	rb_erase(&n->nd, &sp->root);
	mpol_free(n->policy);
	kmem_cache_free(sn_cache, n);
}

struct sp_node *
sp_alloc(unsigned long start, unsigned long end, struct mempolicy *pol)
{
	struct sp_node *n = kmem_cache_alloc(sn_cache, GFP_KERNEL);

	if (!n)
		return NULL;
	n->start = start;
	n->end = end;
	mpol_get(pol);
	n->policy = pol;
	return n;
}

/* Replace a policy range. */
static int shared_policy_replace(struct shared_policy *sp, unsigned long start,
				 unsigned long end, struct sp_node *new)
{
	struct sp_node *n, *new2 = NULL;

restart:
	spin_lock(&sp->lock);
	n = sp_lookup(sp, start, end);
	/* Take care of old policies in the same range. */
	while (n && n->start < end) {
		struct rb_node *next = rb_next(&n->nd);
		if (n->start >= start) {
			if (n->end <= end)
				sp_delete(sp, n);
			else
				n->start = end;
		} else {
			/* Old policy spanning whole new range. */
			if (n->end > end) {
				if (!new2) {
					spin_unlock(&sp->lock);
					new2 = sp_alloc(end, n->end, n->policy);
					if (!new2)
						return -ENOMEM;
					goto restart;
				}
				n->end = start;
				sp_insert(sp, new2);
				new2 = NULL;
				break;
			} else
				n->end = start;
		}
		if (!next)
			break;
		n = rb_entry(next, struct sp_node, nd);
	}
	if (new)
		sp_insert(sp, new);
	spin_unlock(&sp->lock);
	if (new2) {
		mpol_free(new2->policy);
		kmem_cache_free(sn_cache, new2);
	}
	return 0;
}

1514 1515 1516 1517 1518 1519 1520 1521 1522 1523 1524 1525 1526 1527 1528 1529 1530 1531 1532 1533 1534 1535 1536 1537
void mpol_shared_policy_init(struct shared_policy *info, int policy,
				nodemask_t *policy_nodes)
{
	info->root = RB_ROOT;
	spin_lock_init(&info->lock);

	if (policy != MPOL_DEFAULT) {
		struct mempolicy *newpol;

		/* Falls back to MPOL_DEFAULT on any error */
		newpol = mpol_new(policy, policy_nodes);
		if (!IS_ERR(newpol)) {
			/* Create pseudo-vma that contains just the policy */
			struct vm_area_struct pvma;

			memset(&pvma, 0, sizeof(struct vm_area_struct));
			/* Policy covers entire file */
			pvma.vm_end = TASK_SIZE;
			mpol_set_shared_policy(info, &pvma, newpol);
			mpol_free(newpol);
		}
	}
}

L
Linus Torvalds 已提交
1538 1539 1540 1541 1542 1543 1544 1545 1546 1547
int mpol_set_shared_policy(struct shared_policy *info,
			struct vm_area_struct *vma, struct mempolicy *npol)
{
	int err;
	struct sp_node *new = NULL;
	unsigned long sz = vma_pages(vma);

	PDprintk("set_shared_policy %lx sz %lu %d %lx\n",
		 vma->vm_pgoff,
		 sz, npol? npol->policy : -1,
1548
		npol ? nodes_addr(npol->v.nodes)[0] : -1);
L
Linus Torvalds 已提交
1549 1550 1551 1552 1553 1554 1555 1556 1557 1558 1559 1560 1561 1562 1563 1564 1565 1566 1567 1568 1569 1570 1571 1572 1573

	if (npol) {
		new = sp_alloc(vma->vm_pgoff, vma->vm_pgoff + sz, npol);
		if (!new)
			return -ENOMEM;
	}
	err = shared_policy_replace(info, vma->vm_pgoff, vma->vm_pgoff+sz, new);
	if (err && new)
		kmem_cache_free(sn_cache, new);
	return err;
}

/* Free a backing policy store on inode delete. */
void mpol_free_shared_policy(struct shared_policy *p)
{
	struct sp_node *n;
	struct rb_node *next;

	if (!p->root.rb_node)
		return;
	spin_lock(&p->lock);
	next = rb_first(&p->root);
	while (next) {
		n = rb_entry(next, struct sp_node, nd);
		next = rb_next(&n->nd);
1574
		rb_erase(&n->nd, &p->root);
L
Linus Torvalds 已提交
1575 1576 1577 1578 1579 1580 1581 1582 1583 1584 1585 1586 1587 1588 1589 1590 1591 1592 1593 1594
		mpol_free(n->policy);
		kmem_cache_free(sn_cache, n);
	}
	spin_unlock(&p->lock);
}

/* assumes fs == KERNEL_DS */
void __init numa_policy_init(void)
{
	policy_cache = kmem_cache_create("numa_policy",
					 sizeof(struct mempolicy),
					 0, SLAB_PANIC, NULL, NULL);

	sn_cache = kmem_cache_create("shared_policy_node",
				     sizeof(struct sp_node),
				     0, SLAB_PANIC, NULL, NULL);

	/* Set interleaving policy for system init. This way not all
	   the data structures allocated at system boot end up in node zero. */

1595
	if (do_set_mempolicy(MPOL_INTERLEAVE, &node_online_map))
L
Linus Torvalds 已提交
1596 1597 1598
		printk("numa_policy_init: interleaving failed\n");
}

1599
/* Reset policy of current process to default */
L
Linus Torvalds 已提交
1600 1601
void numa_default_policy(void)
{
1602
	do_set_mempolicy(MPOL_DEFAULT, NULL);
L
Linus Torvalds 已提交
1603
}
1604 1605

/* Migrate a policy to a different set of nodes */
1606
void mpol_rebind_policy(struct mempolicy *pol, const nodemask_t *newmask)
1607
{
1608
	nodemask_t *mpolmask;
1609 1610 1611 1612
	nodemask_t tmp;

	if (!pol)
		return;
1613 1614 1615
	mpolmask = &pol->cpuset_mems_allowed;
	if (nodes_equal(*mpolmask, *newmask))
		return;
1616 1617 1618 1619 1620

	switch (pol->policy) {
	case MPOL_DEFAULT:
		break;
	case MPOL_INTERLEAVE:
1621
		nodes_remap(tmp, pol->v.nodes, *mpolmask, *newmask);
1622
		pol->v.nodes = tmp;
1623 1624 1625
		*mpolmask = *newmask;
		current->il_next = node_remap(current->il_next,
						*mpolmask, *newmask);
1626 1627 1628
		break;
	case MPOL_PREFERRED:
		pol->v.preferred_node = node_remap(pol->v.preferred_node,
1629 1630
						*mpolmask, *newmask);
		*mpolmask = *newmask;
1631 1632 1633 1634 1635 1636 1637 1638 1639
		break;
	case MPOL_BIND: {
		nodemask_t nodes;
		struct zone **z;
		struct zonelist *zonelist;

		nodes_clear(nodes);
		for (z = pol->v.zonelist->zones; *z; z++)
			node_set((*z)->zone_pgdat->node_id, nodes);
1640
		nodes_remap(tmp, nodes, *mpolmask, *newmask);
1641 1642 1643 1644 1645 1646 1647 1648 1649 1650 1651 1652 1653 1654
		nodes = tmp;

		zonelist = bind_zonelist(&nodes);

		/* If no mem, then zonelist is NULL and we keep old zonelist.
		 * If that old zonelist has no remaining mems_allowed nodes,
		 * then zonelist_policy() will "FALL THROUGH" to MPOL_DEFAULT.
		 */

		if (zonelist) {
			/* Good - got mem - substitute new zonelist */
			kfree(pol->v.zonelist);
			pol->v.zonelist = zonelist;
		}
1655
		*mpolmask = *newmask;
1656 1657 1658 1659 1660 1661 1662 1663 1664
		break;
	}
	default:
		BUG();
		break;
	}
}

/*
1665 1666
 * Wrapper for mpol_rebind_policy() that just requires task
 * pointer, and updates task mempolicy.
1667
 */
1668 1669

void mpol_rebind_task(struct task_struct *tsk, const nodemask_t *new)
1670
{
1671
	mpol_rebind_policy(tsk->mempolicy, new);
1672
}
1673

1674 1675 1676 1677 1678 1679 1680 1681 1682 1683 1684 1685 1686 1687 1688 1689
/*
 * Rebind each vma in mm to new nodemask.
 *
 * Call holding a reference to mm.  Takes mm->mmap_sem during call.
 */

void mpol_rebind_mm(struct mm_struct *mm, nodemask_t *new)
{
	struct vm_area_struct *vma;

	down_write(&mm->mmap_sem);
	for (vma = mm->mmap; vma; vma = vma->vm_next)
		mpol_rebind_policy(vma->vm_policy, new);
	up_write(&mm->mmap_sem);
}

1690 1691 1692 1693 1694 1695 1696 1697 1698 1699 1700 1701 1702 1703 1704 1705 1706 1707 1708 1709 1710 1711 1712 1713 1714 1715 1716 1717 1718 1719 1720 1721 1722 1723 1724 1725 1726 1727 1728 1729 1730 1731 1732 1733 1734 1735 1736 1737 1738 1739 1740 1741 1742 1743 1744 1745 1746 1747 1748 1749 1750
/*
 * Display pages allocated per node and memory policy via /proc.
 */

static const char *policy_types[] = { "default", "prefer", "bind",
				      "interleave" };

/*
 * Convert a mempolicy into a string.
 * Returns the number of characters in buffer (if positive)
 * or an error (negative)
 */
static inline int mpol_to_str(char *buffer, int maxlen, struct mempolicy *pol)
{
	char *p = buffer;
	int l;
	nodemask_t nodes;
	int mode = pol ? pol->policy : MPOL_DEFAULT;

	switch (mode) {
	case MPOL_DEFAULT:
		nodes_clear(nodes);
		break;

	case MPOL_PREFERRED:
		nodes_clear(nodes);
		node_set(pol->v.preferred_node, nodes);
		break;

	case MPOL_BIND:
		get_zonemask(pol, &nodes);
		break;

	case MPOL_INTERLEAVE:
		nodes = pol->v.nodes;
		break;

	default:
		BUG();
		return -EFAULT;
	}

	l = strlen(policy_types[mode]);
 	if (buffer + maxlen < p + l + 1)
 		return -ENOSPC;

	strcpy(p, policy_types[mode]);
	p += l;

	if (!nodes_empty(nodes)) {
		if (buffer + maxlen < p + 2)
			return -ENOSPC;
		*p++ = '=';
	 	p += nodelist_scnprintf(p, buffer + maxlen - p, nodes);
	}
	return p - buffer;
}

struct numa_maps {
	unsigned long pages;
	unsigned long anon;
C
Christoph Lameter 已提交
1751 1752
	unsigned long active;
	unsigned long writeback;
1753
	unsigned long mapcount_max;
C
Christoph Lameter 已提交
1754 1755
	unsigned long dirty;
	unsigned long swapcache;
1756 1757 1758
	unsigned long node[MAX_NUMNODES];
};

C
Christoph Lameter 已提交
1759
static void gather_stats(struct page *page, void *private, int pte_dirty)
1760 1761 1762 1763
{
	struct numa_maps *md = private;
	int count = page_mapcount(page);

C
Christoph Lameter 已提交
1764 1765 1766
	md->pages++;
	if (pte_dirty || PageDirty(page))
		md->dirty++;
1767

C
Christoph Lameter 已提交
1768 1769
	if (PageSwapCache(page))
		md->swapcache++;
1770

C
Christoph Lameter 已提交
1771 1772 1773 1774 1775
	if (PageActive(page))
		md->active++;

	if (PageWriteback(page))
		md->writeback++;
1776 1777 1778 1779

	if (PageAnon(page))
		md->anon++;

C
Christoph Lameter 已提交
1780 1781 1782
	if (count > md->mapcount_max)
		md->mapcount_max = count;

1783 1784 1785
	md->node[page_to_nid(page)]++;
}

A
Andrew Morton 已提交
1786
#ifdef CONFIG_HUGETLB_PAGE
C
Christoph Lameter 已提交
1787 1788 1789 1790 1791 1792 1793 1794 1795 1796 1797 1798 1799 1800 1801 1802 1803 1804 1805 1806 1807 1808 1809 1810 1811
static void check_huge_range(struct vm_area_struct *vma,
		unsigned long start, unsigned long end,
		struct numa_maps *md)
{
	unsigned long addr;
	struct page *page;

	for (addr = start; addr < end; addr += HPAGE_SIZE) {
		pte_t *ptep = huge_pte_offset(vma->vm_mm, addr & HPAGE_MASK);
		pte_t pte;

		if (!ptep)
			continue;

		pte = *ptep;
		if (pte_none(pte))
			continue;

		page = pte_page(pte);
		if (!page)
			continue;

		gather_stats(page, md, pte_dirty(*ptep));
	}
}
A
Andrew Morton 已提交
1812 1813 1814 1815 1816 1817 1818
#else
static inline void check_huge_range(struct vm_area_struct *vma,
		unsigned long start, unsigned long end,
		struct numa_maps *md)
{
}
#endif
C
Christoph Lameter 已提交
1819

1820 1821
int show_numa_map(struct seq_file *m, void *v)
{
1822
	struct proc_maps_private *priv = m->private;
1823 1824
	struct vm_area_struct *vma = v;
	struct numa_maps *md;
C
Christoph Lameter 已提交
1825 1826
	struct file *file = vma->vm_file;
	struct mm_struct *mm = vma->vm_mm;
1827 1828 1829
	int n;
	char buffer[50];

C
Christoph Lameter 已提交
1830
	if (!mm)
1831 1832 1833 1834 1835 1836
		return 0;

	md = kzalloc(sizeof(struct numa_maps), GFP_KERNEL);
	if (!md)
		return 0;

C
Christoph Lameter 已提交
1837
	mpol_to_str(buffer, sizeof(buffer),
1838
			    get_vma_policy(priv->task, vma, vma->vm_start));
C
Christoph Lameter 已提交
1839 1840 1841 1842 1843 1844 1845 1846 1847 1848 1849 1850 1851 1852 1853 1854 1855

	seq_printf(m, "%08lx %s", vma->vm_start, buffer);

	if (file) {
		seq_printf(m, " file=");
		seq_path(m, file->f_vfsmnt, file->f_dentry, "\n\t= ");
	} else if (vma->vm_start <= mm->brk && vma->vm_end >= mm->start_brk) {
		seq_printf(m, " heap");
	} else if (vma->vm_start <= mm->start_stack &&
			vma->vm_end >= mm->start_stack) {
		seq_printf(m, " stack");
	}

	if (is_vm_hugetlb_page(vma)) {
		check_huge_range(vma, vma->vm_start, vma->vm_end, md);
		seq_printf(m, " huge");
	} else {
1856
		check_pgd_range(vma, vma->vm_start, vma->vm_end,
C
Christoph Lameter 已提交
1857 1858 1859 1860 1861
				&node_online_map, MPOL_MF_STATS, md);
	}

	if (!md->pages)
		goto out;
1862

C
Christoph Lameter 已提交
1863 1864
	if (md->anon)
		seq_printf(m," anon=%lu",md->anon);
1865

C
Christoph Lameter 已提交
1866 1867
	if (md->dirty)
		seq_printf(m," dirty=%lu",md->dirty);
1868

C
Christoph Lameter 已提交
1869 1870
	if (md->pages != md->anon && md->pages != md->dirty)
		seq_printf(m, " mapped=%lu", md->pages);
1871

C
Christoph Lameter 已提交
1872 1873
	if (md->mapcount_max > 1)
		seq_printf(m, " mapmax=%lu", md->mapcount_max);
1874

C
Christoph Lameter 已提交
1875 1876 1877 1878 1879 1880 1881 1882 1883 1884 1885 1886 1887 1888
	if (md->swapcache)
		seq_printf(m," swapcache=%lu", md->swapcache);

	if (md->active < md->pages && !is_vm_hugetlb_page(vma))
		seq_printf(m," active=%lu", md->active);

	if (md->writeback)
		seq_printf(m," writeback=%lu", md->writeback);

	for_each_online_node(n)
		if (md->node[n])
			seq_printf(m, " N%d=%lu", n, md->node[n]);
out:
	seq_putc(m, '\n');
1889 1890 1891
	kfree(md);

	if (m->count < m->size)
1892
		m->version = (vma != priv->tail_vma) ? vma->vm_start : 0;
1893 1894 1895
	return 0;
}