Book a Demo!
CoCalc Logo Icon
StoreFeaturesDocsShareSupportNewsAboutPoliciesSign UpSign In
godotengine
GitHub Repository: godotengine/godot
Path: blob/master/thirdparty/embree/kernels/common/acceln.cpp
9905 views
1
// Copyright 2009-2021 Intel Corporation
2
// SPDX-License-Identifier: Apache-2.0
3
4
#include "acceln.h"
5
#include "ray.h"
6
#include "../../include/embree4/rtcore_ray.h"
7
#include "../../common/algorithms/parallel_for.h"
8
9
namespace embree
10
{
11
AccelN::AccelN()
12
: Accel(AccelData::TY_ACCELN), accels() {}
13
14
AccelN::~AccelN()
15
{
16
for (size_t i=0; i<accels.size(); i++)
17
delete accels[i];
18
}
19
20
void AccelN::accels_add(Accel* accel)
21
{
22
assert(accel);
23
accels.push_back(accel);
24
}
25
26
void AccelN::accels_init()
27
{
28
for (size_t i=0; i<accels.size(); i++)
29
delete accels[i];
30
31
accels.clear();
32
}
33
34
bool AccelN::pointQuery (Accel::Intersectors* This_in, PointQuery* query, PointQueryContext* context)
35
{
36
bool changed = false;
37
AccelN* This = (AccelN*)This_in->ptr;
38
for (size_t i=0; i<This->accels.size(); i++)
39
if (!This->accels[i]->isEmpty())
40
changed |= This->accels[i]->intersectors.pointQuery(query,context);
41
return changed;
42
}
43
44
void AccelN::intersect (Accel::Intersectors* This_in, RTCRayHit& ray, RayQueryContext* context)
45
{
46
AccelN* This = (AccelN*)This_in->ptr;
47
for (size_t i=0; i<This->accels.size(); i++)
48
if (!This->accels[i]->isEmpty())
49
This->accels[i]->intersectors.intersect(ray,context);
50
}
51
52
void AccelN::intersect4 (const void* valid, Accel::Intersectors* This_in, RTCRayHit4& ray, RayQueryContext* context)
53
{
54
AccelN* This = (AccelN*)This_in->ptr;
55
for (size_t i=0; i<This->accels.size(); i++)
56
if (!This->accels[i]->isEmpty())
57
This->accels[i]->intersectors.intersect4(valid,ray,context);
58
}
59
60
void AccelN::intersect8 (const void* valid, Accel::Intersectors* This_in, RTCRayHit8& ray, RayQueryContext* context)
61
{
62
AccelN* This = (AccelN*)This_in->ptr;
63
for (size_t i=0; i<This->accels.size(); i++)
64
if (!This->accels[i]->isEmpty())
65
This->accels[i]->intersectors.intersect8(valid,ray,context);
66
}
67
68
void AccelN::intersect16 (const void* valid, Accel::Intersectors* This_in, RTCRayHit16& ray, RayQueryContext* context)
69
{
70
AccelN* This = (AccelN*)This_in->ptr;
71
for (size_t i=0; i<This->accels.size(); i++)
72
if (!This->accels[i]->isEmpty())
73
This->accels[i]->intersectors.intersect16(valid,ray,context);
74
}
75
76
void AccelN::occluded (Accel::Intersectors* This_in, RTCRay& ray, RayQueryContext* context)
77
{
78
AccelN* This = (AccelN*)This_in->ptr;
79
for (size_t i=0; i<This->accels.size(); i++) {
80
if (This->accels[i]->isEmpty()) continue;
81
This->accels[i]->intersectors.occluded(ray,context);
82
if (ray.tfar < 0.0f) break;
83
}
84
}
85
86
void AccelN::occluded4 (const void* valid, Accel::Intersectors* This_in, RTCRay4& ray, RayQueryContext* context)
87
{
88
AccelN* This = (AccelN*)This_in->ptr;
89
for (size_t i=0; i<This->accels.size(); i++) {
90
if (This->accels[i]->isEmpty()) continue;
91
This->accels[i]->intersectors.occluded4(valid,ray,context);
92
#if defined(__SSE2__) || defined(__ARM_NEON)
93
vbool4 valid0 = asBool(((vint4*)valid)[0]);
94
vbool4 hit0 = ((vfloat4*)ray.tfar)[0] >= vfloat4(zero);
95
if (unlikely(none(valid0 & hit0))) break;
96
#endif
97
}
98
}
99
100
void AccelN::occluded8 (const void* valid, Accel::Intersectors* This_in, RTCRay8& ray, RayQueryContext* context)
101
{
102
AccelN* This = (AccelN*)This_in->ptr;
103
for (size_t i=0; i<This->accels.size(); i++) {
104
if (This->accels[i]->isEmpty()) continue;
105
This->accels[i]->intersectors.occluded8(valid,ray,context);
106
#if defined(__SSE2__) || defined(__ARM_NEON) // FIXME: use higher ISA
107
vbool4 valid0 = asBool(((vint4*)valid)[0]);
108
vbool4 hit0 = ((vfloat4*)ray.tfar)[0] >= vfloat4(zero);
109
vbool4 valid1 = asBool(((vint4*)valid)[1]);
110
vbool4 hit1 = ((vfloat4*)ray.tfar)[1] >= vfloat4(zero);
111
if (unlikely((none((valid0 & hit0) | (valid1 & hit1))))) break;
112
#endif
113
}
114
}
115
116
void AccelN::occluded16 (const void* valid, Accel::Intersectors* This_in, RTCRay16& ray, RayQueryContext* context)
117
{
118
AccelN* This = (AccelN*)This_in->ptr;
119
for (size_t i=0; i<This->accels.size(); i++) {
120
if (This->accels[i]->isEmpty()) continue;
121
This->accels[i]->intersectors.occluded16(valid,ray,context);
122
#if defined(__SSE2__) || defined(__ARM_NEON) // FIXME: use higher ISA
123
vbool4 valid0 = asBool(((vint4*)valid)[0]);
124
vbool4 hit0 = ((vfloat4*)ray.tfar)[0] >= vfloat4(zero);
125
vbool4 valid1 = asBool(((vint4*)valid)[1]);
126
vbool4 hit1 = ((vfloat4*)ray.tfar)[1] >= vfloat4(zero);
127
vbool4 valid2 = asBool(((vint4*)valid)[2]);
128
vbool4 hit2 = ((vfloat4*)ray.tfar)[2] >= vfloat4(zero);
129
vbool4 valid3 = asBool(((vint4*)valid)[3]);
130
vbool4 hit3 = ((vfloat4*)ray.tfar)[3] >= vfloat4(zero);
131
if (unlikely((none((valid0 & hit0) | (valid1 & hit1) | (valid2 & hit2) | (valid3 & hit3))))) break;
132
#endif
133
}
134
}
135
136
void AccelN::accels_print(size_t ident)
137
{
138
for (size_t i=0; i<accels.size(); i++)
139
{
140
for (size_t j=0; j<ident; j++) std::cout << " ";
141
std::cout << "accels[" << i << "]" << std::endl;
142
accels[i]->intersectors.print(ident+2);
143
}
144
}
145
146
void AccelN::accels_immutable()
147
{
148
for (size_t i=0; i<accels.size(); i++)
149
accels[i]->immutable();
150
}
151
152
void AccelN::accels_build ()
153
{
154
/* reduce memory consumption */
155
accels.shrink_to_fit();
156
157
/* build all acceleration structures in parallel */
158
parallel_for (accels.size(), [&] (size_t i) {
159
accels[i]->build();
160
});
161
162
/* create list of non-empty acceleration structures */
163
bool valid1 = true;
164
bool valid4 = true;
165
bool valid8 = true;
166
bool valid16 = true;
167
for (size_t i=0; i<accels.size(); i++) {
168
valid1 &= (bool) accels[i]->intersectors.intersector1;
169
valid4 &= (bool) accels[i]->intersectors.intersector4;
170
valid8 &= (bool) accels[i]->intersectors.intersector8;
171
valid16 &= (bool) accels[i]->intersectors.intersector16;
172
}
173
174
if (accels.size() == 1) {
175
type = accels[0]->type; // FIXME: should just assign entire Accel
176
bounds = accels[0]->bounds;
177
intersectors = accels[0]->intersectors;
178
}
179
else
180
{
181
type = AccelData::TY_ACCELN;
182
intersectors.ptr = this;
183
intersectors.intersector1 = Intersector1(&intersect,&occluded,&pointQuery,valid1 ? "AccelN::intersector1": nullptr);
184
intersectors.intersector4 = Intersector4(&intersect4,&occluded4,valid4 ? "AccelN::intersector4" : nullptr);
185
intersectors.intersector8 = Intersector8(&intersect8,&occluded8,valid8 ? "AccelN::intersector8" : nullptr);
186
intersectors.intersector16 = Intersector16(&intersect16,&occluded16,valid16 ? "AccelN::intersector16": nullptr);
187
188
/*! calculate bounds */
189
bounds = empty;
190
for (size_t i=0; i<accels.size(); i++)
191
bounds.extend(accels[i]->bounds);
192
}
193
}
194
195
void AccelN::accels_select(bool filter)
196
{
197
for (size_t i=0; i<accels.size(); i++)
198
accels[i]->intersectors.select(filter);
199
}
200
201
void AccelN::accels_deleteGeometry(size_t geomID)
202
{
203
for (size_t i=0; i<accels.size(); i++)
204
accels[i]->deleteGeometry(geomID);
205
}
206
207
void AccelN::accels_clear()
208
{
209
for (size_t i=0; i<accels.size(); i++) {
210
accels[i]->clear();
211
}
212
}
213
}
214
215
216