Home | History | Annotate | Line # | Download | only in kern
subr_xcall.c revision 1.19.8.1
      1 /*	$NetBSD: subr_xcall.c,v 1.19.8.1 2018/02/19 18:33:38 snj Exp $	*/
      2 
      3 /*-
      4  * Copyright (c) 2007-2010 The NetBSD Foundation, Inc.
      5  * All rights reserved.
      6  *
      7  * This code is derived from software contributed to The NetBSD Foundation
      8  * by Andrew Doran and Mindaugas Rasiukevicius.
      9  *
     10  * Redistribution and use in source and binary forms, with or without
     11  * modification, are permitted provided that the following conditions
     12  * are met:
     13  * 1. Redistributions of source code must retain the above copyright
     14  *    notice, this list of conditions and the following disclaimer.
     15  * 2. Redistributions in binary form must reproduce the above copyright
     16  *    notice, this list of conditions and the following disclaimer in the
     17  *    documentation and/or other materials provided with the distribution.
     18  *
     19  * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS
     20  * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
     21  * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
     22  * PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS
     23  * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
     24  * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
     25  * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
     26  * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
     27  * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
     28  * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
     29  * POSSIBILITY OF SUCH DAMAGE.
     30  */
     31 
     32 /*
     33  * Cross call support
     34  *
     35  * Background
     36  *
     37  *	Sometimes it is necessary to modify hardware state that is tied
     38  *	directly to individual CPUs (such as a CPU's local timer), and
     39  *	these updates can not be done remotely by another CPU.  The LWP
     40  *	requesting the update may be unable to guarantee that it will be
     41  *	running on the CPU where the update must occur, when the update
     42  *	occurs.
     43  *
     44  *	Additionally, it's sometimes necessary to modify per-CPU software
     45  *	state from a remote CPU.  Where these update operations are so
     46  *	rare or the access to the per-CPU data so frequent that the cost
     47  *	of using locking or atomic operations to provide coherency is
     48  *	prohibitive, another way must be found.
     49  *
     50  *	Cross calls help to solve these types of problem by allowing
     51  *	any CPU in the system to request that an arbitrary function be
     52  *	executed on any other CPU.
     53  *
     54  * Implementation
     55  *
     56  *	A slow mechanism for making 'low priority' cross calls is
     57  *	provided.  The function to be executed runs on the remote CPU
     58  *	within a bound kthread.  No queueing is provided, and the
     59  *	implementation uses global state.  The function being called may
     60  *	block briefly on locks, but in doing so must be careful to not
     61  *	interfere with other cross calls in the system.  The function is
     62  *	called with thread context and not from a soft interrupt, so it
     63  *	can ensure that it is not interrupting other code running on the
     64  *	CPU, and so has exclusive access to the CPU.  Since this facility
     65  *	is heavyweight, it's expected that it will not be used often.
     66  *
     67  *	Cross calls must not allocate memory, as the pagedaemon uses
     68  *	them (and memory allocation may need to wait on the pagedaemon).
     69  *
     70  *	A low-overhead mechanism for high priority calls (XC_HIGHPRI) is
     71  *	also provided.  The function to be executed runs on a software
     72  *	interrupt context, at IPL_SOFTSERIAL level, and is expected to
     73  *	be very lightweight, e.g. avoid blocking.
     74  */
     75 
     76 #include <sys/cdefs.h>
     77 __KERNEL_RCSID(0, "$NetBSD: subr_xcall.c,v 1.19.8.1 2018/02/19 18:33:38 snj Exp $");
     78 
     79 #include <sys/types.h>
     80 #include <sys/param.h>
     81 #include <sys/xcall.h>
     82 #include <sys/mutex.h>
     83 #include <sys/condvar.h>
     84 #include <sys/evcnt.h>
     85 #include <sys/kthread.h>
     86 #include <sys/cpu.h>
     87 
     88 #ifdef _RUMPKERNEL
     89 #include "rump_private.h"
     90 #endif
     91 
     92 /* Cross-call state box. */
     93 typedef struct {
     94 	kmutex_t	xc_lock;
     95 	kcondvar_t	xc_busy;
     96 	xcfunc_t	xc_func;
     97 	void *		xc_arg1;
     98 	void *		xc_arg2;
     99 	uint64_t	xc_headp;
    100 	uint64_t	xc_donep;
    101 	unsigned int	xc_ipl;
    102 } xc_state_t;
    103 
    104 /* Bit indicating high (1) or low (0) priority. */
    105 #define	XC_PRI_BIT	(1ULL << 63)
    106 
    107 /* Low priority xcall structures. */
    108 static xc_state_t	xc_low_pri	__cacheline_aligned;
    109 
    110 /* High priority xcall structures. */
    111 static xc_state_t	xc_high_pri	__cacheline_aligned;
    112 static void *		xc_sihs[4]	__cacheline_aligned;
    113 
    114 /* Event counters. */
    115 static struct evcnt	xc_unicast_ev	__cacheline_aligned;
    116 static struct evcnt	xc_broadcast_ev	__cacheline_aligned;
    117 
    118 static void		xc_init(void);
    119 static void		xc_thread(void *);
    120 
    121 static inline uint64_t	xc_highpri(xcfunc_t, void *, void *, struct cpu_info *,
    122 			    unsigned int);
    123 static inline uint64_t	xc_lowpri(xcfunc_t, void *, void *, struct cpu_info *);
    124 
    125 /* The internal form of IPL */
    126 #define XC_IPL_MASK		0xff00
    127 /*
    128  * Assign 0 to XC_IPL_SOFTSERIAL to treat IPL_SOFTSERIAL as the default value
    129  * (just XC_HIGHPRI).
    130  */
    131 #define XC_IPL_SOFTSERIAL	0
    132 #define XC_IPL_SOFTNET		1
    133 #define XC_IPL_SOFTBIO		2
    134 #define XC_IPL_SOFTCLOCK	3
    135 #define XC_IPL_MAX		XC_IPL_SOFTCLOCK
    136 
    137 CTASSERT(XC_IPL_MAX <= __arraycount(xc_sihs));
    138 
    139 /*
    140  * xc_init:
    141  *
    142  *	Initialize low and high priority cross-call structures.
    143  */
    144 static void
    145 xc_init(void)
    146 {
    147 	xc_state_t *xclo = &xc_low_pri, *xchi = &xc_high_pri;
    148 
    149 	memset(xclo, 0, sizeof(xc_state_t));
    150 	mutex_init(&xclo->xc_lock, MUTEX_DEFAULT, IPL_NONE);
    151 	cv_init(&xclo->xc_busy, "xclocv");
    152 
    153 	memset(xchi, 0, sizeof(xc_state_t));
    154 	mutex_init(&xchi->xc_lock, MUTEX_DEFAULT, IPL_SOFTSERIAL);
    155 	cv_init(&xchi->xc_busy, "xchicv");
    156 
    157 	/* Set up a softint for each IPL_SOFT*. */
    158 #define SETUP_SOFTINT(xipl, sipl) do {					\
    159 		xc_sihs[(xipl)] = softint_establish( (sipl) | SOFTINT_MPSAFE,\
    160 		    xc__highpri_intr, NULL);				\
    161 		KASSERT(xc_sihs[(xipl)] != NULL);			\
    162 	} while (0)
    163 
    164 	SETUP_SOFTINT(XC_IPL_SOFTSERIAL, SOFTINT_SERIAL);
    165 	/*
    166 	 * If a IPL_SOFTXXX have the same value of the previous, we don't use
    167 	 * the IPL (see xc_encode_ipl).  So we don't need to allocate a softint
    168 	 * for it.
    169 	 */
    170 #if IPL_SOFTNET != IPL_SOFTSERIAL
    171 	SETUP_SOFTINT(XC_IPL_SOFTNET, SOFTINT_NET);
    172 #endif
    173 #if IPL_SOFTBIO != IPL_SOFTNET
    174 	SETUP_SOFTINT(XC_IPL_SOFTBIO, SOFTINT_BIO);
    175 #endif
    176 #if IPL_SOFTCLOCK != IPL_SOFTBIO
    177 	SETUP_SOFTINT(XC_IPL_SOFTCLOCK, SOFTINT_CLOCK);
    178 #endif
    179 
    180 #undef SETUP_SOFTINT
    181 
    182 	evcnt_attach_dynamic(&xc_unicast_ev, EVCNT_TYPE_MISC, NULL,
    183 	   "crosscall", "unicast");
    184 	evcnt_attach_dynamic(&xc_broadcast_ev, EVCNT_TYPE_MISC, NULL,
    185 	   "crosscall", "broadcast");
    186 }
    187 
    188 /*
    189  * Encode an IPL to a form that can be embedded into flags of xc_broadcast
    190  * or xc_unicast.
    191  */
    192 unsigned int
    193 xc_encode_ipl(int ipl)
    194 {
    195 
    196 	switch (ipl) {
    197 	case IPL_SOFTSERIAL:
    198 		return __SHIFTIN(XC_IPL_SOFTSERIAL, XC_IPL_MASK);
    199 	/* IPL_SOFT* can be the same value (e.g., on sparc or mips). */
    200 #if IPL_SOFTNET != IPL_SOFTSERIAL
    201 	case IPL_SOFTNET:
    202 		return __SHIFTIN(XC_IPL_SOFTNET, XC_IPL_MASK);
    203 #endif
    204 #if IPL_SOFTBIO != IPL_SOFTNET
    205 	case IPL_SOFTBIO:
    206 		return __SHIFTIN(XC_IPL_SOFTBIO, XC_IPL_MASK);
    207 #endif
    208 #if IPL_SOFTCLOCK != IPL_SOFTBIO
    209 	case IPL_SOFTCLOCK:
    210 		return __SHIFTIN(XC_IPL_SOFTCLOCK, XC_IPL_MASK);
    211 #endif
    212 	}
    213 
    214 	panic("Invalid IPL: %d", ipl);
    215 }
    216 
    217 /*
    218  * Extract an XC_IPL from flags of xc_broadcast or xc_unicast.
    219  */
    220 static inline unsigned int
    221 xc_extract_ipl(unsigned int flags)
    222 {
    223 
    224 	return __SHIFTOUT(flags, XC_IPL_MASK);
    225 }
    226 
    227 /*
    228  * xc_init_cpu:
    229  *
    230  *	Initialize the cross-call subsystem.  Called once for each CPU
    231  *	in the system as they are attached.
    232  */
    233 void
    234 xc_init_cpu(struct cpu_info *ci)
    235 {
    236 	static bool again = false;
    237 	int error __diagused;
    238 
    239 	if (!again) {
    240 		/* Autoconfiguration will prevent re-entry. */
    241 		xc_init();
    242 		again = true;
    243 	}
    244 	cv_init(&ci->ci_data.cpu_xcall, "xcall");
    245 	error = kthread_create(PRI_XCALL, KTHREAD_MPSAFE, ci, xc_thread,
    246 	    NULL, NULL, "xcall/%u", ci->ci_index);
    247 	KASSERT(error == 0);
    248 }
    249 
    250 /*
    251  * xc_broadcast:
    252  *
    253  *	Trigger a call on all CPUs in the system.
    254  */
    255 uint64_t
    256 xc_broadcast(unsigned int flags, xcfunc_t func, void *arg1, void *arg2)
    257 {
    258 
    259 	KASSERT(!cpu_intr_p() && !cpu_softintr_p());
    260 
    261 	if ((flags & XC_HIGHPRI) != 0) {
    262 		int ipl = xc_extract_ipl(flags);
    263 		return xc_highpri(func, arg1, arg2, NULL, ipl);
    264 	} else {
    265 		return xc_lowpri(func, arg1, arg2, NULL);
    266 	}
    267 }
    268 
    269 /*
    270  * xc_unicast:
    271  *
    272  *	Trigger a call on one CPU.
    273  */
    274 uint64_t
    275 xc_unicast(unsigned int flags, xcfunc_t func, void *arg1, void *arg2,
    276 	   struct cpu_info *ci)
    277 {
    278 
    279 	KASSERT(ci != NULL);
    280 	KASSERT(!cpu_intr_p() && !cpu_softintr_p());
    281 
    282 	if ((flags & XC_HIGHPRI) != 0) {
    283 		int ipl = xc_extract_ipl(flags);
    284 		return xc_highpri(func, arg1, arg2, ci, ipl);
    285 	} else {
    286 		return xc_lowpri(func, arg1, arg2, ci);
    287 	}
    288 }
    289 
    290 /*
    291  * xc_wait:
    292  *
    293  *	Wait for a cross call to complete.
    294  */
    295 void
    296 xc_wait(uint64_t where)
    297 {
    298 	xc_state_t *xc;
    299 
    300 	KASSERT(!cpu_intr_p() && !cpu_softintr_p());
    301 
    302 	/* Determine whether it is high or low priority cross-call. */
    303 	if ((where & XC_PRI_BIT) != 0) {
    304 		xc = &xc_high_pri;
    305 		where &= ~XC_PRI_BIT;
    306 	} else {
    307 		xc = &xc_low_pri;
    308 	}
    309 
    310 	/* Fast path, if already done. */
    311 	if (xc->xc_donep >= where) {
    312 		return;
    313 	}
    314 
    315 	/* Slow path: block until awoken. */
    316 	mutex_enter(&xc->xc_lock);
    317 	while (xc->xc_donep < where) {
    318 		cv_wait(&xc->xc_busy, &xc->xc_lock);
    319 	}
    320 	mutex_exit(&xc->xc_lock);
    321 }
    322 
    323 /*
    324  * xc_lowpri:
    325  *
    326  *	Trigger a low priority call on one or more CPUs.
    327  */
    328 static inline uint64_t
    329 xc_lowpri(xcfunc_t func, void *arg1, void *arg2, struct cpu_info *ci)
    330 {
    331 	xc_state_t *xc = &xc_low_pri;
    332 	CPU_INFO_ITERATOR cii;
    333 	uint64_t where;
    334 
    335 	mutex_enter(&xc->xc_lock);
    336 	while (xc->xc_headp != xc->xc_donep) {
    337 		cv_wait(&xc->xc_busy, &xc->xc_lock);
    338 	}
    339 	xc->xc_arg1 = arg1;
    340 	xc->xc_arg2 = arg2;
    341 	xc->xc_func = func;
    342 	if (ci == NULL) {
    343 		xc_broadcast_ev.ev_count++;
    344 		for (CPU_INFO_FOREACH(cii, ci)) {
    345 			if ((ci->ci_schedstate.spc_flags & SPCF_RUNNING) == 0)
    346 				continue;
    347 			xc->xc_headp += 1;
    348 			ci->ci_data.cpu_xcall_pending = true;
    349 			cv_signal(&ci->ci_data.cpu_xcall);
    350 		}
    351 	} else {
    352 		xc_unicast_ev.ev_count++;
    353 		xc->xc_headp += 1;
    354 		ci->ci_data.cpu_xcall_pending = true;
    355 		cv_signal(&ci->ci_data.cpu_xcall);
    356 	}
    357 	KASSERT(xc->xc_donep < xc->xc_headp);
    358 	where = xc->xc_headp;
    359 	mutex_exit(&xc->xc_lock);
    360 
    361 	/* Return a low priority ticket. */
    362 	KASSERT((where & XC_PRI_BIT) == 0);
    363 	return where;
    364 }
    365 
    366 /*
    367  * xc_thread:
    368  *
    369  *	One thread per-CPU to dispatch low priority calls.
    370  */
    371 static void
    372 xc_thread(void *cookie)
    373 {
    374 	struct cpu_info *ci = curcpu();
    375 	xc_state_t *xc = &xc_low_pri;
    376 	void *arg1, *arg2;
    377 	xcfunc_t func;
    378 
    379 	mutex_enter(&xc->xc_lock);
    380 	for (;;) {
    381 		while (!ci->ci_data.cpu_xcall_pending) {
    382 			if (xc->xc_headp == xc->xc_donep) {
    383 				cv_broadcast(&xc->xc_busy);
    384 			}
    385 			cv_wait(&ci->ci_data.cpu_xcall, &xc->xc_lock);
    386 			KASSERT(ci == curcpu());
    387 		}
    388 		ci->ci_data.cpu_xcall_pending = false;
    389 		func = xc->xc_func;
    390 		arg1 = xc->xc_arg1;
    391 		arg2 = xc->xc_arg2;
    392 		mutex_exit(&xc->xc_lock);
    393 
    394 		KASSERT(func != NULL);
    395 		(*func)(arg1, arg2);
    396 
    397 		mutex_enter(&xc->xc_lock);
    398 		xc->xc_donep++;
    399 	}
    400 	/* NOTREACHED */
    401 }
    402 
    403 /*
    404  * xc_ipi_handler:
    405  *
    406  *	Handler of cross-call IPI.
    407  */
    408 void
    409 xc_ipi_handler(void)
    410 {
    411 	xc_state_t *xc = & xc_high_pri;
    412 
    413 	KASSERT(xc->xc_ipl < __arraycount(xc_sihs));
    414 	KASSERT(xc_sihs[xc->xc_ipl] != NULL);
    415 
    416 	/* Executes xc__highpri_intr() via software interrupt. */
    417 	softint_schedule(xc_sihs[xc->xc_ipl]);
    418 }
    419 
    420 /*
    421  * xc__highpri_intr:
    422  *
    423  *	A software interrupt handler for high priority calls.
    424  */
    425 void
    426 xc__highpri_intr(void *dummy)
    427 {
    428 	xc_state_t *xc = &xc_high_pri;
    429 	void *arg1, *arg2;
    430 	xcfunc_t func;
    431 
    432 	KASSERT(!cpu_intr_p());
    433 	/*
    434 	 * Lock-less fetch of function and its arguments.
    435 	 * Safe since it cannot change at this point.
    436 	 */
    437 	KASSERT(xc->xc_donep < xc->xc_headp);
    438 	func = xc->xc_func;
    439 	arg1 = xc->xc_arg1;
    440 	arg2 = xc->xc_arg2;
    441 
    442 	KASSERT(func != NULL);
    443 	(*func)(arg1, arg2);
    444 
    445 	/*
    446 	 * Note the request as done, and if we have reached the head,
    447 	 * cross-call has been processed - notify waiters, if any.
    448 	 */
    449 	mutex_enter(&xc->xc_lock);
    450 	if (++xc->xc_donep == xc->xc_headp) {
    451 		cv_broadcast(&xc->xc_busy);
    452 	}
    453 	mutex_exit(&xc->xc_lock);
    454 }
    455 
    456 /*
    457  * xc_highpri:
    458  *
    459  *	Trigger a high priority call on one or more CPUs.
    460  */
    461 static inline uint64_t
    462 xc_highpri(xcfunc_t func, void *arg1, void *arg2, struct cpu_info *ci,
    463     unsigned int ipl)
    464 {
    465 	xc_state_t *xc = &xc_high_pri;
    466 	uint64_t where;
    467 
    468 	mutex_enter(&xc->xc_lock);
    469 	while (xc->xc_headp != xc->xc_donep) {
    470 		cv_wait(&xc->xc_busy, &xc->xc_lock);
    471 	}
    472 	xc->xc_func = func;
    473 	xc->xc_arg1 = arg1;
    474 	xc->xc_arg2 = arg2;
    475 	xc->xc_headp += (ci ? 1 : ncpu);
    476 	xc->xc_ipl = ipl;
    477 	where = xc->xc_headp;
    478 	mutex_exit(&xc->xc_lock);
    479 
    480 	/*
    481 	 * Send the IPI once lock is released.
    482 	 * Note: it will handle the local CPU case.
    483 	 */
    484 
    485 #ifdef _RUMPKERNEL
    486 	rump_xc_highpri(ci);
    487 #else
    488 #ifdef MULTIPROCESSOR
    489 	kpreempt_disable();
    490 	if (curcpu() == ci) {
    491 		/* Unicast: local CPU. */
    492 		xc_ipi_handler();
    493 	} else if (ci) {
    494 		/* Unicast: remote CPU. */
    495 		xc_send_ipi(ci);
    496 	} else {
    497 		/* Broadcast: all, including local. */
    498 		xc_send_ipi(NULL);
    499 		xc_ipi_handler();
    500 	}
    501 	kpreempt_enable();
    502 #else
    503 	KASSERT(ci == NULL || curcpu() == ci);
    504 	xc_ipi_handler();
    505 #endif
    506 #endif
    507 
    508 	/* Indicate a high priority ticket. */
    509 	return (where | XC_PRI_BIT);
    510 }
    511