Searched refs:Candidates (Results 1 - 22 of 22) sorted by relevance

/freebsd-11.0-release/contrib/llvm/lib/Transforms/Scalar/
H A DLoopLoadElimination.cpp127 std::forward_list<StoreToLoadForwardingCandidate> Candidates; local
131 return Candidates;
165 Candidates.emplace_front(Load, Store);
169 Candidates.remove_if([&](const StoreToLoadForwardingCandidate &C) {
173 return Candidates;
203 std::forward_list<StoreToLoadForwardingCandidate> &Candidates) {
210 for (const auto &Cand : Candidates) {
236 Candidates.remove_if([&](const StoreToLoadForwardingCandidate &Cand) {
268 const SmallVectorImpl<StoreToLoadForwardingCandidate> &Candidates) {
287 std::max_element(Candidates
202 removeDependencesFromMultipleStores( std::forward_list<StoreToLoadForwardingCandidate> &Candidates) argument
267 findPointersWrittenOnForwardingPath( const SmallVectorImpl<StoreToLoadForwardingCandidate> &Candidates) argument
322 collectMemchecks( const SmallVectorImpl<StoreToLoadForwardingCandidate> &Candidates) argument
[all...]
H A DNaryReassociate.cpp244 // ensures that all bases of a candidate are in Candidates when we process it.
561 auto &Candidates = Pos->second;
566 while (!Candidates.empty()) {
567 // Candidates stores WeakVHs, so a candidate can be nullptr if it's removed
569 if (Value *Candidate = Candidates.back()) {
574 Candidates.pop_back();
H A DStraightLineStrengthReduce.cpp158 // to Candidates, and tries to find the immediate basis for each of them.
179 // Adds the given form <CT, B, Idx, S> to Candidates, and finds its immediate
203 ilist<Candidate> Candidates; member in class:__anon3265::StraightLineStrengthReduce
351 for (auto Basis = Candidates.rbegin();
352 Basis != Candidates.rend() && NumIterations < MaxNumIterations;
362 Candidates.push_back(C);
695 // all bases of a candidate are in Candidates when we process it.
704 while (!Candidates.empty()) {
705 const Candidate &C = Candidates.back();
709 Candidates
[all...]
H A DSeparateConstOffsetFromGEP.cpp1100 auto &Candidates = Pos->second;
1105 while (!Candidates.empty()) {
1106 Instruction *Candidate = Candidates.back();
1109 Candidates.pop_back();
/freebsd-11.0-release/contrib/llvm/tools/clang/include/clang/Sema/
H A DTemplateDeduction.h268 SmallVector<TemplateSpecCandidate, 16> Candidates; member in class:clang::TemplateSpecCandidateSet
293 iterator begin() { return Candidates.begin(); }
294 iterator end() { return Candidates.end(); }
296 size_t size() const { return Candidates.size(); }
297 bool empty() const { return Candidates.empty(); }
302 Candidates.emplace_back();
303 return Candidates.back();
H A DOverload.h705 /// Lookup for candidates for a call using operator syntax. Candidates
713 SmallVector<OverloadCandidate, 16> Candidates; member in class:clang::OverloadCandidateSet
750 iterator begin() { return Candidates.begin(); }
751 iterator end() { return Candidates.end(); }
753 size_t size() const { return Candidates.size(); }
754 bool empty() const { return Candidates.empty(); }
759 Candidates.push_back(OverloadCandidate());
760 OverloadCandidate &C = Candidates.back();
H A DCodeCompleteConsumer.h927 /// \param Candidates an array of overload candidates.
931 OverloadCandidate *Candidates,
964 OverloadCandidate *Candidates,
/freebsd-11.0-release/contrib/llvm/lib/CodeGen/
H A DRegisterScavenging.cpp292 BitVector &Candidates,
295 int Survivor = Candidates.find_first();
315 Candidates.clearBitsNotInMask(MO.getRegMask());
326 Candidates.reset(*AI);
337 if (Candidates.test(Survivor))
341 if (Candidates.none())
344 Survivor = Candidates.find_first();
370 BitVector Candidates = local
378 Candidates.reset(MO.getReg());
384 Available &= Candidates;
291 findSurvivorReg(MachineBasicBlock::iterator StartMI, BitVector &Candidates, unsigned InstrLimit, MachineBasicBlock::iterator &UseMI) argument
[all...]
H A DMachineLICM.cpp171 SmallVectorImpl<CandidateInfo> &Candidates);
355 SmallVectorImpl<CandidateInfo> &Candidates) {
432 Candidates.push_back(CandidateInfo(MI, Def, FI));
447 SmallVector<CandidateInfo, 32> Candidates; local
469 ProcessMI(&MI, PhysRegDefs, PhysRegClobbers, StoredFIs, Candidates);
495 for (CandidateInfo &Candidate : Candidates) {
708 SmallVector<MachineInstr *, 8> Candidates;
714 Candidates.push_back(&*I);
717 for (MachineInstr *I : Candidates) {
351 ProcessMI(MachineInstr *MI, BitVector &PhysRegDefs, BitVector &PhysRegClobbers, SmallSet<int, 32> &StoredFIs, SmallVectorImpl<CandidateInfo> &Candidates) argument
/freebsd-11.0-release/contrib/llvm/lib/Target/Mips/
H A DMips16InstrInfo.cpp336 BitVector Candidates = local
344 Candidates.reset(MO.getReg());
365 Available &= Candidates;
376 Reg = Candidates.find_first();
377 Candidates.reset(Reg);
391 SpReg = Candidates.find_first();
392 // Candidates.reset(SpReg); // not really needed
/freebsd-11.0-release/contrib/llvm/include/llvm/CodeGen/
H A DRegisterScavenging.h175 BitVector &Candidates,
/freebsd-11.0-release/contrib/llvm/tools/clang/lib/Sema/
H A DCodeCompleteConsumer.cpp513 OverloadCandidate *Candidates,
517 = Candidates[I].CreateSignatureString(CurrentArg, SemaRef,
511 ProcessOverloadCandidates(Sema &SemaRef, unsigned CurrentArg, OverloadCandidate *Candidates, unsigned NumCandidates) argument
H A DSemaCodeComplete.cpp3948 ArrayRef<ResultCandidate> Candidates,
3951 // Given the overloads 'Candidates' for a function call matching all arguments
3955 for (auto &Candidate : Candidates) {
3973 MutableArrayRef<ResultCandidate> Candidates,
3978 ParamType = getParamType(SemaRef, Candidates, CurrentArg);
3985 if (!Candidates.empty())
3987 Candidates.data(),
3988 Candidates.size());
3947 getParamType(Sema &SemaRef, ArrayRef<ResultCandidate> Candidates, unsigned N) argument
3972 CodeCompleteOverloadResults(Sema &SemaRef, Scope *S, MutableArrayRef<ResultCandidate> Candidates, unsigned CurrentArg, bool CompleteExpressionWithCurrentArg = true) argument
H A DSemaExprCXX.cpp1978 OverloadCandidateSet Candidates(StartLoc, OverloadCandidateSet::CSK_Normal);
1988 Args, Candidates,
1994 AddOverloadCandidate(Fn, Alloc.getPair(), Args, Candidates,
2000 switch (Candidates.BestViableFunction(*this, StartLoc, Best)) {
2016 Candidates.NoteCandidates(*this, OCD_AllCandidates, Args);
2024 Candidates.NoteCandidates(*this, OCD_ViableCandidates, Args);
2035 Candidates.NoteCandidates(*this, OCD_AllCandidates, Args);
H A DSemaStmt.cpp3788 ArrayRef<CapturingScopeInfo::Capture> Candidates) {
3791 for (CaptureIter Cap = Candidates.begin(); Cap != Candidates.end(); ++Cap) {
3785 buildCapturedStmtCaptureList( SmallVectorImpl<CapturedStmt::Capture> &Captures, SmallVectorImpl<Expr *> &CaptureInits, ArrayRef<CapturingScopeInfo::Capture> Candidates) argument
H A DSemaTemplate.cpp6831 UnresolvedSet<8> Candidates; local
6895 Candidates.addDecl(Specialization, I.getAccess());
6901 Candidates.begin(), Candidates.end(), FailedCandidates,
6908 if (Result == Candidates.end())
H A DSemaLookup.cpp2865 SmallVector<NamedDecl *, 8> Candidates(R.begin(), R.end());
2867 for (auto *Cand : Candidates) {
H A DSemaOverload.cpp809 Candidates.clear();
10104 Candidates.clear();
10927 OverloadCandidateSet Candidates(FnLoc, CSK);
10931 Candidates, false, /*KnownValid*/ false);
10934 if (Candidates.BestViableFunction(SemaRef, FnLoc, Best) != OR_Success) {
/freebsd-11.0-release/contrib/llvm/lib/Target/ARM/
H A DARMLoadStoreOptimizer.cpp127 SmallVector<const MergeCandidate*,4> Candidates; member in struct:__anon2782::ARMLoadStoreOpt
1010 Candidates.push_back(Candidate);
1640 assert(Candidates.size() == 0);
1748 std::sort(Candidates.begin(), Candidates.end(), LessThan);
1752 for (const MergeCandidate *Candidate : Candidates) {
1775 Candidates.clear();
/freebsd-11.0-release/contrib/llvm/lib/Target/X86/AsmParser/
H A DX86AsmInstrumentation.cpp160 static const MCPhysReg Candidates[] = { X86::RBP, X86::RAX, X86::RBX, local
163 for (unsigned Reg : Candidates) {
/freebsd-11.0-release/contrib/llvm/tools/clang/lib/Frontend/
H A DASTUnit.cpp2119 OverloadCandidate *Candidates,
2121 Next.ProcessOverloadCandidates(S, CurrentArg, Candidates, NumCandidates);
/freebsd-11.0-release/contrib/llvm/tools/clang/lib/Serialization/
H A DASTReader.cpp8489 llvm::SmallVector<const NamedDecl*, 4> Candidates;
8502 Candidates.push_back(ND);
8521 if (Candidates.empty())
8525 for (unsigned I = 0, N = Candidates.size(); I != N; ++I)
8526 Diag(Candidates[I]->getLocation(),
8528 << Candidates[I];

Completed in 692 milliseconds