Home
last modified time | relevance | path

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

/llvm-project/clang/lib/Tooling/
H A DRefactoringCallbacks.cpp200 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()
/llvm-project/llvm/lib/Analysis/
H A DLazyCallGraph.cpp210 : BPA(std::move(G.BPA)), NodeMap(std::move(G.NodeMap)), in LazyCallGraph()
234 NodeMap = std::move(G.NodeMap); in operator =()
1457 assert(G->NodeMap.find(&NewF) == G->NodeMap.end() && in replaceNodeFunction()
1474 G->NodeMap.erase(&OldF); in replaceNodeFunction()
1475 G->NodeMap[&NewF] = &N; in replaceNodeFunction()
1511 auto NI = NodeMap.find(&F); in markDeadFunction()
1512 assert(NI != NodeMap in markDeadFunction()
[all...]
/llvm-project/llvm/lib/Target/X86/
H A DX86LoadValueInjectionLoadHardening.cpp339 DenseMap<MachineInstr *, GraphIter> NodeMap; in getGadgetGraph()
341 auto MaybeAddNode = [&NodeMap, &Builder](MachineInstr *MI) { in getGadgetGraph()
342 auto Ref = NodeMap.find(MI); in getGadgetGraph()
343 if (Ref == NodeMap.end()) { in getGadgetGraph()
345 NodeMap[MI] = I; in getGadgetGraph()
510 auto Ref = NodeMap.find(&*NI); in getGadgetGraph()
511 if (Ref != NodeMap.end()) { in getGadgetGraph()
340 DenseMap<MachineInstr *, GraphIter> NodeMap; getGadgetGraph() local
/llvm-project/clang/include/clang/ASTMatchers/
H A DASTMatchersInternal.h220 NodeMap[std::string(ID)] = DynNode;
229 IDToNodeMap::const_iterator It = NodeMap.find(ID);
230 if (It == NodeMap.end()) {
237 IDToNodeMap::const_iterator It = NodeMap.find(ID);
238 if (It == NodeMap.end()) {
246 return NodeMap < Other.NodeMap;
257 return NodeMap;
263 for (const auto &IDAndNode : NodeMap) {
271 IDToNodeMap NodeMap;
[all...]
/llvm-project/llvm/lib/IR/
H A DModuleSummaryIndex.cpp563 DenseMap<GlobalValue::GUID, std::vector<uint64_t>> NodeMap; in exportToDot()
635 NodeMap[SummaryIt.first].push_back(ModId); in exportToDot()
698 auto &ModList = NodeMap[E.Dst]; in exportToDot()
552 DenseMap<GlobalValue::GUID, std::vector<uint64_t>> NodeMap; exportToDot() local
/llvm-project/llvm/include/llvm/Analysis/
H A DLazyCallGraph.h975 Node *lookup(const Function &F) const { return NodeMap.lookup(&F); } in postorder_ref_sccs()
997 Node *&N = NodeMap[&F];
1123 DenseMap<const Function *, Node *> NodeMap;
1155 /// the NodeMap.
1159 /// it to the NodeMap if necessary. For example, useful when a function is
1126 DenseMap<const Function *, Node *> NodeMap; global() variable
/llvm-project/clang/lib/Tooling/Transformer/
H A DStencil.cpp340 const BoundNodes::IDToNodeMap &NodeMap = match.Nodes.getMap(); in eval()
342 if (NodeMap.count(S.first) > 0) { in eval()
335 const BoundNodes::IDToNodeMap &NodeMap = match.Nodes.getMap(); eval() local
/llvm-project/llvm/lib/Passes/
H A DStandardInstrumentations.cpp1845 std::map<const unsigned, unsigned> &NodeMap) const;
2075 std::map<const unsigned, unsigned> NodeMap; in createDisplayGraph()
2083 NodeMap.insert({I.getIndex(), Index++}); in createDisplayEdges()
2088 for (auto &I : NodeMap) { in createDisplayEdges()
2091 getNode(SourceNode).createDisplayEdges(G, DisplayNode, NodeMap); in createDisplayEdges()
2098 std::map<const unsigned, unsigned> &NodeMap) const { in finalize()
2056 std::map<const unsigned, unsigned> NodeMap; createDisplayGraph() local
/llvm-project/llvm/lib/CodeGen/SelectionDAG/
H A DSelectionDAGBuilder.h101 DenseMap<const Value*, SDValue> NodeMap; variable
377 SDValue &N = NodeMap[V]; in setValue()
H A DSelectionDAGBuilder.cpp1100 NodeMap.clear();
1193 SDValue &N = NodeMap[Address]; in handleDebugDeclare()
1349 auto It = NodeMap.find(&I); in visit()
1350 if (It != NodeMap.end()) { in visit()
1619 SDValue N = NodeMap[V]; in handleDebugValue()
1750 SDValue &N = NodeMap[V]; in getValue()
1760 NodeMap[V] = Val; in getValue()
1769 SDValue &N = NodeMap[V];
1783 NodeMap[V] = Val; in getNonRegisterValue()
1826 SDValue N1 = NodeMap[ in getValueImpl()
[all...]
/llvm-project/clang/include/clang/StaticAnalyzer/Core/PathSensitive/
H A DExplodedGraph.h422 using NodeMap = llvm::DenseMap<const ExplodedNode *, ExplodedNode *>; variable
/llvm-project/llvm/lib/CodeGen/
H A DCodeGenPrepare.cpp3875 MapType NodeMap; in combineAddrModes()
3888 if (NodeMap.insert(std::make_pair(Ptr, NodeList.size())).second) { in combineAddrModes()
3899 if (NodeMap.erase(Ptr)) {
3908 NodeMap.clear();
3925 size_t size() const { return NodeMap.size(); } in initializeMap()
3928 size_t count(PHINode *Ptr) const { return NodeMap.count(Ptr); } in initializeMap()
3938 auto it = NodeMap.find(NodeList[CurrentIndex]);
3939 // If the element has been deleted and added again later, NodeMap will
3941 if (it != NodeMap.end() && it->second == CurrentIndex)
3588 MapType NodeMap; global() member in __anon072927cb0d11::PhiNodeSet