| /freebsd-13.1/contrib/llvm-project/llvm/utils/TableGen/ |
| H A D | InfoByHwMode.h | 81 bool hasMode(unsigned M) const { return Map.find(M) != Map.end(); } in hasMode() 88 Map.insert({Mode, Map.at(DefaultMode)}); in get() 90 return Map.at(Mode); in get() 93 auto F = Map.find(Mode); in get() 95 F = Map.find(DefaultMode); in get() 96 assert(F != Map.end()); in get() 102 return Map.size() == 1 && Map.begin()->first == DefaultMode; in isSimple() 107 return Map.begin()->second; in getSimple() 112 Map.clear(); in makeSimple() 117 MapType Map; [all …]
|
| H A D | InfoByHwMode.cpp | 54 return Map == T.Map; in operator ==() 60 return Map < T.Map; in operator <() 64 auto F = Map.find(Mode); in getOrCreateTypeForMode() 65 if (F != Map.end()) in getOrCreateTypeForMode() 69 auto D = Map.find(DefaultMode); in getOrCreateTypeForMode() 70 if (D != Map.end()) in getOrCreateTypeForMode() 89 for (const auto &P : Map) in writeToStream() 152 unsigned M0 = Map.begin()->first; in operator <() 157 unsigned M0 = Map.begin()->first; in operator ==() 162 unsigned M0 = Map.begin()->first; in isSubClassOf() [all …]
|
| /freebsd-13.1/contrib/llvm-project/llvm/include/llvm/IR/ |
| H A D | ValueMap.h | 93 MapT Map; variable 147 Map.clear(); in clear() 153 return Map.find_as(Val) == Map.end() ? 0 : 1; in count() 193 if (I == Map.end()) in erase() 196 Map.erase(I); in erase() 248 ValueMapT *Map; 252 Map(Map) {} 268 Copy.Map->Map.erase(Copy); // Definitely destroys *this. 285 typename ValueMapT::MapT::iterator I = Copy.Map->Map.find(Copy); 288 if (I != Copy.Map->Map.end()) { [all …]
|
| /freebsd-13.1/contrib/llvm-project/llvm/lib/Transforms/ObjCARC/ |
| H A D | BlotMapVector.h | 25 MapTy Map; variable 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() 80 typename MapTy::iterator It = Map.find(Key); in find() 81 if (It == Map.end()) in find() 88 if (It == Map.end()) in find() 98 if (It == Map.end()) in blot() 101 Map.erase(It); in blot() 105 Map.clear(); in clear() 110 assert(Map.empty() == Vector.empty()); in empty() [all …]
|
| /freebsd-13.1/contrib/llvm-project/llvm/include/llvm/ADT/ |
| H A D | MapVector.h | 38 MapType Map; variable 56 Map.clear(); in takeVector() 65 Map.reserve(NumEntries); in reserve() 89 Map.clear(); in clear() 94 std::swap(Map, RHS.Map); in swap() 144 return Pos == Map.end()? 0 : 1; in count() 162 Map.erase(Pos); in pop_back() 174 Map.erase(Iterator->first); in erase() 181 for (auto &I : Map) { in erase() 214 Map.erase(I->first); in remove_if() [all …]
|
| H A D | UniqueVector.h | 32 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-13.1/contrib/llvm-project/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ |
| H A D | FunctionSummary.h | 58 MapTy Map; variable 62 MapTy::iterator I = Map.find(D); in findOrInsertSummary() 63 if (I != Map.end()) in findOrInsertSummary() 69 assert(I != Map.end()); in findOrInsertSummary() 90 MapTy::const_iterator I = Map.find(D); in mayInline() 108 MapTy::const_iterator I = Map.find(D); in getNumVisitedBasicBlocks() 109 if (I != Map.end()) in getNumVisitedBasicBlocks() 115 MapTy::const_iterator I = Map.find(D); in getNumTimesInlined() 116 if (I != Map.end()) in getNumTimesInlined() 128 MapTy::const_iterator I = Map.find(D); in getPercentBlocksReachable() [all …]
|
| /freebsd-13.1/contrib/llvm-project/clang/include/clang/AST/ |
| H A D | DeclLookups.h | 79 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-13.1/contrib/llvm-project/llvm/include/llvm/CodeGen/ |
| H A D | RDFRegisters.h | 37 IndexedSet() { Map.reserve(N); } in IndexedSet() 41 assert(Idx != 0 && !Map.empty() && Idx-1 < Map.size()); in get() 42 return Map[Idx-1]; in get() 47 auto F = llvm::find(Map, Val); in insert() 48 if (F != Map.end()) in insert() 49 return F - Map.begin() + 1; in insert() 50 Map.push_back(Val); in insert() 55 auto F = llvm::find(Map, Val); in find() 56 assert(F != Map.end()); in find() 57 return F - Map.begin() + 1; in find() [all …]
|
| /freebsd-13.1/contrib/llvm-project/clang/lib/AST/Interp/ |
| H A D | Pointer.cpp | 142 InitMap *Map = getInitMap(); in isInitialized() local 143 if (!Map) in isInitialized() 145 if (Map == (InitMap *)-1) in isInitialized() 147 return Map->isInitialized(getIndex()); in isInitialized() 160 InitMap *&Map = getInitMap(); in initialize() local 161 if (Map == (InitMap *)-1) in initialize() 163 if (Map == nullptr) in initialize() 164 Map = InitMap::allocate(Desc->getNumElems()); in initialize() 165 if (Map->initialize(getIndex())) { in initialize() 166 free(Map); in initialize() [all …]
|
| /freebsd-13.1/contrib/llvm-project/compiler-rt/lib/scudo/standalone/ |
| H A D | bytemap.h | 20 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-13.1/contrib/llvm-project/compiler-rt/lib/fuzzer/ |
| H A D | FuzzerValueBitMap.h | 28 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-13.1/contrib/llvm-project/llvm/include/llvm/DebugInfo/PDB/Native/ |
| H A D | HashTable.h | 43 HashTableIterator(const HashTable<ValueT> &Map, uint32_t Index, in HashTableIterator() argument 45 : Map(&Map), Index(Index), IsEnd(IsEnd) {} in HashTableIterator() 48 HashTableIterator(const HashTable<ValueT> &Map) : Map(&Map) { in HashTableIterator() argument 49 int I = Map.Present.find_first(); in HashTableIterator() 61 Map = R.Map; 70 return (Map == R.Map) && (Index == R.Index); 73 assert(Map->Present.test(Index)); 74 return Map->Buckets[Index]; 83 while (Index < Map->Buckets.size()) { 85 if (Map->Present.test(Index)) [all …]
|
| /freebsd-13.1/contrib/llvm-project/clang/include/clang/Lex/ |
| H A D | DirectoryLookup.h | 45 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 77 : u(Map), DirCharacteristic(DT), LookupType(LT_HeaderMap), in DirectoryLookup() 107 return isHeaderMap() ? u.Map : nullptr; in getHeaderMap()
|
| /freebsd-13.1/contrib/llvm-project/clang/lib/AST/ |
| H A D | DeclBase.cpp | 1383 StoredDeclsMap *Map; in SetNoExternalVisibleDeclsForName() local 1399 StoredDeclsMap *Map; in SetExternalVisibleDeclsForName() local 1515 if (Map) { in removeDecl() 1665 if (!Map) in lookup() 1690 if (!Map) in lookup() 1694 if (I == Map->end()) in lookup() 1712 if (!Map) in noload_lookup() 1886 if (!Map) { in makeDeclVisibleInContextImpl() 1898 Map->find(D->getDeclName()) == Map->end()) in makeDeclVisibleInContextImpl() 1959 while (Map) { in DestroyAll() [all …]
|
| H A D | ParentMapContext.cpp | 96 const MapTy &Map) { in getDynNodeFromMap() argument 97 auto I = Map.find(Node); in getDynNodeFromMap() 98 if (I == Map.end()) { in getDynNodeFromMap() 344 ASTVisitor(ParentMap &Map) : Map(Map) {} in ASTVisitor() argument 418 &Map.PointerParents); in TraverseDecl() 424 &Map.OtherParents); in TraverseTypeLoc() 430 &Map.OtherParents); in TraverseNestedNameSpecifierLoc() 435 addParent(StmtNode, &Map.PointerParents); in dataTraverseStmtPre() 444 ParentMap ⤅ member in ParentMapContext::ParentMap::ASTVisitor
|
| /freebsd-13.1/contrib/llvm-project/llvm/include/llvm/BinaryFormat/ |
| H A D | MsgPackDocument.h | 61 MapTy *Map; member 70 bool isMap() const { return getKind() == Type::Map; } in isMap() 141 if (getKind() != Type::Map) { 225 size_t size() const { return Map->size(); } in size() 227 MapTy::iterator begin() { return Map->begin(); } in begin() 228 MapTy::iterator end() { return Map->end(); } in end() 229 MapTy::iterator find(DocNode Key) { return Map->find(Key); } in find() 232 size_t erase(DocNode Key) { return Map->erase(Key); } in erase() 235 return Map->erase(First, Second); in erase() 373 auto N = DocNode(&KindAndDocs[size_t(Type::Map)]); in getMapNode() [all …]
|
| /freebsd-13.1/contrib/llvm-project/clang/lib/Serialization/ |
| H A D | ModuleFile.cpp | 34 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-13.1/contrib/llvm-project/llvm/lib/CodeGen/ |
| H A D | MachineModuleInfoImpls.cpp | 36 DenseMap<MCSymbol *, MachineModuleInfoImpl::StubValueTy> &Map) { in getSortedStubs() argument 37 MachineModuleInfoImpl::SymbolListTy List(Map.begin(), Map.end()); in getSortedStubs() 41 Map.clear(); in getSortedStubs()
|
| /freebsd-13.1/contrib/llvm-project/llvm/lib/Target/SystemZ/MCTargetDesc/ |
| H A D | SystemZMCTargetDesc.cpp | 128 static unsigned Map[SystemZ::NUM_TARGET_REGS]; in getFirstReg() local 132 Map[GR32Regs[I]] = I; in getFirstReg() 133 Map[GRH32Regs[I]] = I; in getFirstReg() 134 Map[GR64Regs[I]] = I; in getFirstReg() 135 Map[GR128Regs[I]] = I; in getFirstReg() 136 Map[FP128Regs[I]] = I; in getFirstReg() 137 Map[AR32Regs[I]] = I; in getFirstReg() 140 Map[VR32Regs[I]] = I; in getFirstReg() 141 Map[VR64Regs[I]] = I; in getFirstReg() 142 Map[VR128Regs[I]] = I; in getFirstReg() [all …]
|
| /freebsd-13.1/contrib/llvm-project/lldb/include/lldb/Utility/ |
| H A D | UserIDResolver.h | 43 using Map = llvm::DenseMap<id_t, llvm::Optional<std::string>>; 46 Get(id_t id, Map &cache, 50 Map m_uid_cache; 51 Map m_gid_cache;
|
| /freebsd-13.1/contrib/llvm-project/llvm/lib/BinaryFormat/ |
| H A D | MsgPackDocument.cpp | 43 DocNode &N = (*Map)[Key]; in operator []() 170 case Type::Map: in readFromBlob() 189 auto &Map = Stack.back().Node.getMap(); in readFromBlob() local 193 Stack.back().MapEntry = &Map[Node]; in readFromBlob() 220 case msgpack::Type::Map: in readFromBlob() 260 case Type::Map: in writeToBlob() 287 if (Stack.back().Node.getKind() == Type::Map) { in writeToBlob() 299 if (Stack.back().Node.getKind() == Type::Map) { in writeToBlob()
|
| /freebsd-13.1/contrib/llvm-project/llvm/lib/XRay/ |
| H A D | InstrumentationMap.cpp | 58 InstrumentationMap Map; in loadObj() local 261 InstrumentationMap Map; in loadInstrumentationMap() local 285 if (auto E = loadYAML(*FdOrErr, FileSize, Filename, Map.Sleds, in loadInstrumentationMap() 286 Map.FunctionAddresses, Map.FunctionIds)) in loadInstrumentationMap() 288 } else if (auto E = loadObj(Filename, *ObjectFileOrError, Map.Sleds, in loadInstrumentationMap() 289 Map.FunctionAddresses, Map.FunctionIds)) { in loadInstrumentationMap() 292 return Map; in loadInstrumentationMap()
|
| /freebsd-13.1/contrib/file/magic/Magdir/ |
| H A D | cubemap | 6 0 string ACMP Map file for the AssaultCube FPS game 7 0 string CUBE Map file for cube and cube2 engine games 8 0 string MAPZ) Map file for the Blood Frontier/Red Eclipse FPS games
|
| /freebsd-13.1/contrib/llvm-project/llvm/lib/DebugInfo/CodeView/ |
| H A D | TypeStreamMerger.cpp | 138 inline bool remapIndex(TypeIndex &Idx, ArrayRef<TypeIndex> Map) { in remapIndex() argument 139 if (LLVM_LIKELY(remapIndexSimple(Idx, Map))) in remapIndex() 142 return remapIndexFallback(Idx, Map); in remapIndex() 145 inline bool remapIndexSimple(TypeIndex &Idx, ArrayRef<TypeIndex> Map) const { in remapIndexSimple() 154 if (LLVM_UNLIKELY(MapPos >= Map.size() || Map[MapPos] == Untranslated)) in remapIndexSimple() 157 Idx = Map[MapPos]; in remapIndexSimple() 161 bool remapIndexFallback(TypeIndex &Idx, ArrayRef<TypeIndex> Map); 218 ArrayRef<TypeIndex> Map) { in remapIndexFallback() argument 223 if (IsSecondPass && MapPos >= Map.size()) { in remapIndexFallback()
|