called from `mi_heap_destroy` and `mi_heap_delete` to free the internal heap resources.
| 247 | |
| 248 | // called from `mi_heap_destroy` and `mi_heap_delete` to free the internal heap resources. |
| 249 | static void mi_heap_free(mi_heap_t* heap) { |
| 250 | mi_assert(heap != NULL); |
| 251 | mi_assert_internal(mi_heap_is_initialized(heap)); |
| 252 | if (heap==NULL || !mi_heap_is_initialized(heap)) return; |
| 253 | if (mi_heap_is_backing(heap)) return; // dont free the backing heap |
| 254 | |
| 255 | // reset default |
| 256 | if (mi_heap_is_default(heap)) { |
| 257 | _mi_heap_set_default_direct(heap->tld->heap_backing); |
| 258 | } |
| 259 | |
| 260 | // remove ourselves from the thread local heaps list |
| 261 | // linear search but we expect the number of heaps to be relatively small |
| 262 | mi_heap_t* prev = NULL; |
| 263 | mi_heap_t* curr = heap->tld->heaps; |
| 264 | while (curr != heap && curr != NULL) { |
| 265 | prev = curr; |
| 266 | curr = curr->next; |
| 267 | } |
| 268 | mi_assert_internal(curr == heap); |
| 269 | if (curr == heap) { |
| 270 | if (prev != NULL) { prev->next = heap->next; } |
| 271 | else { heap->tld->heaps = heap->next; } |
| 272 | } |
| 273 | mi_assert_internal(heap->tld->heaps != NULL); |
| 274 | |
| 275 | // and free the used memory |
| 276 | mi_free(heap); |
| 277 | } |
| 278 | |
| 279 | |
| 280 | /* ----------------------------------------------------------- |
no test coverage detected