wsevent.c revision 1.13
1/* $OpenBSD: wsevent.c,v 1.13 2015/03/14 03:38:50 jsg Exp $ */ 2/* $NetBSD: wsevent.c,v 1.16 2003/08/07 16:31:29 agc Exp $ */ 3 4/* 5 * Copyright (c) 1996, 1997 Christopher G. Demetriou. All rights reserved. 6 * 7 * Redistribution and use in source and binary forms, with or without 8 * modification, are permitted provided that the following conditions 9 * are met: 10 * 1. Redistributions of source code must retain the above copyright 11 * notice, this list of conditions and the following disclaimer. 12 * 2. Redistributions in binary form must reproduce the above copyright 13 * notice, this list of conditions and the following disclaimer in the 14 * documentation and/or other materials provided with the distribution. 15 * 3. All advertising materials mentioning features or use of this software 16 * must display the following acknowledgement: 17 * This product includes software developed by Christopher G. Demetriou 18 * for the NetBSD Project. 19 * 4. The name of the author may not be used to endorse or promote products 20 * derived from this software without specific prior written permission 21 * 22 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR 23 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES 24 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. 25 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, 26 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT 27 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 28 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 29 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 30 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF 31 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 32 */ 33 34/* 35 * Copyright (c) 1992, 1993 36 * The Regents of the University of California. All rights reserved. 37 * 38 * This software was developed by the Computer Systems Engineering group 39 * at Lawrence Berkeley Laboratory under DARPA contract BG 91-66 and 40 * contributed to Berkeley. 41 * 42 * All advertising materials mentioning features or use of this software 43 * must display the following acknowledgement: 44 * This product includes software developed by the University of 45 * California, Lawrence Berkeley Laboratory. 46 * 47 * Redistribution and use in source and binary forms, with or without 48 * modification, are permitted provided that the following conditions 49 * are met: 50 * 1. Redistributions of source code must retain the above copyright 51 * notice, this list of conditions and the following disclaimer. 52 * 2. Redistributions in binary form must reproduce the above copyright 53 * notice, this list of conditions and the following disclaimer in the 54 * documentation and/or other materials provided with the distribution. 55 * 3. Neither the name of the University nor the names of its contributors 56 * may be used to endorse or promote products derived from this software 57 * without specific prior written permission. 58 * 59 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 60 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 61 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 62 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 63 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 64 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 65 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 66 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 67 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 68 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 69 * SUCH DAMAGE. 70 * 71 * @(#)event.c 8.1 (Berkeley) 6/11/93 72 */ 73 74/* 75 * Internal "wscons_event" queue interface for the keyboard and mouse drivers. 76 */ 77 78#include <sys/param.h> 79#include <sys/malloc.h> 80#include <sys/systm.h> 81#include <sys/vnode.h> 82#include <sys/selinfo.h> 83#include <sys/poll.h> 84 85#include <dev/wscons/wsconsio.h> 86#include <dev/wscons/wseventvar.h> 87 88/* 89 * Initialize a wscons_event queue. 90 */ 91void 92wsevent_init(struct wseventvar *ev) 93{ 94 95 if (ev->q != NULL) { 96#ifdef DIAGNOSTIC 97 printf("wsevent_init: already initialized\n"); 98#endif 99 return; 100 } 101 ev->get = ev->put = 0; 102 ev->q = malloc(WSEVENT_QSIZE * sizeof(struct wscons_event), 103 M_DEVBUF, M_WAITOK | M_ZERO); 104} 105 106/* 107 * Tear down a wscons_event queue. 108 */ 109void 110wsevent_fini(struct wseventvar *ev) 111{ 112 if (ev->q == NULL) { 113#ifdef DIAGNOSTIC 114 printf("wsevent_fini: already invoked\n"); 115#endif 116 return; 117 } 118 free(ev->q, M_DEVBUF, 0); 119 ev->q = NULL; 120} 121 122/* 123 * User-level interface: read, poll. 124 * (User cannot write an event queue.) 125 */ 126int 127wsevent_read(struct wseventvar *ev, struct uio *uio, int flags) 128{ 129 int s, n, cnt, error; 130 131 /* 132 * Make sure we can return at least 1. 133 */ 134 if (uio->uio_resid < sizeof(struct wscons_event)) 135 return (EMSGSIZE); /* ??? */ 136 s = splwsevent(); 137 while (ev->get == ev->put) { 138 if (flags & IO_NDELAY) { 139 splx(s); 140 return (EWOULDBLOCK); 141 } 142 ev->wanted = 1; 143 error = tsleep(ev, PWSEVENT | PCATCH, 144 "wsevent_read", 0); 145 if (error) { 146 splx(s); 147 return (error); 148 } 149 } 150 /* 151 * Move wscons_event from tail end of queue (there is at least one 152 * there). 153 */ 154 if (ev->put < ev->get) 155 cnt = WSEVENT_QSIZE - ev->get; /* events in [get..QSIZE) */ 156 else 157 cnt = ev->put - ev->get; /* events in [get..put) */ 158 splx(s); 159 n = howmany(uio->uio_resid, sizeof(struct wscons_event)); 160 if (cnt > n) 161 cnt = n; 162 error = uiomovei((caddr_t)&ev->q[ev->get], 163 cnt * sizeof(struct wscons_event), uio); 164 n -= cnt; 165 /* 166 * If we do not wrap to 0, used up all our space, or had an error, 167 * stop. Otherwise move from front of queue to put index, if there 168 * is anything there to move. 169 */ 170 if ((ev->get = (ev->get + cnt) % WSEVENT_QSIZE) != 0 || 171 n == 0 || error || (cnt = ev->put) == 0) 172 return (error); 173 if (cnt > n) 174 cnt = n; 175 error = uiomovei((caddr_t)&ev->q[0], 176 cnt * sizeof(struct wscons_event), uio); 177 ev->get = cnt; 178 return (error); 179} 180 181int 182wsevent_poll(struct wseventvar *ev, int events, struct proc *p) 183{ 184 int revents = 0; 185 int s = splwsevent(); 186 187 if (events & (POLLIN | POLLRDNORM)) { 188 if (ev->get != ev->put) 189 revents |= events & (POLLIN | POLLRDNORM); 190 else 191 selrecord(p, &ev->sel); 192 } 193 194 splx(s); 195 return (revents); 196} 197