62     void insertAfter(NODE* node, NODE* newNode) {  in insertAfter()  argument
63         newNode->prev = node;  in insertAfter()
64         newNode->next = node->next;  in insertAfter()
65         if (node->next == 0) mLast = newNode;  in insertAfter()
66         else                 node->next->prev = newNode;  in insertAfter()
67         node->next = newNode;  in insertAfter()
70     void insertBefore(NODE* node, NODE* newNode) {  in insertBefore()  argument
71          newNode->prev = node->prev;  in insertBefore()
72          newNode->next = node;  in insertBefore()
73          if (node->prev == 0)   mFirst = newNode;  in insertBefore()
74          else                   node->prev->next = newNode;  in insertBefore()
75          node->prev = newNode;  in insertBefore()
101     NODE* remove(NODE* node) {  in remove()  argument
102         if (node->prev == 0)    mFirst = node->next;  in remove()
103         else                    node->prev->next = node->next;  in remove()
104         if (node->next == 0)    mLast = node->prev;  in remove()
105         else                    node->next->prev = node->prev;  in remove()
106         return node;  in remove()
277     chunk_t* node = new chunk_t(0, mHeapSize / kMemoryAlign);  in SimpleBestFitAllocator()  local
278     mList.insertHead(node);  in SimpleBestFitAllocator()