Home
last modified time | relevance | path

Searched refs:Map (Results 1 – 25 of 387) sorted by relevance

12345678910>>...16

/freebsd/contrib/llvm-project/llvm/lib/Target/DirectX/DirectXIRPasses/
H A DPointerTypeAnalysis.cpp26 Type *classifyPointerType(const Value *V, PointerTypeMap &Map) { in classifyPointerType() argument
29 auto It = Map.find(V); in classifyPointerType()
30 if (It != Map.end()) in classifyPointerType()
60 PointeeTy = classifyPointerType(User, Map); in classifyPointerType()
75 Map[V] = TypedPtrTy; in classifyPointerType()
82 Type *classifyFunctionType(const Function &F, PointerTypeMap &Map) { in classifyFunctionType() argument
83 auto It = Map.find(&F); in classifyFunctionType()
84 if (It != Map.end()) in classifyFunctionType()
97 Type *NewRetTy = classifyPointerType(RetInst->getReturnValue(), Map); in classifyFunctionType()
112 ArgTy = classifyPointerType(&A, Map); in classifyFunctionType()
[all …]
/freebsd/contrib/llvm-project/llvm/utils/TableGen/Common/
H A DInfoByHwMode.h94 InfoByHwMode(const MapType &M) : Map(M) {} in InfoByHwMode()
97 iterator begin() { return Map.begin(); } in begin()
99 iterator end() { return Map.end(); } in end()
101 const_iterator begin() const { return Map.begin(); } in begin()
103 const_iterator end() const { return Map.end(); } in end()
105 bool empty() const { return Map.empty(); } in empty()
108 bool hasMode(unsigned M) const { return Map.find(M) != Map.end(); } in hasMode()
111 return !Map.empty() && Map.begin()->first == DefaultMode; in hasDefault()
115 auto F = Map.find(Mode); in get()
116 if (F != Map.end()) in get()
[all …]
H A DInfoByHwMode.cpp35 auto I = Map.try_emplace(P.first, MVT(llvm::getValueType(P.second))); in ValueTypeByHwMode()
57 return Map == T.Map; in operator ==()
63 return Map < T.Map; in operator <()
67 auto F = Map.find(Mode); in getOrCreateTypeForMode()
68 if (F != Map.end()) in getOrCreateTypeForMode()
72 auto D = Map.begin(); in getOrCreateTypeForMode()
73 if (D != Map.end() && D->first == DefaultMode) in getOrCreateTypeForMode()
74 return Map.try_emplace(Mode, D->second).first->second; in getOrCreateTypeForMode()
76 return Map.try_emplace(Mode, Type).first->second; in getOrCreateTypeForMode()
92 for (const auto &P : Map) in writeToStream()
[all …]
/freebsd/contrib/llvm-project/llvm/include/llvm/IR/
H A DValueMap.h94 MapT Map; variable
105 : Map(NumInitBuckets), Data() {} in Map() function
107 : Map(NumInitBuckets), Data(Data) {} in Map() function
138 inline iterator begin() { return iterator(Map.begin()); } in begin()
139 inline iterator end() { return iterator(Map.end()); } in end()
140 inline const_iterator begin() const { return const_iterator(Map.begin()); } in begin()
141 inline const_iterator end() const { return const_iterator(Map.end()); } in end()
143 bool empty() const { return Map.empty(); } in empty()
144 size_type size() const { return Map.size(); } in size()
147 void reserve(size_t Size) { Map.reserve(Size); } in reserve()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Transforms/ObjCARC/
H A DBlotMapVector.h25 MapTy Map; variable
34 assert(Vector.size() >= Map.size()); // May differ due to blotting. in ~BlotMapVector()
35 for (typename MapTy::const_iterator I = Map.begin(), E = Map.end(); I != E; in ~BlotMapVector()
42 assert(!I->first || (Map.count(I->first) && in ~BlotMapVector()
43 Map[I->first] == size_t(I - Vector.begin()))); in ~BlotMapVector()
56 std::pair<typename MapTy::iterator, bool> Pair = Map.try_emplace(Arg);
68 Map.insert(std::make_pair(InsertPair.first, size_t(0))); in insert()
79 typename MapTy::iterator It = Map.find(Key); in find()
80 if (It == Map.end()) in find()
86 typename MapTy::const_iterator It = Map.find(Key); in find()
[all …]
/freebsd/contrib/llvm-project/clang/include/clang/StaticAnalyzer/Core/PathSensitive/
H A DFunctionSummary.h57 MapTy Map; variable
61 MapTy::iterator I = Map.find(D); in findOrInsertSummary()
62 if (I != Map.end()) in findOrInsertSummary()
67 I = Map.insert(KVPair(D, FunctionSummary())).first; in findOrInsertSummary()
68 assert(I != Map.end()); in findOrInsertSummary()
85 MapTy::const_iterator I = Map.find(D); in mayInline()
86 if (I != Map.end() && I->second.InlineChecked) in mayInline()
103 MapTy::const_iterator I = Map.find(D); in getNumVisitedBasicBlocks()
104 if (I != Map.end()) in getNumVisitedBasicBlocks()
110 MapTy::const_iterator I = Map.find(D); in getNumTimesInlined()
[all …]
/freebsd/contrib/llvm-project/llvm/include/llvm/ADT/
H A DMapVector.h37 MapType Map; variable
56 Map.clear(); in takeVector()
68 Map.reserve(NumEntries); in reserve()
92 Map.clear(); in clear()
97 std::swap(Map, RHS.Map); in swap()
102 std::pair<typename MapType::iterator, bool> Result = Map.try_emplace(Key);
115 typename MapType::const_iterator Pos = Map.find(Key); in lookup()
116 return Pos == Map.end()? ValueT() : Vector[Pos->second].second; in lookup()
121 auto [It, Inserted] = Map.try_emplace(Key); in try_emplace()
132 auto [It, Inserted] = Map.try_emplace(Key); in try_emplace()
[all …]
H A DUniqueVector.h32 std::map<T, unsigned> Map;
42 unsigned &Val = Map[Entry]; in insert()
59 typename std::map<T, unsigned>::const_iterator MI = Map.find(Entry); in idFor()
62 if (MI != Map.end()) return MI->second; in idFor()
94 Map.clear(); in reset()
/freebsd/contrib/llvm-project/llvm/include/llvm/CodeGen/
H A DRDFRegisters.h54 IndexedSet() { Map.reserve(N); } in IndexedSet()
58 assert(Idx != 0 && !Map.empty() && Idx - 1 < Map.size()); in get()
59 return Map[Idx - 1]; in get()
64 auto F = llvm::find(Map, Val); in insert()
65 if (F != Map.end()) in insert()
66 return F - Map.begin() + 1; in insert()
67 Map.push_back(Val); in insert()
68 return Map.size(); // Return actual_index + 1. in insert()
72 auto F = llvm::find(Map, Val); in find()
73 assert(F != Map.end()); in find()
[all …]
/freebsd/contrib/llvm-project/clang/include/clang/AST/
H A DDeclLookups.h79 if (StoredDeclsMap *Map = Primary->buildLookup()) in lookups() local
80 return lookups_range(all_lookups_iterator(Map->begin(), Map->end()), in lookups()
81 all_lookups_iterator(Map->end(), Map->end())); in lookups()
93 if (StoredDeclsMap *Map = Primary->getLookupPtr()) in noload_lookups() local
94 return lookups_range(all_lookups_iterator(Map->begin(), Map->end()), in noload_lookups()
95 all_lookups_iterator(Map->end(), Map->end())); in noload_lookups()
/freebsd/contrib/llvm-project/compiler-rt/lib/scudo/standalone/
H A Dbytemap.h20 void init() { DCHECK(Size == 0 || Map[0] == 0); } in init()
22 void unmapTestOnly() { memset(Map, 0, Size); } in unmapTestOnly()
26 DCHECK_EQ(0U, Map[Index]); in set()
27 Map[Index] = Value; in set()
31 return Map[Index];
38 u8 Map[Size] = {};
/freebsd/contrib/llvm-project/compiler-rt/lib/orc/
H A Dinterval_set.h62 bool empty() const { return Map.empty(); } in empty()
64 void clear() { Map.clear(); } in clear()
66 const_iterator begin() const { return const_iterator(Map.begin()); } in begin()
67 const_iterator end() const { return const_iterator(Map.end()); } in end()
70 return const_iterator(Map.find(K)); in find()
74 Map.insert(std::move(KS), std::move(KE), std::monostate()); in insert()
78 Map.erase(KS, KE); in erase()
82 ImplMap Map;
/freebsd/contrib/llvm-project/compiler-rt/lib/fuzzer/
H A DFuzzerValueBitMap.h28 void Reset() { memset(Map, 0, sizeof(Map)); } in Reset()
37 uintptr_t Old = Map[WordIdx]; in AddValue()
39 Map[WordIdx] = New; in AddValue()
52 return Map[WordIdx] & (1ULL << BitIdx); in Get()
61 if (uintptr_t M = Map[i]) in ForEach()
68 ATTRIBUTE_ALIGNED(512) uintptr_t Map[kMapSizeInWords];
/freebsd/contrib/llvm-project/llvm/include/llvm/DebugInfo/PDB/Native/
H A DHashTable.h44 HashTableIterator(const HashTable<ValueT> &Map, uint32_t Index, in HashTableIterator() argument
46 : Map(&Map), Index(Index), IsEnd(IsEnd) {} in HashTableIterator()
49 HashTableIterator(const HashTable<ValueT> &Map) : Map(&Map) { in HashTableIterator() argument
50 int I = Map.Present.find_first(); in HashTableIterator()
62 Map = R.Map;
71 return (Map == R.Map) && (Index == R.Index);
74 assert(Map->Present.test(Index));
75 return Map->Buckets[Index];
82 while (Index < Map->Buckets.size()) {
84 if (Map->Present.test(Index))
[all …]
/freebsd/contrib/llvm-project/clang/include/clang/Lex/
H A DDirectoryLookup.h45 const HeaderMap *Map; member
48 DLU(const HeaderMap *Map) : Map(Map) {} in DLU() argument
75 DirectoryLookup(const HeaderMap *Map, SrcMgr::CharacteristicKind DT) in DirectoryLookup() argument
76 : u(Map), DirCharacteristic(DT), LookupType(LT_HeaderMap), in DirectoryLookup()
110 return isHeaderMap() ? u.Map : nullptr; in getHeaderMap()
/freebsd/contrib/llvm-project/llvm/include/llvm/ProfileData/
H A DMemProfRadixTree.h39 MapTy &Map; member
42 FrameIdConverter(MapTy &Map) : Map(Map) {} in FrameIdConverter()
51 auto Iter = Map.find(Id); in operator()
52 if (Iter == Map.end()) { in operator()
63 MapTy &Map; member
67 CallStackIdConverter(MapTy &Map, in CallStackIdConverter()
69 : Map(Map), FrameIdToFrame(FrameIdToFrame) {} in CallStackIdConverter()
79 auto CSIter = Map.find(CSId); in operator()
80 if (CSIter == Map.end()) { in operator()
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Instrumentation/
H A DNumericalStabilitySanitizer.cpp428 [[maybe_unused]] const bool Inserted = Map.try_emplace(&V, &Shadow).second; in setShadow()
442 bool hasShadow(Value *V) const { return isa<Constant>(V) || Map.contains(V); } in hasShadow()
449 return Map.find(V)->second; in getShadow()
452 bool empty() const { return Map.empty(); } in empty()
487 DenseMap<Value *, Value *> Map; member in __anon1c7024df0111::ValueToShadowMap
558 ValueToShadowMap &Map);
561 const ValueToShadowMap &Map);
564 ValueToShadowMap &Map);
567 const ValueToShadowMap &Map);
570 const ValueToShadowMap &Map);
[all …]
/freebsd/contrib/llvm-project/clang/lib/AST/
H A DDeclBase.cpp1638 StoredDeclsMap *Map; in SetNoExternalVisibleDeclsForName() local
1639 if (!(Map = DC->LookupPtr)) in SetNoExternalVisibleDeclsForName()
1640 Map = DC->CreateStoredDeclsMap(Context); in SetNoExternalVisibleDeclsForName()
1644 (*Map)[Name].removeExternalDecls(); in SetNoExternalVisibleDeclsForName()
1654 StoredDeclsMap *Map; in SetExternalVisibleDeclsForName() local
1655 if (!(Map = DC->LookupPtr)) in SetExternalVisibleDeclsForName()
1656 Map = DC->CreateStoredDeclsMap(Context); in SetExternalVisibleDeclsForName()
1660 StoredDeclsList &List = (*Map)[Name]; in SetExternalVisibleDeclsForName()
1769 StoredDeclsMap *Map = DC->getPrimaryContext()->LookupPtr; in removeDecl() local
1770 if (Map) { in removeDecl()
[all …]
H A DParentMapContext.cpp121 const MapTy &Map) { in getDynNodeFromMap() argument
122 auto I = Map.find(Node); in getDynNodeFromMap()
123 if (I == Map.end()) { in getDynNodeFromMap()
363 ASTVisitor(ParentMap &Map) : Map(Map) {} in ASTVisitor() argument
439 &Map.PointerParents); in TraverseDecl()
445 &Map.OtherParents); in TraverseTypeLoc()
451 &Map.OtherParents); in TraverseNestedNameSpecifierLoc()
456 &Map.PointerParents); in TraverseAttr()
462 &Map.OtherParents); in TraverseObjCProtocolLoc()
467 addParent(StmtNode, &Map.PointerParents); in dataTraverseStmtPre()
[all …]
/freebsd/contrib/llvm-project/clang/lib/Serialization/
H A DModuleFile.cpp34 const ContinuousRangeMap<Key, Offset, InitialCapacity> &Map) { in dumpLocalRemap() argument
35 if (Map.begin() == Map.end()) in dumpLocalRemap()
41 for (typename MapType::const_iterator I = Map.begin(), IEnd = Map.end(); in dumpLocalRemap()
/freebsd/contrib/llvm-project/clang/lib/Basic/
H A DOffloadArch.cpp103 llvm::find_if(ArchNames, [A](const OffloadArchToStringMap &Map) { in OffloadArchToString() argument
104 return A == Map.Arch; in OffloadArchToString()
113 llvm::find_if(ArchNames, [A](const OffloadArchToStringMap &Map) { in OffloadArchToVirtualArchString() argument
114 return A == Map.Arch; in OffloadArchToVirtualArchString()
123 llvm::find_if(ArchNames, [S](const OffloadArchToStringMap &Map) { in StringToOffloadArch() argument
124 return S == Map.ArchName; in StringToOffloadArch()
/freebsd/contrib/llvm-project/llvm/include/llvm/BinaryFormat/
H A DMsgPackDocument.h62 MapTy *Map; member
71 bool isMap() const { return getKind() == Type::Map; } in isMap()
147 if (getKind() != Type::Map) {
229 MapDocNode(DocNode &N) : DocNode(N) { assert(getKind() == Type::Map); } in MapDocNode()
232 size_t size() const { return Map->size(); } in size()
234 MapTy::iterator begin() { return Map->begin(); } in begin()
235 MapTy::iterator end() { return Map->end(); } in end()
236 MapTy::iterator find(DocNode Key) { return Map->find(Key); } in find()
238 MapTy::iterator erase(MapTy::const_iterator I) { return Map->erase(I); } in erase()
239 size_t erase(DocNode Key) { return Map->erase(Key); } in erase()
[all …]
/freebsd/contrib/llvm-project/lldb/include/lldb/Utility/
H A DUserIDResolver.h44 using Map = llvm::DenseMap<id_t, std::optional<std::string>>;
47 Get(id_t id, Map &cache,
51 Map m_uid_cache;
52 Map m_gid_cache;
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/
H A DMachineModuleInfoImpls.cpp39 DenseMap<MCSymbol *, MachineModuleInfoImpl::StubValueTy> &Map) { in getSortedStubs() argument
40 MachineModuleInfoImpl::SymbolListTy List(Map.begin(), Map.end()); in getSortedStubs()
44 Map.clear(); in getSortedStubs()
/freebsd/contrib/llvm-project/llvm/lib/Target/SystemZ/MCTargetDesc/
H A DSystemZMCTargetDesc.cpp139 static unsigned Map[SystemZ::NUM_TARGET_REGS]; in getFirstReg() local
143 Map[GR32Regs[I]] = I; in getFirstReg()
144 Map[GRH32Regs[I]] = I; in getFirstReg()
145 Map[GR64Regs[I]] = I; in getFirstReg()
146 Map[GR128Regs[I]] = I; in getFirstReg()
147 Map[FP128Regs[I]] = I; in getFirstReg()
148 Map[AR32Regs[I]] = I; in getFirstReg()
151 Map[VR16Regs[I]] = I; in getFirstReg()
152 Map[VR32Regs[I]] = I; in getFirstReg()
153 Map[VR64Regs[I]] = I; in getFirstReg()
[all …]

12345678910>>...16