Subversion Repositories HelenOS

Rev

Rev 1787 | Rev 3224 | Go to most recent revision | Only display areas with differences | Ignore whitespace | Details | Blame | Last modification | View Log | RSS feed

Rev 1787 Rev 2479
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
/** @addtogroup tetris
38
/** @addtogroup tetris
39
 * @{
39
 * @{
40
 */
40
 */
41
/** @file
41
/** @file
42
 */
42
 */
43
 
43
 
44
/*
44
/*
45
 * Tetris input.
45
 * Tetris input.
46
 */
46
 */
47
 
47
 
48
#include <sys/types.h>
48
#include <sys/types.h>
49
#include <sys/time.h>
49
#include <sys/time.h>
50
#include <stdio.h>
50
#include <stdio.h>
51
 
51
 
52
#include <errno.h>
52
#include <errno.h>
53
#include <unistd.h>
53
#include <unistd.h>
54
#include <string.h>
54
#include <string.h>
55
 
55
 
56
#include "input.h"
56
#include "input.h"
57
#include "tetris.h"
57
#include "tetris.h"
58
 
58
 
59
#include <async.h>
59
#include <async.h>
60
#include "../console/console.h"
60
#include "../../srv/console/console.h"
61
 
61
 
62
/* return true iff the given timeval is positive */
62
/* return true iff the given timeval is positive */
63
#define TV_POS(tv) \
63
#define TV_POS(tv) \
64
    ((tv)->tv_sec > 0 || ((tv)->tv_sec == 0 && (tv)->tv_usec > 0))
64
    ((tv)->tv_sec > 0 || ((tv)->tv_sec == 0 && (tv)->tv_usec > 0))
65
 
65
 
66
/* subtract timeval `sub' from `res' */
66
/* subtract timeval `sub' from `res' */
67
#define TV_SUB(res, sub) \
67
#define TV_SUB(res, sub) \
68
    (res)->tv_sec -= (sub)->tv_sec; \
68
    (res)->tv_sec -= (sub)->tv_sec; \
69
    (res)->tv_usec -= (sub)->tv_usec; \
69
    (res)->tv_usec -= (sub)->tv_usec; \
70
    if ((res)->tv_usec < 0) { \
70
    if ((res)->tv_usec < 0) { \
71
        (res)->tv_usec += 1000000; \
71
        (res)->tv_usec += 1000000; \
72
        (res)->tv_sec--; \
72
        (res)->tv_sec--; \
73
    }
73
    }
74
 
74
 
75
/* We will use a hack here - if lastchar is non-zero, it is
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
76
 * the last character read. We will somehow simulate the select
77
 * semantics.
77
 * semantics.
78
 */
78
 */
79
static aid_t getchar_inprog = 0;
79
static aid_t getchar_inprog = 0;
80
static char lastchar = '\0';
80
static char lastchar = '\0';
81
 
81
 
82
/*
82
/*
83
 * Do a `read wait': select for reading from stdin, with timeout *tvp.
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.
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;
85
 * It will be positive only if input appeared before the time ran out;
86
 * otherwise it will be zero or perhaps negative.
86
 * otherwise it will be zero or perhaps negative.
87
 *
87
 *
88
 * If tvp is nil, wait forever, but return if select is interrupted.
88
 * If tvp is nil, wait forever, but return if select is interrupted.
89
 *
89
 *
90
 * Return 0 => no input, 1 => can read() from stdin
90
 * Return 0 => no input, 1 => can read() from stdin
91
 *
91
 *
92
 */
92
 */
