cypher.c revision 1.2       1  1.1      cgd /*
      2  1.1      cgd  * Copyright (c) 1983 Regents of the University of California.
      3  1.1      cgd  * All rights reserved.
      4  1.1      cgd  *
      5  1.1      cgd  * Redistribution and use in source and binary forms, with or without
      6  1.1      cgd  * modification, are permitted provided that the following conditions
      7  1.1      cgd  * are met:
      8  1.1      cgd  * 1. Redistributions of source code must retain the above copyright
      9  1.1      cgd  *    notice, this list of conditions and the following disclaimer.
     10  1.1      cgd  * 2. Redistributions in binary form must reproduce the above copyright
     11  1.1      cgd  *    notice, this list of conditions and the following disclaimer in the
     12  1.1      cgd  *    documentation and/or other materials provided with the distribution.
     13  1.1      cgd  * 3. All advertising materials mentioning features or use of this software
     14  1.1      cgd  *    must display the following acknowledgement:
     15  1.1      cgd  *	This product includes software developed by the University of
     16  1.1      cgd  *	California, Berkeley and its contributors.
     17  1.1      cgd  * 4. Neither the name of the University nor the names of its contributors
     18  1.1      cgd  *    may be used to endorse or promote products derived from this software
     19  1.1      cgd  *    without specific prior written permission.
     20  1.1      cgd  *
     21  1.1      cgd  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
     22  1.1      cgd  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
     23  1.1      cgd  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
     24  1.1      cgd  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
     25  1.1      cgd  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
     26  1.1      cgd  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
     27  1.1      cgd  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
     28  1.1      cgd  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
     29  1.1      cgd  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
     30  1.1      cgd  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
     31  1.1      cgd  * SUCH DAMAGE.
     32  1.1      cgd  */
     33  1.1      cgd 
     34  1.1      cgd #ifndef lint
     35  1.2  mycroft /*static char sccsid[] = "from: @(#)cypher.c	5.3 (Berkeley) 6/1/90";*/
     36  1.2  mycroft static char rcsid[] = "$Id: cypher.c,v 1.2 1993/08/01 18:56:03 mycroft Exp $";
     37  1.1      cgd #endif /* not lint */
     38  1.1      cgd 
     39  1.1      cgd #include "externs.h"
     40  1.1      cgd 
     41  1.1      cgd cypher()
     42  1.1      cgd {
     43  1.1      cgd 	register int n;
     44  1.1      cgd 	int junk;
     45  1.1      cgd 	int lflag = -1;
     46  1.1      cgd 	char buffer[10];
     47  1.1      cgd 
     48  1.1      cgd 	while (wordtype[wordnumber] == ADJS)
     49  1.1      cgd 		wordnumber++;
     50  1.1      cgd 	while (wordnumber <= wordcount) {
     51  1.1      cgd 		switch(wordvalue[wordnumber]) {
     52  1.1      cgd 
     53  1.1      cgd 			case UP:
     54  1.1      cgd 				if (location[position].access || wiz || tempwiz) {
     55  1.1      cgd 					if (!location[position].access)
     56  1.1      cgd 						puts("Zap!  A gust of wind lifts you up.");
     57  1.1      cgd 					if (!move(location[position].up, AHEAD))
     58  1.1      cgd 						return(-1);
     59  1.1      cgd 				} else {
     60  1.1      cgd 					puts("There is no way up");
     61  1.1      cgd 					return(-1);
     62  1.1      cgd 				}
     63  1.1      cgd 				lflag = 0;
     64  1.1      cgd 				break;
     65  1.1      cgd 
     66  1.1      cgd 			 case DOWN:
     67  1.1      cgd 				if (!move(location[position].down, AHEAD))
     68  1.1      cgd 					return(-1);
     69  1.1      cgd 				lflag = 0;
     70  1.1      cgd 				break;
     71  1.1      cgd 
     72  1.1      cgd 			 case LEFT:
     73  1.1      cgd 				if (!move(left, LEFT))
     74  1.1      cgd 					return(-1);
     75  1.1      cgd 				lflag = 0;
     76  1.1      cgd 				break;
     77  1.1      cgd 
     78  1.1      cgd 			 case RIGHT:
     79  1.1      cgd 				if (!move(right, RIGHT))
     80  1.1      cgd 					return(-1);
     81  1.1      cgd 				lflag = 0;
     82  1.1      cgd 				break;
     83  1.1      cgd 
     84  1.1      cgd 			 case AHEAD:
     85  1.1      cgd 				if (!move(ahead, AHEAD))
     86  1.1      cgd 					return(-1);
     87  1.1      cgd 				lflag = 0;
     88  1.1      cgd 				break;
     89  1.1      cgd 
     90  1.1      cgd 			 case BACK:
     91  1.1      cgd 				if (!move(back, BACK))
     92  1.1      cgd 					return(-1);
     93  1.1      cgd 				lflag = 0;
     94  1.1      cgd 				break;
     95  1.1      cgd 
     96  1.1      cgd 			 case SHOOT:
     97  1.1      cgd 				if (wordnumber < wordcount && wordvalue[wordnumber+1] == EVERYTHING){
     98  1.1      cgd 					for (n=0; n < NUMOFOBJECTS; n++)
     99  1.1      cgd 						if (testbit(location[position].objects,n) && *objsht[n]){
    100  1.1      cgd 							wordvalue[wordnumber+1] = n;
    101  1.1      cgd 							wordnumber = shoot();
    102  1.1      cgd 						}
    103  1.1      cgd 				wordnumber++;
    104  1.1      cgd 				wordnumber++;
    105  1.1      cgd 				}
    106  1.1      cgd 				else
    107  1.1      cgd 					shoot();
    108  1.1      cgd 				break;
    109  1.1      cgd 
    110  1.1      cgd 			 case TAKE:
    111  1.1      cgd 				if (wordnumber < wordcount && wordvalue[wordnumber+1] == EVERYTHING){
    112  1.1      cgd 					for (n=0; n < NUMOFOBJECTS; n++)
    113  1.1      cgd 						if (testbit(location[position].objects,n) && *objsht[n]){
    114  1.1      cgd 							wordvalue[wordnumber+1] = n;
    115  1.1      cgd 							wordnumber = take(location[position].objects);
    116  1.1      cgd 						}
    117  1.1      cgd 				wordnumber++;
    118  1.1      cgd 				wordnumber++;
    119  1.1      cgd 				}
    120  1.1      cgd 				else
    121  1.1      cgd 					take(location[position].objects);
    122  1.1      cgd 				break;
    123  1.1      cgd 
    124  1.1      cgd 			 case DROP:
    125  1.1      cgd 
    126  1.1      cgd 				if (wordnumber < wordcount && wordvalue[wordnumber+1] == EVERYTHING){
    127  1.1      cgd 					for (n=0; n < NUMOFOBJECTS; n++)
    128  1.1      cgd 						if (testbit(inven,n)){
    129  1.1      cgd 							wordvalue[wordnumber+1] = n;
    130  1.1      cgd 							wordnumber = drop("Dropped");
    131  1.1      cgd 						}
    132  1.1      cgd 				wordnumber++;
    133  1.1      cgd 				wordnumber++;
    134  1.1      cgd 				}
    135  1.1      cgd 				else
    136  1.1      cgd 					drop("Dropped");
    137  1.1      cgd 				break;
    138  1.1      cgd 
    139  1.1      cgd 
    140  1.1      cgd 			 case KICK:
    141  1.1      cgd 			 case THROW:
    142  1.1      cgd 				if (wordnumber < wordcount && wordvalue[wordnumber+1] == EVERYTHING){
    143  1.1      cgd 					for (n=0; n < NUMOFOBJECTS; n++)
    144  1.1      cgd 						if (testbit(inven,n) ||
    145  1.1      cgd 						  testbit(location[position].objects, n) && *objsht[n]){
    146  1.1      cgd 							wordvalue[wordnumber+1] = n;
    147  1.1      cgd 							wordnumber = throw(wordvalue[wordnumber] == KICK ? "Kicked" : "Thrown");
    148  1.1      cgd 						}
    149  1.1      cgd 					wordnumber += 2;
    150  1.1      cgd 				} else
    151  1.1      cgd 					throw(wordvalue[wordnumber] == KICK ? "Kicked" : "Thrown");
    152  1.1      cgd 				break;
    153  1.1      cgd 
    154  1.1      cgd 			 case TAKEOFF:
    155  1.1      cgd 				if (wordnumber < wordcount && wordvalue[wordnumber+1] == EVERYTHING){
    156  1.1      cgd 					for (n=0; n < NUMOFOBJECTS; n++)
    157  1.1      cgd 						if (testbit(wear,n)){
    158  1.1      cgd 							wordvalue[wordnumber+1] = n;
    159  1.1      cgd 							wordnumber = takeoff();
    160  1.1      cgd 						}
    161  1.1      cgd 					wordnumber += 2;
    162  1.1      cgd 				}
    163  1.1      cgd 				else
    164  1.1      cgd 					takeoff();
    165  1.1      cgd 				break;
    166  1.1      cgd 
    167  1.1      cgd 
    168  1.1      cgd 			 case DRAW:
    169  1.1      cgd 
    170  1.1      cgd 				if (wordnumber < wordcount && wordvalue[wordnumber+1] == EVERYTHING){
    171  1.1      cgd 					for (n=0; n < NUMOFOBJECTS; n++)
    172  1.1      cgd 						if (testbit(wear,n)){
    173  1.1      cgd 							wordvalue[wordnumber+1] = n;
    174  1.1      cgd 							wordnumber = draw();
    175  1.1      cgd 						}
    176  1.1      cgd 					wordnumber += 2;
    177  1.1      cgd 				}
    178  1.1      cgd 				else
    179  1.1      cgd 					draw();
    180  1.1      cgd 				break;
    181  1.1      cgd 
    182  1.1      cgd 
    183  1.1      cgd 			 case PUTON:
    184  1.1      cgd 
    185  1.1      cgd 				if (wordnumber < wordcount && wordvalue[wordnumber+1] == EVERYTHING){
    186  1.1      cgd 					for (n=0; n < NUMOFOBJECTS; n++)
    187  1.1      cgd 						if (testbit(location[position].objects,n) && *objsht[n]){
    188  1.1      cgd 							wordvalue[wordnumber+1] = n;
    189  1.1      cgd 							wordnumber = puton();
    190  1.1      cgd 						}
    191  1.1      cgd 					wordnumber += 2;
    192  1.1      cgd 				}
    193  1.1      cgd 				else
    194  1.1      cgd 					puton();
    195  1.1      cgd 				break;
    196  1.1      cgd 
    197  1.1      cgd 			 case WEARIT:
    198  1.1      cgd 
    199  1.1      cgd 				if (wordnumber < wordcount && wordvalue[wordnumber+1] == EVERYTHING){
    200  1.1      cgd 					for (n=0; n < NUMOFOBJECTS; n++)
    201  1.1      cgd 						if (testbit(inven,n)){
    202  1.1      cgd 							wordvalue[wordnumber+1] = n;
    203  1.1      cgd 							wordnumber = wearit();
    204  1.1      cgd 						}
    205  1.1      cgd 					wordnumber += 2;
    206  1.1      cgd 				}
    207  1.1      cgd 				else
    208  1.1      cgd 					wearit();
    209  1.1      cgd 				break;
    210  1.1      cgd 
    211  1.1      cgd 
    212  1.1      cgd 			 case EAT:
    213  1.1      cgd 
    214  1.1      cgd 				if (wordnumber < wordcount && wordvalue[wordnumber+1] == EVERYTHING){
    215  1.1      cgd 					for (n=0; n < NUMOFOBJECTS; n++)
    216  1.1      cgd 						if (testbit(inven,n)){
    217  1.1      cgd 							wordvalue[wordnumber+1] = n;
    218  1.1      cgd 							wordnumber = eat();
    219  1.1      cgd 						}
    220  1.1      cgd 					wordnumber += 2;
    221  1.1      cgd 				}
    222  1.1      cgd 				else
    223  1.1      cgd 					eat();
    224  1.1      cgd 				break;
    225  1.1      cgd 
    226  1.1      cgd 
    227  1.1      cgd 			case PUT:
    228  1.1      cgd 				put();
    229  1.1      cgd 				break;
    230  1.1      cgd 
    231  1.1      cgd 
    232  1.1      cgd 			case INVEN:
    233  1.1      cgd 				if (ucard(inven)){
    234  1.1      cgd 					puts("You are holding:\n");
    235  1.1      cgd 					for (n=0; n < NUMOFOBJECTS; n++)
    236  1.1      cgd 						if (testbit(inven,n))
    237  1.1      cgd 							printf("\t%s\n", objsht[n]);
    238  1.1      cgd 					printf("\n= %d kilogram%s (%d%%)\n", carrying, (carrying == 1 ? "." : "s."),(WEIGHT ? carrying*100/WEIGHT : -1));
    239  1.1      cgd 					printf("Your arms are %d%% full.\n",encumber*100/CUMBER);
    240  1.1      cgd 				}
    241  1.1      cgd 				else
    242  1.1      cgd 					puts("You aren't carrying anything.");
    243  1.1      cgd 
    244  1.1      cgd 				if (ucard(wear)){
    245  1.1      cgd 					puts("\nYou are wearing:\n");
    246  1.1      cgd 					for (n=0; n < NUMOFOBJECTS; n++)
    247  1.1      cgd 						if (testbit(wear,n))
    248  1.1      cgd 							printf("\t%s\n", objsht[n]);
    249  1.1      cgd 				}
    250  1.1      cgd 				else
    251  1.1      cgd 					puts("\nYou are stark naked.");
    252  1.1      cgd 				if (card(injuries,NUMOFINJURIES)){
    253  1.1      cgd 					puts("\nYou have suffered:\n");
    254  1.1      cgd 					for (n=0; n < NUMOFINJURIES; n++)
    255  1.1      cgd 						if (injuries[n])
    256  1.1      cgd 							printf("\t%s\n",ouch[n]);
    257  1.1      cgd 					printf("\nYou can still carry up to %d kilogram%s\n",WEIGHT,(WEIGHT == 1 ? "." : "s."));
    258  1.1      cgd 				}
    259  1.1      cgd 				else
    260  1.1      cgd 					puts("\nYou are in perfect health.");
    261  1.1      cgd 				break;
    262  1.1      cgd 
    263  1.1      cgd 			case USE:
    264  1.1      cgd 				lflag = use();
    265  1.1      cgd 				break;
    266  1.1      cgd 
    267  1.1      cgd 			case LOOK:
    268  1.1      cgd 				if (!notes[CANTSEE] || testbit(inven,LAMPON) || testbit(location[position].objects,LAMPON) || matchlight){
    269  1.1      cgd 					beenthere[position] = 2;
    270  1.1      cgd 					writedes();
    271  1.1      cgd 					printobjs();
    272  1.1      cgd 					if (matchlight){
    273  1.1      cgd 						puts("\nYour match splutters out.");
    274  1.1      cgd 						matchlight = 0;
    275  1.1      cgd 					}
    276  1.1      cgd 				} else
    277  1.1      cgd 					puts("I can't see anything.");
    278  1.1      cgd 				return(-1);
    279  1.1      cgd 				break;
    280  1.1      cgd 
    281  1.1      cgd 			 case SU:
    282  1.1      cgd 			 if (wiz || tempwiz){
    283  1.1      cgd 				printf("\nRoom (was %d) = ", position);
    284  1.1      cgd 				fgets(buffer,10,stdin);
    285  1.1      cgd 				if (*buffer != '\n')
    286  1.1      cgd 					sscanf(buffer,"%d", &position);
    287  1.1      cgd 				printf("Time (was %d) = ",time);
    288  1.1      cgd 				fgets(buffer,10,stdin);
    289  1.1      cgd 				if (*buffer != '\n')
    290  1.1      cgd 					sscanf(buffer,"%d", &time);
    291  1.1      cgd 				printf("Fuel (was %d) = ",fuel);
    292  1.1      cgd 				fgets(buffer,10,stdin);
    293  1.1      cgd 				if (*buffer != '\n')
    294  1.1      cgd 					sscanf(buffer,"%d", &fuel);
    295  1.1      cgd 				printf("Torps (was %d) = ",torps);
    296  1.1      cgd 				fgets(buffer,10,stdin);
    297  1.1      cgd 				if (*buffer != '\n')
    298  1.1      cgd 					sscanf(buffer,"%d", &torps);
    299  1.1      cgd 				printf("CUMBER (was %d) = ",CUMBER);
    300  1.1      cgd 				fgets(buffer,10,stdin);
    301  1.1      cgd 				if (*buffer != '\n')
    302  1.1      cgd 					sscanf(buffer,"%d", &CUMBER);
    303  1.1      cgd 				printf("WEIGHT (was %d) = ",WEIGHT);
    304  1.1      cgd 				fgets(buffer,10,stdin);
    305  1.1      cgd 				if (*buffer != '\n')
    306  1.1      cgd 					sscanf(buffer,"%d",&WEIGHT);
    307  1.1      cgd 				printf("Clock (was %d) = ",clock);
    308  1.1      cgd 				fgets(buffer,10,stdin);
    309  1.1      cgd 				if (*buffer != '\n')
    310  1.1      cgd 					sscanf(buffer,"%d",&clock);
    311  1.1      cgd 				printf("Wizard (was %d, %d) = ",wiz, tempwiz);
    312  1.1      cgd 				fgets(buffer,10,stdin);
    313  1.1      cgd 				if (*buffer != '\n'){
    314  1.1      cgd 					sscanf(buffer,"%d",&junk);
    315  1.1      cgd 					if (!junk)
    316  1.1      cgd 						tempwiz = wiz = 0;
    317  1.1      cgd 				}
    318  1.1      cgd 				printf("\nDONE.\n");
    319  1.1      cgd 				return(0);
    320  1.1      cgd 			 }
    321  1.1      cgd 			 else
    322  1.1      cgd 				 puts("You aren't a wizard.");
    323  1.1      cgd 			 break;
    324  1.1      cgd 
    325  1.1      cgd 			 case SCORE:
    326  1.1      cgd 				printf("\tPLEASURE\tPOWER\t\tEGO\n");
    327  1.1      cgd 				printf("\t%3d\t\t%3d\t\t%3d\n\n",pleasure,power,ego);
    328  1.1      cgd 				printf("This gives you the rating of %s in %d turns.\n",rate(),time);
    329  1.1      cgd 				printf("You have visited %d out of %d rooms this run (%d%%).\n",card(beenthere,NUMOFROOMS),NUMOFROOMS,card(beenthere,NUMOFROOMS)*100/NUMOFROOMS);
    330  1.1      cgd 				break;
    331  1.1      cgd 
    332  1.1      cgd 			 case KNIFE:
    333  1.1      cgd 			 case KILL:
    334  1.1      cgd 				murder();
    335  1.1      cgd 				break;
    336  1.1      cgd 
    337  1.1      cgd 			 case UNDRESS:
    338  1.1      cgd 			 case RAVAGE:
    339  1.1      cgd 				ravage();
    340  1.1      cgd 				break;
    341  1.1      cgd 
    342  1.1      cgd 			 case SAVE:
    343  1.1      cgd 				save();
    344  1.1      cgd 				break;
    345  1.1      cgd 
    346  1.1      cgd 			 case FOLLOW:
    347  1.1      cgd 				lflag = follow();
    348  1.1      cgd 				break;
    349  1.1      cgd 
    350  1.1      cgd 			 case GIVE:
    351  1.1      cgd 				give();
    352  1.1      cgd 				break;
    353  1.1      cgd 
    354  1.1      cgd 			 case KISS:
    355  1.1      cgd 				kiss();
    356  1.1      cgd 				break;
    357  1.1      cgd 
    358  1.1      cgd 			 case LOVE:
    359  1.1      cgd 				 love();
    360  1.1      cgd 				 break;
    361  1.1      cgd 
    362  1.1      cgd 			 case RIDE:
    363  1.1      cgd 				lflag = ride();
    364  1.1      cgd 				break;
    365  1.1      cgd 
    366  1.1      cgd 			 case DRIVE:
    367  1.1      cgd 				lflag = drive();
    368  1.1      cgd 				break;
    369  1.1      cgd 
    370  1.1      cgd 			 case LIGHT:
    371  1.1      cgd 				 light();
    372  1.1      cgd 				 break;
    373  1.1      cgd 
    374  1.1      cgd 			 case LAUNCH:
    375  1.1      cgd 				if (!launch())
    376  1.1      cgd 					return(-1);
    377  1.1      cgd 				else
    378  1.1      cgd 					lflag = 0;
    379  1.1      cgd 				break;
    380  1.1      cgd 
    381  1.1      cgd 			case LANDIT:
    382  1.1      cgd 				if (!land())
    383  1.1      cgd 					return(-1);
    384  1.1      cgd 				else
    385  1.1      cgd 					lflag = 0;
    386  1.1      cgd 				break;
    387  1.1      cgd 
    388  1.1      cgd 			case TIME:
    389  1.1      cgd 				chime();
    390  1.1      cgd 				break;
    391  1.1      cgd 
    392  1.1      cgd 			 case SLEEP:
    393  1.1      cgd 				zzz();
    394  1.1      cgd 				break;
    395  1.1      cgd 
    396  1.1      cgd 			 case DIG:
    397  1.1      cgd 				dig();
    398  1.1      cgd 				break;
    399  1.1      cgd 
    400  1.1      cgd 			 case JUMP:
    401  1.1      cgd 				lflag = jump();
    402  1.1      cgd 				break;
    403  1.1      cgd 
    404  1.1      cgd 			 case BURY:
    405  1.1      cgd 				bury();
    406  1.1      cgd 				break;
    407  1.1      cgd 
    408  1.1      cgd 			 case SWIM:
    409  1.1      cgd 				puts("Surf's up!");
    410  1.1      cgd 				break;
    411  1.1      cgd 
    412  1.1      cgd 			 case DRINK:
    413  1.1      cgd 				drink();
    414  1.1      cgd 				break;
    415  1.1      cgd 
    416  1.1      cgd 			 case QUIT:
    417  1.1      cgd 				die();
    418  1.1      cgd 
    419  1.1      cgd 			 default:
    420  1.1      cgd 				puts("How's that?");
    421  1.1      cgd 				return(-1);
    422  1.1      cgd 				break;
    423  1.1      cgd 
    424  1.1      cgd 
    425  1.1      cgd 		}
    426  1.1      cgd 		if (wordnumber < wordcount && *words[wordnumber++] == ',')
    427  1.1      cgd 			continue;
    428  1.1      cgd 		else return(lflag);
    429  1.1      cgd        }
    430  1.1      cgd        return(lflag);
    431  1.1      cgd }
    432