63         newNode->prev = node;  in insertAfter()
66         else                 node->next->prev = newNode;  in insertAfter()
71          newNode->prev = node->prev;  in insertBefore()
73          if (node->prev == nullptr)   mFirst = newNode;  in insertBefore()
74          else                   node->prev->next = newNode;  in insertBefore()
75          node->prev = newNode;  in insertBefore()
81             newNode->prev = newNode->next = nullptr;  in insertHead()
83             newNode->prev = nullptr;  in insertHead()
85             mFirst->prev = newNode;  in insertHead()
94             newNode->prev = mLast;  in insertTail()
102         if (node->prev == nullptr)    mFirst = node->next;  in remove()
103         else                    node->prev->next = node->next;  in remove()
104         if (node->next == nullptr)    mLast = node->prev;  in remove()
105         else                    node->next->prev = node->prev;  in remove()
144         : start(start), size(size), free(1), prev(nullptr), next(nullptr) {  in chunk_t()
149         mutable chunk_t*    prev;  member
397                 chunk_t* const p = cur->prev;  in dealloc()
461         int np = ((cur->next) && cur->next->prev != cur) ? 1 : 0;  in dump_l()
462         int pn = ((cur->prev) && cur->prev->next != cur) ? 2 : 0;  in dump_l()