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_states.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 DEFINE_SPINLOCK(rose_node_list_lock);
  44 static struct rose_neigh *rose_neigh_list;
  45 static DEFINE_SPINLOCK(rose_neigh_list_lock);
  46 static struct rose_route *rose_route_list;
  47 static DEFINE_SPINLOCK(rose_route_list_lock);
  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         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         rose_stop_ftimer(rose_neigh);
 234         rose_stop_t0timer(rose_neigh);
 235
 236         skb_queue_purge(&rose_neigh->queue);
 237
 238         spin_lock_bh(&rose_neigh_list_lock);
 239
 240         if ((s = rose_neigh_list) == rose_neigh) {
 241                 rose_neigh_list = rose_neigh->next;
 242                 spin_unlock_bh(&rose_neigh_list_lock);
 243                 if (rose_neigh->digipeat != NULL)
 244                         kfree(rose_neigh->digipeat);
 245                 kfree(rose_neigh);
 246                 return;
 247         }
 248
 249         while (s != NULL && s->next != NULL) {
 250                 if (s->next == rose_neigh) {
 251                         s->next = rose_neigh->next;
 252                         spin_unlock_bh(&rose_neigh_list_lock);
 253                         if (rose_neigh->digipeat != NULL)
 254                                 kfree(rose_neigh->digipeat);
 255                         kfree(rose_neigh);
 256                         return;
 257                 }
 258
 259                 s = s->next;
 260         }
 261         spin_unlock_bh(&rose_neigh_list_lock);
 262 }
 263
 264 /*
 265  * Caller is holding rose_route_list_lock.
 266  */
 267 static void rose_remove_route(struct rose_route *rose_route)
 268 {
 269         struct rose_route *s;
 270
 271         if (rose_route->neigh1 != NULL)
 272                 rose_route->neigh1->use--;
 273
 274         if (rose_route->neigh2 != NULL)
 275                 rose_route->neigh2->use--;
 276
 277         if ((s = rose_route_list) == rose_route) {
 278                 rose_route_list = rose_route->next;
 279                 kfree(rose_route);
 280                 return;
 281         }
 282
 283         while (s != NULL && s->next != NULL) {
 284                 if (s->next == rose_route) {
 285                         s->next = rose_route->next;
 286                         kfree(rose_route);
 287                         return;
 288                 }
 289
 290                 s = s->next;
 291         }
 292 }
 293
 294 /*
 295  *      "Delete" a node. Strictly speaking remove a route to a node. The node
 296  *      is only deleted if no routes are left to it.
 297  */
 298 static int rose_del_node(struct rose_route_struct *rose_route,
 299         struct net_device *dev)
 300 {
 301         struct rose_node  *rose_node;
 302         struct rose_neigh *rose_neigh;
 303         int i, err = 0;
 304
 305         spin_lock_bh(&rose_node_list_lock);
 306         spin_lock_bh(&rose_neigh_list_lock);
 307
 308         rose_node = rose_node_list;
 309         while (rose_node != NULL) {
 310                 if ((rose_node->mask == rose_route->mask) &&
 311                     (rosecmpm(&rose_route->address, &rose_node->address,
 312                               rose_route->mask) == 0))
 313                         break;
 314                 rose_node = rose_node->next;
 315         }
 316
 317         if (rose_node == NULL || rose_node->loopback) {
 318                 err = -EINVAL;
 319                 goto out;
 320         }
 321
 322         rose_neigh = rose_neigh_list;
 323         while (rose_neigh != NULL) {
 324                 if (ax25cmp(&rose_route->neighbour, &rose_neigh->callsign) == 0
 325                     && rose_neigh->dev == dev)
 326                         break;
 327                 rose_neigh = rose_neigh->next;
 328         }
 329
 330         if (rose_neigh == NULL) {
 331                 err = -EINVAL;
 332                 goto out;
 333         }
 334
 335         for (i = 0; i < rose_node->count; i++) {
 336                 if (rose_node->neighbour[i] == rose_neigh) {
 337                         rose_neigh->count--;
 338
 339                         if (rose_neigh->count == 0 && rose_neigh->use == 0)
 340                                 rose_remove_neigh(rose_neigh);
 341
 342                         rose_node->count--;
 343
 344                         if (rose_node->count == 0) {
 345                                 rose_remove_node(rose_node);
 346                         } else {
 347                                 switch (i) {
 348                                 case 0:
 349                                         rose_node->neighbour[0] =
 350                                                 rose_node->neighbour[1];
 351                                 case 1:
 352                                         rose_node->neighbour[1] =
 353                                                 rose_node->neighbour[2];
 354                                 case 2:
 355                                         break;
 356                                 }
 357                         }
 358                         goto out;
 359                 }
 360         }
 361         err = -EINVAL;
 362
 363 out:
 364         spin_unlock_bh(&rose_neigh_list_lock);
 365         spin_unlock_bh(&rose_node_list_lock);
 366
 367         return err;
 368 }
 369
 370 /*
 371  *      Add the loopback neighbour.
 372  */
 373 int rose_add_loopback_neigh(void)
 374 {
 375         if ((rose_loopback_neigh = kmalloc(sizeof(struct rose_neigh), GFP_ATOMIC)) == NULL)
 376                 return -ENOMEM;
 377
 378         rose_loopback_neigh->callsign  = null_ax25_address;
 379         rose_loopback_neigh->digipeat  = NULL;
 380         rose_loopback_neigh->ax25      = NULL;
 381         rose_loopback_neigh->dev       = NULL;
 382         rose_loopback_neigh->count     = 0;
 383         rose_loopback_neigh->use       = 0;
 384         rose_loopback_neigh->dce_mode  = 1;
 385         rose_loopback_neigh->loopback  = 1;
 386         rose_loopback_neigh->number    = rose_neigh_no++;
 387         rose_loopback_neigh->restarted = 1;
 388
 389         skb_queue_head_init(&rose_loopback_neigh->queue);
 390
 391         init_timer(&rose_loopback_neigh->ftimer);
 392         init_timer(&rose_loopback_neigh->t0timer);
 393
 394         spin_lock_bh(&rose_neigh_list_lock);
 395         rose_loopback_neigh->next = rose_neigh_list;
 396         rose_neigh_list           = rose_loopback_neigh;
 397         spin_unlock_bh(&rose_neigh_list_lock);
 398
 399         return 0;
 400 }
 401
 402 /*
 403  *      Add a loopback node.
 404  */
 405 int rose_add_loopback_node(rose_address *address)
 406 {
 407         struct rose_node *rose_node;
 408         unsigned int err = 0;
 409
 410         spin_lock_bh(&rose_node_list_lock);
 411
 412         rose_node = rose_node_list;
 413         while (rose_node != NULL) {
 414                 if ((rose_node->mask == 10) &&
 415                      (rosecmpm(address, &rose_node->address, 10) == 0) &&
 416                      rose_node->loopback)
 417                         break;
 418                 rose_node = rose_node->next;
 419         }
 420
 421         if (rose_node != NULL)
 422                 goto out;
 423
 424         if ((rose_node = kmalloc(sizeof(*rose_node), GFP_ATOMIC)) == NULL) {
 425                 err = -ENOMEM;
 426                 goto out;
 427         }
 428
 429         rose_node->address      = *address;
 430         rose_node->mask         = 10;
 431         rose_node->count        = 1;
 432         rose_node->loopback     = 1;
 433         rose_node->neighbour[0] = rose_loopback_neigh;
 434
 435         /* Insert at the head of list. Address is always mask=10 */
 436         rose_node->next = rose_node_list;
 437         rose_node_list  = rose_node;
 438
 439         rose_loopback_neigh->count++;
 440
 441 out:
 442         spin_unlock_bh(&rose_node_list_lock);
 443
 444         return 0;
 445 }
 446
 447 /*
 448  *      Delete a loopback node.
 449  */
 450 void rose_del_loopback_node(rose_address *address)
 451 {
 452         struct rose_node *rose_node;
 453
 454         spin_lock_bh(&rose_node_list_lock);
 455
 456         rose_node = rose_node_list;
 457         while (rose_node != NULL) {
 458                 if ((rose_node->mask == 10) &&
 459                     (rosecmpm(address, &rose_node->address, 10) == 0) &&
 460                     rose_node->loopback)
 461                         break;
 462                 rose_node = rose_node->next;
 463         }
 464
 465         if (rose_node == NULL)
 466                 goto out;
 467
 468         rose_remove_node(rose_node);
 469
 470         rose_loopback_neigh->count--;
 471
 472 out:
 473         spin_unlock_bh(&rose_node_list_lock);
 474 }
 475
 476 /*
 477  *      A device has been removed. Remove its routes and neighbours.
 478  */
 479 void rose_rt_device_down(struct net_device *dev)
 480 {
 481         struct rose_neigh *s, *rose_neigh;
 482         struct rose_node  *t, *rose_node;
 483         int i;
 484
 485         spin_lock_bh(&rose_node_list_lock);
 486         spin_lock_bh(&rose_neigh_list_lock);
 487         rose_neigh = rose_neigh_list;
 488         while (rose_neigh != NULL) {
 489                 s          = rose_neigh;
 490                 rose_neigh = rose_neigh->next;
 491
 492                 if (s->dev != dev)
 493                         continue;
 494
 495                 rose_node = rose_node_list;
 496
 497                 while (rose_node != NULL) {
 498                         t         = rose_node;
 499                         rose_node = rose_node->next;
 500
 501                         for (i = 0; i < t->count; i++) {
 502                                 if (t->neighbour[i] != s)
 503                                         continue;
 504
 505                                 t->count--;
 506
 507                                 switch (i) {
 508                                 case 0:
 509                                         t->neighbour[0] = t->neighbour[1];
 510                                 case 1:
 511                                         t->neighbour[1] = t->neighbour[2];
 512                                 case 2:
 513                                         break;
 514                                 }
 515                         }
 516
 517                         if (t->count <= 0)
 518                                 rose_remove_node(t);
 519                 }
 520
 521                 rose_remove_neigh(s);
 522         }
 523         spin_unlock_bh(&rose_neigh_list_lock);
 524         spin_unlock_bh(&rose_node_list_lock);
 525 }
 526
 527 #if 0 /* Currently unused */
 528 /*
 529  *      A device has been removed. Remove its links.
 530  */
 531 void rose_route_device_down(struct net_device *dev)
 532 {
 533         struct rose_route *s, *rose_route;
 534
 535         spin_lock_bh(&rose_route_list_lock);
 536         rose_route = rose_route_list;
 537         while (rose_route != NULL) {
 538                 s          = rose_route;
 539                 rose_route = rose_route->next;
 540
 541                 if (s->neigh1->dev == dev || s->neigh2->dev == dev)
 542                         rose_remove_route(s);
 543         }
 544         spin_unlock_bh(&rose_route_list_lock);
 545 }
 546 #endif
 547
 548 /*
 549  *      Clear all nodes and neighbours out, except for neighbours with
 550  *      active connections going through them.
 551  *  Do not clear loopback neighbour and nodes.
 552  */
 553 static int rose_clear_routes(void)
 554 {
 555         struct rose_neigh *s, *rose_neigh;
 556         struct rose_node  *t, *rose_node;
 557
 558         spin_lock_bh(&rose_node_list_lock);
 559         spin_lock_bh(&rose_neigh_list_lock);
 560
 561         rose_neigh = rose_neigh_list;
 562         rose_node  = rose_node_list;
 563
 564         while (rose_node != NULL) {
 565                 t         = rose_node;
 566                 rose_node = rose_node->next;
 567                 if (!t->loopback)
 568                         rose_remove_node(t);
 569         }
 570
 571         while (rose_neigh != NULL) {
 572                 s          = rose_neigh;
 573                 rose_neigh = rose_neigh->next;
 574
 575                 if (s->use == 0 && !s->loopback) {
 576                         s->count = 0;
 577                         rose_remove_neigh(s);
 578                 }
 579         }
 580
 581         spin_unlock_bh(&rose_neigh_list_lock);
 582         spin_unlock_bh(&rose_node_list_lock);
 583
 584         return 0;
 585 }
 586
 587 /*
 588  *      Check that the device given is a valid AX.25 interface that is "up".
 589  */
 590 static struct net_device *rose_ax25_dev_get(char *devname)
 591 {
 592         struct net_device *dev;
 593
 594         if ((dev = dev_get_by_name(devname)) == NULL)
 595                 return NULL;
 596
 597         if ((dev->flags & IFF_UP) && dev->type == ARPHRD_AX25)
 598                 return dev;
 599
 600         dev_put(dev);
 601         return NULL;
 602 }
 603
 604 /*
 605  *      Find the first active ROSE device, usually "rose0".
 606  */
 607 struct net_device *rose_dev_first(void)
 608 {
 609         struct net_device *dev, *first = NULL;
 610
 611         read_lock(&dev_base_lock);
 612         for (dev = dev_base; dev != NULL; dev = dev->next) {
 613                 if ((dev->flags & IFF_UP) && dev->type == ARPHRD_ROSE)
 614                         if (first == NULL || strncmp(dev->name, first->name, 3) < 0)
 615                                 first = dev;
 616         }
 617         read_unlock(&dev_base_lock);
 618
 619         return first;
 620 }
 621
 622 /*
 623  *      Find the ROSE device for the given address.
 624  */
 625 struct net_device *rose_dev_get(rose_address *addr)
 626 {
 627         struct net_device *dev;
 628
 629         read_lock(&dev_base_lock);
 630         for (dev = dev_base; dev != NULL; dev = dev->next) {
 631                 if ((dev->flags & IFF_UP) && dev->type == ARPHRD_ROSE && rosecmp(addr, (rose_address *)dev->dev_addr) == 0) {
 632                         dev_hold(dev);
 633                         goto out;
 634                 }
 635         }
 636 out:
 637         read_unlock(&dev_base_lock);
 638         return dev;
 639 }
 640
 641 static int rose_dev_exists(rose_address *addr)
 642 {
 643         struct net_device *dev;
 644
 645         read_lock(&dev_base_lock);
 646         for (dev = dev_base; dev != NULL; dev = dev->next) {
 647                 if ((dev->flags & IFF_UP) && dev->type == ARPHRD_ROSE && rosecmp(addr, (rose_address *)dev->dev_addr) == 0)
 648                         goto out;
 649         }
 650 out:
 651         read_unlock(&dev_base_lock);
 652         return dev != NULL;
 653 }
 654
 655
 656
 657
 658 struct rose_route *rose_route_free_lci(unsigned int lci, struct rose_neigh *neigh)
 659 {
 660         struct rose_route *rose_route;
 661
 662         for (rose_route = rose_route_list; rose_route != NULL; rose_route = rose_route->next)
 663                 if ((rose_route->neigh1 == neigh && rose_route->lci1 == lci) ||
 664                     (rose_route->neigh2 == neigh && rose_route->lci2 == lci))
 665                         return rose_route;
 666
 667         return NULL;
 668 }
 669
 670 /*
 671  *      Find a neighbour given a ROSE address.
 672  */
 673 struct rose_neigh *rose_get_neigh(rose_address *addr, unsigned char *cause,
 674         unsigned char *diagnostic)
 675 {
 676         struct rose_neigh *res = NULL;
 677         struct rose_node *node;
 678         int failed = 0;
 679         int i;
 680
 681         spin_lock_bh(&rose_node_list_lock);
 682         for (node = rose_node_list; node != NULL; node = node->next) {
 683                 if (rosecmpm(addr, &node->address, node->mask) == 0) {
 684                         for (i = 0; i < node->count; i++) {
 685                                 if (!rose_ftimer_running(node->neighbour[i])) {
 686                                         res = node->neighbour[i];
 687                                         goto out;
 688                                 } else
 689                                         failed = 1;
 690                         }
 691                         break;
 692                 }
 693         }
 694
 695         if (failed) {
 696                 *cause      = ROSE_OUT_OF_ORDER;
 697                 *diagnostic = 0;
 698         } else {
 699                 *cause      = ROSE_NOT_OBTAINABLE;
 700                 *diagnostic = 0;
 701         }
 702
 703 out:
 704         spin_unlock_bh(&rose_node_list_lock);
 705
 706         return res;
 707 }
 708
 709 /*
 710  *      Handle the ioctls that control the routing functions.
 711  */
 712 int rose_rt_ioctl(unsigned int cmd, void __user *arg)
 713 {
 714         struct rose_route_struct rose_route;
 715         struct net_device *dev;
 716         int err;
 717
 718         switch (cmd) {
 719         case SIOCADDRT:
 720                 if (copy_from_user(&rose_route, arg, sizeof(struct rose_route_struct)))
 721                         return -EFAULT;
 722                 if ((dev = rose_ax25_dev_get(rose_route.device)) == NULL)
 723                         return -EINVAL;
 724                 if (rose_dev_exists(&rose_route.address)) { /* Can't add routes to ourself */
 725                         dev_put(dev);
 726                         return -EINVAL;
 727                 }
 728                 if (rose_route.mask > 10) /* Mask can't be more than 10 digits */
 729                         return -EINVAL;
 730                 if (rose_route.ndigis > AX25_MAX_DIGIS)
 731                         return -EINVAL;
 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         char buf[11];
 855
 856 #if 0
 857         if (call_in_firewall(PF_ROSE, skb->dev, skb->data, NULL, &skb) != FW_ACCEPT)
 858                 return res;
 859 #endif
 860
 861         frametype = skb->data[2];
 862         lci = ((skb->data[0] << 8) & 0xF00) + ((skb->data[1] << 0) & 0x0FF);
 863         src_addr  = (rose_address *)(skb->data + 9);
 864         dest_addr = (rose_address *)(skb->data + 4);
 865
 866         spin_lock_bh(&rose_node_list_lock);
 867         spin_lock_bh(&rose_neigh_list_lock);
 868         spin_lock_bh(&rose_route_list_lock);
 869
 870         rose_neigh = rose_neigh_list;
 871         while (rose_neigh != NULL) {
 872                 if (ax25cmp(&ax25->dest_addr, &rose_neigh->callsign) == 0 &&
 873                     ax25->ax25_dev->dev == rose_neigh->dev)
 874                         break;
 875                 rose_neigh = rose_neigh->next;
 876         }
 877
 878         if (rose_neigh == NULL) {
 879                 printk("rose_route : unknown neighbour or device %s\n",
 880                        ax2asc(buf, &ax25->dest_addr));
 881                 goto out;
 882         }
 883
 884         /*
 885          *      Obviously the link is working, halt the ftimer.
 886          */
 887         rose_stop_ftimer(rose_neigh);
 888
 889         /*
 890          *      LCI of zero is always for us, and its always a restart
 891          *      frame.
 892          */
 893         if (lci == 0) {
 894                 rose_link_rx_restart(skb, rose_neigh, frametype);
 895                 goto out;
 896         }
 897
 898         /*
 899          *      Find an existing socket.
 900          */
 901         if ((sk = rose_find_socket(lci, rose_neigh)) != NULL) {
 902                 if (frametype == ROSE_CALL_REQUEST) {
 903                         struct rose_sock *rose = rose_sk(sk);
 904
 905                         /* Remove an existing unused socket */
 906                         rose_clear_queues(sk);
 907                         rose->cause      = ROSE_NETWORK_CONGESTION;
 908                         rose->diagnostic = 0;
 909                         rose->neighbour->use--;
 910                         rose->neighbour  = NULL;
 911                         rose->lci        = 0;
 912                         rose->state      = ROSE_STATE_0;
 913                         sk->sk_state     = TCP_CLOSE;
 914                         sk->sk_err       = 0;
 915                         sk->sk_shutdown  |= SEND_SHUTDOWN;
 916                         if (!sock_flag(sk, SOCK_DEAD)) {
 917                                 sk->sk_state_change(sk);
 918                                 sock_set_flag(sk, SOCK_DEAD);
 919                         }
 920                 }
 921                 else {
 922                         skb->h.raw = skb->data;
 923                         res = rose_process_rx_frame(sk, skb);
 924                         goto out;
 925                 }
 926         }
 927
 928         /*
 929          *      Is is a Call Request and is it for us ?
 930          */
 931         if (frametype == ROSE_CALL_REQUEST)
 932                 if ((dev = rose_dev_get(dest_addr)) != NULL) {
 933                         res = rose_rx_call_request(skb, dev, rose_neigh, lci);
 934                         dev_put(dev);
 935                         goto out;
 936                 }
 937
 938         if (!sysctl_rose_routing_control) {
 939                 rose_transmit_clear_request(rose_neigh, lci, ROSE_NOT_OBTAINABLE, 0);
 940                 goto out;
 941         }
 942
 943         /*
 944          *      Route it to the next in line if we have an entry for it.
 945          */
 946         rose_route = rose_route_list;
 947         while (rose_route != NULL) {
 948                 if (rose_route->lci1 == lci &&
 949                     rose_route->neigh1 == rose_neigh) {
 950                         if (frametype == ROSE_CALL_REQUEST) {
 951                                 /* F6FBB - Remove an existing unused route */
 952                                 rose_remove_route(rose_route);
 953                                 break;
 954                         } else if (rose_route->neigh2 != NULL) {
 955                                 skb->data[0] &= 0xF0;
 956                                 skb->data[0] |= (rose_route->lci2 >> 8) & 0x0F;
 957                                 skb->data[1]  = (rose_route->lci2 >> 0) & 0xFF;
 958                                 rose_transmit_link(skb, rose_route->neigh2);
 959                                 if (frametype == ROSE_CLEAR_CONFIRMATION)
 960                                         rose_remove_route(rose_route);
 961                                 res = 1;
 962                                 goto out;
 963                         } else {
 964                                 if (frametype == ROSE_CLEAR_CONFIRMATION)
 965                                         rose_remove_route(rose_route);
 966                                 goto out;
 967                         }
 968                 }
 969                 if (rose_route->lci2 == lci &&
 970                     rose_route->neigh2 == rose_neigh) {
 971                         if (frametype == ROSE_CALL_REQUEST) {
 972                                 /* F6FBB - Remove an existing unused route */
 973                                 rose_remove_route(rose_route);
 974                                 break;
 975                         } else if (rose_route->neigh1 != NULL) {
 976                                 skb->data[0] &= 0xF0;
 977                                 skb->data[0] |= (rose_route->lci1 >> 8) & 0x0F;
 978                                 skb->data[1]  = (rose_route->lci1 >> 0) & 0xFF;
 979                                 rose_transmit_link(skb, rose_route->neigh1);
 980                                 if (frametype == ROSE_CLEAR_CONFIRMATION)
 981                                         rose_remove_route(rose_route);
 982                                 res = 1;
 983                                 goto out;
 984                         } else {
 985                                 if (frametype == ROSE_CLEAR_CONFIRMATION)
 986                                         rose_remove_route(rose_route);
 987                                 goto out;
 988                         }
 989                 }
 990                 rose_route = rose_route->next;
 991         }
 992
 993         /*
 994          *      We know that:
 995          *      1. The frame isn't for us,
 996          *      2. It isn't "owned" by any existing route.
 997          */
 998         if (frametype != ROSE_CALL_REQUEST) {   /* XXX */
 999                 res = 0;
1000                 goto out;
1001         }
1002
1003         len  = (((skb->data[3] >> 4) & 0x0F) + 1) / 2;
1004         len += (((skb->data[3] >> 0) & 0x0F) + 1) / 2;
1005
1006         memset(&facilities, 0x00, sizeof(struct rose_facilities_struct));
1007
1008         if (!rose_parse_facilities(skb->data + len + 4, &facilities)) {
1009                 rose_transmit_clear_request(rose_neigh, lci, ROSE_INVALID_FACILITY, 76);
1010                 goto out;
1011         }
1012
1013         /*
1014          *      Check for routing loops.
1015          */
1016         rose_route = rose_route_list;
1017         while (rose_route != NULL) {
1018                 if (rose_route->rand == facilities.rand &&
1019                     rosecmp(src_addr, &rose_route->src_addr) == 0 &&
1020                     ax25cmp(&facilities.dest_call, &rose_route->src_call) == 0 &&
1021                     ax25cmp(&facilities.source_call, &rose_route->dest_call) == 0) {
1022                         rose_transmit_clear_request(rose_neigh, lci, ROSE_NOT_OBTAINABLE, 120);
1023                         goto out;
1024                 }
1025                 rose_route = rose_route->next;
1026         }
1027
1028         if ((new_neigh = rose_get_neigh(dest_addr, &cause, &diagnostic)) == NULL) {
1029                 rose_transmit_clear_request(rose_neigh, lci, cause, diagnostic);
1030                 goto out;
1031         }
1032
1033         if ((new_lci = rose_new_lci(new_neigh)) == 0) {
1034                 rose_transmit_clear_request(rose_neigh, lci, ROSE_NETWORK_CONGESTION, 71);
1035                 goto out;
1036         }
1037
1038         if ((rose_route = kmalloc(sizeof(*rose_route), GFP_ATOMIC)) == NULL) {
1039                 rose_transmit_clear_request(rose_neigh, lci, ROSE_NETWORK_CONGESTION, 120);
1040                 goto out;
1041         }
1042
1043         rose_route->lci1      = lci;
1044         rose_route->src_addr  = *src_addr;
1045         rose_route->dest_addr = *dest_addr;
1046         rose_route->src_call  = facilities.dest_call;
1047         rose_route->dest_call = facilities.source_call;
1048         rose_route->rand      = facilities.rand;
1049         rose_route->neigh1    = rose_neigh;
1050         rose_route->lci2      = new_lci;
1051         rose_route->neigh2    = new_neigh;
1052
1053         rose_route->neigh1->use++;
1054         rose_route->neigh2->use++;
1055
1056         rose_route->next = rose_route_list;
1057         rose_route_list  = rose_route;
1058
1059         skb->data[0] &= 0xF0;
1060         skb->data[0] |= (rose_route->lci2 >> 8) & 0x0F;
1061         skb->data[1]  = (rose_route->lci2 >> 0) & 0xFF;
1062
1063         rose_transmit_link(skb, rose_route->neigh2);
1064         res = 1;
1065
1066 out:
1067         spin_unlock_bh(&rose_route_list_lock);
1068         spin_unlock_bh(&rose_neigh_list_lock);
1069         spin_unlock_bh(&rose_node_list_lock);
1070
1071         return res;
1072 }
1073
1074 #ifdef CONFIG_PROC_FS
1075
1076 static void *rose_node_start(struct seq_file *seq, loff_t *pos)
1077 {
1078         struct rose_node *rose_node;
1079         int i = 1;
1080
1081         spin_lock_bh(&rose_neigh_list_lock);
1082         if (*pos == 0)
1083                 return SEQ_START_TOKEN;
1084
1085         for (rose_node = rose_node_list; rose_node && i < *pos;
1086              rose_node = rose_node->next, ++i);
1087
1088         return (i == *pos) ? rose_node : NULL;
1089 }
1090
1091 static void *rose_node_next(struct seq_file *seq, void *v, loff_t *pos)
1092 {
1093         ++*pos;
1094
1095         return (v == SEQ_START_TOKEN) ? rose_node_list
1096                 : ((struct rose_node *)v)->next;
1097 }
1098
1099 static void rose_node_stop(struct seq_file *seq, void *v)
1100 {
1101         spin_unlock_bh(&rose_neigh_list_lock);
1102 }
1103
1104 static int rose_node_show(struct seq_file *seq, void *v)
1105 {
1106         int i;
1107
1108         if (v == SEQ_START_TOKEN)
1109                 seq_puts(seq, "address    mask n neigh neigh neigh\n");
1110         else {
1111                 const struct rose_node *rose_node = v;
1112                 /* if (rose_node->loopback) {
1113                         seq_printf(seq, "%-10s %04d 1 loopback\n",
1114                                 rose2asc(&rose_node->address),
1115                                 rose_node->mask);
1116                 } else { */
1117                         seq_printf(seq, "%-10s %04d %d",
1118                                 rose2asc(&rose_node->address),
1119                                 rose_node->mask,
1120                                 rose_node->count);
1121
1122                         for (i = 0; i < rose_node->count; i++)
1123                                 seq_printf(seq, " %05d",
1124                                         rose_node->neighbour[i]->number);
1125
1126                         seq_puts(seq, "\n");
1127                 /* } */
1128         }
1129         return 0;
1130 }
1131
1132 static struct seq_operations rose_node_seqops = {
1133         .start = rose_node_start,
1134         .next = rose_node_next,
1135         .stop = rose_node_stop,
1136         .show = rose_node_show,
1137 };
1138
1139 static int rose_nodes_open(struct inode *inode, struct file *file)
1140 {
1141         return seq_open(file, &rose_node_seqops);
1142 }
1143
1144 struct file_operations rose_nodes_fops = {
1145         .owner = THIS_MODULE,
1146         .open = rose_nodes_open,
1147         .read = seq_read,
1148         .llseek = seq_lseek,
1149         .release = seq_release,
1150 };
1151
1152 static void *rose_neigh_start(struct seq_file *seq, loff_t *pos)
1153 {
1154         struct rose_neigh *rose_neigh;
1155         int i = 1;
1156
1157         spin_lock_bh(&rose_neigh_list_lock);
1158         if (*pos == 0)
1159                 return SEQ_START_TOKEN;
1160
1161         for (rose_neigh = rose_neigh_list; rose_neigh && i < *pos;
1162              rose_neigh = rose_neigh->next, ++i);
1163
1164         return (i == *pos) ? rose_neigh : NULL;
1165 }
1166
1167 static void *rose_neigh_next(struct seq_file *seq, void *v, loff_t *pos)
1168 {
1169         ++*pos;
1170
1171         return (v == SEQ_START_TOKEN) ? rose_neigh_list
1172                 : ((struct rose_neigh *)v)->next;
1173 }
1174
1175 static void rose_neigh_stop(struct seq_file *seq, void *v)
1176 {
1177         spin_unlock_bh(&rose_neigh_list_lock);
1178 }
1179
1180 static int rose_neigh_show(struct seq_file *seq, void *v)
1181 {
1182         char buf[11];
1183         int i;
1184
1185         if (v == SEQ_START_TOKEN)
1186                 seq_puts(seq,
1187                          "addr  callsign  dev  count use mode restart  t0  tf digipeaters\n");
1188         else {
1189                 struct rose_neigh *rose_neigh = v;
1190
1191                 /* if (!rose_neigh->loopback) { */
1192                 seq_printf(seq, "%05d %-9s %-4s   %3d %3d  %3s     %3s %3lu %3lu",
1193                            rose_neigh->number,
1194                            (rose_neigh->loopback) ? "RSLOOP-0" : ax2asc(buf, &rose_neigh->callsign),
1195                            rose_neigh->dev ? rose_neigh->dev->name : "???",
1196                            rose_neigh->count,
1197                            rose_neigh->use,
1198                            (rose_neigh->dce_mode) ? "DCE" : "DTE",
1199                            (rose_neigh->restarted) ? "yes" : "no",
1200                            ax25_display_timer(&rose_neigh->t0timer) / HZ,
1201                            ax25_display_timer(&rose_neigh->ftimer)  / HZ);
1202
1203                 if (rose_neigh->digipeat != NULL) {
1204                         for (i = 0; i < rose_neigh->digipeat->ndigi; i++)
1205                                 seq_printf(seq, " %s", ax2asc(buf, &rose_neigh->digipeat->calls[i]));
1206                 }
1207
1208                 seq_puts(seq, "\n");
1209         }
1210         return 0;
1211 }
1212
1213
1214 static struct seq_operations rose_neigh_seqops = {
1215         .start = rose_neigh_start,
1216         .next = rose_neigh_next,
1217         .stop = rose_neigh_stop,
1218         .show = rose_neigh_show,
1219 };
1220
1221 static int rose_neigh_open(struct inode *inode, struct file *file)
1222 {
1223         return seq_open(file, &rose_neigh_seqops);
1224 }
1225
1226 struct file_operations rose_neigh_fops = {
1227         .owner = THIS_MODULE,
1228         .open = rose_neigh_open,
1229         .read = seq_read,
1230         .llseek = seq_lseek,
1231         .release = seq_release,
1232 };
1233
1234
1235 static void *rose_route_start(struct seq_file *seq, loff_t *pos)
1236 {
1237         struct rose_route *rose_route;
1238         int i = 1;
1239
1240         spin_lock_bh(&rose_route_list_lock);
1241         if (*pos == 0)
1242                 return SEQ_START_TOKEN;
1243
1244         for (rose_route = rose_route_list; rose_route && i < *pos;
1245              rose_route = rose_route->next, ++i);
1246
1247         return (i == *pos) ? rose_route : NULL;
1248 }
1249
1250 static void *rose_route_next(struct seq_file *seq, void *v, loff_t *pos)
1251 {
1252         ++*pos;
1253
1254         return (v == SEQ_START_TOKEN) ? rose_route_list
1255                 : ((struct rose_route *)v)->next;
1256 }
1257
1258 static void rose_route_stop(struct seq_file *seq, void *v)
1259 {
1260         spin_unlock_bh(&rose_route_list_lock);
1261 }
1262
1263 static int rose_route_show(struct seq_file *seq, void *v)
1264 {
1265         char buf[11];
1266
1267         if (v == SEQ_START_TOKEN)
1268                 seq_puts(seq,
1269                          "lci  address     callsign   neigh  <-> lci  address     callsign   neigh\n");
1270         else {
1271                 struct rose_route *rose_route = v;
1272
1273                 if (rose_route->neigh1)
1274                         seq_printf(seq,
1275                                    "%3.3X  %-10s  %-9s  %05d      ",
1276                                    rose_route->lci1,
1277                                    rose2asc(&rose_route->src_addr),
1278                                    ax2asc(buf, &rose_route->src_call),
1279                                    rose_route->neigh1->number);
1280                 else
1281                         seq_puts(seq,
1282                                  "000  *           *          00000      ");
1283
1284                 if (rose_route->neigh2)
1285                         seq_printf(seq,
1286                                    "%3.3X  %-10s  %-9s  %05d\n",
1287                                 rose_route->lci2,
1288                                 rose2asc(&rose_route->dest_addr),
1289                                 ax2asc(buf, &rose_route->dest_call),
1290                                 rose_route->neigh2->number);
1291                  else
1292                          seq_puts(seq,
1293                                   "000  *           *          00000\n");
1294                 }
1295         return 0;
1296 }
1297
1298 static struct seq_operations rose_route_seqops = {
1299         .start = rose_route_start,
1300         .next = rose_route_next,
1301         .stop = rose_route_stop,
1302         .show = rose_route_show,
1303 };
1304
1305 static int rose_route_open(struct inode *inode, struct file *file)
1306 {
1307         return seq_open(file, &rose_route_seqops);
1308 }
1309
1310 struct file_operations rose_routes_fops = {
1311         .owner = THIS_MODULE,
1312         .open = rose_route_open,
1313         .read = seq_read,
1314         .llseek = seq_lseek,
1315         .release = seq_release,
1316 };
1317
1318 #endif /* CONFIG_PROC_FS */
1319
1320 /*
1321  *      Release all memory associated with ROSE routing structures.
1322  */
1323 void __exit rose_rt_free(void)
1324 {
1325         struct rose_neigh *s, *rose_neigh = rose_neigh_list;
1326         struct rose_node  *t, *rose_node  = rose_node_list;
1327         struct rose_route *u, *rose_route = rose_route_list;
1328
1329         while (rose_neigh != NULL) {
1330                 s          = rose_neigh;
1331                 rose_neigh = rose_neigh->next;
1332
1333                 rose_remove_neigh(s);
1334         }
1335
1336         while (rose_node != NULL) {
1337                 t         = rose_node;
1338                 rose_node = rose_node->next;
1339
1340                 rose_remove_node(t);
1341         }
1342
1343         while (rose_route != NULL) {
1344                 u          = rose_route;
1345                 rose_route = rose_route->next;
1346
1347                 rose_remove_route(u);
1348         }
1349 }