Home
last modified time | relevance | path

Searched refs:GraphNode (Results 1 – 7 of 7) sorted by relevance

/external/tensorflow/tensorflow/core/profiler/internal/
Dtfprof_graph.cc29 GraphNode* TFGraph::CreateParentNode(const string& name) { in CreateParentNode()
36 std::unique_ptr<GraphNode>(new GraphNode(parent_nodes_[name].get())); in CreateParentNode()
42 nodes_map_[name] = std::unique_ptr<GraphNode>(new GraphNode(node)); in AddNode()
51 GraphNode* node = it->second.get(); in Build()
62 std::vector<GraphNode*> roots; in Build()
90 std::vector<GraphNode*> roots = Account(root_->children, opts, &visits); in ShowInternal()
91 for (GraphNode* n : roots) { in ShowInternal()
106 GraphNode* root = PrintGraph({root_}, opts, 1, 0, &visits)[0]; in ShowInternal()
118 std::vector<GraphNode*> TFGraph::SearchRoot( in SearchRoot()
119 const std::vector<GraphNode*>& roots, const std::vector<string>& regexes, in SearchRoot()
[all …]
Dtfprof_graph.h60 GraphNode* CreateParentNode(const string& name);
62 std::vector<GraphNode*> SearchRoot(const std::vector<GraphNode*>& roots,
66 std::vector<GraphNode*> PrintGraph(const std::vector<GraphNode*> roots,
70 std::vector<GraphNode*> Account(const std::vector<GraphNode*>& roots,
74 void Format(const std::vector<GraphNode*> roots, string* display_str,
78 GraphNode* root_;
81 std::map<string, std::unique_ptr<GraphNode>> nodes_map_;
Dtfprof_timeline.h76 TimeNode(Process* process, GraphNode* node, int64_t start_micros, in TimeNode()
88 GraphNode* node;
112 void TrackNode(int64_t step, const GraphNode* node);
129 void GenerateGraphTimeline(const std::vector<GraphNode*>& gnodes);
136 void TrackNode(const GraphNode* node) { mem_tracker_.TrackNode(step_, node); } in TrackNode()
170 void AllocateTimeNodes(GraphNode* gnode);
Dtfprof_node_show.h66 class GraphNode : public ShowNode {
68 explicit GraphNode(TFGraphNode* node) : ShowNode(node) {} in GraphNode() function
72 std::vector<GraphNode*> children;
73 std::vector<GraphNode*> show_children;
Dtfprof_timeline.cc149 void MemoryTracker::TrackNode(int64_t step, const GraphNode* node) { in TrackNode()
177 void Timeline::AllocateTimeNodes(GraphNode* gnode) { in AllocateTimeNodes()
203 for (GraphNode* n : gnode->show_children) { in AllocateTimeNodes()
208 void Timeline::GenerateGraphTimeline(const std::vector<GraphNode*>& gnodes) { in GenerateGraphTimeline()
209 for (GraphNode* gnode : gnodes) { in GenerateGraphTimeline()
217 for (GraphNode* inp : tnode->node->children) { in GenerateGraphTimeline()
/external/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/Utils/
DImportedFunctionsInliningStatistics.cpp175 void ImportedFunctionsInliningStatistics::dfs(InlineGraphNode &GraphNode) { in dfs() argument
176 assert(!GraphNode.Visited); in dfs()
177 GraphNode.Visited = true; in dfs()
178 for (auto *const InlinedFunctionNode : GraphNode.InlinedCallees) { in dfs()
/external/swiftshader/third_party/llvm-10.0/llvm/include/llvm/Transforms/Utils/
DImportedFunctionsInliningStatistics.h81 void dfs(InlineGraphNode &GraphNode);