1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
|
/*
* ***** 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) 2013 Blender Foundation.
* All rights reserved.
*
* Original Author: Joshua Leung
* Contributor(s): None Yet
*
* ***** END GPL LICENSE BLOCK *****
*/
/** \file blender/depsgraph/intern/depsgraph_intern.h
* \ingroup depsgraph
*
* API's for internal use in the Depsgraph
* - Also, defines for "Node Type Info"
*/
#ifndef __DEPSGRAPH_INTERN_H__
#define __DEPSGRAPH_INTERN_H__
#include <cstdlib>
#include "MEM_guardedalloc.h"
#include "depsgraph.h"
#include "depsnode.h"
struct Main;
struct Group;
struct Scene;
/* Graph Building ======================================================== */
/**
* Build depsgraph for the given group, and dump results in given graph container
* This is usually used for building subgraphs for groups to use...
*/
void DEG_graph_build_from_group(Depsgraph *graph, struct Main *bmain, struct Group *group);
/* Build subgraph for group */
DepsNode *DEG_graph_build_group_subgraph(Depsgraph *graph_main, struct Main *bmain, struct Group *group);
/* Graph Copying ========================================================= */
/* (Part of the Filtering API) */
/**
* Depsgraph Copying Context (dcc)
*
* Keeps track of node relationships/links/etc. during the copy
* operation so that they can be safely remapped...
*/
typedef struct DepsgraphCopyContext {
struct GHash *nodes_hash; /* <DepsNode, DepsNode> mapping from src node to dst node */
struct GHash *rels_hash; // XXX: same for relationships?
// XXX: filtering criteria...
} DepsgraphCopyContext;
/* Internal Filtering API ---------------------------------------------- */
/* Create filtering context */
// XXX: needs params for conditions?
DepsgraphCopyContext *DEG_filter_init(void);
/* Free filtering context once filtering is done */
void DEG_filter_cleanup(DepsgraphCopyContext *dcc);
/* Data Copy Operations ------------------------------------------------ */
/**
* Make a (deep) copy of provided node and it's little subgraph
* \warning Newly created node is not added to the existing graph
* \param dcc: Context info for helping resolve links
*/
DepsNode *DEG_copy_node(DepsgraphCopyContext *dcc, const DepsNode *src);
/* Node Types Handling ================================================= */
/* "Typeinfo" for Node Types ------------------------------------------- */
/* Typeinfo Struct (nti) */
struct DepsNodeFactory {
virtual eDepsNode_Type type() const = 0;
virtual eDepsNode_Class tclass() const = 0;
virtual const char *tname() const = 0;
virtual DepsNode *create_node(const ID *id, const string &subdata, const string &name) const = 0;
virtual DepsNode *copy_node(DepsgraphCopyContext *dcc, const DepsNode *copy) const = 0;
};
template <class NodeType>
struct DepsNodeFactoryImpl : public DepsNodeFactory {
eDepsNode_Type type() const { return NodeType::typeinfo.type; }
eDepsNode_Class tclass() const { return NodeType::typeinfo.tclass; }
const char *tname() const { return NodeType::typeinfo.tname; }
DepsNode *create_node(const ID *id, const string &subdata, const string &name) const
{
DepsNode *node = OBJECT_GUARDED_NEW(NodeType);
/* populate base node settings */
node->type = type();
node->tclass = tclass();
if (!name.empty())
/* set name if provided ... */
node->name = name;
else
/* ... otherwise use default type name */
node->name = tname();
node->init(id, subdata);
return node;
}
virtual DepsNode *copy_node(DepsgraphCopyContext *dcc, const DepsNode *copy) const
{
BLI_assert(copy->type == type());
DepsNode *node = OBJECT_GUARDED_NEW(NodeType);
/* populate base node settings */
node->type = type();
node->tclass = tclass();
// XXX: need to review the name here, as we can't have exact duplicates...
node->name = copy->name;
node->copy(dcc, static_cast<const NodeType *>(copy));
return node;
}
};
/* Typeinfo Management -------------------------------------------------- */
/* Register typeinfo */
void DEG_register_node_typeinfo(DepsNodeFactory *factory);
/* Get typeinfo for specified type */
DepsNodeFactory *DEG_get_node_factory(const eDepsNode_Type type);
/* Get typeinfo for provided node */
DepsNodeFactory *DEG_node_get_factory(const DepsNode *node);
/* Editors Integration -------------------------------------------------- */
void deg_editors_id_update(struct Main *bmain, struct ID *id);
void deg_editors_scene_update(struct Main *bmain, struct Scene *scene, bool updated);
#endif /* __DEPSGRAPH_INTERN_H__ */
|
