f961afece0
The reason is that the per-node updates used for Reroute node type inheritance are not supposed to be looking at connected nodes, they are purely for "local" updates. For this sort of "global" update which requires depth-first search, the update function on the node tree level must be used instead.
65 lines
2.2 KiB
C++
65 lines
2.2 KiB
C++
/*
|
|
* ***** BEGIN GPL LICENSE BLOCK *****
|
|
*
|
|
* This program is free software; you can redistribute it and/or
|
|
* modify it under the terms of the GNU General Public License
|
|
* as published by the Free Software Foundation; either version 2
|
|
* of the License, or (at your option) any later version.
|
|
*
|
|
* This program is distributed in the hope that it will be useful,
|
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
* GNU General Public License for more details.
|
|
*
|
|
* You should have received a copy of the GNU General Public License
|
|
* along with this program; if not, write to the Free Software Foundation,
|
|
* Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
|
|
*
|
|
* The Original Code is Copyright (C) 2007 Blender Foundation.
|
|
* All rights reserved.
|
|
*
|
|
* The Original Code is: all of this file.
|
|
*
|
|
* Contributor(s): Lukas Toenne.
|
|
*
|
|
* ***** END GPL LICENSE BLOCK *****
|
|
*/
|
|
|
|
/** \file blender/nodes/intern/node_common.h
|
|
* \ingroup nodes
|
|
*/
|
|
|
|
|
|
#ifndef __NODE_COMMON_H__
|
|
#define __NODE_COMMON_H__
|
|
|
|
#include "DNA_listBase.h"
|
|
|
|
struct bNodeTree;
|
|
|
|
void node_group_init(struct bNodeTree *ntree, struct bNode *node, struct bNodeTemplate *ntemp);
|
|
void node_forloop_init(struct bNodeTree *ntree, struct bNode *node, struct bNodeTemplate *ntemp);
|
|
void node_whileloop_init(struct bNodeTree *ntree, struct bNode *node, struct bNodeTemplate *ntemp);
|
|
|
|
void node_forloop_init_tree(struct bNodeTree *ntree);
|
|
void node_whileloop_init_tree(struct bNodeTree *ntree);
|
|
|
|
const char *node_group_label(struct bNode *node);
|
|
|
|
struct bNodeTemplate node_group_template(struct bNode *node);
|
|
struct bNodeTemplate node_forloop_template(struct bNode *node);
|
|
struct bNodeTemplate node_whileloop_template(struct bNode *node);
|
|
|
|
int node_group_valid(struct bNodeTree *ntree, struct bNodeTemplate *ntemp);
|
|
void node_group_verify(struct bNodeTree *ntree, struct bNode *node, struct ID *id);
|
|
|
|
struct bNodeTree *node_group_edit_get(struct bNode *node);
|
|
struct bNodeTree *node_group_edit_set(struct bNode *node, int edit);
|
|
void node_group_edit_clear(bNode *node);
|
|
|
|
void node_loop_update_tree(struct bNodeTree *ngroup);
|
|
|
|
void ntree_update_reroute_nodes(struct bNodeTree *ntree);
|
|
|
|
#endif
|