Welcome to mirror list, hosted at ThFree Co, Russian Federation.

bvh_types.h « bvh « kernel « cycles « intern - git.blender.org/blender.git - Unnamed repository; edit this file 'description' to name the repository.
summaryrefslogtreecommitdiff
blob: 84dc0dbaef51048934d414c0aa8fe42b78e80df0 (plain)
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
/*
 * 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.
 */

#ifndef __BVH_TYPES__
#define __BVH_TYPES__

CCL_NAMESPACE_BEGIN

/* Don't inline intersect functions on GPU, this is faster */
#ifdef __KERNEL_GPU__
#  define ccl_device_intersect ccl_device_forceinline
#else
#  define ccl_device_intersect ccl_device_inline
#endif

/* bottom-most stack entry, indicating the end of traversal */
#define ENTRYPOINT_SENTINEL 0x76543210

/* 64 object BVH + 64 mesh BVH + 64 object node splitting */
#define BVH_STACK_SIZE 192
#define BVH_QSTACK_SIZE 384
#define BVH_OSTACK_SIZE 768
/* BVH intersection function variations */

#define BVH_INSTANCING 1
#define BVH_MOTION 2
#define BVH_HAIR 4

#define BVH_NAME_JOIN(x, y) x##_##y
#define BVH_NAME_EVAL(x, y) BVH_NAME_JOIN(x, y)
#define BVH_FUNCTION_FULL_NAME(prefix) BVH_NAME_EVAL(prefix, BVH_FUNCTION_NAME)

#define BVH_FEATURE(f) (((BVH_FUNCTION_FEATURES) & (f)) != 0)

/* Debugging heleprs */
#ifdef __KERNEL_DEBUG__
#  define BVH_DEBUG_INIT() \
    do { \
      isect->num_traversed_nodes = 0; \
      isect->num_traversed_instances = 0; \
      isect->num_intersections = 0; \
    } while (0)
#  define BVH_DEBUG_NEXT_NODE() \
    do { \
      ++isect->num_traversed_nodes; \
    } while (0)
#  define BVH_DEBUG_NEXT_INTERSECTION() \
    do { \
      ++isect->num_intersections; \
    } while (0)
#  define BVH_DEBUG_NEXT_INSTANCE() \
    do { \
      ++isect->num_traversed_instances; \
    } while (0)
#else /* __KERNEL_DEBUG__ */
#  define BVH_DEBUG_INIT()
#  define BVH_DEBUG_NEXT_NODE()
#  define BVH_DEBUG_NEXT_INTERSECTION()
#  define BVH_DEBUG_NEXT_INSTANCE()
#endif /* __KERNEL_DEBUG__ */

CCL_NAMESPACE_END

#endif /* __BVH_TYPES__ */