Home
last modified time | relevance | path

Searched refs:Candidate (Results 1 – 25 of 99) sorted by relevance

1234

/freebsd/contrib/llvm-project/clang/lib/Basic/
H A DSimpleTypoCorrection.cpp21 void SimpleTypoCorrection::add(const StringRef Candidate) { in add() argument
22 if (Candidate.empty()) in add()
26 abs(static_cast<int>(Candidate.size()) - static_cast<int>(Typo.size())); in add()
32 Candidate, /*AllowReplacements*/ true, MaxEditDistance); in add()
35 BestCandidate = Candidate; in add()
43 void SimpleTypoCorrection::add(const char *Candidate) { in add() argument
44 if (Candidate) in add()
45 add(StringRef(Candidate)); in add()
48 void SimpleTypoCorrection::add(const IdentifierInfo *Candidate) { in add() argument
49 if (Candidate) in add()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DStraightLineStrengthReduce.cpp137 struct Candidate { struct in __anon0eec50480111::StraightLineStrengthReduce
145 Candidate() = default;
146 Candidate(Kind CT, const SCEV *B, ConstantInt *Idx, Value *S, in Candidate() argument
179 Candidate *Basis = nullptr; argument
187 bool isBasisFor(const Candidate &Basis, const Candidate &C);
190 bool isFoldable(const Candidate &C, TargetTransformInfo *TTI,
195 bool isSimplestForm(const Candidate &C);
227 void allocateCandidatesAndFindBasis(Candidate::Kind CT, const SCEV *B,
232 void rewriteCandidateWithBasis(const Candidate &C, const Candidate &Basis);
241 static Value *emitBump(const Candidate &Basis, const Candidate &C,
[all …]
/freebsd/contrib/llvm-project/clang/lib/Analysis/
H A DThreadSafetyTIL.cpp208 BasicBlock *Candidate = nullptr; in computeDominator() local
214 if (Candidate == nullptr) { in computeDominator()
215 Candidate = Pred; in computeDominator()
220 while (Alternate != Candidate) { in computeDominator()
221 if (Candidate->BlockID > Alternate->BlockID) in computeDominator()
222 Candidate = Candidate->DominatorNode.Parent; in computeDominator()
227 DominatorNode.Parent = Candidate; in computeDominator()
235 BasicBlock *Candidate = nullptr; in computePostDominator() local
241 if (Candidate == nullptr) { in computePostDominator()
242 Candidate = Succ; in computePostDominator()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/
H A DVLIWMachineScheduler.cpp522 const RegPressureTracker &RPTracker, SchedCandidate &Candidate, in readyQueueVerboseDump() argument
535 SchedulingCost(Q, *I, Candidate, RPDelta, true); in readyQueueVerboseDump()
594 SchedCandidate &Candidate, in SchedulingCost() argument
768 SchedCandidate &Candidate) { in pickNodeFromQueue() argument
771 readyQueueVerboseDump(RPTracker, Candidate, Q); in pickNodeFromQueue()
785 int CurrentCost = SchedulingCost(Q, *I, Candidate, RPDelta, false); in pickNodeFromQueue()
788 if (!Candidate.SU) { in pickNodeFromQueue()
790 Candidate.SU = *I; in pickNodeFromQueue()
791 Candidate.RPDelta = RPDelta; in pickNodeFromQueue()
792 Candidate.SCost = CurrentCost; in pickNodeFromQueue()
[all …]
H A DMIRVRegNamerUtils.cpp148 for (MachineInstr &Candidate : *MBB) { in renameInstsInMBB()
150 if (Candidate.mayStore() || Candidate.isBranch()) in renameInstsInMBB()
152 if (!Candidate.getNumOperands()) in renameInstsInMBB()
155 MachineOperand &MO = Candidate.getOperand(0); in renameInstsInMBB()
160 NamedVReg(MO.getReg(), Prefix + getInstructionOpcodeHash(Candidate))); in renameInstsInMBB()
/freebsd/contrib/llvm-project/llvm/lib/Target/AMDGPU/
H A DGCNMinRegStrategy.cpp24 struct Candidate : ilist_node<Candidate> { struct in __anon235545e00111::GCNMinRegScheduler
28 Candidate(const SUnit *SU_, int Priority_ = 0) in Candidate() function
32 SpecificBumpPtrAllocator<Candidate> Alloc;
33 using Queue = simple_ilist<Candidate>;
68 Candidate* pickCandidate();
133 GCNMinRegScheduler::Candidate* GCNMinRegScheduler::pickCandidate() { in pickCandidate()
140 Num = findMax(Num, [=](const Candidate &C) { return C.Priority; }); in pickCandidate()
145 Num = findMax(Num, [=](const Candidate &C) { in pickCandidate()
156 Num = findMax(Num, [=](const Candidate &C) { in pickCandidate()
170 Num = findMax(Num, [=](const Candidate &C) { return -(int64_t)C.SU->NodeNum; }); in pickCandidate()
[all …]
H A DGCNILPSched.cpp22 struct Candidate : ilist_node<Candidate> { struct in __anon1a74e9370111::GCNILPScheduler
25 Candidate(SUnit *SU_) in Candidate() function
29 SpecificBumpPtrAllocator<Candidate> Alloc;
30 using Queue = simple_ilist<Candidate>;
43 Candidate* pickCandidate();
238 GCNILPScheduler::Candidate* GCNILPScheduler::pickCandidate() { in pickCandidate()
283 PendingQueue.push_front(*new (Alloc.Allocate()) Candidate(PredSU)); in releasePredecessors()
306 *new (Alloc.Allocate()) Candidate(const_cast<SUnit*>(SU))); in schedule()
315 llvm::min_element(PendingQueue, [=](const Candidate &C1, in schedule()
316 const Candidate &C2) { in schedule()
/freebsd/contrib/llvm-project/llvm/include/llvm/CodeGen/
H A DMachineOutliner.h38 struct Candidate { struct
200 Candidate(unsigned StartIdx, unsigned Len, in Candidate() function
206 Candidate() = delete;
210 bool operator<(const Candidate &RHS) const {
221 std::vector<Candidate> Candidates;
244 for (const Candidate &C : Candidates) in getOutliningCost()
266 OutlinedFunction(std::vector<Candidate> &Candidates, unsigned SequenceSize, in OutlinedFunction()
271 for (Candidate &C : Candidates) in OutlinedFunction()
/freebsd/contrib/llvm-project/llvm/lib/Target/SystemZ/
H A DSystemZMachineScheduler.cpp177 Candidate Best; in pickNode()
181 Candidate c(SU, *HazardRec); in pickNode()
202 SystemZPostRASchedStrategy::Candidate::
203 Candidate(SUnit *SU_, SystemZHazardRecognizer &HazardRec) : Candidate() { in Candidate() function in SystemZPostRASchedStrategy::Candidate
215 bool SystemZPostRASchedStrategy::Candidate::
216 operator<(const Candidate &other) { in operator <()
246 Candidate c(SU, *HazardRec); c.dumpCosts(); dbgs() << "\n";); in schedNode()
H A DSystemZMachineScheduler.h39 struct Candidate { struct
48 Candidate() = default; argument
49 Candidate(SUnit *SU_, SystemZHazardRecognizer &HazardRec);
52 bool operator<(const Candidate &other);
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Instrumentation/
H A DIndirectCallPromotion.cpp596 auto &Candidate = Candidates[CalleeIndexIter->second]; in computeVTableInfos() local
600 Candidate.VTableGUIDAndCounts[VTableVal] = V.Count; in computeVTableInfos()
601 Candidate.AddressPoints.push_back( in computeVTableInfos()
731 for (const auto &Candidate : Candidates) { in tryToPromoteWithVTableCmp() local
732 for (auto &[GUID, Count] : Candidate.VTableGUIDAndCounts) in tryToPromoteWithVTableCmp()
740 CB, VPtr, Candidate.TargetFunction, Candidate.AddressPoints, in tryToPromoteWithVTableCmp()
741 createBranchWeights(CB.getContext(), Candidate.Count, in tryToPromoteWithVTableCmp()
742 TotalFuncCount - Candidate.Count)); in tryToPromoteWithVTableCmp()
749 const auto &VTableGUIDAndCounts = Candidate.VTableGUIDAndCounts; in tryToPromoteWithVTableCmp()
751 << ore::NV("DirectCallee", Candidate.TargetFunction) in tryToPromoteWithVTableCmp()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Transforms/IPO/
H A DSampleProfile.cpp505 Function &F, InlineCandidate &Candidate, uint64_t SumOrigin,
512 InlineCost shouldInlineCandidate(InlineCandidate &Candidate);
515 tryInlineCandidate(InlineCandidate &Candidate,
806 static bool doesHistoryAllowICP(const Instruction &Inst, StringRef Candidate) { in doesHistoryAllowICP() argument
823 if (V.Value == Function::getGUIDAssumingExternalLinkage(Candidate)) in doesHistoryAllowICP()
920 Function &F, InlineCandidate &Candidate, uint64_t SumOrigin, uint64_t &Sum, in tryPromoteAndInlineCandidate() argument
930 auto CalleeFunctionName = Candidate.CalleeSamples->getFunction(); in tryPromoteAndInlineCandidate()
935 auto &CI = *Candidate.CallInstr; in tryPromoteAndInlineCandidate()
957 CI, R->second, Candidate.CallsiteCount, Sum, false, ORE); in tryPromoteAndInlineCandidate()
959 Sum -= Candidate.CallsiteCount; in tryPromoteAndInlineCandidate()
[all …]
H A DIROutliner.cpp189 std::optional<unsigned> GVN = Candidate->getGVN(V); in findCorrespondingValueIn()
191 std::optional<unsigned> CanonNum = Candidate->getCanonicalNum(*GVN); in findCorrespondingValueIn()
193 Other.Candidate->fromCanonicalNum(*CanonNum); in findCorrespondingValueIn()
194 std::optional<Value *> FoundValueOpt = Other.Candidate->fromGVN(*FirstGVN); in findCorrespondingValueIn()
252 Instruction *BackInst = Candidate->backInstruction(); in splitCandidate()
262 EndInst = Candidate->end()->Inst; in splitCandidate()
274 Instruction *StartInst = (*Candidate->begin()).Inst; in splitCandidate()
280 Candidate->getBasicBlocks(BBSet); in splitCandidate()
368 Candidate->getBasicBlocks(BBSet); in splitCandidate()
408 Instruction *StartInst = (*Candidate->begin()).Inst; in reattachCandidate()
[all …]
H A DSampleProfileMatcher.cpp232 const auto &Candidate = R->second; in matchNonCallsiteLocs() local
233 InsertMatching(Loc, Candidate); in matchNonCallsiteLocs()
235 << " is matched from " << Loc << " to " << Candidate in matchNonCallsiteLocs()
237 LocationDelta = Candidate.LineOffset - Loc.LineOffset; in matchNonCallsiteLocs()
247 LineLocation Candidate(CandidateLineOffset, L.Discriminator); in matchNonCallsiteLocs() local
248 InsertMatching(L, Candidate); in matchNonCallsiteLocs()
250 << " to " << Candidate << "\n"); in matchNonCallsiteLocs()
260 LineLocation Candidate(CandidateLineOffset, Loc.Discriminator); in matchNonCallsiteLocs() local
261 InsertMatching(Loc, Candidate); in matchNonCallsiteLocs()
263 << Candidate << "\n"); in matchNonCallsiteLocs()
/freebsd/contrib/llvm-project/clang/include/clang/Basic/
H A DSimpleTypoCorrection.h38 void add(const StringRef Candidate);
39 void add(const char *Candidate);
40 void add(const IdentifierInfo *Candidate);
/freebsd/contrib/bmake/
H A Dsuff.c197 typedef struct Candidate { struct
212 struct Candidate *parent; argument
224 } Candidate; typedef
926 CandidateSearcher_Add(CandidateSearcher *cs, Candidate *cand) in CandidateSearcher_Add()
933 CandidateSearcher_AddIfNew(CandidateSearcher *cs, Candidate *cand) in CandidateSearcher_AddIfNew()
955 Candidate *cand = ln->datum; in CandidateList_PrintAddrs()
962 static Candidate *
963 Candidate_New(char *name, char *prefix, Suffix *suff, Candidate *parent, in Candidate_New()
966 Candidate *cand = bmake_malloc(sizeof *cand); in Candidate_New()
983 CandidateList_Add(CandidateList *list, char *srcName, Candidate *targ, in CandidateList_Add()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Target/SPIRV/Analysis/
H A DSPIRVConvergenceRegionAnalysis.cpp80 ConvergenceRegion *Candidate = nullptr; in findParentRegion() local
83 while (Candidate != NextCandidate && NextCandidate != nullptr) { in findParentRegion()
84 Candidate = NextCandidate; in findParentRegion()
88 if (Candidate->Children.size() == 0) in findParentRegion()
89 return Candidate; in findParentRegion()
91 for (auto *Child : Candidate->Children) { in findParentRegion()
99 return Candidate; in findParentRegion()
/freebsd/contrib/llvm-project/clang/lib/Driver/ToolChains/
H A DROCm.h65 struct Candidate { struct
74 Candidate(std::string Path, bool StrictChecking = false, argument
148 SmallVector<Candidate, 4> ROCmSearchDirs;
161 const SmallVectorImpl<Candidate> &getInstallationPathCandidates();
167 llvm::SmallString<0> findSPACKPackage(const Candidate &Cand,
/freebsd/contrib/llvm-project/llvm/lib/Target/Mips/
H A DMipsDelaySlotFiller.cpp249 bool delayHasHazard(const MachineInstr &Candidate, RegDefsUses &RegDU,
287 bool terminateSearch(const MachineInstr &Candidate) const;
949 bool MipsDelaySlotFiller::delayHasHazard(const MachineInstr &Candidate, in delayHasHazard() argument
952 assert(!Candidate.isKill() && in delayHasHazard()
955 bool HasHazard = Candidate.isImplicitDef(); in delayHasHazard()
957 HasHazard |= IM.hasHazard(Candidate); in delayHasHazard()
958 HasHazard |= RegDU.update(Candidate, 0, Candidate.getNumOperands()); in delayHasHazard()
963 bool MipsDelaySlotFiller::terminateSearch(const MachineInstr &Candidate) const { in terminateSearch()
964 return (Candidate.isTerminator() || Candidate.isCall() || in terminateSearch()
965 Candidate.isPosition() || Candidate.isInlineAsm() || in terminateSearch()
[all …]
/freebsd/contrib/llvm-project/clang/lib/Sema/
H A DSemaOverload.cpp7100 OverloadCandidate &Candidate = in AddOverloadCandidate() local
7102 Candidate.FoundDecl = FoundDecl; in AddOverloadCandidate()
7103 Candidate.Function = Function; in AddOverloadCandidate()
7104 Candidate.Viable = true; in AddOverloadCandidate()
7105 Candidate.RewriteKind = in AddOverloadCandidate()
7107 Candidate.IsADLCandidate = llvm::to_underlying(IsADLCandidate); in AddOverloadCandidate()
7108 Candidate.ExplicitCallArguments = Args.size(); in AddOverloadCandidate()
7109 Candidate.StrictPackMatch = StrictPackMatch; in AddOverloadCandidate()
7115 Candidate.Viable = false; in AddOverloadCandidate()
7116 Candidate.FailureKind = ovl_fail_explicit; in AddOverloadCandidate()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/GlobalISel/
H A DLoadStoreOpt.cpp583 StoreMergeCandidate Candidate; in mergeBlockStores() local
591 if (!addStoreToCandidate(*StoreMI, Candidate)) { in mergeBlockStores()
594 if (operationAliasesWithCandidate(*StoreMI, Candidate)) { in mergeBlockStores()
595 Changed |= processMergeCandidate(Candidate); in mergeBlockStores()
598 Candidate.addPotentialAlias(*StoreMI); in mergeBlockStores()
604 if (Candidate.Stores.empty()) in mergeBlockStores()
609 Changed |= processMergeCandidate(Candidate); in mergeBlockStores()
610 Candidate.Stores.clear(); in mergeBlockStores()
617 if (operationAliasesWithCandidate(MI, Candidate)) { in mergeBlockStores()
620 Changed |= processMergeCandidate(Candidate); in mergeBlockStores()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Vectorize/
H A DVPlanSLP.cpp304 for (auto *Candidate : Candidates) { in getBest() local
306 auto *CandidateI = cast<VPInstruction>(Candidate); in getBest()
308 LLVM_DEBUG(dbgs() << *cast<VPInstruction>(Candidate)->getUnderlyingInstr() in getBest()
310 BestCandidates.push_back(Candidate); in getBest()
328 for (auto *Candidate : BestCandidates) { in getBest() local
329 unsigned Score = getLAScore(Last, Candidate, Depth, IAI); in getBest()
338 Best = Candidate; in getBest()
/freebsd/contrib/llvm-project/clang/utils/TableGen/
H A DClangOpenCLBuiltinEmitter.cpp132 BuiltinIndexListTy *Candidate,
650 BuiltinIndexListTy *Candidate, in CanReuseSignature() argument
652 assert(Candidate->size() == SignatureList.size() && in CanReuseSignature()
656 SignatureListMap.find(Candidate)->second.Signatures; in CanReuseSignature()
657 for (unsigned Index = 0; Index < Candidate->size(); Index++) { in CanReuseSignature()
692 for (auto *Candidate : KnownSignatures) { in GroupBySignature() local
693 if (Candidate->size() == CurSignatureList->size() && in GroupBySignature()
694 *Candidate == *CurSignatureList) { in GroupBySignature()
695 if (CanReuseSignature(Candidate, Fct.second)) { in GroupBySignature()
696 SignatureListMap.find(Candidate)->second.Names.push_back(Fct.first); in GroupBySignature()
/freebsd/contrib/llvm-project/llvm/lib/Target/Hexagon/
H A DHexagonMachineScheduler.cpp46 SchedCandidate &Candidate, in SchedulingCost() argument
50 ConvergingVLIWScheduler::SchedulingCost(Q, SU, Candidate, Delta, verbose); in SchedulingCost()
/freebsd/contrib/llvm-project/clang/lib/AST/
H A DExternalASTMerger.cpp34 typedef std::pair<Source<NamedDecl *>, ASTImporter *> Candidate; typedef
242 bool HasDeclOfSameType(ArrayRef<Candidate> Decls, const Candidate &C) { in HasDeclOfSameType()
245 return llvm::any_of(Decls, [&](const Candidate &D) { in HasDeclOfSameType()
477 llvm::SmallVector<Candidate, 4> Candidates; in FindExternalVisibleDeclsByName()
479 auto FilterFoundDecl = [&Candidates](const Candidate &C) { in FindExternalVisibleDeclsByName()
504 for (const Candidate &C : Candidates) { in FindExternalVisibleDeclsByName()

1234