hack/hack.o_init.c

   1 /*      $NetBSD: hack.o_init.c,v 1.7 2003/04/02 18:36:38 jsm Exp $      */
   2
   3 /*
   4  * Copyright (c) 1985, Stichting Centrum voor Wiskunde en Informatica,
   5  * Amsterdam
   6  * All rights reserved.
   7  *
   8  * Redistribution and use in source and binary forms, with or without
   9  * modification, are permitted provided that the following conditions are
  10  * met:
  11  *
  12  * - Redistributions of source code must retain the above copyright notice,
  13  * this list of conditions and the following disclaimer.
  14  *
  15  * - 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  *
  19  * - Neither the name of the Stichting Centrum voor Wiskunde en
  20  * Informatica, nor the names of its contributors may be used to endorse or
  21  * promote products derived from this software without specific prior
  22  * written permission.
  23  *
  24  * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS
  25  * IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
  26  * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A
  27  * PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER
  28  * OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
  29  * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
  30  * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
  31  * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
  32  * LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
  33  * NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
  34  * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
  35  */
  36
  37 /*
  38  * Copyright (c) 1982 Jay Fenlason <hack@gnu.org>
  39  * All rights reserved.
  40  *
  41  * Redistribution and use in source and binary forms, with or without
  42  * modification, are permitted provided that the following conditions
  43  * are met:
  44  * 1. Redistributions of source code must retain the above copyright
  45  *    notice, this list of conditions and the following disclaimer.
  46  * 2. Redistributions in binary form must reproduce the above copyright
  47  *    notice, this list of conditions and the following disclaimer in the
  48  *    documentation and/or other materials provided with the distribution.
  49  * 3. The name of the author may not be used to endorse or promote products
  50  *    derived from this software without specific prior written permission.
  51  *
  52  * THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES,
  53  * INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY
  54  * AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL
  55  * THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
  56  * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
  57  * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;
  58  * OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
  59  * WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR
  60  * OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
  61  * ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
  62  */
  63
  64 #include <sys/cdefs.h>
  65 #ifndef lint
  66 __RCSID("$NetBSD: hack.o_init.c,v 1.7 2003/04/02 18:36:38 jsm Exp $");
  67 #endif                          /* not lint */
  68
  69 #include <string.h>
  70 #include "hack.h"
  71 #include "extern.h"
  72 #include "def.objects.h"
  73 #include "hack.onames.h"        /* for LAST_GEM */
  74
  75 int
  76 letindex(let)
  77         char            let;
  78 {
  79         int             i = 0;
  80         char            ch;
  81         while ((ch = obj_symbols[i++]) != 0)
  82                 if (ch == let)
  83                         return (i);
  84         return (0);
  85 }
  86
  87 void
  88 init_objects()
  89 {
  90         int             i, j, first, last, sum, end;
  91         char            let;
  92         const char *tmp;
  93         /*
  94          * init base; if probs given check that they add up to 100, otherwise
  95          * compute probs; shuffle descriptions
  96          */
  97         end = SIZE(objects);
  98         first = 0;
  99         while (first < end) {
 100                 let = objects[first].oc_olet;
 101                 last = first + 1;
 102                 while (last < end && objects[last].oc_olet == let
 103                        && objects[last].oc_name != NULL)
 104                         last++;
 105                 i = letindex(let);
 106                 if ((!i && let != ILLOBJ_SYM) || bases[i] != 0)
 107                         error("initialization error");
 108                 bases[i] = first;
 109
 110                 if (let == GEM_SYM)
 111                         setgemprobs();
 112 check:
 113                 sum = 0;
 114                 for (j = first; j < last; j++)
 115                         sum += objects[j].oc_prob;
 116                 if (sum == 0) {
 117                         for (j = first; j < last; j++)
 118                                 objects[j].oc_prob = (100 + j - first) / (last - first);
 119                         goto check;
 120                 }
 121                 if (sum != 100)
 122                         error("init-prob error for %c", let);
 123
 124                 if (objects[first].oc_descr != NULL && let != TOOL_SYM) {
 125                         /* shuffle, also some additional descriptions */
 126                         while (last < end && objects[last].oc_olet == let)
 127                                 last++;
 128                         j = last;
 129                         while (--j > first) {
 130                                 i = first + rn2(j + 1 - first);
 131                                 tmp = objects[j].oc_descr;
 132                                 objects[j].oc_descr = objects[i].oc_descr;
 133                                 objects[i].oc_descr = tmp;
 134                         }
 135                 }
 136                 first = last;
 137         }
 138 }
 139
 140 int
 141 probtype(let)
 142         char            let;
 143 {
 144         int             i = bases[letindex(let)];
 145         int             prob = rn2(100);
 146         while ((prob -= objects[i].oc_prob) >= 0)
 147                 i++;
 148         if (objects[i].oc_olet != let || !objects[i].oc_name)
 149                 panic("probtype(%c) error, i=%d", let, i);
 150         return (i);
 151 }
 152
 153 void
 154 setgemprobs()
 155 {
 156         int             j, first;
 157
 158         first = bases[letindex(GEM_SYM)];
 159
 160         for (j = 0; j < 9 - dlevel / 3; j++)
 161                 objects[first + j].oc_prob = 0;
 162         first += j;
 163         if (first >= LAST_GEM || first >= SIZE(objects) ||
 164             objects[first].oc_olet != GEM_SYM ||
 165             objects[first].oc_name == NULL)
 166                 printf("Not enough gems? - first=%d j=%d LAST_GEM=%d\n",
 167                        first, j, LAST_GEM);
 168         for (j = first; j < LAST_GEM; j++)
 169                 objects[j].oc_prob = (20 + j - first) / (LAST_GEM - first);
 170 }
 171
 172 void
 173 oinit()
 174 {                               /* level dependent initialization */
 175         setgemprobs();
 176 }
 177
 178 void
 179 savenames(fd)
 180         int             fd;
 181 {
 182         int             i;
 183         unsigned        len;
 184         bwrite(fd, (char *) bases, sizeof bases);
 185         bwrite(fd, (char *) objects, sizeof objects);
 186         /*
 187          * as long as we use only one version of Hack/Quest we need not save
 188          * oc_name and oc_descr, but we must save oc_uname for all objects
 189          */
 190         for (i = 0; i < SIZE(objects); i++) {
 191                 if (objects[i].oc_uname) {
 192                         len = strlen(objects[i].oc_uname) + 1;
 193                         bwrite(fd, (char *) &len, sizeof len);
 194                         bwrite(fd, objects[i].oc_uname, len);
 195                 }
 196         }
 197 }
 198
 199 void
 200 restnames(fd)
 201         int             fd;
 202 {
 203         int             i;
 204         unsigned        len;
 205         mread(fd, (char *) bases, sizeof bases);
 206         mread(fd, (char *) objects, sizeof objects);
 207         for (i = 0; i < SIZE(objects); i++)
 208                 if (objects[i].oc_uname) {
 209                         mread(fd, (char *) &len, sizeof len);
 210                         objects[i].oc_uname = (char *) alloc(len);
 211                         mread(fd, objects[i].oc_uname, len);
 212                 }
 213 }
 214
 215 int
 216 dodiscovered()
 217 {                               /* free after Robert Viduya */
 218         int             i, end;
 219         int             ct = 0;
 220
 221         cornline(0, "Discoveries");
 222
 223         end = SIZE(objects);
 224         for (i = 0; i < end; i++) {
 225                 if (interesting_to_discover(i)) {
 226                         ct++;
 227                         cornline(1, typename(i));
 228                 }
 229         }
 230         if (ct == 0) {
 231                 pline("You haven't discovered anything yet...");
 232                 cornline(3, (char *) 0);
 233         } else
 234                 cornline(2, (char *) 0);
 235
 236         return (0);
 237 }
 238
 239 int
 240 interesting_to_discover(i)
 241         int             i;
 242 {
 243         return (
 244                 objects[i].oc_uname != NULL ||
 245                 (objects[i].oc_name_known && objects[i].oc_descr != NULL)
 246                 );
 247 }