| /external/tensorflow/tensorflow/core/grappler/optimizers/data/ |
| D | auto_shard.cc | 161 absl::flat_hash_set<string>* nodes_to_delete) { in RemoveShuffleDataset() argument
164 nodes_to_delete->insert(node.name()); in RemoveShuffleDataset()
169 RemoveShuffleDataset(graph, *fanin.node, nodes_to_delete)); in RemoveShuffleDataset()
179 absl::flat_hash_set<string>* nodes_to_delete) { in RecursivelyHandleOp() argument
189 flib, graph, nodes_to_delete)); in RecursivelyHandleOp()
205 TF_RETURN_IF_ERROR(RemoveShuffleDataset(graph, node, nodes_to_delete)); in RecursivelyHandleOp()
212 TF_RETURN_IF_ERROR(RemoveShuffleDataset(graph, node, nodes_to_delete)); in RecursivelyHandleOp()
224 nodes_to_delete); in RecursivelyHandleOp()
234 absl::flat_hash_set<string> nodes_to_delete; in OptimizeGraph() local
246 &graph, &nodes_to_delete)); in OptimizeGraph()
[all …]
|
| D | shuffle_and_repeat_fusion.cc | 42 absl::flat_hash_set<string> nodes_to_delete; in OptimizeAndCollectStats() local
93 nodes_to_delete.insert(shuffle_node.name()); in OptimizeAndCollectStats()
94 nodes_to_delete.insert(repeat_node.name()); in OptimizeAndCollectStats()
98 TF_RETURN_IF_ERROR(graph.DeleteNodes(nodes_to_delete)); in OptimizeAndCollectStats()
|
| D | make_numa_aware.cc | 47 absl::flat_hash_set<string> nodes_to_delete; in OptimizeAndCollectStats() local
54 nodes_to_delete.insert(node.name()); in OptimizeAndCollectStats()
57 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
124 nodes_to_delete.insert(first_filter_node->name()); in OptimizeAndCollectStats()
125 nodes_to_delete.insert(second_filter_node->name()); in OptimizeAndCollectStats()
129 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
146 nodes_to_delete.insert(parent_map_node->name()); in OptimizeAndCollectStats()
147 nodes_to_delete.insert(map_node->name()); in OptimizeAndCollectStats()
151 TF_RETURN_IF_ERROR(graph.DeleteNodes(nodes_to_delete)); in OptimizeAndCollectStats()
|
| D | map_and_filter_fusion.cc | 107 absl::flat_hash_set<string> nodes_to_delete; in OptimizeAndCollectStats() local
167 nodes_to_delete.insert(map_node->name()); in OptimizeAndCollectStats()
168 nodes_to_delete.insert(filter_node->name()); in OptimizeAndCollectStats()
172 TF_RETURN_IF_ERROR(graph.DeleteNodes(nodes_to_delete)); in OptimizeAndCollectStats()
|
| D | map_parallelization.cc | 61 absl::flat_hash_set<string> nodes_to_delete; in OptimizeAndCollectStats() local
82 nodes_to_delete.insert(map_node->name()); in OptimizeAndCollectStats()
86 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 | 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 | 516 absl::flat_hash_set<string> nodes_to_delete; in OptimizeAndCollectStats() local
|
| /external/tensorflow/tensorflow/core/kernels/boosted_trees/ |
| D | resources.cc | 313 std::vector<int32> nodes_to_delete; in PostPruneTree() local
325 RecursivelyDoPostPrunePreparation(current_tree, 0, &nodes_to_delete, in PostPruneTree()
328 if (nodes_to_delete.empty()) { in PostPruneTree()
334 std::sort(nodes_to_delete.begin(), nodes_to_delete.end()); in PostPruneTree()
350 if (index_for_deleted < nodes_to_delete.size() && in PostPruneTree()
351 i == nodes_to_delete[index_for_deleted]) { in PostPruneTree()
376 if (index_for_deleted < nodes_to_delete.size() && in PostPruneTree()
377 i == nodes_to_delete[index_for_deleted]) { in PostPruneTree()
444 std::vector<int32>* nodes_to_delete, in RecursivelyDoPostPrunePreparation() argument
455 nodes_to_delete, nodes_meta); in RecursivelyDoPostPrunePreparation()
[all …]
|
| D | resources.h | 162 std::vector<int32>* nodes_to_delete,
|
| /external/tensorflow/tensorflow/core/grappler/optimizers/ |
| D | model_pruner.cc | 128 const absl::flat_hash_set<const NodeDef*>& nodes_to_delete, in ForwardInputsInternal() argument
150 if (nodes_to_delete.find(input_node) != nodes_to_delete.end()) { in ForwardInputsInternal()
151 ForwardInputsInternal(*input_node, nodes_to_delete, in ForwardInputsInternal()
162 const absl::flat_hash_set<const NodeDef*>& nodes_to_delete, in ForwardInputs() argument
167 ForwardInputsInternal(original_node, nodes_to_delete, in ForwardInputs()
458 absl::flat_hash_set<const NodeDef*> nodes_to_delete; in Optimize() local
484 nodes_to_delete.insert(&node); in Optimize()
492 if (nodes_to_delete.empty()) { in Optimize()
502 nodes_to_delete.find(&node) == nodes_to_delete.end()) { in Optimize()
506 ForwardInputs(node, nodes_to_delete, new_node, &optimized_nodes, in Optimize()
[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()
428 nodes_to_delete->insert(node_idx); in OptimizeNode()
445 std::set<int> nodes_to_delete; in OptimizeDependencies() local
456 while (nodes_to_delete.find(node_to_simplify) != nodes_to_delete.end()) { in OptimizeDependencies()
459 OptimizeNode(node_to_simplify, &nodes_to_simplify, &nodes_to_delete); in OptimizeDependencies()
463 VLOG(1) << "Deleted " << nodes_to_delete.size() << " out of " in OptimizeDependencies()
465 EraseNodesFromGraph(nodes_to_delete, optimized_graph_); in OptimizeDependencies()
|
| D | dependency_optimizer.h | 65 std::set<int>* nodes_to_delete);
|
| D | constant_folding.cc | 1477 std::vector<int> nodes_to_delete; in FoldGraph() local
1480 if (fanout.empty()) nodes_to_delete.push_back(i); in FoldGraph()
1482 EraseNodesFromGraph(std::move(nodes_to_delete), output); in FoldGraph()
|
| /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 | utils.h | 301 void EraseNodesFromGraph(const std::set<int>& nodes_to_delete, GraphDef* graph);
303 void EraseNodesFromGraph(std::vector<int>&& nodes_to_delete, GraphDef* graph);
305 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 | 1488 const absl::flat_hash_set<string>& nodes_to_delete) { in CheckNodesCanBeDeleted() argument
1491 for (const string& node_name_to_delete : nodes_to_delete) { in CheckNodesCanBeDeleted()
1507 if (!nodes_to_delete.contains(fanout.node->name())) { in CheckNodesCanBeDeleted()
1537 std::vector<string> input_node_names(nodes_to_delete.begin(), in CheckNodesCanBeDeleted()
1538 nodes_to_delete.end()); in CheckNodesCanBeDeleted()
1551 const absl::flat_hash_set<string>& nodes_to_delete) { in DeleteNodes() argument
1552 TF_RETURN_IF_ERROR(CheckNodesCanBeDeleted(nodes_to_delete)); in DeleteNodes()
1555 for (const string& node_name_to_delete : nodes_to_delete) { in DeleteNodes()
1562 for (const string& node_name_to_delete : nodes_to_delete) { in DeleteNodes()
1574 if (nodes_to_delete.contains(graph()->node(pos).name())) { in DeleteNodes()
|