blob: 76622c0442be261550fb92dfab335241974906cc [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>
31#include <linux/if_ether.h>
32#include <linux/init.h>
33#include <linux/proc_fs.h>
34#include <linux/string.h>
35#include <linux/netfilter_decnet.h>
36#include <linux/spinlock.h>
37#include <linux/seq_file.h>
38#include <linux/rcupdate.h>
39#include <linux/jhash.h>
40#include <asm/atomic.h>
Eric W. Biederman457c4cb2007-09-12 12:01:34 +020041#include <net/net_namespace.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070042#include <net/neighbour.h>
43#include <net/dst.h>
44#include <net/flow.h>
45#include <net/dn.h>
46#include <net/dn_dev.h>
47#include <net/dn_neigh.h>
48#include <net/dn_route.h>
49
50static u32 dn_neigh_hash(const void *pkey, const struct net_device *dev);
51static 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,
67 .hh_output = dev_queue_xmit,
68 .queue_xmit = dev_queue_xmit,
69};
70
71/*
72 * For talking to pointopoint and multidrop devices: DDCMP and X.25
73 */
Stephen Hemminger89d69d22009-09-01 11:13:19 +000074static const struct neigh_ops dn_short_ops = {
Linus Torvalds1da177e2005-04-16 15:20:36 -070075 .family = AF_DECnet,
76 .error_report = dn_short_error_report,
77 .output = dn_short_output,
78 .connected_output = dn_short_output,
79 .hh_output = dev_queue_xmit,
80 .queue_xmit = dev_queue_xmit,
81};
82
83/*
84 * For talking to DECnet phase III nodes
85 */
Stephen Hemminger89d69d22009-09-01 11:13:19 +000086static const struct neigh_ops dn_phase3_ops = {
Linus Torvalds1da177e2005-04-16 15:20:36 -070087 .family = AF_DECnet,
88 .error_report = dn_short_error_report, /* Can use short version here */
89 .output = dn_phase3_output,
90 .connected_output = dn_phase3_output,
91 .hh_output = dev_queue_xmit,
92 .queue_xmit = dev_queue_xmit
93};
94
95struct neigh_table dn_neigh_table = {
96 .family = PF_DECnet,
97 .entry_size = sizeof(struct dn_neigh),
Steven Whitehousec4ea94a2006-03-20 22:42:39 -080098 .key_len = sizeof(__le16),
Linus Torvalds1da177e2005-04-16 15:20:36 -070099 .hash = dn_neigh_hash,
100 .constructor = dn_neigh_construct,
101 .id = "dn_neigh_cache",
102 .parms ={
103 .tbl = &dn_neigh_table,
Linus Torvalds1da177e2005-04-16 15:20:36 -0700104 .base_reachable_time = 30 * HZ,
105 .retrans_time = 1 * HZ,
106 .gc_staletime = 60 * HZ,
107 .reachable_time = 30 * HZ,
108 .delay_probe_time = 5 * HZ,
109 .queue_len = 3,
110 .ucast_probes = 0,
111 .app_probes = 0,
112 .mcast_probes = 0,
113 .anycast_delay = 0,
114 .proxy_delay = 0,
115 .proxy_qlen = 0,
116 .locktime = 1 * HZ,
117 },
118 .gc_interval = 30 * HZ,
119 .gc_thresh1 = 128,
120 .gc_thresh2 = 512,
121 .gc_thresh3 = 1024,
122};
123
124static u32 dn_neigh_hash(const void *pkey, const struct net_device *dev)
125{
Steven Whitehousec4ea94a2006-03-20 22:42:39 -0800126 return jhash_2words(*(__u16 *)pkey, 0, dn_neigh_table.hash_rnd);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700127}
128
129static int dn_neigh_construct(struct neighbour *neigh)
130{
131 struct net_device *dev = neigh->dev;
132 struct dn_neigh *dn = (struct dn_neigh *)neigh;
133 struct dn_dev *dn_db;
134 struct neigh_parms *parms;
135
136 rcu_read_lock();
137 dn_db = rcu_dereference(dev->dn_ptr);
138 if (dn_db == NULL) {
139 rcu_read_unlock();
140 return -EINVAL;
141 }
142
143 parms = dn_db->neigh_parms;
144 if (!parms) {
145 rcu_read_unlock();
146 return -EINVAL;
147 }
148
149 __neigh_parms_put(neigh->parms);
150 neigh->parms = neigh_parms_clone(parms);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700151
152 if (dn_db->use_long)
153 neigh->ops = &dn_long_ops;
154 else
155 neigh->ops = &dn_short_ops;
Paul E. McKenney1f072472005-08-17 12:05:27 -0700156 rcu_read_unlock();
Linus Torvalds1da177e2005-04-16 15:20:36 -0700157
158 if (dn->flags & DN_NDFLAG_P3)
159 neigh->ops = &dn_phase3_ops;
160
161 neigh->nud_state = NUD_NOARP;
162 neigh->output = neigh->ops->connected_output;
163
164 if ((dev->type == ARPHRD_IPGRE) || (dev->flags & IFF_POINTOPOINT))
165 memcpy(neigh->ha, dev->broadcast, dev->addr_len);
166 else if ((dev->type == ARPHRD_ETHER) || (dev->type == ARPHRD_LOOPBACK))
167 dn_dn2eth(neigh->ha, dn->addr);
168 else {
169 if (net_ratelimit())
170 printk(KERN_DEBUG "Trying to create neigh for hw %d\n", dev->type);
171 return -EINVAL;
172 }
173
174 /*
175 * Make an estimate of the remote block size by assuming that its
176 * two less then the device mtu, which it true for ethernet (and
177 * other things which support long format headers) since there is
178 * an extra length field (of 16 bits) which isn't part of the
179 * ethernet headers and which the DECnet specs won't admit is part
180 * of the DECnet routing headers either.
181 *
182 * If we over estimate here its no big deal, the NSP negotiations
183 * will prevent us from sending packets which are too large for the
184 * remote node to handle. In any case this figure is normally updated
185 * by a hello message in most cases.
186 */
187 dn->blksize = dev->mtu - 2;
188
189 return 0;
190}
191
192static void dn_long_error_report(struct neighbour *neigh, struct sk_buff *skb)
193{
194 printk(KERN_DEBUG "dn_long_error_report: called\n");
195 kfree_skb(skb);
196}
197
198
199static void dn_short_error_report(struct neighbour *neigh, struct sk_buff *skb)
200{
201 printk(KERN_DEBUG "dn_short_error_report: called\n");
202 kfree_skb(skb);
203}
204
205static int dn_neigh_output_packet(struct sk_buff *skb)
206{
Eric Dumazetadf30902009-06-02 05:19:30 +0000207 struct dst_entry *dst = skb_dst(skb);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700208 struct dn_route *rt = (struct dn_route *)dst;
209 struct neighbour *neigh = dst->neighbour;
210 struct net_device *dev = neigh->dev;
211 char mac_addr[ETH_ALEN];
212
213 dn_dn2eth(mac_addr, rt->rt_local_src);
Stephen Hemminger0c4e8582007-10-09 01:36:32 -0700214 if (dev_hard_header(skb, dev, ntohs(skb->protocol), neigh->ha,
215 mac_addr, skb->len) >= 0)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700216 return neigh->ops->queue_xmit(skb);
217
218 if (net_ratelimit())
219 printk(KERN_DEBUG "dn_neigh_output_packet: oops, can't send packet\n");
220
221 kfree_skb(skb);
222 return -EINVAL;
223}
224
225static int dn_long_output(struct sk_buff *skb)
226{
Eric Dumazetadf30902009-06-02 05:19:30 +0000227 struct dst_entry *dst = skb_dst(skb);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700228 struct neighbour *neigh = dst->neighbour;
229 struct net_device *dev = neigh->dev;
230 int headroom = dev->hard_header_len + sizeof(struct dn_long_packet) + 3;
231 unsigned char *data;
232 struct dn_long_packet *lp;
233 struct dn_skb_cb *cb = DN_SKB_CB(skb);
234
235
236 if (skb_headroom(skb) < headroom) {
237 struct sk_buff *skb2 = skb_realloc_headroom(skb, headroom);
238 if (skb2 == NULL) {
239 if (net_ratelimit())
240 printk(KERN_CRIT "dn_long_output: no memory\n");
241 kfree_skb(skb);
242 return -ENOBUFS;
243 }
244 kfree_skb(skb);
245 skb = skb2;
246 if (net_ratelimit())
247 printk(KERN_INFO "dn_long_output: Increasing headroom\n");
248 }
249
250 data = skb_push(skb, sizeof(struct dn_long_packet) + 3);
251 lp = (struct dn_long_packet *)(data+3);
252
Harvey Harrisonc4106aa2008-11-27 00:12:47 -0800253 *((__le16 *)data) = cpu_to_le16(skb->len - 2);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700254 *(data + 2) = 1 | DN_RT_F_PF; /* Padding */
255
256 lp->msgflg = DN_RT_PKT_LONG|(cb->rt_flags&(DN_RT_F_IE|DN_RT_F_RQR|DN_RT_F_RTS));
257 lp->d_area = lp->d_subarea = 0;
Steven Whitehousec4ea94a2006-03-20 22:42:39 -0800258 dn_dn2eth(lp->d_id, cb->dst);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700259 lp->s_area = lp->s_subarea = 0;
Steven Whitehousec4ea94a2006-03-20 22:42:39 -0800260 dn_dn2eth(lp->s_id, cb->src);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700261 lp->nl2 = 0;
262 lp->visit_ct = cb->hops & 0x3f;
263 lp->s_class = 0;
264 lp->pt = 0;
265
Arnaldo Carvalho de Meloc1d2bbe2007-04-10 20:45:18 -0700266 skb_reset_network_header(skb);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700267
Jan Engelhardt5d877d82010-03-23 04:09:14 +0100268 return NF_HOOK(NFPROTO_DECNET, NF_DN_POST_ROUTING, skb, NULL,
269 neigh->dev, dn_neigh_output_packet);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700270}
271
272static int dn_short_output(struct sk_buff *skb)
273{
Eric Dumazetadf30902009-06-02 05:19:30 +0000274 struct dst_entry *dst = skb_dst(skb);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700275 struct neighbour *neigh = dst->neighbour;
276 struct net_device *dev = neigh->dev;
277 int headroom = dev->hard_header_len + sizeof(struct dn_short_packet) + 2;
278 struct dn_short_packet *sp;
279 unsigned char *data;
280 struct dn_skb_cb *cb = DN_SKB_CB(skb);
281
282
YOSHIFUJI Hideaki429eb0f2007-02-09 23:24:40 +0900283 if (skb_headroom(skb) < headroom) {
284 struct sk_buff *skb2 = skb_realloc_headroom(skb, headroom);
285 if (skb2 == NULL) {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700286 if (net_ratelimit())
YOSHIFUJI Hideaki429eb0f2007-02-09 23:24:40 +0900287 printk(KERN_CRIT "dn_short_output: no memory\n");
288 kfree_skb(skb);
289 return -ENOBUFS;
290 }
291 kfree_skb(skb);
292 skb = skb2;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700293 if (net_ratelimit())
YOSHIFUJI Hideaki429eb0f2007-02-09 23:24:40 +0900294 printk(KERN_INFO "dn_short_output: Increasing headroom\n");
295 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700296
297 data = skb_push(skb, sizeof(struct dn_short_packet) + 2);
Harvey Harrisonc4106aa2008-11-27 00:12:47 -0800298 *((__le16 *)data) = cpu_to_le16(skb->len - 2);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700299 sp = (struct dn_short_packet *)(data+2);
300
301 sp->msgflg = DN_RT_PKT_SHORT|(cb->rt_flags&(DN_RT_F_RQR|DN_RT_F_RTS));
302 sp->dstnode = cb->dst;
303 sp->srcnode = cb->src;
304 sp->forward = cb->hops & 0x3f;
305
Arnaldo Carvalho de Meloc1d2bbe2007-04-10 20:45:18 -0700306 skb_reset_network_header(skb);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700307
Jan Engelhardt5d877d82010-03-23 04:09:14 +0100308 return NF_HOOK(NFPROTO_DECNET, NF_DN_POST_ROUTING, skb, NULL,
309 neigh->dev, dn_neigh_output_packet);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700310}
311
312/*
313 * Phase 3 output is the same is short output, execpt that
314 * it clears the area bits before transmission.
315 */
316static int dn_phase3_output(struct sk_buff *skb)
317{
Eric Dumazetadf30902009-06-02 05:19:30 +0000318 struct dst_entry *dst = skb_dst(skb);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700319 struct neighbour *neigh = dst->neighbour;
320 struct net_device *dev = neigh->dev;
321 int headroom = dev->hard_header_len + sizeof(struct dn_short_packet) + 2;
322 struct dn_short_packet *sp;
323 unsigned char *data;
324 struct dn_skb_cb *cb = DN_SKB_CB(skb);
325
326 if (skb_headroom(skb) < headroom) {
327 struct sk_buff *skb2 = skb_realloc_headroom(skb, headroom);
328 if (skb2 == NULL) {
329 if (net_ratelimit())
330 printk(KERN_CRIT "dn_phase3_output: no memory\n");
331 kfree_skb(skb);
332 return -ENOBUFS;
333 }
334 kfree_skb(skb);
335 skb = skb2;
336 if (net_ratelimit())
337 printk(KERN_INFO "dn_phase3_output: Increasing headroom\n");
338 }
339
340 data = skb_push(skb, sizeof(struct dn_short_packet) + 2);
Harvey Harrisonc4106aa2008-11-27 00:12:47 -0800341 *((__le16 *)data) = cpu_to_le16(skb->len - 2);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700342 sp = (struct dn_short_packet *)(data + 2);
343
344 sp->msgflg = DN_RT_PKT_SHORT|(cb->rt_flags&(DN_RT_F_RQR|DN_RT_F_RTS));
Harvey Harrisonc4106aa2008-11-27 00:12:47 -0800345 sp->dstnode = cb->dst & cpu_to_le16(0x03ff);
346 sp->srcnode = cb->src & cpu_to_le16(0x03ff);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700347 sp->forward = cb->hops & 0x3f;
348
Arnaldo Carvalho de Meloc1d2bbe2007-04-10 20:45:18 -0700349 skb_reset_network_header(skb);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700350
Jan Engelhardt5d877d82010-03-23 04:09:14 +0100351 return NF_HOOK(NFPROTO_DECNET, NF_DN_POST_ROUTING, skb, NULL,
352 neigh->dev, dn_neigh_output_packet);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700353}
354
355/*
356 * Unfortunately, the neighbour code uses the device in its hash
357 * function, so we don't get any advantage from it. This function
358 * basically does a neigh_lookup(), but without comparing the device
359 * field. This is required for the On-Ethernet cache
360 */
361
362/*
363 * Pointopoint link receives a hello message
364 */
365void dn_neigh_pointopoint_hello(struct sk_buff *skb)
366{
367 kfree_skb(skb);
368}
369
370/*
371 * Ethernet router hello message received
372 */
373int dn_neigh_router_hello(struct sk_buff *skb)
374{
375 struct rtnode_hello_message *msg = (struct rtnode_hello_message *)skb->data;
376
377 struct neighbour *neigh;
378 struct dn_neigh *dn;
379 struct dn_dev *dn_db;
Steven Whitehousec4ea94a2006-03-20 22:42:39 -0800380 __le16 src;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700381
Steven Whitehousec4ea94a2006-03-20 22:42:39 -0800382 src = dn_eth2dn(msg->id);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700383
384 neigh = __neigh_lookup(&dn_neigh_table, &src, skb->dev, 1);
385
386 dn = (struct dn_neigh *)neigh;
387
388 if (neigh) {
389 write_lock(&neigh->lock);
390
391 neigh->used = jiffies;
392 dn_db = (struct dn_dev *)neigh->dev->dn_ptr;
393
394 if (!(neigh->nud_state & NUD_PERMANENT)) {
395 neigh->updated = jiffies;
396
397 if (neigh->dev->type == ARPHRD_ETHER)
398 memcpy(neigh->ha, &eth_hdr(skb)->h_source, ETH_ALEN);
399
Harvey Harrisonc4106aa2008-11-27 00:12:47 -0800400 dn->blksize = le16_to_cpu(msg->blksize);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700401 dn->priority = msg->priority;
402
403 dn->flags &= ~DN_NDFLAG_P3;
404
405 switch(msg->iinfo & DN_RT_INFO_TYPE) {
406 case DN_RT_INFO_L1RT:
407 dn->flags &=~DN_NDFLAG_R2;
408 dn->flags |= DN_NDFLAG_R1;
409 break;
410 case DN_RT_INFO_L2RT:
411 dn->flags |= DN_NDFLAG_R2;
412 }
413 }
414
Patrick Caulfield50624302006-01-03 14:24:02 -0800415 /* Only use routers in our area */
Harvey Harrisonc4106aa2008-11-27 00:12:47 -0800416 if ((le16_to_cpu(src)>>10) == (le16_to_cpu((decnet_address))>>10)) {
Patrick Caulfield50624302006-01-03 14:24:02 -0800417 if (!dn_db->router) {
418 dn_db->router = neigh_clone(neigh);
419 } else {
420 if (msg->priority > ((struct dn_neigh *)dn_db->router)->priority)
421 neigh_release(xchg(&dn_db->router, neigh_clone(neigh)));
422 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700423 }
424 write_unlock(&neigh->lock);
425 neigh_release(neigh);
426 }
427
428 kfree_skb(skb);
429 return 0;
430}
431
432/*
433 * Endnode hello message received
434 */
435int dn_neigh_endnode_hello(struct sk_buff *skb)
436{
437 struct endnode_hello_message *msg = (struct endnode_hello_message *)skb->data;
438 struct neighbour *neigh;
439 struct dn_neigh *dn;
Steven Whitehousec4ea94a2006-03-20 22:42:39 -0800440 __le16 src;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700441
Steven Whitehousec4ea94a2006-03-20 22:42:39 -0800442 src = dn_eth2dn(msg->id);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700443
444 neigh = __neigh_lookup(&dn_neigh_table, &src, skb->dev, 1);
445
446 dn = (struct dn_neigh *)neigh;
447
448 if (neigh) {
449 write_lock(&neigh->lock);
450
451 neigh->used = jiffies;
452
453 if (!(neigh->nud_state & NUD_PERMANENT)) {
454 neigh->updated = jiffies;
455
456 if (neigh->dev->type == ARPHRD_ETHER)
457 memcpy(neigh->ha, &eth_hdr(skb)->h_source, ETH_ALEN);
458 dn->flags &= ~(DN_NDFLAG_R1 | DN_NDFLAG_R2);
Harvey Harrisonc4106aa2008-11-27 00:12:47 -0800459 dn->blksize = le16_to_cpu(msg->blksize);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700460 dn->priority = 0;
461 }
462
463 write_unlock(&neigh->lock);
464 neigh_release(neigh);
465 }
466
467 kfree_skb(skb);
468 return 0;
469}
470
471static char *dn_find_slot(char *base, int max, int priority)
472{
473 int i;
474 unsigned char *min = NULL;
475
476 base += 6; /* skip first id */
477
478 for(i = 0; i < max; i++) {
479 if (!min || (*base < *min))
480 min = base;
481 base += 7; /* find next priority */
482 }
483
484 if (!min)
485 return NULL;
486
487 return (*min < priority) ? (min - 6) : NULL;
488}
489
490struct elist_cb_state {
491 struct net_device *dev;
492 unsigned char *ptr;
493 unsigned char *rs;
494 int t, n;
495};
496
497static void neigh_elist_cb(struct neighbour *neigh, void *_info)
498{
499 struct elist_cb_state *s = _info;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700500 struct dn_neigh *dn;
501
502 if (neigh->dev != s->dev)
503 return;
504
505 dn = (struct dn_neigh *) neigh;
506 if (!(dn->flags & (DN_NDFLAG_R1|DN_NDFLAG_R2)))
507 return;
508
Linus Torvalds1da177e2005-04-16 15:20:36 -0700509 if (s->t == s->n)
510 s->rs = dn_find_slot(s->ptr, s->n, dn->priority);
511 else
512 s->t++;
513 if (s->rs == NULL)
514 return;
515
516 dn_dn2eth(s->rs, dn->addr);
517 s->rs += 6;
518 *(s->rs) = neigh->nud_state & NUD_CONNECTED ? 0x80 : 0x0;
519 *(s->rs) |= dn->priority;
520 s->rs++;
521}
522
523int dn_neigh_elist(struct net_device *dev, unsigned char *ptr, int n)
524{
525 struct elist_cb_state state;
526
527 state.dev = dev;
528 state.t = 0;
529 state.n = n;
530 state.ptr = ptr;
531 state.rs = ptr;
532
533 neigh_for_each(&dn_neigh_table, neigh_elist_cb, &state);
534
535 return state.t;
536}
537
538
539#ifdef CONFIG_PROC_FS
540
541static inline void dn_neigh_format_entry(struct seq_file *seq,
542 struct neighbour *n)
543{
544 struct dn_neigh *dn = (struct dn_neigh *) n;
545 char buf[DN_ASCBUF_LEN];
546
547 read_lock(&n->lock);
548 seq_printf(seq, "%-7s %s%s%s %02x %02d %07ld %-8s\n",
Harvey Harrisonc4106aa2008-11-27 00:12:47 -0800549 dn_addr2asc(le16_to_cpu(dn->addr), buf),
Linus Torvalds1da177e2005-04-16 15:20:36 -0700550 (dn->flags&DN_NDFLAG_R1) ? "1" : "-",
551 (dn->flags&DN_NDFLAG_R2) ? "2" : "-",
552 (dn->flags&DN_NDFLAG_P3) ? "3" : "-",
553 dn->n.nud_state,
554 atomic_read(&dn->n.refcnt),
555 dn->blksize,
556 (dn->n.dev) ? dn->n.dev->name : "?");
557 read_unlock(&n->lock);
558}
559
560static int dn_neigh_seq_show(struct seq_file *seq, void *v)
561{
562 if (v == SEQ_START_TOKEN) {
563 seq_puts(seq, "Addr Flags State Use Blksize Dev\n");
564 } else {
565 dn_neigh_format_entry(seq, v);
566 }
567
568 return 0;
569}
570
571static void *dn_neigh_seq_start(struct seq_file *seq, loff_t *pos)
572{
573 return neigh_seq_start(seq, pos, &dn_neigh_table,
574 NEIGH_SEQ_NEIGH_ONLY);
575}
576
Philippe De Muyter56b3d972007-07-10 23:07:31 -0700577static const struct seq_operations dn_neigh_seq_ops = {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700578 .start = dn_neigh_seq_start,
579 .next = neigh_seq_next,
580 .stop = neigh_seq_stop,
581 .show = dn_neigh_seq_show,
582};
583
584static int dn_neigh_seq_open(struct inode *inode, struct file *file)
585{
Eric W. Biederman426b5302008-01-24 00:13:18 -0800586 return seq_open_net(inode, file, &dn_neigh_seq_ops,
587 sizeof(struct neigh_seq_state));
Linus Torvalds1da177e2005-04-16 15:20:36 -0700588}
589
Arjan van de Ven9a321442007-02-12 00:55:35 -0800590static const struct file_operations dn_neigh_seq_fops = {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700591 .owner = THIS_MODULE,
592 .open = dn_neigh_seq_open,
593 .read = seq_read,
594 .llseek = seq_lseek,
Eric W. Biederman426b5302008-01-24 00:13:18 -0800595 .release = seq_release_net,
Linus Torvalds1da177e2005-04-16 15:20:36 -0700596};
597
598#endif
599
600void __init dn_neigh_init(void)
601{
602 neigh_table_init(&dn_neigh_table);
Eric W. Biederman457c4cb2007-09-12 12:01:34 +0200603 proc_net_fops_create(&init_net, "decnet_neigh", S_IRUGO, &dn_neigh_seq_fops);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700604}
605
606void __exit dn_neigh_cleanup(void)
607{
Eric W. Biederman457c4cb2007-09-12 12:01:34 +0200608 proc_net_remove(&init_net, "decnet_neigh");
Linus Torvalds1da177e2005-04-16 15:20:36 -0700609 neigh_table_clear(&dn_neigh_table);
610}