/freebsd-current/contrib/llvm-project/compiler-rt/lib/scudo/standalone/ |
H A D | bytemap.h | 20 void init() { DCHECK(Size == 0 || Map[0] == 0); } 22 void unmapTestOnly() { memset(Map, 0, Size); } 26 DCHECK_EQ(0U, Map[Index]); 27 Map[Index] = Value; 31 return Map[Index]; 38 u8 Map[Size] = {}; member in class:scudo::FlatByteMap
|
/freebsd-current/contrib/llvm-project/llvm/lib/CodeGen/ |
H A D | MachineModuleInfoImpls.cpp | 36 DenseMap<MCSymbol *, MachineModuleInfoImpl::StubValueTy> &Map) { 37 MachineModuleInfoImpl::SymbolListTy List(Map.begin(), Map.end()); 41 Map.clear(); 35 getSortedStubs( DenseMap<MCSymbol *, MachineModuleInfoImpl::StubValueTy> &Map) argument
|
/freebsd-current/contrib/llvm-project/clang/lib/StaticAnalyzer/Core/ |
H A D | FunctionSummary.cpp | 20 for (const auto &I : Map) 27 for (const auto &I : Map)
|
/freebsd-current/contrib/llvm-project/clang/include/clang/AST/ |
H A D | DeclLookups.h | 79 if (StoredDeclsMap *Map = Primary->buildLookup()) 80 return lookups_range(all_lookups_iterator(Map->begin(), Map->end()), 81 all_lookups_iterator(Map->end(), Map->end())); 93 if (StoredDeclsMap *Map = Primary->getLookupPtr()) 94 return lookups_range(all_lookups_iterator(Map->begin(), Map->end()), 95 all_lookups_iterator(Map->end(), Map [all...] |
/freebsd-current/contrib/llvm-project/llvm/lib/Transforms/ObjCARC/ |
H A D | BlotMapVector.h | 23 /// Map keys to indices in Vector. 25 MapTy Map; 34 assert(Vector.size() >= Map.size()); // May differ due to blotting. 35 for (typename MapTy::const_iterator I = Map.begin(), E = Map.end(); I != E; 42 assert(!I->first || (Map.count(I->first) && 43 Map[I->first] == size_t(I - Vector.begin()))); 57 Map.insert(std::make_pair(Arg, size_t(0))); 69 Map.insert(std::make_pair(InsertPair.first, size_t(0))); 80 typename MapTy::iterator It = Map [all...] |
/freebsd-current/contrib/llvm-project/compiler-rt/lib/fuzzer/ |
H A D | FuzzerValueBitMap.h | 28 void Reset() { memset(Map, 0, sizeof(Map)); } 37 uintptr_t Old = Map[WordIdx]; 39 Map[WordIdx] = New; 52 return Map[WordIdx] & (1ULL << BitIdx); 61 if (uintptr_t M = Map[i]) 68 ATTRIBUTE_ALIGNED(512) uintptr_t Map[kMapSizeInWords];
|
/freebsd-current/contrib/llvm-project/llvm/lib/Target/DirectX/DirectXIRPasses/ |
H A D | PointerTypeAnalysis.cpp | 24 Type *classifyPointerType(const Value *V, PointerTypeMap &Map) { argument 27 auto It = Map.find(V); 28 if (It != Map.end()) 58 PointeeTy = classifyPointerType(User, Map); 73 Map[V] = TypedPtrTy; 80 Type *classifyFunctionType(const Function &F, PointerTypeMap &Map) { argument 81 auto It = Map.find(&F); 82 if (It != Map.end()) 95 Type *NewRetTy = classifyPointerType(RetInst->getReturnValue(), Map); 110 ArgTy = classifyPointerType(&A, Map); 120 classifyConstantWithOpaquePtr(const Constant *C, PointerTypeMap &Map) argument 178 classifyGlobalCtorPointerType(const GlobalVariable &GV, PointerTypeMap &Map) argument 190 PointerTypeMap Map; local [all...] |
/freebsd-current/contrib/llvm-project/llvm/utils/TableGen/ |
H A D | InfoByHwMode.h | 96 InfoByHwMode(const MapType &M) : Map(M) {} 99 iterator begin() { return Map.begin(); } 101 iterator end() { return Map.end(); } 103 const_iterator begin() const { return Map.begin(); } 105 const_iterator end() const { return Map.end(); } 107 bool empty() const { return Map.empty(); } 110 bool hasMode(unsigned M) const { return Map.find(M) != Map.end(); } 113 return !Map.empty() && Map 153 MapType Map; member in struct:llvm::InfoByHwMode [all...] |
H A D | InfoByHwMode.cpp | 34 auto I = Map.insert({P.first, MVT(llvm::getValueType(P.second))}); 55 return Map == T.Map; 61 return Map < T.Map; 65 auto F = Map.find(Mode); 66 if (F != Map.end()) 70 auto D = Map.begin(); 71 if (D != Map.end() && D->first == DefaultMode) 72 return Map [all...] |
/freebsd-current/contrib/llvm-project/llvm/include/llvm/IR/ |
H A D | ValueMap.h | 92 MapT Map; 103 : Map(NumInitBuckets), Data() {} 105 : Map(NumInitBuckets), Data(Data) {} 134 inline iterator begin() { return iterator(Map.begin()); } 135 inline iterator end() { return iterator(Map.end()); } 136 inline const_iterator begin() const { return const_iterator(Map.begin()); } 137 inline const_iterator end() const { return const_iterator(Map.end()); } 139 bool empty() const { return Map.empty(); } 140 size_type size() const { return Map.size(); } 143 void reserve(size_t Size) { Map 249 ValueMapCallbackVH(KeyT Key, ValueMapT *Map) argument [all...] |
/freebsd-current/contrib/llvm-project/compiler-rt/lib/orc/ |
H A D | interval_set.h | 62 bool empty() const { return Map.empty(); } 64 void clear() { Map.clear(); } 66 const_iterator begin() const { return const_iterator(Map.begin()); } 67 const_iterator end() const { return const_iterator(Map.end()); } 70 return const_iterator(Map.find(K)); 74 Map.insert(std::move(KS), std::move(KE), std::monostate()); 78 Map.erase(KS, KE); 82 ImplMap Map; member in class:__orc_rt::IntervalSet
|
/freebsd-current/contrib/llvm-project/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ |
H A D | FunctionSummary.h | 57 MapTy Map; 61 MapTy::iterator I = Map.find(D); 62 if (I != Map.end()) 67 I = Map.insert(KVPair(D, FunctionSummary())).first; 68 assert(I != Map.end()); 89 MapTy::const_iterator I = Map.find(D); 90 if (I != Map.end() && I->second.InlineChecked) 107 MapTy::const_iterator I = Map.find(D); 108 if (I != Map.end()) 114 MapTy::const_iterator I = Map [all...] |
/freebsd-current/contrib/llvm-project/clang/lib/Serialization/ |
H A D | ModuleFile.cpp | 34 const ContinuousRangeMap<Key, Offset, InitialCapacity> &Map) { 35 if (Map.begin() == Map.end()) 41 for (typename MapType::const_iterator I = Map.begin(), IEnd = Map.end(); 33 dumpLocalRemap(StringRef Name, const ContinuousRangeMap<Key, Offset, InitialCapacity> &Map) argument
|
/freebsd-current/contrib/llvm-project/llvm/include/llvm/ADT/ |
H A D | UniqueVector.h | 31 // Map - Used to handle the correspondence of entry to ID. 32 std::map<T, unsigned> Map; member in class:llvm::UniqueVector 42 unsigned &Val = Map[Entry]; 59 typename std::map<T, unsigned>::const_iterator MI = Map.find(Entry); 62 if (MI != Map.end()) return MI->second; 94 Map.clear();
|
H A D | MapVector.h | 1 //===- llvm/ADT/MapVector.h - Map w/ deterministic value order --*- C++ -*-===// 37 MapType Map; member in class:llvm::MapVector 42 "The mapped_type of the specified Map must be an integral type"); 56 Map.clear(); 65 Map.reserve(NumEntries); 89 Map.clear(); 94 std::swap(Map, RHS.Map); 100 std::pair<typename MapType::iterator, bool> Result = Map.insert(Pair); 113 typename MapType::const_iterator Pos = Map [all...] |
H A D | edit_distance.h | 30 /// \param Map A Functor to apply to each item of the sequences before 46 Functor Map, bool AllowReplacements = true, 81 const auto &CurItem = Map(FromArray[y - 1]); 85 Row[x] = std::min(Previous + (CurItem == Map(ToArray[x - 1]) ? 0u : 1u), 89 if (CurItem == Map(ToArray[x - 1])) 45 ComputeMappedEditDistance(ArrayRef<T> FromArray, ArrayRef<T> ToArray, Functor Map, bool AllowReplacements = true, unsigned MaxEditDistance = 0) argument
|
/freebsd-current/contrib/llvm-project/compiler-rt/lib/memprof/ |
H A D | memprof_mibmap.cpp | 21 void InsertOrMerge(const uptr Id, const MemInfoBlock &Block, MIBMapTy &Map) { argument 22 MIBMapTy::Handle h(&Map, static_cast<uptr>(Id), /*remove=*/false,
|
H A D | memprof_mibmap.h | 23 MIBMapTy &Map);
|
/freebsd-current/contrib/llvm-project/lldb/include/lldb/Utility/ |
H A D | UserIDResolver.h | 44 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-current/contrib/llvm-project/clang/include/clang/Lex/ |
H A D | DirectoryLookup.h | 43 /// Map - This is the HeaderMap if this is a headermap lookup. 45 const HeaderMap *Map; member in union:clang::DirectoryLookup::DLU 48 DLU(const HeaderMap *Map) : Map(Map) {} argument 78 /// This ctor *does not take ownership* of 'Map'. 79 DirectoryLookup(const HeaderMap *Map, SrcMgr::CharacteristicKind DT, argument 81 : u(Map), DirCharacteristic(DT), LookupType(LT_HeaderMap), 115 return isHeaderMap() ? u.Map : nullptr;
|
/freebsd-current/contrib/llvm-project/llvm/include/llvm/Transforms/Utils/ |
H A D | LoopConstrainer.h | 65 template <typename M> LoopStructure map(M Map) const { 68 Result.Header = cast<BasicBlock>(Map(Header)); 69 Result.Latch = cast<BasicBlock>(Map(Latch)); 70 Result.LatchBr = cast<BranchInst>(Map(LatchBr)); 71 Result.LatchExit = cast<BasicBlock>(Map(LatchExit)); 73 Result.IndVarBase = Map(IndVarBase); 74 Result.IndVarStart = Map(IndVarStart); 75 Result.IndVarStep = Map(IndVarStep); 76 Result.LoopExitAt = Map(LoopExitAt); 115 // `Map` map 116 ValueToValueMapTy Map; member in struct:llvm::LoopConstrainer::ClonedLoop [all...] |
/freebsd-current/contrib/llvm-project/llvm/include/llvm/CodeGen/ |
H A D | RDFRegisters.h | 54 IndexedSet() { Map.reserve(N); } 57 // Index Idx corresponds to Map[Idx-1]. 58 assert(Idx != 0 && !Map.empty() && Idx - 1 < Map.size()); 59 return Map[Idx - 1]; 64 auto F = llvm::find(Map, Val); 65 if (F != Map.end()) 66 return F - Map.begin() + 1; 67 Map.push_back(Val); 68 return Map 85 std::vector<T> Map; member in struct:llvm::rdf::IndexedSet 305 std::map<KeyType, RegisterAggr> Map; member in struct:llvm::rdf::RegisterAggrMap [all...] |
/freebsd-current/contrib/llvm-project/llvm/include/llvm/DebugInfo/PDB/Native/ |
H A D | HashTable.h | 41 HashTableIterator(const HashTable<ValueT> &Map, uint32_t Index, argument 43 : Map(&Map), Index(Index), IsEnd(IsEnd) {} 46 HashTableIterator(const HashTable<ValueT> &Map) : Map(&Map) { argument 47 int I = Map.Present.find_first(); 59 Map = R.Map; 68 return (Map 93 const HashTable<ValueT> *Map; member in class:llvm::pdb::HashTableIterator [all...] |
/freebsd-current/contrib/llvm-project/clang/include/clang/Tooling/Transformer/ |
H A D | MatchConsumer.h | 50 auto &Map = Result.Nodes.getMap(); 51 return (Map.find(ID) != Map.end() ? TrueC : FalseC)(Result);
|
/freebsd-current/contrib/googletest/googletest/samples/ |
H A D | sample3_unittest.cc | 89 // A helper function for testing Queue::Map(). 93 const Queue<int>* const new_q = q->Map(Double); 140 // Tests the Queue::Map() function. 141 TEST_F(QueueTestSmpl3, Map) {
|