Home
last modified time | relevance | path

Searched refs:prim_addr (Results 1 – 7 of 7) sorted by relevance

/dports/graphics/blender/blender-2.91.0/intern/cycles/kernel/bvh/
H A Dbvh_traversal.h127 int prim_addr = __float_as_int(leaf.x); in BVH_FUNCTION_FULL_NAME() local
129 if (prim_addr >= 0) { in BVH_FUNCTION_FULL_NAME()
140 for (; prim_addr < prim_addr2; prim_addr++) { in BVH_FUNCTION_FULL_NAME()
142 kernel_assert(kernel_tex_fetch(__prim_type, prim_addr) == type); in BVH_FUNCTION_FULL_NAME()
143 if (triangle_intersect(kg, isect, P, dir, visibility, object, prim_addr)) { in BVH_FUNCTION_FULL_NAME()
153 for (; prim_addr < prim_addr2; prim_addr++) { in BVH_FUNCTION_FULL_NAME()
155 kernel_assert(kernel_tex_fetch(__prim_type, prim_addr) == type); in BVH_FUNCTION_FULL_NAME()
157 kg, isect, P, dir, ray->time, visibility, object, prim_addr)) { in BVH_FUNCTION_FULL_NAME()
171 for (; prim_addr < prim_addr2; prim_addr++) { in BVH_FUNCTION_FULL_NAME()
173 const uint curve_type = kernel_tex_fetch(__prim_type, prim_addr); in BVH_FUNCTION_FULL_NAME()
[all …]
H A Dbvh_volume.h126 int prim_addr = __float_as_int(leaf.x); in BVH_FUNCTION_FULL_NAME() local
128 if (prim_addr >= 0) { in BVH_FUNCTION_FULL_NAME()
140 for (; prim_addr < prim_addr2; prim_addr++) { in BVH_FUNCTION_FULL_NAME()
141 kernel_assert(kernel_tex_fetch(__prim_type, prim_addr) == type); in BVH_FUNCTION_FULL_NAME()
144 kernel_tex_fetch(__prim_object, prim_addr) : in BVH_FUNCTION_FULL_NAME()
150 triangle_intersect(kg, isect, P, dir, visibility, object, prim_addr); in BVH_FUNCTION_FULL_NAME()
157 for (; prim_addr < prim_addr2; prim_addr++) { in BVH_FUNCTION_FULL_NAME()
158 kernel_assert(kernel_tex_fetch(__prim_type, prim_addr) == type); in BVH_FUNCTION_FULL_NAME()
161 kernel_tex_fetch(__prim_object, prim_addr) : in BVH_FUNCTION_FULL_NAME()
168 kg, isect, P, dir, ray->time, visibility, object, prim_addr); in BVH_FUNCTION_FULL_NAME()
[all …]
H A Dbvh_volume_all.h128 int prim_addr = __float_as_int(leaf.x); in BVH_FUNCTION_FULL_NAME() local
130 if (prim_addr >= 0) { in BVH_FUNCTION_FULL_NAME()
143 for (; prim_addr < prim_addr2; prim_addr++) { in BVH_FUNCTION_FULL_NAME()
144 kernel_assert(kernel_tex_fetch(__prim_type, prim_addr) == type); in BVH_FUNCTION_FULL_NAME()
147 kernel_tex_fetch(__prim_object, prim_addr) : in BVH_FUNCTION_FULL_NAME()
153 hit = triangle_intersect(kg, isect_array, P, dir, visibility, object, prim_addr); in BVH_FUNCTION_FULL_NAME()
182 for (; prim_addr < prim_addr2; prim_addr++) { in BVH_FUNCTION_FULL_NAME()
183 kernel_assert(kernel_tex_fetch(__prim_type, prim_addr) == type); in BVH_FUNCTION_FULL_NAME()
186 kernel_tex_fetch(__prim_object, prim_addr) : in BVH_FUNCTION_FULL_NAME()
193 kg, isect_array, P, dir, ray->time, visibility, object, prim_addr); in BVH_FUNCTION_FULL_NAME()
[all …]
H A Dbvh_local.h136 int prim_addr = __float_as_int(leaf.x); in BVH_FUNCTION_FULL_NAME() local
149 for (; prim_addr < prim_addr2; prim_addr++) { in BVH_FUNCTION_FULL_NAME()
150 kernel_assert(kernel_tex_fetch(__prim_type, prim_addr) == type); in BVH_FUNCTION_FULL_NAME()
157 prim_addr, in BVH_FUNCTION_FULL_NAME()
169 for (; prim_addr < prim_addr2; prim_addr++) { in BVH_FUNCTION_FULL_NAME()
170 kernel_assert(kernel_tex_fetch(__prim_type, prim_addr) == type); in BVH_FUNCTION_FULL_NAME()
178 prim_addr, in BVH_FUNCTION_FULL_NAME()
H A Dbvh_shadow_all.h128 int prim_addr = __float_as_int(leaf.x); in BVH_FUNCTION_FULL_NAME() local
130 if (prim_addr >= 0) { in BVH_FUNCTION_FULL_NAME()
140 while (prim_addr < prim_addr2) { in BVH_FUNCTION_FULL_NAME()
141 kernel_assert((kernel_tex_fetch(__prim_type, prim_addr) & PRIMITIVE_ALL) == p_type); in BVH_FUNCTION_FULL_NAME()
150 hit = triangle_intersect(kg, isect_array, P, dir, visibility, object, prim_addr); in BVH_FUNCTION_FULL_NAME()
156 kg, isect_array, P, dir, ray->time, visibility, object, prim_addr); in BVH_FUNCTION_FULL_NAME()
165 const uint curve_type = kernel_tex_fetch(__prim_type, prim_addr); in BVH_FUNCTION_FULL_NAME()
167 kg, isect_array, P, dir, visibility, object, prim_addr, ray->time, curve_type); in BVH_FUNCTION_FULL_NAME()
217 prim_addr++; in BVH_FUNCTION_FULL_NAME()
222 object = kernel_tex_fetch(__prim_object, -prim_addr - 1); in BVH_FUNCTION_FULL_NAME()
/dports/graphics/blender/blender-2.91.0/intern/cycles/kernel/geom/
H A Dgeom_motion_triangle_intersect.h170 int prim_addr) in motion_triangle_intersect() argument
173 int prim = kernel_tex_fetch(__prim_index, prim_addr); in motion_triangle_intersect()
174 int fobject = (object == OBJECT_NONE) ? kernel_tex_fetch(__prim_object, prim_addr) : object; in motion_triangle_intersect()
197 if (kernel_tex_fetch(__prim_visibility, prim_addr) & visibility) in motion_triangle_intersect()
203 isect->prim = prim_addr; in motion_triangle_intersect()
225 int prim_addr, in motion_triangle_intersect_local() argument
233 if (kernel_tex_fetch(__prim_object, prim_addr) != local_object) { in motion_triangle_intersect_local()
239 int prim = kernel_tex_fetch(__prim_index, prim_addr); in motion_triangle_intersect_local()
305 isect->prim = prim_addr; in motion_triangle_intersect_local()
H A Dgeom_triangle_intersect.h31 int prim_addr) in triangle_intersect() argument
33 const uint tri_vindex = kernel_tex_fetch(__prim_tri_index, prim_addr); in triangle_intersect()
59 if (kernel_tex_fetch(__prim_visibility, prim_addr) & visibility) in triangle_intersect()
62 isect->prim = prim_addr; in triangle_intersect()
87 int prim_addr, in triangle_intersect_local() argument
95 if (kernel_tex_fetch(__prim_object, prim_addr) != local_object) { in triangle_intersect_local()
100 const uint tri_vindex = kernel_tex_fetch(__prim_tri_index, prim_addr); in triangle_intersect_local()
165 isect->prim = prim_addr; in triangle_intersect_local()