xref: /minix3/external/bsd/dhcp/dist/includes/omapip/hash.h (revision 83ee113ee0d94f3844d44065af2311604e9a30ad)

/*	$NetBSD: hash.h,v 1.1.1.3 2014/07/12 11:57:57 spz Exp $	*/
/* hash.h

   Definitions for hashing... */

/*
 * Copyright (c) 2004,2009,2014 by Internet Systems Consortium, Inc. ("ISC")
 * Copyright (c) 1995-2003 by Internet Software Consortium
 *
 * Permission to use, copy, modify, and distribute this software for any
 * purpose with or without fee is hereby granted, provided that the above
 * copyright notice and this permission notice appear in all copies.
 *
 * THE SOFTWARE IS PROVIDED "AS IS" AND ISC DISCLAIMS ALL WARRANTIES
 * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
 * MERCHANTABILITY AND FITNESS.  IN NO EVENT SHALL ISC BE LIABLE FOR
 * ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
 * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
 * ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT
 * OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
 *
 *   Internet Systems Consortium, Inc.
 *   950 Charter Street
 *   Redwood City, CA 94063
 *   <info@isc.org>
 *   https://www.isc.org/
 *
 */

#ifndef OMAPI_HASH_H
#define OMAPI_HASH_H

#if !defined (DEFAULT_HASH_SIZE)
# define DEFAULT_HASH_SIZE	9973
#endif

#if !defined (KEY_HASH_SIZE)
# define KEY_HASH_SIZE		1009
#endif

/* The purpose of the hashed_object_t struct is to not match anything else. */
typedef struct {
	int foo;
} hashed_object_t;

typedef isc_result_t (*hash_foreach_func)(const void *, unsigned, void *);
typedef int (*hash_reference) (hashed_object_t **, hashed_object_t *,
			       const char *, int);
typedef int (*hash_dereference) (hashed_object_t **, const char *, int);

struct hash_bucket {
	struct hash_bucket *next;
	const unsigned char *name;
	unsigned len;
	hashed_object_t *value;
};

typedef int (*hash_comparator_t)(const void *, const void *, size_t);

struct hash_table {
	unsigned hash_count;
	hash_reference referencer;
	hash_dereference dereferencer;
	hash_comparator_t cmp;
	unsigned (*do_hash)(const void *, unsigned, unsigned);

	/* This must remain the last entry in this table. */
	struct hash_bucket *buckets [1];
};

struct named_hash {
	struct named_hash *next;
	const char *name;
	struct hash_table *hash;
};

#define HASH_FUNCTIONS_DECL(name, bufarg, type, hashtype)		      \
void name##_hash_add (hashtype *, bufarg, unsigned, type *,		      \
		      const char *, int);				      \
void name##_hash_delete (hashtype *, bufarg, unsigned,			      \
			 const char *, int);				      \
int name##_hash_lookup (type **, hashtype *, bufarg, unsigned,		      \
			const char *, int);				      \
unsigned char * name##_hash_report(hashtype *);				      \
int name##_hash_foreach (hashtype *, hash_foreach_func);		      \
int name##_new_hash (hashtype **, unsigned, const char *, int);		      \
void name##_free_hash_table (hashtype **, const char *, int);


#define HASH_FUNCTIONS(name, bufarg, type, hashtype, ref, deref, hasher)      \
void name##_hash_add (hashtype *table,					      \
		      bufarg buf, unsigned len, type *ptr,		      \
		      const char *file, int line)			      \
{									      \
	add_hash ((struct hash_table *)table, buf,			      \
		  len, (hashed_object_t *)ptr, file, line);		      \
}									      \
									      \
void name##_hash_delete (hashtype *table, bufarg buf, unsigned len,	      \
			 const char *file, int line)			      \
{									      \
	delete_hash_entry ((struct hash_table *)table, buf, len,	      \
			   file, line);					      \
}									      \
									      \
int name##_hash_lookup (type **ptr, hashtype *table,			      \
			bufarg buf, unsigned len, const char *file, int line) \
{									      \
	return hash_lookup ((hashed_object_t **)ptr,			      \
			    (struct hash_table *)table,			      \
			    buf, len, file, line);			      \
}									      \
									      \
unsigned char * name##_hash_report(hashtype *table)			      \
{									      \
	return hash_report((struct hash_table *)table);			      \
}									      \
									      \
int name##_hash_foreach (hashtype *table, hash_foreach_func func)	      \
{									      \
	return hash_foreach ((struct hash_table *)table,		      \
			     func);					      \
}									      \
									      \
int name##_new_hash (hashtype **tp, unsigned c, const char *file, int line)   \
{									      \
	return new_hash ((struct hash_table **)tp,			      \
			 (hash_reference)ref, (hash_dereference)deref, c,     \
			 hasher, file, line);				      \
}									      \
									      \
void name##_free_hash_table (hashtype **table, const char *file, int line)    \
{									      \
	free_hash_table ((struct hash_table **)table, file, line);	      \
}

void relinquish_hash_bucket_hunks (void);
int new_hash_table (struct hash_table **, unsigned, const char *, int);
void free_hash_table (struct hash_table **, const char *, int);
struct hash_bucket *new_hash_bucket (const char *, int);
void free_hash_bucket (struct hash_bucket *, const char *, int);
int new_hash(struct hash_table **,
	     hash_reference, hash_dereference, unsigned,
	     unsigned (*do_hash)(const void *, unsigned, unsigned),
	     const char *, int);
unsigned do_string_hash(const void *, unsigned, unsigned);
unsigned do_case_hash(const void *, unsigned, unsigned);
unsigned do_id_hash(const void *, unsigned, unsigned);
unsigned do_number_hash(const void *, unsigned, unsigned);
unsigned do_ip4_hash(const void *, unsigned, unsigned);
unsigned char *hash_report(struct hash_table *);
void add_hash (struct hash_table *,
		      const void *, unsigned, hashed_object_t *,
		      const char *, int);
void delete_hash_entry (struct hash_table *, const void *,
			       unsigned, const char *, int);
int hash_lookup (hashed_object_t **, struct hash_table *,
			const void *, unsigned, const char *, int);
int hash_foreach (struct hash_table *, hash_foreach_func);
int casecmp (const void *s, const void *t, size_t len);

#endif /* OMAPI_HASH_H */