Home
last modified time | relevance | path

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

12

/freebsd-14.2/contrib/llvm-project/llvm/lib/Target/PowerPC/
H A DPPCMachineScheduler.cpp55 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()
93 Zone->getLatencyStallCycles(Cand.SU), TryCand, Cand, Stall)) in tryCandidate()
108 Cand.SU == CandNextClusterSU, TryCand, Cand, Cluster)) in tryCandidate()
114 getWeakLeft(Cand.SU, Cand.AtTop), TryCand, Cand, Weak)) in tryCandidate()
131 Cand.ResDelta.DemandedResources, TryCand, Cand, in tryCandidate()
182 if (!Cand.isValid()) { in tryCandidate()
189 Top.getLatencyStallCycles(Cand.SU), TryCand, Cand, Stall)) in tryCandidate()
202 Cand.ResDelta.DemandedResources, TryCand, Cand, in tryCandidate()
[all …]
H A DPPCBranchCoalescing.cpp238 if (TII->analyzeBranch(*Cand.BranchBlock, Cand.BranchTargetBlock, FalseMBB, in canCoalesceBranch()
239 Cand.Cond)) { in canCoalesceBranch()
269 if (Cand.BranchBlock->isEHPad() || Cand.BranchBlock->hasEHPadSuccessor()) { in canCoalesceBranch()
281 if (!Cand.BranchTargetBlock || FalseMBB || in canCoalesceBranch()
282 !Cand.BranchBlock->isSuccessor(Cand.BranchTargetBlock)) { in canCoalesceBranch()
288 if (Cand.BranchBlock->succ_size() != 2) { in canCoalesceBranch()
294 assert(Cand.BranchBlock->canFallThrough() && in canCoalesceBranch()
301 (*Cand.BranchBlock->succ_begin() == Cand.BranchTargetBlock) in canCoalesceBranch()
302 ? *Cand.BranchBlock->succ_rbegin() in canCoalesceBranch()
303 : *Cand.BranchBlock->succ_begin(); in canCoalesceBranch()
[all …]
H A DPPCMachineScheduler.h26 bool tryCandidate(SchedCandidate &Cand, SchedCandidate &TryCand,
30 bool biasAddiLoadCandidate(SchedCandidate &Cand,
47 bool tryCandidate(SchedCandidate &Cand, SchedCandidate &TryCand) override;
48 bool biasAddiCandidate(SchedCandidate &Cand, SchedCandidate &TryCand) const;
/freebsd-14.2/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DLoopLoadElimination.cpp140 OS << *Cand.Store << " -->\n"; in operator <<()
141 OS.indent(2) << *Cand.Load << "\n"; in operator <<()
273 for (const auto &Cand : Candidates) { in removeDependencesFromMultipleStores() local
278 LoadToSingleCand.insert(std::make_pair(Cand.Load, &Cand)); in removeDependencesFromMultipleStores()
293 OtherCand = &Cand; in removeDependencesFromMultipleStores()
300 if (LoadToSingleCand[Cand.Load] != &Cand) { in removeDependencesFromMultipleStores()
303 << Cand in removeDependencesFromMultipleStores()
466 Cand.Load->replaceAllUsesWith(PHI); in propagateStoredValueToLoadUsers()
521 if (isLoadConditional(Cand.Load, L)) in processLoop()
535 Candidates.push_back(Cand); in processLoop()
[all …]
H A DTLSVariableHoist.cpp149 static bool oneUseOutsideLoop(tlshoist::TLSCandidate &Cand, LoopInfo *LI) { in oneUseOutsideLoop() argument
150 if (Cand.Users.size() != 1) in oneUseOutsideLoop()
153 BasicBlock *BB = Cand.Users[0].Inst->getParent(); in oneUseOutsideLoop()
195 tlshoist::TLSCandidate &Cand = TLSCandMap[GV]; in findInsertPos() local
200 for (auto &User : Cand.Users) { in findInsertPos()
231 tlshoist::TLSCandidate &Cand = TLSCandMap[GV]; in tryReplaceTLSCandidate() local
234 if (oneUseOutsideLoop(Cand, LI)) in tryReplaceTLSCandidate()
241 for (auto &User : Cand.Users) in tryReplaceTLSCandidate()
H A DGVNSink.cpp755 SinkingInstructionCandidate Cand; in analyzeInstructionForSinking() local
756 Cand.NumInstructions = ++InstNum; in analyzeInstructionForSinking()
757 Cand.NumMemoryInsts = MemoryInstNum; in analyzeInstructionForSinking()
758 Cand.NumBlocks = ActivePreds.size(); in analyzeInstructionForSinking()
759 Cand.NumPHIs = NeededPHIs.size(); in analyzeInstructionForSinking()
760 append_range(Cand.Blocks, ActivePreds); in analyzeInstructionForSinking()
762 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 DRewriteStatepointsForGC.cpp2430 if (Cand->user_empty()) in rematerializeLiveValuesAtUses()
2433 if (Cand->hasOneUse()) in rematerializeLiveValuesAtUses()
2439 if (llvm::any_of(Cand->users(), in rematerializeLiveValuesAtUses()
2452 Records, [Cand](const auto &R) { return R.LiveSet.contains(Cand); }); in rematerializeLiveValuesAtUses()
2453 unsigned NumUses = Cand->getNumUses(); in rematerializeLiveValuesAtUses()
2492 while (!Cand->user_empty()) { in rematerializeLiveValuesAtUses()
2499 LiveValuesToBeDeleted.push_back(Cand); in rematerializeLiveValuesAtUses()
2504 for (auto *Cand : LiveValuesToBeDeleted) { in rematerializeLiveValuesAtUses() local
2506 RematerizationCandidates.erase(Cand); in rematerializeLiveValuesAtUses()
2508 assert(!R.LiveSet.contains(Cand) || in rematerializeLiveValuesAtUses()
[all …]
/freebsd-14.2/contrib/llvm-project/llvm/lib/Target/AMDGPU/
H A DSIMachineScheduler.cpp150 Cand.Reason = Reason; in tryLess()
153 Cand.setRepeat(Reason); in tryLess()
170 Cand.setRepeat(Reason); in tryGreater()
186 dbgs() << " SU(" << Cand.SU->NodeNum << ") " << getReasonStr(Cand.Reason); in traceCandidate()
194 if (!Cand.isValid()) { in tryCandidateTopDown()
1528 if (!Cand.isValid()) { in tryCandidateLatency()
1535 Cand.LastPosHighLatParentScheduled, TryCand, Cand, Latency)) in tryCandidateLatency()
1553 if (!Cand.isValid()) { in tryCandidateRegUsage()
1565 if (SISched::tryGreater(TryCand.Height, Cand.Height, TryCand, Cand, Depth)) in tryCandidateRegUsage()
1598 Cand.Block = nullptr; in pickBlock()
[all …]
H A DGCNSchedStrategy.cpp125 Cand.SU = SU; in initCandidate()
126 Cand.AtTop = AtTop; in initCandidate()
311 IsTopNode = Cand.AtTop; in pickNodeBidirectional()
312 return Cand.SU; in pickNodeBidirectional()
403 if (!Cand.isValid()) { in tryCandidate()
410 tryPressure(TryCand.RPDelta.Excess, Cand.RPDelta.Excess, TryCand, Cand, in tryCandidate()
416 biasPhysReg(Cand.SU, Cand.AtTop), TryCand, Cand, PhysReg)) in tryCandidate()
423 Zone->getLatencyStallCycles(Cand.SU), TryCand, Cand, Stall)) in tryCandidate()
432 Cand.ResDelta.DemandedResources, TryCand, Cand, in tryCandidate()
442 getWeakLeft(Cand.SU, Cand.AtTop), TryCand, Cand, Weak)) in tryCandidate()
[all …]
H A DSIMachineScheduler.h202 void tryCandidateTopDown(SISchedCandidate &Cand, SISchedCandidate &TryCand);
203 void tryCandidateBottomUp(SISchedCandidate &Cand, SISchedCandidate &TryCand);
205 void traceCandidate(const SISchedCandidate &Cand);
386 bool tryCandidateLatency(SIBlockSchedCandidate &Cand,
388 bool tryCandidateRegUsage(SIBlockSchedCandidate &Cand,
H A DGCNMinRegStrategy.cpp123 auto &Cand = *I++; in findMax() local
124 RQ.remove(Cand); in findMax()
125 RQ.push_front(Cand); in findMax()
H A DGCNSchedStrategy.h48 SchedCandidate &Cand);
50 void initCandidate(SchedCandidate &Cand, SUnit *SU,
132 bool tryCandidate(SchedCandidate &Cand, SchedCandidate &TryCand,
/freebsd-14.2/contrib/llvm-project/llvm/lib/CodeGen/
H A DMachineScheduler.cpp3204 tracePick(Cand.Reason, Cand.AtTop); in tracePick()
3448 Cand.SU = SU; in initCandidate()
3449 Cand.AtTop = AtTop; in initCandidate()
3454 Cand.RPDelta, in initCandidate()
3462 Cand.RPDelta, in initCandidate()
3503 biasPhysReg(Cand.SU, Cand.AtTop), TryCand, Cand, PhysReg)) in tryCandidate()
3558 getWeakLeft(Cand.SU, Cand.AtTop), in tryCandidate()
3701 tracePick(Cand); in pickNodeBidirectional()
3702 return Cand.SU; in pickNodeBidirectional()
3870 Top.getLatencyStallCycles(Cand.SU), TryCand, Cand, Stall)) in tryCandidate()
[all …]
H A DRegAllocGreedy.cpp767 if (Cand.PhysReg) { in growRegion()
829 if (!growRegion(Cand)) { in calcCompactRegion()
836 if (!Cand.LiveBundles.any()) { in calcCompactRegion()
949 IntvIn = Cand.IntvIdx; in splitAroundRegion()
951 IntfIn = Cand.Intf.first(); in splitAroundRegion()
958 IntvOut = Cand.IntvIdx; in splitAroundRegion()
997 IntvIn = Cand.IntvIdx; in splitAroundRegion()
1005 IntvOut = Cand.IntvIdx; in splitAroundRegion()
1124 Cand.reset(IntfCache, PhysReg); in calculateRegionSplitCostAroundReg()
1144 if (!growRegion(Cand)) { in calculateRegionSplitCostAroundReg()
[all …]
/freebsd-14.2/contrib/llvm-project/llvm/lib/Target/AArch64/
H A DAArch64MachineScheduler.cpp61 bool AArch64PostRASchedStrategy::tryCandidate(SchedCandidate &Cand, in tryCandidate() argument
63 bool OriginalResult = PostGenericScheduler::tryCandidate(Cand, TryCand); in tryCandidate()
65 if (Cand.isValid()) { in tryCandidate()
67 MachineInstr *Instr1 = Cand.SU->getInstr(); in tryCandidate()
H A DAArch64MachineScheduler.h27 bool tryCandidate(SchedCandidate &Cand, SchedCandidate &TryCand) override;
/freebsd-14.2/contrib/llvm-project/clang/lib/Sema/
H A DSemaOverload.cpp1598 Cand != Conversions.end(); ++Cand) in TryUserDefinedConversion()
4984 Cand != CandidateSet.end(); ++Cand) in FindConversionForRefInit()
9963 Cand != CandEnd; ++Cand) in AddArgumentDependentLookupCandidates()
10674 [](OverloadCandidate &Cand) { return &Cand; }); in BestViableFunction() argument
10692 return Cand->Viable && Cand->Function && in BestViableFunction()
10699 return Cand->Viable && Cand->Function && in BestViableFunction()
10740 if (Cand->Viable && !Cand->Best && in BestViableFunction()
12372 for (iterator Cand = begin(), LastCand = end(); Cand != LastCand; ++Cand) { in CompleteCandidates() local
12378 if (!Cand->Function && !Cand->IsSurrogate) { in CompleteCandidates()
12573 for (iterator Cand = begin(), LastCand = end(); Cand != LastCand; ++Cand) { in NoteCandidates() local
[all …]
/freebsd-14.2/contrib/llvm-project/llvm/include/llvm/CodeGen/
H A DMachineScheduler.h1178 void traceCandidate(const SchedCandidate &Cand);
1189 GenericSchedulerBase::SchedCandidate &Cand,
1193 GenericSchedulerBase::SchedCandidate &Cand,
1196 GenericSchedulerBase::SchedCandidate &Cand,
1201 GenericSchedulerBase::SchedCandidate &Cand,
1270 void initCandidate(SchedCandidate &Cand, SUnit *SU, bool AtTop,
1274 virtual bool tryCandidate(SchedCandidate &Cand, SchedCandidate &TryCand,
1337 virtual bool tryCandidate(SchedCandidate &Cand, SchedCandidate &TryCand);
1339 void pickNodeFromQueue(SchedCandidate &Cand);
/freebsd-14.2/contrib/llvm-project/clang/lib/Driver/ToolChains/
H A DAMDGPU.cpp41 RocmInstallationDetector::findSPACKPackage(const Candidate &Cand, in findSPACKPackage() argument
43 if (!Cand.isSPACK()) in findSPACKPackage()
46 std::string Prefix = Twine(PackageName + "-" + Cand.SPACKReleaseStr).str(); in findSPACKPackage()
48 for (llvm::vfs::directory_iterator File = D.getVFS().dir_begin(Cand.Path, EC), in findSPACKPackage()
59 auto PackagePath = Cand.Path; in findSPACKPackage()
64 llvm::errs() << "SPACK package " << Prefix << " not found at " << Cand.Path in findSPACKPackage()
70 llvm::errs() << "Cannot use SPACK package " << Prefix << " at " << Cand.Path in findSPACKPackage()
188 for (auto Cand : ROCmSearchDirs) { in getInstallationPathCandidates() local
190 if (Cand.isSPACK()) in getInstallationPathCandidates()
191 llvm::errs() << " (Spack " << Cand.SPACKReleaseStr << ")"; in getInstallationPathCandidates()
[all …]
/freebsd-14.2/contrib/llvm-project/llvm/lib/Transforms/IPO/
H A DPartialInlining.cpp635 BasicBlock *Cand = OutliningInfo->NonReturnBlock; in computeOutliningInfo() local
636 if (succ_size(Cand) != 2) in computeOutliningInfo()
639 if (HasNonEntryPred(Cand)) in computeOutliningInfo()
642 BasicBlock *Succ1 = *succ_begin(Cand); in computeOutliningInfo()
643 BasicBlock *Succ2 = *(succ_begin(Cand) + 1); in computeOutliningInfo()
650 if (NonReturnBlock->getSinglePredecessor() != Cand) in computeOutliningInfo()
654 OutliningInfo->Entries.push_back(Cand); in computeOutliningInfo()
656 OutliningInfo->ReturnBlockPreds.push_back(Cand); in computeOutliningInfo()
657 Entries.insert(Cand); in computeOutliningInfo()
/freebsd-14.2/contrib/llvm-project/llvm/include/llvm/ProfileData/
H A DSampleProf.h1106 StringRef Cand(FnName);
1113 auto It = Cand.rfind(Suffix);
1116 auto Dit = Cand.rfind('.');
1118 Cand = Cand.substr(0, It);
1120 return Cand;
/freebsd-14.2/contrib/llvm-project/llvm/lib/Transforms/Instrumentation/
H A DPGOInstrumentation.cpp817 populateEHOperandBundle(VPCandidateInfo &Cand, in populateEHOperandBundle() argument
820 auto *OrigCall = dyn_cast<CallBase>(Cand.AnnotatedInst); in populateEHOperandBundle()
932 for (VPCandidateInfo Cand : FuncInfo.ValueSites[Kind]) { in instrumentOneFunc() local
936 IRBuilder<> Builder(Cand.InsertPt); in instrumentOneFunc()
937 assert(Builder.GetInsertPoint() != Cand.InsertPt->getParent()->end() && in instrumentOneFunc()
941 if (Cand.V->getType()->isIntegerTy()) in instrumentOneFunc()
942 ToProfile = Builder.CreateZExtOrTrunc(Cand.V, Builder.getInt64Ty()); in instrumentOneFunc()
943 else if (Cand.V->getType()->isPointerTy()) in instrumentOneFunc()
944 ToProfile = Builder.CreatePtrToInt(Cand.V, Builder.getInt64Ty()); in instrumentOneFunc()
948 populateEHOperandBundle(Cand, BlockColors, OpBundles); in instrumentOneFunc()
H A DInstrProfiling.cpp444 for (auto &Cand : LoopToCandidates[&L]) { in run() local
448 Value *InitVal = ConstantInt::get(Cand.first->getType(), 0); in run()
452 auto *BB = Cand.first->getParent(); in run()
463 PGOCounterPromoterHelper Promoter(Cand.first, Cand.second, SSA, InitVal, in run()
466 Promoter.run(SmallVector<Instruction *, 2>({Cand.first, Cand.second})); in run()
/freebsd-14.2/contrib/llvm-project/llvm/lib/Analysis/
H A DIRSimilarityIdentifier.cpp1530 for (IRSimilarityCandidate &Cand : CandVec) { in run()
1531 OS << " Function: " << Cand.front()->Inst->getFunction()->getName().str() in run()
1533 if (Cand.front()->Inst->getParent()->getName().str() == "") in run()
1536 OS << Cand.front()->Inst->getParent()->getName().str(); in run()
1538 Cand.frontInstruction()->print(OS); in run()
1540 Cand.backInstruction()->print(OS); in run()
/freebsd-14.2/contrib/llvm-project/llvm/lib/Target/ARM/
H A DARMLoadStoreOptimizer.cpp189 MachineInstr *MergeOpsUpdate(const MergeCandidate &Cand);
860 MachineInstr *ARMLoadStoreOpt::MergeOpsUpdate(const MergeCandidate &Cand) { in MergeOpsUpdate() argument
861 const MachineInstr *First = Cand.Instrs.front(); in MergeOpsUpdate()
869 for (const MachineInstr *MI : Cand.Instrs) { in MergeOpsUpdate()
901 MachineInstr *LatestMI = Cand.Instrs[Cand.LatestMIIdx]; in MergeOpsUpdate()
911 if (Cand.CanMergeToLSDouble) in MergeOpsUpdate()
914 Cand.Instrs); in MergeOpsUpdate()
915 if (!Merged && Cand.CanMergeToLSMulti) in MergeOpsUpdate()
917 Opcode, Pred, PredReg, DL, Regs, Cand.Instrs); in MergeOpsUpdate()
923 iterator EarliestI(Cand.Instrs[Cand.EarliestMIIdx]); in MergeOpsUpdate()
[all …]

12