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 * @(#)io.c 8.1 (Berkeley) 5/31/93
39 * $FreeBSD: src/games/adventure/io.c,v 1.8.2.1 2001/03/05 11:43:11 kris Exp $
40 * $DragonFly: src/games/adventure/io.c,v 1.2 2003/06/17 04:25:22 dillon Exp $
43 /* Re-coding of advent in C: file i/o and user i/o */
51 static int next (void);
52 static int rnum (void);
53 static void rdesc (int);
54 static void rdflt (void);
55 static void rhints (void);
56 static void rliq (void);
57 static void rlocs (void);
58 static void rtrav (void);
59 static void rvoc (void);
61 static void twrite (int);
65 getin(wrd1
,wrd2
) /* get command from user */
66 char **wrd1
,**wrd2
; /* no prompt, usually */
68 static char wd1buf
[MAXSTR
],wd2buf
[MAXSTR
];
71 *wrd1
=wd1buf
; /* return ptr to internal string*/
73 wd2buf
[0]=0; /* in case it isn't set here */
74 for (s
=wd1buf
, first
=1, numch
=0;;)
75 { if ((*s
=getchar())>='A' && *s
<='Z') *s
= *s
- ('A' -'a');
76 /* convert to upper case */
77 switch(*s
) /* start reading from user */
82 if (s
==wd1buf
||s
==wd2buf
) /* initial blank */
85 if (first
) /* finished 1st wd; start 2nd */
90 else /* finished 2nd word */
96 printf("user closed input stream, quitting...\n");
99 if (++numch
>=MAXSTR
) /* string too long */
100 { printf("Give me a break!!\n");
101 wd1buf
[0]=wd2buf
[0]=0;
111 yes(x
,y
,z
) /* confirm with rspeak */
118 { rspeak(x
); /* tell him what we want*/
119 if ((ch
=getchar())=='y')
121 else if (ch
=='n') result
=FALSE
;
122 else if (ch
== EOF
) {
123 printf("user closed input stream, quitting...\n");
127 if (ch
=='y'|| ch
=='n') break;
128 printf("Please answer the question.\n");
130 if (result
==TRUE
) rspeak(y
);
131 if (result
==FALSE
) rspeak(z
);
136 yesm(x
,y
,z
) /* confirm with mspeak */
143 { mspeak(x
); /* tell him what we want*/
144 if ((ch
=getchar())=='y')
146 else if (ch
=='n') result
=FALSE
;
147 else if (ch
== EOF
) {
148 printf("user closed input stream, quitting...\n");
152 if (ch
=='y'|| ch
=='n') break;
153 printf("Please answer the question.\n");
155 if (result
==TRUE
) mspeak(y
);
156 if (result
==FALSE
) mspeak(z
);
160 /* FILE *inbuf,*outbuf; */
162 char *inptr
; /* Pointer into virtual disk */
164 int outsw
= 0; /* putting stuff to data file? */
166 const char iotape
[] = "Ax3F'\003tt$8h\315qer*h\017nGKrX\207:!l";
167 const char *tape
= iotape
; /* pointer to encryption tape */
170 next() /* next virtual char, bump adr */
174 ch
=(*inptr
^ random()) & 0xFF; /* Decrypt input data */
175 if (outsw
) /* putting data in tmp file */
176 { if (*tape
==0) tape
=iotape
; /* rewind encryption tape */
177 *inptr
= ch
^ *tape
++; /* re-encrypt and replace value */
183 char breakch
; /* tell which char ended rnum */
186 rdata() /* "read" data from virtual file*/
190 inptr
= data_file
; /* Pointer to virtual data file */
191 srandom(SEED
); /* which is lightly encrypted. */
194 for (;;) /* read data sections */
195 { sect
=next()-'0'; /* 1st digit of section number */
197 printf("Section %c",sect
+'0');
199 if ((ch
=next())!=LF
) /* is there a second digit? */
211 { case 0: /* finished reading database */
213 case 1: /* long form descriptions */
216 case 2: /* short form descriptions */
219 case 3: /* travel table */
221 case 4: /* vocabulary */
224 case 5: /* object descriptions */
227 case 6: /* arbitrary messages */
230 case 7: /* object locations */
232 case 8: /* action defaults */
234 case 9: /* liquid assets */
236 case 10: /* class messages */
241 case 12: /* magic messages */
245 printf("Invalid data section number: %d\n",sect
);
246 for (;;) putchar(next());
248 if (breakch
!=LF
) /* routines return after "-1" */
257 rnum() /* read initial location num */
259 tape
= iotape
; /* restart encryption tape */
260 for (s
=nbf
,*s
=0;; s
++)
261 if ((*s
=next())==TAB
|| *s
=='\n' || *s
==LF
)
263 breakch
= *s
; /* save char for rtrav() */
264 *s
=0; /* got the number as ascii */
265 if (nbf
[0]=='-') return(-1); /* end of data */
266 return(atoi(nbf
)); /* convert it to integer */
272 rdesc(sect
) /* read description-format msgs */
276 char *seekstart
, *maystart
;
278 seekhere
= inptr
; /* Where are we in virtual file?*/
279 outsw
=1; /* these msgs go into tmp file */
280 for (oldloc
= -1, seekstart
=seekhere
;;)
281 { maystart
=inptr
; /* maybe starting new entry */
282 if ((locc
=rnum())!=oldloc
&& oldloc
>=0 /* finished msg */
283 && ! (sect
==5 && (locc
==0 || locc
>=100)))/* unless sect 5*/
284 { switch(sect
) /* now put it into right table */
285 { case 1: /* long descriptions */
286 ltext
[oldloc
].seekadr
=seekhere
;
287 ltext
[oldloc
].txtlen
=maystart
-seekstart
;
289 case 2: /* short descriptions */
290 stext
[oldloc
].seekadr
=seekhere
;
291 stext
[oldloc
].txtlen
=maystart
-seekstart
;
293 case 5: /* object descriptions */
294 ptext
[oldloc
].seekadr
=seekhere
;
295 ptext
[oldloc
].txtlen
=maystart
-seekstart
;
297 case 6: /* random messages */
299 { errx(1, "Too many random msgs");
301 rtext
[oldloc
].seekadr
=seekhere
;
302 rtext
[oldloc
].txtlen
=maystart
-seekstart
;
304 case 10: /* class messages */
305 ctext
[clsses
].seekadr
=seekhere
;
306 ctext
[clsses
].txtlen
=maystart
-seekstart
;
307 cval
[clsses
++]=oldloc
;
309 case 12: /* magic messages */
311 { errx(1, "Too many magic msgs");
313 mtext
[oldloc
].seekadr
=seekhere
;
314 mtext
[oldloc
].txtlen
=maystart
-seekstart
;
317 errx(1, "rdesc called with bad section");
319 seekhere
+= maystart
-seekstart
;
322 { outsw
=0; /* turn off output */
323 seekhere
+= 3; /* -1<delimiter> */
326 if (sect
!=5 || (locc
>0 && locc
<100))
327 { if (oldloc
!=locc
)/* starting a new message */
331 FLUSHLF
; /* scan the line */
337 rtrav() /* read travel table */
346 for (oldloc
= -1;;) /* get another line */
347 { if ((locc
=rnum())!=oldloc
&& oldloc
>=0) /* end of entry */
349 t
->next
= 0; /* terminate the old entry */
351 printf("%d:%d entries\n",oldloc
,entries
);
355 if (locc
== -1) return;
356 if (locc
!=oldloc
) /* getting a new entry */
357 { t
=travel
[locc
]=(struct travlist
*) malloc(sizeof (struct travlist
));
358 /* printf("New travel list for %d\n",locc); */
360 errx(1, "Out of memory!");
365 for (;; s
++) /* get the newloc number /ASCII */
366 if ((*s
=next())==TAB
|| *s
==LF
) break;
368 len
=strlen(buf
); /* quad long number handling */
369 /* printf("Newloc: %s (%d chars)\n",buf,len); */
370 if (len
<4) /* no "m" conditions */
372 n
=atoi(buf
); /* newloc mod 1000 = newloc */
374 else /* a long integer */
376 buf
[len
-3]=0; /* terminate newloc/1000 */
379 while (breakch
!=LF
) /* only do one line at a time */
381 t
=t
->next
=(struct travlist
*) malloc(sizeof (struct travlist
));
383 errx(1, "Out of memory!");
385 t
->tverb
=rnum();/* get verb from the file */
386 t
->tloc
=n
; /* table entry mod 1000 */
387 t
->conditions
=m
;/* table entry / 1000 */
388 /* printf("entry %d for %d\n",entries,locc); */
396 twrite(loq
) /* travel options from this loc */
398 { struct travlist
*t
;
402 for (t
=travel
[loq
]; t
!=0; t
=t
->next
)
403 { printf("verb %d takes you to ",t
->tverb
);
405 speak(<ext
[t
->tloc
]);
406 else if (t
->tloc
<=500)
407 printf("special code %d\n",t
->tloc
-300);
410 printf("under conditions %d\n",t
->conditions
);
418 { char *s
; /* read the vocabulary */
423 if (rv_index
<0) break;
424 for (s
=buf
,*s
=0;; s
++) /* get the word */
425 if ((*s
=next())==TAB
|| *s
=='\n' || *s
==LF
427 /* terminate word with newline, LF, tab, blank */
428 if (*s
!='\n' && *s
!=LF
) FLUSHLF
; /* can be comments */
430 /* printf("\"%s\"=%d\n",buf,index);*/
431 vocab(buf
,-2,rv_index
);
437 rlocs() /* initial object locations */
439 { if ((obj
=rnum())<0) break;
440 plac
[obj
]=rnum(); /* initial loc for this obj */
441 if (breakch
==TAB
) /* there's another entry */
448 rdflt() /* default verb messages */
450 { if ((verb
=rnum())<0) break;
456 rliq() /* liquid assets &c: cond bits */
458 for (;;) /* read new bit list */
459 { if ((bitnum
=rnum())<0) break;
460 for (;;) /* read locs for bits */
461 { cond
[rnum()] |= setbit
[bitnum
];
462 if (breakch
==LF
) break;
472 { if ((hintnum
=rnum())<0) break;
474 hints
[hintnum
][i
]=rnum();
475 if (hintnum
>hntmax
) hntmax
=hintnum
;
483 { if (msg
!=0) speak(&rtext
[msg
]);
490 { if (msg
!=0) speak(&mtext
[msg
]);
495 speak(msg
) /* read, decrypt, and print a message (not ptext) */
496 const struct text
*msg
;/* msg is a pointer to seek address and length of mess */
502 while (s
- msg
->seekadr
< msg
->txtlen
) /* read a line at a time */
503 { tape
=iotape
; /* restart decryption tape */
504 while ((*s
++ ^ *tape
++) != TAB
); /* read past loc num */
505 /* assume tape is longer than location number */
506 /* plus the lookahead put together */
507 if ((*s
^ *tape
) == '>' &&
508 (*(s
+1) ^ *(tape
+1)) == '$' &&
509 (*(s
+2) ^ *(tape
+2)) == '<') break;
510 if (blklin
&& !nonfirst
++) putchar('\n');
512 { if (*tape
== 0) tape
= iotape
;/* rewind decryp tape */
514 } while ((*s
++ ^ *tape
++) != LF
); /* better end with LF */
520 pspeak(m
,skip
) /* read, decrypt an print a ptext message */
521 int m
; /* msg is the number of all the p msgs for this place */
522 int skip
; /* assumes object 1 doesn't have prop 1, obj 2 no prop 2 &c*/
525 char *numst
, ps_save
;
530 if ((tbuf
=(char *) malloc(msg
->txtlen
+ 1)) == 0)
531 errx(1, "Out of memory!");
532 memcpy(tbuf
, msg
->seekadr
, (u_int
)msg
->txtlen
+ 1); /* Room to null */
536 while (s
- tbuf
< msg
->txtlen
) /* read line at a time */
537 { tape
=iotape
; /* restart decryption tape */
538 for (numst
=s
; (*s
^= *tape
++)!=TAB
; s
++); /* get number */
540 ps_save
= *s
; /* Temporarily trash the string (cringe) */
541 *s
++ = 0; /* decrypting number within the string */
543 if (atoi(numst
) != 100 * skip
&& skip
>= 0)
544 { while ((*s
++^*tape
++)!=LF
) /* flush the line */
545 if (*tape
==0) tape
=iotape
;
548 if ((*s
^*tape
)=='>' && (*(s
+1)^*(tape
+1))=='$' &&
549 (*(s
+2)^*(tape
+2))=='<') break;
550 if (blklin
&& ! nonfirst
++) putchar('\n');
552 { if (*tape
==0) tape
=iotape
;
554 } while ((*s
++^*tape
++)!=LF
); /* better end with LF */