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