HomeSort by: relevance | last modified time | path
    Searched defs:NodeMap (Results 1 - 6 of 6) sorted by relevancy

  /src/external/apache2/llvm/dist/clang/lib/Tooling/
RefactoringCallbacks.cpp 200 const auto &NodeMap = Result.Nodes.getMap();
209 auto NodeIter = NodeMap.find(Element.Value);
210 if (NodeIter == NodeMap.end()) {
223 if (NodeMap.count(FromId) == 0) {
229 tooling::Replacement(*Result.SourceManager, &NodeMap.at(FromId), ToText,
  /src/external/apache2/llvm/dist/llvm/include/llvm/Analysis/
LazyCallGraph.h 953 Node *lookup(const Function &F) const { return NodeMap.lookup(&F); }
975 Node *&N = NodeMap[&F];
1139 DenseMap<const Function *, Node *> NodeMap;
1171 /// the NodeMap.
1175 /// it to the NodeMap if necessary. For example, useful when a function is
  /src/external/apache2/llvm/dist/llvm/lib/CodeGen/SelectionDAG/
SelectionDAGBuilder.h 97 DenseMap<const Value*, SDValue> NodeMap;
529 SDValue &N = NodeMap[V];
  /src/external/apache2/llvm/dist/clang/include/clang/ASTMatchers/
ASTMatchersInternal.h 225 NodeMap[std::string(ID)] = DynNode;
234 IDToNodeMap::const_iterator It = NodeMap.find(ID);
235 if (It == NodeMap.end()) {
242 IDToNodeMap::const_iterator It = NodeMap.find(ID);
243 if (It == NodeMap.end()) {
251 return NodeMap < Other.NodeMap;
262 return NodeMap;
268 for (const auto &IDAndNode : NodeMap) {
276 IDToNodeMap NodeMap;
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/CodeGen/
CodeGenPrepare.cpp 3239 MapType NodeMap;
3252 if (NodeMap.insert(std::make_pair(Ptr, NodeList.size())).second) {
3263 if (NodeMap.erase(Ptr)) {
3272 NodeMap.clear();
3290 return NodeMap.size();
3295 return NodeMap.count(Ptr);
3306 auto it = NodeMap.find(NodeList[CurrentIndex]);
3307 // If the element has been deleted and added again later, NodeMap will
3309 if (it != NodeMap.end() && it->second == CurrentIndex)
  /src/sys/external/bsd/acpica/dist/include/
actbl2.h 1874 UINT64 NodeMap;

Completed in 79 milliseconds