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