intr.c revision 1.27 1 1.27 rin /* $NetBSD: intr.c,v 1.27 2020/02/20 05:10:01 rin Exp $ */
2 1.2 garbled
3 1.2 garbled /*-
4 1.2 garbled * Copyright (c) 2007 Michael Lorenz
5 1.2 garbled * All rights reserved.
6 1.2 garbled *
7 1.2 garbled * Redistribution and use in source and binary forms, with or without
8 1.2 garbled * modification, are permitted provided that the following conditions
9 1.2 garbled * are met:
10 1.2 garbled * 1. Redistributions of source code must retain the above copyright
11 1.2 garbled * notice, this list of conditions and the following disclaimer.
12 1.2 garbled * 2. Redistributions in binary form must reproduce the above copyright
13 1.2 garbled * notice, this list of conditions and the following disclaimer in the
14 1.2 garbled * documentation and/or other materials provided with the distribution.
15 1.2 garbled *
16 1.2 garbled * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS
17 1.2 garbled * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
18 1.2 garbled * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
19 1.2 garbled * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS
20 1.2 garbled * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
21 1.2 garbled * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
22 1.2 garbled * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
23 1.2 garbled * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
24 1.2 garbled * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
25 1.2 garbled * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
26 1.2 garbled * POSSIBILITY OF SUCH DAMAGE.
27 1.2 garbled */
28 1.2 garbled
29 1.2 garbled #include <sys/cdefs.h>
30 1.27 rin __KERNEL_RCSID(0, "$NetBSD: intr.c,v 1.27 2020/02/20 05:10:01 rin Exp $");
31 1.2 garbled
32 1.16 matt #include "opt_interrupt.h"
33 1.2 garbled #include "opt_multiprocessor.h"
34 1.16 matt #include "opt_pic.h"
35 1.2 garbled
36 1.12 macallan #define __INTR_PRIVATE
37 1.12 macallan
38 1.2 garbled #include <sys/param.h>
39 1.16 matt #include <sys/cpu.h>
40 1.16 matt #include <sys/kernel.h>
41 1.20 matt #include <sys/kmem.h>
42 1.25 nonaka #include <sys/interrupt.h>
43 1.2 garbled
44 1.16 matt #include <powerpc/psl.h>
45 1.16 matt #include <powerpc/pic/picvar.h>
46 1.16 matt
47 1.2 garbled #if defined(PIC_I8259) || defined (PIC_PREPIVR)
48 1.2 garbled #include <machine/isa_machdep.h>
49 1.2 garbled #endif
50 1.2 garbled
51 1.2 garbled #ifdef MULTIPROCESSOR
52 1.16 matt #include <powerpc/pic/ipivar.h>
53 1.2 garbled #endif
54 1.2 garbled
55 1.12 macallan #ifdef __HAVE_FAST_SOFTINTS
56 1.12 macallan #include <powerpc/softint.h>
57 1.12 macallan #endif
58 1.12 macallan
59 1.2 garbled #define MAX_PICS 8 /* 8 PICs ought to be enough for everyone */
60 1.2 garbled
61 1.15 matt #define PIC_VIRQ_LEGAL_P(x) ((u_int)(x) < NVIRQ)
62 1.2 garbled
63 1.27 rin #if defined(PPC_IBM4XX) && !defined(PPC_IBM440)
64 1.27 rin /* eieio is implemented as sync */
65 1.27 rin #define REORDER_PROTECT() __asm volatile("sync")
66 1.27 rin #else
67 1.27 rin #define REORDER_PROTECT() __asm volatile("sync; eieio")
68 1.27 rin #endif
69 1.27 rin
70 1.2 garbled struct pic_ops *pics[MAX_PICS];
71 1.2 garbled int num_pics = 0;
72 1.2 garbled int max_base = 0;
73 1.15 matt uint8_t virq_map[NIRQ];
74 1.15 matt imask_t virq_mask = HWIRQ_MASK;
75 1.8 kiyohara imask_t imask[NIPL];
76 1.2 garbled int primary_pic = 0;
77 1.2 garbled
78 1.2 garbled static int fakeintr(void *);
79 1.15 matt static int mapirq(int);
80 1.2 garbled static void intr_calculatemasks(void);
81 1.15 matt static struct pic_ops *find_pic_by_hwirq(int);
82 1.2 garbled
83 1.2 garbled static struct intr_source intrsources[NVIRQ];
84 1.2 garbled
85 1.2 garbled void
86 1.2 garbled pic_init(void)
87 1.2 garbled {
88 1.15 matt /* everything is in bss, no reason to zero it. */
89 1.2 garbled }
90 1.2 garbled
91 1.2 garbled int
92 1.2 garbled pic_add(struct pic_ops *pic)
93 1.2 garbled {
94 1.2 garbled
95 1.2 garbled if (num_pics >= MAX_PICS)
96 1.2 garbled return -1;
97 1.2 garbled
98 1.2 garbled pics[num_pics] = pic;
99 1.2 garbled pic->pic_intrbase = max_base;
100 1.2 garbled max_base += pic->pic_numintrs;
101 1.2 garbled num_pics++;
102 1.7 kiyohara
103 1.2 garbled return pic->pic_intrbase;
104 1.2 garbled }
105 1.2 garbled
106 1.2 garbled void
107 1.2 garbled pic_finish_setup(void)
108 1.2 garbled {
109 1.15 matt for (size_t i = 0; i < num_pics; i++) {
110 1.15 matt struct pic_ops * const pic = pics[i];
111 1.2 garbled if (pic->pic_finish_setup != NULL)
112 1.2 garbled pic->pic_finish_setup(pic);
113 1.2 garbled }
114 1.2 garbled }
115 1.2 garbled
116 1.2 garbled static struct pic_ops *
117 1.15 matt find_pic_by_hwirq(int hwirq)
118 1.2 garbled {
119 1.14 matt for (u_int base = 0; base < num_pics; base++) {
120 1.14 matt struct pic_ops * const pic = pics[base];
121 1.15 matt if (pic->pic_intrbase <= hwirq
122 1.15 matt && hwirq < pic->pic_intrbase + pic->pic_numintrs) {
123 1.14 matt return pic;
124 1.2 garbled }
125 1.2 garbled }
126 1.2 garbled return NULL;
127 1.2 garbled }
128 1.2 garbled
129 1.2 garbled static int
130 1.2 garbled fakeintr(void *arg)
131 1.2 garbled {
132 1.2 garbled
133 1.2 garbled return 0;
134 1.2 garbled }
135 1.2 garbled
136 1.2 garbled /*
137 1.2 garbled * Register an interrupt handler.
138 1.2 garbled */
139 1.2 garbled void *
140 1.14 matt intr_establish(int hwirq, int type, int ipl, int (*ih_fun)(void *),
141 1.2 garbled void *ih_arg)
142 1.2 garbled {
143 1.25 nonaka return intr_establish_xname(hwirq, type, ipl, ih_fun, ih_arg, NULL);
144 1.25 nonaka }
145 1.25 nonaka
146 1.25 nonaka void *
147 1.25 nonaka intr_establish_xname(int hwirq, int type, int ipl, int (*ih_fun)(void *),
148 1.25 nonaka void *ih_arg, const char *xname)
149 1.25 nonaka {
150 1.2 garbled struct intrhand **p, *q, *ih;
151 1.2 garbled struct pic_ops *pic;
152 1.2 garbled static struct intrhand fakehand;
153 1.15 matt int maxipl = ipl;
154 1.2 garbled
155 1.14 matt if (maxipl == IPL_NONE)
156 1.14 matt maxipl = IPL_HIGH;
157 1.2 garbled
158 1.2 garbled if (hwirq >= max_base) {
159 1.2 garbled panic("%s: bogus IRQ %d, max is %d", __func__, hwirq,
160 1.2 garbled max_base - 1);
161 1.2 garbled }
162 1.2 garbled
163 1.15 matt pic = find_pic_by_hwirq(hwirq);
164 1.2 garbled if (pic == NULL) {
165 1.2 garbled panic("%s: cannot find a pic for IRQ %d", __func__, hwirq);
166 1.2 garbled }
167 1.2 garbled
168 1.15 matt const int virq = mapirq(hwirq);
169 1.2 garbled
170 1.2 garbled /* no point in sleeping unless someone can free memory. */
171 1.20 matt ih = kmem_intr_alloc(sizeof(*ih), cold ? KM_NOSLEEP : KM_SLEEP);
172 1.2 garbled if (ih == NULL)
173 1.20 matt panic("intr_establish: can't allocate handler info");
174 1.2 garbled
175 1.15 matt if (!PIC_VIRQ_LEGAL_P(virq) || type == IST_NONE)
176 1.15 matt panic("intr_establish: bogus irq (%d) or type (%d)",
177 1.15 matt hwirq, type);
178 1.2 garbled
179 1.15 matt struct intr_source * const is = &intrsources[virq];
180 1.2 garbled
181 1.2 garbled switch (is->is_type) {
182 1.2 garbled case IST_NONE:
183 1.2 garbled is->is_type = type;
184 1.2 garbled break;
185 1.19 phx case IST_EDGE_FALLING:
186 1.19 phx case IST_EDGE_RISING:
187 1.19 phx case IST_LEVEL_LOW:
188 1.19 phx case IST_LEVEL_HIGH:
189 1.2 garbled if (type == is->is_type)
190 1.2 garbled break;
191 1.15 matt /* FALLTHROUGH */
192 1.2 garbled case IST_PULSE:
193 1.2 garbled if (type != IST_NONE)
194 1.2 garbled panic("intr_establish: can't share %s with %s",
195 1.2 garbled intr_typename(is->is_type),
196 1.2 garbled intr_typename(type));
197 1.2 garbled break;
198 1.2 garbled }
199 1.2 garbled if (is->is_hand == NULL) {
200 1.2 garbled snprintf(is->is_source, sizeof(is->is_source), "irq %d",
201 1.2 garbled is->is_hwirq);
202 1.2 garbled evcnt_attach_dynamic(&is->is_ev, EVCNT_TYPE_INTR, NULL,
203 1.2 garbled pic->pic_name, is->is_source);
204 1.2 garbled }
205 1.2 garbled
206 1.2 garbled /*
207 1.2 garbled * Figure out where to put the handler.
208 1.2 garbled * This is O(N^2), but we want to preserve the order, and N is
209 1.2 garbled * generally small.
210 1.2 garbled */
211 1.2 garbled for (p = &is->is_hand; (q = *p) != NULL; p = &q->ih_next) {
212 1.26 riastrad maxipl = uimax(maxipl, q->ih_ipl);
213 1.2 garbled }
214 1.2 garbled
215 1.2 garbled /*
216 1.2 garbled * Actually install a fake handler momentarily, since we might be doing
217 1.2 garbled * this with interrupts enabled and don't want the real routine called
218 1.2 garbled * until masking is set up.
219 1.2 garbled */
220 1.14 matt fakehand.ih_ipl = ipl;
221 1.2 garbled fakehand.ih_fun = fakeintr;
222 1.2 garbled *p = &fakehand;
223 1.2 garbled
224 1.2 garbled /*
225 1.2 garbled * Poke the real handler in now.
226 1.2 garbled */
227 1.2 garbled ih->ih_fun = ih_fun;
228 1.2 garbled ih->ih_arg = ih_arg;
229 1.2 garbled ih->ih_next = NULL;
230 1.14 matt ih->ih_ipl = ipl;
231 1.15 matt ih->ih_virq = virq;
232 1.25 nonaka strlcpy(ih->ih_xname, xname != NULL ? xname : "unknown",
233 1.25 nonaka sizeof(ih->ih_xname));
234 1.2 garbled *p = ih;
235 1.2 garbled
236 1.2 garbled if (pic->pic_establish_irq != NULL)
237 1.2 garbled pic->pic_establish_irq(pic, hwirq - pic->pic_intrbase,
238 1.14 matt is->is_type, maxipl);
239 1.14 matt
240 1.14 matt /*
241 1.14 matt * Remember the highest IPL used by this handler.
242 1.14 matt */
243 1.14 matt is->is_ipl = maxipl;
244 1.2 garbled
245 1.2 garbled /*
246 1.2 garbled * now that the handler is established we're actually ready to
247 1.2 garbled * calculate the masks
248 1.2 garbled */
249 1.2 garbled intr_calculatemasks();
250 1.2 garbled
251 1.2 garbled return ih;
252 1.2 garbled }
253 1.2 garbled
254 1.2 garbled void
255 1.2 garbled dummy_pic_establish_intr(struct pic_ops *pic, int irq, int type, int pri)
256 1.2 garbled {
257 1.2 garbled }
258 1.2 garbled
259 1.2 garbled /*
260 1.2 garbled * Deregister an interrupt handler.
261 1.2 garbled */
262 1.2 garbled void
263 1.2 garbled intr_disestablish(void *arg)
264 1.2 garbled {
265 1.14 matt struct intrhand * const ih = arg;
266 1.15 matt const int virq = ih->ih_virq;
267 1.15 matt struct intr_source * const is = &intrsources[virq];
268 1.14 matt struct intrhand **p, **q;
269 1.14 matt int maxipl = IPL_NONE;
270 1.2 garbled
271 1.15 matt if (!PIC_VIRQ_LEGAL_P(virq))
272 1.15 matt panic("intr_disestablish: bogus virq %d", virq);
273 1.2 garbled
274 1.2 garbled /*
275 1.2 garbled * Remove the handler from the chain.
276 1.2 garbled * This is O(n^2), too.
277 1.2 garbled */
278 1.14 matt for (p = &is->is_hand, q = NULL; (*p) != NULL; p = &(*p)->ih_next) {
279 1.14 matt struct intrhand * const tmp_ih = *p;
280 1.14 matt if (tmp_ih == ih) {
281 1.14 matt q = p;
282 1.14 matt } else {
283 1.26 riastrad maxipl = uimax(maxipl, tmp_ih->ih_ipl);
284 1.14 matt }
285 1.14 matt }
286 1.2 garbled if (q)
287 1.14 matt *q = ih->ih_next;
288 1.2 garbled else
289 1.2 garbled panic("intr_disestablish: handler not registered");
290 1.20 matt kmem_intr_free((void *)ih, sizeof(*ih));
291 1.2 garbled
292 1.14 matt /*
293 1.14 matt * Reset the IPL for this source now that we've removed a handler.
294 1.14 matt */
295 1.14 matt is->is_ipl = maxipl;
296 1.14 matt
297 1.2 garbled intr_calculatemasks();
298 1.2 garbled
299 1.2 garbled if (is->is_hand == NULL) {
300 1.2 garbled is->is_type = IST_NONE;
301 1.2 garbled evcnt_detach(&is->is_ev);
302 1.15 matt /*
303 1.15 matt * Make the virutal IRQ available again.
304 1.15 matt */
305 1.15 matt virq_map[virq] = 0;
306 1.15 matt virq_mask |= PIC_VIRQ_TO_MASK(virq);
307 1.2 garbled }
308 1.2 garbled }
309 1.2 garbled
310 1.2 garbled /*
311 1.2 garbled * Map max_base irqs into 32 (bits).
312 1.2 garbled */
313 1.2 garbled static int
314 1.15 matt mapirq(int hwirq)
315 1.2 garbled {
316 1.2 garbled struct pic_ops *pic;
317 1.2 garbled
318 1.15 matt if (hwirq >= max_base)
319 1.15 matt panic("invalid irq %d", hwirq);
320 1.2 garbled
321 1.15 matt if ((pic = find_pic_by_hwirq(hwirq)) == NULL)
322 1.15 matt panic("%s: cannot find PIC for HWIRQ %d", __func__, hwirq);
323 1.2 garbled
324 1.15 matt if (virq_map[hwirq])
325 1.15 matt return virq_map[hwirq];
326 1.2 garbled
327 1.15 matt if (virq_mask == 0)
328 1.2 garbled panic("virq overflow");
329 1.2 garbled
330 1.15 matt const int virq = PIC_VIRQ_MS_PENDING(virq_mask);
331 1.15 matt struct intr_source * const is = intrsources + virq;
332 1.15 matt
333 1.15 matt virq_mask &= ~PIC_VIRQ_TO_MASK(virq);
334 1.15 matt
335 1.15 matt is->is_hwirq = hwirq;
336 1.15 matt is->is_pic = pic;
337 1.15 matt virq_map[hwirq] = virq;
338 1.2 garbled #ifdef PIC_DEBUG
339 1.17 rjs printf("mapping hwirq %d to virq %d\n", hwirq, virq);
340 1.2 garbled #endif
341 1.15 matt return virq;
342 1.2 garbled }
343 1.2 garbled
344 1.2 garbled static const char * const intr_typenames[] = {
345 1.2 garbled [IST_NONE] = "none",
346 1.2 garbled [IST_PULSE] = "pulsed",
347 1.19 phx [IST_EDGE_FALLING] = "falling edge triggered",
348 1.19 phx [IST_EDGE_RISING] = "rising edge triggered",
349 1.19 phx [IST_LEVEL_LOW] = "low level triggered",
350 1.19 phx [IST_LEVEL_HIGH] = "high level triggered",
351 1.2 garbled };
352 1.2 garbled
353 1.2 garbled const char *
354 1.2 garbled intr_typename(int type)
355 1.2 garbled {
356 1.2 garbled KASSERT((unsigned int) type < __arraycount(intr_typenames));
357 1.2 garbled KASSERT(intr_typenames[type] != NULL);
358 1.2 garbled return intr_typenames[type];
359 1.2 garbled }
360 1.2 garbled
361 1.2 garbled /*
362 1.2 garbled * Recalculate the interrupt masks from scratch.
363 1.2 garbled * We could code special registry and deregistry versions of this function that
364 1.2 garbled * would be faster, but the code would be nastier, and we don't expect this to
365 1.2 garbled * happen very much anyway.
366 1.2 garbled */
367 1.2 garbled static void
368 1.2 garbled intr_calculatemasks(void)
369 1.2 garbled {
370 1.23 macallan imask_t newmask[NIPL];
371 1.2 garbled struct intr_source *is;
372 1.23 macallan struct intrhand *ih;
373 1.14 matt int irq;
374 1.2 garbled
375 1.14 matt for (u_int ipl = IPL_NONE; ipl < NIPL; ipl++) {
376 1.14 matt newmask[ipl] = 0;
377 1.2 garbled }
378 1.2 garbled
379 1.14 matt /* First, figure out which ipl each IRQ uses. */
380 1.14 matt for (irq = 0, is = intrsources; irq < NVIRQ; irq++, is++) {
381 1.23 macallan for (ih = is->is_hand; ih != NULL; ih = ih->ih_next) {
382 1.23 macallan newmask[ih->ih_ipl] |= PIC_VIRQ_TO_MASK(irq);
383 1.23 macallan }
384 1.2 garbled }
385 1.2 garbled
386 1.2 garbled /*
387 1.2 garbled * IPL_NONE is used for hardware interrupts that are never blocked,
388 1.2 garbled * and do not block anything else.
389 1.2 garbled */
390 1.14 matt newmask[IPL_NONE] = 0;
391 1.2 garbled
392 1.2 garbled /*
393 1.2 garbled * strict hierarchy - all IPLs block everything blocked by any lower
394 1.2 garbled * IPL
395 1.2 garbled */
396 1.14 matt for (u_int ipl = 1; ipl < NIPL; ipl++) {
397 1.14 matt newmask[ipl] |= newmask[ipl - 1];
398 1.14 matt }
399 1.2 garbled
400 1.23 macallan #ifdef PIC_DEBUG
401 1.14 matt for (u_int ipl = 0; ipl < NIPL; ipl++) {
402 1.14 matt printf("%u: %08x -> %08x\n", ipl, imask[ipl], newmask[ipl]);
403 1.2 garbled }
404 1.2 garbled #endif
405 1.2 garbled
406 1.14 matt /*
407 1.14 matt * Disable all interrupts.
408 1.14 matt */
409 1.14 matt for (u_int base = 0; base < num_pics; base++) {
410 1.14 matt struct pic_ops * const pic = pics[base];
411 1.14 matt for (u_int i = 0; i < pic->pic_numintrs; i++) {
412 1.14 matt pic->pic_disable_irq(pic, i);
413 1.14 matt }
414 1.2 garbled }
415 1.2 garbled
416 1.14 matt /*
417 1.14 matt * Now that all interrupts are disabled, update the ipl masks.
418 1.14 matt */
419 1.14 matt for (u_int ipl = 0; ipl < NIPL; ipl++) {
420 1.14 matt imask[ipl] = newmask[ipl];
421 1.2 garbled }
422 1.7 kiyohara
423 1.14 matt /*
424 1.14 matt * Lastly, enable IRQs actually in use.
425 1.14 matt */
426 1.2 garbled for (irq = 0, is = intrsources; irq < NVIRQ; irq++, is++) {
427 1.2 garbled if (is->is_hand)
428 1.2 garbled pic_enable_irq(is->is_hwirq);
429 1.2 garbled }
430 1.2 garbled }
431 1.2 garbled
432 1.2 garbled void
433 1.15 matt pic_enable_irq(int hwirq)
434 1.2 garbled {
435 1.15 matt struct pic_ops * const pic = find_pic_by_hwirq(hwirq);
436 1.15 matt if (pic == NULL)
437 1.15 matt panic("%s: bogus IRQ %d", __func__, hwirq);
438 1.15 matt const int type = intrsources[virq_map[hwirq]].is_type;
439 1.15 matt (*pic->pic_enable_irq)(pic, hwirq - pic->pic_intrbase, type);
440 1.2 garbled }
441 1.2 garbled
442 1.2 garbled void
443 1.15 matt pic_mark_pending(int hwirq)
444 1.2 garbled {
445 1.2 garbled struct cpu_info * const ci = curcpu();
446 1.2 garbled
447 1.15 matt const int virq = virq_map[hwirq];
448 1.15 matt if (virq == 0)
449 1.15 matt printf("IRQ %d maps to 0\n", hwirq);
450 1.2 garbled
451 1.15 matt const register_t msr = mfmsr();
452 1.2 garbled mtmsr(msr & ~PSL_EE);
453 1.15 matt ci->ci_ipending |= PIC_VIRQ_TO_MASK(virq);
454 1.2 garbled mtmsr(msr);
455 1.7 kiyohara }
456 1.2 garbled
457 1.15 matt static void
458 1.15 matt intr_deliver(struct intr_source *is, int virq)
459 1.15 matt {
460 1.15 matt bool locked = false;
461 1.15 matt for (struct intrhand *ih = is->is_hand; ih != NULL; ih = ih->ih_next) {
462 1.15 matt KASSERTMSG(ih->ih_fun != NULL,
463 1.18 jym "%s: irq %d, hwirq %d, is %p ih %p: "
464 1.15 matt "NULL interrupt handler!\n", __func__,
465 1.18 jym virq, is->is_hwirq, is, ih);
466 1.15 matt if (ih->ih_ipl == IPL_VM) {
467 1.15 matt if (!locked) {
468 1.15 matt KERNEL_LOCK(1, NULL);
469 1.15 matt locked = true;
470 1.15 matt }
471 1.15 matt } else if (locked) {
472 1.15 matt KERNEL_UNLOCK_ONE(NULL);
473 1.15 matt locked = false;
474 1.15 matt }
475 1.15 matt (*ih->ih_fun)(ih->ih_arg);
476 1.15 matt }
477 1.15 matt if (locked) {
478 1.15 matt KERNEL_UNLOCK_ONE(NULL);
479 1.15 matt }
480 1.15 matt is->is_ev.ev_count++;
481 1.15 matt }
482 1.15 matt
483 1.2 garbled void
484 1.2 garbled pic_do_pending_int(void)
485 1.2 garbled {
486 1.2 garbled struct cpu_info * const ci = curcpu();
487 1.15 matt imask_t vpend;
488 1.2 garbled
489 1.2 garbled if (ci->ci_iactive)
490 1.2 garbled return;
491 1.2 garbled
492 1.2 garbled ci->ci_iactive = 1;
493 1.15 matt
494 1.15 matt const register_t emsr = mfmsr();
495 1.15 matt const register_t dmsr = emsr & ~PSL_EE;
496 1.15 matt
497 1.2 garbled KASSERT(emsr & PSL_EE);
498 1.2 garbled mtmsr(dmsr);
499 1.2 garbled
500 1.15 matt const int pcpl = ci->ci_cpl;
501 1.3 ad #ifdef __HAVE_FAST_SOFTINTS
502 1.2 garbled again:
503 1.3 ad #endif
504 1.2 garbled
505 1.2 garbled /* Do now unmasked pendings */
506 1.15 matt while ((vpend = (ci->ci_ipending & ~imask[pcpl])) != 0) {
507 1.14 matt ci->ci_idepth++;
508 1.15 matt KASSERT((PIC_VIRQ_TO_MASK(0) & ci->ci_ipending) == 0);
509 1.15 matt
510 1.8 kiyohara /* Get most significant pending bit */
511 1.15 matt const int virq = PIC_VIRQ_MS_PENDING(vpend);
512 1.15 matt ci->ci_ipending &= ~PIC_VIRQ_TO_MASK(virq);
513 1.15 matt
514 1.15 matt struct intr_source * const is = &intrsources[virq];
515 1.15 matt struct pic_ops * const pic = is->is_pic;
516 1.2 garbled
517 1.14 matt splraise(is->is_ipl);
518 1.2 garbled mtmsr(emsr);
519 1.15 matt intr_deliver(is, virq);
520 1.2 garbled mtmsr(dmsr);
521 1.15 matt ci->ci_cpl = pcpl; /* Don't use splx... we are here already! */
522 1.2 garbled
523 1.2 garbled pic->pic_reenable_irq(pic, is->is_hwirq - pic->pic_intrbase,
524 1.2 garbled is->is_type);
525 1.14 matt ci->ci_idepth--;
526 1.2 garbled }
527 1.2 garbled
528 1.3 ad #ifdef __HAVE_FAST_SOFTINTS
529 1.21 macallan const u_int softints = ci->ci_data.cpu_softints &
530 1.21 macallan (IPL_SOFTMASK << pcpl);
531 1.21 macallan
532 1.21 macallan /* make sure there are no bits to screw with the line above */
533 1.21 macallan KASSERT((ci->ci_data.cpu_softints & ~IPL_SOFTMASK) == 0);
534 1.12 macallan
535 1.12 macallan if (__predict_false(softints != 0)) {
536 1.15 matt ci->ci_cpl = IPL_HIGH;
537 1.15 matt mtmsr(emsr);
538 1.12 macallan powerpc_softint(ci, pcpl,
539 1.12 macallan (vaddr_t)__builtin_return_address(0));
540 1.15 matt mtmsr(dmsr);
541 1.12 macallan ci->ci_cpl = pcpl;
542 1.15 matt if (__predict_false(ci->ci_ipending & ~imask[pcpl]))
543 1.15 matt goto again;
544 1.12 macallan }
545 1.12 macallan #endif
546 1.2 garbled
547 1.2 garbled ci->ci_iactive = 0;
548 1.2 garbled mtmsr(emsr);
549 1.2 garbled }
550 1.2 garbled
551 1.2 garbled int
552 1.2 garbled pic_handle_intr(void *cookie)
553 1.2 garbled {
554 1.2 garbled struct pic_ops *pic = cookie;
555 1.2 garbled struct cpu_info *ci = curcpu();
556 1.15 matt int picirq;
557 1.2 garbled
558 1.15 matt picirq = pic->pic_get_irq(pic, PIC_GET_IRQ);
559 1.15 matt if (picirq == 255)
560 1.2 garbled return 0;
561 1.2 garbled
562 1.15 matt const register_t msr = mfmsr();
563 1.15 matt const int pcpl = ci->ci_cpl;
564 1.2 garbled
565 1.15 matt do {
566 1.24 macallan const int virq = virq_map[picirq + pic->pic_intrbase];
567 1.2 garbled
568 1.15 matt KASSERT(virq != 0);
569 1.15 matt KASSERT(picirq < pic->pic_numintrs);
570 1.15 matt imask_t v_imen = PIC_VIRQ_TO_MASK(virq);
571 1.15 matt struct intr_source * const is = &intrsources[virq];
572 1.15 matt
573 1.15 matt if ((imask[pcpl] & v_imen) != 0) {
574 1.15 matt ci->ci_ipending |= v_imen; /* Masked! Mark this as pending */
575 1.15 matt pic->pic_disable_irq(pic, picirq);
576 1.15 matt } else {
577 1.15 matt /* this interrupt is no longer pending */
578 1.15 matt ci->ci_ipending &= ~v_imen;
579 1.15 matt ci->ci_idepth++;
580 1.15 matt
581 1.15 matt splraise(is->is_ipl);
582 1.15 matt mtmsr(msr | PSL_EE);
583 1.15 matt intr_deliver(is, virq);
584 1.15 matt mtmsr(msr);
585 1.15 matt ci->ci_cpl = pcpl;
586 1.7 kiyohara
587 1.15 matt ci->ci_data.cpu_nintr++;
588 1.15 matt ci->ci_idepth--;
589 1.2 garbled }
590 1.15 matt pic->pic_ack_irq(pic, picirq);
591 1.15 matt } while ((picirq = pic->pic_get_irq(pic, PIC_GET_RECHECK)) != 255);
592 1.2 garbled
593 1.2 garbled mtmsr(msr | PSL_EE);
594 1.2 garbled splx(pcpl); /* Process pendings. */
595 1.2 garbled mtmsr(msr);
596 1.2 garbled
597 1.2 garbled return 0;
598 1.2 garbled }
599 1.2 garbled
600 1.2 garbled void
601 1.2 garbled pic_ext_intr(void)
602 1.2 garbled {
603 1.2 garbled
604 1.2 garbled KASSERT(pics[primary_pic] != NULL);
605 1.2 garbled pic_handle_intr(pics[primary_pic]);
606 1.2 garbled
607 1.2 garbled return;
608 1.2 garbled
609 1.2 garbled }
610 1.2 garbled
611 1.2 garbled int
612 1.2 garbled splraise(int ncpl)
613 1.2 garbled {
614 1.2 garbled struct cpu_info *ci = curcpu();
615 1.2 garbled int ocpl;
616 1.2 garbled
617 1.12 macallan if (ncpl == ci->ci_cpl) return ncpl;
618 1.27 rin REORDER_PROTECT();
619 1.2 garbled ocpl = ci->ci_cpl;
620 1.12 macallan KASSERT(ncpl < NIPL);
621 1.26 riastrad ci->ci_cpl = uimax(ncpl, ocpl);
622 1.27 rin REORDER_PROTECT();
623 1.12 macallan __insn_barrier();
624 1.2 garbled return ocpl;
625 1.2 garbled }
626 1.2 garbled
627 1.13 matt static inline bool
628 1.13 matt have_pending_intr_p(struct cpu_info *ci, int ncpl)
629 1.13 matt {
630 1.13 matt if (ci->ci_ipending & ~imask[ncpl])
631 1.13 matt return true;
632 1.13 matt #ifdef __HAVE_FAST_SOFTINTS
633 1.22 macallan if (ci->ci_data.cpu_softints & (IPL_SOFTMASK << ncpl))
634 1.13 matt return true;
635 1.13 matt #endif
636 1.13 matt return false;
637 1.13 matt }
638 1.13 matt
639 1.2 garbled void
640 1.2 garbled splx(int ncpl)
641 1.2 garbled {
642 1.2 garbled struct cpu_info *ci = curcpu();
643 1.7 kiyohara
644 1.12 macallan __insn_barrier();
645 1.27 rin REORDER_PROTECT();
646 1.2 garbled ci->ci_cpl = ncpl;
647 1.13 matt if (have_pending_intr_p(ci, ncpl))
648 1.2 garbled pic_do_pending_int();
649 1.13 matt
650 1.27 rin REORDER_PROTECT();
651 1.2 garbled }
652 1.2 garbled
653 1.2 garbled int
654 1.2 garbled spllower(int ncpl)
655 1.2 garbled {
656 1.2 garbled struct cpu_info *ci = curcpu();
657 1.2 garbled int ocpl;
658 1.2 garbled
659 1.12 macallan __insn_barrier();
660 1.27 rin REORDER_PROTECT();
661 1.2 garbled ocpl = ci->ci_cpl;
662 1.2 garbled ci->ci_cpl = ncpl;
663 1.13 matt if (have_pending_intr_p(ci, ncpl))
664 1.2 garbled pic_do_pending_int();
665 1.27 rin REORDER_PROTECT();
666 1.2 garbled return ocpl;
667 1.2 garbled }
668 1.2 garbled
669 1.2 garbled void
670 1.2 garbled genppc_cpu_configure(void)
671 1.2 garbled {
672 1.23 macallan aprint_normal("vmmask %x schedmask %x highmask %x\n",
673 1.23 macallan (u_int)imask[IPL_VM] & 0x7fffffff,
674 1.23 macallan (u_int)imask[IPL_SCHED] & 0x7fffffff,
675 1.23 macallan (u_int)imask[IPL_HIGH] & 0x7fffffff);
676 1.2 garbled
677 1.2 garbled spl0();
678 1.2 garbled }
679 1.2 garbled
680 1.2 garbled #if defined(PIC_PREPIVR) || defined(PIC_I8259)
681 1.2 garbled /*
682 1.2 garbled * isa_intr_alloc needs to be done here, because it needs direct access to
683 1.2 garbled * the various interrupt handler structures.
684 1.2 garbled */
685 1.2 garbled
686 1.2 garbled int
687 1.2 garbled genppc_isa_intr_alloc(isa_chipset_tag_t ic, struct pic_ops *pic,
688 1.2 garbled int mask, int type, int *irq_p)
689 1.2 garbled {
690 1.2 garbled int irq, vi;
691 1.2 garbled int maybe_irq = -1;
692 1.2 garbled int shared_depth = 0;
693 1.2 garbled struct intr_source *is;
694 1.2 garbled
695 1.2 garbled if (pic == NULL)
696 1.2 garbled return 1;
697 1.2 garbled
698 1.2 garbled for (irq = 0; (mask != 0 && irq < pic->pic_numintrs);
699 1.2 garbled mask >>= 1, irq++) {
700 1.2 garbled if ((mask & 1) == 0)
701 1.2 garbled continue;
702 1.15 matt vi = virq_map[irq + pic->pic_intrbase];
703 1.2 garbled if (!vi) {
704 1.2 garbled *irq_p = irq;
705 1.2 garbled return 0;
706 1.2 garbled }
707 1.2 garbled is = &intrsources[vi];
708 1.2 garbled if (is->is_type == IST_NONE) {
709 1.2 garbled *irq_p = irq;
710 1.2 garbled return 0;
711 1.2 garbled }
712 1.2 garbled /* Level interrupts can be shared */
713 1.2 garbled if (type == IST_LEVEL && is->is_type == IST_LEVEL) {
714 1.2 garbled struct intrhand *ih = is->is_hand;
715 1.2 garbled int depth;
716 1.2 garbled
717 1.2 garbled if (maybe_irq == -1) {
718 1.2 garbled maybe_irq = irq;
719 1.2 garbled continue;
720 1.2 garbled }
721 1.2 garbled for (depth = 0; ih != NULL; ih = ih->ih_next)
722 1.2 garbled depth++;
723 1.2 garbled if (depth < shared_depth) {
724 1.2 garbled maybe_irq = irq;
725 1.2 garbled shared_depth = depth;
726 1.2 garbled }
727 1.2 garbled }
728 1.2 garbled }
729 1.2 garbled if (maybe_irq != -1) {
730 1.2 garbled *irq_p = maybe_irq;
731 1.2 garbled return 0;
732 1.2 garbled }
733 1.2 garbled return 1;
734 1.2 garbled }
735 1.2 garbled #endif
736 1.25 nonaka
737 1.25 nonaka static struct intr_source *
738 1.25 nonaka intr_get_source(const char *intrid)
739 1.25 nonaka {
740 1.25 nonaka struct intr_source *is;
741 1.25 nonaka int irq;
742 1.25 nonaka
743 1.25 nonaka for (irq = 0, is = intrsources; irq < NVIRQ; irq++, is++) {
744 1.25 nonaka if (strcmp(intrid, is->is_source) == 0)
745 1.25 nonaka return is;
746 1.25 nonaka }
747 1.25 nonaka return NULL;
748 1.25 nonaka }
749 1.25 nonaka
750 1.25 nonaka static struct intrhand *
751 1.25 nonaka intr_get_handler(const char *intrid)
752 1.25 nonaka {
753 1.25 nonaka struct intr_source *is;
754 1.25 nonaka
755 1.25 nonaka is = intr_get_source(intrid);
756 1.25 nonaka if (is != NULL)
757 1.25 nonaka return is->is_hand;
758 1.25 nonaka return NULL;
759 1.25 nonaka }
760 1.25 nonaka
761 1.25 nonaka uint64_t
762 1.25 nonaka interrupt_get_count(const char *intrid, u_int cpu_idx)
763 1.25 nonaka {
764 1.25 nonaka struct intr_source *is;
765 1.25 nonaka
766 1.25 nonaka /* XXX interrupt is always generated by CPU 0 */
767 1.25 nonaka if (cpu_idx != 0)
768 1.25 nonaka return 0;
769 1.25 nonaka
770 1.25 nonaka is = intr_get_source(intrid);
771 1.25 nonaka if (is != NULL)
772 1.25 nonaka return is->is_ev.ev_count;
773 1.25 nonaka return 0;
774 1.25 nonaka }
775 1.25 nonaka
776 1.25 nonaka void
777 1.25 nonaka interrupt_get_assigned(const char *intrid, kcpuset_t *cpuset)
778 1.25 nonaka {
779 1.25 nonaka struct intr_source *is;
780 1.25 nonaka
781 1.25 nonaka kcpuset_zero(cpuset);
782 1.25 nonaka
783 1.25 nonaka is = intr_get_source(intrid);
784 1.25 nonaka if (is != NULL)
785 1.25 nonaka kcpuset_set(cpuset, 0); /* XXX */
786 1.25 nonaka }
787 1.25 nonaka
788 1.25 nonaka void
789 1.25 nonaka interrupt_get_available(kcpuset_t *cpuset)
790 1.25 nonaka {
791 1.25 nonaka CPU_INFO_ITERATOR cii;
792 1.25 nonaka struct cpu_info *ci;
793 1.25 nonaka
794 1.25 nonaka kcpuset_zero(cpuset);
795 1.25 nonaka
796 1.25 nonaka mutex_enter(&cpu_lock);
797 1.25 nonaka for (CPU_INFO_FOREACH(cii, ci)) {
798 1.25 nonaka if ((ci->ci_schedstate.spc_flags & SPCF_NOINTR) == 0)
799 1.25 nonaka kcpuset_set(cpuset, cpu_index(ci));
800 1.25 nonaka }
801 1.25 nonaka mutex_exit(&cpu_lock);
802 1.25 nonaka }
803 1.25 nonaka
804 1.25 nonaka void
805 1.25 nonaka interrupt_get_devname(const char *intrid, char *buf, size_t len)
806 1.25 nonaka {
807 1.25 nonaka struct intrhand *ih;
808 1.25 nonaka
809 1.25 nonaka if (len == 0)
810 1.25 nonaka return;
811 1.25 nonaka
812 1.25 nonaka buf[0] = '\0';
813 1.25 nonaka
814 1.25 nonaka for (ih = intr_get_handler(intrid); ih != NULL; ih = ih->ih_next) {
815 1.25 nonaka if (buf[0] != '\0')
816 1.25 nonaka strlcat(buf, ", ", len);
817 1.25 nonaka strlcat(buf, ih->ih_xname, len);
818 1.25 nonaka }
819 1.25 nonaka }
820 1.25 nonaka
821 1.25 nonaka struct intrids_handler *
822 1.25 nonaka interrupt_construct_intrids(const kcpuset_t *cpuset)
823 1.25 nonaka {
824 1.25 nonaka struct intr_source *is;
825 1.25 nonaka struct intrids_handler *ii_handler;
826 1.25 nonaka intrid_t *ids;
827 1.25 nonaka int i, irq, count;
828 1.25 nonaka
829 1.25 nonaka if (kcpuset_iszero(cpuset))
830 1.25 nonaka return NULL;
831 1.25 nonaka if (!kcpuset_isset(cpuset, 0)) /* XXX */
832 1.25 nonaka return NULL;
833 1.25 nonaka
834 1.25 nonaka count = 0;
835 1.25 nonaka for (irq = 0, is = intrsources; irq < NVIRQ; irq++, is++) {
836 1.25 nonaka if (is->is_hand != NULL)
837 1.25 nonaka count++;
838 1.25 nonaka }
839 1.25 nonaka
840 1.25 nonaka ii_handler = kmem_zalloc(sizeof(int) + sizeof(intrid_t) * count,
841 1.25 nonaka KM_SLEEP);
842 1.25 nonaka if (ii_handler == NULL)
843 1.25 nonaka return NULL;
844 1.25 nonaka ii_handler->iih_nids = count;
845 1.25 nonaka if (count == 0)
846 1.25 nonaka return ii_handler;
847 1.25 nonaka
848 1.25 nonaka ids = ii_handler->iih_intrids;
849 1.25 nonaka i = 0;
850 1.25 nonaka for (irq = 0, is = intrsources; irq < NVIRQ; irq++, is++) {
851 1.25 nonaka /* Ignore devices attached after counting "count". */
852 1.25 nonaka if (i >= count)
853 1.25 nonaka break;
854 1.25 nonaka
855 1.25 nonaka if (is->is_hand == NULL)
856 1.25 nonaka continue;
857 1.25 nonaka
858 1.25 nonaka strncpy(ids[i], is->is_source, sizeof(intrid_t));
859 1.25 nonaka i++;
860 1.25 nonaka }
861 1.25 nonaka
862 1.25 nonaka return ii_handler;
863 1.25 nonaka }
864 1.25 nonaka
865 1.25 nonaka void
866 1.25 nonaka interrupt_destruct_intrids(struct intrids_handler *ii_handler)
867 1.25 nonaka {
868 1.25 nonaka size_t iih_size;
869 1.25 nonaka
870 1.25 nonaka if (ii_handler == NULL)
871 1.25 nonaka return;
872 1.25 nonaka
873 1.25 nonaka iih_size = sizeof(int) + sizeof(intrid_t) * ii_handler->iih_nids;
874 1.25 nonaka kmem_free(ii_handler, iih_size);
875 1.25 nonaka }
876 1.25 nonaka
877 1.25 nonaka int
878 1.25 nonaka interrupt_distribute(void *ich, const kcpuset_t *newset, kcpuset_t *oldset)
879 1.25 nonaka {
880 1.25 nonaka return EOPNOTSUPP;
881 1.25 nonaka }
882 1.25 nonaka
883 1.25 nonaka int
884 1.25 nonaka interrupt_distribute_handler(const char *intrid, const kcpuset_t *newset,
885 1.25 nonaka kcpuset_t *oldset)
886 1.25 nonaka {
887 1.25 nonaka return EOPNOTSUPP;
888 1.25 nonaka }
889 1.27 rin
890 1.27 rin #undef REORDER_PROTECT
891