1 /* $OpenBSD: wizard.c,v 1.19 2016/03/08 10:48:39 mestre Exp $ */ 2 /* $NetBSD: wizard.c,v 1.3 1995/04/24 12:21:41 cgd Exp $ */ 3 4 /*- 5 * Copyright (c) 1991, 1993 6 * The Regents of the University of California. All rights reserved. 7 * 8 * The game adventure was originally written in Fortran by Will Crowther 9 * and Don Woods. It was later translated to C and enhanced by Jim 10 * Gillogly. This code is derived from software contributed to Berkeley 11 * by Jim Gillogly at The Rand Corporation. 12 * 13 * Redistribution and use in source and binary forms, with or without 14 * modification, are permitted provided that the following conditions 15 * are met: 16 * 1. Redistributions of source code must retain the above copyright 17 * notice, this list of conditions and the following disclaimer. 18 * 2. Redistributions in binary form must reproduce the above copyright 19 * notice, this list of conditions and the following disclaimer in the 20 * documentation and/or other materials provided with the distribution. 21 * 3. Neither the name of the University nor the names of its contributors 22 * may be used to endorse or promote products derived from this software 23 * without specific prior written permission. 24 * 25 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 26 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 27 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 28 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 29 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 30 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 31 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 32 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 33 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 34 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 35 * SUCH DAMAGE. 36 */ 37 38 /* Re-coding of advent in C: privileged operations */ 39 40 #include <limits.h> 41 #include <stdio.h> 42 #include <stdlib.h> 43 #include <time.h> 44 45 #include "extern.h" 46 #include "hdr.h" 47 48 #if 0 49 void 50 datime(int *d, int *t) 51 { 52 time_t tvec; 53 struct tm *tptr; 54 55 time(&tvec); 56 tptr = localtime(&tvec); 57 /* day since 1977 (mod leap) */ 58 *d = tptr->tm_yday + 365 * (tptr->tm_year - 77); 59 /* bug: this will overflow in the year 2066 AD */ 60 /* it will be attributed to Wm the C's millenial celebration */ 61 /* and minutes since midnite */ 62 *t = tptr->tm_hour * 60 + tptr->tm_min; 63 } /* pretty painless */ 64 #endif 65 66 char magic[6]; 67 68 void 69 poof(void) 70 { 71 strlcpy(magic, DECR(d,w,a,r,f), sizeof magic); 72 latncy = 45; 73 } 74 75 int 76 Start(void) 77 { 78 time_t t, delay; 79 80 time(&t); 81 delay = (t - savet) / 60; /* Minutes */ 82 saved = -1; 83 84 if (delay >= latncy) 85 return (FALSE); 86 printf("This adventure was suspended a mere %d minute%s ago.", 87 (int)delay, delay == 1 ? "" : "s"); 88 if (delay <= latncy / 3) { 89 mspeak(2); 90 exit(0); 91 } 92 mspeak(8); 93 if (!wizard()) { 94 mspeak(9); 95 exit(0); 96 } 97 return (FALSE); 98 } 99 100 int 101 wizard(void) /* not as complex as advent/10 (for now) */ 102 { 103 if (!yesm(16, 0, 7)) 104 return (FALSE); 105 mspeak(17); 106 getin(wd1, sizeof(wd1), wd2, sizeof(wd2)); 107 if (!weq(wd1, magic)) { 108 mspeak(20); 109 return (FALSE); 110 } 111 mspeak(19); 112 return (TRUE); 113 } 114 115 void 116 ciao(void) 117 { 118 int ch; 119 char *c; 120 char fname[PATH_MAX]; 121 122 printf("What would you like to call the saved version?\n"); 123 for (c = fname; c - fname < sizeof(fname); c++) { 124 if ((ch = getchar()) == '\n' || ch == EOF) 125 break; 126 *c = ch; 127 } 128 if (c - fname == sizeof(fname)) { 129 c--; 130 FLUSHLINE; 131 } 132 *c = '\0'; 133 if (save(fname) != 0) 134 return; /* Save failed */ 135 printf("To resume, say \"adventure %s\".\n", fname); 136 printf("\"With these rooms I might now have been familiarly acquainted.\"\n"); 137 exit(0); 138 } 139 140 141 int 142 ran(int range) 143 { 144 return (arc4random_uniform(range)); 145 } 146