Book a Demo!
CoCalc Logo Icon
StoreFeaturesDocsShareSupportNewsAboutPoliciesSign UpSign In
godotengine
GitHub Repository: godotengine/godot
Path: blob/master/thirdparty/embree/kernels/subdiv/feature_adaptive_eval_simd.h
9913 views
1
// Copyright 2009-2021 Intel Corporation
2
// SPDX-License-Identifier: Apache-2.0
3
4
#pragma once
5
6
#include "patch.h"
7
8
namespace embree
9
{
10
namespace isa
11
{
12
template<typename vbool, typename vint, typename vfloat, typename Vertex, typename Vertex_t = Vertex>
13
struct FeatureAdaptiveEvalSimd
14
{
15
public:
16
17
typedef PatchT<Vertex,Vertex_t> Patch;
18
typedef typename Patch::Ref Ref;
19
typedef GeneralCatmullClarkPatchT<Vertex,Vertex_t> GeneralCatmullClarkPatch;
20
typedef CatmullClark1RingT<Vertex,Vertex_t> CatmullClarkRing;
21
typedef CatmullClarkPatchT<Vertex,Vertex_t> CatmullClarkPatch;
22
typedef BSplinePatchT<Vertex,Vertex_t> BSplinePatch;
23
typedef BezierPatchT<Vertex,Vertex_t> BezierPatch;
24
typedef GregoryPatchT<Vertex,Vertex_t> GregoryPatch;
25
typedef BilinearPatchT<Vertex,Vertex_t> BilinearPatch;
26
typedef BezierCurveT<Vertex> BezierCurve;
27
28
FeatureAdaptiveEvalSimd (const HalfEdge* edge, const char* vertices, size_t stride, const vbool& valid, const vfloat& u, const vfloat& v,
29
float* P, float* dPdu, float* dPdv, float* ddPdudu, float* ddPdvdv, float* ddPdudv, const size_t dstride, const size_t N)
30
: P(P), dPdu(dPdu), dPdv(dPdv), ddPdudu(ddPdudu), ddPdvdv(ddPdvdv), ddPdudv(ddPdudv), dstride(dstride), N(N)
31
{
32
switch (edge->patch_type) {
33
case HalfEdge::BILINEAR_PATCH: BilinearPatch(edge,vertices,stride).eval(valid,u,v,P,dPdu,dPdv,ddPdudu,ddPdvdv,ddPdudv,1.0f,dstride,N); break;
34
case HalfEdge::REGULAR_QUAD_PATCH: RegularPatchT(edge,vertices,stride).eval(valid,u,v,P,dPdu,dPdv,ddPdudu,ddPdvdv,ddPdudv,1.0f,dstride,N); break;
35
#if PATCH_USE_GREGORY == 2
36
case HalfEdge::IRREGULAR_QUAD_PATCH: GregoryPatchT<Vertex,Vertex_t>(edge,vertices,stride).eval(valid,u,v,P,dPdu,dPdv,ddPdudu,ddPdvdv,ddPdudv,1.0f,dstride,N); break;
37
#endif
38
default: {
39
GeneralCatmullClarkPatch patch(edge,vertices,stride);
40
eval_direct(valid,patch,Vec2<vfloat>(u,v),0);
41
break;
42
}
43
}
44
}
45
46
FeatureAdaptiveEvalSimd (const CatmullClarkPatch& patch, const vbool& valid, const vfloat& u, const vfloat& v, float dscale, size_t depth,
47
float* P, float* dPdu, float* dPdv, float* ddPdudu, float* ddPdvdv, float* ddPdudv, const size_t dstride, const size_t N)
48
: P(P), dPdu(dPdu), dPdv(dPdv), ddPdudu(ddPdudu), ddPdvdv(ddPdvdv), ddPdudv(ddPdudv), dstride(dstride), N(N)
49
{
50
eval_direct(valid,patch,Vec2<vfloat>(u,v),dscale,depth);
51
}
52
53
template<size_t N>
54
__forceinline void eval_quad_direct(const vbool& valid, array_t<CatmullClarkPatch,N>& patches, const Vec2<vfloat>& uv, float dscale, size_t depth)
55
{
56
const vfloat u = uv.x, v = uv.y;
57
const vbool u0_mask = u < 0.5f, u1_mask = u >= 0.5f;
58
const vbool v0_mask = v < 0.5f, v1_mask = v >= 0.5f;
59
const vbool u0v0_mask = valid & u0_mask & v0_mask;
60
const vbool u0v1_mask = valid & u0_mask & v1_mask;
61
const vbool u1v0_mask = valid & u1_mask & v0_mask;
62
const vbool u1v1_mask = valid & u1_mask & v1_mask;
63
if (any(u0v0_mask)) eval_direct(u0v0_mask,patches[0],Vec2<vfloat>(2.0f*u,2.0f*v),2.0f*dscale,depth+1);
64
if (any(u1v0_mask)) eval_direct(u1v0_mask,patches[1],Vec2<vfloat>(2.0f*u-1.0f,2.0f*v),2.0f*dscale,depth+1);
65
if (any(u1v1_mask)) eval_direct(u1v1_mask,patches[2],Vec2<vfloat>(2.0f*u-1.0f,2.0f*v-1.0f),2.0f*dscale,depth+1);
66
if (any(u0v1_mask)) eval_direct(u0v1_mask,patches[3],Vec2<vfloat>(2.0f*u,2.0f*v-1.0f),2.0f*dscale,depth+1);
67
}
68
69
template<size_t N>
70
__forceinline void eval_general_quad_direct(const vbool& valid, const GeneralCatmullClarkPatch& patch, array_t<CatmullClarkPatch,N>& patches, const Vec2<vfloat>& uv, float dscale, size_t depth)
71
{
72
#if PATCH_USE_GREGORY == 2
73
BezierCurve borders[GeneralCatmullClarkPatch::SIZE]; patch.getLimitBorder(borders);
74
BezierCurve border0l,border0r; borders[0].subdivide(border0l,border0r);
75
BezierCurve border1l,border1r; borders[1].subdivide(border1l,border1r);
76
BezierCurve border2l,border2r; borders[2].subdivide(border2l,border2r);
77
BezierCurve border3l,border3r; borders[3].subdivide(border3l,border3r);
78
#endif
79
GeneralCatmullClarkPatch::fix_quad_ring_order(patches);
80
const vfloat u = uv.x, v = uv.y;
81
const vbool u0_mask = u < 0.5f, u1_mask = u >= 0.5f;
82
const vbool v0_mask = v < 0.5f, v1_mask = v >= 0.5f;
83
const vbool u0v0_mask = valid & u0_mask & v0_mask;
84
const vbool u0v1_mask = valid & u0_mask & v1_mask;
85
const vbool u1v0_mask = valid & u1_mask & v0_mask;
86
const vbool u1v1_mask = valid & u1_mask & v1_mask;
87
#if PATCH_USE_GREGORY == 2
88
if (any(u0v0_mask)) eval_direct(u0v0_mask,patches[0],Vec2<vfloat>(2.0f*u,2.0f*v),2.0f*dscale,depth+1,&border0l,nullptr,nullptr,&border3r);
89
if (any(u1v0_mask)) eval_direct(u1v0_mask,patches[1],Vec2<vfloat>(2.0f*u-1.0f,2.0f*v),2.0f*dscale,depth+1,&border0r,&border1l,nullptr,nullptr);
90
if (any(u1v1_mask)) eval_direct(u1v1_mask,patches[2],Vec2<vfloat>(2.0f*u-1.0f,2.0f*v-1.0f),2.0f*dscale,depth+1,nullptr,&border1r,&border2l,nullptr);
91
if (any(u0v1_mask)) eval_direct(u0v1_mask,patches[3],Vec2<vfloat>(2.0f*u,2.0f*v-1.0f),2.0f*dscale,depth+1,nullptr,nullptr,&border2r,&border3l);
92
#else
93
if (any(u0v0_mask)) eval_direct(u0v0_mask,patches[0],Vec2<vfloat>(2.0f*u,2.0f*v),2.0f*dscale,depth+1);
94
if (any(u1v0_mask)) eval_direct(u1v0_mask,patches[1],Vec2<vfloat>(2.0f*u-1.0f,2.0f*v),2.0f*dscale,depth+1);
95
if (any(u1v1_mask)) eval_direct(u1v1_mask,patches[2],Vec2<vfloat>(2.0f*u-1.0f,2.0f*v-1.0f),2.0f*dscale,depth+1);
96
if (any(u0v1_mask)) eval_direct(u0v1_mask,patches[3],Vec2<vfloat>(2.0f*u,2.0f*v-1.0f),2.0f*dscale,depth+1);
97
#endif
98
}
99
100
__forceinline bool final(const CatmullClarkPatch& patch, const typename CatmullClarkRing::Type type, size_t depth)
101
{
102
const size_t max_eval_depth = (type & CatmullClarkRing::TYPE_CREASES) ? PATCH_MAX_EVAL_DEPTH_CREASE : PATCH_MAX_EVAL_DEPTH_IRREGULAR;
103
//#if PATCH_MIN_RESOLUTION
104
// return patch.isFinalResolution(PATCH_MIN_RESOLUTION) || depth>=max_eval_depth;
105
//#else
106
return depth>=max_eval_depth;
107
//#endif
108
}
109
110
void eval_direct(const vbool& valid, const CatmullClarkPatch& patch, const Vec2<vfloat>& uv, float dscale, size_t depth,
111
BezierCurve* border0 = nullptr, BezierCurve* border1 = nullptr, BezierCurve* border2 = nullptr, BezierCurve* border3 = nullptr)
112
{
113
typename CatmullClarkPatch::Type ty = patch.type();
114
115
if (unlikely(final(patch,ty,depth)))
116
{
117
if (ty & CatmullClarkRing::TYPE_REGULAR) {
118
RegularPatch(patch,border0,border1,border2,border3).eval(valid,uv.x,uv.y,P,dPdu,dPdv,ddPdudu,ddPdvdv,ddPdudv,dscale,dstride,N);
119
} else {
120
IrregularFillPatch(patch,border0,border1,border2,border3).eval(valid,uv.x,uv.y,P,dPdu,dPdv,ddPdudu,ddPdvdv,ddPdudv,dscale,dstride,N);
121
}
122
}
123
else if (ty & CatmullClarkRing::TYPE_REGULAR_CREASES) {
124
assert(depth > 0); RegularPatch(patch,border0,border1,border2,border3).eval(valid,uv.x,uv.y,P,dPdu,dPdv,ddPdudu,ddPdvdv,ddPdudv,dscale,dstride,N);
125
}
126
#if PATCH_USE_GREGORY == 2
127
else if (ty & CatmullClarkRing::TYPE_GREGORY_CREASES) {
128
assert(depth > 0); GregoryPatch(patch,border0,border1,border2,border3).eval(valid,uv.x,uv.y,P,dPdu,dPdv,ddPdudu,ddPdvdv,ddPdudv,dscale,dstride,N);
129
}
130
#endif
131
else
132
{
133
array_t<CatmullClarkPatch,4> patches;
134
patch.subdivide(patches); // FIXME: only have to generate one of the patches
135
eval_quad_direct(valid,patches,uv,dscale,depth);
136
}
137
}
138
139
void eval_direct(const vbool& valid, const GeneralCatmullClarkPatch& patch, const Vec2<vfloat>& uv, const size_t depth)
140
{
141
/* convert into standard quad patch if possible */
142
if (likely(patch.isQuadPatch())) {
143
CatmullClarkPatch qpatch; patch.init(qpatch);
144
return eval_direct(valid,qpatch,uv,1.0f,depth);
145
}
146
147
/* subdivide patch */
148
unsigned Nc;
149
array_t<CatmullClarkPatch,GeneralCatmullClarkPatch::SIZE> patches;
150
patch.subdivide(patches,Nc); // FIXME: only have to generate one of the patches
151
152
/* parametrization for quads */
153
if (Nc == 4)
154
eval_general_quad_direct(valid,patch,patches,uv,1.0f,depth);
155
156
/* parametrization for arbitrary polygons */
157
else
158
{
159
const vint l = (vint)floor(0.5f*uv.x); const vfloat u = 2.0f*frac(0.5f*uv.x)-0.5f;
160
const vint h = (vint)floor(0.5f*uv.y); const vfloat v = 2.0f*frac(0.5f*uv.y)-0.5f;
161
const vint i = (h<<2)+l; assert(all(valid,i<Nc));
162
foreach_unique(valid,i,[&](const vbool& valid, const int i) {
163
#if PATCH_USE_GREGORY == 2
164
BezierCurve borders[2]; patch.getLimitBorder(borders,i);
165
BezierCurve border0l,border0r; borders[0].subdivide(border0l,border0r);
166
BezierCurve border2l,border2r; borders[1].subdivide(border2l,border2r);
167
eval_direct(valid,patches[i],Vec2<vfloat>(u,v),1.0f,depth+1, &border0l, nullptr, nullptr, &border2r);
168
#else
169
eval_direct(valid,patches[i],Vec2<vfloat>(u,v),1.0f,depth+1);
170
#endif
171
});
172
}
173
}
174
175
private:
176
float* const P;
177
float* const dPdu;
178
float* const dPdv;
179
float* const ddPdudu;
180
float* const ddPdvdv;
181
float* const ddPdudv;
182
const size_t dstride;
183
const size_t N;
184
};
185
}
186
}
187
188