/*
 *	AARP:		An implementation of the AppleTalk AARP protocol for
 *			Ethernet 'ELAP'.
 *
 *		Alan Cox  <Alan.Cox@linux.org>
 *
 *	This doesn't fit cleanly with the IP arp. Potentially we can use
 *	the generic neighbour discovery code to clean this up.
 *
 *	FIXME:
 *		We ought to handle the retransmits with a single list and a 
 *	separate fast timer for when it is needed.
 *		Use neighbour discovery code.
 *		Token Ring Support.
 *
 *		This program is free software; you can redistribute it and/or
 *		modify it under the terms of the GNU General Public License
 *		as published by the Free Software Foundation; either version
 *		2 of the License, or (at your option) any later version.
 *
 *
 *	References:
 *		Inside AppleTalk (2nd Ed).
 *	Fixes:
 *		Jaume Grau	-	flush caches on AARP_PROBE
 *		Rob Newberry	-	Added proxy AARP and AARP proc fs, 
 *					moved probing from DDP module.
 *		Alistair Riddell-	on AARP_PROBE flush sooner - 
 *					ali@gwc.org.uk 000820
 *
 */

#include <linux/config.h>
#if defined(CONFIG_ATALK) || defined(CONFIG_ATALK_MODULE) 
#include <asm/uaccess.h>
#include <asm/system.h>
#include <asm/bitops.h>
#include <linux/types.h>
#include <linux/kernel.h>
#include <linux/sched.h>
#include <linux/string.h>
#include <linux/mm.h>
#include <linux/socket.h>
#include <linux/sockios.h>
#include <linux/in.h>
#include <linux/errno.h>
#include <linux/interrupt.h>
#include <linux/if_ether.h>
#include <linux/inet.h>
#include <linux/notifier.h>
#include <linux/netdevice.h>
#include <linux/etherdevice.h>
#include <linux/if_arp.h>
#include <linux/skbuff.h>
#include <net/sock.h>
#include <net/datalink.h>
#include <net/psnap.h>
#include <linux/atalk.h>
#include <linux/init.h>
#include <linux/proc_fs.h>

 
int sysctl_aarp_expiry_time = AARP_EXPIRY_TIME;
int sysctl_aarp_tick_time = AARP_TICK_TIME;
int sysctl_aarp_retransmit_limit = AARP_RETRANSMIT_LIMIT;
int sysctl_aarp_resolve_time = AARP_RESOLVE_TIME;

/*
 *	Lists of aarp entries
 */
 
struct aarp_entry
{
	/* These first two are only used for unresolved entries */
	unsigned long last_sent;		/* Last time we xmitted the aarp request */
	struct sk_buff_head packet_queue;	/* Queue of frames wait for resolution */
	int status;				/* Used for proxy AARP */
	unsigned long expires_at;		/* Entry expiry time */
	struct at_addr target_addr;		/* DDP Address */
	struct device *dev;			/* Device to use */
	char hwaddr[6];				/* Physical i/f address of target/router */
	unsigned short xmit_count;		/* When this hits 10 we give up */
	struct aarp_entry *next;		/* Next entry in chain */
};

/*
 *	Hashed list of resolved, unresolved and proxy entries
 */

static struct aarp_entry *resolved[AARP_HASH_SIZE], *unresolved[AARP_HASH_SIZE], *proxies[AARP_HASH_SIZE];
static int unresolved_count=0;

/*
 *	Used to walk the list and purge/kick entries.
 */
 
static struct timer_list aarp_timer;

/*
 *	Delete an aarp queue
 */
static void aarp_expire(struct aarp_entry *a)
{
	struct sk_buff *skb;
	
	while((skb=skb_dequeue(&a->packet_queue))!=NULL)
		kfree_skb(skb);
	kfree_s(a,sizeof(*a));
}

/*
 *	Send an aarp queue entry request
 */
 
