Lines Matching refs:lsaps
235 * list of unconnected lsaps (not associated with a link)
250 lsap = hashbin_remove(lap->lsaps, (long) self, NULL);
256 /* Check if we found the LSAP! If not then try the unconnected lsaps */
302 lap->lsaps = hashbin_new(HB_LOCK);
303 if (lap->lsaps == NULL) {
304 IRDA_WARNING("%s(), unable to kmalloc lsaps\n", __FUNCTION__);
447 if (HASHBIN_GET_SIZE(lap->lsaps) == 0) {
477 hashbin_insert(self->lap->lsaps, (irda_queue_t *) self, (long) self,
714 IRDA_ASSERT(self->lap->lsaps != NULL, return -1;);
716 lsap = hashbin_remove(self->lap->lsaps, (long) self, NULL);
766 IRDA_ASSERT(self->lap->lsaps != NULL, return;);
768 lsap = hashbin_remove(self->lap->lsaps, (long) self, NULL);
1293 curr = (struct lsap_cb *) hashbin_get_first( self->lsaps);
1294 while (NULL != hashbin_find_next(self->lsaps, (long) curr, NULL,
1331 lsap_todo = HASHBIN_GET_SIZE(self->lsaps);
1332 IRDA_DEBUG(4, "%s() : %d lsaps to scan\n", __FUNCTION__, lsap_todo);
1344 next = (struct lsap_cb *) hashbin_get_first(self->lsaps);
1346 curr = hashbin_find_next(self->lsaps, (long) next, NULL,
1612 spin_lock(&lap->lsaps->hb_spinlock);
1615 self = (struct lsap_cb *) hashbin_get_first(lap->lsaps);
1625 self = (struct lsap_cb*) hashbin_get_next(lap->lsaps);
1627 spin_unlock(&lap->lsaps->hb_spinlock);
1660 spin_unlock(&lap->lsaps->hb_spinlock);
1829 if (v == LSAP_START_TOKEN) { /* start of list of lsaps */
1888 seq_printf(seq, "num lsaps: %d",
1889 HASHBIN_GET_SIZE(lap->lsaps));
1895 spin_lock(&lap->lsaps->hb_spinlock);
1898 for (self = (struct lsap_cb *) hashbin_get_first(lap->lsaps);
1900 self = (struct lsap_cb *)hashbin_get_next(lap->lsaps)) {
1913 spin_unlock(&lap->lsaps->hb_spinlock);