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/sched.h>
  16 #include <linux/timer.h>
  17 #include <linux/string.h>
  18 #include <linux/sockios.h>
  19 #include <linux/net.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.h>
  28 #include <asm/system.h>
  29 #include <asm/uaccess.h>
  30 #include <linux/fcntl.h>
  31 #include <linux/termios.h>      /* For TIOCINQ/OUTQ */
  32 #include <linux/mm.h>
  33 #include <linux/interrupt.h>
  34 #include <linux/notifier.h>
  35 #include <linux/netfilter.h>
  36 #include <linux/init.h>
  37 #include <net/rose.h>
  38 #include <linux/seq_file.h>
  39
  40 static unsigned int rose_neigh_no = 1;
  41
  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;
  48
  49 struct rose_neigh *rose_loopback_neigh;
  50
  51 static void rose_remove_neigh(struct rose_neigh *);
  52
  53 /*
  54  *      Add a new route to a node, and in the process add the node and the
  55  *      neighbour if it is new.
  56  */
  57 static int rose_add_node(struct rose_route_struct *rose_route,
  58         struct net_device *dev)
  59 {
  60         struct rose_node  *rose_node, *rose_tmpn, *rose_tmpp;
  61         struct rose_neigh *rose_neigh;
  62         int i, res = 0;
  63
  64         spin_lock_bh(&rose_node_list_lock);
  65         spin_lock_bh(&rose_neigh_list_lock);
  66
  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))
  72                         break;
  73                 rose_node = rose_node->next;
  74         }
  75
  76         if (rose_node != NULL && rose_node->loopback) {
  77                 res = -EINVAL;
  78                 goto out;
  79         }
  80
  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)
  85                         break;
  86                 rose_neigh = rose_neigh->next;
  87         }
  88
  89         if (rose_neigh == NULL) {
  90                 rose_neigh = kmalloc(sizeof(*rose_neigh), GFP_ATOMIC);
  91                 if (rose_neigh == NULL) {
  92                         res = -ENOMEM;
  93                         goto out;
  94                 }
  95
  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;
 101                 rose_neigh->use       = 0;
 102                 rose_neigh->dce_mode  = 0;
 103                 rose_neigh->loopback  = 0;
 104                 rose_neigh->number    = rose_neigh_no++;
 105                 rose_neigh->restarted = 0;
 106
 107                 skb_queue_head_init(&rose_neigh->queue);
 108
 109                 init_timer(&rose_neigh->ftimer);
 110                 init_timer(&rose_neigh->t0timer);
 111
 112                 if (rose_route->ndigis != 0) {
 113                         if ((rose_neigh->digipeat = kmalloc(sizeof(ax25_digi), GFP_KERNEL)) == 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         spin_lock_bh(&rose_node_list_lock);
 210         if ((s = rose_node_list) == rose_node) {
 211                 rose_node_list = rose_node->next;
 212                 kfree(rose_node);
 213                 return;
 214         }
 215
 216         while (s != NULL && s->next != NULL) {
 217                 if (s->next == rose_node) {
 218                         s->next = rose_node->next;
 219                         kfree(rose_node);
 220                         return;
 221                 }
 222
 223                 s = s->next;
 224         }
 225 }
 226
 227 /*
 228  * Caller is holding rose_neigh_list_lock.
 229  */
 230 static void rose_remove_neigh(struct rose_neigh *rose_neigh)
 231 {
 232         struct rose_neigh *s;
 233
 234         rose_stop_ftimer(rose_neigh);
 235         rose_stop_t0timer(rose_neigh);
 236
 237         skb_queue_purge(&rose_neigh->queue);
 238
 239         spin_lock_bh(&rose_neigh_list_lock);
 240
 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);
 246                 kfree(rose_neigh);
 247                 return;
 248         }
 249
 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);
 256                         kfree(rose_neigh);
 257                         return;
 258                 }
 259
 260                 s = s->next;
 261         }
 262         spin_unlock_bh(&rose_neigh_list_lock);
 263 }
 264
 265 /*
 266  * Caller is holding rose_route_list_lock.
 267  */
 268 static void rose_remove_route(struct rose_route *rose_route)
 269 {
 270         struct rose_route *s;
 271
 272         if (rose_route->neigh1 != NULL)
 273                 rose_route->neigh1->use--;
 274
 275         if (rose_route->neigh2 != NULL)
 276                 rose_route->neigh2->use--;
 277
 278         if ((s = rose_route_list) == rose_route) {
 279                 rose_route_list = rose_route->next;
 280                 kfree(rose_route);
 281                 return;
 282         }
 283
 284         while (s != NULL && s->next != NULL) {
 285                 if (s->next == rose_route) {
 286                         s->next = rose_route->next;
 287                         kfree(rose_route);
 288                         return;
 289                 }
 290
 291                 s = s->next;
 292         }
 293 }
 294
 295 /*
 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.
 298  */
 299 static int rose_del_node(struct rose_route_struct *rose_route,
 300         struct net_device *dev)
 301 {
 302         struct rose_node  *rose_node;
 303         struct rose_neigh *rose_neigh;
 304         int i, err = 0;
 305
 306         spin_lock_bh(&rose_node_list_lock);
 307         spin_lock_bh(&rose_neigh_list_lock);
 308
 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))
 314                         break;
 315                 rose_node = rose_node->next;
 316         }
 317
 318         if (rose_node == NULL || rose_node->loopback) {
 319                 err = -EINVAL;
 320                 goto out;
 321         }
 322
 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)
 327                         break;
 328                 rose_neigh = rose_neigh->next;
 329         }
 330
 331         if (rose_neigh == NULL) {
 332                 err = -EINVAL;
 333                 goto out;
 334         }
 335
 336         for (i = 0; i < rose_node->count; i++) {
 337                 if (rose_node->neighbour[i] == rose_neigh) {
 338                         rose_neigh->count--;
 339
 340                         if (rose_neigh->count == 0 && rose_neigh->use == 0)
 341                                 rose_remove_neigh(rose_neigh);
 342
 343                         rose_node->count--;
 344
 345                         if (rose_node->count == 0) {
 346                                 rose_remove_node(rose_node);
 347                         } else {
 348                                 switch (i) {
 349                                 case 0:
 350                                         rose_node->neighbour[0] =
 351                                                 rose_node->neighbour[1];
 352                                 case 1:
 353                                         rose_node->neighbour[1] =
 354                                                 rose_node->neighbour[2];
 355                                 case 2:
 356                                         break;
 357                                 }
 358                         }
 359                         goto out;
 360                 }
 361         }
 362         err = -EINVAL;
 363
 364 out:
 365         spin_unlock_bh(&rose_neigh_list_lock);
 366         spin_unlock_bh(&rose_node_list_lock);
 367
 368         return err;
 369 }
 370
 371 /*
 372  *      Add the loopback neighbour.
 373  */
 374 int rose_add_loopback_neigh(void)
 375 {
 376         if ((rose_loopback_neigh = kmalloc(sizeof(struct rose_neigh), GFP_ATOMIC)) == NULL)
 377                 return -ENOMEM;
 378
 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;
 389
 390         skb_queue_head_init(&rose_loopback_neigh->queue);
 391
 392         init_timer(&rose_loopback_neigh->ftimer);
 393         init_timer(&rose_loopback_neigh->t0timer);
 394
 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);
 399
 400         return 0;
 401 }
 402
 403 /*
 404  *      Add a loopback node.
 405  */
 406 int rose_add_loopback_node(rose_address *address)
 407 {
 408         struct rose_node *rose_node;
 409         unsigned int err = 0;
 410
 411         spin_lock_bh(&rose_node_list_lock);
 412
 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) &&
 417                      rose_node->loopback)
 418                         break;
 419                 rose_node = rose_node->next;
 420         }
 421
 422         if (rose_node != NULL)
 423                 goto out;
 424
 425         if ((rose_node = kmalloc(sizeof(*rose_node), GFP_ATOMIC)) == NULL) {
 426                 err = -ENOMEM;
 427                 goto out;
 428         }
 429
 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;
 435
 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;
 439
 440         rose_loopback_neigh->count++;
 441
 442 out:
 443         spin_unlock_bh(&rose_node_list_lock);
 444
 445         return 0;
 446 }
 447
 448 /*
 449  *      Delete a loopback node.
 450  */
 451 void rose_del_loopback_node(rose_address *address)
 452 {
 453         struct rose_node *rose_node;
 454
 455         spin_lock_bh(&rose_node_list_lock);
 456
 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) &&
 461                     rose_node->loopback)
 462                         break;
 463                 rose_node = rose_node->next;
 464         }
 465
 466         if (rose_node == NULL)
 467                 goto out;
 468
 469         rose_remove_node(rose_node);
 470
 471         rose_loopback_neigh->count--;
 472
 473 out:
 474         spin_unlock_bh(&rose_node_list_lock);
 475 }
 476
 477 /*
 478  *      A device has been removed. Remove its routes and neighbours.
 479  */
 480 void rose_rt_device_down(struct net_device *dev)
 481 {
 482         struct rose_neigh *s, *rose_neigh;
 483         struct rose_node  *t, *rose_node;
 484         int i;
 485
 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) {
 490                 s          = rose_neigh;
 491                 rose_neigh = rose_neigh->next;
 492
 493                 if (s->dev != dev)
 494                         continue;
 495
 496                 rose_node = rose_node_list;
 497
 498                 while (rose_node != NULL) {
 499                         t         = rose_node;
 500                         rose_node = rose_node->next;
 501
 502                         for (i = 0; i < t->count; i++) {
 503                                 if (t->neighbour[i] != s)
 504                                         continue;
 505
 506                                 t->count--;
 507
 508                                 switch (i) {
 509                                 case 0:
 510                                         t->neighbour[0] = t->neighbour[1];
 511                                 case 1:
 512                                         t->neighbour[1] = t->neighbour[2];
 513                                 case 2:
 514                                         break;
 515                                 }
 516                         }
 517
 518                         if (t->count <= 0)
 519                                 rose_remove_node(t);
 520                 }
 521
 522                 rose_remove_neigh(s);
 523         }
 524         spin_unlock_bh(&rose_neigh_list_lock);
 525         spin_unlock_bh(&rose_node_list_lock);
 526 }
 527
 528 #if 0 /* Currently unused */
 529 /*
 530  *      A device has been removed. Remove its links.
 531  */
 532 void rose_route_device_down(struct net_device *dev)
 533 {
 534         struct rose_route *s, *rose_route;
 535
 536         spin_lock_bh(&rose_route_list_lock);
 537         rose_route = rose_route_list;
 538         while (rose_route != NULL) {
 539                 s          = rose_route;
 540                 rose_route = rose_route->next;
 541
 542                 if (s->neigh1->dev == dev || s->neigh2->dev == dev)
 543                         rose_remove_route(s);
 544         }
 545         spin_unlock_bh(&rose_route_list_lock);
 546 }
 547 #endif
 548
 549 /*
 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.
 553  */
 554 static int rose_clear_routes(void)
 555 {
 556         struct rose_neigh *s, *rose_neigh;
 557         struct rose_node  *t, *rose_node;
 558
 559         spin_lock_bh(&rose_node_list_lock);
 560         spin_lock_bh(&rose_neigh_list_lock);
 561
 562         rose_neigh = rose_neigh_list;
 563         rose_node  = rose_node_list;
 564
 565         while (rose_node != NULL) {
 566                 t         = rose_node;
 567                 rose_node = rose_node->next;
 568                 if (!t->loopback)
 569                         rose_remove_node(t);
 570         }
 571
 572         while (rose_neigh != NULL) {
 573                 s          = rose_neigh;
 574                 rose_neigh = rose_neigh->next;
 575
 576                 if (s->use == 0 && !s->loopback) {
 577                         s->count = 0;
 578                         rose_remove_neigh(s);
 579                 }
 580         }
 581
 582         spin_unlock_bh(&rose_neigh_list_lock);
 583         spin_unlock_bh(&rose_node_list_lock);
 584
 585         return 0;
 586 }
 587
 588 /*
 589  *      Check that the device given is a valid AX.25 interface that is "up".
 590  */
 591 struct net_device *rose_ax25_dev_get(char *devname)
 592 {
 593         struct net_device *dev;
 594
 595         if ((dev = dev_get_by_name(devname)) == NULL)
 596                 return NULL;
 597
 598         if ((dev->flags & IFF_UP) && dev->type == ARPHRD_AX25)
 599                 return dev;
 600
 601         dev_put(dev);
 602         return NULL;
 603 }
 604
 605 /*
 606  *      Find the first active ROSE device, usually "rose0".
 607  */
 608 struct net_device *rose_dev_first(void)
 609 {
 610         struct net_device *dev, *first = NULL;
 611
 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)
 616                                 first = dev;
 617         }
 618         read_unlock(&dev_base_lock);
 619
 620         return first;
 621 }
 622
 623 /*
 624  *      Find the ROSE device for the given address.
 625  */
 626 struct net_device *rose_dev_get(rose_address *addr)
 627 {
 628         struct net_device *dev;
 629
 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) {
 633                         dev_hold(dev);
 634                         goto out;
 635                 }
 636         }
 637 out:
 638         read_unlock(&dev_base_lock);
 639         return dev;
 640 }
 641
 642 static int rose_dev_exists(rose_address *addr)
 643 {
 644         struct net_device *dev;
 645
 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)
 649                         goto out;
 650         }
 651 out:
 652         read_unlock(&dev_base_lock);
 653         return dev != NULL;
 654 }
 655
 656
 657
 658
 659 struct rose_route *rose_route_free_lci(unsigned int lci, struct rose_neigh *neigh)
 660 {
 661         struct rose_route *rose_route;
 662
 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))
 666                         return rose_route;
 667
 668         return NULL;
 669 }
 670
 671 /*
 672  *      Find a neighbour given a ROSE address.
 673  */
 674 struct rose_neigh *rose_get_neigh(rose_address *addr, unsigned char *cause,
 675         unsigned char *diagnostic)
 676 {
 677         struct rose_neigh *res = NULL;
 678         struct rose_node *node;
 679         int failed = 0;
 680         int i;
 681
 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];
 688                                         goto out;
 689                                 } else
 690                                         failed = 1;
 691                         }
 692                         break;
 693                 }
 694         }
 695
 696         if (failed) {
 697                 *cause      = ROSE_OUT_OF_ORDER;
 698                 *diagnostic = 0;
 699         } else {
 700                 *cause      = ROSE_NOT_OBTAINABLE;
 701                 *diagnostic = 0;
 702         }
 703
 704 out:
 705         spin_unlock_bh(&rose_node_list_lock);
 706
 707         return res;
 708 }
 709
 710 /*
 711  *      Handle the ioctls that control the routing functions.
 712  */
 713 int rose_rt_ioctl(unsigned int cmd, void __user *arg)
 714 {
 715         struct rose_route_struct rose_route;
 716         struct net_device *dev;
 717         int err;
 718
 719         switch (cmd) {
 720         case SIOCADDRT:
 721                 if (copy_from_user(&rose_route, arg, sizeof(struct rose_route_struct)))
 722                         return -EFAULT;
 723                 if ((dev = rose_ax25_dev_get(rose_route.device)) == NULL)
 724                         return -EINVAL;
 725                 if (rose_dev_exists(&rose_route.address)) { /* Can't add routes to ourself */
 726                         dev_put(dev);
 727                         return -EINVAL;
 728                 }
 729                 if (rose_route.mask > 10) /* Mask can't be more than 10 digits */
 730                         return -EINVAL;
 731
 732                 err = rose_add_node(&rose_route, dev);
 733                 dev_put(dev);
 734                 return err;
 735
 736         case SIOCDELRT:
 737                 if (copy_from_user(&rose_route, arg, sizeof(struct rose_route_struct)))
 738                         return -EFAULT;
 739                 if ((dev = rose_ax25_dev_get(rose_route.device)) == NULL)
 740                         return -EINVAL;
 741                 err = rose_del_node(&rose_route, dev);
 742                 dev_put(dev);
 743                 return err;
 744
 745         case SIOCRSCLRRT:
 746                 return rose_clear_routes();
 747
 748         default:
 749                 return -EINVAL;
 750         }
 751
 752         return 0;
 753 }
 754
 755 static void rose_del_route_by_neigh(struct rose_neigh *rose_neigh)
 756 {
 757         struct rose_route *rose_route, *s;
 758
 759         rose_neigh->restarted = 0;
 760
 761         rose_stop_t0timer(rose_neigh);
 762         rose_start_ftimer(rose_neigh);
 763
 764         skb_queue_purge(&rose_neigh->queue);
 765
 766         spin_lock_bh(&rose_route_list_lock);
 767
 768         rose_route = rose_route_list;
 769
 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);
 776                         rose_route = s;
 777                         continue;
 778                 }
 779
 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);
 784                 }
 785
 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);
 790                 }
 791
 792                 rose_route = rose_route->next;
 793         }
 794         spin_unlock_bh(&rose_route_list_lock);
 795 }
 796
 797 /*
 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.
 801  */
 802 void rose_link_failed(ax25_cb *ax25, int reason)
 803 {
 804         struct rose_neigh *rose_neigh;
 805
 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)
 810                         break;
 811                 rose_neigh = rose_neigh->next;
 812         }
 813
 814         if (rose_neigh != NULL) {
 815                 rose_neigh->ax25 = NULL;
 816
 817                 rose_del_route_by_neigh(rose_neigh);
 818                 rose_kill_by_neigh(rose_neigh);
 819         }
 820         spin_unlock_bh(&rose_neigh_list_lock);
 821 }
 822
 823 /*
 824  *      A device has been "downed" remove its link status. Blow away all
 825  *      through routes and connections that use this device.
 826  */
 827 void rose_link_device_down(struct net_device *dev)
 828 {
 829         struct rose_neigh *rose_neigh;
 830
 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);
 835                 }
 836         }
 837 }
 838
 839 /*
 840  *      Route a frame to an appropriate AX.25 connection.
 841  */
 842 int rose_route_frame(struct sk_buff *skb, ax25_cb *ax25)
 843 {
 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;
 848         struct sock *sk;
 849         unsigned short frametype;
 850         unsigned int lci, new_lci;
 851         unsigned char cause, diagnostic;
 852         struct net_device *dev;
 853         int len, res = 0;
 854
 855 #if 0
 856         if (call_in_firewall(PF_ROSE, skb->dev, skb->data, NULL, &skb) != FW_ACCEPT)
 857                 return res;
 858 #endif
 859
 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);
 864
 865         spin_lock_bh(&rose_node_list_lock);
 866         spin_lock_bh(&rose_neigh_list_lock);
 867         spin_lock_bh(&rose_route_list_lock);
 868
 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)
 873                         break;
 874                 rose_neigh = rose_neigh->next;
 875         }
 876
 877         if (rose_neigh == NULL) {
 878                 printk("rose_route : unknown neighbour or device %s\n",
 879                        ax2asc(&ax25->dest_addr));
 880                 goto out;
 881         }
 882
 883         /*
 884          *      Obviously the link is working, halt the ftimer.
 885          */
 886         rose_stop_ftimer(rose_neigh);
 887
 888         /*
 889          *      LCI of zero is always for us, and its always a restart
 890          *      frame.
 891          */
 892         if (lci == 0) {
 893                 rose_link_rx_restart(skb, rose_neigh, frametype);
 894                 goto out;
 895         }
 896
 897         /*
 898          *      Find an existing socket.
 899          */
 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;
 909                         rose->lci        = 0;
 910                         rose->state      = ROSE_STATE_0;
 911                         sk->sk_state     = TCP_CLOSE;
 912                         sk->sk_err       = 0;
 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);
 917                         }
 918                 }
 919                 else {
 920                         skb->h.raw = skb->data;
 921                         res = rose_process_rx_frame(sk, skb);
 922                         goto out;
 923                 }
 924         }
 925
 926         /*
 927          *      Is is a Call Request and is it for us ?
 928          */
 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);
 932                         dev_put(dev);
 933                         goto out;
 934                 }
 935
 936         if (!sysctl_rose_routing_control) {
 937                 rose_transmit_clear_request(rose_neigh, lci, ROSE_NOT_OBTAINABLE, 0);
 938                 goto out;
 939         }
 940
 941         /*
 942          *      Route it to the next in line if we have an entry for it.
 943          */
 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);
 951                                 break;
 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);
 959                                 res = 1;
 960                                 goto out;
 961                         } else {
 962                                 if (frametype == ROSE_CLEAR_CONFIRMATION)
 963                                         rose_remove_route(rose_route);
 964                                 goto out;
 965                         }
 966                 }
 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);
 972                                 break;
 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);
 980                                 res = 1;
 981                                 goto out;
 982                         } else {
 983                                 if (frametype == ROSE_CLEAR_CONFIRMATION)
 984                                         rose_remove_route(rose_route);
 985                                 goto out;
 986                         }
 987                 }
 988                 rose_route = rose_route->next;
 989         }
 990
 991         /*
 992          *      We know that:
 993          *      1. The frame isn't for us,
 994          *      2. It isn't "owned" by any existing route.
 995          */
 996         if (frametype != ROSE_CALL_REQUEST)     /* XXX */
 997                 return 0;
 998
 999         len  = (((skb->data[3] >> 4) & 0x0F) + 1) / 2;
