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