| /netbsd-src/external/apache2/llvm/dist/libcxx/benchmarks/ |
| H A D | map.bench.cpp | 115 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 …]
|
| /netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/IR/ |
| H A D | ValueMap.h | 93 MapT Map; variable
104 : Map(NumInitBuckets), Data() {} in Map() function
106 : Map(NumInitBuckets), Data(Data) {} in Map() function
135 inline iterator begin() { return iterator(Map.begin()); } in begin()
136 inline iterator end() { return iterator(Map.end()); } in end()
137 inline const_iterator begin() const { return const_iterator(Map.begin()); } in begin()
138 inline const_iterator end() const { return const_iterator(Map.end()); } in end()
140 bool empty() const { return Map.empty(); } in empty()
141 size_type size() const { return Map.size(); } in size()
144 void resize(size_t Size) { Map.resize(Size); } in resize()
[all …]
|
| /netbsd-src/external/apache2/llvm/dist/llvm/utils/TableGen/ |
| H A D | InfoByHwMode.h | 67 InfoByHwMode(const MapType &M) : Map(M) {} in InfoByHwMode()
70 iterator begin() { return Map.begin(); } in begin()
72 iterator end() { return Map.end(); } in end()
74 const_iterator begin() const { return Map.begin(); } in begin()
76 const_iterator end() const { return Map.end(); } in end()
78 bool empty() const { return Map.empty(); } in empty()
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()
[all …]
|
| H A D | InfoByHwMode.cpp | 35 auto I = Map.insert({P.first, MVT(llvm::getValueType(P.second))}); in ValueTypeByHwMode()
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()
71 return Map.insert(std::make_pair(Mode, D->second)).first->second; in getOrCreateTypeForMode()
73 return Map.insert(std::make_pair(Mode, Type)).first->second; in getOrCreateTypeForMode()
89 for (const auto &P : Map) in writeToStream()
[all …]
|
| /netbsd-src/regress/sys/uvm/pdsim/ |
| H A D | nbsd.hs | 35 import qualified Data.Map as Map
64 pglookup idx m = Map.lookup idx m
71 clrrefm x m = Map.update (Just . clrref) x m
73 reactivate :: (Pageq,Map.Map Int Page) -> (Pageq,Map.Map Int Page)
87 reclaim :: Int -> (Pageq,Map.Map Int Page)->(Pageq,Map.Map Int Page)
92 (q { inactive = npgl },Map.delete x m)
96 Just p = Map.lookup x m0
106 Just p = Map.lookup x m
109 inacttarg = div (Map.size m * inactpct) 100
111 pgref :: Int->Map.Map Int Page -> Map.Map Int Page
[all …]
|
| H A D | renumber.hs | 32 import qualified Data.Map as Map
35 renumber next t (k:ks) = case Map.lookup k t of
37 Nothing -> next:renumber (next + 1) (Map.insert k next t) ks
38 renum first = renumber first Map.empty
|
| /netbsd-src/external/apache2/llvm/dist/llvm/lib/Transforms/ObjCARC/ |
| H A D | BlotMapVector.h | 25 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 …]
|
| /netbsd-src/external/apache2/llvm/dist/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()
100 std::pair<typename MapType::iterator, bool> Result = Map.insert(Pair);
113 typename MapType::const_iterator Pos = Map.find(Key); in lookup()
114 return Pos == Map.end()? ValueT() : Vector[Pos->second].second; in lookup()
119 std::pair<typename MapType::iterator, bool> Result = Map.insert(Pair); in insert()
132 std::pair<typename MapType::iterator, bool> Result = Map.insert(Pair); in insert()
[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()
|
| /netbsd-src/external/apache2/llvm/dist/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()
68 I = Map.insert(KVPair(D, FunctionSummary())).first; in findOrInsertSummary()
69 assert(I != Map.end()); in findOrInsertSummary()
90 MapTy::const_iterator I = Map.find(D); in mayInline()
91 if (I != Map.end() && I->second.InlineChecked) 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()
[all …]
|
| /netbsd-src/external/gpl3/binutils.old/dist/gprofng/src/ |
| H A D | IntervalMap.h | 36 class IntervalMap : public Map<Key_t, Value_t>
44 Value_t get (Key_t key, typename Map<Key_t, Value_t>::Relation rel);
130 return get (key, Map<Key_t, Value_t>::REL_EQ); in get()
135 IntervalMap<Key_t, Value_t>::get (Key_t key, typename Map<Key_t, Value_t>::Relation rel) in get()
146 case Map<Key_t, Value_t>::REL_LT: in get()
152 case Map<Key_t, Value_t>::REL_GT: in get()
158 case Map<Key_t, Value_t>::REL_LE: in get()
159 case Map<Key_t, Value_t>::REL_GE: in get()
160 case Map<Key_t, Value_t>::REL_EQ: in get()
172 case Map<Key_t, Value_t>::REL_LT: in get()
[all …]
|
| H A D | DefaultMap2D.h | 51 Map<Key1_t, Map<Key2_t, Value_t>*> *map1;
52 Vector<Map<Key2_t, Value_t>*> *map2list;
59 map1 = new DefaultMap<Key1_t, Map<Key2_t, Value_t>*>; in DefaultMap2D()
60 map2list = new Vector<Map<Key2_t, Value_t>*>; in DefaultMap2D()
68 map1 = new DefaultMap<Key1_t, Map<Key2_t, Value_t>*>; in DefaultMap2D()
69 map2list = new Vector<Map<Key2_t, Value_t>*>; in DefaultMap2D()
84 Map<Key2_t, Value_t> *map2 = map1->get (key1); in put()
101 Map<Key2_t, Value_t> *map2 = map1->get (key1); in get()
112 Map<Key2_t, Value_t> *map2 = map1->get (key1); in get()
115 typename Map<Key2_t, Value_t>::Relation rel2; in get()
|
| /netbsd-src/external/gpl3/binutils/dist/gprofng/src/ |
| H A D | IntervalMap.h | 36 class IntervalMap : public Map<Key_t, Value_t>
44 Value_t get (Key_t key, typename Map<Key_t, Value_t>::Relation rel);
130 return get (key, Map<Key_t, Value_t>::REL_EQ); in get()
135 IntervalMap<Key_t, Value_t>::get (Key_t key, typename Map<Key_t, Value_t>::Relation rel) in get()
146 case Map<Key_t, Value_t>::REL_LT: in get()
152 case Map<Key_t, Value_t>::REL_GT: in get()
158 case Map<Key_t, Value_t>::REL_LE: in get()
159 case Map<Key_t, Value_t>::REL_GE: in get()
160 case Map<Key_t, Value_t>::REL_EQ: in get()
172 case Map<Key_t, Value_t>::REL_LT: in get()
[all …]
|
| H A D | DefaultMap2D.h | 51 Map<Key1_t, Map<Key2_t, Value_t>*> *map1;
52 Vector<Map<Key2_t, Value_t>*> *map2list;
59 map1 = new DefaultMap<Key1_t, Map<Key2_t, Value_t>*>; in DefaultMap2D()
60 map2list = new Vector<Map<Key2_t, Value_t>*>; in DefaultMap2D()
68 map1 = new DefaultMap<Key1_t, Map<Key2_t, Value_t>*>; in DefaultMap2D()
69 map2list = new Vector<Map<Key2_t, Value_t>*>; in DefaultMap2D()
84 Map<Key2_t, Value_t> *map2 = map1->get (key1); in put()
101 Map<Key2_t, Value_t> *map2 = map1->get (key1); in get()
112 Map<Key2_t, Value_t> *map2 = map1->get (key1); in get()
115 typename Map<Key2_t, Value_t>::Relation rel2; in get()
|
| /netbsd-src/external/apache2/llvm/dist/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()
|
| /netbsd-src/external/apache2/llvm/dist/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()
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 …]
|
| /netbsd-src/external/apache2/llvm/dist/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 …]
|
| /netbsd-src/external/apache2/llvm/dist/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 …]
|
| /netbsd-src/sys/external/bsd/compiler_rt/dist/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] & (1UL << BitIdx); in Get()
61 if (uintptr_t M = Map[i]) in ForEach()
68 uintptr_t Map[kMapSizeInWords] __attribute__((aligned(512)));
|
| /netbsd-src/external/apache2/llvm/dist/clang/lib/AST/ |
| H A D | DeclBase.cpp | 1374 StoredDeclsMap *Map; in SetNoExternalVisibleDeclsForName() local
1375 if (!(Map = DC->LookupPtr)) in SetNoExternalVisibleDeclsForName()
1376 Map = DC->CreateStoredDeclsMap(Context); in SetNoExternalVisibleDeclsForName()
1380 (*Map)[Name].removeExternalDecls(); in SetNoExternalVisibleDeclsForName()
1390 StoredDeclsMap *Map; in SetExternalVisibleDeclsForName() local
1391 if (!(Map = DC->LookupPtr)) in SetExternalVisibleDeclsForName()
1392 Map = DC->CreateStoredDeclsMap(Context); in SetExternalVisibleDeclsForName()
1396 StoredDeclsList &List = (*Map)[Name]; in SetExternalVisibleDeclsForName()
1505 StoredDeclsMap *Map = DC->getPrimaryContext()->LookupPtr; in removeDecl() local
1506 if (Map) { in removeDecl()
[all …]
|
| /netbsd-src/external/apache2/llvm/dist/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()
|
| /netbsd-src/usr.sbin/ypserv/yptest/ |
| H A D | yptest.c | 52 const char *Map = "passwd.byname"; in main() local
71 Status = yp_match(Domain, Map, Key, KeyLen, &Value, &ValLen); in main()
78 Status = yp_first(Domain, Map, &Key2, &KeyLen, &Value, &ValLen); in main()
87 Status = yp_next(Domain, Map, Key2, KeyLen, &Key2, in main()
97 Status = yp_master(Domain, Map, &Key2); in main()
104 Status = yp_order(Domain, Map, &Order); in main()
127 Status = yp_all(Domain, Map, &Callback); in main()
|
| /netbsd-src/external/apache2/llvm/dist/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) {
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 …]
|
| /netbsd-src/external/gpl3/gcc/dist/gcc/ |
| H A D | hash-map-tests.cc | 194 typedef hash_map <void *, val_t> Map; in test_map_of_type_with_ctor_and_dtor() typedef
198 Map m; in test_map_of_type_with_ctor_and_dtor()
209 Map m; in test_map_of_type_with_ctor_and_dtor()
218 Map m1; in test_map_of_type_with_ctor_and_dtor()
225 Map m2 (m1); in test_map_of_type_with_ctor_and_dtor()
239 Map m1; in test_map_of_type_with_ctor_and_dtor()
246 Map m2; in test_map_of_type_with_ctor_and_dtor()
261 Map m; in test_map_of_type_with_ctor_and_dtor()
272 Map m; in test_map_of_type_with_ctor_and_dtor()
297 Map m (N_init); in test_map_of_type_with_ctor_and_dtor()
[all …]
|
| /netbsd-src/external/apache2/llvm/dist/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 …]
|