| /external/tensorflow/tensorflow/core/grappler/optimizers/data/ |
| D | auto_shard.cc | 258 absl::flat_hash_set<string>* nodes_to_delete, in RemoveShuffleDataset() argument
269 nodes_to_delete->insert(node.name()); in RemoveShuffleDataset()
274 graph, *fanin.node, nodes_to_delete, op_name, buffer_size_node, in RemoveShuffleDataset()
283 absl::flat_hash_set<string>* nodes_to_delete, in RemoveShuffleDatasetV2() argument
291 nodes_to_delete->insert(node.name()); in RemoveShuffleDatasetV2()
296 RemoveShuffleDatasetV2(graph, *fanin.node, nodes_to_delete, op_name, in RemoveShuffleDatasetV2()
305 absl::flat_hash_set<string>* nodes_to_delete, in ProcessDatasetSourceNode() argument
316 graph, node, nodes_to_delete, &shuffle_op_name, &buffer_size_node, in ProcessDatasetSourceNode()
320 RemoveShuffleDatasetV2(graph, node, nodes_to_delete, &shuffle_op_name, in ProcessDatasetSourceNode()
338 absl::flat_hash_set<string>* nodes_to_delete) { in RecursivelyHandleOp() argument
[all …]
|
| D | shuffle_and_repeat_fusion.cc | 43 absl::flat_hash_set<string> nodes_to_delete; in OptimizeAndCollectStats() local
102 nodes_to_delete.insert(shuffle_node.name()); in OptimizeAndCollectStats()
103 nodes_to_delete.insert(repeat_node.name()); in OptimizeAndCollectStats()
107 TF_RETURN_IF_ERROR(graph.DeleteNodes(nodes_to_delete)); in OptimizeAndCollectStats()
|
| D | map_and_batch_fusion.cc | 108 absl::flat_hash_set<string> nodes_to_delete; in OptimizeAndCollectStats() local
130 nodes_to_delete.insert(map_node->name()); in OptimizeAndCollectStats()
131 nodes_to_delete.insert(batch_node.name()); in OptimizeAndCollectStats()
135 TF_RETURN_IF_ERROR(graph.DeleteNodes(nodes_to_delete)); in OptimizeAndCollectStats()
|
| 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_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 | noop_elimination.cc | 80 absl::flat_hash_set<string> nodes_to_delete; in OptimizeAndCollectStats() local
87 nodes_to_delete.insert(node.name()); in OptimizeAndCollectStats()
91 TF_RETURN_IF_ERROR(graph.DeleteNodes(nodes_to_delete)); in OptimizeAndCollectStats()
|
| D | map_parallelization.cc | 62 absl::flat_hash_set<string> nodes_to_delete; in OptimizeAndCollectStats() local
83 nodes_to_delete.insert(map_node->name()); in OptimizeAndCollectStats()
87 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 | 231 absl::flat_hash_set<string> nodes_to_delete; in OptimizeAndCollectStats() local
277 nodes_to_delete.insert(map_node->name()); in OptimizeAndCollectStats()
281 TF_RETURN_IF_ERROR(graph.DeleteNodes(nodes_to_delete)); in OptimizeAndCollectStats()
|
| D | map_vectorization.cc | 517 absl::flat_hash_set<string> nodes_to_delete; in OptimizeAndCollectStats() local
570 nodes_to_delete.insert(n->name()); in OptimizeAndCollectStats()
579 nodes_to_delete.insert(n->name()); in OptimizeAndCollectStats()
598 TF_RETURN_IF_ERROR(graph.DeleteNodes(nodes_to_delete)); in OptimizeAndCollectStats()
|
| /external/tensorflow/tensorflow/core/grappler/optimizers/ |
| D | model_pruner.cc | 143 const absl::flat_hash_set<const NodeDef*>& nodes_to_delete, in ForwardInputsInternal() argument
165 if (nodes_to_delete.find(input_node) != nodes_to_delete.end()) { in ForwardInputsInternal()
166 ForwardInputsInternal(*input_node, nodes_to_delete, in ForwardInputsInternal()
177 const absl::flat_hash_set<const NodeDef*>& nodes_to_delete, in ForwardInputs() argument
182 ForwardInputsInternal(original_node, nodes_to_delete, in ForwardInputs()
455 absl::flat_hash_set<const NodeDef*> nodes_to_delete; in Optimize() local
481 nodes_to_delete.insert(&node); in Optimize()
485 if (nodes_to_delete.empty() && nodes_to_preserve.empty()) { in Optimize()
492 if (nodes_to_delete.empty()) { in Optimize()
502 nodes_to_delete.find(&node) == nodes_to_delete.end()) { in Optimize()
[all …]
|
| D | remapper.cc | 907 std::vector<bool>* nodes_to_delete) { in AddFusedContractionNode() argument
941 (*nodes_to_delete)[matched.contraction] = true; in AddFusedContractionNode()
948 std::vector<bool>* invalidated_nodes, std::vector<bool>* nodes_to_delete) { in AddFusedContractionNode() argument
984 (*nodes_to_delete)[matched.contraction] = true; in AddFusedContractionNode()
985 (*nodes_to_delete)[matched.bias_add] = true; in AddFusedContractionNode()
994 std::vector<bool>* nodes_to_delete) { in AddFusedConv2DNode() argument
1035 (*nodes_to_delete)[matched.squeeze] = true; in AddFusedConv2DNode()
1043 std::vector<bool>* nodes_to_delete) { in AddFusedConv2DNode() argument
1073 (*nodes_to_delete)[matched.contraction] = true; in AddFusedConv2DNode()
1081 std::vector<bool>* nodes_to_delete) { in AddFusedConv2DNode() argument
[all …]
|
| D | dependency_optimizer.cc | 226 std::set<int>* nodes_to_delete) { in OptimizeNode() argument
262 nodes_to_delete->insert(node_to_idx_[node]); in OptimizeNode()
429 nodes_to_delete->insert(node_idx); in OptimizeNode()
446 std::set<int> nodes_to_delete; in OptimizeDependencies() local
457 while (nodes_to_delete.find(node_to_simplify) != nodes_to_delete.end()) { in OptimizeDependencies()
460 OptimizeNode(node_to_simplify, &nodes_to_simplify, &nodes_to_delete); in OptimizeDependencies()
464 VLOG(1) << "Deleted " << nodes_to_delete.size() << " out of " in OptimizeDependencies()
466 EraseNodesFromGraph(nodes_to_delete, optimized_graph_); in OptimizeDependencies()
|
| D | dependency_optimizer.h | 67 std::set<int>* nodes_to_delete);
|
| D | constant_folding.cc | 1592 std::vector<int> nodes_to_delete; in FoldGraph() local
1595 if (fanout.empty()) nodes_to_delete.push_back(i); in FoldGraph()
1597 EraseNodesFromGraph(std::move(nodes_to_delete), output); in FoldGraph()
|
| /external/tensorflow/tensorflow/core/kernels/boosted_trees/ |
| D | resources.cc | 389 std::vector<int32> nodes_to_delete; in PostPruneTree() local
402 RecursivelyDoPostPrunePreparation(current_tree, 0, &nodes_to_delete, in PostPruneTree()
405 if (nodes_to_delete.empty()) { in PostPruneTree()
411 std::sort(nodes_to_delete.begin(), nodes_to_delete.end()); in PostPruneTree()
427 if (index_for_deleted < nodes_to_delete.size() && in PostPruneTree()
428 i == nodes_to_delete[index_for_deleted]) { in PostPruneTree()
458 if (index_for_deleted < nodes_to_delete.size() && in PostPruneTree()
459 i == nodes_to_delete[index_for_deleted]) { in PostPruneTree()
533 std::vector<int32>* nodes_to_delete, in RecursivelyDoPostPrunePreparation() argument
544 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 | 453 void EraseNodesFromGraphImpl(const UniqueContainer& nodes_to_delete, in EraseNodesFromGraphImpl() argument
459 for (auto it = nodes_to_delete.rbegin(); it != nodes_to_delete.rend(); ++it) { in EraseNodesFromGraphImpl()
464 graph->mutable_node()->DeleteSubrange(last + 1, nodes_to_delete.size()); in EraseNodesFromGraphImpl()
475 void EraseNodesFromGraph(const std::set<int>& nodes_to_delete, in EraseNodesFromGraph() argument
477 EraseNodesFromGraphImpl(nodes_to_delete, graph); in EraseNodesFromGraph()
480 void EraseNodesFromGraph(std::vector<int>&& nodes_to_delete, GraphDef* graph) { in EraseNodesFromGraph() argument
481 STLSortAndRemoveDuplicates(&nodes_to_delete); in EraseNodesFromGraph()
482 EraseNodesFromGraphImpl(nodes_to_delete, graph); in EraseNodesFromGraph()
485 void EraseNodesFromGraph(const std::set<string>& nodes_to_delete, in EraseNodesFromGraph() argument
488 nodes_idx_to_delete.reserve(nodes_to_delete.size()); in EraseNodesFromGraph()
[all …]
|
| D | utils.h | 281 void EraseNodesFromGraph(const std::set<int>& nodes_to_delete, GraphDef* graph);
283 void EraseNodesFromGraph(std::vector<int>&& nodes_to_delete, GraphDef* graph);
285 void EraseNodesFromGraph(const std::set<string>& nodes_to_delete,
|
| 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 | 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()
|