[linux-2.6-block.git] / net / decnet / dn_neigh.c

/*
 * DECnet       An implementation of the DECnet protocol suite for the LINUX
 *              operating system.  DECnet is implemented using the  BSD Socket
 *              interface as the means of communication with the user level.
 *
 *              DECnet Neighbour Functions (Adjacency Database and
 *                                                        On-Ethernet Cache)
 *
 * Author:      Steve Whitehouse <SteveW@ACM.org>
 *
 *
 * Changes:
 *     Steve Whitehouse     : Fixed router listing routine
 *     Steve Whitehouse     : Added error_report functions
 *     Steve Whitehouse     : Added default router detection
 *     Steve Whitehouse     : Hop counts in outgoing messages
 *     Steve Whitehouse     : Fixed src/dst in outgoing messages so
 *                            forwarding now stands a good chance of
 *                            working.
 *     Steve Whitehouse     : Fixed neighbour states (for now anyway).
 *     Steve Whitehouse     : Made error_report functions dummies. This
 *                            is not the right place to return skbs.
 *     Steve Whitehouse     : Convert to seq_file
 *
 */

#include <linux/net.h>
#include <linux/module.h>
#include <linux/socket.h>
#include <linux/if_arp.h>
#include <linux/slab.h>
#include <linux/if_ether.h>
#include <linux/init.h>
#include <linux/proc_fs.h>
#include <linux/string.h>
#include <linux/netfilter_decnet.h>
#include <linux/spinlock.h>
#include <linux/seq_file.h>
#include <linux/rcupdate.h>
#include <linux/jhash.h>
#include <linux/atomic.h>
#include <net/net_namespace.h>
#include <net/neighbour.h>
#include <net/dst.h>
#include <net/flow.h>
#include <net/dn.h>
#include <net/dn_dev.h>
#include <net/dn_neigh.h>
#include <net/dn_route.h>

static int dn_neigh_construct(struct neighbour *);
static void dn_long_error_report(struct neighbour *, struct sk_buff *);
static void dn_short_error_report(struct neighbour *, struct sk_buff *);
static int dn_long_output(struct neighbour *, struct sk_buff *);
static int dn_short_output(struct neighbour *, struct sk_buff *);
static int dn_phase3_output(struct neighbour *, struct sk_buff *);


/*
 * For talking to broadcast devices: Ethernet & PPP
 */
static const struct neigh_ops dn_long_ops = {
	.family =		AF_DECnet,
	.error_report =		dn_long_error_report,
	.output =		dn_long_output,
	.connected_output =	dn_long_output,
};

/*
 * For talking to pointopoint and multidrop devices: DDCMP and X.25
 */
static const struct neigh_ops dn_short_ops = {
	.family =		AF_DECnet,
	.error_report =		dn_short_error_report,
	.output =		dn_short_output,
	.connected_output =	dn_short_output,
};

/*
 * For talking to DECnet phase III nodes
 */
static const struct neigh_ops dn_phase3_ops = {
	.family =		AF_DECnet,
	.error_report =		dn_short_error_report, /* Can use short version here */
	.output =		dn_phase3_output,
	.connected_output =	dn_phase3_output,
};

static u32 dn_neigh_hash(const void *pkey,
			 const struct net_device *dev,
			 __u32 *hash_rnd)
{
	return jhash_2words(*(__u16 *)pkey, 0, hash_rnd[0]);
}

struct neigh_table dn_neigh_table = {
	.family =			PF_DECnet,
	.entry_size =			NEIGH_ENTRY_SIZE(sizeof(struct dn_neigh)),
	.key_len =			sizeof(__le16),
	.protocol =			cpu_to_be16(ETH_P_DNA_RT),
	.hash =				dn_neigh_hash,
	.constructor =			dn_neigh_construct,
	.id =				"dn_neigh_cache",
	.parms ={
		.tbl =			&dn_neigh_table,
		.reachable_time =	30 * HZ,
		.data = {
			[NEIGH_VAR_MCAST_PROBES] = 0,
			[NEIGH_VAR_UCAST_PROBES] = 0,
			[NEIGH_VAR_APP_PROBES] = 0,
			[NEIGH_VAR_RETRANS_TIME] = 1 * HZ,
			[NEIGH_VAR_BASE_REACHABLE_TIME] = 30 * HZ,
			[NEIGH_VAR_DELAY_PROBE_TIME] = 5 * HZ,
			[NEIGH_VAR_GC_STALETIME] = 60 * HZ,
			[NEIGH_VAR_QUEUE_LEN_BYTES] = 64*1024,
			[NEIGH_VAR_PROXY_QLEN] = 0,
			[NEIGH_VAR_ANYCAST_DELAY] = 0,
			[NEIGH_VAR_PROXY_DELAY] = 0,
			[NEIGH_VAR_LOCKTIME] = 1 * HZ,
		},
	},
	.gc_interval =			30 * HZ,
	.gc_thresh1 =			128,
	.gc_thresh2 =			512,
	.gc_thresh3 =			1024,
};

