22 _Out_ QUEUE_HEAD *QueueHead
25 QueueHead->Next = QueueHead;
31 _In_ QUEUE_HEAD *QueueHead
34 return (
BOOLEAN)(QueueHead->Next == QueueHead);
40 _In_ QUEUE_HEAD *QueueHead
53 _In_ QUEUE_HEAD *QueueHead,
58 QueueHead->
Head = Element;
60 Element->
Next = oldHead;
struct _QUEUE QUEUE_ENTRY
void QueueInsert(QUEUE_HEAD *QueueHead, QUEUE_ENTRY *Element)
void QueueInitialize(QUEUE_HEAD *QueueHead)
struct _QUEUE * PQUEUE_ENTRY
BOOLEAN QueueIsEmpty(QUEUE_HEAD *QueueHead)
QUEUE_ENTRY * QueueRemove(QUEUE_HEAD *QueueHead)
struct _QUEUE * PQUEUE_HEAD