41 node_group.ensure_topology_cache();
44 for (
const bNode *
node : node_group.nodes_by_type(
"CompositorNodeViewer"_ustr)) {
51 *
node,
nullptr, compute_context, compute_context_cache);
52 if (!zone_viewer_compute_context) {
56 if (&viewer_compute_context == zone_viewer_compute_context) {
62 for (
const bNode *group_node : node_group.group_nodes()) {
63 if (group_node->is_muted() || !group_node->id) {
69 *group_node,
nullptr, compute_context, compute_context_cache);
70 if (!zone_viewer_compute_context) {
74 const bNodeTree &child_node_group = *
reinterpret_cast<const bNodeTree *
>(group_node->id);
77 zone_viewer_compute_context, group_node->identifier, &group_node->owner_tree());
79 child_node_group, node_compute_context, viewer_compute_context, compute_context_cache))
91 node_group.ensure_topology_cache();
92 for (
const bNode *
node : node_group.nodes_by_type(
"CompositorNodeOutputFile"_ustr)) {
93 if (!
node->is_muted()) {
98 for (
const bNode *group_node : node_group.group_nodes()) {
99 if (!group_node->is_muted() && group_node->id) {
112template<
typename T,
typename SocketT>
117 if (!input.is_logically_linked()) {
118 return T(input.default_value_typed<SocketT>()->value);
121 const bNodeSocket *linked_output = input.logically_linked_sockets()[0];
122 if (linked_output->owner_node().is_type(
"GeometryNodeIsViewport"_ustr)) {
125 const bool is_viewport = context.is_viewport();
126 if constexpr (std::is_same_v<T, bool>) {
138 return converted_value;
142 if (linked_output->
type != input.
type) {
146 const Result *
result = socket_result_fn(*linked_output);
151 return result->get_single_value_default<
T>();
161 const UString condition_identifier =
"Switch"_ustr;
162 if (input.identifier_ustr() == condition_identifier) {
167 context, *
node.input_by_identifier(condition_identifier), socket_result_fn);
172 return (input.identifier_ustr() ==
"True"_ustr) ==
condition.value();
182 const UString menu_identifier =
"Menu"_ustr;
183 if (input.identifier_ustr() == menu_identifier) {
187 const std::optional<nodes::MenuValue> menu =
189 context, *
node.input_by_identifier(menu_identifier), socket_result_fn);
190 if (!menu.has_value()) {
207 const UString index_identifier =
"Index"_ustr;
208 if (input.identifier_ustr() == index_identifier) {
213 context, *
node.input_by_identifier(index_identifier), socket_result_fn);
214 if (!
index.has_value()) {
243 if (
node.is_group_output()) {
248 return result->should_compute();
251 if (
node.is_type(
"GeometryNodeSwitch"_ustr)) {
255 if (
node.is_type(
"GeometryNodeMenuSwitch"_ustr)) {
259 if (
node.is_type(
"GeometryNodeIndexSwitch"_ustr)) {
277 node_group.ensure_topology_cache();
280 context.needed_side_effect_output_types();
286 auto push_node_to_stack = [&](
const bNode &
node) {
288 if (node_zone == zone) {
297 for (
const bNode *group_node : node_group.group_nodes()) {
298 if (group_node->is_muted() || !group_node->id) {
311 push_node_to_stack(*group_node);
317 *group_node, zone, compute_context, context.compute_context_cache());
318 if (!zone_viewer_compute_context) {
323 context.compute_context_cache().for_group_node(
324 zone_viewer_compute_context, group_node->identifier, &group_node->owner_tree());
325 const ComputeContext *viewer_compute_context = context.viewer_compute_context();
327 viewer_compute_context &&
329 node_compute_context,
330 *viewer_compute_context,
331 context.compute_context_cache()))
333 push_node_to_stack(*group_node);
339 for (
const bNode *
node : node_group.nodes_by_type(
"GeometryNodeWarning"_ustr)) {
340 if (
node->is_muted()) {
349 push_node_to_stack(*
node);
354 for (
const bNode *
node : node_group.nodes_by_type(
"CompositorNodeOutputFile"_ustr)) {
355 if (
node->is_muted()) {
364 push_node_to_stack(*
node);
369 const ComputeContext *viewer_compute_context = context.viewer_compute_context();
371 viewer_compute_context)
373 for (
const bNode *
node : node_group.nodes_by_type(
"CompositorNodeViewer"_ustr)) {
386 *
node, zone, compute_context, context.compute_context_cache());
387 if (!zone_viewer_compute_context) {
391 if (viewer_compute_context != zone_viewer_compute_context) {
395 push_node_to_stack(*
node);
401 const bNode *output_node = node_group.group_output_node();
402 if (!zone && output_node && !output_node->is_muted()) {
403 for (
const bNodeSocket *input : output_node->input_sockets()) {
408 if (
is_input_needed(context, *output_node, *input, socket_result_fn)) {
409 node_stack.
push(output_node);
540 int number_of_input_buffers = 0;
541 int buffers_needed_by_dependencies = 0;
561 number_of_input_buffers++;
567 const int buffers_needed_by_dependency = needed_buffers.
lookup(&
output->owner_node());
568 buffers_needed_by_dependencies = std::max(buffers_needed_by_dependency,
569 buffers_needed_by_dependencies);
573 int number_of_output_buffers = 0;
580 if (!
output->is_logically_linked()) {
591 number_of_output_buffers++;
598 const int total_buffers = std::max(number_of_input_buffers + number_of_output_buffers,
599 buffers_needed_by_dependencies);
600 needed_buffers.
add(&
node, total_buffers);
603 return needed_buffers;
640 if (dependency_node_zone != zone) {
644 dependency_nodes.
add(&
output->owner_node());
675 dependency_nodes.
add(&
output->owner_node());
680 dependency_nodes.
add_multiple(zone_input_dependency_nodes);
729 node_group.ensure_topology_cache();
731 if (node_group.has_available_link_cycle() || !zones) {
737 context, node_group, compute_context, zone, socket_result_fn);
746 context, node_stack, socket_result_fn);
759 context, schedule,
node, zone, socket_result_fn);
763 std::ranges::stable_sort(dependency_nodes, [&](
const bNode *a,
const bNode *
b) {
770 if (dependency_nodes.is_empty()) {
794 if (ignored_nodes && ignored_nodes->
contains(&input->owner_node())) {
801 if (target_zone == schedule.
zone && schedule.
nodes.
contains(&input->owner_node())) {
811 input->owner_node().identifier);
812 if (target_zone == schedule.
zone && target_zone != target_node_zone &&
837 if (child_zones_counted.
contains(child_zone)) {
842 child_zones_counted.
add_new(child_zone);
static const CPPType & get()
constexpr IndexRange()=default
bool add(const Key &key, const Value &value)
const Value & lookup(const Key &key) const
bool contains(const Key &key) const
bool contains(const Key &key) const
void add_new(const Key &key)
void push(const T &value)
void push_multiple(Span< T > values)
void add_multiple(Span< Key > keys)
bool contains(const Key &key) const
const GroupNodeComputeContext & for_group_node(const ComputeContext *parent, int32_t node_id, const bNodeTree *tree=nullptr)
void convert_to_uninitialized(const CPPType &from_type, const CPPType &to_type, const void *from_value, void *to_value) const
bool is_convertible(const CPPType &from_type, const CPPType &to_type) const
bool contains_zone_recursively(const bNodeTreeZone &other_zone) const
bNodeTreeZone * parent_zone
const bNode * output_node() const
Vector< const bNodeLink * > border_links
bool contains_node_recursively(const bNode &node) const
const bNode * input_node() const
Vector< const bNodeTreeZone * > get_zones_to_enter(const bNodeTreeZone *outer_zone, const bNodeTreeZone *inner_zone) const
const bNodeTreeZone * get_zone_by_node(const int32_t node_id) const
const bNodeTreeZone * get_zone_by_socket(const bNodeSocket &socket) const
#define storage(slot, qualifiers)
const ComputeContext * get_zone_viewer_compute_context(const bNode &node, const bke::bNodeTreeZone *zone, const ComputeContext &compute_context, bke::ComputeContextCache &compute_context_cache)
const DataTypeConversions & get_implicit_type_conversions()
int compute_output_reference_count(const bNodeSocket &output, const Schedule &schedule, const VectorSet< const bNode * > *ignored_nodes=nullptr)
static Stack< const bNode * > get_output_nodes(const Context &context, const bNodeTree &node_group, const ComputeContext &compute_context, const bke::bNodeTreeZone *zone, SocketResultFn socket_result_fn)
static bool is_input_needed(const Context &context, const bNode &node, const bNodeSocket &input, SocketResultFn socket_result_fn)
Map< const bNode *, int > NeededBuffers
static bool is_index_switch_node_input_needed(const Context &context, const bNode &node, const bNodeSocket &input, SocketResultFn socket_result_fn)
Schedule compute_schedule(const Context &context, const bNodeTree &node_group, const ComputeContext &compute_context, SocketResultFn socket_result_fn, const bke::bNodeTreeZone *zone=nullptr)
static Vector< const bNode * > find_node_dependency_nodes(const Context &context, Schedule &schedule, const bNode &node, const bke::bNodeTreeZone *zone, SocketResultFn socket_result_fn)
const bNodeSocket * get_output_linked_to_input(const bNodeSocket &input)
static bool is_switch_node_input_needed(const Context &context, const bNode &node, const bNodeSocket &input, SocketResultFn socket_result_fn)
static Vector< const bNode * > find_dependency_nodes(const Context &context, Schedule &schedule, const bNode &node, const bke::bNodeTreeZone *zone, SocketResultFn socket_result_fn)
bool is_output_linked_to_input_conditioned(const bNodeSocket &output, FunctionRef< bool(const bNodeSocket &)> condition)
static bool is_menu_switch_node_input_needed(const Context &context, const bNode &node, const bNodeSocket &input, SocketResultFn socket_result_fn)
static bool has_file_output_recursive(const bNodeTree &node_group)
bool is_pixel_node(const bNode &node)
FunctionRef< Result *(const bNodeSocket &)> SocketResultFn
static std::optional< T > get_input_socket_value(const Context &context, const bNodeSocket &input, SocketResultFn socket_result_fn)
static NeededBuffers compute_number_of_needed_buffers(const Context &context, Stack< const bNode * > &output_nodes, SocketResultFn socket_result_fn)
bool is_socket_available(const bNodeSocket *socket)
static bool has_viewer_node(const bNodeTree &node_group, const ComputeContext &compute_context, const ComputeContext &viewer_compute_context, bke::ComputeContextCache &compute_context_cache)
static Vector< const bNode * > find_zone_dependency_nodes(const Context &context, Schedule &schedule, const bke::bNodeTreeZone &zone, SocketResultFn socket_result_fn)
Set< const bNodeSocket * > unneeded_inputs
const bke::bNodeTreeZone * zone
VectorSet< const bNode * > nodes
const bNodeTree & node_group
static std::string socket_identifier_for_item(const IndexSwitchItem &item)