Home
last modified time | relevance | path

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

123

/freebsd/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DSparsePropagation.h193 void getFeasibleSuccessors(Instruction &TI, SmallVectorImpl<bool> &Succs,
290 Instruction &TI, SmallVectorImpl<bool> &Succs, bool AggressiveUndef) { in getFeasibleSuccessors() argument
291 Succs.resize(TI.getNumSuccessors()); in getFeasibleSuccessors()
297 Succs[0] = true; in getFeasibleSuccessors()
312 Succs[0] = Succs[1] = true; in getFeasibleSuccessors()
325 Succs[0] = Succs[1] = true; in getFeasibleSuccessors()
330 Succs[C->isNullValue()] = true; in getFeasibleSuccessors()
336 Succs.assign(Succs.size(), true); in getFeasibleSuccessors()
351 Succs.assign(TI.getNumSuccessors(), true); in getFeasibleSuccessors()
363 Succs.assign(TI.getNumSuccessors(), true); in getFeasibleSuccessors()
[all …]
/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/lib/CodeGen/
H A DScheduleDAG.cpp121 for (SDep &SuccDep : PredSU->Succs) { in addPred()
166 N->Succs.push_back(P); in addPred()
183 SmallVectorImpl<SDep>::iterator Succ = llvm::find(N->Succs, P); in removePred()
184 assert(Succ != N->Succs.end() && "Mismatching preds / succs lists!"); in removePred()
210 N->Succs.erase(Succ); in removePred()
225 for (SDep &SuccDep : SU->Succs) { in setDepthDirty()
304 for (const SDep &SuccDep : Cur->Succs) { in ComputeHeight()
379 if (SU.Succs.size() > 0) { in dumpNodeAll()
381 for (const SDep &Dep : SU.Succs) { in dumpNodeAll()
485 unsigned Degree = SU.Succs.size(); in InitDAGTopologicalSorting()
[all …]
H A DMacroFusion.cpp57 for (SDep &SI : FirstSU.Succs) in fuseInstructionPair()
82 for (SDep &SI : FirstSU.Succs) in fuseInstructionPair()
99 for (const SDep &SI : FirstSU.Succs) { in fuseInstructionPair()
125 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()
328 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end(); I != E; in releaseBottomNode()
567 for (auto &Succ : SU->Succs) { in isSingleUnscheduledSucc()
666 for (const SDep &SI : SU->Succs) in SchedulingCost()
719 for (const SDep &SI : SU->Succs) { in SchedulingCost()
744 for (const auto &SI : SU->Succs) { in SchedulingCost()
841 CurrSize = (*I)->Succs.size(); in pickNodeFromQueue()
842 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 DMachinePipeliner.cpp791 for (const auto &SI : SU->Succs) { in isSuccOrder()
1659 for (auto &SI : SUnits[i].Succs) { in createAdjacencyStructure()
1829 for (auto &Dep : PHISUs[Index]->Succs) { in apply()
1910 for (const SDep &S : SU->Succs) { in computeNodeFunctions()
1962 for (const SDep &Succ : SU->Succs) { in pred_L()
1978 SmallSetVector<SUnit *, 8> &Succs, in succ_L() argument
1980 Succs.clear(); in succ_L()
1982 for (const SDep &Succ : SU->Succs) { in succ_L()
1988 Succs.insert(Succ.getSUnit()); in succ_L()
1996 Succs.insert(Pred.getSUnit()); in succ_L()
[all …]
H A DTailDuplicator.cpp173 SmallSetVector<MachineBasicBlock *, 8> Succs(MBB->succ_begin(), in tailDuplicateAndUpdate() local
192 updateSuccessorsPHIs(MBB, isDead, TDBBs, Succs); in tailDuplicateAndUpdate()
487 SmallSetVector<MachineBasicBlock *, 8> &Succs) { in updateSuccessorsPHIs() argument
488 for (MachineBasicBlock *SuccBB : Succs) { in updateSuccessorsPHIs()
742 SmallPtrSet<MachineBasicBlock *, 8> Succs(TailBB->succ_begin(), in duplicateSimpleBB() local
750 if (bothUsedInPHI(*PredBB, Succs)) in duplicateSimpleBB()
H A DWasmEHPrepare.cpp211 SmallVector<BasicBlock *, 4> Succs(successors(BB)); in prepareThrows() local
215 eraseDeadBBsAndChildren(Succs); in prepareThrows()
/freebsd/contrib/llvm-project/llvm/lib/Target/WebAssembly/
H A DWebAssemblyLateEHPrepare.cpp103 SmallVector<MachineBasicBlock *, 4> Succs(MBB->successors()); in eraseDeadBBsAndChildren() local
105 for (auto *Succ : Succs) in eraseDeadBBsAndChildren()
278 SmallVector<MachineBasicBlock *, 8> Succs(MBB.successors()); in removeUnnecessaryUnreachables() local
279 for (auto *Succ : Succs) in removeUnnecessaryUnreachables()
282 eraseDeadBBsAndChildren(Succs); in removeUnnecessaryUnreachables()
/freebsd/contrib/llvm-project/llvm/lib/Target/AMDGPU/
H A DAMDGPUExportClustering.cpp128 SmallVector<SDep, 4> Succs(SU.Succs); in apply() local
129 for (SDep Succ : Succs) in apply()
H A DAMDGPUIGroupLP.cpp253 while (!SU.Succs.empty()) in resetEdges()
254 for (auto &S : SU.Succs) in resetEdges()
1031 for (auto &Succ : TempSU->Succs) { in apply()
1073 SU->Succs.begin(), SU->Succs.end(), in apply()
1079 for (auto Succ : SU->Succs) { in apply()
1081 Succ.getSUnit()->Succs.begin(), Succ.getSUnit()->Succs.end(), in apply()
1114 SU->Succs.begin(), SU->Succs.end(), in apply()
1120 for (auto Succ : SU->Succs) { in apply()
1122 Succ.getSUnit()->Succs.begin(), Succ.getSUnit()->Succs.end(), in apply()
1200 for (auto &Succ : OtherEle->Succs) { in apply()
[all …]
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.cpp422 for (SDep& Succ : SU->Succs) { in undoSchedule()
463 for (SDep& Succ : SU->Succs) { in releaseSuccessors()
495 for (SDep& Succ : SU->Succs) { in nodeScheduled()
526 assert(none_of(Succs, in addPred()
539 for (std::pair<SIScheduleBlock*, SIScheduleBlockLinkKind> &S : Succs) { in addSucc()
549 Succs.emplace_back(Succ, Kind); in addSucc()
570 for (std::pair<SIScheduleBlock*, SIScheduleBlockLinkKind> S : Succs) { in printDebug()
837 for (SDep& SuccDep : SU->Succs) { in colorComputeReservedDependencies()
917 for (SDep& SuccDep : SU->Succs) { in colorEndsAccordingToDependencies()
987 for (SDep& SuccDep : SU->Succs) { in colorMergeConstantLoadsNextGroup()
[all …]
H A DSIMachineScheduler.h97 std::vector<std::pair<SIScheduleBlock*, SIScheduleBlockLinkKind>> Succs; variable
121 getSuccs() const { return Succs; } in getSuccs()
/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.cpp188 for (SDep &Succ : SU->Succs) { in ScheduleNodeBottomUp()
287 for (SDep &Succ : SU->Succs) { in CopyAndMoveSuccessors()
351 for (SDep &Succ : SU->Succs) { in CopyAndMoveSuccessors()
387 for (SDep &Succ : SU->Succs) { in InsertCopiesAndMoveSuccs()
543 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.h871 AdjacentBlocks Succs; variable
891 Succs(C, 1), HasNoReturnElement(false), Parent(parent) {} in CFGBlock()
984 succ_iterator succ_begin() { return Succs.begin(); } in succ_begin()
985 succ_iterator succ_end() { return Succs.end(); } in succ_end()
986 const_succ_iterator succ_begin() const { return Succs.begin(); } in succ_begin()
987 const_succ_iterator succ_end() const { return Succs.end(); } in succ_end()
989 succ_reverse_iterator succ_rbegin() { return Succs.rbegin(); } in succ_rbegin()
990 succ_reverse_iterator succ_rend() { return Succs.rend(); } in succ_rend()
991 const_succ_reverse_iterator succ_rbegin() const { return Succs.rbegin(); } in succ_rbegin()
992 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.cpp270 for (SDep &SI : SU.Succs) { in apply()
468 for (const auto &DDep : Dst->Succs) { in adjustSchedDependency()
556 for (auto &I : Src->Succs) { in restoreLatency()
605 for (auto &I : Src->Succs) { in changeLatency()
652 if (getZeroLatency(Dst, Dst->Succs) != nullptr) in isBestZeroLatency()
661 DstBest = getZeroLatency(Src, Src->Succs); in isBestZeroLatency()
708 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.cpp141 int Succs = MBB.succ_size(); in isSingleLoop() local
142 return (MBB.isSuccessor(&MBB) && (Succs == 2)); in isSingleLoop()
H A DHexagonVLIWPacketizer.cpp936 for (unsigned i = 0; i < PacketSU->Succs.size(); ++i) { in restrictingDepExistInPacket()
937 auto &Dep = PacketSU->Succs[i]; in restrictingDepExistInPacket()
1000 for (unsigned i = 0; i < PacketSU->Succs.size(); ++i) { in arePredicatesComplements()
1001 auto Dep = PacketSU->Succs[i]; in arePredicatesComplements()
1410 for (unsigned i = 0; i < SUJ->Succs.size(); ++i) { in isLegalToPacketizeTogether()
1414 if (SUJ->Succs[i].getSUnit() != SUI) in isLegalToPacketizeTogether()
1417 SDep::Kind DepType = SUJ->Succs[i].getKind(); in isLegalToPacketizeTogether()
1436 DepReg = SUJ->Succs[i].getReg(); in isLegalToPacketizeTogether()
1443 if (!isCallDependent(I, DepType, SUJ->Succs[i].getReg())) in isLegalToPacketizeTogether()
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Utils/
H A DSCCPSolver.cpp586 void getFeasibleSuccessors(Instruction &TI, SmallVectorImpl<bool> &Succs);
1065 SmallVectorImpl<bool> &Succs) { in getFeasibleSuccessors() argument
1066 Succs.resize(TI.getNumSuccessors()); in getFeasibleSuccessors()
1069 Succs[0] = true; in getFeasibleSuccessors()
1079 Succs[0] = Succs[1] = true; in getFeasibleSuccessors()
1084 Succs[CI->isZero()] = true; in getFeasibleSuccessors()
1091 Succs.assign(TI.getNumSuccessors(), true); in getFeasibleSuccessors()
1097 Succs[0] = true; in getFeasibleSuccessors()
1103 Succs[SI->findCaseValue(CI)->getSuccessorIndex()] = true; in getFeasibleSuccessors()
1115 Succs[Case.getSuccessorIndex()] = true; in getFeasibleSuccessors()
[all …]
/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()

123