49         newNode->next = node->next;  in insertAfter()
50         if (node->next == 0) mLast = newNode;  in insertAfter()
51         else                 node->next->prev = newNode;  in insertAfter()
52         node->next = newNode;  in insertAfter()
57          newNode->next = node;  in insertBefore()
59          else                   node->prev->next = newNode;  in insertBefore()
66             newNode->prev = newNode->next = 0;  in insertHead()
69             newNode->next = mFirst;  in insertHead()
80             newNode->next = 0;  in insertTail()
81             mLast->next = newNode;  in insertTail()
87         if (node->prev == 0)    mFirst = node->next;  in remove()
88         else                    node->prev->next = node->next;  in remove()
89         if (node->next == 0)    mLast = node->prev;  in remove()
90         else                    node->next->prev = node->prev;  in remove()
112             : start(start), size(size), free(1), prev(0), next(0) {  in chunk_t()
118         mutable chunk_t*    next;  member