33     inline void enqueueAtTail(T* entry) {  in enqueueAtTail()
35         entry->prev = tail;  in enqueueAtTail()
37             tail->next = entry;  in enqueueAtTail()
39             head = entry;  in enqueueAtTail()
41         entry->next = nullptr;  in enqueueAtTail()
42         tail = entry;  in enqueueAtTail()
45     inline void enqueueAtHead(T* entry) {  in enqueueAtHead()
47         entry->next = head;  in enqueueAtHead()
49             head->prev = entry;  in enqueueAtHead()
51             tail = entry;  in enqueueAtHead()
53         entry->prev = nullptr;  in enqueueAtHead()
54         head = entry;  in enqueueAtHead()
57     inline void dequeue(T* entry) {  in dequeue()
59         if (entry->prev) {  in dequeue()
60             entry->prev->next = entry->next;  in dequeue()
62             head = entry->next;  in dequeue()
64         if (entry->next) {  in dequeue()
65             entry->next->prev = entry->prev;  in dequeue()
67             tail = entry->prev;  in dequeue()
73         T* entry = head;  in dequeueAtHead()  local
74         head = entry->next;  in dequeueAtHead()
80         return entry;  in dequeueAtHead()