b2f782612f
_NETBSD_SOURCE as this makes cross building from older/newer versions of NetBSD harder, not easier (and also makes the resulting tools 'different') Wrap all required code with the inclusion of nbtool_config.h, attempt to only use POSIX code in all places (or when reasonable test w. configure and provide definitions: ala u_int, etc). Reviewed by lukem. Tested on FreeBSD 4.9, Redhat Linux ES3, NetBSD 1.6.2 x86 NetBSD current (x86 and amd64) and Solaris 9. Fixes PR's: PR#17762 PR#25944
158 lines
3.7 KiB
C
158 lines
3.7 KiB
C
/* $NetBSD: look.c,v 1.10 2004/06/20 22:20:15 jmc Exp $ */
|
|
/* $OpenBSD: look.c,v 1.8 2001/09/17 08:11:13 espie Exp $ */
|
|
|
|
/*
|
|
* Copyright (c) 1989, 1993
|
|
* The Regents of the University of California. All rights reserved.
|
|
*
|
|
* This code is derived from software contributed to Berkeley by
|
|
* Ozan Yigit at York University.
|
|
*
|
|
* 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. 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.
|
|
*/
|
|
|
|
#if HAVE_NBTOOL_CONFIG_H
|
|
#include "nbtool_config.h"
|
|
#endif
|
|
|
|
#include <sys/cdefs.h>
|
|
#if defined(__RCSID) && !defined(lint)
|
|
#if 0
|
|
static char sccsid[] = "@(#)look.c 8.1 (Berkeley) 6/6/93";
|
|
#else
|
|
__RCSID("$NetBSD: look.c,v 1.10 2004/06/20 22:20:15 jmc Exp $");
|
|
#endif
|
|
#endif /* not lint */
|
|
|
|
/*
|
|
* look.c
|
|
* Facility: m4 macro processor
|
|
* by: oz
|
|
*/
|
|
|
|
#include <sys/types.h>
|
|
#include <stdio.h>
|
|
#include <stdlib.h>
|
|
#include <stddef.h>
|
|
#include <string.h>
|
|
#include "mdef.h"
|
|
#include "stdd.h"
|
|
#include "extern.h"
|
|
|
|
static void freent __P((ndptr));
|
|
|
|
unsigned
|
|
hash(name)
|
|
const char *name;
|
|
{
|
|
unsigned int h = 0;
|
|
while (*name)
|
|
h = (h << 5) + h + *name++;
|
|
return (h);
|
|
}
|
|
|
|
/*
|
|
* find name in the hash table
|
|
*/
|
|
ndptr
|
|
lookup(name)
|
|
const char *name;
|
|
{
|
|
ndptr p;
|
|
unsigned int h;
|
|
|
|
h = hash(name);
|
|
for (p = hashtab[h % HASHSIZE]; p != nil; p = p->nxtptr)
|
|
if (h == p->hv && STREQ(name, p->name))
|
|
break;
|
|
return (p);
|
|
}
|
|
|
|
/*
|
|
* hash and create an entry in the hash table.
|
|
* The new entry is added in front of a hash bucket.
|
|
*/
|
|
ndptr
|
|
addent(name)
|
|
const char *name;
|
|
{
|
|
unsigned int h;
|
|
ndptr p;
|
|
|
|
h = hash(name);
|
|
p = (ndptr) xalloc(sizeof(struct ndblock));
|
|
p->nxtptr = hashtab[h % HASHSIZE];
|
|
hashtab[h % HASHSIZE] = p;
|
|
p->name = xstrdup(name);
|
|
p->hv = h;
|
|
return p;
|
|
}
|
|
|
|
static void
|
|
freent(p)
|
|
ndptr p;
|
|
{
|
|
free((char *) p->name);
|
|
if (p->defn != null)
|
|
free((char *) p->defn);
|
|
free((char *) p);
|
|
}
|
|
|
|
/*
|
|
* remove an entry from the hashtable
|
|
*/
|
|
void
|
|
remhash(name, all)
|
|
const char *name;
|
|
int all;
|
|
{
|
|
unsigned int h;
|
|
ndptr xp, tp, mp;
|
|
|
|
h = hash(name);
|
|
mp = hashtab[h % HASHSIZE];
|
|
tp = nil;
|
|
while (mp != nil) {
|
|
if (mp->hv == h && STREQ(mp->name, name)) {
|
|
mp = mp->nxtptr;
|
|
if (tp == nil) {
|
|
freent(hashtab[h % HASHSIZE]);
|
|
hashtab[h % HASHSIZE] = mp;
|
|
}
|
|
else {
|
|
xp = tp->nxtptr;
|
|
tp->nxtptr = mp;
|
|
freent(xp);
|
|
}
|
|
if (!all)
|
|
break;
|
|
}
|
|
else {
|
|
tp = mp;
|
|
mp = mp->nxtptr;
|
|
}
|
|
}
|
|
}
|