Rev 1533 | Go to most recent revision | Details | Compare with Previous | Last modification | View Log | RSS feed
| Rev | Author | Line No. | Line |
|---|---|---|---|
| 1419 | jermar | 1 | /* $OpenBSD: input.c,v 1.12 2005/04/13 02:33:08 deraadt Exp $ */ |
| 2 | /* $NetBSD: input.c,v 1.3 1996/02/06 22:47:33 jtc Exp $ */ |
||
| 3 | |||
| 4 | /*- |
||
| 5 | * Copyright (c) 1992, 1993 |
||
| 6 | * The Regents of the University of California. All rights reserved. |
||
| 7 | * |
||
| 8 | * This code is derived from software contributed to Berkeley by |
||
| 9 | * Chris Torek and Darren F. Provine. |
||
| 10 | * |
||
| 11 | * Redistribution and use in source and binary forms, with or without |
||
| 12 | * modification, are permitted provided that the following conditions |
||
| 13 | * are met: |
||
| 14 | * 1. Redistributions of source code must retain the above copyright |
||
| 15 | * notice, this list of conditions and the following disclaimer. |
||
| 16 | * 2. Redistributions in binary form must reproduce the above copyright |
||
| 17 | * notice, this list of conditions and the following disclaimer in the |
||
| 18 | * documentation and/or other materials provided with the distribution. |
||
| 19 | * 3. Neither the name of the University nor the names of its contributors |
||
| 20 | * may be used to endorse or promote products derived from this software |
||
| 21 | * without specific prior written permission. |
||
| 22 | * |
||
| 23 | * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND |
||
| 24 | * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE |
||
| 25 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE |
||
| 26 | * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE |
||
| 27 | * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL |
||
| 28 | * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS |
||
| 29 | * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) |
||
| 30 | * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT |
||
| 31 | * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY |
||
| 32 | * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF |
||
| 33 | * SUCH DAMAGE. |
||
| 34 | * |
||
| 35 | * @(#)input.c 8.1 (Berkeley) 5/31/93 |
||
| 36 | */ |
||
| 37 | |||
| 1653 | cejka | 38 | /** @addtogroup tetris |
| 39 | * @{ |
||
| 40 | */ |
||
| 41 | /** @file |
||
| 42 | */ |
||
| 43 | |||
| 1419 | jermar | 44 | /* |
| 45 | * Tetris input. |
||
| 46 | */ |
||
| 47 | |||
| 48 | #include <sys/types.h> |
||
| 49 | #include <sys/time.h> |
||
| 1532 | palkovsky | 50 | #include <stdio.h> |
| 1419 | jermar | 51 | |
| 52 | #include <errno.h> |
||
| 53 | #include <unistd.h> |
||
| 54 | #include <string.h> |
||
| 55 | |||
| 56 | #include "input.h" |
||
| 57 | #include "tetris.h" |
||
| 58 | |||
| 1466 | palkovsky | 59 | #include <async.h> |
| 1469 | palkovsky | 60 | #include "../console/console.h" |
| 1466 | palkovsky | 61 | |
| 1419 | jermar | 62 | /* return true iff the given timeval is positive */ |
| 63 | #define TV_POS(tv) \ |
||
| 64 | ((tv)->tv_sec > 0 || ((tv)->tv_sec == 0 && (tv)->tv_usec > 0)) |
||
| 65 | |||
| 66 | /* subtract timeval `sub' from `res' */ |
||
| 67 | #define TV_SUB(res, sub) \ |
||
| 68 | (res)->tv_sec -= (sub)->tv_sec; \ |
||
| 69 | (res)->tv_usec -= (sub)->tv_usec; \ |
||
| 70 | if ((res)->tv_usec < 0) { \ |
||
| 71 | (res)->tv_usec += 1000000; \ |
||
| 72 | (res)->tv_sec--; \ |
||
| 73 | } |
||
| 74 | |||
| 1469 | palkovsky | 75 | /* We will use a hack here - if lastchar is non-zero, it is |
| 76 | * the last character read. We will somehow simulate the select |
||
| 77 | * semantics. |
||
| 78 | */ |
||
| 1466 | palkovsky | 79 | static aid_t getchar_inprog = 0; |
| 1469 | palkovsky | 80 | static char lastchar = '\0'; |
| 1466 | palkovsky | 81 | |
| 1419 | jermar | 82 | /* |
| 83 | * Do a `read wait': select for reading from stdin, with timeout *tvp. |
||
| 84 | * On return, modify *tvp to reflect the amount of time spent waiting. |
||
| 85 | * It will be positive only if input appeared before the time ran out; |
||
| 86 | * otherwise it will be zero or perhaps negative. |
||
| 87 | * |
||
| 88 | * If tvp is nil, wait forever, but return if select is interrupted. |
||
| 89 | * |
||
| 90 | * Return 0 => no input, 1 => can read() from stdin |
||
| 1469 | palkovsky | 91 | * |
| 1419 | jermar | 92 | */ |
| 93 | int |
||
| 94 | rwait(struct timeval *tvp) |
||
| 95 | { |
||
| 96 | struct timeval starttv, endtv, *s; |
||
| 1469 | palkovsky | 97 | static ipc_call_t charcall; |
| 1533 | palkovsky | 98 | ipcarg_t rc; |
| 1419 | jermar | 99 | |
| 100 | /* |
||
| 101 | * Someday, select() will do this for us. |
||
| 102 | * Just in case that day is now, and no one has |
||
| 103 | * changed this, we use a temporary. |
||
| 104 | */ |
||
| 105 | if (tvp) { |
||
| 1532 | palkovsky | 106 | (void) gettimeofday(&starttv, NULL); |
| 1419 | jermar | 107 | endtv = *tvp; |
| 108 | s = &endtv; |
||
| 109 | } else |
||
| 110 | s = NULL; |
||
| 111 | again: |
||
| 1469 | palkovsky | 112 | if (!lastchar) { |
| 113 | if (!getchar_inprog) |
||
| 114 | getchar_inprog = async_send_2(1,CONSOLE_GETCHAR,0,0,&charcall); |
||
| 1532 | palkovsky | 115 | if (!s) |
| 116 | async_wait_for(getchar_inprog, &rc); |
||
| 117 | else if (async_wait_timeout(getchar_inprog, &rc, s->tv_usec) == ETIMEOUT) { |
||
| 1469 | palkovsky | 118 | tvp->tv_sec = 0; |
| 119 | tvp->tv_usec = 0; |
||
| 120 | return (0); |
||
| 121 | } |
||
| 122 | getchar_inprog = 0; |
||
| 123 | if (rc) { |
||
| 124 | stop("end of file, help"); |
||
| 125 | } |
||
| 126 | lastchar = IPC_GET_ARG1(charcall); |
||
| 1419 | jermar | 127 | } |
| 128 | if (tvp) { |
||
| 129 | /* since there is input, we may not have timed out */ |
||
| 1532 | palkovsky | 130 | (void) gettimeofday(&endtv, NULL); |
| 1419 | jermar | 131 | TV_SUB(&endtv, &starttv); |
| 132 | TV_SUB(tvp, &endtv); /* adjust *tvp by elapsed time */ |
||
| 133 | } |
||
| 134 | return (1); |
||
| 135 | } |
||
| 136 | |||
| 137 | /* |
||
| 138 | * `sleep' for the current turn time (using select). |
||
| 139 | * Eat any input that might be available. |
||
| 140 | */ |
||
| 141 | void |
||
| 142 | tsleep(void) |
||
| 143 | { |
||
| 144 | struct timeval tv; |
||
| 145 | char c; |
||
| 146 | |||
| 147 | tv.tv_sec = 0; |
||
| 148 | tv.tv_usec = fallrate; |
||
| 149 | while (TV_POS(&tv)) |
||
| 1469 | palkovsky | 150 | if (rwait(&tv)) { |
| 151 | lastchar = '\0'; |
||
| 152 | } else |
||
| 1419 | jermar | 153 | break; |
| 154 | } |
||
| 155 | |||
| 156 | /* |
||
| 157 | * getchar with timeout. |
||
| 158 | */ |
||
| 159 | int |
||
| 160 | tgetchar(void) |
||
| 161 | { |
||
| 162 | static struct timeval timeleft; |
||
| 163 | char c; |
||
| 164 | |||
| 165 | /* |
||
| 166 | * Reset timeleft to fallrate whenever it is not positive. |
||
| 167 | * In any case, wait to see if there is any input. If so, |
||
| 168 | * take it, and update timeleft so that the next call to |
||
| 169 | * tgetchar() will not wait as long. If there is no input, |
||
| 170 | * make timeleft zero or negative, and return -1. |
||
| 171 | * |
||
| 172 | * Most of the hard work is done by rwait(). |
||
| 173 | */ |
||
| 174 | if (!TV_POS(&timeleft)) { |
||
| 175 | faster(); /* go faster */ |
||
| 176 | timeleft.tv_sec = 0; |
||
| 177 | timeleft.tv_usec = fallrate; |
||
| 178 | } |
||
| 179 | if (!rwait(&timeleft)) |
||
| 180 | return (-1); |
||
| 1469 | palkovsky | 181 | c = lastchar; |
| 182 | lastchar = '\0'; |
||
| 1419 | jermar | 183 | return ((int)(unsigned char)c); |
| 184 | } |
||
| 1653 | cejka | 185 | |
| 186 | /** @} |
||
| 187 | */ |
||
| 188 |