1 /*- 2 * Copyright (c) 1993 3 * The Regents of the University of California. All rights reserved. 4 * 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. 9 * 10 * Redistribution and use in source and binary forms, with or without 11 * modification, are permitted provided that the following conditions 12 * are met: 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. 25 * 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 36 * SUCH DAMAGE. 37 * 38 * @(#)init.c 8.1 (Berkeley) 6/2/93 39 * $FreeBSD: src/games/adventure/init.c,v 1.9.2.1 2001/03/05 11:43:11 kris Exp $ 40 * $DragonFly: src/games/adventure/init.c,v 1.3 2004/09/12 17:19:58 dillon Exp $ 41 */ 42 43 /* Re-coding of advent in C: data initialization */ 44 45 #include <sys/types.h> 46 #include <signal.h> 47 #include <stdio.h> 48 #include <stdlib.h> 49 #include "hdr.h" 50 51 int blklin = TRUE; 52 53 int setbit[16] = {1,2,4,010,020,040,0100,0200,0400,01000,02000,04000, 54 010000,020000,040000,0100000}; 55 56 static void linkdata (void); 57 58 void 59 init() /* everything for 1st time run */ 60 { 61 rdata(); /* read data from orig. file */ 62 linkdata(); 63 poof(); 64 } 65 66 char *decr(a,b,c,d,e) 67 const char *a,*b,*c,*d,*e; 68 { 69 static char buf[6]; 70 71 buf[0] = a[0]; 72 buf[1] = b[0]; 73 buf[2] = c[0]; 74 buf[3] = d[0]; 75 buf[4] = e[0]; 76 buf[5] = 0; 77 return buf; 78 } 79 80 static void 81 linkdata() /* secondary data manipulation */ 82 { int i,j; 83 84 /* array linkages */ 85 for (i=1; i<=LOCSIZ; i++) 86 if (ltext[i].seekadr!=0 && travel[i] != 0) 87 if ((travel[i]->tverb)==1) cond[i]=2; 88 for (j=100; j>0; j--) 89 if (fixd[j]>0) 90 { drop(j+100,fixd[j]); 91 drop(j,plac[j]); 92 } 93 for (j=100; j>0; j--) 94 { fixed[j]=fixd[j]; 95 if (plac[j]!=0 && fixd[j]<=0) drop(j,plac[j]); 96 } 97 98 maxtrs=79; 99 tally=0; 100 tally2=0; 101 102 for (i=50; i<=maxtrs; i++) 103 { if (ptext[i].seekadr!=0) prop[i] = -1; 104 tally -= prop[i]; 105 } 106 107 /* define mnemonics */ 108 keys = vocab(DECR(k,e,y,s,\0), 1, 0); 109 lamp = vocab(DECR(l,a,m,p,\0), 1, 0); 110 grate = vocab(DECR(g,r,a,t,e), 1, 0); 111 cage = vocab(DECR(c,a,g,e,\0),1, 0); 112 rod = vocab(DECR(r,o,d,\0,\0),1, 0); 113 rod2=rod+1; 114 steps=vocab(DECR(s,t,e,p,s),1, 0); 115 bird = vocab(DECR(b,i,r,d,\0),1, 0); 116 door = vocab(DECR(d,o,o,r,\0),1, 0); 117 pillow= vocab(DECR(p,i,l,l,o), 1, 0); 118 snake = vocab(DECR(s,n,a,k,e), 1, 0); 119 fissur= vocab(DECR(f,i,s,s,u), 1, 0); 120 tablet= vocab(DECR(t,a,b,l,e), 1, 0); 121 clam = vocab(DECR(c,l,a,m,\0),1, 0); 122 oyster= vocab(DECR(o,y,s,t,e), 1, 0); 123 magzin= vocab(DECR(m,a,g,a,z), 1, 0); 124 dwarf = vocab(DECR(d,w,a,r,f), 1, 0); 125 knife = vocab(DECR(k,n,i,f,e), 1, 0); 126 food = vocab(DECR(f,o,o,d,\0),1, 0); 127 bottle= vocab(DECR(b,o,t,t,l), 1, 0); 128 water = vocab(DECR(w,a,t,e,r), 1, 0); 129 oil = vocab(DECR(o,i,l,\0,\0),1, 0); 130 plant = vocab(DECR(p,l,a,n,t), 1, 0); 131 plant2=plant+1; 132 axe = vocab(DECR(a,x,e,\0,\0), 1, 0); 133 mirror= vocab(DECR(m,i,r,r,o), 1, 0); 134 dragon= vocab(DECR(d,r,a,g,o), 1, 0); 135 chasm = vocab(DECR(c,h,a,s,m), 1, 0); 136 troll = vocab(DECR(t,r,o,l,l), 1, 0); 137 troll2=troll+1; 138 bear = vocab(DECR(b,e,a,r,\0),1, 0); 139 messag= vocab(DECR(m,e,s,s,a), 1, 0); 140 vend = vocab(DECR(v,e,n,d,i), 1, 0); 141 batter= vocab(DECR(b,a,t,t,e), 1, 0); 142 143 nugget= vocab(DECR(g,o,l,d,\0),1, 0); 144 coins = vocab(DECR(c,o,i,n,s), 1, 0); 145 chest = vocab(DECR(c,h,e,s,t), 1, 0); 146 eggs = vocab(DECR(e,g,g,s,\0),1, 0); 147 tridnt= vocab(DECR(t,r,i,d,e), 1, 0); 148 vase = vocab(DECR(v,a,s,e,\0),1, 0); 149 emrald= vocab(DECR(e,m,e,r,a), 1, 0); 150 pyram = vocab(DECR(p,y,r,a,m), 1, 0); 151 pearl = vocab(DECR(p,e,a,r,l), 1, 0); 152 rug = vocab(DECR(r,u,g,\0,\0),1, 0); 153 chain = vocab(DECR(c,h,a,i,n), 1, 0); 154 155 back = vocab(DECR(b,a,c,k,\0),0, 0); 156 look = vocab(DECR(l,o,o,k,\0),0, 0); 157 cave = vocab(DECR(c,a,v,e,\0),0, 0); 158 null = vocab(DECR(n,u,l,l,\0),0, 0); 159 entrnc= vocab(DECR(e,n,t,r,a), 0, 0); 160 dprssn= vocab(DECR(d,e,p,r,e), 0, 0); 161 enter = vocab(DECR(e,n,t,e,r), 0, 0); 162 163 pour = vocab(DECR(p,o,u,r,\0), 2, 0); 164 say = vocab(DECR(s,a,y,\0,\0),2, 0); 165 lock = vocab(DECR(l,o,c,k,\0),2, 0); 166 throw = vocab(DECR(t,h,r,o,w), 2, 0); 167 find = vocab(DECR(f,i,n,d,\0),2, 0); 168 invent= vocab(DECR(i,n,v,e,n), 2, 0); 169 170 /* initialize dwarves */ 171 chloc=114; 172 chloc2=140; 173 for (i=1; i<=6; i++) 174 dseen[i]=FALSE; 175 dflag=0; 176 dloc[1]=19; 177 dloc[2]=27; 178 dloc[3]=33; 179 dloc[4]=44; 180 dloc[5]=64; 181 dloc[6]=chloc; 182 daltlc=18; 183 184 /* random flags & ctrs */ 185 turns=0; 186 lmwarn=FALSE; 187 iwest=0; 188 knfloc=0; 189 detail=0; 190 abbnum=5; 191 for (i=0; i<=4; i++) 192 if (rtext[2*i+81].seekadr!=0) maxdie=i+1; 193 numdie=holdng=dkill=foobar=bonus=0; 194 clock1=30; 195 clock2=50; 196 saved=0; 197 closng=panic=closed=scorng=FALSE; 198 } 199 200 201 202 void 203 trapdel(sig) /* come here if he hits a del */ 204 int sig; 205 { 206 sig = 0; 207 delhit = 1; /* main checks, treats as QUIT */ 208 signal(2,trapdel); /* catch subsequent DELs */ 209 } 210 211 212 void 213 startup() 214 { 215 demo=Start(); 216 srandomdev(); 217 hinted[3]=yes(65,1,0); 218 newloc=1; 219 delhit = 0; 220 limit=330; 221 if (hinted[3]) limit=1000; /* better batteries if instrucs */ 222 } 223