Subversion Repositories HelenOS

Rev

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

Rev 3022 Rev 4055
1
/*  $OpenBSD: screen.c,v 1.13 2006/04/20 03:25:36 ray Exp $ */
1
/*  $OpenBSD: screen.c,v 1.13 2006/04/20 03:25:36 ray Exp $ */
2
/*  $NetBSD: screen.c,v 1.4 1995/04/29 01:11:36 mycroft Exp $   */
2
/*  $NetBSD: screen.c,v 1.4 1995/04/29 01:11:36 mycroft 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
 *  @(#)screen.c    8.1 (Berkeley) 5/31/93
35
 *  @(#)screen.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 screen control.
45
 * Tetris screen control.
46
 */
46
 */
47
 
47
 
48
#include <err.h>
48
#include <err.h>
49
#include <stdio.h>
49
#include <stdio.h>
50
#include <stdlib.h>
50
#include <stdlib.h>
51
#include <string.h>
51
#include <string.h>
52
#include <unistd.h>
52
#include <unistd.h>
53
#include <io/stream.h>
53
#include <console.h>
54
 
-
 
55
 
54
 
56
#include <async.h>
55
#include <async.h>
57
#include "screen.h"
56
#include "screen.h"
58
#include "tetris.h"
57
#include "tetris.h"
59
#include "../../srv/console/console.h"
58
#include <ipc/console.h>
60
 
59
 
61
static cell curscreen[B_SIZE];  /* 1 => standout (or otherwise marked) */
60
static cell curscreen[B_SIZE];  /* 1 => standout (or otherwise marked) */
62
static int curscore;
61
static int curscore;
63
static int isset;       /* true => terminal is in game mode */
62
static int isset;       /* true => terminal is in game mode */
64
 
63
 
65
 
64
 
66
/*
65
/*
67
 * putstr() is for unpadded strings (either as in termcap(5) or
66
 * putstr() is for unpadded strings (either as in termcap(5) or
68
 * simply literal strings);
67
 * simply literal strings);
69
 */
68
 */
70
static inline void putstr(char *s)
69
static inline void putstr(char *s)
71
{
70
{
72
    while (*s)
71
    while (*s)
73
        putchar(*(s++));
72
        putchar(*(s++));
74
}
73
}
75
 
74
 
76
static int con_phone;
-
 
77
 
-
 
78
 
-
 
79
 
-
 
80
static void set_style(int fgcolor, int bgcolor)
-
 
81
{
-
 
82
    async_msg_2(con_phone, CONSOLE_SET_STYLE, fgcolor, bgcolor);
-
 
83
}
-
 
84
 
-
 
85
static void start_standout(void)
75
static void start_standout(void)
86
{
76
{
87
    set_style(0xf0f0f0, 0);
77
    console_set_rgb_color(0xf0f0f0, 0);
88
}
78
}
89
 
79
 
90
static void resume_normal(void)
80
static void resume_normal(void)
91
{
81
{
92
    set_style(0, 0xf0f0f0);
82
    console_set_rgb_color(0, 0xf0f0f0);
93
}
83
}
94
 
84
 
95
 
-
 
96
void clear_screen(void)
85
void clear_screen(void)
97
{
86
{
98
    async_msg_0(con_phone, CONSOLE_CLEAR);
87
    console_clear();
99
    moveto(0, 0);
88
    moveto(0, 0);
100
}
89
}
101
 
90
 
102
/*
91
/*
103
 * Clear the screen, forgetting the current contents in the process.
92
 * Clear the screen, forgetting the current contents in the process.
104
 */
93
 */
105
void
94
void
106
scr_clear(void)
95
scr_clear(void)
107
{
96
{
108
 
97
 
109
    resume_normal();
98
    resume_normal();
110
    async_msg_0(con_phone, CONSOLE_CLEAR);
99
    console_clear();
111
    curscore = -1;
100
    curscore = -1;
112
    memset((char *)curscreen, 0, sizeof(curscreen));
101
    memset((char *)curscreen, 0, sizeof(curscreen));
113
}
102
}
114
 
103
 
115
/*
104
/*
116
 * Set up screen
105
 * Set up screen
117
 */
106
 */
118
void
107
void
119
scr_init(void)
108
scr_init(void)
120
{
109
{
121
    con_phone = get_cons_phone();
110
    console_cursor_visibility(0);
122
    async_msg_1(con_phone, CONSOLE_CURSOR_VISIBILITY, 0);
-
 
123
    resume_normal();
111
    resume_normal();
124
    scr_clear();
112
    scr_clear();
125
}
113
}
126
 
114
 
127
void moveto(int r, int c)
115
void moveto(int r, int c)
128
{
116
{
129
    async_msg_2(con_phone, CONSOLE_GOTO, r, c);
117
    console_goto(r, c);
130
}
118
}
131
 
119
 
132
static void fflush(void)
120
static void fflush(void)
133
{
121
{
134
    async_msg_0(con_phone, CONSOLE_FLUSH);
122
    console_flush();
135
}
123
}
136
 
124
 
