BsMeshHeap.cpp 18 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670
  1. #include "BsMeshHeap.h"
  2. #include "BsCoreThread.h"
  3. #include "BsTransientMesh.h"
  4. #include "BsHardwareBufferManager.h"
  5. #include "BsVertexDataDesc.h"
  6. #include "BsVertexData.h"
  7. #include "BsMeshData.h"
  8. #include "BsMath.h"
  9. #include "BsEventQuery.h"
  10. namespace BansheeEngine
  11. {
  12. const float MeshHeap::GrowPercent = 1.5f;
  13. MeshHeap::MeshHeap(UINT32 numVertices, UINT32 numIndices,
  14. const VertexDataDescPtr& vertexDesc, IndexBuffer::IndexType indexType)
  15. :mNumVertices(numVertices), mNumIndices(numIndices), mNextFreeId(0),
  16. mIndexType(indexType), mVertexDesc(vertexDesc), mCPUIndexData(nullptr),
  17. mNextQueryId(0)
  18. {
  19. for(UINT32 i = 0; i <= mVertexDesc->getMaxStreamIdx(); i++)
  20. {
  21. mCPUVertexData.push_back(nullptr);
  22. }
  23. }
  24. MeshHeap::~MeshHeap()
  25. {
  26. }
  27. MeshHeapPtr MeshHeap::create(UINT32 numVertices, UINT32 numIndices,
  28. const VertexDataDescPtr& vertexDesc, IndexBuffer::IndexType indexType)
  29. {
  30. MeshHeap* meshHeap = new (bs_alloc<MeshHeap>()) MeshHeap(numVertices, numIndices, vertexDesc, indexType);
  31. MeshHeapPtr meshHeapPtr = bs_core_ptr<MeshHeap, GenAlloc>(meshHeap);
  32. meshHeapPtr->_setThisPtr(meshHeapPtr);
  33. meshHeapPtr->initialize();
  34. return meshHeapPtr;
  35. }
  36. void MeshHeap::initialize_internal()
  37. {
  38. THROW_IF_NOT_CORE_THREAD;
  39. growVertexBuffer(mNumVertices);
  40. growIndexBuffer(mNumIndices);
  41. CoreObject::initialize_internal();
  42. }
  43. void MeshHeap::destroy_internal()
  44. {
  45. THROW_IF_NOT_CORE_THREAD;
  46. for(auto& cpuVertBuffer : mCPUVertexData)
  47. bs_free(cpuVertBuffer);
  48. if(mCPUIndexData != nullptr)
  49. bs_free(mCPUIndexData);
  50. CoreObject::destroy_internal();
  51. }
  52. TransientMeshPtr MeshHeap::alloc(const MeshDataPtr& meshData, DrawOperationType drawOp)
  53. {
  54. UINT32 meshIdx = mNextFreeId++;
  55. MeshHeapPtr thisPtr = std::static_pointer_cast<MeshHeap>(getThisPtr());
  56. TransientMesh* transientMesh = new (bs_alloc<TransientMesh>()) TransientMesh(thisPtr, meshIdx, meshData->getNumVertices(), meshData->getNumIndices(), drawOp);
  57. TransientMeshPtr transientMeshPtr = bs_core_ptr<TransientMesh, GenAlloc>(transientMesh);
  58. transientMeshPtr->_setThisPtr(transientMeshPtr);
  59. transientMeshPtr->initialize();
  60. mMeshes[meshIdx] = transientMeshPtr;
  61. queueGpuCommand(getThisPtr(), std::bind(&MeshHeap::allocInternal, this, transientMeshPtr, meshData));
  62. return transientMeshPtr;
  63. }
  64. void MeshHeap::dealloc(const TransientMeshPtr& mesh)
  65. {
  66. auto iterFind = mMeshes.find(mesh->mId);
  67. if(iterFind == mMeshes.end())
  68. return;
  69. mesh->markAsDestroyed();
  70. mMeshes.erase(iterFind);
  71. queueGpuCommand(getThisPtr(), std::bind(&MeshHeap::deallocInternal, this, mesh));
  72. }
  73. void MeshHeap::allocInternal(TransientMeshPtr mesh, const MeshDataPtr& meshData)
  74. {
  75. // Find free vertex chunk and grow if needed
  76. UINT32 smallestVertFit = 0;
  77. UINT32 smallestVertFitIdx = 0;
  78. while(smallestVertFit == 0)
  79. {
  80. UINT32 curIdx = 0;
  81. for(auto& chunkIdx : mFreeVertChunks)
  82. {
  83. ChunkData& chunk = mVertChunks[chunkIdx];
  84. if(chunk.size >= meshData->getNumVertices() && (chunk.size < smallestVertFit || smallestVertFit == 0))
  85. {
  86. smallestVertFit = chunk.size;
  87. smallestVertFitIdx = curIdx;
  88. }
  89. curIdx++;
  90. }
  91. if(smallestVertFit > 0)
  92. break;
  93. UINT32 newNumVertices = mNumVertices;
  94. while(newNumVertices < (mNumVertices + meshData->getNumVertices()))
  95. {
  96. newNumVertices = Math::roundToInt(newNumVertices * GrowPercent);
  97. }
  98. growVertexBuffer(newNumVertices);
  99. }
  100. // Find free index chunk and grow if needed
  101. UINT32 smallestIdxFit = 0;
  102. UINT32 smallestIdxFitIdx = 0;
  103. while(smallestIdxFit == 0)
  104. {
  105. UINT32 curIdx = 0;
  106. for(auto& chunkIdx : mFreeIdxChunks)
  107. {
  108. ChunkData& chunk = mIdxChunks[chunkIdx];
  109. if(chunk.size >= meshData->getNumIndices() && (chunk.size < smallestIdxFit || smallestIdxFit == 0))
  110. {
  111. smallestIdxFit = chunk.size;
  112. smallestIdxFitIdx = curIdx;
  113. }
  114. curIdx++;
  115. }
  116. if(smallestIdxFit > 0)
  117. break;
  118. UINT32 newNumIndices = mNumIndices;
  119. while(newNumIndices < (mNumIndices + meshData->getNumIndices()))
  120. {
  121. newNumIndices = Math::roundToInt(newNumIndices * GrowPercent);
  122. }
  123. growIndexBuffer(newNumIndices);
  124. }
  125. UINT32 freeVertChunkIdx = 0;
  126. UINT32 freeIdxChunkIdx = 0;
  127. auto freeVertIter = mFreeVertChunks.begin();
  128. freeVertChunkIdx = (*freeVertIter);
  129. for(UINT32 i = 0; i < smallestVertFitIdx; i++)
  130. {
  131. freeVertIter++;
  132. freeVertChunkIdx = (*freeVertIter);
  133. }
  134. mFreeVertChunks.erase(freeVertIter);
  135. auto freeIdxIter = mFreeIdxChunks.begin();
  136. freeIdxChunkIdx = (*freeIdxIter);
  137. for(UINT32 i = 0; i < smallestIdxFitIdx; i++)
  138. {
  139. freeIdxIter++;
  140. freeIdxChunkIdx = (*freeIdxIter);
  141. }
  142. mFreeIdxChunks.erase(freeIdxIter);
  143. ChunkData& vertChunk = mVertChunks[freeVertChunkIdx];
  144. ChunkData& idxChunk = mIdxChunks[freeIdxChunkIdx];
  145. UINT32 vertChunkStart = vertChunk.start;
  146. UINT32 idxChunkStart = idxChunk.start;
  147. UINT32 remainingNumVerts = vertChunk.size - meshData->getNumVertices();
  148. UINT32 remainingNumIdx = idxChunk.size - meshData->getNumIndices();
  149. vertChunk.size = meshData->getNumVertices();
  150. idxChunk.size = meshData->getNumIndices();
  151. if(remainingNumVerts > 0)
  152. {
  153. if(!mEmptyVertChunks.empty())
  154. {
  155. UINT32 emptyChunkIdx = mEmptyVertChunks.top();
  156. ChunkData& emptyChunk = mVertChunks[emptyChunkIdx];
  157. mEmptyVertChunks.pop();
  158. emptyChunk.start = vertChunkStart + meshData->getNumVertices();
  159. emptyChunk.size = remainingNumVerts;
  160. }
  161. else
  162. {
  163. ChunkData newChunk;
  164. newChunk.size = remainingNumVerts;
  165. newChunk.start = vertChunkStart + meshData->getNumVertices();
  166. mVertChunks.push_back(newChunk);
  167. mFreeVertChunks.push_back((UINT32)(mVertChunks.size() - 1));
  168. }
  169. }
  170. if(remainingNumIdx > 0)
  171. {
  172. if(!mEmptyIdxChunks.empty())
  173. {
  174. UINT32 emptyChunkIdx = mEmptyIdxChunks.top();
  175. ChunkData& emptyChunk = mIdxChunks[emptyChunkIdx];
  176. mEmptyIdxChunks.pop();
  177. emptyChunk.start = idxChunkStart + meshData->getNumIndices();
  178. emptyChunk.size = remainingNumIdx;
  179. }
  180. else
  181. {
  182. ChunkData newChunk;
  183. newChunk.size = remainingNumIdx;
  184. newChunk.start = idxChunkStart + meshData->getNumIndices();
  185. mIdxChunks.push_back(newChunk);
  186. mFreeIdxChunks.push_back((UINT32)(mIdxChunks.size() - 1));
  187. }
  188. }
  189. AllocatedData newAllocData;
  190. newAllocData.vertChunkIdx = freeVertChunkIdx;
  191. newAllocData.idxChunkIdx = freeIdxChunkIdx;
  192. newAllocData.useFlags = UseFlags::GPUFree;
  193. newAllocData.eventQueryIdx = createEventQuery();
  194. newAllocData.mesh = mesh;
  195. mMeshAllocData[mesh->getMeshHeapId()] = newAllocData;
  196. // Actually copy data
  197. for(UINT32 i = 0; i <= mVertexDesc->getMaxStreamIdx(); i++)
  198. {
  199. if(!mVertexDesc->hasStream(i))
  200. continue;
  201. if(!meshData->getVertexDesc()->hasStream(i))
  202. continue;
  203. // Ensure vertex sizes match
  204. UINT32 vertSize = mVertexData->vertexDeclaration->getVertexSize(i);
  205. UINT32 otherVertSize = meshData->getVertexDesc()->getVertexStride(i);
  206. if(otherVertSize != vertSize)
  207. {
  208. BS_EXCEPT(InvalidParametersException, "Provided vertex size for stream " + toString(i) + " doesn't match meshes vertex size. Needed: " +
  209. toString(vertSize) + ". Got: " + toString(otherVertSize));
  210. }
  211. VertexBufferPtr vertexBuffer = mVertexData->getBuffer(i);
  212. UINT8* vertDest = mCPUVertexData[i] + vertChunkStart * vertSize;
  213. memcpy(vertDest, meshData->getStreamData(i), meshData->getNumVertices() * vertSize);
  214. if(vertexBuffer->vertexColorReqRGBFlip())
  215. {
  216. UINT32 vertexStride = mVertexDesc->getVertexStride(i);
  217. for(INT32 semanticIdx = 0; semanticIdx < VertexBuffer::MAX_SEMANTIC_IDX; semanticIdx++)
  218. {
  219. if(!mVertexDesc->hasElement(VES_COLOR, semanticIdx, i))
  220. continue;
  221. UINT8* colorData = vertDest + mVertexDesc->getElementOffsetFromStream(VES_COLOR, semanticIdx, i);
  222. for(UINT32 j = 0; j < mVertexData->vertexCount; j++)
  223. {
  224. UINT32* curColor = (UINT32*)colorData;
  225. (*curColor) = ((*curColor) & 0xFF00FF00) | ((*curColor >> 16) & 0x000000FF) | ((*curColor << 16) & 0x00FF0000);
  226. colorData += vertexStride;
  227. }
  228. }
  229. }
  230. vertexBuffer->writeData(vertChunkStart * vertSize, meshData->getNumVertices() * vertSize, vertDest, BufferWriteType::NoOverwrite);
  231. }
  232. UINT32 idxSize = mIndexBuffer->getIndexSize();
  233. // Ensure index sizes match
  234. if(meshData->getIndexElementSize() != idxSize)
  235. {
  236. BS_EXCEPT(InvalidParametersException, "Provided index size doesn't match meshes index size. Needed: " +
  237. toString(idxSize) + ". Got: " + toString(meshData->getIndexElementSize()));
  238. }
  239. UINT8* idxDest = mCPUIndexData + idxChunkStart * idxSize;
  240. memcpy(idxDest, meshData->getIndexData(), meshData->getNumIndices() * idxSize);
  241. mIndexBuffer->writeData(idxChunkStart * idxSize, meshData->getNumIndices() * idxSize, idxDest, BufferWriteType::NoOverwrite);
  242. }
  243. void MeshHeap::deallocInternal(TransientMeshPtr mesh)
  244. {
  245. auto findIter = mMeshAllocData.find(mesh->getMeshHeapId());
  246. assert(findIter != mMeshAllocData.end());
  247. AllocatedData& allocData = findIter->second;
  248. if(allocData.useFlags == UseFlags::GPUFree)
  249. {
  250. allocData.useFlags = UseFlags::Free;
  251. freeEventQuery(allocData.eventQueryIdx);
  252. mFreeVertChunks.push_back(allocData.vertChunkIdx);
  253. mFreeIdxChunks.push_back(allocData.idxChunkIdx);
  254. mergeWithNearbyChunks(allocData.vertChunkIdx, allocData.idxChunkIdx);
  255. mMeshAllocData.erase(findIter);
  256. }
  257. else if(allocData.useFlags == UseFlags::Used)
  258. allocData.useFlags = UseFlags::CPUFree;
  259. }
  260. void MeshHeap::growVertexBuffer(UINT32 numVertices)
  261. {
  262. mNumVertices = numVertices;
  263. mVertexData = std::shared_ptr<VertexData>(bs_new<VertexData, PoolAlloc>());
  264. mVertexData->vertexCount = mNumVertices;
  265. mVertexData->vertexDeclaration = mVertexDesc->createDeclaration();
  266. // Create buffers and copy data
  267. for(UINT32 i = 0; i <= mVertexDesc->getMaxStreamIdx(); i++)
  268. {
  269. if(!mVertexDesc->hasStream(i))
  270. continue;
  271. UINT32 vertSize = mVertexData->vertexDeclaration->getVertexSize(i);
  272. VertexBufferPtr vertexBuffer = HardwareBufferManager::instance().createVertexBuffer(
  273. vertSize, mVertexData->vertexCount, GBU_DYNAMIC);
  274. mVertexData->setBuffer(i, vertexBuffer);
  275. // Copy all data to the new buffer
  276. UINT8* oldBuffer = mCPUVertexData[i];
  277. UINT8* buffer = (UINT8*)bs_alloc(vertSize * numVertices);
  278. UINT32 destOffset = 0;
  279. if(oldBuffer != nullptr)
  280. {
  281. for(auto& allocData : mMeshAllocData)
  282. {
  283. ChunkData& oldChunk = mVertChunks[allocData.second.vertChunkIdx];
  284. UINT8* oldData = oldBuffer + oldChunk.start * vertSize;
  285. memcpy(buffer + destOffset * vertSize, oldData, oldChunk.size * vertSize);
  286. destOffset += oldChunk.size;
  287. }
  288. bs_free(oldBuffer);
  289. }
  290. if(destOffset > 0)
  291. vertexBuffer->writeData(0, destOffset * vertSize, buffer, BufferWriteType::NoOverwrite);
  292. mCPUVertexData[i] = buffer;
  293. }
  294. // Reorder chunks
  295. UINT32 destOffset = 0;
  296. Vector<ChunkData> newVertChunks;
  297. List<UINT32> freeVertChunks;
  298. for(auto& allocData : mMeshAllocData)
  299. {
  300. ChunkData& oldChunk = mVertChunks[allocData.second.vertChunkIdx];
  301. ChunkData newChunk;
  302. newChunk.start = destOffset;
  303. newChunk.size = oldChunk.size;
  304. allocData.second.vertChunkIdx = (UINT32)newVertChunks.size();
  305. newVertChunks.push_back(newChunk);
  306. destOffset += oldChunk.size;
  307. }
  308. // Add free chunk
  309. if(destOffset != mNumVertices)
  310. {
  311. ChunkData newChunk;
  312. newChunk.start = destOffset;
  313. newChunk.size = mNumVertices - destOffset;
  314. newVertChunks.push_back(newChunk);
  315. freeVertChunks.push_back((UINT32)(newVertChunks.size() - 1));
  316. }
  317. mVertChunks = newVertChunks;
  318. mFreeVertChunks = freeVertChunks;
  319. while(!mEmptyVertChunks.empty())
  320. mEmptyVertChunks.pop();
  321. }
  322. void MeshHeap::growIndexBuffer(UINT32 numIndices)
  323. {
  324. mNumIndices = numIndices;
  325. mIndexBuffer = HardwareBufferManager::instance().createIndexBuffer(mIndexType, mNumIndices, GBU_DYNAMIC);
  326. // Copy all data to the new buffer
  327. UINT32 idxSize = mIndexBuffer->getIndexSize();
  328. UINT8* oldBuffer = mCPUIndexData;
  329. UINT8* buffer = (UINT8*)bs_alloc(idxSize * numIndices);
  330. UINT32 destOffset = 0;
  331. if(oldBuffer != nullptr)
  332. {
  333. for(auto& allocData : mMeshAllocData)
  334. {
  335. ChunkData& oldChunk = mIdxChunks[allocData.second.idxChunkIdx];
  336. UINT8* oldData = oldBuffer + oldChunk.start * idxSize;
  337. memcpy(buffer + destOffset * idxSize, oldData, oldChunk.size * idxSize);
  338. destOffset += oldChunk.size;
  339. }
  340. bs_free(oldBuffer);
  341. }
  342. if(destOffset > 0)
  343. mIndexBuffer->writeData(0, destOffset * idxSize, buffer, BufferWriteType::NoOverwrite);
  344. mCPUIndexData = buffer;
  345. // Reorder chunks
  346. destOffset = 0;
  347. Vector<ChunkData> newIdxChunks;
  348. List<UINT32> freeIdxChunks;
  349. for(auto& allocData : mMeshAllocData)
  350. {
  351. ChunkData& oldChunk = mIdxChunks[allocData.second.idxChunkIdx];
  352. ChunkData newChunk;
  353. newChunk.start = destOffset;
  354. newChunk.size = oldChunk.size;
  355. allocData.second.idxChunkIdx = (UINT32)newIdxChunks.size();
  356. newIdxChunks.push_back(newChunk);
  357. destOffset += oldChunk.size;
  358. }
  359. // Add free chunk
  360. if(destOffset != mNumIndices)
  361. {
  362. ChunkData newChunk;
  363. newChunk.start = destOffset;
  364. newChunk.size = mNumIndices - destOffset;
  365. newIdxChunks.push_back(newChunk);
  366. freeIdxChunks.push_back((UINT32)(newIdxChunks.size() - 1));
  367. }
  368. mIdxChunks = newIdxChunks;
  369. mFreeIdxChunks = freeIdxChunks;
  370. while(!mEmptyIdxChunks.empty())
  371. mEmptyIdxChunks.pop();
  372. }
  373. UINT32 MeshHeap::createEventQuery()
  374. {
  375. UINT32 idx = 0;
  376. if(mFreeEventQueries.size() > 0)
  377. {
  378. idx = mFreeEventQueries.top();
  379. mFreeEventQueries.pop();
  380. }
  381. else
  382. {
  383. QueryData newQuery;
  384. newQuery.query = EventQuery::create();
  385. newQuery.queryId = 0;
  386. mEventQueries.push_back(newQuery);
  387. idx = (UINT32)(mEventQueries.size() - 1);
  388. }
  389. return idx;
  390. }
  391. void MeshHeap::freeEventQuery(UINT32 idx)
  392. {
  393. mEventQueries[idx].query->onTriggered.clear();
  394. mEventQueries[idx].queryId = 0;
  395. mFreeEventQueries.push(idx);
  396. }
  397. std::shared_ptr<VertexData> MeshHeap::_getVertexData() const
  398. {
  399. return mVertexData;
  400. }
  401. IndexBufferPtr MeshHeap::_getIndexBuffer() const
  402. {
  403. return mIndexBuffer;
  404. }
  405. UINT32 MeshHeap::getVertexOffset(UINT32 meshId) const
  406. {
  407. auto findIter = mMeshAllocData.find(meshId);
  408. assert(findIter != mMeshAllocData.end());
  409. UINT32 chunkIdx = findIter->second.vertChunkIdx;
  410. return mVertChunks[chunkIdx].start;
  411. }
  412. UINT32 MeshHeap::getIndexOffset(UINT32 meshId) const
  413. {
  414. auto findIter = mMeshAllocData.find(meshId);
  415. assert(findIter != mMeshAllocData.end());
  416. UINT32 chunkIdx = findIter->second.idxChunkIdx;
  417. return mIdxChunks[chunkIdx].start;
  418. }
  419. void MeshHeap::notifyUsedOnGPU(UINT32 meshId)
  420. {
  421. auto findIter = mMeshAllocData.find(meshId);
  422. assert(findIter != mMeshAllocData.end());
  423. AllocatedData& allocData = findIter->second;
  424. assert(allocData.useFlags != UseFlags::Free);
  425. if(allocData.useFlags == UseFlags::GPUFree)
  426. allocData.useFlags = UseFlags::Used;
  427. MeshHeapPtr thisPtr = std::static_pointer_cast<MeshHeap>(getThisPtr());
  428. QueryData& queryData = mEventQueries[allocData.eventQueryIdx];
  429. queryData.queryId = mNextQueryId++;
  430. queryData.query->onTriggered.clear();
  431. queryData.query->onTriggered.connect(std::bind(&MeshHeap::queryTriggered, thisPtr, meshId, queryData.queryId));
  432. queryData.query->begin();
  433. }
  434. // Note: Need to use a shared ptr here to ensure MeshHeap doesn't get deallocated sometime during this callback
  435. void MeshHeap::queryTriggered(MeshHeapPtr thisPtr, UINT32 meshId, UINT32 queryId)
  436. {
  437. auto findIter = thisPtr->mMeshAllocData.find(meshId);
  438. assert(findIter != thisPtr->mMeshAllocData.end());
  439. AllocatedData& allocData = findIter->second;
  440. // If query ids don't match then it means there either a more recent query or
  441. // the buffer was discarded and we are not interested in query result
  442. QueryData& queryData = thisPtr->mEventQueries[allocData.eventQueryIdx];
  443. if(queryId == queryData.queryId)
  444. {
  445. assert(allocData.useFlags != UseFlags::Free && allocData.useFlags != UseFlags::GPUFree);
  446. if(allocData.useFlags == UseFlags::CPUFree)
  447. {
  448. allocData.useFlags = UseFlags::Free;
  449. thisPtr->freeEventQuery(allocData.eventQueryIdx);
  450. thisPtr->mFreeVertChunks.push_back(allocData.vertChunkIdx);
  451. thisPtr->mFreeIdxChunks.push_back(allocData.idxChunkIdx);
  452. thisPtr->mergeWithNearbyChunks(allocData.vertChunkIdx, allocData.idxChunkIdx);
  453. thisPtr->mMeshAllocData.erase(findIter);
  454. }
  455. else
  456. allocData.useFlags = UseFlags::GPUFree;
  457. }
  458. queryData.query->onTriggered.clear();
  459. }
  460. void MeshHeap::mergeWithNearbyChunks(UINT32 chunkVertIdx, UINT32 chunkIdxIdx)
  461. {
  462. // Merge vertex chunks
  463. ChunkData& vertChunk = mVertChunks[chunkVertIdx];
  464. for(auto& freeChunkIdx : mFreeVertChunks)
  465. {
  466. if(chunkVertIdx == freeChunkIdx)
  467. continue;
  468. ChunkData& curChunk = mVertChunks[freeChunkIdx];
  469. if(curChunk.size == 0) // Already merged
  470. continue;
  471. bool merged = false;
  472. if(curChunk.start == (vertChunk.start + vertChunk.size))
  473. {
  474. vertChunk.size += curChunk.size;
  475. merged = true;
  476. }
  477. else if((curChunk.start + curChunk.size) == vertChunk.start)
  478. {
  479. vertChunk.start = curChunk.start;
  480. vertChunk.size += curChunk.size;
  481. merged = true;
  482. }
  483. if(merged)
  484. {
  485. // We can't remove the chunk since that would break the indexing scheme, so
  486. // mark it as empty and set size to 0. It will be reused when needed.
  487. curChunk.start = 0;
  488. curChunk.size = 0;
  489. mEmptyVertChunks.push(freeChunkIdx);
  490. }
  491. }
  492. // Merge index chunks
  493. ChunkData& idxChunk = mIdxChunks[chunkIdxIdx];
  494. for(auto& freeChunkIdx : mFreeIdxChunks)
  495. {
  496. if(chunkIdxIdx == freeChunkIdx)
  497. continue;
  498. ChunkData& curChunk = mIdxChunks[freeChunkIdx];
  499. if(curChunk.size == 0) // Already merged
  500. continue;
  501. bool merged = false;
  502. if(curChunk.start == (idxChunk.start + idxChunk.size))
  503. {
  504. idxChunk.size += curChunk.size;
  505. merged = true;
  506. }
  507. else if((curChunk.start + curChunk.size) == idxChunk.start)
  508. {
  509. idxChunk.start = curChunk.start;
  510. idxChunk.size += curChunk.size;
  511. merged = true;
  512. }
  513. if(merged)
  514. {
  515. // We can't remove the chunk since that would break the indexing scheme, so
  516. // mark it as empty and set size to 0. It will be reused when needed.
  517. curChunk.start = 0;
  518. curChunk.size = 0;
  519. mEmptyIdxChunks.push(freeChunkIdx);
  520. }
  521. }
  522. }
  523. }