xref: /netbsd-src/sys/dev/isa/ast.c (revision 76dfffe33547c37f8bdd446e3e4ab0f3c16cea4b)
1 /*	$NetBSD: ast.c,v 1.32 1996/10/21 22:40:23 thorpej Exp $	*/
2 
3 /*
4  * Copyright (c) 1996 Christopher G. Demetriou.  All rights reserved.
5  * Copyright (c) 1995 Charles Hannum.  All rights reserved.
6  *
7  * This code is derived from public-domain software written by
8  * Roland McGrath.
9  *
10  * Redistribution and use in source and binary forms, with or without
11  * modification, are permitted provided that the following conditions
12  * are met:
13  * 1. Redistributions of source code must retain the above copyright
14  *    notice, this list of conditions and the following disclaimer.
15  * 2. Redistributions in binary form must reproduce the above copyright
16  *    notice, this list of conditions and the following disclaimer in the
17  *    documentation and/or other materials provided with the distribution.
18  * 3. All advertising materials mentioning features or use of this software
19  *    must display the following acknowledgement:
20  *	This product includes software developed by Charles Hannum.
21  * 4. The name of the author may not be used to endorse or promote products
22  *    derived from this software without specific prior written permission.
23  *
24  * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
25  * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
26  * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
27  * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
28  * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
29  * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
30  * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
31  * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
32  * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
33  * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
34  */
35 
36 #include <sys/param.h>
37 #include <sys/systm.h>
38 #include <sys/device.h>
39 #include <sys/termios.h>
40 
41 #include <machine/bus.h>
42 #include <machine/intr.h>
43 
44 #include <dev/isa/isavar.h>
45 #include <dev/isa/comreg.h>
46 #include <dev/isa/comvar.h>
47 
48 #define	NSLAVES	4
49 
50 struct ast_softc {
51 	struct device sc_dev;
52 	void *sc_ih;
53 
54 	bus_space_tag_t sc_iot;
55 	int sc_iobase;
56 
57 	int sc_alive;			/* mask of slave units attached */
58 	void *sc_slaves[NSLAVES];	/* com device unit numbers */
59 	bus_space_handle_t sc_slaveioh[NSLAVES];
60 };
61 
62 int astprobe __P((struct device *, void *, void *));
63 void astattach __P((struct device *, struct device *, void *));
64 int astintr __P((void *));
65 int astprint __P((void *, const char *));
66 
67 struct cfattach ast_ca = {
68 	sizeof(struct ast_softc), astprobe, astattach
69 };
70 
71 struct cfdriver ast_cd = {
72 	NULL, "ast", DV_TTY
73 };
74 
75 int
76 astprobe(parent, self, aux)
77 	struct device *parent;
78 	void *self;
79 	void *aux;
80 {
81 	struct isa_attach_args *ia = aux;
82 	int iobase = ia->ia_iobase;
83 	bus_space_tag_t iot = ia->ia_iot;
84 	bus_space_handle_t ioh;
85 	int i, rv = 1;
86 
87 	/*
88 	 * Do the normal com probe for the first UART and assume
89 	 * its presence, and the ability to map the other UARTS,
90 	 * means there is a multiport board there.
91 	 * XXX Needs more robustness.
92 	 */
93 
94 	/* if the first port is in use as console, then it. */
95 	if (iobase == comconsaddr && !comconsattached)
96 		goto checkmappings;
97 
98 	if (bus_space_map(iot, iobase, COM_NPORTS, 0, &ioh)) {
99 		rv = 0;
100 		goto out;
101 	}
102 	rv = comprobe1(iot, ioh, iobase);
103 	bus_space_unmap(iot, ioh, COM_NPORTS);
104 	if (rv == 0)
105 		goto out;
106 
107 checkmappings:
108 	for (i = 1; i < NSLAVES; i++) {
109 		iobase += COM_NPORTS;
110 
111 		if (iobase == comconsaddr && !comconsattached)
112 			continue;
113 
114 		if (bus_space_map(iot, iobase, COM_NPORTS, 0, &ioh)) {
115 			rv = 0;
116 			goto out;
117 		}
118 		bus_space_unmap(iot, ioh, COM_NPORTS);
119 	}
120 
121 out:
122 	if (rv)
123 		ia->ia_iosize = NSLAVES * COM_NPORTS;
124 	return (rv);
125 }
126 
127 int
128 astprint(aux, pnp)
129 	void *aux;
130 	const char *pnp;
131 {
132 	struct commulti_attach_args *ca = aux;
133 
134 	if (pnp)
135 		printf("com at %s", pnp);
136 	printf(" slave %d", ca->ca_slave);
137 	return (UNCONF);
138 }
139 
140 void
141 astattach(parent, self, aux)
142 	struct device *parent, *self;
143 	void *aux;
144 {
145 	struct ast_softc *sc = (void *)self;
146 	struct isa_attach_args *ia = aux;
147 	struct commulti_attach_args ca;
148 	bus_space_tag_t iot = ia->ia_iot;
149 	int i;
150 
151 	sc->sc_iot = ia->ia_iot;
152 	sc->sc_iobase = ia->ia_iobase;
153 
154 	for (i = 0; i < NSLAVES; i++)
155 		if (bus_space_map(iot, sc->sc_iobase + i * COM_NPORTS,
156 		    COM_NPORTS, 0, &sc->sc_slaveioh[i]))
157 			panic("astattach: couldn't map slave %d", i);
158 
159 	/*
160 	 * Enable the master interrupt.
161 	 */
162 	bus_space_write_1(iot, sc->sc_slaveioh[3], 7, 0x80);
163 
164 	printf("\n");
165 
166 	for (i = 0; i < NSLAVES; i++) {
167 		ca.ca_slave = i;
168 		ca.ca_iot = sc->sc_iot;
169 		ca.ca_ioh = sc->sc_slaveioh[i];
170 		ca.ca_iobase = sc->sc_iobase + i * COM_NPORTS;
171 		ca.ca_noien = 1;
172 
173 		sc->sc_slaves[i] = config_found(self, &ca, astprint);
174 		if (sc->sc_slaves[i] != NULL)
175 			sc->sc_alive |= 1 << i;
176 	}
177 
178 	sc->sc_ih = isa_intr_establish(ia->ia_ic, ia->ia_irq, IST_EDGE,
179 	    IPL_TTY, astintr, sc);
180 }
181 
182 int
183 astintr(arg)
184 	void *arg;
185 {
186 	struct ast_softc *sc = arg;
187 	bus_space_tag_t iot = sc->sc_iot;
188 	int alive = sc->sc_alive;
189 	int bits;
190 
191 	bits = ~bus_space_read_1(iot, sc->sc_slaveioh[3], 7) & alive;
192 	if (bits == 0)
193 		return (0);
194 
195 	for (;;) {
196 #define	TRY(n) \
197 		if (bits & (1 << (n))) \
198 			comintr(sc->sc_slaves[n]);
199 		TRY(0);
200 		TRY(1);
201 		TRY(2);
202 		TRY(3);
203 #undef TRY
204 		bits = ~bus_space_read_1(iot, sc->sc_slaveioh[3], 7) & alive;
205 		if (bits == 0)
206 			return (1);
207  	}
208 }
209