1 files changed, 454 insertions, 0 deletions

diff --git a/sys/contrib/ipfilter/netinet/ip_htable.c b/sys/contrib/ipfilter/netinet/ip_htable.c
new file mode 100644
index 0000000..aaecaa6
--- /dev/null
+++ b/sys/contrib/ipfilter/netinet/ip_htable.c
@@ -0,0 +1,454 @@
+/*	$FreeBSD$	*/
+
+/*
+ * Copyright (C) 1993-2001, 2003 by Darren Reed.
+ *
+ * See the IPFILTER.LICENCE file for details on licencing.
+ */
+#if defined(KERNEL) || defined(_KERNEL)
+# undef KERNEL
+# undef _KERNEL
+# define        KERNEL	1
+# define        _KERNEL	1
+#endif
+#include <sys/param.h>
+#include <sys/types.h>
+#include <sys/errno.h>
+#include <sys/time.h>
+#include <sys/file.h>
+#if !defined(_KERNEL)
+# include <stdlib.h>
+# include <string.h>
+# define _KERNEL
+# ifdef __OpenBSD__
+struct file;
+# endif
+# include <sys/uio.h>
+# undef _KERNEL
+#endif
+#include <sys/socket.h>
+#if defined(__FreeBSD_version) && (__FreeBSD_version >= 300000)
+# include <sys/malloc.h>
+#endif
+#if defined(__FreeBSD__)
+#  include <sys/cdefs.h>
+#  include <sys/proc.h>
+#endif
+#if !defined(__svr4__) && !defined(__SVR4) && !defined(__hpux) && \
+    !defined(linux)
+# include <sys/mbuf.h>
+#endif
+#if defined(_KERNEL)
+# include <sys/systm.h>
+#else
+# include <stdio.h>
+#endif
+#include <netinet/in.h>
+#include <net/if.h>
+
+#include "netinet/ip_compat.h"
+#include "netinet/ip_fil.h"
+#include "netinet/ip_lookup.h"
+#include "netinet/ip_htable.h"
+/* END OF INCLUDES */
+
+#if !defined(lint)
+static const char rcsid[] = "@(#)$Id: ip_htable.c,v 2.34.2.4 2005/11/13 15:38:37 darrenr Exp $";
+#endif
+
+#ifdef	IPFILTER_LOOKUP
+static iphtent_t *fr_iphmfind __P((iphtable_t *, struct in_addr *));
+static	u_long	ipht_nomem[IPL_LOGSIZE] = { 0, 0, 0, 0, 0, 0, 0, 0 };
+static	u_long	ipf_nhtables[IPL_LOGSIZE] = { 0, 0, 0, 0, 0, 0, 0, 0 };
+static	u_long	ipf_nhtnodes[IPL_LOGSIZE] = { 0, 0, 0, 0, 0, 0, 0, 0 };
+
+iphtable_t *ipf_htables[IPL_LOGSIZE] = { NULL, NULL, NULL, NULL,
+					 NULL, NULL, NULL, NULL };
+
+
+void fr_htable_unload()
+{
+	iplookupflush_t fop;
+
+	fop.iplf_unit = IPL_LOGALL;
+	(void)fr_flushhtable(&fop);
+}
+
+
+int fr_gethtablestat(op)
+iplookupop_t *op;
+{
+	iphtstat_t stats;
+
+	if (op->iplo_size != sizeof(stats))
+		return EINVAL;
+
+	stats.iphs_tables = ipf_htables[op->iplo_unit];
+	stats.iphs_numtables = ipf_nhtables[op->iplo_unit];
+	stats.iphs_numnodes = ipf_nhtnodes[op->iplo_unit];
+	stats.iphs_nomem = ipht_nomem[op->iplo_unit];
+
+	return COPYOUT(&stats, op->iplo_struct, sizeof(stats));
+
+}
+
+
+/*
+ * Create a new hash table using the template passed.
+ */
+int fr_newhtable(op)
+iplookupop_t *op;
+{
+	iphtable_t *iph, *oiph;
+	char name[FR_GROUPLEN];
+	int err, i, unit;
+
+	KMALLOC(iph, iphtable_t *);
+	if (iph == NULL) {
+		ipht_nomem[op->iplo_unit]++;
+		return ENOMEM;
+	}
+
+	err = COPYIN(op->iplo_struct, iph, sizeof(*iph));
+	if (err != 0) {
+		KFREE(iph);
+		return EFAULT;
+	}
+
+	unit = op->iplo_unit;
+	if (iph->iph_unit != unit) {
+		KFREE(iph);
+		return EINVAL;
+	}
+
+	if ((op->iplo_arg & IPHASH_ANON) == 0) {
+		if (fr_findhtable(op->iplo_unit, op->iplo_name) != NULL) {
+			KFREE(iph);
+			return EEXIST;
+		}
+	} else {
+		i = IPHASH_ANON;
+		do {
+			i++;
+#if defined(SNPRINTF) && defined(_KERNEL)
+			SNPRINTF(name, sizeof(name), "%u", i);
+#else
+			(void)sprintf(name, "%u", i);
+#endif
+			for (oiph = ipf_htables[unit]; oiph != NULL;
+			     oiph = oiph->iph_next)
+				if (strncmp(oiph->iph_name, name,
+					    sizeof(oiph->iph_name)) == 0)
+					break;
+		} while (oiph != NULL);
+
+		(void)strncpy(iph->iph_name, name, sizeof(iph->iph_name));
+		(void)strncpy(op->iplo_name, name, sizeof(op->iplo_name));
+		iph->iph_type |= IPHASH_ANON;
+	}
+
+	KMALLOCS(iph->iph_table, iphtent_t **,
+		 iph->iph_size * sizeof(*iph->iph_table));
+	if (iph->iph_table == NULL) {
+		KFREE(iph);
+		ipht_nomem[unit]++;
+		return ENOMEM;
+	}
+
+	bzero((char *)iph->iph_table, iph->iph_size * sizeof(*iph->iph_table));
+	iph->iph_masks = 0;
+
+	iph->iph_next = ipf_htables[unit];
+	iph->iph_pnext = &ipf_htables[unit];
+	if (ipf_htables[unit] != NULL)
+		ipf_htables[unit]->iph_pnext = &iph->iph_next;
+	ipf_htables[unit] = iph;
+
+	ipf_nhtables[unit]++;
+
+	return 0;
+}
+
+
+/*
+ */
+int fr_removehtable(op)
+iplookupop_t *op;
+{
+	iphtable_t *iph;
+
+
+	iph = fr_findhtable(op->iplo_unit, op->iplo_name);
+	if (iph == NULL)
+		return ESRCH;
+
+	if (iph->iph_unit != op->iplo_unit) {
+		return EINVAL;
+	}
+
+	if (iph->iph_ref != 0) {
+		return EBUSY;
+	}
+
+	fr_delhtable(iph);
+
+	return 0;
+}
+
+
+void fr_delhtable(iph)
+iphtable_t *iph;
+{
+	iphtent_t *ipe;
+	int i;
+
+	for (i = 0; i < iph->iph_size; i++)
+		while ((ipe = iph->iph_table[i]) != NULL)
+			if (fr_delhtent(iph, ipe) != 0)
+				return;
+
+	*iph->iph_pnext = iph->iph_next;
+	if (iph->iph_next != NULL)
+		iph->iph_next->iph_pnext = iph->iph_pnext;
+
+	ipf_nhtables[iph->iph_unit]--;
+
+	if (iph->iph_ref == 0) {
+		KFREES(iph->iph_table, iph->iph_size * sizeof(*iph->iph_table));
+		KFREE(iph);
+	}
+}
+
+
+void fr_derefhtable(iph)
+iphtable_t *iph;
+{
+	iph->iph_ref--;
+	if (iph->iph_ref == 0)
+		fr_delhtable(iph);
+}
+
+
+iphtable_t *fr_findhtable(unit, name)
+int unit;
+char *name;
+{
+	iphtable_t *iph;
+
+	for (iph = ipf_htables[unit]; iph != NULL; iph = iph->iph_next)
+		if (strncmp(iph->iph_name, name, sizeof(iph->iph_name)) == 0)
+			break;
+	return iph;
+}
+
+
+size_t fr_flushhtable(op)
+iplookupflush_t *op;
+{
+	iphtable_t *iph;
+	size_t freed;
+	int i;
+
+	freed = 0;
+
+	for (i = 0; i <= IPL_LOGMAX; i++) {
+		if (op->iplf_unit == i || op->iplf_unit == IPL_LOGALL) {
+			while ((iph = ipf_htables[i]) != NULL) {
+				fr_delhtable(iph);
+				freed++;
+			}
+		}
+	}
+
+	return freed;
+}
+
+
+/*
+ * Add an entry to a hash table.
+ */
+int fr_addhtent(iph, ipeo)
+iphtable_t *iph;
+iphtent_t *ipeo;
+{
+	iphtent_t *ipe;
+	u_int hv;
+	int bits;
+
+	KMALLOC(ipe, iphtent_t *);
+	if (ipe == NULL)
+		return -1;
+
+	bcopy((char *)ipeo, (char *)ipe, sizeof(*ipe));
+	ipe->ipe_addr.in4_addr &= ipe->ipe_mask.in4_addr;
+	ipe->ipe_addr.in4_addr = ntohl(ipe->ipe_addr.in4_addr);
+	bits = count4bits(ipe->ipe_mask.in4_addr);
+	ipe->ipe_mask.in4_addr = ntohl(ipe->ipe_mask.in4_addr);
+
+	hv = IPE_HASH_FN(ipe->ipe_addr.in4_addr, ipe->ipe_mask.in4_addr,
+			 iph->iph_size);
+	ipe->ipe_ref = 0;
+	ipe->ipe_next = iph->iph_table[hv];
+	ipe->ipe_pnext = iph->iph_table + hv;
+
+	if (iph->iph_table[hv] != NULL)
+		iph->iph_table[hv]->ipe_pnext = &ipe->ipe_next;
+	iph->iph_table[hv] = ipe;
+	if ((bits >= 0) && (bits != 32))
+		iph->iph_masks |= 1 << bits;
+
+	switch (iph->iph_type & ~IPHASH_ANON)
+	{
+	case IPHASH_GROUPMAP :
+		ipe->ipe_ptr = fr_addgroup(ipe->ipe_group, NULL,
+					   iph->iph_flags, IPL_LOGIPF,
+					   fr_active);
+		break;
+
+	default :
+		ipe->ipe_ptr = NULL;
+		ipe->ipe_value = 0;
+		break;
+	}
+
+	ipf_nhtnodes[iph->iph_unit]++;
+
+	return 0;
+}
+
+
+/*
+ * Delete an entry from a hash table.
+ */
+int fr_delhtent(iph, ipe)
+iphtable_t *iph;
+iphtent_t *ipe;
+{
+
+	if (ipe->ipe_ref != 0)
+		return EBUSY;
+
+
+	*ipe->ipe_pnext = ipe->ipe_next;
+	if (ipe->ipe_next != NULL)
+		ipe->ipe_next->ipe_pnext = ipe->ipe_pnext;
+
+	switch (iph->iph_type & ~IPHASH_ANON)
+	{
+	case IPHASH_GROUPMAP :
+		if (ipe->ipe_group != NULL)
+			fr_delgroup(ipe->ipe_group, IPL_LOGIPF, fr_active);
+		break;
+
+	default :
+		ipe->ipe_ptr = NULL;
+		ipe->ipe_value = 0;
+		break;
+	}
+
+	KFREE(ipe);
+
+	ipf_nhtnodes[iph->iph_unit]--;
+
+	return 0;
+}
+
+
+void *fr_iphmfindgroup(tptr, aptr)
+void *tptr, *aptr;
+{
+	struct in_addr *addr;
+	iphtable_t *iph;
+	iphtent_t *ipe;
+	void *rval;
+
+	READ_ENTER(&ip_poolrw);
+	iph = tptr;
+	addr = aptr;
+
+	ipe = fr_iphmfind(iph, addr);
+	if (ipe != NULL)
+		rval = ipe->ipe_ptr;
+	else
+		rval = NULL;
+	RWLOCK_EXIT(&ip_poolrw);
+	return rval;
+}
+
+
+/* ------------------------------------------------------------------------ */
+/* Function:    fr_iphmfindip                                               */
+/* Returns:     int     - 0 == +ve match, -1 == error, 1 == -ve/no match    */
+/* Parameters:  tptr(I)    - pointer to the pool to search                  */
+/*              version(I) - IP protocol version (4 or 6)                   */
+/*              aptr(I)    - pointer to address information                 */
+/*                                                                          */
+/* Search the hash table for a given address and return a search result.    */
+/* ------------------------------------------------------------------------ */
+int fr_iphmfindip(tptr, version, aptr)
+void *tptr, *aptr;
+int version;
+{
+	struct in_addr *addr;
+	iphtable_t *iph;
+	iphtent_t *ipe;
+	int rval;
+
+	if (version != 4)
+		return -1;
+
+	if (tptr == NULL || aptr == NULL)
+		return -1;
+
+	iph = tptr;
+	addr = aptr;
+
+	READ_ENTER(&ip_poolrw);
+	ipe = fr_iphmfind(iph, addr);
+	if (ipe != NULL)
+		rval = 0;
+	else
+		rval = 1;
+	RWLOCK_EXIT(&ip_poolrw);
+	return rval;
+}
+
+
+/* Locks:  ip_poolrw */
+static iphtent_t *fr_iphmfind(iph, addr)
+iphtable_t *iph;
+struct in_addr *addr;
+{
+	u_32_t hmsk, msk, ips;
+	iphtent_t *ipe;
+	u_int hv;
+
+	hmsk = iph->iph_masks;
+	msk = 0xffffffff;
+maskloop:
+	ips = ntohl(addr->s_addr) & msk;
+	hv = IPE_HASH_FN(ips, msk, iph->iph_size);
+	for (ipe = iph->iph_table[hv]; (ipe != NULL); ipe = ipe->ipe_next) {
+		if (ipe->ipe_mask.in4_addr != msk ||
+		    ipe->ipe_addr.in4_addr != ips) {
+			continue;
+		}
+		break;
+	}
+
+	if ((ipe == NULL) && (hmsk != 0)) {
+		while (hmsk != 0) {
+			msk <<= 1;
+			if (hmsk & 0x80000000)
+				break;
+			hmsk <<= 1;
+		}
+		if (hmsk != 0) {
+			hmsk <<= 1;
+			goto maskloop;
+		}
+	}
+	return ipe;
+}
+
+#endif /* IPFILTER_LOOKUP */