static void aarp_send_query(struct aarp_entry *a)
{
	static char aarp_eth_multicast[ETH_ALEN]={ 0x09, 0x00, 0x07, 0xFF, 0xFF, 0xFF };
	struct device *dev=a->dev;
	int len=dev->hard_header_len+sizeof(struct elapaarp)+aarp_dl->header_length;
	struct sk_buff *skb=alloc_skb(len, GFP_ATOMIC);
	struct elapaarp *eah;
	struct at_addr *sat=atalk_find_dev_addr(dev);
	
	if(skb==NULL || sat==NULL)
		return;
	
	/*
	 *	Set up the buffer.
	 */		

	skb_reserve(skb,dev->hard_header_len+aarp_dl->header_length);
	eah		=	(struct elapaarp *)skb_put(skb,sizeof(struct elapaarp));
	skb->protocol   =       htons(ETH_P_ATALK);
	skb->nh.raw     =       skb->h.raw = (void *) eah;
	skb->dev	=	dev;
	
	/*
	 *	Set up the ARP.
	 */
	 
	eah->hw_type	=	htons(AARP_HW_TYPE_ETHERNET);
	eah->pa_type	=	htons(ETH_P_ATALK);
	eah->hw_len	=	ETH_ALEN;	
	eah->pa_len	=	AARP_PA_ALEN;
	eah->function	=	htons(AARP_REQUEST);
	
	memcpy(eah->hw_src, dev->dev_addr, ETH_ALEN);
	
	eah->pa_src_zero=	0;
	eah->pa_src_net	=	sat->s_net;
	eah->pa_src_node=	sat->s_node;
	
	memset(eah->hw_dst, '\0', ETH_ALEN);
	
	eah->pa_dst_zero=	0;
	eah->pa_dst_net	=	a->target_addr.s_net;
	eah->pa_dst_node=	a->target_addr.s_node;
	
	/*
	 *	Add ELAP headers and set target to the AARP multicast.
	 */
	 
	aarp_dl->datalink_header(aarp_dl, skb, aarp_eth_multicast);	

	/*
	 *	Send it.
	 */	
	
	dev_queue_xmit(skb);
	
	/*
	 *	Update the sending count
	 */
	 
	a->xmit_count++;
}

static void aarp_send_reply(struct device *dev, struct at_addr *us, struct at_addr *them, unsigned char *sha)
{
	int len=dev->hard_header_len+sizeof(struct elapaarp)+aarp_dl->header_length;
	struct sk_buff *skb=alloc_skb(len, GFP_ATOMIC);
	struct elapaarp *eah;
	
	if(skb==NULL)
		return;
	
	/*
	 *	Set up the buffer.
	 */		

	skb_reserve(skb,dev->hard_header_len+aarp_dl->header_length);
	eah		=	(struct elapaarp *)skb_put(skb,sizeof(struct elapaarp));	 
	skb->protocol   =       htons(ETH_P_ATALK);
	skb->nh.raw     =       skb->h.raw = (void *) eah;
	skb->dev	=	dev;
	
	/*
	 *	Set up the ARP.
	 */
	 
	eah->hw_type	=	htons(AARP_HW_TYPE_ETHERNET);
	eah->pa_type	=	htons(ETH_P_ATALK);
	eah->hw_len	=	ETH_ALEN;	
	eah->pa_len	=	AARP_PA_ALEN;
	eah->function	=	htons(AARP_REPLY);
	
	memcpy(eah->hw_src, dev->dev_addr, ETH_ALEN);
	
	eah->pa_src_zero=	0;
	eah->pa_src_net	=	us->s_net;
	eah->pa_src_node=	us->s_node;
	
	if(sha==NULL)
		memset(eah->hw_dst, '\0', ETH_ALEN);
	else
		memcpy(eah->hw_dst, sha, ETH_ALEN);
	
	eah->pa_dst_zero=	0;
	eah->pa_dst_net	=	them->s_net;
	eah->pa_dst_node=	them->s_node;
	
	/*
	 *	Add ELAP headers and set target to the AARP multicast.
	 */
	 
	aarp_dl->datalink_header(aarp_dl, skb, sha);	

	/*
	 *	Send it.
	 */	
	dev_queue_xmit(skb);
	
}

/*
 *	Send probe frames. Called from aarp_probe_network and aarp_proxy_probe_network.
 */
 
void aarp_send_probe(struct device *dev, struct at_addr *us)
{
	int len=dev->hard_header_len+sizeof(struct elapaarp)+aarp_dl->header_length;
	struct sk_buff *skb=alloc_skb(len, GFP_ATOMIC);
	struct elapaarp *eah;
	static char aarp_eth_multicast[ETH_ALEN]={ 0x09, 0x00, 0x07, 0xFF, 0xFF, 0xFF };
	
	if(skb==NULL)
		return;
	
	/*
	 *	Set up the buffer.
	 */		

	skb_reserve(skb,dev->hard_header_len+aarp_dl->header_length);
	eah		=	(struct elapaarp *)skb_put(skb,sizeof(struct elapaarp));
	skb->protocol   =       htons(ETH_P_ATALK);
	skb->nh.raw     =       skb->h.raw = (void *) eah;
	skb->dev	=	dev;
	
	/*
	 *	Set up the ARP.
	 */
	 
	eah->hw_type	=	htons(AARP_HW_TYPE_ETHERNET);
	eah->pa_type	=	htons(ETH_P_ATALK);
	eah->hw_len	=	ETH_ALEN;	
	eah->pa_len	=	AARP_PA_ALEN;
	eah->function	=	htons(AARP_PROBE);
	
	memcpy(eah->hw_src, dev->dev_addr, ETH_ALEN);
	
	eah->pa_src_zero=	0;
	eah->pa_src_net	=	us->s_net;
	eah->pa_src_node=	us->s_node;
	
	memset(eah->hw_dst, '\0', ETH_ALEN);
	
	eah->pa_dst_zero=	0;
	eah->pa_dst_net	=	us->s_net;
	eah->pa_dst_node=	us->s_node;
	
	/*
	 *	Add ELAP headers and set target to the AARP multicast.
	 */
	 
	aarp_dl->datalink_header(aarp_dl, skb, aarp_eth_multicast);	

	/*
	 *	Send it.
	 */	
	dev_queue_xmit(skb);
	
}
	