static int dn_neigh_construct(struct neighbour *neigh)
{
	struct net_device *dev = neigh->dev;
	struct dn_neigh *dn = (struct dn_neigh *)neigh;
	struct dn_dev *dn_db;
	struct neigh_parms *parms;

	rcu_read_lock();
	dn_db = rcu_dereference(dev->dn_ptr);
	if (dn_db == NULL) {
		rcu_read_unlock();
		return -EINVAL;
	}

	parms = dn_db->neigh_parms;
	if (!parms) {
		rcu_read_unlock();
		return -EINVAL;
	}

	__neigh_parms_put(neigh->parms);
	neigh->parms = neigh_parms_clone(parms);

	if (dn_db->use_long)
		neigh->ops = &dn_long_ops;
	else
		neigh->ops = &dn_short_ops;
	rcu_read_unlock();

	if (dn->flags & DN_NDFLAG_P3)
		neigh->ops = &dn_phase3_ops;

	neigh->nud_state = NUD_NOARP;
	neigh->output = neigh->ops->connected_output;

	if ((dev->type == ARPHRD_IPGRE) || (dev->flags & IFF_POINTOPOINT))
		memcpy(neigh->ha, dev->broadcast, dev->addr_len);
	else if ((dev->type == ARPHRD_ETHER) || (dev->type == ARPHRD_LOOPBACK))
		dn_dn2eth(neigh->ha, dn->addr);
	else {
		net_dbg_ratelimited("Trying to create neigh for hw %d\n",
				    dev->type);
		return -EINVAL;
	}

	/*
	 * Make an estimate of the remote block size by assuming that its
	 * two less then the device mtu, which it true for ethernet (and
	 * other things which support long format headers) since there is
	 * an extra length field (of 16 bits) which isn't part of the
	 * ethernet headers and which the DECnet specs won't admit is part
	 * of the DECnet routing headers either.
	 *
	 * If we over estimate here its no big deal, the NSP negotiations
	 * will prevent us from sending packets which are too large for the
	 * remote node to handle. In any case this figure is normally updated
	 * by a hello message in most cases.
	 */
	dn->blksize = dev->mtu - 2;

	return 0;
}

static void dn_long_error_report(struct neighbour *neigh, struct sk_buff *skb)
{
	printk(KERN_DEBUG "dn_long_error_report: called\n");
	kfree_skb(skb);
}


static void dn_short_error_report(struct neighbour *neigh, struct sk_buff *skb)
{
	printk(KERN_DEBUG "dn_short_error_report: called\n");
	kfree_skb(skb);
}

static int dn_neigh_output_packet(struct sk_buff *skb)
{
	struct dst_entry *dst = skb_dst(skb);
	struct dn_route *rt = (struct dn_route *)dst;
	struct neighbour *neigh = rt->n;
	struct net_device *dev = neigh->dev;
	char mac_addr[ETH_ALEN];
	unsigned int seq;
	int err;

	dn_dn2eth(mac_addr, rt->rt_local_src);
	do {
		seq = read_seqbegin(&neigh->ha_lock);
		err = dev_hard_header(skb, dev, ntohs(skb->protocol),
				      neigh->ha, mac_addr, skb->len);
	} while (read_seqretry(&neigh->ha_lock, seq));

	if (err >= 0)
		err = dev_queue_xmit(skb);
	else {
		kfree_skb(skb);
		err = -EINVAL;
	}
	return err;
}

static int dn_long_output(struct neighbour *neigh, struct sk_buff *skb)
{
	struct net_device *dev = neigh->dev;
	int headroom = dev->hard_header_len + sizeof(struct dn_long_packet) + 3;
	unsigned char *data;
	struct dn_long_packet *lp;
	struct dn_skb_cb *cb = DN_SKB_CB(skb);


	if (skb_headroom(skb) < headroom) {
		struct sk_buff *skb2 = skb_realloc_headroom(skb, headroom);
		if (skb2 == NULL) {
			net_crit_ratelimited("dn_long_output: no memory\n");
			kfree_skb(skb);
			return -ENOBUFS;
		}
		consume_skb(skb);
		skb = skb2;
		net_info_ratelimited("dn_long_output: Increasing headroom\n");
	}

	data = skb_push(skb, sizeof(struct dn_long_packet) + 3);
	lp = (struct dn_long_packet *)(data+3);

	*((__le16 *)data) = cpu_to_le16(skb->len - 2);
	*(data + 2) = 1 | DN_RT_F_PF; /* Padding */

	lp->msgflg   = DN_RT_PKT_LONG|(cb->rt_flags&(DN_RT_F_IE|DN_RT_F_RQR|DN_RT_F_RTS));
	lp->d_area   = lp->d_subarea = 0;
	dn_dn2eth(lp->d_id, cb->dst);
	lp->s_area   = lp->s_subarea = 0;
	dn_dn2eth(lp->s_id, cb->src);
	lp->nl2      = 0;
	lp->visit_ct = cb->hops & 0x3f;
	lp->s_class  = 0;
	lp->pt       = 0;

	skb_reset_network_header(skb);

	return NF_HOOK(NFPROTO_DECNET, NF_DN_POST_ROUTING, skb, NULL,
		       neigh->dev, dn_neigh_output_packet);
}

static int dn_short_output(struct neighbour *neigh, struct sk_buff *skb)
{
	struct net_device *dev = neigh->dev;
	int headroom = dev->hard_header_len + sizeof(struct dn_short_packet) + 2;
	struct dn_short_packet *sp;
	unsigned char *data;
	struct dn_skb_cb *cb = DN_SKB_CB(skb);


	if (skb_headroom(skb) < headroom) {
		struct sk_buff *skb2 = skb_realloc_headroom(skb, headroom);
		if (skb2 == NULL) {
			net_crit_ratelimited("dn_short_output: no memory\n");
			kfree_skb(skb);
			return -ENOBUFS;
		}
		consume_skb(skb);
		skb = skb2;
		net_info_ratelimited("dn_short_output: Increasing headroom\n");
	}

	data = skb_push(skb, sizeof(struct dn_short_packet) + 2);
	*((__le16 *)data) = cpu_to_le16(skb->len - 2);
	sp = (struct dn_short_packet *)(data+2);

	sp->msgflg     = DN_RT_PKT_SHORT|(cb->rt_flags&(DN_RT_F_RQR|DN_RT_F_RTS));
	sp->dstnode    = cb->dst;
	sp->srcnode    = cb->src;
	sp->forward    = cb->hops & 0x3f;

	skb_reset_network_header(skb);

	return NF_HOOK(NFPROTO_DECNET, NF_DN_POST_ROUTING, skb, NULL,
		       neigh->dev, dn_neigh_output_packet);
}

/*
 * Phase 3 output is the same is short output, execpt that
 * it clears the area bits before transmission.
 */
