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()
88     elem->prev->next = &(obj->elem);  in QueueP_getTail()
100     return ((uintptr_t)(obj->elem.next));  in QueueP_head()
108     qelem->next = qelem->prev = qelem;  in QueueP_elemClear()
124     return ((uintptr_t)qelem->next);  in QueueP_next()
144     elem->next           = &(obj->elem);  in QueueP_put()
146     obj->elem.prev->next = elem;  in QueueP_put()
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()
176     temp              = qelem->next;  in QueueP_remove()
177     qelem->prev->next = temp;  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()