| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/Scalar/ |
| D | StraightLineStrengthReduce.cpp | 102 struct Candidate { struct in __anonfc0d2cb10111::StraightLineStrengthReduce
110 Candidate() = default;
111 Candidate(Kind CT, const SCEV *B, ConstantInt *Idx, Value *S, in Candidate() argument
144 Candidate *Basis = nullptr; argument
171 bool isBasisFor(const Candidate &Basis, const Candidate &C);
174 bool isFoldable(const Candidate &C, TargetTransformInfo *TTI,
179 bool isSimplestForm(const Candidate &C);
211 void allocateCandidatesAndFindBasis(Candidate::Kind CT, const SCEV *B,
216 void rewriteCandidateWithBasis(const Candidate &C, const Candidate &Basis);
228 static Value *emitBump(const Candidate &Basis, const Candidate &C,
[all …]
|
| D | NaryReassociate.cpp | 390 Value *Candidate = findClosestMatchingDominator(CandidateExpr, GEP); in tryReassociateGEPAtIndex() local
391 if (Candidate == nullptr) in tryReassociateGEPAtIndex()
398 Candidate = Builder.CreateBitOrPointerCast(Candidate, GEP->getType()); in tryReassociateGEPAtIndex()
399 assert(Candidate->getType() == GEP->getType()); in tryReassociateGEPAtIndex()
431 Builder.CreateGEP(GEP->getResultElementType(), Candidate, RHS)); in tryReassociateGEPAtIndex()
540 if (Value *Candidate = Candidates.back()) { in findClosestMatchingDominator() local
541 Instruction *CandidateInstruction = cast<Instruction>(Candidate); in findClosestMatchingDominator()
|
| D | Sink.cpp | 171 BasicBlock *Candidate = (*I)->getBlock(); in SinkInstruction() local
174 if (IsAcceptableTarget(Inst, Candidate, DT, LI)) in SinkInstruction()
175 SuccToSinkTo = Candidate; in SinkInstruction()
|
| /third_party/rust/crates/aho-corasick/src/ |
| D | prefilter.rs | 27 pub enum Candidate { enum
33 impl Candidate { impl
40 Candidate::None => None, in into_option()
41 Candidate::Match(ref m) => Some(m.start()), in into_option()
42 Candidate::PossibleStartOfMatch(start) => Some(start), in into_option()
63 ) -> Candidate; in next_candidate() argument
103 ) -> Candidate { in next_candidate() argument
370 ) -> Candidate { in next_candidate() argument
371 self.0.find_at(haystack, at).map_or(Candidate::None, Candidate::Match) in next_candidate()
672 ) -> Candidate { in next_candidate() argument
[all …]
|
| D | automaton.rs | 2 use crate::prefilter::{self, Candidate, Prefilter, PrefilterState};
412 Candidate::None => None, in leftmost_find_at_no_state_imp()
413 Candidate::Match(m) => Some(m), in leftmost_find_at_no_state_imp()
414 Candidate::PossibleStartOfMatch(_) => unreachable!(), in leftmost_find_at_no_state_imp()
426 Candidate::None => return None, in leftmost_find_at_no_state_imp()
429 Candidate::Match(m) => return Some(m), in leftmost_find_at_no_state_imp()
430 Candidate::PossibleStartOfMatch(i) => { in leftmost_find_at_no_state_imp()
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Target/Hexagon/ |
| D | HexagonMachineScheduler.cpp | 498 const RegPressureTracker &RPTracker, SchedCandidate &Candidate, in readyQueueVerboseDump() argument
511 SchedulingCost(Q, *I, Candidate, RPDelta, true); in readyQueueVerboseDump()
577 SchedCandidate &Candidate, in SchedulingCost() argument
766 SchedCandidate &Candidate) { in pickNodeFromQueue() argument
769 readyQueueVerboseDump(RPTracker, Candidate, Q); in pickNodeFromQueue()
783 int CurrentCost = SchedulingCost(Q, *I, Candidate, RPDelta, false); in pickNodeFromQueue()
786 if (!Candidate.SU) { in pickNodeFromQueue()
788 Candidate.SU = *I; in pickNodeFromQueue()
789 Candidate.RPDelta = RPDelta; in pickNodeFromQueue()
790 Candidate.SCost = CurrentCost; in pickNodeFromQueue()
[all …]
|
| D | HexagonMachineScheduler.h | 258 SUnit *SU, SchedCandidate &Candidate,
263 SchedCandidate &Candidate);
269 SchedCandidate &Candidate, ReadyQueue &Q);
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/CodeGen/ |
| D | MachineOutliner.h | 37 struct Candidate { struct
120 Candidate(unsigned StartIdx, unsigned Len, in Candidate() argument
126 Candidate() {} in Candidate() function
130 bool operator<(const Candidate &RHS) const {
166 std::vector<Candidate> Candidates;
189 for (const Candidate &C : Candidates) in getOutliningCost()
211 OutlinedFunction(std::vector<Candidate> &Candidates, unsigned SequenceSize, in OutlinedFunction()
216 for (Candidate &C : Candidates) in OutlinedFunction()
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Target/AMDGPU/ |
| D | GCNMinRegStrategy.cpp | 30 struct Candidate : ilist_node<Candidate> { struct in __anon24e5c3a90111::GCNMinRegScheduler
34 Candidate(const SUnit *SU_, int Priority_ = 0) in Candidate() function
38 SpecificBumpPtrAllocator<Candidate> Alloc;
39 using Queue = simple_ilist<Candidate>;
74 Candidate* pickCandidate();
139 GCNMinRegScheduler::Candidate* GCNMinRegScheduler::pickCandidate() { in pickCandidate()
146 Num = findMax(Num, [=](const Candidate &C) { return C.Priority; }); in pickCandidate()
151 Num = findMax(Num, [=](const Candidate &C) { in pickCandidate()
162 Num = findMax(Num, [=](const Candidate &C) { in pickCandidate()
176 Num = findMax(Num, [=](const Candidate &C) { return -(int64_t)C.SU->NodeNum; }); in pickCandidate()
[all …]
|
| D | GCNILPSched.cpp | 23 struct Candidate : ilist_node<Candidate> { struct in __anonedd104400111::GCNILPScheduler
26 Candidate(SUnit *SU_) in Candidate() function
30 SpecificBumpPtrAllocator<Candidate> Alloc;
31 typedef simple_ilist<Candidate> Queue;
44 Candidate* pickCandidate();
241 GCNILPScheduler::Candidate* GCNILPScheduler::pickCandidate() { in pickCandidate()
286 PendingQueue.push_front(*new (Alloc.Allocate()) Candidate(PredSU)); in releasePredecessors()
309 *new (Alloc.Allocate()) Candidate(const_cast<SUnit*>(SU))); in schedule()
319 [=](const Candidate& C1, const Candidate& C2) { in schedule()
|
| D | GCNRegBankReassign.cpp | 84 class Candidate { class in __anonde44f38a0111::GCNRegBankReassign
86 Candidate(MachineInstr *mi, unsigned reg, unsigned freebanks, in Candidate() function in __anonde44f38a0111::GCNRegBankReassign::Candidate
90 bool operator< (const Candidate& RHS) const { return Weight < RHS.Weight; } in operator <()
107 class CandidateList : public std::list<Candidate> {
110 void push(const Candidate&& C) { in push()
224 unsigned tryReassign(Candidate &C);
560 Candidates.push(Candidate(&MI, Reg1, FreeBanks1, Weight in collectCandidates()
563 Candidates.push(Candidate(&MI, Reg2, FreeBanks2, Weight in collectCandidates()
620 unsigned GCNRegBankReassign::tryReassign(Candidate &C) { in tryReassign()
714 Candidates.remove_if([Reg, this](const Candidate& C) { in removeCandidates()
[all …]
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Target/SystemZ/ |
| D | SystemZMachineScheduler.cpp | 175 Candidate Best; in pickNode()
179 Candidate c(SU, *HazardRec); in pickNode()
200 SystemZPostRASchedStrategy::Candidate::
201 Candidate(SUnit *SU_, SystemZHazardRecognizer &HazardRec) : Candidate() { in Candidate() function in SystemZPostRASchedStrategy::Candidate
213 bool SystemZPostRASchedStrategy::Candidate::
214 operator<(const Candidate &other) { in operator <()
244 Candidate c(SU, *HazardRec); c.dumpCosts(); dbgs() << "\n";); in schedNode()
|
| D | SystemZMachineScheduler.h | 41 struct Candidate { struct
50 Candidate() = default; argument
51 Candidate(SUnit *SU_, SystemZHazardRecognizer &HazardRec);
54 bool operator<(const Candidate &other);
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/CodeGen/ |
| D | MIRVRegNamerUtils.cpp | 132 for (MachineInstr &Candidate : *MBB) { in renameInstsInMBB()
134 if (Candidate.mayStore() || Candidate.isBranch()) in renameInstsInMBB()
136 if (!Candidate.getNumOperands()) in renameInstsInMBB()
139 MachineOperand &MO = Candidate.getOperand(0); in renameInstsInMBB()
144 NamedVReg(MO.getReg(), Prefix + getInstructionOpcodeHash(Candidate))); in renameInstsInMBB()
|
| D | MachineOutliner.cpp | 866 unsigned StringLen, std::vector<Candidate> &CandidatesForRepeatedSeq,
912 for (const Candidate &C : OF.Candidates) in getSubprogramOrNull()
954 unsigned StringLen, std::vector<Candidate> &CandidatesForRepeatedSeq, in emitNotOutliningCheaperRemark()
960 Candidate &C = CandidatesForRepeatedSeq.front(); in emitNotOutliningCheaperRemark()
1019 std::vector<Candidate> CandidatesForRepeatedSeq; in findCandidates()
1049 [&StartIdx, &EndIdx](const Candidate &C) { in findCandidates()
1125 Candidate &FirstCand = OF.Candidates.front(); in createOutlinedFunction()
1212 erase_if(OF.Candidates, [&Mapper](Candidate &C) { in outline()
1234 for (Candidate &C : OF.Candidates) { in outline()
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Target/Mips/ |
| D | MipsDelaySlotFiller.cpp | 256 bool delayHasHazard(const MachineInstr &Candidate, RegDefsUses &RegDU,
294 bool terminateSearch(const MachineInstr &Candidate) const;
944 bool MipsDelaySlotFiller::delayHasHazard(const MachineInstr &Candidate, in delayHasHazard() argument
947 assert(!Candidate.isKill() && in delayHasHazard()
950 bool HasHazard = Candidate.isImplicitDef(); in delayHasHazard()
952 HasHazard |= IM.hasHazard(Candidate); in delayHasHazard()
953 HasHazard |= RegDU.update(Candidate, 0, Candidate.getNumOperands()); in delayHasHazard()
958 bool MipsDelaySlotFiller::terminateSearch(const MachineInstr &Candidate) const { in terminateSearch()
959 return (Candidate.isTerminator() || Candidate.isCall() || in terminateSearch()
960 Candidate.isPosition() || Candidate.isInlineAsm() || in terminateSearch()
[all …]
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/Vectorize/ |
| D | VPlanSLP.cpp | 251 for (auto *Candidate : Candidates) { in getBest() local
253 auto *CandidateI = cast<VPInstruction>(Candidate); in getBest()
255 LLVM_DEBUG(dbgs() << *cast<VPInstruction>(Candidate)->getUnderlyingInstr() in getBest()
257 BestCandidates.push_back(Candidate); in getBest()
275 for (auto *Candidate : BestCandidates) { in getBest() local
276 unsigned Score = getLAScore(Last, Candidate, Depth, IAI); in getBest()
285 Best = Candidate; in getBest()
|
| /third_party/flutter/txt/src/minikin/ |
| D | LineBreaker.h | 179 struct Candidate { struct
204 void addCandidate(Candidate cand); argument
238 std::vector<Candidate> mCandidates;
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/AggressiveInstCombine/ |
| D | AggressiveInstCombine.cpp | 196 Value *Candidate; in matchAndOrChain() local
198 if (!match(V, m_LShr(m_Value(Candidate), m_ConstantInt(BitIndex)))) in matchAndOrChain()
199 Candidate = V; in matchAndOrChain()
203 MOps.Root = Candidate; in matchAndOrChain()
211 return MOps.Root == Candidate; in matchAndOrChain()
|
| /third_party/flutter/engine/flutter/third_party/txt/src/minikin/ |
| D | LineBreaker.h | 189 struct Candidate { struct
217 void addCandidate(Candidate cand); argument
252 std::vector<Candidate> mCandidates;
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Demangle/ |
| D | MicrosoftDemangle.cpp | 149 StringView Candidate = S.substr(0, End); in startsWithLocalScopePattern() local
150 if (Candidate.empty()) in startsWithLocalScopePattern()
155 if (Candidate.size() == 1) in startsWithLocalScopePattern()
156 return Candidate[0] == '@' || (Candidate[0] >= '0' && Candidate[0] <= '9'); in startsWithLocalScopePattern()
159 if (Candidate.back() != '@') in startsWithLocalScopePattern()
161 Candidate = Candidate.dropBack(); in startsWithLocalScopePattern()
169 if (Candidate[0] < 'B' || Candidate[0] > 'P') in startsWithLocalScopePattern()
171 Candidate = Candidate.dropFront(); in startsWithLocalScopePattern()
172 while (!Candidate.empty()) { in startsWithLocalScopePattern()
173 if (Candidate[0] < 'A' || Candidate[0] > 'P') in startsWithLocalScopePattern()
[all …]
|
| /third_party/skia/third_party/externals/brotli/research/ |
| D | durchschlag.cc | 29 typedef struct Candidate { struct
32 } Candidate; argument
35 bool operator()(const Candidate& a, const Candidate& b) const { in operator ()()
42 bool operator()(const Candidate& a, const Candidate& b) const { in operator ()()
80 static Score buildCandidatesList(std::vector<Candidate>* candidates, in buildCandidatesList()
583 std::vector<Candidate> candidates; in durchschlagGenerateCollaborative()
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Target/RISCV/ |
| D | RISCVInstrInfo.h | 116 std::vector<outliner::Candidate> &RepeatedSequenceLocs) const override;
132 const outliner::Candidate &C) const override;
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Target/Hexagon/MCTargetDesc/ |
| D | HexagonMCInstrInfo.cpp | 840 DuplexCandidate Candidate) { in replaceDuplex() argument
841 assert(Candidate.packetIndexI < MCB.size()); in replaceDuplex()
842 assert(Candidate.packetIndexJ < MCB.size()); in replaceDuplex()
845 deriveDuplex(Context, Candidate.iClass, in replaceDuplex()
846 *MCB.getOperand(Candidate.packetIndexJ).getInst(), in replaceDuplex()
847 *MCB.getOperand(Candidate.packetIndexI).getInst()); in replaceDuplex()
849 MCB.getOperand(Candidate.packetIndexI).setInst(Duplex); in replaceDuplex()
850 MCB.erase(MCB.begin() + Candidate.packetIndexJ); in replaceDuplex()
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Target/AArch64/ |
| D | AArch64InstrInfo.h | 255 std::vector<outliner::Candidate> &RepeatedSequenceLocs) const override;
265 const outliner::Candidate &C) const override;
305 unsigned findRegisterToSaveLRTo(const outliner::Candidate &C) const;
|