155 lines
4.4 KiB
C++
155 lines
4.4 KiB
C++
// Redistribution and use in source and binary forms, with or without
|
|
// modification, are permitted provided that the following conditions
|
|
// are met:
|
|
// * Redistributions of source code must retain the above copyright
|
|
// notice, this list of conditions and the following disclaimer.
|
|
// * Redistributions in binary form must reproduce the above copyright
|
|
// notice, this list of conditions and the following disclaimer in the
|
|
// documentation and/or other materials provided with the distribution.
|
|
// * Neither the name of NVIDIA CORPORATION nor the names of its
|
|
// contributors may be used to endorse or promote products derived
|
|
// from this software without specific prior written permission.
|
|
//
|
|
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS ''AS IS'' AND ANY
|
|
// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
|
|
// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR
|
|
// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
|
|
// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
|
|
// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
|
|
// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY
|
|
// OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
|
// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
|
// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
//
|
|
// Copyright (c) 2008-2025 NVIDIA Corporation. All rights reserved.
|
|
// Copyright (c) 2004-2008 AGEIA Technologies, Inc. All rights reserved.
|
|
// Copyright (c) 2001-2004 NovodeX AG. All rights reserved.
|
|
|
|
#ifndef CM_FLUSH_POOL_H
|
|
#define CM_FLUSH_POOL_H
|
|
|
|
#include "foundation/PxUserAllocated.h"
|
|
#include "foundation/PxBitUtils.h"
|
|
#include "foundation/PxMutex.h"
|
|
#include "foundation/PxArray.h"
|
|
|
|
/*
|
|
Pool used to allocate variable sized tasks. It's intended to be cleared after a short period (time step).
|
|
*/
|
|
|
|
namespace physx
|
|
{
|
|
namespace Cm
|
|
{
|
|
static const PxU32 sSpareChunkCount = 2;
|
|
|
|
class FlushPool
|
|
{
|
|
PX_NOCOPY(FlushPool)
|
|
public:
|
|
FlushPool(PxU32 chunkSize) : mChunks("FlushPoolChunk"), mChunkIndex(0), mOffset(0), mChunkSize(chunkSize)
|
|
{
|
|
mChunks.pushBack(static_cast<PxU8*>(PX_ALLOC(mChunkSize, "PxU8")));
|
|
}
|
|
|
|
~FlushPool()
|
|
{
|
|
for (PxU32 i = 0; i < mChunks.size(); ++i)
|
|
PX_FREE(mChunks[i]);
|
|
}
|
|
|
|
// alignment must be a power of two
|
|
void* allocate(PxU32 size, PxU32 alignment=16)
|
|
{
|
|
PxMutex::ScopedLock lock(mMutex);
|
|
return allocateNotThreadSafe(size, alignment);
|
|
}
|
|
|
|
// alignment must be a power of two
|
|
void* allocateNotThreadSafe(PxU32 size, PxU32 alignment=16)
|
|
{
|
|
PX_ASSERT(PxIsPowerOfTwo(alignment));
|
|
PX_ASSERT(size <= mChunkSize && !mChunks.empty());
|
|
|
|
// padding for alignment
|
|
size_t unalignedStart = size_t(mChunks[mChunkIndex]+mOffset);
|
|
PxU32 pad = PxU32(((unalignedStart+alignment-1)&~(size_t(alignment)-1)) - unalignedStart);
|
|
|
|
if (mOffset + size + pad > mChunkSize)
|
|
{
|
|
mChunkIndex++;
|
|
mOffset = 0;
|
|
if (mChunkIndex >= mChunks.size())
|
|
mChunks.pushBack(static_cast<PxU8*>(PX_ALLOC(mChunkSize, "PxU8")));
|
|
|
|
// update padding to ensure new alloc is aligned
|
|
unalignedStart = size_t(mChunks[mChunkIndex]);
|
|
pad = PxU32(((unalignedStart+alignment-1)&~(size_t(alignment)-1)) - unalignedStart);
|
|
}
|
|
|
|
void* ptr = mChunks[mChunkIndex] + mOffset + pad;
|
|
PX_ASSERT((size_t(ptr)&(size_t(alignment)-1)) == 0);
|
|
mOffset += size + pad;
|
|
return ptr;
|
|
}
|
|
|
|
void clear(PxU32 spareChunkCount = sSpareChunkCount)
|
|
{
|
|
PxMutex::ScopedLock lock(mMutex);
|
|
|
|
clearNotThreadSafe(spareChunkCount);
|
|
}
|
|
|
|
void clearNotThreadSafe(PxU32 spareChunkCount = sSpareChunkCount)
|
|
{
|
|
//release memory not used previously
|
|
PxU32 targetSize = mChunkIndex+spareChunkCount;
|
|
while (mChunks.size() > targetSize)
|
|
{
|
|
PxU8* ptr = mChunks.popBack();
|
|
PX_FREE(ptr);
|
|
}
|
|
|
|
mChunkIndex = 0;
|
|
mOffset = 0;
|
|
}
|
|
|
|
void resetNotThreadSafe()
|
|
{
|
|
PxU8* firstChunk = mChunks[0];
|
|
|
|
for (PxU32 i = 1; i < mChunks.size(); ++i)
|
|
PX_FREE(mChunks[i]);
|
|
|
|
mChunks.clear();
|
|
mChunks.pushBack(firstChunk);
|
|
mChunkIndex = 0;
|
|
mOffset = 0;
|
|
}
|
|
|
|
void lock()
|
|
{
|
|
mMutex.lock();
|
|
}
|
|
|
|
void unlock()
|
|
{
|
|
mMutex.unlock();
|
|
}
|
|
|
|
private:
|
|
PxMutex mMutex;
|
|
PxArray<PxU8*> mChunks;
|
|
PxU32 mChunkIndex;
|
|
PxU32 mOffset;
|
|
PxU32 mChunkSize;
|
|
};
|
|
|
|
|
|
} // namespace Cm
|
|
|
|
}
|
|
|
|
#endif
|