/*
 *	Handle an aarp timer expire
 */

static void aarp_expire_timer(struct aarp_entry **n)
{
	struct aarp_entry *t;
	while((*n)!=NULL)
	{
		/* Expired ? */
		if(time_after(jiffies, (*n)->expires_at))
		{
			t= *n;
			*n=(*n)->next;
			aarp_expire(t);
		}
		else
			n=&((*n)->next);
	}
}

/*
 *	Kick all pending requests 5 times a second.
 */
 
static void aarp_kick(struct aarp_entry **n)
{
	struct aarp_entry *t;
	while((*n)!=NULL)
	{
		/* Expired - if this will be the 11th transmit, we delete
		   instead */
		if((*n)->xmit_count>=sysctl_aarp_retransmit_limit)
		{
			t= *n;
			*n=(*n)->next;
			aarp_expire(t);
		}
		else
		{
			aarp_send_query(*n);
			n=&((*n)->next);
		}
	}
}

/*
 *	A device has gone down. Take all entries referring to the device
 *	and remove them.
 */
 
static void aarp_expire_device(struct aarp_entry **n, struct device *dev)
{
	struct aarp_entry *t;
	while((*n)!=NULL)
	{
		if((*n)->dev==dev)
		{
			t= *n;
			*n=(*n)->next;
			aarp_expire(t);
		}
		else
			n=&((*n)->next);
	}
}
		
/*
 *	Handle the timer event 
 */
 
static void aarp_expire_timeout(unsigned long unused)
{
	int ct=0;
	SOCKHASH_LOCK();
	for(ct=0;ct<AARP_HASH_SIZE;ct++)
	{
		aarp_expire_timer(&resolved[ct]);
		aarp_kick(&unresolved[ct]);
		aarp_expire_timer(&unresolved[ct]);
		aarp_expire_timer(&proxies[ct]);
	}
	SOCKHASH_UNLOCK();

	mod_timer(&aarp_timer, jiffies + 
		  (unresolved_count ? sysctl_aarp_tick_time:
		   sysctl_aarp_expiry_time));
}

/*
 *	Network device notifier chain handler.
 */
 
static int aarp_device_event(struct notifier_block *this, unsigned long event, void *ptr)
{
	int ct=0;
	if(event==NETDEV_DOWN)
	{
		SOCKHASH_LOCK();
		for(ct=0;ct<AARP_HASH_SIZE;ct++)
		{
			aarp_expire_device(&resolved[ct],ptr);
			aarp_expire_device(&unresolved[ct],ptr);
			aarp_expire_device(&proxies[ct],ptr);
		}
		SOCKHASH_UNLOCK();
	}
	return NOTIFY_DONE;
}

/*
 *	Create a new aarp entry.
 */
 
static struct aarp_entry *aarp_alloc(void)
{
	struct aarp_entry *a=kmalloc(sizeof(struct aarp_entry), GFP_ATOMIC);
	if(a==NULL)
		return NULL;
	skb_queue_head_init(&a->packet_queue);
	return a;
}

/*
 * Find an entry. We might return an expired but not yet purged entry. We
 * don't care as it will do no harm.
 */
static struct aarp_entry *aarp_find_entry(struct aarp_entry *list, struct device *dev, struct at_addr *sat)
{
	SOCKHASH_LOCK();
	while(list)
	{
		if(list->target_addr.s_net==sat->s_net &&
		   list->target_addr.s_node==sat->s_node && list->dev==dev)
			break;
		list=list->next;
	}
	SOCKHASH_UNLOCK();
	return list;
}

