blob: abf4de851c63732465966d775ba7e578f34b0df2 [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>
41#include <asm/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 *);
52static void dn_long_error_report(struct neighbour *, struct sk_buff *);
53static void dn_short_error_report(struct neighbour *, struct sk_buff *);
54static int dn_long_output(struct sk_buff *);
55static int dn_short_output(struct sk_buff *);
56static int dn_phase3_output(struct sk_buff *);
57
58
59/*
60 * For talking to broadcast devices: Ethernet & PPP
61 */
Stephen Hemminger89d69d22009-09-01 11:13:19 +000062static const struct neigh_ops dn_long_ops = {
Linus Torvalds1da177e2005-04-16 15:20:36 -070063 .family = AF_DECnet,
64 .error_report = dn_long_error_report,
65 .output = dn_long_output,
66 .connected_output = dn_long_output,
Linus Torvalds1da177e2005-04-16 15:20:36 -070067 .queue_xmit = dev_queue_xmit,
68};
69
70/*
71 * For talking to pointopoint and multidrop devices: DDCMP and X.25
72 */
Stephen Hemminger89d69d22009-09-01 11:13:19 +000073static const struct neigh_ops dn_short_ops = {
Linus Torvalds1da177e2005-04-16 15:20:36 -070074 .family = AF_DECnet,
75 .error_report = dn_short_error_report,
76 .output = dn_short_output,
77 .connected_output = dn_short_output,
Linus Torvalds1da177e2005-04-16 15:20:36 -070078 .queue_xmit = dev_queue_xmit,
79};
80
81/*
82 * For talking to DECnet phase III nodes
83 */
Stephen Hemminger89d69d22009-09-01 11:13:19 +000084static const struct neigh_ops dn_phase3_ops = {
Linus Torvalds1da177e2005-04-16 15:20:36 -070085 .family = AF_DECnet,
86 .error_report = dn_short_error_report, /* Can use short version here */
87 .output = dn_phase3_output,
88 .connected_output = dn_phase3_output,
Linus Torvalds1da177e2005-04-16 15:20:36 -070089 .queue_xmit = dev_queue_xmit
90};
91
Eric Dumazetd6bf7812010-10-04 06:15:44 +000092static u32 dn_neigh_hash(const void *pkey,
93 const struct net_device *dev,
94 __u32 hash_rnd)
95{
96 return jhash_2words(*(__u16 *)pkey, 0, hash_rnd);
97}
98
Linus Torvalds1da177e2005-04-16 15:20:36 -070099struct neigh_table dn_neigh_table = {
100 .family = PF_DECnet,
101 .entry_size = sizeof(struct dn_neigh),
Steven Whitehousec4ea94a2006-03-20 22:42:39 -0800102 .key_len = sizeof(__le16),
Linus Torvalds1da177e2005-04-16 15:20:36 -0700103 .hash = dn_neigh_hash,
104 .constructor = dn_neigh_construct,
105 .id = "dn_neigh_cache",
106 .parms ={
107 .tbl = &dn_neigh_table,
Linus Torvalds1da177e2005-04-16 15:20:36 -0700108 .base_reachable_time = 30 * HZ,
109 .retrans_time = 1 * HZ,
110 .gc_staletime = 60 * HZ,
111 .reachable_time = 30 * HZ,
112 .delay_probe_time = 5 * HZ,
113 .queue_len = 3,
114 .ucast_probes = 0,
115 .app_probes = 0,
116 .mcast_probes = 0,
117 .anycast_delay = 0,
118 .proxy_delay = 0,
119 .proxy_qlen = 0,
120 .locktime = 1 * HZ,
121 },
122 .gc_interval = 30 * HZ,
123 .gc_thresh1 = 128,
124 .gc_thresh2 = 512,
125 .gc_thresh3 = 1024,
126};
127
Linus Torvalds1da177e2005-04-16 15:20:36 -0700128static 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);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700150
151 if (dn_db->use_long)
152 neigh->ops = &dn_long_ops;
153 else
154 neigh->ops = &dn_short_ops;
Paul E. McKenney1f072472005-08-17 12:05:27 -0700155 rcu_read_unlock();
Linus Torvalds1da177e2005-04-16 15:20:36 -0700156
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 {
168 if (net_ratelimit())
169 printk(KERN_DEBUG "Trying to create neigh for hw %d\n", dev->type);
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
191static 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
198static 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
204static int dn_neigh_output_packet(struct sk_buff *skb)
205{
Eric Dumazetadf30902009-06-02 05:19:30 +0000206 struct dst_entry *dst = skb_dst(skb);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700207 struct dn_route *rt = (struct dn_route *)dst;
208 struct neighbour *neigh = dst->neighbour;
209 struct net_device *dev = neigh->dev;
210 char mac_addr[ETH_ALEN];
211
212 dn_dn2eth(mac_addr, rt->rt_local_src);
Stephen Hemminger0c4e8582007-10-09 01:36:32 -0700213 if (dev_hard_header(skb, dev, ntohs(skb->protocol), neigh->ha,
214 mac_addr, skb->len) >= 0)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700215 return neigh->ops->queue_xmit(skb);
216
217 if (net_ratelimit())
218 printk(KERN_DEBUG "dn_neigh_output_packet: oops, can't send packet\n");
219
220 kfree_skb(skb);
221 return -EINVAL;
222}
223
224static int dn_long_output(struct sk_buff *skb)
225{
Eric Dumazetadf30902009-06-02 05:19:30 +0000226 struct dst_entry *dst = skb_dst(skb);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700227 struct neighbour *neigh = dst->neighbour;
228 struct net_device *dev = neigh->dev;
229 int headroom = dev->hard_header_len + sizeof(struct dn_long_packet) + 3;
230 unsigned char *data;
231 struct dn_long_packet *lp;
232 struct dn_skb_cb *cb = DN_SKB_CB(skb);
233
234
235 if (skb_headroom(skb) < headroom) {
236 struct sk_buff *skb2 = skb_realloc_headroom(skb, headroom);
237 if (skb2 == NULL) {
238 if (net_ratelimit())
239 printk(KERN_CRIT "dn_long_output: no memory\n");
240 kfree_skb(skb);
241 return -ENOBUFS;
242 }
243 kfree_skb(skb);
244 skb = skb2;
245 if (net_ratelimit())
246 printk(KERN_INFO "dn_long_output: Increasing headroom\n");
247 }
248
249 data = skb_push(skb, sizeof(struct dn_long_packet) + 3);
250 lp = (struct dn_long_packet *)(data+3);
251
Harvey Harrisonc4106aa2008-11-27 00:12:47 -0800252 *((__le16 *)data) = cpu_to_le16(skb->len - 2);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700253 *(data + 2) = 1 | DN_RT_F_PF; /* Padding */
254
255 lp->msgflg = DN_RT_PKT_LONG|(cb->rt_flags&(DN_RT_F_IE|DN_RT_F_RQR|DN_RT_F_RTS));
256 lp->d_area = lp->d_subarea = 0;
Steven Whitehousec4ea94a2006-03-20 22:42:39 -0800257 dn_dn2eth(lp->d_id, cb->dst);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700258 lp->s_area = lp->s_subarea = 0;
Steven Whitehousec4ea94a2006-03-20 22:42:39 -0800259 dn_dn2eth(lp->s_id, cb->src);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700260 lp->nl2 = 0;
261 lp->visit_ct = cb->hops & 0x3f;
262 lp->s_class = 0;
263 lp->pt = 0;
264
Arnaldo Carvalho de Meloc1d2bbe2007-04-10 20:45:18 -0700265 skb_reset_network_header(skb);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700266
Jan Engelhardt5d877d82010-03-23 04:09:14 +0100267 return NF_HOOK(NFPROTO_DECNET, NF_DN_POST_ROUTING, skb, NULL,
268 neigh->dev, dn_neigh_output_packet);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700269}
270
271static int dn_short_output(struct sk_buff *skb)
272{
Eric Dumazetadf30902009-06-02 05:19:30 +0000273 struct dst_entry *dst = skb_dst(skb);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700274 struct neighbour *neigh = dst->neighbour;
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
YOSHIFUJI Hideaki429eb0f2007-02-09 23:24:40 +0900282 if (skb_headroom(skb) < headroom) {
283 struct sk_buff *skb2 = skb_realloc_headroom(skb, headroom);
284 if (skb2 == NULL) {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700285 if (net_ratelimit())
YOSHIFUJI Hideaki429eb0f2007-02-09 23:24:40 +0900286 printk(KERN_CRIT "dn_short_output: no memory\n");
287 kfree_skb(skb);
288 return -ENOBUFS;
289 }
290 kfree_skb(skb);
291 skb = skb2;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700292 if (net_ratelimit())
YOSHIFUJI Hideaki429eb0f2007-02-09 23:24:40 +0900293 printk(KERN_INFO "dn_short_output: Increasing headroom\n");
294 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700295
296 data = skb_push(skb, sizeof(struct dn_short_packet) + 2);
Harvey Harrisonc4106aa2008-11-27 00:12:47 -0800297 *((__le16 *)data) = cpu_to_le16(skb->len - 2);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700298 sp = (struct dn_short_packet *)(data+2);
299
300 sp->msgflg = DN_RT_PKT_SHORT|(cb->rt_flags&(DN_RT_F_RQR|DN_RT_F_RTS));
301 sp->dstnode = cb->dst;
302 sp->srcnode = cb->src;
303 sp->forward = cb->hops & 0x3f;
304
Arnaldo Carvalho de Meloc1d2bbe2007-04-10 20:45:18 -0700305 skb_reset_network_header(skb);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700306
Jan Engelhardt5d877d82010-03-23 04:09:14 +0100307 return NF_HOOK(NFPROTO_DECNET, NF_DN_POST_ROUTING, skb, NULL,
308 neigh->dev, dn_neigh_output_packet);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700309}
310
311/*
312 * Phase 3 output is the same is short output, execpt that
313 * it clears the area bits before transmission.
314 */
315static int dn_phase3_output(struct sk_buff *skb)
316{
Eric Dumazetadf30902009-06-02 05:19:30 +0000317 struct dst_entry *dst = skb_dst(skb);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700318 struct neighbour *neigh = dst->neighbour;
319 struct net_device *dev = neigh->dev;
320 int headroom = dev->hard_header_len + sizeof(struct dn_short_packet) + 2;
321 struct dn_short_packet *sp;
322 unsigned char *data;
323 struct dn_skb_cb *cb = DN_SKB_CB(skb);
324
325 if (skb_headroom(skb) < headroom) {
326 struct sk_buff *skb2 = skb_realloc_headroom(skb, headroom);
327 if (skb2 == NULL) {
328 if (net_ratelimit())
329 printk(KERN_CRIT "dn_phase3_output: no memory\n");
330 kfree_skb(skb);
331 return -ENOBUFS;
332 }
333 kfree_skb(skb);
334 skb = skb2;
335 if (net_ratelimit())
336 printk(KERN_INFO "dn_phase3_output: Increasing headroom\n");
337 }
338
339 data = skb_push(skb, sizeof(struct dn_short_packet) + 2);
Harvey Harrisonc4106aa2008-11-27 00:12:47 -0800340 *((__le16 *)data) = cpu_to_le16(skb->len - 2);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700341 sp = (struct dn_short_packet *)(data + 2);
342
343 sp->msgflg = DN_RT_PKT_SHORT|(cb->rt_flags&(DN_RT_F_RQR|DN_RT_F_RTS));
Harvey Harrisonc4106aa2008-11-27 00:12:47 -0800344 sp->dstnode = cb->dst & cpu_to_le16(0x03ff);
345 sp->srcnode = cb->src & cpu_to_le16(0x03ff);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700346 sp->forward = cb->hops & 0x3f;
347
Arnaldo Carvalho de Meloc1d2bbe2007-04-10 20:45:18 -0700348 skb_reset_network_header(skb);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700349
Jan Engelhardt5d877d82010-03-23 04:09:14 +0100350 return NF_HOOK(NFPROTO_DECNET, NF_DN_POST_ROUTING, skb, NULL,
351 neigh->dev, dn_neigh_output_packet);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700352}
353
354/*
355 * Unfortunately, the neighbour code uses the device in its hash
356 * function, so we don't get any advantage from it. This function
357 * basically does a neigh_lookup(), but without comparing the device
358 * field. This is required for the On-Ethernet cache
359 */
360
361/*
362 * Pointopoint link receives a hello message
363 */
364void dn_neigh_pointopoint_hello(struct sk_buff *skb)
365{
366 kfree_skb(skb);
367}
368
369/*
370 * Ethernet router hello message received
371 */
372int dn_neigh_router_hello(struct sk_buff *skb)
373{
374 struct rtnode_hello_message *msg = (struct rtnode_hello_message *)skb->data;
375
376 struct neighbour *neigh;
377 struct dn_neigh *dn;
378 struct dn_dev *dn_db;
Steven Whitehousec4ea94a2006-03-20 22:42:39 -0800379 __le16 src;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700380
Steven Whitehousec4ea94a2006-03-20 22:42:39 -0800381 src = dn_eth2dn(msg->id);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700382
383 neigh = __neigh_lookup(&dn_neigh_table, &src, skb->dev, 1);
384
385 dn = (struct dn_neigh *)neigh;
386
387 if (neigh) {
388 write_lock(&neigh->lock);
389
390 neigh->used = jiffies;
Eric Dumazetfc766e4c2010-10-29 03:09:24 +0000391 dn_db = rcu_dereference(neigh->dev->dn_ptr);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700392
393 if (!(neigh->nud_state & NUD_PERMANENT)) {
394 neigh->updated = jiffies;
395
396 if (neigh->dev->type == ARPHRD_ETHER)
397 memcpy(neigh->ha, &eth_hdr(skb)->h_source, ETH_ALEN);
398
Harvey Harrisonc4106aa2008-11-27 00:12:47 -0800399 dn->blksize = le16_to_cpu(msg->blksize);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700400 dn->priority = msg->priority;
401
402 dn->flags &= ~DN_NDFLAG_P3;
403
Joe Perches06f8fe12011-07-01 09:43:03 +0000404 switch (msg->iinfo & DN_RT_INFO_TYPE) {
405 case DN_RT_INFO_L1RT:
406 dn->flags &=~DN_NDFLAG_R2;
407 dn->flags |= DN_NDFLAG_R1;
408 break;
409 case DN_RT_INFO_L2RT:
410 dn->flags |= DN_NDFLAG_R2;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700411 }
412 }
413
Patrick Caulfield50624302006-01-03 14:24:02 -0800414 /* Only use routers in our area */
Harvey Harrisonc4106aa2008-11-27 00:12:47 -0800415 if ((le16_to_cpu(src)>>10) == (le16_to_cpu((decnet_address))>>10)) {
Patrick Caulfield50624302006-01-03 14:24:02 -0800416 if (!dn_db->router) {
417 dn_db->router = neigh_clone(neigh);
418 } else {
419 if (msg->priority > ((struct dn_neigh *)dn_db->router)->priority)
420 neigh_release(xchg(&dn_db->router, neigh_clone(neigh)));
421 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700422 }
423 write_unlock(&neigh->lock);
424 neigh_release(neigh);
425 }
426
427 kfree_skb(skb);
428 return 0;
429}
430
431/*
432 * Endnode hello message received
433 */
434int dn_neigh_endnode_hello(struct sk_buff *skb)
435{
436 struct endnode_hello_message *msg = (struct endnode_hello_message *)skb->data;
437 struct neighbour *neigh;
438 struct dn_neigh *dn;
Steven Whitehousec4ea94a2006-03-20 22:42:39 -0800439 __le16 src;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700440
Steven Whitehousec4ea94a2006-03-20 22:42:39 -0800441 src = dn_eth2dn(msg->id);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700442
443 neigh = __neigh_lookup(&dn_neigh_table, &src, skb->dev, 1);
444
445 dn = (struct dn_neigh *)neigh;
446
447 if (neigh) {
448 write_lock(&neigh->lock);
449
450 neigh->used = jiffies;
451
452 if (!(neigh->nud_state & NUD_PERMANENT)) {
453 neigh->updated = jiffies;
454
455 if (neigh->dev->type == ARPHRD_ETHER)
456 memcpy(neigh->ha, &eth_hdr(skb)->h_source, ETH_ALEN);
457 dn->flags &= ~(DN_NDFLAG_R1 | DN_NDFLAG_R2);
Harvey Harrisonc4106aa2008-11-27 00:12:47 -0800458 dn->blksize = le16_to_cpu(msg->blksize);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700459 dn->priority = 0;
460 }
461
462 write_unlock(&neigh->lock);
463 neigh_release(neigh);
464 }
465
466 kfree_skb(skb);
467 return 0;
468}
469
470static char *dn_find_slot(char *base, int max, int priority)
471{
472 int i;
473 unsigned char *min = NULL;
474
475 base += 6; /* skip first id */
476
477 for(i = 0; i < max; i++) {
478 if (!min || (*base < *min))
479 min = base;
480 base += 7; /* find next priority */
481 }
482
483 if (!min)
484 return NULL;
485
486 return (*min < priority) ? (min - 6) : NULL;
487}
488
489struct elist_cb_state {
490 struct net_device *dev;
491 unsigned char *ptr;
492 unsigned char *rs;
493 int t, n;
494};
495
496static void neigh_elist_cb(struct neighbour *neigh, void *_info)
497{
498 struct elist_cb_state *s = _info;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700499 struct dn_neigh *dn;
500
501 if (neigh->dev != s->dev)
502 return;
503
504 dn = (struct dn_neigh *) neigh;
505 if (!(dn->flags & (DN_NDFLAG_R1|DN_NDFLAG_R2)))
506 return;
507
Linus Torvalds1da177e2005-04-16 15:20:36 -0700508 if (s->t == s->n)
509 s->rs = dn_find_slot(s->ptr, s->n, dn->priority);
510 else
511 s->t++;
512 if (s->rs == NULL)
513 return;
514
515 dn_dn2eth(s->rs, dn->addr);
516 s->rs += 6;
517 *(s->rs) = neigh->nud_state & NUD_CONNECTED ? 0x80 : 0x0;
518 *(s->rs) |= dn->priority;
519 s->rs++;
520}
521
522int dn_neigh_elist(struct net_device *dev, unsigned char *ptr, int n)
523{
524 struct elist_cb_state state;
525
526 state.dev = dev;
527 state.t = 0;
528 state.n = n;
529 state.ptr = ptr;
530 state.rs = ptr;
531
532 neigh_for_each(&dn_neigh_table, neigh_elist_cb, &state);
533
534 return state.t;
535}
536
537
538#ifdef CONFIG_PROC_FS
539
540static inline void dn_neigh_format_entry(struct seq_file *seq,
541 struct neighbour *n)
542{
543 struct dn_neigh *dn = (struct dn_neigh *) n;
544 char buf[DN_ASCBUF_LEN];
545
546 read_lock(&n->lock);
547 seq_printf(seq, "%-7s %s%s%s %02x %02d %07ld %-8s\n",
Harvey Harrisonc4106aa2008-11-27 00:12:47 -0800548 dn_addr2asc(le16_to_cpu(dn->addr), buf),
Linus Torvalds1da177e2005-04-16 15:20:36 -0700549 (dn->flags&DN_NDFLAG_R1) ? "1" : "-",
550 (dn->flags&DN_NDFLAG_R2) ? "2" : "-",
551 (dn->flags&DN_NDFLAG_P3) ? "3" : "-",
552 dn->n.nud_state,
553 atomic_read(&dn->n.refcnt),
554 dn->blksize,
555 (dn->n.dev) ? dn->n.dev->name : "?");
556 read_unlock(&n->lock);
557}
558
559static int dn_neigh_seq_show(struct seq_file *seq, void *v)
560{
561 if (v == SEQ_START_TOKEN) {
562 seq_puts(seq, "Addr Flags State Use Blksize Dev\n");
563 } else {
564 dn_neigh_format_entry(seq, v);
565 }
566
567 return 0;
568}
569
570static void *dn_neigh_seq_start(struct seq_file *seq, loff_t *pos)
571{
572 return neigh_seq_start(seq, pos, &dn_neigh_table,
573 NEIGH_SEQ_NEIGH_ONLY);
574}
575
Philippe De Muyter56b3d972007-07-10 23:07:31 -0700576static const struct seq_operations dn_neigh_seq_ops = {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700577 .start = dn_neigh_seq_start,
578 .next = neigh_seq_next,
579 .stop = neigh_seq_stop,
580 .show = dn_neigh_seq_show,
581};
582
583static int dn_neigh_seq_open(struct inode *inode, struct file *file)
584{
Eric W. Biederman426b5302008-01-24 00:13:18 -0800585 return seq_open_net(inode, file, &dn_neigh_seq_ops,
586 sizeof(struct neigh_seq_state));
Linus Torvalds1da177e2005-04-16 15:20:36 -0700587}
588
Arjan van de Ven9a321442007-02-12 00:55:35 -0800589static const struct file_operations dn_neigh_seq_fops = {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700590 .owner = THIS_MODULE,
591 .open = dn_neigh_seq_open,
592 .read = seq_read,
593 .llseek = seq_lseek,
Eric W. Biederman426b5302008-01-24 00:13:18 -0800594 .release = seq_release_net,
Linus Torvalds1da177e2005-04-16 15:20:36 -0700595};
596
597#endif
598
599void __init dn_neigh_init(void)
600{
601 neigh_table_init(&dn_neigh_table);
Eric W. Biederman457c4cb2007-09-12 12:01:34 +0200602 proc_net_fops_create(&init_net, "decnet_neigh", S_IRUGO, &dn_neigh_seq_fops);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700603}
604
605void __exit dn_neigh_cleanup(void)
606{
Eric W. Biederman457c4cb2007-09-12 12:01:34 +0200607 proc_net_remove(&init_net, "decnet_neigh");
Linus Torvalds1da177e2005-04-16 15:20:36 -0700608 neigh_table_clear(&dn_neigh_table);
609}