| /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...] |
| CSPreInliner.h | 24 // Inline candidate seen from profile
29 // Context-sensitive function profile for inline candidate
31 // Call site count for an inline candidate
40 // Inline candidate comparer using call site weight
79 bool shouldInline(ProfiledInlineCandidate &Candidate);
|
| /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/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...] |
| /src/external/apache2/llvm/dist/llvm/lib/Target/SystemZ/ |
| 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);
|
| 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...] |
| /src/external/apache2/llvm/dist/llvm/lib/Transforms/Scalar/ |
| 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...] |
| 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...] |
| /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/lib/Target/Hexagon/ |
| HexagonMachineScheduler.cpp | 50 static cl::opt<bool> UseNewerCandidate("use-newer-candidate",
456 /// If this queue only has one ready candidate, return it. As a side effect,
498 const RegPressureTracker &RPTracker, SchedCandidate &Candidate,
511 SchedulingCost(Q, *I, Candidate, RPDelta, true);
577 SchedCandidate &Candidate,
759 /// Pick the best candidate from the top queue.
766 SchedCandidate &Candidate) {
769 readyQueueVerboseDump(RPTracker, Candidate, Q);
775 // BestSU remains NULL if no top candidates beat the best existing candidate.
783 int CurrentCost = SchedulingCost(Q, *I, Candidate, RPDelta, false)
[all...] |
| /src/external/apache2/llvm/dist/clang/lib/Driver/ToolChains/ |
| 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...] |
| AMDGPU.cpp | 32 // Look for sub-directory starts with PackageName under ROCm candidate path.
39 RocmInstallationDetector::findSPACKPackage(const Candidate &Cand,
168 /// \returns a list of candidate directories for ROCm installation, which is
170 const SmallVectorImpl<RocmInstallationDetector::Candidate> &
173 // Return the cached candidate list if it has already been populated.
187 // For candidate specified by --rocm-path we do not do strict check, i.e.,
222 // installation candidate for SPACK.
229 return Candidate(ParentDir.str(), /*StrictChecking=*/true,
239 return Candidate(ParentDir.str(), /*StrictChecking=*/true);
375 for (const auto &Candidate : ROCmDirs)
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/CodeGen/ |
| MIRVRegNamerUtils.cpp | 148 for (MachineInstr &Candidate : *MBB) {
150 if (Candidate.mayStore() || Candidate.isBranch())
152 if (!Candidate.getNumOperands())
155 MachineOperand &MO = Candidate.getOperand(0);
160 NamedVReg(MO.getReg(), Prefix + getInstructionOpcodeHash(Candidate)));
|
| /src/external/apache2/llvm/dist/clang/utils/TableGen/ |
| ClangOpenCLBuiltinEmitter.cpp | 125 // \param Candidate (in) Entry in the SignatureListMap to check.
129 BuiltinIndexListTy *Candidate,
547 BuiltinIndexListTy *Candidate,
549 assert(Candidate->size() == SignatureList.size() &&
553 SignatureListMap.find(Candidate)->second.Signatures;
554 for (unsigned Index = 0; Index < Candidate->size(); Index++) {
589 for (auto *Candidate : KnownSignatures) {
590 if (Candidate->size() == CurSignatureList->size() &&
591 *Candidate == *CurSignatureList) {
592 if (CanReuseSignature(Candidate, Fct.second))
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/Transforms/IPO/ |
| 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...] |
| 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...] |
| /src/external/apache2/llvm/dist/clang/lib/Sema/ |
| Scope.cpp | 122 if (VarDecl *Candidate = NRVO.getPointer()) {
123 if (isDeclScope(Candidate))
124 Candidate->setNRVOVariable(true);
199 OS << "NRVO candidate : (clang::VarDecl*)" << NRVO.getPointer() << '\n';
|
| SemaOverload.cpp | 611 /// to the form used in overload-candidate information.
899 // Don't bother adding a reversed candidate that can never be a better
3427 // constructor. [...] For copy-initialization, the candidate
3475 // X] and the constructor [...] is a candidate by [...] the second
6160 // First, build a candidate set from the previously recorded
6166 // Then, perform overload resolution over the candidate set.
6259 /// candidate functions, using the given function call arguments. If
6318 // candidate functions.
6323 // Add this candidate
6324 OverloadCandidate &Candidate
[all...] |
| /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/Transforms/Vectorize/ |
| VPlanSLP.cpp | 256 for (auto *Candidate : Candidates) {
258 auto *CandidateI = cast<VPInstruction>(Candidate);
260 LLVM_DEBUG(dbgs() << *cast<VPInstruction>(Candidate)->getUnderlyingInstr()
262 BestCandidates.push_back(Candidate);
280 for (auto *Candidate : BestCandidates) {
281 unsigned Score = getLAScore(Last, Candidate, Depth, IAI);
290 Best = Candidate;
|
| /src/external/apache2/llvm/dist/llvm/lib/Target/Mips/ |
| MipsDelaySlotFiller.cpp | 193 /// disqualify the delay slot candidate between V and values in Uses and
252 /// This function checks if it is valid to move Candidate to the delay slot
255 bool delayHasHazard(const MachineInstr &Candidate, RegDefsUses &RegDU,
293 bool terminateSearch(const MachineInstr &Candidate) const;
947 bool MipsDelaySlotFiller::delayHasHazard(const MachineInstr &Candidate,
950 assert(!Candidate.isKill() &&
953 bool HasHazard = Candidate.isImplicitDef();
955 HasHazard |= IM.hasHazard(Candidate);
956 HasHazard |= RegDU.update(Candidate, 0, Candidate.getNumOperands())
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/Demangle/ |
| MicrosoftDemangle.cpp | 149 StringView Candidate = S.substr(0, End);
150 if (Candidate.empty())
155 if (Candidate.size() == 1)
156 return Candidate[0] == '@' || (Candidate[0] >= '0' && Candidate[0] <= '9');
159 if (Candidate.back() != '@')
161 Candidate = Candidate.dropBack();
169 if (Candidate[0] < 'B' || Candidate[0] > 'P'
[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/Target/RISCV/ |
| RISCVInstrInfo.h | 122 std::vector<outliner::Candidate> &RepeatedSequenceLocs) const override;
138 const outliner::Candidate &C) const override;
|
