Campbell Barton
c434782e3a
Use a shorter/simpler license convention, stops the header taking so much space. Follow the SPDX license specification: https://spdx.org/licenses - C/C++/objc/objc++ - Python - Shell Scripts - CMake, GNUmakefile While most of the source tree has been included - `./extern/` was left out. - `./intern/cycles` & `./intern/atomic` are also excluded because they use different header conventions. doc/license/SPDX-license-identifiers.txt has been added to list SPDX all used identifiers. See P2788 for the script that automated these edits. Reviewed By: brecht, mont29, sergey Ref D14069
106 lines
2.9 KiB
C++
106 lines
2.9 KiB
C++
/* SPDX-License-Identifier: GPL-2.0-or-later
|
|
* Copyright 2013 Blender Foundation. */
|
|
|
|
#pragma once
|
|
|
|
#include "DNA_node_types.h"
|
|
|
|
#ifdef WITH_CXX_GUARDEDALLOC
|
|
# include "MEM_guardedalloc.h"
|
|
#endif
|
|
|
|
namespace blender::compositor {
|
|
|
|
class CompositorContext;
|
|
class Node;
|
|
class NodeInput;
|
|
class NodeOutput;
|
|
|
|
/**
|
|
* Internal representation of DNA node data.
|
|
* This structure is converted into operations by \a NodeCompiler.
|
|
*/
|
|
class NodeGraph {
|
|
public:
|
|
struct Link {
|
|
NodeOutput *from;
|
|
NodeInput *to;
|
|
|
|
Link(NodeOutput *from, NodeInput *to) : from(from), to(to)
|
|
{
|
|
}
|
|
};
|
|
|
|
private:
|
|
Vector<Node *> nodes_;
|
|
Vector<Link> links_;
|
|
|
|
public:
|
|
~NodeGraph();
|
|
|
|
const Vector<Node *> &nodes() const
|
|
{
|
|
return nodes_;
|
|
}
|
|
const Vector<Link> &links() const
|
|
{
|
|
return links_;
|
|
}
|
|
|
|
void from_bNodeTree(const CompositorContext &context, bNodeTree *tree);
|
|
|
|
protected:
|
|
typedef std::pair<Vector<Node *>::iterator, Vector<Node *>::iterator> NodeRange;
|
|
|
|
static bNodeSocket *find_b_node_input(bNode *b_node, const char *identifier);
|
|
static bNodeSocket *find_b_node_output(bNode *b_node, const char *identifier);
|
|
|
|
void add_node(Node *node, bNodeTree *b_ntree, bNodeInstanceKey key, bool is_active_group);
|
|
void add_link(NodeOutput *from_socket, NodeInput *to_socket);
|
|
|
|
void add_bNodeTree(const CompositorContext &context,
|
|
int nodes_start,
|
|
bNodeTree *tree,
|
|
bNodeInstanceKey parent_key);
|
|
|
|
void add_bNode(const CompositorContext &context,
|
|
bNodeTree *b_ntree,
|
|
bNode *b_node,
|
|
bNodeInstanceKey key,
|
|
bool is_active_group);
|
|
|
|
NodeOutput *find_output(const NodeRange &node_range, bNodeSocket *b_socket);
|
|
void add_bNodeLink(const NodeRange &node_range, bNodeLink *b_nodelink);
|
|
|
|
/* **** Special proxy node type conversions **** */
|
|
/* These nodes are not represented in the node graph themselves,
|
|
* but converted into a number of proxy links
|
|
*/
|
|
|
|
void add_proxies_mute(bNodeTree *b_ntree,
|
|
bNode *b_node,
|
|
bNodeInstanceKey key,
|
|
bool is_active_group);
|
|
void add_proxies_skip(bNodeTree *b_ntree,
|
|
bNode *b_node,
|
|
bNodeInstanceKey key,
|
|
bool is_active_group);
|
|
|
|
void add_proxies_group_inputs(bNode *b_node, bNode *b_node_io);
|
|
void add_proxies_group_outputs(const CompositorContext &context,
|
|
bNode *b_node,
|
|
bNode *b_node_io);
|
|
void add_proxies_group(const CompositorContext &context, bNode *b_node, bNodeInstanceKey key);
|
|
|
|
void add_proxies_reroute(bNodeTree *b_ntree,
|
|
bNode *b_node,
|
|
bNodeInstanceKey key,
|
|
bool is_active_group);
|
|
|
|
#ifdef WITH_CXX_GUARDEDALLOC
|
|
MEM_CXX_CLASS_ALLOC_FUNCS("COM:NodeGraph")
|
|
#endif
|
|
};
|
|
|
|
} // namespace blender::compositor
|