7template <
typename Object>
11 if (mPages !=
nullptr)
14 JPH_ASSERT(mNumFreeObjects.load(memory_order_relaxed) == mNumPages * mPageSize);
17 uint32 num_pages = mNumObjectsAllocated.load(memory_order_relaxed) / mPageSize;
18 for (
uint32 page = 0; page < num_pages; ++page)
24template <
typename Object>
32 mNumPages = (inMaxObjects + inPageSize - 1) / inPageSize;
33 mPageSize = inPageSize;
35 mObjectMask = inPageSize - 1;
39 mPages =
reinterpret_cast<ObjectStorage **
>(
Allocate(mNumPages *
sizeof(ObjectStorage *)));
42 mNumObjectsAllocated.store(0, memory_order_relaxed);
43 mFirstFreeObjectInNewPage = 0;
52template <
typename Object>
53template <
typename... Parameters>
59 uint64 first_free_object_and_tag = mFirstFreeObjectAndTag.load(memory_order_acquire);
64 first_free = mFirstFreeObjectInNewPage.fetch_add(1, memory_order_relaxed);
65 if (first_free >= mNumObjectsAllocated.load(memory_order_acquire))
68 lock_guard lock(mPageMutex);
69 uint32 num_objects_allocated = mNumObjectsAllocated.load(memory_order_relaxed);
70 while (first_free >= num_objects_allocated)
72 uint32 next_page = num_objects_allocated / mPageSize;
73 if (next_page == mNumPages)
76 num_objects_allocated += mPageSize;
77 mNumObjectsAllocated.store(num_objects_allocated, memory_order_release);
83 ObjectStorage &storage = GetStorage(first_free);
84 new (&storage.mObject)
Object(std::forward<Parameters>(inParameters)...);
85 storage.mNextFreeObject.store(first_free, memory_order_release);
91 uint32 new_first_free = GetStorage(first_free).mNextFreeObject.load(memory_order_acquire);
94 uint64 new_first_free_object_and_tag =
uint64(new_first_free) + (
uint64(mAllocationTag.fetch_add(1, memory_order_relaxed)) << 32);
97 if (mFirstFreeObjectAndTag.compare_exchange_weak(first_free_object_and_tag, new_first_free_object_and_tag, memory_order_release))
101 ObjectStorage &storage = GetStorage(first_free);
102 new (&storage.mObject)
Object(std::forward<Parameters>(inParameters)...);
103 storage.mNextFreeObject.store(first_free, memory_order_release);
110template <
typename Object>
116 atomic<uint32> &next_free_object = GetStorage(inObjectIndex).mNextFreeObject;
117 JPH_ASSERT(next_free_object.load(memory_order_relaxed) == inObjectIndex,
"Trying to add a object to the batch that is already in a free list");
124 GetStorage(ioBatch.
mLastObjectIndex).mNextFreeObject.store(inObjectIndex, memory_order_release);
129template <
typename Object>
135 if constexpr (!std::is_trivially_destructible<Object>())
140 ObjectStorage &storage = GetStorage(object_idx);
141 storage.mObject.~Object();
142 object_idx = storage.mNextFreeObject.load(memory_order_relaxed);
152 uint64 first_free_object_and_tag = mFirstFreeObjectAndTag.load(memory_order_acquire);
156 storage.mNextFreeObject.store(first_free, memory_order_release);
162 if (mFirstFreeObjectAndTag.compare_exchange_weak(first_free_object_and_tag, new_first_free_object_and_tag, memory_order_release))
168#ifdef JPH_ENABLE_ASSERTS
177template <
typename Object>
183 ObjectStorage &storage = GetStorage(inObjectIndex);
184 storage.mObject.~Object();
190 uint64 first_free_object_and_tag = mFirstFreeObjectAndTag.load(memory_order_acquire);
194 storage.mNextFreeObject.store(first_free, memory_order_release);
197 uint64 new_first_free_object_and_tag =
uint64(inObjectIndex) + (
uint64(mAllocationTag.fetch_add(1, memory_order_relaxed)) << 32);
200 if (mFirstFreeObjectAndTag.compare_exchange_weak(first_free_object_and_tag, new_first_free_object_and_tag, memory_order_release))
209template<
typename Object>
212 return reinterpret_cast<const ObjectStorage *
>(inObject)->mNextFreeObject.load(memory_order_relaxed);
215template<
typename Object>
219 JPH_ASSERT(index < mNumObjectsAllocated.load(memory_order_relaxed));
#define JPH_CACHE_LINE_SIZE
Definition Core.h:613
std::uint64_t uint64
Definition Core.h:569
unsigned int uint
Definition Core.h:564
#define JPH_NAMESPACE_END
Definition Core.h:487
std::uint32_t uint32
Definition Core.h:567
#define JPH_NAMESPACE_BEGIN
Definition Core.h:481
#define JPH_IF_ENABLE_ASSERTS(...)
Definition IssueReporting.h:30
#define JPH_ASSERT(...)
Definition IssueReporting.h:28
constexpr bool IsPowerOf2(T inV)
Check if inV is a power of 2.
Definition Math.h:161
uint CountTrailingZeros(uint32 inValue)
Compute number of trailing zero bits (how many low bits are zero).
Definition Math.h:183
AllocateFunction Allocate
Definition Memory.cpp:68
FreeFunction Free
Definition Memory.cpp:70
AlignedFreeFunction AlignedFree
Definition Memory.cpp:72
AlignedAllocateFunction AlignedAllocate
Definition Memory.cpp:71
@ Object
Start of a new object.
Definition SerializableAttribute.h:20
void Init(uint inMaxObjects, uint inPageSize)
Initialize the free list, up to inMaxObjects can be allocated.
Definition FixedSizeFreeList.inl:25
void DestructObjectBatch(Batch &ioBatch)
Lockless destruct batch of objects.
Definition FixedSizeFreeList.inl:130
uint32 GetObjectIndex(const Object *inObject) const
Get the index of an object that was created by this free list.
Definition FixedSizeFreeList.inl:210
uint32 ConstructObject(Parameters &&... inParameters)
Lockless construct a new object, inParameters are passed on to the constructor.
Definition FixedSizeFreeList.inl:54
~FixedSizeFreeList()
Destructor.
Definition FixedSizeFreeList.inl:8
void DestructObject(uint32 inObjectIndex)
Lockless destruct an object and return it to the free pool.
Definition FixedSizeFreeList.inl:178
static const uint32 cInvalidObjectIndex
Invalid index.
Definition FixedSizeFreeList.h:77
void AddObjectToBatch(Batch &ioBatch, uint32 inObjectIndex)
Definition FixedSizeFreeList.inl:111
A batch of objects that can be destructed.
Definition FixedSizeFreeList.h:100
uint32 mFirstObjectIndex
Definition FixedSizeFreeList.h:101
uint32 mNumObjects
Definition FixedSizeFreeList.h:103
uint32 mLastObjectIndex
Definition FixedSizeFreeList.h:102