Subversion Repositories HelenOS

Rev

Rev 1449 | Rev 1524 | Go to most recent revision | Details | Compare with Previous | Last modification | View Log | RSS feed

Rev Author Line No. Line
1419 jermar 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
39
static 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
 
1472 palkovsky 48
//#include <sys/param.h>
1419 jermar 49
#include <sys/time.h>
50
#include <sys/types.h>
51
 
52
#include <err.h>
1449 palkovsky 53
//#include <signal.h>
1419 jermar 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
 
64
cell	board[B_SIZE];
65
int	Rows, Cols;
66
const struct shape *curshape;
67
const struct shape *nextshape;
68
long	fallrate;
69
int	score;
1449 palkovsky 70
//gid_t	gid, egid;
1419 jermar 71
char	key_msg[100];
72
int	showpreview, classic;
73
 
74
static void	elide(void);
75
static void	setup_board(void);
76
const struct shape *randshape(void);
77
void	onintr(int);
78
void	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
 */
85
static void
86
setup_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
 */
99
static void
100
elide(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
 
142
const struct shape *
143
randshape(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
 
1472 palkovsky 155
static void srandomdev(void)
156
{
157
	struct timeval tv;
158
 
159
	gettimeofday(&tv, NULL);
160
	srandom(tv.tv_sec + tv.tv_usec / 100000);
161
}
162
 
1419 jermar 163
int
164
main(int argc, char *argv[])
165
{
166
	int pos, c;
167
	char *keys;
168
	int level = 2;
169
	char key_write[6][10];
170
	const char *errstr;
171
	int ch, i, j;
172
 
173
	keys = "jkl pq";
174
 
1449 palkovsky 175
//	gid = getgid();
176
//	egid = getegid();
177
//	setegid(gid);
1419 jermar 178
 
179
	classic = showpreview = 0;
180
 
1449 palkovsky 181
/* 	while ((ch = getopt(argc, argv, "ck:l:ps")) != -1) */
182
/* 		switch(ch) { */
183
/* 		case 'c': */
184
/* 			/\* */
185
/* 			 * this means: */
186
/* 			 *	- rotate the other way; */
187
/* 			 *	- no reverse video. */
188
/* 			 *\/ */
189
/* 			classic = 1; */
190
/* 			break; */
191
/* 		case 'k': */
192
/* 			if (strlen(keys = optarg) != 6) */
193
/* 				usage(); */
194
/* 			break; */
195
/* 		case 'l': */
196
/* 			level = (int)strtonum(optarg, MINLEVEL, MAXLEVEL, */
197
/* 			    &errstr); */
198
/* 			if (errstr) */
199
/* 				errx(1, "level must be from %d to %d", */
200
/* 				    MINLEVEL, MAXLEVEL); */
201
/* 			break; */
202
/* 		case 'p': */
203
/* 			showpreview = 1; */
204
/* 			break; */
205
/* 		case 's': */
206
/* 			showscores(0); */
207
/* 			exit(0); */
208
/* 		default: */
209
/* 			usage(); */
210
/* 		} */
1419 jermar 211
 
1449 palkovsky 212
/* 	argc -= optind; */
213
/* 	argv += optind; */
1419 jermar 214
 
1449 palkovsky 215
/* 	if (argc) */
216
/* 		usage(); */
217
 
1419 jermar 218
	fallrate = 1000000 / level;
219
 
220
	for (i = 0; i <= 5; i++) {
221
		for (j = i+1; j <= 5; j++) {
222
			if (keys[i] == keys[j])
223
				errx(1, "duplicate command keys specified.");
224
		}
225
		if (keys[i] == ' ')
1472 palkovsky 226
			strncpy(key_write[i], "<space>", sizeof key_write[i]);
1419 jermar 227
		else {
228
			key_write[i][0] = keys[i];
229
			key_write[i][1] = '\0';
230
		}
231
	}
232
 
233
	snprintf(key_msg, sizeof key_msg,
234
"%s - left   %s - rotate   %s - right   %s - drop   %s - pause   %s - quit",
235
		key_write[0], key_write[1], key_write[2], key_write[3],
236
		key_write[4], key_write[5]);
237
 
1449 palkovsky 238
//	(void)signal(SIGINT, onintr);
1419 jermar 239
	scr_init();
240
	setup_board();
241
 
242
	srandomdev();
243
	scr_set();
244
 
245
	pos = A_FIRST*B_COLS + (B_COLS/2)-1;
246
	nextshape = randshape();
247
	curshape = randshape();
248
 
249
	scr_msg(key_msg, 1);
250
 
251
	for (;;) {
252
		place(curshape, pos, 1);
253
		scr_update();
254
		place(curshape, pos, 0);
255
		c = tgetchar();
256
		if (c < 0) {
257
			/*
258
			 * Timeout.  Move down if possible.
259
			 */
260
			if (fits_in(curshape, pos + B_COLS)) {
261
				pos += B_COLS;
262
				continue;
263
			}
264
 
265
			/*
266
			 * Put up the current shape `permanently',
267
			 * bump score, and elide any full rows.
268
			 */
269
			place(curshape, pos, 1);
270
			score++;
271
			elide();
272
 
273
			/*
274
			 * Choose a new shape.  If it does not fit,
275
			 * the game is over.
276
			 */
277
			curshape = nextshape;
278
			nextshape = randshape();
279
			pos = A_FIRST*B_COLS + (B_COLS/2)-1;
280
			if (!fits_in(curshape, pos))
281
				break;
282
			continue;
283
		}
284
 
285
		/*
286
		 * Handle command keys.
287
		 */
288
		if (c == keys[5]) {
289
			/* quit */
290
			break;
291
		}
292
		if (c == keys[4]) {
293
			static char msg[] =
294
			    "paused - press RETURN to continue";
295
 
296
			place(curshape, pos, 1);
297
			do {
298
				scr_update();
299
				scr_msg(key_msg, 0);
300
				scr_msg(msg, 1);
1472 palkovsky 301
//				(void) fflush(stdout);
1419 jermar 302
			} while (rwait((struct timeval *)NULL) == -1);
303
			scr_msg(msg, 0);
304
			scr_msg(key_msg, 1);
305
			place(curshape, pos, 0);
306
			continue;
307
		}
308
		if (c == keys[0]) {
309
			/* move left */
310
			if (fits_in(curshape, pos - 1))
311
				pos--;
312
			continue;
313
		}
314
		if (c == keys[1]) {
315
			/* turn */
316
			const struct shape *new = &shapes[
317
			    classic? curshape->rotc : curshape->rot];
318
 
319
			if (fits_in(new, pos))
320
				curshape = new;
321
			continue;
322
		}
323
		if (c == keys[2]) {
324
			/* move right */
325
			if (fits_in(curshape, pos + 1))
326
				pos++;
327
			continue;
328
		}
329
		if (c == keys[3]) {
330
			/* move to bottom */
331
			while (fits_in(curshape, pos + B_COLS)) {
332
				pos += B_COLS;
333
				score++;
334
			}
335
			continue;
336
		}
337
		if (c == '\f') {
338
			scr_clear();
339
			scr_msg(key_msg, 1);
340
		}
341
	}
342
 
343
	scr_clear();
344
	scr_end();
345
 
346
	if (showpreview == 0)
347
		(void)printf("Your score:  %d point%s  x  level %d  =  %d\n",
348
		    score, score == 1 ? "" : "s", level, score * level);
349
	else {
350
		(void)printf("Your score:  %d point%s x level %d x preview penalty %0.3f = %d\n",
351
		    score, score == 1 ? "" : "s", level, (double)PRE_PENALTY,
352
		    (int)(score * level * PRE_PENALTY));
353
		score = score * PRE_PENALTY;
354
	}
355
	savescore(level);
356
 
357
	printf("\nHit RETURN to see high scores, ^C to skip.\n");
358
 
359
	while ((i = getchar()) != '\n')
360
		if (i == EOF)
361
			break;
362
 
363
	showscores(level);
364
 
365
	exit(0);
366
}
367
 
1449 palkovsky 368
/* void */
369
/* onintr(int signo) */
370
/* { */
371
/* 	scr_clear();		/\* XXX signal race *\/ */
372
/* 	scr_end();		/\* XXX signal race *\/ */
373
/* 	_exit(0); */
374
/* } */
1419 jermar 375
 
376
void
377
usage(void)
378
{
379
	(void)fprintf(stderr, "usage: tetris [-ps] [-k keys] [-l level]\n");
380
	exit(1);
381
}