2008-06-02 21:56:14 +08:00
|
|
|
/*
|
|
|
|
* SGI UltraViolet TLB flush routines.
|
|
|
|
*
|
2012-06-22 21:14:59 +08:00
|
|
|
* (c) 2008-2012 Cliff Wickman <cpw@sgi.com>, SGI.
|
2008-06-02 21:56:14 +08:00
|
|
|
*
|
|
|
|
* This code is released under the GNU General Public License version 2 or
|
|
|
|
* later.
|
|
|
|
*/
|
2008-10-15 12:43:43 +08:00
|
|
|
#include <linux/seq_file.h>
|
2008-06-02 21:56:14 +08:00
|
|
|
#include <linux/proc_fs.h>
|
2010-06-03 05:22:01 +08:00
|
|
|
#include <linux/debugfs.h>
|
2008-06-02 21:56:14 +08:00
|
|
|
#include <linux/kernel.h>
|
include cleanup: Update gfp.h and slab.h includes to prepare for breaking implicit slab.h inclusion from percpu.h
percpu.h is included by sched.h and module.h and thus ends up being
included when building most .c files. percpu.h includes slab.h which
in turn includes gfp.h making everything defined by the two files
universally available and complicating inclusion dependencies.
percpu.h -> slab.h dependency is about to be removed. Prepare for
this change by updating users of gfp and slab facilities include those
headers directly instead of assuming availability. As this conversion
needs to touch large number of source files, the following script is
used as the basis of conversion.
http://userweb.kernel.org/~tj/misc/slabh-sweep.py
The script does the followings.
* Scan files for gfp and slab usages and update includes such that
only the necessary includes are there. ie. if only gfp is used,
gfp.h, if slab is used, slab.h.
* When the script inserts a new include, it looks at the include
blocks and try to put the new include such that its order conforms
to its surrounding. It's put in the include block which contains
core kernel includes, in the same order that the rest are ordered -
alphabetical, Christmas tree, rev-Xmas-tree or at the end if there
doesn't seem to be any matching order.
* If the script can't find a place to put a new include (mostly
because the file doesn't have fitting include block), it prints out
an error message indicating which .h file needs to be added to the
file.
The conversion was done in the following steps.
1. The initial automatic conversion of all .c files updated slightly
over 4000 files, deleting around 700 includes and adding ~480 gfp.h
and ~3000 slab.h inclusions. The script emitted errors for ~400
files.
2. Each error was manually checked. Some didn't need the inclusion,
some needed manual addition while adding it to implementation .h or
embedding .c file was more appropriate for others. This step added
inclusions to around 150 files.
3. The script was run again and the output was compared to the edits
from #2 to make sure no file was left behind.
4. Several build tests were done and a couple of problems were fixed.
e.g. lib/decompress_*.c used malloc/free() wrappers around slab
APIs requiring slab.h to be added manually.
5. The script was run on all .h files but without automatically
editing them as sprinkling gfp.h and slab.h inclusions around .h
files could easily lead to inclusion dependency hell. Most gfp.h
inclusion directives were ignored as stuff from gfp.h was usually
wildly available and often used in preprocessor macros. Each
slab.h inclusion directive was examined and added manually as
necessary.
6. percpu.h was updated not to include slab.h.
7. Build test were done on the following configurations and failures
were fixed. CONFIG_GCOV_KERNEL was turned off for all tests (as my
distributed build env didn't work with gcov compiles) and a few
more options had to be turned off depending on archs to make things
build (like ipr on powerpc/64 which failed due to missing writeq).
* x86 and x86_64 UP and SMP allmodconfig and a custom test config.
* powerpc and powerpc64 SMP allmodconfig
* sparc and sparc64 SMP allmodconfig
* ia64 SMP allmodconfig
* s390 SMP allmodconfig
* alpha SMP allmodconfig
* um on x86_64 SMP allmodconfig
8. percpu.h modifications were reverted so that it could be applied as
a separate patch and serve as bisection point.
Given the fact that I had only a couple of failures from tests on step
6, I'm fairly confident about the coverage of this conversion patch.
If there is a breakage, it's likely to be something in one of the arch
headers which should be easily discoverable easily on most builds of
the specific arch.
Signed-off-by: Tejun Heo <tj@kernel.org>
Guess-its-ok-by: Christoph Lameter <cl@linux-foundation.org>
Cc: Ingo Molnar <mingo@redhat.com>
Cc: Lee Schermerhorn <Lee.Schermerhorn@hp.com>
2010-03-24 16:04:11 +08:00
|
|
|
#include <linux/slab.h>
|
2011-03-25 22:20:14 +08:00
|
|
|
#include <linux/delay.h>
|
2008-06-02 21:56:14 +08:00
|
|
|
|
|
|
|
#include <asm/mmu_context.h>
|
2009-01-21 16:26:06 +08:00
|
|
|
#include <asm/uv/uv.h>
|
2008-06-02 21:56:14 +08:00
|
|
|
#include <asm/uv/uv_mmrs.h>
|
2008-06-18 20:28:19 +08:00
|
|
|
#include <asm/uv/uv_hub.h>
|
2008-06-02 21:56:14 +08:00
|
|
|
#include <asm/uv/uv_bau.h>
|
2009-02-17 20:58:15 +08:00
|
|
|
#include <asm/apic.h>
|
2008-06-18 20:28:19 +08:00
|
|
|
#include <asm/idle.h>
|
2008-06-12 21:23:48 +08:00
|
|
|
#include <asm/tsc.h>
|
2008-08-20 01:51:59 +08:00
|
|
|
#include <asm/irq_vectors.h>
|
2010-04-15 00:35:46 +08:00
|
|
|
#include <asm/timer.h>
|
2008-06-02 21:56:14 +08:00
|
|
|
|
2010-06-03 05:22:01 +08:00
|
|
|
/* timeouts in nanoseconds (indexed by UVH_AGING_PRESCALE_SEL urgency7 30:28) */
|
|
|
|
static int timeout_base_ns[] = {
|
|
|
|
20,
|
|
|
|
160,
|
|
|
|
1280,
|
|
|
|
10240,
|
|
|
|
81920,
|
|
|
|
655360,
|
|
|
|
5242880,
|
|
|
|
167772160
|
|
|
|
};
|
2011-05-25 02:07:36 +08:00
|
|
|
|
2010-06-03 05:22:01 +08:00
|
|
|
static int timeout_us;
|
2010-06-03 05:22:01 +08:00
|
|
|
static int nobau;
|
2012-06-22 21:13:30 +08:00
|
|
|
static int nobau_perm;
|
2010-06-03 05:22:02 +08:00
|
|
|
static cycles_t congested_cycles;
|
2010-06-03 05:22:01 +08:00
|
|
|
|
2010-06-03 05:22:01 +08:00
|
|
|
/* tunables: */
|
2011-05-25 02:07:36 +08:00
|
|
|
static int max_concurr = MAX_BAU_CONCURRENT;
|
|
|
|
static int max_concurr_const = MAX_BAU_CONCURRENT;
|
|
|
|
static int plugged_delay = PLUGGED_DELAY;
|
|
|
|
static int plugsb4reset = PLUGSB4RESET;
|
2012-06-22 21:14:59 +08:00
|
|
|
static int giveup_limit = GIVEUP_LIMIT;
|
2011-05-25 02:07:36 +08:00
|
|
|
static int timeoutsb4reset = TIMEOUTSB4RESET;
|
|
|
|
static int ipi_reset_limit = IPI_RESET_LIMIT;
|
|
|
|
static int complete_threshold = COMPLETE_THRESHOLD;
|
|
|
|
static int congested_respns_us = CONGESTED_RESPONSE_US;
|
|
|
|
static int congested_reps = CONGESTED_REPS;
|
2012-06-22 21:14:59 +08:00
|
|
|
static int disabled_period = DISABLED_PERIOD;
|
2011-05-25 02:07:36 +08:00
|
|
|
|
|
|
|
static struct tunables tunables[] = {
|
|
|
|
{&max_concurr, MAX_BAU_CONCURRENT}, /* must be [0] */
|
|
|
|
{&plugged_delay, PLUGGED_DELAY},
|
|
|
|
{&plugsb4reset, PLUGSB4RESET},
|
|
|
|
{&timeoutsb4reset, TIMEOUTSB4RESET},
|
|
|
|
{&ipi_reset_limit, IPI_RESET_LIMIT},
|
|
|
|
{&complete_threshold, COMPLETE_THRESHOLD},
|
|
|
|
{&congested_respns_us, CONGESTED_RESPONSE_US},
|
|
|
|
{&congested_reps, CONGESTED_REPS},
|
2012-06-22 21:14:59 +08:00
|
|
|
{&disabled_period, DISABLED_PERIOD},
|
|
|
|
{&giveup_limit, GIVEUP_LIMIT}
|
2011-05-25 02:07:36 +08:00
|
|
|
};
|
|
|
|
|
2010-06-03 05:22:01 +08:00
|
|
|
static struct dentry *tunables_dir;
|
|
|
|
static struct dentry *tunables_file;
|
2008-06-18 20:28:19 +08:00
|
|
|
|
2011-05-25 02:07:36 +08:00
|
|
|
/* these correspond to the statistics printed by ptc_seq_show() */
|
|
|
|
static char *stat_description[] = {
|
|
|
|
"sent: number of shootdown messages sent",
|
|
|
|
"stime: time spent sending messages",
|
|
|
|
"numuvhubs: number of hubs targeted with shootdown",
|
|
|
|
"numuvhubs16: number times 16 or more hubs targeted",
|
|
|
|
"numuvhubs8: number times 8 or more hubs targeted",
|
|
|
|
"numuvhubs4: number times 4 or more hubs targeted",
|
|
|
|
"numuvhubs2: number times 2 or more hubs targeted",
|
|
|
|
"numuvhubs1: number times 1 hub targeted",
|
|
|
|
"numcpus: number of cpus targeted with shootdown",
|
|
|
|
"dto: number of destination timeouts",
|
|
|
|
"retries: destination timeout retries sent",
|
|
|
|
"rok: : destination timeouts successfully retried",
|
|
|
|
"resetp: ipi-style resource resets for plugs",
|
|
|
|
"resett: ipi-style resource resets for timeouts",
|
|
|
|
"giveup: fall-backs to ipi-style shootdowns",
|
|
|
|
"sto: number of source timeouts",
|
|
|
|
"bz: number of stay-busy's",
|
|
|
|
"throt: number times spun in throttle",
|
|
|
|
"swack: image of UVH_LB_BAU_INTD_SOFTWARE_ACKNOWLEDGE",
|
|
|
|
"recv: shootdown messages received",
|
|
|
|
"rtime: time spent processing messages",
|
|
|
|
"all: shootdown all-tlb messages",
|
|
|
|
"one: shootdown one-tlb messages",
|
|
|
|
"mult: interrupts that found multiple messages",
|
|
|
|
"none: interrupts that found no messages",
|
|
|
|
"retry: number of retry messages processed",
|
|
|
|
"canc: number messages canceled by retries",
|
|
|
|
"nocan: number retries that found nothing to cancel",
|
|
|
|
"reset: number of ipi-style reset requests processed",
|
|
|
|
"rcan: number messages canceled by reset requests",
|
|
|
|
"disable: number times use of the BAU was disabled",
|
|
|
|
"enable: number times use of the BAU was re-enabled"
|
|
|
|
};
|
|
|
|
|
|
|
|
static int __init
|
|
|
|
setup_nobau(char *arg)
|
2010-04-15 00:35:46 +08:00
|
|
|
{
|
|
|
|
nobau = 1;
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
early_param("nobau", setup_nobau);
|
2008-06-18 20:28:19 +08:00
|
|
|
|
2010-04-15 00:35:46 +08:00
|
|
|
/* base pnode in this partition */
|
2011-05-25 02:07:36 +08:00
|
|
|
static int uv_base_pnode __read_mostly;
|
2008-06-02 21:56:14 +08:00
|
|
|
|
2008-06-18 20:15:43 +08:00
|
|
|
static DEFINE_PER_CPU(struct ptc_stats, ptcstats);
|
|
|
|
static DEFINE_PER_CPU(struct bau_control, bau_control);
|
2010-04-15 00:35:46 +08:00
|
|
|
static DEFINE_PER_CPU(cpumask_var_t, uv_flush_tlb_mask);
|
|
|
|
|
2012-06-22 21:13:30 +08:00
|
|
|
static void
|
|
|
|
set_bau_on(void)
|
|
|
|
{
|
|
|
|
int cpu;
|
|
|
|
struct bau_control *bcp;
|
|
|
|
|
|
|
|
if (nobau_perm) {
|
|
|
|
pr_info("BAU not initialized; cannot be turned on\n");
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
nobau = 0;
|
|
|
|
for_each_present_cpu(cpu) {
|
|
|
|
bcp = &per_cpu(bau_control, cpu);
|
|
|
|
bcp->nobau = 0;
|
|
|
|
}
|
|
|
|
pr_info("BAU turned on\n");
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
static void
|
|
|
|
set_bau_off(void)
|
|
|
|
{
|
|
|
|
int cpu;
|
|
|
|
struct bau_control *bcp;
|
|
|
|
|
|
|
|
nobau = 1;
|
|
|
|
for_each_present_cpu(cpu) {
|
|
|
|
bcp = &per_cpu(bau_control, cpu);
|
|
|
|
bcp->nobau = 1;
|
|
|
|
}
|
|
|
|
pr_info("BAU turned off\n");
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
2009-04-03 21:34:05 +08:00
|
|
|
/*
|
2010-04-15 00:35:46 +08:00
|
|
|
* Determine the first node on a uvhub. 'Nodes' are used for kernel
|
|
|
|
* memory allocation.
|
2009-04-03 21:34:05 +08:00
|
|
|
*/
|
2010-04-15 00:35:46 +08:00
|
|
|
static int __init uvhub_to_first_node(int uvhub)
|
2009-04-03 21:34:05 +08:00
|
|
|
{
|
|
|
|
int node, b;
|
|
|
|
|
|
|
|
for_each_online_node(node) {
|
|
|
|
b = uv_node_to_blade_id(node);
|
2010-04-15 00:35:46 +08:00
|
|
|
if (uvhub == b)
|
2009-04-03 21:34:05 +08:00
|
|
|
return node;
|
|
|
|
}
|
2010-04-15 00:35:46 +08:00
|
|
|
return -1;
|
2009-04-03 21:34:05 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
2010-04-15 00:35:46 +08:00
|
|
|
* Determine the apicid of the first cpu on a uvhub.
|
2009-04-03 21:34:05 +08:00
|
|
|
*/
|
2010-04-15 00:35:46 +08:00
|
|
|
static int __init uvhub_to_first_apicid(int uvhub)
|
2009-04-03 21:34:05 +08:00
|
|
|
{
|
|
|
|
int cpu;
|
|
|
|
|
|
|
|
for_each_present_cpu(cpu)
|
2010-04-15 00:35:46 +08:00
|
|
|
if (uvhub == uv_cpu_to_blade_id(cpu))
|
2009-04-03 21:34:05 +08:00
|
|
|
return per_cpu(x86_cpu_to_apicid, cpu);
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
|
2008-06-02 21:56:14 +08:00
|
|
|
/*
|
|
|
|
* Free a software acknowledge hardware resource by clearing its Pending
|
|
|
|
* bit. This will return a reply to the sender.
|
|
|
|
* If the message has timed out, a reply has already been sent by the
|
|
|
|
* hardware but the resource has not been released. In that case our
|
|
|
|
* clear of the Timeout bit (as well) will free the resource. No reply will
|
|
|
|
* be sent (the hardware will only do one reply per message).
|
|
|
|
*/
|
2012-01-17 05:19:47 +08:00
|
|
|
static void reply_to_message(struct msg_desc *mdp, struct bau_control *bcp,
|
|
|
|
int do_acknowledge)
|
2008-06-02 21:56:14 +08:00
|
|
|
{
|
2008-06-12 21:23:48 +08:00
|
|
|
unsigned long dw;
|
2011-05-25 02:07:36 +08:00
|
|
|
struct bau_pq_entry *msg;
|
2008-06-02 21:56:14 +08:00
|
|
|
|
2010-04-15 00:35:46 +08:00
|
|
|
msg = mdp->msg;
|
2012-01-17 05:19:47 +08:00
|
|
|
if (!msg->canceled && do_acknowledge) {
|
2011-05-25 02:07:36 +08:00
|
|
|
dw = (msg->swack_vec << UV_SW_ACK_NPENDING) | msg->swack_vec;
|
|
|
|
write_mmr_sw_ack(dw);
|
2010-04-15 00:35:46 +08:00
|
|
|
}
|
2008-06-02 21:56:14 +08:00
|
|
|
msg->replied_to = 1;
|
2011-05-25 02:07:36 +08:00
|
|
|
msg->swack_vec = 0;
|
2008-06-02 21:56:14 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
2010-04-15 00:35:46 +08:00
|
|
|
* Process the receipt of a RETRY message
|
2008-06-02 21:56:14 +08:00
|
|
|
*/
|
2011-05-25 02:07:36 +08:00
|
|
|
static void bau_process_retry_msg(struct msg_desc *mdp,
|
|
|
|
struct bau_control *bcp)
|
2008-06-02 21:56:14 +08:00
|
|
|
{
|
2010-04-15 00:35:46 +08:00
|
|
|
int i;
|
|
|
|
int cancel_count = 0;
|
|
|
|
unsigned long msg_res;
|
|
|
|
unsigned long mmr = 0;
|
2011-05-25 02:07:36 +08:00
|
|
|
struct bau_pq_entry *msg = mdp->msg;
|
|
|
|
struct bau_pq_entry *msg2;
|
|
|
|
struct ptc_stats *stat = bcp->statp;
|
2008-06-02 21:56:14 +08:00
|
|
|
|
2010-04-15 00:35:46 +08:00
|
|
|
stat->d_retries++;
|
|
|
|
/*
|
|
|
|
* cancel any message from msg+1 to the retry itself
|
|
|
|
*/
|
|
|
|
for (msg2 = msg+1, i = 0; i < DEST_Q_SIZE; msg2++, i++) {
|
2011-05-25 02:07:36 +08:00
|
|
|
if (msg2 > mdp->queue_last)
|
|
|
|
msg2 = mdp->queue_first;
|
2010-04-15 00:35:46 +08:00
|
|
|
if (msg2 == msg)
|
|
|
|
break;
|
|
|
|
|
2011-05-25 02:07:36 +08:00
|
|
|
/* same conditions for cancellation as do_reset */
|
2010-04-15 00:35:46 +08:00
|
|
|
if ((msg2->replied_to == 0) && (msg2->canceled == 0) &&
|
2011-05-25 02:07:36 +08:00
|
|
|
(msg2->swack_vec) && ((msg2->swack_vec &
|
|
|
|
msg->swack_vec) == 0) &&
|
2010-04-15 00:35:46 +08:00
|
|
|
(msg2->sending_cpu == msg->sending_cpu) &&
|
|
|
|
(msg2->msg_type != MSG_NOOP)) {
|
2011-05-25 02:07:36 +08:00
|
|
|
mmr = read_mmr_sw_ack();
|
|
|
|
msg_res = msg2->swack_vec;
|
2010-04-15 00:35:46 +08:00
|
|
|
/*
|
|
|
|
* This is a message retry; clear the resources held
|
|
|
|
* by the previous message only if they timed out.
|
|
|
|
* If it has not timed out we have an unexpected
|
|
|
|
* situation to report.
|
|
|
|
*/
|
2010-06-03 05:22:02 +08:00
|
|
|
if (mmr & (msg_res << UV_SW_ACK_NPENDING)) {
|
2011-05-25 02:07:36 +08:00
|
|
|
unsigned long mr;
|
2010-04-15 00:35:46 +08:00
|
|
|
/*
|
2012-01-17 05:19:47 +08:00
|
|
|
* Is the resource timed out?
|
|
|
|
* Make everyone ignore the cancelled message.
|
2010-04-15 00:35:46 +08:00
|
|
|
*/
|
|
|
|
msg2->canceled = 1;
|
|
|
|
stat->d_canceled++;
|
|
|
|
cancel_count++;
|
2011-05-25 02:07:36 +08:00
|
|
|
mr = (msg_res << UV_SW_ACK_NPENDING) | msg_res;
|
|
|
|
write_mmr_sw_ack(mr);
|
2010-06-03 05:22:02 +08:00
|
|
|
}
|
2010-04-15 00:35:46 +08:00
|
|
|
}
|
|
|
|
}
|
|
|
|
if (!cancel_count)
|
|
|
|
stat->d_nocanceled++;
|
|
|
|
}
|
2008-06-02 21:56:14 +08:00
|
|
|
|
2010-04-15 00:35:46 +08:00
|
|
|
/*
|
|
|
|
* Do all the things a cpu should do for a TLB shootdown message.
|
|
|
|
* Other cpu's may come here at the same time for this message.
|
|
|
|
*/
|
2012-01-17 05:19:47 +08:00
|
|
|
static void bau_process_message(struct msg_desc *mdp, struct bau_control *bcp,
|
|
|
|
int do_acknowledge)
|
2010-04-15 00:35:46 +08:00
|
|
|
{
|
|
|
|
short socket_ack_count = 0;
|
2011-05-25 02:07:36 +08:00
|
|
|
short *sp;
|
|
|
|
struct atomic_short *asp;
|
|
|
|
struct ptc_stats *stat = bcp->statp;
|
|
|
|
struct bau_pq_entry *msg = mdp->msg;
|
2010-04-15 00:35:46 +08:00
|
|
|
struct bau_control *smaster = bcp->socket_master;
|
2008-06-02 21:56:14 +08:00
|
|
|
|
2010-04-15 00:35:46 +08:00
|
|
|
/*
|
|
|
|
* This must be a normal message, or retry of a normal message
|
|
|
|
*/
|
2008-06-02 21:56:14 +08:00
|
|
|
if (msg->address == TLB_FLUSH_ALL) {
|
|
|
|
local_flush_tlb();
|
2010-04-15 00:35:46 +08:00
|
|
|
stat->d_alltlb++;
|
2008-06-02 21:56:14 +08:00
|
|
|
} else {
|
|
|
|
__flush_tlb_one(msg->address);
|
2010-04-15 00:35:46 +08:00
|
|
|
stat->d_onetlb++;
|
2008-06-02 21:56:14 +08:00
|
|
|
}
|
2010-04-15 00:35:46 +08:00
|
|
|
stat->d_requestee++;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* One cpu on each uvhub has the additional job on a RETRY
|
|
|
|
* of releasing the resource held by the message that is
|
|
|
|
* being retried. That message is identified by sending
|
|
|
|
* cpu number.
|
|
|
|
*/
|
|
|
|
if (msg->msg_type == MSG_RETRY && bcp == bcp->uvhub_master)
|
2011-05-25 02:07:36 +08:00
|
|
|
bau_process_retry_msg(mdp, bcp);
|
2008-06-02 21:56:14 +08:00
|
|
|
|
2010-04-15 00:35:46 +08:00
|
|
|
/*
|
2011-05-25 02:07:36 +08:00
|
|
|
* This is a swack message, so we have to reply to it.
|
2010-04-15 00:35:46 +08:00
|
|
|
* Count each responding cpu on the socket. This avoids
|
|
|
|
* pinging the count's cache line back and forth between
|
|
|
|
* the sockets.
|
|
|
|
*/
|
2011-05-25 02:07:36 +08:00
|
|
|
sp = &smaster->socket_acknowledge_count[mdp->msg_slot];
|
|
|
|
asp = (struct atomic_short *)sp;
|
|
|
|
socket_ack_count = atom_asr(1, asp);
|
2010-04-15 00:35:46 +08:00
|
|
|
if (socket_ack_count == bcp->cpus_in_socket) {
|
2011-05-25 02:07:36 +08:00
|
|
|
int msg_ack_count;
|
2010-04-15 00:35:46 +08:00
|
|
|
/*
|
|
|
|
* Both sockets dump their completed count total into
|
|
|
|
* the message's count.
|
|
|
|
*/
|
2012-06-22 21:14:59 +08:00
|
|
|
*sp = 0;
|
2011-05-25 02:07:36 +08:00
|
|
|
asp = (struct atomic_short *)&msg->acknowledge_count;
|
|
|
|
msg_ack_count = atom_asr(socket_ack_count, asp);
|
2010-04-15 00:35:46 +08:00
|
|
|
|
|
|
|
if (msg_ack_count == bcp->cpus_in_uvhub) {
|
|
|
|
/*
|
|
|
|
* All cpus in uvhub saw it; reply
|
2012-01-17 05:19:47 +08:00
|
|
|
* (unless we are in the UV2 workaround)
|
2010-04-15 00:35:46 +08:00
|
|
|
*/
|
2012-01-17 05:19:47 +08:00
|
|
|
reply_to_message(mdp, bcp, do_acknowledge);
|
2010-04-15 00:35:46 +08:00
|
|
|
}
|
|
|
|
}
|
2008-06-02 21:56:14 +08:00
|
|
|
|
2010-04-15 00:35:46 +08:00
|
|
|
return;
|
2008-06-02 21:56:14 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
2011-06-21 20:21:29 +08:00
|
|
|
* Determine the first cpu on a pnode.
|
2010-04-15 00:35:46 +08:00
|
|
|
*/
|
2011-06-21 20:21:29 +08:00
|
|
|
static int pnode_to_first_cpu(int pnode, struct bau_control *smaster)
|
2010-04-15 00:35:46 +08:00
|
|
|
{
|
|
|
|
int cpu;
|
2011-06-21 20:21:29 +08:00
|
|
|
struct hub_and_pnode *hpp;
|
|
|
|
|
|
|
|
for_each_present_cpu(cpu) {
|
|
|
|
hpp = &smaster->thp[cpu];
|
|
|
|
if (pnode == hpp->pnode)
|
2010-04-15 00:35:46 +08:00
|
|
|
return cpu;
|
2011-06-21 20:21:29 +08:00
|
|
|
}
|
2010-04-15 00:35:46 +08:00
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Last resort when we get a large number of destination timeouts is
|
|
|
|
* to clear resources held by a given cpu.
|
|
|
|
* Do this with IPI so that all messages in the BAU message queue
|
2011-05-25 02:07:36 +08:00
|
|
|
* can be identified by their nonzero swack_vec field.
|
2008-06-02 21:56:14 +08:00
|
|
|
*
|
2010-04-15 00:35:46 +08:00
|
|
|
* This is entered for a single cpu on the uvhub.
|
|
|
|
* The sender want's this uvhub to free a specific message's
|
2011-05-25 02:07:36 +08:00
|
|
|
* swack resources.
|
2008-06-02 21:56:14 +08:00
|
|
|
*/
|
2011-05-25 02:07:36 +08:00
|
|
|
static void do_reset(void *ptr)
|
2008-06-02 21:56:14 +08:00
|
|
|
{
|
2008-06-18 20:28:19 +08:00
|
|
|
int i;
|
2011-05-25 02:07:36 +08:00
|
|
|
struct bau_control *bcp = &per_cpu(bau_control, smp_processor_id());
|
|
|
|
struct reset_args *rap = (struct reset_args *)ptr;
|
|
|
|
struct bau_pq_entry *msg;
|
|
|
|
struct ptc_stats *stat = bcp->statp;
|
2008-06-02 21:56:14 +08:00
|
|
|
|
2010-04-15 00:35:46 +08:00
|
|
|
stat->d_resets++;
|
|
|
|
/*
|
|
|
|
* We're looking for the given sender, and
|
2011-05-25 02:07:36 +08:00
|
|
|
* will free its swack resource.
|
2010-04-15 00:35:46 +08:00
|
|
|
* If all cpu's finally responded after the timeout, its
|
|
|
|
* message 'replied_to' was set.
|
|
|
|
*/
|
2011-05-25 02:07:36 +08:00
|
|
|
for (msg = bcp->queue_first, i = 0; i < DEST_Q_SIZE; msg++, i++) {
|
|
|
|
unsigned long msg_res;
|
|
|
|
/* do_reset: same conditions for cancellation as
|
|
|
|
bau_process_retry_msg() */
|
2010-04-15 00:35:46 +08:00
|
|
|
if ((msg->replied_to == 0) &&
|
|
|
|
(msg->canceled == 0) &&
|
|
|
|
(msg->sending_cpu == rap->sender) &&
|
2011-05-25 02:07:36 +08:00
|
|
|
(msg->swack_vec) &&
|
2010-04-15 00:35:46 +08:00
|
|
|
(msg->msg_type != MSG_NOOP)) {
|
2011-05-25 02:07:36 +08:00
|
|
|
unsigned long mmr;
|
|
|
|
unsigned long mr;
|
2010-04-15 00:35:46 +08:00
|
|
|
/*
|
|
|
|
* make everyone else ignore this message
|
|
|
|
*/
|
|
|
|
msg->canceled = 1;
|
|
|
|
/*
|
|
|
|
* only reset the resource if it is still pending
|
|
|
|
*/
|
2011-05-25 02:07:36 +08:00
|
|
|
mmr = read_mmr_sw_ack();
|
|
|
|
msg_res = msg->swack_vec;
|
|
|
|
mr = (msg_res << UV_SW_ACK_NPENDING) | msg_res;
|
2010-04-15 00:35:46 +08:00
|
|
|
if (mmr & msg_res) {
|
|
|
|
stat->d_rcanceled++;
|
2011-05-25 02:07:36 +08:00
|
|
|
write_mmr_sw_ack(mr);
|
2008-06-18 20:15:43 +08:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
2010-04-15 00:35:46 +08:00
|
|
|
return;
|
2008-06-18 20:15:43 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
2010-04-15 00:35:46 +08:00
|
|
|
* Use IPI to get all target uvhubs to release resources held by
|
|
|
|
* a given sending cpu number.
|
2008-06-18 20:15:43 +08:00
|
|
|
*/
|
2011-06-21 20:21:30 +08:00
|
|
|
static void reset_with_ipi(struct pnmask *distribution, struct bau_control *bcp)
|
2008-06-18 20:15:43 +08:00
|
|
|
{
|
2011-06-21 20:21:29 +08:00
|
|
|
int pnode;
|
|
|
|
int apnode;
|
2011-05-25 02:07:36 +08:00
|
|
|
int maskbits;
|
2011-06-21 20:21:29 +08:00
|
|
|
int sender = bcp->cpu;
|
2011-06-21 20:21:31 +08:00
|
|
|
cpumask_t *mask = bcp->uvhub_master->cpumask;
|
2011-06-21 20:21:29 +08:00
|
|
|
struct bau_control *smaster = bcp->socket_master;
|
2010-04-15 00:35:46 +08:00
|
|
|
struct reset_args reset_args;
|
2008-06-18 20:15:43 +08:00
|
|
|
|
2010-04-15 00:35:46 +08:00
|
|
|
reset_args.sender = sender;
|
2011-06-21 20:21:31 +08:00
|
|
|
cpus_clear(*mask);
|
2010-04-15 00:35:46 +08:00
|
|
|
/* find a single cpu for each uvhub in this distribution mask */
|
2011-06-21 20:21:30 +08:00
|
|
|
maskbits = sizeof(struct pnmask) * BITSPERBYTE;
|
2011-06-21 20:21:29 +08:00
|
|
|
/* each bit is a pnode relative to the partition base pnode */
|
|
|
|
for (pnode = 0; pnode < maskbits; pnode++) {
|
2011-05-25 02:07:36 +08:00
|
|
|
int cpu;
|
2011-06-21 20:21:29 +08:00
|
|
|
if (!bau_uvhub_isset(pnode, distribution))
|
2008-06-12 21:23:48 +08:00
|
|
|
continue;
|
2011-06-21 20:21:29 +08:00
|
|
|
apnode = pnode + bcp->partition_base_pnode;
|
|
|
|
cpu = pnode_to_first_cpu(apnode, smaster);
|
2011-06-21 20:21:31 +08:00
|
|
|
cpu_set(cpu, *mask);
|
2008-06-02 21:56:14 +08:00
|
|
|
}
|
2011-05-25 02:07:36 +08:00
|
|
|
|
|
|
|
/* IPI all cpus; preemption is already disabled */
|
2011-06-21 20:21:31 +08:00
|
|
|
smp_call_function_many(mask, do_reset, (void *)&reset_args, 1);
|
2010-04-15 00:35:46 +08:00
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
2011-05-25 02:07:36 +08:00
|
|
|
static inline unsigned long cycles_2_us(unsigned long long cyc)
|
2010-04-15 00:35:46 +08:00
|
|
|
{
|
|
|
|
unsigned long long ns;
|
|
|
|
unsigned long us;
|
2011-05-25 02:07:36 +08:00
|
|
|
int cpu = smp_processor_id();
|
|
|
|
|
|
|
|
ns = (cyc * per_cpu(cyc2ns, cpu)) >> CYC2NS_SCALE_FACTOR;
|
2010-04-15 00:35:46 +08:00
|
|
|
us = ns / 1000;
|
|
|
|
return us;
|
2008-06-02 21:56:14 +08:00
|
|
|
}
|
|
|
|
|
2008-06-12 21:23:48 +08:00
|
|
|
/*
|
2010-04-15 00:35:46 +08:00
|
|
|
* wait for all cpus on this hub to finish their sends and go quiet
|
|
|
|
* leaves uvhub_quiesce set so that no new broadcasts are started by
|
|
|
|
* bau_flush_send_and_wait()
|
|
|
|
*/
|
2011-05-25 02:07:36 +08:00
|
|
|
static inline void quiesce_local_uvhub(struct bau_control *hmaster)
|
2010-04-15 00:35:46 +08:00
|
|
|
{
|
2011-05-25 02:07:36 +08:00
|
|
|
atom_asr(1, (struct atomic_short *)&hmaster->uvhub_quiesce);
|
2010-04-15 00:35:46 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* mark this quiet-requestor as done
|
|
|
|
*/
|
2011-05-25 02:07:36 +08:00
|
|
|
static inline void end_uvhub_quiesce(struct bau_control *hmaster)
|
2010-04-15 00:35:46 +08:00
|
|
|
{
|
2011-05-25 02:07:36 +08:00
|
|
|
atom_asr(-1, (struct atomic_short *)&hmaster->uvhub_quiesce);
|
|
|
|
}
|
|
|
|
|
|
|
|
static unsigned long uv1_read_status(unsigned long mmr_offset, int right_shift)
|
|
|
|
{
|
|
|
|
unsigned long descriptor_status;
|
|
|
|
|
|
|
|
descriptor_status = uv_read_local_mmr(mmr_offset);
|
|
|
|
descriptor_status >>= right_shift;
|
|
|
|
descriptor_status &= UV_ACT_STATUS_MASK;
|
|
|
|
return descriptor_status;
|
2010-04-15 00:35:46 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Wait for completion of a broadcast software ack message
|
|
|
|
* return COMPLETE, RETRY(PLUGGED or TIMEOUT) or GIVEUP
|
2008-06-12 21:23:48 +08:00
|
|
|
*/
|
2011-05-12 01:50:28 +08:00
|
|
|
static int uv1_wait_completion(struct bau_desc *bau_desc,
|
2011-05-25 02:07:36 +08:00
|
|
|
unsigned long mmr_offset, int right_shift,
|
|
|
|
struct bau_control *bcp, long try)
|
2008-06-12 21:23:48 +08:00
|
|
|
{
|
|
|
|
unsigned long descriptor_status;
|
2011-05-25 02:07:36 +08:00
|
|
|
cycles_t ttm;
|
2010-06-03 05:22:02 +08:00
|
|
|
struct ptc_stats *stat = bcp->statp;
|
2008-06-12 21:23:48 +08:00
|
|
|
|
2011-05-25 02:07:36 +08:00
|
|
|
descriptor_status = uv1_read_status(mmr_offset, right_shift);
|
2010-04-15 00:35:46 +08:00
|
|
|
/* spin on the status MMR, waiting for it to go idle */
|
2011-05-25 02:07:36 +08:00
|
|
|
while ((descriptor_status != DS_IDLE)) {
|
2008-06-12 21:23:48 +08:00
|
|
|
/*
|
2011-05-12 01:50:28 +08:00
|
|
|
* Our software ack messages may be blocked because
|
|
|
|
* there are no swack resources available. As long
|
|
|
|
* as none of them has timed out hardware will NACK
|
|
|
|
* our message and its state will stay IDLE.
|
2008-06-12 21:23:48 +08:00
|
|
|
*/
|
2011-05-25 02:07:36 +08:00
|
|
|
if (descriptor_status == DS_SOURCE_TIMEOUT) {
|
2010-04-15 00:35:46 +08:00
|
|
|
stat->s_stimeout++;
|
|
|
|
return FLUSH_GIVEUP;
|
2011-05-25 02:07:36 +08:00
|
|
|
} else if (descriptor_status == DS_DESTINATION_TIMEOUT) {
|
2011-05-12 01:50:28 +08:00
|
|
|
stat->s_dtimeout++;
|
2011-05-25 02:07:36 +08:00
|
|
|
ttm = get_cycles();
|
2011-05-12 01:50:28 +08:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Our retries may be blocked by all destination
|
|
|
|
* swack resources being consumed, and a timeout
|
|
|
|
* pending. In that case hardware returns the
|
|
|
|
* ERROR that looks like a destination timeout.
|
|
|
|
*/
|
2011-05-25 02:07:36 +08:00
|
|
|
if (cycles_2_us(ttm - bcp->send_message) < timeout_us) {
|
2011-05-12 01:50:28 +08:00
|
|
|
bcp->conseccompletes = 0;
|
|
|
|
return FLUSH_RETRY_PLUGGED;
|
|
|
|
}
|
|
|
|
|
|
|
|
bcp->conseccompletes = 0;
|
|
|
|
return FLUSH_RETRY_TIMEOUT;
|
|
|
|
} else {
|
|
|
|
/*
|
|
|
|
* descriptor_status is still BUSY
|
|
|
|
*/
|
|
|
|
cpu_relax();
|
|
|
|
}
|
2011-05-25 02:07:36 +08:00
|
|
|
descriptor_status = uv1_read_status(mmr_offset, right_shift);
|
2011-05-12 01:50:28 +08:00
|
|
|
}
|
|
|
|
bcp->conseccompletes++;
|
|
|
|
return FLUSH_COMPLETE;
|
|
|
|
}
|
|
|
|
|
2011-05-25 02:07:36 +08:00
|
|
|
/*
|
2012-06-22 21:14:59 +08:00
|
|
|
* UV2 could have an extra bit of status in the ACTIVATION_STATUS_2 register.
|
|
|
|
* But not currently used.
|
2011-05-25 02:07:36 +08:00
|
|
|
*/
|
2012-01-17 05:19:47 +08:00
|
|
|
static unsigned long uv2_read_status(unsigned long offset, int rshft, int desc)
|
2011-05-12 01:50:28 +08:00
|
|
|
{
|
|
|
|
unsigned long descriptor_status;
|
2011-05-25 02:07:36 +08:00
|
|
|
|
2012-06-22 21:14:59 +08:00
|
|
|
descriptor_status =
|
|
|
|
((read_lmmr(offset) >> rshft) & UV_ACT_STATUS_MASK) << 1;
|
2011-05-25 02:07:36 +08:00
|
|
|
return descriptor_status;
|
|
|
|
}
|
|
|
|
|
2012-01-17 05:19:47 +08:00
|
|
|
/*
|
|
|
|
* Return whether the status of the descriptor that is normally used for this
|
|
|
|
* cpu (the one indexed by its hub-relative cpu number) is busy.
|
|
|
|
* The status of the original 32 descriptors is always reflected in the 64
|
|
|
|
* bits of UVH_LB_BAU_SB_ACTIVATION_STATUS_0.
|
|
|
|
* The bit provided by the activation_status_2 register is irrelevant to
|
|
|
|
* the status if it is only being tested for busy or not busy.
|
|
|
|
*/
|
|
|
|
int normal_busy(struct bau_control *bcp)
|
|
|
|
{
|
|
|
|
int cpu = bcp->uvhub_cpu;
|
|
|
|
int mmr_offset;
|
|
|
|
int right_shift;
|
|
|
|
|
|
|
|
mmr_offset = UVH_LB_BAU_SB_ACTIVATION_STATUS_0;
|
|
|
|
right_shift = cpu * UV_ACT_STATUS_SIZE;
|
|
|
|
return (((((read_lmmr(mmr_offset) >> right_shift) &
|
|
|
|
UV_ACT_STATUS_MASK)) << 1) == UV2H_DESC_BUSY);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Entered when a bau descriptor has gone into a permanent busy wait because
|
|
|
|
* of a hardware bug.
|
|
|
|
* Workaround the bug.
|
|
|
|
*/
|
|
|
|
int handle_uv2_busy(struct bau_control *bcp)
|
|
|
|
{
|
|
|
|
struct ptc_stats *stat = bcp->statp;
|
|
|
|
|
|
|
|
stat->s_uv2_wars++;
|
2012-06-22 21:14:59 +08:00
|
|
|
bcp->busy = 1;
|
|
|
|
return FLUSH_GIVEUP;
|
2012-01-17 05:19:47 +08:00
|
|
|
}
|
|
|
|
|
2011-05-25 02:07:36 +08:00
|
|
|
static int uv2_wait_completion(struct bau_desc *bau_desc,
|
|
|
|
unsigned long mmr_offset, int right_shift,
|
|
|
|
struct bau_control *bcp, long try)
|
|
|
|
{
|
|
|
|
unsigned long descriptor_stat;
|
|
|
|
cycles_t ttm;
|
2012-06-22 21:14:59 +08:00
|
|
|
int desc = bcp->uvhub_cpu;
|
2012-01-17 05:19:47 +08:00
|
|
|
long busy_reps = 0;
|
2011-05-12 01:50:28 +08:00
|
|
|
struct ptc_stats *stat = bcp->statp;
|
|
|
|
|
2012-01-17 05:19:47 +08:00
|
|
|
descriptor_stat = uv2_read_status(mmr_offset, right_shift, desc);
|
2011-05-25 02:07:36 +08:00
|
|
|
|
2011-05-12 01:50:28 +08:00
|
|
|
/* spin on the status MMR, waiting for it to go idle */
|
2011-05-25 02:07:36 +08:00
|
|
|
while (descriptor_stat != UV2H_DESC_IDLE) {
|
2012-06-22 21:14:59 +08:00
|
|
|
if ((descriptor_stat == UV2H_DESC_SOURCE_TIMEOUT)) {
|
|
|
|
/*
|
|
|
|
* A h/w bug on the destination side may
|
|
|
|
* have prevented the message being marked
|
|
|
|
* pending, thus it doesn't get replied to
|
|
|
|
* and gets continually nacked until it times
|
|
|
|
* out with a SOURCE_TIMEOUT.
|
|
|
|
*/
|
2011-05-12 01:50:28 +08:00
|
|
|
stat->s_stimeout++;
|
|
|
|
return FLUSH_GIVEUP;
|
2011-05-25 02:07:36 +08:00
|
|
|
} else if (descriptor_stat == UV2H_DESC_DEST_TIMEOUT) {
|
2012-06-22 21:14:59 +08:00
|
|
|
ttm = get_cycles();
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Our retries may be blocked by all destination
|
|
|
|
* swack resources being consumed, and a timeout
|
|
|
|
* pending. In that case hardware returns the
|
|
|
|
* ERROR that looks like a destination timeout.
|
|
|
|
* Without using the extended status we have to
|
|
|
|
* deduce from the short time that this was a
|
|
|
|
* strong nack.
|
|
|
|
*/
|
|
|
|
if (cycles_2_us(ttm - bcp->send_message) < timeout_us) {
|
|
|
|
bcp->conseccompletes = 0;
|
|
|
|
stat->s_plugged++;
|
|
|
|
/* FLUSH_RETRY_PLUGGED causes hang on boot */
|
|
|
|
return FLUSH_GIVEUP;
|
|
|
|
}
|
2010-04-15 00:35:46 +08:00
|
|
|
stat->s_dtimeout++;
|
|
|
|
bcp->conseccompletes = 0;
|
2012-06-22 21:14:59 +08:00
|
|
|
/* FLUSH_RETRY_TIMEOUT causes hang on boot */
|
|
|
|
return FLUSH_GIVEUP;
|
2010-04-15 00:35:46 +08:00
|
|
|
} else {
|
2012-01-17 05:19:47 +08:00
|
|
|
busy_reps++;
|
|
|
|
if (busy_reps > 1000000) {
|
|
|
|
/* not to hammer on the clock */
|
|
|
|
busy_reps = 0;
|
|
|
|
ttm = get_cycles();
|
|
|
|
if ((ttm - bcp->send_message) >
|
2012-06-22 21:14:59 +08:00
|
|
|
bcp->timeout_interval)
|
2012-01-17 05:19:47 +08:00
|
|
|
return handle_uv2_busy(bcp);
|
|
|
|
}
|
2010-04-15 00:35:46 +08:00
|
|
|
/*
|
2011-05-25 02:07:36 +08:00
|
|
|
* descriptor_stat is still BUSY
|
2010-04-15 00:35:46 +08:00
|
|
|
*/
|
|
|
|
cpu_relax();
|
2008-06-12 21:23:48 +08:00
|
|
|
}
|
2012-01-17 05:19:47 +08:00
|
|
|
descriptor_stat = uv2_read_status(mmr_offset, right_shift,
|
|
|
|
desc);
|
2008-06-12 21:23:48 +08:00
|
|
|
}
|
2010-04-15 00:35:46 +08:00
|
|
|
bcp->conseccompletes++;
|
2008-06-12 21:23:48 +08:00
|
|
|
return FLUSH_COMPLETE;
|
|
|
|
}
|
|
|
|
|
2011-05-25 02:07:36 +08:00
|
|
|
/*
|
|
|
|
* There are 2 status registers; each and array[32] of 2 bits. Set up for
|
|
|
|
* which register to read and position in that register based on cpu in
|
|
|
|
* current hub.
|
|
|
|
*/
|
|
|
|
static int wait_completion(struct bau_desc *bau_desc,
|
|
|
|
struct bau_control *bcp, long try)
|
2011-05-12 01:50:28 +08:00
|
|
|
{
|
2011-05-25 02:07:36 +08:00
|
|
|
int right_shift;
|
|
|
|
unsigned long mmr_offset;
|
2012-06-22 21:14:59 +08:00
|
|
|
int desc = bcp->uvhub_cpu;
|
2011-05-25 02:07:36 +08:00
|
|
|
|
2012-01-17 05:19:47 +08:00
|
|
|
if (desc < UV_CPUS_PER_AS) {
|
2011-05-25 02:07:36 +08:00
|
|
|
mmr_offset = UVH_LB_BAU_SB_ACTIVATION_STATUS_0;
|
2012-01-17 05:19:47 +08:00
|
|
|
right_shift = desc * UV_ACT_STATUS_SIZE;
|
2011-05-25 02:07:36 +08:00
|
|
|
} else {
|
|
|
|
mmr_offset = UVH_LB_BAU_SB_ACTIVATION_STATUS_1;
|
2012-01-17 05:19:47 +08:00
|
|
|
right_shift = ((desc - UV_CPUS_PER_AS) * UV_ACT_STATUS_SIZE);
|
2011-05-25 02:07:36 +08:00
|
|
|
}
|
|
|
|
|
2012-01-17 05:17:50 +08:00
|
|
|
if (bcp->uvhub_version == 1)
|
2011-05-12 01:50:28 +08:00
|
|
|
return uv1_wait_completion(bau_desc, mmr_offset, right_shift,
|
2011-05-25 02:07:36 +08:00
|
|
|
bcp, try);
|
2011-05-12 01:50:28 +08:00
|
|
|
else
|
|
|
|
return uv2_wait_completion(bau_desc, mmr_offset, right_shift,
|
2011-05-25 02:07:36 +08:00
|
|
|
bcp, try);
|
2011-05-12 01:50:28 +08:00
|
|
|
}
|
|
|
|
|
2011-05-25 02:07:36 +08:00
|
|
|
static inline cycles_t sec_2_cycles(unsigned long sec)
|
2010-04-15 00:35:46 +08:00
|
|
|
{
|
|
|
|
unsigned long ns;
|
|
|
|
cycles_t cyc;
|
|
|
|
|
|
|
|
ns = sec * 1000000000;
|
|
|
|
cyc = (ns << CYC2NS_SCALE_FACTOR)/(per_cpu(cyc2ns, smp_processor_id()));
|
|
|
|
return cyc;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
2011-05-25 02:07:36 +08:00
|
|
|
* Our retries are blocked by all destination sw ack resources being
|
2010-06-03 05:22:02 +08:00
|
|
|
* in use, and a timeout is pending. In that case hardware immediately
|
|
|
|
* returns the ERROR that looks like a destination timeout.
|
|
|
|
*/
|
2011-05-25 02:07:36 +08:00
|
|
|
static void destination_plugged(struct bau_desc *bau_desc,
|
|
|
|
struct bau_control *bcp,
|
2010-06-03 05:22:02 +08:00
|
|
|
struct bau_control *hmaster, struct ptc_stats *stat)
|
|
|
|
{
|
|
|
|
udelay(bcp->plugged_delay);
|
|
|
|
bcp->plugged_tries++;
|
2011-05-25 02:07:36 +08:00
|
|
|
|
2010-06-03 05:22:02 +08:00
|
|
|
if (bcp->plugged_tries >= bcp->plugsb4reset) {
|
|
|
|
bcp->plugged_tries = 0;
|
2011-05-25 02:07:36 +08:00
|
|
|
|
2010-06-03 05:22:02 +08:00
|
|
|
quiesce_local_uvhub(hmaster);
|
2011-05-25 02:07:36 +08:00
|
|
|
|
2010-06-03 05:22:02 +08:00
|
|
|
spin_lock(&hmaster->queue_lock);
|
2011-06-21 20:21:29 +08:00
|
|
|
reset_with_ipi(&bau_desc->distribution, bcp);
|
2010-06-03 05:22:02 +08:00
|
|
|
spin_unlock(&hmaster->queue_lock);
|
2011-05-25 02:07:36 +08:00
|
|
|
|
2010-06-03 05:22:02 +08:00
|
|
|
end_uvhub_quiesce(hmaster);
|
2011-05-25 02:07:36 +08:00
|
|
|
|
2010-06-03 05:22:02 +08:00
|
|
|
bcp->ipi_attempts++;
|
|
|
|
stat->s_resets_plug++;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2011-05-25 02:07:36 +08:00
|
|
|
static void destination_timeout(struct bau_desc *bau_desc,
|
|
|
|
struct bau_control *bcp, struct bau_control *hmaster,
|
|
|
|
struct ptc_stats *stat)
|
2010-06-03 05:22:02 +08:00
|
|
|
{
|
2011-05-25 02:07:36 +08:00
|
|
|
hmaster->max_concurr = 1;
|
2010-06-03 05:22:02 +08:00
|
|
|
bcp->timeout_tries++;
|
|
|
|
if (bcp->timeout_tries >= bcp->timeoutsb4reset) {
|
|
|
|
bcp->timeout_tries = 0;
|
2011-05-25 02:07:36 +08:00
|
|
|
|
2010-06-03 05:22:02 +08:00
|
|
|
quiesce_local_uvhub(hmaster);
|
2011-05-25 02:07:36 +08:00
|
|
|
|
2010-06-03 05:22:02 +08:00
|
|
|
spin_lock(&hmaster->queue_lock);
|
2011-06-21 20:21:29 +08:00
|
|
|
reset_with_ipi(&bau_desc->distribution, bcp);
|
2010-06-03 05:22:02 +08:00
|
|
|
spin_unlock(&hmaster->queue_lock);
|
2011-05-25 02:07:36 +08:00
|
|
|
|
2010-06-03 05:22:02 +08:00
|
|
|
end_uvhub_quiesce(hmaster);
|
2011-05-25 02:07:36 +08:00
|
|
|
|
2010-06-03 05:22:02 +08:00
|
|
|
bcp->ipi_attempts++;
|
|
|
|
stat->s_resets_timeout++;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2010-06-03 05:22:02 +08:00
|
|
|
/*
|
2012-06-22 21:14:59 +08:00
|
|
|
* Stop all cpus on a uvhub from using the BAU for a period of time.
|
|
|
|
* This is reversed by check_enable.
|
2010-06-03 05:22:02 +08:00
|
|
|
*/
|
2012-06-22 21:14:59 +08:00
|
|
|
static void disable_for_period(struct bau_control *bcp, struct ptc_stats *stat)
|
2010-06-03 05:22:02 +08:00
|
|
|
{
|
2012-06-22 21:14:59 +08:00
|
|
|
int tcpu;
|
|
|
|
struct bau_control *tbcp;
|
|
|
|
struct bau_control *hmaster;
|
|
|
|
cycles_t tm1;
|
|
|
|
|
|
|
|
hmaster = bcp->uvhub_master;
|
|
|
|
spin_lock(&hmaster->disable_lock);
|
|
|
|
if (!bcp->baudisabled) {
|
2010-06-03 05:22:02 +08:00
|
|
|
stat->s_bau_disabled++;
|
2012-06-22 21:14:59 +08:00
|
|
|
tm1 = get_cycles();
|
2010-06-03 05:22:02 +08:00
|
|
|
for_each_present_cpu(tcpu) {
|
|
|
|
tbcp = &per_cpu(bau_control, tcpu);
|
2012-06-22 21:14:59 +08:00
|
|
|
if (tbcp->uvhub_master == hmaster) {
|
|
|
|
tbcp->baudisabled = 1;
|
|
|
|
tbcp->set_bau_on_time =
|
|
|
|
tm1 + bcp->disabled_period;
|
|
|
|
}
|
2010-06-03 05:22:02 +08:00
|
|
|
}
|
|
|
|
}
|
2012-06-22 21:14:59 +08:00
|
|
|
spin_unlock(&hmaster->disable_lock);
|
2010-06-03 05:22:02 +08:00
|
|
|
}
|
|
|
|
|
2011-05-25 02:07:36 +08:00
|
|
|
static void count_max_concurr(int stat, struct bau_control *bcp,
|
|
|
|
struct bau_control *hmaster)
|
|
|
|
{
|
|
|
|
bcp->plugged_tries = 0;
|
|
|
|
bcp->timeout_tries = 0;
|
|
|
|
if (stat != FLUSH_COMPLETE)
|
|
|
|
return;
|
|
|
|
if (bcp->conseccompletes <= bcp->complete_threshold)
|
|
|
|
return;
|
|
|
|
if (hmaster->max_concurr >= hmaster->max_concurr_const)
|
|
|
|
return;
|
|
|
|
hmaster->max_concurr++;
|
|
|
|
}
|
|
|
|
|
|
|
|
static void record_send_stats(cycles_t time1, cycles_t time2,
|
|
|
|
struct bau_control *bcp, struct ptc_stats *stat,
|
|
|
|
int completion_status, int try)
|
|
|
|
{
|
|
|
|
cycles_t elapsed;
|
|
|
|
|
|
|
|
if (time2 > time1) {
|
|
|
|
elapsed = time2 - time1;
|
|
|
|
stat->s_time += elapsed;
|
|
|
|
|
|
|
|
if ((completion_status == FLUSH_COMPLETE) && (try == 1)) {
|
|
|
|
bcp->period_requests++;
|
|
|
|
bcp->period_time += elapsed;
|
|
|
|
if ((elapsed > congested_cycles) &&
|
2012-06-22 21:14:59 +08:00
|
|
|
(bcp->period_requests > bcp->cong_reps) &&
|
|
|
|
((bcp->period_time / bcp->period_requests) >
|
|
|
|
congested_cycles)) {
|
|
|
|
stat->s_congested++;
|
|
|
|
disable_for_period(bcp, stat);
|
|
|
|
}
|
2011-05-25 02:07:36 +08:00
|
|
|
}
|
|
|
|
} else
|
|
|
|
stat->s_requestor--;
|
|
|
|
|
|
|
|
if (completion_status == FLUSH_COMPLETE && try > 1)
|
|
|
|
stat->s_retriesok++;
|
2012-06-22 21:14:59 +08:00
|
|
|
else if (completion_status == FLUSH_GIVEUP) {
|
2011-05-25 02:07:36 +08:00
|
|
|
stat->s_giveup++;
|
2012-06-22 21:14:59 +08:00
|
|
|
if (get_cycles() > bcp->period_end)
|
|
|
|
bcp->period_giveups = 0;
|
|
|
|
bcp->period_giveups++;
|
|
|
|
if (bcp->period_giveups == 1)
|
|
|
|
bcp->period_end = get_cycles() + bcp->disabled_period;
|
|
|
|
if (bcp->period_giveups > bcp->giveup_limit) {
|
|
|
|
disable_for_period(bcp, stat);
|
|
|
|
stat->s_giveuplimit++;
|
|
|
|
}
|
|
|
|
}
|
2011-05-25 02:07:36 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Because of a uv1 hardware bug only a limited number of concurrent
|
|
|
|
* requests can be made.
|
|
|
|
*/
|
|
|
|
static void uv1_throttle(struct bau_control *hmaster, struct ptc_stats *stat)
|
|
|
|
{
|
|
|
|
spinlock_t *lock = &hmaster->uvhub_lock;
|
|
|
|
atomic_t *v;
|
|
|
|
|
|
|
|
v = &hmaster->active_descriptor_count;
|
|
|
|
if (!atomic_inc_unless_ge(lock, v, hmaster->max_concurr)) {
|
|
|
|
stat->s_throttles++;
|
|
|
|
do {
|
|
|
|
cpu_relax();
|
|
|
|
} while (!atomic_inc_unless_ge(lock, v, hmaster->max_concurr));
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Handle the completion status of a message send.
|
|
|
|
*/
|
|
|
|
static void handle_cmplt(int completion_status, struct bau_desc *bau_desc,
|
|
|
|
struct bau_control *bcp, struct bau_control *hmaster,
|
|
|
|
struct ptc_stats *stat)
|
|
|
|
{
|
|
|
|
if (completion_status == FLUSH_RETRY_PLUGGED)
|
|
|
|
destination_plugged(bau_desc, bcp, hmaster, stat);
|
|
|
|
else if (completion_status == FLUSH_RETRY_TIMEOUT)
|
|
|
|
destination_timeout(bau_desc, bcp, hmaster, stat);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
2010-04-15 00:35:46 +08:00
|
|
|
* Send a broadcast and wait for it to complete.
|
2008-06-12 21:23:48 +08:00
|
|
|
*
|
2010-06-03 05:22:02 +08:00
|
|
|
* The flush_mask contains the cpus the broadcast is to be sent to including
|
2010-04-15 00:35:46 +08:00
|
|
|
* cpus that are on the local uvhub.
|
2008-06-12 21:23:48 +08:00
|
|
|
*
|
2010-06-03 05:22:02 +08:00
|
|
|
* Returns 0 if all flushing represented in the mask was done.
|
|
|
|
* Returns 1 if it gives up entirely and the original cpu mask is to be
|
|
|
|
* returned to the kernel.
|
2008-06-12 21:23:48 +08:00
|
|
|
*/
|
2012-06-22 21:14:59 +08:00
|
|
|
int uv_flush_send_and_wait(struct cpumask *flush_mask, struct bau_control *bcp,
|
|
|
|
struct bau_desc *bau_desc)
|
2008-06-12 21:23:48 +08:00
|
|
|
{
|
2010-04-15 00:35:46 +08:00
|
|
|
int seq_number = 0;
|
2011-05-25 02:07:36 +08:00
|
|
|
int completion_stat = 0;
|
2012-01-17 05:17:50 +08:00
|
|
|
int uv1 = 0;
|
2010-04-15 00:35:46 +08:00
|
|
|
long try = 0;
|
2008-06-18 20:28:19 +08:00
|
|
|
unsigned long index;
|
2008-06-12 21:23:48 +08:00
|
|
|
cycles_t time1;
|
|
|
|
cycles_t time2;
|
2010-06-03 05:22:02 +08:00
|
|
|
struct ptc_stats *stat = bcp->statp;
|
2010-04-15 00:35:46 +08:00
|
|
|
struct bau_control *hmaster = bcp->uvhub_master;
|
2012-01-17 05:17:50 +08:00
|
|
|
struct uv1_bau_msg_header *uv1_hdr = NULL;
|
|
|
|
struct uv2_bau_msg_header *uv2_hdr = NULL;
|
2010-04-15 00:35:46 +08:00
|
|
|
|
2012-06-22 21:14:59 +08:00
|
|
|
if (bcp->uvhub_version == 1) {
|
|
|
|
uv1 = 1;
|
2011-05-25 02:07:36 +08:00
|
|
|
uv1_throttle(hmaster, stat);
|
2012-06-22 21:14:59 +08:00
|
|
|
}
|
2011-05-25 02:07:36 +08:00
|
|
|
|
2010-04-15 00:35:46 +08:00
|
|
|
while (hmaster->uvhub_quiesce)
|
|
|
|
cpu_relax();
|
2008-06-12 21:23:48 +08:00
|
|
|
|
|
|
|
time1 = get_cycles();
|
2012-06-22 21:14:59 +08:00
|
|
|
if (uv1)
|
|
|
|
uv1_hdr = &bau_desc->header.uv1_hdr;
|
|
|
|
else
|
|
|
|
uv2_hdr = &bau_desc->header.uv2_hdr;
|
|
|
|
|
2008-06-12 21:23:48 +08:00
|
|
|
do {
|
2012-06-22 21:14:59 +08:00
|
|
|
if (try == 0) {
|
2012-01-17 05:17:50 +08:00
|
|
|
if (uv1)
|
|
|
|
uv1_hdr->msg_type = MSG_REGULAR;
|
|
|
|
else
|
|
|
|
uv2_hdr->msg_type = MSG_REGULAR;
|
2010-04-15 00:35:46 +08:00
|
|
|
seq_number = bcp->message_number++;
|
|
|
|
} else {
|
2012-01-17 05:17:50 +08:00
|
|
|
if (uv1)
|
|
|
|
uv1_hdr->msg_type = MSG_RETRY;
|
|
|
|
else
|
|
|
|
uv2_hdr->msg_type = MSG_RETRY;
|
2010-04-15 00:35:46 +08:00
|
|
|
stat->s_retry_messages++;
|
|
|
|
}
|
2011-05-25 02:07:36 +08:00
|
|
|
|
2012-01-17 05:17:50 +08:00
|
|
|
if (uv1)
|
|
|
|
uv1_hdr->sequence = seq_number;
|
|
|
|
else
|
|
|
|
uv2_hdr->sequence = seq_number;
|
2012-06-22 21:14:59 +08:00
|
|
|
index = (1UL << AS_PUSH_SHIFT) | bcp->uvhub_cpu;
|
2010-04-15 00:35:46 +08:00
|
|
|
bcp->send_message = get_cycles();
|
2011-05-25 02:07:36 +08:00
|
|
|
|
|
|
|
write_mmr_activation(index);
|
|
|
|
|
2010-04-15 00:35:46 +08:00
|
|
|
try++;
|
2011-05-25 02:07:36 +08:00
|
|
|
completion_stat = wait_completion(bau_desc, bcp, try);
|
|
|
|
|
|
|
|
handle_cmplt(completion_stat, bau_desc, bcp, hmaster, stat);
|
2010-04-15 00:35:46 +08:00
|
|
|
|
2010-06-03 05:22:01 +08:00
|
|
|
if (bcp->ipi_attempts >= bcp->ipi_reset_limit) {
|
2010-04-15 00:35:46 +08:00
|
|
|
bcp->ipi_attempts = 0;
|
2012-06-22 21:14:59 +08:00
|
|
|
stat->s_overipilimit++;
|
2011-05-25 02:07:36 +08:00
|
|
|
completion_stat = FLUSH_GIVEUP;
|
2010-04-15 00:35:46 +08:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
cpu_relax();
|
2011-05-25 02:07:36 +08:00
|
|
|
} while ((completion_stat == FLUSH_RETRY_PLUGGED) ||
|
|
|
|
(completion_stat == FLUSH_RETRY_TIMEOUT));
|
|
|
|
|
2008-06-12 21:23:48 +08:00
|
|
|
time2 = get_cycles();
|
2011-05-25 02:07:36 +08:00
|
|
|
|
|
|
|
count_max_concurr(completion_stat, bcp, hmaster);
|
|
|
|
|
2010-04-15 00:35:46 +08:00
|
|
|
while (hmaster->uvhub_quiesce)
|
|
|
|
cpu_relax();
|
2011-05-25 02:07:36 +08:00
|
|
|
|
2010-04-15 00:35:46 +08:00
|
|
|
atomic_dec(&hmaster->active_descriptor_count);
|
2011-05-25 02:07:36 +08:00
|
|
|
|
|
|
|
record_send_stats(time1, time2, bcp, stat, completion_stat, try);
|
|
|
|
|
|
|
|
if (completion_stat == FLUSH_GIVEUP)
|
2012-01-17 05:19:47 +08:00
|
|
|
/* FLUSH_GIVEUP will fall back to using IPI's for tlb flush */
|
2011-05-25 02:07:36 +08:00
|
|
|
return 1;
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
2012-06-22 21:14:59 +08:00
|
|
|
* The BAU is disabled for this uvhub. When the disabled time period has
|
|
|
|
* expired re-enable it.
|
|
|
|
* Return 0 if it is re-enabled for all cpus on this uvhub.
|
2011-05-25 02:07:36 +08:00
|
|
|
*/
|
|
|
|
static int check_enable(struct bau_control *bcp, struct ptc_stats *stat)
|
|
|
|
{
|
|
|
|
int tcpu;
|
|
|
|
struct bau_control *tbcp;
|
2012-06-22 21:14:59 +08:00
|
|
|
struct bau_control *hmaster;
|
2011-05-25 02:07:36 +08:00
|
|
|
|
2012-06-22 21:14:59 +08:00
|
|
|
hmaster = bcp->uvhub_master;
|
|
|
|
spin_lock(&hmaster->disable_lock);
|
|
|
|
if (bcp->baudisabled && (get_cycles() >= bcp->set_bau_on_time)) {
|
|
|
|
stat->s_bau_reenabled++;
|
|
|
|
for_each_present_cpu(tcpu) {
|
|
|
|
tbcp = &per_cpu(bau_control, tcpu);
|
|
|
|
if (tbcp->uvhub_master == hmaster) {
|
2011-05-25 02:07:36 +08:00
|
|
|
tbcp->baudisabled = 0;
|
|
|
|
tbcp->period_requests = 0;
|
|
|
|
tbcp->period_time = 0;
|
2012-06-22 21:14:59 +08:00
|
|
|
tbcp->period_giveups = 0;
|
2010-06-03 05:22:02 +08:00
|
|
|
}
|
|
|
|
}
|
2012-06-22 21:14:59 +08:00
|
|
|
spin_unlock(&hmaster->disable_lock);
|
|
|
|
return 0;
|
2011-05-25 02:07:36 +08:00
|
|
|
}
|
2012-06-22 21:14:59 +08:00
|
|
|
spin_unlock(&hmaster->disable_lock);
|
2011-05-25 02:07:36 +08:00
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
|
|
|
|
static void record_send_statistics(struct ptc_stats *stat, int locals, int hubs,
|
|
|
|
int remotes, struct bau_desc *bau_desc)
|
|
|
|
{
|
|
|
|
stat->s_requestor++;
|
|
|
|
stat->s_ntargcpu += remotes + locals;
|
|
|
|
stat->s_ntargremotes += remotes;
|
|
|
|
stat->s_ntarglocals += locals;
|
|
|
|
|
|
|
|
/* uvhub statistics */
|
|
|
|
hubs = bau_uvhub_weight(&bau_desc->distribution);
|
|
|
|
if (locals) {
|
|
|
|
stat->s_ntarglocaluvhub++;
|
|
|
|
stat->s_ntargremoteuvhub += (hubs - 1);
|
2010-06-03 05:22:01 +08:00
|
|
|
} else
|
2011-05-25 02:07:36 +08:00
|
|
|
stat->s_ntargremoteuvhub += hubs;
|
|
|
|
|
|
|
|
stat->s_ntarguvhub += hubs;
|
|
|
|
|
|
|
|
if (hubs >= 16)
|
|
|
|
stat->s_ntarguvhub16++;
|
|
|
|
else if (hubs >= 8)
|
|
|
|
stat->s_ntarguvhub8++;
|
|
|
|
else if (hubs >= 4)
|
|
|
|
stat->s_ntarguvhub4++;
|
|
|
|
else if (hubs >= 2)
|
|
|
|
stat->s_ntarguvhub2++;
|
|
|
|
else
|
|
|
|
stat->s_ntarguvhub1++;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Translate a cpu mask to the uvhub distribution mask in the BAU
|
|
|
|
* activation descriptor.
|
|
|
|
*/
|
|
|
|
static int set_distrib_bits(struct cpumask *flush_mask, struct bau_control *bcp,
|
|
|
|
struct bau_desc *bau_desc, int *localsp, int *remotesp)
|
|
|
|
{
|
|
|
|
int cpu;
|
|
|
|
int pnode;
|
|
|
|
int cnt = 0;
|
|
|
|
struct hub_and_pnode *hpp;
|
|
|
|
|
|
|
|
for_each_cpu(cpu, flush_mask) {
|
|
|
|
/*
|
|
|
|
* The distribution vector is a bit map of pnodes, relative
|
|
|
|
* to the partition base pnode (and the partition base nasid
|
|
|
|
* in the header).
|
|
|
|
* Translate cpu to pnode and hub using a local memory array.
|
|
|
|
*/
|
|
|
|
hpp = &bcp->socket_master->thp[cpu];
|
|
|
|
pnode = hpp->pnode - bcp->partition_base_pnode;
|
|
|
|
bau_uvhub_set(pnode, &bau_desc->distribution);
|
|
|
|
cnt++;
|
|
|
|
if (hpp->uvhub == bcp->uvhub)
|
|
|
|
(*localsp)++;
|
|
|
|
else
|
|
|
|
(*remotesp)++;
|
2008-06-12 21:23:48 +08:00
|
|
|
}
|
2011-05-25 02:07:36 +08:00
|
|
|
if (!cnt)
|
|
|
|
return 1;
|
2010-06-03 05:22:02 +08:00
|
|
|
return 0;
|
2008-06-12 21:23:48 +08:00
|
|
|
}
|
|
|
|
|
2011-05-25 02:07:36 +08:00
|
|
|
/*
|
|
|
|
* globally purge translation cache of a virtual address or all TLB's
|
2009-01-21 16:26:06 +08:00
|
|
|
* @cpumask: mask of all cpu's in which the address is to be removed
|
2008-06-02 21:56:14 +08:00
|
|
|
* @mm: mm_struct containing virtual address range
|
|
|
|
* @va: virtual address to be removed (or TLB_FLUSH_ALL for all TLB's on cpu)
|
2009-01-21 16:26:06 +08:00
|
|
|
* @cpu: the current cpu
|
2008-06-02 21:56:14 +08:00
|
|
|
*
|
|
|
|
* This is the entry point for initiating any UV global TLB shootdown.
|
|
|
|
*
|
|
|
|
* Purges the translation caches of all specified processors of the given
|
|
|
|
* virtual address, or purges all TLB's on specified processors.
|
|
|
|
*
|
2009-01-21 16:26:06 +08:00
|
|
|
* The caller has derived the cpumask from the mm_struct. This function
|
|
|
|
* is called only if there are bits set in the mask. (e.g. flush_tlb_page())
|
2008-06-02 21:56:14 +08:00
|
|
|
*
|
2010-04-15 00:35:46 +08:00
|
|
|
* The cpumask is converted into a uvhubmask of the uvhubs containing
|
|
|
|
* those cpus.
|
2008-06-12 21:23:48 +08:00
|
|
|
*
|
2009-01-21 16:26:06 +08:00
|
|
|
* Note that this function should be called with preemption disabled.
|
|
|
|
*
|
|
|
|
* Returns NULL if all remote flushing was done.
|
|
|
|
* Returns pointer to cpumask if some remote flushing remains to be
|
|
|
|
* done. The returned pointer is valid till preemption is re-enabled.
|
2008-06-02 21:56:14 +08:00
|
|
|
*/
|
2009-01-21 16:26:06 +08:00
|
|
|
const struct cpumask *uv_flush_tlb_others(const struct cpumask *cpumask,
|
x86/flush_tlb: try flush_tlb_single one by one in flush_tlb_range
x86 has no flush_tlb_range support in instruction level. Currently the
flush_tlb_range just implemented by flushing all page table. That is not
the best solution for all scenarios. In fact, if we just use 'invlpg' to
flush few lines from TLB, we can get the performance gain from later
remain TLB lines accessing.
But the 'invlpg' instruction costs much of time. Its execution time can
compete with cr3 rewriting, and even a bit more on SNB CPU.
So, on a 512 4KB TLB entries CPU, the balance points is at:
(512 - X) * 100ns(assumed TLB refill cost) =
X(TLB flush entries) * 100ns(assumed invlpg cost)
Here, X is 256, that is 1/2 of 512 entries.
But with the mysterious CPU pre-fetcher and page miss handler Unit, the
assumed TLB refill cost is far lower then 100ns in sequential access. And
2 HT siblings in one core makes the memory access more faster if they are
accessing the same memory. So, in the patch, I just do the change when
the target entries is less than 1/16 of whole active tlb entries.
Actually, I have no data support for the percentage '1/16', so any
suggestions are welcomed.
As to hugetlb, guess due to smaller page table, and smaller active TLB
entries, I didn't see benefit via my benchmark, so no optimizing now.
My micro benchmark show in ideal scenarios, the performance improves 70
percent in reading. And in worst scenario, the reading/writing
performance is similar with unpatched 3.4-rc4 kernel.
Here is the reading data on my 2P * 4cores *HT NHM EP machine, with THP
'always':
multi thread testing, '-t' paramter is thread number:
with patch unpatched 3.4-rc4
./mprotect -t 1 14ns 24ns
./mprotect -t 2 13ns 22ns
./mprotect -t 4 12ns 19ns
./mprotect -t 8 14ns 16ns
./mprotect -t 16 28ns 26ns
./mprotect -t 32 54ns 51ns
./mprotect -t 128 200ns 199ns
Single process with sequencial flushing and memory accessing:
with patch unpatched 3.4-rc4
./mprotect 7ns 11ns
./mprotect -p 4096 -l 8 -n 10240
21ns 21ns
[ hpa: http://lkml.kernel.org/r/1B4B44D9196EFF41AE41FDA404FC0A100BFF94@SHSMSX101.ccr.corp.intel.com
has additional performance numbers. ]
Signed-off-by: Alex Shi <alex.shi@intel.com>
Link: http://lkml.kernel.org/r/1340845344-27557-3-git-send-email-alex.shi@intel.com
Signed-off-by: H. Peter Anvin <hpa@zytor.com>
2012-06-28 09:02:17 +08:00
|
|
|
struct mm_struct *mm, unsigned long start,
|
|
|
|
unsigned end, unsigned int cpu)
|
2008-06-02 21:56:14 +08:00
|
|
|
{
|
2008-06-12 21:23:48 +08:00
|
|
|
int locals = 0;
|
2010-06-03 05:22:02 +08:00
|
|
|
int remotes = 0;
|
|
|
|
int hubs = 0;
|
2008-06-18 20:15:43 +08:00
|
|
|
struct bau_desc *bau_desc;
|
2010-04-15 00:35:46 +08:00
|
|
|
struct cpumask *flush_mask;
|
|
|
|
struct ptc_stats *stat;
|
|
|
|
struct bau_control *bcp;
|
2012-06-22 21:14:59 +08:00
|
|
|
unsigned long descriptor_status;
|
|
|
|
unsigned long status;
|
2009-01-21 16:26:06 +08:00
|
|
|
|
2010-04-15 00:35:46 +08:00
|
|
|
bcp = &per_cpu(bau_control, cpu);
|
2010-06-03 05:22:02 +08:00
|
|
|
stat = bcp->statp;
|
2012-06-22 21:13:30 +08:00
|
|
|
stat->s_enters++;
|
|
|
|
|
|
|
|
if (bcp->nobau)
|
|
|
|
return cpumask;
|
2010-06-03 05:22:02 +08:00
|
|
|
|
2012-06-22 21:14:59 +08:00
|
|
|
if (bcp->busy) {
|
|
|
|
descriptor_status =
|
|
|
|
read_lmmr(UVH_LB_BAU_SB_ACTIVATION_STATUS_0);
|
|
|
|
status = ((descriptor_status >> (bcp->uvhub_cpu *
|
|
|
|
UV_ACT_STATUS_SIZE)) & UV_ACT_STATUS_MASK) << 1;
|
|
|
|
if (status == UV2H_DESC_BUSY)
|
|
|
|
return cpumask;
|
|
|
|
bcp->busy = 0;
|
|
|
|
}
|
|
|
|
|
2010-06-03 05:22:02 +08:00
|
|
|
/* bau was disabled due to slow response */
|
|
|
|
if (bcp->baudisabled) {
|
2012-06-22 21:14:59 +08:00
|
|
|
if (check_enable(bcp, stat)) {
|
|
|
|
stat->s_ipifordisabled++;
|
2011-05-25 02:07:36 +08:00
|
|
|
return cpumask;
|
2012-06-22 21:14:59 +08:00
|
|
|
}
|
2010-06-03 05:22:02 +08:00
|
|
|
}
|
2010-06-03 05:22:01 +08:00
|
|
|
|
2010-04-15 00:35:46 +08:00
|
|
|
/*
|
|
|
|
* Each sending cpu has a per-cpu mask which it fills from the caller's
|
2010-06-03 05:22:02 +08:00
|
|
|
* cpu mask. All cpus are converted to uvhubs and copied to the
|
|
|
|
* activation descriptor.
|
2010-04-15 00:35:46 +08:00
|
|
|
*/
|
|
|
|
flush_mask = (struct cpumask *)per_cpu(uv_flush_tlb_mask, cpu);
|
2010-06-03 05:22:02 +08:00
|
|
|
/* don't actually do a shootdown of the local cpu */
|
2010-04-15 00:35:46 +08:00
|
|
|
cpumask_andnot(flush_mask, cpumask, cpumask_of(cpu));
|
2011-05-25 02:07:36 +08:00
|
|
|
|
2010-04-15 00:35:46 +08:00
|
|
|
if (cpu_isset(cpu, *cpumask))
|
2010-06-03 05:22:02 +08:00
|
|
|
stat->s_ntargself++;
|
2008-06-02 21:56:14 +08:00
|
|
|
|
2010-04-15 00:35:46 +08:00
|
|
|
bau_desc = bcp->descriptor_base;
|
2012-06-22 21:14:59 +08:00
|
|
|
bau_desc += (ITEMS_PER_DESC * bcp->uvhub_cpu);
|
2010-04-15 00:35:46 +08:00
|
|
|
bau_uvhubs_clear(&bau_desc->distribution, UV_DISTRIBUTION_SIZE);
|
2011-05-25 02:07:36 +08:00
|
|
|
if (set_distrib_bits(flush_mask, bcp, bau_desc, &locals, &remotes))
|
2010-06-03 05:22:02 +08:00
|
|
|
return NULL;
|
|
|
|
|
2011-05-25 02:07:36 +08:00
|
|
|
record_send_statistics(stat, locals, hubs, remotes, bau_desc);
|
2008-06-02 21:56:14 +08:00
|
|
|
|
x86/flush_tlb: try flush_tlb_single one by one in flush_tlb_range
x86 has no flush_tlb_range support in instruction level. Currently the
flush_tlb_range just implemented by flushing all page table. That is not
the best solution for all scenarios. In fact, if we just use 'invlpg' to
flush few lines from TLB, we can get the performance gain from later
remain TLB lines accessing.
But the 'invlpg' instruction costs much of time. Its execution time can
compete with cr3 rewriting, and even a bit more on SNB CPU.
So, on a 512 4KB TLB entries CPU, the balance points is at:
(512 - X) * 100ns(assumed TLB refill cost) =
X(TLB flush entries) * 100ns(assumed invlpg cost)
Here, X is 256, that is 1/2 of 512 entries.
But with the mysterious CPU pre-fetcher and page miss handler Unit, the
assumed TLB refill cost is far lower then 100ns in sequential access. And
2 HT siblings in one core makes the memory access more faster if they are
accessing the same memory. So, in the patch, I just do the change when
the target entries is less than 1/16 of whole active tlb entries.
Actually, I have no data support for the percentage '1/16', so any
suggestions are welcomed.
As to hugetlb, guess due to smaller page table, and smaller active TLB
entries, I didn't see benefit via my benchmark, so no optimizing now.
My micro benchmark show in ideal scenarios, the performance improves 70
percent in reading. And in worst scenario, the reading/writing
performance is similar with unpatched 3.4-rc4 kernel.
Here is the reading data on my 2P * 4cores *HT NHM EP machine, with THP
'always':
multi thread testing, '-t' paramter is thread number:
with patch unpatched 3.4-rc4
./mprotect -t 1 14ns 24ns
./mprotect -t 2 13ns 22ns
./mprotect -t 4 12ns 19ns
./mprotect -t 8 14ns 16ns
./mprotect -t 16 28ns 26ns
./mprotect -t 32 54ns 51ns
./mprotect -t 128 200ns 199ns
Single process with sequencial flushing and memory accessing:
with patch unpatched 3.4-rc4
./mprotect 7ns 11ns
./mprotect -p 4096 -l 8 -n 10240
21ns 21ns
[ hpa: http://lkml.kernel.org/r/1B4B44D9196EFF41AE41FDA404FC0A100BFF94@SHSMSX101.ccr.corp.intel.com
has additional performance numbers. ]
Signed-off-by: Alex Shi <alex.shi@intel.com>
Link: http://lkml.kernel.org/r/1340845344-27557-3-git-send-email-alex.shi@intel.com
Signed-off-by: H. Peter Anvin <hpa@zytor.com>
2012-06-28 09:02:17 +08:00
|
|
|
bau_desc->payload.address = start;
|
2009-01-21 16:26:06 +08:00
|
|
|
bau_desc->payload.sending_cpu = cpu;
|
2010-04-15 00:35:46 +08:00
|
|
|
/*
|
2010-06-03 05:22:02 +08:00
|
|
|
* uv_flush_send_and_wait returns 0 if all cpu's were messaged,
|
|
|
|
* or 1 if it gave up and the original cpumask should be returned.
|
2010-04-15 00:35:46 +08:00
|
|
|
*/
|
2012-06-22 21:14:59 +08:00
|
|
|
if (!uv_flush_send_and_wait(flush_mask, bcp, bau_desc))
|
2010-06-03 05:22:02 +08:00
|
|
|
return NULL;
|
|
|
|
else
|
|
|
|
return cpumask;
|
2008-06-02 21:56:14 +08:00
|
|
|
}
|
|
|
|
|
2012-01-17 05:19:47 +08:00
|
|
|
/*
|
2012-06-22 21:14:59 +08:00
|
|
|
* Search the message queue for any 'other' unprocessed message with the
|
|
|
|
* same software acknowledge resource bit vector as the 'msg' message.
|
2012-01-17 05:19:47 +08:00
|
|
|
*/
|
|
|
|
struct bau_pq_entry *find_another_by_swack(struct bau_pq_entry *msg,
|
2012-06-22 21:14:59 +08:00
|
|
|
struct bau_control *bcp)
|
2012-01-17 05:19:47 +08:00
|
|
|
{
|
|
|
|
struct bau_pq_entry *msg_next = msg + 1;
|
2012-06-22 21:14:59 +08:00
|
|
|
unsigned char swack_vec = msg->swack_vec;
|
2012-01-17 05:19:47 +08:00
|
|
|
|
|
|
|
if (msg_next > bcp->queue_last)
|
|
|
|
msg_next = bcp->queue_first;
|
2012-06-22 21:14:59 +08:00
|
|
|
while (msg_next != msg) {
|
|
|
|
if ((msg_next->canceled == 0) && (msg_next->replied_to == 0) &&
|
|
|
|
(msg_next->swack_vec == swack_vec))
|
2012-01-17 05:19:47 +08:00
|
|
|
return msg_next;
|
|
|
|
msg_next++;
|
|
|
|
if (msg_next > bcp->queue_last)
|
|
|
|
msg_next = bcp->queue_first;
|
|
|
|
}
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* UV2 needs to work around a bug in which an arriving message has not
|
|
|
|
* set a bit in the UVH_LB_BAU_INTD_SOFTWARE_ACKNOWLEDGE register.
|
|
|
|
* Such a message must be ignored.
|
|
|
|
*/
|
|
|
|
void process_uv2_message(struct msg_desc *mdp, struct bau_control *bcp)
|
|
|
|
{
|
|
|
|
unsigned long mmr_image;
|
|
|
|
unsigned char swack_vec;
|
|
|
|
struct bau_pq_entry *msg = mdp->msg;
|
|
|
|
struct bau_pq_entry *other_msg;
|
|
|
|
|
|
|
|
mmr_image = read_mmr_sw_ack();
|
|
|
|
swack_vec = msg->swack_vec;
|
|
|
|
|
|
|
|
if ((swack_vec & mmr_image) == 0) {
|
|
|
|
/*
|
|
|
|
* This message was assigned a swack resource, but no
|
|
|
|
* reserved acknowlegment is pending.
|
|
|
|
* The bug has prevented this message from setting the MMR.
|
|
|
|
*/
|
|
|
|
/*
|
2012-06-22 21:14:59 +08:00
|
|
|
* Some message has set the MMR 'pending' bit; it might have
|
|
|
|
* been another message. Look for that message.
|
2012-01-17 05:19:47 +08:00
|
|
|
*/
|
2012-06-22 21:14:59 +08:00
|
|
|
other_msg = find_another_by_swack(msg, bcp);
|
|
|
|
if (other_msg) {
|
|
|
|
/*
|
|
|
|
* There is another. Process this one but do not
|
|
|
|
* ack it.
|
|
|
|
*/
|
|
|
|
bau_process_message(mdp, bcp, 0);
|
|
|
|
/*
|
|
|
|
* Let the natural processing of that other message
|
|
|
|
* acknowledge it. Don't get the processing of sw_ack's
|
|
|
|
* out of order.
|
|
|
|
*/
|
|
|
|
return;
|
|
|
|
}
|
2012-01-17 05:19:47 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
2012-06-22 21:14:59 +08:00
|
|
|
* Either the MMR shows this one pending a reply or there is no
|
|
|
|
* other message using this sw_ack, so it is safe to acknowledge it.
|
2012-01-17 05:19:47 +08:00
|
|
|
*/
|
|
|
|
bau_process_message(mdp, bcp, 1);
|
|
|
|
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
2008-06-02 21:56:14 +08:00
|
|
|
/*
|
|
|
|
* The BAU message interrupt comes here. (registered by set_intr_gate)
|
|
|
|
* See entry_64.S
|
|
|
|
*
|
|
|
|
* We received a broadcast assist message.
|
|
|
|
*
|
2010-04-15 00:35:46 +08:00
|
|
|
* Interrupts are disabled; this interrupt could represent
|
2008-06-02 21:56:14 +08:00
|
|
|
* the receipt of several messages.
|
|
|
|
*
|
2010-04-15 00:35:46 +08:00
|
|
|
* All cores/threads on this hub get this interrupt.
|
|
|
|
* The last one to see it does the software ack.
|
2008-06-02 21:56:14 +08:00
|
|
|
* (the resource will not be freed until noninterruptable cpus see this
|
2010-04-15 00:35:46 +08:00
|
|
|
* interrupt; hardware may timeout the s/w ack and reply ERROR)
|
2008-06-02 21:56:14 +08:00
|
|
|
*/
|
2008-06-12 21:23:48 +08:00
|
|
|
void uv_bau_message_interrupt(struct pt_regs *regs)
|
2008-06-02 21:56:14 +08:00
|
|
|
{
|
|
|
|
int count = 0;
|
2010-04-15 00:35:46 +08:00
|
|
|
cycles_t time_start;
|
2011-05-25 02:07:36 +08:00
|
|
|
struct bau_pq_entry *msg;
|
2010-04-15 00:35:46 +08:00
|
|
|
struct bau_control *bcp;
|
|
|
|
struct ptc_stats *stat;
|
|
|
|
struct msg_desc msgdesc;
|
|
|
|
|
2012-01-17 05:21:46 +08:00
|
|
|
ack_APIC_irq();
|
2010-04-15 00:35:46 +08:00
|
|
|
time_start = get_cycles();
|
2011-05-25 02:07:36 +08:00
|
|
|
|
2010-04-15 00:35:46 +08:00
|
|
|
bcp = &per_cpu(bau_control, smp_processor_id());
|
2010-06-03 05:22:02 +08:00
|
|
|
stat = bcp->statp;
|
2011-05-25 02:07:36 +08:00
|
|
|
|
|
|
|
msgdesc.queue_first = bcp->queue_first;
|
|
|
|
msgdesc.queue_last = bcp->queue_last;
|
|
|
|
|
2010-04-15 00:35:46 +08:00
|
|
|
msg = bcp->bau_msg_head;
|
2011-05-25 02:07:36 +08:00
|
|
|
while (msg->swack_vec) {
|
2008-06-02 21:56:14 +08:00
|
|
|
count++;
|
2011-05-25 02:07:36 +08:00
|
|
|
|
|
|
|
msgdesc.msg_slot = msg - msgdesc.queue_first;
|
2010-04-15 00:35:46 +08:00
|
|
|
msgdesc.msg = msg;
|
2012-01-17 05:19:47 +08:00
|
|
|
if (bcp->uvhub_version == 2)
|
|
|
|
process_uv2_message(&msgdesc, bcp);
|
|
|
|
else
|
|
|
|
bau_process_message(&msgdesc, bcp, 1);
|
2011-05-25 02:07:36 +08:00
|
|
|
|
2008-06-02 21:56:14 +08:00
|
|
|
msg++;
|
2011-05-25 02:07:36 +08:00
|
|
|
if (msg > msgdesc.queue_last)
|
|
|
|
msg = msgdesc.queue_first;
|
2010-04-15 00:35:46 +08:00
|
|
|
bcp->bau_msg_head = msg;
|
2008-06-02 21:56:14 +08:00
|
|
|
}
|
2010-04-15 00:35:46 +08:00
|
|
|
stat->d_time += (get_cycles() - time_start);
|
2008-06-02 21:56:14 +08:00
|
|
|
if (!count)
|
2010-04-15 00:35:46 +08:00
|
|
|
stat->d_nomsg++;
|
2008-06-02 21:56:14 +08:00
|
|
|
else if (count > 1)
|
2010-04-15 00:35:46 +08:00
|
|
|
stat->d_multmsg++;
|
2008-06-02 21:56:14 +08:00
|
|
|
}
|
|
|
|
|
2009-04-03 21:34:32 +08:00
|
|
|
/*
|
2011-05-25 02:07:36 +08:00
|
|
|
* Each target uvhub (i.e. a uvhub that has cpu's) needs to have
|
2009-04-03 21:34:32 +08:00
|
|
|
* shootdown message timeouts enabled. The timeout does not cause
|
|
|
|
* an interrupt, but causes an error message to be returned to
|
|
|
|
* the sender.
|
|
|
|
*/
|
2011-05-25 02:07:36 +08:00
|
|
|
static void __init enable_timeouts(void)
|
2008-06-02 21:56:14 +08:00
|
|
|
{
|
2010-04-15 00:35:46 +08:00
|
|
|
int uvhub;
|
|
|
|
int nuvhubs;
|
2008-06-02 21:56:14 +08:00
|
|
|
int pnode;
|
2009-04-03 21:34:32 +08:00
|
|
|
unsigned long mmr_image;
|
2008-06-02 21:56:14 +08:00
|
|
|
|
2010-04-15 00:35:46 +08:00
|
|
|
nuvhubs = uv_num_possible_blades();
|
2008-06-02 21:56:14 +08:00
|
|
|
|
2010-04-15 00:35:46 +08:00
|
|
|
for (uvhub = 0; uvhub < nuvhubs; uvhub++) {
|
|
|
|
if (!uv_blade_nr_possible_cpus(uvhub))
|
2008-06-02 21:56:14 +08:00
|
|
|
continue;
|
2009-04-03 21:34:32 +08:00
|
|
|
|
2010-04-15 00:35:46 +08:00
|
|
|
pnode = uv_blade_to_pnode(uvhub);
|
2011-05-25 02:07:36 +08:00
|
|
|
mmr_image = read_mmr_misc_control(pnode);
|
2009-04-03 21:34:32 +08:00
|
|
|
/*
|
|
|
|
* Set the timeout period and then lock it in, in three
|
|
|
|
* steps; captures and locks in the period.
|
|
|
|
*
|
|
|
|
* To program the period, the SOFT_ACK_MODE must be off.
|
|
|
|
*/
|
2011-05-25 02:07:36 +08:00
|
|
|
mmr_image &= ~(1L << SOFTACK_MSHIFT);
|
|
|
|
write_mmr_misc_control(pnode, mmr_image);
|
2009-04-03 21:34:32 +08:00
|
|
|
/*
|
|
|
|
* Set the 4-bit period.
|
|
|
|
*/
|
2011-05-25 02:07:36 +08:00
|
|
|
mmr_image &= ~((unsigned long)0xf << SOFTACK_PSHIFT);
|
|
|
|
mmr_image |= (SOFTACK_TIMEOUT_PERIOD << SOFTACK_PSHIFT);
|
|
|
|
write_mmr_misc_control(pnode, mmr_image);
|
2009-04-03 21:34:32 +08:00
|
|
|
/*
|
2011-05-12 01:50:28 +08:00
|
|
|
* UV1:
|
2009-04-03 21:34:32 +08:00
|
|
|
* Subsequent reversals of the timebase bit (3) cause an
|
|
|
|
* immediate timeout of one or all INTD resources as
|
|
|
|
* indicated in bits 2:0 (7 causes all of them to timeout).
|
|
|
|
*/
|
2011-05-25 02:07:36 +08:00
|
|
|
mmr_image |= (1L << SOFTACK_MSHIFT);
|
2011-05-12 01:50:28 +08:00
|
|
|
if (is_uv2_hub()) {
|
2012-06-22 21:14:59 +08:00
|
|
|
/* hw bug workaround; do not use extended status */
|
|
|
|
mmr_image &= ~(1L << UV2_EXT_SHFT);
|
2011-05-12 01:50:28 +08:00
|
|
|
}
|
2011-05-25 02:07:36 +08:00
|
|
|
write_mmr_misc_control(pnode, mmr_image);
|
2008-06-02 21:56:14 +08:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2011-05-25 02:07:36 +08:00
|
|
|
static void *ptc_seq_start(struct seq_file *file, loff_t *offset)
|
2008-06-02 21:56:14 +08:00
|
|
|
{
|
|
|
|
if (*offset < num_possible_cpus())
|
|
|
|
return offset;
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
2011-05-25 02:07:36 +08:00
|
|
|
static void *ptc_seq_next(struct seq_file *file, void *data, loff_t *offset)
|
2008-06-02 21:56:14 +08:00
|
|
|
{
|
|
|
|
(*offset)++;
|
|
|
|
if (*offset < num_possible_cpus())
|
|
|
|
return offset;
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
2011-05-25 02:07:36 +08:00
|
|
|
static void ptc_seq_stop(struct seq_file *file, void *data)
|
2008-06-02 21:56:14 +08:00
|
|
|
{
|
|
|
|
}
|
|
|
|
|
2011-05-25 02:07:36 +08:00
|
|
|
static inline unsigned long long usec_2_cycles(unsigned long microsec)
|
2010-04-15 00:35:46 +08:00
|
|
|
{
|
|
|
|
unsigned long ns;
|
|
|
|
unsigned long long cyc;
|
|
|
|
|
2010-06-03 05:22:01 +08:00
|
|
|
ns = microsec * 1000;
|
2010-04-15 00:35:46 +08:00
|
|
|
cyc = (ns << CYC2NS_SCALE_FACTOR)/(per_cpu(cyc2ns, smp_processor_id()));
|
|
|
|
return cyc;
|
|
|
|
}
|
|
|
|
|
2008-06-02 21:56:14 +08:00
|
|
|
/*
|
2011-05-25 02:07:36 +08:00
|
|
|
* Display the statistics thru /proc/sgi_uv/ptc_statistics
|
2010-04-15 00:35:46 +08:00
|
|
|
* 'data' points to the cpu number
|
2011-05-25 02:07:36 +08:00
|
|
|
* Note: see the descriptions in stat_description[].
|
2008-06-02 21:56:14 +08:00
|
|
|
*/
|
2011-05-25 02:07:36 +08:00
|
|
|
static int ptc_seq_show(struct seq_file *file, void *data)
|
2008-06-02 21:56:14 +08:00
|
|
|
{
|
|
|
|
struct ptc_stats *stat;
|
2012-06-22 21:13:30 +08:00
|
|
|
struct bau_control *bcp;
|
2008-06-02 21:56:14 +08:00
|
|
|
int cpu;
|
|
|
|
|
|
|
|
cpu = *(loff_t *)data;
|
|
|
|
if (!cpu) {
|
|
|
|
seq_printf(file,
|
2012-06-22 21:14:59 +08:00
|
|
|
"# cpu bauoff sent stime self locals remotes ncpus localhub ");
|
2010-06-03 05:22:02 +08:00
|
|
|
seq_printf(file,
|
|
|
|
"remotehub numuvhubs numuvhubs16 numuvhubs8 ");
|
2008-06-02 21:56:14 +08:00
|
|
|
seq_printf(file,
|
2012-06-22 21:14:59 +08:00
|
|
|
"numuvhubs4 numuvhubs2 numuvhubs1 dto snacks retries ");
|
|
|
|
seq_printf(file,
|
|
|
|
"rok resetp resett giveup sto bz throt disable ");
|
2010-04-15 00:35:46 +08:00
|
|
|
seq_printf(file,
|
2012-06-22 21:14:59 +08:00
|
|
|
"enable wars warshw warwaits enters ipidis plugged ");
|
2010-04-15 00:35:46 +08:00
|
|
|
seq_printf(file,
|
2012-06-22 21:14:59 +08:00
|
|
|
"ipiover glim cong swack recv rtime all one mult ");
|
2010-06-03 05:22:02 +08:00
|
|
|
seq_printf(file,
|
2012-06-22 21:14:59 +08:00
|
|
|
"none retry canc nocan reset rcan\n");
|
2008-06-02 21:56:14 +08:00
|
|
|
}
|
|
|
|
if (cpu < num_possible_cpus() && cpu_online(cpu)) {
|
2012-06-22 21:13:30 +08:00
|
|
|
bcp = &per_cpu(bau_control, cpu);
|
|
|
|
stat = bcp->statp;
|
2010-04-15 00:35:46 +08:00
|
|
|
/* source side statistics */
|
|
|
|
seq_printf(file,
|
2012-06-22 21:14:59 +08:00
|
|
|
"cpu %d %d %ld %ld %ld %ld %ld %ld %ld %ld %ld %ld ",
|
2012-06-22 21:13:30 +08:00
|
|
|
cpu, bcp->nobau, stat->s_requestor,
|
|
|
|
cycles_2_us(stat->s_time),
|
2010-06-03 05:22:02 +08:00
|
|
|
stat->s_ntargself, stat->s_ntarglocals,
|
|
|
|
stat->s_ntargremotes, stat->s_ntargcpu,
|
|
|
|
stat->s_ntarglocaluvhub, stat->s_ntargremoteuvhub,
|
|
|
|
stat->s_ntarguvhub, stat->s_ntarguvhub16);
|
2012-01-17 05:22:38 +08:00
|
|
|
seq_printf(file, "%ld %ld %ld %ld %ld %ld ",
|
2010-04-15 00:35:46 +08:00
|
|
|
stat->s_ntarguvhub8, stat->s_ntarguvhub4,
|
|
|
|
stat->s_ntarguvhub2, stat->s_ntarguvhub1,
|
2012-01-17 05:22:38 +08:00
|
|
|
stat->s_dtimeout, stat->s_strongnacks);
|
2012-06-22 21:14:59 +08:00
|
|
|
seq_printf(file, "%ld %ld %ld %ld %ld %ld %ld %ld ",
|
2010-04-15 00:35:46 +08:00
|
|
|
stat->s_retry_messages, stat->s_retriesok,
|
|
|
|
stat->s_resets_plug, stat->s_resets_timeout,
|
|
|
|
stat->s_giveup, stat->s_stimeout,
|
2012-06-22 21:14:59 +08:00
|
|
|
stat->s_busy, stat->s_throttles);
|
|
|
|
seq_printf(file, "%ld %ld %ld %ld %ld %ld %ld %ld %ld %ld %ld ",
|
|
|
|
stat->s_bau_disabled, stat->s_bau_reenabled,
|
|
|
|
stat->s_uv2_wars, stat->s_uv2_wars_hw,
|
|
|
|
stat->s_uv2_war_waits, stat->s_enters,
|
|
|
|
stat->s_ipifordisabled, stat->s_plugged,
|
|
|
|
stat->s_overipilimit, stat->s_giveuplimit,
|
|
|
|
stat->s_congested);
|
2010-06-03 05:22:01 +08:00
|
|
|
|
2010-04-15 00:35:46 +08:00
|
|
|
/* destination side statistics */
|
|
|
|
seq_printf(file,
|
2012-06-22 21:14:59 +08:00
|
|
|
"%lx %ld %ld %ld %ld %ld %ld %ld %ld %ld %ld %ld\n",
|
2011-05-25 02:07:36 +08:00
|
|
|
read_gmmr_sw_ack(uv_cpu_to_pnode(cpu)),
|
2010-04-15 00:35:46 +08:00
|
|
|
stat->d_requestee, cycles_2_us(stat->d_time),
|
|
|
|
stat->d_alltlb, stat->d_onetlb, stat->d_multmsg,
|
|
|
|
stat->d_nomsg, stat->d_retries, stat->d_canceled,
|
|
|
|
stat->d_nocanceled, stat->d_resets,
|
|
|
|
stat->d_rcanceled);
|
2008-06-02 21:56:14 +08:00
|
|
|
}
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2010-06-03 05:22:01 +08:00
|
|
|
/*
|
|
|
|
* Display the tunables thru debugfs
|
|
|
|
*/
|
|
|
|
static ssize_t tunables_read(struct file *file, char __user *userbuf,
|
2011-05-25 02:07:36 +08:00
|
|
|
size_t count, loff_t *ppos)
|
2010-06-03 05:22:01 +08:00
|
|
|
{
|
2010-09-29 16:41:05 +08:00
|
|
|
char *buf;
|
2010-06-03 05:22:01 +08:00
|
|
|
int ret;
|
|
|
|
|
2012-06-22 21:14:59 +08:00
|
|
|
buf = kasprintf(GFP_KERNEL, "%s %s %s\n%d %d %d %d %d %d %d %d %d %d\n",
|
|
|
|
"max_concur plugged_delay plugsb4reset timeoutsb4reset",
|
|
|
|
"ipi_reset_limit complete_threshold congested_response_us",
|
|
|
|
"congested_reps disabled_period giveup_limit",
|
2011-05-25 02:07:36 +08:00
|
|
|
max_concurr, plugged_delay, plugsb4reset,
|
2010-06-03 05:22:01 +08:00
|
|
|
timeoutsb4reset, ipi_reset_limit, complete_threshold,
|
2012-06-22 21:14:59 +08:00
|
|
|
congested_respns_us, congested_reps, disabled_period,
|
|
|
|
giveup_limit);
|
2010-06-03 05:22:01 +08:00
|
|
|
|
2010-09-29 16:41:05 +08:00
|
|
|
if (!buf)
|
|
|
|
return -ENOMEM;
|
|
|
|
|
|
|
|
ret = simple_read_from_buffer(userbuf, count, ppos, buf, strlen(buf));
|
|
|
|
kfree(buf);
|
|
|
|
return ret;
|
2010-06-03 05:22:01 +08:00
|
|
|
}
|
|
|
|
|
2008-06-02 21:56:14 +08:00
|
|
|
/*
|
2011-05-25 02:07:36 +08:00
|
|
|
* handle a write to /proc/sgi_uv/ptc_statistics
|
|
|
|
* -1: reset the statistics
|
2008-06-02 21:56:14 +08:00
|
|
|
* 0: display meaning of the statistics
|
|
|
|
*/
|
2011-05-25 02:07:36 +08:00
|
|
|
static ssize_t ptc_proc_write(struct file *file, const char __user *user,
|
|
|
|
size_t count, loff_t *data)
|
2008-06-02 21:56:14 +08:00
|
|
|
{
|
2010-04-15 00:35:46 +08:00
|
|
|
int cpu;
|
2011-05-25 02:07:36 +08:00
|
|
|
int i;
|
|
|
|
int elements;
|
2010-04-15 00:35:46 +08:00
|
|
|
long input_arg;
|
2008-06-02 21:56:14 +08:00
|
|
|
char optstr[64];
|
2010-04-15 00:35:46 +08:00
|
|
|
struct ptc_stats *stat;
|
2008-06-02 21:56:14 +08:00
|
|
|
|
2008-06-23 21:32:25 +08:00
|
|
|
if (count == 0 || count > sizeof(optstr))
|
2008-06-20 00:16:24 +08:00
|
|
|
return -EINVAL;
|
2008-06-02 21:56:14 +08:00
|
|
|
if (copy_from_user(optstr, user, count))
|
|
|
|
return -EFAULT;
|
|
|
|
optstr[count - 1] = '\0';
|
2011-05-25 02:07:36 +08:00
|
|
|
|
2012-06-22 21:13:30 +08:00
|
|
|
if (!strcmp(optstr, "on")) {
|
|
|
|
set_bau_on();
|
|
|
|
return count;
|
|
|
|
} else if (!strcmp(optstr, "off")) {
|
|
|
|
set_bau_off();
|
|
|
|
return count;
|
|
|
|
}
|
|
|
|
|
2010-04-15 00:35:46 +08:00
|
|
|
if (strict_strtol(optstr, 10, &input_arg) < 0) {
|
2008-06-02 21:56:14 +08:00
|
|
|
printk(KERN_DEBUG "%s is invalid\n", optstr);
|
|
|
|
return -EINVAL;
|
|
|
|
}
|
|
|
|
|
2010-04-15 00:35:46 +08:00
|
|
|
if (input_arg == 0) {
|
2011-05-25 02:07:36 +08:00
|
|
|
elements = sizeof(stat_description)/sizeof(*stat_description);
|
2008-06-02 21:56:14 +08:00
|
|
|
printk(KERN_DEBUG "# cpu: cpu number\n");
|
2010-04-15 00:35:46 +08:00
|
|
|
printk(KERN_DEBUG "Sender statistics:\n");
|
2011-05-25 02:07:36 +08:00
|
|
|
for (i = 0; i < elements; i++)
|
|
|
|
printk(KERN_DEBUG "%s\n", stat_description[i]);
|
2010-04-15 00:35:46 +08:00
|
|
|
} else if (input_arg == -1) {
|
|
|
|
for_each_present_cpu(cpu) {
|
|
|
|
stat = &per_cpu(ptcstats, cpu);
|
|
|
|
memset(stat, 0, sizeof(struct ptc_stats));
|
|
|
|
}
|
2010-06-03 05:22:01 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
return count;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int local_atoi(const char *name)
|
|
|
|
{
|
|
|
|
int val = 0;
|
|
|
|
|
|
|
|
for (;; name++) {
|
|
|
|
switch (*name) {
|
|
|
|
case '0' ... '9':
|
|
|
|
val = 10*val+(*name-'0');
|
|
|
|
break;
|
|
|
|
default:
|
|
|
|
return val;
|
2010-04-15 00:35:46 +08:00
|
|
|
}
|
2008-06-02 21:56:14 +08:00
|
|
|
}
|
2010-06-03 05:22:01 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
2011-05-25 02:07:36 +08:00
|
|
|
* Parse the values written to /sys/kernel/debug/sgi_uv/bau_tunables.
|
|
|
|
* Zero values reset them to defaults.
|
2010-06-03 05:22:01 +08:00
|
|
|
*/
|
2011-05-25 02:07:36 +08:00
|
|
|
static int parse_tunables_write(struct bau_control *bcp, char *instr,
|
|
|
|
int count)
|
2010-06-03 05:22:01 +08:00
|
|
|
{
|
|
|
|
char *p;
|
|
|
|
char *q;
|
2011-05-25 02:07:36 +08:00
|
|
|
int cnt = 0;
|
|
|
|
int val;
|
|
|
|
int e = sizeof(tunables) / sizeof(*tunables);
|
2010-06-03 05:22:01 +08:00
|
|
|
|
|
|
|
p = instr + strspn(instr, WHITESPACE);
|
|
|
|
q = p;
|
|
|
|
for (; *p; p = q + strspn(q, WHITESPACE)) {
|
|
|
|
q = p + strcspn(p, WHITESPACE);
|
|
|
|
cnt++;
|
|
|
|
if (q == p)
|
|
|
|
break;
|
|
|
|
}
|
2011-05-25 02:07:36 +08:00
|
|
|
if (cnt != e) {
|
|
|
|
printk(KERN_INFO "bau tunable error: should be %d values\n", e);
|
2010-06-03 05:22:01 +08:00
|
|
|
return -EINVAL;
|
|
|
|
}
|
|
|
|
|
|
|
|
p = instr + strspn(instr, WHITESPACE);
|
|
|
|
q = p;
|
|
|
|
for (cnt = 0; *p; p = q + strspn(q, WHITESPACE), cnt++) {
|
|
|
|
q = p + strcspn(p, WHITESPACE);
|
|
|
|
val = local_atoi(p);
|
|
|
|
switch (cnt) {
|
|
|
|
case 0:
|
|
|
|
if (val == 0) {
|
2011-05-25 02:07:36 +08:00
|
|
|
max_concurr = MAX_BAU_CONCURRENT;
|
|
|
|
max_concurr_const = MAX_BAU_CONCURRENT;
|
2010-06-03 05:22:01 +08:00
|
|
|
continue;
|
|
|
|
}
|
|
|
|
if (val < 1 || val > bcp->cpus_in_uvhub) {
|
|
|
|
printk(KERN_DEBUG
|
|
|
|
"Error: BAU max concurrent %d is invalid\n",
|
|
|
|
val);
|
|
|
|
return -EINVAL;
|
|
|
|
}
|
2011-05-25 02:07:36 +08:00
|
|
|
max_concurr = val;
|
|
|
|
max_concurr_const = val;
|
2010-06-03 05:22:01 +08:00
|
|
|
continue;
|
2011-05-25 02:07:36 +08:00
|
|
|
default:
|
2010-06-03 05:22:01 +08:00
|
|
|
if (val == 0)
|
2011-05-25 02:07:36 +08:00
|
|
|
*tunables[cnt].tunp = tunables[cnt].deflt;
|
2010-06-03 05:22:01 +08:00
|
|
|
else
|
2011-05-25 02:07:36 +08:00
|
|
|
*tunables[cnt].tunp = val;
|
2010-06-03 05:22:01 +08:00
|
|
|
continue;
|
|
|
|
}
|
|
|
|
if (q == p)
|
|
|
|
break;
|
|
|
|
}
|
2011-05-25 02:07:36 +08:00
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Handle a write to debugfs. (/sys/kernel/debug/sgi_uv/bau_tunables)
|
|
|
|
*/
|
|
|
|
static ssize_t tunables_write(struct file *file, const char __user *user,
|
|
|
|
size_t count, loff_t *data)
|
|
|
|
{
|
|
|
|
int cpu;
|
|
|
|
int ret;
|
|
|
|
char instr[100];
|
|
|
|
struct bau_control *bcp;
|
|
|
|
|
|
|
|
if (count == 0 || count > sizeof(instr)-1)
|
|
|
|
return -EINVAL;
|
|
|
|
if (copy_from_user(instr, user, count))
|
|
|
|
return -EFAULT;
|
|
|
|
|
|
|
|
instr[count] = '\0';
|
|
|
|
|
2011-06-21 20:21:26 +08:00
|
|
|
cpu = get_cpu();
|
|
|
|
bcp = &per_cpu(bau_control, cpu);
|
2011-05-25 02:07:36 +08:00
|
|
|
ret = parse_tunables_write(bcp, instr, count);
|
2011-06-21 20:21:26 +08:00
|
|
|
put_cpu();
|
2011-05-25 02:07:36 +08:00
|
|
|
if (ret)
|
|
|
|
return ret;
|
|
|
|
|
2010-06-03 05:22:01 +08:00
|
|
|
for_each_present_cpu(cpu) {
|
|
|
|
bcp = &per_cpu(bau_control, cpu);
|
2011-05-25 02:07:36 +08:00
|
|
|
bcp->max_concurr = max_concurr;
|
|
|
|
bcp->max_concurr_const = max_concurr;
|
|
|
|
bcp->plugged_delay = plugged_delay;
|
|
|
|
bcp->plugsb4reset = plugsb4reset;
|
|
|
|
bcp->timeoutsb4reset = timeoutsb4reset;
|
|
|
|
bcp->ipi_reset_limit = ipi_reset_limit;
|
|
|
|
bcp->complete_threshold = complete_threshold;
|
|
|
|
bcp->cong_response_us = congested_respns_us;
|
|
|
|
bcp->cong_reps = congested_reps;
|
2012-06-22 21:14:59 +08:00
|
|
|
bcp->disabled_period = sec_2_cycles(disabled_period);
|
|
|
|
bcp->giveup_limit = giveup_limit;
|
2010-06-03 05:22:01 +08:00
|
|
|
}
|
2008-06-02 21:56:14 +08:00
|
|
|
return count;
|
|
|
|
}
|
|
|
|
|
|
|
|
static const struct seq_operations uv_ptc_seq_ops = {
|
2011-05-25 02:07:36 +08:00
|
|
|
.start = ptc_seq_start,
|
|
|
|
.next = ptc_seq_next,
|
|
|
|
.stop = ptc_seq_stop,
|
|
|
|
.show = ptc_seq_show
|
2008-06-02 21:56:14 +08:00
|
|
|
};
|
|
|
|
|
2011-05-25 02:07:36 +08:00
|
|
|
static int ptc_proc_open(struct inode *inode, struct file *file)
|
2008-06-02 21:56:14 +08:00
|
|
|
{
|
|
|
|
return seq_open(file, &uv_ptc_seq_ops);
|
|
|
|
}
|
|
|
|
|
2010-06-03 05:22:01 +08:00
|
|
|
static int tunables_open(struct inode *inode, struct file *file)
|
|
|
|
{
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2008-06-02 21:56:14 +08:00
|
|
|
static const struct file_operations proc_uv_ptc_operations = {
|
2011-05-25 02:07:36 +08:00
|
|
|
.open = ptc_proc_open,
|
2008-06-12 21:23:48 +08:00
|
|
|
.read = seq_read,
|
2011-05-25 02:07:36 +08:00
|
|
|
.write = ptc_proc_write,
|
2008-06-12 21:23:48 +08:00
|
|
|
.llseek = seq_lseek,
|
|
|
|
.release = seq_release,
|
2008-06-02 21:56:14 +08:00
|
|
|
};
|
|
|
|
|
2010-06-03 05:22:01 +08:00
|
|
|
static const struct file_operations tunables_fops = {
|
|
|
|
.open = tunables_open,
|
|
|
|
.read = tunables_read,
|
|
|
|
.write = tunables_write,
|
llseek: automatically add .llseek fop
All file_operations should get a .llseek operation so we can make
nonseekable_open the default for future file operations without a
.llseek pointer.
The three cases that we can automatically detect are no_llseek, seq_lseek
and default_llseek. For cases where we can we can automatically prove that
the file offset is always ignored, we use noop_llseek, which maintains
the current behavior of not returning an error from a seek.
New drivers should normally not use noop_llseek but instead use no_llseek
and call nonseekable_open at open time. Existing drivers can be converted
to do the same when the maintainer knows for certain that no user code
relies on calling seek on the device file.
The generated code is often incorrectly indented and right now contains
comments that clarify for each added line why a specific variant was
chosen. In the version that gets submitted upstream, the comments will
be gone and I will manually fix the indentation, because there does not
seem to be a way to do that using coccinelle.
Some amount of new code is currently sitting in linux-next that should get
the same modifications, which I will do at the end of the merge window.
Many thanks to Julia Lawall for helping me learn to write a semantic
patch that does all this.
===== begin semantic patch =====
// This adds an llseek= method to all file operations,
// as a preparation for making no_llseek the default.
//
// The rules are
// - use no_llseek explicitly if we do nonseekable_open
// - use seq_lseek for sequential files
// - use default_llseek if we know we access f_pos
// - use noop_llseek if we know we don't access f_pos,
// but we still want to allow users to call lseek
//
@ open1 exists @
identifier nested_open;
@@
nested_open(...)
{
<+...
nonseekable_open(...)
...+>
}
@ open exists@
identifier open_f;
identifier i, f;
identifier open1.nested_open;
@@
int open_f(struct inode *i, struct file *f)
{
<+...
(
nonseekable_open(...)
|
nested_open(...)
)
...+>
}
@ read disable optional_qualifier exists @
identifier read_f;
identifier f, p, s, off;
type ssize_t, size_t, loff_t;
expression E;
identifier func;
@@
ssize_t read_f(struct file *f, char *p, size_t s, loff_t *off)
{
<+...
(
*off = E
|
*off += E
|
func(..., off, ...)
|
E = *off
)
...+>
}
@ read_no_fpos disable optional_qualifier exists @
identifier read_f;
identifier f, p, s, off;
type ssize_t, size_t, loff_t;
@@
ssize_t read_f(struct file *f, char *p, size_t s, loff_t *off)
{
... when != off
}
@ write @
identifier write_f;
identifier f, p, s, off;
type ssize_t, size_t, loff_t;
expression E;
identifier func;
@@
ssize_t write_f(struct file *f, const char *p, size_t s, loff_t *off)
{
<+...
(
*off = E
|
*off += E
|
func(..., off, ...)
|
E = *off
)
...+>
}
@ write_no_fpos @
identifier write_f;
identifier f, p, s, off;
type ssize_t, size_t, loff_t;
@@
ssize_t write_f(struct file *f, const char *p, size_t s, loff_t *off)
{
... when != off
}
@ fops0 @
identifier fops;
@@
struct file_operations fops = {
...
};
@ has_llseek depends on fops0 @
identifier fops0.fops;
identifier llseek_f;
@@
struct file_operations fops = {
...
.llseek = llseek_f,
...
};
@ has_read depends on fops0 @
identifier fops0.fops;
identifier read_f;
@@
struct file_operations fops = {
...
.read = read_f,
...
};
@ has_write depends on fops0 @
identifier fops0.fops;
identifier write_f;
@@
struct file_operations fops = {
...
.write = write_f,
...
};
@ has_open depends on fops0 @
identifier fops0.fops;
identifier open_f;
@@
struct file_operations fops = {
...
.open = open_f,
...
};
// use no_llseek if we call nonseekable_open
////////////////////////////////////////////
@ nonseekable1 depends on !has_llseek && has_open @
identifier fops0.fops;
identifier nso ~= "nonseekable_open";
@@
struct file_operations fops = {
... .open = nso, ...
+.llseek = no_llseek, /* nonseekable */
};
@ nonseekable2 depends on !has_llseek @
identifier fops0.fops;
identifier open.open_f;
@@
struct file_operations fops = {
... .open = open_f, ...
+.llseek = no_llseek, /* open uses nonseekable */
};
// use seq_lseek for sequential files
/////////////////////////////////////
@ seq depends on !has_llseek @
identifier fops0.fops;
identifier sr ~= "seq_read";
@@
struct file_operations fops = {
... .read = sr, ...
+.llseek = seq_lseek, /* we have seq_read */
};
// use default_llseek if there is a readdir
///////////////////////////////////////////
@ fops1 depends on !has_llseek && !nonseekable1 && !nonseekable2 && !seq @
identifier fops0.fops;
identifier readdir_e;
@@
// any other fop is used that changes pos
struct file_operations fops = {
... .readdir = readdir_e, ...
+.llseek = default_llseek, /* readdir is present */
};
// use default_llseek if at least one of read/write touches f_pos
/////////////////////////////////////////////////////////////////
@ fops2 depends on !fops1 && !has_llseek && !nonseekable1 && !nonseekable2 && !seq @
identifier fops0.fops;
identifier read.read_f;
@@
// read fops use offset
struct file_operations fops = {
... .read = read_f, ...
+.llseek = default_llseek, /* read accesses f_pos */
};
@ fops3 depends on !fops1 && !fops2 && !has_llseek && !nonseekable1 && !nonseekable2 && !seq @
identifier fops0.fops;
identifier write.write_f;
@@
// write fops use offset
struct file_operations fops = {
... .write = write_f, ...
+ .llseek = default_llseek, /* write accesses f_pos */
};
// Use noop_llseek if neither read nor write accesses f_pos
///////////////////////////////////////////////////////////
@ fops4 depends on !fops1 && !fops2 && !fops3 && !has_llseek && !nonseekable1 && !nonseekable2 && !seq @
identifier fops0.fops;
identifier read_no_fpos.read_f;
identifier write_no_fpos.write_f;
@@
// write fops use offset
struct file_operations fops = {
...
.write = write_f,
.read = read_f,
...
+.llseek = noop_llseek, /* read and write both use no f_pos */
};
@ depends on has_write && !has_read && !fops1 && !fops2 && !has_llseek && !nonseekable1 && !nonseekable2 && !seq @
identifier fops0.fops;
identifier write_no_fpos.write_f;
@@
struct file_operations fops = {
... .write = write_f, ...
+.llseek = noop_llseek, /* write uses no f_pos */
};
@ depends on has_read && !has_write && !fops1 && !fops2 && !has_llseek && !nonseekable1 && !nonseekable2 && !seq @
identifier fops0.fops;
identifier read_no_fpos.read_f;
@@
struct file_operations fops = {
... .read = read_f, ...
+.llseek = noop_llseek, /* read uses no f_pos */
};
@ depends on !has_read && !has_write && !fops1 && !fops2 && !has_llseek && !nonseekable1 && !nonseekable2 && !seq @
identifier fops0.fops;
@@
struct file_operations fops = {
...
+.llseek = noop_llseek, /* no read or write fn */
};
===== End semantic patch =====
Signed-off-by: Arnd Bergmann <arnd@arndb.de>
Cc: Julia Lawall <julia@diku.dk>
Cc: Christoph Hellwig <hch@infradead.org>
2010-08-16 00:52:59 +08:00
|
|
|
.llseek = default_llseek,
|
2010-06-03 05:22:01 +08:00
|
|
|
};
|
|
|
|
|
2008-06-12 21:23:48 +08:00
|
|
|
static int __init uv_ptc_init(void)
|
2008-06-02 21:56:14 +08:00
|
|
|
{
|
2008-06-12 21:23:48 +08:00
|
|
|
struct proc_dir_entry *proc_uv_ptc;
|
2008-06-02 21:56:14 +08:00
|
|
|
|
|
|
|
if (!is_uv_system())
|
|
|
|
return 0;
|
|
|
|
|
2009-08-24 03:17:27 +08:00
|
|
|
proc_uv_ptc = proc_create(UV_PTC_BASENAME, 0444, NULL,
|
|
|
|
&proc_uv_ptc_operations);
|
2008-06-02 21:56:14 +08:00
|
|
|
if (!proc_uv_ptc) {
|
|
|
|
printk(KERN_ERR "unable to create %s proc entry\n",
|
|
|
|
UV_PTC_BASENAME);
|
|
|
|
return -EINVAL;
|
|
|
|
}
|
2010-06-03 05:22:01 +08:00
|
|
|
|
|
|
|
tunables_dir = debugfs_create_dir(UV_BAU_TUNABLES_DIR, NULL);
|
|
|
|
if (!tunables_dir) {
|
|
|
|
printk(KERN_ERR "unable to create debugfs directory %s\n",
|
|
|
|
UV_BAU_TUNABLES_DIR);
|
|
|
|
return -EINVAL;
|
|
|
|
}
|
|
|
|
tunables_file = debugfs_create_file(UV_BAU_TUNABLES_FILE, 0600,
|
2011-05-25 02:07:36 +08:00
|
|
|
tunables_dir, NULL, &tunables_fops);
|
2010-06-03 05:22:01 +08:00
|
|
|
if (!tunables_file) {
|
|
|
|
printk(KERN_ERR "unable to create debugfs file %s\n",
|
|
|
|
UV_BAU_TUNABLES_FILE);
|
|
|
|
return -EINVAL;
|
|
|
|
}
|
2008-06-02 21:56:14 +08:00
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
2011-05-10 21:26:43 +08:00
|
|
|
* Initialize the sending side's sending buffers.
|
2008-06-02 21:56:14 +08:00
|
|
|
*/
|
2011-05-25 02:07:36 +08:00
|
|
|
static void activation_descriptor_init(int node, int pnode, int base_pnode)
|
2008-06-02 21:56:14 +08:00
|
|
|
{
|
|
|
|
int i;
|
2010-04-15 00:35:46 +08:00
|
|
|
int cpu;
|
2012-01-17 05:17:50 +08:00
|
|
|
int uv1 = 0;
|
2011-09-21 04:55:04 +08:00
|
|
|
unsigned long gpa;
|
2008-06-02 21:56:14 +08:00
|
|
|
unsigned long m;
|
2008-06-12 21:23:48 +08:00
|
|
|
unsigned long n;
|
2011-05-25 02:07:36 +08:00
|
|
|
size_t dsize;
|
2010-04-15 00:35:46 +08:00
|
|
|
struct bau_desc *bau_desc;
|
|
|
|
struct bau_desc *bd2;
|
2012-01-17 05:17:50 +08:00
|
|
|
struct uv1_bau_msg_header *uv1_hdr;
|
|
|
|
struct uv2_bau_msg_header *uv2_hdr;
|
2010-04-15 00:35:46 +08:00
|
|
|
struct bau_control *bcp;
|
2008-06-12 21:23:48 +08:00
|
|
|
|
2009-05-20 21:10:57 +08:00
|
|
|
/*
|
2011-05-25 02:07:36 +08:00
|
|
|
* each bau_desc is 64 bytes; there are 8 (ITEMS_PER_DESC)
|
|
|
|
* per cpu; and one per cpu on the uvhub (ADP_SZ)
|
2009-05-20 21:10:57 +08:00
|
|
|
*/
|
2011-05-25 02:07:36 +08:00
|
|
|
dsize = sizeof(struct bau_desc) * ADP_SZ * ITEMS_PER_DESC;
|
|
|
|
bau_desc = kmalloc_node(dsize, GFP_KERNEL, node);
|
2010-04-15 00:35:46 +08:00
|
|
|
BUG_ON(!bau_desc);
|
2008-06-18 20:28:19 +08:00
|
|
|
|
2011-09-21 04:55:04 +08:00
|
|
|
gpa = uv_gpa(bau_desc);
|
|
|
|
n = uv_gpa_to_gnode(gpa);
|
|
|
|
m = uv_gpa_to_offset(gpa);
|
2012-01-17 05:17:50 +08:00
|
|
|
if (is_uv1_hub())
|
|
|
|
uv1 = 1;
|
2008-06-18 20:28:19 +08:00
|
|
|
|
2011-05-10 21:26:43 +08:00
|
|
|
/* the 14-bit pnode */
|
2011-05-25 02:07:36 +08:00
|
|
|
write_mmr_descriptor_base(pnode, (n << UV_DESC_PSHIFT | m));
|
2009-05-20 21:10:57 +08:00
|
|
|
/*
|
2011-05-25 02:07:36 +08:00
|
|
|
* Initializing all 8 (ITEMS_PER_DESC) descriptors for each
|
2009-05-20 21:10:57 +08:00
|
|
|
* cpu even though we only use the first one; one descriptor can
|
2010-04-15 00:35:46 +08:00
|
|
|
* describe a broadcast to 256 uv hubs.
|
2009-05-20 21:10:57 +08:00
|
|
|
*/
|
2011-05-25 02:07:36 +08:00
|
|
|
for (i = 0, bd2 = bau_desc; i < (ADP_SZ * ITEMS_PER_DESC); i++, bd2++) {
|
2010-04-15 00:35:46 +08:00
|
|
|
memset(bd2, 0, sizeof(struct bau_desc));
|
2012-01-17 05:17:50 +08:00
|
|
|
if (uv1) {
|
|
|
|
uv1_hdr = &bd2->header.uv1_hdr;
|
|
|
|
uv1_hdr->swack_flag = 1;
|
|
|
|
/*
|
|
|
|
* The base_dest_nasid set in the message header
|
|
|
|
* is the nasid of the first uvhub in the partition.
|
|
|
|
* The bit map will indicate destination pnode numbers
|
|
|
|
* relative to that base. They may not be consecutive
|
|
|
|
* if nasid striding is being used.
|
|
|
|
*/
|
|
|
|
uv1_hdr->base_dest_nasid =
|
|
|
|
UV_PNODE_TO_NASID(base_pnode);
|
|
|
|
uv1_hdr->dest_subnodeid = UV_LB_SUBNODEID;
|
|
|
|
uv1_hdr->command = UV_NET_ENDPOINT_INTD;
|
|
|
|
uv1_hdr->int_both = 1;
|
|
|
|
/*
|
|
|
|
* all others need to be set to zero:
|
|
|
|
* fairness chaining multilevel count replied_to
|
|
|
|
*/
|
|
|
|
} else {
|
2012-06-22 21:14:59 +08:00
|
|
|
/*
|
|
|
|
* BIOS uses legacy mode, but UV2 hardware always
|
|
|
|
* uses native mode for selective broadcasts.
|
|
|
|
*/
|
2012-01-17 05:17:50 +08:00
|
|
|
uv2_hdr = &bd2->header.uv2_hdr;
|
|
|
|
uv2_hdr->swack_flag = 1;
|
|
|
|
uv2_hdr->base_dest_nasid =
|
|
|
|
UV_PNODE_TO_NASID(base_pnode);
|
|
|
|
uv2_hdr->dest_subnodeid = UV_LB_SUBNODEID;
|
|
|
|
uv2_hdr->command = UV_NET_ENDPOINT_INTD;
|
|
|
|
}
|
2008-06-12 21:23:48 +08:00
|
|
|
}
|
2010-04-15 00:35:46 +08:00
|
|
|
for_each_present_cpu(cpu) {
|
|
|
|
if (pnode != uv_blade_to_pnode(uv_cpu_to_blade_id(cpu)))
|
|
|
|
continue;
|
|
|
|
bcp = &per_cpu(bau_control, cpu);
|
|
|
|
bcp->descriptor_base = bau_desc;
|
|
|
|
}
|
2008-06-12 21:23:48 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* initialize the destination side's receiving buffers
|
2010-04-15 00:35:46 +08:00
|
|
|
* entered for each uvhub in the partition
|
|
|
|
* - node is first node (kernel memory notion) on the uvhub
|
|
|
|
* - pnode is the uvhub's physical identifier
|
2008-06-12 21:23:48 +08:00
|
|
|
*/
|
2011-05-25 02:07:36 +08:00
|
|
|
static void pq_init(int node, int pnode)
|
2008-06-12 21:23:48 +08:00
|
|
|
{
|
2010-04-15 00:35:46 +08:00
|
|
|
int cpu;
|
2011-05-25 02:07:36 +08:00
|
|
|
size_t plsize;
|
2008-06-18 20:28:19 +08:00
|
|
|
char *cp;
|
2011-05-25 02:07:36 +08:00
|
|
|
void *vp;
|
|
|
|
unsigned long pn;
|
|
|
|
unsigned long first;
|
|
|
|
unsigned long pn_first;
|
|
|
|
unsigned long last;
|
|
|
|
struct bau_pq_entry *pqp;
|
2010-04-15 00:35:46 +08:00
|
|
|
struct bau_control *bcp;
|
2008-06-02 21:56:14 +08:00
|
|
|
|
2011-05-25 02:07:36 +08:00
|
|
|
plsize = (DEST_Q_SIZE + 1) * sizeof(struct bau_pq_entry);
|
|
|
|
vp = kmalloc_node(plsize, GFP_KERNEL, node);
|
|
|
|
pqp = (struct bau_pq_entry *)vp;
|
2008-06-18 20:15:43 +08:00
|
|
|
BUG_ON(!pqp);
|
2008-06-18 20:28:19 +08:00
|
|
|
|
2008-06-12 21:23:48 +08:00
|
|
|
cp = (char *)pqp + 31;
|
2011-05-25 02:07:36 +08:00
|
|
|
pqp = (struct bau_pq_entry *)(((unsigned long)cp >> 5) << 5);
|
2010-04-15 00:35:46 +08:00
|
|
|
|
|
|
|
for_each_present_cpu(cpu) {
|
|
|
|
if (pnode != uv_cpu_to_pnode(cpu))
|
|
|
|
continue;
|
|
|
|
/* for every cpu on this pnode: */
|
|
|
|
bcp = &per_cpu(bau_control, cpu);
|
2011-05-25 02:07:36 +08:00
|
|
|
bcp->queue_first = pqp;
|
|
|
|
bcp->bau_msg_head = pqp;
|
|
|
|
bcp->queue_last = pqp + (DEST_Q_SIZE - 1);
|
2010-04-15 00:35:46 +08:00
|
|
|
}
|
2009-04-16 20:53:09 +08:00
|
|
|
/*
|
2011-09-21 04:55:04 +08:00
|
|
|
* need the gnode of where the memory was really allocated
|
2009-04-16 20:53:09 +08:00
|
|
|
*/
|
2011-09-21 04:55:04 +08:00
|
|
|
pn = uv_gpa_to_gnode(uv_gpa(pqp));
|
2011-05-25 02:07:36 +08:00
|
|
|
first = uv_physnodeaddr(pqp);
|
|
|
|
pn_first = ((unsigned long)pn << UV_PAYLOADQ_PNODE_SHIFT) | first;
|
|
|
|
last = uv_physnodeaddr(pqp + (DEST_Q_SIZE - 1));
|
|
|
|
write_mmr_payload_first(pnode, pn_first);
|
|
|
|
write_mmr_payload_tail(pnode, first);
|
|
|
|
write_mmr_payload_last(pnode, last);
|
2012-01-17 05:19:47 +08:00
|
|
|
write_gmmr_sw_ack(pnode, 0xffffUL);
|
2011-05-25 02:07:36 +08:00
|
|
|
|
2010-04-15 00:35:46 +08:00
|
|
|
/* in effect, all msg_type's are set to MSG_NOOP */
|
2011-05-25 02:07:36 +08:00
|
|
|
memset(pqp, 0, sizeof(struct bau_pq_entry) * DEST_Q_SIZE);
|
2008-06-12 21:23:48 +08:00
|
|
|
}
|
2008-06-02 21:56:14 +08:00
|
|
|
|
2008-06-12 21:23:48 +08:00
|
|
|
/*
|
2010-04-15 00:35:46 +08:00
|
|
|
* Initialization of each UV hub's structures
|
2008-06-12 21:23:48 +08:00
|
|
|
*/
|
2011-05-25 02:07:36 +08:00
|
|
|
static void __init init_uvhub(int uvhub, int vector, int base_pnode)
|
2008-06-12 21:23:48 +08:00
|
|
|
{
|
2009-04-03 21:34:05 +08:00
|
|
|
int node;
|
2008-06-12 21:23:48 +08:00
|
|
|
int pnode;
|
|
|
|
unsigned long apicid;
|
2010-04-15 00:35:46 +08:00
|
|
|
|
|
|
|
node = uvhub_to_first_node(uvhub);
|
|
|
|
pnode = uv_blade_to_pnode(uvhub);
|
2011-05-25 02:07:36 +08:00
|
|
|
|
|
|
|
activation_descriptor_init(node, pnode, base_pnode);
|
|
|
|
|
|
|
|
pq_init(node, pnode);
|
2008-06-12 21:23:48 +08:00
|
|
|
/*
|
2011-05-10 21:26:43 +08:00
|
|
|
* The below initialization can't be in firmware because the
|
|
|
|
* messaging IRQ will be determined by the OS.
|
2008-06-12 21:23:48 +08:00
|
|
|
*/
|
2010-11-17 06:23:52 +08:00
|
|
|
apicid = uvhub_to_first_apicid(uvhub) | uv_apicid_hibits;
|
2011-05-25 02:07:36 +08:00
|
|
|
write_mmr_data_config(pnode, ((apicid << 32) | vector));
|
2010-04-15 00:35:46 +08:00
|
|
|
}
|
|
|
|
|
2010-06-03 05:22:01 +08:00
|
|
|
/*
|
|
|
|
* We will set BAU_MISC_CONTROL with a timeout period.
|
|
|
|
* But the BIOS has set UVH_AGING_PRESCALE_SEL and UVH_TRANSACTION_TIMEOUT.
|
2011-05-25 02:07:36 +08:00
|
|
|
* So the destination timeout period has to be calculated from them.
|
2010-06-03 05:22:01 +08:00
|
|
|
*/
|
2011-05-25 02:07:36 +08:00
|
|
|
static int calculate_destination_timeout(void)
|
2010-06-03 05:22:01 +08:00
|
|
|
{
|
|
|
|
unsigned long mmr_image;
|
|
|
|
int mult1;
|
|
|
|
int mult2;
|
|
|
|
int index;
|
|
|
|
int base;
|
|
|
|
int ret;
|
|
|
|
unsigned long ts_ns;
|
|
|
|
|
2011-05-12 01:50:28 +08:00
|
|
|
if (is_uv1_hub()) {
|
2011-05-25 02:07:36 +08:00
|
|
|
mult1 = SOFTACK_TIMEOUT_PERIOD & BAU_MISC_CONTROL_MULT_MASK;
|
2011-05-12 01:50:28 +08:00
|
|
|
mmr_image = uv_read_local_mmr(UVH_AGING_PRESCALE_SEL);
|
|
|
|
index = (mmr_image >> BAU_URGENCY_7_SHIFT) & BAU_URGENCY_7_MASK;
|
|
|
|
mmr_image = uv_read_local_mmr(UVH_TRANSACTION_TIMEOUT);
|
|
|
|
mult2 = (mmr_image >> BAU_TRANS_SHIFT) & BAU_TRANS_MASK;
|
2012-06-22 21:12:12 +08:00
|
|
|
ts_ns = timeout_base_ns[index];
|
|
|
|
ts_ns *= (mult1 * mult2);
|
2011-05-12 01:50:28 +08:00
|
|
|
ret = ts_ns / 1000;
|
|
|
|
} else {
|
2012-01-17 05:18:48 +08:00
|
|
|
/* 4 bits 0/1 for 10/80us base, 3 bits of multiplier */
|
|
|
|
mmr_image = uv_read_local_mmr(UVH_LB_BAU_MISC_CONTROL);
|
2011-05-12 01:50:28 +08:00
|
|
|
mmr_image = (mmr_image & UV_SA_MASK) >> UV_SA_SHFT;
|
2011-05-25 02:07:36 +08:00
|
|
|
if (mmr_image & (1L << UV2_ACK_UNITS_SHFT))
|
2012-01-17 05:18:48 +08:00
|
|
|
base = 80;
|
2011-05-12 01:50:28 +08:00
|
|
|
else
|
2012-01-17 05:18:48 +08:00
|
|
|
base = 10;
|
|
|
|
mult1 = mmr_image & UV2_ACK_MASK;
|
2011-05-12 01:50:28 +08:00
|
|
|
ret = mult1 * base;
|
|
|
|
}
|
2010-06-03 05:22:01 +08:00
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
2011-05-25 02:07:36 +08:00
|
|
|
static void __init init_per_cpu_tunables(void)
|
|
|
|
{
|
|
|
|
int cpu;
|
|
|
|
struct bau_control *bcp;
|
|
|
|
|
|
|
|
for_each_present_cpu(cpu) {
|
|
|
|
bcp = &per_cpu(bau_control, cpu);
|
|
|
|
bcp->baudisabled = 0;
|
2012-06-22 21:13:30 +08:00
|
|
|
if (nobau)
|
|
|
|
bcp->nobau = 1;
|
2011-05-25 02:07:36 +08:00
|
|
|
bcp->statp = &per_cpu(ptcstats, cpu);
|
|
|
|
/* time interval to catch a hardware stay-busy bug */
|
|
|
|
bcp->timeout_interval = usec_2_cycles(2*timeout_us);
|
|
|
|
bcp->max_concurr = max_concurr;
|
|
|
|
bcp->max_concurr_const = max_concurr;
|
|
|
|
bcp->plugged_delay = plugged_delay;
|
|
|
|
bcp->plugsb4reset = plugsb4reset;
|
|
|
|
bcp->timeoutsb4reset = timeoutsb4reset;
|
|
|
|
bcp->ipi_reset_limit = ipi_reset_limit;
|
|
|
|
bcp->complete_threshold = complete_threshold;
|
|
|
|
bcp->cong_response_us = congested_respns_us;
|
|
|
|
bcp->cong_reps = congested_reps;
|
2012-06-22 21:14:59 +08:00
|
|
|
bcp->disabled_period = sec_2_cycles(disabled_period);
|
|
|
|
bcp->giveup_limit = giveup_limit;
|
2012-01-18 23:40:47 +08:00
|
|
|
spin_lock_init(&bcp->queue_lock);
|
|
|
|
spin_lock_init(&bcp->uvhub_lock);
|
2012-06-22 21:14:59 +08:00
|
|
|
spin_lock_init(&bcp->disable_lock);
|
2011-05-25 02:07:36 +08:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2010-04-15 00:35:46 +08:00
|
|
|
/*
|
2011-05-25 02:07:36 +08:00
|
|
|
* Scan all cpus to collect blade and socket summaries.
|
2010-04-15 00:35:46 +08:00
|
|
|
*/
|
2011-05-25 02:07:36 +08:00
|
|
|
static int __init get_cpu_topology(int base_pnode,
|
|
|
|
struct uvhub_desc *uvhub_descs,
|
|
|
|
unsigned char *uvhub_mask)
|
2010-04-15 00:35:46 +08:00
|
|
|
{
|
|
|
|
int cpu;
|
|
|
|
int pnode;
|
|
|
|
int uvhub;
|
2011-05-25 02:07:36 +08:00
|
|
|
int socket;
|
2010-04-15 00:35:46 +08:00
|
|
|
struct bau_control *bcp;
|
|
|
|
struct uvhub_desc *bdp;
|
|
|
|
struct socket_desc *sdp;
|
|
|
|
|
|
|
|
for_each_present_cpu(cpu) {
|
|
|
|
bcp = &per_cpu(bau_control, cpu);
|
2011-05-25 02:07:36 +08:00
|
|
|
|
2010-04-15 00:35:46 +08:00
|
|
|
memset(bcp, 0, sizeof(struct bau_control));
|
2011-05-25 02:07:36 +08:00
|
|
|
|
2010-04-15 00:35:46 +08:00
|
|
|
pnode = uv_cpu_hub_info(cpu)->pnode;
|
2011-05-25 02:07:36 +08:00
|
|
|
if ((pnode - base_pnode) >= UV_DISTRIBUTION_SIZE) {
|
2011-05-10 21:26:43 +08:00
|
|
|
printk(KERN_EMERG
|
|
|
|
"cpu %d pnode %d-%d beyond %d; BAU disabled\n",
|
2011-05-25 02:07:36 +08:00
|
|
|
cpu, pnode, base_pnode, UV_DISTRIBUTION_SIZE);
|
2011-05-10 21:26:43 +08:00
|
|
|
return 1;
|
|
|
|
}
|
2011-05-25 02:07:36 +08:00
|
|
|
|
2011-05-10 21:26:43 +08:00
|
|
|
bcp->osnode = cpu_to_node(cpu);
|
2011-05-25 02:07:36 +08:00
|
|
|
bcp->partition_base_pnode = base_pnode;
|
|
|
|
|
2010-04-15 00:35:46 +08:00
|
|
|
uvhub = uv_cpu_hub_info(cpu)->numa_blade_id;
|
2010-07-31 03:10:55 +08:00
|
|
|
*(uvhub_mask + (uvhub/8)) |= (1 << (uvhub%8));
|
2010-04-15 00:35:46 +08:00
|
|
|
bdp = &uvhub_descs[uvhub];
|
2011-05-25 02:07:36 +08:00
|
|
|
|
2010-04-15 00:35:46 +08:00
|
|
|
bdp->num_cpus++;
|
|
|
|
bdp->uvhub = uvhub;
|
|
|
|
bdp->pnode = pnode;
|
2011-05-25 02:07:36 +08:00
|
|
|
|
2010-06-03 05:22:02 +08:00
|
|
|
/* kludge: 'assuming' one node per socket, and assuming that
|
|
|
|
disabling a socket just leaves a gap in node numbers */
|
2011-05-10 21:26:43 +08:00
|
|
|
socket = bcp->osnode & 1;
|
2010-06-03 05:22:02 +08:00
|
|
|
bdp->socket_mask |= (1 << socket);
|
2010-04-15 00:35:46 +08:00
|
|
|
sdp = &bdp->socket[socket];
|
|
|
|
sdp->cpu_number[sdp->num_cpus] = cpu;
|
|
|
|
sdp->num_cpus++;
|
2011-01-04 02:03:53 +08:00
|
|
|
if (sdp->num_cpus > MAX_CPUS_PER_SOCKET) {
|
2011-05-25 02:07:36 +08:00
|
|
|
printk(KERN_EMERG "%d cpus per socket invalid\n",
|
|
|
|
sdp->num_cpus);
|
2011-01-04 02:03:53 +08:00
|
|
|
return 1;
|
|
|
|
}
|
2010-04-15 00:35:46 +08:00
|
|
|
}
|
2011-05-25 02:07:36 +08:00
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Each socket is to get a local array of pnodes/hubs.
|
|
|
|
*/
|
|
|
|
static void make_per_cpu_thp(struct bau_control *smaster)
|
|
|
|
{
|
|
|
|
int cpu;
|
|
|
|
size_t hpsz = sizeof(struct hub_and_pnode) * num_possible_cpus();
|
|
|
|
|
|
|
|
smaster->thp = kmalloc_node(hpsz, GFP_KERNEL, smaster->osnode);
|
|
|
|
memset(smaster->thp, 0, hpsz);
|
|
|
|
for_each_present_cpu(cpu) {
|
|
|
|
smaster->thp[cpu].pnode = uv_cpu_hub_info(cpu)->pnode;
|
|
|
|
smaster->thp[cpu].uvhub = uv_cpu_hub_info(cpu)->numa_blade_id;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2011-06-21 20:21:31 +08:00
|
|
|
/*
|
|
|
|
* Each uvhub is to get a local cpumask.
|
|
|
|
*/
|
|
|
|
static void make_per_hub_cpumask(struct bau_control *hmaster)
|
|
|
|
{
|
|
|
|
int sz = sizeof(cpumask_t);
|
|
|
|
|
|
|
|
hmaster->cpumask = kzalloc_node(sz, GFP_KERNEL, hmaster->osnode);
|
|
|
|
}
|
|
|
|
|
2011-05-25 02:07:36 +08:00
|
|
|
/*
|
|
|
|
* Initialize all the per_cpu information for the cpu's on a given socket,
|
|
|
|
* given what has been gathered into the socket_desc struct.
|
|
|
|
* And reports the chosen hub and socket masters back to the caller.
|
|
|
|
*/
|
|
|
|
static int scan_sock(struct socket_desc *sdp, struct uvhub_desc *bdp,
|
|
|
|
struct bau_control **smasterp,
|
|
|
|
struct bau_control **hmasterp)
|
|
|
|
{
|
|
|
|
int i;
|
|
|
|
int cpu;
|
|
|
|
struct bau_control *bcp;
|
|
|
|
|
|
|
|
for (i = 0; i < sdp->num_cpus; i++) {
|
|
|
|
cpu = sdp->cpu_number[i];
|
|
|
|
bcp = &per_cpu(bau_control, cpu);
|
|
|
|
bcp->cpu = cpu;
|
|
|
|
if (i == 0) {
|
|
|
|
*smasterp = bcp;
|
|
|
|
if (!(*hmasterp))
|
|
|
|
*hmasterp = bcp;
|
|
|
|
}
|
|
|
|
bcp->cpus_in_uvhub = bdp->num_cpus;
|
|
|
|
bcp->cpus_in_socket = sdp->num_cpus;
|
|
|
|
bcp->socket_master = *smasterp;
|
|
|
|
bcp->uvhub = bdp->uvhub;
|
2012-01-17 05:17:50 +08:00
|
|
|
if (is_uv1_hub())
|
|
|
|
bcp->uvhub_version = 1;
|
|
|
|
else if (is_uv2_hub())
|
|
|
|
bcp->uvhub_version = 2;
|
|
|
|
else {
|
|
|
|
printk(KERN_EMERG "uvhub version not 1 or 2\n");
|
|
|
|
return 1;
|
|
|
|
}
|
2011-05-25 02:07:36 +08:00
|
|
|
bcp->uvhub_master = *hmasterp;
|
|
|
|
bcp->uvhub_cpu = uv_cpu_hub_info(cpu)->blade_processor_id;
|
|
|
|
if (bcp->uvhub_cpu >= MAX_CPUS_PER_UVHUB) {
|
|
|
|
printk(KERN_EMERG "%d cpus per uvhub invalid\n",
|
|
|
|
bcp->uvhub_cpu);
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Summarize the blade and socket topology into the per_cpu structures.
|
|
|
|
*/
|
|
|
|
static int __init summarize_uvhub_sockets(int nuvhubs,
|
|
|
|
struct uvhub_desc *uvhub_descs,
|
|
|
|
unsigned char *uvhub_mask)
|
|
|
|
{
|
|
|
|
int socket;
|
|
|
|
int uvhub;
|
|
|
|
unsigned short socket_mask;
|
|
|
|
|
2010-07-31 03:10:55 +08:00
|
|
|
for (uvhub = 0; uvhub < nuvhubs; uvhub++) {
|
2011-05-25 02:07:36 +08:00
|
|
|
struct uvhub_desc *bdp;
|
|
|
|
struct bau_control *smaster = NULL;
|
|
|
|
struct bau_control *hmaster = NULL;
|
|
|
|
|
2010-07-31 03:10:55 +08:00
|
|
|
if (!(*(uvhub_mask + (uvhub/8)) & (1 << (uvhub%8))))
|
|
|
|
continue;
|
2011-05-25 02:07:36 +08:00
|
|
|
|
2010-04-15 00:35:46 +08:00
|
|
|
bdp = &uvhub_descs[uvhub];
|
2010-06-03 05:22:02 +08:00
|
|
|
socket_mask = bdp->socket_mask;
|
|
|
|
socket = 0;
|
|
|
|
while (socket_mask) {
|
2011-05-25 02:07:36 +08:00
|
|
|
struct socket_desc *sdp;
|
|
|
|
if ((socket_mask & 1)) {
|
|
|
|
sdp = &bdp->socket[socket];
|
|
|
|
if (scan_sock(sdp, bdp, &smaster, &hmaster))
|
2011-01-04 02:03:53 +08:00
|
|
|
return 1;
|
2011-06-21 20:21:28 +08:00
|
|
|
make_per_cpu_thp(smaster);
|
2010-04-15 00:35:46 +08:00
|
|
|
}
|
|
|
|
socket++;
|
2010-06-03 05:22:02 +08:00
|
|
|
socket_mask = (socket_mask >> 1);
|
2010-04-15 00:35:46 +08:00
|
|
|
}
|
2011-06-21 20:21:31 +08:00
|
|
|
make_per_hub_cpumask(hmaster);
|
2010-04-15 00:35:46 +08:00
|
|
|
}
|
2011-05-25 02:07:36 +08:00
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* initialize the bau_control structure for each cpu
|
|
|
|
*/
|
|
|
|
static int __init init_per_cpu(int nuvhubs, int base_part_pnode)
|
|
|
|
{
|
|
|
|
unsigned char *uvhub_mask;
|
|
|
|
void *vp;
|
|
|
|
struct uvhub_desc *uvhub_descs;
|
|
|
|
|
|
|
|
timeout_us = calculate_destination_timeout();
|
|
|
|
|
|
|
|
vp = kmalloc(nuvhubs * sizeof(struct uvhub_desc), GFP_KERNEL);
|
|
|
|
uvhub_descs = (struct uvhub_desc *)vp;
|
|
|
|
memset(uvhub_descs, 0, nuvhubs * sizeof(struct uvhub_desc));
|
|
|
|
uvhub_mask = kzalloc((nuvhubs+7)/8, GFP_KERNEL);
|
|
|
|
|
|
|
|
if (get_cpu_topology(base_part_pnode, uvhub_descs, uvhub_mask))
|
2011-06-21 20:21:32 +08:00
|
|
|
goto fail;
|
2011-05-25 02:07:36 +08:00
|
|
|
|
|
|
|
if (summarize_uvhub_sockets(nuvhubs, uvhub_descs, uvhub_mask))
|
2011-06-21 20:21:32 +08:00
|
|
|
goto fail;
|
2011-05-25 02:07:36 +08:00
|
|
|
|
2010-04-15 00:35:46 +08:00
|
|
|
kfree(uvhub_descs);
|
2010-07-31 03:10:55 +08:00
|
|
|
kfree(uvhub_mask);
|
2011-05-25 02:07:36 +08:00
|
|
|
init_per_cpu_tunables();
|
2011-01-04 02:03:53 +08:00
|
|
|
return 0;
|
2011-06-21 20:21:32 +08:00
|
|
|
|
|
|
|
fail:
|
|
|
|
kfree(uvhub_descs);
|
|
|
|
kfree(uvhub_mask);
|
|
|
|
return 1;
|
2008-06-12 21:23:48 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Initialization of BAU-related structures
|
|
|
|
*/
|
|
|
|
static int __init uv_bau_init(void)
|
|
|
|
{
|
2010-04-15 00:35:46 +08:00
|
|
|
int uvhub;
|
|
|
|
int pnode;
|
|
|
|
int nuvhubs;
|
2009-03-18 05:52:30 +08:00
|
|
|
int cur_cpu;
|
2011-05-25 02:07:36 +08:00
|
|
|
int cpus;
|
2010-04-15 00:35:46 +08:00
|
|
|
int vector;
|
2011-05-25 02:07:36 +08:00
|
|
|
cpumask_var_t *mask;
|
2008-06-12 21:23:48 +08:00
|
|
|
|
|
|
|
if (!is_uv_system())
|
|
|
|
return 0;
|
2008-06-02 21:56:14 +08:00
|
|
|
|
2011-05-25 02:07:36 +08:00
|
|
|
for_each_possible_cpu(cur_cpu) {
|
|
|
|
mask = &per_cpu(uv_flush_tlb_mask, cur_cpu);
|
|
|
|
zalloc_cpumask_var_node(mask, GFP_KERNEL, cpu_to_node(cur_cpu));
|
|
|
|
}
|
2009-03-13 12:19:57 +08:00
|
|
|
|
2010-04-15 00:35:46 +08:00
|
|
|
nuvhubs = uv_num_possible_blades();
|
2011-05-25 02:07:36 +08:00
|
|
|
congested_cycles = usec_2_cycles(congested_respns_us);
|
2009-04-03 21:34:05 +08:00
|
|
|
|
2011-05-25 02:07:36 +08:00
|
|
|
uv_base_pnode = 0x7fffffff;
|
2011-05-10 21:26:43 +08:00
|
|
|
for (uvhub = 0; uvhub < nuvhubs; uvhub++) {
|
2011-05-25 02:07:36 +08:00
|
|
|
cpus = uv_blade_nr_possible_cpus(uvhub);
|
|
|
|
if (cpus && (uv_blade_to_pnode(uvhub) < uv_base_pnode))
|
|
|
|
uv_base_pnode = uv_blade_to_pnode(uvhub);
|
2011-05-10 21:26:43 +08:00
|
|
|
}
|
|
|
|
|
2012-01-17 05:18:48 +08:00
|
|
|
enable_timeouts();
|
|
|
|
|
2011-05-25 02:07:36 +08:00
|
|
|
if (init_per_cpu(nuvhubs, uv_base_pnode)) {
|
2012-06-22 21:13:30 +08:00
|
|
|
set_bau_off();
|
|
|
|
nobau_perm = 1;
|
2011-05-10 21:26:43 +08:00
|
|
|
return 0;
|
|
|
|
}
|
2010-04-15 00:35:46 +08:00
|
|
|
|
|
|
|
vector = UV_BAU_MESSAGE;
|
|
|
|
for_each_possible_blade(uvhub)
|
|
|
|
if (uv_blade_nr_possible_cpus(uvhub))
|
2011-05-25 02:07:36 +08:00
|
|
|
init_uvhub(uvhub, vector, uv_base_pnode);
|
2010-04-15 00:35:46 +08:00
|
|
|
|
|
|
|
alloc_intr_gate(vector, uv_bau_message_intr1);
|
|
|
|
|
|
|
|
for_each_possible_blade(uvhub) {
|
2010-07-16 23:11:21 +08:00
|
|
|
if (uv_blade_nr_possible_cpus(uvhub)) {
|
2011-05-25 02:07:36 +08:00
|
|
|
unsigned long val;
|
|
|
|
unsigned long mmr;
|
2010-07-16 23:11:21 +08:00
|
|
|
pnode = uv_blade_to_pnode(uvhub);
|
|
|
|
/* INIT the bau */
|
2011-05-25 02:07:36 +08:00
|
|
|
val = 1L << 63;
|
|
|
|
write_gmmr_activation(pnode, val);
|
2010-07-16 23:11:21 +08:00
|
|
|
mmr = 1; /* should be 1 to broadcast to both sockets */
|
2012-01-17 05:17:50 +08:00
|
|
|
if (!is_uv1_hub())
|
|
|
|
write_mmr_data_broadcast(pnode, mmr);
|
2010-07-16 23:11:21 +08:00
|
|
|
}
|
2010-04-15 00:35:46 +08:00
|
|
|
}
|
2008-06-18 20:28:19 +08:00
|
|
|
|
2008-06-02 21:56:14 +08:00
|
|
|
return 0;
|
|
|
|
}
|
2010-04-15 00:35:46 +08:00
|
|
|
core_initcall(uv_bau_init);
|
2010-06-03 05:22:01 +08:00
|
|
|
fs_initcall(uv_ptc_init);
|