Lines Matching defs:element
232 static void enqueue_first(irda_queue_t **queue, irda_queue_t* element)
242 * Queue is empty. Insert one element into the queue.
244 element->q_next = element->q_prev = *queue = element;
248 * Queue is not empty. Insert element into front of queue.
250 element->q_next = (*queue);
251 (*queue)->q_prev->q_next = element;
252 element->q_prev = (*queue)->q_prev;
253 (*queue)->q_prev = element;
254 (*queue) = element;
282 * Queue only contained a single element. It will now be
288 * Queue contained several element. Remove the first one.
302 * Function dequeue_general (queue, element)
306 static irda_queue_t *dequeue_general(irda_queue_t **queue, irda_queue_t* element)
323 * Queue only contained a single element. It will now be
330 * Remove specific element.
332 element->q_prev->q_next = element->q_next;
333 element->q_next->q_prev = element->q_prev;
334 if ( (*queue) == element)
335 (*queue) = element->q_next;
835 * Get a pointer to first element in hashbin, this function must be