void aarp_proxy_remove(struct device *dev, struct at_addr *sa)
{
	struct aarp_entry *a;
	int hash;
	
	hash = 	sa->s_node % (AARP_HASH_SIZE-1);
	SOCKHASH_LOCK();
	a = aarp_find_entry(proxies[hash], dev, sa);
	if (a)
	{
		a->expires_at = 0;
		
	}
	SOCKHASH_UNLOCK();
}

struct at_addr* aarp_proxy_find(struct device *dev, struct at_addr *sa)
{
	struct aarp_entry *a;
	int hash;

	hash = 	sa->s_node % (AARP_HASH_SIZE-1);
	a = aarp_find_entry(proxies[hash], dev, sa);
	if (a != NULL)
		return sa;
	
	return NULL;
}

	
/*
 * Probe a Phase 1 device or a device that requires its Net:Node to
 * be set via an ioctl.
 */
void aarp_send_probe_phase1(struct atalk_iface *iface)
{
    struct ifreq atreq;
    struct sockaddr_at *sa = (struct sockaddr_at *)&atreq.ifr_addr;

    sa->sat_addr.s_node = iface->address.s_node;
    sa->sat_addr.s_net  = ntohs(iface->address.s_net);

	/* We pass the Net:Node to the drivers/cards by a Device ioctl. */
	if(!(iface->dev->do_ioctl(iface->dev, &atreq, SIOCSIFADDR)))
    {
    	(void)iface->dev->do_ioctl(iface->dev, &atreq, SIOCGIFADDR);
    	if((iface->address.s_net != htons(sa->sat_addr.s_net))
				|| (iface->address.s_node != sa->sat_addr.s_node))
			iface->status |= ATIF_PROBE_FAIL;

		iface->address.s_net  = htons(sa->sat_addr.s_net);
		iface->address.s_node = sa->sat_addr.s_node;
	}

	return;
}


void aarp_probe_network(struct atalk_iface *atif)
{
	struct device *dev = atif->dev;

	if(atif->dev->type == ARPHRD_LOCALTLK || atif->dev->type == ARPHRD_PPP)
		aarp_send_probe_phase1(atif);
	else
	{
		unsigned int count;
		for (count = 0; count < AARP_RETRANSMIT_LIMIT; count++)
		{
			aarp_send_probe(atif->dev, &atif->address);

			/*
			 * Defer 1/10th
			 */
			current->state = TASK_INTERRUPTIBLE;
			schedule_timeout(HZ/10);
							
			/*
			 * our atif may no longer be valid, if the device
			 * was brought down while we waited!
			 */
			if (atalk_find_dev(dev) != atif)
				return;
						
			if (atif->status & ATIF_PROBE_FAIL)
				break;
		}
	}
}

int aarp_proxy_probe_network(struct atalk_iface *atif, struct at_addr *sa)
{
	struct	aarp_entry	*entry;
	unsigned int count;
	int	hash;
	struct device *dev = atif->dev;
	
	/*
	 * we don't currently support LocalTalk or PPP for proxy AARP;
	 * if someone wants to try and add it, have fun
	 */
	if (atif->dev->type == ARPHRD_LOCALTLK)
		return (-EPROTONOSUPPORT);
		
	if (atif->dev->type == ARPHRD_PPP)
		return (-EPROTONOSUPPORT);
		
	/* 
	 * create a new AARP entry with the flags set to be published -- 
	 * we need this one to hang around even if it's in use
	 */
	entry = aarp_alloc();
	if (entry == NULL)
		return (-ENOMEM);
	
	entry->expires_at = -1;
	entry->status = ATIF_PROBE;
	entry->target_addr.s_node = sa->s_node;
	entry->target_addr.s_net = sa->s_net;
	entry->dev = atif->dev;

	SOCKHASH_LOCK();
	hash = sa->s_node % (AARP_HASH_SIZE-1);
	entry->next = proxies[hash];
	proxies[hash] = entry;
	
	for(count = 0; count < AARP_RETRANSMIT_LIMIT; count++)
	{
		aarp_send_probe(atif->dev, sa);

		/*
		 * Defer 1/10th
		 */
		current->state = TASK_INTERRUPTIBLE;
		SOCKHASH_UNLOCK();
		schedule_timeout(HZ/10);
		SOCKHASH_LOCK();
		
		/*
		 * our atif may no longer be valid, if the device was brought
		 * down while we waited!
		 */
		if (atalk_find_dev(dev) != atif) {
			SOCKHASH_UNLOCK();
			return -ENODEV;
		}
						
		if (entry->status & ATIF_PROBE_FAIL)
			break;
	}
	
	/*
	 * FIX ME: I think we need exclusive access to the status flags,
	 * 		in case some one fails the probe while we're removing
	 *		the probe flag.
	 */
	if (entry->status & ATIF_PROBE_FAIL)
	{
		/* free the entry */
		entry->expires_at = 0;
		
		/* return network full */
		SOCKHASH_UNLOCK();
		return (-EADDRINUSE);
	}
	else
	{
		/* clear the probing flag */
		entry->status &= ~ATIF_PROBE;
	}

	SOCKHASH_UNLOCK();
	return 1;	
}


