Home
last modified time | relevance | path

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

/openbsd/gnu/llvm/llvm/lib/Target/PowerPC/
H A DPPCMachineScheduler.cpp24 static bool isADDIInstr(const GenericScheduler::SchedCandidate &Cand) { in isADDIInstr()
29 bool PPCPreRASchedStrategy::biasAddiLoadCandidate(SchedCandidate &Cand, in biasAddiLoadCandidate()
49 bool PPCPreRASchedStrategy::tryCandidate(SchedCandidate &Cand, in tryCandidate()
165 bool PPCPostRASchedStrategy::biasAddiCandidate(SchedCandidate &Cand, in biasAddiCandidate()
177 bool PPCPostRASchedStrategy::tryCandidate(SchedCandidate &Cand, in tryCandidate()
H A DPPCBranchCoalescing.cpp234 bool PPCBranchCoalescing::canCoalesceBranch(CoalescingCandidateInfo &Cand) { in canCoalesceBranch()
/openbsd/gnu/llvm/llvm/lib/Transforms/Scalar/
H A DLoopLoadElimination.cpp133 const StoreToLoadForwardingCandidate &Cand) { in operator <<()
266 for (const auto &Cand : Candidates) { in removeDependencesFromMultipleStores() local
292 Candidates.remove_if([&](const StoreToLoadForwardingCandidate &Cand) { in removeDependencesFromMultipleStores()
413 propagateStoredValueToLoadUsers(const StoreToLoadForwardingCandidate &Cand, in propagateStoredValueToLoadUsers()
503 for (const StoreToLoadForwardingCandidate &Cand : StoreToLoadDependences) { in processLoop() local
586 const StoreToLoadForwardingCandidate &Cand) { in processLoop()
599 for (const auto &Cand : Candidates) in processLoop() local
H A DTLSVariableHoist.cpp150 static bool oneUseOutsideLoop(tlshoist::TLSCandidate &Cand, LoopInfo *LI) { in oneUseOutsideLoop()
196 tlshoist::TLSCandidate &Cand = TLSCandMap[GV]; in findInsertPos() local
232 tlshoist::TLSCandidate &Cand = TLSCandMap[GV]; in tryReplaceTLSCandidate() local
H A DConstantHoisting.cpp382 ConstPtrUnionType Cand = ConstInt; in collectConstantCandidates() local
440 ConstPtrUnionType Cand = ConstExpr; in collectConstantCandidates() local
H A DGVNSink.cpp758 SinkingInstructionCandidate Cand; in analyzeInstructionForSinking() local
798 auto Cand = analyzeInstructionForSinking(LRI, InstNum, MemoryInstNum, in sinkBB() local
H A DRewriteStatepointsForGC.cpp2457 Instruction *Cand = cast<Instruction>(It.first); in rematerializeLiveValuesAtUses() local
2537 for (auto *Cand : LiveValuesToBeDeleted) { in rematerializeLiveValuesAtUses() local
/openbsd/gnu/llvm/llvm/lib/CodeGen/
H A DRegAllocGreedy.cpp723 bool RAGreedy::growRegion(GlobalSplitCandidate &Cand) { in growRegion()
784 bool RAGreedy::calcCompactRegion(GlobalSplitCandidate &Cand) { in calcCompactRegion()
846 BlockFrequency RAGreedy::calcGlobalSplitCost(GlobalSplitCandidate &Cand, in calcGlobalSplitCost()
924 GlobalSplitCandidate &Cand = GlobalCand[CandIn]; in splitAroundRegion() local
933 GlobalSplitCandidate &Cand = GlobalCand[CandOut]; in splitAroundRegion() local
972 GlobalSplitCandidate &Cand = GlobalCand[CandIn]; in splitAroundRegion() local
980 GlobalSplitCandidate &Cand = GlobalCand[CandOut]; in splitAroundRegion() local
1104 GlobalSplitCandidate &Cand = GlobalCand[NumCands]; in calculateRegionSplitCost() local
1169 GlobalSplitCandidate &Cand = GlobalCand[BestCand]; in doRegionSplit() local
1181 GlobalSplitCandidate &Cand = GlobalCand.front(); in doRegionSplit() local
H A DMachineScheduler.cpp2795 void GenericSchedulerBase::traceCandidate(const SchedCandidate &Cand) { in traceCandidate()
2854 GenericSchedulerBase::SchedCandidate &Cand, in tryLess()
2870 GenericSchedulerBase::SchedCandidate &Cand, in tryGreater()
2885 GenericSchedulerBase::SchedCandidate &Cand, in tryLatency()
3080 GenericSchedulerBase::SchedCandidate &Cand, in tryPressure()
3164 void GenericScheduler::initCandidate(SchedCandidate &Cand, SUnit *SU, in initCandidate()
3212 bool GenericScheduler::tryCandidate(SchedCandidate &Cand, in tryCandidate()
3326 SchedCandidate &Cand) { in pickNodeFromQueue()
3413 SchedCandidate Cand = BotCand; in pickNodeBidirectional() local
3580 bool PostGenericScheduler::tryCandidate(SchedCandidate &Cand, in tryCandidate()
[all …]
H A DMachineOutliner.cpp695 for (auto &Cand : OF.Candidates) { in createOutlinedFunction() local
/openbsd/gnu/llvm/llvm/lib/Target/AMDGPU/
H A DSIMachineScheduler.cpp142 SISchedulerCandidate &Cand, in tryLess()
159 SISchedulerCandidate &Cand, in tryGreater()
184 void SIScheduleBlock::traceCandidate(const SISchedCandidate &Cand) { in traceCandidate()
191 void SIScheduleBlock::tryCandidateTopDown(SISchedCandidate &Cand, in tryCandidateTopDown()
1526 bool SIScheduleBlockScheduler::tryCandidateLatency(SIBlockSchedCandidate &Cand, in tryCandidateLatency()
1551 bool SIScheduleBlockScheduler::tryCandidateRegUsage(SIBlockSchedCandidate &Cand, in tryCandidateRegUsage()
1574 SIBlockSchedCandidate Cand; in pickBlock() local
H A DGCNSchedStrategy.cpp103 void GCNSchedStrategy::initCandidate(SchedCandidate &Cand, SUnit *SU, in initCandidate()
194 SchedCandidate &Cand) { in pickNodeFromQueue()
287 SchedCandidate Cand = BotCand; in pickNodeBidirectional() local
383 bool GCNMaxILPSchedStrategy::tryCandidate(SchedCandidate &Cand, in tryCandidate()
H A DGCNMinRegStrategy.cpp123 auto &Cand = *I++; in findMax() local
/openbsd/gnu/llvm/llvm/lib/Target/AArch64/
H A DAArch64MachineScheduler.cpp61 bool AArch64PostRASchedStrategy::tryCandidate(SchedCandidate &Cand, in tryCandidate()
/openbsd/gnu/llvm/clang/lib/Sema/
H A DSemaOverload.cpp1487 for (OverloadCandidateSet::iterator Cand = Conversions.begin(); in TryUserDefinedConversion() local
10253 [](OverloadCandidate &Cand) { return &Cand; }); in BestViableFunction()
10269 llvm::any_of(Candidates, [&](OverloadCandidate *Cand) { in BestViableFunction()
10276 auto IsWrongSideCandidate = [&](OverloadCandidate *Cand) { in BestViableFunction()
10288 for (auto *Cand : Candidates) { in BestViableFunction() local
10318 for (auto *Cand : Candidates) { in BestViableFunction() local
10935 static bool CheckArityMismatch(Sema &S, OverloadCandidate *Cand, in CheckArityMismatch()
11819 CompleteNonViableCandidate(Sema &S, OverloadCandidate *Cand, in CompleteNonViableCandidate()
11997 OverloadCandidate *Cand = *I; in NoteCandidates() local
12040 GetLocationForCandidate(const TemplateSpecCandidate *Cand) { in GetLocationForCandidate()
[all …]
H A DSemaLookup.cpp3484 DeclAccessPair Cand = DeclAccessPair::make(CandDecl, AS_public); in LookupSpecialMember() local
/openbsd/gnu/llvm/clang/lib/Driver/ToolChains/
H A DAMDGPU.cpp41 RocmInstallationDetector::findSPACKPackage(const Candidate &Cand, in findSPACKPackage()
188 for (auto Cand : ROCmSearchDirs) { in getInstallationPathCandidates() local
/openbsd/gnu/llvm/llvm/lib/Transforms/Instrumentation/
H A DPGOInstrumentation.cpp820 populateEHOperandBundle(VPCandidateInfo &Cand, in populateEHOperandBundle()
919 for (VPCandidateInfo Cand : FuncInfo.ValueSites[Kind]) { in instrumentOneFunc() local
H A DInstrProfiling.cpp272 for (auto &Cand : LoopToCandidates[&L]) { in run() local
/openbsd/gnu/llvm/llvm/lib/Transforms/IPO/
H A DPartialInlining.cpp682 BasicBlock *Cand = OutliningInfo->NonReturnBlock; in computeOutliningInfo() local
H A DIROutliner.cpp1183 IRSimilarityCandidate &Cand = *Region.Candidate; in getGVNForPHINode() local
/openbsd/gnu/llvm/llvm/utils/TableGen/
H A DCodeGenRegisters.cpp482 CodeGenRegister *Cand = const_cast<CodeGenRegister*>(Leads[i]); in computeSecondarySubRegs() local
/openbsd/gnu/llvm/llvm/lib/Target/ARM/
H A DARMLoadStoreOptimizer.cpp860 MachineInstr *ARMLoadStoreOpt::MergeOpsUpdate(const MergeCandidate &Cand) { in MergeOpsUpdate()
/openbsd/gnu/llvm/llvm/lib/Target/Hexagon/
H A DHexagonBitSimplify.cpp3356 std::vector<LoopCand> Cand; in runOnMachineFunction() local
/openbsd/gnu/llvm/llvm/lib/Transforms/Vectorize/
H A DSLPVectorizer.cpp5106 Candidates, [this](ArrayRef<std::pair<Value *, Value *>> Cand) { in buildTree_rec() argument
5119 Candidates, [this](ArrayRef<std::pair<Value *, Value *>> Cand) { in buildTree_rec() argument