net/rose/rose_route.c

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