123 if (sock->is_output() &&
node->is_reroute()) {
129 switch (sock->
type) {
157 ntree.ensure_topology_cache();
160 if (!zones || zones->
zones.is_empty()) {
165 for (
int old_i =
nodes.size() - 1; old_i >= 0; old_i--) {
177 for (
int new_i = old_i + 1; new_i <
nodes.size(); new_i++) {
210 ntree->ensure_topology_cache();
228 if (
node->is_muted() ||
node->is_reroute()) {
245 exec->
stack = MEM_new_array<bNodeStack>(exec->
stacksize,
"bNodeStack");
254 for (n = 0, nodeexec = exec->
nodeexec; n < nodelist.
size(); n++, nodeexec++) {
255 node = nodeexec->
node = nodelist[n];
262 node->runtime->need_exec = 0;
277 if (
node->typeinfo->init_exec_fn) {
291 MEM_delete(exec->
stack);
294 for (n = 0, nodeexec = exec->
nodeexec; n < exec->totnodes; n++, nodeexec++) {
Read Blender memory allocation and freeing.
IndexRange index_range() const
bNodeSocket * internal_link_input
bool contains_zone_recursively(const bNodeTreeZone &other_zone) const
bNodeTreeZone * parent_zone
std::optional< int > output_node_id
Vector< bNodeTreeZone * > zones
const bNodeTreeZone * get_zone_by_node(const int32_t node_id) const
bNodeInstanceKey node_instance_key(bNodeInstanceKey parent_key, const bNodeTree *ntree, const bNode *node)
static void node_init_input_index(bNodeSocket *sock, int *index)
int node_socket_get_int(bNodeTree *ntree, bNode *, bNodeSocket *sock)
static Vector< bNode * > get_node_code_gen_order(bNodeTree &ntree)
float node_socket_get_float(bNodeTree *ntree, bNode *, bNodeSocket *sock)
static void node_init_output_index(bNodeSocket *sock, int *index)
static bNodeStack * setup_stack(bNodeStack *stack, bNodeTree *ntree, bNode *node, bNodeSocket *sock)
void ntree_exec_end(bNodeTreeExec *exec)
void * MEM_new_zeroed(size_t len, const char *str) ATTR_WARN_UNUSED_RESULT ATTR_ALLOC_SIZE(1) ATTR_NONNULL(2)
bNodeStack * node_get_socket_stack(bNodeStack *stack, bNodeSocket *sock)
void BKE_ntree_update_after_single_tree_change(Main &bmain, bNodeTree &modified_tree, const NodeTreeUpdateExtraParams ¶ms={})
void node_socket_get_color(bNodeTree *ntree, bNode *, bNodeSocket *sock, float *value)
void node_socket_get_rotation(bNodeTree *ntree, bNode *, bNodeSocket *sock, float *value)
static void node_init_output_index_muted(bNodeSocket *sock, int *index)
bNodeTreeExec * ntree_exec_begin(bNodeExecContext *context, bNodeTree *ntree, bNodeInstanceKey parent_key)
static int node_exec_socket_use_stack(bNodeSocket *sock)
bool node_socket_get_bool(bNodeTree *ntree, bNode *, bNodeSocket *sock)
void node_socket_get_vector(bNodeTree *ntree, bNode *, bNodeSocket *sock, float *value)
void node_get_stack(bNode *node, bNodeStack *stack, bNodeStack **in, bNodeStack **out)
void * MEM_new_array_zeroed(size_t len, size_t size, const char *str) ATTR_WARN_UNUSED_RESULT ATTR_ALLOC_SIZE(1
bke::NodeFreeExecFunction free_exec_fn
bke::bNodeSocketRuntime * runtime