Free is disabled (we only bump, never reclaim).

Return the bin for a given field size. Returns MI_BIN_HUGE if the size is too large. We use `wsize` for the size in "machine word sizes", i.e. byte si

Is memory zero initialized?

Process pending deferred cross-thread deallocations

Is `x` a power of two? (0 is considered a power of two)

Get the page containing the pointer (performance critical as it is called in mi_free)

Start of the page available memory; can be used on uninitialized pages

@brief Get the object with the given key from the map.

Return the number of free objects in this superblock.

Initialize top chunk and its size */

Create a bit index.

Visit all pages in a heap; returns `false` if break was called.

Yield the thread remaining timeslice

Map new pages to virtual memory

Set `count` bits at `bitmap_idx` to 0 atomically Returns `true` if all `count` bits were 1 previously.

Is a pointer aligned?

On GCC/CLang we provide a hint that the pointers are word aligned.

-------------------------------------------------------- Initialize options by checking the environment ----------------------------------------------

Consolidate and bin a chunk. Differs from exported versions of free mainly in that the chunk need not be marked as inuse. */

@brief Erase the entry for a given key.

A special routine we call on thread exit to free up some resources.

@brief Find the entry for a given key.

@brief Insert the given object into the map.

Get the bit index in a bitmap field

"bit scan reverse": Return index of the highest bit (or MI_INTPTR_BITS if `x` is zero)

Safe delete a heap without freeing any still allocated blocks in that heap.

The current small page array is for efficiency and for each small size (up to 256) it points directly to the page for that size without having to comp

Thread free access

Return the exact usable size of a block.

Reclaim an abandoned segment; returns NULL if the segment was freed set `right_page_reclaimed` to `true` if it reclaimed a page of the right `block_si