/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/Instrumentation/ |
H A 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});
|
H A D | ValueProfileCollector.cpp | 29 /// void run(std::vector<CandidateInfo> &Candidates); 42 void get(InstrProfValueKind K, std::vector<CandidateInfo> &Candidates) {} argument 53 void get(InstrProfValueKind K, std::vector<CandidateInfo> &Candidates) { argument 55 Plugin.run(Candidates); 56 Base::get(K, Candidates);
|
H A D | IndirectCallPromotion.cpp | 203 const std::vector<PromotionCandidate> &Candidates, 334 Instruction *Inst, const std::vector<PromotionCandidate> &Candidates, 338 for (auto &C : Candidates) { 333 tryToPromote( Instruction *Inst, const std::vector<PromotionCandidate> &Candidates, uint64_t &TotalCount) argument
|
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/CodeGen/ |
H A D | MachineOutliner.h | 128 /// Used to ensure that \p Candidates are outlined in an order that 129 /// preserves the start and end indices of other \p Candidates. 166 std::vector<Candidate> Candidates; member in struct:llvm::outliner::OutlinedFunction 183 unsigned getOccurrenceCount() const { return Candidates.size(); } 189 for (const Candidate &C : Candidates) 209 unsigned getNumInstrs() const { return Candidates[0].getLength(); } 211 OutlinedFunction(std::vector<Candidate> &Candidates, unsigned SequenceSize, argument 213 : Candidates(Candidates), SequenceSize(SequenceSize), 216 for (Candidate &C : Candidates) [all...] |
H A D | RegisterScavenging.h | 216 BitVector &Candidates,
|
/freebsd-11-stable/contrib/llvm-project/clang/include/clang/Sema/ |
H A D | TemplateDeduction.h | 317 SmallVector<TemplateSpecCandidate, 16> Candidates; member in class:clang::TemplateSpecCandidateSet 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(); 353 return Candidates.back();
|
H A D | Overload.h | 904 /// syntax. Candidates that have no parameters of class type will be 976 SmallVector<OverloadCandidate, 16> Candidates; member in class:clang::OverloadCandidateSet 1055 iterator begin() { return Candidates.begin(); } 1056 iterator end() { return Candidates.end(); } 1058 size_t size() const { return Candidates.size(); } 1059 bool empty() const { return Candidates.empty(); } 1082 Candidates.push_back(OverloadCandidate()); 1083 OverloadCandidate &C = Candidates.back();
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
H A D | LoopLoadElimination.cpp | 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; 259 std::forward_list<StoreToLoadForwardingCandidate> &Candidates) { 266 for (const auto &Cand : Candidates) { 292 Candidates.remove_if([&](const StoreToLoadForwardingCandidate &Cand) { 326 const SmallVectorImpl<StoreToLoadForwardingCandidate> &Candidates) { 345 std::max_element(Candidates [all...] |
H A D | StraightLineStrengthReduce.cpp | 182 // to Candidates, and tries to find the immediate basis for each of them. 209 // Adds the given form <CT, B, Idx, S> to Candidates, and finds its immediate 236 std::list<Candidate> Candidates; member in class:__anon2761::StraightLineStrengthReduce 358 for (auto Basis = Candidates.rbegin(); 359 Basis != Candidates.rend() && NumIterations < MaxNumIterations; 369 Candidates.push_back(C); 715 // all bases of a candidate are in Candidates when we process it. 722 while (!Candidates.empty()) { 723 const Candidate &C = Candidates.back(); 727 Candidates [all...] |
H A D | NaryReassociate.cpp | 232 // tree. This order ensures that all bases of a candidate are in Candidates 531 auto &Candidates = Pos->second; 536 while (!Candidates.empty()) { 537 // Candidates stores WeakTrackingVHs, so a candidate can be nullptr if it's 540 if (Value *Candidate = Candidates.back()) { 545 Candidates.pop_back();
|
H A D | GVNSink.cpp | 787 SmallVector<SinkingInstructionCandidate, 4> Candidates; 800 Candidates.emplace_back(*Cand); 804 llvm::stable_sort(Candidates, std::greater<SinkingInstructionCandidate>()); 806 : Candidates) dbgs() 810 if (Candidates.empty() || Candidates.front().Cost <= 0) 812 auto C = Candidates.front();
|
H A D | Reassociate.cpp | 1948 SmallVectorImpl<Instruction *> &Candidates) { 1965 Candidates.push_back(I); 1968 getNegatibleInsts(I->getOperand(0), Candidates); 1969 getNegatibleInsts(I->getOperand(1), Candidates); 1979 Candidates.push_back(I); 1982 getNegatibleInsts(I->getOperand(0), Candidates); 1983 getNegatibleInsts(I->getOperand(1), Candidates); 2001 SmallVector<Instruction *, 4> Candidates; 2002 getNegatibleInsts(Op, Candidates); 2003 if (Candidates [all...] |
/freebsd-11-stable/contrib/llvm-project/llvm/lib/CodeGen/ |
H A D | InterleavedLoadCombinePass.cpp | 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) { 1062 std::vector<std::list<VectorInfo>::iterator> Res(Factor, Candidates.end()); 1064 for (auto C = Candidates.begin(), E = Candidates.end(); C != E; C++) { 1080 if (Res[i] == Candidates.end()) 1089 if (Res[0] != Candidates.end()) { 1092 InterleavedLoad.splice(InterleavedLoad.end(), Candidates, Re 1053 findPattern( std::list<VectorInfo> &Candidates, std::list<VectorInfo> &InterleavedLoad, unsigned Factor, const DataLayout &DL) argument 1263 std::list<VectorInfo> Candidates; local [all...] |
H A D | RegisterScavenging.cpp | 308 BitVector &Candidates, 311 int Survivor = Candidates.find_first(); 330 Candidates.clearBitsNotInMask(MO.getRegMask()); 341 Candidates.reset(*AI); 352 if (Candidates.test(Survivor)) 356 if (Candidates.none()) 359 Survivor = Candidates.find_first(); 373 /// Candidates and not used/clobbered until the point \p To. If there is 541 BitVector Candidates = TRI->getAllocatableSet(MF, RC); local 548 Candidates 307 findSurvivorReg(MachineBasicBlock::iterator StartMI, BitVector &Candidates, unsigned InstrLimit, MachineBasicBlock::iterator &UseMI) argument [all...] |
H A D | MachineOutliner.cpp | 912 for (const Candidate &C : OF.Candidates) 999 for (size_t i = 0, e = OF.Candidates.size(); i < e; i++) { 1002 OF.Candidates[i].front()->getDebugLoc()); 1082 if (OF.Candidates.size() < 2) 1125 Candidate &FirstCand = OF.Candidates.front(); 1212 erase_if(OF.Candidates, [&Mapper](Candidate &C) { 1234 for (Candidate &C : OF.Candidates) {
|
H A D | MachineLICM.cpp | 213 SmallVectorImpl<CandidateInfo> &Candidates); 437 SmallVectorImpl<CandidateInfo> &Candidates) { 518 Candidates.push_back(CandidateInfo(MI, Def, FI)); 533 SmallVector<CandidateInfo, 32> Candidates; local 554 ProcessMI(&MI, PhysRegDefs, PhysRegClobbers, StoredFIs, Candidates); 580 for (CandidateInfo &Candidate : Candidates) { 794 SmallVector<MachineInstr *, 8> Candidates; 800 Candidates.push_back(&*I); 803 for (MachineInstr *I : Candidates) { 433 ProcessMI(MachineInstr *MI, BitVector &PhysRegDefs, BitVector &PhysRegClobbers, SmallSet<int, 32> &StoredFIs, SmallVectorImpl<CandidateInfo> &Candidates) argument
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/AMDGPU/ |
H A D | GCNNSAReassign.cpp | 241 SmallVector<Candidate, 32> Candidates; 248 Candidates.push_back(std::make_pair(&MI, true)); 251 Candidates.push_back(std::make_pair(&MI, false)); 259 for (auto &C : Candidates) { 309 auto I = std::lower_bound(Candidates.begin(), &C, MinInd, 313 for (auto E = Candidates.end(); Success && I != E &&
|
H A D | GCNRegBankReassign.cpp | 160 CandidateList Candidates; member in class:__anon2099::GCNRegBankReassign 560 Candidates.push(Candidate(&MI, Reg1, FreeBanks1, Weight 563 Candidates.push(Candidate(&MI, Reg2, FreeBanks2, Weight 714 Candidates.remove_if([Reg, this](const Candidate& C) { 761 Candidates.sort(); 764 for (auto C : Candidates) C.dump(this); 768 while (!Candidates.empty()) { 769 Candidate C = Candidates.back(); 776 Candidates.pop_back(); 780 Candidates [all...] |
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/Vectorize/ |
H A D | VPlanSLP.cpp | 242 SmallPtrSetImpl<VPValue *> &Candidates, 249 LLVM_DEBUG(dbgs() << " Candidates for " 251 for (auto *Candidate : Candidates) { 294 Candidates.erase(Best); 318 SmallPtrSet<VPValue *, 4> Candidates; local 319 LLVM_DEBUG(dbgs() << " Candidates "); 324 Candidates.insert(Ops.second[Lane]); 335 getBest(Mode[Op], Last, Candidates, IAI); 241 getBest(OpMode Mode, VPValue *Last, SmallPtrSetImpl<VPValue *> &Candidates, VPInterleavedAccessInfo &IAI) argument
|
/freebsd-11-stable/contrib/llvm-project/clang/lib/AST/ |
H A D | 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) {
|
/freebsd-11-stable/contrib/llvm-project/clang/lib/Tooling/ |
H A D | InterpolatingCompilationDatabase.cpp | 346 // Candidates with extensions matching PreferLanguage will be chosen over 352 auto Candidates = scoreCandidates(Filename); local 354 pickWinner(Candidates, Filename, PreferLanguage); 394 DenseMap<size_t, int> Candidates; // Index -> score. local 397 Candidates[Entry.second] += Points; 410 return Candidates; 415 std::pair<size_t, int> pickWinner(const DenseMap<size_t, int> &Candidates, argument 426 for (const auto &Candidate : Candidates) {
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/Mips/ |
H A D | Mips16InstrInfo.cpp | 350 BitVector Candidates = local 358 Candidates.reset(MO.getReg()); 379 Available &= Candidates; 390 Reg = Candidates.find_first(); 391 Candidates.reset(Reg); 405 SpReg = Candidates.find_first(); 406 // Candidates.reset(SpReg); // not really needed
|
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/ExecutionEngine/Orc/ |
H A D | Speculation.h | 144 void registerSymbols(FunctionCandidatesMap Candidates, JITDylib *JD) { argument 145 for (auto &SymPair : Candidates) {
|
/freebsd-11-stable/contrib/llvm-project/clang/lib/Driver/ToolChains/ |
H A D | Cuda.cpp | 70 SmallVector<Candidate, 4> Candidates; local 76 Candidates.emplace_back( 80 Candidates.emplace_back( 100 Candidates.emplace_back(llvm::sys::path::parent_path(ptxasDir), 105 Candidates.emplace_back(D.SysRoot + "/usr/local/cuda"); 107 Candidates.emplace_back(D.SysRoot + "/usr/local/cuda-" + Ver); 113 Candidates.emplace_back(D.SysRoot + "/usr/lib/cuda"); 118 for (const auto &Candidate : Candidates) {
|
/freebsd-11-stable/contrib/llvm-project/llvm/utils/TableGen/ |
H A D | CodeGenTarget.cpp | 304 std::vector<CodeGenRegisterClass *> Candidates; local 324 Candidates.push_back(SubClassWithSubReg); 328 if (Candidates.empty()) 332 llvm::stable_sort(Candidates, [&](const CodeGenRegisterClass *A, 344 return Candidates[0];
|