/*
 *	Send a DDP frame
 */
int aarp_send_ddp(struct device *dev,struct sk_buff *skb, struct at_addr *sa, void *hwaddr)
{
	static char ddp_eth_multicast[ETH_ALEN]={ 0x09, 0x00, 0x07, 0xFF, 0xFF, 0xFF };
	int hash;
	struct aarp_entry *a;
	
	skb->nh.raw=skb->data;
	
	/*
	 *	Check for LocalTalk first
	 */
	 
	 
	if(dev->type==ARPHRD_LOCALTLK)
	{
		struct at_addr *at=atalk_find_dev_addr(dev);
		struct ddpehdr *ddp=(struct ddpehdr *)skb->data;
		int ft=2;
		
		/*
		 *	Compressible ?
		 * 
		 *	IFF: src_net==dest_net==device_net
		 *	(zero matches anything)
		 */
		 
		if( ( ddp->deh_snet==0 || at->s_net==ddp->deh_snet)
		  &&( ddp->deh_dnet==0 || at->s_net==ddp->deh_dnet) )
		{
			skb_pull(skb,sizeof(struct ddpehdr)-4);
			/*
			 *	The upper two remaining bytes are the port 
			 *	numbers	we just happen to need. Now put the 
			 *	length in the lower two.
			 */
			*((__u16 *)skb->data)=htons(skb->len);
			ft=1;
		}
		/*
		 *	Nice and easy. No AARP type protocols occur here
		 *	so we can just shovel it out with a 3 byte LLAP header
		 */
		 
		skb_push(skb,3);
		skb->data[0]=sa->s_node;
		skb->data[1]=at->s_node;
		skb->data[2]=ft;
		 
		if(skb->sk)
			skb->priority = skb->sk->priority;
		skb->dev = dev;
		dev_queue_xmit(skb);
		return 1;
	}	

	/*
	 *	On a PPP link we neither compress nor aarp.
	 */
	if(dev->type==ARPHRD_PPP)
	{
		skb->protocol = htons(ETH_P_PPPTALK);
		if(skb->sk)
			skb->priority = skb->sk->priority;
		skb->dev = dev;
		dev_queue_xmit(skb);
		return 1;
	}
	 
	/*
	 *	Non ELAP we cannot do.
	 */

	if(dev->type!=ARPHRD_ETHER)
	{
		return -1;
	}

	skb->dev = dev;
	skb->protocol = htons(ETH_P_ATALK);
			
	hash=sa->s_node%(AARP_HASH_SIZE-1);

	/*
	 *	Do we have a resolved entry ?
	 */
	 
	if(sa->s_node==ATADDR_BCAST)
	{
		ddp_dl->datalink_header(ddp_dl, skb, ddp_eth_multicast);
		if(skb->sk)
			skb->priority = skb->sk->priority;
		dev_queue_xmit(skb);
		return 1;
	}
	SOCKHASH_LOCK();
	a=aarp_find_entry(resolved[hash],dev,sa);
	if(a!=NULL)
	{
		/*
		 *	Return 1 and fill in the address
		 */

		a->expires_at=jiffies+sysctl_aarp_expiry_time*10;
		ddp_dl->datalink_header(ddp_dl, skb, a->hwaddr);
		if(skb->sk)
			skb->priority = skb->sk->priority;
		dev_queue_xmit(skb);
		SOCKHASH_UNLOCK();
		return 1;
	}

	/*
	 *	Do we have an unresolved entry: This is the less common path
	 */

	a=aarp_find_entry(unresolved[hash],dev,sa);
	if(a!=NULL)
	{
		/*
		 *	Queue onto the unresolved queue
		 */

		skb_queue_tail(&a->packet_queue, skb);
		SOCKHASH_UNLOCK();
		return 0;
	}

	/*
	 *	Allocate a new entry
	 */

	a=aarp_alloc();
	if(a==NULL)
	{
		/*
		 *	Whoops slipped... good job it's an unreliable 
		 *	protocol 8)	
		 */
		SOCKHASH_UNLOCK();
		return -1;
	}

	/*
	 *	Set up the queue
	 */

	skb_queue_tail(&a->packet_queue, skb);
	a->expires_at=jiffies+sysctl_aarp_resolve_time;
	a->dev=dev;
	a->next=unresolved[hash];
	a->target_addr= *sa;
	a->xmit_count=0;
	unresolved[hash]=a;
	unresolved_count++;

	/*
	 *	Send an initial request for the address
	 */

	aarp_send_query(a);

	/*
	 *	Switch to fast timer if needed (That is if this is the
	 *	first unresolved entry to get added)
	 */

	if(unresolved_count==1)
	{
		mod_timer(&aarp_timer, jiffies + sysctl_aarp_tick_time);
	}

	/*
	 *	Tell the ddp layer we have taken over for this frame.
	 */

	SOCKHASH_UNLOCK();
	return 0;
}

