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