2 * Copyright (c) 1991, 1993
3 * The Regents of the University of California. All rights reserved.
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.
10 * Redistribution and use in source and binary forms, with or without
11 * modification, are permitted provided that the following conditions
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. All advertising materials mentioning features or use of this software
19 * must display the following acknowledgement:
20 * This product includes software developed by the University of
21 * California, Berkeley and its contributors.
22 * 4. Neither the name of the University nor the names of its contributors
23 * may be used to endorse or promote products derived from this software
24 * without specific prior written permission.
26 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
27 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
28 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
29 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
30 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
31 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
32 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
33 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
34 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
35 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
38 * @(#)vocab.c 8.1 (Berkeley) 5/31/93
39 * $FreeBSD: src/games/adventure/vocab.c,v 1.9 1999/12/19 00:21:51 billf Exp $
40 * $DragonFly: src/games/adventure/vocab.c,v 1.3 2005/03/25 12:56:48 liamfoy Exp $
43 /* Re-coding of advent in C: data structure routines */
77 from=fixed[object-100];
78 if (from>0 && from<=300) carry(object,from);
84 put(object,where,pval)
85 int object,where,pval;
96 { if (place[object]== -1) return;
100 if (atloc[where]==object)
101 { atloc[where]=linkx[object];
104 for (temp=atloc[where]; linkx[temp]!=object; temp=linkx[temp]);
105 linkx[temp]=linkx[object];
112 { if (object>100) fixed[object-100]=where;
114 { if (place[object]== -1) holdng--;
117 if (where<=0) return;
118 linkx[object]=atloc[where];
124 vocab(word,type,value) /* look up or store a word */
126 int type; /* -2 for store, -1 for user word, >=0 for canned lookup*/
127 int value; /* used for storing only */
134 for (hash=0,s=word,i=0; i<5 &&*s; i++) /* some kind of hash */
135 hash += *s++; /* add all chars in the word */
136 hash = (hash*3719)&077777; /* pulled that one out of a hat */
137 hash %= HTSIZE; /* put it into range of table */
139 for(adr=hash;; adr++) /* look for entry in table */
140 { if (adr==HTSIZE) adr=0; /* wrap around */
141 h = &voc[adr]; /* point at the entry */
143 { case -2: /* fill in entry */
144 if (h->val) /* already got an entry? */
147 h->atab=malloc(strlen(word)+1);
149 errx(1, "Out of memory!");
150 for (s=word,t=h->atab; *s;)
153 /* encrypt slightly to thwart core reader */
154 /* printf("Stored \"%s\" (%d ch) as entry %d\n", */
155 /* word, strlen(word)+1, adr); */
156 return(0); /* entry unused */
157 case -1: /* looking up user word */
158 if (h->val==0) return(-1); /* not found */
159 for (s=word, t=h->atab;*t ^ '=';)
160 if ((*s++ ^ '=') != *t++)
162 if ((*s ^ '=') != *t && s-word<5) goto exitloop2;
163 /* the word matched o.k. */
165 default: /* looking up known word */
167 { errx(1, "Unable to find %s in vocab", word);
169 for (s=word, t=h->atab;*t ^ '=';)
170 if ((*s++ ^ '=') != *t++) goto exitloop2;
171 /* the word matched o.k. */
172 if (h->val/1000 != type) continue;
176 exitloop2: /* hashed entry does not match */
177 if (adr+1==hash || (adr==HTSIZE && hash==0))
178 { errx(1, "Hash table overflow");