| /src/external/apache2/llvm/dist/llvm/lib/Transforms/Instrumentation/ |
| ValueProfilePlugins.inc | 10 // Each plugin is responsible for collecting Value Profiling candidates for a
29 std::vector<CandidateInfo> *Candidates;
35 : F(Fn), TLI(TLI), Candidates(nullptr) {}
38 Candidates = &Cs;
40 Candidates = nullptr;
50 Candidates->emplace_back(CandidateInfo{Length, InsertPt, AnnotatedInst});
67 Candidates->emplace_back(CandidateInfo{Length, InsertPt, AnnotatedInst});
81 void run(std::vector<CandidateInfo> &Candidates) {
87 Candidates.emplace_back(CandidateInfo{Callee, InsertPt, AnnotatedInst});
|
| ValueProfileCollector.cpp | 27 /// scan the function looking for candidates.
29 /// void run(std::vector<CandidateInfo> &Candidates);
42 void get(InstrProfValueKind K, std::vector<CandidateInfo> &Candidates) {}
54 void get(InstrProfValueKind K, std::vector<CandidateInfo> &Candidates) {
56 Plugin.run(Candidates);
57 Base::get(K, Candidates);
|
| IndirectCallPromotion.cpp | 202 const std::vector<PromotionCandidate> &Candidates,
339 CallBase &CB, const std::vector<PromotionCandidate> &Candidates,
343 for (auto &C : Candidates) {
|
| /src/external/apache2/llvm/dist/llvm/include/llvm/CodeGen/ |
| MachineOutliner.h | 117 /// candidates overlap. The true benefit is stored in the OutlinedFunction
129 /// Used to ensure that \p Candidates are outlined in an order that
130 /// preserves the start and end indices of other \p Candidates.
167 std::vector<Candidate> Candidates;
183 /// Return the number of candidates for this \p OutlinedFunction.
184 unsigned getOccurrenceCount() const { return Candidates.size(); }
190 for (const Candidate &C : Candidates)
210 unsigned getNumInstrs() const { return Candidates[0].getLength(); }
212 OutlinedFunction(std::vector<Candidate> &Candidates, unsigned SequenceSize,
214 : Candidates(Candidates), SequenceSize(SequenceSize)
[all...] |
| RegisterScavenging.h | 207 BitVector &Candidates,
|
| /src/external/apache2/llvm/dist/clang/include/clang/Sema/ |
| TemplateDeduction.h | 287 /// For now, assume that the candidates are non-matching specializations.
312 /// TemplateSpecCandidateSet - A set of generalized overload candidates,
317 SmallVector<TemplateSpecCandidate, 16> Candidates;
320 // Stores whether we're taking the address of these candidates. This helps us
337 /// Clear out all of the candidates.
343 iterator begin() { return Candidates.begin(); }
344 iterator end() { return Candidates.end(); }
346 size_t size() const { return Candidates.size(); }
347 bool empty() const { return Candidates.empty(); }
352 Candidates.emplace_back()
[all...] |
| Overload.h | 58 /// Ambiguous candidates found.
66 /// Requests that all candidates be shown. Viable candidates will
70 /// Requests that only viable candidates be shown.
73 /// Requests that only tied-for-best candidates be shown.
87 /// The kinds of rewrite we perform on overload candidates. Note that the
823 /// candidates such that all elements of the ambiguity kernel are better
824 /// than all viable candidates not in the ambiguity kernel.
914 /// OverloadCandidateSet - A set of overload candidates, used in C++
923 /// Lookup of operator function candidates in a call using operato
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/Transforms/Scalar/ |
| LoopLoadElimination.cpp | 12 // distance of one between stores and loads. These form the candidates for the
178 std::forward_list<StoreToLoadForwardingCandidate> Candidates;
182 return Candidates;
221 Candidates.emplace_front(Load, Store);
225 Candidates.remove_if([&](const StoreToLoadForwardingCandidate &C) {
229 return Candidates;
239 /// If a load has multiple candidates associated (i.e. different
241 /// depending on control flow. Remove these candidates.
259 std::forward_list<StoreToLoadForwardingCandidate> &Candidates) {
266 for (const auto &Cand : Candidates) {
[all...] |
| GVNSink.cpp | 716 // FIXME: If any of these fail, we should partition up the candidates to
787 SmallVector<SinkingInstructionCandidate, 4> Candidates;
800 Candidates.emplace_back(*Cand);
804 llvm::stable_sort(Candidates, std::greater<SinkingInstructionCandidate>());
805 LLVM_DEBUG(dbgs() << " -- Sinking candidates:\n"; for (auto &C
806 : Candidates) dbgs()
810 if (Candidates.empty() || Candidates.front().Cost <= 0)
812 auto C = Candidates.front();
|
| StraightLineStrengthReduce.cpp | 17 // reduction candidates in the following forms:
24 // candidates S1 and S2 in the same form and S1 dominates S2, we may rewrite S2
160 // can correspond to multiple candidates depending on how you associate the
195 // to Candidates, and tries to find the immediate basis for each of them.
198 // Allocate candidates and find bases for Add instructions.
205 // Allocate candidates and find bases for Mul instructions.
213 // Allocate candidates and find bases for GetElementPtr instructions.
222 // Adds the given form <CT, B, Idx, S> to Candidates, and finds its immediate
249 std::list<Candidate> Candidates;
341 // the number of existing candidates. However, we could do better by usin
[all...] |
| NaryReassociate.cpp | 222 // tree. This order ensures that all bases of a candidate are in Candidates
555 auto &Candidates = Pos->second;
560 while (!Candidates.empty()) {
561 // Candidates stores WeakTrackingVHs, so a candidate can be nullptr if it's
564 if (Value *Candidate = Candidates.back()) {
569 Candidates.pop_back();
|
| Reassociate.cpp | 2046 SmallVectorImpl<Instruction *> &Candidates) {
2063 Candidates.push_back(I);
2066 getNegatibleInsts(I->getOperand(0), Candidates);
2067 getNegatibleInsts(I->getOperand(1), Candidates);
2077 Candidates.push_back(I);
2080 getNegatibleInsts(I->getOperand(0), Candidates);
2081 getNegatibleInsts(I->getOperand(1), Candidates);
2099 SmallVector<Instruction *, 4> Candidates;
2100 getNegatibleInsts(Op, Candidates);
2101 if (Candidates.empty()
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/Target/BPF/ |
| BPFAdjustOpt.cpp | 251 SmallVector<PassThroughInfo, 4> Candidates;
288 Candidates.push_back(Info);
301 Candidates.push_back(Info);
305 if (!isCandidate || Candidates.empty())
308 llvm::append_range(PassThroughs, Candidates);
|
| /src/external/apache2/llvm/dist/llvm/lib/Transforms/Utils/ |
| CanonicalizeFreezeInLoops.cpp | 130 SmallVector<FrozenIndPHIInfo, 4> Candidates;
159 Candidates.push_back(Info);
166 if (Candidates.empty())
170 for (const auto &Info : Candidates) {
193 for (const auto &Item : Candidates) {
|
| /src/external/apache2/llvm/dist/llvm/lib/CodeGen/ |
| InterleavedLoadCombinePass.cpp | 72 /// Scan the function for interleaved load candidates and execute the
96 /// Replace interleaved load candidates. It does additional
102 /// Given a set of VectorInfo containing candidates for a given interleave
104 bool findPattern(std::list<VectorInfo> &Candidates,
1054 std::list<VectorInfo> &Candidates, std::list<VectorInfo> &InterleavedLoad,
1056 for (auto C0 = Candidates.begin(), E0 = Candidates.end(); C0 != E0; ++C0) {
1061 // List containing iterators pointing to the VectorInfos of the candidates
1062 std::vector<std::list<VectorInfo>::iterator> Res(Factor, Candidates.end());
1064 for (auto C = Candidates.begin(), E = Candidates.end(); C != E; C++)
[all...] |
| RegisterScavenging.cpp | 288 BitVector &Candidates,
291 int Survivor = Candidates.find_first();
292 assert(Survivor > 0 && "No candidates for scavenging");
307 // Remove any candidates touched by instruction.
310 Candidates.clearBitsNotInMask(MO.getRegMask());
321 Candidates.reset(*AI);
332 if (Candidates.test(Survivor))
335 // All candidates gone?
336 if (Candidates.none())
339 Survivor = Candidates.find_first()
[all...] |
| MachineOutliner.cpp | 43 /// The talk provides an overview of how the outliner finds candidates and
45 /// pass, the suffix tree, is queried and purged for candidates. It also gives
85 STATISTIC(NumOutlined, "Number of candidates outlined");
237 /// queried for candidates.
364 /// Remark output explaining that not outlining a set of candidates would be
413 for (const Candidate &C : OF.Candidates)
500 for (size_t i = 0, e = OF.Candidates.size(); i < e; i++) {
503 OF.Candidates[i].front()->getDebugLoc());
526 // Trick: Discard some candidates that would be incompatible with the
530 // If two candidates overlap, then we can't outline them both. Thi
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/Target/AMDGPU/ |
| GCNNSAReassign.cpp | 244 SmallVector<Candidate, 32> Candidates;
251 Candidates.push_back(std::make_pair(&MI, true));
254 Candidates.push_back(std::make_pair(&MI, false));
262 for (auto &C : Candidates) {
320 auto I = std::lower_bound(Candidates.begin(), &C, MinInd,
324 for (auto E = Candidates.end(); Success && I != E &&
|
| /src/external/apache2/llvm/dist/llvm/lib/Transforms/Vectorize/ |
| VPlanSLP.cpp | 247 SmallPtrSetImpl<VPValue *> &Candidates,
254 LLVM_DEBUG(dbgs() << " Candidates for "
256 for (auto *Candidate : Candidates) {
299 Candidates.erase(Best);
323 SmallPtrSet<VPValue *, 4> Candidates;
324 LLVM_DEBUG(dbgs() << " Candidates ");
329 Candidates.insert(Ops.second[Lane]);
340 getBest(Mode[Op], Last, Candidates, IAI);
|
| /src/external/apache2/llvm/dist/llvm/lib/Target/PowerPC/ |
| PPCPreEmitPeephole.cpp | 365 // Initially, none of the acc registers are candidates.
366 SmallVector<MachineInstr *, 8> Candidates(
377 Candidates[Acc - PPC::ACC0] = &BBI;
385 if (!Candidates[Acc - PPC::ACC0])
388 InstrsToErase.insert(Candidates[Acc - PPC::ACC0]);
398 Candidates[Reg - PPC::ACC0] = nullptr;
|
| /src/external/apache2/llvm/dist/clang/lib/AST/ |
| ExternalASTMerger.cpp | 482 llvm::SmallVector<Candidate, 4> Candidates;
484 auto FilterFoundDecl = [&Candidates](const Candidate &C) {
485 if (!HasDeclOfSameType(Candidates, C))
486 Candidates.push_back(C);
505 if (Candidates.empty())
508 Decls.reserve(Candidates.size());
509 for (const Candidate &C : Candidates) {
|
| /src/external/apache2/llvm/dist/clang/lib/Tooling/ |
| InterpolatingCompilationDatabase.cpp | 33 // - We only consider compile commands for c-family languages as candidates.
35 // we prefer candidates from the same language.
37 // - For .h files, candidates from any c-family language are acceptable.
327 // when scoring the candidates.
356 // Candidates with extensions matching PreferLanguage will be chosen over
357 // others (unless it's TY_INVALID, or all candidates are bad).
362 auto Candidates = scoreCandidates(Filename);
364 pickWinner(Candidates, Filename, PreferLanguage);
404 DenseMap<size_t, int> Candidates; // Index -> score.
407 Candidates[Entry.second] += Points
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/Target/Mips/ |
| Mips16InstrInfo.cpp | 350 BitVector Candidates =
358 Candidates.reset(MO.getReg());
362 // it will not be in the list of candidates.
379 Available &= Candidates;
390 Reg = Candidates.find_first();
391 Candidates.reset(Reg);
405 SpReg = Candidates.find_first();
406 // Candidates.reset(SpReg); // not really needed
|
| /src/external/apache2/llvm/dist/clang/lib/Driver/ToolChains/ |
| Cuda.cpp | 131 SmallVector<Candidate, 4> Candidates;
138 Candidates.emplace_back(
142 Candidates.emplace_back(
162 Candidates.emplace_back(
168 Candidates.emplace_back(D.SysRoot + "/usr/local/cuda");
170 Candidates.emplace_back(D.SysRoot + "/usr/local/cuda-" + Ver);
176 Candidates.emplace_back(D.SysRoot + "/usr/lib/cuda");
181 for (const auto &Candidate : Candidates) {
|
| /src/external/apache2/llvm/dist/llvm/include/llvm/ExecutionEngine/Orc/ |
| Speculation.h | 140 void registerSymbols(FunctionCandidatesMap Candidates, JITDylib *JD) {
141 for (auto &SymPair : Candidates) {
|
