| /openbsd-src/gnu/llvm/clang/lib/Tooling/ |
| H A D | RefactoringCallbacks.cpp | 200 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()
|
| /openbsd-src/gnu/llvm/llvm/lib/Target/X86/ |
| H A D | X86LoadValueInjectionLoadHardening.cpp | 341 DenseMap<MachineInstr *, GraphIter> NodeMap; in getGadgetGraph() local
343 auto MaybeAddNode = [&NodeMap, &Builder](MachineInstr *MI) { in getGadgetGraph()
344 auto Ref = NodeMap.find(MI); in getGadgetGraph()
345 if (Ref == NodeMap.end()) { in getGadgetGraph()
347 NodeMap[MI] = I; in getGadgetGraph()
513 auto Ref = NodeMap.find(&*NI); in getGadgetGraph()
514 if (Ref != NodeMap.end()) { in getGadgetGraph()
|
| /openbsd-src/gnu/llvm/llvm/lib/Analysis/ |
| H A D | LazyCallGraph.cpp | 208 : BPA(std::move(G.BPA)), NodeMap(std::move(G.NodeMap)), in LazyCallGraph()
224 NodeMap = std::move(G.NodeMap); in operator =()
1451 assert(G->NodeMap.find(&NewF) == G->NodeMap.end() && in replaceNodeFunction()
1468 G->NodeMap.erase(&OldF); in replaceNodeFunction()
1469 G->NodeMap[&NewF] = &N; in replaceNodeFunction()
1505 auto NI = NodeMap.find(&F); in removeDeadFunction()
1506 if (NI == NodeMap.end()) in removeDeadFunction()
1541 NodeMap.erase(NI); in removeDeadFunction()
1779 for (auto &FunctionNodePair : NodeMap) in updateGraphPtrs()
1790 NodeMap[&F] = &N; in initNode()
|
| /openbsd-src/gnu/llvm/llvm/lib/IR/ |
| H A D | ModuleSummaryIndex.cpp | 540 DenseMap<GlobalValue::GUID, std::vector<uint64_t>> NodeMap; in exportToDot() local
598 NodeMap[SummaryIt.first].push_back(ModId); in exportToDot()
657 auto &ModList = NodeMap[E.Dst]; in exportToDot()
|
| /openbsd-src/gnu/llvm/clang/include/clang/ASTMatchers/ |
| H A D | ASTMatchersInternal.h | 221 NodeMap[std::string(ID)] = DynNode;
230 IDToNodeMap::const_iterator It = NodeMap.find(ID);
231 if (It == NodeMap.end()) {
238 IDToNodeMap::const_iterator It = NodeMap.find(ID);
239 if (It == NodeMap.end()) {
247 return NodeMap < Other.NodeMap;
258 return NodeMap;
264 for (const auto &IDAndNode : NodeMap) {
272 IDToNodeMap NodeMap;
|
| /openbsd-src/gnu/llvm/llvm/include/llvm/Analysis/ |
| H A D | LazyCallGraph.h | 973 Node *lookup(const Function &F) const { return NodeMap.lookup(&F); } in lookup()
995 Node *&N = NodeMap[&F]; in get()
1121 DenseMap<const Function *, Node *> NodeMap; variable
|
| /openbsd-src/gnu/llvm/clang/lib/Tooling/Transformer/ |
| H A D | Stencil.cpp | 334 const BoundNodes::IDToNodeMap &NodeMap = match.Nodes.getMap(); in eval() local
336 if (NodeMap.count(S.first) > 0) { in eval()
|
| /openbsd-src/gnu/llvm/llvm/lib/Passes/ |
| H A D | StandardInstrumentations.cpp | 1489 std::map<const unsigned, unsigned> &NodeMap) const;
1719 std::map<const unsigned, unsigned> NodeMap; in createDisplayGraph() local
1727 NodeMap.insert({I.getIndex(), Index++}); in createDisplayGraph()
1732 for (auto &I : NodeMap) { in createDisplayGraph()
1735 getNode(SourceNode).createDisplayEdges(G, DisplayNode, NodeMap); in createDisplayGraph()
1742 std::map<const unsigned, unsigned> &NodeMap) const { in createDisplayEdges()
|
| /openbsd-src/gnu/llvm/llvm/lib/CodeGen/SelectionDAG/ |
| H A D | SelectionDAGBuilder.h | 101 DenseMap<const Value*, SDValue> NodeMap; variable
384 SDValue &N = NodeMap[V]; in setValue()
|
| H A D | SelectionDAGBuilder.cpp | 1056 NodeMap.clear(); in clear()
1176 auto It = NodeMap.find(&I); in visit()
1177 if (It != NodeMap.end()) { in visit()
1420 SDValue N = NodeMap[V]; in handleDebugValue()
1551 SDValue &N = NodeMap[V]; in getValue()
1561 NodeMap[V] = Val; in getValue()
1570 SDValue &N = NodeMap[V]; in getNonRegisterValue()
1584 NodeMap[V] = Val; in getNonRegisterValue()
1620 SDValue N1 = NodeMap[V]; in getValueImpl()
1653 return NodeMap[V] = DAG.getBuildVector(VT, getCurSDLoc(), Ops); in getValueImpl()
[all …]
|
| /openbsd-src/gnu/llvm/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ |
| H A D | ExplodedGraph.h | 425 using NodeMap = llvm::DenseMap<const ExplodedNode *, ExplodedNode *>; variable
|
| /openbsd-src/gnu/llvm/llvm/lib/CodeGen/ |
| H A D | CodeGenPrepare.cpp | 3365 MapType NodeMap; member in __anon88ab83af0c11::PhiNodeSet
3378 if (NodeMap.insert(std::make_pair(Ptr, NodeList.size())).second) { in insert()
3389 if (NodeMap.erase(Ptr)) { in erase()
3398 NodeMap.clear(); in clear()
3415 size_t size() const { return NodeMap.size(); } in size()
3418 size_t count(PHINode *Ptr) const { return NodeMap.count(Ptr); } in count()
3428 auto it = NodeMap.find(NodeList[CurrentIndex]); in SkipRemovedElements()
3431 if (it != NodeMap.end() && it->second == CurrentIndex) in SkipRemovedElements()
|