Searched defs:Cand (Results 1 – 6 of 6) sorted by relevance
/minix3/external/bsd/llvm/dist/llvm/lib/CodeGen/ |
H A D | RegAllocGreedy.cpp | 1003 void RAGreedy::growRegion(GlobalSplitCandidate &Cand) { in growRegion() 1060 bool RAGreedy::calcCompactRegion(GlobalSplitCandidate &Cand) { in calcCompactRegion() 1120 BlockFrequency RAGreedy::calcGlobalSplitCost(GlobalSplitCandidate &Cand) { in calcGlobalSplitCost() 1196 GlobalSplitCandidate &Cand = GlobalCand[CandIn]; in splitAroundRegion() local 1205 GlobalSplitCandidate &Cand = GlobalCand[CandOut]; in splitAroundRegion() local 1245 GlobalSplitCandidate &Cand = GlobalCand[CandIn]; in splitAroundRegion() local 1253 GlobalSplitCandidate &Cand = GlobalCand[CandOut]; in splitAroundRegion() local 1374 GlobalSplitCandidate &Cand = GlobalCand[NumCands]; in calculateRegionSplitCost() local 1436 GlobalSplitCandidate &Cand = GlobalCand[BestCand]; in doRegionSplit() local 1448 GlobalSplitCandidate &Cand = GlobalCand.front(); in doRegionSplit() local
|
H A D | MachineScheduler.cpp | 2232 void GenericSchedulerBase::traceCandidate(const SchedCandidate &Cand) { in traceCandidate() 2288 GenericSchedulerBase::SchedCandidate &Cand, in tryLess() 2305 GenericSchedulerBase::SchedCandidate &Cand, in tryGreater() 2321 GenericSchedulerBase::SchedCandidate &Cand, in tryLatency() 2346 static void tracePick(const GenericSchedulerBase::SchedCandidate &Cand, in tracePick() 2488 GenericSchedulerBase::SchedCandidate &Cand, in tryPressure() 2552 void GenericScheduler::tryCandidate(SchedCandidate &Cand, in tryCandidate() 2689 SchedCandidate &Cand) { in pickNodeFromQueue() 2929 void PostGenericScheduler::tryCandidate(SchedCandidate &Cand, in tryCandidate() 2962 void PostGenericScheduler::pickNodeFromQueue(SchedCandidate &Cand) { in pickNodeFromQueue()
|
/minix3/external/bsd/llvm/dist/clang/lib/Sema/ |
H A D | SemaOverload.cpp | 1138 for (OverloadCandidateSet::iterator Cand = Conversions.begin(); in TryUserDefinedConversion() local 4138 for (OverloadCandidateSet::iterator Cand = CandidateSet.begin(); in FindConversionForRefInit() local 8272 for (OverloadCandidateSet::iterator Cand = CandidateSet.begin(), in AddArgumentDependentLookupCandidates() local 8469 for (iterator Cand = begin(); Cand != end(); ++Cand) { in BestViableFunction() local 8482 for (iterator Cand = begin(); Cand != end(); ++Cand) { in BestViableFunction() local 8635 static void DiagnoseBadConversion(Sema &S, OverloadCandidate *Cand, in DiagnoseBadConversion() 8854 static bool CheckArityMismatch(Sema &S, OverloadCandidate *Cand, in CheckArityMismatch() 8926 static void DiagnoseArityMismatch(Sema &S, OverloadCandidate *Cand, in DiagnoseArityMismatch() 9132 static void DiagnoseBadDeduction(Sema &S, OverloadCandidate *Cand, in DiagnoseBadDeduction() 9144 static void DiagnoseBadTarget(Sema &S, OverloadCandidate *Cand) { in DiagnoseBadTarget() [all …]
|
H A D | SemaLookup.cpp | 2520 for (auto *Cand : Candidates) { in LookupSpecialMember() local
|
H A D | SemaCodeComplete.cpp | 3876 for (OverloadCandidateSet::iterator Cand = CandidateSet.begin(), in CodeCompleteCall() local
|
/minix3/external/bsd/llvm/dist/llvm/utils/TableGen/ |
H A D | CodeGenRegisters.cpp | 433 CodeGenRegister *Cand = const_cast<CodeGenRegister*>(Leads[i]); in computeSecondarySubRegs() local
|