2005-04-16 22:20:36 +00:00
|
|
|
/* CPU control.
|
|
|
|
* (C) 2001, 2002, 2003, 2004 Rusty Russell
|
|
|
|
*
|
|
|
|
* This code is licenced under the GPL.
|
|
|
|
*/
|
|
|
|
#include <linux/proc_fs.h>
|
|
|
|
#include <linux/smp.h>
|
|
|
|
#include <linux/init.h>
|
|
|
|
#include <linux/notifier.h>
|
2017-02-08 17:51:30 +00:00
|
|
|
#include <linux/sched/signal.h>
|
2017-02-08 17:51:36 +00:00
|
|
|
#include <linux/sched/hotplug.h>
|
2017-02-08 17:51:36 +00:00
|
|
|
#include <linux/sched/task.h>
|
2005-04-16 22:20:36 +00:00
|
|
|
#include <linux/unistd.h>
|
|
|
|
#include <linux/cpu.h>
|
cpu: introduce clear_tasks_mm_cpumask() helper
Many architectures clear tasks' mm_cpumask like this:
read_lock(&tasklist_lock);
for_each_process(p) {
if (p->mm)
cpumask_clear_cpu(cpu, mm_cpumask(p->mm));
}
read_unlock(&tasklist_lock);
Depending on the context, the code above may have several problems,
such as:
1. Working with task->mm w/o getting mm or grabing the task lock is
dangerous as ->mm might disappear (exit_mm() assigns NULL under
task_lock(), so tasklist lock is not enough).
2. Checking for process->mm is not enough because process' main
thread may exit or detach its mm via use_mm(), but other threads
may still have a valid mm.
This patch implements a small helper function that does things
correctly, i.e.:
1. We take the task's lock while whe handle its mm (we can't use
get_task_mm()/mmput() pair as mmput() might sleep);
2. To catch exited main thread case, we use find_lock_task_mm(),
which walks up all threads and returns an appropriate task
(with task lock held).
Also, Per Peter Zijlstra's idea, now we don't grab tasklist_lock in
the new helper, instead we take the rcu read lock. We can do this
because the function is called after the cpu is taken down and marked
offline, so no new tasks will get this cpu set in their mm mask.
Signed-off-by: Anton Vorontsov <anton.vorontsov@linaro.org>
Cc: Richard Weinberger <richard@nod.at>
Cc: Oleg Nesterov <oleg@redhat.com>
Cc: Peter Zijlstra <a.p.zijlstra@chello.nl>
Cc: Russell King <rmk@arm.linux.org.uk>
Cc: Benjamin Herrenschmidt <benh@kernel.crashing.org>
Cc: Mike Frysinger <vapier@gentoo.org>
Cc: Paul Mundt <lethal@linux-sh.org>
Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
2012-05-31 23:26:22 +00:00
|
|
|
#include <linux/oom.h>
|
|
|
|
#include <linux/rcupdate.h>
|
2011-05-23 18:51:41 +00:00
|
|
|
#include <linux/export.h>
|
2012-05-31 23:26:26 +00:00
|
|
|
#include <linux/bug.h>
|
2005-04-16 22:20:36 +00:00
|
|
|
#include <linux/kthread.h>
|
|
|
|
#include <linux/stop_machine.h>
|
2006-06-26 07:24:32 +00:00
|
|
|
#include <linux/mutex.h>
|
include cleanup: Update gfp.h and slab.h includes to prepare for breaking implicit slab.h inclusion from percpu.h
percpu.h is included by sched.h and module.h and thus ends up being
included when building most .c files. percpu.h includes slab.h which
in turn includes gfp.h making everything defined by the two files
universally available and complicating inclusion dependencies.
percpu.h -> slab.h dependency is about to be removed. Prepare for
this change by updating users of gfp and slab facilities include those
headers directly instead of assuming availability. As this conversion
needs to touch large number of source files, the following script is
used as the basis of conversion.
http://userweb.kernel.org/~tj/misc/slabh-sweep.py
The script does the followings.
* Scan files for gfp and slab usages and update includes such that
only the necessary includes are there. ie. if only gfp is used,
gfp.h, if slab is used, slab.h.
* When the script inserts a new include, it looks at the include
blocks and try to put the new include such that its order conforms
to its surrounding. It's put in the include block which contains
core kernel includes, in the same order that the rest are ordered -
alphabetical, Christmas tree, rev-Xmas-tree or at the end if there
doesn't seem to be any matching order.
* If the script can't find a place to put a new include (mostly
because the file doesn't have fitting include block), it prints out
an error message indicating which .h file needs to be added to the
file.
The conversion was done in the following steps.
1. The initial automatic conversion of all .c files updated slightly
over 4000 files, deleting around 700 includes and adding ~480 gfp.h
and ~3000 slab.h inclusions. The script emitted errors for ~400
files.
2. Each error was manually checked. Some didn't need the inclusion,
some needed manual addition while adding it to implementation .h or
embedding .c file was more appropriate for others. This step added
inclusions to around 150 files.
3. The script was run again and the output was compared to the edits
from #2 to make sure no file was left behind.
4. Several build tests were done and a couple of problems were fixed.
e.g. lib/decompress_*.c used malloc/free() wrappers around slab
APIs requiring slab.h to be added manually.
5. The script was run on all .h files but without automatically
editing them as sprinkling gfp.h and slab.h inclusions around .h
files could easily lead to inclusion dependency hell. Most gfp.h
inclusion directives were ignored as stuff from gfp.h was usually
wildly available and often used in preprocessor macros. Each
slab.h inclusion directive was examined and added manually as
necessary.
6. percpu.h was updated not to include slab.h.
7. Build test were done on the following configurations and failures
were fixed. CONFIG_GCOV_KERNEL was turned off for all tests (as my
distributed build env didn't work with gcov compiles) and a few
more options had to be turned off depending on archs to make things
build (like ipr on powerpc/64 which failed due to missing writeq).
* x86 and x86_64 UP and SMP allmodconfig and a custom test config.
* powerpc and powerpc64 SMP allmodconfig
* sparc and sparc64 SMP allmodconfig
* ia64 SMP allmodconfig
* s390 SMP allmodconfig
* alpha SMP allmodconfig
* um on x86_64 SMP allmodconfig
8. percpu.h modifications were reverted so that it could be applied as
a separate patch and serve as bisection point.
Given the fact that I had only a couple of failures from tests on step
6, I'm fairly confident about the coverage of this conversion patch.
If there is a breakage, it's likely to be something in one of the arch
headers which should be easily discoverable easily on most builds of
the specific arch.
Signed-off-by: Tejun Heo <tj@kernel.org>
Guess-its-ok-by: Christoph Lameter <cl@linux-foundation.org>
Cc: Ingo Molnar <mingo@redhat.com>
Cc: Lee Schermerhorn <Lee.Schermerhorn@hp.com>
2010-03-24 08:04:11 +00:00
|
|
|
#include <linux/gfp.h>
|
2011-11-02 23:59:25 +00:00
|
|
|
#include <linux/suspend.h>
|
2014-03-10 20:34:03 +00:00
|
|
|
#include <linux/lockdep.h>
|
2015-03-30 09:29:19 +00:00
|
|
|
#include <linux/tick.h>
|
2015-07-05 17:12:30 +00:00
|
|
|
#include <linux/irq.h>
|
2017-09-12 19:37:04 +00:00
|
|
|
#include <linux/nmi.h>
|
2016-02-26 18:43:38 +00:00
|
|
|
#include <linux/smpboot.h>
|
2016-08-18 12:57:17 +00:00
|
|
|
#include <linux/relay.h>
|
2016-08-23 12:53:19 +00:00
|
|
|
#include <linux/slab.h>
|
2017-05-24 08:15:40 +00:00
|
|
|
#include <linux/percpu-rwsem.h>
|
2016-02-26 18:43:28 +00:00
|
|
|
|
2014-06-06 12:40:17 +00:00
|
|
|
#include <trace/events/power.h>
|
2016-02-26 18:43:28 +00:00
|
|
|
#define CREATE_TRACE_POINTS
|
|
|
|
#include <trace/events/cpuhp.h>
|
2005-04-16 22:20:36 +00:00
|
|
|
|
2012-04-20 13:05:44 +00:00
|
|
|
#include "smpboot.h"
|
|
|
|
|
2016-02-26 18:43:28 +00:00
|
|
|
/**
|
|
|
|
* cpuhp_cpu_state - Per cpu hotplug state storage
|
|
|
|
* @state: The current cpu state
|
|
|
|
* @target: The target state
|
2016-02-26 18:43:38 +00:00
|
|
|
* @thread: Pointer to the hotplug thread
|
|
|
|
* @should_run: Thread should execute
|
2016-04-08 12:40:15 +00:00
|
|
|
* @rollback: Perform a rollback
|
2016-08-12 17:49:38 +00:00
|
|
|
* @single: Single callback invocation
|
|
|
|
* @bringup: Single callback bringup or teardown selector
|
|
|
|
* @cb_state: The state for a single callback (install/uninstall)
|
2016-02-26 18:43:38 +00:00
|
|
|
* @result: Result of the operation
|
2017-09-20 17:00:19 +00:00
|
|
|
* @done_up: Signal completion to the issuer of the task for cpu-up
|
|
|
|
* @done_down: Signal completion to the issuer of the task for cpu-down
|
2016-02-26 18:43:28 +00:00
|
|
|
*/
|
|
|
|
struct cpuhp_cpu_state {
|
|
|
|
enum cpuhp_state state;
|
|
|
|
enum cpuhp_state target;
|
2017-09-20 17:00:21 +00:00
|
|
|
enum cpuhp_state fail;
|
2016-02-26 18:43:38 +00:00
|
|
|
#ifdef CONFIG_SMP
|
|
|
|
struct task_struct *thread;
|
|
|
|
bool should_run;
|
2016-04-08 12:40:15 +00:00
|
|
|
bool rollback;
|
2016-08-12 17:49:38 +00:00
|
|
|
bool single;
|
|
|
|
bool bringup;
|
2016-08-12 17:49:39 +00:00
|
|
|
struct hlist_node *node;
|
2017-09-20 17:00:17 +00:00
|
|
|
struct hlist_node *last;
|
2016-02-26 18:43:38 +00:00
|
|
|
enum cpuhp_state cb_state;
|
|
|
|
int result;
|
2017-09-20 17:00:19 +00:00
|
|
|
struct completion done_up;
|
|
|
|
struct completion done_down;
|
2016-02-26 18:43:38 +00:00
|
|
|
#endif
|
2016-02-26 18:43:28 +00:00
|
|
|
};
|
|
|
|
|
2017-09-20 17:00:21 +00:00
|
|
|
static DEFINE_PER_CPU(struct cpuhp_cpu_state, cpuhp_state) = {
|
|
|
|
.fail = CPUHP_INVALID,
|
|
|
|
};
|
2016-02-26 18:43:28 +00:00
|
|
|
|
2017-05-24 08:15:43 +00:00
|
|
|
#if defined(CONFIG_LOCKDEP) && defined(CONFIG_SMP)
|
2017-09-20 17:00:20 +00:00
|
|
|
static struct lockdep_map cpuhp_state_up_map =
|
|
|
|
STATIC_LOCKDEP_MAP_INIT("cpuhp_state-up", &cpuhp_state_up_map);
|
|
|
|
static struct lockdep_map cpuhp_state_down_map =
|
|
|
|
STATIC_LOCKDEP_MAP_INIT("cpuhp_state-down", &cpuhp_state_down_map);
|
|
|
|
|
|
|
|
|
2017-12-26 14:08:53 +00:00
|
|
|
static inline void cpuhp_lock_acquire(bool bringup)
|
2017-09-20 17:00:20 +00:00
|
|
|
{
|
|
|
|
lock_map_acquire(bringup ? &cpuhp_state_up_map : &cpuhp_state_down_map);
|
|
|
|
}
|
|
|
|
|
2017-12-26 14:08:53 +00:00
|
|
|
static inline void cpuhp_lock_release(bool bringup)
|
2017-09-20 17:00:20 +00:00
|
|
|
{
|
|
|
|
lock_map_release(bringup ? &cpuhp_state_up_map : &cpuhp_state_down_map);
|
|
|
|
}
|
|
|
|
#else
|
|
|
|
|
2017-12-26 14:08:53 +00:00
|
|
|
static inline void cpuhp_lock_acquire(bool bringup) { }
|
|
|
|
static inline void cpuhp_lock_release(bool bringup) { }
|
2017-09-20 17:00:20 +00:00
|
|
|
|
2017-05-24 08:15:43 +00:00
|
|
|
#endif
|
|
|
|
|
2016-02-26 18:43:28 +00:00
|
|
|
/**
|
|
|
|
* cpuhp_step - Hotplug state machine step
|
|
|
|
* @name: Name of the step
|
|
|
|
* @startup: Startup function of the step
|
|
|
|
* @teardown: Teardown function of the step
|
|
|
|
* @skip_onerr: Do not invoke the functions on error rollback
|
|
|
|
* Will go away once the notifiers are gone
|
2016-02-26 18:43:32 +00:00
|
|
|
* @cant_stop: Bringup/teardown can't be stopped at this step
|
2016-02-26 18:43:28 +00:00
|
|
|
*/
|
|
|
|
struct cpuhp_step {
|
2016-08-12 17:49:39 +00:00
|
|
|
const char *name;
|
|
|
|
union {
|
2016-09-05 13:28:36 +00:00
|
|
|
int (*single)(unsigned int cpu);
|
|
|
|
int (*multi)(unsigned int cpu,
|
|
|
|
struct hlist_node *node);
|
|
|
|
} startup;
|
2016-08-12 17:49:39 +00:00
|
|
|
union {
|
2016-09-05 13:28:36 +00:00
|
|
|
int (*single)(unsigned int cpu);
|
|
|
|
int (*multi)(unsigned int cpu,
|
|
|
|
struct hlist_node *node);
|
|
|
|
} teardown;
|
2016-08-12 17:49:39 +00:00
|
|
|
struct hlist_head list;
|
|
|
|
bool skip_onerr;
|
|
|
|
bool cant_stop;
|
|
|
|
bool multi_instance;
|
2016-02-26 18:43:28 +00:00
|
|
|
};
|
|
|
|
|
2016-02-26 18:43:31 +00:00
|
|
|
static DEFINE_MUTEX(cpuhp_state_mutex);
|
2016-02-26 18:43:28 +00:00
|
|
|
static struct cpuhp_step cpuhp_bp_states[];
|
2016-02-26 18:43:29 +00:00
|
|
|
static struct cpuhp_step cpuhp_ap_states[];
|
2016-02-26 18:43:28 +00:00
|
|
|
|
2016-08-12 17:49:38 +00:00
|
|
|
static bool cpuhp_is_ap_state(enum cpuhp_state state)
|
|
|
|
{
|
|
|
|
/*
|
|
|
|
* The extra check for CPUHP_TEARDOWN_CPU is only for documentation
|
|
|
|
* purposes as that state is handled explicitly in cpu_down.
|
|
|
|
*/
|
|
|
|
return state > CPUHP_BRINGUP_CPU && state != CPUHP_TEARDOWN_CPU;
|
|
|
|
}
|
|
|
|
|
|
|
|
static struct cpuhp_step *cpuhp_get_step(enum cpuhp_state state)
|
|
|
|
{
|
|
|
|
struct cpuhp_step *sp;
|
|
|
|
|
|
|
|
sp = cpuhp_is_ap_state(state) ? cpuhp_ap_states : cpuhp_bp_states;
|
|
|
|
return sp + state;
|
|
|
|
}
|
|
|
|
|
2016-02-26 18:43:28 +00:00
|
|
|
/**
|
|
|
|
* cpuhp_invoke_callback _ Invoke the callbacks for a given state
|
|
|
|
* @cpu: The cpu for which the callback should be invoked
|
2017-09-20 17:00:16 +00:00
|
|
|
* @state: The state to do callbacks for
|
2016-08-12 17:49:38 +00:00
|
|
|
* @bringup: True if the bringup callback should be invoked
|
2017-09-20 17:00:16 +00:00
|
|
|
* @node: For multi-instance, do a single entry callback for install/remove
|
|
|
|
* @lastp: For multi-instance rollback, remember how far we got
|
2016-02-26 18:43:28 +00:00
|
|
|
*
|
2016-08-12 17:49:39 +00:00
|
|
|
* Called from cpu hotplug and from the state register machinery.
|
2016-02-26 18:43:28 +00:00
|
|
|
*/
|
2016-08-12 17:49:38 +00:00
|
|
|
static int cpuhp_invoke_callback(unsigned int cpu, enum cpuhp_state state,
|
2017-09-20 17:00:16 +00:00
|
|
|
bool bringup, struct hlist_node *node,
|
|
|
|
struct hlist_node **lastp)
|
2016-02-26 18:43:28 +00:00
|
|
|
{
|
|
|
|
struct cpuhp_cpu_state *st = per_cpu_ptr(&cpuhp_state, cpu);
|
2016-08-12 17:49:38 +00:00
|
|
|
struct cpuhp_step *step = cpuhp_get_step(state);
|
2016-08-12 17:49:39 +00:00
|
|
|
int (*cbm)(unsigned int cpu, struct hlist_node *node);
|
|
|
|
int (*cb)(unsigned int cpu);
|
|
|
|
int ret, cnt;
|
|
|
|
|
2017-09-20 17:00:21 +00:00
|
|
|
if (st->fail == state) {
|
|
|
|
st->fail = CPUHP_INVALID;
|
|
|
|
|
|
|
|
if (!(bringup ? step->startup.single : step->teardown.single))
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
return -EAGAIN;
|
|
|
|
}
|
|
|
|
|
2016-08-12 17:49:39 +00:00
|
|
|
if (!step->multi_instance) {
|
2017-09-20 17:00:16 +00:00
|
|
|
WARN_ON_ONCE(lastp && *lastp);
|
2016-09-05 13:28:36 +00:00
|
|
|
cb = bringup ? step->startup.single : step->teardown.single;
|
2016-08-12 17:49:39 +00:00
|
|
|
if (!cb)
|
|
|
|
return 0;
|
2016-08-12 17:49:38 +00:00
|
|
|
trace_cpuhp_enter(cpu, st->target, state, cb);
|
2016-02-26 18:43:28 +00:00
|
|
|
ret = cb(cpu);
|
2016-08-12 17:49:38 +00:00
|
|
|
trace_cpuhp_exit(cpu, st->state, state, ret);
|
2016-08-12 17:49:39 +00:00
|
|
|
return ret;
|
|
|
|
}
|
2016-09-05 13:28:36 +00:00
|
|
|
cbm = bringup ? step->startup.multi : step->teardown.multi;
|
2016-08-12 17:49:39 +00:00
|
|
|
if (!cbm)
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
/* Single invocation for instance add/remove */
|
|
|
|
if (node) {
|
2017-09-20 17:00:16 +00:00
|
|
|
WARN_ON_ONCE(lastp && *lastp);
|
2016-08-12 17:49:39 +00:00
|
|
|
trace_cpuhp_multi_enter(cpu, st->target, state, cbm, node);
|
|
|
|
ret = cbm(cpu, node);
|
|
|
|
trace_cpuhp_exit(cpu, st->state, state, ret);
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* State transition. Invoke on all instances */
|
|
|
|
cnt = 0;
|
|
|
|
hlist_for_each(node, &step->list) {
|
2017-09-20 17:00:16 +00:00
|
|
|
if (lastp && node == *lastp)
|
|
|
|
break;
|
|
|
|
|
2016-08-12 17:49:39 +00:00
|
|
|
trace_cpuhp_multi_enter(cpu, st->target, state, cbm, node);
|
|
|
|
ret = cbm(cpu, node);
|
|
|
|
trace_cpuhp_exit(cpu, st->state, state, ret);
|
2017-09-20 17:00:16 +00:00
|
|
|
if (ret) {
|
|
|
|
if (!lastp)
|
|
|
|
goto err;
|
|
|
|
|
|
|
|
*lastp = node;
|
|
|
|
return ret;
|
|
|
|
}
|
2016-08-12 17:49:39 +00:00
|
|
|
cnt++;
|
|
|
|
}
|
2017-09-20 17:00:16 +00:00
|
|
|
if (lastp)
|
|
|
|
*lastp = NULL;
|
2016-08-12 17:49:39 +00:00
|
|
|
return 0;
|
|
|
|
err:
|
|
|
|
/* Rollback the instances if one failed */
|
2016-09-05 13:28:36 +00:00
|
|
|
cbm = !bringup ? step->startup.multi : step->teardown.multi;
|
2016-08-12 17:49:39 +00:00
|
|
|
if (!cbm)
|
|
|
|
return ret;
|
|
|
|
|
|
|
|
hlist_for_each(node, &step->list) {
|
|
|
|
if (!cnt--)
|
|
|
|
break;
|
2017-09-20 17:00:18 +00:00
|
|
|
|
|
|
|
trace_cpuhp_multi_enter(cpu, st->target, state, cbm, node);
|
|
|
|
ret = cbm(cpu, node);
|
|
|
|
trace_cpuhp_exit(cpu, st->state, state, ret);
|
|
|
|
/*
|
|
|
|
* Rollback must not fail,
|
|
|
|
*/
|
|
|
|
WARN_ON_ONCE(ret);
|
2016-02-26 18:43:28 +00:00
|
|
|
}
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
2008-12-13 10:49:41 +00:00
|
|
|
#ifdef CONFIG_SMP
|
2017-09-20 17:00:19 +00:00
|
|
|
static inline void wait_for_ap_thread(struct cpuhp_cpu_state *st, bool bringup)
|
|
|
|
{
|
|
|
|
struct completion *done = bringup ? &st->done_up : &st->done_down;
|
|
|
|
wait_for_completion(done);
|
|
|
|
}
|
|
|
|
|
|
|
|
static inline void complete_ap_thread(struct cpuhp_cpu_state *st, bool bringup)
|
|
|
|
{
|
|
|
|
struct completion *done = bringup ? &st->done_up : &st->done_down;
|
|
|
|
complete(done);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* The former STARTING/DYING states, ran with IRQs disabled and must not fail.
|
|
|
|
*/
|
|
|
|
static bool cpuhp_is_atomic_state(enum cpuhp_state state)
|
|
|
|
{
|
|
|
|
return CPUHP_AP_IDLE_DEAD <= state && state < CPUHP_AP_ONLINE;
|
|
|
|
}
|
|
|
|
|
2008-12-29 22:35:14 +00:00
|
|
|
/* Serializes the updates to cpu_online_mask, cpu_present_mask */
|
2006-07-23 19:12:16 +00:00
|
|
|
static DEFINE_MUTEX(cpu_add_remove_lock);
|
2016-02-26 18:43:23 +00:00
|
|
|
bool cpuhp_tasks_frozen;
|
|
|
|
EXPORT_SYMBOL_GPL(cpuhp_tasks_frozen);
|
2005-04-16 22:20:36 +00:00
|
|
|
|
2010-05-26 21:43:36 +00:00
|
|
|
/*
|
CPU hotplug: Provide lockless versions of callback registration functions
The following method of CPU hotplug callback registration is not safe
due to the possibility of an ABBA deadlock involving the cpu_add_remove_lock
and the cpu_hotplug.lock.
get_online_cpus();
for_each_online_cpu(cpu)
init_cpu(cpu);
register_cpu_notifier(&foobar_cpu_notifier);
put_online_cpus();
The deadlock is shown below:
CPU 0 CPU 1
----- -----
Acquire cpu_hotplug.lock
[via get_online_cpus()]
CPU online/offline operation
takes cpu_add_remove_lock
[via cpu_maps_update_begin()]
Try to acquire
cpu_add_remove_lock
[via register_cpu_notifier()]
CPU online/offline operation
tries to acquire cpu_hotplug.lock
[via cpu_hotplug_begin()]
*** DEADLOCK! ***
The problem here is that callback registration takes the locks in one order
whereas the CPU hotplug operations take the same locks in the opposite order.
To avoid this issue and to provide a race-free method to register CPU hotplug
callbacks (along with initialization of already online CPUs), introduce new
variants of the callback registration APIs that simply register the callbacks
without holding the cpu_add_remove_lock during the registration. That way,
we can avoid the ABBA scenario. However, we will need to hold the
cpu_add_remove_lock throughout the entire critical section, to protect updates
to the callback/notifier chain.
This can be achieved by writing the callback registration code as follows:
cpu_maps_update_begin(); [ or cpu_notifier_register_begin(); see below ]
for_each_online_cpu(cpu)
init_cpu(cpu);
/* This doesn't take the cpu_add_remove_lock */
__register_cpu_notifier(&foobar_cpu_notifier);
cpu_maps_update_done(); [ or cpu_notifier_register_done(); see below ]
Note that we can't use get_online_cpus() here instead of cpu_maps_update_begin()
because the cpu_hotplug.lock is dropped during the invocation of CPU_POST_DEAD
notifiers, and hence get_online_cpus() cannot provide the necessary
synchronization to protect the callback/notifier chains against concurrent
reads and writes. On the other hand, since the cpu_add_remove_lock protects
the entire hotplug operation (including CPU_POST_DEAD), we can use
cpu_maps_update_begin/done() to guarantee proper synchronization.
Also, since cpu_maps_update_begin/done() is like a super-set of
get/put_online_cpus(), the former naturally protects the critical sections
from concurrent hotplug operations.
Since the names cpu_maps_update_begin/done() don't make much sense in CPU
hotplug callback registration scenarios, we'll introduce new APIs named
cpu_notifier_register_begin/done() and map them to cpu_maps_update_begin/done().
In summary, introduce the lockless variants of un/register_cpu_notifier() and
also export the cpu_notifier_register_begin/done() APIs for use by modules.
This way, we provide a race-free way to register hotplug callbacks as well as
perform initialization for the CPUs that are already online.
Cc: Thomas Gleixner <tglx@linutronix.de>
Cc: Andrew Morton <akpm@linux-foundation.org>
Cc: Peter Zijlstra <peterz@infradead.org>
Cc: Ingo Molnar <mingo@kernel.org>
Acked-by: Oleg Nesterov <oleg@redhat.com>
Acked-by: Toshi Kani <toshi.kani@hp.com>
Reviewed-by: Gautham R. Shenoy <ego@linux.vnet.ibm.com>
Signed-off-by: Srivatsa S. Bhat <srivatsa.bhat@linux.vnet.ibm.com>
Signed-off-by: Rafael J. Wysocki <rafael.j.wysocki@intel.com>
2014-03-10 20:34:14 +00:00
|
|
|
* The following two APIs (cpu_maps_update_begin/done) must be used when
|
|
|
|
* attempting to serialize the updates to cpu_online_mask & cpu_present_mask.
|
2010-05-26 21:43:36 +00:00
|
|
|
*/
|
|
|
|
void cpu_maps_update_begin(void)
|
|
|
|
{
|
|
|
|
mutex_lock(&cpu_add_remove_lock);
|
|
|
|
}
|
|
|
|
|
|
|
|
void cpu_maps_update_done(void)
|
|
|
|
{
|
|
|
|
mutex_unlock(&cpu_add_remove_lock);
|
|
|
|
}
|
2005-04-16 22:20:36 +00:00
|
|
|
|
2017-05-24 08:15:40 +00:00
|
|
|
/*
|
|
|
|
* If set, cpu_up and cpu_down will return -EBUSY and do nothing.
|
2006-09-26 06:32:48 +00:00
|
|
|
* Should always be manipulated under cpu_add_remove_lock
|
|
|
|
*/
|
|
|
|
static int cpu_hotplug_disabled;
|
|
|
|
|
2010-05-26 21:43:36 +00:00
|
|
|
#ifdef CONFIG_HOTPLUG_CPU
|
|
|
|
|
2017-05-24 08:15:40 +00:00
|
|
|
DEFINE_STATIC_PERCPU_RWSEM(cpu_hotplug_lock);
|
2014-03-10 20:34:03 +00:00
|
|
|
|
2017-05-24 08:15:12 +00:00
|
|
|
void cpus_read_lock(void)
|
2005-11-28 21:43:46 +00:00
|
|
|
{
|
2017-05-24 08:15:40 +00:00
|
|
|
percpu_down_read(&cpu_hotplug_lock);
|
2005-11-28 21:43:46 +00:00
|
|
|
}
|
2017-05-24 08:15:12 +00:00
|
|
|
EXPORT_SYMBOL_GPL(cpus_read_lock);
|
2005-11-09 05:34:24 +00:00
|
|
|
|
2017-05-24 08:15:12 +00:00
|
|
|
void cpus_read_unlock(void)
|
2005-11-28 21:43:46 +00:00
|
|
|
{
|
2017-05-24 08:15:40 +00:00
|
|
|
percpu_up_read(&cpu_hotplug_lock);
|
2005-11-28 21:43:46 +00:00
|
|
|
}
|
2017-05-24 08:15:12 +00:00
|
|
|
EXPORT_SYMBOL_GPL(cpus_read_unlock);
|
2005-11-28 21:43:46 +00:00
|
|
|
|
2017-05-24 08:15:12 +00:00
|
|
|
void cpus_write_lock(void)
|
2008-01-25 20:08:01 +00:00
|
|
|
{
|
2017-05-24 08:15:40 +00:00
|
|
|
percpu_down_write(&cpu_hotplug_lock);
|
2008-01-25 20:08:01 +00:00
|
|
|
}
|
2014-12-12 09:11:44 +00:00
|
|
|
|
2017-05-24 08:15:12 +00:00
|
|
|
void cpus_write_unlock(void)
|
2008-01-25 20:08:01 +00:00
|
|
|
{
|
2017-05-24 08:15:40 +00:00
|
|
|
percpu_up_write(&cpu_hotplug_lock);
|
2008-01-25 20:08:01 +00:00
|
|
|
}
|
|
|
|
|
2017-05-24 08:15:40 +00:00
|
|
|
void lockdep_assert_cpus_held(void)
|
2008-01-25 20:08:01 +00:00
|
|
|
{
|
2017-05-24 08:15:40 +00:00
|
|
|
percpu_rwsem_assert_held(&cpu_hotplug_lock);
|
2008-01-25 20:08:01 +00:00
|
|
|
}
|
2010-05-26 21:43:36 +00:00
|
|
|
|
2013-06-12 21:04:36 +00:00
|
|
|
/*
|
|
|
|
* Wait for currently running CPU hotplug operations to complete (if any) and
|
|
|
|
* disable future CPU hotplug (from sysfs). The 'cpu_add_remove_lock' protects
|
|
|
|
* the 'cpu_hotplug_disabled' flag. The same lock is also acquired by the
|
|
|
|
* hotplug path before performing hotplug operations. So acquiring that lock
|
|
|
|
* guarantees mutual exclusion from any currently running hotplug operations.
|
|
|
|
*/
|
|
|
|
void cpu_hotplug_disable(void)
|
|
|
|
{
|
|
|
|
cpu_maps_update_begin();
|
2015-08-05 07:52:46 +00:00
|
|
|
cpu_hotplug_disabled++;
|
2013-06-12 21:04:36 +00:00
|
|
|
cpu_maps_update_done();
|
|
|
|
}
|
2015-08-05 07:52:47 +00:00
|
|
|
EXPORT_SYMBOL_GPL(cpu_hotplug_disable);
|
2013-06-12 21:04:36 +00:00
|
|
|
|
2016-06-10 06:43:28 +00:00
|
|
|
static void __cpu_hotplug_enable(void)
|
|
|
|
{
|
|
|
|
if (WARN_ONCE(!cpu_hotplug_disabled, "Unbalanced cpu hotplug enable\n"))
|
|
|
|
return;
|
|
|
|
cpu_hotplug_disabled--;
|
|
|
|
}
|
|
|
|
|
2013-06-12 21:04:36 +00:00
|
|
|
void cpu_hotplug_enable(void)
|
|
|
|
{
|
|
|
|
cpu_maps_update_begin();
|
2016-06-10 06:43:28 +00:00
|
|
|
__cpu_hotplug_enable();
|
2013-06-12 21:04:36 +00:00
|
|
|
cpu_maps_update_done();
|
|
|
|
}
|
2015-08-05 07:52:47 +00:00
|
|
|
EXPORT_SYMBOL_GPL(cpu_hotplug_enable);
|
ACPI / processor: Acquire writer lock to update CPU maps
CPU system maps are protected with reader/writer locks. The reader
lock, get_online_cpus(), assures that the maps are not updated while
holding the lock. The writer lock, cpu_hotplug_begin(), is used to
udpate the cpu maps along with cpu_maps_update_begin().
However, the ACPI processor handler updates the cpu maps without
holding the the writer lock.
acpi_map_lsapic() is called from acpi_processor_hotadd_init() to
update cpu_possible_mask and cpu_present_mask. acpi_unmap_lsapic()
is called from acpi_processor_remove() to update cpu_possible_mask.
Currently, they are either unprotected or protected with the reader
lock, which is not correct.
For example, the get_online_cpus() below is supposed to assure that
cpu_possible_mask is not changed while the code is iterating with
for_each_possible_cpu().
get_online_cpus();
for_each_possible_cpu(cpu) {
:
}
put_online_cpus();
However, this lock has no protection with CPU hotplug since the ACPI
processor handler does not use the writer lock when it updates
cpu_possible_mask. The reader lock does not serialize within the
readers.
This patch protects them with the writer lock with cpu_hotplug_begin()
along with cpu_maps_update_begin(), which must be held before calling
cpu_hotplug_begin(). It also protects arch_register_cpu() /
arch_unregister_cpu(), which creates / deletes a sysfs cpu device
interface. For this purpose it changes cpu_hotplug_begin() and
cpu_hotplug_done() to global and exports them in cpu.h.
Signed-off-by: Toshi Kani <toshi.kani@hp.com>
Signed-off-by: Rafael J. Wysocki <rafael.j.wysocki@intel.com>
2013-08-12 15:45:53 +00:00
|
|
|
#endif /* CONFIG_HOTPLUG_CPU */
|
2010-05-26 21:43:36 +00:00
|
|
|
|
2017-09-20 17:00:17 +00:00
|
|
|
static inline enum cpuhp_state
|
|
|
|
cpuhp_set_state(struct cpuhp_cpu_state *st, enum cpuhp_state target)
|
|
|
|
{
|
|
|
|
enum cpuhp_state prev_state = st->state;
|
|
|
|
|
|
|
|
st->rollback = false;
|
|
|
|
st->last = NULL;
|
|
|
|
|
|
|
|
st->target = target;
|
|
|
|
st->single = false;
|
|
|
|
st->bringup = st->state < target;
|
|
|
|
|
|
|
|
return prev_state;
|
|
|
|
}
|
|
|
|
|
|
|
|
static inline void
|
|
|
|
cpuhp_reset_state(struct cpuhp_cpu_state *st, enum cpuhp_state prev_state)
|
|
|
|
{
|
|
|
|
st->rollback = true;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* If we have st->last we need to undo partial multi_instance of this
|
|
|
|
* state first. Otherwise start undo at the previous state.
|
|
|
|
*/
|
|
|
|
if (!st->last) {
|
|
|
|
if (st->bringup)
|
|
|
|
st->state--;
|
|
|
|
else
|
|
|
|
st->state++;
|
|
|
|
}
|
|
|
|
|
|
|
|
st->target = prev_state;
|
|
|
|
st->bringup = !st->bringup;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Regular hotplug invocation of the AP hotplug thread */
|
|
|
|
static void __cpuhp_kick_ap(struct cpuhp_cpu_state *st)
|
|
|
|
{
|
|
|
|
if (!st->single && st->state == st->target)
|
|
|
|
return;
|
|
|
|
|
|
|
|
st->result = 0;
|
|
|
|
/*
|
|
|
|
* Make sure the above stores are visible before should_run becomes
|
|
|
|
* true. Paired with the mb() above in cpuhp_thread_fun()
|
|
|
|
*/
|
|
|
|
smp_mb();
|
|
|
|
st->should_run = true;
|
|
|
|
wake_up_process(st->thread);
|
2017-09-20 17:00:19 +00:00
|
|
|
wait_for_ap_thread(st, st->bringup);
|
2017-09-20 17:00:17 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
static int cpuhp_kick_ap(struct cpuhp_cpu_state *st, enum cpuhp_state target)
|
|
|
|
{
|
|
|
|
enum cpuhp_state prev_state;
|
|
|
|
int ret;
|
|
|
|
|
|
|
|
prev_state = cpuhp_set_state(st, target);
|
|
|
|
__cpuhp_kick_ap(st);
|
|
|
|
if ((ret = st->result)) {
|
|
|
|
cpuhp_reset_state(st, prev_state);
|
|
|
|
__cpuhp_kick_ap(st);
|
|
|
|
}
|
|
|
|
|
|
|
|
return ret;
|
|
|
|
}
|
2017-07-04 20:20:23 +00:00
|
|
|
|
2016-02-26 18:43:41 +00:00
|
|
|
static int bringup_wait_for_ap(unsigned int cpu)
|
|
|
|
{
|
|
|
|
struct cpuhp_cpu_state *st = per_cpu_ptr(&cpuhp_state, cpu);
|
|
|
|
|
2017-07-04 20:20:23 +00:00
|
|
|
/* Wait for the CPU to reach CPUHP_AP_ONLINE_IDLE */
|
2017-09-20 17:00:19 +00:00
|
|
|
wait_for_ap_thread(st, true);
|
2017-07-11 20:06:24 +00:00
|
|
|
if (WARN_ON_ONCE((!cpu_online(cpu))))
|
|
|
|
return -ECANCELED;
|
2017-07-04 20:20:23 +00:00
|
|
|
|
|
|
|
/* Unpark the stopper thread and the hotplug thread of the target cpu */
|
|
|
|
stop_machine_unpark(cpu);
|
|
|
|
kthread_unpark(st->thread);
|
|
|
|
|
2017-09-20 17:00:17 +00:00
|
|
|
if (st->target <= CPUHP_AP_ONLINE_IDLE)
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
return cpuhp_kick_ap(st, st->target);
|
2016-02-26 18:43:41 +00:00
|
|
|
}
|
|
|
|
|
2016-02-26 18:43:24 +00:00
|
|
|
static int bringup_cpu(unsigned int cpu)
|
|
|
|
{
|
|
|
|
struct task_struct *idle = idle_thread_get(cpu);
|
|
|
|
int ret;
|
|
|
|
|
2016-08-03 17:22:28 +00:00
|
|
|
/*
|
|
|
|
* Some architectures have to walk the irq descriptors to
|
|
|
|
* setup the vector space for the cpu which comes online.
|
|
|
|
* Prevent irq alloc/free across the bringup.
|
|
|
|
*/
|
|
|
|
irq_lock_sparse();
|
|
|
|
|
2016-02-26 18:43:24 +00:00
|
|
|
/* Arch-specific enabling code. */
|
|
|
|
ret = __cpu_up(cpu, idle);
|
2016-08-03 17:22:28 +00:00
|
|
|
irq_unlock_sparse();
|
cpu/hotplug: Remove obsolete cpu hotplug register/unregister functions
hotcpu_notifier(), cpu_notifier(), __hotcpu_notifier(), __cpu_notifier(),
register_hotcpu_notifier(), register_cpu_notifier(),
__register_hotcpu_notifier(), __register_cpu_notifier(),
unregister_hotcpu_notifier(), unregister_cpu_notifier(),
__unregister_hotcpu_notifier(), __unregister_cpu_notifier()
are unused now. Remove them and all related code.
Remove also the now pointless cpu notifier error injection mechanism. The
states can be executed step by step and error rollback is the same as cpu
down, so any state transition can be tested w/o requiring the notifier
error injection.
Some CPU hotplug states are kept as they are (ab)used for hotplug state
tracking.
Signed-off-by: Sebastian Andrzej Siewior <bigeasy@linutronix.de>
Signed-off-by: Thomas Gleixner <tglx@linutronix.de>
Cc: Peter Zijlstra <peterz@infradead.org>
Cc: rt@linutronix.de
Link: http://lkml.kernel.org/r/20161221192112.005642358@linutronix.de
Signed-off-by: Thomas Gleixner <tglx@linutronix.de>
2016-12-21 19:19:53 +00:00
|
|
|
if (ret)
|
2016-02-26 18:43:24 +00:00
|
|
|
return ret;
|
2017-07-04 20:20:23 +00:00
|
|
|
return bringup_wait_for_ap(cpu);
|
2016-02-26 18:43:24 +00:00
|
|
|
}
|
|
|
|
|
2016-02-26 18:43:37 +00:00
|
|
|
/*
|
|
|
|
* Hotplug state machine related functions
|
|
|
|
*/
|
|
|
|
|
2016-08-12 17:49:38 +00:00
|
|
|
static void undo_cpu_up(unsigned int cpu, struct cpuhp_cpu_state *st)
|
2016-02-26 18:43:37 +00:00
|
|
|
{
|
|
|
|
for (st->state--; st->state > st->target; st->state--) {
|
2016-08-12 17:49:38 +00:00
|
|
|
struct cpuhp_step *step = cpuhp_get_step(st->state);
|
2016-02-26 18:43:37 +00:00
|
|
|
|
|
|
|
if (!step->skip_onerr)
|
2017-09-20 17:00:16 +00:00
|
|
|
cpuhp_invoke_callback(cpu, st->state, false, NULL, NULL);
|
2016-02-26 18:43:37 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
static int cpuhp_up_callbacks(unsigned int cpu, struct cpuhp_cpu_state *st,
|
2016-08-12 17:49:38 +00:00
|
|
|
enum cpuhp_state target)
|
2016-02-26 18:43:37 +00:00
|
|
|
{
|
|
|
|
enum cpuhp_state prev_state = st->state;
|
|
|
|
int ret = 0;
|
|
|
|
|
|
|
|
while (st->state < target) {
|
|
|
|
st->state++;
|
2017-09-20 17:00:16 +00:00
|
|
|
ret = cpuhp_invoke_callback(cpu, st->state, true, NULL, NULL);
|
2016-02-26 18:43:37 +00:00
|
|
|
if (ret) {
|
|
|
|
st->target = prev_state;
|
2016-08-12 17:49:38 +00:00
|
|
|
undo_cpu_up(cpu, st);
|
2016-02-26 18:43:37 +00:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
2016-02-26 18:43:38 +00:00
|
|
|
/*
|
|
|
|
* The cpu hotplug threads manage the bringup and teardown of the cpus
|
|
|
|
*/
|
|
|
|
static void cpuhp_create(unsigned int cpu)
|
|
|
|
{
|
|
|
|
struct cpuhp_cpu_state *st = per_cpu_ptr(&cpuhp_state, cpu);
|
|
|
|
|
2017-09-20 17:00:19 +00:00
|
|
|
init_completion(&st->done_up);
|
|
|
|
init_completion(&st->done_down);
|
2016-02-26 18:43:38 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
static int cpuhp_should_run(unsigned int cpu)
|
|
|
|
{
|
|
|
|
struct cpuhp_cpu_state *st = this_cpu_ptr(&cpuhp_state);
|
|
|
|
|
|
|
|
return st->should_run;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Execute teardown/startup callbacks on the plugged cpu. Also used to invoke
|
|
|
|
* callbacks when a state gets [un]installed at runtime.
|
2017-09-20 17:00:17 +00:00
|
|
|
*
|
|
|
|
* Each invocation of this function by the smpboot thread does a single AP
|
|
|
|
* state callback.
|
|
|
|
*
|
|
|
|
* It has 3 modes of operation:
|
|
|
|
* - single: runs st->cb_state
|
|
|
|
* - up: runs ++st->state, while st->state < st->target
|
|
|
|
* - down: runs st->state--, while st->state > st->target
|
|
|
|
*
|
|
|
|
* When complete or on error, should_run is cleared and the completion is fired.
|
2016-02-26 18:43:38 +00:00
|
|
|
*/
|
|
|
|
static void cpuhp_thread_fun(unsigned int cpu)
|
|
|
|
{
|
|
|
|
struct cpuhp_cpu_state *st = this_cpu_ptr(&cpuhp_state);
|
2017-09-20 17:00:17 +00:00
|
|
|
bool bringup = st->bringup;
|
|
|
|
enum cpuhp_state state;
|
2016-02-26 18:43:38 +00:00
|
|
|
|
|
|
|
/*
|
2017-09-20 17:00:17 +00:00
|
|
|
* ACQUIRE for the cpuhp_should_run() load of ->should_run. Ensures
|
|
|
|
* that if we see ->should_run we also see the rest of the state.
|
2016-02-26 18:43:38 +00:00
|
|
|
*/
|
|
|
|
smp_mb();
|
|
|
|
|
2017-09-20 17:00:17 +00:00
|
|
|
if (WARN_ON_ONCE(!st->should_run))
|
|
|
|
return;
|
2016-02-26 18:43:38 +00:00
|
|
|
|
2017-09-20 17:00:20 +00:00
|
|
|
cpuhp_lock_acquire(bringup);
|
2017-09-20 17:00:17 +00:00
|
|
|
|
2016-08-12 17:49:38 +00:00
|
|
|
if (st->single) {
|
2017-09-20 17:00:17 +00:00
|
|
|
state = st->cb_state;
|
|
|
|
st->should_run = false;
|
|
|
|
} else {
|
|
|
|
if (bringup) {
|
|
|
|
st->state++;
|
|
|
|
state = st->state;
|
|
|
|
st->should_run = (st->state < st->target);
|
|
|
|
WARN_ON_ONCE(st->state > st->target);
|
2016-02-26 18:43:38 +00:00
|
|
|
} else {
|
2017-09-20 17:00:17 +00:00
|
|
|
state = st->state;
|
|
|
|
st->state--;
|
|
|
|
st->should_run = (st->state > st->target);
|
|
|
|
WARN_ON_ONCE(st->state < st->target);
|
2016-02-26 18:43:38 +00:00
|
|
|
}
|
2017-09-20 17:00:17 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
WARN_ON_ONCE(!cpuhp_is_ap_state(state));
|
|
|
|
|
|
|
|
if (st->rollback) {
|
|
|
|
struct cpuhp_step *step = cpuhp_get_step(state);
|
|
|
|
if (step->skip_onerr)
|
|
|
|
goto next;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (cpuhp_is_atomic_state(state)) {
|
|
|
|
local_irq_disable();
|
|
|
|
st->result = cpuhp_invoke_callback(cpu, state, bringup, st->node, &st->last);
|
|
|
|
local_irq_enable();
|
2016-04-08 12:40:15 +00:00
|
|
|
|
2017-09-20 17:00:17 +00:00
|
|
|
/*
|
|
|
|
* STARTING/DYING must not fail!
|
|
|
|
*/
|
|
|
|
WARN_ON_ONCE(st->result);
|
2016-02-26 18:43:38 +00:00
|
|
|
} else {
|
2017-09-20 17:00:17 +00:00
|
|
|
st->result = cpuhp_invoke_callback(cpu, state, bringup, st->node, &st->last);
|
|
|
|
}
|
|
|
|
|
|
|
|
if (st->result) {
|
|
|
|
/*
|
|
|
|
* If we fail on a rollback, we're up a creek without no
|
|
|
|
* paddle, no way forward, no way back. We loose, thanks for
|
|
|
|
* playing.
|
|
|
|
*/
|
|
|
|
WARN_ON_ONCE(st->rollback);
|
|
|
|
st->should_run = false;
|
2016-02-26 18:43:38 +00:00
|
|
|
}
|
2017-09-20 17:00:17 +00:00
|
|
|
|
|
|
|
next:
|
2017-09-20 17:00:20 +00:00
|
|
|
cpuhp_lock_release(bringup);
|
2017-09-20 17:00:17 +00:00
|
|
|
|
|
|
|
if (!st->should_run)
|
2017-09-20 17:00:19 +00:00
|
|
|
complete_ap_thread(st, bringup);
|
2016-02-26 18:43:38 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/* Invoke a single callback on a remote cpu */
|
2016-08-12 17:49:38 +00:00
|
|
|
static int
|
2016-08-12 17:49:39 +00:00
|
|
|
cpuhp_invoke_ap_callback(int cpu, enum cpuhp_state state, bool bringup,
|
|
|
|
struct hlist_node *node)
|
2016-02-26 18:43:38 +00:00
|
|
|
{
|
|
|
|
struct cpuhp_cpu_state *st = per_cpu_ptr(&cpuhp_state, cpu);
|
2017-09-20 17:00:17 +00:00
|
|
|
int ret;
|
2016-02-26 18:43:38 +00:00
|
|
|
|
|
|
|
if (!cpu_online(cpu))
|
|
|
|
return 0;
|
|
|
|
|
2017-09-20 17:00:20 +00:00
|
|
|
cpuhp_lock_acquire(false);
|
|
|
|
cpuhp_lock_release(false);
|
|
|
|
|
|
|
|
cpuhp_lock_acquire(true);
|
|
|
|
cpuhp_lock_release(true);
|
2017-05-24 08:15:43 +00:00
|
|
|
|
2016-07-13 17:16:03 +00:00
|
|
|
/*
|
|
|
|
* If we are up and running, use the hotplug thread. For early calls
|
|
|
|
* we invoke the thread function directly.
|
|
|
|
*/
|
|
|
|
if (!st->thread)
|
2017-09-20 17:00:16 +00:00
|
|
|
return cpuhp_invoke_callback(cpu, state, bringup, node, NULL);
|
2016-07-13 17:16:03 +00:00
|
|
|
|
2017-09-20 17:00:17 +00:00
|
|
|
st->rollback = false;
|
|
|
|
st->last = NULL;
|
|
|
|
|
|
|
|
st->node = node;
|
|
|
|
st->bringup = bringup;
|
2016-02-26 18:43:38 +00:00
|
|
|
st->cb_state = state;
|
2016-08-12 17:49:38 +00:00
|
|
|
st->single = true;
|
|
|
|
|
2017-09-20 17:00:17 +00:00
|
|
|
__cpuhp_kick_ap(st);
|
2016-02-26 18:43:38 +00:00
|
|
|
|
|
|
|
/*
|
2017-09-20 17:00:17 +00:00
|
|
|
* If we failed and did a partial, do a rollback.
|
2016-02-26 18:43:38 +00:00
|
|
|
*/
|
2017-09-20 17:00:17 +00:00
|
|
|
if ((ret = st->result) && st->last) {
|
|
|
|
st->rollback = true;
|
|
|
|
st->bringup = !bringup;
|
|
|
|
|
|
|
|
__cpuhp_kick_ap(st);
|
|
|
|
}
|
|
|
|
|
2017-10-21 14:06:52 +00:00
|
|
|
/*
|
|
|
|
* Clean up the leftovers so the next hotplug operation wont use stale
|
|
|
|
* data.
|
|
|
|
*/
|
|
|
|
st->node = st->last = NULL;
|
2017-09-20 17:00:17 +00:00
|
|
|
return ret;
|
2016-02-26 18:43:39 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
static int cpuhp_kick_ap_work(unsigned int cpu)
|
|
|
|
{
|
|
|
|
struct cpuhp_cpu_state *st = per_cpu_ptr(&cpuhp_state, cpu);
|
2017-09-20 17:00:17 +00:00
|
|
|
enum cpuhp_state prev_state = st->state;
|
|
|
|
int ret;
|
2016-02-26 18:43:39 +00:00
|
|
|
|
2017-09-20 17:00:20 +00:00
|
|
|
cpuhp_lock_acquire(false);
|
|
|
|
cpuhp_lock_release(false);
|
|
|
|
|
|
|
|
cpuhp_lock_acquire(true);
|
|
|
|
cpuhp_lock_release(true);
|
2017-09-20 17:00:17 +00:00
|
|
|
|
|
|
|
trace_cpuhp_enter(cpu, st->target, prev_state, cpuhp_kick_ap_work);
|
|
|
|
ret = cpuhp_kick_ap(st, st->target);
|
|
|
|
trace_cpuhp_exit(cpu, st->state, prev_state, ret);
|
|
|
|
|
|
|
|
return ret;
|
2016-02-26 18:43:38 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
static struct smp_hotplug_thread cpuhp_threads = {
|
|
|
|
.store = &cpuhp_state.thread,
|
|
|
|
.create = &cpuhp_create,
|
|
|
|
.thread_should_run = cpuhp_should_run,
|
|
|
|
.thread_fn = cpuhp_thread_fun,
|
|
|
|
.thread_comm = "cpuhp/%u",
|
|
|
|
.selfparking = true,
|
|
|
|
};
|
|
|
|
|
|
|
|
void __init cpuhp_threads_init(void)
|
|
|
|
{
|
|
|
|
BUG_ON(smpboot_register_percpu_thread(&cpuhp_threads));
|
|
|
|
kthread_unpark(this_cpu_read(cpuhp_state.thread));
|
|
|
|
}
|
|
|
|
|
2016-12-07 13:54:38 +00:00
|
|
|
#ifdef CONFIG_HOTPLUG_CPU
|
2012-05-31 23:26:26 +00:00
|
|
|
/**
|
|
|
|
* clear_tasks_mm_cpumask - Safely clear tasks' mm_cpumask for a CPU
|
|
|
|
* @cpu: a CPU id
|
|
|
|
*
|
|
|
|
* This function walks all processes, finds a valid mm struct for each one and
|
|
|
|
* then clears a corresponding bit in mm's cpumask. While this all sounds
|
|
|
|
* trivial, there are various non-obvious corner cases, which this function
|
|
|
|
* tries to solve in a safe manner.
|
|
|
|
*
|
|
|
|
* Also note that the function uses a somewhat relaxed locking scheme, so it may
|
|
|
|
* be called only for an already offlined CPU.
|
|
|
|
*/
|
cpu: introduce clear_tasks_mm_cpumask() helper
Many architectures clear tasks' mm_cpumask like this:
read_lock(&tasklist_lock);
for_each_process(p) {
if (p->mm)
cpumask_clear_cpu(cpu, mm_cpumask(p->mm));
}
read_unlock(&tasklist_lock);
Depending on the context, the code above may have several problems,
such as:
1. Working with task->mm w/o getting mm or grabing the task lock is
dangerous as ->mm might disappear (exit_mm() assigns NULL under
task_lock(), so tasklist lock is not enough).
2. Checking for process->mm is not enough because process' main
thread may exit or detach its mm via use_mm(), but other threads
may still have a valid mm.
This patch implements a small helper function that does things
correctly, i.e.:
1. We take the task's lock while whe handle its mm (we can't use
get_task_mm()/mmput() pair as mmput() might sleep);
2. To catch exited main thread case, we use find_lock_task_mm(),
which walks up all threads and returns an appropriate task
(with task lock held).
Also, Per Peter Zijlstra's idea, now we don't grab tasklist_lock in
the new helper, instead we take the rcu read lock. We can do this
because the function is called after the cpu is taken down and marked
offline, so no new tasks will get this cpu set in their mm mask.
Signed-off-by: Anton Vorontsov <anton.vorontsov@linaro.org>
Cc: Richard Weinberger <richard@nod.at>
Cc: Oleg Nesterov <oleg@redhat.com>
Cc: Peter Zijlstra <a.p.zijlstra@chello.nl>
Cc: Russell King <rmk@arm.linux.org.uk>
Cc: Benjamin Herrenschmidt <benh@kernel.crashing.org>
Cc: Mike Frysinger <vapier@gentoo.org>
Cc: Paul Mundt <lethal@linux-sh.org>
Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
2012-05-31 23:26:22 +00:00
|
|
|
void clear_tasks_mm_cpumask(int cpu)
|
|
|
|
{
|
|
|
|
struct task_struct *p;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* This function is called after the cpu is taken down and marked
|
|
|
|
* offline, so its not like new tasks will ever get this cpu set in
|
|
|
|
* their mm mask. -- Peter Zijlstra
|
|
|
|
* Thus, we may use rcu_read_lock() here, instead of grabbing
|
|
|
|
* full-fledged tasklist_lock.
|
|
|
|
*/
|
2012-05-31 23:26:26 +00:00
|
|
|
WARN_ON(cpu_online(cpu));
|
cpu: introduce clear_tasks_mm_cpumask() helper
Many architectures clear tasks' mm_cpumask like this:
read_lock(&tasklist_lock);
for_each_process(p) {
if (p->mm)
cpumask_clear_cpu(cpu, mm_cpumask(p->mm));
}
read_unlock(&tasklist_lock);
Depending on the context, the code above may have several problems,
such as:
1. Working with task->mm w/o getting mm or grabing the task lock is
dangerous as ->mm might disappear (exit_mm() assigns NULL under
task_lock(), so tasklist lock is not enough).
2. Checking for process->mm is not enough because process' main
thread may exit or detach its mm via use_mm(), but other threads
may still have a valid mm.
This patch implements a small helper function that does things
correctly, i.e.:
1. We take the task's lock while whe handle its mm (we can't use
get_task_mm()/mmput() pair as mmput() might sleep);
2. To catch exited main thread case, we use find_lock_task_mm(),
which walks up all threads and returns an appropriate task
(with task lock held).
Also, Per Peter Zijlstra's idea, now we don't grab tasklist_lock in
the new helper, instead we take the rcu read lock. We can do this
because the function is called after the cpu is taken down and marked
offline, so no new tasks will get this cpu set in their mm mask.
Signed-off-by: Anton Vorontsov <anton.vorontsov@linaro.org>
Cc: Richard Weinberger <richard@nod.at>
Cc: Oleg Nesterov <oleg@redhat.com>
Cc: Peter Zijlstra <a.p.zijlstra@chello.nl>
Cc: Russell King <rmk@arm.linux.org.uk>
Cc: Benjamin Herrenschmidt <benh@kernel.crashing.org>
Cc: Mike Frysinger <vapier@gentoo.org>
Cc: Paul Mundt <lethal@linux-sh.org>
Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
2012-05-31 23:26:22 +00:00
|
|
|
rcu_read_lock();
|
|
|
|
for_each_process(p) {
|
|
|
|
struct task_struct *t;
|
|
|
|
|
2012-05-31 23:26:26 +00:00
|
|
|
/*
|
|
|
|
* Main thread might exit, but other threads may still have
|
|
|
|
* a valid mm. Find one.
|
|
|
|
*/
|
cpu: introduce clear_tasks_mm_cpumask() helper
Many architectures clear tasks' mm_cpumask like this:
read_lock(&tasklist_lock);
for_each_process(p) {
if (p->mm)
cpumask_clear_cpu(cpu, mm_cpumask(p->mm));
}
read_unlock(&tasklist_lock);
Depending on the context, the code above may have several problems,
such as:
1. Working with task->mm w/o getting mm or grabing the task lock is
dangerous as ->mm might disappear (exit_mm() assigns NULL under
task_lock(), so tasklist lock is not enough).
2. Checking for process->mm is not enough because process' main
thread may exit or detach its mm via use_mm(), but other threads
may still have a valid mm.
This patch implements a small helper function that does things
correctly, i.e.:
1. We take the task's lock while whe handle its mm (we can't use
get_task_mm()/mmput() pair as mmput() might sleep);
2. To catch exited main thread case, we use find_lock_task_mm(),
which walks up all threads and returns an appropriate task
(with task lock held).
Also, Per Peter Zijlstra's idea, now we don't grab tasklist_lock in
the new helper, instead we take the rcu read lock. We can do this
because the function is called after the cpu is taken down and marked
offline, so no new tasks will get this cpu set in their mm mask.
Signed-off-by: Anton Vorontsov <anton.vorontsov@linaro.org>
Cc: Richard Weinberger <richard@nod.at>
Cc: Oleg Nesterov <oleg@redhat.com>
Cc: Peter Zijlstra <a.p.zijlstra@chello.nl>
Cc: Russell King <rmk@arm.linux.org.uk>
Cc: Benjamin Herrenschmidt <benh@kernel.crashing.org>
Cc: Mike Frysinger <vapier@gentoo.org>
Cc: Paul Mundt <lethal@linux-sh.org>
Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
2012-05-31 23:26:22 +00:00
|
|
|
t = find_lock_task_mm(p);
|
|
|
|
if (!t)
|
|
|
|
continue;
|
|
|
|
cpumask_clear_cpu(cpu, mm_cpumask(t->mm));
|
|
|
|
task_unlock(t);
|
|
|
|
}
|
|
|
|
rcu_read_unlock();
|
|
|
|
}
|
|
|
|
|
2005-04-16 22:20:36 +00:00
|
|
|
/* Take this CPU down. */
|
2015-07-19 18:06:22 +00:00
|
|
|
static int take_cpu_down(void *_param)
|
2005-04-16 22:20:36 +00:00
|
|
|
{
|
2016-02-26 18:43:29 +00:00
|
|
|
struct cpuhp_cpu_state *st = this_cpu_ptr(&cpuhp_state);
|
|
|
|
enum cpuhp_state target = max((int)st->target, CPUHP_AP_OFFLINE);
|
2016-02-26 18:43:23 +00:00
|
|
|
int err, cpu = smp_processor_id();
|
2017-09-20 17:00:18 +00:00
|
|
|
int ret;
|
2005-04-16 22:20:36 +00:00
|
|
|
|
|
|
|
/* Ensure this CPU doesn't handle any more interrupts. */
|
|
|
|
err = __cpu_disable();
|
|
|
|
if (err < 0)
|
2005-06-25 21:54:50 +00:00
|
|
|
return err;
|
2005-04-16 22:20:36 +00:00
|
|
|
|
2016-08-12 17:49:38 +00:00
|
|
|
/*
|
|
|
|
* We get here while we are in CPUHP_TEARDOWN_CPU state and we must not
|
|
|
|
* do this step again.
|
|
|
|
*/
|
|
|
|
WARN_ON(st->state != CPUHP_TEARDOWN_CPU);
|
|
|
|
st->state--;
|
2016-02-26 18:43:29 +00:00
|
|
|
/* Invoke the former CPU_DYING callbacks */
|
2017-09-20 17:00:18 +00:00
|
|
|
for (; st->state > target; st->state--) {
|
|
|
|
ret = cpuhp_invoke_callback(cpu, st->state, false, NULL, NULL);
|
|
|
|
/*
|
|
|
|
* DYING must not fail!
|
|
|
|
*/
|
|
|
|
WARN_ON_ONCE(ret);
|
|
|
|
}
|
2016-02-26 18:43:29 +00:00
|
|
|
|
2015-04-03 00:37:24 +00:00
|
|
|
/* Give up timekeeping duties */
|
|
|
|
tick_handover_do_timer();
|
2013-01-31 12:11:14 +00:00
|
|
|
/* Park the stopper thread */
|
2016-02-26 18:43:23 +00:00
|
|
|
stop_machine_park(cpu);
|
2005-06-25 21:54:50 +00:00
|
|
|
return 0;
|
2005-04-16 22:20:36 +00:00
|
|
|
}
|
|
|
|
|
2016-02-26 18:43:25 +00:00
|
|
|
static int takedown_cpu(unsigned int cpu)
|
2005-04-16 22:20:36 +00:00
|
|
|
{
|
2016-02-26 18:43:43 +00:00
|
|
|
struct cpuhp_cpu_state *st = per_cpu_ptr(&cpuhp_state, cpu);
|
2016-02-26 18:43:25 +00:00
|
|
|
int err;
|
2005-04-16 22:20:36 +00:00
|
|
|
|
2016-03-10 19:42:08 +00:00
|
|
|
/* Park the smpboot threads */
|
2016-02-26 18:43:39 +00:00
|
|
|
kthread_park(per_cpu_ptr(&cpuhp_state, cpu)->thread);
|
2016-03-10 19:42:08 +00:00
|
|
|
smpboot_park_threads(cpu);
|
2016-02-26 18:43:39 +00:00
|
|
|
|
2013-10-11 12:38:20 +00:00
|
|
|
/*
|
2015-07-05 17:12:30 +00:00
|
|
|
* Prevent irq alloc/free while the dying cpu reorganizes the
|
|
|
|
* interrupt affinities.
|
2013-10-11 12:38:20 +00:00
|
|
|
*/
|
2015-07-05 17:12:30 +00:00
|
|
|
irq_lock_sparse();
|
2013-10-11 12:38:20 +00:00
|
|
|
|
2015-07-05 17:12:30 +00:00
|
|
|
/*
|
|
|
|
* So now all preempt/rcu users must observe !cpu_active().
|
|
|
|
*/
|
2017-05-24 08:15:28 +00:00
|
|
|
err = stop_machine_cpuslocked(take_cpu_down, NULL, cpumask_of(cpu));
|
2008-07-28 17:16:29 +00:00
|
|
|
if (err) {
|
2016-04-08 12:40:15 +00:00
|
|
|
/* CPU refused to die */
|
2015-07-05 17:12:30 +00:00
|
|
|
irq_unlock_sparse();
|
2016-04-08 12:40:15 +00:00
|
|
|
/* Unpark the hotplug thread so we can rollback there */
|
|
|
|
kthread_unpark(per_cpu_ptr(&cpuhp_state, cpu)->thread);
|
2016-02-26 18:43:25 +00:00
|
|
|
return err;
|
2006-10-28 17:38:57 +00:00
|
|
|
}
|
2008-07-28 17:16:29 +00:00
|
|
|
BUG_ON(cpu_online(cpu));
|
2005-04-16 22:20:36 +00:00
|
|
|
|
2010-11-13 18:32:29 +00:00
|
|
|
/*
|
2017-12-06 10:59:11 +00:00
|
|
|
* The teardown callback for CPUHP_AP_SCHED_STARTING will have removed
|
|
|
|
* all runnable tasks from the CPU, there's only the idle task left now
|
2010-11-13 18:32:29 +00:00
|
|
|
* that the migration thread is done doing the stop_machine thing.
|
2010-11-19 19:37:53 +00:00
|
|
|
*
|
|
|
|
* Wait for the stop thread to go away.
|
2010-11-13 18:32:29 +00:00
|
|
|
*/
|
2017-09-20 17:00:19 +00:00
|
|
|
wait_for_ap_thread(st, false);
|
2016-02-26 18:43:43 +00:00
|
|
|
BUG_ON(st->state != CPUHP_AP_IDLE_DEAD);
|
2005-04-16 22:20:36 +00:00
|
|
|
|
2015-07-05 17:12:30 +00:00
|
|
|
/* Interrupts are moved away from the dying cpu, reenable alloc/free */
|
|
|
|
irq_unlock_sparse();
|
|
|
|
|
2015-03-30 09:29:19 +00:00
|
|
|
hotplug_cpu__broadcast_tick_pull(cpu);
|
2005-04-16 22:20:36 +00:00
|
|
|
/* This actually kills the CPU. */
|
|
|
|
__cpu_die(cpu);
|
|
|
|
|
2015-04-03 00:38:05 +00:00
|
|
|
tick_cleanup_dead_cpu(cpu);
|
rcu: Migrate callbacks earlier in the CPU-offline timeline
RCU callbacks must be migrated away from an outgoing CPU, and this is
done near the end of the CPU-hotplug operation, after the outgoing CPU is
long gone. Unfortunately, this means that other CPU-hotplug callbacks
can execute while the outgoing CPU's callbacks are still immobilized
on the long-gone CPU's callback lists. If any of these CPU-hotplug
callbacks must wait, either directly or indirectly, for the invocation
of any of the immobilized RCU callbacks, the system will hang.
This commit avoids such hangs by migrating the callbacks away from the
outgoing CPU immediately upon its departure, shortly after the return
from __cpu_die() in takedown_cpu(). Thus, RCU is able to advance these
callbacks and invoke them, which allows all the after-the-fact CPU-hotplug
callbacks to wait on these RCU callbacks without risk of a hang.
While in the neighborhood, this commit also moves rcu_send_cbs_to_orphanage()
and rcu_adopt_orphan_cbs() under a pre-existing #ifdef to avoid including
dead code on the one hand and to avoid define-without-use warnings on the
other hand.
Reported-by: Jeffrey Hugo <jhugo@codeaurora.org>
Link: http://lkml.kernel.org/r/db9c91f6-1b17-6136-84f0-03c3c2581ab4@codeaurora.org
Signed-off-by: Paul E. McKenney <paulmck@linux.vnet.ibm.com>
Cc: Thomas Gleixner <tglx@linutronix.de>
Cc: Sebastian Andrzej Siewior <bigeasy@linutronix.de>
Cc: Ingo Molnar <mingo@kernel.org>
Cc: Anna-Maria Gleixner <anna-maria@linutronix.de>
Cc: Boris Ostrovsky <boris.ostrovsky@oracle.com>
Cc: Richard Weinberger <richard@nod.at>
2017-06-20 19:11:34 +00:00
|
|
|
rcutree_migrate_callbacks(cpu);
|
2016-02-26 18:43:25 +00:00
|
|
|
return 0;
|
|
|
|
}
|
2005-04-16 22:20:36 +00:00
|
|
|
|
2016-03-03 09:52:10 +00:00
|
|
|
static void cpuhp_complete_idle_dead(void *arg)
|
|
|
|
{
|
|
|
|
struct cpuhp_cpu_state *st = arg;
|
|
|
|
|
2017-09-20 17:00:19 +00:00
|
|
|
complete_ap_thread(st, false);
|
2016-03-03 09:52:10 +00:00
|
|
|
}
|
|
|
|
|
2016-02-26 18:43:43 +00:00
|
|
|
void cpuhp_report_idle_dead(void)
|
|
|
|
{
|
|
|
|
struct cpuhp_cpu_state *st = this_cpu_ptr(&cpuhp_state);
|
|
|
|
|
|
|
|
BUG_ON(st->state != CPUHP_AP_OFFLINE);
|
2016-02-26 18:43:44 +00:00
|
|
|
rcu_report_dead(smp_processor_id());
|
2016-03-03 09:52:10 +00:00
|
|
|
st->state = CPUHP_AP_IDLE_DEAD;
|
|
|
|
/*
|
|
|
|
* We cannot call complete after rcu_report_dead() so we delegate it
|
|
|
|
* to an online cpu.
|
|
|
|
*/
|
|
|
|
smp_call_function_single(cpumask_first(cpu_online_mask),
|
|
|
|
cpuhp_complete_idle_dead, st, 0);
|
2016-02-26 18:43:43 +00:00
|
|
|
}
|
|
|
|
|
2017-09-20 17:00:17 +00:00
|
|
|
static void undo_cpu_down(unsigned int cpu, struct cpuhp_cpu_state *st)
|
|
|
|
{
|
|
|
|
for (st->state++; st->state < st->target; st->state++) {
|
|
|
|
struct cpuhp_step *step = cpuhp_get_step(st->state);
|
2016-02-26 18:43:28 +00:00
|
|
|
|
2017-09-20 17:00:17 +00:00
|
|
|
if (!step->skip_onerr)
|
|
|
|
cpuhp_invoke_callback(cpu, st->state, true, NULL, NULL);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
static int cpuhp_down_callbacks(unsigned int cpu, struct cpuhp_cpu_state *st,
|
|
|
|
enum cpuhp_state target)
|
|
|
|
{
|
|
|
|
enum cpuhp_state prev_state = st->state;
|
|
|
|
int ret = 0;
|
|
|
|
|
|
|
|
for (; st->state > target; st->state--) {
|
|
|
|
ret = cpuhp_invoke_callback(cpu, st->state, false, NULL, NULL);
|
|
|
|
if (ret) {
|
|
|
|
st->target = prev_state;
|
|
|
|
undo_cpu_down(cpu, st);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return ret;
|
|
|
|
}
|
2016-02-26 18:43:28 +00:00
|
|
|
|
2016-02-26 18:43:25 +00:00
|
|
|
/* Requires cpu_add_remove_lock to be held */
|
2016-02-26 18:43:30 +00:00
|
|
|
static int __ref _cpu_down(unsigned int cpu, int tasks_frozen,
|
|
|
|
enum cpuhp_state target)
|
2016-02-26 18:43:25 +00:00
|
|
|
{
|
2016-02-26 18:43:28 +00:00
|
|
|
struct cpuhp_cpu_state *st = per_cpu_ptr(&cpuhp_state, cpu);
|
|
|
|
int prev_state, ret = 0;
|
2016-02-26 18:43:25 +00:00
|
|
|
|
|
|
|
if (num_online_cpus() == 1)
|
|
|
|
return -EBUSY;
|
|
|
|
|
2016-02-26 18:43:32 +00:00
|
|
|
if (!cpu_present(cpu))
|
2016-02-26 18:43:25 +00:00
|
|
|
return -EINVAL;
|
|
|
|
|
2017-05-24 08:15:12 +00:00
|
|
|
cpus_write_lock();
|
2016-02-26 18:43:25 +00:00
|
|
|
|
|
|
|
cpuhp_tasks_frozen = tasks_frozen;
|
|
|
|
|
2017-09-20 17:00:17 +00:00
|
|
|
prev_state = cpuhp_set_state(st, target);
|
2016-02-26 18:43:39 +00:00
|
|
|
/*
|
|
|
|
* If the current CPU state is in the range of the AP hotplug thread,
|
|
|
|
* then we need to kick the thread.
|
|
|
|
*/
|
2016-02-26 18:43:41 +00:00
|
|
|
if (st->state > CPUHP_TEARDOWN_CPU) {
|
2017-09-20 17:00:17 +00:00
|
|
|
st->target = max((int)target, CPUHP_TEARDOWN_CPU);
|
2016-02-26 18:43:39 +00:00
|
|
|
ret = cpuhp_kick_ap_work(cpu);
|
|
|
|
/*
|
|
|
|
* The AP side has done the error rollback already. Just
|
|
|
|
* return the error code..
|
|
|
|
*/
|
|
|
|
if (ret)
|
|
|
|
goto out;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* We might have stopped still in the range of the AP hotplug
|
|
|
|
* thread. Nothing to do anymore.
|
|
|
|
*/
|
2016-02-26 18:43:41 +00:00
|
|
|
if (st->state > CPUHP_TEARDOWN_CPU)
|
2016-02-26 18:43:39 +00:00
|
|
|
goto out;
|
2017-09-20 17:00:17 +00:00
|
|
|
|
|
|
|
st->target = target;
|
2016-02-26 18:43:39 +00:00
|
|
|
}
|
|
|
|
/*
|
2016-02-26 18:43:41 +00:00
|
|
|
* The AP brought itself down to CPUHP_TEARDOWN_CPU. So we need
|
2016-02-26 18:43:39 +00:00
|
|
|
* to do the further cleanups.
|
|
|
|
*/
|
2016-08-12 17:49:38 +00:00
|
|
|
ret = cpuhp_down_callbacks(cpu, st, target);
|
2016-04-08 12:40:15 +00:00
|
|
|
if (ret && st->state > CPUHP_TEARDOWN_CPU && st->state < prev_state) {
|
2017-09-20 17:00:17 +00:00
|
|
|
cpuhp_reset_state(st, prev_state);
|
|
|
|
__cpuhp_kick_ap(st);
|
2016-04-08 12:40:15 +00:00
|
|
|
}
|
2016-02-26 18:43:25 +00:00
|
|
|
|
2016-02-26 18:43:39 +00:00
|
|
|
out:
|
2017-05-24 08:15:12 +00:00
|
|
|
cpus_write_unlock();
|
2017-09-12 19:37:04 +00:00
|
|
|
/*
|
|
|
|
* Do post unplug cleanup. This is still protected against
|
|
|
|
* concurrent CPU hotplug via cpu_add_remove_lock.
|
|
|
|
*/
|
|
|
|
lockup_detector_cleanup();
|
2016-02-26 18:43:28 +00:00
|
|
|
return ret;
|
2006-09-26 06:32:48 +00:00
|
|
|
}
|
|
|
|
|
2016-02-26 18:43:30 +00:00
|
|
|
static int do_cpu_down(unsigned int cpu, enum cpuhp_state target)
|
2006-09-26 06:32:48 +00:00
|
|
|
{
|
2008-12-22 11:36:30 +00:00
|
|
|
int err;
|
2006-09-26 06:32:48 +00:00
|
|
|
|
2008-01-25 20:08:01 +00:00
|
|
|
cpu_maps_update_begin();
|
2008-07-15 11:43:49 +00:00
|
|
|
|
|
|
|
if (cpu_hotplug_disabled) {
|
2006-09-26 06:32:48 +00:00
|
|
|
err = -EBUSY;
|
2008-07-15 11:43:49 +00:00
|
|
|
goto out;
|
|
|
|
}
|
|
|
|
|
2016-02-26 18:43:30 +00:00
|
|
|
err = _cpu_down(cpu, 0, target);
|
2006-09-26 06:32:48 +00:00
|
|
|
|
2008-07-15 11:43:49 +00:00
|
|
|
out:
|
2008-01-25 20:08:01 +00:00
|
|
|
cpu_maps_update_done();
|
2005-04-16 22:20:36 +00:00
|
|
|
return err;
|
|
|
|
}
|
2017-09-20 17:00:17 +00:00
|
|
|
|
2016-02-26 18:43:30 +00:00
|
|
|
int cpu_down(unsigned int cpu)
|
|
|
|
{
|
|
|
|
return do_cpu_down(cpu, CPUHP_OFFLINE);
|
|
|
|
}
|
2008-04-29 06:35:56 +00:00
|
|
|
EXPORT_SYMBOL(cpu_down);
|
2017-09-20 17:00:17 +00:00
|
|
|
|
|
|
|
#else
|
|
|
|
#define takedown_cpu NULL
|
2005-04-16 22:20:36 +00:00
|
|
|
#endif /*CONFIG_HOTPLUG_CPU*/
|
|
|
|
|
2016-02-26 18:43:29 +00:00
|
|
|
/**
|
2016-08-18 12:57:16 +00:00
|
|
|
* notify_cpu_starting(cpu) - Invoke the callbacks on the starting CPU
|
2016-02-26 18:43:29 +00:00
|
|
|
* @cpu: cpu that just started
|
|
|
|
*
|
|
|
|
* It must be called by the arch code on the new cpu, before the new cpu
|
|
|
|
* enables interrupts and before the "boot" cpu returns from __cpu_up().
|
|
|
|
*/
|
|
|
|
void notify_cpu_starting(unsigned int cpu)
|
|
|
|
{
|
|
|
|
struct cpuhp_cpu_state *st = per_cpu_ptr(&cpuhp_state, cpu);
|
|
|
|
enum cpuhp_state target = min((int)st->target, CPUHP_AP_ONLINE);
|
2017-09-20 17:00:18 +00:00
|
|
|
int ret;
|
2016-02-26 18:43:29 +00:00
|
|
|
|
2016-08-17 12:21:04 +00:00
|
|
|
rcu_cpu_starting(cpu); /* Enables RCU usage on this CPU. */
|
2016-02-26 18:43:29 +00:00
|
|
|
while (st->state < target) {
|
|
|
|
st->state++;
|
2017-09-20 17:00:18 +00:00
|
|
|
ret = cpuhp_invoke_callback(cpu, st->state, true, NULL, NULL);
|
|
|
|
/*
|
|
|
|
* STARTING must not fail!
|
|
|
|
*/
|
|
|
|
WARN_ON_ONCE(ret);
|
2016-02-26 18:43:29 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2016-02-26 18:43:35 +00:00
|
|
|
/*
|
2017-07-04 20:20:23 +00:00
|
|
|
* Called from the idle task. Wake up the controlling task which brings the
|
|
|
|
* stopper and the hotplug thread of the upcoming CPU up and then delegates
|
|
|
|
* the rest of the online bringup to the hotplug thread.
|
2016-02-26 18:43:35 +00:00
|
|
|
*/
|
2016-02-26 18:43:41 +00:00
|
|
|
void cpuhp_online_idle(enum cpuhp_state state)
|
2016-02-26 18:43:35 +00:00
|
|
|
{
|
2016-02-26 18:43:41 +00:00
|
|
|
struct cpuhp_cpu_state *st = this_cpu_ptr(&cpuhp_state);
|
|
|
|
|
|
|
|
/* Happens for the boot cpu */
|
|
|
|
if (state != CPUHP_AP_ONLINE_IDLE)
|
|
|
|
return;
|
|
|
|
|
|
|
|
st->state = CPUHP_AP_ONLINE_IDLE;
|
2017-09-20 17:00:19 +00:00
|
|
|
complete_ap_thread(st, true);
|
2016-02-26 18:43:35 +00:00
|
|
|
}
|
|
|
|
|
2006-09-26 06:32:48 +00:00
|
|
|
/* Requires cpu_add_remove_lock to be held */
|
2016-02-26 18:43:30 +00:00
|
|
|
static int _cpu_up(unsigned int cpu, int tasks_frozen, enum cpuhp_state target)
|
2005-04-16 22:20:36 +00:00
|
|
|
{
|
2016-02-26 18:43:28 +00:00
|
|
|
struct cpuhp_cpu_state *st = per_cpu_ptr(&cpuhp_state, cpu);
|
2012-04-21 00:08:50 +00:00
|
|
|
struct task_struct *idle;
|
2016-02-26 18:43:37 +00:00
|
|
|
int ret = 0;
|
2005-04-16 22:20:36 +00:00
|
|
|
|
2017-05-24 08:15:12 +00:00
|
|
|
cpus_write_lock();
|
2012-04-20 13:05:44 +00:00
|
|
|
|
2016-02-26 18:43:32 +00:00
|
|
|
if (!cpu_present(cpu)) {
|
2012-10-22 23:30:54 +00:00
|
|
|
ret = -EINVAL;
|
|
|
|
goto out;
|
|
|
|
}
|
|
|
|
|
2016-02-26 18:43:32 +00:00
|
|
|
/*
|
|
|
|
* The caller of do_cpu_up might have raced with another
|
|
|
|
* caller. Ignore it for now.
|
|
|
|
*/
|
|
|
|
if (st->state >= target)
|
2012-04-20 13:05:44 +00:00
|
|
|
goto out;
|
2016-02-26 18:43:32 +00:00
|
|
|
|
|
|
|
if (st->state == CPUHP_OFFLINE) {
|
|
|
|
/* Let it fail before we try to bring the cpu up */
|
|
|
|
idle = idle_thread_get(cpu);
|
|
|
|
if (IS_ERR(idle)) {
|
|
|
|
ret = PTR_ERR(idle);
|
|
|
|
goto out;
|
|
|
|
}
|
2012-04-21 00:08:50 +00:00
|
|
|
}
|
2012-04-20 13:05:44 +00:00
|
|
|
|
2016-02-26 18:43:24 +00:00
|
|
|
cpuhp_tasks_frozen = tasks_frozen;
|
|
|
|
|
2017-09-20 17:00:17 +00:00
|
|
|
cpuhp_set_state(st, target);
|
2016-02-26 18:43:39 +00:00
|
|
|
/*
|
|
|
|
* If the current CPU state is in the range of the AP hotplug thread,
|
|
|
|
* then we need to kick the thread once more.
|
|
|
|
*/
|
2016-02-26 18:43:41 +00:00
|
|
|
if (st->state > CPUHP_BRINGUP_CPU) {
|
2016-02-26 18:43:39 +00:00
|
|
|
ret = cpuhp_kick_ap_work(cpu);
|
|
|
|
/*
|
|
|
|
* The AP side has done the error rollback already. Just
|
|
|
|
* return the error code..
|
|
|
|
*/
|
|
|
|
if (ret)
|
|
|
|
goto out;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Try to reach the target state. We max out on the BP at
|
2016-02-26 18:43:41 +00:00
|
|
|
* CPUHP_BRINGUP_CPU. After that the AP hotplug thread is
|
2016-02-26 18:43:39 +00:00
|
|
|
* responsible for bringing it up to the target state.
|
|
|
|
*/
|
2016-02-26 18:43:41 +00:00
|
|
|
target = min((int)target, CPUHP_BRINGUP_CPU);
|
2016-08-12 17:49:38 +00:00
|
|
|
ret = cpuhp_up_callbacks(cpu, st, target);
|
2012-04-20 13:05:44 +00:00
|
|
|
out:
|
2017-05-24 08:15:12 +00:00
|
|
|
cpus_write_unlock();
|
2006-09-26 06:32:48 +00:00
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
2016-02-26 18:43:30 +00:00
|
|
|
static int do_cpu_up(unsigned int cpu, enum cpuhp_state target)
|
2006-09-26 06:32:48 +00:00
|
|
|
{
|
|
|
|
int err = 0;
|
2010-05-24 21:32:41 +00:00
|
|
|
|
2008-12-31 23:42:28 +00:00
|
|
|
if (!cpu_possible(cpu)) {
|
2014-06-04 23:11:17 +00:00
|
|
|
pr_err("can't online cpu %d because it is not configured as may-hotadd at boot time\n",
|
|
|
|
cpu);
|
2010-03-05 21:42:38 +00:00
|
|
|
#if defined(CONFIG_IA64)
|
2014-06-04 23:11:17 +00:00
|
|
|
pr_err("please check additional_cpus= boot parameter\n");
|
2007-10-19 06:40:47 +00:00
|
|
|
#endif
|
|
|
|
return -EINVAL;
|
|
|
|
}
|
2006-09-26 06:32:48 +00:00
|
|
|
|
2013-11-12 23:07:25 +00:00
|
|
|
err = try_online_node(cpu_to_node(cpu));
|
|
|
|
if (err)
|
|
|
|
return err;
|
2010-05-24 21:32:41 +00:00
|
|
|
|
2008-01-25 20:08:01 +00:00
|
|
|
cpu_maps_update_begin();
|
2008-07-15 11:43:49 +00:00
|
|
|
|
|
|
|
if (cpu_hotplug_disabled) {
|
2006-09-26 06:32:48 +00:00
|
|
|
err = -EBUSY;
|
2008-07-15 11:43:49 +00:00
|
|
|
goto out;
|
|
|
|
}
|
|
|
|
|
2016-02-26 18:43:30 +00:00
|
|
|
err = _cpu_up(cpu, 0, target);
|
2008-07-15 11:43:49 +00:00
|
|
|
out:
|
2008-01-25 20:08:01 +00:00
|
|
|
cpu_maps_update_done();
|
2006-09-26 06:32:48 +00:00
|
|
|
return err;
|
|
|
|
}
|
2016-02-26 18:43:30 +00:00
|
|
|
|
|
|
|
int cpu_up(unsigned int cpu)
|
|
|
|
{
|
|
|
|
return do_cpu_up(cpu, CPUHP_ONLINE);
|
|
|
|
}
|
2011-12-12 05:54:45 +00:00
|
|
|
EXPORT_SYMBOL_GPL(cpu_up);
|
2006-09-26 06:32:48 +00:00
|
|
|
|
2007-08-31 06:56:29 +00:00
|
|
|
#ifdef CONFIG_PM_SLEEP_SMP
|
2008-12-31 23:42:28 +00:00
|
|
|
static cpumask_var_t frozen_cpus;
|
2006-09-26 06:32:48 +00:00
|
|
|
|
2016-08-17 12:50:25 +00:00
|
|
|
int freeze_secondary_cpus(int primary)
|
2006-09-26 06:32:48 +00:00
|
|
|
{
|
2016-08-17 12:50:25 +00:00
|
|
|
int cpu, error = 0;
|
2006-09-26 06:32:48 +00:00
|
|
|
|
2008-01-25 20:08:01 +00:00
|
|
|
cpu_maps_update_begin();
|
2016-08-17 12:50:25 +00:00
|
|
|
if (!cpu_online(primary))
|
|
|
|
primary = cpumask_first(cpu_online_mask);
|
2009-12-16 17:04:32 +00:00
|
|
|
/*
|
|
|
|
* We take down all of the non-boot CPUs in one shot to avoid races
|
2006-09-26 06:32:48 +00:00
|
|
|
* with the userspace trying to use the CPU hotplug at the same time
|
|
|
|
*/
|
2008-12-31 23:42:28 +00:00
|
|
|
cpumask_clear(frozen_cpus);
|
2009-11-25 12:31:39 +00:00
|
|
|
|
2014-06-04 23:11:17 +00:00
|
|
|
pr_info("Disabling non-boot CPUs ...\n");
|
2006-09-26 06:32:48 +00:00
|
|
|
for_each_online_cpu(cpu) {
|
2016-08-17 12:50:25 +00:00
|
|
|
if (cpu == primary)
|
2006-09-26 06:32:48 +00:00
|
|
|
continue;
|
2014-06-06 12:40:17 +00:00
|
|
|
trace_suspend_resume(TPS("CPU_OFF"), cpu, true);
|
2016-02-26 18:43:30 +00:00
|
|
|
error = _cpu_down(cpu, 1, CPUHP_OFFLINE);
|
2014-06-06 12:40:17 +00:00
|
|
|
trace_suspend_resume(TPS("CPU_OFF"), cpu, false);
|
2009-11-18 00:22:13 +00:00
|
|
|
if (!error)
|
2008-12-31 23:42:28 +00:00
|
|
|
cpumask_set_cpu(cpu, frozen_cpus);
|
2009-11-18 00:22:13 +00:00
|
|
|
else {
|
2014-06-04 23:11:17 +00:00
|
|
|
pr_err("Error taking CPU%d down: %d\n", cpu, error);
|
2006-09-26 06:32:48 +00:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
2009-07-01 02:31:07 +00:00
|
|
|
|
2015-08-05 07:52:46 +00:00
|
|
|
if (!error)
|
2006-09-26 06:32:48 +00:00
|
|
|
BUG_ON(num_online_cpus() > 1);
|
2015-08-05 07:52:46 +00:00
|
|
|
else
|
2014-06-04 23:11:17 +00:00
|
|
|
pr_err("Non-boot CPUs are not disabled\n");
|
2015-08-05 07:52:46 +00:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Make sure the CPUs won't be enabled by someone else. We need to do
|
|
|
|
* this even in case of failure as all disable_nonboot_cpus() users are
|
|
|
|
* supposed to do enable_nonboot_cpus() on the failure path.
|
|
|
|
*/
|
|
|
|
cpu_hotplug_disabled++;
|
|
|
|
|
2008-01-25 20:08:01 +00:00
|
|
|
cpu_maps_update_done();
|
2006-09-26 06:32:48 +00:00
|
|
|
return error;
|
|
|
|
}
|
|
|
|
|
2009-08-20 01:05:36 +00:00
|
|
|
void __weak arch_enable_nonboot_cpus_begin(void)
|
|
|
|
{
|
|
|
|
}
|
|
|
|
|
|
|
|
void __weak arch_enable_nonboot_cpus_end(void)
|
|
|
|
{
|
|
|
|
}
|
|
|
|
|
2015-07-19 18:06:22 +00:00
|
|
|
void enable_nonboot_cpus(void)
|
2006-09-26 06:32:48 +00:00
|
|
|
{
|
|
|
|
int cpu, error;
|
|
|
|
|
|
|
|
/* Allow everyone to use the CPU hotplug again */
|
2008-01-25 20:08:01 +00:00
|
|
|
cpu_maps_update_begin();
|
2016-06-10 06:43:28 +00:00
|
|
|
__cpu_hotplug_enable();
|
2008-12-31 23:42:28 +00:00
|
|
|
if (cpumask_empty(frozen_cpus))
|
2007-04-02 06:49:49 +00:00
|
|
|
goto out;
|
2006-09-26 06:32:48 +00:00
|
|
|
|
2014-06-04 23:11:17 +00:00
|
|
|
pr_info("Enabling non-boot CPUs ...\n");
|
2009-08-20 01:05:36 +00:00
|
|
|
|
|
|
|
arch_enable_nonboot_cpus_begin();
|
|
|
|
|
2008-12-31 23:42:28 +00:00
|
|
|
for_each_cpu(cpu, frozen_cpus) {
|
2014-06-06 12:40:17 +00:00
|
|
|
trace_suspend_resume(TPS("CPU_ON"), cpu, true);
|
2016-02-26 18:43:30 +00:00
|
|
|
error = _cpu_up(cpu, 1, CPUHP_ONLINE);
|
2014-06-06 12:40:17 +00:00
|
|
|
trace_suspend_resume(TPS("CPU_ON"), cpu, false);
|
2006-09-26 06:32:48 +00:00
|
|
|
if (!error) {
|
2014-06-04 23:11:17 +00:00
|
|
|
pr_info("CPU%d is up\n", cpu);
|
2006-09-26 06:32:48 +00:00
|
|
|
continue;
|
|
|
|
}
|
2014-06-04 23:11:17 +00:00
|
|
|
pr_warn("Error taking CPU%d up: %d\n", cpu, error);
|
2006-09-26 06:32:48 +00:00
|
|
|
}
|
2009-08-20 01:05:36 +00:00
|
|
|
|
|
|
|
arch_enable_nonboot_cpus_end();
|
|
|
|
|
2008-12-31 23:42:28 +00:00
|
|
|
cpumask_clear(frozen_cpus);
|
2007-04-02 06:49:49 +00:00
|
|
|
out:
|
2008-01-25 20:08:01 +00:00
|
|
|
cpu_maps_update_done();
|
2005-04-16 22:20:36 +00:00
|
|
|
}
|
2008-12-31 23:42:28 +00:00
|
|
|
|
2011-11-15 20:59:31 +00:00
|
|
|
static int __init alloc_frozen_cpus(void)
|
2008-12-31 23:42:28 +00:00
|
|
|
{
|
|
|
|
if (!alloc_cpumask_var(&frozen_cpus, GFP_KERNEL|__GFP_ZERO))
|
|
|
|
return -ENOMEM;
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
core_initcall(alloc_frozen_cpus);
|
2011-11-02 23:59:25 +00:00
|
|
|
|
|
|
|
/*
|
|
|
|
* When callbacks for CPU hotplug notifications are being executed, we must
|
|
|
|
* ensure that the state of the system with respect to the tasks being frozen
|
|
|
|
* or not, as reported by the notification, remains unchanged *throughout the
|
|
|
|
* duration* of the execution of the callbacks.
|
|
|
|
* Hence we need to prevent the freezer from racing with regular CPU hotplug.
|
|
|
|
*
|
|
|
|
* This synchronization is implemented by mutually excluding regular CPU
|
|
|
|
* hotplug and Suspend/Hibernate call paths by hooking onto the Suspend/
|
|
|
|
* Hibernate notifications.
|
|
|
|
*/
|
|
|
|
static int
|
|
|
|
cpu_hotplug_pm_callback(struct notifier_block *nb,
|
|
|
|
unsigned long action, void *ptr)
|
|
|
|
{
|
|
|
|
switch (action) {
|
|
|
|
|
|
|
|
case PM_SUSPEND_PREPARE:
|
|
|
|
case PM_HIBERNATION_PREPARE:
|
2013-06-12 21:04:36 +00:00
|
|
|
cpu_hotplug_disable();
|
2011-11-02 23:59:25 +00:00
|
|
|
break;
|
|
|
|
|
|
|
|
case PM_POST_SUSPEND:
|
|
|
|
case PM_POST_HIBERNATION:
|
2013-06-12 21:04:36 +00:00
|
|
|
cpu_hotplug_enable();
|
2011-11-02 23:59:25 +00:00
|
|
|
break;
|
|
|
|
|
|
|
|
default:
|
|
|
|
return NOTIFY_DONE;
|
|
|
|
}
|
|
|
|
|
|
|
|
return NOTIFY_OK;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2011-11-15 20:59:31 +00:00
|
|
|
static int __init cpu_hotplug_pm_sync_init(void)
|
2011-11-02 23:59:25 +00:00
|
|
|
{
|
2012-11-13 19:32:43 +00:00
|
|
|
/*
|
|
|
|
* cpu_hotplug_pm_callback has higher priority than x86
|
|
|
|
* bsp_pm_callback which depends on cpu_hotplug_pm_callback
|
|
|
|
* to disable cpu hotplug to avoid cpu hotplug race.
|
|
|
|
*/
|
2011-11-02 23:59:25 +00:00
|
|
|
pm_notifier(cpu_hotplug_pm_callback, 0);
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
core_initcall(cpu_hotplug_pm_sync_init);
|
|
|
|
|
2007-08-31 06:56:29 +00:00
|
|
|
#endif /* CONFIG_PM_SLEEP_SMP */
|
2008-05-29 18:17:02 +00:00
|
|
|
|
2017-03-20 11:26:55 +00:00
|
|
|
int __boot_cpu_id;
|
|
|
|
|
2008-05-29 18:17:02 +00:00
|
|
|
#endif /* CONFIG_SMP */
|
2008-07-25 01:21:29 +00:00
|
|
|
|
2016-02-26 18:43:28 +00:00
|
|
|
/* Boot processor state steps */
|
|
|
|
static struct cpuhp_step cpuhp_bp_states[] = {
|
|
|
|
[CPUHP_OFFLINE] = {
|
|
|
|
.name = "offline",
|
2016-09-05 13:28:36 +00:00
|
|
|
.startup.single = NULL,
|
|
|
|
.teardown.single = NULL,
|
2016-02-26 18:43:28 +00:00
|
|
|
},
|
|
|
|
#ifdef CONFIG_SMP
|
|
|
|
[CPUHP_CREATE_THREADS]= {
|
2016-09-06 14:13:48 +00:00
|
|
|
.name = "threads:prepare",
|
2016-09-05 13:28:36 +00:00
|
|
|
.startup.single = smpboot_create_threads,
|
|
|
|
.teardown.single = NULL,
|
2016-02-26 18:43:32 +00:00
|
|
|
.cant_stop = true,
|
2016-02-26 18:43:28 +00:00
|
|
|
},
|
2016-07-13 17:16:09 +00:00
|
|
|
[CPUHP_PERF_PREPARE] = {
|
2016-09-05 13:28:36 +00:00
|
|
|
.name = "perf:prepare",
|
|
|
|
.startup.single = perf_event_init_cpu,
|
|
|
|
.teardown.single = perf_event_exit_cpu,
|
2016-07-13 17:16:09 +00:00
|
|
|
},
|
2016-07-13 17:16:29 +00:00
|
|
|
[CPUHP_WORKQUEUE_PREP] = {
|
2016-09-05 13:28:36 +00:00
|
|
|
.name = "workqueue:prepare",
|
|
|
|
.startup.single = workqueue_prepare_cpu,
|
|
|
|
.teardown.single = NULL,
|
2016-07-13 17:16:29 +00:00
|
|
|
},
|
2016-07-15 08:41:04 +00:00
|
|
|
[CPUHP_HRTIMERS_PREPARE] = {
|
2016-09-05 13:28:36 +00:00
|
|
|
.name = "hrtimers:prepare",
|
|
|
|
.startup.single = hrtimers_prepare_cpu,
|
|
|
|
.teardown.single = hrtimers_dead_cpu,
|
2016-07-15 08:41:04 +00:00
|
|
|
},
|
2016-07-13 17:17:01 +00:00
|
|
|
[CPUHP_SMPCFD_PREPARE] = {
|
2016-09-06 14:13:48 +00:00
|
|
|
.name = "smpcfd:prepare",
|
2016-09-05 13:28:36 +00:00
|
|
|
.startup.single = smpcfd_prepare_cpu,
|
|
|
|
.teardown.single = smpcfd_dead_cpu,
|
2016-07-13 17:17:01 +00:00
|
|
|
},
|
2016-08-18 12:57:17 +00:00
|
|
|
[CPUHP_RELAY_PREPARE] = {
|
|
|
|
.name = "relay:prepare",
|
|
|
|
.startup.single = relay_prepare_cpu,
|
|
|
|
.teardown.single = NULL,
|
|
|
|
},
|
2016-08-23 12:53:19 +00:00
|
|
|
[CPUHP_SLAB_PREPARE] = {
|
|
|
|
.name = "slab:prepare",
|
|
|
|
.startup.single = slab_prepare_cpu,
|
|
|
|
.teardown.single = slab_dead_cpu,
|
2016-07-13 17:17:01 +00:00
|
|
|
},
|
2016-07-13 17:17:03 +00:00
|
|
|
[CPUHP_RCUTREE_PREP] = {
|
2016-09-06 14:13:48 +00:00
|
|
|
.name = "RCU/tree:prepare",
|
2016-09-05 13:28:36 +00:00
|
|
|
.startup.single = rcutree_prepare_cpu,
|
|
|
|
.teardown.single = rcutree_dead_cpu,
|
2016-07-13 17:17:03 +00:00
|
|
|
},
|
2016-07-27 09:08:18 +00:00
|
|
|
/*
|
|
|
|
* On the tear-down path, timers_dead_cpu() must be invoked
|
|
|
|
* before blk_mq_queue_reinit_notify() from notify_dead(),
|
|
|
|
* otherwise a RCU stall occurs.
|
|
|
|
*/
|
2017-12-27 20:37:25 +00:00
|
|
|
[CPUHP_TIMERS_PREPARE] = {
|
2016-09-05 13:28:36 +00:00
|
|
|
.name = "timers:dead",
|
2017-12-27 20:37:25 +00:00
|
|
|
.startup.single = timers_prepare_cpu,
|
2016-09-05 13:28:36 +00:00
|
|
|
.teardown.single = timers_dead_cpu,
|
2016-07-27 09:08:18 +00:00
|
|
|
},
|
2016-03-08 09:36:13 +00:00
|
|
|
/* Kicks the plugged cpu into life */
|
2016-02-26 18:43:28 +00:00
|
|
|
[CPUHP_BRINGUP_CPU] = {
|
|
|
|
.name = "cpu:bringup",
|
2016-09-05 13:28:36 +00:00
|
|
|
.startup.single = bringup_cpu,
|
|
|
|
.teardown.single = NULL,
|
2016-02-26 18:43:32 +00:00
|
|
|
.cant_stop = true,
|
2016-02-26 18:43:29 +00:00
|
|
|
},
|
2016-03-08 09:36:13 +00:00
|
|
|
/*
|
|
|
|
* Handled on controll processor until the plugged processor manages
|
|
|
|
* this itself.
|
|
|
|
*/
|
2016-02-26 18:43:29 +00:00
|
|
|
[CPUHP_TEARDOWN_CPU] = {
|
|
|
|
.name = "cpu:teardown",
|
2016-09-05 13:28:36 +00:00
|
|
|
.startup.single = NULL,
|
|
|
|
.teardown.single = takedown_cpu,
|
2016-02-26 18:43:32 +00:00
|
|
|
.cant_stop = true,
|
2016-02-26 18:43:28 +00:00
|
|
|
},
|
2016-07-12 19:59:23 +00:00
|
|
|
#else
|
|
|
|
[CPUHP_BRINGUP_CPU] = { },
|
2016-02-26 18:43:28 +00:00
|
|
|
#endif
|
|
|
|
};
|
|
|
|
|
2016-02-26 18:43:29 +00:00
|
|
|
/* Application processor state steps */
|
|
|
|
static struct cpuhp_step cpuhp_ap_states[] = {
|
|
|
|
#ifdef CONFIG_SMP
|
2016-03-08 09:36:13 +00:00
|
|
|
/* Final state before CPU kills itself */
|
|
|
|
[CPUHP_AP_IDLE_DEAD] = {
|
|
|
|
.name = "idle:dead",
|
|
|
|
},
|
|
|
|
/*
|
|
|
|
* Last state before CPU enters the idle loop to die. Transient state
|
|
|
|
* for synchronization.
|
|
|
|
*/
|
|
|
|
[CPUHP_AP_OFFLINE] = {
|
|
|
|
.name = "ap:offline",
|
|
|
|
.cant_stop = true,
|
|
|
|
},
|
2016-03-10 11:54:09 +00:00
|
|
|
/* First state is scheduler control. Interrupts are disabled */
|
|
|
|
[CPUHP_AP_SCHED_STARTING] = {
|
|
|
|
.name = "sched:starting",
|
2016-09-05 13:28:36 +00:00
|
|
|
.startup.single = sched_cpu_starting,
|
|
|
|
.teardown.single = sched_cpu_dying,
|
2016-03-10 11:54:09 +00:00
|
|
|
},
|
2016-07-13 17:17:03 +00:00
|
|
|
[CPUHP_AP_RCUTREE_DYING] = {
|
2016-09-06 14:13:48 +00:00
|
|
|
.name = "RCU/tree:dying",
|
2016-09-05 13:28:36 +00:00
|
|
|
.startup.single = NULL,
|
|
|
|
.teardown.single = rcutree_dying_cpu,
|
2016-02-26 18:43:29 +00:00
|
|
|
},
|
2017-11-28 13:19:53 +00:00
|
|
|
[CPUHP_AP_SMPCFD_DYING] = {
|
|
|
|
.name = "smpcfd:dying",
|
|
|
|
.startup.single = NULL,
|
|
|
|
.teardown.single = smpcfd_dying_cpu,
|
|
|
|
},
|
2016-03-08 09:36:13 +00:00
|
|
|
/* Entry state on starting. Interrupts enabled from here on. Transient
|
|
|
|
* state for synchronsization */
|
|
|
|
[CPUHP_AP_ONLINE] = {
|
|
|
|
.name = "ap:online",
|
|
|
|
},
|
|
|
|
/* Handle smpboot threads park/unpark */
|
2016-02-26 18:43:39 +00:00
|
|
|
[CPUHP_AP_SMPBOOT_THREADS] = {
|
2016-09-06 14:13:48 +00:00
|
|
|
.name = "smpboot/threads:online",
|
2016-09-05 13:28:36 +00:00
|
|
|
.startup.single = smpboot_unpark_threads,
|
|
|
|
.teardown.single = NULL,
|
2016-02-26 18:43:39 +00:00
|
|
|
},
|
2017-06-19 23:37:51 +00:00
|
|
|
[CPUHP_AP_IRQ_AFFINITY_ONLINE] = {
|
|
|
|
.name = "irq/affinity:online",
|
|
|
|
.startup.single = irq_affinity_online_cpu,
|
|
|
|
.teardown.single = NULL,
|
|
|
|
},
|
2016-07-13 17:16:09 +00:00
|
|
|
[CPUHP_AP_PERF_ONLINE] = {
|
2016-09-05 13:28:36 +00:00
|
|
|
.name = "perf:online",
|
|
|
|
.startup.single = perf_event_init_cpu,
|
|
|
|
.teardown.single = perf_event_exit_cpu,
|
2016-07-13 17:16:09 +00:00
|
|
|
},
|
2016-07-13 17:16:29 +00:00
|
|
|
[CPUHP_AP_WORKQUEUE_ONLINE] = {
|
2016-09-05 13:28:36 +00:00
|
|
|
.name = "workqueue:online",
|
|
|
|
.startup.single = workqueue_online_cpu,
|
|
|
|
.teardown.single = workqueue_offline_cpu,
|
2016-07-13 17:16:29 +00:00
|
|
|
},
|
2016-07-13 17:17:03 +00:00
|
|
|
[CPUHP_AP_RCUTREE_ONLINE] = {
|
2016-09-06 14:13:48 +00:00
|
|
|
.name = "RCU/tree:online",
|
2016-09-05 13:28:36 +00:00
|
|
|
.startup.single = rcutree_online_cpu,
|
|
|
|
.teardown.single = rcutree_offline_cpu,
|
2016-07-13 17:17:03 +00:00
|
|
|
},
|
2016-02-26 18:43:29 +00:00
|
|
|
#endif
|
2016-03-08 09:36:13 +00:00
|
|
|
/*
|
|
|
|
* The dynamically registered state space is here
|
|
|
|
*/
|
|
|
|
|
2016-03-10 11:54:19 +00:00
|
|
|
#ifdef CONFIG_SMP
|
|
|
|
/* Last state is scheduler control setting the cpu active */
|
|
|
|
[CPUHP_AP_ACTIVE] = {
|
|
|
|
.name = "sched:active",
|
2016-09-05 13:28:36 +00:00
|
|
|
.startup.single = sched_cpu_activate,
|
|
|
|
.teardown.single = sched_cpu_deactivate,
|
2016-03-10 11:54:19 +00:00
|
|
|
},
|
|
|
|
#endif
|
|
|
|
|
2016-03-08 09:36:13 +00:00
|
|
|
/* CPU is fully up and running. */
|
2016-02-26 18:43:29 +00:00
|
|
|
[CPUHP_ONLINE] = {
|
|
|
|
.name = "online",
|
2016-09-05 13:28:36 +00:00
|
|
|
.startup.single = NULL,
|
|
|
|
.teardown.single = NULL,
|
2016-02-26 18:43:29 +00:00
|
|
|
},
|
|
|
|
};
|
|
|
|
|
2016-02-26 18:43:33 +00:00
|
|
|
/* Sanity check for callbacks */
|
|
|
|
static int cpuhp_cb_check(enum cpuhp_state state)
|
|
|
|
{
|
|
|
|
if (state <= CPUHP_OFFLINE || state >= CPUHP_ONLINE)
|
|
|
|
return -EINVAL;
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2016-12-21 19:19:49 +00:00
|
|
|
/*
|
|
|
|
* Returns a free for dynamic slot assignment of the Online state. The states
|
|
|
|
* are protected by the cpuhp_slot_states mutex and an empty slot is identified
|
|
|
|
* by having no name assigned.
|
|
|
|
*/
|
|
|
|
static int cpuhp_reserve_state(enum cpuhp_state state)
|
|
|
|
{
|
2017-01-10 13:01:05 +00:00
|
|
|
enum cpuhp_state i, end;
|
|
|
|
struct cpuhp_step *step;
|
2016-12-21 19:19:49 +00:00
|
|
|
|
2017-01-10 13:01:05 +00:00
|
|
|
switch (state) {
|
|
|
|
case CPUHP_AP_ONLINE_DYN:
|
|
|
|
step = cpuhp_ap_states + CPUHP_AP_ONLINE_DYN;
|
|
|
|
end = CPUHP_AP_ONLINE_DYN_END;
|
|
|
|
break;
|
|
|
|
case CPUHP_BP_PREPARE_DYN:
|
|
|
|
step = cpuhp_bp_states + CPUHP_BP_PREPARE_DYN;
|
|
|
|
end = CPUHP_BP_PREPARE_DYN_END;
|
|
|
|
break;
|
|
|
|
default:
|
|
|
|
return -EINVAL;
|
|
|
|
}
|
|
|
|
|
|
|
|
for (i = state; i <= end; i++, step++) {
|
|
|
|
if (!step->name)
|
2016-12-21 19:19:49 +00:00
|
|
|
return i;
|
|
|
|
}
|
|
|
|
WARN(1, "No more dynamic states available for CPU hotplug\n");
|
|
|
|
return -ENOSPC;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int cpuhp_store_callbacks(enum cpuhp_state state, const char *name,
|
|
|
|
int (*startup)(unsigned int cpu),
|
|
|
|
int (*teardown)(unsigned int cpu),
|
|
|
|
bool multi_instance)
|
2016-02-26 18:43:33 +00:00
|
|
|
{
|
|
|
|
/* (Un)Install the callbacks for further cpu hotplug operations */
|
|
|
|
struct cpuhp_step *sp;
|
2016-12-21 19:19:49 +00:00
|
|
|
int ret = 0;
|
2016-02-26 18:43:33 +00:00
|
|
|
|
2017-07-19 22:36:00 +00:00
|
|
|
/*
|
|
|
|
* If name is NULL, then the state gets removed.
|
|
|
|
*
|
|
|
|
* CPUHP_AP_ONLINE_DYN and CPUHP_BP_PREPARE_DYN are handed out on
|
|
|
|
* the first allocation from these dynamic ranges, so the removal
|
|
|
|
* would trigger a new allocation and clear the wrong (already
|
|
|
|
* empty) state, leaving the callbacks of the to be cleared state
|
|
|
|
* dangling, which causes wreckage on the next hotplug operation.
|
|
|
|
*/
|
|
|
|
if (name && (state == CPUHP_AP_ONLINE_DYN ||
|
|
|
|
state == CPUHP_BP_PREPARE_DYN)) {
|
2016-12-21 19:19:49 +00:00
|
|
|
ret = cpuhp_reserve_state(state);
|
|
|
|
if (ret < 0)
|
2017-03-14 15:06:45 +00:00
|
|
|
return ret;
|
2016-12-21 19:19:49 +00:00
|
|
|
state = ret;
|
|
|
|
}
|
2016-02-26 18:43:33 +00:00
|
|
|
sp = cpuhp_get_step(state);
|
2017-03-14 15:06:45 +00:00
|
|
|
if (name && sp->name)
|
|
|
|
return -EBUSY;
|
|
|
|
|
2016-09-05 13:28:36 +00:00
|
|
|
sp->startup.single = startup;
|
|
|
|
sp->teardown.single = teardown;
|
2016-02-26 18:43:33 +00:00
|
|
|
sp->name = name;
|
2016-08-12 17:49:39 +00:00
|
|
|
sp->multi_instance = multi_instance;
|
|
|
|
INIT_HLIST_HEAD(&sp->list);
|
2016-12-21 19:19:49 +00:00
|
|
|
return ret;
|
2016-02-26 18:43:33 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
static void *cpuhp_get_teardown_cb(enum cpuhp_state state)
|
|
|
|
{
|
2016-09-05 13:28:36 +00:00
|
|
|
return cpuhp_get_step(state)->teardown.single;
|
2016-02-26 18:43:33 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Call the startup/teardown function for a step either on the AP or
|
|
|
|
* on the current CPU.
|
|
|
|
*/
|
2016-08-12 17:49:39 +00:00
|
|
|
static int cpuhp_issue_call(int cpu, enum cpuhp_state state, bool bringup,
|
|
|
|
struct hlist_node *node)
|
2016-02-26 18:43:33 +00:00
|
|
|
{
|
2016-08-12 17:49:38 +00:00
|
|
|
struct cpuhp_step *sp = cpuhp_get_step(state);
|
2016-02-26 18:43:33 +00:00
|
|
|
int ret;
|
|
|
|
|
2017-09-20 17:00:17 +00:00
|
|
|
/*
|
|
|
|
* If there's nothing to do, we done.
|
|
|
|
* Relies on the union for multi_instance.
|
|
|
|
*/
|
2016-09-05 13:28:36 +00:00
|
|
|
if ((bringup && !sp->startup.single) ||
|
|
|
|
(!bringup && !sp->teardown.single))
|
2016-02-26 18:43:33 +00:00
|
|
|
return 0;
|
|
|
|
/*
|
|
|
|
* The non AP bound callbacks can fail on bringup. On teardown
|
|
|
|
* e.g. module removal we crash for now.
|
|
|
|
*/
|
2016-02-26 18:43:39 +00:00
|
|
|
#ifdef CONFIG_SMP
|
|
|
|
if (cpuhp_is_ap_state(state))
|
2016-08-12 17:49:39 +00:00
|
|
|
ret = cpuhp_invoke_ap_callback(cpu, state, bringup, node);
|
2016-02-26 18:43:39 +00:00
|
|
|
else
|
2017-09-20 17:00:16 +00:00
|
|
|
ret = cpuhp_invoke_callback(cpu, state, bringup, node, NULL);
|
2016-02-26 18:43:39 +00:00
|
|
|
#else
|
2017-09-20 17:00:16 +00:00
|
|
|
ret = cpuhp_invoke_callback(cpu, state, bringup, node, NULL);
|
2016-02-26 18:43:39 +00:00
|
|
|
#endif
|
2016-02-26 18:43:33 +00:00
|
|
|
BUG_ON(ret && !bringup);
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Called from __cpuhp_setup_state on a recoverable failure.
|
|
|
|
*
|
|
|
|
* Note: The teardown callbacks for rollback are not allowed to fail!
|
|
|
|
*/
|
|
|
|
static void cpuhp_rollback_install(int failedcpu, enum cpuhp_state state,
|
2016-08-12 17:49:39 +00:00
|
|
|
struct hlist_node *node)
|
2016-02-26 18:43:33 +00:00
|
|
|
{
|
|
|
|
int cpu;
|
|
|
|
|
|
|
|
/* Roll back the already executed steps on the other cpus */
|
|
|
|
for_each_present_cpu(cpu) {
|
|
|
|
struct cpuhp_cpu_state *st = per_cpu_ptr(&cpuhp_state, cpu);
|
|
|
|
int cpustate = st->state;
|
|
|
|
|
|
|
|
if (cpu >= failedcpu)
|
|
|
|
break;
|
|
|
|
|
|
|
|
/* Did we invoke the startup call on that cpu ? */
|
|
|
|
if (cpustate >= state)
|
2016-08-12 17:49:39 +00:00
|
|
|
cpuhp_issue_call(cpu, state, false, node);
|
2016-02-26 18:43:33 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2017-05-24 08:15:15 +00:00
|
|
|
int __cpuhp_state_add_instance_cpuslocked(enum cpuhp_state state,
|
|
|
|
struct hlist_node *node,
|
|
|
|
bool invoke)
|
2016-08-12 17:49:39 +00:00
|
|
|
{
|
|
|
|
struct cpuhp_step *sp;
|
|
|
|
int cpu;
|
|
|
|
int ret;
|
|
|
|
|
2017-05-24 08:15:15 +00:00
|
|
|
lockdep_assert_cpus_held();
|
|
|
|
|
2016-08-12 17:49:39 +00:00
|
|
|
sp = cpuhp_get_step(state);
|
|
|
|
if (sp->multi_instance == false)
|
|
|
|
return -EINVAL;
|
|
|
|
|
2017-03-14 15:06:45 +00:00
|
|
|
mutex_lock(&cpuhp_state_mutex);
|
2016-08-12 17:49:39 +00:00
|
|
|
|
2016-09-05 13:28:36 +00:00
|
|
|
if (!invoke || !sp->startup.multi)
|
2016-08-12 17:49:39 +00:00
|
|
|
goto add_node;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Try to call the startup callback for each present cpu
|
|
|
|
* depending on the hotplug state of the cpu.
|
|
|
|
*/
|
|
|
|
for_each_present_cpu(cpu) {
|
|
|
|
struct cpuhp_cpu_state *st = per_cpu_ptr(&cpuhp_state, cpu);
|
|
|
|
int cpustate = st->state;
|
|
|
|
|
|
|
|
if (cpustate < state)
|
|
|
|
continue;
|
|
|
|
|
|
|
|
ret = cpuhp_issue_call(cpu, state, true, node);
|
|
|
|
if (ret) {
|
2016-09-05 13:28:36 +00:00
|
|
|
if (sp->teardown.multi)
|
2016-08-12 17:49:39 +00:00
|
|
|
cpuhp_rollback_install(cpu, state, node);
|
2017-03-14 15:06:45 +00:00
|
|
|
goto unlock;
|
2016-08-12 17:49:39 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
add_node:
|
|
|
|
ret = 0;
|
|
|
|
hlist_add_head(node, &sp->list);
|
2017-03-14 15:06:45 +00:00
|
|
|
unlock:
|
2016-08-12 17:49:39 +00:00
|
|
|
mutex_unlock(&cpuhp_state_mutex);
|
2017-05-24 08:15:15 +00:00
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
|
|
|
int __cpuhp_state_add_instance(enum cpuhp_state state, struct hlist_node *node,
|
|
|
|
bool invoke)
|
|
|
|
{
|
|
|
|
int ret;
|
|
|
|
|
|
|
|
cpus_read_lock();
|
|
|
|
ret = __cpuhp_state_add_instance_cpuslocked(state, node, invoke);
|
2017-05-24 08:15:12 +00:00
|
|
|
cpus_read_unlock();
|
2016-08-12 17:49:39 +00:00
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL_GPL(__cpuhp_state_add_instance);
|
|
|
|
|
2016-02-26 18:43:33 +00:00
|
|
|
/**
|
2017-05-24 08:15:14 +00:00
|
|
|
* __cpuhp_setup_state_cpuslocked - Setup the callbacks for an hotplug machine state
|
2016-12-21 19:19:49 +00:00
|
|
|
* @state: The state to setup
|
|
|
|
* @invoke: If true, the startup function is invoked for cpus where
|
|
|
|
* cpu state >= @state
|
|
|
|
* @startup: startup callback function
|
|
|
|
* @teardown: teardown callback function
|
|
|
|
* @multi_instance: State is set up for multiple instances which get
|
|
|
|
* added afterwards.
|
2016-02-26 18:43:33 +00:00
|
|
|
*
|
2017-05-24 08:15:14 +00:00
|
|
|
* The caller needs to hold cpus read locked while calling this function.
|
2016-12-15 15:00:57 +00:00
|
|
|
* Returns:
|
|
|
|
* On success:
|
|
|
|
* Positive state number if @state is CPUHP_AP_ONLINE_DYN
|
|
|
|
* 0 for all other states
|
|
|
|
* On failure: proper (negative) error code
|
2016-02-26 18:43:33 +00:00
|
|
|
*/
|
2017-05-24 08:15:14 +00:00
|
|
|
int __cpuhp_setup_state_cpuslocked(enum cpuhp_state state,
|
|
|
|
const char *name, bool invoke,
|
|
|
|
int (*startup)(unsigned int cpu),
|
|
|
|
int (*teardown)(unsigned int cpu),
|
|
|
|
bool multi_instance)
|
2016-02-26 18:43:33 +00:00
|
|
|
{
|
|
|
|
int cpu, ret = 0;
|
2016-12-26 21:58:19 +00:00
|
|
|
bool dynstate;
|
2016-02-26 18:43:33 +00:00
|
|
|
|
2017-05-24 08:15:14 +00:00
|
|
|
lockdep_assert_cpus_held();
|
|
|
|
|
2016-02-26 18:43:33 +00:00
|
|
|
if (cpuhp_cb_check(state) || !name)
|
|
|
|
return -EINVAL;
|
|
|
|
|
2017-03-14 15:06:45 +00:00
|
|
|
mutex_lock(&cpuhp_state_mutex);
|
2016-02-26 18:43:33 +00:00
|
|
|
|
2016-12-21 19:19:49 +00:00
|
|
|
ret = cpuhp_store_callbacks(state, name, startup, teardown,
|
|
|
|
multi_instance);
|
2016-02-26 18:43:33 +00:00
|
|
|
|
2016-12-26 21:58:19 +00:00
|
|
|
dynstate = state == CPUHP_AP_ONLINE_DYN;
|
|
|
|
if (ret > 0 && dynstate) {
|
|
|
|
state = ret;
|
|
|
|
ret = 0;
|
|
|
|
}
|
|
|
|
|
2016-12-21 19:19:49 +00:00
|
|
|
if (ret || !invoke || !startup)
|
2016-02-26 18:43:33 +00:00
|
|
|
goto out;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Try to call the startup callback for each present cpu
|
|
|
|
* depending on the hotplug state of the cpu.
|
|
|
|
*/
|
|
|
|
for_each_present_cpu(cpu) {
|
|
|
|
struct cpuhp_cpu_state *st = per_cpu_ptr(&cpuhp_state, cpu);
|
|
|
|
int cpustate = st->state;
|
|
|
|
|
|
|
|
if (cpustate < state)
|
|
|
|
continue;
|
|
|
|
|
2016-08-12 17:49:39 +00:00
|
|
|
ret = cpuhp_issue_call(cpu, state, true, NULL);
|
2016-02-26 18:43:33 +00:00
|
|
|
if (ret) {
|
2016-08-12 17:49:38 +00:00
|
|
|
if (teardown)
|
2016-08-12 17:49:39 +00:00
|
|
|
cpuhp_rollback_install(cpu, state, NULL);
|
|
|
|
cpuhp_store_callbacks(state, NULL, NULL, NULL, false);
|
2016-02-26 18:43:33 +00:00
|
|
|
goto out;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
out:
|
2017-03-14 15:06:45 +00:00
|
|
|
mutex_unlock(&cpuhp_state_mutex);
|
2016-12-21 19:19:49 +00:00
|
|
|
/*
|
|
|
|
* If the requested state is CPUHP_AP_ONLINE_DYN, return the
|
|
|
|
* dynamically allocated state in case of success.
|
|
|
|
*/
|
2016-12-26 21:58:19 +00:00
|
|
|
if (!ret && dynstate)
|
2016-02-26 18:43:33 +00:00
|
|
|
return state;
|
|
|
|
return ret;
|
|
|
|
}
|
2017-05-24 08:15:14 +00:00
|
|
|
EXPORT_SYMBOL(__cpuhp_setup_state_cpuslocked);
|
|
|
|
|
|
|
|
int __cpuhp_setup_state(enum cpuhp_state state,
|
|
|
|
const char *name, bool invoke,
|
|
|
|
int (*startup)(unsigned int cpu),
|
|
|
|
int (*teardown)(unsigned int cpu),
|
|
|
|
bool multi_instance)
|
|
|
|
{
|
|
|
|
int ret;
|
|
|
|
|
|
|
|
cpus_read_lock();
|
|
|
|
ret = __cpuhp_setup_state_cpuslocked(state, name, invoke, startup,
|
|
|
|
teardown, multi_instance);
|
|
|
|
cpus_read_unlock();
|
|
|
|
return ret;
|
|
|
|
}
|
2016-02-26 18:43:33 +00:00
|
|
|
EXPORT_SYMBOL(__cpuhp_setup_state);
|
|
|
|
|
2016-08-12 17:49:39 +00:00
|
|
|
int __cpuhp_state_remove_instance(enum cpuhp_state state,
|
|
|
|
struct hlist_node *node, bool invoke)
|
|
|
|
{
|
|
|
|
struct cpuhp_step *sp = cpuhp_get_step(state);
|
|
|
|
int cpu;
|
|
|
|
|
|
|
|
BUG_ON(cpuhp_cb_check(state));
|
|
|
|
|
|
|
|
if (!sp->multi_instance)
|
|
|
|
return -EINVAL;
|
|
|
|
|
2017-05-24 08:15:12 +00:00
|
|
|
cpus_read_lock();
|
2017-03-14 15:06:45 +00:00
|
|
|
mutex_lock(&cpuhp_state_mutex);
|
|
|
|
|
2016-08-12 17:49:39 +00:00
|
|
|
if (!invoke || !cpuhp_get_teardown_cb(state))
|
|
|
|
goto remove;
|
|
|
|
/*
|
|
|
|
* Call the teardown callback for each present cpu depending
|
|
|
|
* on the hotplug state of the cpu. This function is not
|
|
|
|
* allowed to fail currently!
|
|
|
|
*/
|
|
|
|
for_each_present_cpu(cpu) {
|
|
|
|
struct cpuhp_cpu_state *st = per_cpu_ptr(&cpuhp_state, cpu);
|
|
|
|
int cpustate = st->state;
|
|
|
|
|
|
|
|
if (cpustate >= state)
|
|
|
|
cpuhp_issue_call(cpu, state, false, node);
|
|
|
|
}
|
|
|
|
|
|
|
|
remove:
|
|
|
|
hlist_del(node);
|
|
|
|
mutex_unlock(&cpuhp_state_mutex);
|
2017-05-24 08:15:12 +00:00
|
|
|
cpus_read_unlock();
|
2016-08-12 17:49:39 +00:00
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL_GPL(__cpuhp_state_remove_instance);
|
2017-03-14 15:06:45 +00:00
|
|
|
|
2016-02-26 18:43:33 +00:00
|
|
|
/**
|
2017-05-24 08:15:14 +00:00
|
|
|
* __cpuhp_remove_state_cpuslocked - Remove the callbacks for an hotplug machine state
|
2016-02-26 18:43:33 +00:00
|
|
|
* @state: The state to remove
|
|
|
|
* @invoke: If true, the teardown function is invoked for cpus where
|
|
|
|
* cpu state >= @state
|
|
|
|
*
|
2017-05-24 08:15:14 +00:00
|
|
|
* The caller needs to hold cpus read locked while calling this function.
|
2016-02-26 18:43:33 +00:00
|
|
|
* The teardown callback is currently not allowed to fail. Think
|
|
|
|
* about module removal!
|
|
|
|
*/
|
2017-05-24 08:15:14 +00:00
|
|
|
void __cpuhp_remove_state_cpuslocked(enum cpuhp_state state, bool invoke)
|
2016-02-26 18:43:33 +00:00
|
|
|
{
|
2016-08-12 17:49:39 +00:00
|
|
|
struct cpuhp_step *sp = cpuhp_get_step(state);
|
2016-02-26 18:43:33 +00:00
|
|
|
int cpu;
|
|
|
|
|
|
|
|
BUG_ON(cpuhp_cb_check(state));
|
|
|
|
|
2017-05-24 08:15:14 +00:00
|
|
|
lockdep_assert_cpus_held();
|
2016-02-26 18:43:33 +00:00
|
|
|
|
2017-03-14 15:06:45 +00:00
|
|
|
mutex_lock(&cpuhp_state_mutex);
|
2016-08-12 17:49:39 +00:00
|
|
|
if (sp->multi_instance) {
|
|
|
|
WARN(!hlist_empty(&sp->list),
|
|
|
|
"Error: Removing state %d which has instances left.\n",
|
|
|
|
state);
|
|
|
|
goto remove;
|
|
|
|
}
|
|
|
|
|
2016-08-12 17:49:38 +00:00
|
|
|
if (!invoke || !cpuhp_get_teardown_cb(state))
|
2016-02-26 18:43:33 +00:00
|
|
|
goto remove;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Call the teardown callback for each present cpu depending
|
|
|
|
* on the hotplug state of the cpu. This function is not
|
|
|
|
* allowed to fail currently!
|
|
|
|
*/
|
|
|
|
for_each_present_cpu(cpu) {
|
|
|
|
struct cpuhp_cpu_state *st = per_cpu_ptr(&cpuhp_state, cpu);
|
|
|
|
int cpustate = st->state;
|
|
|
|
|
|
|
|
if (cpustate >= state)
|
2016-08-12 17:49:39 +00:00
|
|
|
cpuhp_issue_call(cpu, state, false, NULL);
|
2016-02-26 18:43:33 +00:00
|
|
|
}
|
|
|
|
remove:
|
2016-08-12 17:49:39 +00:00
|
|
|
cpuhp_store_callbacks(state, NULL, NULL, NULL, false);
|
2017-03-14 15:06:45 +00:00
|
|
|
mutex_unlock(&cpuhp_state_mutex);
|
2017-05-24 08:15:14 +00:00
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(__cpuhp_remove_state_cpuslocked);
|
|
|
|
|
|
|
|
void __cpuhp_remove_state(enum cpuhp_state state, bool invoke)
|
|
|
|
{
|
|
|
|
cpus_read_lock();
|
|
|
|
__cpuhp_remove_state_cpuslocked(state, invoke);
|
2017-05-24 08:15:12 +00:00
|
|
|
cpus_read_unlock();
|
2016-02-26 18:43:33 +00:00
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(__cpuhp_remove_state);
|
|
|
|
|
2016-02-26 18:43:31 +00:00
|
|
|
#if defined(CONFIG_SYSFS) && defined(CONFIG_HOTPLUG_CPU)
|
|
|
|
static ssize_t show_cpuhp_state(struct device *dev,
|
|
|
|
struct device_attribute *attr, char *buf)
|
|
|
|
{
|
|
|
|
struct cpuhp_cpu_state *st = per_cpu_ptr(&cpuhp_state, dev->id);
|
|
|
|
|
|
|
|
return sprintf(buf, "%d\n", st->state);
|
|
|
|
}
|
|
|
|
static DEVICE_ATTR(state, 0444, show_cpuhp_state, NULL);
|
|
|
|
|
2016-02-26 18:43:32 +00:00
|
|
|
static ssize_t write_cpuhp_target(struct device *dev,
|
|
|
|
struct device_attribute *attr,
|
|
|
|
const char *buf, size_t count)
|
|
|
|
{
|
|
|
|
struct cpuhp_cpu_state *st = per_cpu_ptr(&cpuhp_state, dev->id);
|
|
|
|
struct cpuhp_step *sp;
|
|
|
|
int target, ret;
|
|
|
|
|
|
|
|
ret = kstrtoint(buf, 10, &target);
|
|
|
|
if (ret)
|
|
|
|
return ret;
|
|
|
|
|
|
|
|
#ifdef CONFIG_CPU_HOTPLUG_STATE_CONTROL
|
|
|
|
if (target < CPUHP_OFFLINE || target > CPUHP_ONLINE)
|
|
|
|
return -EINVAL;
|
|
|
|
#else
|
|
|
|
if (target != CPUHP_OFFLINE && target != CPUHP_ONLINE)
|
|
|
|
return -EINVAL;
|
|
|
|
#endif
|
|
|
|
|
|
|
|
ret = lock_device_hotplug_sysfs();
|
|
|
|
if (ret)
|
|
|
|
return ret;
|
|
|
|
|
|
|
|
mutex_lock(&cpuhp_state_mutex);
|
|
|
|
sp = cpuhp_get_step(target);
|
|
|
|
ret = !sp->name || sp->cant_stop ? -EINVAL : 0;
|
|
|
|
mutex_unlock(&cpuhp_state_mutex);
|
|
|
|
if (ret)
|
2017-06-02 14:27:14 +00:00
|
|
|
goto out;
|
2016-02-26 18:43:32 +00:00
|
|
|
|
|
|
|
if (st->state < target)
|
|
|
|
ret = do_cpu_up(dev->id, target);
|
|
|
|
else
|
|
|
|
ret = do_cpu_down(dev->id, target);
|
2017-06-02 14:27:14 +00:00
|
|
|
out:
|
2016-02-26 18:43:32 +00:00
|
|
|
unlock_device_hotplug();
|
|
|
|
return ret ? ret : count;
|
|
|
|
}
|
|
|
|
|
2016-02-26 18:43:31 +00:00
|
|
|
static ssize_t show_cpuhp_target(struct device *dev,
|
|
|
|
struct device_attribute *attr, char *buf)
|
|
|
|
{
|
|
|
|
struct cpuhp_cpu_state *st = per_cpu_ptr(&cpuhp_state, dev->id);
|
|
|
|
|
|
|
|
return sprintf(buf, "%d\n", st->target);
|
|
|
|
}
|
2016-02-26 18:43:32 +00:00
|
|
|
static DEVICE_ATTR(target, 0644, show_cpuhp_target, write_cpuhp_target);
|
2016-02-26 18:43:31 +00:00
|
|
|
|
2017-09-20 17:00:21 +00:00
|
|
|
|
|
|
|
static ssize_t write_cpuhp_fail(struct device *dev,
|
|
|
|
struct device_attribute *attr,
|
|
|
|
const char *buf, size_t count)
|
|
|
|
{
|
|
|
|
struct cpuhp_cpu_state *st = per_cpu_ptr(&cpuhp_state, dev->id);
|
|
|
|
struct cpuhp_step *sp;
|
|
|
|
int fail, ret;
|
|
|
|
|
|
|
|
ret = kstrtoint(buf, 10, &fail);
|
|
|
|
if (ret)
|
|
|
|
return ret;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Cannot fail STARTING/DYING callbacks.
|
|
|
|
*/
|
|
|
|
if (cpuhp_is_atomic_state(fail))
|
|
|
|
return -EINVAL;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Cannot fail anything that doesn't have callbacks.
|
|
|
|
*/
|
|
|
|
mutex_lock(&cpuhp_state_mutex);
|
|
|
|
sp = cpuhp_get_step(fail);
|
|
|
|
if (!sp->startup.single && !sp->teardown.single)
|
|
|
|
ret = -EINVAL;
|
|
|
|
mutex_unlock(&cpuhp_state_mutex);
|
|
|
|
if (ret)
|
|
|
|
return ret;
|
|
|
|
|
|
|
|
st->fail = fail;
|
|
|
|
|
|
|
|
return count;
|
|
|
|
}
|
|
|
|
|
|
|
|
static ssize_t show_cpuhp_fail(struct device *dev,
|
|
|
|
struct device_attribute *attr, char *buf)
|
|
|
|
{
|
|
|
|
struct cpuhp_cpu_state *st = per_cpu_ptr(&cpuhp_state, dev->id);
|
|
|
|
|
|
|
|
return sprintf(buf, "%d\n", st->fail);
|
|
|
|
}
|
|
|
|
|
|
|
|
static DEVICE_ATTR(fail, 0644, show_cpuhp_fail, write_cpuhp_fail);
|
|
|
|
|
2016-02-26 18:43:31 +00:00
|
|
|
static struct attribute *cpuhp_cpu_attrs[] = {
|
|
|
|
&dev_attr_state.attr,
|
|
|
|
&dev_attr_target.attr,
|
2017-09-20 17:00:21 +00:00
|
|
|
&dev_attr_fail.attr,
|
2016-02-26 18:43:31 +00:00
|
|
|
NULL
|
|
|
|
};
|
|
|
|
|
2017-06-29 12:10:47 +00:00
|
|
|
static const struct attribute_group cpuhp_cpu_attr_group = {
|
2016-02-26 18:43:31 +00:00
|
|
|
.attrs = cpuhp_cpu_attrs,
|
|
|
|
.name = "hotplug",
|
|
|
|
NULL
|
|
|
|
};
|
|
|
|
|
|
|
|
static ssize_t show_cpuhp_states(struct device *dev,
|
|
|
|
struct device_attribute *attr, char *buf)
|
|
|
|
{
|
|
|
|
ssize_t cur, res = 0;
|
|
|
|
int i;
|
|
|
|
|
|
|
|
mutex_lock(&cpuhp_state_mutex);
|
2016-02-26 18:43:32 +00:00
|
|
|
for (i = CPUHP_OFFLINE; i <= CPUHP_ONLINE; i++) {
|
2016-02-26 18:43:31 +00:00
|
|
|
struct cpuhp_step *sp = cpuhp_get_step(i);
|
|
|
|
|
|
|
|
if (sp->name) {
|
|
|
|
cur = sprintf(buf, "%3d: %s\n", i, sp->name);
|
|
|
|
buf += cur;
|
|
|
|
res += cur;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
mutex_unlock(&cpuhp_state_mutex);
|
|
|
|
return res;
|
|
|
|
}
|
|
|
|
static DEVICE_ATTR(states, 0444, show_cpuhp_states, NULL);
|
|
|
|
|
|
|
|
static struct attribute *cpuhp_cpu_root_attrs[] = {
|
|
|
|
&dev_attr_states.attr,
|
|
|
|
NULL
|
|
|
|
};
|
|
|
|
|
2017-06-29 12:10:47 +00:00
|
|
|
static const struct attribute_group cpuhp_cpu_root_attr_group = {
|
2016-02-26 18:43:31 +00:00
|
|
|
.attrs = cpuhp_cpu_root_attrs,
|
|
|
|
.name = "hotplug",
|
|
|
|
NULL
|
|
|
|
};
|
|
|
|
|
|
|
|
static int __init cpuhp_sysfs_init(void)
|
|
|
|
{
|
|
|
|
int cpu, ret;
|
|
|
|
|
|
|
|
ret = sysfs_create_group(&cpu_subsys.dev_root->kobj,
|
|
|
|
&cpuhp_cpu_root_attr_group);
|
|
|
|
if (ret)
|
|
|
|
return ret;
|
|
|
|
|
|
|
|
for_each_possible_cpu(cpu) {
|
|
|
|
struct device *dev = get_cpu_device(cpu);
|
|
|
|
|
|
|
|
if (!dev)
|
|
|
|
continue;
|
|
|
|
ret = sysfs_create_group(&dev->kobj, &cpuhp_cpu_attr_group);
|
|
|
|
if (ret)
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
device_initcall(cpuhp_sysfs_init);
|
|
|
|
#endif
|
|
|
|
|
cpu masks: optimize and clean up cpumask_of_cpu()
Clean up and optimize cpumask_of_cpu(), by sharing all the zero words.
Instead of stupidly generating all possible i=0...NR_CPUS 2^i patterns
creating a huge array of constant bitmasks, realize that the zero words
can be shared.
In other words, on a 64-bit architecture, we only ever need 64 of these
arrays - with a different bit set in one single world (with enough zero
words around it so that we can create any bitmask by just offsetting in
that big array). And then we just put enough zeroes around it that we
can point every single cpumask to be one of those things.
So when we have 4k CPU's, instead of having 4k arrays (of 4k bits each,
with one bit set in each array - 2MB memory total), we have exactly 64
arrays instead, each 8k bits in size (64kB total).
And then we just point cpumask(n) to the right position (which we can
calculate dynamically). Once we have the right arrays, getting
"cpumask(n)" ends up being:
static inline const cpumask_t *get_cpu_mask(unsigned int cpu)
{
const unsigned long *p = cpu_bit_bitmap[1 + cpu % BITS_PER_LONG];
p -= cpu / BITS_PER_LONG;
return (const cpumask_t *)p;
}
This brings other advantages and simplifications as well:
- we are not wasting memory that is just filled with a single bit in
various different places
- we don't need all those games to re-create the arrays in some dense
format, because they're already going to be dense enough.
if we compile a kernel for up to 4k CPU's, "wasting" that 64kB of memory
is a non-issue (especially since by doing this "overlapping" trick we
probably get better cache behaviour anyway).
[ mingo@elte.hu:
Converted Linus's mails into a commit. See:
http://lkml.org/lkml/2008/7/27/156
http://lkml.org/lkml/2008/7/28/320
Also applied a family filter - which also has the side-effect of leaving
out the bits where Linus calls me an idio... Oh, never mind ;-)
]
Signed-off-by: Ingo Molnar <mingo@elte.hu>
Cc: Rusty Russell <rusty@rustcorp.com.au>
Cc: Andrew Morton <akpm@linux-foundation.org>
Cc: Al Viro <viro@ZenIV.linux.org.uk>
Cc: Mike Travis <travis@sgi.com>
Signed-off-by: Ingo Molnar <mingo@elte.hu>
2008-07-28 18:32:33 +00:00
|
|
|
/*
|
|
|
|
* cpu_bit_bitmap[] is a special, "compressed" data structure that
|
|
|
|
* represents all NR_CPUS bits binary values of 1<<nr.
|
|
|
|
*
|
2008-12-31 23:42:28 +00:00
|
|
|
* It is used by cpumask_of() to get a constant address to a CPU
|
cpu masks: optimize and clean up cpumask_of_cpu()
Clean up and optimize cpumask_of_cpu(), by sharing all the zero words.
Instead of stupidly generating all possible i=0...NR_CPUS 2^i patterns
creating a huge array of constant bitmasks, realize that the zero words
can be shared.
In other words, on a 64-bit architecture, we only ever need 64 of these
arrays - with a different bit set in one single world (with enough zero
words around it so that we can create any bitmask by just offsetting in
that big array). And then we just put enough zeroes around it that we
can point every single cpumask to be one of those things.
So when we have 4k CPU's, instead of having 4k arrays (of 4k bits each,
with one bit set in each array - 2MB memory total), we have exactly 64
arrays instead, each 8k bits in size (64kB total).
And then we just point cpumask(n) to the right position (which we can
calculate dynamically). Once we have the right arrays, getting
"cpumask(n)" ends up being:
static inline const cpumask_t *get_cpu_mask(unsigned int cpu)
{
const unsigned long *p = cpu_bit_bitmap[1 + cpu % BITS_PER_LONG];
p -= cpu / BITS_PER_LONG;
return (const cpumask_t *)p;
}
This brings other advantages and simplifications as well:
- we are not wasting memory that is just filled with a single bit in
various different places
- we don't need all those games to re-create the arrays in some dense
format, because they're already going to be dense enough.
if we compile a kernel for up to 4k CPU's, "wasting" that 64kB of memory
is a non-issue (especially since by doing this "overlapping" trick we
probably get better cache behaviour anyway).
[ mingo@elte.hu:
Converted Linus's mails into a commit. See:
http://lkml.org/lkml/2008/7/27/156
http://lkml.org/lkml/2008/7/28/320
Also applied a family filter - which also has the side-effect of leaving
out the bits where Linus calls me an idio... Oh, never mind ;-)
]
Signed-off-by: Ingo Molnar <mingo@elte.hu>
Cc: Rusty Russell <rusty@rustcorp.com.au>
Cc: Andrew Morton <akpm@linux-foundation.org>
Cc: Al Viro <viro@ZenIV.linux.org.uk>
Cc: Mike Travis <travis@sgi.com>
Signed-off-by: Ingo Molnar <mingo@elte.hu>
2008-07-28 18:32:33 +00:00
|
|
|
* mask value that has a single bit set only.
|
|
|
|
*/
|
2008-07-25 01:21:29 +00:00
|
|
|
|
cpu masks: optimize and clean up cpumask_of_cpu()
Clean up and optimize cpumask_of_cpu(), by sharing all the zero words.
Instead of stupidly generating all possible i=0...NR_CPUS 2^i patterns
creating a huge array of constant bitmasks, realize that the zero words
can be shared.
In other words, on a 64-bit architecture, we only ever need 64 of these
arrays - with a different bit set in one single world (with enough zero
words around it so that we can create any bitmask by just offsetting in
that big array). And then we just put enough zeroes around it that we
can point every single cpumask to be one of those things.
So when we have 4k CPU's, instead of having 4k arrays (of 4k bits each,
with one bit set in each array - 2MB memory total), we have exactly 64
arrays instead, each 8k bits in size (64kB total).
And then we just point cpumask(n) to the right position (which we can
calculate dynamically). Once we have the right arrays, getting
"cpumask(n)" ends up being:
static inline const cpumask_t *get_cpu_mask(unsigned int cpu)
{
const unsigned long *p = cpu_bit_bitmap[1 + cpu % BITS_PER_LONG];
p -= cpu / BITS_PER_LONG;
return (const cpumask_t *)p;
}
This brings other advantages and simplifications as well:
- we are not wasting memory that is just filled with a single bit in
various different places
- we don't need all those games to re-create the arrays in some dense
format, because they're already going to be dense enough.
if we compile a kernel for up to 4k CPU's, "wasting" that 64kB of memory
is a non-issue (especially since by doing this "overlapping" trick we
probably get better cache behaviour anyway).
[ mingo@elte.hu:
Converted Linus's mails into a commit. See:
http://lkml.org/lkml/2008/7/27/156
http://lkml.org/lkml/2008/7/28/320
Also applied a family filter - which also has the side-effect of leaving
out the bits where Linus calls me an idio... Oh, never mind ;-)
]
Signed-off-by: Ingo Molnar <mingo@elte.hu>
Cc: Rusty Russell <rusty@rustcorp.com.au>
Cc: Andrew Morton <akpm@linux-foundation.org>
Cc: Al Viro <viro@ZenIV.linux.org.uk>
Cc: Mike Travis <travis@sgi.com>
Signed-off-by: Ingo Molnar <mingo@elte.hu>
2008-07-28 18:32:33 +00:00
|
|
|
/* cpu_bit_bitmap[0] is empty - so we can back into it */
|
2011-03-22 23:34:07 +00:00
|
|
|
#define MASK_DECLARE_1(x) [x+1][0] = (1UL << (x))
|
cpu masks: optimize and clean up cpumask_of_cpu()
Clean up and optimize cpumask_of_cpu(), by sharing all the zero words.
Instead of stupidly generating all possible i=0...NR_CPUS 2^i patterns
creating a huge array of constant bitmasks, realize that the zero words
can be shared.
In other words, on a 64-bit architecture, we only ever need 64 of these
arrays - with a different bit set in one single world (with enough zero
words around it so that we can create any bitmask by just offsetting in
that big array). And then we just put enough zeroes around it that we
can point every single cpumask to be one of those things.
So when we have 4k CPU's, instead of having 4k arrays (of 4k bits each,
with one bit set in each array - 2MB memory total), we have exactly 64
arrays instead, each 8k bits in size (64kB total).
And then we just point cpumask(n) to the right position (which we can
calculate dynamically). Once we have the right arrays, getting
"cpumask(n)" ends up being:
static inline const cpumask_t *get_cpu_mask(unsigned int cpu)
{
const unsigned long *p = cpu_bit_bitmap[1 + cpu % BITS_PER_LONG];
p -= cpu / BITS_PER_LONG;
return (const cpumask_t *)p;
}
This brings other advantages and simplifications as well:
- we are not wasting memory that is just filled with a single bit in
various different places
- we don't need all those games to re-create the arrays in some dense
format, because they're already going to be dense enough.
if we compile a kernel for up to 4k CPU's, "wasting" that 64kB of memory
is a non-issue (especially since by doing this "overlapping" trick we
probably get better cache behaviour anyway).
[ mingo@elte.hu:
Converted Linus's mails into a commit. See:
http://lkml.org/lkml/2008/7/27/156
http://lkml.org/lkml/2008/7/28/320
Also applied a family filter - which also has the side-effect of leaving
out the bits where Linus calls me an idio... Oh, never mind ;-)
]
Signed-off-by: Ingo Molnar <mingo@elte.hu>
Cc: Rusty Russell <rusty@rustcorp.com.au>
Cc: Andrew Morton <akpm@linux-foundation.org>
Cc: Al Viro <viro@ZenIV.linux.org.uk>
Cc: Mike Travis <travis@sgi.com>
Signed-off-by: Ingo Molnar <mingo@elte.hu>
2008-07-28 18:32:33 +00:00
|
|
|
#define MASK_DECLARE_2(x) MASK_DECLARE_1(x), MASK_DECLARE_1(x+1)
|
|
|
|
#define MASK_DECLARE_4(x) MASK_DECLARE_2(x), MASK_DECLARE_2(x+2)
|
|
|
|
#define MASK_DECLARE_8(x) MASK_DECLARE_4(x), MASK_DECLARE_4(x+4)
|
2008-07-25 01:21:29 +00:00
|
|
|
|
cpu masks: optimize and clean up cpumask_of_cpu()
Clean up and optimize cpumask_of_cpu(), by sharing all the zero words.
Instead of stupidly generating all possible i=0...NR_CPUS 2^i patterns
creating a huge array of constant bitmasks, realize that the zero words
can be shared.
In other words, on a 64-bit architecture, we only ever need 64 of these
arrays - with a different bit set in one single world (with enough zero
words around it so that we can create any bitmask by just offsetting in
that big array). And then we just put enough zeroes around it that we
can point every single cpumask to be one of those things.
So when we have 4k CPU's, instead of having 4k arrays (of 4k bits each,
with one bit set in each array - 2MB memory total), we have exactly 64
arrays instead, each 8k bits in size (64kB total).
And then we just point cpumask(n) to the right position (which we can
calculate dynamically). Once we have the right arrays, getting
"cpumask(n)" ends up being:
static inline const cpumask_t *get_cpu_mask(unsigned int cpu)
{
const unsigned long *p = cpu_bit_bitmap[1 + cpu % BITS_PER_LONG];
p -= cpu / BITS_PER_LONG;
return (const cpumask_t *)p;
}
This brings other advantages and simplifications as well:
- we are not wasting memory that is just filled with a single bit in
various different places
- we don't need all those games to re-create the arrays in some dense
format, because they're already going to be dense enough.
if we compile a kernel for up to 4k CPU's, "wasting" that 64kB of memory
is a non-issue (especially since by doing this "overlapping" trick we
probably get better cache behaviour anyway).
[ mingo@elte.hu:
Converted Linus's mails into a commit. See:
http://lkml.org/lkml/2008/7/27/156
http://lkml.org/lkml/2008/7/28/320
Also applied a family filter - which also has the side-effect of leaving
out the bits where Linus calls me an idio... Oh, never mind ;-)
]
Signed-off-by: Ingo Molnar <mingo@elte.hu>
Cc: Rusty Russell <rusty@rustcorp.com.au>
Cc: Andrew Morton <akpm@linux-foundation.org>
Cc: Al Viro <viro@ZenIV.linux.org.uk>
Cc: Mike Travis <travis@sgi.com>
Signed-off-by: Ingo Molnar <mingo@elte.hu>
2008-07-28 18:32:33 +00:00
|
|
|
const unsigned long cpu_bit_bitmap[BITS_PER_LONG+1][BITS_TO_LONGS(NR_CPUS)] = {
|
|
|
|
|
|
|
|
MASK_DECLARE_8(0), MASK_DECLARE_8(8),
|
|
|
|
MASK_DECLARE_8(16), MASK_DECLARE_8(24),
|
|
|
|
#if BITS_PER_LONG > 32
|
|
|
|
MASK_DECLARE_8(32), MASK_DECLARE_8(40),
|
|
|
|
MASK_DECLARE_8(48), MASK_DECLARE_8(56),
|
2008-07-25 01:21:29 +00:00
|
|
|
#endif
|
|
|
|
};
|
cpu masks: optimize and clean up cpumask_of_cpu()
Clean up and optimize cpumask_of_cpu(), by sharing all the zero words.
Instead of stupidly generating all possible i=0...NR_CPUS 2^i patterns
creating a huge array of constant bitmasks, realize that the zero words
can be shared.
In other words, on a 64-bit architecture, we only ever need 64 of these
arrays - with a different bit set in one single world (with enough zero
words around it so that we can create any bitmask by just offsetting in
that big array). And then we just put enough zeroes around it that we
can point every single cpumask to be one of those things.
So when we have 4k CPU's, instead of having 4k arrays (of 4k bits each,
with one bit set in each array - 2MB memory total), we have exactly 64
arrays instead, each 8k bits in size (64kB total).
And then we just point cpumask(n) to the right position (which we can
calculate dynamically). Once we have the right arrays, getting
"cpumask(n)" ends up being:
static inline const cpumask_t *get_cpu_mask(unsigned int cpu)
{
const unsigned long *p = cpu_bit_bitmap[1 + cpu % BITS_PER_LONG];
p -= cpu / BITS_PER_LONG;
return (const cpumask_t *)p;
}
This brings other advantages and simplifications as well:
- we are not wasting memory that is just filled with a single bit in
various different places
- we don't need all those games to re-create the arrays in some dense
format, because they're already going to be dense enough.
if we compile a kernel for up to 4k CPU's, "wasting" that 64kB of memory
is a non-issue (especially since by doing this "overlapping" trick we
probably get better cache behaviour anyway).
[ mingo@elte.hu:
Converted Linus's mails into a commit. See:
http://lkml.org/lkml/2008/7/27/156
http://lkml.org/lkml/2008/7/28/320
Also applied a family filter - which also has the side-effect of leaving
out the bits where Linus calls me an idio... Oh, never mind ;-)
]
Signed-off-by: Ingo Molnar <mingo@elte.hu>
Cc: Rusty Russell <rusty@rustcorp.com.au>
Cc: Andrew Morton <akpm@linux-foundation.org>
Cc: Al Viro <viro@ZenIV.linux.org.uk>
Cc: Mike Travis <travis@sgi.com>
Signed-off-by: Ingo Molnar <mingo@elte.hu>
2008-07-28 18:32:33 +00:00
|
|
|
EXPORT_SYMBOL_GPL(cpu_bit_bitmap);
|
2008-11-05 02:39:10 +00:00
|
|
|
|
|
|
|
const DECLARE_BITMAP(cpu_all_bits, NR_CPUS) = CPU_BITS_ALL;
|
|
|
|
EXPORT_SYMBOL(cpu_all_bits);
|
2008-12-29 22:35:14 +00:00
|
|
|
|
|
|
|
#ifdef CONFIG_INIT_ALL_POSSIBLE
|
2016-01-20 23:00:19 +00:00
|
|
|
struct cpumask __cpu_possible_mask __read_mostly
|
2016-01-20 23:00:16 +00:00
|
|
|
= {CPU_BITS_ALL};
|
2008-12-29 22:35:14 +00:00
|
|
|
#else
|
2016-01-20 23:00:19 +00:00
|
|
|
struct cpumask __cpu_possible_mask __read_mostly;
|
2008-12-29 22:35:14 +00:00
|
|
|
#endif
|
2016-01-20 23:00:19 +00:00
|
|
|
EXPORT_SYMBOL(__cpu_possible_mask);
|
2008-12-29 22:35:14 +00:00
|
|
|
|
2016-01-20 23:00:19 +00:00
|
|
|
struct cpumask __cpu_online_mask __read_mostly;
|
|
|
|
EXPORT_SYMBOL(__cpu_online_mask);
|
2008-12-29 22:35:14 +00:00
|
|
|
|
2016-01-20 23:00:19 +00:00
|
|
|
struct cpumask __cpu_present_mask __read_mostly;
|
|
|
|
EXPORT_SYMBOL(__cpu_present_mask);
|
2008-12-29 22:35:14 +00:00
|
|
|
|
2016-01-20 23:00:19 +00:00
|
|
|
struct cpumask __cpu_active_mask __read_mostly;
|
|
|
|
EXPORT_SYMBOL(__cpu_active_mask);
|
2008-12-29 22:35:16 +00:00
|
|
|
|
|
|
|
void init_cpu_present(const struct cpumask *src)
|
|
|
|
{
|
2016-01-20 23:00:16 +00:00
|
|
|
cpumask_copy(&__cpu_present_mask, src);
|
2008-12-29 22:35:16 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
void init_cpu_possible(const struct cpumask *src)
|
|
|
|
{
|
2016-01-20 23:00:16 +00:00
|
|
|
cpumask_copy(&__cpu_possible_mask, src);
|
2008-12-29 22:35:16 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
void init_cpu_online(const struct cpumask *src)
|
|
|
|
{
|
2016-01-20 23:00:16 +00:00
|
|
|
cpumask_copy(&__cpu_online_mask, src);
|
2008-12-29 22:35:16 +00:00
|
|
|
}
|
2016-02-26 18:43:28 +00:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Activate the first processor.
|
|
|
|
*/
|
|
|
|
void __init boot_cpu_init(void)
|
|
|
|
{
|
|
|
|
int cpu = smp_processor_id();
|
|
|
|
|
|
|
|
/* Mark the boot cpu "present", "online" etc for SMP and UP case */
|
|
|
|
set_cpu_online(cpu, true);
|
|
|
|
set_cpu_active(cpu, true);
|
|
|
|
set_cpu_present(cpu, true);
|
|
|
|
set_cpu_possible(cpu, true);
|
2017-03-20 11:26:55 +00:00
|
|
|
|
|
|
|
#ifdef CONFIG_SMP
|
|
|
|
__boot_cpu_id = cpu;
|
|
|
|
#endif
|
2016-02-26 18:43:28 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Must be called _AFTER_ setting up the per_cpu areas
|
|
|
|
*/
|
|
|
|
void __init boot_cpu_state_init(void)
|
|
|
|
{
|
|
|
|
per_cpu_ptr(&cpuhp_state, smp_processor_id())->state = CPUHP_ONLINE;
|
|
|
|
}
|