Searched refs:Map (Results 1 - 25 of 144) sorted by relevance

123456

/freebsd-11-stable/contrib/llvm-project/llvm/lib/CodeGen/
H A DMachineModuleInfoImpls.cpp35 DenseMap<MCSymbol *, MachineModuleInfoImpl::StubValueTy> &Map) {
36 MachineModuleInfoImpl::SymbolListTy List(Map.begin(), Map.end());
40 Map.clear();
34 getSortedStubs( DenseMap<MCSymbol *, MachineModuleInfoImpl::StubValueTy> &Map) argument
/freebsd-11-stable/contrib/llvm-project/clang/lib/StaticAnalyzer/Core/
H A DFunctionSummary.cpp20 for (const auto &I : Map)
27 for (const auto &I : Map)
H A DDynamicType.cpp122 ProgramStateRef removeDead(ProgramStateRef State, const MapTy &Map, argument
124 for (const auto &Elem : Map)
144 const DynamicTypeMapTy &Map = State->get<DynamicTypeMap>(); local
145 if (Map.isEmpty()) {
152 for (DynamicTypeMapTy::iterator I = Map.begin(); I != Map.end(); ++I) {
166 if (std::next(I) != Map.end())
180 const DynamicCastMapTy &Map = State->get<DynamicCastMap>(); local
181 if (Map.isEmpty()) {
188 for (DynamicCastMapTy::iterator I = Map
[all...]
/freebsd-11-stable/contrib/llvm-project/clang/include/clang/AST/
H A DDeclLookups.h79 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-11-stable/contrib/llvm-project/clang/include/clang/StaticAnalyzer/Core/PathSensitive/
H A DFunctionSummary.h58 MapTy Map;
62 MapTy::iterator I = Map.find(D);
63 if (I != Map.end())
68 I = Map.insert(KVPair(D, FunctionSummary())).first;
69 assert(I != Map.end());
90 MapTy::const_iterator I = Map.find(D);
91 if (I != Map.end() && I->second.InlineChecked)
108 MapTy::const_iterator I = Map.find(D);
109 if (I != Map.end())
115 MapTy::const_iterator I = Map
[all...]
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/ObjCARC/
H A DBlotMapVector.h23 /// 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-11-stable/contrib/llvm-project/compiler-rt/lib/fuzzer/
H A DFuzzerValueBitMap.h27 void Reset() { memset(Map, 0, sizeof(Map)); }
36 uintptr_t Old = Map[WordIdx];
38 Map[WordIdx] = New;
51 return Map[WordIdx] & (1ULL << BitIdx);
60 if (uintptr_t M = Map[i])
67 ATTRIBUTE_ALIGNED(512) uintptr_t Map[kMapSizeInWords];
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/IR/
H A DValueMap.h93 MapT Map;
104 : Map(NumInitBuckets), Data() {}
106 : Map(NumInitBuckets), Data(Data) {}
135 inline iterator begin() { return iterator(Map.begin()); }
136 inline iterator end() { return iterator(Map.end()); }
137 inline const_iterator begin() const { return const_iterator(Map.begin()); }
138 inline const_iterator end() const { return const_iterator(Map.end()); }
140 bool empty() const { return Map.empty(); }
141 size_type size() const { return Map.size(); }
144 void resize(size_t Size) { Map
250 ValueMapCallbackVH(KeyT Key, ValueMapT *Map) argument
[all...]
/freebsd-11-stable/contrib/llvm-project/llvm/utils/TableGen/
H A DInfoByHwMode.h68 InfoByHwMode(const MapType &M) : Map(M) {}
71 iterator begin() { return Map.begin(); }
73 iterator end() { return Map.end(); }
75 const_iterator begin() const { return Map.begin(); }
77 const_iterator end() const { return Map.end(); }
79 bool empty() const { return Map.empty(); }
82 bool hasMode(unsigned M) const { return Map.find(M) != Map.end(); }
89 Map.insert({Mode, Map
117 MapType Map; member in struct:llvm::InfoByHwMode
[all...]
H A DInfoByHwMode.cpp35 auto I = Map.insert({P.first, MVT(llvm::getValueType(P.second))});
54 return Map == T.Map;
60 return Map < T.Map;
64 auto F = Map.find(Mode);
65 if (F != Map.end())
69 auto D = Map.find(DefaultMode);
70 if (D != Map.end())
71 return Map
[all...]
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/ADT/
H A DUniqueVector.h31 // 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 DMapVector.h1 //===- llvm/ADT/MapVector.h - Map w/ deterministic value order --*- C++ -*-===//
38 MapType Map; member in class:llvm::MapVector
43 "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...]
/freebsd-11-stable/contrib/llvm-project/clang/lib/Serialization/
H A DModuleFile.cpp34 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-11-stable/contrib/llvm-project/clang/lib/AST/Interp/
H A DPointer.cpp142 InitMap *Map = getInitMap();
143 if (!Map)
145 if (Map == (InitMap *)-1)
147 return Map->isInitialized(getIndex());
160 InitMap *&Map = getInitMap(); local
161 if (Map == (InitMap *)-1)
163 if (Map == nullptr)
164 Map = InitMap::allocate(Desc->getNumElems());
165 if (Map->initialize(getIndex())) {
166 free(Map);
[all...]
/freebsd-11-stable/contrib/llvm-project/lldb/include/lldb/Utility/
H A DUserIDResolver.h43 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-11-stable/contrib/llvm-project/llvm/include/llvm/CodeGen/
H A DRDFRegisters.h37 IndexedSet() { Map.reserve(N); }
40 // Index Idx corresponds to Map[Idx-1].
41 assert(Idx != 0 && !Map.empty() && Idx-1 < Map.size());
42 return Map[Idx-1];
47 auto F = llvm::find(Map, Val);
48 if (F != Map.end())
49 return F - Map.begin() + 1;
50 Map.push_back(Val);
51 return Map
68 std::vector<T> Map; member in struct:llvm::rdf::IndexedSet
[all...]
/freebsd-11-stable/contrib/llvm-project/clang/include/clang/Lex/
H A DDirectoryLookup.h44 /// Map - This is the HeaderMap if this is a headermap lookup.
46 const HeaderMap *Map; member in union:clang::DirectoryLookup::DLU
49 DLU(const HeaderMap *Map) : Map(Map) {} argument
75 /// This ctor *does not take ownership* of 'Map'.
76 DirectoryLookup(const HeaderMap *Map, SrcMgr::CharacteristicKind DT, argument
78 : u(Map), DirCharacteristic(DT), LookupType(LT_HeaderMap),
108 return isHeaderMap() ? u.Map : nullptr;
/freebsd-11-stable/contrib/llvm-project/compiler-rt/lib/scudo/standalone/
H A Dbytemap.h21 Map = reinterpret_cast<u8 *>(map(nullptr, Size, "scudo:bytemap"));
25 void unmapTestOnly() { unmap(reinterpret_cast<void *>(Map), Size); }
29 DCHECK_EQ(0U, Map[Index]);
30 Map[Index] = Value;
34 return Map[Index];
41 u8 *Map; member in class:scudo::FlatByteMap
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/DebugInfo/PDB/Native/
H A DHashTable.h43 HashTableIterator(const HashTable<ValueT> &Map, uint32_t Index, argument
45 : Map(&Map), Index(Index), IsEnd(IsEnd) {}
48 HashTableIterator(const HashTable<ValueT> &Map) : Map(&Map) { argument
49 int I = Map.Present.find_first();
61 Map = R.Map;
70 return (Map
97 const HashTable<ValueT> *Map; member in class:llvm::pdb::HashTableIterator
[all...]
/freebsd-11-stable/contrib/llvm-project/clang/include/clang/Tooling/Transformer/
H A DMatchConsumer.h50 auto &Map = Result.Nodes.getMap();
51 return (Map.find(ID) != Map.end() ? TrueC : FalseC)(Result);
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/SystemZ/MCTargetDesc/
H A DSystemZMCTargetDesc.cpp128 static unsigned Map[SystemZ::NUM_TARGET_REGS]; local
132 Map[GR32Regs[I]] = I;
133 Map[GRH32Regs[I]] = I;
134 Map[GR64Regs[I]] = I;
135 Map[GR128Regs[I]] = I;
136 Map[FP128Regs[I]] = I;
137 Map[AR32Regs[I]] = I;
140 Map[VR32Regs[I]] = I;
141 Map[VR64Regs[I]] = I;
142 Map[VR128Reg
[all...]
/freebsd-11-stable/contrib/llvm-project/llvm/lib/BinaryFormat/
H A DMsgPackDocument.cpp44 auto ItAndInserted = Map->insert(Entry);
116 case Type::Map:
134 auto &Map = Stack.back().Node.getMap(); local
137 Stack.back().MapEntry = &Map[Node];
148 case msgpack::Type::Map:
192 case Type::Map:
217 if (Stack.back().Node.getKind() == Type::Map) {
229 if (Stack.back().Node.getKind() == Type::Map) {
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/BinaryFormat/
H A DMsgPackDocument.h61 MapTy *Map; member in union:llvm::msgpack::DocNode::__anon1746
68 bool isMap() const { return getKind() == Type::Map; }
137 if (getKind() != Type::Map) {
200 MapDocNode(DocNode &N) : DocNode(N) { assert(getKind() == Type::Map); }
202 // Map access methods.
203 size_t size() const { return Map->size(); }
205 MapTy::iterator begin() { return Map->begin(); }
206 MapTy::iterator end() { return Map->end(); }
207 MapTy::iterator find(DocNode Key) { return Map->find(Key); }
332 /// Create an empty Map nod
[all...]
/freebsd-11-stable/contrib/llvm-project/llvm/lib/XRay/
H A DInstrumentationMap.cpp1 //===- InstrumentationMap.cpp - XRay Instrumentation Map ------------------===//
58 InstrumentationMap Map; local
226 InstrumentationMap Map; local
249 if (auto E = loadYAML(*FdOrErr, FileSize, Filename, Map.Sleds,
250 Map.FunctionAddresses, Map.FunctionIds))
252 } else if (auto E = loadObj(Filename, *ObjectFileOrError, Map.Sleds,
253 Map.FunctionAddresses, Map.FunctionIds)) {
256 return Map;
[all...]
/freebsd-11-stable/contrib/llvm-project/llvm/tools/llvm-xray/
H A Dxray-extract.cpp1 //===- xray-extract.cpp: XRay Instrumentation Map Extraction --------------===//
51 void exportAsYAML(const InstrumentationMap &Map, raw_ostream &OS, argument
55 auto Sleds = Map.sleds();
58 auto FuncId = Map.getFunctionId(Sled.Function);

Completed in 359 milliseconds

123456