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