#pragma once
#ifndef MI_BITMAP_CHUNK_H
#define MI_BITMAP_CHUNK_H
#include "bitmap.h"
size_t mi_bfield_popcount(mi_bfield_t x);
mi_bfield_t mi_bfield_clear_least_bit(mi_bfield_t x);
bool mi_bfield_find_least_bit(mi_bfield_t x, size_t* idx);
bool mi_bfield_find_highest_bit(mi_bfield_t x, size_t* idx);
bool mi_bfield_foreach_bit(mi_bfield_t* x, size_t* idx);
mi_bfield_t mi_bfield_mask(size_t bit_count, size_t shiftl);
bool mi_bchunk_set(mi_bchunk_t* chunk, size_t cidx, size_t* already_set);
bool mi_bchunk_setN(mi_bchunk_t* chunk, size_t cidx, size_t n, size_t* already_set);
bool mi_bchunk_clear(mi_bchunk_t* chunk, size_t cidx, bool* all_clear);
bool mi_bchunk_clearN(mi_bchunk_t* chunk, size_t cidx, size_t n, bool* maybe_all_clear);
size_t mi_bchunk_popcountN(mi_bchunk_t* chunk, size_t cidx, size_t n);
bool mi_bchunk_is_xsetN(mi_xset_t set, const mi_bchunk_t* chunk, size_t cidx, size_t n);
bool mi_bchunk_try_clearN(mi_bchunk_t* chunk, size_t cidx, size_t n, bool* maybe_all_clear, bool* did_temp_clear_bits);
bool mi_bchunk_try_find_and_clear(mi_bchunk_t* chunk, size_t* pidx);
bool mi_bchunk_try_find_and_clear_1(mi_bchunk_t* chunk, size_t n, size_t* pidx, bool* did_temp_clear_bits);
bool mi_bchunk_try_find_and_clear_8(mi_bchunk_t* chunk, size_t n, size_t* pidx, bool* did_temp_clear_bits);
mi_decl_noinline bool mi_bchunk_try_find_and_clearNX(mi_bchunk_t* chunk, size_t n, size_t* pidx, bool* did_temp_clear_bits);
mi_decl_noinline bool mi_bchunk_try_find_and_clearNC(mi_bchunk_t* chunk, size_t n, size_t* pidx, bool* did_temp_clear_bits);
void mi_bchunk_clear_once_set(mi_subproc_t* subproc, mi_bchunk_t* chunk, size_t cidx);
bool mi_bchunk_all_are_clear_relaxed(mi_bchunk_t* chunk);
bool mi_bchunk_all_are_set_relaxed(mi_bchunk_t* chunk);
bool mi_bchunk_bsr(mi_bchunk_t* chunk, size_t* pidx);
bool mi_bchunk_bsr_inv(mi_bchunk_t* chunk, size_t* pidx);
size_t mi_bchunk_popcount(mi_bchunk_t* chunk);
void mi_bchunks_unsafe_setN(mi_bchunk_t* chunks, mi_bchunkmap_t* cmap, size_t idx, size_t n);
#define mi_bfield_iterate(bfield,start,cycle,name_idx,SUF) { \
mi_assert_internal(start <= cycle); \
mi_assert_internal(start < MI_BFIELD_BITS); \
mi_assert_internal(cycle <= MI_BFIELD_BITS); \
const mi_bfield_t _cycle_mask##SUF = mi_bfield_mask(cycle - start, start); \
size_t _bcount##SUF = mi_bfield_popcount(bfield); \
mi_bfield_t _b##SUF = bfield & _cycle_mask##SUF; \
while(_bcount##SUF > 0) { \
_bcount##SUF--;\
if (_b##SUF==0) { _b##SUF = bfield & ~_cycle_mask##SUF; } \
\
const bool _found##SUF = mi_bfield_find_least_bit(_b##SUF,&name_idx); \
_b##SUF = mi_bfield_clear_least_bit(_b##SUF); \
mi_assert_internal(_found##SUF); MI_UNUSED(_found##SUF); \
{ \
#define mi_bfield_iterate_end(SUF) \
} \
} \
}
#define mi_bfield_cycle_iterate(bfield,tseq,cycle,name_idx,SUF) { \
const size_t _start##SUF = (uint32_t)(tseq) % (uint32_t)(cycle); \
mi_bfield_iterate(bfield,_start##SUF,cycle,name_idx,SUF)
#define mi_bfield_cycle_iterate_end(SUF) \
mi_bfield_iterate_end(SUF); \
}
#endif