Home | History | Annotate | Line # | Download | only in battlestar
cypher.c revision 1.15
      1 /*	$NetBSD: cypher.c,v 1.15 2000/09/21 17:44:34 jsm Exp $	*/
      2 
      3 /*
      4  * Copyright (c) 1983, 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 #if 0
     39 static char sccsid[] = "@(#)cypher.c	8.2 (Berkeley) 4/28/95";
     40 #else
     41 __RCSID("$NetBSD: cypher.c,v 1.15 2000/09/21 17:44:34 jsm Exp $");
     42 #endif
     43 #endif				/* not lint */
     44 
     45 #include "extern.h"
     46 
     47 int
     48 cypher()
     49 {
     50 	int     n;
     51 	int     junk;
     52 	int     lflag = -1;
     53 	char    buffer[10];
     54 	char   *filename, *rfilename;
     55 	size_t	filename_len;
     56 
     57 	while (wordtype[wordnumber] == ADJS)
     58 		wordnumber++;
     59 	while (wordnumber <= wordcount) {
     60 		switch (wordvalue[wordnumber]) {
     61 
     62 		case UP:
     63 			if (location[position].access || wiz || tempwiz) {
     64 				if (!location[position].access)
     65 					puts("Zap!  A gust of wind lifts you up.");
     66 				if (!moveplayer(location[position].up, AHEAD))
     67 					return (-1);
     68 			} else {
     69 				puts("There is no way up.");
     70 				return (-1);
     71 			}
     72 			lflag = 0;
     73 			break;
     74 
     75 		case DOWN:
     76 			if (!moveplayer(location[position].down, AHEAD))
     77 				return (-1);
     78 			lflag = 0;
     79 			break;
     80 
     81 		case LEFT:
     82 			if (!moveplayer(left, LEFT))
     83 				return (-1);
     84 			lflag = 0;
     85 			break;
     86 
     87 		case RIGHT:
     88 			if (!moveplayer(right, RIGHT))
     89 				return (-1);
     90 			lflag = 0;
     91 			break;
     92 
     93 		case AHEAD:
     94 			if (!moveplayer(ahead, AHEAD))
     95 				return (-1);
     96 			lflag = 0;
     97 			break;
     98 
     99 		case BACK:
    100 			if (!moveplayer(back, BACK))
    101 				return (-1);
    102 			lflag = 0;
    103 			break;
    104 
    105 		case SHOOT:
    106 			if (wordnumber < wordcount && wordvalue[wordnumber + 1] == EVERYTHING) {
    107 				for (n = 0; n < NUMOFOBJECTS; n++)
    108 					if (testbit(location[position].objects, n) && objsht[n]) {
    109 						wordvalue[wordnumber + 1] = n;
    110 						wordnumber = shoot();
    111 					}
    112 				wordnumber++;
    113 				wordnumber++;
    114 			} else
    115 				shoot();
    116 			break;
    117 
    118 		case TAKE:
    119 			if (wordnumber < wordcount && wordvalue[wordnumber + 1] == EVERYTHING) {
    120 				for (n = 0; n < NUMOFOBJECTS; n++)
    121 					if (testbit(location[position].objects, n) && objsht[n]) {
    122 						wordvalue[wordnumber + 1] = n;
    123 						/* Some objects (type NOUNS)
    124 						 * have special treatment in
    125 						 * take().  For these we
    126 						 * must set the type to NOUNS.
    127 						 * However for SWORD and BODY
    128 						 * all it does is find which
    129 						 * of many objects is meant,
    130 						 * so we need do nothing here.
    131 						 * BATHGOD must become
    132 						 * NORMGOD as well.  NOUNS
    133 						 * with no special case
    134 						 * must be included here to
    135 						 * get the right error.  DOOR
    136 						 * cannot occur as an object
    137 						 * so need not be included.  */
    138 						switch(n) {
    139 						case BATHGOD:
    140 							wordvalue[wordnumber + 1] = NORMGOD;
    141 							/* FALLTHROUGH */
    142 						case NORMGOD:
    143 						case AMULET:
    144 						case MEDALION:
    145 						case TALISMAN:
    146 						case MAN:
    147 						case TIMER:
    148 						case NATIVE:
    149 							wordtype[wordnumber + 1] = NOUNS;
    150 							break;
    151 						default:
    152 							wordtype[wordnumber + 1] = OBJECT;
    153 						}
    154 						wordnumber = take(location[position].objects);
    155 					}
    156 				wordnumber++;
    157 				wordnumber++;
    158 			} else
    159 				take(location[position].objects);
    160 			break;
    161 
    162 		case DROP:
    163 
    164 			if (wordnumber < wordcount && wordvalue[wordnumber + 1] == EVERYTHING) {
    165 				for (n = 0; n < NUMOFOBJECTS; n++)
    166 					if (testbit(inven, n)) {
    167 						wordvalue[wordnumber + 1] = n;
    168 						wordnumber = drop("Dropped");
    169 					}
    170 				wordnumber++;
    171 				wordnumber++;
    172 			} else
    173 				drop("Dropped");
    174 			break;
    175 
    176 
    177 		case KICK:
    178 		case THROW:
    179 			if (wordnumber < wordcount && wordvalue[wordnumber + 1] == EVERYTHING) {
    180 				for (n = 0; n < NUMOFOBJECTS; n++)
    181 					if (testbit(inven, n) ||
    182 					    (testbit(location[position].objects, n) && objsht[n])) {
    183 						wordvalue[wordnumber + 1] = n;
    184 						wordnumber = throw(wordvalue[wordnumber] == KICK ? "Kicked" : "Thrown");
    185 					}
    186 				wordnumber += 2;
    187 			} else
    188 				throw(wordvalue[wordnumber] == KICK ? "Kicked" : "Thrown");
    189 			break;
    190 
    191 		case TAKEOFF:
    192 			if (wordnumber < wordcount && wordvalue[wordnumber + 1] == EVERYTHING) {
    193 				for (n = 0; n < NUMOFOBJECTS; n++)
    194 					if (testbit(wear, n)) {
    195 						wordvalue[wordnumber + 1] = n;
    196 						wordnumber = takeoff();
    197 					}
    198 				wordnumber += 2;
    199 			} else
    200 				takeoff();
    201 			break;
    202 
    203 
    204 		case DRAW:
    205 
    206 			if (wordnumber < wordcount && wordvalue[wordnumber + 1] == EVERYTHING) {
    207 				for (n = 0; n < NUMOFOBJECTS; n++)
    208 					if (testbit(wear, n)) {
    209 						wordvalue[wordnumber + 1] = n;
    210 						wordnumber = draw();
    211 					}
    212 				wordnumber += 2;
    213 			} else
    214 				draw();
    215 			break;
    216 
    217 
    218 		case PUTON:
    219 
    220 			if (wordnumber < wordcount && wordvalue[wordnumber + 1] == EVERYTHING) {
    221 				for (n = 0; n < NUMOFOBJECTS; n++)
    222 					if (testbit(location[position].objects, n) && objsht[n]) {
    223 						wordvalue[wordnumber + 1] = n;
    224 						wordnumber = puton();
    225 					}
    226 				wordnumber += 2;
    227 			} else
    228 				puton();
    229 			break;
    230 
    231 		case WEARIT:
    232 
    233 			if (wordnumber < wordcount && wordvalue[wordnumber + 1] == EVERYTHING) {
    234 				for (n = 0; n < NUMOFOBJECTS; n++)
    235 					if (testbit(inven, n)) {
    236 						wordvalue[wordnumber + 1] = n;
    237 						wordnumber = wearit();
    238 					}
    239 				wordnumber += 2;
    240 			} else
    241 				wearit();
    242 			break;
    243 
    244 
    245 		case EAT:
    246 
    247 			if (wordnumber < wordcount && wordvalue[wordnumber + 1] == EVERYTHING) {
    248 				for (n = 0; n < NUMOFOBJECTS; n++)
    249 					if (testbit(inven, n)) {
    250 						wordvalue[wordnumber + 1] = n;
    251 						wordnumber = eat();
    252 					}
    253 				wordnumber += 2;
    254 			} else
    255 				eat();
    256 			break;
    257 
    258 
    259 		case PUT:
    260 			put();
    261 			break;
    262 
    263 
    264 		case INVEN:
    265 			if (ucard(inven)) {
    266 				puts("You are holding:\n");
    267 				for (n = 0; n < NUMOFOBJECTS; n++)
    268 					if (testbit(inven, n))
    269 						printf("\t%s\n", objsht[n]);
    270 				printf("\n= %d kilogram%s (%d%%)\n", carrying, (carrying == 1 ? "." : "s."), (WEIGHT ? carrying * 100 / WEIGHT : -1));
    271 				printf("Your arms are %d%% full.\n", encumber * 100 / CUMBER);
    272 			} else
    273 				puts("You aren't carrying anything.");
    274 
    275 			if (ucard(wear)) {
    276 				puts("\nYou are wearing:\n");
    277 				for (n = 0; n < NUMOFOBJECTS; n++)
    278 					if (testbit(wear, n))
    279 						printf("\t%s\n", objsht[n]);
    280 			} else
    281 				puts("\nYou are stark naked.");
    282 			if (card(injuries, NUMOFINJURIES)) {
    283 				puts("\nYou have suffered:\n");
    284 				for (n = 0; n < NUMOFINJURIES; n++)
    285 					if (injuries[n])
    286 						printf("\t%s\n", ouch[n]);
    287 				printf("\nYou can still carry up to %d kilogram%s\n", WEIGHT, (WEIGHT == 1 ? "." : "s."));
    288 			} else
    289 				puts("\nYou are in perfect health.");
    290 			wordnumber++;
    291 			break;
    292 
    293 		case USE:
    294 			lflag = use();
    295 			break;
    296 
    297 		case OPEN:
    298 			if (wordnumber < wordcount && wordvalue[wordnumber + 1] == EVERYTHING) {
    299 				int things;
    300 				things = 0;
    301 				for (n = 0; n < NUMOFOBJECTS; n++)
    302 					if (testbit(inven, n)) {
    303 						things++;
    304 						wordvalue[wordnumber + 1] = n;
    305 						dooropen();
    306 					}
    307 				wordnumber += 2;
    308 				if (!things)
    309 					puts("Nothing to open!");
    310 			} else
    311 				dooropen();
    312 			break;
    313 
    314 		case LOOK:
    315 			if (!notes[CANTSEE] || testbit(inven, LAMPON) ||
    316 			    testbit(location[position].objects, LAMPON)
    317 			    || matchlight) {
    318 				beenthere[position] = 2;
    319 				writedes();
    320 				printobjs();
    321 				if (matchlight) {
    322 					puts("\nYour match splutters out.");
    323 					matchlight = 0;
    324 				}
    325 			} else
    326 				puts("I can't see anything.");
    327 			return (-1);
    328 			break;
    329 
    330 		case SU:
    331 			if (wiz || tempwiz) {
    332 				printf("\nRoom (was %d) = ", position);
    333 				fgets(buffer, 10, stdin);
    334 				if (*buffer != '\n')
    335 					sscanf(buffer, "%d", &position);
    336 				printf("Time (was %d) = ", ourtime);
    337 				fgets(buffer, 10, stdin);
    338 				if (*buffer != '\n')
    339 					sscanf(buffer, "%d", &ourtime);
    340 				printf("Fuel (was %d) = ", fuel);
    341 				fgets(buffer, 10, stdin);
    342 				if (*buffer != '\n')
    343 					sscanf(buffer, "%d", &fuel);
    344 				printf("Torps (was %d) = ", torps);
    345 				fgets(buffer, 10, stdin);
    346 				if (*buffer != '\n')
    347 					sscanf(buffer, "%d", &torps);
    348 				printf("CUMBER (was %d) = ", CUMBER);
    349 				fgets(buffer, 10, stdin);
    350 				if (*buffer != '\n')
    351 					sscanf(buffer, "%d", &CUMBER);
    352 				printf("WEIGHT (was %d) = ", WEIGHT);
    353 				fgets(buffer, 10, stdin);
    354 				if (*buffer != '\n')
    355 					sscanf(buffer, "%d", &WEIGHT);
    356 				printf("Clock (was %d) = ", ourclock);
    357 				fgets(buffer, 10, stdin);
    358 				if (*buffer != '\n')
    359 					sscanf(buffer, "%d", &ourclock);
    360 				printf("Wizard (was %d, %d) = ", wiz, tempwiz);
    361 				fgets(buffer, 10, stdin);
    362 				if (*buffer != '\n') {
    363 					sscanf(buffer, "%d", &junk);
    364 					if (!junk)
    365 						tempwiz = wiz = 0;
    366 				}
    367 				printf("\nDONE.\n");
    368 				return (0);
    369 			} else
    370 				puts("You aren't a wizard.");
    371 			break;
    372 
    373 		case SCORE:
    374 			printf("\tPLEASURE\tPOWER\t\tEGO\n");
    375 			printf("\t%3d\t\t%3d\t\t%3d\n\n", pleasure, power, ego);
    376 			printf("This gives you the rating of %s in %d turns.\n", rate(), ourtime);
    377 			printf("You have visited %d out of %d rooms this run (%d%%).\n", card(beenthere, NUMOFROOMS), NUMOFROOMS, card(beenthere, NUMOFROOMS) * 100 / NUMOFROOMS);
    378 			break;
    379 
    380 		case KNIFE:
    381 		case KILL:
    382 			murder();
    383 			break;
    384 
    385 		case UNDRESS:
    386 		case RAVAGE:
    387 			ravage();
    388 			break;
    389 
    390 		case SAVE:
    391 			printf("\nSave file name (default %s): ",
    392 			       DEFAULT_SAVE_FILE);
    393 			filename = fgetln(stdin, &filename_len);
    394 			if (filename_len == 0
    395 			    || (filename_len == 1 && filename[0] == '\n'))
    396 				rfilename = save_file_name(DEFAULT_SAVE_FILE,
    397 				    strlen(DEFAULT_SAVE_FILE));
    398 			else {
    399 				if (filename[filename_len - 1] == '\n')
    400 					filename_len--;
    401 				rfilename = save_file_name(filename,
    402 							   filename_len);
    403 			}
    404 			save(rfilename);
    405 			free(rfilename);
    406 			break;
    407 
    408 		case VERBOSE:
    409 			verbose = 1;
    410 			printf("[Maximum verbosity]\n");
    411 			break;
    412 
    413 		case BRIEF:
    414 			verbose = 0;
    415 			printf("[Standard verbosity]\n");
    416 			break;
    417 
    418 		case FOLLOW:
    419 			lflag = follow();
    420 			break;
    421 
    422 		case GIVE:
    423 			give();
    424 			break;
    425 
    426 		case KISS:
    427 			kiss();
    428 			break;
    429 
    430 		case LOVE:
    431 			love();
    432 			break;
    433 
    434 		case RIDE:
    435 			lflag = ride();
    436 			break;
    437 
    438 		case DRIVE:
    439 			lflag = drive();
    440 			break;
    441 
    442 		case LIGHT:
    443 			light();
    444 			break;
    445 
    446 		case LAUNCH:
    447 			if (!launch())
    448 				return (-1);
    449 			else
    450 				lflag = 0;
    451 			break;
    452 
    453 		case LANDIT:
    454 			if (!land())
    455 				return (-1);
    456 			else
    457 				lflag = 0;
    458 			break;
    459 
    460 		case TIME:
    461 			chime();
    462 			break;
    463 
    464 		case SLEEP:
    465 			zzz();
    466 			break;
    467 
    468 		case DIG:
    469 			dig();
    470 			break;
    471 
    472 		case JUMP:
    473 			lflag = jump();
    474 			break;
    475 
    476 		case BURY:
    477 			bury();
    478 			break;
    479 
    480 		case SWIM:
    481 			puts("Surf's up!");
    482 			break;
    483 
    484 		case DRINK:
    485 			drink();
    486 			break;
    487 
    488 		case QUIT:
    489 			die();
    490 
    491 		default:
    492 			puts("How's that?");
    493 			return (-1);
    494 			break;
    495 
    496 
    497 		}
    498 		if (wordnumber < wordcount && *words[wordnumber++] == ',')
    499 			continue;
    500 		else
    501 			return (lflag);
    502 	}
    503 	return (lflag);
    504 }
    505