forked from bartvdbraak/blender
8294452b14
The issue was caused by not really optimal graph traversal for gathering nodes dependencies which could have exponential complexity with a long tree branches connected with multiple connections between them. Now we optimize the depth traversal and perform early output if the node was already traversed. Please note that this adds some limitations to the use of SVM compiler's find_dependencies() in the cases when skip_node is not NULL and one wants to perform dependencies find sequentially with the same set. This doesn't happen in the code, but one should be aware of this. |
||
|---|---|---|
| .. | ||
| atomic | ||
| audaspace | ||
| container | ||
| cycles | ||
| dualcon | ||
| elbeem | ||
| ffmpeg | ||
| ghost | ||
| glew-mx | ||
| guardedalloc | ||
| iksolver | ||
| itasc | ||
| locale | ||
| memutil | ||
| mikktspace | ||
| moto | ||
| opencolorio | ||
| opennl | ||
| opensubdiv | ||
| raskter | ||
| rigidbody | ||
| smoke | ||
| string | ||
| utfconv | ||
| CMakeLists.txt | ||
| SConscript | ||