/*
 * Copyright (c) 1980, 1986, 1991 Regents of the University of California.
 * All rights reserved.
 *
 * %sccs.include.redist.c%
 *
 *	@(#)tuba_table.c	7.1 (Berkeley) 10/09/92
 */
#include "param.h"
#include "systm.h"
#include "proc.h"
#include "mbuf.h"
#include "socket.h"
#include "socketvar.h"
#include "domain.h"
#include "protosw.h"
#include "ioctl.h"

#include "net/if.h"
#include "net/af.h"
#include "net/radix.h"

#include "tuba_addr.h"

#include "netiso/iso.h"

#define	SA(p) ((struct sockaddr *)(p))

int	tuba_table_size;
struct	tuba_cache **tuba_table;
struct	radix_node_head *tuba_tree;
extern	int arpt_keep, arpt_prune;	/* use same values as arp cache */

void
tuba_timer()
{
	int s = splnet();
	int	i;
	register struct	tuba_cache **tc;
	long	timelimit = time.tv_sec - arpt_keep;

	timeout(tuba_timer, (caddr_t)0, arpt_prune * hz);
	for (i = tuba_table_size; i > 0; i--)
		if ((tc = tuba_table[i]) && (tc->tc_refcnt == 0) &&
		    (tc->tc_time < timelimit)) {
			tuba_table[i] = 0;
			rn_delete((caddr_t)&tc->tc_addr, (caddr_t)0, tuba_tree);
			free((caddr_t)tc, M_RTABLE);
		}
	splx(s);
}

tuba_init()
{
	rn_inithead((void **)&tuba_tree, 40);
	timeout(tuba_timer, (caddr_t)0, arpt_prune * hz);
}

int
tuba_lookup(isoa, flags, wait)
	register struct iso_addr *isoa;
	int flags;
{
	struct radix_node *rn;
	register struct tuba_cache *tc;
	int dupentry = 0, sum_even = 0, sum_odd = 0, delta, i;

	if (rn = rn_match(tuba_tree, (caddr_t)isoa)) {
		tc = (struct tuba_cache *)rn;
		tc->tc_time = time.tv_sec;
		return (tc->tc_index);
	}
	if ((tc = (struct tuba_cache *)malloc(sizeof(*tc), M_RTABLE, wait))
		== NULL)
		return (0);
	bzero((caddr_t)tc, sizeof (*tc))
	bcopy((caddr_t)isoa, (caddr_t)&tc->tc_addr, 1 + isoa->isoa_len);
	rn_insert((caddr_t)&tc->tc_addr, tuba_tree, &dupentry, tc->tc_nodes);
	if (dupentry)
		panic("tuba_lookup 1");
	tc->tc_time = time.tv_sec;
	tc->tc_flags = flags;
	sum_even = isoa->isoa_len;
	for (i = sum_even; --i >= 0; ) {
		delta = isoa->isoa_genaddr[i];
		i & 1 ? sum_even += delta : sum_odd += delta;
	}
	ICKSUM(tc->tc_sum_in, (sum_even << 8) + sum_odd);
	ICKSUM(tc->tc_sum_out, tc->sum_in + 0x1fffe - tc->tc_index);
	for (i = tuba_table_size; i > 0; i--)
		if (tuba_table[i] == 0)
			break;
	if (i) {
		tc->tc_index = 1;
		tuba_table[i] = tc;
		return (i);
	}
	if (tuba_table_size == 0)
		tuba_table_size = 15;
	if (tuba_table_size > 0x7fff)
		return (0);
	tuba_table_size = 1 + 2 * tuba_table_size;
	i = (tuba_table_size + 1) * sizeof(tc);
	new = (struct tuba_cache **)malloc((unsigned)i, M_RTABLE, wait);
	if (new == 0) {
		tuba_table_size = old_size;
		rn_delete((caddr_t)&tc->tc_addr, (caddr_t)0, tuba_tree);
		free((caddr_t)tc, M_RTABLE);
		return (0);
	}
	bzero((caddr_t)new, (unsigned)i);
	if (tuba_table)
		bcopy((caddr_t)tuba_table, (caddr_t)new, i >> 1);
	tuba_table[tc->tc_index = tuba_table_size] = tc;
	return (tc->tc_index);
}