| /llvm-project-15.0.7/llvm/lib/Target/PowerPC/ |
| H A D | PPCMachineScheduler.cpp | 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() 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 D | PPCBranchCoalescing.cpp | 239 if (TII->analyzeBranch(*Cand.BranchBlock, Cand.BranchTargetBlock, FalseMBB, in canCoalesceBranch() 240 Cand.Cond)) { in canCoalesceBranch() 270 if (Cand.BranchBlock->isEHPad() || Cand.BranchBlock->hasEHPadSuccessor()) { in canCoalesceBranch() 282 if (!Cand.BranchTargetBlock || FalseMBB || in canCoalesceBranch() 283 !Cand.BranchBlock->isSuccessor(Cand.BranchTargetBlock)) { in canCoalesceBranch() 289 if (Cand.BranchBlock->succ_size() != 2) { in canCoalesceBranch() 295 assert(Cand.BranchBlock->canFallThrough() && in canCoalesceBranch() 302 (*Cand.BranchBlock->succ_begin() == Cand.BranchTargetBlock) in canCoalesceBranch() 303 ? *Cand.BranchBlock->succ_rbegin() in canCoalesceBranch() 304 : *Cand.BranchBlock->succ_begin(); in canCoalesceBranch() [all …]
|
| H A D | PPCMachineScheduler.h | 26 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;
|
| /llvm-project-15.0.7/llvm/lib/Transforms/Scalar/ |
| H A D | LoopLoadElimination.cpp | 133 OS << *Cand.Store << " -->\n"; in operator <<() 134 OS.indent(2) << *Cand.Load << "\n"; in operator <<() 264 for (const auto &Cand : Candidates) { in removeDependencesFromMultipleStores() local 269 LoadToSingleCand.insert(std::make_pair(Cand.Load, &Cand)); in removeDependencesFromMultipleStores() 284 OtherCand = &Cand; in removeDependencesFromMultipleStores() 291 if (LoadToSingleCand[Cand.Load] != &Cand) { in removeDependencesFromMultipleStores() 294 << Cand in removeDependencesFromMultipleStores() 443 Cand.Load->replaceAllUsesWith(PHI); in propagateStoredValueToLoadUsers() 498 if (isLoadConditional(Cand.Load, L)) in processLoop() 512 Candidates.push_back(Cand); in processLoop() [all …]
|
| H A D | TLSVariableHoist.cpp | 150 static bool oneUseOutsideLoop(tlshoist::TLSCandidate &Cand, LoopInfo *LI) { in oneUseOutsideLoop() argument 151 if (Cand.Users.size() != 1) in oneUseOutsideLoop() 154 BasicBlock *BB = Cand.Users[0].Inst->getParent(); in oneUseOutsideLoop() 208 tlshoist::TLSCandidate &Cand = TLSCandMap[GV]; in findInsertPos() local 213 for (auto &User : Cand.Users) { in findInsertPos() 244 tlshoist::TLSCandidate &Cand = TLSCandMap[GV]; in tryReplaceTLSCandidate() local 247 if (oneUseOutsideLoop(Cand, LI)) in tryReplaceTLSCandidate() 254 for (auto &User : Cand.Users) in tryReplaceTLSCandidate()
|
| H A D | GVNSink.cpp | 757 SinkingInstructionCandidate Cand; in analyzeInstructionForSinking() local 758 Cand.NumInstructions = ++InstNum; in analyzeInstructionForSinking() 759 Cand.NumMemoryInsts = MemoryInstNum; in analyzeInstructionForSinking() 760 Cand.NumBlocks = ActivePreds.size(); in analyzeInstructionForSinking() 761 Cand.NumPHIs = NeededPHIs.size(); in analyzeInstructionForSinking() 762 append_range(Cand.Blocks, ActivePreds); in analyzeInstructionForSinking() 764 return Cand; in analyzeInstructionForSinking() 797 auto Cand = analyzeInstructionForSinking(LRI, InstNum, MemoryInstNum, in sinkBB() local 799 if (!Cand) in sinkBB() 801 Cand->calculateCost(NumOrigPHIs, Preds.size()); in sinkBB() [all …]
|
| /llvm-project-15.0.7/llvm/lib/CodeGen/ |
| H A D | MachineScheduler.cpp | 2894 tracePick(Cand.Reason, Cand.AtTop); in tracePick() 3138 Cand.SU = SU; in initCandidate() 3139 Cand.AtTop = AtTop; in initCandidate() 3144 Cand.RPDelta, in initCandidate() 3152 Cand.RPDelta, in initCandidate() 3193 biasPhysReg(Cand.SU, Cand.AtTop), TryCand, Cand, PhysReg)) in tryCandidate() 3248 getWeakLeft(Cand.SU, Cand.AtTop), in tryCandidate() 3391 tracePick(Cand); in pickNodeBidirectional() 3392 return Cand.SU; in pickNodeBidirectional() 3560 Top.getLatencyStallCycles(Cand.SU), TryCand, Cand, Stall)) in tryCandidate() [all …]
|
| H A D | RegAllocGreedy.cpp | 731 if (Cand.PhysReg) { in growRegion() 775 if (!growRegion(Cand)) { in calcCompactRegion() 782 if (!Cand.LiveBundles.any()) { in calcCompactRegion() 895 IntvIn = Cand.IntvIdx; in splitAroundRegion() 897 IntfIn = Cand.Intf.first(); in splitAroundRegion() 904 IntvOut = Cand.IntvIdx; in splitAroundRegion() 906 IntfOut = Cand.Intf.last(); in splitAroundRegion() 943 IntvIn = Cand.IntvIdx; in splitAroundRegion() 951 IntvOut = Cand.IntvIdx; in splitAroundRegion() 1095 if (!growRegion(Cand)) { in calculateRegionSplitCost() [all …]
|
| /llvm-project-15.0.7/llvm/lib/Target/AMDGPU/ |
| H A D | SIMachineScheduler.cpp | 150 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 D | GCNSchedStrategy.cpp | 80 Cand.SU = SU; in initCandidate() 81 Cand.AtTop = AtTop; in initCandidate() 146 Cand.RPDelta.CriticalMax = in initCandidate() 148 Cand.RPDelta.CriticalMax.setUnitInc(SGPRDelta); in initCandidate() 150 Cand.RPDelta.CriticalMax = in initCandidate() 180 Cand.setBest(TryCand); in pickNodeFromQueue() 181 LLVM_DEBUG(traceCandidate(Cand)); in pickNodeFromQueue() 251 SchedCandidate Cand = BotCand; in pickNodeBidirectional() local 255 Cand.setBest(TopCand); in pickNodeBidirectional() 259 IsTopNode = Cand.AtTop; in pickNodeBidirectional() [all …]
|
| H A D | SIMachineScheduler.h | 202 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 D | GCNMinRegStrategy.cpp | 123 auto &Cand = *I++; in findMax() local 124 RQ.remove(Cand); in findMax() 125 RQ.push_front(Cand); in findMax()
|
| H A D | GCNSchedStrategy.h | 35 SchedCandidate &Cand); 37 void initCandidate(SchedCandidate &Cand, SUnit *SU,
|
| /llvm-project-15.0.7/llvm/lib/Target/AArch64/ |
| H A D | AArch64MachineScheduler.cpp | 61 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 D | AArch64MachineScheduler.h | 27 bool tryCandidate(SchedCandidate &Cand, SchedCandidate &TryCand) override;
|
| /llvm-project-15.0.7/clang/lib/Sema/ |
| H A D | SemaOverload.cpp | 1381 Cand != Conversions.end(); ++Cand) in TryUserDefinedConversion() 4718 Cand != CandidateSet.end(); ++Cand) in FindConversionForRefInit() 9464 Cand != CandEnd; ++Cand) in AddArgumentDependentLookupCandidates() 10120 [](OverloadCandidate &Cand) { return &Cand; }); in BestViableFunction() argument 10138 return Cand->Viable && Cand->Function && in BestViableFunction() 10145 return Cand->Viable && Cand->Function && in BestViableFunction() 10178 if (Cand->Viable && !Cand->Best && in BestViableFunction() 11769 for (iterator Cand = begin(), LastCand = end(); Cand != LastCand; ++Cand) { in CompleteCandidates() local 11775 if (!Cand->Function && !Cand->IsSurrogate) { in CompleteCandidates() 11961 for (iterator Cand = begin(), LastCand = end(); Cand != LastCand; ++Cand) { in NoteCandidates() local [all …]
|
| /llvm-project-15.0.7/llvm/include/llvm/CodeGen/ |
| H A D | MachineScheduler.h | 922 void traceCandidate(const SchedCandidate &Cand); 933 GenericSchedulerBase::SchedCandidate &Cand, 937 GenericSchedulerBase::SchedCandidate &Cand, 940 GenericSchedulerBase::SchedCandidate &Cand, 945 GenericSchedulerBase::SchedCandidate &Cand, 1014 void initCandidate(SchedCandidate &Cand, SUnit *SU, bool AtTop, 1018 virtual bool tryCandidate(SchedCandidate &Cand, SchedCandidate &TryCand, 1081 virtual bool tryCandidate(SchedCandidate &Cand, SchedCandidate &TryCand); 1083 void pickNodeFromQueue(SchedCandidate &Cand);
|
| /llvm-project-15.0.7/bolt/lib/Passes/ |
| H A D | LongJmp.cpp | 130 auto Cand = llvm::lower_bound( in lookupStubFromGroup() local 136 if (Cand == Candidates.end()) in lookupStubFromGroup() 138 if (Cand != Candidates.begin()) { in lookupStubFromGroup() 139 const StubTy *LeftCand = std::prev(Cand); in lookupStubFromGroup() 140 if (Cand->first - DotAddress > DotAddress - LeftCand->first) in lookupStubFromGroup() 141 Cand = LeftCand; in lookupStubFromGroup() 145 uint64_t PCRelTgtAddress = Cand->first; in lookupStubFromGroup() 153 << Twine::utohexstr(Cand->first) << "\n"; in lookupStubFromGroup() 155 return PCRelTgtAddress & Mask ? nullptr : Cand->second; in lookupStubFromGroup()
|
| /llvm-project-15.0.7/clang/lib/Driver/ToolChains/ |
| H A D | AMDGPU.cpp | 39 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() 186 for (auto Cand : ROCmSearchDirs) { in getInstallationPathCandidates() local 188 if (Cand.isSPACK()) in getInstallationPathCandidates() 189 llvm::errs() << " (Spack " << Cand.SPACKReleaseStr << ")"; in getInstallationPathCandidates() [all …]
|
| /llvm-project-15.0.7/llvm/lib/Transforms/IPO/ |
| H A D | PartialInlining.cpp | 682 BasicBlock *Cand = OutliningInfo->NonReturnBlock; in computeOutliningInfo() local 683 if (succ_size(Cand) != 2) in computeOutliningInfo() 686 if (HasNonEntryPred(Cand)) in computeOutliningInfo() 689 BasicBlock *Succ1 = *succ_begin(Cand); in computeOutliningInfo() 690 BasicBlock *Succ2 = *(succ_begin(Cand) + 1); in computeOutliningInfo() 697 if (NonReturnBlock->getSinglePredecessor() != Cand) in computeOutliningInfo() 701 OutliningInfo->Entries.push_back(Cand); in computeOutliningInfo() 703 OutliningInfo->ReturnBlockPreds.push_back(Cand); in computeOutliningInfo() 704 Entries.insert(Cand); in computeOutliningInfo()
|
| /llvm-project-15.0.7/llvm/lib/Transforms/Instrumentation/ |
| H A D | InstrProfiling.cpp | 272 for (auto &Cand : LoopToCandidates[&L]) { in run() local 276 Value *InitVal = ConstantInt::get(Cand.first->getType(), 0); in run() 280 auto *BB = Cand.first->getParent(); in run() 291 PGOCounterPromoterHelper Promoter(Cand.first, Cand.second, SSA, InitVal, in run() 294 Promoter.run(SmallVector<Instruction *, 2>({Cand.first, Cand.second})); in run()
|
| H A D | PGOInstrumentation.cpp | 796 populateEHOperandBundle(VPCandidateInfo &Cand, in populateEHOperandBundle() argument 799 auto *OrigCall = dyn_cast<CallBase>(Cand.AnnotatedInst); in populateEHOperandBundle() 895 for (VPCandidateInfo Cand : FuncInfo.ValueSites[Kind]) { in instrumentOneFunc() local 899 IRBuilder<> Builder(Cand.InsertPt); in instrumentOneFunc() 900 assert(Builder.GetInsertPoint() != Cand.InsertPt->getParent()->end() && in instrumentOneFunc() 904 if (Cand.V->getType()->isIntegerTy()) in instrumentOneFunc() 905 ToProfile = Builder.CreateZExtOrTrunc(Cand.V, Builder.getInt64Ty()); in instrumentOneFunc() 906 else if (Cand.V->getType()->isPointerTy()) in instrumentOneFunc() 907 ToProfile = Builder.CreatePtrToInt(Cand.V, Builder.getInt64Ty()); in instrumentOneFunc() 911 populateEHOperandBundle(Cand, BlockColors, OpBundles); in instrumentOneFunc()
|
| /llvm-project-15.0.7/llvm/include/llvm/ProfileData/ |
| H A D | SampleProf.h | 1037 StringRef Cand(FnName); 1044 auto It = Cand.rfind(Suffix); 1047 auto Dit = Cand.rfind('.'); 1049 Cand = Cand.substr(0, It); 1051 return Cand;
|
| /llvm-project-15.0.7/llvm/lib/Analysis/ |
| H A D | IRSimilarityIdentifier.cpp | 1272 for (IRSimilarityCandidate &Cand : CandVec) { in run() 1273 OS << " Function: " << Cand.front()->Inst->getFunction()->getName().str() in run() 1275 if (Cand.front()->Inst->getParent()->getName().str() == "") in run() 1278 OS << Cand.front()->Inst->getParent()->getName().str(); in run() 1280 Cand.frontInstruction()->print(OS); in run() 1282 Cand.backInstruction()->print(OS); in run()
|
| /llvm-project-15.0.7/llvm/unittests/Analysis/ |
| H A D | IRSimilarityIdentifierTest.cpp | 2561 for (IRSimilarityCandidate &Cand : Cands) { in TEST() 2562 ASSERT_TRUE(Cand.getStartIdx() == InstIdx); in TEST() 2615 for (IRSimilarityCandidate &Cand : Cands) { in TEST() 2616 ASSERT_TRUE(Cand.getStartIdx() == InstIdx); in TEST() 2750 for (IRSimilarityCandidate &Cand : Cands) { in TEST() 2751 ASSERT_TRUE(Cand.getStartIdx() == InstIdx); in TEST() 2783 for (IRSimilarityCandidate &Cand : Cands) { in TEST() 2784 ASSERT_TRUE(Cand.getStartIdx() == InstIdx); in TEST() 2816 for (IRSimilarityCandidate &Cand : Cands) { in TEST() 2817 ASSERT_TRUE(Cand.getStartIdx() == InstIdx); in TEST()
|