| /external/llvm/lib/CodeGen/ |
| StackColoring.cpp | 107 typedef DenseMap<const MachineBasicBlock*, BlockLifetimeInfo> LivenessMap;
111 DenseMap<const MachineBasicBlock*, int> BasicBlocks;
160 void remapInstructions(DenseMap<int, int> &SlotRemap);
172 void expungeSlotMap(DenseMap<int, int> &SlotRemap, unsigned NumSlots);
454 void StackColoring::remapInstructions(DenseMap<int, int> &SlotRemap) {
473 DenseMap<const AllocaInst*, const AllocaInst*> Allocas;
620 void StackColoring::expungeSlotMap(DenseMap<int, int> &SlotRemap,
704 DenseMap<int, int> SlotRemap;
|
| MachineLICM.cpp | 20 #include "llvm/ADT/DenseMap.h"
111 DenseMap<unsigned, std::vector<const MachineInstr*> > CSEMap;
186 bool CanCauseHighRegPressure(const DenseMap<unsigned, int> &Cost,
201 DenseMap<MachineDomTreeNode *, unsigned> &OpenChildren,
202 DenseMap<MachineDomTreeNode *, MachineDomTreeNode *> &ParentMap);
212 DenseMap<unsigned, int> calcRegisterCost(const MachineInstr *MI,
227 DenseMap<unsigned, std::vector<const MachineInstr *>>::iterator &CI);
608 DenseMap<MachineDomTreeNode*, unsigned> &OpenChildren,
609 DenseMap<MachineDomTreeNode*, MachineDomTreeNode*> &ParentMap) {
638 DenseMap<MachineDomTreeNode*, MachineDomTreeNode*> ParentMap
[all...] |
| TailDuplication.cpp | 77 DenseMap<unsigned, AvailableValsTy> SSAUpdateVals;
93 DenseMap<unsigned, unsigned> &LocalVRMap,
101 DenseMap<unsigned, unsigned> &LocalVRMap,
259 DenseMap<unsigned, AvailableValsTy>::iterator LI =
381 DenseMap<unsigned, AvailableValsTy>::iterator LI= SSAUpdateVals.find(OrigReg);
396 DenseMap<unsigned, unsigned> &LocalVRMap,
429 DenseMap<unsigned, unsigned> &LocalVRMap,
447 DenseMap<unsigned, unsigned>::iterator VI = LocalVRMap.find(Reg);
504 DenseMap<unsigned,AvailableValsTy>::iterator LI=SSAUpdateVals.find(Reg);
825 DenseMap<unsigned, unsigned> LocalVRMap
[all...] |
| /external/llvm/lib/Transforms/Utils/ |
| AddDiscriminators.cpp | 55 #include "llvm/ADT/DenseMap.h"
174 typedef DenseMap<const BasicBlock *, Metadata *> BBScopeMap;
175 typedef DenseMap<Location, BBScopeMap> LocationBBMap;
|
| BypassSlowDivision.cpp | 19 #include "llvm/ADT/DenseMap.h"
71 typedef DenseMap<DivOpInfo, DivPhiNodes> DivCacheTy;
225 const DenseMap<unsigned int, unsigned int> &BypassWidths) {
251 DenseMap<unsigned int, unsigned int>::const_iterator BI = BypassWidths.find(bitwidth);
|
| PromoteMemoryToRegister.cpp | 20 #include "llvm/ADT/DenseMap.h"
183 DenseMap<const Instruction *, unsigned> InstNumbers;
199 DenseMap<const Instruction *, unsigned>::iterator It = InstNumbers.find(I);
235 DenseMap<AllocaInst *, unsigned> AllocaLookup;
242 /// (BBNumbers), the DenseMap is more efficient (also supports removal).
243 DenseMap<std::pair<unsigned, unsigned>, PHINode *> NewPhiNodes;
247 DenseMap<PHINode *, unsigned> PhiToAllocaMap;
265 DenseMap<BasicBlock *, unsigned> BBNumbers;
268 DenseMap<const BasicBlock *, unsigned> BBNumPreds;
689 for (DenseMap<std::pair<unsigned, unsigned>, PHINode *>::iterato
[all...] |
| /external/llvm/utils/TableGen/ |
| CodeGenTarget.h | 68 mutable DenseMap<const Record*,
150 DenseMap<const Record*, std::unique_ptr<CodeGenInstruction>> &
|
| /external/clang/include/clang/Basic/ |
| PlistSupport.h | 19 typedef llvm::DenseMap<FileID, unsigned> FIDMap;
|
| /external/clang/include/clang/Edit/ |
| EditedSource.h | 15 #include "llvm/ADT/DenseMap.h"
44 llvm::DenseMap<unsigned, llvm::TinyPtrVector<IdentifierInfo*>>
|
| /external/clang/include/clang/Sema/ |
| ExternalSemaSource.h | 81 llvm::DenseMap<NamedDecl*, SourceLocation> &Undefined);
|
| /external/clang/lib/Analysis/ |
| CFGStmtMap.cpp | 15 #include "llvm/ADT/DenseMap.h"
22 typedef llvm::DenseMap<const Stmt*, CFGBlock*> SMap;
|
| /external/llvm/include/llvm/Analysis/ |
| AssumptionCache.h | 20 #include "llvm/ADT/DenseMap.h"
156 typedef DenseMap<FunctionCallbackVH, std::unique_ptr<AssumptionCache>,
|
| LazyCallGraph.h | 38 #include "llvm/ADT/DenseMap.h"
173 DenseMap<Function *, size_t> CalleeIndexMap;
469 DenseMap<const Function *, Node *> NodeMap;
479 DenseMap<Function *, size_t> EntryIndexMap;
485 DenseMap<Node *, SCC *> SCCMap;
|
| LoopAccessAnalysis.h | 254 DenseMap<Instruction *, unsigned> generateInstructionOrderMap() const {
255 DenseMap<Instruction *, unsigned> OrderMap;
278 DenseMap<MemAccessInfo, std::vector<unsigned> > Accesses;
699 DenseMap<Loop *, std::unique_ptr<LoopAccessInfo>> LoopAccessInfoMap;
|
| ScalarEvolution.h | 277 typedef DenseMap<const SCEV *, SmallVector<const SCEVPredicate *, 4>>
388 typedef DenseMap<SCEVCallbackVH, const SCEV *, DenseMapInfo<Value *> >
501 DenseMap<const Loop*, BackedgeTakenInfo> BackedgeTakenCounts;
507 DenseMap<PHINode*, Constant*> ConstantEvolutionLoopExitValue;
512 DenseMap<const SCEV *,
516 DenseMap<const SCEV *,
524 DenseMap<
533 DenseMap<const SCEV *, ConstantRange> UnsignedRanges;
536 DenseMap<const SCEV *, ConstantRange> SignedRanges;
544 DenseMap<const SCEV *, ConstantRange> &Cache
[all...] |
| /external/llvm/include/llvm/CodeGen/ |
| DFAPacketizer.h | 29 #include "llvm/ADT/DenseMap.h"
81 DenseMap<UnsignPair, unsigned> CachedTable;
|
| /external/clang/lib/ARCMigrate/ |
| TransZeroOutPropsInDealloc.cpp | 32 llvm::DenseMap<ObjCPropertyDecl*, ObjCPropertyImplDecl*> SynthesizedProperties;
58 for (llvm::DenseMap<ObjCPropertyDecl*, ObjCPropertyImplDecl*>::iterator
175 for (llvm::DenseMap<ObjCPropertyDecl*, ObjCPropertyImplDecl*>::iterator
|
| /external/clang/lib/CodeGen/ |
| CGVTT.cpp | 26 llvm::DenseMap<BaseSubobject, uint64_t> &AddressPoints) {
138 for (llvm::DenseMap<BaseSubobject, uint64_t>::const_iterator I =
165 for (llvm::DenseMap<BaseSubobject, uint64_t>::const_iterator I =
|
| /external/clang/lib/Frontend/ |
| LayoutOverrideSource.cpp | 158 llvm::DenseMap<const FieldDecl *, uint64_t> &FieldOffsets,
159 llvm::DenseMap<const CXXRecordDecl *, CharUnits> &BaseOffsets,
160 llvm::DenseMap<const CXXRecordDecl *, CharUnits> &VirtualBaseOffsets)
|
| /external/llvm/include/llvm/ADT/ |
| ScopedHashTable.h | 34 #include "llvm/ADT/DenseMap.h"
154 DenseMap<K, ValTy*, KInfo> TopLevelMap;
180 typename DenseMap<K, ValTy*, KInfo>::iterator I = TopLevelMap.find(Key);
196 typename DenseMap<K, ValTy*, KInfo>::iterator I =
|
| /external/llvm/lib/Target/Hexagon/ |
| HexagonPeephole.cpp | 40 #include "llvm/ADT/DenseMap.h"
119 DenseMap<unsigned, unsigned> PeepholeMap;
120 DenseMap<unsigned, std::pair<unsigned, unsigned> > PeepholeDoubleRegsMap;
225 DenseMap<unsigned, std::pair<unsigned, unsigned> >::iterator DI =
|
| /external/llvm/lib/Transforms/Scalar/ |
| LoadCombine.cpp | 15 #include "llvm/ADT/DenseMap.h"
77 bool combineLoads(DenseMap<const Value *, SmallVector<LoadPOPPair, 8>> &);
111 DenseMap<const Value *, SmallVector<LoadPOPPair, 8>> &LoadMap) {
233 DenseMap<const Value *, SmallVector<LoadPOPPair, 8>> LoadMap;
|
| SCCP.cpp | 21 #include "llvm/ADT/DenseMap.h"
161 DenseMap<Value*, LatticeVal> ValueState; // The state each value is in.
166 DenseMap<std::pair<Value*, unsigned>, LatticeVal> StructValueState;
172 DenseMap<GlobalVariable*, LatticeVal> TrackedGlobals;
177 DenseMap<Function*, LatticeVal> TrackedRetVals;
181 DenseMap<std::pair<Function*, unsigned>, LatticeVal> TrackedMultipleRetVals;
272 DenseMap<Value*, LatticeVal>::const_iterator I = ValueState.find(V);
279 const DenseMap<Function*, LatticeVal> &getTrackedRetVals() {
285 const DenseMap<GlobalVariable*, LatticeVal> &getTrackedGlobals() {
373 std::pair<DenseMap<Value*, LatticeVal>::iterator, bool> I
[all...] |
| /frameworks/compile/mclinker/lib/Target/Mips/ |
| MipsGOT.h | 16 #include <llvm/ADT/DenseMap.h>
156 typedef llvm::DenseMap<const ResolveInfo*, bool> SymbolUniqueMapType;
183 typedef llvm::DenseMap<const LDSymbol*, unsigned> SymbolOrderMapType;
|
| /external/llvm/unittests/ADT/ |
| DenseMapTest.cpp | 1 //===- llvm/unittest/ADT/DenseMapMap.cpp - DenseMap unit tests --*- C++ -*-===//
11 #include "llvm/ADT/DenseMap.h"
101 typedef ::testing::Types<DenseMap<uint32_t, uint32_t>,
102 DenseMap<uint32_t *, uint32_t *>,
103 DenseMap<CtorTester, CtorTester, CtorTesterMapInfo>,
342 // Make sure DenseMap works with StringRef keys.
344 DenseMap<StringRef, int> M;
386 DenseMap<unsigned, unsigned, TestDenseMapInfo> map;
|