137
winsize_t winsize;
125
winsize_t winsize;
138
 
126
 
139
static int get_display_size(winsize_t *ws)
127
static int get_display_size(winsize_t *ws)
140
{
128
{
141
    return async_req_0_2(con_phone, CONSOLE_GETSIZE, &ws->ws_row,
129
    return console_get_size(&ws->ws_row, &ws->ws_col);
142
        &ws->ws_col);
-
 
143
}
130
}
144
 
131
 
145
/*
132
/*
146
 * Set up screen mode.
133
 * Set up screen mode.
147
 */
134
 */
148
void
135
void
149
scr_set(void)
136
scr_set(void)
150
{
137
{
151
    winsize_t ws;
138
    winsize_t ws;
152
 
139
 
153
    Rows = 0, Cols = 0;
140
    Rows = 0, Cols = 0;
154
    if (get_display_size(&ws) == 0) {
141
    if (get_display_size(&ws) == 0) {
155
        Rows = ws.ws_row;
142
        Rows = ws.ws_row;
156
        Cols = ws.ws_col;
143
        Cols = ws.ws_col;
157
    }
144
    }
158
    if (Rows < MINROWS || Cols < MINCOLS) {
145
    if (Rows < MINROWS || Cols < MINCOLS) {
159
        char smallscr[55];
146
        char smallscr[55];
160
 
147
 
161
        snprintf(smallscr, sizeof(smallscr),
148
        snprintf(smallscr, sizeof(smallscr),
162
            "the screen is too small (must be at least %dx%d)",
149
            "the screen is too small (must be at least %dx%d)",
163
            MINROWS, MINCOLS);
150
            MINROWS, MINCOLS);
164
        stop(smallscr);
151
        stop(smallscr);
165
    }
152
    }
166
    isset = 1;
153
    isset = 1;
167
 
154
 
168
    scr_clear();
155
    scr_clear();
169
}
156
}
170
 
157
 
171
/*
158
/*
172
 * End screen mode.
159
 * End screen mode.
173
 */
160
 */
174
void
161
void
175
scr_end(void)
162
scr_end(void)
176
{
163
{
177
}
164
}
178
 
165
 
179
void
166
void
180
stop(char *why)
167
stop(char *why)
181
{
168
{
182
 
169
 
183
    if (isset)
170
    if (isset)
184
        scr_end();
171
        scr_end();
185
    errx(1, "aborting: %s", why);
172
    errx(1, "aborting: %s", why);
186
}
173
}
187
 
174
 
188
 
175
 
189
/*
176
/*
190
 * Update the screen.
177
 * Update the screen.
191
 */
178
 */
