Home | History | Annotate | Line # | Download | only in kern
subr_xcall.c revision 1.2
      1 /*	$NetBSD: subr_xcall.c,v 1.2 2007/10/08 15:12:08 ad Exp $	*/
      2 
      3 /*-
      4  * Copyright (c) 2007 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.
      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  * 3. All advertising materials mentioning features or use of this software
     19  *    must display the following acknowledgement:
     20  *	This product includes software developed by the NetBSD
     21  *	Foundation, Inc. and its contributors.
     22  * 4. Neither the name of The NetBSD Foundation nor the names of its
     23  *    contributors may be used to endorse or promote products derived
     24  *    from this software without specific prior written permission.
     25  *
     26  * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS
     27  * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
     28  * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
     29  * PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS
     30  * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
     31  * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
     32  * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
     33  * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
     34  * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
     35  * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
     36  * POSSIBILITY OF SUCH DAMAGE.
     37  */
     38 
     39 /*
     40  * Cross call support
     41  *
     42  * Background
     43  *
     44  *	Sometimes it is necessary to modify hardware state that is tied
     45  *	directly to individual CPUs (such as a CPU's local timer), and
     46  *	these updates can not be done remotely by another CPU.  The LWP
     47  *	requesting the update may be unable to guarantee that it will be
     48  *	running on the CPU where the update must occur, when the update
     49  *	occurs.
     50  *
     51  *	Additionally, it's sometimes necessary to modify per-CPU software
     52  *	state from a remote CPU.  Where these update operations are so
     53  *	rare or the access to the per-CPU data so frequent that the cost
     54  *	of using locking or atomic operations to provide coherency is
     55  *	prohobitive, another way must be found.
     56  *
     57  *	Cross calls help to solve these types of problem by allowing
     58  *	any CPU in the system to request that an arbitrary function be
     59  *	executed on any other CPU.
     60  *
     61  * Implementation
     62  *
     63  *	A slow mechanism for making 'low priority' cross calls is
     64  *	provided.  The function to be executed runs on the remote CPU
     65  *	within a bound kthread.  No queueing is provided, and the
     66  *	implementation uses global state.  The function being called may
     67  *	block briefly on locks, but in doing so must be careful to not
     68  *	interfere with other cross calls in the system.  The function is
     69  *	called with thread context and not from a soft interrupt, so it
     70  *	can ensure that it is not interrupting other code running on the
     71  *	CPU, and so has exclusive access to the CPU.  Since this facility
     72  *	is heavyweight, it's expected that it will not be used often.
     73  *
     74  * Future directions
     75  *
     76  *	Add a low-overhead mechanism to run cross calls in interrupt
     77  *	context (XC_HIGHPRI).
     78  */
     79 
     80 #include <sys/cdefs.h>
     81 __KERNEL_RCSID(0, "$NetBSD: subr_xcall.c,v 1.2 2007/10/08 15:12:08 ad Exp $");
     82 
     83 #include <sys/types.h>
     84 #include <sys/param.h>
     85 #include <sys/xcall.h>
     86 #include <sys/mutex.h>
     87 #include <sys/condvar.h>
     88 #include <sys/evcnt.h>
     89 #include <sys/kthread.h>
     90 
     91 #define	PRI_XCALL	0
     92 
     93 static void	xc_thread(void *);
     94 static uint64_t	xc_lowpri(u_int, xcfunc_t, void *, void *, struct cpu_info *);
     95 
     96 static kmutex_t		xc_lock;
     97 static xcfunc_t		xc_func;
     98 static void		*xc_arg1;
     99 static void		*xc_arg2;
    100 static kcondvar_t	xc_busy;
    101 static struct evcnt	xc_unicast_ev;
    102 static struct evcnt	xc_broadcast_ev;
    103 static uint64_t		xc_headp;
    104 static uint64_t		xc_tailp;
    105 static uint64_t		xc_donep;
    106 
    107 /*
    108  * xc_init_cpu:
    109  *
    110  *	Initialize the cross-call subsystem.  Called once for each CPU
    111  *	in the system as they are attached.
    112  */
    113 void
    114 xc_init_cpu(struct cpu_info *ci)
    115 {
    116 	static bool again;
    117 	int error;
    118 
    119 	if (!again) {
    120 		/* Autoconfiguration will prevent re-entry. */
    121 		again = true;
    122 		mutex_init(&xc_lock, MUTEX_DEFAULT, IPL_NONE);
    123 		cv_init(&xc_busy, "xcallbsy");
    124 		evcnt_attach_dynamic(&xc_unicast_ev, EVCNT_TYPE_MISC, NULL,
    125 		   "crosscall", "unicast");
    126 		evcnt_attach_dynamic(&xc_broadcast_ev, EVCNT_TYPE_MISC, NULL,
    127 		   "crosscall", "broadcast");
    128 	}
    129 
    130 	cv_init(&ci->ci_data.cpu_xcall, "xcall");
    131 	error = kthread_create(PRI_XCALL, KTHREAD_MPSAFE, ci, xc_thread,
    132 	    NULL, NULL, "xcall/%d", (int)ci->ci_cpuid);
    133 	if (error != 0)
    134 		panic("xc_init_cpu: error %d", error);
    135 }
    136 
    137 /*
    138  * xc_unicast:
    139  *
    140  *	Trigger a call on all CPUs in the system.
    141  */
    142 uint64_t
    143 xc_broadcast(u_int flags, xcfunc_t func, void *arg1, void *arg2)
    144 {
    145 
    146 	if ((flags & XC_HIGHPRI) != 0) {
    147 		panic("xc_unicast: no high priority crosscalls yet");
    148 	} else {
    149 		return xc_lowpri(flags, func, arg1, arg2, NULL);
    150 	}
    151 }
    152 
    153 /*
    154  * xc_unicast:
    155  *
    156  *	Trigger a call on one CPU.
    157  */
    158 uint64_t
    159 xc_unicast(u_int flags, xcfunc_t func, void *arg1, void *arg2,
    160 	   struct cpu_info *ci)
    161 {
    162 
    163 	if ((flags & XC_HIGHPRI) != 0) {
    164 		panic("xc_unicast: no high priority crosscalls yet");
    165 	} else {
    166 		KASSERT(ci != NULL);
    167 		return xc_lowpri(flags, func, arg1, arg2, ci);
    168 	}
    169 }
    170 
    171 /*
    172  * xc_lowpri:
    173  *
    174  *	Trigger a low priority call on one or more CPUs.
    175  */
    176 static uint64_t
    177 xc_lowpri(u_int flags, xcfunc_t func, void *arg1, void *arg2,
    178 	  struct cpu_info *ci)
    179 {
    180 	CPU_INFO_ITERATOR cii;
    181 	u_int where;
    182 
    183 	mutex_enter(&xc_lock);
    184 	while (xc_headp != xc_tailp)
    185 		cv_wait(&xc_busy, &xc_lock);
    186 	xc_arg1 = arg1;
    187 	xc_arg2 = arg2;
    188 	xc_func = func;
    189 	if (ci == NULL) {
    190 		xc_broadcast_ev.ev_count++;
    191 		for (CPU_INFO_FOREACH(cii, ci)) {
    192 			xc_headp += 1;
    193 			ci->ci_data.cpu_xcall_pending = true;
    194 			cv_signal(&ci->ci_data.cpu_xcall);
    195 		}
    196 	} else {
    197 		xc_unicast_ev.ev_count++;
    198 		xc_headp += 1;
    199 		ci->ci_data.cpu_xcall_pending = true;
    200 		cv_signal(&ci->ci_data.cpu_xcall);
    201 	}
    202 	KASSERT(xc_tailp < xc_headp);
    203 	where = xc_headp;
    204 	mutex_exit(&xc_lock);
    205 
    206 	return where;
    207 }
    208 
    209 /*
    210  * xc_wait:
    211  *
    212  *	Wait for a cross call to complete.
    213  */
    214 void
    215 xc_wait(uint64_t where)
    216 {
    217 
    218 	if (xc_donep >= where)
    219 		return;
    220 
    221 	mutex_enter(&xc_lock);
    222 	while (xc_donep < where)
    223 		cv_wait(&xc_busy, &xc_lock);
    224 	mutex_exit(&xc_lock);
    225 }
    226 
    227 /*
    228  * xc_thread:
    229  *
    230  *	One thread per-CPU to dispatch low priority calls.
    231  */
    232 static void
    233 xc_thread(void *cookie)
    234 {
    235 	void *arg1, *arg2;
    236 	struct cpu_info *ci;
    237 	xcfunc_t func;
    238 
    239 	ci = curcpu();
    240 
    241 	mutex_enter(&xc_lock);
    242 	for (;;) {
    243 		while (!ci->ci_data.cpu_xcall_pending) {
    244 			if (xc_headp == xc_tailp)
    245 				cv_broadcast(&xc_busy);
    246 			cv_wait(&ci->ci_data.cpu_xcall, &xc_lock);
    247 			KASSERT(ci == curcpu());
    248 		}
    249 		ci->ci_data.cpu_xcall_pending = false;
    250 		func = xc_func;
    251 		arg1 = xc_arg1;
    252 		arg2 = xc_arg2;
    253 		xc_tailp++;
    254 		mutex_exit(&xc_lock);
    255 
    256 		(*func)(arg1, arg2);
    257 
    258 		mutex_enter(&xc_lock);
    259 		xc_donep++;
    260 	}
    261 	/* NOTREACHED */
    262 }
    263