games/battlestar/parse.c

   1 /*
   2  * Copyright (c) 1983, 1993
   3  *      The Regents of the University of California.  All rights reserved.
   4  *
   5  * Redistribution and use in source and binary forms, with or without
   6  * modification, are permitted provided that the following conditions
   7  * are met:
   8  * 1. Redistributions of source code must retain the above copyright
   9  *    notice, this list of conditions and the following disclaimer.
  10  * 2. Redistributions in binary form must reproduce the above copyright
  11  *    notice, this list of conditions and the following disclaimer in the
  12  *    documentation and/or other materials provided with the distribution.
  13  * 3. All advertising materials mentioning features or use of this software
  14  *    must display the following acknowledgement:
  15  *      This product includes software developed by the University of
  16  *      California, Berkeley and its contributors.
  17  * 4. Neither the name of the University nor the names of its contributors
  18  *    may be used to endorse or promote products derived from this software
  19  *    without specific prior written permission.
  20  *
  21  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
  22  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  23  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  24  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
  25  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  26  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
  27  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
  28  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
  29  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
  30  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
  31  * SUCH DAMAGE.
  32  *
  33  * @(#)parse.c  8.1 (Berkeley) 5/31/93
  34  * $FreeBSD: src/games/battlestar/parse.c,v 1.5.2.1 2001/03/05 11:45:36 kris Exp $
  35  * $DragonFly: src/games/battlestar/parse.c,v 1.4 2006/08/08 16:47:20 pavalos Exp $
  36  */
  37
  38 #include "externs.h"
  39
  40 static int       hash  (const char *);
  41 static void      install (struct wlist *);
  42 static struct wlist     *lookup (const char *);
  43
  44 void
  45 wordinit(void)
  46 {
  47         struct wlist *w;
  48
  49         for (w = wlist; w->string; w++)
  50                 install(w);
  51 }
  52
  53 static int
  54 hash(const char *s)
  55 {
  56         int hashval = 0;
  57
  58         while (*s) {
  59                 hashval += *s++;
  60                 hashval *= HASHMUL;
  61                 hashval &= HASHMASK;
  62         }
  63         return hashval;
  64 }
  65
  66 static struct wlist *
  67 lookup(const char *s)
  68 {
  69         struct wlist *wp;
  70
  71         for (wp = hashtab[hash(s)]; wp != NULL; wp = wp->next)
  72                 if (*s == *wp->string && strcmp(s, wp->string) == 0)
  73                         return wp;
  74         return NULL;
  75 }
  76
  77 static void
  78 install(struct wlist *wp)
  79 {
  80         int hashval;
  81
  82         if (lookup(wp->string) == NULL) {
  83                 hashval = hash(wp->string);
  84                 wp->next = hashtab[hashval];
  85                 hashtab[hashval] = wp;
  86         } else
  87                 printf("Multiply defined %s.\n", wp->string);
  88 }
  89
  90 void
  91 parse(void)
  92 {
  93         struct wlist *wp;
  94         int n;
  95
  96         wordnumber = 0;           /* for cypher */
  97         for (n = 0; n <= wordcount; n++) {
  98                 if ((wp = lookup(words[n])) == NULL) {
  99                         wordvalue[n] = -1;
 100                         wordtype[n] = -1;
 101                 } else {
 102                         wordvalue[n] = wp -> value;
 103                         wordtype[n] = wp -> article;
 104                 }
 105         }
 106 }