/* Copyright 2016 The TensorFlow Authors All Rights Reserved. Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agreed to in writing, software distributed under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the License for the specific language governing permissions and limitations under the License. ==============================================================================*/ #include "tensorflow/core/profiler/internal/tfprof_scope.h" #include #include #include "tensorflow/c/c_api.h" #include "tensorflow/core/framework/tensor.h" #include "tensorflow/core/lib/strings/stringprintf.h" #include "tensorflow/core/platform/regexp.h" #include "tensorflow/core/profiler/internal/tfprof_constants.h" #include "tensorflow/core/profiler/internal/tfprof_tensor.h" namespace tensorflow { namespace tfprof { ScopeNode* TFScope::CreateParentNode(const string& name) { if (nodes_map_.find(name) != nodes_map_.end()) { return nodes_map_[name].get(); } node_defs_.push_back(std::unique_ptr(new NodeDef())); node_defs_.back()->set_name(name); node_defs_.back()->set_op(kTFScopeParent); parent_nodes_[name] = std::unique_ptr( new TFGraphNode(node_defs_.back().get(), -1, nullptr)); nodes_map_[name] = std::unique_ptr(new ScopeNode(parent_nodes_[name].get())); return nodes_map_[name].get(); } void TFScope::AddNode(TFGraphNode* node) { string name = node->name(); if (nodes_map_.find(node->name()) == nodes_map_.end()) { nodes_map_[name] = std::unique_ptr(new ScopeNode(node)); } auto last_slash = name.find_last_of("/"); while (last_slash != name.npos) { name = name.substr(0, last_slash); if (nodes_map_.find(name) == nodes_map_.end()) { CHECK(CreateParentNode(name)); } last_slash = name.find_last_of("/"); } } void TFScope::Build() { if (root_) return; std::vector roots; // Found roots, which are nodes without "/". for (auto it = nodes_map_.begin(); it != nodes_map_.end(); it++) { ScopeNode* node = it->second.get(); auto last_slash = node->name().find_last_of("/"); if (last_slash == string::npos) { roots.push_back(node); } else { const string prefix = node->name().substr(0, last_slash); nodes_map_[prefix]->children.push_back(node); } } root_ = CreateParentNode(kTFProfRoot); root_->children.assign(roots.begin(), roots.end()); } const ShowNode* TFScope::ShowInternal(const Options& opts, Timeline* timeline) { root_->ResetTotalStats(); if (opts.output_type == kOutput[3]) { fprintf(stderr, "Only 'code' view supports pprof output now.\n"); return root_; } std::vector roots = Account(root_->children, opts); root_->show_children.clear(); for (ScopeNode* n : roots) { root_->AggregateTotalStats(n); } if (opts.start_name_regexes.size() != 1 || opts.start_name_regexes[0] != ".*") { roots = SearchRoot(roots, opts.start_name_regexes); } root_->show_children.assign(roots.begin(), roots.end()); ScopeNode* root = PrintScope({root_}, opts, 1, 0)[0]; root->formatted_str = FormatLegend(opts) + root->formatted_str; Format(root->show_children, &root->formatted_str, root->mutable_proto()); if (timeline) { timeline->GenerateScopeTimeline(root); } return root; } void TFScope::Format(const std::vector roots, string* display_str, GraphNodeProto* proto) { for (ScopeNode* node : roots) { display_str->append(node->formatted_str); GraphNodeProto* child = proto->add_children(); child->MergeFrom(node->proto()); Format(node->show_children, display_str, child); } } std::vector TFScope::SearchRoot( std::vector roots, const std::vector& regexes) { std::vector res; if (roots.empty()) { return res; } for (ScopeNode* root : roots) { bool match_start_node = false; for (const string& regex : regexes) { if (RE2::FullMatch(root->name(), regex)) { res.push_back(root); match_start_node = true; break; } } if (match_start_node) { // Found a start node at this branch, no need to continue. continue; } std::vector nroots = SearchRoot(root->show_children, regexes); res.insert(res.end(), nroots.begin(), nroots.end()); } return res; } std::vector TFScope::PrintScope(const std::vector roots, const Options& opts, int depth, int last_ident) { std::vector show_nodes; for (ScopeNode* node : roots) { int ident = last_ident; bool show = ShouldShow(node, opts, depth); if (show) ident += 2; std::vector show_cnodes; if (!ShouldTrim(node, opts.trim_name_regexes) && depth <= opts.max_depth) { show_cnodes = PrintScope(node->show_children, opts, depth + 1, ident); } if (show) { node->show_children.clear(); if (opts.account_displayed_op_only) { node->ResetTotalStats(); node->AddSelfToTotalStats(); } show_cnodes = SortNodes(show_cnodes, opts); for (ScopeNode* sc : show_cnodes) { node->show_children.push_back(sc); if (opts.account_displayed_op_only) { node->AggregateTotalStats(sc); } } node->formatted_str = strings::Printf("%s%s\n", string(last_ident, ' ').c_str(), FormatNode(node, opts).c_str()); if (opts.select.find(kShown[4]) != opts.select.end()) { std::unique_ptr tfprof_tensor; if (LookUpCheckPoint(node->name(), &tfprof_tensor)) { string value_str; tfprof_tensor->Display(&value_str, node->mutable_proto()->mutable_tensor_value()); node->formatted_str += value_str; } } show_nodes.push_back(node); } else { show_nodes.insert(show_nodes.end(), show_cnodes.begin(), show_cnodes.end()); } } return show_nodes; } std::vector TFScope::Account(const std::vector& roots, const Options& opts) { std::vector act_nodes; for (ScopeNode* node : roots) { node->ResetTotalStats(); std::vector act_cnodes = Account(node->children, opts); node->account = ReAccount(node, opts); if (node->account || !act_cnodes.empty()) { node->show_children.clear(); node->ResetTotalStats(); node->AddSelfToTotalStats(); for (ScopeNode* c : act_cnodes) { node->AggregateTotalStats(c); node->show_children.push_back(c); } act_nodes.push_back(node); } } return act_nodes; } } // namespace tfprof } // namespace tensorflow