diff options
| author | Sergey Sharybin <sergey.vfx@gmail.com> | 2016-11-04 19:45:14 +0300 |
|---|---|---|
| committer | Sergey Sharybin <sergey.vfx@gmail.com> | 2016-11-07 13:04:49 +0300 |
| commit | 21350b73df0ebd78accf3567269e77d6dc774557 (patch) | |
| tree | 201d46201a345b3d086146a209ca50b5b0f4c3ff /source/blender/depsgraph/intern/nodes | |
| parent | 4c30a9ee42c386a0938df9f6fa4956116ffbec46 (diff) | |
Despgraph: Optimize cycles detection algorithm
The idea is simple: when falling back to one of the nodes which was partially
handled we "resume" checking outgoing relations from the index which we stopped.
This gives about 15-20% depsgraph construction time save.
Diffstat (limited to 'source/blender/depsgraph/intern/nodes')
| -rw-r--r-- | source/blender/depsgraph/intern/nodes/deg_node.h | 3 |
1 files changed, 2 insertions, 1 deletions
diff --git a/source/blender/depsgraph/intern/nodes/deg_node.h b/source/blender/depsgraph/intern/nodes/deg_node.h index 810c6eeb420..7c2f53840b6 100644 --- a/source/blender/depsgraph/intern/nodes/deg_node.h +++ b/source/blender/depsgraph/intern/nodes/deg_node.h @@ -80,8 +80,9 @@ struct DepsNode { /* Nodes which depend on this one. */ Relations outlinks; - /* Generic tag for traversal algorithms */ + /* Generic tags for traversal algorithms. */ int done; + int tag; /* Methods. */ |