767e374dce
Since Embree v3.13.0 supports AARCH64, switch back to the official repo instead of using Embree-aarch64. `thirdparty/embree/patches/godot-changes.patch` should now contain an accurate diff of the changes done to the library.
247 lines
10 KiB
C++
247 lines
10 KiB
C++
// Copyright 2009-2021 Intel Corporation
|
|
// SPDX-License-Identifier: Apache-2.0
|
|
|
|
#include "bvh_refit.h"
|
|
#include "bvh_statistics.h"
|
|
|
|
#include "../geometry/linei.h"
|
|
#include "../geometry/triangle.h"
|
|
#include "../geometry/trianglev.h"
|
|
#include "../geometry/trianglei.h"
|
|
#include "../geometry/quadv.h"
|
|
#include "../geometry/object.h"
|
|
#include "../geometry/instance.h"
|
|
|
|
namespace embree
|
|
{
|
|
namespace isa
|
|
{
|
|
static const size_t SINGLE_THREAD_THRESHOLD = 4*1024;
|
|
|
|
template<int N>
|
|
__forceinline bool compare(const typename BVHN<N>::NodeRef* a, const typename BVHN<N>::NodeRef* b)
|
|
{
|
|
size_t sa = *(size_t*)&a->node()->lower_x;
|
|
size_t sb = *(size_t*)&b->node()->lower_x;
|
|
return sa < sb;
|
|
}
|
|
|
|
template<int N>
|
|
BVHNRefitter<N>::BVHNRefitter (BVH* bvh, const LeafBoundsInterface& leafBounds)
|
|
: bvh(bvh), leafBounds(leafBounds), numSubTrees(0)
|
|
{
|
|
}
|
|
|
|
template<int N>
|
|
void BVHNRefitter<N>::refit()
|
|
{
|
|
if (bvh->numPrimitives <= SINGLE_THREAD_THRESHOLD) {
|
|
bvh->bounds = LBBox3fa(recurse_bottom(bvh->root));
|
|
}
|
|
else
|
|
{
|
|
BBox3fa subTreeBounds[MAX_NUM_SUB_TREES];
|
|
numSubTrees = 0;
|
|
gather_subtree_refs(bvh->root,numSubTrees,0);
|
|
if (numSubTrees)
|
|
parallel_for(size_t(0), numSubTrees, size_t(1), [&](const range<size_t>& r) {
|
|
for (size_t i=r.begin(); i<r.end(); i++) {
|
|
NodeRef& ref = subTrees[i];
|
|
subTreeBounds[i] = recurse_bottom(ref);
|
|
}
|
|
});
|
|
|
|
numSubTrees = 0;
|
|
bvh->bounds = LBBox3fa(refit_toplevel(bvh->root,numSubTrees,subTreeBounds,0));
|
|
}
|
|
}
|
|
|
|
template<int N>
|
|
void BVHNRefitter<N>::gather_subtree_refs(NodeRef& ref,
|
|
size_t &subtrees,
|
|
const size_t depth)
|
|
{
|
|
if (depth >= MAX_SUB_TREE_EXTRACTION_DEPTH)
|
|
{
|
|
assert(subtrees < MAX_NUM_SUB_TREES);
|
|
subTrees[subtrees++] = ref;
|
|
return;
|
|
}
|
|
|
|
if (ref.isAABBNode())
|
|
{
|
|
AABBNode* node = ref.getAABBNode();
|
|
for (size_t i=0; i<N; i++) {
|
|
NodeRef& child = node->child(i);
|
|
if (unlikely(child == BVH::emptyNode)) continue;
|
|
gather_subtree_refs(child,subtrees,depth+1);
|
|
}
|
|
}
|
|
}
|
|
|
|
template<int N>
|
|
BBox3fa BVHNRefitter<N>::refit_toplevel(NodeRef& ref,
|
|
size_t &subtrees,
|
|
const BBox3fa *const subTreeBounds,
|
|
const size_t depth)
|
|
{
|
|
if (depth >= MAX_SUB_TREE_EXTRACTION_DEPTH)
|
|
{
|
|
assert(subtrees < MAX_NUM_SUB_TREES);
|
|
assert(subTrees[subtrees] == ref);
|
|
return subTreeBounds[subtrees++];
|
|
}
|
|
|
|
if (ref.isAABBNode())
|
|
{
|
|
AABBNode* node = ref.getAABBNode();
|
|
BBox3fa bounds[N];
|
|
|
|
for (size_t i=0; i<N; i++)
|
|
{
|
|
NodeRef& child = node->child(i);
|
|
|
|
if (unlikely(child == BVH::emptyNode))
|
|
bounds[i] = BBox3fa(empty);
|
|
else
|
|
bounds[i] = refit_toplevel(child,subtrees,subTreeBounds,depth+1);
|
|
}
|
|
|
|
BBox3vf<N> boundsT = transpose<N>(bounds);
|
|
|
|
/* set new bounds */
|
|
node->lower_x = boundsT.lower.x;
|
|
node->lower_y = boundsT.lower.y;
|
|
node->lower_z = boundsT.lower.z;
|
|
node->upper_x = boundsT.upper.x;
|
|
node->upper_y = boundsT.upper.y;
|
|
node->upper_z = boundsT.upper.z;
|
|
|
|
return merge<N>(bounds);
|
|
}
|
|
else
|
|
return leafBounds.leafBounds(ref);
|
|
}
|
|
|
|
// =========================================================
|
|
// =========================================================
|
|
// =========================================================
|
|
|
|
|
|
template<int N>
|
|
BBox3fa BVHNRefitter<N>::recurse_bottom(NodeRef& ref)
|
|
{
|
|
/* this is a leaf node */
|
|
if (unlikely(ref.isLeaf()))
|
|
return leafBounds.leafBounds(ref);
|
|
|
|
/* recurse if this is an internal node */
|
|
AABBNode* node = ref.getAABBNode();
|
|
|
|
/* enable exclusive prefetch for >= AVX platforms */
|
|
#if defined(__AVX__)
|
|
BVH::prefetchW(ref);
|
|
#endif
|
|
BBox3fa bounds[N];
|
|
|
|
for (size_t i=0; i<N; i++)
|
|
if (unlikely(node->child(i) == BVH::emptyNode))
|
|
{
|
|
bounds[i] = BBox3fa(empty);
|
|
}
|
|
else
|
|
bounds[i] = recurse_bottom(node->child(i));
|
|
|
|
/* AOS to SOA transform */
|
|
BBox3vf<N> boundsT = transpose<N>(bounds);
|
|
|
|
/* set new bounds */
|
|
node->lower_x = boundsT.lower.x;
|
|
node->lower_y = boundsT.lower.y;
|
|
node->lower_z = boundsT.lower.z;
|
|
node->upper_x = boundsT.upper.x;
|
|
node->upper_y = boundsT.upper.y;
|
|
node->upper_z = boundsT.upper.z;
|
|
|
|
return merge<N>(bounds);
|
|
}
|
|
|
|
template<int N, typename Mesh, typename Primitive>
|
|
BVHNRefitT<N,Mesh,Primitive>::BVHNRefitT (BVH* bvh, Builder* builder, Mesh* mesh, size_t mode)
|
|
: bvh(bvh), builder(builder), refitter(new BVHNRefitter<N>(bvh,*(typename BVHNRefitter<N>::LeafBoundsInterface*)this)), mesh(mesh), topologyVersion(0) {}
|
|
|
|
template<int N, typename Mesh, typename Primitive>
|
|
void BVHNRefitT<N,Mesh,Primitive>::clear()
|
|
{
|
|
if (builder)
|
|
builder->clear();
|
|
}
|
|
|
|
template<int N, typename Mesh, typename Primitive>
|
|
void BVHNRefitT<N,Mesh,Primitive>::build()
|
|
{
|
|
if (mesh->topologyChanged(topologyVersion)) {
|
|
topologyVersion = mesh->getTopologyVersion();
|
|
builder->build();
|
|
}
|
|
else
|
|
refitter->refit();
|
|
}
|
|
|
|
template class BVHNRefitter<4>;
|
|
#if defined(__AVX__)
|
|
template class BVHNRefitter<8>;
|
|
#endif
|
|
|
|
#if defined(EMBREE_GEOMETRY_TRIANGLE)
|
|
Builder* BVH4Triangle4MeshBuilderSAH (void* bvh, TriangleMesh* mesh, unsigned int geomID, size_t mode);
|
|
Builder* BVH4Triangle4vMeshBuilderSAH (void* bvh, TriangleMesh* mesh, unsigned int geomID, size_t mode);
|
|
Builder* BVH4Triangle4iMeshBuilderSAH (void* bvh, TriangleMesh* mesh, unsigned int geomID, size_t mode);
|
|
|
|
Builder* BVH4Triangle4MeshRefitSAH (void* accel, TriangleMesh* mesh, unsigned int geomID, size_t mode) { return new BVHNRefitT<4,TriangleMesh,Triangle4> ((BVH4*)accel,BVH4Triangle4MeshBuilderSAH (accel,mesh,geomID,mode),mesh,mode); }
|
|
Builder* BVH4Triangle4vMeshRefitSAH (void* accel, TriangleMesh* mesh, unsigned int geomID, size_t mode) { return new BVHNRefitT<4,TriangleMesh,Triangle4v>((BVH4*)accel,BVH4Triangle4vMeshBuilderSAH(accel,mesh,geomID,mode),mesh,mode); }
|
|
Builder* BVH4Triangle4iMeshRefitSAH (void* accel, TriangleMesh* mesh, unsigned int geomID, size_t mode) { return new BVHNRefitT<4,TriangleMesh,Triangle4i>((BVH4*)accel,BVH4Triangle4iMeshBuilderSAH(accel,mesh,geomID,mode),mesh,mode); }
|
|
#if defined(__AVX__)
|
|
Builder* BVH8Triangle4MeshBuilderSAH (void* bvh, TriangleMesh* mesh, unsigned int geomID, size_t mode);
|
|
Builder* BVH8Triangle4vMeshBuilderSAH (void* bvh, TriangleMesh* mesh, unsigned int geomID, size_t mode);
|
|
Builder* BVH8Triangle4iMeshBuilderSAH (void* bvh, TriangleMesh* mesh, unsigned int geomID, size_t mode);
|
|
|
|
Builder* BVH8Triangle4MeshRefitSAH (void* accel, TriangleMesh* mesh, unsigned int geomID, size_t mode) { return new BVHNRefitT<8,TriangleMesh,Triangle4> ((BVH8*)accel,BVH8Triangle4MeshBuilderSAH (accel,mesh,geomID,mode),mesh,mode); }
|
|
Builder* BVH8Triangle4vMeshRefitSAH (void* accel, TriangleMesh* mesh, unsigned int geomID, size_t mode) { return new BVHNRefitT<8,TriangleMesh,Triangle4v>((BVH8*)accel,BVH8Triangle4vMeshBuilderSAH(accel,mesh,geomID,mode),mesh,mode); }
|
|
Builder* BVH8Triangle4iMeshRefitSAH (void* accel, TriangleMesh* mesh, unsigned int geomID, size_t mode) { return new BVHNRefitT<8,TriangleMesh,Triangle4i>((BVH8*)accel,BVH8Triangle4iMeshBuilderSAH(accel,mesh,geomID,mode),mesh,mode); }
|
|
#endif
|
|
#endif
|
|
|
|
#if defined(EMBREE_GEOMETRY_QUAD)
|
|
Builder* BVH4Quad4vMeshBuilderSAH (void* bvh, QuadMesh* mesh, unsigned int geomID, size_t mode);
|
|
Builder* BVH4Quad4vMeshRefitSAH (void* accel, QuadMesh* mesh, unsigned int geomID, size_t mode) { return new BVHNRefitT<4,QuadMesh,Quad4v>((BVH4*)accel,BVH4Quad4vMeshBuilderSAH(accel,mesh,geomID,mode),mesh,mode); }
|
|
|
|
#if defined(__AVX__)
|
|
Builder* BVH8Quad4vMeshBuilderSAH (void* bvh, QuadMesh* mesh, unsigned int geomID, size_t mode);
|
|
Builder* BVH8Quad4vMeshRefitSAH (void* accel, QuadMesh* mesh, unsigned int geomID, size_t mode) { return new BVHNRefitT<8,QuadMesh,Quad4v>((BVH8*)accel,BVH8Quad4vMeshBuilderSAH(accel,mesh,geomID,mode),mesh,mode); }
|
|
#endif
|
|
|
|
#endif
|
|
|
|
#if defined(EMBREE_GEOMETRY_USER)
|
|
Builder* BVH4VirtualMeshBuilderSAH (void* bvh, UserGeometry* mesh, unsigned int geomID, size_t mode);
|
|
Builder* BVH4VirtualMeshRefitSAH (void* accel, UserGeometry* mesh, unsigned int geomID, size_t mode) { return new BVHNRefitT<4,UserGeometry,Object>((BVH4*)accel,BVH4VirtualMeshBuilderSAH(accel,mesh,geomID,mode),mesh,mode); }
|
|
|
|
#if defined(__AVX__)
|
|
Builder* BVH8VirtualMeshBuilderSAH (void* bvh, UserGeometry* mesh, unsigned int geomID, size_t mode);
|
|
Builder* BVH8VirtualMeshRefitSAH (void* accel, UserGeometry* mesh, unsigned int geomID, size_t mode) { return new BVHNRefitT<8,UserGeometry,Object>((BVH8*)accel,BVH8VirtualMeshBuilderSAH(accel,mesh,geomID,mode),mesh,mode); }
|
|
#endif
|
|
#endif
|
|
|
|
#if defined(EMBREE_GEOMETRY_INSTANCE)
|
|
Builder* BVH4InstanceMeshBuilderSAH (void* bvh, Instance* mesh, Geometry::GTypeMask gtype, unsigned int geomID, size_t mode);
|
|
Builder* BVH4InstanceMeshRefitSAH (void* accel, Instance* mesh, Geometry::GTypeMask gtype, unsigned int geomID, size_t mode) { return new BVHNRefitT<4,Instance,InstancePrimitive>((BVH4*)accel,BVH4InstanceMeshBuilderSAH(accel,mesh,gtype,geomID,mode),mesh,mode); }
|
|
|
|
#if defined(__AVX__)
|
|
Builder* BVH8InstanceMeshBuilderSAH (void* bvh, Instance* mesh, Geometry::GTypeMask gtype, unsigned int geomID, size_t mode);
|
|
Builder* BVH8InstanceMeshRefitSAH (void* accel, Instance* mesh, Geometry::GTypeMask gtype, unsigned int geomID, size_t mode) { return new BVHNRefitT<8,Instance,InstancePrimitive>((BVH8*)accel,BVH8InstanceMeshBuilderSAH(accel,mesh,gtype,geomID,mode),mesh,mode); }
|
|
#endif
|
|
#endif
|
|
|
|
}
|
|
}
|