worm.c revision 1.11
1 /* $NetBSD: worm.c,v 1.11 1999/08/08 03:08:08 hubertf Exp $ */ 2 3 /* 4 * Copyright (c) 1980, 1993 5 * The Regents of the University of California. All rights reserved. 6 * 7 * Redistribution and use in source and binary forms, with or without 8 * modification, are permitted provided that the following conditions 9 * are met: 10 * 1. Redistributions of source code must retain the above copyright 11 * notice, this list of conditions and the following disclaimer. 12 * 2. Redistributions in binary form must reproduce the above copyright 13 * notice, this list of conditions and the following disclaimer in the 14 * documentation and/or other materials provided with the distribution. 15 * 3. All advertising materials mentioning features or use of this software 16 * must display the following acknowledgement: 17 * This product includes software developed by the University of 18 * California, Berkeley and its contributors. 19 * 4. 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 36 #include <sys/cdefs.h> 37 #ifndef lint 38 __COPYRIGHT("@(#) Copyright (c) 1980, 1993\n\ 39 The Regents of the University of California. All rights reserved.\n"); 40 #endif /* not lint */ 41 42 #ifndef lint 43 #if 0 44 static char sccsid[] = "@(#)worm.c 8.1 (Berkeley) 5/31/93"; 45 #else 46 __RCSID("$NetBSD: worm.c,v 1.11 1999/08/08 03:08:08 hubertf Exp $"); 47 #endif 48 #endif /* not lint */ 49 50 /* 51 * Worm. Written by Michael Toy 52 * UCSC 53 */ 54 55 #include <ctype.h> 56 #include <curses.h> 57 #include <signal.h> 58 #include <stdlib.h> 59 #include <termios.h> 60 #include <unistd.h> 61 62 #define newlink() (struct body *) malloc(sizeof (struct body)); 63 #define HEAD '@' 64 #define BODY 'o' 65 #define LENGTH 7 66 #define RUNLEN 8 67 #define CNTRL(p) (p-'A'+1) 68 69 WINDOW *tv; 70 WINDOW *stw; 71 struct body { 72 int x; 73 int y; 74 struct body *prev; 75 struct body *next; 76 } *head, *tail, goody; 77 int growing = 0; 78 int running = 0; 79 int slow = 0; 80 int score = 0; 81 int start_len = LENGTH; 82 char lastch; 83 char outbuf[BUFSIZ]; 84 85 void crash __P((void)) __attribute__((__noreturn__)); 86 void display __P((struct body *, char)); 87 int main __P((int, char **)); 88 void leave __P((int)) __attribute__((__noreturn__)); 89 void life __P((void)); 90 void newpos __P((struct body *)); 91 void process __P((char)); 92 void prize __P((void)); 93 int rnd __P((int)); 94 void setup __P((void)); 95 void suspend __P((int)); 96 void wake __P((int)); 97 98 int 99 main(argc, argv) 100 int argc; 101 char **argv; 102 { 103 char ch; 104 105 if (argc == 2) 106 start_len = atoi(argv[1]); 107 if ((start_len <= 0) || (start_len > 500)) 108 start_len = LENGTH; 109 setbuf(stdout, outbuf); 110 srand(getpid()); 111 signal(SIGALRM, wake); 112 signal(SIGINT, leave); 113 signal(SIGQUIT, leave); 114 signal(SIGTSTP, suspend); /* process control signal */ 115 initscr(); 116 crmode(); 117 noecho(); 118 slow = (baudrate() <= 1200); 119 clear(); 120 stw = newwin(1, COLS-1, 0, 0); 121 tv = newwin(LINES-1, COLS-1, 1, 0); 122 box(tv, '*', '*'); 123 scrollok(tv, FALSE); 124 scrollok(stw, FALSE); 125 wmove(stw, 0, 0); 126 wprintw(stw, " Worm"); 127 refresh(); 128 wrefresh(stw); 129 wrefresh(tv); 130 life(); /* Create the worm */ 131 prize(); /* Put up a goal */ 132 while(1) 133 { 134 if (running) 135 { 136 running--; 137 process(lastch); 138 } 139 else 140 { 141 fflush(stdout); 142 if (read(0, &ch, 1) >= 0) 143 process(ch); 144 } 145 } 146 } 147 148 void 149 life() 150 { 151 struct body *bp, *np; 152 int i; 153 154 np = NULL; 155 head = newlink(); 156 head->x = start_len+2; 157 head->y = 12; 158 head->next = NULL; 159 display(head, HEAD); 160 for (i = 0, bp = head; i < start_len; i++, bp = np) { 161 np = newlink(); 162 np->next = bp; 163 bp->prev = np; 164 np->x = bp->x - 1; 165 np->y = bp->y; 166 display(np, BODY); 167 } 168 tail = np; 169 tail->prev = NULL; 170 } 171 172 void 173 display(pos, chr) 174 struct body *pos; 175 char chr; 176 { 177 wmove(tv, pos->y, pos->x); 178 waddch(tv, chr); 179 } 180 181 void 182 leave(dummy) 183 int dummy; 184 { 185 endwin(); 186 187 if (dummy == 0){ /* called via crash() */ 188 printf("\nWell, you ran into something and the game is over.\n"); 189 printf("Your final score was %d\n\n", score); 190 } 191 exit(0); 192 } 193 194 void 195 wake(dummy) 196 int dummy; 197 { 198 signal(SIGALRM, wake); 199 fflush(stdout); 200 process(lastch); 201 } 202 203 int 204 rnd(range) 205 int range; 206 { 207 return abs((rand()>>5)+(rand()>>5)) % range; 208 } 209 210 void 211 newpos(bp) 212 struct body * bp; 213 { 214 do { 215 bp->y = rnd(LINES-3)+ 2; 216 bp->x = rnd(COLS-3) + 1; 217 wmove(tv, bp->y, bp->x); 218 } while(winch(tv) != ' '); 219 } 220 221 void 222 prize() 223 { 224 int value; 225 226 value = rnd(9) + 1; 227 newpos(&goody); 228 waddch(tv, value+'0'); 229 wrefresh(tv); 230 } 231 232 void 233 process(ch) 234 char ch; 235 { 236 int x,y; 237 struct body *nh; 238 239 alarm(0); 240 x = head->x; 241 y = head->y; 242 switch(ch) 243 { 244 case 'h': x--; break; 245 case 'j': y++; break; 246 case 'k': y--; break; 247 case 'l': x++; break; 248 case 'H': x--; running = RUNLEN; ch = tolower(ch); break; 249 case 'J': y++; running = RUNLEN/2; ch = tolower(ch); break; 250 case 'K': y--; running = RUNLEN/2; ch = tolower(ch); break; 251 case 'L': x++; running = RUNLEN; ch = tolower(ch); break; 252 case '\f': setup(); return; 253 case CNTRL('Z'): suspend(0); return; 254 case CNTRL('C'): crash(); return; 255 case CNTRL('D'): crash(); return; 256 default: if (! running) alarm(1); 257 return; 258 } 259 lastch = ch; 260 if (growing == 0) 261 { 262 display(tail, ' '); 263 tail->next->prev = NULL; 264 nh = tail->next; 265 free(tail); 266 tail = nh; 267 } 268 else growing--; 269 display(head, BODY); 270 wmove(tv, y, x); 271 if (isdigit(ch = winch(tv))) 272 { 273 growing += ch-'0'; 274 prize(); 275 score += growing; 276 running = 0; 277 wmove(stw, 0, 68); 278 wprintw(stw, "Score: %3d", score); 279 wrefresh(stw); 280 } 281 else if(ch != ' ') crash(); 282 nh = newlink(); 283 nh->next = NULL; 284 nh->prev = head; 285 head->next = nh; 286 nh->y = y; 287 nh->x = x; 288 display(nh, HEAD); 289 head = nh; 290 if (!(slow && running)) 291 { 292 wmove(tv, head->y, head->x); 293 wrefresh(tv); 294 } 295 if (!running) 296 alarm(1); 297 } 298 299 void 300 crash() 301 { 302 sleep(2); 303 clear(); 304 move(23, 0); 305 refresh(); 306 leave(0); 307 } 308 309 void 310 suspend(dummy) 311 int dummy; 312 { 313 move(LINES-1, 0); 314 refresh(); 315 endwin(); 316 fflush(stdout); 317 kill(getpid(), SIGTSTP); 318 signal(SIGTSTP, suspend); 319 crmode(); 320 noecho(); 321 setup(); 322 } 323 324 void 325 setup() 326 { 327 clear(); 328 refresh(); 329 touchwin(stw); 330 wrefresh(stw); 331 touchwin(tv); 332 wrefresh(tv); 333 alarm(1); 334 } 335
Indexes created Sat Oct 25 00:10:07 GMT 2025