bvh_builder_twolevel.cpp 14 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385
  1. // Copyright 2009-2021 Intel Corporation
  2. // SPDX-License-Identifier: Apache-2.0
  3. #if !defined(_CRT_SECURE_NO_WARNINGS)
  4. #define _CRT_SECURE_NO_WARNINGS
  5. #endif
  6. #include "bvh_builder_twolevel.h"
  7. #include "bvh_statistics.h"
  8. #include "../builders/bvh_builder_sah.h"
  9. #include "../common/scene_line_segments.h"
  10. #include "../common/scene_triangle_mesh.h"
  11. #include "../common/scene_quad_mesh.h"
  12. #define PROFILE 0
  13. namespace embree
  14. {
  15. namespace isa
  16. {
  17. template<int N, typename Mesh, typename Primitive>
  18. BVHNBuilderTwoLevel<N,Mesh,Primitive>::BVHNBuilderTwoLevel (BVH* bvh, Scene* scene, Geometry::GTypeMask gtype, bool useMortonBuilder, const size_t singleThreadThreshold)
  19. : bvh(bvh), scene(scene), refs(scene->device,0), prims(scene->device,0), singleThreadThreshold(singleThreadThreshold), gtype(gtype), useMortonBuilder_(useMortonBuilder) {}
  20. template<int N, typename Mesh, typename Primitive>
  21. BVHNBuilderTwoLevel<N,Mesh,Primitive>::~BVHNBuilderTwoLevel () {
  22. }
  23. // ===========================================================================
  24. // ===========================================================================
  25. // ===========================================================================
  26. template<int N, typename Mesh, typename Primitive>
  27. void BVHNBuilderTwoLevel<N,Mesh,Primitive>::build()
  28. {
  29. /* delete some objects */
  30. size_t num = scene->size();
  31. if (num < bvh->objects.size()) {
  32. parallel_for(num, bvh->objects.size(), [&] (const range<size_t>& r) {
  33. for (size_t i=r.begin(); i<r.end(); i++) {
  34. builders[i].reset();
  35. delete bvh->objects[i]; bvh->objects[i] = nullptr;
  36. }
  37. });
  38. }
  39. #if PROFILE
  40. while(1)
  41. #endif
  42. {
  43. /* reset memory allocator */
  44. bvh->alloc.reset();
  45. /* skip build for empty scene */
  46. const size_t numPrimitives = scene->getNumPrimitives(gtype,false);
  47. if (numPrimitives == 0) {
  48. prims.resize(0);
  49. bvh->set(BVH::emptyNode,empty,0);
  50. return;
  51. }
  52. /* calculate the size of the entire BVH */
  53. const size_t numLeafBlocks = Primitive::blocks(numPrimitives);
  54. const size_t node_bytes = 2*numLeafBlocks*sizeof(typename BVH::AABBNode)/N;
  55. const size_t leaf_bytes = size_t(1.2*numLeafBlocks*sizeof(Primitive));
  56. bvh->alloc.init_estimate(node_bytes+leaf_bytes);
  57. double t0 = bvh->preBuild(TOSTRING(isa) "::BVH" + toString(N) + "BuilderTwoLevel");
  58. /* resize object array if scene got larger */
  59. if (bvh->objects.size() < num) bvh->objects.resize(num);
  60. if (builders.size() < num) builders.resize(num);
  61. resizeRefsList ();
  62. nextRef.store(0);
  63. /* create acceleration structures */
  64. parallel_for(size_t(0), num, [&] (const range<size_t>& r)
  65. {
  66. for (size_t objectID=r.begin(); objectID<r.end(); objectID++)
  67. {
  68. Mesh* mesh = scene->getSafe<Mesh>(objectID);
  69. /* ignore meshes we do not support */
  70. if (mesh == nullptr || mesh->numTimeSteps != 1)
  71. continue;
  72. if (isSmallGeometry(mesh)) {
  73. setupSmallBuildRefBuilder (objectID, mesh);
  74. } else {
  75. setupLargeBuildRefBuilder (objectID, mesh);
  76. }
  77. }
  78. });
  79. /* parallel build of acceleration structures */
  80. parallel_for(size_t(0), num, [&] (const range<size_t>& r)
  81. {
  82. for (size_t objectID=r.begin(); objectID<r.end(); objectID++)
  83. {
  84. /* ignore if no triangle mesh or not enabled */
  85. Mesh* mesh = scene->getSafe<Mesh>(objectID);
  86. if (mesh == nullptr || !mesh->isEnabled() || mesh->numTimeSteps != 1)
  87. continue;
  88. builders[objectID]->attachBuildRefs (this);
  89. }
  90. });
  91. #if PROFILE
  92. double d0 = getSeconds();
  93. #endif
  94. /* fast path for single geometry scenes */
  95. if (nextRef == 1) {
  96. bvh->set(refs[0].node,LBBox3fa(refs[0].bounds()),numPrimitives);
  97. }
  98. else
  99. {
  100. /* open all large nodes */
  101. refs.resize(nextRef);
  102. /* this probably needs some more tuning */
  103. const size_t extSize = max(max((size_t)SPLIT_MIN_EXT_SPACE,refs.size()*SPLIT_MEMORY_RESERVE_SCALE),size_t((float)numPrimitives / SPLIT_MEMORY_RESERVE_FACTOR));
  104. #if !ENABLE_DIRECT_SAH_MERGE_BUILDER
  105. #if ENABLE_OPEN_SEQUENTIAL
  106. open_sequential(extSize);
  107. #endif
  108. /* compute PrimRefs */
  109. prims.resize(refs.size());
  110. #endif
  111. {
  112. #if ENABLE_DIRECT_SAH_MERGE_BUILDER
  113. const PrimInfo pinfo = parallel_reduce(size_t(0), refs.size(), PrimInfo(empty), [&] (const range<size_t>& r) -> PrimInfo {
  114. PrimInfo pinfo(empty);
  115. for (size_t i=r.begin(); i<r.end(); i++) {
  116. pinfo.add_center2(refs[i]);
  117. }
  118. return pinfo;
  119. }, [] (const PrimInfo& a, const PrimInfo& b) { return PrimInfo::merge(a,b); });
  120. #else
  121. const PrimInfo pinfo = parallel_reduce(size_t(0), refs.size(), PrimInfo(empty), [&] (const range<size_t>& r) -> PrimInfo {
  122. PrimInfo pinfo(empty);
  123. for (size_t i=r.begin(); i<r.end(); i++) {
  124. pinfo.add_center2(refs[i]);
  125. prims[i] = PrimRef(refs[i].bounds(),(size_t)refs[i].node);
  126. }
  127. return pinfo;
  128. }, [] (const PrimInfo& a, const PrimInfo& b) { return PrimInfo::merge(a,b); });
  129. #endif
  130. /* skip if all objects where empty */
  131. if (pinfo.size() == 0)
  132. bvh->set(BVH::emptyNode,empty,0);
  133. /* otherwise build toplevel hierarchy */
  134. else
  135. {
  136. /* settings for BVH build */
  137. GeneralBVHBuilder::Settings settings;
  138. settings.branchingFactor = N;
  139. settings.maxDepth = BVH::maxBuildDepthLeaf;
  140. settings.logBlockSize = bsr(N);
  141. settings.minLeafSize = 1;
  142. settings.maxLeafSize = 1;
  143. settings.travCost = 1.0f;
  144. settings.intCost = 1.0f;
  145. settings.singleThreadThreshold = singleThreadThreshold;
  146. #if ENABLE_DIRECT_SAH_MERGE_BUILDER
  147. refs.resize(extSize);
  148. NodeRef root = BVHBuilderBinnedOpenMergeSAH::build<NodeRef,BuildRef>(
  149. typename BVH::CreateAlloc(bvh),
  150. typename BVH::AABBNode::Create2(),
  151. typename BVH::AABBNode::Set2(),
  152. [&] (const BuildRef* refs, const range<size_t>& range, const FastAllocator::CachedAllocator& alloc) -> NodeRef {
  153. assert(range.size() == 1);
  154. return (NodeRef) refs[range.begin()].node;
  155. },
  156. [&] (BuildRef &bref, BuildRef *refs) -> size_t {
  157. return openBuildRef(bref,refs);
  158. },
  159. [&] (size_t dn) { bvh->scene->progressMonitor(0); },
  160. refs.data(),extSize,pinfo,settings);
  161. #else
  162. NodeRef root = BVHBuilderBinnedSAH::build<NodeRef>(
  163. typename BVH::CreateAlloc(bvh),
  164. typename BVH::AABBNode::Create2(),
  165. typename BVH::AABBNode::Set2(),
  166. [&] (const PrimRef* prims, const range<size_t>& range, const FastAllocator::CachedAllocator& alloc) -> NodeRef {
  167. assert(range.size() == 1);
  168. return (NodeRef) prims[range.begin()].ID();
  169. },
  170. [&] (size_t dn) { bvh->scene->progressMonitor(0); },
  171. prims.data(),pinfo,settings);
  172. #endif
  173. bvh->set(root,LBBox3fa(pinfo.geomBounds),numPrimitives);
  174. }
  175. }
  176. }
  177. bvh->alloc.cleanup();
  178. bvh->postBuild(t0);
  179. #if PROFILE
  180. double d1 = getSeconds();
  181. std::cout << "TOP_LEVEL OPENING/REBUILD TIME " << 1000.0*(d1-d0) << " ms" << std::endl;
  182. #endif
  183. }
  184. }
  185. template<int N, typename Mesh, typename Primitive>
  186. void BVHNBuilderTwoLevel<N,Mesh,Primitive>::deleteGeometry(size_t geomID)
  187. {
  188. if (geomID >= bvh->objects.size()) return;
  189. if (builders[geomID]) builders[geomID].reset();
  190. delete bvh->objects [geomID]; bvh->objects [geomID] = nullptr;
  191. }
  192. template<int N, typename Mesh, typename Primitive>
  193. void BVHNBuilderTwoLevel<N,Mesh,Primitive>::clear()
  194. {
  195. for (size_t i=0; i<bvh->objects.size(); i++)
  196. if (bvh->objects[i]) bvh->objects[i]->clear();
  197. for (size_t i=0; i<builders.size(); i++)
  198. if (builders[i]) builders[i].reset();
  199. refs.clear();
  200. }
  201. template<int N, typename Mesh, typename Primitive>
  202. void BVHNBuilderTwoLevel<N,Mesh,Primitive>::open_sequential(const size_t extSize)
  203. {
  204. if (refs.size() == 0)
  205. return;
  206. refs.reserve(extSize);
  207. #if 1
  208. for (size_t i=0;i<refs.size();i++)
  209. {
  210. NodeRef ref = refs[i].node;
  211. if (ref.isAABBNode())
  212. BVH::prefetch(ref);
  213. }
  214. #endif
  215. std::make_heap(refs.begin(),refs.end());
  216. while (refs.size()+N-1 <= extSize)
  217. {
  218. std::pop_heap (refs.begin(),refs.end());
  219. NodeRef ref = refs.back().node;
  220. if (ref.isLeaf()) break;
  221. refs.pop_back();
  222. AABBNode* node = ref.getAABBNode();
  223. for (size_t i=0; i<N; i++) {
  224. if (node->child(i) == BVH::emptyNode) continue;
  225. refs.push_back(BuildRef(node->bounds(i),node->child(i)));
  226. #if 1
  227. NodeRef ref_pre = node->child(i);
  228. if (ref_pre.isAABBNode())
  229. ref_pre.prefetch();
  230. #endif
  231. std::push_heap (refs.begin(),refs.end());
  232. }
  233. }
  234. }
  235. template<int N, typename Mesh, typename Primitive>
  236. void BVHNBuilderTwoLevel<N,Mesh,Primitive>::setupSmallBuildRefBuilder (size_t objectID, Mesh const * const /*mesh*/)
  237. {
  238. if (builders[objectID] == nullptr || // new mesh
  239. dynamic_cast<RefBuilderSmall*>(builders[objectID].get()) == nullptr) // size change resulted in large->small change
  240. {
  241. builders[objectID].reset (new RefBuilderSmall(objectID));
  242. }
  243. }
  244. template<int N, typename Mesh, typename Primitive>
  245. void BVHNBuilderTwoLevel<N,Mesh,Primitive>::setupLargeBuildRefBuilder (size_t objectID, Mesh const * const mesh)
  246. {
  247. if (bvh->objects[objectID] == nullptr || // new mesh
  248. builders[objectID]->meshQualityChanged (mesh->quality) || // changed build quality
  249. dynamic_cast<RefBuilderLarge*>(builders[objectID].get()) == nullptr) // size change resulted in small->large change
  250. {
  251. Builder* builder = nullptr;
  252. delete bvh->objects[objectID];
  253. createMeshAccel(objectID, builder);
  254. builders[objectID].reset (new RefBuilderLarge(objectID, builder, mesh->quality));
  255. }
  256. }
  257. #if defined(EMBREE_GEOMETRY_TRIANGLE)
  258. Builder* BVH4BuilderTwoLevelTriangle4MeshSAH (void* bvh, Scene* scene, bool useMortonBuilder) {
  259. return new BVHNBuilderTwoLevel<4,TriangleMesh,Triangle4>((BVH4*)bvh,scene,TriangleMesh::geom_type,useMortonBuilder);
  260. }
  261. Builder* BVH4BuilderTwoLevelTriangle4vMeshSAH (void* bvh, Scene* scene, bool useMortonBuilder) {
  262. return new BVHNBuilderTwoLevel<4,TriangleMesh,Triangle4v>((BVH4*)bvh,scene,TriangleMesh::geom_type,useMortonBuilder);
  263. }
  264. Builder* BVH4BuilderTwoLevelTriangle4iMeshSAH (void* bvh, Scene* scene, bool useMortonBuilder) {
  265. return new BVHNBuilderTwoLevel<4,TriangleMesh,Triangle4i>((BVH4*)bvh,scene,TriangleMesh::geom_type,useMortonBuilder);
  266. }
  267. #endif
  268. #if defined(EMBREE_GEOMETRY_QUAD)
  269. Builder* BVH4BuilderTwoLevelQuadMeshSAH (void* bvh, Scene* scene, bool useMortonBuilder) {
  270. return new BVHNBuilderTwoLevel<4,QuadMesh,Quad4v>((BVH4*)bvh,scene,QuadMesh::geom_type,useMortonBuilder);
  271. }
  272. #endif
  273. #if defined(EMBREE_GEOMETRY_USER)
  274. Builder* BVH4BuilderTwoLevelVirtualSAH (void* bvh, Scene* scene, bool useMortonBuilder) {
  275. return new BVHNBuilderTwoLevel<4,UserGeometry,Object>((BVH4*)bvh,scene,UserGeometry::geom_type,useMortonBuilder);
  276. }
  277. #endif
  278. #if defined(EMBREE_GEOMETRY_INSTANCE)
  279. Builder* BVH4BuilderTwoLevelInstanceSAH (void* bvh, Scene* scene, Geometry::GTypeMask gtype, bool useMortonBuilder) {
  280. return new BVHNBuilderTwoLevel<4,Instance,InstancePrimitive>((BVH4*)bvh,scene,gtype,useMortonBuilder);
  281. }
  282. #endif
  283. #if defined(EMBREE_GEOMETRY_INSTANCE_ARRAY)
  284. Builder* BVH4BuilderTwoLevelInstanceArraySAH (void* bvh, Scene* scene, Geometry::GTypeMask gtype, bool useMortonBuilder) {
  285. return new BVHNBuilderTwoLevel<4,InstanceArray,InstanceArrayPrimitive>((BVH4*)bvh,scene,gtype,useMortonBuilder);
  286. }
  287. #endif
  288. #if defined(__AVX__)
  289. #if defined(EMBREE_GEOMETRY_TRIANGLE)
  290. Builder* BVH8BuilderTwoLevelTriangle4MeshSAH (void* bvh, Scene* scene, bool useMortonBuilder) {
  291. return new BVHNBuilderTwoLevel<8,TriangleMesh,Triangle4>((BVH8*)bvh,scene,TriangleMesh::geom_type,useMortonBuilder);
  292. }
  293. Builder* BVH8BuilderTwoLevelTriangle4vMeshSAH (void* bvh, Scene* scene, bool useMortonBuilder) {
  294. return new BVHNBuilderTwoLevel<8,TriangleMesh,Triangle4v>((BVH8*)bvh,scene,TriangleMesh::geom_type,useMortonBuilder);
  295. }
  296. Builder* BVH8BuilderTwoLevelTriangle4iMeshSAH (void* bvh, Scene* scene, bool useMortonBuilder) {
  297. return new BVHNBuilderTwoLevel<8,TriangleMesh,Triangle4i>((BVH8*)bvh,scene,TriangleMesh::geom_type,useMortonBuilder);
  298. }
  299. #endif
  300. #if defined(EMBREE_GEOMETRY_QUAD)
  301. Builder* BVH8BuilderTwoLevelQuadMeshSAH (void* bvh, Scene* scene, bool useMortonBuilder) {
  302. return new BVHNBuilderTwoLevel<8,QuadMesh,Quad4v>((BVH8*)bvh,scene,QuadMesh::geom_type,useMortonBuilder);
  303. }
  304. #endif
  305. #if defined(EMBREE_GEOMETRY_USER)
  306. Builder* BVH8BuilderTwoLevelVirtualSAH (void* bvh, Scene* scene, bool useMortonBuilder) {
  307. return new BVHNBuilderTwoLevel<8,UserGeometry,Object>((BVH8*)bvh,scene,UserGeometry::geom_type,useMortonBuilder);
  308. }
  309. #endif
  310. #if defined(EMBREE_GEOMETRY_INSTANCE)
  311. Builder* BVH8BuilderTwoLevelInstanceSAH (void* bvh, Scene* scene, Geometry::GTypeMask gtype, bool useMortonBuilder) {
  312. return new BVHNBuilderTwoLevel<8,Instance,InstancePrimitive>((BVH8*)bvh,scene,gtype,useMortonBuilder);
  313. }
  314. #endif
  315. #if defined(EMBREE_GEOMETRY_INSTANCE_ARRAY)
  316. Builder* BVH8BuilderTwoLevelInstanceArraySAH (void* bvh, Scene* scene, Geometry::GTypeMask gtype, bool useMortonBuilder) {
  317. return new BVHNBuilderTwoLevel<8,InstanceArray,InstanceArrayPrimitive>((BVH8*)bvh,scene,gtype,useMortonBuilder);
  318. }
  319. #endif
  320. #endif
  321. }
  322. }