Home
last modified time | relevance | path

Searched refs:Succs (Results 1 – 25 of 57) sorted by relevance

123

/freebsd/contrib/llvm-project/clang/include/clang/StaticAnalyzer/Core/PathSensitive/
H A DExplodedGraph.h133 NodeGroup Succs; variable
140 : Location(loc), State(std::move(state)), Succs(IsSink), Id(Id) { in ExplodedNode()
198 unsigned succ_size() const { return Succs.size(); } in succ_size()
200 bool succ_empty() const { return Succs.empty(); } in succ_empty()
203 bool isSink() const { return Succs.getFlag(); } in isSink()
250 succ_iterator succ_begin() { return Succs.begin(); } in succ_begin()
251 succ_iterator succ_end() { return Succs.end(); } in succ_end()
252 succ_range succs() { return {Succs.begin(), Succs.end()}; } in succs()
260 const_succ_range succs() const { return {Succs.begin(), Succs.end()}; } in succs()
296 void replaceSuccessor(ExplodedNode *node) { Succs.replaceNode(node); } in replaceSuccessor()
/freebsd/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DSparsePropagation.h192 void getFeasibleSuccessors(Instruction &TI, SmallVectorImpl<bool> &Succs,
289 Instruction &TI, SmallVectorImpl<bool> &Succs, bool AggressiveUndef) { in getFeasibleSuccessors() argument
290 Succs.resize(TI.getNumSuccessors()); in getFeasibleSuccessors()
296 Succs[0] = true; in getFeasibleSuccessors()
311 Succs[0] = Succs[1] = true; in getFeasibleSuccessors()
324 Succs[0] = Succs[1] = true; in getFeasibleSuccessors()
329 Succs[C->isNullValue()] = true; in getFeasibleSuccessors()
335 Succs.assign(Succs.size(), true); in getFeasibleSuccessors()
350 Succs.assign(TI.getNumSuccessors(), true); in getFeasibleSuccessors()
362 Succs.assign(TI.getNumSuccessors(), true); in getFeasibleSuccessors()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/
H A DScheduleDAG.cpp121 for (SDep &SuccDep : PredSU->Succs) { in addPred()
169 N->Succs.push_back(P); in addPred()
184 SmallVectorImpl<SDep>::iterator Succ = llvm::find(N->Succs, P); in removePred()
185 assert(Succ != N->Succs.end() && "Mismatching preds / succs lists!"); in removePred()
211 N->Succs.erase(Succ); in removePred()
224 for (SDep &SuccDep : SU->Succs) { in setDepthDirty()
303 for (const SDep &SuccDep : Cur->Succs) { in ComputeHeight()
381 if (SU.Succs.size() > 0) { in dumpNodeAll()
383 for (const SDep &Dep : SU.Succs) { in dumpNodeAll()
487 unsigned Degree = SU.Succs.size(); in InitDAGTopologicalSorting()
[all …]
H A DMacroFusion.cpp57 for (SDep &SI : FirstSU.Succs) in fuseInstructionPair()
94 for (SDep &SI : FirstSU.Succs) in fuseInstructionPair()
111 for (const SDep &SI : FirstSU.Succs) { in fuseInstructionPair()
137 if (SU.Succs.empty()) in fuseInstructionPair()
H A DVLIWMachineScheduler.cpp88 if (SUd->Succs.size() == 0) in hasDependence()
91 for (const auto &S : SUd->Succs) { in hasDependence()
325 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end(); I != E; in releaseBottomNode()
564 for (auto &Succ : SU->Succs) { in isSingleUnscheduledSucc()
663 for (const SDep &SI : SU->Succs) in SchedulingCost()
716 for (const SDep &SI : SU->Succs) { in SchedulingCost()
741 for (const auto &SI : SU->Succs) { in SchedulingCost()
838 CurrSize = (*I)->Succs.size(); in pickNodeFromQueue()
839 CandSize = Candidate.SU->Succs.size(); in pickNodeFromQueue()
H A DLatencyPriorityQueue.cpp76 for (const SDep &Succ : SU->Succs) in push()
90 for (const SDep &Succ : SU->Succs) in scheduledNode()
H A DTailDuplicator.cpp172 SmallSetVector<MachineBasicBlock *, 8> Succs(MBB->succ_begin(), in tailDuplicateAndUpdate() local
191 updateSuccessorsPHIs(MBB, isDead, TDBBs, Succs); in tailDuplicateAndUpdate()
486 SmallSetVector<MachineBasicBlock *, 8> &Succs) { in updateSuccessorsPHIs() argument
487 for (MachineBasicBlock *SuccBB : Succs) { in updateSuccessorsPHIs()
763 SmallPtrSet<MachineBasicBlock *, 8> Succs(llvm::from_range, in duplicateSimpleBB() local
771 if (bothUsedInPHI(*PredBB, Succs)) in duplicateSimpleBB()
/freebsd/contrib/llvm-project/llvm/lib/Target/AMDGPU/
H A DAMDGPUExportClustering.cpp127 SmallVector<SDep, 4> Succs(SU.Succs); in apply() local
128 for (SDep Succ : Succs) in apply()
H A DGCNMinRegStrategy.cpp88 for (auto SDep : SU->Succs) { in getReadySuccessors()
104 return SU->Succs.size() - getReadySuccessors(SU); in getNotReadySuccessors()
179 for (const auto &S : SchedSU->Succs) { in bumpPredsPriority()
214 for (const auto &S : SU->Succs) { in releaseSuccessors()
H A DSIMachineScheduler.cpp418 for (SDep& Succ : SU->Succs) { in undoSchedule()
459 for (SDep& Succ : SU->Succs) { in releaseSuccessors()
491 for (SDep& Succ : SU->Succs) { in nodeScheduled()
522 assert(none_of(Succs, in addPred()
535 for (std::pair<SIScheduleBlock*, SIScheduleBlockLinkKind> &S : Succs) { in addSucc()
545 Succs.emplace_back(Succ, Kind); in addSucc()
566 for (std::pair<SIScheduleBlock*, SIScheduleBlockLinkKind> S : Succs) { in printDebug()
829 for (SDep& SuccDep : SU->Succs) { in colorComputeReservedDependencies()
906 for (SDep& SuccDep : SU->Succs) { in colorEndsAccordingToDependencies()
976 for (SDep& SuccDep : SU->Succs) { in colorMergeConstantLoadsNextGroup()
[all …]
H A DAMDGPUIGroupLP.cpp1006 for (auto &Succ : TempSU->Succs) { in apply()
1047 auto SuccSize = llvm::count_if(SU->Succs, [](const SDep &Succ) { in apply()
1054 for (auto Succ : SU->Succs) { in apply()
1056 llvm::count_if(Succ.getSUnit()->Succs, [](const SDep &SuccSucc) { in apply()
1087 auto SuccSize = llvm::count_if(SU->Succs, [](const SDep &Succ) { in apply()
1094 for (auto Succ : SU->Succs) { in apply()
1096 llvm::count_if(Succ.getSUnit()->Succs, [](const SDep &SuccSucc) { in apply()
1173 for (auto &Succ : OtherEle->Succs) { in apply()
1257 for (auto &Succ : TempSU->Succs) { in apply()
1358 if (SU.Succs.size() >= 7) in analyzeDAG()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Target/WebAssembly/
H A DWebAssemblyLateEHPrepare.cpp104 SmallVector<MachineBasicBlock *, 4> Succs(MBB->successors()); in eraseDeadBBsAndChildren() local
106 for (auto *Succ : Succs) in eraseDeadBBsAndChildren()
368 SmallVector<MachineBasicBlock *, 8> Succs(MBB.successors()); in removeUnnecessaryUnreachables() local
369 for (auto *Succ : Succs) in removeUnnecessaryUnreachables()
372 eraseDeadBBsAndChildren(Succs); in removeUnnecessaryUnreachables()
/freebsd/contrib/llvm-project/llvm/lib/Target/RISCV/
H A DRISCVVectorMaskDAGMutation.cpp48 if (SU.Succs.size() != 1) in isSoleUseCopyToV0()
50 SDep &Dep = SU.Succs[0]; in isSoleUseCopyToV0()
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/SelectionDAG/
H A DResourcePriorityQueue.cpp107 for (const SDep &Succ : SU->Succs) { in numberRCValSuccInSU()
144 for (const SDep &Succ : SU->Succs) in numberCtrlDepsInSU()
228 for (const SDep &Succ : SU->Succs) in push()
267 for (const SDep &Succ : S->Succs) { in isResourceAvailable()
512 for (const SDep &Succ : SU->Succs) { in scheduledNode()
529 HorizontalVerticalBalance += (SU->Succs.size() - numberCtrlDepsInSU(SU)); in scheduledNode()
H A DScheduleDAGFast.cpp182 for (SDep &Succ : SU->Succs) { in ScheduleNodeBottomUp()
281 for (SDep &Succ : SU->Succs) { in CopyAndMoveSuccessors()
345 for (SDep &Succ : SU->Succs) { in CopyAndMoveSuccessors()
381 for (SDep &Succ : SU->Succs) { in InsertCopiesAndMoveSuccs()
536 assert(RootSU->Succs.empty() && "Graph root shouldn't have successors!"); in ListScheduleBottomUp()
H A DScheduleDAGRRList.cpp772 for (SDep &Succ : SU->Succs) { in ScheduleNodeBottomUp()
888 for (auto &Succ : SU->Succs) { in UnscheduleNodeBottomUp()
902 for (auto &Succ2 : SU->Succs) { in UnscheduleNodeBottomUp()
1067 for (SDep &Succ : SU->Succs) { in TryUnfoldSU()
1195 for (SDep &Succ : SU->Succs) { in CopyAndMoveSuccessors()
1234 for (SDep &Succ : SU->Succs) { in InsertCopiesAndMoveSuccs()
1611 assert(RootSU->Succs.empty() && "Graph root shouldn't have successors!"); in ListScheduleBottomUp()
2277 if (PredSU->NumSuccsLeft != PredSU->Succs.size()) in unscheduledNode()
2348 for (const SDep &Succ : SU->Succs) { in closestSucc()
2399 for (const SDep &Succ : SU->Succs) { in hasOnlyLiveOutUses()
[all …]
/freebsd/contrib/llvm-project/clang/include/clang/Analysis/
H A DCFG.h877 AdjacentBlocks Succs; variable
897 Succs(C, 1), HasNoReturnElement(false), Parent(parent) {} in CFGBlock()
990 succ_iterator succ_begin() { return Succs.begin(); } in succ_begin()
991 succ_iterator succ_end() { return Succs.end(); } in succ_end()
992 const_succ_iterator succ_begin() const { return Succs.begin(); } in succ_begin()
993 const_succ_iterator succ_end() const { return Succs.end(); } in succ_end()
995 succ_reverse_iterator succ_rbegin() { return Succs.rbegin(); } in succ_rbegin()
996 succ_reverse_iterator succ_rend() { return Succs.rend(); } in succ_rend()
997 const_succ_reverse_iterator succ_rbegin() const { return Succs.rbegin(); } in succ_rbegin()
998 const_succ_reverse_iterator succ_rend() const { return Succs.rend(); } in succ_rend()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Target/Hexagon/
H A DHexagonSubtarget.cpp269 for (SDep &SI : SU.Succs) { in apply()
469 for (const auto &DDep : Dst->Succs) { in adjustSchedDependency()
557 for (auto &I : Src->Succs) { in restoreLatency()
606 for (auto &I : Src->Succs) { in changeLatency()
653 if (getZeroLatency(Dst, Dst->Succs) != nullptr) in isBestZeroLatency()
662 DstBest = getZeroLatency(Src, Src->Succs); in isBestZeroLatency()
709 for (auto &I : SrcBest->Succs) in isBestZeroLatency()
H A DHexagonHazardRecognizer.cpp148 for (auto &S : SU->Succs) in EmitInstruction()
163 for (auto &S : SU->Succs) in EmitInstruction()
H A DHexagonLoopAlign.cpp134 int Succs = MBB.succ_size(); in isSingleLoop() local
135 return (MBB.isSuccessor(&MBB) && (Succs == 2)); in isSingleLoop()
H A DHexagonVLIWPacketizer.cpp927 for (unsigned i = 0; i < PacketSU->Succs.size(); ++i) { in restrictingDepExistInPacket()
928 auto &Dep = PacketSU->Succs[i]; in restrictingDepExistInPacket()
991 for (unsigned i = 0; i < PacketSU->Succs.size(); ++i) { in arePredicatesComplements()
992 auto Dep = PacketSU->Succs[i]; in arePredicatesComplements()
1401 for (unsigned i = 0; i < SUJ->Succs.size(); ++i) { in isLegalToPacketizeTogether()
1405 if (SUJ->Succs[i].getSUnit() != SUI) in isLegalToPacketizeTogether()
1408 SDep::Kind DepType = SUJ->Succs[i].getKind(); in isLegalToPacketizeTogether()
1427 DepReg = SUJ->Succs[i].getReg(); in isLegalToPacketizeTogether()
1434 if (!isCallDependent(I, DepType, SUJ->Succs[i].getReg())) in isLegalToPacketizeTogether()
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Instrumentation/
H A DBlockCoverageInference.cpp154 auto Succs = successors(&BB); in findDependencies() local
155 bool HasSuperReachableSucc = llvm::any_of(Succs, [&](auto *Succ) { in findDependencies()
160 for (auto *Succ : Succs) in findDependencies()
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Utils/
H A DSCCPSolver.cpp667 void getFeasibleSuccessors(Instruction &TI, SmallVectorImpl<bool> &Succs);
1165 SmallVectorImpl<bool> &Succs) { in getFeasibleSuccessors() argument
1166 Succs.resize(TI.getNumSuccessors()); in getFeasibleSuccessors()
1169 Succs[0] = true; in getFeasibleSuccessors()
1179 Succs[0] = Succs[1] = true; in getFeasibleSuccessors()
1184 Succs[CI->isZero()] = true; in getFeasibleSuccessors()
1191 Succs.assign(TI.getNumSuccessors(), true); in getFeasibleSuccessors()
1197 Succs[0] = true; in getFeasibleSuccessors()
1203 Succs[SI->findCaseValue(CI)->getSuccessorIndex()] = true; in getFeasibleSuccessors()
1215 Succs[Case.getSuccessorIndex()] = true; in getFeasibleSuccessors()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Vectorize/
H A DVPlanUtils.h121 SmallVector<VPBlockBase *> Succs(BlockPtr->successors()); in insertBlockAfter()
122 for (VPBlockBase *Succ : Succs) { in insertBlockAfter()
/freebsd/contrib/llvm-project/llvm/include/llvm/Transforms/Utils/
H A DSampleProfileLoaderBaseImpl.h761 auto &Succs = Successors[BB];
762 NumTotalEdges = Succs.size();
763 for (auto *Succ : Succs) {
895 auto &Succs = Successors[B1];
896 if (!Succs.empty())
900 Succs.push_back(B2);

123