Searched refs:Cand (Results 1 – 9 of 9) sorted by relevance
/external/llvm/lib/Transforms/Scalar/ |
D | LoopLoadElimination.cpp | 93 const StoreToLoadForwardingCandidate &Cand) { in operator <<() argument 94 OS << *Cand.Store << " -->\n"; in operator <<() 95 OS.indent(2) << *Cand.Load << "\n"; in operator <<() 210 for (const auto &Cand : Candidates) { in removeDependencesFromMultipleStores() local 215 LoadToSingleCand.insert(std::make_pair(Cand.Load, &Cand)); in removeDependencesFromMultipleStores() 225 if (Cand.Store->getParent() == OtherCand->Store->getParent() && in removeDependencesFromMultipleStores() 226 Cand.isDependenceDistanceOfOne(PSE) && in removeDependencesFromMultipleStores() 229 if (getInstrIndex(OtherCand->Store) < getInstrIndex(Cand.Store)) in removeDependencesFromMultipleStores() 230 OtherCand = &Cand; in removeDependencesFromMultipleStores() 236 Candidates.remove_if([&](const StoreToLoadForwardingCandidate &Cand) { in removeDependencesFromMultipleStores() argument [all …]
|
/external/llvm/lib/CodeGen/ |
D | MachineScheduler.cpp | 2317 void GenericSchedulerBase::traceCandidate(const SchedCandidate &Cand) { in traceCandidate() argument 2321 switch (Cand.Reason) { in traceCandidate() 2325 P = Cand.RPDelta.Excess; in traceCandidate() 2328 P = Cand.RPDelta.CriticalMax; in traceCandidate() 2331 P = Cand.RPDelta.CurrentMax; in traceCandidate() 2334 ResIdx = Cand.Policy.ReduceResIdx; in traceCandidate() 2337 ResIdx = Cand.Policy.DemandResIdx; in traceCandidate() 2340 Latency = Cand.SU->getDepth(); in traceCandidate() 2343 Latency = Cand.SU->getHeight(); in traceCandidate() 2346 Latency = Cand.SU->getHeight(); in traceCandidate() [all …]
|
D | RegAllocGreedy.cpp | 350 void growRegion(GlobalSplitCandidate &Cand); 1036 void RAGreedy::growRegion(GlobalSplitCandidate &Cand) { in growRegion() argument 1039 SmallVectorImpl<unsigned> &ActiveBlocks = Cand.ActiveBlocks; in growRegion() 1072 if (Cand.PhysReg) in growRegion() 1073 addThroughConstraints(Cand.Intf, NewBlocks); in growRegion() 1093 bool RAGreedy::calcCompactRegion(GlobalSplitCandidate &Cand) { in calcCompactRegion() argument 1099 Cand.reset(IntfCache, 0); in calcCompactRegion() 1105 SpillPlacer->prepare(Cand.LiveBundles); in calcCompactRegion() 1109 if (!addSplitConstraints(Cand.Intf, Cost)) { in calcCompactRegion() 1114 growRegion(Cand); in calcCompactRegion() [all …]
|
/external/clang/lib/Sema/ |
D | SemaOverload.cpp | 1186 for (OverloadCandidateSet::iterator Cand = Conversions.begin(); in TryUserDefinedConversion() local 1187 Cand != Conversions.end(); ++Cand) in TryUserDefinedConversion() 1188 if (Cand->Viable) in TryUserDefinedConversion() 1189 ICS.Ambiguous.addConversion(Cand->Function); in TryUserDefinedConversion() 4210 for (OverloadCandidateSet::iterator Cand = CandidateSet.begin(); in FindConversionForRefInit() local 4211 Cand != CandidateSet.end(); ++Cand) in FindConversionForRefInit() 4212 if (Cand->Viable) in FindConversionForRefInit() 4213 ICS.Ambiguous.addConversion(Cand->Function); in FindConversionForRefInit() 8415 for (OverloadCandidateSet::iterator Cand = CandidateSet.begin(), in AddArgumentDependentLookupCandidates() local 8417 Cand != CandEnd; ++Cand) in AddArgumentDependentLookupCandidates() [all …]
|
D | SemaLookup.cpp | 2857 for (auto *Cand : Candidates) { in LookupSpecialMember() local 2858 if (Cand->isInvalidDecl()) in LookupSpecialMember() 2861 if (UsingShadowDecl *U = dyn_cast<UsingShadowDecl>(Cand)) { in LookupSpecialMember() 2866 Cand = U->getTargetDecl(); in LookupSpecialMember() 2868 if (Cand->isInvalidDecl()) in LookupSpecialMember() 2872 if (CXXMethodDecl *M = dyn_cast<CXXMethodDecl>(Cand)) { in LookupSpecialMember() 2881 dyn_cast<FunctionTemplateDecl>(Cand)) { in LookupSpecialMember() 2892 assert(isa<UsingDecl>(Cand) && "illegal Kind of operator = Decl"); in LookupSpecialMember()
|
/external/llvm/include/llvm/CodeGen/ |
D | MachineScheduler.h | 848 void traceCandidate(const SchedCandidate &Cand); 896 void tryCandidate(SchedCandidate &Cand, 957 void tryCandidate(SchedCandidate &Cand, SchedCandidate &TryCand); 959 void pickNodeFromQueue(SchedCandidate &Cand);
|
/external/llvm/lib/Target/ARM/ |
D | ARMLoadStoreOptimizer.cpp | 146 MachineInstr *MergeOpsUpdate(const MergeCandidate &Cand); 796 MachineInstr *ARMLoadStoreOpt::MergeOpsUpdate(const MergeCandidate &Cand) { in MergeOpsUpdate() argument 797 const MachineInstr *First = Cand.Instrs.front(); in MergeOpsUpdate() 805 for (const MachineInstr *MI : Cand.Instrs) { in MergeOpsUpdate() 836 MachineInstr *LatestMI = Cand.Instrs[Cand.LatestMIIdx]; in MergeOpsUpdate() 846 if (Cand.CanMergeToLSDouble) in MergeOpsUpdate() 849 if (!Merged && Cand.CanMergeToLSMulti) in MergeOpsUpdate() 857 iterator EarliestI(Cand.Instrs[Cand.EarliestMIIdx]); in MergeOpsUpdate() 866 for (MachineInstr *MI : Cand.Instrs) in MergeOpsUpdate()
|
/external/llvm/utils/TableGen/ |
D | CodeGenRegisters.cpp | 421 CodeGenRegister *Cand = const_cast<CodeGenRegister*>(Leads[i]); in computeSecondarySubRegs() local 423 if (Cand == this || getSubRegIndex(Cand)) in computeSecondarySubRegs() 429 assert(!Cand->ExplicitSubRegs.empty() && in computeSecondarySubRegs() 431 for (unsigned j = 1, e = Cand->ExplicitSubRegs.size(); j != e; ++j) { in computeSecondarySubRegs() 432 if (CodeGenSubRegIndex *Idx = getSubRegIndex(Cand->ExplicitSubRegs[j])) in computeSecondarySubRegs() 448 NewSubRegs.push_back(std::make_pair(Concat, Cand)); in computeSecondarySubRegs()
|
/external/llvm/lib/Target/Hexagon/ |
D | HexagonBitSimplify.cpp | 2730 std::vector<LoopCand> Cand; in runOnMachineFunction() local 2757 Cand.push_back(LoopCand(&B, PB, EB)); in runOnMachineFunction() 2761 for (auto &C : Cand) in runOnMachineFunction()
|