| /external/tensorflow/tensorflow/core/grappler/ |
| D | utils.cc | 33 NodeMap::NodeMap(GraphDef* graph) { in NodeMap() function in tensorflow::grappler::NodeMap
49 void NodeMap::RemoveNode(const string& name) { in RemoveNode()
54 NodeDef* NodeMap::GetNode(const string& name) const { in GetNode()
63 bool NodeMap::NodeExists(const string& name) const { in NodeExists()
68 const std::set<NodeDef*>& NodeMap::GetOutputs(const string& node_name) const { in GetOutputs()
76 void NodeMap::AddNode(const string& node_name, NodeDef* node) { in AddNode()
82 void NodeMap::AddOutput(const string& node_name, const string& output_name) { in AddOutput()
89 void NodeMap::RemoveOutput(const string& node_name, const string& output_name) { in RemoveOutput()
93 void NodeMap::UpdateInput(const string& node_name, const string& old_input_name, in UpdateInput()
99 void NodeMap::RemoveInputs(const string& node_name) { in RemoveInputs()
[all …]
|
| D | utils.h | 35 class NodeMap {
39 explicit NodeMap(GraphDef* graph);
144 int NumNonControlOutputs(const NodeDef& node, const NodeMap& node_map);
162 NodeDef* GetTailOfChain(const NodeDef& source, const NodeMap& node_map,
|
| D | utils_test.cc | 221 NodeMap node_map(&graph); in TEST_F()
|
| /external/tensorflow/tensorflow/core/grappler/optimizers/ |
| D | layout_optimizer_test.cc | 174 NodeMap node_map(&output); in TEST_F()
197 NodeMap node_map(&output); in TEST_F()
218 NodeMap node_map(&output); in TEST_F()
231 NodeMap node_map(&output); in TEST_F()
244 NodeMap node_map(&output); in TEST_F()
257 NodeMap node_map(&output); in TEST_F()
270 NodeMap node_map(&output); in TEST_F()
285 NodeMap node_map(&output); in TEST_F()
314 NodeMap node_map_original(&item.graph); in TEST_F()
321 NodeMap node_map_output(&output); in TEST_F()
[all …]
|
| D | memory_optimizer_test.cc | 48 NodeMap pre_transform_node_map(&item.graph); in TEST_F()
57 NodeMap post_transform_node_map(&output); in TEST_F()
88 NodeMap pre_transform_node_map(&item.graph); in TEST_F()
111 NodeMap pre_transform_node_map(&item.graph); in TEST_F()
123 NodeMap post_transform_node_map(&output); in TEST_F()
151 NodeMap pre_transform_node_map(&item.graph); in TEST_F()
163 NodeMap post_transform_node_map(&first_pass_output); in TEST_F()
|
| D | constant_folding.h | 38 NodeMap* node_map);
106 std::unique_ptr<NodeMap> node_map_;
|
| D | arithmetic_optimizer.cc | 158 const NodeMap* node_map) { in IsInnerMatrixTransposeNode()
176 GraphDef* graph, NodeMap* node_map) { in MaybeAddControlInput()
194 NodeMap* node_map) { in CopyControlInputs()
252 PartialTensorShape GetInputShape(const string& input, const NodeMap& node_map) { in GetInputShape()
260 const NodeMap& node_map) { in ShapesEqual()
323 const NodeDef& node, const NodeMap& node_map, in GetTailOfValuePreservingChain()
535 node_map_.reset(new NodeMap(optimized_graph_)); in DedupComputations()
1112 node_map_.reset(new NodeMap(optimized_graph_)); in Optimize()
|
| D | dependency_optimizer.h | 69 std::unique_ptr<NodeMap> node_map_;
|
| D | memory_optimizer.cc | 65 const NodeMap& node_map, const GraphDef* graph, in FindCandidateRecomputeNodes()
102 void connected_subgraph(const NodeMap& node_map, bool collect_inputs, in connected_subgraph()
145 const GraphDef* graph, const NodeMap& node_map, in GetOpGroupsToRecompute()
207 const std::unordered_set<NodeDef*>& target_nodes, const NodeMap& node_map, in GetMaxDownstreamComponents()
275 const std::unordered_set<NodeDef*>& target_nodes, const NodeMap& node_map, in AddRecomputeControlDependencyNodes()
369 const std::unordered_set<NodeDef*>& target_nodes, const NodeMap& node_map, in RecomputeSubgraph()
432 NodeMap node_map(graph); in RecomputationRewritingPass()
|
| D | arithmetic_optimizer.h | 103 std::unique_ptr<NodeMap> node_map_;
|
| D | dependency_optimizer.cc | 39 bool RemoveInput(NodeDef* node, const string& input, NodeMap* node_map) { in RemoveInput()
421 node_map_.reset(new NodeMap(optimized_graph_)); in OptimizeDependencies()
562 node_map_.reset(new NodeMap(optimized_graph_)); in Optimize()
|
| D | arithmetic_optimizer_test.cc | 866 NodeMap node_map(&output); in TEST_F()
926 NodeMap node_map(&output); in TEST_F()
968 NodeMap node_map(&output); in TEST_F()
998 NodeMap node_map(&output); in TEST_F()
1045 NodeMap node_map(&output); in TEST_F()
1094 NodeMap node_map(&output); in TEST_F()
|
| D | layout_optimizer.cc | 375 GraphDef* graph, NodeMap* node_map) in GraphProcessor()
441 NodeMap* node_map_;
445 OptimizeContext(GraphDef* graph, NodeDef* node, NodeMap* node_map, in OptimizeContext()
459 NodeMap* node_map;
1882 NodeMap* node_map) in DataLayoutOptimizer()
2111 NodeMap node_map(output); in Tune()
|
| D | constant_folding.cc | 135 GraphDef* graph, NodeMap* node_map) { in MaybeAddControlInput()
154 GraphDef* graph, NodeMap* node_map) { in MaybeRemoveControlInput()
181 NodeMap* node_map) { in AddControlDependency()
1678 node_map_.reset(new NodeMap(graph_)); in RunOptimizationPass()
1708 node_map_.reset(new NodeMap(output)); in RunOptimizationPass()
|
| /external/tensorflow/tensorflow/core/grappler/utils/ |
| D | frame.cc | 30 NodeMap node_map(const_cast<GraphDef*>(&graph)); in IdentifyFrames()
34 Status IdentifyFramesWithNodeMap(const GraphDef& graph, const NodeMap& node_map, in IdentifyFramesWithNodeMap()
|
| D | frame.h | 37 Status IdentifyFramesWithNodeMap(const GraphDef& graph, const NodeMap& node_map,
|
| /external/tensorflow/tensorflow/compiler/tf2xla/ |
| D | tf2xla.cc | 58 typedef std::unordered_map<string, Node*> NodeMap; typedef
64 Status AddArgNodes(Graph* graph, const NodeMap& node_map, in AddArgNodes()
120 Status AddRetvalNodes(Graph* graph, const NodeMap& node_map, in AddRetvalNodes()
156 NodeMap node_map; in RewriteAndPruneGraph()
|
| /external/clang/include/clang/ASTMatchers/ |
| D | ASTMatchersInternal.h | 127 NodeMap[ID] = DynNode; in addNode()
136 IDToNodeMap::const_iterator It = NodeMap.find(ID); in getNodeAs()
137 if (It == NodeMap.end()) { in getNodeAs()
144 IDToNodeMap::const_iterator It = NodeMap.find(ID); in getNode()
145 if (It == NodeMap.end()) { in getNode()
153 return NodeMap < Other.NodeMap;
164 return NodeMap; in getMap()
170 for (const auto &IDAndNode : NodeMap) { in isComparable()
178 IDToNodeMap NodeMap;
|
| /external/libmojo/mojo/edk/system/ |
| D | node_controller.h | 142 using NodeMap = std::unordered_map<ports::NodeName, variable
277 NodeMap peers_;
348 NodeMap pending_children_;
|
| /external/swiftshader/third_party/subzero/src/ |
| D | IceConverter.cpp | 104 NodeMap.clear(); in convertFunction()
188 if (NodeMap.find(BB) == NodeMap.end()) { in mapBasicBlockToNode()
189 NodeMap[BB] = Func->makeNode(); in mapBasicBlockToNode()
191 NodeMap[BB]->setName(BB->getName()); in mapBasicBlockToNode()
193 return NodeMap[BB]; in mapBasicBlockToNode()
649 std::map<const BasicBlock *, Ice::CfgNode *> NodeMap; member in __anon6ae407240111::LLVM2ICEFunctionConverter
|
| D | IceOperand.cpp | 108 assert(NodeMap.find(Start) == NodeMap.end()); in addSegment()
109 NodeMap[Start] = Node; in addSegment()
|
| D | IceOperand.h | 665 auto Iter = NodeMap.find(Begin); in getNodeForSegment()
666 assert(Iter != NodeMap.end()); in getNodeForSegment()
672 CfgUnorderedMap<InstNumberT, CfgNode *> NodeMap; variable
|
| /external/llvm/include/llvm/Analysis/ |
| D | LazyCallGraph.h | 776 Node *lookup(const Function &F) const { return NodeMap.lookup(&F); } in lookup()
798 Node *&N = NodeMap[&F]; in get()
841 DenseMap<const Function *, Node *> NodeMap; variable
|
| /external/swiftshader/third_party/LLVM/lib/CodeGen/SelectionDAG/ |
| D | SelectionDAGBuilder.h | 86 DenseMap<const Value*, SDValue> NodeMap; variable
395 SDValue &N = NodeMap[V]; in setValue()
|
| /external/llvm/lib/Analysis/ |
| D | LazyCallGraph.cpp | 154 : BPA(std::move(G.BPA)), NodeMap(std::move(G.NodeMap)), in LazyCallGraph()
166 NodeMap = std::move(G.NodeMap); in operator =()
|