| /llvm-project-15.0.7/llvm/unittests/ADT/ |
| H A D | DenseMapTest.cpp | 81 T Map; member in __anon07952c110111::DenseMapTest
117 EXPECT_TRUE(this->Map.begin() == this->Map.end()); in TYPED_TEST()
170 this->Map.erase(this->Map.begin()); in TYPED_TEST()
640 EXPECT_NE(Map.find(B), Map.end()); in TEST()
641 EXPECT_NE(Map.find(C), Map.end()); in TEST()
663 EXPECT_EQ(Map.find(K1), Map.end()); in TEST()
664 EXPECT_EQ(Map.find(K2), Map.end()); in TEST()
665 EXPECT_EQ(Map.find(K3), Map.end()); in TEST()
706 EXPECT_EQ(Map.find(Keys[0]), Map.end()); in TEST()
707 EXPECT_EQ(Map.find(Keys[1]), Map.end()); in TEST()
[all …]
|
| H A D | StringMapTest.cpp | 167 Map["eins"] = 1; in TEST_F()
318 Map["A"] = 1; in TEST_F()
319 Map["B"] = 2; in TEST_F()
320 Map["C"] = 3; in TEST_F()
321 Map["D"] = 3; in TEST_F()
332 Map["A"] = 1; in TEST_F()
333 Map["B"] = 2; in TEST_F()
334 Map["C"] = 3; in TEST_F()
335 Map["D"] = 3; in TEST_F()
577 Map["abcd"]; in TEST()
[all …]
|
| /llvm-project-15.0.7/lldb/unittests/Utility/ |
| H A D | RangeMapTest.cpp | 110 RangeDataVectorT Map; in TEST() local
115 Map.Sort(); in TEST()
127 RangeDataVectorT Map; in TEST() local
132 Map.Sort(); in TEST()
145 auto Map = RangeDataVectorT(); in TEST() local
146 Map.Append(EntryT(0, 10, 50)); in TEST()
150 Map.Sort(); in TEST()
186 RangeDataVectorT Map; in TEST() local
190 Map.Sort(); in TEST()
202 RangeDataVectorT Map; in TEST() local
[all …]
|
| /llvm-project-15.0.7/compiler-rt/lib/sanitizer_common/tests/ |
| H A D | sanitizer_dense_map_test.cpp | 105 T Map; member in __anona16976e80111::DenseMapTest
168 this->Map.clear(); in TYPED_TEST()
177 this->Map.erase(this->Map.find(this->getKey())); in TYPED_TEST()
194 this->Map.insert( in TYPED_TEST()
231 this->Map.clear(); in TYPED_TEST()
377 Map.reserve(1); in TEST()
457 Map.reserve(Size); in TEST()
538 Map.insert({K1, 1}); in TEST()
539 Map.insert({K2, 2}); in TEST()
540 Map.insert({K3, 3}); in TEST()
[all …]
|
| /llvm-project-15.0.7/polly/utils/pyscop/ |
| H A D | isl.py | 290 ("reverse", Map, [Map], Map),
310 ("coalesce", Map, [Map], Map),
350 ("flatten", Map, [Map], Map),
360 ("intersect", Map, [Map, Map], Map),
373 ("union", Map, [Map, Map], Map),
377 ("subtract", Map, [Map, Map], Map),
385 ("apply_domain", Map, [Map, Map], Map),
388 ("apply_range", Map, [Map, Map], Map),
395 ("gist", Map, [Map, Map], Map),
404 ("lexmin", Map, [Map], Map),
[all …]
|
| /llvm-project-15.0.7/libcxx/benchmarks/ |
| H A D | map.bench.cpp | 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()
143 if (M != Map) in run()
185 if (Map.empty()) in run()
204 if (Map.size() != MapSize) in run()
224 Map.clear(); in run()
769 if (!Map.empty()) in run()
796 benchmark::DoNotOptimize(Map.erase(Map.begin(), Map.end())); in run()
798 Map.erase(Map.begin(), Map.end()); in run()
[all …]
|
| /llvm-project-15.0.7/llvm/unittests/Target/DirectX/ |
| H A D | PointerTypeAnalysisTests.cpp | 54 PointerTypeMap Map = PointerTypeAnalysis::run(*M); in TEST() local
55 ASSERT_EQ(Map.size(), 2u); in TEST()
76 PointerTypeMap Map = PointerTypeAnalysis::run(*M); in TEST() local
77 ASSERT_EQ(Map.size(), 2u); in TEST()
98 PointerTypeMap Map = PointerTypeAnalysis::run(*M); in TEST() local
99 ASSERT_EQ(Map.size(), 2u); in TEST()
120 PointerTypeMap Map = PointerTypeAnalysis::run(*M); in TEST() local
121 ASSERT_EQ(Map.size(), 3u); in TEST()
145 PointerTypeMap Map = PointerTypeAnalysis::run(*M); in TEST() local
146 ASSERT_EQ(Map.size(), 3u); in TEST()
[all …]
|
| /llvm-project-15.0.7/llvm/utils/TableGen/ |
| H A D | InfoByHwMode.h | 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()
93 F = Map.find(DefaultMode); in get()
94 assert(F != Map.end()); in get()
100 return Map.size() == 1 && Map.begin()->first == DefaultMode; in isSimple()
105 return Map.begin()->second; in getSimple()
110 Map.clear(); in makeSimple()
115 MapType Map;
[all …]
|
| H A D | InfoByHwMode.cpp | 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()
88 for (const auto &P : Map) in writeToStream()
151 unsigned M0 = Map.begin()->first; in operator <()
156 unsigned M0 = Map.begin()->first; in operator ==()
161 unsigned M0 = Map.begin()->first; in isSubClassOf()
[all …]
|
| /llvm-project-15.0.7/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 …]
|
| /llvm-project-15.0.7/lldb/unittests/Core/ |
| H A D | UniqueCStringMapTest.cpp | 36 MapT Map; in TEST() local
39 Map.Append(Foo, NoDefault(42)); in TEST()
42 EXPECT_THAT(Map.FindFirstValueForName(Foo), in TEST()
47 EXPECT_THAT(Map.GetValues(Foo, Values), 1); in TEST()
51 EXPECT_THAT(Map.GetValues(Bar, Values), 0); in TEST()
56 UniqueCStringMap<int> Map; in TEST() local
60 Map.Append(Foo, 0); in TEST()
61 Map.Append(Foo, 5); in TEST()
62 Map.Append(Foo, -5); in TEST()
64 Map.Sort(std::less<int>()); in TEST()
[all …]
|
| /llvm-project-15.0.7/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 …]
|
| /llvm-project-15.0.7/llvm/unittests/Analysis/ |
| H A D | AssumeBundleQueriesTest.cpp | 243 auto LookupIt = Map.find(Key); in MapHasRightValue()
268 RetainedKnowledgeMap Map; in TEST() local
293 RetainedKnowledgeMap Map; in TEST() local
316 RetainedKnowledgeMap Map; in TEST() local
325 RetainedKnowledgeMap Map; in TEST() local
329 ASSERT_TRUE(Map.empty()); in TEST()
341 RetainedKnowledgeMap Map; in TEST() local
378 RetainedKnowledgeMap Map; in TEST() local
387 Map.clear(); in TEST()
397 RetainedKnowledgeMap Map; in TEST() local
[all …]
|
| /llvm-project-15.0.7/libcxx/test/std/containers/associative/ |
| H A D | iterator_types.pass.cpp | 18 template <class Map, class ValueTp, class PtrT, class CPtrT>
20 typedef typename Map::difference_type Diff; in testMap()
22 typedef typename Map::iterator It; in testMap()
29 typedef typename Map::const_iterator It; in testMap()
55 typedef std::map<int, int> Map; in main() typedef
57 testMap<Map, ValueTp, ValueTp*, ValueTp const*>(); in main()
62 typedef std::map<int, int, std::less<int>, Alloc> Map; in main() typedef
63 testMap<Map, ValueTp, ValueTp*, ValueTp const*>(); in main()
74 typedef std::multimap<int, int> Map; in main() typedef
76 testMap<Map, ValueTp, ValueTp*, ValueTp const*>(); in main()
[all …]
|
| /llvm-project-15.0.7/llvm/include/llvm/ADT/ |
| H A D | MapVector.h | 38 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()
145 return Pos == Map.end()? 0 : 1; in count()
163 Map.erase(Pos); in pop_back()
175 Map.erase(Iterator->first); in erase()
182 for (auto &I : Map) { in erase()
215 Map.erase(I->first); in remove_if()
[all …]
|
| /llvm-project-15.0.7/bolt/lib/Profile/ |
| H A D | BoltAddressTranslation.cpp | 54 Map.insert( in writeEntriesForBB()
71 MapTy Map; in write() local
84 Map.clear(); in write()
101 MapTy &Map = MapEntry.second; in write() local
158 MapTy Map; in parse() local
203 const MapTy &Map = Iter->second; in translate() local
205 if (KeyVal == Map.begin()) in translate()
236 const MapTy &Map = Iter->second; in getFallthroughsInTrace() local
238 if (FromIter == Map.begin()) in getFallthroughsInTrace()
243 if (FromIter == Map.begin()) in getFallthroughsInTrace()
[all …]
|
| /llvm-project-15.0.7/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 …]
|
| /llvm-project-15.0.7/compiler-rt/lib/scudo/standalone/tests/ |
| H A D | bytemap_test.cpp | 16 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()
|
| /llvm-project-15.0.7/libcxx/test/std/containers/unord/ |
| H A D | iterator_difference_type.pass.cpp | 18 template <class Map, class ValueTp, class PtrT, class CPtrT>
20 typedef typename Map::difference_type Diff; in testUnorderedMap()
22 typedef typename Map::iterator It; in testUnorderedMap()
29 typedef typename Map::const_iterator It; in testUnorderedMap()
36 typedef typename Map::local_iterator It; in testUnorderedMap()
43 typedef typename Map::const_local_iterator It; in testUnorderedMap()
78 typedef std::unordered_map<int, int> Map; in main() typedef
80 testUnorderedMap<Map, ValueTp, ValueTp*, ValueTp const*>(); in main()
86 testUnorderedMap<Map, ValueTp, ValueTp*, ValueTp const*>(); in main()
97 typedef std::unordered_multimap<int, int> Map; in main() typedef
[all …]
|
| /llvm-project-15.0.7/llvm/unittests/Support/ |
| H A D | ReverseIterationTest.cpp | 36 DenseMap<int, int> Map; in TEST() local
41 Map[Key] = 0; in TEST()
49 for (auto Tuple : zip(Map, IterKeys)) in TEST()
54 for (auto iter = Map.begin(), end = Map.end(); iter != end; iter++, ++i) in TEST()
93 DenseMap<PtrLikeInt *, int> Map; in TEST() local
95 Map[Key] = Key->value; in TEST()
103 for (auto Tuple : zip(Map, Keys)) in TEST()
108 for (auto iter = Map.begin(), end = Map.end(); iter != end; iter++, ++i) in TEST()
|
| /llvm-project-15.0.7/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()
|
| /llvm-project-15.0.7/polly/lib/Support/ |
| H A D | ISLTools.cpp | 89 return Map.apply_range(ScatterRel); in beforeScatter()
107 return Map.apply_range(ScatterRel); in afterScatter()
166 if (Map.is_null()) in getNumScatterDims()
204 return Map.apply_domain(Swap); in reverseDomain()
242 isl::space Space = Map.get_space(); in shiftDim()
290 Map = isl::manage(isl_map_compute_divs(Map.copy())); in simplify()
291 Map = Map.detect_equalities(); in simplify()
292 Map = Map.coalesce(); in simplify()
529 auto MapSpace = Map.get_space(); in subtractParams()
531 return Map.subtract(ParamsMap); in subtractParams()
[all …]
|
| /llvm-project-15.0.7/libcxx/test/std/containers/unord/unord.set/ |
| H A D | incomplete.pass.cpp | 27 typedef std::unordered_set<A, MyHash<A> > Map; typedef
28 Map m;
29 Map::iterator it;
30 Map::const_iterator cit;
31 Map::local_iterator lit;
32 Map::const_local_iterator clit;
|
| /llvm-project-15.0.7/libcxx/test/std/containers/unord/unord.multiset/ |
| H A D | incomplete.pass.cpp | 27 typedef std::unordered_multiset<A, MyHash<A> > Map; typedef
28 Map m;
29 Map::iterator it;
30 Map::const_iterator cit;
31 Map::local_iterator lit;
32 Map::const_local_iterator clit;
|
| /llvm-project-15.0.7/libcxx/test/std/containers/unord/unord.multimap/ |
| H A D | incomplete.pass.cpp | 26 typedef std::unordered_multimap<A, A, MyHash<A> > Map; typedef
27 Map m;
28 Map::iterator it;
29 Map::const_iterator cit;
30 Map::local_iterator lit;
31 Map::const_local_iterator clit;
|