static int dn_phase3_output(struct neighbour *neigh, struct sk_buff *skb)
{
	struct net_device *dev = neigh->dev;
	int headroom = dev->hard_header_len + sizeof(struct dn_short_packet) + 2;
	struct dn_short_packet *sp;
	unsigned char *data;
	struct dn_skb_cb *cb = DN_SKB_CB(skb);

	if (skb_headroom(skb) < headroom) {
		struct sk_buff *skb2 = skb_realloc_headroom(skb, headroom);
		if (skb2 == NULL) {
			net_crit_ratelimited("dn_phase3_output: no memory\n");
			kfree_skb(skb);
			return -ENOBUFS;
		}
		consume_skb(skb);
		skb = skb2;
		net_info_ratelimited("dn_phase3_output: Increasing headroom\n");
	}

	data = skb_push(skb, sizeof(struct dn_short_packet) + 2);
	*((__le16 *)data) = cpu_to_le16(skb->len - 2);
	sp = (struct dn_short_packet *)(data + 2);

	sp->msgflg   = DN_RT_PKT_SHORT|(cb->rt_flags&(DN_RT_F_RQR|DN_RT_F_RTS));
	sp->dstnode  = cb->dst & cpu_to_le16(0x03ff);
	sp->srcnode  = cb->src & cpu_to_le16(0x03ff);
	sp->forward  = cb->hops & 0x3f;

	skb_reset_network_header(skb);

	return NF_HOOK(NFPROTO_DECNET, NF_DN_POST_ROUTING, skb, NULL,
		       neigh->dev, dn_neigh_output_packet);
}

/*
 * Unfortunately, the neighbour code uses the device in its hash
 * function, so we don't get any advantage from it. This function
 * basically does a neigh_lookup(), but without comparing the device
 * field. This is required for the On-Ethernet cache
 */

/*
 * Pointopoint link receives a hello message
 */
void dn_neigh_pointopoint_hello(struct sk_buff *skb)
{
	kfree_skb(skb);
}

/*
 * Ethernet router hello message received
 */
int dn_neigh_router_hello(struct sk_buff *skb)
{
	struct rtnode_hello_message *msg = (struct rtnode_hello_message *)skb->data;

	struct neighbour *neigh;
	struct dn_neigh *dn;
	struct dn_dev *dn_db;
	__le16 src;

	src = dn_eth2dn(msg->id);

	neigh = __neigh_lookup(&dn_neigh_table, &src, skb->dev, 1);

	dn = (struct dn_neigh *)neigh;

	if (neigh) {
		write_lock(&neigh->lock);

		neigh->used = jiffies;
		dn_db = rcu_dereference(neigh->dev->dn_ptr);

		if (!(neigh->nud_state & NUD_PERMANENT)) {
			neigh->updated = jiffies;

			if (neigh->dev->type == ARPHRD_ETHER)
				memcpy(neigh->ha, &eth_hdr(skb)->h_source, ETH_ALEN);

			dn->blksize  = le16_to_cpu(msg->blksize);
			dn->priority = msg->priority;

			dn->flags &= ~DN_NDFLAG_P3;

			switch (msg->iinfo & DN_RT_INFO_TYPE) {
			case DN_RT_INFO_L1RT:
				dn->flags &=~DN_NDFLAG_R2;
				dn->flags |= DN_NDFLAG_R1;
				break;
			case DN_RT_INFO_L2RT:
				dn->flags |= DN_NDFLAG_R2;
			}
		}

		/* Only use routers in our area */
		if ((le16_to_cpu(src)>>10) == (le16_to_cpu((decnet_address))>>10)) {
			if (!dn_db->router) {
				dn_db->router = neigh_clone(neigh);
			} else {
				if (msg->priority > ((struct dn_neigh *)dn_db->router)->priority)
					neigh_release(xchg(&dn_db->router, neigh_clone(neigh)));
			}
		}
		write_unlock(&neigh->lock);
		neigh_release(neigh);
	}

	kfree_skb(skb);
	return 0;
}

/*
 * Endnode hello message received
 */
int dn_neigh_endnode_hello(struct sk_buff *skb)
{
	struct endnode_hello_message *msg = (struct endnode_hello_message *)skb->data;
	struct neighbour *neigh;
	struct dn_neigh *dn;
	__le16 src;

	src = dn_eth2dn(msg->id);

	neigh = __neigh_lookup(&dn_neigh_table, &src, skb->dev, 1);

	dn = (struct dn_neigh *)neigh;

	if (neigh) {
		write_lock(&neigh->lock);

		neigh->used = jiffies;

		if (!(neigh->nud_state & NUD_PERMANENT)) {
			neigh->updated = jiffies;

			if (neigh->dev->type == ARPHRD_ETHER)
				memcpy(neigh->ha, &eth_hdr(skb)->h_source, ETH_ALEN);
			dn->flags   &= ~(DN_NDFLAG_R1 | DN_NDFLAG_R2);
			dn->blksize  = le16_to_cpu(msg->blksize);
			dn->priority = 0;
		}

		write_unlock(&neigh->lock);
		neigh_release(neigh);
	}

	kfree_skb(skb);
	return 0;
}

static char *dn_find_slot(char *base, int max, int priority)
{
	int i;
	unsigned char *min = NULL;

	base += 6; /* skip first id */

	for(i = 0; i < max; i++) {
		if (!min || (*base < *min))
			min = base;
		base += 7; /* find next priority */
	}

	if (!min)
		return NULL;

	return (*min < priority) ? (min - 6) : NULL;
}

struct elist_cb_state {
	struct net_device *dev;
	unsigned char *ptr;
	unsigned char *rs;
	int t, n;
};

static void neigh_elist_cb(struct neighbour *neigh, void *_info)
{
	struct elist_cb_state *s = _info;
	struct dn_neigh *dn;

	if (neigh->dev != s->dev)
		return;

	dn = (struct dn_neigh *) neigh;
	if (!(dn->flags & (DN_NDFLAG_R1|DN_NDFLAG_R2)))
		return;

	if (s->t == s->n)
		s->rs = dn_find_slot(s->ptr, s->n, dn->priority);
	else
		s->t++;
	if (s->rs == NULL)
		return;

	dn_dn2eth(s->rs, dn->addr);
	s->rs += 6;
	*(s->rs) = neigh->nud_state & NUD_CONNECTED ? 0x80 : 0x0;
	*(s->rs) |= dn->priority;
	s->rs++;
}

