Home
last modified time | relevance | path

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

/external/llvm/lib/CodeGen/
DRegAllocGreedy.cpp981 void RAGreedy::growRegion(GlobalSplitCandidate &Cand) { in growRegion()
1038 bool RAGreedy::calcCompactRegion(GlobalSplitCandidate &Cand) { in calcCompactRegion()
1098 BlockFrequency RAGreedy::calcGlobalSplitCost(GlobalSplitCandidate &Cand) { in calcGlobalSplitCost()
1174 GlobalSplitCandidate &Cand = GlobalCand[CandIn]; in splitAroundRegion() local
1183 GlobalSplitCandidate &Cand = GlobalCand[CandOut]; in splitAroundRegion() local
1223 GlobalSplitCandidate &Cand = GlobalCand[CandIn]; in splitAroundRegion() local
1231 GlobalSplitCandidate &Cand = GlobalCand[CandOut]; in splitAroundRegion() local
1352 GlobalSplitCandidate &Cand = GlobalCand[NumCands]; in calculateRegionSplitCost() local
1414 GlobalSplitCandidate &Cand = GlobalCand[BestCand]; in doRegionSplit() local
1426 GlobalSplitCandidate &Cand = GlobalCand.front(); in doRegionSplit() local
DMachineScheduler.cpp2222 void GenericSchedulerBase::traceCandidate(const SchedCandidate &Cand) { in traceCandidate()
2278 GenericSchedulerBase::SchedCandidate &Cand, in tryLess()
2295 GenericSchedulerBase::SchedCandidate &Cand, in tryGreater()
2311 GenericSchedulerBase::SchedCandidate &Cand, in tryLatency()
2336 static void tracePick(const GenericSchedulerBase::SchedCandidate &Cand, in tracePick()
2474 GenericSchedulerBase::SchedCandidate &Cand, in tryPressure()
2538 void GenericScheduler::tryCandidate(SchedCandidate &Cand, in tryCandidate()
2675 SchedCandidate &Cand) { in pickNodeFromQueue()
2912 void PostGenericScheduler::tryCandidate(SchedCandidate &Cand, in tryCandidate()
2945 void PostGenericScheduler::pickNodeFromQueue(SchedCandidate &Cand) { in pickNodeFromQueue()
/external/clang/lib/Sema/
DSemaOverload.cpp1182 for (OverloadCandidateSet::iterator Cand = Conversions.begin(); in TryUserDefinedConversion() local
4180 for (OverloadCandidateSet::iterator Cand = CandidateSet.begin(); in FindConversionForRefInit() local
8159 for (OverloadCandidateSet::iterator Cand = CandidateSet.begin(), in AddArgumentDependentLookupCandidates() local
8358 for (iterator Cand = begin(); Cand != end(); ++Cand) { in BestViableFunction() local
8371 for (iterator Cand = begin(); Cand != end(); ++Cand) { in BestViableFunction() local
8526 void DiagnoseBadConversion(Sema &S, OverloadCandidate *Cand, unsigned I) { in DiagnoseBadConversion()
8744 bool CheckArityMismatch(Sema &S, OverloadCandidate *Cand, in CheckArityMismatch()
8816 void DiagnoseArityMismatch(Sema &S, OverloadCandidate *Cand, in DiagnoseArityMismatch()
9022 void DiagnoseBadDeduction(Sema &S, OverloadCandidate *Cand, unsigned NumArgs) { in DiagnoseBadDeduction()
9033 void DiagnoseBadTarget(Sema &S, OverloadCandidate *Cand) { in DiagnoseBadTarget()
[all …]
DSemaLookup.cpp2480 NamedDecl *Cand = *I; in LookupSpecialMember() local
DSemaCodeComplete.cpp3875 for (OverloadCandidateSet::iterator Cand = CandidateSet.begin(), in CodeCompleteCall() local
/external/llvm/utils/TableGen/
DCodeGenRegisters.cpp432 CodeGenRegister *Cand = const_cast<CodeGenRegister*>(Leads[i]); in computeSecondarySubRegs() local