Searched refs:Candidate (Results 1 - 25 of 28) sorted by relevance

12

/freebsd-11.0-release/contrib/llvm/tools/clang/lib/Analysis/
H A DThreadSafetyTIL.cpp210 BasicBlock *Candidate = nullptr; local
216 if (Candidate == nullptr) {
217 Candidate = Pred;
222 while (Alternate != Candidate) {
223 if (Candidate->BlockID > Alternate->BlockID)
224 Candidate = Candidate->DominatorNode.Parent;
229 DominatorNode.Parent = Candidate;
237 BasicBlock *Candidate = nullptr; local
243 if (Candidate
[all...]
/freebsd-11.0-release/contrib/llvm/lib/Transforms/Scalar/
H A DStraightLineStrengthReduce.cpp83 struct Candidate : public ilist_node<Candidate> { struct in class:__anon3265::StraightLineStrengthReduce
91 Candidate() function in struct:__anon3265::StraightLineStrengthReduce::Candidate
94 Candidate(Kind CT, const SCEV *B, ConstantInt *Idx, Value *S, function in struct:__anon3265::StraightLineStrengthReduce::Candidate
122 Candidate *Basis;
150 bool isBasisFor(const Candidate &Basis, const Candidate &C);
152 bool isFoldable(const Candidate &C, TargetTransformInfo *TTI,
156 bool isSimplestForm(const Candidate &C);
181 void allocateCandidatesAndFindBasis(Candidate
[all...]
H A DNaryReassociate.cpp424 Value *Candidate = findClosestMatchingDominator(CandidateExpr, GEP); local
425 if (Candidate == nullptr)
429 // Candidate does not necessarily have the same pointer type as GEP. Use
432 Candidate = Builder.CreateBitOrPointerCast(Candidate, GEP->getType());
433 assert(Candidate->getType() == GEP->getType());
435 // NewGEP = (char *)Candidate + RHS * sizeof(IndexedType)
456 // NewGEP = &Candidate[RHS * (sizeof(IndexedType) / sizeof(Candidate[0])));
465 cast<GetElementPtrInst>(Builder.CreateGEP(Candidate, RH
[all...]
H A DSink.cpp191 assert(SuccToSinkTo && "Candidate sink target is null");
263 BasicBlock *Candidate = (*I)->getBlock(); local
265 IsAcceptableTarget(Inst, Candidate))
266 SuccToSinkTo = Candidate;
H A DSeparateConstOffsetFromGEP.cpp1106 Instruction *Candidate = Candidates.back(); local
1107 if (DT->dominates(Candidate, Dominatee))
1108 return Candidate;
/freebsd-11.0-release/contrib/llvm/lib/Target/AArch64/
H A DAArch64CollectLOH.cpp827 for (const MachineInstr *Candidate : PotentialCandidates) {
829 const MachineInstr *Def = *UseToDefs.find(Candidate)->second.begin();
874 for (const MachineInstr *Candidate : PotentialCandidates) {
875 if (!UseToDefs.find(Candidate)->second.empty())
877 *UseToDefs.find(Candidate)->second.begin());
902 if (isCandidateLoad(Candidate)) {
907 if (!supportLoadFromLiteral(Candidate))
910 DEBUG(dbgs() << "Record AdrpLdr:\n" << *L1 << '\n' << *Candidate local
914 Args.push_back(Candidate);
917 assert((!InvolvedInLOHs || InvolvedInLOHs->insert(Candidate))
922 << "Ldr:\\n" << *L1 << '\\n' << *L2 << '\\n' << *Candidate local
956 << "Str:\\n" << *L1 << '\\n' << *L2 << '\\n' << *Candidate local
[all...]
/freebsd-11.0-release/contrib/llvm/tools/clang/lib/Sema/
H A DScope.cpp119 if (VarDecl *Candidate = NRVO.getPointer()) {
120 if (isDeclScope(Candidate))
121 Candidate->setNRVOVariable(true);
H A DSemaOverload.cpp5743 OverloadCandidate &Candidate = CandidateSet.addCandidate(Args.size()); local
5744 Candidate.FoundDecl = FoundDecl;
5745 Candidate.Function = Function;
5746 Candidate.Viable = true;
5747 Candidate.IsSurrogate = false;
5748 Candidate.IgnoreObjectArgument = false;
5749 Candidate.ExplicitCallArguments = Args.size();
5760 Candidate.Viable = false;
5761 Candidate.FailureKind = ovl_fail_illegal_constructor;
5773 Candidate
6136 OverloadCandidate &Candidate = CandidateSet.addCandidate(Args.size() + 1); local
6262 OverloadCandidate &Candidate = CandidateSet.addCandidate(); local
6313 OverloadCandidate &Candidate = CandidateSet.addCandidate(); local
6411 OverloadCandidate &Candidate = CandidateSet.addCandidate(1); local
6563 OverloadCandidate &Candidate = CandidateSet.addCandidate(); local
6601 OverloadCandidate &Candidate = CandidateSet.addCandidate(Args.size() + 1); local
6762 OverloadCandidate &Candidate = CandidateSet.addCandidate(Args.size()); local
[all...]
H A DSemaLookup.cpp3676 TypoCorrection &Candidate) {
3677 Candidate.setCallbackDistance(CCC.RankCandidate(Candidate));
3678 return Candidate.getEditDistance(false) != TypoCorrection::InvalidDistance;
3935 bool TypoCorrectionConsumer::resolveCorrection(TypoCorrection &Candidate) {
3936 IdentifierInfo *Name = Candidate.getCorrectionAsIdentifierInfo();
3943 Name == Typo && !Candidate.WillReplaceSpecifier());
3951 Candidate.WillReplaceSpecifier(true);
3961 QualifiedResults.push_back(Candidate);
3972 Candidate
[all...]
H A DSemaCodeComplete.cpp3939 for (auto &Candidate : CandidateSet)
3940 if (Candidate.Viable)
3941 Results.push_back(ResultCandidate(Candidate.Function));
3955 for (auto &Candidate : Candidates) {
3956 if (auto FType = Candidate.getFunctionType())
/freebsd-11.0-release/contrib/llvm/lib/Target/Hexagon/
H A DHexagonMachineScheduler.cpp475 SchedCandidate &Candidate,
541 SchedCandidate &Candidate) {
555 int CurrentCost = SchedulingCost(Q, *I, Candidate, RPDelta, false);
558 if (!Candidate.SU) {
559 Candidate.SU = *I;
560 Candidate.RPDelta = RPDelta;
561 Candidate.SCost = CurrentCost;
567 if (CurrentCost > Candidate.SCost) {
569 Candidate.SU = *I;
570 Candidate
474 SchedulingCost(ReadyQueue &Q, SUnit *SU, SchedCandidate &Candidate, RegPressureDelta &Delta, bool verbose) argument
540 pickNodeFromQueue(ReadyQueue &Q, const RegPressureTracker &RPTracker, SchedCandidate &Candidate) argument
[all...]
H A DHexagonMachineScheduler.h229 SUnit *SU, SchedCandidate &Candidate,
234 SchedCandidate &Candidate);
/freebsd-11.0-release/contrib/llvm/lib/Target/Mips/
H A DMipsDelaySlotFiller.cpp206 /// This function checks if it is valid to move Candidate to the delay slot
209 bool delayHasHazard(const MachineInstr &Candidate, RegDefsUses &RegDU,
247 bool terminateSearch(const MachineInstr &Candidate) const;
870 bool Filler::delayHasHazard(const MachineInstr &Candidate, RegDefsUses &RegDU, argument
872 assert(!Candidate.isKill() &&
875 bool HasHazard = Candidate.isImplicitDef();
877 HasHazard |= IM.hasHazard(Candidate);
878 HasHazard |= RegDU.update(Candidate, 0, Candidate.getNumOperands());
883 bool Filler::terminateSearch(const MachineInstr &Candidate) cons
[all...]
/freebsd-11.0-release/contrib/llvm/include/llvm/Target/
H A DTargetMachine.h147 bool isCompatibleDataLayout(const DataLayout &Candidate) const {
148 return DL == Candidate;
/freebsd-11.0-release/contrib/llvm/lib/Target/Hexagon/MCTargetDesc/
H A DHexagonMCInstrInfo.cpp610 DuplexCandidate Candidate) {
611 assert(Candidate.packetIndexI < MCB.size());
612 assert(Candidate.packetIndexJ < MCB.size());
615 deriveDuplex(Context, Candidate.iClass,
616 *MCB.getOperand(Candidate.packetIndexJ).getInst(),
617 *MCB.getOperand(Candidate.packetIndexI).getInst());
619 MCB.getOperand(Candidate.packetIndexI).setInst(Duplex);
620 MCB.erase(MCB.begin() + Candidate.packetIndexJ);
609 replaceDuplex(MCContext &Context, MCInst &MCB, DuplexCandidate Candidate) argument
H A DHexagonMCInstrInfo.h270 // Replace the instructions inside MCB, represented by Candidate
271 void replaceDuplex(MCContext &Context, MCInst &MCB, DuplexCandidate Candidate);
/freebsd-11.0-release/contrib/llvm/lib/Target/AMDGPU/
H A DSIFoldOperands.cpp132 for (auto Candidate : FoldList) {
133 if (Candidate.UseMI == MI)
/freebsd-11.0-release/contrib/llvm/lib/CodeGen/
H A DMachineLICM.cpp495 for (CandidateInfo &Candidate : Candidates) {
496 if (Candidate.FI != INT_MIN &&
497 StoredFIs.count(Candidate.FI))
500 unsigned Def = Candidate.Def;
503 MachineInstr *MI = Candidate.MI;
517 HoistPostRA(MI, Candidate.Def);
/freebsd-11.0-release/contrib/llvm/tools/clang/lib/Parse/
H A DParseTentative.cpp1015 bool ValidateCandidate(const TypoCorrection &Candidate) override {
1018 if (Candidate.isResolved() && !Candidate.isKeyword() &&
1019 std::all_of(Candidate.begin(), Candidate.end(),
1023 return CorrectionCandidateCallback::ValidateCandidate(Candidate);
/freebsd-11.0-release/contrib/llvm/lib/Target/ARM/
H A DARMLoadStoreOptimizer.cpp1000 MergeCandidate *Candidate = new(Allocator.Allocate()) MergeCandidate; local
1002 Candidate->Instrs.push_back(MemOps[C].MI);
1003 Candidate->LatestMIIdx = Latest - SIndex;
1004 Candidate->EarliestMIIdx = Earliest - SIndex;
1005 Candidate->InsertPos = MemOps[Latest].Position;
1008 Candidate->CanMergeToLSMulti = CanMergeToLSMulti;
1009 Candidate->CanMergeToLSDouble = CanMergeToLSDouble;
1010 Candidates.push_back(Candidate);
1752 for (const MergeCandidate *Candidate : Candidates) {
1753 if (Candidate
[all...]
/freebsd-11.0-release/contrib/llvm/tools/clang/include/clang/Sema/
H A DSemaInternal.h296 bool resolveCorrection(TypoCorrection &Candidate);
/freebsd-11.0-release/contrib/llvm/include/llvm/CodeGen/
H A DMachineScheduler.h906 SchedCandidate &Candidate);
/freebsd-11.0-release/contrib/llvm/lib/Target/X86/
H A DX86FrameLowering.cpp2433 for (auto Candidate : RegClass) {
2438 if (!RegMask.clobbersPhysReg(Candidate))
2443 if (MO.isReg() && MO.isDef() && MO.getReg() == Candidate) {
2452 Regs[FoundRegs++] = Candidate;
/freebsd-11.0-release/contrib/llvm/tools/clang/lib/Driver/
H A DToolChains.cpp1371 for (StringRef Candidate : ExtraTripleAliases) // Try these first.
1372 ScanLibDirForGCCTriple(TargetTriple, Args, LibDir, Candidate);
1373 for (StringRef Candidate : CandidateTripleAliases)
1374 ScanLibDirForGCCTriple(TargetTriple, Args, LibDir, Candidate);
1380 for (StringRef Candidate : CandidateBiarchTripleAliases)
1381 ScanLibDirForGCCTriple(TargetTriple, Args, LibDir, Candidate,
1395 OS << "Candidate multilib: " << Multilib << "\n";
/freebsd-11.0-release/contrib/llvm/lib/Analysis/
H A DScalarEvolution.cpp7951 /// Is MaybeMaxExpr an SMax or UMax of Candidate and some other values?
7954 const SCEV *Candidate) {
7958 return find(MaxExpr->operands(), Candidate) != MaxExpr->op_end();
7962 /// Is MaybeMinExpr an SMin or UMin of Candidate and some other values?
7966 const SCEV *Candidate) {
7971 return IsMaxConsistingOf<MaxExprType>(MaybeMaxExpr, SE.getNotSCEV(Candidate));

Completed in 209 milliseconds

12