source: mainline/uspace/app/tetris/tetris.c@ 79ae36dd

lfn serial ticket/834-toolchain-update topic/msim-upgrade topic/simplify-dev-export
Last change on this file since 79ae36dd was 79ae36dd, checked in by Martin Decky <martin@…>, 14 years ago

new async framework with integrated exchange tracking

  • strict isolation between low-level IPC and high-level async framework with integrated exchange tracking
    • each IPC connection is represented by an async_sess_t structure
    • each IPC exchange is represented by an async_exch_t structure
    • exchange management is either based on atomic messages (EXCHANGE_ATOMIC), locking (EXCHANGE_SERIALIZE) or connection cloning (EXCHANGE_CLONE)
  • async_obsolete: temporary compatibility layer to keep old async clients working (several pieces of code are currently broken, but only non-essential functionality)
  • IPC_M_PHONE_HANGUP is now method no. 0 (for elegant boolean evaluation)
  • IPC_M_DEBUG_ALL has been renamed to IPC_M_DEBUG
  • IPC_M_PING has been removed (VFS protocol now has VFS_IN_PING)
  • console routines in libc have been rewritten for better abstraction
  • additional use for libc-private header files (FILE structure opaque to the client)
  • various cstyle changes (typos, indentation, missing externs in header files, improved comments, etc.)
  • Property mode set to 100644
