wizard.c revision 1.12       1 /*	$NetBSD: wizard.c,v 1.12 2005/07/01 00:03:36 jmc Exp $	*/
      2 
      3 /*-
      4  * Copyright (c) 1991, 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. Neither the name of the University nor the names of its contributors
     21  *    may be used to endorse or promote products derived from this software
     22  *    without specific prior written permission.
     23  *
     24  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
     25  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
     26  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
     27  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
     28  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
     29  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
     30  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
     31  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
     32  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
     33  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
     34  * SUCH DAMAGE.
     35  */
     36 
     37 #include <sys/cdefs.h>
     38 #ifndef lint
     39 #if 0
     40 static char sccsid[] = "@(#)wizard.c	8.1 (Berkeley) 6/2/93";
     41 #else
     42 __RCSID("$NetBSD: wizard.c,v 1.12 2005/07/01 00:03:36 jmc Exp $");
     43 #endif
     44 #endif				/* not lint */
     45 
     46 /*      Re-coding of advent in C: privileged operations                 */
     47 
     48 #include <stdio.h>
     49 #include <string.h>
     50 #include <stdlib.h>
     51 #include <time.h>
     52 #include "hdr.h"
     53 #include "extern.h"
     54 
     55 void
     56 datime(int *d, int *t)
     57 {
     58 	time_t  tvec;
     59 	struct tm *tptr;
     60 
     61 	time(&tvec);
     62 	tptr = localtime(&tvec);
     63 	/* day since 1977  (mod leap)   */
     64 	*d = (tptr->tm_yday + 365 * (tptr->tm_year - 77)
     65              + (tptr->tm_year - 77) / 4 - (tptr->tm_year - 1) / 100
     66              + (tptr->tm_year + 299) / 400);
     67 	/* bug: this will overflow in the year 2066 AD (with 16 bit int) */
     68 	/* it will be attributed to Wm the C's millenial celebration    */
     69 	/* and minutes since midnite */
     70 	*t = tptr->tm_hour * 60 + tptr->tm_min;
     71 }				/* pretty painless              */
     72 
     73 
     74 char    magic[6];
     75 
     76 void
     77 poof(void)
     78 {
     79 	strcpy(magic, DECR('d', 'w', 'a', 'r', 'f'));
     80 	latncy = 45;
     81 }
     82 
     83 int
     84 Start(void)
     85 {
     86 	int     d, t, delay;
     87 
     88 	datime(&d, &t);
     89 	delay = (d - saveday) * 1440 + (t - savet);	/* good for about a
     90 							 * month     */
     91 
     92 	if (delay >= latncy) {
     93 		saved = -1;
     94 		return (FALSE);
     95 	}
     96 	printf("This adventure was suspended a mere %d minute%s ago.",
     97 	    delay, delay == 1 ? "" : "s");
     98 	if (delay <= latncy / 3) {
     99 		mspeak(2);
    100 		exit(0);
    101 	}
    102 	mspeak(8);
    103 	if (!wizard()) {
    104 		mspeak(9);
    105 		exit(0);
    106 	}
    107 	saved = -1;
    108 	return (FALSE);
    109 }
    110 
    111 /* not as complex as advent/10 (for now)        */
    112 int
    113 wizard(void)
    114 {
    115 	char   *word, *x;
    116 	if (!yesm(16, 0, 7))
    117 		return (FALSE);
    118 	mspeak(17);
    119 	getin(&word, &x);
    120 	if (!weq(word, magic)) {
    121 		mspeak(20);
    122 		return (FALSE);
    123 	}
    124 	mspeak(19);
    125 	return (TRUE);
    126 }
    127 
    128 void
    129 ciao(void)
    130 {
    131 	char   *c;
    132 	char    fname[80];
    133 
    134 	printf("What would you like to call the saved version?\n");
    135 	/* XXX - should use fgetln to avoid arbitrary limit */
    136 	for (c = fname; c < fname + sizeof fname - 1; c++) {
    137 		int ch;
    138 		ch = getchar();
    139 		if (ch == '\n' || ch == EOF)
    140 			break;
    141 		*c = ch;
    142 	}
    143 	*c = 0;
    144 	if (save(fname) != 0)
    145 		return;		/* Save failed */
    146 	printf("To resume, say \"adventure %s\".\n", fname);
    147 	printf("\"With these rooms I might now have been familiarly ");
    148 	printf("acquainted.\"\n");
    149 	exit(0);
    150 }
    151 
    152 
    153 int
    154 ran(int range)
    155 {
    156 	long    i;
    157 
    158 	i = rand() % range;
    159 	return (i);
    160 }
    161