NetBSD/games/adventure/vocab.c

230 lines
6.1 KiB
C
Raw Normal View History

/* $NetBSD: vocab.c,v 1.10 2000/01/09 17:17:19 jsm Exp $ */
1995-03-21 15:04:53 +03:00
1994-10-21 23:51:44 +03:00
/*-
* Copyright (c) 1991, 1993
* The Regents of the University of California. All rights reserved.
*
* The game adventure was originally written in Fortran by Will Crowther
* and Don Woods. It was later translated to C and enhanced by Jim
* Gillogly. This code is derived from software contributed to Berkeley
* by Jim Gillogly at The Rand Corporation.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. All advertising materials mentioning features or use of this software
* must display the following acknowledgement:
* This product includes software developed by the University of
* California, Berkeley and its contributors.
* 4. Neither the name of the University nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
*/
#include <sys/cdefs.h>
1994-10-21 23:51:44 +03:00
#ifndef lint
1995-03-21 15:04:53 +03:00
#if 0
1994-10-21 23:51:44 +03:00
static char sccsid[] = "@(#)vocab.c 8.1 (Berkeley) 5/31/93";
1995-03-21 15:04:53 +03:00
#else
__RCSID("$NetBSD: vocab.c,v 1.10 2000/01/09 17:17:19 jsm Exp $");
1995-03-21 15:04:53 +03:00
#endif
1997-10-11 05:53:21 +04:00
#endif /* not lint */
1994-10-21 23:51:44 +03:00
/* Re-coding of advent in C: data structure routines */
#include <err.h>
#include <stdio.h>
#include <stdlib.h>
#include "hdr.h"
#include "extern.h"
1994-10-21 23:51:44 +03:00
void
1994-10-21 23:51:44 +03:00
dstroy(object)
1997-10-11 05:53:21 +04:00
int object;
{
move(object, 0);
1994-10-21 23:51:44 +03:00
}
void
1994-10-21 23:51:44 +03:00
juggle(object)
1997-10-11 05:53:21 +04:00
int object;
{
int i, j;
1994-10-21 23:51:44 +03:00
1997-10-11 05:53:21 +04:00
i = place[object];
j = fixed[object];
move(object, i);
move(object + 100, j);
1994-10-21 23:51:44 +03:00
}
void
1997-10-11 05:53:21 +04:00
move(object, where)
int object, where;
{
int from;
1994-10-21 23:51:44 +03:00
1997-10-11 05:53:21 +04:00
if (object <= 100)
from = place[object];
1994-10-21 23:51:44 +03:00
else
1997-10-11 05:53:21 +04:00
from = fixed[object - 100];
if (from > 0 && from <= 300)
carry(object, from);
drop(object, where);
1994-10-21 23:51:44 +03:00
}
int
1997-10-11 05:53:21 +04:00
put(object, where, pval)
int object, where, pval;
{
move(object, where);
return (-1 - pval);
1994-10-21 23:51:44 +03:00
}
void
1997-10-11 05:53:21 +04:00
carry(object, where)
int object, where;
{
int temp;
1994-10-21 23:51:44 +03:00
1997-10-11 05:53:21 +04:00
if (object <= 100) {
if (place[object] == -1)
return;
1994-10-21 23:51:44 +03:00
place[object] = -1;
holdng++;
}
1997-10-11 05:53:21 +04:00
if (atloc[where] == object) {
atloc[where] = links[object];
1994-10-21 23:51:44 +03:00
return;
}
1997-10-11 05:53:21 +04:00
for (temp = atloc[where]; links[temp] != object; temp = links[temp]);
links[temp] = links[object];
1994-10-21 23:51:44 +03:00
}
void
1997-10-11 05:53:21 +04:00
drop(object, where)
int object, where;
{
if (object > 100)
fixed[object - 100] = where;
else {
if (place[object] == -1)
holdng--;
place[object] = where;
1994-10-21 23:51:44 +03:00
}
1997-10-11 05:53:21 +04:00
if (where <= 0)
return;
links[object] = atloc[where];
atloc[where] = object;
1994-10-21 23:51:44 +03:00
}
int
1997-10-11 05:53:21 +04:00
vocab(word, type, value) /* look up or store a word */
const char *word;
1997-10-11 05:53:21 +04:00
int type; /* -2 for store, -1 for user word, >=0 for
* canned lookup */
int value; /* used for storing only */
{
int adr;
const char *s;
char *t;
1997-10-11 05:53:21 +04:00
int hash, i;
1994-10-21 23:51:44 +03:00
struct hashtab *h;
1997-10-11 05:53:21 +04:00
for (hash = 0, s = word, i = 0; i < 5 && *s; i++) /* some kind of hash */
hash += *s++; /* add all chars in the word */
hash = (hash * 3719) & 077777; /* pulled that one out of a hat */
hash %= HTSIZE; /* put it into range of table */
for (adr = hash;; adr++) { /* look for entry in table */
if (adr == HTSIZE)
adr = 0;/* wrap around */
h = &voc[adr]; /* point at the entry */
switch (type) {
case -2: /* fill in entry */
if (h->val) /* already got an entry? */
1994-10-21 23:51:44 +03:00
goto exitloop2;
1997-10-11 05:53:21 +04:00
h->val = value;
h->atab = malloc(length(word));
if (h->atab == NULL)
err(1, NULL);
1997-10-11 05:53:21 +04:00
for (s = word, t = h->atab; *s;)
1994-10-21 23:51:44 +03:00
*t++ = *s++ ^ '=';
1997-10-11 05:53:21 +04:00
*t = 0 ^ '=';
1994-10-21 23:51:44 +03:00
/* encrypt slightly to thwart core reader */
1997-10-11 05:53:21 +04:00
/* printf("Stored \"%s\" (%d ch) as entry %d\n", */
/* word, length(word), adr); */
return (0); /* entry unused */
case -1: /* looking up user word */
if (h->val == 0)
return (-1); /* not found */
for (s = word, t = h->atab; *t ^ '=';)
1994-10-21 23:51:44 +03:00
if ((*s++ ^ '=') != *t++)
goto exitloop2;
1997-10-11 05:53:21 +04:00
if ((*s ^ '=') != *t && s - word < 5)
goto exitloop2;
1994-10-21 23:51:44 +03:00
/* the word matched o.k. */
1997-10-11 05:53:21 +04:00
return (h->val);
default: /* looking up known word */
if (h->val == 0)
errx(1,"Unable to find %s in vocab", word);
1997-10-11 05:53:21 +04:00
for (s = word, t = h->atab; *t ^ '=';)
if ((*s++ ^ '=') != *t++)
goto exitloop2;
1994-10-21 23:51:44 +03:00
/* the word matched o.k. */
1997-10-11 05:53:21 +04:00
if (h->val / 1000 != type)
continue;
return (h->val % 1000);
1994-10-21 23:51:44 +03:00
}
1997-10-11 05:53:21 +04:00
exitloop2: /* hashed entry does not match */
if (adr + 1 == hash || (adr == HTSIZE && hash == 0))
errx(1,"Hash table overflow");
1994-10-21 23:51:44 +03:00
}
}
void
1997-10-11 05:53:21 +04:00
prht()
{ /* print hash table */
int i, j, l;
char *c;
1994-10-21 23:51:44 +03:00
struct hashtab *h;
1997-10-11 05:53:21 +04:00
for (i = 0; i < HTSIZE / 10 + 1; i++) {
printf("%4d", i * 10);
for (j = 0; j < 10; j++) {
if (i * 10 + j >= HTSIZE)
break;
h = &voc[i * 10 + j];
1994-10-21 23:51:44 +03:00
putchar(' ');
1997-10-11 05:53:21 +04:00
if (h->val == 0) {
printf("-----");
1994-10-21 23:51:44 +03:00
continue;
}
1997-10-11 05:53:21 +04:00
for (l = 0, c = h->atab; l < 5; l++)
if ((*c ^ '='))
putchar(*c++ ^ '=');
else
putchar(' ');
1994-10-21 23:51:44 +03:00
}
putchar('\n');
}
}