xref: /dragonfly/games/worms/worms.c (revision 99dd49c5) 
1 /*
2  * Copyright (c) 1980, 1993
3  *	The Regents of the University of California.  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  * 1. Redistributions of source code must retain the above copyright
9  *    notice, this list of conditions and the following disclaimer.
10  * 2. Redistributions in binary form must reproduce the above copyright
11  *    notice, this list of conditions and the following disclaimer in the
12  *    documentation and/or other materials provided with the distribution.
13  * 3. All advertising materials mentioning features or use of this software
14  *    must display the following acknowledgement:
15  *	This product includes software developed by the University of
16  *	California, Berkeley and its contributors.
17  * 4. Neither the name of the University nor the names of its contributors
18  *    may be used to endorse or promote products derived from this software
19  *    without specific prior written permission.
20  *
21  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
22  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
25  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
26  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
27  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
30  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
31  * SUCH DAMAGE.
32  *
33  * @(#) Copyright (c) 1980, 1993 The Regents of the University of California.  All rights reserved.
34  * @(#)worms.c	8.1 (Berkeley) 5/31/93
35  * $FreeBSD: src/games/worms/worms.c,v 1.8.2.1 2000/12/04 10:36:17 alex Exp $
36  * $DragonFly: src/games/worms/worms.c,v 1.5 2007/04/18 18:32:12 swildner Exp $
37  */
38 
39 /*
40  *
41  *	 @@@        @@@    @@@@@@@@@@     @@@@@@@@@@@    @@@@@@@@@@@@
42  *	 @@@        @@@   @@@@@@@@@@@@    @@@@@@@@@@@@   @@@@@@@@@@@@@
43  *	 @@@        @@@  @@@@      @@@@   @@@@           @@@@ @@@  @@@@
44  *	 @@@   @@   @@@  @@@        @@@   @@@            @@@  @@@   @@@
45  *	 @@@  @@@@  @@@  @@@        @@@   @@@            @@@  @@@   @@@
46  *	 @@@@ @@@@ @@@@  @@@        @@@   @@@            @@@  @@@   @@@
47  *	  @@@@@@@@@@@@   @@@@      @@@@   @@@            @@@  @@@   @@@
48  *	   @@@@  @@@@     @@@@@@@@@@@@    @@@            @@@  @@@   @@@
49  *	    @@    @@       @@@@@@@@@@     @@@            @@@  @@@   @@@
50  *
51  *				 Eric P. Scott
52  *			  Caltech High Energy Physics
53  *				 October, 1980
54  *
55  */
56 #include <sys/types.h>
57 #include <curses.h>
58 #include <err.h>
59 #include <signal.h>
60 #include <stdio.h>
61 #include <stdlib.h>
62 #include <unistd.h>
63 
64 static const struct options {
65 	int nopts;
66 	int opts[3];
67 }
68 	normal[8] = {
69 	{ 3, { 7, 0, 1 } },
70 	{ 3, { 0, 1, 2 } },
71 	{ 3, { 1, 2, 3 } },
72 	{ 3, { 2, 3, 4 } },
73 	{ 3, { 3, 4, 5 } },
74 	{ 3, { 4, 5, 6 } },
75 	{ 3, { 5, 6, 7 } },
76 	{ 3, { 6, 7, 0 } }
77 },	upper[8] = {
78 	{ 1, { 1, 0, 0 } },
79 	{ 2, { 1, 2, 0 } },
80 	{ 0, { 0, 0, 0 } },
81 	{ 0, { 0, 0, 0 } },
82 	{ 0, { 0, 0, 0 } },
83 	{ 2, { 4, 5, 0 } },
84 	{ 1, { 5, 0, 0 } },
85 	{ 2, { 1, 5, 0 } }
86 },
87 	left[8] = {
88 	{ 0, { 0, 0, 0 } },
89 	{ 0, { 0, 0, 0 } },
90 	{ 0, { 0, 0, 0 } },
91 	{ 2, { 2, 3, 0 } },
92 	{ 1, { 3, 0, 0 } },
93 	{ 2, { 3, 7, 0 } },
94 	{ 1, { 7, 0, 0 } },
95 	{ 2, { 7, 0, 0 } }
96 },
97 	right[8] = {
98 	{ 1, { 7, 0, 0 } },
99 	{ 2, { 3, 7, 0 } },
100 	{ 1, { 3, 0, 0 } },
101 	{ 2, { 3, 4, 0 } },
102 	{ 0, { 0, 0, 0 } },
103 	{ 0, { 0, 0, 0 } },
104 	{ 0, { 0, 0, 0 } },
105 	{ 2, { 6, 7, 0 } }
106 },
107 	lower[8] = {
108 	{ 0, { 0, 0, 0 } },
109 	{ 2, { 0, 1, 0 } },
110 	{ 1, { 1, 0, 0 } },
111 	{ 2, { 1, 5, 0 } },
112 	{ 1, { 5, 0, 0 } },
113 	{ 2, { 5, 6, 0 } },
114 	{ 0, { 0, 0, 0 } },
115 	{ 0, { 0, 0, 0 } }
116 },
117 	upleft[8] = {
118 	{ 0, { 0, 0, 0 } },
119 	{ 0, { 0, 0, 0 } },
120 	{ 0, { 0, 0, 0 } },
121 	{ 0, { 0, 0, 0 } },
122 	{ 0, { 0, 0, 0 } },
123 	{ 1, { 3, 0, 0 } },
124 	{ 2, { 1, 3, 0 } },
125 	{ 1, { 1, 0, 0 } }
126 },
127 	upright[8] = {
128 	{ 2, { 3, 5, 0 } },
129 	{ 1, { 3, 0, 0 } },
130 	{ 0, { 0, 0, 0 } },
131 	{ 0, { 0, 0, 0 } },
132 	{ 0, { 0, 0, 0 } },
133 	{ 0, { 0, 0, 0 } },
134 	{ 0, { 0, 0, 0 } },
135 	{ 1, { 5, 0, 0 } }
136 },
137 	lowleft[8] = {
138 	{ 3, { 7, 0, 1 } },
139 	{ 0, { 0, 0, 0 } },
140 	{ 0, { 0, 0, 0 } },
141 	{ 1, { 1, 0, 0 } },
142 	{ 2, { 1, 7, 0 } },
143 	{ 1, { 7, 0, 0 } },
144 	{ 0, { 0, 0, 0 } },
145 	{ 0, { 0, 0, 0 } }
146 },
147 	lowright[8] = {
148 	{ 0, { 0, 0, 0 } },
149 	{ 1, { 7, 0, 0 } },
150 	{ 2, { 5, 7, 0 } },
151 	{ 1, { 5, 0, 0 } },
152 	{ 0, { 0, 0, 0 } },
153 	{ 0, { 0, 0, 0 } },
154 	{ 0, { 0, 0, 0 } },
155 	{ 0, { 0, 0, 0 } }
156 };
157 
158 
159 static const char	flavor[] = {
160 	'O', '*', '#', '$', '%', '0', '@', '~'
161 };
162 static const short	xinc[] = {
163 	1,  1,  1,  0, -1, -1, -1,  0
164 }, yinc[] = {
165 	-1,  0,  1,  1,  1,  0, -1, -1
166 };
167 static struct	worm {
168 	int orientation, head;
169 	short *xpos, *ypos;
170 } *worm;
171 
172 volatile sig_atomic_t sig_caught = 0;
173 void	 onsig (int);
174 void	nomem(void);
175 
176 int
177 main(int argc, char **argv)
178 {
179 	int x, y, h, n;
180 	struct worm *w;
181 	const struct options *op;
182 	short *ip;
183 	int CO, LI, last, bottom, ch, length, number, trail;
184 	short **ref;
185 	const char *field;
186 	char *mp;
187 	unsigned int delay = 0;
188 
189 	mp = NULL;
190 	length = 16;
191 	number = 3;
192 	trail = ' ';
193 	field = NULL;
194 	while ((ch = getopt(argc, argv, "d:fl:n:t")) != -1)
195 		switch(ch) {
196 		case 'd':
197 			if ((delay = (unsigned int)strtoul(optarg, NULL, 10)) < 1 || delay > 1000)
198 				errx(1, "invalid delay (1-1000)");
199 			delay *= 1000;  /* ms -> us */
200 			break;
201 		case 'f':
202 			field = "WORM";
203 			break;
204 		case 'l':
205 			if ((length = atoi(optarg)) < 2 || length > 1024) {
206 				errx(1, "invalid length (%d - %d).",
207 				     2, 1024);
208 			}
209 			break;
210 		case 'n':
211 			if ((number = atoi(optarg)) < 1) {
212 				errx(1, "invalid number of worms.");
213 			}
214 			break;
215 		case 't':
216 			trail = '.';
217 			break;
218 		case '?':
219 		default:
220 			(void)fprintf(stderr,
221 			    "usage: worms [-ft] [-d delay] [-l length] [-n number]\n");
222 			exit(1);
223 		}
224 
225 	if (!(worm = malloc((size_t)number *
226 	    sizeof(struct worm))) || !(mp = malloc((size_t)1024)))
227 		nomem();
228 	initscr();
229 	CO = COLS;
230 	LI = LINES;
231 	last = CO - 1;
232 	bottom = LI - 1;
233 	if (!(ip = malloc((size_t)(LI * CO * sizeof(short)))))
234 		nomem();
235 	if (!(ref = malloc((size_t)(LI * sizeof(short *)))))
236 		nomem();
237 	for (n = 0; n < LI; ++n) {
238 		ref[n] = ip;
239 		ip += CO;
240 	}
241 	for (ip = ref[0], n = LI * CO; --n >= 0;)
242 		*ip++ = 0;
243 	for (n = number, w = &worm[0]; --n >= 0; w++) {
244 		w->orientation = w->head = 0;
245 		if (!(ip = malloc((size_t)(length * sizeof(short)))))
246 			nomem();
247 		w->xpos = ip;
248 		for (x = length; --x >= 0;)
249 			*ip++ = -1;
250 		if (!(ip = malloc((size_t)(length * sizeof(short)))))
251 			nomem();
252 		w->ypos = ip;
253 		for (y = length; --y >= 0;)
254 			*ip++ = -1;
255 	}
256 
257 	(void)signal(SIGHUP, onsig);
258 	(void)signal(SIGINT, onsig);
259 	(void)signal(SIGQUIT, onsig);
260 	(void)signal(SIGSTOP, onsig);
261 	(void)signal(SIGTSTP, onsig);
262 	(void)signal(SIGTERM, onsig);
263 
264 	if (field) {
265 		const char *p = field;
266 
267 		for (y = LI; --y >= 0;) {
268 			for (x = CO; --x >= 0;) {
269 				addch(*p++);
270 				if (!*p)
271 					p = field;
272 			}
273 			refresh();
274 		}
275 	}
276 	for (;;) {
277 		refresh();
278 		if (sig_caught) {
279 			endwin();
280 			exit(0);
281 		}
282 		for (n = 0, w = &worm[0]; n < number; n++, w++) {
283 			if ((x = w->xpos[h = w->head]) < 0) {
284 				mvaddch(y = w->ypos[h] = bottom,
285 				x = w->xpos[h] = 0,
286 				flavor[n % sizeof(flavor)]);
287 				ref[y][x]++;
288 			}
289 			else
290 				y = w->ypos[h];
291 			if (++h == length)
292 				h = 0;
293 			if (w->xpos[w->head = h] >= 0) {
294 				int x1, y1;
295 
296 				x1 = w->xpos[h];
297 				y1 = w->ypos[h];
298 				if (--ref[y1][x1] == 0) {
299 					mvaddch(y1, x1, trail);
300 				}
301 			}
302 			op = &(!x ? (!y ? upleft : (y == bottom ? lowleft : left)) : (x == last ? (!y ? upright : (y == bottom ? lowright : right)) : (!y ? upper : (y == bottom ? lower : normal))))[w->orientation];
303 			switch (op->nopts) {
304 			case 0:
305 				refresh();
306 				abort();
307 				return(1);
308 			case 1:
309 				w->orientation = op->opts[0];
310 				break;
311 			default:
312 				w->orientation =
313 				    op->opts[(int)random() % op->nopts];
314 			}
315 			mvaddch(y += yinc[w->orientation],
316 				x += xinc[w->orientation],
317 				flavor[n % sizeof(flavor)]);
318 			ref[w->ypos[h] = y][w->xpos[h] = x]++;
319 		}
320 		if (usleep(delay))
321 			onsig(SIGTERM);
322 	}
323 }
324 
325 void
326 onsig(__unused int signo)
327 {
328 	sig_caught = 1;
329 }
330 
331 void
332 nomem(void)
333 {
334 	errx(1, "not enough memory.");
335 }
336