| /external/tensorflow/tensorflow/core/grappler/optimizers/ |
| D | layout_optimizer_test.cc | 240 NodeMap node_map(&output); in TEST_F()
275 NodeMap node_map(&output); in TEST_F()
296 NodeMap node_map(&output); in TEST_F()
309 NodeMap node_map(&output); in TEST_F()
322 NodeMap node_map(&output); in TEST_F()
335 NodeMap node_map(&output); in TEST_F()
348 NodeMap node_map(&output); in TEST_F()
361 NodeMap node_map(&output); in TEST_F()
374 NodeMap node_map(&output); in TEST_F()
390 NodeMap node_map(&output); in TEST_F()
[all …]
|
| D | scoped_allocator_optimizer.h | 33 class NodeMap; variable
76 NodeMap* node_map() { return node_map_.get(); } in node_map()
120 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 | 151 void RemoveNode(NodeDef* nd, GraphDef* graph, NodeMap* node_map) { in RemoveNode()
169 NodeDef* to_node, NodeMap* node_map) { in RemoveEdge()
217 NodeMap* node_map, const DataType& dtype, in MaybeRewriteInput()
260 NodeMap* node_map, const std::vector<NodeDef*>& ops, in GetInputs()
314 Status GetDataInputs(GraphDef* graph, NodeMap* node_map, NodeDef* op, in GetDataInputs()
425 NodeMap* node_map) { in ClearInternalControlInputs()
448 NodeMap* node_map, const std::vector<NodeDef*>& ops, in AnalyzeInputs()
484 GraphDef* graph, NodeMap* node_map, in TransitiveFanoutWithinFrame()
511 ScopedAllocatorOptimizer* sa_opti, GraphDef* graph, NodeMap* node_map, in ConstructScopedAllocatorNode()
597 Status BuildSAConcatNode(GraphDef* graph, NodeMap* node_map, in BuildSAConcatNode()
[all …]
|
| D | scoped_allocator_optimizer_test.cc | 321 void GetNode(NodeMap* node_map, const string& node_name, NodeDef** node_def) { in GetNode()
328 NodeDef* ValidateSAControlInput(GraphDef* graph, NodeMap* node_map, in ValidateSAControlInput()
347 int NumControlInputs(NodeMap* node_map, const string& node_name) { in NumControlInputs()
377 NodeMap node_map(&optimized_graph); in TEST_F()
494 NodeMap node_map(&optimized_graph); in TEST_F()
527 NodeMap node_map(&optimized_graph); in TEST_F()
589 NodeMap node_map(&optimized_graph); in TEST_F()
|
| D | common_subgraph_elimination_test.cc | 83 NodeMap node_map(&output); in TEST_F()
123 NodeMap node_map(&output); in TEST_F()
154 NodeMap node_map(&output); in TEST_F()
|
| D | model_pruner.cc | 203 const NodeMap& node_map, const std::vector<string>& terminal_nodes, in IdentityNTerminalPorts()
276 GraphDef* graph, NodeMap* node_map) { in NewIdentityFromIdentityN()
301 NodeMap* node_map) { in RewriteIdentityNAndInputsOutputs()
394 NodeMap node_map(graph); in SplitIdentityNInputs()
|
| 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 | loop_optimizer.h | 67 const NodeMap& node_map,
|
| D | graph_optimizer_stage.h | 51 GraphProperties* graph_properties, NodeMap* node_map, in GraphOptimizerContext()
64 NodeMap* node_map;
|
| D | dependency_optimizer.h | 80 std::unique_ptr<NodeMap> node_map_;
|
| /external/rust/crates/grpcio-sys/grpc/third_party/re2/re2/ |
| D | prefilter_tree.h | 63 typedef std::map<std::string, Prefilter*> NodeMap; typedef
93 void AssignUniqueIds(NodeMap* nodes, std::vector<std::string>* atom_vec);
101 Prefilter* CanonicalNode(NodeMap* nodes, Prefilter* node);
111 void PrintDebugInfo(NodeMap* nodes);
|
| D | prefilter_tree.cc | 71 NodeMap nodes; in Compile()
108 Prefilter* PrefilterTree::CanonicalNode(NodeMap* nodes, Prefilter* node) { in CanonicalNode()
110 NodeMap::iterator iter = nodes->find(node_string); in CanonicalNode()
168 void PrefilterTree::AssignUniqueIds(NodeMap* nodes, in AssignUniqueIds()
367 void PrefilterTree::PrintDebugInfo(NodeMap* nodes) { in PrintDebugInfo()
380 for (NodeMap::const_iterator iter = nodes->begin(); in PrintDebugInfo()
|
| /external/tensorflow/tensorflow/core/grappler/ |
| D | utils.h | 233 class NodeMap : public internal::NodeMapInternal<GraphDef, NodeDef> {
235 explicit NodeMap(GraphDef* graph) : NodeMapInternal(graph) {} in NodeMap() function
338 bool HasRegularOutputs(const NodeDef& node, const NodeMap& node_map);
341 bool HasControlOutputs(const NodeDef& node, const NodeMap& node_map);
350 int NumControlOutputs(const NodeDef& node, const NodeMap& node_map);
353 int NumNonControlOutputs(const NodeDef& node, const NodeMap& node_map);
357 int NumNonControlDataOutputs(const NodeDef& node, const NodeMap& node_map);
381 NodeDef* GetTailOfChain(const NodeDef& source, const NodeMap& node_map,
|
| D | utils.cc | 229 bool HasRegularOutputs(const NodeDef& node, const NodeMap& node_map) { in HasRegularOutputs()
243 bool HasControlOutputs(const NodeDef& node, const NodeMap& node_map) { in HasControlOutputs()
258 int NumControlOutputs(const NodeDef& node, const NodeMap& node_map) { in NumControlOutputs()
274 int NumNonControlOutputs(const NodeDef& node, const NodeMap& node_map) { in NumNonControlOutputs()
294 int NumNonControlDataOutputs(const NodeDef& node, const NodeMap& node_map) { in NumNonControlDataOutputs()
323 NodeDef* GetTailOfChain(const NodeDef& source, const NodeMap& node_map, in GetTailOfChain()
|
| /external/jackson-databind/src/test/java/com/fasterxml/jackson/databind/struct/ |
| D | TestParentChildReferences.java | 125 static class NodeMap class in TestParentChildReferences
136 public NodeMap parent;
303 NodeMap root = new NodeMap(); in testMapOfRefs()
312 NodeMap result = MAPPER.readValue(json, NodeMap.class); in testMapOfRefs()
|
| /external/llvm-project/clang/lib/Tooling/ |
| D | RefactoringCallbacks.cpp | 200 const auto &NodeMap = Result.Nodes.getMap(); in run() local
209 auto NodeIter = NodeMap.find(Element.Value); in run()
210 if (NodeIter == NodeMap.end()) { in run()
223 if (NodeMap.count(FromId) == 0) { in run()
229 tooling::Replacement(*Result.SourceManager, &NodeMap.at(FromId), ToText, in run()
|
| /external/tensorflow/tensorflow/core/grappler/utils/ |
| D | transitive_fanin_test.cc | 71 NodeMap node_map(&output_graph); in TEST_F()
90 NodeMap node_map(&output_graph); in TEST_F()
111 NodeMap node_map(&output_graph); in TEST_F()
|
| /external/tensorflow/tensorflow/compiler/tf2xla/ |
| D | graph_compiler_util.cc | 47 typedef std::unordered_map<string, Node*> NodeMap; typedef
54 Status AddArgNodes(Graph* graph, const NodeMap& node_map, in AddArgNodes()
114 Status AddRetvalNodes(Graph* graph, const NodeMap& node_map, in AddRetvalNodes()
151 NodeMap node_map; in RewriteAndPruneGraph()
|
| /external/llvm-project/llvm/lib/Analysis/ |
| D | LazyCallGraph.cpp | 210 : BPA(std::move(G.BPA)), NodeMap(std::move(G.NodeMap)), in LazyCallGraph()
228 NodeMap = std::move(G.NodeMap); in operator =()
1467 assert(G->NodeMap.find(&NewF) == G->NodeMap.end() && in replaceNodeFunction()
1484 G->NodeMap.erase(&OldF); in replaceNodeFunction()
1485 G->NodeMap[&NewF] = &N; in replaceNodeFunction()
1515 auto NI = NodeMap.find(&F); in removeDeadFunction()
1516 if (NI == NodeMap.end()) in removeDeadFunction()
1521 NodeMap.erase(NI); in removeDeadFunction()
1575 for (auto &FunctionNodePair : NodeMap) in updateGraphPtrs()
1583 NodeMap[&N.getFunction()] = &N; in initNode()
|
| /external/libchrome/mojo/core/ |
| D | node_controller.h | 136 using NodeMap = variable
261 NodeMap peers_;
320 NodeMap pending_invitations_;
|
| /external/llvm-project/llvm/lib/Target/X86/ |
| D | X86LoadValueInjectionLoadHardening.cpp | 341 DenseMap<MachineInstr *, GraphIter> NodeMap; in getGadgetGraph() local
343 auto MaybeAddNode = [&NodeMap, &Builder](MachineInstr *MI) { in getGadgetGraph()
344 auto Ref = NodeMap.find(MI); in getGadgetGraph()
345 if (Ref == NodeMap.end()) { in getGadgetGraph()
347 NodeMap[MI] = I; in getGadgetGraph()
513 auto Ref = NodeMap.find(&*NI); in getGadgetGraph()
514 if (Ref != NodeMap.end()) { in getGadgetGraph()
|
| /external/swiftshader/third_party/llvm-10.0/llvm/lib/Analysis/ |
| D | LazyCallGraph.cpp | 207 : BPA(std::move(G.BPA)), NodeMap(std::move(G.NodeMap)), in LazyCallGraph()
216 NodeMap = std::move(G.NodeMap); in operator =()
1455 assert(G->NodeMap.find(&NewF) == G->NodeMap.end() && in replaceNodeFunction()
1472 G->NodeMap.erase(&OldF); in replaceNodeFunction()
1473 G->NodeMap[&NewF] = &N; in replaceNodeFunction()
1503 auto NI = NodeMap.find(&F); in removeDeadFunction()
1504 if (NI == NodeMap.end()) in removeDeadFunction()
1509 NodeMap.erase(NI); in removeDeadFunction()
1563 for (auto &FunctionNodePair : NodeMap) in updateGraphPtrs()
|
| /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-10.0/llvm/lib/CodeGen/SelectionDAG/ |
| D | SelectionDAGBuilder.h | 100 DenseMap<const Value*, SDValue> NodeMap; variable
525 if (NodeMap.find(V) == NodeMap.end()) in getNodeForIRValue()
527 return NodeMap[V].getNode(); in getNodeForIRValue()
534 SDValue &N = NodeMap[V]; in setValue()
|