/external/llvm/lib/Transforms/Scalar/ |
LoopLoadElimination.cpp | 102 const StoreToLoadForwardingCandidate &Cand) { 103 OS << *Cand.Store << " -->\n"; 104 OS.indent(2) << *Cand.Load << "\n"; 230 for (const auto &Cand : Candidates) { 235 LoadToSingleCand.insert(std::make_pair(Cand.Load, &Cand)); 245 if (Cand.Store->getParent() == OtherCand->Store->getParent() && 246 Cand.isDependenceDistanceOfOne(PSE, L) && 249 if (getInstrIndex(OtherCand->Store) < getInstrIndex(Cand.Store)) 250 OtherCand = &Cand; [all...] |
/external/swiftshader/third_party/LLVM/lib/CodeGen/ |
RegAllocGreedy.cpp | 259 void growRegion(GlobalSplitCandidate &Cand); 778 void RAGreedy::growRegion(GlobalSplitCandidate &Cand) { 781 SmallVectorImpl<unsigned> &ActiveBlocks = Cand.ActiveBlocks; 814 if (Cand.PhysReg) 815 addThroughConstraints(Cand.Intf, NewBlocks); 835 bool RAGreedy::calcCompactRegion(GlobalSplitCandidate &Cand) { 841 Cand.reset(IntfCache, 0); 847 SpillPlacer->prepare(Cand.LiveBundles); 849 // The static split cost will be zero since Cand.Intf reports no interference. 851 if (!addSplitConstraints(Cand.Intf, Cost)) [all...] |
/external/llvm/lib/Target/AMDGPU/ |
SIMachineScheduler.cpp | 144 SISchedulerCandidate &Cand, 151 if (Cand.Reason > Reason) 152 Cand.Reason = Reason; 155 Cand.setRepeat(Reason); 161 SISchedulerCandidate &Cand, 168 if (Cand.Reason > Reason) 169 Cand.Reason = Reason; 172 Cand.setRepeat(Reason); 185 void SIScheduleBlock::traceCandidate(const SISchedCandidate &Cand) { 187 dbgs() << " SU(" << Cand.SU->NodeNum << ") " << getReasonStr(Cand.Reason) [all...] |
SIMachineScheduler.h | 199 void tryCandidateTopDown(SISchedCandidate &Cand, SISchedCandidate &TryCand); 200 void tryCandidateBottomUp(SISchedCandidate &Cand, SISchedCandidate &TryCand); 202 void traceCandidate(const SISchedCandidate &Cand); 382 bool tryCandidateLatency(SIBlockSchedCandidate &Cand, 384 bool tryCandidateRegUsage(SIBlockSchedCandidate &Cand,
|
/external/llvm/lib/CodeGen/ |
MachineScheduler.cpp | [all...] |
RegAllocGreedy.cpp | 352 void growRegion(GlobalSplitCandidate &Cand); [all...] |
/external/clang/lib/Sema/ |
SemaOverload.cpp | [all...] |
SemaLookup.cpp | [all...] |
/external/llvm/include/llvm/CodeGen/ |
MachineScheduler.h | 872 void traceCandidate(const SchedCandidate &Cand); 931 void initCandidate(SchedCandidate &Cand, SUnit *SU, bool AtTop, 935 void tryCandidate(SchedCandidate &Cand, [all...] |
/prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/CodeGen/ |
MachineScheduler.h | 872 void traceCandidate(const SchedCandidate &Cand); 938 void initCandidate(SchedCandidate &Cand, SUnit *SU, bool AtTop, 942 void tryCandidate(SchedCandidate &Cand, [all...] |
/prebuilts/clang/host/darwin-x86/clang-4393122/include/llvm/CodeGen/ |
MachineScheduler.h | 877 void traceCandidate(const SchedCandidate &Cand); 943 void initCandidate(SchedCandidate &Cand, SUnit *SU, bool AtTop, 947 void tryCandidate(SchedCandidate &Cand, [all...] |
/prebuilts/clang/host/darwin-x86/clang-4479392/include/llvm/CodeGen/ |
MachineScheduler.h | 877 void traceCandidate(const SchedCandidate &Cand); 943 void initCandidate(SchedCandidate &Cand, SUnit *SU, bool AtTop, 947 void tryCandidate(SchedCandidate &Cand, [all...] |
/prebuilts/clang/host/darwin-x86/clang-4579689/include/llvm/CodeGen/ |
MachineScheduler.h | 896 void traceCandidate(const SchedCandidate &Cand); 962 void initCandidate(SchedCandidate &Cand, SUnit *SU, bool AtTop, [all...] |
/prebuilts/clang/host/darwin-x86/clang-4630689/include/llvm/CodeGen/ |
MachineScheduler.h | 896 void traceCandidate(const SchedCandidate &Cand); 962 void initCandidate(SchedCandidate &Cand, SUnit *SU, bool AtTop, [all...] |
/prebuilts/clang/host/darwin-x86/clang-4639204/include/llvm/CodeGen/ |
MachineScheduler.h | 896 void traceCandidate(const SchedCandidate &Cand); 962 void initCandidate(SchedCandidate &Cand, SUnit *SU, bool AtTop, [all...] |
/prebuilts/clang/host/darwin-x86/clang-4691093/include/llvm/CodeGen/ |
MachineScheduler.h | 896 void traceCandidate(const SchedCandidate &Cand); 962 void initCandidate(SchedCandidate &Cand, SUnit *SU, bool AtTop, [all...] |
/prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/CodeGen/ |
MachineScheduler.h | 872 void traceCandidate(const SchedCandidate &Cand); 938 void initCandidate(SchedCandidate &Cand, SUnit *SU, bool AtTop, 942 void tryCandidate(SchedCandidate &Cand, [all...] |
/prebuilts/clang/host/linux-x86/clang-4393122/include/llvm/CodeGen/ |
MachineScheduler.h | 877 void traceCandidate(const SchedCandidate &Cand); 943 void initCandidate(SchedCandidate &Cand, SUnit *SU, bool AtTop, 947 void tryCandidate(SchedCandidate &Cand, [all...] |
/prebuilts/clang/host/linux-x86/clang-4479392/include/llvm/CodeGen/ |
MachineScheduler.h | 877 void traceCandidate(const SchedCandidate &Cand); 943 void initCandidate(SchedCandidate &Cand, SUnit *SU, bool AtTop, 947 void tryCandidate(SchedCandidate &Cand, [all...] |
/prebuilts/clang/host/linux-x86/clang-4579689/include/llvm/CodeGen/ |
MachineScheduler.h | 896 void traceCandidate(const SchedCandidate &Cand); 962 void initCandidate(SchedCandidate &Cand, SUnit *SU, bool AtTop, [all...] |
/prebuilts/clang/host/linux-x86/clang-4630689/include/llvm/CodeGen/ |
MachineScheduler.h | 896 void traceCandidate(const SchedCandidate &Cand); 962 void initCandidate(SchedCandidate &Cand, SUnit *SU, bool AtTop, [all...] |
/prebuilts/clang/host/linux-x86/clang-4639204/include/llvm/CodeGen/ |
MachineScheduler.h | 896 void traceCandidate(const SchedCandidate &Cand); 962 void initCandidate(SchedCandidate &Cand, SUnit *SU, bool AtTop, [all...] |
/prebuilts/clang/host/linux-x86/clang-4691093/include/llvm/CodeGen/ |
MachineScheduler.h | 896 void traceCandidate(const SchedCandidate &Cand); 962 void initCandidate(SchedCandidate &Cand, SUnit *SU, bool AtTop, [all...] |
/external/llvm/lib/Target/ARM/ |
ARMLoadStoreOptimizer.cpp | 162 MachineInstr *MergeOpsUpdate(const MergeCandidate &Cand); 814 MachineInstr *ARMLoadStoreOpt::MergeOpsUpdate(const MergeCandidate &Cand) { 815 const MachineInstr *First = Cand.Instrs.front(); 823 for (const MachineInstr *MI : Cand.Instrs) { 854 MachineInstr *LatestMI = Cand.Instrs[Cand.LatestMIIdx]; 864 if (Cand.CanMergeToLSDouble) 867 if (!Merged && Cand.CanMergeToLSMulti) 875 iterator EarliestI(Cand.Instrs[Cand.EarliestMIIdx]) [all...] |
/external/llvm/utils/TableGen/ |
CodeGenRegisters.cpp | 421 CodeGenRegister *Cand = const_cast<CodeGenRegister*>(Leads[i]); 423 if (Cand == this || getSubRegIndex(Cand)) 425 // Check if each component of Cand is already a sub-register. 429 assert(!Cand->ExplicitSubRegs.empty() && 431 for (unsigned j = 1, e = Cand->ExplicitSubRegs.size(); j != e; ++j) { 432 if (CodeGenSubRegIndex *Idx = getSubRegIndex(Cand->ExplicitSubRegs[j])) 440 // If some Cand sub-register is not part of this register, or if Cand only 445 // Each part of Cand is a sub-register of this. Make the full Cand als [all...] |