42 void QueueP_init(QueueP_Obj *obj)  in QueueP_init()  argument
44     obj->elem.next = obj->elem.prev = &(obj->elem);  in QueueP_init()
50 bool QueueP_empty(QueueP_Obj *obj)  in QueueP_empty()  argument
52     return (obj->elem.next == &(obj->elem));  in QueueP_empty()
58 uintptr_t QueueP_get(QueueP_Obj *obj)  in QueueP_get()  argument
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()
79 uintptr_t QueueP_getTail(QueueP_Obj *obj)  in QueueP_getTail()  argument
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()
100 uintptr_t QueueP_head(QueueP_Obj *obj)  in QueueP_head()  argument
102     return ((uintptr_t)(obj->elem.next));  in QueueP_head()
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()