Lines Matching refs:element
233 static void enqueue_first(irda_queue_t **queue, irda_queue_t* element)
243 * Queue is empty. Insert one element into the queue.
245 element->q_next = element->q_prev = *queue = element;
249 * Queue is not empty. Insert element into front of queue.
251 element->q_next = (*queue);
252 (*queue)->q_prev->q_next = element;
253 element->q_prev = (*queue)->q_prev;
254 (*queue)->q_prev = element;
255 (*queue) = element;
283 * Queue only contained a single element. It will now be
289 * Queue contained several element. Remove the first one.
303 * Function dequeue_general (queue, element)
307 static irda_queue_t *dequeue_general(irda_queue_t **queue, irda_queue_t* element)
324 * Queue only contained a single element. It will now be
331 * Remove specific element.
333 element->q_prev->q_next = element->q_next;
334 element->q_next->q_prev = element->q_prev;
335 if ( (*queue) == element)
336 (*queue) = element->q_next;
836 * Get a pointer to first element in hashbin, this function must be