2014-12-16 15:11:37 +00:00
|
|
|
/*
|
|
|
|
* Adapted from code Copyright 2009-2010 NVIDIA Corporation,
|
|
|
|
* and code copyright 2009-2012 Intel Corporation
|
|
|
|
*
|
|
|
|
* Modifications Copyright 2011-2014, Blender Foundation.
|
|
|
|
*
|
|
|
|
* Licensed under the Apache License, Version 2.0 (the "License");
|
|
|
|
* you may not use this file except in compliance with the License.
|
|
|
|
* You may obtain a copy of the License at
|
|
|
|
*
|
|
|
|
* http://www.apache.org/licenses/LICENSE-2.0
|
|
|
|
*
|
|
|
|
* Unless required by applicable law or agreed to in writing, software
|
|
|
|
* distributed under the License is distributed on an "AS IS" BASIS,
|
|
|
|
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
|
|
|
* See the License for the specific language governing permissions and
|
|
|
|
* limitations under the License.
|
|
|
|
*/
|
|
|
|
|
|
|
|
/* This is a template BVH traversal function, where various features can be
|
|
|
|
* enabled/disabled. This way we can compile optimized versions for each case
|
|
|
|
* without new features slowing things down.
|
|
|
|
*
|
|
|
|
* BVH_INSTANCING: object instancing
|
|
|
|
* BVH_HAIR: hair curve rendering
|
|
|
|
* BVH_MOTION: motion blur rendering
|
|
|
|
*
|
|
|
|
*/
|
|
|
|
|
2016-07-07 10:23:13 +00:00
|
|
|
#if BVH_FEATURE(BVH_HAIR)
|
|
|
|
# define NODE_INTERSECT qbvh_node_intersect
|
|
|
|
#else
|
|
|
|
# define NODE_INTERSECT qbvh_aligned_node_intersect
|
|
|
|
#endif
|
|
|
|
|
2014-12-16 15:11:37 +00:00
|
|
|
ccl_device bool BVH_FUNCTION_FULL_NAME(QBVH)(KernelGlobals *kg,
|
|
|
|
const Ray *ray,
|
|
|
|
Intersection *isect_array,
|
|
|
|
const uint max_hits,
|
|
|
|
uint *num_hits)
|
|
|
|
{
|
|
|
|
/* TODO(sergey):
|
|
|
|
* - Likely and unlikely for if() statements.
|
|
|
|
* - Test restrict attribute for pointers.
|
|
|
|
*/
|
|
|
|
|
|
|
|
/* Traversal stack in CUDA thread-local memory. */
|
2016-07-11 11:44:19 +00:00
|
|
|
QBVHStackItem traversal_stack[BVH_QSTACK_SIZE];
|
|
|
|
traversal_stack[0].addr = ENTRYPOINT_SENTINEL;
|
2014-12-16 15:11:37 +00:00
|
|
|
|
|
|
|
/* Traversal variables in registers. */
|
2016-07-11 11:44:19 +00:00
|
|
|
int stack_ptr = 0;
|
|
|
|
int node_addr = kernel_data.bvh.root;
|
2014-12-16 15:11:37 +00:00
|
|
|
|
|
|
|
/* Ray parameters in registers. */
|
|
|
|
const float tmax = ray->t;
|
|
|
|
float3 P = ray->P;
|
|
|
|
float3 dir = bvh_clamp_direction(ray->D);
|
|
|
|
float3 idir = bvh_inverse_direction(dir);
|
|
|
|
int object = OBJECT_NONE;
|
|
|
|
float isect_t = tmax;
|
|
|
|
|
|
|
|
#if BVH_FEATURE(BVH_MOTION)
|
2015-10-08 16:24:54 +00:00
|
|
|
Transform ob_itfm;
|
2014-12-16 15:11:37 +00:00
|
|
|
#endif
|
|
|
|
|
2015-07-13 13:53:48 +00:00
|
|
|
*num_hits = 0;
|
|
|
|
isect_array->t = tmax;
|
|
|
|
|
2015-02-10 12:31:55 +00:00
|
|
|
#ifndef __KERNEL_SSE41__
|
|
|
|
if(!isfinite(P.x)) {
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
2014-12-16 15:11:37 +00:00
|
|
|
#if BVH_FEATURE(BVH_INSTANCING)
|
|
|
|
int num_hits_in_instance = 0;
|
|
|
|
#endif
|
|
|
|
|
|
|
|
ssef tnear(0.0f), tfar(tmax);
|
2016-07-07 10:23:13 +00:00
|
|
|
#if BVH_FEATURE(BVH_HAIR)
|
|
|
|
sse3f dir4(ssef(dir.x), ssef(dir.y), ssef(dir.z));
|
|
|
|
#endif
|
2014-12-16 15:11:37 +00:00
|
|
|
sse3f idir4(ssef(idir.x), ssef(idir.y), ssef(idir.z));
|
|
|
|
|
|
|
|
#ifdef __KERNEL_AVX2__
|
|
|
|
float3 P_idir = P*idir;
|
2016-07-07 10:23:13 +00:00
|
|
|
sse3f P_idir4(P_idir.x, P_idir.y, P_idir.z);
|
|
|
|
#endif
|
|
|
|
#if BVH_FEATURE(BVH_HAIR) || !defined(__KERNEL_AVX2__)
|
|
|
|
sse3f org4(ssef(P.x), ssef(P.y), ssef(P.z));
|
2014-12-16 15:11:37 +00:00
|
|
|
#endif
|
|
|
|
|
|
|
|
/* Offsets to select the side that becomes the lower or upper bound. */
|
|
|
|
int near_x, near_y, near_z;
|
|
|
|
int far_x, far_y, far_z;
|
|
|
|
|
|
|
|
if(idir.x >= 0.0f) { near_x = 0; far_x = 1; } else { near_x = 1; far_x = 0; }
|
|
|
|
if(idir.y >= 0.0f) { near_y = 2; far_y = 3; } else { near_y = 3; far_y = 2; }
|
|
|
|
if(idir.z >= 0.0f) { near_z = 4; far_z = 5; } else { near_z = 5; far_z = 4; }
|
|
|
|
|
|
|
|
IsectPrecalc isect_precalc;
|
|
|
|
triangle_intersect_precalc(dir, &isect_precalc);
|
|
|
|
|
|
|
|
/* Traversal loop. */
|
|
|
|
do {
|
|
|
|
do {
|
|
|
|
/* Traverse internal nodes. */
|
2016-07-11 11:44:19 +00:00
|
|
|
while(node_addr >= 0 && node_addr != ENTRYPOINT_SENTINEL) {
|
|
|
|
float4 inodes = kernel_tex_fetch(__bvh_nodes, node_addr+0);
|
2016-06-10 08:14:05 +00:00
|
|
|
|
|
|
|
#ifdef __VISIBILITY_FLAG__
|
|
|
|
if((__float_as_uint(inodes.x) & PATH_RAY_SHADOW) == 0) {
|
|
|
|
/* Pop. */
|
2016-07-11 11:44:19 +00:00
|
|
|
node_addr = traversal_stack[stack_ptr].addr;
|
|
|
|
--stack_ptr;
|
2016-06-10 08:14:05 +00:00
|
|
|
continue;
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
2014-12-16 15:11:37 +00:00
|
|
|
ssef dist;
|
2016-07-11 11:44:19 +00:00
|
|
|
int child_mask = NODE_INTERSECT(kg,
|
|
|
|
tnear,
|
|
|
|
tfar,
|
2014-12-16 15:11:37 +00:00
|
|
|
#ifdef __KERNEL_AVX2__
|
2016-07-11 11:44:19 +00:00
|
|
|
P_idir4,
|
2014-12-16 15:11:37 +00:00
|
|
|
#endif
|
2016-07-07 10:23:13 +00:00
|
|
|
# if BVH_FEATURE(BVH_HAIR) || !defined(__KERNEL_AVX2__)
|
2016-07-11 11:44:19 +00:00
|
|
|
org4,
|
2016-07-07 10:23:13 +00:00
|
|
|
# endif
|
|
|
|
# if BVH_FEATURE(BVH_HAIR)
|
2016-07-11 11:44:19 +00:00
|
|
|
dir4,
|
2016-07-07 10:23:13 +00:00
|
|
|
# endif
|
2016-07-11 11:44:19 +00:00
|
|
|
idir4,
|
|
|
|
near_x, near_y, near_z,
|
|
|
|
far_x, far_y, far_z,
|
|
|
|
node_addr,
|
|
|
|
&dist);
|
2014-12-16 15:11:37 +00:00
|
|
|
|
2016-07-11 11:44:19 +00:00
|
|
|
if(child_mask != 0) {
|
2016-07-07 10:23:13 +00:00
|
|
|
float4 cnodes;
|
|
|
|
#if BVH_FEATURE(BVH_HAIR)
|
|
|
|
if(__float_as_uint(inodes.x) & PATH_RAY_NODE_UNALIGNED) {
|
2016-07-11 11:44:19 +00:00
|
|
|
cnodes = kernel_tex_fetch(__bvh_nodes, node_addr+13);
|
2016-07-07 10:23:13 +00:00
|
|
|
}
|
|
|
|
else
|
|
|
|
#endif
|
|
|
|
{
|
2016-07-11 11:44:19 +00:00
|
|
|
cnodes = kernel_tex_fetch(__bvh_nodes, node_addr+7);
|
2016-07-07 10:23:13 +00:00
|
|
|
}
|
2014-12-16 15:11:37 +00:00
|
|
|
|
|
|
|
/* One child is hit, continue with that child. */
|
2016-07-11 11:44:19 +00:00
|
|
|
int r = __bscf(child_mask);
|
|
|
|
if(child_mask == 0) {
|
|
|
|
node_addr = __float_as_int(cnodes[r]);
|
2014-12-16 15:11:37 +00:00
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Two children are hit, push far child, and continue with
|
|
|
|
* closer child.
|
|
|
|
*/
|
|
|
|
int c0 = __float_as_int(cnodes[r]);
|
|
|
|
float d0 = ((float*)&dist)[r];
|
2016-07-11 11:44:19 +00:00
|
|
|
r = __bscf(child_mask);
|
2014-12-16 15:11:37 +00:00
|
|
|
int c1 = __float_as_int(cnodes[r]);
|
|
|
|
float d1 = ((float*)&dist)[r];
|
2016-07-11 11:44:19 +00:00
|
|
|
if(child_mask == 0) {
|
2014-12-16 15:11:37 +00:00
|
|
|
if(d1 < d0) {
|
2016-07-11 11:44:19 +00:00
|
|
|
node_addr = c1;
|
|
|
|
++stack_ptr;
|
|
|
|
kernel_assert(stack_ptr < BVH_QSTACK_SIZE);
|
|
|
|
traversal_stack[stack_ptr].addr = c0;
|
|
|
|
traversal_stack[stack_ptr].dist = d0;
|
2014-12-16 15:11:37 +00:00
|
|
|
continue;
|
|
|
|
}
|
|
|
|
else {
|
2016-07-11 11:44:19 +00:00
|
|
|
node_addr = c0;
|
|
|
|
++stack_ptr;
|
|
|
|
kernel_assert(stack_ptr < BVH_QSTACK_SIZE);
|
|
|
|
traversal_stack[stack_ptr].addr = c1;
|
|
|
|
traversal_stack[stack_ptr].dist = d1;
|
2014-12-16 15:11:37 +00:00
|
|
|
continue;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Here starts the slow path for 3 or 4 hit children. We push
|
|
|
|
* all nodes onto the stack to sort them there.
|
|
|
|
*/
|
2016-07-11 11:44:19 +00:00
|
|
|
++stack_ptr;
|
|
|
|
kernel_assert(stack_ptr < BVH_QSTACK_SIZE);
|
|
|
|
traversal_stack[stack_ptr].addr = c1;
|
|
|
|
traversal_stack[stack_ptr].dist = d1;
|
|
|
|
++stack_ptr;
|
|
|
|
kernel_assert(stack_ptr < BVH_QSTACK_SIZE);
|
|
|
|
traversal_stack[stack_ptr].addr = c0;
|
|
|
|
traversal_stack[stack_ptr].dist = d0;
|
2014-12-16 15:11:37 +00:00
|
|
|
|
|
|
|
/* Three children are hit, push all onto stack and sort 3
|
|
|
|
* stack items, continue with closest child.
|
|
|
|
*/
|
2016-07-11 11:44:19 +00:00
|
|
|
r = __bscf(child_mask);
|
2014-12-16 15:11:37 +00:00
|
|
|
int c2 = __float_as_int(cnodes[r]);
|
|
|
|
float d2 = ((float*)&dist)[r];
|
2016-07-11 11:44:19 +00:00
|
|
|
if(child_mask == 0) {
|
|
|
|
++stack_ptr;
|
|
|
|
kernel_assert(stack_ptr < BVH_QSTACK_SIZE);
|
|
|
|
traversal_stack[stack_ptr].addr = c2;
|
|
|
|
traversal_stack[stack_ptr].dist = d2;
|
|
|
|
qbvh_stack_sort(&traversal_stack[stack_ptr],
|
|
|
|
&traversal_stack[stack_ptr - 1],
|
|
|
|
&traversal_stack[stack_ptr - 2]);
|
|
|
|
node_addr = traversal_stack[stack_ptr].addr;
|
|
|
|
--stack_ptr;
|
2014-12-16 15:11:37 +00:00
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Four children are hit, push all onto stack and sort 4
|
|
|
|
* stack items, continue with closest child.
|
|
|
|
*/
|
2016-07-11 11:44:19 +00:00
|
|
|
r = __bscf(child_mask);
|
2014-12-16 15:11:37 +00:00
|
|
|
int c3 = __float_as_int(cnodes[r]);
|
|
|
|
float d3 = ((float*)&dist)[r];
|
2016-07-11 11:44:19 +00:00
|
|
|
++stack_ptr;
|
|
|
|
kernel_assert(stack_ptr < BVH_QSTACK_SIZE);
|
|
|
|
traversal_stack[stack_ptr].addr = c3;
|
|
|
|
traversal_stack[stack_ptr].dist = d3;
|
|
|
|
++stack_ptr;
|
|
|
|
kernel_assert(stack_ptr < BVH_QSTACK_SIZE);
|
|
|
|
traversal_stack[stack_ptr].addr = c2;
|
|
|
|
traversal_stack[stack_ptr].dist = d2;
|
|
|
|
qbvh_stack_sort(&traversal_stack[stack_ptr],
|
|
|
|
&traversal_stack[stack_ptr - 1],
|
|
|
|
&traversal_stack[stack_ptr - 2],
|
|
|
|
&traversal_stack[stack_ptr - 3]);
|
2014-12-16 15:11:37 +00:00
|
|
|
}
|
|
|
|
|
2016-07-11 11:44:19 +00:00
|
|
|
node_addr = traversal_stack[stack_ptr].addr;
|
|
|
|
--stack_ptr;
|
2014-12-16 15:11:37 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/* If node is leaf, fetch triangle list. */
|
2016-07-11 11:44:19 +00:00
|
|
|
if(node_addr < 0) {
|
|
|
|
float4 leaf = kernel_tex_fetch(__bvh_leaf_nodes, (-node_addr-1));
|
2014-12-27 18:33:50 +00:00
|
|
|
#ifdef __VISIBILITY_FLAG__
|
|
|
|
if((__float_as_uint(leaf.z) & PATH_RAY_SHADOW) == 0) {
|
|
|
|
/* Pop. */
|
2016-07-11 11:44:19 +00:00
|
|
|
node_addr = traversal_stack[stack_ptr].addr;
|
|
|
|
--stack_ptr;
|
2014-12-27 18:33:50 +00:00
|
|
|
continue;
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
2016-07-11 11:44:19 +00:00
|
|
|
int prim_addr = __float_as_int(leaf.x);
|
2014-12-16 15:11:37 +00:00
|
|
|
|
|
|
|
#if BVH_FEATURE(BVH_INSTANCING)
|
2016-07-11 11:44:19 +00:00
|
|
|
if(prim_addr >= 0) {
|
2014-12-16 15:11:37 +00:00
|
|
|
#endif
|
2016-07-11 11:44:19 +00:00
|
|
|
int prim_addr2 = __float_as_int(leaf.y);
|
2015-01-10 17:41:49 +00:00
|
|
|
const uint type = __float_as_int(leaf.w);
|
|
|
|
const uint p_type = type & PRIMITIVE_ALL;
|
2014-12-16 15:11:37 +00:00
|
|
|
|
|
|
|
/* Pop. */
|
2016-07-11 11:44:19 +00:00
|
|
|
node_addr = traversal_stack[stack_ptr].addr;
|
|
|
|
--stack_ptr;
|
2014-12-16 15:11:37 +00:00
|
|
|
|
|
|
|
/* Primitive intersection. */
|
2016-07-11 11:44:19 +00:00
|
|
|
while(prim_addr < prim_addr2) {
|
|
|
|
kernel_assert(kernel_tex_fetch(__prim_type, prim_addr) == type);
|
2015-01-11 21:04:35 +00:00
|
|
|
|
2014-12-16 15:11:37 +00:00
|
|
|
bool hit;
|
|
|
|
|
|
|
|
/* todo: specialized intersect functions which don't fill in
|
|
|
|
* isect unless needed and check SD_HAS_TRANSPARENT_SHADOW?
|
|
|
|
* might give a few % performance improvement */
|
|
|
|
|
2015-01-10 17:41:49 +00:00
|
|
|
switch(p_type) {
|
2014-12-16 15:11:37 +00:00
|
|
|
case PRIMITIVE_TRIANGLE: {
|
2016-07-11 11:44:19 +00:00
|
|
|
hit = triangle_intersect(kg,
|
|
|
|
&isect_precalc,
|
|
|
|
isect_array,
|
|
|
|
P,
|
|
|
|
PATH_RAY_SHADOW,
|
|
|
|
object,
|
|
|
|
prim_addr);
|
2014-12-16 15:11:37 +00:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
#if BVH_FEATURE(BVH_MOTION)
|
|
|
|
case PRIMITIVE_MOTION_TRIANGLE: {
|
2016-07-11 11:44:19 +00:00
|
|
|
hit = motion_triangle_intersect(kg,
|
|
|
|
isect_array,
|
|
|
|
P,
|
|
|
|
dir,
|
|
|
|
ray->time,
|
|
|
|
PATH_RAY_SHADOW,
|
|
|
|
object,
|
|
|
|
prim_addr);
|
2014-12-16 15:11:37 +00:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
#if BVH_FEATURE(BVH_HAIR)
|
|
|
|
case PRIMITIVE_CURVE:
|
|
|
|
case PRIMITIVE_MOTION_CURVE: {
|
2016-07-11 11:44:19 +00:00
|
|
|
if(kernel_data.curve.curveflags & CURVE_KN_INTERPOLATE) {
|
|
|
|
hit = bvh_cardinal_curve_intersect(kg,
|
|
|
|
isect_array,
|
|
|
|
P,
|
|
|
|
dir,
|
|
|
|
PATH_RAY_SHADOW,
|
|
|
|
object,
|
|
|
|
prim_addr,
|
|
|
|
ray->time,
|
|
|
|
type,
|
|
|
|
NULL,
|
|
|
|
0, 0);
|
|
|
|
}
|
|
|
|
else {
|
|
|
|
hit = bvh_curve_intersect(kg,
|
|
|
|
isect_array,
|
|
|
|
P,
|
|
|
|
dir,
|
|
|
|
PATH_RAY_SHADOW,
|
|
|
|
object,
|
|
|
|
prim_addr,
|
|
|
|
ray->time,
|
|
|
|
type,
|
|
|
|
NULL,
|
|
|
|
0, 0);
|
|
|
|
}
|
2014-12-16 15:11:37 +00:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
default: {
|
|
|
|
hit = false;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Shadow ray early termination. */
|
|
|
|
if(hit) {
|
2016-07-11 15:58:42 +00:00
|
|
|
/* Update number of hits now, so we do proper check on max bounces. */
|
|
|
|
(*num_hits)++;
|
|
|
|
|
2014-12-16 15:11:37 +00:00
|
|
|
/* detect if this surface has a shader with transparent shadows */
|
|
|
|
|
|
|
|
/* todo: optimize so primitive visibility flag indicates if
|
|
|
|
* the primitive has a transparent shadow shader? */
|
|
|
|
int prim = kernel_tex_fetch(__prim_index, isect_array->prim);
|
|
|
|
int shader = 0;
|
|
|
|
|
|
|
|
#ifdef __HAIR__
|
|
|
|
if(kernel_tex_fetch(__prim_type, isect_array->prim) & PRIMITIVE_ALL_TRIANGLE)
|
|
|
|
#endif
|
|
|
|
{
|
2015-04-06 19:25:54 +00:00
|
|
|
shader = kernel_tex_fetch(__tri_shader, prim);
|
2014-12-16 15:11:37 +00:00
|
|
|
}
|
|
|
|
#ifdef __HAIR__
|
|
|
|
else {
|
|
|
|
float4 str = kernel_tex_fetch(__curves, prim);
|
|
|
|
shader = __float_as_int(str.z);
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
int flag = kernel_tex_fetch(__shader_flag, (shader & SHADER_MASK)*2);
|
|
|
|
|
|
|
|
/* if no transparent shadows, all light is blocked */
|
|
|
|
if(!(flag & SD_HAS_TRANSPARENT_SHADOW)) {
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
/* if maximum number of hits reached, block all light */
|
|
|
|
else if(*num_hits == max_hits) {
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
#if BVH_FEATURE(BVH_INSTANCING)
|
|
|
|
num_hits_in_instance++;
|
|
|
|
#endif
|
2016-07-11 15:58:42 +00:00
|
|
|
/* Move on to next entry in intersections array */
|
|
|
|
isect_array++;
|
2014-12-16 15:11:37 +00:00
|
|
|
isect_array->t = isect_t;
|
|
|
|
}
|
|
|
|
|
2016-07-11 11:44:19 +00:00
|
|
|
prim_addr++;
|
2014-12-16 15:11:37 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
#if BVH_FEATURE(BVH_INSTANCING)
|
|
|
|
else {
|
|
|
|
/* Instance push. */
|
2016-07-11 11:44:19 +00:00
|
|
|
object = kernel_tex_fetch(__prim_object, -prim_addr-1);
|
2014-12-16 15:11:37 +00:00
|
|
|
|
2016-02-12 17:33:43 +00:00
|
|
|
# if BVH_FEATURE(BVH_MOTION)
|
2015-10-08 16:24:54 +00:00
|
|
|
bvh_instance_motion_push(kg, object, ray, &P, &dir, &idir, &isect_t, &ob_itfm);
|
2016-02-12 17:33:43 +00:00
|
|
|
# else
|
2014-12-16 15:11:37 +00:00
|
|
|
bvh_instance_push(kg, object, ray, &P, &dir, &idir, &isect_t);
|
2016-02-12 17:33:43 +00:00
|
|
|
# endif
|
2014-12-16 15:11:37 +00:00
|
|
|
|
|
|
|
num_hits_in_instance = 0;
|
|
|
|
isect_array->t = isect_t;
|
|
|
|
|
|
|
|
if(idir.x >= 0.0f) { near_x = 0; far_x = 1; } else { near_x = 1; far_x = 0; }
|
|
|
|
if(idir.y >= 0.0f) { near_y = 2; far_y = 3; } else { near_y = 3; far_y = 2; }
|
|
|
|
if(idir.z >= 0.0f) { near_z = 4; far_z = 5; } else { near_z = 5; far_z = 4; }
|
|
|
|
tfar = ssef(isect_t);
|
2016-07-07 10:23:13 +00:00
|
|
|
# if BVH_FEATURE(BVH_HAIR)
|
|
|
|
dir4 = sse3f(ssef(dir.x), ssef(dir.y), ssef(dir.z));
|
|
|
|
# endif
|
2014-12-16 15:11:37 +00:00
|
|
|
idir4 = sse3f(ssef(idir.x), ssef(idir.y), ssef(idir.z));
|
2016-02-12 17:33:43 +00:00
|
|
|
# ifdef __KERNEL_AVX2__
|
2014-12-16 15:11:37 +00:00
|
|
|
P_idir = P*idir;
|
|
|
|
P_idir4 = sse3f(P_idir.x, P_idir.y, P_idir.z);
|
2016-02-12 17:33:43 +00:00
|
|
|
# endif
|
2016-07-07 10:23:13 +00:00
|
|
|
# if BVH_FEATURE(BVH_HAIR) || !defined(__KERNEL_AVX2__)
|
|
|
|
org4 = sse3f(ssef(P.x), ssef(P.y), ssef(P.z));
|
|
|
|
# endif
|
|
|
|
|
2014-12-16 15:11:37 +00:00
|
|
|
triangle_intersect_precalc(dir, &isect_precalc);
|
|
|
|
|
2016-07-11 11:44:19 +00:00
|
|
|
++stack_ptr;
|
|
|
|
kernel_assert(stack_ptr < BVH_QSTACK_SIZE);
|
|
|
|
traversal_stack[stack_ptr].addr = ENTRYPOINT_SENTINEL;
|
2014-12-16 15:11:37 +00:00
|
|
|
|
2016-07-11 11:44:19 +00:00
|
|
|
node_addr = kernel_tex_fetch(__object_node, object);
|
2014-12-16 15:11:37 +00:00
|
|
|
|
|
|
|
}
|
|
|
|
}
|
|
|
|
#endif /* FEATURE(BVH_INSTANCING) */
|
2016-07-11 11:44:19 +00:00
|
|
|
} while(node_addr != ENTRYPOINT_SENTINEL);
|
2014-12-16 15:11:37 +00:00
|
|
|
|
|
|
|
#if BVH_FEATURE(BVH_INSTANCING)
|
2016-07-11 11:44:19 +00:00
|
|
|
if(stack_ptr >= 0) {
|
2014-12-16 15:11:37 +00:00
|
|
|
kernel_assert(object != OBJECT_NONE);
|
|
|
|
|
|
|
|
if(num_hits_in_instance) {
|
|
|
|
float t_fac;
|
|
|
|
|
2016-02-12 17:33:43 +00:00
|
|
|
# if BVH_FEATURE(BVH_MOTION)
|
2015-10-08 16:24:54 +00:00
|
|
|
bvh_instance_motion_pop_factor(kg, object, ray, &P, &dir, &idir, &t_fac, &ob_itfm);
|
2016-02-12 17:33:43 +00:00
|
|
|
# else
|
2014-12-16 15:11:37 +00:00
|
|
|
bvh_instance_pop_factor(kg, object, ray, &P, &dir, &idir, &t_fac);
|
2016-02-12 17:33:43 +00:00
|
|
|
# endif
|
2014-12-16 15:11:37 +00:00
|
|
|
|
|
|
|
/* scale isect->t to adjust for instancing */
|
|
|
|
for(int i = 0; i < num_hits_in_instance; i++)
|
|
|
|
(isect_array-i-1)->t *= t_fac;
|
|
|
|
}
|
|
|
|
else {
|
|
|
|
float ignore_t = FLT_MAX;
|
|
|
|
|
2016-02-12 17:33:43 +00:00
|
|
|
# if BVH_FEATURE(BVH_MOTION)
|
2015-10-08 16:24:54 +00:00
|
|
|
bvh_instance_motion_pop(kg, object, ray, &P, &dir, &idir, &ignore_t, &ob_itfm);
|
2016-02-12 17:33:43 +00:00
|
|
|
# else
|
2014-12-16 15:11:37 +00:00
|
|
|
bvh_instance_pop(kg, object, ray, &P, &dir, &idir, &ignore_t);
|
2016-02-12 17:33:43 +00:00
|
|
|
# endif
|
2014-12-16 15:11:37 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
isect_t = tmax;
|
|
|
|
isect_array->t = isect_t;
|
|
|
|
|
|
|
|
if(idir.x >= 0.0f) { near_x = 0; far_x = 1; } else { near_x = 1; far_x = 0; }
|
|
|
|
if(idir.y >= 0.0f) { near_y = 2; far_y = 3; } else { near_y = 3; far_y = 2; }
|
|
|
|
if(idir.z >= 0.0f) { near_z = 4; far_z = 5; } else { near_z = 5; far_z = 4; }
|
|
|
|
tfar = ssef(tmax);
|
2016-07-07 10:23:13 +00:00
|
|
|
# if BVH_FEATURE(BVH_HAIR)
|
|
|
|
dir4 = sse3f(ssef(dir.x), ssef(dir.y), ssef(dir.z));
|
|
|
|
# endif
|
2014-12-16 15:11:37 +00:00
|
|
|
idir4 = sse3f(ssef(idir.x), ssef(idir.y), ssef(idir.z));
|
2016-02-12 17:33:43 +00:00
|
|
|
# ifdef __KERNEL_AVX2__
|
2014-12-16 15:11:37 +00:00
|
|
|
P_idir = P*idir;
|
|
|
|
P_idir4 = sse3f(P_idir.x, P_idir.y, P_idir.z);
|
2016-02-12 17:33:43 +00:00
|
|
|
# endif
|
2016-07-07 10:23:13 +00:00
|
|
|
# if BVH_FEATURE(BVH_HAIR) || !defined(__KERNEL_AVX2__)
|
|
|
|
org4 = sse3f(ssef(P.x), ssef(P.y), ssef(P.z));
|
|
|
|
# endif
|
|
|
|
|
2014-12-16 15:11:37 +00:00
|
|
|
triangle_intersect_precalc(dir, &isect_precalc);
|
|
|
|
|
|
|
|
object = OBJECT_NONE;
|
2016-07-11 11:44:19 +00:00
|
|
|
node_addr = traversal_stack[stack_ptr].addr;
|
|
|
|
--stack_ptr;
|
2014-12-16 15:11:37 +00:00
|
|
|
}
|
|
|
|
#endif /* FEATURE(BVH_INSTANCING) */
|
2016-07-11 11:44:19 +00:00
|
|
|
} while(node_addr != ENTRYPOINT_SENTINEL);
|
2014-12-16 15:11:37 +00:00
|
|
|
|
|
|
|
return false;
|
|
|
|
}
|
2016-07-07 10:23:13 +00:00
|
|
|
|
|
|
|
#undef NODE_INTERSECT
|