?  search:
summary | log | graphiclog1 | graphiclog2 | commit | commitdiff | tree | refs | edit | fork
blame | history | raw | HEAD
Import 2.1.42pre1
[davej-history.git] / net / netrom / nr_route.c
blob41399a53caa35abfc42d0cfb8e60f5b926ab61cd
1 /*
2 * NET/ROM release 006
3 *
4 * This code REQUIRES 2.1.15 or higher/ NET3.038
5 *
6 * This module:
7 * This module is free software; you can redistribute it and/or
8 * modify it under the terms of the GNU General Public License
9 * as published by the Free Software Foundation; either version
10 * 2 of the License, or (at your option) any later version.
11 *
12 * History
13 * NET/ROM 001 Jonathan(G4KLX) First attempt.
14 * NET/ROM 003 Jonathan(G4KLX) Use SIOCADDRT/SIOCDELRT ioctl values
15 * for NET/ROM routes.
16 * Use '*' for a blank mnemonic in /proc/net/nr_nodes.
17 * Change default quality for new neighbour when same
18 * as node callsign.
19 * Alan Cox(GW4PTS) Added the firewall hooks.
20 * NET/ROM 006 Jonathan(G4KLX) Added the setting of digipeated neighbours.
21 * Tomi(OH2BNS) Routing quality and link failure changes.
22 */
23
24 #include <linux/config.h>
25 #if defined(CONFIG_NETROM) || defined(CONFIG_NETROM_MODULE)
26 #include <linux/errno.h>
27 #include <linux/types.h>
28 #include <linux/socket.h>
29 #include <linux/in.h>
30 #include <linux/kernel.h>
31 #include <linux/sched.h>
32 #include <linux/timer.h>
33 #include <linux/string.h>
34 #include <linux/sockios.h>
35 #include <linux/net.h>
36 #include <net/ax25.h>
37 #include <linux/inet.h>
38 #include <linux/netdevice.h>
39 #include <net/arp.h>
40 #include <linux/if_arp.h>
41 #include <linux/skbuff.h>
42 #include <net/sock.h>
43 #include <asm/uaccess.h>
44 #include <asm/system.h>
45 #include <linux/fcntl.h>
46 #include <linux/termios.h> /* For TIOCINQ/OUTQ */
47 #include <linux/mm.h>
48 #include <linux/interrupt.h>
49 #include <linux/notifier.h>
50 #include <linux/firewall.h>
51 #include <net/netrom.h>
52
53 static unsigned int nr_neigh_no = 1;
54
55 static struct nr_node *nr_node_list = NULL;
56 static struct nr_neigh *nr_neigh_list = NULL;
57
58 static void nr_remove_neigh(struct nr_neigh *);
59
60 /*
61 * Add a new route to a node, and in the process add the node and the
62 * neighbour if it is new.
63 */
64 static int nr_add_node(ax25_address *nr, const char *mnemonic, ax25_address *ax25,
65 ax25_digi *ax25_digi, struct device *dev, int quality, int obs_count)
66 {
67 struct nr_node *nr_node;
68 struct nr_neigh *nr_neigh;
69 struct nr_route nr_route;
70 unsigned long flags;
71 int i, found;
72
73 if (nr_dev_get(nr) != NULL) /* Can't add routes to ourself */
74 return -EINVAL;
75
76 for (nr_node = nr_node_list; nr_node != NULL; nr_node = nr_node->next)
77 if (ax25cmp(nr, &nr_node->callsign) == 0)
78 break;
79
80 for (nr_neigh = nr_neigh_list; nr_neigh != NULL; nr_neigh = nr_neigh->next)
81 if (ax25cmp(ax25, &nr_neigh->callsign) == 0 && nr_neigh->dev == dev)
82 break;
83
84 if (nr_neigh != NULL)
85 nr_neigh->failed = 0;
86
87 if (quality == 0 && nr_neigh != NULL && nr_node != NULL)
88 return 0;
89
90 if (nr_neigh == NULL) {
91 if ((nr_neigh = kmalloc(sizeof(*nr_neigh), GFP_ATOMIC)) == NULL)
92 return -ENOMEM;
93
94 nr_neigh->callsign = *ax25;
95 nr_neigh->digipeat = NULL;
96 nr_neigh->dev = dev;
97 nr_neigh->quality = sysctl_netrom_default_path_quality;
98 nr_neigh->locked = 0;
99 nr_neigh->count = 0;
100 nr_neigh->number = nr_neigh_no++;
101 nr_neigh->failed = 0;
102
103 if (ax25_digi != NULL && ax25_digi->ndigi > 0) {
104 if ((nr_neigh->digipeat = kmalloc(sizeof(*ax25_digi), GFP_KERNEL)) == NULL) {
105 kfree(nr_neigh);
106 return -ENOMEM;
107 }
108 *nr_neigh->digipeat = *ax25_digi;
109 }
110
111 save_flags(flags);
112 cli();
113
114 nr_neigh->next = nr_neigh_list;
115 nr_neigh_list = nr_neigh;
116
117 restore_flags(flags);
118 }
119
120 if (quality != 0 && ax25cmp(nr, ax25) == 0 && !nr_neigh->locked)
121 nr_neigh->quality = quality;
122
123 if (nr_node == NULL) {
124 if ((nr_node = kmalloc(sizeof(*nr_node), GFP_ATOMIC)) == NULL)
125 return -ENOMEM;
126
127 nr_node->callsign = *nr;
128 strcpy(nr_node->mnemonic, mnemonic);
129
130 nr_node->which = 0;
131 nr_node->count = 1;
132
133 nr_node->routes[0].quality = quality;
134 nr_node->routes[0].obs_count = obs_count;
135 nr_node->routes[0].neighbour = nr_neigh;
136
137 save_flags(flags);
138 cli();
139
140 nr_node->next = nr_node_list;
141 nr_node_list = nr_node;
142
143 restore_flags(flags);
144
145 nr_neigh->count++;
146
147 return 0;
148 }
149
150 if (quality != 0)
151 strcpy(nr_node->mnemonic, mnemonic);
152
153 for (found = 0, i = 0; i < nr_node->count; i++) {
154 if (nr_node->routes[i].neighbour == nr_neigh) {
155 nr_node->routes[i].quality = quality;
156 nr_node->routes[i].obs_count = obs_count;
157 found = 1;
158 break;
159 }
160 }
161
162 if (!found) {
163 /* We have space at the bottom, slot it in */
164 if (nr_node->count < 3) {
165 nr_node->routes[2] = nr_node->routes[1];
166 nr_node->routes[1] = nr_node->routes[0];
167
168 nr_node->routes[0].quality = quality;
169 nr_node->routes[0].obs_count = obs_count;
170 nr_node->routes[0].neighbour = nr_neigh;
171
172 nr_node->which++;
173 nr_node->count++;
174 nr_neigh->count++;
175 } else {
176 /* It must be better than the worst */
177 if (quality > nr_node->routes[2].quality) {
178 nr_node->routes[2].neighbour->count--;
179
180 if (nr_node->routes[2].neighbour->count == 0 && !nr_node->routes[2].neighbour->locked)
181 nr_remove_neigh(nr_node->routes[2].neighbour);
182
183 nr_node->routes[2].quality = quality;
184 nr_node->routes[2].obs_count = obs_count;
185 nr_node->routes[2].neighbour = nr_neigh;
186
187 nr_neigh->count++;
188 }
189 }
190 }
191
192 /* Now re-sort the routes in quality order */
193 switch (nr_node->count) {
194 case 3:
195 if (nr_node->routes[1].quality > nr_node->routes[0].quality) {
196 switch (nr_node->which) {
197 case 0: nr_node->which = 1; break;
198 case 1: nr_node->which = 0; break;
199 default: break;
200 }
201 nr_route = nr_node->routes[0];
202 nr_node->routes[0] = nr_node->routes[1];
203 nr_node->routes[1] = nr_route;
204 }
205 if (nr_node->routes[2].quality > nr_node->routes[1].quality) {
206 switch (nr_node->which) {
207 case 1: nr_node->which = 2; break;
208 case 2: nr_node->which = 1; break;
209 default: break;
210 }
211 nr_route = nr_node->routes[1];
212 nr_node->routes[1] = nr_node->routes[2];
213 nr_node->routes[2] = nr_route;
214 }
215 case 2:
216 if (nr_node->routes[1].quality > nr_node->routes[0].quality) {
217 switch (nr_node->which) {
218 case 0: nr_node->which = 1; break;
219 case 1: nr_node->which = 0; break;
220 default: break;
221 }
222 nr_route = nr_node->routes[0];
223 nr_node->routes[0] = nr_node->routes[1];
224 nr_node->routes[1] = nr_route;
225 }
226 case 1:
227 break;
228 }
229
230 for (i = 0; i < nr_node->count; i++) {
231 if (nr_node->routes[i].neighbour == nr_neigh) {
232 if (i < nr_node->which)
233 nr_node->which = i;
234 break;
235 }
236 }
237
238 return 0;
239 }
240
241 static void nr_remove_node(struct nr_node *nr_node)
242 {
243 struct nr_node *s;
244 unsigned long flags;
245
246 save_flags(flags);
247 cli();
248
249 if ((s = nr_node_list) == nr_node) {
250 nr_node_list = nr_node->next;
251 restore_flags(flags);
252 kfree(nr_node);
253 return;
254 }
255
256 while (s != NULL && s->next != NULL) {
257 if (s->next == nr_node) {
258 s->next = nr_node->next;
259 restore_flags(flags);
260 kfree(nr_node);
261 return;
262 }
263
264 s = s->next;
265 }
266
267 restore_flags(flags);
268 }
269
270 static void nr_remove_neigh(struct nr_neigh *nr_neigh)
271 {
272 struct nr_neigh *s;
273 unsigned long flags;
274
275 save_flags(flags);
276 cli();
277
278 if ((s = nr_neigh_list) == nr_neigh) {
279 nr_neigh_list = nr_neigh->next;
280 restore_flags(flags);
281 if (nr_neigh->digipeat != NULL)
282 kfree(nr_neigh->digipeat);
283 kfree(nr_neigh);
284 return;
285 }
286
287 while (s != NULL && s->next != NULL) {
288 if (s->next == nr_neigh) {
289 s->next = nr_neigh->next;
290 restore_flags(flags);
291 if (nr_neigh->digipeat != NULL)
292 kfree(nr_neigh->digipeat);
293 kfree(nr_neigh);
294 return;
295 }
296
297 s = s->next;
298 }
299
300 restore_flags(flags);
301 }
302
303 /*
304 * "Delete" a node. Strictly speaking remove a route to a node. The node
305 * is only deleted if no routes are left to it.
306 */
307 static int nr_del_node(ax25_address *callsign, ax25_address *neighbour, struct device *dev)
308 {
309 struct nr_node *nr_node;
310 struct nr_neigh *nr_neigh;
311 int i;
312
313 for (nr_node = nr_node_list; nr_node != NULL; nr_node = nr_node->next)
314 if (ax25cmp(callsign, &nr_node->callsign) == 0)
315 break;
316
317 if (nr_node == NULL) return -EINVAL;
318
319 for (nr_neigh = nr_neigh_list; nr_neigh != NULL; nr_neigh = nr_neigh->next)
320 if (ax25cmp(neighbour, &nr_neigh->callsign) == 0 && nr_neigh->dev == dev)
321 break;
322
323 if (nr_neigh == NULL) return -EINVAL;
324
325 for (i = 0; i < nr_node->count; i++) {
326 if (nr_node->routes[i].neighbour == nr_neigh) {
327 nr_neigh->count--;
328
329 if (nr_neigh->count == 0 && !nr_neigh->locked)
330 nr_remove_neigh(nr_neigh);
331
332 nr_node->count--;
333
334 if (nr_node->count == 0) {
335 nr_remove_node(nr_node);
336 } else {
337 switch (i) {
338 case 0:
339 nr_node->routes[0] = nr_node->routes[1];
340 case 1:
341 nr_node->routes[1] = nr_node->routes[2];
342 case 2:
343 break;
344 }
345 }
346
347 return 0;
348 }
349 }
350
351 return -EINVAL;
352 }
353
354 /*
355 * Lock a neighbour with a quality.
356 */
357 static int nr_add_neigh(ax25_address *callsign, ax25_digi *ax25_digi, struct device *dev, unsigned int quality)
358 {
359 struct nr_neigh *nr_neigh;
360 unsigned long flags;
361
362 for (nr_neigh = nr_neigh_list; nr_neigh != NULL; nr_neigh = nr_neigh->next) {
363 if (ax25cmp(callsign, &nr_neigh->callsign) == 0 && nr_neigh->dev == dev) {
364 nr_neigh->quality = quality;
365 nr_neigh->locked = 1;
366 return 0;
367 }
368 }
369
370 if ((nr_neigh = kmalloc(sizeof(*nr_neigh), GFP_ATOMIC)) == NULL)
371 return -ENOMEM;
372
373 nr_neigh->callsign = *callsign;
374 nr_neigh->digipeat = NULL;
375 nr_neigh->dev = dev;
376 nr_neigh->quality = quality;
377 nr_neigh->locked = 1;
378 nr_neigh->count = 0;
379 nr_neigh->number = nr_neigh_no++;
380 nr_neigh->failed = 0;
381
382 if (ax25_digi != NULL && ax25_digi->ndigi > 0) {
383 if ((nr_neigh->digipeat = kmalloc(sizeof(*ax25_digi), GFP_KERNEL)) == NULL) {
384 kfree(nr_neigh);
385 return -ENOMEM;
386 }
387 *nr_neigh->digipeat = *ax25_digi;
388 }
389
390 save_flags(flags);
391 cli();
392
393 nr_neigh->next = nr_neigh_list;
394 nr_neigh_list = nr_neigh;
395
396 restore_flags(flags);
397
398 return 0;
399 }
400
401 /*
402 * "Delete" a neighbour. The neighbour is only removed if the number
403 * of nodes that may use it is zero.
404 */
405 static int nr_del_neigh(ax25_address *callsign, struct device *dev, unsigned int quality)
406 {
407 struct nr_neigh *nr_neigh;
408
409 for (nr_neigh = nr_neigh_list; nr_neigh != NULL; nr_neigh = nr_neigh->next)
410 if (ax25cmp(callsign, &nr_neigh->callsign) == 0 && nr_neigh->dev == dev)
411 break;
412
413 if (nr_neigh == NULL) return -EINVAL;
414
415 nr_neigh->quality = quality;
416 nr_neigh->locked = 0;
417
418 if (nr_neigh->count == 0)
419 nr_remove_neigh(nr_neigh);
420
421 return 0;
422 }
423
424 /*
425 * Decrement the obsolescence count by one. If a route is reduced to a
426 * count of zero, remove it. Also remove any unlocked neighbours with
427 * zero nodes routing via it.
428 */
429 static int nr_dec_obs(void)
430 {
431 struct nr_neigh *nr_neigh;
432 struct nr_node *s, *nr_node;
433 int i;
434
435 nr_node = nr_node_list;
436
437 while (nr_node != NULL) {
438 s = nr_node;
439 nr_node = nr_node->next;
440
441 for (i = 0; i < s->count; i++) {
442 switch (s->routes[i].obs_count) {
443
444 case 0: /* A locked entry */
445 break;
446
447 case 1: /* From 1 -> 0 */
448 nr_neigh = s->routes[i].neighbour;
449
450 nr_neigh->count--;
451
452 if (nr_neigh->count == 0 && !nr_neigh->locked)
453 nr_remove_neigh(nr_neigh);
454
455 s->count--;
456
457 switch (i) {
458 case 0:
459 s->routes[0] = s->routes[1];
460 case 1:
461 s->routes[1] = s->routes[2];
462 case 2:
463 break;
464 }
465 break;
466
467 default:
468 s->routes[i].obs_count--;
469 break;
470
471 }
472 }
473
474 if (s->count <= 0)
475 nr_remove_node(s);
476 }
477
478 return 0;
479 }
480
481 /*
482 * A device has been removed. Remove its routes and neighbours.
483 */
484 void nr_rt_device_down(struct device *dev)
485 {
486 struct nr_neigh *s, *nr_neigh = nr_neigh_list;
487 struct nr_node *t, *nr_node;
488 int i;
489
490 while (nr_neigh != NULL) {
491 s = nr_neigh;
492 nr_neigh = nr_neigh->next;
493
494 if (s->dev == dev) {
495 nr_node = nr_node_list;
496
497 while (nr_node != NULL) {
498 t = nr_node;
499 nr_node = nr_node->next;
500
501 for (i = 0; i < t->count; i++) {
502 if (t->routes[i].neighbour == s) {
503 t->count--;
504
505 switch (i) {
506 case 0:
507 t->routes[0] = t->routes[1];
508 case 1:
509 t->routes[1] = t->routes[2];
510 case 2:
511 break;
512 }
513 }
514 }
515
516 if (t->count <= 0)
517 nr_remove_node(t);
518 }
519
520 nr_remove_neigh(s);
521 }
522 }
523 }
524
525 /*
526 * Check that the device given is a valid AX.25 interface that is "up".
527 * Or a valid ethernet interface with an AX.25 callsign binding.
528 */
529 static struct device *nr_ax25_dev_get(char *devname)
530 {
531 struct device *dev;
532
533 if ((dev = dev_get(devname)) == NULL)
534 return NULL;
535
536 if ((dev->flags & IFF_UP) && dev->type == ARPHRD_AX25)
537 return dev;
538
539 return NULL;
540 }
541
542 /*
543 * Find the first active NET/ROM device, usually "nr0".
544 */
545 struct device *nr_dev_first(void)
546 {
547 struct device *dev, *first = NULL;
548
549 for (dev = dev_base; dev != NULL; dev = dev->next)
550 if ((dev->flags & IFF_UP) && dev->type == ARPHRD_NETROM)
551 if (first == NULL || strncmp(dev->name, first->name, 3) < 0)
552 first = dev;
553
554 return first;
555 }
556
557 /*
558 * Find the NET/ROM device for the given callsign.
559 */
560 struct device *nr_dev_get(ax25_address *addr)
561 {
562 struct device *dev;
563
564 for (dev = dev_base; dev != NULL; dev = dev->next)
565 if ((dev->flags & IFF_UP) && dev->type == ARPHRD_NETROM && ax25cmp(addr, (ax25_address *)dev->dev_addr) == 0)
566 return dev;
567
568 return NULL;
569 }
570
571 static ax25_digi *nr_call_to_digi(int ndigis, ax25_address *digipeaters)
572 {
573 static ax25_digi ax25_digi;
574 int i;
575
576 if (ndigis == 0)
577 return NULL;
578
579 for (i = 0; i < ndigis; i++) {
580 ax25_digi.calls[i] = digipeaters[i];
581 ax25_digi.repeated[i] = 0;
582 }
583
584 ax25_digi.ndigi = ndigis;
585 ax25_digi.lastrepeat = 0;
586
587 return &ax25_digi;
588 }
589
590 /*
591 * Handle the ioctls that control the routing functions.
592 */
593 int nr_rt_ioctl(unsigned int cmd, void *arg)
594 {
595 struct nr_route_struct nr_route;
596 struct device *dev;
597 int err;
598
599 switch (cmd) {
600
601 case SIOCADDRT:
602 if ((err = verify_area(VERIFY_READ, arg, sizeof(struct nr_route_struct))) != 0)
603 return err;
604 copy_from_user(&nr_route, arg, sizeof(struct nr_route_struct));
605 if ((dev = nr_ax25_dev_get(nr_route.device)) == NULL)
606 return -EINVAL;
607 if (nr_route.ndigis < 0 || nr_route.ndigis > AX25_MAX_DIGIS)
608 return -EINVAL;
609 switch (nr_route.type) {
610 case NETROM_NODE:
611 return nr_add_node(&nr_route.callsign,
612 nr_route.mnemonic,
613 &nr_route.neighbour,
614 nr_call_to_digi(nr_route.ndigis, nr_route.digipeaters),
615 dev, nr_route.quality,
616 nr_route.obs_count);
617 case NETROM_NEIGH:
618 return nr_add_neigh(&nr_route.callsign,
619 nr_call_to_digi(nr_route.ndigis, nr_route.digipeaters),
620 dev, nr_route.quality);
621 default:
622 return -EINVAL;
623 }
624
625 case SIOCDELRT:
626 if ((err = verify_area(VERIFY_READ, arg, sizeof(struct nr_route_struct))) != 0)
627 return err;
628 copy_from_user(&nr_route, arg, sizeof(struct nr_route_struct));
629 if ((dev = nr_ax25_dev_get(nr_route.device)) == NULL)
630 return -EINVAL;
631 switch (nr_route.type) {
632 case NETROM_NODE:
633 return nr_del_node(&nr_route.callsign,
634 &nr_route.neighbour, dev);
635 case NETROM_NEIGH:
636 return nr_del_neigh(&nr_route.callsign,
637 dev, nr_route.quality);
638 default:
639 return -EINVAL;
640 }
641
642 case SIOCNRDECOBS:
643 return nr_dec_obs();
644
645 default:
646 return -EINVAL;
647 }
648
649 return 0;
650 }
651
652 /*
653 * A level 2 link has timed out, therefore it appears to be a poor link,
654 * then don't use that neighbour until it is reset.
655 */
656 void nr_link_failed(ax25_address *callsign, struct device *dev)
657 {
658 struct nr_neigh *nr_neigh;
659 struct nr_node *nr_node;
660
661 for (nr_neigh = nr_neigh_list; nr_neigh != NULL; nr_neigh = nr_neigh->next)
662 if (ax25cmp(&nr_neigh->callsign, callsign) == 0 && nr_neigh->dev == dev)
663 break;
664
665 if (nr_neigh == NULL) return;
666
667 if (++nr_neigh->failed < sysctl_netrom_link_fails_count) return;
668
669 for (nr_node = nr_node_list; nr_node != NULL; nr_node = nr_node->next)
670 if (nr_node->which < nr_node->count && nr_node->routes[nr_node->which].neighbour == nr_neigh)
671 nr_node->which++;
672 }
673
674 /*
675 * Route a frame to an appropriate AX.25 connection. A NULL ax25_cb
676 * indicates an internally generated frame.
677 */
678 int nr_route_frame(struct sk_buff *skb, ax25_cb *ax25)
679 {
680 ax25_address *nr_src, *nr_dest;
681 struct nr_neigh *nr_neigh;
682 struct nr_node *nr_node;
683 struct device *dev;
684 unsigned char *dptr;
685
686 if (ax25 != NULL && call_in_firewall(PF_NETROM, skb->dev, skb->data, NULL, &skb) != FW_ACCEPT)
687 return 0;
688
689 if (ax25 == NULL && call_out_firewall(PF_NETROM, skb->dev, skb->data, NULL, &skb) != FW_ACCEPT)
690 return 0;
691
692 nr_src = (ax25_address *)(skb->data + 0);
693 nr_dest = (ax25_address *)(skb->data + 7);
694
695 if (ax25 != NULL)
696 nr_add_node(nr_src, "", &ax25->dest_addr, ax25->digipeat,
697 ax25->ax25_dev->dev, 0, sysctl_netrom_obsolescence_count_initialiser);
698
699 if ((dev = nr_dev_get(nr_dest)) != NULL) /* Its for me */
700 return nr_rx_frame(skb, dev);
701
702 if (!sysctl_netrom_routing_control && ax25 != NULL)
703 return 0;
704
705 /* Its Time-To-Live has expired */
706 if (--skb->data[14] == 0)
707 return 0;
708
709 for (nr_node = nr_node_list; nr_node != NULL; nr_node = nr_node->next)
710 if (ax25cmp(nr_dest, &nr_node->callsign) == 0)
711 break;
712
713 if (nr_node == NULL || nr_node->which >= nr_node->count)
714 return 0;
715
716 nr_neigh = nr_node->routes[nr_node->which].neighbour;
717
718 if ((dev = nr_dev_first()) == NULL)
719 return 0;
720
721 if (ax25 != NULL && call_fw_firewall(PF_NETROM, skb->dev, skb->data, NULL, &skb) != FW_ACCEPT)
722 return 0;
723
724 dptr = skb_push(skb, 1);
725 *dptr = AX25_P_NETROM;
726
727 return ax25_send_frame(skb, 256, (ax25_address *)dev->dev_addr, &nr_neigh->callsign, nr_neigh->digipeat, nr_neigh->dev);
728 }
729
730 int nr_nodes_get_info(char *buffer, char **start, off_t offset,
731 int length, int dummy)
732 {
733 struct nr_node *nr_node;
734 int len = 0;
735 off_t pos = 0;
736 off_t begin = 0;
737 int i;
738
739 cli();
740
741 len += sprintf(buffer, "callsign mnemonic w n qual obs neigh qual obs neigh qual obs neigh\n");
742
743 for (nr_node = nr_node_list; nr_node != NULL; nr_node = nr_node->next) {
744 len += sprintf(buffer + len, "%-9s %-7s %d %d",
745 ax2asc(&nr_node->callsign),
746 (nr_node->mnemonic[0] == '\0') ? "*" : nr_node->mnemonic,
747 nr_node->which + 1,
748 nr_node->count);
749
750 for (i = 0; i < nr_node->count; i++) {
751 len += sprintf(buffer + len, " %3d %d %05d",
752 nr_node->routes[i].quality,
753 nr_node->routes[i].obs_count,
754 nr_node->routes[i].neighbour->number);
755 }
756
757 len += sprintf(buffer + len, "\n");
758
759 pos = begin + len;
760
761 if (pos < offset) {
762 len = 0;
763 begin = pos;
764 }
765
766 if (pos > offset + length)
767 break;
768 }
769
770 sti();
771
772 *start = buffer + (offset - begin);
773 len -= (offset - begin);
774
775 if (len > length) len = length;
776
777 return len;
778 }
779
780 int nr_neigh_get_info(char *buffer, char **start, off_t offset,
781 int length, int dummy)
782 {
783 struct nr_neigh *nr_neigh;
784 int len = 0;
785 off_t pos = 0;
786 off_t begin = 0;
787 int i;
788
789 cli();
790
791 len += sprintf(buffer, "addr callsign dev qual lock count failed digipeaters\n");
792
793 for (nr_neigh = nr_neigh_list; nr_neigh != NULL; nr_neigh = nr_neigh->next) {
794 len += sprintf(buffer + len, "%05d %-9s %-4s %3d %d %3d %3d",
795 nr_neigh->number,
796 ax2asc(&nr_neigh->callsign),
797 nr_neigh->dev ? nr_neigh->dev->name : "???",
798 nr_neigh->quality,
799 nr_neigh->locked,
800 nr_neigh->count,
801 nr_neigh->failed);
802
803 if (nr_neigh->digipeat != NULL) {
804 for (i = 0; i < nr_neigh->digipeat->ndigi; i++)
805 len += sprintf(buffer + len, " %s", ax2asc(&nr_neigh->digipeat->calls[i]));
806 }
807
808 len += sprintf(buffer + len, "\n");
809
810 pos = begin + len;
811
812 if (pos < offset) {
813 len = 0;
814 begin = pos;
815 }
816
817 if (pos > offset + length)
818 break;
819 }
820
821 sti();
822
823 *start = buffer + (offset - begin);
824 len -= (offset - begin);
825
826 if (len > length) len = length;
827
828 return len;
829 }
830
831 #ifdef MODULE
832
833 /*
834 * Free all memory associated with the nodes and routes lists.
835 */
836 void nr_rt_free(void)
837 {
838 struct nr_neigh *s, *nr_neigh = nr_neigh_list;
839 struct nr_node *t, *nr_node = nr_node_list;
840
841 while (nr_node != NULL) {
842 t = nr_node;
843 nr_node = nr_node->next;
844
845 nr_remove_node(t);
846 }
847
848 while (nr_neigh != NULL) {
849 s = nr_neigh;
850 nr_neigh = nr_neigh->next;
851
852 nr_remove_neigh(s);
853 }
854 }
855
856 #endif
857
858 #endif
Copy of Dave Jones history.git as used by http://archive.org/details/git-history-of-linux