int dn_neigh_elist(struct net_device *dev, unsigned char *ptr, int n)
{
	struct elist_cb_state state;

	state.dev = dev;
	state.t = 0;
	state.n = n;
	state.ptr = ptr;
	state.rs = ptr;

	neigh_for_each(&dn_neigh_table, neigh_elist_cb, &state);

	return state.t;
}


#ifdef CONFIG_PROC_FS

static inline void dn_neigh_format_entry(struct seq_file *seq,
					 struct neighbour *n)
{
	struct dn_neigh *dn = (struct dn_neigh *) n;
	char buf[DN_ASCBUF_LEN];

	read_lock(&n->lock);
	seq_printf(seq, "%-7s %s%s%s   %02x    %02d  %07ld %-8s\n",
		   dn_addr2asc(le16_to_cpu(dn->addr), buf),
		   (dn->flags&DN_NDFLAG_R1) ? "1" : "-",
		   (dn->flags&DN_NDFLAG_R2) ? "2" : "-",
		   (dn->flags&DN_NDFLAG_P3) ? "3" : "-",
		   dn->n.nud_state,
		   atomic_read(&dn->n.refcnt),
		   dn->blksize,
		   (dn->n.dev) ? dn->n.dev->name : "?");
	read_unlock(&n->lock);
}

static int dn_neigh_seq_show(struct seq_file *seq, void *v)
{
	if (v == SEQ_START_TOKEN) {
		seq_puts(seq, "Addr    Flags State Use Blksize Dev\n");
	} else {
		dn_neigh_format_entry(seq, v);
	}

	return 0;
}

static void *dn_neigh_seq_start(struct seq_file *seq, loff_t *pos)
{
	return neigh_seq_start(seq, pos, &dn_neigh_table,
			       NEIGH_SEQ_NEIGH_ONLY);
}

static const struct seq_operations dn_neigh_seq_ops = {
	.start = dn_neigh_seq_start,
	.next  = neigh_seq_next,
	.stop  = neigh_seq_stop,
	.show  = dn_neigh_seq_show,
};

static int dn_neigh_seq_open(struct inode *inode, struct file *file)
{
	return seq_open_net(inode, file, &dn_neigh_seq_ops,
			    sizeof(struct neigh_seq_state));
}

static const struct file_operations dn_neigh_seq_fops = {
	.owner		= THIS_MODULE,
	.open		= dn_neigh_seq_open,
	.read		= seq_read,
	.llseek		= seq_lseek,
	.release	= seq_release_net,
};

#endif

void __init dn_neigh_init(void)
{
	neigh_table_init(NEIGH_DN_TABLE, &dn_neigh_table);
	proc_create("decnet_neigh", S_IRUGO, init_net.proc_net,
		    &dn_neigh_seq_fops);
}

void __exit dn_neigh_cleanup(void)
{
	remove_proc_entry("decnet_neigh", init_net.proc_net);
	neigh_table_clear(NEIGH_DN_TABLE, &dn_neigh_table);
}
Commit	Line	Data
1da177e4 LT	1	/*
	2	* DECnet An implementation of the DECnet protocol suite for the LINUX
	3	* operating system. DECnet is implemented using the BSD Socket
	4	* interface as the means of communication with the user level.
	5	*
429eb0fa	6	* DECnet Neighbour Functions (Adjacency Database and
1da177e4 LT	7	* On-Ethernet Cache)
	8	*
	9	* Author: Steve Whitehouse <SteveW@ACM.org>
	10	*
	11	*
	12	* Changes:
	13	* Steve Whitehouse : Fixed router listing routine
	14	* Steve Whitehouse : Added error_report functions
	15	* Steve Whitehouse : Added default router detection
	16	* Steve Whitehouse : Hop counts in outgoing messages
	17	* Steve Whitehouse : Fixed src/dst in outgoing messages so
	18	* forwarding now stands a good chance of
	19	* working.
	20	* Steve Whitehouse : Fixed neighbour states (for now anyway).
	21	* Steve Whitehouse : Made error_report functions dummies. This
	22	* is not the right place to return skbs.
	23	* Steve Whitehouse : Convert to seq_file
	24	*
	25	*/
	26
1da177e4 LT	27	#include <linux/net.h>
	28	#include <linux/module.h>
	29	#include <linux/socket.h>
	30	#include <linux/if_arp.h>
5a0e3ad6	31	#include <linux/slab.h>
1da177e4 LT	32	#include <linux/if_ether.h>
	33	#include <linux/init.h>
	34	#include <linux/proc_fs.h>
	35	#include <linux/string.h>
	36	#include <linux/netfilter_decnet.h>
	37	#include <linux/spinlock.h>
	38	#include <linux/seq_file.h>
	39	#include <linux/rcupdate.h>
	40	#include <linux/jhash.h>
60063497	41	#include <linux/atomic.h>
457c4cbc	42	#include <net/net_namespace.h>
1da177e4 LT	43	#include <net/neighbour.h>
	44	#include <net/dst.h>
	45	#include <net/flow.h>
	46	#include <net/dn.h>
	47	#include <net/dn_dev.h>
	48	#include <net/dn_neigh.h>
	49	#include <net/dn_route.h>
	50
1da177e4 LT	51	static int dn_neigh_construct(struct neighbour *);
	52	static void dn_long_error_report(struct neighbour , struct sk_buff );
	53	static void dn_short_error_report(struct neighbour , struct sk_buff );
8f40b161 DM	54	static int dn_long_output(struct neighbour , struct sk_buff );
	55	static int dn_short_output(struct neighbour , struct sk_buff );
	56	static int dn_phase3_output(struct neighbour , struct sk_buff );
1da177e4 LT	57
	58
	59	/*
	60	* For talking to broadcast devices: Ethernet & PPP
	61	*/
