1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
|
/*
* SimpleABBoxNavigator.h
*
* Created on: Nov 23, 2015
* Author: swenzel
*/
#ifndef NAVIGATION_SIMPLEABBOXNAVIGATOR_H_
#define NAVIGATION_SIMPLEABBOXNAVIGATOR_H_
#include "VNavigator.h"
#include "SimpleABBoxSafetyEstimator.h"
#include "VecGeom/management/ABBoxManager.h"
namespace vecgeom {
inline namespace VECGEOM_IMPL_NAMESPACE {
// A basic implementation of a navigator which is SIMD accelerated by using a flat aligned bounding box list
template <bool MotherIsConvex = false>
class SimpleABBoxNavigator : public VNavigatorHelper<SimpleABBoxNavigator<MotherIsConvex>, MotherIsConvex> {
private:
ABBoxManager &fABBoxManager;
SimpleABBoxNavigator()
: VNavigatorHelper<SimpleABBoxNavigator<MotherIsConvex>, MotherIsConvex>(SimpleABBoxSafetyEstimator::Instance()),
fABBoxManager(ABBoxManager::Instance())
{
}
// convert index to physical daugher
VPlacedVolume const *LookupDaughter(LogicalVolume const *lvol, int id) const
{
assert(id >= 0 && "access with negative index");
assert(size_t(id) < lvol->GetDaughtersp()->size() && "access beyond size of daughterlist ");
return lvol->GetDaughtersp()->operator[](id);
}
// a simple sort class (based on insertionsort)
// template <typename T, typename Cmp>
static void insertionsort(ABBoxManager::BoxIdDistancePair_t *arr, unsigned int N)
{
for (unsigned short i = 1; i < N; ++i) {
ABBoxManager::BoxIdDistancePair_t value = arr[i];
short hole = i;
for (; hole > 0 && value.second < arr[hole - 1].second; --hole)
arr[hole] = arr[hole - 1];
arr[hole] = value;
}
}
// vector version
size_t GetHitCandidates_v(LogicalVolume const * /*lvol*/, Vector3D<Precision> const &point,
Vector3D<Precision> const &dir, ABBoxManager::ABBoxContainer_v const &corners, size_t size,
ABBoxManager::BoxIdDistancePair_t *hitlist) const
{
size_t vecsize = size;
size_t hitcount = 0;
Vector3D<float> invdirfloat(1.f / (float)dir.x(), 1.f / (float)dir.y(), 1.f / (float)dir.z());
Vector3D<float> pfloat((float)point.x(), (float)point.y(), (float)point.z());
int sign[3];
sign[0] = invdirfloat.x() < 0;
sign[1] = invdirfloat.y() < 0;
sign[2] = invdirfloat.z() < 0;
using Float_v = ABBoxManager::Float_v;
using Bool_v = vecCore::Mask_v<Float_v>;
for (size_t box = 0; box < vecsize; ++box) {
Float_v distance = BoxImplementation::IntersectCachedKernel2<Float_v, float>(
&corners[2 * box], pfloat, invdirfloat, sign[0], sign[1], sign[2], 0, InfinityLength<float>());
Bool_v hit = distance < InfinityLength<float>();
if (!vecCore::MaskEmpty(hit)) {
constexpr auto kVS = vecCore::VectorSize<Float_v>();
// VecCore does not have firstOne() function; iterating from zero
// consider putting a firstOne into vecCore or in VecGeom
for (size_t i = 0; i < kVS; ++i) {
if (vecCore::MaskLaneAt(hit, i)) {
assert(hitcount < VECGEOM_MAXDAUGHTERS);
hitlist[hitcount] = (ABBoxManager::BoxIdDistancePair_t(box * kVS + i, vecCore::LaneAt(distance, i)));
hitcount++;
}
}
}
}
return hitcount;
}
public:
// we provide hit detection on the local level and reuse the generic implementations from
// VNavigatorHelper<SimpleABBoxNavigator>
VECGEOM_FORCE_INLINE
virtual bool CheckDaughterIntersections(LogicalVolume const *lvol, Vector3D<Precision> const &localpoint,
Vector3D<Precision> const &localdir, NavigationState const *in_state,
NavigationState * /*out_state*/, Precision &step,
VPlacedVolume const *&hitcandidate) const override
{
// The following construct reserves stackspace for objects
// of type IdDistPair_t WITHOUT initializing those objects
using IdDistPair_t = ABBoxManager::BoxIdDistancePair_t;
char stackspace[VECGEOM_MAXDAUGHTERS * sizeof(IdDistPair_t)];
IdDistPair_t *hitlist = reinterpret_cast<IdDistPair_t *>(&stackspace);
if (lvol->GetDaughtersp()->size() == 0) return false;
int size;
ABBoxManager::ABBoxContainer_v bboxes = fABBoxManager.GetABBoxes_v(lvol, size);
auto ncandidates = GetHitCandidates_v(lvol, localpoint, localdir, bboxes, size, hitlist);
// sort candidates according to their bounding volume hit distance
insertionsort(hitlist, ncandidates);
for (size_t index = 0; index < ncandidates; ++index) {
auto &hitbox = hitlist[index];
VPlacedVolume const *candidate = LookupDaughter(lvol, hitbox.first);
// only consider those hitboxes which are within potential reach of this step
if (!(step < hitbox.second)) {
// std::cerr << "checking id " << hitbox.first << " at box distance " << hitbox.second << "\n";
// if( hitbox.second < 0 ){
// // std::cerr << "funny2\n";
// bool checkindaughter = candidate->Contains( localpoint );
// if( checkindaughter == true ){
// std::cerr << "funny\n";
//
// // need to relocate
// step = 0;
// hitcandidate = candidate;
// // THE ALTERNATIVE WOULD BE TO PUSH THE CURRENT STATE AND RETURN DIRECTLY
// break;
// }
// }
Precision ddistance = candidate->DistanceToIn(localpoint, localdir, step);
#ifdef VERBOSE
std::cerr << "distance to " << candidate->GetLabel() << " is " << ddistance << "\n";
#endif
const auto valid = !IsInf(ddistance) && ddistance < step &&
!((ddistance <= 0.) && in_state && in_state->GetLastExited() == candidate);
hitcandidate = valid ? candidate : hitcandidate;
step = valid ? ddistance : step;
} else {
break;
}
}
return false;
}
virtual bool CheckDaughterIntersections(LogicalVolume const *lvol, Vector3D<Precision> const &localpoint,
Vector3D<Precision> const &localdir, VPlacedVolume const *blocked,
Precision &step, VPlacedVolume const *&hitcandidate) const override
{
// The following construct reserves stackspace for objects
// of type IdDistPair_t WITHOUT initializing those objects
using IdDistPair_t = ABBoxManager::BoxIdDistancePair_t;
char stackspace[VECGEOM_MAXDAUGHTERS * sizeof(IdDistPair_t)];
IdDistPair_t *hitlist = reinterpret_cast<IdDistPair_t *>(&stackspace);
if (lvol->GetDaughtersp()->size() == 0) return false;
int size;
ABBoxManager::ABBoxContainer_v bboxes = fABBoxManager.GetABBoxes_v(lvol, size);
auto ncandidates = GetHitCandidates_v(lvol, localpoint, localdir, bboxes, size, hitlist);
// sort candidates according to their bounding volume hit distance
insertionsort(hitlist, ncandidates);
for (size_t index = 0; index < ncandidates; ++index) {
auto &hitbox = hitlist[index];
VPlacedVolume const *candidate = LookupDaughter(lvol, hitbox.first);
// only consider those hitboxes which are within potential reach of this step
if (hitbox.second <= step) { // !(step < hitbox.second)) {
#ifdef VERBOSE
std::cerr << "SimpleABBoxNavigator: checking id " << hitbox.first << " at box distance " << hitbox.second
<< "\n";
#endif
// if( hitbox.second < 0 ){
// // std::cerr << "hit dist < 0. \n";
// bool checkindaughter = candidate->Contains( localpoint );
// if( checkindaughter == true ){
// std::cerr << " -- unexpected : in daughter vol \n";
//
// // need to relocate
// step = 0;
// hitcandidate = candidate;
// // THE ALTERNATIVE WOULD BE TO PUSH THE CURRENT STATE AND RETURN DIRECTLY
// break;
// }
// }
Precision ddistance = candidate->DistanceToIn(localpoint, localdir, step);
Vector3D<Precision> normal; // To reuse in printing below - else move it into 'if'
#ifdef VERBOSE
std::cerr << " . Distance to " << candidate->GetLabel() << " is " << ddistance;
#endif
if (ddistance <= 0. /* && candidate == blocked */) {
candidate->Normal(localpoint, normal);
#ifdef VERBOSE
std::cerr << " SimpleABBoxNavigator: Negative daughter dist = " << ddistance
<< (blocked == candidate ? " Is " : " Not ") << "Blocked. "
<< " normal= " << normal << " normal.dir= " << normal.Dot(localdir) << "\n";
#endif
}
const auto valid = !IsInf(ddistance) && ddistance < step &&
!((ddistance <= 0.) && (blocked == candidate || normal.Dot(localdir) > 0.0));
hitcandidate = valid ? candidate : hitcandidate;
step = valid ? ddistance : step;
} else {
break;
}
}
return false;
}
static VNavigator *Instance()
{
static SimpleABBoxNavigator instance;
return &instance;
}
static constexpr const char *gClassNameString = "SimpleABBoxNavigator";
typedef SimpleABBoxSafetyEstimator SafetyEstimator_t;
}; // end of class
}
} // end namespace
#endif /* NAVIGATION_SIMPLEABBOXNAVIGATOR_H_ */
|
