2005-04-17 05:20:36 +07:00
|
|
|
/*
|
|
|
|
* SMP support for ppc.
|
|
|
|
*
|
|
|
|
* Written by Cort Dougan (cort@cs.nmt.edu) borrowing a great
|
|
|
|
* deal of code from the sparc and intel versions.
|
|
|
|
*
|
|
|
|
* Copyright (C) 1999 Cort Dougan <cort@cs.nmt.edu>
|
|
|
|
*
|
|
|
|
* PowerPC-64 Support added by Dave Engebretsen, Peter Bergner, and
|
|
|
|
* Mike Corrigan {engebret|bergner|mikec}@us.ibm.com
|
|
|
|
*
|
|
|
|
* This program is free software; you can redistribute it and/or
|
|
|
|
* modify it under the terms of the GNU General Public License
|
|
|
|
* as published by the Free Software Foundation; either version
|
|
|
|
* 2 of the License, or (at your option) any later version.
|
|
|
|
*/
|
|
|
|
|
|
|
|
#undef DEBUG
|
|
|
|
|
|
|
|
#include <linux/kernel.h>
|
2011-07-23 05:24:23 +07:00
|
|
|
#include <linux/export.h>
|
2017-02-02 01:08:20 +07:00
|
|
|
#include <linux/sched/mm.h>
|
2017-02-01 22:36:40 +07:00
|
|
|
#include <linux/sched/topology.h>
|
2005-04-17 05:20:36 +07:00
|
|
|
#include <linux/smp.h>
|
|
|
|
#include <linux/interrupt.h>
|
|
|
|
#include <linux/delay.h>
|
|
|
|
#include <linux/init.h>
|
|
|
|
#include <linux/spinlock.h>
|
|
|
|
#include <linux/cache.h>
|
|
|
|
#include <linux/err.h>
|
2011-12-22 05:29:42 +07:00
|
|
|
#include <linux/device.h>
|
2005-04-17 05:20:36 +07:00
|
|
|
#include <linux/cpu.h>
|
|
|
|
#include <linux/notifier.h>
|
2005-12-13 02:56:47 +07:00
|
|
|
#include <linux/topology.h>
|
2016-05-18 08:16:51 +07:00
|
|
|
#include <linux/profile.h>
|
2017-06-06 20:08:32 +07:00
|
|
|
#include <linux/processor.h>
|
2018-10-13 16:45:12 +07:00
|
|
|
#include <linux/random.h>
|
2018-10-19 12:19:10 +07:00
|
|
|
#include <linux/stackprotector.h>
|
2005-04-17 05:20:36 +07:00
|
|
|
|
|
|
|
#include <asm/ptrace.h>
|
2011-07-27 06:09:06 +07:00
|
|
|
#include <linux/atomic.h>
|
2005-04-17 05:20:36 +07:00
|
|
|
#include <asm/irq.h>
|
2014-02-26 07:07:43 +07:00
|
|
|
#include <asm/hw_irq.h>
|
2014-05-23 15:15:25 +07:00
|
|
|
#include <asm/kvm_ppc.h>
|
2017-04-13 17:16:21 +07:00
|
|
|
#include <asm/dbell.h>
|
2005-04-17 05:20:36 +07:00
|
|
|
#include <asm/page.h>
|
|
|
|
#include <asm/pgtable.h>
|
|
|
|
#include <asm/prom.h>
|
|
|
|
#include <asm/smp.h>
|
|
|
|
#include <asm/time.h>
|
|
|
|
#include <asm/machdep.h>
|
2008-07-27 12:24:52 +07:00
|
|
|
#include <asm/cputhreads.h>
|
2005-04-17 05:20:36 +07:00
|
|
|
#include <asm/cputable.h>
|
2005-09-27 10:51:59 +07:00
|
|
|
#include <asm/mpic.h>
|
2005-11-11 17:15:21 +07:00
|
|
|
#include <asm/vdso_datapage.h>
|
2005-11-05 06:33:55 +07:00
|
|
|
#ifdef CONFIG_PPC64
|
|
|
|
#include <asm/paca.h>
|
|
|
|
#endif
|
2012-07-05 03:37:11 +07:00
|
|
|
#include <asm/vdso.h>
|
2012-03-29 00:30:02 +07:00
|
|
|
#include <asm/debug.h>
|
2014-08-20 05:55:19 +07:00
|
|
|
#include <asm/kexec.h>
|
2016-05-18 08:16:50 +07:00
|
|
|
#include <asm/asm-prototypes.h>
|
2016-07-23 16:12:40 +07:00
|
|
|
#include <asm/cpu_has_feature.h>
|
2018-04-19 14:04:03 +07:00
|
|
|
#include <asm/ftrace.h>
|
2005-11-05 06:33:55 +07:00
|
|
|
|
2005-04-17 05:20:36 +07:00
|
|
|
#ifdef DEBUG
|
2005-11-15 11:16:38 +07:00
|
|
|
#include <asm/udbg.h>
|
2005-04-17 05:20:36 +07:00
|
|
|
#define DBG(fmt...) udbg_printf(fmt)
|
|
|
|
#else
|
|
|
|
#define DBG(fmt...)
|
|
|
|
#endif
|
|
|
|
|
2011-03-08 10:40:04 +07:00
|
|
|
#ifdef CONFIG_HOTPLUG_CPU
|
2011-09-20 00:44:49 +07:00
|
|
|
/* State of each CPU during hotplug phases */
|
|
|
|
static DEFINE_PER_CPU(int, cpu_state) = { 0 };
|
2011-03-08 10:40:04 +07:00
|
|
|
#endif
|
|
|
|
|
2005-11-15 11:16:38 +07:00
|
|
|
struct thread_info *secondary_ti;
|
2018-10-11 12:33:01 +07:00
|
|
|
bool has_big_cores;
|
2005-11-15 11:16:38 +07:00
|
|
|
|
2010-04-26 22:32:41 +07:00
|
|
|
DEFINE_PER_CPU(cpumask_var_t, cpu_sibling_map);
|
2018-10-11 12:33:01 +07:00
|
|
|
DEFINE_PER_CPU(cpumask_var_t, cpu_smallcore_map);
|
2017-06-29 14:12:55 +07:00
|
|
|
DEFINE_PER_CPU(cpumask_var_t, cpu_l2_cache_map);
|
2010-04-26 22:32:41 +07:00
|
|
|
DEFINE_PER_CPU(cpumask_var_t, cpu_core_map);
|
2005-04-17 05:20:36 +07:00
|
|
|
|
2007-10-16 15:24:05 +07:00
|
|
|
EXPORT_PER_CPU_SYMBOL(cpu_sibling_map);
|
2017-06-29 14:12:55 +07:00
|
|
|
EXPORT_PER_CPU_SYMBOL(cpu_l2_cache_map);
|
2008-07-27 12:24:53 +07:00
|
|
|
EXPORT_PER_CPU_SYMBOL(cpu_core_map);
|
2018-10-11 12:33:01 +07:00
|
|
|
EXPORT_SYMBOL_GPL(has_big_cores);
|
|
|
|
|
|
|
|
#define MAX_THREAD_LIST_SIZE 8
|
|
|
|
#define THREAD_GROUP_SHARE_L1 1
|
|
|
|
struct thread_groups {
|
|
|
|
unsigned int property;
|
|
|
|
unsigned int nr_groups;
|
|
|
|
unsigned int threads_per_group;
|
|
|
|
unsigned int thread_list[MAX_THREAD_LIST_SIZE];
|
|
|
|
};
|
|
|
|
|
|
|
|
/*
|
|
|
|
* On big-cores system, cpu_l1_cache_map for each CPU corresponds to
|
|
|
|
* the set its siblings that share the L1-cache.
|
|
|
|
*/
|
|
|
|
DEFINE_PER_CPU(cpumask_var_t, cpu_l1_cache_map);
|
2005-04-17 05:20:36 +07:00
|
|
|
|
2005-11-05 06:33:55 +07:00
|
|
|
/* SMP operations for this machine */
|
2005-04-17 05:20:36 +07:00
|
|
|
struct smp_ops_t *smp_ops;
|
|
|
|
|
2009-06-19 06:30:07 +07:00
|
|
|
/* Can't be static due to PowerMac hackery */
|
|
|
|
volatile unsigned int cpu_callin_map[NR_CPUS];
|
2005-04-17 05:20:36 +07:00
|
|
|
|
|
|
|
int smt_enabled_at_boot = 1;
|
|
|
|
|
2013-08-06 02:58:34 +07:00
|
|
|
/*
|
|
|
|
* Returns 1 if the specified cpu should be brought up during boot.
|
|
|
|
* Used to inhibit booting threads if they've been disabled or
|
|
|
|
* limited on the command line
|
|
|
|
*/
|
|
|
|
int smp_generic_cpu_bootable(unsigned int nr)
|
|
|
|
{
|
|
|
|
/* Special case - we inhibit secondary thread startup
|
|
|
|
* during boot if the user requests it.
|
|
|
|
*/
|
2017-05-17 01:42:37 +07:00
|
|
|
if (system_state < SYSTEM_RUNNING && cpu_has_feature(CPU_FTR_SMT)) {
|
2013-08-06 02:58:34 +07:00
|
|
|
if (!smt_enabled_at_boot && cpu_thread_in_core(nr) != 0)
|
|
|
|
return 0;
|
|
|
|
if (smt_enabled_at_boot
|
|
|
|
&& cpu_thread_in_core(nr) >= smt_enabled_at_boot)
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2005-11-05 06:33:55 +07:00
|
|
|
#ifdef CONFIG_PPC64
|
2012-12-22 05:04:10 +07:00
|
|
|
int smp_generic_kick_cpu(int nr)
|
2005-04-17 05:20:36 +07:00
|
|
|
{
|
2017-06-27 14:00:06 +07:00
|
|
|
if (nr < 0 || nr >= nr_cpu_ids)
|
2017-06-27 14:00:05 +07:00
|
|
|
return -EINVAL;
|
2005-04-17 05:20:36 +07:00
|
|
|
|
|
|
|
/*
|
|
|
|
* The processor is currently spinning, waiting for the
|
|
|
|
* cpu_start field to become non-zero After we set cpu_start,
|
|
|
|
* the processor will continue on to secondary_start
|
|
|
|
*/
|
2018-02-13 22:08:12 +07:00
|
|
|
if (!paca_ptrs[nr]->cpu_start) {
|
|
|
|
paca_ptrs[nr]->cpu_start = 1;
|
2011-09-20 00:44:49 +07:00
|
|
|
smp_mb();
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
#ifdef CONFIG_HOTPLUG_CPU
|
|
|
|
/*
|
|
|
|
* Ok it's not there, so it might be soft-unplugged, let's
|
|
|
|
* try to bring it back
|
|
|
|
*/
|
2012-07-20 19:42:34 +07:00
|
|
|
generic_set_cpu_up(nr);
|
2011-09-20 00:44:49 +07:00
|
|
|
smp_wmb();
|
|
|
|
smp_send_reschedule(nr);
|
|
|
|
#endif /* CONFIG_HOTPLUG_CPU */
|
2011-04-12 04:46:19 +07:00
|
|
|
|
|
|
|
return 0;
|
2005-04-17 05:20:36 +07:00
|
|
|
}
|
2011-09-20 00:44:49 +07:00
|
|
|
#endif /* CONFIG_PPC64 */
|
2005-04-17 05:20:36 +07:00
|
|
|
|
2008-11-15 03:11:49 +07:00
|
|
|
static irqreturn_t call_function_action(int irq, void *data)
|
|
|
|
{
|
|
|
|
generic_smp_call_function_interrupt();
|
|
|
|
return IRQ_HANDLED;
|
|
|
|
}
|
|
|
|
|
|
|
|
static irqreturn_t reschedule_action(int irq, void *data)
|
|
|
|
{
|
2011-04-05 22:23:39 +07:00
|
|
|
scheduler_ipi();
|
2008-11-15 03:11:49 +07:00
|
|
|
return IRQ_HANDLED;
|
|
|
|
}
|
|
|
|
|
2018-05-05 00:19:33 +07:00
|
|
|
#ifdef CONFIG_GENERIC_CLOCKEVENTS_BROADCAST
|
2014-02-26 07:07:43 +07:00
|
|
|
static irqreturn_t tick_broadcast_ipi_action(int irq, void *data)
|
2008-11-15 03:11:49 +07:00
|
|
|
{
|
2018-05-05 00:19:31 +07:00
|
|
|
timer_broadcast_interrupt();
|
2008-11-15 03:11:49 +07:00
|
|
|
return IRQ_HANDLED;
|
|
|
|
}
|
2018-05-05 00:19:33 +07:00
|
|
|
#endif
|
2008-11-15 03:11:49 +07:00
|
|
|
|
2016-12-20 01:30:08 +07:00
|
|
|
#ifdef CONFIG_NMI_IPI
|
|
|
|
static irqreturn_t nmi_ipi_action(int irq, void *data)
|
2008-11-15 03:11:49 +07:00
|
|
|
{
|
2016-12-20 01:30:08 +07:00
|
|
|
smp_handle_nmi_ipi(get_irq_regs());
|
2008-11-15 03:11:49 +07:00
|
|
|
return IRQ_HANDLED;
|
|
|
|
}
|
2016-12-20 01:30:08 +07:00
|
|
|
#endif
|
2008-11-15 03:11:49 +07:00
|
|
|
|
|
|
|
static irq_handler_t smp_ipi_action[] = {
|
|
|
|
[PPC_MSG_CALL_FUNCTION] = call_function_action,
|
|
|
|
[PPC_MSG_RESCHEDULE] = reschedule_action,
|
2018-05-05 00:19:33 +07:00
|
|
|
#ifdef CONFIG_GENERIC_CLOCKEVENTS_BROADCAST
|
2014-02-26 07:07:43 +07:00
|
|
|
[PPC_MSG_TICK_BROADCAST] = tick_broadcast_ipi_action,
|
2018-05-05 00:19:33 +07:00
|
|
|
#endif
|
2016-12-20 01:30:08 +07:00
|
|
|
#ifdef CONFIG_NMI_IPI
|
|
|
|
[PPC_MSG_NMI_IPI] = nmi_ipi_action,
|
|
|
|
#endif
|
2008-11-15 03:11:49 +07:00
|
|
|
};
|
|
|
|
|
2016-12-20 01:30:08 +07:00
|
|
|
/*
|
|
|
|
* The NMI IPI is a fallback and not truly non-maskable. It is simpler
|
|
|
|
* than going through the call function infrastructure, and strongly
|
|
|
|
* serialized, so it is more appropriate for debugging.
|
|
|
|
*/
|
2008-11-15 03:11:49 +07:00
|
|
|
const char *smp_ipi_name[] = {
|
|
|
|
[PPC_MSG_CALL_FUNCTION] = "ipi call function",
|
|
|
|
[PPC_MSG_RESCHEDULE] = "ipi reschedule",
|
2018-05-05 00:19:33 +07:00
|
|
|
#ifdef CONFIG_GENERIC_CLOCKEVENTS_BROADCAST
|
2014-02-26 07:07:43 +07:00
|
|
|
[PPC_MSG_TICK_BROADCAST] = "ipi tick-broadcast",
|
2018-05-05 00:19:33 +07:00
|
|
|
#endif
|
2018-05-05 00:19:34 +07:00
|
|
|
#ifdef CONFIG_NMI_IPI
|
2016-12-20 01:30:08 +07:00
|
|
|
[PPC_MSG_NMI_IPI] = "nmi ipi",
|
2018-05-05 00:19:34 +07:00
|
|
|
#endif
|
2008-11-15 03:11:49 +07:00
|
|
|
};
|
|
|
|
|
|
|
|
/* optional function to request ipi, for controllers with >= 4 ipis */
|
|
|
|
int smp_request_message_ipi(int virq, int msg)
|
|
|
|
{
|
|
|
|
int err;
|
|
|
|
|
2016-12-20 01:30:08 +07:00
|
|
|
if (msg < 0 || msg > PPC_MSG_NMI_IPI)
|
2008-11-15 03:11:49 +07:00
|
|
|
return -EINVAL;
|
2016-12-20 01:30:08 +07:00
|
|
|
#ifndef CONFIG_NMI_IPI
|
|
|
|
if (msg == PPC_MSG_NMI_IPI)
|
2008-11-15 03:11:49 +07:00
|
|
|
return 1;
|
|
|
|
#endif
|
2016-12-20 01:30:08 +07:00
|
|
|
|
2011-10-05 09:30:50 +07:00
|
|
|
err = request_irq(virq, smp_ipi_action[msg],
|
2012-07-20 19:47:01 +07:00
|
|
|
IRQF_PERCPU | IRQF_NO_THREAD | IRQF_NO_SUSPEND,
|
2013-08-06 23:01:24 +07:00
|
|
|
smp_ipi_name[msg], NULL);
|
2008-11-15 03:11:49 +07:00
|
|
|
WARN(err < 0, "unable to request_irq %d for %s (rc %d)\n",
|
|
|
|
virq, smp_ipi_name[msg], err);
|
|
|
|
|
|
|
|
return err;
|
|
|
|
}
|
|
|
|
|
2011-05-11 02:29:42 +07:00
|
|
|
#ifdef CONFIG_PPC_SMP_MUXED_IPI
|
powerpc: Consolidate ipi message mux and demux
Consolidate the mux and demux of ipi messages into smp.c and call
a new smp_ops callback to actually trigger the ipi.
The powerpc architecture code is optimised for having 4 distinct
ipi triggers, which are mapped to 4 distinct messages (ipi many, ipi
single, scheduler ipi, and enter debugger). However, several interrupt
controllers only provide a single software triggered interrupt that
can be delivered to each cpu. To resolve this limitation, each smp_ops
implementation created a per-cpu variable that is manipulated with atomic
bitops. Since these lines will be contended they are optimialy marked as
shared_aligned and take a full cache line for each cpu. Distro kernels
may have 2 or 3 of these in their config, each taking per-cpu space
even though at most one will be in use.
This consolidation removes smp_message_recv and replaces the single call
actions cases with direct calls from the common message recognition loop.
The complicated debugger ipi case with its muxed crash handling code is
moved to debug_ipi_action which is now called from the demux code (instead
of the multi-message action calling smp_message_recv).
I put a call to reschedule_action to increase the likelyhood of correctly
merging the anticipated scheduler_ipi() hook coming from the scheduler
tree; that single required call can be inlined later.
The actual message decode is a copy of the old pseries xics code with its
memory barriers and cache line spacing, augmented with a per-cpu unsigned
long based on the book-e doorbell code. The optional data is set via a
callback from the implementation and is passed to the new cause-ipi hook
along with the logical cpu number. While currently only the doorbell
implemntation uses this data it should be almost zero cost to retrieve and
pass it -- it adds a single register load for the argument from the same
cache line to which we just completed a store and the register is dead
on return from the call. I extended the data element from unsigned int
to unsigned long in case some other code wanted to associate a pointer.
The doorbell check_self is replaced by a call to smp_muxed_ipi_resend,
conditioned on the CPU_DBELL feature. The ifdef guard could be relaxed
to CONFIG_SMP but I left it with BOOKE for now.
Also, the doorbell interrupt vector for book-e was not calling irq_enter
and irq_exit, which throws off cpu accounting and causes code to not
realize it is running in interrupt context. Add the missing calls.
Signed-off-by: Milton Miller <miltonm@bga.com>
Signed-off-by: Benjamin Herrenschmidt <benh@kernel.crashing.org>
2011-05-11 02:29:39 +07:00
|
|
|
struct cpu_messages {
|
2015-12-18 03:59:03 +07:00
|
|
|
long messages; /* current messages */
|
powerpc: Consolidate ipi message mux and demux
Consolidate the mux and demux of ipi messages into smp.c and call
a new smp_ops callback to actually trigger the ipi.
The powerpc architecture code is optimised for having 4 distinct
ipi triggers, which are mapped to 4 distinct messages (ipi many, ipi
single, scheduler ipi, and enter debugger). However, several interrupt
controllers only provide a single software triggered interrupt that
can be delivered to each cpu. To resolve this limitation, each smp_ops
implementation created a per-cpu variable that is manipulated with atomic
bitops. Since these lines will be contended they are optimialy marked as
shared_aligned and take a full cache line for each cpu. Distro kernels
may have 2 or 3 of these in their config, each taking per-cpu space
even though at most one will be in use.
This consolidation removes smp_message_recv and replaces the single call
actions cases with direct calls from the common message recognition loop.
The complicated debugger ipi case with its muxed crash handling code is
moved to debug_ipi_action which is now called from the demux code (instead
of the multi-message action calling smp_message_recv).
I put a call to reschedule_action to increase the likelyhood of correctly
merging the anticipated scheduler_ipi() hook coming from the scheduler
tree; that single required call can be inlined later.
The actual message decode is a copy of the old pseries xics code with its
memory barriers and cache line spacing, augmented with a per-cpu unsigned
long based on the book-e doorbell code. The optional data is set via a
callback from the implementation and is passed to the new cause-ipi hook
along with the logical cpu number. While currently only the doorbell
implemntation uses this data it should be almost zero cost to retrieve and
pass it -- it adds a single register load for the argument from the same
cache line to which we just completed a store and the register is dead
on return from the call. I extended the data element from unsigned int
to unsigned long in case some other code wanted to associate a pointer.
The doorbell check_self is replaced by a call to smp_muxed_ipi_resend,
conditioned on the CPU_DBELL feature. The ifdef guard could be relaxed
to CONFIG_SMP but I left it with BOOKE for now.
Also, the doorbell interrupt vector for book-e was not calling irq_enter
and irq_exit, which throws off cpu accounting and causes code to not
realize it is running in interrupt context. Add the missing calls.
Signed-off-by: Milton Miller <miltonm@bga.com>
Signed-off-by: Benjamin Herrenschmidt <benh@kernel.crashing.org>
2011-05-11 02:29:39 +07:00
|
|
|
};
|
|
|
|
static DEFINE_PER_CPU_SHARED_ALIGNED(struct cpu_messages, ipi_message);
|
|
|
|
|
2015-12-18 03:59:04 +07:00
|
|
|
void smp_muxed_ipi_set_message(int cpu, int msg)
|
powerpc: Consolidate ipi message mux and demux
Consolidate the mux and demux of ipi messages into smp.c and call
a new smp_ops callback to actually trigger the ipi.
The powerpc architecture code is optimised for having 4 distinct
ipi triggers, which are mapped to 4 distinct messages (ipi many, ipi
single, scheduler ipi, and enter debugger). However, several interrupt
controllers only provide a single software triggered interrupt that
can be delivered to each cpu. To resolve this limitation, each smp_ops
implementation created a per-cpu variable that is manipulated with atomic
bitops. Since these lines will be contended they are optimialy marked as
shared_aligned and take a full cache line for each cpu. Distro kernels
may have 2 or 3 of these in their config, each taking per-cpu space
even though at most one will be in use.
This consolidation removes smp_message_recv and replaces the single call
actions cases with direct calls from the common message recognition loop.
The complicated debugger ipi case with its muxed crash handling code is
moved to debug_ipi_action which is now called from the demux code (instead
of the multi-message action calling smp_message_recv).
I put a call to reschedule_action to increase the likelyhood of correctly
merging the anticipated scheduler_ipi() hook coming from the scheduler
tree; that single required call can be inlined later.
The actual message decode is a copy of the old pseries xics code with its
memory barriers and cache line spacing, augmented with a per-cpu unsigned
long based on the book-e doorbell code. The optional data is set via a
callback from the implementation and is passed to the new cause-ipi hook
along with the logical cpu number. While currently only the doorbell
implemntation uses this data it should be almost zero cost to retrieve and
pass it -- it adds a single register load for the argument from the same
cache line to which we just completed a store and the register is dead
on return from the call. I extended the data element from unsigned int
to unsigned long in case some other code wanted to associate a pointer.
The doorbell check_self is replaced by a call to smp_muxed_ipi_resend,
conditioned on the CPU_DBELL feature. The ifdef guard could be relaxed
to CONFIG_SMP but I left it with BOOKE for now.
Also, the doorbell interrupt vector for book-e was not calling irq_enter
and irq_exit, which throws off cpu accounting and causes code to not
realize it is running in interrupt context. Add the missing calls.
Signed-off-by: Milton Miller <miltonm@bga.com>
Signed-off-by: Benjamin Herrenschmidt <benh@kernel.crashing.org>
2011-05-11 02:29:39 +07:00
|
|
|
{
|
|
|
|
struct cpu_messages *info = &per_cpu(ipi_message, cpu);
|
2011-05-11 02:29:46 +07:00
|
|
|
char *message = (char *)&info->messages;
|
powerpc: Consolidate ipi message mux and demux
Consolidate the mux and demux of ipi messages into smp.c and call
a new smp_ops callback to actually trigger the ipi.
The powerpc architecture code is optimised for having 4 distinct
ipi triggers, which are mapped to 4 distinct messages (ipi many, ipi
single, scheduler ipi, and enter debugger). However, several interrupt
controllers only provide a single software triggered interrupt that
can be delivered to each cpu. To resolve this limitation, each smp_ops
implementation created a per-cpu variable that is manipulated with atomic
bitops. Since these lines will be contended they are optimialy marked as
shared_aligned and take a full cache line for each cpu. Distro kernels
may have 2 or 3 of these in their config, each taking per-cpu space
even though at most one will be in use.
This consolidation removes smp_message_recv and replaces the single call
actions cases with direct calls from the common message recognition loop.
The complicated debugger ipi case with its muxed crash handling code is
moved to debug_ipi_action which is now called from the demux code (instead
of the multi-message action calling smp_message_recv).
I put a call to reschedule_action to increase the likelyhood of correctly
merging the anticipated scheduler_ipi() hook coming from the scheduler
tree; that single required call can be inlined later.
The actual message decode is a copy of the old pseries xics code with its
memory barriers and cache line spacing, augmented with a per-cpu unsigned
long based on the book-e doorbell code. The optional data is set via a
callback from the implementation and is passed to the new cause-ipi hook
along with the logical cpu number. While currently only the doorbell
implemntation uses this data it should be almost zero cost to retrieve and
pass it -- it adds a single register load for the argument from the same
cache line to which we just completed a store and the register is dead
on return from the call. I extended the data element from unsigned int
to unsigned long in case some other code wanted to associate a pointer.
The doorbell check_self is replaced by a call to smp_muxed_ipi_resend,
conditioned on the CPU_DBELL feature. The ifdef guard could be relaxed
to CONFIG_SMP but I left it with BOOKE for now.
Also, the doorbell interrupt vector for book-e was not calling irq_enter
and irq_exit, which throws off cpu accounting and causes code to not
realize it is running in interrupt context. Add the missing calls.
Signed-off-by: Milton Miller <miltonm@bga.com>
Signed-off-by: Benjamin Herrenschmidt <benh@kernel.crashing.org>
2011-05-11 02:29:39 +07:00
|
|
|
|
2012-09-05 01:33:08 +07:00
|
|
|
/*
|
|
|
|
* Order previous accesses before accesses in the IPI handler.
|
|
|
|
*/
|
|
|
|
smp_mb();
|
2011-05-11 02:29:46 +07:00
|
|
|
message[msg] = 1;
|
2015-12-18 03:59:04 +07:00
|
|
|
}
|
|
|
|
|
|
|
|
void smp_muxed_ipi_message_pass(int cpu, int msg)
|
|
|
|
{
|
|
|
|
smp_muxed_ipi_set_message(cpu, msg);
|
2017-04-13 17:16:21 +07:00
|
|
|
|
2012-09-05 01:33:08 +07:00
|
|
|
/*
|
|
|
|
* cause_ipi functions are required to include a full barrier
|
|
|
|
* before doing whatever causes the IPI.
|
|
|
|
*/
|
2017-04-13 17:16:21 +07:00
|
|
|
smp_ops->cause_ipi(cpu);
|
powerpc: Consolidate ipi message mux and demux
Consolidate the mux and demux of ipi messages into smp.c and call
a new smp_ops callback to actually trigger the ipi.
The powerpc architecture code is optimised for having 4 distinct
ipi triggers, which are mapped to 4 distinct messages (ipi many, ipi
single, scheduler ipi, and enter debugger). However, several interrupt
controllers only provide a single software triggered interrupt that
can be delivered to each cpu. To resolve this limitation, each smp_ops
implementation created a per-cpu variable that is manipulated with atomic
bitops. Since these lines will be contended they are optimialy marked as
shared_aligned and take a full cache line for each cpu. Distro kernels
may have 2 or 3 of these in their config, each taking per-cpu space
even though at most one will be in use.
This consolidation removes smp_message_recv and replaces the single call
actions cases with direct calls from the common message recognition loop.
The complicated debugger ipi case with its muxed crash handling code is
moved to debug_ipi_action which is now called from the demux code (instead
of the multi-message action calling smp_message_recv).
I put a call to reschedule_action to increase the likelyhood of correctly
merging the anticipated scheduler_ipi() hook coming from the scheduler
tree; that single required call can be inlined later.
The actual message decode is a copy of the old pseries xics code with its
memory barriers and cache line spacing, augmented with a per-cpu unsigned
long based on the book-e doorbell code. The optional data is set via a
callback from the implementation and is passed to the new cause-ipi hook
along with the logical cpu number. While currently only the doorbell
implemntation uses this data it should be almost zero cost to retrieve and
pass it -- it adds a single register load for the argument from the same
cache line to which we just completed a store and the register is dead
on return from the call. I extended the data element from unsigned int
to unsigned long in case some other code wanted to associate a pointer.
The doorbell check_self is replaced by a call to smp_muxed_ipi_resend,
conditioned on the CPU_DBELL feature. The ifdef guard could be relaxed
to CONFIG_SMP but I left it with BOOKE for now.
Also, the doorbell interrupt vector for book-e was not calling irq_enter
and irq_exit, which throws off cpu accounting and causes code to not
realize it is running in interrupt context. Add the missing calls.
Signed-off-by: Milton Miller <miltonm@bga.com>
Signed-off-by: Benjamin Herrenschmidt <benh@kernel.crashing.org>
2011-05-11 02:29:39 +07:00
|
|
|
}
|
|
|
|
|
2013-08-06 23:01:48 +07:00
|
|
|
#ifdef __BIG_ENDIAN__
|
2015-12-18 03:59:03 +07:00
|
|
|
#define IPI_MESSAGE(A) (1uL << ((BITS_PER_LONG - 8) - 8 * (A)))
|
2013-08-06 23:01:48 +07:00
|
|
|
#else
|
2015-12-18 03:59:03 +07:00
|
|
|
#define IPI_MESSAGE(A) (1uL << (8 * (A)))
|
2013-08-06 23:01:48 +07:00
|
|
|
#endif
|
|
|
|
|
powerpc: Consolidate ipi message mux and demux
Consolidate the mux and demux of ipi messages into smp.c and call
a new smp_ops callback to actually trigger the ipi.
The powerpc architecture code is optimised for having 4 distinct
ipi triggers, which are mapped to 4 distinct messages (ipi many, ipi
single, scheduler ipi, and enter debugger). However, several interrupt
controllers only provide a single software triggered interrupt that
can be delivered to each cpu. To resolve this limitation, each smp_ops
implementation created a per-cpu variable that is manipulated with atomic
bitops. Since these lines will be contended they are optimialy marked as
shared_aligned and take a full cache line for each cpu. Distro kernels
may have 2 or 3 of these in their config, each taking per-cpu space
even though at most one will be in use.
This consolidation removes smp_message_recv and replaces the single call
actions cases with direct calls from the common message recognition loop.
The complicated debugger ipi case with its muxed crash handling code is
moved to debug_ipi_action which is now called from the demux code (instead
of the multi-message action calling smp_message_recv).
I put a call to reschedule_action to increase the likelyhood of correctly
merging the anticipated scheduler_ipi() hook coming from the scheduler
tree; that single required call can be inlined later.
The actual message decode is a copy of the old pseries xics code with its
memory barriers and cache line spacing, augmented with a per-cpu unsigned
long based on the book-e doorbell code. The optional data is set via a
callback from the implementation and is passed to the new cause-ipi hook
along with the logical cpu number. While currently only the doorbell
implemntation uses this data it should be almost zero cost to retrieve and
pass it -- it adds a single register load for the argument from the same
cache line to which we just completed a store and the register is dead
on return from the call. I extended the data element from unsigned int
to unsigned long in case some other code wanted to associate a pointer.
The doorbell check_self is replaced by a call to smp_muxed_ipi_resend,
conditioned on the CPU_DBELL feature. The ifdef guard could be relaxed
to CONFIG_SMP but I left it with BOOKE for now.
Also, the doorbell interrupt vector for book-e was not calling irq_enter
and irq_exit, which throws off cpu accounting and causes code to not
realize it is running in interrupt context. Add the missing calls.
Signed-off-by: Milton Miller <miltonm@bga.com>
Signed-off-by: Benjamin Herrenschmidt <benh@kernel.crashing.org>
2011-05-11 02:29:39 +07:00
|
|
|
irqreturn_t smp_ipi_demux(void)
|
|
|
|
{
|
|
|
|
mb(); /* order any irq clear */
|
2011-05-11 02:29:46 +07:00
|
|
|
|
2017-04-13 17:16:22 +07:00
|
|
|
return smp_ipi_demux_relaxed();
|
|
|
|
}
|
|
|
|
|
|
|
|
/* sync-free variant. Callers should ensure synchronization */
|
|
|
|
irqreturn_t smp_ipi_demux_relaxed(void)
|
powerpc: Consolidate ipi message mux and demux
Consolidate the mux and demux of ipi messages into smp.c and call
a new smp_ops callback to actually trigger the ipi.
The powerpc architecture code is optimised for having 4 distinct
ipi triggers, which are mapped to 4 distinct messages (ipi many, ipi
single, scheduler ipi, and enter debugger). However, several interrupt
controllers only provide a single software triggered interrupt that
can be delivered to each cpu. To resolve this limitation, each smp_ops
implementation created a per-cpu variable that is manipulated with atomic
bitops. Since these lines will be contended they are optimialy marked as
shared_aligned and take a full cache line for each cpu. Distro kernels
may have 2 or 3 of these in their config, each taking per-cpu space
even though at most one will be in use.
This consolidation removes smp_message_recv and replaces the single call
actions cases with direct calls from the common message recognition loop.
The complicated debugger ipi case with its muxed crash handling code is
moved to debug_ipi_action which is now called from the demux code (instead
of the multi-message action calling smp_message_recv).
I put a call to reschedule_action to increase the likelyhood of correctly
merging the anticipated scheduler_ipi() hook coming from the scheduler
tree; that single required call can be inlined later.
The actual message decode is a copy of the old pseries xics code with its
memory barriers and cache line spacing, augmented with a per-cpu unsigned
long based on the book-e doorbell code. The optional data is set via a
callback from the implementation and is passed to the new cause-ipi hook
along with the logical cpu number. While currently only the doorbell
implemntation uses this data it should be almost zero cost to retrieve and
pass it -- it adds a single register load for the argument from the same
cache line to which we just completed a store and the register is dead
on return from the call. I extended the data element from unsigned int
to unsigned long in case some other code wanted to associate a pointer.
The doorbell check_self is replaced by a call to smp_muxed_ipi_resend,
conditioned on the CPU_DBELL feature. The ifdef guard could be relaxed
to CONFIG_SMP but I left it with BOOKE for now.
Also, the doorbell interrupt vector for book-e was not calling irq_enter
and irq_exit, which throws off cpu accounting and causes code to not
realize it is running in interrupt context. Add the missing calls.
Signed-off-by: Milton Miller <miltonm@bga.com>
Signed-off-by: Benjamin Herrenschmidt <benh@kernel.crashing.org>
2011-05-11 02:29:39 +07:00
|
|
|
{
|
2017-04-13 17:16:21 +07:00
|
|
|
struct cpu_messages *info;
|
2015-12-18 03:59:03 +07:00
|
|
|
unsigned long all;
|
powerpc: Consolidate ipi message mux and demux
Consolidate the mux and demux of ipi messages into smp.c and call
a new smp_ops callback to actually trigger the ipi.
The powerpc architecture code is optimised for having 4 distinct
ipi triggers, which are mapped to 4 distinct messages (ipi many, ipi
single, scheduler ipi, and enter debugger). However, several interrupt
controllers only provide a single software triggered interrupt that
can be delivered to each cpu. To resolve this limitation, each smp_ops
implementation created a per-cpu variable that is manipulated with atomic
bitops. Since these lines will be contended they are optimialy marked as
shared_aligned and take a full cache line for each cpu. Distro kernels
may have 2 or 3 of these in their config, each taking per-cpu space
even though at most one will be in use.
This consolidation removes smp_message_recv and replaces the single call
actions cases with direct calls from the common message recognition loop.
The complicated debugger ipi case with its muxed crash handling code is
moved to debug_ipi_action which is now called from the demux code (instead
of the multi-message action calling smp_message_recv).
I put a call to reschedule_action to increase the likelyhood of correctly
merging the anticipated scheduler_ipi() hook coming from the scheduler
tree; that single required call can be inlined later.
The actual message decode is a copy of the old pseries xics code with its
memory barriers and cache line spacing, augmented with a per-cpu unsigned
long based on the book-e doorbell code. The optional data is set via a
callback from the implementation and is passed to the new cause-ipi hook
along with the logical cpu number. While currently only the doorbell
implemntation uses this data it should be almost zero cost to retrieve and
pass it -- it adds a single register load for the argument from the same
cache line to which we just completed a store and the register is dead
on return from the call. I extended the data element from unsigned int
to unsigned long in case some other code wanted to associate a pointer.
The doorbell check_self is replaced by a call to smp_muxed_ipi_resend,
conditioned on the CPU_DBELL feature. The ifdef guard could be relaxed
to CONFIG_SMP but I left it with BOOKE for now.
Also, the doorbell interrupt vector for book-e was not calling irq_enter
and irq_exit, which throws off cpu accounting and causes code to not
realize it is running in interrupt context. Add the missing calls.
Signed-off-by: Milton Miller <miltonm@bga.com>
Signed-off-by: Benjamin Herrenschmidt <benh@kernel.crashing.org>
2011-05-11 02:29:39 +07:00
|
|
|
|
2017-04-13 17:16:21 +07:00
|
|
|
info = this_cpu_ptr(&ipi_message);
|
2011-05-11 02:29:46 +07:00
|
|
|
do {
|
2012-09-05 01:33:08 +07:00
|
|
|
all = xchg(&info->messages, 0);
|
2015-12-22 05:22:51 +07:00
|
|
|
#if defined(CONFIG_KVM_XICS) && defined(CONFIG_KVM_BOOK3S_HV_POSSIBLE)
|
|
|
|
/*
|
|
|
|
* Must check for PPC_MSG_RM_HOST_ACTION messages
|
|
|
|
* before PPC_MSG_CALL_FUNCTION messages because when
|
|
|
|
* a VM is destroyed, we call kick_all_cpus_sync()
|
|
|
|
* to ensure that any pending PPC_MSG_RM_HOST_ACTION
|
|
|
|
* messages have completed before we free any VCPUs.
|
|
|
|
*/
|
|
|
|
if (all & IPI_MESSAGE(PPC_MSG_RM_HOST_ACTION))
|
|
|
|
kvmppc_xics_ipi_action();
|
|
|
|
#endif
|
2013-08-06 23:01:48 +07:00
|
|
|
if (all & IPI_MESSAGE(PPC_MSG_CALL_FUNCTION))
|
powerpc: Consolidate ipi message mux and demux
Consolidate the mux and demux of ipi messages into smp.c and call
a new smp_ops callback to actually trigger the ipi.
The powerpc architecture code is optimised for having 4 distinct
ipi triggers, which are mapped to 4 distinct messages (ipi many, ipi
single, scheduler ipi, and enter debugger). However, several interrupt
controllers only provide a single software triggered interrupt that
can be delivered to each cpu. To resolve this limitation, each smp_ops
implementation created a per-cpu variable that is manipulated with atomic
bitops. Since these lines will be contended they are optimialy marked as
shared_aligned and take a full cache line for each cpu. Distro kernels
may have 2 or 3 of these in their config, each taking per-cpu space
even though at most one will be in use.
This consolidation removes smp_message_recv and replaces the single call
actions cases with direct calls from the common message recognition loop.
The complicated debugger ipi case with its muxed crash handling code is
moved to debug_ipi_action which is now called from the demux code (instead
of the multi-message action calling smp_message_recv).
I put a call to reschedule_action to increase the likelyhood of correctly
merging the anticipated scheduler_ipi() hook coming from the scheduler
tree; that single required call can be inlined later.
The actual message decode is a copy of the old pseries xics code with its
memory barriers and cache line spacing, augmented with a per-cpu unsigned
long based on the book-e doorbell code. The optional data is set via a
callback from the implementation and is passed to the new cause-ipi hook
along with the logical cpu number. While currently only the doorbell
implemntation uses this data it should be almost zero cost to retrieve and
pass it -- it adds a single register load for the argument from the same
cache line to which we just completed a store and the register is dead
on return from the call. I extended the data element from unsigned int
to unsigned long in case some other code wanted to associate a pointer.
The doorbell check_self is replaced by a call to smp_muxed_ipi_resend,
conditioned on the CPU_DBELL feature. The ifdef guard could be relaxed
to CONFIG_SMP but I left it with BOOKE for now.
Also, the doorbell interrupt vector for book-e was not calling irq_enter
and irq_exit, which throws off cpu accounting and causes code to not
realize it is running in interrupt context. Add the missing calls.
Signed-off-by: Milton Miller <miltonm@bga.com>
Signed-off-by: Benjamin Herrenschmidt <benh@kernel.crashing.org>
2011-05-11 02:29:39 +07:00
|
|
|
generic_smp_call_function_interrupt();
|
2013-08-06 23:01:48 +07:00
|
|
|
if (all & IPI_MESSAGE(PPC_MSG_RESCHEDULE))
|
2011-05-20 12:36:52 +07:00
|
|
|
scheduler_ipi();
|
2018-05-05 00:19:33 +07:00
|
|
|
#ifdef CONFIG_GENERIC_CLOCKEVENTS_BROADCAST
|
2014-02-26 07:07:43 +07:00
|
|
|
if (all & IPI_MESSAGE(PPC_MSG_TICK_BROADCAST))
|
2018-05-05 00:19:31 +07:00
|
|
|
timer_broadcast_interrupt();
|
2018-05-05 00:19:33 +07:00
|
|
|
#endif
|
2016-12-20 01:30:08 +07:00
|
|
|
#ifdef CONFIG_NMI_IPI
|
|
|
|
if (all & IPI_MESSAGE(PPC_MSG_NMI_IPI))
|
|
|
|
nmi_ipi_action(0, NULL);
|
|
|
|
#endif
|
2011-05-11 02:29:46 +07:00
|
|
|
} while (info->messages);
|
|
|
|
|
powerpc: Consolidate ipi message mux and demux
Consolidate the mux and demux of ipi messages into smp.c and call
a new smp_ops callback to actually trigger the ipi.
The powerpc architecture code is optimised for having 4 distinct
ipi triggers, which are mapped to 4 distinct messages (ipi many, ipi
single, scheduler ipi, and enter debugger). However, several interrupt
controllers only provide a single software triggered interrupt that
can be delivered to each cpu. To resolve this limitation, each smp_ops
implementation created a per-cpu variable that is manipulated with atomic
bitops. Since these lines will be contended they are optimialy marked as
shared_aligned and take a full cache line for each cpu. Distro kernels
may have 2 or 3 of these in their config, each taking per-cpu space
even though at most one will be in use.
This consolidation removes smp_message_recv and replaces the single call
actions cases with direct calls from the common message recognition loop.
The complicated debugger ipi case with its muxed crash handling code is
moved to debug_ipi_action which is now called from the demux code (instead
of the multi-message action calling smp_message_recv).
I put a call to reschedule_action to increase the likelyhood of correctly
merging the anticipated scheduler_ipi() hook coming from the scheduler
tree; that single required call can be inlined later.
The actual message decode is a copy of the old pseries xics code with its
memory barriers and cache line spacing, augmented with a per-cpu unsigned
long based on the book-e doorbell code. The optional data is set via a
callback from the implementation and is passed to the new cause-ipi hook
along with the logical cpu number. While currently only the doorbell
implemntation uses this data it should be almost zero cost to retrieve and
pass it -- it adds a single register load for the argument from the same
cache line to which we just completed a store and the register is dead
on return from the call. I extended the data element from unsigned int
to unsigned long in case some other code wanted to associate a pointer.
The doorbell check_self is replaced by a call to smp_muxed_ipi_resend,
conditioned on the CPU_DBELL feature. The ifdef guard could be relaxed
to CONFIG_SMP but I left it with BOOKE for now.
Also, the doorbell interrupt vector for book-e was not calling irq_enter
and irq_exit, which throws off cpu accounting and causes code to not
realize it is running in interrupt context. Add the missing calls.
Signed-off-by: Milton Miller <miltonm@bga.com>
Signed-off-by: Benjamin Herrenschmidt <benh@kernel.crashing.org>
2011-05-11 02:29:39 +07:00
|
|
|
return IRQ_HANDLED;
|
|
|
|
}
|
2011-05-11 02:29:42 +07:00
|
|
|
#endif /* CONFIG_PPC_SMP_MUXED_IPI */
|
powerpc: Consolidate ipi message mux and demux
Consolidate the mux and demux of ipi messages into smp.c and call
a new smp_ops callback to actually trigger the ipi.
The powerpc architecture code is optimised for having 4 distinct
ipi triggers, which are mapped to 4 distinct messages (ipi many, ipi
single, scheduler ipi, and enter debugger). However, several interrupt
controllers only provide a single software triggered interrupt that
can be delivered to each cpu. To resolve this limitation, each smp_ops
implementation created a per-cpu variable that is manipulated with atomic
bitops. Since these lines will be contended they are optimialy marked as
shared_aligned and take a full cache line for each cpu. Distro kernels
may have 2 or 3 of these in their config, each taking per-cpu space
even though at most one will be in use.
This consolidation removes smp_message_recv and replaces the single call
actions cases with direct calls from the common message recognition loop.
The complicated debugger ipi case with its muxed crash handling code is
moved to debug_ipi_action which is now called from the demux code (instead
of the multi-message action calling smp_message_recv).
I put a call to reschedule_action to increase the likelyhood of correctly
merging the anticipated scheduler_ipi() hook coming from the scheduler
tree; that single required call can be inlined later.
The actual message decode is a copy of the old pseries xics code with its
memory barriers and cache line spacing, augmented with a per-cpu unsigned
long based on the book-e doorbell code. The optional data is set via a
callback from the implementation and is passed to the new cause-ipi hook
along with the logical cpu number. While currently only the doorbell
implemntation uses this data it should be almost zero cost to retrieve and
pass it -- it adds a single register load for the argument from the same
cache line to which we just completed a store and the register is dead
on return from the call. I extended the data element from unsigned int
to unsigned long in case some other code wanted to associate a pointer.
The doorbell check_self is replaced by a call to smp_muxed_ipi_resend,
conditioned on the CPU_DBELL feature. The ifdef guard could be relaxed
to CONFIG_SMP but I left it with BOOKE for now.
Also, the doorbell interrupt vector for book-e was not calling irq_enter
and irq_exit, which throws off cpu accounting and causes code to not
realize it is running in interrupt context. Add the missing calls.
Signed-off-by: Milton Miller <miltonm@bga.com>
Signed-off-by: Benjamin Herrenschmidt <benh@kernel.crashing.org>
2011-05-11 02:29:39 +07:00
|
|
|
|
2011-05-26 06:34:12 +07:00
|
|
|
static inline void do_message_pass(int cpu, int msg)
|
|
|
|
{
|
|
|
|
if (smp_ops->message_pass)
|
|
|
|
smp_ops->message_pass(cpu, msg);
|
|
|
|
#ifdef CONFIG_PPC_SMP_MUXED_IPI
|
|
|
|
else
|
|
|
|
smp_muxed_ipi_message_pass(cpu, msg);
|
|
|
|
#endif
|
|
|
|
}
|
|
|
|
|
2005-04-17 05:20:36 +07:00
|
|
|
void smp_send_reschedule(int cpu)
|
|
|
|
{
|
2006-07-04 11:09:36 +07:00
|
|
|
if (likely(smp_ops))
|
2011-05-26 06:34:12 +07:00
|
|
|
do_message_pass(cpu, PPC_MSG_RESCHEDULE);
|
2005-04-17 05:20:36 +07:00
|
|
|
}
|
KVM: PPC: Add support for Book3S processors in hypervisor mode
This adds support for KVM running on 64-bit Book 3S processors,
specifically POWER7, in hypervisor mode. Using hypervisor mode means
that the guest can use the processor's supervisor mode. That means
that the guest can execute privileged instructions and access privileged
registers itself without trapping to the host. This gives excellent
performance, but does mean that KVM cannot emulate a processor
architecture other than the one that the hardware implements.
This code assumes that the guest is running paravirtualized using the
PAPR (Power Architecture Platform Requirements) interface, which is the
interface that IBM's PowerVM hypervisor uses. That means that existing
Linux distributions that run on IBM pSeries machines will also run
under KVM without modification. In order to communicate the PAPR
hypercalls to qemu, this adds a new KVM_EXIT_PAPR_HCALL exit code
to include/linux/kvm.h.
Currently the choice between book3s_hv support and book3s_pr support
(i.e. the existing code, which runs the guest in user mode) has to be
made at kernel configuration time, so a given kernel binary can only
do one or the other.
This new book3s_hv code doesn't support MMIO emulation at present.
Since we are running paravirtualized guests, this isn't a serious
restriction.
With the guest running in supervisor mode, most exceptions go straight
to the guest. We will never get data or instruction storage or segment
interrupts, alignment interrupts, decrementer interrupts, program
interrupts, single-step interrupts, etc., coming to the hypervisor from
the guest. Therefore this introduces a new KVMTEST_NONHV macro for the
exception entry path so that we don't have to do the KVM test on entry
to those exception handlers.
We do however get hypervisor decrementer, hypervisor data storage,
hypervisor instruction storage, and hypervisor emulation assist
interrupts, so we have to handle those.
In hypervisor mode, real-mode accesses can access all of RAM, not just
a limited amount. Therefore we put all the guest state in the vcpu.arch
and use the shadow_vcpu in the PACA only for temporary scratch space.
We allocate the vcpu with kzalloc rather than vzalloc, and we don't use
anything in the kvmppc_vcpu_book3s struct, so we don't allocate it.
We don't have a shared page with the guest, but we still need a
kvm_vcpu_arch_shared struct to store the values of various registers,
so we include one in the vcpu_arch struct.
The POWER7 processor has a restriction that all threads in a core have
to be in the same partition. MMU-on kernel code counts as a partition
(partition 0), so we have to do a partition switch on every entry to and
exit from the guest. At present we require the host and guest to run
in single-thread mode because of this hardware restriction.
This code allocates a hashed page table for the guest and initializes
it with HPTEs for the guest's Virtual Real Memory Area (VRMA). We
require that the guest memory is allocated using 16MB huge pages, in
order to simplify the low-level memory management. This also means that
we can get away without tracking paging activity in the host for now,
since huge pages can't be paged or swapped.
This also adds a few new exports needed by the book3s_hv code.
Signed-off-by: Paul Mackerras <paulus@samba.org>
Signed-off-by: Alexander Graf <agraf@suse.de>
2011-06-29 07:21:34 +07:00
|
|
|
EXPORT_SYMBOL_GPL(smp_send_reschedule);
|
2005-04-17 05:20:36 +07:00
|
|
|
|
2008-06-26 16:22:13 +07:00
|
|
|
void arch_send_call_function_single_ipi(int cpu)
|
|
|
|
{
|
2014-02-26 07:07:29 +07:00
|
|
|
do_message_pass(cpu, PPC_MSG_CALL_FUNCTION);
|
2008-06-26 16:22:13 +07:00
|
|
|
}
|
|
|
|
|
2009-09-24 22:34:45 +07:00
|
|
|
void arch_send_call_function_ipi_mask(const struct cpumask *mask)
|
2008-06-26 16:22:13 +07:00
|
|
|
{
|
|
|
|
unsigned int cpu;
|
|
|
|
|
2009-09-24 22:34:45 +07:00
|
|
|
for_each_cpu(cpu, mask)
|
2011-05-26 06:34:12 +07:00
|
|
|
do_message_pass(cpu, PPC_MSG_CALL_FUNCTION);
|
2008-06-26 16:22:13 +07:00
|
|
|
}
|
|
|
|
|
2016-12-20 01:30:08 +07:00
|
|
|
#ifdef CONFIG_NMI_IPI
|
|
|
|
|
|
|
|
/*
|
|
|
|
* "NMI IPI" system.
|
|
|
|
*
|
|
|
|
* NMI IPIs may not be recoverable, so should not be used as ongoing part of
|
|
|
|
* a running system. They can be used for crash, debug, halt/reboot, etc.
|
|
|
|
*
|
|
|
|
* NMI IPIs are globally single threaded. No more than one in progress at
|
|
|
|
* any time.
|
|
|
|
*
|
|
|
|
* The IPI call waits with interrupts disabled until all targets enter the
|
|
|
|
* NMI handler, then the call returns.
|
|
|
|
*
|
|
|
|
* No new NMI can be initiated until targets exit the handler.
|
|
|
|
*
|
|
|
|
* The IPI call may time out without all targets entering the NMI handler.
|
|
|
|
* In that case, there is some logic to recover (and ignore subsequent
|
|
|
|
* NMI interrupts that may eventually be raised), but the platform interrupt
|
|
|
|
* handler may not be able to distinguish this from other exception causes,
|
|
|
|
* which may cause a crash.
|
|
|
|
*/
|
|
|
|
|
|
|
|
static atomic_t __nmi_ipi_lock = ATOMIC_INIT(0);
|
|
|
|
static struct cpumask nmi_ipi_pending_mask;
|
|
|
|
static int nmi_ipi_busy_count = 0;
|
|
|
|
static void (*nmi_ipi_function)(struct pt_regs *) = NULL;
|
|
|
|
|
|
|
|
static void nmi_ipi_lock_start(unsigned long *flags)
|
|
|
|
{
|
|
|
|
raw_local_irq_save(*flags);
|
|
|
|
hard_irq_disable();
|
|
|
|
while (atomic_cmpxchg(&__nmi_ipi_lock, 0, 1) == 1) {
|
|
|
|
raw_local_irq_restore(*flags);
|
2017-08-09 19:41:21 +07:00
|
|
|
spin_until_cond(atomic_read(&__nmi_ipi_lock) == 0);
|
2016-12-20 01:30:08 +07:00
|
|
|
raw_local_irq_save(*flags);
|
|
|
|
hard_irq_disable();
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
static void nmi_ipi_lock(void)
|
|
|
|
{
|
|
|
|
while (atomic_cmpxchg(&__nmi_ipi_lock, 0, 1) == 1)
|
2017-08-09 19:41:21 +07:00
|
|
|
spin_until_cond(atomic_read(&__nmi_ipi_lock) == 0);
|
2016-12-20 01:30:08 +07:00
|
|
|
}
|
|
|
|
|
|
|
|
static void nmi_ipi_unlock(void)
|
|
|
|
{
|
|
|
|
smp_mb();
|
|
|
|
WARN_ON(atomic_read(&__nmi_ipi_lock) != 1);
|
|
|
|
atomic_set(&__nmi_ipi_lock, 0);
|
|
|
|
}
|
|
|
|
|
|
|
|
static void nmi_ipi_unlock_end(unsigned long *flags)
|
|
|
|
{
|
|
|
|
nmi_ipi_unlock();
|
|
|
|
raw_local_irq_restore(*flags);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Platform NMI handler calls this to ack
|
|
|
|
*/
|
|
|
|
int smp_handle_nmi_ipi(struct pt_regs *regs)
|
|
|
|
{
|
|
|
|
void (*fn)(struct pt_regs *);
|
|
|
|
unsigned long flags;
|
|
|
|
int me = raw_smp_processor_id();
|
|
|
|
int ret = 0;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Unexpected NMIs are possible here because the interrupt may not
|
|
|
|
* be able to distinguish NMI IPIs from other types of NMIs, or
|
|
|
|
* because the caller may have timed out.
|
|
|
|
*/
|
|
|
|
nmi_ipi_lock_start(&flags);
|
|
|
|
if (!nmi_ipi_busy_count)
|
|
|
|
goto out;
|
|
|
|
if (!cpumask_test_cpu(me, &nmi_ipi_pending_mask))
|
|
|
|
goto out;
|
|
|
|
|
|
|
|
fn = nmi_ipi_function;
|
|
|
|
if (!fn)
|
|
|
|
goto out;
|
|
|
|
|
|
|
|
cpumask_clear_cpu(me, &nmi_ipi_pending_mask);
|
|
|
|
nmi_ipi_busy_count++;
|
|
|
|
nmi_ipi_unlock();
|
|
|
|
|
|
|
|
ret = 1;
|
|
|
|
|
|
|
|
fn(regs);
|
|
|
|
|
|
|
|
nmi_ipi_lock();
|
2018-04-25 12:17:59 +07:00
|
|
|
if (nmi_ipi_busy_count > 1) /* Can race with caller time-out */
|
|
|
|
nmi_ipi_busy_count--;
|
2016-12-20 01:30:08 +07:00
|
|
|
out:
|
|
|
|
nmi_ipi_unlock_end(&flags);
|
|
|
|
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
2018-05-02 20:07:27 +07:00
|
|
|
static void do_smp_send_nmi_ipi(int cpu, bool safe)
|
2016-12-20 01:30:08 +07:00
|
|
|
{
|
2018-05-02 20:07:27 +07:00
|
|
|
if (!safe && smp_ops->cause_nmi_ipi && smp_ops->cause_nmi_ipi(cpu))
|
2016-12-20 01:30:09 +07:00
|
|
|
return;
|
|
|
|
|
2016-12-20 01:30:08 +07:00
|
|
|
if (cpu >= 0) {
|
|
|
|
do_message_pass(cpu, PPC_MSG_NMI_IPI);
|
|
|
|
} else {
|
|
|
|
int c;
|
|
|
|
|
|
|
|
for_each_online_cpu(c) {
|
|
|
|
if (c == raw_smp_processor_id())
|
|
|
|
continue;
|
|
|
|
do_message_pass(c, PPC_MSG_NMI_IPI);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* - cpu is the target CPU (must not be this CPU), or NMI_IPI_ALL_OTHERS.
|
|
|
|
* - fn is the target callback function.
|
|
|
|
* - delay_us > 0 is the delay before giving up waiting for targets to
|
2018-04-25 12:17:59 +07:00
|
|
|
* complete executing the handler, == 0 specifies indefinite delay.
|
2016-12-20 01:30:08 +07:00
|
|
|
*/
|
2018-05-02 20:07:27 +07:00
|
|
|
int __smp_send_nmi_ipi(int cpu, void (*fn)(struct pt_regs *), u64 delay_us, bool safe)
|
2016-12-20 01:30:08 +07:00
|
|
|
{
|
|
|
|
unsigned long flags;
|
|
|
|
int me = raw_smp_processor_id();
|
|
|
|
int ret = 1;
|
|
|
|
|
|
|
|
BUG_ON(cpu == me);
|
|
|
|
BUG_ON(cpu < 0 && cpu != NMI_IPI_ALL_OTHERS);
|
|
|
|
|
|
|
|
if (unlikely(!smp_ops))
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
/* Take the nmi_ipi_busy count/lock with interrupts hard disabled */
|
|
|
|
nmi_ipi_lock_start(&flags);
|
|
|
|
while (nmi_ipi_busy_count) {
|
|
|
|
nmi_ipi_unlock_end(&flags);
|
2017-08-09 19:41:21 +07:00
|
|
|
spin_until_cond(nmi_ipi_busy_count == 0);
|
2016-12-20 01:30:08 +07:00
|
|
|
nmi_ipi_lock_start(&flags);
|
|
|
|
}
|
|
|
|
|
|
|
|
nmi_ipi_function = fn;
|
|
|
|
|
|
|
|
if (cpu < 0) {
|
|
|
|
/* ALL_OTHERS */
|
|
|
|
cpumask_copy(&nmi_ipi_pending_mask, cpu_online_mask);
|
|
|
|
cpumask_clear_cpu(me, &nmi_ipi_pending_mask);
|
|
|
|
} else {
|
|
|
|
/* cpumask starts clear */
|
|
|
|
cpumask_set_cpu(cpu, &nmi_ipi_pending_mask);
|
|
|
|
}
|
|
|
|
nmi_ipi_busy_count++;
|
|
|
|
nmi_ipi_unlock();
|
|
|
|
|
2018-05-02 20:07:27 +07:00
|
|
|
do_smp_send_nmi_ipi(cpu, safe);
|
2016-12-20 01:30:08 +07:00
|
|
|
|
2018-04-25 12:17:59 +07:00
|
|
|
nmi_ipi_lock();
|
|
|
|
/* nmi_ipi_busy_count is held here, so unlock/lock is okay */
|
2016-12-20 01:30:08 +07:00
|
|
|
while (!cpumask_empty(&nmi_ipi_pending_mask)) {
|
2018-04-25 12:17:59 +07:00
|
|
|
nmi_ipi_unlock();
|
2016-12-20 01:30:08 +07:00
|
|
|
udelay(1);
|
2018-04-25 12:17:59 +07:00
|
|
|
nmi_ipi_lock();
|
|
|
|
if (delay_us) {
|
|
|
|
delay_us--;
|
|
|
|
if (!delay_us)
|
2018-11-26 09:01:05 +07:00
|
|
|
goto timeout;
|
2018-04-25 12:17:59 +07:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
while (nmi_ipi_busy_count > 1) {
|
|
|
|
nmi_ipi_unlock();
|
|
|
|
udelay(1);
|
|
|
|
nmi_ipi_lock();
|
2016-12-20 01:30:08 +07:00
|
|
|
if (delay_us) {
|
|
|
|
delay_us--;
|
|
|
|
if (!delay_us)
|
2018-11-26 09:01:05 +07:00
|
|
|
goto timeout;
|
2016-12-20 01:30:08 +07:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2018-11-26 09:01:05 +07:00
|
|
|
timeout:
|
2016-12-20 01:30:08 +07:00
|
|
|
if (!cpumask_empty(&nmi_ipi_pending_mask)) {
|
2018-04-25 12:17:59 +07:00
|
|
|
/* Timeout waiting for CPUs to call smp_handle_nmi_ipi */
|
2016-12-20 01:30:08 +07:00
|
|
|
ret = 0;
|
|
|
|
cpumask_clear(&nmi_ipi_pending_mask);
|
|
|
|
}
|
2018-04-25 12:17:59 +07:00
|
|
|
if (nmi_ipi_busy_count > 1) {
|
|
|
|
/* Timeout waiting for CPUs to execute fn */
|
|
|
|
ret = 0;
|
|
|
|
nmi_ipi_busy_count = 1;
|
|
|
|
}
|
|
|
|
|
2016-12-20 01:30:08 +07:00
|
|
|
nmi_ipi_busy_count--;
|
|
|
|
nmi_ipi_unlock_end(&flags);
|
|
|
|
|
|
|
|
return ret;
|
|
|
|
}
|
2018-05-02 20:07:27 +07:00
|
|
|
|
|
|
|
int smp_send_nmi_ipi(int cpu, void (*fn)(struct pt_regs *), u64 delay_us)
|
|
|
|
{
|
|
|
|
return __smp_send_nmi_ipi(cpu, fn, delay_us, false);
|
|
|
|
}
|
|
|
|
|
|
|
|
int smp_send_safe_nmi_ipi(int cpu, void (*fn)(struct pt_regs *), u64 delay_us)
|
|
|
|
{
|
|
|
|
return __smp_send_nmi_ipi(cpu, fn, delay_us, true);
|
|
|
|
}
|
2016-12-20 01:30:08 +07:00
|
|
|
#endif /* CONFIG_NMI_IPI */
|
|
|
|
|
2014-02-26 07:07:43 +07:00
|
|
|
#ifdef CONFIG_GENERIC_CLOCKEVENTS_BROADCAST
|
|
|
|
void tick_broadcast(const struct cpumask *mask)
|
|
|
|
{
|
|
|
|
unsigned int cpu;
|
|
|
|
|
|
|
|
for_each_cpu(cpu, mask)
|
|
|
|
do_message_pass(cpu, PPC_MSG_TICK_BROADCAST);
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
2016-12-20 01:30:08 +07:00
|
|
|
#ifdef CONFIG_DEBUGGER
|
|
|
|
void debugger_ipi_callback(struct pt_regs *regs)
|
2005-04-17 05:20:36 +07:00
|
|
|
{
|
2016-12-20 01:30:08 +07:00
|
|
|
debugger_ipi(regs);
|
|
|
|
}
|
2011-05-11 02:29:06 +07:00
|
|
|
|
2016-12-20 01:30:08 +07:00
|
|
|
void smp_send_debugger_break(void)
|
|
|
|
{
|
|
|
|
smp_send_nmi_ipi(NMI_IPI_ALL_OTHERS, debugger_ipi_callback, 1000000);
|
2005-04-17 05:20:36 +07:00
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
2016-11-29 19:45:50 +07:00
|
|
|
#ifdef CONFIG_KEXEC_CORE
|
2005-12-04 14:39:43 +07:00
|
|
|
void crash_send_ipi(void (*crash_ipi_callback)(struct pt_regs *))
|
|
|
|
{
|
2017-12-15 15:14:55 +07:00
|
|
|
int cpu;
|
|
|
|
|
2016-12-20 01:30:08 +07:00
|
|
|
smp_send_nmi_ipi(NMI_IPI_ALL_OTHERS, crash_ipi_callback, 1000000);
|
2017-12-15 15:14:55 +07:00
|
|
|
if (kdump_in_progress() && crash_wake_offline) {
|
|
|
|
for_each_present_cpu(cpu) {
|
|
|
|
if (cpu_online(cpu))
|
|
|
|
continue;
|
|
|
|
/*
|
|
|
|
* crash_ipi_callback will wait for
|
|
|
|
* all cpus, including offline CPUs.
|
|
|
|
* We don't care about nmi_ipi_function.
|
|
|
|
* Offline cpus will jump straight into
|
|
|
|
* crash_ipi_callback, we can skip the
|
|
|
|
* entire NMI dance and waiting for
|
|
|
|
* cpus to clear pending mask, etc.
|
|
|
|
*/
|
2018-05-02 20:07:27 +07:00
|
|
|
do_smp_send_nmi_ipi(cpu, false);
|
2017-12-15 15:14:55 +07:00
|
|
|
}
|
|
|
|
}
|
2005-12-04 14:39:43 +07:00
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
2018-04-25 09:17:53 +07:00
|
|
|
#ifdef CONFIG_NMI_IPI
|
|
|
|
static void nmi_stop_this_cpu(struct pt_regs *regs)
|
|
|
|
{
|
|
|
|
/*
|
|
|
|
* This is a special case because it never returns, so the NMI IPI
|
|
|
|
* handling would never mark it as done, which makes any later
|
|
|
|
* smp_send_nmi_ipi() call spin forever. Mark it done now.
|
2018-04-27 08:51:59 +07:00
|
|
|
*
|
|
|
|
* IRQs are already hard disabled by the smp_handle_nmi_ipi.
|
2018-04-25 09:17:53 +07:00
|
|
|
*/
|
|
|
|
nmi_ipi_lock();
|
2018-04-25 12:17:59 +07:00
|
|
|
if (nmi_ipi_busy_count > 1)
|
|
|
|
nmi_ipi_busy_count--;
|
2018-04-25 09:17:53 +07:00
|
|
|
nmi_ipi_unlock();
|
|
|
|
|
2018-04-27 08:51:59 +07:00
|
|
|
spin_begin();
|
|
|
|
while (1)
|
|
|
|
spin_cpu_relax();
|
2018-04-25 09:17:53 +07:00
|
|
|
}
|
|
|
|
|
2007-09-18 06:43:40 +07:00
|
|
|
void smp_send_stop(void)
|
|
|
|
{
|
2018-04-25 09:17:53 +07:00
|
|
|
smp_send_nmi_ipi(NMI_IPI_ALL_OTHERS, nmi_stop_this_cpu, 1000000);
|
2018-04-27 08:51:59 +07:00
|
|
|
}
|
|
|
|
|
|
|
|
#else /* CONFIG_NMI_IPI */
|
|
|
|
|
|
|
|
static void stop_this_cpu(void *dummy)
|
|
|
|
{
|
|
|
|
hard_irq_disable();
|
|
|
|
spin_begin();
|
|
|
|
while (1)
|
|
|
|
spin_cpu_relax();
|
|
|
|
}
|
|
|
|
|
|
|
|
void smp_send_stop(void)
|
|
|
|
{
|
|
|
|
static bool stopped = false;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Prevent waiting on csd lock from a previous smp_send_stop.
|
|
|
|
* This is racy, but in general callers try to do the right
|
|
|
|
* thing and only fire off one smp_send_stop (e.g., see
|
|
|
|
* kernel/panic.c)
|
|
|
|
*/
|
|
|
|
if (stopped)
|
|
|
|
return;
|
|
|
|
|
|
|
|
stopped = true;
|
|
|
|
|
2008-06-06 16:18:06 +07:00
|
|
|
smp_call_function(stop_this_cpu, NULL, 0);
|
2005-04-17 05:20:36 +07:00
|
|
|
}
|
2018-04-27 08:51:59 +07:00
|
|
|
#endif /* CONFIG_NMI_IPI */
|
2005-04-17 05:20:36 +07:00
|
|
|
|
|
|
|
struct thread_info *current_set[NR_CPUS];
|
|
|
|
|
2012-12-22 05:04:10 +07:00
|
|
|
static void smp_store_cpu_info(int id)
|
2005-04-17 05:20:36 +07:00
|
|
|
{
|
2009-10-29 20:34:14 +07:00
|
|
|
per_cpu(cpu_pvr, id) = mfspr(SPRN_PVR);
|
2011-06-29 02:54:47 +07:00
|
|
|
#ifdef CONFIG_PPC_FSL_BOOK3E
|
|
|
|
per_cpu(next_tlbcam_idx, id)
|
|
|
|
= (mfspr(SPRN_TLB1CFG) & TLBnCFG_N_ENTRY) - 1;
|
|
|
|
#endif
|
2005-04-17 05:20:36 +07:00
|
|
|
}
|
|
|
|
|
2017-06-29 14:12:54 +07:00
|
|
|
/*
|
|
|
|
* Relationships between CPUs are maintained in a set of per-cpu cpumasks so
|
|
|
|
* rather than just passing around the cpumask we pass around a function that
|
|
|
|
* returns the that cpumask for the given CPU.
|
|
|
|
*/
|
|
|
|
static void set_cpus_related(int i, int j, struct cpumask *(*get_cpumask)(int))
|
|
|
|
{
|
|
|
|
cpumask_set_cpu(i, get_cpumask(j));
|
|
|
|
cpumask_set_cpu(j, get_cpumask(i));
|
|
|
|
}
|
|
|
|
|
|
|
|
#ifdef CONFIG_HOTPLUG_CPU
|
|
|
|
static void set_cpus_unrelated(int i, int j,
|
|
|
|
struct cpumask *(*get_cpumask)(int))
|
|
|
|
{
|
|
|
|
cpumask_clear_cpu(i, get_cpumask(j));
|
|
|
|
cpumask_clear_cpu(j, get_cpumask(i));
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
2018-10-11 12:33:01 +07:00
|
|
|
/*
|
|
|
|
* parse_thread_groups: Parses the "ibm,thread-groups" device tree
|
|
|
|
* property for the CPU device node @dn and stores
|
|
|
|
* the parsed output in the thread_groups
|
|
|
|
* structure @tg if the ibm,thread-groups[0]
|
|
|
|
* matches @property.
|
|
|
|
*
|
|
|
|
* @dn: The device node of the CPU device.
|
|
|
|
* @tg: Pointer to a thread group structure into which the parsed
|
|
|
|
* output of "ibm,thread-groups" is stored.
|
|
|
|
* @property: The property of the thread-group that the caller is
|
|
|
|
* interested in.
|
|
|
|
*
|
|
|
|
* ibm,thread-groups[0..N-1] array defines which group of threads in
|
|
|
|
* the CPU-device node can be grouped together based on the property.
|
|
|
|
*
|
|
|
|
* ibm,thread-groups[0] tells us the property based on which the
|
|
|
|
* threads are being grouped together. If this value is 1, it implies
|
|
|
|
* that the threads in the same group share L1, translation cache.
|
|
|
|
*
|
|
|
|
* ibm,thread-groups[1] tells us how many such thread groups exist.
|
|
|
|
*
|
|
|
|
* ibm,thread-groups[2] tells us the number of threads in each such
|
|
|
|
* group.
|
|
|
|
*
|
|
|
|
* ibm,thread-groups[3..N-1] is the list of threads identified by
|
|
|
|
* "ibm,ppc-interrupt-server#s" arranged as per their membership in
|
|
|
|
* the grouping.
|
|
|
|
*
|
|
|
|
* Example: If ibm,thread-groups = [1,2,4,5,6,7,8,9,10,11,12] it
|
|
|
|
* implies that there are 2 groups of 4 threads each, where each group
|
|
|
|
* of threads share L1, translation cache.
|
|
|
|
*
|
|
|
|
* The "ibm,ppc-interrupt-server#s" of the first group is {5,6,7,8}
|
|
|
|
* and the "ibm,ppc-interrupt-server#s" of the second group is {9, 10,
|
|
|
|
* 11, 12} structure
|
|
|
|
*
|
|
|
|
* Returns 0 on success, -EINVAL if the property does not exist,
|
|
|
|
* -ENODATA if property does not have a value, and -EOVERFLOW if the
|
|
|
|
* property data isn't large enough.
|
|
|
|
*/
|
|
|
|
static int parse_thread_groups(struct device_node *dn,
|
|
|
|
struct thread_groups *tg,
|
|
|
|
unsigned int property)
|
|
|
|
{
|
|
|
|
int i;
|
|
|
|
u32 thread_group_array[3 + MAX_THREAD_LIST_SIZE];
|
|
|
|
u32 *thread_list;
|
|
|
|
size_t total_threads;
|
|
|
|
int ret;
|
|
|
|
|
|
|
|
ret = of_property_read_u32_array(dn, "ibm,thread-groups",
|
|
|
|
thread_group_array, 3);
|
|
|
|
if (ret)
|
|
|
|
return ret;
|
|
|
|
|
|
|
|
tg->property = thread_group_array[0];
|
|
|
|
tg->nr_groups = thread_group_array[1];
|
|
|
|
tg->threads_per_group = thread_group_array[2];
|
|
|
|
if (tg->property != property ||
|
|
|
|
tg->nr_groups < 1 ||
|
|
|
|
tg->threads_per_group < 1)
|
|
|
|
return -ENODATA;
|
|
|
|
|
|
|
|
total_threads = tg->nr_groups * tg->threads_per_group;
|
|
|
|
|
|
|
|
ret = of_property_read_u32_array(dn, "ibm,thread-groups",
|
|
|
|
thread_group_array,
|
|
|
|
3 + total_threads);
|
|
|
|
if (ret)
|
|
|
|
return ret;
|
|
|
|
|
|
|
|
thread_list = &thread_group_array[3];
|
|
|
|
|
|
|
|
for (i = 0 ; i < total_threads; i++)
|
|
|
|
tg->thread_list[i] = thread_list[i];
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* get_cpu_thread_group_start : Searches the thread group in tg->thread_list
|
|
|
|
* that @cpu belongs to.
|
|
|
|
*
|
|
|
|
* @cpu : The logical CPU whose thread group is being searched.
|
|
|
|
* @tg : The thread-group structure of the CPU node which @cpu belongs
|
|
|
|
* to.
|
|
|
|
*
|
|
|
|
* Returns the index to tg->thread_list that points to the the start
|
|
|
|
* of the thread_group that @cpu belongs to.
|
|
|
|
*
|
|
|
|
* Returns -1 if cpu doesn't belong to any of the groups pointed to by
|
|
|
|
* tg->thread_list.
|
|
|
|
*/
|
|
|
|
static int get_cpu_thread_group_start(int cpu, struct thread_groups *tg)
|
|
|
|
{
|
|
|
|
int hw_cpu_id = get_hard_smp_processor_id(cpu);
|
|
|
|
int i, j;
|
|
|
|
|
|
|
|
for (i = 0; i < tg->nr_groups; i++) {
|
|
|
|
int group_start = i * tg->threads_per_group;
|
|
|
|
|
|
|
|
for (j = 0; j < tg->threads_per_group; j++) {
|
|
|
|
int idx = group_start + j;
|
|
|
|
|
|
|
|
if (tg->thread_list[idx] == hw_cpu_id)
|
|
|
|
return group_start;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int init_cpu_l1_cache_map(int cpu)
|
|
|
|
|
|
|
|
{
|
|
|
|
struct device_node *dn = of_get_cpu_node(cpu, NULL);
|
|
|
|
struct thread_groups tg = {.property = 0,
|
|
|
|
.nr_groups = 0,
|
|
|
|
.threads_per_group = 0};
|
|
|
|
int first_thread = cpu_first_thread_sibling(cpu);
|
|
|
|
int i, cpu_group_start = -1, err = 0;
|
|
|
|
|
|
|
|
if (!dn)
|
|
|
|
return -ENODATA;
|
|
|
|
|
|
|
|
err = parse_thread_groups(dn, &tg, THREAD_GROUP_SHARE_L1);
|
|
|
|
if (err)
|
|
|
|
goto out;
|
|
|
|
|
|
|
|
zalloc_cpumask_var_node(&per_cpu(cpu_l1_cache_map, cpu),
|
|
|
|
GFP_KERNEL,
|
|
|
|
cpu_to_node(cpu));
|
|
|
|
|
|
|
|
cpu_group_start = get_cpu_thread_group_start(cpu, &tg);
|
|
|
|
|
|
|
|
if (unlikely(cpu_group_start == -1)) {
|
|
|
|
WARN_ON_ONCE(1);
|
|
|
|
err = -ENODATA;
|
|
|
|
goto out;
|
|
|
|
}
|
|
|
|
|
|
|
|
for (i = first_thread; i < first_thread + threads_per_core; i++) {
|
|
|
|
int i_group_start = get_cpu_thread_group_start(i, &tg);
|
|
|
|
|
|
|
|
if (unlikely(i_group_start == -1)) {
|
|
|
|
WARN_ON_ONCE(1);
|
|
|
|
err = -ENODATA;
|
|
|
|
goto out;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (i_group_start == cpu_group_start)
|
|
|
|
cpumask_set_cpu(i, per_cpu(cpu_l1_cache_map, cpu));
|
|
|
|
}
|
|
|
|
|
|
|
|
out:
|
|
|
|
of_node_put(dn);
|
|
|
|
return err;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int init_big_cores(void)
|
|
|
|
{
|
|
|
|
int cpu;
|
|
|
|
|
|
|
|
for_each_possible_cpu(cpu) {
|
|
|
|
int err = init_cpu_l1_cache_map(cpu);
|
|
|
|
|
|
|
|
if (err)
|
|
|
|
return err;
|
|
|
|
|
|
|
|
zalloc_cpumask_var_node(&per_cpu(cpu_smallcore_map, cpu),
|
|
|
|
GFP_KERNEL,
|
|
|
|
cpu_to_node(cpu));
|
|
|
|
}
|
|
|
|
|
|
|
|
has_big_cores = true;
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2005-04-17 05:20:36 +07:00
|
|
|
void __init smp_prepare_cpus(unsigned int max_cpus)
|
|
|
|
{
|
|
|
|
unsigned int cpu;
|
|
|
|
|
|
|
|
DBG("smp_prepare_cpus\n");
|
|
|
|
|
|
|
|
/*
|
|
|
|
* setup_cpu may need to be called on the boot cpu. We havent
|
|
|
|
* spun any cpus up but lets be paranoid.
|
|
|
|
*/
|
|
|
|
BUG_ON(boot_cpuid != smp_processor_id());
|
|
|
|
|
|
|
|
/* Fixup boot cpu */
|
|
|
|
smp_store_cpu_info(boot_cpuid);
|
|
|
|
cpu_callin_map[boot_cpuid] = 1;
|
|
|
|
|
2010-04-26 22:32:41 +07:00
|
|
|
for_each_possible_cpu(cpu) {
|
|
|
|
zalloc_cpumask_var_node(&per_cpu(cpu_sibling_map, cpu),
|
|
|
|
GFP_KERNEL, cpu_to_node(cpu));
|
2017-06-29 14:12:55 +07:00
|
|
|
zalloc_cpumask_var_node(&per_cpu(cpu_l2_cache_map, cpu),
|
|
|
|
GFP_KERNEL, cpu_to_node(cpu));
|
2010-04-26 22:32:41 +07:00
|
|
|
zalloc_cpumask_var_node(&per_cpu(cpu_core_map, cpu),
|
|
|
|
GFP_KERNEL, cpu_to_node(cpu));
|
powerpc: reorder per-cpu NUMA information's initialization
There is an issue currently where NUMA information is used on powerpc
(and possibly ia64) before it has been read from the device-tree, which
leads to large slab consumption with CONFIG_SLUB and memoryless nodes.
NUMA powerpc non-boot CPU's cpu_to_node/cpu_to_mem is only accurate
after start_secondary(), similar to ia64, which is invoked via
smp_init().
Commit 6ee0578b4daae ("workqueue: mark init_workqueues() as
early_initcall()") made init_workqueues() be invoked via
do_pre_smp_initcalls(), which is obviously before the secondary
processors are online.
Additionally, the following commits changed init_workqueues() to use
cpu_to_node to determine the node to use for kthread_create_on_node:
bce903809ab3f ("workqueue: add wq_numa_tbl_len and
wq_numa_possible_cpumask[]")
f3f90ad469342 ("workqueue: determine NUMA node of workers accourding to
the allowed cpumask")
Therefore, when init_workqueues() runs, it sees all CPUs as being on
Node 0. On LPARs or KVM guests where Node 0 is memoryless, this leads to
a high number of slab deactivations
(http://www.spinics.net/lists/linux-mm/msg67489.html).
Fix this by initializing the powerpc-specific CPU<->node/local memory
node mapping as early as possible, which on powerpc is
do_init_bootmem(). Currently that function initializes the mapping for
the boot CPU, but we extend it to setup the mapping for all possible
CPUs. Then, in smp_prepare_cpus(), we can correspondingly set the
per-cpu values for all possible CPUs. That ensures that before the
early_initcalls run (and really as early as possible), the per-cpu NUMA
mapping is accurate.
While testing memoryless nodes on PowerKVM guests with a fix to the
workqueue logic to use cpu_to_mem() instead of cpu_to_node(), with a
guest topology of:
available: 2 nodes (0-1)
node 0 cpus: 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49
node 0 size: 0 MB
node 0 free: 0 MB
node 1 cpus: 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99
node 1 size: 16336 MB
node 1 free: 15329 MB
node distances:
node 0 1
0: 10 40
1: 40 10
the slab consumption decreases from
Slab: 932416 kB
SUnreclaim: 902336 kB
to
Slab: 395264 kB
SUnreclaim: 359424 kB
And we a corresponding increase in the slab efficiency from
slab mem objs slabs
used active active
------------------------------------------------------------
kmalloc-16384 337 MB 11.28% 100.00%
task_struct 288 MB 9.93% 100.00%
to
slab mem objs slabs
used active active
------------------------------------------------------------
kmalloc-16384 37 MB 100.00% 100.00%
task_struct 31 MB 100.00% 100.00%
Powerpc didn't support memoryless nodes until recently (64bb80d87f01
"powerpc/numa: Enable CONFIG_HAVE_MEMORYLESS_NODES" and 8c272261194d
"powerpc/numa: Enable USE_PERCPU_NUMA_NODE_ID"). Those commits also
helped improve memory consumption with these kind of environments.
Signed-off-by: Nishanth Aravamudan <nacc@linux.vnet.ibm.com>
Signed-off-by: Benjamin Herrenschmidt <benh@kernel.crashing.org>
2014-07-18 06:15:12 +07:00
|
|
|
/*
|
|
|
|
* numa_node_id() works after this.
|
|
|
|
*/
|
2014-08-27 16:34:00 +07:00
|
|
|
if (cpu_present(cpu)) {
|
|
|
|
set_cpu_numa_node(cpu, numa_cpu_lookup_table[cpu]);
|
|
|
|
set_cpu_numa_mem(cpu,
|
|
|
|
local_memory_node(numa_cpu_lookup_table[cpu]));
|
|
|
|
}
|
2010-04-26 22:32:41 +07:00
|
|
|
}
|
|
|
|
|
2017-06-29 14:12:54 +07:00
|
|
|
/* Init the cpumasks so the boot CPU is related to itself */
|
2010-04-26 22:32:41 +07:00
|
|
|
cpumask_set_cpu(boot_cpuid, cpu_sibling_mask(boot_cpuid));
|
2017-06-29 14:12:55 +07:00
|
|
|
cpumask_set_cpu(boot_cpuid, cpu_l2_cache_mask(boot_cpuid));
|
2010-04-26 22:32:41 +07:00
|
|
|
cpumask_set_cpu(boot_cpuid, cpu_core_mask(boot_cpuid));
|
|
|
|
|
2018-10-11 12:33:01 +07:00
|
|
|
init_big_cores();
|
|
|
|
if (has_big_cores) {
|
|
|
|
cpumask_set_cpu(boot_cpuid,
|
|
|
|
cpu_smallcore_mask(boot_cpuid));
|
|
|
|
}
|
|
|
|
|
2013-07-22 13:40:20 +07:00
|
|
|
if (smp_ops && smp_ops->probe)
|
|
|
|
smp_ops->probe();
|
2005-04-17 05:20:36 +07:00
|
|
|
}
|
|
|
|
|
2012-12-22 05:04:10 +07:00
|
|
|
void smp_prepare_boot_cpu(void)
|
2005-04-17 05:20:36 +07:00
|
|
|
{
|
|
|
|
BUG_ON(smp_processor_id() != boot_cpuid);
|
2005-11-05 06:33:55 +07:00
|
|
|
#ifdef CONFIG_PPC64
|
2018-02-13 22:08:12 +07:00
|
|
|
paca_ptrs[boot_cpuid]->__current = current;
|
2005-11-05 06:33:55 +07:00
|
|
|
#endif
|
2014-05-20 01:14:23 +07:00
|
|
|
set_numa_node(numa_cpu_lookup_table[boot_cpuid]);
|
2006-01-12 16:06:01 +07:00
|
|
|
current_set[boot_cpuid] = task_thread_info(current);
|
2005-04-17 05:20:36 +07:00
|
|
|
}
|
|
|
|
|
|
|
|
#ifdef CONFIG_HOTPLUG_CPU
|
|
|
|
|
|
|
|
int generic_cpu_disable(void)
|
|
|
|
{
|
|
|
|
unsigned int cpu = smp_processor_id();
|
|
|
|
|
|
|
|
if (cpu == boot_cpuid)
|
|
|
|
return -EBUSY;
|
|
|
|
|
2009-09-24 22:34:48 +07:00
|
|
|
set_cpu_online(cpu, false);
|
2005-11-10 09:37:51 +07:00
|
|
|
#ifdef CONFIG_PPC64
|
2005-11-11 17:15:21 +07:00
|
|
|
vdso_data->processorCount--;
|
2005-11-10 10:26:12 +07:00
|
|
|
#endif
|
2017-04-05 14:54:49 +07:00
|
|
|
/* Update affinity of all IRQs previously aimed at this CPU */
|
|
|
|
irq_migrate_all_off_this_cpu();
|
|
|
|
|
2017-02-15 16:49:54 +07:00
|
|
|
/*
|
|
|
|
* Depending on the details of the interrupt controller, it's possible
|
|
|
|
* that one of the interrupts we just migrated away from this CPU is
|
|
|
|
* actually already pending on this CPU. If we leave it in that state
|
|
|
|
* the interrupt will never be EOI'ed, and will never fire again. So
|
|
|
|
* temporarily enable interrupts here, to allow any pending interrupt to
|
|
|
|
* be received (and EOI'ed), before we take this CPU offline.
|
|
|
|
*/
|
2017-04-05 14:54:49 +07:00
|
|
|
local_irq_enable();
|
|
|
|
mdelay(1);
|
|
|
|
local_irq_disable();
|
|
|
|
|
2005-04-17 05:20:36 +07:00
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
void generic_cpu_die(unsigned int cpu)
|
|
|
|
{
|
|
|
|
int i;
|
|
|
|
|
|
|
|
for (i = 0; i < 100; i++) {
|
2005-05-01 22:58:47 +07:00
|
|
|
smp_rmb();
|
2015-11-20 16:14:01 +07:00
|
|
|
if (is_cpu_dead(cpu))
|
2005-04-17 05:20:36 +07:00
|
|
|
return;
|
|
|
|
msleep(100);
|
|
|
|
}
|
|
|
|
printk(KERN_ERR "CPU%d didn't die...\n", cpu);
|
|
|
|
}
|
|
|
|
|
2011-04-01 05:23:37 +07:00
|
|
|
void generic_set_cpu_dead(unsigned int cpu)
|
|
|
|
{
|
|
|
|
per_cpu(cpu_state, cpu) = CPU_DEAD;
|
|
|
|
}
|
2011-09-20 00:44:49 +07:00
|
|
|
|
2012-07-20 19:42:34 +07:00
|
|
|
/*
|
|
|
|
* The cpu_state should be set to CPU_UP_PREPARE in kick_cpu(), otherwise
|
|
|
|
* the cpu_state is always CPU_DEAD after calling generic_set_cpu_dead(),
|
|
|
|
* which makes the delay in generic_cpu_die() not happen.
|
|
|
|
*/
|
|
|
|
void generic_set_cpu_up(unsigned int cpu)
|
|
|
|
{
|
|
|
|
per_cpu(cpu_state, cpu) = CPU_UP_PREPARE;
|
|
|
|
}
|
|
|
|
|
2011-09-20 00:44:49 +07:00
|
|
|
int generic_check_cpu_restart(unsigned int cpu)
|
|
|
|
{
|
|
|
|
return per_cpu(cpu_state, cpu) == CPU_UP_PREPARE;
|
|
|
|
}
|
2012-10-15 08:15:41 +07:00
|
|
|
|
2015-11-20 16:14:01 +07:00
|
|
|
int is_cpu_dead(unsigned int cpu)
|
|
|
|
{
|
|
|
|
return per_cpu(cpu_state, cpu) == CPU_DEAD;
|
|
|
|
}
|
|
|
|
|
2014-05-23 15:15:25 +07:00
|
|
|
static bool secondaries_inhibited(void)
|
2012-10-15 08:15:41 +07:00
|
|
|
{
|
2014-05-23 15:15:25 +07:00
|
|
|
return kvm_hv_mode_active();
|
2012-10-15 08:15:41 +07:00
|
|
|
}
|
|
|
|
|
|
|
|
#else /* HOTPLUG_CPU */
|
|
|
|
|
|
|
|
#define secondaries_inhibited() 0
|
|
|
|
|
2005-04-17 05:20:36 +07:00
|
|
|
#endif
|
|
|
|
|
2012-04-20 20:05:48 +07:00
|
|
|
static void cpu_idle_thread_init(unsigned int cpu, struct task_struct *idle)
|
2011-03-08 10:40:04 +07:00
|
|
|
{
|
2012-04-20 20:05:48 +07:00
|
|
|
struct thread_info *ti = task_thread_info(idle);
|
2011-03-08 10:40:04 +07:00
|
|
|
|
|
|
|
#ifdef CONFIG_PPC64
|
2018-02-13 22:08:12 +07:00
|
|
|
paca_ptrs[cpu]->__current = idle;
|
|
|
|
paca_ptrs[cpu]->kstack = (unsigned long)ti + THREAD_SIZE - STACK_FRAME_OVERHEAD;
|
2011-03-08 10:40:04 +07:00
|
|
|
#endif
|
|
|
|
ti->cpu = cpu;
|
2012-04-20 20:05:48 +07:00
|
|
|
secondary_ti = current_set[cpu] = ti;
|
2011-03-08 10:40:04 +07:00
|
|
|
}
|
|
|
|
|
2013-06-25 02:30:09 +07:00
|
|
|
int __cpu_up(unsigned int cpu, struct task_struct *tidle)
|
2005-04-17 05:20:36 +07:00
|
|
|
{
|
2011-03-08 10:40:04 +07:00
|
|
|
int rc, c;
|
2005-04-17 05:20:36 +07:00
|
|
|
|
2012-10-15 08:15:41 +07:00
|
|
|
/*
|
|
|
|
* Don't allow secondary threads to come online if inhibited
|
|
|
|
*/
|
|
|
|
if (threads_per_core > 1 && secondaries_inhibited() &&
|
2014-05-23 15:15:28 +07:00
|
|
|
cpu_thread_in_subcore(cpu))
|
2012-10-15 08:15:41 +07:00
|
|
|
return -EBUSY;
|
|
|
|
|
2006-07-04 11:09:36 +07:00
|
|
|
if (smp_ops == NULL ||
|
|
|
|
(smp_ops->cpu_bootable && !smp_ops->cpu_bootable(cpu)))
|
2005-04-17 05:20:36 +07:00
|
|
|
return -EINVAL;
|
|
|
|
|
2012-04-20 20:05:48 +07:00
|
|
|
cpu_idle_thread_init(cpu, tidle);
|
2011-05-18 06:57:11 +07:00
|
|
|
|
2017-04-05 14:54:48 +07:00
|
|
|
/*
|
|
|
|
* The platform might need to allocate resources prior to bringing
|
|
|
|
* up the CPU
|
|
|
|
*/
|
|
|
|
if (smp_ops->prepare_cpu) {
|
|
|
|
rc = smp_ops->prepare_cpu(cpu);
|
|
|
|
if (rc)
|
|
|
|
return rc;
|
|
|
|
}
|
|
|
|
|
2005-04-17 05:20:36 +07:00
|
|
|
/* Make sure callin-map entry is 0 (can be leftover a CPU
|
|
|
|
* hotplug
|
|
|
|
*/
|
|
|
|
cpu_callin_map[cpu] = 0;
|
|
|
|
|
|
|
|
/* The information for processor bringup must
|
|
|
|
* be written out to main store before we release
|
|
|
|
* the processor.
|
|
|
|
*/
|
2005-05-01 22:58:47 +07:00
|
|
|
smp_mb();
|
2005-04-17 05:20:36 +07:00
|
|
|
|
|
|
|
/* wake up cpus */
|
|
|
|
DBG("smp: kicking cpu %d\n", cpu);
|
2011-04-12 04:46:19 +07:00
|
|
|
rc = smp_ops->kick_cpu(cpu);
|
|
|
|
if (rc) {
|
|
|
|
pr_err("smp: failed starting cpu %d (rc %d)\n", cpu, rc);
|
|
|
|
return rc;
|
|
|
|
}
|
2005-04-17 05:20:36 +07:00
|
|
|
|
|
|
|
/*
|
|
|
|
* wait to see if the cpu made a callin (is actually up).
|
|
|
|
* use this value that I found through experimentation.
|
|
|
|
* -- Cort
|
|
|
|
*/
|
|
|
|
if (system_state < SYSTEM_RUNNING)
|
2006-06-18 05:52:44 +07:00
|
|
|
for (c = 50000; c && !cpu_callin_map[cpu]; c--)
|
2005-04-17 05:20:36 +07:00
|
|
|
udelay(100);
|
|
|
|
#ifdef CONFIG_HOTPLUG_CPU
|
|
|
|
else
|
|
|
|
/*
|
|
|
|
* CPUs can take much longer to come up in the
|
|
|
|
* hotplug case. Wait five seconds.
|
|
|
|
*/
|
2009-06-24 06:26:37 +07:00
|
|
|
for (c = 5000; c && !cpu_callin_map[cpu]; c--)
|
|
|
|
msleep(1);
|
2005-04-17 05:20:36 +07:00
|
|
|
#endif
|
|
|
|
|
|
|
|
if (!cpu_callin_map[cpu]) {
|
2010-08-05 01:28:34 +07:00
|
|
|
printk(KERN_ERR "Processor %u is stuck.\n", cpu);
|
2005-04-17 05:20:36 +07:00
|
|
|
return -ENOENT;
|
|
|
|
}
|
|
|
|
|
2010-08-05 01:28:34 +07:00
|
|
|
DBG("Processor %u found.\n", cpu);
|
2005-04-17 05:20:36 +07:00
|
|
|
|
|
|
|
if (smp_ops->give_timebase)
|
|
|
|
smp_ops->give_timebase();
|
|
|
|
|
2015-02-24 13:58:02 +07:00
|
|
|
/* Wait until cpu puts itself in the online & active maps */
|
2017-06-06 20:08:32 +07:00
|
|
|
spin_until_cond(cpu_online(cpu));
|
2005-04-17 05:20:36 +07:00
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2008-07-27 12:24:54 +07:00
|
|
|
/* Return the value of the reg property corresponding to the given
|
|
|
|
* logical cpu.
|
|
|
|
*/
|
|
|
|
int cpu_to_core_id(int cpu)
|
|
|
|
{
|
|
|
|
struct device_node *np;
|
2013-12-12 11:59:36 +07:00
|
|
|
const __be32 *reg;
|
2008-07-27 12:24:54 +07:00
|
|
|
int id = -1;
|
|
|
|
|
|
|
|
np = of_get_cpu_node(cpu, NULL);
|
|
|
|
if (!np)
|
|
|
|
goto out;
|
|
|
|
|
|
|
|
reg = of_get_property(np, "reg", NULL);
|
|
|
|
if (!reg)
|
|
|
|
goto out;
|
|
|
|
|
2013-12-12 11:59:36 +07:00
|
|
|
id = be32_to_cpup(reg);
|
2008-07-27 12:24:54 +07:00
|
|
|
out:
|
|
|
|
of_node_put(np);
|
|
|
|
return id;
|
|
|
|
}
|
2016-06-02 18:45:14 +07:00
|
|
|
EXPORT_SYMBOL_GPL(cpu_to_core_id);
|
2008-07-27 12:24:54 +07:00
|
|
|
|
2010-10-06 15:36:59 +07:00
|
|
|
/* Helper routines for cpu to core mapping */
|
|
|
|
int cpu_core_index_of_thread(int cpu)
|
|
|
|
{
|
|
|
|
return cpu >> threads_shift;
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL_GPL(cpu_core_index_of_thread);
|
|
|
|
|
|
|
|
int cpu_first_thread_of_core(int core)
|
|
|
|
{
|
|
|
|
return core << threads_shift;
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL_GPL(cpu_first_thread_of_core);
|
|
|
|
|
2011-04-28 12:07:23 +07:00
|
|
|
/* Must be called when no change can occur to cpu_present_mask,
|
2008-07-27 12:24:53 +07:00
|
|
|
* i.e. during cpu online or offline.
|
|
|
|
*/
|
|
|
|
static struct device_node *cpu_to_l2cache(int cpu)
|
|
|
|
{
|
|
|
|
struct device_node *np;
|
2008-12-11 03:16:07 +07:00
|
|
|
struct device_node *cache;
|
2008-07-27 12:24:53 +07:00
|
|
|
|
|
|
|
if (!cpu_present(cpu))
|
|
|
|
return NULL;
|
|
|
|
|
|
|
|
np = of_get_cpu_node(cpu, NULL);
|
|
|
|
if (np == NULL)
|
|
|
|
return NULL;
|
|
|
|
|
2008-12-11 03:16:07 +07:00
|
|
|
cache = of_find_next_cache_node(np);
|
|
|
|
|
2008-07-27 12:24:53 +07:00
|
|
|
of_node_put(np);
|
|
|
|
|
2008-12-11 03:16:07 +07:00
|
|
|
return cache;
|
2008-07-27 12:24:53 +07:00
|
|
|
}
|
2005-04-17 05:20:36 +07:00
|
|
|
|
2017-06-29 14:12:54 +07:00
|
|
|
static bool update_mask_by_l2(int cpu, struct cpumask *(*mask_fn)(int))
|
2013-08-12 13:28:47 +07:00
|
|
|
{
|
2013-08-12 13:29:33 +07:00
|
|
|
struct device_node *l2_cache, *np;
|
2017-06-29 14:12:53 +07:00
|
|
|
int i;
|
2013-08-12 13:29:33 +07:00
|
|
|
|
2013-08-12 13:28:47 +07:00
|
|
|
l2_cache = cpu_to_l2cache(cpu);
|
2017-06-29 14:12:54 +07:00
|
|
|
if (!l2_cache)
|
|
|
|
return false;
|
|
|
|
|
|
|
|
for_each_cpu(i, cpu_online_mask) {
|
|
|
|
/*
|
|
|
|
* when updating the marks the current CPU has not been marked
|
|
|
|
* online, but we need to update the cache masks
|
|
|
|
*/
|
2013-08-12 13:29:33 +07:00
|
|
|
np = cpu_to_l2cache(i);
|
2013-08-12 13:28:47 +07:00
|
|
|
if (!np)
|
|
|
|
continue;
|
2017-06-29 14:12:54 +07:00
|
|
|
|
|
|
|
if (np == l2_cache)
|
|
|
|
set_cpus_related(cpu, i, mask_fn);
|
|
|
|
|
2013-08-12 13:28:47 +07:00
|
|
|
of_node_put(np);
|
|
|
|
}
|
|
|
|
of_node_put(l2_cache);
|
2017-06-29 14:12:54 +07:00
|
|
|
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
#ifdef CONFIG_HOTPLUG_CPU
|
|
|
|
static void remove_cpu_from_masks(int cpu)
|
|
|
|
{
|
|
|
|
int i;
|
|
|
|
|
|
|
|
/* NB: cpu_core_mask is a superset of the others */
|
|
|
|
for_each_cpu(i, cpu_core_mask(cpu)) {
|
|
|
|
set_cpus_unrelated(cpu, i, cpu_core_mask);
|
2017-06-29 14:12:55 +07:00
|
|
|
set_cpus_unrelated(cpu, i, cpu_l2_cache_mask);
|
2017-06-29 14:12:54 +07:00
|
|
|
set_cpus_unrelated(cpu, i, cpu_sibling_mask);
|
2018-10-11 12:33:01 +07:00
|
|
|
if (has_big_cores)
|
|
|
|
set_cpus_unrelated(cpu, i, cpu_smallcore_mask);
|
2017-06-29 14:12:54 +07:00
|
|
|
}
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
2018-10-11 12:33:01 +07:00
|
|
|
static inline void add_cpu_to_smallcore_masks(int cpu)
|
|
|
|
{
|
|
|
|
struct cpumask *this_l1_cache_map = per_cpu(cpu_l1_cache_map, cpu);
|
|
|
|
int i, first_thread = cpu_first_thread_sibling(cpu);
|
|
|
|
|
|
|
|
if (!has_big_cores)
|
|
|
|
return;
|
|
|
|
|
|
|
|
cpumask_set_cpu(cpu, cpu_smallcore_mask(cpu));
|
|
|
|
|
|
|
|
for (i = first_thread; i < first_thread + threads_per_core; i++) {
|
|
|
|
if (cpu_online(i) && cpumask_test_cpu(i, this_l1_cache_map))
|
|
|
|
set_cpus_related(i, cpu, cpu_smallcore_mask);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2017-06-29 14:12:54 +07:00
|
|
|
static void add_cpu_to_masks(int cpu)
|
|
|
|
{
|
|
|
|
int first_thread = cpu_first_thread_sibling(cpu);
|
|
|
|
int chipid = cpu_to_chip_id(cpu);
|
|
|
|
int i;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* This CPU will not be in the online mask yet so we need to manually
|
|
|
|
* add it to it's own thread sibling mask.
|
|
|
|
*/
|
|
|
|
cpumask_set_cpu(cpu, cpu_sibling_mask(cpu));
|
|
|
|
|
|
|
|
for (i = first_thread; i < first_thread + threads_per_core; i++)
|
|
|
|
if (cpu_online(i))
|
|
|
|
set_cpus_related(i, cpu, cpu_sibling_mask);
|
|
|
|
|
2018-10-11 12:33:01 +07:00
|
|
|
add_cpu_to_smallcore_masks(cpu);
|
2017-06-29 14:12:54 +07:00
|
|
|
/*
|
2017-06-29 14:12:55 +07:00
|
|
|
* Copy the thread sibling mask into the cache sibling mask
|
|
|
|
* and mark any CPUs that share an L2 with this CPU.
|
2017-06-29 14:12:54 +07:00
|
|
|
*/
|
|
|
|
for_each_cpu(i, cpu_sibling_mask(cpu))
|
2017-06-29 14:12:55 +07:00
|
|
|
set_cpus_related(cpu, i, cpu_l2_cache_mask);
|
|
|
|
update_mask_by_l2(cpu, cpu_l2_cache_mask);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Copy the cache sibling mask into core sibling mask and mark
|
|
|
|
* any CPUs on the same chip as this CPU.
|
|
|
|
*/
|
|
|
|
for_each_cpu(i, cpu_l2_cache_mask(cpu))
|
2017-06-29 14:12:54 +07:00
|
|
|
set_cpus_related(cpu, i, cpu_core_mask);
|
|
|
|
|
2017-06-29 14:12:55 +07:00
|
|
|
if (chipid == -1)
|
2017-06-29 14:12:54 +07:00
|
|
|
return;
|
|
|
|
|
|
|
|
for_each_cpu(i, cpu_online_mask)
|
|
|
|
if (cpu_to_chip_id(i) == chipid)
|
|
|
|
set_cpus_related(cpu, i, cpu_core_mask);
|
2013-08-12 13:28:47 +07:00
|
|
|
}
|
|
|
|
|
2017-06-29 14:12:56 +07:00
|
|
|
static bool shared_caches;
|
|
|
|
|
2005-04-17 05:20:36 +07:00
|
|
|
/* Activate a secondary processor. */
|
2013-06-25 02:30:09 +07:00
|
|
|
void start_secondary(void *unused)
|
2005-04-17 05:20:36 +07:00
|
|
|
{
|
|
|
|
unsigned int cpu = smp_processor_id();
|
2018-10-11 12:33:02 +07:00
|
|
|
struct cpumask *(*sibling_mask)(int) = cpu_sibling_mask;
|
2005-04-17 05:20:36 +07:00
|
|
|
|
2017-02-28 05:30:07 +07:00
|
|
|
mmgrab(&init_mm);
|
2005-04-17 05:20:36 +07:00
|
|
|
current->active_mm = &init_mm;
|
|
|
|
|
|
|
|
smp_store_cpu_info(cpu);
|
2005-11-05 06:33:55 +07:00
|
|
|
set_dec(tb_ticks_per_jiffy);
|
2005-11-10 06:45:30 +07:00
|
|
|
preempt_disable();
|
2014-12-29 11:47:05 +07:00
|
|
|
cpu_callin_map[cpu] = 1;
|
2005-04-17 05:20:36 +07:00
|
|
|
|
2009-09-09 00:38:52 +07:00
|
|
|
if (smp_ops->setup_cpu)
|
|
|
|
smp_ops->setup_cpu(cpu);
|
2005-04-17 05:20:36 +07:00
|
|
|
if (smp_ops->take_timebase)
|
|
|
|
smp_ops->take_timebase();
|
|
|
|
|
2007-09-21 10:26:03 +07:00
|
|
|
secondary_cpu_time_init();
|
|
|
|
|
2011-03-08 10:49:33 +07:00
|
|
|
#ifdef CONFIG_PPC64
|
|
|
|
if (system_state == SYSTEM_RUNNING)
|
|
|
|
vdso_data->processorCount++;
|
2012-07-05 03:37:11 +07:00
|
|
|
|
|
|
|
vdso_getcpu_init();
|
2011-03-08 10:49:33 +07:00
|
|
|
#endif
|
2017-06-29 14:12:54 +07:00
|
|
|
/* Update topology CPU masks */
|
|
|
|
add_cpu_to_masks(cpu);
|
2005-04-17 05:20:36 +07:00
|
|
|
|
2018-10-11 12:33:02 +07:00
|
|
|
if (has_big_cores)
|
|
|
|
sibling_mask = cpu_smallcore_mask;
|
2017-06-29 14:12:56 +07:00
|
|
|
/*
|
|
|
|
* Check for any shared caches. Note that this must be done on a
|
|
|
|
* per-core basis because one core in the pair might be disabled.
|
|
|
|
*/
|
2018-10-11 12:33:02 +07:00
|
|
|
if (!cpumask_equal(cpu_l2_cache_mask(cpu), sibling_mask(cpu)))
|
2017-06-29 14:12:56 +07:00
|
|
|
shared_caches = true;
|
|
|
|
|
2014-08-27 16:34:00 +07:00
|
|
|
set_numa_node(numa_cpu_lookup_table[cpu]);
|
|
|
|
set_numa_mem(local_memory_node(numa_cpu_lookup_table[cpu]));
|
|
|
|
|
powerpc: Set cpu sibling mask before online cpu
It seems following race is possible:
cpu0 cpux
smp_init->cpu_up->_cpu_up
__cpu_up
kick_cpu(1)
-------------------------------------------------------------------------
waiting online ...
... notify CPU_STARTING
set cpux active
set cpux online
-------------------------------------------------------------------------
finish waiting online
...
sched_init_smp
init_sched_domains(cpu_active_mask)
build_sched_domains
set cpux sibling info
-------------------------------------------------------------------------
Execution of cpu0 and cpux could be concurrent between two separator
lines.
So if the cpux sibling information was set too late (normally
impossible, but could be triggered by adding some delay in
start_secondary, after setting cpu online), build_sched_domains()
running on cpu0 might see cpux active, with an empty sibling mask, then
cause some bad address accessing like following:
[ 0.099855] Unable to handle kernel paging request for data at address 0xc00000038518078f
[ 0.099868] Faulting instruction address: 0xc0000000000b7a64
[ 0.099883] Oops: Kernel access of bad area, sig: 11 [#1]
[ 0.099895] PREEMPT SMP NR_CPUS=16 DEBUG_PAGEALLOC NUMA pSeries
[ 0.099922] Modules linked in:
[ 0.099940] CPU: 0 PID: 1 Comm: swapper/0 Not tainted 3.10.0-rc1-00120-gb973425-dirty #16
[ 0.099956] task: c0000001fed80000 ti: c0000001fed7c000 task.ti: c0000001fed7c000
[ 0.099971] NIP: c0000000000b7a64 LR: c0000000000b7a40 CTR: c0000000000b4934
[ 0.099985] REGS: c0000001fed7f760 TRAP: 0300 Not tainted (3.10.0-rc1-00120-gb973425-dirty)
[ 0.099997] MSR: 8000000000009032 <SF,EE,ME,IR,DR,RI> CR: 24272828 XER: 20000003
[ 0.100045] SOFTE: 1
[ 0.100053] CFAR: c000000000445ee8
[ 0.100064] DAR: c00000038518078f, DSISR: 40000000
[ 0.100073]
GPR00: 0000000000000080 c0000001fed7f9e0 c000000000c84d48 0000000000000010
GPR04: 0000000000000010 0000000000000000 c0000001fc55e090 0000000000000000
GPR08: ffffffffffffffff c000000000b80b30 c000000000c962d8 00000003845ffc5f
GPR12: 0000000000000000 c00000000f33d000 c00000000000b9e4 0000000000000000
GPR16: 0000000000000000 0000000000000000 0000000000000001 0000000000000000
GPR20: c000000000ccf750 0000000000000000 c000000000c94d48 c0000001fc504000
GPR24: c0000001fc504000 c0000001fecef848 c000000000c94d48 c000000000ccf000
GPR28: c0000001fc522090 0000000000000010 c0000001fecef848 c0000001fed7fae0
[ 0.100293] NIP [c0000000000b7a64] .get_group+0x84/0xc4
[ 0.100307] LR [c0000000000b7a40] .get_group+0x60/0xc4
[ 0.100318] Call Trace:
[ 0.100332] [c0000001fed7f9e0] [c0000000000dbce4] .lock_is_held+0xa8/0xd0 (unreliable)
[ 0.100354] [c0000001fed7fa70] [c0000000000bf62c] .build_sched_domains+0x728/0xd14
[ 0.100375] [c0000001fed7fbe0] [c000000000af67bc] .sched_init_smp+0x4fc/0x654
[ 0.100394] [c0000001fed7fce0] [c000000000adce24] .kernel_init_freeable+0x17c/0x30c
[ 0.100413] [c0000001fed7fdb0] [c00000000000ba08] .kernel_init+0x24/0x12c
[ 0.100431] [c0000001fed7fe30] [c000000000009f74] .ret_from_kernel_thread+0x5c/0x68
[ 0.100445] Instruction dump:
[ 0.100456] 38800010 38a00000 4838e3f5 60000000 7c6307b4 2fbf0000 419e0040 3d220001
[ 0.100496] 78601f24 39491590 e93e0008 7d6a002a <7d69582a> f97f0000 7d4a002a e93e0010
[ 0.100559] ---[ end trace 31fd0ba7d8756001 ]---
This patch tries to move the sibling maps updating before
notify_cpu_starting() and cpu online, and a write barrier there to make
sure sibling maps are updated before active and online mask.
Signed-off-by: Li Zhong <zhong@linux.vnet.ibm.com>
Reviewed-by: Srivatsa S. Bhat <srivatsa.bhat@linux.vnet.ibm.com>
Signed-off-by: Benjamin Herrenschmidt <benh@kernel.crashing.org>
2013-05-16 17:20:26 +07:00
|
|
|
smp_wmb();
|
|
|
|
notify_cpu_starting(cpu);
|
|
|
|
set_cpu_online(cpu, true);
|
|
|
|
|
2018-10-19 12:19:10 +07:00
|
|
|
boot_init_stack_canary();
|
|
|
|
|
2005-04-17 05:20:36 +07:00
|
|
|
local_irq_enable();
|
|
|
|
|
2018-04-19 14:04:03 +07:00
|
|
|
/* We can enable ftrace for secondary cpus now */
|
|
|
|
this_cpu_enable_ftrace();
|
|
|
|
|
2016-02-27 01:43:40 +07:00
|
|
|
cpu_startup_entry(CPUHP_AP_ONLINE_IDLE);
|
2011-02-10 14:45:24 +07:00
|
|
|
|
|
|
|
BUG();
|
2005-04-17 05:20:36 +07:00
|
|
|
}
|
|
|
|
|
|
|
|
int setup_profiling_timer(unsigned int multiplier)
|
|
|
|
{
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2014-04-11 16:44:39 +07:00
|
|
|
#ifdef CONFIG_SCHED_SMT
|
|
|
|
/* cpumask of CPUs with asymetric SMT dependancy */
|
2014-06-25 08:05:29 +07:00
|
|
|
static int powerpc_smt_flags(void)
|
2014-04-11 16:44:39 +07:00
|
|
|
{
|
2014-05-28 00:50:41 +07:00
|
|
|
int flags = SD_SHARE_CPUCAPACITY | SD_SHARE_PKG_RESOURCES;
|
2014-04-11 16:44:39 +07:00
|
|
|
|
|
|
|
if (cpu_has_feature(CPU_FTR_ASYM_SMT)) {
|
|
|
|
printk_once(KERN_INFO "Enabling Asymmetric SMT scheduling\n");
|
|
|
|
flags |= SD_ASYM_PACKING;
|
|
|
|
}
|
|
|
|
return flags;
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
|
|
|
static struct sched_domain_topology_level powerpc_topology[] = {
|
|
|
|
#ifdef CONFIG_SCHED_SMT
|
|
|
|
{ cpu_smt_mask, powerpc_smt_flags, SD_INIT_NAME(SMT) },
|
|
|
|
#endif
|
|
|
|
{ cpu_cpu_mask, SD_INIT_NAME(DIE) },
|
|
|
|
{ NULL, },
|
|
|
|
};
|
|
|
|
|
2017-06-29 14:12:56 +07:00
|
|
|
/*
|
|
|
|
* P9 has a slightly odd architecture where pairs of cores share an L2 cache.
|
|
|
|
* This topology makes it *much* cheaper to migrate tasks between adjacent cores
|
|
|
|
* since the migrated task remains cache hot. We want to take advantage of this
|
|
|
|
* at the scheduler level so an extra topology level is required.
|
|
|
|
*/
|
|
|
|
static int powerpc_shared_cache_flags(void)
|
|
|
|
{
|
|
|
|
return SD_SHARE_PKG_RESOURCES;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* We can't just pass cpu_l2_cache_mask() directly because
|
|
|
|
* returns a non-const pointer and the compiler barfs on that.
|
|
|
|
*/
|
|
|
|
static const struct cpumask *shared_cache_mask(int cpu)
|
|
|
|
{
|
|
|
|
return cpu_l2_cache_mask(cpu);
|
|
|
|
}
|
|
|
|
|
2018-10-11 12:33:02 +07:00
|
|
|
#ifdef CONFIG_SCHED_SMT
|
|
|
|
static const struct cpumask *smallcore_smt_mask(int cpu)
|
|
|
|
{
|
|
|
|
return cpu_smallcore_mask(cpu);
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
2017-06-29 14:12:56 +07:00
|
|
|
static struct sched_domain_topology_level power9_topology[] = {
|
|
|
|
#ifdef CONFIG_SCHED_SMT
|
|
|
|
{ cpu_smt_mask, powerpc_smt_flags, SD_INIT_NAME(SMT) },
|
|
|
|
#endif
|
|
|
|
{ shared_cache_mask, powerpc_shared_cache_flags, SD_INIT_NAME(CACHE) },
|
|
|
|
{ cpu_cpu_mask, SD_INIT_NAME(DIE) },
|
|
|
|
{ NULL, },
|
|
|
|
};
|
|
|
|
|
2017-04-13 03:07:31 +07:00
|
|
|
void __init smp_cpus_done(unsigned int max_cpus)
|
|
|
|
{
|
|
|
|
/*
|
powerpc/smp: Call smp_ops->setup_cpu() directly on the boot CPU
In smp_cpus_done() we need to call smp_ops->setup_cpu() for the boot
CPU, which means it has to run *on* the boot CPU.
In the past we ensured it ran on the boot CPU by changing the CPU
affinity mask of current directly. That was removed in commit
6d11b87d55eb ("powerpc/smp: Replace open coded task affinity logic"),
and replaced with a work queue call.
Unfortunately using a work queue leads to a lockdep warning, now that
the CPU hotplug lock is a regular semaphore:
======================================================
WARNING: possible circular locking dependency detected
...
kworker/0:1/971 is trying to acquire lock:
(cpu_hotplug_lock.rw_sem){++++++}, at: [<c000000000100974>] apply_workqueue_attrs+0x34/0xa0
but task is already holding lock:
((&wfc.work)){+.+.+.}, at: [<c0000000000fdb2c>] process_one_work+0x25c/0x800
...
CPU0 CPU1
---- ----
lock((&wfc.work));
lock(cpu_hotplug_lock.rw_sem);
lock((&wfc.work));
lock(cpu_hotplug_lock.rw_sem);
Although the deadlock can't happen in practice, because
smp_cpus_done() only runs in early boot before CPU hotplug is allowed,
lockdep can't tell that.
Luckily in commit 8fb12156b8db ("init: Pin init task to the boot CPU,
initially") tglx changed the generic code to pin init to the boot CPU
to begin with. The unpinning of init from the boot CPU happens in
sched_init_smp(), which is called after smp_cpus_done().
So smp_cpus_done() is always called on the boot CPU, which means we
don't need the work queue call at all - and the lockdep warning goes
away.
Signed-off-by: Michael Ellerman <mpe@ellerman.id.au>
Reviewed-by: Thomas Gleixner <tglx@linutronix.de>
2017-07-27 20:23:37 +07:00
|
|
|
* We are running pinned to the boot CPU, see rest_init().
|
2005-04-17 05:20:36 +07:00
|
|
|
*/
|
2009-09-09 00:38:52 +07:00
|
|
|
if (smp_ops && smp_ops->setup_cpu)
|
powerpc/smp: Call smp_ops->setup_cpu() directly on the boot CPU
In smp_cpus_done() we need to call smp_ops->setup_cpu() for the boot
CPU, which means it has to run *on* the boot CPU.
In the past we ensured it ran on the boot CPU by changing the CPU
affinity mask of current directly. That was removed in commit
6d11b87d55eb ("powerpc/smp: Replace open coded task affinity logic"),
and replaced with a work queue call.
Unfortunately using a work queue leads to a lockdep warning, now that
the CPU hotplug lock is a regular semaphore:
======================================================
WARNING: possible circular locking dependency detected
...
kworker/0:1/971 is trying to acquire lock:
(cpu_hotplug_lock.rw_sem){++++++}, at: [<c000000000100974>] apply_workqueue_attrs+0x34/0xa0
but task is already holding lock:
((&wfc.work)){+.+.+.}, at: [<c0000000000fdb2c>] process_one_work+0x25c/0x800
...
CPU0 CPU1
---- ----
lock((&wfc.work));
lock(cpu_hotplug_lock.rw_sem);
lock((&wfc.work));
lock(cpu_hotplug_lock.rw_sem);
Although the deadlock can't happen in practice, because
smp_cpus_done() only runs in early boot before CPU hotplug is allowed,
lockdep can't tell that.
Luckily in commit 8fb12156b8db ("init: Pin init task to the boot CPU,
initially") tglx changed the generic code to pin init to the boot CPU
to begin with. The unpinning of init from the boot CPU happens in
sched_init_smp(), which is called after smp_cpus_done().
So smp_cpus_done() is always called on the boot CPU, which means we
don't need the work queue call at all - and the lockdep warning goes
away.
Signed-off-by: Michael Ellerman <mpe@ellerman.id.au>
Reviewed-by: Thomas Gleixner <tglx@linutronix.de>
2017-07-27 20:23:37 +07:00
|
|
|
smp_ops->setup_cpu(boot_cpuid);
|
2005-12-13 02:56:47 +07:00
|
|
|
|
2011-03-08 09:50:37 +07:00
|
|
|
if (smp_ops && smp_ops->bringup_done)
|
|
|
|
smp_ops->bringup_done();
|
|
|
|
|
powerpc/topology: Get topology for shared processors at boot
On a shared LPAR, Phyp will not update the CPU associativity at boot
time. Just after the boot system does recognize itself as a shared
LPAR and trigger a request for correct CPU associativity. But by then
the scheduler would have already created/destroyed its sched domains.
This causes
- Broken load balance across Nodes causing islands of cores.
- Performance degradation esp if the system is lightly loaded
- dmesg to wrongly report all CPUs to be in Node 0.
- Messages in dmesg saying borken topology.
- With commit 051f3ca02e46 ("sched/topology: Introduce NUMA identity
node sched domain"), can cause rcu stalls at boot up.
The sched_domains_numa_masks table which is used to generate cpumasks
is only created at boot time just before creating sched domains and
never updated. Hence, its better to get the topology correct before
the sched domains are created.
For example on 64 core Power 8 shared LPAR, dmesg reports
Brought up 512 CPUs
Node 0 CPUs: 0-511
Node 1 CPUs:
Node 2 CPUs:
Node 3 CPUs:
Node 4 CPUs:
Node 5 CPUs:
Node 6 CPUs:
Node 7 CPUs:
Node 8 CPUs:
Node 9 CPUs:
Node 10 CPUs:
Node 11 CPUs:
...
BUG: arch topology borken
the DIE domain not a subset of the NUMA domain
BUG: arch topology borken
the DIE domain not a subset of the NUMA domain
numactl/lscpu output will still be correct with cores spreading across
all nodes:
Socket(s): 64
NUMA node(s): 12
Model: 2.0 (pvr 004d 0200)
Model name: POWER8 (architected), altivec supported
Hypervisor vendor: pHyp
Virtualization type: para
L1d cache: 64K
L1i cache: 32K
NUMA node0 CPU(s): 0-7,32-39,64-71,96-103,176-183,272-279,368-375,464-471
NUMA node1 CPU(s): 8-15,40-47,72-79,104-111,184-191,280-287,376-383,472-479
NUMA node2 CPU(s): 16-23,48-55,80-87,112-119,192-199,288-295,384-391,480-487
NUMA node3 CPU(s): 24-31,56-63,88-95,120-127,200-207,296-303,392-399,488-495
NUMA node4 CPU(s): 208-215,304-311,400-407,496-503
NUMA node5 CPU(s): 168-175,264-271,360-367,456-463
NUMA node6 CPU(s): 128-135,224-231,320-327,416-423
NUMA node7 CPU(s): 136-143,232-239,328-335,424-431
NUMA node8 CPU(s): 216-223,312-319,408-415,504-511
NUMA node9 CPU(s): 144-151,240-247,336-343,432-439
NUMA node10 CPU(s): 152-159,248-255,344-351,440-447
NUMA node11 CPU(s): 160-167,256-263,352-359,448-455
Currently on this LPAR, the scheduler detects 2 levels of Numa and
created numa sched domains for all CPUs, but it finds a single DIE
domain consisting of all CPUs. Hence it deletes all numa sched
domains.
To address this, detect the shared processor and update topology soon
after CPUs are setup so that correct topology is updated just before
scheduler creates sched domain.
With the fix, dmesg reports:
numa: Node 0 CPUs: 0-7 32-39 64-71 96-103 176-183 272-279 368-375 464-471
numa: Node 1 CPUs: 8-15 40-47 72-79 104-111 184-191 280-287 376-383 472-479
numa: Node 2 CPUs: 16-23 48-55 80-87 112-119 192-199 288-295 384-391 480-487
numa: Node 3 CPUs: 24-31 56-63 88-95 120-127 200-207 296-303 392-399 488-495
numa: Node 4 CPUs: 208-215 304-311 400-407 496-503
numa: Node 5 CPUs: 168-175 264-271 360-367 456-463
numa: Node 6 CPUs: 128-135 224-231 320-327 416-423
numa: Node 7 CPUs: 136-143 232-239 328-335 424-431
numa: Node 8 CPUs: 216-223 312-319 408-415 504-511
numa: Node 9 CPUs: 144-151 240-247 336-343 432-439
numa: Node 10 CPUs: 152-159 248-255 344-351 440-447
numa: Node 11 CPUs: 160-167 256-263 352-359 448-455
and lscpu also reports:
Socket(s): 64
NUMA node(s): 12
Model: 2.0 (pvr 004d 0200)
Model name: POWER8 (architected), altivec supported
Hypervisor vendor: pHyp
Virtualization type: para
L1d cache: 64K
L1i cache: 32K
NUMA node0 CPU(s): 0-7,32-39,64-71,96-103,176-183,272-279,368-375,464-471
NUMA node1 CPU(s): 8-15,40-47,72-79,104-111,184-191,280-287,376-383,472-479
NUMA node2 CPU(s): 16-23,48-55,80-87,112-119,192-199,288-295,384-391,480-487
NUMA node3 CPU(s): 24-31,56-63,88-95,120-127,200-207,296-303,392-399,488-495
NUMA node4 CPU(s): 208-215,304-311,400-407,496-503
NUMA node5 CPU(s): 168-175,264-271,360-367,456-463
NUMA node6 CPU(s): 128-135,224-231,320-327,416-423
NUMA node7 CPU(s): 136-143,232-239,328-335,424-431
NUMA node8 CPU(s): 216-223,312-319,408-415,504-511
NUMA node9 CPU(s): 144-151,240-247,336-343,432-439
NUMA node10 CPU(s): 152-159,248-255,344-351,440-447
NUMA node11 CPU(s): 160-167,256-263,352-359,448-455
Reported-by: Manjunatha H R <manjuhr1@in.ibm.com>
Signed-off-by: Srikar Dronamraju <srikar@linux.vnet.ibm.com>
[mpe: Trim / format change log]
Tested-by: Michael Ellerman <mpe@ellerman.id.au>
Signed-off-by: Michael Ellerman <mpe@ellerman.id.au>
2018-08-17 21:54:39 +07:00
|
|
|
/*
|
|
|
|
* On a shared LPAR, associativity needs to be requested.
|
|
|
|
* Hence, get numa topology before dumping cpu topology
|
|
|
|
*/
|
|
|
|
shared_proc_topology_init();
|
2005-12-13 02:56:47 +07:00
|
|
|
dump_numa_cpu_topology();
|
2011-03-08 09:50:37 +07:00
|
|
|
|
2018-10-11 12:33:02 +07:00
|
|
|
#ifdef CONFIG_SCHED_SMT
|
|
|
|
if (has_big_cores) {
|
|
|
|
pr_info("Using small cores at SMT level\n");
|
|
|
|
power9_topology[0].mask = smallcore_smt_mask;
|
|
|
|
powerpc_topology[0].mask = smallcore_smt_mask;
|
|
|
|
}
|
|
|
|
#endif
|
2017-06-29 14:12:56 +07:00
|
|
|
/*
|
|
|
|
* If any CPU detects that it's sharing a cache with another CPU then
|
|
|
|
* use the deeper topology that is aware of this sharing.
|
|
|
|
*/
|
|
|
|
if (shared_caches) {
|
|
|
|
pr_info("Using shared cache scheduler topology\n");
|
|
|
|
set_sched_topology(power9_topology);
|
|
|
|
} else {
|
|
|
|
pr_info("Using standard scheduler topology\n");
|
|
|
|
set_sched_topology(powerpc_topology);
|
|
|
|
}
|
2010-08-11 03:02:05 +07:00
|
|
|
}
|
|
|
|
|
2005-04-17 05:20:36 +07:00
|
|
|
#ifdef CONFIG_HOTPLUG_CPU
|
|
|
|
int __cpu_disable(void)
|
|
|
|
{
|
2008-07-27 12:24:52 +07:00
|
|
|
int cpu = smp_processor_id();
|
|
|
|
int err;
|
2005-04-17 05:20:36 +07:00
|
|
|
|
2008-07-27 12:24:52 +07:00
|
|
|
if (!smp_ops->cpu_disable)
|
|
|
|
return -ENOSYS;
|
|
|
|
|
2018-04-19 14:04:04 +07:00
|
|
|
this_cpu_disable_ftrace();
|
|
|
|
|
2008-07-27 12:24:52 +07:00
|
|
|
err = smp_ops->cpu_disable();
|
|
|
|
if (err)
|
|
|
|
return err;
|
|
|
|
|
|
|
|
/* Update sibling maps */
|
2017-06-29 14:12:54 +07:00
|
|
|
remove_cpu_from_masks(cpu);
|
2008-07-27 12:24:52 +07:00
|
|
|
|
|
|
|
return 0;
|
2005-04-17 05:20:36 +07:00
|
|
|
}
|
|
|
|
|
|
|
|
void __cpu_die(unsigned int cpu)
|
|
|
|
{
|
|
|
|
if (smp_ops->cpu_die)
|
|
|
|
smp_ops->cpu_die(cpu);
|
|
|
|
}
|
2010-01-14 16:52:44 +07:00
|
|
|
|
2010-05-19 09:56:29 +07:00
|
|
|
void cpu_die(void)
|
|
|
|
{
|
2018-04-19 14:04:04 +07:00
|
|
|
/*
|
|
|
|
* Disable on the down path. This will be re-enabled by
|
|
|
|
* start_secondary() via start_secondary_resume() below
|
|
|
|
*/
|
|
|
|
this_cpu_disable_ftrace();
|
|
|
|
|
2010-05-19 09:56:29 +07:00
|
|
|
if (ppc_md.cpu_die)
|
|
|
|
ppc_md.cpu_die();
|
2011-02-10 14:45:24 +07:00
|
|
|
|
|
|
|
/* If we return, we re-enter start_secondary */
|
|
|
|
start_secondary_resume();
|
2010-05-19 09:56:29 +07:00
|
|
|
}
|
2011-02-10 14:45:24 +07:00
|
|
|
|
2005-04-17 05:20:36 +07:00
|
|
|
#endif
|