Do a recursive directory listing of the directory whose path is specified by \a name.

a<<n, 0 <= n <= 127 */

Marks this block as free.

Copy a file, but only if the destination is out-of-date. Just like shutil.copyfile, but will do nothing if the destination already exists and has

Helper for mi_free_try_collect_mt: free if the page has no more used blocks (this is updated by `_mi_page_free_collect(_partly)`)

Helper for mi_free_try_collect_mt: try if we can reabandon a previously abandoned mostly full page to be mapped

get the arena and slice span

reset or decommit in an arena and update the commit bitmap assumes we own the area (i.e. slices_free is claimed by us) returns if the memory is no lon

Is a pointer contained in the given arena area?

Is a pointer inside any of our arenas?

Allocate a fresh page

Allocate a page containing one block (very large, or with large alignment)

Allocate slices from the arena's -- potentially allocating a fresh arena

allocate slices from the arenas

Track the index of the highest chunk that is accessed.

Try to clear `n` bits at `idx` where `n <= MI_BCHUNK_BITS`.

Go through the bbitmap to find a sequence of `n` bits and clear them atomically where `n > MI_ARENA_MAX_CHUNK_OBJ_SIZE` Since these are very large obj

are all bits in a bitmap chunk set?

Clear `0 < n <= MI_BITFIELD_BITS`. Can cross over a bfield boundary.

Find least 1-bit in a chunk and try to clear it atomically set `*pidx` to the bit index (0 <= *pidx < MI_BCHUNK_BITS) on success. This is used to find

Set a sequence of `n` bits within a chunk. Returns true if all bits transitioned from 0 to 1 (or 1 to 0).

Set a sequence of `n` bits in the bitmap (and can cross chunks). Not atomic so only use if local to a thread.

Check if a bit is set

Check if all bits corresponding to a mask are set/cleared.

Count bits in a mask

Clear a bit once it is set.

Count bits set in a range of `n` bits.

forward declaration