InstancedModel.cpp 38 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069
  1. //
  2. // Urho3D Engine
  3. // Copyright (c) 2008-2011 Lasse Öörni
  4. //
  5. // Permission is hereby granted, free of charge, to any person obtaining a copy
  6. // of this software and associated documentation files (the "Software"), to deal
  7. // in the Software without restriction, including without limitation the rights
  8. // to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
  9. // copies of the Software, and to permit persons to whom the Software is
  10. // furnished to do so, subject to the following conditions:
  11. //
  12. // The above copyright notice and this permission notice shall be included in
  13. // all copies or substantial portions of the Software.
  14. //
  15. // THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
  16. // IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
  17. // FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
  18. // AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
  19. // LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
  20. // OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
  21. // THE SOFTWARE.
  22. //
  23. #include "Precompiled.h"
  24. #include "Camera.h"
  25. #include "Geometry.h"
  26. #include "IndexBuffer.h"
  27. #include "InstancedModel.h"
  28. #include "Log.h"
  29. #include "Material.h"
  30. #include "Model.h"
  31. #include "OcclusionBuffer.h"
  32. #include "OctreeQuery.h"
  33. #include "Profiler.h"
  34. #include "Renderer.h"
  35. #include "ReplicationUtils.h"
  36. #include "ResourceCache.h"
  37. #include "VertexBuffer.h"
  38. #include "XMLElement.h"
  39. #include <cstring>
  40. #include "DebugNew.h"
  41. InstancingMode InstancedModel::sMode = SHADER_INSTANCING;
  42. std::map<const VertexBuffer*, SharedPtr<VertexBuffer> > InstancedModel::sInstanceVertexBuffers;
  43. std::map<std::pair<const IndexBuffer*, unsigned>, SharedPtr<IndexBuffer> > InstancedModel::sInstanceIndexBuffers;
  44. InstancedModel::InstancedModel(Octant* octant, const std::string& name) :
  45. GeometryNode(NODE_INSTANCEDMODEL, octant, name),
  46. mMode(sMode),
  47. mAverageInstanceScale(1.0f),
  48. mInstancesRelative(true),
  49. mInstancesDirty(true),
  50. mInstanceTransformsDirty(true),
  51. mHWInstancingBufferDirty(true)
  52. {
  53. }
  54. InstancedModel::~InstancedModel()
  55. {
  56. mGeometries.clear();
  57. cleanupInstanceBuffers();
  58. }
  59. void InstancedModel::save(Serializer& dest)
  60. {
  61. // Write GeometryNode properties
  62. GeometryNode::save(dest);
  63. // Write InstanceModel properties
  64. dest.writeStringHash(getResourceHash(mModel));
  65. dest.writeVLE(mOriginalMaterials.size());
  66. for (unsigned i = 0; i < mOriginalMaterials.size(); ++i)
  67. dest.writeStringHash(getResourceHash(mOriginalMaterials[i]));
  68. dest.writeBool(mInstancesRelative);
  69. dest.writeVLE(mInstances.size());
  70. for (unsigned i = 0; i < mInstances.size(); ++i)
  71. {
  72. dest.writeVector3(mInstances[i].mPosition);
  73. dest.writeQuaternion(mInstances[i].mRotation);
  74. dest.writeVector3(mInstances[i].mScale);
  75. }
  76. }
  77. void InstancedModel::load(Deserializer& source, ResourceCache* cache)
  78. {
  79. // Read GeometryNode properties
  80. GeometryNode::load(source, cache);
  81. // Read InstancedModel properties
  82. setModel(cache->getResource<Model>(source.readStringHash()));
  83. unsigned numMaterials = source.readVLE();
  84. for (unsigned i = 0; i < numMaterials; ++i)
  85. setMaterial(i, cache->getResource<Material>(source.readStringHash()));
  86. mInstancesRelative = source.readBool();
  87. setNumInstances(source.readVLE());
  88. for (unsigned i = 0; i < mInstances.size(); ++i)
  89. {
  90. mInstances[i].mPosition = source.readVector3();
  91. mInstances[i].mRotation = source.readQuaternion();
  92. mInstances[i].mScale = source.readVector3();
  93. }
  94. }
  95. void InstancedModel::saveXML(XMLElement& dest)
  96. {
  97. // Write GeometryNode properties
  98. GeometryNode::saveXML(dest);
  99. // Write InstancedModel properties
  100. XMLElement modelElem = dest.createChildElement("model");
  101. modelElem.setString("name", getResourceName(mModel));
  102. for (unsigned i = 0; i < mOriginalMaterials.size(); ++i)
  103. {
  104. XMLElement materialElem = dest.createChildElement("material");
  105. materialElem.setInt("index", i);
  106. materialElem.setString("name", getResourceName(mOriginalMaterials[i]));
  107. }
  108. XMLElement instancesElem = dest.createChildElement("instances");
  109. instancesElem.setBool("relative", mInstancesRelative);
  110. instancesElem.setInt("count", mInstances.size());
  111. for (unsigned i = 0; i < mInstances.size(); ++i)
  112. {
  113. XMLElement instanceElem = dest.createChildElement("instance");
  114. const Instance& instance = mInstances[i];
  115. instanceElem.setVector3("pos", instance.mPosition);
  116. instanceElem.setQuaternion("rot", instance.mRotation);
  117. instanceElem.setVector3("scale", instance.mScale);
  118. }
  119. }
  120. void InstancedModel::loadXML(const XMLElement& source, ResourceCache* cache)
  121. {
  122. // Read GeometryNode properties
  123. GeometryNode::loadXML(source, cache);
  124. // Read InstancedModel properties
  125. XMLElement modelElem = source.getChildElement("model");
  126. setModel(cache->getResource<Model>(modelElem.getString("name")));
  127. XMLElement materialElem = source.getChildElement("material");
  128. while (materialElem)
  129. {
  130. unsigned index = materialElem.getInt("index");
  131. setMaterial(index, cache->getResource<Material>(materialElem.getString("name")));
  132. materialElem = materialElem.getNextElement("material");
  133. }
  134. XMLElement instancesElem = source.getChildElement("instances");
  135. mInstancesRelative = instancesElem.getBool("relative");
  136. setNumInstances(instancesElem.getInt("count"));
  137. XMLElement instanceElem = source.getChildElement("instance");
  138. unsigned index = 0;
  139. while ((instanceElem) && (index < mInstances.size()))
  140. {
  141. Instance& instance = mInstances[index];
  142. instance.mPosition = instanceElem.getVector3("pos");
  143. instance.mRotation = instanceElem.getQuaternion("rot");
  144. instance.mScale = instanceElem.getVector3("scale");
  145. instanceElem = instanceElem.getNextElement("instance");
  146. ++index;
  147. }
  148. }
  149. bool InstancedModel::writeNetUpdate(Serializer& dest, Serializer& destRevision, Deserializer& baseRevision, const NetUpdateInfo& info)
  150. {
  151. // Write GeometryNode properties and see if there were any changes
  152. bool prevBits = GeometryNode::writeNetUpdate(dest, destRevision, baseRevision, info);
  153. // Build bitmask of changed properties
  154. unsigned char bits = 0;
  155. // Model and materials
  156. checkStringHash(getResourceHash(mModel), baseRevision, bits, 1);
  157. unsigned numBaseMaterials = baseRevision.getSize() ? baseRevision.readVLE() : 0;
  158. if (mMaterials.size() != numBaseMaterials)
  159. bits |= 2;
  160. for (unsigned i = 0; i < numBaseMaterials; ++i)
  161. {
  162. if (i < mMaterials.size())
  163. checkStringHash(getResourceHash(mOriginalMaterials[i]), baseRevision, bits, 2);
  164. else
  165. baseRevision.readStringHash();
  166. }
  167. // Instances
  168. checkBool(mInstancesRelative, baseRevision, bits, 4);
  169. unsigned numBaseInstances = baseRevision.getSize() ? baseRevision.readVLE() : 0;
  170. if (mInstances.size() != numBaseInstances)
  171. bits |= 8;
  172. static std::vector<unsigned char> instanceBits;
  173. instanceBits.resize(mInstances.size());
  174. // Compare against the base instances first
  175. for (unsigned i = 0; i < numBaseInstances; ++i)
  176. {
  177. if (i < mInstances.size())
  178. {
  179. instanceBits[i] = 0;
  180. checkVector3(mInstances[i].mPosition, baseRevision, instanceBits[i], 1);
  181. checkQuaternion(mInstances[i].mRotation, baseRevision, instanceBits[i], 2);
  182. checkVector3(mInstances[i].mScale, baseRevision, instanceBits[i], 4);
  183. if (instanceBits[i])
  184. bits |= 8;
  185. }
  186. else
  187. {
  188. baseRevision.readVector3();
  189. baseRevision.readQuaternion();
  190. baseRevision.readVector3();
  191. }
  192. }
  193. // Then check possible new instances against defaults
  194. for (unsigned i = numBaseInstances; i < mInstances.size(); ++i)
  195. {
  196. instanceBits[i] = 0;
  197. if (mInstances[i].mPosition != Vector3::sZero)
  198. instanceBits[i] |= 1;
  199. if (mInstances[i].mRotation != Quaternion::sIdentity)
  200. instanceBits[i] |= 2;
  201. if (mInstances[i].mScale != Vector3::sUnity)
  202. instanceBits[i] |= 4;
  203. if (instanceBits[i])
  204. bits |= 8;
  205. }
  206. // Update replication state fully, and network stream by delta
  207. dest.writeUByte(bits);
  208. writeStringHashDelta(getResourceHash(mModel), dest, destRevision, bits & 1);
  209. writeVLEDelta(mMaterials.size(), dest, destRevision, bits & 2);
  210. for (unsigned i = 0; i < mMaterials.size(); ++i)
  211. writeStringHashDelta(getResourceHash(mOriginalMaterials[i]), dest, destRevision, bits & 2);
  212. writeBoolDelta(mInstancesRelative, dest, destRevision, bits & 4);
  213. // Write all instances to the base revision
  214. destRevision.writeVLE(mInstances.size());
  215. for (unsigned i = 0; i < mInstances.size(); ++i)
  216. {
  217. destRevision.writeVector3(mInstances[i].mPosition);
  218. destRevision.writeQuaternion(mInstances[i].mRotation);
  219. destRevision.writeVector3(mInstances[i].mScale);
  220. }
  221. // Then write changed properties of instances to the network stream
  222. if (bits & 8)
  223. {
  224. dest.writeVLE(mInstances.size());
  225. for (unsigned i = 0; i < mInstances.size(); ++i)
  226. {
  227. dest.writeUByte(instanceBits[i]);
  228. if (instanceBits[i] & 1)
  229. dest.writeVector3(mInstances[i].mPosition);
  230. if (instanceBits[i] & 2)
  231. dest.writePackedQuaternion(mInstances[i].mRotation);
  232. if (instanceBits[i] & 4)
  233. dest.writeVector3(mInstances[i].mScale);
  234. }
  235. }
  236. return prevBits || (bits != 0);
  237. }
  238. void InstancedModel::readNetUpdate(Deserializer& source, ResourceCache* cache, const NetUpdateInfo& info)
  239. {
  240. // Read GeometryNode properties
  241. GeometryNode::readNetUpdate(source, cache, info);
  242. unsigned char bits = source.readUByte();
  243. if (bits & 1)
  244. setModel(cache->getResource<Model>(source.readStringHash()));
  245. if (bits & 2)
  246. {
  247. unsigned numMaterials = source.readVLE();
  248. for (unsigned i = 0; i < numMaterials; ++i)
  249. setMaterial(i, cache->getResource<Material>(source.readStringHash()));
  250. }
  251. readBoolDelta(mInstancesRelative, source, bits & 4);
  252. if (bits & 8)
  253. {
  254. unsigned numInstances = source.readVLE();
  255. if (numInstances != mInstances.size())
  256. setNumInstances(numInstances);
  257. for (unsigned i = 0; i < numInstances; ++i)
  258. {
  259. unsigned char instanceBits = source.readUByte();
  260. readVector3Delta(mInstances[i].mPosition, source, instanceBits & 1);
  261. readPackedQuaternionDelta(mInstances[i].mRotation, source, instanceBits & 2);
  262. readVector3Delta(mInstances[i].mScale, source, instanceBits & 4);
  263. }
  264. }
  265. }
  266. void InstancedModel::processRayQuery(RayOctreeQuery& query, float initialDistance)
  267. {
  268. PROFILE(InstancedModel_Raycast);
  269. RayQueryLevel level = query.mLevel;
  270. float nearest = M_INFINITY;
  271. unsigned nearestInstance = 0;
  272. switch (level)
  273. {
  274. case RAY_AABB_NOSUBOBJECTS:
  275. {
  276. RayQueryResult result;
  277. result.mNode = this;
  278. result.mDistance = initialDistance;
  279. query.mResult.push_back(result);
  280. return;
  281. }
  282. case RAY_AABB:
  283. for (unsigned i = 0; i < mInstances.size(); ++i)
  284. {
  285. Matrix4x3 transform(mInstances[i].mPosition, mInstances[i].mRotation, mInstances[i].mScale);
  286. if (mInstancesRelative)
  287. transform = getWorldTransform() * transform;
  288. BoundingBox instanceBox = mBoundingBox.getTransformed(transform);
  289. float distance = instanceBox.getDistance(query.mRay);
  290. if ((distance < query.mMaxDistance) && (distance < nearest))
  291. {
  292. nearest = distance;
  293. nearestInstance = i;
  294. }
  295. }
  296. break;
  297. case RAY_OBB:
  298. for (unsigned i = 0; i < mInstances.size(); ++i)
  299. {
  300. Matrix4x3 transform(mInstances[i].mPosition, mInstances[i].mRotation, mInstances[i].mScale);
  301. if (mInstancesRelative)
  302. transform = getWorldTransform() * transform;
  303. // Do an initial AABB test
  304. float distance = mBoundingBox.getTransformed(transform).getDistance(query.mRay);
  305. if ((distance < query.mMaxDistance) && (distance < nearest))
  306. {
  307. Matrix4x3 inverse = transform.getInverse();
  308. Ray localRay(inverse * query.mRay.mOrigin, inverse * Vector4(query.mRay.mDirection, 0.0f));
  309. distance = mBoundingBox.getDistance(localRay);
  310. if ((distance < query.mMaxDistance) && (distance < nearest))
  311. {
  312. nearest = distance;
  313. nearestInstance = i;
  314. }
  315. }
  316. }
  317. break;
  318. case RAY_TRIANGLE:
  319. for (unsigned i = 0; i < mInstances.size(); ++i)
  320. {
  321. Matrix4x3 transform(mInstances[i].mPosition, mInstances[i].mRotation, mInstances[i].mScale);
  322. if (mInstancesRelative)
  323. transform = getWorldTransform() * transform;
  324. // Do an initial AABB test
  325. float distance = mBoundingBox.getTransformed(transform).getDistance(query.mRay);
  326. if ((distance < query.mMaxDistance) && (distance < nearest))
  327. {
  328. // Then an OBB test
  329. Matrix4x3 inverse = transform.getInverse();
  330. Ray localRay(inverse * query.mRay.mOrigin, inverse * Vector4(query.mRay.mDirection, 0.0f));
  331. distance = mBoundingBox.getDistance(localRay);
  332. if ((distance < query.mMaxDistance) && (distance < nearest))
  333. {
  334. // And finally the triangle-level test
  335. for (unsigned j = 0; j < mOriginalGeometries.size(); ++j)
  336. {
  337. unsigned lodLevel = mModel->getRaycastLodLevel();
  338. if (lodLevel >= mOriginalGeometries[j].size())
  339. lodLevel = mOriginalLodLevels[j];
  340. Geometry* geom = mOriginalGeometries[j][lodLevel];
  341. if (geom)
  342. {
  343. distance = geom->getDistance(localRay);
  344. if ((distance < query.mMaxDistance) && (distance < nearest))
  345. {
  346. nearest = distance;
  347. nearestInstance = i;
  348. break;
  349. }
  350. }
  351. }
  352. }
  353. }
  354. }
  355. break;
  356. }
  357. // Return the nearest hit against an instance
  358. if (nearest < M_INFINITY)
  359. {
  360. RayQueryResult result;
  361. result.mNode = this;
  362. result.mDistance = nearest;
  363. result.mSubObject = nearestInstance;
  364. query.mResult.push_back(result);
  365. }
  366. }
  367. void InstancedModel::updateDistance(const FrameInfo& frame)
  368. {
  369. mDistance = frame.mCamera->getDistance(getWorldPosition());
  370. static const Vector3 dotScale(1 / 3.0f, 1 / 3.0f, 1 / 3.0f);
  371. float scale = mAverageInstanceScale;
  372. if (mInstancesRelative)
  373. scale *= getWorldScale().dotProduct(dotScale);
  374. float newLodDistance = frame.mCamera->getLodDistance(mDistance, scale, mLodBias);
  375. if (newLodDistance != mLodDistance)
  376. {
  377. mLodDistance = newLodDistance;
  378. mLodLevelsDirty = true;
  379. }
  380. }
  381. void InstancedModel::updateGeometry(const FrameInfo& frame, Renderer* renderer)
  382. {
  383. if (sMode != mMode)
  384. {
  385. mMode = sMode;
  386. mInstancesDirty = true;
  387. }
  388. if (mInstancesDirty)
  389. buildInstances(renderer);
  390. if (mInstanceTransformsDirty)
  391. updateInstanceTransforms();
  392. if ((mMode == HARDWARE_INSTANCING) && (mHWInstancingBufferDirty))
  393. updateHWInstancingBuffer();
  394. if (mLodLevelsDirty)
  395. calculateLodLevels();
  396. }
  397. unsigned InstancedModel::getNumBatches()
  398. {
  399. return mGeometries.size();
  400. }
  401. Geometry* InstancedModel::getBatchGeometry(unsigned batchIndex)
  402. {
  403. return mGeometries[batchIndex][mLodLevels[batchIndex]];
  404. }
  405. Material* InstancedModel::getBatchMaterial(unsigned batchIndex)
  406. {
  407. return mMaterials[batchIndex];
  408. }
  409. bool InstancedModel::getVertexShaderParameter(unsigned batchIndex, VSParameter parameter, const float** data,
  410. unsigned* count)
  411. {
  412. if ((parameter == VSP_MODELINSTANCES) && (mMode == SHADER_INSTANCING) && (mOriginalGeometries.size()))
  413. {
  414. unsigned batchNumber = batchIndex / mOriginalGeometries.size();
  415. *data = mInstanceTransforms[mBatchStarts[batchNumber]].getData();
  416. *count = mBatchCounts[batchNumber] * 12;
  417. return true;
  418. }
  419. return false;
  420. }
  421. bool InstancedModel::drawOcclusion(OcclusionBuffer* buffer)
  422. {
  423. bool success = true;
  424. for (unsigned i = 0; i < mOriginalGeometries.size(); ++i)
  425. {
  426. // Use designated LOD level for occlusion, or if out of range, same as visible
  427. unsigned lodLevel = mModel->getOcclusionLodLevel();
  428. if (lodLevel >= mGeometries[i].size())
  429. lodLevel = mOriginalLodLevels[i];
  430. Geometry* geom = mOriginalGeometries[i][lodLevel];
  431. if (!geom)
  432. continue;
  433. // Check that the material is suitable for occlusion (default material always is)
  434. // and set culling mode
  435. Material* mat = mOriginalMaterials[i];
  436. if (mat)
  437. {
  438. if (!mat->getOcclusion())
  439. continue;
  440. buffer->setCullMode(mat->getOcclusionCullMode());
  441. }
  442. else
  443. buffer->setCullMode(CULL_CCW);
  444. const unsigned char* vertexData;
  445. unsigned vertexSize;
  446. const unsigned char* indexData;
  447. unsigned indexSize;
  448. geom->lockRawData(vertexData, vertexSize, indexData, indexSize);
  449. // Check for valid geometry data
  450. if ((!vertexData) || (!indexData))
  451. continue;
  452. unsigned indexStart = geom->getIndexStart();
  453. unsigned indexCount = geom->getIndexCount();
  454. for (unsigned j = 0; j < mInstances.size(); ++j)
  455. {
  456. // Draw and check for running out of triangles
  457. if (!buffer->draw(mInstanceTransforms[j], vertexData, vertexSize, indexData, indexSize, indexStart, indexCount))
  458. {
  459. success = false;
  460. break;
  461. }
  462. }
  463. geom->unlockRawData();
  464. if (!success)
  465. break;
  466. }
  467. return success;
  468. }
  469. void InstancedModel::setModel(Model* model)
  470. {
  471. if (model == mModel)
  472. return;
  473. PROFILE(InstancedModel_SetModel);
  474. if (!model)
  475. return;
  476. mModel = model;
  477. mOriginalGeometries.clear();
  478. mOriginalMaterials.clear();
  479. // Copy the subgeometry & LOD level structure
  480. const std::vector<std::vector<SharedPtr<Geometry> > >& geometries = model->getGeometries();
  481. for (unsigned i = 0; i < geometries.size(); ++i)
  482. {
  483. mOriginalGeometries.push_back(geometries[i]);
  484. mOriginalMaterials.push_back(SharedPtr<Material>());
  485. }
  486. // Set the bounding box
  487. setBoundingBox(model->getBoundingBox());
  488. markInstancesDirty();
  489. resetLodLevels();
  490. }
  491. void InstancedModel::setMaterial(Material* material)
  492. {
  493. for (unsigned i = 0; i < mOriginalMaterials.size(); ++i)
  494. mOriginalMaterials[i] = material;
  495. markInstancesDirty();
  496. }
  497. bool InstancedModel::setMaterial(unsigned index, Material* material)
  498. {
  499. if (index >= mMaterials.size())
  500. {
  501. LOGERROR("Illegal material index");
  502. return false;
  503. }
  504. mMaterials[index] = material;
  505. markInstancesDirty();
  506. return true;
  507. }
  508. void InstancedModel::setNumInstances(unsigned num)
  509. {
  510. unsigned oldNum = mInstances.size();
  511. mInstances.resize(num);
  512. mInstanceTransforms.resize(num);
  513. // Set default values for new instances
  514. for (unsigned i = oldNum; i < num; ++i)
  515. {
  516. mInstances[i].mPosition = Vector3::sZero;
  517. mInstances[i].mRotation = Quaternion::sIdentity;
  518. mInstances[i].mScale = Vector3::sUnity;
  519. }
  520. markInstancesDirty();
  521. }
  522. void InstancedModel::setInstancesRelative(bool enable)
  523. {
  524. mInstancesRelative = enable;
  525. markInstanceTransformsDirty();
  526. }
  527. void InstancedModel::updated()
  528. {
  529. markInstanceTransformsDirty();
  530. }
  531. Material* InstancedModel::getMaterial(unsigned index) const
  532. {
  533. if (index >= mOriginalMaterials.size())
  534. return 0;
  535. return mOriginalMaterials[index];
  536. }
  537. Instance* InstancedModel::getInstance(unsigned index)
  538. {
  539. if (index >= mInstances.size())
  540. return 0;
  541. return &mInstances[index];
  542. }
  543. void InstancedModel::onMarkedDirty()
  544. {
  545. VolumeNode::onMarkedDirty();
  546. if (mInstancesRelative)
  547. mInstanceTransformsDirty = true;
  548. }
  549. void InstancedModel::onWorldBoundingBoxUpdate(BoundingBox& worldBoundingBox)
  550. {
  551. if (mInstanceTransformsDirty)
  552. updateInstanceTransforms();
  553. worldBoundingBox.mDefined = false;
  554. for (unsigned i = 0; i < mInstanceTransforms.size(); ++i)
  555. worldBoundingBox.merge(mBoundingBox.getTransformed(mInstanceTransforms[i]));
  556. if (!mInstances.size())
  557. worldBoundingBox.merge(getWorldPosition());
  558. }
  559. void InstancedModel::buildInstances(Renderer* renderer)
  560. {
  561. PROFILE(InstancedModel_Build);
  562. mInstancesDirty = false;
  563. mGeometries.clear();
  564. mMaterials.clear();
  565. mBatchStarts.clear();
  566. mBatchCounts.clear();
  567. if ((!mOriginalGeometries.size()) || (!mOriginalGeometries[0].size()))
  568. return;
  569. unsigned numInstances = mInstances.size();
  570. mInstanceTransformsDirty = true;
  571. if (mMode == SHADER_INSTANCING)
  572. {
  573. mHWInstancingBuffer.reset();
  574. unsigned instanceIndex = 0;
  575. while (numInstances)
  576. {
  577. // Check how many vertices in the original geometry. Avoid having to convert to 32bit indices
  578. unsigned maxVertices = 0;
  579. for (unsigned i = 0; i < mOriginalGeometries.size(); ++i)
  580. {
  581. if (!mOriginalGeometries[i][0])
  582. continue;
  583. unsigned vertices = mOriginalGeometries[i][0]->getVertexBuffer(0)->getVertexCount();
  584. if (vertices > maxVertices)
  585. maxVertices = vertices;
  586. }
  587. maxVertices = max(maxVertices, 1);
  588. unsigned instanceCount = 65536 / maxVertices;
  589. if (instanceCount < 2)
  590. {
  591. LOGERROR("Too many vertices in original geometry for instancing");
  592. mInstances.clear();
  593. return;
  594. }
  595. if (instanceCount > MAX_INSTANCES_PER_BATCH)
  596. instanceCount = MAX_INSTANCES_PER_BATCH;
  597. if (instanceCount > numInstances)
  598. instanceCount = numInstances;
  599. mBatchStarts.push_back(instanceIndex);
  600. mBatchCounts.push_back(instanceCount);
  601. for (unsigned i = 0; i < mOriginalGeometries.size(); ++i)
  602. {
  603. std::vector<SharedPtr<Geometry> > lodLevels;
  604. lodLevels.resize(mOriginalGeometries[i].size());
  605. for (unsigned j = 0; j < mOriginalGeometries[i].size(); ++j)
  606. {
  607. Geometry* original = mOriginalGeometries[i][j];
  608. if (!original)
  609. continue;
  610. SharedPtr<Geometry> clone(new Geometry());
  611. clone->setNumVertexBuffers(original->getNumVertexBuffers());
  612. for (unsigned k = 0; k < original->getNumVertexBuffers(); ++k)
  613. clone->setVertexBuffer(k, createInstanceVertexBuffer(original->getVertexBuffer(k), instanceCount),
  614. original->getVertexElementMask(k) | MASK_INSTANCENUMBER);
  615. unsigned indexStart;
  616. clone->setIndexBuffer(createInstanceIndexBuffer(mOriginalGeometries, i, j, instanceCount, indexStart));
  617. clone->setDrawRange(original->getPrimitiveType(), indexStart, instanceCount * original->getIndexCount());
  618. clone->setLodDistance(original->getLodDistance());
  619. lodLevels[j] = clone;
  620. }
  621. mGeometries.push_back(lodLevels);
  622. mMaterials.push_back(mOriginalMaterials[i]);
  623. }
  624. instanceIndex += instanceCount;
  625. numInstances -= instanceCount;
  626. }
  627. }
  628. else
  629. {
  630. cleanupInstanceBuffers();
  631. if (!mHWInstancingBuffer)
  632. mHWInstancingBuffer = new VertexBuffer(renderer);
  633. mHWInstancingBuffer->setSize(numInstances, MASK_INSTANCEMATRIX1 | MASK_INSTANCEMATRIX2 | MASK_INSTANCEMATRIX3);
  634. mHWInstancingBufferDirty = true;
  635. for (unsigned i = 0; i < mOriginalGeometries.size(); ++i)
  636. {
  637. std::vector<SharedPtr<Geometry> > lodLevels;
  638. for (unsigned j = 0; j < mOriginalGeometries[i].size(); ++j)
  639. {
  640. SharedPtr<Geometry> clone(new Geometry());
  641. Geometry* original = mOriginalGeometries[i][j];
  642. unsigned numVBs = original->getNumVertexBuffers();
  643. if (numVBs >= MAX_VERTEX_STREAMS)
  644. {
  645. LOGERROR("No room for instance vertex stream");
  646. mInstances.clear();
  647. return;
  648. }
  649. clone->setNumVertexBuffers(numVBs + 1);
  650. for (unsigned k = 0; k < numVBs; ++k)
  651. clone->setVertexBuffer(k, original->getVertexBuffer(k), original->getVertexElementMask(k));
  652. clone->setVertexBuffer(numVBs, mHWInstancingBuffer);
  653. clone->setIndexBuffer(original->getIndexBuffer());
  654. clone->setDrawRange(original->getPrimitiveType(), original->getIndexStart(), original->getIndexCount());
  655. clone->setInstanceCount(numInstances);
  656. clone->setLodDistance(original->getLodDistance());
  657. lodLevels.push_back(clone);
  658. }
  659. mGeometries.push_back(lodLevels);
  660. mMaterials.push_back(mOriginalMaterials[i]);
  661. }
  662. }
  663. resetLodLevels();
  664. }
  665. void InstancedModel::updateInstanceTransforms()
  666. {
  667. PROFILE(InstancedModel_UpdateTransforms);
  668. if (!mInstanceTransforms.size())
  669. return;
  670. Matrix4x3 transform;
  671. const Matrix4x3& worldTransform = getWorldTransform();
  672. static const Vector3 dotScale(1 / 3.0f, 1 / 3.0f, 1 / 3.0f);
  673. float scaleAcc = 0.0f;
  674. for (unsigned i = 0; i < mInstanceTransforms.size(); ++i)
  675. {
  676. transform.define(mInstances[i].mPosition, mInstances[i].mRotation, mInstances[i].mScale);
  677. scaleAcc += mInstances[i].mScale.dotProduct(dotScale);
  678. if (!mInstancesRelative)
  679. mInstanceTransforms[i] = transform;
  680. else
  681. mInstanceTransforms[i] = worldTransform * transform;
  682. }
  683. mAverageInstanceScale = scaleAcc / mInstanceTransforms.size();
  684. mInstanceTransformsDirty = false;
  685. if (mMode == HARDWARE_INSTANCING)
  686. mHWInstancingBufferDirty = true;
  687. }
  688. void InstancedModel::updateHWInstancingBuffer()
  689. {
  690. if ((mHWInstancingBuffer) && (mHWInstancingBuffer->getVertexCount() == mInstanceTransforms.size()))
  691. {
  692. PROFILE(InstancedModel_UpdateVertexBuffer);
  693. mHWInstancingBuffer->setData(mInstanceTransforms[0].getData());
  694. mHWInstancingBufferDirty = false;
  695. }
  696. }
  697. const SharedPtr<VertexBuffer>& InstancedModel::createInstanceVertexBuffer(VertexBuffer* original, unsigned instanceCount)
  698. {
  699. std::map<const VertexBuffer*, SharedPtr<VertexBuffer> >::iterator i = sInstanceVertexBuffers.find(original);
  700. // If there already exists a buffer with enough copies of the original, return it
  701. if ((i != sInstanceVertexBuffers.end()) && (i->second->getVertexCount() >= original->getVertexCount() * instanceCount))
  702. return i->second;
  703. // Otherwise have to (re)create the buffer
  704. if (i == sInstanceVertexBuffers.end())
  705. {
  706. sInstanceVertexBuffers[original] = new VertexBuffer(original->getRenderer());
  707. i = sInstanceVertexBuffers.find(original);
  708. }
  709. // Copy the vertices as many times as necessary and add the instance number data
  710. i->second->setSize(original->getVertexCount() * instanceCount, original->getElementMask() | MASK_INSTANCENUMBER);
  711. unsigned char* srcData = (unsigned char*)original->lock(0, original->getVertexCount(), LOCK_READONLY);
  712. unsigned char* destData = (unsigned char*)i->second->lock(0, i->second->getVertexCount(), LOCK_DISCARD);
  713. unsigned srcVertexSize = original->getVertexSize();
  714. float instanceIndex = 0.0f;
  715. for (unsigned j = 0; j < instanceCount; ++j)
  716. {
  717. for (unsigned k = 0; k < original->getVertexCount(); ++k)
  718. {
  719. memcpy(destData, &srcData[k * srcVertexSize], srcVertexSize);
  720. destData += srcVertexSize;
  721. *((float*)destData) = instanceIndex;
  722. destData += sizeof(float);
  723. }
  724. instanceIndex += 1.0f;
  725. }
  726. i->second->unlock();
  727. original->unlock();
  728. return i->second;
  729. }
  730. const SharedPtr<IndexBuffer>& InstancedModel::createInstanceIndexBuffer(
  731. const std::vector<std::vector<SharedPtr<Geometry> > >& geometries, unsigned subGeometry, unsigned lodLevel,
  732. unsigned instanceCount, unsigned& indexStart)
  733. {
  734. IndexBuffer* original = geometries[subGeometry][lodLevel]->getIndexBuffer();
  735. // Build the geometry part of search key by adding the total amount of used indices. Not foolproof,
  736. // but should suffice in cases where an indexbuffer is generally not shared between different models
  737. unsigned totalIndices = 0;
  738. for (unsigned i = 0; i < geometries.size(); ++i)
  739. {
  740. for (unsigned j = 0; j < geometries[i].size(); ++j)
  741. {
  742. if (geometries[i][j]->getIndexBuffer() == original)
  743. totalIndices += geometries[i][j]->getIndexCount();
  744. }
  745. }
  746. std::pair<const IndexBuffer*, unsigned> searchKey = std::make_pair(original, totalIndices);
  747. std::map<std::pair<const IndexBuffer*, unsigned>, SharedPtr<IndexBuffer> >::iterator i =
  748. sInstanceIndexBuffers.find(searchKey);
  749. // If there already exists a buffer with enough copies of the original, return it
  750. if ((i != sInstanceIndexBuffers.end()) && (i->second->getIndexCount() >= totalIndices * instanceCount))
  751. {
  752. unsigned currentInstanceCount = i->second->getIndexCount() / totalIndices;
  753. unsigned destIndex = 0;
  754. for (unsigned j = 0; j < geometries.size(); ++j)
  755. {
  756. for (unsigned k = 0; k < geometries[j].size(); ++k)
  757. {
  758. if ((j == subGeometry) && (k == lodLevel))
  759. indexStart = destIndex;
  760. if (geometries[j][k]->getIndexBuffer() == original)
  761. destIndex += currentInstanceCount * geometries[j][k]->getIndexCount();
  762. }
  763. }
  764. return i->second;
  765. }
  766. // Otherwise have to (re)create the buffer
  767. if (i == sInstanceIndexBuffers.end())
  768. {
  769. sInstanceIndexBuffers[searchKey] = new IndexBuffer(original->getRenderer());
  770. i = sInstanceIndexBuffers.find(searchKey);
  771. }
  772. i->second->setSize(totalIndices * instanceCount, original->getIndexSize() == sizeof(unsigned));
  773. // 16-bit indices
  774. if (original->getIndexSize() == sizeof(unsigned short))
  775. {
  776. unsigned short* srcData = (unsigned short*)original->lock(0, original->getIndexCount(), LOCK_READONLY);
  777. unsigned short* destData = (unsigned short*)i->second->lock(0, i->second->getIndexCount(), LOCK_DISCARD);
  778. unsigned destIndex = 0;
  779. for (unsigned j = 0; j < geometries.size(); ++j)
  780. {
  781. for (unsigned k = 0; k < geometries[j].size(); ++k)
  782. {
  783. unsigned vertexCount = geometries[j][k]->getVertexBuffer(0)->getVertexCount();
  784. if (geometries[j][k]->getIndexBuffer() == original)
  785. {
  786. if ((j == subGeometry) && (k == lodLevel))
  787. indexStart = destIndex;
  788. unsigned indexStart = geometries[j][k]->getIndexStart();
  789. unsigned indexEnd = indexStart + geometries[j][k]->getIndexCount();
  790. for (unsigned l = 0; l < instanceCount; ++l)
  791. {
  792. for (unsigned m = indexStart; m < indexEnd; ++m)
  793. {
  794. *destData = srcData[m] + l * vertexCount;
  795. ++destData;
  796. }
  797. }
  798. destIndex += instanceCount * (indexEnd - indexStart);
  799. }
  800. }
  801. }
  802. i->second->unlock();
  803. original->unlock();
  804. }
  805. // 32-bit indices
  806. else
  807. {
  808. unsigned* srcData = (unsigned*)original->lock(0, original->getIndexCount(), LOCK_READONLY);
  809. unsigned* destData = (unsigned*)i->second->lock(0, i->second->getIndexCount(), LOCK_DISCARD);
  810. unsigned destIndex = 0;
  811. for (unsigned j = 0; j < geometries.size(); ++j)
  812. {
  813. for (unsigned k = 0; k < geometries[j].size(); ++k)
  814. {
  815. unsigned vertexCount = geometries[j][k]->getVertexBuffer(0)->getVertexCount();
  816. if (geometries[j][k]->getIndexBuffer() == original)
  817. {
  818. if ((j == subGeometry) && (k == lodLevel))
  819. indexStart = destIndex;
  820. unsigned indexStart = geometries[j][k]->getIndexStart();
  821. unsigned indexEnd = indexStart + geometries[j][k]->getIndexCount();
  822. for (unsigned l = 0; l < instanceCount; ++l)
  823. {
  824. for (unsigned m = indexStart; m < indexEnd; ++m)
  825. {
  826. *destData = srcData[m] + l * vertexCount;
  827. ++destData;
  828. }
  829. }
  830. destIndex += instanceCount * (indexEnd - indexStart);
  831. }
  832. }
  833. }
  834. i->second->unlock();
  835. original->unlock();
  836. }
  837. return i->second;
  838. }
  839. void InstancedModel::cleanupInstanceBuffers()
  840. {
  841. // Remove buffers that are only referenced in the static maps, and no longer used by any InstancedModels
  842. for (std::map<const VertexBuffer*, SharedPtr<VertexBuffer> >::iterator i = sInstanceVertexBuffers.begin();
  843. i != sInstanceVertexBuffers.end();)
  844. {
  845. std::map<const VertexBuffer*, SharedPtr<VertexBuffer> >::iterator current = i;
  846. ++i;
  847. if (current->second.getRefCount() == 1)
  848. sInstanceVertexBuffers.erase(current);
  849. }
  850. for (std::map<std::pair<const IndexBuffer*, unsigned>, SharedPtr<IndexBuffer> >::iterator i = sInstanceIndexBuffers.begin();
  851. i != sInstanceIndexBuffers.end();)
  852. {
  853. std::map<std::pair<const IndexBuffer*, unsigned>, SharedPtr<IndexBuffer> >::iterator current = i;
  854. ++i;
  855. if (current->second.getRefCount() == 1)
  856. sInstanceIndexBuffers.erase(current);
  857. }
  858. }
  859. void InstancedModel::markInstancesDirty()
  860. {
  861. mInstancesDirty = true;
  862. markInstanceTransformsDirty();
  863. }
  864. void InstancedModel::markInstanceTransformsDirty()
  865. {
  866. VolumeNode::onMarkedDirty();
  867. mInstanceTransformsDirty = true;
  868. }
  869. void InstancedModel::setBoundingBox(const BoundingBox& box)
  870. {
  871. mBoundingBox = box;
  872. VolumeNode::onMarkedDirty();
  873. }
  874. void InstancedModel::resetLodLevels()
  875. {
  876. // Ensure that each subgeometry has at least one LOD level, and reset the current LOD level
  877. mOriginalLodLevels.resize(mOriginalGeometries.size());
  878. mLodLevels.resize(mGeometries.size());
  879. for (unsigned i = 0; i < mOriginalGeometries.size(); ++i)
  880. {
  881. if (!mOriginalGeometries[i].size())
  882. mOriginalGeometries[i].resize(1);
  883. mOriginalLodLevels[i] = 0;
  884. }
  885. for (unsigned i = 0; i < mGeometries.size(); ++i)
  886. {
  887. if (!mGeometries[i].size())
  888. mGeometries[i].resize(1);
  889. mLodLevels[i] = 0;
  890. }
  891. // Find out the real LOD levels on next geometry update
  892. mLodLevelsDirty = true;
  893. }
  894. void InstancedModel::calculateLodLevels()
  895. {
  896. for (unsigned i = 0; i < mOriginalGeometries.size(); ++i)
  897. {
  898. unsigned j;
  899. for (j = 1; j < mOriginalGeometries[i].size(); ++j)
  900. {
  901. if ((mOriginalGeometries[i][j]) && (mLodDistance <= mOriginalGeometries[i][j]->getLodDistance()))
  902. break;
  903. }
  904. mOriginalLodLevels[i] = j - 1;
  905. }
  906. for (unsigned i = 0; i < mGeometries.size(); ++i)
  907. {
  908. unsigned j;
  909. for (j = 1; j < mGeometries[i].size(); ++j)
  910. {
  911. if ((mGeometries[i][j]) && (mLodDistance <= mGeometries[i][j]->getLodDistance()))
  912. break;
  913. }
  914. mLodLevels[i] = j - 1;
  915. }
  916. mLodLevelsDirty = false;
  917. }