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/timer.h>
16 #include <linux/string.h>
17 #include <linux/sockios.h>
18 #include <linux/net.h>
19 #include <linux/slab.h>
21 #include <linux/inet.h>
22 #include <linux/netdevice.h>
24 #include <linux/if_arp.h>
25 #include <linux/skbuff.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 */
32 #include <linux/interrupt.h>
33 #include <linux/notifier.h>
34 #include <linux/init.h>
36 #include <linux/seq_file.h>
37 #include <linux/export.h>
39 static unsigned int rose_neigh_no = 1;
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);
48 struct rose_neigh *rose_loopback_neigh;
51 * Add a new route to a node, and in the process add the node and the
52 * neighbour if it is new.
54 static int __must_check rose_add_node(struct rose_route_struct *rose_route,
55 struct net_device *dev)
57 struct rose_node *rose_node, *rose_tmpn, *rose_tmpp;
58 struct rose_neigh *rose_neigh;
61 spin_lock_bh(&rose_node_list_lock);
62 spin_lock_bh(&rose_neigh_list_lock);
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))
70 rose_node = rose_node->next;
73 if (rose_node != NULL && rose_node->loopback) {
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)
84 rose_neigh = rose_neigh->next;
87 if (rose_neigh == NULL) {
88 rose_neigh = kmalloc(sizeof(*rose_neigh), GFP_ATOMIC);
89 if (rose_neigh == NULL) {
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;
100 rose_neigh->dce_mode = 0;
101 rose_neigh->loopback = 0;
102 rose_neigh->number = rose_neigh_no++;
103 rose_neigh->restarted = 0;
105 skb_queue_head_init(&rose_neigh->queue);
107 timer_setup(&rose_neigh->ftimer, NULL, 0);
108 timer_setup(&rose_neigh->t0timer, NULL, 0);
110 if (rose_route->ndigis != 0) {
111 rose_neigh->digipeat =
112 kmalloc(sizeof(ax25_digi), GFP_ATOMIC);
113 if (rose_neigh->digipeat == 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 if ((s = rose_node_list) == rose_node) {
210 rose_node_list = rose_node->next;
215 while (s != NULL && s->next != NULL) {
216 if (s->next == rose_node) {
217 s->next = rose_node->next;
227 * Caller is holding rose_neigh_list_lock.
229 static void rose_remove_neigh(struct rose_neigh *rose_neigh)
231 struct rose_neigh *s;
233 rose_stop_ftimer(rose_neigh);
234 rose_stop_t0timer(rose_neigh);
236 skb_queue_purge(&rose_neigh->queue);
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);
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);
262 * Caller is holding rose_route_list_lock.
264 static void rose_remove_route(struct rose_route *rose_route)
266 struct rose_route *s;
268 if (rose_route->neigh1 != NULL)
269 rose_route->neigh1->use--;
271 if (rose_route->neigh2 != NULL)
272 rose_route->neigh2->use--;
274 if ((s = rose_route_list) == rose_route) {
275 rose_route_list = rose_route->next;
280 while (s != NULL && s->next != NULL) {
281 if (s->next == rose_route) {
282 s->next = rose_route->next;
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.
295 static int rose_del_node(struct rose_route_struct *rose_route,
296 struct net_device *dev)
298 struct rose_node *rose_node;
299 struct rose_neigh *rose_neigh;
302 spin_lock_bh(&rose_node_list_lock);
303 spin_lock_bh(&rose_neigh_list_lock);
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))
311 rose_node = rose_node->next;
314 if (rose_node == NULL || rose_node->loopback) {
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)
325 rose_neigh = rose_neigh->next;
328 if (rose_neigh == NULL) {
333 for (i = 0; i < rose_node->count; i++) {
334 if (rose_node->neighbour[i] == rose_neigh) {
337 if (rose_neigh->count == 0 && rose_neigh->use == 0)
338 rose_remove_neigh(rose_neigh);
342 if (rose_node->count == 0) {
343 rose_remove_node(rose_node);
347 rose_node->neighbour[0] =
348 rose_node->neighbour[1];
351 rose_node->neighbour[1] =
352 rose_node->neighbour[2];
363 spin_unlock_bh(&rose_neigh_list_lock);
364 spin_unlock_bh(&rose_node_list_lock);
370 * Add the loopback neighbour.
372 void rose_add_loopback_neigh(void)
374 struct rose_neigh *sn;
376 rose_loopback_neigh = kmalloc(sizeof(struct rose_neigh), GFP_KERNEL);
377 if (!rose_loopback_neigh)
379 sn = rose_loopback_neigh;
381 sn->callsign = null_ax25_address;
389 sn->number = rose_neigh_no++;
392 skb_queue_head_init(&sn->queue);
394 timer_setup(&sn->ftimer, NULL, 0);
395 timer_setup(&sn->t0timer, NULL, 0);
397 spin_lock_bh(&rose_neigh_list_lock);
398 sn->next = rose_neigh_list;
399 rose_neigh_list = sn;
400 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;
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];
513 t->neighbour[1] = t->neighbour[2];
523 rose_remove_neigh(s);
525 spin_unlock_bh(&rose_neigh_list_lock);
526 spin_unlock_bh(&rose_node_list_lock);
529 #if 0 /* Currently unused */
531 * A device has been removed. Remove its links.
533 void rose_route_device_down(struct net_device *dev)
535 struct rose_route *s, *rose_route;
537 spin_lock_bh(&rose_route_list_lock);
538 rose_route = rose_route_list;
539 while (rose_route != NULL) {
541 rose_route = rose_route->next;
543 if (s->neigh1->dev == dev || s->neigh2->dev == dev)
544 rose_remove_route(s);
546 spin_unlock_bh(&rose_route_list_lock);
551 * Clear all nodes and neighbours out, except for neighbours with
552 * active connections going through them.
553 * Do not clear loopback neighbour and nodes.
555 static int rose_clear_routes(void)
557 struct rose_neigh *s, *rose_neigh;
558 struct rose_node *t, *rose_node;
560 spin_lock_bh(&rose_node_list_lock);
561 spin_lock_bh(&rose_neigh_list_lock);
563 rose_neigh = rose_neigh_list;
564 rose_node = rose_node_list;
566 while (rose_node != NULL) {
568 rose_node = rose_node->next;
573 while (rose_neigh != NULL) {
575 rose_neigh = rose_neigh->next;
577 if (s->use == 0 && !s->loopback) {
579 rose_remove_neigh(s);
583 spin_unlock_bh(&rose_neigh_list_lock);
584 spin_unlock_bh(&rose_node_list_lock);
590 * Check that the device given is a valid AX.25 interface that is "up".
593 static struct net_device *rose_ax25_dev_find(char *devname)
595 struct net_device *dev;
597 if ((dev = __dev_get_by_name(&init_net, devname)) == NULL)
600 if ((dev->flags & IFF_UP) && dev->type == ARPHRD_AX25)
607 * Find the first active ROSE device, usually "rose0".
609 struct net_device *rose_dev_first(void)
611 struct net_device *dev, *first = NULL;
614 for_each_netdev_rcu(&init_net, dev) {
615 if ((dev->flags & IFF_UP) && dev->type == ARPHRD_ROSE)
616 if (first == NULL || strncmp(dev->name, first->name, 3) < 0)
625 * Find the ROSE device for the given address.
627 struct net_device *rose_dev_get(rose_address *addr)
629 struct net_device *dev;
632 for_each_netdev_rcu(&init_net, dev) {
633 if ((dev->flags & IFF_UP) && dev->type == ARPHRD_ROSE && rosecmp(addr, (rose_address *)dev->dev_addr) == 0) {
644 static int rose_dev_exists(rose_address *addr)
646 struct net_device *dev;
649 for_each_netdev_rcu(&init_net, dev) {
650 if ((dev->flags & IFF_UP) && dev->type == ARPHRD_ROSE && rosecmp(addr, (rose_address *)dev->dev_addr) == 0)
662 struct rose_route *rose_route_free_lci(unsigned int lci, struct rose_neigh *neigh)
664 struct rose_route *rose_route;
666 for (rose_route = rose_route_list; rose_route != NULL; rose_route = rose_route->next)
667 if ((rose_route->neigh1 == neigh && rose_route->lci1 == lci) ||
668 (rose_route->neigh2 == neigh && rose_route->lci2 == lci))
675 * Find a neighbour or a route given a ROSE address.
677 struct rose_neigh *rose_get_neigh(rose_address *addr, unsigned char *cause,
678 unsigned char *diagnostic, int route_frame)
680 struct rose_neigh *res = NULL;
681 struct rose_node *node;
685 if (!route_frame) spin_lock_bh(&rose_node_list_lock);
686 for (node = rose_node_list; node != NULL; node = node->next) {
687 if (rosecmpm(addr, &node->address, node->mask) == 0) {
688 for (i = 0; i < node->count; i++) {
689 if (node->neighbour[i]->restarted) {
690 res = node->neighbour[i];
696 if (!route_frame) { /* connect request */
697 for (node = rose_node_list; node != NULL; node = node->next) {
698 if (rosecmpm(addr, &node->address, node->mask) == 0) {
699 for (i = 0; i < node->count; i++) {
700 if (!rose_ftimer_running(node->neighbour[i])) {
701 res = node->neighbour[i];
712 *cause = ROSE_OUT_OF_ORDER;
715 *cause = ROSE_NOT_OBTAINABLE;
720 if (!route_frame) spin_unlock_bh(&rose_node_list_lock);
725 * Handle the ioctls that control the routing functions.
727 int rose_rt_ioctl(unsigned int cmd, void __user *arg)
729 struct rose_route_struct rose_route;
730 struct net_device *dev;
735 if (copy_from_user(&rose_route, arg, sizeof(struct rose_route_struct)))
737 if ((dev = rose_ax25_dev_find(rose_route.device)) == NULL)
739 if (rose_dev_exists(&rose_route.address)) /* Can't add routes to ourself */
741 if (rose_route.mask > 10) /* Mask can't be more than 10 digits */
743 if (rose_route.ndigis > AX25_MAX_DIGIS)
745 err = rose_add_node(&rose_route, dev);
749 if (copy_from_user(&rose_route, arg, sizeof(struct rose_route_struct)))
751 if ((dev = rose_ax25_dev_find(rose_route.device)) == NULL)
753 err = rose_del_node(&rose_route, dev);
757 return rose_clear_routes();
766 static void rose_del_route_by_neigh(struct rose_neigh *rose_neigh)
768 struct rose_route *rose_route, *s;
770 rose_neigh->restarted = 0;
772 rose_stop_t0timer(rose_neigh);
773 rose_start_ftimer(rose_neigh);
775 skb_queue_purge(&rose_neigh->queue);
777 spin_lock_bh(&rose_route_list_lock);
779 rose_route = rose_route_list;
781 while (rose_route != NULL) {
782 if ((rose_route->neigh1 == rose_neigh && rose_route->neigh2 == rose_neigh) ||
783 (rose_route->neigh1 == rose_neigh && rose_route->neigh2 == NULL) ||
784 (rose_route->neigh2 == rose_neigh && rose_route->neigh1 == NULL)) {
785 s = rose_route->next;
786 rose_remove_route(rose_route);
791 if (rose_route->neigh1 == rose_neigh) {
792 rose_route->neigh1->use--;
793 rose_route->neigh1 = NULL;
794 rose_transmit_clear_request(rose_route->neigh2, rose_route->lci2, ROSE_OUT_OF_ORDER, 0);
797 if (rose_route->neigh2 == rose_neigh) {
798 rose_route->neigh2->use--;
799 rose_route->neigh2 = NULL;
800 rose_transmit_clear_request(rose_route->neigh1, rose_route->lci1, ROSE_OUT_OF_ORDER, 0);
803 rose_route = rose_route->next;
805 spin_unlock_bh(&rose_route_list_lock);
809 * A level 2 link has timed out, therefore it appears to be a poor link,
810 * then don't use that neighbour until it is reset. Blow away all through
811 * routes and connections using this route.
813 void rose_link_failed(ax25_cb *ax25, int reason)
815 struct rose_neigh *rose_neigh;
817 spin_lock_bh(&rose_neigh_list_lock);
818 rose_neigh = rose_neigh_list;
819 while (rose_neigh != NULL) {
820 if (rose_neigh->ax25 == ax25)
822 rose_neigh = rose_neigh->next;
825 if (rose_neigh != NULL) {
826 rose_neigh->ax25 = NULL;
829 rose_del_route_by_neigh(rose_neigh);
830 rose_kill_by_neigh(rose_neigh);
832 spin_unlock_bh(&rose_neigh_list_lock);
836 * A device has been "downed" remove its link status. Blow away all
837 * through routes and connections that use this device.
839 void rose_link_device_down(struct net_device *dev)
841 struct rose_neigh *rose_neigh;
843 for (rose_neigh = rose_neigh_list; rose_neigh != NULL; rose_neigh = rose_neigh->next) {
844 if (rose_neigh->dev == dev) {
845 rose_del_route_by_neigh(rose_neigh);
846 rose_kill_by_neigh(rose_neigh);
852 * Route a frame to an appropriate AX.25 connection.
853 * A NULL ax25_cb indicates an internally generated frame.
855 int rose_route_frame(struct sk_buff *skb, ax25_cb *ax25)
857 struct rose_neigh *rose_neigh, *new_neigh;
858 struct rose_route *rose_route;
859 struct rose_facilities_struct facilities;
860 rose_address *src_addr, *dest_addr;
862 unsigned short frametype;
863 unsigned int lci, new_lci;
864 unsigned char cause, diagnostic;
865 struct net_device *dev;
869 if (skb->len < ROSE_MIN_LEN)
873 return rose_loopback_queue(skb, NULL);
875 frametype = skb->data[2];
876 lci = ((skb->data[0] << 8) & 0xF00) + ((skb->data[1] << 0) & 0x0FF);
877 if (frametype == ROSE_CALL_REQUEST &&
878 (skb->len <= ROSE_CALL_REQ_FACILITIES_OFF ||
879 skb->data[ROSE_CALL_REQ_ADDR_LEN_OFF] !=
880 ROSE_CALL_REQ_ADDR_LEN_VAL))
882 src_addr = (rose_address *)(skb->data + ROSE_CALL_REQ_SRC_ADDR_OFF);
883 dest_addr = (rose_address *)(skb->data + ROSE_CALL_REQ_DEST_ADDR_OFF);
885 spin_lock_bh(&rose_neigh_list_lock);
886 spin_lock_bh(&rose_route_list_lock);
888 rose_neigh = rose_neigh_list;
889 while (rose_neigh != NULL) {
890 if (ax25cmp(&ax25->dest_addr, &rose_neigh->callsign) == 0 &&
891 ax25->ax25_dev->dev == rose_neigh->dev)
893 rose_neigh = rose_neigh->next;
896 if (rose_neigh == NULL) {
897 printk("rose_route : unknown neighbour or device %s\n",
898 ax2asc(buf, &ax25->dest_addr));
903 * Obviously the link is working, halt the ftimer.
905 rose_stop_ftimer(rose_neigh);
908 * LCI of zero is always for us, and its always a restart
912 rose_link_rx_restart(skb, rose_neigh, frametype);
917 * Find an existing socket.
919 if ((sk = rose_find_socket(lci, rose_neigh)) != NULL) {
920 if (frametype == ROSE_CALL_REQUEST) {
921 struct rose_sock *rose = rose_sk(sk);
923 /* Remove an existing unused socket */
924 rose_clear_queues(sk);
925 rose->cause = ROSE_NETWORK_CONGESTION;
926 rose->diagnostic = 0;
927 rose->neighbour->use--;
928 rose->neighbour = NULL;
930 rose->state = ROSE_STATE_0;
931 sk->sk_state = TCP_CLOSE;
933 sk->sk_shutdown |= SEND_SHUTDOWN;
934 if (!sock_flag(sk, SOCK_DEAD)) {
935 sk->sk_state_change(sk);
936 sock_set_flag(sk, SOCK_DEAD);
940 skb_reset_transport_header(skb);
941 res = rose_process_rx_frame(sk, skb);
947 * Is is a Call Request and is it for us ?
949 if (frametype == ROSE_CALL_REQUEST)
950 if ((dev = rose_dev_get(dest_addr)) != NULL) {
951 res = rose_rx_call_request(skb, dev, rose_neigh, lci);
956 if (!sysctl_rose_routing_control) {
957 rose_transmit_clear_request(rose_neigh, lci, ROSE_NOT_OBTAINABLE, 0);
962 * Route it to the next in line if we have an entry for it.
964 rose_route = rose_route_list;
965 while (rose_route != NULL) {
966 if (rose_route->lci1 == lci &&
967 rose_route->neigh1 == rose_neigh) {
968 if (frametype == ROSE_CALL_REQUEST) {
969 /* F6FBB - Remove an existing unused route */
970 rose_remove_route(rose_route);
972 } else if (rose_route->neigh2 != NULL) {
973 skb->data[0] &= 0xF0;
974 skb->data[0] |= (rose_route->lci2 >> 8) & 0x0F;
975 skb->data[1] = (rose_route->lci2 >> 0) & 0xFF;
976 rose_transmit_link(skb, rose_route->neigh2);
977 if (frametype == ROSE_CLEAR_CONFIRMATION)
978 rose_remove_route(rose_route);
982 if (frametype == ROSE_CLEAR_CONFIRMATION)
983 rose_remove_route(rose_route);
987 if (rose_route->lci2 == lci &&
988 rose_route->neigh2 == rose_neigh) {
989 if (frametype == ROSE_CALL_REQUEST) {
990 /* F6FBB - Remove an existing unused route */
991 rose_remove_route(rose_route);
993 } else if (rose_route->neigh1 != NULL) {
994 skb->data[0] &= 0xF0;
995 skb->data[0] |= (rose_route->lci1 >> 8) & 0x0F;
996 skb->data[1] = (rose_route->lci1 >> 0) & 0xFF;
997 rose_transmit_link(skb, rose_route->neigh1);
998 if (frametype == ROSE_CLEAR_CONFIRMATION)
999 rose_remove_route(rose_route);
1003 if (frametype == ROSE_CLEAR_CONFIRMATION)
1004 rose_remove_route(rose_route);
1008 rose_route = rose_route->next;
1013 * 1. The frame isn't for us,
1014 * 2. It isn't "owned" by any existing route.
1016 if (frametype != ROSE_CALL_REQUEST) { /* XXX */
1021 memset(&facilities, 0x00, sizeof(struct rose_facilities_struct));
1023 if (!rose_parse_facilities(skb->data + ROSE_CALL_REQ_FACILITIES_OFF,
1024 skb->len - ROSE_CALL_REQ_FACILITIES_OFF,
1026 rose_transmit_clear_request(rose_neigh, lci, ROSE_INVALID_FACILITY, 76);
1031 * Check for routing loops.
1033 rose_route = rose_route_list;
1034 while (rose_route != NULL) {
1035 if (rose_route->rand == facilities.rand &&
1036 rosecmp(src_addr, &rose_route->src_addr) == 0 &&
1037 ax25cmp(&facilities.dest_call, &rose_route->src_call) == 0 &&
1038 ax25cmp(&facilities.source_call, &rose_route->dest_call) == 0) {
1039 rose_transmit_clear_request(rose_neigh, lci, ROSE_NOT_OBTAINABLE, 120);
1042 rose_route = rose_route->next;
1045 if ((new_neigh = rose_get_neigh(dest_addr, &cause, &diagnostic, 1)) == NULL) {
1046 rose_transmit_clear_request(rose_neigh, lci, cause, diagnostic);
1050 if ((new_lci = rose_new_lci(new_neigh)) == 0) {
1051 rose_transmit_clear_request(rose_neigh, lci, ROSE_NETWORK_CONGESTION, 71);
1055 if ((rose_route = kmalloc(sizeof(*rose_route), GFP_ATOMIC)) == NULL) {
1056 rose_transmit_clear_request(rose_neigh, lci, ROSE_NETWORK_CONGESTION, 120);
1060 rose_route->lci1 = lci;
1061 rose_route->src_addr = *src_addr;
1062 rose_route->dest_addr = *dest_addr;
1063 rose_route->src_call = facilities.dest_call;
1064 rose_route->dest_call = facilities.source_call;
1065 rose_route->rand = facilities.rand;
1066 rose_route->neigh1 = rose_neigh;
1067 rose_route->lci2 = new_lci;
1068 rose_route->neigh2 = new_neigh;
1070 rose_route->neigh1->use++;
1071 rose_route->neigh2->use++;
1073 rose_route->next = rose_route_list;
1074 rose_route_list = rose_route;
1076 skb->data[0] &= 0xF0;
1077 skb->data[0] |= (rose_route->lci2 >> 8) & 0x0F;
1078 skb->data[1] = (rose_route->lci2 >> 0) & 0xFF;
1080 rose_transmit_link(skb, rose_route->neigh2);
1084 spin_unlock_bh(&rose_route_list_lock);
1085 spin_unlock_bh(&rose_neigh_list_lock);
1090 #ifdef CONFIG_PROC_FS
1092 static void *rose_node_start(struct seq_file *seq, loff_t *pos)
1093 __acquires(rose_node_list_lock)
1095 struct rose_node *rose_node;
1098 spin_lock_bh(&rose_node_list_lock);
1100 return SEQ_START_TOKEN;
1102 for (rose_node = rose_node_list; rose_node && i < *pos;
1103 rose_node = rose_node->next, ++i);
1105 return (i == *pos) ? rose_node : NULL;
1108 static void *rose_node_next(struct seq_file *seq, void *v, loff_t *pos)
1112 return (v == SEQ_START_TOKEN) ? rose_node_list
1113 : ((struct rose_node *)v)->next;
1116 static void rose_node_stop(struct seq_file *seq, void *v)
1117 __releases(rose_node_list_lock)
1119 spin_unlock_bh(&rose_node_list_lock);
1122 static int rose_node_show(struct seq_file *seq, void *v)
1127 if (v == SEQ_START_TOKEN)
1128 seq_puts(seq, "address mask n neigh neigh neigh\n");
1130 const struct rose_node *rose_node = v;
1131 /* if (rose_node->loopback) {
1132 seq_printf(seq, "%-10s %04d 1 loopback\n",
1133 rose2asc(rsbuf, &rose_node->address),
1136 seq_printf(seq, "%-10s %04d %d",
1137 rose2asc(rsbuf, &rose_node->address),
1141 for (i = 0; i < rose_node->count; i++)
1142 seq_printf(seq, " %05d",
1143 rose_node->neighbour[i]->number);
1145 seq_puts(seq, "\n");
1151 const struct seq_operations rose_node_seqops = {
1152 .start = rose_node_start,
1153 .next = rose_node_next,
1154 .stop = rose_node_stop,
1155 .show = rose_node_show,
1158 static void *rose_neigh_start(struct seq_file *seq, loff_t *pos)
1159 __acquires(rose_neigh_list_lock)
1161 struct rose_neigh *rose_neigh;
1164 spin_lock_bh(&rose_neigh_list_lock);
1166 return SEQ_START_TOKEN;
1168 for (rose_neigh = rose_neigh_list; rose_neigh && i < *pos;
1169 rose_neigh = rose_neigh->next, ++i);
1171 return (i == *pos) ? rose_neigh : NULL;
1174 static void *rose_neigh_next(struct seq_file *seq, void *v, loff_t *pos)
1178 return (v == SEQ_START_TOKEN) ? rose_neigh_list
1179 : ((struct rose_neigh *)v)->next;
1182 static void rose_neigh_stop(struct seq_file *seq, void *v)
1183 __releases(rose_neigh_list_lock)
1185 spin_unlock_bh(&rose_neigh_list_lock);
1188 static int rose_neigh_show(struct seq_file *seq, void *v)
1193 if (v == SEQ_START_TOKEN)
1195 "addr callsign dev count use mode restart t0 tf digipeaters\n");
1197 struct rose_neigh *rose_neigh = v;
1199 /* if (!rose_neigh->loopback) { */
1200 seq_printf(seq, "%05d %-9s %-4s %3d %3d %3s %3s %3lu %3lu",
1202 (rose_neigh->loopback) ? "RSLOOP-0" : ax2asc(buf, &rose_neigh->callsign),
1203 rose_neigh->dev ? rose_neigh->dev->name : "???",
1206 (rose_neigh->dce_mode) ? "DCE" : "DTE",
1207 (rose_neigh->restarted) ? "yes" : "no",
1208 ax25_display_timer(&rose_neigh->t0timer) / HZ,
1209 ax25_display_timer(&rose_neigh->ftimer) / HZ);
1211 if (rose_neigh->digipeat != NULL) {
1212 for (i = 0; i < rose_neigh->digipeat->ndigi; i++)
1213 seq_printf(seq, " %s", ax2asc(buf, &rose_neigh->digipeat->calls[i]));
1216 seq_puts(seq, "\n");
1222 const struct seq_operations rose_neigh_seqops = {
1223 .start = rose_neigh_start,
1224 .next = rose_neigh_next,
1225 .stop = rose_neigh_stop,
1226 .show = rose_neigh_show,
1229 static void *rose_route_start(struct seq_file *seq, loff_t *pos)
1230 __acquires(rose_route_list_lock)
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)
1254 __releases(rose_route_list_lock)
1256 spin_unlock_bh(&rose_route_list_lock);
1259 static int rose_route_show(struct seq_file *seq, void *v)
1261 char buf[11], rsbuf[11];
1263 if (v == SEQ_START_TOKEN)
1265 "lci address callsign neigh <-> lci address callsign neigh\n");
1267 struct rose_route *rose_route = v;
1269 if (rose_route->neigh1)
1271 "%3.3X %-10s %-9s %05d ",
1273 rose2asc(rsbuf, &rose_route->src_addr),
1274 ax2asc(buf, &rose_route->src_call),
1275 rose_route->neigh1->number);
1280 if (rose_route->neigh2)
1282 "%3.3X %-10s %-9s %05d\n",
1284 rose2asc(rsbuf, &rose_route->dest_addr),
1285 ax2asc(buf, &rose_route->dest_call),
1286 rose_route->neigh2->number);
1294 struct seq_operations rose_route_seqops = {
1295 .start = rose_route_start,
1296 .next = rose_route_next,
1297 .stop = rose_route_stop,
1298 .show = rose_route_show,
1300 #endif /* CONFIG_PROC_FS */
1303 * Release all memory associated with ROSE routing structures.
1305 void __exit rose_rt_free(void)
1307 struct rose_neigh *s, *rose_neigh = rose_neigh_list;
1308 struct rose_node *t, *rose_node = rose_node_list;
1309 struct rose_route *u, *rose_route = rose_route_list;
1311 while (rose_neigh != NULL) {
1313 rose_neigh = rose_neigh->next;
1315 rose_remove_neigh(s);
1318 while (rose_node != NULL) {
1320 rose_node = rose_node->next;
1322 rose_remove_node(t);
1325 while (rose_route != NULL) {
1327 rose_route = rose_route->next;
1329 rose_remove_route(u);