source: mainline/tetris/tetris.c@ f25b73d6

lfn serial ticket/834-toolchain-update topic/msim-upgrade topic/simplify-dev-export
Last change on this file since f25b73d6 was f25b73d6, checked in by Ondrej Palkovsky <ondrap@…>, 19 years ago

Started porting tetris.
  • Property mode set to 100644
File size: 8.0 KB
Line 
1/* $OpenBSD: tetris.c,v 1.21 2006/04/20 03:24:12 ray Exp $ */
2/* $NetBSD: tetris.c,v 1.2 1995/04/22 07:42:47 cgd Exp $ */
3
4/*-
5 * Copyright (c) 1992, 1993
6 * The Regents of the University of California. All rights reserved.
7 *
8 * This code is derived from software contributed to Berkeley by
9 * Chris Torek and Darren F. Provine.
10 *
11 * Redistribution and use in source and binary forms, with or without
12 * modification, are permitted provided that the following conditions
13 * are met:
14 * 1. Redistributions of source code must retain the above copyright
15 * notice, this list of conditions and the following disclaimer.
16 * 2. Redistributions in binary form must reproduce the above copyright
17 * notice, this list of conditions and the following disclaimer in the
18 * documentation and/or other materials provided with the distribution.
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
21 * without specific prior written permission.
22 *
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
25 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
26 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
27 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
28 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
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
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
33 * SUCH DAMAGE.
34 *
35 * @(#)tetris.c 8.1 (Berkeley) 5/31/93
36 */
37
38#ifndef lint
39static const char copyright[] =
40"@(#) Copyright (c) 1992, 1993\n\
41 The Regents of the University of California. All rights reserved.\n";
42#endif /* not lint */
43
44/*
45 * Tetris (or however it is spelled).
46 */
47
48#include <sys/param.h>
49#include <sys/time.h>
50#include <sys/types.h>
51
52#include <err.h>
53//#include <signal.h>
54#include <stdio.h>
55#include <stdlib.h>
56#include <string.h>
57#include <unistd.h>
58
59#include "input.h"
60#include "scores.h"
61#include "screen.h"
62#include "tetris.h"
63
64cell board[B_SIZE];
65int Rows, Cols;
66const struct shape *curshape;
67const struct shape *nextshape;
68long fallrate;
69int score;
70//gid_t gid, egid;
71char key_msg[100];
72int showpreview, classic;
73
74static void elide(void);
75static void setup_board(void);
76const struct shape *randshape(void);
77void onintr(int);
78void usage(void);
79
80/*
81 * Set up the initial board. The bottom display row is completely set,
82 * along with another (hidden) row underneath that. Also, the left and
83 * right edges are set.
84 */
85static void
86setup_board(void)
87{
88 int i;
89 cell *p;
90
91 p = board;
92 for (i = B_SIZE; i; i--)
93 *p++ = i <= (2 * B_COLS) || (i % B_COLS) < 2;
94}
95
96/*
97 * Elide any full active rows.
98 */
99static void
100elide(void)
101{
102 int rows = 0;
103 int i, j, base;
104 cell *p;
105
106 for (i = A_FIRST; i < A_LAST; i++) {
107 base = i * B_COLS + 1;
108 p = &board[base];
109 for (j = B_COLS - 2; *p++ != 0;) {
110 if (--j <= 0) {
111 /* this row is to be elided */
112 rows++;
113 memset(&board[base], 0, B_COLS - 2);
114 scr_update();
115 tsleep();
116 while (--base != 0)
117 board[base + B_COLS] = board[base];
118 scr_update();
119 tsleep();
120 break;
121 }
122 }
123 }
124 switch (rows) {
125 case 1:
126 score += 10;
127 break;
128 case 2:
129 score += 30;
130 break;
131 case 3:
132 score += 70;
133 break;
134 case 4:
135 score += 150;
136 break;
137 default:
138 break;
139 }
140}
141
142const struct shape *
143randshape(void)
144{
145 const struct shape *tmp;
146 int i, j;
147
148 tmp = &shapes[random() % 7];
149 j = random() % 4;
150 for (i = 0; i < j; i++)
151 tmp = &shapes[classic? tmp->rotc : tmp->rot];
152 return (tmp);
153}
154
155
156int
157main(int argc, char *argv[])
158{
159 int pos, c;
160 char *keys;
161 int level = 2;
162 char key_write[6][10];
163 const char *errstr;
164 int ch, i, j;
165
166 keys = "jkl pq";
167
168// gid = getgid();
169// egid = getegid();
170// setegid(gid);
171
172 classic = showpreview = 0;
173
174/* while ((ch = getopt(argc, argv, "ck:l:ps")) != -1) */
175/* switch(ch) { */
176/* case 'c': */
177/* /\* */
178/* * this means: */
179/* * - rotate the other way; */
180/* * - no reverse video. */
181/* *\/ */
182/* classic = 1; */
183/* break; */
184/* case 'k': */
185/* if (strlen(keys = optarg) != 6) */
186/* usage(); */
187/* break; */
188/* case 'l': */
189/* level = (int)strtonum(optarg, MINLEVEL, MAXLEVEL, */
190/* &errstr); */
191/* if (errstr) */
192/* errx(1, "level must be from %d to %d", */
193/* MINLEVEL, MAXLEVEL); */
194/* break; */
195/* case 'p': */
196/* showpreview = 1; */
197/* break; */
198/* case 's': */
199/* showscores(0); */
200/* exit(0); */
201/* default: */
202/* usage(); */
203/* } */
204
205/* argc -= optind; */
206/* argv += optind; */
207
208/* if (argc) */
209/* usage(); */
210
211 fallrate = 1000000 / level;
212
213 for (i = 0; i <= 5; i++) {
214 for (j = i+1; j <= 5; j++) {
215 if (keys[i] == keys[j])
216 errx(1, "duplicate command keys specified.");
217 }
218 if (keys[i] == ' ')
219 strlcpy(key_write[i], "<space>", sizeof key_write[i]);
220 else {
221 key_write[i][0] = keys[i];
222 key_write[i][1] = '\0';
223 }
224 }
225
226 snprintf(key_msg, sizeof key_msg,
227"%s - left %s - rotate %s - right %s - drop %s - pause %s - quit",
228 key_write[0], key_write[1], key_write[2], key_write[3],
229 key_write[4], key_write[5]);
230
231// (void)signal(SIGINT, onintr);
232 scr_init();
233 setup_board();
234
235 srandomdev();
236 scr_set();
237
238 pos = A_FIRST*B_COLS + (B_COLS/2)-1;
239 nextshape = randshape();
240 curshape = randshape();
241
242 scr_msg(key_msg, 1);
243
244 for (;;) {
245 place(curshape, pos, 1);
246 scr_update();
247 place(curshape, pos, 0);
248 c = tgetchar();
249 if (c < 0) {
250 /*
251 * Timeout. Move down if possible.
252 */
253 if (fits_in(curshape, pos + B_COLS)) {
254 pos += B_COLS;
255 continue;
256 }
257
258 /*
259 * Put up the current shape `permanently',
260 * bump score, and elide any full rows.
261 */
262 place(curshape, pos, 1);
263 score++;
264 elide();
265
266 /*
267 * Choose a new shape. If it does not fit,
268 * the game is over.
269 */
270 curshape = nextshape;
271 nextshape = randshape();
272 pos = A_FIRST*B_COLS + (B_COLS/2)-1;
273 if (!fits_in(curshape, pos))
274 break;
275 continue;
276 }
277
278 /*
279 * Handle command keys.
280 */
281 if (c == keys[5]) {
282 /* quit */
283 break;
284 }
285 if (c == keys[4]) {
286 static char msg[] =
287 "paused - press RETURN to continue";
288
289 place(curshape, pos, 1);
290 do {
291 scr_update();
292 scr_msg(key_msg, 0);
293 scr_msg(msg, 1);
294 (void) fflush(stdout);
295 } while (rwait((struct timeval *)NULL) == -1);
296 scr_msg(msg, 0);
297 scr_msg(key_msg, 1);
298 place(curshape, pos, 0);
299 continue;
300 }
301 if (c == keys[0]) {
302 /* move left */
303 if (fits_in(curshape, pos - 1))
304 pos--;
305 continue;
306 }
307 if (c == keys[1]) {
308 /* turn */
309 const struct shape *new = &shapes[
310 classic? curshape->rotc : curshape->rot];
311
312 if (fits_in(new, pos))
313 curshape = new;
314 continue;
315 }
316 if (c == keys[2]) {
317 /* move right */
318 if (fits_in(curshape, pos + 1))
319 pos++;
320 continue;
321 }
322 if (c == keys[3]) {
323 /* move to bottom */
324 while (fits_in(curshape, pos + B_COLS)) {
325 pos += B_COLS;
326 score++;
327 }
328 continue;
329 }
330 if (c == '\f') {
331 scr_clear();
332 scr_msg(key_msg, 1);
333 }
334 }
335
336 scr_clear();
337 scr_end();
338
339 if (showpreview == 0)
340 (void)printf("Your score: %d point%s x level %d = %d\n",
341 score, score == 1 ? "" : "s", level, score * level);
342 else {
343 (void)printf("Your score: %d point%s x level %d x preview penalty %0.3f = %d\n",
344 score, score == 1 ? "" : "s", level, (double)PRE_PENALTY,
345 (int)(score * level * PRE_PENALTY));
346 score = score * PRE_PENALTY;
347 }
348 savescore(level);
349
350 printf("\nHit RETURN to see high scores, ^C to skip.\n");
351
352 while ((i = getchar()) != '\n')
353 if (i == EOF)
354 break;
355
356 showscores(level);
357
358 exit(0);
359}
360
361/* void */
362/* onintr(int signo) */
363/* { */
364/* scr_clear(); /\* XXX signal race *\/ */
365/* scr_end(); /\* XXX signal race *\/ */
366/* _exit(0); */
367/* } */
368
369void
370usage(void)
371{
372 (void)fprintf(stderr, "usage: tetris [-ps] [-k keys] [-l level]\n");
373 exit(1);
374}
Note: See TracBrowser for help on using the repository browser.