return queue->tail;
}
+struct QueueItem * getHead(struct Queue * queue) {
+ return queue->head;
+}
+
struct QueueItem * getNextQueueItem(struct QueueItem * qi) {
return qi->next;
}
q->next->prev=NULL;
}
queue->head=q->next;
+ if(queue->tail == q) {
+ queue->tail = NULL;
+ }
RUNFREE(q);
return ptr;
}