Home
last modified time | relevance | path

Searched refs:BVHN (Results 1 – 25 of 30) sorted by relevance

12

/dports/graphics/embree/embree-3.13.2/kernels/bvh/
H A Dbvh.cpp10 BVHN<N>::BVHN (const PrimitiveType& primTy, Scene* scene) in BVHN() function in embree::BVHN
18 BVHN<N>::~BVHN () in ~BVHN()
25 void BVHN<N>::clear() in clear()
27 set(BVHN::emptyNode,empty,0); in clear()
40 void BVHN<N>::clearBarrier(NodeRef& node) in clearBarrier()
52 void BVHN<N>::layoutLargeNodes(size_t num) in layoutLargeNodes()
94 …typename BVHN<N>::NodeRef BVHN<N>::layoutLargeNodesRecursion(NodeRef& node, const FastAllocator::C… in layoutLargeNodesRecursion()
103 … AABBNode* newnode = (BVHN::AABBNode*) allocator.malloc0(sizeof(BVHN::AABBNode),byteNodeAlignment); in layoutLargeNodesRecursion()
130 void BVHN<N>::postBuild(double t0) in postBuild()
183 template class BVHN<8>; variable
[all …]
H A Dbvh.h42 class BVHN : public AccelData
82 __forceinline CreateAlloc (BVHN* bvh) : FastAllocator::Create(&bvh->alloc) {} in CreateAlloc()
92 BVHN (const PrimitiveType& primTy, Scene* scene);
95 ~BVHN ();
118 BVHN* bvh;
119 Allocator (BVHN* bvh) : bvh(bvh) {} in Allocator()
229 std::vector<BVHN*> objects;
233 typedef BVHN<4> BVH4;
234 typedef BVHN<8> BVH8;
H A Dnode_intersector1.h222 const typename BVHN<N>::AABBNodeMB* node = ref.getAABBNodeMB();
226 const typename BVHN<N>::AABBNodeMB4D* node1 = (const typename BVHN<N>::AABBNodeMB4D*) node;
333 const typename BVHN<N>::AABBNodeMB* node = ref.getAABBNodeMB();
337 const typename BVHN<N>::AABBNodeMB4D* node1 = (const typename BVHN<N>::AABBNodeMB4D*) node;
593 const typename BVHN<N>::AABBNodeMB* node = ref.getAABBNodeMB();
625 const typename BVHN<N>::AABBNodeMB4D* node1 = (const typename BVHN<N>::AABBNodeMB4D*) node;
640 const typename BVHN<N>::AABBNodeMB* node = ref.getAABBNodeMB();
658 const typename BVHN<N>::AABBNodeMB4D* node1 = (const typename BVHN<N>::AABBNodeMB4D*) node;
1179 …mask = pointQueryNodeAABB((const typename BVHN<N>::QuantizedNode*)node.quantizedNode(), query, dis…
1351 … mask = intersectNode((const typename BVHN<N>::QuantizedNode*)node.quantizedNode(), ray, dist);
[all …]
H A Dbvh_traverser_stream.h17 typedef BVHN<N> BVH;
39 BVHN<N>::prefetch(cur,types); in traverseClosestHit()
52 BVHN<N>::prefetch(c1,types); in traverseClosestHit()
94 BVHN<N>::prefetch(cur,types); in traverseClosestHit()
122 BVHN<N>::prefetch(cur,types); in traverseAnyHit()
137 BVHN<N>::prefetch(cur,types); in traverseAnyHit()
H A Dnode_intersector_packet.h118 __forceinline vbool<K> intersectNodeK(const typename BVHN<N>::AABBNode* node, size_t i,
296 const typename BVHN<N>::AABBNodeMB* node = ref.getAABBNodeMB();
325 const typename BVHN<N>::AABBNodeMB4D* node1 = (const typename BVHN<N>::AABBNodeMB4D*) node;
340 const typename BVHN<N>::AABBNodeMB* node = ref.getAABBNodeMB();
363 const typename BVHN<N>::AABBNodeMB4D* node1 = (const typename BVHN<N>::AABBNodeMB4D*) node;
622 static __forceinline bool intersect(const typename BVHN<N>::NodeRef& node, size_t i,
633 static __forceinline bool intersect(const typename BVHN<N>::NodeRef& node, size_t i,
644 static __forceinline bool intersect(const typename BVHN<N>::NodeRef& node, size_t i,
655 static __forceinline bool intersect(const typename BVHN<N>::NodeRef& node, size_t i,
666 static __forceinline bool intersect(const typename BVHN<N>::NodeRef& node, size_t i,
[all …]
H A Dbvh_builder.cpp11 …typename BVHN<N>::NodeRef BVHNBuilderVirtual<N>::BVHNBuilderV::build(FastAllocator* allocator, Bui… in build()
25 …typename BVHN<N>::NodeRef BVHNBuilderQuantizedVirtual<N>::BVHNBuilderV::build(FastAllocator* alloc… in build()
38 …typename BVHN<N>::NodeRecordMB BVHNBuilderMblurVirtual<N>::BVHNBuilderV::build(FastAllocator* allo… in build()
H A Dbvh_builder.h20 typedef BVHN<N> BVH;
52 typedef BVHN<N> BVH;
84 typedef BVHN<N> BVH;
H A Dbvh_builder_sah_mb.cpp38 typedef BVHN<N> BVH;
68 typedef BVHN<N> BVH;
95 typedef BVHN<N> BVH;
96 typedef typename BVHN<N>::NodeRef NodeRef;
97 typedef typename BVHN<N>::NodeRecordMB NodeRecordMB;
98 typedef typename BVHN<N>::AABBNodeMB AABBNodeMB;
262 typedef BVHN<N> BVH;
337 typedef BVHN<N> BVH;
415 typedef BVHN<N> BVH;
416 typedef typename BVHN<N>::NodeRef NodeRef;
[all …]
H A Dbvh_refit.h18 typedef BVHN<N> BVH;
65 typedef BVHN<N> BVH;
H A Dbvh_collider.h17 typedef BVHN<N> BVH;
60 typedef BVHN<N> BVH;
H A Dbvh_builder_sah.cpp34 typedef BVHN<N> BVH;
59 typedef BVHN<N> BVH;
88 typedef BVHN<N> BVH;
89 typedef typename BVHN<N>::NodeRef NodeRef;
201 typedef BVHN<N> BVH;
202 typedef typename BVHN<N>::NodeRef NodeRef;
286 typedef BVHN<N> BVH;
350 typedef BVHN<N> BVH;
351 typedef typename BVHN<N>::NodeRef NodeRef;
H A Dbvh_builder_morton.cpp34 typedef BVHN<N> BVH;
85 typedef BVHN<N> BVH;
141 typedef BVHN<N> BVH;
195 typedef BVHN<N> BVH;
260 typedef BVHN<N> BVH;
317 typedef BVHN<N> BVH;
361 typedef BVHN<N> BVH;
419 typedef BVHN<N> BVH;
H A Dbvh_builder_subdiv.cpp35 typedef BVHN<N> BVH;
218 typedef BVHN<N> BVH;
221 typedef typename BVHN<N>::AABBNodeMB AABBNodeMB;
222 typedef typename BVHN<N>::AABBNodeMB4D AABBNodeMB4D;
223 typedef typename BVHN<N>::Allocator BVH_Allocator;
H A Dnode_intersector_packet_stream.h80 __forceinline size_t intersectNode1(const typename BVHN<N>::AABBNode* __restrict__ node,
105 … __forceinline size_t intersectNodeK(const typename BVHN<N>::AABBNode* __restrict__ node, size_t i,
136 __forceinline size_t intersectNode1(const typename BVHN<N>::AABBNode* __restrict__ node,
162 … __forceinline size_t intersectNodeK(const typename BVHN<N>::AABBNode* __restrict__ node, size_t i,
H A Dbvh_collider.cpp38 __forceinline size_t overlap(const BBox3fa& box0, const typename BVHN<N>::AABBNode& node1) in overlap()
171 BVHN<N>::prefetch(node0->child(i),BVH_FLAG_ALIGNED_NODE); in collide_recurse()
180 BVHN<N>::prefetch(node0->child(i),BVH_FLAG_ALIGNED_NODE); in collide_recurse()
198 BVHN<N>::prefetch(node1->child(i),BVH_FLAG_ALIGNED_NODE); in collide_recurse()
207 BVHN<N>::prefetch(node1->child(i),BVH_FLAG_ALIGNED_NODE); in collide_recurse()
H A Dbvh_rotate.h15 typedef typename BVHN<N>::NodeRef NodeRef;
H A Dbvh_intersector1.h21 typedef BVHN<N> BVH;
H A Dbvh_builder_sah_spatial.cpp31 typedef BVHN<N> BVH;
55 typedef BVHN<N> BVH;
H A Dbvh_intersector_hybrid.h25 typedef BVHN<N> BVH;
H A Dbvh_builder_hair_mb.cpp21 typedef BVHN<N> BVH;
H A Dbvh_refit.cpp22 … __forceinline bool compare(const typename BVHN<N>::NodeRef* a, const typename BVHN<N>::NodeRef* b) in compare()
H A Dnode_intersector_frustum.h184 __forceinline size_t intersectNodeFrustum(const typename BVHN<N>::AABBNode* __restrict__ node,
214 __forceinline size_t intersectNodeFrustum(const typename BVHN<N>::AABBNode* __restrict__ node,
H A Dbvh_builder_hair.cpp21 typedef BVHN<N> BVH;
H A Dbvh_intersector_stream.cpp353 BVHN<N>::prefetch(cur,types); in occludedIncoherent()
369 BVHN<N>::prefetch(cur,types); in occludedIncoherent()
/dports/graphics/embree/embree-3.13.2/kernels/geometry/
H A Dsubgrid.h354 __aligned(64) typename BVHN<N>::AABBNode node; in SubGridQBVHN()
378 typename BVHN<N>::QuantizedBaseNode qnode;
454 __aligned(64) typename BVHN<N>::AABBNode node0,node1; in SubGridMBQBVHN()
486 typename BVHN<N>::QuantizedBaseNodeMB qnode;

12