89d69d2b	62	static const struct neigh_ops dn_long_ops = {
1da177e4 LT	63	.family = AF_DECnet,
	64	.error_report = dn_long_error_report,
	65	.output = dn_long_output,
	66	.connected_output = dn_long_output,
1da177e4 LT	67	};
	68
	69	/*
	70	* For talking to pointopoint and multidrop devices: DDCMP and X.25
	71	*/
89d69d2b	72	static const struct neigh_ops dn_short_ops = {
1da177e4 LT	73	.family = AF_DECnet,
	74	.error_report = dn_short_error_report,
	75	.output = dn_short_output,
	76	.connected_output = dn_short_output,
1da177e4 LT	77	};
	78
	79	/*
	80	* For talking to DECnet phase III nodes
	81	*/
89d69d2b	82	static const struct neigh_ops dn_phase3_ops = {
1da177e4 LT	83	.family = AF_DECnet,
	84	.error_report = dn_short_error_report, /* Can use short version here */
	85	.output = dn_phase3_output,
	86	.connected_output = dn_phase3_output,
1da177e4 LT	87	};
1da177e4 LT	88
d6bf7817 ED	89	static u32 dn_neigh_hash(const void *pkey,
d6bf7817 ED	90	const struct net_device *dev,
2c2aba6c	91	__u32 *hash_rnd)
d6bf7817	92	{
2c2aba6c	93	return jhash_2words((__u16 )pkey, 0, hash_rnd[0]);
d6bf7817 ED	94	}
d6bf7817 ED	95
1da177e4 LT	96	struct neigh_table dn_neigh_table = {
1da177e4 LT	97	.family = PF_DECnet,
daaba4fa	98	.entry_size = NEIGH_ENTRY_SIZE(sizeof(struct dn_neigh)),
c4ea94ab	99	.key_len = sizeof(__le16),
bdf53c58	100	.protocol = cpu_to_be16(ETH_P_DNA_RT),
1da177e4 LT	101	.hash = dn_neigh_hash,
	102	.constructor = dn_neigh_construct,
	103	.id = "dn_neigh_cache",
	104	.parms ={
	105	.tbl = &dn_neigh_table,
1f9248e5 JP	106	.reachable_time = 30 * HZ,
	107	.data = {
	108	[NEIGH_VAR_MCAST_PROBES] = 0,
	109	[NEIGH_VAR_UCAST_PROBES] = 0,
	110	[NEIGH_VAR_APP_PROBES] = 0,
	111	[NEIGH_VAR_RETRANS_TIME] = 1 * HZ,
	112	[NEIGH_VAR_BASE_REACHABLE_TIME] = 30 * HZ,
	113	[NEIGH_VAR_DELAY_PROBE_TIME] = 5 * HZ,
	114	[NEIGH_VAR_GC_STALETIME] = 60 * HZ,
	115	[NEIGH_VAR_QUEUE_LEN_BYTES] = 64*1024,
	116	[NEIGH_VAR_PROXY_QLEN] = 0,
	117	[NEIGH_VAR_ANYCAST_DELAY] = 0,
	118	[NEIGH_VAR_PROXY_DELAY] = 0,
	119	[NEIGH_VAR_LOCKTIME] = 1 * HZ,
	120	},
1da177e4 LT	121	},
	122	.gc_interval = 30 * HZ,
	123	.gc_thresh1 = 128,
	124	.gc_thresh2 = 512,
	125	.gc_thresh3 = 1024,
	126	};
	127
