2021-05-20 12:49:33 +02:00
|
|
|
// Copyright 2009-2021 Intel Corporation
|
2020-12-19 14:50:20 +01:00
|
|
|
// SPDX-License-Identifier: Apache-2.0
|
|
|
|
|
|
|
|
#pragma once
|
|
|
|
|
|
|
|
#include "patch.h"
|
|
|
|
#include "feature_adaptive_eval_simd.h"
|
|
|
|
|
|
|
|
namespace embree
|
|
|
|
{
|
|
|
|
namespace isa
|
|
|
|
{
|
|
|
|
template<typename vbool, typename vint, typename vfloat, typename Vertex, typename Vertex_t = Vertex>
|
|
|
|
struct PatchEvalSimd
|
|
|
|
{
|
|
|
|
public:
|
|
|
|
|
|
|
|
typedef PatchT<Vertex,Vertex_t> Patch;
|
|
|
|
typedef typename Patch::Ref Ref;
|
|
|
|
typedef CatmullClarkPatchT<Vertex,Vertex_t> CatmullClarkPatch;
|
|
|
|
|
|
|
|
PatchEvalSimd (SharedLazyTessellationCache::CacheEntry& entry, size_t commitCounter,
|
|
|
|
const HalfEdge* edge, const char* vertices, size_t stride, const vbool& valid0, const vfloat& u, const vfloat& v,
|
|
|
|
float* P, float* dPdu, float* dPdv, float* ddPdudu, float* ddPdvdv, float* ddPdudv, const size_t dstride, const size_t N)
|
|
|
|
: P(P), dPdu(dPdu), dPdv(dPdv), ddPdudu(ddPdudu), ddPdvdv(ddPdvdv), ddPdudv(ddPdudv), dstride(dstride), N(N)
|
|
|
|
{
|
|
|
|
/* conservative time for the very first allocation */
|
|
|
|
auto time = SharedLazyTessellationCache::sharedLazyTessellationCache.getTime(commitCounter);
|
|
|
|
|
|
|
|
Ref patch = SharedLazyTessellationCache::lookup(entry,commitCounter,[&] () {
|
|
|
|
auto alloc = [](size_t bytes) { return SharedLazyTessellationCache::malloc(bytes); };
|
|
|
|
return Patch::create(alloc,edge,vertices,stride);
|
|
|
|
}, true);
|
|
|
|
|
|
|
|
auto curTime = SharedLazyTessellationCache::sharedLazyTessellationCache.getTime(commitCounter);
|
|
|
|
const bool allAllocationsValid = SharedLazyTessellationCache::validTime(time,curTime);
|
|
|
|
|
|
|
|
patch = allAllocationsValid ? patch : nullptr;
|
|
|
|
|
|
|
|
/* use cached data structure for calculations */
|
|
|
|
const vbool valid1 = patch ? eval(valid0,patch,u,v,1.0f,0) : vbool(false);
|
|
|
|
SharedLazyTessellationCache::unlock();
|
|
|
|
const vbool valid2 = valid0 & !valid1;
|
|
|
|
if (any(valid2)) {
|
|
|
|
FeatureAdaptiveEvalSimd<vbool,vint,vfloat,Vertex,Vertex_t>(edge,vertices,stride,valid2,u,v,P,dPdu,dPdv,ddPdudu,ddPdvdv,ddPdudv,dstride,N);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
vbool eval_quad(const vbool& valid, const typename Patch::SubdividedQuadPatch* This, const vfloat& u, const vfloat& v, const float dscale, const size_t depth)
|
|
|
|
{
|
|
|
|
vbool ret = false;
|
|
|
|
const vbool u0_mask = u < 0.5f, u1_mask = u >= 0.5f;
|
|
|
|
const vbool v0_mask = v < 0.5f, v1_mask = v >= 0.5f;
|
|
|
|
const vbool u0v0_mask = valid & u0_mask & v0_mask;
|
|
|
|
const vbool u0v1_mask = valid & u0_mask & v1_mask;
|
|
|
|
const vbool u1v0_mask = valid & u1_mask & v0_mask;
|
|
|
|
const vbool u1v1_mask = valid & u1_mask & v1_mask;
|
|
|
|
if (any(u0v0_mask)) ret |= eval(u0v0_mask,This->child[0],2.0f*u,2.0f*v,2.0f*dscale,depth+1);
|
|
|
|
if (any(u1v0_mask)) ret |= eval(u1v0_mask,This->child[1],2.0f*u-1.0f,2.0f*v,2.0f*dscale,depth+1);
|
|
|
|
if (any(u1v1_mask)) ret |= eval(u1v1_mask,This->child[2],2.0f*u-1.0f,2.0f*v-1.0f,2.0f*dscale,depth+1);
|
|
|
|
if (any(u0v1_mask)) ret |= eval(u0v1_mask,This->child[3],2.0f*u,2.0f*v-1.0f,2.0f*dscale,depth+1);
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
|
|
|
vbool eval_general(const vbool& valid, const typename Patch::SubdividedGeneralPatch* patch, const vfloat& U, const vfloat& V, const size_t depth)
|
|
|
|
{
|
|
|
|
vbool ret = false;
|
|
|
|
const vint l = (vint)floor(0.5f*U); const vfloat u = 2.0f*frac(0.5f*U)-0.5f;
|
|
|
|
const vint h = (vint)floor(0.5f*V); const vfloat v = 2.0f*frac(0.5f*V)-0.5f;
|
|
|
|
const vint i = (h<<2)+l; assert(all(valid,i<patch->N));
|
|
|
|
foreach_unique(valid,i,[&](const vbool& valid, const int i) {
|
|
|
|
ret |= eval(valid,patch->child[i],u,v,1.0f,depth+1);
|
|
|
|
});
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
|
|
|
vbool eval(const vbool& valid, Ref This, const vfloat& u, const vfloat& v, const float dscale, const size_t depth)
|
|
|
|
{
|
|
|
|
if (!This) return false;
|
|
|
|
switch (This.type())
|
|
|
|
{
|
|
|
|
case Patch::BILINEAR_PATCH: {
|
|
|
|
((typename Patch::BilinearPatch*)This.object())->patch.eval(valid,u,v,P,dPdu,dPdv,ddPdudu,ddPdvdv,ddPdudv,dscale,dstride,N);
|
|
|
|
return valid;
|
|
|
|
}
|
|
|
|
case Patch::BSPLINE_PATCH: {
|
|
|
|
((typename Patch::BSplinePatch*)This.object())->patch.eval(valid,u,v,P,dPdu,dPdv,ddPdudu,ddPdvdv,ddPdudv,dscale,dstride,N);
|
|
|
|
return valid;
|
|
|
|
}
|
|
|
|
case Patch::BEZIER_PATCH: {
|
|
|
|
((typename Patch::BezierPatch*)This.object())->patch.eval(valid,u,v,P,dPdu,dPdv,ddPdudu,ddPdvdv,ddPdudv,dscale,dstride,N);
|
|
|
|
return valid;
|
|
|
|
}
|
|
|
|
case Patch::GREGORY_PATCH: {
|
|
|
|
((typename Patch::GregoryPatch*)This.object())->patch.eval(valid,u,v,P,dPdu,dPdv,ddPdudu,ddPdvdv,ddPdudv,dscale,dstride,N);
|
|
|
|
return valid;
|
|
|
|
}
|
|
|
|
case Patch::SUBDIVIDED_QUAD_PATCH: {
|
|
|
|
return eval_quad(valid,((typename Patch::SubdividedQuadPatch*)This.object()),u,v,dscale,depth);
|
|
|
|
}
|
|
|
|
case Patch::SUBDIVIDED_GENERAL_PATCH: {
|
|
|
|
assert(dscale == 1.0f);
|
|
|
|
return eval_general(valid,((typename Patch::SubdividedGeneralPatch*)This.object()),u,v,depth);
|
|
|
|
}
|
|
|
|
case Patch::EVAL_PATCH: {
|
|
|
|
CatmullClarkPatch patch; patch.deserialize(This.object());
|
|
|
|
FeatureAdaptiveEvalSimd<vbool,vint,vfloat,Vertex,Vertex_t>(patch,valid,u,v,dscale,depth,P,dPdu,dPdv,ddPdudu,ddPdvdv,ddPdudv,dstride,N);
|
|
|
|
return valid;
|
|
|
|
}
|
|
|
|
default:
|
|
|
|
assert(false);
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
private:
|
|
|
|
float* const P;
|
|
|
|
float* const dPdu;
|
|
|
|
float* const dPdv;
|
|
|
|
float* const ddPdudu;
|
|
|
|
float* const ddPdvdv;
|
|
|
|
float* const ddPdudv;
|
|
|
|
const size_t dstride;
|
|
|
|
const size_t N;
|
|
|
|
};
|
|
|
|
}
|
|
|
|
}
|