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