Lines Matching refs:lsaps
238 * list of unconnected lsaps (not associated with a link)
253 lsap = hashbin_remove(lap->lsaps, (long) self, NULL);
259 /* Check if we found the LSAP! If not then try the unconnected lsaps */
305 lap->lsaps = hashbin_new(HB_LOCK);
306 if (lap->lsaps == NULL) {
307 IRDA_WARNING("%s(), unable to kmalloc lsaps\n", __func__);
359 hashbin_delete(link->lsaps, (FREE_FUNC) __irlmp_close_lsap);
451 if (HASHBIN_GET_SIZE(lap->lsaps) == 0) {
481 hashbin_insert(self->lap->lsaps, (irda_queue_t *) self, (long) self,
718 IRDA_ASSERT(self->lap->lsaps != NULL, return -1;);
720 lsap = hashbin_remove(self->lap->lsaps, (long) self, NULL);
770 IRDA_ASSERT(self->lap->lsaps != NULL, return;);
772 lsap = hashbin_remove(self->lap->lsaps, (long) self, NULL);
1298 curr = (struct lsap_cb *) hashbin_get_first( self->lsaps);
1299 while (NULL != hashbin_find_next(self->lsaps, (long) curr, NULL,
1336 lsap_todo = HASHBIN_GET_SIZE(self->lsaps);
1337 IRDA_DEBUG(4, "%s() : %d lsaps to scan\n", __func__, lsap_todo);
1349 next = (struct lsap_cb *) hashbin_get_first(self->lsaps);
1351 curr = hashbin_find_next(self->lsaps, (long) next, NULL,
1617 spin_lock(&lap->lsaps->hb_spinlock);
1620 self = (struct lsap_cb *) hashbin_get_first(lap->lsaps);
1630 self = (struct lsap_cb*) hashbin_get_next(lap->lsaps);
1632 spin_unlock(&lap->lsaps->hb_spinlock);
1665 spin_unlock(&lap->lsaps->hb_spinlock);
1834 if (v == LSAP_START_TOKEN) { /* start of list of lsaps */
1893 seq_printf(seq, "num lsaps: %d",
1894 HASHBIN_GET_SIZE(lap->lsaps));
1900 spin_lock(&lap->lsaps->hb_spinlock);
1903 for (self = (struct lsap_cb *) hashbin_get_first(lap->lsaps);
1905 self = (struct lsap_cb *)hashbin_get_next(lap->lsaps)) {
1918 spin_unlock(&lap->lsaps->hb_spinlock);