86     chunk_t* cur = mList.head();  in alloc()  local
89     while (cur) {  in alloc()
90         int extra = ( -cur->start & ((pagesize/kMemoryAlign)-1) ) ;  in alloc()
93         if (cur->free && (cur->size >= (size+extra))) {  in alloc()
94             if ((!free_chunk) || (cur->size < free_chunk->size)) {  in alloc()
95                 free_chunk = cur;  in alloc()
97             if (cur->size == size) {  in alloc()
101         cur = cur->next;  in alloc()
134     chunk_t* cur = mList.head();  in dealloc()  local
135     while (cur) {  in dealloc()
136         if (cur->start == start) {  in dealloc()
137             LOG_FATAL_IF(cur->free,  in dealloc()
139                 cur->start*kMemoryAlign, cur->size*kMemoryAlign);  in dealloc()
142             chunk_t* freed = cur;  in dealloc()
143             cur->free = 1;  in dealloc()
145                 chunk_t* const p = cur->prev;  in dealloc()
146                 chunk_t* const n = cur->next;  in dealloc()
147                 if (p && (p->free || !cur->size)) {  in dealloc()
149                     p->size += cur->size;  in dealloc()
150                     mList.remove(cur);  in dealloc()
151                     delete cur;  in dealloc()
153                 cur = n;  in dealloc()
154             } while (cur && cur->free);  in dealloc()
167         cur = cur->next;  in dealloc()