Blender Git Loki

Git Commits -> Revision 065def5

Revision 065def5 by Lukas Toenne (depsgraph_refactor)
May 20, 2014, 22:11 (GMT)
First steps toward scheduling: calculate priorities for all nodes
based on their dependants.

This heuristic can be improved later for more optimized scheduling.
The basic idea is to push all nodes which are evaluatable (all
dependencies satisfied) onto the queue, then pop the highest
priority node for evaluation.

Commit Details:

Full Hash: 065def57acae2019c1072c8df76f325b81fe89b1
Parent Commit: 308b0aa
Lines Changed: +71, -8

6 Modified Paths:

/source/blender/depsgraph/DEG_depsgraph_debug.h (+1, -1) (Diff)
/source/blender/depsgraph/intern/depsgraph_debug.cpp (+11, -3) (Diff)
/source/blender/depsgraph/intern/depsgraph_eval.cpp (+44, -1) (Diff)
/source/blender/depsgraph/intern/depsnode_operation.cpp (+2, -1) (Diff)
/source/blender/depsgraph/intern/depsnode_operation.h (+1, -0) (Diff)
/source/blender/makesrna/intern/rna_depsgraph.c (+12, -2) (Diff)
Tehnyt: Miika HämäläinenViimeksi päivitetty: 07.11.2014 14:18MiikaH:n Sivut a.k.a. MiikaHweb | 2003-2021