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.
7 * Copyright (C) Jonathan Naylor G4KLX (g4klx@g4klx.demon.co.uk)
8 * Copyright (C) Terry Dawson VK2KTJ (terry@animats.net)
10 #include <linux/errno.h>
11 #include <linux/types.h>
12 #include <linux/socket.h>
14 #include <linux/kernel.h>
15 #include <linux/sched.h>
16 #include <linux/timer.h>
17 #include <linux/string.h>
18 #include <linux/sockios.h>
19 #include <linux/net.h>
21 #include <linux/inet.h>
22 #include <linux/netdevice.h>
24 #include <linux/if_arp.h>
25 #include <linux/skbuff.h>
28 #include <asm/system.h>
29 #include <asm/uaccess.h>
30 #include <linux/fcntl.h>
31 #include <linux/termios.h> /* For TIOCINQ/OUTQ */
33 #include <linux/interrupt.h>
34 #include <linux/notifier.h>
35 #include <linux/netfilter.h>
36 #include <linux/init.h>
38 #include <linux/seq_file.h>
40 static unsigned int rose_neigh_no = 1;
42 static struct rose_node *rose_node_list;
43 static spinlock_t rose_node_list_lock = SPIN_LOCK_UNLOCKED;
44 struct rose_neigh *rose_neigh_list;
45 static spinlock_t rose_neigh_list_lock = SPIN_LOCK_UNLOCKED;
46 static struct rose_route *rose_route_list;
47 static spinlock_t rose_route_list_lock = SPIN_LOCK_UNLOCKED;
49 struct rose_neigh *rose_loopback_neigh;
51 static void rose_remove_neigh(struct rose_neigh *);
54 * Add a new route to a node, and in the process add the node and the
55 * neighbour if it is new.
57 static int rose_add_node(struct rose_route_struct *rose_route,
58 struct net_device *dev)
60 struct rose_node *rose_node, *rose_tmpn, *rose_tmpp;
61 struct rose_neigh *rose_neigh;
64 spin_lock_bh(&rose_node_list_lock);
65 spin_lock_bh(&rose_neigh_list_lock);
67 rose_node = rose_node_list;
68 while (rose_node != NULL) {
69 if ((rose_node->mask == rose_route->mask) &&
70 (rosecmpm(&rose_route->address, &rose_node->address,
71 rose_route->mask) == 0))
73 rose_node = rose_node->next;
76 if (rose_node != NULL && rose_node->loopback) {
81 rose_neigh = rose_neigh_list;
82 while (rose_neigh != NULL) {
83 if (ax25cmp(&rose_route->neighbour, &rose_neigh->callsign) == 0
84 && rose_neigh->dev == dev)
86 rose_neigh = rose_neigh->next;
89 if (rose_neigh == NULL) {
90 rose_neigh = kmalloc(sizeof(*rose_neigh), GFP_ATOMIC);
91 if (rose_neigh == NULL) {
96 rose_neigh->callsign = rose_route->neighbour;
97 rose_neigh->digipeat = NULL;
98 rose_neigh->ax25 = NULL;
99 rose_neigh->dev = dev;
100 rose_neigh->count = 0;
102 rose_neigh->dce_mode = 0;
103 rose_neigh->loopback = 0;
104 rose_neigh->number = rose_neigh_no++;
105 rose_neigh->restarted = 0;
107 skb_queue_head_init(&rose_neigh->queue);
109 init_timer(&rose_neigh->ftimer);
110 init_timer(&rose_neigh->t0timer);
112 if (rose_route->ndigis != 0) {
113 if ((rose_neigh->digipeat = kmalloc(sizeof(ax25_digi), GFP_KERNEL)) == NULL) {
119 rose_neigh->digipeat->ndigi = rose_route->ndigis;
120 rose_neigh->digipeat->lastrepeat = -1;
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;
129 rose_neigh->next = rose_neigh_list;
130 rose_neigh_list = rose_neigh;
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
140 if (rose_node == NULL) {
141 rose_tmpn = rose_node_list;
144 while (rose_tmpn != NULL) {
145 if (rose_tmpn->mask > rose_route->mask) {
146 rose_tmpp = rose_tmpn;
147 rose_tmpn = rose_tmpn->next;
153 /* create new node */
154 rose_node = kmalloc(sizeof(*rose_node), GFP_ATOMIC);
155 if (rose_node == NULL) {
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;
166 if (rose_tmpn == NULL) {
167 if (rose_tmpp == NULL) { /* Empty list */
168 rose_node_list = rose_node;
169 rose_node->next = NULL;
171 rose_tmpp->next = rose_node;
172 rose_node->next = NULL;
175 if (rose_tmpp == NULL) { /* 1st node */
176 rose_node->next = rose_node_list;
177 rose_node_list = rose_node;
179 rose_tmpp->next = rose_node;
180 rose_node->next = rose_tmpn;
188 /* We have space, slot it in */
189 if (rose_node->count < 3) {
190 rose_node->neighbour[rose_node->count] = rose_neigh;
196 spin_unlock_bh(&rose_neigh_list_lock);
197 spin_unlock_bh(&rose_node_list_lock);
203 * Caller is holding rose_node_list_lock.
205 static void rose_remove_node(struct rose_node *rose_node)
209 spin_lock_bh(&rose_node_list_lock);
210 if ((s = rose_node_list) == rose_node) {
211 rose_node_list = rose_node->next;
216 while (s != NULL && s->next != NULL) {
217 if (s->next == rose_node) {
218 s->next = rose_node->next;
228 * Caller is holding rose_neigh_list_lock.
230 static void rose_remove_neigh(struct rose_neigh *rose_neigh)
232 struct rose_neigh *s;
234 rose_stop_ftimer(rose_neigh);
235 rose_stop_t0timer(rose_neigh);
237 skb_queue_purge(&rose_neigh->queue);
239 spin_lock_bh(&rose_neigh_list_lock);
241 if ((s = rose_neigh_list) == rose_neigh) {
242 rose_neigh_list = rose_neigh->next;
243 spin_unlock_bh(&rose_neigh_list_lock);
244 if (rose_neigh->digipeat != NULL)
245 kfree(rose_neigh->digipeat);
250 while (s != NULL && s->next != NULL) {
251 if (s->next == rose_neigh) {
252 s->next = rose_neigh->next;
253 spin_unlock_bh(&rose_neigh_list_lock);
254 if (rose_neigh->digipeat != NULL)
255 kfree(rose_neigh->digipeat);
262 spin_unlock_bh(&rose_neigh_list_lock);
266 * Caller is holding rose_route_list_lock.
268 static void rose_remove_route(struct rose_route *rose_route)
270 struct rose_route *s;
272 if (rose_route->neigh1 != NULL)
273 rose_route->neigh1->use--;
275 if (rose_route->neigh2 != NULL)
276 rose_route->neigh2->use--;
278 if ((s = rose_route_list) == rose_route) {
279 rose_route_list = rose_route->next;
284 while (s != NULL && s->next != NULL) {
285 if (s->next == rose_route) {
286 s->next = rose_route->next;
296 * "Delete" a node. Strictly speaking remove a route to a node. The node
297 * is only deleted if no routes are left to it.
299 static int rose_del_node(struct rose_route_struct *rose_route,
300 struct net_device *dev)
302 struct rose_node *rose_node;
303 struct rose_neigh *rose_neigh;
306 spin_lock_bh(&rose_node_list_lock);
307 spin_lock_bh(&rose_neigh_list_lock);
309 rose_node = rose_node_list;
310 while (rose_node != NULL) {
311 if ((rose_node->mask == rose_route->mask) &&
312 (rosecmpm(&rose_route->address, &rose_node->address,
313 rose_route->mask) == 0))
315 rose_node = rose_node->next;
318 if (rose_node == NULL || rose_node->loopback) {
323 rose_neigh = rose_neigh_list;
324 while (rose_neigh != NULL) {
325 if (ax25cmp(&rose_route->neighbour, &rose_neigh->callsign) == 0
326 && rose_neigh->dev == dev)
328 rose_neigh = rose_neigh->next;
331 if (rose_neigh == NULL) {
336 for (i = 0; i < rose_node->count; i++) {
337 if (rose_node->neighbour[i] == rose_neigh) {
340 if (rose_neigh->count == 0 && rose_neigh->use == 0)
341 rose_remove_neigh(rose_neigh);
345 if (rose_node->count == 0) {
346 rose_remove_node(rose_node);
350 rose_node->neighbour[0] =
351 rose_node->neighbour[1];
353 rose_node->neighbour[1] =
354 rose_node->neighbour[2];
365 spin_unlock_bh(&rose_neigh_list_lock);
366 spin_unlock_bh(&rose_node_list_lock);
372 * Add the loopback neighbour.
374 int rose_add_loopback_neigh(void)
376 if ((rose_loopback_neigh = kmalloc(sizeof(struct rose_neigh), GFP_ATOMIC)) == NULL)
379 rose_loopback_neigh->callsign = null_ax25_address;
380 rose_loopback_neigh->digipeat = NULL;
381 rose_loopback_neigh->ax25 = NULL;
382 rose_loopback_neigh->dev = NULL;
383 rose_loopback_neigh->count = 0;
384 rose_loopback_neigh->use = 0;
385 rose_loopback_neigh->dce_mode = 1;
386 rose_loopback_neigh->loopback = 1;
387 rose_loopback_neigh->number = rose_neigh_no++;
388 rose_loopback_neigh->restarted = 1;
390 skb_queue_head_init(&rose_loopback_neigh->queue);
392 init_timer(&rose_loopback_neigh->ftimer);
393 init_timer(&rose_loopback_neigh->t0timer);
395 spin_lock_bh(&rose_neigh_list_lock);
396 rose_loopback_neigh->next = rose_neigh_list;
397 rose_neigh_list = rose_loopback_neigh;
398 spin_unlock_bh(&rose_neigh_list_lock);
404 * Add a loopback node.
406 int rose_add_loopback_node(rose_address *address)
408 struct rose_node *rose_node;
409 unsigned int err = 0;
411 spin_lock_bh(&rose_node_list_lock);
413 rose_node = rose_node_list;
414 while (rose_node != NULL) {
415 if ((rose_node->mask == 10) &&
416 (rosecmpm(address, &rose_node->address, 10) == 0) &&
419 rose_node = rose_node->next;
422 if (rose_node != NULL)
425 if ((rose_node = kmalloc(sizeof(*rose_node), GFP_ATOMIC)) == NULL) {
430 rose_node->address = *address;
431 rose_node->mask = 10;
432 rose_node->count = 1;
433 rose_node->loopback = 1;
434 rose_node->neighbour[0] = rose_loopback_neigh;
436 /* Insert at the head of list. Address is always mask=10 */
437 rose_node->next = rose_node_list;
438 rose_node_list = rose_node;
440 rose_loopback_neigh->count++;
443 spin_unlock_bh(&rose_node_list_lock);
449 * Delete a loopback node.
451 void rose_del_loopback_node(rose_address *address)
453 struct rose_node *rose_node;
455 spin_lock_bh(&rose_node_list_lock);
457 rose_node = rose_node_list;
458 while (rose_node != NULL) {
459 if ((rose_node->mask == 10) &&
460 (rosecmpm(address, &rose_node->address, 10) == 0) &&
463 rose_node = rose_node->next;
466 if (rose_node == NULL)
469 rose_remove_node(rose_node);
471 rose_loopback_neigh->count--;
474 spin_unlock_bh(&rose_node_list_lock);
478 * A device has been removed. Remove its routes and neighbours.
480 void rose_rt_device_down(struct net_device *dev)
482 struct rose_neigh *s, *rose_neigh;
483 struct rose_node *t, *rose_node;
486 spin_lock_bh(&rose_node_list_lock);
487 spin_lock_bh(&rose_neigh_list_lock);
488 rose_neigh = rose_neigh_list;
489 while (rose_neigh != NULL) {
491 rose_neigh = rose_neigh->next;
496 rose_node = rose_node_list;
498 while (rose_node != NULL) {
500 rose_node = rose_node->next;
502 for (i = 0; i < t->count; i++) {
503 if (t->neighbour[i] != s)
510 t->neighbour[0] = t->neighbour[1];
512 t->neighbour[1] = t->neighbour[2];
522 rose_remove_neigh(s);
524 spin_unlock_bh(&rose_neigh_list_lock);
525 spin_unlock_bh(&rose_node_list_lock);
528 #if 0 /* Currently unused */
530 * A device has been removed. Remove its links.
532 void rose_route_device_down(struct net_device *dev)
534 struct rose_route *s, *rose_route;
536 spin_lock_bh(&rose_route_list_lock);
537 rose_route = rose_route_list;
538 while (rose_route != NULL) {
540 rose_route = rose_route->next;
542 if (s->neigh1->dev == dev || s->neigh2->dev == dev)
543 rose_remove_route(s);
545 spin_unlock_bh(&rose_route_list_lock);
550 * Clear all nodes and neighbours out, except for neighbours with
551 * active connections going through them.
552 * Do not clear loopback neighbour and nodes.
554 static int rose_clear_routes(void)
556 struct rose_neigh *s, *rose_neigh;
557 struct rose_node *t, *rose_node;
559 spin_lock_bh(&rose_node_list_lock);
560 spin_lock_bh(&rose_neigh_list_lock);
562 rose_neigh = rose_neigh_list;
563 rose_node = rose_node_list;
565 while (rose_node != NULL) {
567 rose_node = rose_node->next;
572 while (rose_neigh != NULL) {
574 rose_neigh = rose_neigh->next;
576 if (s->use == 0 && !s->loopback) {
578 rose_remove_neigh(s);
582 spin_unlock_bh(&rose_neigh_list_lock);
583 spin_unlock_bh(&rose_node_list_lock);
589 * Check that the device given is a valid AX.25 interface that is "up".
591 struct net_device *rose_ax25_dev_get(char *devname)
593 struct net_device *dev;
595 if ((dev = dev_get_by_name(devname)) == NULL)
598 if ((dev->flags & IFF_UP) && dev->type == ARPHRD_AX25)
606 * Find the first active ROSE device, usually "rose0".
608 struct net_device *rose_dev_first(void)
610 struct net_device *dev, *first = NULL;
612 read_lock(&dev_base_lock);
613 for (dev = dev_base; dev != NULL; dev = dev->next) {
614 if ((dev->flags & IFF_UP) && dev->type == ARPHRD_ROSE)
615 if (first == NULL || strncmp(dev->name, first->name, 3) < 0)
618 read_unlock(&dev_base_lock);
624 * Find the ROSE device for the given address.
626 struct net_device *rose_dev_get(rose_address *addr)
628 struct net_device *dev;
630 read_lock(&dev_base_lock);
631 for (dev = dev_base; dev != NULL; dev = dev->next) {
632 if ((dev->flags & IFF_UP) && dev->type == ARPHRD_ROSE && rosecmp(addr, (rose_address *)dev->dev_addr) == 0) {
638 read_unlock(&dev_base_lock);
642 static int rose_dev_exists(rose_address *addr)
644 struct net_device *dev;
646 read_lock(&dev_base_lock);
647 for (dev = dev_base; dev != NULL; dev = dev->next) {
648 if ((dev->flags & IFF_UP) && dev->type == ARPHRD_ROSE && rosecmp(addr, (rose_address *)dev->dev_addr) == 0)
652 read_unlock(&dev_base_lock);
659 struct rose_route *rose_route_free_lci(unsigned int lci, struct rose_neigh *neigh)
661 struct rose_route *rose_route;
663 for (rose_route = rose_route_list; rose_route != NULL; rose_route = rose_route->next)
664 if ((rose_route->neigh1 == neigh && rose_route->lci1 == lci) ||
665 (rose_route->neigh2 == neigh && rose_route->lci2 == lci))
672 * Find a neighbour given a ROSE address.
674 struct rose_neigh *rose_get_neigh(rose_address *addr, unsigned char *cause,
675 unsigned char *diagnostic)
677 struct rose_neigh *res = NULL;
678 struct rose_node *node;
682 spin_lock_bh(&rose_node_list_lock);
683 for (node = rose_node_list; node != NULL; node = node->next) {
684 if (rosecmpm(addr, &node->address, node->mask) == 0) {
685 for (i = 0; i < node->count; i++) {
686 if (!rose_ftimer_running(node->neighbour[i])) {
687 res = node->neighbour[i];
697 *cause = ROSE_OUT_OF_ORDER;
700 *cause = ROSE_NOT_OBTAINABLE;
705 spin_unlock_bh(&rose_node_list_lock);
711 * Handle the ioctls that control the routing functions.
713 int rose_rt_ioctl(unsigned int cmd, void __user *arg)
715 struct rose_route_struct rose_route;
716 struct net_device *dev;
721 if (copy_from_user(&rose_route, arg, sizeof(struct rose_route_struct)))
723 if ((dev = rose_ax25_dev_get(rose_route.device)) == NULL)
725 if (rose_dev_exists(&rose_route.address)) { /* Can't add routes to ourself */
729 if (rose_route.mask > 10) /* Mask can't be more than 10 digits */
732 err = rose_add_node(&rose_route, dev);
737 if (copy_from_user(&rose_route, arg, sizeof(struct rose_route_struct)))
739 if ((dev = rose_ax25_dev_get(rose_route.device)) == NULL)
741 err = rose_del_node(&rose_route, dev);
746 return rose_clear_routes();
755 static void rose_del_route_by_neigh(struct rose_neigh *rose_neigh)
757 struct rose_route *rose_route, *s;
759 rose_neigh->restarted = 0;
761 rose_stop_t0timer(rose_neigh);
762 rose_start_ftimer(rose_neigh);
764 skb_queue_purge(&rose_neigh->queue);
766 spin_lock_bh(&rose_route_list_lock);
768 rose_route = rose_route_list;
770 while (rose_route != NULL) {
771 if ((rose_route->neigh1 == rose_neigh && rose_route->neigh2 == rose_neigh) ||
772 (rose_route->neigh1 == rose_neigh && rose_route->neigh2 == NULL) ||
773 (rose_route->neigh2 == rose_neigh && rose_route->neigh1 == NULL)) {
774 s = rose_route->next;
775 rose_remove_route(rose_route);
780 if (rose_route->neigh1 == rose_neigh) {
781 rose_route->neigh1->use--;
782 rose_route->neigh1 = NULL;
783 rose_transmit_clear_request(rose_route->neigh2, rose_route->lci2, ROSE_OUT_OF_ORDER, 0);
786 if (rose_route->neigh2 == rose_neigh) {
787 rose_route->neigh2->use--;
788 rose_route->neigh2 = NULL;
789 rose_transmit_clear_request(rose_route->neigh1, rose_route->lci1, ROSE_OUT_OF_ORDER, 0);
792 rose_route = rose_route->next;
794 spin_unlock_bh(&rose_route_list_lock);
798 * A level 2 link has timed out, therefore it appears to be a poor link,
799 * then don't use that neighbour until it is reset. Blow away all through
800 * routes and connections using this route.
802 void rose_link_failed(ax25_cb *ax25, int reason)
804 struct rose_neigh *rose_neigh;
806 spin_lock_bh(&rose_neigh_list_lock);
807 rose_neigh = rose_neigh_list;
808 while (rose_neigh != NULL) {
809 if (rose_neigh->ax25 == ax25)
811 rose_neigh = rose_neigh->next;
814 if (rose_neigh != NULL) {
815 rose_neigh->ax25 = NULL;
817 rose_del_route_by_neigh(rose_neigh);
818 rose_kill_by_neigh(rose_neigh);
820 spin_unlock_bh(&rose_neigh_list_lock);
824 * A device has been "downed" remove its link status. Blow away all
825 * through routes and connections that use this device.
827 void rose_link_device_down(struct net_device *dev)
829 struct rose_neigh *rose_neigh;
831 for (rose_neigh = rose_neigh_list; rose_neigh != NULL; rose_neigh = rose_neigh->next) {
832 if (rose_neigh->dev == dev) {
833 rose_del_route_by_neigh(rose_neigh);
834 rose_kill_by_neigh(rose_neigh);
840 * Route a frame to an appropriate AX.25 connection.
842 int rose_route_frame(struct sk_buff *skb, ax25_cb *ax25)
844 struct rose_neigh *rose_neigh, *new_neigh;
845 struct rose_route *rose_route;
846 struct rose_facilities_struct facilities;
847 rose_address *src_addr, *dest_addr;
849 unsigned short frametype;
850 unsigned int lci, new_lci;
851 unsigned char cause, diagnostic;
852 struct net_device *dev;
856 if (call_in_firewall(PF_ROSE, skb->dev, skb->data, NULL, &skb) != FW_ACCEPT)
860 frametype = skb->data[2];
861 lci = ((skb->data[0] << 8) & 0xF00) + ((skb->data[1] << 0) & 0x0FF);
862 src_addr = (rose_address *)(skb->data + 9);
863 dest_addr = (rose_address *)(skb->data + 4);
865 spin_lock_bh(&rose_node_list_lock);
866 spin_lock_bh(&rose_neigh_list_lock);
867 spin_lock_bh(&rose_route_list_lock);
869 rose_neigh = rose_neigh_list;
870 while (rose_neigh != NULL) {
871 if (ax25cmp(&ax25->dest_addr, &rose_neigh->callsign) == 0 &&
872 ax25->ax25_dev->dev == rose_neigh->dev)
874 rose_neigh = rose_neigh->next;
877 if (rose_neigh == NULL) {
878 printk("rose_route : unknown neighbour or device %s\n",
879 ax2asc(&ax25->dest_addr));
884 * Obviously the link is working, halt the ftimer.
886 rose_stop_ftimer(rose_neigh);
889 * LCI of zero is always for us, and its always a restart
893 rose_link_rx_restart(skb, rose_neigh, frametype);
898 * Find an existing socket.
900 if ((sk = rose_find_socket(lci, rose_neigh)) != NULL) {
901 if (frametype == ROSE_CALL_REQUEST) {
902 rose_cb *rose = rose_sk(sk);
903 /* Remove an existing unused socket */
904 rose_clear_queues(sk);
905 rose->cause = ROSE_NETWORK_CONGESTION;
906 rose->diagnostic = 0;
907 rose->neighbour->use--;
908 rose->neighbour = NULL;
910 rose->state = ROSE_STATE_0;
911 sk->sk_state = TCP_CLOSE;
913 sk->sk_shutdown |= SEND_SHUTDOWN;
914 if (!sock_flag(sk, SOCK_DEAD)) {
915 sk->sk_state_change(sk);
916 sock_set_flag(sk, SOCK_DEAD);
920 skb->h.raw = skb->data;
921 res = rose_process_rx_frame(sk, skb);
927 * Is is a Call Request and is it for us ?
929 if (frametype == ROSE_CALL_REQUEST)
930 if ((dev = rose_dev_get(dest_addr)) != NULL) {
931 res = rose_rx_call_request(skb, dev, rose_neigh, lci);
936 if (!sysctl_rose_routing_control) {
937 rose_transmit_clear_request(rose_neigh, lci, ROSE_NOT_OBTAINABLE, 0);
942 * Route it to the next in line if we have an entry for it.
944 rose_route = rose_route_list;
945 while (rose_route != NULL) {
946 if (rose_route->lci1 == lci &&
947 rose_route->neigh1 == rose_neigh) {
948 if (frametype == ROSE_CALL_REQUEST) {
949 /* F6FBB - Remove an existing unused route */
950 rose_remove_route(rose_route);
952 } else if (rose_route->neigh2 != NULL) {
953 skb->data[0] &= 0xF0;
954 skb->data[0] |= (rose_route->lci2 >> 8) & 0x0F;
955 skb->data[1] = (rose_route->lci2 >> 0) & 0xFF;
956 rose_transmit_link(skb, rose_route->neigh2);
957 if (frametype == ROSE_CLEAR_CONFIRMATION)
958 rose_remove_route(rose_route);
962 if (frametype == ROSE_CLEAR_CONFIRMATION)
963 rose_remove_route(rose_route);
967 if (rose_route->lci2 == lci &&
968 rose_route->neigh2 == rose_neigh) {
969 if (frametype == ROSE_CALL_REQUEST) {
970 /* F6FBB - Remove an existing unused route */
971 rose_remove_route(rose_route);
973 } else if (rose_route->neigh1 != NULL) {
974 skb->data[0] &= 0xF0;
975 skb->data[0] |= (rose_route->lci1 >> 8) & 0x0F;
976 skb->data[1] = (rose_route->lci1 >> 0) & 0xFF;
977 rose_transmit_link(skb, rose_route->neigh1);
978 if (frametype == ROSE_CLEAR_CONFIRMATION)
979 rose_remove_route(rose_route);
983 if (frametype == ROSE_CLEAR_CONFIRMATION)
984 rose_remove_route(rose_route);
988 rose_route = rose_route->next;
993 * 1. The frame isn't for us,
994 * 2. It isn't "owned" by any existing route.
996 if (frametype != ROSE_CALL_REQUEST) /* XXX */
999 len = (((skb->data[3] >> 4) & 0x0F) + 1) / 2;
1000 len += (((skb->data[3] >> 0) & 0x0F) + 1) / 2;
1002 memset(&facilities, 0x00, sizeof(struct rose_facilities_struct));
1004 if (!rose_parse_facilities(skb->data + len + 4, &facilities)) {
1005 rose_transmit_clear_request(rose_neigh, lci, ROSE_INVALID_FACILITY, 76);
1010 * Check for routing loops.
1012 rose_route = rose_route_list;
1013 while (rose_route != NULL) {
1014 if (rose_route->rand == facilities.rand &&
1015 rosecmp(src_addr, &rose_route->src_addr) == 0 &&
1016 ax25cmp(&facilities.dest_call, &rose_route->src_call) == 0 &&
1017 ax25cmp(&facilities.source_call, &rose_route->dest_call) == 0) {
1018 rose_transmit_clear_request(rose_neigh, lci, ROSE_NOT_OBTAINABLE, 120);
1021 rose_route = rose_route->next;
1024 if ((new_neigh = rose_get_neigh(dest_addr, &cause, &diagnostic)) == NULL) {
1025 rose_transmit_clear_request(rose_neigh, lci, cause, diagnostic);
1029 if ((new_lci = rose_new_lci(new_neigh)) == 0) {
1030 rose_transmit_clear_request(rose_neigh, lci, ROSE_NETWORK_CONGESTION, 71);
1034 if ((rose_route = kmalloc(sizeof(*rose_route), GFP_ATOMIC)) == NULL) {
1035 rose_transmit_clear_request(rose_neigh, lci, ROSE_NETWORK_CONGESTION, 120);
1039 rose_route->lci1 = lci;
1040 rose_route->src_addr = *src_addr;
1041 rose_route->dest_addr = *dest_addr;
1042 rose_route->src_call = facilities.dest_call;
1043 rose_route->dest_call = facilities.source_call;
1044 rose_route->rand = facilities.rand;
1045 rose_route->neigh1 = rose_neigh;
1046 rose_route->lci2 = new_lci;
1047 rose_route->neigh2 = new_neigh;
1049 rose_route->neigh1->use++;
1050 rose_route->neigh2->use++;
1052 rose_route->next = rose_route_list;
1053 rose_route_list = rose_route;
1055 skb->data[0] &= 0xF0;
1056 skb->data[0] |= (rose_route->lci2 >> 8) & 0x0F;
1057 skb->data[1] = (rose_route->lci2 >> 0) & 0xFF;
1059 rose_transmit_link(skb, rose_route->neigh2);
1063 spin_unlock_bh(&rose_route_list_lock);
1064 spin_unlock_bh(&rose_neigh_list_lock);
1065 spin_unlock_bh(&rose_node_list_lock);
1070 #ifdef CONFIG_PROC_FS
1072 static void *rose_node_start(struct seq_file *seq, loff_t *pos)
1074 struct rose_node *rose_node;
1077 spin_lock_bh(&rose_neigh_list_lock);
1079 return SEQ_START_TOKEN;
1081 for (rose_node = rose_node_list; rose_node && i < *pos;
1082 rose_node = rose_node->next, ++i);
1084 return (i == *pos) ? rose_node : NULL;
1087 static void *rose_node_next(struct seq_file *seq, void *v, loff_t *pos)
1091 return (v == SEQ_START_TOKEN) ? rose_node_list
1092 : ((struct rose_node *)v)->next;
1095 static void rose_node_stop(struct seq_file *seq, void *v)
1097 spin_unlock_bh(&rose_neigh_list_lock);
1100 static int rose_node_show(struct seq_file *seq, void *v)
1104 if (v == SEQ_START_TOKEN)
1105 seq_puts(seq, "address mask n neigh neigh neigh\n");
1107 const struct rose_node *rose_node = v;
1108 /* if (rose_node->loopback) {
1109 seq_printf(seq, "%-10s %04d 1 loopback\n",
1110 rose2asc(&rose_node->address),
1113 seq_printf(seq, "%-10s %04d %d",
1114 rose2asc(&rose_node->address),
1118 for (i = 0; i < rose_node->count; i++)
1119 seq_printf(seq, " %05d",
1120 rose_node->neighbour[i]->number);
1122 seq_puts(seq, "\n");
1128 static struct seq_operations rose_node_seqops = {
1129 .start = rose_node_start,
1130 .next = rose_node_next,
1131 .stop = rose_node_stop,
1132 .show = rose_node_show,
1135 static int rose_nodes_open(struct inode *inode, struct file *file)
1137 return seq_open(file, &rose_node_seqops);
1140 struct file_operations rose_nodes_fops = {
1141 .owner = THIS_MODULE,
1142 .open = rose_nodes_open,
1144 .llseek = seq_lseek,
1145 .release = seq_release,
1148 static void *rose_neigh_start(struct seq_file *seq, loff_t *pos)
1150 struct rose_neigh *rose_neigh;
1153 spin_lock_bh(&rose_neigh_list_lock);
1155 return SEQ_START_TOKEN;
1157 for (rose_neigh = rose_neigh_list; rose_neigh && i < *pos;
1158 rose_neigh = rose_neigh->next, ++i);
1160 return (i == *pos) ? rose_neigh : NULL;
1163 static void *rose_neigh_next(struct seq_file *seq, void *v, loff_t *pos)
1167 return (v == SEQ_START_TOKEN) ? rose_neigh_list
1168 : ((struct rose_neigh *)v)->next;
1171 static void rose_neigh_stop(struct seq_file *seq, void *v)
1173 spin_unlock_bh(&rose_neigh_list_lock);
1176 static int rose_neigh_show(struct seq_file *seq, void *v)
1180 if (v == SEQ_START_TOKEN)
1182 "addr callsign dev count use mode restart t0 tf digipeaters\n");
1184 struct rose_neigh *rose_neigh = v;
1186 /* if (!rose_neigh->loopback) { */
1187 seq_printf(seq, "%05d %-9s %-4s %3d %3d %3s %3s %3lu %3lu",
1189 (rose_neigh->loopback) ? "RSLOOP-0" : ax2asc(&rose_neigh->callsign),
1190 rose_neigh->dev ? rose_neigh->dev->name : "???",
1193 (rose_neigh->dce_mode) ? "DCE" : "DTE",
1194 (rose_neigh->restarted) ? "yes" : "no",
1195 ax25_display_timer(&rose_neigh->t0timer) / HZ,
1196 ax25_display_timer(&rose_neigh->ftimer) / HZ);
1198 if (rose_neigh->digipeat != NULL) {
1199 for (i = 0; i < rose_neigh->digipeat->ndigi; i++)
1200 seq_printf(seq, " %s", ax2asc(&rose_neigh->digipeat->calls[i]));
1203 seq_puts(seq, "\n");
1209 static struct seq_operations rose_neigh_seqops = {
1210 .start = rose_neigh_start,
1211 .next = rose_neigh_next,
1212 .stop = rose_neigh_stop,
1213 .show = rose_neigh_show,
1216 static int rose_neigh_open(struct inode *inode, struct file *file)
1218 return seq_open(file, &rose_neigh_seqops);
1221 struct file_operations rose_neigh_fops = {
1222 .owner = THIS_MODULE,
1223 .open = rose_neigh_open,
1225 .llseek = seq_lseek,
1226 .release = seq_release,
1230 static void *rose_route_start(struct seq_file *seq, loff_t *pos)
1232 struct rose_route *rose_route;
1235 spin_lock_bh(&rose_route_list_lock);
1237 return SEQ_START_TOKEN;
1239 for (rose_route = rose_route_list; rose_route && i < *pos;
1240 rose_route = rose_route->next, ++i);
1242 return (i == *pos) ? rose_route : NULL;
1245 static void *rose_route_next(struct seq_file *seq, void *v, loff_t *pos)
1249 return (v == SEQ_START_TOKEN) ? rose_route_list
1250 : ((struct rose_route *)v)->next;
1253 static void rose_route_stop(struct seq_file *seq, void *v)
1255 spin_unlock_bh(&rose_route_list_lock);
1258 static int rose_route_show(struct seq_file *seq, void *v)
1260 if (v == SEQ_START_TOKEN)
1262 "lci address callsign neigh <-> lci address callsign neigh\n");
1264 struct rose_route *rose_route = v;
1266 if (rose_route->neigh1)
1268 "%3.3X %-10s %-9s %05d ",
1270 rose2asc(&rose_route->src_addr),
1271 ax2asc(&rose_route->src_call),
1272 rose_route->neigh1->number);
1277 if (rose_route->neigh2)
1279 "%3.3X %-10s %-9s %05d\n",
1281 rose2asc(&rose_route->dest_addr),
1282 ax2asc(&rose_route->dest_call),
1283 rose_route->neigh2->number);
1291 static struct seq_operations rose_route_seqops = {
1292 .start = rose_route_start,
1293 .next = rose_route_next,
1294 .stop = rose_route_stop,
1295 .show = rose_route_show,
1298 static int rose_route_open(struct inode *inode, struct file *file)
1300 return seq_open(file, &rose_route_seqops);
1303 struct file_operations rose_routes_fops = {
1304 .owner = THIS_MODULE,
1305 .open = rose_route_open,
1307 .llseek = seq_lseek,
1308 .release = seq_release,
1311 #endif /* CONFIG_PROC_FS */
1314 * Release all memory associated with ROSE routing structures.
1316 void __exit rose_rt_free(void)
1318 struct rose_neigh *s, *rose_neigh = rose_neigh_list;
1319 struct rose_node *t, *rose_node = rose_node_list;
1320 struct rose_route *u, *rose_route = rose_route_list;
1322 while (rose_neigh != NULL) {
1324 rose_neigh = rose_neigh->next;
1326 rose_remove_neigh(s);
1329 while (rose_node != NULL) {
1331 rose_node = rose_node->next;
1333 rose_remove_node(t);
1336 while (rose_route != NULL) {
1338 rose_route = rose_route->next;
1340 rose_remove_route(u);