/*
 *	An entry in the aarp unresolved queue has become resolved. Send
 *	all the frames queued under it.
 */
static void aarp_resolved(struct aarp_entry **list, struct aarp_entry *a, int hash)
{
	struct sk_buff *skb;
	while(*list!=NULL)
	{
		if(*list==a)
		{
			unresolved_count--;
			*list=a->next;
			
			/* 
			 *	Move into the resolved list 
			 */
			 
			a->next=resolved[hash];
			resolved[hash]=a;
			
			/*
			 *	Kick frames off 
			 */
			 
			while((skb=skb_dequeue(&a->packet_queue))!=NULL)
			{
				a->expires_at=jiffies+sysctl_aarp_expiry_time*10;
				ddp_dl->datalink_header(ddp_dl,skb,a->hwaddr);
				if(skb->sk)
					skb->priority = skb->sk->priority;
				dev_queue_xmit(skb);
			}
		}
		else
			list=&((*list)->next);
	}
}

/*
 *	This is called by the SNAP driver whenever we see an AARP SNAP
 *	frame. We currently only support Ethernet.
 */
static int aarp_rcv(struct sk_buff *skb, struct device *dev, struct packet_type *pt)
{
	struct elapaarp *ea=(struct elapaarp *)skb->h.raw;
	struct aarp_entry *a;
	struct at_addr sa, *ma, da;
	int hash;
	struct atalk_iface *ifa;
	int func;
	
	
	/*
	 *	We only do Ethernet SNAP AARP
	 */
	 
	if(dev->type!=ARPHRD_ETHER)
	{
		kfree_skb(skb);
		return 0;
	}
	
	/*
	 *	Frame size ok ?
	 */
	 
	if(!skb_pull(skb,sizeof(*ea)))
	{
		kfree_skb(skb);
		return 0;
	}

	func=ntohs(ea->function);
	
	/*
	 *	Sanity check fields.
	 */
	 
	if(func<AARP_REQUEST || func > AARP_PROBE || ea->hw_len != ETH_ALEN || ea->pa_len != AARP_PA_ALEN ||
		ea->pa_src_zero != 0 || ea->pa_dst_zero != 0)
	{
		kfree_skb(skb);
		return 0;
	}
	
	/*
	 *	Looks good
	 */
	
	hash=ea->pa_src_node%(AARP_HASH_SIZE-1);

	/*
	 *	Build an address
	 */
	 
	sa.s_node=ea->pa_src_node;
	sa.s_net=ea->pa_src_net;
	
	/*
	 *	Process the packet
	 */
	 
	/*
	 *	Check for replies of me
	 */
			
	SOCKHASH_LOCK();
	ifa=atalk_find_dev(dev);
	if(ifa==NULL)
	{
		SOCKHASH_UNLOCK();
		kfree_skb(skb);
		return 1;		
	}
	if(ifa->status&ATIF_PROBE)
	{			
		if(ifa->address.s_node==ea->pa_dst_node && ifa->address.s_net==ea->pa_dst_net)
		{
			/*
			 *	Fail the probe (in use)
			 */
			 
			ifa->status|=ATIF_PROBE_FAIL;
			SOCKHASH_UNLOCK();
			kfree_skb(skb);
			return 1;		
		}
	}
	
	/*
	 * Check for replies of proxy AARP entries
	 */

	da.s_node = ea->pa_dst_node;
	da.s_net = ea->pa_dst_net;
	a = aarp_find_entry(proxies[hash], dev, &da);
	if (a != NULL)
		if (a->status & ATIF_PROBE)
		{
			a->status |= ATIF_PROBE_FAIL;
			
			/*
			 * we do not respond to probe or request packets for 
			 * this address while we are probing this address
			 */
			SOCKHASH_UNLOCK();
			kfree_skb(skb);
			return 1;
		}

	switch(func)
	{
		case AARP_REPLY:	
			if(unresolved_count==0)	/* Speed up */
				break;
			/*
			 *	Find the entry	
			 */
			 
			if((a=aarp_find_entry(unresolved[hash],dev,&sa))==NULL || dev != a->dev)
				break;
			/*
			 *	We can fill one in - this is good
			 */
			 
			memcpy(a->hwaddr,ea->hw_src,ETH_ALEN);
			aarp_resolved(&unresolved[hash],a,hash);
			if(unresolved_count==0)
			{
				mod_timer(&aarp_timer, jiffies +
					  sysctl_aarp_expiry_time);
			}
			break;
			
		case AARP_REQUEST:
		case AARP_PROBE:
			/*
			 *	If it is my address set ma to my address and reply. We can treat probe and
			 *	request the same. Probe simply means we shouldn't cache the querying host, 
			 *	as in a probe they are proposing an address not using one.
			 *	
			 *	Support for proxy-AARP added.  We check if the address is one
			 *	of our proxies before we toss the packet out.
			 */
			 
			sa.s_node=ea->pa_dst_node;
			sa.s_net=ea->pa_dst_net;

			/*
			 * see if we have a matching proxy
			 */
			ma = aarp_proxy_find(dev, &sa);
			if (!ma)
			{
				ma=&ifa->address;
			}
			else
			{
				/*
				 * we need to make a copy of the entry
				 */
				da.s_node = sa.s_node;
				da.s_net = da.s_net;
				ma = &da;
			}

			if(func==AARP_PROBE)
			{
				/* A probe implies someone trying to get an
				   address. So as a precaution flush any
				   entries we have for this address */
				struct aarp_entry *a=aarp_find_entry(
						resolved[sa.s_node%(AARP_HASH_SIZE-1)],
						skb->dev,
						&sa);
				/* Make it expire next tick - that avoids us
				   getting into a probe/flush/learn/probe/flush/learn
				   cycle during probing of a slow to respond host addr */
				if(a!=NULL)
				{
					a->expires_at=jiffies-1;
					mod_timer(&aarp_timer, jiffies + sysctl_aarp_tick_time);
				}
			}
			if(sa.s_node!=ma->s_node)
				break;
			if(sa.s_net && ma->s_net && sa.s_net!=ma->s_net)
				break;

			sa.s_node=ea->pa_src_node;
			sa.s_net=ea->pa_src_net;
			
			/*
			 *	aarp_my_address has found the address to use for us.
			 */
			 
			aarp_send_reply(dev,ma,&sa,ea->hw_src);
			break;
	}
	SOCKHASH_UNLOCK();
	kfree_skb(skb);
	return 1;		
}

