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

/freebsd-13-stable/contrib/llvm-project/clang/lib/Tooling/
H A DRefactoringCallbacks.cpp200 const auto &NodeMap = Result.Nodes.getMap(); local
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,
/freebsd-13-stable/contrib/llvm-project/llvm/lib/CodeGen/SelectionDAG/
H A DSelectionDAGBuilder.h97 DenseMap<const Value*, SDValue> NodeMap; member in class:llvm::SelectionDAGBuilder
523 if (NodeMap.find(V) == NodeMap.end())
525 return NodeMap[V].getNode();
532 SDValue &N = NodeMap[V];
H A DSelectionDAGBuilder.cpp1027 NodeMap.clear();
1325 SDValue N = NodeMap[V];
1422 SDValue &N = NodeMap[V];
1432 NodeMap[V] = Val;
1441 SDValue &N = NodeMap[V];
1455 NodeMap[V] = Val;
1491 SDValue N1 = NodeMap[V];
1492 assert(N1.getNode() && "visit didn't populate the NodeMap!");
1525 return NodeMap[V] = DAG.getBuildVector(VT, getCurSDLoc(), Ops);
1564 return NodeMap[
[all...]
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Analysis/
H A DLazyCallGraph.cpp210 : BPA(std::move(G.BPA)), NodeMap(std::move(G.NodeMap)),
228 NodeMap = std::move(G.NodeMap);
1467 assert(G->NodeMap.find(&NewF) == G->NodeMap.end() &&
1484 G->NodeMap.erase(&OldF);
1485 G->NodeMap[&NewF] = &N;
1515 auto NI = NodeMap.find(&F);
1516 if (NI == NodeMap
[all...]
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Target/X86/
H A DX86LoadValueInjectionLoadHardening.cpp341 DenseMap<MachineInstr *, GraphIter> NodeMap;
343 auto MaybeAddNode = [&NodeMap, &Builder](MachineInstr *MI) {
344 auto Ref = NodeMap.find(MI);
345 if (Ref == NodeMap.end()) {
347 NodeMap[MI] = I;
513 auto Ref = NodeMap.find(&*NI);
514 if (Ref != NodeMap.end()) {
/freebsd-13-stable/contrib/llvm-project/clang/include/clang/ASTMatchers/
H A DASTMatchersInternal.h165 NodeMap[std::string(ID)] = DynNode;
174 IDToNodeMap::const_iterator It = NodeMap.find(ID);
175 if (It == NodeMap.end()) {
182 IDToNodeMap::const_iterator It = NodeMap.find(ID);
183 if (It == NodeMap.end()) {
191 return NodeMap < Other.NodeMap;
202 return NodeMap;
208 for (const auto &IDAndNode : NodeMap) {
216 IDToNodeMap NodeMap; member in class:clang::ast_matchers::internal::BoundNodesMap
[all...]
/freebsd-13-stable/contrib/llvm-project/llvm/lib/IR/
H A DModuleSummaryIndex.cpp471 DenseMap<GlobalValue::GUID, std::vector<uint64_t>> NodeMap;
530 NodeMap[SummaryIt.first].push_back(ModId);
587 auto &ModList = NodeMap[E.Dst];
/freebsd-13-stable/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DLazyCallGraph.h967 Node *lookup(const Function &F) const { return NodeMap.lookup(&F); }
989 Node *&N = NodeMap[&F];
1136 DenseMap<const Function *, Node *> NodeMap; member in class:llvm::LazyCallGraph::Edge
1168 /// the NodeMap.
1174 /// Helper to insert a new function, add it to the NodeMap, and populate its
/freebsd-13-stable/contrib/llvm-project/clang/include/clang/StaticAnalyzer/Core/PathSensitive/
H A DExplodedGraph.h427 using NodeMap = llvm::DenseMap<const ExplodedNode *, ExplodedNode *>;
/freebsd-13-stable/contrib/llvm-project/llvm/lib/CodeGen/
H A DCodeGenPrepare.cpp3088 MapType NodeMap; member in class:__anon3449::PhiNodeSet
3101 if (NodeMap.insert(std::make_pair(Ptr, NodeList.size())).second) {
3112 auto it = NodeMap.find(Ptr);
3113 if (it != NodeMap.end()) {
3114 NodeMap.erase(Ptr);
3123 NodeMap.clear();
3141 return NodeMap.size();
3146 return NodeMap.count(Ptr);
3157 auto it = NodeMap.find(NodeList[CurrentIndex]);
3158 // If the element has been deleted and added again later, NodeMap wil
[all...]

Completed in 263 milliseconds