23 result_.append(node_handle);
36 move_transfer_and_dispatch_outside_rendering_scope(
render_graph);
39std::optional<std::pair<int64_t, int64_t>> VKScheduler::find_rendering_scope(
48 rendering_start =
index;
51 return std::pair(rendering_start,
index);
59 BLI_assert(rendering_start == -1 || render_graph.resources_.use_dynamic_rendering_local_read);
69void VKScheduler::move_initial_transfer_to_start(
const VKRenderGraph &render_graph)
71 Vector<NodeHandle> data_transfers;
72 Vector<NodeHandle> other_nodes;
74 data_transfers.reserve(result_.size());
75 other_nodes.reserve(result_.size());
77 for (
const int64_t index : result_.index_range()) {
79 const VKRenderGraphNode &
node = render_graph.nodes_[node_handle];
80 Span<VKRenderGraphBuffer> node_buffers = render_graph.linked_buffers(
node);
81 Span<VKRenderGraphImage> node_images = render_graph.linked_images(
node);
83 if (node_buffers[0].resource.stamp == 0 && node_buffers[1].resource.stamp == 0) {
84 data_transfers.append(index);
89 if (node_buffers[0].resource.stamp == 0 && node_images[0].resource.stamp == 0) {
90 data_transfers.append(index);
95 if (node_buffers[0].resource.stamp == 0) {
96 data_transfers.append(index);
101 other_nodes.append(index);
104 MutableSpan<NodeHandle> store_data_transfers = result_.as_mutable_span().slice(
105 0, data_transfers.size());
106 MutableSpan<NodeHandle> store_other = result_.as_mutable_span().slice(data_transfers.size(),
108 store_data_transfers.copy_from(data_transfers);
109 store_other.copy_from(other_nodes);
118void VKScheduler::move_transfer_and_dispatch_outside_rendering_scope(
121 Vector<NodeHandle> pre_rendering_scope;
122 Vector<NodeHandle> rendering_scope;
123 Set<ResourceHandle> used_buffers;
125 foreach_rendering_scope(render_graph, [&](
int64_t start_index,
int64_t end_index) {
127 for (
int index = end_index - 1;
index >= start_index;
index--) {
129 const VKRenderGraphNode &
node = render_graph.nodes_[node_handle];
133 std::swap(result_[end_index], result_[index]);
138 for (
int index = start_index + 1;
index < end_index;
index++) {
140 const VKRenderGraphNode &
node = render_graph.nodes_[node_handle];
144 std::swap(result_[start_index], result_[index]);
152 pre_rendering_scope.clear();
153 rendering_scope.clear();
154 used_buffers.clear();
156 for (
int index = start_index + 1;
index < end_index;
index++) {
158 const VKRenderGraphNode &
node = render_graph.nodes_[node_handle];
163 bool add_to_rendering_scope = !rendering_scope.is_empty();
166 if (!used_buffers.contains(
167 render_graph.links_.buffers[
node.links.buffers.start()].resource.handle))
171 pre_rendering_scope.append(node_handle);
172 add_to_rendering_scope =
false;
176 if (rendering_scope.is_empty()) {
177 rendering_scope.extend(Span<NodeHandle>(&result_[start_index], index - start_index));
181 if (add_to_rendering_scope) {
184 rendering_scope.append(node_handle);
189 for (
const VKRenderGraphBuffer &link : render_graph.linked_buffers(
node)) {
190 used_buffers.add(link.resource.handle);
196 if (!pre_rendering_scope.is_empty()) {
197 MutableSpan<NodeHandle> store_none_rendering = result_.as_mutable_span().slice(
198 start_index, pre_rendering_scope.size());
199 MutableSpan<NodeHandle> store_rendering = result_.as_mutable_span().slice(
200 start_index + pre_rendering_scope.size(), rendering_scope.size());
201 store_none_rendering.copy_from(pre_rendering_scope);
202 store_rendering.copy_from(rendering_scope);
203 start_index += pre_rendering_scope.size();
214void VKScheduler::debug_print(
const VKRenderGraph &render_graph)
const
216 std::stringstream ss;
219 for (
int index : result_.index_range()) {
221 const VKRenderGraphNode &
node = render_graph.nodes_[node_handle];
225 for (
int i = 0; i < indent; i++) {
228 ss <<
node.type <<
"\n";
230 render_graph.debug_print(node_handle);
238 std::cout << ss.str();
Span< NodeHandle > select_nodes(const VKRenderGraph &render_graph)
BLI_INLINE bool node_type_is_rendering(VKNodeType node_type)