Home
last modified time | relevance | path

Searched refs:optimized_graph_ (Results 1 – 5 of 5) sorted by relevance

/external/tensorflow/tensorflow/core/grappler/optimizers/
Ddependency_optimizer.cc227 NodeDef* node = optimized_graph_->mutable_node(node_idx); in OptimizeNode()
289 old_input, optimized_graph_, node_map_.get()); in OptimizeNode()
438 for (int i = 0; i < optimized_graph_->node_size(); ++i) { in CleanControlInputs()
439 DedupControlInputs(optimized_graph_->mutable_node(i)); in CleanControlInputs()
446 for (int i = 0; i < optimized_graph_->node_size(); ++i) { in OptimizeDependencies()
447 const NodeDef& node = optimized_graph_->node(i); in OptimizeDependencies()
464 << optimized_graph_->node_size() << " nodes."; in OptimizeDependencies()
465 EraseNodesFromGraph(nodes_to_delete, optimized_graph_); in OptimizeDependencies()
466 node_map_.reset(new NodeMap(optimized_graph_)); in OptimizeDependencies()
474 const int num_nodes = optimized_graph_->node_size(); in TransitiveReduction()
[all …]
Dloop_optimizer.cc62 : optimized_graph_(optimized_graph) {} in LoopInvariantNodeMotionOptimizer()
75 GraphDef* optimized_graph_; // Not owned. member in tensorflow::grappler::__anon1ad005370111::LoopInvariantNodeMotionOptimizer
136 const_node = optimized_graph_->add_node(); in HandleConst()
183 switch_output, optimized_graph_, node_map_.get()); in HandleConst()
230 NodeDef* new_enter = optimized_graph_->add_node(); in HandleInvariantNode()
384 node_map_.reset(new NodeMap(optimized_graph_)); in Optimize()
387 TF_RETURN_IF_ERROR(frame_view.InferFromGraph(*optimized_graph_)); in Optimize()
390 for (const NodeDef& node : optimized_graph_->node()) { in Optimize()
Ddependency_optimizer.h79 GraphDef* optimized_graph_; // Not owned. variable
Darithmetic_optimizer.h134 GraphDef* optimized_graph_ = nullptr; // Not owned. variable
Darithmetic_optimizer.cc3424 if (!graph_view.InitializeFromGraph(*optimized_graph_).ok()) { in DedupComputations()
3436 for (const NodeDef& root : optimized_graph_->node()) { in DedupComputations()
3457 for (int i = 0; i < optimized_graph_->node_size(); ++i) { in DedupComputations()
3461 NodeDef* node = optimized_graph_->mutable_node(i); in DedupComputations()
3506 EraseNodesFromGraph(duplicates, optimized_graph_); in DedupComputations()
3508 node_map_.reset(new NodeMap(optimized_graph_)); in DedupComputations()
3529 nodes_to_simplify.Reserve(optimized_graph_->node_size()); in SimplifyArithmeticOps()
3530 for (int i = 0; i < optimized_graph_->node_size(); ++i) { in SimplifyArithmeticOps()
3531 nodes_to_simplify.PushBack(optimized_graph_->mutable_node(i)); in SimplifyArithmeticOps()
3534 const GraphOptimizerContext ctx(&nodes_to_preserve_, optimized_graph_, in SimplifyArithmeticOps()
[all …]