git.oblomov.eu Git - linux-2.6/blob - net/irda/irlmp.c

   1 /*********************************************************************
   2  *
   3  * Filename:      irlmp.c
   4  * Version:       1.0
   5  * Description:   IrDA Link Management Protocol (LMP) layer
   6  * Status:        Stable.
   7  * Author:        Dag Brattli <dagb@cs.uit.no>
   8  * Created at:    Sun Aug 17 20:54:32 1997
   9  * Modified at:   Wed Jan  5 11:26:03 2000
  10  * Modified by:   Dag Brattli <dagb@cs.uit.no>
  11  *
  12  *     Copyright (c) 1998-2000 Dag Brattli <dagb@cs.uit.no>,
  13  *     All Rights Reserved.
  14  *     Copyright (c) 2000-2003 Jean Tourrilhes <jt@hpl.hp.com>
  15  *
  16  *     This program is free software; you can redistribute it and/or
  17  *     modify it under the terms of the GNU General Public License as
  18  *     published by the Free Software Foundation; either version 2 of
  19  *     the License, or (at your option) any later version.
  20  *
  21  *     Neither Dag Brattli nor University of Tromsø admit liability nor
  22  *     provide warranty for any of this software. This material is
  23  *     provided "AS-IS" and at no charge.
  24  *
  25  ********************************************************************/
  26
  27 #include <linux/config.h>
  28 #include <linux/module.h>
  29 #include <linux/slab.h>
  30 #include <linux/string.h>
  31 #include <linux/skbuff.h>
  32 #include <linux/types.h>
  33 #include <linux/proc_fs.h>
  34 #include <linux/init.h>
  35 #include <linux/kmod.h>
  36 #include <linux/random.h>
  37 #include <linux/seq_file.h>
  38
  39 #include <net/irda/irda.h>
  40 #include <net/irda/timer.h>
  41 #include <net/irda/qos.h>
  42 #include <net/irda/irlap.h>
  43 #include <net/irda/iriap.h>
  44 #include <net/irda/irlmp.h>
  45 #include <net/irda/irlmp_frame.h>
  46
  47 static __u8 irlmp_find_free_slsap(void);
  48 static int irlmp_slsap_inuse(__u8 slsap_sel);
  49
  50 /* Master structure */
  51 struct irlmp_cb *irlmp = NULL;
  52
  53 /* These can be altered by the sysctl interface */
  54 int  sysctl_discovery         = 0;
  55 int  sysctl_discovery_timeout = 3; /* 3 seconds by default */
  56 int  sysctl_discovery_slots   = 6; /* 6 slots by default */
  57 int  sysctl_lap_keepalive_time = LM_IDLE_TIMEOUT * 1000 / HZ;
  58 char sysctl_devname[65];
  59
  60 const char *irlmp_reasons[] = {
  61         "ERROR, NOT USED",
  62         "LM_USER_REQUEST",
  63         "LM_LAP_DISCONNECT",
  64         "LM_CONNECT_FAILURE",
  65         "LM_LAP_RESET",
  66         "LM_INIT_DISCONNECT",
  67         "ERROR, NOT USED",
  68 };
  69
  70 /*
  71  * Function irlmp_init (void)
  72  *
  73  *    Create (allocate) the main IrLMP structure
  74  *
  75  */
  76 int __init irlmp_init(void)
  77 {
  78         IRDA_DEBUG(1, "%s()\n", __FUNCTION__);
  79         /* Initialize the irlmp structure. */
  80         irlmp = kmalloc( sizeof(struct irlmp_cb), GFP_KERNEL);
  81         if (irlmp == NULL)
  82                 return -ENOMEM;
  83         memset(irlmp, 0, sizeof(struct irlmp_cb));
  84
  85         irlmp->magic = LMP_MAGIC;
  86
  87         irlmp->clients = hashbin_new(HB_LOCK);
  88         irlmp->services = hashbin_new(HB_LOCK);
  89         irlmp->links = hashbin_new(HB_LOCK);
  90         irlmp->unconnected_lsaps = hashbin_new(HB_LOCK);
  91         irlmp->cachelog = hashbin_new(HB_NOLOCK);
  92
  93         if ((irlmp->clients == NULL) ||
  94             (irlmp->services == NULL) ||
  95             (irlmp->links == NULL) ||
  96             (irlmp->unconnected_lsaps == NULL) ||
  97             (irlmp->cachelog == NULL)) {
  98                 return -ENOMEM;
  99         }
 100
 101         spin_lock_init(&irlmp->cachelog->hb_spinlock);
 102
 103         irlmp->last_lsap_sel = 0x0f; /* Reserved 0x00-0x0f */
 104         strcpy(sysctl_devname, "Linux");
 105
 106         /* Do discovery every 3 seconds */
 107         init_timer(&irlmp->discovery_timer);
 108         irlmp_start_discovery_timer(irlmp, sysctl_discovery_timeout*HZ);
 109
 110         return 0;
 111 }
 112
 113 /*
 114  * Function irlmp_cleanup (void)
 115  *
 116  *    Remove IrLMP layer
 117  *
 118  */
 119 void __exit irlmp_cleanup(void)
 120 {
 121         /* Check for main structure */
 122         IRDA_ASSERT(irlmp != NULL, return;);
 123         IRDA_ASSERT(irlmp->magic == LMP_MAGIC, return;);
 124
 125         del_timer(&irlmp->discovery_timer);
 126
 127         hashbin_delete(irlmp->links, (FREE_FUNC) kfree);
 128         hashbin_delete(irlmp->unconnected_lsaps, (FREE_FUNC) kfree);
 129         hashbin_delete(irlmp->clients, (FREE_FUNC) kfree);
 130         hashbin_delete(irlmp->services, (FREE_FUNC) kfree);
 131         hashbin_delete(irlmp->cachelog, (FREE_FUNC) kfree);
 132
 133         /* De-allocate main structure */
 134         kfree(irlmp);
 135         irlmp = NULL;
 136 }
 137
 138 /*
 139  * Function irlmp_open_lsap (slsap, notify)
 140  *
 141  *   Register with IrLMP and create a local LSAP,
 142  *   returns handle to LSAP.
 143  */
 144 struct lsap_cb *irlmp_open_lsap(__u8 slsap_sel, notify_t *notify, __u8 pid)
 145 {
 146         struct lsap_cb *self;
 147
 148         IRDA_ASSERT(notify != NULL, return NULL;);
 149         IRDA_ASSERT(irlmp != NULL, return NULL;);
 150         IRDA_ASSERT(irlmp->magic == LMP_MAGIC, return NULL;);
 151         IRDA_ASSERT(notify->instance != NULL, return NULL;);
 152
 153         /*  Does the client care which Source LSAP selector it gets?  */
 154         if (slsap_sel == LSAP_ANY) {
 155                 slsap_sel = irlmp_find_free_slsap();
 156                 if (!slsap_sel)
 157                         return NULL;
 158         } else if (irlmp_slsap_inuse(slsap_sel))
 159                 return NULL;
 160
 161         /* Allocate new instance of a LSAP connection */
 162         self = kmalloc(sizeof(struct lsap_cb), GFP_ATOMIC);
 163         if (self == NULL) {
 164                 IRDA_ERROR("%s: can't allocate memory\n", __FUNCTION__);
 165                 return NULL;
 166         }
 167         memset(self, 0, sizeof(struct lsap_cb));
 168
 169         self->magic = LMP_LSAP_MAGIC;
 170         self->slsap_sel = slsap_sel;
 171
 172         /* Fix connectionless LSAP's */
 173         if (slsap_sel == LSAP_CONNLESS) {
 174 #ifdef CONFIG_IRDA_ULTRA
 175                 self->dlsap_sel = LSAP_CONNLESS;
 176                 self->pid = pid;
 177 #endif /* CONFIG_IRDA_ULTRA */
 178         } else
 179                 self->dlsap_sel = LSAP_ANY;
 180         /* self->connected = FALSE; -> already NULL via memset() */
 181
 182         init_timer(&self->watchdog_timer);
 183
 184         self->notify = *notify;
 185
 186         self->lsap_state = LSAP_DISCONNECTED;
 187
 188         /* Insert into queue of unconnected LSAPs */
 189         hashbin_insert(irlmp->unconnected_lsaps, (irda_queue_t *) self,
 190                        (long) self, NULL);
 191
 192         return self;
 193 }
 194 EXPORT_SYMBOL(irlmp_open_lsap);
 195
 196 /*
 197  * Function __irlmp_close_lsap (self)
 198  *
 199  *    Remove an instance of LSAP
 200  */
 201 static void __irlmp_close_lsap(struct lsap_cb *self)
 202 {
 203         IRDA_DEBUG(4, "%s()\n", __FUNCTION__);
 204
 205         IRDA_ASSERT(self != NULL, return;);
 206         IRDA_ASSERT(self->magic == LMP_LSAP_MAGIC, return;);
 207
 208         /*
 209          *  Set some of the variables to preset values
 210          */
 211         self->magic = 0;
 212         del_timer(&self->watchdog_timer); /* Important! */
 213
 214         if (self->conn_skb)
 215                 dev_kfree_skb(self->conn_skb);
 216
 217         kfree(self);
 218 }
 219
 220 /*
 221  * Function irlmp_close_lsap (self)
 222  *
 223  *    Close and remove LSAP
 224  *
 225  */
 226 void irlmp_close_lsap(struct lsap_cb *self)
 227 {
 228         struct lap_cb *lap;
 229         struct lsap_cb *lsap = NULL;
 230
 231         IRDA_ASSERT(self != NULL, return;);
 232         IRDA_ASSERT(self->magic == LMP_LSAP_MAGIC, return;);
 233
 234         /*
 235          *  Find out if we should remove this LSAP from a link or from the
 236          *  list of unconnected lsaps (not associated with a link)
 237          */
 238         lap = self->lap;
 239         if (lap) {
 240                 IRDA_ASSERT(lap->magic == LMP_LAP_MAGIC, return;);
 241                 /* We might close a LSAP before it has completed the
 242                  * connection setup. In those case, higher layers won't
 243                  * send a proper disconnect request. Harmless, except
 244                  * that we will forget to close LAP... - Jean II */
 245                 if(self->lsap_state != LSAP_DISCONNECTED) {
 246                         self->lsap_state = LSAP_DISCONNECTED;
 247                         irlmp_do_lap_event(self->lap,
 248                                            LM_LAP_DISCONNECT_REQUEST, NULL);
 249                 }
 250                 /* Now, remove from the link */
 251                 lsap = hashbin_remove(lap->lsaps, (long) self, NULL);
 252 #ifdef CONFIG_IRDA_CACHE_LAST_LSAP
 253                 lap->cache.valid = FALSE;
 254 #endif
 255         }
 256         self->lap = NULL;
 257         /* Check if we found the LSAP! If not then try the unconnected lsaps */
 258         if (!lsap) {
 259                 lsap = hashbin_remove(irlmp->unconnected_lsaps, (long) self,
 260                                       NULL);
 261         }
 262         if (!lsap) {
 263                 IRDA_DEBUG(0,
 264                      "%s(), Looks like somebody has removed me already!\n",
 265                            __FUNCTION__);
 266                 return;
 267         }
 268         __irlmp_close_lsap(self);
 269 }
 270 EXPORT_SYMBOL(irlmp_close_lsap);
 271
 272 /*
 273  * Function irlmp_register_irlap (saddr, notify)
 274  *
 275  *    Register IrLAP layer with IrLMP. There is possible to have multiple
 276  *    instances of the IrLAP layer, each connected to different IrDA ports
 277  *
 278  */
 279 void irlmp_register_link(struct irlap_cb *irlap, __u32 saddr, notify_t *notify)
 280 {
 281         struct lap_cb *lap;
 282
 283         IRDA_ASSERT(irlmp != NULL, return;);
 284         IRDA_ASSERT(irlmp->magic == LMP_MAGIC, return;);
 285         IRDA_ASSERT(notify != NULL, return;);
 286
 287         /*
 288          *  Allocate new instance of a LSAP connection
 289          */
 290         lap = kmalloc(sizeof(struct lap_cb), GFP_KERNEL);
 291         if (lap == NULL) {
 292                 IRDA_ERROR("%s: unable to kmalloc\n", __FUNCTION__);
 293                 return;
 294         }
 295         memset(lap, 0, sizeof(struct lap_cb));
 296
 297         lap->irlap = irlap;
 298         lap->magic = LMP_LAP_MAGIC;
 299         lap->saddr = saddr;
 300         lap->daddr = DEV_ADDR_ANY;
 301 #ifdef CONFIG_IRDA_CACHE_LAST_LSAP
 302         lap->cache.valid = FALSE;
 303 #endif
 304         lap->lsaps = hashbin_new(HB_LOCK);
 305         if (lap->lsaps == NULL) {
 306                 IRDA_WARNING("%s(), unable to kmalloc lsaps\n", __FUNCTION__);
 307                 kfree(lap);
 308                 return;
 309         }
 310
 311         lap->lap_state = LAP_STANDBY;
 312
 313         init_timer(&lap->idle_timer);
 314
 315         /*
 316          *  Insert into queue of LMP links
 317          */
 318         hashbin_insert(irlmp->links, (irda_queue_t *) lap, lap->saddr, NULL);
 319
 320         /*
 321          *  We set only this variable so IrLAP can tell us on which link the
 322          *  different events happened on
 323          */
 324         irda_notify_init(notify);
 325         notify->instance = lap;
 326 }
 327
 328 /*
 329  * Function irlmp_unregister_irlap (saddr)
 330  *
 331  *    IrLAP layer has been removed!
 332  *
 333  */
 334 void irlmp_unregister_link(__u32 saddr)
 335 {
 336         struct lap_cb *link;
 337
 338         IRDA_DEBUG(4, "%s()\n", __FUNCTION__);
 339
 340         /* We must remove ourselves from the hashbin *first*. This ensure
 341          * that no more LSAPs will be open on this link and no discovery
 342          * will be triggered anymore. Jean II */
 343         link = hashbin_remove(irlmp->links, saddr, NULL);
 344         if (link) {
 345                 IRDA_ASSERT(link->magic == LMP_LAP_MAGIC, return;);
 346
 347                 /* Kill all the LSAPs on this link. Jean II */
 348                 link->reason = LAP_DISC_INDICATION;
 349                 link->daddr = DEV_ADDR_ANY;
 350                 irlmp_do_lap_event(link, LM_LAP_DISCONNECT_INDICATION, NULL);
 351
 352                 /* Remove all discoveries discovered at this link */
 353                 irlmp_expire_discoveries(irlmp->cachelog, link->saddr, TRUE);
 354
 355                 /* Final cleanup */
 356                 del_timer(&link->idle_timer);
 357                 link->magic = 0;
 358                 kfree(link);
 359         }
 360 }
 361
 362 /*
 363  * Function irlmp_connect_request (handle, dlsap, userdata)
 364  *
 365  *    Connect with a peer LSAP
 366  *
 367  */
 368 int irlmp_connect_request(struct lsap_cb *self, __u8 dlsap_sel,
 369                           __u32 saddr, __u32 daddr,
 370                           struct qos_info *qos, struct sk_buff *userdata)
 371 {
 372         struct sk_buff *tx_skb = userdata;
 373         struct lap_cb *lap;
 374         struct lsap_cb *lsap;
 375         int ret;
 376
 377         IRDA_ASSERT(self != NULL, return -EBADR;);
 378         IRDA_ASSERT(self->magic == LMP_LSAP_MAGIC, return -EBADR;);
 379
 380         IRDA_DEBUG(2,
 381               "%s(), slsap_sel=%02x, dlsap_sel=%02x, saddr=%08x, daddr=%08x\n",
 382               __FUNCTION__, self->slsap_sel, dlsap_sel, saddr, daddr);
 383
 384         if (test_bit(0, &self->connected)) {
 385                 ret = -EISCONN;
 386                 goto err;
 387         }
 388
 389         /* Client must supply destination device address */
 390         if (!daddr) {
 391                 ret = -EINVAL;
 392                 goto err;
 393         }
 394
 395         /* Any userdata? */
 396         if (tx_skb == NULL) {
 397                 tx_skb = dev_alloc_skb(64);
 398                 if (!tx_skb)
 399                         return -ENOMEM;
 400
 401                 skb_reserve(tx_skb, LMP_MAX_HEADER);
 402         }
 403
 404         /* Make room for MUX control header (3 bytes) */
 405         IRDA_ASSERT(skb_headroom(tx_skb) >= LMP_CONTROL_HEADER, return -1;);
 406         skb_push(tx_skb, LMP_CONTROL_HEADER);
 407
 408         self->dlsap_sel = dlsap_sel;
 409
 410         /*
 411          * Find the link to where we should try to connect since there may
 412          * be more than one IrDA port on this machine. If the client has
 413          * passed us the saddr (and already knows which link to use), then
 414          * we use that to find the link, if not then we have to look in the
 415          * discovery log and check if any of the links has discovered a
 416          * device with the given daddr
 417          */
 418         if ((!saddr) || (saddr == DEV_ADDR_ANY)) {
 419                 discovery_t *discovery;
 420                 unsigned long flags;
 421
 422                 spin_lock_irqsave(&irlmp->cachelog->hb_spinlock, flags);
 423                 if (daddr != DEV_ADDR_ANY)
 424                         discovery = hashbin_find(irlmp->cachelog, daddr, NULL);
 425                 else {
 426                         IRDA_DEBUG(2, "%s(), no daddr\n", __FUNCTION__);
 427                         discovery = (discovery_t *)
 428                                 hashbin_get_first(irlmp->cachelog);
 429                 }
 430
 431                 if (discovery) {
 432                         saddr = discovery->data.saddr;
 433                         daddr = discovery->data.daddr;
 434                 }
 435                 spin_unlock_irqrestore(&irlmp->cachelog->hb_spinlock, flags);
 436         }
 437         lap = hashbin_lock_find(irlmp->links, saddr, NULL);
 438         if (lap == NULL) {
 439                 IRDA_DEBUG(1, "%s(), Unable to find a usable link!\n", __FUNCTION__);
 440                 ret = -EHOSTUNREACH;
 441                 goto err;
 442         }
 443
 444         /* Check if LAP is disconnected or already connected */
 445         if (lap->daddr == DEV_ADDR_ANY)
 446                 lap->daddr = daddr;
 447         else if (lap->daddr != daddr) {
 448                 /* Check if some LSAPs are active on this LAP */
 449                 if (HASHBIN_GET_SIZE(lap->lsaps) == 0) {
 450                         /* No active connection, but LAP hasn't been
 451                          * disconnected yet (waiting for timeout in LAP).
 452                          * Maybe we could give LAP a bit of help in this case.
 453                          */
 454                         IRDA_DEBUG(0, "%s(), sorry, but I'm waiting for LAP to timeout!\n", __FUNCTION__);
 455                         ret = -EAGAIN;
 456                         goto err;
 457                 }
 458
 459                 /* LAP is already connected to a different node, and LAP
 460                  * can only talk to one node at a time */
 461                 IRDA_DEBUG(0, "%s(), sorry, but link is busy!\n", __FUNCTION__);
 462                 ret = -EBUSY;
 463                 goto err;
 464         }
 465
 466         self->lap = lap;
 467
 468         /*
 469          *  Remove LSAP from list of unconnected LSAPs and insert it into the
 470          *  list of connected LSAPs for the particular link
 471          */
 472         lsap = hashbin_remove(irlmp->unconnected_lsaps, (long) self, NULL);
 473
 474         IRDA_ASSERT(lsap != NULL, return -1;);
 475         IRDA_ASSERT(lsap->magic == LMP_LSAP_MAGIC, return -1;);
 476         IRDA_ASSERT(lsap->lap != NULL, return -1;);
 477         IRDA_ASSERT(lsap->lap->magic == LMP_LAP_MAGIC, return -1;);
 478
 479         hashbin_insert(self->lap->lsaps, (irda_queue_t *) self, (long) self,
 480                        NULL);
 481
 482         set_bit(0, &self->connected);   /* TRUE */
 483
 484         /*
 485          *  User supplied qos specifications?
 486          */
 487         if (qos)
 488                 self->qos = *qos;
 489
 490         irlmp_do_lsap_event(self, LM_CONNECT_REQUEST, tx_skb);
 491
 492         /* Drop reference count - see irlap_data_request(). */
 493         dev_kfree_skb(tx_skb);
 494
 495         return 0;
 496
 497 err:
 498         /* Cleanup */
 499         if(tx_skb)
 500                 dev_kfree_skb(tx_skb);
 501         return ret;
 502 }
 503 EXPORT_SYMBOL(irlmp_connect_request);
 504
 505 /*
 506  * Function irlmp_connect_indication (self)
 507  *
 508  *    Incoming connection
 509  *
 510  */
 511 void irlmp_connect_indication(struct lsap_cb *self, struct sk_buff *skb)
 512 {
 513         int max_seg_size;
 514         int lap_header_size;
 515         int max_header_size;
 516
 517         IRDA_ASSERT(self != NULL, return;);
 518         IRDA_ASSERT(self->magic == LMP_LSAP_MAGIC, return;);
 519         IRDA_ASSERT(skb != NULL, return;);
 520         IRDA_ASSERT(self->lap != NULL, return;);
 521
 522         IRDA_DEBUG(2, "%s(), slsap_sel=%02x, dlsap_sel=%02x\n",
 523                    __FUNCTION__, self->slsap_sel, self->dlsap_sel);
 524
 525         /* Note : self->lap is set in irlmp_link_data_indication(),
 526          * (case CONNECT_CMD:) because we have no way to set it here.
 527          * Similarly, self->dlsap_sel is usually set in irlmp_find_lsap().
 528          * Jean II */
 529
 530         self->qos = *self->lap->qos;
 531
 532         max_seg_size = self->lap->qos->data_size.value-LMP_HEADER;
 533         lap_header_size = IRLAP_GET_HEADER_SIZE(self->lap->irlap);
 534         max_header_size = LMP_HEADER + lap_header_size;
 535
 536         /* Hide LMP_CONTROL_HEADER header from layer above */
 537         skb_pull(skb, LMP_CONTROL_HEADER);
 538
 539         if (self->notify.connect_indication) {
 540                 /* Don't forget to refcount it - see irlap_driver_rcv(). */
 541                 skb_get(skb);
 542                 self->notify.connect_indication(self->notify.instance, self,
 543                                                 &self->qos, max_seg_size,
 544                                                 max_header_size, skb);
 545         }
 546 }
 547
 548 /*
 549  * Function irlmp_connect_response (handle, userdata)
 550  *
 551  *    Service user is accepting connection
 552  *
 553  */
 554 int irlmp_connect_response(struct lsap_cb *self, struct sk_buff *userdata)
 555 {
 556         IRDA_ASSERT(self != NULL, return -1;);
 557         IRDA_ASSERT(self->magic == LMP_LSAP_MAGIC, return -1;);
 558         IRDA_ASSERT(userdata != NULL, return -1;);
 559
 560         /* We set the connected bit and move the lsap to the connected list
 561          * in the state machine itself. Jean II */
 562
 563         IRDA_DEBUG(2, "%s(), slsap_sel=%02x, dlsap_sel=%02x\n",
 564                    __FUNCTION__, self->slsap_sel, self->dlsap_sel);
 565
 566         /* Make room for MUX control header (3 bytes) */
 567         IRDA_ASSERT(skb_headroom(userdata) >= LMP_CONTROL_HEADER, return -1;);
 568         skb_push(userdata, LMP_CONTROL_HEADER);
 569
 570         irlmp_do_lsap_event(self, LM_CONNECT_RESPONSE, userdata);
 571
 572         /* Drop reference count - see irlap_data_request(). */
 573         dev_kfree_skb(userdata);
 574
 575         return 0;
 576 }
 577 EXPORT_SYMBOL(irlmp_connect_response);
 578
 579 /*
 580  * Function irlmp_connect_confirm (handle, skb)
 581  *
 582  *    LSAP connection confirmed peer device!
 583  */
 584 void irlmp_connect_confirm(struct lsap_cb *self, struct sk_buff *skb)
 585 {
 586         int max_header_size;
 587         int lap_header_size;
 588         int max_seg_size;
 589
 590         IRDA_DEBUG(3, "%s()\n", __FUNCTION__);
 591
 592         IRDA_ASSERT(skb != NULL, return;);
 593         IRDA_ASSERT(self != NULL, return;);
 594         IRDA_ASSERT(self->magic == LMP_LSAP_MAGIC, return;);
 595         IRDA_ASSERT(self->lap != NULL, return;);
 596
 597         self->qos = *self->lap->qos;
 598
 599         max_seg_size    = self->lap->qos->data_size.value-LMP_HEADER;
 600         lap_header_size = IRLAP_GET_HEADER_SIZE(self->lap->irlap);
 601         max_header_size = LMP_HEADER + lap_header_size;
 602
 603         IRDA_DEBUG(2, "%s(), max_header_size=%d\n",
 604                    __FUNCTION__, max_header_size);
 605
 606         /* Hide LMP_CONTROL_HEADER header from layer above */
 607         skb_pull(skb, LMP_CONTROL_HEADER);
 608
 609         if (self->notify.connect_confirm) {
 610                 /* Don't forget to refcount it - see irlap_driver_rcv() */
 611                 skb_get(skb);
 612                 self->notify.connect_confirm(self->notify.instance, self,
 613                                              &self->qos, max_seg_size,
 614                                              max_header_size, skb);
 615         }
 616 }
 617
 618 /*
 619  * Function irlmp_dup (orig, instance)
 620  *
 621  *    Duplicate LSAP, can be used by servers to confirm a connection on a
 622  *    new LSAP so it can keep listening on the old one.
 623  *
 624  */
 625 struct lsap_cb *irlmp_dup(struct lsap_cb *orig, void *instance)
 626 {
 627         struct lsap_cb *new;
 628         unsigned long flags;
 629
 630         IRDA_DEBUG(1, "%s()\n", __FUNCTION__);
 631
 632         spin_lock_irqsave(&irlmp->unconnected_lsaps->hb_spinlock, flags);
 633
 634         /* Only allowed to duplicate unconnected LSAP's, and only LSAPs
 635          * that have received a connect indication. Jean II */
 636         if ((!hashbin_find(irlmp->unconnected_lsaps, (long) orig, NULL)) ||
 637             (orig->lap == NULL)) {
 638                 IRDA_DEBUG(0, "%s(), invalid LSAP (wrong state)\n",
 639                            __FUNCTION__);
 640                 spin_unlock_irqrestore(&irlmp->unconnected_lsaps->hb_spinlock,
 641                                        flags);
 642                 return NULL;
 643         }
 644
 645         /* Allocate a new instance */
 646         new = kmalloc(sizeof(struct lsap_cb), GFP_ATOMIC);
 647         if (!new)  {
 648                 IRDA_DEBUG(0, "%s(), unable to kmalloc\n", __FUNCTION__);
 649                 spin_unlock_irqrestore(&irlmp->unconnected_lsaps->hb_spinlock,
 650                                        flags);
 651                 return NULL;
 652         }
 653         /* Dup */
 654         memcpy(new, orig, sizeof(struct lsap_cb));
 655         /* new->lap = orig->lap; => done in the memcpy() */
 656         /* new->slsap_sel = orig->slsap_sel; => done in the memcpy() */
 657         new->conn_skb = NULL;
 658
 659         spin_unlock_irqrestore(&irlmp->unconnected_lsaps->hb_spinlock, flags);
 660
 661         /* Not everything is the same */
 662         new->notify.instance = instance;
 663
 664         init_timer(&new->watchdog_timer);
 665
 666         hashbin_insert(irlmp->unconnected_lsaps, (irda_queue_t *) new,
 667                        (long) new, NULL);
 668
 669 #ifdef CONFIG_IRDA_CACHE_LAST_LSAP
 670         /* Make sure that we invalidate the LSAP cache */
 671         new->lap->cache.valid = FALSE;
 672 #endif /* CONFIG_IRDA_CACHE_LAST_LSAP */
 673
 674         return new;
 675 }
 676
 677 /*
 678  * Function irlmp_disconnect_request (handle, userdata)
 679  *
 680  *    The service user is requesting disconnection, this will not remove the
 681  *    LSAP, but only mark it as disconnected
 682  */
 683 int irlmp_disconnect_request(struct lsap_cb *self, struct sk_buff *userdata)
 684 {
 685         struct lsap_cb *lsap;
 686
 687         IRDA_ASSERT(self != NULL, return -1;);
 688         IRDA_ASSERT(self->magic == LMP_LSAP_MAGIC, return -1;);
 689         IRDA_ASSERT(userdata != NULL, return -1;);
 690
 691         /* Already disconnected ?
 692          * There is a race condition between irlmp_disconnect_indication()
 693          * and us that might mess up the hashbins below. This fixes it.
 694          * Jean II */
 695         if (! test_and_clear_bit(0, &self->connected)) {
 696                 IRDA_DEBUG(0, "%s(), already disconnected!\n", __FUNCTION__);
 697                 dev_kfree_skb(userdata);
 698                 return -1;
 699         }
 700
 701         skb_push(userdata, LMP_CONTROL_HEADER);
 702
 703         /*
 704          *  Do the event before the other stuff since we must know
 705          *  which lap layer that the frame should be transmitted on
 706          */
 707         irlmp_do_lsap_event(self, LM_DISCONNECT_REQUEST, userdata);
 708
 709         /* Drop reference count - see irlap_data_request(). */
 710         dev_kfree_skb(userdata);
 711
 712         /*
 713          *  Remove LSAP from list of connected LSAPs for the particular link
 714          *  and insert it into the list of unconnected LSAPs
 715          */
 716         IRDA_ASSERT(self->lap != NULL, return -1;);
 717         IRDA_ASSERT(self->lap->magic == LMP_LAP_MAGIC, return -1;);
 718         IRDA_ASSERT(self->lap->lsaps != NULL, return -1;);
 719
 720         lsap = hashbin_remove(self->lap->lsaps, (long) self, NULL);
 721 #ifdef CONFIG_IRDA_CACHE_LAST_LSAP
 722         self->lap->cache.valid = FALSE;
 723 #endif
 724
 725         IRDA_ASSERT(lsap != NULL, return -1;);
 726         IRDA_ASSERT(lsap->magic == LMP_LSAP_MAGIC, return -1;);
 727         IRDA_ASSERT(lsap == self, return -1;);
 728
 729         hashbin_insert(irlmp->unconnected_lsaps, (irda_queue_t *) self,
 730                        (long) self, NULL);
 731
 732         /* Reset some values */
 733         self->dlsap_sel = LSAP_ANY;
 734         self->lap = NULL;
 735
 736         return 0;
 737 }
 738 EXPORT_SYMBOL(irlmp_disconnect_request);
 739
 740 /*
 741  * Function irlmp_disconnect_indication (reason, userdata)
 742  *
 743  *    LSAP is being closed!
 744  */
 745 void irlmp_disconnect_indication(struct lsap_cb *self, LM_REASON reason,
 746                                  struct sk_buff *skb)
 747 {
 748         struct lsap_cb *lsap;
 749
 750         IRDA_DEBUG(1, "%s(), reason=%s\n", __FUNCTION__, irlmp_reasons[reason]);
 751         IRDA_ASSERT(self != NULL, return;);
 752         IRDA_ASSERT(self->magic == LMP_LSAP_MAGIC, return;);
 753
 754         IRDA_DEBUG(3, "%s(), slsap_sel=%02x, dlsap_sel=%02x\n",
 755                    __FUNCTION__, self->slsap_sel, self->dlsap_sel);
 756
 757         /* Already disconnected ?
 758          * There is a race condition between irlmp_disconnect_request()
 759          * and us that might mess up the hashbins below. This fixes it.
 760          * Jean II */
 761         if (! test_and_clear_bit(0, &self->connected)) {
 762                 IRDA_DEBUG(0, "%s(), already disconnected!\n", __FUNCTION__);
 763                 return;
 764         }
 765
 766         /*
 767          *  Remove association between this LSAP and the link it used
 768          */
 769         IRDA_ASSERT(self->lap != NULL, return;);
 770         IRDA_ASSERT(self->lap->lsaps != NULL, return;);
 771
 772         lsap = hashbin_remove(self->lap->lsaps, (long) self, NULL);
 773 #ifdef CONFIG_IRDA_CACHE_LAST_LSAP
 774         self->lap->cache.valid = FALSE;
 775 #endif
 776
 777         IRDA_ASSERT(lsap != NULL, return;);
 778         IRDA_ASSERT(lsap == self, return;);
 779         hashbin_insert(irlmp->unconnected_lsaps, (irda_queue_t *) lsap,
 780                        (long) lsap, NULL);
 781
 782         self->dlsap_sel = LSAP_ANY;
 783         self->lap = NULL;
 784
 785         /*
 786          *  Inform service user
 787          */
 788         if (self->notify.disconnect_indication) {
 789                 /* Don't forget to refcount it - see irlap_driver_rcv(). */
 790                 if(skb)
 791                         skb_get(skb);
 792                 self->notify.disconnect_indication(self->notify.instance,
 793                                                    self, reason, skb);
 794         } else {
 795                 IRDA_DEBUG(0, "%s(), no handler\n", __FUNCTION__);
 796         }
 797 }
 798
 799 /*
 800  * Function irlmp_do_expiry (void)
 801  *
 802  *    Do a cleanup of the discovery log (remove old entries)
 803  *
 804  * Note : separate from irlmp_do_discovery() so that we can handle
 805  * passive discovery properly.
 806  */
 807 void irlmp_do_expiry(void)
 808 {
 809         struct lap_cb *lap;
 810
 811         /*
 812          * Expire discovery on all links which are *not* connected.
 813          * On links which are connected, we can't do discovery
 814          * anymore and can't refresh the log, so we freeze the
 815          * discovery log to keep info about the device we are
 816          * connected to.
 817          * This info is mandatory if we want irlmp_connect_request()
 818          * to work properly. - Jean II
 819          */
 820         lap = (struct lap_cb *) hashbin_get_first(irlmp->links);
 821         while (lap != NULL) {
 822                 IRDA_ASSERT(lap->magic == LMP_LAP_MAGIC, return;);
 823
 824                 if (lap->lap_state == LAP_STANDBY) {
 825                         /* Expire discoveries discovered on this link */
 826                         irlmp_expire_discoveries(irlmp->cachelog, lap->saddr,
 827                                                  FALSE);
 828                 }
 829                 lap = (struct lap_cb *) hashbin_get_next(irlmp->links);
 830         }
 831 }
 832
 833 /*
 834  * Function irlmp_do_discovery (nslots)
 835  *
 836  *    Do some discovery on all links
 837  *
 838  * Note : log expiry is done above.
 839  */
 840 void irlmp_do_discovery(int nslots)
 841 {
 842         struct lap_cb *lap;
 843
 844         /* Make sure the value is sane */
 845         if ((nslots != 1) && (nslots != 6) && (nslots != 8) && (nslots != 16)){
 846                 IRDA_WARNING("%s: invalid value for number of slots!\n",
 847                              __FUNCTION__);
 848                 nslots = sysctl_discovery_slots = 8;
 849         }
 850
 851         /* Construct new discovery info to be used by IrLAP, */
 852         u16ho(irlmp->discovery_cmd.data.hints) = irlmp->hints.word;
 853
 854         /*
 855          *  Set character set for device name (we use ASCII), and
 856          *  copy device name. Remember to make room for a \0 at the
 857          *  end
 858          */
 859         irlmp->discovery_cmd.data.charset = CS_ASCII;
 860         strncpy(irlmp->discovery_cmd.data.info, sysctl_devname,
 861                 NICKNAME_MAX_LEN);
 862         irlmp->discovery_cmd.name_len = strlen(irlmp->discovery_cmd.data.info);
 863         irlmp->discovery_cmd.nslots = nslots;
 864
 865         /*
 866          * Try to send discovery packets on all links
 867          */
 868         lap = (struct lap_cb *) hashbin_get_first(irlmp->links);
 869         while (lap != NULL) {
 870                 IRDA_ASSERT(lap->magic == LMP_LAP_MAGIC, return;);
 871
 872                 if (lap->lap_state == LAP_STANDBY) {
 873                         /* Try to discover */
 874                         irlmp_do_lap_event(lap, LM_LAP_DISCOVERY_REQUEST,
 875                                            NULL);
 876                 }
 877                 lap = (struct lap_cb *) hashbin_get_next(irlmp->links);
 878         }
 879 }
 880
 881 /*
 882  * Function irlmp_discovery_request (nslots)
 883  *
 884  *    Do a discovery of devices in front of the computer
 885  *
 886  * If the caller has registered a client discovery callback, this
 887  * allow him to receive the full content of the discovery log through
 888  * this callback (as normally he will receive only new discoveries).
 889  */
 890 void irlmp_discovery_request(int nslots)
 891 {
 892         /* Return current cached discovery log (in full) */
 893         irlmp_discovery_confirm(irlmp->cachelog, DISCOVERY_LOG);
 894
 895         /*
 896          * Start a single discovery operation if discovery is not already
 897          * running
 898          */
 899         if (!sysctl_discovery) {
 900                 /* Check if user wants to override the default */
 901                 if (nslots == DISCOVERY_DEFAULT_SLOTS)
 902                         nslots = sysctl_discovery_slots;
 903
 904                 irlmp_do_discovery(nslots);
 905                 /* Note : we never do expiry here. Expiry will run on the
 906                  * discovery timer regardless of the state of sysctl_discovery
 907                  * Jean II */
 908         }
 909 }
 910 EXPORT_SYMBOL(irlmp_discovery_request);
 911
 912 /*
 913  * Function irlmp_get_discoveries (pn, mask, slots)
 914  *
 915  *    Return the current discovery log
 916  *
 917  * If discovery is not enabled, you should call this function again
 918  * after 1 or 2 seconds (i.e. after discovery has been done).
 919  */
 920 struct irda_device_info *irlmp_get_discoveries(int *pn, __u16 mask, int nslots)
 921 {
 922         /* If discovery is not enabled, it's likely that the discovery log
 923          * will be empty. So, we trigger a single discovery, so that next
 924          * time the user call us there might be some results in the log.
 925          * Jean II
 926          */
 927         if (!sysctl_discovery) {
 928                 /* Check if user wants to override the default */
 929                 if (nslots == DISCOVERY_DEFAULT_SLOTS)
 930                         nslots = sysctl_discovery_slots;
 931
 932                 /* Start discovery - will complete sometime later */
 933                 irlmp_do_discovery(nslots);
 934                 /* Note : we never do expiry here. Expiry will run on the
 935                  * discovery timer regardless of the state of sysctl_discovery
 936                  * Jean II */
 937         }
 938
 939         /* Return current cached discovery log */
 940         return(irlmp_copy_discoveries(irlmp->cachelog, pn, mask, TRUE));
 941 }
 942 EXPORT_SYMBOL(irlmp_get_discoveries);
 943
 944 /*
 945  * Function irlmp_notify_client (log)
 946  *
 947  *    Notify all about discovered devices
 948  *
 949  * Clients registered with IrLMP are :
 950  *      o IrComm
 951  *      o IrLAN
 952  *      o Any socket (in any state - ouch, that may be a lot !)
 953  * The client may have defined a callback to be notified in case of
 954  * partial/selective discovery based on the hints that it passed to IrLMP.
 955  */
 956 static inline void
 957 irlmp_notify_client(irlmp_client_t *client,
 958                     hashbin_t *log, DISCOVERY_MODE mode)
 959 {
 960         discinfo_t *discoveries;        /* Copy of the discovery log */
 961         int     number;                 /* Number of nodes in the log */
 962         int     i;
 963
 964         IRDA_DEBUG(3, "%s()\n", __FUNCTION__);
 965
 966         /* Check if client wants or not partial/selective log (optimisation) */
 967         if (!client->disco_callback)
 968                 return;
 969
 970         /*
 971          * Locking notes :
 972          * the old code was manipulating the log directly, which was
 973          * very racy. Now, we use copy_discoveries, that protects
 974          * itself while dumping the log for us.
 975          * The overhead of the copy is compensated by the fact that
 976          * we only pass new discoveries in normal mode and don't
 977          * pass the same old entry every 3s to the caller as we used
 978          * to do (virtual function calling is expensive).
 979          * Jean II
 980          */
 981
 982         /*
 983          * Now, check all discovered devices (if any), and notify client
 984          * only about the services that the client is interested in
 985          * We also notify only about the new devices unless the caller
 986          * explicitly request a dump of the log. Jean II
 987          */
 988         discoveries = irlmp_copy_discoveries(log, &number,
 989                                              client->hint_mask.word,
 990                                              (mode == DISCOVERY_LOG));
 991         /* Check if the we got some results */
 992         if (discoveries == NULL)
 993                 return; /* No nodes discovered */
 994
 995         /* Pass all entries to the listener */
 996         for(i = 0; i < number; i++)
 997                 client->disco_callback(&(discoveries[i]), mode, client->priv);
 998
 999         /* Free up our buffer */
1000         kfree(discoveries);
1001 }
1002
1003 /*
1004  * Function irlmp_discovery_confirm ( self, log)
1005  *
1006  *    Some device(s) answered to our discovery request! Check to see which
1007  *    device it is, and give indication to the client(s)
1008  *
1009  */
1010 void irlmp_discovery_confirm(hashbin_t *log, DISCOVERY_MODE mode)
1011 {
1012         irlmp_client_t *client;
1013         irlmp_client_t *client_next;
1014
1015         IRDA_DEBUG(3, "%s()\n", __FUNCTION__);
1016
1017         IRDA_ASSERT(log != NULL, return;);
1018
1019         if (!(HASHBIN_GET_SIZE(log)))
1020                 return;
1021
1022         /* For each client - notify callback may touch client list */
1023         client = (irlmp_client_t *) hashbin_get_first(irlmp->clients);
1024         while (NULL != hashbin_find_next(irlmp->clients, (long) client, NULL,
1025                                          (void *) &client_next) ) {
1026                 /* Check if we should notify client */
1027                 irlmp_notify_client(client, log, mode);
1028
1029                 client = client_next;
1030         }
1031 }
1032
1033 /*
1034  * Function irlmp_discovery_expiry (expiry)
1035  *
1036  *      This device is no longer been discovered, and therefore it is being
1037  *      purged from the discovery log. Inform all clients who have
1038  *      registered for this event...
1039  *
1040  *      Note : called exclusively from discovery.c
1041  *      Note : this is no longer called under discovery spinlock, so the
1042  *              client can do whatever he wants in the callback.
1043  */
1044 void irlmp_discovery_expiry(discinfo_t *expiries, int number)
1045 {
1046         irlmp_client_t *client;
1047         irlmp_client_t *client_next;
1048         int             i;
1049
1050         IRDA_DEBUG(3, "%s()\n", __FUNCTION__);
1051
1052         IRDA_ASSERT(expiries != NULL, return;);
1053
1054         /* For each client - notify callback may touch client list */
1055         client = (irlmp_client_t *) hashbin_get_first(irlmp->clients);
1056         while (NULL != hashbin_find_next(irlmp->clients, (long) client, NULL,
1057                                          (void *) &client_next) ) {
1058
1059                 /* Pass all entries to the listener */
1060                 for(i = 0; i < number; i++) {
1061                         /* Check if we should notify client */
1062                         if ((client->expir_callback) &&
1063                             (client->hint_mask.word & u16ho(expiries[i].hints)
1064                              & 0x7f7f) )
1065                                 client->expir_callback(&(expiries[i]),
1066                                                        EXPIRY_TIMEOUT,
1067                                                        client->priv);
1068                 }
1069
1070                 /* Next client */
1071                 client = client_next;
1072         }
1073 }
1074
1075 /*
1076  * Function irlmp_get_discovery_response ()
1077  *
1078  *    Used by IrLAP to get the discovery info it needs when answering
1079  *    discovery requests by other devices.
1080  */
1081 discovery_t *irlmp_get_discovery_response(void)
1082 {
1083         IRDA_DEBUG(4, "%s()\n", __FUNCTION__);
1084
1085         IRDA_ASSERT(irlmp != NULL, return NULL;);
1086
1087         u16ho(irlmp->discovery_rsp.data.hints) = irlmp->hints.word;
1088
1089         /*
1090          *  Set character set for device name (we use ASCII), and
1091          *  copy device name. Remember to make room for a \0 at the
1092          *  end
1093          */
1094         irlmp->discovery_rsp.data.charset = CS_ASCII;
1095
1096         strncpy(irlmp->discovery_rsp.data.info, sysctl_devname,
1097                 NICKNAME_MAX_LEN);
1098         irlmp->discovery_rsp.name_len = strlen(irlmp->discovery_rsp.data.info);
1099
1100         return &irlmp->discovery_rsp;
1101 }
1102
1103 /*
1104  * Function irlmp_data_request (self, skb)
1105  *
1106  *    Send some data to peer device
1107  *
1108  * Note on skb management :
1109  * After calling the lower layers of the IrDA stack, we always
1110  * kfree() the skb, which drop the reference count (and potentially
1111  * destroy it).
1112  * IrLMP and IrLAP may queue the packet, and in those cases will need
1113  * to use skb_get() to keep it around.
1114  * Jean II
1115  */
1116 int irlmp_data_request(struct lsap_cb *self, struct sk_buff *userdata)
1117 {
1118         int     ret;
1119
1120         IRDA_ASSERT(self != NULL, return -1;);
1121         IRDA_ASSERT(self->magic == LMP_LSAP_MAGIC, return -1;);
1122
1123         /* Make room for MUX header */
1124         IRDA_ASSERT(skb_headroom(userdata) >= LMP_HEADER, return -1;);
1125         skb_push(userdata, LMP_HEADER);
1126
1127         ret = irlmp_do_lsap_event(self, LM_DATA_REQUEST, userdata);
1128
1129         /* Drop reference count - see irlap_data_request(). */
1130         dev_kfree_skb(userdata);
1131
1132         return ret;
1133 }
1134 EXPORT_SYMBOL(irlmp_data_request);
1135
1136 /*
1137  * Function irlmp_data_indication (handle, skb)
1138  *
1139  *    Got data from LAP layer so pass it up to upper layer
1140  *
1141  */
1142 void irlmp_data_indication(struct lsap_cb *self, struct sk_buff *skb)
1143 {
1144         /* Hide LMP header from layer above */
1145         skb_pull(skb, LMP_HEADER);
1146
1147         if (self->notify.data_indication) {
1148                 /* Don't forget to refcount it - see irlap_driver_rcv(). */
1149                 skb_get(skb);
1150                 self->notify.data_indication(self->notify.instance, self, skb);
1151         }
1152 }
1153
1154 /*
1155  * Function irlmp_udata_request (self, skb)
1156  */
1157 int irlmp_udata_request(struct lsap_cb *self, struct sk_buff *userdata)
1158 {
1159         int     ret;
1160
1161         IRDA_DEBUG(4, "%s()\n", __FUNCTION__);
1162
1163         IRDA_ASSERT(userdata != NULL, return -1;);
1164
1165         /* Make room for MUX header */
1166         IRDA_ASSERT(skb_headroom(userdata) >= LMP_HEADER, return -1;);
1167         skb_push(userdata, LMP_HEADER);
1168
1169         ret = irlmp_do_lsap_event(self, LM_UDATA_REQUEST, userdata);
1170
1171         /* Drop reference count - see irlap_data_request(). */
1172         dev_kfree_skb(userdata);
1173
1174         return ret;
1175 }
1176
1177 /*
1178  * Function irlmp_udata_indication (self, skb)
1179  *
1180  *    Send unreliable data (but still within the connection)
1181  *
1182  */
1183 void irlmp_udata_indication(struct lsap_cb *self, struct sk_buff *skb)
1184 {
1185         IRDA_DEBUG(4, "%s()\n", __FUNCTION__);
1186
1187         IRDA_ASSERT(self != NULL, return;);
1188         IRDA_ASSERT(self->magic == LMP_LSAP_MAGIC, return;);
1189         IRDA_ASSERT(skb != NULL, return;);
1190
1191         /* Hide LMP header from layer above */
1192         skb_pull(skb, LMP_HEADER);
1193
1194         if (self->notify.udata_indication) {
1195                 /* Don't forget to refcount it - see irlap_driver_rcv(). */
1196                 skb_get(skb);
1197                 self->notify.udata_indication(self->notify.instance, self,
1198                                               skb);
1199         }
1200 }
1201
1202 /*
1203  * Function irlmp_connless_data_request (self, skb)
1204  */
1205 #ifdef CONFIG_IRDA_ULTRA
1206 int irlmp_connless_data_request(struct lsap_cb *self, struct sk_buff *userdata,
1207                                 __u8 pid)
1208 {
1209         struct sk_buff *clone_skb;
1210         struct lap_cb *lap;
1211
1212         IRDA_DEBUG(4, "%s()\n", __FUNCTION__);
1213
1214         IRDA_ASSERT(userdata != NULL, return -1;);
1215
1216         /* Make room for MUX and PID header */
1217         IRDA_ASSERT(skb_headroom(userdata) >= LMP_HEADER+LMP_PID_HEADER,
1218                     return -1;);
1219
1220         /* Insert protocol identifier */
1221         skb_push(userdata, LMP_PID_HEADER);
1222         if(self != NULL)
1223           userdata->data[0] = self->pid;
1224         else
1225           userdata->data[0] = pid;
1226
1227         /* Connectionless sockets must use 0x70 */
1228         skb_push(userdata, LMP_HEADER);
1229         userdata->data[0] = userdata->data[1] = LSAP_CONNLESS;
1230
1231         /* Try to send Connectionless  packets out on all links */
1232         lap = (struct lap_cb *) hashbin_get_first(irlmp->links);
1233         while (lap != NULL) {
1234                 IRDA_ASSERT(lap->magic == LMP_LAP_MAGIC, return -1;);
1235
1236                 clone_skb = skb_clone(userdata, GFP_ATOMIC);
1237                 if (!clone_skb) {
1238                         dev_kfree_skb(userdata);
1239                         return -ENOMEM;
1240                 }
1241
1242                 irlap_unitdata_request(lap->irlap, clone_skb);
1243                 /* irlap_unitdata_request() don't increase refcount,
1244                  * so no dev_kfree_skb() - Jean II */
1245
1246                 lap = (struct lap_cb *) hashbin_get_next(irlmp->links);
1247         }
1248         dev_kfree_skb(userdata);
1249
1250         return 0;
1251 }
1252 #endif /* CONFIG_IRDA_ULTRA */
1253
1254 /*
1255  * Function irlmp_connless_data_indication (self, skb)
1256  *
1257  *    Receive unreliable data outside any connection. Mostly used by Ultra
1258  *
1259  */
1260 #ifdef CONFIG_IRDA_ULTRA
1261 void irlmp_connless_data_indication(struct lsap_cb *self, struct sk_buff *skb)
1262 {
1263         IRDA_DEBUG(4, "%s()\n", __FUNCTION__);
1264
1265         IRDA_ASSERT(self != NULL, return;);
1266         IRDA_ASSERT(self->magic == LMP_LSAP_MAGIC, return;);
1267         IRDA_ASSERT(skb != NULL, return;);
1268
1269         /* Hide LMP and PID header from layer above */
1270         skb_pull(skb, LMP_HEADER+LMP_PID_HEADER);
1271
1272         if (self->notify.udata_indication) {
1273                 /* Don't forget to refcount it - see irlap_driver_rcv(). */
1274                 skb_get(skb);
1275                 self->notify.udata_indication(self->notify.instance, self,
1276                                               skb);
1277         }
1278 }
1279 #endif /* CONFIG_IRDA_ULTRA */
1280
1281 /*
1282  * Propagate status indication from LAP to LSAPs (via LMP)
1283  * This don't trigger any change of state in lap_cb, lmp_cb or lsap_cb,
1284  * and the event is stateless, therefore we can bypass both state machines
1285  * and send the event direct to the LSAP user.
1286  * Jean II
1287  */
1288 void irlmp_status_indication(struct lap_cb *self,
1289                              LINK_STATUS link, LOCK_STATUS lock)
1290 {
1291         struct lsap_cb *next;
1292         struct lsap_cb *curr;
1293
1294         /* Send status_indication to all LSAPs using this link */
1295         curr = (struct lsap_cb *) hashbin_get_first( self->lsaps);
1296         while (NULL != hashbin_find_next(self->lsaps, (long) curr, NULL,
1297                                          (void *) &next) ) {
1298                 IRDA_ASSERT(curr->magic == LMP_LSAP_MAGIC, return;);
1299                 /*
1300                  *  Inform service user if he has requested it
1301                  */
1302                 if (curr->notify.status_indication != NULL)
1303                         curr->notify.status_indication(curr->notify.instance,
1304                                                        link, lock);
1305                 else
1306                         IRDA_DEBUG(2, "%s(), no handler\n", __FUNCTION__);
1307
1308                 curr = next;
1309         }
1310 }
1311
1312 /*
1313  * Receive flow control indication from LAP.
1314  * LAP want us to send it one more frame. We implement a simple round
1315  * robin scheduler between the active sockets so that we get a bit of
1316  * fairness. Note that the round robin is far from perfect, but it's
1317  * better than nothing.
1318  * We then poll the selected socket so that we can do synchronous
1319  * refilling of IrLAP (which allow to minimise the number of buffers).
1320  * Jean II
1321  */
1322 void irlmp_flow_indication(struct lap_cb *self, LOCAL_FLOW flow)
1323 {
1324         struct lsap_cb *next;
1325         struct lsap_cb *curr;
1326         int     lsap_todo;
1327
1328         IRDA_ASSERT(self->magic == LMP_LAP_MAGIC, return;);
1329         IRDA_ASSERT(flow == FLOW_START, return;);
1330
1331         /* Get the number of lsap. That's the only safe way to know
1332          * that we have looped around... - Jean II */
1333         lsap_todo = HASHBIN_GET_SIZE(self->lsaps);
1334         IRDA_DEBUG(4, "%s() : %d lsaps to scan\n", __FUNCTION__, lsap_todo);
1335
1336         /* Poll lsap in order until the queue is full or until we
1337          * tried them all.
1338          * Most often, the current LSAP will have something to send,
1339          * so we will go through this loop only once. - Jean II */
1340         while((lsap_todo--) &&
1341               (IRLAP_GET_TX_QUEUE_LEN(self->irlap) < LAP_HIGH_THRESHOLD)) {
1342                 /* Try to find the next lsap we should poll. */
1343                 next = self->flow_next;
1344                 /* If we have no lsap, restart from first one */
1345                 if(next == NULL)
1346                         next = (struct lsap_cb *) hashbin_get_first(self->lsaps);
1347                 /* Verify current one and find the next one */
1348                 curr = hashbin_find_next(self->lsaps, (long) next, NULL,
1349                                          (void *) &self->flow_next);
1350                 /* Uh-oh... Paranoia */
1351                 if(curr == NULL)
1352                         break;
1353                 IRDA_DEBUG(4, "%s() : curr is %p, next was %p and is now %p, still %d to go - queue len = %d\n", __FUNCTION__, curr, next, self->flow_next, lsap_todo, IRLAP_GET_TX_QUEUE_LEN(self->irlap));
1354
1355                 /* Inform lsap user that it can send one more packet. */
1356                 if (curr->notify.flow_indication != NULL)
1357                         curr->notify.flow_indication(curr->notify.instance,
1358                                                      curr, flow);
1359                 else
1360                         IRDA_DEBUG(1, "%s(), no handler\n", __FUNCTION__);
1361         }
1362 }
1363
1364 #if 0
1365 /*
1366  * Function irlmp_hint_to_service (hint)
1367  *
1368  *    Returns a list of all servics contained in the given hint bits. This
1369  *    function assumes that the hint bits have the size of two bytes only
1370  */
1371 __u8 *irlmp_hint_to_service(__u8 *hint)
1372 {
1373         __u8 *service;
1374         int i = 0;
1375
1376         /*
1377          * Allocate array to store services in. 16 entries should be safe
1378          * since we currently only support 2 hint bytes
1379          */
1380         service = kmalloc(16, GFP_ATOMIC);
1381         if (!service) {
1382                 IRDA_DEBUG(1, "%s(), Unable to kmalloc!\n", __FUNCTION__);
1383                 return NULL;
1384         }
1385
1386         if (!hint[0]) {
1387                 IRDA_DEBUG(1, "<None>\n");
1388                 kfree(service);
1389                 return NULL;
1390         }
1391         if (hint[0] & HINT_PNP)
1392                 IRDA_DEBUG(1, "PnP Compatible ");
1393         if (hint[0] & HINT_PDA)
1394                 IRDA_DEBUG(1, "PDA/Palmtop ");
1395         if (hint[0] & HINT_COMPUTER)
1396                 IRDA_DEBUG(1, "Computer ");
1397         if (hint[0] & HINT_PRINTER) {
1398                 IRDA_DEBUG(1, "Printer ");
1399                 service[i++] = S_PRINTER;
1400         }
1401         if (hint[0] & HINT_MODEM)
1402                 IRDA_DEBUG(1, "Modem ");
1403         if (hint[0] & HINT_FAX)
1404                 IRDA_DEBUG(1, "Fax ");
1405         if (hint[0] & HINT_LAN) {
1406                 IRDA_DEBUG(1, "LAN Access ");
1407                 service[i++] = S_LAN;
1408         }
1409         /*
1410          *  Test if extension byte exists. This byte will usually be
1411          *  there, but this is not really required by the standard.
1412          *  (IrLMP p. 29)
1413          */
1414         if (hint[0] & HINT_EXTENSION) {
1415                 if (hint[1] & HINT_TELEPHONY) {
1416                         IRDA_DEBUG(1, "Telephony ");
1417                         service[i++] = S_TELEPHONY;
1418                 } if (hint[1] & HINT_FILE_SERVER)
1419                         IRDA_DEBUG(1, "File Server ");
1420
1421                 if (hint[1] & HINT_COMM) {
1422                         IRDA_DEBUG(1, "IrCOMM ");
1423                         service[i++] = S_COMM;
1424                 }
1425                 if (hint[1] & HINT_OBEX) {
1426                         IRDA_DEBUG(1, "IrOBEX ");
1427                         service[i++] = S_OBEX;
1428                 }
1429         }
1430         IRDA_DEBUG(1, "\n");
1431
1432         /* So that client can be notified about any discovery */
1433         service[i++] = S_ANY;
1434
1435         service[i] = S_END;
1436
1437         return service;
1438 }
1439 #endif
1440
1441 static const __u16 service_hint_mapping[S_END][2] = {
1442         { HINT_PNP,             0 },                    /* S_PNP */
1443         { HINT_PDA,             0 },                    /* S_PDA */
1444         { HINT_COMPUTER,        0 },                    /* S_COMPUTER */
1445         { HINT_PRINTER,         0 },                    /* S_PRINTER */
1446         { HINT_MODEM,           0 },                    /* S_MODEM */
1447         { HINT_FAX,             0 },                    /* S_FAX */
1448         { HINT_LAN,             0 },                    /* S_LAN */
1449         { HINT_EXTENSION,       HINT_TELEPHONY },       /* S_TELEPHONY */
1450         { HINT_EXTENSION,       HINT_COMM },            /* S_COMM */
1451         { HINT_EXTENSION,       HINT_OBEX },            /* S_OBEX */
1452         { 0xFF,                 0xFF },                 /* S_ANY */
1453 };
1454
1455 /*
1456  * Function irlmp_service_to_hint (service)
1457  *
1458  *    Converts a service type, to a hint bit
1459  *
1460  *    Returns: a 16 bit hint value, with the service bit set
1461  */
1462 __u16 irlmp_service_to_hint(int service)
1463 {
1464         __u16_host_order hint;
1465
1466         hint.byte[0] = service_hint_mapping[service][0];
1467         hint.byte[1] = service_hint_mapping[service][1];
1468
1469         return hint.word;
1470 }
1471 EXPORT_SYMBOL(irlmp_service_to_hint);
1472
1473 /*
1474  * Function irlmp_register_service (service)
1475  *
1476  *    Register local service with IrLMP
1477  *
1478  */
1479 void *irlmp_register_service(__u16 hints)
1480 {
1481         irlmp_service_t *service;
1482
1483         IRDA_DEBUG(4, "%s(), hints = %04x\n", __FUNCTION__, hints);
1484
1485         /* Make a new registration */
1486         service = kmalloc(sizeof(irlmp_service_t), GFP_ATOMIC);
1487         if (!service) {
1488                 IRDA_DEBUG(1, "%s(), Unable to kmalloc!\n", __FUNCTION__);
1489                 return NULL;
1490         }
1491         service->hints.word = hints;
1492         hashbin_insert(irlmp->services, (irda_queue_t *) service,
1493                        (long) service, NULL);
1494
1495         irlmp->hints.word |= hints;
1496
1497         return (void *)service;
1498 }
1499 EXPORT_SYMBOL(irlmp_register_service);
1500
1501 /*
1502  * Function irlmp_unregister_service (handle)
1503  *
1504  *    Unregister service with IrLMP.
1505  *
1506  *    Returns: 0 on success, -1 on error
1507  */
1508 int irlmp_unregister_service(void *handle)
1509 {
1510         irlmp_service_t *service;
1511         unsigned long flags;
1512
1513         IRDA_DEBUG(4, "%s()\n", __FUNCTION__);
1514
1515         if (!handle)
1516                 return -1;
1517
1518         /* Caller may call with invalid handle (it's legal) - Jean II */
1519         service = hashbin_lock_find(irlmp->services, (long) handle, NULL);
1520         if (!service) {
1521                 IRDA_DEBUG(1, "%s(), Unknown service!\n", __FUNCTION__);
1522                 return -1;
1523         }
1524
1525         hashbin_remove_this(irlmp->services, (irda_queue_t *) service);
1526         kfree(service);
1527
1528         /* Remove old hint bits */
1529         irlmp->hints.word = 0;
1530
1531         /* Refresh current hint bits */
1532         spin_lock_irqsave(&irlmp->services->hb_spinlock, flags);
1533         service = (irlmp_service_t *) hashbin_get_first(irlmp->services);
1534         while (service) {
1535                 irlmp->hints.word |= service->hints.word;
1536
1537                 service = (irlmp_service_t *)hashbin_get_next(irlmp->services);
1538         }
1539         spin_unlock_irqrestore(&irlmp->services->hb_spinlock, flags);
1540         return 0;
1541 }
1542 EXPORT_SYMBOL(irlmp_unregister_service);
1543
1544 /*
1545  * Function irlmp_register_client (hint_mask, callback1, callback2)
1546  *
1547  *    Register a local client with IrLMP
1548  *      First callback is selective discovery (based on hints)
1549  *      Second callback is for selective discovery expiries
1550  *
1551  *    Returns: handle > 0 on success, 0 on error
1552  */
1553 void *irlmp_register_client(__u16 hint_mask, DISCOVERY_CALLBACK1 disco_clb,
1554                             DISCOVERY_CALLBACK2 expir_clb, void *priv)
1555 {
1556         irlmp_client_t *client;
1557
1558         IRDA_DEBUG(1, "%s()\n", __FUNCTION__);
1559         IRDA_ASSERT(irlmp != NULL, return NULL;);
1560
1561         /* Make a new registration */
1562         client = kmalloc(sizeof(irlmp_client_t), GFP_ATOMIC);
1563         if (!client) {
1564                 IRDA_DEBUG( 1, "%s(), Unable to kmalloc!\n", __FUNCTION__);
1565                 return NULL;
1566         }
1567
1568         /* Register the details */
1569         client->hint_mask.word = hint_mask;
1570         client->disco_callback = disco_clb;
1571         client->expir_callback = expir_clb;
1572         client->priv = priv;
1573
1574         hashbin_insert(irlmp->clients, (irda_queue_t *) client,
1575                        (long) client, NULL);
1576
1577         return (void *) client;
1578 }
1579 EXPORT_SYMBOL(irlmp_register_client);
1580
1581 /*
1582  * Function irlmp_update_client (handle, hint_mask, callback1, callback2)
1583  *
1584  *    Updates specified client (handle) with possibly new hint_mask and
1585  *    callback
1586  *
1587  *    Returns: 0 on success, -1 on error
1588  */
1589 int irlmp_update_client(void *handle, __u16 hint_mask,
1590                         DISCOVERY_CALLBACK1 disco_clb,
1591                         DISCOVERY_CALLBACK2 expir_clb, void *priv)
1592 {
1593         irlmp_client_t *client;
1594
1595         if (!handle)
1596                 return -1;
1597
1598         client = hashbin_lock_find(irlmp->clients, (long) handle, NULL);
1599         if (!client) {
1600                 IRDA_DEBUG(1, "%s(), Unknown client!\n", __FUNCTION__);
1601                 return -1;
1602         }
1603
1604         client->hint_mask.word = hint_mask;
1605         client->disco_callback = disco_clb;
1606         client->expir_callback = expir_clb;
1607         client->priv = priv;
1608
1609         return 0;
1610 }
1611 EXPORT_SYMBOL(irlmp_update_client);
1612
1613 /*
1614  * Function irlmp_unregister_client (handle)
1615  *
1616  *    Returns: 0 on success, -1 on error
1617  *
1618  */
1619 int irlmp_unregister_client(void *handle)
1620 {
1621         struct irlmp_client *client;
1622
1623         IRDA_DEBUG(4, "%s()\n", __FUNCTION__);
1624
1625         if (!handle)
1626                 return -1;
1627
1628         /* Caller may call with invalid handle (it's legal) - Jean II */
1629         client = hashbin_lock_find(irlmp->clients, (long) handle, NULL);
1630         if (!client) {
1631                 IRDA_DEBUG(1, "%s(), Unknown client!\n", __FUNCTION__);
1632                 return -1;
1633         }
1634
1635         IRDA_DEBUG(4, "%s(), removing client!\n", __FUNCTION__);
1636         hashbin_remove_this(irlmp->clients, (irda_queue_t *) client);
1637         kfree(client);
1638
1639         return 0;
1640 }
1641 EXPORT_SYMBOL(irlmp_unregister_client);
1642
1643 /*
1644  * Function irlmp_slsap_inuse (slsap)
1645  *
1646  *    Check if the given source LSAP selector is in use
1647  *
1648  * This function is clearly not very efficient. On the mitigating side, the
1649  * stack make sure that in 99% of the cases, we are called only once
1650  * for each socket allocation. We could probably keep a bitmap
1651  * of the allocated LSAP, but I'm not sure the complexity is worth it.
1652  * Jean II
1653  */
1654 static int irlmp_slsap_inuse(__u8 slsap_sel)
1655 {
1656         struct lsap_cb *self;
1657         struct lap_cb *lap;
1658         unsigned long flags;
1659
1660         IRDA_ASSERT(irlmp != NULL, return TRUE;);
1661         IRDA_ASSERT(irlmp->magic == LMP_MAGIC, return TRUE;);
1662         IRDA_ASSERT(slsap_sel != LSAP_ANY, return TRUE;);
1663
1664         IRDA_DEBUG(4, "%s()\n", __FUNCTION__);
1665
1666 #ifdef CONFIG_IRDA_ULTRA
1667         /* Accept all bindings to the connectionless LSAP */
1668         if (slsap_sel == LSAP_CONNLESS)
1669                 return FALSE;
1670 #endif /* CONFIG_IRDA_ULTRA */
1671
1672         /* Valid values are between 0 and 127 (0x0-0x6F) */
1673         if (slsap_sel > LSAP_MAX)
1674                 return TRUE;
1675
1676         /*
1677          *  Check if slsap is already in use. To do this we have to loop over
1678          *  every IrLAP connection and check every LSAP associated with each
1679          *  the connection.
1680          */
1681         spin_lock_irqsave(&irlmp->links->hb_spinlock, flags);
1682         lap = (struct lap_cb *) hashbin_get_first(irlmp->links);
1683         while (lap != NULL) {
1684                 IRDA_ASSERT(lap->magic == LMP_LAP_MAGIC, goto errlap;);
1685
1686                 /* Careful for priority inversions here !
1687                  * irlmp->links is never taken while another IrDA
1688                  * spinlock is held, so we are safe. Jean II */
1689                 spin_lock(&lap->lsaps->hb_spinlock);
1690
1691                 /* For this IrLAP, check all the LSAPs */
1692                 self = (struct lsap_cb *) hashbin_get_first(lap->lsaps);
1693                 while (self != NULL) {
1694                         IRDA_ASSERT(self->magic == LMP_LSAP_MAGIC,
1695                                     goto errlsap;);
1696
1697                         if ((self->slsap_sel == slsap_sel)) {
1698                                 IRDA_DEBUG(4, "Source LSAP selector=%02x in use\n",
1699                                            self->slsap_sel);
1700                                 goto errlsap;
1701                         }
1702                         self = (struct lsap_cb*) hashbin_get_next(lap->lsaps);
1703                 }
1704                 spin_unlock(&lap->lsaps->hb_spinlock);
1705
1706                 /* Next LAP */
1707                 lap = (struct lap_cb *) hashbin_get_next(irlmp->links);
1708         }
1709         spin_unlock_irqrestore(&irlmp->links->hb_spinlock, flags);
1710
1711         /*
1712          * Server sockets are typically waiting for connections and
1713          * therefore reside in the unconnected list. We don't want
1714          * to give out their LSAPs for obvious reasons...
1715          * Jean II
1716          */
1717         spin_lock_irqsave(&irlmp->unconnected_lsaps->hb_spinlock, flags);
1718
1719         self = (struct lsap_cb *) hashbin_get_first(irlmp->unconnected_lsaps);
1720         while (self != NULL) {
1721                 IRDA_ASSERT(self->magic == LMP_LSAP_MAGIC, goto erruncon;);
1722                 if ((self->slsap_sel == slsap_sel)) {
1723                         IRDA_DEBUG(4, "Source LSAP selector=%02x in use (unconnected)\n",
1724                                    self->slsap_sel);
1725                         goto erruncon;
1726                 }
1727                 self = (struct lsap_cb*) hashbin_get_next(irlmp->unconnected_lsaps);
1728         }
1729         spin_unlock_irqrestore(&irlmp->unconnected_lsaps->hb_spinlock, flags);
1730
1731         return FALSE;
1732
1733         /* Error exit from within one of the two nested loops.
1734          * Make sure we release the right spinlock in the righ order.
1735          * Jean II */
1736 errlsap:
1737         spin_unlock(&lap->lsaps->hb_spinlock);
1738 IRDA_ASSERT_LABEL(errlap:)
1739         spin_unlock_irqrestore(&irlmp->links->hb_spinlock, flags);
1740         return TRUE;
1741
1742         /* Error exit from within the unconnected loop.
1743          * Just one spinlock to release... Jean II */
1744 erruncon:
1745         spin_unlock_irqrestore(&irlmp->unconnected_lsaps->hb_spinlock, flags);
1746         return TRUE;
1747 }
1748
1749 /*
1750  * Function irlmp_find_free_slsap ()
1751  *
1752  *    Find a free source LSAP to use. This function is called if the service
1753  *    user has requested a source LSAP equal to LM_ANY
1754  */
1755 static __u8 irlmp_find_free_slsap(void)
1756 {
1757         __u8 lsap_sel;
1758         int wrapped = 0;
1759
1760         IRDA_ASSERT(irlmp != NULL, return -1;);
1761         IRDA_ASSERT(irlmp->magic == LMP_MAGIC, return -1;);
1762
1763         /* Most users don't really care which LSAPs they are given,
1764          * and therefore we automatically give them a free LSAP.
1765          * This function try to find a suitable LSAP, i.e. which is
1766          * not in use and is within the acceptable range. Jean II */
1767
1768         do {
1769                 /* Always increment to LSAP number before using it.
1770                  * In theory, we could reuse the last LSAP number, as long
1771                  * as it is no longer in use. Some IrDA stack do that.
1772                  * However, the previous socket may be half closed, i.e.
1773                  * we closed it, we think it's no longer in use, but the
1774                  * other side did not receive our close and think it's
1775                  * active and still send data on it.
1776                  * This is similar to what is done with PIDs and TCP ports.
1777                  * Also, this reduce the number of calls to irlmp_slsap_inuse()
1778                  * which is an expensive function to call.
1779                  * Jean II */
1780                 irlmp->last_lsap_sel++;
1781
1782                 /* Check if we need to wraparound (0x70-0x7f are reserved) */
1783                 if (irlmp->last_lsap_sel > LSAP_MAX) {
1784                         /* 0x00-0x10 are also reserved for well know ports */
1785                         irlmp->last_lsap_sel = 0x10;
1786
1787                         /* Make sure we terminate the loop */
1788                         if (wrapped++) {
1789                                 IRDA_ERROR("%s: no more free LSAPs !\n",
1790                                            __FUNCTION__);
1791                                 return 0;
1792                         }
1793                 }
1794
1795                 /* If the LSAP is in use, try the next one.
1796                  * Despite the autoincrement, we need to check if the lsap
1797                  * is really in use or not, first because LSAP may be
1798                  * directly allocated in irlmp_open_lsap(), and also because
1799                  * we may wraparound on old sockets. Jean II */
1800         } while (irlmp_slsap_inuse(irlmp->last_lsap_sel));
1801
1802         /* Got it ! */
1803         lsap_sel = irlmp->last_lsap_sel;
1804         IRDA_DEBUG(4, "%s(), found free lsap_sel=%02x\n",
1805                    __FUNCTION__, lsap_sel);
1806
1807         return lsap_sel;
1808 }
1809
1810 /*
1811  * Function irlmp_convert_lap_reason (lap_reason)
1812  *
1813  *    Converts IrLAP disconnect reason codes to IrLMP disconnect reason
1814  *    codes
1815  *
1816  */
1817 LM_REASON irlmp_convert_lap_reason( LAP_REASON lap_reason)
1818 {
1819         int reason = LM_LAP_DISCONNECT;
1820
1821         switch (lap_reason) {
1822         case LAP_DISC_INDICATION: /* Received a disconnect request from peer */
1823                 IRDA_DEBUG( 1, "%s(), LAP_DISC_INDICATION\n", __FUNCTION__);
1824                 reason = LM_USER_REQUEST;
1825                 break;
1826         case LAP_NO_RESPONSE:    /* To many retransmits without response */
1827                 IRDA_DEBUG( 1, "%s(), LAP_NO_RESPONSE\n", __FUNCTION__);
1828                 reason = LM_LAP_DISCONNECT;
1829                 break;
1830         case LAP_RESET_INDICATION:
1831                 IRDA_DEBUG( 1, "%s(), LAP_RESET_INDICATION\n", __FUNCTION__);
1832                 reason = LM_LAP_RESET;
1833                 break;
1834         case LAP_FOUND_NONE:
1835         case LAP_MEDIA_BUSY:
1836         case LAP_PRIMARY_CONFLICT:
1837                 IRDA_DEBUG(1, "%s(), LAP_FOUND_NONE, LAP_MEDIA_BUSY or LAP_PRIMARY_CONFLICT\n", __FUNCTION__);
1838                 reason = LM_CONNECT_FAILURE;
1839                 break;
1840         default:
1841                 IRDA_DEBUG(1, "%s(), Unknow IrLAP disconnect reason %d!\n",
1842                            __FUNCTION__, lap_reason);
1843                 reason = LM_LAP_DISCONNECT;
1844                 break;
1845         }
1846
1847         return reason;
1848 }
1849
1850 #ifdef CONFIG_PROC_FS
1851
1852 struct irlmp_iter_state {
1853         hashbin_t *hashbin;
1854 };
1855
1856 #define LSAP_START_TOKEN        ((void *)1)
1857 #define LINK_START_TOKEN        ((void *)2)
1858
1859 static void *irlmp_seq_hb_idx(struct irlmp_iter_state *iter, loff_t *off)
1860 {
1861         void *element;
1862
1863         spin_lock_irq(&iter->hashbin->hb_spinlock);
1864         for (element = hashbin_get_first(iter->hashbin);
1865              element != NULL;
1866              element = hashbin_get_next(iter->hashbin)) {
1867                 if (!off || *off-- == 0) {
1868                         /* NB: hashbin left locked */
1869                         return element;
1870                 }
1871         }
1872         spin_unlock_irq(&iter->hashbin->hb_spinlock);
1873         iter->hashbin = NULL;
1874         return NULL;
1875 }
1876
1877
1878 static void *irlmp_seq_start(struct seq_file *seq, loff_t *pos)
1879 {
1880         struct irlmp_iter_state *iter = seq->private;
1881         void *v;
1882         loff_t off = *pos;
1883
1884         iter->hashbin = NULL;
1885         if (off-- == 0)
1886                 return LSAP_START_TOKEN;
1887
1888         iter->hashbin = irlmp->unconnected_lsaps;
1889         v = irlmp_seq_hb_idx(iter, &off);
1890         if (v)
1891                 return v;
1892
1893         if (off-- == 0)
1894                 return LINK_START_TOKEN;
1895
1896         iter->hashbin = irlmp->links;
1897         return irlmp_seq_hb_idx(iter, &off);
1898 }
1899
1900 static void *irlmp_seq_next(struct seq_file *seq, void *v, loff_t *pos)
1901 {
1902         struct irlmp_iter_state *iter = seq->private;
1903
1904         ++*pos;
1905
1906         if (v == LSAP_START_TOKEN) {            /* start of list of lsaps */
1907                 iter->hashbin = irlmp->unconnected_lsaps;
1908                 v = irlmp_seq_hb_idx(iter, NULL);
1909                 return v ? v : LINK_START_TOKEN;
1910         }
1911
1912         if (v == LINK_START_TOKEN) {            /* start of list of links */
1913                 iter->hashbin = irlmp->links;
1914                 return irlmp_seq_hb_idx(iter, NULL);
1915         }
1916
1917         v = hashbin_get_next(iter->hashbin);
1918
1919         if (v == NULL) {                        /* no more in this hash bin */
1920                 spin_unlock_irq(&iter->hashbin->hb_spinlock);
1921
1922                 if (iter->hashbin == irlmp->unconnected_lsaps)
1923                         v =  LINK_START_TOKEN;
1924
1925                 iter->hashbin = NULL;
1926         }
1927         return v;
1928 }
1929
1930 static void irlmp_seq_stop(struct seq_file *seq, void *v)
1931 {
1932         struct irlmp_iter_state *iter = seq->private;
1933
1934         if (iter->hashbin)
1935                 spin_unlock_irq(&iter->hashbin->hb_spinlock);
1936 }
1937
1938 static int irlmp_seq_show(struct seq_file *seq, void *v)
1939 {
1940         const struct irlmp_iter_state *iter = seq->private;
1941         struct lsap_cb *self = v;
1942
1943         if (v == LSAP_START_TOKEN)
1944                 seq_puts(seq, "Unconnected LSAPs:\n");
1945         else if (v == LINK_START_TOKEN)
1946                 seq_puts(seq, "\nRegistered Link Layers:\n");
1947         else if (iter->hashbin == irlmp->unconnected_lsaps) {
1948                 self = v;
1949                 IRDA_ASSERT(self->magic == LMP_LSAP_MAGIC, return -EINVAL; );
1950                 seq_printf(seq, "lsap state: %s, ",
1951                            irlsap_state[ self->lsap_state]);
1952                 seq_printf(seq,
1953                            "slsap_sel: %#02x, dlsap_sel: %#02x, ",
1954                            self->slsap_sel, self->dlsap_sel);
1955                 seq_printf(seq, "(%s)", self->notify.name);
1956                 seq_printf(seq, "\n");
1957         } else if (iter->hashbin == irlmp->links) {
1958                 struct lap_cb *lap = v;
1959
1960                 seq_printf(seq, "lap state: %s, ",
1961                            irlmp_state[lap->lap_state]);
1962
1963                 seq_printf(seq, "saddr: %#08x, daddr: %#08x, ",
1964                            lap->saddr, lap->daddr);
1965                 seq_printf(seq, "num lsaps: %d",
1966                            HASHBIN_GET_SIZE(lap->lsaps));
1967                 seq_printf(seq, "\n");
1968
1969                 /* Careful for priority inversions here !
1970                  * All other uses of attrib spinlock are independent of
1971                  * the object spinlock, so we are safe. Jean II */
1972                 spin_lock(&lap->lsaps->hb_spinlock);
1973
1974                 seq_printf(seq, "\n  Connected LSAPs:\n");
1975                 for (self = (struct lsap_cb *) hashbin_get_first(lap->lsaps);
1976                      self != NULL;
1977                      self = (struct lsap_cb *)hashbin_get_next(lap->lsaps)) {
1978                         IRDA_ASSERT(self->magic == LMP_LSAP_MAGIC,
1979                                     goto outloop;);
1980                         seq_printf(seq, "  lsap state: %s, ",
1981                                    irlsap_state[ self->lsap_state]);
1982                         seq_printf(seq,
1983                                    "slsap_sel: %#02x, dlsap_sel: %#02x, ",
1984                                    self->slsap_sel, self->dlsap_sel);
1985                         seq_printf(seq, "(%s)", self->notify.name);
1986                         seq_putc(seq, '\n');
1987
1988                 }
1989         IRDA_ASSERT_LABEL(outloop:)
1990                 spin_unlock(&lap->lsaps->hb_spinlock);
1991                 seq_putc(seq, '\n');
1992         } else
1993                 return -EINVAL;
1994
1995         return 0;
1996 }
1997
1998 static struct seq_operations irlmp_seq_ops = {
1999         .start  = irlmp_seq_start,
2000         .next   = irlmp_seq_next,
2001         .stop   = irlmp_seq_stop,
2002         .show   = irlmp_seq_show,
2003 };
2004
2005 static int irlmp_seq_open(struct inode *inode, struct file *file)
2006 {
2007         struct seq_file *seq;
2008         int rc = -ENOMEM;
2009         struct irlmp_iter_state *s;
2010
2011         IRDA_ASSERT(irlmp != NULL, return -EINVAL;);
2012
2013         s = kmalloc(sizeof(*s), GFP_KERNEL);
2014         if (!s)
2015                 goto out;
2016
2017         rc = seq_open(file, &irlmp_seq_ops);
2018         if (rc)
2019                 goto out_kfree;
2020
2021         seq          = file->private_data;
2022         seq->private = s;
2023 out:
2024         return rc;
2025 out_kfree:
2026         kfree(s);
2027         goto out;
2028 }
2029
2030 struct file_operations irlmp_seq_fops = {
2031         .owner          = THIS_MODULE,
2032         .open           = irlmp_seq_open,
2033         .read           = seq_read,
2034         .llseek         = seq_lseek,
2035         .release        = seq_release_private,
2036 };
2037
2038 #endif /* PROC_FS */