init.c revision 1.6
1 /* $NetBSD: init.c,v 1.6 1997/10/10 11:59:42 lukem Exp $ */ 2 3 /*- 4 * Copyright (c) 1993 5 * The Regents of the University of California. All rights reserved. 6 * 7 * The game adventure was originally written in Fortran by Will Crowther 8 * and Don Woods. It was later translated to C and enhanced by Jim 9 * Gillogly. This code is derived from software contributed to Berkeley 10 * by Jim Gillogly at The Rand Corporation. 11 * 12 * Redistribution and use in source and binary forms, with or without 13 * modification, are permitted provided that the following conditions 14 * are met: 15 * 1. Redistributions of source code must retain the above copyright 16 * notice, this list of conditions and the following disclaimer. 17 * 2. Redistributions in binary form must reproduce the above copyright 18 * notice, this list of conditions and the following disclaimer in the 19 * documentation and/or other materials provided with the distribution. 20 * 3. All advertising materials mentioning features or use of this software 21 * must display the following acknowledgement: 22 * This product includes software developed by the University of 23 * California, Berkeley and its contributors. 24 * 4. Neither the name of the University nor the names of its contributors 25 * may be used to endorse or promote products derived from this software 26 * without specific prior written permission. 27 * 28 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 29 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 30 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 31 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 32 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 33 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 34 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 35 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 36 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 37 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 38 * SUCH DAMAGE. 39 */ 40 41 #include <sys/cdefs.h> 42 #ifndef lint 43 #if 0 44 static char sccsid[] = "@(#)init.c 8.1 (Berkeley) 6/2/93"; 45 #else 46 __RCSID("$NetBSD: init.c,v 1.6 1997/10/10 11:59:42 lukem Exp $"); 47 #endif 48 #endif /* not lint */ 49 50 /* Re-coding of advent in C: data initialization */ 51 52 #include <sys/types.h> 53 #include <signal.h> 54 #include <stdio.h> 55 #include <stdlib.h> 56 #include <unistd.h> 57 #include "hdr.h" 58 #include "extern.h" 59 60 int blklin = TRUE; 61 62 int setbit[16] = {1,2,4,010,020,040,0100,0200,0400,01000,02000,04000, 63 010000,020000,040000,0100000}; 64 65 66 void 67 init(command) /* everything for 1st time run */ 68 char *command; /* command we were called with */ 69 { 70 rdata(); /* read data from orig. file */ 71 linkdata(); 72 poof(); 73 } 74 75 char *decr(a,b,c,d,e) 76 char a,b,c,d,e; 77 { 78 static char buf[6]; 79 80 buf[0] = a-'+'; 81 buf[1] = b-'-'; 82 buf[2] = c-'#'; 83 buf[3] = d-'&'; 84 buf[4] = e-'%'; 85 buf[5] = 0; 86 return buf; 87 } 88 89 void 90 linkdata() /* secondary data manipulation */ 91 { int i,j; 92 93 /* array linkages */ 94 for (i=1; i<=LOCSIZ; i++) 95 if (ltext[i].seekadr!=0 && travel[i] != 0) 96 if ((travel[i]->tverb)==1) cond[i]=2; 97 for (j=100; j>0; j--) 98 if (fixd[j]>0) 99 { drop(j+100,fixd[j]); 100 drop(j,plac[j]); 101 } 102 for (j=100; j>0; j--) 103 { fixed[j]=fixd[j]; 104 if (plac[j]!=0 && fixd[j]<=0) drop(j,plac[j]); 105 } 106 107 maxtrs=79; 108 tally=0; 109 tally2=0; 110 111 for (i=50; i<=maxtrs; i++) 112 { if (ptext[i].seekadr!=0) prop[i] = -1; 113 tally -= prop[i]; 114 } 115 116 /* define mnemonics */ 117 keys = vocab(DECR('k','e','y','s','\0'), 1, 0); 118 lamp = vocab(DECR('l','a','m','p','\0'), 1, 0); 119 grate = vocab(DECR('g','r','a','t','e'), 1, 0); 120 cage = vocab(DECR('c','a','g','e','\0'),1, 0); 121 rod = vocab(DECR('r','o','d','\0','\0'),1, 0); 122 rod2=rod+1; 123 steps=vocab(DECR('s','t','e','p','s'),1, 0); 124 bird = vocab(DECR('b','i','r','d','\0'),1, 0); 125 door = vocab(DECR('d','o','o','r','\0'),1, 0); 126 pillow= vocab(DECR('p','i','l','l','o'), 1, 0); 127 snake = vocab(DECR('s','n','a','k','e'), 1, 0); 128 fissur= vocab(DECR('f','i','s','s','u'), 1, 0); 129 tablet= vocab(DECR('t','a','b','l','e'), 1, 0); 130 clam = vocab(DECR('c','l','a','m','\0'),1, 0); 131 oyster= vocab(DECR('o','y','s','t','e'), 1, 0); 132 magzin= vocab(DECR('m','a','g','a','z'), 1, 0); 133 dwarf = vocab(DECR('d','w','a','r','f'), 1, 0); 134 knife = vocab(DECR('k','n','i','f','e'), 1, 0); 135 food = vocab(DECR('f','o','o','d','\0'),1, 0); 136 bottle= vocab(DECR('b','o','t','t','l'), 1, 0); 137 water = vocab(DECR('w','a','t','e','r'), 1, 0); 138 oil = vocab(DECR('o','i','l','\0','\0'),1, 0); 139 plant = vocab(DECR('p','l','a','n','t'), 1, 0); 140 plant2=plant+1; 141 axe = vocab(DECR('a','x','e','\0','\0'),1, 0); 142 mirror= vocab(DECR('m','i','r','r','o'), 1, 0); 143 dragon= vocab(DECR('d','r','a','g','o'), 1, 0); 144 chasm = vocab(DECR('c','h','a','s','m'), 1, 0); 145 troll = vocab(DECR('t','r','o','l','l'), 1, 0); 146 troll2=troll+1; 147 bear = vocab(DECR('b','e','a','r','\0'),1, 0); 148 messag= vocab(DECR('m','e','s','s','a'), 1, 0); 149 vend = vocab(DECR('v','e','n','d','i'), 1, 0); 150 batter= vocab(DECR('b','a','t','t','e'), 1, 0); 151 152 nugget= vocab(DECR('g','o','l','d','\0'),1, 0); 153 coins = vocab(DECR('c','o','i','n','s'), 1, 0); 154 chest = vocab(DECR('c','h','e','s','t'), 1, 0); 155 eggs = vocab(DECR('e','g','g','s','\0'),1, 0); 156 tridnt= vocab(DECR('t','r','i','d','e'), 1, 0); 157 vase = vocab(DECR('v','a','s','e','\0'),1, 0); 158 emrald= vocab(DECR('e','m','e','r','a'), 1, 0); 159 pyram = vocab(DECR('p','y','r','a','m'), 1, 0); 160 pearl = vocab(DECR('p','e','a','r','l'), 1, 0); 161 rug = vocab(DECR('r','u','g','\0','\0'),1, 0); 162 chain = vocab(DECR('c','h','a','i','n'), 1, 0); 163 164 back = vocab(DECR('b','a','c','k','\0'),0, 0); 165 look = vocab(DECR('l','o','o','k','\0'),0, 0); 166 cave = vocab(DECR('c','a','v','e','\0'),0, 0); 167 null = vocab(DECR('n','u','l','l','\0'),0, 0); 168 entrnc= vocab(DECR('e','n','t','r','a'), 0, 0); 169 dprssn= vocab(DECR('d','e','p','r','e'), 0, 0); 170 enter = vocab(DECR('e','n','t','e','r'), 0, 0); 171 172 pour = vocab(DECR('p','o','u','r','\0'), 2, 0); 173 say = vocab(DECR('s','a','y','\0','\0'),2, 0); 174 lock = vocab(DECR('l','o','c','k','\0'),2, 0); 175 throw = vocab(DECR('t','h','r','o','w'), 2, 0); 176 find = vocab(DECR('f','i','n','d','\0'),2, 0); 177 invent= vocab(DECR('i','n','v','e','n'), 2, 0); 178 179 /* initialize dwarves */ 180 chloc=114; 181 chloc2=140; 182 for (i=1; i<=6; i++) 183 dseen[i]=FALSE; 184 dflag=0; 185 dloc[1]=19; 186 dloc[2]=27; 187 dloc[3]=33; 188 dloc[4]=44; 189 dloc[5]=64; 190 dloc[6]=chloc; 191 daltlc=18; 192 193 /* random flags & ctrs */ 194 turns=0; 195 lmwarn=FALSE; 196 iwest=0; 197 knfloc=0; 198 detail=0; 199 abbnum=5; 200 for (i=0; i<=4; i++) 201 if (rtext[2*i+81].seekadr!=0) maxdie=i+1; 202 numdie=holdng=dkill=foobar=bonus=0; 203 clock1=30; 204 clock2=50; 205 saved=0; 206 closng=panic=closed=scorng=FALSE; 207 } 208 209 210 211 void 212 trapdel(n) /* come here if he hits a del */ 213 int n; 214 { delhit++; /* main checks, treats as QUIT */ 215 signal(SIGINT,trapdel); /* catch subsequent DELs */ 216 } 217 218 219 void 220 startup() 221 { 222 demo=Start(0); 223 srand((int)(time((time_t *)NULL))); /* random seed */ 224 #if 0 225 srand(371); /* non-random seed */ 226 #endif 227 hinted[3]=yes(65,1,0); 228 newloc=1; 229 delhit = 0; 230 limit=330; 231 if (hinted[3]) limit=1000; /* better batteries if instrucs */ 232 } 233
Indexes created Wed Oct 22 13:09:56 GMT 2025