197     MemRegion *next,      // keep all regions in any pool to release all them on  member
218                  *next,  member in rml::internal::FreeBlock
401         for (FreeBlock *curr = b->head.load(std::memory_order_relaxed); curr; curr = curr->next) {  in getFromBin()
464             FreeBlock *next = curr->next;  in tryReleaseRegions()  local
470             curr = next;  in tryReleaseRegions()
479     MALLOC_ASSERT(fBlock->next||fBlock->prev||fBlock== head.load(std::memory_order_relaxed),  in removeBlock()
482         head.store(fBlock->next, std::memory_order_relaxed);  in removeBlock()
486         fBlock->prev->next = fBlock->next;  in removeBlock()
487     if (fBlock->next)  in removeBlock()
488         fBlock->next->prev = fBlock->prev;  in removeBlock()
495     fBlock->next = fBlock->prev = nullptr;  in addBlock()
502                 fBlock->prev->next = fBlock;  in addBlock()
506             fBlock->next = b->head.load(std::memory_order_relaxed);  in addBlock()
508             if (fBlock->next)  in addBlock()
509                 fBlock->next->prev = fBlock;  in addBlock()
523         fBlock->next = nullptr;  in tryAddBlock()
531                 fBlock->prev->next = fBlock;  in tryAddBlock()
541             fBlock->next = b->head.load(std::memory_order_relaxed);  in tryAddBlock()
543             if (fBlock->next)  in tryAddBlock()
544                 fBlock->next->prev = fBlock;  in tryAddBlock()
1173             toRet->prev = toRet->next = toRet->nextToFree = nullptr;  in coalescAndPutList()
1301     r->next = head;  in add()
1303     if (head->next)  in add()
1304         head->next->prev = head;  in add()
1311         head = head->next;  in remove()
1312     if (r->next)  in remove()
1313         r->next->prev = r->prev;  in remove()
1315         r->prev->next = r->next;  in remove()
1323     for (MemRegion *curr = head; curr; curr = curr->next) {  in reportStat()
1386     for (MemRegion *curr = regionList.head; curr; curr = curr->next) {  in reset()
1403         MemRegion *helper = regionList.head->next;  in destroy()
1435         for (FreeBlock *fb = freeBins[i].head.load(std::memory_order_relaxed); fb; fb=fb->next) {  in verify()
1466         for (FreeBlock *fb = head; fb; fb = fb->next)  in countFreeBlocks()
1476     for (FreeBlock *fb = head; fb; fb = fb->next) {  in reportFreeBlocks()