blob: be1f08cdad29135238c59c52f7c6bbc6548d39d2 [file] [log] [blame]
Linus Torvalds1da177e2005-04-16 15:20:36 -07001/*
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 *
YOSHIFUJI Hideaki429eb0f2007-02-09 23:24:40 +09006 * DECnet Neighbour Functions (Adjacency Database and
Linus Torvalds1da177e2005-04-16 15:20:36 -07007 * 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
Linus Torvalds1da177e2005-04-16 15:20:36 -070027#include <linux/net.h>
28#include <linux/module.h>
29#include <linux/socket.h>
30#include <linux/if_arp.h>
Tejun Heo5a0e3ad2010-03-24 17:04:11 +090031#include <linux/slab.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070032#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>
Arun Sharma600634972011-07-26 16:09:06 -070041#include <linux/atomic.h>
Eric W. Biederman457c4cb2007-09-12 12:01:34 +020042#include <net/net_namespace.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070043#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
Linus Torvalds1da177e2005-04-16 15:20:36 -070051static int dn_neigh_construct(struct neighbour *);
Eric W. Biedermanaaa4e702015-03-04 10:16:43 -060052static void dn_neigh_error_report(struct neighbour *, struct sk_buff *);
53static int dn_neigh_output(struct neighbour *neigh, struct sk_buff *skb);
Linus Torvalds1da177e2005-04-16 15:20:36 -070054
55/*
Eric W. Biedermanaaa4e702015-03-04 10:16:43 -060056 * Operations for adding the link layer header.
Linus Torvalds1da177e2005-04-16 15:20:36 -070057 */
Eric W. Biedermanaaa4e702015-03-04 10:16:43 -060058static const struct neigh_ops dn_neigh_ops = {
Linus Torvalds1da177e2005-04-16 15:20:36 -070059 .family = AF_DECnet,
Eric W. Biedermanaaa4e702015-03-04 10:16:43 -060060 .error_report = dn_neigh_error_report,
61 .output = dn_neigh_output,
62 .connected_output = dn_neigh_output,
Linus Torvalds1da177e2005-04-16 15:20:36 -070063};
64
Eric Dumazetd6bf7812010-10-04 06:15:44 +000065static u32 dn_neigh_hash(const void *pkey,
66 const struct net_device *dev,
David S. Miller2c2aba62011-12-28 15:06:58 -050067 __u32 *hash_rnd)
Eric Dumazetd6bf7812010-10-04 06:15:44 +000068{
David S. Miller2c2aba62011-12-28 15:06:58 -050069 return jhash_2words(*(__u16 *)pkey, 0, hash_rnd[0]);
Eric Dumazetd6bf7812010-10-04 06:15:44 +000070}
71
Eric W. Biederman60395a22015-03-03 17:10:44 -060072static bool dn_key_eq(const struct neighbour *neigh, const void *pkey)
73{
74 return neigh_key_eq16(neigh, pkey);
75}
76
Linus Torvalds1da177e2005-04-16 15:20:36 -070077struct neigh_table dn_neigh_table = {
78 .family = PF_DECnet,
YOSHIFUJI Hideaki / 吉藤英明daaba4f2013-02-09 07:00:59 +000079 .entry_size = NEIGH_ENTRY_SIZE(sizeof(struct dn_neigh)),
Steven Whitehousec4ea94a2006-03-20 22:42:39 -080080 .key_len = sizeof(__le16),
Eric W. Biedermanbdf53c52015-03-02 00:13:22 -060081 .protocol = cpu_to_be16(ETH_P_DNA_RT),
Linus Torvalds1da177e2005-04-16 15:20:36 -070082 .hash = dn_neigh_hash,
Eric W. Biederman60395a22015-03-03 17:10:44 -060083 .key_eq = dn_key_eq,
Linus Torvalds1da177e2005-04-16 15:20:36 -070084 .constructor = dn_neigh_construct,
85 .id = "dn_neigh_cache",
86 .parms ={
87 .tbl = &dn_neigh_table,
Jiri Pirko1f9248e52013-12-07 19:26:53 +010088 .reachable_time = 30 * HZ,
89 .data = {
90 [NEIGH_VAR_MCAST_PROBES] = 0,
91 [NEIGH_VAR_UCAST_PROBES] = 0,
92 [NEIGH_VAR_APP_PROBES] = 0,
93 [NEIGH_VAR_RETRANS_TIME] = 1 * HZ,
94 [NEIGH_VAR_BASE_REACHABLE_TIME] = 30 * HZ,
95 [NEIGH_VAR_DELAY_PROBE_TIME] = 5 * HZ,
96 [NEIGH_VAR_GC_STALETIME] = 60 * HZ,
97 [NEIGH_VAR_QUEUE_LEN_BYTES] = 64*1024,
98 [NEIGH_VAR_PROXY_QLEN] = 0,
99 [NEIGH_VAR_ANYCAST_DELAY] = 0,
100 [NEIGH_VAR_PROXY_DELAY] = 0,
101 [NEIGH_VAR_LOCKTIME] = 1 * HZ,
102 },
Linus Torvalds1da177e2005-04-16 15:20:36 -0700103 },
104 .gc_interval = 30 * HZ,
105 .gc_thresh1 = 128,
106 .gc_thresh2 = 512,
107 .gc_thresh3 = 1024,
108};
109
Linus Torvalds1da177e2005-04-16 15:20:36 -0700110static int dn_neigh_construct(struct neighbour *neigh)
111{
112 struct net_device *dev = neigh->dev;
113 struct dn_neigh *dn = (struct dn_neigh *)neigh;
114 struct dn_dev *dn_db;
115 struct neigh_parms *parms;
116
117 rcu_read_lock();
118 dn_db = rcu_dereference(dev->dn_ptr);
119 if (dn_db == NULL) {
120 rcu_read_unlock();
121 return -EINVAL;
122 }
123
124 parms = dn_db->neigh_parms;
125 if (!parms) {
126 rcu_read_unlock();
127 return -EINVAL;
128 }
129
130 __neigh_parms_put(neigh->parms);
131 neigh->parms = neigh_parms_clone(parms);
Paul E. McKenney1f072472005-08-17 12:05:27 -0700132 rcu_read_unlock();
Linus Torvalds1da177e2005-04-16 15:20:36 -0700133
Eric W. Biedermanaaa4e702015-03-04 10:16:43 -0600134 neigh->ops = &dn_neigh_ops;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700135 neigh->nud_state = NUD_NOARP;
136 neigh->output = neigh->ops->connected_output;
137
138 if ((dev->type == ARPHRD_IPGRE) || (dev->flags & IFF_POINTOPOINT))
139 memcpy(neigh->ha, dev->broadcast, dev->addr_len);
140 else if ((dev->type == ARPHRD_ETHER) || (dev->type == ARPHRD_LOOPBACK))
141 dn_dn2eth(neigh->ha, dn->addr);
142 else {
Joe Perchese87cc472012-05-13 21:56:26 +0000143 net_dbg_ratelimited("Trying to create neigh for hw %d\n",
144 dev->type);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700145 return -EINVAL;
146 }
147
148 /*
149 * Make an estimate of the remote block size by assuming that its
150 * two less then the device mtu, which it true for ethernet (and
151 * other things which support long format headers) since there is
152 * an extra length field (of 16 bits) which isn't part of the
153 * ethernet headers and which the DECnet specs won't admit is part
154 * of the DECnet routing headers either.
155 *
156 * If we over estimate here its no big deal, the NSP negotiations
157 * will prevent us from sending packets which are too large for the
158 * remote node to handle. In any case this figure is normally updated
159 * by a hello message in most cases.
160 */
161 dn->blksize = dev->mtu - 2;
162
163 return 0;
164}
165
Eric W. Biedermanaaa4e702015-03-04 10:16:43 -0600166static void dn_neigh_error_report(struct neighbour *neigh, struct sk_buff *skb)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700167{
Eric W. Biedermanaaa4e702015-03-04 10:16:43 -0600168 printk(KERN_DEBUG "dn_neigh_error_report: called\n");
Linus Torvalds1da177e2005-04-16 15:20:36 -0700169 kfree_skb(skb);
170}
171
Eric W. Biedermanaaa4e702015-03-04 10:16:43 -0600172static int dn_neigh_output(struct neighbour *neigh, struct sk_buff *skb)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700173{
Eric Dumazetadf30902009-06-02 05:19:30 +0000174 struct dst_entry *dst = skb_dst(skb);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700175 struct dn_route *rt = (struct dn_route *)dst;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700176 struct net_device *dev = neigh->dev;
177 char mac_addr[ETH_ALEN];
David S. Miller3329bdf2012-02-01 16:34:25 -0500178 unsigned int seq;
179 int err;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700180
181 dn_dn2eth(mac_addr, rt->rt_local_src);
David S. Miller3329bdf2012-02-01 16:34:25 -0500182 do {
183 seq = read_seqbegin(&neigh->ha_lock);
184 err = dev_hard_header(skb, dev, ntohs(skb->protocol),
185 neigh->ha, mac_addr, skb->len);
186 } while (read_seqretry(&neigh->ha_lock, seq));
Linus Torvalds1da177e2005-04-16 15:20:36 -0700187
David S. Miller3329bdf2012-02-01 16:34:25 -0500188 if (err >= 0)
189 err = dev_queue_xmit(skb);
190 else {
191 kfree_skb(skb);
192 err = -EINVAL;
193 }
194 return err;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700195}
196
Eric W. Biedermanaaa4e702015-03-04 10:16:43 -0600197static int dn_neigh_output_packet(struct sk_buff *skb)
198{
199 struct dst_entry *dst = skb_dst(skb);
200 struct dn_route *rt = (struct dn_route *)dst;
201 struct neighbour *neigh = rt->n;
202
203 return neigh->output(neigh, skb);
204}
205
206/*
207 * For talking to broadcast devices: Ethernet & PPP
208 */
David S. Miller8f40b162011-07-17 13:34:11 -0700209static int dn_long_output(struct neighbour *neigh, struct sk_buff *skb)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700210{
Linus Torvalds1da177e2005-04-16 15:20:36 -0700211 struct net_device *dev = neigh->dev;
212 int headroom = dev->hard_header_len + sizeof(struct dn_long_packet) + 3;
213 unsigned char *data;
214 struct dn_long_packet *lp;
215 struct dn_skb_cb *cb = DN_SKB_CB(skb);
216
217
218 if (skb_headroom(skb) < headroom) {
219 struct sk_buff *skb2 = skb_realloc_headroom(skb, headroom);
220 if (skb2 == NULL) {
Joe Perchese87cc472012-05-13 21:56:26 +0000221 net_crit_ratelimited("dn_long_output: no memory\n");
Linus Torvalds1da177e2005-04-16 15:20:36 -0700222 kfree_skb(skb);
223 return -ENOBUFS;
224 }
Eric Dumazet5d0ba552012-06-04 01:17:19 +0000225 consume_skb(skb);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700226 skb = skb2;
Joe Perchese87cc472012-05-13 21:56:26 +0000227 net_info_ratelimited("dn_long_output: Increasing headroom\n");
Linus Torvalds1da177e2005-04-16 15:20:36 -0700228 }
229
230 data = skb_push(skb, sizeof(struct dn_long_packet) + 3);
231 lp = (struct dn_long_packet *)(data+3);
232
Harvey Harrisonc4106aa2008-11-27 00:12:47 -0800233 *((__le16 *)data) = cpu_to_le16(skb->len - 2);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700234 *(data + 2) = 1 | DN_RT_F_PF; /* Padding */
235
236 lp->msgflg = DN_RT_PKT_LONG|(cb->rt_flags&(DN_RT_F_IE|DN_RT_F_RQR|DN_RT_F_RTS));
237 lp->d_area = lp->d_subarea = 0;
Steven Whitehousec4ea94a2006-03-20 22:42:39 -0800238 dn_dn2eth(lp->d_id, cb->dst);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700239 lp->s_area = lp->s_subarea = 0;
Steven Whitehousec4ea94a2006-03-20 22:42:39 -0800240 dn_dn2eth(lp->s_id, cb->src);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700241 lp->nl2 = 0;
242 lp->visit_ct = cb->hops & 0x3f;
243 lp->s_class = 0;
244 lp->pt = 0;
245
Arnaldo Carvalho de Meloc1d2bbe2007-04-10 20:45:18 -0700246 skb_reset_network_header(skb);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700247
Jan Engelhardt5d877d82010-03-23 04:09:14 +0100248 return NF_HOOK(NFPROTO_DECNET, NF_DN_POST_ROUTING, skb, NULL,
249 neigh->dev, dn_neigh_output_packet);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700250}
251
Eric W. Biedermanaaa4e702015-03-04 10:16:43 -0600252/*
253 * For talking to pointopoint and multidrop devices: DDCMP and X.25
254 */
David S. Miller8f40b162011-07-17 13:34:11 -0700255static int dn_short_output(struct neighbour *neigh, struct sk_buff *skb)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700256{
Linus Torvalds1da177e2005-04-16 15:20:36 -0700257 struct net_device *dev = neigh->dev;
258 int headroom = dev->hard_header_len + sizeof(struct dn_short_packet) + 2;
259 struct dn_short_packet *sp;
260 unsigned char *data;
261 struct dn_skb_cb *cb = DN_SKB_CB(skb);
262
263
YOSHIFUJI Hideaki429eb0f2007-02-09 23:24:40 +0900264 if (skb_headroom(skb) < headroom) {
265 struct sk_buff *skb2 = skb_realloc_headroom(skb, headroom);
266 if (skb2 == NULL) {
Joe Perchese87cc472012-05-13 21:56:26 +0000267 net_crit_ratelimited("dn_short_output: no memory\n");
YOSHIFUJI Hideaki429eb0f2007-02-09 23:24:40 +0900268 kfree_skb(skb);
269 return -ENOBUFS;
270 }
Eric Dumazet5d0ba552012-06-04 01:17:19 +0000271 consume_skb(skb);
YOSHIFUJI Hideaki429eb0f2007-02-09 23:24:40 +0900272 skb = skb2;
Joe Perchese87cc472012-05-13 21:56:26 +0000273 net_info_ratelimited("dn_short_output: Increasing headroom\n");
YOSHIFUJI Hideaki429eb0f2007-02-09 23:24:40 +0900274 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700275
276 data = skb_push(skb, sizeof(struct dn_short_packet) + 2);
Harvey Harrisonc4106aa2008-11-27 00:12:47 -0800277 *((__le16 *)data) = cpu_to_le16(skb->len - 2);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700278 sp = (struct dn_short_packet *)(data+2);
279
280 sp->msgflg = DN_RT_PKT_SHORT|(cb->rt_flags&(DN_RT_F_RQR|DN_RT_F_RTS));
281 sp->dstnode = cb->dst;
282 sp->srcnode = cb->src;
283 sp->forward = cb->hops & 0x3f;
284
Arnaldo Carvalho de Meloc1d2bbe2007-04-10 20:45:18 -0700285 skb_reset_network_header(skb);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700286
Jan Engelhardt5d877d82010-03-23 04:09:14 +0100287 return NF_HOOK(NFPROTO_DECNET, NF_DN_POST_ROUTING, skb, NULL,
288 neigh->dev, dn_neigh_output_packet);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700289}
290
291/*
Eric W. Biedermanaaa4e702015-03-04 10:16:43 -0600292 * For talking to DECnet phase III nodes
293 * Phase 3 output is the same as short output, execpt that
Linus Torvalds1da177e2005-04-16 15:20:36 -0700294 * it clears the area bits before transmission.
295 */
David S. Miller8f40b162011-07-17 13:34:11 -0700296static int dn_phase3_output(struct neighbour *neigh, struct sk_buff *skb)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700297{
Linus Torvalds1da177e2005-04-16 15:20:36 -0700298 struct net_device *dev = neigh->dev;
299 int headroom = dev->hard_header_len + sizeof(struct dn_short_packet) + 2;
300 struct dn_short_packet *sp;
301 unsigned char *data;
302 struct dn_skb_cb *cb = DN_SKB_CB(skb);
303
304 if (skb_headroom(skb) < headroom) {
305 struct sk_buff *skb2 = skb_realloc_headroom(skb, headroom);
306 if (skb2 == NULL) {
Joe Perchese87cc472012-05-13 21:56:26 +0000307 net_crit_ratelimited("dn_phase3_output: no memory\n");
Linus Torvalds1da177e2005-04-16 15:20:36 -0700308 kfree_skb(skb);
309 return -ENOBUFS;
310 }
Eric Dumazet5d0ba552012-06-04 01:17:19 +0000311 consume_skb(skb);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700312 skb = skb2;
Joe Perchese87cc472012-05-13 21:56:26 +0000313 net_info_ratelimited("dn_phase3_output: Increasing headroom\n");
Linus Torvalds1da177e2005-04-16 15:20:36 -0700314 }
315
316 data = skb_push(skb, sizeof(struct dn_short_packet) + 2);
Harvey Harrisonc4106aa2008-11-27 00:12:47 -0800317 *((__le16 *)data) = cpu_to_le16(skb->len - 2);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700318 sp = (struct dn_short_packet *)(data + 2);
319
320 sp->msgflg = DN_RT_PKT_SHORT|(cb->rt_flags&(DN_RT_F_RQR|DN_RT_F_RTS));
Harvey Harrisonc4106aa2008-11-27 00:12:47 -0800321 sp->dstnode = cb->dst & cpu_to_le16(0x03ff);
322 sp->srcnode = cb->src & cpu_to_le16(0x03ff);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700323 sp->forward = cb->hops & 0x3f;
324
Arnaldo Carvalho de Meloc1d2bbe2007-04-10 20:45:18 -0700325 skb_reset_network_header(skb);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700326
Jan Engelhardt5d877d82010-03-23 04:09:14 +0100327 return NF_HOOK(NFPROTO_DECNET, NF_DN_POST_ROUTING, skb, NULL,
328 neigh->dev, dn_neigh_output_packet);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700329}
330
Eric W. Biedermanaaa4e702015-03-04 10:16:43 -0600331int dn_to_neigh_output(struct sk_buff *skb)
332{
333 struct dst_entry *dst = skb_dst(skb);
334 struct dn_route *rt = (struct dn_route *) dst;
335 struct neighbour *neigh = rt->n;
336 struct dn_neigh *dn = (struct dn_neigh *)neigh;
337 struct dn_dev *dn_db;
338 bool use_long;
339
340 rcu_read_lock();
341 dn_db = rcu_dereference(neigh->dev->dn_ptr);
342 if (dn_db == NULL) {
343 rcu_read_unlock();
344 return -EINVAL;
345 }
346 use_long = dn_db->use_long;
347 rcu_read_unlock();
348
349 if (dn->flags & DN_NDFLAG_P3)
350 return dn_phase3_output(neigh, skb);
351 if (use_long)
352 return dn_long_output(neigh, skb);
353 else
354 return dn_short_output(neigh, skb);
355}
356
Linus Torvalds1da177e2005-04-16 15:20:36 -0700357/*
358 * Unfortunately, the neighbour code uses the device in its hash
359 * function, so we don't get any advantage from it. This function
360 * basically does a neigh_lookup(), but without comparing the device
361 * field. This is required for the On-Ethernet cache
362 */
363
364/*
365 * Pointopoint link receives a hello message
366 */
367void dn_neigh_pointopoint_hello(struct sk_buff *skb)
368{
369 kfree_skb(skb);
370}
371
372/*
373 * Ethernet router hello message received
374 */
375int dn_neigh_router_hello(struct sk_buff *skb)
376{
377 struct rtnode_hello_message *msg = (struct rtnode_hello_message *)skb->data;
378
379 struct neighbour *neigh;
380 struct dn_neigh *dn;
381 struct dn_dev *dn_db;
Steven Whitehousec4ea94a2006-03-20 22:42:39 -0800382 __le16 src;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700383
Steven Whitehousec4ea94a2006-03-20 22:42:39 -0800384 src = dn_eth2dn(msg->id);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700385
386 neigh = __neigh_lookup(&dn_neigh_table, &src, skb->dev, 1);
387
388 dn = (struct dn_neigh *)neigh;
389
390 if (neigh) {
391 write_lock(&neigh->lock);
392
393 neigh->used = jiffies;
Eric Dumazetfc766e4c2010-10-29 03:09:24 +0000394 dn_db = rcu_dereference(neigh->dev->dn_ptr);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700395
396 if (!(neigh->nud_state & NUD_PERMANENT)) {
397 neigh->updated = jiffies;
398
399 if (neigh->dev->type == ARPHRD_ETHER)
400 memcpy(neigh->ha, &eth_hdr(skb)->h_source, ETH_ALEN);
401
Harvey Harrisonc4106aa2008-11-27 00:12:47 -0800402 dn->blksize = le16_to_cpu(msg->blksize);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700403 dn->priority = msg->priority;
404
405 dn->flags &= ~DN_NDFLAG_P3;
406
Joe Perches06f8fe12011-07-01 09:43:03 +0000407 switch (msg->iinfo & DN_RT_INFO_TYPE) {
408 case DN_RT_INFO_L1RT:
409 dn->flags &=~DN_NDFLAG_R2;
410 dn->flags |= DN_NDFLAG_R1;
411 break;
412 case DN_RT_INFO_L2RT:
413 dn->flags |= DN_NDFLAG_R2;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700414 }
415 }
416
Patrick Caulfield50624302006-01-03 14:24:02 -0800417 /* Only use routers in our area */
Harvey Harrisonc4106aa2008-11-27 00:12:47 -0800418 if ((le16_to_cpu(src)>>10) == (le16_to_cpu((decnet_address))>>10)) {
Patrick Caulfield50624302006-01-03 14:24:02 -0800419 if (!dn_db->router) {
420 dn_db->router = neigh_clone(neigh);
421 } else {
422 if (msg->priority > ((struct dn_neigh *)dn_db->router)->priority)
423 neigh_release(xchg(&dn_db->router, neigh_clone(neigh)));
424 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700425 }
426 write_unlock(&neigh->lock);
427 neigh_release(neigh);
428 }
429
430 kfree_skb(skb);
431 return 0;
432}
433
434/*
435 * Endnode hello message received
436 */
437int dn_neigh_endnode_hello(struct sk_buff *skb)
438{
439 struct endnode_hello_message *msg = (struct endnode_hello_message *)skb->data;
440 struct neighbour *neigh;
441 struct dn_neigh *dn;
Steven Whitehousec4ea94a2006-03-20 22:42:39 -0800442 __le16 src;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700443
Steven Whitehousec4ea94a2006-03-20 22:42:39 -0800444 src = dn_eth2dn(msg->id);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700445
446 neigh = __neigh_lookup(&dn_neigh_table, &src, skb->dev, 1);
447
448 dn = (struct dn_neigh *)neigh;
449
450 if (neigh) {
451 write_lock(&neigh->lock);
452
453 neigh->used = jiffies;
454
455 if (!(neigh->nud_state & NUD_PERMANENT)) {
456 neigh->updated = jiffies;
457
458 if (neigh->dev->type == ARPHRD_ETHER)
459 memcpy(neigh->ha, &eth_hdr(skb)->h_source, ETH_ALEN);
460 dn->flags &= ~(DN_NDFLAG_R1 | DN_NDFLAG_R2);
Harvey Harrisonc4106aa2008-11-27 00:12:47 -0800461 dn->blksize = le16_to_cpu(msg->blksize);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700462 dn->priority = 0;
463 }
464
465 write_unlock(&neigh->lock);
466 neigh_release(neigh);
467 }
468
469 kfree_skb(skb);
470 return 0;
471}
472
473static char *dn_find_slot(char *base, int max, int priority)
474{
475 int i;
476 unsigned char *min = NULL;
477
478 base += 6; /* skip first id */
479
480 for(i = 0; i < max; i++) {
481 if (!min || (*base < *min))
482 min = base;
483 base += 7; /* find next priority */
484 }
485
486 if (!min)
487 return NULL;
488
489 return (*min < priority) ? (min - 6) : NULL;
490}
491
492struct elist_cb_state {
493 struct net_device *dev;
494 unsigned char *ptr;
495 unsigned char *rs;
496 int t, n;
497};
498
499static void neigh_elist_cb(struct neighbour *neigh, void *_info)
500{
501 struct elist_cb_state *s = _info;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700502 struct dn_neigh *dn;
503
504 if (neigh->dev != s->dev)
505 return;
506
507 dn = (struct dn_neigh *) neigh;
508 if (!(dn->flags & (DN_NDFLAG_R1|DN_NDFLAG_R2)))
509 return;
510
Linus Torvalds1da177e2005-04-16 15:20:36 -0700511 if (s->t == s->n)
512 s->rs = dn_find_slot(s->ptr, s->n, dn->priority);
513 else
514 s->t++;
515 if (s->rs == NULL)
516 return;
517
518 dn_dn2eth(s->rs, dn->addr);
519 s->rs += 6;
520 *(s->rs) = neigh->nud_state & NUD_CONNECTED ? 0x80 : 0x0;
521 *(s->rs) |= dn->priority;
522 s->rs++;
523}
524
525int dn_neigh_elist(struct net_device *dev, unsigned char *ptr, int n)
526{
527 struct elist_cb_state state;
528
529 state.dev = dev;
530 state.t = 0;
531 state.n = n;
532 state.ptr = ptr;
533 state.rs = ptr;
534
535 neigh_for_each(&dn_neigh_table, neigh_elist_cb, &state);
536
537 return state.t;
538}
539
540
541#ifdef CONFIG_PROC_FS
542
543static inline void dn_neigh_format_entry(struct seq_file *seq,
544 struct neighbour *n)
545{
546 struct dn_neigh *dn = (struct dn_neigh *) n;
547 char buf[DN_ASCBUF_LEN];
548
549 read_lock(&n->lock);
550 seq_printf(seq, "%-7s %s%s%s %02x %02d %07ld %-8s\n",
Harvey Harrisonc4106aa2008-11-27 00:12:47 -0800551 dn_addr2asc(le16_to_cpu(dn->addr), buf),
Linus Torvalds1da177e2005-04-16 15:20:36 -0700552 (dn->flags&DN_NDFLAG_R1) ? "1" : "-",
553 (dn->flags&DN_NDFLAG_R2) ? "2" : "-",
554 (dn->flags&DN_NDFLAG_P3) ? "3" : "-",
555 dn->n.nud_state,
556 atomic_read(&dn->n.refcnt),
557 dn->blksize,
558 (dn->n.dev) ? dn->n.dev->name : "?");
559 read_unlock(&n->lock);
560}
561
562static int dn_neigh_seq_show(struct seq_file *seq, void *v)
563{
564 if (v == SEQ_START_TOKEN) {
565 seq_puts(seq, "Addr Flags State Use Blksize Dev\n");
566 } else {
567 dn_neigh_format_entry(seq, v);
568 }
569
570 return 0;
571}
572
573static void *dn_neigh_seq_start(struct seq_file *seq, loff_t *pos)
574{
575 return neigh_seq_start(seq, pos, &dn_neigh_table,
576 NEIGH_SEQ_NEIGH_ONLY);
577}
578
Philippe De Muyter56b3d972007-07-10 23:07:31 -0700579static const struct seq_operations dn_neigh_seq_ops = {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700580 .start = dn_neigh_seq_start,
581 .next = neigh_seq_next,
582 .stop = neigh_seq_stop,
583 .show = dn_neigh_seq_show,
584};
585
586static int dn_neigh_seq_open(struct inode *inode, struct file *file)
587{
Eric W. Biederman426b5302008-01-24 00:13:18 -0800588 return seq_open_net(inode, file, &dn_neigh_seq_ops,
589 sizeof(struct neigh_seq_state));
Linus Torvalds1da177e2005-04-16 15:20:36 -0700590}
591
Arjan van de Ven9a321442007-02-12 00:55:35 -0800592static const struct file_operations dn_neigh_seq_fops = {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700593 .owner = THIS_MODULE,
594 .open = dn_neigh_seq_open,
595 .read = seq_read,
596 .llseek = seq_lseek,
Eric W. Biederman426b5302008-01-24 00:13:18 -0800597 .release = seq_release_net,
Linus Torvalds1da177e2005-04-16 15:20:36 -0700598};
599
600#endif
601
602void __init dn_neigh_init(void)
603{
WANG Congd7480fd2014-11-10 15:59:36 -0800604 neigh_table_init(NEIGH_DN_TABLE, &dn_neigh_table);
Gao fengd4beaa62013-02-18 01:34:54 +0000605 proc_create("decnet_neigh", S_IRUGO, init_net.proc_net,
606 &dn_neigh_seq_fops);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700607}
608
609void __exit dn_neigh_cleanup(void)
610{
Gao fengece31ff2013-02-18 01:34:56 +0000611 remove_proc_entry("decnet_neigh", init_net.proc_net);
WANG Congd7480fd2014-11-10 15:59:36 -0800612 neigh_table_clear(NEIGH_DN_TABLE, &dn_neigh_table);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700613}