Return to rhash.c CVS log

Up to [CSRG BSD Unix] / 42BSD / ingres / source / iutil

BSD 4.2

# include	<ingres.h>
# include	<aux.h>
# include	<symbol.h>
# include	<access.h>
# include	<lock.h>
# include	<sccs.h>

SCCSID(@(#)rhash.c	7.2	5/31/83)

/*
**  RHASH -- perform a randomizing hash on the full key.
**
**	Trace Flags:
**		26.12-13
*/

long
rhash(d, key)
register DESC	*d;
char		key[MAXTUP];
{
	register int	i;
	register char	*cp;
	long		bucket;
	char		tmp;
	int		j, *k, knt, numeric;

	bucket = 0;
	knt = 0;
	for (i = 1; i <= d->reldum.relatts; i++)
		if (d->relxtra[i])
		{
			/* form pointer to field */
			cp = &key[d->reloff[i]];
			numeric = d->relfrmt[i] != CHAR;
			for (j = 0; j < (d->relfrml[i] & I1MASK); j++)
				if (((tmp = *cp++) != ' ') || numeric)
					addabyte(tmp, &bucket, knt++);
		}
	/* remove sign bit from bucket the hard way */
	k = &bucket;
	*k &= 077777;
#	ifdef xATR3
	if (tTf(19, 12))
		printf("rhash:hval=%ld", bucket);
#	endif
	bucket %= d->reldum.relprim;
#	ifdef xATR3
	if (tTf(19, 12))
		printf(",returning %ld\n", bucket);
#	endif
	return (bucket);
}
/*
** ADDABYTE is used to map a long key into a four byte integer.
** As bytes are added, they are first rotated, then exclusive ored
** into the existing key.
*/

addabyte(ch, word, knt1)
char	ch;
long	*word;
int	knt1;
{
	register int	knt;
	long		i;

	knt = knt1;
	i = ch & 0377;	/*get rid of any sign extension*/
	knt += 8 * (knt & 3);	/*alternately add 0, 8, 16 or 24 to knt */
	knt &= 037;
	*word ^= (i << (knt) | i >> (32 - knt));
}

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