2 * SPDX-License-Identifier: BSD-3-Clause
4 * Copyright (c) 1991 The Regents of the University of California.
7 * This code is derived from software contributed to Berkeley by
10 * Redistribution and use in source and binary forms, with or without
11 * modification, are permitted provided that the following conditions
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. Neither the name of the University nor the names of its contributors
19 * may be used to endorse or promote products derived from this software
20 * without specific prior written permission.
22 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
23 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
24 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
25 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
26 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
27 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
28 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
29 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
30 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
31 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
35 * Copyright (c) 2001 Jake Burkholder.
36 * All rights reserved.
38 * Redistribution and use in source and binary forms, with or without
39 * modification, are permitted provided that the following conditions
41 * 1. Redistributions of source code must retain the above copyright
42 * notice, this list of conditions and the following disclaimer.
43 * 2. Redistributions in binary form must reproduce the above copyright
44 * notice, this list of conditions and the following disclaimer in the
45 * documentation and/or other materials provided with the distribution.
47 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
48 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
49 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
50 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
51 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
52 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
53 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
54 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
55 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
56 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
59 * from: @(#)isa.c 7.2 (Berkeley) 5/13/91
60 * form: src/sys/i386/isa/intr_machdep.c,v 1.57 2001/07/20
63 #include <sys/cdefs.h>
64 __FBSDID("$FreeBSD$");
66 #include <sys/param.h>
67 #include <sys/systm.h>
69 #include <sys/errno.h>
70 #include <sys/interrupt.h>
71 #include <sys/kernel.h>
73 #include <sys/mutex.h>
78 #include <sys/vmmeter.h>
80 #include <machine/frame.h>
81 #include <machine/intr_machdep.h>
83 #define MAX_STRAY_LOG 5
85 CTASSERT((1 << IV_SHIFT) == sizeof(struct intr_vector));
87 ih_func_t *intr_handlers[PIL_MAX];
88 uint16_t pil_countp[PIL_MAX];
89 static uint16_t pil_stray_count[PIL_MAX];
91 struct intr_vector intr_vectors[IV_MAX];
92 uint16_t intr_countp[IV_MAX];
93 static uint16_t intr_stray_count[IV_MAX];
95 static const char *const pil_names[] = {
98 "preempt", /* PIL_PREEMPT */
99 "ithrd", /* PIL_ITHREAD */
100 "rndzvs", /* PIL_RENDEZVOUS */
102 "hardclock", /* PIL_HARDCLOCK */
103 "stray", "stray", "stray", "stray",
104 "filter", /* PIL_FILTER */
105 "bridge", /* PIL_BRIDGE */
106 "stop", /* PIL_STOP */
107 "tick", /* PIL_TICK */
110 /* protect the intr_vectors table */
111 static struct sx intr_table_lock;
112 /* protect intrcnt_index */
113 static struct mtx intrcnt_lock;
116 static int assign_cpu;
118 static void intr_assign_next_cpu(struct intr_vector *iv);
119 static void intr_shuffle_irqs(void *arg __unused);
122 static int intr_assign_cpu(void *arg, int cpu);
123 static void intr_execute_handlers(void *);
124 static void intr_stray_level(struct trapframe *);
125 static void intr_stray_vector(void *);
126 static int intrcnt_setname(const char *, int);
127 static void intrcnt_updatename(int, const char *, int);
128 void counter_intr_inc(void);
131 intrcnt_updatename(int vec, const char *name, int ispil)
133 static int intrcnt_index, stray_pil_index, stray_vec_index;
136 mtx_lock_spin(&intrcnt_lock);
137 if (intrnames[0] == '\0') {
140 printf("initalizing intr_countp\n");
141 intrcnt_setname("???", intrcnt_index++);
143 stray_vec_index = intrcnt_index++;
144 intrcnt_setname("stray", stray_vec_index);
145 for (name_index = 0; name_index < IV_MAX; name_index++)
146 intr_countp[name_index] = stray_vec_index;
148 stray_pil_index = intrcnt_index++;
149 intrcnt_setname("pil", stray_pil_index);
150 for (name_index = 0; name_index < PIL_MAX; name_index++)
151 pil_countp[name_index] = stray_pil_index;
157 if (!ispil && intr_countp[vec] != stray_vec_index)
158 name_index = intr_countp[vec];
159 else if (ispil && pil_countp[vec] != stray_pil_index)
160 name_index = pil_countp[vec];
162 name_index = intrcnt_index++;
164 if (intrcnt_setname(name, name_index))
168 intr_countp[vec] = name_index;
170 pil_countp[vec] = name_index;
171 mtx_unlock_spin(&intrcnt_lock);
175 intrcnt_setname(const char *name, int index)
178 if ((MAXCOMLEN + 1) * index >= sintrnames)
180 snprintf(intrnames + (MAXCOMLEN + 1) * index, MAXCOMLEN + 1, "%-*s",
186 intr_setup(int pri, ih_func_t *ihf, int vec, iv_func_t *ivf, void *iva)
188 char pilname[MAXCOMLEN + 1];
193 intr_vectors[vec].iv_func = ivf;
194 intr_vectors[vec].iv_arg = iva;
195 intr_vectors[vec].iv_pri = pri;
196 intr_vectors[vec].iv_vec = vec;
198 intr_handlers[pri] = ihf;
200 snprintf(pilname, MAXCOMLEN + 1, "pil%d: %s", pri, pil_names[pri]);
201 intrcnt_updatename(pri, pilname, 1);
205 intr_stray_level(struct trapframe *tf)
209 level = tf->tf_level;
210 if (pil_stray_count[level] < MAX_STRAY_LOG) {
211 printf("stray level interrupt %ld\n", level);
212 pil_stray_count[level]++;
213 if (pil_stray_count[level] >= MAX_STRAY_LOG)
214 printf("got %d stray level interrupt %ld's: not "
215 "logging anymore\n", MAX_STRAY_LOG, level);
220 intr_stray_vector(void *cookie)
222 struct intr_vector *iv;
227 if (intr_stray_count[vec] < MAX_STRAY_LOG) {
228 printf("stray vector interrupt %d\n", vec);
229 intr_stray_count[vec]++;
230 if (intr_stray_count[vec] >= MAX_STRAY_LOG)
231 printf("got %d stray vector interrupt %d's: not "
232 "logging anymore\n", MAX_STRAY_LOG, vec);
241 /* Mark all interrupts as being stray. */
242 for (i = 0; i < PIL_MAX; i++)
243 intr_handlers[i] = intr_stray_level;
244 for (i = 0; i < IV_MAX; i++) {
245 intr_vectors[i].iv_func = intr_stray_vector;
246 intr_vectors[i].iv_arg = &intr_vectors[i];
247 intr_vectors[i].iv_pri = PIL_LOW;
248 intr_vectors[i].iv_vec = i;
249 intr_vectors[i].iv_refcnt = 0;
251 intr_handlers[PIL_LOW] = intr_fast;
258 sx_init(&intr_table_lock, "intr sources");
259 mtx_init(&intrcnt_lock, "intrcnt", NULL, MTX_SPIN);
263 intr_assign_cpu(void *arg, int cpu)
267 struct intr_vector *iv;
270 * Don't do anything during early boot. We will pick up the
271 * assignment once the APs are started.
273 if (assign_cpu && cpu != NOCPU) {
278 sx_xlock(&intr_table_lock);
279 iv->iv_mid = pc->pc_mid;
280 iv->iv_ic->ic_assign(iv);
281 sx_xunlock(&intr_table_lock);
290 intr_execute_handlers(void *cookie)
292 struct intr_vector *iv;
295 if (__predict_false(intr_event_handle(iv->iv_event, NULL) != 0))
296 intr_stray_vector(iv);
300 intr_controller_register(int vec, const struct intr_controller *ic,
303 struct intr_event *ie;
304 struct intr_vector *iv;
307 if (vec < 0 || vec >= IV_MAX)
309 sx_xlock(&intr_table_lock);
310 iv = &intr_vectors[vec];
312 sx_xunlock(&intr_table_lock);
315 error = intr_event_create(&ie, iv, 0, vec, NULL, ic->ic_clear,
316 ic->ic_clear, intr_assign_cpu, "vec%d:", vec);
319 sx_xlock(&intr_table_lock);
320 if (iv->iv_event != NULL) {
321 sx_xunlock(&intr_table_lock);
322 intr_event_destroy(ie);
326 iv->iv_icarg = icarg;
328 iv->iv_mid = PCPU_GET(mid);
329 sx_xunlock(&intr_table_lock);
334 inthand_add(const char *name, int vec, driver_filter_t *filt,
335 driver_intr_t *handler, void *arg, int flags, void **cookiep)
337 const struct intr_controller *ic;
338 struct intr_event *ie;
339 struct intr_handler *ih;
340 struct intr_vector *iv;
343 if (vec < 0 || vec >= IV_MAX)
346 * INTR_BRIDGE filters/handlers are special purpose only, allowing
347 * them to be shared just would complicate things unnecessarily.
349 if ((flags & INTR_BRIDGE) != 0 && (flags & INTR_EXCL) == 0)
351 sx_xlock(&intr_table_lock);
352 iv = &intr_vectors[vec];
355 sx_xunlock(&intr_table_lock);
356 if (ic == NULL || ie == NULL)
358 error = intr_event_add_handler(ie, name, filt, handler, arg,
359 intr_priority(flags), flags, cookiep);
362 sx_xlock(&intr_table_lock);
363 /* Disable the interrupt while we fiddle with it. */
366 if (iv->iv_refcnt == 1)
367 intr_setup((flags & INTR_BRIDGE) != 0 ? PIL_BRIDGE :
368 filt != NULL ? PIL_FILTER : PIL_ITHREAD, intr_fast,
369 vec, intr_execute_handlers, iv);
370 else if (filt != NULL) {
372 * Check if we need to upgrade from PIL_ITHREAD to PIL_FILTER.
373 * Given that apart from the on-board SCCs and UARTs shared
374 * interrupts are rather uncommon on sparc64 this should be
375 * pretty rare in practice.
378 TAILQ_FOREACH(ih, &ie->ie_handlers, ih_next) {
379 if (ih->ih_filter != NULL && ih->ih_filter != filt) {
385 intr_setup(PIL_FILTER, intr_fast, vec,
386 intr_execute_handlers, iv);
388 intr_stray_count[vec] = 0;
389 intrcnt_updatename(vec, ie->ie_fullname, 0);
392 intr_assign_next_cpu(iv);
395 /* Ensure the interrupt is cleared, it might have triggered before. */
396 if (ic->ic_clear != NULL)
398 sx_xunlock(&intr_table_lock);
403 inthand_remove(int vec, void *cookie)
405 struct intr_vector *iv;
408 if (vec < 0 || vec >= IV_MAX)
410 error = intr_event_remove_handler(cookie);
413 * XXX: maybe this should be done regardless of whether
414 * intr_event_remove_handler() succeeded?
416 sx_xlock(&intr_table_lock);
417 iv = &intr_vectors[vec];
419 if (iv->iv_refcnt == 0) {
421 * Don't disable the interrupt for now, so that
422 * stray interrupts get detected...
424 intr_setup(PIL_LOW, intr_fast, vec,
425 intr_stray_vector, iv);
427 sx_xunlock(&intr_table_lock);
432 /* Add a description to an active interrupt handler. */
434 intr_describe(int vec, void *ih, const char *descr)
436 struct intr_vector *iv;
439 if (vec < 0 || vec >= IV_MAX)
441 sx_xlock(&intr_table_lock);
442 iv = &intr_vectors[vec];
444 sx_xunlock(&intr_table_lock);
447 error = intr_event_describe_handler(iv->iv_event, ih, descr);
449 sx_xunlock(&intr_table_lock);
452 intrcnt_updatename(vec, iv->iv_event->ie_fullname, 0);
453 sx_xunlock(&intr_table_lock);
458 * Do VM_CNT_INC(intr), being in the interrupt context already. This is
459 * called from assembly.
460 * To avoid counter_enter() and appropriate assertion, unwrap VM_CNT_INC()
461 * and hardcode the actual increment.
464 counter_intr_inc(void)
467 *(uint64_t *)zpcpu_get(vm_cnt.v_intr) += 1;
472 * Support for balancing interrupt sources across CPUs. For now we just
473 * allocate CPUs round-robin.
476 static cpuset_t intr_cpus = CPUSET_T_INITIALIZER(0x1);
477 static int current_cpu;
480 intr_assign_next_cpu(struct intr_vector *iv)
484 sx_assert(&intr_table_lock, SA_XLOCKED);
487 * Assign this source to a CPU in a round-robin fashion.
489 pc = pcpu_find(current_cpu);
492 iv->iv_mid = pc->pc_mid;
493 iv->iv_ic->ic_assign(iv);
496 if (current_cpu > mp_maxid)
498 } while (!CPU_ISSET(current_cpu, &intr_cpus));
501 /* Attempt to bind the specified IRQ to the specified CPU. */
503 intr_bind(int vec, u_char cpu)
505 struct intr_vector *iv;
508 if (vec < 0 || vec >= IV_MAX)
510 sx_xlock(&intr_table_lock);
511 iv = &intr_vectors[vec];
513 sx_xunlock(&intr_table_lock);
516 error = intr_event_bind(iv->iv_event, cpu);
517 sx_xunlock(&intr_table_lock);
522 * Add a CPU to our mask of valid CPUs that can be destinations of
526 intr_add_cpu(u_int cpu)
530 panic("%s: Invalid CPU ID", __func__);
532 printf("INTR: Adding CPU %d as a target\n", cpu);
534 CPU_SET(cpu, &intr_cpus);
538 * Distribute all the interrupt sources among the available CPUs once the
539 * APs have been launched.
542 intr_shuffle_irqs(void *arg __unused)
545 struct intr_vector *iv;
548 /* Don't bother on UP. */
552 sx_xlock(&intr_table_lock);
554 for (i = 0; i < IV_MAX; i++) {
555 iv = &intr_vectors[i];
556 if (iv != NULL && iv->iv_refcnt > 0) {
558 * If this event is already bound to a CPU,
559 * then assign the source to that CPU instead
560 * of picking one via round-robin.
562 if (iv->iv_event->ie_cpu != NOCPU &&
563 (pc = pcpu_find(iv->iv_event->ie_cpu)) != NULL) {
564 iv->iv_mid = pc->pc_mid;
565 iv->iv_ic->ic_assign(iv);
567 intr_assign_next_cpu(iv);
570 sx_xunlock(&intr_table_lock);
572 SYSINIT(intr_shuffle_irqs, SI_SUB_SMP, SI_ORDER_SECOND, intr_shuffle_irqs,