| /src/external/apache2/llvm/dist/clang/lib/Analysis/ |
| ThreadSafetyTIL.cpp | 209 BasicBlock *Candidate = nullptr;
214 // If we don't yet have a candidate for dominator yet, take this one.
215 if (Candidate == nullptr) {
216 Candidate = Pred;
219 // Walk the alternate and current candidate back to find a common ancestor.
221 while (Alternate != Candidate) {
222 if (Candidate->BlockID > Alternate->BlockID)
223 Candidate = Candidate->DominatorNode.Parent;
228 DominatorNode.Parent = Candidate;
[all...] |
| CalledOnceCheck.cpp | 363 const DeclRefExpr *Candidate = Visit(CE->getArg(0));
364 return Candidate != nullptr ? Candidate : Visit(CE->getArg(1));
|
| CloneDetection.cpp | 506 const StmtSequence &Candidate = HashGroup[j];
508 if (!Compare(Prototype, Candidate))
511 PotentialGroup.push_back(Candidate);
|
| /src/external/apache2/llvm/dist/llvm/lib/Target/SystemZ/ |
| SystemZMachineScheduler.cpp | 176 Candidate Best;
179 // SU is the next candidate to be compared against current Best.
180 Candidate c(SU, *HazardRec);
182 // Remeber which SU is the best candidate.
201 SystemZPostRASchedStrategy::Candidate::
202 Candidate(SUnit *SU_, SystemZHazardRecognizer &HazardRec) : Candidate() {
214 bool SystemZPostRASchedStrategy::Candidate::
215 operator<(const Candidate &other) {
245 Candidate c(SU, *HazardRec); c.dumpCosts(); dbgs() << "\n";)
[all...] |
| SystemZMachineScheduler.h | 40 /// A candidate during instruction evaluation.
41 struct Candidate {
50 Candidate() = default;
51 Candidate(SUnit *SU_, SystemZHazardRecognizer &HazardRec);
54 bool operator<(const Candidate &other);
|
| /src/external/apache2/llvm/dist/llvm/tools/llvm-profgen/ |
| CSPreInliner.cpp | 101 bool CSPreInliner::shouldInline(ProfiledInlineCandidate &Candidate) {
105 return Candidate.CalleeSamples->getContext().hasAttribute(
111 if (Candidate.CallsiteCount > HotCountThreshold)
116 if (Candidate.CallsiteCount < ColdCountThreshold)
119 return (Candidate.SizeCost < SampleThreshold);
142 ProfiledInlineCandidate Candidate = CQueue.top();
145 if ((ShouldInline = shouldInline(Candidate))) {
148 ContextTracker.markContextSamplesInlined(Candidate.CalleeSamples);
149 Candidate.CalleeSamples->getContext().setAttribute(
151 FuncFinalSize += Candidate.SizeCost
[all...] |
| /src/external/apache2/llvm/dist/clang/lib/AST/ |
| ExternalASTMerger.cpp | 34 typedef std::pair<Source<NamedDecl *>, ASTImporter *> Candidate;
247 bool HasDeclOfSameType(llvm::ArrayRef<Candidate> Decls, const Candidate &C) {
250 return llvm::any_of(Decls, [&](const Candidate &D) {
482 llvm::SmallVector<Candidate, 4> Candidates;
484 auto FilterFoundDecl = [&Candidates](const Candidate &C) {
509 for (const Candidate &C : Candidates) {
|
| /src/external/apache2/llvm/dist/llvm/lib/Target/AMDGPU/ |
| GCNMinRegStrategy.cpp | 24 struct Candidate : ilist_node<Candidate> {
28 Candidate(const SUnit *SU_, int Priority_ = 0)
32 SpecificBumpPtrAllocator<Candidate> Alloc;
33 using Queue = simple_ilist<Candidate>;
68 Candidate* pickCandidate();
133 GCNMinRegScheduler::Candidate* GCNMinRegScheduler::pickCandidate() {
140 Num = findMax(Num, [=](const Candidate &C) { return C.Priority; });
143 LLVM_DEBUG(dbgs() << "\nSelecting min non-ready producing candidate among "
145 Num = findMax(Num, [=](const Candidate &C)
[all...] |
| GCNILPSched.cpp | 22 struct Candidate : ilist_node<Candidate> {
25 Candidate(SUnit *SU_)
29 SpecificBumpPtrAllocator<Candidate> Alloc;
30 typedef simple_ilist<Candidate> Queue;
43 Candidate* pickCandidate();
240 GCNILPScheduler::Candidate* GCNILPScheduler::pickCandidate() {
285 PendingQueue.push_front(*new (Alloc.Allocate()) Candidate(PredSU));
308 *new (Alloc.Allocate()) Candidate(const_cast<SUnit*>(SU)));
318 [=](const Candidate& C1, const Candidate& C2)
[all...] |
| /src/external/apache2/llvm/dist/llvm/include/llvm/CodeGen/ |
| MachineOutliner.h | 38 struct Candidate {
40 /// The start index of this \p Candidate in the instruction list.
43 /// The number of instructions in this \p Candidate.
46 // The first instruction in this \p Candidate.
49 // The last instruction in this \p Candidate.
52 // The basic block that contains this Candidate.
60 /// The index of this \p Candidate's \p OutlinedFunction in the list of
69 /// this \p Candidate.
76 /// instructions in this \p Candidate.
82 /// Target-specific flags for this Candidate's MBB
[all...] |
| /src/external/apache2/llvm/dist/llvm/include/llvm/Transforms/IPO/ |
| IROutliner.h | 66 IRSimilarityCandidate *Candidate;
135 : Candidate(&C), Parent(&Group) {
|
| /src/external/apache2/llvm/dist/llvm/lib/Transforms/AggressiveInstCombine/ |
| AggressiveInstCombine.cpp | 239 Value *Candidate;
241 if (!match(V, m_LShr(m_Value(Candidate), m_APInt(BitIndex))))
242 Candidate = V;
246 MOps.Root = Candidate;
254 return MOps.Root == Candidate;
|
| /src/external/apache2/llvm/dist/llvm/lib/Transforms/Scalar/ |
| NaryReassociate.cpp | 222 // tree. This order ensures that all bases of a candidate are in Candidates
414 Value *Candidate = findClosestMatchingDominator(CandidateExpr, GEP);
415 if (Candidate == nullptr)
419 // Candidate does not necessarily have the same pointer type as GEP. Use
422 Candidate = Builder.CreateBitOrPointerCast(Candidate, GEP->getType());
423 assert(Candidate->getType() == GEP->getType());
425 // NewGEP = (char *)Candidate + RHS * sizeof(IndexedType)
446 // NewGEP = &Candidate[RHS * (sizeof(IndexedType) / sizeof(Candidate[0])))
[all...] |
| StraightLineStrengthReduce.cpp | 132 // SLSR candidate. Such a candidate must be in one of the forms described in
134 struct Candidate {
142 Candidate() = default;
143 Candidate(Kind CT, const SCEV *B, ConstantInt *Idx, Value *S,
151 // Note that Index and Stride of a GEP candidate do not necessarily have the
158 // The instruction this candidate corresponds to. It helps us to rewrite a
159 // candidate with respect to its immediate basis. Note that one instruction
174 // Points to the immediate basis of this candidate, or nullptr if we cannot
175 // find any basis for this candidate
[all...] |
| SeparateConstOffsetFromGEP.cpp | 596 // If RHS wasn't a suitable candidate either, reset the chain again.
1191 // candidate that doesn't dominate the current instruction won't dominate any
1195 Instruction *Candidate = Candidates.back();
1196 if (DT->dominates(Candidate, Dominatee))
1197 return Candidate;
|
| /src/external/apache2/llvm/dist/clang/lib/Driver/ToolChains/ |
| Cuda.cpp | 124 struct Candidate {
128 Candidate(std::string Path, bool StrictChecking = false)
131 SmallVector<Candidate, 4> Candidates;
151 // case the candidate would be '/usr' which passes the following checks
181 for (const auto &Candidate : Candidates) {
182 InstallPath = Candidate.Path;
192 bool CheckLibDevice = (!NoCudaLib || Candidate.StrictChecking);
|
| ROCm.h | 41 // Installation path candidate.
42 struct Candidate {
51 Candidate(std::string Path, bool StrictChecking = false,
111 SmallVector<Candidate, 4> ROCmSearchDirs;
124 const SmallVectorImpl<Candidate> &getInstallationPathCandidates();
126 /// Find the path to a SPACK package under the ROCm candidate installation
127 /// directory if the candidate is a SPACK ROCm candidate. \returns empty
128 /// string if the candidate is not SPACK ROCm candidate or the requeste
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/Option/ |
| OptTable.cpp | 258 // Consider each [option prefix + option name] pair as a candidate, finding
284 // Now check if the candidate ends with a character commonly used when
298 // Consider each possible prefix for each candidate to find the most
303 std::string Candidate = (CandidatePrefix + CandidateName).str();
304 StringRef CandidateRef = Candidate;
309 // The Candidate ends with a = or : delimiter, but the option passed in
319 NearestString = (Candidate + RHS).str();
|
| /src/usr.bin/make/ |
| suff.c | 189 * A candidate when searching for implied sources.
191 * For example, when "src.o" is to be made, a typical candidate is "src.c"
194 * candidate as well. The first such chain that leads to an existing file or
197 typedef struct Candidate {
209 * The candidate that can be made from this, or NULL for the
210 * top-level candidate.
212 struct Candidate *parent;
218 * don't free this candidate too early or too late.
224 } Candidate;
926 CandidateSearcher_Add(CandidateSearcher *cs, Candidate *cand
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/Target/ARM/ |
| ARMLoadStoreOptimizer.cpp | 1101 // Form a candidate from the Ops collected so far.
1102 MergeCandidate *Candidate = new(Allocator.Allocate()) MergeCandidate;
1104 Candidate->Instrs.push_back(MemOps[C].MI);
1105 Candidate->LatestMIIdx = Latest - SIndex;
1106 Candidate->EarliestMIIdx = Earliest - SIndex;
1107 Candidate->InsertPos = MemOps[Latest].Position;
1110 Candidate->CanMergeToLSMulti = CanMergeToLSMulti;
1111 Candidate->CanMergeToLSDouble = CanMergeToLSDouble;
1112 Candidates.push_back(Candidate);
1992 for (const MergeCandidate *Candidate : Candidates)
[all...] |
| /src/external/apache2/llvm/dist/clang/lib/Tooling/ASTDiff/ |
| ASTDiff.cpp | 817 NodeId Candidate;
827 Candidate = Id2;
830 return Candidate;
|
| /src/external/apache2/llvm/dist/llvm/lib/Transforms/IPO/ |
| IROutliner.cpp | 127 assert(!CandidateSplit && "Candidate already split!");
129 Instruction *StartInst = (*Candidate->begin()).Inst;
130 Instruction *EndInst = (*Candidate->end()).Inst;
163 assert(CandidateSplit && "Candidate is not split!");
179 assert(StartBB != nullptr && "StartBB for Candidate is not defined!");
180 assert(FollowBB != nullptr && "StartBB for Candidate is not defined!");
295 IRSimilarityCandidate &C = *Region.Candidate;
502 IRSimilarityCandidate &C = *Region.Candidate;
573 IRSimilarityCandidate &C = *Region.Candidate;
643 IRSimilarityCandidate &C = *Region.Candidate;
[all...] |
| SampleProfile.cpp | 305 // Inline candidate used by iterative callsite prioritized inliner
319 // Inline candidate comparer using call site weight
380 Function &F, InlineCandidate &Candidate, uint64_t SumOrigin,
384 InlineCost shouldInlineCandidate(InlineCandidate &Candidate);
387 tryInlineCandidate(InlineCandidate &Candidate,
732 /// the promotion for \p Candidate.
733 /// If the profile count for the promotion candidate \p Candidate is
734 /// NOMORE_ICP_MAGICNUM, it means \p Candidate has already been promoted
738 static bool doesHistoryAllowICP(const Instruction &Inst, StringRef Candidate) {
[all...] |
| /src/external/apache2/llvm/dist/clang/lib/Sema/ |
| SemaCodeComplete.cpp | 1210 // Will Candidate ever be called on the object, when overloaded with Incumbent?
1211 // Returns Dominates if Candidate is always called, Dominated if Incumbent is
1214 static OverloadCompare compareOverloads(const CXXMethodDecl &Candidate,
1219 if (Candidate.getDeclContext() != Incumbent.getDeclContext())
1221 if (Candidate.isVariadic() != Incumbent.isVariadic() ||
1222 Candidate.getNumParams() != Incumbent.getNumParams() ||
1223 Candidate.getMinRequiredArguments() !=
1226 for (unsigned I = 0, E = Candidate.getNumParams(); I != E; ++I)
1227 if (Candidate.parameters()[I]->getType().getCanonicalType() !=
1230 if (!llvm::empty(Candidate.specific_attrs<EnableIfAttr>()) |
[all...] |
| SemaDecl.cpp | 79 bool ValidateCandidate(const TypoCorrection &candidate) override {
80 if (NamedDecl *ND = candidate.getCorrectionDecl()) {
108 return !WantClassName && candidate.isKeyword();
8244 bool ValidateCandidate(const TypoCorrection &candidate) override {
8245 if (candidate.getEditDistance() == 0)
8249 for (TypoCorrection::const_decl_iterator CDecl = candidate.begin(),
8250 CDeclEnd = candidate.end();
10143 assert(TA && "MultiVersion Candidate requires a target attribute");
10762 NamedDecl *Candidate = Previous.getRepresentativeDecl();
10763 if (shouldLinkPossiblyHiddenDecl(Candidate, NewFD))
[all...] |
