233 static void enqueue_first(irda_queue_t **queue, irda_queue_t* element)  in enqueue_first()  argument
239 	if ( *queue == NULL ) {  in enqueue_first()
243 		element->q_next = element->q_prev = *queue = element;  in enqueue_first()
249 		element->q_next          = (*queue);  in enqueue_first()
250 		(*queue)->q_prev->q_next = element;  in enqueue_first()
251 		element->q_prev          = (*queue)->q_prev;  in enqueue_first()
252 		(*queue)->q_prev         = element;  in enqueue_first()
253 		(*queue)                 = element;  in enqueue_first()
264 static irda_queue_t *dequeue_first(irda_queue_t **queue)  in dequeue_first()  argument
273 	ret =  *queue;  in dequeue_first()
275 	if ( *queue == NULL ) {  in dequeue_first()
279 	} else if ( (*queue)->q_next == *queue ) {  in dequeue_first()
284 		*queue = NULL;  in dequeue_first()
289 		(*queue)->q_prev->q_next = (*queue)->q_next;  in dequeue_first()
290 		(*queue)->q_next->q_prev = (*queue)->q_prev;  in dequeue_first()
291 		*queue = (*queue)->q_next;  in dequeue_first()
305 static irda_queue_t *dequeue_general(irda_queue_t **queue, irda_queue_t* element)  in dequeue_general()  argument
314 	ret =  *queue;  in dequeue_general()
316 	if ( *queue == NULL ) {  in dequeue_general()
320 	} else if ( (*queue)->q_next == *queue ) {  in dequeue_general()
325 		*queue = NULL;  in dequeue_general()
333 		if ( (*queue) == element)  in dequeue_general()
334 			(*queue) = element->q_next;  in dequeue_general()
391 	irda_queue_t* queue;  in hashbin_delete()  local
409 		queue = dequeue_first((irda_queue_t**) &hashbin->hb_queue[i]);  in hashbin_delete()
410 		while (queue ) {  in hashbin_delete()
412 				(*free_func)(queue);  in hashbin_delete()
413 			queue = dequeue_first(  in hashbin_delete()