Home
last modified time | relevance | path

Searched refs:name_to_node (Results 1 – 15 of 15) sorted by relevance

/external/tensorflow/tensorflow/core/grappler/utils/
Dscc_test.cc86 std::unordered_map<string, const NodeDef*> name_to_node; in TEST_F() local
89 name_to_node[n.name()] = &n; in TEST_F()
100 EXPECT_EQ(components[name_to_node[pair.first]], in TEST_F()
101 components[name_to_node[pair.second]]); in TEST_F()
105 EXPECT_EQ(-1, components[name_to_node[node]]); in TEST_F()
149 std::unordered_map<string, const NodeDef*> name_to_node; in TEST_F() local
152 name_to_node[n.name()] = &n; in TEST_F()
163 EXPECT_EQ(components[name_to_node[pair.first]], in TEST_F()
164 components[name_to_node[pair.second]]); in TEST_F()
171 EXPECT_NE(components[name_to_node[pair.first]], in TEST_F()
[all …]
Dtransitive_fanin.cc32 std::unordered_map<string, const NodeDef*> name_to_node; in ComputeTransitiveFanin() local
35 name_to_node[node.name()] = &node; in ComputeTransitiveFanin()
44 const NodeDef* node = name_to_node[NodeName(root)]; in ComputeTransitiveFanin()
67 const NodeDef* in = name_to_node[NodeName(input)]; in ComputeTransitiveFanin()
/external/tensorflow/tensorflow/core/grappler/costs/
Dutils_test.cc76 std::unordered_map<string, const NodeDef*> name_to_node; in TEST() local
79 name_to_node["input"] = input; in TEST()
82 name_to_node["filter"] = filter; in TEST()
86 name_to_node["output_backprop"] = output_backprop; in TEST()
90 name_to_node["input_sizes"] = input; in TEST()
95 name_to_node["filter_sizes"] = filter_sizes; in TEST()
144 OpInfo info = BuildOpInfoWithoutDevice(node, name_to_node, inputs); in TEST()
164 std::unordered_map<string, const NodeDef*> name_to_node; in TEST() local
166 name_to_node[node.name()] = &node; in TEST()
173 OpInfo info = BuildOpInfoWithoutDevice(node, name_to_node, inputs); in TEST()
Dutils.cc82 const std::unordered_map<string, const NodeDef*>& name_to_node, in ExtractExtraProperties() argument
100 auto iter = name_to_node.find(input_node_name); in ExtractExtraProperties()
101 if (iter == name_to_node.end()) continue; in ExtractExtraProperties()
166 const std::unordered_map<string, const NodeDef*>& name_to_node) { in FindInputFeatures() argument
265 const std::unordered_map<string, const NodeDef*>& name_to_node, in BuildOpInfoWithoutDevice() argument
273 ExtractExtraProperties(node, name_to_node, &op_info); in BuildOpInfoWithoutDevice()
292 std::unordered_map<string, const NodeDef*> name_to_node; in CostGraphToOpPerformanceData() local
297 name_to_node[node.name()] = &node; in CostGraphToOpPerformanceData()
316 FindInputFeatures(node, name_to_cost, name_to_node); in CostGraphToOpPerformanceData()
317 *perf->mutable_op() = BuildOpInfoWithoutDevice(node, name_to_node, inputs); in CostGraphToOpPerformanceData()
Dutils.h45 const std::unordered_map<string, const NodeDef*>& name_to_node);
69 const std::unordered_map<string, const NodeDef*>& name_to_node,
Dvirtual_scheduler.cc442 std::unordered_map<string, const NodeDef*> name_to_node; in Init() local
444 TF_RETURN_IF_ERROR(ComputeTransitiveFanin(graph, fetch_nodes, &name_to_node, in Init()
495 const NodeDef* input_node = name_to_node[NodeName(input_node_name)]; in Init()
Dgraph_properties.cc2751 std::unordered_map<string, const NodeDef*> name_to_node; // Empty in InferFromCostGraph() local
2775 FindInputFeatures(node, name_to_cost, name_to_node); in InferFromCostGraph()
/external/tensorflow/tensorflow/python/framework/
Dgraph_util_impl.py141 name_to_node = {} # Keyed by node name.
149 name_to_node[n] = node
158 return name_to_input_name, name_to_node, name_to_seq_num
161 def _assert_nodes_are_present(name_to_node, nodes): argument
164 assert d in name_to_node, "%s is not in graph" % d
207 name_to_input_name, name_to_node, name_to_seq_num = _extract_graph_summary(
209 _assert_nodes_are_present(name_to_node, dest_nodes)
218 out.node.extend([copy.deepcopy(name_to_node[n])])
/external/tensorflow/tensorflow/compiler/jit/
Dintroduce_floating_point_jitter_pass.cc29 absl::flat_hash_map<string, Node*> name_to_node; in GetNodesToModify() local
31 name_to_node[n->name()] = n; in GetNodesToModify()
38 auto it = name_to_node.find(tensor_id.node()); in GetNodesToModify()
39 DCHECK(it != name_to_node.end()); in GetNodesToModify()
/external/tensorflow/tensorflow/lite/python/
Dop_hint.py970 name_to_input_name, name_to_node, name_to_seq_num = _extract_graph_summary(
1003 out.node.extend([_copy.deepcopy(name_to_node[node])])
1067 out.node.extend([_copy.deepcopy(name_to_node[n])])
1087 name_to_input_name, name_to_node, name_to_seq_num = _extract_graph_summary(
1115 node = name_to_node[current_node_name]
1152 end_input = name_to_node[end].input[0]
Dconvert_test.py186 name_to_input_name, name_to_node, _ = (
190 return set([name_to_node[node_name].op for node_name in used_node_names])
/external/tensorflow/tensorflow/core/common_runtime/
Dstep_stats_collector.cc318 std::unordered_map<StringPiece, Node*, StringPieceHasher> name_to_node; in BuildCostModel() local
320 name_to_node.emplace(n->name(), n); in BuildCostModel()
350 const Node* node = name_to_node[stats.node_name()]; in BuildCostModel()
Ddirect_session.cc1235 const NameNodeMap* name_to_node = &executors_and_keys->name_to_node; in CheckFetch() local
1245 auto it = name_to_node->find(id.first); in CheckFetch()
1246 if (it == name_to_node->end()) { in CheckFetch()
1261 auto it = name_to_node->find(id.first); in CheckFetch()
1262 if (it == name_to_node->end()) { in CheckFetch()
1331 ek->name_to_node.insert({n->name(), n}); in CreateExecutors()
Ddirect_session.h166 NameNodeMap name_to_node; member
/external/tensorflow/tensorflow/compiler/tf2xla/
Dtf2xla_util.cc355 std::unordered_map<string, const NodeDef*> name_to_node; in AddPlaceholdersForFeeds() local
357 name_to_node[graph_def->node(i).name()] = &graph_def->node(i); in AddPlaceholdersForFeeds()
364 auto node_it = name_to_node.find(feed_id.node_name()); in AddPlaceholdersForFeeds()
365 if (node_it == name_to_node.end()) { in AddPlaceholdersForFeeds()