2 * Copyright (c) 1980, 1993
3 * The Regents of the University of California. All rights reserved.
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
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.
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
35 static const char copyright[] =
36 "@(#) Copyright (c) 1980, 1993\n\
37 The Regents of the University of California. All rights reserved.\n";
42 static char sccsid[] = "@(#)worms.c 8.1 (Berkeley) 5/31/93";
44 static const char rcsid[] =
50 * @@@ @@@ @@@@@@@@@@ @@@@@@@@@@@ @@@@@@@@@@@@
51 * @@@ @@@ @@@@@@@@@@@@ @@@@@@@@@@@@ @@@@@@@@@@@@@
52 * @@@ @@@ @@@@ @@@@ @@@@ @@@@ @@@ @@@@
53 * @@@ @@ @@@ @@@ @@@ @@@ @@@ @@@ @@@
54 * @@@ @@@@ @@@ @@@ @@@ @@@ @@@ @@@ @@@
55 * @@@@ @@@@ @@@@ @@@ @@@ @@@ @@@ @@@ @@@
56 * @@@@@@@@@@@@ @@@@ @@@@ @@@ @@@ @@@ @@@
57 * @@@@ @@@@ @@@@@@@@@@@@ @@@ @@@ @@@ @@@
58 * @@ @@ @@@@@@@@@@ @@@ @@@ @@@ @@@
61 * Caltech High Energy Physics
65 #include <sys/types.h>
73 static const struct options {
168 static const char flavor[] = {
169 'O', '*', '#', '$', '%', '0', '@', '~'
171 static const short xinc[] = {
172 1, 1, 1, 0, -1, -1, -1, 0
174 -1, 0, 1, 1, 1, 0, -1, -1
177 int orientation, head;
181 volatile sig_atomic_t sig_caught = 0;
182 void onsig __P((int));
192 const struct options *op;
194 int CO, LI, last, bottom, ch, length, number, trail;
198 unsigned int delay = 0;
205 while ((ch = getopt(argc, argv, "d:fl:n:t")) != -1)
208 if ((delay = (unsigned int)strtoul(optarg, (char **)NULL, 10)) < 1 || delay > 1000)
209 errx(1, "invalid delay (1-1000)");
210 delay *= 1000; /* ms -> us */
216 if ((length = atoi(optarg)) < 2 || length > 1024) {
217 errx(1, "invalid length (%d - %d).",
222 if ((number = atoi(optarg)) < 1) {
223 errx(1, "invalid number of worms.");
231 (void)fprintf(stderr,
232 "usage: worms [-ft] [-d delay] [-l length] [-n number]\n");
236 if (!(worm = malloc((size_t)number *
237 sizeof(struct worm))) || !(mp = malloc((size_t)1024)))
244 if (!(ip = malloc((size_t)(LI * CO * sizeof(short)))))
246 if (!(ref = malloc((size_t)(LI * sizeof(short *)))))
248 for (n = 0; n < LI; ++n) {
252 for (ip = ref[0], n = LI * CO; --n >= 0;)
254 for (n = number, w = &worm[0]; --n >= 0; w++) {
255 w->orientation = w->head = 0;
256 if (!(ip = malloc((size_t)(length * sizeof(short)))))
259 for (x = length; --x >= 0;)
261 if (!(ip = malloc((size_t)(length * sizeof(short)))))
264 for (y = length; --y >= 0;)
268 (void)signal(SIGHUP, onsig);
269 (void)signal(SIGINT, onsig);
270 (void)signal(SIGQUIT, onsig);
271 (void)signal(SIGSTOP, onsig);
272 (void)signal(SIGTSTP, onsig);
273 (void)signal(SIGTERM, onsig);
276 const char *p = field;
278 for (y = LI; --y >= 0;) {
279 for (x = CO; --x >= 0;) {
293 for (n = 0, w = &worm[0]; n < number; n++, w++) {
294 if ((x = w->xpos[h = w->head]) < 0) {
295 mvaddch(y = w->ypos[h] = bottom,
297 flavor[n % sizeof(flavor)]);
304 if (w->xpos[w->head = h] >= 0) {
309 if (--ref[y1][x1] == 0) {
310 mvaddch(y1, x1, trail);
313 op = &(!x ? (!y ? upleft : (y == bottom ? lowleft : left)) : (x == last ? (!y ? upright : (y == bottom ? lowright : right)) : (!y ? upper : (y == bottom ? lower : normal))))[w->orientation];
320 w->orientation = op->opts[0];
324 op->opts[(int)random() % op->nopts];
326 mvaddch(y += yinc[w->orientation],
327 x += xinc[w->orientation],
328 flavor[n % sizeof(flavor)]);
329 ref[w->ypos[h] = y][w->xpos[h] = x]++;
346 errx(1, "not enough memory.");