/freebsd-12-stable/contrib/llvm-project/llvm/include/llvm/CodeGen/ |
H A D | MachineOutliner.h | 37 struct Candidate { struct in namespace:llvm::outliner 39 /// The start index of this \p Candidate in the instruction list. 42 /// The number of instructions in this \p Candidate. 45 // The first instruction in this \p Candidate. 48 // The last instruction in this \p Candidate. 51 // The basic block that contains this Candidate. 59 /// The index of this \p Candidate's \p OutlinedFunction in the list of 68 /// this \p Candidate. 75 /// instructions in this \p Candidate. 81 /// Target-specific flags for this Candidate' 120 Candidate(unsigned StartIdx, unsigned Len, function in struct:llvm::outliner::Candidate 126 Candidate() {} function in struct:llvm::outliner::Candidate [all...] |
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
H A D | StraightLineStrengthReduce.cpp | 102 struct Candidate { struct in class:__anon5727::StraightLineStrengthReduce 110 Candidate() = default; 111 Candidate(Kind CT, const SCEV *B, ConstantInt *Idx, Value *S, function in struct:__anon5727::StraightLineStrengthReduce::Candidate 144 Candidate *Basis = nullptr; 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 [all...] |
H A D | NaryReassociate.cpp | 390 Value *Candidate = findClosestMatchingDominator(CandidateExpr, GEP); local 391 if (Candidate == nullptr) 395 // Candidate does not necessarily have the same pointer type as GEP. Use 398 Candidate = Builder.CreateBitOrPointerCast(Candidate, GEP->getType()); 399 assert(Candidate->getType() == GEP->getType()); 401 // NewGEP = (char *)Candidate + RHS * sizeof(IndexedType) 422 // NewGEP = &Candidate[RHS * (sizeof(IndexedType) / sizeof(Candidate[0]))); 431 Builder.CreateGEP(GEP->getResultElementType(), Candidate, RH [all...] |
H A D | Sink.cpp | 98 assert(SuccToSinkTo && "Candidate sink target is null"); 171 BasicBlock *Candidate = (*I)->getBlock(); local 174 if (IsAcceptableTarget(Inst, Candidate, DT, LI)) 175 SuccToSinkTo = Candidate;
|
/freebsd-12-stable/contrib/llvm-project/clang/lib/Analysis/ |
H A D | ThreadSafetyTIL.cpp | 209 BasicBlock *Candidate = nullptr; local 215 if (Candidate == nullptr) { 216 Candidate = Pred; 221 while (Alternate != Candidate) { 222 if (Candidate->BlockID > Alternate->BlockID) 223 Candidate = Candidate->DominatorNode.Parent; 228 DominatorNode.Parent = Candidate; 236 BasicBlock *Candidate = nullptr; local 242 if (Candidate [all...] |
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Target/SystemZ/ |
H A D | SystemZMachineScheduler.h | 41 struct Candidate { struct in class:llvm::SystemZPostRASchedStrategy 50 Candidate() = default; 51 Candidate(SUnit *SU_, SystemZHazardRecognizer &HazardRec); 54 bool operator<(const Candidate &other);
|
H A D | SystemZMachineScheduler.cpp | 175 Candidate Best; 179 Candidate c(SU, *HazardRec); 200 SystemZPostRASchedStrategy::Candidate:: 201 Candidate(SUnit *SU_, SystemZHazardRecognizer &HazardRec) : Candidate() { function in class:SystemZPostRASchedStrategy::Candidate 213 bool SystemZPostRASchedStrategy::Candidate:: 214 operator<(const Candidate &other) { 244 Candidate c(SU, *HazardRec); c.dumpCosts(); dbgs() << "\n";);
|
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Target/AMDGPU/ |
H A D | GCNMinRegStrategy.cpp | 30 struct Candidate : ilist_node<Candidate> { struct in class:__anon4988::GCNMinRegScheduler 34 Candidate(const SUnit *SU_, int Priority_ = 0) function in struct:__anon4988::GCNMinRegScheduler::Candidate 38 SpecificBumpPtrAllocator<Candidate> Alloc; 39 using Queue = simple_ilist<Candidate>; 74 Candidate* pickCandidate(); 139 GCNMinRegScheduler::Candidate* GCNMinRegScheduler::pickCandidate() { 146 Num = findMax(Num, [=](const Candidate &C) { return C.Priority; }); 151 Num = findMax(Num, [=](const Candidate &C) { 162 Num = findMax(Num, [=](const Candidate [all...] |
H A D | GCNILPSched.cpp | 23 struct Candidate : ilist_node<Candidate> { struct in class:__anon4986::GCNILPScheduler 26 Candidate(SUnit *SU_) function in struct:__anon4986::GCNILPScheduler::Candidate 30 SpecificBumpPtrAllocator<Candidate> Alloc; 31 typedef simple_ilist<Candidate> Queue; 44 Candidate* pickCandidate(); 241 GCNILPScheduler::Candidate* GCNILPScheduler::pickCandidate() { 286 PendingQueue.push_front(*new (Alloc.Allocate()) Candidate(PredSU)); 309 *new (Alloc.Allocate()) Candidate(const_cast<SUnit*>(SU))); 319 [=](const Candidate [all...] |
H A D | GCNRegBankReassign.cpp | 84 class Candidate { class in class:__anon4992::GCNRegBankReassign 86 Candidate(MachineInstr *mi, unsigned reg, unsigned freebanks, function in class:__anon4992::GCNRegBankReassign::Candidate 90 bool operator< (const Candidate& RHS) const { return Weight < RHS.Weight; } 107 class CandidateList : public std::list<Candidate> { 110 void push(const Candidate&& C) { 224 unsigned tryReassign(Candidate &C); 560 Candidates.push(Candidate(&MI, Reg1, FreeBanks1, Weight 563 Candidates.push(Candidate(&MI, Reg2, FreeBanks2, Weight 620 unsigned GCNRegBankReassign::tryReassign(Candidate &C) { 714 Candidates.remove_if([Reg, this](const Candidate [all...] |
H A D | GCNNSAReassign.cpp | 240 using Candidate = std::pair<const MachineInstr*, bool>; 241 SmallVector<Candidate, 32> Candidates; 310 [this](const Candidate &C, SlotIndex I) {
|
/freebsd-12-stable/contrib/llvm-project/llvm/lib/CodeGen/ |
H A D | MIRVRegNamerUtils.cpp | 132 for (MachineInstr &Candidate : *MBB) { 134 if (Candidate.mayStore() || Candidate.isBranch()) 136 if (!Candidate.getNumOperands()) 139 MachineOperand &MO = Candidate.getOperand(0); 144 NamedVReg(MO.getReg(), Prefix + getInstructionOpcodeHash(Candidate)));
|
H A D | MachineOutliner.cpp | 866 unsigned StringLen, std::vector<Candidate> &CandidatesForRepeatedSeq, 912 for (const Candidate &C : OF.Candidates) 954 unsigned StringLen, std::vector<Candidate> &CandidatesForRepeatedSeq, 956 // FIXME: Right now, we arbitrarily choose some Candidate from the 960 Candidate &C = CandidatesForRepeatedSeq.front(); 1019 std::vector<Candidate> CandidatesForRepeatedSeq; 1049 [&StartIdx, &EndIdx](const Candidate &C) { 1125 Candidate &FirstCand = OF.Candidates.front(); 1212 erase_if(OF.Candidates, [&Mapper](Candidate &C) { 1234 for (Candidate [all...] |
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Target/Hexagon/ |
H A D | HexagonMachineScheduler.cpp | 498 const RegPressureTracker &RPTracker, SchedCandidate &Candidate, 511 SchedulingCost(Q, *I, Candidate, RPDelta, true); 577 SchedCandidate &Candidate, 766 SchedCandidate &Candidate) { 769 readyQueueVerboseDump(RPTracker, Candidate, Q); 783 int CurrentCost = SchedulingCost(Q, *I, Candidate, RPDelta, false); 786 if (!Candidate.SU) { 788 Candidate.SU = *I; 789 Candidate.RPDelta = RPDelta; 790 Candidate 497 readyQueueVerboseDump( const RegPressureTracker &RPTracker, SchedCandidate &Candidate, ReadyQueue &Q) argument 576 SchedulingCost(ReadyQueue &Q, SUnit *SU, SchedCandidate &Candidate, RegPressureDelta &Delta, bool verbose) argument 765 pickNodeFromQueue(VLIWSchedBoundary &Zone, const RegPressureTracker &RPTracker, SchedCandidate &Candidate) argument [all...] |
H A D | HexagonMachineScheduler.h | 258 SUnit *SU, SchedCandidate &Candidate, 263 SchedCandidate &Candidate); 269 SchedCandidate &Candidate, ReadyQueue &Q);
|
/freebsd-12-stable/contrib/llvm-project/clang/utils/TableGen/ |
H A D | ClangOpenCLBuiltinEmitter.cpp | 126 // \param Candidate (in) Entry in the SignatureListMap to check. 130 BuiltinIndexListTy *Candidate, 518 BuiltinIndexListTy *Candidate, 520 assert(Candidate->size() == SignatureList.size() && 524 SignatureListMap.find(Candidate)->second.Signatures; 525 for (unsigned Index = 0; Index < Candidate->size(); Index++) { 560 for (auto *Candidate : KnownSignatures) { 561 if (Candidate->size() == CurSignatureList->size() && 562 *Candidate == *CurSignatureList) { 563 if (CanReuseSignature(Candidate, Fc 517 CanReuseSignature( BuiltinIndexListTy *Candidate, std::vector<std::pair<const Record *, unsigned>> &SignatureList) argument [all...] |
/freebsd-12-stable/contrib/llvm-project/clang/lib/Sema/ |
H A D | Scope.cpp | 122 if (VarDecl *Candidate = NRVO.getPointer()) { 123 if (isDeclScope(Candidate)) 124 Candidate->setNRVOVariable(true);
|
H A D | SemaOverload.cpp | 6186 OverloadCandidate &Candidate = 6188 Candidate.FoundDecl = FoundDecl; 6189 Candidate.Function = Function; 6190 Candidate.Viable = true; 6191 Candidate.RewriteKind = 6193 Candidate.IsSurrogate = false; 6194 Candidate.IsADLCandidate = IsADLCandidate; 6195 Candidate.IgnoreObjectArgument = false; 6196 Candidate.ExplicitCallArguments = Args.size(); 6202 Candidate [all...] |
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Transforms/Vectorize/ |
H A D | VPlanSLP.cpp | 251 for (auto *Candidate : Candidates) { 253 auto *CandidateI = cast<VPInstruction>(Candidate); 255 LLVM_DEBUG(dbgs() << *cast<VPInstruction>(Candidate)->getUnderlyingInstr() 257 BestCandidates.push_back(Candidate); 275 for (auto *Candidate : BestCandidates) { 276 unsigned Score = getLAScore(Last, Candidate, Depth, IAI); 285 Best = Candidate;
|
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Target/Mips/ |
H A D | MipsDelaySlotFiller.cpp | 253 /// This function checks if it is valid to move Candidate to the delay slot 256 bool delayHasHazard(const MachineInstr &Candidate, RegDefsUses &RegDU, 294 bool terminateSearch(const MachineInstr &Candidate) const; 944 bool MipsDelaySlotFiller::delayHasHazard(const MachineInstr &Candidate, argument 947 assert(!Candidate.isKill() && 950 bool HasHazard = Candidate.isImplicitDef(); 952 HasHazard |= IM.hasHazard(Candidate); 953 HasHazard |= RegDU.update(Candidate, 0, Candidate.getNumOperands()); 958 bool MipsDelaySlotFiller::terminateSearch(const MachineInstr &Candidate) cons [all...] |
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Demangle/ |
H A D | 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[ [all...] |
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Target/RISCV/ |
H A D | RISCVInstrInfo.h | 116 std::vector<outliner::Candidate> &RepeatedSequenceLocs) const override; 132 const outliner::Candidate &C) const override;
|
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Transforms/AggressiveInstCombine/ |
H A D | AggressiveInstCombine.cpp | 196 Value *Candidate; local 198 if (!match(V, m_LShr(m_Value(Candidate), m_ConstantInt(BitIndex)))) 199 Candidate = V; 203 MOps.Root = Candidate; 211 return MOps.Root == Candidate;
|
/freebsd-12-stable/contrib/llvm-project/clang/lib/AST/ |
H A D | ExternalASTMerger.cpp | 34 typedef std::pair<Source<NamedDecl *>, ASTImporter *> Candidate; typedef in namespace:__anon2726 247 bool HasDeclOfSameType(llvm::ArrayRef<Candidate> Decls, const Candidate &C) { 250 return llvm::any_of(Decls, [&](const Candidate &D) { 482 llvm::SmallVector<Candidate, 4> Candidates; 484 auto FilterFoundDecl = [&Candidates](const Candidate &C) { 509 for (const Candidate &C : Candidates) {
|
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Target/AArch64/ |
H A 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;
|