1000         len += (((skb->data[3] >> 0) & 0x0F) + 1) / 2;
1001
1002         memset(&facilities, 0x00, sizeof(struct rose_facilities_struct));
1003
1004         if (!rose_parse_facilities(skb->data + len + 4, &facilities)) {
1005                 rose_transmit_clear_request(rose_neigh, lci, ROSE_INVALID_FACILITY, 76);
1006                 goto out;
1007         }
1008
1009         /*
1010          *      Check for routing loops.
1011          */
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);
1019                         goto out;
1020                 }
1021                 rose_route = rose_route->next;
1022         }
1023
1024         if ((new_neigh = rose_get_neigh(dest_addr, &cause, &diagnostic)) == NULL) {
1025                 rose_transmit_clear_request(rose_neigh, lci, cause, diagnostic);
1026                 goto out;
1027         }
1028
1029         if ((new_lci = rose_new_lci(new_neigh)) == 0) {
1030                 rose_transmit_clear_request(rose_neigh, lci, ROSE_NETWORK_CONGESTION, 71);
1031                 goto out;
1032         }
1033
1034         if ((rose_route = kmalloc(sizeof(*rose_route), GFP_ATOMIC)) == NULL) {
1035                 rose_transmit_clear_request(rose_neigh, lci, ROSE_NETWORK_CONGESTION, 120);
1036                 goto out;
1037         }
1038
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;
1048
1049         rose_route->neigh1->use++;
1050         rose_route->neigh2->use++;
1051
1052         rose_route->next = rose_route_list;
1053         rose_route_list  = rose_route;
1054
1055         skb->data[0] &= 0xF0;
1056         skb->data[0] |= (rose_route->lci2 >> 8) & 0x0F;
1057         skb->data[1]  = (rose_route->lci2 >> 0) & 0xFF;
1058
1059         rose_transmit_link(skb, rose_route->neigh2);
1060         res = 1;
1061
1062 out:
1063         spin_unlock_bh(&rose_route_list_lock);
1064         spin_unlock_bh(&rose_neigh_list_lock);
1065         spin_unlock_bh(&rose_node_list_lock);
1066
1067         return res;
1068 }
1069
1070 #ifdef CONFIG_PROC_FS
1071
1072 static void *rose_node_start(struct seq_file *seq, loff_t *pos)
1073 {
1074         struct rose_node *rose_node;
1075         int i = 1;
1076
1077         spin_lock_bh(&rose_neigh_list_lock);
1078         if (*pos == 0)
1079                 return SEQ_START_TOKEN;
1080
1081         for (rose_node = rose_node_list; rose_node && i < *pos;
1082              rose_node = rose_node->next, ++i);
1083
1084         return (i == *pos) ? rose_node : NULL;
1085 }
1086
1087 static void *rose_node_next(struct seq_file *seq, void *v, loff_t *pos)
1088 {
1089         ++*pos;
1090
1091         return (v == SEQ_START_TOKEN) ? rose_node_list
1092                 : ((struct rose_node *)v)->next;
1093 }
1094
1095 static void rose_node_stop(struct seq_file *seq, void *v)
1096 {
1097         spin_unlock_bh(&rose_neigh_list_lock);
1098 }
1099
1100 static int rose_node_show(struct seq_file *seq, void *v)
1101 {
1102         int i;
1103
1104         if (v == SEQ_START_TOKEN)
1105                 seq_puts(seq, "address    mask n neigh neigh neigh\n");
1106         else {
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),
1111                                 rose_node->mask);
1112                 } else { */
1113                         seq_printf(seq, "%-10s %04d %d",
1114                                 rose2asc(&rose_node->address),
1115                                 rose_node->mask,
1116                                 rose_node->count);
1117
1118                         for (i = 0; i < rose_node->count; i++)
1119                                 seq_printf(seq, " %05d",
1120                                         rose_node->neighbour[i]->number);
1121
1122                         seq_puts(seq, "\n");
1123                 /* } */
1124         }
1125         return 0;
1126 }
1127
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,
1133 };
1134
1135 static int rose_nodes_open(struct inode *inode, struct file *file)
1136 {
1137         return seq_open(file, &rose_node_seqops);
1138 }
1139
1140 struct file_operations rose_nodes_fops = {
1141         .owner = THIS_MODULE,
1142         .open = rose_nodes_open,
1143         .read = seq_read,
1144         .llseek = seq_lseek,
1145         .release = seq_release,
1146 };
1147
1148 static void *rose_neigh_start(struct seq_file *seq, loff_t *pos)
1149 {
1150         struct rose_neigh *rose_neigh;
1151         int i = 1;
1152
1153         spin_lock_bh(&rose_neigh_list_lock);
1154         if (*pos == 0)
1155                 return SEQ_START_TOKEN;
1156
1157         for (rose_neigh = rose_neigh_list; rose_neigh && i < *pos;
1158              rose_neigh = rose_neigh->next, ++i);
1159
1160         return (i == *pos) ? rose_neigh : NULL;
1161 }
1162
1163 static void *rose_neigh_next(struct seq_file *seq, void *v, loff_t *pos)
1164 {
1165         ++*pos;
1166
1167         return (v == SEQ_START_TOKEN) ? rose_neigh_list
1168                 : ((struct rose_neigh *)v)->next;
1169 }
1170
1171 static void rose_neigh_stop(struct seq_file *seq, void *v)
1172 {
1173         spin_unlock_bh(&rose_neigh_list_lock);
1174 }
1175
1176 static int rose_neigh_show(struct seq_file *seq, void *v)
1177 {
1178         int i;
1179
1180         if (v == SEQ_START_TOKEN)
1181                 seq_puts(seq,
1182                          "addr  callsign  dev  count use mode restart  t0  tf digipeaters\n");
1183         else {
1184                 struct rose_neigh *rose_neigh = v;
1185
1186                 /* if (!rose_neigh->loopback) { */
1187                 seq_printf(seq, "%05d %-9s %-4s   %3d %3d  %3s     %3s %3lu %3lu",
1188                            rose_neigh->number,
1189                            (rose_neigh->loopback) ? "RSLOOP-0" : ax2asc(&rose_neigh->callsign),
1190                            rose_neigh->dev ? rose_neigh->dev->name : "???",
1191                            rose_neigh->count,
1192                            rose_neigh->use,
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);
1197
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]));
1201                 }
1202
1203                 seq_puts(seq, "\n");
1204         }
1205         return 0;
1206 }
1207
1208
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,
1214 };
1215
1216 static int rose_neigh_open(struct inode *inode, struct file *file)
1217 {
1218         return seq_open(file, &rose_neigh_seqops);
1219 }
1220
1221 struct file_operations rose_neigh_fops = {
1222         .owner = THIS_MODULE,
1223         .open = rose_neigh_open,
1224         .read = seq_read,
1225         .llseek = seq_lseek,
1226         .release = seq_release,
1227 };
1228
1229
1230 static void *rose_route_start(struct seq_file *seq, loff_t *pos)
1231 {
1232         struct rose_route *rose_route;
1233         int i = 1;
1234
1235         spin_lock_bh(&rose_route_list_lock);
1236         if (*pos == 0)
1237                 return SEQ_START_TOKEN;
1238
1239         for (rose_route = rose_route_list; rose_route && i < *pos;
1240              rose_route = rose_route->next, ++i);
1241
1242         return (i == *pos) ? rose_route : NULL;
1243 }
1244
1245 static void *rose_route_next(struct seq_file *seq, void *v, loff_t *pos)
1246 {
1247         ++*pos;
1248
1249         return (v == SEQ_START_TOKEN) ? rose_route_list
1250                 : ((struct rose_route *)v)->next;
1251 }
1252
1253 static void rose_route_stop(struct seq_file *seq, void *v)
1254 {
1255         spin_unlock_bh(&rose_route_list_lock);
1256 }
1257
1258 static int rose_route_show(struct seq_file *seq, void *v)
1259 {
1260         if (v == SEQ_START_TOKEN)
1261                 seq_puts(seq,
1262                          "lci  address     callsign   neigh  <-> lci  address     callsign   neigh\n");
1263         else {
1264                 struct rose_route *rose_route = v;
1265
1266                 if (rose_route->neigh1)
1267                         seq_printf(seq,
1268                                    "%3.3X  %-10s  %-9s  %05d      ",
1269                                    rose_route->lci1,
1270                                    rose2asc(&rose_route->src_addr),
1271                                    ax2asc(&rose_route->src_call),
1272                                    rose_route->neigh1->number);
1273                 else
1274                         seq_puts(seq,
1275                                  "000  *           *          00000      ");
1276
1277                 if (rose_route->neigh2)
1278                         seq_printf(seq,
1279                                    "%3.3X  %-10s  %-9s  %05d\n",
1280                                 rose_route->lci2,
1281                                 rose2asc(&rose_route->dest_addr),
1282                                 ax2asc(&rose_route->dest_call),
1283                                 rose_route->neigh2->number);
1284                  else
1285                          seq_puts(seq,
1286                                   "000  *           *          00000\n");
1287                 }
1288         return 0;
1289 }
1290
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,
1296 };
1297
1298 static int rose_route_open(struct inode *inode, struct file *file)
1299 {
1300         return seq_open(file, &rose_route_seqops);
1301 }
1302
1303 struct file_operations rose_routes_fops = {
1304         .owner = THIS_MODULE,
1305         .open = rose_route_open,
1306         .read = seq_read,
1307         .llseek = seq_lseek,
1308         .release = seq_release,
1309 };
1310
1311 #endif /* CONFIG_PROC_FS */
1312
1313 /*
1314  *      Release all memory associated with ROSE routing structures.
1315  */
1316 void __exit rose_rt_free(void)
1317 {
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;
1321
1322         while (rose_neigh != NULL) {
1323                 s          = rose_neigh;
1324                 rose_neigh = rose_neigh->next;
1325
1326                 rose_remove_neigh(s);
1327         }
1328
1329         while (rose_node != NULL) {
1330                 t         = rose_node;
1331                 rose_node = rose_node->next;
1332
1333                 rose_remove_node(t);
1334         }
1335
1336         while (rose_route != NULL) {
1337                 u          = rose_route;
1338                 rose_route = rose_route->next;
1339
1340                 rose_remove_route(u);
1341         }
1342 }