93 int input_socket_index_;
94 int input_link_index_;
105 return get_default_hash(this->to_node_id_, this->input_socket_index_, this->input_link_index_);
201 std::shared_ptr<const nodes::GeometryNodesLazyFunctionGraphInfo>
446 tree_.runtime->allow_use_dirty_topology_cache.fetch_add(1);
451 tree_.runtime->allow_use_dirty_topology_cache.fetch_sub(1);
476 if (ntree ==
nullptr) {
485 if (
node ==
nullptr) {
513inline bNode *bNodeTree::node_by_id(
const int32_t identifier)
520inline const bNode *bNodeTree::node_by_id(
const int32_t identifier)
const
575inline bool bNodeTree::has_available_link_cycle()
const
581inline bool bNodeTree::has_undefined_nodes_or_sockets()
const
587inline bNode *bNodeTree::group_output_node()
593inline const bNode *bNodeTree::group_output_node()
const
601 return this->nodes_by_type(
"NodeGroupInput"_ustr);
606 return this->nodes_by_type(
"NodeGroupInput"_ustr);
673inline void bNodeTree::ensure_interface_cache()
const
732inline int bNodeTree::interface_input_index_by_identifier(
const StringRef identifier)
const
734 return this->
tree_interface.input_index_by_identifier(identifier);
737inline int bNodeTree::interface_output_index_by_identifier(
const StringRef identifier)
const
739 return this->
tree_interface.output_index_by_identifier(identifier);
748inline int bNode::index()
const
781inline IndexRange bNode::input_socket_indices_in_tree()
const
785 if (num_inputs == 0) {
791inline IndexRange bNode::output_socket_indices_in_tree()
const
795 if (num_outputs == 0) {
801inline IndexRange bNode::input_socket_indices_in_all_inputs()
const
805 if (num_inputs == 0) {
811inline IndexRange bNode::output_socket_indices_in_all_outputs()
const
815 if (num_outputs == 0) {
869inline const bNodeTree &bNode::owner_tree()
const
883 if (this->
label[0] ==
'\0') {
889inline bool bNode::is_muted()
const
894inline bool bNode::is_selected()
const
899inline bool bNode::is_reroute()
const
904inline bool bNode::is_frame()
const
909inline bool bNode::is_group()
const
914inline bool bNode::is_custom_group()
const
919inline bool bNode::is_group_input()
const
924inline bool bNode::is_group_output()
const
929inline bool bNode::is_undefined()
const
934inline bool bNode::is_type(
const UString query_idname)
const
944inline bool bNode::is_dangling_reroute()
const
978inline bool bNodeLink::is_muted()
const
983inline bool bNodeLink::is_available()
const
985 return this->
fromsock->is_available() && this->
tosock->is_available();
988inline bool bNodeLink::is_used()
const
990 return !this->is_muted() && this->is_available();
999inline int bNodeSocket::index()
const
1005inline int bNodeSocket::index_in_tree()
const
1011inline int bNodeSocket::index_in_all_inputs()
const
1018inline int bNodeSocket::index_in_all_outputs()
const
1025inline UString bNodeSocket::identifier_ustr()
const
1030inline bool bNodeSocket::is_user_hidden()
const
1035inline bool bNodeSocket::is_inactive()
const
1040 return this->is_input() && !this->affects_node_output() &&
1041 !this->owner_node().output_sockets().
is_empty();
1044inline bool bNodeSocket::is_available()
const
1049inline bool bNodeSocket::is_panel_collapsed()
const
1054inline bool bNodeSocket::is_visible()
const
1056 return !this->is_user_hidden() && this->is_available() && this->inferred_socket_visibility();
1059inline bool bNodeSocket::is_icon_visible()
const
1061 return this->is_visible() &&
1062 (this->owner_node().flag &
NODE_COLLAPSED || !this->is_panel_collapsed());
1065inline bool bNodeSocket::may_be_field()
const
1068 nodes::StructureType::Field,
1069 nodes::StructureType::Dynamic);
1072inline bNode &bNodeSocket::owner_node()
1078inline const bNodeTree &bNodeSocket::owner_tree()
const
1084inline bNodeTree &bNodeSocket::owner_tree()
1120inline bool bNodeSocket::is_directly_linked()
const
1122 return !this->directly_linked_links().is_empty();
1125inline bool bNodeSocket::is_logically_linked()
const
1127 return !this->logically_linked_sockets().is_empty();
1130inline const bNodeSocket *bNodeSocket::internal_link_input()
const
1137template<
typename T>
T *bNodeSocket::default_value_typed()
1142template<
typename T>
const T *bNodeSocket::default_value_typed()
const
1147inline bool bNodeSocket::is_input()
const
1152inline bool bNodeSocket::is_output()
const
1157inline bool bNodeSocket::is_multi_input()
const
1162inline const bNode &bNodeSocket::owner_node()
const
1174inline bool bNodePanelState::is_collapsed()
const
1179inline bool bNodePanelState::is_parent_collapsed()
const
1184inline bool bNodePanelState::has_visible_content()
const
#define NODE_CUSTOM_GROUP
#define NODE_GROUP_OUTPUT
static constexpr IndexRange from_begin_size(const int64_t begin, const int64_t size)
int64_t index_of_as(const ForwardKey &key) const
const Key * lookup_key_ptr_as(const ForwardKey &key) const
Span< Key > as_span() const
bNodeSocket * input_socket
std::optional< float > header_center_y
std::optional< bNodePanelExtent > content_extent
bool has_available_linked_inputs
Array< bNodePanelRuntime > panels
bool forward_compatible_versioning_done
Vector< bNode * > direct_children_in_frame
Vector< bNodeSocket * > outputs
Map< UString, bNodeSocket * > inputs_by_identifier
Vector< bNodeInternalLink > internal_links
int toposort_left_to_right_index
Vector< bNodeSocket * > inputs
Map< UString, bNodeSocket * > outputs_by_identifier
int toposort_right_to_left_index
bool has_available_linked_outputs
nodes::NodeDeclaration * declaration
Vector< bNodeSocket * > logically_linked_skipped_sockets
Vector< bNodeSocket * > directly_linked_sockets
Vector< bNodeSocket * > logically_linked_sockets
int index_in_inout_sockets
bNodeSocket * internal_link_input
Vector< bNodeLink * > directly_linked_links
nodes::StructureType inferred_structure_type
const nodes::SocketDeclaration * declaration
MultiValueMap< NodeLinkKey, NodeLinkError > link_errors
uint32_t output_topology_hash
std::unique_ptr< LoggedZoneGraphs > logged_zone_graphs
Vector< bNode * > root_frames
Vector< bNodeSocket * > output_sockets
std::unique_ptr< node_tree_reference_lifetimes::ReferenceLifetimesInfo > reference_lifetimes_info
Vector< bNode * > toposort_right_to_left
std::shared_ptr< nodes::GeneratedTreeSrnaData > compositor_effect_nodes_srna_data
std::shared_ptr< nodes::GeneratedTreeSrnaData > scene_compositor_effect_srna_data
Vector< bNode * > group_nodes
Array< nodes::socket_usage_inference::SocketUsage > inferenced_socket_usage
bNode * group_output_node
Vector< bNodeSocket * > sockets
uint32_t previews_refresh_state
CacheMutex topology_cache_mutex
bool has_undefined_nodes_or_sockets
CacheMutex tree_zones_cache_mutex
bool has_available_link_cycle
CacheMutex geometry_nodes_lazy_function_graph_info_mutex
std::unique_ptr< nodes::EvalDependencies > eval_dependencies
Vector< bNodeLink * > links
std::unique_ptr< nodes::StructureTypeInterface > structure_type_interface
std::unique_ptr< nodes::gizmos::TreeGizmoPropagation > gizmo_propagation
Set< const bNodeSocket * > sockets_on_active_gizmo_paths
CacheMutex inferenced_input_socket_usage_mutex
std::atomic< bool > topology_cache_exists
Set< int > invalid_zone_output_node_ids
std::shared_ptr< const nodes::GeometryNodesLazyFunctionGraphInfo > geometry_nodes_lazy_function_graph_info
MultiValueMap< const bNodeType *, bNode * > nodes_by_type
std::shared_ptr< nodes::GeneratedTreeSrnaData > geometry_nodes_srna_data
std::shared_ptr< bNodeTreeZones > tree_zones
NodeIDVectorSet nodes_by_id
std::shared_ptr< bNodeTreeZones > last_valid_zones
std::atomic< int > allow_use_dirty_topology_cache
Map< int32_t, VectorSet< nodes::NodeWarning > > shader_node_errors
Mutex shader_node_errors_mutex
Vector< bNode * > toposort_left_to_right
std::shared_ptr< nodes::GeneratedTreeSrnaData > compositor_nodes_srna_data
Vector< bNodeSocket * > input_sockets
const nodes::GeometryNodesLazyFunctionGraphInfo * self_geometry_nodes_lazy_function_graph_info
AllowUsingOutdatedInfo(const bNodeTree &tree)
~AllowUsingOutdatedInfo()
NonCopyable(const NonCopyable &other)=delete
NonMovable(NonMovable &&other)=delete
bool update_structure_type_interface(bNodeTree &tree)
bool topology_cache_is_available(const bNodeTree &tree)
void preprocess_geometry_node_tree_for_evaluation(bNodeTree &tree_cow)
CustomIDVectorSet< bNode *, NodeIDGetter > NodeIDVectorSet
bNodeType * node_type_find(UString idname)
bNodeType NodeTypeUndefined
unsigned __int64 uint64_t
VecBase< float, 2 > float2
VectorSet< T, InlineBufferCapacity, DefaultProbingStrategy, CustomIDHash< T, GetIDFn >, CustomIDEqual< T, GetIDFn > > CustomIDVectorSet
@ NODE_PANEL_PARENT_COLLAPSED
@ NODE_PANEL_CONTENT_VISIBLE
constexpr uint64_t get_default_hash(const T &v, const Args &...args)
friend bool operator==(const bNodeInternalLink &a, const bNodeInternalLink &b)=default
bke::bNodeSocketRuntime * runtime
bke::bNodeTreeInterfaceRuntime * runtime
bNodeTreeInterface tree_interface
bke::bNodeTreeRuntime * runtime
bNestedNodeRef * nested_node_refs
bke::bNodeRuntime * runtime
bNodePanelState * panel_states_array
bke::bNodeType * typeinfo
Map< int, std::string > graph_by_zone_id
int32_t operator()(const bNode *value) const
bNodeLink * try_find(bNodeTree &ntree) const
friend bool operator==(const NodeLinkKey &a, const NodeLinkKey &b)=default
NodeLinkKey(const bNodeLink &link)
bool is_type(UString query_idname) const