8bdbbca485
become invalid because the render database is not immediately freed after the job finishes. To avoid access to dangling node pointers, store the function callback in the exec data itself. The node pointer must not be accessed in the free function (wasn't used before either), these functions are purely for the execution data.
97 lines
3.3 KiB
C++
97 lines
3.3 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): Nathan Letwory.
|
|
*
|
|
* ***** END GPL LICENSE BLOCK *****
|
|
*/
|
|
|
|
/** \file blender/nodes/intern/node_exec.h
|
|
* \ingroup nodes
|
|
*/
|
|
|
|
|
|
#ifndef __NODE_EXEC_H__
|
|
#define __NODE_EXEC_H__
|
|
|
|
#include "DNA_listBase.h"
|
|
|
|
#include "BLI_utildefines.h"
|
|
|
|
#include "BKE_node.h"
|
|
|
|
#include "node_util.h"
|
|
|
|
#include "RNA_types.h"
|
|
|
|
struct bNodeTree;
|
|
struct bNode;
|
|
struct bNodeStack;
|
|
|
|
/* Node execution data */
|
|
typedef struct bNodeExec {
|
|
struct bNode *node; /* backpointer to node */
|
|
bNodeExecData data;
|
|
|
|
NodeFreeExecFunction freeexecfunc; /* free function, stored in exec itself to avoid dangling node pointer access */
|
|
} bNodeExec;
|
|
|
|
/* Execution Data for each instance of node tree execution */
|
|
typedef struct bNodeTreeExec {
|
|
struct bNodeTree *nodetree; /* backpointer to node tree */
|
|
|
|
int totnodes; /* total node count */
|
|
struct bNodeExec *nodeexec; /* per-node execution data */
|
|
|
|
int stacksize;
|
|
struct bNodeStack *stack; /* socket data stack */
|
|
/* only used by material and texture trees to keep one stack for each thread */
|
|
ListBase *threadstack; /* one instance of the stack for each thread */
|
|
} bNodeTreeExec;
|
|
|
|
/* stores one stack copy for each thread (material and texture trees) */
|
|
typedef struct bNodeThreadStack {
|
|
struct bNodeThreadStack *next, *prev;
|
|
struct bNodeStack *stack;
|
|
int used;
|
|
} bNodeThreadStack;
|
|
|
|
int node_exec_socket_use_stack(struct bNodeSocket *sock);
|
|
|
|
struct bNodeStack *node_get_socket_stack(struct bNodeStack *stack, struct bNodeSocket *sock);
|
|
void node_get_stack(struct bNode *node, struct bNodeStack *stack, struct bNodeStack **in, struct bNodeStack **out);
|
|
|
|
struct bNodeTreeExec *ntree_exec_begin(struct bNodeExecContext *context, struct bNodeTree *ntree, bNodeInstanceKey parent_key);
|
|
void ntree_exec_end(struct bNodeTreeExec *exec);
|
|
|
|
struct bNodeThreadStack *ntreeGetThreadStack(struct bNodeTreeExec *exec, int thread);
|
|
void ntreeReleaseThreadStack(struct bNodeThreadStack *nts);
|
|
bool ntreeExecThreadNodes(struct bNodeTreeExec *exec, struct bNodeThreadStack *nts, void *callerdata, int thread);
|
|
|
|
struct bNodeTreeExec *ntreeShaderBeginExecTree_internal(struct bNodeExecContext *context, struct bNodeTree *ntree, bNodeInstanceKey parent_key);
|
|
void ntreeShaderEndExecTree_internal(struct bNodeTreeExec *exec);
|
|
|
|
struct bNodeTreeExec *ntreeTexBeginExecTree_internal(struct bNodeExecContext *context, struct bNodeTree *ntree, bNodeInstanceKey parent_key);
|
|
void ntreeTexEndExecTree_internal(struct bNodeTreeExec *exec);
|
|
|
|
#endif
|