| 138 | #endif |
| 139 | |
| 140 | static mi_page_queue_t* mi_page_queue_of(const mi_page_t* page) { |
| 141 | uint8_t bin = (mi_page_is_in_full(page) ? MI_BIN_FULL : mi_bin(page->xblock_size)); |
| 142 | mi_heap_t* heap = mi_page_heap(page); |
| 143 | mi_assert_internal(heap != NULL && bin <= MI_BIN_FULL); |
| 144 | mi_page_queue_t* pq = &heap->pages[bin]; |
| 145 | mi_assert_internal(bin >= MI_BIN_HUGE || page->xblock_size == pq->block_size); |
| 146 | mi_assert_expensive(mi_page_queue_contains(pq, page)); |
| 147 | return pq; |
| 148 | } |
| 149 | |
| 150 | static mi_page_queue_t* mi_heap_page_queue_of(mi_heap_t* heap, const mi_page_t* page) { |
| 151 | uint8_t bin = (mi_page_is_in_full(page) ? MI_BIN_FULL : mi_bin(page->xblock_size)); |
no test coverage detected