BsMeshHeap.cpp 19 KB

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