Home
last modified time | relevance | path

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

/freebsd-14.2/contrib/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()
/freebsd-14.2/contrib/llvm-project/llvm/lib/Target/X86/
H A DX86LoadValueInjectionLoadHardening.cpp340 DenseMap<MachineInstr *, GraphIter> NodeMap; in getGadgetGraph() local
342 auto MaybeAddNode = [&NodeMap, &Builder](MachineInstr *MI) { in getGadgetGraph()
343 auto Ref = NodeMap.find(MI); in getGadgetGraph()
344 if (Ref == NodeMap.end()) { in getGadgetGraph()
346 NodeMap[MI] = I; in getGadgetGraph()
512 auto Ref = NodeMap.find(&*NI); in getGadgetGraph()
513 if (Ref != NodeMap.end()) { in getGadgetGraph()
/freebsd-14.2/contrib/llvm-project/llvm/lib/Analysis/
H A DLazyCallGraph.cpp208 : 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()
/freebsd-14.2/contrib/llvm-project/clang/include/clang/ASTMatchers/
H A DASTMatchersInternal.h221 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;
/freebsd-14.2/contrib/llvm-project/llvm/lib/IR/
H A DModuleSummaryIndex.cpp552 DenseMap<GlobalValue::GUID, std::vector<uint64_t>> NodeMap; in exportToDot() local
624 NodeMap[SummaryIt.first].push_back(ModId); in exportToDot()
683 auto &ModList = NodeMap[E.Dst]; in exportToDot()
/freebsd-14.2/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DLazyCallGraph.h973 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
/freebsd-14.2/contrib/llvm-project/clang/lib/Tooling/Transformer/
H A DStencil.cpp335 const BoundNodes::IDToNodeMap &NodeMap = match.Nodes.getMap(); in eval() local
337 if (NodeMap.count(S.first) > 0) { in eval()
/freebsd-14.2/contrib/llvm-project/llvm/lib/Passes/
H A DStandardInstrumentations.cpp1743 std::map<const unsigned, unsigned> &NodeMap) const;
1973 std::map<const unsigned, unsigned> NodeMap; in createDisplayGraph() local
1981 NodeMap.insert({I.getIndex(), Index++}); in createDisplayGraph()
1986 for (auto &I : NodeMap) { in createDisplayGraph()
1989 getNode(SourceNode).createDisplayEdges(G, DisplayNode, NodeMap); in createDisplayGraph()
1996 std::map<const unsigned, unsigned> &NodeMap) const { in createDisplayEdges()
/freebsd-14.2/contrib/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.cpp1089 NodeMap.clear(); in clear()
1182 SDValue &N = NodeMap[Address]; in handleDebugDeclare()
1324 auto It = NodeMap.find(&I); in visit()
1325 if (It != NodeMap.end()) { in visit()
1591 SDValue N = NodeMap[V]; in handleDebugValue()
1722 SDValue &N = NodeMap[V]; in getValue()
1732 NodeMap[V] = Val; in getValue()
1741 SDValue &N = NodeMap[V]; in getNonRegisterValue()
1755 NodeMap[V] = Val; in getNonRegisterValue()
1791 SDValue N1 = NodeMap[V]; in getValueImpl()
[all …]
/freebsd-14.2/contrib/llvm-project/clang/include/clang/StaticAnalyzer/Core/PathSensitive/
H A DExplodedGraph.h422 using NodeMap = llvm::DenseMap<const ExplodedNode *, ExplodedNode *>; variable
/freebsd-14.2/contrib/llvm-project/llvm/lib/CodeGen/
H A DCodeGenPrepare.cpp3494 MapType NodeMap; member in __anon01de4a8e0c11::PhiNodeSet
3507 if (NodeMap.insert(std::make_pair(Ptr, NodeList.size())).second) { in insert()
3518 if (NodeMap.erase(Ptr)) { in erase()
3527 NodeMap.clear(); in clear()
3544 size_t size() const { return NodeMap.size(); } in size()
3547 size_t count(PHINode *Ptr) const { return NodeMap.count(Ptr); } in count()
3557 auto it = NodeMap.find(NodeList[CurrentIndex]); in SkipRemovedElements()
3560 if (it != NodeMap.end() && it->second == CurrentIndex) in SkipRemovedElements()
/freebsd-14.2/sys/contrib/dev/acpica/include/
H A Dactbl2.h1483 UINT64 NodeMap; member