a12a8a71bb
The goal is to solve confusion of the "All rights reserved" for licensing
code under an open-source license.
The phrase "All rights reserved" comes from a historical convention that
required this phrase for the copyright protection to apply. This convention
is no longer relevant.
However, even though the phrase has no meaning in establishing the copyright
it has not lost meaning in terms of licensing.
This change makes it so code under the Blender Foundation copyright does
not use "all rights reserved". This is also how the GPL license itself
states how to apply it to the source code:
<one line to give the program's name and a brief idea of what it does.>
Copyright (C) <year> <name of author>
This program is free software ...
This change does not change copyright notice in cases when the copyright
is dual (BF and an author), or just an author of the code. It also does
mot change copyright which is inherited from NaN Holding BV as it needs
some further investigation about what is the proper way to handle it.
73 lines
1.9 KiB
C
73 lines
1.9 KiB
C
/* SPDX-License-Identifier: GPL-2.0-or-later
|
|
* Copyright 2007 Blender Foundation */
|
|
|
|
/** \file
|
|
* \ingroup nodes
|
|
*/
|
|
|
|
#pragma once
|
|
|
|
#include "DNA_listBase.h"
|
|
|
|
#include "BLI_utildefines.h"
|
|
|
|
#include "BKE_node.h"
|
|
|
|
#include "node_util.h"
|
|
|
|
#include "RNA_types.h"
|
|
|
|
#ifdef __cplusplus
|
|
extern "C" {
|
|
#endif
|
|
|
|
struct bNode;
|
|
struct bNodeStack;
|
|
struct bNodeTree;
|
|
|
|
/* Node execution data */
|
|
typedef struct bNodeExec {
|
|
/** Back-pointer to node. */
|
|
struct bNode *node;
|
|
bNodeExecData data;
|
|
|
|
/** Free function, stored in exec itself to avoid dangling node pointer access. */
|
|
NodeFreeExecFunction free_exec_fn;
|
|
} bNodeExec;
|
|
|
|
/* Execution Data for each instance of node tree execution */
|
|
typedef struct bNodeTreeExec {
|
|
struct bNodeTree *nodetree; /* Back-pointer 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;
|
|
bool used;
|
|
} bNodeThreadStack;
|
|
|
|
/** For a given socket, find the actual stack entry. */
|
|
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);
|
|
|
|
#ifdef __cplusplus
|
|
}
|
|
#endif
|