44     obj->elem.next = obj->elem.prev = &(obj->elem);  in QueueP_init()
68     elem->next->prev = &(obj->elem);  in QueueP_get()
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()
110     qelem->next = qelem->prev = qelem;  in QueueP_elemClear()
134     return ((uintptr_t)qelem->prev);  in QueueP_prev()
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()
163     elem->prev = &(obj->elem);  in QueueP_putHead()
165     obj->elem.next->prev = elem;  in QueueP_putHead()
179     qelem->prev->next = temp;  in QueueP_remove()
180     temp = qelem->prev;  in QueueP_remove()
181     qelem->next->prev = temp;  in QueueP_remove()
183     qelem->prev->next = qelem->next;  in QueueP_remove()
184     qelem->next->prev = qelem->prev;  in QueueP_remove()
193     if ((qelem->prev == qelem) && (qelem->next == qelem)) {  in QueueP_isQueued()