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
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
|
/*
* Copyright © 2021 Google
*
* Permission is hereby granted, free of charge, to any person obtaining a
* copy of this software and associated documentation files (the "Software"),
* to deal in the Software without restriction, including without limitation
* the rights to use, copy, modify, merge, publish, distribute, sublicense,
* and/or sell copies of the Software, and to permit persons to whom the
* Software is furnished to do so, subject to the following conditions:
*
* The above copyright notice and this permission notice (including the next
* paragraph) shall be included in all copies or substantial portions of the
* Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
* THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
* FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS
* IN THE SOFTWARE.
*/
#ifndef RADV_RT_COMMON_H
#define RADV_RT_COMMON_H
#include "nir/nir.h"
#include "nir/nir_builder.h"
#include "nir/nir_vulkan.h"
#include "compiler/spirv/spirv.h"
#include "radv_private.h"
void nir_sort_hit_pair(nir_builder *b, nir_variable *var_distances, nir_variable *var_indices,
uint32_t chan_1, uint32_t chan_2);
nir_ssa_def *intersect_ray_amd_software_box(struct radv_device *device, nir_builder *b,
nir_ssa_def *bvh_node, nir_ssa_def *ray_tmax,
nir_ssa_def *origin, nir_ssa_def *dir,
nir_ssa_def *inv_dir);
nir_ssa_def *intersect_ray_amd_software_tri(struct radv_device *device, nir_builder *b,
nir_ssa_def *bvh_node, nir_ssa_def *ray_tmax,
nir_ssa_def *origin, nir_ssa_def *dir,
nir_ssa_def *inv_dir);
nir_ssa_def *build_addr_to_node(nir_builder *b, nir_ssa_def *addr);
nir_ssa_def *nir_build_vec3_mat_mult(nir_builder *b, nir_ssa_def *vec, nir_ssa_def *matrix[],
bool translation);
void nir_build_wto_matrix_load(nir_builder *b, nir_ssa_def *instance_addr, nir_ssa_def **out);
nir_ssa_def *create_bvh_descriptor(nir_builder *b);
struct radv_ray_traversal_args;
struct radv_ray_flags {
nir_ssa_def *force_opaque;
nir_ssa_def *force_not_opaque;
nir_ssa_def *terminate_on_first_hit;
nir_ssa_def *no_cull_front;
nir_ssa_def *no_cull_back;
nir_ssa_def *no_cull_opaque;
nir_ssa_def *no_cull_no_opaque;
nir_ssa_def *no_skip_triangles;
nir_ssa_def *no_skip_aabbs;
};
struct radv_leaf_intersection {
nir_ssa_def *node_addr;
nir_ssa_def *primitive_id;
nir_ssa_def *geometry_id_and_flags;
nir_ssa_def *opaque;
};
typedef void (*radv_aabb_intersection_cb)(nir_builder *b,
struct radv_leaf_intersection *intersection,
const struct radv_ray_traversal_args *args);
struct radv_triangle_intersection {
struct radv_leaf_intersection base;
nir_ssa_def *t;
nir_ssa_def *frontface;
nir_ssa_def *barycentrics;
};
typedef void (*radv_triangle_intersection_cb)(nir_builder *b,
struct radv_triangle_intersection *intersection,
const struct radv_ray_traversal_args *args,
const struct radv_ray_flags *ray_flags);
typedef void (*radv_rt_stack_store_cb)(nir_builder *b, nir_ssa_def *index, nir_ssa_def *value,
const struct radv_ray_traversal_args *args);
typedef nir_ssa_def *(*radv_rt_stack_load_cb)(nir_builder *b, nir_ssa_def *index,
const struct radv_ray_traversal_args *args);
struct radv_ray_traversal_vars {
/* For each accepted hit, tmax will be set to the t value. This allows for automatic intersection
* culling.
*/
nir_deref_instr *tmax;
/* Those variables change when entering and exiting BLASes. */
nir_deref_instr *origin;
nir_deref_instr *dir;
nir_deref_instr *inv_dir;
/* The base address of the current TLAS/BLAS. */
nir_deref_instr *bvh_base;
/* stack is the current stack pointer/index. top_stack is the pointer/index that marks the end of
* traversal for the current BLAS/TLAS. stack_low_watermark is the low watermark of the short
* stack.
*/
nir_deref_instr *stack;
nir_deref_instr *top_stack;
nir_deref_instr *stack_low_watermark;
nir_deref_instr *current_node;
/* The node visited in the previous iteration. This is used in backtracking to jump to its parent
* and then find the child after the previously visited node.
*/
nir_deref_instr *previous_node;
/* When entering an instance these are the instance node and the root node of the BLAS */
nir_deref_instr *instance_top_node;
nir_deref_instr *instance_bottom_node;
/* Information about the current instance used for culling. */
nir_deref_instr *instance_addr;
nir_deref_instr *sbt_offset_and_flags;
};
struct radv_ray_traversal_args {
nir_ssa_def *root_bvh_base;
nir_ssa_def *flags;
nir_ssa_def *cull_mask;
nir_ssa_def *origin;
nir_ssa_def *tmin;
nir_ssa_def *dir;
struct radv_ray_traversal_vars vars;
/* The increment/decrement used for radv_ray_traversal_vars::stack, and how many entries are
* available. stack_base is the base address of the stack. */
uint32_t stack_stride;
uint32_t stack_entries;
uint32_t stack_base;
radv_rt_stack_store_cb stack_store_cb;
radv_rt_stack_load_cb stack_load_cb;
radv_aabb_intersection_cb aabb_cb;
radv_triangle_intersection_cb triangle_cb;
void *data;
};
/* For the initialization of instance_bottom_node. Explicitly different than RADV_BVH_INVALID_NODE
* or any real node, to ensure we never exit an instance when we're not in one. */
#define RADV_BVH_NO_INSTANCE_ROOT 0xfffffffeu
/* Builds the ray traversal loop and returns whether traversal is incomplete, similar to
* rayQueryProceedEXT. Traversal will only be considered incomplete, if one of the specified
* callbacks breaks out of the traversal loop.
*/
nir_ssa_def *radv_build_ray_traversal(struct radv_device *device, nir_builder *b,
const struct radv_ray_traversal_args *args);
#endif
|