1da177e4 LT	128	static int dn_neigh_construct(struct neighbour *neigh)
	129	{
	130	struct net_device *dev = neigh->dev;
	131	struct dn_neigh dn = (struct dn_neigh )neigh;
	132	struct dn_dev *dn_db;
	133	struct neigh_parms *parms;
	134
	135	rcu_read_lock();
	136	dn_db = rcu_dereference(dev->dn_ptr);
	137	if (dn_db == NULL) {
	138	rcu_read_unlock();
	139	return -EINVAL;
	140	}
	141
	142	parms = dn_db->neigh_parms;
	143	if (!parms) {
	144	rcu_read_unlock();
	145	return -EINVAL;
	146	}
	147
	148	__neigh_parms_put(neigh->parms);
	149	neigh->parms = neigh_parms_clone(parms);
1da177e4 LT	150
	151	if (dn_db->use_long)
	152	neigh->ops = &dn_long_ops;
	153	else
	154	neigh->ops = &dn_short_ops;
1f07247d	155	rcu_read_unlock();
1da177e4 LT	156
	157	if (dn->flags & DN_NDFLAG_P3)
	158	neigh->ops = &dn_phase3_ops;
	159
	160	neigh->nud_state = NUD_NOARP;
	161	neigh->output = neigh->ops->connected_output;
	162
	163	if ((dev->type == ARPHRD_IPGRE) \|\| (dev->flags & IFF_POINTOPOINT))
	164	memcpy(neigh->ha, dev->broadcast, dev->addr_len);
	165	else if ((dev->type == ARPHRD_ETHER) \|\| (dev->type == ARPHRD_LOOPBACK))
	166	dn_dn2eth(neigh->ha, dn->addr);
	167	else {
e87cc472 JP	168	net_dbg_ratelimited("Trying to create neigh for hw %d\n",
e87cc472 JP	169	dev->type);
1da177e4 LT	170	return -EINVAL;
	171	}
	172
	173	/*
	174	* Make an estimate of the remote block size by assuming that its
	175	* two less then the device mtu, which it true for ethernet (and
	176	* other things which support long format headers) since there is
	177	* an extra length field (of 16 bits) which isn't part of the
	178	* ethernet headers and which the DECnet specs won't admit is part
	179	* of the DECnet routing headers either.
	180	*
	181	* If we over estimate here its no big deal, the NSP negotiations
	182	* will prevent us from sending packets which are too large for the
	183	* remote node to handle. In any case this figure is normally updated
	184	* by a hello message in most cases.
	185	*/
	186	dn->blksize = dev->mtu - 2;
	187
	188	return 0;
	189	}
	190
	191	static void dn_long_error_report(struct neighbour neigh, struct sk_buff skb)
	192	{
	193	printk(KERN_DEBUG "dn_long_error_report: called\n");
	194	kfree_skb(skb);
	195	}
	196
	197
	198	static void dn_short_error_report(struct neighbour neigh, struct sk_buff skb)
	199	{
	200	printk(KERN_DEBUG "dn_short_error_report: called\n");
	201	kfree_skb(skb);
	202	}
	203
	204	static int dn_neigh_output_packet(struct sk_buff *skb)
	205	{
adf30907	206	struct dst_entry *dst = skb_dst(skb);
1da177e4	207	struct dn_route rt = (struct dn_route )dst;
fccd7d5c	208	struct neighbour *neigh = rt->n;
1da177e4 LT	209	struct net_device *dev = neigh->dev;
1da177e4 LT	210	char mac_addr[ETH_ALEN];
3329bdfc DM	211	unsigned int seq;
3329bdfc DM	212	int err;
1da177e4 LT	213
1da177e4 LT	214	dn_dn2eth(mac_addr, rt->rt_local_src);
3329bdfc DM	215	do {
	216	seq = read_seqbegin(&neigh->ha_lock);
	217	err = dev_hard_header(skb, dev, ntohs(skb->protocol),
	218	neigh->ha, mac_addr, skb->len);
	219	} while (read_seqretry(&neigh->ha_lock, seq));
	220
	221	if (err >= 0)
	222	err = dev_queue_xmit(skb);
	223	else {
	224	kfree_skb(skb);
	225	err = -EINVAL;
	226	}
	227	return err;
1da177e4 LT	228	}
1da177e4 LT	229
8f40b161	230	static int dn_long_output(struct neighbour neigh, struct sk_buff skb)
1da177e4	231	{
1da177e4 LT	232	struct net_device *dev = neigh->dev;
	233	int headroom = dev->hard_header_len + sizeof(struct dn_long_packet) + 3;
	234	unsigned char *data;
	235	struct dn_long_packet *lp;
	236	struct dn_skb_cb *cb = DN_SKB_CB(skb);
	237
	238
	239	if (skb_headroom(skb) < headroom) {
	240	struct sk_buff *skb2 = skb_realloc_headroom(skb, headroom);
	241	if (skb2 == NULL) {
e87cc472	242	net_crit_ratelimited("dn_long_output: no memory\n");
1da177e4 LT	243	kfree_skb(skb);
	244	return -ENOBUFS;
	245	}
5d0ba55b	246	consume_skb(skb);
1da177e4	247	skb = skb2;
e87cc472	248	net_info_ratelimited("dn_long_output: Increasing headroom\n");
1da177e4 LT	249	}
	250
	251	data = skb_push(skb, sizeof(struct dn_long_packet) + 3);
	252	lp = (struct dn_long_packet *)(data+3);
	253
c4106aa8	254	((__le16 )data) = cpu_to_le16(skb->len - 2);
1da177e4 LT	255	(data + 2) = 1 \| DN_RT_F_PF; / Padding */
	256
	257	lp->msgflg = DN_RT_PKT_LONG\|(cb->rt_flags&(DN_RT_F_IE\|DN_RT_F_RQR\|DN_RT_F_RTS));
	258	lp->d_area = lp->d_subarea = 0;
c4ea94ab	259	dn_dn2eth(lp->d_id, cb->dst);
1da177e4	260	lp->s_area = lp->s_subarea = 0;
c4ea94ab	261	dn_dn2eth(lp->s_id, cb->src);
1da177e4 LT	262	lp->nl2 = 0;
	263	lp->visit_ct = cb->hops & 0x3f;
	264	lp->s_class = 0;
	265	lp->pt = 0;
	266
c1d2bbe1	267	skb_reset_network_header(skb);
1da177e4	268
5d877d87 JE	269	return NF_HOOK(NFPROTO_DECNET, NF_DN_POST_ROUTING, skb, NULL,
5d877d87 JE	270	neigh->dev, dn_neigh_output_packet);
1da177e4 LT	271	}
1da177e4 LT	272
8f40b161	273	static int dn_short_output(struct neighbour neigh, struct sk_buff skb)
1da177e4	274	{
1da177e4 LT	275	struct net_device *dev = neigh->dev;
	276	int headroom = dev->hard_header_len + sizeof(struct dn_short_packet) + 2;
	277	struct dn_short_packet *sp;
	278	unsigned char *data;
	279	struct dn_skb_cb *cb = DN_SKB_CB(skb);
	280
	281
429eb0fa YH	282	if (skb_headroom(skb) < headroom) {
	283	struct sk_buff *skb2 = skb_realloc_headroom(skb, headroom);
	284	if (skb2 == NULL) {
e87cc472	285	net_crit_ratelimited("dn_short_output: no memory\n");
429eb0fa YH	286	kfree_skb(skb);
	287	return -ENOBUFS;
	288	}
5d0ba55b	289	consume_skb(skb);
429eb0fa	290	skb = skb2;
e87cc472	291	net_info_ratelimited("dn_short_output: Increasing headroom\n");
429eb0fa	292	}
1da177e4 LT	293
1da177e4 LT	294	data = skb_push(skb, sizeof(struct dn_short_packet) + 2);
c4106aa8	295	((__le16 )data) = cpu_to_le16(skb->len - 2);
1da177e4 LT	296	sp = (struct dn_short_packet *)(data+2);
	297
	298	sp->msgflg = DN_RT_PKT_SHORT\|(cb->rt_flags&(DN_RT_F_RQR\|DN_RT_F_RTS));
	299	sp->dstnode = cb->dst;
	300	sp->srcnode = cb->src;
	301	sp->forward = cb->hops & 0x3f;
	302
c1d2bbe1	303	skb_reset_network_header(skb);
1da177e4	304
5d877d87 JE	305	return NF_HOOK(NFPROTO_DECNET, NF_DN_POST_ROUTING, skb, NULL,
5d877d87 JE	306	neigh->dev, dn_neigh_output_packet);
1da177e4 LT	307	}
	308
	309	/*
	310	* Phase 3 output is the same is short output, execpt that
	311	* it clears the area bits before transmission.
	312	*/
