Home
last modified time | relevance | path

Searched refs:nodes_to_preserve (Results 1 – 14 of 14) sorted by relevance

/external/tensorflow/tensorflow/core/grappler/optimizers/data/
Dshuffle_and_repeat_fusion.cc197 const auto nodes_to_preserve = item.NodesToPreserve(); in OptimizeAndCollectStats() local
198 if (nodes_to_preserve.find(shuffle_node.name()) == in OptimizeAndCollectStats()
199 nodes_to_preserve.end() && in OptimizeAndCollectStats()
200 nodes_to_preserve.find(repeat_node.name()) == nodes_to_preserve.end()) { in OptimizeAndCollectStats()
/external/tensorflow/tensorflow/core/grappler/utils/
Dpattern_utils.h186 const std::unordered_set<string>& nodes_to_preserve,
206 const std::unordered_set<string>& nodes_to_preserve) { in IsSafeNodesToRemove() argument
211 if (nodes_to_preserve.count(node_name) > 0) return false; in IsSafeNodesToRemove()
Dpattern_utils.cc170 const std::unordered_set<string>& nodes_to_preserve, in GetMatchedNodes() argument
176 if (IsSafeNodesToRemove(nodes_to_preserve)) { in GetMatchedNodes()
Dpattern_utils_test.cc257 std::unordered_set<string> nodes_to_preserve = {"foo"}; in TEST_F() local
261 graph_matcher.GetMatchedNodes(pattern, nodes_to_preserve, root_node_view, in TEST_F()
283 nodes_to_preserve.insert({"c", "d"}); in TEST_F()
287 graph_matcher.GetMatchedNodes(pattern, nodes_to_preserve, root_node_view, in TEST_F()
/external/tensorflow/tensorflow/compiler/tf2tensorrt/convert/
Dtrt_optimization_pass.cc209 std::vector<string> nodes_to_preserve; in Optimize() local
211 nodes_to_preserve.reserve(old_nodes_to_preserve.size()); in Optimize()
225 nodes_to_preserve.push_back(s); in Optimize()
235 return ConvertGraph(params_, optimized_item, nodes_to_preserve, cluster, in Optimize()
/external/tensorflow/tensorflow/core/grappler/optimizers/
Dgraph_optimizer_stage.h49 GraphOptimizerContext(const std::unordered_set<string>* nodes_to_preserve, in GraphOptimizerContext()
54 : nodes_to_preserve(nodes_to_preserve), in GraphOptimizerContext()
61 const std::unordered_set<string>* nodes_to_preserve; member
Dmodel_pruner.cc423 const std::unordered_set<string> nodes_to_preserve = item.NodesToPreserve(); in Optimize() local
430 if (!nodes_to_preserve.empty()) { in Optimize()
434 std::vector<string> terminal_nodes(nodes_to_preserve.begin(), in Optimize()
435 nodes_to_preserve.end()); in Optimize()
473 if (nodes_to_preserve.find(node->name()) != nodes_to_preserve.end()) { in Optimize()
498 if (nodes_to_delete.empty() && nodes_to_preserve.empty()) { in Optimize()
Dloop_optimizer.cc457 const std::unordered_set<string>& nodes_to_preserve, int stack_node_idx) { in GetStackPushNodesToConvert() argument
493 if (nodes_to_preserve.find(stack_node->name()) == in GetStackPushNodesToConvert()
494 nodes_to_preserve.end()) { in GetStackPushNodesToConvert()
506 nodes_to_preserve.find(fanout_node.name()) != in GetStackPushNodesToConvert()
507 nodes_to_preserve.end())) { in GetStackPushNodesToConvert()
518 Status RemoveStackOps(const std::unordered_set<string>& nodes_to_preserve, in RemoveStackOps() argument
527 graph_view, nodes_to_preserve, node_idx)) { in RemoveStackOps()
762 const std::unordered_set<string>& nodes_to_preserve, NodeMap& node_map, in RemoveDeadBranches() argument
776 if (nodes_to_preserve.find(node.name()) != nodes_to_preserve.end()) { in RemoveDeadBranches()
807 if (nodes_to_preserve.find(dead.node->name()) != in RemoveDeadBranches()
[all …]
Dloop_optimizer.h63 Status RemoveDeadBranches(const std::unordered_set<string>& nodes_to_preserve,
Darithmetic_optimizer.cc141 const std::unordered_set<string>& nodes_to_preserve) { in GetTailOfValuePreservingChain() argument
143 return nodes_to_preserve.find(node.name()) == nodes_to_preserve.end() && in GetTailOfValuePreservingChain()
152 const std::unordered_set<string>& nodes_to_preserve) { in GetTailOfIdempotentChain() argument
154 return nodes_to_preserve.find(node.name()) == nodes_to_preserve.end() && in GetTailOfIdempotentChain()
316 return ctx().nodes_to_preserve->find(node.name()) != in IsInPreserveSet()
317 ctx().nodes_to_preserve->end(); in IsInPreserveSet()
503 return ctx().nodes_to_preserve->find(node.name()) != in IsInPreserveSet()
504 ctx().nodes_to_preserve->end(); in IsInPreserveSet()
1189 *ctx().nodes_to_preserve); in TrySimplify()
1306 *ctx().nodes_to_preserve); in TrySimplify()
[all …]
Dremapper.cc90 : nodes_to_preserve(item->NodesToPreserve()), in RemapperContext()
97 std::unordered_set<string> nodes_to_preserve; member
269 return ctx.nodes_to_preserve.count(node->name()) > 0; in IsInPreserveSet()
1245 gelu_exact_pattern, ctx->nodes_to_preserve, node_view, matched_nodes_map, in FindMatMulBiasAddAndGelu()
1252 gelu_approximate_pattern, ctx->nodes_to_preserve, node_view, in FindMatMulBiasAddAndGelu()
1527 graph_matcher.GetMatchedNodes(layer_norm_pattern, ctx->nodes_to_preserve, in FindMklLayerNorm()
2011 graph_matcher.GetMatchedNodes(fusion_pattern1, ctx->nodes_to_preserve, in FindFusedBatchMatMul()
2019 graph_matcher.GetMatchedNodes(fusion_pattern2, ctx->nodes_to_preserve, in FindFusedBatchMatMul()
Dgeneric_layout_optimizer_transposer.cc240 const auto& nodes_to_preserve = item.NodesToPreserve(); in InitializeTransposeContext() local
241 context->nodes_to_preserve = absl::flat_hash_set<string>( in InitializeTransposeContext()
242 nodes_to_preserve.begin(), nodes_to_preserve.end()); in InitializeTransposeContext()
281 !context.nodes_to_preserve.contains(node_def->name()) && in ShouldProcess()
642 return !context.nodes_to_preserve.contains(node.GetName()) && in CanProcessNode()
Dgeneric_layout_optimizer_transposer.h75 absl::flat_hash_set<string> nodes_to_preserve; member
Dauto_mixed_precision.cc1036 const std::unordered_set<string>& nodes_to_preserve, in AutoMixedPrecisionImpl() argument
1041 nodes_to_preserve_(nodes_to_preserve), in AutoMixedPrecisionImpl()