event.c revision 1.8 1 1.8 lukem /* $NetBSD: event.c,v 1.8 2003/07/15 01:44:51 lukem Exp $ */
2 1.1 oki
3 1.1 oki /*
4 1.1 oki * Copyright (c) 1992, 1993
5 1.1 oki * The Regents of the University of California. All rights reserved.
6 1.1 oki *
7 1.1 oki * This software was developed by the Computer Systems Engineering group
8 1.1 oki * at Lawrence Berkeley Laboratory under DARPA contract BG 91-66 and
9 1.1 oki * contributed to Berkeley.
10 1.1 oki *
11 1.1 oki * All advertising materials mentioning features or use of this software
12 1.1 oki * must display the following acknowledgement:
13 1.1 oki * This product includes software developed by the University of
14 1.1 oki * California, Lawrence Berkeley Laboratory.
15 1.1 oki *
16 1.1 oki * Redistribution and use in source and binary forms, with or without
17 1.1 oki * modification, are permitted provided that the following conditions
18 1.1 oki * are met:
19 1.1 oki * 1. Redistributions of source code must retain the above copyright
20 1.1 oki * notice, this list of conditions and the following disclaimer.
21 1.1 oki * 2. Redistributions in binary form must reproduce the above copyright
22 1.1 oki * notice, this list of conditions and the following disclaimer in the
23 1.1 oki * documentation and/or other materials provided with the distribution.
24 1.1 oki * 3. All advertising materials mentioning features or use of this software
25 1.1 oki * must display the following acknowledgement:
26 1.1 oki * This product includes software developed by the University of
27 1.1 oki * California, Berkeley and its contributors.
28 1.1 oki * 4. Neither the name of the University nor the names of its contributors
29 1.1 oki * may be used to endorse or promote products derived from this software
30 1.1 oki * without specific prior written permission.
31 1.1 oki *
32 1.1 oki * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
33 1.1 oki * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
34 1.1 oki * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
35 1.1 oki * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
36 1.1 oki * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
37 1.1 oki * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
38 1.1 oki * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
39 1.1 oki * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
40 1.1 oki * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
41 1.1 oki * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
42 1.1 oki * SUCH DAMAGE.
43 1.1 oki *
44 1.1 oki * @(#)event.c 8.1 (Berkeley) 6/11/93
45 1.1 oki */
46 1.1 oki
47 1.1 oki /*
48 1.1 oki * Internal `Firm_event' interface for the keyboard and mouse drivers.
49 1.1 oki */
50 1.8 lukem
51 1.8 lukem #include <sys/cdefs.h>
52 1.8 lukem __KERNEL_RCSID(0, "$NetBSD: event.c,v 1.8 2003/07/15 01:44:51 lukem Exp $");
53 1.1 oki
54 1.1 oki #include <sys/param.h>
55 1.1 oki #include <sys/fcntl.h>
56 1.1 oki #include <sys/malloc.h>
57 1.1 oki #include <sys/proc.h>
58 1.1 oki #include <sys/systm.h>
59 1.1 oki #include <sys/vnode.h>
60 1.3 oki #include <sys/select.h>
61 1.3 oki #include <sys/poll.h>
62 1.1 oki
63 1.1 oki #include <machine/vuid_event.h>
64 1.1 oki #include <x68k/dev/event_var.h>
65 1.1 oki
66 1.1 oki /*
67 1.1 oki * Initialize a firm_event queue.
68 1.1 oki */
69 1.1 oki void
70 1.1 oki ev_init(ev)
71 1.1 oki register struct evvar *ev;
72 1.1 oki {
73 1.1 oki
74 1.1 oki ev->ev_get = ev->ev_put = 0;
75 1.1 oki ev->ev_q = malloc((u_long)EV_QSIZE * sizeof(struct firm_event),
76 1.1 oki M_DEVBUF, M_WAITOK);
77 1.5 wiz memset((caddr_t)ev->ev_q, 0, EV_QSIZE * sizeof(struct firm_event));
78 1.1 oki }
79 1.1 oki
80 1.1 oki /*
81 1.1 oki * Tear down a firm_event queue.
82 1.1 oki */
83 1.1 oki void
84 1.1 oki ev_fini(ev)
85 1.1 oki register struct evvar *ev;
86 1.1 oki {
87 1.1 oki
88 1.1 oki free(ev->ev_q, M_DEVBUF);
89 1.1 oki }
90 1.1 oki
91 1.1 oki /*
92 1.1 oki * User-level interface: read, select.
93 1.1 oki * (User cannot write an event queue.)
94 1.1 oki */
95 1.1 oki int
96 1.1 oki ev_read(ev, uio, flags)
97 1.1 oki register struct evvar *ev;
98 1.1 oki struct uio *uio;
99 1.1 oki int flags;
100 1.1 oki {
101 1.1 oki int s, n, cnt, error;
102 1.1 oki
103 1.1 oki /*
104 1.1 oki * Make sure we can return at least 1.
105 1.1 oki */
106 1.1 oki if (uio->uio_resid < sizeof(struct firm_event))
107 1.1 oki return (EMSGSIZE); /* ??? */
108 1.1 oki s = splev();
109 1.1 oki while (ev->ev_get == ev->ev_put) {
110 1.1 oki if (flags & IO_NDELAY) {
111 1.1 oki splx(s);
112 1.1 oki return (EWOULDBLOCK);
113 1.1 oki }
114 1.1 oki ev->ev_wanted = 1;
115 1.1 oki error = tsleep((caddr_t)ev, PEVENT | PCATCH, "firm_event", 0);
116 1.1 oki if (error) {
117 1.1 oki splx(s);
118 1.1 oki return (error);
119 1.1 oki }
120 1.1 oki }
121 1.1 oki /*
122 1.1 oki * Move firm_events from tail end of queue (there is at least one
123 1.1 oki * there).
124 1.1 oki */
125 1.1 oki if (ev->ev_put < ev->ev_get)
126 1.1 oki cnt = EV_QSIZE - ev->ev_get; /* events in [get..QSIZE) */
127 1.1 oki else
128 1.1 oki cnt = ev->ev_put - ev->ev_get; /* events in [get..put) */
129 1.1 oki splx(s);
130 1.1 oki n = howmany(uio->uio_resid, sizeof(struct firm_event));
131 1.1 oki if (cnt > n)
132 1.1 oki cnt = n;
133 1.1 oki error = uiomove((caddr_t)&ev->ev_q[ev->ev_get],
134 1.1 oki cnt * sizeof(struct firm_event), uio);
135 1.1 oki n -= cnt;
136 1.1 oki /*
137 1.1 oki * If we do not wrap to 0, used up all our space, or had an error,
138 1.1 oki * stop. Otherwise move from front of queue to put index, if there
139 1.1 oki * is anything there to move.
140 1.1 oki */
141 1.1 oki if ((ev->ev_get = (ev->ev_get + cnt) % EV_QSIZE) != 0 ||
142 1.1 oki n == 0 || error || (cnt = ev->ev_put) == 0)
143 1.1 oki return (error);
144 1.1 oki if (cnt > n)
145 1.1 oki cnt = n;
146 1.1 oki error = uiomove((caddr_t)&ev->ev_q[0],
147 1.1 oki cnt * sizeof(struct firm_event), uio);
148 1.1 oki ev->ev_get = cnt;
149 1.1 oki return (error);
150 1.1 oki }
151 1.1 oki
152 1.1 oki int
153 1.3 oki ev_poll(ev, events, p)
154 1.1 oki register struct evvar *ev;
155 1.4 oki int events;
156 1.1 oki struct proc *p;
157 1.1 oki {
158 1.3 oki int s = splev(), revents = 0;
159 1.1 oki
160 1.3 oki if (events & (POLLIN | POLLRDNORM)) {
161 1.3 oki if (ev->ev_get == ev->ev_put)
162 1.3 oki selrecord(p, &ev->ev_sel);
163 1.3 oki else
164 1.3 oki revents |= events & (POLLIN | POLLRDNORM);
165 1.3 oki }
166 1.3 oki revents |= events & (POLLOUT | POLLWRNORM);
167 1.1 oki
168 1.1 oki splx(s);
169 1.3 oki return (revents);
170 1.6 jdolecek }
171 1.6 jdolecek
172 1.6 jdolecek static void
173 1.6 jdolecek filt_evrdetach(struct knote *kn)
174 1.6 jdolecek {
175 1.6 jdolecek struct evvar *ev = kn->kn_hook;
176 1.6 jdolecek int s;
177 1.6 jdolecek
178 1.6 jdolecek s = splev();
179 1.7 christos SLIST_REMOVE(&ev->ev_sel.sel_klist, kn, knote, kn_selnext);
180 1.6 jdolecek splx(s);
181 1.6 jdolecek }
182 1.6 jdolecek
183 1.6 jdolecek static int
184 1.6 jdolecek filt_evread(struct knote *kn, long hint)
185 1.6 jdolecek {
186 1.6 jdolecek struct evvar *ev = kn->kn_hook;
187 1.6 jdolecek
188 1.6 jdolecek if (ev->ev_get == ev->ev_put)
189 1.6 jdolecek return (0);
190 1.6 jdolecek
191 1.6 jdolecek if (ev->ev_get < ev->ev_put)
192 1.6 jdolecek kn->kn_data = ev->ev_put - ev->ev_get;
193 1.6 jdolecek else
194 1.6 jdolecek kn->kn_data = (EV_QSIZE - ev->ev_get) +
195 1.6 jdolecek ev->ev_put;
196 1.6 jdolecek
197 1.6 jdolecek kn->kn_data *= sizeof(struct firm_event);
198 1.6 jdolecek
199 1.6 jdolecek return (1);
200 1.6 jdolecek }
201 1.6 jdolecek
202 1.6 jdolecek static const struct filterops ev_filtops =
203 1.6 jdolecek { 1, NULL, filt_evrdetach, filt_evread };
204 1.6 jdolecek
205 1.6 jdolecek int
206 1.6 jdolecek ev_kqfilter(struct evvar *ev, struct knote *kn)
207 1.6 jdolecek {
208 1.6 jdolecek struct klist *klist;
209 1.6 jdolecek int s;
210 1.6 jdolecek
211 1.6 jdolecek switch (kn->kn_filter) {
212 1.6 jdolecek case EVFILT_READ:
213 1.7 christos klist = &ev->ev_sel.sel_klist;
214 1.6 jdolecek kn->kn_fop = &ev_filtops;
215 1.6 jdolecek break;
216 1.6 jdolecek
217 1.6 jdolecek default:
218 1.6 jdolecek return (1);
219 1.6 jdolecek }
220 1.6 jdolecek
221 1.6 jdolecek kn->kn_hook = ev;
222 1.6 jdolecek
223 1.6 jdolecek s = splev();
224 1.6 jdolecek SLIST_INSERT_HEAD(klist, kn, kn_selnext);
225 1.6 jdolecek splx(s);
226 1.6 jdolecek
227 1.6 jdolecek return (0);
228 1.1 oki }
229