2 * Copyright (c) 1991, 1993
3 * The Regents of the University of California. All rights reserved.
5 * The game adventure was originally written in Fortran by Will Crowther
6 * and Don Woods. It was later translated to C and enhanced by Jim
7 * Gillogly. This code is derived from software contributed to Berkeley
8 * by Jim Gillogly at The Rand Corporation.
10 * Redistribution and use in source and binary forms, with or without
11 * modification, are permitted provided that the following conditions
13 * 1. Redistributions of source code must retain the above copyright
14 * notice, this list of conditions and the following disclaimer.
15 * 2. Redistributions in binary form must reproduce the above copyright
16 * notice, this list of conditions and the following disclaimer in the
17 * documentation and/or other materials provided with the distribution.
18 * 3. All advertising materials mentioning features or use of this software
19 * must display the following acknowledgement:
20 * This product includes software developed by the University of
21 * California, Berkeley and its contributors.
22 * 4. Neither the name of the University nor the names of its contributors
23 * may be used to endorse or promote products derived from this software
24 * without specific prior written permission.
26 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
27 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
28 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
29 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
30 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
31 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
32 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
33 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
34 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
35 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
38 * @(#)subr.c 8.1 (Berkeley) 5/31/93
39 * $FreeBSD: src/games/adventure/subr.c,v 1.7.2.1 2001/03/05 11:43:11 kris Exp $
40 * $DragonFly: src/games/adventure/subr.c,v 1.2 2003/06/17 04:25:22 dillon Exp $
43 /* Re-coding of advent in C: subroutines from main */
49 static void badmove (void);
50 static int bitset (int,int);
51 static int dropper (void);
52 static int liq2 (int);
53 static int mback (void);
54 static int specials (void);
55 static int trbridge (void);
57 /* Statement functions */
61 { if (place[objj] == -1) return(TRUE);
68 { if (place[objj]==loc || toting(objj)) return(TRUE);
75 { if (place[objj]==loc || fixed[objj]==loc) return(TRUE);
82 { return((1-pbotl)*water+(pbotl/2)*(water+oil));
89 if (i>-1-i) return(liq2(i));
90 else return(liq2(-1-i));
94 liqloc(locc) /* may want to clean this one up a bit */
107 { if (cond[l] & setbit[n]) return(TRUE);
114 { if (cond[locc]==2) return(TRUE);
120 { if ((cond[loc]%2)==0 && (prop[lamp]==0 || !here(lamp)))
128 { if (ran(100)<n) return(TRUE);
138 if (newloc!=loc&&!forced(loc)&&!bitset(loc,3))
139 { for (i=1; i<=5; i++)
140 { if (odloc[i]!=newloc||!dseen[i]) continue;
147 if (loc==0||forced(loc)||bitset(newloc,3)) return(2000);
149 { if (loc>=15) dflag=1;
152 if (dflag==1) /* 6000 */
153 { if (loc<15||pct(95)) return(2000);
157 if (pct(50)&&saved== -1) dloc[j]=0; /* 6001 */
160 { if (dloc[i]==loc) dloc[i]=daltlc;
161 odloc[i]=dloc[i]; /* 6002 */
167 dtotal=attack=stick=0; /* 6010 */
168 for (i=1; i<=6; i++) /* loop to 6030 */
169 { if (dloc[i]==0) continue;
171 for (kk=travel[dloc[i]]; kk!=0; kk=kk->next)
173 if (newloc>300||newloc<15||newloc==odloc[i]
174 ||(j>1&&newloc==tk[j-1])||j>=20
175 ||newloc==dloc[i]||forced(newloc)
176 ||(i==6&&bitset(newloc,3))
177 ||kk->conditions==100) continue;
180 tk[j]=odloc[i]; /* 6016 */
185 dseen[i]=(dseen[i]&&loc>=15)||(dloc[i]==loc||odloc[i]==loc);
186 if (!dseen[i]) continue; /* i.e. goto 6030 */
188 if (i==6) /* pirate's spotted him */
189 { if (loc==chloc||prop[chest]>=0) continue;
191 for (j=50; j<=maxtrs; j++) /* loop to 6020 */
192 { if (j==pyram&&(loc==plac[pyram]
193 || loc==plac[emrald])) goto l6020;
194 if (toting(j)) goto l6022;
195 l6020: if (here(j)) k=1;
197 if (tally==tally2+1 && k==0 && place[chest]==0
198 &&here(lamp) && prop[lamp]==1) goto l6025;
199 if (odloc[6]!=dloc[6]&&pct(20))
201 continue; /* to 6030 */
203 if (place[messag]==0) move(chest,chloc);
205 for (j=50; j<=maxtrs; j++) /* loop to 6023 */
206 { if (j==pyram && (loc==plac[pyram]
207 || loc==plac[emrald])) continue;
208 if (at(j)&&fixed[j]==0) carry(j,loc);
209 if (toting(j)) drop(j,chloc);
211 l6024: dloc[6]=odloc[6]=chloc;
220 if (odloc[i]!=dloc[i]) continue;
222 if (knfloc>=0) knfloc=loc;
223 if (ran(1000)<95*(dflag-2)) stick++;
225 if (dtotal==0) return(2000);
227 { printf("There are %d threatening little dwarves ",dtotal);
228 printf("in the room with you.\n");
231 if (attack==0) return(2000);
232 if (dflag==2) dflag=3;
233 if (saved!= -1) dflag=20;
235 { printf("%d of them throw knives at you!\n",attack);
237 l82: if (stick<=1) /* 82 */
239 if (stick==0) return(2000);
242 printf("%d of them get you!\n",stick); /* 83 */
253 march() /* label 8 */
256 if ((tkk=travel[newloc=loc])==0) bug(26);
257 if (k==null) return(2);
258 if (k==cave) /* 40 */
259 { if (loc<8) rspeak(57);
260 if (loc>=8) rspeak(58);
263 if (k==look) /* 30 */
264 { if (detail++<3) rspeak(15);
269 if (k==back) /* 20 */
279 for (; tkk!=0; tkk=tkk->next)
280 if (tkk->tverb==1 || tkk->tverb==k) break;
285 l11: ll1=tkk->conditions; /* 11 */
287 newloc=ll1; /* newloc=conditions */
288 k=newloc%100; /* k used for prob */
290 { if (newloc<=100) /* 13 */
291 { if (newloc!=0&&!pct(newloc)) goto l12; /* 14 */
292 l16: newloc=ll2; /* newloc=location */
293 if (newloc<=300) return(2);
295 switch(specials())/* to 30000 */
305 if (toting(k)||(newloc>200&&at(k))) goto l16;
308 if (prop[k]!=(newloc/100)-3) goto l16; /* newloc still conditions*/
309 l12: /* alternative to probability move */
310 for (; tkk!=0; tkk=tkk->next)
311 if (tkk->tloc!=ll2 || tkk->conditions!=ll1) break;
320 { struct travlist *tk2,*j;
322 if (forced(k=oldloc)) k=oldlc2; /* k=location */
330 for (; tkk!=0; tkk=tkk->next) /* 21 */
333 { k=tkk->tverb; /* k back to verb */
339 if (forced(ll) && k==j->tloc) tk2=tkk;
354 specials() /* 30000 */
355 { switch(newloc -= 300)
356 { case 1: /* 30100 */
358 if (holdng==0||(holdng==1&&toting(emrald))) return(2);
365 case 3: /* to 30300 */
375 trbridge() /* 30300 */
376 { if (prop[troll]==1)
381 move(troll,plac[troll]);
382 move(troll+100,fixd[troll]);
387 newloc=plac[troll]+fixd[troll]-loc; /* 30310 */
388 if (prop[troll]==0) prop[troll]=1;
389 if (!toting(bear)) return(2);
396 if (prop[spices]<0) tally2++;
405 if (k>=43 && k<=50) spk=9;
406 if (k==29||k==30) spk=9;
407 if (k==7||k==36||k==37) spk=10;
408 if (k==11||k==19) spk=11;
409 if (verb==find||verb==invent) spk=59;
410 if (k==62||k==65) spk=42;
418 { printf("Please tell jim@rand.org that fatal bug %d happened.\n",n);
424 checkhints() /* 2600 &c */
426 for (hint=4; hint<=hntmax; hint++)
427 { if (hinted[hint]) continue;
428 if (!bitset(loc,hint)) hintlc[hint]= -1;
430 if (hintlc[hint]<hints[hint][1]) continue;
432 { case 4: /* 40400 */
433 if (prop[grate]==0&&!here(keys)) goto l40010;
436 if (here(bird)&&toting(rod)&&obj==bird) goto l40010;
437 continue; /* i.e. goto l40030 */
439 if (here(snake)&&!here(bird)) goto l40010;
442 if (atloc[loc]==0&&atloc[oldloc]==0
443 && atloc[oldlc2]==0&&holdng>1) goto l40010;
446 if (prop[emrald]!= -1&&prop[pyram]== -1) goto l40010;
449 goto l40010; /* 40900 */
452 l40010: hintlc[hint]=0;
453 if (!yes(hints[hint][3],0,54)) continue;
454 printf("I am prepared to give you a hint, but it will ");
455 printf("cost you %d points.\n",hints[hint][2]);
456 hinted[hint]=yes(175,hints[hint][4],54);
457 l40020: hintlc[hint]=0;
465 if (*wd2!=0) strcpy(wd1,wd2);
467 if (i==62||i==65||i==71||i==2025)
472 printf("\nOkay, \"%s\".\n",wd2);
480 if (toting(obj)) return(2011); /* 9010 */
482 if (obj==plant&&prop[plant]<=0) spk=115;
483 if (obj==bear&&prop[bear]==1) spk=169;
484 if (obj==chain&&prop[bear]!=0) spk=170;
485 if (fixed[obj]!=0) return(2011);
486 if (obj==water||obj==oil)
487 { if (here(bottle)&&liq()==obj)
492 if (toting(bottle)&&prop[bottle]==1)
494 if (prop[bottle]!=1) spk=105;
495 if (!toting(bottle)) spk=104;
498 l9017: if (holdng>=7)
503 { if (prop[bird]!=0) goto l9014;
508 if (!toting(cage)) /* 9013 */
512 prop[bird]=1; /* 9015 */
514 l9014: if ((obj==bird||obj==cage)&&prop[bird]!=0)
515 carry(bird+cage-obj,loc);
518 if (obj==bottle && k!=0) place[k] = -1;
526 if (k==obj) obj=bottle;
527 if (obj==bottle&&k!=0) place[k]=0;
528 if (obj==cage&&prop[bird]!=0) drop(bird,loc);
529 if (obj==bird) prop[bird]=0;
537 if (toting(rod2)&&obj==rod&&!toting(rod)) obj=rod2;
538 if (!toting(obj)) return(2011);
539 if (obj==bird&&here(snake))
541 if (closed) return(19000);
546 if (obj==coins&&here(vend)) /* 9024 */
552 if (obj==bird&&at(dragon)&&prop[dragon]==0) /* 9025 */
556 if (place[snake]==plac[snake]) tally2--;
559 if (obj==bear&&at(troll)) /* 9026 */
563 move(troll2,plac[troll]);
564 move(troll2+100,fixd[troll]);
569 if (obj!=vase||loc==plac[pillow]) /* 9027 */
573 prop[vase]=2; /* 9028 */
574 if (at(pillow)) prop[vase]=0;
575 pspeak(vase,prop[vase]+1);
576 if (prop[vase]!=0) fixed[vase] = -1;
583 { if (obj==clam||obj==oyster)
585 if (obj==oyster) k=1;
587 if (toting(obj)) spk=120+k;
588 if (!toting(tridnt)) spk=122+k;
589 if (verb==lock) spk=61;
590 if (spk!=124) return(2011);
596 if (obj==door) spk=111;
597 if (obj==door&&prop[door]==1) spk=54;
598 if (obj==cage) spk=32;
599 if (obj==keys) spk=55;
600 if (obj==grate||obj==chain) spk=31;
601 if (spk!=31||!here(keys)) return(2011);
604 { spk=172; /* 9049: lock */
605 if (prop[chain]!=0) spk=34;
606 if (loc!=plac[chain]) spk=173;
607 if (spk!=172) return(2011);
609 if (toting(chain)) drop(chain,loc);
614 if (prop[bear]==0) spk=41;
615 if (prop[chain]==0) spk=37;
616 if (spk!=171) return(2011);
619 if (prop[bear]!=3) prop[bear]=2;
620 fixed[bear]=2-prop[bear];
625 if (!panic) clock2=15;
629 k=34+prop[grate]; /* 9043 */
631 if (verb==lock) prop[grate]=0;
641 if (dloc[i]==loc&&dflag>=2) break;
643 if (obj==0) /* 9122 */
644 { if (i!=0) obj=dwarf;
645 if (here(snake)) obj=obj*100+snake;
646 if (at(dragon)&&prop[dragon]==0) obj=obj*100+dragon;
647 if (at(troll)) obj=obj*100+troll;
648 if (here(bear)&&prop[bear]==0) obj=obj*100+bear;
649 if (obj>100) return(8000);
651 { if (here(bird)&&verb!=throw) obj=bird;
652 if (here(clam)||here(oyster)) obj=100*obj+clam;
653 if (obj>100) return(8000);
656 if (obj==bird) /* 9124 */
658 if (closed) return(2011);
661 if (place[snake]==plac[snake]) tally2++;
664 if (obj==0) spk=44; /* 9125 */
665 if (obj==clam||obj==oyster) spk=150;
666 if (obj==snake) spk=46;
667 if (obj==dwarf) spk=49;
668 if (obj==dwarf&&closed) return(19000);
669 if (obj==dragon) spk=147;
670 if (obj==troll) spk=157;
671 if (obj==bear) spk=165+(prop[bear]+1)/2;
672 if (obj!=dragon||prop[dragon]!=0) return(2011);
677 if (strncmp(wd1,"y",1)&&strncmp(wd1,"yes",3)) return(2608);
681 k=(plac[dragon]+fixd[dragon])/2;
686 for (obj=1; obj<=100; obj++)
687 if (place[obj]==plac[dragon]||place[obj]==fixd[dragon])
696 trtoss() /* 9170: throw */
698 if (toting(rod2)&&obj==rod&&!toting(rod)) obj=rod2;
699 if (!toting(obj)) return(2011);
700 if (obj>=50&&obj<=maxtrs&&at(troll))
701 { spk=159; /* 9178 */
705 drop(troll2,plac[troll]);
706 drop(troll2+100,fixd[troll]);
710 if (obj==food&&here(bear))
711 { obj=bear; /* 9177 */
714 if (obj!=axe) return(9020);
718 if (ran(3)==0||saved!= -1)
719 l9175: { rspeak(spk);
728 if (dkill==1) spk=149;
733 if (at(dragon)&&prop[dragon]==0)
736 if (at(troll)) goto l9175;
737 if (here(bear)&&prop[bear]==0)
756 if (obj==snake||obj==dragon||obj==troll)
758 if (obj==dragon&&prop[dragon]!=0) spk=110;
759 if (obj==troll) spk=182;
760 if (obj!=snake||closed||!here(bird)) return(2011);
768 { if (!here(food)) return(2011);
774 { if (prop[bear]==0) spk=102;
775 if (prop[bear]==3) spk=110;
776 if (!here(food)) return(2011);
793 if (liqloc(loc)==0) spk=144;
794 if (liqloc(loc)==0||!toting(vase)) return(2011);
798 return(9020); /* advent/10 goes to 9024 */
800 if (obj!=0&&obj!=bottle) return(2011);
801 if (obj==0&&!here(bottle)) return(8000);
803 if (liqloc(loc)==0) spk=106;
804 if (liq()!=0) spk=105;
805 if (spk!=107) return(2011);
806 prop[bottle]=((cond[loc]%4)/2)*2;
808 if (toting(bottle)) place[k]= -1;
815 closing() /* 10000 */
818 prop[grate]=prop[fissur]=0;
825 move(troll2,plac[troll]);
826 move(troll2+100,fixd[troll]);
828 if(prop[bear]!=3) dstroy(bear);
840 caveclose() /* 11000 */
842 prop[bottle]=put(bottle,115,1);
843 prop[plant]=put(plant,115,0);
844 prop[oyster]=put(oyster,115,0);
845 prop[lamp]=put(lamp,115,0);
846 prop[rod]=put(rod,115,0);
847 prop[dwarf]=put(dwarf,115,0);
853 prop[snake]=put(snake,116,1);
854 prop[bird]=put(bird,116,1);
855 prop[cage]=put(cage,116,0);
856 prop[rod2]=put(rod2,116,0);
857 prop[pillow]=put(pillow,116,0);
859 prop[mirror]=put(mirror,115,0);
862 for (i=1; i<=100; i++)
863 if (toting(i)) dstroy(i);