Home
last modified time | relevance | path

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

12345678910>>...14

/openbsd-src/gnu/llvm/compiler-rt/lib/sanitizer_common/tests/
H A Dsanitizer_dense_map_test.cpp105 T Map; member in __anon97d5ac0f0111::DenseMapTest
133 EXPECT_EQ(0u, this->Map.size()); in TYPED_TEST()
134 EXPECT_TRUE(this->Map.empty()); in TYPED_TEST()
137 EXPECT_FALSE(this->Map.count(this->getKey())); in TYPED_TEST()
138 EXPECT_EQ(nullptr, this->Map.find(this->getKey())); in TYPED_TEST()
140 this->Map.lookup(this->getKey())); in TYPED_TEST()
145 const TypeParam &ConstMap = this->Map; in TYPED_TEST()
152 this->Map[this->getKey()] = this->getValue(); in TYPED_TEST()
155 EXPECT_EQ(1u, this->Map.size()); in TYPED_TEST()
156 EXPECT_FALSE(this->Map.empty()); in TYPED_TEST()
[all …]
/openbsd-src/gnu/llvm/libcxx/benchmarks/
H A Dmap.bench.cpp115 auto& Map = Data.Maps.front(); in run() local
119 std::map<uint64_t, int64_t>(Map.begin(), Map.end())); in run()
121 std::map<uint64_t, int64_t> M{Map.begin(), Map.end()}; in run()
122 if (M != Map) in run()
136 auto& Map = Data.Maps.front(); in run() local
139 std::map<uint64_t, int64_t> M(Map); in run()
142 std::map<uint64_t, int64_t> M(Map); in run()
143 if (M != Map) in run()
158 for (auto& Map : Data.Maps) { in run() local
159 std::map<uint64_t, int64_t> M(std::move(Map)); in run()
[all …]
/openbsd-src/gnu/llvm/llvm/lib/Target/DirectX/DirectXIRPasses/
H A DPointerTypeAnalysis.cpp24 Type *classifyPointerType(const Value *V, PointerTypeMap &Map) { in classifyPointerType() argument
27 auto It = Map.find(V); in classifyPointerType()
28 if (It != Map.end()) in classifyPointerType()
58 PointeeTy = classifyPointerType(User, Map); in classifyPointerType()
73 Map[V] = TypedPtrTy; in classifyPointerType()
80 Type *classifyFunctionType(const Function &F, PointerTypeMap &Map) { in classifyFunctionType() argument
81 auto It = Map.find(&F); in classifyFunctionType()
82 if (It != Map.end()) in classifyFunctionType()
95 Type *NewRetTy = classifyPointerType(RetInst->getReturnValue(), Map); in classifyFunctionType()
110 ArgTy = classifyPointerType(&A, Map); in classifyFunctionType()
[all …]
/openbsd-src/gnu/llvm/llvm/utils/TableGen/
H A DInfoByHwMode.h65 InfoByHwMode(const MapType &M) : Map(M) {} in InfoByHwMode()
68 iterator begin() { return Map.begin(); } in begin()
70 iterator end() { return Map.end(); } in end()
72 const_iterator begin() const { return Map.begin(); } in begin()
74 const_iterator end() const { return Map.end(); } in end()
76 bool empty() const { return Map.empty(); } in empty()
79 bool hasMode(unsigned M) const { return Map.find(M) != Map.end(); } in hasMode()
86 Map.insert({Mode, Map.at(DefaultMode)}); in get()
88 return Map.at(Mode); in get()
91 auto F = Map.find(Mode); in get()
[all …]
H A DInfoByHwMode.cpp34 auto I = Map.insert({P.first, MVT(llvm::getValueType(P.second))}); in ValueTypeByHwMode()
53 return Map == T.Map; in operator ==()
59 return Map < T.Map; in operator <()
63 auto F = Map.find(Mode); in getOrCreateTypeForMode()
64 if (F != Map.end()) in getOrCreateTypeForMode()
68 auto D = Map.find(DefaultMode); in getOrCreateTypeForMode()
69 if (D != Map.end()) in getOrCreateTypeForMode()
70 return Map.insert(std::make_pair(Mode, D->second)).first->second; in getOrCreateTypeForMode()
72 return Map.insert(std::make_pair(Mode, Type)).first->second; in getOrCreateTypeForMode()
88 for (const auto &P : Map) in writeToStream()
[all …]
/openbsd-src/gnu/llvm/llvm/include/llvm/IR/
H A DValueMap.h92 MapT Map; variable
103 : Map(NumInitBuckets), Data() {} in Map() function
105 : Map(NumInitBuckets), Data(Data) {} in Map() function
134 inline iterator begin() { return iterator(Map.begin()); } in begin()
135 inline iterator end() { return iterator(Map.end()); } in end()
136 inline const_iterator begin() const { return const_iterator(Map.begin()); } in begin()
137 inline const_iterator end() const { return const_iterator(Map.end()); } in end()
139 bool empty() const { return Map.empty(); } in empty()
140 size_type size() const { return Map.size(); } in size()
143 void reserve(size_t Size) { Map.reserve(Size); } in reserve()
[all …]
/openbsd-src/gnu/llvm/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()
57 Map.insert(std::make_pair(Arg, size_t(0)));
69 Map.insert(std::make_pair(InsertPair.first, size_t(0))); in insert()
80 typename MapTy::iterator It = Map.find(Key); in find()
81 if (It == Map.end()) in find()
87 typename MapTy::const_iterator It = Map.find(Key); in find()
[all …]
/openbsd-src/gnu/llvm/llvm/include/llvm/ADT/
H A DMapVector.h38 MapType Map; variable
57 Map.clear(); in takeVector()
66 Map.reserve(NumEntries); in reserve()
90 Map.clear(); in clear()
95 std::swap(Map, RHS.Map); in swap()
101 std::pair<typename MapType::iterator, bool> Result = Map.insert(Pair);
114 typename MapType::const_iterator Pos = Map.find(Key); in lookup()
115 return Pos == Map.end()? ValueT() : Vector[Pos->second].second; in lookup()
120 std::pair<typename MapType::iterator, bool> Result = Map.insert(Pair); in insert()
133 std::pair<typename MapType::iterator, bool> Result = Map.insert(Pair); in insert()
[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()
/openbsd-src/gnu/llvm/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()
89 MapTy::const_iterator I = Map.find(D); in mayInline()
90 if (I != Map.end() && I->second.InlineChecked) in mayInline()
107 MapTy::const_iterator I = Map.find(D); in getNumVisitedBasicBlocks()
108 if (I != Map.end()) in getNumVisitedBasicBlocks()
114 MapTy::const_iterator I = Map.find(D); in getNumTimesInlined()
[all …]
/openbsd-src/gnu/llvm/compiler-rt/lib/scudo/standalone/tests/
H A Dbytemap_test.cpp16 template <typename T> void testMap(T &Map, scudo::uptr Size) { in testMap() argument
17 Map.init(); in testMap()
19 Map.set(I, (I % 100) + 1); in testMap()
22 EXPECT_EQ(Map[J], 0); in testMap()
24 EXPECT_EQ(Map[J], (J % 100) + 1); in testMap()
30 scudo::FlatByteMap<Size> Map; in TEST() local
31 testMap(Map, Size); in TEST()
32 Map.unmapTestOnly(); in TEST()
/openbsd-src/gnu/llvm/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()
/openbsd-src/gnu/lib/libstdc++/libstdc++/testsuite/23_containers/
H A Dmap_insert.cc32 typedef std::map<int, int> Map; in test01() typedef
33 Map M; in test01()
34 Map::iterator hint; in test01()
36 hint = M.insert(Map::value_type(7, 0)).first; in test01()
38 M.insert(hint, Map::value_type(8, 1)); in test01()
39 M.insert(M.begin(), Map::value_type(9, 2)); in test01()
47 Map::iterator i = M.begin(); in test01()
/openbsd-src/gnu/llvm/llvm/include/llvm/CodeGen/
H A DRDFRegisters.h37 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()
51 return Map.size(); // Return actual_index + 1. in insert()
55 auto F = llvm::find(Map, Val); in find()
56 assert(F != Map.end()); in find()
[all …]
/openbsd-src/gnu/llvm/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] = {};
/openbsd-src/gnu/llvm/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;
/openbsd-src/gnu/llvm/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];
/openbsd-src/gnu/llvm/clang/lib/AST/Interp/
H A DPointer.cpp152 InitMap *Map = getInitMap(); in isInitialized() local
153 if (!Map) in isInitialized()
155 if (Map == (InitMap *)-1) in isInitialized()
157 return Map->isInitialized(getIndex()); in isInitialized()
176 InitMap *&Map = getInitMap(); in initialize() local
177 if (Map == (InitMap *)-1) in initialize()
179 if (Map == nullptr) in initialize()
180 Map = InitMap::allocate(Desc->getNumElems()); in initialize()
181 if (Map->initialize(getIndex())) { in initialize()
182 free(Map); in initialize()
[all …]
/openbsd-src/gnu/llvm/llvm/include/llvm/DebugInfo/PDB/Native/
H A DHashTable.h41 HashTableIterator(const HashTable<ValueT> &Map, uint32_t Index, in HashTableIterator() argument
43 : Map(&Map), Index(Index), IsEnd(IsEnd) {} in HashTableIterator()
46 HashTableIterator(const HashTable<ValueT> &Map) : Map(&Map) { in HashTableIterator() argument
47 int I = Map.Present.find_first(); in HashTableIterator()
59 Map = R.Map;
68 return (Map == R.Map) && (Index == R.Index);
71 assert(Map->Present.test(Index));
72 return Map->Buckets[Index];
79 while (Index < Map->Buckets.size()) {
81 if (Map->Present.test(Index))
[all …]
/openbsd-src/gnu/llvm/llvm/tools/llvm-exegesis/lib/
H A DLlvmState.cpp106 auto Map = std::make_unique<DenseMap<StringRef, unsigned>>( in createOpcodeNameToOpcodeIdxMapping() local
109 (*Map)[InstrInfo.getName(I)] = I; in createOpcodeNameToOpcodeIdxMapping()
110 assert(Map->size() == InstrInfo.getNumOpcodes() && "Size prediction failed"); in createOpcodeNameToOpcodeIdxMapping()
111 return std::move(Map); in createOpcodeNameToOpcodeIdxMapping()
117 auto Map = in createRegNameToRegNoMapping() local
120 (*Map)[kNoRegister] = 0; in createRegNameToRegNoMapping()
122 (*Map)[RegInfo.getName(I)] = I; in createRegNameToRegNoMapping()
123 assert(Map->size() == RegInfo.getNumRegs() && "Size prediction failed"); in createRegNameToRegNoMapping()
124 return std::move(Map); in createRegNameToRegNoMapping()
/openbsd-src/gnu/llvm/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
77 : u(Map), DirCharacteristic(DT), LookupType(LT_HeaderMap), in DirectoryLookup()
111 return isHeaderMap() ? u.Map : nullptr; in getHeaderMap()
/openbsd-src/gnu/llvm/clang/lib/AST/
H A DDeclBase.cpp1436 StoredDeclsMap *Map; in SetNoExternalVisibleDeclsForName() local
1437 if (!(Map = DC->LookupPtr)) in SetNoExternalVisibleDeclsForName()
1438 Map = DC->CreateStoredDeclsMap(Context); in SetNoExternalVisibleDeclsForName()
1442 (*Map)[Name].removeExternalDecls(); in SetNoExternalVisibleDeclsForName()
1452 StoredDeclsMap *Map; in SetExternalVisibleDeclsForName() local
1453 if (!(Map = DC->LookupPtr)) in SetExternalVisibleDeclsForName()
1454 Map = DC->CreateStoredDeclsMap(Context); in SetExternalVisibleDeclsForName()
1458 StoredDeclsList &List = (*Map)[Name]; in SetExternalVisibleDeclsForName()
1567 StoredDeclsMap *Map = DC->getPrimaryContext()->LookupPtr; in removeDecl() local
1568 if (Map) { in removeDecl()
[all …]
/openbsd-src/usr.sbin/ypserv/yppush/
H A Dyppush.c55 char Domain[HOST_NAME_MAX+1], Map[255]; variable
116 request.map_parms.map=(char *)&Map; in req_xfr()
255 strncpy(Map, map, sizeof(Map)-1); in main()
256 Map[sizeof(Map)-1] = '\0'; in main()
267 YP_DB_PATH, domain, Map, YPDB_SUFFIX); in main()
274 YP_DB_PATH, domain, Map); in main()
287 Map); in main()
297 Map, o.dptr); in main()
/openbsd-src/gnu/llvm/llvm/include/llvm/BinaryFormat/
H A DMsgPackDocument.h61 MapTy *Map; member
70 bool isMap() const { return getKind() == Type::Map; } in isMap()
141 if (getKind() != Type::Map) {
222 MapDocNode(DocNode &N) : DocNode(N) { assert(getKind() == Type::Map); } in MapDocNode()
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()
231 MapTy::iterator erase(MapTy::const_iterator I) { return Map->erase(I); } in erase()
232 size_t erase(DocNode Key) { return Map->erase(Key); } in erase()
[all …]
/openbsd-src/gnu/llvm/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()

12345678910>>...14