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
|
// Copyright 2009-2020 Intel Corporation
// SPDX-License-Identifier: Apache-2.0
#pragma once
#include "bvh.h"
#include "../common/ray.h"
#include "../common/stack_item.h"
namespace embree
{
namespace isa
{
template<int N, int Nx, int types>
class BVHNNodeTraverserStreamHitCoherent
{
typedef BVHN<N> BVH;
typedef typename BVH::NodeRef NodeRef;
typedef typename BVH::BaseNode BaseNode;
public:
template<class T>
static __forceinline void traverseClosestHit(NodeRef& cur,
size_t& m_trav_active,
const vbool<Nx>& vmask,
const vfloat<Nx>& tNear,
const T* const tMask,
StackItemMaskCoherent*& stackPtr)
{
const NodeRef parent = cur;
size_t mask = movemask(vmask);
assert(mask != 0);
const BaseNode* node = cur.baseNode();
/*! one child is hit, continue with that child */
const size_t r0 = bscf(mask);
assert(r0 < 8);
cur = node->child(r0);
BVHN<N>::prefetch(cur,types);
m_trav_active = tMask[r0];
assert(cur != BVH::emptyNode);
if (unlikely(mask == 0)) return;
const unsigned int* const tNear_i = (unsigned int*)&tNear;
/*! two children are hit, push far child, and continue with closer child */
NodeRef c0 = cur;
unsigned int d0 = tNear_i[r0];
const size_t r1 = bscf(mask);
assert(r1 < 8);
NodeRef c1 = node->child(r1);
BVHN<N>::prefetch(c1,types);
unsigned int d1 = tNear_i[r1];
assert(c0 != BVH::emptyNode);
assert(c1 != BVH::emptyNode);
if (likely(mask == 0)) {
if (d0 < d1) {
assert(tNear[r1] >= 0.0f);
stackPtr->mask = tMask[r1];
stackPtr->parent = parent;
stackPtr->child = c1;
stackPtr++;
cur = c0;
m_trav_active = tMask[r0];
return;
}
else {
assert(tNear[r0] >= 0.0f);
stackPtr->mask = tMask[r0];
stackPtr->parent = parent;
stackPtr->child = c0;
stackPtr++;
cur = c1;
m_trav_active = tMask[r1];
return;
}
}
/*! slow path for more than two hits */
size_t hits = movemask(vmask);
const vint<Nx> dist_i = select(vmask, (asInt(tNear) & 0xfffffff8) | vint<Nx>(step), 0);
#if defined(__AVX512F__) && !defined(__AVX512VL__) // KNL
const vint<N> tmp = extractN<N,0>(dist_i);
const vint<Nx> dist_i_sorted = usort_descending(tmp);
#else
const vint<Nx> dist_i_sorted = usort_descending(dist_i);
#endif
const vint<Nx> sorted_index = dist_i_sorted & 7;
size_t i = 0;
for (;;)
{
const unsigned int index = sorted_index[i];
assert(index < 8);
cur = node->child(index);
m_trav_active = tMask[index];
assert(m_trav_active);
BVHN<N>::prefetch(cur,types);
bscf(hits);
if (unlikely(hits==0)) break;
i++;
assert(cur != BVH::emptyNode);
assert(tNear[index] >= 0.0f);
stackPtr->mask = m_trav_active;
stackPtr->parent = parent;
stackPtr->child = cur;
stackPtr++;
}
}
template<class T>
static __forceinline void traverseAnyHit(NodeRef& cur,
size_t& m_trav_active,
const vbool<Nx>& vmask,
const T* const tMask,
StackItemMaskCoherent*& stackPtr)
{
const NodeRef parent = cur;
size_t mask = movemask(vmask);
assert(mask != 0);
const BaseNode* node = cur.baseNode();
/*! one child is hit, continue with that child */
size_t r = bscf(mask);
cur = node->child(r);
BVHN<N>::prefetch(cur,types);
m_trav_active = tMask[r];
/* simple in order sequence */
assert(cur != BVH::emptyNode);
if (likely(mask == 0)) return;
stackPtr->mask = m_trav_active;
stackPtr->parent = parent;
stackPtr->child = cur;
stackPtr++;
for (; ;)
{
r = bscf(mask);
cur = node->child(r);
BVHN<N>::prefetch(cur,types);
m_trav_active = tMask[r];
assert(cur != BVH::emptyNode);
if (likely(mask == 0)) return;
stackPtr->mask = m_trav_active;
stackPtr->parent = parent;
stackPtr->child = cur;
stackPtr++;
}
}
};
}
}
|