8f40b161	313	static int dn_phase3_output(struct neighbour neigh, struct sk_buff skb)
1da177e4	314	{
1da177e4 LT	315	struct net_device *dev = neigh->dev;
	316	int headroom = dev->hard_header_len + sizeof(struct dn_short_packet) + 2;
	317	struct dn_short_packet *sp;
	318	unsigned char *data;
	319	struct dn_skb_cb *cb = DN_SKB_CB(skb);
	320
	321	if (skb_headroom(skb) < headroom) {
	322	struct sk_buff *skb2 = skb_realloc_headroom(skb, headroom);
	323	if (skb2 == NULL) {
e87cc472	324	net_crit_ratelimited("dn_phase3_output: no memory\n");
1da177e4 LT	325	kfree_skb(skb);
	326	return -ENOBUFS;
	327	}
5d0ba55b	328	consume_skb(skb);
1da177e4	329	skb = skb2;
e87cc472	330	net_info_ratelimited("dn_phase3_output: Increasing headroom\n");
1da177e4 LT	331	}
	332
	333	data = skb_push(skb, sizeof(struct dn_short_packet) + 2);
c4106aa8	334	((__le16 )data) = cpu_to_le16(skb->len - 2);
1da177e4 LT	335	sp = (struct dn_short_packet *)(data + 2);
	336
	337	sp->msgflg = DN_RT_PKT_SHORT\|(cb->rt_flags&(DN_RT_F_RQR\|DN_RT_F_RTS));
c4106aa8 HH	338	sp->dstnode = cb->dst & cpu_to_le16(0x03ff);
c4106aa8 HH	339	sp->srcnode = cb->src & cpu_to_le16(0x03ff);
1da177e4 LT	340	sp->forward = cb->hops & 0x3f;
1da177e4 LT	341
c1d2bbe1	342	skb_reset_network_header(skb);
1da177e4	343
5d877d87 JE	344	return NF_HOOK(NFPROTO_DECNET, NF_DN_POST_ROUTING, skb, NULL,
5d877d87 JE	345	neigh->dev, dn_neigh_output_packet);
1da177e4 LT	346	}
	347
	348	/*
	349	* Unfortunately, the neighbour code uses the device in its hash
	350	* function, so we don't get any advantage from it. This function
	351	* basically does a neigh_lookup(), but without comparing the device
	352	* field. This is required for the On-Ethernet cache
	353	*/
	354
	355	/*
	356	* Pointopoint link receives a hello message
	357	*/
	358	void dn_neigh_pointopoint_hello(struct sk_buff *skb)
	359	{
	360	kfree_skb(skb);
	361	}
	362
	363	/*
	364	* Ethernet router hello message received
	365	*/
	366	int dn_neigh_router_hello(struct sk_buff *skb)
	367	{
	368	struct rtnode_hello_message msg = (struct rtnode_hello_message )skb->data;
	369
	370	struct neighbour *neigh;
	371	struct dn_neigh *dn;
	372	struct dn_dev *dn_db;
c4ea94ab	373	__le16 src;
1da177e4	374
c4ea94ab	375	src = dn_eth2dn(msg->id);
1da177e4 LT	376
	377	neigh = __neigh_lookup(&dn_neigh_table, &src, skb->dev, 1);
	378
	379	dn = (struct dn_neigh *)neigh;
	380
	381	if (neigh) {
	382	write_lock(&neigh->lock);
	383
	384	neigh->used = jiffies;
fc766e4c	385	dn_db = rcu_dereference(neigh->dev->dn_ptr);
1da177e4 LT	386
	387	if (!(neigh->nud_state & NUD_PERMANENT)) {
	388	neigh->updated = jiffies;
	389
	390	if (neigh->dev->type == ARPHRD_ETHER)
	391	memcpy(neigh->ha, &eth_hdr(skb)->h_source, ETH_ALEN);
	392
c4106aa8	393	dn->blksize = le16_to_cpu(msg->blksize);
1da177e4 LT	394	dn->priority = msg->priority;
	395
	396	dn->flags &= ~DN_NDFLAG_P3;
	397
06f8fe11 JP	398	switch (msg->iinfo & DN_RT_INFO_TYPE) {
	399	case DN_RT_INFO_L1RT:
	400	dn->flags &=~DN_NDFLAG_R2;
	401	dn->flags \|= DN_NDFLAG_R1;
	402	break;
	403	case DN_RT_INFO_L2RT:
	404	dn->flags \|= DN_NDFLAG_R2;
1da177e4 LT	405	}
	406	}
	407
5062430c	408	/* Only use routers in our area */
c4106aa8	409	if ((le16_to_cpu(src)>>10) == (le16_to_cpu((decnet_address))>>10)) {
5062430c PC	410	if (!dn_db->router) {
	411	dn_db->router = neigh_clone(neigh);
	412	} else {
	413	if (msg->priority > ((struct dn_neigh *)dn_db->router)->priority)
	414	neigh_release(xchg(&dn_db->router, neigh_clone(neigh)));
	415	}
1da177e4 LT	416	}
	417	write_unlock(&neigh->lock);
	418	neigh_release(neigh);
	419	}
	420
	421	kfree_skb(skb);
	422	return 0;
	423	}
	424
	425	/*
	426	* Endnode hello message received
	427	*/
	428	int dn_neigh_endnode_hello(struct sk_buff *skb)
	429	{
	430	struct endnode_hello_message msg = (struct endnode_hello_message )skb->data;
	431	struct neighbour *neigh;
	432	struct dn_neigh *dn;
c4ea94ab	433	__le16 src;
1da177e4	434
c4ea94ab	435	src = dn_eth2dn(msg->id);
1da177e4 LT	436
	437	neigh = __neigh_lookup(&dn_neigh_table, &src, skb->dev, 1);
	438
	439	dn = (struct dn_neigh *)neigh;
	440
	441	if (neigh) {
	442	write_lock(&neigh->lock);
	443
	444	neigh->used = jiffies;
	445
	446	if (!(neigh->nud_state & NUD_PERMANENT)) {
	447	neigh->updated = jiffies;
	448
	449	if (neigh->dev->type == ARPHRD_ETHER)
	450	memcpy(neigh->ha, &eth_hdr(skb)->h_source, ETH_ALEN);
	451	dn->flags &= ~(DN_NDFLAG_R1 \| DN_NDFLAG_R2);
c4106aa8	452	dn->blksize = le16_to_cpu(msg->blksize);
1da177e4 LT	453	dn->priority = 0;
	454	}
	455
	456	write_unlock(&neigh->lock);
	457	neigh_release(neigh);
	458	}
	459
	460	kfree_skb(skb);
	461	return 0;
	462	}
	463
	464	static char dn_find_slot(char base, int max, int priority)
	465	{
	466	int i;
	467	unsigned char *min = NULL;
	468
	469	base += 6; /* skip first id */
	470
	471	for(i = 0; i < max; i++) {
	472	if (!min \|\| (base < min))
	473	min = base;
	474	base += 7; /* find next priority */
	475	}
	476
	477	if (!min)
	478	return NULL;
	479
	480	return (*min < priority) ? (min - 6) : NULL;
	481	}
	482
	483	struct elist_cb_state {
	484	struct net_device *dev;
	485	unsigned char *ptr;
	486	unsigned char *rs;
	487	int t, n;
	488	};
	489
	490	static void neigh_elist_cb(struct neighbour neigh, void _info)
	491	{
	492	struct elist_cb_state *s = _info;
1da177e4 LT	493	struct dn_neigh *dn;
	494
	495	if (neigh->dev != s->dev)
	496	return;
	497
	498	dn = (struct dn_neigh *) neigh;
	499	if (!(dn->flags & (DN_NDFLAG_R1\|DN_NDFLAG_R2)))
	500	return;
	501
1da177e4 LT	502	if (s->t == s->n)
	503	s->rs = dn_find_slot(s->ptr, s->n, dn->priority);
	504	else
	505	s->t++;
	506	if (s->rs == NULL)
	507	return;
	508
	509	dn_dn2eth(s->rs, dn->addr);
	510	s->rs += 6;
	511	*(s->rs) = neigh->nud_state & NUD_CONNECTED ? 0x80 : 0x0;
	512	*(s->rs) \|= dn->priority;
	513	s->rs++;
	514	}
	515
	516	int dn_neigh_elist(struct net_device dev, unsigned char ptr, int n)
	517	{
	518	struct elist_cb_state state;
	519
	520	state.dev = dev;
	521	state.t = 0;
	522	state.n = n;
	523	state.ptr = ptr;
	524	state.rs = ptr;
	525
	526	neigh_for_each(&dn_neigh_table, neigh_elist_cb, &state);
	527
	528	return state.t;
	529	}
	530
	531
	532	#ifdef CONFIG_PROC_FS
	533
	534	static inline void dn_neigh_format_entry(struct seq_file *seq,
	535	struct neighbour *n)
	536	{
	537	struct dn_neigh dn = (struct dn_neigh ) n;
	538	char buf[DN_ASCBUF_LEN];
	539
	540	read_lock(&n->lock);
	541	seq_printf(seq, "%-7s %s%s%s %02x %02d %07ld %-8s\n",
c4106aa8	542	dn_addr2asc(le16_to_cpu(dn->addr), buf),
1da177e4 LT	543	(dn->flags&DN_NDFLAG_R1) ? "1" : "-",
	544	(dn->flags&DN_NDFLAG_R2) ? "2" : "-",
	545	(dn->flags&DN_NDFLAG_P3) ? "3" : "-",
	546	dn->n.nud_state,
	547	atomic_read(&dn->n.refcnt),
	548	dn->blksize,
	549	(dn->n.dev) ? dn->n.dev->name : "?");
	550	read_unlock(&n->lock);
	551	}
	552
	553	static int dn_neigh_seq_show(struct seq_file seq, void v)
	554	{
	555	if (v == SEQ_START_TOKEN) {
	556	seq_puts(seq, "Addr Flags State Use Blksize Dev\n");
	557	} else {
	558	dn_neigh_format_entry(seq, v);
	559	}
	560
	561	return 0;
	562	}
	563
	564	static void dn_neigh_seq_start(struct seq_file seq, loff_t *pos)
	565	{
	566	return neigh_seq_start(seq, pos, &dn_neigh_table,
	567	NEIGH_SEQ_NEIGH_ONLY);
	568	}
	569
