44     obj->elem.next = obj->elem.prev = &(obj->elem);  in QueueP_init()
68     elem->next->prev = &(obj->elem);  in QueueP_get()
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()
108     qelem->next = qelem->prev = qelem;  in QueueP_elemClear()
132     return ((uintptr_t)qelem->prev);  in QueueP_prev()
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()
161     elem->prev           = &(obj->elem);  in QueueP_putHead()
163     obj->elem.next->prev = elem;  in QueueP_putHead()
177     qelem->prev->next = temp;  in QueueP_remove()
178     temp              = qelem->prev;  in QueueP_remove()
179     qelem->next->prev = temp;  in QueueP_remove()
181     qelem->prev->next = qelem->next;  in QueueP_remove()
182     qelem->next->prev = qelem->prev;  in QueueP_remove()
191     if ((qelem->prev == qelem) && (qelem->next == qelem))  in QueueP_isQueued()