Campbell Barton
c434782e3a
Use a shorter/simpler license convention, stops the header taking so much space. Follow the SPDX license specification: https://spdx.org/licenses - C/C++/objc/objc++ - Python - Shell Scripts - CMake, GNUmakefile While most of the source tree has been included - `./extern/` was left out. - `./intern/cycles` & `./intern/atomic` are also excluded because they use different header conventions. doc/license/SPDX-license-identifiers.txt has been added to list SPDX all used identifiers. See P2788 for the script that automated these edits. Reviewed By: brecht, mont29, sergey Ref D14069
97 lines
2.8 KiB
C++
97 lines
2.8 KiB
C++
/* SPDX-License-Identifier: GPL-2.0-or-later
|
|
* Copyright 2015 Blender Foundation. All rights reserved. */
|
|
|
|
/** \file
|
|
* \ingroup depsgraph
|
|
*/
|
|
|
|
#include "intern/builder/deg_builder_transitive.h"
|
|
|
|
#include "MEM_guardedalloc.h"
|
|
|
|
#include "intern/node/deg_node.h"
|
|
#include "intern/node/deg_node_component.h"
|
|
#include "intern/node/deg_node_operation.h"
|
|
|
|
#include "intern/debug/deg_debug.h"
|
|
#include "intern/depsgraph.h"
|
|
#include "intern/depsgraph_relation.h"
|
|
|
|
namespace blender::deg {
|
|
|
|
/* -------------------------------------------------- */
|
|
|
|
/* Performs a transitive reduction to remove redundant relations.
|
|
* https://en.wikipedia.org/wiki/Transitive_reduction
|
|
*
|
|
* XXX The current implementation is somewhat naive and has O(V*E) worst case
|
|
* runtime.
|
|
* A more optimized algorithm can be implemented later, e.g.
|
|
*
|
|
* http://www.sciencedirect.com/science/article/pii/0304397588900321/pdf?md5=3391e309b708b6f9cdedcd08f84f4afc&pid=1-s2.0-0304397588900321-main.pdf
|
|
*
|
|
* Care has to be taken to make sure the algorithm can handle the cyclic case
|
|
* too! (unless we can to prevent this case early on).
|
|
*/
|
|
|
|
enum {
|
|
OP_VISITED = 1,
|
|
OP_REACHABLE = 2,
|
|
};
|
|
|
|
static void deg_graph_tag_paths_recursive(Node *node)
|
|
{
|
|
if (node->custom_flags & OP_VISITED) {
|
|
return;
|
|
}
|
|
node->custom_flags |= OP_VISITED;
|
|
for (Relation *rel : node->inlinks) {
|
|
deg_graph_tag_paths_recursive(rel->from);
|
|
/* Do this only in inlinks loop, so the target node does not get
|
|
* flagged. */
|
|
rel->from->custom_flags |= OP_REACHABLE;
|
|
}
|
|
}
|
|
|
|
void deg_graph_transitive_reduction(Depsgraph *graph)
|
|
{
|
|
int num_removed_relations = 0;
|
|
Vector<Relation *> relations_to_remove;
|
|
|
|
for (OperationNode *target : graph->operations) {
|
|
/* Clear tags. */
|
|
for (OperationNode *node : graph->operations) {
|
|
node->custom_flags = 0;
|
|
}
|
|
/* Mark nodes from which we can reach the target
|
|
* start with children, so the target node and direct children are not
|
|
* flagged. */
|
|
target->custom_flags |= OP_VISITED;
|
|
for (Relation *rel : target->inlinks) {
|
|
deg_graph_tag_paths_recursive(rel->from);
|
|
}
|
|
/* Remove redundant paths to the target. */
|
|
for (Relation *rel : target->inlinks) {
|
|
if (rel->from->type == NodeType::TIMESOURCE) {
|
|
/* HACK: time source nodes don't get "custom_flags" flag
|
|
* set/cleared. */
|
|
/* TODO: there will be other types in future, so iterators above
|
|
* need modifying. */
|
|
continue;
|
|
}
|
|
if (rel->from->custom_flags & OP_REACHABLE) {
|
|
relations_to_remove.append(rel);
|
|
}
|
|
}
|
|
for (Relation *rel : relations_to_remove) {
|
|
rel->unlink();
|
|
delete rel;
|
|
}
|
|
num_removed_relations += relations_to_remove.size();
|
|
relations_to_remove.clear();
|
|
}
|
|
DEG_DEBUG_PRINTF((::Depsgraph *)graph, BUILD, "Removed %d relations\n", num_removed_relations);
|
|
}
|
|
|
|
} // namespace blender::deg
|