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