Method releaseRaw

src/common/classes/alloc.cpp:2602–3102

void MemPool::releaseRaw(bool destroying, void* block, size_t size, ExtentsCache* extentsCache) noexcept
{
#ifndef USE_VALGRIND
	if (extentsCache && (size == DEFAULT_ALLOCATION))
	{
		MutexLockGuard guard(cache_mutex, "MemPool::releaseRaw");
		if (extentsCache->count < MAP_CACHE_SIZE)
		{
			extentsCache->data[extentsCache->count++] = block;
			return;
		}
	}

#define unmapBlockPtr block
#define unmapBlockSize size

#else
	// Set access protection for block to prevent memory from deleted pool being accessed
	VALGRIND_MAKE_MEM_NOACCESS(block, size);

	size = FB_ALIGN(size, get_map_page_size());

	void* unmapBlockPtr = block;
	size_t unmapBlockSize = size;

	// Employ extents delayed free logic only when pool is destroying.
	// In normal case all blocks pass through queue of sufficent length by themselves
	if (destroying)
	{
		// Synchronize delayed free queue using extents mutex
		MutexLockGuard guard(cache_mutex, "MemPool::releaseRaw");

		// Extend circular buffer if possible
		if (delayedExtentCount < FB_NELEM(delayedExtents))
		{
			DelayedExtent* item = &delayedExtents[delayedExtentCount];
			item->memory = block;
			item->size = size;
			delayedExtentCount++;
			return;
		}

		DelayedExtent* item = &delayedExtents[delayedExtentsPos];

		// Set up the block we are going to unmap
		unmapBlockPtr = item->memory;
		unmapBlockSize = item->size;

		// Replace element in circular buffer
		item->memory = block;
		item->size = size;

		// Move queue pointer to next element and cycle if needed
		delayedExtentsPos++;
		if (delayedExtentsPos >= FB_NELEM(delayedExtents))
			delayedExtentsPos = 0;
	}
#endif