source: mainline/uspace/dist/src/c/demos/tetris/tetris.c@ 84239b1

lfn serial ticket/834-toolchain-update topic/msim-upgrade topic/simplify-dev-export
Last change on this file since 84239b1 was 84239b1, checked in by Jiri Svoboda <jiri@…>, 7 years ago

And there was much fixing.
  • Property mode set to 100644
File size: 8.5 KB
Line 
1/*
2 * Copyright (c) 2011 Martin Decky
3 * All rights reserved.
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 *
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.
43 *
44 */
45
46/** @addtogroup tetris Tetris
47 * @brief Tetris ported from OpenBSD
48 * @{
49 */
50/** @file
51 */
52
53static volatile const char copyright[] =
54 "@(#) Copyright (c) 1992, 1993\n"
55 "\tThe Regents of the University of California. All rights reserved.\n";
56
57#include <sys/time.h>
58#include <err.h>
59#include <errno.h>
60#include <stdio.h>
61#include <stdlib.h>
62#include <stdint.h>
63#include <str.h>
64#include <getopt.h>
65#include "scores.h"
66#include "screen.h"
67#include "tetris.h"
68
69cell board[B_SIZE];
70
71int Rows;
72int Cols;
73
74const struct shape *curshape;
75const struct shape *nextshape;
76
77long fallrate;
78int score;
79char key_msg[100];
80int showpreview;
81int classic;
82
83static void elide(void);
84static void setup_board(void);
85static const struct shape *randshape(void);
86
87static void usage(void);
88
89static int firstgame = 1;
90
91/*
92 * Set up the initial board. The bottom display row is completely set,
93 * along with another (hidden) row underneath that. Also, the left and
94 * right edges are set.
95 */
96static void setup_board(void)
97{
98 int i;
99 cell *p = board;
100
101 for (i = B_SIZE; i; i--)
102 *p++ = (i <= (2 * B_COLS) || (i % B_COLS) < 2) ? 0x0000ff : 0x000000;
103}
104
105/*
106 * Elide any full active rows.
107 */
108static void elide(void)
109{
110 int rows = 0;
111 int i;
112 int j;
113 int base;
114 cell *p;
115
116 for (i = A_FIRST; i < A_LAST; i++) {
117 base = i * B_COLS + 1;
118 p = &board[base];
119 j = B_COLS - 2;
120 while (*p++ != 0) {
121 if (--j <= 0) {
122 /* This row is to be elided */
123 rows++;
124 memset(&board[base], 0, sizeof(cell) * (B_COLS - 2));
125
126 scr_update();
127 tsleep();
128
129 while (--base != 0)
130 board[base + B_COLS] = board[base];
131
132 scr_update();
133 tsleep();
134
135 break;
136 }
137 }
138 }
139
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
158const struct shape *randshape(void)
159{
160 const struct shape *tmp = &shapes[rand() % 7];
161 int i;
162 int j = rand() % 4;
163
164 for (i = 0; i < j; i++)
165 tmp = &shapes[classic ? tmp->rotc : tmp->rot];
166
167 return (tmp);
168}
169
170static void srandomdev(void)
171{
172 struct timeval tv;
173
174 gettimeofday(&tv, NULL);
175 srand(tv.tv_sec + tv.tv_usec / 100000);
176}
177
178static void tetris_menu_draw(int level)
179{
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);
198}
199
200static int tetris_menu(int *level)
201{
202 tetris_menu_draw(*level);
203 while (1) {
204 int i = getchar();
205
206 switch(i) {
207 case 'p':
208 showpreview = !showpreview;
209 moveto(9, 21);
210 if (showpreview)
211 printf("on ");
212 else
213 printf("off");
214 break;
215 case 'h':
216 loadscores();
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':
230 case '6':
231 case '7':
232 case '8':
233 case '9':
234 *level = i - '0';
235 moveto(8, 18);
236 printf("%d", *level);
237 break;
238 }
239 }
240}
241
242int main(int argc, char *argv[])
243{
244 int pos;
245 int c;
246 const char *keys;
247 int level = 2;
248 char key_write[6][10];
249 int i;
250 int j;
251 int ch;
252
253 console = console_init(stdin, stdout);
254
255 keys = "jkl pq";
256
257 classic = 0;
258 showpreview = 1;
259
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
290 for (i = 0; i <= 5; i++) {
291 for (j = i + 1; j <= 5; j++) {
292 if (keys[i] == keys[j])
293 errx(1, "%s", "duplicate command keys specified.");
294 }
295
296 if (keys[i] == ' ')
297 str_cpy(key_write[i], sizeof(key_write[i]), "<space>");
298 else {
299 key_write[i][0] = keys[i];
300 key_write[i][1] = '\0';
301 }
302 }
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
309 scr_init();
310 if (loadscores() != EOK)
311 initscores();
312
313 while (tetris_menu(&level)) {
314 fallrate = 1000000 / level;
315
316 scr_clear();
317 setup_board();
318
319 srandomdev();
320 scr_set();
321
322 pos = A_FIRST * B_COLS + (B_COLS / 2) - 1;
323 nextshape = randshape();
324 curshape = randshape();
325
326 scr_msg(key_msg, 1);
327
328 while (1) {
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 }
341
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();
349
350 /*
351 * Choose a new shape. If it does not fit,
352 * the game is over.
353 */
354 curshape = nextshape;
355 nextshape = randshape();
356 pos = A_FIRST * B_COLS + (B_COLS / 2) - 1;
357
358 if (!fits_in(curshape, pos))
359 break;
360
361 continue;
362 }
363
364 /*
365 * Handle command keys.
366 */
367 if (c == keys[5]) {
368 /* quit */
369 break;
370 }
371
372 if (c == keys[4]) {
373 static char msg[] =
374 "paused - press RETURN to continue";
375
376 place(curshape, pos, 1);
377 do {
378 scr_update();
379 scr_msg(key_msg, 0);
380 scr_msg(msg, 1);
381 console_flush(console);
382 } while (!twait());
383
384 scr_msg(msg, 0);
385 scr_msg(key_msg, 1);
386 place(curshape, pos, 0);
387 continue;
388 }
389
390 if (c == keys[0]) {
391 /* move left */
392 if (fits_in(curshape, pos - 1))
393 pos--;
394 continue;
395 }
396
397 if (c == keys[1]) {
398 /* turn */
399 const struct shape *new =
400 &shapes[classic ? curshape->rotc : curshape->rot];
401
402 if (fits_in(new, pos))
403 curshape = new;
404 continue;
405 }
406
407 if (c == keys[2]) {
408 /* move right */
409 if (fits_in(curshape, pos + 1))
410 pos++;
411 continue;
412 }
413
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 }
422
423 if (c == '\f') {
424 scr_clear();
425 scr_msg(key_msg, 1);
426 }
427 }
428
429 scr_clear();
430 loadscores();
431 insertscore(score, level);
432 savescores();
433 score = 0;
434 }
435
436 scr_clear();
437 printf("\nGame over.\n");
438 scr_end();
439
440 return 0;
441}
442
443void usage(void)
444{
445 fprintf(stderr, "usage: tetris [-ps] [-k keys]\n");
446 exit(1);
447}
448
449/** @}
450 */
Note: See TracBrowser for help on using the repository browser.