56b3d975	570	static const struct seq_operations dn_neigh_seq_ops = {
1da177e4 LT	571	.start = dn_neigh_seq_start,
	572	.next = neigh_seq_next,
	573	.stop = neigh_seq_stop,
	574	.show = dn_neigh_seq_show,
	575	};
	576
	577	static int dn_neigh_seq_open(struct inode inode, struct file file)
	578	{
426b5303 EB	579	return seq_open_net(inode, file, &dn_neigh_seq_ops,
426b5303 EB	580	sizeof(struct neigh_seq_state));
1da177e4 LT	581	}
1da177e4 LT	582
9a32144e	583	static const struct file_operations dn_neigh_seq_fops = {
1da177e4 LT	584	.owner = THIS_MODULE,
	585	.open = dn_neigh_seq_open,
	586	.read = seq_read,
	587	.llseek = seq_lseek,
426b5303	588	.release = seq_release_net,
1da177e4 LT	589	};
	590
	591	#endif
	592
	593	void __init dn_neigh_init(void)
	594	{
d7480fd3	595	neigh_table_init(NEIGH_DN_TABLE, &dn_neigh_table);
d4beaa66 G	596	proc_create("decnet_neigh", S_IRUGO, init_net.proc_net,
d4beaa66 G	597	&dn_neigh_seq_fops);
1da177e4 LT	598	}
	599
	600	void __exit dn_neigh_cleanup(void)
	601	{
ece31ffd	602	remove_proc_entry("decnet_neigh", init_net.proc_net);
d7480fd3	603	neigh_table_clear(NEIGH_DN_TABLE, &dn_neigh_table);
1da177e4	604	}