Home
last modified time | relevance | path

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

/external/tensorflow/tensorflow/core/grappler/optimizers/
Dconstant_folding.cc327 return node_map_->NodeExists(OptimizedNodeName(node, suffix)); in OptimizedNodeExists()
397 AddControlDependency(node->input(0), graph_, node_map_.get()); in MaterializeShapes()
399 node_map_->AddOutput(NodeName(ctrl_dep), node->name()); in MaterializeShapes()
406 const NodeDef* array = CHECK_NOTNULL(node_map_->GetNode(node->input(0))); in MaterializeShapes()
413 CHECK_NOTNULL(node_map_->GetNode(array->input(0))); in MaterializeShapes()
436 graph_, node_map_.get())); in MaterializeShapes()
461 auto outputs = node_map_->GetOutputs(shape_n_node->name()); in MaterializeShapes()
473 if (node_map_->GetNode(const_name) == nullptr) { in MaterializeShapes()
478 node_map_->AddNode(added_node->name(), added_node); in MaterializeShapes()
486 graph_, node_map_.get()); in MaterializeShapes()
[all …]
Ddependency_optimizer.cc71 const NodeDef* input = node_map_->GetNode(NodeName(node.input(0))); in SafeToRemoveIdentity()
79 for (const auto& consumer : node_map_->GetOutputs(node.name())) { in SafeToRemoveIdentity()
121 if (NumNonControlOutputs(node, *node_map_) > 0) { in SafeToConvertToNoOp()
236 const std::set<NodeDef*> output_nodes = node_map_->GetOutputs(node_name); in OptimizeNode()
255 node_map_->RemoveOutput(node_name, fanout->name()); in OptimizeNode()
259 if (node_map_->GetOutputs(node_name).empty() && fetch_nodes_known_ && in OptimizeNode()
289 old_input, optimized_graph_, node_map_.get()); in OptimizeNode()
292 node_map_->UpdateInput(node_name, old_input, ctrl_input); in OptimizeNode()
293 const NodeDef* old_input_node = node_map_->GetNode(old_input); in OptimizeNode()
353 const auto& output_node_set = node_map_->GetOutputs(node_name); in OptimizeNode()
[all …]
Dloop_optimizer.cc76 std::unique_ptr<NodeMap> node_map_; member in tensorflow::grappler::__anon1ad005370111::LoopInvariantNodeMotionOptimizer
89 auto consumers = node_map_->GetOutputs(node->name()); in HandleInvariantEnter()
104 node_map_->AddOutput(NodeName(enter_input), consumer->name()); in HandleInvariantEnter()
105 node_map_->RemoveOutput(node->name(), consumer->name()); in HandleInvariantEnter()
110 node_map_->AddOutput(NodeName(control_input), consumer->name()); in HandleInvariantEnter()
126 node_map_->RemoveInputs(node->name()); in HandleConst()
134 const_node = node_map_->GetNode(const_node_name); in HandleConst()
141 node_map_->AddNode(const_node->name(), const_node); in HandleConst()
143 auto consumers = node_map_->GetOutputs(node->name()); in HandleConst()
153 node_map_->AddOutput(const_node->name(), consumer->name()); in HandleConst()
[all …]
Dlayout_optimizer.cc405 node_map_(node_map) {} in GraphProcessor()
411 node_map_->AddNode(name, node); in AddNodePermConst()
437 node_map_->AddNode(name, node); in AddNodeConstScalar()
466 NodeMap* node_map_; member in tensorflow::grappler::__anonbd4a17fb0111::GraphProcessor
555 auto outputs = node_map_->GetOutputs(node_->name()); in HasOutputs()
613 auto input_node = node_map_->GetNode(node_->input(input_index)); in UpdateAttrValueOfInput()
624 node_map_->AddNode(node_name, added_node); in UpdateAttrValueOfInput()
625 node_map_->AddOutput(node_name, node_->name()); in UpdateAttrValueOfInput()
646 auto input_node = node_map_->GetNode(node_->input(pos)); in AddLayoutTransposeToInputs()
655 node_map_->UpdateOutput(NodeName(node_->input(pos)), node_->name(), in AddLayoutTransposeToInputs()
[all …]
Dscoped_allocator_optimizer.h66 NodeMap* node_map() { return node_map_.get(); } in node_map()
105 std::unique_ptr<NodeMap> node_map_; variable
Ddependency_optimizer.h77 std::unique_ptr<NodeMap> node_map_; variable
Darithmetic_optimizer.h132 std::unique_ptr<NodeMap> node_map_; variable
Dconstant_folding.h249 std::unique_ptr<NodeMap> node_map_; variable
Darithmetic_optimizer.cc3479 const std::set<NodeDef*>& tmp = node_map_->GetOutputs(node->name()); in DedupComputations()
3496 node_map_->AddOutput(rep->name(), fanout->name()); in DedupComputations()
3508 node_map_.reset(new NodeMap(optimized_graph_)); in DedupComputations()
3518 node_map_->AddOutput(NodeName(src->input(i)), target_node->name()); in ForwardControlDependencies()
3535 graph_properties_.get(), node_map_.get(), in SimplifyArithmeticOps()
3613 NodeDef* simplified_node = node_map_->GetNode(simplified_tensor); in SimplifyArithmeticOps()
3621 const std::set<NodeDef*> outputs = node_map_->GetOutputs(node->name()); in SimplifyArithmeticOps()
3640 node_map_->UpdateInput(consumer->name(), node->name(), in SimplifyArithmeticOps()
3657 node_map_.reset(new NodeMap(optimized_graph_)); in Optimize()
Dscoped_allocator_optimizer.cc687 node_map_.reset(new NodeMap(optimized_graph)); in Optimize()
/external/tensorflow/tensorflow/core/grappler/costs/
Dvirtual_scheduler.cc282 node_map_.clear(); in Init()
401 auto& input_node_state = node_map_.at(recv_op); in Init()
475 auto& node_state = node_map_[node]; in MaybeUpdateInputOutput()
632 const auto& node_state = node_map_.at(node); in GetCurrNode()
655 auto it = node_map_.find(node); in GetNodeStateOrCreateIt()
656 if (it != node_map_.end()) { in GetNodeStateOrCreateIt()
661 it = node_map_.emplace(node, NodeState()).first; in GetNodeStateOrCreateIt()
723 auto& node_state = node_map_[node]; in AddOutputNodesToReadyQueue()
730 auto& output_state = node_map_[output_node]; in AddOutputNodesToReadyQueue()
749 auto& node_state = node_map_[node]; in MarkCurrNodeExecuted()
[all …]
Dvirtual_scheduler.h298 return &node_map_; in GetNodeStates()
331 std::unordered_map<const NodeDef*, NodeState> node_map_; variable
/external/tensorflow/tensorflow/tools/graph_transforms/
Dtransform_utils.h179 std::map<string, const NodeDef*> node_map_; variable
Dtransform_utils.cc286 MapNamesToNodes(graph_def_, &node_map_); in GraphMatcher()
349 const NodeDef& input_node = *(node_map_[input_node_name]); in DoesOpTypeMatch()