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()
81     QueueP_Elem *elem;  in QueueP_getTail()  local
86     elem = obj->elem.prev;  in QueueP_getTail()
88     obj->elem.prev = elem->prev;  in QueueP_getTail()
89     elem->prev->next = &(obj->elem);  in QueueP_getTail()
93     return ((uintptr_t)elem);  in QueueP_getTail()
102     return ((uintptr_t)(obj->elem.next));  in QueueP_head()
116 void QueueP_insert(QueueP_Elem *qelem, QueueP_Elem *elem)  in QueueP_insert()  argument
118     QueueP_put((QueueP_Obj *)qelem, elem);  in QueueP_insert()
140 void QueueP_put(QueueP_Obj *obj, QueueP_Elem *elem)  in QueueP_put()  argument
146     elem->next = &(obj->elem);  in QueueP_put()
147     elem->prev = obj->elem.prev;  in QueueP_put()
148     obj->elem.prev->next = elem;  in QueueP_put()
149     obj->elem.prev = elem;  in QueueP_put()
157 void QueueP_putHead(QueueP_Obj *obj, QueueP_Elem *elem)  in QueueP_putHead()  argument
163     elem->prev = &(obj->elem);  in QueueP_putHead()
164     elem->next = obj->elem.next;  in QueueP_putHead()
165     obj->elem.next->prev = elem;  in QueueP_putHead()
166     obj->elem.next = elem;  in QueueP_putHead()