48         newNode->next = node->next;  in insertAfter()
49         if (node->next == 0) mLast = newNode;  in insertAfter()
50         else                 node->next->prev = newNode;  in insertAfter()
51         node->next = newNode;  in insertAfter()
56          newNode->next = node;  in insertBefore()
58          else                   node->prev->next = newNode;  in insertBefore()
65             newNode->prev = newNode->next = 0;  in insertHead()
68             newNode->next = mFirst;  in insertHead()
79             newNode->next = 0;  in insertTail()
80             mLast->next = newNode;  in insertTail()
86         if (node->prev == 0)    mFirst = node->next;  in remove()
87         else                    node->prev->next = node->next;  in remove()
88         if (node->next == 0)    mLast = node->prev;  in remove()
89         else                    node->next->prev = node->prev;  in remove()
111             : start(start), size(size), free(1), prev(0), next(0) {  in chunk_t()
117         mutable chunk_t*    next;  member