24#define CHUNK_SIZE_DEFAULT (1 << 16)
26#define CHUNK_ELEM_MIN 32
46 return (
static_cast<char *
>((queue)->chunk_first->data)) +
47 ((queue)->elem_size * (queue)->chunk_first_index);
52 return (
static_cast<char *
>((queue)->chunk_last->data)) +
53 ((queue)->elem_size * (queue)->chunk_last_index);
64 BLI_assert((elem_size != 0) && (chunk_size != 0));
66 while (chunk_size <= elem_size_min) [[unlikely]] {
73 return chunk_size / elem_size;
120 chunk->
next =
nullptr;
Read Blender memory allocation and freeing.
#define MEM_SIZE_OVERHEAD
#define CHUNK_SIZE_DEFAULT
void * MEM_new_uninitialized(size_t len, const char *str) ATTR_WARN_UNUSED_RESULT ATTR_ALLOC_SIZE(1) ATTR_NONNULL(2)
BLI_assert(slot->slot_subtype.map==BMO_OP_SLOT_SUBTYPE_MAP_FLT)
void BLI_gsqueue_push(GSQueue *queue, const void *item)
static size_t queue_chunk_elem_max_calc(const size_t elem_size, size_t chunk_size)
void BLI_gsqueue_pop(GSQueue *queue, void *r_item)
void BLI_gsqueue_free(GSQueue *queue)
void * MEM_new_zeroed(size_t len, const char *str) ATTR_WARN_UNUSED_RESULT ATTR_ALLOC_SIZE(1) ATTR_NONNULL(2)
GSQueue * BLI_gsqueue_new(size_t elem_size)
static void * queue_get_last_elem(GSQueue *queue)
BMesh const char void * data
static void queue_free_chunk(QueueChunk *data)
size_t BLI_gsqueue_len(const GSQueue *queue)
bool BLI_gsqueue_is_empty(const GSQueue *queue)
static void * queue_get_first_elem(GSQueue *queue)