diff options
| author | Derek Kozel <derek.kozel@ettus.com> | 2016-10-25 17:24:57 -0700 |
|---|---|---|
| committer | Martin Braun <martin.braun@ettus.com> | 2016-10-26 17:20:00 -0700 |
| commit | b4d92a97b014b1de26ff658ddeb3f636d8e1ca81 (patch) | |
| tree | 9ac1deac1f79fe305d3bccb2df683a8c03a5874e /host | |
| parent | 9517de45709adaea8b574011573a565007149d5d (diff) | |
| download | uhd-b4d92a97b014b1de26ff658ddeb3f636d8e1ca81.tar.gz uhd-b4d92a97b014b1de26ff658ddeb3f636d8e1ca81.tar.bz2 uhd-b4d92a97b014b1de26ff658ddeb3f636d8e1ca81.zip | |
Experts: Always resolve all nodes in the graph
Diffstat (limited to 'host')
| -rw-r--r-- | host/lib/experts/expert_container.cpp | 13 |
1 files changed, 9 insertions, 4 deletions
diff --git a/host/lib/experts/expert_container.cpp b/host/lib/experts/expert_container.cpp index edfc2ebe3..78c783790 100644 --- a/host/lib/experts/expert_container.cpp +++ b/host/lib/experts/expert_container.cpp @@ -92,23 +92,28 @@ public: boost::lock_guard<boost::recursive_mutex> resolve_lock(_resolve_mutex); boost::lock_guard<boost::mutex> lock(_mutex); EX_LOG(0, str(boost::format("resolve_all(%s)") % (force?"force":""))); + // Do a full resolve of the graph _resolve_helper("", "", force); } - void resolve_from(const std::string& node_name) + void resolve_from(const std::string&) { boost::lock_guard<boost::recursive_mutex> resolve_lock(_resolve_mutex); boost::lock_guard<boost::mutex> lock(_mutex); EX_LOG(0, str(boost::format("resolve_from(%s)") % node_name)); - _resolve_helper(node_name, "", false); + // Do a full resolve of the graph + // Not optimizing the traversal using node_name to reduce experts complexity + _resolve_helper("", "", false); } - void resolve_to(const std::string& node_name) + void resolve_to(const std::string&) { boost::lock_guard<boost::recursive_mutex> resolve_lock(_resolve_mutex); boost::lock_guard<boost::mutex> lock(_mutex); EX_LOG(0, str(boost::format("resolve_to(%s)") % node_name)); - _resolve_helper("", node_name, false); + // Do a full resolve of the graph + // Not optimizing the traversal using node_name to reduce experts complexity + _resolve_helper("", "", false); } dag_vertex_t& retrieve(const std::string& name) const |