| /external/tensorflow/tensorflow/core/grappler/ |
| D | utils.cc | 75 NodeMap::NodeMap(GraphDef* graph) { in NodeMap() function in tensorflow::grappler::NodeMap
91 void NodeMap::RemoveNode(const string& name) { in RemoveNode()
96 NodeDef* NodeMap::GetNode(const string& name) const { in GetNode()
105 bool NodeMap::NodeExists(const string& name) const { in NodeExists()
110 const std::set<NodeDef*>& NodeMap::GetOutputs(const string& node_name) const { in GetOutputs()
118 void NodeMap::AddNode(const string& node_name, NodeDef* node) { in AddNode()
124 void NodeMap::AddOutput(const string& node_name, const string& output_name) { in AddOutput()
131 void NodeMap::RemoveOutput(const string& node_name, const string& output_name) { in RemoveOutput()
135 void NodeMap::UpdateInput(const string& node_name, const string& old_input_name, in UpdateInput()
141 void NodeMap::RemoveInputs(const string& node_name) { in RemoveInputs()
[all …]
|
| D | utils.h | 43 class NodeMap {
47 explicit NodeMap(GraphDef* graph);
259 int NumNonControlOutputs(const NodeDef& node, const NodeMap& node_map);
263 int NumNonControlDataOutputs(const NodeDef& node, const NodeMap& node_map);
287 NodeDef* GetTailOfChain(const NodeDef& source, const NodeMap& node_map,
|
| /external/tensorflow/tensorflow/core/grappler/optimizers/ |
| D | layout_optimizer_test.cc | 234 NodeMap node_map(&output); in TEST_F()
269 NodeMap node_map(&output); in TEST_F()
290 NodeMap node_map(&output); in TEST_F()
303 NodeMap node_map(&output); in TEST_F()
316 NodeMap node_map(&output); in TEST_F()
329 NodeMap node_map(&output); in TEST_F()
342 NodeMap node_map(&output); in TEST_F()
355 NodeMap node_map(&output); in TEST_F()
370 NodeMap node_map(&output); in TEST_F()
399 NodeMap node_map_original(&item.graph); in TEST_F()
[all …]
|
| D | scoped_allocator_optimizer.h | 29 class NodeMap; variable
66 NodeMap* node_map() { return node_map_.get(); } in node_map()
105 std::unique_ptr<NodeMap> node_map_;
|
| D | graph_optimizer_stage_test.cc | 92 NodeMap node_map(&graph); in TEST_F()
121 NodeMap node_map(&graph); in TEST_F()
154 NodeMap node_map(&item.graph); in TEST_F()
196 NodeMap node_map(&item.graph); in TEST_F()
|
| D | scoped_allocator_optimizer.cc | 126 Status GetInputs(NodeMap* node_map, const std::vector<NodeDef*>& ops, in GetInputs()
162 void RemoveNode(NodeDef* nd, GraphDef* graph, NodeMap* node_map) { in RemoveNode()
180 NodeDef* to_node, NodeMap* node_map) { in RemoveEdge()
258 NodeMap* node_map) { in ClearInternalControlInputs()
279 Status AnalyzeInputs(ScopedAllocatorOptimizer* sa_opti, NodeMap* node_map, in AnalyzeInputs()
314 ScopedAllocatorOptimizer* sa_opti, GraphDef* graph, NodeMap* node_map, in ConstructScopedAllocatorNode()
350 Status BuildSAConcatNode(GraphDef* graph, NodeMap* node_map, in BuildSAConcatNode()
409 Status BuildReplacementOp(GraphDef* graph, NodeMap* node_map, in BuildReplacementOp()
436 Status BuildSplitNode(GraphDef* graph, NodeMap* node_map, in BuildSplitNode()
469 Status RewireSubgraph(GraphDef* graph, NodeMap* node_map, in RewireSubgraph()
[all …]
|
| D | memory_optimizer_test.cc | 55 NodeMap pre_transform_node_map(&item.graph); in TEST_F()
64 NodeMap post_transform_node_map(&output); in TEST_F()
95 NodeMap pre_transform_node_map(&item.graph); in TEST_F()
118 NodeMap pre_transform_node_map(&item.graph); in TEST_F()
130 NodeMap post_transform_node_map(&output); in TEST_F()
158 NodeMap pre_transform_node_map(&item.graph); in TEST_F()
170 NodeMap post_transform_node_map(&first_pass_output); in TEST_F()
|
| D | model_pruner.cc | 185 const NodeMap& node_map, const std::vector<string>& terminal_nodes, in IdentityNTerminalPorts()
258 GraphDef* graph, NodeMap* node_map) { in NewIdentityFromIdentityN()
283 NodeMap* node_map) { in RewriteIdentityNAndInputsOutputs()
376 NodeMap node_map(graph); in SplitIdentityNInputs()
|
| D | loop_optimizer.cc | 76 std::unique_ptr<NodeMap> node_map_;
384 node_map_.reset(new NodeMap(optimized_graph_)); in Optimize()
521 NodeMap node_map(optimized_graph); in RemoveStackOps()
596 const NodeDef& switch_node, const NodeMap& node_map, in CheckForDeadFanout()
724 NodeMap node_map(optimized_graph); in Optimize()
738 const NodeMap& node_map, const absl::flat_hash_set<string>& feed_nodes, in RemoveDeadBranches()
|
| D | arithmetic_optimizer_test.cc | 118 NodeMap node_map(&output); in TEST_F()
158 NodeMap node_map(&output); in TEST_F()
190 NodeMap node_map(&output); in TEST_F()
233 NodeMap node_map(&output); in TEST_F()
371 NodeMap node_map(&output); in TEST_F()
415 NodeMap node_map(&output); in TEST_F()
476 NodeMap node_map(&output); in TEST_F()
563 NodeMap node_map(&output); in TEST_F()
643 NodeMap node_map(&output); in TEST_F()
696 NodeMap node_map(&output); in TEST_F()
[all …]
|
| D | graph_optimizer_stage.h | 51 GraphProperties* graph_properties, NodeMap* node_map, in GraphOptimizerContext()
64 NodeMap* node_map;
|
| D | constant_folding.h | 43 NodeMap* node_map);
249 std::unique_ptr<NodeMap> node_map_;
|
| D | loop_optimizer.h | 63 const NodeMap& node_map,
|
| D | dependency_optimizer.h | 77 std::unique_ptr<NodeMap> node_map_;
|
| D | memory_optimizer.cc | 72 const NodeMap& node_map, const GraphDef* graph, in FindCandidateRecomputeNodes()
109 void connected_subgraph(const NodeMap& node_map, bool collect_inputs, in connected_subgraph()
152 const GraphDef* graph, const NodeMap& node_map, in GetOpGroupsToRecompute()
215 const std::unordered_set<NodeDef*>& target_nodes, const NodeMap& node_map, in GetMaxDownstreamComponents()
283 const std::unordered_set<NodeDef*>& target_nodes, const NodeMap& node_map, in AddRecomputeControlDependencyNodes()
377 const std::unordered_set<NodeDef*>& target_nodes, const NodeMap& node_map, in RecomputeSubgraph()
440 NodeMap node_map(graph); in RecomputationRewritingPass()
|
| D | arithmetic_optimizer.h | 132 std::unique_ptr<NodeMap> node_map_;
|
| /external/tensorflow/tensorflow/compiler/tf2xla/ |
| D | tf2xla.cc | 60 typedef std::unordered_map<string, Node*> NodeMap; typedef
66 Status AddArgNodes(Graph* graph, const NodeMap& node_map, in AddArgNodes()
122 Status AddRetvalNodes(Graph* graph, const NodeMap& node_map, in AddRetvalNodes()
158 NodeMap node_map; in RewriteAndPruneGraph()
|
| /external/swiftshader/third_party/llvm-7.0/llvm/lib/Analysis/ |
| D | LazyCallGraph.cpp | 194 : BPA(std::move(G.BPA)), NodeMap(std::move(G.NodeMap)), in LazyCallGraph()
203 NodeMap = std::move(G.NodeMap); in operator =()
1442 assert(G->NodeMap.find(&NewF) == G->NodeMap.end() && in replaceNodeFunction()
1459 G->NodeMap.erase(&OldF); in replaceNodeFunction()
1460 G->NodeMap[&NewF] = &N; in replaceNodeFunction()
1490 auto NI = NodeMap.find(&F); in removeDeadFunction()
1491 if (NI == NodeMap.end()) in removeDeadFunction()
1496 NodeMap.erase(NI); in removeDeadFunction()
1550 for (auto &FunctionNodePair : NodeMap) in updateGraphPtrs()
|
| /external/libchrome/mojo/core/ |
| D | node_controller.h | 136 using NodeMap = variable
261 NodeMap peers_;
320 NodeMap pending_invitations_;
|
| /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/swiftshader/third_party/llvm-7.0/llvm/lib/IR/ |
| D | ModuleSummaryIndex.cpp | 232 DenseMap<GlobalValue::GUID, std::vector<uint64_t>> NodeMap; in exportToDot() local
284 NodeMap[SummaryIt.first].push_back(ModId); in exportToDot()
331 auto &ModList = NodeMap[E.Dst]; in exportToDot()
|
| /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 __anon0674e6300111::LLVM2ICEFunctionConverter
|
| /external/swiftshader/third_party/llvm-7.0/llvm/lib/CodeGen/SelectionDAG/ |
| D | SelectionDAGBuilder.h | 97 DenseMap<const Value*, SDValue> NodeMap; variable
692 if (NodeMap.find(V) == NodeMap.end()) in getNodeForIRValue()
694 return NodeMap[V].getNode(); in getNodeForIRValue()
701 SDValue &N = NodeMap[V]; in setValue()
|
| /external/tensorflow/tensorflow/core/grappler/utils/ |
| D | colocation.cc | 78 NodeMap node_map(graph); in ReassignColocation()
|
| D | grappler_test.h | 74 bool IsNodesDirectlyConnected(const NodeMap& node_map, const string& src,
|