Welcome to mirror list, hosted at ThFree Co, Russian Federation.

depsgraph.c « intern « blenkernel « blender « source - git.blender.org/blender.git - Unnamed repository; edit this file 'description' to name the repository.
summaryrefslogtreecommitdiff
blob: c5b8a18fd65714263f5b580035e13becb6823990 (plain)
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
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
/*
 * ***** 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) 2004 Blender Foundation.
 * All rights reserved.
 *
 * Contributor(s): none yet.
 *
 * ***** END GPL LICENSE BLOCK *****
 */

/** \file blender/blenkernel/intern/depsgraph.c
 *  \ingroup bke
 */

 
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>

#include "MEM_guardedalloc.h"

#ifdef WIN32
#  include "BLI_winstuff.h"
#endif

#include "BLI_utildefines.h"

#include "DNA_object_types.h"
#include "DNA_scene_types.h"

#include "BKE_global.h"
#include "BKE_main.h"

#include "depsgraph_private.h"

#include "DEG_depsgraph.h"
#include "DEG_depsgraph_build.h"
#include "DEG_depsgraph_debug.h"
#include "DEG_depsgraph_query.h"

/* *********************************************************************
 * Stubs to avoid linking issues and make sure legacy crap is not used *
 * *********************************************************************
 */

DagNodeQueue *queue_create(int UNUSED(slots))
{
	BLI_assert(!"Should not be used with new dependnecy graph");
	return NULL;
}

void queue_raz(DagNodeQueue *UNUSED(queue))
{
	BLI_assert(!"Should not be used with new dependnecy graph");
}

void queue_delete(DagNodeQueue *UNUSED(queue))
{
	BLI_assert(!"Should not be used with new dependnecy graph");
}

void push_queue(DagNodeQueue *UNUSED(queue), DagNode *UNUSED(node))
{
	BLI_assert(!"Should not be used with new dependnecy graph");
}

void push_stack(DagNodeQueue *UNUSED(queue), DagNode *UNUSED(node))
{
	BLI_assert(!"Should not be used with new dependnecy graph");
}

DagNode *pop_queue(DagNodeQueue *UNUSED(queue))
{
	BLI_assert(!"Should not be used with new dependnecy graph");
	return NULL;
}

DagNode *get_top_node_queue(DagNodeQueue *UNUSED(queue))
{
	BLI_assert(!"Should not be used with new dependnecy graph");
	return NULL;
}

DagForest *dag_init(void)
{
	BLI_assert(!"Should not be used with new dependnecy graph");
	return NULL;
}

DagForest *build_dag(Main *UNUSED(bmain),
                     Scene *UNUSED(sce),
                     short UNUSED(mask))
{
	BLI_assert(!"Should not be used with new dependnecy graph");
	return NULL;
}

void free_forest(DagForest *UNUSED(Dag))
{
	BLI_assert(!"Should not be used with new dependnecy graph");
}

DagNode *dag_find_node(DagForest *UNUSED(forest), void *UNUSED(fob))
{
	BLI_assert(!"Should not be used with new dependnecy graph");
	return NULL;
}

DagNode *dag_add_node(DagForest *UNUSED(forest), void *UNUSED(fob))
{
	BLI_assert(!"Should not be used with new dependnecy graph");
	return NULL;
}

DagNode *dag_get_node(DagForest *UNUSED(forest), void *UNUSED(fob))
{
	BLI_assert(!"Should not be used with new dependnecy graph");
	return NULL;
}

DagNode *dag_get_sub_node(DagForest *UNUSED(forest), void *UNUSED(fob))
{
	BLI_assert(!"Should not be used with new dependnecy graph");
	return NULL;
}

void dag_add_relation(DagForest *UNUSED(forest),
                      DagNode *UNUSED(fob1),
                      DagNode *UNUSED(fob2),
                      short UNUSED(rel),
                      const char *UNUSED(name))
{
	BLI_assert(!"Should not be used with new dependnecy graph");
}

/* debug test functions */

void graph_print_queue(DagNodeQueue *UNUSED(nqueue))
{
	BLI_assert(!"Should not be used with new dependnecy graph");
}

void graph_print_queue_dist(DagNodeQueue *UNUSED(nqueue))
{
	BLI_assert(!"Should not be used with new dependnecy graph");
}

void graph_print_adj_list(DagForest *UNUSED(dag))
{
	BLI_assert(!"Should not be used with new dependnecy graph");
}

void DAG_scene_flush_update(Main *UNUSED(bmain),
                            Scene *UNUSED(sce),
                            unsigned int UNUSED(lay),
                            const short UNUSED(time))
{
	BLI_assert(!"Should not be used with new dependnecy graph");
}

