/external/llvm/unittests/IR/ |
H A D | ValueMapTest.cpp | 273 static void onRAUW(ExtraData Map, KeyT Old, KeyT New) { argument 274 (*Map)->erase(Old); 276 static void onDelete(ExtraData Map, KeyT Old) { argument 277 (*Map)->erase(Old); 284 // Now the ModifyingConfig can modify the Map inside a callback.
|
/external/llvm/unittests/Support/ |
H A D | CommandLineTest.cpp | 79 StringMap<cl::Option*> Map; local 80 cl::getRegisteredOptions(Map); 82 ASSERT_TRUE(Map.count("test-option") == 1) << 85 cl::Option *Retrieved = Map["test-option"];
|
/external/llvm/utils/TableGen/ |
H A D | CodeGenRegisters.cpp | 236 // Map explicit sub-registers first, so the names take precedence. 248 const SubRegMap &Map = SR->computeSubRegs(RegBank); local 250 for (SubRegMap::const_iterator SI = Map.begin(), SE = Map.end(); SI != SE; 266 const SubRegMap &Map = SR->computeSubRegs(RegBank); local 272 SubRegMap::const_iterator SRI = Map.find(I->first); 273 if (SRI == Map.end()) 304 const SubRegMap &Map = SR->computeSubRegs(RegBank); local 305 for (SubRegMap::const_iterator SI = Map.begin(), SE = Map [all...] |
H A D | RegisterInfoEmitter.cpp | 605 const CodeGenSubRegIndex::CompMap &Map = Idx->getComposites(); local 607 I = Map.begin(), E = Map.end(); I != E; ++I) { 615 I = Map.begin(), E = Map.end(); I != E; ++I) 644 // Map each Sub-register index to a compatible table row.
|
/external/lzma/CPP/Windows/ |
H A D | FileMapping.h | 39 LPVOID Map(DWORD desiredAccess, UInt64 fileOffset, SIZE_T numberOfBytesToMap)
function in class:NWindows::CFileMapping 45 LPVOID Map(DWORD desiredAccess, UInt64 fileOffset, SIZE_T numberOfBytesToMap, LPVOID baseAddress)
function in class:NWindows::CFileMapping
|
/external/llvm/tools/yaml2obj/ |
H A D | yaml2elf.cpp | 61 StringMap<int> Map; member in class:__anon26427::NameToIdxMap 65 StringMapEntry<int> &Entry = Map.GetOrCreateValue(Name, -1); 73 StringMap<int>::const_iterator I = Map.find(Name); 74 if (I == Map.end())
|
/external/llvm/include/llvm/ADT/ |
H A D | MapVector.h | 1 //===- llvm/ADT/MapVector.h - Map w/ deterministic value order --*- C++ -*-===// 34 MapType Map; member in class:llvm::MapVector 71 Map.clear(); 77 std::pair<typename MapType::iterator, bool> Result = Map.insert(Pair); 87 typename MapType::const_iterator Pos = Map.find(Key); 88 return Pos == Map.end()? ValueT() : Vector[Pos->second].second; 93 std::pair<typename MapType::iterator, bool> Result = Map.insert(Pair); 104 typename MapType::const_iterator Pos = Map.find(Key); 105 return Pos == Map.end()? 0 : 1; 109 typename MapType::const_iterator Pos = Map [all...] |
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 43 unsigned &Val = Map[Entry]; 60 typename std::map<T, unsigned>::const_iterator MI = Map.find(Entry); 63 if (MI != Map.end()) return MI->second; 99 Map.clear();
|
/external/llvm/include/llvm/Analysis/ |
H A D | ScalarEvolutionExpressions.h | 637 /// the SCEVUnknown components following the Map (Value -> Value). 642 ValueToValueMap &Map, 644 SCEVParameterRewriter Rewriter(SE, Map, InterpretConsts); 649 : SE(S), Map(M), InterpretConsts(C) {} 712 if (Map.count(V)) { 713 Value *NV = Map[V]; 727 ValueToValueMap ⤅ member in struct:llvm::SCEVParameterRewriter 734 /// the Map (Loop -> SCEV) to all AddRecExprs. 738 static const SCEV *rewrite(const SCEV *Scev, LoopToScevMapT &Map, argument 740 SCEVApplyRewriter Rewriter(SE, Map); 641 rewrite(const SCEV *Scev, ScalarEvolution &SE, ValueToValueMap &Map, bool InterpretConsts = false) argument 823 LoopToScevMapT ⤅ member in struct:llvm::SCEVApplyRewriter 827 apply(const SCEV *Scev, LoopToScevMapT &Map, ScalarEvolution &SE) argument [all...] |
/external/llvm/include/llvm/CodeGen/ |
H A D | LiveIntervalUnion.h | 77 typedef LiveSegments Map; typedef in class:llvm::LiveIntervalUnion 78 const Map &getMap() { return Segments; }
|
/external/llvm/include/llvm/IR/ |
H A D | ValueMap.h | 82 MapT Map; member in class:llvm::ValueMap 93 : Map(NumInitBuckets), Data() {} 95 : Map(NumInitBuckets), Data(Data) {} 101 inline iterator begin() { return iterator(Map.begin()); } 102 inline iterator end() { return iterator(Map.end()); } 103 inline const_iterator begin() const { return const_iterator(Map.begin()); } 104 inline const_iterator end() const { return const_iterator(Map.end()); } 106 bool empty() const { return Map.empty(); } 107 size_type size() const { return Map.size(); } 110 void resize(size_t Size) { Map 206 ValueMapT *Map; member in class:llvm::ValueMapCallbackVH 208 ValueMapCallbackVH(KeyT Key, ValueMapT *Map) argument [all...] |
/external/llvm/include/llvm/MC/ |
H A D | MCRegisterInfo.h | 269 void mapLLVMRegsToDwarfRegs(const DwarfLLVMRegPair *Map, unsigned Size, argument 272 EHL2DwarfRegs = Map; 275 L2DwarfRegs = Map; 283 void mapDwarfRegsToLLVMRegs(const DwarfLLVMRegPair *Map, unsigned Size, argument 286 EHDwarf2LRegs = Map; 289 Dwarf2LRegs = Map; 377 /// \brief Map a target register to an equivalent dwarf register 383 /// \brief Map a dwarf register back to a target register. 386 /// \brief Map a target register to an equivalent SEH register
|
/external/llvm/lib/Bitcode/Writer/ |
H A D | ValueEnumerator.cpp | 149 void ValueEnumerator::print(raw_ostream &OS, const ValueMapType &Map, argument 152 OS << "Map Name: " << Name << "\n"; 153 OS << "Size: " << Map.size() << "\n"; 154 for (ValueMapType::const_iterator I = Map.begin(), 155 E = Map.end(); I != E; ++I) {
|
/external/llvm/lib/CodeGen/ |
H A D | MachineModuleInfo.cpp | 37 MMIAddrLabelMap *Map; member in class:llvm::MMIAddrLabelMapCallbackPtr 39 MMIAddrLabelMapCallbackPtr() : Map(nullptr) {} 40 MMIAddrLabelMapCallbackPtr(Value *V) : CallbackVH(V), Map(nullptr) {} 46 void setMap(MMIAddrLabelMap *map) { Map = map; } 243 Map->UpdateForDeletedBlock(cast<BasicBlock>(getValPtr())); 247 Map->UpdateForRAUWBlock(cast<BasicBlock>(getValPtr()), cast<BasicBlock>(V2)); 502 /// setCallSiteLandingPad - Map the landing pad's EH symbol to the call site
|
/external/llvm/lib/DebugInfo/ |
H A D | DWARFContext.cpp | 700 RelocAddrMap *Map = StringSwitch<RelocAddrMap*>(RelSecName) local 706 if (!Map) { 710 Map = &TypesSections[*RelocatedSection].Relocs; 712 Map = &TypesDWOSections[*RelocatedSection].Relocs; 761 Map->insert(std::make_pair(Address, std::make_pair(R.Width, R.Value)));
|
/external/llvm/lib/ExecutionEngine/ |
H A D | ExecutionEngine.cpp | 171 DEBUG(dbgs() << "JIT: Map \'" << GV->getName() 206 ExecutionEngineState::GlobalAddressMapTy &Map = local 213 void *&CurVal = Map[GV];
|
/external/llvm/lib/ExecutionEngine/JIT/ |
H A D | JITEmitter.cpp | 226 /// Map a stub address to a specific instance of a JITResolver so that 230 std::map<void*, JITResolver*> Map; member in class:__anon25847::StubToResolverMapTy 232 /// Guards Map from concurrent accesses. 239 Map.insert(std::make_pair(Stub, Resolver)); 244 Map.erase(Stub); 253 std::map<void*, JITResolver*>::const_iterator I = Map.upper_bound(Stub); 254 assert(I != Map.begin() && "This is not a known stub!"); 262 for (std::map<void*, JITResolver*>::const_iterator I = Map.begin(), 263 E = Map.end(); I != E; ++I) { 838 DEBUG(dbgs() << "JIT: Map \'" << M [all...] |
/external/llvm/lib/IR/ |
H A D | ConstantsContext.h | 513 /// Map - This is the main map from the element descriptor to the Constants. 516 MapTy Map; member in class:llvm::ConstantUniqueMap 519 /// from the constants to their element in Map. This is important for 525 typename MapTy::iterator map_begin() { return Map.begin(); } 526 typename MapTy::iterator map_end() { return Map.end(); } 529 for (typename MapTy::iterator I=Map.begin(), E=Map.end(); 544 std::pair<typename MapTy::iterator, bool> IP = Map.insert(InsertVal); 553 assert(IMI != InverseMap.end() && IMI->second != Map.end() && 560 Map 692 MapTy Map; member in class:llvm::ConstantAggrUniqueMap [all...] |
H A D | DebugInfo.cpp | 959 DITypeIdentifierMap Map; local 969 // Try to insert (TypeId, Ty) to Map. 971 Map.insert(std::make_pair(TypeId, Ty)); 972 // If TypeId already exists in Map and this is a definition, replace 979 return Map;
|
/external/llvm/lib/MC/ |
H A D | WinCOFFObjectWriter.cpp | 108 map Map; member in class:__anon25894::StringTable 279 map::iterator i = Map.find(String); 281 if (i != Map.end()) 291 Map[String] = Offset;
|
/external/llvm/lib/Support/ |
H A D | CommandLine.cpp | 1801 void cl::getRegisteredOptions(StringMap<Option*> &Map) argument 1806 assert(Map.size() == 0 && "StringMap must be empty"); 1807 GetOptionInfo(PositionalOpts, SinkOpts, Map);
|
H A D | Timer.cpp | 200 StringMap<std::pair<TimerGroup*, Name2TimerMap> > Map; member in class:__anon25920::Name2PairMap 204 I = Map.begin(), E = Map.end(); I != E; ++I) 211 std::pair<TimerGroup*, Name2TimerMap> &GroupEntry = Map[GroupName];
|
/external/llvm/lib/Target/SystemZ/MCTargetDesc/ |
H A D | SystemZMCTargetDesc.cpp | 80 static unsigned Map[SystemZ::NUM_TARGET_REGS]; local 84 Map[GR32Regs[I]] = I; 85 Map[GRH32Regs[I]] = I; 86 Map[GR64Regs[I]] = I; 87 Map[GR128Regs[I]] = I; 88 Map[FP32Regs[I]] = I; 89 Map[FP64Regs[I]] = I; 90 Map[FP128Regs[I]] = I; 94 return Map[Reg];
|
/external/llvm/lib/Target/SystemZ/ |
H A D | SystemZISelLowering.cpp | 484 // Map maps 0-based register numbers to LLVM register numbers. 487 const TargetRegisterClass *RC, const unsigned *Map) { 492 if (Index < 16 && Map[Index]) 493 return std::make_pair(Map[Index], RC); 486 parseRegisterNumber(const std::string &Constraint, const TargetRegisterClass *RC, const unsigned *Map) argument
|
/external/llvm/lib/Transforms/ObjCARC/ |
H A D | ObjCARCOpts.cpp | 56 /// Map keys to indices in Vector. 58 MapTy Map; member in class:__anon26262::MapVector 74 assert(Vector.size() >= Map.size()); // May differ due to blotting. 75 for (typename MapTy::const_iterator I = Map.begin(), E = Map.end(); 83 (Map.count(I->first) && 84 Map[I->first] == size_t(I - Vector.begin()))); 90 Map.insert(std::make_pair(Arg, size_t(0))); 103 Map.insert(std::make_pair(InsertPair.first, size_t(0))); 114 typename MapTy::iterator It = Map [all...] |