Return to sym.c CVS log

Up to [Research Unix] / researchv10no / cmd / worm

researchv10 Norman

#include	<libc.h>
#include	"worm.h"
#include	"sym.h"

#define	NHASH	20011	/* prime please */
#define	HASHMUL	79L	/* this is a good value */
static Symtab *hash[NHASH];
int sym_mem_fail;

syminit()
{
	register Symtab **s, *ss;

	for(s = hash; s < &hash[NHASH]; s++){
		for(ss = *s; ss; ss = ss->next)
			free((char *)ss);
		*s = 0;
	}
}

void *
symlook(sym, space, install)
	char *sym;
	void *install;
{
	register long h;
	register char *p;
	register Symtab *s;

	for(p = sym, h = space; *p; h += *p++)
		h *= HASHMUL;
	if(h < 0)
		h = ~h;
	h %= NHASH;
	for(s = hash[h]; s; s = s->next)
		if((s->space == space) && (strcmp(s->name, sym) == 0)){
			if(install)
				s->value = install;
			return(s->value);
		}
	if(install){
		s = (Symtab *)malloc((unsigned)sizeof(Symtab));
		if(s == 0){
			sym_mem_fail++;
			return(install);
		}
		s->space = space;
		s->name = sym;
		s->value = install;
		s->next = hash[h];
		hash[h] = s;
	}
	return(install);
}

symdel(sym, space)
	char *sym;
{
	register long h;
	register char *p;
	register Symtab *s, *ls;

	for(p = sym, h = space; *p; h += *p++)
		h *= HASHMUL;
	if(h < 0)
		h = ~h;
	h %= NHASH;
	for(s = hash[h], ls = 0; s; ls = s, s = s->next)
		if((s->space == space) && (strcmp(s->name, sym) == 0)){
			if(ls)
				ls->next = s->next;
			else
				hash[h] = s->next;
			free((char *)s);
		}
}

symtraverse(space, fn)
	void (*fn)();
{
	register Symtab **s, *ss, *next;

	for(s = hash; s < &hash[NHASH]; s++)
		for(ss = *s; ss; ss = next){
			next = ss->next;
			if(ss->space == space)
				(*fn)(ss->value);
		}
}

symstat()
{
	register Symtab **s, *ss;
	int n[NHASH];
	register i, j;
	int tot;
	double d;

	for(i = 0; i < NHASH; i++)
		n[i] = 0;
	for(s = hash; s < &hash[NHASH]; s++){
		for(j = 0, ss = *s; ss; ss = ss->next)
			j++;
		n[j]++;
	}
	Fprint(1, "N=%ld mul=%ld\n", NHASH, HASHMUL);
	for(i = 0, d = 0, tot = 0; i < NHASH; i++){
		if(n[i]) Fprint(1, "%d of length %d\n", n[i], i);
		d += n[i]*i;
		if(i) tot += n[i];
	}
	Fprint(1, "ave len = %g\n", d/tot);
}

symdump(sym, space)
	char *sym;
{
	register long h;
	register char *p;
	register Symtab *s;

	for(p = sym, h = space; *p; h += *p++)
		h *= HASHMUL;
	if(h < 0)
		h = ~h;
	h %= NHASH;
	print("symdump(%s):\n", sym);
	for(s = hash[h]; s; s = s->next)
		print("\t%s: space=%d value=%ld\n", s->name, s->space, s->value);
}

This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.