Home
last modified time | relevance | path

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

/freebsd-12.1/contrib/llvm/tools/clang/lib/Tooling/
H A DRefactoringCallbacks.cpp201 const auto &NodeMap = Result.Nodes.getMap(); in run() local
210 auto NodeIter = NodeMap.find(Element.Value); in run()
211 if (NodeIter == NodeMap.end()) { in run()
224 if (NodeMap.count(FromId) == 0) { in run()
230 tooling::Replacement(*Result.SourceManager, &NodeMap.at(FromId), ToText, in run()
/freebsd-12.1/contrib/llvm/lib/Analysis/
H A DLazyCallGraph.cpp194 : 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()
/freebsd-12.1/contrib/llvm/tools/clang/include/clang/ASTMatchers/
H A DASTMatchersInternal.h153 NodeMap[ID] = DynNode; in addNode()
162 IDToNodeMap::const_iterator It = NodeMap.find(ID); in getNodeAs()
163 if (It == NodeMap.end()) { in getNodeAs()
170 IDToNodeMap::const_iterator It = NodeMap.find(ID); in getNode()
171 if (It == NodeMap.end()) { in getNode()
179 return NodeMap < Other.NodeMap;
190 return NodeMap; in getMap()
196 for (const auto &IDAndNode : NodeMap) { in isComparable()
204 IDToNodeMap NodeMap;
/freebsd-12.1/contrib/llvm/lib/IR/
H A DModuleSummaryIndex.cpp344 DenseMap<GlobalValue::GUID, std::vector<uint64_t>> NodeMap; in exportToDot() local
400 NodeMap[SummaryIt.first].push_back(ModId); in exportToDot()
456 auto &ModList = NodeMap[E.Dst]; in exportToDot()
/freebsd-12.1/contrib/llvm/lib/CodeGen/SelectionDAG/
H A DSelectionDAGBuilder.h97 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()
H A DSelectionDAGBuilder.cpp1009 NodeMap.clear(); in clear()
1221 SDValue &N = NodeMap[V]; in getValue()
1231 NodeMap[V] = Val; in getValue()
1238 return (NodeMap.find(V) != NodeMap.end()) || in findValue()
1246 SDValue &N = NodeMap[V]; in getNonRegisterValue()
1260 NodeMap[V] = Val; in getNonRegisterValue()
1293 SDValue N1 = NodeMap[V]; in getValueImpl()
1327 return NodeMap[V] = DAG.getBuildVector(VT, getCurSDLoc(), Ops); in getValueImpl()
1379 return NodeMap[V] = DAG.getBuildVector(VT, getCurSDLoc(), Ops); in getValueImpl()
5270 SDValue &N = NodeMap[Address]; in visitIntrinsicCall()
[all …]
/freebsd-12.1/contrib/llvm/include/llvm/Analysis/
H A DLazyCallGraph.h963 Node *lookup(const Function &F) const { return NodeMap.lookup(&F); } in lookup()
985 Node *&N = NodeMap[&F]; in get()
1111 DenseMap<const Function *, Node *> NodeMap; variable
/freebsd-12.1/contrib/llvm/tools/clang/include/clang/StaticAnalyzer/Core/PathSensitive/
H A DExplodedGraph.h386 using NodeMap = llvm::DenseMap<const ExplodedNode *, ExplodedNode *>; variable
/freebsd-12.1/contrib/llvm/lib/CodeGen/
H A DCodeGenPrepare.cpp2715 MapType NodeMap; member in __anon6227213d0811::PhiNodeSet
2728 if (NodeMap.insert(std::make_pair(Ptr, NodeList.size())).second) { in insert()
2739 auto it = NodeMap.find(Ptr); in erase()
2740 if (it != NodeMap.end()) { in erase()
2741 NodeMap.erase(Ptr); in erase()
2750 NodeMap.clear(); in clear()
2768 return NodeMap.size(); in size()
2773 return NodeMap.count(Ptr); in count()
2784 auto it = NodeMap.find(NodeList[CurrentIndex]); in SkipRemovedElements()
2787 if (it != NodeMap.end() && it->second == CurrentIndex) in SkipRemovedElements()