Home
last modified time | relevance | path

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

123

/openbsd/gnu/llvm/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 …]
/openbsd/gnu/llvm/clang/include/clang/StaticAnalyzer/Core/PathSensitive/
H A DExplodedGraph.h132 NodeGroup Succs; variable
139 : Location(loc), State(std::move(state)), Succs(IsSink), Id(Id) { in ExplodedNode()
197 unsigned succ_size() const { return Succs.size(); } in succ_size()
199 bool succ_empty() const { return Succs.empty(); } in succ_empty()
202 bool isSink() const { return Succs.getFlag(); } in isSink()
249 succ_iterator succ_begin() { return Succs.begin(); } in succ_begin()
250 succ_iterator succ_end() { return Succs.end(); } in succ_end()
251 succ_range succs() { return {Succs.begin(), Succs.end()}; } in succs()
259 const_succ_range succs() const { return {Succs.begin(), Succs.end()}; } in succs()
295 void replaceSuccessor(ExplodedNode *node) { Succs.replaceNode(node); } in replaceSuccessor()
/openbsd/gnu/llvm/llvm/lib/CodeGen/
H A DScheduleDAG.cpp122 for (SDep &SuccDep : PredSU->Succs) { in addPred()
167 N->Succs.push_back(P); in addPred()
184 SmallVectorImpl<SDep>::iterator Succ = llvm::find(N->Succs, P); in removePred()
186 N->Succs.erase(Succ); in removePred()
224 for (SDep &SuccDep : SU->Succs) { in setDepthDirty()
303 for (const SDep &SuccDep : Cur->Succs) { in ComputeHeight()
376 if (SU.Succs.size() > 0) { in dumpNodeAll()
378 for (const SDep &Dep : SU.Succs) { in dumpNodeAll()
482 unsigned Degree = SU.Succs.size(); in InitDAGTopologicalSorting()
580 for (const SDep &SuccDep : llvm::reverse(SU->Succs)) { in DFS()
[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.cpp712 for (const auto &SI : SU->Succs) { in isSuccOrder()
1178 for (auto &SI : SUnits[i].Succs) { in createAdjacencyStructure()
1429 for (const SDep &S : SU->Succs) { in computeNodeFunctions()
1499 Succs.clear(); in succ_L()
1518 return !Succs.empty(); in succ_L()
1536 for (auto &SI : Cur->Succs) in computePath()
1750 for (auto &SI : SU->Succs) { in addConnectedNodes()
1839 if (N->Succs.size() == 0) in computeNodeOrder()
2555 for (auto &S : SU->Succs) { in orderDependence()
2686 for (auto &Dep : SU->Succs) in computeUnpipelineableNodes()
[all …]
H A DTailDuplicator.cpp162 SmallSetVector<MachineBasicBlock *, 8> Succs(MBB->succ_begin(), in tailDuplicateAndUpdate() local
181 updateSuccessorsPHIs(MBB, isDead, TDBBs, Succs); in tailDuplicateAndUpdate()
475 SmallSetVector<MachineBasicBlock *, 8> &Succs) { in updateSuccessorsPHIs() argument
476 for (MachineBasicBlock *SuccBB : Succs) { in updateSuccessorsPHIs()
722 SmallPtrSet<MachineBasicBlock *, 8> Succs(TailBB->succ_begin(), in duplicateSimpleBB() local
730 if (bothUsedInPHI(*PredBB, Succs)) in duplicateSimpleBB()
H A DWasmEHPrepare.cpp184 SmallVector<BasicBlock *, 4> Succs(successors(BB)); in prepareThrows() local
188 eraseDeadBBsAndChildren(Succs); in prepareThrows()
/openbsd/gnu/llvm/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()
/openbsd/gnu/llvm/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 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.cpp424 for (SDep& Succ : SU->Succs) { in undoSchedule()
465 for (SDep& Succ : SU->Succs) { in releaseSuccessors()
497 for (SDep& Succ : SU->Succs) { in nodeScheduled()
528 assert(none_of(Succs, in addPred()
843 for (SDep& SuccDep : SU->Succs) { in colorComputeReservedDependencies()
925 for (SDep& SuccDep : SU->Succs) { in colorEndsAccordingToDependencies()
995 for (SDep& SuccDep : SU->Succs) { in colorMergeConstantLoadsNextGroup()
1016 for (SDep& SuccDep : SU->Succs) { in colorMergeIfPossibleNextGroup()
1037 for (SDep& SuccDep : SU->Succs) { in colorMergeIfPossibleNextGroupOnlyForReserved()
1069 for (SDep& SuccDep : SU->Succs) { in colorMergeIfPossibleSmallGroupsToNextGroup()
[all …]
H A DSIMachineScheduler.h97 std::vector<std::pair<SIScheduleBlock*, SIScheduleBlockLinkKind>> Succs; variable
121 getSuccs() const { return Succs; } in getSuccs()
H A DR600Packetizer.cpp189 for (unsigned i = 0, e = SUJ->Succs.size(); i < e; ++i) { in isLegalToPacketizeTogether()
190 const SDep &Dep = SUJ->Succs[i]; in isLegalToPacketizeTogether()
/openbsd/gnu/llvm/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 DScheduleDAGRRList.cpp773 for (SDep &Succ : SU->Succs) { in ScheduleNodeBottomUp()
889 for (auto &Succ : SU->Succs) { in UnscheduleNodeBottomUp()
903 for (auto &Succ2 : SU->Succs) { in UnscheduleNodeBottomUp()
1073 for (SDep &Succ : SU->Succs) { in TryUnfoldSU()
1201 for (SDep &Succ : SU->Succs) { in CopyAndMoveSuccessors()
1240 for (SDep &Succ : SU->Succs) { in InsertCopiesAndMoveSuccs()
2356 for (const SDep &Succ : SU->Succs) { in closestSucc()
2407 for (const SDep &Succ : SU->Succs) { in hasOnlyLiveOutUses()
2874 for (const SDep &Succ : SU->Succs) { in canClobberReachingPhysRegUse()
3052 SDep Edge = PredSU->Succs[i]; in PrescheduleNodesWithMultipleUses()
[all …]
H A DScheduleDAGFast.cpp188 for (SDep &Succ : SU->Succs) { in ScheduleNodeBottomUp()
287 for (SDep &Succ : SU->Succs) { in CopyAndMoveSuccessors()
355 for (SDep &Succ : SU->Succs) { in CopyAndMoveSuccessors()
391 for (SDep &Succ : SU->Succs) { in InsertCopiesAndMoveSuccs()
548 assert(RootSU->Succs.empty() && "Graph root shouldn't have successors!"); in ListScheduleBottomUp()
/openbsd/gnu/llvm/llvm/lib/Transforms/Utils/
H A DSCCPSolver.cpp869 Succs.resize(TI.getNumSuccessors()); in getFeasibleSuccessors()
872 Succs[0] = true; in getFeasibleSuccessors()
882 Succs[0] = Succs[1] = true; in getFeasibleSuccessors()
887 Succs[CI->isZero()] = true; in getFeasibleSuccessors()
893 Succs.assign(TI.getNumSuccessors(), true); in getFeasibleSuccessors()
899 Succs[0] = true; in getFeasibleSuccessors()
915 Succs[Case.getSuccessorIndex()] = true; in getFeasibleSuccessors()
925 Succs.assign(TI.getNumSuccessors(), true); in getFeasibleSuccessors()
938 Succs.assign(TI.getNumSuccessors(), true); in getFeasibleSuccessors()
948 Succs[i] = true; in getFeasibleSuccessors()
[all …]
/openbsd/gnu/llvm/llvm/lib/Transforms/Vectorize/
H A DVPlan.cpp403 SmallVector<VPBlockBase *, 2> Succs(successors()); in splitAt() local
405 for (VPBlockBase *Succ : Succs) in splitAt()
413 for (VPBlockBase *Succ : Succs) in splitAt()
825 std::vector<BasicBlock *> Succs(succ_begin(BB), succ_end(BB)); in updateDominatorTree() local
826 assert(Succs.size() <= 2 && in updateDominatorTree()
828 PostDomSucc = Succs[0]; in updateDominatorTree()
829 if (Succs.size() == 1) { in updateDominatorTree()
835 BasicBlock *InterimSucc = Succs[1]; in updateDominatorTree()
837 PostDomSucc = Succs[1]; in updateDominatorTree()
838 InterimSucc = Succs[0]; in updateDominatorTree()
/openbsd/gnu/llvm/clang/include/clang/Analysis/
H A DCFG.h843 AdjacentBlocks Succs; variable
862 Succs(C, 1), HasNoReturnElement(false), Parent(parent) {} in CFGBlock()
955 succ_iterator succ_begin() { return Succs.begin(); } in succ_begin()
956 succ_iterator succ_end() { return Succs.end(); } in succ_end()
957 const_succ_iterator succ_begin() const { return Succs.begin(); } in succ_begin()
958 const_succ_iterator succ_end() const { return Succs.end(); } in succ_end()
960 succ_reverse_iterator succ_rbegin() { return Succs.rbegin(); } in succ_rbegin()
961 succ_reverse_iterator succ_rend() { return Succs.rend(); } in succ_rend()
962 const_succ_reverse_iterator succ_rbegin() const { return Succs.rbegin(); } in succ_rbegin()
963 const_succ_reverse_iterator succ_rend() const { return Succs.rend(); } in succ_rend()
[all …]
/openbsd/gnu/llvm/llvm/lib/Target/Hexagon/
H A DHexagonSubtarget.cpp274 for (SDep &SI : SU.Succs) { in apply()
471 for (const auto &DDep : Dst->Succs) { in adjustSchedDependency()
559 for (auto &I : Src->Succs) { in restoreLatency()
607 for (auto &I : Src->Succs) { in changeLatency()
654 if (getZeroLatency(Dst, Dst->Succs) != nullptr) in isBestZeroLatency()
663 DstBest = getZeroLatency(Src, Src->Succs); in isBestZeroLatency()
710 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 DHexagonVLIWPacketizer.cpp935 for (unsigned i = 0; i < PacketSU->Succs.size(); ++i) { in restrictingDepExistInPacket()
936 auto &Dep = PacketSU->Succs[i]; in restrictingDepExistInPacket()
999 for (unsigned i = 0; i < PacketSU->Succs.size(); ++i) { in arePredicatesComplements()
1000 auto Dep = PacketSU->Succs[i]; in arePredicatesComplements()
1409 for (unsigned i = 0; i < SUJ->Succs.size(); ++i) { in isLegalToPacketizeTogether()
1413 if (SUJ->Succs[i].getSUnit() != SUI) in isLegalToPacketizeTogether()
1416 SDep::Kind DepType = SUJ->Succs[i].getKind(); in isLegalToPacketizeTogether()
1435 DepReg = SUJ->Succs[i].getReg(); in isLegalToPacketizeTogether()
1442 if (!isCallDependent(I, DepType, SUJ->Succs[i].getReg())) in isLegalToPacketizeTogether()
/openbsd/gnu/llvm/clang/lib/StaticAnalyzer/Core/
H A DExplodedGraph.cpp207 V->Succs.addNode(this, G); in addPredecessor()
525 for (ExplodedNode::succ_iterator I = N->Succs.begin(), E = N->Succs.end(); in trim()

123