48         newNode->prev = node;  in insertAfter()
51         else                 node->next->prev = newNode;  in insertAfter()
56          newNode->prev = node->prev;  in insertBefore()
58          if (node->prev == 0)   mFirst = newNode;  in insertBefore()
59          else                   node->prev->next = newNode;  in insertBefore()
60          node->prev = newNode;  in insertBefore()
66             newNode->prev = newNode->next = 0;  in insertHead()
68             newNode->prev = 0;  in insertHead()
70             mFirst->prev = newNode;  in insertHead()
79             newNode->prev = mLast;  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()
117         mutable chunk_t*    prev;  member