44    QNode *pPrev;  member
58    QNode *pPrev = me->pPrev;  in QNode_InsPrev()  local
61    pn->pPrev    = pPrev;  in QNode_InsPrev()
62    pPrev->pNext = pn;  in QNode_InsPrev()
63    me->pPrev    = pn;  in QNode_InsPrev()
71    pn->pPrev    = me;  in QNode_InsNext()
73    pNext->pPrev = pn;  in QNode_InsNext()
82    QNode *pPrev = me->pPrev;  in QNode_Dequeue()  local
84    pPrev->pNext = pNext;  in QNode_Dequeue()
85    pNext->pPrev = pPrev;  in QNode_Dequeue()
90    me->pNext = me->pPrev = 0;  in QNode_CtorZ()
102       me->pNext = me->pPrev = 0;  in QNode_DequeueZ()
113    me->n.pNext = me->n.pPrev = &me->n;  in QList_Zero()
130    return ((0 == me->n.pNext) && (0 == me->n.pPrev));  in QList_IsNull()
151    s->pNext->pPrev = d;  in QList_CtorFrom()
152    d->pPrev        = s->pPrev;  in QList_CtorFrom()
154    s->pPrev->pNext = d;  in QList_CtorFrom()
165    QNode *dp = d->pPrev;  in QList_AppendList()
169    sn->pPrev   = dp;  in QList_AppendList()
171    d->pPrev    = (sp = s->pPrev);  in QList_AppendList()
189    for ((pNode) = (pList)->n.pPrev; \
191         (pNode) = (pNode)->pPrev)
196         (pNode) = (pNode)->pPrev)
213    QNode *pn = me->n.pPrev;  in QList_GetLast()
224    pnn->pPrev   = &me->n;  in QList_Pop()
240    QNode *pp = me->n.pPrev;  in QList_PopLast()
241    QNode *ppp = pp->pPrev;  in QList_PopLast()
243    me->n.pPrev = ppp;  in QList_PopLast()