WebSVN – HelenOS-historic – Diff – /uspace/trunk/tetris/input.c


/*  $OpenBSD: input.c,v 1.12 2005/04/13 02:33:08 deraadt Exp $  */
/*    $NetBSD: input.c,v 1.3 1996/02/06 22:47:33 jtc Exp $    */
 
/*-
 * Copyright (c) 1992, 1993
 *  The Regents of the University of California.  All rights reserved.
 *
 * This code is derived from software contributed to Berkeley by
 * Chris Torek and Darren F. Provine.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions
 * are met:
 * 1. Redistributions of source code must retain the above copyright
 *    notice, this list of conditions and the following disclaimer.
 * 2. Redistributions in binary form must reproduce the above copyright
 *    notice, this list of conditions and the following disclaimer in the
 *    documentation and/or other materials provided with the distribution.
 * 3. Neither the name of the University nor the names of its contributors
 *    may be used to endorse or promote products derived from this software
 *    without specific prior written permission.
 *
 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
 * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
 * SUCH DAMAGE.
 *
 *  @(#)input.c 8.1 (Berkeley) 5/31/93
 */
 
/*
 * Tetris input.
 */
 
#include <sys/types.h>
#include <sys/time.h>
 
#include <errno.h>
#include <unistd.h>
#include <string.h>
 
#include "input.h"
#include "tetris.h"
 
#include <async.h>
#include "../console/console.h"
 
/* return true iff the given timeval is positive */
#define TV_POS(tv) \
    ((tv)->tv_sec > 0 || ((tv)->tv_sec == 0 && (tv)->tv_usec > 0))
 
/* subtract timeval `sub' from `res' */
#define TV_SUB(res, sub) \
    (res)->tv_sec -= (sub)->tv_sec; \
    (res)->tv_usec -= (sub)->tv_usec; \
    if ((res)->tv_usec < 0) { \
        (res)->tv_usec += 1000000; \
        (res)->tv_sec--; \
    }
 
/* We will use a hack here - if lastchar is non-zero, it is
 * the last character read. We will somehow simulate the select
 * semantics.
 */
static aid_t getchar_inprog = 0;
static char lastchar = '\0';
 
/*
 * Do a `read wait': select for reading from stdin, with timeout *tvp.
 * On return, modify *tvp to reflect the amount of time spent waiting.
 * It will be positive only if input appeared before the time ran out;
 * otherwise it will be zero or perhaps negative.
 *
 * If tvp is nil, wait forever, but return if select is interrupted.
 *
 * Return 0 => no input, 1 => can read() from stdin
 *
 */
int
rwait(struct timeval *tvp)
{
    struct timeval starttv, endtv, *s;
    static ipc_call_t charcall;
    int rc;
 
#define NILTZ ((struct timezone *)0)
 
    /*
     * Someday, select() will do this for us.
     * Just in case that day is now, and no one has
     * changed this, we use a temporary.
     */
    if (tvp) {
        (void) gettimeofday(&starttv, NILTZ);
        endtv = *tvp;
        s = &endtv;
    } else
        s = NULL;
again:
    if (!lastchar) {
        if (!getchar_inprog)
            getchar_inprog = async_send_2(1,CONSOLE_GETCHAR,0,0,&charcall);
        if (async_wait_timeout(getchar_inprog, &rc, s->tv_usec) == ETIMEOUT) {
 
            tvp->tv_sec = 0;
            tvp->tv_usec = 0;
            return (0);
        }
        getchar_inprog = 0;
        if (rc) {
            stop("end of file, help");
 
        }
        lastchar = IPC_GET_ARG1(charcall);
 
 
 
    }
    if (tvp) {
        /* since there is input, we may not have timed out */
        (void) gettimeofday(&endtv, NILTZ);
        TV_SUB(&endtv, &starttv);
        TV_SUB(tvp, &endtv);    /* adjust *tvp by elapsed time */
    }
    return (1);
}
 
/*
 * `sleep' for the current turn time (using select).
 * Eat any input that might be available.
 */
void
tsleep(void)
{
    struct timeval tv;
    char c;
 
    tv.tv_sec = 0;
    tv.tv_usec = fallrate;
    while (TV_POS(&tv))
        if (rwait(&tv)) {
            lastchar = '\0';
        } else
            break;
}
 
/*
 * getchar with timeout.
 */
int
tgetchar(void)
{
    static struct timeval timeleft;
    char c;
 
    /*
     * Reset timeleft to fallrate whenever it is not positive.
     * In any case, wait to see if there is any input.  If so,
     * take it, and update timeleft so that the next call to
     * tgetchar() will not wait as long.  If there is no input,
     * make timeleft zero or negative, and return -1.
     *
     * Most of the hard work is done by rwait().
     */
    if (!TV_POS(&timeleft)) {
        faster();   /* go faster */
        timeleft.tv_sec = 0;
        timeleft.tv_usec = fallrate;
    }
    if (!rwait(&timeleft))
        return (-1);
    c = lastchar;
    lastchar = '\0';
    return ((int)(unsigned char)c);
}
 

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

Subversion Repositories HelenOS-historic

(root)/uspace/trunk/tetris/input.c @ 1720 – Rev 1466 → 1469