/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/Analysis/ |
D | SparsePropagation.h | 191 void getFeasibleSuccessors(Instruction &TI, SmallVectorImpl<bool> &Succs, 288 Instruction &TI, SmallVectorImpl<bool> &Succs, bool AggressiveUndef) { in getFeasibleSuccessors() argument 289 Succs.resize(TI.getNumSuccessors()); in getFeasibleSuccessors() 295 Succs[0] = true; in getFeasibleSuccessors() 310 Succs[0] = Succs[1] = true; in getFeasibleSuccessors() 323 Succs[0] = Succs[1] = true; in getFeasibleSuccessors() 328 Succs[C->isNullValue()] = true; in getFeasibleSuccessors() 334 Succs.assign(Succs.size(), true); in getFeasibleSuccessors() 349 Succs.assign(TI.getNumSuccessors(), true); in getFeasibleSuccessors() 361 Succs.assign(TI.getNumSuccessors(), true); in getFeasibleSuccessors() [all …]
|
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/CodeGen/ |
D | ScheduleDAG.cpp | 122 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() 185 assert(Succ != N->Succs.end() && "Mismatching preds / succs lists!"); 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() [all …]
|
D | LatencyPriorityQueue.cpp | 77 for (SUnit::const_succ_iterator I = SU->Succs.begin(), E = SU->Succs.end(); in push() 93 for (SUnit::const_succ_iterator I = SU->Succs.begin(), E = SU->Succs.end(); in scheduledNode()
|
D | MacroFusion.cpp | 58 for (SDep &SI : FirstSU.Succs) in fuseInstructionPair() 83 for (SDep &SI : FirstSU.Succs) in fuseInstructionPair() 100 for (const SDep &SI : FirstSU.Succs) { in fuseInstructionPair() 126 if (SU.Succs.empty()) in fuseInstructionPair()
|
D | MachinePipeliner.cpp | 611 for (auto &SI : SU->Succs) { in isSuccOrder() 1148 for (auto &SI : SUnits[i].Succs) { in createAdjacencyStructure() 1319 for (auto &Dep : PHISUs[Index]->Succs) { in apply() 1408 for (SUnit::const_succ_iterator IS = SU->Succs.begin(), in computeNodeFunctions() 1409 ES = SU->Succs.end(); in computeNodeFunctions() 1462 for (SUnit::const_succ_iterator IS = (*I)->Succs.begin(), in pred_L() 1463 ES = (*I)->Succs.end(); in pred_L() 1480 SmallSetVector<SUnit *, 8> &Succs, in succ_L() argument 1482 Succs.clear(); in succ_L() 1485 for (SUnit::succ_iterator SI = (*I)->Succs.begin(), SE = (*I)->Succs.end(); in succ_L() [all …]
|
D | TailDuplicator.cpp | 164 SmallSetVector<MachineBasicBlock *, 8> Succs(MBB->succ_begin(), in tailDuplicateAndUpdate() local 182 updateSuccessorsPHIs(MBB, isDead, TDBBs, Succs); in tailDuplicateAndUpdate() 470 SmallSetVector<MachineBasicBlock *, 8> &Succs) { in updateSuccessorsPHIs() argument 471 for (MachineBasicBlock *SuccBB : Succs) { in updateSuccessorsPHIs() 709 SmallPtrSet<MachineBasicBlock *, 8> Succs(TailBB->succ_begin(), in duplicateSimpleBB() local 718 if (bothUsedInPHI(*PredBB, Succs)) in duplicateSimpleBB()
|
D | WasmEHPrepare.cpp | 192 SmallVector<BasicBlock *, 4> Succs(succ_begin(BB), succ_end(BB)); in prepareThrows() local 197 eraseDeadBBsAndChildren(Succs); in prepareThrows()
|
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Target/AMDGPU/ |
D | AMDGPUSubtarget.cpp | 792 for (const SDep &SI : SUa->Succs) { in apply() 825 SmallVector<const SUnit*, 64> Succs({Succ}), Preds({Pred}); in canAddEdge() local 827 for (unsigned I = 0; I < Succs.size(); ++I) { in canAddEdge() 828 for (const SDep &SI : Succs[I]->Succs) { in canAddEdge() 830 if (SU != Succs[I] && llvm::find(Succs, SU) == Succs.end()) in canAddEdge() 831 Succs.push_back(SU); in canAddEdge() 838 if (llvm::find(Succs, SU) != Succs.end()) in canAddEdge() 867 for (SDep &SI : From->Succs) { in linkSALUChain() 873 for (SDep &SI : SU->Succs) { in linkSALUChain()
|
D | GCNMinRegStrategy.cpp | 94 for (auto SDep : SU->Succs) { in getReadySuccessors() 110 return SU->Succs.size() - getReadySuccessors(SU); in getNotReadySuccessors() 185 for (const auto &S : SchedSU->Succs) { in bumpPredsPriority() 221 for (const auto &S : SU->Succs) { in releaseSuccessors()
|
D | SIMachineScheduler.cpp | 443 for (SDep& Succ : SU->Succs) { in undoSchedule() 484 for (SDep& Succ : SU->Succs) { in releaseSuccessors() 516 for (SDep& Succ : SU->Succs) { in nodeScheduled() 547 assert(none_of(Succs, in addPred() 560 for (std::pair<SIScheduleBlock*, SIScheduleBlockLinkKind> &S : Succs) { in addSucc() 570 Succs.push_back(std::make_pair(Succ, Kind)); in addSucc() 591 for (std::pair<SIScheduleBlock*, SIScheduleBlockLinkKind> S : Succs) { in printDebug() 861 for (SDep& SuccDep : SU->Succs) { in colorComputeReservedDependencies() 945 for (SDep& SuccDep : SU->Succs) { in colorEndsAccordingToDependencies() 1015 for (SDep& SuccDep : SU->Succs) { in colorMergeConstantLoadsNextGroup() [all …]
|
D | SIMachineScheduler.h | 100 std::vector<std::pair<SIScheduleBlock*, SIScheduleBlockLinkKind>> Succs; variable 124 getSuccs() const { return Succs; } in getSuccs()
|
D | R600Packetizer.cpp | 194 for (unsigned i = 0, e = SUJ->Succs.size(); i < e; ++i) { in isLegalToPacketizeTogether() 195 const SDep &Dep = SUJ->Succs[i]; in isLegalToPacketizeTogether()
|
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Target/WebAssembly/ |
D | WebAssemblyLateEHPrepare.cpp | 93 SmallVector<MachineBasicBlock *, 4> Succs(MBB->succ_begin(), in eraseDeadBBsAndChildren() local 96 for (auto *Succ : Succs) in eraseDeadBBsAndChildren() 199 SmallVector<MachineBasicBlock *, 8> Succs(MBB.succ_begin(), in removeUnnecessaryUnreachables() local 201 for (auto *Succ : Succs) in removeUnnecessaryUnreachables() 204 eraseDeadBBsAndChildren(Succs); in removeUnnecessaryUnreachables()
|
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Target/Hexagon/ |
D | HexagonMachineScheduler.cpp | 70 if (SUd->Succs.size() == 0) in hasDependence() 80 for (const auto &S : SUd->Succs) { in hasDependence() 310 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end(); in releaseBottomNode() 540 for (auto &Succ : SU->Succs) { in isSingleUnscheduledSucc() 646 for (const SDep &SI : SU->Succs) in SchedulingCost() 715 for (const SDep &SI : SU->Succs) { in SchedulingCost() 740 for (const auto &SI : SU->Succs) { in SchedulingCost() 836 CurrSize = (*I)->Succs.size(); in pickNodeFromQueue() 837 CandSize = Candidate.SU->Succs.size(); in pickNodeFromQueue()
|
D | HexagonSubtarget.cpp | 152 for (SDep &SI : SU.Succs) { in apply() 348 MachineInstr *DDst = Dst->Succs[0].getSUnit()->getInstr(); in adjustSchedDependency() 420 for (auto &I : Src->Succs) { in restoreLatency() 459 for (auto &I : Src->Succs) { in changeLatency() 506 if (getZeroLatency(Dst, Dst->Succs) != nullptr) in isBestZeroLatency() 515 DstBest = getZeroLatency(Src, Src->Succs); in isBestZeroLatency() 562 for (auto &I : SrcBest->Succs) in isBestZeroLatency()
|
D | HexagonHazardRecognizer.cpp | 143 for (auto &S : SU->Succs) in EmitInstruction() 158 for (auto &S : SU->Succs) in EmitInstruction()
|
D | HexagonVLIWPacketizer.cpp | 928 for (unsigned i = 0; i < PacketSU->Succs.size(); ++i) { in restrictingDepExistInPacket() 929 auto &Dep = PacketSU->Succs[i]; in restrictingDepExistInPacket() 992 for (unsigned i = 0; i < PacketSU->Succs.size(); ++i) { in arePredicatesComplements() 993 auto Dep = PacketSU->Succs[i]; in arePredicatesComplements() 1396 for (unsigned i = 0; i < SUJ->Succs.size(); ++i) { in isLegalToPacketizeTogether() 1400 if (SUJ->Succs[i].getSUnit() != SUI) in isLegalToPacketizeTogether() 1403 SDep::Kind DepType = SUJ->Succs[i].getKind(); in isLegalToPacketizeTogether() 1422 DepReg = SUJ->Succs[i].getReg(); in isLegalToPacketizeTogether() 1429 if (!isCallDependent(I, DepType, SUJ->Succs[i].getReg())) in isLegalToPacketizeTogether()
|
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/CodeGen/SelectionDAG/ |
D | ResourcePriorityQueue.cpp | 107 for (const SDep &Succ : SU->Succs) { in numberRCValSuccInSU() 144 for (const SDep &Succ : SU->Succs) in numberCtrlDepsInSU() 229 for (const SDep &Succ : SU->Succs) in push() 268 for (const SDep &Succ : Packet[i]->Succs) { in isResourceAvailable() 513 for (const SDep &Succ : SU->Succs) { in scheduledNode() 530 HorizontalVerticalBalance += (SU->Succs.size() - numberCtrlDepsInSU(SU)); in scheduledNode()
|
D | ScheduleDAGVLIW.cpp | 139 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end(); in releaseSuccessors()
|
D | ScheduleDAGRRList.cpp | 770 for (SDep &Succ : SU->Succs) { in ScheduleNodeBottomUp() 886 for (auto &Succ : SU->Succs) { in UnscheduleNodeBottomUp() 900 for (auto &Succ2 : SU->Succs) { in UnscheduleNodeBottomUp() 1070 for (SDep &Succ : SU->Succs) { in TryUnfoldSU() 1198 for (SDep &Succ : SU->Succs) { in CopyAndMoveSuccessors() 1237 for (SDep &Succ : SU->Succs) { in InsertCopiesAndMoveSuccs() 1604 assert(RootSU->Succs.empty() && "Graph root shouldn't have successors!"); in ListScheduleBottomUp() 2267 if (PredSU->NumSuccsLeft != PredSU->Succs.size()) in unscheduledNode() 2329 for (const SDep &Succ : SU->Succs) { in closestSucc() 2380 for (const SDep &Succ : SU->Succs) { in hasOnlyLiveOutUses() [all …]
|
D | ScheduleDAGFast.cpp | 192 for (SDep &Succ : SU->Succs) { in ScheduleNodeBottomUp() 291 for (SDep &Succ : SU->Succs) { in CopyAndMoveSuccessors() 359 for (SDep &Succ : SU->Succs) { in CopyAndMoveSuccessors() 395 for (SDep &Succ : SU->Succs) { in InsertCopiesAndMoveSuccs() 533 assert(RootSU->Succs.empty() && "Graph root shouldn't have successors!"); in ListScheduleBottomUp()
|
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/IPO/ |
D | PruneEH.cpp | 263 std::vector<BasicBlock *> Succs(succ_begin(BB), succ_end(BB)); in DeleteBasicBlock() local 265 for (unsigned i = 0, e = Succs.size(); i != e; ++i) in DeleteBasicBlock() 266 Succs[i]->removePredecessor(BB); in DeleteBasicBlock()
|
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/Vectorize/ |
D | VPlan.cpp | 488 std::vector<BasicBlock *> Succs(succ_begin(BB), succ_end(BB)); in updateDominatorTree() local 489 assert(Succs.size() <= 2 && in updateDominatorTree() 491 PostDomSucc = Succs[0]; in updateDominatorTree() 492 if (Succs.size() == 1) { in updateDominatorTree() 498 BasicBlock *InterimSucc = Succs[1]; in updateDominatorTree() 500 PostDomSucc = Succs[1]; in updateDominatorTree() 501 InterimSucc = Succs[0]; in updateDominatorTree()
|
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/Scalar/ |
D | SCCP.cpp | 574 void getFeasibleSuccessors(Instruction &TI, SmallVectorImpl<bool> &Succs); 668 SmallVectorImpl<bool> &Succs) { in getFeasibleSuccessors() argument 669 Succs.resize(TI.getNumSuccessors()); in getFeasibleSuccessors() 672 Succs[0] = true; in getFeasibleSuccessors() 682 Succs[0] = Succs[1] = true; in getFeasibleSuccessors() 687 Succs[CI->isZero()] = true; in getFeasibleSuccessors() 693 Succs.assign(TI.getNumSuccessors(), true); in getFeasibleSuccessors() 699 Succs[0] = true; in getFeasibleSuccessors() 708 Succs.assign(TI.getNumSuccessors(), true); in getFeasibleSuccessors() 712 Succs[SI->findCaseValue(CI)->getSuccessorIndex()] = true; in getFeasibleSuccessors() [all …]
|
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/CodeGen/ |
D | TailDuplicator.h | 111 SmallSetVector<MachineBasicBlock *, 8> &Succs);
|