static struct notifier_block aarp_notifier={
	aarp_device_event,
	NULL,
	0
};

static char aarp_snap_id[]={0x00,0x00,0x00,0x80,0xF3};


__initfunc(void aarp_proto_init(void))
{
	if((aarp_dl=register_snap_client(aarp_snap_id, aarp_rcv))==NULL)
		printk(KERN_CRIT "Unable to register AARP with SNAP.\n");
	init_timer(&aarp_timer);
	aarp_timer.function=aarp_expire_timeout;
	aarp_timer.data=0;
	aarp_timer.expires=jiffies+sysctl_aarp_expiry_time;
	add_timer(&aarp_timer);
	register_netdevice_notifier(&aarp_notifier);
}



/*
 * Remove the AARP entries associated with a device.
 */
void aarp_device_down(struct device *dev)
{
	int ct = 0;

	SOCKHASH_LOCK();
	for(ct = 0; ct < AARP_HASH_SIZE; ct++)
	{
		aarp_expire_device(&resolved[ct], dev);
		aarp_expire_device(&unresolved[ct], dev);
		aarp_expire_device(&proxies[ct], dev);
	}

	SOCKHASH_UNLOCK();
	return;
}

/*
 * Called from proc fs
 */
int aarp_get_info(char *buffer, char **start, off_t offset, int length, int dummy)
{
	/* we should dump all our AARP entries */
	struct aarp_entry	*entry;
	int			len, ct;

	len = sprintf(buffer,
		"%-10.10s  ""%-10.10s""%-18.18s""%12.12s""%12.12s"" xmit_count  status\n",
		"address","device","hw addr","last_sent", "expires");
	SOCKHASH_LOCK();
	for (ct = 0; ct < AARP_HASH_SIZE; ct++)
	{
		for (entry = resolved[ct]; entry; entry = entry->next)
		{
			len+= sprintf(buffer+len,"%6u:%-3u  ",
				(unsigned int)ntohs(entry->target_addr.s_net),
				(unsigned int)(entry->target_addr.s_node));
			len+= sprintf(buffer+len,"%-10.10s",
				entry->dev->name);
			len+= sprintf(buffer+len,"%2.2X:%2.2X:%2.2X:%2.2X:%2.2X:%2.2X",
				(int)(entry->hwaddr[0] & 0x000000FF),
				(int)(entry->hwaddr[1] & 0x000000FF),
				(int)(entry->hwaddr[2] & 0x000000FF),
				(int)(entry->hwaddr[3] & 0x000000FF),
				(int)(entry->hwaddr[4] & 0x000000FF),
				(int)(entry->hwaddr[5] & 0x000000FF));
			len+= sprintf(buffer+len,"%12lu ""%12lu ",
				(unsigned long)entry->last_sent,
				(unsigned long)entry->expires_at);
			len+=sprintf(buffer+len,"%10u",
				(unsigned int)entry->xmit_count);

			len+=sprintf(buffer+len,"   resolved\n");
		}
	}

	for (ct = 0; ct < AARP_HASH_SIZE; ct++)
	{
		for (entry = unresolved[ct]; entry; entry = entry->next)
		{
			len+= sprintf(buffer+len,"%6u:%-3u  ",
				(unsigned int)ntohs(entry->target_addr.s_net),
				(unsigned int)(entry->target_addr.s_node));
			len+= sprintf(buffer+len,"%-10.10s",
				entry->dev->name);
			len+= sprintf(buffer+len,"%2.2X:%2.2X:%2.2X:%2.2X:%2.2X:%2.2X",
				(int)(entry->hwaddr[0] & 0x000000FF),
				(int)(entry->hwaddr[1] & 0x000000FF),
				(int)(entry->hwaddr[2] & 0x000000FF),
				(int)(entry->hwaddr[3] & 0x000000FF),
				(int)(entry->hwaddr[4] & 0x000000FF),
				(int)(entry->hwaddr[5] & 0x000000FF));
			len+= sprintf(buffer+len,"%12lu ""%12lu ",
				(unsigned long)entry->last_sent,
				(unsigned long)entry->expires_at);
			len+=sprintf(buffer+len,"%10u",
				(unsigned int)entry->xmit_count);
			len+=sprintf(buffer+len," unresolved\n");
		}
	}

	for (ct = 0; ct < AARP_HASH_SIZE; ct++)
	{
		for (entry = proxies[ct]; entry; entry = entry->next)
		{
			len+= sprintf(buffer+len,"%6u:%-3u  ",
				(unsigned int)ntohs(entry->target_addr.s_net),
				(unsigned int)(entry->target_addr.s_node));
			len+= sprintf(buffer+len,"%-10.10s",
				entry->dev->name);
			len+= sprintf(buffer+len,"%2.2X:%2.2X:%2.2X:%2.2X:%2.2X:%2.2X",
				(int)(entry->hwaddr[0] & 0x000000FF),
				(int)(entry->hwaddr[1] & 0x000000FF),
				(int)(entry->hwaddr[2] & 0x000000FF),
				(int)(entry->hwaddr[3] & 0x000000FF),
				(int)(entry->hwaddr[4] & 0x000000FF),
				(int)(entry->hwaddr[5] & 0x000000FF));
			len+= sprintf(buffer+len,"%12lu ""%12lu ",
				(unsigned long)entry->last_sent,
				(unsigned long)entry->expires_at);
			len+=sprintf(buffer+len,"%10u",
				(unsigned int)entry->xmit_count);
			len+=sprintf(buffer+len,"      proxy\n");
		}
	}


	SOCKHASH_UNLOCK();
	return len;
}

#ifdef MODULE
/*
 * General module cleanup. Called from cleanup_module() in ddp.c.
 */
void aarp_cleanup_module(void)
{
	del_timer(&aarp_timer);
	unregister_netdevice_notifier(&aarp_notifier);
	unregister_snap_client(aarp_snap_id);
}

#endif  /* MODULE */

#ifdef CONFIG_PROC_FS

static struct proc_dir_entry proc_aarp_entries=
{
	PROC_NET_AT_AARP, 4, "aarp",
	S_IFREG | S_IRUGO, 1, 0, 0,
	0, &proc_net_inode_operations,
	aarp_get_info
};

void aarp_register_proc_fs(void)
{
	proc_net_register(&proc_aarp_entries);
}

void aarp_unregister_proc_fs(void)
{
	proc_net_unregister(PROC_NET_AT_AARP);
}

#endif

#endif  /* CONFIG_ATALK || CONFIG_ATALK_MODULE */
