Home
last modified time | relevance | path

Searched refs:Cand (Results 1 – 25 of 27) sorted by relevance

12

/netbsd-src/external/apache2/llvm/dist/llvm/lib/Target/PowerPC/
H A DPPCMachineScheduler.cpp24 static bool isADDIInstr(const GenericScheduler::SchedCandidate &Cand) { in isADDIInstr() argument
25 return Cand.SU->getInstr()->getOpcode() == PPC::ADDI || in isADDIInstr()
26 Cand.SU->getInstr()->getOpcode() == PPC::ADDI8; in isADDIInstr()
29 bool PPCPreRASchedStrategy::biasAddiLoadCandidate(SchedCandidate &Cand, in biasAddiLoadCandidate() argument
35 SchedCandidate &FirstCand = Zone.isTop() ? TryCand : Cand; in biasAddiLoadCandidate()
36 SchedCandidate &SecondCand = Zone.isTop() ? Cand : TryCand; in biasAddiLoadCandidate()
49 void PPCPreRASchedStrategy::tryCandidate(SchedCandidate &Cand, in tryCandidate() argument
55 if (!Cand.isValid()) { in tryCandidate()
62 biasPhysReg(Cand.SU, Cand.AtTop), TryCand, Cand, PhysReg)) in tryCandidate()
67 tryPressure(TryCand.RPDelta.Excess, Cand.RPDelta.Excess, TryCand, Cand, in tryCandidate()
[all …]
H A DPPCBranchCoalescing.cpp155 bool canCoalesceBranch(CoalescingCandidateInfo &Cand);
234 bool PPCBranchCoalescing::canCoalesceBranch(CoalescingCandidateInfo &Cand) { in canCoalesceBranch() argument
236 << Cand.BranchBlock->getNumber() << " can be coalesced:"); in canCoalesceBranch()
239 if (TII->analyzeBranch(*Cand.BranchBlock, Cand.BranchTargetBlock, FalseMBB, in canCoalesceBranch()
240 Cand.Cond)) { in canCoalesceBranch()
245 for (auto &I : Cand.BranchBlock->terminators()) { in canCoalesceBranch()
270 if (Cand.BranchBlock->isEHPad() || Cand.BranchBlock->hasEHPadSuccessor()) { in canCoalesceBranch()
275 if (Cand.BranchBlock->mayHaveInlineAsmBr()) { in canCoalesceBranch()
282 if (!Cand.BranchTargetBlock || FalseMBB || in canCoalesceBranch()
283 !Cand.BranchBlock->isSuccessor(Cand.BranchTargetBlock)) { in canCoalesceBranch()
[all …]
H A DPPCMachineScheduler.h26 void tryCandidate(SchedCandidate &Cand, SchedCandidate &TryCand,
29 bool biasAddiLoadCandidate(SchedCandidate &Cand,
46 void tryCandidate(SchedCandidate &Cand, SchedCandidate &TryCand) override;
47 bool biasAddiCandidate(SchedCandidate &Cand, SchedCandidate &TryCand) const;
/netbsd-src/external/apache2/llvm/dist/llvm/lib/Transforms/Scalar/
H A DLoopLoadElimination.cpp135 const StoreToLoadForwardingCandidate &Cand) { in operator <<() argument
136 OS << *Cand.Store << " -->\n"; in operator <<()
137 OS.indent(2) << *Cand.Load << "\n"; in operator <<()
266 for (const auto &Cand : Candidates) { in removeDependencesFromMultipleStores() local
271 LoadToSingleCand.insert(std::make_pair(Cand.Load, &Cand)); in removeDependencesFromMultipleStores()
281 if (Cand.Store->getParent() == OtherCand->Store->getParent() && in removeDependencesFromMultipleStores()
282 Cand.isDependenceDistanceOfOne(PSE, L) && in removeDependencesFromMultipleStores()
285 if (getInstrIndex(OtherCand->Store) < getInstrIndex(Cand.Store)) in removeDependencesFromMultipleStores()
286 OtherCand = &Cand; in removeDependencesFromMultipleStores()
292 Candidates.remove_if([&](const StoreToLoadForwardingCandidate &Cand) { in removeDependencesFromMultipleStores() argument
[all …]
H A DGVNSink.cpp752 SinkingInstructionCandidate Cand; in analyzeInstructionForSinking() local
753 Cand.NumInstructions = ++InstNum; in analyzeInstructionForSinking()
754 Cand.NumMemoryInsts = MemoryInstNum; in analyzeInstructionForSinking()
755 Cand.NumBlocks = ActivePreds.size(); in analyzeInstructionForSinking()
756 Cand.NumPHIs = NeededPHIs.size(); in analyzeInstructionForSinking()
757 append_range(Cand.Blocks, ActivePreds); in analyzeInstructionForSinking()
759 return Cand; in analyzeInstructionForSinking()
795 auto Cand = analyzeInstructionForSinking(LRI, InstNum, MemoryInstNum, in sinkBB() local
797 if (!Cand) in sinkBB()
799 Cand->calculateCost(NumOrigPHIs, Preds.size()); in sinkBB()
[all …]
H A DConstantHoisting.cpp384 ConstPtrUnionType Cand = ConstInt; in collectConstantCandidates() local
385 std::tie(Itr, Inserted) = ConstCandMap.insert(std::make_pair(Cand, 0)); in collectConstantCandidates()
434 ConstPtrUnionType Cand = ConstExpr; in collectConstantCandidates() local
435 std::tie(Itr, Inserted) = ConstCandMap.insert(std::make_pair(Cand, 0)); in collectConstantCandidates()
/netbsd-src/external/apache2/llvm/dist/llvm/lib/CodeGen/
H A DMachineScheduler.cpp2766 void GenericSchedulerBase::traceCandidate(const SchedCandidate &Cand) { in traceCandidate() argument
2770 switch (Cand.Reason) { in traceCandidate()
2774 P = Cand.RPDelta.Excess; in traceCandidate()
2777 P = Cand.RPDelta.CriticalMax; in traceCandidate()
2780 P = Cand.RPDelta.CurrentMax; in traceCandidate()
2783 ResIdx = Cand.Policy.ReduceResIdx; in traceCandidate()
2786 ResIdx = Cand.Policy.DemandResIdx; in traceCandidate()
2789 Latency = Cand.SU->getDepth(); in traceCandidate()
2792 Latency = Cand.SU->getHeight(); in traceCandidate()
2795 Latency = Cand.SU->getHeight(); in traceCandidate()
[all …]
H A DRegAllocGreedy.cpp458 bool growRegion(GlobalSplitCandidate &Cand);
459 bool splitCanCauseEvictionChain(Register Evictee, GlobalSplitCandidate &Cand,
463 GlobalSplitCandidate &Cand, unsigned BBNumber,
1355 bool RAGreedy::growRegion(GlobalSplitCandidate &Cand) { in growRegion() argument
1358 SmallVectorImpl<unsigned> &ActiveBlocks = Cand.ActiveBlocks; in growRegion()
1388 if (Cand.PhysReg) { in growRegion()
1389 if (!addThroughConstraints(Cand.Intf, NewBlocks)) in growRegion()
1411 bool RAGreedy::calcCompactRegion(GlobalSplitCandidate &Cand) { in calcCompactRegion() argument
1417 Cand.reset(IntfCache, MCRegister::NoRegister); in calcCompactRegion()
1423 SpillPlacer->prepare(Cand.LiveBundles); in calcCompactRegion()
[all …]
H A DMachineOutliner.cpp679 for (auto &Cand : OF.Candidates) { in createOutlinedFunction() local
681 MachineBasicBlock &OutlineBB = *Cand.front()->getParent(); in createOutlinedFunction()
685 reverse(make_range(Cand.front(), OutlineBB.end()))) in createOutlinedFunction()
/netbsd-src/external/apache2/llvm/dist/llvm/lib/Target/AMDGPU/
H A DSIMachineScheduler.cpp142 SISchedulerCandidate &Cand, in tryLess() argument
149 if (Cand.Reason > Reason) in tryLess()
150 Cand.Reason = Reason; in tryLess()
153 Cand.setRepeat(Reason); in tryLess()
159 SISchedulerCandidate &Cand, in tryGreater() argument
166 if (Cand.Reason > Reason) in tryGreater()
167 Cand.Reason = Reason; in tryGreater()
170 Cand.setRepeat(Reason); in tryGreater()
184 void SIScheduleBlock::traceCandidate(const SISchedCandidate &Cand) { in traceCandidate() argument
186 dbgs() << " SU(" << Cand.SU->NodeNum << ") " << getReasonStr(Cand.Reason); in traceCandidate()
[all …]
H A DGCNSchedStrategy.cpp57 void GCNMaxOccupancySchedStrategy::initCandidate(SchedCandidate &Cand, SUnit *SU, in initCandidate() argument
63 Cand.SU = SU; in initCandidate()
64 Cand.AtTop = AtTop; in initCandidate()
108 Cand.RPDelta.Excess = PressureChange(AMDGPU::RegisterPressureSets::VGPR_32); in initCandidate()
109 Cand.RPDelta.Excess.setUnitInc(NewVGPRPressure - VGPRExcessLimit); in initCandidate()
114 Cand.RPDelta.Excess = PressureChange(AMDGPU::RegisterPressureSets::SReg_32); in initCandidate()
115 Cand.RPDelta.Excess.setUnitInc(NewSGPRPressure - SGPRExcessLimit); in initCandidate()
129 Cand.RPDelta.CriticalMax = in initCandidate()
131 Cand.RPDelta.CriticalMax.setUnitInc(SGPRDelta); in initCandidate()
133 Cand.RPDelta.CriticalMax = in initCandidate()
[all …]
H A DSIMachineScheduler.h203 void tryCandidateTopDown(SISchedCandidate &Cand, SISchedCandidate &TryCand);
204 void tryCandidateBottomUp(SISchedCandidate &Cand, SISchedCandidate &TryCand);
206 void traceCandidate(const SISchedCandidate &Cand);
387 bool tryCandidateLatency(SIBlockSchedCandidate &Cand,
389 bool tryCandidateRegUsage(SIBlockSchedCandidate &Cand,
H A DGCNSchedStrategy.h36 SchedCandidate &Cand);
38 void initCandidate(SchedCandidate &Cand, SUnit *SU,
H A DGCNMinRegStrategy.cpp123 auto &Cand = *I++; in findMax() local
124 RQ.remove(Cand); in findMax()
125 RQ.push_front(Cand); in findMax()
/netbsd-src/external/apache2/llvm/dist/clang/lib/Sema/
H A DSemaOverload.cpp1382 for (OverloadCandidateSet::iterator Cand = Conversions.begin(); in TryUserDefinedConversion() local
1383 Cand != Conversions.end(); ++Cand) in TryUserDefinedConversion()
1384 if (Cand->Best) in TryUserDefinedConversion()
1385 ICS.Ambiguous.addConversion(Cand->FoundDecl, Cand->Function); in TryUserDefinedConversion()
4709 for (OverloadCandidateSet::iterator Cand = CandidateSet.begin(); in FindConversionForRefInit() local
4710 Cand != CandidateSet.end(); ++Cand) in FindConversionForRefInit()
4711 if (Cand->Best) in FindConversionForRefInit()
4712 ICS.Ambiguous.addConversion(Cand->FoundDecl, Cand->Function); in FindConversionForRefInit()
9335 for (OverloadCandidateSet::iterator Cand = CandidateSet.begin(), in AddArgumentDependentLookupCandidates() local
9337 Cand != CandEnd; ++Cand) in AddArgumentDependentLookupCandidates()
[all …]
/netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/CodeGen/
H A DMachineScheduler.h919 void traceCandidate(const SchedCandidate &Cand);
930 GenericSchedulerBase::SchedCandidate &Cand,
934 GenericSchedulerBase::SchedCandidate &Cand,
937 GenericSchedulerBase::SchedCandidate &Cand,
942 GenericSchedulerBase::SchedCandidate &Cand,
1011 void initCandidate(SchedCandidate &Cand, SUnit *SU, bool AtTop,
1015 virtual void tryCandidate(SchedCandidate &Cand, SchedCandidate &TryCand,
1078 virtual void tryCandidate(SchedCandidate &Cand, SchedCandidate &TryCand);
1080 void pickNodeFromQueue(SchedCandidate &Cand);
/netbsd-src/external/apache2/llvm/dist/clang/lib/Driver/ToolChains/
H A DAMDGPU.cpp39 RocmInstallationDetector::findSPACKPackage(const Candidate &Cand, in findSPACKPackage() argument
41 if (!Cand.isSPACK()) in findSPACKPackage()
44 std::string Prefix = Twine(PackageName + "-" + Cand.SPACKReleaseStr).str(); in findSPACKPackage()
46 for (llvm::vfs::directory_iterator File = D.getVFS().dir_begin(Cand.Path, EC), in findSPACKPackage()
57 auto PackagePath = Cand.Path; in findSPACKPackage()
62 llvm::errs() << "SPACK package " << Prefix << " not found at " << Cand.Path in findSPACKPackage()
68 llvm::errs() << "Cannot use SPACK package " << Prefix << " at " << Cand.Path in findSPACKPackage()
179 for (auto Cand : ROCmSearchDirs) { in getInstallationPathCandidates() local
181 if (Cand.isSPACK()) in getInstallationPathCandidates()
182 llvm::errs() << " (Spack " << Cand.SPACKReleaseStr << ")"; in getInstallationPathCandidates()
[all …]
H A DROCm.h130 llvm::SmallString<0> findSPACKPackage(const Candidate &Cand,
/netbsd-src/external/apache2/llvm/dist/llvm/lib/Analysis/
H A DIRSimilarityIdentifier.cpp924 for (IRSimilarityCandidate &Cand : CandVec) { in run()
925 OS << " Function: " << Cand.front()->Inst->getFunction()->getName().str() in run()
927 if (Cand.front()->Inst->getParent()->getName().str() == "") in run()
930 OS << Cand.front()->Inst->getParent()->getName().str(); in run()
932 Cand.frontInstruction()->print(OS); in run()
934 Cand.backInstruction()->print(OS); in run()
/netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/ProfileData/
H A DSampleProf.h811 StringRef Cand(FnName);
818 auto It = Cand.rfind(Suffix);
821 auto Dit = Cand.rfind('.');
823 Cand = Cand.substr(0, It);
825 return Cand;
/netbsd-src/external/apache2/llvm/dist/llvm/lib/Transforms/IPO/
H A DPartialInlining.cpp688 BasicBlock *Cand = OutliningInfo->NonReturnBlock; in computeOutliningInfo() local
689 if (succ_size(Cand) != 2) in computeOutliningInfo()
692 if (HasNonEntryPred(Cand)) in computeOutliningInfo()
695 BasicBlock *Succ1 = *succ_begin(Cand); in computeOutliningInfo()
696 BasicBlock *Succ2 = *(succ_begin(Cand) + 1); in computeOutliningInfo()
703 if (NonReturnBlock->getSinglePredecessor() != Cand) in computeOutliningInfo()
707 OutliningInfo->Entries.push_back(Cand); in computeOutliningInfo()
709 OutliningInfo->ReturnBlockPreds.push_back(Cand); in computeOutliningInfo()
710 Entries.insert(Cand); in computeOutliningInfo()
/netbsd-src/external/apache2/llvm/dist/llvm/lib/Transforms/Instrumentation/
H A DInstrProfiling.cpp282 for (auto &Cand : LoopToCandidates[&L]) { in run() local
286 Value *InitVal = ConstantInt::get(Cand.first->getType(), 0); in run()
290 auto *BB = Cand.first->getParent(); in run()
302 PGOCounterPromoterHelper Promoter(Cand.first, Cand.second, SSA, InitVal, in run()
305 Promoter.run(SmallVector<Instruction *, 2>({Cand.first, Cand.second})); in run()
H A DPGOInstrumentation.cpp867 populateEHOperandBundle(VPCandidateInfo &Cand, in populateEHOperandBundle() argument
870 auto *OrigCall = dyn_cast<CallBase>(Cand.AnnotatedInst); in populateEHOperandBundle()
948 for (VPCandidateInfo Cand : FuncInfo.ValueSites[Kind]) { in instrumentOneFunc() local
952 IRBuilder<> Builder(Cand.InsertPt); in instrumentOneFunc()
953 assert(Builder.GetInsertPoint() != Cand.InsertPt->getParent()->end() && in instrumentOneFunc()
957 if (Cand.V->getType()->isIntegerTy()) in instrumentOneFunc()
958 ToProfile = Builder.CreateZExtOrTrunc(Cand.V, Builder.getInt64Ty()); in instrumentOneFunc()
959 else if (Cand.V->getType()->isPointerTy()) in instrumentOneFunc()
960 ToProfile = Builder.CreatePtrToInt(Cand.V, Builder.getInt64Ty()); in instrumentOneFunc()
964 populateEHOperandBundle(Cand, BlockColors, OpBundles); in instrumentOneFunc()
/netbsd-src/external/apache2/llvm/dist/llvm/lib/Target/ARM/
H A DARMLoadStoreOptimizer.cpp187 MachineInstr *MergeOpsUpdate(const MergeCandidate &Cand);
858 MachineInstr *ARMLoadStoreOpt::MergeOpsUpdate(const MergeCandidate &Cand) { in MergeOpsUpdate() argument
859 const MachineInstr *First = Cand.Instrs.front(); in MergeOpsUpdate()
867 for (const MachineInstr *MI : Cand.Instrs) { in MergeOpsUpdate()
899 MachineInstr *LatestMI = Cand.Instrs[Cand.LatestMIIdx]; in MergeOpsUpdate()
909 if (Cand.CanMergeToLSDouble) in MergeOpsUpdate()
912 Cand.Instrs); in MergeOpsUpdate()
913 if (!Merged && Cand.CanMergeToLSMulti) in MergeOpsUpdate()
915 Opcode, Pred, PredReg, DL, Regs, Cand.Instrs); in MergeOpsUpdate()
921 iterator EarliestI(Cand.Instrs[Cand.EarliestMIIdx]); in MergeOpsUpdate()
[all …]
/netbsd-src/external/apache2/llvm/dist/llvm/utils/TableGen/
H A DCodeGenRegisters.cpp479 CodeGenRegister *Cand = const_cast<CodeGenRegister*>(Leads[i]); in computeSecondarySubRegs() local
481 if (Cand == this || getSubRegIndex(Cand)) in computeSecondarySubRegs()
484 assert(!Cand->ExplicitSubRegs.empty() && in computeSecondarySubRegs()
486 if (Cand->ExplicitSubRegs.size() == 1) in computeSecondarySubRegs()
491 assert(Cand->ExplicitSubRegs[0] == SubReg && "LeadingSuperRegs correct"); in computeSecondarySubRegs()
493 for (CodeGenRegister *SubReg : Cand->ExplicitSubRegs) { in computeSecondarySubRegs()
514 std::make_pair(Concat, Cand); in computeSecondarySubRegs()
522 SubReg2Idx.insert(std::make_pair(Cand, Concat)); in computeSecondarySubRegs()

12