44     obj->elem.next = obj->elem.prev = &(obj->elem);  in QueueP_init()
52     return (obj->elem.next == &(obj->elem));  in QueueP_empty()
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()
89     elem->prev->next = &(obj->elem);  in QueueP_getTail()
102     return ((uintptr_t)(obj->elem.next));  in QueueP_head()
110     qelem->next = qelem->prev = qelem;  in QueueP_elemClear()
126     return ((uintptr_t)qelem->next);  in QueueP_next()
146     elem->next = &(obj->elem);  in QueueP_put()
148     obj->elem.prev->next = elem;  in QueueP_put()
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()
178     temp = qelem->next;  in QueueP_remove()
179     qelem->prev->next = temp;  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()