bvh_builder_twolevel.cpp 14 KB

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