diff options
author | David Robillard <d@drobilla.net> | 2006-07-04 00:08:00 +0000 |
---|---|---|
committer | David Robillard <d@drobilla.net> | 2006-07-04 00:08:00 +0000 |
commit | 2d518cb42f7707503efc289badb4cac9a3396a17 (patch) | |
tree | 9d22839d5f64ec26405ca0cfd2bec1166ddad437 /src/libs/engine/Patch.cpp | |
parent | 62d76290ae0eb783db0e24338c17adb08d845a73 (diff) | |
download | ingen-2d518cb42f7707503efc289badb4cac9a3396a17.tar.gz ingen-2d518cb42f7707503efc289badb4cac9a3396a17.tar.bz2 ingen-2d518cb42f7707503efc289badb4cac9a3396a17.zip |
Process order traversal / connection fixes (nasty edge cases where patches are involved)
git-svn-id: http://svn.drobilla.net/lad/ingen@82 a436a847-0d15-0410-975c-d299462d15a1
Diffstat (limited to 'src/libs/engine/Patch.cpp')
-rw-r--r-- | src/libs/engine/Patch.cpp | 19 |
1 files changed, 10 insertions, 9 deletions
diff --git a/src/libs/engine/Patch.cpp b/src/libs/engine/Patch.cpp index d96e63b5..ba299b74 100644 --- a/src/libs/engine/Patch.cpp +++ b/src/libs/engine/Patch.cpp @@ -350,7 +350,7 @@ Patch::build_process_order() const { cerr << "*********** BUILDING PROCESS ORDER FOR " << path() << endl; - Array<Node*>* const process_order = new Array<Node*>(_nodes.size()); + Array<Node*>* const process_order = new Array<Node*>(_nodes.size(), NULL); // FIXME: tweak algorithm so it just ends up like this and save the cost of iteration? for (List<Node*>::const_iterator i = _nodes.begin(); i != _nodes.end(); ++i) @@ -370,23 +370,24 @@ Patch::build_process_order() const }*/ //} + for (List<Node*>::const_iterator i = _nodes.begin(); i != _nodes.end(); ++i) { + Node* const node = (*i); + // Either a sink or connected to our output ports: + if ( ( ! node->traversed()) && node->dependants()->size() == 0) + build_process_order_recursive(node, process_order); + } // Add any (disjoint) nodes that weren't hit by the traversal + // FIXME: this shouldn't be necessary /*for (List<Node*>::const_iterator i = _nodes.begin(); i != _nodes.end(); ++i) { - node = (*i); + Node* const node = (*i); if ( ! node->traversed()) { process_order->push_back(*i); node->traversed(true); + cerr << "********** APPENDED DISJOINT NODE " << node->path() << endl; } }*/ - for (List<Node*>::const_iterator i = _nodes.begin(); i != _nodes.end(); ++i) { - Node* const node = (*i); - // Either a sink or connected to our output ports: - if ( (!node->traversed()) && node->dependants()->size() == 0) - build_process_order_recursive(node, process_order); - } - cerr << "----------------------------------------\n"; for (size_t i=0; i < process_order->size(); ++i) { assert(process_order->at(i)); |