192
void
179
void
193
scr_update(void)
180
scr_update(void)
194
{
181
{
195
    cell *bp, *sp;
182
    cell *bp, *sp;
196
    cell so, cur_so = 0;
183
    cell so, cur_so = 0;
197
    int i, ccol, j;
184
    int i, ccol, j;
198
    static const struct shape *lastshape;
185
    static const struct shape *lastshape;
199
 
186
 
200
    /* always leave cursor after last displayed point */
187
    /* always leave cursor after last displayed point */
201
    curscreen[D_LAST * B_COLS - 1] = -1;
188
    curscreen[D_LAST * B_COLS - 1] = -1;
202
 
189
 
203
    if (score != curscore) {
190
    if (score != curscore) {
204
        moveto(0, 0);
191
        moveto(0, 0);
205
        printf("Score: %d", score);
192
        printf("Score: %d", score);
206
        curscore = score;
193
        curscore = score;
207
    }
194
    }
208
 
195
 
209
    /* draw preview of next pattern */
196
    /* draw preview of next pattern */
210
    if (showpreview && (nextshape != lastshape)) {
197
    if (showpreview && (nextshape != lastshape)) {
211
        int i;
198
        int i;
212
        static int r=5, c=2;
199
        static int r=5, c=2;
213
        int tr, tc, t;
200
        int tr, tc, t;
214
 
201
 
215
        lastshape = nextshape;
202
        lastshape = nextshape;
216
 
203
 
217
        /* clean */
204
        /* clean */
218
        resume_normal();
205
        resume_normal();
219
        moveto(r-1, c-1); putstr("          ");
206
        moveto(r-1, c-1); putstr("          ");
220
        moveto(r,   c-1); putstr("          ");
207
        moveto(r,   c-1); putstr("          ");
221
        moveto(r+1, c-1); putstr("          ");
208
        moveto(r+1, c-1); putstr("          ");
222
        moveto(r+2, c-1); putstr("          ");
209
        moveto(r+2, c-1); putstr("          ");
223
 
210
 
224
        moveto(r-3, c-2);
211
        moveto(r-3, c-2);
225
        putstr("Next shape:");
212
        putstr("Next shape:");
226
 
213
 
227
        /* draw */
214
        /* draw */
228
        start_standout();
215
        start_standout();
229
        moveto(r, 2 * c);
216
        moveto(r, 2 * c);
230
        putstr("  ");
217
        putstr("  ");
231
        for (i = 0; i < 3; i++) {
218
        for (i = 0; i < 3; i++) {
232
            t = c + r * B_COLS;
219
            t = c + r * B_COLS;
233
            t += nextshape->off[i];
220
            t += nextshape->off[i];
234
 
221
 
235
            tr = t / B_COLS;
222
            tr = t / B_COLS;
236
            tc = t % B_COLS;
223
            tc = t % B_COLS;
237
 
224
 
238
            moveto(tr, 2*tc);
225
            moveto(tr, 2*tc);
239
            putstr("  ");
226
            putstr("  ");
240
        }
227
        }
241
        resume_normal();
228
        resume_normal();
242
    }
229
    }
243
 
230
 
244
    bp = &board[D_FIRST * B_COLS];
231
    bp = &board[D_FIRST * B_COLS];
245
    sp = &curscreen[D_FIRST * B_COLS];
232
    sp = &curscreen[D_FIRST * B_COLS];
246
    for (j = D_FIRST; j < D_LAST; j++) {
233
    for (j = D_FIRST; j < D_LAST; j++) {
247
        ccol = -1;
234
        ccol = -1;
248
        for (i = 0; i < B_COLS; bp++, sp++, i++) {
235
        for (i = 0; i < B_COLS; bp++, sp++, i++) {
249
            if (*sp == (so = *bp))
236
            if (*sp == (so = *bp))
250
                continue;
237
                continue;
251
            *sp = so;
238
            *sp = so;
252
            if (i != ccol) {
239
            if (i != ccol) {
253
                if (cur_so) {
240
                if (cur_so) {
254
                    resume_normal();
241
                    resume_normal();
255
                    cur_so = 0;
242
                    cur_so = 0;
256
                }
243
                }
257
                moveto(RTOD(j), CTOD(i));
244
                moveto(RTOD(j), CTOD(i));
258
            }
245
            }
259
            if (so != cur_so) {
246
            if (so != cur_so) {
260
                if (so)
247
                if (so)
261
                    start_standout();
248
                    start_standout();
262
                else
249
                else
263
                    resume_normal();
250
                    resume_normal();
264
                cur_so = so;
251
                cur_so = so;
265
            }
252
            }
266
            putstr("  ");
253
            putstr("  ");
267
 
254
 
268
            ccol = i + 1;
255
            ccol = i + 1;
269
            /*
256
            /*
270
             * Look ahead a bit, to avoid extra motion if
257
             * Look ahead a bit, to avoid extra motion if
271
             * we will be redrawing the cell after the next.
258
             * we will be redrawing the cell after the next.
272
             * Motion probably takes four or more characters,
259
             * Motion probably takes four or more characters,
273
             * so we save even if we rewrite two cells
260
             * so we save even if we rewrite two cells
274
             * `unnecessarily'.  Skip it all, though, if
261
             * `unnecessarily'.  Skip it all, though, if
275
             * the next cell is a different color.
262
             * the next cell is a different color.
276
             */
263
             */
277
#define STOP (B_COLS - 3)
264
#define STOP (B_COLS - 3)
278
            if (i > STOP || sp[1] != bp[1] || so != bp[1])
265
            if (i > STOP || sp[1] != bp[1] || so != bp[1])
279
                continue;
266
                continue;
280
            if (sp[2] != bp[2])
267
            if (sp[2] != bp[2])
281
                sp[1] = -1;
268
                sp[1] = -1;
282
            else if (i < STOP && so == bp[2] && sp[3] != bp[3]) {
269
            else if (i < STOP && so == bp[2] && sp[3] != bp[3]) {
283
                sp[2] = -1;
270
                sp[2] = -1;
284
                sp[1] = -1;
271
                sp[1] = -1;
285
            }
272
            }
286
        }
273
        }
287
    }
274
    }
288
    if (cur_so)
275
    if (cur_so)
289
        resume_normal();
276
        resume_normal();
290
    fflush();
277
    fflush();
291
}
278
}
292
 
279
 
293
/*
280
/*
294
 * Write a message (set!=0), or clear the same message (set==0).
281
 * Write a message (set!=0), or clear the same message (set==0).
295
 * (We need its length in case we have to overwrite with blanks.)
282
 * (We need its length in case we have to overwrite with blanks.)
296
 */
283
 */
297
void
284
void
298
scr_msg(char *s, int set)
285
scr_msg(char *s, int set)
299
{
286
{
300
   
287
   
301
    int l = strlen(s);
288
    int l = strlen(s);
302
   
289
   
303
    moveto(Rows - 2, ((Cols - l) >> 1) - 1);
290
    moveto(Rows - 2, ((Cols - l) >> 1) - 1);
304
    if (set)
291
    if (set)
305
        putstr(s);
292
        putstr(s);
306
    else
293
    else
307
        while (--l >= 0)
294
        while (--l >= 0)
308
            (void) putchar(' ');
295
            (void) putchar(' ');
309
}
296
}
310
 
297
 
311
/** @}
298
/** @}
312
 */
299
 */
313
 
300
 
314
 
301