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