battlestar/parse.c

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