Searched refs:graph_nodes (Results 1 – 11 of 11) sorted by relevance
36 std::vector<string> graph_nodes; in TEST_F() local38 graph_nodes.push_back(node.name()); in TEST_F()44 std::sort(graph_nodes.begin(), graph_nodes.end()); in TEST_F()46 EXPECT_EQ(main_ops, graph_nodes); in TEST_F()
118 return n1->node->graph_nodes().size() > in SortNodes()119 n2->node->graph_nodes().size(); in SortNodes()
60 if (opts.min_occurrence > node->node->graph_nodes().size()) { in ShouldShowIfExtra()
145 for (auto it : node->graph_nodes()) { in ReInit()
169 const GraphNodeProto& gnode = proto.graph_nodes(i); in FormatInputShapes()
308 for (const auto& gnode : node->proto().graph_nodes()) { in FormatNode()
192 for (auto gn_it : cn->node->graph_nodes()) { in Add()
833 const std::map<string, const TFGraphNode*>& graph_nodes() const { in graph_nodes() function
120 name: "graph_nodes"
298 self.assertEqual(0, len(leaf.graph_nodes))300 self.assertEqual(1, len(leaf.graph_nodes))374 for gnode in tfprof_node.graph_nodes:385 self.assertLessEqual(len(tfprof_node.graph_nodes), last_occurrence)386 last_occurrence = len(tfprof_node.graph_nodes)
122 repeated GraphNodeProto graph_nodes = 10; field