?  search:
summary | log | graphiclog1 | graphiclog2 | commit | commitdiff | tree | refs | edit | fork
blame | history | raw | HEAD
Linux 2.6.32.12
[linux/fpc-iii.git] / net / rose / rose_route.c
blob08230fa6a502a96e65ece71ce4dc4ea0b51a4134
1 /*
2 * This program is free software; you can redistribute it and/or modify
3 * it under the terms of the GNU General Public License as published by
4 * the Free Software Foundation; either version 2 of the License, or
5 * (at your option) any later version.
6 *
7 * Copyright (C) Jonathan Naylor G4KLX (g4klx@g4klx.demon.co.uk)
8 * Copyright (C) Terry Dawson VK2KTJ (terry@animats.net)
9 */
10 #include <linux/errno.h>
11 #include <linux/types.h>
12 #include <linux/socket.h>
13 #include <linux/in.h>
14 #include <linux/kernel.h>
15 #include <linux/timer.h>
16 #include <linux/string.h>
17 #include <linux/sockios.h>
18 #include <linux/net.h>
19 #include <net/ax25.h>
20 #include <linux/inet.h>
21 #include <linux/netdevice.h>
22 #include <net/arp.h>
23 #include <linux/if_arp.h>
24 #include <linux/skbuff.h>
25 #include <net/sock.h>
26 #include <net/tcp_states.h>
27 #include <asm/system.h>
28 #include <asm/uaccess.h>
29 #include <linux/fcntl.h>
30 #include <linux/termios.h> /* For TIOCINQ/OUTQ */
31 #include <linux/mm.h>
32 #include <linux/interrupt.h>
33 #include <linux/notifier.h>
34 #include <linux/netfilter.h>
35 #include <linux/init.h>
36 #include <net/rose.h>
37 #include <linux/seq_file.h>
38
39 static unsigned int rose_neigh_no = 1;
40
41 static struct rose_node *rose_node_list;
42 static DEFINE_SPINLOCK(rose_node_list_lock);
43 static struct rose_neigh *rose_neigh_list;
44 static DEFINE_SPINLOCK(rose_neigh_list_lock);
45 static struct rose_route *rose_route_list;
46 static DEFINE_SPINLOCK(rose_route_list_lock);
47
48 struct rose_neigh *rose_loopback_neigh;
49
50 /*
51 * Add a new route to a node, and in the process add the node and the
52 * neighbour if it is new.
53 */
54 static int __must_check rose_add_node(struct rose_route_struct *rose_route,
55 struct net_device *dev)
56 {
57 struct rose_node *rose_node, *rose_tmpn, *rose_tmpp;
58 struct rose_neigh *rose_neigh;
59 int i, res = 0;
60
61 spin_lock_bh(&rose_node_list_lock);
62 spin_lock_bh(&rose_neigh_list_lock);
63
64 rose_node = rose_node_list;
65 while (rose_node != NULL) {
66 if ((rose_node->mask == rose_route->mask) &&
67 (rosecmpm(&rose_route->address, &rose_node->address,
68 rose_route->mask) == 0))
69 break;
70 rose_node = rose_node->next;
71 }
72
73 if (rose_node != NULL && rose_node->loopback) {
74 res = -EINVAL;
75 goto out;
76 }
77
78 rose_neigh = rose_neigh_list;
79 while (rose_neigh != NULL) {
80 if (ax25cmp(&rose_route->neighbour, &rose_neigh->callsign) == 0
81 && rose_neigh->dev == dev)
82 break;
83 rose_neigh = rose_neigh->next;
84 }
85
86 if (rose_neigh == NULL) {
87 rose_neigh = kmalloc(sizeof(*rose_neigh), GFP_ATOMIC);
88 if (rose_neigh == NULL) {
89 res = -ENOMEM;
90 goto out;
91 }
92
93 rose_neigh->callsign = rose_route->neighbour;
94 rose_neigh->digipeat = NULL;
95 rose_neigh->ax25 = NULL;
96 rose_neigh->dev = dev;
97 rose_neigh->count = 0;
98 rose_neigh->use = 0;
99 rose_neigh->dce_mode = 0;
100 rose_neigh->loopback = 0;
101 rose_neigh->number = rose_neigh_no++;
102 rose_neigh->restarted = 0;
103
104 skb_queue_head_init(&rose_neigh->queue);
105
106 init_timer(&rose_neigh->ftimer);
107 init_timer(&rose_neigh->t0timer);
108
109 if (rose_route->ndigis != 0) {
110 if ((rose_neigh->digipeat = kmalloc(sizeof(ax25_digi), GFP_KERNEL)) == NULL) {
111 kfree(rose_neigh);
112 res = -ENOMEM;
113 goto out;
114 }
115
116 rose_neigh->digipeat->ndigi = rose_route->ndigis;
117 rose_neigh->digipeat->lastrepeat = -1;
118
119 for (i = 0; i < rose_route->ndigis; i++) {
120 rose_neigh->digipeat->calls[i] =
121 rose_route->digipeaters[i];
122 rose_neigh->digipeat->repeated[i] = 0;
123 }
124 }
125
126 rose_neigh->next = rose_neigh_list;
127 rose_neigh_list = rose_neigh;
128 }
129
130 /*
131 * This is a new node to be inserted into the list. Find where it needs
132 * to be inserted into the list, and insert it. We want to be sure
133 * to order the list in descending order of mask size to ensure that
134 * later when we are searching this list the first match will be the
135 * best match.
136 */
137 if (rose_node == NULL) {
138 rose_tmpn = rose_node_list;
139 rose_tmpp = NULL;
140
141 while (rose_tmpn != NULL) {
142 if (rose_tmpn->mask > rose_route->mask) {
143 rose_tmpp = rose_tmpn;
144 rose_tmpn = rose_tmpn->next;
145 } else {
146 break;
147 }
148 }
149
150 /* create new node */
151 rose_node = kmalloc(sizeof(*rose_node), GFP_ATOMIC);
152 if (rose_node == NULL) {
153 res = -ENOMEM;
154 goto out;
155 }
156
157 rose_node->address = rose_route->address;
158 rose_node->mask = rose_route->mask;
159 rose_node->count = 1;
160 rose_node->loopback = 0;
161 rose_node->neighbour[0] = rose_neigh;
162
163 if (rose_tmpn == NULL) {
164 if (rose_tmpp == NULL) { /* Empty list */
165 rose_node_list = rose_node;
166 rose_node->next = NULL;
167 } else {
168 rose_tmpp->next = rose_node;
169 rose_node->next = NULL;
170 }
171 } else {
172 if (rose_tmpp == NULL) { /* 1st node */
173 rose_node->next = rose_node_list;
174 rose_node_list = rose_node;
175 } else {
176 rose_tmpp->next = rose_node;
177 rose_node->next = rose_tmpn;
178 }
179 }
180 rose_neigh->count++;
181
182 goto out;
183 }
184
185 /* We have space, slot it in */
186 if (rose_node->count < 3) {
187 rose_node->neighbour[rose_node->count] = rose_neigh;
188 rose_node->count++;
189 rose_neigh->count++;
190 }
191
192 out:
193 spin_unlock_bh(&rose_neigh_list_lock);
194 spin_unlock_bh(&rose_node_list_lock);
195
196 return res;
197 }
198
199 /*
200 * Caller is holding rose_node_list_lock.
201 */
202 static void rose_remove_node(struct rose_node *rose_node)
203 {
204 struct rose_node *s;
205
206 if ((s = rose_node_list) == rose_node) {
207 rose_node_list = rose_node->next;
208 kfree(rose_node);
209 return;
210 }
211
212 while (s != NULL && s->next != NULL) {
213 if (s->next == rose_node) {
214 s->next = rose_node->next;
215 kfree(rose_node);
216 return;
217 }
218
219 s = s->next;
220 }
221 }
222
223 /*
224 * Caller is holding rose_neigh_list_lock.
225 */
226 static void rose_remove_neigh(struct rose_neigh *rose_neigh)
227 {
228 struct rose_neigh *s;
229
230 rose_stop_ftimer(rose_neigh);
231 rose_stop_t0timer(rose_neigh);
232
233 skb_queue_purge(&rose_neigh->queue);
234
235 if ((s = rose_neigh_list) == rose_neigh) {
236 rose_neigh_list = rose_neigh->next;
237 if (rose_neigh->ax25)
238 ax25_cb_put(rose_neigh->ax25);
239 kfree(rose_neigh->digipeat);
240 kfree(rose_neigh);
241 return;
242 }
243
244 while (s != NULL && s->next != NULL) {
245 if (s->next == rose_neigh) {
246 s->next = rose_neigh->next;
247 if (rose_neigh->ax25)
248 ax25_cb_put(rose_neigh->ax25);
249 kfree(rose_neigh->digipeat);
250 kfree(rose_neigh);
251 return;
252 }
253
254 s = s->next;
255 }
256 }
257
258 /*
259 * Caller is holding rose_route_list_lock.
260 */
261 static void rose_remove_route(struct rose_route *rose_route)
262 {
263 struct rose_route *s;
264
265 if (rose_route->neigh1 != NULL)
266 rose_route->neigh1->use--;
267
268 if (rose_route->neigh2 != NULL)
269 rose_route->neigh2->use--;
270
271 if ((s = rose_route_list) == rose_route) {
272 rose_route_list = rose_route->next;
273 kfree(rose_route);
274 return;
275 }
276
277 while (s != NULL && s->next != NULL) {
278 if (s->next == rose_route) {
279 s->next = rose_route->next;
280 kfree(rose_route);
281 return;
282 }
283
284 s = s->next;
285 }
286 }
287
288 /*
289 * "Delete" a node. Strictly speaking remove a route to a node. The node
290 * is only deleted if no routes are left to it.
291 */
292 static int rose_del_node(struct rose_route_struct *rose_route,
293 struct net_device *dev)
294 {
295 struct rose_node *rose_node;
296 struct rose_neigh *rose_neigh;
297 int i, err = 0;
298
299 spin_lock_bh(&rose_node_list_lock);
300 spin_lock_bh(&rose_neigh_list_lock);
301
302 rose_node = rose_node_list;
303 while (rose_node != NULL) {
304 if ((rose_node->mask == rose_route->mask) &&
305 (rosecmpm(&rose_route->address, &rose_node->address,
306 rose_route->mask) == 0))
307 break;
308 rose_node = rose_node->next;
309 }
310
311 if (rose_node == NULL || rose_node->loopback) {
312 err = -EINVAL;
313 goto out;
314 }
315
316 rose_neigh = rose_neigh_list;
317 while (rose_neigh != NULL) {
318 if (ax25cmp(&rose_route->neighbour, &rose_neigh->callsign) == 0
319 && rose_neigh->dev == dev)
320 break;
321 rose_neigh = rose_neigh->next;
322 }
323
324 if (rose_neigh == NULL) {
325 err = -EINVAL;
326 goto out;
327 }
328
329 for (i = 0; i < rose_node->count; i++) {
330 if (rose_node->neighbour[i] == rose_neigh) {
331 rose_neigh->count--;
332
333 if (rose_neigh->count == 0 && rose_neigh->use == 0)
334 rose_remove_neigh(rose_neigh);
335
336 rose_node->count--;
337
338 if (rose_node->count == 0) {
339 rose_remove_node(rose_node);
340 } else {
341 switch (i) {
342 case 0:
343 rose_node->neighbour[0] =
344 rose_node->neighbour[1];
345 case 1:
346 rose_node->neighbour[1] =
347 rose_node->neighbour[2];
348 case 2:
349 break;
350 }
351 }
352 goto out;
353 }
354 }
355 err = -EINVAL;
356
357 out:
358 spin_unlock_bh(&rose_neigh_list_lock);
359 spin_unlock_bh(&rose_node_list_lock);
360
361 return err;
362 }
363
364 /*
365 * Add the loopback neighbour.
366 */
367 void rose_add_loopback_neigh(void)
368 {
369 struct rose_neigh *sn;
370
371 rose_loopback_neigh = kmalloc(sizeof(struct rose_neigh), GFP_KERNEL);
372 if (!rose_loopback_neigh)
373 return;
374 sn = rose_loopback_neigh;
375
376 sn->callsign = null_ax25_address;
377 sn->digipeat = NULL;
378 sn->ax25 = NULL;
379 sn->dev = NULL;
380 sn->count = 0;
381 sn->use = 0;
382 sn->dce_mode = 1;
383 sn->loopback = 1;
384 sn->number = rose_neigh_no++;
385 sn->restarted = 1;
386
387 skb_queue_head_init(&sn->queue);
388
389 init_timer(&sn->ftimer);
390 init_timer(&sn->t0timer);
391
392 spin_lock_bh(&rose_neigh_list_lock);
393 sn->next = rose_neigh_list;
394 rose_neigh_list = sn;
395 spin_unlock_bh(&rose_neigh_list_lock);
396 }
397
398 /*
399 * Add a loopback node.
400 */
401 int rose_add_loopback_node(rose_address *address)
402 {
403 struct rose_node *rose_node;
404 int err = 0;
405
406 spin_lock_bh(&rose_node_list_lock);
407
408 rose_node = rose_node_list;
409 while (rose_node != NULL) {
410 if ((rose_node->mask == 10) &&
411 (rosecmpm(address, &rose_node->address, 10) == 0) &&
412 rose_node->loopback)
413 break;
414 rose_node = rose_node->next;
415 }
416
417 if (rose_node != NULL)
418 goto out;
419
420 if ((rose_node = kmalloc(sizeof(*rose_node), GFP_ATOMIC)) == NULL) {
421 err = -ENOMEM;
422 goto out;
423 }
424
425 rose_node->address = *address;
426 rose_node->mask = 10;
427 rose_node->count = 1;
428 rose_node->loopback = 1;
429 rose_node->neighbour[0] = rose_loopback_neigh;
430
431 /* Insert at the head of list. Address is always mask=10 */
432 rose_node->next = rose_node_list;
433 rose_node_list = rose_node;
434
435 rose_loopback_neigh->count++;
436
437 out:
438 spin_unlock_bh(&rose_node_list_lock);
439
440 return err;
441 }
442
443 /*
444 * Delete a loopback node.
445 */
446 void rose_del_loopback_node(rose_address *address)
447 {
448 struct rose_node *rose_node;
449
450 spin_lock_bh(&rose_node_list_lock);
451
452 rose_node = rose_node_list;
453 while (rose_node != NULL) {
454 if ((rose_node->mask == 10) &&
455 (rosecmpm(address, &rose_node->address, 10) == 0) &&
456 rose_node->loopback)
457 break;
458 rose_node = rose_node->next;
459 }
460
461 if (rose_node == NULL)
462 goto out;
463
464 rose_remove_node(rose_node);
465
466 rose_loopback_neigh->count--;
467
468 out:
469 spin_unlock_bh(&rose_node_list_lock);
470 }
471
472 /*
473 * A device has been removed. Remove its routes and neighbours.
474 */
475 void rose_rt_device_down(struct net_device *dev)
476 {
477 struct rose_neigh *s, *rose_neigh;
478 struct rose_node *t, *rose_node;
479 int i;
480
481 spin_lock_bh(&rose_node_list_lock);
482 spin_lock_bh(&rose_neigh_list_lock);
483 rose_neigh = rose_neigh_list;
484 while (rose_neigh != NULL) {
485 s = rose_neigh;
486 rose_neigh = rose_neigh->next;
487
488 if (s->dev != dev)
489 continue;
490
491 rose_node = rose_node_list;
492
493 while (rose_node != NULL) {
494 t = rose_node;
495 rose_node = rose_node->next;
496
497 for (i = 0; i < t->count; i++) {
498 if (t->neighbour[i] != s)
499 continue;
500
501 t->count--;
502
503 switch (i) {
504 case 0:
505 t->neighbour[0] = t->neighbour[1];
506 case 1:
507 t->neighbour[1] = t->neighbour[2];
508 case 2:
509 break;
510 }
511 }
512
513 if (t->count <= 0)
514 rose_remove_node(t);
515 }
516
517 rose_remove_neigh(s);
518 }
519 spin_unlock_bh(&rose_neigh_list_lock);
520 spin_unlock_bh(&rose_node_list_lock);
521 }
522
523 #if 0 /* Currently unused */
524 /*
525 * A device has been removed. Remove its links.
526 */
527 void rose_route_device_down(struct net_device *dev)
528 {
529 struct rose_route *s, *rose_route;
530
531 spin_lock_bh(&rose_route_list_lock);
532 rose_route = rose_route_list;
533 while (rose_route != NULL) {
534 s = rose_route;
535 rose_route = rose_route->next;
536
537 if (s->neigh1->dev == dev || s->neigh2->dev == dev)
538 rose_remove_route(s);
539 }
540 spin_unlock_bh(&rose_route_list_lock);
541 }
542 #endif
543
544 /*
545 * Clear all nodes and neighbours out, except for neighbours with
546 * active connections going through them.
547 * Do not clear loopback neighbour and nodes.
548 */
549 static int rose_clear_routes(void)
550 {
551 struct rose_neigh *s, *rose_neigh;
552 struct rose_node *t, *rose_node;
553
554 spin_lock_bh(&rose_node_list_lock);
555 spin_lock_bh(&rose_neigh_list_lock);
556
557 rose_neigh = rose_neigh_list;
558 rose_node = rose_node_list;
559
560 while (rose_node != NULL) {
561 t = rose_node;
562 rose_node = rose_node->next;
563 if (!t->loopback)
564 rose_remove_node(t);
565 }
566
567 while (rose_neigh != NULL) {
568 s = rose_neigh;
569 rose_neigh = rose_neigh->next;
570
571 if (s->use == 0 && !s->loopback) {
572 s->count = 0;
573 rose_remove_neigh(s);
574 }
575 }
576
577 spin_unlock_bh(&rose_neigh_list_lock);
578 spin_unlock_bh(&rose_node_list_lock);
579
580 return 0;
581 }
582
583 /*
584 * Check that the device given is a valid AX.25 interface that is "up".
585 * called whith RTNL
586 */
587 static struct net_device *rose_ax25_dev_find(char *devname)
588 {
589 struct net_device *dev;
590
591 if ((dev = __dev_get_by_name(&init_net, devname)) == NULL)
592 return NULL;
593
594 if ((dev->flags & IFF_UP) && dev->type == ARPHRD_AX25)
595 return dev;
596
597 return NULL;
598 }
599
600 /*
601 * Find the first active ROSE device, usually "rose0".
602 */
603 struct net_device *rose_dev_first(void)
604 {
605 struct net_device *dev, *first = NULL;
606
607 read_lock(&dev_base_lock);
608 for_each_netdev(&init_net, dev) {
609 if ((dev->flags & IFF_UP) && dev->type == ARPHRD_ROSE)
610 if (first == NULL || strncmp(dev->name, first->name, 3) < 0)
611 first = dev;
612 }
613 read_unlock(&dev_base_lock);
614
615 return first;
616 }
617
618 /*
619 * Find the ROSE device for the given address.
620 */
621 struct net_device *rose_dev_get(rose_address *addr)
622 {
623 struct net_device *dev;
624
625 read_lock(&dev_base_lock);
626 for_each_netdev(&init_net, dev) {
627 if ((dev->flags & IFF_UP) && dev->type == ARPHRD_ROSE && rosecmp(addr, (rose_address *)dev->dev_addr) == 0) {
628 dev_hold(dev);
629 goto out;
630 }
631 }
632 dev = NULL;
633 out:
634 read_unlock(&dev_base_lock);
635 return dev;
636 }
637
638 static int rose_dev_exists(rose_address *addr)
639 {
640 struct net_device *dev;
641
642 read_lock(&dev_base_lock);
643 for_each_netdev(&init_net, dev) {
644 if ((dev->flags & IFF_UP) && dev->type == ARPHRD_ROSE && rosecmp(addr, (rose_address *)dev->dev_addr) == 0)
645 goto out;
646 }
647 dev = NULL;
648 out:
649 read_unlock(&dev_base_lock);
650 return dev != NULL;
651 }
652
653
654
655
656 struct rose_route *rose_route_free_lci(unsigned int lci, struct rose_neigh *neigh)
657 {
658 struct rose_route *rose_route;
659
660 for (rose_route = rose_route_list; rose_route != NULL; rose_route = rose_route->next)
661 if ((rose_route->neigh1 == neigh && rose_route->lci1 == lci) ||
662 (rose_route->neigh2 == neigh && rose_route->lci2 == lci))
663 return rose_route;
664
665 return NULL;
666 }
667
668 /*
669 * Find a neighbour or a route given a ROSE address.
670 */
671 struct rose_neigh *rose_get_neigh(rose_address *addr, unsigned char *cause,
672 unsigned char *diagnostic, int new)
673 {
674 struct rose_neigh *res = NULL;
675 struct rose_node *node;
676 int failed = 0;
677 int i;
678
679 if (!new) spin_lock_bh(&rose_node_list_lock);
680 for (node = rose_node_list; node != NULL; node = node->next) {
681 if (rosecmpm(addr, &node->address, node->mask) == 0) {
682 for (i = 0; i < node->count; i++) {
683 if (new) {
684 if (node->neighbour[i]->restarted) {
685 res = node->neighbour[i];
686 goto out;
687 }
688 }
689 else {
690 if (!rose_ftimer_running(node->neighbour[i])) {
691 res = node->neighbour[i];
692 goto out;
693 } else
694 failed = 1;
695 }
696 }
697 }
698 }
699
700 if (failed) {
701 *cause = ROSE_OUT_OF_ORDER;
702 *diagnostic = 0;
703 } else {
704 *cause = ROSE_NOT_OBTAINABLE;
705 *diagnostic = 0;
706 }
707
708 out:
709 if (!new) spin_unlock_bh(&rose_node_list_lock);
710
711 return res;
712 }
713
714 /*
715 * Handle the ioctls that control the routing functions.
716 */
717 int rose_rt_ioctl(unsigned int cmd, void __user *arg)
718 {
719 struct rose_route_struct rose_route;
720 struct net_device *dev;
721 int err;
722
723 switch (cmd) {
724 case SIOCADDRT:
725 if (copy_from_user(&rose_route, arg, sizeof(struct rose_route_struct)))
726 return -EFAULT;
727 if ((dev = rose_ax25_dev_find(rose_route.device)) == NULL)
728 return -EINVAL;
729 if (rose_dev_exists(&rose_route.address)) /* Can't add routes to ourself */
730 return -EINVAL;
731 if (rose_route.mask > 10) /* Mask can't be more than 10 digits */
732 return -EINVAL;
733 if (rose_route.ndigis > AX25_MAX_DIGIS)
734 return -EINVAL;
735 err = rose_add_node(&rose_route, dev);
736 return err;
737
738 case SIOCDELRT:
739 if (copy_from_user(&rose_route, arg, sizeof(struct rose_route_struct)))
740 return -EFAULT;
741 if ((dev = rose_ax25_dev_find(rose_route.device)) == NULL)
742 return -EINVAL;
743 err = rose_del_node(&rose_route, dev);
744 return err;
745
746 case SIOCRSCLRRT:
747 return rose_clear_routes();
748
749 default:
750 return -EINVAL;
751 }
752
753 return 0;
754 }
755
756 static void rose_del_route_by_neigh(struct rose_neigh *rose_neigh)
757 {
758 struct rose_route *rose_route, *s;
759
760 rose_neigh->restarted = 0;
761
762 rose_stop_t0timer(rose_neigh);
763 rose_start_ftimer(rose_neigh);
764
765 skb_queue_purge(&rose_neigh->queue);
766
767 spin_lock_bh(&rose_route_list_lock);
768
769 rose_route = rose_route_list;
770
771 while (rose_route != NULL) {
772 if ((rose_route->neigh1 == rose_neigh && rose_route->neigh2 == rose_neigh) ||
773 (rose_route->neigh1 == rose_neigh && rose_route->neigh2 == NULL) ||
774 (rose_route->neigh2 == rose_neigh && rose_route->neigh1 == NULL)) {
775 s = rose_route->next;
776 rose_remove_route(rose_route);
777 rose_route = s;
778 continue;
779 }
780
781 if (rose_route->neigh1 == rose_neigh) {
782 rose_route->neigh1->use--;
783 rose_route->neigh1 = NULL;
784 rose_transmit_clear_request(rose_route->neigh2, rose_route->lci2, ROSE_OUT_OF_ORDER, 0);
785 }
786
787 if (rose_route->neigh2 == rose_neigh) {
788 rose_route->neigh2->use--;
789 rose_route->neigh2 = NULL;
790 rose_transmit_clear_request(rose_route->neigh1, rose_route->lci1, ROSE_OUT_OF_ORDER, 0);
791 }
792
793 rose_route = rose_route->next;
794 }
795 spin_unlock_bh(&rose_route_list_lock);
796 }
797
798 /*
799 * A level 2 link has timed out, therefore it appears to be a poor link,
800 * then don't use that neighbour until it is reset. Blow away all through
801 * routes and connections using this route.
802 */
803 void rose_link_failed(ax25_cb *ax25, int reason)
804 {
805 struct rose_neigh *rose_neigh;
806
807 spin_lock_bh(&rose_neigh_list_lock);
808 rose_neigh = rose_neigh_list;
809 while (rose_neigh != NULL) {
810 if (rose_neigh->ax25 == ax25)
811 break;
812 rose_neigh = rose_neigh->next;
813 }
814
815 if (rose_neigh != NULL) {
816 rose_neigh->ax25 = NULL;
817 ax25_cb_put(ax25);
818
819 rose_del_route_by_neigh(rose_neigh);
820 rose_kill_by_neigh(rose_neigh);
821 }
822 spin_unlock_bh(&rose_neigh_list_lock);
823 }
824
825 /*
826 * A device has been "downed" remove its link status. Blow away all
827 * through routes and connections that use this device.
828 */
829 void rose_link_device_down(struct net_device *dev)
830 {
831 struct rose_neigh *rose_neigh;
832
833 for (rose_neigh = rose_neigh_list; rose_neigh != NULL; rose_neigh = rose_neigh->next) {
834 if (rose_neigh->dev == dev) {
835 rose_del_route_by_neigh(rose_neigh);
836 rose_kill_by_neigh(rose_neigh);
837 }
838 }
839 }
840
841 /*
842 * Route a frame to an appropriate AX.25 connection.
843 */
844 int rose_route_frame(struct sk_buff *skb, ax25_cb *ax25)
845 {
846 struct rose_neigh *rose_neigh, *new_neigh;
847 struct rose_route *rose_route;
848 struct rose_facilities_struct facilities;
849 rose_address *src_addr, *dest_addr;
850 struct sock *sk;
851 unsigned short frametype;
852 unsigned int lci, new_lci;
853 unsigned char cause, diagnostic;
854 struct net_device *dev;
855 int len, res = 0;
856 char buf[11];
857
858 #if 0
859 if (call_in_firewall(PF_ROSE, skb->dev, skb->data, NULL, &skb) != FW_ACCEPT)
860 return res;
861 #endif
862
863 frametype = skb->data[2];
864 lci = ((skb->data[0] << 8) & 0xF00) + ((skb->data[1] << 0) & 0x0FF);
865 src_addr = (rose_address *)(skb->data + 9);
866 dest_addr = (rose_address *)(skb->data + 4);
867
868 spin_lock_bh(&rose_neigh_list_lock);
869 spin_lock_bh(&rose_route_list_lock);
870
871 rose_neigh = rose_neigh_list;
872 while (rose_neigh != NULL) {
873 if (ax25cmp(&ax25->dest_addr, &rose_neigh->callsign) == 0 &&
874 ax25->ax25_dev->dev == rose_neigh->dev)
875 break;
876 rose_neigh = rose_neigh->next;
877 }
878
879 if (rose_neigh == NULL) {
880 printk("rose_route : unknown neighbour or device %s\n",
881 ax2asc(buf, &ax25->dest_addr));
882 goto out;
883 }
884
885 /*
886 * Obviously the link is working, halt the ftimer.
887 */
888 rose_stop_ftimer(rose_neigh);
889
890 /*
891 * LCI of zero is always for us, and its always a restart
892 * frame.
893 */
894 if (lci == 0) {
895 rose_link_rx_restart(skb, rose_neigh, frametype);
896 goto out;
897 }
898
899 /*
900 * Find an existing socket.
901 */
902 if ((sk = rose_find_socket(lci, rose_neigh)) != NULL) {
903 if (frametype == ROSE_CALL_REQUEST) {
904 struct rose_sock *rose = rose_sk(sk);
905
906 /* Remove an existing unused socket */
907 rose_clear_queues(sk);
908 rose->cause = ROSE_NETWORK_CONGESTION;
909 rose->diagnostic = 0;
910 rose->neighbour->use--;
911 rose->neighbour = NULL;
912 rose->lci = 0;
913 rose->state = ROSE_STATE_0;
914 sk->sk_state = TCP_CLOSE;
915 sk->sk_err = 0;
916 sk->sk_shutdown |= SEND_SHUTDOWN;
917 if (!sock_flag(sk, SOCK_DEAD)) {
918 sk->sk_state_change(sk);
919 sock_set_flag(sk, SOCK_DEAD);
920 }
921 }
922 else {
923 skb_reset_transport_header(skb);
924 res = rose_process_rx_frame(sk, skb);
925 goto out;
926 }
927 }
928
929 /*
930 * Is is a Call Request and is it for us ?
931 */
932 if (frametype == ROSE_CALL_REQUEST)
933 if ((dev = rose_dev_get(dest_addr)) != NULL) {
934 res = rose_rx_call_request(skb, dev, rose_neigh, lci);
935 dev_put(dev);
936 goto out;
937 }
938
939 if (!sysctl_rose_routing_control) {
940 rose_transmit_clear_request(rose_neigh, lci, ROSE_NOT_OBTAINABLE, 0);
941 goto out;
942 }
943
944 /*
945 * Route it to the next in line if we have an entry for it.
946 */
947 rose_route = rose_route_list;
948 while (rose_route != NULL) {
949 if (rose_route->lci1 == lci &&
950 rose_route->neigh1 == rose_neigh) {
951 if (frametype == ROSE_CALL_REQUEST) {
952 /* F6FBB - Remove an existing unused route */
953 rose_remove_route(rose_route);
954 break;
955 } else if (rose_route->neigh2 != NULL) {
956 skb->data[0] &= 0xF0;
957 skb->data[0] |= (rose_route->lci2 >> 8) & 0x0F;
958 skb->data[1] = (rose_route->lci2 >> 0) & 0xFF;
959 rose_transmit_link(skb, rose_route->neigh2);
960 if (frametype == ROSE_CLEAR_CONFIRMATION)
961 rose_remove_route(rose_route);
962 res = 1;
963 goto out;
964 } else {
965 if (frametype == ROSE_CLEAR_CONFIRMATION)
966 rose_remove_route(rose_route);
967 goto out;
968 }
969 }
970 if (rose_route->lci2 == lci &&
971 rose_route->neigh2 == rose_neigh) {
972 if (frametype == ROSE_CALL_REQUEST) {
973 /* F6FBB - Remove an existing unused route */
974 rose_remove_route(rose_route);
975 break;
976 } else if (rose_route->neigh1 != NULL) {
977 skb->data[0] &= 0xF0;
978 skb->data[0] |= (rose_route->lci1 >> 8) & 0x0F;
979 skb->data[1] = (rose_route->lci1 >> 0) & 0xFF;
980 rose_transmit_link(skb, rose_route->neigh1);
981 if (frametype == ROSE_CLEAR_CONFIRMATION)
982 rose_remove_route(rose_route);
983 res = 1;
984 goto out;
985 } else {
986 if (frametype == ROSE_CLEAR_CONFIRMATION)
987 rose_remove_route(rose_route);
988 goto out;
989 }
990 }
991 rose_route = rose_route->next;
992 }
993
994 /*
995 * We know that:
996 * 1. The frame isn't for us,
997 * 2. It isn't "owned" by any existing route.
998 */
999 if (frametype != ROSE_CALL_REQUEST) { /* XXX */
1000 res = 0;
1001 goto out;
1002 }
1003
1004 len = (((skb->data[3] >> 4) & 0x0F) + 1) >> 1;
1005 len += (((skb->data[3] >> 0) & 0x0F) + 1) >> 1;
1006
1007 memset(&facilities, 0x00, sizeof(struct rose_facilities_struct));
1008
1009 if (!rose_parse_facilities(skb->data + len + 4, &facilities)) {
1010 rose_transmit_clear_request(rose_neigh, lci, ROSE_INVALID_FACILITY, 76);
1011 goto out;
1012 }
1013
1014 /*
1015 * Check for routing loops.
1016 */
1017 rose_route = rose_route_list;
1018 while (rose_route != NULL) {
1019 if (rose_route->rand == facilities.rand &&
1020 rosecmp(src_addr, &rose_route->src_addr) == 0 &&
1021 ax25cmp(&facilities.dest_call, &rose_route->src_call) == 0 &&
1022 ax25cmp(&facilities.source_call, &rose_route->dest_call) == 0) {
1023 rose_transmit_clear_request(rose_neigh, lci, ROSE_NOT_OBTAINABLE, 120);
1024 goto out;
1025 }
1026 rose_route = rose_route->next;
1027 }
1028
1029 if ((new_neigh = rose_get_neigh(dest_addr, &cause, &diagnostic, 1)) == NULL) {
1030 rose_transmit_clear_request(rose_neigh, lci, cause, diagnostic);
1031 goto out;
1032 }
1033
1034 if ((new_lci = rose_new_lci(new_neigh)) == 0) {
1035 rose_transmit_clear_request(rose_neigh, lci, ROSE_NETWORK_CONGESTION, 71);
1036 goto out;
1037 }
1038
1039 if ((rose_route = kmalloc(sizeof(*rose_route), GFP_ATOMIC)) == NULL) {
1040 rose_transmit_clear_request(rose_neigh, lci, ROSE_NETWORK_CONGESTION, 120);
1041 goto out;
1042 }
1043
1044 rose_route->lci1 = lci;
1045 rose_route->src_addr = *src_addr;
1046 rose_route->dest_addr = *dest_addr;
1047 rose_route->src_call = facilities.dest_call;
1048 rose_route->dest_call = facilities.source_call;
1049 rose_route->rand = facilities.rand;
1050 rose_route->neigh1 = rose_neigh;
1051 rose_route->lci2 = new_lci;
1052 rose_route->neigh2 = new_neigh;
1053
1054 rose_route->neigh1->use++;
1055 rose_route->neigh2->use++;
1056
1057 rose_route->next = rose_route_list;
1058 rose_route_list = rose_route;
1059
1060 skb->data[0] &= 0xF0;
1061 skb->data[0] |= (rose_route->lci2 >> 8) & 0x0F;
1062 skb->data[1] = (rose_route->lci2 >> 0) & 0xFF;
1063
1064 rose_transmit_link(skb, rose_route->neigh2);
1065 res = 1;
1066
1067 out:
1068 spin_unlock_bh(&rose_route_list_lock);
1069 spin_unlock_bh(&rose_neigh_list_lock);
1070
1071 return res;
1072 }
1073
1074 #ifdef CONFIG_PROC_FS
1075
1076 static void *rose_node_start(struct seq_file *seq, loff_t *pos)
1077 __acquires(rose_node_list_lock)
1078 {
1079 struct rose_node *rose_node;
1080 int i = 1;
1081
1082 spin_lock_bh(&rose_node_list_lock);
1083 if (*pos == 0)
1084 return SEQ_START_TOKEN;
1085
1086 for (rose_node = rose_node_list; rose_node && i < *pos;
1087 rose_node = rose_node->next, ++i);
1088
1089 return (i == *pos) ? rose_node : NULL;
1090 }
1091
1092 static void *rose_node_next(struct seq_file *seq, void *v, loff_t *pos)
1093 {
1094 ++*pos;
1095
1096 return (v == SEQ_START_TOKEN) ? rose_node_list
1097 : ((struct rose_node *)v)->next;
1098 }
1099
1100 static void rose_node_stop(struct seq_file *seq, void *v)
1101 __releases(rose_node_list_lock)
1102 {
1103 spin_unlock_bh(&rose_node_list_lock);
1104 }
1105
1106 static int rose_node_show(struct seq_file *seq, void *v)
1107 {
1108 char rsbuf[11];
1109 int i;
1110
1111 if (v == SEQ_START_TOKEN)
1112 seq_puts(seq, "address mask n neigh neigh neigh\n");
1113 else {
1114 const struct rose_node *rose_node = v;
1115 /* if (rose_node->loopback) {
1116 seq_printf(seq, "%-10s %04d 1 loopback\n",
1117 rose2asc(rsbuf, &rose_node->address),
1118 rose_node->mask);
1119 } else { */
1120 seq_printf(seq, "%-10s %04d %d",
1121 rose2asc(rsbuf, &rose_node->address),
1122 rose_node->mask,
1123 rose_node->count);
1124
1125 for (i = 0; i < rose_node->count; i++)
1126 seq_printf(seq, " %05d",
1127 rose_node->neighbour[i]->number);
1128
1129 seq_puts(seq, "\n");
1130 /* } */
1131 }
1132 return 0;
1133 }
1134
1135 static const struct seq_operations rose_node_seqops = {
1136 .start = rose_node_start,
1137 .next = rose_node_next,
1138 .stop = rose_node_stop,
1139 .show = rose_node_show,
1140 };
1141
1142 static int rose_nodes_open(struct inode *inode, struct file *file)
1143 {
1144 return seq_open(file, &rose_node_seqops);
1145 }
1146
1147 const struct file_operations rose_nodes_fops = {
1148 .owner = THIS_MODULE,
1149 .open = rose_nodes_open,
1150 .read = seq_read,
1151 .llseek = seq_lseek,
1152 .release = seq_release,
1153 };
1154
1155 static void *rose_neigh_start(struct seq_file *seq, loff_t *pos)
1156 __acquires(rose_neigh_list_lock)
1157 {
1158 struct rose_neigh *rose_neigh;
1159 int i = 1;
1160
1161 spin_lock_bh(&rose_neigh_list_lock);
1162 if (*pos == 0)
1163 return SEQ_START_TOKEN;
1164
1165 for (rose_neigh = rose_neigh_list; rose_neigh && i < *pos;
1166 rose_neigh = rose_neigh->next, ++i);
1167
1168 return (i == *pos) ? rose_neigh : NULL;
1169 }
1170
1171 static void *rose_neigh_next(struct seq_file *seq, void *v, loff_t *pos)
1172 {
1173 ++*pos;
1174
1175 return (v == SEQ_START_TOKEN) ? rose_neigh_list
1176 : ((struct rose_neigh *)v)->next;
1177 }
1178
1179 static void rose_neigh_stop(struct seq_file *seq, void *v)
1180 __releases(rose_neigh_list_lock)
1181 {
1182 spin_unlock_bh(&rose_neigh_list_lock);
1183 }
1184
1185 static int rose_neigh_show(struct seq_file *seq, void *v)
1186 {
1187 char buf[11];
1188 int i;
1189
1190 if (v == SEQ_START_TOKEN)
1191 seq_puts(seq,
1192 "addr callsign dev count use mode restart t0 tf digipeaters\n");
1193 else {
1194 struct rose_neigh *rose_neigh = v;
1195
1196 /* if (!rose_neigh->loopback) { */
1197 seq_printf(seq, "%05d %-9s %-4s %3d %3d %3s %3s %3lu %3lu",
1198 rose_neigh->number,
1199 (rose_neigh->loopback) ? "RSLOOP-0" : ax2asc(buf, &rose_neigh->callsign),
1200 rose_neigh->dev ? rose_neigh->dev->name : "???",
1201 rose_neigh->count,
1202 rose_neigh->use,
1203 (rose_neigh->dce_mode) ? "DCE" : "DTE",
1204 (rose_neigh->restarted) ? "yes" : "no",
1205 ax25_display_timer(&rose_neigh->t0timer) / HZ,
1206 ax25_display_timer(&rose_neigh->ftimer) / HZ);
1207
1208 if (rose_neigh->digipeat != NULL) {
1209 for (i = 0; i < rose_neigh->digipeat->ndigi; i++)
1210 seq_printf(seq, " %s", ax2asc(buf, &rose_neigh->digipeat->calls[i]));
1211 }
1212
1213 seq_puts(seq, "\n");
1214 }
1215 return 0;
1216 }
1217
1218
1219 static const struct seq_operations rose_neigh_seqops = {
1220 .start = rose_neigh_start,
1221 .next = rose_neigh_next,
1222 .stop = rose_neigh_stop,
1223 .show = rose_neigh_show,
1224 };
1225
1226 static int rose_neigh_open(struct inode *inode, struct file *file)
1227 {
1228 return seq_open(file, &rose_neigh_seqops);
1229 }
1230
1231 const struct file_operations rose_neigh_fops = {
1232 .owner = THIS_MODULE,
1233 .open = rose_neigh_open,
1234 .read = seq_read,
1235 .llseek = seq_lseek,
1236 .release = seq_release,
1237 };
1238
1239
1240 static void *rose_route_start(struct seq_file *seq, loff_t *pos)
1241 __acquires(rose_route_list_lock)
1242 {
1243 struct rose_route *rose_route;
1244 int i = 1;
1245
1246 spin_lock_bh(&rose_route_list_lock);
1247 if (*pos == 0)
1248 return SEQ_START_TOKEN;
1249
1250 for (rose_route = rose_route_list; rose_route && i < *pos;
1251 rose_route = rose_route->next, ++i);
1252
1253 return (i == *pos) ? rose_route : NULL;
1254 }
1255
1256 static void *rose_route_next(struct seq_file *seq, void *v, loff_t *pos)
1257 {
1258 ++*pos;
1259
1260 return (v == SEQ_START_TOKEN) ? rose_route_list
1261 : ((struct rose_route *)v)->next;
1262 }
1263
1264 static void rose_route_stop(struct seq_file *seq, void *v)
1265 __releases(rose_route_list_lock)
1266 {
1267 spin_unlock_bh(&rose_route_list_lock);
1268 }
1269
1270 static int rose_route_show(struct seq_file *seq, void *v)
1271 {
1272 char buf[11], rsbuf[11];
1273
1274 if (v == SEQ_START_TOKEN)
1275 seq_puts(seq,
1276 "lci address callsign neigh <-> lci address callsign neigh\n");
1277 else {
1278 struct rose_route *rose_route = v;
1279
1280 if (rose_route->neigh1)
1281 seq_printf(seq,
1282 "%3.3X %-10s %-9s %05d ",
1283 rose_route->lci1,
1284 rose2asc(rsbuf, &rose_route->src_addr),
1285 ax2asc(buf, &rose_route->src_call),
1286 rose_route->neigh1->number);
1287 else
1288 seq_puts(seq,
1289 "000 * * 00000 ");
1290
1291 if (rose_route->neigh2)
1292 seq_printf(seq,
1293 "%3.3X %-10s %-9s %05d\n",
1294 rose_route->lci2,
1295 rose2asc(rsbuf, &rose_route->dest_addr),
1296 ax2asc(buf, &rose_route->dest_call),
1297 rose_route->neigh2->number);
1298 else
1299 seq_puts(seq,
1300 "000 * * 00000\n");
1301 }
1302 return 0;
1303 }
1304
1305 static const struct seq_operations rose_route_seqops = {
1306 .start = rose_route_start,
1307 .next = rose_route_next,
1308 .stop = rose_route_stop,
1309 .show = rose_route_show,
1310 };
1311
1312 static int rose_route_open(struct inode *inode, struct file *file)
1313 {
1314 return seq_open(file, &rose_route_seqops);
1315 }
1316
1317 const struct file_operations rose_routes_fops = {
1318 .owner = THIS_MODULE,
1319 .open = rose_route_open,
1320 .read = seq_read,
1321 .llseek = seq_lseek,
1322 .release = seq_release,
1323 };
1324
1325 #endif /* CONFIG_PROC_FS */
1326
1327 /*
1328 * Release all memory associated with ROSE routing structures.
1329 */
1330 void __exit rose_rt_free(void)
1331 {
1332 struct rose_neigh *s, *rose_neigh = rose_neigh_list;
1333 struct rose_node *t, *rose_node = rose_node_list;
1334 struct rose_route *u, *rose_route = rose_route_list;
1335
1336 while (rose_neigh != NULL) {
1337 s = rose_neigh;
1338 rose_neigh = rose_neigh->next;
1339
1340 rose_remove_neigh(s);
1341 }
1342
1343 while (rose_node != NULL) {
1344 t = rose_node;
1345 rose_node = rose_node->next;
1346
1347 rose_remove_node(t);
1348 }
1349
1350 while (rose_route != NULL) {
1351 u = rose_route;
1352 rose_route = rose_route->next;
1353
1354 rose_remove_route(u);
1355 }
1356 }
Linux with added FPC-III support