44     obj->elem.next = obj->elem.prev = &(obj->elem);  in QueueP_init()
52     return (obj->elem.next == &(obj->elem));  in QueueP_empty()
60     QueueP_Elem *elem;  in QueueP_get()  local
65     elem = obj->elem.next;  in QueueP_get()
67     obj->elem.next   = elem->next;  in QueueP_get()
68     elem->next->prev = &(obj->elem);  in QueueP_get()
72     return ((uintptr_t)elem);  in QueueP_get()
80     QueueP_Elem *elem;  in QueueP_getTail()  local
85     elem = obj->elem.prev;  in QueueP_getTail()
87     obj->elem.prev   = elem->prev;  in QueueP_getTail()
88     elem->prev->next = &(obj->elem);  in QueueP_getTail()
92     return ((uintptr_t)elem);  in QueueP_getTail()
100     return ((uintptr_t)(obj->elem.next));  in QueueP_head()
114 void QueueP_insert(QueueP_Elem *qelem, QueueP_Elem *elem)  in QueueP_insert()  argument
116     QueueP_put((QueueP_Obj *)qelem, elem);  in QueueP_insert()
138 void QueueP_put(QueueP_Obj *obj, QueueP_Elem *elem)  in QueueP_put()  argument
144     elem->next           = &(obj->elem);  in QueueP_put()
145     elem->prev           = obj->elem.prev;  in QueueP_put()
146     obj->elem.prev->next = elem;  in QueueP_put()
147     obj->elem.prev       = elem;  in QueueP_put()
155 void QueueP_putHead(QueueP_Obj *obj, QueueP_Elem *elem)  in QueueP_putHead()  argument
161     elem->prev           = &(obj->elem);  in QueueP_putHead()
162     elem->next           = obj->elem.next;  in QueueP_putHead()
163     obj->elem.next->prev = elem;  in QueueP_putHead()
164     obj->elem.next       = elem;  in QueueP_putHead()