void DAG_scene_update_flags(Main *UNUSED(bmain),
                            Scene *UNUSED(scene),
                            unsigned int UNUSED(lay),
                            const bool UNUSED(do_time),
                            const bool UNUSED(do_invisible_flush))
{
	BLI_assert(!"Should not be used with new dependnecy graph");
}

/* ******************* DAG FOR ARMATURE POSE ***************** */

void DAG_pose_sort(Object *UNUSED(ob))
{
	BLI_assert(!"Should not be used with new dependnecy graph");
}

/* ************************  DAG FOR THREADED UPDATE  ********************* */

void DAG_threaded_update_begin(Scene *UNUSED(scene),
                               void (*func)(void *node, void *user_data),
                               void *UNUSED(user_data))
{
	BLI_assert(!"Should not be used with new dependnecy graph");
	(void)func;
}

void DAG_threaded_update_handle_node_updated(void *UNUSED(node_v),
                                             void (*func)(void *node, void *user_data),
                                             void *UNUSED(user_data))
{
	BLI_assert(!"Should not be used with new dependnecy graph");
	(void)func;
}

/* ************************ DAG querying ********************* */

Object *DAG_get_node_object(void *UNUSED(node_v))
{
	BLI_assert(!"Should not be used with new dependnecy graph");
	return NULL;
}

const char *DAG_get_node_name(Scene *UNUSED(scene), void *UNUSED(node_v))
{
	BLI_assert(!"Should not be used with new dependnecy graph");
	return "INVALID";
}

bool DAG_is_acyclic(Scene *UNUSED(scene))
{
	BLI_assert(!"Should not be used with new dependnecy graph");
	return false;
}

/* ************************************
 * This functions are to be supported *
 * ************************************
 */

void DAG_init(void)
{
	DEG_register_node_types();
}

void DAG_exit(void)
{
	DEG_free_node_types();
}

/* ************************ API *********************** */

void DAG_editors_update_cb(DEG_EditorUpdateIDCb id_func,
                           DEG_EditorUpdateSceneCb scene_func,
                           DEG_EditorUpdateScenePreCb scene_func_pre)
{
	DEG_editors_set_update_cb(id_func, scene_func, scene_func_pre);
}

void DAG_editors_update_pre(Main *bmain, Scene *scene, bool time)
{
	DEG_editors_update_pre(bmain, scene, time);
}

/* Tag all relations for update. */
void DAG_relations_tag_update(Main *bmain)
{
	DEG_relations_tag_update(bmain);
}

/* Rebuild dependency graph only for a given scene. */
void DAG_scene_relations_rebuild(Main *bmain, Scene *scene)
{
	DEG_scene_relations_rebuild(bmain, scene);
}

/* Create dependency graph if it was cleared or didn't exist yet. */
void DAG_scene_relations_update(Main *bmain, Scene *scene)
{
	DEG_scene_relations_update(bmain, scene);
}

void DAG_scene_relations_validate(Main *bmain, Scene *scene)
{
	DEG_debug_scene_relations_validate(bmain, scene);
}

void DAG_scene_free(Scene *scene)
{
	DEG_scene_graph_free(scene);
}

void DAG_on_visible_update(Main *bmain, const bool do_time)
{
	DEG_on_visible_update(bmain, do_time);
}

void DAG_ids_check_recalc(Main *bmain, Scene *scene, bool time)
{
	DEG_ids_check_recalc(bmain, scene, time);
}

void DAG_id_tag_update(ID *id, short flag)
{
	DEG_id_tag_update_ex(G.main, id, flag);
}

void DAG_id_tag_update_ex(Main *bmain, ID *id, short flag)
{
	DEG_id_tag_update_ex(bmain, id, flag);
}

void DAG_id_type_tag(Main *bmain, short idtype)
{
	DEG_id_type_tag(bmain, idtype);
}

int DAG_id_type_tagged(Main *bmain, short idtype)
{
	return DEG_id_type_tagged(bmain, idtype);
}

void DAG_ids_clear_recalc(Main *bmain)
{
	DEG_ids_clear_recalc(bmain);
}

short DAG_get_eval_flags_for_object(Scene *scene, void *object)
{
	return DEG_get_eval_flags_for_id(scene->depsgraph, (ID *)object);
}

void DAG_ids_flush_tagged(Main *bmain)
{
	DEG_ids_flush_tagged(bmain);
}

/* ************************ DAG DEBUGGING ********************* */

void DAG_print_dependencies(Main *UNUSED(bmain),
                            Scene *scene,
                            Object *UNUSED(ob))
{
	DEG_debug_graphviz(scene->depsgraph, stdout, "Depsgraph", false);
}