323 lines
10 KiB
C
323 lines
10 KiB
C
/*
|
|
* Copyright 2011-2013 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.
|
|
*/
|
|
|
|
CCL_NAMESPACE_BEGIN
|
|
|
|
/* Attenuate throughput accordingly to the given intersection event.
|
|
* Returns true if the throughput is zero and traversal can be aborted.
|
|
*/
|
|
ccl_device_inline bool shadow_handle_transparent_isect(KernelGlobals *kg,
|
|
ShaderData *shadow_sd,
|
|
PathState *state,
|
|
Intersection *isect,
|
|
Ray *ray,
|
|
float3 *throughput)
|
|
{
|
|
#ifdef __VOLUME__
|
|
/* Attenuation between last surface and next surface. */
|
|
if(state->volume_stack[0].shader != SHADER_NONE) {
|
|
Ray segment_ray = *ray;
|
|
segment_ray.t = isect->t;
|
|
kernel_volume_shadow(kg, shadow_sd, state, &segment_ray, throughput);
|
|
}
|
|
#endif
|
|
|
|
/* Setup shader data at surface. */
|
|
shader_setup_from_ray(kg, shadow_sd, isect, ray);
|
|
|
|
/* Attenuation from transparent surface. */
|
|
if(!(shadow_sd->flag & SD_HAS_ONLY_VOLUME)) {
|
|
path_state_modify_bounce(state, true);
|
|
shader_eval_surface(kg,
|
|
shadow_sd,
|
|
NULL,
|
|
state,
|
|
0.0f,
|
|
PATH_RAY_SHADOW,
|
|
SHADER_CONTEXT_SHADOW);
|
|
path_state_modify_bounce(state, false);
|
|
*throughput *= shader_bsdf_transparency(kg, shadow_sd);
|
|
}
|
|
|
|
/* Stop if all light is blocked. */
|
|
if(is_zero(*throughput)) {
|
|
return true;
|
|
}
|
|
|
|
#ifdef __VOLUME__
|
|
/* Exit/enter volume. */
|
|
kernel_volume_stack_enter_exit(kg, shadow_sd, state->volume_stack);
|
|
#endif
|
|
|
|
return false;
|
|
}
|
|
|
|
#ifdef __SHADOW_RECORD_ALL__
|
|
|
|
ccl_device_inline void sort_intersections(Intersection *hits, uint num_hits)
|
|
{
|
|
#ifdef __KERNEL_GPU__
|
|
/* Use bubble sort which has more friendly memory pattern on GPU. */
|
|
int i, j;
|
|
for(i = 0; i < num_hits; ++i) {
|
|
for(j = 0; j < num_hits - 1; ++j) {
|
|
if(hits[j].t < hits[j + 1].t) {
|
|
Intersection tmp = hits[j];
|
|
hits[j] = hits[j + 1];
|
|
hits[j + 1] = tmp;
|
|
}
|
|
}
|
|
}
|
|
#else
|
|
qsort(hits, num_hits, sizeof(Intersection), intersections_compare);
|
|
#endif
|
|
}
|
|
|
|
/* Shadow function to compute how much light is blocked, CPU variation.
|
|
*
|
|
* We trace a single ray. If it hits any opaque surface, or more than a given
|
|
* number of transparent surfaces is hit, then we consider the geometry to be
|
|
* entirely blocked. If not, all transparent surfaces will be recorded and we
|
|
* will shade them one by one to determine how much light is blocked. This all
|
|
* happens in one scene intersection function.
|
|
*
|
|
* Recording all hits works well in some cases but may be slower in others. If
|
|
* we have many semi-transparent hairs, one intersection may be faster because
|
|
* you'd be reinteresecting the same hairs a lot with each step otherwise. If
|
|
* however there is mostly binary transparency then we may be recording many
|
|
* unnecessary intersections when one of the first surfaces blocks all light.
|
|
*
|
|
* From tests in real scenes it seems the performance loss is either minimal,
|
|
* or there is a performance increase anyway due to avoiding the need to send
|
|
* two rays with transparent shadows.
|
|
*
|
|
* This is CPU only because of qsort, and malloc or high stack space usage to
|
|
* record all these intersections. */
|
|
|
|
#define STACK_MAX_HITS 64
|
|
|
|
ccl_device_inline bool shadow_blocked(KernelGlobals *kg, ShaderData *shadow_sd, PathState *state, Ray *ray, float3 *shadow)
|
|
{
|
|
*shadow = make_float3(1.0f, 1.0f, 1.0f);
|
|
if(ray->t == 0.0f) {
|
|
return false;
|
|
}
|
|
bool blocked;
|
|
if(kernel_data.integrator.transparent_shadows) {
|
|
/* Check transparent bounces here, for volume scatter which can do
|
|
* lighting before surface path termination is checked.
|
|
*/
|
|
if(state->transparent_bounce >= kernel_data.integrator.transparent_max_bounce) {
|
|
return true;
|
|
}
|
|
/* Intersect to find an opaque surface, or record all transparent
|
|
* surface hits.
|
|
*/
|
|
Intersection hits_stack[STACK_MAX_HITS];
|
|
Intersection *hits = hits_stack;
|
|
const int transparent_max_bounce = kernel_data.integrator.transparent_max_bounce;
|
|
uint max_hits = transparent_max_bounce - state->transparent_bounce - 1;
|
|
#ifndef __KERNEL_GPU__
|
|
/* Prefer to use stack but use dynamic allocation if too deep max hits
|
|
* we need max_hits + 1 storage space due to the logic in
|
|
* scene_intersect_shadow_all which will first store and then check if
|
|
* the limit is exceeded.
|
|
*
|
|
* Ignore this on GPU because of slow/unavailable malloc().
|
|
*/
|
|
if(max_hits + 1 > STACK_MAX_HITS) {
|
|
if(kg->transparent_shadow_intersections == NULL) {
|
|
kg->transparent_shadow_intersections =
|
|
(Intersection*)malloc(sizeof(Intersection)*(transparent_max_bounce + 1));
|
|
}
|
|
hits = kg->transparent_shadow_intersections;
|
|
}
|
|
#endif /* __KERNEL_GPU__ */
|
|
uint num_hits;
|
|
blocked = scene_intersect_shadow_all(kg, ray, hits, max_hits, &num_hits);
|
|
/* If no opaque surface found but we did find transparent hits,
|
|
* shade them.
|
|
*/
|
|
if(!blocked && num_hits > 0) {
|
|
float3 throughput = make_float3(1.0f, 1.0f, 1.0f);
|
|
float3 Pend = ray->P + ray->D*ray->t;
|
|
float last_t = 0.0f;
|
|
int bounce = state->transparent_bounce;
|
|
Intersection *isect = hits;
|
|
#ifdef __VOLUME__
|
|
PathState ps = *state;
|
|
#endif
|
|
sort_intersections(hits, num_hits);
|
|
for(int hit = 0; hit < num_hits; hit++, isect++) {
|
|
/* Adjust intersection distance for moving ray forward. */
|
|
float new_t = isect->t;
|
|
isect->t -= last_t;
|
|
/* Skip hit if we did not move forward, step by step raytracing
|
|
* would have skipped it as well then.
|
|
*/
|
|
if(last_t == new_t) {
|
|
continue;
|
|
}
|
|
last_t = new_t;
|
|
/* Attenuate the throughput. */
|
|
if(shadow_handle_transparent_isect(kg,
|
|
shadow_sd,
|
|
&ps,
|
|
isect,
|
|
ray,
|
|
&throughput))
|
|
{
|
|
return true;
|
|
}
|
|
/* Move ray forward. */
|
|
ray->P = shadow_sd->P;
|
|
if(ray->t != FLT_MAX) {
|
|
ray->D = normalize_len(Pend - ray->P, &ray->t);
|
|
}
|
|
bounce++;
|
|
}
|
|
#ifdef __VOLUME__
|
|
/* Attenuation for last line segment towards light. */
|
|
if(ps.volume_stack[0].shader != SHADER_NONE) {
|
|
kernel_volume_shadow(kg, shadow_sd, &ps, ray, &throughput);
|
|
}
|
|
#endif
|
|
*shadow = throughput;
|
|
return is_zero(throughput);
|
|
}
|
|
}
|
|
else {
|
|
Intersection isect;
|
|
blocked = scene_intersect(kg, *ray, PATH_RAY_SHADOW_OPAQUE, &isect, NULL, 0.0f, 0.0f);
|
|
}
|
|
#ifdef __VOLUME__
|
|
if(!blocked && state->volume_stack[0].shader != SHADER_NONE) {
|
|
/* Apply attenuation from current volume shader/ */
|
|
kernel_volume_shadow(kg, shadow_sd, state, ray, shadow);
|
|
}
|
|
#endif
|
|
return blocked;
|
|
}
|
|
|
|
#undef STACK_MAX_HITS
|
|
|
|
#else
|
|
|
|
/* Shadow function to compute how much light is blocked, GPU variation.
|
|
*
|
|
* Here we raytrace from one transparent surface to the next step by step.
|
|
* To minimize overhead in cases where we don't need transparent shadows, we
|
|
* first trace a regular shadow ray. We check if the hit primitive was
|
|
* potentially transparent, and only in that case start marching. this gives
|
|
* one extra ray cast for the cases were we do want transparency. */
|
|
|
|
ccl_device_noinline bool shadow_blocked(KernelGlobals *kg,
|
|
ShaderData *shadow_sd,
|
|
ccl_addr_space PathState *state,
|
|
ccl_addr_space Ray *ray_input,
|
|
float3 *shadow)
|
|
{
|
|
*shadow = make_float3(1.0f, 1.0f, 1.0f);
|
|
|
|
if(ray_input->t == 0.0f)
|
|
return false;
|
|
|
|
#ifdef __SPLIT_KERNEL__
|
|
Ray private_ray = *ray_input;
|
|
Ray *ray = &private_ray;
|
|
#else
|
|
Ray *ray = ray_input;
|
|
#endif
|
|
|
|
#ifdef __SPLIT_KERNEL__
|
|
Intersection *isect = &kg->isect_shadow[SD_THREAD];
|
|
#else
|
|
Intersection isect_object;
|
|
Intersection *isect = &isect_object;
|
|
#endif
|
|
/* Early check for opaque shadows. */
|
|
bool blocked = scene_intersect(kg,
|
|
*ray,
|
|
PATH_RAY_SHADOW_OPAQUE,
|
|
isect,
|
|
NULL,
|
|
0.0f, 0.0f);
|
|
#ifdef __TRANSPARENT_SHADOWS__
|
|
if(blocked && kernel_data.integrator.transparent_shadows) {
|
|
if(shader_transparent_shadow(kg, isect)) {
|
|
float3 throughput = make_float3(1.0f, 1.0f, 1.0f);
|
|
float3 Pend = ray->P + ray->D*ray->t;
|
|
int bounce = state->transparent_bounce;
|
|
# ifdef __VOLUME__
|
|
PathState ps = *state;
|
|
# endif
|
|
for(;;) {
|
|
if(bounce >= kernel_data.integrator.transparent_max_bounce) {
|
|
return true;
|
|
if(!scene_intersect(kg,
|
|
*ray,
|
|
PATH_RAY_SHADOW_TRANSPARENT,
|
|
isect,
|
|
NULL,
|
|
0.0f, 0.0f))
|
|
{
|
|
break;
|
|
}
|
|
if(!shader_transparent_shadow(kg, isect)) {
|
|
return true;
|
|
}
|
|
/* Attenuate the throughput. */
|
|
if(shadow_handle_transparent_isect(kg,
|
|
shadow_sd,
|
|
&ps,
|
|
isect,
|
|
ray,
|
|
&throughput))
|
|
{
|
|
return true;
|
|
}
|
|
/* Move ray forward. */
|
|
ray->P = ray_offset(ccl_fetch(shadow_sd, P), -ccl_fetch(shadow_sd, Ng));
|
|
if(ray->t != FLT_MAX) {
|
|
ray->D = normalize_len(Pend - ray->P, &ray->t);
|
|
}
|
|
bounce++;
|
|
}
|
|
# ifdef __VOLUME__
|
|
/* Attenuation for last line segment towards light. */
|
|
if(ps.volume_stack[0].shader != SHADER_NONE) {
|
|
kernel_volume_shadow(kg, shadow_sd, &ps, ray, &throughput);
|
|
}
|
|
# endif
|
|
*shadow *= throughput;
|
|
return is_zero(throughput);
|
|
}
|
|
}
|
|
# ifdef __VOLUME__
|
|
else if(!blocked && state->volume_stack[0].shader != SHADER_NONE) {
|
|
/* Apply attenuation from current volume shader. */
|
|
kernel_volume_shadow(kg, shadow_sd, state, ray, shadow);
|
|
}
|
|
# endif
|
|
#endif
|
|
|
|
return blocked;
|
|
}
|
|
|
|
#endif
|
|
|
|
CCL_NAMESPACE_END
|