4 * Processor and Memory placement constraints for sets of tasks.
6 * Copyright (C) 2003 BULL SA.
7 * Copyright (C) 2004-2007 Silicon Graphics, Inc.
8 * Copyright (C) 2006 Google, Inc
10 * Portions derived from Patrick Mochel's sysfs code.
11 * sysfs is Copyright (c) 2001-3 Patrick Mochel
13 * 2003-10-10 Written by Simon Derr.
14 * 2003-10-22 Updates by Stephen Hemminger.
15 * 2004 May-July Rework by Paul Jackson.
16 * 2006 Rework by Paul Menage to use generic cgroups
18 * This file is subject to the terms and conditions of the GNU General Public
19 * License. See the file COPYING in the main directory of the Linux
20 * distribution for more details.
23 #include <linux/cpu.h>
24 #include <linux/cpumask.h>
25 #include <linux/cpuset.h>
26 #include <linux/err.h>
27 #include <linux/errno.h>
28 #include <linux/file.h>
30 #include <linux/init.h>
31 #include <linux/interrupt.h>
32 #include <linux/kernel.h>
33 #include <linux/kmod.h>
34 #include <linux/list.h>
35 #include <linux/mempolicy.h>
37 #include <linux/module.h>
38 #include <linux/mount.h>
39 #include <linux/namei.h>
40 #include <linux/pagemap.h>
41 #include <linux/proc_fs.h>
42 #include <linux/rcupdate.h>
43 #include <linux/sched.h>
44 #include <linux/seq_file.h>
45 #include <linux/security.h>
46 #include <linux/slab.h>
47 #include <linux/spinlock.h>
48 #include <linux/stat.h>
49 #include <linux/string.h>
50 #include <linux/time.h>
51 #include <linux/backing-dev.h>
52 #include <linux/sort.h>
54 #include <asm/uaccess.h>
55 #include <asm/atomic.h>
56 #include <linux/mutex.h>
57 #include <linux/kfifo.h>
58 #include <linux/workqueue.h>
59 #include <linux/cgroup.h>
62 * Tracks how many cpusets are currently defined in system.
63 * When there is only one cpuset (the root cpuset) we can
64 * short circuit some hooks.
66 int number_of_cpusets __read_mostly;
68 /* Forward declare cgroup structures */
69 struct cgroup_subsys cpuset_subsys;
72 /* See "Frequency meter" comments, below. */
75 int cnt; /* unprocessed events count */
76 int val; /* most recent output value */
77 time_t time; /* clock (secs) when val computed */
78 spinlock_t lock; /* guards read or write of above */
82 struct cgroup_subsys_state css;
84 unsigned long flags; /* "unsigned long" so bitops work */
85 cpumask_t cpus_allowed; /* CPUs allowed to tasks in cpuset */
86 nodemask_t mems_allowed; /* Memory Nodes allowed to tasks */
88 struct cpuset *parent; /* my parent */
91 * Copy of global cpuset_mems_generation as of the most
92 * recent time this cpuset changed its mems_allowed.
96 struct fmeter fmeter; /* memory_pressure filter */
98 /* partition number for rebuild_sched_domains() */
101 /* for custom sched domain */
102 int relax_domain_level;
104 /* used for walking a cpuset heirarchy */
105 struct list_head stack_list;
108 /* Retrieve the cpuset for a cgroup */
109 static inline struct cpuset *cgroup_cs(struct cgroup *cont)
111 return container_of(cgroup_subsys_state(cont, cpuset_subsys_id),
115 /* Retrieve the cpuset for a task */
116 static inline struct cpuset *task_cs(struct task_struct *task)
118 return container_of(task_subsys_state(task, cpuset_subsys_id),
121 struct cpuset_hotplug_scanner {
122 struct cgroup_scanner scan;
126 /* bits in struct cpuset flags field */
132 CS_SCHED_LOAD_BALANCE,
137 /* convenient tests for these bits */
138 static inline int is_cpu_exclusive(const struct cpuset *cs)
140 return test_bit(CS_CPU_EXCLUSIVE, &cs->flags);
143 static inline int is_mem_exclusive(const struct cpuset *cs)
145 return test_bit(CS_MEM_EXCLUSIVE, &cs->flags);
148 static inline int is_mem_hardwall(const struct cpuset *cs)
150 return test_bit(CS_MEM_HARDWALL, &cs->flags);
153 static inline int is_sched_load_balance(const struct cpuset *cs)
155 return test_bit(CS_SCHED_LOAD_BALANCE, &cs->flags);
158 static inline int is_memory_migrate(const struct cpuset *cs)
160 return test_bit(CS_MEMORY_MIGRATE, &cs->flags);
163 static inline int is_spread_page(const struct cpuset *cs)
165 return test_bit(CS_SPREAD_PAGE, &cs->flags);
168 static inline int is_spread_slab(const struct cpuset *cs)
170 return test_bit(CS_SPREAD_SLAB, &cs->flags);
174 * Increment this integer everytime any cpuset changes its
175 * mems_allowed value. Users of cpusets can track this generation
176 * number, and avoid having to lock and reload mems_allowed unless
177 * the cpuset they're using changes generation.
179 * A single, global generation is needed because cpuset_attach_task() could
180 * reattach a task to a different cpuset, which must not have its
181 * generation numbers aliased with those of that tasks previous cpuset.
183 * Generations are needed for mems_allowed because one task cannot
184 * modify another's memory placement. So we must enable every task,
185 * on every visit to __alloc_pages(), to efficiently check whether
186 * its current->cpuset->mems_allowed has changed, requiring an update
187 * of its current->mems_allowed.
189 * Since writes to cpuset_mems_generation are guarded by the cgroup lock
190 * there is no need to mark it atomic.
192 static int cpuset_mems_generation;
194 static struct cpuset top_cpuset = {
195 .flags = ((1 << CS_CPU_EXCLUSIVE) | (1 << CS_MEM_EXCLUSIVE)),
196 .cpus_allowed = CPU_MASK_ALL,
197 .mems_allowed = NODE_MASK_ALL,
201 * There are two global mutexes guarding cpuset structures. The first
202 * is the main control groups cgroup_mutex, accessed via
203 * cgroup_lock()/cgroup_unlock(). The second is the cpuset-specific
204 * callback_mutex, below. They can nest. It is ok to first take
205 * cgroup_mutex, then nest callback_mutex. We also require taking
206 * task_lock() when dereferencing a task's cpuset pointer. See "The
207 * task_lock() exception", at the end of this comment.
209 * A task must hold both mutexes to modify cpusets. If a task
210 * holds cgroup_mutex, then it blocks others wanting that mutex,
211 * ensuring that it is the only task able to also acquire callback_mutex
212 * and be able to modify cpusets. It can perform various checks on
213 * the cpuset structure first, knowing nothing will change. It can
214 * also allocate memory while just holding cgroup_mutex. While it is
215 * performing these checks, various callback routines can briefly
216 * acquire callback_mutex to query cpusets. Once it is ready to make
217 * the changes, it takes callback_mutex, blocking everyone else.
219 * Calls to the kernel memory allocator can not be made while holding
220 * callback_mutex, as that would risk double tripping on callback_mutex
221 * from one of the callbacks into the cpuset code from within
224 * If a task is only holding callback_mutex, then it has read-only
227 * The task_struct fields mems_allowed and mems_generation may only
228 * be accessed in the context of that task, so require no locks.
230 * The cpuset_common_file_read() handlers only hold callback_mutex across
231 * small pieces of code, such as when reading out possibly multi-word
232 * cpumasks and nodemasks.
234 * Accessing a task's cpuset should be done in accordance with the
235 * guidelines for accessing subsystem state in kernel/cgroup.c
238 static DEFINE_MUTEX(callback_mutex);
240 /* This is ugly, but preserves the userspace API for existing cpuset
241 * users. If someone tries to mount the "cpuset" filesystem, we
242 * silently switch it to mount "cgroup" instead */
243 static int cpuset_get_sb(struct file_system_type *fs_type,
244 int flags, const char *unused_dev_name,
245 void *data, struct vfsmount *mnt)
247 struct file_system_type *cgroup_fs = get_fs_type("cgroup");
252 "release_agent=/sbin/cpuset_release_agent";
253 ret = cgroup_fs->get_sb(cgroup_fs, flags,
254 unused_dev_name, mountopts, mnt);
255 put_filesystem(cgroup_fs);
260 static struct file_system_type cpuset_fs_type = {
262 .get_sb = cpuset_get_sb,
266 * Return in *pmask the portion of a cpusets's cpus_allowed that
267 * are online. If none are online, walk up the cpuset hierarchy
268 * until we find one that does have some online cpus. If we get
269 * all the way to the top and still haven't found any online cpus,
270 * return cpu_online_map. Or if passed a NULL cs from an exit'ing
271 * task, return cpu_online_map.
273 * One way or another, we guarantee to return some non-empty subset
276 * Call with callback_mutex held.
279 static void guarantee_online_cpus(const struct cpuset *cs, cpumask_t *pmask)
281 while (cs && !cpus_intersects(cs->cpus_allowed, cpu_online_map))
284 cpus_and(*pmask, cs->cpus_allowed, cpu_online_map);
286 *pmask = cpu_online_map;
287 BUG_ON(!cpus_intersects(*pmask, cpu_online_map));
291 * Return in *pmask the portion of a cpusets's mems_allowed that
292 * are online, with memory. If none are online with memory, walk
293 * up the cpuset hierarchy until we find one that does have some
294 * online mems. If we get all the way to the top and still haven't
295 * found any online mems, return node_states[N_HIGH_MEMORY].
297 * One way or another, we guarantee to return some non-empty subset
298 * of node_states[N_HIGH_MEMORY].
300 * Call with callback_mutex held.
303 static void guarantee_online_mems(const struct cpuset *cs, nodemask_t *pmask)
305 while (cs && !nodes_intersects(cs->mems_allowed,
306 node_states[N_HIGH_MEMORY]))
309 nodes_and(*pmask, cs->mems_allowed,
310 node_states[N_HIGH_MEMORY]);
312 *pmask = node_states[N_HIGH_MEMORY];
313 BUG_ON(!nodes_intersects(*pmask, node_states[N_HIGH_MEMORY]));
317 * cpuset_update_task_memory_state - update task memory placement
319 * If the current tasks cpusets mems_allowed changed behind our
320 * backs, update current->mems_allowed, mems_generation and task NUMA
321 * mempolicy to the new value.
323 * Task mempolicy is updated by rebinding it relative to the
324 * current->cpuset if a task has its memory placement changed.
325 * Do not call this routine if in_interrupt().
327 * Call without callback_mutex or task_lock() held. May be
328 * called with or without cgroup_mutex held. Thanks in part to
329 * 'the_top_cpuset_hack', the task's cpuset pointer will never
330 * be NULL. This routine also might acquire callback_mutex during
333 * Reading current->cpuset->mems_generation doesn't need task_lock
334 * to guard the current->cpuset derefence, because it is guarded
335 * from concurrent freeing of current->cpuset using RCU.
337 * The rcu_dereference() is technically probably not needed,
338 * as I don't actually mind if I see a new cpuset pointer but
339 * an old value of mems_generation. However this really only
340 * matters on alpha systems using cpusets heavily. If I dropped
341 * that rcu_dereference(), it would save them a memory barrier.
342 * For all other arch's, rcu_dereference is a no-op anyway, and for
343 * alpha systems not using cpusets, another planned optimization,
344 * avoiding the rcu critical section for tasks in the root cpuset
345 * which is statically allocated, so can't vanish, will make this
346 * irrelevant. Better to use RCU as intended, than to engage in
347 * some cute trick to save a memory barrier that is impossible to
348 * test, for alpha systems using cpusets heavily, which might not
351 * This routine is needed to update the per-task mems_allowed data,
352 * within the tasks context, when it is trying to allocate memory
353 * (in various mm/mempolicy.c routines) and notices that some other
354 * task has been modifying its cpuset.
357 void cpuset_update_task_memory_state(void)
359 int my_cpusets_mem_gen;
360 struct task_struct *tsk = current;
363 if (task_cs(tsk) == &top_cpuset) {
364 /* Don't need rcu for top_cpuset. It's never freed. */
365 my_cpusets_mem_gen = top_cpuset.mems_generation;
368 my_cpusets_mem_gen = task_cs(current)->mems_generation;
372 if (my_cpusets_mem_gen != tsk->cpuset_mems_generation) {
373 mutex_lock(&callback_mutex);
375 cs = task_cs(tsk); /* Maybe changed when task not locked */
376 guarantee_online_mems(cs, &tsk->mems_allowed);
377 tsk->cpuset_mems_generation = cs->mems_generation;
378 if (is_spread_page(cs))
379 tsk->flags |= PF_SPREAD_PAGE;
381 tsk->flags &= ~PF_SPREAD_PAGE;
382 if (is_spread_slab(cs))
383 tsk->flags |= PF_SPREAD_SLAB;
385 tsk->flags &= ~PF_SPREAD_SLAB;
387 mutex_unlock(&callback_mutex);
388 mpol_rebind_task(tsk, &tsk->mems_allowed);
393 * is_cpuset_subset(p, q) - Is cpuset p a subset of cpuset q?
395 * One cpuset is a subset of another if all its allowed CPUs and
396 * Memory Nodes are a subset of the other, and its exclusive flags
397 * are only set if the other's are set. Call holding cgroup_mutex.
400 static int is_cpuset_subset(const struct cpuset *p, const struct cpuset *q)
402 return cpus_subset(p->cpus_allowed, q->cpus_allowed) &&
403 nodes_subset(p->mems_allowed, q->mems_allowed) &&
404 is_cpu_exclusive(p) <= is_cpu_exclusive(q) &&
405 is_mem_exclusive(p) <= is_mem_exclusive(q);
409 * validate_change() - Used to validate that any proposed cpuset change
410 * follows the structural rules for cpusets.
412 * If we replaced the flag and mask values of the current cpuset
413 * (cur) with those values in the trial cpuset (trial), would
414 * our various subset and exclusive rules still be valid? Presumes
417 * 'cur' is the address of an actual, in-use cpuset. Operations
418 * such as list traversal that depend on the actual address of the
419 * cpuset in the list must use cur below, not trial.
421 * 'trial' is the address of bulk structure copy of cur, with
422 * perhaps one or more of the fields cpus_allowed, mems_allowed,
423 * or flags changed to new, trial values.
425 * Return 0 if valid, -errno if not.
428 static int validate_change(const struct cpuset *cur, const struct cpuset *trial)
431 struct cpuset *c, *par;
433 /* Each of our child cpusets must be a subset of us */
434 list_for_each_entry(cont, &cur->css.cgroup->children, sibling) {
435 if (!is_cpuset_subset(cgroup_cs(cont), trial))
439 /* Remaining checks don't apply to root cpuset */
440 if (cur == &top_cpuset)
445 /* We must be a subset of our parent cpuset */
446 if (!is_cpuset_subset(trial, par))
450 * If either I or some sibling (!= me) is exclusive, we can't
453 list_for_each_entry(cont, &par->css.cgroup->children, sibling) {
455 if ((is_cpu_exclusive(trial) || is_cpu_exclusive(c)) &&
457 cpus_intersects(trial->cpus_allowed, c->cpus_allowed))
459 if ((is_mem_exclusive(trial) || is_mem_exclusive(c)) &&
461 nodes_intersects(trial->mems_allowed, c->mems_allowed))
465 /* Cpusets with tasks can't have empty cpus_allowed or mems_allowed */
466 if (cgroup_task_count(cur->css.cgroup)) {
467 if (cpus_empty(trial->cpus_allowed) ||
468 nodes_empty(trial->mems_allowed)) {
477 * Helper routine for rebuild_sched_domains().
478 * Do cpusets a, b have overlapping cpus_allowed masks?
481 static int cpusets_overlap(struct cpuset *a, struct cpuset *b)
483 return cpus_intersects(a->cpus_allowed, b->cpus_allowed);
487 update_domain_attr(struct sched_domain_attr *dattr, struct cpuset *c)
491 if (dattr->relax_domain_level < c->relax_domain_level)
492 dattr->relax_domain_level = c->relax_domain_level;
497 * rebuild_sched_domains()
499 * If the flag 'sched_load_balance' of any cpuset with non-empty
500 * 'cpus' changes, or if the 'cpus' allowed changes in any cpuset
501 * which has that flag enabled, or if any cpuset with a non-empty
502 * 'cpus' is removed, then call this routine to rebuild the
503 * scheduler's dynamic sched domains.
505 * This routine builds a partial partition of the systems CPUs
506 * (the set of non-overlappping cpumask_t's in the array 'part'
507 * below), and passes that partial partition to the kernel/sched.c
508 * partition_sched_domains() routine, which will rebuild the
509 * schedulers load balancing domains (sched domains) as specified
510 * by that partial partition. A 'partial partition' is a set of
511 * non-overlapping subsets whose union is a subset of that set.
513 * See "What is sched_load_balance" in Documentation/cpusets.txt
514 * for a background explanation of this.
516 * Does not return errors, on the theory that the callers of this
517 * routine would rather not worry about failures to rebuild sched
518 * domains when operating in the severe memory shortage situations
519 * that could cause allocation failures below.
521 * Call with cgroup_mutex held. May take callback_mutex during
522 * call due to the kfifo_alloc() and kmalloc() calls. May nest
523 * a call to the get_online_cpus()/put_online_cpus() pair.
524 * Must not be called holding callback_mutex, because we must not
525 * call get_online_cpus() while holding callback_mutex. Elsewhere
526 * the kernel nests callback_mutex inside get_online_cpus() calls.
527 * So the reverse nesting would risk an ABBA deadlock.
529 * The three key local variables below are:
530 * q - a kfifo queue of cpuset pointers, used to implement a
531 * top-down scan of all cpusets. This scan loads a pointer
532 * to each cpuset marked is_sched_load_balance into the
533 * array 'csa'. For our purposes, rebuilding the schedulers
534 * sched domains, we can ignore !is_sched_load_balance cpusets.
535 * csa - (for CpuSet Array) Array of pointers to all the cpusets
536 * that need to be load balanced, for convenient iterative
537 * access by the subsequent code that finds the best partition,
538 * i.e the set of domains (subsets) of CPUs such that the
539 * cpus_allowed of every cpuset marked is_sched_load_balance
540 * is a subset of one of these domains, while there are as
541 * many such domains as possible, each as small as possible.
542 * doms - Conversion of 'csa' to an array of cpumasks, for passing to
543 * the kernel/sched.c routine partition_sched_domains() in a
544 * convenient format, that can be easily compared to the prior
545 * value to determine what partition elements (sched domains)
546 * were changed (added or removed.)
548 * Finding the best partition (set of domains):
549 * The triple nested loops below over i, j, k scan over the
550 * load balanced cpusets (using the array of cpuset pointers in
551 * csa[]) looking for pairs of cpusets that have overlapping
552 * cpus_allowed, but which don't have the same 'pn' partition
553 * number and gives them in the same partition number. It keeps
554 * looping on the 'restart' label until it can no longer find
557 * The union of the cpus_allowed masks from the set of
558 * all cpusets having the same 'pn' value then form the one
559 * element of the partition (one sched domain) to be passed to
560 * partition_sched_domains().
563 void rebuild_sched_domains(void)
565 struct kfifo *q; /* queue of cpusets to be scanned */
566 struct cpuset *cp; /* scans q */
567 struct cpuset **csa; /* array of all cpuset ptrs */
568 int csn; /* how many cpuset ptrs in csa so far */
569 int i, j, k; /* indices for partition finding loops */
570 cpumask_t *doms; /* resulting partition; i.e. sched domains */
571 struct sched_domain_attr *dattr; /* attributes for custom domains */
572 int ndoms; /* number of sched domains in result */
573 int nslot; /* next empty doms[] cpumask_t slot */
580 /* Special case for the 99% of systems with one, full, sched domain */
581 if (is_sched_load_balance(&top_cpuset)) {
583 doms = kmalloc(sizeof(cpumask_t), GFP_KERNEL);
586 dattr = kmalloc(sizeof(struct sched_domain_attr), GFP_KERNEL);
588 *dattr = SD_ATTR_INIT;
589 update_domain_attr(dattr, &top_cpuset);
591 *doms = top_cpuset.cpus_allowed;
595 q = kfifo_alloc(number_of_cpusets * sizeof(cp), GFP_KERNEL, NULL);
598 csa = kmalloc(number_of_cpusets * sizeof(cp), GFP_KERNEL);
604 __kfifo_put(q, (void *)&cp, sizeof(cp));
605 while (__kfifo_get(q, (void *)&cp, sizeof(cp))) {
607 struct cpuset *child; /* scans child cpusets of cp */
608 if (is_sched_load_balance(cp))
610 list_for_each_entry(cont, &cp->css.cgroup->children, sibling) {
611 child = cgroup_cs(cont);
612 __kfifo_put(q, (void *)&child, sizeof(cp));
616 for (i = 0; i < csn; i++)
621 /* Find the best partition (set of sched domains) */
622 for (i = 0; i < csn; i++) {
623 struct cpuset *a = csa[i];
626 for (j = 0; j < csn; j++) {
627 struct cpuset *b = csa[j];
630 if (apn != bpn && cpusets_overlap(a, b)) {
631 for (k = 0; k < csn; k++) {
632 struct cpuset *c = csa[k];
637 ndoms--; /* one less element */
643 /* Convert <csn, csa> to <ndoms, doms> */
644 doms = kmalloc(ndoms * sizeof(cpumask_t), GFP_KERNEL);
647 dattr = kmalloc(ndoms * sizeof(struct sched_domain_attr), GFP_KERNEL);
649 for (nslot = 0, i = 0; i < csn; i++) {
650 struct cpuset *a = csa[i];
654 cpumask_t *dp = doms + nslot;
656 if (nslot == ndoms) {
657 static int warnings = 10;
660 "rebuild_sched_domains confused:"
661 " nslot %d, ndoms %d, csn %d, i %d,"
663 nslot, ndoms, csn, i, apn);
671 *(dattr + nslot) = SD_ATTR_INIT;
672 for (j = i; j < csn; j++) {
673 struct cpuset *b = csa[j];
676 cpus_or(*dp, *dp, b->cpus_allowed);
679 update_domain_attr(dattr
686 BUG_ON(nslot != ndoms);
689 /* Have scheduler rebuild sched domains */
691 partition_sched_domains(ndoms, doms, dattr);
698 /* Don't kfree(doms) -- partition_sched_domains() does that. */
699 /* Don't kfree(dattr) -- partition_sched_domains() does that. */
702 static inline int started_after_time(struct task_struct *t1,
703 struct timespec *time,
704 struct task_struct *t2)
706 int start_diff = timespec_compare(&t1->start_time, time);
707 if (start_diff > 0) {
709 } else if (start_diff < 0) {
713 * Arbitrarily, if two processes started at the same
714 * time, we'll say that the lower pointer value
715 * started first. Note that t2 may have exited by now
716 * so this may not be a valid pointer any longer, but
717 * that's fine - it still serves to distinguish
718 * between two tasks started (effectively)
725 static inline int started_after(void *p1, void *p2)
727 struct task_struct *t1 = p1;
728 struct task_struct *t2 = p2;
729 return started_after_time(t1, &t2->start_time, t2);
733 * cpuset_test_cpumask - test a task's cpus_allowed versus its cpuset's
735 * @scan: struct cgroup_scanner contained in its struct cpuset_hotplug_scanner
737 * Call with cgroup_mutex held. May take callback_mutex during call.
738 * Called for each task in a cgroup by cgroup_scan_tasks().
739 * Return nonzero if this tasks's cpus_allowed mask should be changed (in other
740 * words, if its mask is not equal to its cpuset's mask).
742 static int cpuset_test_cpumask(struct task_struct *tsk,
743 struct cgroup_scanner *scan)
745 return !cpus_equal(tsk->cpus_allowed,
746 (cgroup_cs(scan->cg))->cpus_allowed);
750 * cpuset_change_cpumask - make a task's cpus_allowed the same as its cpuset's
752 * @scan: struct cgroup_scanner containing the cgroup of the task
754 * Called by cgroup_scan_tasks() for each task in a cgroup whose
755 * cpus_allowed mask needs to be changed.
757 * We don't need to re-check for the cgroup/cpuset membership, since we're
758 * holding cgroup_lock() at this point.
760 static void cpuset_change_cpumask(struct task_struct *tsk,
761 struct cgroup_scanner *scan)
763 set_cpus_allowed_ptr(tsk, &((cgroup_cs(scan->cg))->cpus_allowed));
767 * update_tasks_cpumask - Update the cpumasks of tasks in the cpuset.
768 * @cs: the cpuset in which each task's cpus_allowed mask needs to be changed
770 * Called with cgroup_mutex held
772 * The cgroup_scan_tasks() function will scan all the tasks in a cgroup,
773 * calling callback functions for each.
775 * Return 0 if successful, -errno if not.
777 static int update_tasks_cpumask(struct cpuset *cs)
779 struct cgroup_scanner scan;
780 struct ptr_heap heap;
783 retval = heap_init(&heap, PAGE_SIZE, GFP_KERNEL, &started_after);
787 scan.cg = cs->css.cgroup;
788 scan.test_task = cpuset_test_cpumask;
789 scan.process_task = cpuset_change_cpumask;
791 retval = cgroup_scan_tasks(&scan);
798 * update_cpumask - update the cpus_allowed mask of a cpuset and all tasks in it
799 * @cs: the cpuset to consider
800 * @buf: buffer of cpu numbers written to this cpuset
802 static int update_cpumask(struct cpuset *cs, const char *buf)
804 struct cpuset trialcs;
806 int is_load_balanced;
808 /* top_cpuset.cpus_allowed tracks cpu_online_map; it's read-only */
809 if (cs == &top_cpuset)
815 * An empty cpus_allowed is ok only if the cpuset has no tasks.
816 * Since cpulist_parse() fails on an empty mask, we special case
817 * that parsing. The validate_change() call ensures that cpusets
818 * with tasks have cpus.
821 cpus_clear(trialcs.cpus_allowed);
823 retval = cpulist_parse(buf, trialcs.cpus_allowed);
827 if (!cpus_subset(trialcs.cpus_allowed, cpu_online_map))
830 retval = validate_change(cs, &trialcs);
834 /* Nothing to do if the cpus didn't change */
835 if (cpus_equal(cs->cpus_allowed, trialcs.cpus_allowed))
838 is_load_balanced = is_sched_load_balance(&trialcs);
840 mutex_lock(&callback_mutex);
841 cs->cpus_allowed = trialcs.cpus_allowed;
842 mutex_unlock(&callback_mutex);
845 * Scan tasks in the cpuset, and update the cpumasks of any
846 * that need an update.
848 retval = update_tasks_cpumask(cs);
852 if (is_load_balanced)
853 rebuild_sched_domains();
860 * Migrate memory region from one set of nodes to another.
862 * Temporarilly set tasks mems_allowed to target nodes of migration,
863 * so that the migration code can allocate pages on these nodes.
865 * Call holding cgroup_mutex, so current's cpuset won't change
866 * during this call, as manage_mutex holds off any cpuset_attach()
867 * calls. Therefore we don't need to take task_lock around the
868 * call to guarantee_online_mems(), as we know no one is changing
871 * Hold callback_mutex around the two modifications of our tasks
872 * mems_allowed to synchronize with cpuset_mems_allowed().
874 * While the mm_struct we are migrating is typically from some
875 * other task, the task_struct mems_allowed that we are hacking
876 * is for our current task, which must allocate new pages for that
877 * migrating memory region.
879 * We call cpuset_update_task_memory_state() before hacking
880 * our tasks mems_allowed, so that we are assured of being in
881 * sync with our tasks cpuset, and in particular, callbacks to
882 * cpuset_update_task_memory_state() from nested page allocations
883 * won't see any mismatch of our cpuset and task mems_generation
884 * values, so won't overwrite our hacked tasks mems_allowed
888 static void cpuset_migrate_mm(struct mm_struct *mm, const nodemask_t *from,
889 const nodemask_t *to)
891 struct task_struct *tsk = current;
893 cpuset_update_task_memory_state();
895 mutex_lock(&callback_mutex);
896 tsk->mems_allowed = *to;
897 mutex_unlock(&callback_mutex);
899 do_migrate_pages(mm, from, to, MPOL_MF_MOVE_ALL);
901 mutex_lock(&callback_mutex);
902 guarantee_online_mems(task_cs(tsk),&tsk->mems_allowed);
903 mutex_unlock(&callback_mutex);
906 static void *cpuset_being_rebound;
909 * update_tasks_nodemask - Update the nodemasks of tasks in the cpuset.
910 * @cs: the cpuset in which each task's mems_allowed mask needs to be changed
911 * @oldmem: old mems_allowed of cpuset cs
913 * Called with cgroup_mutex held
914 * Return 0 if successful, -errno if not.
916 static int update_tasks_nodemask(struct cpuset *cs, const nodemask_t *oldmem)
918 struct task_struct *p;
919 struct mm_struct **mmarray;
923 struct cgroup_iter it;
926 cpuset_being_rebound = cs; /* causes mpol_dup() rebind */
928 fudge = 10; /* spare mmarray[] slots */
929 fudge += cpus_weight(cs->cpus_allowed); /* imagine one fork-bomb/cpu */
933 * Allocate mmarray[] to hold mm reference for each task
934 * in cpuset cs. Can't kmalloc GFP_KERNEL while holding
935 * tasklist_lock. We could use GFP_ATOMIC, but with a
936 * few more lines of code, we can retry until we get a big
937 * enough mmarray[] w/o using GFP_ATOMIC.
940 ntasks = cgroup_task_count(cs->css.cgroup); /* guess */
942 mmarray = kmalloc(ntasks * sizeof(*mmarray), GFP_KERNEL);
945 read_lock(&tasklist_lock); /* block fork */
946 if (cgroup_task_count(cs->css.cgroup) <= ntasks)
947 break; /* got enough */
948 read_unlock(&tasklist_lock); /* try again */
954 /* Load up mmarray[] with mm reference for each task in cpuset. */
955 cgroup_iter_start(cs->css.cgroup, &it);
956 while ((p = cgroup_iter_next(cs->css.cgroup, &it))) {
957 struct mm_struct *mm;
961 "Cpuset mempolicy rebind incomplete.\n");
969 cgroup_iter_end(cs->css.cgroup, &it);
970 read_unlock(&tasklist_lock);
973 * Now that we've dropped the tasklist spinlock, we can
974 * rebind the vma mempolicies of each mm in mmarray[] to their
975 * new cpuset, and release that mm. The mpol_rebind_mm()
976 * call takes mmap_sem, which we couldn't take while holding
977 * tasklist_lock. Forks can happen again now - the mpol_dup()
978 * cpuset_being_rebound check will catch such forks, and rebind
979 * their vma mempolicies too. Because we still hold the global
980 * cgroup_mutex, we know that no other rebind effort will
981 * be contending for the global variable cpuset_being_rebound.
982 * It's ok if we rebind the same mm twice; mpol_rebind_mm()
983 * is idempotent. Also migrate pages in each mm to new nodes.
985 migrate = is_memory_migrate(cs);
986 for (i = 0; i < n; i++) {
987 struct mm_struct *mm = mmarray[i];
989 mpol_rebind_mm(mm, &cs->mems_allowed);
991 cpuset_migrate_mm(mm, oldmem, &cs->mems_allowed);
995 /* We're done rebinding vmas to this cpuset's new mems_allowed. */
997 cpuset_being_rebound = NULL;
1004 * Handle user request to change the 'mems' memory placement
1005 * of a cpuset. Needs to validate the request, update the
1006 * cpusets mems_allowed and mems_generation, and for each
1007 * task in the cpuset, rebind any vma mempolicies and if
1008 * the cpuset is marked 'memory_migrate', migrate the tasks
1009 * pages to the new memory.
1011 * Call with cgroup_mutex held. May take callback_mutex during call.
1012 * Will take tasklist_lock, scan tasklist for tasks in cpuset cs,
1013 * lock each such tasks mm->mmap_sem, scan its vma's and rebind
1014 * their mempolicies to the cpusets new mems_allowed.
1016 static int update_nodemask(struct cpuset *cs, const char *buf)
1018 struct cpuset trialcs;
1023 * top_cpuset.mems_allowed tracks node_stats[N_HIGH_MEMORY];
1026 if (cs == &top_cpuset)
1032 * An empty mems_allowed is ok iff there are no tasks in the cpuset.
1033 * Since nodelist_parse() fails on an empty mask, we special case
1034 * that parsing. The validate_change() call ensures that cpusets
1035 * with tasks have memory.
1038 nodes_clear(trialcs.mems_allowed);
1040 retval = nodelist_parse(buf, trialcs.mems_allowed);
1044 if (!nodes_subset(trialcs.mems_allowed,
1045 node_states[N_HIGH_MEMORY]))
1048 oldmem = cs->mems_allowed;
1049 if (nodes_equal(oldmem, trialcs.mems_allowed)) {
1050 retval = 0; /* Too easy - nothing to do */
1053 retval = validate_change(cs, &trialcs);
1057 mutex_lock(&callback_mutex);
1058 cs->mems_allowed = trialcs.mems_allowed;
1059 cs->mems_generation = cpuset_mems_generation++;
1060 mutex_unlock(&callback_mutex);
1062 retval = update_tasks_nodemask(cs, &oldmem);
1067 int current_cpuset_is_being_rebound(void)
1069 return task_cs(current) == cpuset_being_rebound;
1072 static int update_relax_domain_level(struct cpuset *cs, s64 val)
1074 if (val < -1 || val >= SD_LV_MAX)
1077 if (val != cs->relax_domain_level) {
1078 cs->relax_domain_level = val;
1079 rebuild_sched_domains();
1086 * update_flag - read a 0 or a 1 in a file and update associated flag
1087 * bit: the bit to update (see cpuset_flagbits_t)
1088 * cs: the cpuset to update
1089 * turning_on: whether the flag is being set or cleared
1091 * Call with cgroup_mutex held.
1094 static int update_flag(cpuset_flagbits_t bit, struct cpuset *cs,
1097 struct cpuset trialcs;
1099 int cpus_nonempty, balance_flag_changed;
1103 set_bit(bit, &trialcs.flags);
1105 clear_bit(bit, &trialcs.flags);
1107 err = validate_change(cs, &trialcs);
1111 cpus_nonempty = !cpus_empty(trialcs.cpus_allowed);
1112 balance_flag_changed = (is_sched_load_balance(cs) !=
1113 is_sched_load_balance(&trialcs));
1115 mutex_lock(&callback_mutex);
1116 cs->flags = trialcs.flags;
1117 mutex_unlock(&callback_mutex);
1119 if (cpus_nonempty && balance_flag_changed)
1120 rebuild_sched_domains();
1126 * Frequency meter - How fast is some event occurring?
1128 * These routines manage a digitally filtered, constant time based,
1129 * event frequency meter. There are four routines:
1130 * fmeter_init() - initialize a frequency meter.
1131 * fmeter_markevent() - called each time the event happens.
1132 * fmeter_getrate() - returns the recent rate of such events.
1133 * fmeter_update() - internal routine used to update fmeter.
1135 * A common data structure is passed to each of these routines,
1136 * which is used to keep track of the state required to manage the
1137 * frequency meter and its digital filter.
1139 * The filter works on the number of events marked per unit time.
1140 * The filter is single-pole low-pass recursive (IIR). The time unit
1141 * is 1 second. Arithmetic is done using 32-bit integers scaled to
1142 * simulate 3 decimal digits of precision (multiplied by 1000).
1144 * With an FM_COEF of 933, and a time base of 1 second, the filter
1145 * has a half-life of 10 seconds, meaning that if the events quit
1146 * happening, then the rate returned from the fmeter_getrate()
1147 * will be cut in half each 10 seconds, until it converges to zero.
1149 * It is not worth doing a real infinitely recursive filter. If more
1150 * than FM_MAXTICKS ticks have elapsed since the last filter event,
1151 * just compute FM_MAXTICKS ticks worth, by which point the level
1154 * Limit the count of unprocessed events to FM_MAXCNT, so as to avoid
1155 * arithmetic overflow in the fmeter_update() routine.
1157 * Given the simple 32 bit integer arithmetic used, this meter works
1158 * best for reporting rates between one per millisecond (msec) and
1159 * one per 32 (approx) seconds. At constant rates faster than one
1160 * per msec it maxes out at values just under 1,000,000. At constant
1161 * rates between one per msec, and one per second it will stabilize
1162 * to a value N*1000, where N is the rate of events per second.
1163 * At constant rates between one per second and one per 32 seconds,
1164 * it will be choppy, moving up on the seconds that have an event,
1165 * and then decaying until the next event. At rates slower than
1166 * about one in 32 seconds, it decays all the way back to zero between
1170 #define FM_COEF 933 /* coefficient for half-life of 10 secs */
1171 #define FM_MAXTICKS ((time_t)99) /* useless computing more ticks than this */
1172 #define FM_MAXCNT 1000000 /* limit cnt to avoid overflow */
1173 #define FM_SCALE 1000 /* faux fixed point scale */
1175 /* Initialize a frequency meter */
1176 static void fmeter_init(struct fmeter *fmp)
1181 spin_lock_init(&fmp->lock);
1184 /* Internal meter update - process cnt events and update value */
1185 static void fmeter_update(struct fmeter *fmp)
1187 time_t now = get_seconds();
1188 time_t ticks = now - fmp->time;
1193 ticks = min(FM_MAXTICKS, ticks);
1195 fmp->val = (FM_COEF * fmp->val) / FM_SCALE;
1198 fmp->val += ((FM_SCALE - FM_COEF) * fmp->cnt) / FM_SCALE;
1202 /* Process any previous ticks, then bump cnt by one (times scale). */
1203 static void fmeter_markevent(struct fmeter *fmp)
1205 spin_lock(&fmp->lock);
1207 fmp->cnt = min(FM_MAXCNT, fmp->cnt + FM_SCALE);
1208 spin_unlock(&fmp->lock);
1211 /* Process any previous ticks, then return current value. */
1212 static int fmeter_getrate(struct fmeter *fmp)
1216 spin_lock(&fmp->lock);
1219 spin_unlock(&fmp->lock);
1223 /* Called by cgroups to determine if a cpuset is usable; cgroup_mutex held */
1224 static int cpuset_can_attach(struct cgroup_subsys *ss,
1225 struct cgroup *cont, struct task_struct *tsk)
1227 struct cpuset *cs = cgroup_cs(cont);
1229 if (cpus_empty(cs->cpus_allowed) || nodes_empty(cs->mems_allowed))
1231 if (tsk->flags & PF_THREAD_BOUND) {
1234 mutex_lock(&callback_mutex);
1235 mask = cs->cpus_allowed;
1236 mutex_unlock(&callback_mutex);
1237 if (!cpus_equal(tsk->cpus_allowed, mask))
1241 return security_task_setscheduler(tsk, 0, NULL);
1244 static void cpuset_attach(struct cgroup_subsys *ss,
1245 struct cgroup *cont, struct cgroup *oldcont,
1246 struct task_struct *tsk)
1249 nodemask_t from, to;
1250 struct mm_struct *mm;
1251 struct cpuset *cs = cgroup_cs(cont);
1252 struct cpuset *oldcs = cgroup_cs(oldcont);
1255 mutex_lock(&callback_mutex);
1256 guarantee_online_cpus(cs, &cpus);
1257 err = set_cpus_allowed_ptr(tsk, &cpus);
1258 mutex_unlock(&callback_mutex);
1262 from = oldcs->mems_allowed;
1263 to = cs->mems_allowed;
1264 mm = get_task_mm(tsk);
1266 mpol_rebind_mm(mm, &to);
1267 if (is_memory_migrate(cs))
1268 cpuset_migrate_mm(mm, &from, &to);
1274 /* The various types of files and directories in a cpuset file system */
1277 FILE_MEMORY_MIGRATE,
1283 FILE_SCHED_LOAD_BALANCE,
1284 FILE_SCHED_RELAX_DOMAIN_LEVEL,
1285 FILE_MEMORY_PRESSURE_ENABLED,
1286 FILE_MEMORY_PRESSURE,
1289 } cpuset_filetype_t;
1291 static int cpuset_write_u64(struct cgroup *cgrp, struct cftype *cft, u64 val)
1294 struct cpuset *cs = cgroup_cs(cgrp);
1295 cpuset_filetype_t type = cft->private;
1297 if (!cgroup_lock_live_group(cgrp))
1301 case FILE_CPU_EXCLUSIVE:
1302 retval = update_flag(CS_CPU_EXCLUSIVE, cs, val);
1304 case FILE_MEM_EXCLUSIVE:
1305 retval = update_flag(CS_MEM_EXCLUSIVE, cs, val);
1307 case FILE_MEM_HARDWALL:
1308 retval = update_flag(CS_MEM_HARDWALL, cs, val);
1310 case FILE_SCHED_LOAD_BALANCE:
1311 retval = update_flag(CS_SCHED_LOAD_BALANCE, cs, val);
1313 case FILE_MEMORY_MIGRATE:
1314 retval = update_flag(CS_MEMORY_MIGRATE, cs, val);
1316 case FILE_MEMORY_PRESSURE_ENABLED:
1317 cpuset_memory_pressure_enabled = !!val;
1319 case FILE_MEMORY_PRESSURE:
1322 case FILE_SPREAD_PAGE:
1323 retval = update_flag(CS_SPREAD_PAGE, cs, val);
1324 cs->mems_generation = cpuset_mems_generation++;
1326 case FILE_SPREAD_SLAB:
1327 retval = update_flag(CS_SPREAD_SLAB, cs, val);
1328 cs->mems_generation = cpuset_mems_generation++;
1338 static int cpuset_write_s64(struct cgroup *cgrp, struct cftype *cft, s64 val)
1341 struct cpuset *cs = cgroup_cs(cgrp);
1342 cpuset_filetype_t type = cft->private;
1344 if (!cgroup_lock_live_group(cgrp))
1348 case FILE_SCHED_RELAX_DOMAIN_LEVEL:
1349 retval = update_relax_domain_level(cs, val);
1360 * Common handling for a write to a "cpus" or "mems" file.
1362 static int cpuset_write_resmask(struct cgroup *cgrp, struct cftype *cft,
1367 if (!cgroup_lock_live_group(cgrp))
1370 switch (cft->private) {
1372 retval = update_cpumask(cgroup_cs(cgrp), buf);
1375 retval = update_nodemask(cgroup_cs(cgrp), buf);
1386 * These ascii lists should be read in a single call, by using a user
1387 * buffer large enough to hold the entire map. If read in smaller
1388 * chunks, there is no guarantee of atomicity. Since the display format
1389 * used, list of ranges of sequential numbers, is variable length,
1390 * and since these maps can change value dynamically, one could read
1391 * gibberish by doing partial reads while a list was changing.
1392 * A single large read to a buffer that crosses a page boundary is
1393 * ok, because the result being copied to user land is not recomputed
1394 * across a page fault.
1397 static int cpuset_sprintf_cpulist(char *page, struct cpuset *cs)
1401 mutex_lock(&callback_mutex);
1402 mask = cs->cpus_allowed;
1403 mutex_unlock(&callback_mutex);
1405 return cpulist_scnprintf(page, PAGE_SIZE, mask);
1408 static int cpuset_sprintf_memlist(char *page, struct cpuset *cs)
1412 mutex_lock(&callback_mutex);
1413 mask = cs->mems_allowed;
1414 mutex_unlock(&callback_mutex);
1416 return nodelist_scnprintf(page, PAGE_SIZE, mask);
1419 static ssize_t cpuset_common_file_read(struct cgroup *cont,
1423 size_t nbytes, loff_t *ppos)
1425 struct cpuset *cs = cgroup_cs(cont);
1426 cpuset_filetype_t type = cft->private;
1431 if (!(page = (char *)__get_free_page(GFP_TEMPORARY)))
1438 s += cpuset_sprintf_cpulist(s, cs);
1441 s += cpuset_sprintf_memlist(s, cs);
1449 retval = simple_read_from_buffer(buf, nbytes, ppos, page, s - page);
1451 free_page((unsigned long)page);
1455 static u64 cpuset_read_u64(struct cgroup *cont, struct cftype *cft)
1457 struct cpuset *cs = cgroup_cs(cont);
1458 cpuset_filetype_t type = cft->private;
1460 case FILE_CPU_EXCLUSIVE:
1461 return is_cpu_exclusive(cs);
1462 case FILE_MEM_EXCLUSIVE:
1463 return is_mem_exclusive(cs);
1464 case FILE_MEM_HARDWALL:
1465 return is_mem_hardwall(cs);
1466 case FILE_SCHED_LOAD_BALANCE:
1467 return is_sched_load_balance(cs);
1468 case FILE_MEMORY_MIGRATE:
1469 return is_memory_migrate(cs);
1470 case FILE_MEMORY_PRESSURE_ENABLED:
1471 return cpuset_memory_pressure_enabled;
1472 case FILE_MEMORY_PRESSURE:
1473 return fmeter_getrate(&cs->fmeter);
1474 case FILE_SPREAD_PAGE:
1475 return is_spread_page(cs);
1476 case FILE_SPREAD_SLAB:
1477 return is_spread_slab(cs);
1483 static s64 cpuset_read_s64(struct cgroup *cont, struct cftype *cft)
1485 struct cpuset *cs = cgroup_cs(cont);
1486 cpuset_filetype_t type = cft->private;
1488 case FILE_SCHED_RELAX_DOMAIN_LEVEL:
1489 return cs->relax_domain_level;
1497 * for the common functions, 'private' gives the type of file
1500 static struct cftype files[] = {
1503 .read = cpuset_common_file_read,
1504 .write_string = cpuset_write_resmask,
1505 .max_write_len = (100U + 6 * NR_CPUS),
1506 .private = FILE_CPULIST,
1511 .read = cpuset_common_file_read,
1512 .write_string = cpuset_write_resmask,
1513 .max_write_len = (100U + 6 * MAX_NUMNODES),
1514 .private = FILE_MEMLIST,
1518 .name = "cpu_exclusive",
1519 .read_u64 = cpuset_read_u64,
1520 .write_u64 = cpuset_write_u64,
1521 .private = FILE_CPU_EXCLUSIVE,
1525 .name = "mem_exclusive",
1526 .read_u64 = cpuset_read_u64,
1527 .write_u64 = cpuset_write_u64,
1528 .private = FILE_MEM_EXCLUSIVE,
1532 .name = "mem_hardwall",
1533 .read_u64 = cpuset_read_u64,
1534 .write_u64 = cpuset_write_u64,
1535 .private = FILE_MEM_HARDWALL,
1539 .name = "sched_load_balance",
1540 .read_u64 = cpuset_read_u64,
1541 .write_u64 = cpuset_write_u64,
1542 .private = FILE_SCHED_LOAD_BALANCE,
1546 .name = "sched_relax_domain_level",
1547 .read_s64 = cpuset_read_s64,
1548 .write_s64 = cpuset_write_s64,
1549 .private = FILE_SCHED_RELAX_DOMAIN_LEVEL,
1553 .name = "memory_migrate",
1554 .read_u64 = cpuset_read_u64,
1555 .write_u64 = cpuset_write_u64,
1556 .private = FILE_MEMORY_MIGRATE,
1560 .name = "memory_pressure",
1561 .read_u64 = cpuset_read_u64,
1562 .write_u64 = cpuset_write_u64,
1563 .private = FILE_MEMORY_PRESSURE,
1567 .name = "memory_spread_page",
1568 .read_u64 = cpuset_read_u64,
1569 .write_u64 = cpuset_write_u64,
1570 .private = FILE_SPREAD_PAGE,
1574 .name = "memory_spread_slab",
1575 .read_u64 = cpuset_read_u64,
1576 .write_u64 = cpuset_write_u64,
1577 .private = FILE_SPREAD_SLAB,
1581 static struct cftype cft_memory_pressure_enabled = {
1582 .name = "memory_pressure_enabled",
1583 .read_u64 = cpuset_read_u64,
1584 .write_u64 = cpuset_write_u64,
1585 .private = FILE_MEMORY_PRESSURE_ENABLED,
1588 static int cpuset_populate(struct cgroup_subsys *ss, struct cgroup *cont)
1592 err = cgroup_add_files(cont, ss, files, ARRAY_SIZE(files));
1595 /* memory_pressure_enabled is in root cpuset only */
1597 err = cgroup_add_file(cont, ss,
1598 &cft_memory_pressure_enabled);
1603 * post_clone() is called at the end of cgroup_clone().
1604 * 'cgroup' was just created automatically as a result of
1605 * a cgroup_clone(), and the current task is about to
1606 * be moved into 'cgroup'.
1608 * Currently we refuse to set up the cgroup - thereby
1609 * refusing the task to be entered, and as a result refusing
1610 * the sys_unshare() or clone() which initiated it - if any
1611 * sibling cpusets have exclusive cpus or mem.
1613 * If this becomes a problem for some users who wish to
1614 * allow that scenario, then cpuset_post_clone() could be
1615 * changed to grant parent->cpus_allowed-sibling_cpus_exclusive
1616 * (and likewise for mems) to the new cgroup. Called with cgroup_mutex
1619 static void cpuset_post_clone(struct cgroup_subsys *ss,
1620 struct cgroup *cgroup)
1622 struct cgroup *parent, *child;
1623 struct cpuset *cs, *parent_cs;
1625 parent = cgroup->parent;
1626 list_for_each_entry(child, &parent->children, sibling) {
1627 cs = cgroup_cs(child);
1628 if (is_mem_exclusive(cs) || is_cpu_exclusive(cs))
1631 cs = cgroup_cs(cgroup);
1632 parent_cs = cgroup_cs(parent);
1634 cs->mems_allowed = parent_cs->mems_allowed;
1635 cs->cpus_allowed = parent_cs->cpus_allowed;
1640 * cpuset_create - create a cpuset
1641 * ss: cpuset cgroup subsystem
1642 * cont: control group that the new cpuset will be part of
1645 static struct cgroup_subsys_state *cpuset_create(
1646 struct cgroup_subsys *ss,
1647 struct cgroup *cont)
1650 struct cpuset *parent;
1652 if (!cont->parent) {
1653 /* This is early initialization for the top cgroup */
1654 top_cpuset.mems_generation = cpuset_mems_generation++;
1655 return &top_cpuset.css;
1657 parent = cgroup_cs(cont->parent);
1658 cs = kmalloc(sizeof(*cs), GFP_KERNEL);
1660 return ERR_PTR(-ENOMEM);
1662 cpuset_update_task_memory_state();
1664 if (is_spread_page(parent))
1665 set_bit(CS_SPREAD_PAGE, &cs->flags);
1666 if (is_spread_slab(parent))
1667 set_bit(CS_SPREAD_SLAB, &cs->flags);
1668 set_bit(CS_SCHED_LOAD_BALANCE, &cs->flags);
1669 cpus_clear(cs->cpus_allowed);
1670 nodes_clear(cs->mems_allowed);
1671 cs->mems_generation = cpuset_mems_generation++;
1672 fmeter_init(&cs->fmeter);
1673 cs->relax_domain_level = -1;
1675 cs->parent = parent;
1676 number_of_cpusets++;
1681 * Locking note on the strange update_flag() call below:
1683 * If the cpuset being removed has its flag 'sched_load_balance'
1684 * enabled, then simulate turning sched_load_balance off, which
1685 * will call rebuild_sched_domains(). The get_online_cpus()
1686 * call in rebuild_sched_domains() must not be made while holding
1687 * callback_mutex. Elsewhere the kernel nests callback_mutex inside
1688 * get_online_cpus() calls. So the reverse nesting would risk an
1692 static void cpuset_destroy(struct cgroup_subsys *ss, struct cgroup *cont)
1694 struct cpuset *cs = cgroup_cs(cont);
1696 cpuset_update_task_memory_state();
1698 if (is_sched_load_balance(cs))
1699 update_flag(CS_SCHED_LOAD_BALANCE, cs, 0);
1701 number_of_cpusets--;
1705 struct cgroup_subsys cpuset_subsys = {
1707 .create = cpuset_create,
1708 .destroy = cpuset_destroy,
1709 .can_attach = cpuset_can_attach,
1710 .attach = cpuset_attach,
1711 .populate = cpuset_populate,
1712 .post_clone = cpuset_post_clone,
1713 .subsys_id = cpuset_subsys_id,
1718 * cpuset_init_early - just enough so that the calls to
1719 * cpuset_update_task_memory_state() in early init code
1723 int __init cpuset_init_early(void)
1725 top_cpuset.mems_generation = cpuset_mems_generation++;
1731 * cpuset_init - initialize cpusets at system boot
1733 * Description: Initialize top_cpuset and the cpuset internal file system,
1736 int __init cpuset_init(void)
1740 cpus_setall(top_cpuset.cpus_allowed);
1741 nodes_setall(top_cpuset.mems_allowed);
1743 fmeter_init(&top_cpuset.fmeter);
1744 top_cpuset.mems_generation = cpuset_mems_generation++;
1745 set_bit(CS_SCHED_LOAD_BALANCE, &top_cpuset.flags);
1746 top_cpuset.relax_domain_level = -1;
1748 err = register_filesystem(&cpuset_fs_type);
1752 number_of_cpusets = 1;
1757 * cpuset_do_move_task - move a given task to another cpuset
1758 * @tsk: pointer to task_struct the task to move
1759 * @scan: struct cgroup_scanner contained in its struct cpuset_hotplug_scanner
1761 * Called by cgroup_scan_tasks() for each task in a cgroup.
1762 * Return nonzero to stop the walk through the tasks.
1764 static void cpuset_do_move_task(struct task_struct *tsk,
1765 struct cgroup_scanner *scan)
1767 struct cpuset_hotplug_scanner *chsp;
1769 chsp = container_of(scan, struct cpuset_hotplug_scanner, scan);
1770 cgroup_attach_task(chsp->to, tsk);
1774 * move_member_tasks_to_cpuset - move tasks from one cpuset to another
1775 * @from: cpuset in which the tasks currently reside
1776 * @to: cpuset to which the tasks will be moved
1778 * Called with cgroup_mutex held
1779 * callback_mutex must not be held, as cpuset_attach() will take it.
1781 * The cgroup_scan_tasks() function will scan all the tasks in a cgroup,
1782 * calling callback functions for each.
1784 static void move_member_tasks_to_cpuset(struct cpuset *from, struct cpuset *to)
1786 struct cpuset_hotplug_scanner scan;
1788 scan.scan.cg = from->css.cgroup;
1789 scan.scan.test_task = NULL; /* select all tasks in cgroup */
1790 scan.scan.process_task = cpuset_do_move_task;
1791 scan.scan.heap = NULL;
1792 scan.to = to->css.cgroup;
1794 if (cgroup_scan_tasks((struct cgroup_scanner *)&scan))
1795 printk(KERN_ERR "move_member_tasks_to_cpuset: "
1796 "cgroup_scan_tasks failed\n");
1800 * If common_cpu_mem_hotplug_unplug(), below, unplugs any CPUs
1801 * or memory nodes, we need to walk over the cpuset hierarchy,
1802 * removing that CPU or node from all cpusets. If this removes the
1803 * last CPU or node from a cpuset, then move the tasks in the empty
1804 * cpuset to its next-highest non-empty parent.
1806 * Called with cgroup_mutex held
1807 * callback_mutex must not be held, as cpuset_attach() will take it.
1809 static void remove_tasks_in_empty_cpuset(struct cpuset *cs)
1811 struct cpuset *parent;
1814 * The cgroup's css_sets list is in use if there are tasks
1815 * in the cpuset; the list is empty if there are none;
1816 * the cs->css.refcnt seems always 0.
1818 if (list_empty(&cs->css.cgroup->css_sets))
1822 * Find its next-highest non-empty parent, (top cpuset
1823 * has online cpus, so can't be empty).
1825 parent = cs->parent;
1826 while (cpus_empty(parent->cpus_allowed) ||
1827 nodes_empty(parent->mems_allowed))
1828 parent = parent->parent;
1830 move_member_tasks_to_cpuset(cs, parent);
1834 * Walk the specified cpuset subtree and look for empty cpusets.
1835 * The tasks of such cpuset must be moved to a parent cpuset.
1837 * Called with cgroup_mutex held. We take callback_mutex to modify
1838 * cpus_allowed and mems_allowed.
1840 * This walk processes the tree from top to bottom, completing one layer
1841 * before dropping down to the next. It always processes a node before
1842 * any of its children.
1844 * For now, since we lack memory hot unplug, we'll never see a cpuset
1845 * that has tasks along with an empty 'mems'. But if we did see such
1846 * a cpuset, we'd handle it just like we do if its 'cpus' was empty.
1848 static void scan_for_empty_cpusets(const struct cpuset *root)
1850 struct cpuset *cp; /* scans cpusets being updated */
1851 struct cpuset *child; /* scans child cpusets of cp */
1852 struct list_head queue;
1853 struct cgroup *cont;
1856 INIT_LIST_HEAD(&queue);
1858 list_add_tail((struct list_head *)&root->stack_list, &queue);
1860 while (!list_empty(&queue)) {
1861 cp = container_of(queue.next, struct cpuset, stack_list);
1862 list_del(queue.next);
1863 list_for_each_entry(cont, &cp->css.cgroup->children, sibling) {
1864 child = cgroup_cs(cont);
1865 list_add_tail(&child->stack_list, &queue);
1867 cont = cp->css.cgroup;
1869 /* Continue past cpusets with all cpus, mems online */
1870 if (cpus_subset(cp->cpus_allowed, cpu_online_map) &&
1871 nodes_subset(cp->mems_allowed, node_states[N_HIGH_MEMORY]))
1874 oldmems = cp->mems_allowed;
1876 /* Remove offline cpus and mems from this cpuset. */
1877 mutex_lock(&callback_mutex);
1878 cpus_and(cp->cpus_allowed, cp->cpus_allowed, cpu_online_map);
1879 nodes_and(cp->mems_allowed, cp->mems_allowed,
1880 node_states[N_HIGH_MEMORY]);
1881 mutex_unlock(&callback_mutex);
1883 /* Move tasks from the empty cpuset to a parent */
1884 if (cpus_empty(cp->cpus_allowed) ||
1885 nodes_empty(cp->mems_allowed))
1886 remove_tasks_in_empty_cpuset(cp);
1888 update_tasks_cpumask(cp);
1889 update_tasks_nodemask(cp, &oldmems);
1895 * The cpus_allowed and mems_allowed nodemasks in the top_cpuset track
1896 * cpu_online_map and node_states[N_HIGH_MEMORY]. Force the top cpuset to
1897 * track what's online after any CPU or memory node hotplug or unplug event.
1899 * Since there are two callers of this routine, one for CPU hotplug
1900 * events and one for memory node hotplug events, we could have coded
1901 * two separate routines here. We code it as a single common routine
1902 * in order to minimize text size.
1905 static void common_cpu_mem_hotplug_unplug(int rebuild_sd)
1909 top_cpuset.cpus_allowed = cpu_online_map;
1910 top_cpuset.mems_allowed = node_states[N_HIGH_MEMORY];
1911 scan_for_empty_cpusets(&top_cpuset);
1914 * Scheduler destroys domains on hotplug events.
1915 * Rebuild them based on the current settings.
1918 rebuild_sched_domains();
1924 * The top_cpuset tracks what CPUs and Memory Nodes are online,
1925 * period. This is necessary in order to make cpusets transparent
1926 * (of no affect) on systems that are actively using CPU hotplug
1927 * but making no active use of cpusets.
1929 * This routine ensures that top_cpuset.cpus_allowed tracks
1930 * cpu_online_map on each CPU hotplug (cpuhp) event.
1933 static int cpuset_handle_cpuhp(struct notifier_block *unused_nb,
1934 unsigned long phase, void *unused_cpu)
1937 case CPU_UP_CANCELED:
1938 case CPU_UP_CANCELED_FROZEN:
1939 case CPU_DOWN_FAILED:
1940 case CPU_DOWN_FAILED_FROZEN:
1942 case CPU_ONLINE_FROZEN:
1944 case CPU_DEAD_FROZEN:
1945 common_cpu_mem_hotplug_unplug(1);
1954 #ifdef CONFIG_MEMORY_HOTPLUG
1956 * Keep top_cpuset.mems_allowed tracking node_states[N_HIGH_MEMORY].
1957 * Call this routine anytime after you change
1958 * node_states[N_HIGH_MEMORY].
1959 * See also the previous routine cpuset_handle_cpuhp().
1962 void cpuset_track_online_nodes(void)
1964 common_cpu_mem_hotplug_unplug(0);
1969 * cpuset_init_smp - initialize cpus_allowed
1971 * Description: Finish top cpuset after cpu, node maps are initialized
1974 void __init cpuset_init_smp(void)
1976 top_cpuset.cpus_allowed = cpu_online_map;
1977 top_cpuset.mems_allowed = node_states[N_HIGH_MEMORY];
1979 hotcpu_notifier(cpuset_handle_cpuhp, 0);
1983 * cpuset_cpus_allowed - return cpus_allowed mask from a tasks cpuset.
1984 * @tsk: pointer to task_struct from which to obtain cpuset->cpus_allowed.
1985 * @pmask: pointer to cpumask_t variable to receive cpus_allowed set.
1987 * Description: Returns the cpumask_t cpus_allowed of the cpuset
1988 * attached to the specified @tsk. Guaranteed to return some non-empty
1989 * subset of cpu_online_map, even if this means going outside the
1993 void cpuset_cpus_allowed(struct task_struct *tsk, cpumask_t *pmask)
1995 mutex_lock(&callback_mutex);
1996 cpuset_cpus_allowed_locked(tsk, pmask);
1997 mutex_unlock(&callback_mutex);
2001 * cpuset_cpus_allowed_locked - return cpus_allowed mask from a tasks cpuset.
2002 * Must be called with callback_mutex held.
2004 void cpuset_cpus_allowed_locked(struct task_struct *tsk, cpumask_t *pmask)
2007 guarantee_online_cpus(task_cs(tsk), pmask);
2011 void cpuset_init_current_mems_allowed(void)
2013 nodes_setall(current->mems_allowed);
2017 * cpuset_mems_allowed - return mems_allowed mask from a tasks cpuset.
2018 * @tsk: pointer to task_struct from which to obtain cpuset->mems_allowed.
2020 * Description: Returns the nodemask_t mems_allowed of the cpuset
2021 * attached to the specified @tsk. Guaranteed to return some non-empty
2022 * subset of node_states[N_HIGH_MEMORY], even if this means going outside the
2026 nodemask_t cpuset_mems_allowed(struct task_struct *tsk)
2030 mutex_lock(&callback_mutex);
2032 guarantee_online_mems(task_cs(tsk), &mask);
2034 mutex_unlock(&callback_mutex);
2040 * cpuset_nodemask_valid_mems_allowed - check nodemask vs. curremt mems_allowed
2041 * @nodemask: the nodemask to be checked
2043 * Are any of the nodes in the nodemask allowed in current->mems_allowed?
2045 int cpuset_nodemask_valid_mems_allowed(nodemask_t *nodemask)
2047 return nodes_intersects(*nodemask, current->mems_allowed);
2051 * nearest_hardwall_ancestor() - Returns the nearest mem_exclusive or
2052 * mem_hardwall ancestor to the specified cpuset. Call holding
2053 * callback_mutex. If no ancestor is mem_exclusive or mem_hardwall
2054 * (an unusual configuration), then returns the root cpuset.
2056 static const struct cpuset *nearest_hardwall_ancestor(const struct cpuset *cs)
2058 while (!(is_mem_exclusive(cs) || is_mem_hardwall(cs)) && cs->parent)
2064 * cpuset_zone_allowed_softwall - Can we allocate on zone z's memory node?
2065 * @z: is this zone on an allowed node?
2066 * @gfp_mask: memory allocation flags
2068 * If we're in interrupt, yes, we can always allocate. If
2069 * __GFP_THISNODE is set, yes, we can always allocate. If zone
2070 * z's node is in our tasks mems_allowed, yes. If it's not a
2071 * __GFP_HARDWALL request and this zone's nodes is in the nearest
2072 * hardwalled cpuset ancestor to this tasks cpuset, yes.
2073 * If the task has been OOM killed and has access to memory reserves
2074 * as specified by the TIF_MEMDIE flag, yes.
2077 * If __GFP_HARDWALL is set, cpuset_zone_allowed_softwall()
2078 * reduces to cpuset_zone_allowed_hardwall(). Otherwise,
2079 * cpuset_zone_allowed_softwall() might sleep, and might allow a zone
2080 * from an enclosing cpuset.
2082 * cpuset_zone_allowed_hardwall() only handles the simpler case of
2083 * hardwall cpusets, and never sleeps.
2085 * The __GFP_THISNODE placement logic is really handled elsewhere,
2086 * by forcibly using a zonelist starting at a specified node, and by
2087 * (in get_page_from_freelist()) refusing to consider the zones for
2088 * any node on the zonelist except the first. By the time any such
2089 * calls get to this routine, we should just shut up and say 'yes'.
2091 * GFP_USER allocations are marked with the __GFP_HARDWALL bit,
2092 * and do not allow allocations outside the current tasks cpuset
2093 * unless the task has been OOM killed as is marked TIF_MEMDIE.
2094 * GFP_KERNEL allocations are not so marked, so can escape to the
2095 * nearest enclosing hardwalled ancestor cpuset.
2097 * Scanning up parent cpusets requires callback_mutex. The
2098 * __alloc_pages() routine only calls here with __GFP_HARDWALL bit
2099 * _not_ set if it's a GFP_KERNEL allocation, and all nodes in the
2100 * current tasks mems_allowed came up empty on the first pass over
2101 * the zonelist. So only GFP_KERNEL allocations, if all nodes in the
2102 * cpuset are short of memory, might require taking the callback_mutex
2105 * The first call here from mm/page_alloc:get_page_from_freelist()
2106 * has __GFP_HARDWALL set in gfp_mask, enforcing hardwall cpusets,
2107 * so no allocation on a node outside the cpuset is allowed (unless
2108 * in interrupt, of course).
2110 * The second pass through get_page_from_freelist() doesn't even call
2111 * here for GFP_ATOMIC calls. For those calls, the __alloc_pages()
2112 * variable 'wait' is not set, and the bit ALLOC_CPUSET is not set
2113 * in alloc_flags. That logic and the checks below have the combined
2115 * in_interrupt - any node ok (current task context irrelevant)
2116 * GFP_ATOMIC - any node ok
2117 * TIF_MEMDIE - any node ok
2118 * GFP_KERNEL - any node in enclosing hardwalled cpuset ok
2119 * GFP_USER - only nodes in current tasks mems allowed ok.
2122 * Don't call cpuset_zone_allowed_softwall if you can't sleep, unless you
2123 * pass in the __GFP_HARDWALL flag set in gfp_flag, which disables
2124 * the code that might scan up ancestor cpusets and sleep.
2127 int __cpuset_zone_allowed_softwall(struct zone *z, gfp_t gfp_mask)
2129 int node; /* node that zone z is on */
2130 const struct cpuset *cs; /* current cpuset ancestors */
2131 int allowed; /* is allocation in zone z allowed? */
2133 if (in_interrupt() || (gfp_mask & __GFP_THISNODE))
2135 node = zone_to_nid(z);
2136 might_sleep_if(!(gfp_mask & __GFP_HARDWALL));
2137 if (node_isset(node, current->mems_allowed))
2140 * Allow tasks that have access to memory reserves because they have
2141 * been OOM killed to get memory anywhere.
2143 if (unlikely(test_thread_flag(TIF_MEMDIE)))
2145 if (gfp_mask & __GFP_HARDWALL) /* If hardwall request, stop here */
2148 if (current->flags & PF_EXITING) /* Let dying task have memory */
2151 /* Not hardwall and node outside mems_allowed: scan up cpusets */
2152 mutex_lock(&callback_mutex);
2155 cs = nearest_hardwall_ancestor(task_cs(current));
2156 task_unlock(current);
2158 allowed = node_isset(node, cs->mems_allowed);
2159 mutex_unlock(&callback_mutex);
2164 * cpuset_zone_allowed_hardwall - Can we allocate on zone z's memory node?
2165 * @z: is this zone on an allowed node?
2166 * @gfp_mask: memory allocation flags
2168 * If we're in interrupt, yes, we can always allocate.
2169 * If __GFP_THISNODE is set, yes, we can always allocate. If zone
2170 * z's node is in our tasks mems_allowed, yes. If the task has been
2171 * OOM killed and has access to memory reserves as specified by the
2172 * TIF_MEMDIE flag, yes. Otherwise, no.
2174 * The __GFP_THISNODE placement logic is really handled elsewhere,
2175 * by forcibly using a zonelist starting at a specified node, and by
2176 * (in get_page_from_freelist()) refusing to consider the zones for
2177 * any node on the zonelist except the first. By the time any such
2178 * calls get to this routine, we should just shut up and say 'yes'.
2180 * Unlike the cpuset_zone_allowed_softwall() variant, above,
2181 * this variant requires that the zone be in the current tasks
2182 * mems_allowed or that we're in interrupt. It does not scan up the
2183 * cpuset hierarchy for the nearest enclosing mem_exclusive cpuset.
2187 int __cpuset_zone_allowed_hardwall(struct zone *z, gfp_t gfp_mask)
2189 int node; /* node that zone z is on */
2191 if (in_interrupt() || (gfp_mask & __GFP_THISNODE))
2193 node = zone_to_nid(z);
2194 if (node_isset(node, current->mems_allowed))
2197 * Allow tasks that have access to memory reserves because they have
2198 * been OOM killed to get memory anywhere.
2200 if (unlikely(test_thread_flag(TIF_MEMDIE)))
2206 * cpuset_lock - lock out any changes to cpuset structures
2208 * The out of memory (oom) code needs to mutex_lock cpusets
2209 * from being changed while it scans the tasklist looking for a
2210 * task in an overlapping cpuset. Expose callback_mutex via this
2211 * cpuset_lock() routine, so the oom code can lock it, before
2212 * locking the task list. The tasklist_lock is a spinlock, so
2213 * must be taken inside callback_mutex.
2216 void cpuset_lock(void)
2218 mutex_lock(&callback_mutex);
2222 * cpuset_unlock - release lock on cpuset changes
2224 * Undo the lock taken in a previous cpuset_lock() call.
2227 void cpuset_unlock(void)
2229 mutex_unlock(&callback_mutex);
2233 * cpuset_mem_spread_node() - On which node to begin search for a page
2235 * If a task is marked PF_SPREAD_PAGE or PF_SPREAD_SLAB (as for
2236 * tasks in a cpuset with is_spread_page or is_spread_slab set),
2237 * and if the memory allocation used cpuset_mem_spread_node()
2238 * to determine on which node to start looking, as it will for
2239 * certain page cache or slab cache pages such as used for file
2240 * system buffers and inode caches, then instead of starting on the
2241 * local node to look for a free page, rather spread the starting
2242 * node around the tasks mems_allowed nodes.
2244 * We don't have to worry about the returned node being offline
2245 * because "it can't happen", and even if it did, it would be ok.
2247 * The routines calling guarantee_online_mems() are careful to
2248 * only set nodes in task->mems_allowed that are online. So it
2249 * should not be possible for the following code to return an
2250 * offline node. But if it did, that would be ok, as this routine
2251 * is not returning the node where the allocation must be, only
2252 * the node where the search should start. The zonelist passed to
2253 * __alloc_pages() will include all nodes. If the slab allocator
2254 * is passed an offline node, it will fall back to the local node.
2255 * See kmem_cache_alloc_node().
2258 int cpuset_mem_spread_node(void)
2262 node = next_node(current->cpuset_mem_spread_rotor, current->mems_allowed);
2263 if (node == MAX_NUMNODES)
2264 node = first_node(current->mems_allowed);
2265 current->cpuset_mem_spread_rotor = node;
2268 EXPORT_SYMBOL_GPL(cpuset_mem_spread_node);
2271 * cpuset_mems_allowed_intersects - Does @tsk1's mems_allowed intersect @tsk2's?
2272 * @tsk1: pointer to task_struct of some task.
2273 * @tsk2: pointer to task_struct of some other task.
2275 * Description: Return true if @tsk1's mems_allowed intersects the
2276 * mems_allowed of @tsk2. Used by the OOM killer to determine if
2277 * one of the task's memory usage might impact the memory available
2281 int cpuset_mems_allowed_intersects(const struct task_struct *tsk1,
2282 const struct task_struct *tsk2)
2284 return nodes_intersects(tsk1->mems_allowed, tsk2->mems_allowed);
2288 * Collection of memory_pressure is suppressed unless
2289 * this flag is enabled by writing "1" to the special
2290 * cpuset file 'memory_pressure_enabled' in the root cpuset.
2293 int cpuset_memory_pressure_enabled __read_mostly;
2296 * cpuset_memory_pressure_bump - keep stats of per-cpuset reclaims.
2298 * Keep a running average of the rate of synchronous (direct)
2299 * page reclaim efforts initiated by tasks in each cpuset.
2301 * This represents the rate at which some task in the cpuset
2302 * ran low on memory on all nodes it was allowed to use, and
2303 * had to enter the kernels page reclaim code in an effort to
2304 * create more free memory by tossing clean pages or swapping
2305 * or writing dirty pages.
2307 * Display to user space in the per-cpuset read-only file
2308 * "memory_pressure". Value displayed is an integer
2309 * representing the recent rate of entry into the synchronous
2310 * (direct) page reclaim by any task attached to the cpuset.
2313 void __cpuset_memory_pressure_bump(void)
2316 fmeter_markevent(&task_cs(current)->fmeter);
2317 task_unlock(current);
2320 #ifdef CONFIG_PROC_PID_CPUSET
2322 * proc_cpuset_show()
2323 * - Print tasks cpuset path into seq_file.
2324 * - Used for /proc/<pid>/cpuset.
2325 * - No need to task_lock(tsk) on this tsk->cpuset reference, as it
2326 * doesn't really matter if tsk->cpuset changes after we read it,
2327 * and we take cgroup_mutex, keeping cpuset_attach() from changing it
2330 static int proc_cpuset_show(struct seq_file *m, void *unused_v)
2333 struct task_struct *tsk;
2335 struct cgroup_subsys_state *css;
2339 buf = kmalloc(PAGE_SIZE, GFP_KERNEL);
2345 tsk = get_pid_task(pid, PIDTYPE_PID);
2351 css = task_subsys_state(tsk, cpuset_subsys_id);
2352 retval = cgroup_path(css->cgroup, buf, PAGE_SIZE);
2359 put_task_struct(tsk);
2366 static int cpuset_open(struct inode *inode, struct file *file)
2368 struct pid *pid = PROC_I(inode)->pid;
2369 return single_open(file, proc_cpuset_show, pid);
2372 const struct file_operations proc_cpuset_operations = {
2373 .open = cpuset_open,
2375 .llseek = seq_lseek,
2376 .release = single_release,
2378 #endif /* CONFIG_PROC_PID_CPUSET */
2380 /* Display task cpus_allowed, mems_allowed in /proc/<pid>/status file. */
2381 void cpuset_task_status_allowed(struct seq_file *m, struct task_struct *task)
2383 seq_printf(m, "Cpus_allowed:\t");
2384 m->count += cpumask_scnprintf(m->buf + m->count, m->size - m->count,
2385 task->cpus_allowed);
2386 seq_printf(m, "\n");
2387 seq_printf(m, "Cpus_allowed_list:\t");
2388 m->count += cpulist_scnprintf(m->buf + m->count, m->size - m->count,
2389 task->cpus_allowed);
2390 seq_printf(m, "\n");
2391 seq_printf(m, "Mems_allowed:\t");
2392 m->count += nodemask_scnprintf(m->buf + m->count, m->size - m->count,
2393 task->mems_allowed);
2394 seq_printf(m, "\n");
2395 seq_printf(m, "Mems_allowed_list:\t");
2396 m->count += nodelist_scnprintf(m->buf + m->count, m->size - m->count,
2397 task->mems_allowed);
2398 seq_printf(m, "\n");