Home
last modified time | relevance | path

Searched refs:NodeMap (Results 1 – 10 of 10) sorted by relevance

/external/chromium_org/native_client_sdk/src/tests/nacl_io_test/fake_ppapi/
Dfake_pepper_interface_html5_fs.cc170 NodeMap::iterator iter = node_map_.find(path); in AddFile()
186 std::pair<NodeMap::iterator, bool> result = in AddFile()
187 node_map_.insert(NodeMap::value_type(path, node)); in AddFile()
197 NodeMap::iterator iter = node_map_.find(path); in AddDirectory()
213 std::pair<NodeMap::iterator, bool> result = in AddDirectory()
214 node_map_.insert(NodeMap::value_type(path, node)); in AddDirectory()
227 NodeMap::iterator iter = node_map_.find(path); in GetNode()
238 NodeMap::const_iterator iter = node_map_.find(path); in GetDirectoryEntries()
246 for (NodeMap::const_iterator iter = node_map_.begin(); in GetDirectoryEntries()
Dfake_pepper_interface_html5_fs.h95 typedef std::map<Path, FakeHtml5FsNode> NodeMap; typedef
96 NodeMap node_map_;
/external/chromium_org/net/spdy/
Dspdy_priority_forest.h127 typedef base::hash_map<NodeId, Node> NodeMap; typedef
146 NodeMap all_nodes_; // maps from node IDs to Node objects
424 for (typename NodeMap::const_iterator iter = all_nodes_.begin(); in FirstMarkedNode()
489 typename NodeMap::const_iterator iter = all_nodes_.find(node_id); in FindNode()
498 for (typename NodeMap::const_iterator iter = all_nodes_.begin(); in ValidateInvariantsForTests()
Dspdy_priority_tree.h151 typedef base::hash_map<NodeId, Node> NodeMap; typedef
153 NodeMap all_nodes_; // maps from node IDs to Node objects
420 typename NodeMap::const_iterator iter = all_nodes_.find(node_id); in FindNode()
502 for (typename NodeMap::const_iterator iter = all_nodes_.begin(); in ValidateInvariantsForTests()
/external/llvm/include/llvm/Analysis/
DLazyCallGraph.h413 Node *lookup(const Function &F) const { return NodeMap.lookup(&F); } in lookup()
424 Node *&N = NodeMap[&F]; in get()
464 DenseMap<const Function *, Node *> NodeMap; variable
/external/clang/include/clang/ASTMatchers/
DASTMatchersInternal.h66 NodeMap[ID] = ast_type_traits::DynTypedNode::create(*Node); in addNode()
75 IDToNodeMap::const_iterator It = NodeMap.find(ID); in getNodeAs()
76 if (It == NodeMap.end()) { in getNodeAs()
83 IDToNodeMap::const_iterator It = NodeMap.find(ID); in getNode()
84 if (It == NodeMap.end()) { in getNode()
92 return NodeMap < Other.NodeMap;
103 return NodeMap; in getMap()
107 IDToNodeMap NodeMap;
/external/llvm/lib/Analysis/
DLazyCallGraph.cpp134 : BPA(std::move(G.BPA)), NodeMap(std::move(G.NodeMap)), in LazyCallGraph()
146 NodeMap = std::move(G.NodeMap); in operator =()
/external/llvm/lib/CodeGen/SelectionDAG/
DSelectionDAGBuilder.h87 DenseMap<const Value*, SDValue> NodeMap; variable
602 SDValue &N = NodeMap[V]; in setValue()
DSelectionDAGBuilder.cpp875 NodeMap.clear(); in clear()
1013 SDValue &N = NodeMap[V]; in getValue()
1031 NodeMap[V] = Val; in getValue()
1040 SDValue &N = NodeMap[V]; in getNonRegisterValue()
1045 NodeMap[V] = Val; in getNonRegisterValue()
1077 SDValue N1 = NodeMap[V]; in getValueImpl()
1111 return NodeMap[V] = DAG.getNode(ISD::BUILD_VECTOR, getCurSDLoc(), in getValueImpl()
1163 return NodeMap[V] = DAG.getNode(ISD::BUILD_VECTOR, getCurSDLoc(), VT, Ops); in getValueImpl()
4755 SDValue &N = NodeMap[Address]; in visitIntrinsicCall()
4837 SDValue N = NodeMap[V]; in visitIntrinsicCall()
/external/clang/include/clang/StaticAnalyzer/Core/PathSensitive/
DExplodedGraph.h363 typedef llvm::DenseMap<const ExplodedNode*, ExplodedNode*> NodeMap; typedef