| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/CodeGen/ |
| D | MachineOutliner.h | 166 std::vector<Candidate> Candidates;
183 unsigned getOccurrenceCount() const { return Candidates.size(); } in getOccurrenceCount()
189 for (const Candidate &C : Candidates) in getOutliningCost()
209 unsigned getNumInstrs() const { return Candidates[0].getLength(); } in getNumInstrs()
211 OutlinedFunction(std::vector<Candidate> &Candidates, unsigned SequenceSize, in OutlinedFunction()
213 : Candidates(Candidates), SequenceSize(SequenceSize), in OutlinedFunction()
216 for (Candidate &C : Candidates) in OutlinedFunction()
|
| D | RegisterScavenging.h | 216 BitVector &Candidates,
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/Scalar/ |
| D | LoopLoadElimination.cpp | 178 std::forward_list<StoreToLoadForwardingCandidate> Candidates; in findStoreToLoadDependences() local
182 return Candidates; in findStoreToLoadDependences()
221 Candidates.emplace_front(Load, Store); in findStoreToLoadDependences()
225 Candidates.remove_if([&](const StoreToLoadForwardingCandidate &C) { in findStoreToLoadDependences()
229 return Candidates; in findStoreToLoadDependences()
259 std::forward_list<StoreToLoadForwardingCandidate> &Candidates) { in removeDependencesFromMultipleStores() argument
266 for (const auto &Cand : Candidates) { in removeDependencesFromMultipleStores()
292 Candidates.remove_if([&](const StoreToLoadForwardingCandidate &Cand) { in removeDependencesFromMultipleStores()
326 const SmallVectorImpl<StoreToLoadForwardingCandidate> &Candidates) { in findPointersWrittenOnForwardingPath() argument
345 std::max_element(Candidates.begin(), Candidates.end(), in findPointersWrittenOnForwardingPath()
[all …]
|
| D | StraightLineStrengthReduce.cpp | 236 std::list<Candidate> Candidates; member in __anon9f0d8a120111::StraightLineStrengthReduce
358 for (auto Basis = Candidates.rbegin(); in allocateCandidatesAndFindBasis()
359 Basis != Candidates.rend() && NumIterations < MaxNumIterations; in allocateCandidatesAndFindBasis()
369 Candidates.push_back(C); in allocateCandidatesAndFindBasis()
722 while (!Candidates.empty()) { in runOnFunction()
723 const Candidate &C = Candidates.back(); in runOnFunction()
727 Candidates.pop_back(); in runOnFunction()
|
| D | GVNSink.cpp | 787 SmallVector<SinkingInstructionCandidate, 4> Candidates; in sinkBB() local
800 Candidates.emplace_back(*Cand); in sinkBB()
804 llvm::stable_sort(Candidates, std::greater<SinkingInstructionCandidate>()); in sinkBB()
806 : Candidates) dbgs() in sinkBB()
810 if (Candidates.empty() || Candidates.front().Cost <= 0) in sinkBB()
812 auto C = Candidates.front(); in sinkBB()
|
| D | NaryReassociate.cpp | 531 auto &Candidates = Pos->second; in findClosestMatchingDominator() local
536 while (!Candidates.empty()) { in findClosestMatchingDominator()
540 if (Value *Candidate = Candidates.back()) { in findClosestMatchingDominator()
545 Candidates.pop_back(); in findClosestMatchingDominator()
|
| D | Reassociate.cpp | 1948 SmallVectorImpl<Instruction *> &Candidates) { in getNegatibleInsts() argument
1965 Candidates.push_back(I); in getNegatibleInsts()
1968 getNegatibleInsts(I->getOperand(0), Candidates); in getNegatibleInsts()
1969 getNegatibleInsts(I->getOperand(1), Candidates); in getNegatibleInsts()
1979 Candidates.push_back(I); in getNegatibleInsts()
1982 getNegatibleInsts(I->getOperand(0), Candidates); in getNegatibleInsts()
1983 getNegatibleInsts(I->getOperand(1), Candidates); in getNegatibleInsts()
2001 SmallVector<Instruction *, 4> Candidates; in canonicalizeNegFPConstantsForOp() local
2002 getNegatibleInsts(Op, Candidates); in canonicalizeNegFPConstantsForOp()
2003 if (Candidates.empty()) in canonicalizeNegFPConstantsForOp()
[all …]
|
| D | SeparateConstOffsetFromGEP.cpp | 1149 auto &Candidates = Pos->second; in findClosestMatchingDominator() local
1154 while (!Candidates.empty()) { in findClosestMatchingDominator()
1155 Instruction *Candidate = Candidates.back(); in findClosestMatchingDominator()
1158 Candidates.pop_back(); in findClosestMatchingDominator()
|
| D | ConstantHoisting.cpp | 215 SmallPtrSet<BasicBlock *, 16> Candidates; in findBestInsertionSet() local
228 if (Node == Entry || Candidates.count(Node)) { in findBestInsertionSet()
243 Candidates.insert(Path.begin(), Path.end()); in findBestInsertionSet()
254 if (Candidates.count(ChildDomNode->getBlock())) in findBestInsertionSet()
|
| D | GVNHoist.cpp | 912 unsigned rauw(const SmallVecInsn &Candidates, Instruction *Repl, in rauw() argument
915 for (Instruction *I : Candidates) { in rauw()
954 unsigned removeAndReplace(const SmallVecInsn &Candidates, Instruction *Repl, in removeAndReplace() argument
965 unsigned NR = rauw(Candidates, Repl, NewMemAcc); in removeAndReplace()
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/Instrumentation/ |
| D | ValueProfilePlugins.inc | 26 std::vector<CandidateInfo> *Candidates;
31 MemIntrinsicPlugin(Function &Fn) : F(Fn), Candidates(nullptr) {}
34 Candidates = &Cs;
36 Candidates = nullptr;
46 Candidates->emplace_back(CandidateInfo{Length, InsertPt, AnnotatedInst});
59 void run(std::vector<CandidateInfo> &Candidates) {
65 Candidates.emplace_back(CandidateInfo{Callee, InsertPt, AnnotatedInst});
|
| D | ValueProfileCollector.cpp | 42 void get(InstrProfValueKind K, std::vector<CandidateInfo> &Candidates) {} in get() argument
53 void get(InstrProfValueKind K, std::vector<CandidateInfo> &Candidates) { in get() argument
55 Plugin.run(Candidates); in get()
56 Base::get(K, Candidates); in get()
|
| D | IndirectCallPromotion.cpp | 203 const std::vector<PromotionCandidate> &Candidates,
334 Instruction *Inst, const std::vector<PromotionCandidate> &Candidates, in tryToPromote() argument
338 for (auto &C : Candidates) { in tryToPromote()
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/CodeGen/ |
| D | InterleavedLoadCombinePass.cpp | 104 bool findPattern(std::list<VectorInfo> &Candidates,
1054 std::list<VectorInfo> &Candidates, std::list<VectorInfo> &InterleavedLoad, in findPattern() argument
1056 for (auto C0 = Candidates.begin(), E0 = Candidates.end(); C0 != E0; ++C0) { in findPattern()
1062 std::vector<std::list<VectorInfo>::iterator> Res(Factor, Candidates.end()); in findPattern()
1064 for (auto C = Candidates.begin(), E = Candidates.end(); C != E; C++) { in findPattern()
1080 if (Res[i] == Candidates.end()) in findPattern()
1089 if (Res[0] != Candidates.end()) { in findPattern()
1092 InterleavedLoad.splice(InterleavedLoad.end(), Candidates, Res[i]); in findPattern()
1263 std::list<VectorInfo> Candidates; in run() local
1269 Candidates.emplace_back(SVI->getType()); in run()
[all …]
|
| D | RegisterScavenging.cpp | 308 BitVector &Candidates, in findSurvivorReg() argument
311 int Survivor = Candidates.find_first(); in findSurvivorReg()
330 Candidates.clearBitsNotInMask(MO.getRegMask()); in findSurvivorReg()
341 Candidates.reset(*AI); in findSurvivorReg()
352 if (Candidates.test(Survivor)) in findSurvivorReg()
356 if (Candidates.none()) in findSurvivorReg()
359 Survivor = Candidates.find_first(); in findSurvivorReg()
541 BitVector Candidates = TRI->getAllocatableSet(MF, RC); in scavengeRegister() local
548 Candidates.reset(*AI); in scavengeRegister()
554 Available &= Candidates; in scavengeRegister()
[all …]
|
| D | MachineLICM.cpp | 213 SmallVectorImpl<CandidateInfo> &Candidates);
437 SmallVectorImpl<CandidateInfo> &Candidates) { in ProcessMI() argument
518 Candidates.push_back(CandidateInfo(MI, Def, FI)); in ProcessMI()
533 SmallVector<CandidateInfo, 32> Candidates; in HoistRegionPostRA() local
554 ProcessMI(&MI, PhysRegDefs, PhysRegClobbers, StoredFIs, Candidates); in HoistRegionPostRA()
580 for (CandidateInfo &Candidate : Candidates) { in HoistRegionPostRA()
794 SmallVector<MachineInstr *, 8> Candidates; in SinkIntoLoop() local
800 Candidates.push_back(&*I); in SinkIntoLoop()
803 for (MachineInstr *I : Candidates) { in SinkIntoLoop()
|
| D | MachineOutliner.cpp | 912 for (const Candidate &C : OF.Candidates) in getSubprogramOrNull()
999 for (size_t i = 0, e = OF.Candidates.size(); i < e; i++) { in emitOutlinedFunctionRemark()
1002 OF.Candidates[i].front()->getDebugLoc()); in emitOutlinedFunctionRemark()
1082 if (OF.Candidates.size() < 2) 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/AMDGPU/ |
| D | GCNRegBankReassign.cpp | 160 CandidateList Candidates; member in __anon52e1776b0111::GCNRegBankReassign
560 Candidates.push(Candidate(&MI, Reg1, FreeBanks1, Weight in collectCandidates()
563 Candidates.push(Candidate(&MI, Reg2, FreeBanks2, Weight in collectCandidates()
714 Candidates.remove_if([Reg, this](const Candidate& C) { in removeCandidates()
761 Candidates.sort(); in runOnMachineFunction()
764 for (auto C : Candidates) C.dump(this); in runOnMachineFunction()
768 while (!Candidates.empty()) { in runOnMachineFunction()
769 Candidate C = Candidates.back(); in runOnMachineFunction()
776 Candidates.pop_back(); in runOnMachineFunction()
780 Candidates.sort(); in runOnMachineFunction()
[all …]
|
| D | GCNNSAReassign.cpp | 241 SmallVector<Candidate, 32> Candidates; in runOnMachineFunction() local
248 Candidates.push_back(std::make_pair(&MI, true)); in runOnMachineFunction()
251 Candidates.push_back(std::make_pair(&MI, false)); in runOnMachineFunction()
259 for (auto &C : Candidates) { in runOnMachineFunction()
309 auto I = std::lower_bound(Candidates.begin(), &C, MinInd, in runOnMachineFunction()
313 for (auto E = Candidates.end(); Success && I != E && in runOnMachineFunction()
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/Vectorize/ |
| D | VPlanSLP.cpp | 242 SmallPtrSetImpl<VPValue *> &Candidates, in getBest() argument
251 for (auto *Candidate : Candidates) { in getBest()
294 Candidates.erase(Best); in getBest()
318 SmallPtrSet<VPValue *, 4> Candidates; in reorderMultiNodeOps() local
324 Candidates.insert(Ops.second[Lane]); in reorderMultiNodeOps()
335 getBest(Mode[Op], Last, Candidates, IAI); in reorderMultiNodeOps()
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Target/Mips/ |
| D | Mips16InstrInfo.cpp | 350 BitVector Candidates = in loadImmediate() local
358 Candidates.reset(MO.getReg()); in loadImmediate()
379 Available &= Candidates; in loadImmediate()
390 Reg = Candidates.find_first(); in loadImmediate()
391 Candidates.reset(Reg); in loadImmediate()
405 SpReg = Candidates.find_first(); in loadImmediate()
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/ExecutionEngine/Orc/ |
| D | Speculation.h | 144 void registerSymbols(FunctionCandidatesMap Candidates, JITDylib *JD) { in registerSymbols() argument
145 for (auto &SymPair : Candidates) { in registerSymbols()
|
| /third_party/ffmpeg/doc/dev_community/ |
| D | community.md | 54 Candidates for election can either be suggested or self-nominated.
77 Candidates for election can either be suggested or self-nominated.
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Option/ |
| D | OptTable.cpp | 216 SmallVector<StringRef, 8> Candidates; in suggestValueCompletions() local
217 StringRef(In.Values).split(Candidates, ",", -1, false); in suggestValueCompletions()
220 for (StringRef Val : Candidates) in suggestValueCompletions()
|
| /third_party/libuv/docs/src/ |
| D | version.rst | 38 libuv version suffix. Certain development releases such as Release Candidates
|