isabus.c revision 1.18 1 1.18 tsutsui /* $NetBSD: isabus.c,v 1.18 2003/01/19 10:06:14 tsutsui Exp $ */
2 1.6 soda /* $OpenBSD: isabus.c,v 1.15 1998/03/16 09:38:46 pefo Exp $ */
3 1.5 soda /* NetBSD: isa.c,v 1.33 1995/06/28 04:30:51 cgd Exp */
4 1.1 jonathan
5 1.1 jonathan /*-
6 1.1 jonathan * Copyright (c) 1995 Per Fogelstrom
7 1.3 mycroft * Copyright (c) 1993, 1994 Charles M. Hannum.
8 1.1 jonathan * Copyright (c) 1990 The Regents of the University of California.
9 1.1 jonathan * All rights reserved.
10 1.1 jonathan *
11 1.1 jonathan * This code is derived from software contributed to Berkeley by
12 1.1 jonathan * William Jolitz and Don Ahn.
13 1.1 jonathan *
14 1.1 jonathan * Redistribution and use in source and binary forms, with or without
15 1.1 jonathan * modification, are permitted provided that the following conditions
16 1.1 jonathan * are met:
17 1.1 jonathan * 1. Redistributions of source code must retain the above copyright
18 1.1 jonathan * notice, this list of conditions and the following disclaimer.
19 1.1 jonathan * 2. Redistributions in binary form must reproduce the above copyright
20 1.1 jonathan * notice, this list of conditions and the following disclaimer in the
21 1.1 jonathan * documentation and/or other materials provided with the distribution.
22 1.1 jonathan * 3. All advertising materials mentioning features or use of this software
23 1.1 jonathan * must display the following acknowledgement:
24 1.1 jonathan * This product includes software developed by the University of
25 1.1 jonathan * California, Berkeley and its contributors.
26 1.1 jonathan * 4. Neither the name of the University nor the names of its contributors
27 1.1 jonathan * may be used to endorse or promote products derived from this software
28 1.1 jonathan * without specific prior written permission.
29 1.1 jonathan *
30 1.1 jonathan * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
31 1.1 jonathan * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
32 1.1 jonathan * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
33 1.1 jonathan * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
34 1.1 jonathan * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
35 1.1 jonathan * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
36 1.1 jonathan * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
37 1.1 jonathan * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
38 1.1 jonathan * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
39 1.1 jonathan * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
40 1.1 jonathan * SUCH DAMAGE.
41 1.1 jonathan *
42 1.1 jonathan * @(#)isa.c 7.2 (Berkeley) 5/12/91
43 1.1 jonathan */
44 1.1 jonathan /*
45 1.1 jonathan * Mach Operating System
46 1.1 jonathan * Copyright (c) 1991,1990,1989 Carnegie Mellon University
47 1.1 jonathan * All Rights Reserved.
48 1.1 jonathan *
49 1.1 jonathan * Permission to use, copy, modify and distribute this software and its
50 1.1 jonathan * documentation is hereby granted, provided that both the copyright
51 1.1 jonathan * notice and this permission notice appear in all copies of the
52 1.1 jonathan * software, derivative works or modified versions, and any portions
53 1.1 jonathan * thereof, and that both notices appear in supporting documentation.
54 1.1 jonathan *
55 1.1 jonathan * CARNEGIE MELLON ALLOWS FREE USE OF THIS SOFTWARE IN ITS "AS IS"
56 1.1 jonathan * CONDITION. CARNEGIE MELLON DISCLAIMS ANY LIABILITY OF ANY KIND FOR
57 1.1 jonathan * ANY DAMAGES WHATSOEVER RESULTING FROM THE USE OF THIS SOFTWARE.
58 1.1 jonathan *
59 1.1 jonathan * Carnegie Mellon requests users of this software to return to
60 1.1 jonathan *
61 1.1 jonathan * Software Distribution Coordinator or Software.Distribution (at) CS.CMU.EDU
62 1.1 jonathan * School of Computer Science
63 1.1 jonathan * Carnegie Mellon University
64 1.1 jonathan * Pittsburgh PA 15213-3890
65 1.1 jonathan *
66 1.1 jonathan * any improvements or extensions that they make and grant Carnegie Mellon
67 1.1 jonathan * the rights to redistribute these changes.
68 1.1 jonathan */
69 1.1 jonathan /*
70 1.1 jonathan Copyright 1988, 1989 by Intel Corporation, Santa Clara, California.
71 1.1 jonathan
72 1.1 jonathan All Rights Reserved
73 1.1 jonathan
74 1.1 jonathan Permission to use, copy, modify, and distribute this software and
75 1.1 jonathan its documentation for any purpose and without fee is hereby
76 1.1 jonathan granted, provided that the above copyright notice appears in all
77 1.1 jonathan copies and that both the copyright notice and this permission notice
78 1.1 jonathan appear in supporting documentation, and that the name of Intel
79 1.1 jonathan not be used in advertising or publicity pertaining to distribution
80 1.1 jonathan of the software without specific, written prior permission.
81 1.1 jonathan
82 1.1 jonathan INTEL DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE
83 1.1 jonathan INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS,
84 1.1 jonathan IN NO EVENT SHALL INTEL BE LIABLE FOR ANY SPECIAL, INDIRECT, OR
85 1.1 jonathan CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM
86 1.1 jonathan LOSS OF USE, DATA OR PROFITS, WHETHER IN ACTION OF CONTRACT,
87 1.1 jonathan NEGLIGENCE, OR OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION
88 1.1 jonathan WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
89 1.1 jonathan */
90 1.1 jonathan
91 1.1 jonathan #include <sys/param.h>
92 1.5 soda #include <sys/proc.h>
93 1.5 soda #include <sys/user.h>
94 1.1 jonathan #include <sys/systm.h>
95 1.8 thorpej #include <sys/callout.h>
96 1.1 jonathan #include <sys/time.h>
97 1.1 jonathan #include <sys/kernel.h>
98 1.1 jonathan #include <sys/device.h>
99 1.5 soda #include <sys/malloc.h>
100 1.13 mrg
101 1.13 mrg #include <uvm/uvm_extern.h>
102 1.1 jonathan
103 1.1 jonathan #include <machine/cpu.h>
104 1.1 jonathan #include <machine/pio.h>
105 1.1 jonathan #include <machine/autoconf.h>
106 1.5 soda #include <machine/intr.h>
107 1.1 jonathan
108 1.15 soda #include <dev/ic/i8253reg.h>
109 1.1 jonathan #include <dev/isa/isareg.h>
110 1.1 jonathan #include <dev/isa/isavar.h>
111 1.15 soda #include <arc/isa/isabrvar.h>
112 1.5 soda #include <arc/isa/spkrreg.h>
113 1.5 soda
114 1.5 soda static int beeping;
115 1.8 thorpej static struct callout sysbeep_ch = CALLOUT_INITIALIZER;
116 1.5 soda
117 1.5 soda #define IRQ_SLAVE 2
118 1.5 soda
119 1.5 soda /* Definition of the driver for autoconfig. */
120 1.5 soda int isabrprint(void *, const char *);
121 1.5 soda
122 1.10 soda extern struct arc_bus_space arc_bus_io, arc_bus_mem;
123 1.10 soda
124 1.11 soda void isabr_attach_hook __P((struct device *, struct device *,
125 1.11 soda struct isabus_attach_args *));
126 1.9 cgd const struct evcnt *isabr_intr_evcnt __P((isa_chipset_tag_t, int));
127 1.5 soda void *isabr_intr_establish __P((isa_chipset_tag_t, int, int, int,
128 1.5 soda int (*)(void *), void *));
129 1.5 soda void isabr_intr_disestablish __P((isa_chipset_tag_t, void*));
130 1.5 soda int isabr_iointr __P((unsigned int, struct clockframe *));
131 1.5 soda void isabr_initicu __P((void));
132 1.5 soda void intr_calculatemasks __P((void));
133 1.5 soda int fakeintr __P((void *a));
134 1.5 soda
135 1.15 soda struct isabr_config *isabr_conf = NULL;
136 1.5 soda
137 1.5 soda void
138 1.15 soda isabrattach(sc)
139 1.15 soda struct isabr_softc *sc;
140 1.5 soda {
141 1.5 soda struct isabus_attach_args iba;
142 1.5 soda
143 1.15 soda if (isabr_conf == NULL)
144 1.15 soda panic("isabr_conf isn't initialized");
145 1.15 soda
146 1.5 soda printf("\n");
147 1.5 soda
148 1.5 soda /* Initialize interrupt controller */
149 1.5 soda isabr_initicu();
150 1.5 soda
151 1.5 soda /*XXX we may remove the abus part of the softc struct... */
152 1.5 soda sc->sc_bus.ab_dv = (struct device *)sc;
153 1.5 soda sc->sc_bus.ab_type = BUS_ISABR;
154 1.5 soda
155 1.11 soda sc->arc_isa_cs.ic_attach_hook = isabr_attach_hook;
156 1.9 cgd sc->arc_isa_cs.ic_intr_evcnt = isabr_intr_evcnt;
157 1.5 soda sc->arc_isa_cs.ic_intr_establish = isabr_intr_establish;
158 1.5 soda sc->arc_isa_cs.ic_intr_disestablish = isabr_intr_disestablish;
159 1.5 soda
160 1.5 soda iba.iba_busname = "isa";
161 1.11 soda iba.iba_iot = &arc_bus_io;
162 1.11 soda iba.iba_memt = &arc_bus_mem;
163 1.11 soda iba.iba_dmat = &sc->sc_dmat;
164 1.5 soda iba.iba_ic = &sc->arc_isa_cs;
165 1.15 soda config_found(&sc->sc_dev, &iba, isabrprint);
166 1.5 soda }
167 1.5 soda
168 1.5 soda int
169 1.5 soda isabrprint(aux, pnp)
170 1.5 soda void *aux;
171 1.5 soda const char *pnp;
172 1.5 soda {
173 1.5 soda struct confargs *ca = aux;
174 1.5 soda
175 1.5 soda if (pnp)
176 1.17 thorpej aprint_normal("%s at %s", ca->ca_name, pnp);
177 1.17 thorpej aprint_verbose(" isa_io_base 0x%lx isa_mem_base 0x%lx",
178 1.10 soda arc_bus_io.bs_vbase, arc_bus_mem.bs_vbase);
179 1.5 soda return (UNCONF);
180 1.5 soda }
181 1.5 soda
182 1.5 soda
183 1.5 soda /*
184 1.5 soda * Interrupt system driver code
185 1.5 soda * ============================
186 1.5 soda */
187 1.5 soda #define LEGAL_IRQ(x) ((x) >= 0 && (x) < ICU_LEN && (x) != 2)
188 1.5 soda
189 1.5 soda int imen;
190 1.5 soda int intrtype[ICU_LEN], intrmask[ICU_LEN], intrlevel[ICU_LEN];
191 1.5 soda struct intrhand *intrhand[ICU_LEN];
192 1.5 soda
193 1.5 soda int fakeintr(a)
194 1.5 soda void *a;
195 1.5 soda {
196 1.5 soda return 0;
197 1.5 soda }
198 1.5 soda
199 1.5 soda /*
200 1.5 soda * Recalculate the interrupt masks from scratch.
201 1.5 soda * We could code special registry and deregistry versions of this function that
202 1.5 soda * would be faster, but the code would be nastier, and we don't expect this to
203 1.5 soda * happen very much anyway.
204 1.5 soda */
205 1.5 soda void
206 1.5 soda intr_calculatemasks()
207 1.5 soda {
208 1.5 soda int irq, level;
209 1.5 soda struct intrhand *q;
210 1.5 soda
211 1.5 soda /* First, figure out which levels each IRQ uses. */
212 1.5 soda for (irq = 0; irq < ICU_LEN; irq++) {
213 1.5 soda register int levels = 0;
214 1.5 soda for (q = intrhand[irq]; q; q = q->ih_next)
215 1.5 soda levels |= 1 << q->ih_level;
216 1.5 soda intrlevel[irq] = levels;
217 1.5 soda }
218 1.5 soda
219 1.5 soda /* Then figure out which IRQs use each level. */
220 1.5 soda for (level = 0; level < 5; level++) {
221 1.5 soda register int irqs = 0;
222 1.5 soda for (irq = 0; irq < ICU_LEN; irq++)
223 1.5 soda if (intrlevel[irq] & (1 << level))
224 1.5 soda irqs |= 1 << irq;
225 1.5 soda imask[level] = irqs | SIR_ALLMASK;
226 1.5 soda }
227 1.5 soda
228 1.5 soda /*
229 1.5 soda * There are tty, network and disk drivers that use free() at interrupt
230 1.5 soda * time, so imp > (tty | net | bio).
231 1.5 soda */
232 1.5 soda imask[IPL_IMP] |= imask[IPL_TTY] | imask[IPL_NET] | imask[IPL_BIO];
233 1.5 soda
234 1.5 soda /*
235 1.5 soda * Enforce a hierarchy that gives slow devices a better chance at not
236 1.5 soda * dropping data.
237 1.5 soda */
238 1.5 soda imask[IPL_TTY] |= imask[IPL_NET] | imask[IPL_BIO];
239 1.5 soda imask[IPL_NET] |= imask[IPL_BIO];
240 1.5 soda
241 1.5 soda /*
242 1.5 soda * These are pseudo-levels.
243 1.5 soda */
244 1.5 soda imask[IPL_NONE] = 0x00000000;
245 1.5 soda imask[IPL_HIGH] = 0xffffffff;
246 1.5 soda
247 1.5 soda /* And eventually calculate the complete masks. */
248 1.5 soda for (irq = 0; irq < ICU_LEN; irq++) {
249 1.5 soda register int irqs = 1 << irq;
250 1.5 soda for (q = intrhand[irq]; q; q = q->ih_next)
251 1.5 soda irqs |= imask[q->ih_level];
252 1.5 soda intrmask[irq] = irqs | SIR_ALLMASK;
253 1.5 soda }
254 1.5 soda
255 1.5 soda /* Lastly, determine which IRQs are actually in use. */
256 1.5 soda {
257 1.5 soda register int irqs = 0;
258 1.5 soda for (irq = 0; irq < ICU_LEN; irq++)
259 1.5 soda if (intrhand[irq])
260 1.5 soda irqs |= 1 << irq;
261 1.5 soda if (irqs >= 0x100) /* any IRQs >= 8 in use */
262 1.5 soda irqs |= 1 << IRQ_SLAVE;
263 1.5 soda imen = ~irqs;
264 1.5 soda isa_outb(IO_ICU1 + 1, imen);
265 1.5 soda isa_outb(IO_ICU2 + 1, imen >> 8);
266 1.5 soda }
267 1.11 soda }
268 1.11 soda
269 1.11 soda void
270 1.11 soda isabr_attach_hook(parent, self, iba)
271 1.11 soda struct device *parent, *self;
272 1.11 soda struct isabus_attach_args *iba;
273 1.11 soda {
274 1.11 soda
275 1.11 soda /* Nothing to do. */
276 1.9 cgd }
277 1.9 cgd
278 1.10 soda const struct evcnt *
279 1.10 soda isabr_intr_evcnt(ic, irq)
280 1.10 soda isa_chipset_tag_t ic;
281 1.10 soda int irq;
282 1.9 cgd {
283 1.9 cgd
284 1.9 cgd /* XXX for now, no evcnt parent reported */
285 1.9 cgd return NULL;
286 1.5 soda }
287 1.5 soda
288 1.5 soda /*
289 1.5 soda * Establish a ISA bus interrupt.
290 1.5 soda */
291 1.18 tsutsui void *
292 1.5 soda isabr_intr_establish(ic, irq, type, level, ih_fun, ih_arg)
293 1.5 soda isa_chipset_tag_t ic;
294 1.5 soda int irq;
295 1.5 soda int type;
296 1.5 soda int level;
297 1.5 soda int (*ih_fun) __P((void *));
298 1.5 soda void *ih_arg;
299 1.5 soda {
300 1.5 soda struct intrhand **p, *q, *ih;
301 1.5 soda static struct intrhand fakehand = {NULL, fakeintr};
302 1.5 soda
303 1.5 soda /* no point in sleeping unless someone can free memory. */
304 1.5 soda ih = malloc(sizeof *ih, M_DEVBUF, cold ? M_NOWAIT : M_WAITOK);
305 1.5 soda if (ih == NULL)
306 1.5 soda panic("isa_intr_establish: can't malloc handler info");
307 1.5 soda
308 1.5 soda if (!LEGAL_IRQ(irq) || type == IST_NONE)
309 1.5 soda panic("intr_establish: bogus irq or type");
310 1.5 soda
311 1.5 soda switch (intrtype[irq]) {
312 1.5 soda case IST_EDGE:
313 1.5 soda case IST_LEVEL:
314 1.5 soda if (type == intrtype[irq])
315 1.5 soda break;
316 1.5 soda case IST_PULSE:
317 1.5 soda if (type != IST_NONE)
318 1.5 soda panic("intr_establish: can't share %s with %s",
319 1.5 soda isa_intr_typename(intrtype[irq]),
320 1.5 soda isa_intr_typename(type));
321 1.5 soda break;
322 1.5 soda }
323 1.5 soda
324 1.5 soda /*
325 1.5 soda * Figure out where to put the handler.
326 1.5 soda * This is O(N^2), but we want to preserve the order, and N is
327 1.5 soda * generally small.
328 1.5 soda */
329 1.5 soda for (p = &intrhand[irq]; (q = *p) != NULL; p = &q->ih_next)
330 1.5 soda ;
331 1.5 soda
332 1.5 soda /*
333 1.5 soda * Actually install a fake handler momentarily, since we might be doing
334 1.5 soda * this with interrupts enabled and don't want the real routine called
335 1.5 soda * until masking is set up.
336 1.5 soda */
337 1.5 soda fakehand.ih_level = level;
338 1.5 soda *p = &fakehand;
339 1.5 soda
340 1.5 soda intr_calculatemasks();
341 1.5 soda
342 1.5 soda /*
343 1.5 soda * Poke the real handler in now.
344 1.5 soda */
345 1.5 soda ih->ih_fun = ih_fun;
346 1.5 soda ih->ih_arg = ih_arg;
347 1.5 soda ih->ih_count = 0;
348 1.5 soda ih->ih_next = NULL;
349 1.5 soda ih->ih_level = level;
350 1.5 soda ih->ih_irq = irq;
351 1.5 soda ih->ih_what = ""; /* XXX - should be eliminated */
352 1.5 soda *p = ih;
353 1.5 soda
354 1.5 soda return (ih);
355 1.5 soda }
356 1.5 soda
357 1.18 tsutsui void
358 1.5 soda isabr_intr_disestablish(ic, arg)
359 1.5 soda isa_chipset_tag_t ic;
360 1.18 tsutsui void *arg;
361 1.18 tsutsui {
362 1.5 soda
363 1.5 soda }
364 1.5 soda
365 1.5 soda /*
366 1.5 soda * Process an interrupt from the ISA bus.
367 1.5 soda */
368 1.5 soda int
369 1.5 soda isabr_iointr(mask, cf)
370 1.5 soda unsigned mask;
371 1.5 soda struct clockframe *cf;
372 1.5 soda {
373 1.5 soda struct intrhand *ih;
374 1.5 soda int isa_vector;
375 1.5 soda int o_imen;
376 1.7 soda
377 1.15 soda isa_vector = (*isabr_conf->ic_intr_status)();
378 1.15 soda if (isa_vector < 0)
379 1.15 soda return (~0);
380 1.5 soda
381 1.5 soda o_imen = imen;
382 1.5 soda imen |= 1 << (isa_vector & (ICU_LEN - 1));
383 1.5 soda if(isa_vector & 0x08) {
384 1.5 soda isa_inb(IO_ICU2 + 1);
385 1.5 soda isa_outb(IO_ICU2 + 1, imen >> 8);
386 1.5 soda isa_outb(IO_ICU2, 0x60 + (isa_vector & 7));
387 1.5 soda isa_outb(IO_ICU1, 0x60 + IRQ_SLAVE);
388 1.5 soda }
389 1.5 soda else {
390 1.5 soda isa_inb(IO_ICU1 + 1);
391 1.5 soda isa_outb(IO_ICU1 + 1, imen);
392 1.5 soda isa_outb(IO_ICU1, 0x60 + isa_vector);
393 1.5 soda }
394 1.5 soda ih = intrhand[isa_vector];
395 1.5 soda if(isa_vector == 0) { /* Clock */ /*XXX*/
396 1.5 soda (*ih->ih_fun)(cf);
397 1.5 soda ih = ih->ih_next;
398 1.5 soda }
399 1.5 soda while(ih) {
400 1.5 soda (*ih->ih_fun)(ih->ih_arg);
401 1.5 soda ih = ih->ih_next;
402 1.5 soda }
403 1.5 soda imen = o_imen;
404 1.5 soda isa_inb(IO_ICU1 + 1);
405 1.5 soda isa_inb(IO_ICU2 + 1);
406 1.5 soda isa_outb(IO_ICU1 + 1, imen);
407 1.5 soda isa_outb(IO_ICU2 + 1, imen >> 8);
408 1.5 soda
409 1.5 soda return(~0); /* Dont reenable */
410 1.5 soda }
411 1.5 soda
412 1.5 soda
413 1.18 tsutsui /*
414 1.5 soda * Initialize the Interrupt controller logic.
415 1.5 soda */
416 1.5 soda void
417 1.5 soda isabr_initicu()
418 1.18 tsutsui {
419 1.5 soda
420 1.5 soda isa_outb(IO_ICU1, 0x11); /* reset; program device, four bytes */
421 1.5 soda isa_outb(IO_ICU1+1, 0); /* starting at this vector index */
422 1.5 soda isa_outb(IO_ICU1+1, 1 << IRQ_SLAVE); /* slave on line 2 */
423 1.5 soda isa_outb(IO_ICU1+1, 1); /* 8086 mode */
424 1.5 soda isa_outb(IO_ICU1+1, 0xff); /* leave interrupts masked */
425 1.5 soda isa_outb(IO_ICU1, 0x68); /* special mask mode (if available) */
426 1.5 soda isa_outb(IO_ICU1, 0x0a); /* Read IRR by default. */
427 1.18 tsutsui #ifdef REORDER_IRQ
428 1.5 soda isa_outb(IO_ICU1, 0xc0 | (3 - 1)); /* pri order 3-7, 0-2 (com2 first) */
429 1.2 jonathan #endif
430 1.1 jonathan
431 1.5 soda isa_outb(IO_ICU2, 0x11); /* reset; program device, four bytes */
432 1.5 soda isa_outb(IO_ICU2+1, 8); /* staring at this vector index */
433 1.5 soda isa_outb(IO_ICU2+1, IRQ_SLAVE);
434 1.5 soda isa_outb(IO_ICU2+1, 1); /* 8086 mode */
435 1.5 soda isa_outb(IO_ICU2+1, 0xff); /* leave interrupts masked */
436 1.5 soda isa_outb(IO_ICU2, 0x68); /* special mask mode (if available) */
437 1.5 soda isa_outb(IO_ICU2, 0x0a); /* Read IRR by default. */
438 1.18 tsutsui }
439 1.1 jonathan
440 1.1 jonathan
441 1.5 soda /*
442 1.5 soda * SPEAKER BEEPER...
443 1.5 soda */
444 1.1 jonathan void
445 1.1 jonathan sysbeepstop(arg)
446 1.1 jonathan void *arg;
447 1.1 jonathan {
448 1.1 jonathan int s;
449 1.1 jonathan
450 1.1 jonathan /* disable counter 2 */
451 1.1 jonathan s = splhigh();
452 1.1 jonathan isa_outb(PITAUX_PORT, isa_inb(PITAUX_PORT) & ~PIT_SPKR);
453 1.1 jonathan splx(s);
454 1.1 jonathan beeping = 0;
455 1.1 jonathan }
456 1.1 jonathan
457 1.1 jonathan void
458 1.1 jonathan sysbeep(pitch, period)
459 1.1 jonathan int pitch, period;
460 1.1 jonathan {
461 1.1 jonathan static int last_pitch, last_period;
462 1.1 jonathan int s;
463 1.5 soda
464 1.5 soda if (cold)
465 1.5 soda return; /* Can't beep yet. */
466 1.1 jonathan
467 1.1 jonathan if (beeping)
468 1.8 thorpej callout_stop(&sysbeep_ch);
469 1.1 jonathan if (!beeping || last_pitch != pitch) {
470 1.1 jonathan s = splhigh();
471 1.5 soda isa_outb(IO_TIMER1 + TIMER_MODE,
472 1.5 soda TIMER_SEL2 | TIMER_16BIT | TIMER_SQWAVE);
473 1.5 soda isa_outb(IO_TIMER1 + TIMER_CNTR2, TIMER_DIV(pitch) % 256);
474 1.5 soda isa_outb(IO_TIMER1 + TIMER_CNTR2, TIMER_DIV(pitch) / 256);
475 1.1 jonathan isa_outb(PITAUX_PORT, isa_inb(PITAUX_PORT) | PIT_SPKR);
476 1.1 jonathan splx(s);
477 1.1 jonathan }
478 1.1 jonathan last_pitch = pitch;
479 1.1 jonathan beeping = last_period = period;
480 1.8 thorpej callout_reset(&sysbeep_ch, period, sysbeepstop, NULL);
481 1.1 jonathan }
482