93
int
93
int
94
rwait(struct timeval *tvp)
94
rwait(struct timeval *tvp)
95
{
95
{
96
    struct timeval starttv, endtv, *s;
96
    struct timeval starttv, endtv, *s;
97
    static ipc_call_t charcall;
97
    static ipc_call_t charcall;
98
    ipcarg_t rc;
98
    ipcarg_t rc;
99
 
99
 
100
    /*
100
    /*
101
     * Someday, select() will do this for us.
101
     * Someday, select() will do this for us.
102
     * Just in case that day is now, and no one has
102
     * Just in case that day is now, and no one has
103
     * changed this, we use a temporary.
103
     * changed this, we use a temporary.
104
     */
104
     */
105
    if (tvp) {
105
    if (tvp) {
106
        (void) gettimeofday(&starttv, NULL);
106
        (void) gettimeofday(&starttv, NULL);
107
        endtv = *tvp;
107
        endtv = *tvp;
108
        s = &endtv;
108
        s = &endtv;
109
    } else
109
    } else
110
        s = NULL;
110
        s = NULL;
111
 
111
 
112
    if (!lastchar) {
112
    if (!lastchar) {
113
        if (!getchar_inprog)
113
        if (!getchar_inprog)
114
            getchar_inprog = async_send_2(1,CONSOLE_GETCHAR,0,0,&charcall);
114
            getchar_inprog = async_send_2(1,CONSOLE_GETCHAR,0,0,&charcall);
115
        if (!s)
115
        if (!s)
116
            async_wait_for(getchar_inprog, &rc);
116
            async_wait_for(getchar_inprog, &rc);
117
        else if (async_wait_timeout(getchar_inprog, &rc, s->tv_usec) == ETIMEOUT) {
117
        else if (async_wait_timeout(getchar_inprog, &rc, s->tv_usec) == ETIMEOUT) {
118
            tvp->tv_sec = 0;
118
            tvp->tv_sec = 0;
119
            tvp->tv_usec = 0;
119
            tvp->tv_usec = 0;
120
            return (0);
120
            return (0);
121
        }
121
        }
122
        getchar_inprog = 0;
122
        getchar_inprog = 0;
123
        if (rc) {
123
        if (rc) {
124
            stop("end of file, help");
124
            stop("end of file, help");
125
        }
125
        }
126
        lastchar = IPC_GET_ARG1(charcall);
126
        lastchar = IPC_GET_ARG1(charcall);
127
    }
127
    }
128
    if (tvp) {
128
    if (tvp) {
129
        /* since there is input, we may not have timed out */
129
        /* since there is input, we may not have timed out */
130
        (void) gettimeofday(&endtv, NULL);
130
        (void) gettimeofday(&endtv, NULL);
131
        TV_SUB(&endtv, &starttv);
131
        TV_SUB(&endtv, &starttv);
132
        TV_SUB(tvp, &endtv);    /* adjust *tvp by elapsed time */
132
        TV_SUB(tvp, &endtv);    /* adjust *tvp by elapsed time */
133
    }
133
    }
134
    return (1);
134
    return (1);
135
}
135
}
136
 
136
 
137
/*
137
/*
138
 * `sleep' for the current turn time (using select).
138
 * `sleep' for the current turn time (using select).
139
 * Eat any input that might be available.
139
 * Eat any input that might be available.
140
 */
140
 */
141
void
141
void
142
tsleep(void)
142
tsleep(void)
143
{
143
{
144
    struct timeval tv;
144
    struct timeval tv;
145
 
145
 
146
    tv.tv_sec = 0;
146
    tv.tv_sec = 0;
147
    tv.tv_usec = fallrate;
147
    tv.tv_usec = fallrate;
148
    while (TV_POS(&tv))
148
    while (TV_POS(&tv))
149
        if (rwait(&tv)) {
149
        if (rwait(&tv)) {
150
            lastchar = '\0';
150
            lastchar = '\0';
151
        } else
151
        } else
152
            break;
152
            break;
153
}
153
}
154
 
154
 
155
/*
155
/*
156
 * getchar with timeout.
156
 * getchar with timeout.
157
 */
157
 */
158
int
158
int
159
tgetchar(void)
159
tgetchar(void)
160
{
160
{
161
    static struct timeval timeleft;
161
    static struct timeval timeleft;
162
    char c;
162
    char c;
163
 
163
 
164
    /*
164
    /*
165
     * Reset timeleft to fallrate whenever it is not positive.
165
     * Reset timeleft to fallrate whenever it is not positive.
166
     * In any case, wait to see if there is any input.  If so,
166
     * In any case, wait to see if there is any input.  If so,
167
     * take it, and update timeleft so that the next call to
167
     * take it, and update timeleft so that the next call to
168
     * tgetchar() will not wait as long.  If there is no input,
168
     * tgetchar() will not wait as long.  If there is no input,
169
     * make timeleft zero or negative, and return -1.
169
     * make timeleft zero or negative, and return -1.
170
     *
170
     *
171
     * Most of the hard work is done by rwait().
171
     * Most of the hard work is done by rwait().
172
     */
172
     */
173
    if (!TV_POS(&timeleft)) {
173
    if (!TV_POS(&timeleft)) {
174
        faster();   /* go faster */
174
        faster();   /* go faster */
175
        timeleft.tv_sec = 0;
175
        timeleft.tv_sec = 0;
176
        timeleft.tv_usec = fallrate;
176
        timeleft.tv_usec = fallrate;
177
    }
177
    }
178
    if (!rwait(&timeleft))
178
    if (!rwait(&timeleft))
179
        return (-1);
179
        return (-1);
180
    c = lastchar;
180
    c = lastchar;
181
    lastchar = '\0';
181
    lastchar = '\0';
182
    return ((int)(unsigned char)c);
182
    return ((int)(unsigned char)c);
183
}
183
}
184
 
184
 
185
/** @}
185
/** @}
186
 */
186
 */
187
 
187
 
188
 
188