NetBSD/games/adventure/wizard.c

163 lines
4.2 KiB
C
Raw Normal View History

/* $NetBSD: wizard.c,v 1.17 2021/05/02 12:50:43 rillig Exp $ */
1995-03-21 15:04:53 +03:00
1994-10-21 23:51:44 +03:00
/*-
* Copyright (c) 1991, 1993
* The Regents of the University of California. All rights reserved.
*
* The game adventure was originally written in Fortran by Will Crowther
* and Don Woods. It was later translated to C and enhanced by Jim
* Gillogly. This code is derived from software contributed to Berkeley
* by Jim Gillogly at The Rand Corporation.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. Neither the name of the University nor the names of its contributors
1994-10-21 23:51:44 +03:00
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
*/
#include <sys/cdefs.h>
1994-10-21 23:51:44 +03:00
#ifndef lint
1995-03-21 15:04:53 +03:00
#if 0
1994-10-21 23:51:44 +03:00
static char sccsid[] = "@(#)wizard.c 8.1 (Berkeley) 6/2/93";
1995-03-21 15:04:53 +03:00
#else
__RCSID("$NetBSD: wizard.c,v 1.17 2021/05/02 12:50:43 rillig Exp $");
1995-03-21 15:04:53 +03:00
#endif
1997-10-11 05:53:21 +04:00
#endif /* not lint */
1994-10-21 23:51:44 +03:00
/* Re-coding of advent in C: privileged operations */
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <time.h>
#include "hdr.h"
#include "extern.h"
1994-10-21 23:51:44 +03:00
2009-08-12 08:28:27 +04:00
static int wizard(void);
void
2005-07-01 04:03:36 +04:00
datime(int *d, int *t)
1997-10-11 05:53:21 +04:00
{
time_t tvec;
struct tm *tptr;
1994-10-21 23:51:44 +03:00
time(&tvec);
1997-10-11 05:53:21 +04:00
tptr = localtime(&tvec);
/* day since 1977 (mod leap) */
*d = (tptr->tm_yday + 365 * (tptr->tm_year - 77)
+ (tptr->tm_year - 77) / 4 - (tptr->tm_year - 1) / 100
+ (tptr->tm_year + 299) / 400);
/* bug: this will overflow in the year 2066 AD (with 16 bit int) */
1994-10-21 23:51:44 +03:00
/* it will be attributed to Wm the C's millenial celebration */
/* and minutes since midnite */
1997-10-11 05:53:21 +04:00
*t = tptr->tm_hour * 60 + tptr->tm_min;
} /* pretty painless */
1994-10-21 23:51:44 +03:00
2009-08-12 08:28:27 +04:00
static char magic[6];
1994-10-21 23:51:44 +03:00
void
2005-07-01 04:03:36 +04:00
poof(void)
1994-10-21 23:51:44 +03:00
{
1997-10-11 05:53:21 +04:00
strcpy(magic, DECR('d', 'w', 'a', 'r', 'f'));
latency = 45;
1994-10-21 23:51:44 +03:00
}
int
2005-07-01 04:03:36 +04:00
Start(void)
1997-10-11 05:53:21 +04:00
{
int d, t, delay;
1994-10-21 23:51:44 +03:00
1997-10-11 05:53:21 +04:00
datime(&d, &t);
delay = (d - saveday) * 1440 + (t - savet); /* good for about a
1997-10-11 05:53:21 +04:00
* month */
1994-10-21 23:51:44 +03:00
if (delay >= latency) {
1997-10-11 05:53:21 +04:00
saved = -1;
return (FALSE);
1994-10-21 23:51:44 +03:00
}
printf("This adventure was suspended a mere %d minute%s ago.",
1997-10-11 05:53:21 +04:00
delay, delay == 1 ? "" : "s");
if (delay <= latency / 3) {
1997-10-11 05:53:21 +04:00
mspeak(2);
1994-10-21 23:51:44 +03:00
exit(0);
}
mspeak(8);
1997-10-11 05:53:21 +04:00
if (!wizard()) {
mspeak(9);
1994-10-21 23:51:44 +03:00
exit(0);
}
saved = -1;
1997-10-11 05:53:21 +04:00
return (FALSE);
1994-10-21 23:51:44 +03:00
}
2005-07-01 04:03:36 +04:00
/* not as complex as advent/10 (for now) */
2009-08-12 08:28:27 +04:00
static int
2005-07-01 04:03:36 +04:00
wizard(void)
{
1997-10-11 05:53:21 +04:00
char *word, *x;
if (!yesm(16, 0, 7))
return (FALSE);
1994-10-21 23:51:44 +03:00
mspeak(17);
1997-10-11 05:53:21 +04:00
getin(&word, &x);
if (!weq(word, magic)) {
mspeak(20);
return (FALSE);
1994-10-21 23:51:44 +03:00
}
mspeak(19);
1997-10-11 05:53:21 +04:00
return (TRUE);
1994-10-21 23:51:44 +03:00
}
void
2005-07-01 04:03:36 +04:00
ciao(void)
1997-10-11 05:53:21 +04:00
{
2012-10-12 14:38:53 +04:00
char fname[80];
size_t pos;
1994-10-21 23:51:44 +03:00
printf("What would you like to call the saved version?\n");
/* XXX - should use fgetln to avoid arbitrary limit */
2012-10-12 19:41:10 +04:00
for (pos = 0; pos < sizeof(fname) - 1; pos++) {
int ch;
ch = getchar();
if (ch == '\n' || ch == EOF)
1997-10-11 05:53:21 +04:00
break;
2012-10-12 14:38:53 +04:00
fname[pos] = ch;
}
2012-10-12 14:38:53 +04:00
fname[pos] = '\0';
1997-10-11 05:53:21 +04:00
if (save(fname) != 0)
return; /* Save failed */
1994-10-21 23:51:44 +03:00
printf("To resume, say \"adventure %s\".\n", fname);
2005-07-01 04:03:36 +04:00
printf("\"With these rooms I might now have been familiarly ");
printf("acquainted.\"\n");
1994-10-21 23:51:44 +03:00
exit(0);
}
int
2005-07-01 04:03:36 +04:00
ran(int range)
1994-10-21 23:51:44 +03:00
{
1997-10-11 05:53:21 +04:00
long i;
1994-10-21 23:51:44 +03:00
i = rand() % range;
1997-10-11 05:53:21 +04:00
return (i);
1994-10-21 23:51:44 +03:00
}