| /netbsd-current/external/apache2/llvm/dist/clang/lib/Tooling/ |
| H A D | RefactoringCallbacks.cpp | 200 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,
|
| /netbsd-current/external/apache2/llvm/dist/llvm/lib/Analysis/ |
| H A D | LazyCallGraph.cpp | 211 : BPA(std::move(G.BPA)), NodeMap(std::move(G.NodeMap)),
229 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...] |
| /netbsd-current/external/apache2/llvm/dist/llvm/lib/Target/X86/ |
| H A D | X86LoadValueInjectionLoadHardening.cpp | 341 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()) {
|
| /netbsd-current/external/apache2/llvm/dist/llvm/lib/IR/ |
| H A D | ModuleSummaryIndex.cpp | 526 DenseMap<GlobalValue::GUID, std::vector<uint64_t>> NodeMap;
585 NodeMap[SummaryIt.first].push_back(ModId);
644 auto &ModList = NodeMap[E.Dst];
|
| /netbsd-current/external/apache2/llvm/dist/clang/include/clang/ASTMatchers/ |
| H A D | ASTMatchersInternal.h | 225 NodeMap[std::string(ID)] = DynNode;
234 IDToNodeMap::const_iterator It = NodeMap.find(ID);
235 if (It == NodeMap.end()) {
242 IDToNodeMap::const_iterator It = NodeMap.find(ID);
243 if (It == NodeMap.end()) {
251 return NodeMap < Other.NodeMap;
262 return NodeMap;
268 for (const auto &IDAndNode : NodeMap) {
276 IDToNodeMap NodeMap; member in class:clang::ast_matchers::internal::BoundNodesMap
[all...] |
| /netbsd-current/external/apache2/llvm/dist/llvm/include/llvm/Analysis/ |
| H A D | LazyCallGraph.h | 953 Node *lookup(const Function &F) const { return NodeMap.lookup(&F); }
975 Node *&N = NodeMap[&F];
1139 DenseMap<const Function *, Node *> NodeMap; member in class:llvm::LazyCallGraph::Edge
1171 /// the NodeMap.
1175 /// it to the NodeMap if necessary. For example, useful when a function is
|
| /netbsd-current/external/apache2/llvm/dist/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ |
| H A D | ExplodedGraph.h | 427 using NodeMap = llvm::DenseMap<const ExplodedNode *, ExplodedNode *>;
|
| /netbsd-current/external/apache2/llvm/dist/llvm/lib/CodeGen/SelectionDAG/ |
| H A D | SelectionDAGBuilder.h | 97 DenseMap<const Value*, SDValue> NodeMap; member in class:llvm::SelectionDAGBuilder
529 SDValue &N = NodeMap[V];
|
| H A D | SelectionDAGBuilder.cpp | 1027 NodeMap.clear();
1345 SDValue N = NodeMap[V];
1474 SDValue &N = NodeMap[V];
1484 NodeMap[V] = Val;
1493 SDValue &N = NodeMap[V];
1507 NodeMap[V] = Val;
1543 SDValue N1 = NodeMap[V];
1544 assert(N1.getNode() && "visit didn't populate the NodeMap!");
1576 return NodeMap[V] = DAG.getBuildVector(VT, getCurSDLoc(), Ops);
1618 return NodeMap[
[all...] |
| /netbsd-current/external/apache2/llvm/dist/llvm/lib/CodeGen/ |
| H A D | CodeGenPrepare.cpp | 3239 MapType NodeMap; member in class:__anon1748::PhiNodeSet
3252 if (NodeMap.insert(std::make_pair(Ptr, NodeList.size())).second) {
3263 if (NodeMap.erase(Ptr)) {
3272 NodeMap.clear();
3290 return NodeMap.size();
3295 return NodeMap.count(Ptr);
3306 auto it = NodeMap.find(NodeList[CurrentIndex]);
3307 // If the element has been deleted and added again later, NodeMap will
3309 if (it != NodeMap.end() && it->second == CurrentIndex)
|
| /netbsd-current/sys/external/bsd/acpica/dist/include/ |
| H A D | actbl2.h | 1381 UINT64 NodeMap; member in struct:acpi_madt_eio_pic
|
| /netbsd-current/sys/external/bsd/acpica/dist/common/ |
| H A D | dmtbinfo2.c | 860 {ACPI_DMT_UINT64, ACPI_MADT20_OFFSET (NodeMap), "NodeMap", 0},
|