201 const int num_repeat_items = node_storage.
items_num;
202 const int num_border_links = body_fn_.indices.inputs.border_links.size();
205 const int iterations = std::max<int>(
210 if (iterations >= 10) {
221 tree_logger->node_warnings.append(
222 *tree_logger->allocator,
223 {repeat_output_bnode_.identifier,
224 {NodeWarningType::Info, N_(
"Inspection index is out of range")}});
230 const int main_inputs_offset = 1;
231 const int body_inputs_offset = 1;
233 lf::Graph &lf_graph = eval_storage.graph;
238 for (
const int i : inputs_.index_range()) {
239 const lf::Input &input = inputs_[i];
240 lf_inputs.
append(&lf_graph.add_input(*input.type, this->input_name(i)));
242 for (
const int i : outputs_.index_range()) {
243 const lf::Output &
output = outputs_[i];
244 lf_outputs.
append(&lf_graph.add_output(*
output.type, this->output_name(i)));
248 VectorSet<lf::FunctionNode *> &lf_body_nodes = eval_storage.lf_body_nodes;
249 for ([[maybe_unused]]
const int i :
IndexRange(iterations)) {
250 lf::FunctionNode &lf_node = lf_graph.add_function(*body_fn_.
function);
251 lf_body_nodes.add_new(&lf_node);
256 Array<lf::FunctionNode *> lf_border_link_usage_or_nodes(num_border_links);
257 eval_storage.or_function.emplace(iterations);
258 for (
const int i :
IndexRange(num_border_links)) {
259 lf::FunctionNode &lf_node = lf_graph.add_function(*eval_storage.or_function);
260 lf_border_link_usage_or_nodes[i] = &lf_node;
263 const bool use_index_values = zone_.input_node()->output_socket(0).is_directly_linked();
265 if (use_index_values) {
266 eval_storage.index_values.reinitialize(iterations);
268 for (
const int i : range) {
269 eval_storage.index_values[i].emplace<
int>(i);
275 static const SocketValueVariant static_unused_index{-1};
276 for (
const int iter_i : lf_body_nodes.index_range()) {
277 lf::FunctionNode &lf_node = *lf_body_nodes[iter_i];
278 const SocketValueVariant *index_value = use_index_values ?
279 &eval_storage.index_values[iter_i] :
280 &static_unused_index;
281 lf_node.input(body_fn_.indices.inputs.main[0]).set_default_value(index_value);
282 for (
const int i :
IndexRange(num_border_links)) {
283 lf_graph.add_link(*lf_inputs[zone_info_.indices.inputs.border_links[i]],
284 lf_node.input(body_fn_.indices.inputs.border_links[i]));
285 lf_graph.add_link(lf_node.output(body_fn_.indices.outputs.border_link_usages[i]),
286 lf_border_link_usage_or_nodes[i]->input(iter_i));
290 for (
const auto &item : body_fn_.indices.inputs.reference_sets.items()) {
291 lf_graph.add_link(*lf_inputs[zone_info_.indices.inputs.reference_sets.lookup(item.key)],
292 lf_node.input(item.value));
296 static bool static_true =
true;
299 for (
const int iter_i : lf_body_nodes.index_range().drop_back(1)) {
300 lf::FunctionNode &lf_node = *lf_body_nodes[iter_i];
301 lf::FunctionNode &lf_next_node = *lf_body_nodes[iter_i + 1];
302 for (
const int i :
IndexRange(num_repeat_items)) {
304 lf_node.output(body_fn_.indices.outputs.main[i]),
305 lf_next_node.input(body_fn_.indices.inputs.main[i + body_inputs_offset]));
309 lf_node.input(body_fn_.indices.inputs.output_usages[i]).set_default_value(&static_true);
314 for (
const int i :
IndexRange(num_border_links)) {
315 lf_graph.add_link(lf_border_link_usage_or_nodes[i]->
output(0),
316 *lf_outputs[zone_info_.indices.outputs.border_link_usages[i]]);
319 if (iterations > 0) {
322 lf::FunctionNode &lf_first_body_node = *lf_body_nodes[0];
323 for (
const int i :
IndexRange(num_repeat_items)) {
325 *lf_inputs[zone_info_.indices.inputs.main[i + main_inputs_offset]],
326 lf_first_body_node.input(body_fn_.indices.inputs.main[i + body_inputs_offset]));
328 lf_first_body_node.output(
329 body_fn_.indices.outputs.input_usages[i + body_inputs_offset]),
330 *lf_outputs[zone_info_.indices.outputs.input_usages[i + main_inputs_offset]]);
335 lf::FunctionNode &lf_last_body_node = *lf_body_nodes.as_span().last();
336 for (
const int i :
IndexRange(num_repeat_items)) {
337 lf_graph.add_link(lf_last_body_node.output(body_fn_.indices.outputs.main[i]),
338 *lf_outputs[zone_info_.indices.outputs.main[i]]);
339 lf_graph.add_link(*lf_inputs[zone_info_.indices.inputs.output_usages[i]],
340 lf_last_body_node.input(body_fn_.indices.inputs.output_usages[i]));
346 for (
const int i :
IndexRange(num_repeat_items)) {
347 lf_graph.add_link(*lf_inputs[zone_info_.indices.inputs.main[i + main_inputs_offset]],
348 *lf_outputs[zone_info_.indices.outputs.main[i]]);
350 *lf_inputs[zone_info_.indices.inputs.output_usages[i]],
351 *lf_outputs[zone_info_.indices.outputs.input_usages[i + main_inputs_offset]]);
353 for (
const int i :
IndexRange(num_border_links)) {
354 static bool static_false =
false;
355 lf_outputs[zone_info_.indices.outputs.border_link_usages[i]]->set_default_value(
360 lf_outputs[zone_info_.indices.outputs.input_usages[0]]->set_default_value(&static_true);
363 lf_graph.update_node_indices();
370 eval_storage.output_index_map.
reinitialize(outputs_.size() - 1);
371 eval_storage.input_index_map.resize(inputs_.size() - 1);
374 Vector<const lf::GraphInputSocket *> lf_graph_inputs = lf_inputs.
as_span().drop_front(1);
376 const int iteration_usage_index = zone_info_.indices.outputs.input_usages[0];
378 eval_storage.output_index_map.as_mutable_span().take_front(iteration_usage_index));
380 eval_storage.output_index_map.as_mutable_span().drop_front(iteration_usage_index),
381 iteration_usage_index + 1);
383 Vector<const lf::GraphOutputSocket *> lf_graph_outputs = lf_outputs.
as_span().take_front(
384 iteration_usage_index);
385 lf_graph_outputs.extend(lf_outputs.
as_span().drop_front(iteration_usage_index + 1));
387 eval_storage.body_execute_wrapper.emplace();
388 eval_storage.body_execute_wrapper->repeat_output_bnode_ = &repeat_output_bnode_;
389 eval_storage.body_execute_wrapper->lf_body_nodes_ = &lf_body_nodes;
390 eval_storage.side_effect_provider.emplace();
391 eval_storage.side_effect_provider->repeat_output_bnode_ = &repeat_output_bnode_;
392 eval_storage.side_effect_provider->lf_body_nodes_ = lf_body_nodes;
394 eval_storage.graph_executor.emplace(lf_graph,
395 std::move(lf_graph_inputs),
396 std::move(lf_graph_outputs),
398 &*eval_storage.side_effect_provider,
399 &*eval_storage.body_execute_wrapper);
400 eval_storage.graph_executor_storage = eval_storage.graph_executor->init_storage(
401 eval_storage.allocator);
405 if (btree_orig.runtime->logged_zone_graphs) {
406 std::lock_guard
lock{btree_orig.runtime->logged_zone_graphs->mutex};
407 btree_orig.runtime->logged_zone_graphs->graph_by_zone_id.lookup_or_add_cb(
408 repeat_output_bnode_.identifier, [&]() { return lf_graph.to_dot(); });