Home | History | Annotate | Line # | Download | only in kern
subr_xcall.c revision 1.1.2.6
      1 /*	$NetBSD: subr_xcall.c,v 1.1.2.6 2007/11/01 21:58:22 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.1.2.6 2007/11/01 21:58:22 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 #include <sys/cpu.h>
     91 
     92 static void	xc_thread(void *);
     93 static uint64_t	xc_lowpri(u_int, xcfunc_t, void *, void *, struct cpu_info *);
     94 
     95 static kmutex_t		xc_lock;
     96 static xcfunc_t		xc_func;
     97 static void		*xc_arg1;
     98 static void		*xc_arg2;
     99 static kcondvar_t	xc_busy;
    100 static struct evcnt	xc_unicast_ev;
    101 static struct evcnt	xc_broadcast_ev;
    102 static uint64_t		xc_headp;
    103 static uint64_t		xc_tailp;
    104 static uint64_t		xc_donep;
    105 
    106 /*
    107  * xc_init_cpu:
    108  *
    109  *	Initialize the cross-call subsystem.  Called once for each CPU
    110  *	in the system as they are attached.
    111  */
    112 void
    113 xc_init_cpu(struct cpu_info *ci)
    114 {
    115 	static bool again;
    116 	int error;
    117 
    118 	if (!again) {
    119 		/* Autoconfiguration will prevent re-entry. */
    120 		again = true;
    121 		mutex_init(&xc_lock, MUTEX_DEFAULT, IPL_NONE);
    122 		cv_init(&xc_busy, "xcallbsy");
    123 		evcnt_attach_dynamic(&xc_unicast_ev, EVCNT_TYPE_MISC, NULL,
    124 		   "crosscall", "unicast");
    125 		evcnt_attach_dynamic(&xc_broadcast_ev, EVCNT_TYPE_MISC, NULL,
    126 		   "crosscall", "broadcast");
    127 	}
    128 
    129 	cv_init(&ci->ci_data.cpu_xcall, "xcall");
    130 	error = kthread_create(PRI_XCALL, KTHREAD_MPSAFE, ci, xc_thread,
    131 	    NULL, NULL, "xcall/%d", (int)ci->ci_cpuid);
    132 	if (error != 0)
    133 		panic("xc_init_cpu: error %d", error);
    134 }
    135 
    136 /*
    137  * xc_unicast:
    138  *
    139  *	Trigger a call on all CPUs in the system.
    140  */
    141 uint64_t
    142 xc_broadcast(u_int flags, xcfunc_t func, void *arg1, void *arg2)
    143 {
    144 
    145 	if ((flags & XC_HIGHPRI) != 0) {
    146 		panic("xc_unicast: no high priority crosscalls yet");
    147 	} else {
    148 		return xc_lowpri(flags, func, arg1, arg2, NULL);
    149 	}
    150 }
    151 
    152 /*
    153  * xc_unicast:
    154  *
    155  *	Trigger a call on one CPU.
    156  */
    157 uint64_t
    158 xc_unicast(u_int flags, xcfunc_t func, void *arg1, void *arg2,
    159 	   struct cpu_info *ci)
    160 {
    161 
    162 	if ((flags & XC_HIGHPRI) != 0) {
    163 		panic("xc_unicast: no high priority crosscalls yet");
    164 	} else {
    165 		KASSERT(ci != NULL);
    166 		return xc_lowpri(flags, func, arg1, arg2, ci);
    167 	}
    168 }
    169 
    170 /*
    171  * xc_lowpri:
    172  *
    173  *	Trigger a low priority call on one or more CPUs.
    174  */
    175 static uint64_t
    176 xc_lowpri(u_int flags, xcfunc_t func, void *arg1, void *arg2,
    177 	  struct cpu_info *ci)
    178 {
    179 	CPU_INFO_ITERATOR cii;
    180 	u_int where;
    181 
    182 	mutex_enter(&xc_lock);
    183 	while (xc_headp != xc_tailp)
    184 		cv_wait(&xc_busy, &xc_lock);
    185 	xc_arg1 = arg1;
    186 	xc_arg2 = arg2;
    187 	xc_func = func;
    188 	if (ci == NULL) {
    189 		xc_broadcast_ev.ev_count++;
    190 		for (CPU_INFO_FOREACH(cii, ci)) {
    191 			xc_headp += 1;
    192 			ci->ci_data.cpu_xcall_pending = true;
    193 			cv_signal(&ci->ci_data.cpu_xcall);
    194 		}
    195 	} else {
    196 		xc_unicast_ev.ev_count++;
    197 		xc_headp += 1;
    198 		ci->ci_data.cpu_xcall_pending = true;
    199 		cv_signal(&ci->ci_data.cpu_xcall);
    200 	}
    201 	KASSERT(xc_tailp < xc_headp);
    202 	where = xc_headp;
    203 	mutex_exit(&xc_lock);
    204 
    205 	return where;
    206 }
    207 
    208 /*
    209  * xc_wait:
    210  *
    211  *	Wait for a cross call to complete.
    212  */
    213 void
    214 xc_wait(uint64_t where)
    215 {
    216 
    217 	if (xc_donep >= where)
    218 		return;
    219 
    220 	mutex_enter(&xc_lock);
    221 	while (xc_donep < where)
    222 		cv_wait(&xc_busy, &xc_lock);
    223 	mutex_exit(&xc_lock);
    224 }
    225 
    226 /*
    227  * xc_thread:
    228  *
    229  *	One thread per-CPU to dispatch low priority calls.
    230  */
    231 static void
    232 xc_thread(void *cookie)
    233 {
    234 	void *arg1, *arg2;
    235 	struct cpu_info *ci;
    236 	xcfunc_t func;
    237 
    238 	ci = curcpu();
    239 
    240 	mutex_enter(&xc_lock);
    241 	for (;;) {
    242 		while (!ci->ci_data.cpu_xcall_pending) {
    243 			if (xc_headp == xc_tailp)
    244 				cv_broadcast(&xc_busy);
    245 			cv_wait(&ci->ci_data.cpu_xcall, &xc_lock);
    246 			KASSERT(ci == curcpu());
    247 		}
    248 		ci->ci_data.cpu_xcall_pending = false;
    249 		func = xc_func;
    250 		arg1 = xc_arg1;
    251 		arg2 = xc_arg2;
    252 		xc_tailp++;
    253 		mutex_exit(&xc_lock);
    254 
    255 		(*func)(arg1, arg2);
    256 
    257 		mutex_enter(&xc_lock);
    258 		xc_donep++;
    259 	}
    260 	/* NOTREACHED */
    261 }
    262