2011-02-23 10:52:22 +00:00
|
|
|
/*
|
2007-04-04 13:58:12 +00:00
|
|
|
* 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
|
2018-06-01 18:19:39 +02:00
|
|
|
* of the License, or (at your option) any later version.
|
2007-04-04 13:58:12 +00:00
|
|
|
*
|
|
|
|
* 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.
|
|
|
|
*/
|
|
|
|
|
2019-02-06 15:42:22 +11:00
|
|
|
/** \file \ingroup nodes
|
2011-02-27 20:13:22 +00:00
|
|
|
*/
|
|
|
|
|
|
|
|
|
2012-02-17 18:59:41 +00:00
|
|
|
#ifndef __NODE_UTIL_H__
|
|
|
|
#define __NODE_UTIL_H__
|
2007-04-04 13:58:12 +00:00
|
|
|
|
2011-09-05 21:01:50 +00:00
|
|
|
#include "DNA_listBase.h"
|
|
|
|
|
2013-03-18 16:34:57 +00:00
|
|
|
#include "BLI_utildefines.h"
|
|
|
|
|
2011-09-05 21:01:50 +00:00
|
|
|
#include "BKE_node.h"
|
|
|
|
|
2007-04-04 13:58:12 +00:00
|
|
|
#include "MEM_guardedalloc.h"
|
|
|
|
|
2011-09-05 21:01:50 +00:00
|
|
|
#include "NOD_socket.h"
|
|
|
|
|
2011-11-20 16:38:23 +00:00
|
|
|
#include "GPU_material.h" /* For Shader muting GPU code... */
|
|
|
|
|
2013-03-18 16:34:57 +00:00
|
|
|
#include "RNA_access.h"
|
|
|
|
|
2011-09-05 21:01:50 +00:00
|
|
|
struct bNode;
|
2019-01-28 21:08:24 +11:00
|
|
|
struct bNodeTree;
|
2011-09-05 21:01:50 +00:00
|
|
|
|
2013-03-18 16:34:57 +00:00
|
|
|
/* data for initializing node execution */
|
|
|
|
typedef struct bNodeExecContext {
|
|
|
|
struct bNodeInstanceHash *previews;
|
|
|
|
} bNodeExecContext;
|
|
|
|
|
|
|
|
typedef struct bNodeExecData {
|
|
|
|
void *data; /* custom data storage */
|
|
|
|
struct bNodePreview *preview; /* optional preview image */
|
|
|
|
} bNodeExecData;
|
|
|
|
|
2011-09-05 21:01:50 +00:00
|
|
|
/**** Storage Data ****/
|
|
|
|
|
2007-04-05 10:49:25 +00:00
|
|
|
extern void node_free_curves(struct bNode *node);
|
2007-04-04 13:58:12 +00:00
|
|
|
extern void node_free_standard_storage(struct bNode *node);
|
|
|
|
|
2013-03-18 16:34:57 +00:00
|
|
|
extern void node_copy_curves(struct bNodeTree *dest_ntree, struct bNode *dest_node, struct bNode *src_node);
|
|
|
|
extern void node_copy_standard_storage(struct bNodeTree *dest_ntree, struct bNode *dest_node, struct bNode *src_node);
|
|
|
|
extern void *node_initexec_curves(struct bNodeExecContext *context, struct bNode *node, bNodeInstanceKey key);
|
2007-04-04 13:58:12 +00:00
|
|
|
|
2011-09-05 21:01:50 +00:00
|
|
|
/**** Labels ****/
|
|
|
|
|
2013-11-12 18:18:04 +00:00
|
|
|
void node_blend_label(struct bNodeTree *ntree, struct bNode *node, char *label, int maxlen);
|
2018-01-07 22:29:25 +01:00
|
|
|
void node_image_label(struct bNodeTree *ntree, struct bNode *node, char *label, int maxlen);
|
2013-11-12 18:18:04 +00:00
|
|
|
void node_math_label(struct bNodeTree *ntree, struct bNode *node, char *label, int maxlen);
|
|
|
|
void node_vect_math_label(struct bNodeTree *ntree, struct bNode *node, char *label, int maxlen);
|
|
|
|
void node_filter_label(struct bNodeTree *ntree, struct bNode *node, char *label, int maxlen);
|
2011-02-08 12:54:32 +00:00
|
|
|
|
Node callback for handling link insertion and swapping of occupied inputs.
Nodes have a feature for moving existing links to unoccupied sockets when connecting
to an already used input. This is based on the standard legacy socket types (value/float,
vector, color/rgba) and works reasonably well for shader, compositor and texture nodes.
For new pynode systems, however, the hardcoded nature of that feature has major drawbacks:
* It does not take different type systems into account, leading to meaningless connections
when sockets are swapped and making the feature useless or outright debilitating.
* Advanced socket behaviors would be possible with a registerable callback, e.g. creating
extensible input lists that move existing connections down to make room for a new link.
Now any handling of new links is done via the 'insert_links' callback, which can also be
registered through the RNA API. For the legacy shader/compo/tex nodes the behavior is the
same, using a C callback.
Note on the 'use_swap' flag: this has been removed because it was meaningless anyway:
It was disabled only for the insert-node-on-link feature, which works only for
completely unconnected nodes anyway, so there would be nothing to swap in the first place.
2015-12-03 12:51:29 +01:00
|
|
|
|
|
|
|
/*** Link Handling */
|
|
|
|
void node_insert_link_default(struct bNodeTree *ntree, struct bNode *node, struct bNodeLink *link);
|
2012-10-25 16:49:06 +00:00
|
|
|
void node_update_internal_links_default(struct bNodeTree *ntree, struct bNode *node);
|
2011-11-20 16:38:23 +00:00
|
|
|
|
2013-03-18 16:34:57 +00:00
|
|
|
float node_socket_get_float(struct bNodeTree *ntree, struct bNode *node, struct bNodeSocket *sock);
|
|
|
|
void node_socket_set_float(struct bNodeTree *ntree, struct bNode *node, struct bNodeSocket *sock, float value);
|
|
|
|
void node_socket_get_color(struct bNodeTree *ntree, struct bNode *node, struct bNodeSocket *sock, float *value);
|
|
|
|
void node_socket_set_color(struct bNodeTree *ntree, struct bNode *node, struct bNodeSocket *sock, const float *value);
|
|
|
|
void node_socket_get_vector(struct bNodeTree *ntree, struct bNode *node, struct bNodeSocket *sock, float *value);
|
|
|
|
void node_socket_set_vector(struct bNodeTree *ntree, struct bNode *node, struct bNodeSocket *sock, const float *value);
|
|
|
|
|
2007-04-04 13:58:12 +00:00
|
|
|
#endif
|