2011-02-23 10:52:22 +00:00
|
|
|
/*
|
2007-04-04 13:58:12 +00:00
|
|
|
* ***** 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,
|
2010-02-12 13:34:04 +00:00
|
|
|
* Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
|
2007-04-04 13:58:12 +00:00
|
|
|
*
|
|
|
|
* The Original Code is Copyright (C) 2007 Blender Foundation.
|
|
|
|
* All rights reserved.
|
|
|
|
*
|
|
|
|
* The Original Code is: all of this file.
|
|
|
|
*
|
|
|
|
* Contributor(s): Nathan Letwory.
|
|
|
|
*
|
|
|
|
* ***** END GPL LICENSE BLOCK *****
|
|
|
|
*/
|
|
|
|
|
2011-02-27 20:13:22 +00:00
|
|
|
/** \file blender/nodes/intern/node_util.c
|
|
|
|
* \ingroup nodes
|
|
|
|
*/
|
|
|
|
|
|
|
|
|
2011-09-05 21:01:50 +00:00
|
|
|
#include "DNA_action_types.h"
|
|
|
|
#include "DNA_node_types.h"
|
|
|
|
|
|
|
|
#include "BLI_listbase.h"
|
|
|
|
#include "BLI_utildefines.h"
|
|
|
|
|
2012-03-17 14:42:44 +00:00
|
|
|
#include "BLF_translation.h"
|
|
|
|
|
2011-09-05 21:01:50 +00:00
|
|
|
#include "BKE_colortools.h"
|
|
|
|
#include "BKE_node.h"
|
2007-04-04 13:58:12 +00:00
|
|
|
|
2011-02-08 12:54:32 +00:00
|
|
|
#include "RNA_access.h"
|
|
|
|
#include "RNA_enum_types.h"
|
|
|
|
|
2011-09-05 21:01:50 +00:00
|
|
|
#include "MEM_guardedalloc.h"
|
|
|
|
|
|
|
|
#include "node_util.h"
|
|
|
|
|
|
|
|
/**** Storage Data ****/
|
|
|
|
|
2007-04-05 10:49:25 +00:00
|
|
|
void node_free_curves(bNode *node)
|
2007-04-04 13:58:12 +00:00
|
|
|
{
|
|
|
|
curvemapping_free(node->storage);
|
|
|
|
}
|
|
|
|
|
|
|
|
void node_free_standard_storage(bNode *node)
|
|
|
|
{
|
|
|
|
MEM_freeN(node->storage);
|
|
|
|
}
|
|
|
|
|
2007-04-05 10:49:25 +00:00
|
|
|
void node_copy_curves(bNode *orig_node, bNode *new_node)
|
2007-04-04 13:58:12 +00:00
|
|
|
{
|
|
|
|
new_node->storage= curvemapping_copy(orig_node->storage);
|
|
|
|
}
|
|
|
|
|
|
|
|
void node_copy_standard_storage(bNode *orig_node, bNode *new_node)
|
|
|
|
{
|
|
|
|
new_node->storage= MEM_dupallocN(orig_node->storage);
|
|
|
|
}
|
|
|
|
|
2011-09-05 21:01:50 +00:00
|
|
|
/**** Labels ****/
|
|
|
|
|
2011-02-08 12:54:32 +00:00
|
|
|
const char *node_blend_label(bNode *node)
|
|
|
|
{
|
|
|
|
const char *name;
|
2011-03-19 10:26:15 +00:00
|
|
|
RNA_enum_name(ramp_blend_items, node->custom1, &name);
|
2012-03-17 14:42:44 +00:00
|
|
|
return IFACE_(name);
|
2011-02-08 12:54:32 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
const char *node_math_label(bNode *node)
|
|
|
|
{
|
|
|
|
const char *name;
|
|
|
|
RNA_enum_name(node_math_items, node->custom1, &name);
|
2012-03-17 14:42:44 +00:00
|
|
|
return IFACE_(name);
|
2011-02-08 12:54:32 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
const char *node_vect_math_label(bNode *node)
|
|
|
|
{
|
|
|
|
const char *name;
|
|
|
|
RNA_enum_name(node_vec_math_items, node->custom1, &name);
|
2012-03-17 14:42:44 +00:00
|
|
|
return IFACE_(name);
|
2011-02-08 12:54:32 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
const char *node_filter_label(bNode *node)
|
|
|
|
{
|
|
|
|
const char *name;
|
|
|
|
RNA_enum_name(node_filter_items, node->custom1, &name);
|
2012-03-17 14:42:44 +00:00
|
|
|
return IFACE_(name);
|
2011-02-08 12:54:32 +00:00
|
|
|
}
|
2011-11-20 16:38:23 +00:00
|
|
|
|
2012-02-27 17:38:16 +00:00
|
|
|
ListBase node_internal_connect_default(bNodeTree *ntree, bNode *node)
|
2011-11-20 16:38:23 +00:00
|
|
|
{
|
|
|
|
ListBase ret;
|
2012-03-22 16:07:41 +00:00
|
|
|
bNodeSocket *fromsock_first=NULL, *tosock_first=NULL; /* used for fallback link if no other reconnections are found */
|
|
|
|
int datatype;
|
|
|
|
int num_links_in = 0, num_links_out = 0, num_reconnect = 0;
|
2011-11-20 16:38:23 +00:00
|
|
|
|
|
|
|
ret.first = ret.last = NULL;
|
|
|
|
|
|
|
|
/* Security check! */
|
2012-02-27 17:38:16 +00:00
|
|
|
if(!ntree)
|
2011-11-20 16:38:23 +00:00
|
|
|
return ret;
|
|
|
|
|
2012-03-22 16:07:41 +00:00
|
|
|
for (datatype=0; datatype < NUM_SOCKET_TYPES; ++datatype) {
|
|
|
|
bNodeSocket *fromsock=NULL, *tosock=NULL;
|
|
|
|
bNodeLink *link;
|
|
|
|
|
|
|
|
/* Connect the first input of each type with outputs of the same type. */
|
|
|
|
|
|
|
|
for (link=ntree->links.first; link; link=link->next) {
|
|
|
|
if (link->tonode == node && link->tosock->type == datatype) {
|
|
|
|
fromsock = link->tosock;
|
|
|
|
++num_links_in;
|
|
|
|
if (!fromsock_first)
|
|
|
|
fromsock_first = fromsock;
|
2011-11-20 16:38:23 +00:00
|
|
|
break;
|
|
|
|
}
|
2012-03-22 16:07:41 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
for (link=ntree->links.first; link; link=link->next) {
|
|
|
|
if (link->fromnode == node && link->fromsock->type == datatype) {
|
|
|
|
tosock = link->fromsock;
|
|
|
|
++num_links_out;
|
|
|
|
if (!tosock_first)
|
|
|
|
tosock_first = tosock;
|
|
|
|
|
|
|
|
if (fromsock) {
|
|
|
|
bNodeLink *ilink = MEM_callocN(sizeof(bNodeLink), "internal node link");
|
|
|
|
ilink->fromnode = node;
|
|
|
|
ilink->fromsock = fromsock;
|
|
|
|
ilink->tonode = node;
|
|
|
|
ilink->tosock = tosock;
|
|
|
|
/* internal link is always valid */
|
|
|
|
ilink->flag |= NODE_LINK_VALID;
|
|
|
|
BLI_addtail(&ret, ilink);
|
|
|
|
|
|
|
|
++num_reconnect;
|
|
|
|
}
|
2011-11-20 16:38:23 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
2012-03-22 16:07:41 +00:00
|
|
|
|
|
|
|
/* if there is one input and one output link, but no reconnections by type,
|
|
|
|
* simply connect those two sockets.
|
|
|
|
*/
|
|
|
|
if (num_reconnect==0 && num_links_in==1 && num_links_out==1) {
|
|
|
|
bNodeLink *ilink = MEM_callocN(sizeof(bNodeLink), "internal node link");
|
|
|
|
ilink->fromnode = node;
|
|
|
|
ilink->fromsock = fromsock_first;
|
|
|
|
ilink->tonode = node;
|
|
|
|
ilink->tosock = tosock_first;
|
|
|
|
/* internal link is always valid */
|
|
|
|
ilink->flag |= NODE_LINK_VALID;
|
|
|
|
BLI_addtail(&ret, ilink);
|
|
|
|
}
|
|
|
|
|
2011-11-20 16:38:23 +00:00
|
|
|
return ret;
|
|
|
|
}
|