File size: 8.6 KB
RevLine 
[79ae36dd]1/*
2 * Copyright (c) 2011 Martin Decky
3 * All rights reserved.
[e9a3c52]4 *
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
7 * are met:
8 *
[79ae36dd]9 * - Redistributions of source code must retain the above copyright
10 * notice, this list of conditions and the following disclaimer.
11 * - Redistributions in binary form must reproduce the above copyright
12 * notice, this list of conditions and the following disclaimer in the
13 * documentation and/or other materials provided with the distribution.
14 * - The name of the author may not be used to endorse or promote products
15 * derived from this software without specific prior written permission.
16 *
17 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
18 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
19 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
20 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
21 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
22 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
23 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
24 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
25 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
26 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
27 */
28
29/** Attributations
30 *
31 * tetris.c 8.1 (Berkeley) 5/31/93
32 * NetBSD: tetris.c,v 1.2 1995/04/22 07:42:47 cgd
33 * OpenBSD: tetris.c,v 1.21 2006/04/20 03:24:12 ray
34 *
35 * Based upon BSD Tetris
36 *
37 * Copyright (c) 1992, 1993
38 * The Regents of the University of California.
39 * Distributed under BSD license.
40 *
41 * This code is derived from software contributed to Berkeley by
42 * Chris Torek and Darren F. Provine.
[e9a3c52]43 *
44 */
45
[b2951e2]46/** @addtogroup tetris Tetris
[ebe70f1]47 * @brief Tetris ported from OpenBSD
48 * @{
[b2951e2]49 */
50/** @file
51 */
52
[e9a3c52]53static const char copyright[] =
[ebe70f1]54 "@(#) Copyright (c) 1992, 1993\n"
55 "\tThe Regents of the University of California. All rights reserved.\n";
[e9a3c52]56
57#include <sys/time.h>
58#include <sys/types.h>
59#include <err.h>
[d4b9d28]60#include <errno.h>
[e9a3c52]61#include <stdio.h>
62#include <stdlib.h>
[19f857a]63#include <str.h>
[e9a3c52]64#include <unistd.h>
[ebe70f1]65#include <getopt.h>
[e9a3c52]66#include "scores.h"
67#include "screen.h"
68#include "tetris.h"
69
[ebe70f1]70cell board[B_SIZE];
71
72int Rows;
73int Cols;
74
[e9a3c52]75const struct shape *curshape;
76const struct shape *nextshape;
77
[ebe70f1]78long fallrate;
79int score;
80char key_msg[100];
81int showpreview;
82int classic;
83
84static void elide(void);
85static void setup_board(void);
86static const struct shape *randshape(void);
87
88static void usage(void);
89
90static int firstgame = 1;
[e9a3c52]91
92/*
[ebe70f1]93 * Set up the initial board. The bottom display row is completely set,
94 * along with another (hidden) row underneath that. Also, the left and
[e9a3c52]95 * right edges are set.
96 */
[ebe70f1]97static void setup_board(void)
[e9a3c52]98{
99 int i;
[ebe70f1]100 cell *p = board;
101
[e9a3c52]102 for (i = B_SIZE; i; i--)
[ebe70f1]103 *p++ = (i <= (2 * B_COLS) || (i % B_COLS) < 2) ? 0x0000ff : 0x000000;
[e9a3c52]104}
105
106/*
107 * Elide any full active rows.
108 */
[ebe70f1]109static void elide(void)
[e9a3c52]110{
111 int rows = 0;
[ebe70f1]112 int i;
113 int j;
114 int base;
[e9a3c52]115 cell *p;
[ebe70f1]116
[e9a3c52]117 for (i = A_FIRST; i < A_LAST; i++) {
118 base = i * B_COLS + 1;
119 p = &board[base];
120 for (j = B_COLS - 2; *p++ != 0;) {
121 if (--j <= 0) {
[ebe70f1]122 /* This row is to be elided */
[e9a3c52]123 rows++;
[ebe70f1]124 memset(&board[base], 0, sizeof(cell) * (B_COLS - 2));
125
[e9a3c52]126 scr_update();
127 tsleep();
[ebe70f1]128
[e9a3c52]129 while (--base != 0)
130 board[base + B_COLS] = board[base];
[ebe70f1]131
[e9a3c52]132 scr_update();
133 tsleep();
[ebe70f1]134
[e9a3c52]135 break;
136 }
137 }
138 }
[ebe70f1]139
[e9a3c52]140 switch (rows) {
141 case 1:
142 score += 10;
143 break;
144 case 2:
145 score += 30;
146 break;
147 case 3:
148 score += 70;
149 break;
150 case 4:
151 score += 150;
152 break;
153 default:
154 break;
155 }
156}
157
[ebe70f1]158const struct shape *randshape(void)
[e9a3c52]159{
[ebe70f1]160 const struct shape *tmp = &shapes[random() % 7];
161 int i;
162 int j = random() % 4;
163
[e9a3c52]164 for (i = 0; i < j; i++)
[ebe70f1]165 tmp = &shapes[classic ? tmp->rotc : tmp->rot];
166
[e9a3c52]167 return (tmp);
168}
[c594489]169
170static void srandomdev(void)
171{
172 struct timeval tv;
[ebe70f1]173
[c594489]174 gettimeofday(&tv, NULL);
175 srandom(tv.tv_sec + tv.tv_usec / 100000);
176}
[e9a3c52]177
[9996ed5]178static void tetris_menu_draw(int level)
179{
[ebe70f1]180 clear_screen();
181 moveto(5, 10);
182 puts("Tetris\n\n");
183
184 moveto(8, 10);
185 printf("Level = %d (press keys 1 - 9 to change)", level);
186 moveto(9, 10);
187 printf("Preview is %s (press 'p' to change)", (showpreview ? "on ": "off"));
188 moveto(12, 10);
189 printf("Press 'h' to show hiscore table.");
190 moveto(13, 10);
191 printf("Press 's' to start game.");
192 moveto(14, 10);
193 printf("Press 'q' to quit game.");
194 moveto(20, 10);
195 printf("In game controls:");
196 moveto(21, 0);
197 puts(key_msg);
[9996ed5]198}
199
[ebe70f1]200static int tetris_menu(int *level)
[9996ed5]201{
202 tetris_menu_draw(*level);
203 while (1) {
[ebe70f1]204 int i = getchar();
[9996ed5]205
206 switch(i) {
207 case 'p':
208 showpreview = !showpreview;
[ebe70f1]209 moveto(9, 21);
[9996ed5]210 if (showpreview)
211 printf("on ");
212 else
213 printf("off");
214 break;
215 case 'h':
[d4b9d28]216 loadscores();
[9996ed5]217 showscores(firstgame);
218 tetris_menu_draw(*level);
219 break;
220 case 's':
221 firstgame = 0;
222 return 1;
223 case 'q':
224 return 0;
225 case '1':
226 case '2':
227 case '3':
228 case '4':
229 case '5':
[ebe70f1]230 case '6':
[9996ed5]231 case '7':
232 case '8':
233 case '9':
234 *level = i - '0';
[ebe70f1]235 moveto(8, 18);
[9996ed5]236 printf("%d", *level);
237 break;
238 }
239 }
240}
241
[ebe70f1]242int main(int argc, char *argv[])
[e9a3c52]243{
[ebe70f1]244 int pos;
245 int c;
[a405563]246 const char *keys;
[e9a3c52]247 int level = 2;
248 char key_write[6][10];
[ebe70f1]249 int i;
250 int j;
251 int ch;
252
[79ae36dd]253 console = console_init(stdin, stdout);
254
[e9a3c52]255 keys = "jkl pq";
[ebe70f1]256
[9996ed5]257 classic = 0;
[79ae36dd]258 showpreview = 1;
[237867d]259
[ebe70f1]260 while ((ch = getopt(argc, argv, "ck:ps")) != -1)
261 switch(ch) {
262 case 'c':
263 /*
264 * this means:
265 * - rotate the other way
266 * - no reverse video
267 */
268 classic = 1;
269 break;
270 case 'k':
271 if (str_size(keys = optarg) != 6)
272 usage();
273 break;
274 case 'p':
275 showpreview = 1;
276 break;
277 case 's':
278 showscores(0);
279 exit(0);
280 default:
281 usage();
282 }
283
284 argc -= optind;
285 argv += optind;
286
287 if (argc)
288 usage();
289
[e9a3c52]290 for (i = 0; i <= 5; i++) {
[ebe70f1]291 for (j = i + 1; j <= 5; j++) {
[e9a3c52]292 if (keys[i] == keys[j])
293 errx(1, "duplicate command keys specified.");
294 }
[ebe70f1]295
[e9a3c52]296 if (keys[i] == ' ')
[ebe70f1]297 str_cpy(key_write[i], sizeof(key_write[i]), "<space>");
[e9a3c52]298 else {
299 key_write[i][0] = keys[i];
300 key_write[i][1] = '\0';
301 }
302 }
[ebe70f1]303
304 snprintf(key_msg, sizeof(key_msg),
305 "%s - left %s - rotate %s - right %s - drop %s - pause %s - quit",
306 key_write[0], key_write[1], key_write[2], key_write[3],
307 key_write[4], key_write[5]);
308
[9996ed5]309 scr_init();
[d4b9d28]310 if (loadscores() != EOK)
311 initscores();
312
[9996ed5]313 while (tetris_menu(&level)) {
[237867d]314 fallrate = 1000000 / level;
315
[9996ed5]316 scr_clear();
317 setup_board();
[ebe70f1]318
[9996ed5]319 srandomdev();
320 scr_set();
[ebe70f1]321
322 pos = A_FIRST * B_COLS + (B_COLS / 2) - 1;
[9996ed5]323 nextshape = randshape();
324 curshape = randshape();
[ebe70f1]325
[9996ed5]326 scr_msg(key_msg, 1);
[ebe70f1]327
328 while (1) {
[9996ed5]329 place(curshape, pos, 1);
330 scr_update();
331 place(curshape, pos, 0);
332 c = tgetchar();
333 if (c < 0) {
334 /*
335 * Timeout. Move down if possible.
336 */
337 if (fits_in(curshape, pos + B_COLS)) {
338 pos += B_COLS;
339 continue;
340 }
[ebe70f1]341
[9996ed5]342 /*
343 * Put up the current shape `permanently',
344 * bump score, and elide any full rows.
345 */
346 place(curshape, pos, 1);
347 score++;
348 elide();
[ebe70f1]349
[9996ed5]350 /*
351 * Choose a new shape. If it does not fit,
352 * the game is over.
353 */
354 curshape = nextshape;
355 nextshape = randshape();
[ebe70f1]356 pos = A_FIRST * B_COLS + (B_COLS / 2) - 1;
357
[9996ed5]358 if (!fits_in(curshape, pos))
359 break;
[ebe70f1]360
[e9a3c52]361 continue;
362 }
[ebe70f1]363
[e9a3c52]364 /*
[9996ed5]365 * Handle command keys.
[e9a3c52]366 */
[9996ed5]367 if (c == keys[5]) {
368 /* quit */
[e9a3c52]369 break;
370 }
[ebe70f1]371
[9996ed5]372 if (c == keys[4]) {
373 static char msg[] =
374 "paused - press RETURN to continue";
[ebe70f1]375
[9996ed5]376 place(curshape, pos, 1);
377 do {
378 scr_update();
379 scr_msg(key_msg, 0);
380 scr_msg(msg, 1);
[79ae36dd]381 console_flush(console);
382 } while (!twait());
[ebe70f1]383
[9996ed5]384 scr_msg(msg, 0);
385 scr_msg(key_msg, 1);
386 place(curshape, pos, 0);
387 continue;
388 }
[ebe70f1]389
[9996ed5]390 if (c == keys[0]) {
391 /* move left */
392 if (fits_in(curshape, pos - 1))
393 pos--;
394 continue;
395 }
[ebe70f1]396
[9996ed5]397 if (c == keys[1]) {
398 /* turn */
[ebe70f1]399 const struct shape *new =
400 &shapes[classic ? curshape->rotc : curshape->rot];
401
[9996ed5]402 if (fits_in(new, pos))
403 curshape = new;
404 continue;
405 }
[ebe70f1]406
[9996ed5]407 if (c == keys[2]) {
408 /* move right */
409 if (fits_in(curshape, pos + 1))
410 pos++;
411 continue;
412 }
[ebe70f1]413
[9996ed5]414 if (c == keys[3]) {
415 /* move to bottom */
416 while (fits_in(curshape, pos + B_COLS)) {
417 pos += B_COLS;
418 score++;
419 }
420 continue;
421 }
[ebe70f1]422
[9996ed5]423 if (c == '\f') {
424 scr_clear();
425 scr_msg(key_msg, 1);
426 }
427 }
428
429 scr_clear();
[d4b9d28]430 loadscores();
[9996ed5]431 insertscore(score, level);
[d4b9d28]432 savescores();
[ebe70f1]433 score = 0;
[0aa024b1]434 }
435
436 scr_clear();
[ebe70f1]437 printf("\nGame over.\n");
[9996ed5]438 scr_end();
[ebe70f1]439
[501a8ba]440 return 0;
[e9a3c52]441}
442
[ebe70f1]443void usage(void)
[e9a3c52]444{
[ebe70f1]445 fprintf(stderr, "usage: tetris [-ps] [-k keys]\n");
[e9a3c52]446 exit(1);
447}
[b2951e2]448
449/** @}
450 */
Note: See TracBrowser for help on using the repository browser.