| /external/tensorflow/tensorflow/core/grappler/optimizers/data/ |
| D | auto_shard.cc | 307 absl::flat_hash_set<string>* nodes_to_delete, in RemoveShuffleDataset() argument
318 nodes_to_delete->insert(node.name()); in RemoveShuffleDataset()
323 graph, *fanin.node, nodes_to_delete, op_name, buffer_size_node, in RemoveShuffleDataset()
332 absl::flat_hash_set<string>* nodes_to_delete, in RemoveShuffleDatasetV2() argument
340 nodes_to_delete->insert(node.name()); in RemoveShuffleDatasetV2()
345 RemoveShuffleDatasetV2(graph, *fanin.node, nodes_to_delete, op_name, in RemoveShuffleDatasetV2()
354 absl::flat_hash_set<string>* nodes_to_delete, in RemoveShuffleDatasetV3() argument
367 nodes_to_delete->insert(node.name()); in RemoveShuffleDatasetV3()
372 graph, *fanin.node, nodes_to_delete, op_name, buffer_size_node, in RemoveShuffleDatasetV3()
381 absl::flat_hash_set<string>* nodes_to_delete, in ProcessDatasetSourceNode() argument
[all …]
|
| D | filter_fusion.cc | 70 absl::flat_hash_set<string> nodes_to_delete; in OptimizeAndCollectStats() local
120 nodes_to_delete.insert(first_filter_node->name()); in OptimizeAndCollectStats()
121 nodes_to_delete.insert(second_filter_node->name()); in OptimizeAndCollectStats()
125 TF_RETURN_IF_ERROR(graph.DeleteNodes(nodes_to_delete)); in OptimizeAndCollectStats()
|
| D | map_and_batch_fusion.cc | 116 absl::flat_hash_set<string> nodes_to_delete; in OptimizeAndCollectStats() local
138 nodes_to_delete.insert(map_node->name()); in OptimizeAndCollectStats()
139 nodes_to_delete.insert(batch_node.name()); in OptimizeAndCollectStats()
143 TF_RETURN_IF_ERROR(graph.DeleteNodes(nodes_to_delete)); in OptimizeAndCollectStats()
|
| D | map_fusion.cc | 90 absl::flat_hash_set<string> nodes_to_delete; in OptimizeAndCollectStats() local
142 nodes_to_delete.insert(parent_map_node->name()); in OptimizeAndCollectStats()
143 nodes_to_delete.insert(map_node->name()); in OptimizeAndCollectStats()
147 TF_RETURN_IF_ERROR(graph.DeleteNodes(nodes_to_delete)); in OptimizeAndCollectStats()
|
| D | batch_parallelization.cc | 78 absl::flat_hash_set<string> nodes_to_delete; in OptimizeAndCollectStats() local
94 nodes_to_delete.insert(batch_node->name()); in OptimizeAndCollectStats()
98 TF_RETURN_IF_ERROR(graph.DeleteNodes(nodes_to_delete)); in OptimizeAndCollectStats()
|
| D | map_parallelization.cc | 75 absl::flat_hash_set<string> nodes_to_delete; in OptimizeAndCollectStats() local
96 nodes_to_delete.insert(map_node->name()); in OptimizeAndCollectStats()
100 TF_RETURN_IF_ERROR(graph.DeleteNodes(nodes_to_delete)); in OptimizeAndCollectStats()
|
| D | shuffle_and_repeat_fusion.cc | 159 absl::flat_hash_set<string> nodes_to_delete; in OptimizeAndCollectStats() local
198 nodes_to_delete.insert(shuffle_node.name()); in OptimizeAndCollectStats()
199 nodes_to_delete.insert(repeat_node.name()); in OptimizeAndCollectStats()
204 TF_RETURN_IF_ERROR(graph.DeleteNodes(nodes_to_delete)); in OptimizeAndCollectStats()
|
| D | noop_elimination.cc | 145 absl::flat_hash_set<string> nodes_to_delete; in OptimizeAndCollectStats() local
152 nodes_to_delete.insert(node.name()); in OptimizeAndCollectStats()
156 TF_RETURN_IF_ERROR(graph.DeleteNodes(nodes_to_delete)); in OptimizeAndCollectStats()
|
| D | map_and_filter_fusion.cc | 176 absl::flat_hash_set<string> nodes_to_delete; in OptimizeAndCollectStats() local
241 nodes_to_delete.insert(map_node->name()); in OptimizeAndCollectStats()
242 nodes_to_delete.insert(filter_node->name()); in OptimizeAndCollectStats()
246 TF_RETURN_IF_ERROR(graph.DeleteNodes(nodes_to_delete)); in OptimizeAndCollectStats()
|
| D | filter_with_random_uniform_fusion.cc | 134 absl::flat_hash_set<string> nodes_to_delete; in OptimizeAndCollectStats() local
257 nodes_to_delete.insert(filter_node.name()); in OptimizeAndCollectStats()
261 TF_RETURN_IF_ERROR(graph.DeleteNodes(nodes_to_delete)); in OptimizeAndCollectStats()
|
| D | hoist_random_uniform.cc | 241 absl::flat_hash_set<string> nodes_to_delete; in OptimizeAndCollectStats() local
287 nodes_to_delete.insert(map_node->name()); in OptimizeAndCollectStats()
291 TF_RETURN_IF_ERROR(graph.DeleteNodes(nodes_to_delete)); in OptimizeAndCollectStats()
|
| D | map_vectorization.cc | 538 absl::flat_hash_set<string> nodes_to_delete; in OptimizeAndCollectStats() local
591 nodes_to_delete.insert(n->name()); in OptimizeAndCollectStats()
600 nodes_to_delete.insert(n->name()); in OptimizeAndCollectStats()
619 TF_RETURN_IF_ERROR(graph.DeleteNodes(nodes_to_delete)); in OptimizeAndCollectStats()
|
| /external/tensorflow/tensorflow/core/grappler/optimizers/ |
| D | model_pruner.cc | 146 const absl::flat_hash_set<const NodeDef*>& nodes_to_delete, in ForwardInputsInternal() argument
168 if (nodes_to_delete.find(input_node) != nodes_to_delete.end()) { in ForwardInputsInternal()
169 ForwardInputsInternal(*input_node, nodes_to_delete, in ForwardInputsInternal()
180 const absl::flat_hash_set<const NodeDef*>& nodes_to_delete, in ForwardInputs() argument
185 ForwardInputsInternal(original_node, nodes_to_delete, in ForwardInputs()
461 absl::flat_hash_set<const NodeDef*> nodes_to_delete; in Optimize() local
492 nodes_to_delete.insert(node); in Optimize()
498 if (nodes_to_delete.empty() && nodes_to_preserve.empty()) { in Optimize()
505 if (nodes_to_delete.empty()) { in Optimize()
515 nodes_to_delete.find(&node) == nodes_to_delete.end()) { in Optimize()
[all …]
|
| D | remapper.cc | 1062 std::vector<bool>* nodes_to_delete) { in IsCpuCompatibleDataType() argument
1099 (*nodes_to_delete)[matched.contraction] = true; in IsCpuCompatibleDataType()
1106 std::vector<bool>* invalidated_nodes, std::vector<bool>* nodes_to_delete) { in IsCpuCompatibleDataType() argument
1147 (*nodes_to_delete)[matched.contraction] = true; in IsCpuCompatibleDataType()
1148 (*nodes_to_delete)[matched.bias_add] = true; in IsCpuCompatibleDataType()
1157 std::vector<bool>* nodes_to_delete) { in IsCpuCompatibleDataType() argument
1198 (*nodes_to_delete)[matched.squeeze] = true; in IsCpuCompatibleDataType()
1206 std::vector<bool>* nodes_to_delete) { in IsCpuCompatibleDataType() argument
1236 (*nodes_to_delete)[matched.contraction] = true; in IsCpuCompatibleDataType()
1244 std::vector<bool>* nodes_to_delete) { in IsCpuCompatibleDataType() argument
[all …]
|
| D | dependency_optimizer.cc | 248 std::set<int>* nodes_to_delete) { in OptimizeNode() argument
284 nodes_to_delete->insert(node_to_idx_[node]); in OptimizeNode()
451 nodes_to_delete->insert(node_idx); in OptimizeNode()
468 std::set<int> nodes_to_delete; in OptimizeDependencies() local
479 while (nodes_to_delete.find(node_to_simplify) != nodes_to_delete.end()) { in OptimizeDependencies()
482 OptimizeNode(node_to_simplify, &nodes_to_simplify, &nodes_to_delete); in OptimizeDependencies()
486 VLOG(1) << "Deleted " << nodes_to_delete.size() << " out of " in OptimizeDependencies()
488 EraseNodesFromGraph(nodes_to_delete, optimized_graph_); in OptimizeDependencies()
|
| D | dependency_optimizer.h | 67 std::set<int>* nodes_to_delete);
|
| D | constant_folding.cc | 1647 std::vector<int> nodes_to_delete; in FoldGraph() local
1650 if (fanout.empty()) nodes_to_delete.push_back(i); in FoldGraph()
1652 EraseNodesFromGraph(std::move(nodes_to_delete), output); in FoldGraph()
|
| /external/tensorflow/tensorflow/core/kernels/boosted_trees/ |
| D | resources.cc | 388 std::vector<int32> nodes_to_delete; in PostPruneTree() local
401 RecursivelyDoPostPrunePreparation(current_tree, 0, &nodes_to_delete, in PostPruneTree()
404 if (nodes_to_delete.empty()) { in PostPruneTree()
410 std::sort(nodes_to_delete.begin(), nodes_to_delete.end()); in PostPruneTree()
426 const int64 nodes_to_delete_size = nodes_to_delete.size(); in PostPruneTree()
428 i == nodes_to_delete[index_for_deleted]) { in PostPruneTree()
458 const int64 nodes_to_delete_size = nodes_to_delete.size(); in PostPruneTree()
460 i == nodes_to_delete[index_for_deleted]) { in PostPruneTree()
534 std::vector<int32>* nodes_to_delete, in RecursivelyDoPostPrunePreparation() argument
545 nodes_to_delete, nodes_meta); in RecursivelyDoPostPrunePreparation()
[all …]
|
| D | resources.h | 171 std::vector<int32>* nodes_to_delete,
|
| /external/tensorflow/tensorflow/core/grappler/ |
| D | utils.cc | 381 void EraseNodesFromGraphImpl(const UniqueContainer& nodes_to_delete, in EraseNodesFromGraphImpl() argument
387 for (auto it = nodes_to_delete.rbegin(); it != nodes_to_delete.rend(); ++it) { in EraseNodesFromGraphImpl()
392 graph->mutable_node()->DeleteSubrange(last + 1, nodes_to_delete.size()); in EraseNodesFromGraphImpl()
403 void EraseNodesFromGraph(const std::set<int>& nodes_to_delete, in EraseNodesFromGraph() argument
405 EraseNodesFromGraphImpl(nodes_to_delete, graph); in EraseNodesFromGraph()
408 void EraseNodesFromGraph(std::vector<int>&& nodes_to_delete, GraphDef* graph) { in EraseNodesFromGraph() argument
409 STLSortAndRemoveDuplicates(&nodes_to_delete); in EraseNodesFromGraph()
410 EraseNodesFromGraphImpl(nodes_to_delete, graph); in EraseNodesFromGraph()
413 void EraseNodesFromGraph(const std::set<string>& nodes_to_delete, in EraseNodesFromGraph() argument
416 nodes_idx_to_delete.reserve(nodes_to_delete.size()); in EraseNodesFromGraph()
[all …]
|
| D | mutable_graph_view.h | 249 Status DeleteNodes(const absl::flat_hash_set<string>& nodes_to_delete);
317 const absl::flat_hash_set<string>& nodes_to_delete);
|
| D | utils.h | 400 void EraseNodesFromGraph(const std::set<int>& nodes_to_delete, GraphDef* graph);
402 void EraseNodesFromGraph(std::vector<int>&& nodes_to_delete, GraphDef* graph);
404 void EraseNodesFromGraph(const std::set<string>& nodes_to_delete,
|
| D | mutable_graph_view.cc | 1491 const absl::flat_hash_set<string>& nodes_to_delete) { in CheckNodesCanBeDeleted() argument
1494 for (const string& node_name_to_delete : nodes_to_delete) { in CheckNodesCanBeDeleted()
1510 if (!nodes_to_delete.contains(fanout.node->name())) { in CheckNodesCanBeDeleted()
1540 std::vector<string> input_node_names(nodes_to_delete.begin(), in CheckNodesCanBeDeleted()
1541 nodes_to_delete.end()); in CheckNodesCanBeDeleted()
1554 const absl::flat_hash_set<string>& nodes_to_delete) { in DeleteNodes() argument
1555 TF_RETURN_IF_ERROR(CheckNodesCanBeDeleted(nodes_to_delete)); in DeleteNodes()
1558 for (const string& node_name_to_delete : nodes_to_delete) { in DeleteNodes()
1565 for (const string& node_name_to_delete : nodes_to_delete) { in DeleteNodes()
1577 if (nodes_to_delete.contains(graph()->node(pos).name())) { in DeleteNodes()
|
| /external/chromium-trace/catapult/devil/devil/android/ |
| D | device_utils.py | 2011 nodes_to_delete = current_device_nodes - expected_device_nodes
2016 if delete_stale and nodes_to_delete:
2017 self.RemovePath(nodes_to_delete, force=True, recursive=True)
2020 possibly_stale_device_nodes = current_device_nodes - nodes_to_delete
2066 nodes_to_delete.add(device_path)
2068 if delete_stale and nodes_to_delete:
2069 self.RemovePath(nodes_to_delete, force=True, recursive=True)
|