| /external/tensorflow/tensorflow/contrib/receptive_field/python/util/ |
| D | parse_layer_parameters_test.py | 59 name_to_node = graph_compute_order.parse_graph_nodes(g.as_graph_def())
60 return name_to_node
67 name_to_node = create_test_network()
72 name_to_node[l1_node_name], name_to_node)
79 name_to_node[l2_pad_name], name_to_node)
86 name_to_node[l2_node_name], name_to_node)
94 name_to_node[l3_node_name], name_to_node)
99 name_to_node[l3_node_name], name_to_node, input_resolution=[4, 4])
104 name_to_node[l3_node_name], name_to_node, input_resolution=[5, 5])
111 name_to_node[l4_node_name], name_to_node)
[all …]
|
| D | graph_compute_order.py | 40 name_to_node = {}
42 name_to_node[node_def.name] = node_def
43 return name_to_node
74 def _get_computed_nodes(name_to_node, argument
103 node_def = name_to_node[current]
126 name_to_node, each, node_info, input_node_name, input_node_size)
142 node_def, name_to_node, input_size, force=True))
187 name_to_node = parse_graph_nodes(graph_def)
190 _get_computed_nodes(name_to_node, each.name, node_info, input_node_name,
192 return node_info, name_to_node
|
| D | parse_layer_parameters.py | 39 def _stride_size(node, name_to_node): argument
57 strides_node = name_to_node[strides_input_name]
70 def _conv_kernel_size(node, name_to_node): argument
90 weights_node = name_to_node[weights_layer_param_name]
162 def _pool_kernel_size(node, name_to_node): argument
180 ksize_node = name_to_node[ksize_input_name]
200 def _padding_size_pad_layer(node, name_to_node): argument
220 paddings_node = name_to_node[paddings_layer_name]
236 def get_layer_params(node, name_to_node, input_resolution=None, force=False): argument
276 stride_x, stride_y = _stride_size(node, name_to_node)
[all …]
|
| D | receptive_field.py | 211 node_info, name_to_node = graph_compute_order.get_compute_order(
274 node, name_to_node, node_info[node.name].input_size)
323 inp_node = name_to_node[inp_name]
|
| /external/tensorflow/tensorflow/core/grappler/utils/ |
| D | scc_test.cc | 86 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 …]
|
| /external/tensorflow/tensorflow/contrib/framework/python/framework/ |
| D | graph_util.py | 65 name_to_input_name, name_to_node, name_to_seq_num = _extract_graph_summary(
67 _assert_nodes_are_present(name_to_node, input_nodes + output_nodes)
109 out.node.extend([copy.deepcopy(name_to_node[node])])
123 assert len(name_to_node[n].input) == 1
124 new_node = copy.deepcopy(name_to_node[n])
131 out.node.extend([copy.deepcopy(name_to_node[n])])
|
| /external/tensorflow/tensorflow/core/grappler/costs/ |
| D | utils_test.cc | 76 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()
|
| D | utils.cc | 81 const std::unordered_map<string, const NodeDef*>& name_to_node, in ExtractExtraProperties() argument
99 auto iter = name_to_node.find(input_node_name); in ExtractExtraProperties()
100 if (iter == name_to_node.end()) continue; in ExtractExtraProperties()
165 const std::unordered_map<string, const NodeDef*>& name_to_node) { in FindInputFeatures() argument
264 const std::unordered_map<string, const NodeDef*>& name_to_node, in BuildOpInfoWithoutDevice() argument
272 ExtractExtraProperties(node, name_to_node, &op_info); in BuildOpInfoWithoutDevice()
291 std::unordered_map<string, const NodeDef*> name_to_node; in CostGraphToOpPerformanceData() local
296 name_to_node[node.name()] = &node; in CostGraphToOpPerformanceData()
315 FindInputFeatures(node, name_to_cost, name_to_node); in CostGraphToOpPerformanceData()
316 *perf->mutable_op() = BuildOpInfoWithoutDevice(node, name_to_node, inputs); in CostGraphToOpPerformanceData()
|
| D | utils.h | 44 const std::unordered_map<string, const NodeDef*>& name_to_node);
68 const std::unordered_map<string, const NodeDef*>& name_to_node,
|
| D | virtual_scheduler.cc | 331 std::unordered_map<string, const NodeDef*> name_to_node; in Init() local
333 name_to_node[node->name()] = node; in Init()
379 const NodeDef* input_node = name_to_node[NodeName(input_node_name)]; in Init()
|
| D | graph_properties.cc | 2283 std::unordered_map<string, const NodeDef*> name_to_node; // Empty in InferFromCostGraph() local
2307 FindInputFeatures(node, name_to_cost, name_to_node); in InferFromCostGraph()
|
| /external/tensorflow/tensorflow/python/framework/ |
| D | graph_util_impl.py | 119 name_to_node = {} # Keyed by node name.
127 name_to_node[n] = node
131 return name_to_input_name, name_to_node, name_to_seq_num
134 def _assert_nodes_are_present(name_to_node, nodes): argument
137 assert d in name_to_node, "%s is not in graph" % d
180 name_to_input_name, name_to_node, name_to_seq_num = _extract_graph_summary(
182 _assert_nodes_are_present(name_to_node, dest_nodes)
191 out.node.extend([copy.deepcopy(name_to_node[n])])
|
| /external/tensorflow/tensorflow/core/grappler/ |
| D | grappler_item.cc | 203 std::unordered_map<string, const NodeDef*> name_to_node; in ComputeTransitiveFanin() local
206 name_to_node[node.name()] = &node; in ComputeTransitiveFanin()
215 const NodeDef* node = name_to_node[NodeName(root)]; in ComputeTransitiveFanin()
236 const NodeDef* in = name_to_node[NodeName(input)]; in ComputeTransitiveFanin()
|
| /external/tensorflow/tensorflow/lite/python/ |
| D | op_hint.py | 946 name_to_input_name, name_to_node, name_to_seq_num = _extract_graph_summary(
979 out.node.extend([_copy.deepcopy(name_to_node[node])])
1023 out.node.extend([_copy.deepcopy(name_to_node[n])])
1042 name_to_input_name, name_to_node, name_to_seq_num = _extract_graph_summary(
1070 node = name_to_node[current_node_name]
1106 end_input = name_to_node[end].input[0]
|
| D | convert_test.py | 212 name_to_input_name, name_to_node, _ = (
216 return set([name_to_node[node_name].op for node_name in used_node_names])
|
| /external/tensorflow/tensorflow/core/common_runtime/ |
| D | step_stats_collector.cc | 320 std::unordered_map<StringPiece, Node*, StringPieceHasher> name_to_node; in BuildCostModel() local
322 name_to_node.emplace(n->name(), n); in BuildCostModel()
352 const Node* node = name_to_node[stats.node_name()]; in BuildCostModel()
|
| D | direct_session.cc | 1129 const NameNodeMap* name_to_node = &executors_and_keys->name_to_node; in CheckFetch() local
1139 auto it = name_to_node->find(id.first); in CheckFetch()
1140 if (it == name_to_node->end()) { in CheckFetch()
1155 auto it = name_to_node->find(id.first); in CheckFetch()
1156 if (it == name_to_node->end()) { in CheckFetch()
1225 ek->name_to_node.insert({n->name(), n}); in CreateExecutors()
|
| D | direct_session.h | 145 NameNodeMap name_to_node; member
|
| /external/tensorflow/tensorflow/compiler/tf2xla/ |
| D | tf2xla_util.cc | 355 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()
|